<?xml version="1.0" encoding="utf-8"?>
<posts>
  <row Id="1" PostTypeId="1" CreationDate="2011-01-27T20:54:21.880" Score="11" ViewCount="682" Body="&lt;p&gt;The &lt;a href=&quot;http://area51.stackexchange.com/proposals/4570/code-golf-programming-puzzles&quot;&gt;original proposal&lt;/a&gt; is for &quot;Code Golf and Programming Puzzles&quot;. I think this suggests that discussion of questions from programming contests should indeed be on-topic---as long as they're not discussed until the conclusion of the contest, of course.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This question serves as a placeholder for official policy in this area, as well as what kind of timeframes we should enforce on such questions (e.g., discussion of active contest questions should probably be disallowed).&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="39" LastEditDate="2011-01-31T22:42:18.737" LastActivityDate="2011-02-05T02:05:22.020" Title="Are questions from Google Code Jam, TopCoder, etc. on-topic?" Tags="|discussion|policy|scope|" AnswerCount="2" CommentCount="8" ContentLicense="CC BY-SA 2.5" />
  <row Id="2" PostTypeId="1" CreationDate="2011-01-27T20:55:52.600" Score="5" ViewCount="298" Body="&lt;p&gt;&lt;strong&gt;How should our FAQ look like?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One suggestion per answer.&lt;/p&gt;&#xA;" OwnerUserId="8" LastEditorUserId="3808" LastEditDate="2014-08-20T03:07:41.043" LastActivityDate="2014-08-20T03:07:41.043" Title="How should our FAQ look like?" Tags="|discussion|" AnswerCount="4" CommentCount="3" ContentLicense="CC BY-SA 2.5" />
  <row Id="3" PostTypeId="2" ParentId="2" CreationDate="2011-01-27T21:03:19.423" Score="5" Body="&lt;p&gt;&lt;strong&gt;What is a code golf?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A code golf is a challenge to solve the problem using the shortest code possible. Different contests use different criteria:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Shortest source code, or shortest any code (including object code)? The former will usually exclude assembly-language entries.&lt;/li&gt;&#xA;&lt;li&gt;Is the length counted in bytes or Unicode code points (or something else :-O)?&lt;/li&gt;&#xA;&lt;li&gt;How are shell-bang lines counted? How are any command-line arguments required counted?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3" LastActivityDate="2011-01-27T21:03:19.423" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="4" PostTypeId="2" ParentId="2" CreationDate="2011-01-27T21:09:22.957" Score="1" Body="&lt;p&gt;&lt;strong&gt;Should subjective questions be encouraged?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[Replace this with actual policy once we have it. Discussion follows.]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code golf is clear-cut (to a point; see &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2/how-should-our-faq-look-like/3#3&quot;&gt;this post&lt;/a&gt; for more details): as long as the rules are unambiguous, it's clear to see which entry wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, a number of early questions on this site sought &quot;creative&quot; solutions. This is much more subjective to judge, and could simply become a &quot;whatever the OP likes best&quot; question, which is not what Stack Exchange is designed for, IMO.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, we should have a policy on what level of subjectiveness should be encouraged, and/or allowed.&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.800" LastActivityDate="2011-01-27T21:09:22.957" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="5" PostTypeId="1" CreationDate="2011-01-27T21:12:06.730" Score="13" ViewCount="452" Body="&lt;p&gt;The area51 proposal was titled &quot;Code Golf &amp;amp; Programming Challenges&quot; and the discussion on area51 even nudged towards making it just &quot;Programming Challenges&quot; so that it has wider scope. Yet the title here is &quot;Code Golf&quot; and the domain codegolf.se.com.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why the sudden shift back to Code Golf only? Should we change it to Programming Challenges?&lt;/p&gt;&#xA;" OwnerUserId="39" LastEditorUserId="66833" LastEditDate="2021-06-18T00:28:08.763" LastActivityDate="2021-06-18T00:28:08.763" Title="Site title and domain" Tags="|discussion|scope|site-name|" AnswerCount="7" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="6" PostTypeId="1" CreationDate="2011-01-27T21:13:22.800" Score="4" ViewCount="259" Body="&lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/questions/24242/acceptable-level-of-code-golf-questions/24258#24258&quot;&gt;This answer&lt;/a&gt; on MSO contains a list of rules that code golf challenges on Stackoverflow should follow. I think it would be a good idea to discuss which of those rules we want to adopt for this site. Obviously the bits about frequencies and new users don't apply here, but others seem sensible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example one of the rules is that the problem as well as the &quot;winning condition&quot; should be clearly specified. I think that one should be pretty uncontroversial.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another rule is that challenges should not be language-specific. Given that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1/just-another-perl-hacker&quot;&gt;the first question on this site&lt;/a&gt; already breaks this rule, this is clearly a bit more controversial. On the one hand I rather like that rule. On the other hand the scope of this site is a lot wider than those of code golfs on Stackoverflow, so maybe that rule is not necessary / too restrictive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, discuss: Which rules should we adopt for this site?&lt;/p&gt;&#xA;" OwnerUserId="30" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2011-03-09T01:10:44.487" Title="What should be the rules for questions on this site" Tags="|discussion|" AnswerCount="5" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="7" PostTypeId="2" ParentId="6" CreationDate="2011-01-27T21:17:02.017" Score="2" Body="&lt;p&gt;I do agree with generally trying to be language-agnostic. (Say I, who created the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-agnostic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-agnostic&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-agnostic&lt;/a&gt; tag on SO!)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also think questions need to have (some shade of) objective criteria for deciding which entry is &quot;best&quot;. It absolutely can't simply be &quot;whatever the OP likes best&quot; or even &quot;whatever the voters like best&quot;, because then it's just a popularity contest, which is not what Stack Exchange is designed for.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2011-01-27T21:17:02.017" CommentCount="5" ContentLicense="CC BY-SA 2.5" />
  <row Id="8" PostTypeId="2" ParentId="6" CreationDate="2011-01-27T21:20:05.057" Score="4" Body="&lt;p&gt;This is more of a meta answer, but hopefully still useful. Here are some ideas I have:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Add rules to the faq.&lt;/li&gt;&#xA;&lt;li&gt;Have one general set of rules, but allow questioners to specify adaptations to the rules. Maybe a set of standard categories, where the questioner can tag his/her choice? Maybe use tag wikis for this.&lt;/li&gt;&#xA;&lt;li&gt;I don't see what's wrong restricting to one language. Sometimes it's fun doing a vim-golf or java-golf, etc. Otherwise it will be the same small set of languages always winning.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="39" LastActivityDate="2011-01-27T21:20:05.057" CommentCount="4" ContentLicense="CC BY-SA 2.5" />
  <row Id="9" PostTypeId="1" CreationDate="2011-01-27T21:21:32.573" Score="16" ViewCount="2761" Body="&lt;p&gt;If we want to prevent having ridiculous answer for Code-Golf with esoteric language that are made up just for the challenge, we need to define what are the acceptable programming language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The boundary I would think of are the following (note that those are just up there as an example):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Does the programming language have at least 10 page of documentation about it ?&lt;/li&gt;&#xA;&lt;li&gt;Does the programming language can do anything else than the challenge for which it's made up.&lt;/li&gt;&#xA;&lt;li&gt;Can you find at least a project using that language on the web ?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="54" LastActivityDate="2015-09-08T15:00:28.843" Title="What programming language should we consider for the code-golf solution ?" Tags="|discussion|" AnswerCount="6" CommentCount="6" ClosedDate="2016-03-04T16:46:19.583" ContentLicense="CC BY-SA 2.5" />
  <row Id="10" PostTypeId="2" ParentId="9" CreationDate="2011-01-27T21:25:04.647" Score="31" Body="&lt;p&gt;I think that as long as a compiler was released before the question was asked, it is a valid language. This removes stupid answers such as &quot;I created language X with this command Y that solves this in one character&quot;.&lt;/p&gt;&#xA;" OwnerUserId="39" LastActivityDate="2011-01-27T21:25:04.647" CommentCount="30" ContentLicense="CC BY-SA 2.5" />
  <row Id="11" PostTypeId="2" ParentId="9" CreationDate="2011-01-27T21:25:31.383" Score="3" Body="&lt;p&gt;My feeling is that it's best to implement &quot;soft&quot; site-wide policies like not using built-in features of languages that automatically solve the bulk of the problem. For example, we might disallow using &lt;code&gt;h&lt;/code&gt; in GoRuby for a Hello World problem, or using the built-in Easter-calculation functions in PHP for an Easter problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That way, you can use an esoteric language if you like---as long as you're not using a built-in function to solve the problem in 1 character.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2011-01-27T21:25:31.383" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="12" PostTypeId="2" ParentId="5" CreationDate="2011-01-27T21:27:33.817" Score="0" Body="&lt;p&gt;Good question. I was surprised to see the codegolf domain when I received the beta email.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Having said that however I cannot think of a programming challenge (puzzle) that could not be run as a codegolf question so I believe it may be a moot-point.&lt;/p&gt;&#xA;" OwnerUserId="52" LastActivityDate="2011-01-27T21:27:33.817" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="13" PostTypeId="1" AcceptedAnswerId="51" CreationDate="2011-01-27T21:27:35.563" Score="3" ViewCount="329" Body="&lt;p&gt;Should we define rules on how input can be fed into programs? &lt;a href=&quot;https://stackoverflow.com/questions/4609123/code-golf-take-2-inputs-number-and-print-sum-in-c&quot;&gt;This question&lt;/a&gt; on SO allowed for any input method, which resulted in answers which ripped off the question by doing the computation in macros for example. We should aim to prevent this abuse.&lt;/p&gt;&#xA;" OwnerUserId="39" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2017-05-22T17:08:10.770" Title="What input methods should we allow for Code Golfs?" Tags="|discussion|code-golf|" AnswerCount="2" CommentCount="4" FavoriteCount="0" ClosedDate="2016-04-26T12:37:00.547" ContentLicense="CC BY-SA 2.5" />
  <row Id="14" PostTypeId="1" CreationDate="2011-01-27T21:53:43.217" Score="2" ViewCount="216" Body="&lt;p&gt;Isn't &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; going to be applicable to all questions? Therefore, shouldn't we delete it and related tags?&lt;/p&gt;&#xA;" OwnerUserId="39" LastActivityDate="2011-01-28T17:38:52.800" Title="Is [code-challenge] necessary?" Tags="|discussion|tags|" AnswerCount="3" CommentCount="4" ContentLicense="CC BY-SA 2.5" />
  <row Id="15" PostTypeId="2" ParentId="14" CreationDate="2011-01-27T21:55:48.673" Score="4" Body="&lt;p&gt;Agree. I think tags like &lt;code&gt;code-challenge&lt;/code&gt; and &lt;code&gt;code-golf&lt;/code&gt; are more or less redundant for this site.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2011-01-27T21:55:48.673" CommentCount="7" ContentLicense="CC BY-SA 2.5" />
  <row Id="16" PostTypeId="1" CreationDate="2011-01-27T21:58:48.547" Score="16" ViewCount="628" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1/are-questions-from-google-code-jam-topcoder-etc-on-topic&quot;&gt;Related question.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Questions from Facebook Puzzles, Project Euler, UVa, SPOJ, and the like do not expire, unlike Google Code Jam or TopCoder. Therefore, in order to be able to discuss such problems without ruining the challenge, we need some guidelines on how far we can discuss them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This post is for discussing what these guidelines should be.&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2014-02-24T10:13:16.443" Title="What are the policies for threads relating to Facebook Puzzles, Project Euler, UVa, SPOJ, etc.?" Tags="|discussion|policy|" AnswerCount="4" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="17" PostTypeId="2" ParentId="1" CreationDate="2011-01-27T22:03:58.713" Score="2" Body="&lt;p&gt;Answer on this question is rather obvious for me.&lt;br&gt;&#xA;We may not to ask (and may close) questions which can be used for contests:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Unexpiring: &lt;em&gt;Yesterday I registered on this contest site, today searched all this stackexchange and tomorrow I will be at &lt;strong&gt;the top of scoreboard&lt;/strong&gt;! Yeay!!1&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;Expiring: &lt;em&gt;Hey I &lt;strong&gt;want to win&lt;/strong&gt; this contest! I have two days to the end! Help me!&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;But!&lt;/strong&gt; If it is unexpiring contest (such as ProjectEuler), we can discuss solution in way of pseudocode and textual algorithm describing, diagrams etc. instead of code posting. It's just to make man to be able to discuss, research and write on his own, not just copy-pate-F9.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And if contest is already &lt;strong&gt;over and doesn't have any working scoreboard&lt;/strong&gt; (like ICFPC, but don't sure about 2010, because they promised to keep it online), we may discuss it on 100% with code and anything else.&lt;/p&gt;&#xA;" OwnerUserId="58" LastActivityDate="2011-01-27T22:03:58.713" CommentCount="3" ContentLicense="CC BY-SA 2.5" />
  <row Id="18" PostTypeId="2" ParentId="16" CreationDate="2011-01-27T22:12:57.833" Score="2" Body="&lt;p&gt;I am of the opinion that if people cheat by Googling for help, then they're only hurting themselves. Sometimes though, I even myself give up on a challenging question and want to read up on the answer. Therefore I don't think we should be too restrictive. The one policy I think we might want to enforce is no full coded solutions, although we should still allow snippets which explain something like a DP solution easier than using mathematical notation would.&lt;/p&gt;&#xA;" OwnerUserId="39" LastActivityDate="2011-01-27T22:12:57.833" CommentCount="6" ContentLicense="CC BY-SA 2.5" />
  <row Id="19" PostTypeId="1" CreationDate="2011-01-27T22:30:50.953" Score="10" ViewCount="680" Body="&lt;p&gt;In some languages using a compiler flag might significantly shorten the source file, by making the compilation command longer. Should we make inclusion of the character count of the flag in the total character count, mandatory?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;EDIT: As mentioned by Chris Jester-Young the -D compiler flag for C/C++ could be game breaking if not included in the count. You could potentially define your whole program in the command line and have a source file that is only 1 character long.&lt;/p&gt;&#xA;" OwnerUserId="62" LastEditorUserId="62" LastEditDate="2011-01-27T23:18:10.397" LastActivityDate="2012-09-06T07:14:09.557" Title="Should non-standard compiler flags be included in character counts?" Tags="|discussion|policy|" AnswerCount="3" CommentCount="2" ClosedDate="2016-09-22T21:25:46.423" ContentLicense="CC BY-SA 2.5" />
  <row Id="20" PostTypeId="1" CreationDate="2011-01-27T22:48:56.693" Score="7" ViewCount="154" Body="&lt;p&gt;As far as I remember, one of (unstrict, as we can see) Area51 rules was that &lt;em&gt;we will not create sites, witch may took part of SO's audience&lt;/em&gt;. For example, by this rule Ruby.stackexchange was declined.&lt;br&gt;&#xA;But today this site was launched and CodeReview was also spotted. So, will moderators migrate &lt;code&gt;codegolf&lt;/code&gt;, &lt;code&gt;puzzle&lt;/code&gt; etc. tag questions here or they may stay a part of &lt;em&gt;history&lt;/em&gt;?&lt;/p&gt;&#xA;" OwnerUserId="58" LastActivityDate="2011-04-09T12:28:28.203" Title="Will golf and puzzle questions migrate here from SO?" Tags="|discussion|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 2.5" />
  <row Id="21" PostTypeId="1" AcceptedAnswerId="41" CreationDate="2011-01-27T22:49:40.033" Score="3" ViewCount="352" Body="&lt;p&gt;&lt;a href=&quot;https://stackoverflow.com/questions/4609123/code-golf-take-2-inputs-number-and-print-sum-in-c&quot;&gt;This question&lt;/a&gt; on SO raised some comments about using undefined behaviour in C/C++ golfing. Should we require that solutions follow the standard? If we do, we could promote down-voting of solutions relying on undefined behaviour.&lt;/p&gt;&#xA;" OwnerUserId="39" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2017-05-22T17:08:18.307" Title="C/C++ golfing: Should undefined behaviour be allowed?" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="1" ClosedDate="2016-08-25T16:44:46.597" ContentLicense="CC BY-SA 2.5" />
  <row Id="22" PostTypeId="2" ParentId="19" CreationDate="2011-01-27T22:58:05.267" Score="11" Body="&lt;p&gt;I think so. Otherwise, people can embed huge amounts of code in a C submission by using &lt;code&gt;-D&lt;/code&gt; to define lots of macros &quot;for free&quot;.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2011-01-27T22:58:05.267" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="23" PostTypeId="1" AcceptedAnswerId="36" CreationDate="2011-01-27T23:04:21.267" Score="11" ViewCount="838" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/4/rot-13-transform-standard-input/11#11&quot;&gt;This answer&lt;/a&gt; used a built-in Python function to solve the question in a very short amount of code. Should we allow it and let people not up-vote, or should we police library abuse to some degree? If the latter, where do we draw the line?&lt;/p&gt;&#xA;" OwnerUserId="39" LastEditorUserId="56656" LastEditDate="2017-05-22T17:08:25.977" LastActivityDate="2017-05-22T17:08:25.977" Title="Use of built-in functions and libraries in Code Golfs" Tags="|discussion|code-golf|" AnswerCount="5" CommentCount="4" ContentLicense="CC BY-SA 2.5" />
  <row Id="24" PostTypeId="2" ParentId="23" CreationDate="2011-01-27T23:09:02.027" Score="4" Body="&lt;p&gt;My take on it is, does the library do the interesting part of the puzzle, or is it just a general helper? For example, using &lt;code&gt;map&lt;/code&gt; or &lt;code&gt;reduce&lt;/code&gt; is perfectly okay, in my book.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2011-01-27T23:09:02.027" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="25" PostTypeId="1" AcceptedAnswerId="46" CreationDate="2011-01-27T23:10:38.937" Score="2" ViewCount="368" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/4/rot-13-transform-standard-input/48#48&quot;&gt;This answer&lt;/a&gt; clearly wasn't golfed, but is still a valid solution to the problem. How should we handle such answers? Should we down-vote them for being long? Should a mod delete them for being off-topic?&lt;/p&gt;&#xA;" OwnerUserId="39" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2011-01-28T01:48:42.453" Title="Code golf answers that aren't golfing attempts" Tags="|discussion|code-golf|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 2.5" />
  <row Id="26" PostTypeId="2" ParentId="23" CreationDate="2011-01-27T23:13:53.980" Score="4" Body="&lt;p&gt;I guess for such trivial things a better answer would be a re-implementation which should be just as golfable as in any other language. Another such example would be to print out numbers in a readable format, where Lisp (iirc) has a built-in function to do so.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Upvoting an answer that actually &lt;em&gt;does&lt;/em&gt; the implementation should probably take care of that. However, technically it still is a shorter solution. Meh.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How often does that happen, though, that there is a single function that essentially does all the golfing for you?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I once had a talk with LiraNuna and he generally had the opinion that trivial golf tasks are boring and a good golf task should be a challenge in any language you might throw at it – ofttimes with a straightforward and a clever solution where it's not immediately obviuos which one is better. So I guess the more successful golf challenges here will not be the ones that simply ask you to add two numbers or print out Hello World.&lt;/p&gt;&#xA;" OwnerUserId="15" LastEditorUserId="15" LastEditDate="2011-01-29T17:16:25.153" LastActivityDate="2011-01-29T17:16:25.153" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="27" PostTypeId="1" CreationDate="2011-01-27T23:24:49.580" Score="2" ViewCount="175" Body="&lt;p&gt;My impression is that meta sites are for questions about using the site. I asked &lt;a href=&quot;https://codegolf.stackexchange.com/questions/31/methods-of-counting-characters-on-various-systems&quot;&gt;this question&lt;/a&gt; to test out a meta-ish type question that was not a puzzle itself, but not about how to use the site either. Is it on-topic there, or should it come here?&lt;/p&gt;&#xA;" OwnerUserId="39" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2011-03-02T17:56:47.440" Title="Non-puzzle, but more meta-ish questions about code-golf that aren't about using the site" Tags="|discussion|meta|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="28" PostTypeId="1" CreationDate="2011-01-27T23:27:08.237" Score="5" ViewCount="217" Body="&lt;p&gt;I thought CW was for making only 1 answer per language, but on SO I saw again and again, that question had two or more answers of the same language.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Should we keep CW-checkbox tradition? If it needs moderators' attention, I can imagine, how big new portion of flags it will be after opening this site.&lt;/li&gt;&#xA;&lt;li&gt;What exactly a purpose of CW in golf is?&lt;/li&gt;&#xA;&lt;li&gt;If we will keep tradition, should we merge same language posts into post with &gt;1 solutions?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="58" LastActivityDate="2011-01-28T00:00:02.467" Title="Should golf questions be a CW and why?" Tags="|discussion|code-golf|community-wiki|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="29" PostTypeId="1" CreationDate="2011-01-27T23:27:46.850" Score="13" ViewCount="169" Body="&lt;p&gt;It would seem to me that with code golf, it will be much easier for legit questions to reach the auto conversion to Community Wiki due to the number of answers (multiple languages, multiple attempts in each language).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we/can we have this limit increased if this proves to be the case?&lt;/p&gt;&#xA;" OwnerUserId="52" LastActivityDate="2011-01-27T23:35:34.643" Title="Auto CW limit (number of answers)" Tags="|discussion|community-wiki|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="30" PostTypeId="2" ParentId="27" CreationDate="2011-01-27T23:29:45.457" Score="2" Body="&lt;p&gt;I'm half-half, but I think such questions could have their place on the main site. Meta sites are more about usage of the site, not about how to come up with better answers. Other examples I can think of:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is code golfing the practice of elegance or obfuscation? (5 on-topic votes on area51 proposal)&lt;/li&gt;&#xA;&lt;li&gt;Tools to automate the shortening of code&lt;/li&gt;&#xA;&lt;li&gt;I see a lot of code golf answers using X. What does this mean? (might be better suited to SO)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="39" LastActivityDate="2011-01-27T23:29:45.457" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="31" PostTypeId="2" ParentId="28" CreationDate="2011-01-27T23:32:05.190" Score="13" Body="&lt;p&gt;No, golf questions should not be CW. Code golf is the raison d'etre for this site, and if we CW'd golf questions, nobody would get any rep for anything useful.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On Stack Overflow, CW for code golf was used because it wasn't a &quot;real&quot; question on SO, and people felt that it'd be better for people to get rep only for answers to real questions. On this site, code golf is indeed &quot;real&quot;.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2011-01-27T23:32:05.190" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="32" PostTypeId="2" ParentId="29" CreationDate="2011-01-27T23:32:45.410" Score="0" Body="&lt;p&gt;It probably will be an issue, but I think we'll have to observe this over time to see if it's necessary and how far to push it up. I'm fairly sure it can be done.&lt;/p&gt;&#xA;" OwnerUserId="39" LastActivityDate="2011-01-27T23:32:45.410" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="33" PostTypeId="2" ParentId="29" CreationDate="2011-01-27T23:35:34.643" Score="20" Body="&lt;p&gt;Some history: the auto-CW thing was instituted because I used my &lt;a href=&quot;https://stackoverflow.com/questions/62188&quot;&gt;Stack overflow code golf&lt;/a&gt; question as a vehicle for rep-whoring (since getting rep via code golf used to be much easier than via &quot;real&quot; questions, back when there wasn't an explicit ban on non-CW golf questions). In fact, the person who asked for that feature specifically linked to my post as a reason. :-P&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is obviously irrelevant for this site, so I'd advocate that auto-CW be removed entirely.&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2011-01-27T23:35:34.643" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="34" PostTypeId="2" ParentId="28" CreationDate="2011-01-27T23:35:45.920" Score="18" Body="&lt;ol&gt;&#xA;&lt;li&gt;I don't believe we have any need for CW on this site.&lt;/li&gt;&#xA;&lt;li&gt;CW made sense on SO to stop rep hores, but since code golf is the core focus of this site I don't think there is a purpose.&lt;/li&gt;&#xA;&lt;li&gt;Definitely not.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="39" LastActivityDate="2011-01-27T23:35:45.920" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="35" PostTypeId="2" ParentId="23" CreationDate="2011-01-27T23:36:26.440" Score="13" Body="&lt;p&gt;This has come up on a number of Code Golf questions on Stack Overflow, but the one I remember the most is &lt;a href=&quot;https://stackoverflow.com/questions/3584307/code-golf-calculate-orthodox-easter-date&quot;&gt;Code Golf: Calculate Orthodox Easter date&lt;/a&gt;, where someone was lambasted for using Mathematica's built-in &lt;code&gt;EasterSundayGreekOrthodox&lt;/code&gt; function. One should check out the discussions already had about this issue on Stack Overflow.&lt;/p&gt;&#xA;&lt;p&gt;But certain languages derive their power from their large cores or standard libraries: PHP and Python are two notable examples. Let them be: Code Golf involves finding the most innovative solution with the shortest amount of code; if that involves using the standard library, why &lt;em&gt;wouldn't&lt;/em&gt; you allow it?&lt;/p&gt;&#xA;&lt;p&gt;David Sirlin wrote a series of essays entitled &lt;a href=&quot;http://www.sirlin.net/ptw&quot; rel=&quot;nofollow noreferrer&quot;&gt;Playing to Win&lt;/a&gt;: in it, he has some helpful advice about &lt;a href=&quot;http://www.sirlin.net/ptw-book/how-far-should-you-go-to-win.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;competing using all tools available&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Mysteriously, some games do expect the player to divine the will of the designer, and expect him to adhere to a set of behavioral rules on top of the actual rules of the game. This is the fundamentally flawed concept embraced by most massively-multiplayer online games. Consider World of Warcraft as an example. In a town, you can go on rooftops and you can fight against other players, but you can’t fight other players while on rooftops, or you’ll receive a warning. [...] You can kill the same monster all day every day to “farm” in-game money for yourself (in fact you practically have to), but you can’t farm “too much” or you’re labeled as a gold-farmer and banned. [...] The complex web of made-up rules is not unlike the shackling self-imposed rulebook of the scrub.&lt;/p&gt;&#xA;&lt;p&gt;I’m here to tell you that legitimate competitive games are not like this. Reasonable games have built-in rules and simply do not allow illegal moves to happen in the first place. Tournaments for reasonable games sometimes have to impose extra rules, but they keep this list as clear and as short as possible. [...]&lt;/p&gt;&#xA;&lt;p&gt;So what lengths should a player go to in order to win? A player should use any tournament legal move available to him that maximizes his chances of winning the game. Whether certain moves or tactics should be legal in a tournament is a totally separate issue that we’ll get to later. For now, the issue at hand is that if it’s legal in a tournament, it’s part of the game, period. Players often fault other players for “cheating” or playing “dishonestly” when they use tactics that should not be allowed in a tournament, often because they are exploits of bugs. The player is never at fault. The player is merely trying to win with all tools available to him and should not be expected to pull his punches.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerDisplayName="user86" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2011-01-27T23:36:26.440" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="36" PostTypeId="2" ParentId="23" CreationDate="2011-01-27T23:52:46.847" Score="11" Body="&lt;p&gt;I'd suggest a certain amount of common sense here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using &lt;code&gt;eval&lt;/code&gt; to implement a interpreter is an &lt;em&gt;uninteresting&lt;/em&gt; solution to code golf, likewise the &lt;code&gt;EasterSundayGreekOrthodox&lt;/code&gt; situation that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/23/use-of-built-in-functions-and-libraries-in-code-golfs/35#35&quot;&gt;Mark mentions&lt;/a&gt;, and Jon's joke language which is defined with a single character token for implementing the solution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But taking advantage of any general purpose built-in or any general purpose (standard or non-standard) libraries seems fine to me. Why would you leave them out?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Probably this means I'll never &quot;win&quot;, cause I pretty much use c, fortran 77 and awk for code golf. Cest la Vie.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2011-01-27T23:52:46.847" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="37" PostTypeId="2" ParentId="19" CreationDate="2011-01-27T23:58:11.160" Score="2" Body="&lt;p&gt;The big difficulty here follows from defining &quot;non-standard&quot;. Presumably I &lt;em&gt;am&lt;/em&gt; allowed &lt;code&gt;gcc --std=c99&lt;/code&gt; because that &lt;em&gt;is&lt;/em&gt; standard, but what if I want &lt;code&gt;-funsigned-char&lt;/code&gt;? The later tells gcc to use a valid (i.e. acceptable to the standard) interpretation of the source, just not the one gcc &lt;em&gt;usually&lt;/em&gt; uses. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In or out?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And gcc has a &lt;em&gt;lot&lt;/em&gt; of those kinds of options.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="78" LastEditDate="2011-03-27T20:13:07.640" LastActivityDate="2011-03-27T20:13:07.640" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="38" PostTypeId="2" ParentId="28" CreationDate="2011-01-28T00:00:02.467" Score="2" Body="&lt;p&gt;I just posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/54/tips-for-golfing-in-python/55&quot;&gt;this question&lt;/a&gt;, which could be an example of where CW could be useful here (assuming we accept it as on-topic).&lt;/p&gt;&#xA;" OwnerUserId="39" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2011-01-28T00:00:02.467" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="39" PostTypeId="2" ParentId="25" CreationDate="2011-01-28T00:00:41.953" Score="2" Body="&lt;p&gt;A solution that was un-golfed in that it was readable. I'd probably leave alone (no vote either way)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There were, however, a few examples on SO of people who evidently tried to write very long answers (which I consider different from my using heavily golfed fortran 77 from time to time). I'd be tempted to vote those down.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2011-01-28T00:00:41.953" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="40" PostTypeId="1" CreationDate="2011-01-28T00:01:11.483" Score="5" ViewCount="400" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/2/99-bottles-of-beer/17#17&quot;&gt;JavaScript&lt;/a&gt; comes to mind as a language without a traditional outputting mechanism.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this instance, &lt;code&gt;document.write()&lt;/code&gt; is suggested, but its specific to the browser, not to the JavaScript/ECMAScript language (in addition to being verbose). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Obviously, this matters, since with CodeGolf, every character 'counts'. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, how can these instances be handled fairly?&lt;/p&gt;&#xA;" OwnerUserId="72" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2013-09-07T11:22:38.307" Title="For Code Golf, how do you deal with languages without a traditional print/echo statements?" Tags="|discussion|code-golf|rules|" AnswerCount="2" CommentCount="5" ClosedDate="2017-04-12T21:37:32.607" ContentLicense="CC BY-SA 2.5" />
  <row Id="41" PostTypeId="2" ParentId="21" CreationDate="2011-01-28T00:02:15.507" Score="9" Body="&lt;p&gt;I expect people relying on unspecified, undefined, or compiler specific behavior to &lt;em&gt;say so&lt;/em&gt;. Then, if I think it is gratuitous I just won't vote for their answer.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2011-01-28T00:02:15.507" CommentCount="3" ContentLicense="CC BY-SA 2.5" />
  <row Id="42" PostTypeId="1" CreationDate="2011-01-28T00:30:49.477" Score="8" ViewCount="323" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/54/tips-for-golfing-in-python/58#58&quot;&gt;This answer&lt;/a&gt; made me realise we should standardise on how to distinguish literal tabs in code from space characters. This becomes crucial in optimising the length of Python code, where 1xtab and 1xspace are different indentation levels.&lt;/p&gt;&#xA;" OwnerUserId="39" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2011-03-27T10:39:52.153" Title="Tab characters in code golf answers" Tags="|discussion|code-golf|whitespace|" AnswerCount="3" CommentCount="7" ContentLicense="CC BY-SA 2.5" />
  <row Id="43" PostTypeId="1" CreationDate="2011-01-28T00:33:23.500" Score="9" ViewCount="303" Body="&lt;p&gt;In code golfing questions it is tedious to copy-paste everyone's solution to see how long it is. Should having character counts for each submission be mandatory?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are various examples of this all over the site, so I don't want to single anyone out.&lt;/p&gt;&#xA;" OwnerUserId="62" LastActivityDate="2011-01-28T10:15:09.213" Title="Should character counts be mandatory?" Tags="|discussion|policy|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="44" PostTypeId="2" ParentId="43" CreationDate="2011-01-28T00:36:36.603" Score="9" Body="&lt;p&gt;I think they should be mandatory, because in the process of writing a shorter program you are constantly checking its size, so passing this information to the reader is not a big issue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, I think a template for submissions could be in order, eg:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;$LANGUAGE - $CHARS characters&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;$rest_of_post&lt;/p&gt;&#xA;" OwnerUserId="62" LastActivityDate="2011-01-28T00:36:36.603" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="45" PostTypeId="2" ParentId="43" CreationDate="2011-01-28T00:37:09.767" Score="18" Body="&lt;p&gt;It would be nice if we could get automated character count added as a feature. Then all code blocks could have a character count next to them and it would be irrefutable. It would also allow us to say for example later decide we don't want to consider whitespace in the count.&lt;/p&gt;&#xA;" OwnerUserId="39" LastActivityDate="2011-01-28T00:37:09.767" CommentCount="4" ContentLicense="CC BY-SA 2.5" />
  <row Id="46" PostTypeId="2" ParentId="25" CreationDate="2011-01-28T01:48:42.453" Score="5" Body="&lt;p&gt;At link you've provided, I don't see any word about GOLF.&lt;br&gt;&#xA;But if question had such tag or task with words &quot;... the &lt;strong&gt;shortest&lt;/strong&gt; solution ...&quot;, then... anyway such ansers will not have any points and after some time they will be pushed to 2nd page by better answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By the way, if questioner surely didn't want answerers to golf, maybe we need some tag for this or some note at FAQ or... I don't know any suitable way to make people see it, but somtimes questions at SO didn't suppose to be golfed, but ONE man started to golf and plenty of others continued it.&lt;/p&gt;&#xA;" OwnerUserId="58" LastActivityDate="2011-01-28T01:48:42.453" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="48" PostTypeId="2" ParentId="23" CreationDate="2011-01-28T02:26:41.973" Score="0" Body="&lt;p&gt;I really just think that you should have to code everything yourself. I mean the whole point of codegolf is to solve a challenge. Just calling a method is crap. What benefit or entertainment can you possibly gain from that? It almost seems like point-whoring for the shortest answer.&lt;/p&gt;&#xA;" OwnerUserId="29" LastActivityDate="2011-01-28T02:26:41.973" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="49" PostTypeId="2" ParentId="13" CreationDate="2011-01-28T03:54:08.760" Score="1" Body="&lt;p&gt;The standard should be standard input and standard ouput (hey, they're standard!), unless the question explicit states something else.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The SO question you linked to states clearly that the method of input can be anything:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;How to take the input totally depends on you.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Given this, I wouldn't call it an abuse.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some languages, like JavaScript, don't have the concept of standard input/output. We shouldn't forbid them. Any method that is a common pratice for that language (like &lt;code&gt;alert&lt;/code&gt; in JavaScript) should be acceptable.&lt;/p&gt;&#xA;" OwnerUserId="105" LastEditorUserId="105" LastEditDate="2011-01-28T04:31:44.930" LastActivityDate="2011-01-28T04:31:44.930" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="50" PostTypeId="2" ParentId="40" CreationDate="2011-01-28T04:46:31.250" Score="1" Body="&lt;p&gt;Some CodeGolf questions are about completing a full program - usually with specified input and output formatting. For such challenges, I'd say that JavaScript, or, say, SQL, would be inappropriate langauges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, some CodeGolf questions are about creating a function that performs the operation, and the input and output are left to be what ever is &quot;natural&quot; in the given language. For these, JavaScript will be fine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now - If someone defined a CodeGolf that was to create an HTML document... I suppose creating via the DOM would be just peachy!&lt;/p&gt;&#xA;" OwnerUserId="116" LastActivityDate="2011-01-28T04:46:31.250" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="51" PostTypeId="2" ParentId="13" CreationDate="2011-01-28T04:51:20.670" Score="5" Body="&lt;p&gt;I think we should leave the decision up to the particular CodeGolf... BUT, we should ask that questions are clear on the issue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Seems to me that there are two major types of CodeGolf: Those that want complete working programs that match some input/output criteria; and those that want a function that computes the result.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the first case, we should ask that the input/output formatting be well specified (it can still admit variation, but exactly how much variation should be clear.) Further, such CodeGolfs should be free to spec that the input is from stdin, or from a file, or from command line. Just so long as it is clear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the second case, usually the input/output to the function is meant to be &quot;whatever is natural in the language&quot;. This can lead to some abuse, so I imagine that these CodeGolfs have some amount of leeway on the judging.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Personally, I much prefer the first kind, but I see no reason to enforce that as the only style.&#xA;Some CodeGolfs want a program to meet &lt;/p&gt;&#xA;" OwnerUserId="116" LastActivityDate="2011-01-28T04:51:20.670" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="53" PostTypeId="2" ParentId="16" CreationDate="2011-01-28T05:11:23.330" Score="2" Body="&lt;p&gt;I don't think there should be a difference between puzzles that do expire and puzzles that don't expire.  In the former case, posting a full solution ruins the contest for the participants, and in the latter it ruins the puzzle for the puzzlers.  I don't think one is preferable to the other.  I also don't think we ought to be the morality police; cheaters gunna cheat.&lt;/p&gt;&#xA;" OwnerUserId="76" LastEditorUserId="76" LastEditDate="2011-12-08T05:04:42.033" LastActivityDate="2011-12-08T05:04:42.033" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="55" PostTypeId="2" ParentId="14" CreationDate="2011-01-28T10:11:35.850" Score="2" Body="&lt;p&gt;The area51 brief said something like code-golf &lt;em&gt;and&lt;/em&gt; programming puzzles. I think there will probably be some nice programming puzzles that aren't really fun to golf, but then how to choose a correct answer? :)&lt;/p&gt;&#xA;" OwnerUserId="95" LastActivityDate="2011-01-28T10:11:35.850" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="56" PostTypeId="2" ParentId="43" CreationDate="2011-01-28T10:15:09.213" Score="3" Body="&lt;p&gt;I think it's really important to include a character count. There have been many occasions with tight races between perl/python/ruby etc. And it's nice to be able to quickly check if you are still in the lead&lt;/p&gt;&#xA;" OwnerUserId="95" LastActivityDate="2011-01-28T10:15:09.213" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="57" PostTypeId="1" CreationDate="2011-01-28T10:56:34.007" Score="2" ViewCount="230" Body="&lt;p&gt;According to &lt;a href=&quot;http://blog.stackoverflow.com/2010/07/moderator-pro-tempore/&quot; rel=&quot;nofollow&quot;&gt;this post&lt;/a&gt;, three temp moderators will be selected in about 2 weeks. Who would like to nominate themselves?&lt;/p&gt;&#xA;" OwnerUserId="39" LastActivityDate="2011-01-28T19:14:15.210" Title="Moderator nominations" Tags="|discussion|moderators|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="58" PostTypeId="2" ParentId="57" CreationDate="2011-01-28T11:03:31.177" Score="4" Body="&lt;p&gt;I would like to nominate myself. I am a 14k SO user so I have experience with SE sites, and while this is my first involvement in a beta site I have a great interest in making it work out. I am one of the top users on &lt;a href=&quot;https://stackoverflow.com/tags/algorithm/topusers&quot;&gt;the &lt;code&gt;[algorithm]&lt;/code&gt; tag on SO&lt;/a&gt;, which I feel is very related to this site's purpose. Although this is early stages, I have already posted 9 of the 20 questions on meta and 7 meta answers. I have posted a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/31/methods-of-counting-characters-on-various-systems&quot;&gt;couple&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/54/tips-for-golfing-in-python&quot;&gt;experimental&lt;/a&gt; questions on the main site. I also currently have the &lt;a href=&quot;https://codegolf.stackexchange.com/users&quot;&gt;highest rep&lt;/a&gt;, although it's far too early for this to be meaningful.&lt;/p&gt;&#xA;" OwnerUserId="39" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2011-01-28T11:03:31.177" CommentCount="4" ContentLicense="CC BY-SA 2.5" />
  <row Id="59" PostTypeId="1" CreationDate="2011-01-28T11:22:13.580" Score="7" ViewCount="231" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/25/code-golf-answers-that-arent-golfing-attempts&quot;&gt;This question&lt;/a&gt; raised the issue of questions that do not make mention of being golf questions. Sometimes answerers &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4/rot-13-transform-standard-input&quot;&gt;assume it's a golfing question and golf it, leading others to follow suit&lt;/a&gt; and then a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4/rot-13-transform-standard-input/48#48&quot;&gt;non-golfed answer&lt;/a&gt; looks out of place.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We badly need a way to enforce distinction of golf vs non-golf questions. I think the solution is to enforce one of a set of tags (like on meta) that defines the puzzle type is the solution. Any other ideas?&lt;/p&gt;&#xA;" OwnerUserId="39" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2011-01-29T07:03:11.727" Title="Golf versus non-golf questions" Tags="|discussion|tags|" AnswerCount="4" CommentCount="3" ContentLicense="CC BY-SA 2.5" />
  <row Id="60" PostTypeId="2" ParentId="59" CreationDate="2011-01-28T15:33:00.953" Score="-2" Body="&lt;p&gt;A set of tags for criteria makes sense. e.g. a &lt;code&gt;golf&lt;/code&gt; tag and an &lt;code&gt;anti-golf&lt;/code&gt; tag and maybe (though this is debatable) an &lt;code&gt;obsfucation&lt;/code&gt; tag. one of which &lt;em&gt;must&lt;/em&gt; be applied to any question&lt;/p&gt;&#xA;" OwnerUserId="127" LastActivityDate="2011-01-28T15:33:00.953" CommentCount="3" ContentLicense="CC BY-SA 2.5" />
  <row Id="61" PostTypeId="2" ParentId="59" CreationDate="2011-01-28T17:27:35.707" Score="4" Body="&lt;p&gt;I think we should classify the question on this site in 3 category: &lt;code&gt;code-golf&lt;/code&gt;, &lt;code&gt;puzzle&lt;/code&gt; and &lt;code&gt;obfuscation&lt;/code&gt;. Each category has is own definition. Code-Golf is about solving the problem with the least amount of character. Puzzle is about finding solution to a problem with different approach. Obfuscation is about doing code obfuscation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We could do like on MSO and force that we provide at least one of the tag to make sure all question are well defined.&lt;/p&gt;&#xA;" OwnerUserId="54" LastActivityDate="2011-01-28T17:27:35.707" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="62" PostTypeId="2" ParentId="14" CreationDate="2011-01-28T17:38:52.800" Score="7" Body="&lt;p&gt;No!  Do not delete it!  I did not commit to this site to practice writing as illegible code as I can to trivial problems.  I committed to this site to practice coming up with practical solutions to difficult problems.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider using &lt;code&gt;code-golf&lt;/code&gt; for problems where being as terse as you possibly can is the challenge.  Consider using &lt;code&gt;coding-challenge&lt;/code&gt; where the challenge is in actually coding a solution.&lt;/p&gt;&#xA;" OwnerDisplayName="Crazy Eddie" LastActivityDate="2011-01-28T17:38:52.800" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="63" PostTypeId="2" ParentId="59" CreationDate="2011-01-28T17:43:27.803" Score="4" Body="&lt;p&gt;&lt;code&gt;code-golf&lt;/code&gt; vs. &lt;code&gt;coding-challenge&lt;/code&gt; seem sufficient to me, the distinction here being that golf problems aren't generally trying to solve anything that isn't basically trivial unless you are golfing.  A coding challenge on the other hand is something that's at least mildly difficult to solve.&lt;/p&gt;&#xA;" OwnerDisplayName="Crazy Eddie" LastActivityDate="2011-01-28T17:43:27.803" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="64" PostTypeId="1" CreationDate="2011-01-28T17:50:17.513" Score="7" ViewCount="365" Body="&lt;p&gt;I think that we should tag puzzles (or whatever) with an estimated difficulty tag.  That way people who want a real challenge can find it and those who are just starting out can find ones they might be more able to solve.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example consider: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/154/distance-between-hands-on-clock&quot;&gt;https://codegolf.stackexchange.com/questions/154/distance-between-hands-on-clock&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;vs: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/153/shortest-path-in-a-graph&quot;&gt;Shortest path in a graph&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The former requires the application of some basic trigonometry and so I consider it a beginner problem (especially since it's not a golf), the latter requires solving what would seem to me a very significant file parsing puzzle even though the title issue is rather basic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've started tagging my puzzles in this manner.  It might serve to discuss what terms to use though.&lt;/p&gt;&#xA;" OwnerDisplayName="Crazy Eddie" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2018-02-26T21:55:51.977" Title="Tags regarding difficulty" Tags="|discussion|tags|" AnswerCount="4" CommentCount="3" ContentLicense="CC BY-SA 2.5" />
  <row Id="65" PostTypeId="2" ParentId="2" CreationDate="2011-01-28T18:05:10.990" Score="0" Body="&lt;p&gt;&lt;strong&gt;Why do the number of characters matter?&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;(someone else would have to fill this in since I'm not really convinced this is super important)&lt;/p&gt;&#xA;" OwnerUserId="61" LastActivityDate="2011-01-28T18:05:10.990" CommentCount="4" ContentLicense="CC BY-SA 2.5" />
  <row Id="66" PostTypeId="1" CreationDate="2011-01-28T18:13:22.320" Score="8" ViewCount="237" Body="&lt;p&gt;So, code golf is about writing solutions in the smallest amount characters. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;But, my question is more around the overall goal of the site. Is it really just about number of characters or about improving problem solving by solving puzzles,etc? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thoughts? &lt;/p&gt;&#xA;" OwnerUserId="61" LastActivityDate="2011-02-05T17:56:10.550" Title="Is the number of characters really all this site is about?" Tags="|discussion|" AnswerCount="4" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="67" PostTypeId="1" CreationDate="2011-01-28T18:15:07.593" Score="2" ViewCount="164" Body="&lt;p&gt;Certain languages can do things with fewer characters/functions than others. How does this factor into the code golf process? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Isn't this a bit too subjective when measuring how quickly a problem is solved? Perhaps run time on pre-defined hardware set or big O notation is a better measurement. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;thoughts? &lt;/p&gt;&#xA;" OwnerUserId="61" LastActivityDate="2011-03-10T15:10:51.017" Title="Resolving number of characters and languages" Tags="|discussion|" AnswerCount="2" CommentCount="0" FavoriteCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="68" PostTypeId="2" ParentId="66" CreationDate="2011-01-28T18:16:51.613" Score="18" Body="&lt;p&gt;I'm hoping more for interesting problems to solve in order to improve my general coding abilities.  I don't really see the skills practiced by golfing as practical and am not really interested in it, so I for one hope for other problems.&lt;/p&gt;&#xA;" OwnerDisplayName="Crazy Eddie" LastActivityDate="2011-01-28T18:16:51.613" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="69" PostTypeId="1" CreationDate="2011-01-28T18:21:18.973" Score="10" ViewCount="223" Body="&lt;p&gt;This is one area where I'm having trouble envisioning how this site is supposed to work as an SE.  I suppose wrt the golfing there's an objective criteria--least characters.  But for puzzles there's really not.  Any answer that correctly solves the problem is technically an answer and so picking from among them seems to be impossible, objectively, unless you just grab the first one.  That seems to kill the whole point of having a puzzle archived though, which would be for people to try and solve it themselves.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even when there IS an objective criteria, someone could always come along and break the record.  What are we supposed to do, set a time limit?  Adjust the answer when someone comes along a year later with something better?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem I see here is that, fundamentally, puzzles and challenges are not questions.  The person posting them may even have done it already.  Very rarely does it seem appropriate to pick an &quot;answer&quot; to something posted not as a question, but a challenge.&lt;/p&gt;&#xA;" OwnerDisplayName="Crazy Eddie" LastActivityDate="2011-01-29T17:10:39.760" Title="Picking an answer" Tags="|discussion|" AnswerCount="4" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="70" PostTypeId="2" ParentId="67" CreationDate="2011-01-28T18:21:19.643" Score="8" Body="&lt;p&gt;It makes it easier to win code golf in terse languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That's life.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Those other metrics are perfectly reasonable, and might make good games, but they are &lt;em&gt;different&lt;/em&gt; games. My sense had been that they were going to be allowed: just tag them and say what you mean.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2011-01-28T18:21:19.643" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="71" PostTypeId="2" ParentId="69" CreationDate="2011-01-28T18:23:28.097" Score="13" Body="&lt;p&gt;I, too, don't see acceptance as meaningful for most puzzles and challenges. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let the users vote and leave it at that.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2011-01-28T18:23:28.097" CommentCount="6" ContentLicense="CC BY-SA 2.5" />
  <row Id="72" PostTypeId="2" ParentId="57" CreationDate="2011-01-28T19:14:15.210" Score="6" Body="&lt;p&gt;I am nominating myself, also (and I also support marcog's nomination).&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I have a great interest in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/tagged/policy&quot;&gt;policy aspects&lt;/a&gt; of this site, as can be seen by my meta posts.&lt;/li&gt;&#xA;&lt;li&gt;I'm one of the &lt;a href=&quot;https://stackoverflow.com/users/13&quot;&gt;earliest users&lt;/a&gt; on SO&lt;sup&gt;†&lt;/sup&gt;, so I've seen a lot as far as how a Stack Exchange site's culture evolves.&lt;/li&gt;&#xA;&lt;li&gt;I've run &lt;a href=&quot;https://stackoverflow.com/questions/62188&quot;&gt;the third-most popular&lt;/a&gt; code golf (by number of upvotes) on SO. :-P&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Clearly, I'm invested in code golf. I also have interest in other code challenges (and I plan to post some soon), so, I'm not playing favourites here. If you love coding brain-twisters, I look forward to helping you twist your brain as much as it can handle! :-)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;† This by itself required some creativity&lt;sup&gt;‡&lt;/sup&gt; (as did my getting userid 3 on this site), so I see this as a sign of my interest in solving outside-the-square problems. :-)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;‡ Ask me if you're curious. :-P&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2011-01-28T19:14:15.210" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="73" PostTypeId="2" ParentId="69" CreationDate="2011-01-28T19:21:13.003" Score="5" Body="&lt;p&gt;The way I've run code golfs on SO is that I update the accepted answer to match the shortest answer at the time. So if someone posts a shorter answer, I update the accepted answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I concur with dmckee with regard to more-subjective questions that have no clear criterion of &quot;best&quot;.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2011-01-28T19:21:13.003" CommentCount="6" ContentLicense="CC BY-SA 2.5" />
  <row Id="74" PostTypeId="2" ParentId="64" CreationDate="2011-01-28T21:37:44.173" Score="15" Body="&lt;p&gt;Sorry, I don't like this idea. It's too subjective.&lt;br&gt;&#xA;One man knows geometry, but didn't ever heard about graphs. (like me after school)&lt;br&gt;&#xA;Another man can solve graphs, but don't know, what Sinus is. (like some part of IT students with too temporary abilities of memory)&lt;br&gt;&#xA;So it's impossible to objectively measure difficulty, and I even don't see purpose – any person can look at task and see is it hard for him.&lt;/p&gt;&#xA;" OwnerUserId="58" LastActivityDate="2011-01-28T21:37:44.173" CommentCount="3" ContentLicense="CC BY-SA 2.5" />
  <row Id="75" PostTypeId="1" CreationDate="2011-01-28T22:38:03.600" Score="8" ViewCount="275" Body="&lt;p&gt;Sometimes, when looking at other people's golfing attempts, you see a trick that will improve your own one, or you might see a glaring improvement that is not entirely obvious to OP. For instance, in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/159/196-algorithm-code-golf/163#163&quot;&gt;this code-golf&lt;/a&gt; the slightly glaring improvement is to make &lt;code&gt;n&lt;/code&gt; an int instead of a string, yielding: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;n=input()&#xA;while`n`!=`n`[::-1]:n+=int(`n`[::-1])&#xA;print n&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which is 7 characters shorter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How should this be handled, because in the above case I'm clearly spring boarding from another's work, but if I only give a comment I will not get reputation (comments upvotes don't get reputation AFAIK). On the other hand, posting it as my own solution feels too much like stealing. What should the policy on this be? Because I think this type of thing will happen often.&lt;/p&gt;&#xA;" OwnerUserId="62" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-01-12T00:46:00.300" Title="What should the policy on improving or incorporating other people's solutions be?" Tags="|discussion|policy|" AnswerCount="3" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="76" PostTypeId="2" ParentId="75" CreationDate="2011-01-28T22:43:30.553" Score="9" Body="&lt;p&gt;Small improvements like this one should either be suggested by leaving a comment like you did or by editing in your improvement. If the OP doesn't agree with your edit, he/she can rollback. Note that even low rep users can now suggest edits. We should consider reducing the minimum edit length requirements for edit suggestions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Larger improvements where you're putting in considerably effort can be a new answer, but please cite the original answer which you built yours from.&lt;/p&gt;&#xA;" OwnerUserId="39" LastEditorUserId="39" LastEditDate="2011-01-30T19:10:06.547" LastActivityDate="2011-01-30T19:10:06.547" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="77" PostTypeId="2" ParentId="75" CreationDate="2011-01-28T22:43:35.993" Score="3" Body="&lt;p&gt;I think people have an intrinsic sense of right and wrong and will down vote golfing attempts that are clear copy and modify slightly. However, I think people should have something to motivate them to do the right thing. A potential solution could be to make comment up votes give reputation if they are comments on answers in questions with the &lt;code&gt;code-golf&lt;/code&gt; tag.&lt;/p&gt;&#xA;" OwnerUserId="62" LastActivityDate="2011-01-28T22:43:35.993" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="78" PostTypeId="2" ParentId="59" CreationDate="2011-01-29T07:03:11.727" Score="0" Body="&lt;p&gt;Seeing as how the name of this site is code-golf, I think everyone is going to assume golfing is supposed to happen&lt;/p&gt;&#xA;" OwnerUserId="74" LastActivityDate="2011-01-29T07:03:11.727" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="79" PostTypeId="2" ParentId="75" CreationDate="2011-01-29T07:14:27.237" Score="6" Body="&lt;p&gt;If I copy the code into my editor and change it round a bit, I credit the author of the original idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it is too similar, I'll probably just post a comment, but if it takes a significant effort to shave a few bytes, I think it's fair enough to throw it up and see if it earns a few votes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also credit the author if I turn their Ruby idea into a Python answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm also happy for people to base their answers on my own, but it is nice to see some acknowledgement.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ultimately it's up to the voters to do what they think is fair, if there are two almost identical answers.&lt;/p&gt;&#xA;" OwnerUserId="95" LastActivityDate="2011-01-29T07:14:27.237" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="80" PostTypeId="2" ParentId="69" CreationDate="2011-01-29T07:48:31.593" Score="1" Body="&lt;p&gt;The &lt;a href=&quot;https://stackoverflow.com/questions/1480023/code-golf-lasers&quot;&gt;lasers&lt;/a&gt; golf happened before I started golfing on SO. The accepted perl answer has since been beaten in Python, Ruby and Golfscript but LiraNuna always accepted the shortest answer 1 week after the question was answered&lt;/p&gt;&#xA;" OwnerUserId="95" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2011-01-29T07:48:31.593" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="81" PostTypeId="2" ParentId="5" CreationDate="2011-01-29T16:04:49.820" Score="5" Body="&lt;p&gt;I think that we &lt;em&gt;should&lt;/em&gt; invite games and contests other than golf, so the title from the Area51 proposal made sense to me.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for the domain...well, golf was the only game with wide acceptance on Stack Overflow, and &lt;em&gt;I&lt;/em&gt; saw this proposal as a way of getting it off without hurting peoples feelings.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2011-01-29T16:04:49.820" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="82" PostTypeId="2" ParentId="5" CreationDate="2011-01-29T16:19:33.610" Score="1" Body="&lt;p&gt;I've been thinking about this and would like to propose the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Name: Programming Challenges&lt;/li&gt;&#xA;&lt;li&gt;Domain: challenges.stackexchange.com&lt;/li&gt;&#xA;&lt;li&gt;Tagline: Programming Challenges - Stack Exchange is for programmers looking for a challenge&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Code golf is a type of programming challenge, the challenge being to come up with the shortest code. I prefer &lt;em&gt;challenges&lt;/em&gt; over &lt;em&gt;puzzles&lt;/em&gt; because we don't seem to have any of the latter (at least not yet). &lt;/p&gt;&#xA;" OwnerUserId="39" LastEditorUserId="39" LastEditDate="2011-01-30T18:19:38.137" LastActivityDate="2011-01-30T18:19:38.137" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="83" PostTypeId="2" ParentId="69" CreationDate="2011-01-29T17:10:39.760" Score="0" Body="&lt;p&gt;Personally, I would think:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;On strictly objective questions,&#xA;(eg. plain old code golf) the&#xA;shortest answer at any given time.&lt;/li&gt;&#xA;&lt;li&gt;On questions with &lt;em&gt;any&lt;/em&gt; subjective&#xA;element, a bonus to the answer with&#xA;the largest number of votes at any&#xA;given time.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="104" LastActivityDate="2011-01-29T17:10:39.760" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="84" PostTypeId="1" AcceptedAnswerId="85" CreationDate="2011-01-29T22:53:33.980" Score="3" ViewCount="231" Body="&lt;p&gt;It's only ~20 chars but in code golf, they all count.  I guess whether shebangs should be included could be up to the individual question askers, but I think we need some kind of convention.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Shebangs; yes or no?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="149" LastActivityDate="2011-03-27T20:13:48.763" Title="Shebangs; yes or no?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="85" PostTypeId="2" ParentId="84" CreationDate="2011-01-29T23:10:05.987" Score="10" Body="&lt;p&gt;People don't count it against me when I write&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$ gcc --std=c99 golf.c&#xA;$ ./a.out&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;before my program will run, so I don't see why anyone would be bothered by&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$ python golf.py&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Accordingly shebangs are unnecessary.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="78" LastEditDate="2011-03-27T20:13:48.763" LastActivityDate="2011-03-27T20:13:48.763" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="86" PostTypeId="1" AcceptedAnswerId="87" CreationDate="2011-01-30T03:12:53.623" Score="1" ViewCount="132" Body="&lt;p&gt;I don't care about the rep, and I know that downvotes can be somewhat random and sometimes undeserved, but In the early stages of a site, it's easy to go against the rules without knowing, so I would like to know if I violated a rule or something.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What wrong with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2/99-bottles-of-beer/169#169&quot;&gt;this answer&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="149" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2011-01-30T03:27:44.120" Title="Why was I downvoted?" Tags="|discussion|voting|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="87" PostTypeId="2" ParentId="86" CreationDate="2011-01-30T03:27:44.120" Score="0" Body="&lt;p&gt;You get downvoted if your program is incorrect---which indeed was the case for your linked post.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2011-01-30T03:27:44.120" CommentCount="3" ContentLicense="CC BY-SA 2.5" />
  <row Id="88" PostTypeId="1" CreationDate="2011-01-30T04:45:46.143" Score="15" ViewCount="1353" Body="&lt;p&gt;I'd like to receive people's opinions on languages &quot;designed for golfing&quot;, such as &lt;a href=&quot;http://www.golfscript.com/golfscript/&quot; rel=&quot;nofollow noreferrer&quot;&gt;GolfScript&lt;/a&gt; and &lt;a href=&quot;http://www.esolangs.org/wiki/FlogScript&quot; rel=&quot;nofollow noreferrer&quot;&gt;FlogScript&lt;/a&gt;. However, since there are no FlogScript submissions on the site as of current writing, this post will focus on GolfScript.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First of all, let's clear a misconception that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9/what-programming-language-should-we-consider-for-the-code-golf-solution/10#10&quot;&gt;Nakilon has expressed&lt;/a&gt;. GolfScript is not &quot;only for golfing&quot;; it's actually a general-purpose programming language, that just happens to encourage brevity to a more extreme degree than most others. It does not have special cheats or backdoors that allow shortcuts to solving any given golfing problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my personal opinion, I consider GolfScript to be part of Golfing 101, and certainly every &quot;professional&quot; golfer I know of knows how to read GolfScript at the very least, and most know how to write it too; it's not even a hard language to learn. Trying to compete in golf without knowing GolfScript is like trying to read Japanese without knowing kanji.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, marcog has made a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9/what-programming-language-should-we-consider-for-the-code-golf-solution/10#10&quot;&gt;comment&lt;/a&gt;, that seems to be echoed by a number of others, that they don't know how to read GolfScript. My personal opinion notwithstanding, there is probably a case for supporting GolfScript-illiterate people to a degree, to level the playing field and broaden the site's appeal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, I'm strongly against a GolfScript ban. However, if people think it's useful, I'm happy to write commentary that describes how each program works, at least from a bird's eye level. We can even make this a recommendation for other people wanting to post GolfScript submissions (though, to support &lt;a href=&quot;https://meta.stackexchange.com/questions/9731/fastest-gun-in-the-west-problem&quot;&gt;fastest gun in the west&lt;/a&gt;, posts that don't come with an explanation should not be penalised for at least the first day after posting).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd love to hear people's thoughts on this.&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2011-05-01T13:06:02.170" Title="On GolfScript and language bigotry" Tags="|discussion|policy|" AnswerCount="4" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="89" PostTypeId="1" CreationDate="2011-01-30T09:11:14.227" Score="17" ViewCount="346" Body="&lt;p&gt;I'm concerned that after a period of beta, as golf &quot;professionals&quot; leave for their regular sites. We currently don't offer that much value for them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd like to use this as a place to discuss novel ideas that we can implement to make this site attractive to a large group. I mean something like what &lt;a href=&quot;http://vimgolf.com/&quot; rel=&quot;nofollow&quot;&gt;VimGolf&lt;/a&gt; recently started. Of course we don't want to be restrictive, but if we can start with a few unique areas that attract attention then that may well bring in people from other areas of golfing / other code challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, do you have that bright idea that will make this site a success?&lt;/p&gt;&#xA;" OwnerUserId="39" LastActivityDate="2014-08-12T06:20:58.270" Title="We need something novel to bring in the hordes" Tags="|discussion|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 2.5" />
  <row Id="90" PostTypeId="1" AcceptedAnswerId="91" CreationDate="2011-01-30T10:10:43.007" Score="3" ViewCount="77" Body="&lt;p&gt;If you link your other SO accounts to this one, you start with 101 rep. I asked one question which was upvoted twice, but nevertheless i have only 106 rep. Why not 111?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is my reputation calc:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;total votes: 1&#xA;  -- bonuses   (100)  2       197 (5)&#xA;  -- 2011-01-29 rep +5    = 106       &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;** total rep 106 :)&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;days represented 0 rep cap was reached&#xA;  via rep from upvotes &lt;em&gt;only&lt;/em&gt; on 0 days&#xA;  rep cap was exceeded on 0 days&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="153" LastEditorUserId="153" LastEditDate="2011-01-30T10:40:33.047" LastActivityDate="2011-01-30T10:56:04.807" Title="Reputation not calculated correctly?" Tags="|support|reputation|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 2.5" />
  <row Id="91" PostTypeId="2" ParentId="90" CreationDate="2011-01-30T10:56:04.807" Score="3" Body="&lt;p&gt;The second upvote on that post occured after the question was &lt;a href=&quot;https://codegolf.stackexchange.com/posts/197/revisions&quot;&gt;turned into community wiki&lt;/a&gt;, and upvotes on CW questions do not generate reputation.&lt;/p&gt;&#xA;" OwnerUserId="160" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2011-01-30T10:56:04.807" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="92" PostTypeId="2" ParentId="88" CreationDate="2011-01-30T12:46:56.680" Score="14" Body="&lt;p&gt;I once spent an afternoon dabbling with GolfScript and back then I could read it to some degree (wasn't the case after a weekend of J). By now, the only thing I remember is that &lt;code&gt;;&lt;/code&gt; pops the stack which doesn't really help in understanding programs. [Edit: not anymore]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I definitely don't object against GolfScript solutions here. My language of choice isn't the best golfing language but it's fun and that's what it's (to me) about. Similarly, J or APL solutions often are very short compared to other languages, although using a different paradigm than GS.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an illiterate in such languages I do appreciate some hints about how the program does it and what makes it special but usually I appreciate them for other languages as well. The joy in reading other people's posts is often not about the shortness but rather about the tricks that were used to make it so short.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, then it's saddening that a trivial, straightforward Golfscript solution is still way shorter than anything Ruby, Perl or others offer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, generally: A few words about how the solution works are greatly appreciated. Especially for languages as write-only (own opinion) as GolfScript, but not necessarily limited to those.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And definitely no ban of any language. HQ9+ bans itself anyway after three different tasks, so more joke submissions are probably not to be expected there.&lt;/p&gt;&#xA;" OwnerUserId="15" LastEditorUserId="15" LastEditDate="2011-04-16T14:45:34.790" LastActivityDate="2011-04-16T14:45:34.790" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="93" PostTypeId="1" CreationDate="2011-01-30T13:17:12.950" Score="23" ViewCount="999" Body="&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/40/for-code-golf-how-do-you-deal-with-languages-without-a-traditional-print-echo-st&quot;&gt;For Code Golf, how do you deal with languages without a traditional print/echo statements?&lt;/a&gt;&lt;br&gt;&#xA;Related: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9/what-programming-language-should-we-consider-for-the-code-golf-solution&quot;&gt;What programming language should we consider for the code-golf solution ?&lt;/a&gt;&lt;br&gt;&#xA;Related: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/23/use-of-built-in-functions-and-libraries-in-code-golfs&quot;&gt;Use of built-in functions and libraries in Code Golfs&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ok, I just tried solving &lt;a href=&quot;https://codegolf.stackexchange.com/questions/183/finding-sub-palindromes&quot;&gt;Finding subpalindromes&lt;/a&gt; where input and output are given in a sort of haphazardly fashion. In particular, it isn't obvious whether input is given without or with the quotes and whether output must be in exactly the formst given or whether that's all just convenience notation to show where strings start and end. In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/189/drawing-a-cube-in-ascii-art&quot;&gt;my own task&lt;/a&gt; I tried specifying both input and output in great detail which arguable takes more space but (imho) makes the task clearer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That's just one example, but any task where details need to be asked before being able to solve it accurately might need a bit work beforehand, I think.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, generally, what I'd like to see for Golf tasks would be:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A description of what the solution is supposed to do.&lt;/li&gt;&#xA;&lt;li&gt;A specification how input is provided and in what format. E.g. whether input is provided on stdin or as argument to a subroutine. It's ok if there are exceptions and concessions for languages without stdin.&lt;/li&gt;&#xA;&lt;li&gt;A specification how output is provided and formatted. Same as above.&lt;/li&gt;&#xA;&lt;li&gt;A clear winning condition (we had that already in another question; just for completeness here), such as shortest code.&lt;/li&gt;&#xA;&lt;li&gt;A list of disallowed techniques or languages (as much as I don't particularly like that, some may deem it necessary and crying »Golfscript wasn't allowed; I'll change the question.« after a solution in Golfscript was posted isn't going to help, I guess). Of course, some common sense applies. Answers such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2/99-bottles-of-beer/74#74&quot;&gt;this&lt;/a&gt; answer on 99 bottles of beer don't have to be explicitly ruled out, I guess.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Of course, a reasonably complex task at hand may provoke questions not anticipated but those often cover specifics of the task, not technicalities of the solutions or the execution environment. What I'd want to avoid is that every task has the same questions as comments underneath that ask for how input or output should be provided, &amp;amp;c.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thoughts? Did I miss something important? Am I trying to impose too many rules on how this should work?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1280&quot;&gt;Return to FAQ index&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="15" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2023-02-02T08:11:49.950" Title="What details should always be given for a code golf task?" Tags="|discussion|faq|code-golf|policy|" AnswerCount="3" CommentCount="1" CommunityOwnedDate="2014-03-18T00:34:39.900" ContentLicense="CC BY-SA 3.0" />
  <row Id="94" PostTypeId="1" AcceptedAnswerId="263" CreationDate="2011-01-30T13:22:08.987" Score="1" ViewCount="138" Body="&lt;p&gt;I've already had a couple of golf answers that were less than 30 characters - even with the character count included.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it possible and sensible to reduce that limit to 20 or 25 perhaps?&lt;/p&gt;&#xA;" OwnerUserId="95" LastActivityDate="2014-01-06T02:23:52.227" Title="Is it possible to reduce the character limit from 30" Tags="|discussion|" AnswerCount="4" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="95" PostTypeId="2" ParentId="94" CreationDate="2011-01-30T14:48:26.167" Score="4" Body="&lt;p&gt;I agree that we should reduce the limit, but by how much we will only learn from usage. The examples you're likely referring to:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/4/rot-13-transform-standard-input/92#92&quot;&gt;rot13&lt;/a&gt;: 5 char solution with about 9 additional characters that were necessary = 14 characters in total.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/73/re-implimenting-square-root/83#83&quot;&gt;sqrt&lt;/a&gt;: 11 characters with 11 other characters that were necessary = 22 characters.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think 20 might be a useful limit, but as I say we'll see over time. For now, you could have added a link to the &lt;code&gt;rot13&lt;/code&gt; function for the first one and explained to non-Python users that &lt;code&gt;**&lt;/code&gt; is a power operator for the second. Both would tip you over the 30 character limit.&lt;/p&gt;&#xA;" OwnerUserId="39" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2011-01-30T14:48:26.167" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="96" PostTypeId="2" ParentId="93" CreationDate="2011-01-30T16:02:53.980" Score="1" Body="&lt;p&gt;Should STDERR be ignored?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If STDERR ouput is ignored, the program can halt by raising an exception or crash.&lt;/p&gt;&#xA;" OwnerUserId="80" LastActivityDate="2011-01-30T16:02:53.980" CommentCount="3" CommunityOwnedDate="2014-03-18T00:34:39.900" ContentLicense="CC BY-SA 2.5" />
  <row Id="97" PostTypeId="1" CreationDate="2011-01-30T16:20:58.233" Score="15" ViewCount="150" Body="&lt;p&gt;Since most questions on this site won't be language specific, but virtually all answers will contain code, the tag-based syntax-highlighting approach &lt;a href=&quot;https://meta.stackexchange.com/questions/72082/changes-to-syntax-highlighting&quot;&gt;recently adopted by SO&lt;/a&gt; won't work for this site. However I think that syntax highlighting would be worthwhile to have nonetheless.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I thus propose that the old mode of syntax highlighting be enabled for this site, where all the code samples are highlighted using prettify's default &quot;guess&quot; mode.&lt;/p&gt;&#xA;" OwnerUserId="30" LastEditorUserId="68942" LastEditDate="2021-06-02T19:55:04.203" LastActivityDate="2021-06-02T19:55:04.203" Title="Enable default syntax highlighting" Tags="|feature-request|status-completed|" AnswerCount="3" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="98" PostTypeId="1" CreationDate="2011-01-30T16:23:43.180" Score="12" ViewCount="452" Body="&lt;p&gt;I notice some users are posting questions where they are immediately posting a long-standing (or just extremely well golfed) solution to the problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On StackOverflow posting your own questions has the benefit of showing users solution to problems the poster has (and others may) come across. In this context, where we pose a challenge, I feel it discourages users from posting alternatives and only serves to boost the reputation of the user posting the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should this behaviour be encouraged/allowed?&lt;/p&gt;&#xA;" OwnerUserId="77" LastActivityDate="2011-01-30T18:25:46.393" Title="Presolving Golf Questions" Tags="|discussion|code-golf|" AnswerCount="4" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="99" PostTypeId="2" ParentId="93" CreationDate="2011-01-30T16:28:18.530" Score="5" Body="&lt;p&gt;It might be useful to have a suggested template for golf questions in our FAQ.&lt;/p&gt;&#xA;" OwnerUserId="77" LastActivityDate="2011-01-30T16:28:18.530" CommentCount="0" CommunityOwnedDate="2014-03-18T00:34:39.900" ContentLicense="CC BY-SA 2.5" />
  <row Id="100" PostTypeId="2" ParentId="98" CreationDate="2011-01-30T16:28:34.527" Score="1" Body="&lt;p&gt;Encouraged.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It gives other users a target to beat.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You could always solve it in another language.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You might actually learn something from the solution.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The last reason alone should probably make it worthwile to allow such behaviour.&lt;/p&gt;&#xA;" OwnerUserId="80" LastActivityDate="2011-01-30T16:28:34.527" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="101" PostTypeId="2" ParentId="97" CreationDate="2011-01-30T16:32:55.607" Score="2" Body="&lt;p&gt;I agree. Perhaps we could turn on syntax highlighting with no hints only when the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-agnostic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-agnostic&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-agnostic&lt;/a&gt; tag is used. I have always preferred to be specific by using this tag over letting users assume it's implied by the lack of a language tag.&lt;/p&gt;&#xA;" OwnerUserId="39" LastActivityDate="2011-01-30T16:32:55.607" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="102" PostTypeId="2" ParentId="98" CreationDate="2011-01-30T16:37:52.060" Score="2" Body="&lt;p&gt;I think it's acceptable to post a solution, but I don't see why we should encourage users to do so. I prefer a readable reference solution as part of the question as in my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/205/slot-machine-hacker&quot;&gt;Slot Machine Hackers&lt;/a&gt; question, but even a golfed solution by the OP could be used as a reference solution to remove ambiguity and resolve arguments over correctness.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you've worked on your golfed solution for a long time, it might be fair to wait for other answers to start appearing before posting it. If this becomes a problem, we could enforce this by not allowing self-answers until some period of time has passed (e.g. 1 day).&lt;/p&gt;&#xA;" OwnerUserId="39" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2011-01-30T18:16:18.873" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="103" PostTypeId="2" ParentId="6" CreationDate="2011-01-30T16:44:23.943" Score="4" Body="&lt;p&gt;The original &lt;a href=&quot;http://www.xs4all.nl/~thospel/golf/rules.html&quot; rel=&quot;nofollow&quot; title=&quot;Perlgolf rules&quot;&gt;Perlgolf rules&lt;/a&gt; could be of interest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It might be easier to adopt some of these tried-and-tested rules&#xA;instead of reinventing the square wheel yet another time.&lt;/p&gt;&#xA;" OwnerUserId="80" LastEditorUserId="80" LastEditDate="2011-02-07T20:06:13.130" LastActivityDate="2011-02-07T20:06:13.130" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="104" PostTypeId="2" ParentId="98" CreationDate="2011-01-30T16:47:11.787" Score="6" Body="&lt;p&gt;Personally, I think this should be &lt;strong&gt;discouraged&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the author has a long-standing &quot;solution&quot;, they should hold off on posting it for &lt;em&gt;at least&lt;/em&gt; a few days, until every has a chance to contribute.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Other Stack Exchange sites are about providing solutions to problems you actual have. But &lt;em&gt;this&lt;/em&gt; site is more about challenging users to take part in programming exercises to for entertainment or skill building. If this site is used just &lt;strong&gt;rehash and build up a yet &lt;em&gt;ANOTHER&lt;/em&gt; collection of coding puzzles&lt;/strong&gt; found elsewhere, it is going to become very boring very fast.&lt;/p&gt;&#xA;" OwnerUserId="139" LastActivityDate="2011-01-30T16:47:11.787" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="105" PostTypeId="2" ParentId="98" CreationDate="2011-01-30T18:25:46.393" Score="15" Body="&lt;p&gt;I don't particularly have a problem with giving tasks where the poster already has a solution. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/189/drawing-a-cube-in-ascii-art&quot;&gt;I have done so myself&lt;/a&gt;. However, I agree with others that if you had several days to golf your own solution then you should wait a while before posting it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At least for me golfing often involves first solving the task, then finding bits and pieces that may be optimized and I then gradually move towards a golfed solution. I had moments where I thought I'd be done and nothing else would be possible anymore and then, all of a sudden, I shave off another 30 characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Giving others such a golfed-to-death solution beforehand might discourage them from even trying. Also, since the own solution is often essentially finished it is not really part of the usual competition, where one would notice that another solution is 5 bytes shorter than the own and then see that as motivation to beat it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In case of my own question above I gave my own solution I prepared months ago only after someone beat it. In case the poster has the shortest solution even after some time has passed, I guess it should be posted, but not immediately after posting the task.&lt;/p&gt;&#xA;" OwnerUserId="15" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2011-01-30T18:25:46.393" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="106" PostTypeId="2" ParentId="97" CreationDate="2011-01-30T18:33:18.753" Score="2" Body="&lt;p&gt;Given that SO's syntax highlighter is &lt;em&gt;notoriously bad&lt;/em&gt; for plenty of source code I'd rather prefer no syntax highlighting to broken one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there was a way to hint a specific language to use that might be an option. But prettify's own detection is (imho) worse than no highlighting at all. And »Supports all C-like, Bash-like, and XML-like languages« was definitely not enough on SO; it may well be not enough here.&lt;/p&gt;&#xA;" OwnerUserId="15" LastActivityDate="2011-01-30T18:33:18.753" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="107" PostTypeId="2" ParentId="93" CreationDate="2011-01-30T19:27:12.953" Score="13" Body="&lt;p&gt;Extract from &lt;a href=&quot;https://stackoverflow.com/tags/code-golf/info&quot;&gt;the code-golf tag wiki on SO&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;p&gt;There should be a complete, unambiguous specification of the problem. It must include at least:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What kind of inputs to expect. eg. natural numbers, strings of ASCII printable letters, ragged array. Be very specific what values programs need to deal with or not.&lt;/li&gt;&#xA;&lt;li&gt;What kind of outputs are acceptable. Can there be multiple possible solutions? Can you output in reverse order? Can you omit the first element if it's always the same. etc.&lt;/li&gt;&#xA;&lt;li&gt;Input/Output format &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;if not the same as our defaults&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;A clear description of how the input and output are related.&lt;/li&gt;&#xA;&lt;li&gt;Clarification on any edge cases. Note: Allowing answers to assume the edge case will never happen &lt;em&gt;is&lt;/em&gt; a good clarification. Still it needs to be specified in the answer.&lt;/li&gt;&#xA;&lt;li&gt;Example inputs and outputs.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You, the asker, should be able to answer the code-golf problem (even if it's not optimal), to show that it is not a homework problem. If possible, post your solution as an answer. (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/98/presolving-golf-questions&quot;&gt;meta discussion&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;p&gt;All programming languages should be allowed. (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9/what-programming-language-should-we-consider-for-the-code-golf-solution&quot;&gt;meta discussion&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;p&gt;A good code-golf should:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Be thoroughly specified&lt;/li&gt;&#xA;&lt;li&gt;Be simple enough to be understood fully in two quick readings of the spec&lt;/li&gt;&#xA;&lt;li&gt;Admit rapid naive implementations&lt;/li&gt;&#xA;&lt;li&gt;Be complex enough to admit more than one reasonable way to accomplish it,&lt;/li&gt;&#xA;&lt;li&gt;Have built-in-to-some-languages solutions excluded (i.e. no eval for arithmetic parsers and the like)&lt;/li&gt;&#xA;&lt;li&gt;Not be optimized for one language or one class of languages&lt;/li&gt;&#xA;&lt;li&gt;Not be too closely related to others we've done recently&lt;/li&gt;&#xA;&lt;li&gt;Solve a class of problems rather than a single instance&lt;/li&gt;&#xA;&lt;li&gt;See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges&quot;&gt;things to avoid when writing challenges&lt;/a&gt; for a more complete list.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="39" LastEditorUserId="91213" LastEditDate="2023-02-02T08:11:49.950" LastActivityDate="2023-02-02T08:11:49.950" CommentCount="6" CommunityOwnedDate="2014-03-18T00:34:39.900" ContentLicense="CC BY-SA 4.0" />
  <row Id="108" PostTypeId="2" ParentId="88" CreationDate="2011-01-30T21:00:21.223" Score="6" Body="&lt;p&gt;On SO, I believe that golfscript answers are generally discriminated against by not getting upvotes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Perl answers that are longer often get 2 or 3 times as many votes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Personally I think that the perl answers look just as much like line noise as the golfscript, and I don't believe for one minute that all the upvoters have read and understand the code!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't think I've had too many downvotes for golfscript though. The answers just seem to be invisible to the majority.&lt;/p&gt;&#xA;" OwnerUserId="95" LastActivityDate="2011-01-30T21:00:21.223" CommentCount="5" ContentLicense="CC BY-SA 2.5" />
  <row Id="109" PostTypeId="2" ParentId="64" CreationDate="2011-01-30T23:20:41.807" Score="4" Body="&lt;p&gt;It is very subjective, but perhaps it can be managed by the community&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Someone tags a problem as &quot;hard&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Someone comments &quot;I think it's really medium difficulty&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If that comment gets a bunch of votes the tag should change&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there are multiple such comments, the one with the most votes wins.&lt;/p&gt;&#xA;" OwnerUserId="95" LastActivityDate="2011-01-30T23:20:41.807" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="110" PostTypeId="1" AcceptedAnswerId="111" CreationDate="2011-01-31T01:11:56.263" Score="7" ViewCount="366" Body="&lt;p&gt;Over at &lt;a href=&quot;https://codegolf.stackexchange.com/questions/265/decryption-by-pattern-analysis&quot;&gt;this question&lt;/a&gt;, the OP doesn't want to use an objective winning criterion like code brevity, but instead wants to accept the highest-voted answer. To me, that smells like a &lt;a href=&quot;https://stackoverflow.com/questions/62188/stack-overflow-code-golf/64252#64252&quot;&gt;popularity&lt;/a&gt; &lt;a href=&quot;https://stackoverflow.com/questions/232861/fibonacci-code-golf/233228#233228&quot;&gt;contest&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Personally, those two examples above are reason enough for me to never post a popularity contest. However, if someone should, against their better judgement, feel that such a contest has value, a &lt;code&gt;[popularity-contest]&lt;/code&gt; tag would suffice to caution serious coders to stay away. It'd be like Parental Advisory, except in this case it's not a content-free advisory. :-)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Comments welcome.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;On a similar train of thought: should popularity-contest questions be &quot;strongly encouraged&quot; to be community-wiki'd?&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2011-02-03T03:52:40.963" Title="A Modest Proposal: the [popularity-contest] tag" Tags="|discussion|tags|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="111" PostTypeId="2" ParentId="110" CreationDate="2011-01-31T02:38:51.863" Score="15" Body="&lt;p&gt;For me, the novelty of a code golf site is seeing the novel ways people apply the features of languages I am interested in.  As a result of this, it is quite likely I will be upvoting answers which are interesting to me, rather than worrying about testing shorter solutions in languages in I might not be interested in (I am not &lt;em&gt;only&lt;/em&gt; referring to GolfScript here.)  An accepted answer is only worth 1.5 upvotes, so if there are a lot of users like myself on the site, such solutions will consistently underperform in terms of rep gains, even if  so called &lt;em&gt;popularity contest&lt;/em&gt; questions are made CW.  There's no point penalizing anyone for answering what some might consider an unclear question.  All puzzles are objective questions to a point.  We either need to decide that those questions with less strict acceptance criteria are off topic or accept them for what they are.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I suggest that it would be sufficient to emphasize the importance of &lt;em&gt;appropriately setting expectations&lt;/em&gt; for acceptance criteria in the faq, and perhaps require the use of a set of (less condescending) acceptance criteria tags eg: strict, popular-vote, or whatever-i-feel-like&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The ability for the community to upvote and downvote questions is a feature of the StackExchange platform, not a bug.  &lt;strong&gt;Let's not try making it into something it's not.&lt;/strong&gt;  There's nothing stopping anyone from making a &lt;em&gt;great&lt;/em&gt; code golf site with automated testing/automatic assigning of points to the shortest answer.  This isn't that site.&lt;/p&gt;&#xA;" OwnerUserId="104" LastEditorUserId="104" LastEditDate="2011-01-31T02:49:29.007" LastActivityDate="2011-01-31T02:49:29.007" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="112" PostTypeId="1" CreationDate="2011-01-27T22:18:30.013" Score="5" ViewCount="280" Body="&lt;p&gt;Counting characters of a program manually is tedious, and we do this a lot in Code Golf. How do you do a more effective character count using utilities provided by your shell or ide?&lt;/p&gt;&#xA;" OwnerUserId="39" OwnerDisplayName="marcog" LastActivityDate="2014-06-18T09:45:46.810" Title="Methods of counting characters on various systems" Tags="|code-golf|meta|characters|" AnswerCount="10" CommentCount="11" ContentLicense="CC BY-SA 2.5" />
  <row Id="113" PostTypeId="2" ParentId="112" CreationDate="2011-01-27T22:20:38.857" Score="4" Body="&lt;p&gt;On Linux, use &lt;code&gt;wc -c file&lt;/code&gt; in your favourite shell. Note that you might be counting a trailing new-line, which you might want to ignore.&lt;/p&gt;&#xA;" OwnerUserId="39" OwnerDisplayName="marcog" LastActivityDate="2011-01-27T22:20:38.857" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="114" PostTypeId="2" ParentId="112" CreationDate="2011-01-27T22:40:07.483" Score="1" Body="&lt;p&gt;I use this tool: &lt;a href=&quot;http://www.javascriptkit.com/script/script2/charcount.shtml&quot; rel=&quot;nofollow&quot;&gt;http://www.javascriptkit.com/script/script2/charcount.shtml&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="20" OwnerDisplayName="SimpleCoder" LastActivityDate="2011-01-27T22:40:07.483" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="115" PostTypeId="2" ParentId="112" CreationDate="2011-01-27T23:13:23.443" Score="1" Body="&lt;p&gt;Usually I use one of these two ways:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;I always have my Total Commander (FAR, MC, what do you wish) opened at current working directory, so I just look on file size in bytes and substract &lt;code&gt;(number_of_lines - 1)&lt;/code&gt; if I used &lt;code&gt;CR LF&lt;/code&gt;;&lt;/li&gt;&#xA;&lt;li&gt;If I'm too lazy to open Total, I go to IRC and give solution code to bot to count it's length.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="58" OwnerDisplayName="Nakilon" LastActivityDate="2011-01-27T23:13:23.443" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="116" PostTypeId="2" ParentId="112" CreationDate="2011-01-28T05:25:57.517" Score="1" Body="&lt;p&gt;I just look at the character count when I open it in vim to copy across.&lt;/p&gt;&#xA;" OwnerUserId="65" OwnerDisplayName="Nemo157" LastActivityDate="2011-01-28T05:25:57.517" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="117" PostTypeId="2" ParentId="112" CreationDate="2011-01-31T09:55:06.560" Score="0" Body="&lt;pre&gt;&lt;code&gt;$ python&#xA;&amp;gt;&amp;gt;&amp;gt; len(&quot;&quot;.join(open('filename').readlines()))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or, as hallvabo suggests:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$ python&#xA;&amp;gt;&amp;gt;&amp;gt; len(open('filename').read())&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="16" OwnerDisplayName="Thomas O" LastEditorUserId="16" LastEditDate="2011-02-01T12:46:01.617" LastActivityDate="2011-02-01T12:46:01.617" CommentCount="4" ContentLicense="CC BY-SA 2.5" />
  <row Id="118" PostTypeId="2" ParentId="112" CreationDate="2011-01-31T12:13:33.297" Score="2" Body="&lt;p&gt;&lt;a href=&quot;http://notepad-plus-plus.org/&quot; rel=&quot;nofollow&quot;&gt;Notepad++ &lt;/a&gt; includes a convenient count of both characters (not including newlines) and bytes (be sure to first remove any trailing newlines and switch to Unix newlines) at the bottom of the window. Separate counts exist for the current selection and the entire file.&lt;/p&gt;&#xA;" OwnerUserId="163" OwnerDisplayName="idealmachine" LastActivityDate="2011-01-31T12:13:33.297" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="119" PostTypeId="2" ParentId="112" CreationDate="2011-01-31T12:37:39.150" Score="1" Body="&lt;p&gt;For most golfings I just use Far, i.e. an orthodox file manager, save the file with LF line endings and just look at the file size (I need to remember &lt;code&gt;svn ps svn:eolstyle LF *&lt;/code&gt; though because SVN tends to think too much). Since I'm on Windows there's luckily no trailing LF to be accounted for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, for one-liners in PowerShell, I have a small utility (slightly buggy, but never got around fixing them):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function Set-GolfPrompt {&#xA;    function global:prompt {&#xA;        # Info about how much shorter/longer the previous command was can only&#xA;        # be given if the history is long enough, so don't do that if not.&#xA;        $history = Get-History&#xA;        if ($history.Length -ge 2) {&#xA;            $last    = (Get-History)[-1].CommandLine.Length&#xA;            $2ndlast = (Get-History)[-2].CommandLine.Length&#xA;&#xA;            Write-Host -NoNewline -ForegroundColor DarkGray &quot;Last command's length: $last &quot;&#xA;            if ($2ndlast -eq $last) {&#xA;                Write-Host -NoNewline -ForegroundColor Gray &quot;(?0)&quot;&#xA;            } elseif ($2ndlast -lt $last) {&#xA;                Write-Host -NoNewline -ForegroundColor Red &quot;(+$($last - $2ndlast))&quot;&#xA;            } else {&#xA;                Write-Host -NoNewline -ForegroundColor Green &quot;(-$($2ndlast - $last))&quot;&#xA;            }&#xA;        }&#xA;&#xA;        [Console]::Write(&quot;`n  &quot;)&#xA;        0..10 |&#xA;          ForEach-Object {&#xA;              [Console]::ForegroundColor = ($_+1) % 2 * 2 + 12&#xA;              [Console]::Write(&quot;$_         &quot;)&#xA;          }&#xA;        [Console]::Write(&quot;`n  &quot;)&#xA;        1..11 |&#xA;          ForEach-Object {&#xA;              [Console]::ForegroundColor = $_ % 2 * 2 + 12&#xA;              [Console]::Write('1234567890')&#xA;          }&#xA;        [Console]::ForegroundColor = 'White'&#xA;        [Console]::WriteLine()&#xA;&#xA;        &quot;&amp;gt; &quot;&#xA;    }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which then looks like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/hXC7F.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="15" OwnerDisplayName="Joey" LastActivityDate="2011-01-31T12:37:39.150" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="120" PostTypeId="1" AcceptedAnswerId="122" CreationDate="2011-01-31T21:34:45.317" Score="45" ViewCount="604" Body="&lt;p&gt;Right now we're using the standard +5/-2 for questions and +10/-2 for answers. However, this site is different from the trilogy and most other SE sites: coming up with a question generally takes more effort. I believe the value of questions:answers here is higher than on other sites.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How about we raise the rep gained from up-votes on questions to +10?&lt;/p&gt;&#xA;" OwnerUserId="39" LastActivityDate="2014-10-28T18:13:26.277" Title="Rep points for questions" Tags="|discussion|reputation|challenges|" AnswerCount="4" CommentCount="0" ClosedDate="2016-07-31T21:45:24.253" ContentLicense="CC BY-SA 2.5" />
  <row Id="122" PostTypeId="2" ParentId="120" CreationDate="2011-01-31T21:52:20.757" Score="65" Body="&lt;p&gt;Not only does it take more effort to pose a good problem here than asking questions on most other sites (not to mention how hard it will become to come up with good ideas once a lot of problems have already been posed), it's also much more selfless to ask a question:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On most other sites the primary reason to ask a question is because you want to know the answer. So the primary benefit you get for asking the question is finding out the answer. Here the main benefit of posing a problem is that the users have another problem to try their luck at. So basically the answerers are the ones who most benefit from a question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Further meta.stackoverflow also gives you 10 reputation points for question upvotes for similar reasons, so we wouldn't be the only exception to the rule.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So in short: Yes, I'm completely in favour of your proposal.&lt;/p&gt;&#xA;" OwnerUserId="30" LastActivityDate="2011-01-31T21:52:20.757" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="123" PostTypeId="2" ParentId="120" CreationDate="2011-01-31T22:08:42.483" Score="-1" Body="&lt;p&gt;On the whole I think this makes sense, but...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;...the curmudgeon in me notes that so far we've not been getting the best possible questions. Not so much in terms of the puzzles posed (though we could use some work there too (yeah, I know, if I'm complaining I should do something about it, and I'm still thinking)), but in terms of careful specification and description.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2011-01-31T22:08:42.483" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="124" PostTypeId="2" ParentId="5" CreationDate="2011-01-31T22:23:16.867" Score="12" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;challenges.stackexchange.com &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;is utterly meaningless compared to &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;codegolf.stackexchange.com&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Come to our site for.. uh.. er.. CHALLENGES! Code Golf means something to the intended audience, &quot;challenges&quot; does not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, I &lt;strong&gt;totally support clarifying (via the FAQ) that  Code Golf includes ALL programming puzzles not just shortest code&lt;/strong&gt;.&lt;/p&gt;&#xA;" OwnerUserId="97" LastActivityDate="2011-01-31T22:23:16.867" CommentCount="7" ContentLicense="CC BY-SA 2.5" />
  <row Id="125" PostTypeId="2" ParentId="5" CreationDate="2011-02-01T12:19:06.993" Score="8" Body="&lt;p&gt;I'm thinking of something along the lines of codingfun. It's short and gets across that this site is about coding for fun, which don't think any challenge/puzzle is not. Question is, is there too much outside our scope that would fall into coding for fun? I can't really think of anything major that goes against this site's purpose.&lt;/p&gt;&#xA;" OwnerUserId="39" LastActivityDate="2011-02-01T12:19:06.993" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="126" PostTypeId="2" ParentId="5" CreationDate="2011-02-01T12:35:43.120" Score="17" Body="&lt;p&gt;I personally I dislike both &lt;code&gt;codegolf.se&lt;/code&gt; and &lt;code&gt;challenges.se&lt;/code&gt; as names. The former is too specific and the latter isn't specific enough. I think the name of this &lt;code&gt;stackexchange&lt;/code&gt; needs to contain synonyms of the words &lt;code&gt;code&lt;/code&gt; &lt;strong&gt;and&lt;/strong&gt; &lt;code&gt;challenge&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I have a few suggestions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;codegames&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;codinggames&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;codecontest&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;codeduel&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;codeoff&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;codingfun&lt;/code&gt; (from marcog's &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5/site-title-and-domain/125#125&quot;&gt;post&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="62" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2011-02-19T22:26:19.757" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="127" PostTypeId="1" AcceptedAnswerId="128" CreationDate="2011-02-01T13:13:05.197" Score="11" ViewCount="257" Body="&lt;p&gt;This still poses a bit of a problem for me so far and I have experimented a bit (apologies to those I downvoted in those experiments).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On Stack Overflow it's pretty clear what warrants an up- or downvote. If the answer is correct then it gets an upvote, if it's incorrect it gets a downvote.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now I have observed, at least in me, that I hesitate giving any votes to answers on this site. Speaking with another user he told me similarly. He basically avoids voting on other answers unless it doesn't impact his position in the »vote ranking« for that question (so to speak). I tend to not upvote Golfscript solutions unless they are really very clever (personal thing) and other answers also rarely and if so, then mostly based on how nice it is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Downvotes are another matter as well. I may have made some enemies by downvoting answers on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/289/shortest-floor-function&quot;&gt;Shortest floor function&lt;/a&gt; that I perceived as incorrect (for not handling negative numbers correctly) – I made a mistake in one instance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Generally, how &lt;em&gt;should&lt;/em&gt; votes be given on this site? Are downvotes acceptable for answers that are wrong according to the task specification (such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/307/obfuscated-hello-world/332#332&quot;&gt;this one&lt;/a&gt;)? Is everyone encouraged to upvote the current shortest answer?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I guess it's a bit of a problem in how these sites are designed, since essentially votes can only ever be a popularity contest but what good is in using humans to impose an algorithm here (namely, bubbling the shortest answer to the top)? Should upvotes be only a general measure of »I like this solution because it looks nice or uses tricks I never would have thought of« and objective criteria are tallied separately?&lt;/p&gt;&#xA;" OwnerUserId="15" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2011-02-04T20:13:46.453" Title="How to go with up/downvotes for answers on golf or other challenges?" Tags="|discussion|voting|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="128" PostTypeId="2" ParentId="127" CreationDate="2011-02-01T13:53:27.003" Score="11" Body="&lt;p&gt;It's supposed to be about fun, isn't it? Don't stress too much about points - many of us were doing these on SO as CW questions for ages afterall.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Downvotes are only -2 anyway, so don't hurt too much. If you leave a comment saying the answer is wrong so you downvoted it - it gives the answerer a change to fix it and let you know that it works now.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you don't leave a comment, there's no way you'll ever know the answer is fixed unless you keep going back to check on it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Puzzle answers often go up as partially complete or slightly incorrect. I think you &lt;em&gt;should&lt;/em&gt; give people a chance to fix them, and it adds to the long term value of the site&lt;/p&gt;&#xA;" OwnerUserId="95" LastActivityDate="2011-02-01T13:53:27.003" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="129" PostTypeId="2" ParentId="6" CreationDate="2011-02-01T13:58:50.057" Score="7" Body="&lt;p&gt;Don't ask trivial code-golfs and then complain when people give you trivial answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are several &quot;languages&quot; that can print &quot;Hello World&quot; with one character, so why do we keep seeing questions asking for it. Instead of trying to develop rules to exclude those languages just pick a different phrase&lt;/p&gt;&#xA;" OwnerUserId="95" LastActivityDate="2011-02-01T13:58:50.057" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="132" PostTypeId="1" AcceptedAnswerId="152" CreationDate="2011-02-02T04:53:55.027" Score="9" ViewCount="256" Body="&lt;p&gt;Maybe I'm overgeneralizing, but it seems to me like if we make &lt;code&gt;[language-agnostic]&lt;/code&gt; a tag, we're going to have an &lt;strong&gt;awful&lt;/strong&gt; lot of questions with it. I'm pretty sure every golf I've seen so far, on here and SO, was attempted in more than one language. And so far, it sounds like a very large percentage of questions here will be golfs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, is this an appropriate tag?&lt;/p&gt;&#xA;" OwnerUserId="141" LastActivityDate="2014-04-23T09:29:32.537" Title="Is [language-agnostic] an appropriate tag?" Tags="|discussion|tags|" AnswerCount="5" CommentCount="3" ContentLicense="CC BY-SA 2.5" />
  <row Id="133" PostTypeId="2" ParentId="132" CreationDate="2011-02-02T05:37:39.120" Score="3" Body="&lt;p&gt;I think language agnostic is a great tag for asking for help with specific challenges such as &lt;code&gt;Project Euler&lt;/code&gt;. As Nakilon says in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1/are-questions-from-google-code-jam-topcoder-etc-on-topic&quot;&gt;Are Questions from...&lt;/a&gt;  It is a great opportunity to discuss programming techniques using generic pseudo code without discussing a specific and full solutions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Marcog suggested using language specific tags such as &lt;code&gt;ruby-golf&lt;/code&gt;, &lt;code&gt;perl-golf&lt;/code&gt;, etc for the question: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/6/what-should-be-the-rules-for-questions-on-this-site/8#8&quot;&gt;What should be the rules...&lt;/a&gt;. If we go with Marcog's suggestion I think &lt;code&gt;language-agnostic&lt;/code&gt; could also be used to indicate a question open to all languages.&lt;/p&gt;&#xA;" OwnerUserId="55" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2011-02-02T06:12:54.337" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="134" PostTypeId="2" ParentId="16" CreationDate="2011-02-02T05:40:21.160" Score="0" Body="&lt;p&gt;Some of the questions found on &lt;a href=&quot;http://codegolf.com/competition/browse&quot; rel=&quot;nofollow noreferrer&quot;&gt;codegolf.com&lt;/a&gt; challenges are really great and I think worth replicating here.  The advantage to this site oppose to codegolf is that all solutions are open so you can see the creativity of fellow golfers. I suppose the negative side is that it will allow for unscrupulous people to take advantage of this site and cheat at other competitions. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;As Andy brought up there is another similar question which relates to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1/are-questions-from-google-code-jam-topcoder-etc-on-topic&quot;&gt;competitions&lt;/a&gt;. I agree with the top answer that we should assist non-terminating contests with pseudo code. However, I think this question should directly relate to non-competition questions. I think this site is ultimately about having fun. The advantage of code-golf is that we can share our answers and learn from one another as code-golfers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One last addition question. As it is possible that &lt;a href=&quot;http://stackoverflow.com&quot;&gt;stackoverflow&lt;/a&gt; questions may be eventually be &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/20/will-golf-and-puzzle-questions-migrate-here-from-so&quot;&gt;migrated&lt;/a&gt;, should we only allow non-stackoverflow questions?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are a few of the duplicates I found off hand:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;CodeGolf.com:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;[Tower of Hanoi] (deleted)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/2/99-bottles-of-beer&quot;&gt;99 Bottles Of Beer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/84/interpret-brainfuck&quot;&gt;Brainfuck&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/10/n-queens-problem&quot;&gt;NQueens&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Stackoverflow:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://stackoverflow.com/questions/1352587/code-golf-morse-code&quot;&gt;MorseCode&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="55" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2011-02-02T05:40:21.160" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="135" PostTypeId="2" ParentId="64" CreationDate="2011-02-02T06:07:19.383" Score="1" Body="&lt;p&gt;It's definitely subjective, but I still think it's a good (if optional) idea. For example, a newbie might like to go through a list of questions marked &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/easy&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;easy&amp;#39;&quot; rel=&quot;tag&quot;&gt;easy&lt;/a&gt; when first visiting (if this were implemented right now, I can tell you I'd probably spend more time on &quot;easy&quot; ones right now, since I'm new to code challenges). Those people who consider themselves experts might want to concentrate primarily on questions marked &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/expert&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;expert&amp;#39;&quot; rel=&quot;tag&quot;&gt;expert&lt;/a&gt;. And so on.&lt;/p&gt;&#xA;" OwnerUserId="141" LastEditorUserId="62402" LastEditDate="2018-02-26T21:55:51.977" LastActivityDate="2018-02-26T21:55:51.977" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="136" PostTypeId="1" CreationDate="2011-02-02T14:30:04.563" Score="3" ViewCount="235" Body="&lt;p&gt;The question appeared on chat. For the &lt;em&gt;Hello, world!&lt;/em&gt; problem &lt;code&gt;Uryyb, jbeyq!&lt;/code&gt; is a solution in rot13, but rot13 is not a general purpose language. Should these languages be allowed?&lt;/p&gt;&#xA;" OwnerUserId="32" LastActivityDate="2011-02-02T20:55:58.247" Title="Should the programming language be Turing-Complete?" Tags="|discussion|" AnswerCount="2" CommentCount="2" ClosedDate="2017-06-19T10:49:02.750" ContentLicense="CC BY-SA 2.5" />
  <row Id="137" PostTypeId="2" ParentId="136" CreationDate="2011-02-02T15:16:24.000" Score="4" Body="&lt;p&gt;In this specific case, the answer could be written as a bash script that includes the &lt;code&gt;rot13&lt;/code&gt; call. So it's tricky to eliminate any such answers and it'll be hard to police. I think that the community will do the appropriate job of voting these answers up/down based on how sensible they are.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So until a really inappropriate language comes up my vote is yes, they should be allowed.&lt;/p&gt;&#xA;" OwnerUserId="39" LastActivityDate="2011-02-02T15:16:24.000" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="138" PostTypeId="2" ParentId="66" CreationDate="2011-02-02T15:55:43.207" Score="3" Body="&lt;p&gt;I would also like to see more interesting problems of which the point isn't just to golf the lowest, but also (or instead, in some cases) to provide a problem-solving challenge or whatever. And I think golfing has its place as a competition. But I imagine that, if you participate in golfing, in an effort to lower your score, you will probably explore the language you're in more, teach yourself optimization, and possibly branch out to learn new languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But that's just an educated guess. I haven't really done any real golfing yet.&lt;/p&gt;&#xA;" OwnerUserId="141" LastActivityDate="2011-02-02T15:55:43.207" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="139" PostTypeId="2" ParentId="136" CreationDate="2011-02-02T20:55:58.247" Score="5" Body="&lt;p&gt;I don't think we need to over regulate here. The answer does slip past 2 of the 3 conditions already imposed by the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The simple fix is to ask slightly harder questions. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Probably it's a good idea to aim in say the 40-100 char range for the best perl/golfscript/ruby/python answers when you compose a question.&lt;/p&gt;&#xA;" OwnerUserId="95" LastActivityDate="2011-02-02T20:55:58.247" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="140" PostTypeId="2" ParentId="112" CreationDate="2011-02-02T21:03:00.270" Score="0" Body="&lt;p&gt;Usually I am using vim, so for one liners I position the cursor on the last character and read off that position&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For multiple lines, I save the file and subtract 1 from the reported size (because of the extra newline)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I solve a problem in one line in the python interpreter, I'll just paste it into&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt; len(&quot;&quot;&quot;&amp;lt;solution&amp;gt;&quot;&quot;&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(I don't think I've ever had an answer with &lt;code&gt;&quot;&quot;&quot;&lt;/code&gt; in it :))&lt;/p&gt;&#xA;" OwnerUserId="95" LastActivityDate="2011-02-02T21:03:00.270" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="141" PostTypeId="1" CreationDate="2011-02-03T00:05:55.883" Score="9" ViewCount="589" Body="&lt;p&gt;I had posted an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/365/obfuscated-rickroll-script&quot;&gt;&quot;obfuscated rickroll in Greasemonkey&quot;&lt;/a&gt; challenge, which I have deleted in response to Mike Bethany's comment that answers to the question would be of primary use to &quot;spammers.&quot; In general, I feel that a primary issue is that of obfuscated JavaScript, so I would like the community's input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Why should we allow obfuscated JavaScript?&lt;/strong&gt; JavaScript is a programming language like any other, and code obfuscation is a valid and on-topic challenge on this site. Would we not allow obfuscated Python, Lua, or C#?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Why should we not allow obfuscated JavaScript?&lt;/strong&gt; JavaScript is essential to many web browser &lt;a href=&quot;http://en.wikipedia.org/wiki/Exploit_%28computer_security%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;security exploits&lt;/a&gt;. It is already hard enough for antivirus software and firewalls to detect malicious payloads obfuscated using common, simple techniques; we shouldn't make it any harder by describing any &quot;new&quot; ways to obfuscate JavaScript code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Which has more merit?&lt;/p&gt;&#xA;" OwnerUserId="163" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2022-11-16T12:01:13.127" Title="Should obfuscated JavaScript be allowed?" Tags="|discussion|policy|" AnswerCount="5" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="142" PostTypeId="2" ParentId="141" CreationDate="2011-02-03T00:29:19.687" Score="27" Body="&lt;p&gt;I don't believe in security by obscurity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the only way (we think) we keep web browsing safe is by &quot;not disclosing&quot; ways to make obfuscated JS, I dare say the black hats are quite a few steps ahead of us.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, in my personal opinion, you should reopen your question. :-)&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2011-02-03T00:29:19.687" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="143" PostTypeId="1" AcceptedAnswerId="148" CreationDate="2011-02-03T00:45:51.727" Score="9" ViewCount="278" Body="&lt;p&gt;On a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/141/104&quot;&gt;related&lt;/a&gt; thread to this question, what steps can one take to avoid executing obfuscated malicious code (in the unlikely case someone sees fit to post some in a solution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it best to just avoid testing code we don't understand?&lt;/p&gt;&#xA;" OwnerUserId="104" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2011-03-02T18:07:14.937" Title="How to avoid executing malicious obfuscated code?" Tags="|discussion|testing|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="144" PostTypeId="1" CreationDate="2011-02-03T02:59:00.713" Score="-3" ViewCount="315" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is currently used on 40 of 62 questions.  Like other sites I've seen launched, such a tag allows users to throw it on their questions without having to bother thinking of a better, more specific, &lt;em&gt;more useful&lt;/em&gt; tag.&lt;/p&gt;&#xA;&lt;p&gt;Should the tag be blacklisted so it cannot be used?&lt;/p&gt;&#xA;&lt;h3&gt;Further explanation/comparison&lt;/h3&gt;&#xA;&lt;p&gt;On Electronics and Robotics, we (unfortunately) have the &lt;a href=&quot;https://electronics.stackexchange.com/questions/tagged/electronics&quot;&gt;&lt;code&gt;[electronics]&lt;/code&gt;&lt;/a&gt; tag.  While it's true that not every question on E&amp;amp;R will be electronics related (it could be software, robotics, or higher-level project management stuff), we are steadily trying to remove said tags because that tag alone is near-meaningless as &lt;em&gt;it encompasses too much&lt;/em&gt; (e.g. analog vs. digital).&lt;/p&gt;&#xA;&lt;p&gt;That said, that rationale isn't as good here as software is less broad (at least with respect to most of the puzzles I've seen).&lt;/p&gt;&#xA;&lt;p&gt;Perhaps the root question here is: &lt;strong&gt;Is tagging a question with &lt;em&gt;only&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; acceptable?&lt;/strong&gt;  If not, how can it be avoided?&lt;/p&gt;&#xA;" OwnerUserId="176" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-08-18T12:21:21.363" Title="Is tagging a question with only [code-golf] acceptable? Should the tag be blacklisted?" Tags="|discussion|tags|" AnswerCount="4" CommentCount="3" ContentLicense="CC BY-SA 2.5" />
  <row Id="145" PostTypeId="2" ParentId="144" CreationDate="2011-02-03T03:34:22.663" Score="2" Body="&lt;p&gt;You should read &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14/is-code-challenge-necessary/15#15&quot;&gt;this post&lt;/a&gt; (or rather, its comments). They explain the rationale for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2011-02-03T03:34:22.663" CommentCount="11" ContentLicense="CC BY-SA 2.5" />
  <row Id="146" PostTypeId="1" CreationDate="2011-02-03T09:54:41.760" Score="2" ViewCount="153" Body="&lt;p&gt;There are a lot of questions now that could be tagged: &quot;sudoku&quot;, &quot;sorting&quot;, &quot;maze&quot; etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we tag them?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What is the current policy on tagging? Tag everything that appears thrice or more? Tag at-will?&lt;/p&gt;&#xA;" OwnerUserId="46" LastActivityDate="2011-03-11T19:33:15.377" Title="What's our policy on tags?" Tags="|discussion|policy|tags|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="147" PostTypeId="1" CreationDate="2011-02-03T12:46:45.820" Score="3" ViewCount="82" Body="&lt;p&gt;Companies sometimes hold mini programming contests in order to select potential employees based on the answers they give. We've already had 2 questions (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/400/correctly-implement-the-exon-chaining-algorithm&quot;&gt;this&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/266/nokia-mystery-puzzle&quot;&gt;this&lt;/a&gt;) of this type.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Clearly some of these questions may be interesting, but should we treat them the same as we treat questions from currently running contests?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Related Questions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1/are-questions-from-google-code-jam-topcoder-etc-on-topic&quot;&gt;Are questions from Google Code Jam, TopCoder, etc. on-topic?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/16/what-are-the-policies-for-threads-relating-to-facebook-puzzles-project-euler-uv&quot;&gt;What are the policies for threads relating to Facebook Puzzles, Project Euler, UVa, SPOJ, etc.?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="62" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2011-02-03T13:27:08.283" Title="What should the policy be on questions currently being used for recruiting?" Tags="|discussion|policy|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="148" PostTypeId="2" ParentId="143" CreationDate="2011-02-03T13:11:38.453" Score="9" Body="&lt;p&gt;&lt;strong&gt;On the one hand, it probably is.&lt;/strong&gt; Though some languages can be sandboxed, and you can test arbitrary programs if the sandbox is set up right, those languages are few and far in between, and security is a question of the &quot;weakest link&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;On the other hand, it may not be necessary.&lt;/strong&gt; Posting malicious code violates section 3(e) of the &lt;a href=&quot;https://codegolf.stackexchange.com/legal&quot;&gt;terms of service&lt;/a&gt;, and moderators have the right to take adverse action against such users. Users (especially high-rep ones) usually do not want to jeopardise their hard-earned rep by engaging in such dubious actions.&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2011-02-03T13:11:38.453" CommentCount="3" ContentLicense="CC BY-SA 2.5" />
  <row Id="149" PostTypeId="2" ParentId="147" CreationDate="2011-02-03T13:27:08.283" Score="8" Body="&lt;p&gt;Absolutely they should be posted here. Some of the questions are quite fun, and if the companies are smart, they will come over here and see how much better our answers are :)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One day they might learn they should just post the questions here themselves and recruit from here&lt;/p&gt;&#xA;" OwnerUserId="95" LastActivityDate="2011-02-03T13:27:08.283" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="150" PostTypeId="2" ParentId="143" CreationDate="2011-02-03T18:03:34.607" Score="5" Body="&lt;p&gt;I think the community will handle this. Its a non-issue. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I saw malicious, or potentially malicious code I would:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;vote it down&lt;/li&gt;&#xA;&lt;li&gt;add a comment in all caps&lt;/li&gt;&#xA;&lt;li&gt;flag it. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;(order might vary). &lt;/p&gt;&#xA;" OwnerUserId="61" LastActivityDate="2011-02-03T18:03:34.607" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="151" PostTypeId="2" ParentId="141" CreationDate="2011-02-03T18:06:35.540" Score="13" Body="&lt;p&gt;isn't the point of code golf to solve in a few characters as possible? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If so, isn't obfuscation part of the game? &lt;/p&gt;&#xA;" OwnerUserId="61" LastActivityDate="2011-02-03T18:06:35.540" CommentCount="3" ContentLicense="CC BY-SA 2.5" />
  <row Id="152" PostTypeId="2" ParentId="132" CreationDate="2011-02-03T21:54:45.833" Score="7" Body="&lt;p&gt;To play devil's advocate:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think &lt;code&gt;ruby-golf&lt;/code&gt; and the like are good tags.  But &lt;code&gt;language-agnostic&lt;/code&gt; is bad because it's implied by the lack of &lt;code&gt;x-golf&lt;/code&gt; tags and &quot;in language X&quot; in the question.  It has no use.&lt;/p&gt;&#xA;" OwnerUserId="76" LastActivityDate="2011-02-03T21:54:45.833" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="154" PostTypeId="2" ParentId="132" CreationDate="2011-02-03T23:01:00.460" Score="0" Body="&lt;p&gt;&lt;code&gt;language-agnostic&lt;/code&gt; is not a good tag. If it is a true code golf then it will be a language specific solution. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, if it is not a code golf, like Project Euler, it is about algorithms and should be tagged accordingly. &lt;/p&gt;&#xA;" OwnerUserId="61" LastActivityDate="2011-02-03T23:01:00.460" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="155" PostTypeId="2" ParentId="144" CreationDate="2011-02-03T23:08:24.913" Score="8" Body="&lt;p&gt;As long as we expect to have more than one game on the site, questions should be tagged with the type of game. The fact that code-golf dominates does not change that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What we want is &lt;em&gt;more&lt;/em&gt; tags. But the trick is guessing &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/146/78&quot;&gt;how to categorize these games in a way that will help people&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Someone suggested a tag for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; problems. That would be good.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2011-02-04T00:34:53.370" CommentCount="3" ContentLicense="CC BY-SA 2.5" />
  <row Id="156" PostTypeId="2" ParentId="132" CreationDate="2011-02-03T23:13:39.417" Score="9" Body="&lt;p&gt;The situation on SO was driven in part by a community decision that code-golf was to be agnostic (i.e. we weren't having it if it wasn't). I don't believe that that is going to be the case here. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;My take: banning &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-agnostic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-agnostic&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-agnostic&lt;/a&gt; amounts to a claim that all puzzles are open to all languages by default and the asker must specify to restrict it. And I'm OK with that, but if that is our intent lets be clear about it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Otherwise &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-agnostic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-agnostic&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-agnostic&lt;/a&gt; should stay.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2011-02-03T23:13:39.417" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="157" PostTypeId="2" ParentId="146" CreationDate="2011-02-04T00:06:13.060" Score="2" Body="&lt;p&gt;I think as long as a tag describes a &lt;em&gt;class&lt;/em&gt; of problems we can leave them. &lt;code&gt;maze&lt;/code&gt; for example could mean maze-generation, maze-solving in the general case as well as more specific tasks and thus (in future) could be a useful tag.&lt;/p&gt;&#xA;" OwnerUserId="15" LastActivityDate="2011-02-04T00:06:13.060" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="158" PostTypeId="2" ParentId="146" CreationDate="2011-02-04T00:34:14.493" Score="7" Body="&lt;p&gt;We want an end state where we get things tagged by&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/144/should-the-code-golf-tag-be-blacklisted/155#155&quot;&gt;Type of game/puzzle/challenge&lt;/a&gt; (i.e &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, and other that seem good (I have an irrational prejudice against &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt;, but if we must...))&lt;/li&gt;&#xA;&lt;li&gt;Rule variations (this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-agnostic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-agnostic&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-agnostic&lt;/a&gt; and/or &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/132/78&quot;&gt;language specific tags would live&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;General topics to help users pick posts in domains that interest them. Things like:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/146/whats-our-policy-on-tags/157#157&quot;&gt;Joey's&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/maze&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;maze&amp;#39;&quot; rel=&quot;tag&quot;&gt;maze&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; for things like the many ascii figure problems LiraNuna posted on Stack Overflow&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/word-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;word-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;word-puzzle&lt;/a&gt; for things like crossword and hangman&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pattern-matching&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pattern-matching&amp;#39;&quot; rel=&quot;tag&quot;&gt;pattern-matching&lt;/a&gt; for regexp engines and the current &lt;a href=&quot;https://codegolf.stackexchange.com/q/467/78&quot;&gt;glob question&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/simulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;simulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;simulation&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/data-structure&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;data-structure&amp;#39;&quot; rel=&quot;tag&quot;&gt;data-structure&lt;/a&gt; for things like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/478/free-a-binary-tree&quot;&gt;Martin's binary tree question&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/path-finding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;path-finding&amp;#39;&quot; rel=&quot;tag&quot;&gt;path-finding&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;and so on&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The biggest problem is that until we've been at this for a while we won't know what the categories are. So, we should encourage pretty free tagging for a while, and then start using the synonym mechanism and editing to bring the outliers into conformance with the practice that develops.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt; I've started a campaign to add descriptive tags to as many just-tagged-code-golf type questions as I can. Help would be appreciated, as would review of my tagging choices.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this process, I have &lt;a href=&quot;https://codegolf.stackexchange.com/q/1299/78&quot;&gt;already&lt;/a&gt; invented &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/repeated-transformation&quot;&gt;three&lt;/a&gt; new &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/252/78&quot;&gt;tags&lt;/a&gt;. Those would be particularly good candidates for review.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2011-03-11T19:33:15.377" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="159" PostTypeId="2" ParentId="66" CreationDate="2011-02-04T01:42:53.620" Score="0" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Beta Q&amp;amp;A site for code golfers and for&#xA;  those who interested in code golfing&#xA;  (from beginners to experts), and&#xA;  programming puzzles.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="268" LastActivityDate="2011-02-04T01:42:53.620" CommentCount="6" ContentLicense="CC BY-SA 2.5" />
  <row Id="160" PostTypeId="2" ParentId="66" CreationDate="2011-02-04T13:43:38.257" Score="3" Body="&lt;p&gt;When I committed to codegolf.SE, I was under the impression that the site is about programming puzzles in general not just code golf. I hope that still holds true.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I enjoy code code golf as much as the next guy, but being only about code golf IMHO is a little too narrow for my tastes. It is possible that I am in the minority here (in which case ignore my post), but I for one really would like this site to be about programming puzzles in general.&lt;/p&gt;&#xA;" OwnerUserId="31" LastEditorUserId="31" LastEditDate="2011-02-05T17:56:10.550" LastActivityDate="2011-02-05T17:56:10.550" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="161" PostTypeId="2" ParentId="120" CreationDate="2011-02-04T14:23:33.510" Score="-1" Body="&lt;p&gt;I'm in favor of that!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How about also raising reputation based on the number of valid (e.g. up-voted) answers submitted for the question?&lt;/p&gt;&#xA;" OwnerUserId="305" LastActivityDate="2011-02-04T14:23:33.510" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="162" PostTypeId="2" ParentId="144" CreationDate="2011-02-04T17:27:23.883" Score="2" Body="&lt;p&gt;I think the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; tag shouldn't be removed, because we may ask code golf, code bowling and even other programming puzzles there. But &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; seems unneccessary. And I'm not sure if we need &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-agnostic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-agnostic&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-agnostic&lt;/a&gt;, either.&lt;/p&gt;&#xA;" OwnerUserId="344" LastEditorUserId="199" LastEditDate="2011-02-24T09:10:53.517" LastActivityDate="2011-02-24T09:10:53.517" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="163" PostTypeId="1" CreationDate="2011-02-04T18:42:24.410" Score="1" ViewCount="90" Body="&lt;p&gt;I've had a couple of Q &amp;amp; As on the meta site that not been converted into CWs yet no rep has been given. Any ideas? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;thanks&lt;/p&gt;&#xA;" OwnerUserId="61" LastEditorUserId="9" LastEditDate="2013-07-07T15:43:37.877" LastActivityDate="2013-07-07T15:43:37.877" Title="no reputation being generated" Tags="|support|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="164" PostTypeId="2" ParentId="163" CreationDate="2011-02-04T18:47:01.587" Score="5" Body="&lt;p&gt;That is the way it is supposed to be. Excepting meta.stackoverflow.com metas draw their rep from the parent site.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2011-02-04T18:47:01.587" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="165" PostTypeId="1" CreationDate="2011-02-04T19:04:05.877" Score="5" ViewCount="237" Body="&lt;p&gt;What is the etiquette of answering your own question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you already know the optimum solution to a question,&lt;br&gt;&#xA;how long do you give others before posting the answer?&lt;/p&gt;&#xA;" OwnerUserId="186" LastActivityDate="2011-03-06T19:10:28.283" Title="Answering your own Question" Tags="|discussion|" AnswerCount="1" CommentCount="0" ClosedDate="2017-08-01T13:04:06.567" ContentLicense="CC BY-SA 2.5" />
  <row Id="166" PostTypeId="2" ParentId="165" CreationDate="2011-02-04T19:07:01.430" Score="1" Body="&lt;p&gt;Presumably about (or at least triggered by) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/478/free-a-binary-tree&quot;&gt;your freeing a binary tree question&lt;/a&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To the extent that the point of this business is having fun, I'd say you should wait until&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a couple of days have passed so that people have time to explore the problem&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;someone else posts an equivalent solution&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2011-02-04T19:07:01.430" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="167" PostTypeId="1" AcceptedAnswerId="168" CreationDate="2011-02-04T19:21:13.053" Score="4" ViewCount="487" Body="&lt;p&gt;I've &lt;a href=&quot;https://codegolf.stackexchange.com/questions/455/code-golf-guessing-words/460#460&quot;&gt;recently saw someone&lt;/a&gt;, who says that their code is 350 characters long.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Problem&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;It can vary depending on platform.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Code length compared across various platforms&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http:///&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;CR-LF, \r\n&quot;&gt;&lt;strong&gt;Windows&lt;/strong&gt;&lt;/a&gt;: 371 characters&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http:///&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;CR only, \r&quot;&gt;&lt;strong&gt;Macintosh&lt;/strong&gt;&lt;/a&gt;: 350 characters&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http:///&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;LF only, \n&quot;&gt;&lt;strong&gt;Unix/Linux&lt;/strong&gt;&lt;/a&gt;: 350 characters&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;My suggestions&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Do either one of these:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Add an automatic character count, so it will be consistent.&lt;/li&gt;&#xA;&lt;li&gt;Require users to use a specific line break format (stated in the FAQ or when asking/answering questions), and calculate character count based on that. It can be done very easily with most text editors, like Notepad++.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="344" LastEditorUserId="68942" LastEditDate="2021-06-09T05:49:52.267" LastActivityDate="2021-06-09T05:49:52.267" Title="Line break formats and character numbers" Tags="|discussion|support|feature-request|status-completed|" AnswerCount="1" CommentCount="1" ClosedDate="2016-09-22T21:30:47.040" ContentLicense="CC BY-SA 2.5" />
  <row Id="168" PostTypeId="2" ParentId="167" CreationDate="2011-02-04T19:26:51.067" Score="18" Body="&lt;p&gt;I would always treat newlines as single characters. Their representation as 2 bytes on windows is a historical oddity (and perhaps an abomination, too, but that is another story).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Figuring out how to count that way is your problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unix people have an equivalent (if less distressing) issue where many editors append a trailing (and unnecessary) newline to files automatically for historical reasons relating to fragile core command-line tools. Usually I just accept the one character penalty on mine.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="78" LastEditDate="2011-02-04T20:15:15.783" LastActivityDate="2011-02-04T20:15:15.783" CommentCount="9" ContentLicense="CC BY-SA 2.5" />
  <row Id="169" PostTypeId="2" ParentId="127" CreationDate="2011-02-04T20:13:46.453" Score="5" Body="&lt;p&gt;I think upvotes &lt;em&gt;should&lt;/em&gt; be used for:  »I like this solution because it looks nice or uses tricks I never would have thought of«.   There is an objective measure of shortest solution - the character count.  So there is no need to withhold votes for a longer solution to protect your position - the shortest is the shortest regardless of vote total.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we only vote for the shortest  solutions, then there won't be that many points in circulation, and it will take forever for anyone except the very best golfers to get to moderator level.  People who participate heavily but are still improving their game won't get many points.   But earning privileges here should be about solid participation,  not purely about mad golf skills.&lt;/p&gt;&#xA;" OwnerUserId="152" LastActivityDate="2011-02-04T20:13:46.453" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="170" PostTypeId="1" CreationDate="2011-02-05T01:46:52.980" Score="22" ViewCount="1581" Body="&lt;h2&gt;Current version:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The current version of the script is &lt;b&gt;0.37&lt;/b&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I was inspired by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/167/line-break-formats-and-character-numbers&quot;&gt;this&lt;/a&gt; Meta post to write a UserScript that would automatically tally up the size of code blocks and display the count underneath.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A couple weeks later and I now have a giant UserScript that is over 32kb in size :)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Well, how can I install it?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm glad you asked! Since this is a UserScript, a few browsers allow you to install it by simply clicking on the link below and downloading it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://files.quickmediasolutions.com/codegolf/count_it.user.js&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://files.quickmediasolutions.com/codegolf/count_it.user.js&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;I have tested the script on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/583/95&quot;&gt;Chrome (needs this workaround)&lt;/a&gt;, Firefox (with GreaseMonkey), and Opera. It is reported to work on Safari using GreaseKit.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What does it do exactly?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This list seems to grow every day, but here is a (somewhat) exhaustive list:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Analysis and display of &lt;em&gt;exact&lt;/em&gt; character count of each code entry (with syntax highlighting):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/6fXtl.jpg&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note: you can even directly run some entries by clicking the '[Run]' link&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Summary of entries for a particular question, including the current winner(s) for shortest code:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/vBFeI.png&quot;&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The ability to sort the answers on the page by the size of their code:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/0v8ZF.png&quot;&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;An evolving options menu for changing the settings for the script:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/mxmq9.png&quot;&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;An experimental theme that can be injected onto the pages of the site:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/xH3wb.png&quot;&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;What about updates?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Yes, this humble UserScript is now capable of updating itself. Every 24 hours, it checks to see if there is a new version available. If so, it will prompt you to download it. You will have the option of choosing not to install the update if you don't want to.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Version History:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.37&lt;/strong&gt; fixed support for some languages, deleted answers no longer count&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.36&lt;/strong&gt; added syntax highlighting&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.35&lt;/strong&gt; added warning for &gt;30 answers, added live preview&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.34&lt;/strong&gt; added ability to run certain code entries&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.33&lt;/strong&gt; added menu item for reporting problems with the current page&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.32&lt;/strong&gt; made enhancements to theme, added more settings, changed about box&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.31&lt;/strong&gt; added options to dialog, added experimental theme&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.30&lt;/strong&gt; more reorganization, added smooth scrolling&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.29&lt;/strong&gt; complete reorganization of code, added HTML5 local storage support&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.28&lt;/strong&gt; added settings menu to top of page, fixed non-unique update URL problem&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.27&lt;/strong&gt; fixed script grabbing extra text for username field, added support for &lt;code&gt;&amp;lt;h3&amp;gt;&lt;/code&gt; elements&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.26&lt;/strong&gt; added support for code-bowling posts&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.25&lt;/strong&gt; script now only runs on questions with code-golf tag&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.24&lt;/strong&gt; added DC programming language, fixed tab showing up on wrong pages&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.23&lt;/strong&gt; added special handler for C++ code entries&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.22&lt;/strong&gt; fixed links with new sort order, fixed multiple tied winners problem&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.21&lt;/strong&gt; added new sorting option&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.20&lt;/strong&gt; support for Firefox and Opera added, fixed jQuery include bug&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.19&lt;/strong&gt; added username, added more languages&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.18&lt;/strong&gt; added language to header, reorganized language code&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.17&lt;/strong&gt; fixed jQuery load bug, detects HQ9+ entries, fixed off-by-one count errors&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.16&lt;/strong&gt; fixed comment bug, moved header block, only first code block qualifies&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0.15&lt;/strong&gt; added auto-update support&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="362" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2012-11-28T03:40:42.133" Title="Code Golf UserScript to help in navigating the site [v0.37 now available]" Tags="|discussion|" AnswerCount="9" CommentCount="71" CommunityOwnedDate="2011-02-10T02:28:49.470" ContentLicense="CC BY-SA 3.0" />
  <row Id="171" PostTypeId="2" ParentId="1" CreationDate="2011-02-05T02:05:22.020" Score="-1" Body="&lt;p&gt;TopCoder and possibly CodeJam problems are probably excluded because I expect their terms of use would disallow reproduction without explicitly granted permission.&lt;/p&gt;&#xA;" OwnerUserId="364" LastActivityDate="2011-02-05T02:05:22.020" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="172" PostTypeId="1" AcceptedAnswerId="173" CreationDate="2011-02-05T10:04:41.303" Score="3" ViewCount="220" Body="&lt;p&gt;I only find this description, which is partly recursive: &quot;Code Golf - Stack Exchange is for programming puzzles and code golf&quot;. Maybe for native english speakers it is perfectly obvious, but I didn't find a translation for 'code golf'. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it the attempt to find the shortest solution?&lt;/p&gt;&#xA;" OwnerUserId="373" LastActivityDate="2021-05-20T13:16:14.923" Title="What is code golf?" Tags="|support|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 2.5" />
  <row Id="173" PostTypeId="2" ParentId="172" CreationDate="2011-02-05T11:29:29.470" Score="4" Body="&lt;p&gt;In the game of golf, you win by minimising the number of strokes to complete the game.&lt;/p&gt;&#xA;&lt;p&gt;In code-golf, each character is equivalent to a stroke in golf, so you win by using the smallest number of bytes.&lt;/p&gt;&#xA;&lt;p&gt;You may even see people using the words &amp;quot;bytes&amp;quot;, &amp;quot;characters&amp;quot;, and &amp;quot;strokes&amp;quot; interchangeably here.&lt;/p&gt;&#xA;" OwnerUserId="95" LastEditorUserId="68942" LastEditDate="2021-05-20T13:16:14.923" LastActivityDate="2021-05-20T13:16:14.923" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="174" PostTypeId="2" ParentId="42" CreationDate="2011-02-05T11:50:15.217" Score="4" Body="&lt;p&gt;Other than indentation issue, I am having problem with &lt;strong&gt;tab&lt;/strong&gt; getting converted to &lt;strong&gt;3 spaces&lt;/strong&gt; in markdown editor, and code become broken.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/474/write-a-json-validator/527#527&quot;&gt;here&lt;/a&gt; is my post if someone think, that's not the issue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think tab character shouldn't do force converting to 3 spaces for this site.&lt;/p&gt;&#xA;" OwnerUserId="132" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2011-02-05T11:56:17.833" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="176" PostTypeId="2" ParentId="170" CreationDate="2011-02-06T01:03:24.057" Score="1" Body="&lt;h2&gt;Questions to consider:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here are some things to be considered and discussed as this little script grows in functionality.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;What languages do we want to skip?&lt;/strong&gt; Someone on the chat mentioned that there are some languages (like HQ9+) that should be skipped and not counted when determining the smallest piece of code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Update:&lt;/strong&gt; HQ9+ is now disqualified.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Does the character totaling code need adjustment?&lt;/strong&gt; There are a few things to consider when totaling up the characters in a code snippet. Like: &lt;em&gt;Should all newlines count?&lt;/em&gt;, &lt;em&gt;Should trailing and leading newlines count?&lt;/em&gt;, &lt;em&gt;Indentation?&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Please comment below to voice your opinion on these issues.&lt;/p&gt;&#xA;" OwnerUserId="362" LastEditorUserId="362" LastEditDate="2011-02-06T21:07:53.383" LastActivityDate="2011-02-06T21:07:53.383" CommentCount="3" ContentLicense="CC BY-SA 2.5" />
  <row Id="179" PostTypeId="2" ParentId="2" CreationDate="2011-02-07T00:39:28.067" Score="1" Body="&lt;p&gt;&lt;strong&gt;What is the scope of CodeGolf.SE?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;[The site (if not domain) has been renamed &quot;Programming Puzzles &amp;amp; Code Golf&quot;, so this entry may well be redundant. I'm keeping it here for posterity.]&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;CodeGolf.SE is the site for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2/how-should-our-faq-look-like/3#3&quot;&gt;code golf&lt;/a&gt; and other programming puzzles. We use the name CodeGolf.SE for two reasons:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&quot;Code golf&quot; is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5/site-title-and-domain/81#81&quot;&gt;the most popular kind of coding game on Stack Overflow&lt;/a&gt;, so CodeGolf.SE should appeal to that crowd&lt;/li&gt;&#xA;&lt;li&gt;CodeGolf.SE is &lt;em&gt;much&lt;/em&gt; easier to say and type than CodeGolfAndProgrammingPuzzles.SE.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;When writing a question, please tag it with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; if it's a golfing question, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; if it's not.&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2011-03-10T06:30:13.667" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="180" PostTypeId="2" ParentId="170" CreationDate="2011-02-07T05:58:28.297" Score="2" Body="&lt;p&gt;Dealing with line breaks correctly is non-trivial.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Just looking at c-like languages there are at least three classes&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The newline ending a pre-processor line. These are required and &lt;em&gt;should&lt;/em&gt; count.&lt;/li&gt;&#xA;&lt;li&gt;Newlines inserted only for limiting line length. They &lt;em&gt;shouldn't&lt;/em&gt; count &lt;em&gt;unless...&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;Newlines for limiting line length inserted in lieu of a space that would otherwise be required which &lt;em&gt;should&lt;/em&gt; count.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;And telling the last two classes apart requires lexing the preceding and subsequent &quot;words&quot; with and without some whitespace to know if they can be safely jammed together. And that, of course, is language specific.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2011-02-07T05:58:28.297" CommentCount="4" ContentLicense="CC BY-SA 2.5" />
  <row Id="181" PostTypeId="1" AcceptedAnswerId="182" CreationDate="2011-02-07T17:39:37.883" Score="12" ViewCount="227" Body="&lt;p&gt;Recently, when answering &lt;a href=&quot;https://codegolf.stackexchange.com/questions/655/multiply-without-multiply&quot;&gt;this&lt;/a&gt; question, I devised two solutions, each with a different approach. Now my doubt, and the point of this question, is whether I should've posted both solutions under a same answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What should be the accepted practice for this?&lt;/p&gt;&#xA;" OwnerUserId="13" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2011-02-07T21:14:58.133" Title="Multiple answers from the same person to a question" Tags="|discussion|answers|" AnswerCount="2" CommentCount="0" FavoriteCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="182" PostTypeId="2" ParentId="181" CreationDate="2011-02-07T20:30:06.220" Score="23" Body="&lt;p&gt;For code games, I'd say that if the solutions are distinct (different languages, different algorithmic approaches) that you &lt;em&gt;should&lt;/em&gt; post them separately.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2011-02-07T20:30:06.220" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="183" PostTypeId="2" ParentId="181" CreationDate="2011-02-07T21:14:58.133" Score="7" Body="&lt;p&gt;I've used multiple answers many times when doing different languages. Less often for different algorithms, but I do not hesitate to do so if I believe both/all answers are interesting enough.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Nobody has complained thus far :)&lt;/p&gt;&#xA;" OwnerUserId="95" LastActivityDate="2011-02-07T21:14:58.133" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="184" PostTypeId="2" ParentId="20" CreationDate="2011-02-08T05:38:16.477" Score="2" Body="&lt;p&gt;I'm not sure how this site would rob much from SO.  Most problems here are asinine in a real-world setting, and if anyone actually golfs for anything other than kicks, they should be shot.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sure, the occasional question is fairly interesting and dare-I-say useful (move those to SO?).  Nevertheless, I think your view of this site is somewhat rosy.&lt;/p&gt;&#xA;" OwnerUserId="176" LastEditorUserId="46" LastEditDate="2011-04-09T12:28:28.203" LastActivityDate="2011-04-09T12:28:28.203" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="185" PostTypeId="1" AcceptedAnswerId="187" CreationDate="2011-02-09T20:12:41.427" Score="13" ViewCount="2506" Body="&lt;p&gt;This question is because my favorite language C++ does not lend itself to code golf. Now I could try and pick up a new scripting language (like golf-script) or brush up on an old favorite (perl), but that takes time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I was wondering if introducing a language handicap could help level the playing field for those of us who have not yet had time to learn an appropriate scripting language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The handicap for a language is the cost of reading a line and writing it back out. Thus the actual golf score is: &quot;the number of characters in the program&quot; - &quot;the cost of language handicap&quot;. We could then define for the community these handicaps.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example: C++ handicap: 109&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#include &amp;lt;iostream&amp;gt;&#xA;#include &amp;lt;string&amp;gt;&#xA;int main(){std::string l;std::getline(std::cin,l);std::cout&amp;lt;&amp;lt;l&amp;lt;&amp;lt;&quot;\n&quot;;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Example: Golf-Script handicap: 0&lt;/h3&gt;&#xA;&#xA;&lt;h3&gt;Example: Perl handicap 12&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$_=&amp;lt;&amp;gt;;print&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I am sure the perl experts can do better (mine is rusty).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Comments on handicap idea and program needed to define handicap.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This at least would give languages like C++ a fighting chance against more compresses scripting languages.&lt;/p&gt;&#xA;" OwnerUserId="186" LastEditorUserId="186" LastEditDate="2011-02-09T20:24:18.920" LastActivityDate="2017-05-23T19:47:52.907" Title="Language Handicap" Tags="|discussion|code-golf|handicap|" AnswerCount="4" CommentCount="5" ClosedDate="2021-04-24T15:24:47.793" ContentLicense="CC BY-SA 2.5" />
  <row Id="186" PostTypeId="2" ParentId="185" CreationDate="2011-02-09T21:56:51.187" Score="13" Body="&lt;p&gt;Not a bad idea, as such.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I mean, if the idea is to explore cleverness is using your language as choice, then so kind of handicap is clearly necessary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And given the number of challenges that have &quot;read input&quot; and &quot;write to console&quot; parts, this metric has some validity, but it surely doesn't tell the whole story. I mean various languages I use could be accused of having various advantages and handicaps:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;awk&lt;/code&gt; doesn't require anything to echo the input, but has underpowered associative arrays and needs an unnatural approach to do non-trivil stuff to more than one input file at a time&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;c&lt;/code&gt; has no sophisticated data structures built in, and a B&amp;amp;D type system&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;c++&lt;/code&gt; has a better standard library, but it comes with wordy type names and still has that sex dungeon feel&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;fortran 77&lt;/code&gt; has implicit type, built-in complex numbers and inline for loops in in-out-put statements, but has column requirements, lengthy keywords, and no data structures more complicated than an array.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;so the degree of handicap depends in a non-trivial way on the problem posed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Trying to set a single metric is asking for endless arguments which can only be settled by &lt;em&gt;&quot;This is the official word on the subject, so shut up already.&quot;&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My &lt;em&gt;&quot;solution&quot;&lt;/em&gt; has always been to vote for cleverness as well as shortness. That's &lt;em&gt;not&lt;/em&gt; objective, and not fair insofar as I can only detect cleverness in language I comprehend, but it's better than nothing.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="78" LastEditDate="2011-02-10T04:48:05.183" LastActivityDate="2011-02-10T04:48:05.183" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="187" PostTypeId="2" ParentId="185" CreationDate="2011-02-10T00:42:07.503" Score="23" Body="&lt;p&gt;I have thought about this before, and I am not convinced that there is a good/fair way to represent handicaps between different languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There can only be one winner (accepted answer) on SE, so I think it's still best to encourage people to stretch to look for and learn languages that are better suited to each question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As far as rep is concerned, accepted answer is only worth 1.5 upvotes, and interesting answers often get far more votes than the shortest, accepted answer&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As the site grows you will find multiple answers in C++(for example), and a mini contest of continual improvement starts between those solutions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are already questions on this site where this has happened with Python/Ruby for exmple&lt;/p&gt;&#xA;" OwnerUserId="95" LastEditorDisplayName="user58826" LastEditDate="2017-05-23T19:47:52.907" LastActivityDate="2017-05-23T19:47:52.907" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="188" PostTypeId="1" CreationDate="2011-02-10T11:50:35.883" Score="14" ViewCount="617" Body="&lt;p&gt;Languages differ greatly in the amount of functionality contained in the main namespace. Most of the PHP main functions, have counterparts in Perl core libraries. What should the policy be on character counts in such cases?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, my solution for the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/769/print-nxn-spiral-of-ascending-numbers/802#802&quot;&gt;NxN spiral&lt;/a&gt; used the Perl library &lt;code&gt;Math::Complex&lt;/code&gt;. Possible outcomes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Allow command-line calls such as &lt;code&gt;perl -MMath::Complex script.pl&lt;/code&gt; to include libraries.&lt;/li&gt;&#xA;&lt;li&gt;Require &lt;code&gt;use Math::Complex;&lt;/code&gt; in the code. &lt;/li&gt;&#xA;&lt;li&gt;Do not allow libraries.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Of course, this is just another instance of the problem of trying to compare languages, but there is some value in defining an objective measure.&lt;/p&gt;&#xA;" OwnerDisplayName="user475" LastEditorUserId="-1" LastEditorDisplayName="user475" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2015-10-09T17:39:46.997" Title="Using libraries in solutions" Tags="|discussion|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 2.5" />
  <row Id="190" PostTypeId="2" ParentId="188" CreationDate="2011-02-10T13:49:11.450" Score="14" Body="&lt;p&gt;I'd say use&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;use Math::Complex;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and be done with it. If PHP can solve something shorter than Perl because Perl requires a module, then so be it. I cringe every time I have to write &lt;code&gt;[Math]::floor()&lt;/code&gt; or something like that because it's so verbose, but it still is a trait of the language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And some languages are better for golfing certain problems than others. I guess there is no point in denying that.&lt;/p&gt;&#xA;" OwnerUserId="15" LastActivityDate="2011-02-10T13:49:11.450" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="191" PostTypeId="1" AcceptedAnswerId="192" CreationDate="2011-02-10T14:52:25.383" Score="2" ViewCount="102" Body="&lt;p&gt;I asked a regex question over at SO. Someone answered with a ruby solution. I'm pretty sure it can be done with GNU tools. I remembered seeing all the cool things here when snooping around area51. Is it alright to ask that question here?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://stackoverflow.com/questions/4956635/regex-awk-etc-for-scanning-my-source-code-for-translations&quot;&gt;https://stackoverflow.com/questions/4956635/regex-awk-etc-for-scanning-my-source-code-for-translations&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="522" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2011-02-10T19:26:37.123" Title="Can I ask a regex question? I want it to be short." Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="192" PostTypeId="2" ParentId="191" CreationDate="2011-02-10T19:26:37.123" Score="2" Body="&lt;p&gt;My point of view is you shouldn't be asking here because you're trying to get help. You &lt;em&gt;should&lt;/em&gt; ask here if you know the problem presents a interesting challenge in some way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This will be very hard to police: we're basically relying on you to police yourself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, there must exist the corner case, and I'd say &quot;on-topic&quot; for those.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2011-02-10T19:26:37.123" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="193" PostTypeId="1" CreationDate="2011-02-12T22:50:31.787" Score="19" ViewCount="355" Body="&lt;p&gt;What guidelines should we have for accepting answers?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See &lt;a href=&quot;http://area51.stackexchange.com/proposals/4570/code-golf-programming-puzzles&quot;&gt;our page on area51&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This site is different to other SE sites, because it's almost never clear that the best answer won't be improved upon.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course it is possible to change the accepted answer if a better one is submitted, but I expect a lot of questions to be neglected in this regard.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How quickly should we initially accept answers? For example 2 days is probably too short for code-golf questions unless the question is very easy.&lt;/p&gt;&#xA;" OwnerUserId="95" LastEditorUserId="95" LastEditDate="2011-02-14T02:04:08.483" LastActivityDate="2011-02-14T02:04:08.483" Title="When to accept answers" Tags="|discussion|accepted-answer|" AnswerCount="2" CommentCount="8" ClosedDate="2018-04-12T09:48:51.547" ContentLicense="CC BY-SA 2.5" />
  <row Id="194" PostTypeId="2" ParentId="193" CreationDate="2011-02-13T01:23:26.057" Score="3" Body="&lt;p&gt;In general, I think a week is necessary at least. Certainly on &lt;a href=&quot;http://golf.shinh.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Anarchy Golf&lt;/a&gt; most people post problems with either a week or two weeks as deadline.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, if there is an obvious winning solution (such as the one-byte solution to &lt;a href=&quot;https://stackoverflow.com/questions/62188/stack-overflow-code-golf&quot;&gt;stack overflow code golf&lt;/a&gt;), then it's quite okay to accept that straight up.&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2011-02-13T01:23:26.057" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="195" PostTypeId="2" ParentId="170" CreationDate="2011-02-13T06:47:31.200" Score="3" Body="&lt;p&gt;When you extract username, could you strip revision part?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;for example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/404/forecast-the-weather&quot;&gt;Forecast the weather&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Current winner: 21 revsJoey's [Unknown] entry has 103 characters.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;probably, &lt;code&gt;.replace(/[^&amp;lt;]+&amp;lt;br&amp;gt;/,'')&lt;/code&gt; will work.&lt;/p&gt;&#xA;" OwnerUserId="132" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2011-02-13T06:47:31.200" CommentCount="1" CommunityOwnedDate="2011-02-13T06:47:31.200" ContentLicense="CC BY-SA 2.5" />
  <row Id="196" PostTypeId="2" ParentId="170" CreationDate="2011-02-13T07:24:11.423" Score="0" Body="&lt;p&gt;On this question,&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/901/physics-golf-inclined-shooting&quot;&gt;Physics golf: inclined shooting.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Current winner: George EdisonFUZxxl's Haskell &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You may use, &lt;code&gt;.find('.user-details a:last').text()&lt;/code&gt;, since author is on the right most&lt;/p&gt;&#xA;" OwnerUserId="132" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2011-02-13T07:24:11.423" CommentCount="16" CommunityOwnedDate="2011-02-13T07:24:11.423" ContentLicense="CC BY-SA 2.5" />
  <row Id="197" PostTypeId="2" ParentId="193" CreationDate="2011-02-13T13:42:06.367" Score="7" Body="&lt;p&gt;It is still very early in the beta to say but as for now I check this list before accepting an answer:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A week has passed since posting the question&lt;/li&gt;&#xA;&lt;li&gt;At least two answers posted.&lt;/li&gt;&#xA;&lt;li&gt;No new answers (or very few/&quot;uninteresting&quot;) for the past couple of days&lt;/li&gt;&#xA;&lt;li&gt;At least one &quot;golfy&quot; answer.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;I might delay accepting an answer if I there are many views and upvotes on the question.&lt;/p&gt;&#xA;" OwnerUserId="46" LastActivityDate="2011-02-13T13:42:06.367" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="198" PostTypeId="2" ParentId="170" CreationDate="2011-02-14T08:14:02.590" Score="2" Body="&lt;p&gt;I have added a menu to the top of every page now:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/PZjYq.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, the options item is not functional. I was wondering if anyone had any ideas as far as configurable settings goes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;What settings do you want to be able to configure?&lt;/strong&gt; For example, perhaps it would be nice to be able to add extra languages to the search list or to disable certain features?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;How should these settings be stored?&lt;/strong&gt; Should I continue using cookies, or turn to HTML5 local storage? Any thoughts?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="362" LastActivityDate="2011-02-14T08:14:02.590" CommentCount="7" CommunityOwnedDate="2011-02-14T08:14:02.590" ContentLicense="CC BY-SA 2.5" />
  <row Id="199" PostTypeId="1" CreationDate="2011-02-14T17:23:01.390" Score="3" ViewCount="125" Body="&lt;p&gt;It seems the actual challenges and puzzles are few and far between, and most of them are mislabeled anyway (anything that adds least amount of code chars as part of the problem should be labeled golf).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this all this place is going to be?&lt;/p&gt;&#xA;" OwnerDisplayName="Crazy Eddie" LastActivityDate="2011-02-15T15:02:31.760" Title="Nothing but golf?" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 2.5" />
  <row Id="200" PostTypeId="2" ParentId="199" CreationDate="2011-02-15T15:02:31.760" Score="2" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;anything that adds least amount of code chars as part of the problem should be labeled golf&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;False. A code golf is a contest where smallest code size is the &lt;em&gt;primary&lt;/em&gt; (and often sole&lt;sup&gt;†&lt;/sup&gt;) criterion for winning, not merely a criterion somewhere down the chain. In particular, if the primary criterion is speed, elegance, or anything else, it's not a code golf.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Contributors are welcome to post non-golf problems, as long as they aren't mislabelled as golf. There are professional code golfers (personally, I'd consider the people on the codegolf.com leader board to be such), and if this site is to have any credibility with them (since Stack Exchange is a network for expert and professional participation), then we need to treat golf as golf.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;† Since Stack Exchange does not support multiple winners, using smallest code size as the only winning criterion on this site is not realistic. At least, a tiebreaker (such as earliest posting time) is needed.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2011-02-15T15:02:31.760" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="201" PostTypeId="2" ParentId="144" CreationDate="2011-02-15T20:04:45.477" Score="5" Body="&lt;p&gt;There's now a very good reason to use the code-golf tag&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It has special significance to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/170/code-golf-userscript-to-help-in-navigating-the-site-v0-28-now-available&quot;&gt;Nathan's user script&lt;/a&gt;, which every serious golfer should check out&lt;/p&gt;&#xA;" OwnerUserId="95" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2014-08-18T12:21:21.363" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="202" PostTypeId="1" CreationDate="2011-02-10T18:46:02.307" Score="52" ViewCount="4712" Body="&lt;p&gt;Here is my scenario.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;I pose a programming puzzle. It might be golf, or might be something else, but I don't specify the language.&lt;/li&gt;&#xA;&lt;li&gt;Some posts a answer that looks really good, but I don't have a working environment to test it.&lt;/li&gt;&#xA;&lt;li&gt;???&lt;/li&gt;&#xA;&lt;li&gt;Profit!&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Let us compile a list of free execution environments reachable over the internet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One answer per answer, please, and list the protocol and host as well as as much detail on the available execution environments as possible.&lt;/p&gt;&#xA;" OwnerUserId="78" OwnerDisplayName="dmckee" LastEditorUserId="66833" LastEditDate="2021-09-26T16:37:19.863" LastActivityDate="2023-09-20T08:42:09.537" Title="Where to find an online testing environment for specific programming languages?" Tags="|support|testing|faq-proposed|" AnswerCount="39" CommentCount="7" CommunityOwnedDate="2011-02-14T17:59:28.197" ContentLicense="CC BY-SA 3.0" />
  <row Id="203" PostTypeId="2" ParentId="202" CreationDate="2011-02-10T18:55:27.323" Score="9" Body="&lt;p&gt;&lt;a href=&quot;http://codepad.org/&quot; rel=&quot;nofollow&quot;&gt;codepad.org&lt;/a&gt; lets you paste code into a web interface and shows you the results. It compiles/interprets several languages: C, C++, D, Haskell, Lua, OCaml, PHP, Perl, Plain Text, Python, Ruby, Scheme, Tcl.&lt;/p&gt;&#xA;" OwnerDisplayName="user475" LastActivityDate="2011-02-10T18:55:27.323" CommentCount="1" CommunityOwnedDate="2011-02-14T17:59:28.197" ContentLicense="CC BY-SA 2.5" />
  <row Id="204" PostTypeId="2" ParentId="202" CreationDate="2011-02-10T19:03:28.923" Score="3" Body="&lt;h2&gt;&lt;a href=&quot;http://tryruby.org/&quot; rel=&quot;nofollow&quot;&gt;http://tryruby.org/&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Provides a version 1.9 interpreter, but they have disabled pasting into the text field, and there is no easy way to interact with the standard in-/out-put.&lt;/p&gt;&#xA;" OwnerUserId="78" OwnerDisplayName="dmckee" LastActivityDate="2011-02-10T19:03:28.923" CommentCount="1" CommunityOwnedDate="2011-02-14T17:59:28.197" ContentLicense="CC BY-SA 2.5" />
  <row Id="205" PostTypeId="2" ParentId="202" CreationDate="2011-02-10T19:09:23.427" Score="26" Body="&lt;p&gt;&lt;a href=&quot;http://www.ideone.com/&quot; rel=&quot;nofollow&quot;&gt;Ideone.com&lt;/a&gt; can compile/run over 40 languages, including Brainf**k and Whitespace.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;List of supported languages:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Ada&lt;/li&gt;&#xA;&lt;li&gt;Assembler&lt;/li&gt;&#xA;&lt;li&gt;Assembler&lt;/li&gt;&#xA;&lt;li&gt;AWK (gawk)&lt;/li&gt;&#xA;&lt;li&gt;AWK (mawk)&lt;/li&gt;&#xA;&lt;li&gt;Bash&lt;/li&gt;&#xA;&lt;li&gt;bc&lt;/li&gt;&#xA;&lt;li&gt;Brainf**k&lt;/li&gt;&#xA;&lt;li&gt;C&lt;/li&gt;&#xA;&lt;li&gt;C#&lt;/li&gt;&#xA;&lt;li&gt;C++&lt;/li&gt;&#xA;&lt;li&gt;C++0x&lt;/li&gt;&#xA;&lt;li&gt;C99 strict&lt;/li&gt;&#xA;&lt;li&gt;CLIPS&lt;/li&gt;&#xA;&lt;li&gt;Clojure&lt;/li&gt;&#xA;&lt;li&gt;COBOL&lt;/li&gt;&#xA;&lt;li&gt;COBOL 85&lt;/li&gt;&#xA;&lt;li&gt;Common Lisp (clisp)&lt;/li&gt;&#xA;&lt;li&gt;D (dmd)&lt;/li&gt;&#xA;&lt;li&gt;Erlang&lt;/li&gt;&#xA;&lt;li&gt;F#&lt;/li&gt;&#xA;&lt;li&gt;Factor&lt;/li&gt;&#xA;&lt;li&gt;Falcon&lt;/li&gt;&#xA;&lt;li&gt;Forth&lt;/li&gt;&#xA;&lt;li&gt;Fortran&lt;/li&gt;&#xA;&lt;li&gt;Go&lt;/li&gt;&#xA;&lt;li&gt;Groovy&lt;/li&gt;&#xA;&lt;li&gt;Haskell&lt;/li&gt;&#xA;&lt;li&gt;Icon&lt;/li&gt;&#xA;&lt;li&gt;Intercal&lt;/li&gt;&#xA;&lt;li&gt;Java&lt;/li&gt;&#xA;&lt;li&gt;JavaScript (rhino)&lt;/li&gt;&#xA;&lt;li&gt;JavaScript (spidermonkey)&lt;/li&gt;&#xA;&lt;li&gt;Lua&lt;/li&gt;&#xA;&lt;li&gt;Nemerle&lt;/li&gt;&#xA;&lt;li&gt;Nice&lt;/li&gt;&#xA;&lt;li&gt;Nimrod&lt;/li&gt;&#xA;&lt;li&gt;Objective-C&lt;/li&gt;&#xA;&lt;li&gt;Ocaml&lt;/li&gt;&#xA;&lt;li&gt;Octave&lt;/li&gt;&#xA;&lt;li&gt;Oz&lt;/li&gt;&#xA;&lt;li&gt;Pascal (fpc)&lt;/li&gt;&#xA;&lt;li&gt;Pascal (gpc)&lt;/li&gt;&#xA;&lt;li&gt;Perl&lt;/li&gt;&#xA;&lt;li&gt;Perl 6&lt;/li&gt;&#xA;&lt;li&gt;PHP&lt;/li&gt;&#xA;&lt;li&gt;Pike&lt;/li&gt;&#xA;&lt;li&gt;Prolog (gnu)&lt;/li&gt;&#xA;&lt;li&gt;Prolog (swi)&lt;/li&gt;&#xA;&lt;li&gt;Python&lt;/li&gt;&#xA;&lt;li&gt;Python 3&lt;/li&gt;&#xA;&lt;li&gt;R&lt;/li&gt;&#xA;&lt;li&gt;Ruby&lt;/li&gt;&#xA;&lt;li&gt;Scala&lt;/li&gt;&#xA;&lt;li&gt;Scheme (guile)&lt;/li&gt;&#xA;&lt;li&gt;Smalltalk&lt;/li&gt;&#xA;&lt;li&gt;SQL&lt;/li&gt;&#xA;&lt;li&gt;Tcl&lt;/li&gt;&#xA;&lt;li&gt;Text&lt;/li&gt;&#xA;&lt;li&gt;Unlambda&lt;/li&gt;&#xA;&lt;li&gt;Visual Basic .NET&lt;/li&gt;&#xA;&lt;li&gt;Whitespace&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Pros &amp;amp; Cons:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Pros: &#xA;&lt;ul&gt;&#xA;&lt;li&gt;support for many languages&lt;/li&gt;&#xA;&lt;li&gt;you can store your program there, together with parameters/sample input&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Cons:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You have to obey some form and usage conventions to use IDEONE, like how to name your main-class in Scala. &lt;/li&gt;&#xA;&lt;li&gt;The amount of CPU-time to run your program is limited &#xA;&lt;ul&gt;&#xA;&lt;li&gt;compilation time: 10 seconds,&lt;/li&gt;&#xA;&lt;li&gt;execution time: 5 (by default and for not logged in users) or 15 seconds (this can be set from account settings page),&lt;/li&gt;&#xA;&lt;li&gt;memory usage: 256 MB.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The version of the language used may be old (as is the case with R and Octave)&lt;/li&gt;&#xA;&lt;li&gt;For more restrictions, see &lt;a href=&quot;http://www.ideone.com/faq&quot; rel=&quot;nofollow&quot;&gt;the FAQ&lt;/a&gt; (Threads, Network, ...)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="308" OwnerDisplayName="Dogbert" LastEditorUserId="20469" LastEditDate="2015-04-02T17:18:14.113" LastActivityDate="2015-04-02T17:18:14.113" CommentCount="7" CommunityOwnedDate="2011-02-14T17:59:28.197" ContentLicense="CC BY-SA 3.0" />
  <row Id="206" PostTypeId="2" ParentId="202" CreationDate="2011-02-10T20:13:46.953" Score="5" Body="&lt;p&gt;&lt;a href=&quot;http://www.quirkster.com/iano/js/&quot; rel=&quot;nofollow&quot;&gt;http://www.quirkster.com/iano/js/&lt;/a&gt; has interpreters for various languages:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;FALSE&lt;/strong&gt;: &lt;a href=&quot;http://www.quirkster.com/iano/js/false-js.html&quot; rel=&quot;nofollow&quot;&gt;http://www.quirkster.com/iano/js/false-js.html&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;DUP&lt;/strong&gt;: &lt;a href=&quot;http://www.quirkster.com/iano/js/dup.html&quot; rel=&quot;nofollow&quot;&gt;http://www.quirkster.com/iano/js/dup.html&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;SNUSP&lt;/strong&gt;: &lt;a href=&quot;http://www.quirkster.com/iano/snusp/&quot; rel=&quot;nofollow&quot;&gt;http://www.quirkster.com/iano/snusp/&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Befunge-93&lt;/strong&gt;: &lt;a href=&quot;http://www.quirkster.com/iano/js/befunge.html&quot; rel=&quot;nofollow&quot;&gt;http://www.quirkster.com/iano/js/befunge.html&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Brainfuck&lt;/strong&gt;: &lt;a href=&quot;http://www.quirkster.com/iano/js/bf.html&quot; rel=&quot;nofollow&quot;&gt;http://www.quirkster.com/iano/js/bf.html&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Biota&lt;/strong&gt;: &lt;a href=&quot;http://www.quirkster.com/iano/js/biota.html&quot; rel=&quot;nofollow&quot;&gt;http://www.quirkster.com/iano/js/biota.html&lt;/a&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&quot;More Object Oriented&quot;: &lt;a href=&quot;http://www.quirkster.com/iano/js/biota-proto.html&quot; rel=&quot;nofollow&quot;&gt;http://www.quirkster.com/iano/js/biota-proto.html&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Befalse&lt;/strong&gt;: &lt;a href=&quot;http://www.quirkster.com/iano/js/befalse.html&quot; rel=&quot;nofollow&quot;&gt;http://www.quirkster.com/iano/js/befalse.html&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="65" OwnerDisplayName="Nemo157" LastEditorUserId="9498" LastEditDate="2014-02-12T20:52:28.117" LastActivityDate="2014-02-12T20:52:28.117" CommentCount="0" CommunityOwnedDate="2011-02-14T17:59:28.197" ContentLicense="CC BY-SA 3.0" />
  <row Id="207" PostTypeId="2" ParentId="202" CreationDate="2011-02-10T21:34:53.430" Score="2" Body="&lt;p&gt;I had that problem with &lt;a href=&quot;https://stackoverflow.com/questions/2440314/code-golf-day&quot;&gt;pi-day golf&lt;/a&gt; on SO, the winning solution used the BSD variant of dc. Luckily I was able to confirm the answer on my silenceisdefeat.com which cost me $1. Seems to be dead now though. I guess I'll need to use a VM next time&lt;/p&gt;&#xA;&#xA;&lt;p&gt;EDIT: found the silenceisdefeat.com server has been upgraded and is now called saga.silenceisdefeat.net. Seems to be a quad core with 2GB ram&lt;/p&gt;&#xA;&#xA;&lt;p&gt;it has:&lt;br&gt;&#xA;Python 2.4 2.5 2.6&lt;br&gt;&#xA;Ruby 1.8.6&lt;br&gt;&#xA;Perl 5.10.1  &lt;/p&gt;&#xA;" OwnerUserId="95" OwnerDisplayName="gnibbler" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2011-02-11T11:56:03.730" CommentCount="0" CommunityOwnedDate="2011-02-14T17:59:28.197" ContentLicense="CC BY-SA 2.5" />
  <row Id="208" PostTypeId="2" ParentId="170" CreationDate="2011-02-18T05:25:30.080" Score="5" Body="&lt;p&gt;Please support binary hex dumps counter. an example &lt;a href=&quot;https://codegolf.stackexchange.com/questions/997/render-digital-clock-style-numbers/1013#1013&quot;&gt;here&lt;/a&gt;, and copy-pasted as follows.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0000000: 332c 7b3a 533b 2e7b 3438 2d22 5e70 285d  3,{:S;.{48-&quot;^p(]&#xA;0000010: 7025 d3c4 4ab1 7d4a b8dc 4469 ce41 2222  p%..J.}J..Di.A&quot;&quot;&#xA;0000020: f303 227b 6261 7365 7d2f 3330 2f53 3d33  ..&quot;{base}/30/S=3&#xA;0000030: 2f3d 7b22 5f20 7c22 3d7d 257d 256e 407d  /={&quot;_ |&quot;=}%}%n@}&#xA;0000040: 2f3b                                     /;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;My current idea is that, if the &lt;code&gt;.text()&lt;/code&gt; is startswith &lt;code&gt;/^0{3,}: /&lt;/code&gt; which is &lt;code&gt;0000000:&lt;/code&gt; &#xA;then do&lt;br&gt;&#xA;&lt;code&gt;.text().match(/ [\da-z]{2}|[\da-z]{2}(?= )/gim).length&lt;/code&gt;, which gave me 66 chars.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is another one &lt;a href=&quot;https://codegolf.stackexchange.com/questions/997/render-digital-clock-style-numbers/1009#1009&quot;&gt;here&lt;/a&gt; with slightly different format. Should work too, but I havn't tested well that though :)&lt;/p&gt;&#xA;" OwnerUserId="132" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2011-02-18T05:33:33.473" CommentCount="1" CommunityOwnedDate="2011-02-18T05:25:30.080" ContentLicense="CC BY-SA 2.5" />
  <row Id="209" PostTypeId="1" CreationDate="2011-02-18T05:58:19.890" Score="5" ViewCount="207" Body="&lt;p&gt;We've been here a few times, as I recall:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/976/next-friday-the-13th/986#986&quot;&gt;Next Friday the 13th&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/976/next-friday-the-13th/982#982&quot;&gt;my own&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/1003/day-of-the-week-of-the-next-feb-29th/1011#1011&quot;&gt;Day of the week of the next Feb 29th&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/689/how-much-snow-did-you-get/729#729&quot;&gt;How much snow did you get?&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/689/how-much-snow-did-you-get/794#794&quot;&gt;my own&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;All of those solutions may or may not fail, depending on the user's locale when executing them. I for one strive to solve problems that are robust under those assumptions, but is it viable to assume some common execution environment for golfing?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem then is that you can offload quite a bit to your locale – I'm using German with ISO-8601 date format, so I usually cannot use format strings to output fractional numbers, but I can just use the short date format &lt;code&gt;{0:d}&lt;/code&gt; to output dates in &lt;code&gt;YYYY-MM-DD&lt;/code&gt; which obviously is a slight advantage when that's the desired output format for a program. I suffer again with days of the week which come out as &lt;code&gt;Montag&lt;/code&gt; instead of &lt;code&gt;Monday&lt;/code&gt; but that's fine since I have enumeration values in English handy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, such things could be handled in the individual tasks, but maybe a general guideline would be better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another way to circumvent this would probably be to restrict oneself to exact string output or integral numbers (floating-point numbers may be given in a variety of formats with &lt;code&gt;,&lt;/code&gt; as the decimal point or some languages might do scientific notation with &lt;code&gt;e+25&lt;/code&gt; by default, so they may require some working around in some cases). To put all date solutions on a common ground this might call for a very custom format, made-up names of the days or just the day number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or we could just say that all solutions are expected to be run in a &lt;code&gt;en-US&lt;/code&gt; locale.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Am I seeing problems where none are? :-)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's just that I find solutions that require different degrees of preconditions hard to compare with each other.&lt;/p&gt;&#xA;" OwnerUserId="15" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-09-09T22:45:01.457" Title="What about locale-sensitive output?" Tags="|discussion|" AnswerCount="5" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="210" PostTypeId="2" ParentId="209" CreationDate="2011-02-18T20:53:50.963" Score="5" Body="&lt;p&gt;It may help to use a common locale, but &lt;code&gt;en-US&lt;/code&gt; is not it. (Does anyone really want to standardise on &lt;a href=&quot;http://www.catb.org/~esr/jargon/html/M/middle-endian.html&quot; rel=&quot;nofollow&quot;&gt;middle-endian&lt;/a&gt; dates? ;-)) &lt;code&gt;C&lt;/code&gt; might be, though! :-P (For people not familiar with locales, the &lt;code&gt;C&lt;/code&gt; locale basically provides locale-insensitive behaviour for locale-sensitive programs.)&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2011-02-18T20:53:50.963" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="211" PostTypeId="2" ParentId="202" CreationDate="2011-02-19T04:40:54.620" Score="7" Body="&lt;p&gt;I believe I now have a solution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have integrated &lt;a href=&quot;http://codepad.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;Codepad&lt;/a&gt; support into my &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/170/&quot;&gt;UserScript&lt;/a&gt;. When using the script you will see:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/YjxS9.jpg&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Notice the &lt;code&gt;[Run]&lt;/code&gt; link on the right.&lt;/strong&gt; Clicking this will launch the code in Codepad and let you view the output. It's not perfect, and it's not a complete solution... but it works :)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; as of v0.35, you can even run code blocks in the markup preview as you're writing your answer.&lt;/p&gt;&#xA;" OwnerUserId="362" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2011-08-22T22:56:42.223" CommentCount="0" CommunityOwnedDate="2011-02-19T04:40:54.620" ContentLicense="CC BY-SA 3.0" />
  <row Id="212" PostTypeId="1" CreationDate="2011-02-20T06:42:51.157" Score="8" ViewCount="284" Body="&lt;p&gt;Most of the questions asked seem of much lower quality than those that used to appear under the code golf tag on StackOverflow. Here, I see these problems repeatedly:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Poor problem definition, often lacking any clarity on what to do&lt;/li&gt;&#xA;&lt;li&gt;Problems far too small to have any meaningful room for golfing&lt;/li&gt;&#xA;&lt;li&gt;Very lax input/output requirements, sometimes to the point of absurdity&lt;/li&gt;&#xA;&lt;li&gt;Presupposing a very narrow set of languages&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;In short, I'm not finding the problems here nearly as interesting as the ones we used to have on SO.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So... What can we do about this? How can we get the quality up?&lt;/p&gt;&#xA;" OwnerUserId="116" LastActivityDate="2015-04-06T16:09:27.530" Title="How can we up the quality?" Tags="|discussion|" AnswerCount="4" CommentCount="4" ContentLicense="CC BY-SA 2.5" />
  <row Id="213" PostTypeId="1" CreationDate="2011-02-20T08:54:17.103" Score="6" ViewCount="1018" Body="&lt;p&gt;The &lt;a href=&quot;http://en.wikipedia.org/wiki/Kolmogorov_complexity&quot; rel=&quot;nofollow noreferrer&quot;&gt;Kolmogorov complexity&lt;/a&gt; of a string is the size of the smallest code fragment that produces it.  Kolmogorov complexity is undecidable and infeasible to compute.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code golfing is the task of implementing something in the fewest characters possible, and in general is very much like approximating Kolmogorov complexity.  Some posts, like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/506/calculate-500-digits-of-pi&quot;&gt;Calculate 500 digits of pi&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1076/mixed-up-output&quot;&gt;Mixed up output.&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2/99-bottles-of-beer&quot;&gt;99 Bottles Of Beer&lt;/a&gt; ask you to produce a string, usually with the smallest program possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm proposing a new tag, &lt;code&gt;kolmogorov-complexity&lt;/code&gt;, for questions that, ideally, have these conditions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Goal is shortest length (i.e. code golf).&lt;/li&gt;&#xA;&lt;li&gt;Code is expected to output a given string exactly.&lt;/li&gt;&#xA;&lt;li&gt;The string will preferably have non-obvious and unknown patterns.  The challenge of Kolmogorov complexity is mainly to find those patterns.&lt;/li&gt;&#xA;&lt;li&gt;The string must not be purely random.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Not a lot of questions follow this template exactly, and most probably shouldn't be given the &lt;code&gt;kolmogorov-complexity&lt;/code&gt; tag.  &quot;Calculate 500 digits of pi&quot; fits this tag very well, whereas &quot;99 Bottles of Beer&quot; does not, as it asks for &quot;creative use of a language&quot; rather than shortest code length.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Before I go on a tagging vendetta, I'd like some input on this.&lt;/p&gt;&#xA;" OwnerUserId="38" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2011-02-20T18:21:23.827" Title="Tag proposal: kolmogorov-complexity" Tags="|discussion|tags|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="214" PostTypeId="2" ParentId="212" CreationDate="2011-02-20T09:09:12.697" Score="4" Body="&lt;p&gt;I think the biggest problem is when the asker links to external sites without adequately describing the problem on the page.  I'll pick on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/7/hamming-numbers&quot;&gt;Hamming&amp;nbsp;numbers&lt;/a&gt;.  It doesn't even say what the Hamming numbers are, it just links to an article where I have to dig to find them.  It could at least list a few of them.  A worse offender is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/131/morse-code-translator&quot;&gt;Morse code translator&lt;/a&gt;, which could, in a matter of seconds, be edited to &lt;em&gt;display&lt;/em&gt; the open-licensed Morse Code table.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Askers, please post what you are asking &lt;strong&gt;directly on the page!&lt;/strong&gt;  Don't make me go to some website to find out what you're talking about.  I don't mind going to another page to get the finer details, but a Code&amp;nbsp;Golf question should function as an advertisement of the problem and how interesting it is.&lt;/p&gt;&#xA;" OwnerUserId="38" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2011-02-20T09:09:12.697" CommentCount="4" ContentLicense="CC BY-SA 2.5" />
  <row Id="215" PostTypeId="2" ParentId="212" CreationDate="2011-02-20T14:44:03.587" Score="6" Body="&lt;p&gt;The way we maintained high quality on Stack Overflow was by mercilessly bullying posters to fix the deficiencies, endlessly linking them to the &lt;a href=&quot;https://meta.stackexchange.com/questions/24242/acceptable-level-of-code-golf-questions&quot;&gt;meta questions&lt;/a&gt; (and later the &lt;a href=&quot;https://stackoverflow.com/tags/code-golf/info&quot;&gt;tag wiki&lt;/a&gt;), and closing the ones that weren't fixed or were unrecoverable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In other words, we have to quit cutting those posters any slack, and we have to be prepared to be called names.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But before that can happen we need &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/93/what-details-should-always-be-given-for-a-code-golf-task&quot;&gt;some kind of consensus&lt;/a&gt; about &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/6/what-should-be-the-rules-for-questions-on-this-site&quot;&gt;what makes a question &quot;good&quot;&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would submit that the rules we used on Stack Overflow are a good place to start.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2011-02-20T14:44:03.587" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="216" PostTypeId="2" ParentId="9" CreationDate="2011-02-20T17:12:38.420" Score="0" Body="&lt;p&gt;I suppose I don't mind seeing answers in GolfScript or other similar &quot;made-to-golf&quot; languages -- but I admit that I don't consider them serious answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How 'bout this as a test: Are there two or more web-frameworks for serious use for the language?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Update:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please understand: I wasn't proposing the test as a criteria for &quot;serious language&quot;, but as a &lt;em&gt;possible&lt;/em&gt; criteria that code-golf questions could use for the languages they'd like to score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It feels to me like there are roughly four categories of languages in use when answering CodeGolf:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Main stream general purpose languages: C, C++, Phython, Ruby, etc...&lt;/li&gt;&#xA;&lt;li&gt;Tool languages, that are generally aimed a certain domain: awk, bash, sed, MatLab&lt;/li&gt;&#xA;&lt;li&gt;Golf languages, aimed at winning code golf but which no one would use in production: GolfScript, etc...&lt;/li&gt;&#xA;&lt;li&gt;Obviously inappropriate languages for code golf, which people use for fun: Cobol, Visual Basic, LabView&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Now, of course it is impossible to put hard and fast definitions on these categories. But I think that for a given problem, looking at the shortest solution in a main stream language is interesting, and has merit, separately from shortest overall (which is often in a tool or golf language). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I like code golf, because I like seeing the inventiveness of the answers, and the ways that people find to extract hidden power from a language's features and shortcomings. The absolute shortest answer is secondary to me, and certainly a very short answer in a tool language that was designed for the domain of the problem isn't that interesting at all. (Aside: I love good question design that manages to keep the solution from being solely in a single domain so that all languages have to stretch!)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In light of this, my proposed test (which was certainly cheeky) was for what would constitute a mainstream language. -- Though I have to admit, I've since found at least one web framework for bash on the web!&lt;/p&gt;&#xA;" OwnerUserId="116" LastEditorUserId="116" LastEditDate="2011-03-04T16:32:38.833" LastActivityDate="2011-03-04T16:32:38.833" CommentCount="4" ContentLicense="CC BY-SA 2.5" />
  <row Id="217" PostTypeId="2" ParentId="213" CreationDate="2011-02-20T18:21:23.827" Score="6" Body="&lt;p&gt;Sounds good to me.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/146/whats-our-policy-on-tags/158#158&quot;&gt;I've said&lt;/a&gt; we should encourage pretty free and descriptive tagging for the time being, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; represents a recognizable category of problems.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2011-02-20T18:21:23.827" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="218" PostTypeId="2" ParentId="212" CreationDate="2011-02-22T20:38:52.577" Score="4" Body="&lt;p&gt;&lt;strong&gt;Problem definition:&lt;/strong&gt; I feel most of the problems on SO were not as rushed in as they are here.  The beta status tends to push us in a &quot;we need questions asked or else&quot; mood that's detrimental to quality.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Problem size:&lt;/strong&gt; There &lt;em&gt;are&lt;/em&gt; some long and complex problems out there (check the &quot;unanswered&quot; page), but they're definitely not low-hanging fruits.  Less traffic, less votes, less visibility.  And beware the other edge of the sword: some of the most complex ones I'd never answer myself, they've been dismissed as too boring long ago.  Partial personal list: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/471/self-compiling-compiler&quot;&gt;Self-compiling compiler&lt;/a&gt; (TCC's already out there), &lt;a href=&quot;https://codegolf.stackexchange.com/questions/140/write-a-compressing-util-for-gzip-files&quot;&gt;Write a compressing util for gzip files.&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1118/implement-pcre-in-your-language&quot;&gt;Implement PCRE in your language.&lt;/a&gt;  FWIW, I also tend to dismiss problems where I feel there's no right way to rank out the answers, and would end up in a language popularity contest.  (and this already happens quite a bit in actual well-phrased problems)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Lax requirements:&lt;/strong&gt; I'm guilty of this myself, as a reaction to the over-strict problems where the requirements subconsciously favor a single perspective in programming languages.  This could be addressed with a few templates for &quot;classical&quot; problem categories, where we'd agree what the normal way of processing I/O is, what tolerances&#xA;are usually allowed to specific languages.  As templates, they'd be overridable per problem.&lt;br&gt;&#xA;As far as I'm concerned, a major part of the fun of golfing is bending the requirements as far as possible in the small code size direction.  I &lt;em&gt;love&lt;/em&gt; seing a solution output unexpected mixed-case or random spacing as a side effect of shorter code.  I smile at solutions that work 90% of the time because they run their luck on the number of set bits in their PID.  Most of this, and the fun that goes with it, tends to be rubbed away with too strict requirements.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not sure I see what you mean about &lt;strong&gt;presupposed languages&lt;/strong&gt;.&lt;/p&gt;&#xA;" OwnerUserId="199" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2011-02-22T20:38:52.577" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="219" PostTypeId="2" ParentId="170" CreationDate="2011-02-24T00:20:36.460" Score="1" Body="&lt;p&gt;Suggestion: Include scores for the posts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anarchy Golf gives 10000 points to the shortest answer(s) and after that the score is calculated as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;minimal solution length&#xA;----------------------- ⋅ 10000&#xA;   solution length&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So a solution twice the length of the shortest one will have 5000 points.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That way you have a rough measure how close each solution is to the currently top-rated one.&lt;/p&gt;&#xA;" OwnerUserId="15" LastActivityDate="2011-02-24T00:20:36.460" CommentCount="1" CommunityOwnedDate="2011-02-24T00:20:36.460" ContentLicense="CC BY-SA 2.5" />
  <row Id="220" PostTypeId="1" CreationDate="2011-02-26T22:51:06.380" Score="4" ViewCount="205" Body="&lt;p&gt;Throughout the beta, we need members from the site whose focus is to engage the community, both in community-building issues and site management. That's why we select a few members from each community to act as temporary, provisional Moderators. You can read about the program here: &lt;a href=&quot;http://blog.stackoverflow.com/2010/07/moderator-pro-tempore/&quot;&gt;&lt;strong&gt;Moderators Pro Tempore&lt;/strong&gt;&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I am pleased to announce that these members have stepped up and generously volunteered their time to help us assure that each community’s issues are properly addressed:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/3/&quot;&gt;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/3.png&quot; alt=&quot;Chris Jester-Young&quot; /&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/users/78/&quot;&gt;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/78.png&quot; alt=&quot;dmckee&quot; /&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/users/95/&quot;&gt;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/95.png&quot; alt=&quot;gnibbler&quot; /&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/users/3808/&quot;&gt;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/3808.png&quot; alt=&quot;Doorknob&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;We want to make this site a huge success, and these members are great examples of exactly the type of people we need to make this site succeed. Please welcome them for the hard work and time they contribute.&lt;/p&gt;&#xA;&lt;h3&gt;Did I overlook anyone?&lt;/h3&gt;&#xA;&lt;p&gt;Almost certainly. There are members who are actively involved and very deserving of recognition. My failure to account for everyone this early on is in &lt;em&gt;no way&lt;/em&gt; a slight against them. Ideally, Moderators are elected by the community and that's why &lt;strong&gt;you'll have your elections several weeks after the site graduates.&lt;/strong&gt;&#xA;Most of all, be respectful and understanding of the Moderators Pro Tem. Members of your community are volunteering their time and learning on the job. It’s a learning experience for everyone.&lt;/p&gt;&#xA;" OwnerUserId="24" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-05-09T19:05:12.593" Title="Moderator Pro Tem Announcement" Tags="|discussion|moderators|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="221" PostTypeId="2" ParentId="141" CreationDate="2011-03-02T14:38:48.940" Score="4" Body="&lt;p&gt;I think we should allow it. You can always run the code through &lt;a href=&quot;http://jsbeautifier.org&quot; rel=&quot;nofollow&quot;&gt;jsBeautifier&lt;/a&gt;, which unobfuscates the code.&lt;/p&gt;&#xA;" OwnerUserId="344" LastActivityDate="2011-03-02T14:38:48.940" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="222" PostTypeId="2" ParentId="27" CreationDate="2011-03-02T17:56:47.440" Score="4" Body="&lt;p&gt;We've had one of the many (currently 8) &lt;em&gt;&quot;Tips on golfing in Foo&quot;&lt;/em&gt; flagged for moderator attention, with the assertion that it should be on meta, but I'm not sure that we have a consensus as yet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've been happy with those question on the main site as Community Wikis.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd like to get some more input on this before invoking the the moderator power tools.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2011-03-02T17:56:47.440" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="223" PostTypeId="2" ParentId="141" CreationDate="2011-03-02T18:06:18.273" Score="6" Body="&lt;p&gt;If you can run in a sand box, either one of your own or &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/202/78&quot;&gt;one someone else maintains on the internet&lt;/a&gt;, the question of malicious code becomes less of an issue (note I generally don't run anything from this site until I have a vague idea what it is up to).&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2011-03-02T18:06:18.273" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="224" PostTypeId="2" ParentId="143" CreationDate="2011-03-02T18:07:14.937" Score="4" Body="&lt;p&gt;One option is to run everything from this site in a sandbox. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/202/78&quot;&gt;Here are some already available on the internet.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2011-03-02T18:07:14.937" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="226" PostTypeId="2" ParentId="2140" CreationDate="2011-03-04T10:06:41.493" Score="7" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; If you are seeing this first, you might want to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?answertab=modifieddesc&quot;&gt;sort by active&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Unhappy numbers ascii art&lt;/h2&gt;&#xA;&lt;p&gt;Draw a square (or a rectangle as close to a square as possible) that represents the cycle of an &lt;a href=&quot;http://en.wikipedia.org/wiki/Happy_number&quot; rel=&quot;nofollow noreferrer&quot;&gt;unhappy number&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;[ short description of unhappy numbers here + example ]&lt;/p&gt;&#xA;&lt;p&gt;[ square formating rules ]&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;Unhappy integer.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;ASCII art.&lt;/p&gt;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA;4&#xA;Output:&#xA; 4 -  16 - 37 &#xA;20         58&#xA;42 - 145 - 89&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="46" LastEditorUserId="97857" LastEditDate="2022-06-12T18:33:22.167" LastActivityDate="2022-06-12T18:33:22.167" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="228" PostTypeId="1" CreationDate="2011-03-06T18:47:22.367" Score="3" ViewCount="237" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/212/how-can-we-up-the-quality&quot;&gt;As noted&lt;/a&gt;, the quality of many questions on Code Golf SE leaves a &lt;em&gt;lot&lt;/em&gt; to be desired.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/212/how-can-we-up-the-quality/215#215&quot;&gt;dmckee mentioned&lt;/a&gt; about &lt;a href=&quot;https://stackoverflow.com/tags/code-golf/info&quot;&gt;the SO golfing rules&lt;/a&gt; that have made golf contests in SO much more successful. I think we should adopt a similar system here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Two questions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Should we use the SO rules verbatim, or should we come up with our own set of rules?&lt;/li&gt;&#xA;&lt;li&gt;How stringently should they be enforced? Who should enforce them?&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Given that we don't have too many high rep users, should moderators step in to enforce them?&lt;/li&gt;&#xA;&lt;li&gt;Should we revisit this when we have many more high rep users?&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Comments welcome.&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2011-03-11T08:42:05.963" Title="Should we enforce the SO golfing rules here?" Tags="|discussion|policy|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 2.5" />
  <row Id="229" PostTypeId="2" ParentId="228" CreationDate="2011-03-06T22:50:11.920" Score="1" Body="&lt;p&gt;Well, I think the rate limiting rule would need to go. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, there is a rule in the Stack Overflow list that makes really hard question forbidden, and I think we can support a &lt;em&gt;few&lt;/em&gt; more difficult that average questions here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thinks like&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/471/self-compiling-compiler&quot;&gt;Self-compiling compiler&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/1118/implement-pcre-in-your-language&quot;&gt;Implement PCRE in your language&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Neither of which have any attempted solutions as yet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Maybe we should rate-limit &lt;em&gt;those&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2011-03-06T22:50:11.920" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="230" PostTypeId="2" ParentId="228" CreationDate="2011-03-07T09:53:33.153" Score="4" Body="&lt;p&gt;I'm far more likely to answer a question if it is clearly written and has some test cases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Signs of a good code-golf&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Lots of answers&lt;/li&gt;&#xA;&lt;li&gt;Lots of languages&lt;/li&gt;&#xA;&lt;li&gt;Test cases&lt;/li&gt;&#xA;&lt;li&gt;Can write a non-golfed solution in 5-20 mins&lt;/li&gt;&#xA;&lt;li&gt;Not too easy&lt;/li&gt;&#xA;&lt;li&gt;Question gets lots of upvotes&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Signs of a bad code-golf&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Few answers&lt;/li&gt;&#xA;&lt;li&gt;Lots of comments asking for clarifications&lt;/li&gt;&#xA;&lt;li&gt;Question gets lots of downvotes&lt;/li&gt;&#xA;&lt;li&gt;Too hard - maybe should just be a code-challenge&lt;/li&gt;&#xA;&lt;li&gt;Too easy &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="95" LastActivityDate="2011-03-07T09:53:33.153" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="231" PostTypeId="1" CreationDate="2011-03-08T23:37:09.043" Score="12" ViewCount="845" Body="&lt;p&gt;We haven't really talked about specified language challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On Stack Overflow, we asked that all &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; problems be language agnostic, but I don't feel that we are automatically bound by that ethic here. (I am in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/132/78&quot;&gt;favor of language agnosticism being the default&lt;/a&gt;.) Anyone have thoughts on what limits if any should be imposed on posters in terms of specifying language to be used?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Brought on by &lt;a href=&quot;https://codegolf.stackexchange.com/q/1324/78&quot;&gt;Text compression in C or C++&lt;/a&gt;, though I think this question has some faults &lt;em&gt;outside&lt;/em&gt; of the author's desire to see only one or two languages used.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some of my thoughts:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I suspect that any &lt;em&gt;new&lt;/em&gt; language specific challenge posted will be followed by a nearly identical language agnostic one, and I am not sure that this &#xA;is desirable.&lt;/li&gt;&#xA;&lt;li&gt;To the extent that code golf is instructive, it is not unreasonable to desire instruction in a particular language.&lt;/li&gt;&#xA;&lt;li&gt;Some challenges are natural in one class of languages and not in another class. For those combined heats will not inspire people to work in the &quot;hard&quot; ones, so perhaps a &quot;Special Olympics&quot; model worthwhile. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2014-01-16T07:24:25.000" Title="Thought on language specific challenges" Tags="|discussion|rules|" AnswerCount="5" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="232" PostTypeId="2" ParentId="6" CreationDate="2011-03-09T01:10:44.487" Score="-1" Body="&lt;p&gt;I think the title 'Code Golf' is too narrow for this branch of stackexchanche. 'Recreational Programming' or 'Coding for Fun' or something similar would suit it better.&lt;/p&gt;&#xA;" OwnerUserId="537" LastActivityDate="2011-03-09T01:10:44.487" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="233" PostTypeId="1" CreationDate="2011-03-09T03:57:23.087" Score="0" ViewCount="322" Body="&lt;p&gt;Hello I want know the reason for which &lt;a href=&quot;https://stackoverflow.com/questions/5240659/text-compression-in-c-or-c&quot;&gt;my question&lt;/a&gt; is migrated to stack-overflow? If this is not considered as a code-golf I will like to cite few example where compression in without standard library is the only way to solve the problem,for example &lt;a href=&quot;https://www.spoj.pl/problems/MONS/&quot; rel=&quot;nofollow noreferrer&quot;&gt;MONS&lt;/a&gt; and &lt;a href=&quot;https://www.spoj.pl/problems/MAGIC2/&quot; rel=&quot;nofollow noreferrer&quot;&gt;MAGIC2&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every year one question also features in TLE (a shortening/optimizing contest where only C and C++ is allowed)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have seen these type of question common in few others contest too,so I was inquisitive to compare various compression techniques and there utilization in code-golfing in order of get an idea about the most shortest and efficient compression technique feasible for implemenatation,however I am interested to know why this question is not suitable for codegolf.stackexchange, since as i am looking for shortest possible compression technique my question is not suitable for stack-overflow itself.&lt;/p&gt;&#xA;" OwnerUserId="742" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2011-03-09T04:25:45.637" Title="Why my question is migrated to stack-overflow ?" Tags="|discussion|support|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="234" PostTypeId="2" ParentId="233" CreationDate="2011-03-09T04:25:45.637" Score="5" Body="&lt;p&gt;&lt;em&gt;Although I'm a mod, I write this answer as a user of this site. My opinion should not be construed as some sort of &quot;official&quot; opinion.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code challenges on Code Golf SE are supposed to appeal to a wide range of coders. Most of the coding challenges here allow solutions in any number of languages, to encourage creativity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Making a challenge specific to C and C++ is not a good way to appeal to a wide audience. One comment I heard was that your question sounded more like you wanted someone to write a program for you, rather than being a genuine code challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is &lt;em&gt;no good reason&lt;/em&gt; for a text compression challenge to be restricted to specific programming languages. &lt;strong&gt;If your question needs language restrictions in order to be interesting, then it isn't very interesting to begin with, and is a poor fit for this site.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Again, in this instance I speak as a user of the site, not as a site moderator. I just happen to feel strongly about question quality, as you can see in my recent meta posts.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2011-03-09T04:25:45.637" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="235" PostTypeId="2" ParentId="231" CreationDate="2011-03-09T04:54:35.633" Score="6" Body="&lt;p&gt;LiraNuna once told me that if a challenge needs artificial restrictions to make interesting (e.g., can't use specific languages, can't use eval, can't use libraries, can't call external programs, etc., etc.), then it's not a very interesting problem to begin with.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;He's right. A really good code challenge doesn't care what language you use, because the cleverness is in the problem-solving techniques, not in the particular language or tools at hand.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;People moan all the time about GolfScript, but I can say for sure that LiraNuna's problems are usually &lt;em&gt;not&lt;/em&gt; won by a GolfScript submission. That's a mark of a quality question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, summary: If a problem is language-specific, it means one of two things:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It's actually an interesting question. In that case, just make it language-agnostic! (Say I, who created the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-agnostic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-agnostic&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-agnostic&lt;/a&gt; tag on Stack Overflow. ;-))&lt;/li&gt;&#xA;&lt;li&gt;It's actually a boring question. In that case, KILL IT WITH FIRE.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Comments welcome. :-)&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2011-03-09T04:54:35.633" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="236" PostTypeId="1" CreationDate="2011-03-09T10:36:32.420" Score="3" ViewCount="174" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/1294/anagram-code-golf&quot;&gt;Anagram Code Golf!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why?  No other code golf questions seem to be :(&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/nMLwv.jpg&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/28/should-golf-questions-be-a-cw-and-why&quot;&gt;Should golf questions be a CW and why?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I don't believe we have any need for CW on this site.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&amp;nbsp;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;No, golf questions should not be CW. Code golf is the raison d'etre for this site, and if we CW'd golf questions, nobody would get any rep for anything useful.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="743" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2014-04-23T09:29:32.537" Title="Why is this question marked community wiki?" Tags="|discussion|support|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="237" PostTypeId="2" ParentId="236" CreationDate="2011-03-09T11:32:05.467" Score="3" Body="&lt;p&gt;Too many answers :(&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/questions/71644/why-made-community-wiki&quot;&gt;Why made community wiki?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="95" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2011-03-09T11:32:05.467" CommentCount="3" ContentLicense="CC BY-SA 2.5" />
  <row Id="238" PostTypeId="1" AcceptedAnswerId="1449" CreationDate="2011-03-09T15:37:04.540" Score="34" ViewCount="675" Body="&lt;p&gt;Please kindly raise or remove CW limits on &lt;a href=&quot;http://codegolf.stackexchange.com&quot;&gt;Code Golf SE site&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Raise or Remove CW Conversion because of too many edits &lt;/li&gt;&#xA;&lt;li&gt;Raise or Remove CW Conversion because of too many answers&lt;/li&gt;&#xA;&lt;li&gt;Please allow current moderators of Code Golf SE to revert CW back to normal.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="132" OwnerDisplayName="S.Mark" LastEditorUserId="56656" LastEditDate="2017-07-05T03:35:52.980" LastActivityDate="2017-07-05T03:35:52.980" Title="Please raise or remove CW limits on Code Golf SE site" Tags="|discussion|support|status-completed|community-wiki|" AnswerCount="4" CommentCount="5" ContentLicense="CC BY-SA 2.5" />
  <row Id="239" PostTypeId="2" ParentId="238" CreationDate="2011-03-09T16:06:42.820" Score="17" Body="&lt;p&gt;I'm in favour of removing the limit entirely (or setting it to a crazy number like 2147483647), and removing the CW bit for all questions previously affected. Just throwing in my vote. ;-)&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="3" LastEditDate="2011-03-09T16:16:09.193" LastActivityDate="2011-03-09T16:16:09.193" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="240" PostTypeId="2" ParentId="238" CreationDate="2011-03-09T16:35:43.333" Score="2" Body="&lt;p&gt;I'll note that the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1294/anagram-code-golf&quot;&gt;question&lt;/a&gt; that seems to have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/236/why-is-this-question-marked-community-wiki&quot;&gt;sparked this request&lt;/a&gt; generated &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1294/anagram-code-golf/1349#1349&quot;&gt;two&lt;/a&gt; very similar &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1294/anagram-code-golf/1349#1349&quot;&gt;answers&lt;/a&gt; in Ruby in the last 12 hours, and they were both longer than the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1294/anagram-code-golf/1302#1302&quot;&gt;existing Ruby answer using the same strategy&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm the last person to say &lt;em&gt;&quot;You can't play if you're not going to win.&quot;&lt;/em&gt;, but is that really helpful or interesting?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sheesh! Since then there has been &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1294/anagram-code-golf/1372#1372&quot;&gt;another like them&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2011-03-09T16:35:43.333" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="241" PostTypeId="2" ParentId="231" CreationDate="2011-03-09T19:57:19.030" Score="8" Body="&lt;p&gt;This fire needs some &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1389/golfscript-the-missing-function&quot;&gt;gasoline&lt;/a&gt;. Especially because the given example is a poor code challenge for other reasons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it's great having questions that doesn't limit the choice of language, but frankly, standard golfing rules doesn't achieve that any better than a liberal definition of a car allow people, who otherwise doesn't have the means, to participate in a motor race.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Language-limited questions could help keep the sites appeal broader by allowing competitive golfing in many languages. By allowing out-of-competition submissions in other languages the freedom is practically the same.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As my question may hint, I like the &quot;Special Olympics&quot; concept. Choosing a language suitable for the job is such a boring way of life.&lt;/p&gt;&#xA;" OwnerUserId="101" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2011-03-09T19:57:19.030" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="242" PostTypeId="2" ParentId="238" CreationDate="2011-03-09T22:21:46.673" Score="18" Body="&lt;p&gt;For now, we raised the limits as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Editing your own post:  100&lt;/li&gt;&#xA;&lt;li&gt;Number of answers:  60&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If this doesn't suffice, we'll look at changing it again.&lt;/p&gt;&#xA;" OwnerUserId="9" LastEditorUserId="24" LastEditDate="2011-03-10T00:19:00.413" LastActivityDate="2011-03-10T00:19:00.413" CommentCount="4" ContentLicense="CC BY-SA 2.5" />
  <row Id="243" PostTypeId="1" CreationDate="2011-03-10T10:18:48.217" Score="4" ViewCount="261" Body="&lt;p&gt;&lt;strong&gt;1.&lt;/strong&gt; I've recently noticed that the site's name has changed to &lt;em&gt;Programming Puzzles &amp;amp; Code Golf&lt;/em&gt;. Though there are some design problems with the new logo.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Main:&#xA;&lt;img src=&quot;https://i.stack.imgur.com/KkXYz.png&quot; alt=&quot;screenshot of main&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Meta:&#xA;&lt;img src=&quot;https://i.stack.imgur.com/VSsUB.png&quot; alt=&quot;screenshot of meta&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Update&lt;/strong&gt;: this is now fixed on meta.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;2.&lt;/strong&gt; I think &lt;em&gt;Code Golf &amp;amp; Programming Puzzles&lt;/em&gt; would be a better name than &lt;em&gt;Programming Puzzles &amp;amp; Code Golf&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some stats:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;186&lt;/strong&gt; questions&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;141&lt;/strong&gt; tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; (~76%)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="344" LastEditorUserId="8608" LastEditDate="2013-07-16T12:38:05.067" LastActivityDate="2013-07-16T12:38:05.067" Title="Design problems with new logo" Tags="|discussion|bug|status-completed|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 2.5" />
  <row Id="244" PostTypeId="2" ParentId="163" CreationDate="2011-03-10T12:45:42.677" Score="0" Body="&lt;p&gt;Actually, reputations are generated, but it is just hidden.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/61/cbrulak?tab=reputation&quot;&gt;https://codegolf.meta.stackexchange.com/users/61/cbrulak?tab=reputation&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="132" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2011-03-10T12:45:42.677" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="245" PostTypeId="2" ParentId="243" CreationDate="2011-03-10T13:57:26.390" Score="0" Body="&lt;p&gt;It sure doesn't look good with the title so close to the bar. Who does this stuff? Anyway, a simple #hlogo a {margin:20px 0px 0px;} seems to do the trick. Meta is butched because the move is done by adjusting background-position without making the block equivalently larger, it could actually be adjusted 20px down this way without cropping any of the visible image, but it's currently set to 23px.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for the naming I like having weight on Puzzles, and I think writing it first does that better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bump: The title is still in a messed up position on the main site.&lt;/p&gt;&#xA;" OwnerUserId="101" LastEditorUserId="101" LastEditDate="2011-04-06T16:17:32.597" LastActivityDate="2011-04-06T16:17:32.597" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="246" PostTypeId="2" ParentId="67" CreationDate="2011-03-10T15:10:51.017" Score="5" Body="&lt;p&gt;I think an entry should be judged on a number of factors:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Conciseness&lt;/strong&gt; - number of characters is a useful rough metric but I would give some allowance for the language (e.g. I'd &lt;em&gt;definitely&lt;/em&gt; count 100 characters of Java as a win over 80 characters of Perl) &lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Conceptual beauty&lt;/strong&gt; - is it a beautiful and clever approach to solving the problem?&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Surprise factor&lt;/strong&gt; - did I learn something new and enlightening about the langugae in question? did the author impress me with some amazing ingenuity?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;All of these are subjective. But so what? This is not yet an olympic sport :-)&lt;/p&gt;&#xA;" OwnerUserId="753" LastActivityDate="2011-03-10T15:10:51.017" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="248" PostTypeId="2" ParentId="243" CreationDate="2011-03-10T16:04:15.807" Score="7" Body="&lt;p&gt;This site is not just for code golf, but as you point out, the questions are heavily weighted towards code golf.  This is the exact reason for the name change.  Code golf was being emphasized too much, and people were a) not visiting the site because they thought it was only for code golf questions, and b) even if they did get here, only saw code golf questions and didn't participate.  If the name of the site is actually harming the site, that absolutely needs to be looked at.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for putting programming puzzles first, code golf is a subset of programming puzzles, so even listing code golf separately is a bit iffy for me personally, much less listing it first and putting even more emphasis on it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, I can't do anything for #1 right now, but #2 is &lt;em&gt;exactly&lt;/em&gt; the reason for the name change.&lt;/p&gt;&#xA;" OwnerUserId="24" LastActivityDate="2011-03-10T16:04:15.807" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="249" PostTypeId="1" AcceptedAnswerId="251" CreationDate="2011-03-11T04:24:00.447" Score="5" ViewCount="249" Body="&lt;p&gt;When should we up vote &lt;em&gt;questions&lt;/em&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've seen questions with something like 10 answers, but 1 only one up vote. Usually, on the other SE sites, I see questions with more or the same amount of up votes as answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Are the rules here not entirely unlike the ones on the other SE sites? Should we only up vote if we see an &quot;extraordinary&quot; question?&lt;/p&gt;&#xA;" OwnerUserId="761" LastActivityDate="2014-04-23T09:29:32.537" Title="More answers than up votes" Tags="|discussion|voting|" AnswerCount="4" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="250" PostTypeId="2" ParentId="249" CreationDate="2011-03-11T05:39:23.847" Score="1" Body="&lt;p&gt;No idea, I hardly ever upvote questions, so I guess they have to be extraordinary for me :)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've also upticked questions that I don't have time to answer right then, but intend to come back to.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To the asker, the upvote may mean &quot;I like this question and appreciate your effort, please ask more similar questions in the future&quot;  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It seems to go both ways though, here are a couple of my questions&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/985/koch-snowflake-codegolf&quot;&gt;koch-snowflake&lt;/a&gt; has 9 votes and 3 answers&lt;br&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/1364/detect-rotated-strings&quot;&gt;detect-rotated-strings&lt;/a&gt; has 1 vote and 13 answers&lt;/p&gt;&#xA;" OwnerUserId="95" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2011-03-11T19:54:30.680" CommentCount="4" ContentLicense="CC BY-SA 2.5" />
  <row Id="251" PostTypeId="2" ParentId="249" CreationDate="2011-03-11T16:43:15.837" Score="10" Body="&lt;p&gt;On codegolf.se, I am very likely to uptick anything I answer, but that &lt;a href=&quot;https://meta.stackexchange.com/questions/30502/automatically-upvote-questions-you-answer-unless-you-say-otherwise/30569#30569&quot;&gt;certainly isn't a general condition&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2011-03-11T16:43:15.837" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="252" PostTypeId="1" CreationDate="2011-03-11T19:20:54.360" Score="3" ViewCount="217" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/1360/78&quot;&gt;How to write a single-line password generator&lt;/a&gt; asks for a solution in &quot;one line&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It seems to me that this is &lt;em&gt;potentially&lt;/em&gt; a different class of challenge from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, and for the nonce I've tagged it &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/one-liner&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;one-liner&amp;#39;&quot; rel=&quot;tag&quot;&gt;one-liner&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What say ye?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a different challenge?&lt;/li&gt;&#xA;&lt;li&gt;If so, how do we define &lt;em&gt;&quot;one line&quot;&lt;/em&gt;? (Note that this will have to be sensitive to the differences between languages...)&lt;/li&gt;&#xA;&lt;li&gt;How does this interact with languages that prescribe a certain amount of scaffolding (like c requires &lt;code&gt;main&lt;/code&gt;), or traditionally don't have a single command invocation from the command line?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2011-04-27T02:28:48.633" Title="Are &quot;one line&quot; problems distinct from code golf, and if so what rules apply?" Tags="|discussion|policy|tags|rules|contest-type|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 2.5" />
  <row Id="253" PostTypeId="2" ParentId="252" CreationDate="2011-03-11T23:11:16.183" Score="3" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/one-liner&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;one-liner&amp;#39;&quot; rel=&quot;tag&quot;&gt;one-liner&lt;/a&gt; is fine in my opinion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As to what constitutes a one-liner, in languages that have a concept of statements, that's straightforward: the whole program should fit into one statement. (Scaffolding does not count as statements.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In languages that don't have a concept of statement, then it gets pretty blurry. :-(&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2011-03-11T23:11:16.183" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="254" PostTypeId="2" ParentId="249" CreationDate="2011-03-13T17:14:22.660" Score="7" Body="&lt;p&gt;I tend to upvote questions when I consider them interesting or fun to golf. Usually I tend to upvote only after I answered and in some cases it's quite surprising what you can find even in simple-sounding questions (e.g. Kaprekar).&lt;/p&gt;&#xA;" OwnerUserId="15" LastActivityDate="2011-03-13T17:14:22.660" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="255" PostTypeId="1" CreationDate="2011-03-14T06:23:11.567" Score="11" ViewCount="305" Body="&lt;p&gt;Recent example: Code Golf for a^b mod n.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there a policy I'm missing about what's too easy? If not...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should questions I personally dub too easy be...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Ignored and left for interested users?&lt;/li&gt;&#xA;&lt;li&gt;Downvoted?&lt;/li&gt;&#xA;&lt;li&gt;Flagged?&lt;/li&gt;&#xA;&lt;li&gt;Commented with a policy of some sort?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;What, if anything is too easy?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Arithmetic? See example. (Counter: &lt;a href=&quot;http://www.esolangs.org/wiki/Main_Page&quot; rel=&quot;nofollow&quot;&gt;Esolangs&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Anything implemented trivially by builtins in most languages?&lt;/li&gt;&#xA;&lt;li&gt;Anything in a beginner book?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Would guidelines be different for code golf, code challenge or puzzles?&lt;/p&gt;&#xA;" OwnerUserId="957" LastActivityDate="2011-05-22T18:23:21.063" Title="How easy is too easy?" Tags="|discussion|voting|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="256" PostTypeId="2" ParentId="255" CreationDate="2011-03-14T20:26:32.217" Score="2" Body="&lt;p&gt;Good question. I see 2 problems, genuinely too easy questions, and questions that are too easy to solve in some languages because they implement the function partially or completely. The latter is the biggest problem. This brings back the question about setting a specific language for a question, I personally prefer that by far over questions that grow trivial.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In general code golf allow for some easier questions since it may be quite far from trivial to shorten a program even though the basic implementation is easy to write.&lt;/p&gt;&#xA;" OwnerUserId="101" LastActivityDate="2011-03-14T20:26:32.217" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="257" PostTypeId="2" ParentId="88" CreationDate="2011-03-15T11:16:18.503" Score="8" Body="&lt;p&gt;I would really like to encourage people to post a commented, readable version of their code. Like Timwi does for example, for the more complex pieces of code: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1530/draw-a-suanpan-abacus/1599#1599&quot;&gt;one&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1536/hello-world-0-0/1568#1568&quot;&gt;two&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2009/long-multiply-8-bits-at-a-time/2025#2025&quot;&gt;three&lt;/a&gt;. Then you don't have to be completely versed in a language and still have a good chance of getting a good idea for how something works.&lt;/p&gt;&#xA;" OwnerUserId="669" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2011-04-12T15:15:10.267" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="259" PostTypeId="2" ParentId="209" CreationDate="2011-03-21T19:05:11.003" Score="3" Body="&lt;p&gt;Date stuff is a mess for golfing anyway since task complexity vary depending on what your datetime library can do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In total, all this is mostly related to the problems of golfing in different languages.&lt;/p&gt;&#xA;" OwnerUserId="101" LastActivityDate="2011-03-21T19:05:11.003" CommentCount="6" ContentLicense="CC BY-SA 2.5" />
  <row Id="260" PostTypeId="1" CreationDate="2011-03-22T16:38:59.337" Score="10" ViewCount="729" Body="&lt;p&gt;I was under the impression that the point in code-golf was to generate the shortest &lt;em&gt;source code&lt;/em&gt; in some &lt;em&gt;programming language&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, some of the answers are binary files, e.g. MS-DOS &lt;code&gt;.com&lt;/code&gt; files. Now don’t get me wrong, obviously there’s no problem with posting these, especially if the solution is elegant and interesting. But should the &lt;em&gt;compiled/assembled binary&lt;/em&gt; be considered for the length of the &lt;em&gt;code&lt;/em&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If so, would it be similarly acceptable to write the solution in C/C++, use a code-size super-optimising compiler to generate a binary, and then claim the size of the compiled binary as the score? What about managed code, e.g. JVM bytecode, .NET IL, Parrot, etc.?&lt;/p&gt;&#xA;" OwnerUserId="668" LastActivityDate="2012-01-06T03:03:13.883" Title="Should executable binaries be considered a reasonable solution for code-golf?" Tags="|discussion|" AnswerCount="4" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="261" PostTypeId="2" ParentId="260" CreationDate="2011-03-22T20:00:22.427" Score="-1" Body="&lt;p&gt;I think the community will handle this one by voting and it doesn't need to be answered that badly. In most cases, though, I think binaries would be off limits because they couldn't reside directly in the answer; this is not a coincidence, because code is almost always text. There are corner cases like Piet, and naturally lots of challenge opportunities, where it would be better to let the votes decide than make a hard and fast rule.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This brings up other issues, though - &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Answers that use machine-generated source-code, e.g.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Answers that use J's &lt;a href=&quot;http://www.jsoftware.com/help/dictionary/d310n.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;:&lt;/a&gt; operator to get tacit definitions&lt;/li&gt;&#xA;&lt;li&gt;Answers &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1663/shuffle-a-deck-without-local-variables/1669#1669&quot;&gt;like this example&lt;/a&gt; where lambdabot is used to go from points to point-free.&lt;/li&gt;&#xA;&lt;li&gt;Esoteric cases: Using a 'Whitespace' compiler to compile to Whitespace (I've done this on SPOJ where it's not such a big deal)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Image-based languages (Smalltalk &amp;amp; Self)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Maybe those should be discussed elsewhere?&lt;/p&gt;&#xA;" OwnerUserId="957" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2011-03-23T03:58:52.523" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="262" PostTypeId="2" ParentId="260" CreationDate="2011-03-22T20:23:37.100" Score="2" Body="&lt;p&gt;&lt;a href=&quot;http://golf.shinh.org/&quot; rel=&quot;nofollow&quot;&gt;Anarchy Golf&lt;/a&gt; does indeed allow submitting binary files for submissions. But remember, many executable files have headers, and those take up space too. So often you'll find that they do not give you an advantage, unless you're a hardcore object code coder.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I encourage people writing questions to clarify whether they permit object code answers, by listing the winning criterion as either &lt;em&gt;smallest code size&lt;/em&gt; or &lt;em&gt;smallest source code size&lt;/em&gt;, as the case may be.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2011-03-22T20:23:37.100" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="263" PostTypeId="2" ParentId="94" CreationDate="2011-03-23T00:13:38.890" Score="13" Body="&lt;p&gt;I would say a good answer should include an explanation of how it works, so there should be no trouble at all to write at least 30 characters.&lt;/p&gt;&#xA;" OwnerUserId="668" LastActivityDate="2011-03-23T00:13:38.890" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="266" PostTypeId="2" ParentId="42" CreationDate="2011-03-24T06:12:33.767" Score="2" Body="&lt;p&gt;I think if your score depends on things that don’t represent properly on the website, you should post your solution in some way that allows to reliably reproduce the original file. &lt;a href=&quot;http://www.opinionatedgeek.com/dotnet/tools/Base64Encode/Default.aspx&quot; rel=&quot;nofollow noreferrer&quot;&gt;Base64 encoding&lt;/a&gt; is a popular method of doing this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, any answer that provides a base64-encoded solution should &lt;em&gt;also&lt;/em&gt; provide a human-readable solution (which may be longer than the “real” entry). I think &lt;a href=&quot;https://codegolf.stackexchange.com/questions/985/koch-snowflake-codegolf/1749#1749&quot;&gt;my Koch snowflake answer&lt;/a&gt;, which uses all sorts of characters that are unprintable but nonetheless accepted by the Perl interpreter, exemplifies this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So for Python code, you could write something like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;for x in blahblah&#xA; for y in blahblah&#xA;&amp;lt;tab&amp;gt;some statement&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;but personally I would argue that this should not be necessary; just provide the code in “standard” readable indentation, and the “adventurous” one as base64.&lt;/p&gt;&#xA;" OwnerUserId="668" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2011-03-24T06:12:33.767" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="267" PostTypeId="2" ParentId="170" CreationDate="2011-03-24T06:26:32.153" Score="1" Body="&lt;p&gt;Perhaps if the code provided is valid base64, your script should detect that and display the size it would have when decoded, which is easy to calculate: remove all the whitespace, remove the trailing &lt;code&gt;=&lt;/code&gt; characters, multiply the length by 3 and divide by 4 (round down).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To give an example where it makes sense to post a base64-encoded answer, see &lt;a href=&quot;https://codegolf.stackexchange.com/questions/985/koch-snowflake-codegolf/1749#1749&quot;&gt;my Perl script that uses unprintable bytes in the source&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="668" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2011-03-24T06:31:52.307" CommentCount="0" CommunityOwnedDate="2011-03-24T06:26:32.153" ContentLicense="CC BY-SA 2.5" />
  <row Id="268" PostTypeId="1" CreationDate="2011-03-24T06:45:03.207" Score="5" ViewCount="167" Body="&lt;p&gt;In the interest of upping the quality of challenges I may post in the future, I would like to hear your opinions and comments on the challenge I posted two weeks ago:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/1299/turn-2d-boolean-array-into-rectilinear-polygons&quot;&gt;Turn 2D boolean array into (rectilinear) polygons&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;It is clear that there was little to no interest. Only one golfer actually posted a solution. I attempted the challenge myself 8 days later (honestly; I didn’t have a solution up my sleeve already, I actually wrote it just before I posted it) to show that it can be done and that a reasonably short solution is feasible. I continued to improve the solution hoping that it would attract interest in the challenge, but to no avail.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yet, my challenge seems to fulfill &lt;em&gt;all&lt;/em&gt; of the criteria given in the accepted answer on this FAQ here:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/93/what-details-should-always-be-given-for-a-code-golf-task&quot;&gt;What details should always be given for a code golf task?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Now please don’t get me wrong, I am not whining or complaining — quite to the contrary, I would like to find out if there was something the community considered to be wrong with the challenge, so I welcome any constructive criticism, even negative. Thanks!&lt;/p&gt;&#xA;" OwnerUserId="668" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2011-03-24T06:45:03.207" Title="Why was my challenge not interesting?" Tags="|discussion|challenge-quality|" AnswerCount="0" CommentCount="7" ContentLicense="CC BY-SA 2.5" />
  <row Id="269" PostTypeId="1" CreationDate="2011-03-24T20:36:15.890" Score="3" ViewCount="87" Body="&lt;p&gt;After asking &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1764/what-is-a-good-way-to-deal-with-tasks-that-requires-arrays-using-haskell&quot;&gt;this&lt;/a&gt; question, I got a downvote promptly. A user told me in the comments, that this page is for programming challenges and not for questions about how to be better in such challenges. I showed the user &lt;a href=&quot;https://codegolf.stackexchange.com/questions/54/tips-for-golfing-in-python&quot;&gt;this&lt;/a&gt; question about tips for golfing in Python and about many on-topic questions about such things during the definition phase.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I kindly request the admins of this site to add a small paragraph in the FAQ page, that questions about tips for better gofing etc. are welcome on this page, or a paragraph, that states the opposite, if such questions aren't welcome here. (But where to post such a question else?)&lt;/p&gt;&#xA;" OwnerUserId="134" LastEditorUserId="68942" LastEditDate="2021-06-09T05:49:31.450" LastActivityDate="2021-06-09T05:49:31.450" Title="Making the FAQ more precise." Tags="|feature-request|status-completed|challenges|clarification|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 2.5" />
  <row Id="270" PostTypeId="2" ParentId="269" CreationDate="2011-03-24T20:49:46.763" Score="1" Body="&lt;p&gt;Since I'm the philistine in question, I might as well throw the first... Uh... Nevermind, that metaphor wasn't going anywhere.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;But where to post such a question else?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Stackoverflow... As CW if it isn't specific enough. Whatever the original reason was for moving code golf to a separate SE, Stackoverflow is still fair game for most coding questions so I don't see why to put them somewhere else.&lt;/p&gt;&#xA;" OwnerUserId="957" LastActivityDate="2011-03-24T20:49:46.763" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="273" PostTypeId="1" AcceptedAnswerId="274" CreationDate="2011-03-27T03:10:02.140" Score="20" ViewCount="3205" Body="&lt;p&gt;Interactive languages (and related issues) have afflicted me with a bunch of gripes regarding character count and program testing. Clarifying these should help coders in other languages like Mathematica and dc with similar issues. (And will also shut me up about it!)&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;strong&gt;How much action on the user's part (to invoke the program)?&lt;/strong&gt; For instance, does it count if you, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1775/additive-persistence/1779#1779&quot;&gt;as in this example&lt;/a&gt;, make the user paste in each line?&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;How are character counted in interactive solutions?&lt;/strong&gt; How is it counted if you, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1775/additive-persistence/1779#1779&quot;&gt;as in this example&lt;/a&gt;, make the user paste in each line? In that example, Eelvex counts just the characters in each row, no newlines.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;How are special invocations counted?&lt;/strong&gt; E.g. specifying perl command line options or using an external program like &lt;code&gt;tr&lt;/code&gt; to filter input for dc or J. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1720/finding-maximum-paths/1723#1723&quot;&gt;Example&lt;/a&gt; (Sorry, Eelvex, you're an easy target :)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Where a function is requested, should it be assigned a name?&lt;/strong&gt; For instance, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/878/comparing-powers&quot;&gt;in this question&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="957" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-06-16T13:59:58.240" Title="On &quot;interactive&quot; answers and other special conditions" Tags="|discussion|characters|clarification|user-interface|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 2.5" />
  <row Id="274" PostTypeId="2" ParentId="273" CreationDate="2011-03-27T10:27:35.630" Score="17" Body="&lt;p&gt;My basic guideline would be &quot;as the problem statement says&quot;.  Which is mostly to mean it's allowed to explicitly override anything it wants from what I'm about to say next.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Actions to invoke&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For test-case/IO programs, I like it better when the whole invocation is possible as a single line, through redirection or bash herestrings (&lt;code&gt;&amp;lt;&amp;lt;&amp;lt;&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$ interpreter script.ext &amp;lt; input_file&#xA;$ program &amp;lt;&amp;lt;&amp;lt; 'input line'&#xA;$ echo -n 'sensitive input' | ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If for justifiable reasons input can't be redirected in (&lt;em&gt;e.g.&lt;/em&gt; has to be terminal input, and the problem statement didn't forbid that&amp;mdash;and I don't think it should), it should be with minimal hassle.  Line by line would likely be too much for my personal level of acceptable laziness.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(kinda OT: I haven't tried the Eelvex example you linked to, but the data-pasting requirement seems more like an overhasty copy-paste from his live demo session than an actual requirement of his program)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Character count in interactive solutions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Only the characters part of the code are counted in.  That includes newlines, if they're needed for the code to be well-formed.  Unless overruled by problem statement, input is not counted in.  That includes newlines part of the input.  I trust the problem statements to be clear enough in this regard, and the answerers to be fast enough to request clarifications when needed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Digressing from there, I don't think input data should be allowed to be mixed with code.  Separate file, input stream, prepended, appended, both? (J again), stuck in parentheses for a function call, ok, but &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1294/anagram-code-golf/1306#1306&quot;&gt;this is too much&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Special invocations&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This one is more subtle than the question makes it.  I make a difference between:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;options to bring the language level to a specific point.  This has mostly been observed with Perl 5.10+, but I feel it might pop up again with Haskell Prime.  It was kept a bit more hidden for compiled languages anyway (C99, C++0x)  The consensus up to now on SO and here was &quot;the &lt;code&gt;-M5.010&lt;/code&gt;, when needed, is free&quot;.&lt;/li&gt;&#xA;&lt;li&gt;options to request different behaviors from the interpreter.  This is the n/p/l/a/f family of options in perl/sed/awk/ruby.  I count those as a difference in character count to the shortest equivalent invocation without them.  This can be a bit tricky at times&lt;br&gt;&#xA;&lt;code&gt;perl -nle 'stuff'&lt;/code&gt; is 2 characters more than &lt;code&gt;perl -e 'stuff'&lt;/code&gt;, so it counts for 2 more characters than the contents of &lt;code&gt;stuff&lt;/code&gt;.  &lt;strong&gt;This supposes &lt;code&gt;stuff&lt;/code&gt; needs no quoting to go in single quotes&lt;/strong&gt;, or it would need more characters to escape.  If not, either the escape characters are counted in as well, or you put the script in a file, and count the difference to &lt;code&gt;perl -nl file.pl&lt;/code&gt;, which now includes the hyphen as well as one of the spaces.&lt;/li&gt;&#xA;&lt;li&gt;OT: the shebang follows the same rules (it's free, except for the behavior-modifying parts of it)&lt;/li&gt;&#xA;&lt;li&gt;external filtering: IMO this kicks the submission out of single language league, and it should be evaluated as a standalone bash (or other) script.  That shoudln't prohibit it from using multiple script files, named with a single letter if the interpreter allows it; it makes the submission less readable anyway and that should be enough to discourage.  We might want to devise a tolerance for a single interpreter name (&lt;code&gt;jconsole&lt;/code&gt; seems a bit arbitrarily handicapped compared to &lt;code&gt;dc&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Named functions?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If the problem statement asks for a statement, answer with a function.  If the language allows/supports anonymous functions, use them at will.  If not, well you don't really have a choice, do you?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For languages without functions... I don't know.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Compute this!&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You didn't ask for it, but I'm mentioning it &lt;em&gt;en passant&lt;/em&gt; as it's related.  For problems that just ask &quot;compute this&quot; (usually with such and such constraints), I'm very tolerant on the I/O.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The interpreter's interactive output is good to me.&lt;/li&gt;&#xA;&lt;li&gt;Requiring the code to be pasted in is ok, as long as it can be done in a single shot and the newline is counted in if needed.&lt;/li&gt;&#xA;&lt;li&gt;Requiring a bit of environment tweaking to prevent long answers from being truncated is ok and free.&lt;/li&gt;&#xA;&lt;li&gt;Environment tweaking that alters the calculations is &lt;strong&gt;not ok&lt;/strong&gt;.  (I'm thinking of bc's precision and base)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="199" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2015-03-21T12:26:40.913" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="275" PostTypeId="2" ParentId="42" CreationDate="2011-03-27T10:39:52.153" Score="2" Body="&lt;p&gt;I think this happens for Python submissions only (maybe Haskell?)  Moreover, select few: only the ones that need to define multiple levels of code scoping.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also suppose there exists a canonical optimal encoding that's the same for any snippet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With this in mind, I'd say to give the answers in golfed spaces-only form, and count characters with the tabbed version, linking to here as for why.&lt;/p&gt;&#xA;" OwnerUserId="199" LastActivityDate="2011-03-27T10:39:52.153" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="276" PostTypeId="2" ParentId="209" CreationDate="2011-03-27T10:52:04.417" Score="7" Body="&lt;p&gt;Here's an extreme proposal.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You're allowed to submit code that&#xA;works in &lt;code&gt;C&lt;/code&gt; for free.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Other than that, you declare your&#xA;locale in your profile, don't change&#xA;it too often (I'll check :p&amp;nbsp;),&#xA;and are allowed submissions in that&#xA;locale only.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Actually, I'm more concerned about the &lt;em&gt;problems&lt;/em&gt; being locale-centric than the solutions.&lt;/p&gt;&#xA;" OwnerUserId="199" LastActivityDate="2011-03-27T10:52:04.417" CommentCount="5" ContentLicense="CC BY-SA 2.5" />
  <row Id="277" PostTypeId="1" CreationDate="2011-03-28T04:47:58.207" Score="5" ViewCount="216" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/1817/code-chess-fibonacci-sequence&quot;&gt;This question&lt;/a&gt; was migrated in this morning. It was asked about a year ago on Stack Overflow, as a sort of alternative to the then-established Code Golf niche. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you've never had a chance to read the answers, you should - some of 'em are pretty clever. Which... Was the purpose. The &lt;em&gt;only&lt;/em&gt; purpose. There are no criteria &lt;em&gt;other&lt;/em&gt; than raw cleverness. You can even &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1817/code-chess-fibonacci-sequence/1819#1819&quot;&gt;cheat&lt;/a&gt;... &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It was a fun diversion on SO, exactly the sort of question that's fun to see crop up every once in a while. And it accomplished that goal...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But is there any reason for it to live on? More importantly, is there any reason for it to live on &lt;em&gt;here&lt;/em&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I understand there's a fair bit of &quot;show off how clever you can be&quot; to most programming puzzles, but shouldn't there also be... A puzzle? Solve in minimum length / run-time / memory... &lt;em&gt;Something&lt;/em&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I can't really tell, from the FAQ or discussions here, whether or not such a challenge is acceptable. Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="1144" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2011-03-28T14:42:06.737" Title="Is &quot;cleverness&quot; valid as the sole criteria for a puzzle?" Tags="|discussion|scope|code-challenge|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="279" PostTypeId="2" ParentId="277" CreationDate="2011-03-28T14:42:06.737" Score="4" Body="&lt;p&gt;&lt;em&gt;I&lt;/em&gt; personally think those questions have no place on this site. We need questions with at least some degree of objectivity when it comes to deciding which answer should &quot;win&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Others have argued that as long as no answer is selected as &quot;accepted&quot;, then subjective questions are okay. I'm a little iffy on that stance, but I also don't want my opinion to be the final word if most users decide that &quot;cleverness as winning criterion&quot; have some value.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2011-03-28T14:42:06.737" CommentCount="7" ContentLicense="CC BY-SA 2.5" />
  <row Id="281" PostTypeId="1" AcceptedAnswerId="295" CreationDate="2011-03-29T23:17:27.463" Score="9" ViewCount="350" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/1872/code-golf-distributing-the-balls-i/1879#1879&quot;&gt;This answer&lt;/a&gt; is a fairly extreme example. For the largest input it would create an array with 1.048576e+26 elements which is not going to fit in RAM anytime soon (maybe not even physically possible).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However given enough time and memory it would reach the answer eventually&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the case the the practical answers are not able to be made shorter, how should a winner be chosen?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are already questions on meta about explicit extra conditions, but I am asking about implicit limitations here.&lt;/p&gt;&#xA;" OwnerUserId="95" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2011-04-13T04:01:39.450" Title="Can code-golf answers be too slow?" Tags="|discussion|code-golf|accepted-answer|" AnswerCount="3" CommentCount="1" ContentLicense="CC BY-SA 2.5" />
  <row Id="282" PostTypeId="2" ParentId="281" CreationDate="2011-03-30T04:22:51.793" Score="7" Body="&lt;p&gt;I tend to judge such issues subjectively.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For a run of the mill, not particularly interesting approach, I wouldn't vote for a solution that won't fit in a modern desktop's ram or would take days to do something modest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But for something really clever, I'd probably cut some more slack.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But there have to be limits.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that I probably wouldn't down vote even then. I just won't vote for them and would accept them if it was my question.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2011-03-30T04:22:51.793" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="283" PostTypeId="2" ParentId="281" CreationDate="2011-03-31T13:50:05.597" Score="5" Body="&lt;p&gt;Mostly I'd say it's something the asker should define, preferably when the question is asked.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for combinatorics, brute force solutions will almost always be the shortest ones, allowing them really just ruin the mathematical aspect of the question.&lt;/p&gt;&#xA;" OwnerUserId="101" LastActivityDate="2011-03-31T13:50:05.597" CommentCount="3" ContentLicense="CC BY-SA 2.5" />
  <row Id="284" PostTypeId="1" AcceptedAnswerId="285" CreationDate="2011-04-03T03:40:02.917" Score="5" ViewCount="203" Body="&lt;p&gt;I'm not sure if &quot;restricted programming&quot; is the right term for what I'm thinking about.  I'm referring to questions of the form: &quot;Complete [some task] in [some specific language] without [some obvious keywords, operators, etc.]&quot;.  For instance, requesting interesting ways to implement a particular Java interface without using &lt;code&gt;for&lt;/code&gt; or &lt;code&gt;while&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="1188" LastEditorUserId="15" LastEditDate="2011-06-25T07:37:36.573" LastActivityDate="2011-06-25T07:37:36.573" Title="Are &quot;restricted programming&quot; problems on topic?" Tags="|discussion|policy|challenges|clarification|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="285" PostTypeId="2" ParentId="284" CreationDate="2011-04-03T04:39:13.913" Score="6" Body="&lt;p&gt;As I recall, one of the deciding factors is whether the contest can be fairly and objectively judged by some concrete metric.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So just being &quot;interesting ways&quot; would fail that criteria miserably. How do you quantify &quot;interesting&quot;?&lt;/p&gt;&#xA;" OwnerUserId="97" LastActivityDate="2011-04-03T04:39:13.913" CommentCount="2" ContentLicense="CC BY-SA 2.5" />
  <row Id="286" PostTypeId="1" CreationDate="2011-04-04T10:26:49.793" Score="156" ViewCount="9675" Body="&lt;p&gt;I have found code-golf a fascinating pastime for several weeks now.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I’m already losing interest because the contests allow any language, and because of that it is pretty much impossible for anything other than J or GolfScript to get anywhere close to winning. As soon as I see a less-than-100-character solution in J or GolfScript, there’s already no point even trying.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you are tempted to downvote this post and/or post an answer saying you don’t care or don’t agree, please consider the following important point. If you did care, you’d probably have already left. The fact that you are still here, reading this, puts you in the unrepresentative sample of people who are still interested in the challenge. Try to overcome this bias for a moment and think of all the people who will have already left &lt;em&gt;without&lt;/em&gt; telling you like I am doing now.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are several ways that I can think of to mitigate the problem, but unfortunately both seem to be unpracticable...&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;For each challenge, maybe there should be a separate contest for each programming language? A C# program ideally shouldn’t have to compete against Perl, much less GolfScript. Unfortunately this would mean an explosion of threads. Using tags could mitigate this a bit, and perhaps each post could link to all other posts for the same challenge in other programming languages.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Perhaps there should simply be more upvoting, more comments, more involvement, more praise. Remember that having no activity on one’s answer feels to the poster like it’s receiving no attention and nobody is interested. Perhaps losing with a C# entry wouldn’t be quite so bad if there were at least a few upvotes and a few comments saying “well done” or something?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Edit&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is quite an old thread. I am surprised that it has received this many upvotes. Looks like my suggestion #2 appears to have been implemented, thanks! &lt;code&gt;:D&lt;/code&gt; Since I posted this, I think I no longer consider competing and winning to be a source of enjoyment. It’s nice to receive some upvotes and some encouraging comments, and that’s all I need. Since I posted this, I have invented &lt;a href=&quot;http://esolangs.org/wiki/Sclipting&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sclipting&lt;/a&gt; and even though it doesn’t achieve its goal (it doesn’t beat GolfScript or J, not by a long shot), I enjoy writing solutions in it. I also enjoy challenges that aren’t code-golf :)&lt;/p&gt;&#xA;" OwnerUserId="668" LastEditorDisplayName="user62131" LastEditDate="2017-06-23T21:55:27.043" LastActivityDate="2017-06-23T21:55:27.043" Title="J and GolfScript suck all the enjoyment out of Code Golf" Tags="|discussion|code-golf|" AnswerCount="17" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="287" PostTypeId="2" ParentId="286" CreationDate="2011-04-04T12:08:09.103" Score="31" Body="&lt;p&gt;Of course programming languages are created unequal when it comes to producing the shortest possible source code for a given task. Java can never beat J, &lt;em&gt;c'est la vie&lt;/em&gt;. But why should this stop you from enjoying codegolf?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can compete against the solutions in your language of choice&lt;/li&gt;&#xA;&lt;li&gt;No need to upvote the shortest solution, choose those you understand and enjoy the most&lt;/li&gt;&#xA;&lt;li&gt;Isn't it nice when the other solutions copy your algorithm? ;-)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;To actually learn something, you need to participate; looking at your profile it seems that you haven't submitted a single golf answer yet?&lt;/s&gt; Oops, I was looking at your meta profile...&lt;/p&gt;&#xA;" OwnerUserId="80" LastActivityDate="2011-04-04T12:08:09.103" CommentCount="7" ContentLicense="CC BY-SA 2.5" />
  <row Id="289" PostTypeId="2" ParentId="286" CreationDate="2011-04-04T21:06:17.727" Score="12" Body="&lt;p&gt;On SO we often faced Python and Ruby being beaten time and time again by Perl, sometimes only by a few chars and those Perl answers would get an astronomical number of votes, while the others were lucky to get 10.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Having Perl win all the time was a little frustrating, but often you would have fun shootouts with other answers that were a similar length to your own. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some people like me, turned to golfscript to see if it was possible to beat Perl. What I found was that golfscript is quite a cool language in it's own right and it can be quite difficult to find the shortest answer, and quite fascinating to see another GS answer substantially smaller than your own.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One interesting thing was that the Perl answers often continued to get a lot of votes and Golfscript got less than Python/Ruby. The point is that people will vote however they feel regardless of the rules and restrictions in the question (and it's really hard to predict what people will vote for).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I got an upvote for using &lt;code&gt;~:o)&lt;/code&gt; in one answer and it didn't even work properly :)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So if you are more interested in votes use the most popular (with the voters) language and make you answer fun/clever as well as short.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want to have the shortest code, be a polygot. Don't bring a sword to a gunfight.&lt;/p&gt;&#xA;" OwnerUserId="95" LastActivityDate="2011-04-04T21:06:17.727" CommentCount="6" ContentLicense="CC BY-SA 2.5" />
  <row Id="290" PostTypeId="2" ParentId="286" CreationDate="2011-04-05T12:50:14.153" Score="6" Body="&lt;p&gt;I really do agree, it isn't a lot of fun to compete with so different preconditions. Having a competition in all languages for a single problem doesn't seem like a great solution though, we have too few user and too many languages to make that viable. I have previously suggested that the author for each question state a main language, let any language participate, but choose the winner only from the main language. That way there should be a more even spread between the languages.&lt;/p&gt;&#xA;" OwnerUserId="101" LastActivityDate="2011-04-05T12:50:14.153" CommentCount="0" ContentLicense="CC BY-SA 2.5" />
  <row Id="291" PostTypeId="2" ParentId="286" CreationDate="2011-04-05T18:47:57.143" Score="20" Body="&lt;ul&gt;&#xA;&lt;li&gt;There are a &#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/1864/46&quot;&gt;lot&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/430/46&quot;&gt;of&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/189/46&quot;&gt;good&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/1911/46&quot;&gt;questions&lt;/a&gt;&#xA;where shortest answer is not the highest voted.&lt;/li&gt;&#xA;&lt;li&gt;I suppose that you &lt;em&gt;first&lt;/em&gt; have to make the community and &lt;em&gt;then&lt;/em&gt; the rules. If people here gather to golf in J/golfscript/dc then people here have to learn J/golfscript/dc. If they come to golf in &lt;em&gt;their&lt;/em&gt; language they'll do so and eventually they'll get pissed of the j/g/d guys and try to impose some rules on them :)&lt;/li&gt;&#xA;&lt;li&gt;There are tasks where j/g/d lose their edge. We should have more of those.&lt;/li&gt;&#xA;&lt;li&gt;This site is also meant for puzzles. We should have more of them.&lt;/li&gt;&#xA;&lt;li&gt;We should all vote more.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;As soon as I see a less-than-100-character solution in J or GolfScript, there’s already no point even trying.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Code golf is fun&lt;sup&gt;*&lt;/sup&gt; and educating. Just ignore the other answers and post your own. &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;it is pretty much impossible for anything other than J or GolfScript to get anywhere close to winning&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Who's the winner when you have a &lt;em&gt;1 vote / 100 chars&lt;/em&gt; answer and &lt;em&gt;a 10 votes / 200 chars&lt;/em&gt; answer?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;*It really is &lt;em&gt;more&lt;/em&gt; fun in some languages (like ruby, perl, python, &lt;strong&gt;J&lt;/strong&gt;, etc). There is not much we can do about that.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="46" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2011-04-05T18:47:57.143" CommentCount="4" ContentLicense="CC BY-SA 2.5" />
  <row Id="292" PostTypeId="1" CreationDate="2011-04-11T16:47:53.190" Score="19" ViewCount="349" Body="&lt;p&gt;Several StackExchange sites have support for mathematical formulae using MathJax (LaTeX syntax).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Many Code-Golf challenges are mathematical in nature. Equations come up very often in discussions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, I think it would be very useful to enable support for this on here as well?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test to see if it is enabled yet: $ \LaTeX $&lt;/p&gt;&#xA;" OwnerUserId="668" LastEditorUserId="66833" LastEditDate="2021-04-27T16:36:09.207" LastActivityDate="2021-04-27T16:36:09.207" Title="LaTeX/MathJax support would be nice?" Tags="|feature-request|status-completed|latex|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="293" PostTypeId="2" ParentId="286" CreationDate="2011-04-12T01:17:56.540" Score="3" Body="&lt;p&gt;Since the game is called golf, a sports for which I'm far to young, we could adopt their handicap scheme, or something similar. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, this is much work. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ideally, one would measure the last 10 golfs with many languages participating, and calculate the average for each language. Then you would sum the values up, and generate an inverse handicap from that. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;absolute:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Quizz golfscript Scala Java  avg &#xA;--------------------------------&#xA;1          50    150    250  150&#xA;2         300    400    500  400  &#xA;3          70    120    200  130&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;relative (inexact numbers)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;    Quizz golfscript Scala Java&#xA;   ------------------------------&#xA;    1         1/3      1    5/3  &#xA;    2         3/4      1    5/4  &#xA;    3         1/2      1    3/3  &#xA;---------------------------------&#xA;sum           19/12    3    47/12&#xA;/3  (about)    1/2     1     4/3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So every solution in CodeGolf would be multiplied by 2, every Solution in Java multiplied by 3/4. It would be a self correcting process. Only the best solution would always do it in the table. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It would be work, and not work best for new languages. These would always start at level 1. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;We would need a page at community wiki, to protocol the best solution per challenge and language, mostly in a form which would allow for automatic evaluation. The appropriate challenge would be to write a golf, which calculates the correct weights from the table of input, and produces a well readable output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Independently, people could vote up favorite solutions, and compare the absolute length of their code.&lt;/p&gt;&#xA;" OwnerUserId="373" LastActivityDate="2011-04-12T01:17:56.540" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="294" PostTypeId="2" ParentId="286" CreationDate="2011-04-12T20:47:58.793" Score="76" Body="&lt;p&gt;My first thought when I found this community was: &quot;there should be language handicaps based on the average number of machine code instructions executed per statement.&quot;  Can you tell I'm a C/asm guy? :D&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I did it for fun, in C, and &lt;em&gt;knew&lt;/em&gt; when I started that the interpreted languages were all going to win.  Who cares?  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's a fun comparison for you.  I provided a 675 char C solution to a problem.  I was thoroughly trounced by the same algorithm in Perl weighing in at just 137 chars.  I compiled mine to assembly, and ran the Perl solution through perlcc+gcc to get it into assembly, too.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The assembly output includes labels, but is roughly one line per instruction:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Lines of assembly for C solution: &lt;strong&gt;437&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Lines of assembly for Perl solution: &lt;strong&gt;7385&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;That doesn't include the standard libraries, which in the C solution is printf, and in Perl's case is the entire bytecode interpreter.  But at this layer, &lt;strong&gt;Perl is 1/5th the source code, and 16x the CPU instructions.&lt;/strong&gt;  Of course, the perlcc output is... &lt;em&gt;something&lt;/em&gt;.  Probably not exactly what the CPU executes, but at least representative.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But that's just the nature of the challenge.  We're comparing apples to avocados, and deciding the winner based on the number of seeds.  They're both still delicious.&lt;/p&gt;&#xA;" OwnerUserId="1262" LastEditorUserId="30688" LastEditDate="2016-03-03T02:10:33.320" LastActivityDate="2016-03-03T02:10:33.320" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="295" PostTypeId="2" ParentId="281" CreationDate="2011-04-13T04:01:39.450" Score="3" Body="&lt;ul&gt;&#xA;&lt;li&gt;If the question is 'sort a list', slow solutions are fine. &lt;/li&gt;&#xA;&lt;li&gt;If the question is 'sort this list of 1000 elements', and the PC seems to run forever, the poster has to make plausible, that he produced the solution with his program. &lt;/li&gt;&#xA;&lt;li&gt;I would prefer in general precise questions. But in general, performance isn't the issue, but code size is. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="373" LastActivityDate="2011-04-13T04:01:39.450" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="296" PostTypeId="1" AcceptedAnswerId="297" CreationDate="2011-04-14T06:56:20.433" Score="3" ViewCount="244" Body="&lt;p&gt;Would the &lt;a href=&quot;https://meta.stackexchange.com/questions/75466/disappeared-question-and-related-answers&quot;&gt;FizzBuzz question&lt;/a&gt; belong here?&lt;/p&gt;&#xA;" OwnerUserId="1277" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2016-04-30T16:11:45.927" Title="Would the &quot;What is your solution to the FizzBuzz problem&quot; question belong here?" Tags="|discussion|status-declined|scope|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="297" PostTypeId="2" ParentId="296" CreationDate="2011-04-14T07:27:33.040" Score="6" Body="&lt;p&gt;No, because there's no way to objectively judge a winner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is quite clearly covered in &lt;a href=&quot;https://codegolf.stackexchange.com/faq&quot;&gt;the faq&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;All questions on this site, whether a programming puzzle or a code golf, should have …&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;An objective primary winning criterion, so that it is possible to indisputably decide which entry should win.&lt;/li&gt;&#xA;  &lt;li&gt;A clear specification of what constitutes a correct submission. Test cases are highly encouraged.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'd also argue it's not even a contest, just another &quot;let's make an infinite list of X!&quot; type question, perhaps only (if you're lucky) limited by the number of different programming languages one could imagine or create.&lt;/p&gt;&#xA;" OwnerUserId="97" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2011-04-14T07:27:33.040" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="298" PostTypeId="1" CreationDate="2011-04-23T21:51:01.107" Score="25" ViewCount="1118" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;This Programming Push has ended &lt;em&gt;::sigh::&lt;/em&gt; But we may do another in a few weeks or months, and your high quality contributions are always welcome.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;&lt;strong&gt;&lt;em&gt;Whereas&lt;/em&gt;&lt;/strong&gt;&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The site has suffered from low traffic for weeks&lt;/li&gt;&#xA;&lt;li&gt;We've been in beta for 86 days and &lt;a href=&quot;http://area51.stackexchange.com/proposals/4570/code-golf-programming-puzzles&quot;&gt;our numbers are marginal&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Too many recent question have been both too easy and poorly specified&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/249/78&quot;&gt;Users are complaining&lt;/a&gt; of lack of motivation due to a low voting rate&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;we are seeking users willing to commit to improving the site.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Your mission&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.youtube.com/watch?v=5IXa2pNGVj8&quot; rel=&quot;nofollow noreferrer&quot;&gt;should you chose to accept it&lt;/a&gt;&amp;mdash;is&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;To write one (1) really &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/212/78&quot;&gt;good&lt;/a&gt; programming &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/93/78&quot;&gt;puzzle&lt;/a&gt; of any kind and post it to the site sometime in the next two (2) weeks.&lt;/li&gt;&#xA;&lt;li&gt;To answer at least two of these puzzles within one (1) week of their posting with a completely compliant, well written answer.&lt;/li&gt;&#xA;&lt;li&gt;To vote (up or down) on at least four (4) of these questions, and if voting down to truthfully and tactfully explain why.&lt;/li&gt;&#xA;&lt;li&gt;To vote (up or down) on at least eight (8) answers to these questions, and if voting down to truthfully and tactfully explain why.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;In addition to the existing &lt;a href=&quot;http://chat.stackexchange.com/rooms/307&quot;&gt;puzzle lab chat&lt;/a&gt; and the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/225/78&quot;&gt;meta sandbox for questions&lt;/a&gt;, the answers to this post can serve as a place for vetting proposed questions and coordinating activities related to &lt;strong&gt;The Push&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Per &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/877105#877105&quot;&gt;Joey's suggestion&lt;/a&gt;, puzzles submitted as part of this event may (should?) be marked &quot;1P5&quot; &lt;em&gt;if&lt;/em&gt; they have been discussed in the above places to insure high quality.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2011-05-27T01:36:08.213" Title="Announcing the CodeGolf.SE First Periodic Premier Programming Puzzle Push" Tags="|discussion|challenge-quality|site-health|puzzle-push|" AnswerCount="1" CommentCount="3" CommunityOwnedDate="2011-04-23T21:51:29.470" ContentLicense="CC BY-SA 3.0" />
  <row Id="299" PostTypeId="2" ParentId="286" CreationDate="2011-04-23T22:28:25.257" Score="2" Body="&lt;p&gt;Maybe there should be another site called &quot;challenges.SE.com&quot; or something, and have the non-golf questions slowly migrated over there?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I guess I have no right to complain since this site is obviously called &quot;codegolf.SE&quot;, but I for one joined hoping to see more interesting implementations than short ones.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The interesting-code-to-short-code ratio is too low to keep me interested.&lt;/p&gt;&#xA;" OwnerUserId="1382" LastActivityDate="2011-04-23T22:28:25.257" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="301" PostTypeId="2" ParentId="286" CreationDate="2011-04-26T05:24:11.907" Score="5" Body="&lt;p&gt;I think one of the problems here — as many have pointed out — is that brevity seems to be the most important criterion. That's probably because of the fact that the site's rules &lt;em&gt;demand&lt;/em&gt; some kind of objective criterion for getting the correct answer. Cleverness, reliability, and all of that other stuff aren't completely objective.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it would be better if there were multiple &quot;right answers&quot; based on language, e.g., shortest C# answer, shortest J answer, etc., but I realize that would require quite a change to the StackOverflow infrastructure, and so is probably not practical.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an aside, I think it's a testament to the natural readability of some languages that they aren't well suited to obfuscation and brevity. For instance, I know both REBOL and J, but am not about to answer any CodeGolf.SE questions using REBOL. In a way, I think that's a testament to one of REBOL's design goals. The same to a lesser extent is true of C#.&lt;/p&gt;&#xA;" OwnerUserId="1422" LastActivityDate="2011-04-26T05:24:11.907" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="302" PostTypeId="1" CreationDate="2011-04-26T18:16:54.103" Score="6" ViewCount="391" Body="&lt;p&gt;I'd like to suggest that to date we have missed a class (or maybe two) of programming puzzles.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ai-player&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ai-player&amp;#39;&quot; rel=&quot;tag&quot;&gt;ai-player&lt;/a&gt; would indicate a game played against a defined (but initially unknown) input or against a specified (but initially undisclosed) AI. The goal is to write the most successful program. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; would indicate a one-on-one game played in a round-robin all-against-all. The game would need to have well defined rules and scoring, and the goal would be to write a maximally competitive program. Existing example can be seen in iterated prisoners dilemma contests and &lt;a href=&quot;http://www.corewars.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;corewars&lt;/a&gt;. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/225/proposed-questions-sandbox/310#310&quot;&gt;Example on codegolf.SE.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Problem these face on codegolf.se: &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Keeping the game &lt;em&gt;simple&lt;/em&gt; enough without letting it be trivial&lt;/li&gt;&#xA;&lt;li&gt;Having &lt;em&gt;someone&lt;/em&gt; to run the heats&lt;/li&gt;&#xA;&lt;li&gt;Specifying the execution environment for the contestants&lt;/li&gt;&#xA;&lt;li&gt;In the case of the AI player problem, when to reveal the contest input, and what to do if it is either too hard or too easy&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Aside:&lt;/strong&gt; I realize that these may be harder to write and police than &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, but we have had a number of complaints that the site is too close to &lt;em&gt;all golf all the time&lt;/em&gt;. I hope to encourage enough diversity to maintain the interest of the people issuing those complaints, and to give them enough room to &lt;em&gt;offer&lt;/em&gt; some non-golf puzzles.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2011-05-03T19:03:25.460" Title="New contest type proposal." Tags="|discussion|policy|tags|rules|contest-type|" AnswerCount="5" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="303" PostTypeId="2" ParentId="298" CreationDate="2011-04-26T18:23:37.170" Score="4" Body="&lt;p&gt;Herein a list of vague ideas which anyone could try to develop into a proper puzzle.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; Implement the classic &quot;Animals&quot; question--answer game.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; Write a minimal implementation of &lt;code&gt;make (1)&lt;/code&gt; in which the only language construct accepted is &lt;code&gt;&amp;lt;target&amp;gt; &quot;:&quot; &amp;lt;dependency&amp;gt;* &quot;\n&quot; [&quot;\t&quot; &amp;lt;command&amp;gt; &quot;\n&quot;]*&lt;/code&gt; with the usual meaning (if any dependency is older than target run all the commands). No variable, no automatic rules, no anything except temporal dependencies. But it should sort out the dependency graph so that nothing is run out of order.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I've posted a suggestion for two new contest types: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ai-player&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ai-player&amp;#39;&quot; rel=&quot;tag&quot;&gt;ai-player&lt;/a&gt;. If these are accepted by the community here their very newness might provoke interest.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Polygon optimization. Input is a list of points. Output a grouping of those points into one or more closed (possibly convex) polygons such that [the perimeter is minimized|other condition]. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Constructive planar geometry. With axis-aligned rectangles as a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; or more generally as a longer challenge.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; Watersheds. Input is a height map and a test point. Output is indicative of which direction the rain went. You'll need some way of distinguishing &quot;oceans&quot; in the input. How to handle test points on ridges, saddles, and hilltops, and how to handle local minima?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Feel free to list additional ideas that seem promising, but you don't have the time to develop.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="78" LastEditDate="2011-04-26T21:06:40.227" LastActivityDate="2011-04-26T21:06:40.227" CommentCount="0" CommunityOwnedDate="2011-04-26T18:23:37.170" ContentLicense="CC BY-SA 3.0" />
  <row Id="305" PostTypeId="1" CreationDate="2011-04-27T02:24:01.353" Score="13" ViewCount="1248" Body="&lt;p&gt;The FAQ says (in part)&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;All questions on this site, whether a programming puzzle or a code golf, should have [... an] objective primary winning criterion, so that it is possible to indisputably decide which entry should win.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That was the criterion I used when closing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2224/obfuscation-of-dmesg-tail-base64-outfile-closed&quot;&gt;&quot;Obfuscation of $ dmesg | tail | base64 &gt; ~/outfile&quot;&lt;/a&gt; just the other day.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, there have been complaints that the site is mostly code-golf in part &lt;em&gt;because&lt;/em&gt; of the &quot;objective&quot; criteria. Now I see SHiNKiROU's effort &lt;a href=&quot;https://codegolf.stackexchange.com/q/2276/78&quot;&gt;Fake error message&lt;/a&gt; that comes with a serious and fairly comprehensive effort to put a firm grading scale under it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Other maybe subjective things floating around include&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Peter Of The Corn's recent &lt;a href=&quot;https://codegolf.stackexchange.com/q/2259/78&quot;&gt;Write Buggy Code&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Several &quot;speed&quot; contest, which seem slighlty troubling to me because I immediately think &lt;em&gt;&quot;Speed measured by whom on what hardware? And what if I write in a language they don't have?&quot;&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;FUZxxl's &lt;a href=&quot;https://codegolf.stackexchange.com/q/2027/78&quot;&gt;Implement a sorting algorithm with no change&lt;/a&gt; which seems to have no particular metric. (Which I not only left unclosed, but submitted and entry to. Oh! Fickle me!)&lt;/li&gt;&#xA;&lt;li&gt;The very well received &lt;a href=&quot;https://codegolf.stackexchange.com/q/1696/78&quot;&gt;What can you do in a 4k data URI?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;And others.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The question&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What meaning shall we use for &quot;objective&quot;? And why?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please help me know what I'm supposed to be doing here. And help the site get going too.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;See also &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/110/78&quot;&gt;A Modest Proposal: the [popularity-contest] tag&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1280&quot;&gt;Return to FAQ index&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="56656" LastEditDate="2020-02-03T17:42:29.453" LastActivityDate="2020-02-03T17:42:29.453" Title="What makes winning criteria &quot;objective&quot;?" Tags="|discussion|faq|winning-criteria|" AnswerCount="6" CommentCount="1" CommunityOwnedDate="2014-03-16T16:02:45.050" ContentLicense="CC BY-SA 3.0" />
  <row Id="306" PostTypeId="2" ParentId="305" CreationDate="2011-04-27T04:20:08.317" Score="3" Body="&lt;p&gt;Subjetivity is a hard subject, and it is a spectrum rather than a clear cut line between what is objective or not. This can certainly make it harder to decide what is appropriate for a programming puzzle here and what is not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Common sense is usually what arbitrates sort of thing. On the one hand, there are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2167/print-the-alphabet-four-times/2193#2193&quot;&gt;cheeky answers&lt;/a&gt; that technically fulfill the criteria of the question but are obviously not intended, but on the other hand, there are questions (like the one you used as an example) which have very unclear and subjective criteria. If an answer doesn't meet all of the criteria, allowances will often be made and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2170/add-up-the-letters-in-a-word/2222#2222&quot;&gt;nobody will object&lt;/a&gt; if the language is inherently difficult to do certain things in. All sorts little things just have no hard rules that will apply in all cases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In light of that, I think people should use their common sense in deciding if they should close a question or not. Think as a person trying to answer the question: are you confident that you understand the requirements of the problem that you could make an attempt at creating the program, and, if you were successful, that the asker will accept it as a legitimate answer? If you saw another answer, would you be able to assess it in comparison to your own and know which one would be accepted? If so, I think the problem has few problems with regard to subjective criteria. If not, if it is a little problem, you can comment and ask for clarification, or if it is a rather critical problem, you can vote to close.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If all of you people who, perhpas unlike me, have common sense, think that my Buggy Code question is unclear or too subjective to be able to ascertain which answers are &quot;better&quot;, by all means, close it.&lt;/p&gt;&#xA;" OwnerUserId="788" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2011-04-28T20:23:46.677" CommentCount="0" CommunityOwnedDate="2014-03-16T16:02:45.050" ContentLicense="CC BY-SA 3.0" />
  <row Id="308" PostTypeId="2" ParentId="305" CreationDate="2011-04-28T09:08:08.247" Score="13" Body="&lt;p&gt;I guess one thing that immediately comes to mind:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Could two different humans being judge the contest by the specified criteria and get close to the same results?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If &lt;em&gt;not&lt;/em&gt;, then the criteria is probably too subjective..&lt;/p&gt;&#xA;" OwnerUserId="97" LastActivityDate="2011-04-28T09:08:08.247" CommentCount="1" CommunityOwnedDate="2014-03-16T16:02:45.050" ContentLicense="CC BY-SA 3.0" />
  <row Id="309" PostTypeId="2" ParentId="305" CreationDate="2011-04-28T16:01:12.627" Score="13" Body="&lt;p&gt;I do not propose a solution to this problem of how to handle subjective questions, but I would like to add another dimension to the discussion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As much as we like getting that coveted green arrow signifying our prowess at some task in some language, I don't think it should be a necessary component of every task posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Programming challenges and puzzles are, by their nature, supposed to be fun and entertaining to develop &lt;em&gt;and&lt;/em&gt; share. Does every task require an accepted answer?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I realize we are working within the SE Q&amp;amp;A framework here, which uses percentage-of-questions-answered as a metric for determining the health of a SE, so maybe we are bound to accept an answer on all questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even still, my main point is that the majority of the pleasure and satisfaction we derive from these puzzles is in the brainstorming, implementation, tweaking of the solution, and then the sharing and discussion (and upvotes!) that occur after. A green checkmark makes all that better, to be sure, but is it necessary for &lt;em&gt;every&lt;/em&gt; task?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Edit&lt;/em&gt;: I'm not advocating leaving every question open, much to the contrary some questions should be closed for vagueness, ill-defined goals, poorly written, etc. The dmesg obfuscation task comes to mind here.&lt;/p&gt;&#xA;" OwnerUserId="1375" LastActivityDate="2011-04-28T16:01:12.627" CommentCount="0" CommunityOwnedDate="2014-03-16T16:02:45.050" ContentLicense="CC BY-SA 3.0" />
  <row Id="311" PostTypeId="2" ParentId="302" CreationDate="2011-04-29T01:02:03.403" Score="6" Body="&lt;p&gt;Write-up for a possible &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/225/proposed-questions-sandbox/310#310&quot;&gt;Iterated Prisoner's Dilemma&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2011-04-29T01:02:03.403" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="312" PostTypeId="2" ParentId="97" CreationDate="2011-04-29T05:16:26.770" Score="1" Body="&lt;p&gt;I'd like syntax highlighting. Here's my idea:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We could use:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;meta language=&quot;C++&quot; /&amp;gt;&#xA;&#xA;Here's some code:&#xA;&#xA;    #include &amp;lt;iostream&amp;gt;&#xA;&#xA;    int main()&#xA;    {&#xA;        std::cout &amp;lt;&amp;lt; &quot;Skynet imported for the 42nd time.&quot;;&#xA;        return(0);&#xA;    }&#xA;&#xA;As you can see, it pretty much sucks.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or something similar to distinguish between languages. It reverts to guessing if &lt;code&gt;&amp;lt;meta language=&quot;C++&quot; /&amp;gt;&lt;/code&gt; isn't specified.&lt;/p&gt;&#xA;" OwnerUserId="761" LastEditorUserId="761" LastEditDate="2011-04-29T05:50:01.457" LastActivityDate="2011-04-29T05:50:01.457" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="314" PostTypeId="2" ParentId="88" CreationDate="2011-05-01T13:06:02.170" Score="16" Body="&lt;p&gt;I don't see how not knowing GolfScript for golf is like trying to read Japanese without knowing Kanji. It's more like trying to street race in a Civic while someone else had the audacity to participate in an F1 car.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;No, I doubt there's any explicit rule saying you can't street race in an F1, but you wouldn't be impressing anyone regarding anything other than the fact that you know how to pilot an F1 car. There'll be an implicit handicap regardless of the official winner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How interesting each answer is in relation to other ones should probably be something that the audience has to decide on a per-question basis, but they should keep in mind that answers should be compared amongst answers written in similar languages as far as brevity and idiomatic features goes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't see any point in banning GS, but I also see no point in up-voting GS answers. Piloting an F1 isn't part of anyone's &quot;street racing 101&quot; course.&lt;/p&gt;&#xA;" OwnerUserId="1382" LastActivityDate="2011-05-01T13:06:02.170" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="315" PostTypeId="2" ParentId="302" CreationDate="2011-05-01T22:45:56.510" Score="2" Body="&lt;p&gt;Possible &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; idea: &lt;a href=&quot;http://en.wikipedia.org/wiki/Rock-paper-scissors&quot; rel=&quot;nofollow noreferrer&quot;&gt;Roshambo&lt;/a&gt; tournament.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It would be of similar format to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/225/proposed-questions-sandbox/310#310&quot;&gt;IPD&lt;/a&gt;. Given that similarity, I'll keep it on the backburner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After doing a little research, I question whether this would be actually be fun. Predictive roshambo strategies are very complicated.&lt;/p&gt;&#xA;" OwnerUserId="1375" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2011-05-01T23:05:32.700" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="316" PostTypeId="2" ParentId="302" CreationDate="2011-05-02T00:36:35.343" Score="1" Body="&lt;p&gt;Possible &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ai-player&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ai-player&amp;#39;&quot; rel=&quot;tag&quot;&gt;ai-player&lt;/a&gt; competition.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The &lt;a href=&quot;http://en.wikipedia.org/wiki/Black_Box_(game)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Black Box&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Give the link a quick read, it explains the game very well. (TBD: short summary of the game)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This would work on CG.SE as follows.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There would be two components.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The judge's Black Box program &lt;/li&gt;&#xA;&lt;li&gt;Player submitted Seeker programs&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Seeker programs would communicate in an interactive fashion with the Black Box program via stdout/in. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Black Box will call the seeker program (similar to the IPD scorer) and then enter the following loop:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The Seeker will designate which border cell to shine a ray into.&lt;/li&gt;&#xA;&lt;li&gt;The Black Box will respond with the appropriate response result&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Hit, Reflection, Detour, or Miss and the grid cell&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The Seeker will indicate it is ready to solve the puzzle OR indicate it is ready for another iteration.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the Seeker is ready to solve, it will output the deduced location of the atoms and the game ends.&lt;/li&gt;&#xA;&lt;li&gt;If it is not ready, this process loops.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The game ends when the Seeker gives its best guess at the location of the atoms or some iteration threshold is reached (to prevent infinite loops).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One iteration is defined as one ray shining and response from the Black Box.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Only Seekers that successfully deduce the location of the atoms are considered in scoring. They are ordered according to the fewest number of iterations. The program that has the lowest score wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Possible Variations&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Varying the grid size&lt;/li&gt;&#xA;&lt;li&gt;Varying number of atoms&lt;/li&gt;&#xA;&lt;li&gt;Using 'mirrors' or 'prisms' instead of atoms (affects reflection, hit rules)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Obviously there are a details that need to be determined, such as I/O formats. Before we get to that though I'd like some comments on the idea in general.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I haven't given much thought to how to create an effective seeker, but since this game is similar to the game &lt;a href=&quot;http://en.wikipedia.org/wiki/Mastermind_%28board_game%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;Mastermind&lt;/a&gt; which has been &lt;a href=&quot;http://en.wikipedia.org/wiki/Mastermind_%28board_game%29#Mastermind_satisfiability_problem&quot; rel=&quot;nofollow noreferrer&quot;&gt;proven to be NP-Complet&lt;/a&gt;e, I wonder if it is to challenging/hard of a problem for CG.SE? As far as I know (via a 2 min Google search), this is an unstudied problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some other considerations are how to facilitate testing, accept submissions, etc. Should the Black Box judge be freely available from the beginning? If not how else could testing be done? If so, is this really an AI game? (does it matter?) &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="1375" LastActivityDate="2011-05-02T00:36:35.343" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="318" PostTypeId="1" CreationDate="2011-05-02T13:11:08.243" Score="9" ViewCount="567" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78/dmckee&quot;&gt;dmckee&lt;/a&gt; has recently &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/298/announcing-the-codegolf-se-first-periodic-premier-programming-puzzle-push&quot;&gt;started the &quot;1P5&quot;&lt;/a&gt; to improve the quality of posts, the quantity of (good!) posts, and the motivation of users on this site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We (Stack Exchange Inc.) think that this is a really great initiative, and we want to support it by offering a reward: We'd like to give and iPad 2 to a user who goes through great lengths to make codegolf.se more awesome™.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question that remains is: &lt;em&gt;Who should get it?&lt;/em&gt; How do we decide who deserves this prize?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should it go to a great puzzle? A great solution? A consistenly great puzzle maker? A consistently great solver? A combination of those?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We need your help to decide this. We really want to encourage great puzzles and awesome answers, and you, the regular users of the site, are in the best position to tell us who would deserve it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Go ahead and offer your thoughts!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Update: We've decided that while (as everyone noticed) coming up with clear hard rules is pretty hard, by &lt;em&gt;many&lt;/em&gt; metrics &lt;a href=&quot;https://codegolf.stackexchange.com/users/67/keith-randall&quot;&gt;Keith Randall&lt;/a&gt; has done a great deal for the site, so we've picked him. Expect an email, Keith :)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And (somewhat of a second price) as a thank you to George Edison for essentially creating a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/170/code-golf-userscript-to-help-in-navigating-the-site-v0-37-now-available&quot;&gt;plugin that caters to the specialty of this site&lt;/a&gt;, we'll send him on a shopping spree in the Stack Exchange swag store.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thanks, you two, and everyone else!&lt;/p&gt;&#xA;" OwnerUserId="160" LastEditorUserId="68942" LastEditDate="2021-04-25T20:43:09.787" LastActivityDate="2021-04-25T20:43:09.787" Title="Help us come up with rules who should be rewarded with an iPad2 for making the site great" Tags="|discussion|status-completed|challenge-quality|incentives|" AnswerCount="4" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="319" PostTypeId="2" ParentId="318" CreationDate="2011-05-02T21:44:57.210" Score="16" Body="&lt;p&gt;My opinion is that we should reward questions, not answers.  It is much harder to come up with a good question than a good answer.  And it seems to me that we don't need to encourage people to answer more questions (we have plenty of answers), we need more questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's a strawman: # of questions in &amp;lt;time period&amp;gt; with 10+ votes or 5+ answers.  Discuss...&lt;/p&gt;&#xA;" OwnerUserId="67" LastActivityDate="2011-05-02T21:44:57.210" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="320" PostTypeId="1" AcceptedAnswerId="322" CreationDate="2011-05-02T23:46:22.477" Score="1" ViewCount="235" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Possible Duplicate:&lt;/strong&gt;&lt;br&gt;&#xA;  &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/167/line-break-formats-and-character-numbers&quot;&gt;Line break formats and character numbers&lt;/a&gt;  &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&#xA;&#xA;&lt;p&gt;Do we count newlines in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;? I know newlines are almost redundant in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, but imagine it's a language requirement.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How many characters does a newline take? &lt;code&gt;CRLF&lt;/code&gt; (&lt;code&gt;2&lt;/code&gt;) like in Windows? Or simply &lt;code&gt;LF&lt;/code&gt; (&lt;code&gt;1&lt;/code&gt;)?&lt;/p&gt;&#xA;" OwnerUserId="761" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2011-05-03T01:11:50.623" Title="Counting Newlines" Tags="|discussion|code-golf|whitespace|" AnswerCount="2" CommentCount="1" ClosedDate="2011-05-05T16:31:39.363" ContentLicense="CC BY-SA 3.0" />
  <row Id="321" PostTypeId="2" ParentId="320" CreationDate="2011-05-02T23:49:53.173" Score="1" Body="&lt;p&gt;In some languages they work just like whitespace, so you could replace all the spaces with newlines. As far as I know they are usually counted&lt;/p&gt;&#xA;" OwnerUserId="95" LastActivityDate="2011-05-02T23:49:53.173" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="322" PostTypeId="2" ParentId="320" CreationDate="2011-05-03T01:06:33.827" Score="5" Body="&lt;p&gt;If it's a language requirement, then see if your language allows bare LFs. If so, it's one byte. If your language requires CRLF (I think batch files do? Haven't checked), then you have to include both.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Remember, the principle is that you have to make the smallest &lt;em&gt;valid&lt;/em&gt; program that does the task. The same principle governs how much whitespace needs to be counted: as little whitespace as is required to make the program valid and behave according to spec.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Some people make bogus rules like &quot;whitespace characters don't count towards the code size&quot;; for such contests, any submission in &lt;a href=&quot;http://en.wikipedia.org/wiki/Whitespace_%28programming_language%29&quot; rel=&quot;nofollow&quot;&gt;Whitespace&lt;/a&gt; is guaranteed to be shortest.)&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="3" LastEditDate="2011-05-03T01:11:50.623" LastActivityDate="2011-05-03T01:11:50.623" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="323" PostTypeId="2" ParentId="302" CreationDate="2011-05-03T17:09:30.393" Score="1" Body="&lt;h2&gt;Reversi&lt;/h2&gt;&#xA;&lt;p&gt;To those who don't know it: &lt;a href=&quot;http://en.wikipedia.org/wiki/Reversi&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia entry&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This was a task for first-term students at our university a few years ago (I was responsible for grading the players).&lt;/p&gt;&#xA;&lt;p&gt;Something that proved to be quite complex there was detecting end-game positions, avoiding illegal moves and in general adhering to the interface specification. Since the programs were piped into each other this created some situations where they would simply become stuck.&lt;/p&gt;&#xA;&lt;p&gt;I guess if we want to do this here we'd need a game master that is responsible for maintaining the game state and simplify the protocol as much as possible (I'm not sure whether the players should be left running or simply can parse the game state on each turn. The latter might work as well and maybe better than with the CIPD).&lt;/p&gt;&#xA;" OwnerUserId="15" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2011-05-03T17:09:30.393" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="324" PostTypeId="2" ParentId="302" CreationDate="2011-05-03T19:03:25.460" Score="1" Body="&lt;h2&gt;PID tuner&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A possible &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ai-player&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ai-player&amp;#39;&quot; rel=&quot;tag&quot;&gt;ai-player&lt;/a&gt; challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A unreasonably large fraction of problems in control theory can be addressed with a simple &lt;a href=&quot;http://en.wikipedia.org/wiki/PID_controller&quot; rel=&quot;nofollow noreferrer&quot;&gt;PID controller&lt;/a&gt;. Well, they can &lt;em&gt;if&lt;/em&gt; the thing is properly tuned, which is harder than it looks.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge would provide an interface to driver for connecting the entrant to (in principle unknown) system which should be manageable with a properly tuned PID. The metric for success would be getting the output of the system to remain within a prescribed tolerance for fixed period of time, and determining when this condition was met would also be a function of the driver.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Several &quot;test&quot; systems would included so that entrants could check that they understand the interface and that their contribution works with it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At some point the author would run entrants against the &quot;official&quot; black-box system and declare the winner.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2011-05-03T19:03:25.460" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="326" PostTypeId="1" CreationDate="2011-05-05T02:14:38.440" Score="5" ViewCount="155" Body="&lt;p&gt;Recently, I started seeing over half of the questions on the site highlighted in blue.  Later, I noticed that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; appeared under my &quot;Frequented Tags&quot;.  &lt;a href=&quot;https://meta.stackexchange.com/questions/72587/why-is-stack-overflow-suddenly-orange&quot;&gt;Frequented Tags&lt;/a&gt; is a feature of the site where it decides what questions are interesting to you based on your viewing habits.  Apparently, I'm interested in code golf!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a workaround, I added &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/dummy&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;dummy&amp;#39;&quot; rel=&quot;tag&quot;&gt;dummy&lt;/a&gt; to my favorite tags.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My feature request is for an exception to be made for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and maybe &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;.  In general, tags that apply to over (perhaps) 1/3 of all questions on the site should be excluded from &quot;Frequented Tags&quot;.  Otherwise, the highlighting becomes nothing but noise.&lt;/p&gt;&#xA;" OwnerUserId="38" LastEditorUserId="68942" LastEditDate="2021-06-09T05:34:37.923" LastActivityDate="2021-06-09T05:34:37.923" Title="Exclude code-golf and code-challenge from &quot;Frequented Tags&quot;" Tags="|feature-request|status-declined|tags|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="327" PostTypeId="2" ParentId="326" CreationDate="2011-05-05T02:30:25.243" Score="2" Body="&lt;p&gt;This logic simply looks at the tags you frequent.  You're asking for a tag to exist, but not exist.  The tag is either on the site, or it gets removed/blocked.  Can't have it both ways.  If the tag is valid on questions, it should be valid as a favorite tag.  Additionally, there are people that follow this tag voluntarily, so we can't just say &quot;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is not allowed to be a favorite tag&quot;.&lt;/p&gt;&#xA;" OwnerUserId="24" LastActivityDate="2011-05-05T02:30:25.243" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="328" PostTypeId="2" ParentId="255" CreationDate="2011-05-07T03:10:59.110" Score="-1" Body="&lt;p&gt;My definition of easy: algorithms that run in O(1) (assuming hardware numbers, where there is a upper bound of running time of parallel hardware arithmetic operations), which means most of the O(1) number problems have a trivial or non-trivial formula to solve it, and the puzzle creator allows them to do so.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, not everyone are good at math and will find O(1) solutions for all sequence and series problems (e.g. geometric series).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, implementing arithmetic and other numerical operations in esolangs or from scratch are reasonably challenging.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/2487/find-sum-of-odd-numbers&quot;&gt;Find sum of odd numbers&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="110" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2011-05-07T03:10:59.110" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="329" PostTypeId="2" ParentId="305" CreationDate="2011-05-07T03:19:36.573" Score="-1" Body="&lt;p&gt;The simplest grading method is to find the post with most upvotes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One factor that affects subjectivity is the language design, for example, the &quot;what is considered a change in variable&quot; problem arises when you are dealing with Haskell and Prolog. Also, all RPN languages can be disqualified for manipulating the stack, which changes variable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the &quot;most creative solution&quot;, common sense only weed out the obvious &quot;dull&quot; answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I thunk the most subjective questions will involve visual art.&lt;/p&gt;&#xA;" OwnerUserId="110" LastActivityDate="2011-05-07T03:19:36.573" CommentCount="0" CommunityOwnedDate="2014-03-16T16:02:45.050" ContentLicense="CC BY-SA 3.0" />
  <row Id="330" PostTypeId="2" ParentId="255" CreationDate="2011-05-07T06:55:07.513" Score="6" Body="&lt;p&gt;I don't &lt;em&gt;necessarily&lt;/em&gt; object against easy tasks. Basically, an easy one can allow you to take a break from your hard golfing life and doodle something for fun which doesn't need the same amount of work like a harder or more complex task.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That being said, I &lt;em&gt;do&lt;/em&gt; believe that too many too easy tasks are not particularly helpful. If people come to the site and see 25 different tasks, all just taken from 5th grade math text books, then something is wrong, I guess.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once in a while that can be entertaining, but not multiple times a day. If the only challenge or puzzle to such a task is how short you can write the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2487/find-sum-of-odd-numbers&quot;&gt;invocation of a formula&lt;/a&gt; or a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2469/most-optimized-algorithm-for-incrementing-squares&quot;&gt;single loop&lt;/a&gt; then those things aren't particularly interesting (to me at least). They also belong in a different category. Those aren't »easy«, they are »trivial«.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That being said, I'd rather not have &lt;em&gt;every&lt;/em&gt; task on this site at the complexity level of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/586/robot-finds-kitten&quot;&gt;Robot Finds Kitten&lt;/a&gt;. Even less so at the level of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1118/implement-pcre-in-your-language&quot;&gt;Implement PCRE in your language&lt;/a&gt;. The latter task is probably a mistake, though.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I will happily vote down tasks I consider trivial, boring or otherwise uninteresting. That's what votes are for in my opinion: To give feedback to the person posting the task whether it's received well or not.&lt;/strong&gt; Votes are my &lt;em&gt;own&lt;/em&gt; opinion and do not need to match others'. Sometimes, they do, though.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/940898#940898&quot;&gt;Someone might (correctly) note that I have answered a few of those I have downvoted&lt;/a&gt; as well. That's mostly boredom. Spending a minute of cobbling together &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1034/reinvent-the-for-loop/1068#1068&quot;&gt;a protest answer&lt;/a&gt; doesn't exactly hurt me, regardless of how I think of the task. &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/941761#941761&quot;&gt;&lt;strong&gt;I don't consider the number of answers to a question a criterion of quality.&lt;/strong&gt;&lt;/a&gt; Trivial tasks encourage many, many answers that can be churned out in a short time. That doesn't make them &lt;em&gt;good&lt;/em&gt; tasks and I hope people who write those tasks &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/941430#941430&quot;&gt;will not see the number of answers as encouragement to write more of them&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another thing to note: Not every task that &lt;em&gt;looks&lt;/em&gt; simple is it, necessarily. One seemingly simple task I actually enjoyed was &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1255/hitting-495-kaprekar&quot;&gt;Hitting 495 (Kaprekar)&lt;/a&gt;. It calls for a relatively simple algorithm, probably a special case and some math. At least that's what they &lt;em&gt;want&lt;/em&gt; you to think. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1255/hitting-495-kaprekar/1257#1257&quot;&gt;J B&lt;/a&gt; came up with a wonderful answer that just stops at a fixed point for the algorithm and emits the number of steps until that happens; no special case, no embedded constant for 495 – very elegant. And I noticed when building my complete set of test cases that the number of steps &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1255/hitting-495-kaprekar/1267#1267&quot;&gt;depends on the first and last digits of the input number&lt;/a&gt;, nothing more, negating the need for actually executing the algorithm.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Such examples are rare, though. Not every simple task will have that much hidden complexity. Perhaps having different ways to solve a task is a criterion whether a simple task &lt;em&gt;could&lt;/em&gt; be entertaining and have unexpected solutions. Not entirely sure of that, though. And I &lt;em&gt;am&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/430/drawing-a-gradient-in-ascii-art&quot;&gt;guilty&lt;/a&gt; of posting &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1720/finding-maximum-paths&quot;&gt;tasks&lt;/a&gt; with a predefined idea how they are to solve as well. It is easier sometimes. Not necessarily better.&lt;/p&gt;&#xA;" OwnerUserId="15" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2011-05-22T18:23:21.063" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="331" PostTypeId="2" ParentId="2140" CreationDate="2011-05-09T10:27:55.240" Score="5" Body="&lt;h3&gt;Table parser, code golf&lt;/h3&gt;&#xA;&lt;p&gt;Input&lt;/p&gt;&#xA;&lt;pre&gt;|===========|=============|==============|&#xA;|Left align |  &lt;b&gt;Right align&lt;/b&gt;| Center align |&#xA;|===========|=============|==============|&#xA;|This       |         This|     This     |&#xA;|-----------|-------------|--------------|&#xA;|                column                  |&#xA;|-----------|-------------|--------------|&#xA;|will       |                            |&#xA;|-----------|          will be           |&#xA;|be         |                            |&#xA;|-----------|-------------|--------------|&#xA;|left       |        right|    center    |&#xA;|-----------|-------------|--------------|&#xA;|aligned    |      aligned|   aligned    |&#xA;|-----------|-------------|--------------|&#xA;|and can be |    vertical-|              |&#xA;|multilined | align middle|  as default but a bit long line |&#xA;|with &amp;lt;br&gt;  |             |              |&#xA;|-----------|-------------|--------------|&lt;/pre&gt;&#xA;&lt;p&gt;Output should be valid HTML. And I am thinking of following requirement specs.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;alignments (left, right, middle)&lt;/li&gt;&#xA;&lt;li&gt;border thickness (normal -, |, bold, =,||)&lt;/li&gt;&#xA;&lt;li&gt;with table headers or without&lt;/li&gt;&#xA;&lt;li&gt;rowspans, colspans&lt;/li&gt;&#xA;&lt;li&gt;multiline &amp;amp; vertical-align is always middle&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;What do you think?&lt;/p&gt;&#xA;" OwnerUserId="132" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-09T15:36:27.083" CommentCount="18" ContentLicense="CC BY-SA 3.0" />
  <row Id="332" PostTypeId="2" ParentId="318" CreationDate="2011-05-09T21:04:13.673" Score="4" Body="&lt;p&gt;I agree with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/318/help-us-come-up-with-rules-who-should-be-rewarded-with-an-ipad2-for-making-the-si/319#319&quot;&gt;Keith that questions are usually harder than answers&lt;/a&gt;, though we've seen some truly awesome answers (&lt;a href=&quot;https://stackoverflow.com/questions/1352587/code-golf-morse-code/1355594#1355594&quot;&gt;mostly&lt;/a&gt; on &lt;a href=&quot;https://stackoverflow.com/questions/891643/twitter-image-encoding-challenge/929360#929360&quot;&gt;Stack&lt;/a&gt; Overflow so far, but I trust the CodeGolf.SE will see some in time).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't have a favorite candidate for the prize at this time. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I've thought of a metric that allows some weight for really good answers.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;net votes on questions&amp;gt; + &#xA;&amp;lt;number of answers to the poster's questions over *threshold* votes&amp;gt; + //stolen from Keith&#xA;&amp;lt;votes on answers *exceeding* the votes for that question&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;evaluated over some time period.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2011-05-11T02:46:48.630" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="334" PostTypeId="2" ParentId="318" CreationDate="2011-05-12T20:16:11.463" Score="16" Body="&lt;h2&gt;Throw it away.&lt;/h2&gt;&#xA;&lt;p&gt;I don't feel good about prizes at all. Maybe two or three persons spend much effort in their questions and answers.&lt;/p&gt;&#xA;&lt;p&gt;Now maybe my up- or down-vote decides who gets a prize? I don't want too serious discussions why I upvoted here and not there, why I was careful on Monday, critic on Tuesday, generous on Wednesday and so on.&lt;/p&gt;&#xA;&lt;p&gt;I thought this is a site for fun and entertainment. Expensive prizes can be a serious threat and poison the atmosphere.&lt;/p&gt;&#xA;&lt;p&gt;I hope I'm wrong, and I appreciate the attempt to improve the site.&lt;/p&gt;&#xA;" OwnerUserId="373" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2011-05-12T20:23:27.563" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="335" PostTypeId="2" ParentId="318" CreationDate="2011-05-12T22:28:16.170" Score="5" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&quot;... who goes through great lengths to make codegolf.se more awesome™.&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I have put a lot of effort and work into making a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/170/code-golf-userscript-to-help-in-navigating-the-site-v0-37-now-available&quot;&gt;UserScript that makes it much easier to navigate the site&lt;/a&gt;. The UserScript does a number of things:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Lists the size (in bytes) of each entry.&lt;/li&gt;&#xA;&lt;li&gt;Identifies the language used for the entry.&lt;/li&gt;&#xA;&lt;li&gt;In some cases, offers the option to run the code via &lt;a href=&quot;http://codepad.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;CodePad&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Adds a new sorting option for entries&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;for &lt;code&gt;[code-golf]&lt;/code&gt; questions, the option to sort by smallest entry&lt;/li&gt;&#xA;&lt;li&gt;for &lt;code&gt;[code-bowling]&lt;/code&gt; questions, the option to sort by largest entry&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Lists the current winner at the top of the question.&lt;/li&gt;&#xA;&lt;li&gt;Adds a preferences menu to the top of the page with a few options.&lt;/li&gt;&#xA;&lt;li&gt;Adds syntax highlighting to all code.&lt;/li&gt;&#xA;&lt;li&gt;Automatically checks for updates and notifies you when one is available.&lt;/li&gt;&#xA;&lt;li&gt;Adds the option to try out a new experimental &quot;theme&quot; for the site using injected JS and CSS.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="362" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2011-05-12T22:28:16.170" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="337" PostTypeId="2" ParentId="2140" CreationDate="2011-05-19T01:05:22.207" Score="5" Body="&lt;p&gt;I attempted a problem I threw out as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/298/announcing-the-codegolf-se-first-periodic-premier-programming-puzzle-push/303#303&quot;&gt;a suggested&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; for 1p5. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In c, lex and yacc I needed more than 9600 characters ungolfed (fully commented, errors handled, some debugging code left in place, but some efficiency sacrificed in the name of shorter code), which seems pretty long, but c is about the most pessimal language you could choose for this problem except fortran 77 or something from the Turing Tarpit. The reference implementation can run its own build, which has some of that bootstrapping voodoo.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;None-the-less, this is a relatively big project, and I don't want to post it unless people feel it is both well specified and interesting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As yet there is no validation script, and I am not sure how one could be written as the acceptable output order could be post-order depth first or post-order breadth first and there is a left-first vs. right-first ambiguity on both. What a bother.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Aside: I'm quite proud of the lex and yacc part of my code, as I consider it spiffy.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;A minimal implementation of the make (1) utility.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;By minimal I mean, &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No built in rules, and no pattern or suffix rules.&lt;/li&gt;&#xA;&lt;li&gt;No variables and therefore no variable assignment or&#xA;manipulations; also no variable expansion which includes no&#xA;expansion of environment variables.&lt;/li&gt;&#xA;&lt;li&gt;No automatic variables like $&amp;lt; and $@.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This only leaves constructs (called rules) of the form&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;target&amp;gt; &quot;:&quot; &amp;lt;prerequisite&amp;gt;* &quot;\n&quot; [&quot;\t&quot; &amp;lt;action&amp;gt; &quot;\n&quot;]*&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where each &lt;code&gt;&amp;lt;target&amp;gt;&lt;/code&gt; and &lt;code&gt;&amp;lt;prerequisite&amp;gt;&lt;/code&gt; is a whitespace delimited&#xA;string which &lt;em&gt;may&lt;/em&gt; (or may not) represent a filename. Empty lines&#xA;have no effect and &quot;#&quot; marks the beginning of a end of&#xA;line comment (the sequence &quot;#[^\n]*\n&quot; should be treated as &quot;\n&quot;&#xA;so it does not interfere with rules; this has the side effect of&#xA;making &quot;#&quot; illegal in targets, prerequisites and actions). Colons&#xA;are prohibited in identifiers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program should take its input from the standard input or by&#xA;reading a file called &quot;makefile&quot; - implementer's choice. The program then attempts to&#xA;&quot;build&quot; every target named on the command line. Any targets&#xA;specified on the command line which do not appear in the makefile&#xA;and do not represent an existing file should generate an error and cause the program to exit&#xA;before execution of any rules. In the event that no target is&#xA;named on the command line, default to building the first target&#xA;in the input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Duplicate targets &lt;em&gt;may&lt;/em&gt; (not must!) be treated as an error.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A target is deemed already built if&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It names an existing file and&lt;/li&gt;&#xA;&lt;li&gt;All its prerequisites are fulfilled&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Otherwise it is built by&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Building all unfulfilled prerequisites then&lt;/li&gt;&#xA;&lt;li&gt;Running each &lt;code&gt;&amp;lt;action&amp;gt;&lt;/code&gt; sequentially in the order they appear in the input, &#xA;  and if the action returns an exceptional exit state, stopping the program.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;A prerequisite is deemed fulfilled if&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The prerequisite represents an existing file and&lt;/li&gt;&#xA;&lt;li&gt;The prerequisite is built and&lt;/li&gt;&#xA;&lt;li&gt;The target is &quot;newer&quot; than the (fully built) prerequisite&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;A target is deemed &quot;older&quot; (i.e. not &quot;newer&quot;) than its prerequisite if one of&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Both represent files and the prerequisite has been&#xA;   modified more recently than the target.  &lt;/li&gt;&#xA;&lt;li&gt;The target does not represent an existing file, and the&#xA;   prerequisite does.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;apply.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Authors on systems which do not support fork/exec semantics may&#xA;write a batch file or script which is invoked as the program&#xA;terminates, but that script &lt;em&gt;must&lt;/em&gt; stop on the first&#xA;unsuccessful action.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sample Input&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# Babymake compatible makefile for babymake&#xA;all:babymake&#xA;&#xA;babymake : lex.yy.o  y.tab.o  babymake.o &#xA;    cc -o babymake lex.yy.o y.tab.o babymake.o&#xA;&#xA;babymake.o : babymake.c babymake.h&#xA;    cc -c babymake.c&#xA;&#xA;lex.yy.o: lex.yy.c y.tab.h&#xA;    cc -c lex.yy.c&#xA;&#xA;lex.yy.c : babymake.l&#xA;    lex babymake.l&#xA;&#xA;y.tab.o: y.tab.c babymake.h&#xA;    cc -c y.tab.c&#xA;&#xA;y.tab.c : babymake.y  &#xA;    yacc -d babymake.y&#xA;&#xA;clean:&#xA;    rm -f babymake.o  lex.yy.o  y.tab.o&#xA;&#xA;cleaner: clean # just testing end of line comments&#xA;    rm -f y.tab.c y.tab.h&#xA;    rm -f lex.yy.c&#xA;&#xA;bogus: boguser &#xA;    echo &quot;building bogus&quot; # test in another context&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Sample output&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$ ./babymake &amp;lt; babymake.example cleaner&#xA; rm -f babymake.o  lex.yy.o  y.tab.o&#xA; rm -f y.tab.c y.tab.h&#xA; rm -f lex.yy.c&#xA;$ ./babymake &amp;lt; babymake.example all    &#xA; cc -c babymake.c&#xA; yacc -d babymake.y&#xA; cc -c y.tab.c&#xA; lex babymake.l&#xA; cc -c lex.yy.c&#xA; cc -o babymake lex.yy.o y.tab.o babymake.o&#xA;$ ./babymake &amp;lt; babymake.example    &#xA;$ ./babymake &amp;lt; babymake.example bogus&#xA;ERRNO: 2: No such file or directory No rule to make target 'boguser'.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2011-05-21T20:58:55.973" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="338" PostTypeId="1" CreationDate="2011-05-20T01:31:00.353" Score="5" ViewCount="383" Body="&lt;p&gt;Can I define some new languages, to be used in future code golfs? For example, CG-VB.NET would be a language which is equivalent to itself as VB.NET code, but wrapped in:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Module X&#xA;Sub Main&#xA;'CG-VB.NET code is put here&#xA;End Sub&#xA;End Module&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And the same for several other languages such as C# and Java? What would I have to do to make it a real language? Is the definition here sufficient, or do I need to create a compiler? Formal definition?&lt;/p&gt;&#xA;" OwnerUserId="1324" LastActivityDate="2015-07-25T10:13:13.727" Title="Define new languages?" Tags="|discussion|code-golf|handicap|" AnswerCount="4" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="339" PostTypeId="2" ParentId="338" CreationDate="2011-05-20T01:38:46.213" Score="4" Body="&lt;p&gt;We haven't really discussed the role and application of pre-processors (which is how I would characterize your suggested “language”).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But lets look at some near misses:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The C pre-processor is often used to reduce the wordiness of C and C++ entries, and can sometimes be put to even more clever use.&lt;/li&gt;&#xA;&lt;li&gt;GolfScript falls back on ruby.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78" LastEditorUserId="15" LastEditDate="2011-05-20T15:29:24.373" LastActivityDate="2011-05-20T15:29:24.373" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="340" PostTypeId="2" ParentId="338" CreationDate="2011-05-20T07:50:24.940" Score="6" Body="&lt;p&gt;In my humble opinion, such &quot;new languages&quot; are pointless; it's just another way to propose &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/185/language-handicap&quot;&gt;language handicap&lt;/a&gt;. The reason I say it's pointless is that it's not just the boilerplate that dooms languages like C# and Java for golfing purposes; they are just naturally verbose languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given any Java or C# solution (even after stripping off boilerplate), I'm almost certain to be able to write a shorter version given the choice of GolfScript, Perl, or Ruby. (They are like my unholy trinity as far as golfing goes. A number of other contestants are also able to use J to great effect.)&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2011-05-20T07:50:24.940" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="343" PostTypeId="2" ParentId="2140" CreationDate="2011-05-25T03:30:55.490" Score="4" Body="&lt;h1&gt;BlackJack Part II&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Repost from the original sandbox&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;As I had a blast working on the&#xA;  original KOTH challenge, I wanted to&#xA;  come up with another. For me, the fun&#xA;  of these AI challenges is in refining&#xA;  a comparatively simple bot which plays&#xA;  a very simple game subtly. Due to the&#xA;  probabilistic nature of card games, I&#xA;  think that blackjack could be an&#xA;  interesting KOTH game just like TPD.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bots play at tables of four (4) competitors and one (1) dealer&lt;/li&gt;&#xA;&lt;li&gt;One (1) shoe is shared by all players &lt;strong&gt;and the dealer&lt;/strong&gt; until it is exhausted, at which point a new randomly shuffled deck will be added and play will continue. The bots ARE NOT (at present) NOTIFIED of the addition of this new deck. [TODO? would make card-counting a LOT harder...]&lt;/li&gt;&#xA;&lt;li&gt;There is a buy-in of 10 per round, and cards are free&lt;/li&gt;&#xA;&lt;li&gt;There is no bet maximum as bets are between the player and the house, yet the bot must have sufficient chips to immediately finance the bet.&lt;/li&gt;&#xA;&lt;li&gt;Perfect/ideal hand has a score of 21&lt;/li&gt;&#xA;&lt;li&gt;All face cards have a value of 10&lt;/li&gt;&#xA;&lt;li&gt;All numeric cards are worth their number&lt;/li&gt;&#xA;&lt;li&gt;Aces are worth 11 or 1. this will be dealt with automatically by the framework, not the bots.&lt;/li&gt;&#xA;&lt;li&gt;Scores in excess of 21 which use an ace as 11 force the ace to reduce in value to 1&#xA;scores in excess of 21 which cannot be coerced below the threshold of 21 &quot;bust&quot; the bot&lt;/li&gt;&#xA;&lt;li&gt;The dealer draws until he busts, or excedes a score of 17.&lt;/li&gt;&#xA;&lt;li&gt;The stake is subtracted from chips, so the chips value is the number of credits which are available to the bot for betting.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Dealing and Bot Moves&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;When the game starts, each player is&#xA;iteratively dealt one card, and has&#xA;the $10 buy-in fee/minimum bet&#xA;subtracted from their chips.&lt;/li&gt;&#xA;&lt;li&gt;Then (in the same order as they were dealt to) each bot is executed as described in the &quot;Programmer's Interface&quot; section and &lt;strong&gt;must&lt;/strong&gt; make a move or stand. Betting is considered a move. &lt;strong&gt;&lt;em&gt;NOTE THAT BETTING DOES NOT AFFECT BOTS' ABILITY TO MAKE FURTHER MOVES.&lt;/em&gt;&lt;/strong&gt; It is very possible to bet and then draw a card, and it is possible to draw multiple cards and them bet before standing. &lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Programmer's Interface and Legal Moves&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As documented in the CardShark class:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#   DOCUMENTATION&#xA;#       INPUT SPECIFICATION&#xA;#          $ ./foo.bar &amp;lt;hand-score&amp;gt; &amp;lt;hand&amp;gt; &amp;lt;visible cards&amp;gt; &amp;lt;stake&amp;gt; &amp;lt;chips&amp;gt;&#xA;#          &amp;lt;hand-score&amp;gt;     is the present integer value of the player's hand.&#xA;#          &amp;lt;hand&amp;gt;           is a space-free string of the characters [1-9],A,J,Q,K&#xA;#          &amp;lt;visible cards&amp;gt;  every dealt card on the table. when new shoes are brought&#xA;#                           into play, cards drawn therefrom are simply added to this list&#xA;#                           !!! THE LIST IS CLEARED AT THE END OF HANDS, NOT SHOES !!!&#xA;#          &amp;lt;stake&amp;gt;          the  number of chips which the bot has bet this hand&#xA;#          &amp;lt;chips&amp;gt;          the number of chips which the bot has&#xA;#       SAMPLE INPUT&#xA;#          $ ./foo.bar 21 KJA KQKJA3592A 25 145&#xA;#&#xA;#       OUTPUT SPECIFICATION&#xA;#          &quot;H&quot;|&quot;S&quot;|&quot;D&quot;|&quot;B&quot;  (no quotes in output)&#xA;#          &quot;H&quot;              HIT - deal a card&#xA;#          &quot;S&quot;              STAND - the dealer's turn&#xA;#          &quot;D&quot;              DOUBLEDOWN - double the bet, take one card. FIRST MOVE ONLY&#xA;#          &quot;B 15&quot;           BET - raises the bot's stakes by $15.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Winner Selection&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The winner would be the author of the bot which consistently accrued the most chips over a yet-to-be determined number of tables and rounds.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Code Review &lt;a href=&quot;https://github.com/rdmckenzie/CodeGolf/tree/master/blackjack&quot; rel=&quot;nofollow&quot;&gt;github&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Issues &amp;amp; ToDo&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;None! (no known problems at least)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;del&gt;PS. How do I tag questions/answers?&lt;/del&gt; thanks @dmckee&#xA;[ai-player]&#xA;[card-game]&#xA;[koth]&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Version History&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;5/25 - 0020 - v1 - updated code on GitHub which fixes a bug with the dealer. DD still scores monstrously for unknown reasons. tagged this post (with any luck).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;5/25 - 0800 - v2 - bugfix on github which correctly implements DoubleDown, resulting in drastically reduced scores from the double-nut bot.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;5/25 - 0920 - v3 - updated the test case to match the input specification. Added the rules for the dealer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;5/25 - 1100 - v4 - added a description of the table and shoe system.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;5/25 - 1620 - v5 - added an explanation of the betting and card-dealing system, major status update.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;5/27 - 1700 - v6 - ready to roll the contest...&lt;/p&gt;&#xA;" OwnerUserId="1370" LastEditorUserId="1370" LastEditDate="2011-05-27T21:42:55.337" LastActivityDate="2011-05-27T21:42:55.337" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="346" PostTypeId="2" ParentId="2140" CreationDate="2011-05-28T19:03:40.800" Score="9" Body="&lt;h2&gt;Number-Hopper Maze&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://cstheory.stackexchange.com/questions/6358/solving-a-number-hopper-maze&quot;&gt;https://cstheory.stackexchange.com/questions/6358/solving-a-number-hopper-maze&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program that solves the Number-Hopper maze described above. The input will be an ASCII art description of the maze&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+------------+-----+&#xA;|x        |18|28  o|&#xA;| +--+--+ |  +--+--+&#xA;| |13|29|4|27|10|25|&#xA;| |  |  +-+--+     |&#xA;| |  |       +-----+&#xA;| |  |    |      23|&#xA;| |  +----+  ------+&#xA;| |  |    |        |&#xA;| |  | |  +------  |&#xA;| |  | |           |&#xA;| |  | |  ------+--+&#xA;| |  | |        |8 |&#xA;| |  | +-----+  |  |&#xA;| |  |  22|9 |  |  |&#xA;| |  +----+  |  |  |&#xA;|       14|11|     |&#xA;+---------+--+-----+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;-&lt;/code&gt; and &lt;code&gt;+&lt;/code&gt; are walls, they are interchangeable&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x&lt;/code&gt; is the starting point&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;o&lt;/code&gt; (lowercase O) is the destination&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The numbers are hop points, to hop from number A to B, you must pay the cost of &lt;code&gt;abs(A - B)&lt;/code&gt;, the positive difference between two numbers. The goal is to find the solution with the minimum cost.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The solution for the example above is &lt;code&gt;x-13-11-9-8-29-28-o&lt;/code&gt;, with total cost of 4.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input of the program will be the ASCII art of the maze, and the output is the sequence of numbers to hop, with the total cost. In the format of &lt;code&gt;x-13-11-9-8-29-28-o 4&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To qualify, you algorithm must be under or equal to &lt;code&gt;O(n^2)&lt;/code&gt;. Include an informal proof if others suspect you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't want to see pure brute-force solutions where obvious bad solutions such as moving in loops and making total 99999-steps for a small maze are included in the solution space.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="110" LastEditorUserId="-1" LastEditDate="2017-04-13T12:32:32.073" LastActivityDate="2011-05-28T19:03:40.800" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="347" PostTypeId="2" ParentId="338" CreationDate="2011-05-29T19:27:09.327" Score="0" Body="&lt;p&gt;You should make rules specific to your puzzle to deal with language handicaps, for example, in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/85/fibonacci-function-or-sequence&quot;&gt;Fibonacci function or sequence&lt;/a&gt;, they allow you to make a function or a sequence. In some puzzles, they only expect a function definition or even a code snippet, not a full class body with main method.&lt;/p&gt;&#xA;" OwnerUserId="110" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2011-05-29T19:27:09.327" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="350" PostTypeId="1" CreationDate="2011-06-01T12:45:25.853" Score="5" ViewCount="133" Body="&lt;p&gt;I found &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/59/golf-versus-non-golf-questions&quot;&gt;this question from January&lt;/a&gt;, but the top voted idea doesn't seem to have been implemented. In this time between the end of school and starting work, I would love to get some solutions to questions out there, but I'm not a fan of code golf and there doesn't seem to be a way to find questions that are not golf questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There might be a newer question that I missed, but how do I identify questions that are code golf easily and ignore them? I've seen several code golf questions not tagged as code golf, but ignoring the tag helps a little. Is there any other solution to either hiding code golf questions or bringing out questions designed to elicit interesting solutions?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On a somewhat similar note, I'm interested in community reactions to posting non-golf answers in &quot;code golf&quot; questions? Honestly, it's all about the puzzle. If you choose to code golf it, go for it. But at the same time, if I have an interesting solution that isn't golfed, there's no way to post it without a duplicate question.&lt;/p&gt;&#xA;" OwnerUserId="549" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2011-06-01T13:26:57.360" Title="Is there a way to easily find questions that aren't code golf?" Tags="|discussion|challenges|answers|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="351" PostTypeId="2" ParentId="350" CreationDate="2011-06-01T13:06:34.207" Score="5" Body="&lt;p&gt;The &quot;ignoring [code-golf]&quot; method is probably the best way I know.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;IMHO, if you post a non-golf solution to a golf thread, you should at least community-wiki your answer. If you're doing it in good faith (i.e., it's truly interesting, and not spammy (non-golf just because you can't be bothered to golf)), people would probably let it stand. (I'd love to hear how other regulars here think about this stance, though.)&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2011-06-01T13:06:34.207" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="352" PostTypeId="2" ParentId="350" CreationDate="2011-06-01T13:13:28.130" Score="5" Body="&lt;p&gt;The tags being used to identify classes of puzzles right now seem to be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/one-liner&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;one-liner&amp;#39;&quot; rel=&quot;tag&quot;&gt;one-liner&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ai-player&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ai-player&amp;#39;&quot; rel=&quot;tag&quot;&gt;ai-player&lt;/a&gt;, with a few tasks being tagged with more than one of the above. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/252/78&quot;&gt;Meta question on one-liner&lt;/a&gt;; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/302/78&quot;&gt;another on king-of-the-hill and ai-player&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using the tag search syntax (i.e. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot;&gt;&lt;code&gt;[king-of-the-hill]&lt;/code&gt;&lt;/a&gt;) does what you'd expect. You can also get to the contents of a tag through the &quot;Tags&quot; button at the top of the page. You an also exclude things from compound searches (i.e. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art+-code-golf&quot;&gt;&lt;code&gt;[ascii-art] -[code-golf]&lt;/code&gt;&lt;/a&gt;), but alas it won't respond to just &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=-%5Bcode-golf%5D&quot;&gt;&lt;code&gt;-[code-golf]&lt;/code&gt;&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Bare ungolfed answers to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; have been known to draw some downvotes, but on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2657/swapping-heightmaps-to-depthmaps/2664#2664&quot;&gt;the example I saw recently they have been reversed&lt;/a&gt; since the poster tried a little harder. Back on Stack Overflow, I got some positive feedback on &lt;a href=&quot;https://stackoverflow.com/questions/1352587/code-golf-morse-code/1352828#1352828&quot;&gt;a &quot;answer&quot; to a code-golf that merely described a possible attack on the problem&lt;/a&gt;, so I think that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/350/is-there-a-way-to-easily-find-questions-that-arent-code-golf/351#351&quot;&gt;Chris' suggestion might work&lt;/a&gt;, especially if you explain what you are up to.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2011-06-01T13:26:57.360" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="353" PostTypeId="1" CreationDate="2011-06-02T13:24:00.457" Score="3" ViewCount="80" Body="&lt;p&gt;will there be for each answer an auto calculation for the &quot;code&quot; section that was marked up by the user&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;like this is a marked up code section&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and write here total characters : 37 as an auto feature for this special form?&lt;/p&gt;&#xA;" OwnerUserId="1743" LastEditorUserId="68942" LastEditDate="2021-06-09T05:49:21.343" LastActivityDate="2021-06-09T05:49:21.343" Title="auto count the number of chars in the code section" Tags="|feature-request|status-completed|characters|" AnswerCount="1" CommentCount="0" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="354" PostTypeId="2" ParentId="353" CreationDate="2011-06-02T15:14:30.877" Score="5" Body="&lt;p&gt;George Edison, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/170/78&quot;&gt;has provided a UserScript to do just that&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2011-06-02T15:14:30.877" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="355" PostTypeId="1" AcceptedAnswerId="356" CreationDate="2011-06-02T18:48:18.483" Score="3" ViewCount="182" Body="&lt;p&gt;I always try to use JavaScript when posting a code golf solution, but there are a few things I'm wondering:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It is said that global variables are allowed. However, what if the code can therefore only be run once, because the second time the code messes up due to existing global variables?&lt;/li&gt;&#xA;&lt;li&gt;Should the code immediately output what's expected or should it rather be a function?&lt;/li&gt;&#xA;&lt;li&gt;What functions should be used for input/output? &lt;code&gt;console.log&lt;/code&gt; is obviously longer than &lt;code&gt;alert&lt;/code&gt;, but &lt;code&gt;alert&lt;/code&gt; is not available in all implementations. Also, should input be asked for or is the input data already in some variable?&lt;/li&gt;&#xA;&lt;li&gt;Is it allowed to use &lt;a href=&quot;https://developer.mozilla.org/en/JavaScript/New_in_JavaScript/1.8#Expression_closures_%28Merge_into_own_page.2fsection%29&quot; rel=&quot;nofollow&quot;&gt;expression closures&lt;/a&gt;, which are actually only available in Firefox?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="1645" LastActivityDate="2011-06-02T18:55:43.920" Title="Some clarification on JavaScript code golf solutions" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="356" PostTypeId="2" ParentId="355" CreationDate="2011-06-02T18:55:43.920" Score="5" Body="&lt;ul&gt;&#xA;&lt;li&gt;If you use features that only only available in some implementations, I'd say you are honor bound to disclose these restrictions. This is the same as saying that you have written c99 or ruby 1.9, or that your fortran only runs in g77, etc.&lt;/li&gt;&#xA;&lt;li&gt;Fragile solutions are par for the course, so a &quot;one run only&quot; code is fine unless the problem spec implies or states a need for handling multiple inputs.&lt;/li&gt;&#xA;&lt;li&gt;Full-program (i.e. IO included) versus function-only should be part of the specification.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78" LastActivityDate="2011-06-02T18:55:43.920" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="357" PostTypeId="1" AcceptedAnswerId="358" CreationDate="2011-06-09T20:45:56.003" Score="2" ViewCount="137" Body="&lt;p&gt;I'm sorry for nitpicking, but when navigating to 'Questions' one can browse up to page 23. However, page 23 is plainly empty:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions?page=23&amp;amp;sort=newest&quot;&gt;https://codegolf.stackexchange.com/questions?page=23&amp;amp;sort=newest&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this a bug by any chance?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Perhaps this problem disappears when a question is posted, but at the moment this can be experienced)&lt;/p&gt;&#xA;" OwnerUserId="1645" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2011-06-10T11:19:38.723" Title="Page 23 is empty" Tags="|bug|status-completed|challenges|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="358" PostTypeId="2" ParentId="357" CreationDate="2011-06-10T11:19:28.347" Score="3" Body="&lt;p&gt;There was a rounding error here resulting in an off-by-one on the last page once that rounding went up, this is fixed in the next build.&lt;/p&gt;&#xA;" OwnerUserId="9" LastActivityDate="2011-06-10T11:19:28.347" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="359" PostTypeId="1" CreationDate="2011-06-13T00:16:59.573" Score="8" ViewCount="177" Body="&lt;p&gt;All too often I look at questions proposed here and I think: &quot;The proposer clearly doesn't have a running solution to this question.&quot; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we make it an expectation that before posting a question, whether code-golf or code-challenge, the poster should have running code that implements the problem. While I don't think they should have to reveal their code at start, perhaps they should reveal what language their implementation is in, and how long it is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I imagine for code-golf, it isn't important that their answer is golf'd. But, for code-challenge, especially ones with execution time or memory requirements, the poster's solution should conform.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="116" LastActivityDate="2011-06-13T00:41:01.783" Title="Should question proposers be expected to have a coded answer before they propose?" Tags="|discussion|policy|rules|challenge-quality|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="360" PostTypeId="2" ParentId="359" CreationDate="2011-06-13T00:41:01.783" Score="7" Body="&lt;p&gt;In a similar vein Joey has been pushing to have a tool to validate the results. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I regard both suggests in a positive light, and would strongly encourage people posting non-trivial questions to consider doing both.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, I've been trying to avoid too many hard and fast &lt;em&gt;&quot;You must jump through this hoop in order to post&quot;&lt;/em&gt; type rules. We have pretty low traffic, and I hesitate to make it worse.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Granted, I think the quality of our questions is less than stellar and that may be contributing to the dearth of traffic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please feel free to encourage others to have a working solution before posting. IN particular feel free to suggest that the effort of producing a working model would have allowed the user to identify some of the corner cases left unspecified.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2011-06-13T00:41:01.783" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="363" PostTypeId="2" ParentId="2140" CreationDate="2011-06-21T22:21:43.127" Score="2" Body="&lt;p&gt;&lt;strong&gt;Perfect Hash Generator&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given N words you are to generate a perfect hash function (ala &lt;a href=&quot;http://www.gnu.org/software/gperf/&quot; rel=&quot;nofollow noreferrer&quot;&gt;gperf&lt;/a&gt;). A perfect hash function for a set of strings is a hash function with no collisions. An additional condition is that the range of the generated hash function must be [0...O(N)] (i.e. at most a constant times larger than N). You can use any language for the generated function.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Can we get some feedback on this old post? I'm wondering if it is possible to avoid the obvious loophole of a cat program.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="32" LastEditorDisplayName="user58826" LastEditDate="2017-06-09T15:15:10.073" LastActivityDate="2017-06-09T15:15:10.073" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="365" PostTypeId="2" ParentId="2140" CreationDate="2011-06-22T14:46:06.167" Score="4" Body="&lt;p&gt;Given a text, determine the language it is written in. The possible languages are: English, Danish, Romanian and Hungarian.  The shortest program wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some examples of text in each language can be found at &lt;a href=&quot;http://www.gutenberg.org&quot; rel=&quot;nofollow&quot;&gt;Project Gutenberg&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;English &lt;a href=&quot;http://www.gutenberg.org/cache/epub/2600/pg2600.txt&quot; rel=&quot;nofollow&quot;&gt;http://www.gutenberg.org/cache/epub/2600/pg2600.txt&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Danish &lt;a href=&quot;http://www.gutenberg.org/cache/epub/12167/pg12167.txt&quot; rel=&quot;nofollow&quot;&gt;http://www.gutenberg.org/cache/epub/12167/pg12167.txt&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Romanian &lt;a href=&quot;http://www.gutenberg.org/files/11756/11756-0.txt&quot; rel=&quot;nofollow&quot;&gt;http://www.gutenberg.org/files/11756/11756-0.txt&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Hungarian &lt;a href=&quot;http://www.gutenberg.org/files/30163/30163-0.txt&quot; rel=&quot;nofollow&quot;&gt;http://www.gutenberg.org/files/30163/30163-0.txt&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You are required to include examples of runs on text files other than the ones provided here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input file name is given as a command line argument. Except the input text, you are not allowed read additional files (e.g. to train your program) so please encode any data in your program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program must output on of the following words &lt;em&gt;English&lt;/em&gt;, &lt;em&gt;Danish&lt;/em&gt;, &lt;em&gt;Romanian&lt;/em&gt;, &lt;em&gt;Hungarian&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$ ./language pg2600.txt&#xA;English&#xA;$ ./langauge pg12167.txt&#xA;Danish&#xA;$ ./language 11756-0.txt&#xA;Romanian&#xA;$ ./language 30163-0.txt&#xA;Hungarian&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="32" LastEditorUserId="32" LastEditDate="2011-06-22T15:08:56.460" LastActivityDate="2011-06-22T15:08:56.460" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="367" PostTypeId="1" CreationDate="2011-06-24T16:17:43.770" Score="7" ViewCount="1827" Body="&lt;p&gt;&lt;strong&gt;EDIT:&lt;/strong&gt; Clarified my point after seeing &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/367/brainfuck-challenges/368#368&quot;&gt;dmckee's answer&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I just discovered brainfuck and find it really amusing. It seems to me that it is a perfect material for programming puzzles (especially code-golf):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;it's really easy to learn (8 instructions)&lt;/li&gt;&#xA;&lt;li&gt;it's really challenging to come up with short programs&lt;/li&gt;&#xA;&lt;li&gt;it's purely about algorithms&lt;/li&gt;&#xA;&lt;li&gt;everyone can understand everyone else's solution&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Basically, everyone gets the same basic weapon and then it's all about how twisted your mind can be. So I was surprised not to find any puzzle on this site asking for solutions in BF (well, except &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2445/implement-quicksort-in-brainf&quot;&gt;this one&lt;/a&gt;), and not even a brainfuck tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've seen the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/231/thought-on-language-specific-challanges/235#235&quot;&gt;concerns&lt;/a&gt; raised by single language questions, but IMHO BF is much harder and weirder than most other languages, and many challenges that are completely trivial to solve in most languages necessitate some creativity in BF. Consider for instance:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Write a program that takes 2 bytes as input and outputs the smallest of them.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Maybe that's because I'm new to BF, but it took me some time to figure out how to do that, and I'm pretty sure that there are tons of other ways to do it - probably shorter ones.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What's your view on that? Can I start posting BF puzzles?&lt;/p&gt;&#xA;" OwnerUserId="1981" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2014-01-15T09:04:38.703" Title="Brainfuck challenges?" Tags="|discussion|policy|contest-type|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="368" PostTypeId="2" ParentId="367" CreationDate="2011-06-24T16:47:01.123" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/231/78&quot;&gt;Thought on language specific challanges&lt;/a&gt;, does not show anything I would call a consensus, though it may tilt slight against single-language challenges for most purposes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But also look at &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/132/78&quot;&gt;Is language-agnostic an appropriate tag?&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/284/78&quot;&gt;Are “restricted programming” problems on topic?&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2011-06-25T07:38:10.257" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="369" PostTypeId="1" AcceptedAnswerId="370" CreationDate="2011-07-01T15:55:06.890" Score="5" ViewCount="190" Body="&lt;p&gt;We've &lt;a href=&quot;https://codegolf.stackexchange.com/q/3019/78&quot;&gt;seen&lt;/a&gt; several &lt;a href=&quot;https://codegolf.stackexchange.com/q/3047/78&quot;&gt;migrations&lt;/a&gt; from &lt;a href=&quot;https://codegolf.stackexchange.com/q/2774/78&quot;&gt;Stack&lt;/a&gt; Overflow recently (including &lt;a href=&quot;https://stackoverflow.com/q/6473218/2509&quot;&gt;one that was eventually un-migrated&lt;/a&gt;), and it is clear that not everyone on Stack Overflow understands the fairly restrictive rules we have established here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;OK, so that's not a big surprise. Moderators from all the computery sites have been on the mother meta complaining about being “Stack Overflow's waste bin” from time to time.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have noticed a commonality in some of the recent migrations: they are—stripped of their verbal confusion—questions about dissecting a problem and choosing algorithms that will work.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I assert that that is a basic Programming Puzzles skill, and wonder if these problems might have a place here similar to the &lt;em&gt;“Tips for golfing in ...”&lt;/em&gt; series?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thought?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we are going to accept them should they be Community Wiki?&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2014-04-23T09:29:32.537" Title="Do &quot;How do I get from problem to algorithm?&quot; questions have a place on CodeGolf.SE?" Tags="|discussion|challenges|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="370" PostTypeId="2" ParentId="369" CreationDate="2011-07-01T16:20:35.553" Score="5" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;I have noticed a commonality in some of the recent migrations: they are---striped of their verbal confusion---question about dissecting a problem and choosing algorithms that will work.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;assert that that is a basic Programming Puzzles skill, and wonder if these problems might have a place here similar to the &quot;Tips for golfing in...&quot; series?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It's not a basic programming puzzles skill: it's a basic programming skill. As far as that aspect of the questions goes, they're at home in SO - its FAQ says that it covers questions which relate to (among others)&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;a specific programming problem&lt;/li&gt;&#xA;  &lt;li&gt;a software algorithm&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The aspect which I think ties together the questions which are being migrated here is that they're not business questions. I think some people see a question which is about problems people face in programming for pleasure rather than business and think it doesn't belong on SO. But there's nothing in the SO FAQ against such questions, as long as they relate to an actual problem faced. I think the SO Meta is the place to raise this, and I'll raise it there if people agree and no-one else does it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Update: &lt;a href=&quot;https://meta.stackexchange.com/questions/97342/is-stackoverflow-limited-to-business-questions&quot;&gt;now raised&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2011-07-03T16:51:19.563" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="373" PostTypeId="1" CreationDate="2011-07-06T01:56:54.887" Score="6" ViewCount="353" Body="&lt;p&gt;Before I discovered that code golf was &quot;a thing&quot;, I'd played against myself quite a bit.  Often, I'd get down to 104 characters, say, and crank on it until I could get it to 100.  But, if I can't get it below 90, I like to get it back to 100, 'cause it's nice and round.  I deem this &quot;code shuffleboard&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The idea behind code shuffleboard is to implement an algorithm in exactly a certain number of bytes.  Of course, it's trivial to inflate a golfed solution by adding whitespace, using longer variable names, etc.  So, the rules would be:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No unnecessary whitespace&lt;/li&gt;&#xA;&lt;li&gt;All variable / function names (if applicable to your language) defined in the code must be 1 letter (unless you run out of letters, then you can use 2-letter variables)&lt;/li&gt;&#xA;&lt;li&gt;No comments&lt;/li&gt;&#xA;&lt;li&gt;No useless code: deleting anything from the program must break it&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In short, every character must contribute nontrivially to the functionality of the program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would other people participate in this?  For a twist, one could require that the code fit inside of a certain sized rectangle, with no room to spare (though, that would risk favoring J/GS overly much).&lt;/p&gt;&#xA;" OwnerUserId="2180" LastEditorUserId="2180" LastEditDate="2011-07-06T23:27:41.600" LastActivityDate="2011-12-12T18:46:23.473" Title="New puzzle type: code-shuffleboard" Tags="|discussion|" AnswerCount="2" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="374" PostTypeId="2" ParentId="2140" CreationDate="2011-07-06T20:05:40.663" Score="4" Body="&lt;h1&gt;Metagolf: Catlike Piet&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The goal of this is to write a &lt;code&gt;cat&lt;/code&gt;like program, which would be executed (in a Unix environment, though you needn't stick to that) by the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;yourprogram &amp;lt; file &amp;gt; output&#xA;piet output&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;piet output&lt;/code&gt; writes the contents of &lt;code&gt;file&lt;/code&gt; to stdout.  That is, you're to generate a Piet program which prints the input to &lt;code&gt;yourprogram&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;One-liners&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Straight line programs can be written in Piet... in straight lines.  If you're willing to take a hit to your score, your output can take the form of a string of commands:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;=  none (continue color block)&#xA;|  push&#xA;^  pop&#xA;+  add&#xA;-  subtract&#xA;*  multiply&#xA;/  divide&#xA;%  mod&#xA;~  not&#xA;&amp;gt;  greater&#xA;.  pointer&#xA;\  switch&#xA;:  duplicate&#xA;@  roll&#xA;$  input number&#xA;?  input character&#xA;#  output number&#xA;!  output character&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which is trivial to convert to a Piet program with the following (partially golfed) Python code:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def P(s):&#xA; h=v=0;l=len(s)+1;R=&quot;P3 %i 2 255 192 0 0 &quot;%(l+2)&#xA; C=[1,3,2,6,4,5];V=[0,192,192,255,0,255]&#xA; for x in map(&quot;=|^+-*/%~&amp;gt;.,:@$?#!&quot;.find,s):&#xA;  C=C[x//3:]+C[:x//3];V=V[x%3*2:]+V[:x%3*2]&#xA;  for i in [1,2,4]:R+=&quot;%i &quot;%V[(C[0]//i)%2]&#xA; return R+&quot;255 &quot;*4+&quot;0 0 &quot;+&quot;255 &quot;*l*3+&quot;255 0 0 &quot;*2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The dimension of said program is (n+3) x 2 if there are n characters in the string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code will be judged on the &lt;em&gt;maximum dimension&lt;/em&gt; of the images that it outputs.  &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Part 1: Take the maximum score taken over all ascii codes (that is, single-character inputs), discounting EOF.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Part 2: Take the score for the input &quot;Hello. My name is Inigo Montoya. You killed my father. Prepare to die.&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your score is the product of the scores in part 1 and part 2.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Punishment: Double your score if you write one-liners as above (that is, if you don't output an image).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bonus: If your program is written in Piet, take the square root of your score above.&lt;/p&gt;&#xA;" OwnerUserId="2180" LastEditorUserId="2180" LastEditDate="2011-07-06T23:55:45.537" LastActivityDate="2011-07-06T23:55:45.537" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="379" PostTypeId="2" ParentId="231" CreationDate="2011-07-28T23:42:40.610" Score="4" Body="&lt;p&gt;I have seen 3 kinds of questions, trying to limit the number of languages:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;... runs on my computer, for automatic choosing the winner, for example to compare the speed of different solutions, or a speed threshold&lt;/li&gt;&#xA;&lt;li&gt;The question has a feature, only available in - for example - C++ . &lt;/li&gt;&#xA;&lt;li&gt;discriminating - 'I don't like golfscript' - questions. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In case a, a better solution is to use ideone for example, to test the speed. Or you have to measure your code (to run in less than a minute, for example), and have to bring or find a second source to confirm your claim. It might be difficult for exotic languages (think: Basic), but at least it is possible for everybody. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Question 2: is the problem of the quizzmaster with limited knowledge. If the quizz is hard in javascript, because he doesn't know a javascript-compiler - maybe somebody else knows. But he needn't make an explicit language restriction, if the restriction is already in the content of the question. Maybe you can solve the 8-queens-problem with scala during compile-time? I can't in scala, but I can't in C++. :) &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Question 3: If you don't like golfscript, you needn't upvote it. But as a fair sportsman, you should accept it, if it is the shortest solution and you performed the riddle. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Else: ?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Conclusion: I would discourage from using language restrictions, but I can't look into the future. Maybe there are good reasons, to restrict the battle. Maybe in those cases, it is possible to make an official and inofficial winner - for example, find the silver bullet in perl - only the best perl-solution gets accepted, but silver bullets in other languages can participate out of competition. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since people are encouraged to introduce their question first in chat, we might avoid too restricted rules.&lt;/p&gt;&#xA;" OwnerUserId="373" LastActivityDate="2011-07-28T23:42:40.610" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="383" PostTypeId="1" CreationDate="2011-08-04T20:28:53.340" Score="5" ViewCount="392" Body="&lt;p&gt;follow the title&lt;/p&gt;&#xA;&#xA;&lt;p&gt;mainly I'm asking this so I know whether to count all the import declarations that are required for the code to run successfully (especially when the import/include is required in the language like in D)&lt;/p&gt;&#xA;" OwnerUserId="2005" LastActivityDate="2011-08-04T21:18:09.090" Title="should imports/includes count in golf" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="1" ClosedDate="2017-04-28T09:40:59.977" ContentLicense="CC BY-SA 3.0" />
  <row Id="384" PostTypeId="2" ParentId="383" CreationDate="2011-08-04T21:18:09.090" Score="11" Body="&lt;p&gt;I &lt;em&gt;always&lt;/em&gt; count them in my c solutions, though people will sometimes omit to include &lt;code&gt;stdio.h&lt;/code&gt; if they only use functions like &lt;code&gt;printf&lt;/code&gt; and &lt;code&gt;getc&lt;/code&gt; that will compiler correctly with the type defaulting behavior of K&amp;amp;R or ansi c.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2011-08-04T21:18:09.090" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="385" PostTypeId="1" CreationDate="2011-08-09T08:46:26.277" Score="8" ViewCount="298" Body="&lt;p&gt;At present, when we vote to close a question as off-topic the only offered migration target is meta.codegolf.SE. Most of the time off-topic questions really belong on SO - the poster understood &quot;programming puzzles&quot; to mean &quot;place to post some code which is puzzling me&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can SO be added as a target?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Recent threads which belong on SO:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/3281&quot;&gt;https://codegolf.stackexchange.com/questions/3281&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/3366&quot;&gt;https://codegolf.stackexchange.com/questions/3366&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/3377&quot;&gt;https://codegolf.stackexchange.com/questions/3377&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/3403&quot;&gt;https://codegolf.stackexchange.com/questions/3403&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="194" LastEditorUserId="68942" LastEditDate="2021-06-09T05:30:52.560" LastActivityDate="2021-06-09T05:30:52.560" Title="Can we have migration to StackOverflow?" Tags="|feature-request|status-declined|migration|" AnswerCount="1" CommentCount="2" ClosedDate="2021-06-03T23:32:54.123" ContentLicense="CC BY-SA 3.0" />
  <row Id="386" PostTypeId="2" ParentId="385" CreationDate="2011-08-09T16:05:42.413" Score="1" Body="&lt;p&gt;If you want a migration path to a site, you'll need to provide ample evidence that you actually have a sufficient demand for it. &lt;strong&gt;You need a significant number of questions that you either have already migrated to Stack Overflow, or are valid migrations to Stack Overflow that have yet to be addressed&lt;/strong&gt;. Provide links to all of these incidents. Usually, this is in proportion to your traffic - it has to represent a path that is consistently in use, not just something that makes sense. Keep in mind as well, as you are a Beta site, it isn't traditional to allow migration paths to or fro with graduated to ungraduated sites.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider Gaming and Game Development - it makes sense to have that migration path, eh? Most of our migration-worthy content goes to Game Dev. But Gaming has only migrated 9 posts to Game Development over the course of a year. That's not really enough to warrant a migration path to be constructed. You want to be shooting for a high number of examples to provide.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When you've gathered enough evidence of the need for a migration path, then we can look into setting up a migration path. I mean, given you're Programming Puzzles, which basically split off from Stack Overflow, I can easily picture the migration path being valid. However...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;In the last 90 days, there have only been 4 migrations out of here, only 3 of which went to Stack Overflow&lt;/em&gt;. There are only 3 other migrations, totaling 6 migrations to Stack Overflow over the entire history of the site. I think you'll have to wait until much better evidence accumulates.&lt;/p&gt;&#xA;" OwnerUserId="2414" LastActivityDate="2011-08-09T16:05:42.413" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="388" PostTypeId="1" CreationDate="2011-08-13T22:18:41.757" Score="8" ViewCount="329" Body="&lt;p&gt;To compare solutions on performance, we should form a kind of template, what to specify or how to specify the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I realized, when trying to solve &lt;a href=&quot;https://codegolf.stackexchange.com/q/39/373&quot;&gt;fast line drawing algorithm&lt;/a&gt;, that it is not clearly specified: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;How are the results compared? What is it, what shall be compared? How fast a line is drawn, but we know, that because of caches and cache-size and cache-misses, a solution which is fast with 10 000 elements might be slow with ten millions. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The size of source (code-golf) can be compared more easily², but if I look at a bunch of c/python/ruby-code I can't estimate how many lines it might draw per second or minute. Not roughly, and not even for languages which I use on a daily basis.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Possible approaches: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A) Let chaos rule. Every question shall choose its own way. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;B) Let every answer specify machine characteristics and use its own, private timing policy. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;User A: Pentium III 800 Mhz, 1000 runs / 0.4 s&lt;/li&gt;&#xA;&lt;li&gt;User B: 3 dual-cores @ 3Ghz, 1s: 23 786 000 runs&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;C) Let the quizz master fix the settings, for a minimal comparision, and the users have to specify their machine: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How many solutions in 30s&lt;/li&gt;&#xA;&lt;li&gt;How many time for 1 Mio. solutions&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;D) Let the quizz master fix the settings, for a minimal comparision, and the users have to provide ready-to-run code/applications, not just functions/snippets.  &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Full source code A.cc, B.Java, C.scala&lt;/li&gt;&#xA;&lt;li&gt;How to run it: &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;g++ A.cc -lm -o A &amp;amp;&amp;amp; time A&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;javac B.java; java B&lt;/code&gt; # internal timing&lt;br&gt;&#xA;&lt;code&gt;scalac C.scala &amp;amp;&amp;amp; time scala C 1000000&lt;/code&gt; # specify problem size&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;E) Let the users use IDEONE or something similar, to have it executed on the same machine. Specify number of solutions or time to run. Drawback: Not every language is available.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I'm not sure how to handle the problem best, and I know, that most users go online, without discussing their riddle in chat - maybe in a unjustified fear, that somebody else will copy it? However; if we have something in the faq, or it is easy to find on meta, we can often provide links 'how to ask performance tasks' so some people will use it from the beginning. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you worked on your solution and meanwhile the asker decides, how to compare the resulst, you might have to do doubled work. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think we should look for a ruleset which will fit 90% of the performance questions, and be fine for as much languages as possible. It should be short and easy to explain. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pleas argue for one of the ideas A-E, argue for a modification like B' or C'', or introduce your solution F-Z. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;²) Don't discuss it here: Can C/C++-Users and the like substract their main-boilerplate or not - this might be argued about, but we can at least estimate, what the substraction or addition of a main method would mean in terms of character costs. Or include-files - we know, we know.&lt;/p&gt;&#xA;" OwnerUserId="373" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-02-08T00:35:18.077" Title="comparing fastest code" Tags="|discussion|rules|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="389" PostTypeId="2" ParentId="373" CreationDate="2011-08-14T04:39:31.107" Score="8" Body="&lt;p&gt;I don't think it's such a good idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I try to press the last byte out of my code, I often find a byte here and there, and another one later. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Collecting 3-4 techniques and reversing them would allow me to add some unnecessary, but hard to tell bytes to the code. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples: &#xA; * In implementing rot13, I switched from &lt;code&gt;f('A','Z')&lt;/code&gt; to &lt;code&gt;f(65,90)&lt;/code&gt;. In statically typed languages, it often only pays off, if you have enough invocations, to save a '.toChar' which gets necessary, by using Ints. So this will be hard to verify.&#xA; * Sometimes a linebreak can be avoided: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; def foo(a:Int)=a match{&#xA; case 42=&amp;gt; ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;can be written as &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; def foo(a:Int)=a match{case 42=&amp;gt; ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;surely something I would do, to win a golf, but spot it in other peoples code? In languages, which I don't know that well? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a code-golf, you have to find a clever solution, to enter - for example - the range of 90-110 chars, and then you may optimize some whitespace away, and here a bit and there. Then you land at 70-90 chars. But it's not a very creative process. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You collect some tricks over the months, and can apply them on every 2nd or 3rd solution you provided. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another one: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def s(a:String,b:String,c:String)=...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;can be golfed by&#xA;    type S=String&#xA;    def s(a:S,b:S,c:S)=... &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You have to count and measure, whether it is a win in the end - it consumes much time, and is not very funny or challenging. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;To submit a solution - if we think about something like 'must be divisible by 10' you need to produce a solution, and then work on it, even if you would notice, that you can't reach for example another solution with 90 chars, because you have 124 chars. Your approach might be different, and your language, but you now have to find a way to add 6 more characters, which don't look superfluous. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The 400-questions-challenge was a kind of such a challenge, but it was hard to reach such a short code, and increasing the length of a solution is a new challenge, but only once. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I guess: As a category, it will not work.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's not creative in the long run&lt;/li&gt;&#xA;&lt;li&gt;It's too hard to check, especially, if you aren't master of a language&lt;/li&gt;&#xA;&lt;li&gt;It will lead to debates where to draw the borderline&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="373" LastActivityDate="2011-08-14T04:39:31.107" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="390" PostTypeId="1" AcceptedAnswerId="391" CreationDate="2011-08-15T18:11:20.033" Score="1" ViewCount="231" Body="&lt;p&gt;I've seen a couple of questions which use a language which has the following chracters: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;&amp;lt;&amp;gt;-+.[]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What language is that?&lt;/p&gt;&#xA;" OwnerUserId="2549" LastActivityDate="2014-04-23T09:29:32.537" Title="What language is this - often used on code golf" Tags="|discussion|support|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="391" PostTypeId="2" ParentId="390" CreationDate="2011-08-15T18:18:23.040" Score="5" Body="&lt;p&gt;Quite possibly &lt;a href=&quot;http://en.wikipedia.org/wiki/Brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;BrainF_ck&lt;/a&gt; (&lt;a href=&quot;https://meta.stackexchange.com/q/24079/2509&quot;&gt;concerning the spelling&lt;/a&gt;), a minimal programing language and a exemplar of the &lt;a href=&quot;http://en.wikipedia.org/wiki/Turing_tarpit&quot; rel=&quot;nofollow noreferrer&quot;&gt;Turing Tar Pit&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2011-08-15T18:18:23.040" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="392" PostTypeId="2" ParentId="390" CreationDate="2011-08-15T23:49:28.237" Score="1" Body="&lt;p&gt;Fish and GolfScript are also contenders.... J is also possible.&#xA;I've seen a lot of GolfScript because it allows for concise manipulation of arrays and such.&#xA;Fish uses the above characters much more extensively than the others.... and I confess I don't know exactly what distinguishes J syntactically.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe that all of them fall into the category of the &lt;a href=&quot;http://en.wikipedia.org/wiki/Turing_tarpit&quot; rel=&quot;nofollow&quot;&gt;Turing Tar Pit&lt;/a&gt; as described by @dmckee&lt;/p&gt;&#xA;" OwnerUserId="1370" LastActivityDate="2011-08-15T23:49:28.237" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="394" PostTypeId="2" ParentId="2140" CreationDate="2011-08-17T12:50:46.487" Score="15" Body="&lt;h2&gt;Self-Golfing Code&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I think it would be interesting to have a challenge to write a program where the program could &quot;golf&quot; itself. The hard part is coming up with the right specification and restrictions to keep the submissions interesting. What I'm currently thinking of are the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input is the program's own source code, provided in stdin or as a file.&lt;/li&gt;&#xA;&lt;li&gt;The output is a &quot;golfed&quot; version of the source code that must be shorter by at least 5 characters.&lt;/li&gt;&#xA;&lt;li&gt;If the &quot;golfed&quot; version was run with the same input (the original source code), the output must be the same as the output of the original.&lt;/li&gt;&#xA;&lt;li&gt;If the program was run with any other program (in the same language) as the input, the output must still be syntactically valid. It does not need to shorten it, and it does not matter if the resulting program doesn't function the same way.&lt;/li&gt;&#xA;&lt;li&gt;If the program's source code was placed within another program (in the same language), then running the golfer on that other program would still &quot;golf&quot; the embedded source code in the same way. (The idea here is to prevent something like a program that just deletes the first five characters of itself.)&lt;/li&gt;&#xA;&lt;li&gt;The score is the length of the original &quot;ungolfed&quot; program.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Is this challenge interesting enough in a variety of languages? And what other cheap tricks need to be guarded against?&lt;/p&gt;&#xA;" OwnerUserId="2459" LastActivityDate="2011-08-17T12:50:46.487" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="396" PostTypeId="2" ParentId="249" CreationDate="2011-08-20T15:45:16.067" Score="5" Body="&lt;p&gt;I upvote every question where I partition in the challenge, because I think a good question is a question which attracts my interest. The only exception is, when I like the challenge very much, but the question is poorly worked out:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;unclear from the language &lt;/li&gt;&#xA;&lt;li&gt;ambiguous &lt;/li&gt;&#xA;&lt;li&gt;no examples provided &lt;/li&gt;&#xA;&lt;li&gt;questions about border cases don't get answered &lt;/li&gt;&#xA;&lt;li&gt;poor layout&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In the above cases, I even might downvote the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In contrast, I upvote a question even if I don't take part in the challenge, if it is worked out very good:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;test cases, examples&lt;/li&gt;&#xA;&lt;li&gt;clear language, border cases catched&lt;/li&gt;&#xA;&lt;li&gt;maybe: images to illustrate something&lt;/li&gt;&#xA;&lt;li&gt;proper layout&lt;/li&gt;&#xA;&lt;li&gt;interesting challenge, but maybe too hard, too exotic for me&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The language problem and border-cases can be solved by asking for assistance in chat or in the preparation-thread on meta - nobody will steal your question; I guess that is the common sense of fairness here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is annoying to start in a challenge, and, because of an unclear question, to restart from scratch, to solve the changing puzzle.&lt;/p&gt;&#xA;" OwnerUserId="373" LastActivityDate="2011-08-20T15:45:16.067" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="397" PostTypeId="1" CreationDate="2011-08-20T16:08:04.783" Score="10" ViewCount="241" Body="&lt;p&gt;When I take the time to test solutions of competitors, I sometimes find failing answers, which not even solve the examples.&lt;/p&gt;&#xA;&lt;p&gt;I don't want to discuss a certain question and its solutions, but we all prefer concrete examples - don't we? So please don't take it personal.&lt;/p&gt;&#xA;&lt;p&gt;For &lt;a href=&quot;https://codegolf.stackexchange.com/q/3463/373&quot;&gt;the question to spoonerize words&lt;/a&gt;, we got the examples:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Example: A lack of pies = A pack of lies. Bad salad = Sad ballad (ish) :)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;3 of the early solutions produced &lt;code&gt;lA pack of ies&lt;/code&gt;, 2 of them ruby, 1 perl. I didn't test the haskell, J and C# solution, because I don't have them installed.&lt;/p&gt;&#xA;&lt;p&gt;It's not the first time, that I stumbled over easy to find bugs. Of course, it is always hard to avoid all traps from complicated border cases, but such obvious failings?&lt;/p&gt;&#xA;&lt;p&gt;In my opinion we should be honest in providing only answers which work, or disclosure ourselves known shortcomings.&lt;/p&gt;&#xA;&lt;p&gt;My voting policy is normally to upvote every answer which is better than my own one, but I would like to be sure to only vote on working solutions. I don't want to install every competing language on my machine, to perform basic tests on code, I can only guess about (haskell, J, C# for me - maybe Scala, bash for you).&lt;/p&gt;&#xA;&lt;p&gt;And I suggest to routinely test competing code. If we allow too much errors, the answers which only pretend to solve the puzzle will win.&lt;/p&gt;&#xA;&lt;p&gt;Fun and entertainment only work, if you take it seriously. :)&lt;/p&gt;&#xA;&lt;h3&gt;update:&lt;/h3&gt;&#xA;&lt;p&gt;Well - maybe my view is too much biased from my first interpretation of what the challenge is, and the other people did not provide faulty answers, but just interpreted the question in a different manner. I can hardly leave my perspective, but I have to admit, that my interpretation of the question can be questioned.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;... Write a program to spoonerise two words ...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;In this case, my whole concern shrinks, and becomes: Don't answer ambigious questions, but wait for the master of the game to clarify the meaning, maybe by downvoting and voting to close.&lt;/p&gt;&#xA;" OwnerUserId="373" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2011-08-22T07:49:04.607" Title="We need more discipline and downvotes" Tags="|discussion|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="398" PostTypeId="2" ParentId="397" CreationDate="2011-08-20T17:22:56.637" Score="8" Body="&lt;p&gt;As a general rule I am a big fan of down-votes on all the sites, they are where the cruft is cleared: up-votes only sort the workable answers.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;When I take the time to test solutions of competitors, I sometimes find failing answers, which not even solve the examples. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I trust that you point out these deficiencies in the comments? Because testing &lt;em&gt;does&lt;/em&gt; take time and effort and I only do it religiously when I &lt;em&gt;posed&lt;/em&gt; the problem.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;In my opinion we should be honest in providing only answers which work, or disclosure ourselves known shortcomings. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Quite so. I personally find that a list of the limitation of a particular solution shows an understanding of the &lt;em&gt;problem&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There have been several discussion of the &quot;how and why&quot; of voting on CodeGolf.SE. It is in some ways less clear cut than the on factual Stack Exchange sites. My personal policy runs to&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Acceptance&lt;/strong&gt; for the submission that &quot;wins&quot; (i.e. shortest in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, wins the round robin in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, etc...)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Up-votes&lt;/strong&gt; for submissions that meet the spec, take a creditable crack at winning, I more or less understand and are clever or interesting in some way.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Down-votes&lt;/strong&gt; for submissions which do not meet the spec and the author will not correct, or make no attempt to win (i.e. un-golfed submissions to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; (which is to be distinguished from a golfed submission in a wordy language)), try to demonstrate how &quot;clever&quot; the author is by breaking the spirit (those were funny in the late paleolithic when they were first discovered).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78" LastActivityDate="2011-08-20T17:22:56.637" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="399" PostTypeId="2" ParentId="397" CreationDate="2011-08-22T07:49:04.607" Score="1" Body="&lt;p&gt;I agree that ambiguous questions should be clarified before answering. We had a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/3397&quot;&gt;recent case&lt;/a&gt; which gathered a handful of answers while the question was still so vague that I couldn't say whether they actually solved the problem or not. (It could still do with improvement).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In such a case I think there's no doubt that it's reasonable to down-vote the question; and I can certainly see a case for down-voting answers which don't seem to be making reasonable assumptions about how the question is likely to be fixed. OTOH I personally wouldn't down-vote questions which explicitly state their assumptions and then solve their interpretation.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2011-08-22T07:49:04.607" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="400" PostTypeId="2" ParentId="202" CreationDate="2011-08-22T22:24:32.480" Score="5" Body="&lt;p&gt;&lt;a href=&quot;https://www.alwaysdata.com/features/frameworks/&quot; rel=&quot;nofollow&quot;&gt;alwaysdata.com&lt;/a&gt; has a free 10MB account and supports multiple versions of at least these&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;PHP&#xA;Python   2.4, 2.5, 2.6, 2.7, 3.1&#xA;Ruby     1.8.6, 1.8.7, 1.9.2&#xA;Perl     5.10&#xA;Java&#xA;Lua      5.1&#xA;OCaml&#xA;Erlang&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Also many others that people have used for golfing, such as bash/sh/csh/ksh/tcsh/fish/zsh/dc&lt;/p&gt;&#xA;" OwnerUserId="95" LastActivityDate="2011-08-22T22:24:32.480" CommentCount="0" CommunityOwnedDate="2011-08-22T22:24:32.480" ContentLicense="CC BY-SA 3.0" />
  <row Id="401" PostTypeId="2" ParentId="202" CreationDate="2011-08-24T07:41:36.520" Score="2" Body="&lt;p&gt;&lt;a href=&quot;http://www.simplyscala.com/&quot; rel=&quot;nofollow&quot;&gt;Simply Scala&lt;/a&gt; is a webinterface for interactive coding experience. A REPL (run-evaluate-print-loop).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You don't need to extend the App-class like in IDEONE.&lt;/p&gt;&#xA;" OwnerUserId="373" LastActivityDate="2011-08-24T07:41:36.520" CommentCount="0" CommunityOwnedDate="2011-08-24T07:41:36.520" ContentLicense="CC BY-SA 3.0" />
  <row Id="403" PostTypeId="1" CreationDate="2011-08-25T15:43:14.780" Score="18" ViewCount="905" Body="&lt;p&gt;I posted this on the &lt;a href=&quot;http://chat.stackexchange.com/rooms/307/golf-puzzle-lab&quot;&gt;Puzzle Lab chat&lt;/a&gt;, but it didn't get much response (except for Gareth...thanks Gareth!).  Thus, I'm posting it here.  Please feel free to chat on the Puzzle Lab if you have input that doesn't fit well here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hello &lt;strike&gt;Puzzle Lab&lt;/strike&gt; Meta-People, in order to level the code-golf playing field for verbose languages, I've been thinking of introducing a new branch of code-golf called &lt;strong&gt;atomic-code-golf&lt;/strong&gt;.  Here, &lt;strong&gt;atomic&lt;/strong&gt; means &quot;Of or forming a single irreducible unit or component of code.&quot;  Thus, the &quot;atomic-code-golf&quot; score of a piece of code is the sum of its atomic pieces.  In such cases where the atomic-code-golf score is a tie, then we fall back to the code-golf score to determine the winner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For a simple example, take a line of the Java Hello World code: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;System.out.println(&quot;Hello World!&quot;);//35 points&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In this code &lt;code&gt;System&lt;/code&gt;, &lt;code&gt;out&lt;/code&gt;, &lt;code&gt;println&lt;/code&gt;, and each character in the string &lt;code&gt;&quot;Hello World!&quot;&lt;/code&gt; would all be atomic components of the code, and would thus count as 1 point.  In contrast, &lt;code&gt;.&lt;/code&gt; and &lt;code&gt;;&lt;/code&gt; serve as separaters of atomic components, and would thus not count.  Thus, the code might be counted as:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Sop(&quot;Hello World!&quot;)//19 points &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now, some may argue that &lt;code&gt;&quot;&lt;/code&gt;, &lt;code&gt;(&lt;/code&gt;, and &lt;code&gt;)&lt;/code&gt; are groupers of atomic components, and so they should not count either.  Thus, here are my broad level questions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Would people like this kind of contest?&lt;/li&gt;&#xA;&lt;li&gt;What should an atomic component be defined as?&lt;br&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;These are components that will be counted as 1 point even if it takes more than that to write them.  &lt;/li&gt;&#xA;&lt;li&gt;Example: Object, keyword, and variable names such as &lt;code&gt;System&lt;/code&gt;, &lt;code&gt;class&lt;/code&gt;, and &lt;code&gt;myInt&lt;/code&gt; in Java code.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;What should a non non-atomic component be defined as?&lt;br&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;These are components that will be counted as 0 points even though you need them to make the program compile.  &lt;/li&gt;&#xA;&lt;li&gt;Example: Separators such as &lt;code&gt;;&lt;/code&gt;, &lt;code&gt;.&lt;/code&gt;, spaces, tabs, and newlines in Java code&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What are the language-agnostic regular expressions we will need to atomic-code-golf score a language?  Initially, I'm thinking we'll need the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What is the regular expression that will match any component that should be counted at full length (such as a String)? For example, in the example of a String in Java, this should handle the string &lt;code&gt;&quot;\&quot;&quot;&lt;/code&gt; where &lt;code&gt;\&quot;&lt;/code&gt; is escaped. Any segment of code matching this regular expression will be counted at its full normal code-golf score.&lt;/li&gt;&#xA;&lt;li&gt;Without considering matches from the first case, what is the regular expression of an atomic component (such as a variable name, Object name, keyword, number, etc.)? Each match on this regular expression will count as 1 point no matter how many characters are used.&lt;/li&gt;&#xA;&lt;li&gt;Again without considering matches from the first case, what is the regular expression for a non-atomic character (such as &lt;code&gt;;&lt;/code&gt;, &lt;code&gt;,&lt;/code&gt;, etc.)? These will be counted as 0 when scoring a piece of code.&lt;/li&gt;&#xA;&lt;li&gt;All remaining code-segments that do not match the above regular expressions will be counted at their full normal code-golf scores.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What are the above regular expressions in your favorite language?  I, or anyone else who wishes, will strive to keep an updated alphabetical list of the regular expressions to be used for each language in the &lt;strong&gt;Regular Expressions&lt;/strong&gt; section of this question.  These will be revised as necessary to make the counts fair across all languages.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Once we've answered the above questions, I think the first question needs to be to write an atomic-code-golfed piece of code that figures out the atomic-code-golf score of a program in any language.  The input for this program will be the code in question and the regular expressions needed to compute that code's atomic-code-golf score.  The output will be the code's atomic-code-golf and code-golf scores (for the tie-breaker).  An additional requirement will be that this needs to be accessible online so that future atomic-code-golf scores can be computed using this program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please let me know what you think, and any input is greatly appreciated!!!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Online scorer&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here is a tool to generate your atomic code-golf score.  This will be updated/revised as more regular expressions are implemented and revised:  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;http://jsfiddle.net/briguy37/Lp8wa/&quot; rel=&quot;nofollow&quot;&gt;Fiddle for scoring your code&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Currently Supports:  GolfScript, JavaScript&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Regular Expressions:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;GolfScript:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Full Length Code: &#xA;&lt;ul&gt;&#xA;&lt;li&gt;RegExp: &lt;code&gt;/(&quot;((\\&quot;)|([^&quot;]))*&quot;)/&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Matches on Strings: &lt;code&gt;&quot;test&quot;&lt;/code&gt; or &lt;code&gt;&quot;\&quot;test\&quot;&quot;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Atomic Component:&lt;br&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;RegExp: &lt;code&gt;/and|or|xor|print|puts|rand|do|while|until|if|abs|zip|base/&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Matches on reserved words:  &lt;code&gt;and&lt;/code&gt; &lt;code&gt;or&lt;/code&gt; &lt;code&gt;xor&lt;/code&gt; &lt;code&gt;print&lt;/code&gt; &lt;code&gt;puts&lt;/code&gt; &lt;code&gt;rand&lt;/code&gt; &lt;code&gt;do&lt;/code&gt; &lt;code&gt;while&lt;/code&gt; &lt;code&gt;until&lt;/code&gt; &lt;code&gt;if&lt;/code&gt; &lt;code&gt;abs&lt;/code&gt; &lt;code&gt;zip&lt;/code&gt; &lt;code&gt;base&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Non-Atomic Component:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;none&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;JavaScript:&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Full Length Code:&lt;br&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;RegExp: &lt;code&gt;/(&quot;((\\&quot;)|([^&quot;]))*&quot;)|('((\\')|([^']))*')/&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Matches on Strings:  &lt;code&gt;&quot;test&quot;&lt;/code&gt;, &lt;code&gt;&quot;\&quot;test\&quot;&quot;&lt;/code&gt;, &lt;code&gt;'test'&lt;/code&gt;, &lt;code&gt;'\'test\''&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Atomic Component:&lt;br&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;RegExp: &lt;code&gt;/[a-zA-Z_$][0-9a-zA-Z_$]*/&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Matches on variable/object names:  &lt;code&gt;var&lt;/code&gt;, &lt;code&gt;myVarName&lt;/code&gt;, &lt;code&gt;Math&lt;/code&gt;, &lt;code&gt;Array&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Non-Atomic:&lt;br&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;RegExp: &lt;code&gt;/;|\.|\s|,/&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Matches on separators:  period, comma, semicolon, space, newline, tab&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="2334" LastEditorUserId="56656" LastEditDate="2020-02-03T17:32:58.933" LastActivityDate="2020-02-03T17:32:58.933" Title="New Code-Golf metric: Atomic-Code-Golf" Tags="|discussion|winning-criteria|" AnswerCount="2" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="404" PostTypeId="2" ParentId="388" CreationDate="2011-08-25T18:46:59.880" Score="2" Body="&lt;p&gt;I'd go with option &lt;strong&gt;F&lt;/strong&gt;.  Here are the rules for option &lt;strong&gt;F&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Requirements:&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Askers MUST provide one or more explicit input test cases to be optimized.&lt;br&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For example, if the input to the program is &lt;code&gt;x&lt;/code&gt;, the question could be specified to optimize for inputs &lt;code&gt;x=5&lt;/code&gt;, &lt;code&gt;x=50&lt;/code&gt;, and &lt;code&gt;x=500&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Each code must compute the average &quot;weight&quot; of their code across all input cases.&lt;br&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The weight is determined by how many operations occur throughout the course of running of the program with the specified inputs.  &lt;/li&gt;&#xA;&lt;li&gt;We'll have to nail down a fair definition of what constitutes an operation in all competing languages.&lt;/li&gt;&#xA;&lt;li&gt;We'll probably have to write a program that produces an average score given the input conditions, the language-type, and the code.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;A &lt;strike&gt;simple&lt;/strike&gt; relatively-simple JavaScript example:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test input cases:&lt;/strong&gt; &lt;code&gt;x=5&lt;/code&gt;, &lt;code&gt;x=50&lt;/code&gt;, and &lt;code&gt;x=500&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Code:&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;for(i=0; i&amp;lt;x; i++){&#xA;    f(x);&#xA;}&#xA;&#xA;function f(x){&#xA;    y=x;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;i=0&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Executed once per loop:  &lt;code&gt;multiplier = 1, 1, 1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;i&lt;/code&gt;: 1 point (to use the variable)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;=&lt;/code&gt;: 1point (to use an operator)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;0&lt;/code&gt;: 1point (to use a number)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Score&lt;/strong&gt;: &lt;code&gt;3, 3, 3&lt;/code&gt; (same score for each of the 3 runs)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;i&amp;lt;x&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Executed once per iteration plus 1 time (when it evaluates to false):   &lt;code&gt;multiplier = 6, 51, 501&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;i&amp;lt;x&lt;/code&gt;: 3 points (by reasoning in 1)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Score&lt;/strong&gt;: &lt;code&gt;18, 153, 1503&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;i++&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Executed once per iteration:  &lt;code&gt;multiplier = 5, 50, 500&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;i++&lt;/code&gt;: 3 points&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Score&lt;/strong&gt;: &lt;code&gt;15, 150, 1500&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;function f(x){..}&lt;/code&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;function f(x)&lt;/code&gt;: 0 points (function calls and parameters only count when called)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;y=x&lt;/code&gt;: 3 points&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;function weight&lt;/strong&gt;: 3 points (could also have been an equation if there was a loop based on &lt;code&gt;x&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Score&lt;/strong&gt;: &lt;code&gt;0 points&lt;/code&gt; (Only figured in when the function is called)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;f(x)&lt;/code&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Executed once per iteration:  &lt;code&gt;multiplier = 5, 50, 500&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;f&lt;/code&gt;: 4 points (1 point for the function call plus 3 points for the function weight from step 4)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(x)&lt;/code&gt;: 1 point (cost of passing the variable into the function)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Score&lt;/strong&gt;: &lt;code&gt;25, 250, 2500&lt;/code&gt; &lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Final Score: 2041 Points&lt;/strong&gt; = 6123/3 = (61+556+5506)/3 &lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Conclusion&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This would be obviously be very difficult to score by hand.  However, we could make a program that scores each competing language.  This would take a good amount of effort, but with teamwork we could do it.  Also, as opposed to code-golf I think this would actually be a valuable metric outside of just gaming, so it might just be a worthwhile venture...&lt;/p&gt;&#xA;" OwnerUserId="2334" LastActivityDate="2011-08-25T18:46:59.880" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="405" PostTypeId="2" ParentId="403" CreationDate="2011-08-26T13:39:34.653" Score="2" Body="&lt;h1&gt;Test-Box For Common Language Components (Please edit freely)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Based on @migimaru's comment, the purpose of this spot is to gather items across code that should have the same or similar code scores.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Variable Declarations&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Java&lt;br&gt;&#xA;&lt;code&gt;&amp;lt;type&amp;gt; test;&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;JavaScript&lt;br&gt;&#xA;&lt;code&gt;var a;&lt;/code&gt; &lt;em&gt;private variable&lt;/em&gt;&lt;br&gt;&#xA;&lt;code&gt;b;&lt;/code&gt; &lt;em&gt;global variable&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Operators&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Arithmetic: Addition, Subtraction, Multiplication, Division&lt;br&gt;&#xA;&lt;code&gt;+, -, *, /&lt;/code&gt;:  JavaScript, Java&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Logic: AND, OR, NOT&lt;br&gt;&#xA;&lt;code&gt;&amp;amp;&amp;amp;, ||, !&lt;/code&gt;:  JavaScript, Java&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;For Loop (loop 10 times)&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Java, JavaScript&lt;br&gt;&#xA;&lt;code&gt;for(..;..;..)..;&lt;/code&gt; &lt;em&gt;Required minimum syntax&lt;/em&gt;&lt;br&gt;&#xA;&lt;code&gt;for(..;..;..){..};&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;While Loops&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Java, JavaScript&lt;br&gt;&#xA;&lt;code&gt;while(..)..;&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;while(..){..}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;If statements&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Java, JavaScript&lt;br&gt;&#xA;&lt;code&gt;if(..)..;&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;if(..){..}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="2334" LastEditorUserId="15022" LastEditDate="2014-03-09T00:21:36.217" LastActivityDate="2014-03-09T00:21:36.217" CommentCount="2" CommunityOwnedDate="2011-09-22T15:58:13.023" ContentLicense="CC BY-SA 3.0" />
  <row Id="407" PostTypeId="1" CreationDate="2011-08-31T13:23:04.847" Score="5" ViewCount="227" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot;&gt;code-challenge&lt;/a&gt; blurb states:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A code challenge is a competition for creative ways to solve a&#xA;  programming puzzle for an &lt;strong&gt;objective criterion&lt;/strong&gt; other than code&#xA;  size.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/faq#questions&quot;&gt;FAQ&lt;/a&gt; states:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;All questions on this site, whether a programming puzzle or a code&#xA;  golf, should have …&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;An objective primary winning criterion, so that it is possible to&lt;br&gt;&#xA;  indisputably decide which entry should win.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;However, it seems that almost every code-challenge question has a win condition of, as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/3420/400th-question-celebration-challenge&quot;&gt;Briguy37 put it&lt;/a&gt;, &quot;The most creative code wins!!! In this case, creativity will be measured by votes.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Personally, I love the answers that come out of these questions - people providing interesting bits of code, instead of just min/maxing their way to an unreadable golfscript - but that's just my opinion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I created this question to ask&lt;/strong&gt;: should the FAQ and code-challenge blurb be changed so as not to require some sort of win condition beyond meeting the conditions set forth in the question, and winning the vote of popular opinion among their fellow coders?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the answer is no, then we should probably come up with a boilerplate version of Briguy37's win condition for people to easily paste into their questions.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Edit: I've been browsing through a batch of related questions, such as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/305/what-makes-winning-criteria-objective&quot;&gt;What makes winning criteria &quot;objective&quot;?&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/110/a-modest-proposal-the-popularity-contest-tag&quot;&gt;A Modest Proposal: the [popularity-contest] tag&lt;/a&gt;, and it looks like other people have observed the pull between the golf and the entertaining code as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;No matter what the theory was when people were writing the FAQ and coming up with rules, the fact remains that the de facto rule of code-challenge questions is: a lot of people want to write/read interesting code solutions, and not have to come up with some tacked-on win condition.&lt;/p&gt;&#xA;" OwnerUserId="401" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2019-03-26T19:58:38.980" Title="FAQ/code-challenge don't seem to match actual code challenge questions" Tags="|discussion|" AnswerCount="4" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="408" PostTypeId="2" ParentId="407" CreationDate="2011-08-31T16:05:39.260" Score="5" Body="&lt;p&gt;Popularity contests are not &quot;objective&quot;. It then becomes a people-pleasing contest, rather than fulfilling some useful objective criteria.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Personally I prefer that small code size should be the only criterion (&quot;code golf&quot;), but not everyone wants to post code golf, so the &quot;objective criterion&quot; criterion is to allow other kinds of contests to work, but still not turn into a popularity contest.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;ETA: I wanted to address the whole &quot;tacked-on win condition&quot; you mentioned at the end. To my understanding, the &lt;em&gt;point&lt;/em&gt; of this site is to have coding challenges that are more meaningful than (subjectively) &quot;interesting&quot;, and so objective criteria are not a &quot;tack-on&quot;, but the whole purpose of the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, I should give you some context as to why I'm so adamant about the &quot;objective&quot; requirement. (Though, in this context, I'm speaking as a user, not a moderator.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I was one of the earliest users on Stack Overflow, and back in those days, the beta users had a lot of room to shape the culture of the site. One of the things that quickly surfaced was that a certain category of posts got a lot of votes. I called those posts &quot;popularity posts&quot;. They involved things like &quot;What's the funniest programming cartoon&quot; and stuff like that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem is, they're popular because they are &quot;soft&quot; stuff---they don't require any real programming knowledge. And it's totally unhelpful for a site like Stack Overflow.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem with encouraging &quot;popular&quot; questions (to the exclusion of real &quot;non-soft&quot; questions) on Programming Puzzles &amp;amp; Code Golf is that you don't learn any techniques from them. &quot;Elegant&quot; or &quot;creative&quot; are not techniques. How to make the shortest or fastest code are.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One of my favourite puzzles actually comes from The Art of Computer Programming, where you're called upon to write the fastest MIX/MMIX implementation of the Easter calculation algorithm. The point of specifying the architecture (MIX/MMIX) in this case is to make the notion of &quot;fastest&quot; indisputable---anybody can reproduce how long it takes to run such a program under MIX/MMIX.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, while the &lt;em&gt;idea&lt;/em&gt; of making everything objective is nice, in practice we run into difficulties---for example, many users just upvote without verifying the answer (but if we only upvote answers we can verify, then obscure languages get disadvantaged). This remains an open problem, but I feel a solution has to come from the place of making better ways for users to verify solutions---and not by dodging the &quot;objective criterion&quot; policy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Okay, I've rambled on enough. :-)&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="3" LastEditDate="2011-08-31T16:40:10.853" LastActivityDate="2011-08-31T16:40:10.853" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="409" PostTypeId="2" ParentId="407" CreationDate="2011-09-01T08:29:40.710" Score="3" Body="&lt;p&gt;I've just gone through the first page of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;. Out of 15 puzzles, 5 are also tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;; two have other objective or intended-to-be objective winning criteria (respectively ratio of output to input; and algorithmic complexity); three have subjective winning criteria; and five have no winning criteria at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All five of those which have no winning criteria, and two of the three with subjective criteria, date from the early days of the site (no later than March). The only recent question which has a subjective criterion is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/3245/creative-programming&quot;&gt;Creative Programming&lt;/a&gt;; I would say that it's a case where &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/397/we-need-more-discipline-and-downvotes&quot;&gt;We need more discipline and down-votes&lt;/a&gt; applies.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2011-09-01T08:29:40.710" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="410" PostTypeId="1" CreationDate="2011-09-05T07:41:07.503" Score="4" ViewCount="179" Body="&lt;p&gt;This site gets a relatively small number of posts.  Could we contact IDEOne or somebody, and get a script going to test people's code automatically?  Maybe put up a &quot;powered by&quot; logo somewhere?&lt;/p&gt;&#xA;" OwnerUserId="2180" LastEditorUserId="68942" LastEditDate="2021-06-09T05:31:11.483" LastActivityDate="2021-06-09T05:31:11.483" Title="Can we find a way to automatically execute people's code?" Tags="|feature-request|status-declined|" AnswerCount="2" CommentCount="5" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="411" PostTypeId="2" ParentId="410" CreationDate="2011-09-05T14:48:54.153" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/362/george-edison&quot;&gt;George Edison's&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/170/737&quot;&gt;User script&lt;/a&gt; provides the ability to run some code (using Codepad, I think).&lt;/p&gt;&#xA;" OwnerUserId="737" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2011-09-05T14:48:54.153" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="412" PostTypeId="2" ParentId="410" CreationDate="2011-09-09T02:50:31.550" Score="0" Body="&lt;p&gt;IDEONE expects some boilerplate for scala for example, naming conventions and a main-method, and a specific scala version. Enforcing compatibility would need to take this into account. I'm pretty sure, for other languages the situation is similar, isn't it? C, C++, Java, C#? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Maybe it isn't that restricted for scripting languages like ruby, python, perl, ... ?&lt;/p&gt;&#xA;" OwnerUserId="373" LastActivityDate="2011-09-09T02:50:31.550" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="413" PostTypeId="2" ParentId="407" CreationDate="2011-09-10T01:58:10.443" Score="1" Body="&lt;p&gt;I guess puzzles asking for creative solutions should have an objective puzzle to solve. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Telling a story in the code is a nice exception but only works one time. There was another &lt;a href=&quot;https://codegolf.stackexchange.com/q/3420/373&quot;&gt;creativity question about the 400th Question&lt;/a&gt; which had an objective challenge to solve in being exactly 400 bits long. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The number of upvotes is a better measurement to make somebody the winner than whether it is your friend or not the competitor for being the king of the site. It should be clear, that this is the criterium to decide which answer is accepted, and a description, why somebody should be upvoted, should be given. (Surprising solution, elegant solution). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you don't like such puzzles, don't partizipate. If they appear too often, vote them down, and reactivate this thread. :)&lt;/p&gt;&#xA;" OwnerUserId="373" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2011-09-10T01:58:10.443" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="414" PostTypeId="2" ParentId="373" CreationDate="2011-09-13T17:04:15.887" Score="4" Body="&lt;p&gt;Just going to throw this out there as an idea. Why not try something a little more mixed?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Keep the intent of &quot;lowest character count&quot; (or similar goal), but as an additional criteria, the character count has to satisfy some extra condition.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, instead of &quot;Code must be 100 characters&quot;, it could be &quot;Shortest code with a character count that is a multiple of 10&quot;. Then, if you ended up with, say, 97 characters, you &lt;em&gt;could&lt;/em&gt; pad the code an extra 3 characters for 100. Or you could see if you could cut off a whole 7 characters to end with 90 for a better victory. The end result is that you do get results that end in whole numbers, but still retains reasoning that inhibits putting fluff for fluff's sake.&lt;/p&gt;&#xA;" OwnerUserId="2414" LastActivityDate="2011-09-13T17:04:15.887" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="415" PostTypeId="2" ParentId="403" CreationDate="2011-09-22T01:03:25.350" Score="1" Body="&lt;p&gt;In Scala, you may express a left fold like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(a /: b)(_ c _) &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A typical example would be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(0 /: List (3, 5, 9)) (_ + _)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;with the result &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;res0: Int = 17&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;better readable for beginners in the form:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(0 /: List (3, 5, 9)) ((a, b) =&amp;gt; a + b)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;but since a and b are only used once in the right part in the order they're comming in, they don't need names.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Translated to Java, it would look like that:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;int cnt = 0;&#xA;for (int i : new int [] {3, 5, 9}) {&#xA;    cnt += i;&#xA;}&#xA;return cnt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So the token count would be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;    (0 /: List(3, 5, 9)(_ + _) &#xA;    12 3  4   567 89 abcd e fg with 1,5,7,9,b,c,g being &#xA;    // a kind of grouping delimiters; compared to:&#xA;&#xA;    int cnt = 0;    &#xA;    //1 2   3 45 // g-delims (5)=1&#xA;    for (int i : new int [] {3, 5, 9}) {&#xA;    //1 23   4 5 6   7   8  9ab cd efg h (g: 259bdfg=7)&#xA;    cnt += i;&#xA;            //1 2  34  (=1)&#xA;    }&#xA;    // 1 = 1&#xA;    return cnt;&#xA;    // 1   2  3 gdelim:1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So I count 30(-10=20) tokens against 16(-7=9). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So there are places, where java will still not compete, but what my main concern is, is, that the structure of the languages don't always fit. I'm not sure if everybody would count the tokens in the same way in Scala, and how to reach that goal.&lt;/p&gt;&#xA;" OwnerUserId="373" LastEditorUserId="373" LastEditDate="2011-09-23T02:29:51.363" LastActivityDate="2011-09-23T02:29:51.363" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="416" PostTypeId="1" CreationDate="2011-09-22T22:41:58.060" Score="6" ViewCount="184" Body="&lt;p&gt;Related to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/75/what-should-the-policy-on-improving-or-incorperating-other-peoples-solutions-be&quot;&gt;a previous question&lt;/a&gt;, but sufficiently different that I think it merits its own discussion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now that I've hit 2000 rep I have access to some mod tools, which include the ability to approve or reject edits made by users with less than 1000 rep. There are four outstanding, some of them from a while back.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What should we do with edits like this? I don't seem to have the ability to promote them to answers, so the options are to accept them, reject them, or reject them and summarise the changes in a comment so that the original author can incorporate them or not.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2011-09-24T09:45:53.467" Title="Edits to other people's answers" Tags="|discussion|editing|" AnswerCount="3" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="417" PostTypeId="2" ParentId="416" CreationDate="2011-09-22T22:43:45.013" Score="5" Body="&lt;p&gt;Of the three options I've suggested, I favour the third: to add comments summarising the proposed changes for the original authors to deal with. It's not really fair on the people who made the edits, because they won't get any rep, but it's more in line with the way improvements to someone else's answer are proposed in general on this site.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2011-09-22T22:43:45.013" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="418" PostTypeId="2" ParentId="416" CreationDate="2011-09-22T23:03:56.070" Score="6" Body="&lt;p&gt;I've found to be trickier on CodeGolf.SE than on other sites.&lt;/p&gt;&#xA;&lt;p&gt;I'll start by dividing the problem into three groups&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;change only the character count&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;These are relatively easy, just check with George's script.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;change the text, but not the solution&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Substantive edits that don't touch the solution are about the same as on other site. Just check that they really do improve the question in terms of grammar, spelling, usage, clarity, etc.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;change the solution&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is the place where I'm stuck. When we were playing on Stack Overflow people generally did not edit each others work, but left helpful comments---your third solution comes down to enforcing that approach.&lt;/p&gt;&#xA;&lt;p&gt;I started leaving them under the impression that the authors would be see them and take care of it, but I'm not sure that this is the case.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;em&gt;Aside:&lt;/em&gt; The whle topic makes me feel guilty because I've been studiouly ignoring some of these suggested edits.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2011-09-22T23:03:56.070" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="419" PostTypeId="2" ParentId="416" CreationDate="2011-09-24T09:45:53.467" Score="2" Body="&lt;p&gt;I've seen a few proposed edits where &lt;strong&gt;a second, highly related solution is edited into the same answer below the original&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This can perhaps be OK, or is at least safer, since the original is not touched and there is an &quot;alternate&quot; version which the OP can choose to fold into their original answer via editing?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Dunno, just throwing it out there as an idea, since I didn't see it listed in the other answers here.&lt;/p&gt;&#xA;" OwnerUserId="97" LastActivityDate="2011-09-24T09:45:53.467" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="420" PostTypeId="1" AcceptedAnswerId="421" CreationDate="2011-10-06T18:15:17.783" Score="3" ViewCount="98" Body="&lt;p&gt;I'm a moderator on &lt;a href=&quot;http://programmers.stackexchange.com&quot;&gt;Programmers&lt;/a&gt;, and we just received a question asking for advice and feedback about a code contest the poster is designing:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://softwareengineering.stackexchange.com/questions/112800/would-this-work-as-a-new-obfuscated-c-code-contest&quot;&gt;Would This Work As A New Obfuscated C Code Contest?&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Seeing as you fine folks, who have experience in such things, would likely be in the best place to provide useful feedback, I was wondering if these types of questions are on-topic here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If so, can this question be migrated here?&lt;/p&gt;&#xA;" OwnerDisplayName="user86" LastEditorUserId="-1" LastEditDate="2017-04-12T07:32:01.007" LastActivityDate="2011-10-06T19:24:15.120" Title="Are questions about designing code contests on-topic here?" Tags="|discussion|policy|challenges|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="421" PostTypeId="2" ParentId="420" CreationDate="2011-10-06T18:50:28.143" Score="2" Body="&lt;p&gt;I don't think we have a policy for this yet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The things that are explicitly &lt;em&gt;on-topic&lt;/em&gt; are&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Challenges with objective winning conditions of which code-golf is an exemplar&lt;/li&gt;&#xA;&lt;li&gt;Tips on golfing in [Foo]&quot; if community wiki.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;We also provide peer assistance in writing challenges intended for the site in&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The &lt;a href=&quot;http://chat.stackexchange.com/rooms/307/golf-puzzle-lab&quot;&gt;&quot;puzzle lab&quot;&lt;/a&gt; chat&lt;/li&gt;&#xA;&lt;li&gt;The &quot;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/336/proposed-questions-sandbox-mk-ii&quot;&gt;sandbox&quot;&lt;/a&gt; on meta&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your user would certainly be welcome in the chat.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2011-10-06T18:50:28.143" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="422" PostTypeId="2" ParentId="420" CreationDate="2011-10-06T19:24:15.120" Score="1" Body="&lt;p&gt;I am the one who posted it. Where's the chat?&lt;/p&gt;&#xA;" OwnerUserId="2885" LastActivityDate="2011-10-06T19:24:15.120" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="424" PostTypeId="1" CreationDate="2011-10-26T17:20:04.753" Score="11" ViewCount="244" Body="&lt;h2&gt;&lt;strong&gt;&lt;em&gt;Whereas&lt;/em&gt;&lt;/strong&gt;&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The site has suffered from low traffic for weeks&lt;/li&gt;&#xA;&lt;li&gt;We've been in beta for 271 days and &lt;a href=&quot;http://area51.stackexchange.com/proposals/4570/code-golf-programming-puzzles&quot;&gt;our numbers are marginal&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Too many recent question have been both too easy and poorly specified&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/2159632#2159632&quot;&gt;Users have noted&lt;/a&gt; that we don't hve what it takes to get out of beta&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;we are seeking users willing to commit to improving the site.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Your mission&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.youtube.com/watch?v=AbUn_h9I088&quot; rel=&quot;nofollow noreferrer&quot;&gt;should you chose to accept it&lt;/a&gt;&amp;mdash;is&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;To write one (1) really &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/212/78&quot;&gt;good&lt;/a&gt; programming &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/93/78&quot;&gt;puzzle&lt;/a&gt; of any kind and post it to the site sometime in the next two (2) weeks.&lt;/li&gt;&#xA;&lt;li&gt;To answer at least two of these puzzles within one (1) week of their posting with a completely compliant, well written answer.&lt;/li&gt;&#xA;&lt;li&gt;To vote (up or down) on at least four (4) of these questions, and if voting down to truthfully and tactfully explain why.&lt;/li&gt;&#xA;&lt;li&gt;To vote (up or down) on at least eight (8) answers to these questions, and if voting down to truthfully and tactfully explain why.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;In addition to the existing &lt;a href=&quot;http://chat.stackexchange.com/rooms/307&quot;&gt;puzzle lab chat&lt;/a&gt; and the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/423/78&quot;&gt;meta sandbox for questions&lt;/a&gt;, the answers to this post can serve as a place for vetting proposed questions and coordinating activities related to &lt;strong&gt;The Push&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Per out practice during the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/298/78&quot;&gt;first Push&lt;/a&gt;, puzzles submitted as part of this event may (should?) be marked &quot;2P5&quot; &lt;em&gt;if&lt;/em&gt; they have been discussed in the above places to insure high quality.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2011-10-29T16:49:45.613" Title="Announcing the CodeGolf.SE Second Periodic Premier Programming Puzzle Push" Tags="|discussion|challenge-quality|site-health|puzzle-push|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="427" PostTypeId="2" ParentId="424" CreationDate="2011-10-29T16:49:45.613" Score="3" Body="&lt;p&gt;This is my first attempt at writing a question:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Snake Console Game, Code Golf&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;b&gt;Objective:&lt;/b&gt;&#xA;To recreate the classic game of snake, in the console using a language of your choice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Snake_(video_game&quot; rel=&quot;nofollow&quot;&gt;http://en.wikipedia.org/wiki/Snake_(video_game&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;b&gt;Rules:&lt;/b&gt;&#xA;The console should be the standard console size of your operating system(80x25 on windows).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard libraries only.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input will be delivered using the arrow keys and will move the snakes head in that direction.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The snake should move in the direction it is facing until the user changes that direction. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The snake should not be able to turn 180 degrees in one motion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When game over the program will end.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Game over is defined as the snake hitting the wall(edge of the console) of the console or itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The game will refresh at least twice a second and at most 20 times a second(this won't actually be measured, just don't make it ridiculously fast or slow).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The snake will start with a length of 3 and may start anywhere on screen (as long as it is not gameover in 2 turns without pushing any buttons).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each part of the snakes body should be represented by an x.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An 'O' will appear randomly somewhere within the console window(not within the snakes body), when the snakes head touches this, it will become one piece longer(from the next refresh onwards).  The snake should not stop when it hits the O it should continue through e.g:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;xxx O&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;2.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; xxxO&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;3.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; xxxx&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;4.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  xxxx&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I will test the game up to about the snake being 10-15 in length, though it should theoretically be able to be played until the snake fills the console.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Winner is the program with the lowest number of characters, with at least one upvote.(I won't be able to test every operating system/language so I'm relying on an upvote meaning it is good, is this acceptable?)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also it is not required to draw the very bottom right character in the console, though the O and the snake may still occupy that space&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;b&gt;Questions/comments?&lt;/b&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have done this in a couple of hours in c++(semi-golfed) in about a hundred lines or so, so it shouldn't be too hard.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also I'm unsure about whether to make it windows only, makes it easier to assess and evens the field a bit but probably leaves a lot of people unable to participate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Are interactive code golfs ok, not seen too many of them, is it because they are hard to judge?&lt;/p&gt;&#xA;" OwnerUserId="1412" LastActivityDate="2011-10-29T16:49:45.613" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="430" PostTypeId="1" AcceptedAnswerId="431" CreationDate="2011-11-23T11:57:58.383" Score="2" ViewCount="146" Body="&lt;p&gt;Is there a default licence applied to code included in an answer, and if so, what is it?&lt;/p&gt;&#xA;" OwnerUserId="3077" LastActivityDate="2014-04-23T09:29:32.537" Title="What is the licence of submitted code?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="431" PostTypeId="2" ParentId="430" CreationDate="2011-11-23T14:58:22.837" Score="7" Body="&lt;p&gt;Yes. All submissions to the Stack Exchange Network are automatically licensed under the Creative Commons CC-BY-SA licence. (See section 3 of the &lt;a href=&quot;http://stackexchange.com/legal&quot;&gt;terms of service&lt;/a&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, you can license your work under additional licences, if you wish. For example, as stated in &lt;a href=&quot;https://stackoverflow.com/users/13&quot;&gt;my profile&lt;/a&gt;, I explicitly release all my code snippets posted on Stack Overflow under (essentially) a no-rights-reserved licence.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;ETA: To address user unknown's point about how opting out would be &quot;prohibited&quot;: This topic has been &lt;a href=&quot;https://meta.stackexchange.com/questions/12527/do-i-have-to-worry-about-copyright-issues-for-code-posted-on-stackoverflow&quot;&gt;flogged to death&lt;/a&gt;, but, in short:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You are required to license your work under CC-BY-SA in order to post to any of the Stack Exchange sites. &lt;a href=&quot;http://stackexchange.com/legal&quot;&gt;(See section 3.)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Creative Commons licences are not revocable. Once you license a work under such a licence, no action on your part can retract the licence, unless a licensee has violated the terms of the licence (and even then, the revocation applies to the violator only, not to the general public). &lt;a href=&quot;http://creativecommons.org/licenses/by-sa/3.0/legalcode&quot; rel=&quot;nofollow noreferrer&quot;&gt;(See section 7b.)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;ETA2: IANAL, and I don't think it's been tested in court, but the &quot;enforcement of CC-BY-SA&quot; thing has definitely come up at Stack Exchange. There was a case not so long ago where a user decided he wanted to nuke all his posts, saying that it's his right to do so as copyright owner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The moderators disagreed. Creative Commons licences cannot be revoked, so the moderators had a right to revive his posts and keep them available &quot;forever&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The only way to violate the terms of service in this regard (that I know of; IANAL) is to post something you don't hold copyright to. In that case, the copyright owner can file a DMCA request to Stack Exchange, and that content will be promptly removed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you post something you &lt;em&gt;do&lt;/em&gt; hold copyright to, then you &lt;em&gt;are&lt;/em&gt; licensing it under CC-BY-SA. You cannot later claim a copyright violation (for actions that are allowed under CC-BY-SA, by a person who hasn't had their licence revoked for previous violations). Wikipedia works the same way:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;By clicking the &quot;Save Page&quot; button, you agree to the Terms of Use, and you irrevocably agree to release your contribution under the CC-BY-SA 3.0 License and the GFDL. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If you are suggesting that Stack Exchange should include similar verbiage below all the post boxes, you should post such a suggestion on &lt;a href=&quot;https://meta.stackoverflow.com/&quot;&gt;Meta Stack Overflow&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2011-12-02T16:39:03.500" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="432" PostTypeId="1" CreationDate="2011-11-24T05:59:25.007" Score="12" ViewCount="467" Body="&lt;p&gt;This 'beta' icon for codegolf.SE is pretty lame.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, in order to create a framework for my own proposal (&lt;em&gt;I dare you to do better!&lt;/em&gt;), I ask &quot;&lt;strong&gt;What's a good icon for Programming Puzzles and Code-Golf?&lt;/strong&gt;&quot;&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="76162" LastEditDate="2021-06-04T10:06:27.597" LastActivityDate="2021-06-04T10:06:27.597" Title="Let's pick an icon for codegolf.SE?" Tags="|discussion|feature-request|status-completed|user-interface|" AnswerCount="7" CommentCount="2" ClosedDate="2021-06-03T23:33:20.380" ContentLicense="CC BY-SA 3.0" />
  <row Id="433" PostTypeId="2" ParentId="432" CreationDate="2011-11-24T06:10:20.740" Score="1" Body="&lt;p&gt;John Tenniel's Illustration for &lt;em&gt;Alice in Wonderland&lt;/em&gt; portraying Alice attempting to play Croquet with a flamingo and two hedgehogs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.gutenberg.org/files/114/114-h/114-h.htm#alice30&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.gutenberg.org/files/114/114-h/114-h.htm#alice30&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/6L0iR.gif&quot; alt=&quot;Alice trying to play Croquet with a flamingo and two hedgehogs&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Perhaps with &quot;x=x+1&quot; on the hedgehog running away and &quot;++x&quot; on the one underfoot.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2011-11-24T06:10:20.740" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="434" PostTypeId="2" ParentId="132" CreationDate="2011-12-05T16:58:51.853" Score="3" Body="&lt;p&gt;I was going to ask this myself, but I see that I was beaten to it.  IMO, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-agnostic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-agnostic&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-agnostic&lt;/a&gt; makes sense on sites like SO or codereview.SE where it's the exception, or at least not the overwhelming rule.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, most challenges here seem to be open to all languages, and the few that aren't can be (and generally are) tagged accordingly.  Thus, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-agnostic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-agnostic&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-agnostic&lt;/a&gt; serves only to clutter the tag list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(A particular reason why &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-agnostic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-agnostic&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-agnostic&lt;/a&gt; is problematic is that, because it's used so much, it's sometimes &lt;a href=&quot;https://meta.stackexchange.com/questions/72692/which-tag-is-added-to-the-page-title&quot;&gt;picked as the page title prefix&lt;/a&gt; over more relevant tags, as in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4106/is-it-christmas-code-golf&quot;&gt;this question&lt;/a&gt;.)&lt;/p&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2011-12-05T16:58:51.853" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="435" PostTypeId="1" CreationDate="2011-12-08T15:27:32.437" Score="12" ViewCount="898" Body="&lt;p&gt;My read on the current state of meta.CG opinion is that the use of libraries is acceptable and that the library call should count in the character count:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/23/use-of-built-in-functions-and-libraries-in-code-golfs&quot;&gt;Use of built-in functions and libraries in Code Golfs&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/188/using-libraries-in-solutions&quot;&gt;Using libraries in solutions&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And from this discussion I conclude that there isn't really a consensus around whether or not languages specifically built for golfing should be allowed (but GolfScript is used to answer questions all the time, so perhaps that's as definitive an answer as one can get):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9/what-programming-language-should-we-consider-for-the-code-golf-solution&quot;&gt;What programming language should we consider for the code-golf solution ?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would the use of a code golfing library therefore be acceptable?  I'm thinking of a library that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Has a one-letter name (so calling it would require something like &lt;code&gt;library(g)&lt;/code&gt; -- 10 characters)&lt;/li&gt;&#xA;&lt;li&gt;Shortens commonly used function names (&lt;code&gt;print&lt;/code&gt; to &lt;code&gt;p&lt;/code&gt;, etc.)&lt;/li&gt;&#xA;&lt;li&gt;Curries a few functions so that defaults agree with their common usage in golfing&lt;/li&gt;&#xA;&lt;li&gt;Loads a few commonly used libraries (so commonly used that they are pretty much part of the canon in answering questions on SO)&lt;/li&gt;&#xA;&lt;li&gt;Would be a general-purpose library (e.g. it wouldn't be updated just to solve a particular problem)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;It seems to me that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You incur a fairly major upfront cost (10 or so characters) and get a benefit down the road.  Not unlike the common golfing trick of shortening functions that you use twice (e.g. &lt;code&gt;l=length;l(a);l(b)&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;For short problems this would be at best a slight advantage and for long ones it would be a huge advantage.&lt;/li&gt;&#xA;&lt;li&gt;This may help to even out the cross-language differences in function lengths&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Sounds like a reasonable compromise to me, but curious what others think.&lt;/p&gt;&#xA;" OwnerUserId="3163" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2022-04-08T14:16:54.757" Title="Is a code golfing library legitimate?" Tags="|discussion|code-golf|" AnswerCount="6" CommentCount="4" ClosedDate="2017-07-07T17:05:37.177" ContentLicense="CC BY-SA 3.0" />
  <row Id="436" PostTypeId="2" ParentId="435" CreationDate="2011-12-08T16:51:29.527" Score="2" Body="&lt;p&gt;I think it's a great idea. I have given this some thought, and I have some ideas:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1 - Naming. &lt;code&gt;G&lt;/code&gt; might be less problematic than &lt;code&gt;g&lt;/code&gt; (a more common local variable).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2 - Loading the library:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# Normal way, Not efficient &#xA;library(G) &#xA;&#xA;# Golfed way, Much more efficient :)&#xA;G::.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;3 - How do we accomplish that? Well, in the golf package we define &quot;.&quot; using an active binding:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;makeActiveBinding(&quot;.&quot;, function(x) require(G), golfEnv)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;4 - Functions to put into it: Well, plenty of candidates, but something to get input efficiently and output efficiently seem like good candidates. I'm often annoyed that &lt;code&gt;paste&lt;/code&gt; and &lt;code&gt;cat&lt;/code&gt; always have &lt;code&gt;sep=&quot; &quot;&lt;/code&gt; when I want &lt;code&gt;sep=&quot;&quot;&lt;/code&gt;...&lt;/p&gt;&#xA;" OwnerUserId="3171" LastActivityDate="2011-12-08T16:51:29.527" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="437" PostTypeId="2" ParentId="435" CreationDate="2011-12-09T07:21:59.697" Score="6" Body="&lt;p&gt;IMO the point of golfing is perverting existing languages that were not designed with golfing in mind.  Designing a golf library is akin to altering the language with golfing in mind.  Which defeats the point.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My opinion makes me pro-J and kinda anti-Golfscript. (well, GS &lt;em&gt;is&lt;/em&gt; nice...)&lt;/p&gt;&#xA;" OwnerUserId="199" LastActivityDate="2011-12-09T07:21:59.697" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="438" PostTypeId="2" ParentId="435" CreationDate="2011-12-09T12:29:18.657" Score="7" Body="&lt;p&gt;It's one thing to use standard libraries and another to roll your own. I think it risks turning into a game of &quot;Who can write the most advantageous library?&quot; rather than &quot;Who can find a devious way to use the language?&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Which isn't to say I don't understand the desire: I often find myself wishing that GolfScript had &lt;code&gt;w&lt;/code&gt; as an alias for &lt;code&gt;while&lt;/code&gt; or &lt;code&gt;b&lt;/code&gt; as an alias for &lt;code&gt;base&lt;/code&gt;, and that digits weren't valid in identifiers - but I stick to muttering about it rather than forking the language).&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2011-12-09T12:29:18.657" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="439" PostTypeId="2" ParentId="432" CreationDate="2011-12-14T04:31:22.040" Score="1" Body="&lt;p&gt;I was thinking of some sort of &lt;a href=&quot;http://www.artcrafthome.com/picts/PB/PB-CodeGrinder.gif&quot; rel=&quot;nofollow&quot;&gt;code grinder&lt;/a&gt;.  I'm not sure you could make it very small and still be legible, though.&lt;/p&gt;&#xA;" OwnerUserId="67" LastActivityDate="2011-12-14T04:31:22.040" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="440" PostTypeId="2" ParentId="432" CreationDate="2011-12-14T06:29:52.243" Score="5" Body="&lt;p&gt;Stealing Keith's idea, here's a &quot;code-grinder&quot; constructed by reversing the Meta-Stack Overflow icon, adding some space for a &quot;grinding chamber&quot;, an output chute, and some smaller &lt;em&gt;things&lt;/em&gt; coming out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/WD3Tg.png&quot; alt=&quot;Code Grinder Icon&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2011-12-14T06:29:52.243" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="441" PostTypeId="2" ParentId="432" CreationDate="2011-12-14T12:12:41.583" Score="6" Body="&lt;p&gt;Instead of an icon which represents puzzles, why not an icon which is a puzzle? Maybe something encoded in the 256 possible pixels of the 16x16 icon?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;EDIT: Thinking about it further, 256 bits could hold 32 ASCII characters, which might be enough to hold a J or Golfscript program...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;EDIT2: :-) The ridiculousness continues...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Maybe convert the following to an icon?&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0100111101100011&#xA;0011011011011100&#xA;1001110000110111&#xA;0110011001000011&#xA;1101011110000010&#xA;0001101000111101&#xA;1011110111111011&#xA;1101101110011011&#xA;1010001000010101&#xA;1000100001100010&#xA;0111000011001011&#xA;1001101001000111&#xA;0000110110111001&#xA;1101000100100111&#xA;1111011010100011&#xA;1110101001010000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;With apologies to Gnibbler for appropriating his code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The icon would look like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/lg6DW.png&quot; alt=&quot;icon&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="737" LastEditorUserId="737" LastEditDate="2011-12-14T14:44:00.537" LastActivityDate="2011-12-14T14:44:00.537" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="442" PostTypeId="2" ParentId="432" CreationDate="2011-12-14T19:25:05.377" Score="4" Body="&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZSGFL.png&quot; alt=&quot;Puzzle piece containing part of &amp;gt;!&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;Puzzle&quot; is a lot easier to convey in a small icon while still having space for some code than &quot;golf&quot;.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2011-12-14T19:25:05.377" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="443" PostTypeId="1" CreationDate="2011-12-15T20:05:27.923" Score="4" ViewCount="284" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/q/4191/152&quot;&gt;12 Days of Christmas Lyrics&lt;/a&gt; challenge has several solutions of the form &quot;Use an external decompression utility on this file to create a solution.language file, then execute the decompressed file.&quot;  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does that count?  If so, I'd expect every answer from now on to shave off bytes by using this technique.   It just seems outside the spirit of golf to take credit for the bytes saved by a compressor.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd suggest that compressed solutions are only valid if they include a self-extractor.&lt;/p&gt;&#xA;" OwnerUserId="152" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2011-12-18T17:19:14.117" Title="Is using external decompression legitimate golfing?" Tags="|discussion|code-golf|policy|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="444" PostTypeId="2" ParentId="443" CreationDate="2011-12-15T22:19:22.663" Score="1" Body="&lt;p&gt;Most (all?) of the compressed solutions in that thread, including mine, &lt;em&gt;do&lt;/em&gt; include a self-extractor.  It might be implemented using an optional module/library, but if that library ships with the language by default (as Compress::Zlib does with Perl, for example), then I really don't see how it could be disallowed in general.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, individual challenges may well specify &quot;no calls to zlib or other pre-written decompression libraries&quot; if they want.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4356/say-hello-to-the-world-in-ascii-art&quot;&gt;ASCII art hello world challenge&lt;/a&gt; I just posted, I required programs to be written using printable ASCII characters only; this doesn't rule out the use of external compression libraries, but it does handicap them.  (Alas, it also rules out &lt;a href=&quot;http://en.wikipedia.org/wiki/Piet_%28programming_language%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;Piet&lt;/a&gt;, much of &lt;a href=&quot;http://en.wikipedia.org/wiki/APL_%28programming_language%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;APL&lt;/a&gt; and other potentially interesting languages, so it's not a perfect solution.  But it seemed to fit the theme of the question, so I went with it.)&lt;/p&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2011-12-15T22:19:22.663" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="445" PostTypeId="2" ParentId="443" CreationDate="2011-12-16T09:41:27.473" Score="8" Body="&lt;p&gt;Solutions that aren't 100% human-created aren't interesting in my eyes.  The first one could have been, once, in the site's early days.  But the trend I observe now is that they're becoming the default trick, just like UCS2 was a few months ago.  So boooooring.  And all the more demoralizing when the top voted answer in a thread is &lt;em&gt;my&lt;/em&gt; solution, compressed by someone else.  How lame can we get.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Solutions that aren't 100% human-readable could be okay if they're reasonably well explained, assuming the work to make them unreadable was human-performed, and seems task-specific enough.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I wouldn't like to see an arbitrary ban on any external library, though.  I still see the search for the right way of doing things as a fundamental aspect of code golf.  That includes finding the right tool for the job, who could be a library.  In my opinion, the core issue is that &lt;strong&gt;we're seeing too many problems for which the right way of solving them is through dumb compression.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Obviously, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; is the usual suspect here.  Maybe we should start devising a specific set of (default) rules for problems under that tag.  I'd dream of simply punishing the problem submitter with downvotes when the winning entry is a compressed one, but that's far from populist enough to work.  Our eternal September has started, and I'm not sure how to handle that gracefully.&lt;/p&gt;&#xA;" OwnerUserId="199" LastActivityDate="2011-12-16T09:41:27.473" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="446" PostTypeId="1" CreationDate="2011-12-17T22:29:47.277" Score="12" ViewCount="181" Body="&lt;p&gt;In the meta question &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/132/is-language-agnostic-an-appropriate-tag&quot;&gt;Is [language-agnostic] an appropriate tag&lt;/a&gt; the top-voted answer is in favour of eliminating the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-agnostic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-agnostic&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-agnostic&lt;/a&gt; tag provided that we make it clear that our intent is that all puzzles are open to all languages by default and if the asker wishes to restrict a question to one language that must be explicit. 3 of the other 4 answers are in favour of eliminating the tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The best way to make the intent clear would be the FAQ. So the question is: is there any reason not to add the following to the FAQ, between the current third and fourth bullet-points about &lt;strong&gt;questions&lt;/strong&gt;?&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A puzzle or golf challenge is assumed to be open to entries in any language unless otherwise specified.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Ping: there's been no disagreement, but also no actual change in the FAQ in more than a year. Could someone with the ability to make the change implement this?&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2013-05-16T08:32:50.683" Title="Amend FAQ to state that language-agnostic is the default" Tags="|support|policy|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="447" PostTypeId="1" CreationDate="2011-12-18T17:27:09.940" Score="1" ViewCount="589" Body="&lt;p&gt;I'm trying to solicit ideas on a couple of items where I think a FAQ update is appropriate:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/446/amend-faq-to-state-that-language-agnostic-is-the-default&quot;&gt;Amend FAQ to state that language-agnostic is the default&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/443/is-using-external-decompression-legitimate-golfing&quot;&gt;Is using external decompression legitimate golfing&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;My personal opinion is that the first one should be implemented, and for the second one, we should disallow &lt;code&gt;eval&lt;/code&gt; and external program execution by default. This is where I'm seeking opinions the most:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Is it watertight enough to discourage compression-based solutions?&lt;/li&gt;&#xA;&lt;li&gt;Would it make things unnecessarily difficult, especially for languages like GolfScript where a lot of its mechanics are very &lt;code&gt;eval&lt;/code&gt;-based?&lt;/li&gt;&#xA;&lt;li&gt;Disabling external program execution basically disallows shell-based solutions. Are we okay with this?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2012-01-03T14:34:37.107" Title="FAQ update ideas" Tags="|discussion|policy|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="448" PostTypeId="2" ParentId="446" CreationDate="2011-12-18T17:28:07.833" Score="7" Body="&lt;p&gt;I agree with this, and will update the FAQ shortly. However, I want to get some closure on the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/443/is-using-external-decompression-legitimate-golfing&quot;&gt;compression&lt;/a&gt; thread as well so I can update the FAQ in one go.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've posted a new thread, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/447/faq-update-ideas&quot;&gt;FAQ update ideas&lt;/a&gt;, where I solicit discussion on the above two items. Please feel free to pitch in your opinion there!&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2011-12-18T17:28:07.833" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="449" PostTypeId="2" ParentId="447" CreationDate="2011-12-18T18:04:42.727" Score="2" Body="&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;I think so, but I think J B's point that the problem is the questions is a good one, and we should instead be discouraging such questions.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It would make things quite painful for GolfScript. An awful lot of GolfScript programs evaluate either the entire input or parts of it, because it's the easiest way to convert a string to an integer. To take my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4229/polynomial-extrapolation/4305#4305&quot;&gt;answer on polynomial extrapolation&lt;/a&gt;, where the input format allowed me to get all the numbers on the stack with just one evaluation, removing eval would require replacing the initial &lt;code&gt;~&lt;/code&gt; with something along the lines of&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;' '/{{48-}%10base}/&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It doesn't entirely disallow shell-based solutions, because bash, tcsh, and zsh all have some fairly powerful built-ins. E.g. my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1230/implement-shamirs-secret-sharing-reconstruction&quot;&gt;bash answer to Shamir secret sharing&lt;/a&gt; doesn't use any external programs. But it would be a significant disadvantage for some problems.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Overall I don't think that banning eval by default is a proportionate response to a handful of questions which naturally have uninteresting answers. If we're going to address that via a policy on answers, I think it should be restricted to disallowing eval for questions tagged as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2011-12-18T18:04:42.727" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="450" PostTypeId="2" ParentId="447" CreationDate="2011-12-18T20:05:49.680" Score="4" Body="&lt;p&gt;No, disallowing &lt;code&gt;eval&lt;/code&gt; and external programs would not stop the use of compression.  Many scripting languages, including Perl, PHP and Python, come with zlib decompression routines that don't involve calling external programs, and if the task is to produce a fixed (or only slightly varying) output string, one can just print the decompressed text (possibly after modification) without bothering with &lt;code&gt;eval&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;If&lt;/em&gt; external compression tools are to be disallowed here, I'd prefer that we say so directly, instead of trying to come up with seemingly unrelated restrictions that we hope will achieve it as a side effect.  My proposed wording would be something like:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Unless otherwise specified in the challenge, the use of pre-existing decompression tools or libraries such as zlib is not allowed in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges.  This applies even if such decompression features are built into the language.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="3191" LastEditDate="2012-01-03T14:34:37.107" LastActivityDate="2012-01-03T14:34:37.107" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="451" PostTypeId="2" ParentId="432" CreationDate="2011-12-19T21:32:47.353" Score="6" Body="&lt;p&gt;Picking up &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/737/gareth&quot;&gt;Gareth&lt;/a&gt;'s suggestion, why not make the icon a tiny bit of Piet code? Codel size could be 2 to be a bit easier to distinguish from noise, albeit with the problem that less code can be written.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I think esoteric programming languages exemplify the recreational part of what we're doing here quite well, regardless of whether they are good for golfing or solving puzzles (Piet is definitely under-represented here).&lt;/p&gt;&#xA;" OwnerUserId="15" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2011-12-19T21:32:47.353" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="452" PostTypeId="2" ParentId="447" CreationDate="2011-12-20T15:20:38.163" Score="7" Body="&lt;p&gt;IMHO, there's a clear line between &lt;code&gt;eval&lt;/code&gt;, which is a metaprogramming facility that operates on code, and general-purpose compression, which is a representation tool that operates on byte streams.  I see only one of them as a &quot;code golfing&quot; activity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, it's hard to give rules on the activity when what we're given to judge is that activity's result.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my dream world, the rules would say &quot;anything goes,&quot; and the &lt;em&gt;questions&lt;/em&gt; that lead to 80% of zipped contributions would be downvoted to hell as much as the answers.  Populist eternal September tells me that'll never happen.  Unless the FAQ makes it clear and the mods are quick to react.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my real world, here's a debatable proposal:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;general-purpose compression is banned&lt;/li&gt;&#xA;&lt;li&gt;code golf character count is the number of Unicode code points; the code has to work as UTF-8.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;eval&lt;/code&gt; is encouraged.  That is, allowed.&lt;/li&gt;&#xA;&lt;li&gt;language-agnostic is the default.  There must be a good (and explicit) reason to waive it.&lt;/li&gt;&#xA;&lt;li&gt;External program invocation is allowed, but should be declared for languages other than shell.  Within reason, &lt;em&gt;e.g.&lt;/em&gt; available to all to check, sufficiently well-known, existed prior to question...&lt;/li&gt;&#xA;&lt;li&gt;[Redacted] &lt;s&gt;when two submissions are tied, mine wins&lt;/s&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;PS: the &lt;code&gt;eval&lt;/code&gt; ban would also kill J as far as parsing goes.  (the silver lining being that nobody notices J's eval anyway)&lt;/p&gt;&#xA;" OwnerUserId="199" LastActivityDate="2011-12-20T15:20:38.163" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="454" PostTypeId="2" ParentId="260" CreationDate="2012-01-04T17:15:02.540" Score="22" Body="&lt;p&gt;I see no good reason not to allow machine code submissions in code golf challenges &amp;mdash; it's a programming language, same as any other, and should not be unfairly discriminated against.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would recommend, though, that any machine code submissions be accompanied by the corresponding assembly code, just to make them more readable to visitors who may not have a disassembler handy.  But that's just common courtesy.&lt;/p&gt;&#xA;" OwnerUserId="3191" LastActivityDate="2012-01-04T17:15:02.540" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="455" PostTypeId="2" ParentId="260" CreationDate="2012-01-06T03:03:13.883" Score="-1" Body="&lt;ul&gt;&#xA;&lt;li&gt;Binary code needs often a certain hardware and a certain OS, so it is hard to test. &lt;/li&gt;&#xA;&lt;li&gt;Binary code might be hard to read/submit - UUencoding would be a solution, but checking the code size needs an extra step here. &lt;/li&gt;&#xA;&lt;li&gt;How is dynamically linked code handled? As usual? :) &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If not explicitly allowed, it should be disallowed. For special purpose, I don't see a reason to disallow it in general. In the concrete circumstances, machine and OS, submission form and so on can be specified case by case.&lt;/p&gt;&#xA;" OwnerUserId="373" LastActivityDate="2012-01-06T03:03:13.883" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="456" PostTypeId="1" CreationDate="2012-01-06T03:23:30.203" Score="15" ViewCount="527" Body="&lt;p&gt;I like to encourage people, to remove the number of characters from answers, given for questions, which are not code golf.&lt;/p&gt;&#xA;&lt;h3&gt;Example:&lt;/h3&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/4534/determine-longest-group-of-consecutive-numbers&quot;&gt;Here is a recent question&lt;/a&gt; which isn't a codegolf, which has 8 answers after 22 hours. 7 of them are decorated with the number of characters in the headline in bold, as if the people, giving the answer, didn't realize, that it isn't a CG. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4499/convert-number-to-comma-separated-number&quot;&gt;Here is another example&lt;/a&gt; - 8 of 12 answers contain the number of chars in a big, bold fashion in the headline.&lt;/p&gt;&#xA;&lt;h3&gt;Problem:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Users will misinterpret these questions, and vote on these numbers&lt;/li&gt;&#xA;&lt;li&gt;Users will mistakenly think it is a CG, and come up with golfed answers themselves or leave the question&lt;/li&gt;&#xA;&lt;li&gt;Users will think this is normal behaviour and start their questions without winning criterion too.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;suggested solution:&lt;/h3&gt;&#xA;&lt;p&gt;Everybody noticing such a situation should be officially encouraged by voting in this thread to remove these big, bold values from the headline.&lt;/p&gt;&#xA;&lt;h3&gt;alternative solutions:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Commenting the answers and hoping the best. I tried this before with questionable success. People did not remove the numbers, and I don't know how many realised, that they have to adjust their voting, in case they voted on these numbers. I guess later votes happened mostly after reading the comments, so with this aspect in mind.&lt;/li&gt;&#xA;&lt;li&gt;Better preparation of questions. Questions which aren't codegolf should carry an emphasized hint. Said question is very vague about the winning criteria (efficient code). Since newcomers don't prepare their questions well, this will not work too. :)&lt;/li&gt;&#xA;&lt;li&gt;Up to you.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="373" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2012-01-17T00:42:03.313" Title="Remove number of characters from answers, if it's not a CG-question" Tags="|discussion|code-golf|" AnswerCount="5" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="457" PostTypeId="2" ParentId="456" CreationDate="2012-01-06T03:33:05.403" Score="6" Body="&lt;p&gt;I largely agree, though my main concern is making it more clear that code-golf &lt;em&gt;isn't&lt;/em&gt; all that we do here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe that while we remain in beta you already have enough rep to edit, and I would suggest that you do so. If the author rolls it back, well you tried, if not the site is improved for it. Acting very early is probably good, so that people coming to the question see the lack of decoration.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2012-01-06T03:33:05.403" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="458" PostTypeId="2" ParentId="456" CreationDate="2012-01-06T17:13:57.837" Score="4" Body="&lt;p&gt;I agree. Perhaps that should go into the FAQ too: namely that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; questions are to have character counts, and non-&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; questions probably should not, unless the code size is somehow relevant.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2012-01-06T17:13:57.837" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="460" PostTypeId="1" CreationDate="2012-01-09T19:08:38.830" Score="3" ViewCount="60" Body="&lt;p&gt;I was just looking through some old questions (via the 'Questions'-&gt;'newest' tab) and found that pages 23, 24, 25, 26 and 27 are all blank. I suspect it's a bug. Any ideas what's going on?&lt;/p&gt;&#xA;" OwnerUserId="737" LastEditorUserId="9" LastEditDate="2013-12-16T02:00:35.273" LastActivityDate="2013-12-16T02:00:35.273" Title="Some pages blank in newest questions list?" Tags="|bug|status-completed|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="461" PostTypeId="2" ParentId="460" CreationDate="2012-01-09T19:17:11.860" Score="0" Body="&lt;p&gt;I see it too, with &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;no ignored tags (if you have ignored tags set and set to be undisplayed instead of dimmed, you can in principle get this effect as [status-by-design])&lt;/li&gt;&#xA;&lt;li&gt;15 posts per page (I think you're must the the same or there would only be fewer than 20 pages)&lt;/li&gt;&#xA;&lt;li&gt;Firefox 9.0.1 on Mac OS 10.5.8&lt;/li&gt;&#xA;&lt;li&gt;The freehand circle editor but no other userscripts active&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78" LastActivityDate="2012-01-09T19:17:11.860" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="462" PostTypeId="2" ParentId="460" CreationDate="2012-01-09T21:09:22.080" Score="3" Body="&lt;p&gt;I can repro, which is very much appreciated, as this is a recurrence of a bug we've seen before but has been elusive to repro. I have downloaded the in-memory cache-dump for local analysis; thanks for your report - it will genuinely help us fix this issue.&lt;/p&gt;&#xA;" OwnerUserId="517" LastActivityDate="2012-01-09T21:09:22.080" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="463" PostTypeId="2" ParentId="456" CreationDate="2012-01-10T10:40:56.317" Score="3" Body="&lt;p&gt;I tend to agree with hammar in the comments: many non code-golf questions provide no objective judging criterion.  My personal observation in such cases is that the Python questions tend to bubble, which I interpret as a language popularity vote.  (I may be wrong, it's just my feeling)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd rather see a clear-cut winning creterion.  Failing that, character count is better than language choice.&lt;/p&gt;&#xA;" OwnerUserId="199" LastActivityDate="2012-01-10T10:40:56.317" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="464" PostTypeId="2" ParentId="456" CreationDate="2012-01-10T17:16:58.847" Score="1" Body="&lt;p&gt;I think that in the absence of a clearly-specified, objective winning criterion, character count is the most natural default. The two questions referenced in the OP are so trivial that I wouldn't have even bothered writing an answer unless I was going to code-golf it to actually make it challenging and interesting. I knew they weren't code golf, and I &lt;em&gt;knew&lt;/em&gt; the code count was irrelevant, but I still did code-golf on purpose because there was nothing else to do... this site isn't supposed to be Java 101 homework questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So my vote is that all questions are automatically code-golf unless some other scoring criteria is specified, and we implement by editing the code-golf tag in if it's missing.&lt;/p&gt;&#xA;" OwnerUserId="879" LastActivityDate="2012-01-10T17:16:58.847" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="465" PostTypeId="1" CreationDate="2012-01-10T20:28:48.420" Score="11" ViewCount="461" Body="&lt;p&gt;Questions without winning criterion should be closed early (as 'not constructive', better, if possible, with an own category: Missing winning criterion.&lt;/p&gt;&#xA;&lt;p&gt;Else, people start working on CG-solutions, and emphasize the charcter count. Soon everybody follows and threats it as a golf question. They vote each other up, and nobody can stop it anymore.&lt;/p&gt;&#xA;&lt;p&gt;Closing the question later is too late. The first answers more votes. I guess many people revisit a question rarely after publishing their own solution - except, if they earn much upvotes.&lt;/p&gt;&#xA;&lt;h3&gt;Close early!&lt;/h3&gt;&#xA;&lt;p&gt;Vote to close, and leave a comment that you did so, and explain why. A closed question can be reopened, if the winning criterion is added later, but it avoids answers.&lt;/p&gt;&#xA;&lt;p&gt;We need more discipline in handling the rules. I like CG-questions too, but I don't like to pretend that I did not see the missing criterion, nor do I like to produce the de facto pressure, which exists, after 2 or 3 answers where submitted with &amp;quot;48 chars&amp;quot; or &amp;quot;55 chars&amp;quot; in the headline.&lt;/p&gt;&#xA;&lt;p&gt;I guess this is the better way to handle &lt;strong&gt;questions&lt;/strong&gt; without winning criteria than handling the &lt;strong&gt;answers&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/456/373&quot;&gt;as discussed  here&lt;/a&gt;, which would be the way to handle it late.&lt;/p&gt;&#xA;" OwnerUserId="373" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-02T19:59:16.230" Title="Close questions early!" Tags="|discussion|winning-criteria|" AnswerCount="2" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="466" PostTypeId="2" ParentId="305" CreationDate="2012-01-11T16:45:28.313" Score="0" Body="&lt;h3&gt;only about the Speed contests:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;With proper preparation, a speed contest can contain a measurement like this: &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Write a XYfooSort function, which sorts some Collection (Array, Buffer, List, ...) in place, using a swap(a,b) function. Count the number of swap-calls, and don't replace them. Print the number of calls in the end.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This way, solutions in different languages can be objectively be compared. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Different approach, which would allow to measure the real speed, would be, that the second solution has to compare itself with first, the 3rd can choose to compare with one of them, so that you would get a tree of solutions, with factors, how to translate the numbers. Of course this must not be reliable for different C-compilers on different plattforms, but for an rough estimate it might be a useful approach. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;To detect cheaters, you would have to name your system, if your measurements seem unbelievable to others. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  User Lang Time &#xA;   a    a    4&#xA;   b    a    6&#xA;   b    b    5 &#xA;   c    a    3&#xA;   c    c    6&#xA;   d    c    6&#xA;   d    d    5&#xA;   e    d   10&#xA;   e    e    8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;User a starts with Lang a in 4s. User bs b-solution is slower, but his a measurement is even more, so it might be his processor - a/b = 6/5, now b is the fastest solution.&#xA;On Cs machine, the a-code is even faster, but his c-Code is poor: c/b=12/5. D compares his d-Code to c, which is faster, but not enough: d/c=5/6, therefore d/b=5*12/6*5=60/30=2/1. Es code is again faster, 4/5e=d, but 8/5 of b, so b would be the winner here. &lt;/p&gt;&#xA;" OwnerUserId="373" LastActivityDate="2012-01-11T16:45:28.313" CommentCount="0" CommunityOwnedDate="2014-03-16T16:02:45.050" ContentLicense="CC BY-SA 3.0" />
  <row Id="467" PostTypeId="1" AcceptedAnswerId="468" CreationDate="2012-01-11T23:32:10.817" Score="7" ViewCount="222" Body="&lt;p&gt;If &lt;a href=&quot;https://codegolf.stackexchange.com/badges&quot;&gt;you visit the badges page&lt;/a&gt;, you'll find out, that for the badge 'Vox Populi', which has been awarded 3 times, you need to have &quot;Used the maximum 40 votes in a day&quot;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Today I reached the daily vote limit of 30 votes. So it seems the vote limit was lowered after some time, or maybe the badges-page is a copy from SO, and the number has not been adapted. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Question a) Which of it is it? &lt;/li&gt;&#xA;&lt;li&gt;Question b) Is it still possible to reach the badge, because it is bound to a value in the settings, which is 30 today? &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Something needs to be fixed - either only the badges page, or badges page and the treshold to reach the vox-populi badge, or something else I didn't think of. &lt;/p&gt;&#xA;" OwnerUserId="373" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-04-23T09:29:32.537" Title="Vox Populi needs 40 votes a day, limit is 30 votes" Tags="|support|badges|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="468" PostTypeId="2" ParentId="467" CreationDate="2012-01-11T23:35:43.150" Score="14" Body="&lt;p&gt;You'll notice that &lt;a href=&quot;https://codegolf.stackexchange.com/badges/57/suffrage&quot;&gt;suffrage&lt;/a&gt; is bronze badge awarded for using all &lt;em&gt;30&lt;/em&gt; votes in one day.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The deal is that there are 10 &quot;extra&quot; votes if you are &lt;a href=&quot;http://blog.stackoverflow.com/2011/05/vote-for-this-question-or-the-kitten-gets-it/&quot;&gt;voting enough on &lt;em&gt;questions&lt;/em&gt;&lt;/a&gt;. I wasn't clear on &lt;a href=&quot;https://meta.stackexchange.com/q/90726/2509&quot;&gt;&lt;em&gt;when&lt;/em&gt; you have to use them to have them qualify for the &quot;extra&quot;s&lt;/a&gt;, but it seems to require that you have cast 1 in 3 votes (so far this day?) for questions (so at least 10 of the first 30?) to be allowed to cast the spare ones.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2012-01-11T23:35:43.150" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="469" PostTypeId="2" ParentId="465" CreationDate="2012-01-12T01:37:06.940" Score="1" Body="&lt;p&gt;I have been reluctant to close questions without giving the poster a chance to fix them. Perhaps this is not the right strategy, but I would like to see some interest from the community. In the past the &quot;Please fix this or I'll close it&quot; comments I've left have not received much by way of upvotes or supporting comments.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2012-01-12T01:37:06.940" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="470" PostTypeId="2" ParentId="388" CreationDate="2012-01-12T08:14:53.983" Score="0" Body="&lt;p&gt;In a distinctive, but similar way to Briguy37's suggestion, for some puzzles, this approach might be sufficient, if the main goal is to find a fine Big-O-algorithm, independent of the speed of the language, machine, compiler/interpreter/vm: &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Say you want to sort some collection in place. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;any modification can only be done via a swap method, which has a build-in swap-counter named &lt;code&gt;swaps&lt;/code&gt;. &lt;/li&gt;&#xA;&lt;li&gt;any comparision has to be done with a lessThan-method with an equivalent counter named &lt;code&gt;comps&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;there is a arbitrary cost function, which weights both counters: cost = 2 * comps + 3 * swaps &lt;/li&gt;&#xA;&lt;li&gt;The winning criteria would be to minimize the costs. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Code original: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;public static int [] bubbleSorta (int [] a) {&#xA;    for (int i = 0; i &amp;lt; a.length - 1; i++) {&#xA;        for (int j = i + 1; j &amp;lt; a.length; j++) {&#xA;            if (a[i] &amp;gt; a[j]) {&#xA;                int tmp = a[i];&#xA;                a[i] = a[j];&#xA;                a[j] = tmp;&#xA;            }&#xA;        }&#xA;    }&#xA;    return a;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;replace it with &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;int cmps = 0;&#xA;&#xA;public boolean gt (int a, int b) &#xA;{&#xA;    ++cmps;&#xA;    return a &amp;gt; b;   &#xA;}&#xA;&#xA;int swaps = 0;&#xA;&#xA;public void swap (int i, int j, int [] arr) {&#xA;    ++swaps;&#xA;    int tmp = arr [i];&#xA;    arr [i] = arr [j];&#xA;    arr [j] = tmp;&#xA;}&#xA;&#xA;public int [] bubblesorta (int [] arr) {&#xA;    for (int i = 0; i &amp;lt; arr.length - 1; i++) {&#xA;        for (int j = i + 1; j &amp;lt; arr.length; j++) {&#xA;            if (gt (arr [i], arr [j])) {&#xA;                swap (i, j, arr);&#xA;            }&#xA;        }&#xA;    }&#xA;    return arr;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For iterating, the i &amp;lt; arr.length could be kept, instead of forcing the user to use gt (arr.length, i), but of course this is up to to you, the master of the question. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is of course not, to replace gt or swap with something else, to circumvent the counter, but to minimize the calls of such methods, to develop a different algorithm. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course it must be specified how to handle methods in common libraries, which perform swap or gt inside. And maybe the consequences aren't foreseeable for languages of very different paradigm. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Me, for instance, I don't know, whether the above example can be ported to the CodeGolf-Language or to APL. &lt;/p&gt;&#xA;" OwnerUserId="373" LastActivityDate="2012-01-12T08:14:53.983" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="471" PostTypeId="1" CreationDate="2012-01-14T18:39:09.440" Score="3" ViewCount="104" Body="&lt;p&gt;We currently have &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; tags. There doesn't seem to be any tag which is unambiguously for challenges which involve output in an image file format, so they sometimes get put in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; and sometimes (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/2528/generate-newton-fractals&quot;&gt;e.g.&lt;/a&gt;) don't get any tag. Moreover, some challenges which ask for ASCII-art output (e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/3989/implement-a-graphing-calculator&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/3772/illuminate-a-mirrored-room&quot;&gt;2&lt;/a&gt;) are tagged as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; but not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Inconsistent usage is obviously a small problem, which can be fixed by agreeing a standard and then editing tags as appropriate. But I think it's also a problem that tag completion from &quot;image&quot; doesn't send you to &quot;graphical-output&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am tempted to create an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image&amp;#39;&quot; rel=&quot;tag&quot;&gt;image&lt;/a&gt; tag and retag everything in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; as either &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image&amp;#39;&quot; rel=&quot;tag&quot;&gt;image&lt;/a&gt;, or both where the question gives the implementer a choice between the two (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/4561/generate-the-stack-overflow-logo&quot;&gt;e.g.&lt;/a&gt;). However, the name doesn't strike me as adequate, because there have been questions which take images as input but don't produce them as output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Maybe it's sufficient to make &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image&amp;#39;&quot; rel=&quot;tag&quot;&gt;image&lt;/a&gt; a synonym for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; for the time being and to change that later if there's much call for it to cover graphical input too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Suggestions?&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2012-01-18T20:06:00.153" Title="Image output and tagging" Tags="|discussion|tags|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="472" PostTypeId="2" ParentId="456" CreationDate="2012-01-17T00:42:03.313" Score="5" Body="&lt;p&gt;The problem occurs when people post a non-golf challenge, but either don't specify an objective and unambiguous winning criterion, or specify a criterion so loose that it results in lots of ties for first place.  In such a situation, it's natural for answerers to start trying to find &lt;em&gt;some&lt;/em&gt; way to one-up their competition:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&quot;&lt;em&gt;Hey, I just got a perfect score!  No-one can beat my answer!&lt;/em&gt;&quot;&lt;br&gt;&#xA;  &quot;&lt;em&gt;Oh yeah?  Well I got a perfect score too, but I did it with fewer chars!&lt;/em&gt;&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In situations where there really is no objective winning criterion, I think I'd support just voting to close the question until one is provided.  It might seem harsh, but if the goal is to keep such questions from spreading by example, I think it's the least harsh way that's going to have an effect.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I'm not sure how to deal with questions like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4029/adding-without-using-a-or-sign&quot;&gt;this one&lt;/a&gt;, where the OP &lt;em&gt;did&lt;/em&gt; provide a winning criterion (number of &lt;code&gt;+&lt;/code&gt; and &lt;code&gt;-&lt;/code&gt; chars) and even a backup tie-breaker criterion (number of &lt;code&gt;/&lt;/code&gt; &lt;code&gt;*&lt;/code&gt; &lt;code&gt;(&lt;/code&gt; &lt;code&gt;)&lt;/code&gt; &lt;code&gt;=&lt;/code&gt; &lt;code&gt;.&lt;/code&gt; &lt;code&gt;,&lt;/code&gt; and &lt;code&gt;0-9&lt;/code&gt; chars), but people very quickly came up with several answers that scored a perfect 0 on both counts.  Certainly voting to close the question just because the OP neglected to provide a &lt;em&gt;second&lt;/em&gt; tie-breaker rule seems a bit unreasonable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(The fact that the answer currently chosen as the winner of that challenge is &lt;em&gt;not&lt;/em&gt; actually one of the perfect ones is a bit annoying too, but at best only tangentially relevant to the issue at hand.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or perhaps we should adopt a policy that as soon as someone posts a theoretically unbeatable answer to a question, that question should be closed and the answer declared as the winner?  I wouldn't really like that personally (I'd prefer to try and find &lt;em&gt;some&lt;/em&gt; way to make a &quot;better&quot; answer, even if it means adopting an unofficial tie-breaker criterion such as character count), but it would certainly take care of that aspect of the problem.&lt;/p&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2012-01-17T00:42:03.313" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="474" PostTypeId="2" ParentId="471" CreationDate="2012-01-18T20:06:00.153" Score="3" Body="&lt;p&gt;OK, here's a concrete proposal: I suggest we create &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt; for challenges that have images as input and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-output&lt;/a&gt; for challenges that (only) ask for them as output.  Make &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; a synonym for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-output&lt;/a&gt;, &lt;em&gt;or&lt;/em&gt; vice versa.  (I have no great preference either way, but IMO &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-output&lt;/a&gt; should exist &lt;em&gt;at least&lt;/em&gt; as a synonym, so that users typing in &quot;image&quot; can find it.)  Questions that only ask for ASCII art output should be retagged as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; (and not as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;).&lt;/p&gt;&#xA;" OwnerUserId="3191" LastActivityDate="2012-01-18T20:06:00.153" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="477" PostTypeId="1" CreationDate="2012-01-25T20:31:34.500" Score="32" ViewCount="277" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/how-to-ask&quot;&gt;&quot;How To Ask&quot;&lt;/a&gt; page linked from the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/ask&quot;&gt;Ask Question&lt;/a&gt; page appears to have been copied wholesale from SO.  It is very Q&amp;amp;A centric:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;We’d love to help you. But not every question on Code Golf gets&#xA;  answered. To improve your chances, here are some tips:&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Do your homework.  Have you thoroughly searched for an answer before&#xA;  asking your question?...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Is it possible to update this page to be more in line with this site's charter?  Perhaps it should include text similar to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/107/152&quot;&gt;this CG meta answer&lt;/a&gt;, or &lt;a href=&quot;https://meta.stackexchange.com/a/24258/132789&quot;&gt;this SO meta answer&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="152" LastEditorUserId="68942" LastEditDate="2021-06-09T14:03:42.753" LastActivityDate="2021-06-09T14:03:42.753" Title="The &quot;How To Ask&quot; page is misleading" Tags="|discussion|feature-request|status-deferred|asking-questions|help-center|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="480" PostTypeId="1" CreationDate="2012-02-06T22:01:31.490" Score="2" ViewCount="352" Body="&lt;p&gt;&lt;a href=&quot;https://stackoverflow.com/search?q=code-bowling&quot;&gt;https://stackoverflow.com/search?q=code-bowling&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that StackOverflow has a few code bowling questions.  Code bowling:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Code-Bowling is a challenge for writing the most obscure, unoptimized, horrific and bastardized code possible. Basically, the exact opposite of Code-Golf.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;By definition, they don't belong on code-golf because it's an opposite.  However they don't belong on StackOverflow either. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;What to do? There isn't an area51 site that I can find on it.&lt;/p&gt;&#xA;" OwnerUserId="3717" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2012-02-06T23:27:34.153" Title="Appropriate for code-bowling?" Tags="|discussion|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="481" PostTypeId="2" ParentId="480" CreationDate="2012-02-06T22:15:41.877" Score="3" Body="&lt;p&gt;I believe that it is okay to have code-bowling contests here, since this site seems to  include other types of challenges, such as king-of-the-hill competitions and fastest-code competitions. Other examples include &quot;Adding without + or -&quot; and &quot;best lossless text compression&quot;. I really like the variety in contests because it makes this place more interesting, and more fun.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2012-02-06T22:15:41.877" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="482" PostTypeId="2" ParentId="480" CreationDate="2012-02-06T23:27:34.153" Score="8" Body="&lt;p&gt;This site is for many kinds of programming puzzles, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot;&gt;code bowling&lt;/a&gt; is not automatically excluded.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The great difficulty with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; is one of finding a &lt;strong&gt;&quot;An &lt;em&gt;objective&lt;/em&gt; primary winning criterion&quot;&lt;/strong&gt; as per the &lt;a href=&quot;https://codegolf.stackexchange.com/faq&quot;&gt;FAQ&lt;/a&gt; in light of the fact that just throwing bigger identifiers and lots of NOPs doesn't make anyone very happy. I'm not a fan of them and haven't seen one I considered &lt;em&gt;good&lt;/em&gt; yet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We (the moderators) have not been closing them preemptively, but ...&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2012-02-06T23:27:34.153" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="483" PostTypeId="1" CreationDate="2012-02-07T02:37:47.133" Score="1" ViewCount="162" Body="&lt;p&gt;This is bugging the hell out of me. I could have sworn I had seen the challenge here: &lt;a href=&quot;http://golf.shinh.org/all.rb&quot; rel=&quot;nofollow&quot;&gt;http://golf.shinh.org/all.rb&lt;/a&gt; a while back, but I've just gone through all &lt;strong&gt;500&lt;/strong&gt; of those challenges and none of them are what I'm looking for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge I remember was as follows. There was a short snippet (about 10 or so lines) of code (javascript I believe) and the object was to modify the code to produce a certain output. There were a few rules that specified the types of changes that could be made. If memory serves they were to add one character, change two characters, or delete one character. If not those, then something similar. The problem had 3 or 4 solutions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm aware that my description is quite vague, especially considering that I'm looking for something very specific, but I was also hoping that if not this exact challenge, someone could point me to something similar. That is, something where you have to make a couple changes to make some code work. &lt;/p&gt;&#xA;" OwnerUserId="3718" LastActivityDate="2012-06-18T04:35:44.360" Title="Making minimal modifications to fix code" Tags="|discussion|code-golf|code-challenge|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="485" PostTypeId="1" CreationDate="2012-02-22T11:26:18.723" Score="2" ViewCount="211" Body="&lt;p&gt;There was a question about implementing Tetris in under 140 bytes, which I can not find. &#xA;I started working on a solution a few hours ago, and now that it's working, I can't find it.  Was it closed &lt;em&gt;and&lt;/em&gt; deleted that fast?  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If so, can we undelete it? I realize it wasn't a great question but I'd like to try to salvage it.&lt;br&gt;&#xA; I'd add more objective criteria to make it a better question:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Define the rules for &quot;binary tetris&quot;&lt;/li&gt;&#xA;&lt;li&gt;Require a complete runnable implementation, not just the board update function.&lt;/li&gt;&#xA;&lt;li&gt;Add a further restriction that the solution needed to be broken up into 140 byte lines. Each line would have to be a legal program when combined with the previous lines, although it wouldn't need to be functional until the full set is assembled.  &lt;/li&gt;&#xA;&lt;li&gt;Winning criteria is fewest tweets, tiebreaker is most bytes to spare.  &lt;em&gt;(my score is 3/29)&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="152" LastActivityDate="2012-02-22T11:39:56.737" Title="What happened to the question about tetris in 140 bytes?" Tags="|discussion|deleted-questions|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="486" PostTypeId="2" ParentId="485" CreationDate="2012-02-22T11:39:56.737" Score="4" Body="&lt;p&gt;It was deleted by the user who asked it. Here is the text from the question. Salvage away&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I want to see if anyone can beat this:&lt;br&gt;&#xA;&lt;a href=&quot;http://www.i-programmer.info/news/167-javascript/3799-tetris-in-140-bytes.html&quot; rel=&quot;nofollow&quot;&gt;http://www.i-programmer.info/news/167-javascript/3799-tetris-in-140-bytes.html&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;http://developers.slashdot.org/story/12/02/19/1351213/tetris-in-140-bytes&quot; rel=&quot;nofollow&quot;&gt;http://developers.slashdot.org/story/12/02/19/1351213/tetris-in-140-bytes&lt;/a&gt;  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;As you can see, the rule set is simplified compared to real Tetris. However, we go by same rules as specified in the javascript version, hence the Binary Tetris.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Based on comments I understood, that the introduced javascript code covers only the basic logic of the game. Obviously it had some slashdot value, so try to make similar logic function with less than 140 bytes. Any language is welcome!&lt;/p&gt;&#xA;" OwnerUserId="95" LastActivityDate="2012-02-22T11:39:56.737" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="488" PostTypeId="1" CreationDate="2012-02-25T08:37:09.157" Score="1" ViewCount="188" Body="&lt;p&gt;how about adapting the rules of Code Golf to replace less code-characters are better rules (=&gt; code minifiers) with: the smaller BZIP2(sourcecode) the better?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I claim the true intent of character counting is to drive shorter, compacter source code creation which implies to some degree optimal en-coding of the algorithms used.&#xA;Bzip(source code) provides an entropy measure of the source which as well could be used to measure the efficiency of the en-coding...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What do you think?&lt;/p&gt;&#xA;" OwnerUserId="417" OwnerDisplayName="pointernil" LastEditorUserId="78" LastEditDate="2012-02-25T16:15:09.577" LastActivityDate="2012-02-26T08:44:23.470" Title="Use BZIP2(sourceCode) size instead of Code-Minifiers and Character-Counts?" Tags="|discussion|winning-criteria|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="489" PostTypeId="2" ParentId="488" CreationDate="2012-02-25T16:22:25.760" Score="1" Body="&lt;p&gt;I think that &quot;compressed size&quot; represents &lt;em&gt;&quot;An objective primary winning criterion&quot;&lt;/em&gt; as demanded by our FAQ, and as such would certainly be acceptable &lt;strong&gt;&lt;em&gt;as a different class of challenge&lt;/em&gt;&lt;/strong&gt; (i.e. not replacing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One thing I'm not sure of would be how different the results would be &lt;em&gt;vis-a-vis&lt;/em&gt; normal code golf. I suppose some highly repetitive code could do much better after compression than before, but such code seems to be rare in actually answer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; in the site.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;That leaves a couple of followup questions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;What compression: should we try to standardize on a single algorithm or leave it up to the challenge authors? &lt;/li&gt;&#xA;&lt;li&gt;Tagging. Just &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; or something more specific? Maybe &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compresion-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compresion-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;compresion-golf&lt;/a&gt;? In principle we could have &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/bzip2-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;bzip2-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;bzip2-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/zip-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;zip-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;zip-golf&lt;/a&gt;, etc, but I am not sure that we would be well served by such a proliferation of tags.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;My answers would be (1) author's choice and (2) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;compression-golf&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2012-02-25T16:22:25.760" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="491" PostTypeId="2" ParentId="488" CreationDate="2012-02-26T08:44:23.470" Score="5" Body="&lt;p&gt;In contradiction to @dmckee, I'm not sure that this would easily meet the requirement of an objective primary winning criterion. The common compression formats are really rules for how to uncompress, and there aren't canonical levels of CPU effort to expend in compression. So even GNU zip with the same options may give slightly different results for the same input in different versions. In fact, some zip/gzip implementations are non-deterministic and may give sizes differing in a few bytes according to the contents of your entropy pool.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you try specifying versions as &quot;GNU zip 3.0.2 with options -9&quot; then it's possible that a lot of people would have to find the source and compile it themselves. Technically that doesn't make it subjective, but it does make it a lot harder to check.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, bearing in mind that most archive formats include the original filename, you're going to have to either specify single-character names or penalise people whose languages use long filename extensions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you require people to submit the compressed versions of the file then it is objective, but there are some serious disadvantages. All the submissions will be base-64 encoded and opaque, and it gives an advantage to people who are able to run non-deterministic compressors on lots of high-powered computers.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2012-02-26T08:44:23.470" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="493" PostTypeId="2" ParentId="483" CreationDate="2012-03-16T15:46:42.460" Score="1" Body="&lt;p&gt;I found it by searching for &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;+add +delete&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Here &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4754/conversion-to-palindrome-with-minimal-points-used&quot;&gt;Conversion to palindrome with minimal points used&lt;/a&gt; is such a challenge in (C++/C#). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Somehow the system transforms my answer automatically into a comment - seems to think, quality = quantity.&lt;/p&gt;&#xA;" OwnerUserId="373" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2012-03-16T15:46:42.460" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="494" PostTypeId="1" AcceptedAnswerId="495" CreationDate="2012-03-19T15:26:58.480" Score="2" ViewCount="107" Body="&lt;p&gt;I know users already have a reputation score, but what about the languages they use? For example, what if I'm interested to see of all the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; questions out there, which users and/or languages come out on top (which get the most accepted or highest-voted answers)?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Perhaps this could include organization by all tags overall, not just the challenge type. Possibly also expanded to be listed by user, i.e. UserX has 14 answers using Perl, 10 using Python, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think this may require the ability to tag answers, but I can see other ways of aggregating.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does anyone else see this as an interesting/useful feature? I think based on my perception of use, it would really be meant for the codegolf.SE site, but who knows?&lt;/p&gt;&#xA;" OwnerUserId="3862" LastEditorUserId="68942" LastEditDate="2021-06-03T01:58:35.393" LastActivityDate="2021-06-03T01:58:35.393" Title="Language/User Rankings?" Tags="|feature-request|status-declined|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="495" PostTypeId="2" ParentId="494" CreationDate="2012-03-19T17:42:50.453" Score="2" Body="&lt;p&gt;I don't think that the system collects this data right now--it would after all require parsing answers to do it. And no data means no rankings...&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2012-03-19T17:42:50.453" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="496" PostTypeId="2" ParentId="483" CreationDate="2012-03-20T03:59:14.593" Score="0" Body="&lt;p&gt;The closest thing to what you describe that I remember seeing here is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4486/write-a-program-that-always-outputs-2012-even-if-its-modified&quot;&gt;Write a program that always outputs &amp;quot;2012&amp;quot; - even if it&amp;#39;s modified!&lt;/a&gt;.  However, that was about writing a program that &lt;em&gt;can't&lt;/em&gt; be minimally modified to change its output.&lt;/p&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2012-03-20T03:59:14.593" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="497" PostTypeId="1" CreationDate="2012-03-21T18:46:26.150" Score="4" ViewCount="218" Body="&lt;p&gt;Your site looks a bit different today. Yes, we are getting rid of the 'Sketchy' look and replacing it with a more-polished and finished design for sites in beta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can read more about the redesign of our Beta theme on our &lt;a href=&quot;http://blog.stackoverflow.com/2012/03/the-new-stack-exchange-beta-theme-2/&quot;&gt;blog entry&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please note: This will not affect your &quot;graduation&quot; status in any way. When your site is due for graduation, it will get its final(real) site design and branding.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you're still seeing the old favicon, please do a hard browser refresh. (Although sometimes it may take Chrome a while to load the new image).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you see any CSS or styling issues, please report it &lt;strong&gt;&lt;a href=&quot;https://meta.stackexchange.com/questions/126185/new-stack-exchange-beta-theme&quot;&gt;in this post&lt;/a&gt;&lt;/strong&gt; I created on Meta Stack Overflow. It will be easier for me to track all the bug reports there.&lt;/p&gt;&#xA;" OwnerUserId="829" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2012-06-19T20:35:48.860" Title="New Beta Theme Launched" Tags="|discussion|" AnswerCount="0" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="499" PostTypeId="2" ParentId="170" CreationDate="2012-03-25T11:21:52.690" Score="4" Body="&lt;p&gt;It looks like the userscript and the new 'Grainy' theme have a small issue. All inline code blocks are displaying as &lt;code&gt;block&lt;/code&gt; making some comments with suggestions for corrections etc. really long. &lt;a href=&quot;https://codegolf.stackexchange.com/a/3143/737&quot;&gt;Example 1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/3147/737&quot;&gt;example 2&lt;/a&gt;. It's not serious - nothing's actually broken - but I thought I'd let you know.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a temporary workaround until this is officially fixed, you can edit the script source (via &lt;em&gt;Manage User Scripts...&lt;/em&gt; from the Greasemonkey menu) and add the following line somewhere after the header:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;GM_addStyle(&quot;code.prettyprint { display: inline; }&quot;);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="737" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2012-03-27T10:01:49.493" CommentCount="2" CommunityOwnedDate="2012-03-25T11:21:52.690" ContentLicense="CC BY-SA 3.0" />
  <row Id="500" PostTypeId="1" CreationDate="2012-04-02T03:59:20.097" Score="0" ViewCount="255" Body="&lt;p&gt;I am working around to stick with this site bit i am not able to understand what question should ask here and what exactly code golfers and code fu means and main difference I know this very silly and stupid answer.&lt;/p&gt;&#xA;" OwnerUserId="3045" LastActivityDate="2012-04-02T05:08:28.577" Title="what is difference between code golfer and code fu?" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="0" ClosedDate="2016-03-09T03:09:22.297" ContentLicense="CC BY-SA 3.0" />
  <row Id="501" PostTypeId="2" ParentId="500" CreationDate="2012-04-02T05:08:28.577" Score="2" Body="&lt;p&gt;This site is a place to post-and-play games-and-challenges that are to be played or solved by writing programs and meet a number of additional requirements laid out in our FAQ (and unfortunately scattered around a number of meta posts...).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One of the big requirements that trip up new users is the &quot;objective winning criteria&quot; requirement. Code golf itself is a good example of that, at the winning entry is the &lt;em&gt;shortest&lt;/em&gt; one. On the other hand &quot;coolest&quot; is not objective.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not clear on why you think that code fu is an alternative to code golf, we don't use the phrase around here much, but it generally means the combination of deep knowledge and extensive experience that allows your code to have an intangible elegance to it.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2012-04-02T05:08:28.577" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="503" PostTypeId="1" CreationDate="2012-04-05T18:01:09.440" Score="1" ViewCount="94" Body="&lt;p&gt;We're having a Stack Overflow meetup to get together with fellow programming, web, and other technology enthusiasts. But not all of our programmers and technology enthusiasts live on Stack Overflow, so this year we're explicitly expanding the Meetup Everywhere to include the whole Stack Exchange tech family. As a Code Golf participant, you're invited, too!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We &lt;a href=&quot;http://blog.stackoverflow.com/2012/03/stack-overflow-meetup-everywhere-april-28-2012/&quot;&gt;recently announced&lt;/a&gt; the Second Annual Stack Overflow Meetup Everywhere day. This year, it will be on Saturday, April 28 (though local groups are welcome to pick any other day that week if a Saturday doesn't work for most of your members). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;What:&lt;/strong&gt; Stack Overflow worldwide meetups&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;When:&lt;/strong&gt; Saturday, April 28, 2012&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Where:&lt;/strong&gt; your city!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Who:&lt;/strong&gt; All users on Stack Exchange technology sites&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can visit the &lt;a href=&quot;http://www.meetup.com/stackoverflow/&quot; rel=&quot;nofollow&quot;&gt;official Meetup.com page&lt;/a&gt; to find existing groups near you (or start a new one). Keep an eye on the Stack Exchange blog for more information as we move closer to the event - I'll post tips on what we learned from last year's event and some things to keep in mind when organizing your local meetup. See the &lt;a href=&quot;http://blog.stackoverflow.com/2012/03/stack-overflow-meetup-everywhere-april-28-2012/&quot;&gt;blog announcement&lt;/a&gt; for some ideas about what your meetup can look like, why we're doing this, and some help navigating the meetup.com interface.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We'd love to see as many of you as possible participate in our Meetup Everywhere. We had over 2,000 people meet up around the world last year, and we've grown a lot since then. Help us spread the word by sharing info about this event through your blogs, social media accounts, lunches with coworkers, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As always, if you have any questions or comments, do not hesitate to get in touch, and I hope to see you there!&lt;/p&gt;&#xA;" OwnerUserId="4044" LastEditorUserId="4044" LastEditDate="2012-04-16T21:17:59.250" LastActivityDate="2012-04-16T21:17:59.250" Title="Stack Overflow Worldwide Meetups 2012: You're invited!" Tags="|discussion|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="504" PostTypeId="1" AcceptedAnswerId="505" CreationDate="2012-04-12T13:41:01.697" Score="0" ViewCount="57" Body="&lt;p&gt;I saw some unfilled wiki entries for some of the tags on the CG site, so I figured I'd fill them in. For this, I simply copy-and-pasted the info from the SO tags. Some of my suggestions were approved and others were rejected. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;[needless content removed]&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;EDIT:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It probably was not a good idea for me to be lazy by copy-and-pasting from SO to begin with. I've made corrections to the wiki excerpts for some of the language tags that fit better with the CG site.&lt;/p&gt;&#xA;" OwnerUserId="3862" LastEditorUserId="3862" LastEditDate="2012-04-13T13:32:01.973" LastActivityDate="2012-04-13T13:32:01.973" Title="Wiki Cleanup - Rejects/Approvals" Tags="|discussion|tags|editing|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="505" PostTypeId="2" ParentId="504" CreationDate="2012-04-12T16:13:41.887" Score="2" Body="&lt;p&gt;Just because somebody approved it for SO does not mean it's going to get approved here. FWIW, I'd probably have rejected both of them, but, I will say that the C one is probably slightly more acceptable than the C++ one, which is just too confusing (IMHO).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On an unrelated note, I'd probably have approved &lt;a href=&quot;https://codegolf.stackexchange.com/suggested-edits/277&quot;&gt;this edit&lt;/a&gt;. So I'm absolutely not taking sides here. :-)&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2012-04-12T16:21:59.133" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="506" PostTypeId="1" AcceptedAnswerId="509" CreationDate="2012-04-12T19:16:34.133" Score="0" ViewCount="55" Body="&lt;p&gt;Since I don't have the reputation required yet, does some moderator agree with these linkages?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt; = &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;?&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/text&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;text&amp;#39;&quot; rel=&quot;tag&quot;&gt;text&lt;/a&gt; = &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Anyone else, please feel free to add your own!&lt;/p&gt;&#xA;" OwnerUserId="3862" LastEditorUserId="3862" LastEditDate="2012-04-13T23:51:07.860" LastActivityDate="2012-04-16T04:30:15.717" Title="Tag Synonym Suggestions" Tags="|discussion|tags|tag-synonyms|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="507" PostTypeId="2" ParentId="504" CreationDate="2012-04-13T13:11:12.373" Score="1" Body="&lt;p&gt;You're right: I should have rejected the C one too. Sorry.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The point of the tag wiki isn't to be an definition of the tag name: it's to help people know whether to use a tag for their question or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an aside, I'm not even sure we should &lt;em&gt;have&lt;/em&gt; a C++ tag - there are few good reasons for restricting a question to one language; in the case of C++ template metaprogramming questions, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compile-time&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compile-time&amp;#39;&quot; rel=&quot;tag&quot;&gt;compile-time&lt;/a&gt; is probably more useful.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2012-04-13T13:11:12.373" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="509" PostTypeId="2" ParentId="506" CreationDate="2012-04-16T04:30:15.717" Score="1" Body="&lt;p&gt;No, and no.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;arithmetic = math?&lt;/p&gt;&#xA;&lt;p&gt;Afaik, all arithmetic is math, but not all mathematics is arithmetic.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;text = string?&lt;/p&gt;&#xA;&lt;p&gt;In programming, texts are normally represented as strings, but not all strings are texts, and texts puts a different emphasize. &amp;quot;Write a program which figures out the language of a text.&amp;quot; for example.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="373" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2012-04-16T04:30:15.717" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="510" PostTypeId="1" AcceptedAnswerId="511" CreationDate="2012-04-16T19:02:56.453" Score="4" ViewCount="120" Body="&lt;p&gt;I am considering to post a draft answer AKA &quot;&lt;em&gt;my advance&lt;/em&gt;&quot; (obviously warning to the users that it is incomplete and future updates are coming) on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/5515/score-a-cribbage-hand&quot;&gt;this question&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think my 90% done answer can help people by borrowing some of my ideas.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I am unsure if posting drafts answers is unwanted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So what do you advice me, to post or not to post this advance?:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;    //JavaScript&#xA;    str=&quot;AD 2D 3D 4D | 2D&quot;.split(/\s\|\s|\s/);&#xA;    i=j=v=f=p=0;&#xA;    arr=[];arr2=[];//don't merge arr=arr2=[]&#xA;&#xA;    for(sc=&quot;SCDH&quot;;i&amp;lt;5;i++){&#xA;        x=str[i];&#xA;        xx=x[0];&#xA;&#xA;        arr[sc.indexOf(x[1])]+=&quot;.&quot;;&#xA;        arr2[(&quot;ATJQK&quot;.indexOf(xx)+1)||(xx- -4)]+=&quot;.&quot;;&#xA;&#xA;        if((i&amp;lt;4)&amp;amp;&amp;amp;(x==(&quot;J&quot;+sc[sc.indexOf(str[4][1])]))){&#xA;            j++;&#xA;        }&#xA;&#xA;        v+=((xx==&quot;A&quot;)?1:((xx*1)||10));&#xA;    }&#xA;&#xA;    y=(yy=(arr+&quot;&quot;)).indexOf(&quot;....&quot;);//cache yy counterproductive?&#xA;    f=(!!(++y))?(yy[y+3]==&quot;.&quot;)?5:(str.length&amp;lt;6)?4:0:0;//improve !!()?&#xA;&#xA;    for(i in arr2){&#xA;        p+=(((xxx=((arr2[i]+&quot;&quot;).length-9))*(xxx-1))/2);&#xA;    }&#xA;&#xA;&#xA;&#xA;    //Fifteens: for each subset of five cards whose sum is 15, add two points.&#xA;    //if(v==15) add +2&#xA;&#xA;    //Pairs: for each pair of cards with the same rank (not value), add two points.&#xA;    //add +(p*2)&#xA;&#xA;    //Runs: for each maximal run of consecutive cards of length longer than 2, add the length of the run in points.&#xA;    //&#xA;&#xA;    //Flush: if all five cards are the same suit, add five points. Otherwise, if all but the up card are the same suit, add four points. If this is a crib hand, the four-point variant is not counted.&#xA;    //add +f&#xA;&#xA;    //Nobs: if there is a jack in hand with the same suit of the up card, add one point.&#xA;    //if(j) add +1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="3563" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2012-04-16T20:25:26.463" Title="Is it bad to post drafts answers?" Tags="|support|answers|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="511" PostTypeId="2" ParentId="510" CreationDate="2012-04-16T20:01:58.363" Score="4" Body="&lt;p&gt;Sometimes it's useful to post your own answer, even if not golfed, as a proof of feasibility. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2528/generate-newton-fractals/&quot;&gt;Generate Newton fractals&lt;/a&gt; generated some discussion in the comments as to whether it was golfable, and that's the kind of situation in which the question setter could intervene with &quot;I have a working solution in XYZ chars, and I'll post it in a week&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the case of your cribbage question, there's nothing difficult about the problem. So while you can by all means answer it yourself (with a golfed solution), it's not really worth cluttering up the page with a non-golfed solution which serves purely as a proof of feasibility. As a tactical matter (in terms of keeping the question on the front page without upsetting people), I'd wait until a week after posting it before posting your own answer.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2012-04-16T20:01:58.363" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="515" PostTypeId="1" CreationDate="2012-04-30T18:16:26.590" Score="8" ViewCount="92" Body="&lt;p&gt;I thought I'd note a somewhat poorly known feature of the Stack Exchange software we're using: when a question has more than 30 answers, so that they're spread over multiple pages, the second and later pages will have a &lt;a href=&quot;http://support.google.com/webmasters/bin/answer.py?hl=en&amp;amp;answer=139394&quot; rel=&quot;nofollow noreferrer&quot;&gt;rel=&quot;canonical&quot; link&lt;/a&gt; pointing to the first page.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This means that &lt;strong&gt;only the first page will be indexed by Google.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if you &lt;a href=&quot;http://www.google.com/search?q=%22com.aschroder.christmastree%22&quot; rel=&quot;nofollow noreferrer&quot;&gt;search on Google&lt;/a&gt; for &lt;a href=&quot;https://codegolf.stackexchange.com/a/4144&quot;&gt;this answer&lt;/a&gt;, currently at score -1 and page 2, the only result you'll get is &lt;a href=&quot;http://www.stackprinter.com/export?service=codegolf.stackexchange&amp;amp;question=4114&amp;amp;printer=false&amp;amp;linktohome=true&quot; rel=&quot;nofollow noreferrer&quot;&gt;a mirror site&lt;/a&gt;.  (Yes, I know that's not an answer anyone is likely to search for, but I picked it for the example since it has a low score and contains a distinctive string.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I recently started &lt;a href=&quot;https://meta.stackexchange.com/questions/130749/improper-use-of-rel-canonical-is-hurting-search&quot;&gt;a thread about this on MSO&lt;/a&gt;.  Since I mentioned codegolf.SE as an example of a site affected by this feature/bug, I thought I'd post a note about it here as well.  Those interested in commenting on the issue in general, as opposed to merely in the scope of this site, should head over there.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I do feel it would be good for codegolf.SE to have this feature disabled here, even if it ends up being kept enabled for other SE sites.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Update:&lt;/strong&gt; The MSO proposal has been marked as declined.  Still, one can at least hope that we might be able to get this feature disabled (and, ideally, replaced with proper &lt;a href=&quot;http://support.google.com/webmasters/bin/answer.py?hl=en&amp;amp;answer=1663744&quot; rel=&quot;nofollow noreferrer&quot;&gt;rel=&quot;next&quot; / &quot;prev&quot; links&lt;/a&gt;) locally here on codegolf.SE.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We could perhaps even serve as a testbed for this, to see if there really is anything to some of the more extreme &quot;&lt;em&gt;OMG Google will punish us for showing the question text on multiple pages!&lt;/em&gt;&quot; fears voiced on the MSO thread.  We've got a &lt;em&gt;lot&lt;/em&gt; of multi-page threads here (compared to most SE sites), so if our Google ranking won't crash and burn as a result of this, neither should anyone else's.&lt;/p&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="68942" LastEditDate="2021-06-05T23:51:34.117" LastActivityDate="2021-06-05T23:51:34.117" Title="Answers on pages 2 and later are not indexed by Google" Tags="|bug|status-declined|search|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="517" PostTypeId="2" ParentId="2140" CreationDate="2012-05-28T19:11:09.597" Score="3" Body="&lt;h1&gt;Count Syllables&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The goal of this challenge is to write a program that can count the syllables in a word as accurately as possible. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;On STDIN, your program will receive a number X followed by X lines, each containing a single word. Simple enough. (&lt;em&gt;Should there be a limit on the size of X?&lt;/em&gt;) The words will come from &lt;a href=&quot;http://web.mit.edu/kilroi/Public/bot/wordlist&quot; rel=&quot;nofollow&quot;&gt;this list&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4&#xA;challenge&#xA;to&#xA;count&#xA;syllables&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your output should be to STDOUT and have X lines. On each line should be the number of syllables counted in that word.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2&#xA;1&#xA;1&#xA;3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;To score you program, it will receive a long secret list of words to test. All programs will receive the same list of words. For each word, the number of syllables that your program got wrong will be added to the score of the program. If it output a 4 or a 2 when the word had 3 syllables, then one point will be added. If it said a 15 instead of a 3, then 12 points will be added to the score. The lower the score, the better. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if for the above input your program output &lt;code&gt;3 2 2 2&lt;/code&gt; (which would be produced by a program that counts strings of vowels), then the program would receive a score of 2.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your program should not access any external files (such as the word list). Also, your program should be no more than 5,000 bytes long (&lt;em&gt;is this a reasonable limit?&lt;/em&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner will be the person whose program has the lowest score, therefor the most accurate syllable counter. The deadline for submissions is [some time at least a month away].&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Suggestions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I am open to all constructive criticism. Is 5,000 bytes a reasonable limit for the program size? How long should the official scoring test be? How long should the deadline be? &lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2012-05-28T19:11:09.597" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="518" PostTypeId="2" ParentId="2140" CreationDate="2012-06-03T15:47:29.093" Score="3" Body="&lt;h2&gt;Play Simple 2-Dimensional Minecraft&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Recently I found &lt;a href=&quot;http://www.youtube.com/watch?v=gdnO1QZJ--M&amp;amp;feature=youtube_gdata_player&quot; rel=&quot;nofollow&quot;&gt;this video&lt;/a&gt; of &quot;HansLemurson&quot; showing a computer that was built in minecraft, which runs minecraft. He is playing minecraft on a computer that was built in minecraft that is running on his computer. To be specific, it is a two dimensional version with an 8x8 grid of cells. There is gravity, block placement, and even jumping. It is worth noting that the computer is single purpose. The same person has built programmable computers, but making them single purpose allows the computer to be much smaller.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Details&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The minecraft world is an 8x8 grid (one horizontal and one vertical dimension). The grid is comprised of either Xs (representing blocks) or empty spaces. The player is an X that is blinking on and off about once every second. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are two modes in the game, controlled by a toggle switch. The first mode is movement. This is controlled by a WASD-like button arrangement. If the player chooses to move left/right/down, the computer checks to see if the space immediately in that direction is empty. If so, then the player moves into that space. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the player chooses to move up, then the computer checks that the block underneath the player is solid. If so, then the player moves upward two units. Notice that this can propel the player into a solid block. If this happens, the player is obscured by the solid block, but can still move to an empty block next to him. When the player is inside on a solid block, the game continues as if the block isn't there, although the block is still there once the player leaves it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After each move, the player falls down one unit if there is empty space there. This simulates gravity. This is also why moving up moves up two units, so that the gravity makes a net movement of up one unit. Gravity does not cause the player to fall all of the way to the ground, just one unit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The second mode is block placement. In this mode, the same exact WASD buttons are used. Instead of moving the player, they toggle the state of the block in that direction. If the player presses &quot;left&quot; and there is a block there, then the block is destroyed. If there is not a block there, then a block is placed. Again after this move, the player is again subject to gravity. The blocks are not subject to falling.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Toggling the toggle switch does not count as a move, and does not invoke gravity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The game board is a torus, so all actions (movement, block creation) can wrap around the board. The board does not scroll with the player. The player moves, and the blocks stay in the same place.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You challenge is to write the shortest program that simulates this game. Your program should display and update the map correctly (with Xs as blocks, and with the blinking player). It should accept input from a button that toggles the state and four buttons for movement and actions.  This is code golf.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are imaginary bonus points for adding more features (block types, game size, etc) to your game.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Suggestions?&lt;/h2&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2012-06-04T10:37:31.280" LastActivityDate="2012-06-04T10:37:31.280" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="519" PostTypeId="1" CreationDate="2012-06-04T09:50:47.463" Score="1" ViewCount="127" Body="&lt;p&gt;It's a common mantra among web developers that &quot;Avoid JS wherever possible&quot; and &quot;don't use tables for layout&quot;. Yet every now and then I come across a layout that I want to implement, but cannot do so without violating one or the other rule. Now, mind you, there are legitimate cases for using Javascript and/or tables. I'm talking about the ones that really feel &quot;wrong&quot;, like using a giant table for the basic page layout or Javascript for positioning of static elements.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would it be appropriate to post such situations that I've come across as questions here? (After I've banged my head against a wall for at least 12 hours)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's an example:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I have two pictures that I do not know the size of beforehand. I need to display them side-by-side in the middle of the page (horizontally). Vertically they have to be both top-aligned to the page. If the browser window is reduced so much that the two pictures cannot be displayed entirely, scrollbars should appear. The pictures should still stay side-by-side. This should work on IE7+ as well as the latest versions of FF/Chrome/Opera/Safari.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="3135" LastActivityDate="2012-06-04T13:57:44.130" Title="Would &quot;CSS challenge&quot; questions be appropriate for this site?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="520" PostTypeId="2" ParentId="519" CreationDate="2012-06-04T13:57:44.130" Score="4" Body="&lt;p&gt;The things that makes a problem suitable for CodeGolf.SE are&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;An objective winning criteria&lt;/li&gt;&#xA;&lt;li&gt;The possibility of solving it more than one way which can then be distinguished by the winning criteria (this is why language agnosticism are the default on the site: different languages sometimes offer differ ways attacking problems)&lt;/li&gt;&#xA;&lt;li&gt;It should be sufficiently non-trivial to be interesting&lt;/li&gt;&#xA;&lt;li&gt;It should be simply enough the people will be willing to work it in their space time for no more reward than some rep on the site and the satisfaction of a job well done (or ill-done very well in the case of most &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; solutions)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;In the case you propose I would really worry about the first requirement.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2012-06-04T13:57:44.130" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="521" PostTypeId="2" ParentId="202" CreationDate="2012-06-05T22:21:00.860" Score="8" Body="&lt;h2&gt;Golfscript&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://golfscript.apphb.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://golfscript.apphb.com/&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a website that I built, due to the fact that there were no options for running GolfScript online.&lt;/p&gt;&#xA;&lt;p&gt;Please note that it's experimental; if you notice any bugs, please let me know at golfscriptweb.feedback++@gmail.com.&lt;/p&gt;&#xA;&lt;h3&gt;Edit:&lt;/h3&gt;&#xA;&lt;p&gt;Please note that the script executes as if it were run from the command line with no arguments. This means that the stack already contains an empty string. If you need to test a script that takes arguments, do the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;use a semicolon (&lt;code&gt;;&lt;/code&gt;) first, to pop the empty string off the stack.&lt;/li&gt;&#xA;&lt;li&gt;write the string containing the parameters&lt;/li&gt;&#xA;&lt;li&gt;write the script&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Here is an example of a script that uses the string &lt;code&gt;arg&lt;/code&gt; as a command line argument: &lt;a href=&quot;http://golfscript.apphb.com/?c=OwonYXJnJwoKezJiYXNlfn0leyt9Kg==&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://golfscript.apphb.com/?c=OwonYXJnJwoKezJiYXNlfn0leyt9Kg==&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Update 2012-10-25&lt;/h3&gt;&#xA;&lt;p&gt;New feature requested by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/5274/fjdumont&quot;&gt;fjdumont&lt;/a&gt; - hotkey for the &lt;strong&gt;&lt;em&gt;Run&lt;/em&gt;&lt;/strong&gt; button: &lt;kbd&gt;CTRL&lt;/kbd&gt;+&lt;kbd&gt;ENTER&lt;/kbd&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Update 2013-02-20&lt;/h3&gt;&#xA;&lt;p&gt;Modified website design to make it a bit more usable on mobile devices.&lt;/p&gt;&#xA;" OwnerUserId="3527" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-09-11T06:01:04.310" CommentCount="5" CommunityOwnedDate="2012-06-05T22:21:00.860" ContentLicense="CC BY-SA 3.0" />
  <row Id="522" PostTypeId="1" CreationDate="2012-06-06T11:55:15.670" Score="5" ViewCount="216" Body="&lt;p&gt;Congratulations to Polynomial for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/6043/were-no-strangers-to-code-golf-you-know-the-rules-and-so-do-i&quot;&gt;the most visited codegolf.SE question ever&lt;/a&gt;!&lt;br&gt;&#xA;I think it would be interesting to take a look at how the votes went there. We want votes and answer quality to match, so why not see how they do?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are the current numbers:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;69 votes for walpen: A joke answer. Pretty funny and well executed, but can't compete for code length.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;43 votes for ugoren (that's me): Not complaining. It was the best answer for a while, and is still one of the best.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;23 votes for tkazec: One of the best answers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;21 votes for user4557: Seemingly the shortest, but doesn't work. It would run till hell freezes over, and then print a wrong answer.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;13 . 5 votes for Ed H.: The best answer, by a nice margin.&lt;/p&gt;&#xA;" OwnerUserId="3544" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2012-06-06T13:04:42.243" Title="Voting in &quot;We're no strangers to code golf&quot;" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="523" PostTypeId="2" ParentId="522" CreationDate="2012-06-06T12:21:16.403" Score="6" Body="&lt;p&gt;A question which gets that much attention and that many answers will have a lot of drive-by visitors who look at the first few, upvote one or more, and don't follow down to the bottom. And because of the way that question got attention many of them are probably StackOverflow users who have enough rep with the bonus 100 but have no idea of what this stack is about (and no intention of reading the FAQ).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition, even for we regulars, identifying the best answer among so many is hard work. I've skimmed it, but I haven't gone through and voted on new answers since it went crazy. So there's some first mover advantage there.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't think there's much we can do about drive-by voting. The most effective solution is for the person who asked the question to be very alert and adjust the accepted answer promptly when a better one is posted. But if they're asleep, working, or otherwise unable to respond, we can't really blame them for their question being unexpectedly successful!&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="194" LastEditDate="2012-06-06T13:04:42.243" LastActivityDate="2012-06-06T13:04:42.243" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="524" PostTypeId="1" AcceptedAnswerId="525" CreationDate="2012-06-08T03:29:31.393" Score="1" ViewCount="99" Body="&lt;p&gt;According to the &lt;a href=&quot;http://area51.stackexchange.com/proposals/4570/code-golf-programming-puzzles&quot;&gt;Area51 site for CG&lt;/a&gt;, we need some help to get out of beta. Currently, the site averages 1.4-1.5 questions per day, quite far from the necessary 15.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In an effort to help, I'm personally trying to think of as many questions as I can, but I don't want to spam everyone with sub-par questions or those that may be too similar to others. However, I did post &lt;a href=&quot;https://codegolf.stackexchange.com/q/6005/3862&quot;&gt;two&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/q/6061/3862&quot;&gt;questions&lt;/a&gt; that were related, but different enough that it warranted two separate posts. I had in my head a few more along the same lines, but with relatively lackluster response, I decided to hold off. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Generally speaking (with regard to the beta status of the site), which should be the deciding factor in posting questions in a series: a high number of &lt;em&gt;simply&lt;/em&gt; satisfactory posts (not something that would get no response or votes, but also not stellar), or a lower number of very high quality posts?&lt;/p&gt;&#xA;" OwnerUserId="3862" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2012-06-08T08:42:28.250" Title="Question Series/Beta Status" Tags="|discussion|asking-questions|beta-status|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="525" PostTypeId="2" ParentId="524" CreationDate="2012-06-08T03:45:45.423" Score="7" Body="&lt;p&gt;I doubt that CodeGolf will every reach 15 questions per day. I mean, who would answer them?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That metric is for a usual Stack Exchange site, and I assume that Jeff and Shog9 don't expect that of this site as it would simply be silly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I had to guess I would go with the &quot;visits per day&quot; figure being the big hold-up. And perhaps the voting rate. I certainly applaud any effort to get more good questions onto the site, but as you say when should lean on the &lt;em&gt;good&lt;/em&gt; part of that phrase.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2012-06-08T03:45:45.423" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="526" PostTypeId="2" ParentId="524" CreationDate="2012-06-08T08:42:28.250" Score="4" Body="&lt;p&gt;I would say that the deciding factor in posting questions in a series isn't the answers (although I would hesitate to post part 2 if part 1 only got one or two), but the questions. My Minksky register machine series was intended to have three stages; the first one got 17 upvotes and 4 favorites, so after a good pause I posted the second part, which only has 4 upvotes and 1 answer. The third part is postponed indefinitely because I don't see the interest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a rule of thumb I would say that posting two very similar questions almost at the same time is counterproductive. Give people time to think about the problem space and come back to improve their answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, echoing dmckee's point about emphasis on good questions, use the sandbox (or chat, but I don't think anyone reads that) to get feedback before posting.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2012-06-08T08:42:28.250" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="528" PostTypeId="2" ParentId="2140" CreationDate="2012-06-13T13:04:33.080" Score="1" Body="&lt;h2&gt;I've Got The Key, I've Got The Secret&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A cryptography challenge in 2 parts.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Part 1&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Implement a pair of programs in any language (the two programs could be in different languages if you wanted) to encode and decode a string of plaintext.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input and Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The encoder must take the plaintext (and an optional key) and return an encoded string.&#xA;The decoder must take the cyphertext (and an optional key) and return the plaintext exactly as it was given to the encoder.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Restrictions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The encoding and decoding code must be entirely implemented in the language - no libraries or cryptography functions may be used.&lt;/li&gt;&#xA;&lt;li&gt;The code (encoder+decoder) cannot be longer than 1024 characters.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Part 2&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Implement programs (multiple programs per answer, one answer per entrant) which crack your opponents encryption algorithms.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The cyphertext.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The plaintext that generated the ciphertext.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I will upvote all answers to part 1 which have working encryption and have obviously made an attempt at golfing their answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In order to be eligible to win, an entrant will have to have taken part in both parts of the question. Overall score will be (length of shortest program that cracks your code-(length of encoder+length of decoder)). Highest score wins and winning entrant's entries will be accepted on both questions.&lt;/p&gt;&#xA;" OwnerUserId="737" LastActivityDate="2012-06-13T13:04:33.080" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="531" PostTypeId="2" ParentId="2140" CreationDate="2012-06-15T14:34:47.707" Score="3" Body="&lt;h2&gt;Bad Voice Recognition Calculator&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Overview&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's say you've decided to operate your computer using voice recognition software, but unfortunately you did a horrible job researching the various products out there and chose a package that does not recognize numbers as numerals, only words. (i.e. &quot;one&quot; (spoken) == &quot;one&quot; (typed), not &quot;1&quot;.) Rather than spend more money to get another option, you decide to make do. Now you want to use the computer's calculator, but this poses a problem, since your machine doesn't know how to add &quot;one plus one&quot;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Objective&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Implement a basic calculator that will read in a string of the written-out equation, perform the correct calculations, then return the result in its text form. &lt;strong&gt;Your code should be as short as possible; this is code golf.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules/Constraints&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input/output will be using your preferred method (&lt;code&gt;STDIN&lt;/code&gt;, &lt;code&gt;ARGV&lt;/code&gt;, etc.).&lt;/li&gt;&#xA;&lt;li&gt;Your calculator must be able to handle input and output within the billions (non-inclusive) &lt;code&gt;-1,000,000,000 &amp;lt; i &amp;lt; 1,000,000,000&lt;/code&gt;, but you may expand to more if you wish.&lt;/li&gt;&#xA;&lt;li&gt;Decimal values and/or parts must be accepted (&lt;code&gt;0 &amp;lt; i &amp;lt; 1&lt;/code&gt;) up to 3 places/digits.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When calculating answers, proper rounding must be used, so &lt;code&gt;&quot;three point one four one five nine two six&quot;&lt;/code&gt; must be returned as &lt;code&gt;&quot;three point one four two&quot;&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Basic calculator functions required:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;Add&quot;/&quot;Plus&quot;/&quot;Sum&quot;/&quot;And&quot; (+)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;Subtract&quot;/&quot;Minus&quot;/&quot;Remove&quot; (-)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;Multiply&quot;/&quot;Times&quot; (*)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;Divide&quot;/&quot;Divided&quot;/&quot;Divide by&quot;/&quot;Divided by&quot; (/)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;Raise&quot;/&quot;Exponent&quot;/&quot;Power&quot;/&quot;To the power of&quot; (^)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;&amp;lt;Base&amp;gt;Root&quot;/&quot;&amp;lt;Base&amp;gt;Radical&quot; (√)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;Point&quot;/&quot;Decimal&quot; (.)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;Pi&quot; (π)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;All strings in the list above must be accounted for in your code, capitalization does not matter.&lt;/li&gt;&#xA;&lt;li&gt;Numbers may be presented as their full value (&lt;code&gt;&quot;one thousand&quot;&lt;/code&gt;) or by digit (&lt;code&gt;one zero zero zero&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Negative numbers may be assigned using &lt;code&gt;&quot;Minus&quot;&lt;/code&gt; or &lt;code&gt;&quot;Negative&quot;&lt;/code&gt;.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The string &lt;code&gt;&quot;Minus&quot;&lt;/code&gt; bust be accounted for as an operator and identifier. (see example)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;And&quot;&lt;/code&gt; is only acceptable as an operator, not as part of a named number.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strike&gt;&lt;code&gt;&quot;one hundred and one&quot;&lt;/code&gt;&lt;/strike&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;one hundred one&quot;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;a&quot;&lt;/code&gt; or the absence of a number does not equate to any number; all numbers will be explicitly accounted for in the program input.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;a hundred&quot;&lt;/code&gt; does not equate to &lt;code&gt;&quot;one hundred&quot;&lt;/code&gt; and is not a valid input.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;No more than 2 terms will be used. &#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;one plus one minus one&quot;&lt;/code&gt; will not be implemented.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;If an invalid input is supplied, your function/program should handle the error and exit gracefully with an error description.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example I/O&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;one add one&quot;&lt;/code&gt; --&gt; &lt;code&gt;&quot;two&quot;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;five thousand thirty four subtract ten thousand six hundred&quot;&lt;/code&gt; --&gt; &lt;code&gt;&quot;negative five thousand five hundred sixty six&quot;&lt;/code&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Alternatively&lt;/em&gt;: &lt;code&gt;&quot;five zero three four subtract one zero six zero zero&quot;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;three root twenty seven&quot;&lt;/code&gt; --&gt; &lt;code&gt;&quot;three&quot;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;ten minus minus ten&quot;&lt;/code&gt; --&gt; &lt;code&gt;&quot;twenty&quot;&lt;/code&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Alternatively&lt;/em&gt;: &lt;code&gt;&quot;ten subtract negative ten&quot;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions:&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Is this too basic/complicated? (I'm assuming some languages will handle this much more simply than the method I have in my head...)&lt;/li&gt;&#xA;&lt;li&gt;Does the title fit?&lt;/li&gt;&#xA;&lt;li&gt;Are there any constraints that should be added/lifted?&lt;/li&gt;&#xA;&lt;li&gt;Are any more examples needed for clarification?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Thanks for your input, guys!&lt;/p&gt;&#xA;" OwnerUserId="3862" LastEditorUserId="3862" LastEditDate="2012-06-29T13:24:23.073" LastActivityDate="2012-06-29T13:24:23.073" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="533" PostTypeId="2" ParentId="2140" CreationDate="2012-06-18T04:43:18.987" Score="1" Body="&lt;h1&gt;Countability of Sets of Finite Sets&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The aim of this challenge is to code-golf a program which returns an iterator that will iterate over all possible non-empty finite sets of positive integers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So if running long enough, this iterator should eventually touch on {1}, {2, 5}, {3, 6, 112} (ie none of these should occur &quot;at infinity&quot;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may choose the order in which you iterate over these sets, but the order must satisfy the following requirement: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Under a particular ordering, if S is the i'th set to be returned by the iterator, then we shall call i the index of set S.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let a restriction (k,T) be an assertion about a set S that says S has size k and T is a subset of S.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For a given restriction (k,T) and iterator IT, let the restricted iterator be the iterator which takes sets returned by IT and filters out sets that don't satisfy the assertion, iterating only over the ones that do.  In other words, if IT iterates over the sequence of all sets, the restricted iterator iterates over the subsequence satisfying (k,T).  Now if S is the n'th set returned by the restricted iterator, then we'll call n the restricted index of S with respect to (k,T)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your ordering must satisfy the property that for any restriction there exists a polynomial P(x) such that for any set satisfying the restriction (with index i and restricted index n), i &amp;lt; P(n)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that the following ordering is not acceptable:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;{1} {2} {1, 2} {3} {1, 3} {2, 3} {1, 2, 3} {4} {1, 4} {2, 4}...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is the sequence that comes from counting 1, 2, 3, 4, 5, 6... and listing the set bits in the binary representation of each number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is because the restriction (1, {}) satisfies only the sets {1}, {2}, {3}, {4}... whose index i as a function of their restricted index is i=2^(n-1) which is not bounded by any polynomial&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt; Sandbox Questions &lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The reason for the strange requirement at the end is to disqualify any variants on the most natural ordering which simply counts upwards from 1 and enumerates the set bits in each number.  In this ordering, the n'th set of length-one occurs at index 2^n which is non-polynomial.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I posted this problem originally, but didn't think of the obvious solution and so I left out the final restriction.  I'd like to re-post it with the extra restriction.  But first I'd like to know what people think.  Is there a better way I can word that restriction or a more natural restriction I could impose instead?&lt;/p&gt;&#xA;" OwnerUserId="4754" LastEditorUserId="4754" LastEditDate="2012-06-18T17:41:06.813" LastActivityDate="2012-06-18T17:41:06.813" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="534" PostTypeId="1" AcceptedAnswerId="535" CreationDate="2012-06-19T15:18:56.843" Score="1" ViewCount="169" Body="&lt;p&gt;I have been seeing &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/483/3862&quot;&gt;this question&lt;/a&gt; bumped to the top of the active list in Meta, showing in the list as having been modified by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/-1/community&quot;&gt;Community♦&lt;/a&gt;. However, when I look into it, I see no changes were made to the question itself, any of the answers, or any of the comments. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I haven't paid too much attention, but I sort of recall seeing the same on other questions in the past as well (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/465/3862&quot;&gt;this one I think&lt;/a&gt;), but I'm not sure of which questions get it or how often.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, why does this keep bumping? Is this a bug or is it actually something happening behind the scenes that I just have the privs to see?&lt;/p&gt;&#xA;" OwnerUserId="3862" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.357" LastActivityDate="2013-01-24T14:10:09.943" Title="What's up with Community♦ in Meta?" Tags="|support|meta|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="535" PostTypeId="2" ParentId="534" CreationDate="2012-06-19T15:39:41.037" Score="3" Body="&lt;p&gt;Read the about me box in user Community♦'s profile. It says&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Hi, I'm not really a person.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;I'm a background process that helps keep this site clean!&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;I do things like&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Randomly poke old unanswered questions every hour so they get some attention&lt;/li&gt;&#xA;  &lt;li&gt;Own community questions and answers so nobody gets unnecessary reputation from them&lt;/li&gt;&#xA;  &lt;li&gt;Own downvotes on spam/evil posts that get permanently deleted&lt;/li&gt;&#xA;  &lt;li&gt;Own suggested edits from anonymous users&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="78" LastActivityDate="2012-06-19T15:39:41.037" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="538" PostTypeId="2" ParentId="2140" CreationDate="2012-07-16T13:50:25.563" Score="1" Body="&lt;h2&gt;The One with Two Parts&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The aim of this challenge is to create a pair of functions which scramble and unscramble any given piece of text.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Part 1&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In part one you post your scrambling function, along with the length in characters and language of your unscrambling function (but NOT its code). The length of the scrambler does not affect your score so you needn't golf it unless you want to. The two functions may be written in different languages if you wish.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input/Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The scrambling function should take one argument only - a string containing the input text - and return a string containing the scrambled text. The unscrambling function should also take only one argument - the scrambled text - and return the original text. The input text will be limited to characters in the ASCII set range from 0 to 127.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Part 2&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In part two you try to beat your opponents' scores for their unscrambling functions. You MUST use the language they specify for their unscrambler in part one. Please give just one answer to this question containing all your unscrambling functions making it clear which question in part one each function unscrambles (maybe each answer in part one should give its scrambler a name for identification?).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once the closing date (TBA) has passed all participants should post their unscrambling functions in their answer to part one to prove the length, language and functionality of their function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&#xA;The participants score will be calculated as follows: (unscrambler length from part one) - (shortest unscrambler length from part two). The participant with the lowest score wins and will have their answers accepted on both parts of the challenge. To be eligible to win a participant must have taken part in both parts of the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Example&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In part 1:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bob posts a Python answer and says his unscrambler is a 165 character Python function.&lt;/li&gt;&#xA;&lt;li&gt;Fred posts a GolfScript answer and says his unscrambler is a 59 character GolfScript function.&lt;/li&gt;&#xA;&lt;li&gt;Joe posts a JavaScript answer and says his unscrambler is a 180 character PHP function.&lt;/li&gt;&#xA;&lt;li&gt;Jim posts a Ruby answer and says his unscrambler is 163 character Ruby function.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In part 2:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bob posts an 82 character GolfScript function to unscramble Fred's scrambled text. He also posts a 175 character PHP function to unscramble Joe's scrambled text.&lt;/li&gt;&#xA;&lt;li&gt;Fred posts a 181 character PHP function to unscramble Joe's scrambled text.&lt;/li&gt;&#xA;&lt;li&gt;Joe posts a 150 character Python function to unscramble Bob's scrambled text.&lt;/li&gt;&#xA;&lt;li&gt;Jim posts a 156 character Python function to unscramble Bob's scrambled text. He also posts a 91 character GolfScript function to unscramble Fred's scrambled text.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The scores:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bob scores 165 - 150 = 15&lt;/li&gt;&#xA;&lt;li&gt;Fred scores 59 - 82 = -23&lt;/li&gt;&#xA;&lt;li&gt;Joe scores 180 - 175 = 5&lt;/li&gt;&#xA;&lt;li&gt;Jim scores 163 - 0 = 163&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;so Fred wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Miscellaneous&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I suggest that the closing date be two weeks after the challenge begins, and that unscramblers be posted to part one within 48 hours of closing date in order to be eligible.&lt;/p&gt;&#xA;" OwnerUserId="737" LastEditorUserId="737" LastEditDate="2012-07-17T09:42:27.250" LastActivityDate="2012-07-17T09:42:27.250" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="542" PostTypeId="1" AcceptedAnswerId="543" CreationDate="2012-08-17T18:04:53.133" Score="4" ViewCount="213" Body="&lt;p&gt;On my question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/5562/implement-hyperexponentiation-tetration-without-the-use-of&quot;&gt;Implement hyperexponentiation/tetration without the use of &amp;#39;^&amp;#39;&lt;/a&gt; asked a few months ago I accepted an answer with 18 characters, which, at the time of selection, was the shortest submission.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, there is a solution in J that was 19 characters at the time, but is now 12. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I normally wait 1-2 weeks before accepting an answer, but what if a submission is given after that period? Should I check on my questions regularly and update them, or do I just leave the accepted answer?  What is the protocol here?&lt;/p&gt;&#xA;" OwnerUserId="3473" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2012-08-17T21:00:14.360" Title="Should I change the accepted answer?" Tags="|discussion|support|accepted-answer|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="543" PostTypeId="2" ParentId="542" CreationDate="2012-08-17T21:00:14.360" Score="13" Body="&lt;p&gt;I don't think it should be necessary to check your questions - a new answer will give you a notification anyway, and the front page doesn't turn over fast enough for an edit to be easily missed. But I do think the accepted answer should generally be updated when a new winner is posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Firstly, most questions don't state a time limit for answers, and unlike bounties there is no technologically enforced time limit. Someone who stumbles upon this site and can beat the existing answers shouldn't feel that they're competing on  uneven terms.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Secondly, the accepted answer gets prominence in the page, and where there are a lot of answers that can be significant in getting upvotes. As a rule of thumb, the best answer usually deserves at least as many upvotes as any other.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In terms of actual practice, J.B. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/996/huffman-golfing&quot;&gt;talks about&lt;/a&gt; changing the accepted answer to one of his questions, and I think I've seen comments on other answers suggesting that the question-asker update to the winner, although I can't find any right now.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2012-08-17T21:00:14.360" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="545" PostTypeId="2" ParentId="19" CreationDate="2012-09-06T07:14:09.557" Score="2" Body="&lt;p&gt;Bottom line - I think we should disallow &lt;code&gt;-D&lt;/code&gt; (or at least count its chars), and allow all the rest without counting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;-D&lt;/code&gt; can be used to write 1-byte programs, so it must be either disallowed or counted.&lt;br&gt;&#xA;I prefer to disallow it, to discourage people from replacing &lt;code&gt;#define&lt;/code&gt; with &lt;code&gt;-D&lt;/code&gt; (we want short programs, not short programs + compilation lines).&lt;br&gt;&#xA;&lt;code&gt;-include&lt;/code&gt; should be treated the same (like &lt;code&gt;-D&lt;/code&gt;, it replaces things which should have been in the source).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A simple case is &lt;code&gt;-std=c99&lt;/code&gt;, &lt;code&gt;-ansi&lt;/code&gt; etc. I think it's agreed that these don't need to be counted. You might as well count 3 chars for &lt;code&gt;gcc&lt;/code&gt; (but I have &lt;code&gt;c&lt;/code&gt; as an alias...)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Other flags, however, don't offer a clear way to save chars. They may end up useful in some circumstances, but they don't automatically shorten the program.&lt;br&gt;&#xA;Finding flag that allows you to shorten your program is often quite creative. So I think it should be encouraged. If anyone finds a way to save a couple of chars using &lt;code&gt;-fallow-parameterless-variadic-functions&lt;/code&gt;, I'm in favor. Adding 40 bytes makes it useless.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some cases I actually saw on this site:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Using &lt;code&gt;-O2&lt;/code&gt; to optimize tail recursion:&lt;br&gt;&#xA;I think it should be allowed for no charge. Also note that in most cases, the program could work without it, given a deep enough stack.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;-msse3 -O3 -ffinite-math-only&lt;/code&gt; used in &lt;a href=&quot;https://codegolf.stackexchange.com/a/2795/3544&quot;&gt;this answer&lt;/a&gt;:&lt;br&gt;&#xA;The program works without the flags, just terribly slowly. I see no reason to charge for them.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;-nostartfiles&lt;/code&gt; used in &lt;a href=&quot;https://codegolf.stackexchange.com/a/5605/3544&quot;&gt;this answer&lt;/a&gt;:&lt;br&gt;&#xA;The point here was not using the letter &lt;code&gt;a&lt;/code&gt; in the program. But this letter does appear in the flag, so if counting the flags you should count the &lt;code&gt;a&lt;/code&gt;.&lt;br&gt;&#xA;I really don't know about this one. It surely is creative.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="3544" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2012-09-06T07:14:09.557" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="546" PostTypeId="1" CreationDate="2012-09-10T21:35:41.873" Score="10" ViewCount="923" Body="&lt;p&gt;For fair comparison of codegolf solutions in languages with different&#xA;source alphabets, there should be a common unit of information.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Most sizes here are expressed in &quot;characters&quot; or &quot;bytes&quot;, but not all&#xA;characters are created equal. A brainfuck character can only have 8 values.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The standard measure of information in information theory is a bit.&#xA;A brainfuck character is better counted as 3 bits.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Syntactic constraints may further reduce the entropy of program source.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In brainfuck not all 3^n length n programs are valid, because brackets&#xA;must balance. A fancier measure of information content per character&#xA;would be the limit for n-&gt;infinity of&lt;/p&gt;&#xA;&#xA;&lt;p&gt;log (# valid programs of n charcters) / n&lt;/p&gt;&#xA;&#xA;&lt;p&gt;but that is generally hard to compute.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For your favorite language, what is the number of possible values&#xA;of a character?&#xA;And what is the best known upper bound on the source entropy?&lt;/p&gt;&#xA;" OwnerUserId="5241" OwnerDisplayName="John Tromp" LastEditorUserId="29560" LastEditDate="2016-02-13T01:31:10.313" LastActivityDate="2016-10-26T11:55:42.790" Title="Fair size comparison across languages with different source alphabets" Tags="|discussion|code-golf|scoring|" AnswerCount="6" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="547" PostTypeId="1" CreationDate="2012-09-08T17:58:33.817" Score="5" ViewCount="771" Body="&lt;p&gt;While &lt;code&gt;C&lt;/code&gt; and similar languages provide beautiful and entertaining (and very hard) possibilities for golfing and obfuscation, most code-golf problems on this site have a &lt;code&gt;golfscript&lt;/code&gt; solution, or a solution using the unix shell or some scripting language. This is frequently due to the overheads present in structured languages (variable declaration, library imports, &quot;int main(){}&quot;, etc.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/3994/write-a-code-golf-problem-in-which-java-wins&quot;&gt;This quest to find a problem where Java wins&lt;/a&gt; gave me the idea:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Write a code golf problem, where C-like or otherwise structured languages have an advantage against scripting languages.&lt;/strong&gt; (and against esoteric languages, regular expressions, etc.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The languages which have an advantage &lt;em&gt;must&lt;/em&gt; have variable declarations, and &lt;em&gt;must&lt;/em&gt; provide at least structural programming, or better yet, OOP. The more &quot;C-like&quot;, the better (C, C++, Java, C#, etc.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem should &lt;em&gt;generally&lt;/em&gt; favor these languages, not just be a problem where one specific language with one specific compiler wins due to generating a unique error message long enough to be infeasible to be implemented with a shorter code in any other language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As the criteria are &lt;em&gt;highly subjective&lt;/em&gt; (language choice, what defines a &quot;scripting language&quot;, what the advantage should be, etc.), the winner will be solely decided by votes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The answer with the highest vote count will be selected as winner, not sooner than 10 days after the first answer gets a higher than zero score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;An example would be a code-golf problem, where a C and a Pascal program would fare better than golfscript or a shell script. I don't even know if it is possible, but there are a lot of smart people out there.&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;EDIT:&lt;/strong&gt; Ultimately the voters decide, but if you think you can outsmart the rules, you can do it, if you believe the voters would like it. However, to limit the number of trivial answers, it would be better if the answers would feature programs which really did something useful, so: they should have input and they should have output depending on it. This is a recommendation, not a hard rule, so if you think you can convince your voters, it's your choice...&lt;/p&gt;&#xA;" OwnerUserId="4249" OwnerDisplayName="vsz" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-02-01T21:35:46.097" Title="Write a code golf problem in which script languages are at a major disadvantage" Tags="|discussion|" AnswerCount="9" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="548" PostTypeId="2" ParentId="547" CreationDate="2012-09-08T19:02:18.513" Score="5" Body="&lt;p&gt;In programming competitions, the way that you avoid people using scripting languages (which in this case, I'd define to be any language that runs primarily in an interpreted mode) is to make runtime a factor. &lt;/p&gt;&#xA;" OwnerUserId="5388" OwnerDisplayName="alvonellos" LastActivityDate="2012-09-08T19:02:18.513" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="549" PostTypeId="2" ParentId="547" CreationDate="2012-09-08T19:21:15.210" Score="1" Body="&lt;p&gt;Copy an arbitrary number of bytes from the stack to the heap.&lt;/p&gt;&#xA;" OwnerUserId="2501" OwnerDisplayName="Griffin" LastActivityDate="2012-09-08T19:21:15.210" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="550" PostTypeId="2" ParentId="547" CreationDate="2012-09-08T22:44:37.907" Score="3" Body="&lt;p&gt;Play on things high-level languages don't have, or hide pretty deep.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First thing that comes to mind would be to ask for the shortest program to segfault, playing on many languages' proud lack of pointers.&lt;/p&gt;&#xA;" OwnerUserId="199" OwnerDisplayName="J B" LastActivityDate="2012-09-08T22:44:37.907" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="551" PostTypeId="2" ParentId="547" CreationDate="2012-09-09T03:26:39.760" Score="0" Body="&lt;p&gt;As someone who fondly remembers the days of optimized ASM graphics demos, simply require the program to be under 'n' bytes, where 'n' is smaller than the text of the script required to define the problem but greater than the number of compiled bytes from a language like C.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;PERL sometimes still managed to squeeze large algorithms into tiny spaces however, so a semi-complex problem would be required.&lt;/p&gt;&#xA;" OwnerUserId="5398" OwnerDisplayName="mikebabcock" LastActivityDate="2012-09-09T03:26:39.760" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="552" PostTypeId="2" ParentId="547" CreationDate="2012-09-12T10:20:55.993" Score="1" Body="&lt;p&gt;I'm pretty much going with you can not invent such a problem.&#xA;Scripting languages is a broad category and many of them have different advantages and disadvantages. Programming languages like perl, python, ruby and many more may have started as a scripting language but evolved to actual general purpose programming languages and it is therefore up to debate whether you still want to count them as scripting languages or not. If you are referring to application-specific script languages (like some audio or video processing tools have) then there certainly are problem which can not be solved comfortably in such languages. (Also many of those tools switched to actual general purpose programming languages like those mention before or lisp dialects and many more). &#xA;Also I highly doubt that you can create a golf problem where esoteric programming languages are at a disadvantage since various esoteric programming languages have been created solely for the purpose of being fit for golfing. Especially since languages with a big standard library are usually at an advantage because you have much more functionality available at lower costs. If Haskells prelude would also import Data.List, Data.Ord, Data.Function ... it would be at a much more advantage at golfing. You certainly can design problems where your favorite language is at an advantage (because there is already a builtin function which does the job (this is what eso languages usually do)) but that's it. &lt;/p&gt;&#xA;" OwnerUserId="5429" LastActivityDate="2012-09-12T10:20:55.993" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="554" PostTypeId="2" ParentId="9" CreationDate="2012-09-13T09:15:50.560" Score="5" Body="&lt;p&gt;Why do you demand &quot;the language is being used in the real world&quot;? Golfing is not a real word problem. Reducing the size of your program may have been a real world application many years ago. Reducing the size of a program is still an issue for web applications using tons of JavaScript but that process is not golfing. Golfing is about finding the shortest program, not take an existing program and just squeeze (remove white-space, line breaks, only one char identifiers etc.) it. &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Can you find at least a project using that language on the web&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That one is trivial. I can write webpages in esoteric programming languages, in fact, I've already done things like that. &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Does the programming language have at least 10 page of documentation about it &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Why would the quantity of documentation matter? Extremely simple languages barely need one page of documentation. &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;My feeling is that it's best to implement &quot;soft&quot; site-wide policies like not using built-in features of languages that automatically solve the bulk of the problem.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Why not? Golfing is about finding the shortest program in a language. If the language has a function which nearly does the job than that is the shortest way to do it. &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The absolute shortest answer is secondary to me, and certainly a very short answer in a tool language that was designed for the domain of the problem isn't that interesting at all. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Again, if that is the case you are not golfing. It's not golfing if you just want some decent looking solution.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Are there two or more web-frameworks for serious use for the language?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That's no way to measure anything. Haskell has many good web-frameworks but is still considered (at least from the java/oop mainstream) to be a silly language nobody would use in production. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;To sum up: If you want language agnostic golfing than some esoteric looking languages or even plain esoteric languages will win in some challenges. That's just the way it is. If you look at anarchy golf J kicks ass. It wasn't invented for golfing (probably ;)) but it turns out to be very good at it. Look at it as a sport. You won't set a maximum height for a basket ball player just because some are bigger than others and that turns out to be an advantage in some situations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Otherwise create code golf problems and judge each language separately. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you are not interested in golfing but interested in comparing your pseudo-leet-skills then just don't do golfing. Invent something else. &lt;/p&gt;&#xA;" OwnerUserId="5429" LastActivityDate="2012-09-13T09:15:50.560" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="555" PostTypeId="2" ParentId="546" CreationDate="2012-09-13T13:53:29.243" Score="7" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;For fair comparison of codegolf solutions in languages with different source alphabets, there should be a common unit of information.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Define 'fair'. How do you want to count that in languages allowing the full range of utf-8 for example?&lt;/p&gt;&#xA;" OwnerUserId="5429" LastActivityDate="2012-09-13T13:53:29.243" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="557" PostTypeId="2" ParentId="2140" CreationDate="2012-10-08T13:57:11.913" Score="2" Body="&lt;h1&gt;Huffman Decoding&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a programm which takes two strings as input and prints a text.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The first argument is a &lt;a href=&quot;http://en.wikipedia.org/wiki/Huffman_coding&quot; rel=&quot;nofollow&quot;&gt;Huffman Tree&lt;/a&gt;, serialized in the following format:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;every ascii character except &lt;code&gt;~&lt;/code&gt; is always a leaf, if &lt;code&gt;~&lt;/code&gt; is the first characater it is also a leaf.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;lt;tree0&amp;gt;&amp;lt;tree1&amp;gt;~&lt;/code&gt; is a tree where &lt;code&gt;&amp;lt;tree0&amp;gt;&lt;/code&gt; is the left subtree and &lt;code&gt;&amp;lt;tree1&amp;gt;&lt;/code&gt; is the right subtree.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Example: &lt;code&gt;ab~cde~~~&lt;/code&gt; generates this tree:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; ┌─┴─┐&#xA;┌┴┐ ┌┴─┐&#xA;a b c ┌┴┐&#xA;      d e&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;a&lt;/code&gt; would have the key &lt;code&gt;00&lt;/code&gt;, &lt;code&gt;b&lt;/code&gt; &lt;code&gt;01&lt;/code&gt;, &lt;code&gt;c&lt;/code&gt; &lt;code&gt;10&lt;/code&gt;, &lt;code&gt;d&lt;/code&gt; &lt;code&gt;110&lt;/code&gt; and &lt;code&gt;e&lt;/code&gt; the key &lt;code&gt;111&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The second argument is a text that has been compressed with with the Huffman code that is defined by the first parameter. This bit-string can contain any bit sequence (also null-bytes and non-printable characters) and is not byte aligned, therefore it has been encoded with a variation of the standard &lt;a href=&quot;http://en.wikipedia.org/wiki/Base64&quot; rel=&quot;nofollow&quot;&gt;Base64&lt;/a&gt; encoding:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the characters used for the encoding are the standard base64 characters: &lt;code&gt;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;the bitstring is broken up into 6-bit chunks and mapped to this characters&lt;/li&gt;&#xA;&lt;li&gt;if the last chunk is smaller than 6 bits, a character with this prefix is used, and padding characters are added to the string:&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;-&lt;/code&gt;   : the last chunk was five bits long&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;=&lt;/code&gt;   : the last chunk was four bits long&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;=-&lt;/code&gt;  : the last chunk was three bits long&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;==&lt;/code&gt;  : the last chunk was two bits long&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;==-&lt;/code&gt; : the last chunk was one bit long&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;bits:       1 1 1 1 0 1 1 0 1 0 0 1 1 1 0 1 0 1 0 0 0 1 1 0 1&#xA;chunks:    |1 1 1 1 0 1|1 0 1 0 0 1|1 1 0 1 0 1|0 0 0 1 1 0|1[0 0 0 0 0]|&#xA;characters:       9           p           1           G           g&#xA;base64:     9p1Gg==-&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Your programm has to decode the text encoded in the second parameter and print it to stdout.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You have to provide your source code encoded in the way described above.&#xA;The length of your encoded source code + the length of your serialized huffman tree will be the winning criterion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TODO: example input&lt;/p&gt;&#xA;" OwnerUserId="4626" LastEditorUserId="4626" LastEditDate="2012-10-18T13:15:26.403" LastActivityDate="2012-10-18T13:15:26.403" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="558" PostTypeId="2" ParentId="547" CreationDate="2012-10-21T16:37:55.527" Score="0" Body="&lt;p&gt;Make sure the input is easily parsed by &lt;code&gt;scanf&lt;/code&gt;!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Make the criteria the (one with the least) maximum memory footprint of the running process (including language run-time). Scrpting languages use &lt;em&gt;heaps&lt;/em&gt; more memory, usually.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="2381" LastEditDate="2012-10-23T07:31:17.467" LastActivityDate="2012-10-23T07:31:17.467" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="561" PostTypeId="2" ParentId="435" CreationDate="2012-11-01T06:56:39.533" Score="1" Body="&lt;p&gt;I found this question hoping to propose the same thing. Since the [tips] questions are all CW, it seems convenient to have one answer in the [tips] question for each language for a collaborative library. If you keep using the same idiom and abbreviations, add them to the KB, and save yourself X chars next time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my PS answers, I find I keep needing a control structure that combines for and forall. I'd love to lose some of the overhead.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To use it in a golf answer, one would have to cite a specific revision dated earlier than the question (no ex-post-facto).&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2012-11-01T06:56:39.533" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="562" PostTypeId="2" ParentId="546" CreationDate="2012-11-01T07:10:30.600" Score="-1" Body="&lt;p&gt;Well, I for one, agree &lt;em&gt;in principle.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also agree with all the obstacles to accomplishing something like this. &quot;How are you gonna handle ...?&quot; [shrug!]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But everyone says a thing can't be done &lt;strong&gt;until&lt;/strong&gt; someone does it.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2012-11-01T07:10:30.600" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="563" PostTypeId="1" CreationDate="2012-11-02T01:13:14.157" Score="10" ViewCount="240" Body="&lt;p&gt;I can understand the need to keep things under control and nip problem trends in the bud based on the experience at SO and other graduated sites. While [tips] questions strain the discussion/list criteria, at least they're tidy if confined to one-per-language and all tagged.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But questions like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/8859/hello-world-in-1024-characters&quot;&gt;&quot;Hello World in 1024 chars&quot;&lt;/a&gt; and &quot;Creative Programming&quot;; even though they attract riff-raff, they attract valuable contributors as well. Many of the 'historic' closed list questions on SO have massive votes and stars. But if we're too trigger happy, few participants can get into the &lt;em&gt;history books&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would it be possible to have a special [fun] tag, where say, you need a minimum rep to post (do some work first), and a restriction on frequency of usage (you've had your [fun] this month)?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And CW. (Have Cake+Eat Cake)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="66833" LastEditDate="2021-06-09T14:15:26.990" LastActivityDate="2021-06-09T14:15:26.990" Title="Isn't there some way to have &quot;just-for-fun&quot; questions?" Tags="|discussion|feature-request|status-declined|scope|" AnswerCount="0" CommentCount="5" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="564" PostTypeId="1" CreationDate="2012-11-02T02:59:55.680" Score="20" ViewCount="651" Body="&lt;p&gt;Where as&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The site has stableized (not to stay stagnated) with fairly low activity.&lt;/li&gt;&#xA;&lt;li&gt;There have been from time to time questions that do not meet the requirements in our FAQ but &lt;em&gt;do&lt;/em&gt; draw much attention and many answers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Is it time to consider removing or modifying the &quot;objective winning criteria&quot; requirement.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Things to consider&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Would we need some new or additional definition of a &quot;good challenge&quot;. If so, what?&lt;/li&gt;&#xA;&lt;li&gt;Would there still be a way to define the site's scope that wasn't pervertable to make this Stack Overflow Second Chance?&lt;/li&gt;&#xA;&lt;li&gt;How would non-objective question differ from simple popularity contests, or does this not matter&lt;/li&gt;&#xA;&lt;li&gt;... anything else that comes to your mind ...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78" LastActivityDate="2012-12-20T19:34:01.277" Title="Should we consider dropping or modifying the &quot;objective winning criteria&quot; requirement?" Tags="|discussion|scope|site-health|winning-criteria|" AnswerCount="7" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="565" PostTypeId="2" ParentId="5" CreationDate="2012-11-02T05:03:04.897" Score="1" Body="&lt;h1&gt;CodeSport?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;or .. um .. Code-thletics? :(&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2012-11-02T05:03:04.897" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="566" PostTypeId="2" ParentId="564" CreationDate="2012-11-02T05:40:33.630" Score="6" Body="&lt;p&gt;I think this site is about three things - programming, creativity and fun.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any question that offers a good chance to combine the three is, in my opinion, welcome.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are advantages to requiring an objective winning criteria, mainly because limitations often help provoke creativity. The need to meet a specific challenge forces you think, and you may come up with something ingenious. With objective criteria, you can compare yourself with other answers and see when you need to try harder and outdo them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, treating this as an obligatory requirements seems to me too strict.&lt;br&gt;&#xA;The real question is whether a question sufficiently limits the solution. A challenge to &quot;write the most awesome program&quot; is surely off-topic, and &lt;a href=&quot;https://codegolf.stackexchange.com/q/6707/3544&quot;&gt;&quot;Print a line 10 times&quot;&lt;/a&gt; is on the edge. But a question that limits the answer enough so that giving a reasonable answer is challenging has the potential get good answers, and is therefore a good question.&lt;/p&gt;&#xA;" OwnerUserId="3544" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2012-11-02T05:40:33.630" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="567" PostTypeId="2" ParentId="564" CreationDate="2012-11-02T13:56:23.027" Score="5" Body="&lt;p&gt;Since it was this question: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/8859/hello-world-in-1024-characters/8873#8873&quot;&gt;Hello World 1024&lt;/a&gt;, that garnered this meta question being asked I will address it from the view of this question. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;As @ugoren said any question here needs to limit the criteria of answers in some way otherwise the site will become bloated with stuff that is not wanted. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the case of the Hello World question I would like to point out several things:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The Op specifically set out rules that in-fact made the question challenging for those willing to follow them.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;With those rules in mind, I don't see a problem with letting the users decide who the winner is. Obviously the winning answer would have to fall within the rules set out by the Op.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;As someone who has used stack-exchange for a while now, this question was the first one that made me actually create a new account on code-golf.se. So that I could 1. Answer the question and 2. upvote other solutions.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The quality of the responses (well most of them) for this question have been outstanding. The C# answer that used the SE API to answer the solution was brilliant! Any question that can garner that type of solution should be within the scope of this site.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="6746" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2012-11-02T13:56:23.027" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="568" PostTypeId="2" ParentId="564" CreationDate="2012-11-02T14:13:27.460" Score="8" Body="&lt;p&gt;I think the biggest issue is not the objective winning criteria, rather I think it's the narrow definition of this site as a whole. Perhaps the the scope of this site should be expanded, not to replace the rules, but to include more than golf tips, code golf, and programming puzzles.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By the definition of its own name, &quot;Programming Puzzles &amp;amp; Code Golf&quot; does not include challenges where answers are picked collectively by the users themselves or by some subjective winning criteria (judged competitions).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yesterday, I started the question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/8859/hello-world-in-1024-characters&quot;&gt;Hello World in 1024 characters&lt;/a&gt;. It was my first day perusing this SE site (and I apologize for not being more familiar with the rules). My first impression was that this site was for having fun with code, first and foremost, and that was what drew me in. My second impression was indeed the lack of participation in many of the questions, as well as the low frequency of new questions being added. In an attempt to stir up some activity, I started a question that I thought was simple enough to tackle in a reasonable amount of time, would include a plethora of languages for diversity, and encourage active gamesmanship while people tried to out-wit each other with creativity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem I see with code-golfing is that not all languages have a chance at winning, leaving a distinct advantage to individuals with particular experience. In addition to this, within whatever language it may be, there is ultimately only one true possible shortest code, and the first person to post it wins. This leaves very little incentive to a vast number of coders to toss their hat into the ring, so to speak.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I do not think there is any doubt for wanting to increase the activity here. I'm fairly certain we would all love to see more new faces, and more of the old ones. By my thinking, the best way to accomplish this is by having questions that inspire the community to post answers, any one of which having the potential to be selected as the winner, instead of intimidating those lesser experienced of us from posting anything at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Looking at the answers to my question, it is clear to see that the range of skill is immense, from the spare time hobbyist, to the code-for-a-living professional. Had I posted a challenge that I thought would challenge everybody, I would have left a large portion of skillsets on the doorstep. Conversely, if I had created a moderate challenge that would be geared towards those further towards the &quot;hobbyist&quot; side of the skill-scale, the big dogs would blow it out of the water, which would ALSO discourage lesser experienced coders.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The inherent problems that arise from voted or judged questions are based on the subjectivity itself.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The OP may not be familiar with many of the languages he or she is&#xA;likely to come across, and therefor picks an answer written in their&#xA;language of choice.&lt;/li&gt;&#xA;&lt;li&gt;The users who are doing the up-voting may not be&#xA;up-voting based on the intended criteria set in place by the OP.&lt;/li&gt;&#xA;&lt;li&gt;The OP may never even select an answer, and without an objective winning&#xA;criteria, nobody ever finds out who won.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If we can address these three points, I think we'll be onto something.&lt;/p&gt;&#xA;" OwnerUserId="6733" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2012-11-02T14:13:27.460" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="569" PostTypeId="2" ParentId="564" CreationDate="2012-11-03T08:19:25.980" Score="2" Body="&lt;p&gt;I feel rather ambivalent about &quot;Hello World 1024&quot;. I &lt;em&gt;do&lt;/em&gt; love getting votes. But I've done much better work on answers that received no votes at all (often late to the party).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So ... [shrug!]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Perhaps pushing the sports analogy would help. Perhaps a sampling of &quot;non-competitive&quot; questions that are inviting (Invitational?) and fun, and in the other corner, the &lt;em&gt;hard&lt;/em&gt; golfs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the risk of failing to heed the SO [homework] lesson, what about a [fun] tag which explicitly calls for &quot;relaxed competition criteria&quot; (details TBD).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[&lt;em&gt;I'm not a sports fan and am probably misusing sports terms and concepts.&lt;/em&gt;]&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="2381" LastEditDate="2012-11-03T08:31:37.020" LastActivityDate="2012-11-03T08:31:37.020" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="570" PostTypeId="2" ParentId="2140" CreationDate="2012-11-04T09:16:05.690" Score="1" Body="&lt;h2&gt;Compile BF to TM&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a compiler accepting a Brainfuck program (previous challenge: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/84/interpret-brainfuck&quot;&gt;Interpret Brainfuck&lt;/a&gt;, wikipedia: &lt;a href=&quot;http://en.wikipedia.org/wiki/Brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brainfuck&lt;/a&gt;) as input and outputting a Turing Machine which produces identical output when supplied with the same (correct) input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may select the output format from among the various formats accepted by the answers to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/8787/turing-machine-simulator&quot;&gt;Turing Machine Simulator&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following links may also be useful.&lt;br&gt;&#xA;&lt;a href=&quot;http://www.iwriteiam.nl/Ha_bf_intro.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;An introduction to programming in BF&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;http://www.iwriteiam.nl/Ha_bf_Turing.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;BF is Turing-complete&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;http://www.earlham.edu/~peters/courses/logsys/turing.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Programming a Turing Machine&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;http://programmingpraxis.com/2009/03/27/a-turing-machine-simulator/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Programming Praxis: Turing Machine Simulator&lt;/a&gt;  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Equivalently, you may write a Brainfuck interpreter in TM, or any partial compilation/interpretation which results in a TM program as described above.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we consider squares of the TM tape to represent bits (blank=0, mark=1) of the BF memory, then eight squares represent a cell. Each BF instruction translates to a minimum of 8 states of the Turing Machine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;'&gt;' &quot;advance&quot; (++ptr) could be implemented by eight states (sixteen transitions):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;adv8 _ adv7 R _&#xA;adv8 1 adv7 R 1&#xA;adv7 _ adv6 R _&#xA;adv7 1 adv6 R 1&#xA;adv6 _ adv5 R _&#xA;adv6 1 adv5 R 1&#xA;adv5 _ adv4 R _&#xA;adv5 1 adv4 R 1&#xA;adv4 _ adv3 R _&#xA;adv4 1 adv3 R 1&#xA;adv3 _ adv2 R _&#xA;adv3 1 adv2 R 1&#xA;adv2 _ adv1 R _&#xA;adv2 1 adv1 R 1&#xA;adv1 _ link R _&#xA;adv1 1 link R 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where 'link' represents the first state of the following instruction.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;'&amp;lt;' &quot;rewind&quot; (--ptr) can be implemented similarly by making leftward movements and rewriting the same symbol just read.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;'+' &quot;increment&quot; (++*ptr) can be implemented by a ripple-carry from the Least Significant Bit to the Most Significant Bit, borrowing &quot;rewind&quot; states to back-up to &lt;em&gt;normal&lt;/em&gt; position. If the LSB is on the left, it would look something like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;inc8 _ link N 1&#xA;inc8 1 inc7 R _&#xA;inc7 _ rew1 N 1&#xA;inc7 1 inc6 R _&#xA;inc6 _ rew2 N 1&#xA;inc6 1 inc5 R _&#xA;inc5 _ rew3 N 1&#xA;inc5 1 inc4 R _&#xA;inc4 _ rew4 N 1&#xA;inc4 1 inc3 R _&#xA;inc3 _ rew5 N 1&#xA;inc3 1 inc2 R _&#xA;inc2 _ rew6 N 1&#xA;inc2 1 inc1 R _&#xA;inc1 _ rew7 N 1&#xA;inc1 1 overflow N 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;em&gt;overflow&lt;/em&gt; is a HALT state.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For I/O, the simplest way I can think is to place all input on the tape after the memory area, and expand the alphabet to include a symbol indicating the dividing line between the memory portion and the input portion of the tape. In fact, by expanding the cell size to nine squares, this symbol can serve as an input &lt;em&gt;pointer&lt;/em&gt;, advancing as the input is consumed. (So &quot;advance&quot; and &quot;rewind&quot; now need 9 states each.) And another new symbol is written in front of the current memory cell to serve as the memory pointer. Inputting a byte therefore consists of schleping each bit over the entire space between the two tape positions with something like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input _ set-memptr L _&#xA;input 1 set-memptr L 1&#xA;set-memptr _ find-inptr R *&#xA;find-inptr _ find-inptr R _&#xA;find-inptr 1 find-inptr R 1&#xA;find-inptr $ schlep-bit R $&#xA;schlep-bit _ schlep-blank L _&#xA;schlep-bit 1 schlep-one L 1&#xA;schlep-blank $ schlep-blank L $&#xA;schlep-blank _ schlep-blank L _&#xA;schlep-blank 1 schlep-blank L 1&#xA;schlep-blank * deposit-blank R *&#xA;schlep-one $ schlep-one L $&#xA;schlep-one _ schlep-one L _&#xA;schlep-one 1 schlep-one L 1&#xA;schlep-one * deposit-one R *&#xA;deposit-blank _ etc R _&#xA;deposit-blank 1 etc R _&#xA;deposit-one _ etc R 1&#xA;deposit-one 1 etc R 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &quot;etc&quot; represents going to get the next bit in similar fashion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To perform a loop (all BF loops are &quot;while&quot; loops, so the exit control is at the beginning and the end has a simple goto back to the beginning), we need first to check is the current cell is zero,&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;zero8 _ zero7 R _&#xA;zero8 1 body R 1&#xA;zero7 _ zero6 R _&#xA;zero7 1 left1 L 1&#xA;zero6 _ zero5 R _&#xA;zero6 1 left2 L 1&#xA;zero5 _ zero4 R _&#xA;zero5 1 left3 L 1&#xA;zero4 _ zero3 R _&#xA;zero4 1 left4 L 1&#xA;zero3 _ zero2 R _&#xA;zero3 1 left5 L 1&#xA;zero2 _ zero1 R _&#xA;zero2 1 left6 L 1&#xA;zero1 _ exit-loop R _&#xA;zero1 1 left7 L 1&#xA;left7 _ left6 L _&#xA;left7 1 left6 L 1&#xA;left6 _ left5 L _&#xA;left6 1 left5 L 1&#xA;left5 _ left4 L _&#xA;left5 1 left4 L 1&#xA;left4 _ left3 L _&#xA;left4 1 left3 L 1&#xA;left4 _ left3 L _&#xA;left4 1 left3 L 1&#xA;left3 _ left2 L _&#xA;left3 1 left2 L 1&#xA;left2 _ left1 L _&#xA;left2 1 left1 L 1&#xA;left2 _ loop-body L _&#xA;left2 1 loop-body L 1&#xA;...&#xA;loop-body-final _ zero8 N _&#xA;loop-body-final 1 zero8 N 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So assuming the machine starts at tape-location 0, and the input is on the tape starting at 0 and going to the right,  the &quot;startup code&quot; for this arrangement would be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;startup _ place$ L _&#xA;startup 1 place$ L 1&#xA;place$ _ left270000 L $&#xA;left270000 _ left269999 L _&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Jeez! The output is going to be &lt;strong&gt;&lt;em&gt;HUGE!&lt;/em&gt;&lt;/strong&gt; It might be better to treat the BF memory as negative-indexed and reverse all the _L_s and _R_s in 'advance', 'rewind', 'increment', and 'decrement'. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Questions:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bonuses for optimizations? If I can implement this myself and provide a complete example output, The bonus could be &quot;subtract the difference between your program's output for the example input with the example output&quot;. So eliminating states would be far more valuable than shrinking the code. One could possibly achieve a negative score!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Edit:&lt;/em&gt; Actually I think this is unreasonable unless the Turing Machine is augmented with non-reading (movement-only or epsilon) transitions. Duplicating every letter of the alphabet just to move over one square is just ridiculously painful. That means this challenge won't link-up nicely with the other one. :(&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What about, instead of implementing the compiler, just devise a translation scheme (as above) that leads to a smaller output for a trivial sample program (based on calculating, rather than coding)? &quot;Back of the envelope&quot; compiler.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.653" LastActivityDate="2012-12-17T05:37:59.563" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="571" PostTypeId="2" ParentId="564" CreationDate="2012-11-07T07:26:38.527" Score="1" Body="&lt;p&gt;It seems there are two extremes:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;very strict objective winning criteria. This means that the answer must have a score based only on the text of the answer itself, like character count. This basically allows very few questions which are not code-golf. The danger is, that at least 99% of the problems will be code-golf, and nearly 100% of them will be won by golfscript.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;very lax or no objective winning criteria. This allows for much more creativity, but has a major drawback: it allows questions like &quot;Hey write the most beautiful code in C++, that's all!&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;I suggest something in-between. For example, allow high quality and interesting questions where the winner is chosen by some subjective criteria, like number of votes, &lt;strong&gt;but it has to specify the criteria very well&lt;/strong&gt;. This means, there should be constraints what the code must abide and the voters should be encouraged to vote based on how well the code achieves those (even if subjective) constraints. Remember the good subjective / bad subjective debate on stackoverflow?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How else would you host beautiful competitions &lt;a href=&quot;http://underhanded.xcott.com/&quot; rel=&quot;nofollow&quot;&gt;such as this&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="4249" LastEditorUserId="4249" LastEditDate="2012-11-12T07:12:57.360" LastActivityDate="2012-11-12T07:12:57.360" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="573" PostTypeId="1" CreationDate="2012-11-09T06:19:19.737" Score="1" ViewCount="80" Body="&lt;p&gt;I added a bounty yesterday to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1197/output-a-playable-crossword-grid&quot;&gt;this question&lt;/a&gt; and I chose the text &quot;One of the answers is deserving of additional bounty&quot;. But when I pulled it up today to award it (hoping to have inspired votes from others in the meantime), the text is &quot;Looking for an authoritative source&quot;. Do we even need that one here?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I think there's a bug, because it's not the one I selected.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And the feature-request is to remove the &quot;authoritative source&quot; option altogether. &lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="68942" LastEditDate="2021-06-05T23:21:50.640" LastActivityDate="2021-06-05T23:21:50.640" Title="That's not the bounty text I selected" Tags="|feature-request|bug|status-norepro|bounty|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="574" PostTypeId="2" ParentId="573" CreationDate="2012-11-09T06:41:02.880" Score="2" Body="&lt;p&gt;There doesn't seem to be much use for that message expect perhaps for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I haven't heard of other having trouble with getting the wrong text, but it is at least possible that the dialog box has gotten out of sync with the code somehow.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your request goes over the heads of mere moderators. I don't know that the team will want to make per-site adjustments to the bounty texts, but a representative will likely be along sooner or later.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2012-11-09T06:41:02.880" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="575" PostTypeId="2" ParentId="547" CreationDate="2012-11-20T15:10:14.020" Score="1" Body="&lt;p&gt;How about a code golf where the measurement being golfed is the compiled assembly, rather than the characters used? Obviously one could write in assembly, but for a complex enough problem, it would be more accessible to those using compilers. Most scripting languages would be out.&lt;/p&gt;&#xA;" OwnerUserId="750" LastActivityDate="2012-11-20T15:10:14.020" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="576" PostTypeId="1" AcceptedAnswerId="12986" CreationDate="2012-11-22T06:27:10.660" Score="4" ViewCount="117" Body="&lt;p&gt;I'm excitedly working-up an answer to this question:&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/4732/emulate-an-intel-8086-cpu&quot;&gt;Emulate an Intel 8086 CPU&lt;/a&gt; . But even though there are several answers, there's no smorgasboard of goodies to steal from like many other older questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should I (May I) prod the answerers to &lt;em&gt;cough up the code&lt;/em&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And, Is there a maximum length for code blocks in answers? Would I be asking the impossible for some?&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2017-06-19T11:16:26.503" Title="Is there a maximum length for a code block/Why all the links instead of code?" Tags="|discussion|support|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="577" PostTypeId="2" ParentId="2140" CreationDate="2012-11-22T10:30:44.253" Score="1" Body="&lt;h1&gt;Graphical Output -- Esoteric Artifacts -- The Glass Bead Game&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Draw the Cabalistic Tree of Life&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Simply described, the Tree of Life is an undirected network of nodes representing the conduit between matter and higher forms of spiritual energy. It has an upper face arranged in a hexagon, and a lower fact built from equilateral triangles adjacent to the lower two edges of the upper face. Don't label the paths, paths may overlap however you wish, may be single (thick) lines, even. Code Golf. Bonus -100 for labels on the Sephiroth (nodes); Bonus -150 for Hebrew labels.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/i18jh.png&quot; alt=&quot;Tree of Life after Kirtcher&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Draw a Mandala for each Natural Number&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Draw a circle with interesting visual patterns using the input N [ 1 .. \inf ) to determine the number of points around the circle to anchor figures whose shape is also modified by the input N. Actually, 12 seems like a good max: they're pretty much a blur after that no matter what.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Eg. &lt;a href=&quot;http://code.google.com/p/xpost/downloads/detail?name=ve6a.ps&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://code.google.com/p/xpost/downloads/detail?name=ve6a.ps&lt;/a&gt;&lt;br&gt;&#xA;//lotsoflines n = 1 ..12  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/bvLG5.png&quot; alt=&quot;Mandalas 1 - 12&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(doesn't need to be this elaborate, This is &gt;600 lines of showing-off.).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;. . . need good images for these . . .&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Draw the Ptolemeic System of the Universe&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;All the stuff I could find is animated already. Maybe this one's done-to-death. :(&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Update:&lt;/strong&gt; Found good stuff on &lt;a href=&quot;http://www.alchemywebsite.com/amcl_astronomical_material.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Alchemy&lt;/a&gt;. The &quot;Keplar Platonic&quot; model could be fun (3D and all). &lt;a href=&quot;http://www.alchemywebsite.com/emblems/embl317.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;This one&lt;/a&gt; looks good, too. &lt;a href=&quot;http://www.alchemywebsite.com/emblems/embl337.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;And this&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Draw the Pythagorean Monochord&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;aka pre-classical nomogram. &lt;em&gt;I misplaced my Pythagoras books, I know I've got a picture somewhere.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;http://www.celestialmonochord.org/log/images/celestial_monochord.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;the one I was thinking of&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I think &lt;a href=&quot;http://www.sacredscience.com/archive/WortmannDiagrams_files/image189.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;this one's even cooler&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Draw the I-Ching Hexagrams in King Wen Sequence.&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/King_Wen_sequence&quot; rel=&quot;nofollow noreferrer&quot;&gt;King Wen sequence -- Wikipedia&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://www.biroco.com/yijing/sequence.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;some nice info and images&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I suppose I need to implement this first to avoid copyright issues! :)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="2381" LastEditDate="2012-12-20T12:35:49.507" LastActivityDate="2012-12-20T12:35:49.507" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="578" PostTypeId="1" CreationDate="2012-11-22T10:51:36.733" Score="1" ViewCount="94" Body="&lt;p&gt;Well, I love code golfing, and this site is a really good idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I was wondering if there's some reward or motivation for posting results ? If there are none (apart from the randomness of someone voting for you because it thinks your solution is cool), what is the motivation for posters (ok, fame, glory, ... maybe I'm too greedy)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm asking it because I've seen on some questions that there are very few votes on the results. And sometimes, there are votes on first answers, and none on better answers (with less strokes on the same langage) which have been posted 2 or 3 days later.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Did I miss something ? Maybe there should be an implicit deadline on contests, and a rule stating that the players should vote for best answers when the deadline has been reached.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What do you think ? (and sorry for my poor english)&lt;/p&gt;&#xA;" OwnerUserId="5346" LastActivityDate="2012-11-22T21:33:52.763" Title="Is there some kind of reward?" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="579" PostTypeId="2" ParentId="578" CreationDate="2012-11-22T15:41:20.257" Score="-1" Body="&lt;p&gt;Deadlines are probably a nice idea, in that other golfing sites also have them. They encourage people to submit soon. Certainly, for the &lt;a href=&quot;https://stackoverflow.com/q/62188/13&quot;&gt;first golfing contest&lt;/a&gt; I ran on Stack Overflow, while I didn't have a strict time limit, where there were two entries of 1 byte long, I &lt;a href=&quot;https://stackoverflow.com/questions/62188/stack-overflow-code-golf/597372#comment2449021_597372&quot;&gt;favoured the earlier submission&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, the Stack Exchange software doesn't directly have any deadline-based thing, except for bounties. And while there are some site-specific customisations (e.g., this site has higher limits for auto-community-wiki, and other sites have MathJax), I don't know if a brand-new feature like this would get implemented &quot;just for one site&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So the best you can get for now is a social convention, not anything the site software can enforce.&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2012-11-22T15:41:20.257" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="580" PostTypeId="2" ParentId="576" CreationDate="2012-11-22T16:16:17.937" Score="2" Body="&lt;p&gt;The is a maximum length limit for posts (questions and answers). I believe that it is around 32k characters. That necessarily imposes a a upper limit on how much code you can post, though I find that I am able to write some quite &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/337/78&quot;&gt;extensive&lt;/a&gt; things inside that limit.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2012-11-22T16:16:17.937" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="581" PostTypeId="2" ParentId="578" CreationDate="2012-11-22T21:33:52.763" Score="3" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;But I was wondering if there's some reward or motivation for posting results?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I would analyse the motivation for posting thusly:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The really fun part is doing the golfing, but once you've done that there's little reason not to post unless you're way behind everyone else.&lt;/li&gt;&#xA;&lt;li&gt;The scoring allows you to try to beat the others. There's a Kantian aspect here too: if no-one posted, you'd never know how good your solution was.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I'm asking it because I've seen on some questions that there are very few votes on the results. And sometimes, there are votes on first answers, and none on better answers (with less strokes on the same langage) which have been posted 2 or 3 days later.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;These are indeed both problems. Most people aren't going to check every answer methodically to see whether it's better than the previous ones and upvote it if so.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Maybe there should be an implicit deadline on contests, and a rule stating that the players should vote for best answers when the deadline has been reached.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I think that having a deadline is throwing the baby out with the bathwater. The result will be that someone who discovers the site for the first time sees not a vast array of possible challenges but a narrow set of recent ones. Rather than the current situation of their late answer being potentially undervoted, they wouldn't be able to post it in the first place. Is that an improvement?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See also the related question &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/542/should-i-change-the-accepted-answer&quot;&gt;Should I change the accepted answer?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2012-11-22T21:33:52.763" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="582" PostTypeId="1" AcceptedAnswerId="583" CreationDate="2012-11-27T20:27:21.940" Score="0" ViewCount="170" Body="&lt;p&gt;If I recall correctly, the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/170/code-golf-userscript-to-help-in-navigating-the-site-v0-37-now-available&quot;&gt;chrome user script&lt;/a&gt; used to be recommended in the About/FAQ pages somewhere, but I can't find it anymore.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I know that UserScripts must be installed from the Chrome Web Store now, is this why it has been removed?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Are there plans to migrate the script into an extension that can be installed from the web store?  I found it very useful when I had it a few months back and it would help &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; submissions that are posted a little slower.&lt;/p&gt;&#xA;" OwnerUserId="3473" LastEditorUserId="68942" LastEditDate="2021-06-09T05:49:02.490" LastActivityDate="2021-06-09T05:49:02.490" Title="Is the Chrome UserScript still recommended?" Tags="|discussion|feature-request|status-declined|code-golf|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="583" PostTypeId="2" ParentId="582" CreationDate="2012-11-28T02:24:00.637" Score="3" Body="&lt;p&gt;This procedure seems to be a workaround&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Download the script from &lt;a href=&quot;http://files.quickmediasolutions.com/codegolf/count_it.user.js&quot; rel=&quot;nofollow&quot;&gt;here&lt;/a&gt; (Save Link As...)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now visit this url chrome://chrome/extensions/&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Drag the script from Downloads and drop in the window.&lt;/p&gt;&#xA;" OwnerUserId="95" LastActivityDate="2012-11-28T02:24:00.637" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="584" PostTypeId="1" CreationDate="2012-11-28T06:36:43.023" Score="3" ViewCount="496" Body="&lt;p&gt;Edit: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/12844/emulate-a-mos-6502-cpu&quot;&gt;It happened already.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm really thrilled about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4732/emulate-an-intel-8086-cpu&quot;&gt;Emulate an Intel 8086 cpu&lt;/a&gt;, but I wonder if there's simple ISA which could be implemented more fully in a page or two of code. Such a bank of solutions could then be used as targets for testing of a tantalizing series of challenges: assembler, calculator, debugger, shell, GUI??!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So what would be a good choice for a &quot;Full-Featured CPU Emulator&quot; challenge? PDP? 6502? UNIVAC???&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To add some excitement, I'll accept this first answer to hit 5 votes and move it to the sandbox.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Update (1/24/2013): We have a front-runner.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Current Results (7/17/2013): 6502 clearly front of the heat.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;0 for PDP-1&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1 for PDP-8&lt;/p&gt;&#xA;&#xA;&lt;p&gt;3 for 6502&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1 for MMIX&lt;/p&gt;&#xA;&#xA;&lt;p&gt;0 for 4004&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2013-10-17T06:30:06.667" Title="Processor choice for a Full-CPU emulator challenge?" Tags="|discussion|" AnswerCount="5" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="585" PostTypeId="2" ParentId="584" CreationDate="2012-11-28T06:36:43.023" Score="1" Body="&lt;h1&gt;PDP-1&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I've already &lt;a href=&quot;https://stackoverflow.com/a/7203667/733077&quot;&gt;gathered some resources about it.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It'll run LISP and SpaceWar! (with a CRT device).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;hr&gt;&#xA;This could be more fun (or more preposterous) if it were made a GUI challenge to draw DAS BLINKENLIGHTS!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/cixNH.jpg&quot; alt=&quot;best image I could find, I&amp;#39;m afraid&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Can't suggest edits on non-wiki meta posts! who knew?!&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's some info on the PDP-8. From the &lt;em&gt;digital Small Computer Handbook&lt;/em&gt;, 1967.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The PDP-8 is a general-purpose, stored-program computer, featuring a 1.5 microsecond random accesscoore memory, a fast arithmetic processor, and a buffered input-output control. These features combine to make the PDP-8 one of the most popular on-line computers for physics and biomedical analysis and process control. The PDP-8 is also used in large systems as a control element and as a training computer.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;The PDP-8 is easy to install, maintain, and use, with comprehensive software, customer-tested in over 500 installations. The basic system includes 4096 words of 12-bit ferrite core memory, keyboard-printer and tape reader-punch, eight auto-index registers, wired-in analog-to-digital converter, program interrupt, data interrupt, and indirect addressing.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;A partial list of central processor options includes the Extended Arithemtic Element for high speed, double precision arithmetic, Memory Modules and Control for increasing memory size in increments of 4096 words to 32,768 words; a Data Cannel Multiplexer providing direct memory access for seven external devies; and a Serial Drum for storage of 65.536 to 262,144 words.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;The applications success of the PDP-8 has led Digital to develop a series of computers based on the PDP-8 to meet a number of special needs, resulting in a unique gaily of small computer products. These include the DISPLAY 8, the LINC-8, the TYPESETTING-8, the MULTIANALYZER-8, and the new PDP-8/S.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;SPECIFICATIONS:&lt;br&gt;&#xA;  Word length: 12 bits&lt;br&gt;&#xA;  Memory: 4096 to 32,768 words; cycle time 1.5 microseconds&lt;br&gt;&#xA;  Add Time: 3.0 microseconds&lt;br&gt;&#xA;  In-Out Tranfer Rates: 7,992,000 bits per second&#xA;  Standard I/O Devices: Printer-keyboard with paper tape punch and reader&#xA;  Instructions: 49 with standard equipment, expandable to over 100 as optional equipment is added.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2012-12-04T08:44:15.053" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="586" PostTypeId="2" ParentId="584" CreationDate="2012-11-28T06:39:59.817" Score="1" Body="&lt;p&gt;I was dorking around with a PDP-8 simulation a few months ago. It's both a very simple chip and possessed of tricky corners in the micro-coding. Nothing finished, however.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2012-11-28T06:39:59.817" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="587" PostTypeId="2" ParentId="584" CreationDate="2012-11-30T08:21:15.443" Score="2" Body="&lt;h1&gt;6502&lt;/h1&gt;&#xA;&lt;p&gt;From the &lt;em&gt;Master Handbook of Microprocessor Chips&lt;/em&gt;, by Charles K Adams:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Features of the 6502:&#xA;Eight bit parallel processing.&#xA;56 Instructions.&#xA;Decimal and binary arithmetic.&#xA;Thirteen addressing modes.&#xA;True indexing capability.&#xA;Programmable stack pointer.&#xA;Variable length stack.&#xA;Interrupt capability.&#xA;Bus compatible with M6800.&#xA;Pipeline architecture.&#xA;65K Addressable bytes of memory (A0-A15).&#xA;IRQ interrupt.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;From &lt;em&gt;Microcomputer Builder's Bible&lt;/em&gt;, by Chris Johnson:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The MOS Technology 6502 microprocessor, used in the APPLE II, Atari and OSI Superboard computer, is similar to the 6800. The 6502 runs on a single +5V power supply and has an onboard crystal oscillator. The crystal can be attached directly to the chip. The 6502 is designed around 256 word &amp;quot;pages&amp;quot; of memory. There are instructions that will work only with data in page 0 and the stack is similarly limited. The stack pointer is only eight bits wide (in contrast to the 8080 or 6800 sixteen bit stack pointer) which limits the stack to a single page in memory.&lt;/p&gt;&#xA;&lt;p&gt;In general, the 6502 has a great number of addressing modes but is severely limited by the width of its registers. [source copyrighted 1982 -droog] The two index registers (X and Y) are also only eight bits wide. There are no general-purpose registers other than the accumulator. A common complaint about the 6502 concerns the exceptions in its instruction set -- some instructions can be used with only one index register or the other! All in all, however, it is efficient and quite fast. Basic interpreters written for the 6502 tend to be faster than similar programs on the other microprocessors. [source also describes 8080, 8085, Z-80, 6800, TMS 9900,  8086, Z8000, 68000, but none in detail]&lt;/p&gt;&#xA;&lt;p&gt;Register: 8-bit accumulator, two 8-bit index registers, status register, 8-bit stack pointer, 16-bit program counter.&lt;/p&gt;&#xA;&lt;p&gt;Interrupts: One maskable, one nonmaskable interrupt&lt;/p&gt;&#xA;&lt;p&gt;I/O Space: Uses memory mapped I/O&lt;/p&gt;&#xA;&lt;p&gt;Memory space: 64K of addressable space.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2012-12-03T02:53:55.327" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="588" PostTypeId="1" CreationDate="2012-12-03T03:15:33.477" Score="0" ViewCount="59" Body="&lt;p&gt;Judging by a few comments I read on this site, a general complaint is that the later answer get much less attention. Higher scored answers are propelled up, get in the view first and keep scoring - because the whole answer list is usually long and people get tired of reading through. Isn't it a vicious circle? My question is: do you think sorting chronologically and putting most recent answers on top would be more appropriate for the default answer sorting this site? And probably not by the recent edit date, but the original post date.&lt;/p&gt;&#xA;" OwnerUserId="4997" LastEditorUserId="4997" LastEditDate="2012-12-03T04:32:58.593" LastActivityDate="2012-12-03T04:32:58.593" Title="The default order of answers should be chronologically recent?" Tags="|discussion|answers|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="589" PostTypeId="2" ParentId="588" CreationDate="2012-12-03T03:32:55.453" Score="3" Body="&lt;p&gt;This is in your control. Questions with answers show three tabs (right side of the image) allowing you to control the presentation order.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/TZDax.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, to address the questions of &quot;should&quot;, I'll note that the most common use case for a post to a Stack Exchange site is a non-user coming to the site after searching the web. These folks are looking for answer. Not only that, but &lt;em&gt;good&lt;/em&gt; answer without a lot of work. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;And that is the whole point of the voting: to crowdsource evaluation of potential answer, and give those visitors what they came for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, no. The default sorting for answers should not be newest first.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2012-12-03T03:32:55.453" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="590" PostTypeId="2" ParentId="584" CreationDate="2012-12-15T18:27:37.833" Score="1" Body="&lt;p&gt;I've always loved the &lt;a href=&quot;http://mmix.cs.hm.edu/&quot; rel=&quot;nofollow&quot;&gt;MMIX&lt;/a&gt;, which is the architecture to be used in future editions of The Art of Computer Programming. It has a very clean but rich instruction set, a good separation between user-mode and kernel-mode instructions, a register-based function call mechanism (rather than a stack-based one that most current architectures use), and so much more.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For coding challenges, I would probably just ask people to implement the user-mode instructions, leaving the kernel-mode instructions unimplemented.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2012-12-15T18:27:37.833" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="591" PostTypeId="2" ParentId="547" CreationDate="2012-12-19T22:43:50.453" Score="3" Body="&lt;p&gt;Just go the opposite way! &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Invent an interpreter, which accepts C like syntax, but works without &lt;code&gt;main&lt;/code&gt; and has popular headers pre included. Make it available publicly, and use it for your solutions. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hm. Aren't PHP or Lua pretty much such languages? &lt;/p&gt;&#xA;" OwnerUserId="373" LastActivityDate="2012-12-19T22:43:50.453" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="592" PostTypeId="2" ParentId="564" CreationDate="2012-12-19T23:22:06.660" Score="3" Body="&lt;p&gt;I'm not an enemy of objective winning criteria. You don't need a voting system to find out, which is the shortest solution. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For very old questions and answers with many upvotes, you can post a new, shortest solution and it will take long, until it climbs towards the top. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Nobody is forced to upvote the shortest solutions, and nobody can be forced to accept the shortest answer. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I enjoy the questions where a creative answer is searched, and I don't participate just to win. It is fun, and I like my answers being upvoted, but I woulnd't learn bf or gs to improve my winning chance. I enjoy to participate. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Creative solution in solving random problems (Pi to 100 places, print 'Hello World', reverse some input, ...) isn't itself a creative question. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;But the same way as we reject 'Print 100 digits of PI' if we have a question 'Print 64 digits of PI', we might avoid questions without esprit. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;We should try to ask for objective winning criterias, but we shouldn't limit our questions that way. &lt;/p&gt;&#xA;" OwnerUserId="373" LastActivityDate="2012-12-19T23:22:06.660" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="593" PostTypeId="1" AcceptedAnswerId="599" CreationDate="2012-12-20T07:37:53.800" Score="3" ViewCount="171" Body="&lt;p&gt;How come we're not part of the &lt;a href=&quot;http://winterba.sh/&quot; rel=&quot;nofollow&quot;&gt;Winter Bash&lt;/a&gt;? Do golfers not wear funny hats?&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="3572" LastEditDate="2012-12-26T22:45:05.443" LastActivityDate="2012-12-26T23:44:08.733" Title="Do golfers not wear funny hats?" Tags="|discussion|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="594" PostTypeId="2" ParentId="584" CreationDate="2012-12-20T16:46:06.770" Score="3" Body="&lt;h1&gt;Intel 4004&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The Intel 4004 was the first CPU to implemented into a single chip. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is a 4-bit processor with 46 instructions.  &lt;/li&gt;&#xA;&lt;li&gt;It can directly access 32,768 bits of ROM and 5,120 bits of RAM. &lt;/li&gt;&#xA;&lt;li&gt;It has sixteen 4-bit registers. &lt;/li&gt;&#xA;&lt;li&gt;It also has a subroutine stack three levels deep.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;(&lt;a href=&quot;http://www.intel.com/assets/pdf/datasheet/4004_datasheet.pdf&quot; rel=&quot;nofollow&quot;&gt;Data Sheet&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I like the idea of simulating this processor because I think that it would be fun to see what sort of programs we can write for it.  How complex can we make the programs to run on this simple processor?&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2012-12-20T16:54:18.347" LastActivityDate="2012-12-20T16:54:18.347" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="595" PostTypeId="2" ParentId="564" CreationDate="2012-12-20T19:34:01.277" Score="2" Body="&lt;p&gt;I am definitely in favor of modifying the requirement of having an objective winning criterion.  I believe that there are many cases where a programming challenge doesn't need to have a winner.  Currently, the goal of many contests is in the form of &quot;write the best program.&quot;  I believe that a lot of the time, it is possible for the goal be in the form of &quot;accomplish this task,&quot; especially if the task is difficult and requires a lot of creativity to complete. This is still a challenge, since it involves programmers trying to do things that they have never done before.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe that if a challenge is to have an official &quot;winner,&quot; then it needs an objective winning criterion; however, I don't think that all challenges need to have an official winner. I also believe that things can be competitive without being a competition.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2012-12-20T19:34:01.277" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="596" PostTypeId="1" CreationDate="2012-12-21T05:00:16.773" Score="0" ViewCount="120" Body="&lt;p&gt;I'm seeing a lot of binary-code submissions in base64 encoding. Wouldn't Hex be better, from a presentation point of view? I can read hex, I can't read base64.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="2381" LastEditDate="2012-12-23T17:19:41.087" LastActivityDate="2012-12-23T17:19:41.087" Title="Encourage hexadecimal over base64 for binary submissions?" Tags="|discussion|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="597" PostTypeId="2" ParentId="596" CreationDate="2012-12-21T05:28:34.860" Score="2" Body="&lt;p&gt;Personally I like hexdump format, as used in &lt;a href=&quot;https://codegolf.stackexchange.com/a/308/3&quot;&gt;one of my answers&lt;/a&gt;. That way, any readable stuff is actually, well, readable. :-)&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2012-12-21T05:28:34.860" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="598" PostTypeId="2" ParentId="596" CreationDate="2012-12-21T11:45:24.680" Score="2" Body="&lt;p&gt;I think both forms have their usefulness.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the vast majority of the program consists of random binary data, a hex representation isn't going to be very useful. A base64 encoding, on the other hand, gives users the ability to test your program directly, without having to perform any manual conversion - especially if you provide a wrapper which generates the program, such as provided for &lt;a href=&quot;https://codegolf.stackexchange.com/a/9131/4098&quot;&gt;this answer&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/a/9054/4098&quot;&gt;this answer&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For shorter answers, and those with a minimal amount of non-ascii characters, I do agree that a hex representation will be more useful.&lt;/p&gt;&#xA;" OwnerUserId="4098" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2012-12-21T11:45:24.680" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="599" PostTypeId="2" ParentId="593" CreationDate="2012-12-26T23:44:08.733" Score="2" Body="&lt;p&gt;When we were planning out the master list of In/Out, I did my best to cycle through all sites' metas and mod chatrooms to see if there was any chatter about HATS and if I could help out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, I didn't see any chatter -- meta posts, chatroom, etc -- here about hats, and when the deadline passed I was obligated to opt Code Golf Stack Exchange out of the running. :( &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Not to worry. There's always next year! :D&lt;/p&gt;&#xA;" OwnerUserId="3162" LastActivityDate="2012-12-26T23:44:08.733" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="601" PostTypeId="1" CreationDate="2013-01-03T21:27:44.897" Score="1" ViewCount="106" Body="&lt;p&gt;By time limit, I mean the OP should include one, such that (s)he will sooner or later accept the winning answer, provided there is at least one valid answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It doesn't have to be a fixed time. Something like &quot;10 days after first answer&quot; is good enough.&lt;/p&gt;&#xA;" OwnerUserId="6972" LastActivityDate="2013-01-03T21:31:27.107" Title="Can we enforce a time limit?" Tags="|discussion|policy|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="602" PostTypeId="2" ParentId="601" CreationDate="2013-01-03T21:31:27.107" Score="3" Body="&lt;p&gt;Acceptance is always in the gift of the asker.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I tend to accept after a week of so, and even included an &quot;official&quot; acceptance date and condition in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2357/1p5-iterated-prisoners-dilemma&quot;&gt;my highest voted question&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think that somthing between 1 and 2 weeks would be a good value for a &quot;suggested default time to acceptence&quot;, but I don't feel that any attempt to enforce acceptence would be productive.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2013-01-03T21:31:27.107" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="604" PostTypeId="2" ParentId="40" CreationDate="2013-01-28T11:50:19.173" Score="2" Body="&lt;p&gt;I think you should treat a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge almost the same as a task or project your boss wants you to work on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the language you want to use to solve this task isn't appropriate, I suppose you won't ask your boss to adjust the project, to fit to your preferred programming language.&lt;br /&gt;&#xA;Instead, you'll choose an appropriate language, to solve the problem fast and elegant.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The other possibility, much easier on Codegolf.SE than explaining to your boss, would be to accept the challenge, deal with the pitfalls of your preferred language, and perhaps come up with a solution you never thougt about before, just to compensate some weird input/output mechanisms.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, as long as the problem doesn't specify the language it wants to be solved in, it's your choice.&lt;/p&gt;&#xA;" OwnerUserId="6526" LastActivityDate="2013-01-28T11:50:19.173" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="605" PostTypeId="2" ParentId="2140" CreationDate="2013-02-11T09:26:12.680" Score="2" Body="&lt;h2&gt;Polygon prefixes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Polygons are named after the number of sides that they have. A pentagon has 5 sides, an octagon has 8 sides. But how are they named? What's the name for a 248-sided polygon?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All polygons are suffixed with &lt;code&gt;-gon&lt;/code&gt;. There are specific prefixes for each polygon depending on the number of sides. Here are the prefixes for the lower numbers:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3 - tri&#xA;4 - tetra&#xA;5 - penta&#xA;6 - hexa&#xA;7 - hepta&#xA;8 - octa&#xA;9 - nona&#xA;10 - deca&#xA;11 - undeca&#xA;12 - dodeca&#xA;13 - triskaideca&#xA;14 - tetradeca&#xA;15 - pentadeca&#xA;16 - hexadeca&#xA;17 - heptadeca&#xA;18 - octadeca&#xA;19 - nonadeca&#xA;20 - icosa&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Polygons with 21 to 99 sides have a different system. Take the prefix for the tens digit (found on the left column), the ones digit (right column below), and then stick a &quot;kai&quot; between them to get &lt;code&gt;(tens)(ones)gon&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;20 - icosi       | 1 - hena&#xA;30 - triaconta   | 2 - di&#xA;40 - tetraconta  | 3 - tri&#xA;50 - pentaconta  | 4 - tetra&#xA;60 - hexaconta   | 5 - penta&#xA;70 - heptaconta  | 6 - hexa&#xA;80 - octaconta   | 7 - hepta&#xA;90 - nonaconta   | 8 - octa&#xA;                 | 9 - nona&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The 3-digit sided polygons are named in a similar fashion. A 100-sided polygon is called a hectogon. Take the hundreds digit, find it on the column for ones digits, then stick a &quot;hecta&quot; to its right. Now number off the tens and ones like above: &lt;code&gt;(hundreds)hecta(tens)(ones)gon&lt;/code&gt;. If the hundreds place digit is a 1, don't put the prefix behind &quot;hecta&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, given an integer (3 &amp;lt;= n &amp;lt;= 999), return the name of an n-sided polygon. &lt;code&gt;n-gon&lt;/code&gt; is not a valid answer :P&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As with all code golf, shortest code wins.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Is the description good? Would it be harder if I instead asked for the number of sides, given a name?&lt;/p&gt;&#xA;" OwnerUserId="4303" LastEditorUserId="4303" LastEditDate="2013-02-11T16:04:05.743" LastActivityDate="2013-02-11T16:04:05.743" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="606" PostTypeId="2" ParentId="2140" CreationDate="2013-02-12T16:18:53.167" Score="1" Body="&lt;h2&gt;Self-Golfing Code?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I don't know if I just didn't search hard enough, but I couldn't find any challenge regarding self-golfing code, or rather, any code that can deterministically reduce another set of text code to a much smaller program, yet still compile/run.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, take this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;int main() {&#xA;std::cout&amp;lt;&amp;lt;&quot;Hello world 1!&quot;&amp;lt;&amp;lt;std::endl;&#xA;std::cout&amp;lt;&amp;lt;&quot;Hello world 2!&quot;&amp;lt;&amp;lt;std::endl;&#xA;std::cout&amp;lt;&amp;lt;&quot;Hello world 3!&quot;&amp;lt;&amp;lt;std::endl;&#xA;std::cout&amp;lt;&amp;lt;&quot;Hello world 4!&quot;&amp;lt;&amp;lt;std::endl;&#xA;std::cout&amp;lt;&amp;lt;&quot;Hello world 5!&quot;&amp;lt;&amp;lt;std::endl;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And output this (&lt;em&gt;as one possible solution&lt;/em&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#define A std::cout&amp;lt;&amp;lt;&quot;Hello world &#xA;#define B !&quot;&amp;lt;&amp;lt;std::endl;&#xA;#define C B A&#xA;int main() {&#xA;A 1 C 2 C 3 C 4 C 5 B&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Alternative:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Sub MySub()&#xA;Dim aNumber As Integer&#xA;Dim someString As String&#xA;aNumber = 123&#xA;someString = &quot;abc&quot;&#xA;MsgBox aNumber&#xA;MsgBox someString&#xA;End Sub&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;into (&lt;em&gt;again, as one possible solution&lt;/em&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Sub m()&#xA;Dim a As Integer&#xA;Dim s As String&#xA;a = 123&#xA;s = &quot;abc&quot;&#xA;MsgBox a&#xA;MsgBox s&#xA;End Sub&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Do we have a challenge for this? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If not, here are some rules I envision:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Golfing code need not be in the same language as code to be golfed.&lt;/li&gt;&#xA;&lt;li&gt;Since compilers/running of code varies, newly golfed code must still run under same environment.&lt;/li&gt;&#xA;&lt;li&gt;Possible challenge scoring (multiple options -- thinking code golf):&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1: Shortest golfing code wins (not my favorite, since you can minimally shorten the base code, yet still write the shortest program).&lt;/li&gt;&#xA;&lt;li&gt;2: Shortest output of a set of pre-defined code (potentially limiting if participants are unfamiliar with the options available)&lt;/li&gt;&#xA;&lt;li&gt;3: Combination of length of golfing code and the output result of the same as input. (Ratio, summation, etc.) -- This I think is my preferred option.&lt;/li&gt;&#xA;&lt;li&gt;4: &lt;strong&gt;Multi-player&lt;/strong&gt; Ratio of golfed size of other participants' own code versus their original submission. (Similar limitations to that of point #2.)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3862" LastEditorUserId="3862" LastEditDate="2013-02-13T17:38:47.837" LastActivityDate="2013-02-13T17:38:47.837" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="607" PostTypeId="1" CreationDate="2013-02-21T05:30:01.117" Score="10" ViewCount="608" Body="&lt;p&gt;Our &lt;a href=&quot;http://area51.stackexchange.com/proposals/4570/code-golf-programming-puzzles&quot;&gt;Area 51 Page&lt;/a&gt; shows the number of questions as the biggest issue, with number of visits as also less than ideal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can we do something about this? What?!&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2013-11-15T18:17:46.503" Title="(How) Are we going to get out of beta?" Tags="|discussion|beta-status|" AnswerCount="4" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="608" PostTypeId="2" ParentId="607" CreationDate="2013-02-21T05:39:48.047" Score="2" Body="&lt;p&gt;How about a 'Clean up the Sandbox' event? Over a weekend, everybody try to get sandbox I ready and posted. Do it again (2weeks/month) later for the next one.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2013-02-21T05:39:48.047" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="609" PostTypeId="2" ParentId="89" CreationDate="2013-02-21T06:54:45.583" Score="4" Body="&lt;p&gt;Something in the User Interface, perhaps?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What about a more structured answer submission, where the code is uploaded as a file, automatically counted, and displayed with a multi-tab view to show ascii/hex/disassembly? of the more extreme submissions. This would clear up the Hex/Base64 debate. Delayed binding.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It would also be really nice if we could tag answers with programming-language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And some kind of auto-indexing on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/rosetta-stone&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;rosetta-stone&amp;#39;&quot; rel=&quot;tag&quot;&gt;rosetta-stone&lt;/a&gt; questions? Just when they get big enough to be cool, they're too big to navigate.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="2381" LastEditDate="2014-08-12T06:20:58.270" LastActivityDate="2014-08-12T06:20:58.270" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="610" PostTypeId="1" CreationDate="2013-02-21T07:01:11.177" Score="1" ViewCount="118" Body="&lt;p&gt;I've seen lots of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; questions, and few &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-curling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-curling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-curling&lt;/a&gt; ones that didn't go over so well. What types of puzzles are there? Why aren't we seeing them?&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2013-02-21T19:22:33.923" Title="Where's the puzzles?" Tags="|discussion|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="611" PostTypeId="2" ParentId="610" CreationDate="2013-02-21T10:22:19.550" Score="1" Body="&lt;p&gt;There's also &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;. The problem with that kind of question is best summed up by &lt;a href=&quot;https://codegolf.stackexchange.com/users/194/peter-taylor&quot;&gt;Peter Taylor's&lt;/a&gt; comments on &lt;a href=&quot;https://codegolf.stackexchange.com/a/4855/737&quot;&gt;this answer&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="737" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2013-02-21T10:22:19.550" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="612" PostTypeId="2" ParentId="89" CreationDate="2013-02-21T18:59:27.323" Score="14" Body="&lt;p&gt;Reward upvotes&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Too often, I see reasonable answers that are ignored by the community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Frankly, this is a particularly stingy site. People are disinclined to up-vote questions and answers. To some extent, this may be due to the fact that many languages are represented here, and most people cannot judge answers in languages they are not proficient in.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Nonetheless I'm wondering whether it might be a good idea to raise the incentive for up-voting.  For example, giving the up voter a point (or a fraction of a point) for each up-vote given. Sure, some people might abuse this by up up voting lots of questions or answers.  But certain restrictions could be put on the number of up votes per day, or the number of rewarded upvotes one might receive in a day.  (It might be restricted, for example, to as few as 5 per day).  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think such measures might encourage people to vote  more, and this would increase the likelihood of their contributing with new questions and answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Btw, I'm not sure whether this is permitted on StackExchange sites. I'm simply putting it out there as a suggestion.&lt;/p&gt;&#xA;" OwnerUserId="3967" LastActivityDate="2013-02-21T18:59:27.323" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="613" PostTypeId="2" ParentId="610" CreationDate="2013-02-21T19:22:33.923" Score="2" Body="&lt;p&gt;Rather than thinking of &quot;programming puzzles&quot; as a separate category my take has been that they are &lt;em&gt;all&lt;/em&gt; puzzles.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2013-02-21T19:22:33.923" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="615" PostTypeId="2" ParentId="607" CreationDate="2013-02-22T21:43:37.373" Score="6" Body="&lt;p&gt;I'm not sure that getting out of beta is a very important goal, but it would certainly be good to have a few more good questions. It's not surprising that we don't have many, because &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/120/rep-points-for-questions/122#122&quot;&gt;writing a good question is hard&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More participation in the sandbox would be excellent. How many of the suggestions currently in there explicitly ask for feedback on some aspect? How many have feedback from more than one person?&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2013-02-22T21:43:37.373" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="616" PostTypeId="1" AcceptedAnswerId="617" CreationDate="2013-03-03T20:25:14.750" Score="4" ViewCount="74" Body="&lt;p&gt;I &lt;a href=&quot;https://meta.stackexchange.com/q/169946/197656&quot;&gt;recently posted on Meta.SO&lt;/a&gt; about the example questions, answers, and comments found on various site's about pages, and &lt;a href=&quot;https://meta.stackexchange.com/a/169950/197656&quot;&gt;was told&lt;/a&gt; that although some sites have auto-system-picked examples, the mods of each site can change the example questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Currently, the following answer is featured on the Code Golf about page:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZgEFA.png&quot; alt=&quot;How to prevent unicorns from eating daisies&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although I don't frequent Code Golf, I have no doubt that unicorns are as much a part of the culture here at Code Golf as they are at MSO, but I think it would be best to show a different question on the about page, since elsewhere on the about page it gives these guidelines for questions:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/cN6fy.png&quot; alt=&quot;Don&amp;#39;t ask about... Anything that&amp;#39;s not a programming puzzle or code golf&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't visit Code Golf often (I'm usually on SO), so maybe I'm missing something, but I think better examples could be chosen.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Would the mods consider manually picking one of the best questions here to put on the about page to help new users better understand the site?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="7471" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-04-23T09:29:32.537" Title="Better about page example questions/answers/comments" Tags="|feature-request|" AnswerCount="2" CommentCount="0" ClosedDate="2021-06-03T01:58:04.743" ContentLicense="CC BY-SA 3.0" />
  <row Id="617" PostTypeId="2" ParentId="616" CreationDate="2013-03-03T21:05:29.303" Score="3" Body="&lt;p&gt;Currently the system is not offering us any to chose from. The &lt;a href=&quot;https://meta.stackexchange.com/a/163948/2509&quot;&gt;conditions for a question to be a candidate&lt;/a&gt; are such that very few CodeGolf.SE questions are going to qualify.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In particular the requirement for the question to be 400 characters or less and without &quot;crazy&quot; formatting which I suspect includes code-blocks; and to have two answer that are similarly short and simple is a real stinker for us.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2013-03-03T21:11:09.530" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="619" PostTypeId="2" ParentId="607" CreationDate="2013-03-04T01:40:26.857" Score="23" Body="&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Non-&quot;codegolf&quot; site alias&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given that this site's URL is &quot;codegolf&quot;, I think it could scare off potential users who have no interest in code golf but are interested in programming puzzles (like myself) (before they even click on a link leading here). So I suggest an alias (not sure whether this is possible) or even a name change, I'm thinking: &lt;code&gt;challenge.stackexchange.com&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A name combining the two is also a possibility, but that may be too long a name.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Post difficult problems from programming competitions / sites&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Not sure if this is 100% in line with what this site is about, if not, it's worth considering an extension to include it. Maybe with a new tag like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/problem-analysis&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;problem-analysis&amp;#39;&quot; rel=&quot;tag&quot;&gt;problem-analysis&lt;/a&gt;. Or we could use existing tags - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;algorithm&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The answers should either provide a high-level description of the solution, or understandable pseudo-code (actual code optional, but not allowed to be the only thing in the answer). Understandability is key - most efficient solution that's clearly understandable wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is always the risk that this could turn into the go-to place for finding solutions for any programming problem, however simple, which is obviously not what we want (though I'm guessing avoiding this is not top priority). We should possibly start off with a strict policy to downvote or flag &lt;strong&gt;very&lt;/strong&gt; simple problems and &lt;strong&gt;any&lt;/strong&gt; answers to these questions (though leave reasonably complex questions alone), though that may scare off users, assuming there are many of these questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not sure if this is exactly a problem, but many of these problems may only have a single 'correct' way of approaching it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We should be able to find many of these problems, a few users should just vow to occasionally post one or two to keep the site moving along (they could even answer it themselves if they choose to).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or is there another site already handling these questions?&lt;br&gt;&#xA;(Update - Stack Overflow currently gets these questions occasionally)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Advertising&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;People can't be here if they don't know about it.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I occasionally mention this site on StackOverflow questions I deem appropriate.&lt;/li&gt;&#xA;&lt;li&gt;There's a TopCoder LinkedIn group I think we could also mention this on (probably assuming (2) is a valid suggestion) (and similar places).&lt;/li&gt;&#xA;&lt;li&gt;Link to the site on your profiles anywhere and everywhere.&lt;/li&gt;&#xA;&lt;li&gt;Anywhere else you can think of.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Less stingy upvoting&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Everyone who's reading this upvoting any questions or answers that they think are acceptable for this site (even if not great) would already help.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Explaining answers&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Explaining solutions well is also important.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And reward these with upvotes and maybe a '+1 for an excellent explanation' comment (so new users know its importance, at least until the site gets many users).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="7199" LastEditorUserId="7199" LastEditDate="2013-11-15T18:17:46.503" LastActivityDate="2013-11-15T18:17:46.503" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="620" PostTypeId="2" ParentId="616" CreationDate="2013-03-07T06:05:34.433" Score="7" Body="&lt;p&gt;Perhaps codegolf needs a more drastic reformatting of the &lt;em&gt;about&lt;/em&gt; page. For one, it should talk about &lt;em&gt;challenges&lt;/em&gt; rather than &lt;em&gt;questions&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2013-03-07T06:05:34.433" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="621" PostTypeId="1" CreationDate="2013-03-16T16:04:57.613" Score="3" ViewCount="280" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/faq&quot;&gt;Code Golf FAQ&lt;/a&gt; says, &amp;quot;You should only ask practical, answerable questions&amp;quot;. &amp;quot;Answerable&amp;quot; I get, but isn't code golf by its nature &lt;em&gt;impractical&lt;/em&gt;, but fun? Aside from the impracticality of minimizing source code length, many of the puzzles that one can solve when golfing don't have practical applications. Are they off limits?&lt;/p&gt;&#xA;&lt;p&gt;I wonder whether the &amp;quot;practical&amp;quot; blurb is Stack Exchange boilerplate text that accidentally got copied over.&lt;/p&gt;&#xA;" OwnerUserId="7550" LastEditorUserId="7550" LastEditDate="2021-06-10T16:24:07.230" LastActivityDate="2021-06-10T16:24:07.230" Title="How is &quot;code golf&quot; compatible with &quot;practical&quot;?" Tags="|discussion|status-deferred|" AnswerCount="2" CommentCount="6" ClosedDate="2017-02-02T11:25:18.190" ContentLicense="CC BY-SA 4.0" />
  <row Id="622" PostTypeId="1" CreationDate="2013-03-18T06:26:23.240" Score="4" ViewCount="84" Body="&lt;p&gt;Pursuant to my idea for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/609/2381&quot;&gt;Q:We need something novel to bring in the hordes&lt;/a&gt;, I think it would be very useful for all questions with many answers (&gt;5, or so) to have an index of answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The index line for each answer could be culled from the first line of the post, accompanied by the user signature, and a mini vote-count/checkmark. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For most of the posts on codegolf.SE, this would effectively provide a list of the programming languages used by each answer without the need to add tags to answers (which I imagine would be a database nightmare).&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="68942" LastEditDate="2021-06-09T06:09:54.067" LastActivityDate="2021-06-09T06:09:54.067" Title="Add an answer &quot;index&quot; feature to questions with more than 5 answers?" Tags="|feature-request|status-deferred|" AnswerCount="0" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="623" PostTypeId="2" ParentId="2140" CreationDate="2013-03-30T20:45:04.863" Score="1" Body="&lt;h2&gt;DeCSS&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It is known that the DVD Content Scrambling System can be deciphered with a &lt;a href=&quot;http://www.cs.cmu.edu/~dst/DeCSS/Gallery/&quot; rel=&quot;nofollow&quot;&gt;rather short program&lt;/a&gt; (434 bytes of C, 472 bytes of Perl). Can you do better?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&amp;lt;&amp;lt; Test cases go here &gt;&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I don't plan to include a more detailed spec, because it will just wind up duplicating some of the code. The test cases would be in the form of (key, link to data file, md5sum of the deciphered stream).&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2013-03-30T20:45:04.863" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="624" PostTypeId="1" CreationDate="2013-03-31T05:46:19.013" Score="1" ViewCount="208" Body="&lt;p&gt;Consider a simple code where the coder imports an external library/module to solve a particular problem. In most cases it will be a built-in library, no problem. But what if someone creates his/her own library to solve the problem. Like&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import x&#xA;x.f()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In this way the problem will be solved in 13 characters. Which is unfair. Now you may ask the coder to add the library &lt;code&gt;x&lt;/code&gt; to the code too. But what if coder says he/she has created that language, and in that language, all you need to do is &lt;code&gt;f()&lt;/code&gt; to solve that problem. Now since golfing allows all the languages, the coder has the right to use his/her own language, which has a built in function &lt;code&gt;f()&lt;/code&gt;. How would you tackle this?&lt;/p&gt;&#xA;" OwnerUserId="7218" LastEditorUserId="517" LastEditDate="2013-04-03T13:09:42.737" LastActivityDate="2016-10-02T10:04:17.403" Title="To what extent are external libraries/modules allowed?" Tags="|discussion|support|" AnswerCount="1" CommentCount="1" ClosedDate="2016-10-03T12:57:56.350" ContentLicense="CC BY-SA 3.0" />
  <row Id="625" PostTypeId="2" ParentId="624" CreationDate="2013-03-31T06:45:17.393" Score="2" Body="&lt;p&gt;What you're describing is called the HQ9+ problem. :-)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the specific case of dealing with HQ9+, you simply avoid making code golfs for Hello World, quines, and 99 Bottles of Beer. :-)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In general, I think it's given that you should only use general-purpose languages designed before the creation of the given problem. And in a related case, for my &lt;a href=&quot;https://stackoverflow.com/q/62188/13&quot;&gt;Stack Overflow code golf&lt;/a&gt;, a contestant &lt;a href=&quot;https://stackoverflow.com/a/70398/13&quot;&gt;created his own language&lt;/a&gt; for the task, but still manages to get beaten by a &lt;a href=&quot;https://stackoverflow.com/a/66744/13&quot;&gt;Befunge entry&lt;/a&gt;. Go figure. :-)&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2013-03-31T06:45:17.393" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="626" PostTypeId="1" CreationDate="2013-04-05T22:22:35.437" Score="5" ViewCount="69" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/about&quot;&gt;https://codegolf.stackexchange.com/about&lt;/a&gt; doesn't describe what the site is about.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It should have a link and a short quote  from &lt;a href=&quot;https://codegolf.stackexchange.com/faq&quot;&gt;https://codegolf.stackexchange.com/faq&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Code golf is a special type of programming puzzle where the shortest&#xA;  correct code submission wins.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;All questions on this site, whether a programming puzzle or a code&#xA;  golf, should have …&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;An objective primary winning criterion, so that it is possible to&#xA;  indisputably decide which entry should win.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;A clear specification of what constitutes a correct submission. Test&#xA;  cases are highly encouraged.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&quot;Tips for golfing in some language&quot;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;These questions are surprisingly hard to write well. Help may be&#xA;  available on the Puzzle Lab chat or the meta Sandbox, and the use of&#xA;  these resources is encouraged.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Also the header of the section &quot;We're a little bit different from other sites&quot; is confusing.&#xA;It is about how StackExchange sites are different from other sites, but doesn't described how &quot;Programming Puzzles &amp;amp; Code Golf site&quot; is different to other Stack Exchange sites.&lt;/p&gt;&#xA;" OwnerUserId="7711" LastEditorUserId="68942" LastEditDate="2021-06-09T05:50:48.540" LastActivityDate="2021-06-09T05:50:48.540" Title="Make &quot;About&quot; page more site specific" Tags="|feature-request|help-center|" AnswerCount="1" CommentCount="3" ClosedDate="2021-06-03T01:58:24.773" ContentLicense="CC BY-SA 3.0" />
  <row Id="627" PostTypeId="1" CreationDate="2013-04-09T01:39:31.193" Score="12" ViewCount="206" Body="&lt;p&gt;I think that there are a lot of things that we can do to improve this site very easily.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;1. A Better Community Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;One major inefficiency is the fact that there is a very low level of successful &quot;sandbox to finished product&quot;  transitions.  There are a &lt;em&gt;lot&lt;/em&gt; of abandoned sandbox proposals, many of which I believe could be turned into actual threads.  Many sandbox threads are abandoned due to a lack of feedback, as even the creator of the sandbox submission will get bored if there is no feedback.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One way of fixing this is to provide a lot of feedback to sandbox ideas.  Even if you only have a very small comment, make a comment anyway because it is important to have a discussion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another &lt;em&gt;very&lt;/em&gt; important thing to do is to upvote sandbox ideas that you like.  When I submit a question to the sandbox, and the question receives very few votes, then I have a high probability of not ever asking that question.  By not upvoting a sandbox suggestion, you are helping to kill that suggestion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One thing to consider is the possibility that we could allow people (other than the original proposer) to move questions from the sandbox into actual questions, if the original proposer hasn't been active for a period of time.  If a person submits a question to the sandbox but ends up not posting it, then that whole idea is effectively killed.  This is one possible way to revive questions from the &lt;em&gt;sandbox of death&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;2. An Idea Bank&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We might also be able to make an &quot;idea bank.&quot;  Basically, the idea bank will be a place where people can go and submit a very brief idea for a thread.  Many people don't really know how to write a good question, or they might not have the time.  The current sandboxes are designed for fully-formed challenges, not simple and underdeveloped &quot;ideas.&quot;  The idea bank would be a place were people can donate ideas to the community, so that people can use utilize those ideas in the form of more questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, say that I had the idea that it would be really cool to create a contest in which the competitor programs a &quot;20 Questions&quot;-type game.  I don't know exactly how to implement the idea, so I submit the idea to the idea bank.  Later, someone else decides that it would be fun to post a challenge, but they can't make up their mind as to what the challenge is going to be about.  That person looks at the idea bank, sees my suggestion, and is able to use it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;3. An Upvote Culture&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Upvoting is the &lt;strong&gt;number one way&lt;/strong&gt; to encourage users to remain on the site.  If a person receives upvotes, then they feel a sense of appreciation.  If a question receives many upvotes, then the user who created that question is more likely to create more questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there is a question that you like, upvote it, even if you do not plan on participating.  Also upvote any of the answers that you like.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there is an answer that you like, then upvote both that answer and the question.  It's hard to write a question that gets good answers.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;4. Different Types of Questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;So, there's basically two types of questions of this site:  code-golf competitions, and competitions in which the goal is very clear and numerically scored.  We can expand the variety (and the shear number) of questions if we allow more types of questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think that we should expand the rules to include questions in which there is no way to assign a numerical score, but in which there is still an obvious way to improve yourself. As long as the challenge is difficult, they can serve as challenges to oneself.  After all, that's why people participate: &lt;em&gt;for the challenge.&lt;/em&gt;  A challenge doesn't have to be a competition with a winner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A second idea is to make a &quot;cooperative challenge.&quot;  We could find programming puzzles from other locations, and the whole website can work together to beat the best score for the puzzle.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;5. Feedback&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;People need feedback.  Positive feedback is usually better than negative feedback, but the best type of feedback is &lt;em&gt;constructive feedback.&lt;/em&gt;  We need to community to come together and help other people become better.  Sandbox feedback and other forms of meta participation are very important.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We can start the feedback process with &lt;em&gt;this&lt;/em&gt; thread.  What do you think about these several proposals?&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2013-04-25T14:21:56.007" Title="What do you think about my ideas for site improvement?" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="628" PostTypeId="2" ParentId="626" CreationDate="2013-04-09T04:14:29.267" Score="1" Body="&lt;p&gt;It turns out that we don't have fine grained control of the formatting of that page.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance the &lt;em&gt;&quot;We're a little bit different from other sites&quot;&lt;/em&gt; bit is not available for editing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I largely agree that the text above there could use some help but I'm not clear what ti should be. Whatever it is, it will appear centered and I can't do bullet lists.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2013-04-09T04:14:29.267" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="629" PostTypeId="2" ParentId="627" CreationDate="2013-04-09T05:06:58.987" Score="6" Body="&lt;p&gt;I think you're &lt;em&gt;spot-on&lt;/em&gt; with regard to the sandbox. Some kid leaves their toys in the box and goes home, let other kids play with it. And the low amount of feedback is a real bummer. It was due to my growing opinion of the sandbox as a &lt;em&gt;dead end&lt;/em&gt; that I was led to start skipping it entirely.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think the idea bank could work well as a chat-room. As a matter of fact, &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/code-golf&quot;&gt;our existing chatroom&lt;/a&gt; has a dire need of content and participation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There have been attempts at new puzzle-types with mixed success. My own question &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/610/wheres-the-puzzles&quot;&gt;Where's the puzzles?&lt;/a&gt; echoes your sentiment that we need more. I applaud the efforts of the &lt;em&gt;underhanded&lt;/em&gt; camp (though I still have no idea what it means).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And upvotes have also been discussed. I've tried to take this to heart personally and upvote and comment on first answers. But it's only the ones I see. Which are only the ones I look at. Which are usually ones where I've given an answer. And if my own answer is sitting there at 0, it's difficult for me to do this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A big help, I think, is if we can somehow get some of our questions into the Hot List. I'm sure there are a &lt;em&gt;lot&lt;/em&gt; of programmers who would fall in love with our site, if only they knew &lt;em&gt;what &lt;strong&gt;code-golf&lt;/strong&gt; is&lt;/em&gt;. I only discovered it recently, through the site-wide stackexchange.com search IIRC.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, yes! You're right. But how do we make it happen?&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2013-04-09T05:06:58.987" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="630" PostTypeId="1" CreationDate="2013-04-09T14:28:56.080" Score="18" ViewCount="789" Body="&lt;p&gt;So, I was reading the related question &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/286/j-and-golfscript-suck-all-the-enjoyment-out-of-code-golf&quot;&gt;here&lt;/a&gt;, when I went off on a tangent.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The point of the given post, as I read it, is that certain languages like GolfScript, K, and some other extremely-high level languages can trivialize Code Golf by taking problems (for the sake of discussion, determining whether some string is a palindrome), and creating a solution in likely less than 15-20 characters, which totally blows other more verbose languages out of the water; they simply can't compete!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A potential solution I want to discuss is probably not a real shocker, and might seem a tad obvious: winners can be tallied by language.  To return to the palindrome example, say User A creates a 65-character Python solution and a 15 character GolfScript solution, while User B creates a 45-character K solution and a 25 character GolfScript solution.  In categories, User A would be the winner for GolfScript, while User B would be the winner for K (at least, until some challenger comes to  take their title away.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The major point I can see against this idea is that there's only one Green Checkmark of Victory.  This idea is imperfect because splitting things up by category raises the question of what it really means to win at Code Golf.  Dividing by language means the possibility of multiple winners, which is thoroughly incompatible with the format of a Q/A site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, the &lt;strong&gt;Meta-Question&lt;/strong&gt;: A) How can we compartmentalize these competitions such that users of arcane, high-level languages can recieve recognition alongside users of more verbose languages, and B) If we accept a multi-winner paradigm, how can we crown the One True Winner?&lt;/p&gt;&#xA;" OwnerUserId="7435" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2013-12-30T21:11:18.513" Title="How to Make Code Golf More Enjoyable: Winners by Language?" Tags="|discussion|code-golf|" AnswerCount="4" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="631" PostTypeId="2" ParentId="630" CreationDate="2013-04-10T15:10:17.917" Score="4" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;The point of the given post, as I read it, is that certain languages like GolfScript, K, and some other extremely-high level languages can trivialize Code Golf by taking problems (for the sake of discussion, determining whether some string is a palindrome), and creating a solution in likely less than 15-20 characters, which totally blows other more verbose languages out of the water&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I disagree with that analysis. Trivial questions get trivial answers. Non-trivial questions may sometimes get very short answers, but at the cost of substantial effort.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A) How can we compartmentalize these competitions such that users of arcane, high-level languages can recieve recognition alongside users of more verbose languages&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Why is it necessary to compartmentalise? Upvotes are recognition. Is the question that interests you how to get people to upvote answers in verbose languages?&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2013-04-10T15:10:17.917" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="632" PostTypeId="1" AcceptedAnswerId="633" CreationDate="2013-04-18T16:25:37.670" Score="3" ViewCount="178" Body="&lt;p&gt;Based on the &lt;a href=&quot;https://codegolf.stackexchange.com/faq#questions&quot;&gt;FAQ&lt;/a&gt;, I know I should limit my questions to specific challenges that have an &quot;objective winning criterion.&quot; This leads me to assume that questions like those I'm asking about are not. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, the simple algorithm I'm attempting to golf (a weasel program) depends on several pseudo-random steps, it's (pseudo)-non-deterministic. Simply posing it as a challenge seems like a problem because although I could specify the seed I used when I coded it in the original language (Python), I imagine that will still cause the results to differ between languages that use different pseudo-random algorithms. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I just pose the question as &quot;how can I further golf this program?&quot; and provide my &lt;strong&gt;working&lt;/strong&gt; code in its current state, is that acceptable, or is this more on-topic for Stack Overflow? I assumed that if I posted a question related to code-golf there, it would be migrated over here anyway, but the FAQ here leaves me uncertain. I have read the &lt;a href=&quot;https://codegolf.stackexchange.com/q/54/7849&quot;&gt;Python tips&lt;/a&gt; question as well. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Perhaps it's not on topic on any SE site, which is also acceptable. &lt;/p&gt;&#xA;" OwnerUserId="7849" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2013-04-18T22:37:16.973" Title="Are questions about how to further golf a program on-topic here?" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="633" PostTypeId="2" ParentId="632" CreationDate="2013-04-18T17:06:08.983" Score="2" Body="&lt;p&gt;My take has been that &quot;How do I golf &lt;em&gt;this&lt;/em&gt; program?&quot; type questions are too localized.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We do, however, have a series of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions where you can find (on a per-language basis) suggested techniques for golfing or abusing language features; In my mind that is different because the answers should apply again and again.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="78" LastEditDate="2013-04-18T17:30:15.443" LastActivityDate="2013-04-18T17:30:15.443" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="634" PostTypeId="2" ParentId="632" CreationDate="2013-04-18T22:37:16.973" Score="3" Body="&lt;p&gt;From the FAQ of the &lt;a href=&quot;http://codereview.stackexchange.com&quot;&gt;Code Review&lt;/a&gt;, I &lt;em&gt;think&lt;/em&gt; it would be on topic there: you post code and want feedback on a specific point. However, I'd ask first in meta there because I'm not sure whether they would consider that a deficiency in the FAQ.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2013-04-18T22:37:16.973" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="635" PostTypeId="2" ParentId="627" CreationDate="2013-04-25T14:21:56.007" Score="3" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;One thing to consider is the possibility that we could allow people (other than the original proposer) to move questions from the sandbox into actual questions, if the original proposer hasn't been active for a period of time.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't think there's anything stopping you from doing that now. What I'd suggest is to drop a comment along the lines of &quot;I think this should be posted and offer to post it&quot;. Then wait a couple of days to see whether the OP replies giving reasons for it to be abandoned (or posts it themself).&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;We might also be able to make an &quot;idea bank.&quot; Basically, the idea bank will be a place where people can go and submit a very brief idea for a thread. Many people don't really know how to write a good question, or they might not have the time. The current sandboxes are designed for fully-formed challenges, not simple and underdeveloped &quot;ideas.&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;There's no reason that the sandbox can't be used for this either. Just make it explicit: add a footer saying something like &quot;I'm not sure how to develop this into a full question - feel free to take it over&quot;.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;So, there's basically two types of questions of this site: code-golf competitions, and competitions in which the goal is very clear and numerically scored.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I would add a third category: questions which have unclear goals and poor or non-existent winning criteria, but which we're not closing, possibly because we get so few good questions that we worry too much about scaring people away.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A second idea is to make a &quot;cooperative challenge.&quot; We could find programming puzzles from other locations, and the whole website can work together to beat the best score for the puzzle.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That doesn't really fit the StackExchange model.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2013-04-25T14:21:56.007" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="636" PostTypeId="2" ParentId="2140" CreationDate="2013-05-10T23:58:28.980" Score="1" Body="&lt;h2&gt;Write a compiler/interpreter for ...&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Inspired by the lisp challenge here.&lt;br&gt;&#xA;It is a series of puzzles.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't like to see a simple &lt;code&gt;eval&lt;/code&gt; solution, so:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;interpreting the language is fine&lt;/li&gt;&#xA;&lt;li&gt;translating the language to a different language is fine.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think this is specific for each language.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Only the syntax and the basic commands.&lt;br&gt;&#xA;Also specific.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Winning criteria should not be code golf.&lt;br&gt;&#xA;The goal should be that you can &quot;learn&quot; an other language by looking at the code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Languages that might be good candidates:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Lisp&lt;/li&gt;&#xA;&lt;li&gt;APL&lt;/li&gt;&#xA;&lt;li&gt;J&lt;/li&gt;&#xA;&lt;li&gt;Brainfuck (already &lt;a href=&quot;https://codegolf.stackexchange.com/questions/84/interpret-brainfuck&quot;&gt;posted&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Whitespace&lt;/li&gt;&#xA;&lt;li&gt;Forth&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="7789" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:21.580" LastActivityDate="2013-05-10T23:58:28.980" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="640" PostTypeId="2" ParentId="2140" CreationDate="2013-06-07T03:37:40.530" Score="2" Body="&lt;h2&gt;Code golfing problem: Surface classification&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;The task:&lt;/strong&gt; Given a surface-word reply with the classification of what surface it is.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example 1:&lt;/strong&gt; Input: &lt;code&gt;aba'b'&lt;/code&gt; ----&amp;gt; Output: &lt;code&gt;1T&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example 2:&lt;/strong&gt; Input: &lt;code&gt;aabcb'c'&lt;/code&gt; ----&amp;gt; Output: &lt;code&gt;3P&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Bounds on the problem:&lt;/strong&gt; Since there are only 26 letters, there will never be more than that many labels. Additionally output should be in the form &lt;code&gt;S&lt;/code&gt;,&lt;code&gt;nT&lt;/code&gt;,&lt;code&gt;mP&lt;/code&gt; for &lt;code&gt;n&lt;/code&gt;,&lt;code&gt;m&lt;/code&gt; positive integers.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Background:&lt;/strong&gt; In the study of algebraic topology students are often presented with diagrams such as the one below. The represent instructions for how to assemble a surface. The assembly is prescribed as: if there are two edges labeled with the letter &lt;code&gt;x&lt;/code&gt; then glue them together so that the arrows point the same direction. To make our job easy, topologists have discovered an algorithmic way to classify surfaces using 'words' assembled from these 'plane gluing-diagrams'.&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/M2mON.png&quot; alt=&quot;enter image description here&quot; /&gt;&#xA;Choosing a corner arbitrarily (top right) and orientation (ccw) we read off the labels on the edges where an inverse appears wherever the arrow points against the orientation. In this case the 'word' that represents this plane model is given as &lt;code&gt;abab&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;A surface word is a string that contains the letters &lt;code&gt;a,b,...,@&lt;/code&gt; up to some letter &lt;code&gt;@&lt;/code&gt; and each letter is contained in it exactly twice. In the two occurrences of each letter: 0, 1, or 2 of them may be postfixed by a &lt;code&gt;'&lt;/code&gt; which I am considering using to represent 'inverse' (opposite orientation).&lt;/p&gt;&#xA;&lt;p&gt;If in a surface word all letters appear twice: once without the &lt;code&gt;'&lt;/code&gt; and once with it (f.ex. &lt;code&gt;ba'b'a&lt;/code&gt;) then we say that the surface the word represents is &lt;em&gt;orientable&lt;/em&gt;. If a surface is orientable then it is necessarily the direct sum of &lt;code&gt;n&lt;/code&gt; Tori for some non-negative integer &lt;code&gt;n&lt;/code&gt;. If this condition doesn't hold (like in &lt;code&gt;aab'b&lt;/code&gt;) then the surface represented is &lt;em&gt;non-orientable&lt;/em&gt;: in this case it is the direct sum of &lt;code&gt;m&lt;/code&gt; Projective Planes for some positive integer &lt;code&gt;m&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Once you have found out if the reduced word is orientable or not, the final answer is given as follows. If orientable and number of unique letters in the reduced word is 1 then output should be &lt;code&gt;S&lt;/code&gt;. Otherwise if the number of unique letters in an orientable word is &lt;code&gt;n&lt;/code&gt; (it will be even) then the output should be &lt;code&gt;sT&lt;/code&gt; where &lt;code&gt;s = n/2&lt;/code&gt;. If the word is non-orientable then the output should be &lt;code&gt;mP&lt;/code&gt; where &lt;code&gt;m&lt;/code&gt; is the number of distinct letters in the reduced word.&lt;/p&gt;&#xA;&lt;p&gt;The goal is to take as input some surface word, reduce it via reduction rules &lt;code&gt;1-6&lt;/code&gt; and then classify it as a sphere, some number of connected tori, or some number of connected projective planes. Here are the 6 reduction rules where &lt;code&gt;~&lt;/code&gt; represents 'reduces to':&lt;/p&gt;&#xA;&lt;p&gt;Let &lt;code&gt;M,A,B,C,D&lt;/code&gt; be surface words, &lt;code&gt;x&lt;/code&gt; be a single letter, and juxtaposition represents concatenation:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;em&gt;Cycle Rule:&lt;/em&gt; If &lt;code&gt;M = AB&lt;/code&gt; then &lt;code&gt;M ~ BA&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Flip Rule:&lt;/em&gt; &lt;code&gt;M ~ M'&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Sphere Rule:&lt;/em&gt; &lt;code&gt;Axx'B ~ AB&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Block Rule:&lt;/em&gt; &lt;code&gt;ABC ~ ADC&lt;/code&gt; if &lt;code&gt;B&lt;/code&gt; is a surface word and &lt;code&gt;B ~ D&lt;/code&gt; by 1 or 2&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Cylinder Rule:&lt;/em&gt; If &lt;code&gt;M = AxBCx'D&lt;/code&gt;, then &lt;code&gt;M ~ AxCBx'D&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Möbius Rule:&lt;/em&gt; If &lt;code&gt;M = AxBxC&lt;/code&gt; then &lt;code&gt;M ~ AxxB'C ~ AB'xxC&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;I am looking for input on:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;should this be &lt;code&gt;code-golf&lt;/code&gt; or &lt;code&gt;programming-challenge&lt;/code&gt;?&lt;/li&gt;&#xA;&lt;li&gt;how would scoring work?&lt;/li&gt;&#xA;&lt;li&gt;???&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If I feel satisfied with the question in a few days I'll post it to the site.&lt;/p&gt;&#xA;" OwnerUserId="8133" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2013-06-08T16:24:07.500" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="641" PostTypeId="2" ParentId="2140" CreationDate="2013-06-07T07:18:09.290" Score="1" Body="&lt;h1&gt;Missile Command&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'm making this CW, because it needs &lt;em&gt;lots&lt;/em&gt; of help. I've been toying with this idea for a while. Think &quot;battleship&quot; to get in the right mind-frame. But, instead of ships, what you lay down are tiles which represent a Befunge-style program. This program controls the behavior of guided missiles ejected from the &lt;em&gt;spawn&lt;/em&gt; tile. The goal is to program a missile which will obliterate an opponent's program block, as well as guard its own control block.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Haven't nailed-down the board size. 20x20 seems a little cramped.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;         1         2&#xA;12345678901234567890&#xA;____________________1  4x20 program block&#xA;____________________2&#xA;____________________3&#xA;_______@____________4&#xA;....................5  12x20 arena&#xA;....................6&#xA;....................7&#xA;....................8&#xA;....................9&#xA;....................01&#xA;....................1&#xA;....................2&#xA;....................3&#xA;....................4&#xA;....................5&#xA;....................6&#xA;___________@________7  4x20 program block&#xA;____________________8&#xA;____________________9&#xA;____________________02&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Tiles&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;@&lt;/code&gt; &lt;em&gt;spawn&lt;/em&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Program control.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm imagining these to change direction of the code for &quot;boustrophedon&quot; writing.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;this,then\&#xA; txen,siht&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;haven't thought it all though, yet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;/&lt;/code&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;\&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Movement.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;F&lt;/code&gt; &lt;em&gt;forward&lt;/em&gt; move forward one square&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;B&lt;/code&gt; &lt;em&gt;back&lt;/em&gt; move back one square&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;L&lt;/code&gt; &lt;em&gt;left&lt;/em&gt; turn left 90&amp;deg;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;R&lt;/code&gt; &lt;em&gt;right&lt;/em&gt; turn right 90&amp;deg;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So the submissions would be 4x20 code blocks which compete in a king-of-the-hill style.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2013-06-07T07:18:09.290" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="643" PostTypeId="2" ParentId="2140" CreationDate="2013-06-19T02:14:44.360" Score="1" Body="&lt;h2&gt;Find all of the Scrabble numbers:&lt;/h2&gt;&#xA;&lt;p&gt;A scrabble number is a number &lt;code&gt;n&lt;/code&gt; whose scrabble representation can score &lt;code&gt;n&lt;/code&gt; points. As an example consider &lt;code&gt;12&lt;/code&gt;: its English spelling &lt;code&gt;twelve&lt;/code&gt; has value &lt;code&gt;12&lt;/code&gt; when it is placed on a stretch of six blank tiles. Since the highest ever reported 1 word scrabble score barely exceeds &lt;code&gt;2000&lt;/code&gt; points, that will be the upperbound for this challenge.&lt;/p&gt;&#xA;&lt;p&gt;Score and quantities for English:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2 blanks |  x1  |  x2  |  x3  |  x4  |  x6  |  x8  |  x9  |  x12 |&#xA;    1    |      |      |      | LSU  | NRT  | O    | AI   | E    |&#xA;    2    |      |      | G    | D    |      |      |      |      |&#xA;    3    |      | BCMP |      |      |      |      |      |      |&#xA;    4    |      | FHVWY|      |      |      |      |      |      |&#xA;    5    | K    |      |      |      |      |      |      |      |&#xA;    8    | JX   |      |      |      |      |      |      |      |&#xA;   10    | QZ   |      |      |      |      |      |      |      |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Considerations for either bonus points to scoring or extra requirements:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Respect the board, only using gaps between double/triple letter and double/triple word scores that occur on a standard scrabble board.&lt;/li&gt;&#xA;&lt;li&gt;Respect the tile count for each letter.&lt;/li&gt;&#xA;&lt;li&gt;There are non-English versions of scrabble, maybe it should be 'language-agnostic' (lol, but seriously is there a reason to accept only English submissions?).&lt;/li&gt;&#xA;&lt;li&gt;Should the 2 blanks be allowed?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8133" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2013-06-19T02:14:44.360" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="644" PostTypeId="2" ParentId="2140" CreationDate="2013-06-25T16:22:27.550" Score="1" Body="&lt;h1&gt;Sort all lines according to their corresponding Levenshtein Distance to the first line.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Shamelessly borrowed from: &lt;a href=&quot;http://golf.shinh.org/p.rb?Levenshtein+Distance+Sort+FIXED&quot; rel=&quot;nofollow&quot;&gt;http://golf.shinh.org/p.rb?Levenshtein+Distance+Sort+FIXED&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For a definition of the Levenshtein Distance, look here: &lt;a href=&quot;http://en.wikipedia.org/wiki/Levenshtein_algorithm&quot; rel=&quot;nofollow&quot;&gt;http://en.wikipedia.org/wiki/Levenshtein_algorithm&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Takes input from stdin.&#xA;Must work for all possible input.&#xA;Get points for:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Smallest character count.&#xA;Using Languages that are difficult to golf in.&#xA;I think character count / the average values from here (&lt;a href=&quot;http://golf.shinh.org/lranking.rb&quot; rel=&quot;nofollow&quot;&gt;http://golf.shinh.org/lranking.rb&lt;/a&gt;) might suffice?&lt;/p&gt;&#xA;" OwnerUserId="8389" LastActivityDate="2013-06-25T16:22:27.550" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="645" PostTypeId="2" ParentId="2140" CreationDate="2013-07-05T18:06:32.613" Score="2" Body="&lt;h1&gt;&lt;strong&gt;Fastest Code: checking if interval pairs overlap&lt;/strong&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given an unsorted input of many interval pairs (50+), write the fastest algorithm to determine if they do not overlap.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An interval pair is said to overlap if &lt;em&gt;interval x&lt;/em&gt; &lt;strong&gt;and&lt;/strong&gt; &lt;em&gt;interval y&lt;/em&gt; are overlapping.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example input 1:&lt;br&gt;&#xA;interval x , interval y  &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;10-25, 50-60&#xA;10-15, 25-60&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;br&gt;&#xA;Can be in any true false format.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;false (They overlap)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;reasoning:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a.x overlaps b.x&#xA;a.y overlaps b.y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Example input 2:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;10-25, 50-60&#xA;20-30, 25-30&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;true (they do not overlap)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;reasoning:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a.x overlaps b.x&#xA;a.y does not overlap b.y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Scoring:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[not sure...]&#xA;brute force gives a worst case n^2 runtime&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="7295" LastEditorUserId="7295" LastEditDate="2013-07-05T21:00:21.197" LastActivityDate="2013-07-05T21:00:21.197" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="646" PostTypeId="1" CreationDate="2013-07-10T17:25:20.057" Score="-3" ViewCount="136" Body="&lt;p&gt;The three newest questions are all in negative territory.  I am new here and it does not seem very friendly.  In a high traffic site I can see the luxury of being negative occasionally but please be more encouraging.&lt;/p&gt;&#xA;" OwnerUserId="8501" LastActivityDate="2013-07-11T08:36:22.380" Title="Why are people being so hateful with the down votes?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="647" PostTypeId="2" ParentId="621" CreationDate="2013-07-10T17:28:00.317" Score="4" Body="&lt;p&gt;You can learn a lot about a languages features by the very act of golfing.  I feel that knowledge for knowledges' sake is actually beautiful just as Mathematics is.  I don't think code that has no practical applications should be off limits.  The sheer challenge alone is an art form to be admired.&lt;/p&gt;&#xA;" OwnerUserId="8501" LastActivityDate="2013-07-10T17:28:00.317" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="648" PostTypeId="2" ParentId="646" CreationDate="2013-07-11T08:36:22.380" Score="9" Body="&lt;p&gt;I'm not sure what you mean by &quot;hateful&quot;, so I'm going to assume that you mean&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Why are people downvoting questions?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The short answer is because they think they're &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;bad questions&lt;/a&gt;. In fact, I've just voted to close one of them, and another one is already closed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Writing a good question &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/122/194&quot;&gt;takes effort&lt;/a&gt;, and should be encouraged with upvotes. But precisely because of that, a good question can easily be swamped in bad questions, and this will never be a high-traffic site if all of the questions are poorly specified or off-topic. &lt;strong&gt;We don't want to encourage bad questions&lt;/strong&gt;. In fact, discouraging them is a &lt;em&gt;good&lt;/em&gt; thing. The site is better off having a few good questions than a lot of crap.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2013-07-11T08:36:22.380" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="652" PostTypeId="1" AcceptedAnswerId="653" CreationDate="2013-08-08T09:24:20.970" Score="-1" ViewCount="74" Body="&lt;p&gt;Hello guys (and girls).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I wanted to ask a question which looks like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;Write the shortest program which prints 'Hello World', which compiling time exceeds one second.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Problem is that compilation time depends on the machine, so my question is how to make it fair for everyone? I feel like this question is still interesting (compiler understanding), but I don't know if this is the true goal of PP&amp;amp;CG, so please tell me if it is as cool as I think it is, and if so how can we make it fair for everyone?&lt;/p&gt;&#xA;" OwnerUserId="8806" LastActivityDate="2013-08-08T10:44:32.287" Title="Compilation battle" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="653" PostTypeId="2" ParentId="652" CreationDate="2013-08-08T10:44:32.287" Score="7" Body="&lt;p&gt;It seems a bit pointless to me. Printing &lt;code&gt;Hello, world!&lt;/code&gt; is trivial, so the answers you get will consist of a function which does the actual behaviour and a not-really-used function with pathological compilation issues. E.g. I would approach this using an &lt;a href=&quot;https://cs.stackexchange.com/questions/6617/concise-example-of-exponential-cost-of-ml-type-inference&quot;&gt;exponential type&lt;/a&gt; but probably not actually calling the exponentially typed function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Alternatively, I could write a Java entry which uses compile-time annotation processing and simply make the annotation processor busy-wait for a second.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There may be some interesting answers, but most of them will probably be as boring as those two suggestions.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:48:30.810" LastActivityDate="2013-08-08T10:44:32.287" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="655" PostTypeId="2" ParentId="630" CreationDate="2013-08-16T07:00:11.113" Score="3" Body="&lt;p&gt;I don't think it is necessary to have language specific winners.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, I know python better than most languages, and know that in most challenges it isn't really a contender. How ever, I can appreciate the terseness of some responses. However, when I see a ridiculously short python answer I almost always up-vote it as I know how hard it must have been.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd like to think the community will always acknowledge good golfing, regardless of language.&lt;/p&gt;&#xA;" OwnerDisplayName="user8777" LastActivityDate="2013-08-16T07:00:11.113" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="657" PostTypeId="2" ParentId="2140" CreationDate="2013-08-29T14:05:01.567" Score="4" Body="&lt;h2&gt;(-: Emotional Programming ;-)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write the most emotional program you can, i.e. which consists of emoticons as much as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program should receive a word and print an appropriate emoticon.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Scoring - I'm really not sure about this, and the question will be worthless without a good scoring algorithm. I want to:&lt;br&gt;&#xA; 1. Avoid giving an advantage to very short programs (e.g. &lt;code&gt;(-:&lt;/code&gt;, is 100% emotional).&lt;br&gt;&#xA; 2. Avoid a meaningless help of emoticons - &lt;code&gt;print '(-:' #(-:(-:(-:&lt;/code&gt; and such.&lt;br&gt;&#xA; 3. Prefer a variety of different emoticons.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Suggestion:&lt;br&gt;&#xA;1. Count characters of code.&lt;br&gt;&#xA;2. For each emoticon in the code, reduce a character.&#xA;2. For N different emoticons used, reduce further 2*N^2 characters.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;What's an emoticon? Anything that somewhat resembles a face, or a closed list?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And should I ban &lt;a href=&quot;http://esolangs.org/wiki/Emoticon&quot; rel=&quot;nofollow noreferrer&quot;&gt;Emoticon&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="3544" LastEditorUserId="53745" LastEditDate="2016-11-02T15:21:59.620" LastActivityDate="2016-11-02T15:21:59.620" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="658" PostTypeId="1" CreationDate="2013-08-30T19:05:46.757" Score="1" ViewCount="110" Body="&lt;p&gt;I've written a function that facilitates &lt;a href=&quot;https://groups.google.com/d/topic/comp.lang.postscript/jDG3PHIqoCk/discussion&quot; rel=&quot;nofollow noreferrer&quot;&gt;abbreviated system names in postscript code&lt;/a&gt;. And I'd like to &quot;host&quot; the code in an answer to the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/8835/tips-for-golfing-in-postscript&quot;&gt;Postscript tips&lt;/a&gt; question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there a way to auto-insert the revision number into the post (ideally into the code block itself)?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the event that improvements/changes are made, I want all copies of the function to identify themselves as to where they came from.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-04-29T00:19:07.510" Title="Is there a way to auto-insert the revision number into the text of a post?" Tags="|discussion|support|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="660" PostTypeId="2" ParentId="658" CreationDate="2013-08-31T20:46:51.850" Score="1" Body="&lt;p&gt;This is a sort-of sandbox answer, to better illustrate what I'm talking about.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is revision 3 of the code.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;URL: http://meta.codegolf.stackexchange.com/revisions/660/3&#xA;Here is my code.&#xA;For all to enjoy.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="2381" LastEditDate="2013-08-31T21:02:09.937" LastActivityDate="2013-08-31T21:02:09.937" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="661" PostTypeId="1" CreationDate="2013-09-05T11:50:44.487" Score="0" ViewCount="97" Body="&lt;p&gt;As seen in the image &lt;a href=&quot;https://codegolf.stackexchange.com/questions/12461/basic-calculator-with-gui?noredirect=1#comment24368_12461&quot;&gt;here&lt;/a&gt; or anywhere else in codegolf:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Bzavd.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The extra part is apparently :  &lt;code&gt;&quot;–&amp;amp;nbsp;&quot;&lt;/code&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe it's a bug?&lt;/p&gt;&#xA;" OwnerUserId="7539" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2013-09-11T13:43:44.403" Title="All over codegolf, comments have an additional –" Tags="|bug|status-norepro|meta|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="662" PostTypeId="2" ParentId="661" CreationDate="2013-09-05T11:53:42.080" Score="2" Body="&lt;p&gt;The character &lt;code&gt;–&lt;/code&gt; is U+2013, &quot;en dash&quot;. It seems to be a display problem for your browser, not of the site in general.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another way to write it is &lt;code&gt;&amp;amp;ndash;&lt;/code&gt;, and it should appear in your browser as &lt;code&gt;&amp;ndash;&lt;/code&gt; (or &amp;ndash; in roman text). Does that appear correctly for you?&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2013-09-05T11:53:42.080" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="663" PostTypeId="2" ParentId="630" CreationDate="2013-09-07T10:35:48.517" Score="-3" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;languages like GolfScript, K, and some other extremely-high level&#xA;  languages can trivialize Code Golf by taking problems&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;While it is true that those languages are in fact made for expressing simple tasks with very short code everybody seems to miss a certain point:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is by far &lt;strong&gt;NOT easy&lt;/strong&gt; to golf in those languages&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;It may be easy to write a shorter program than Java in those languages but still, finding the shortest solution requires the same amount of skill (or even more) as golfing in any other language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you take 'The Burlesque Programming Language' as an example: It has many built-ins. The idea is, that stuff you have to do often should be accessible very easy. Therefore it has a built-in function to do X etc. Obviously when it comes to EXACTLY DO X you CAN'T beat it with another language. However, when it&#xA;comes to array manipulation you don't stand a chance with Burlesque. But that's not really the point. The point is, that it's still difficult to golf in Burlesque.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When golfing in Burlesque you do exactly the same process as golfing in any other language: You start with an idea, write it, shorten the code. Start with another idea, write it shorten the code. Try to abuse test cases. Abuse bugs, abuse undocumented stuff. Abuse weird behaviour. I'll attach a documentation&#xA;about a solution of mine for a problem to calculate binomial coefficients with the input format &quot; , &quot;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;wd{-]}[M^pnr [12B]&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&quot;,&quot;&quot;&quot;r~penr  [11B]&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;psShra^pnr   [10B] &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;psRT[-p^nr   [10B] &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;ps^p/vnr     [8B]&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Removing the ',' is the tricky part. &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;wd{-]}[M^pnr&lt;/strong&gt; &#xA;  does this by splitting into words and then calling Head&#xA;  inside MapParse.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;&quot;,&quot;&quot;&quot;r~penr&lt;/strong&gt;&#xA;  obviously uses a regex to remove the ',' from the input&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;psShra^pnr&lt;/strong&gt;&#xA;  uses Parse and then converts to Pretty and back to a string&#xA;  obtaining a format parsable by read array which has a weird behaviour&#xA;  that skips over the ','&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;psRT[-p^nr&lt;/strong&gt; &#xA;  uses Parse and then rotates and tails the block to remove&#xA;  the ','&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;ps^p/vnr&lt;/strong&gt;&#xA;  uses Parse and pushes all elements to the stack and uses SwapPop to remove &#xA;  the ','&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;As you hopefully will see, it really still takes skill, time and endurance to find the shortest solution. And that's what golfing is about as far as my opinion goes. Saying: &quot;Oh no. It's too easy to golf in golfscript&quot; is just wrong.&lt;/p&gt;&#xA;" OwnerUserId="5429" LastActivityDate="2013-09-07T10:35:48.517" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="664" PostTypeId="2" ParentId="621" CreationDate="2013-09-07T11:19:58.827" Score="1" Body="&lt;p&gt;That depends. Code golf questions usually tend to not require a huge amount of mathematical (or chemical, biological etc.) knowledge and therefore code golf is usually not about solving real world problems. Code golf is trickery. That's all it is, and that's the way it's supposed to be. It's like solving sudoku puzzle. It's hard, it's fun, it helps a little for real world stuff, but it's more hacking than solving. &lt;/p&gt;&#xA;" OwnerUserId="5429" LastActivityDate="2013-09-07T11:19:58.827" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="667" PostTypeId="1" AcceptedAnswerId="669" CreationDate="2013-09-20T07:21:45.997" Score="6" ViewCount="218" Body="&lt;p&gt;Many answers get invalidated by an edited question.&lt;br&gt;&#xA;One of the reasons might be that I look for loopholes and exploit them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/12584/shortest-program-whose-programoutput-is-a-permutation-of-the-95-printable-ascii/12589#comment24678_12589&quot;&gt;Shortest program whose concatenated program+output is a permutation of the 95 printable ASCII characters&lt;/a&gt; (&lt;a href=&quot;https://codegolf.stackexchange.com/posts/12584/revisions#spacer-5091f496-f4aa-4429-8fef-5552a26b3c7d&quot;&gt;invalidating edit&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/12538/implement-division-using-only-addition/12541#12541&quot;&gt;Implement division using only addition&lt;/a&gt; (&lt;a href=&quot;https://codegolf.stackexchange.com/posts/12538/revisions#spacer-f17f2f5e-2c12-4739-b876-a8619d72cdb1&quot;&gt;invalidating edit&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/12538/implement-division-using-only-addition/12539#12539&quot;&gt;Implement division using only addition&lt;/a&gt; (deleted - &lt;a href=&quot;https://codegolf.stackexchange.com/posts/12538/revisions#spacer-5d3b1342-a2d5-4462-af7a-3c1db2d9b2ce&quot;&gt;invalidating edit&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/12481/unholy-grail-layout-reverse-holy-grail-layout/12494#12494&quot;&gt;Unholy Grail Layout (Reverse Holy Grail Layout)&lt;/a&gt; (&lt;a href=&quot;https://codegolf.stackexchange.com/posts/12481/revisions&quot;&gt;invalidating edit&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/11791/delete-those-pesky-ds-store-files/11797#11797&quot;&gt;Delete those pesky &amp;quot;.DS_Store&amp;quot; files&lt;/a&gt; (&lt;a href=&quot;https://codegolf.stackexchange.com/posts/11791/revisions#spacer-3771668a-f08d-4f69-a915-2f642ac614ca&quot;&gt;invalidating edit&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/12982/calculate-the-factorial-of-a-number-without-using-recursion-or-loops/12986#12986&quot;&gt;Calculate the factorial of a number without using recursion or loops&lt;/a&gt; (&lt;a href=&quot;https://codegolf.stackexchange.com/posts/12982/revisions#spacer-1682735f-03b2-491d-a6f1-7a62709aaf76&quot;&gt;invalidating edit&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Currently I just leave my answer alone, because they were once valid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I don't think this is the best solution. So what to do then?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Delete your own answer if it was invalidated?&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Vote to delete other answers that were invalidated too?&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Edit your answer so it matches the new requirements?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is often not possible, e.g. for the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/11791/delete-those-pesky-ds-store-files/11797#11797&quot;&gt;Delete those pesky &amp;quot;.DS_Store&amp;quot; files&lt;/a&gt; question it would create a completly different answer.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;Roll the invalidating edit back?&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Close the original question and ask the OP to post a new one?&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Downvote the question?&lt;/li&gt;&#xA;&lt;li&gt;Leave your answer alone?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="7789" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2013-10-24T10:59:16.907" Title="How should we deal with chameleon questions" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="668" PostTypeId="2" ParentId="667" CreationDate="2013-09-20T07:32:04.687" Score="5" Body="&lt;p&gt;I'm not sure we can do anything much with the stackexchange format. Stackoverflow has the same problem. Sometimes you get a downvote, so you go look and see that your 2 year old answer doesn't match the question anymore. If it's a good answer you may wish to add a note that the question has completely changed. Otherwise you might delete the answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It probably occurs more often here because we have lots of questions askers who frankly aren't as smart as most of the frequent users here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you're have fun finding loopholes thats fine. Remember it's only imaginary internet points being awarded anyway.&lt;/p&gt;&#xA;" OwnerUserId="95" LastActivityDate="2013-09-20T07:32:04.687" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="669" PostTypeId="2" ParentId="667" CreationDate="2013-09-20T09:13:02.800" Score="9" Body="&lt;p&gt;You've been around here long enough that you should be able to recognise these questions before you start working on your answer. There is a place for the protest answer, but if you're expecting to spend more than 5 minutes working on an answer and it exploits a standard loophole which an experienced question-asker would have explicitly closed, post a comment to check that it's intentionally open before you write your answer.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2013-09-20T09:13:02.800" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="670" PostTypeId="1" CreationDate="2013-09-25T21:18:03.343" Score="5" ViewCount="195" Body="&lt;p&gt;&lt;em&gt;(this is basically just a simplified version of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/170/3808&quot;&gt;this&lt;/a&gt;)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have created a simple userscript that shows a small tab above every code block that tells you its character count. I posted it on Stack Apps, but I thought I would also post it here so people from codegolf.SE will see it.&lt;br&gt;&#xA;&lt;a href=&quot;https://stackapps.com/q/4342/17430&quot;&gt;https://stackapps.com/q/4342/17430&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/kAu3n.png&quot; alt=&quot;screenshot&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:25:40.767" LastActivityDate="2013-09-25T21:18:03.343" Title="Userscript for showing character count" Tags="|discussion|" AnswerCount="0" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="671" PostTypeId="1" CreationDate="2013-10-05T22:38:32.230" Score="0" ViewCount="41" Body="&lt;p&gt;You may have heard of the C++ Business Card Ray Tracer.  &lt;a href=&quot;http://fabiensanglard.net/rayTracing_back_of_business_card/index.php&quot; rel=&quot;nofollow&quot;&gt;http://fabiensanglard.net/rayTracing_back_of_business_card/index.php&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is a follow up in Go.  (Using gently unfortunate language, because the author improves performance at the cost of program length.)  &lt;a href=&quot;https://kidoman.com/programming/go-getter.html&quot; rel=&quot;nofollow&quot;&gt;https://kidoman.com/programming/go-getter.html&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It seems like this could be a good thing to ask here: Just how small can the program be made?  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I freely admit that I'm not nearly smart enough to word the question suitably, and I don't want a chameleon.  But I'd love to see the results.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, Programming Puzzles &amp;amp; Code Golf - is this suitable for a question here?  And if it is, how should that question be written?&lt;/p&gt;&#xA;" OwnerUserId="2819" LastActivityDate="2013-10-05T22:38:32.230" Title="Can I wrangle this into a suitable question?" Tags="|discussion|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="672" PostTypeId="2" ParentId="2140" CreationDate="2013-10-06T15:28:34.680" Score="2" Body="&lt;p&gt;&lt;strong&gt;Business Card Ray Tracer&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;I have no idea how to create a good code golf question!&lt;/em&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;See this description of a ray tracer with source code that fits on a business card.  The author stopped when the code size was 1337 bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://fabiensanglard.net/rayTracing_back_of_business_card/index.php&quot; rel=&quot;nofollow&quot;&gt;http://fabiensanglard.net/rayTracing_back_of_business_card/index.php&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Achieving identical output, optimise for minimum code size.  Execution time is not relevant.&lt;/p&gt;&#xA;" OwnerUserId="2819" LastActivityDate="2013-10-06T15:28:34.680" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="673" PostTypeId="1" CreationDate="2013-10-07T08:38:26.980" Score="31" ViewCount="3830" Body="&lt;p&gt;&lt;a href=&quot;http://scratch.mit.edu/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Scratch&lt;/a&gt; is a visual programming language, meant for teaching kids how to program.&lt;br&gt;&#xA;It's completely absent from this site, which, I think, is worth fixing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have no specific challenge in mind.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A scratch program is not made of text, but of visual building blocks, that represent actions, control structures and expressions. Therefore, the code-golf metric isn't trivial - we should decide what to count.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Suggested counting:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Each block is 1 point.&lt;/li&gt;&#xA;&lt;li&gt;Each constant is 1 point per character (or per digit).&lt;/li&gt;&#xA;&lt;li&gt;Each operator is 1 point.&lt;/li&gt;&#xA;&lt;li&gt;Each variable used in an expression is 1 point.&lt;/li&gt;&#xA;&lt;li&gt;If initialized lists are used, each value is counted as a constant.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Example program:&lt;br&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/2jTh6.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Calculated cost:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;When flag clicked&lt;/code&gt; - 1&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ask &amp;lt;n=&amp;gt; and wait&lt;/code&gt; - 3 (block + 2-char constant)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;set n to &amp;lt;answer&amp;gt;&lt;/code&gt; - 2 (block + variable &lt;code&gt;answer&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;set i to 0&lt;/code&gt; - 2 (block + constant).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;repeat until &amp;lt;n=1&amp;gt;&lt;/code&gt; - 4 (block, operator &lt;code&gt;=&lt;/code&gt;, variable, constant).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;if &amp;lt;n mod 2 = 0&amp;gt;&lt;/code&gt; - 6 (block, operators &lt;code&gt;=&lt;/code&gt; and &lt;code&gt;mod&lt;/code&gt;, variable, 2 constants).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;set n to n/2&lt;/code&gt; - 4 (block, operator, variable, constant).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;set n to 3*n+1&lt;/code&gt; - 6 (block, operators &lt;code&gt;*&lt;/code&gt; and &lt;code&gt;+&lt;/code&gt;, variable, 2 constants).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;change i by 1&lt;/code&gt; - 2 (block, constant).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;say i&lt;/code&gt; - 2 (block, variable).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Total score: 32 points.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another way, which Peter Talyor suggested, is to find a textual program representation Scratch uses itself.&lt;br&gt;&#xA;I found one thing, in the Scratch web interface, but I don't really like it. You need to save the project, rename the file to ZIP, and extract a JSON file. A part of it is the script, which looks like this:  &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&quot;whenGreenFlag&quot;],&#xA;[&quot;doAsk&quot;, &quot;n=&quot;],&#xA;[&quot;setVar:to:&quot;, &quot;i&quot;, 0],&#xA;[&quot;setVar:to:&quot;, &quot;n&quot;, [&quot;answer&quot;]],&#xA;[&quot;doUntil&quot;,&#xA;[&quot;=&quot;, [&quot;readVariable&quot;, &quot;n&quot;], &quot;1&quot;],&#xA;[[&quot;doIfElse&quot;,&#xA;[&quot;=&quot;, [&quot;%&quot;, [&quot;readVariable&quot;, &quot;n&quot;], 2], &quot;0&quot;],&#xA;[[&quot;setVar:to:&quot;, &quot;n&quot;, [&quot;\/&quot;, [&quot;readVariable&quot;, &quot;n&quot;], 2]]],&#xA;[[&quot;setVar:to:&quot;, &quot;n&quot;, [&quot;+&quot;, [&quot;*&quot;, 3, [&quot;readVariable&quot;, &quot;n&quot;]], 1]]]],&#xA;[&quot;changeVar:by:&quot;, &quot;i&quot;, 1]]],&#xA;[&quot;say:&quot;, [&quot;readVariable&quot;, &quot;i&quot;]]]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;With this, we can simply count the length in characters (better ignore whitespace). However, the resulting length is strange. For example, variable access becomes very expensive. Also, the process of extracting this is annoying.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, we may want a more convenient format to post answers, instead of a screenshot.&lt;/p&gt;&#xA;" OwnerUserId="3544" LastEditorUserId="34718" LastEditDate="2023-05-01T21:30:25.027" LastActivityDate="2023-05-07T15:02:23.670" Title="Counting bytes in Scratch" Tags="|discussion|scoring|" AnswerCount="7" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="674" PostTypeId="1" AcceptedAnswerId="675" CreationDate="2013-10-08T17:07:20.317" Score="0" ViewCount="195" Body="&lt;p&gt;On my Code Golf &lt;a href=&quot;https://codegolf.stackexchange.com/questions/12760/converting-a-string-to-lower-case-without-built-in-to-lower-functions&quot;&gt;&quot;Converting a string to lower-case (without built-in to-lower functions!)&quot;&lt;/a&gt;, there're two answers with the same character count (10 characters), and they're both the answer with the lowest character count. On StackExchange sites, it's not possible to accept two (or more) answers, so how can I decide which answer I should accept?&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2014-05-06T08:14:44.083" Title="What to do if there're two answers with the shortest code?" Tags="|discussion|code-golf|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="675" PostTypeId="2" ParentId="674" CreationDate="2013-10-08T17:09:05.207" Score="5" Body="&lt;p&gt;Speaking as a person who posts occasional code golf challenges (and not as a moderator), I tend to pick the earlier-posted answer in cases of a tie. &lt;a href=&quot;https://stackoverflow.com/questions/62188/stack-overflow-code-golf/597372#comment2449021_597372&quot;&gt;Example.&lt;/a&gt; (In this case, Adam Davis was &lt;a href=&quot;https://meta.stackexchange.com/a/9758/13&quot;&gt;a proponent of Fastest Gun in the West&lt;/a&gt;, so this wasn't something he could dispute. :-P)&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2013-10-08T17:14:58.827" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="676" PostTypeId="1" CreationDate="2013-10-11T13:01:38.957" Score="4" ViewCount="286" Body="&lt;p&gt;There is a &lt;a href=&quot;http://area51.stackexchange.com/proposals/52595/competitive-programming/&quot;&gt;Competitive Programming&lt;/a&gt; proposal at Area51.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As far as I can understand it, the proposal is about getting better at competive programming, a superset of codegolf. So basically &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/27/non-puzzle-but-more-meta-ish-questions-about-code-golf-that-arent-about-using&quot;&gt;this kind of questions&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The benefits are clear:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Higher audience&lt;/li&gt;&#xA;&lt;li&gt;More questions&lt;/li&gt;&#xA;&lt;li&gt;We might get out of the beta&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I belive that this would make this site richer. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/621/how-is-code-golf-compatible-with-practical&quot;&gt;Practicing such things publically can also help to improve the own skill or learn new tricks&lt;/a&gt; (so our current scope would propably be a benefit for them too).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But this would mean that such meta-posts should not be forced to be CW.&lt;/p&gt;&#xA;" OwnerUserId="7789" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2017-02-06T00:35:02.770" Title="Can and should we include the Competitive Programming?" Tags="|discussion|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="678" PostTypeId="2" ParentId="607" CreationDate="2013-10-25T09:47:22.207" Score="14" Body="&lt;p&gt;We are now 1001 days in beta, so I read a lot about a simmilar site, CodeReview and came to the following conclusions:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I belive the problem is not the number of questions, the problem is (overall) reputation.&lt;br&gt;&#xA;We don't have a single user over 10k (but some very close to it). That means on average less than 10 rep/day for a single user.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I suggest that we should move from posting single line code answers to &lt;strong&gt;actually explaining how they work&lt;/strong&gt;, what cool tricks are used etc. &lt;strong&gt;and upvote such answers&lt;/strong&gt;.&lt;br&gt;&#xA;I don't see a point in upvoting just an other perl solution that looks like a random string to me. We should also &lt;strong&gt;edit our old answers&lt;/strong&gt; so that they include an explaination, this will result in a bump of that post, which in turn can attact more upvotes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you treat such tricks as trade secret, then you should probably move to an other site where the solutions are not revealed.&lt;/p&gt;&#xA;" OwnerUserId="7789" LastActivityDate="2013-10-25T09:47:22.207" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="679" PostTypeId="1" CreationDate="2013-11-01T18:54:10.487" Score="2" ViewCount="62" Body="&lt;p&gt;The description for an off-topic close vote / flag has a typo:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/znCky.png&quot; alt=&quot;Typo&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The word &quot;&lt;em&gt;puzzle&lt;/em&gt;&quot; should be plural. It should read:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This question does not appear to be about programming puzzles or code golf within the scope defined in the help center.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="7548" LastEditorUserId="194" LastEditDate="2014-03-17T18:25:31.827" LastActivityDate="2014-03-17T18:25:31.827" Title="Typo in 'off-topic' description" Tags="|feature-request|status-completed|close-reasons|flags|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="681" PostTypeId="1" CreationDate="2013-11-14T21:13:58.127" Score="2" ViewCount="68" Body="&lt;p&gt;If I have a golfing challenge, but I want it done in a specific language, can I specify that? Does this go against the general spirit of golfing to restrict people in the languages which they can use?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I say this because some problems are easy given even basic operators like addition and multiplication, but become a little more fun when you have to improvise with brainfuck or fish or something. Perhaps could I at least limit them to use a stack based language?&lt;/p&gt;&#xA;" OwnerUserId="9516" LastActivityDate="2013-11-14T21:13:58.127" Title="Can we restrict golfing questions to a particular language?" Tags="|discussion|asking-questions|" AnswerCount="0" CommentCount="1" ClosedDate="2013-11-14T21:32:54.070" ContentLicense="CC BY-SA 3.0" />
  <row Id="682" PostTypeId="2" ParentId="231" CreationDate="2013-11-15T01:41:52.267" Score="3" Body="&lt;p&gt;I think restricting questions to a particular language has never worked that well. For a site this size, you're likely to get very few answers at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For language agnostic questions, you'll often see different ideas/approaches bouncing back and forth between different answers/languages so having answers in multiple languages probably improves the best answer in what ever language(s) the asker is most interested in.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/681/95&quot;&gt;This question&lt;/a&gt; raises an interesting point about &lt;em&gt;classes&lt;/em&gt; of language. For example stack based languages. I don't agree that the answers should be limited to stack based languages, but it can be added to the objective criteria. ie. &quot;shortest code in a stack based language&quot;&lt;/p&gt;&#xA;" OwnerUserId="95" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2013-11-15T01:41:52.267" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="683" PostTypeId="1" AcceptedAnswerId="684" CreationDate="2013-11-18T02:50:39.920" Score="6" ViewCount="256" Body="&lt;p&gt;I got to review an edit today that wanted to add a citation to an answer. Said answer was a verbatim copy of a program from another website, without citing it. I went and checked it out and it was true. (I've obviously accepted the edit but it hasn't gone through yet.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this allowed (i.e. copying a program from a site and posting it as your solution)? Is there a policy on this? I've searched on meta but couldn't find anything.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While I'm at it, how &lt;em&gt;should&lt;/em&gt; people go about posting stuff from other websites (if at all)? It could be relevant from time to time. (i.e: &lt;em&gt;this&lt;/em&gt; person on &lt;em&gt;that&lt;/em&gt; site has done this better than anyone can: like &lt;em&gt;so&lt;/em&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I don't really want to call out anyone and I'm new to meta so I've not posted a link, will post the link if you guys want me to.)&lt;/p&gt;&#xA;" OwnerUserId="1426" LastActivityDate="2013-11-25T23:00:14.383" Title="Plagiarism, and posting stuff you didn't create yourself" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="684" PostTypeId="2" ParentId="683" CreationDate="2013-11-18T02:57:29.687" Score="9" Body="&lt;p&gt;If it is not your post:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Certainly apply proper citations and attribution for content under licenses that require them. I'd say also for code for which no license is specified.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Certainly bring copied content under restrictive licenses to the attention of the moderators (we'll pass it on to the the team).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If it &lt;em&gt;is&lt;/em&gt; your post:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Personally I would not use someone else's code for my answer on CodeGolf.SE.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you &lt;em&gt;are&lt;/em&gt; going to use someone else's code, then make sure you have the right to do so, comply with the license and admit that it is not your own up front.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78" LastEditorUserId="78" LastEditDate="2013-11-18T03:08:17.507" LastActivityDate="2013-11-18T03:08:17.507" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="686" PostTypeId="1" CreationDate="2013-11-24T20:25:42.660" Score="9" ViewCount="234" Body="&lt;p&gt;The overall goal of StackExchange is to help improve the Internet by building a community where information can be shared in a format that is useful to the world at large. Sure, this site is generally more of a &quot;fun&quot; SE than it is a &quot;practical&quot; one. But I see no reason why the answers here should be so much less useful to an outside audience than on any other SE site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On most other SE sites, a single line of code - or several lines of uncommented code - isn't considered a &quot;good answer&quot;. While the code itself may solve the problem posed, it does nothing to help explain &lt;em&gt;why&lt;/em&gt; the problem was there in the first place or &lt;em&gt;how&lt;/em&gt; it was solved. Here, on the other hand, most answers are of the format:&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;[Language Name]: [Character Count]&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;SuperLongStringOfUberCompressedHighlyIllegibleAndUnCommentedCodeLoremipsumdolorsitametconsecteturadipisicingelitseddoeiusmodtemporincididuntutlaboreetdoloremagnaaliquaUtenimadminimveniamquisnostrudexercitationullamcolaborisnisiutaliquipexeacommodoconsequatDuisauteiruredolorinreprehenderitinvoluptatevelitessecillumdoloreeufugiatnullapariaturExcepteursintoccaecatcupidatatnonproidentsuntinculpaquiofficiadeseruntmollitanimidestlaborum&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;On any SE site other than this, such answers would probably garner a lot of unfriendly comments, down-votes, and perhaps even flags. And there is good reason for this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This sort of answer helps nobody except the answerer. They'll get up-votes for either having the shortest answer in the thread, or the shortest answer in that particular language. They might even get an occasional up-vote from someone who can actually read and comprehend the mangled code, and sees an interesting trick used. If they're lucky they'll get the answer accepted, even if the person posing the challenge doesn't have a clue what's going on in the code, just because the asker is willing to rely on the rest of the community's votes to validate that the code is good.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, this doesn't help anyone else who might be even slightly unfamiliar with the language or the methods used in the answer. This also highly obfuscates the answer's quality and eligibility to meet the challenge from a large portion of the audience - perhaps even from the person who posed the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In fact, this can do a dis-service to answerers as well. With fewer people understanding what's going on in the code, possibly including the asker, fewer people will feel like they understand it well enough to up-vote or even accept the answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would like to suggest that more people adopt the following policy for their answers, and perhaps we should even include this in the help center.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;All answers should include:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Name of the language(s) used.&lt;/li&gt;&#xA;&lt;li&gt;(Code Golf) Count of characters in the code.&lt;/li&gt;&#xA;&lt;li&gt;Details of how the code measures up against other objective winning criteria defined in the question.&lt;/li&gt;&#xA;&lt;li&gt;(Code Golf) Golfed version of the code.&lt;/li&gt;&#xA;&lt;li&gt;Un-golfed version of the code.&lt;/li&gt;&#xA;&lt;li&gt;More details, either as part of the answer or comments in the un-golfed code:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How key elements of the code work.&lt;/li&gt;&#xA;&lt;li&gt;(Code Golf) How certain challenging parts of the code were shortened.&lt;/li&gt;&#xA;&lt;li&gt;Any other interesting challenges you encountered while writing the code, and how you overcame them.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Screenshots or other demonstrations of the program output.&lt;/li&gt;&#xA;&lt;li&gt;If you edit the answer later on, to shorten or otherwise improve the code, explain what you did and why.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This will serve several beneficial purposes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Better educate this StackExchange community.&lt;/li&gt;&#xA;&lt;li&gt;Better educate outside visitors to the site.&lt;/li&gt;&#xA;&lt;li&gt;Adds more content to answers which will help them show up in search engine results, increasing traffic to the site.&lt;/li&gt;&#xA;&lt;li&gt;Increases the chance that answers will be up-voted and/or accepted by more users.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Without setting and maintaining such standards as this, I'm afraid we're only hurting this site. One of the reason StackExchange sites are successful in general is because answers are held to high standards such as this. If this site ever hopes to get out of beta, I believe it needs to hop on that wagon.&lt;/p&gt;&#xA;" OwnerUserId="9387" LastEditorUserId="9387" LastEditDate="2013-11-26T19:48:11.210" LastActivityDate="2016-11-23T18:46:41.963" Title="Can we make our answers more useful?" Tags="|discussion|answers|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="687" PostTypeId="1" CreationDate="2013-11-25T00:15:37.193" Score="1" ViewCount="54" Body="&lt;p&gt;In the interest of full disclosure, I am a Sage developer.  I'm preparing a patch that affects the Dancing Links interface in Sage.  The scores of some of my solutions past and future will be impacted by this.  For example,&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;ExactCovers(...)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;instead of&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;[[p[i]for i in x]for x in DLXCPP(p)]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;ExactCovers(...,1)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;instead of&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;sum(1 for x in DLXCPP(...))&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;len(list(DLXCPP(...))&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;by a side-effect of the function definition&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;ExactCovers(problem,count_only=False,solution_callback=True)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think, as both a Sage developer and a researcher using this function, that this is the right interface for the Dancing Links algorithm.  I put the old interface in, and it's &lt;a href=&quot;http://trac.sagemath.org/ticket/11814&quot; rel=&quot;nofollow&quot;&gt;time to fix it&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="2180" LastActivityDate="2013-11-25T00:15:37.193" Title="I'm a Sage developer" Tags="|discussion|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="688" PostTypeId="1" CreationDate="2013-11-25T18:22:20.997" Score="0" ViewCount="72" Body="&lt;p&gt;I've had a couple challenges in mind that are somewhat along the lines of:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Do &lt;em&gt;x&lt;/em&gt; in as many ways as possible, with as little code as possible.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;However, I'm having a hard time settling on how to score this. I'd like a way that gives fair weight to the &quot;many ways&quot; factor while still very much encouraging a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; mentality.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've already seen tags or suggestions for &quot;code chess&quot;, &quot;code bowling&quot;, &quot;atomic code golf&quot;, etc - most of which seem to not have gone over well. Is this a similarly bad idea? Or is there already another name for it, and a standard means of scoring?&lt;/p&gt;&#xA;" OwnerUserId="9387" LastActivityDate="2013-11-25T18:57:07.657" Title="How can I score a code golf challenge, with added complexity?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="689" PostTypeId="2" ParentId="688" CreationDate="2013-11-25T18:57:07.657" Score="1" Body="&lt;pre&gt;&lt;code&gt;  number of ways&#xA;-----------------   ?&#xA; character count&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Of course, it will need to be complicated enough that there are no 1-3 character solutions.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2013-11-25T18:57:07.657" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="691" PostTypeId="2" ParentId="185" CreationDate="2013-11-27T14:12:51.300" Score="-1" Body="&lt;p&gt;My view is that Code Golf challenges should have a set of instructions defined by the asker. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;As it stands, someone could code a language with a single command 'a', which is the hardcoded solution to an answer. This seems ridiculous, but it not monstrously far off what some of the languages provide with only a couple of characters. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The answers should all be written in the same pseudo language. Or perhaps we could define a community golfing language as the standard for code golf questions. This would cause the whole thing to be a little more mathematical and well-defined, than &quot;find the language that has a built-in function closest to the solution!&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My two cents :)&lt;/p&gt;&#xA;" OwnerUserId="9516" LastActivityDate="2013-11-27T14:12:51.300" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="693" PostTypeId="1" CreationDate="2013-11-27T17:00:36.380" Score="1" ViewCount="65" Body="&lt;p&gt;The &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/code-golf&quot;&gt;chat room&lt;/a&gt; for this site is kinda dead. I'm guessing it's because everyone who would be chatting on this site is probably already in one or more rooms elsewhere in the SE network.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, where is everybody? Only one room per answer, and one answer per room, please. This way we can get an idea, by votes, of which room generally has the most golfers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd suggest this question get linked in the chat room description, so anyone stumbling across the room can easily find out where all the golfers really are. Or, of course, we could actually start using the chat room.&lt;/p&gt;&#xA;" OwnerUserId="9387" LastActivityDate="2013-11-27T17:01:13.960" Title="Where's everybody hanging out?" Tags="|discussion|chat|" AnswerCount="1" CommentCount="0" ClosedDate="2016-08-30T20:53:51.710" ContentLicense="CC BY-SA 3.0" />
  <row Id="694" PostTypeId="2" ParentId="693" CreationDate="2013-11-27T17:01:13.960" Score="1" Body="&lt;p&gt;I primarily hang out in &lt;a href=&quot;http://chat.stackexchange.com/rooms/151/the-dmz&quot;&gt;The DMZ&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="9387" LastActivityDate="2013-11-27T17:01:13.960" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="697" PostTypeId="1" CreationDate="2013-11-30T09:47:53.993" Score="2" ViewCount="80" Body="&lt;p&gt;Is it too late to dredge-up the necessary interest in WinterBash?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From other meta-sites, I think we've just got one day to show some interest!&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2013-12-01T02:55:53.073" Title="Do we want Hats?" Tags="|discussion|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="698" PostTypeId="2" ParentId="697" CreationDate="2013-11-30T09:49:00.623" Score="9" Body="&lt;h2&gt;Yes! I want hats during WinterBash!&lt;/h2&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2013-11-30T09:49:00.623" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="699" PostTypeId="2" ParentId="697" CreationDate="2013-11-30T09:50:10.943" Score="1" Body="&lt;h2&gt;No! I do not want hats on Programming Puzzles &amp;amp; Code-Golf SE.&lt;/h2&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="2381" LastEditDate="2013-12-01T02:55:53.073" LastActivityDate="2013-12-01T02:55:53.073" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="702" PostTypeId="1" CreationDate="2013-12-05T14:21:20.187" Score="1" ViewCount="81" Body="&lt;p&gt;I imagined a golf Challenge which seemed pretty interesting to me. But to make it doable, I'd like to offer one or several functions to challengers.&lt;br&gt;&#xA;For exemple:   &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Function 1&lt;br&gt;&#xA; Input: &lt;strong&gt;Integer a&lt;/strong&gt;; id of a country&lt;br&gt;&#xA; Output: the total population of the country 'a'&lt;/li&gt;&#xA;&lt;li&gt;Function 2&lt;br&gt;&#xA;  Input: &lt;strong&gt;Integer a, Integer b&lt;/strong&gt;&lt;br&gt;&#xA;  Output: the distance in kilometers between country 'a' and country 'b'&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Is it possible to make it fair for everyone in this case?&lt;/p&gt;&#xA;" OwnerUserId="8806" LastActivityDate="2013-12-08T08:49:14.580" Title="Offering functions" Tags="|discussion|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="703" PostTypeId="2" ParentId="702" CreationDate="2013-12-05T19:55:00.697" Score="2" Body="&lt;p&gt;I think giving the competitors functions that they can assume works is fair, and rather interesting. There are some things that probably need to be done though.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are restrictions on the way a language calls functions. For example, in golfscript &lt;code&gt;(&lt;/code&gt; and &lt;code&gt;)&lt;/code&gt; have a different meaning and it would be ambiguous. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would allow the user to name the functions(as stated by the competitor) and obviously allow them to be accessed as they would in their language. For GolfScript it would be pushing the arguments on the stack, and then calling the block.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even with these rules, it is still unfair to some languages that don't have a notion of functions at all, but for the most part they aren't going to be winning any golf challenges anyway.&lt;/p&gt;&#xA;" OwnerUserId="9516" LastActivityDate="2013-12-05T19:55:00.697" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="704" PostTypeId="2" ParentId="2140" CreationDate="2013-12-07T08:49:34.597" Score="2" Body="&lt;h1&gt;Countdown: Federal Holidays in the United States&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Inspired by this question:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/15660/christmas-countdown&quot;&gt;Christmas Countdown&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program or script that will countdown to the nearest U.S. federal holiday, at any given time, and will switch the display to an appropriate greeting during each holiday.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following holidays must be tracked, and announced:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;Holiday                         Date                    Greeting&#xA;==========================================================================================&#xA;New Year's Day                  Jan. 1                  Happy New Year!&#xA;Martin Luther King, Jr. Day     3rd Mon. in Jan.        Happy Martin Luther King, Jr. Day!&#xA;President's Day                 3rd Mon. in Feb.        Happy President's Day!&#xA;Memorial Day                    Last Mon. in May        Happy Memorial Day!&#xA;Independence Day                Jul. 4                  Happy Independence Day!&#xA;Labor Day                       First Mon. in Sept.     Happy Labor Day!&#xA;Columbus Day                    2nd Mon. in Oct.        Happy Columbus Day!&#xA;Veterans Day                    Nov. 11                 Happy Veterans Day!&#xA;Thanksgiving                    4th Thu. in Nov.        Happy Thanksgiving!&#xA;Christmas                       Dec. 25                 Merry Christmas!&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The strings listed under &quot;Holiday&quot; and &quot;Greeting&quot; are all free. Shortcuts like &quot;Merry X-mas!&quot; or &quot;Happy 4th of July&quot; will count &lt;em&gt;against&lt;/em&gt; you - the full and proper holiday names are free, so there's no good reason not to use them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following strings are also free, only when used as a label for time units or in advertising the next upcoming holiday:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;days&#xA;hours&#xA;minutes&#xA;seconds&#xA;milliseconds&#xA;until&#xA;time&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;On any given non-holiday, the program must show a count-down timer which displays time remaining at least down to the second, and updates the display with an accurate value (according to the system clock) at least once per second. Time remaining until a holiday must be counted as the time until midnight (00:00:00) on that day. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;How the days, hours, minutes, and seconds (and milliseconds, if you choose) are displayed is up to you, so long as all mandatory items are present and it is clear which numbers represent which value. Again, the strings defining units of time are free so there's no really good reason not to use them. (Though you won't be penalized for not using these strings, so long as it is still unambiguous which time units are which.) The program should also make apparent which holiday is being counted down towards.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On any given holiday, the program must cease displaying the countdown timer and instead display the appropriate greeting for that holiday from 00:00:00 until 23:59:59.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After a holiday is over, at 00:00:00 the next day, the holiday greeting must go away and be replaced with the countdown timer for the next holiday.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answers must include:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Name of language&lt;/li&gt;&#xA;&lt;li&gt;Score (length of golfed code, minus free characters)&lt;/li&gt;&#xA;&lt;li&gt;Golfed code&lt;/li&gt;&#xA;&lt;li&gt;Total length of golfed code&lt;/li&gt;&#xA;&lt;li&gt;Total number of free characters used&lt;/li&gt;&#xA;&lt;li&gt;Un-golfed code, with descriptive comments&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The program must be capable of running accurately (according to the system clock) at any time, and must be able to run indefinitely. The only limitations to this should be those imposed by the host computer or the nature of the programming language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/holidays&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;holidays&amp;#39;&quot; rel=&quot;tag&quot;&gt;holidays&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Are there any additions/deletions/modifications that should be made to these rules?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm considering changing some of the greetings, but I'm not quite sure what to.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&quot;Happy Martin Luther King, Jr. Day!&quot; is just a mouthful and feels awkward, but shortening it to &quot;Happy MLK Day&quot; feels weird too - any other suggestions?&lt;/li&gt;&#xA;&lt;li&gt;I'm not quite sure &quot;Memorial Day&quot; should really be preceded by &quot;Happy&quot; - thoughts?&lt;/li&gt;&#xA;&lt;li&gt;Any others?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="9387" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:21.580" LastActivityDate="2013-12-07T08:56:03.420" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="706" PostTypeId="2" ParentId="702" CreationDate="2013-12-08T08:49:14.580" Score="1" Body="&lt;p&gt;In principle, I think that this is a fair way of levelling the playing field with respect to parsing input. Some languages have shorter syntax for calling functions than others, but a perfect handicapping system doesn't exist so I wouldn't worry about it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, you might make it very hard to write a test suite if you need to provide debugged versions of the function in every language which people might use to compete.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I suggest that you post your question idea to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/638/194&quot;&gt;sandbox&lt;/a&gt; and let people comment on the specifics.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2013-12-08T08:49:14.580" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="708" PostTypeId="1" AcceptedAnswerId="709" CreationDate="2013-12-09T15:51:47.687" Score="1" ViewCount="98" Body="&lt;p&gt;I have a flag that is still labeled as &quot;active&quot; over two weeks after I submitted it. (Submitted on 2013-11-22.) I wouldn't think that any single moderator - let alone the whole moderator team - on any site would be ignoring the flag queue for more than a couple days at a time on a regular basis. So, I can only hope that this just means the moderators have looked at it but chosen not to act in one way or another for whatever reason.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, this does leave the impression that the moderator team may actually &lt;em&gt;not&lt;/em&gt; care. On a site that's languished in beta for nearly three years already, this is an easy assumption to make. However, the moderators here have all been &quot;seen&quot; by the site within the past couple days and most of them have some sort of posting activity within the past week. So, I'd really like to not believe that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It may be very possible that the item I have flagged isn't quite so close-worthy as I thought, but at the same time my flag isn't so far off-base as to be judged unhelpful. But, if this is the case, what should be done to give the user an indication that their flags &lt;em&gt;are&lt;/em&gt; being attended to in a timely manner?&lt;/p&gt;&#xA;" OwnerUserId="9387" LastEditorUserId="68942" LastEditDate="2021-06-09T05:48:20.900" LastActivityDate="2021-06-09T05:48:20.900" Title="How do I know if my flags are being looked at, when no judgement is being issued?" Tags="|discussion|bug|status-reproduced|flags|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="709" PostTypeId="2" ParentId="708" CreationDate="2013-12-09T16:12:30.443" Score="1" Body="&lt;p&gt;I found your flag by looking at your user profile (it wasn't showing up in the mod flag list for some reason). I've closed the question now.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2013-12-09T16:12:30.443" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="710" PostTypeId="1" CreationDate="2013-12-10T11:02:19.350" Score="1" ViewCount="37" Body="&lt;p&gt;I don't know whether people with the rep to vote on tag synonyms get notifications on proposal, or whether they have to look manually, so this is a notification that I've proposed two synonyms to bring together all date-related questions under &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt;. See &lt;a href=&quot;https://codegolf.stackexchange.com/tags/date/synonyms&quot;&gt;https://codegolf.stackexchange.com/tags/date/synonyms&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-01-07T06:41:58.657" Title="Proposed tag synonyms" Tags="|discussion|tags|tag-synonyms|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="711" PostTypeId="1" CreationDate="2013-12-10T23:50:50.660" Score="0" ViewCount="46" Body="&lt;p&gt;The favicon is not displaying for me; instead, I have the missing file/dead file icon. Am I doing something wrong? I am using Chrome.&lt;/p&gt;&#xA;" OwnerUserId="10740" LastEditorUserId="9" LastEditDate="2013-12-12T23:57:40.067" LastActivityDate="2013-12-12T23:57:40.067" Title="Favicon not displaying?" Tags="|support|bug|status-norepro|" AnswerCount="0" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="712" PostTypeId="2" ParentId="2140" CreationDate="2013-12-11T01:39:41.500" Score="4" Body="&lt;h1&gt;Count unique characters in text.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a string for input, output the unique non-whitespace characters in that string along with a count of their occurrences. The list should be sorted in ascending order of ASCII code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hello, World!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Character    Count&#xA;!            1&#xA;,            1&#xA;H            1&#xA;W            1&#xA;d            1&#xA;e            1&#xA;l            3&#xA;o            2&#xA;r            1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;The quick brown fox jumps over the lazy dog.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Character    Count&#xA;.            1&#xA;T            1&#xA;a            1&#xA;b            1&#xA;c            1&#xA;d            1&#xA;e            3&#xA;f            1&#xA;g            1&#xA;h            2&#xA;i            1&#xA;j            1&#xA;k            1&#xA;l            1&#xA;m            1&#xA;n            1&#xA;o            4&#xA;p            1&#xA;q            1&#xA;r            1&#xA;s            1&#xA;t            1&#xA;u            1&#xA;v            1&#xA;w            1&#xA;x            1&#xA;y            1&#xA;z            1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The actual formatting (headers, spacing, etc) of the on-screen output is up to you. The only conditions are that it must be sorted in ascending order by ASCII code, and it must be easy to tell what represents a character from the string and what represents a count of a given character. (For example, given a string of &lt;code&gt;99999999&lt;/code&gt;, the output should be explicit so that it is not confused as saying I have 9 8s.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ultimate challenge (taken from &lt;a href=&quot;https://codegolf.stackexchange.com/q/15786/9387&quot;&gt;here&lt;/a&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;JKqdJg+oJgiowgyIJgkS+gyxJdeS+gyxJ4yoJdybJdioJdqIJ4kS+KwFJ4QS+gzYJg+ow4vIJ4yxvd+IJgy=+dv=JdQx+gzbJrzx24zYJgkxJ4qLJKQxJ4yxJKqx+KqdJKqdJg+oJgiowgyIJgkS+gyxJdeo24yxJm+xJdybJdioJdqIJKi=J4wF+dvS+gzYJg+ow4zYJ4yxvdy=J4i=+Kv=JdQo+KqxJrzdJKzYJgkxJ4qLJgkxJ4yxJKvSJ4qbJKqdJg+oJgiowgyIJgkdJgyxJdeo24yxJm+xJdybJd+oJd+S+dz=J4wF+dvS+g+SJg+ow4vIJ4yxJ4voJgy=+dv=+dzdJgqxJrzdJKzYJgkS+dweJKQxJ4yxJKvSJ4qbJKq=24yYJgiowgyIJgkdJgzdJryo24yxJm+d24zxJd+oJdqIJ4kS+KwFJ4QS+gzYJ4y=2gzYJ4yxJ4voJgy=+dv=+dzdJgqxJrzx24zYJgkS+dweJKQxJ4fK+dQSJ4qbJKq=24yYJgiowgyIJgkS+gzdJryS+gyxJ4yoJdybJd+oJd+S+dz=J4wF+dvS+gzYJ4y=2gvIJ4yxJ4voJgy=+dv=JdQo+KqxJrzx24zY+dzS+dweJKQxJ4yxJKqx+KqbJKq=24vbJdyowgyIJgkdJgzdJryS+gyxJm+d24zxJdioJd+S+dz=J4wF+dvS+gzYJg+ow4vIJ4yxJ4voJgy=+Kv=JdQx+gzbJrzx24zYJgkS+dweJgkxJ4yxJKvSJ4qdJKq=24yYJgiowgyIJgkdJgzdJryS+gyxJ4yoJdybJd+oJdqIJKi=J4wF+dvS+gzYJg+ow4vIJ4yxJ4v=J4i=+Kv=+dzdJgqxJrzx24zYJgkS+dweJgkxJ4fKJ4qx+KqdJKqdJg+SJdyowg+oJgkS+gyxJdeS+gyxJ4yoJdybJd+oJdqIJ4kS+KwFJ4QS+g+SJ4y=2gzYJ4yxJ4v=J4i=+Kv=JdQo+KqxJrzx24zY+dzS+dweJKQxJ4yxJKvSJ4qbJKqdJg+oJgiowg+oJgkS+gzdJryo24yxJ4yoJdybJdioJdqIJ4kS+KwFJ4QS+g+SJg+ow4vIJ4yxvd+IJgy=+dv=JdQo+KqxJrzdJKzY+dzxJ4qLJKQxJ4yxJKqx+KqdJKq=24vbJdyowg+oJgkS+gzdJryo24yxJ4yoJdybJdioJd+S+dz=J4wFJ4QS+gzYJg+ow4zYJ4yxvd+IJgy=+Kv=+dzdJgqxJrzdJKzYJgkxJ4qLJgkxJ4yxJKvSJ4qbJKq=24vbJdyowgyIJgkdJgyxJdeo24yxJm+xJdybJd+oJdqIJKi=J4wF+dvS+g+SJ4y=2gvIJ4yxvd+IJgy=+dv=+dzdJKzbJrzdJKzY+dzS+dweJgkxJ4yxJKvSJ4qbJKq=24yYJgiowg+oJgkS+gyxJdeo24yxJ4yoJKzxJd+oJdqIJKi=J4wF+dvS+gzYJg+ow4vIJ4yxJ4v=J4i=+dv=+dzdJgqxJrzx24zYJgkxJ4qLJKQxJ4fKJ4qx+KqdJKqdJg+oJgiowgyIJgkS+gzdJryS+gyxJm+d24zxJd+oJdqIJKi=J4wFJ4QS+gzYJ4y=2gzYJ4yxvdy=J4i=+Kv=+dzdJKzbJrzx24zY+dzxJ4qLJKQxJ4yxJKqx+KqdJKqdJg+SJdyowg+oJgkdJgzdJryo24yxJm+d24zxJd+5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="9387" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2013-12-12T07:02:39.947" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="713" PostTypeId="1" AcceptedAnswerId="751" CreationDate="2013-12-12T07:29:20.973" Score="10" ViewCount="363" Body="&lt;p&gt;The auto CW limit of 60 answers should be removed. The good questions that have been around a while, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69/golf-you-a-quine-for-great-good&quot;&gt;Golf you a quine for great good!&lt;/a&gt; get a lot of different answers; good for code-golf. It doesn't make since to auto CW all the answers and it when 60 answers are reached.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There have been other requests, such as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/238/please-raise-or-remove-cw-limits-on-code-golf-se-site/239#239&quot;&gt;Please raise or remove CW limits on Code Golf SE site&lt;/a&gt; (status-completed, but this answer asks for complete removal), and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/29/auto-cw-limit-number-of-answers/33#33&quot;&gt;Auto CW limit (number of answers)&lt;/a&gt;. I fully agree with these requests, but since they were posted so long ago, I thought I'd renew the request.&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2015-02-20T03:40:58.607" Title="Remove Auto CW Limit" Tags="|feature-request|status-completed|community-wiki|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="714" PostTypeId="1" CreationDate="2013-12-12T21:35:11.050" Score="5" ViewCount="197" Body="&lt;p&gt;I'm as guilty (perhaps even more so) as the next person of this, and perhaps that's why I feel this question needs to be asked.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Often times, I'll come across a question which already has some answers - usually &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; - which are really well-suited to the challenge requirements and winning criteria. For most cases, I would be hopelessly out-classed in the competition as it currently stands because my coding experience is fairly limited to begin with and most definitely does not include any languages designed with golfing in mind.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I'm still interested in the challenge and would like to effectively pit my wits against those of other people who write in my language. So, despite the fact that I cannot hope to win the challenge myself, I'll post my answer anyway.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Generally speaking, this seems counter to the regular StackExchange practice where new answers should really only be posted if they're contributing further towards the goal of the question. If someone's got a 20-character &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; solution (albeit in another language), and mine is upwards of 100 characters with little to no room for reduction, my answer does nothing really except to add to the pile-up of losers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This also, after a period of time, results in some challenges - even though they may have been won very early on with &lt;em&gt;extremely&lt;/em&gt; short answers - garnering enough late-coming losers that it kicks over to Community Wiki and forces everyone who participated up to that point to lose their rep. The CW trigger is arguably a separate issue entirely, which is being addressed in other Meta posts. However, this particular behavior is a noteworthy contributor to that problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What should we be doing in cases like this? Should we only post an answer if it can actually beat the existing solutions? Or is posting a known-losing solution generally intended to be acceptable?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are two cases where I think we can all agree that posting a known-losing solution is definitely &lt;em&gt;not&lt;/em&gt; acceptable:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your solution is not &lt;em&gt;significantly&lt;/em&gt; different from all existing solutions in the same language.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For this case, comment on or propose an edit to the existing solution that is the closest match to yours.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Your solution would not win against the best currently existing solution in the same language.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For this case, just don't post it at all.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Aside from those two, should we still be posting losers? &lt;/p&gt;&#xA;" OwnerUserId="9387" LastActivityDate="2013-12-13T05:42:31.337" Title="Should we establish rules/etiquette for posting non-winning answers?" Tags="|discussion|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="715" PostTypeId="2" ParentId="714" CreationDate="2013-12-12T21:42:27.627" Score="7" Body="&lt;p&gt;It's acceptable to post &quot;non-winning&quot; answers in other languages, because otherwise, nobody would be allowed to post anything after the first GolfScript or J or APL submission, and that would be sad. :'(&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More seriously, some people like to do a per-language leaderboards, so enabling people to post other-language solutions, even if longer than a GolfScript solution, would help with that.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2013-12-12T21:42:27.627" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="716" PostTypeId="2" ParentId="714" CreationDate="2013-12-12T23:09:57.310" Score="4" Body="&lt;p&gt;In addition to Chris' comments on the value of per-language competition, there is value in solutions that take a completely different route to solving a problem even if that solution is not shortest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that for there to be a lot of value in this kind of answer, the post should include a ungolfed version of the code and some explanation of the method. But then, I think, that every post that is not trivial should include those kinds of luxury features.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2013-12-12T23:09:57.310" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="717" PostTypeId="2" ParentId="714" CreationDate="2013-12-13T05:42:31.337" Score="-1" Body="&lt;p&gt;I've felt the same dilemma, and while I don't really have a solution, there is a third option: CodeReview.SE. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;When I stumbled upon the Brainfuck challenge, I excitedly posted my program. But some time later ... looking over it again ... I knew it was the wrong place. I simply had no intention to golf it at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/8391/2381&quot;&gt;original&lt;/a&gt; (deleted)&lt;br&gt;&#xA;&lt;a href=&quot;https://codereview.stackexchange.com/questions/25934/brainfuck-interpreter&quot;&gt;re-post&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="-1" LastEditDate="2017-04-13T12:41:04.080" LastActivityDate="2013-12-13T05:42:31.337" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="718" PostTypeId="2" ParentId="2140" CreationDate="2013-12-13T20:03:12.647" Score="1" Body="&lt;h1&gt;Quine with syntax highlighting&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I don't really have much of an idea how to properly pose a quine challenge, or what the common syntax highlighting rules are (or aren't) for various languages. So, I figured I'd just toss this concept up here for consideration and let the community flesh it out if they think it's a good idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="9387" LastActivityDate="2013-12-13T20:03:12.647" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="719" PostTypeId="2" ParentId="2140" CreationDate="2013-12-13T22:33:30.783" Score="4" Body="&lt;h2&gt;How long until my next birthday is on a weekend&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I would like to know how much time (in days) I have to wait (from now) until my birthday occurs on a weekend...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The required tool could accept arguments or standard input.&lt;/li&gt;&#xA;&lt;li&gt;The only variable passed as input (as argument or stdin) is my birth day in the strict form &lt;code&gt;YYYY/MM/DD&lt;/code&gt; with only digits, separated by &lt;code&gt;/&lt;/code&gt; (of course: &lt;code&gt;YYYY&lt;/code&gt; for birth year, &lt;code&gt;MM&lt;/code&gt; for the month and &lt;code&gt;DD&lt;/code&gt; for the day of month.&lt;/li&gt;&#xA;&lt;li&gt;The output must present the number of days to wait, from now, and the target date with the day of week, in the form &lt;code&gt;Wait DTW days to WWW, YYYY/MM/DD&lt;/code&gt; where &lt;code&gt;DTW&lt;/code&gt; in integer is the number of days to wait, &lt;code&gt;WWW&lt;/code&gt; as day of week abbreviation could be &lt;code&gt;Sat&lt;/code&gt; or &lt;code&gt;Sun&lt;/code&gt; and the target date in same form as input.&lt;/li&gt;&#xA;&lt;li&gt;Once done, there is no more request (tool could finish quietly, loop, bug or crash)&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;About February 29th, there are 3 ways you can handle it: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;strict&lt;/em&gt;: Where birthday may occur once every 4 years&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;right&lt;/em&gt;: Where birthday is March 1st while Feb 29th doesn't exist.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;relax&lt;/em&gt;: Where birthday could be Feb 28th or March 1st, but only while Feb 29th doesn't exist.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The tool must match in the &lt;em&gt;right&lt;/em&gt; manner, but could accept an option as choice between one of the three ways.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;Shortest golfed code wins&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;-3&lt;/strong&gt; explanation (while golfed version must use &lt;em&gt;one letter&lt;/em&gt; variable, ungolfed version is welcome with useful variable names)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;-3&lt;/strong&gt; if properly loop on STDIN&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;-5&lt;/strong&gt; if no requirement of external library&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;-10&lt;/strong&gt; if an option to choose the way of considering February 29th.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;0&lt;/strong&gt; for &lt;code&gt;shebang&lt;/code&gt; (unless they contain more than &lt;em&gt;runtime options&lt;/em&gt;: switch &lt;code&gt;r&lt;/code&gt; in &lt;code&gt;sed&lt;/code&gt; or &lt;code&gt;p&lt;/code&gt; in &lt;code&gt;perl&lt;/code&gt; are &lt;em&gt;runtime options&lt;/em&gt;, they count for null)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;N&lt;/strong&gt; embed code on shebang line in counted normally.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="9424" LastEditorUserId="9498" LastEditDate="2013-12-21T07:33:40.630" LastActivityDate="2013-12-21T07:33:40.630" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="720" PostTypeId="2" ParentId="2140" CreationDate="2013-12-13T23:48:51.383" Score="1" Body="&lt;h1&gt;McDonald's Drive-Thru&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Changes from original:&lt;/strong&gt;  &lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Provided some clarification of requirements with regards to impossible ordering quantities.  &lt;/li&gt;&#xA;  &lt;li&gt;Added specification to include total cost of order.&lt;/li&gt;&#xA;  &lt;li&gt;Added specification to prefer lowest cost in case of a tie for number of packages.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;TODO:&lt;/strong&gt;  &lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Verify package sizes and pricing to be used for this challenge.  &lt;/li&gt;&#xA;  &lt;li&gt;Add pricing to output samples.&lt;/li&gt;&#xA;  &lt;li&gt;Edit or remove &quot;not have any limitations&quot; rule. As currently written, it may force otherwise unnecessary bloating of code in some languages. (e.g.: PowerShell can handle numbers as uint64 to work with extremely large quantities, but it defaults to int32.)&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;We want to write a program to help McDonald's Drive-Thru employees assist their customers in ordering Chicken McNuggets. Chicken McNuggets only come in packs of 4, 6, 9, or 20. However, customers may not always be considering this when they pull up to the speaker. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, a customer might want to order 50 McNuggets but they really don't care what sort of packaging they come in - they just want to make sure they get 50 McNuggets one way or another. We want to help the customers get the best value out of their order - that is, to compose an order large enough to accommodate their needs in as few packages as possible with little to no excess.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Users will provide a request for &lt;em&gt;n&lt;/em&gt; Chicken McNuggets. Your program's task is to provide the user with the sizes and numbers of McNugget packages needed to fulfill the order exactly. If the exact order cannot be fulfilled, the system must output an order which would meet the customer's needs with as little excess as possible. The system must also provide the total cost of the order.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For values of &lt;em&gt;n&lt;/em&gt; which can be ordered exactly, output how many of each pack must be ordered to achieve the requested quantity.&lt;/li&gt;&#xA;&lt;li&gt;For impossible orders (1,2,3,5,7,11), print &quot;[requested quantity] is impossible. Have [nearest valid quantity &gt;&lt;em&gt;n&lt;/em&gt;]:&quot; followed by the normal output for the nearest possible quantity &gt;&lt;em&gt;n&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Impossible orders cannot be hard-coded. The program must be able to determine whether fulfilling an order exactly is possible without being explicitly told that 1,2,3,5,7, and 11 are impossible.&lt;/li&gt;&#xA;&lt;li&gt;Output must exclude any package sizes which do not need to be ordered.&lt;/li&gt;&#xA;&lt;li&gt;Output must be in descending order of package size.&lt;/li&gt;&#xA;&lt;li&gt;Output must include the sum total cost of all the packages. (Tax not included.)&lt;/li&gt;&#xA;&lt;li&gt;Further layout and formatting of the output is up to you, so long as it is unambiguous.&lt;/li&gt;&#xA;&lt;li&gt;Program must not have any limitations beyond those inherent to the system or programming language.&lt;/li&gt;&#xA;&lt;li&gt;If there are multiple ways to assemble the order in the least number of packages, output the method which has the lowest total price.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;8&lt;/code&gt;&lt;br&gt;&#xA;Output:  &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2x4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;43&lt;/code&gt;&lt;br&gt;&#xA;Output:  &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1x20 1x9 1x6 2x4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;11&lt;/code&gt;&lt;br&gt;&#xA;Output:  &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;11 is impossible. Have 12: 2x6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://numberphile.com/videos/43_nuggets.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Relevant Numberphile Link&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;My main concern is that this problem may be too similar to this thread:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/647/work-out-change&quot;&gt;Work out change&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Otherwise, are there any changes that should be made to this?&lt;/p&gt;&#xA;" OwnerUserId="9387" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:21.580" LastActivityDate="2013-12-16T14:55:50.960" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="721" PostTypeId="2" ParentId="2140" CreationDate="2013-12-15T00:28:15.717" Score="6" Body="&lt;h3&gt;PETSCII banner&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/hu3eP.gif&quot; alt=&quot;PETSCII on CodGolf.StackExchange&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In an other world... I was using a &lt;a href=&quot;http://en.wikipedia.org/wiki/Commodore_International&quot; rel=&quot;nofollow noreferrer&quot;&gt;PET 2001&lt;/a&gt; who used some particular &lt;a href=&quot;http://en.wikipedia.org/wiki/PETSCII&quot; rel=&quot;nofollow noreferrer&quot;&gt;PETSCII&lt;/a&gt; charset.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The screen green on black, with 40 columns and 25 lines, was only able to display characters from this charset. No way to draw dots or lines...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But in the chaset, there is some &lt;code&gt;▝&lt;/code&gt; and &lt;code&gt;▚&lt;/code&gt;, which, ( by the use of &lt;em&gt;reverse video&lt;/em&gt; in order to obtain 16 chars: &lt;code&gt;' ','▖','▗','▘','▝','▀','▄','▐','▌','▞','▚','▟','▛','▜','▙','█'&lt;/code&gt; ) make us able to draw &lt;em&gt;graphics&lt;/em&gt; on a &lt;code&gt;80x50&lt;/code&gt; dots plan.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using an internal clock triggering &lt;em&gt;IRQ&lt;/em&gt;, I've done a &lt;em&gt;animated prompter&lt;/em&gt; like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Bzw6Z.gif&quot; alt=&quot;Animated display sample Hello world!&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal of this is to make a similar banner, with same charset, (but using &lt;em&gt;UTF-8&lt;/em&gt; characters: &lt;code&gt;' ','▖','▗','▘','▝','▀','▄','▐','▌','▞','▚','▟','▛','▜','▙','█'&lt;/code&gt;). Warn, this charset use inverted lower/upper cases.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;This imply the use of &lt;em&gt;PETSCII&lt;/em&gt; charset, I will post them there as a &lt;em&gt;json string&lt;/em&gt;, before getting this out of the sandbox if some interest...&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The tool have to change his position 20 time per second.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The tool must accept as argument, the string to display.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The tool must add date and time in the form &lt;code&gt;- WDay MDay Mnth Year, HH:MM:SS -&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Scrolling have to be done &lt;strong&gt;bit per bit&lt;/strong&gt;: I.E.: by half character!&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;Shortest code...&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;-3 if size of console is not limited to 40 columns&lt;/li&gt;&#xA;&lt;li&gt;-5 if cpu usage stay less than 90% (On my poor Core(TM)2 Duo CPU     E8400  @ 3.00GHz, with 4G ram)&lt;/li&gt;&#xA;&lt;li&gt;-5+ if cpu usage stay less than 50%&lt;/li&gt;&#xA;&lt;li&gt;-5+ if cpu usage stay under 5%&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;C.U.&lt;/p&gt;&#xA;" OwnerUserId="9424" LastEditorUserId="9424" LastEditDate="2013-12-16T08:41:29.917" LastActivityDate="2013-12-16T08:41:29.917" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="722" PostTypeId="1" CreationDate="2013-12-15T15:47:17.277" Score="2" ViewCount="102" Body="&lt;p&gt;In connection with &lt;a href=&quot;https://codegolf.stackexchange.com/q/15831/3440&quot;&gt;this question&lt;/a&gt; which is now &quot;on hold&quot;, there is the message &quot;If this question can be reworded to fit the rules in the help center, &lt;em&gt;please edit the question&lt;/em&gt; or leave a comment.&quot;  Although I think the question has already been adequately edited to get it re-opened, I seem to be the only one voting for that.   &lt;strong&gt;Is it appropriate for anyone other than the author to edit the question even more?&lt;/strong&gt; (It risks mis-stating the author's intentions.) I happen to think it's actually a nice code-challenge problem, and would like to see what other solutions people might have.   &lt;/p&gt;&#xA;" OwnerUserId="3440" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2013-12-15T16:01:08.627" Title="When is it appropriate to edit someone else's question?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ClosedDate="2023-01-07T21:14:45.260" ContentLicense="CC BY-SA 3.0" />
  <row Id="723" PostTypeId="2" ParentId="722" CreationDate="2013-12-15T16:01:08.627" Score="2" Body="&lt;p&gt;&lt;em&gt;This whole post is just my opinion as a Stack Exchange user, and I am not speaking as a moderator here, and definitely not &quot;the moderator who closed the linked question at the request of another user&quot;.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe that &lt;a href=&quot;/help/editing&quot;&gt;posts are okay to be edited by anyone&lt;/a&gt;, especially if (on this site) it makes it a more suitable or fair or accessible golfing/coding challenge. Of course, for substantial edits, it's more polite to propose edits as a comment first, and gather community consensus, but once such consensus is reached, I believe it's okay to edit the post directly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the author of a question feels like an edit misrepresented their ideas or positions, they are free to make further edits. So don't worry about that.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2013-12-15T16:01:08.627" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="724" PostTypeId="2" ParentId="686" CreationDate="2013-12-16T08:06:31.273" Score="0" Body="&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt;: Recommend deletion of new answers that enter the Low Quality queue that don't meet the requiremens in this question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is a simple solution to this, and I decided to take this path:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answers that only consist of code will automatically enter the Low Quality queue, where I recommend deletion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I know this might sound harsh, but I don't see a point in more code only answers. I already wrote about this in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/678/7789&quot;&gt;an other answer&lt;/a&gt;, to summarize:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Entries are public, not like most other code golf contest sites.&lt;/li&gt;&#xA;&lt;li&gt;If you want to keep your solution (and how it works) as secret, you are wrong here.&lt;/li&gt;&#xA;&lt;li&gt;If you don't keep it as secret, take some time and explain how it works, what genius trick you used to get a better score...&lt;/li&gt;&#xA;&lt;li&gt;If you just post an answer without any explaination it won't help others without dechiphering your golfed code.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So please do a few of the following things in your answer:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Include a ungolfed version of your program. This makes it easier to understand your solution.&lt;/li&gt;&#xA;&lt;li&gt;Add some explaination how it works. &quot;Uses the same approach as John Does answer&quot; is fine for me if John Does answer explain how it works.&lt;/li&gt;&#xA;&lt;li&gt;Explain the genious things in your answer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;To make it short: I want to learn from others, and this could work fairly well here.&lt;br&gt;&#xA;But if noone takes the time to explain things, our audience will lower (just an other code-golf site).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To work against this, I decided to take a radical action: Recommend deletion of posts that only contains code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We will never get out of beta if we can't find a niche where we could be good at.&lt;br&gt;&#xA;I believe this niche can be explaining how.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note&lt;/em&gt;: I have myself many posts that only consists of code, and I currently try to update them. If you find one, leave a comment and I'll fix it. And please stop upvoting posts that don't meet the requirements.&lt;/p&gt;&#xA;" OwnerUserId="7789" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2013-12-16T08:11:33.437" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="725" PostTypeId="1" CreationDate="2013-12-16T16:13:46.530" Score="3" ViewCount="134" Body="&lt;p&gt;Challenges like &lt;a href=&quot;https://codegolf.stackexchange.com/q/15952/9387&quot;&gt;this&lt;/a&gt; are a little difficult to judge because they're effectively asking us to write a program that solves an unsolved mathematical problem. Until such a time as there is verified proof of a solution to the underlying mathematical problems, we cannot know for certain what the upper limits of these programs need to be or what their output should be once that limit is reached.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Most currently unsolved mathematical problems cannot be simply solved by brute force - if they could, people with larger brains, more money, and bigger computers would probably have cracked them by now. So, essentially these are impossible questions. Sure, we can validate that the program is written in a way that it &lt;em&gt;should&lt;/em&gt; produce the expected output. But until we know for certain what the answer to the underlying mathematical problem is, we have no way of authoritatively testing this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should questions like these be allowed? What should be some guidelines for posting and judging them?&lt;/p&gt;&#xA;" OwnerUserId="9387" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-01-19T22:25:49.327" Title="Posting unsolved mathematical problems" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="726" PostTypeId="2" ParentId="2140" CreationDate="2013-12-16T20:19:01.513" Score="1" Body="&lt;h1&gt;.... . .-.. .-.. ---   .-- --- .-. .-.. -..&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Another Hello World challenge, this time with Morse code!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Taking no input, your program must output &lt;code&gt;HELLO WORLD&lt;/code&gt; in audible Morse code, printing each letter as it is played. For the purpose of this challenge, the following Morse code guidelines will be followed:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Duration of sounds:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Dits are one time-unit long.&lt;/li&gt;&#xA;&lt;li&gt;Dahs are three time-units long.&lt;/li&gt;&#xA;&lt;li&gt;The gap between elements within the same character is equal to one dit.&lt;/li&gt;&#xA;&lt;li&gt;The gap between characters within the same word is equal to one dah.&lt;/li&gt;&#xA;&lt;li&gt;The gap between words is seven time units long.&lt;/li&gt;&#xA;&lt;li&gt;The length of &quot;one time unit&quot; is up to the programmer, so long as it is consistent throughout the message.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Letters:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;H: &lt;code&gt;....&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;E: &lt;code&gt;.&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;L: &lt;code&gt;.-..&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;O: &lt;code&gt;---&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;W: &lt;code&gt;.--&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;R: &lt;code&gt;.-.&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;D: &lt;code&gt;-..&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I'm a little iffy on that last bullet regarding duration. Should I set a hard standard, or a minimum? If so, what to?&lt;/p&gt;&#xA;" OwnerUserId="9387" LastActivityDate="2013-12-16T20:19:01.513" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="728" PostTypeId="2" ParentId="2140" CreationDate="2013-12-17T15:39:09.780" Score="1" Body="&lt;h1&gt;Find Maximum number of 4+ letter words from Scabble Tiles&lt;/h1&gt;&#xA;&lt;p&gt;The challenge is to find the most words with 4 or more letters you can make with one set of scrabble tiles.&lt;/p&gt;&#xA;&lt;p&gt;The tile distribution is as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2 Blank Tiles&#xA;A 9  N 6    +====+===========+&#xA;B 2  O 8    | 01 | K J X Q Z |&#xA;C 2  P 2    | 02 | B C M P F |&#xA;D 4  Q 1    | 02 | H V W Y * |&#xA;E 12 R 6    | 03 | G         |&#xA;F 2  S 4    | 04 | L S U D   |&#xA;G 3  T 6    | 06 | N R T     |&#xA;H 2  U 4    | 08 | O         |&#xA;I 9  V 2    | 09 | A I       |&#xA;J 1  W 2    | 12 | E         |&#xA;K 1  X 1    +====+===========+&#xA;L 4  Y 2&#xA;M 2  Z 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Valid words are any words that are 4+ that are available in &lt;a href=&quot;http://pywordgame.googlecode.com/svn-history/r2/trunk/wordgame/wordgame/model/ospd4.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;this file&lt;/a&gt;, the official scrabble dictionary.&lt;/p&gt;&#xA;&lt;p&gt;Tiles cannot be used twice. This means you can only have 1 word with a K, J, X, Q, and/or Z unless you use a blank tile to represent one of these letters.&lt;/p&gt;&#xA;&lt;p&gt;I'm not sure how I'd do scoring on this. I want shorter code to score better, but I don't want a short piece of code that finds a lot less words to score better than a longer piece that finds many more words.&lt;/p&gt;&#xA;" OwnerUserId="2873" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2013-12-17T20:23:59.893" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="729" PostTypeId="2" ParentId="725" CreationDate="2013-12-19T17:12:30.010" Score="-1" Body="&lt;p&gt;I think that these solutions should not be allowed, the same as questions requesting the most concise C++ IDE would not be allowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If these questions are allowed, the accepted answer should be code that produces the result that is closest to the estimated correct answer within an acceptable range.  Shortest code of the qualifying answers wins.&lt;/p&gt;&#xA;" OwnerDisplayName="user10766" LastActivityDate="2013-12-19T17:12:30.010" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="730" PostTypeId="1" AcceptedAnswerId="731" CreationDate="2013-12-19T18:28:05.277" Score="1" ViewCount="52" Body="&lt;p&gt;The markdown parser mangles code inside &amp;lt;pre&gt; tags and white space. this becomes quite apparent when posting code that is sensitive to white space, such as self printing code. I made a little one line tool to help, but it is still anoying. &lt;code&gt;sed 's/^/   /' quinine |xclip&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="10731" LastEditorUserId="3" LastEditDate="2013-12-19T20:29:23.043" LastActivityDate="2013-12-19T20:29:23.043" Title="Improved quoting of code" Tags="|discussion|feature-request|status-norepro|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="731" PostTypeId="2" ParentId="730" CreationDate="2013-12-19T19:41:10.577" Score="1" Body="&lt;p&gt;Try indenting each line by 4 spaces instead of writing &lt;code&gt;&amp;lt;pre&amp;gt;&lt;/code&gt; tags manually. You can do this easily by selecting the block of code and clicking the &lt;code&gt;{}&lt;/code&gt; button in the editor toolbar, or pressing &lt;kbd&gt;Ctrl&lt;/kbd&gt;&lt;kbd&gt;K&lt;/kbd&gt;.&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="3" LastEditDate="2013-12-19T20:23:13.280" LastActivityDate="2013-12-19T20:23:13.280" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="732" PostTypeId="1" CreationDate="2013-12-20T00:40:19.520" Score="1" ViewCount="206" Body="&lt;p&gt;So I'v been hanging around a little while now And I have noticed that there are very few non golf questions. I can only remember three. I asked one (Irrational Number). One has been closed. Now admittedly It had scoring issues but golf has scoring isues look at &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/403/new-code-golf-metric-atomic-code-golf&quot;&gt;New Code-Golf metric: Atomic-Code-Golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/286/j-and-golfscript-suck-all-the-enjoyment-out-of-code-golf&quot;&gt;J and GolfScript suck all the enjoyment out of Code Golf&lt;/a&gt; . So I decided to do something about it, I read low scoring questions to see what they did wrong, I read high scoring problems to see what they did right, I golfed a couple questions to get a feel for how that worked, I read meta to see what other problems people were having I tried a code golf question (It appears to have hit the rep cap today), and after careful thought I proposed a less golfish question. It had definite rules, clear scoring, and added guidelines to ensure clarity, while leaving room for creativity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I got a great effort, a sarcastic rules lawyer, a pessimistic moderator, and a bunch of close votes. Now I realize that Iszi was trying to be helpful, but his comments were all negative, &quot;that won't work,&quot; instead of helpful, like &quot;have you considered . . .&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does this community want anything other than code golf?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we think code golf is the only future of this site we should change the title as soon as possible to prevent confusion in our effort to move out of beta.&lt;/p&gt;&#xA;" OwnerUserId="10731" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2013-12-20T16:10:30.283" Title="Anything But Golf" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="733" PostTypeId="2" ParentId="2140" CreationDate="2013-12-20T14:16:26.507" Score="1" Body="&lt;h2&gt;Code Golf: counting all colors in an image&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The goal of this Code Golf is to create a program that counts all colors in an image.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The input will be a path to the image file.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The output should be a number that indicates how much different colors your program found in the image.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;It's also important that your program supports much image formats, so I'll calculate the score based on this formula:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(character_count * 3) / (number_of_supported_image_formats * 2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Some other rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The lowest score wins&lt;/li&gt;&#xA;&lt;li&gt;You're not allowed to execute an external program&lt;/li&gt;&#xA;&lt;li&gt;No Internet access&lt;/li&gt;&#xA;&lt;li&gt;A color doesn't just count if it's present in the palette, there really should be pixels of that color in the image.&lt;/li&gt;&#xA;&lt;li&gt;You should also count pixels with 0% opacity.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;#FFFFFF&lt;/code&gt; with 100% opacity is &lt;strong&gt;not&lt;/strong&gt; the same color as &lt;code&gt;#FFFFFF&lt;/code&gt; with 50% (of course, this is the same for all other colors).&lt;/li&gt;&#xA;&lt;li&gt;In vector image formats, if there's a red square (for example) with 50% opacity that overlaps a blue square, then this should count as two colors: red and blue.&lt;/li&gt;&#xA;&lt;li&gt;In vector image formats, in case of a gradient, the number of colors depend on which colors are used in the gradient. For example, if there is a red/yellow gradient, then you should count this as two colors: red and yellow.&lt;/li&gt;&#xA;&lt;li&gt;A paletted image format is &lt;em&gt;another&lt;/em&gt; image format than the non-paletted variant.&lt;/li&gt;&#xA;&lt;li&gt;SVG 1.0 is &lt;em&gt;another&lt;/em&gt; image format than SVG 1.1 (also count for other image formats).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="9275" LastEditDate="2013-12-20T19:16:00.887" LastActivityDate="2013-12-20T19:16:00.887" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="734" PostTypeId="2" ParentId="732" CreationDate="2013-12-20T16:10:30.283" Score="6" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;It had definite rules, clear scoring, and added guidelines to ensure clarity, while leaving room for creativity.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I think the comments on the question itself make clear that this is a rose-tinted view. If nothing else, the fact that the only person to answer had no idea what they scored should send you an unmistakable message that the scoring is &lt;em&gt;not&lt;/em&gt; clear.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I got ... a sarcastic rules lawyer ...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't see any sarcasm. Rules lawyering is par for the course on this site: that's part of the reason for writing a solid spec, and partly why we have a sandbox.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;... a pessimistic moderator ...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I think that you and whoever that is are the only people who know what you're talking about here.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;... and a bunch of close votes.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Close votes aren't a kiss of death. Fix the problems with the question (if possible) and you can try to get some reopen votes. Although I must say that in my opinion there's one unfixable problem: even if you specify the scoring properly and tighten the restrictions on what constitutes a suitable speech, and even if you rule out things like &lt;a href=&quot;http://en.wikipedia.org/wiki/Whitespace_(programming_language)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Whitespace&lt;/a&gt; answers which break your scoring system, your current definition of &quot;obfuscation&quot; is so permissive that it's not an interesting challenge.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Does this community want anything other than code golf?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't speak for the community, and judging by the number of upvotes some questions which I think are dreadful get my opinions on what makes a good question are not shared by everyone. But what I want from questions are&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Clear statement of task. I do requirements gathering at work, and I understand that non-programmers think in terms of their primary use cases and not in terms of corner cases, but if you're participating in a programming-for-fun site than that doesn't apply to you. I expect people who submit a question to this site to be able to look at a spec they've just written and spot ambiguities. It's fine for a question to have some flexibility, but that flexibility should be explained (e.g. &lt;em&gt;&quot;You can take input from stdin, via command line arguments, or via a GUI&quot;&lt;/em&gt;; &lt;em&gt;&quot;Write a program or a function that ...&quot;&lt;/em&gt;; etc. rather than &lt;em&gt;&quot;Write some code which takes input and ...&quot;&lt;/em&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Clear statement of winning criteria. Ideally I should be able to write a computer program which implements the criteria exactly. (Note that I am anti-&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Winning criteria which actually distinguish entries. E.g. a challenge which is judged on big-O complexity and which has a standard solution that is provably optimal is going to result in an n-way tie, which is pretty pointless.&lt;/li&gt;&#xA;&lt;li&gt;An interesting problem. This doesn't mean that it has to take me a couple of hours of background reading to understand how to tackle it, but if there is a correct solution in less than 10 characters (and you'd be surprised how often people submit questions which have 0- or 1-character solutions) then where's the fun? (On a related note: near-duplicates are unlikely to meet this criterion. If I were you, I would have held off on posting &lt;a href=&quot;https://codegolf.stackexchange.com/q/16043/194&quot;&gt;Mirror quine&lt;/a&gt; for a couple of months because two quine questions in one day is a bit light on variety).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I'm not against non-code-golf problems. However, I can't think of very many good ones that have been asked. Asking a good question is hard work; asking a good question with a good non-code-golf winning criterion is even harder.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2013-12-20T16:10:30.283" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="736" PostTypeId="2" ParentId="2140" CreationDate="2013-12-21T04:58:30.927" Score="1" Body="&lt;p&gt;Since &lt;a href=&quot;https://codegolf.stackexchange.com/questions/15954/output-the-correct-move-as-per-the-xkcd-tic-tac-toe-cheetsheet&quot;&gt;this question&lt;/a&gt; is closed, I figured I'd post it here so further issues can be hammered out in Meta instead of the main site.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Known Issues:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Some rules seem a bit unclear to some users.&lt;/li&gt;&#xA;&lt;li&gt;Clarification may be needed on what is needed to qualify for the &amp;quot;win percentage&amp;quot; bonus.&lt;/li&gt;&#xA;&lt;li&gt;Win percentage bonus may not be enough to be a real incentive. (This may just depend on the language or implementation.)&lt;/li&gt;&#xA;&lt;li&gt;Perhaps the win percentage bonus should be eliminated entirely, or maybe it should just be made a mandatory part of the spec.&lt;/li&gt;&#xA;&lt;li&gt;It's been suggested to use a simple 1-9 numbering system for the board positions, instead of any sort of X,Y coordinates.&lt;/li&gt;&#xA;&lt;li&gt;May want to allow some flexibility on the input format. (i.e.: Input must still specify the sequence of moves thus far, using whatever addressing scheme is specified in the spec, but leave the delimiters - or lack thereof - up to the developer.)&lt;/li&gt;&#xA;&lt;li&gt;Exactly what is expected of the program, such as how it can figure out whose turn it is or what the output should be, seems to need some clarification.&lt;/li&gt;&#xA;&lt;li&gt;Some test cases should probably be added.&lt;/li&gt;&#xA;&lt;li&gt;Clarification may be needed on the matter of what parts of the game we can assume have followed the guide already.&lt;/li&gt;&#xA;&lt;li&gt;Some flaws exist in the chart. (Two already mentioned in comments on the original post.) These should be identified and addressed so that proper expectations for those conditions are clearly set.&lt;/li&gt;&#xA;&lt;li&gt;Original post said we would not have to account for null input (i.e.: X asking what their first move should be) but this might be a good enhancement to add.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I personally think this is a great challenge. So far, I've had a very hard time finding a lot of room for optimization and got up to probably 400 characters in PowerShell before I gave up (not even half-way through the chart yet) due to some of the above issues. I'd really like to see what some more serious golfers could do with this, once the spec is properly hammered out.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Overview&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://xkcd.com/832_large/&quot; rel=&quot;nofollow noreferrer&quot;&gt;This&lt;/a&gt; is the XKCD tic-tac-toe cheetsheet:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/icnb4.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;It's rather big, I know. But it's also your most valuable resource in your challenge.&lt;/p&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;Create a program (in your language of choice) that uses the Optimal Move Cheatsheet (henceforth OMC) to output the optimal move when given a sequence of moves.&lt;/p&gt;&#xA;&lt;h2&gt;The input&lt;/h2&gt;&#xA;&lt;p&gt;Your program will be fed a series of moves in the following fashion:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A3 A2 B2 C2 ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Where the first combination is always X, the second O, and so on. The letter is the Y coordinate (&lt;code&gt;A-C&lt;/code&gt;, A at the top) and the number is the X coordinate (&lt;code&gt;1-3&lt;/code&gt;, 1 at the left).&lt;/p&gt;&#xA;&lt;p&gt;You may assume that the given combination is following the OMC's suggestion for each move at least for the player asking for a recommendation. You can also assume that the input will never be null (at least one move has been made). You must:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Figure out whether the next move is for X or O (you don't need to output this)&lt;/li&gt;&#xA;&lt;li&gt;Use the OMC to decide the next move&lt;/li&gt;&#xA;&lt;li&gt;Print the next move in the standard format &lt;code&gt;A3&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Optional:&lt;/h2&gt;&#xA;&lt;p&gt;You may also include the player's chance of winning (as a percentage) for 50 character discount on your score.&lt;/p&gt;&#xA;" OwnerUserId="9387" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2013-12-23T01:26:41.733" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="739" PostTypeId="2" ParentId="2140" CreationDate="2013-12-21T22:58:46.453" Score="3" Body="&lt;h2&gt;Chess move&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program that gets a string containing a chessmove and a chessboard as input, and then outputs the chessboard.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Requirements&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The chess move will have this format: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;from square&amp;gt;&amp;lt;to square&amp;gt;[&amp;lt;promoted to&amp;gt;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;d2d4&#xA;f8g7&#xA;a7a8R&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The chessboard format is not fixed, but there must be a 1 to 1 relation between the board and the string to represent the board. Also the format of the input must bet the same as the format of the output. Two suggestions of what it could look like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR&#xA;&#xA;rnbqkbnr pppppppp 00000000 00000000  00000000  00000000 PPPPPPPP RNBQKBNR&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It is not required to store anything except the location of the pieces, and validity of moves can be assumed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Base score is character count (assuming your program can move pieces for all moves)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bonus multipliers:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the program updates the promoted piece, divide by 2&lt;/li&gt;&#xA;&lt;li&gt;If the program also moves the rook when castling, divide by 2&lt;/li&gt;&#xA;&lt;li&gt;If the program also removes the pawn when capturing en passent, divide by 2&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The moves, and castling &amp;amp; en passent in particular are explaned &lt;a href=&quot;http://en.wikipedia.org/wiki/Rules_of_chess#Gameplay&quot; rel=&quot;nofollow&quot;&gt;on Wikipedia&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So basically writing a 100 character solution for the base problem gives the same score as an 800 character solution with all bonus multipliers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you would choose to use one of the board formats above, your input would look like one of these strings:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;e2e4 rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR&#xA;&#xA;e2e4 rnbqkbnr pppppppp 00000000 00000000  00000000  00000000 PPPPPPPP RNBQKBNR&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your corresponding output string would then be one of these:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;rnbqkbnr/pppppppp/8/8/4P3/8/PPPP1PPP/RNBQKBNR&#xA;&#xA;rnbqkbnr pppppppp 00000000 00000000  0000P000  00000000 PPPP0PPP RNBQKBNR&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="11159" LastActivityDate="2013-12-21T22:58:46.453" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="740" PostTypeId="2" ParentId="2140" CreationDate="2013-12-23T12:39:52.393" Score="4" Body="&lt;h2&gt;3D Maze Navigation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Output a path through a 3D maze.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input will be from STDIN and will be a 3D maze. The maze will be input in slices horizontally across the maze starting from the top and moving down to the bottom. Each slice will be of the same width and depth, though the width, depth and number of slices could be different from run to run, and each slice will be separated by a blank line in the input. Here's an example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;*****&#xA;*****&#xA;*****&#xA;*****&#xA;*****&#xA;&#xA;*****&#xA;*@* *&#xA;* * *&#xA;*   *&#xA;*****&#xA;&#xA;*****&#xA;*** *&#xA;*****&#xA;*****&#xA;*****&#xA;&#xA;*****&#xA;*&amp;gt;* *&#xA;* * *&#xA;*   *&#xA;*****&#xA;&#xA;*****&#xA;*****&#xA;*****&#xA;*****&#xA;*****&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;*&lt;/code&gt; character represents a solid wall or floor, &lt;code&gt;@&lt;/code&gt; is our hero and &lt;code&gt;&amp;gt;&lt;/code&gt; is the exit from the maze. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The aim is to find if there is a way for the hero to get to the exit, and if there is, to show him the way with a series of directions:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;SSEENNDDSSWWNN&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Obviously this is a very simple maze, but the test cases will be harder than this. To complicate matters, the maze includes zero or more doors which can only be opened if the hero has picked up the correct key on the way. Each key is represented by a lower case character, and will only open a door represented by the uppercase version of the same letter (so &lt;code&gt;a&lt;/code&gt; opens door &lt;code&gt;A&lt;/code&gt;, &lt;code&gt;b&lt;/code&gt; opens &lt;code&gt;B&lt;/code&gt; and so on). The action of picking up a key is represented in the output with an &lt;code&gt;X&lt;/code&gt;, and the hero has small hands and so can only hold one key at a time (his other hand is holding his mobile phone so he can keep track of his SO reputation). This may mean in some cases that he has to backtrack to get the next key required.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A couple of examples:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;*****&#xA;*****&#xA;*****&#xA;*****&#xA;*****&#xA;&#xA;*****&#xA;*@*&amp;gt;*&#xA;* *D*&#xA;*d  *&#xA;*****&#xA;&#xA;*****&#xA;*****&#xA;*****&#xA;*****&#xA;*****&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;SSXEENN&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The key and door have to be in the correct order, he can't use a key from beyond the door to open the door. If the maze has no solution, you should output nothing at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;*****&#xA;*****&#xA;*****&#xA;*****&#xA;*****&#xA;&#xA;*****&#xA;*@*&amp;gt;*&#xA;* *d*&#xA;*D  *&#xA;*****&#xA;&#xA;*****&#xA;*****&#xA;*****&#xA;*****&#xA;*****&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt; &lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm providing a few test cases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test case 1&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;******                ******&#xA;******                ******&#xA;******                ******&#xA;******                ******&#xA;******                ******&#xA;******                ******&#xA;******                ******&#xA;******                ******&#xA;******                ******&#xA;******                ******&#xA;&#xA;******                ******&#xA;** * *                *    *&#xA;** b**                * ** *&#xA;** * *                * *  *&#xA;*  * *                * ****&#xA;* ** *                * *&amp;gt; *&#xA;*    *                * ** *&#xA;***A**                * ** *&#xA;*@   *                * *  *&#xA;******                ******&#xA;&#xA;****************************&#xA;** * ***********************&#xA;****************************&#xA;**** ******************** **&#xA;****************************&#xA;****************************&#xA;****************************&#xA;****************************&#xA;**** ****************** ** *&#xA;****************************&#xA;&#xA;****************************&#xA;** * *        *    **   *  *&#xA;** * * ****** * ** *  * * **&#xA;* B* *   *    * e* * ****  *&#xA;* **** * *c***** *   *   * *&#xA;*  **  * *    ** ***** **  *&#xA;**    ** ****  *        * **&#xA;*  *****C*** ** * *****E* **&#xA;*d**a***D             * *  *&#xA;****************************&#xA;&#xA;****************************&#xA;****************************&#xA;****************************&#xA;****************************&#xA;****************************&#xA;****************************&#xA;****************************&#xA;****************************&#xA;****************************&#xA;****************************&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt; (other solutions may exist, but I think this is the shortest)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;EEEDDXUWNNWWNNENNEXWNDDSSWSSESEEENENNNNEEEEEEESSWWWSXNEEENNWWWWWWWSSEESSSSNNNNWWSSWSWWWSWSXNENEEENENNEESSSSSEEEEEEEEENNWNNNXSSSEEEEEEESSUUNNNNNNNEEESSWDDESSWSSSEUU    NNNW    &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="737" LastEditorUserId="737" LastEditDate="2014-01-21T12:29:14.880" LastActivityDate="2014-01-21T12:29:14.880" CommentCount="16" ContentLicense="CC BY-SA 3.0" />
  <row Id="742" PostTypeId="2" ParentId="2140" CreationDate="2013-12-23T16:56:03.047" Score="0" Body="&lt;h1&gt;Test for Irreducible Complexity (Check for Redundant Characters)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I may need some additional help coming up with the full spec for this competition.  As of right now, this is just a concept.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Many interesting questions, such as the &quot;42&quot; question in this sandbox, involve finding the longest program which is not reducible.  This means that no set of characters can be removed and still allow the program to function as desired.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The basic idea is that your program will test a Base Program to make sure that it contains no redundant characters.  The input will consist of:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Base Program (in the same language as your answer)&lt;/li&gt;&#xA;&lt;li&gt;Expected Output&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your program will simply evaluate all possible subsequences of the Base Program and verify that none of them give the Expected Output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge actually has a utility value to several other challenges.  For example, it verifies the results of a &quot;longest non-reducible&quot;-type challenge. In addition, it could make sure that a golfed solution cannot be golfed further.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I assume that the winning criteria will be fastest program, as cycling through all the possibilities takes a long time.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Problems&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A sequence of length N has 2^N subsequences.  Even if each evaluation is done very quickly, it might be unfeasible to test any program with more than 20 or so characters in a reasonable amount of time.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2013-12-23T16:56:03.047" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="743" PostTypeId="2" ParentId="2140" CreationDate="2013-12-24T16:29:18.367" Score="1" Body="&lt;h2&gt;Implement addition using only division (code golf)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Thought you could &lt;a href=&quot;https://codegolf.stackexchange.com/questions/12538/implement-division-using-only-addition&quot;&gt;implement division using only addition&lt;/a&gt;? Well try it the other way around!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your job is to make a function or equivalent program that accepts 2 numbers and adds them using only division.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No importing libraries&lt;/li&gt;&#xA;&lt;li&gt;You can't use anything dealing with mathematics except &lt;code&gt;/&lt;/code&gt; and &lt;code&gt;/=&lt;/code&gt;, (and their equivalents)&lt;/li&gt;&#xA;&lt;li&gt;No bitwise operations&lt;/li&gt;&#xA;&lt;li&gt;No string operations except input, output, return, and string concatenation&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="10740" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2013-12-28T16:21:53.063" CommentCount="17" ContentLicense="CC BY-SA 3.0" />
  <row Id="744" PostTypeId="2" ParentId="2140" CreationDate="2013-12-24T19:13:57.980" Score="12" Body="&lt;h1&gt;Digital Music Box&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;What are holidays without music boxes?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to implement a digital music box.  Your program will be given a reel of music such as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Music from &quot;The Polar Express&quot;&#xA;By Glen Ballard and Alan Silvestri&#xA;120 lines per minute&#xA;CDEFGABCDEFGABC&#xA;...............&#xA;..O.O..O.......&#xA;...............&#xA;.......O.O.O...&#xA;...............&#xA;..O.O.O........&#xA;...............&#xA;......O..O.O...&#xA;...............&#xA;CDEFGABCDEFGABC&#xA;O.O....O.......&#xA;.O......O......&#xA;..O......O.....&#xA;....O..........&#xA;..O.O.O........&#xA;...............&#xA;..O.O..........&#xA;...............&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now, your program must play the music, which is straightforward.  In  this example, one line is read every 1/2 second.  If a line contains one or more &lt;code&gt;O&lt;/code&gt; characters, those notes are played simultaneously to form a chord.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The range of the music box is a Concert C scale from Middle C (C4) on the left to High C (C6) on the right.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When a chord is played, the sounds of all previous chords are stopped.  If a line does not contain any notes, then the previous chord is sustained at reduced volume. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input will be several lines of text.  Your program should read and follow the directions line-by-line.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a line contains &lt;code&gt;### lines per minute&lt;/code&gt; then each following line of music should be played at that tempo.  There may be more than one tempo change in the piece, and your program should be able to change tempos.  The tempo change itself does not take up any time.  There will always be a tempo mark before any music lines.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a line contains music (15 characters long, all characters either &lt;code&gt;.&lt;/code&gt; or &lt;code&gt;O&lt;/code&gt;), then those notes should be played and sustained for the correct duration (given by the tempo).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a line does not fall into either of the above categories (like &lt;code&gt;Music from...&lt;/code&gt; and &lt;code&gt;CDEFG...&lt;/code&gt; in the above example), then it should be ignored completely.  The program should act as if they weren't there, simply skip over them with no pause.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Output could either be sound from the speakers, or a playable .MP3 or .WAV music file.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;QUESTIONS&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Should this be code golf?  I assume so, &lt;s&gt;although I want an added bonus for improved sound quality.&lt;/s&gt;  It's probably not going to be possible to enforce sound quality requirements.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Are there any other things to add?  Or, is this pretty much ready to go?&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2013-12-25T00:42:11.180" LastActivityDate="2013-12-25T00:42:11.180" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="745" PostTypeId="1" CreationDate="2013-12-26T16:49:53.083" Score="4" ViewCount="150" Body="&lt;p&gt;Recently, I've noticed that sandbox usage has increased dramatically compared to what I remember.  I've decided to gather some statistics on sandbox usage, which I am posting here in hopes that it is useful information.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am going to offer some analysis of the data.  For most of my analysis, Mk VI (the newest and currently open) is ignored, but I still provide data on it.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Sandbox | Open date | Duration | # answers | # posted | # deleted | # views&#xA;Mk I    | Mar 4'11  |    76    |     17    |     8    |     0     |   795  &#xA;Mk II   | May 19'11 |   160    |     24    |    13    |     1     |  1297  &#xA;Mk III  | Oct 26'11 |   223    |     20    |     8    |     5     |  1001  &#xA;Mk IV   | Jun 15'12 |   346    |     24    |     5    |     2     |  1228  &#xA;Mk V    | May 27'13 |   207    |     32    |     7    |     5     |   994  &#xA;Mk VI   | Dec 20'13 |     6    |      9    |     0    |     1     |   191&#xA;&#xA;Duration  = number of days open before being retired&#xA;# answers = total number of proposed questions in sandbox&#xA;# posted  = number of proposed questions posted to main site*&#xA;# deleted = number of proposed questions deleted by poster&#xA;# views   = number of times sandbox was viewed&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;*Note: I counted # posted by looking through the sandbox for links to the posted questions, which were often in the form of &lt;strong&gt;[posted]&lt;/strong&gt;.  There may be some errors, but I believe that it is reasonably accurate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sandbox &lt;strong&gt;Duration&lt;/strong&gt; is probably a function of two things: the rate of new answers and the definition of &quot;too crowded.&quot;  A less active sandbox lasts for a longer period of time because it takes longer to fill up.  It also appears, however, that the idea of &quot;too crowded&quot; has changed over time, as later sandboxes got rather big before being closed. Mk I had 17 answers before being closed, while Mk V had 32 answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is interesting that &lt;strong&gt;# posted&lt;/strong&gt; is almost the same in Mks I, III, and V. Mk II saw a big spike, while Mk IV was a little low.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;strong&gt;# deleted&lt;/strong&gt; seems to be rather high in Mk III and Mk V.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From this raw data, we can compute some useful numbers.  The first is &lt;strong&gt;%&amp;nbsp;posted&lt;/strong&gt;, which just so happens to be &lt;strong&gt;41/126&amp;nbsp;=&amp;nbsp;32.54%&lt;/strong&gt;.  An more rigorous calculation gives the 95% confidence interval of &lt;strong&gt;(.2498,&amp;nbsp;.4115)&lt;/strong&gt;.  This shows that there is actually a decent amount of uncertainty as to the true rate of sandbox success.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since only 41 out of 126 answers were posted to the main site, while only 14 were deleted, there are still &lt;strong&gt;71&lt;/strong&gt; viable sandbox questions.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Sandbox Popularity Across Time:&#xA;Sandbox     |  Mk I  | Mk II  | Mk III | Mk IV  |  Mk V  | Mk VI&#xA;Answers/day |   .22  |  .15   |  .09   |  .07   |  .16   |  1.5 &#xA; % posted   |   47%  |  54%   |  40%   |  21%   |  22%   |   0%&#xA; % deleted  |    0%  |   4%   |  25%   |   8%   |  16%   |  11%&#xA;Views/day   |  10.5  |  8.1   |  4.5   |  3.5   |  4.8   | 31.8&#xA;(days = duration of sandbox)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;*Note: &lt;strong&gt;Views/day&lt;/strong&gt; is heavily influenced by a number of factors.  For example, a sandbox can continue to gather views after being retired, which inflates the number upwards. Also, posts tend to receive an initial burst of views for the first few days, which aren't representative of popularity over the lifespan of the post.  Mk VI, for example, is almost brand new.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here, we can see that the &lt;strong&gt;answers/day&lt;/strong&gt; is somewhat U-shaped.  The early and later sandboxes have similar numbers, while the middle two have very low numbers (.09 and .07).  I suppose that this is somehow related to the popularity of the site as a whole.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The numbers for &lt;strong&gt;% posted&lt;/strong&gt; generally decline over time.  Some of this is may be because older sandboxes have had more time to incubate.  That isn't the whole reason, though, because there was more than enough time to incubate while the older sandboxes were still open.  I believe that the decline in success rate is real.  This could indicate a decrease in the quality of submissions or an increase in expectations (raising the bar).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is interesting that the first two sandboxes had very low &lt;strong&gt;% deleted&lt;/strong&gt; numbers.  Perhaps users are currently more likely to actually &lt;em&gt;delete&lt;/em&gt; their propositions, rather than just abandoning them through inactivity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;strong&gt;Views/day&lt;/strong&gt; also follows a U-shape, with the first and last sandboxes having higher numbers.  These are probably meaningless, as Mk I probably receives views for simply being the first sandbox, while Mk VI has received several views for simply being a new meta post.  Mks III, IV, and V probably have realistic values.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;It is also useful to talk about the utility value of sandboxes to the main site.  It's hard to measure this, because I feel that sandboxes aren't really used to improve quantity.  They are used more to improve quality.  Quantity-wise, however, there are 1283 questions in the main site.  Out of those, 41 or so went through sandboxes first, so about &lt;strong&gt;3%&lt;/strong&gt;.  This doesn't mean much, however, without taking into account the quality of that 3%, which may be hard to measure (maybe using upvote counts).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;While performing this research, I found that there was a great opportunity.  Earlier, I said that there were still &lt;strong&gt;71&lt;/strong&gt; proposed questions which were neither deleted nor posted. If we could revisit the first few sandboxes, polish up and publish their proposed questions, then we could probably add a few dozen good posts to the main site.  This would take some effort though, and some organization.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I hope that this data is interesting to you.  I thought it was interesting.  I think that having data is important for any decision.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you spot any errors, please tell me.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2013-12-26T16:49:53.083" Title="Statistics on Sandbox Usage" Tags="|discussion|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="746" PostTypeId="1" CreationDate="2013-12-27T19:46:53.167" Score="26" ViewCount="1389" Body="&lt;p&gt;&lt;strong&gt;This is a discussion about the rules. Actual rules can be found in &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-trolling/info&quot;&gt;https://codegolf.stackexchange.com/tags/code-trolling/info&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first ever question with code-trolling tag (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/16226&quot;&gt;I need a program where the user inputs an array of doubles and the program outputs the array sorted&lt;/a&gt;) has been a success and it seems reasonable to assume we will see more of these. It might be a bit early, but I hope to open a discussion on what the rules should be. Original rules:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Suppose that some lazy guy in StackOverflow or elsewhere, asks a&#xA;  homework give-me-dah-codez question. Your task is to give a code that&#xA;  works, but is still useless, severely frustrating the OP.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;This could be achieved by:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Deliberately misinterpreting the question and giving a code that clearly answers what the OP asked, but does something different than what he intended. &lt;/li&gt;&#xA;  &lt;li&gt;Giving a code that runs in superexponential time or worse, when the trivial solution would be linear or better.&lt;/li&gt;&#xA;  &lt;li&gt;Introducing something extremely unacceptable or unreasonable in the code that cannot be removed without throwing everything away, rendering the answer utter useless for the OP. &lt;/li&gt;&#xA;  &lt;li&gt;Writing a code that is a direct and plain cheat on the question. Being a creative troll.&lt;/li&gt;&#xA;  &lt;li&gt;Being evil. &lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;  &#xA;  &lt;p&gt;In your answer, you should briefly explain what you are&#xA;  doing to troll the OP.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Further, we have one restriction: The chosen language should not be&#xA;  the sole reason to troll the lazy OP. Otherwise, you could just&#xA;  plainly encode the correct solution using brainfuck, golfscript or&#xA;  some language that is clearly a crazy, unexpected or unusual choice&#xA;  for the problem, but this would ruin the intention of this as&#xA;  everybody would do that. The intention is to write the homework in a&#xA;  language that the lazy OP might think acceptable, but still frustrate&#xA;  him.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;To start the discussion I propose the following change:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Not being evil. I understand evil as in &lt;code&gt;rm -rf /&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A nice way to limit the &lt;code&gt;print &quot;the sorted array&quot;&lt;/code&gt; answers.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="4681" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-01-04T13:31:03.613" Title="Code-troll rules" Tags="|discussion|code-trolling|" AnswerCount="8" CommentCount="14" ClosedDate="2017-03-03T19:05:06.697" ContentLicense="CC BY-SA 3.0" />
  <row Id="747" PostTypeId="2" ParentId="746" CreationDate="2013-12-27T20:05:18.117" Score="5" Body="&lt;p&gt;&lt;em&gt;In this post, I'm writing as a user, not a moderator.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is awesome. :-) It reminds me of how I approach a lot of the homework problems people post in the [scheme] tag (since a number of CS courses use Scheme).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Basically, professional Schemers frequently use higher-order functions (rather than manual recursion), &lt;a href=&quot;http://srfi.schemers.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;SRFI&lt;/a&gt;s, third-party libraries, &quot;&lt;a href=&quot;https://stackoverflow.com/questions/20791250/returning-functions-in-scheme/20791876?noredirect=1#comment31194143_20791876&quot;&gt;insider-Scheme&lt;/a&gt;&quot;, etc., which students are generally disallowed from using in homework answers. So I simply answer with the code I'd write, as a seasoned Schemer. Easy! :-P&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2013-12-29T13:46:09.510" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="748" PostTypeId="2" ParentId="746" CreationDate="2013-12-27T22:45:15.633" Score="11" Body="&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Not being evil. I understand evil as in &lt;code&gt;rm -rf /&lt;/code&gt;.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;As I already started to say in comments and are instead making an answer from that, I think we could just add a restriction to make it not destructive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I like the &quot;Being evil&quot; because it is a really strong suggestion and the vagueness was intended to incentive answerers in being creative. This basically means that you should by no means being helpful. You may be evil by just plain lying, by looping infinitely, by making the OP (and hopefully his teacher too) to lose a lot of time in a useless answer that will give a plain F as the score. And so on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We could add something like:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The program is in general expected to be amusing, annoying, silly, deceptive and/or mischievous, but is must not be destructive.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;A nice way to limit the print &quot;the sorted array&quot; answers.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I agree about the answers that just plainly do this. But there are &lt;a href=&quot;https://codegolf.stackexchange.com/a/16290/3755&quot; title=&quot;An answer&quot;&gt;some answers&lt;/a&gt; that do this in a creative way. I think that adding something like &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Please do better than just printing a quote from the lazy OP question. If the lazy OP asks &quot;I need a program to output FOO&quot;, a program that is simply &lt;code&gt;output FOO&lt;/code&gt; is not very creative. Do better than that.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Further, I would add this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Answers that provides no code are not elligible for being accepted. They might be fun and could get some upvotes, but won't be accepted.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Finally, initially I was in fear that the question would be ignored, could get a lot of downvotes and be closed, so I am very happy that what happened was quite the opposite and i was very wrong about that presumption.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is much more successful than I could though. In just a few hours I got 11 badges, 7 hats, including one secret hat, hitted the daily reputation cap limit in a flash, spent all my daily upvotes in answers to my own question, got more than 50 answers, more than 70 upvotes and almost 20 stars in the question, and almost 50 upvotes in my own answer. And this is still counting. I never saw a question collecting so many answers and upvotes so quickly, and I am proud to say that I asked it! People, really thanks to everyone that is participating to this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The only thing left, is that I really want that someone beats my own answer, I would be very happy to accept an answer that could do this.&lt;/p&gt;&#xA;" OwnerUserId="3755" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2013-12-28T00:20:39.700" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="749" PostTypeId="2" ParentId="746" CreationDate="2013-12-27T22:54:35.537" Score="6" Body="&lt;p&gt;I agree with the comments that &quot;being evil&quot; is too vague. A &quot;bad&quot; evil is harming the computer, while a &quot;good&quot; evil is having code that sometimes doesn't work. We should clarify that &quot;being evil&quot; should be in a similar spirit to the Underhanded C competitions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also feel that the &lt;code&gt;print &quot;the sorted array&quot;&lt;/code&gt;-type answers do get old after a while.  It's kinda funny at first, but repeating the joke doesn't take much effort.  It might be hard to limit those answers, so I think it may be best to leave it up to the voters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I might add something else to the list of ways to troll, which is to write something which no person would dare hand in to a teacher, like obfuscated code.  The code works flawlessly, but &lt;em&gt;how&lt;/em&gt; it works is so obscure that there's no way to understand it without being the author.  For an example, look at &lt;a href=&quot;https://codegolf.stackexchange.com/a/16274/2867&quot;&gt;my submission&lt;/a&gt; to the sorting question.  I understand how it works, but explaining it is impossible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We could probably extend that to mean solving the problem in a way that the (non-existent) &quot;asker&quot; will almost surely not understand, like some super-obscure feature of the language.  This would not be as obfuscated code as it would be obscure code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After all, trolling is a art.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2013-12-27T22:54:35.537" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="750" PostTypeId="2" ParentId="746" CreationDate="2013-12-28T00:27:09.290" Score="1" Body="&lt;p&gt;(I'm adding this as a separate answer because it covers a different aspect.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it is interesting how some questions on this site &quot;go viral.&quot;  Once they make it onto the &lt;a href=&quot;https://i.stack.imgur.com/KqDKQ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;hot feed&lt;/a&gt;, they attract a lot of attention from people who didn't yet know this site existed.  There are 30 questions on the front page of the hot list. Of them, 9 are from beta sites, and we have 2 of those 9.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I hope that we are getting closer to exiting beta, although we still have a ways to go.  I honestly don't know what the requirements are, however.  &lt;s&gt;Patents.SE is fully published, but only has 881 questions (we have 1,287)&lt;/s&gt;.  CodeReview.SE has 10,945 questions and is still in beta.  Bicycles.SE is fully published and has 3,953 questions.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2013-12-28T00:46:55.200" LastActivityDate="2013-12-28T00:46:55.200" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="751" PostTypeId="2" ParentId="713" CreationDate="2013-12-28T00:50:15.740" Score="13" Body="&lt;p&gt;&lt;strong&gt;Update:&lt;/strong&gt; &lt;a href=&quot;http://blog.stackoverflow.com/2014/04/putting-the-community-back-in-wiki/&quot;&gt;this is now removed &lt;em&gt;network-wide&lt;/em&gt;.&lt;/a&gt; There is a flag that'll be raised in extreme circumstances though, so at least mods will be aware of runaway answers.&lt;/p&gt;&#xA;" OwnerUserId="1144" LastEditorUserId="1144" LastEditDate="2015-02-20T03:40:58.607" LastActivityDate="2015-02-20T03:40:58.607" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="752" PostTypeId="1" AcceptedAnswerId="753" CreationDate="2013-12-28T05:11:06.380" Score="7" ViewCount="121" Body="&lt;p&gt;I had an up-vote on my answer here: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/16226/trolling-homework-questions-sorting/16331#16331&quot;&gt;I need a program where the user inputs an array of doubles and the program outputs the array sorted&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question is why did my reputation not go up?  It is listed in my reputation list, but my rep did not go up, and it doesn't say it did, it is just listed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I really wouldn't care, but I do not have access to many features that I like on Stack Overflow, and it is hard enough to earn rep as it is!&lt;/p&gt;&#xA;" OwnerDisplayName="user10766" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2013-12-28T07:53:11.307" Title="Upvote on answers" Tags="|bug|status-bydesign|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="753" PostTypeId="2" ParentId="752" CreationDate="2013-12-28T05:56:22.113" Score="7" Body="&lt;p&gt;Because the question unfortunately was automatically forced to be community wiki when it reached 60 answers. This mechanism exists in most SE sites to avoid reputation farming. But codegolf is different and this rule does not makes sense here, the auto community wiki in codegolf is a major annoyance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See these questions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/29/auto-cw-limit-number-of-answers&quot;&gt;Auto CW limit (number of answers)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/28/should-golf-questions-be-a-cw-and-why&quot;&gt;Should golf questions be a CW and why?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/713/remove-auto-cw-limit&quot;&gt;Remove Auto CW Limit&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/238/please-raise-or-remove-cw-limits-on-code-golf-se-site&quot;&gt;Please raise or remove CW limits on Code Golf SE site&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Specially, see this answer:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/33/3755&quot;&gt;https://codegolf.meta.stackexchange.com/a/33/3755&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3755" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2013-12-28T05:56:22.113" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="755" PostTypeId="2" ParentId="746" CreationDate="2013-12-28T16:10:33.730" Score="1" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;A nice way to limit the &lt;code&gt;print &quot;the sorted array&quot;&lt;/code&gt; answers.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;One way to do this is to require the trolling to actually happen algorithmically, within the code itself. If the &quot;misinterpretation&quot; of the requirements is just a matter of wordplay, then the code itself is meaningless.&lt;/p&gt;&#xA;" OwnerUserId="7110" LastActivityDate="2013-12-28T16:10:33.730" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="757" PostTypeId="1" CreationDate="2013-12-28T19:34:47.950" Score="17" ViewCount="566" Body="&lt;p&gt;Let me just say this bluntly: we need to do more moderation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some facts: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For a while, I was the only user with &lt;strong&gt;any&lt;/strong&gt; active delete votes. (I posted a message in chat to rectify this, which helped a little)&lt;/li&gt;&#xA;&lt;li&gt;Currently, bad content stays on the site for too long, accumulating usually no delete votes.&lt;/li&gt;&#xA;&lt;li&gt;Flags are acted on extremely slowly;  the same flag sometimes sticks in the queue for 3 or more days. Never have I seen a flag handled within 5 hours.&lt;/li&gt;&#xA;&lt;li&gt;General programming and other off topic questions sometimes take a day to be closed.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; has brought in a lot of attention, so this is especially important now&lt;/li&gt;&#xA;&lt;li&gt;Now the flood of code trolling questions is starting to get unmanageable...&lt;/li&gt;&#xA;&lt;li&gt;Yes, Community♦ will auto-delete stuff, but the quicker bad content gets off the site, the better. We need to show the actual quality of our site, not this flood of code trolling questions. (And any other low quality questions that may appear.)&lt;/li&gt;&#xA;&lt;li&gt;etc...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So, I propose a moderator election, and some other things, but mainly that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I know that elections can happen when the current mods call out to the powers that be. Why not do that? No offense to mods, but many users are much more active than them.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The last activity by any mod was December 21st. It was a simple comment about some code. Again, no offense, but the moderators barely do any (publicly viewable) moderation.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users?filter=week&amp;amp;tab=moderators&quot;&gt;Check, if you would like. See for yourself.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Our site needs more moderation. It needs moderators that regularly moderate.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If bad things were stopped sooner, people would get the right idea and do &lt;em&gt;better things.&lt;/em&gt; If we want to get out of beta, we need to show that we can; we need to keep every question on our site's topic and show that we &lt;em&gt;can&lt;/em&gt; survive as a full Stack Exchange site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, it would be great if the current moderators would reach out to Stack Exchange and get an election going.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also have a related but minor and less important proposal: just get the community to do better moderation. Just do that, however you can - tell other users; post a community bulletin; hold a contest or something. And if you're reading this as a privileged users on CodeGolf.SE, just follow this call to action and do more moderation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thank you for reading. I just want one of my favorite Stack Exchange sites to succeed.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="68942" LastEditDate="2021-06-09T05:48:03.267" LastActivityDate="2021-06-09T05:48:03.267" Title="Moderation: a call to action" Tags="|discussion|feature-request|status-completed|moderation|moderators|" AnswerCount="1" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="758" PostTypeId="2" ParentId="746" CreationDate="2013-12-28T20:14:57.450" Score="1" Body="&lt;p&gt;Ok, but how are we going to get all the give-me-the-codez-for-my-homework questions migrated here? &lt;code&gt;;-)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Migration functionality on stackoverflow is unfortunately limited to the top-5 sites or so. Other than that, only moderators apparently can migrate questions.&lt;/p&gt;&#xA;" OwnerUserId="11826" LastActivityDate="2013-12-28T20:14:57.450" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="759" PostTypeId="2" ParentId="757" CreationDate="2013-12-29T02:15:12.197" Score="5" Body="&lt;p&gt;I don't oppose the idea of holding an election to bring more moderators on board, but my understanding is that elections generally only happen for graduated (out of beta) sites, and this site doesn't seem like it's going to graduate any time soon.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Though, with your level of passion and dedication, perhaps you could help it graduate? You &lt;em&gt;are&lt;/em&gt; signing up to be nominated for moderatorship, aren't you? :-)&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2013-12-29T02:15:12.197" CommentCount="16" ContentLicense="CC BY-SA 3.0" />
  <row Id="760" PostTypeId="1" AcceptedAnswerId="764" CreationDate="2013-12-29T02:53:05.947" Score="37" ViewCount="1657" Body="&lt;p&gt;I don't have anything against code-trolling. I think it's a creative idea and a nice break from other, more serious, questions. But I also think it's going a little bit out of hand. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/uKdjN.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm beginning to have difficulties finding new serious puzzles/challenges, while the flood of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; questions is rising dramatically.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we do something about it? Is this wanted behavior?&lt;/p&gt;&#xA;" OwnerUserId="11674" LastActivityDate="2014-01-09T22:51:21.810" Title="Is code trolling getting out of control?" Tags="|discussion|code-trolling|" AnswerCount="8" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="761" PostTypeId="2" ParentId="760" CreationDate="2013-12-29T03:31:06.737" Score="32" Body="&lt;p&gt;I agree that is has been overstretched.  People are quick to try to mimic a successful thread, but don't have the &quot;inspiration&quot; required to write a good puzzle.  To be more specific, they are deciding to write a code-trolling puzzle before deciding what the puzzle is going to be about.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is not to say that code-trolling is a bad concept, just that mimic questions (which always come after a success) tend to have less ingenuity.  That, and the sheer number of them gets annoying.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, I think this is a temporary problem which will go away in a few days.  Between now and then, however, we can simply downvote/close any particularly bad ideas.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, there are now tons of new members who are not accustomed to this site.  They don't have a good &quot;feel&quot; for what makes a good question, which can cause problems.  This is an opportunity to educate and recruit!&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2013-12-29T03:31:06.737" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="763" PostTypeId="2" ParentId="713" CreationDate="2013-12-30T08:53:01.137" Score="5" Body="&lt;p&gt;Just so people can tell what happened.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/238/please-raise-or-remove-cw-limits-on-code-golf-se-site/242#comment2859_242&quot;&gt;The auto-cw limit has now been set to 500 answers&lt;/a&gt;. I personally think that if any question reaches that amount of answers, then something is wrong, so I applaud this limit. &lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2013-12-30T08:53:01.137" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="764" PostTypeId="2" ParentId="760" CreationDate="2013-12-30T10:09:31.490" Score="15" Body="&lt;p&gt;I would argue that if code trolling isn't off topic then it should be. It's an activity more suited for chat than for this site: it's an opportunity for people to show off their &quot;wit&quot; rather than their skill in coding to a spec while optimising against a particular criterion. I would quite happily delete all questions in the category.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2013-12-30T10:09:31.490" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="765" PostTypeId="1" CreationDate="2013-12-30T13:10:40.140" Score="6" ViewCount="351" Body="&lt;p&gt;Our FAQ on &quot;&lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;on-topic questions&lt;/a&gt;&quot; currently states:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;All questions on this site, whether a programming puzzle or a code golf, should have ...&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;A clear specification of what constitutes a &lt;em&gt;correct&lt;/em&gt; submission. Test cases are highly encouraged.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;There have recently been a lot of questions which push this requirement. For example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Code-trolling.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/16789/194&quot;&gt;“Useful” self-modifying script for financial firm&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/16185/194&quot;&gt;Create a Y2K disaster&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For all of these, whether or not an answer meets the specification is subject to debate. (It may not be coincidence that these are all &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we close as off-topic any question for which it is not possible to write test cases?&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-01-03T08:02:59.373" Title="What is a spec?" Tags="|discussion|challenges|challenge-quality|" AnswerCount="3" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="766" PostTypeId="2" ParentId="760" CreationDate="2013-12-30T18:05:09.710" Score="5" Body="&lt;p&gt;I like code trolling, but I think a que would be great so that we only get one per day. I also think we should add the requirement that all trolling questions must have been posted first somewhere else.&lt;/p&gt;&#xA;" OwnerUserId="10731" LastActivityDate="2013-12-30T18:05:09.710" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="767" PostTypeId="1" CreationDate="2013-12-30T18:27:37.453" Score="1" ViewCount="257" Body="&lt;p&gt;I've been playing with some ideas for a challenge to poke fun at java virtual machines and was pondering a brainfuck virtual machine (three bit bus!) and I got to wondering if there are any brainfuck variants that support closures, function calls, and function references.&lt;/p&gt;&#xA;" OwnerUserId="10731" LastEditorUserId="2867" LastEditDate="2013-12-30T19:12:31.380" LastActivityDate="2013-12-30T19:50:27.030" Title="lambda brainfuck and virtual machines" Tags="|discussion|" AnswerCount="1" CommentCount="0" ClosedDate="2013-12-31T12:27:34.420" ContentLicense="CC BY-SA 3.0" />
  <row Id="768" PostTypeId="2" ParentId="767" CreationDate="2013-12-30T19:50:27.030" Score="3" Body="&lt;p&gt;You could be interested in &lt;a href=&quot;http://esolangs.org/wiki/Brainfunct&quot; rel=&quot;nofollow&quot;&gt;Brainfuct&lt;/a&gt;. It's Brainfuck, but with lambdas, and great functional programming features. For example, in Brainfuct, the cat program looks like this.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;,.&amp;lt;@/+@&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In this program, two functions are declared, main function (&lt;code&gt;+@&lt;/code&gt;), and first function (&lt;code&gt;&amp;gt;,.&amp;lt;@&lt;/code&gt;). &lt;code&gt;@&lt;/code&gt; calls the function under pointer. As you can see, there is lambda (functions can read state - i.e. tape), function calls (&lt;code&gt;@&lt;/code&gt;), and function references (every function (with exception for main function) is a number).&lt;/p&gt;&#xA;" OwnerUserId="3103" LastActivityDate="2013-12-30T19:50:27.030" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="769" PostTypeId="2" ParentId="760" CreationDate="2013-12-30T19:57:15.850" Score="0" Body="&lt;p&gt;It's just &lt;a href=&quot;http://tvtropes.org/pmwiki/pmwiki.php/Main/FollowTheLeader&quot; rel=&quot;nofollow&quot;&gt;Follow the Leader&lt;/a&gt;. To answer the question, it probably is, as it increases the activity on website.&lt;/p&gt;&#xA;&#xA;&#xA;" OwnerUserId="3103" LastActivityDate="2013-12-30T19:57:15.850" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="770" PostTypeId="2" ParentId="746" CreationDate="2013-12-30T21:04:31.993" Score="1" Body="&lt;p&gt;(I am a newcomer here, i find it thanks to the first trolling question so I might not have very strong background here)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anyway, the first question was funny because it was very original. But now it seems that with all those mindless coding changes they are not funny anymore. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem with them is that they are supposed to be joke but at the same time the are so explicitly telling you that they are only jokes. That it is very artificial and not funny. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I mean the purpose of Trolling is to make fun of somebody who has no idea that it is only trolling. This is not a trolling, you would have to be really trolling the person who asks and here everybody knows that both the question and the answer are not real. It does not make sense. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The purpose of the Stack Exchange is to help them find the answer to their questions. As those questions are not really questions and the answers are not really helpful. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;As it is not trolling nor funny and most importantly not helpful I would go for banning the trolling questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I would like to say that i liked the idea of the first question.)&lt;/p&gt;&#xA;" OwnerUserId="11696" LastActivityDate="2013-12-30T21:04:31.993" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="771" PostTypeId="2" ParentId="630" CreationDate="2013-12-30T21:11:18.513" Score="5" Body="&lt;p&gt;I thought of (some form of) this question probably since the first day I checked out the site. And my view is that this is something the platform is supposed to provide, but afaik support for this kind of features is missing (in stackexchange).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The way I imagine it is this: each answer can specify a language and a score (in separate fields from the main textarea), then the system automatically shows the list of languages used, and for each language it provides some info about the best answer (perhaps the user's name with a link to the answer) and a filter to show only answers in that language. Also, there should be an option to sort answers by score (both when filtered and globally), and sort languages in the list by score and by number of answers (not just alphabetically).&lt;br&gt;&#xA;So that would answer question A.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For question B, I think we can either remove the option to have a global winner, or (better) let the asker choose whichever winner they desire (including none), perhaps even having an option to automatically select the answer with the best score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think voting just doesn't cut it, except for challenges where there is no objective score and the winner is actually determined by voting. So yes, some questions will have no objective score (e.g. the recent code-trolling ones) and others will have no direct language association (e.g. polyglot challenges) but generally they have both.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If this kind of system can't be done on stackexchange, then what about making a separate site for it?&lt;/p&gt;&#xA;" OwnerUserId="7416" LastActivityDate="2013-12-30T21:11:18.513" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="772" PostTypeId="2" ParentId="765" CreationDate="2013-12-30T22:09:02.997" Score="1" Body="&lt;p&gt;Perhaps instead of closing questions for which &lt;em&gt;it is not possible&lt;/em&gt; to write test cases, we could close questions (new questions - there's no point going back through the old questions) that &lt;em&gt;do not include&lt;/em&gt; a test case or two.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One problem that this could cause is quite a large increase in question size if the input is quite large (I'm thinking of some really good questions like, for example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/3179/bridges-and-tunnels&quot;&gt;Joey's Bridges and Tunnels&lt;/a&gt;) - in this case would it be acceptable to provide the test cases in an external file?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Adding test cases to a question shows that the questioner has put some thought into the question and hasn't just chucked it together in 2 minutes to try and gain a few extra points reputation.&lt;/p&gt;&#xA;" OwnerUserId="737" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2013-12-30T22:09:02.997" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="773" PostTypeId="1" AcceptedAnswerId="774" CreationDate="2013-12-31T00:01:40.257" Score="0" ViewCount="240" Body="&lt;p&gt;One of the rules for posting a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; question is to clearly state that the question is a code-trolling question. Therefore most questions include the below disclaimer recommended by the tag's wiki&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;sup&gt;Note: This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; question. Please do not take the question and/or answers seriously. More information &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-trolling/info&quot;&gt;here&lt;/a&gt;.&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;No one would bother writing their own disclaimer anyway, so why just don't automatically add the above disclaimer to questions tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Prevents disclaimer-less code-trolling questions&lt;/li&gt;&#xA;&lt;li&gt;Saves time&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There are few pros, but what are the cons?&lt;/p&gt;&#xA;" OwnerUserId="11834" LastEditorUserId="68942" LastEditDate="2021-06-09T05:47:51.647" LastActivityDate="2021-06-09T05:47:51.647" Title="Automatic code-trolling disclaimer" Tags="|feature-request|status-declined|code-trolling|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="774" PostTypeId="2" ParentId="773" CreationDate="2013-12-31T09:51:48.807" Score="4" Body="&lt;p&gt;Why have the Stack Exchange devs program &lt;em&gt;an entirely new feature&lt;/em&gt; just for a &lt;em&gt;single tag&lt;/em&gt;, especially when most of us regulars don't even like the tag at all? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You know, if the questions need to each individually have their own &quot;disclaimer,&quot; maybe they shouldn't even exist. The first one was great, but the now steady stream of low quality code trolling questions is... disheartening, to say the least.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anyway, it's not that hard to copy and paste a little block of Markdown, if you really want to.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2013-12-31T09:51:48.807" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="777" PostTypeId="1" CreationDate="2013-12-31T16:02:37.220" Score="19" ViewCount="1400" Body="&lt;p&gt;My question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/16853/how-many-langs-can-you-hack-in&quot;&gt;Just Another Polyglot Hacker!&lt;/a&gt; was marked as a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/7261/write-a-polyglot-that-prints-the-languages-name&quot;&gt;Write a polyglot that prints the language&amp;#39;s name&lt;/a&gt;. Now, our scoring rules are completely different. Why are they considered dupes?&lt;/p&gt;&#xA;" OwnerUserId="10590" LastEditorUserId="68942" LastEditDate="2021-04-04T15:51:55.253" LastActivityDate="2021-04-04T15:51:55.253" Title="Are two questions duplicates if they have different scoring rules?" Tags="|discussion|faq|" AnswerCount="4" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="779" PostTypeId="2" ParentId="760" CreationDate="2013-12-31T16:54:07.770" Score="7" Body="&lt;p&gt;In addition, @PhiNotPi 's wonderful answer, I think we need more strict guidelines on how code-trolling questions should be written. Perhaps these as a few starting requirements? (Some of these may already exist as criteria)&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Novelty - A question or topic should not be repeated unless there is a significant difference in interpretation. I.E. Answers to a previous question should not be able to be copy-pasted into the new question with only minor modifications.&lt;/li&gt;&#xA;&lt;li&gt;Clear Winner - There should be clear and simple rules explaining how a winner should be determined. If &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; is applied, there should be a clear indication of what qualities make a good answer.&lt;/li&gt;&#xA;&lt;li&gt;A statement of what can and cannot be accepted. While each question may warrant variations, Here are a few examples:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No trivial solutions, like &lt;code&gt;print(&quot;the code&quot;);&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;No malicious code, like &lt;code&gt;rm -rf /&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Difficulty - There should be at least &lt;em&gt;some&lt;/em&gt; challenge. A question asking to print a string backwards is not enough of a challenge to be remotely puzzling.&lt;/li&gt;&#xA;&lt;li&gt;Open to interpretation - The question should be somewhat vague, or allowing for (possibly deliberate) misinterpretation of what the OP wanted.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="11947" LastActivityDate="2013-12-31T16:54:07.770" CommentCount="0" CommunityOwnedDate="2013-12-31T16:54:07.770" ContentLicense="CC BY-SA 3.0" />
  <row Id="780" PostTypeId="2" ParentId="777" CreationDate="2013-12-31T17:08:28.120" Score="9" Body="&lt;p&gt;The criteria I like to apply (and this is not by any means official rules) is one regarding the answers to the question:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If answers can be copy/pasted from one challenge to another (with minor modifications), then the two challenges are too similar, and the new one can no longer be considered novel enough to pose a challenge.&lt;/p&gt;&#xA;" OwnerUserId="11947" LastActivityDate="2013-12-31T17:08:28.120" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="781" PostTypeId="2" ParentId="777" CreationDate="2013-12-31T17:11:38.793" Score="9" Body="&lt;p&gt;Like so many things on CodeGolf, &lt;em&gt;it depends&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question to ask is &lt;em&gt;&quot;Are good entries for one challenge good entries for the other?&quot;&lt;/em&gt; If the answer is yes, then I would consider them to be duplicates even it the change in scoring would change the &quot;winner&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the Answer is not, then you clearly have a different challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sometimes the answer will be &lt;em&gt;&quot;Well, uhm, ... you see ... hmmm, maybe?&quot;&lt;/em&gt;, which is a hard case.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Taking advantage of the sand box would probably help you to ensure enough difference to satisfy.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;To this particular pair I'd say that the possibly significant difference is in the requirement for rigorous correctness. The scoring difference is a quibble and would not qualify them as distinct to my mind (moderator hat very much off).&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2013-12-31T17:11:38.793" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="782" PostTypeId="2" ParentId="760" CreationDate="2013-12-31T18:51:02.937" Score="4" Body="&lt;p&gt;I think it's all just good fun and don't see a reason to kill it off. As @manatwork pointed out in his comment on the question, if you really get sick of it just Ignore the tag.&lt;/p&gt;&#xA;" OwnerUserId="12201" LastActivityDate="2013-12-31T18:51:02.937" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="783" PostTypeId="2" ParentId="777" CreationDate="2013-12-31T19:39:27.090" Score="-1" Body="&lt;p&gt;I 'test' for duplicates in the manner described in the other answers, that is, if two questions can be answered by the same response they are duplicates. In this case there was a distinct difference (IMO) because the requirement for the later question was only tangentially (e.g. in case of a tie) related to golfing, and was focused primarily on number of languages, whereas the other question focused on golfing more. This is not an arbitrary difference because it inherently allows for some more wordy languages to be used (e.g. Java), making answers to the new one potentially more multifarious in their language use. This is however ambiguous in the test for originality because while a response to the earlier question would a good response to the later one, the reverse is not necessarily true. In essence the answers to the first question can be considered a proper subset of the possible answers to the second. Therefore, in this case I wouldn't consider them duplicates, but I wouldn't consider the later question wholly original either.&lt;/p&gt;&#xA;" OwnerUserId="11283" LastActivityDate="2013-12-31T19:39:27.090" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="784" PostTypeId="1" CreationDate="2013-12-31T20:53:24.513" Score="0" ViewCount="159" Body="&lt;p&gt;This is a new puzzle where users will work together to implement a hangman game.  Users will each post a statement of code, then wait for three other users to enter their statements OR for 10 minutes to pass and 1 other user to enter their statement, then will post another statement.  Imports do not count as statements.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Due to the nature of this competition, it will take place on Chat.  If you are interested, please join us in this chat room for the link to the code room: &lt;a href=&quot;http://chat.stackexchange.com/rooms/12239/code-rigmarole&quot;&gt;http://chat.stackexchange.com/rooms/12239/code-rigmarole&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All parts of this challenge are open to discussion and debate.&lt;/p&gt;&#xA;" OwnerDisplayName="user10766" LastEditorUserId="3808" LastEditDate="2014-02-12T13:25:03.053" LastActivityDate="2014-02-12T13:25:03.053" Title="Code-rigmarole - Hangman" Tags="|discussion|new-genre|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="785" PostTypeId="5" CreationDate="2013-12-31T20:57:40.577" Score="0" Body="&lt;p&gt;This tag is for Code-rigmarole challenges.  This is a challenge where each user enters a code statement to work towards a given final solution, then waits for three other users to enter their statements before adding an additional statement.  For questions, please visit this chat room and include @user2509848 : &lt;a href=&quot;http://chat.stackexchange.com/rooms/12239/code-rigmarole&quot;&gt;http://chat.stackexchange.com/rooms/12239/code-rigmarole&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user10766" LastEditorDisplayName="user10766" LastEditDate="2014-01-01T00:04:27.520" LastActivityDate="2014-01-01T00:04:27.520" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="786" PostTypeId="4" CreationDate="2013-12-31T20:57:40.577" Score="0" Body="A challenge where many people work to solve a given problem." OwnerDisplayName="user10766" LastEditorDisplayName="user10766" LastEditDate="2014-01-01T01:43:52.813" LastActivityDate="2014-01-01T01:43:52.813" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="788" PostTypeId="1" CreationDate="2014-01-01T19:29:04.827" Score="20" ViewCount="1237" Body="&lt;p&gt;The favicon for this site &lt;img src=&quot;//codegolf.stackexchange.com/favicon.ico&quot; alt=&quot;image&quot;&gt; has ugly and asymmetric corners:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/yyLID.png&quot; alt=&quot;magnified&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Compared to the corresponding icons for other beta SE sites, which only have one pixel cut off from each corner, I find the upper corners of our icon especially ugly, since the top edge of the icon shows a visible step.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I first thought it was just a glitch caused by cramming our three-letter abbreviation into an icon template that's too small for it, but on a closer look. it actually seems like there's been at least an attempt to make it fit.  Still, I think we could do better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Jin's been known to &lt;a href=&quot;https://crypto.meta.stackexchange.com/questions/245/cryptographys-favicon-is-inconsistent-with-larger-icons&quot;&gt;tweak site favicons based on community feedback before&lt;/a&gt;, so I figured I'd try the same here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've posted two suggestions for tweaked icons below; feel free to vote on them to show your preference, or post a third option if you have one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ps. Note that even beta site favicons apparently don't &lt;em&gt;have&lt;/em&gt; to be pure text; see e.g. the favicons for &lt;a href=&quot;//anime.stackexchange.com&quot;&gt;anime.SE &lt;img src=&quot;//anime.stackexchange.com/favicon.ico&quot; alt=&quot;icon&quot;&gt;&lt;/a&gt;, &lt;a href=&quot;//chess.stackexchange.com&quot;&gt;chess.SE &lt;img src=&quot;//chess.stackexchange.com/favicon.ico&quot; alt=&quot;icon&quot;&gt;&lt;/a&gt; and &lt;a href=&quot;//poker.stackexchange.com&quot;&gt;poker.SE &lt;img src=&quot;//poker.stackexchange.com/favicon.ico&quot; alt=&quot;icon&quot;&gt;&lt;/a&gt;.  Dunno what icon would symbolize our site well, though...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;(OK, so technically those icons &lt;em&gt;are&lt;/em&gt; all text, or at least &lt;a href=&quot;http://www.isthisthingon.org/unicode/?glyph=753B&quot; rel=&quot;nofollow noreferrer&quot;&gt;valid&lt;/a&gt; &lt;a href=&quot;http://www.isthisthingon.org/unicode/?glyph=265C&quot; rel=&quot;nofollow noreferrer&quot;&gt;Unicode&lt;/a&gt; &lt;a href=&quot;http://www.isthisthingon.org/unicode/?glyph=2663&quot; rel=&quot;nofollow noreferrer&quot;&gt;characters&lt;/a&gt;.  Anyway, you know what I mean...)&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="76162" LastEditDate="2021-06-04T09:58:17.537" LastActivityDate="2021-06-04T09:58:17.537" Title="Our favicon is ugly and asymmetric. Let's fix it!" Tags="|discussion|feature-request|status-completed|site-design|" AnswerCount="14" CommentCount="6" ClosedDate="2021-06-03T23:33:26.197" ContentLicense="CC BY-SA 3.0" />
  <row Id="789" PostTypeId="2" ParentId="788" CreationDate="2014-01-01T19:29:04.827" Score="8" Body="&lt;p&gt;Here's my first suggestion for a new favicon:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&amp;nbsp; &lt;img src=&quot;https://i.stack.imgur.com/idQK5.png&quot; alt=&quot;new favicon&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&amp;nbsp; &lt;img src=&quot;https://i.stack.imgur.com/FfEre.png&quot; alt=&quot;magnified x 8&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It looks the same as the other SE beta favicons, except for being two pixels wider.  This is the version I personally prefer.&lt;/p&gt;&#xA;" OwnerUserId="3191" LastActivityDate="2014-01-01T19:29:04.827" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="790" PostTypeId="2" ParentId="788" CreationDate="2014-01-01T19:30:23.923" Score="4" Body="&lt;p&gt;Here's an alternative suggestion, based on the current favicon, but with the top corners changed to match the bottom ones:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&amp;nbsp; &lt;img src=&quot;https://i.stack.imgur.com/5gcp0.png&quot; alt=&quot;new favicon&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&amp;nbsp; &lt;img src=&quot;https://i.stack.imgur.com/IWymC.png&quot; alt=&quot;magnified x 8&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="3191" LastActivityDate="2014-01-01T19:30:23.923" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="791" PostTypeId="2" ParentId="784" CreationDate="2014-01-01T20:38:48.960" Score="2" Body="&lt;p&gt;I am having a great deal of trouble seeing &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;How this would integrate with the way the site works.&lt;/li&gt;&#xA;&lt;li&gt;How it could be reasonably voted on&lt;/li&gt;&#xA;&lt;li&gt;How the rules about waiting could be enforced&lt;/li&gt;&#xA;&lt;li&gt;How you would overcome edit collisions&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;In short, the idea may have merit on its own but it is totally unsuitable for the site.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2014-01-01T20:38:48.960" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="792" PostTypeId="2" ParentId="760" CreationDate="2014-01-01T20:42:26.913" Score="4" Body="&lt;p&gt;The code trolling questions scratch an itch for me. I'm more of an enterprisey, use-lots-of-patterns-and-architecture programmer, so they offer code puzzles that give me a chance to exercise the aspects of programming that I enjoy. I'm much more likely to post code trolling questions and answer them than I am to enter the more established types of contests and would be sad to see code trolling questions go away all together.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, I know I'm not a regular user, nor am I the type of programmer who's attracted to the established golf and obfuscation contests that are well-established on this site. I don't want code trolling questions to go away completely myself, but I understand that each SE site sets its own boundaries. If the established community here decides that code-trolling questions are off-topic, I'll accept it.&lt;/p&gt;&#xA;" OwnerUserId="7984" LastEditorUserId="7984" LastEditDate="2014-01-01T21:03:19.190" LastActivityDate="2014-01-01T21:03:19.190" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="793" PostTypeId="2" ParentId="788" CreationDate="2014-01-01T23:01:19.867" Score="52" Body="&lt;p&gt;For a third option, it turns out there &lt;em&gt;is&lt;/em&gt; a Unicode character for &lt;a href=&quot;http://www.fileformat.info/info/unicode/char/26f3/index.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Flag In Hole (U+26F3)&lt;/a&gt;.  Here's my attempt to render it in pixel art on the standard beta SE favicon template:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&amp;nbsp; &lt;img src=&quot;https://i.stack.imgur.com/OdXNF.png&quot; alt=&quot;favicon&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&amp;nbsp; &lt;img src=&quot;https://i.stack.imgur.com/YUGzd.png&quot; alt=&quot;magnified x 8&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And a variant with a ball next to the green:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&amp;nbsp; &lt;img src=&quot;https://i.stack.imgur.com/83YOb.png&quot; alt=&quot;favicon&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&amp;nbsp; &lt;img src=&quot;https://i.stack.imgur.com/nfqQN.png&quot; alt=&quot;magnified x 8&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think this actually turned out pretty nice.  I'm slightly worried about is the potential for future confusion if there's ever an SE site for &lt;em&gt;real&lt;/em&gt; golf, but that seems to be &lt;a href=&quot;//sports.stackexchange.com/questions/tagged/golf&quot;&gt;covered by sports.SE&lt;/a&gt; already, so we should be (fairly) safe.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt; Since this icon turned out so popular, I tried to make some larger versions of it for use in places like the &lt;a href=&quot;http://stackexchange.com/sites&quot;&gt;SE site list&lt;/a&gt; that need them.  I've posted two somewhat different large versions below (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/836&quot;&gt;#1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/837&quot;&gt;#2&lt;/a&gt;); please let me know what you think of them.&lt;/p&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2014-01-08T01:56:16.207" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="796" PostTypeId="2" ParentId="2140" CreationDate="2014-01-02T10:14:22.810" Score="-3" Body="&lt;h2&gt;Code-challenge: Guess my number&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;The challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You have a number from 1 to 10 in mind, and your program should ask questions to find out which number. These questions can be any questions, the program only has to find out the number as fast as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program should ask a question, such as &quot;Is the number a prime?&quot;, and the user must answer either &lt;em&gt;y&lt;/em&gt; or &lt;em&gt;n&lt;/em&gt; (yes or no). Ask questions until you know the number.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;To calculate the score, you need to take the sum of the question count for each number. For example, if you need 1 question to find the number 1, 2 questions to find the number 2, and so on, the score is &lt;code&gt;1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 10&lt;/code&gt;, so the score is 55.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Important note:&lt;/strong&gt; the question count for a specific number must &lt;em&gt;always&lt;/em&gt; be the same. For example, if you need 4 questions to find out the number 10, then you have to ask &lt;em&gt;always&lt;/em&gt; 4 questions to find out the number 10, otherwise it is impossible to calculate the score.&lt;/p&gt;&#xA;" OwnerUserId="9275" LastActivityDate="2014-01-02T10:14:22.810" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="797" PostTypeId="1" AcceptedAnswerId="798" CreationDate="2014-01-02T14:12:50.217" Score="5" ViewCount="182" Body="&lt;p&gt;I currently have 101 reputation for this site (Due to the association bonus), however I am unable to post an answer on this protected question. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/17005/produce-the-number-2014-without-any-numbers-in-your-source-code?page=1&amp;amp;tab=votes#tab-top&quot;&gt;Produce the number 2014 without any numbers in your source code&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/eRziM.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have the ability to vote up (15 rep), comment (50 rep) however I am unable to provide an answer.&lt;/p&gt;&#xA;" OwnerUserId="8104" LastEditorUserId="66833" LastEditDate="2021-06-02T20:53:54.020" LastActivityDate="2021-06-02T20:53:54.020" Title="Protected question and Association bonus bug" Tags="|bug|status-bydesign|reputation|protected-questions|privileges|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="798" PostTypeId="2" ParentId="797" CreationDate="2014-01-02T14:52:51.793" Score="4" Body="&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-bydesign&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-bydesign&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-bydesign&lt;/a&gt;: &lt;a href=&quot;https://meta.stackexchange.com/questions/52764/what-is-a-protected-question&quot;&gt;What is a protected question?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The assoc bonus does not count for this purpose.&lt;/p&gt;&#xA;" OwnerUserId="7789" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-01-02T14:52:51.793" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="799" PostTypeId="2" ParentId="765" CreationDate="2014-01-02T15:51:34.523" Score="-2" Body="&lt;p&gt;The rule does &lt;strong&gt;not&lt;/strong&gt; says that it &lt;strong&gt;must&lt;/strong&gt; have a test case, it does says only that it is highly encouraged.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In case of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;, in fact there is a clear specification of what constitutes a correct submission: It is a submission that do &lt;em&gt;not&lt;/em&gt; do what the lazy OP asks, or do it in a really awful way. Since this specification is subjective, it is hard to write a test case. Yes, it is possible to be clear and subjective at the same time. So, it is still within this rule.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the Y2K question, the situation is similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hence, these questions can't be close for not following those rules, in fact they do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is true that all those questions are all subjective, so it would be hard to define any winning criteria other than &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;. In fact, if it is a popularity contest, we do not even need a test case. I don't see that by having a subjective winning criteria as a bad thing, in fact I see it as a good thing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I strong oppose to close those questions and I think that this would be harmful for this site. This site is all about programming for fun (no one would be squeezing bytes in a golfscript code or programming in befunge for anything else), so what we need to do is to keep the site fun. If you impose a one-size-fits-all rigid rule for everything, closing whatever does not fits there, the result will simply be the death of this site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am not saying that we do not need rules. I am saying that they should not be rigid. The rules serves for organizing the site in order that every user here could enjoy it in a fair way, its purpose is not to avoid anyone enjoying anything by making everything narrow and boring.&lt;/p&gt;&#xA;" OwnerUserId="3755" LastActivityDate="2014-01-02T15:51:34.523" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="800" PostTypeId="1" CreationDate="2014-01-02T18:25:00.860" Score="18" ViewCount="146" Body="&lt;p&gt;Currently, the footer below the questions and answers reads&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Not the answer you're looking for? Browse other questions tagged [...]&#xA;  or ask your own question.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In my opinion the text doesn't work for this site. Is it possible to either remove it or change it into something meaningful?&lt;/p&gt;&#xA;" OwnerUserId="1490" LastEditorUserId="101081" LastEditDate="2021-06-09T14:53:34.963" LastActivityDate="2021-06-09T14:53:34.963" Title="Footer &quot;Not the answer you're looking for?&quot; doesn't make much sense" Tags="|feature-request|status-declined|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="801" PostTypeId="2" ParentId="2140" CreationDate="2014-01-02T21:56:12.420" Score="-3" Body="&lt;h1&gt;Popularity Contest: Implementation of a Hash Table&lt;/h1&gt;&#xA;&lt;p&gt;Create a class in some OOP language for a hash table that supports getting, setting, and removing values. You can't use the built in hash table/dictionary/map implementation. Highest votes in one week wins.&lt;/p&gt;&#xA;&lt;p&gt;A key is any valid string. A value is any valid string, number, or boolean.&lt;/p&gt;&#xA;&lt;p&gt;Example functionality:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;hash.set(&amp;quot;key&amp;quot;,&amp;quot;value&amp;quot;);&#xA;hash.get(&amp;quot;key&amp;quot;); // returns &amp;quot;value&amp;quot;&#xA;hash.set(&amp;quot;key&amp;quot;, 1234);&#xA;hash.get(&amp;quot;key&amp;quot;); // returns 1234&#xA;hash.set(&amp;quot;key2&amp;quot;,hash.get(&amp;quot;key&amp;quot;));&#xA;hash.get(&amp;quot;key2&amp;quot;); // returns 1234&#xA;hash.delete(&amp;quot;key&amp;quot;);&#xA;hash.get(&amp;quot;key&amp;quot;); // returns null/undefined/none/etc. or throws an error&#xA;hash.get(&amp;quot;key2&amp;quot;); // still returns 1234&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Definition of a hash table (from Wikipedia):&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;In computing, a hash table (also hash map) is a data structure used to implement an associative array, a structure that can map keys to values. A hash table uses a hash function to compute an index into an array of buckets or slots, from which the correct value can be found.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The hash table cannot be simply an array that is searched in linear time. It must be an actual hash table that uses a hash function to map the keys to the value.&lt;/p&gt;&#xA;" OwnerUserId="12508" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-01-03T00:09:40.667" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="802" PostTypeId="2" ParentId="765" CreationDate="2014-01-03T07:56:45.887" Score="3" Body="&lt;p&gt;I almost agree. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; should have specific specs and should include test cases if relevant. However, some tags should not be so specific. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;s (a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; is a form of popularity contest) should have a general specs. However, this does not mean they should have no specs. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;A few examples of what I'd call good specs:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/17096/helping-the-farmer&quot;&gt;this question&lt;/a&gt; gives a test case and specific specs, making it clear what constitutes a good answer.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/17005/produce-the-number-2014-without-any-numbers-in-your-source-code&quot;&gt;this question&lt;/a&gt; does not give a test case because test cases are irrelevant but has specific specs.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/15860/make-a-scalable-christmas-tree&quot;&gt;this question&lt;/a&gt; has general specs. However, it is not something like &quot;output HelloWorld&quot;. It forces answerers to think.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/7261/write-a-polyglot-that-prints-the-languages-name&quot;&gt;this question&lt;/a&gt; gives a specific scoring method and specific specs.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I personally feel that this site is for &lt;strong&gt;puzzles&lt;/strong&gt; or &lt;strong&gt;challenges&lt;/strong&gt; (just look at the site name!). Popularity Contests and Code Trolling questions are fun every now and then, but they aren't usually &lt;strong&gt;puzzles&lt;/strong&gt;. I feel a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; is a good question if and only if it can be changed into a good &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;. It is fine to (every now and then) have a fun question, but the focus of this site is on &lt;strong&gt;puzzles&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, I thought &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; was for questions with scoring criteria such as &lt;code&gt;number of characters / number of languages&lt;/code&gt;. It seems like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; is being misused. People are tagging questions as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; because they seem like challenging problems, not because the scoring method is different. Something should be done about this.&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-01-03T08:02:59.373" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="803" PostTypeId="1" CreationDate="2014-01-03T17:51:10.133" Score="13" ViewCount="693" Body="&lt;p&gt;When it comes to JavaScript &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, there tends to be two schools of thought regarding IO (specifically printing).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some golfers will use functions such as &lt;code&gt;alert&lt;/code&gt;, &lt;code&gt;document.write&lt;/code&gt;, and &lt;code&gt;console.log&lt;/code&gt; (explicit printing), whereas other golfers will rely on the console implicitly logging the return value of statements executed in it (implicit printing).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it's worth discussing what the standard should be so that developers who make use of explicit printing are not at a disadvantage against developers using implicit printing. Of course, anyone posting a code golf could always explicitly override the standard.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Personally I believe that JavaScript code golf should work irrespective of where it's executed* (&lt;code&gt;&amp;lt;script&amp;gt;&lt;/code&gt; element, browser console, node, etc), which means that explicit printing would be required.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;* some golfs will require exceptions to this due to the nature of the different environments&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="750" LastActivityDate="2014-01-04T21:26:16.517" Title="JavaScript Standards for IO" Tags="|discussion|code-golf|rules|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="804" PostTypeId="2" ParentId="803" CreationDate="2014-01-03T18:44:30.823" Score="7" Body="&lt;p&gt;Here is my proposal for a standard:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Use &lt;code&gt;alert&lt;/code&gt; if the code runs in web browser (for example if it modifies DOM), or just uses core JavaScript (as it's easy to claim it's a browser code in this case). It should be used just once, as message boxes are annoying when shown multiple times (this means you should prepare a buffer for &lt;code&gt;alert&lt;/code&gt;).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can almost always use &lt;code&gt;console.log&lt;/code&gt;. You need to if you work with non-browser environments, such as Node.js. For example, if code uses &lt;code&gt;require&lt;/code&gt; in order to load stuff like Underscore.js, it has to use &lt;code&gt;console.log&lt;/code&gt;. It's longer than &lt;code&gt;alert&lt;/code&gt; however, so it probably won't be used outside of Node.js context.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Use &lt;code&gt;print&lt;/code&gt; if you write code for SpiderMonkey, without web browser. I don't know why you would want to, but you can. Just tell that code requires SpiderMonkey, because web browsers use &lt;code&gt;print&lt;/code&gt; for something else (printing on printer, that is).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Use &lt;code&gt;document.write&lt;/code&gt; if you need to output HTML, or want to output in multiple statements, or something. Otherwise, &lt;code&gt;alert&lt;/code&gt; is shorter.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Write a function when task asks you to, and return the value.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Never use implicit print statement. That's cheating in my opinion, and won't work outside of dev console. If you really want to, make Node.js code, and say it runs with &lt;code&gt;-p&lt;/code&gt;. It also would waste 1 character (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/273/on-interactive-answers-and-other-special-conditions&quot;&gt;On &amp;quot;interactive&amp;quot; answers and other special conditions&lt;/a&gt;).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3103" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2014-01-04T19:01:16.107" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="805" PostTypeId="1" CreationDate="2014-01-03T20:50:47.200" Score="3" ViewCount="78" Body="&lt;p&gt;On &lt;a href=&quot;https://codegolf.stackexchange.com/editing-help#syntax-highlighting&quot;&gt;https://codegolf.stackexchange.com/editing-help#syntax-highlighting&lt;/a&gt;, you can notice examples for using syntax highlighting tags. Let me try them, as the documentation mentions them.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;public static bool IsAwesome { get { return true; } }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Nope, they don't work (you can check the source code of this post to confirm that), even if the editing help mentions them. It would be nice if either editing help would have this part removed, or if syntax highlighting tags would actually work.&lt;/p&gt;&#xA;" OwnerUserId="3103" LastEditorUserId="76162" LastEditDate="2021-06-04T10:04:22.357" LastActivityDate="2021-06-04T10:04:22.357" Title="Markdown editing help mentions syntax highlighting that doesn't exist" Tags="|bug|status-completed|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="806" PostTypeId="2" ParentId="803" CreationDate="2014-01-03T23:28:10.560" Score="-3" Body="&lt;p&gt;I have no idea how that's done in JavaScript, but for multi-language challenges, I don't think it should get any preferential treatment. The common case is “write to stdout”, and it should stick to that unless specifically allowed by the problem.&lt;/p&gt;&#xA;" OwnerUserId="199" LastActivityDate="2014-01-03T23:28:10.560" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="807" PostTypeId="2" ParentId="805" CreationDate="2014-01-03T23:54:02.340" Score="1" Body="&lt;p&gt;The documentation seems to have been written for StackOverflow: it talks about inferring language from a tag, but I doubt that that has been configured for CodeGolf. However, I'm mildly surprised that &lt;code&gt;lang-cs&lt;/code&gt; doesn't work:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-cs prettyprint-override&quot;&gt;&lt;code&gt;public static bool IsAwesome { get { return true; } }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;At least some code highlighting does work, because you can &lt;a href=&quot;https://codegolf.stackexchange.com/a/6838/194&quot;&gt;see it in action&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-01-04T00:01:11.087" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="808" PostTypeId="2" ParentId="746" CreationDate="2014-01-04T12:05:35.550" Score="3" Body="&lt;p&gt;I'd suggest to &lt;strong&gt;avoid &quot;trolling with complexity&quot;&lt;/strong&gt;: you can add random layers of complexity to any kind of program, you can add as many as you want, and it is farily easy and totally uninteresting to do so.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For me, the real spirit of code trolling, is to be able to write a simple, elegant program, which does what the OP asked, but is still useless.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Look at the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/16415/how-do-i-write-an-adding-function&quot;&gt;adding function&lt;/a&gt; question, for instance. Most of the answers are &lt;strong&gt;entangled blurbs of stuff&lt;/strong&gt;, anyone will notice at first sight he's being trolled and they make no sense.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, two answers shine brightly among all this dirt: the &lt;a href=&quot;https://codegolf.stackexchange.com/a/16452/4269&quot;&gt;sleepadd&lt;/a&gt;, and the &lt;a href=&quot;https://codegolf.stackexchange.com/a/16482/4269&quot;&gt;recursive&lt;/a&gt;: they are both useless to the OP, but they are simple and elegant, so that at first sight you might think they make sense, they might be the correct answer. &lt;strong&gt;If you read them, you understand them.&lt;/strong&gt; That's the point. You read, you understand, but it's still useless. It works, &lt;strong&gt;you know why it works&lt;/strong&gt;, but it's still wrong.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As opposite to &lt;em&gt;&quot;you try read them, you have no clue what's happening&quot;&lt;/em&gt;. I hope the difference is quite clear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To me, adding complexity, is exactly like just using languages like brainfuck or golfscript, really no difference at all: you still do not understand, it still works. Same thing. Boring.&lt;/p&gt;&#xA;" OwnerUserId="4269" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-01-04T13:31:03.613" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="809" PostTypeId="1" AcceptedAnswerId="1408" CreationDate="2014-01-04T18:35:22.633" Score="23" ViewCount="305" Body="&lt;p&gt;It is very difficult to read inline code when it is located inside of &lt;a href=&quot;https://meta.stackexchange.com/a/72878/205964&quot;&gt;a spoiler block&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Readable (standard quote):&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;ActionScript already contains a &lt;code&gt;Math.pow()&lt;/code&gt; function.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Not readable (spoiler quote):&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;  &lt;p&gt; ActionScript already contains a &lt;code&gt;Math.pow()&lt;/code&gt; function.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="11322" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-04-23T09:29:32.537" Title="Inline code inside a spoiler block is difficult to read" Tags="|bug|status-completed|user-interface|" AnswerCount="2" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="810" PostTypeId="2" ParentId="94" CreationDate="2014-01-04T20:12:00.947" Score="1" Body="&lt;p&gt;If you start with a header stating the language and number of characters used, it should help fill up enough reach the minimum character level.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;JavaScript (21 characters)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;alert(&quot;Hello world!&quot;)&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="11322" LastEditorUserId="11322" LastEditDate="2014-01-05T22:18:31.893" LastActivityDate="2014-01-05T22:18:31.893" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="811" PostTypeId="2" ParentId="803" CreationDate="2014-01-04T21:26:16.517" Score="0" Body="&lt;p&gt;I propose we adopt a standard I/O library with published specifications. This allows platforms with different I/O models to use variations of this standard library to just work. I have seen this approach used in textbooks with good results.&lt;/p&gt;&#xA;" OwnerUserId="10731" LastActivityDate="2014-01-04T21:26:16.517" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="812" PostTypeId="1" CreationDate="2014-01-05T09:28:47.117" Score="-5" ViewCount="611" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; tag has brought nothing but poorly conceived &quot;challenges&quot; to this site and the new users it has brought are posting poor knock-offs of an already poor idea. The quality of questions has fallen dramatically and the good questions that pop-up amidst the morass of rubbish get buried very quickly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I propose that &lt;strong&gt;&lt;em&gt;all&lt;/em&gt;&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; questions be closed and deleted to stop the rot.&lt;/p&gt;&#xA;" OwnerUserId="737" LastActivityDate="2014-01-06T03:34:51.680" Title="Delete all code-trolling questions" Tags="|discussion|" AnswerCount="6" CommentCount="0" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="813" PostTypeId="2" ParentId="812" CreationDate="2014-01-05T11:05:51.703" Score="4" Body="&lt;p&gt;I'm sure you know you can click &lt;code&gt;add an ignored tag&lt;/code&gt; to get rid of them from your own view of the site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I actually wouldn't mind if, like hats and April fools day pranks, they were voted off the site and/or disappeared after a certain date.&lt;/p&gt;&#xA;" OwnerUserId="1028" LastActivityDate="2014-01-05T11:05:51.703" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="814" PostTypeId="2" ParentId="812" CreationDate="2014-01-05T13:51:04.897" Score="20" Body="&lt;p&gt;Well, lets get some facts. Feel free to downvote me.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First, you say that &quot;&lt;em&gt;the good questions that pop-up amidst the morass of rubbish get buried very quickly&lt;/em&gt;&quot;. In the first 3 pages of the newest questions, I see only 2 code-trolling questions, one is near the bottom of first page and one in the third page. Don't think that 2 questions far from the top buries the &quot;good questions&quot; very quickly. As usual, most questions are code-golf. From those code-golf questions, some are good code-golfs and some aren't, i.e. exactly in the way it always has been before. So your statement is not true. You might argue that this happens because we are getting more people posting here and good questions are buried, but this too means that new good questions are popping and that this site is showing some signals that we are finally getting out of beta, and I think that this is good. A proof of that is this question: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/17005/produce-the-number-2014-without-any-numbers-in-your-source-code&quot;&gt;Produce the number 2014 without any numbers in your source code&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We recently had three questions that were explosively upvoted and answered:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/15860/make-a-scalable-christmas-tree&quot;&gt;Make a scalable Christmas Tree&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/16226/i-need-a-program-where-the-user-inputs-an-array-of-doubles-and-the-program-outpu&quot;&gt;I need a program where the user inputs an array of doubles and the program outputs the array sorted&lt;/a&gt; (my question)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/17005/produce-the-number-2014-without-any-numbers-in-your-source-code&quot;&gt;Produce the number 2014 without any numbers in your source code&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Three of the most voted questions in only a month, including the first and the second place. Surely my question was the most explosive ever in the site, but the third one (a very good code-golf) is the second one, currently is the hottest question in StackExchange and was posted only 4 days ago. Do you not think that this question would not attract a lot of inexperienced users too?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And, you are looking only to the questions, not to the answers. Truely, some answers are poor, exactly how it always has been before the day that I invented code-trolling, but some answers are very good ones. Personally, &lt;strong&gt;I learnt a lot in this site coding something that does something interesting and looking for creative and original answers that features creative and original ways to do something than looking byte-crushed illegible golfscript answers that serves for no purpose and that teaches me nothing.&lt;/strong&gt; And this is the main reason why I think that code-trolling is valuable, &lt;strong&gt;I could learn for fun and laugh, and a lot of people too, and I think that learning while getting fun is the real purpose of this site&lt;/strong&gt;. Even some very poorly conceived code-trolling questions got some really creative and original answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But now, we have a lot new users, thanks mostly to those three questions. Surely, there are some bad new users, but there are good new users too, and if you gets new users in any StackExchange site some are good and some aren't no matter what. Bad users will not get much upvotes, and will either go away quickly or will learn the way to become good users, and most good users stay. Sometime before I posted my question we had around 4 questions per day in area 51 and were declining. Now we reached 7, which I think is excellent. You could argue that new users should come more slowly (and if you does, I will strongly disagree), but this is no reason to delete code-trolling questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In fact, you are using code-trolling as a scapegoat and not addressing the real &quot;problem&quot;: We simply have more users, a lot more users. Deleting code-trolling questions will not solve your &quot;problem&quot;. In fact I don't see this as a problem after all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And about the the &quot;dramatically fall in the quality of the questions&quot;, again, only 2 questions in the first 3 pages are code-trolling, so code-trolling is not the problem here. In fact, I think that this is a misperception caused by the wave of new users. What I see is that some new users post some poorly conceived questions frequently missing a clear winning criteria, and code-trolling has nothing to do with this. Deleting code-trolling questions will not change this either. Surely, some people post low quality questions (as they always did, whatever the tag is), but this is the reason that we have the downvote button.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We have only 16 code-trolling non-deleted questions now, only 8 with more than 1000 views. All of them pretty quiet now. Don't think that deleting them will magically improve the quality of whatever is the overall quality of this site.&lt;/p&gt;&#xA;" OwnerUserId="3755" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-01-05T13:57:02.723" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="815" PostTypeId="2" ParentId="812" CreationDate="2014-01-05T16:12:00.737" Score="7" Body="&lt;p&gt;A bit harsh to say that the idea itself is poor.  While many of those who initially tried to join in on the fun didn't bring anything new to the table, I think that a good &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; question can be just as valid of a programming and engineering challenge as plenty of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; problems on this site.  It's just the initial influx of people when the idea isn't entirely developed yet, but I think that there can be value to keeping the good ones.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'll reference the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/16226/i-need-a-program-where-the-user-inputs-an-array-of-doubles-and-the-program-outpu&quot;&gt;first code-trolling question&lt;/a&gt; as an example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&quot;I need a program where the user inputs an array of doubles and the program outputs the array sorted&quot;.&lt;/strong&gt;  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Writing code that does this correctly and efficiently isn't particularly interesting, and some probably find it trivial if taken literally. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;But in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the challenge is getting &lt;em&gt;100% of the test cases&lt;/em&gt; in as few characters as possible. The best answers often use features of a language that others weren't aware of, or tricks such as bit manipulation to squeeze a few bytes out.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Based on the description of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;, the challenge is writing code that &lt;em&gt;looks&lt;/em&gt; entirely correct, but &lt;em&gt;fails&lt;/em&gt; upon close analysis.  This sounds to me like something that could easily expand as a problem type on this site.  &lt;em&gt;However, it appears that the most upvoted answers are satirical in nature and not based on flawed code that looks correct&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To me, both &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; problems are equally valid types of challenges for this site.  I don't believe that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; should be removed entirely.  Instead we should continue to weed out the bad examples, including future answers that do not follow the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; guidelines.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it's because the name &quot;code-trolling&quot; doesn't sound serious enough, then we could propose to rename it to something along the lines of &quot;code-flaw-injecting&quot;.&lt;/p&gt;&#xA;" OwnerUserId="11222" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-01-06T03:34:51.680" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="816" PostTypeId="2" ParentId="812" CreationDate="2014-01-05T21:28:56.927" Score="8" Body="&lt;p&gt;I'd be more than happy to kill them with fire, but sometime early in 2013, I stopped trying to enforce some of our content rules as it had become apparent that something new was needed or the site would never get off the ground. (That, and I've gotten tired...I never intended to remain a moderator here after the beta.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm neither happy nor particularly surprised to see that allowing popularity contests and other subjective criteria contests generated only a passing increase in interest. I think that the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; phenomena is more of the same, but on a more compressed time scale.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I do think that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; might as well be custom made to generate a maximum of me-too-ism in terms of &lt;em&gt;both&lt;/em&gt; questions and answers. As I have said elsewhere &quot;Let's turn a bad Stack Overflow question into a contest&quot; struck me as a bad idea from the start.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the nonce I am still looking for new idea that might revitalize this place and am still going to under-enforce our nominal rules so that people can give try new ideas a try.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2014-01-05T21:28:56.927" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="817" PostTypeId="2" ParentId="812" CreationDate="2014-01-05T23:11:18.847" Score="3" Body="&lt;p&gt;The first one was fun.  That question got more views, upvotes and answers than any other on the site.  There's been a huge new influx of users... most of them bad, but a number look promising.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The subsequent questions on the topic have largely been lame copycats.  The answers have as low of quality as the questions.  When the site suggested I review 10+ lame answers, I thought &quot;kill it fire&quot; too... but the initial rush seems to have died down.  Let's wait a week or two.&lt;/p&gt;&#xA;" OwnerUserId="2180" LastActivityDate="2014-01-05T23:11:18.847" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="818" PostTypeId="2" ParentId="812" CreationDate="2014-01-06T02:19:19.563" Score="1" Body="&lt;p&gt;If asking or answering these programming challenges (and they &lt;em&gt;are&lt;/em&gt; programming challenges) is how some people enjoy spending their recreational programming time, who am I to judge?  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am somewhat concerned about &quot;innocent&quot; (?) people getting duped or sucked into these because of SEO and then taking them seriously. That is unfortunate and leads to more noise. So I might prefer to see the site automatically format &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; questions &lt;em&gt;and&lt;/em&gt; all answers with strong header/footer/notices.&lt;/p&gt;&#xA;" OwnerUserId="9496" LastActivityDate="2014-01-06T02:19:19.563" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="819" PostTypeId="2" ParentId="94" CreationDate="2014-01-06T02:23:52.227" Score="2" Body="&lt;p&gt;I've been fortunate enough to be under the limit a few times and what it encouraged me to do was actually follow the guidelines for what constitutes a good &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; answer, including:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Try to explain your solution.&lt;/li&gt;&#xA;&lt;li&gt;You should show how the program or function is executed, accepting the input, and printing the output.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Source: &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;https://codegolf.stackexchange.com/tags/code-golf/info&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="9496" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-01-06T02:23:52.227" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="820" PostTypeId="1" CreationDate="2014-01-06T13:30:16.993" Score="0" ViewCount="25" Body="&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/CuCSg.png&quot; alt=&quot;In the header, the &amp;quot;1&amp;quot; number appears. The browser is opened on Review | Suggested Edits page which shows that &amp;quot;There are no items for you to review&amp;quot;.&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As you can see on screenshot above, top bar informs me about one tag wiki edit suggestion, but because I don't have enough points, I cannot review it. After clicking the link, I get to the page showing that there are no items for me to review. If there are no items for me to review, why bother me with the information on top bar?&lt;/p&gt;&#xA;" OwnerUserId="3103" LastEditorUserId="76162" LastEditDate="2021-06-04T10:02:48.253" LastActivityDate="2021-06-04T10:02:48.253" Title="Top bar sees tag wiki edit suggestion, but I cannot actually review it" Tags="|bug|status-completed|reviewing|" AnswerCount="0" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="821" PostTypeId="2" ParentId="773" CreationDate="2014-01-06T17:39:07.443" Score="2" Body="&lt;p&gt;I'm thinking of &quot;outside&quot; users. I would be in favour of the idea of both question &lt;strong&gt;and answers&lt;/strong&gt; being auto-framed or headered/footered with some sort of disclaimer.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answers to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; questions are, by definition, &quot;useless and frustrating&quot; so if SEO takes brings an outside user to a page here with this sort of content, I think a bold/newbie disclaimer prevents innocent victims from taking things seriously and adding their own frustrated noise in comments.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unless the goal is &lt;em&gt;true&lt;/em&gt; trolling.  If so, carry on. :)&lt;/p&gt;&#xA;" OwnerUserId="9496" LastEditorUserId="9496" LastEditDate="2014-01-06T17:47:19.337" LastActivityDate="2014-01-06T17:47:19.337" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="822" PostTypeId="2" ParentId="788" CreationDate="2014-01-06T18:58:24.020" Score="-3" Body="&lt;p&gt;I personally think the font could use some tweaking, like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/6uS7q.png&quot; alt=&quot;slightly different PCG font&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/QdsEr.png&quot; alt=&quot;slightly different PCG font x8&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;or this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/NsjU7.png&quot; alt=&quot;slightly different PCG font #2&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/19d2k.png&quot; alt=&quot;slightly different PCG font #2 x8&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Mostly I feel like the top-right corner of the G looks like it's jutting out top-heavily in the current logo.&lt;/p&gt;&#xA;" OwnerUserId="7110" LastEditorUserId="7110" LastEditDate="2014-01-07T17:58:26.247" LastActivityDate="2014-01-07T17:58:26.247" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="823" PostTypeId="1" CreationDate="2014-01-07T00:10:47.513" Score="1" ViewCount="34" Body="&lt;p&gt;I recently noticed the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-generation&quot;&gt;code-generation&lt;/a&gt; tag, which is a redundant with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot;&gt;metagolf&lt;/a&gt;.  I'd suggest that code-generation is a synonym of metagolf, but don't have the rep to do so.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since there's only one question tagged code-generation, I'm tempted to just retag it.  Is that the appropriate action?  It seems strange to me that if somebody makes up a tag, others must get reputation in it to point out that it's redundant.&lt;/p&gt;&#xA;" OwnerUserId="2180" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-01-07T06:42:16.330" Title="Tag Synonyms For New Redundant Tags" Tags="|discussion|tags|tag-synonyms|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="824" PostTypeId="1" AcceptedAnswerId="830" CreationDate="2014-01-07T01:13:14.987" Score="8" ViewCount="697" Body="&lt;p&gt;Now I know that duplicate questions are bad, but because this is a programming puzzles site, should there be a time range after which puzzles can be asked again?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Reason one is that new users who missed out on old questions may enjoy solving them, and old users might enjoy attempting to improve their old answer or writing a new one in a different language, as long as there is a long enough time range between the questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Reason two is that after a while, we will run out of puzzles to ask, and then the site will die.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the minimum, there should be 2 to 3 years since the last activity on the old question to allow a duplicate question, but what do you users think about allowing duplicate questions after a certain time limit has passed?&lt;/p&gt;&#xA;" OwnerDisplayName="user10766" LastEditorUserId="39328" LastEditDate="2015-12-05T00:17:28.907" LastActivityDate="2015-12-05T00:17:28.907" Title="Duplicate questions" Tags="|discussion|duplicates|" AnswerCount="4" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="825" PostTypeId="1" AcceptedAnswerId="849" CreationDate="2014-01-07T02:03:27.177" Score="14" ViewCount="460" Body="&lt;p&gt;Lately, I've seen a bunch of poor answers flagged as &quot;not an answer&quot; (NAA) in the &lt;a href=&quot;https://codegolf.stackexchange.com/tools/flagged&quot;&gt;flag review list&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Such flags seem to be controversial, even among reviewers.  For example, at the moment:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/17456/check-whether-an-integer-is-a-power-of-2-without-using-operations/17531#17531&quot;&gt;this answer&lt;/a&gt; has two &quot;very low quality&quot; flags, one &quot;not an answer&quot; flag, one automatic &quot;low answer quality score&quot; flag and three dispute flags, while&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/17456/check-whether-an-integer-is-a-power-of-2-without-using-operations/17477#17477&quot;&gt;this answer&lt;/a&gt; has one &quot;very low quality&quot; flag, one &quot;not an answer&quot; flag, one automatic &quot;low answer quality score&quot; flag and five dispute (&quot;invalid flags&quot;) flags.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Thus, I'd like to request the community's opinion on this, and hopefully establish some kind of clear guideline on the appropriate use of these flags.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I assume that we all agree that &quot;answers&quot; that don't even try or claim to solve the challenge in any way, such as comments, new challenges or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/17662/random-password-generator/17810#17810&quot;&gt;xkcd comics&lt;/a&gt; posted as answers, qualify for the NAA flag.  However, the answers I mentioned earlier are somewhat less obvious cases &amp;mdash; they seem to have been &lt;em&gt;intended&lt;/em&gt; as solutions to the challenge, even if they miss that target pretty badly&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Is flagging as &quot;not an answer&quot; appropriate for answers that:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;solve the wrong challenge&lt;/strong&gt;, as in the first example above (where the task is to check whether a number is a power of two, while the flagged answer checks whether it is even), or&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;fail to meet the criteria for the &lt;em&gt;type&lt;/em&gt; of challenge&lt;/strong&gt;, as in the second example above, which is a non-golfed solution to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Just to be clear, I'm not talking about answers that merely solve the challenge poorly or fail to work in some edge cases, as long as they seem at least potentially salvageable.  What I'm talking about are answers where no amount of editing or bugfixing (short of throwing the answer away and starting from scratch) could possibly turn them into valid solutions to the challenge.  Should such &quot;answers&quot; be flagged as &quot;not an answer&quot;, or should we just downvote them?&lt;/p&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-03-17T18:26:14.873" Title="What should count as &quot;not an answer&quot; here?" Tags="|discussion|policy|flags|" AnswerCount="1" CommentCount="3" ClosedDate="2016-01-18T20:33:26.363" ContentLicense="CC BY-SA 3.0" />
  <row Id="826" PostTypeId="2" ParentId="823" CreationDate="2014-01-07T03:29:24.513" Score="0" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;I recently noticed the code-generation tag, which is a redundant with metagolf.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'd say that this statement constitutes a claim that there no possible way to write a code generation challenge where the goal something other than golfing the generated code, does it not?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Give me a couple of days. I'll think about it.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="78" LastEditDate="2014-01-07T04:22:25.530" LastActivityDate="2014-01-07T04:22:25.530" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="827" PostTypeId="2" ParentId="773" CreationDate="2014-01-07T03:41:04.013" Score="4" Body="&lt;p&gt;I think the issue is that questions are written- and askers are thinking- in the wrong way when it comes to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; problems.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Instead of &quot;how do i x?  - insert disclaimer&quot;, how about something like &quot;Write a piece of code that appears to do &lt;em&gt;x&lt;/em&gt;, but actually &lt;em&gt;y&lt;/em&gt; instead&quot;?  This both makes it clear what the goal of the question is, and reinforces the fact that answers like &lt;code&gt;print 'x'&lt;/code&gt; aren't acceptable.&lt;/p&gt;&#xA;" OwnerUserId="11222" LastActivityDate="2014-01-07T03:41:04.013" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="828" PostTypeId="2" ParentId="710" CreationDate="2014-01-07T05:24:10.313" Score="1" Body="&lt;p&gt;After hunting, I finally found a tag I'm eligible to vote on: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; really ought be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/shortest-time&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;shortest-time&amp;#39;&quot; rel=&quot;tag&quot;&gt;shortest-time&lt;/a&gt;.  I had no idea that it was up for synonymy until I clicked on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/shortest-time&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;shortest-time&amp;#39;&quot; rel=&quot;tag&quot;&gt;shortest-time&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thus, unless a user independently sees two synonymous tags and decides to register their synonymy, they'd never know another user thought the same.  Perhaps this warrants a &lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt; to either add tag synonyms to the review system, or to rubbish the reputation barrier until we have enough high-reputation users for it to work efficiently.&lt;/p&gt;&#xA;" OwnerUserId="2180" LastEditorUserId="3191" LastEditDate="2014-01-07T06:41:19.827" LastActivityDate="2014-01-07T06:41:19.827" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="829" PostTypeId="2" ParentId="823" CreationDate="2014-01-07T06:40:31.900" Score="1" Body="&lt;p&gt;Since there's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/17417/generate-a-self-extractor-application&quot;&gt;only one question&lt;/a&gt; using the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-generation&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-generation&lt;/a&gt; tag, and since it clearly falls under &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt;, you should just retag it.  There's not much point in creating a tag synonym for a single-question tag, at least unless you anticipate the tag getting more use in the future.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, dmckee does make a good point that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-generation&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-generation&lt;/a&gt; could potentially apply to non-golf challenges too.  I don't think we need both, but I &lt;em&gt;could&lt;/em&gt; support renaming &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-generation&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-generation&lt;/a&gt; instead to make it more generic.  (That could also be done manually &amp;mdash; it's only four questions plus the tag wiki.)&lt;/p&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-01-07T06:40:31.900" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="830" PostTypeId="2" ParentId="824" CreationDate="2014-01-07T07:33:51.917" Score="11" Body="&lt;p&gt;A straight duplicate seems unnecessary, but a &lt;em&gt;near&lt;/em&gt;-duplicate wouldn't necessarily be terrible. Do an old one with a new twist, or a more complicated scoring-system. Or more expanded, or more limited. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;A priori&lt;/em&gt;, I think such a thing is possible to make work.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2014-01-07T07:33:51.917" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="831" PostTypeId="2" ParentId="800" CreationDate="2014-01-07T07:38:06.013" Score="1" Body="&lt;p&gt;Here's a stab at &quot;something [more] meaningful&quot;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Not ready to write a program for this challenge? Browse other challenges tagged [...] or pose your own challenge.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2014-01-07T07:38:06.013" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="833" PostTypeId="2" ParentId="800" CreationDate="2014-01-07T09:09:38.153" Score="6" Body="&lt;p&gt;I'm not sure that footer really adds any value to the site anyway, but if we need to have something there, let's try to keep it positive and encouraging:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Want to see more puzzles like this? Browse other challenges tagged [...] or pose your own challenge.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;(A bigger issue is that the text on the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/ask&quot;&gt;ask a question&lt;/a&gt; page linked from the footer is completely unsuitable for us, and really should be rewritten too.)&lt;/p&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-01-07T09:09:38.153" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="834" PostTypeId="2" ParentId="788" CreationDate="2014-01-07T11:10:19.133" Score="3" Body="&lt;p&gt;My tries:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;img src=&quot;https://i.stack.imgur.com/C68oN.png&quot; alt=&quot;clean PCG&quot;&gt; &lt;img src=&quot;https://i.stack.imgur.com/QN5p3.png&quot; alt=&quot;clean PCG big&quot;&gt; – original “P”, cleaner “C”, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/822&quot;&gt;Joe Z.'s&lt;/a&gt; “G”&lt;/li&gt;&#xA;&lt;li&gt;&lt;img src=&quot;https://i.stack.imgur.com/bi1vO.png&quot; alt=&quot;PPCG&quot;&gt; &lt;img src=&quot;https://i.stack.imgur.com/wrxaM.png&quot; alt=&quot;PPCG big&quot;&gt; – there is enough space for the complete abbreviation: “PPCG”&lt;/li&gt;&#xA;&lt;li&gt;&lt;img src=&quot;https://i.stack.imgur.com/i4TxM.png&quot; alt=&quot;large PCG&quot;&gt; &lt;img src=&quot;https://i.stack.imgur.com/ZJbqi.png&quot; alt=&quot;large PCG big&quot;&gt; – or just use larger characters&lt;/li&gt;&#xA;&lt;li&gt;&lt;img src=&quot;https://i.stack.imgur.com/U2n5H.png&quot; alt=&quot;PCG shadow&quot;&gt; &lt;img src=&quot;https://i.stack.imgur.com/rdq6B.png&quot; alt=&quot;PCG shadow big&quot;&gt; – maybe with shadow, black as the new top bar&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="4198" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2014-01-07T18:16:25.590" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="835" PostTypeId="2" ParentId="2140" CreationDate="2014-01-07T23:30:03.493" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;generation&amp;#39;&quot; rel=&quot;tag&quot;&gt;generation&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Wordlist detector&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You are to write a program which, given a list of words, constructs a regular expression to match all these words but nothing else. Both your program and the constructed regular expressions are to be as short as possible.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input and Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input comes on standard input and consists of one line giving &lt;em&gt;n&lt;/em&gt;, the total number of words, followed by &lt;em&gt;n&lt;/em&gt; lines with one word each. The number of words will be less than 1000, the length of each word less than 30. Words will consist only of lower case ASCII letters, i.e. &lt;code&gt;a-z&lt;/code&gt;. You may choose to ignore the first line and use EOF instead to end the list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output shall be written to standard output. It consists of a single line, giving a POSIX extended regular expression to match these words and no others. Since input for this regex is &lt;em&gt;not&lt;/em&gt; restricted to letters only, elements like &lt;code&gt;.&lt;/code&gt; or &lt;code&gt;[^…]&lt;/code&gt; won't make too much sense, which limits the language in a natural way. You may choose whether you want to terminate the line with a newline or not. Programs &lt;em&gt;may&lt;/em&gt; choose to print multiple lines of output, in which case only the last one will be used for scoring. So you might print intermediate results and continue searching for improvements.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each submission may be accompanied by &lt;em&gt;one&lt;/em&gt; regular expression. When scoring the submissions, I'll use this regular expression to reconstruct a word list from it. The code to do this reconstruction can be found at the end of this post. The reconstructed word list must fit the input specification above in terms of word count and length. It would be nice if your own program would be able to regenerate that regular expression from the word list, but that is not a strict requirement. But please don't paste bogus programs just to submit a challenging regular expression, though.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;These test cases will be collected and fed to all programs for scoring.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The final score of each program will be the program size plus the size of all its generated regular expressions for the inputs collected from submitted answers, including the example from this question. So short code which produces too long results might get beaten by longer code which generates shorter expressions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Does this still qualify as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;?&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Submissions which generate an incorrect regular expression for one of the test cases will be disqualified, as will those which don't terminate in the allotted time. You can use the input reconstruction program below to check whether a produced regular expression does encode the correct word list.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Requirements&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;All submissions are welcome, but in order to include your submission in the tournament, it must be executable with reasonable effort on my Linux machine. It shouldn't depend on any exotic libraries, or any specialized ones which take too much work away from your own program. It must operate in reasonable time, say no more than five minutes per input. Your output must be reproducible, so if you use randomization at some point, please seed the randomizer, and please don't terminate an improove loop by a timer measuring execution time or some such.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Tournament times&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'll run the first major tournament two weeks after posting this question. I'll include a table of the results in this question. I'll try to run tournaments repeatedly as late submissions arrive, but I'll not promise any regular schedule.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An very simple example application would be in Python 3 (53 chars):&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;print('|'.join(input() for i in range(int(input()))))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And here is a test case which could be posted along with the program, although this program obviously doesn't generate exactly this concise output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;bann?ana|ap(fel|ple)|s[ou]n|[hs](a|ou)nd&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The expansion of that expression could be turned into the following example input, which need not be posted as part of an answer since it can be deduced from the regular expression:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;10&#xA;banana&#xA;bannana&#xA;apfel&#xA;apple&#xA;son&#xA;sun&#xA;hand&#xA;hound&#xA;sand&#xA;sound&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Regex expander program&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;And here is a program to turn regular expressions into word lists, again written in Python 3.&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;#!/bin/env python3&#xA;concat = set(('',))&#xA;altin = set(('',))&#xA;altout = set()&#xA;prev = None&#xA;stack = []&#xA;regex = iter(input())&#xA;for ch in regex:&#xA;    if ch == '(':&#xA;        stack.append((concat, altin, altout))&#xA;        altin = concat&#xA;        altout = set()&#xA;        prev = None&#xA;    elif ch == ')':&#xA;        concat.update(altout)&#xA;        prev, altin, altout = stack.pop()&#xA;    elif ch == '|':&#xA;        altout.update(concat)&#xA;        concat = altin&#xA;    elif ch == '[':&#xA;        ch = regex.__next__()&#xA;        cls = []&#xA;        while ch != ']':&#xA;            if ch == '-':&#xA;                crange = range(ord(cls[-1]), ord(regex.__next__()) + 1)&#xA;                cls.extend(map(chr, crange))&#xA;            else:&#xA;                cls.append(ch)&#xA;            ch = regex.__next__()&#xA;        prev = concat&#xA;        concat = set(w + c for w in prev for c in cls)&#xA;    elif ch == '?':&#xA;        concat.update(prev)&#xA;        prev = None&#xA;    elif ch &amp;gt;= 'a' and ch &amp;lt;= 'z':&#xA;        prev = concat&#xA;        concat = set(w + ch for w in prev)&#xA;    else:&#xA;        raise Exception(&quot;Illegal input&quot;)&#xA;if stack:&#xA;    raise Exception(&quot;Unclosed group&quot;)&#xA;concat.update(altout)&#xA;words = sorted(concat)&#xA;print(len(words))&#xA;print('\n'.join(words))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is restricted to the part of regular expression syntax which I expect for this answer. If you have good reason to use something I did not consider, feel free to do so although I will likely have to update this code to cope with it. If you find a bug, please let me know.&lt;/p&gt;&#xA;" OwnerUserId="13683" LastActivityDate="2014-01-07T23:30:03.493" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="836" PostTypeId="2" ParentId="788" CreationDate="2014-01-08T01:40:03.480" Score="28" Body="&lt;p&gt;Since the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/793&quot;&gt;flag in hole icon&lt;/a&gt; has turned out to be so popular, I thought I should try to draw a larger version of it to replace the &lt;a href=&quot;http://cdn.sstatic.net/codegolf/img/apple-touch-icon.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;larger site icon&lt;/a&gt; used in various places like the &lt;a href=&quot;http://stackexchange.com/sites&quot;&gt;SE site list&lt;/a&gt;.  I ended up with two versions, so I figured I'd post both here and let you folks vote on them, just like with the smaller favicons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's the first one, loosely based on the reference glyph of the Unicode &lt;a href=&quot;http://www.fileformat.info/info/unicode/char/26f3/index.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Flag In Hole character&lt;/a&gt; which the pixel art version (shown on the right for reference) was also based on:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/cbaMZ.png&quot; alt=&quot;Large icon for codegolf.SE (144 x 144 px)&quot;&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/Via1Q.png&quot; alt=&quot;Medium icon for codegolf.SE (48 x 48 px)&quot;&gt; &amp;nbsp;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/OdXNF.png&quot; alt=&quot;Pixel art favicon, shown for reference&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This one doesn't have a ball next to the green, but it wouldn't be hard to add one, if people like it.  I also have an SVG vector version of this image, but I need to clean it up before posting it here, since I did it in Inkscape rather than by hand-coding.&lt;/p&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2014-01-08T01:51:26.457" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="837" PostTypeId="2" ParentId="788" CreationDate="2014-01-08T01:50:25.577" Score="9" Body="&lt;p&gt;Since the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/793&quot;&gt;flag in hole icon&lt;/a&gt; has turned out to be so popular, I thought I should try to draw a larger version of it to replace the &lt;a href=&quot;http://cdn.sstatic.net/codegolf/img/apple-touch-icon.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;larger site icon&lt;/a&gt; used in various places like the &lt;a href=&quot;http://stackexchange.com/sites&quot;&gt;SE site list&lt;/a&gt;.  I ended up with two versions, so I figured I'd post both here and let you folks vote on them, just like with the smaller favicons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's the second one, directly based on the pixel art version (shown on the right for comparison):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/mnnU3.png&quot; alt=&quot;Large icon for codegolf.SE (144 x 144 px)&quot;&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/F9Sgz.png&quot; alt=&quot;Medium icon for codegolf.SE (48 x 48 px)&quot;&gt; &amp;nbsp;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/83YOb.png&quot; alt=&quot;Pixel art favicon, shown for reference&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This one &lt;em&gt;does&lt;/em&gt; have a ball next to the green, but removing it would be trivial.  I like the rendering at full size, but I'm not perfectly happy with the way it scaled down to 48 &amp;times; 48 px (middle image); some hand-tweaking might improve the results.  Still, I feel the combination of pixel art and the flag symbol does work pretty well to symbolize &quot;code golf&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, for completeness, here's the original SVG code from which these were rendered.  Alas, it's a bit verbose, since SVG doesn't really do loops::&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;?xml version=&quot;1.0&quot;?&amp;gt;&#xA;&amp;lt;svg xmlns=&quot;http://www.w3.org/2000/svg&quot; width=&quot;144&quot; height=&quot;144&quot;&#xA;     xmlns:xlink=&quot;http://www.w3.org/1999/xlink&quot; &amp;gt;&#xA;  &amp;lt;!-- meta.SE speech bubble --&amp;gt;&#xA;  &amp;lt;g fill=&quot;#62b0df&quot; stroke=&quot;none&quot;&amp;gt;&#xA;    &amp;lt;path d=&quot;m 80,110 0,25 25,-25 z&quot; /&amp;gt;&#xA;    &amp;lt;rect width=&quot;92&quot; height=&quot;90&quot; rx=&quot;12&quot; ry=&quot;15&quot; x=&quot;26&quot; y=&quot;25&quot; /&amp;gt;&#xA;  &amp;lt;/g&amp;gt;&#xA;  &amp;lt;!-- pixel art logo --&amp;gt;&#xA;  &amp;lt;defs&amp;gt;&#xA;    &amp;lt;rect id=&quot;pixel&quot; width=&quot;6&quot; height=&quot;6&quot; rx=&quot;1&quot; ry=&quot;1&quot; x=&quot;68&quot; y=&quot;42&quot;&#xA;          fill=&quot;#ffffff&quot; stroke=&quot;none&quot; /&amp;gt;&#xA;  &amp;lt;/defs&amp;gt;&#xA;  &amp;lt;use xlink:href=&quot;#pixel&quot; x=&quot;0&quot; y=&quot;0&quot; /&amp;gt;&#xA;  &amp;lt;use xlink:href=&quot;#pixel&quot; x=&quot;0&quot; y=&quot;+7&quot; /&amp;gt;&#xA;  &amp;lt;use xlink:href=&quot;#pixel&quot; x=&quot;+7&quot; y=&quot;+7&quot; /&amp;gt;&#xA;  &amp;lt;use xlink:href=&quot;#pixel&quot; x=&quot;+14&quot; y=&quot;+7&quot; /&amp;gt;&#xA;  &amp;lt;use xlink:href=&quot;#pixel&quot; x=&quot;0&quot; y=&quot;+14&quot; /&amp;gt;&#xA;  &amp;lt;use xlink:href=&quot;#pixel&quot; x=&quot;0&quot; y=&quot;+21&quot; /&amp;gt;&#xA;  &amp;lt;use xlink:href=&quot;#pixel&quot; x=&quot;0&quot; y=&quot;+28&quot; /&amp;gt;&#xA;  &amp;lt;use xlink:href=&quot;#pixel&quot; x=&quot;-14&quot; y=&quot;+35&quot; /&amp;gt;&#xA;  &amp;lt;use xlink:href=&quot;#pixel&quot; x=&quot;0&quot; y=&quot;+35&quot; /&amp;gt;&#xA;  &amp;lt;use xlink:href=&quot;#pixel&quot; x=&quot;+14&quot; y=&quot;+35&quot; /&amp;gt;&#xA;  &amp;lt;use xlink:href=&quot;#pixel&quot; x=&quot;-21&quot; y=&quot;+42&quot; /&amp;gt;&#xA;  &amp;lt;use xlink:href=&quot;#pixel&quot; x=&quot;-14&quot; y=&quot;+42&quot; /&amp;gt;&#xA;  &amp;lt;use xlink:href=&quot;#pixel&quot; x=&quot;+14&quot; y=&quot;+42&quot; /&amp;gt;&#xA;  &amp;lt;use xlink:href=&quot;#pixel&quot; x=&quot;+21&quot; y=&quot;+42&quot; /&amp;gt;&#xA;  &amp;lt;use xlink:href=&quot;#pixel&quot; x=&quot;-14&quot; y=&quot;+49&quot; /&amp;gt;&#xA;  &amp;lt;use xlink:href=&quot;#pixel&quot; x=&quot;-7&quot; y=&quot;+49&quot; /&amp;gt;&#xA;  &amp;lt;use xlink:href=&quot;#pixel&quot; x=&quot;0&quot; y=&quot;+49&quot; /&amp;gt;&#xA;  &amp;lt;use xlink:href=&quot;#pixel&quot; x=&quot;+7&quot; y=&quot;+49&quot; /&amp;gt;&#xA;  &amp;lt;use xlink:href=&quot;#pixel&quot; x=&quot;+14&quot; y=&quot;+49&quot; /&amp;gt;&#xA;  &amp;lt;use xlink:href=&quot;#pixel&quot; x=&quot;+35&quot; y=&quot;+49&quot; /&amp;gt;&#xA;&amp;lt;/svg&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(Yes, I could've golfed it down quite a bit, but I didn't want to do that at the expense of readability.)&lt;/p&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2014-01-08T01:50:25.577" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="838" PostTypeId="5" CreationDate="2014-01-08T16:11:20.223" Score="0" Body="&lt;p&gt;Community Promotion Ads started as &lt;a href=&quot;https://blog.stackoverflow.com/2009/12/free-vote-based-advertising-for-open-source-projects/&quot;&gt;free advertising on Stack Overflow for open source projects&lt;/a&gt; in 2009. In 2011, the project was expanded to include &lt;a href=&quot;https://blog.stackoverflow.com/2011/05/community-promotion-ads/&quot;&gt;free vote-based advertising for all Stack Exchange communities&lt;/a&gt;. Ads should be for projects, tools, conferences, etc. relevant to the site, such as:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Highlighting and promoting activities in the &lt;a href=&quot;https://blogoverflow.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;per-site community blogs&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Cool applications or open-source projects related to the site&lt;/li&gt;&#xA;&lt;li&gt;The site’s &lt;a href=&quot;https://blog.stackoverflow.com/2011/01/twitter-question-feeds-for-stack-exchange/&quot;&gt;Twitter feed&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Promoting relevant events or conferences the community should know about&lt;/li&gt;&#xA;&lt;li&gt;Anything else the community would genuinely be interested in&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This tag should only be used on posts in which ads are submitted and voted upon, and can therefore only be applied by moderators. If you need to &lt;em&gt;discuss&lt;/em&gt; community ads, please use the &lt;a href=&quot;/questions/tagged/advertising&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;advertising&amp;#39;&quot; rel=&quot;tag&quot;&gt;advertising&lt;/a&gt; tag.&lt;/p&gt;&#xA;" OwnerUserId="14186" LastEditorUserId="14149" LastEditDate="2017-08-27T15:40:54.803" LastActivityDate="2017-08-27T15:40:54.803" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="839" PostTypeId="4" CreationDate="2014-01-08T16:11:20.223" Score="0" Body="Indicates a post used for submitting and voting on Community Promotion Ads. For discussion on these Ads, please use the Advertising tag." OwnerUserId="14186" LastEditorUserId="14186" LastEditDate="2014-01-08T18:53:57.223" LastActivityDate="2014-01-08T18:53:57.223" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="840" PostTypeId="1" AcceptedAnswerId="855" CreationDate="2014-01-08T18:11:34.597" Score="7" ViewCount="522" Body="&lt;p&gt;I came across the &lt;a href=&quot;http://regex.alf.nu/&quot; rel=&quot;nofollow&quot;&gt;Regex Golf&lt;/a&gt; site, which contains regex challenges: there are two columns: &quot;match all of these&quot; and &quot;match none of these&quot; and the intension is to create a regex that's as short as possible to fit the requirements.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would this kind of challenges be interesting for Programming Puzzles and Code Golf? I &lt;strong&gt;do not&lt;/strong&gt; mean that we should copy challenges from there, but I'm just asking whether it would be interesting.&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="3808" LastEditDate="2014-01-21T23:38:07.293" LastActivityDate="2014-01-21T23:38:07.293" Title="Would Regex Golf challenges be interesting for the site?" Tags="|discussion|new-genre|" AnswerCount="6" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="841" PostTypeId="2" ParentId="840" CreationDate="2014-01-08T18:15:39.210" Score="4" Body="&lt;p&gt;&lt;em&gt;In this post, I am speaking as a user, not a moderator.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To me, part of the appeal of this site is seeing a variety of different solution approaches, in a variety of languages. While I think regex golf is fun, I don't think it provides either of these attributes, so I would prefer not to see such questions here.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-01-08T18:15:39.210" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="842" PostTypeId="1" AcceptedAnswerId="848" CreationDate="2014-01-08T18:22:11.963" Score="4" ViewCount="400" Body="&lt;p&gt;How are new users supposed to start participating on this site?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With a reputation of 1 I am unable to answer questions(says I need rep of 5), unable to add a comment to help a question/answer in the topics I would like to and unable to ask questions on various parts of the site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This seems to make it impossible for new users to gain the reputation to be able to participate in the first place.  I wasn't even able to post a question in the meta section(where I think this question should have been posted instead, please correct me if im wrong).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Edit:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In order to gain the first 5 rep it seems that new users can either create new questions in the general sections (some sections such as meta have minimum requirements) and have it upvoted or suggest edits and have them accepted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It seems a minimum of 5 rep is required to answer questions in the codegolf section as I receive the message &quot;You must have at least 5 reputation on Programming Puzzles &amp;amp; Code Golf Stack Exchange to answer a question.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would answer my own question but it won't let me for another 8h as I have less than 10 rep.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If someone else has a fuller answer before that time I will accept the answer, otherwise I will answer it once the timer expires.&lt;/p&gt;&#xA;" OwnerUserId="14201" OwnerDisplayName="pfc" LastEditorUserId="14201" LastEditDate="2014-01-08T19:06:41.610" LastActivityDate="2014-01-08T21:44:55.260" Title="How are new users supposed to participate on this site?" Tags="|discussion|" AnswerCount="3" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="843" PostTypeId="2" ParentId="842" CreationDate="2014-01-08T19:22:26.057" Score="6" Body="&lt;p&gt;For most questions on the main site, &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/create-posts&quot;&gt;anyone can post an answer, regardless of reputation level&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;What is asking and answering questions?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The most basic privilege of all -- the right to ask a question, and the right to contribute an answer. This is generally available to everyone, regardless of reputation level.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;However, to post in a &lt;a href=&quot;https://codegolf.stackexchange.com/help/whats-meta&quot;&gt;&lt;em&gt;meta site&lt;/em&gt;&lt;/a&gt; (as opposed to the &lt;em&gt;main site&lt;/em&gt;), you &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/participate-in-meta&quot;&gt;need a minimum of  5 reputation&lt;/a&gt; on the corresponding main site:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Because we allow anonymous participation, we require a small bit of parent site reputation to prevent spam, and ensure that meta is for active, engaged members of the community.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Certain questions may be &lt;em&gt;&lt;strong&gt;protected&lt;/strong&gt;&lt;/em&gt; (for example, &lt;a href=&quot;https://codegolf.stackexchange.com/q/17005/7796&quot;&gt;this one&lt;/a&gt;), in which case they have an explanatory message:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This question is protected to prevent &amp;quot;thanks!&amp;quot;, &amp;quot;me too!&amp;quot;, or spam answers by new users. To answer it, you must have earned at least 10 reputation on this site.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;To post an answer to such a question, you need a minimum of 10 reputation.&lt;/p&gt;&#xA;" OwnerUserId="7796" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-01-08T19:22:26.057" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="844" PostTypeId="2" ParentId="842" CreationDate="2014-01-08T19:23:03.840" Score="5" Body="&lt;p&gt;You can answer any question with 1 rep, except protected questions. Perhaps you are trying to answer a protected question? You will see a banner that says &quot;protected by (username)&quot; if a question is protected.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-01-08T19:23:03.840" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="845" PostTypeId="1" CreationDate="2014-01-08T17:42:59.643" Score="26" ViewCount="617" Body="&lt;p&gt;&lt;strong&gt;Don't get me wrong&lt;/strong&gt;, I love this website. I think it's fun and all but I can't help thinking...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How does it correspond to Stack Exchange's mission :&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;What is Stack Exchange?&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Stack Exchange is a growing network of individual communities, each&#xA;  dedicated to serving experts in a specific field. We build libraries&#xA;  of high-quality questions and answers, focused on each community's&#xA;  area of expertise.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;How is it building a high quality library of questions and answers that will help experts? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I mean, I highly doubt someone will ever search on Google for the shortest way to build Python code that will produce an ASCII Christmas tree. So how did it make it this far? Is this site an exception ? Is it &lt;strong&gt;only&lt;/strong&gt; because a lot of users backed the site? Isn't some kind of filter made on Area 51? &lt;/p&gt;&#xA;" OwnerDisplayName="insert clever xmas name" LastActivityDate="2015-05-02T09:59:40.247" Title="Where does Programming Puzzles &amp; Code Golf fit in the SE mission?" Tags="|discussion|code-golf|" AnswerCount="3" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="846" PostTypeId="2" ParentId="845" CreationDate="2014-01-08T18:18:25.987" Score="39" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;How is it building a high quality library of questions and answers that will help experts?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It isn't, not in the sense of asking Google and getting an answer.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I would argue that, as an exercise, code golf is highly instructive in areas such as lateral thinking, paradigm shifting, and developing a deep understanding of a programming language.  While it may not be an exact mapping to Stack Exchange's model in the Q&amp;amp;A sense, it nevertheless serves the same purpose that browsing Eric Lippert's and Jon Skeet's answers on Stack Overflow does, or working through Project Euler problems does.  It educates.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is indeed a repository of useful programming knowledge on Code Golf; you just have to digest it in a different way.&lt;/p&gt;&#xA;" OwnerUserId="392" OwnerDisplayName="Robert Harvey" LastActivityDate="2014-01-08T18:23:43.567" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="847" PostTypeId="2" ParentId="845" CreationDate="2014-01-08T18:25:39.183" Score="7" Body="&lt;p&gt;Think of the reasons why programmers like Project Euler.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, you can't Google and find results from these sites like people do from Stack Overflow, but it certainly helps people think, and read other people's logic of solving the same problem. It tells us about optimized way of doing something (Code Golf).  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It makes us feel (a kind of reminder) that there is a still lot to know in the language (whichever language we use to code). Lots of techniques and optimizations, for example you could find a more &lt;em&gt;pythonic&lt;/em&gt; way of doing some particular task.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;According to me, its purpose is more educative and academic than professional. In this way they are different than other Stack Exchange websites.&lt;/p&gt;&#xA;" OwnerUserId="14239" OwnerDisplayName="ps06756" LastActivityDate="2014-01-08T18:54:00.427" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="848" PostTypeId="2" ParentId="842" CreationDate="2014-01-08T21:12:46.223" Score="9" Body="&lt;p&gt;Reputation requirements vary by site type, and sometimes between sites. In general, the following categories of StackExchange sites will have similar rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Private Beta&lt;/strong&gt; will have &lt;em&gt;very low&lt;/em&gt; reputation requirements so that participants who have committed to the project can help quickly generate content for the site before it opens to the public.  &lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Public Beta&lt;/strong&gt; (the current state for this site) has moderate-to-low requirements that ensure users will need to earn a certain amount of trust from the community before gaining certain privileges, while still accommodating to the fact that the site is still in its early stages and reputation will be generally harder to earn at this point.  &lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Graduated Sites&lt;/strong&gt; have the highest reputation requirements to help maintain the quality standards of StackExchange on sites which have been deemed to have long-term value.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Meta StackOverflow&lt;/strong&gt; has special rules because it is by nature &lt;em&gt;very&lt;/em&gt; different from other StackExchange sites.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;To check how much reputation is required for a specific action, and see where you stand with regards to those requirements, go to the &lt;code&gt;/privileges&lt;/code&gt; page on any main site. Here, that would be &lt;a href=&quot;https://codegolf.stackexchange.com/privileges&quot;&gt;https://codegolf.stackexchange.com/privileges&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To find out how reputation is earned (and how it can also be lost), check the &quot;What's Reputation&quot; page of a given main site. Here, it's &lt;a href=&quot;https://codegolf.stackexchange.com/help/whats-reputation&quot;&gt;https://codegolf.stackexchange.com/help/whats-reputation&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;To answer your questions specifically...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Asking and answering questions on the main site, also called &quot;creating posts&quot; requires only 1 rep. New users with zero history on StackExchange start with 1 rep, so you should have no difficulty (in terms of permissions) with performing these actions. Just make sure you're using the proper UI and, for example, not trying to submit a comment instead. The only limitations to this is that brand-new users cannot answer &quot;protected&quot; questions, or create posts &quot;too rapidly&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Commenting on your own posts, or answers in your own question thread, is also available to all users.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Participating on the Meta site requires 5 reputation. This is a nominal requirement, which is easily met, to prevent spam on the Meta site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To shake off the &quot;new user restrictions&quot; (which include the aforementioned limitations against answering protected questions or posting too quickly) you need 10 rep. Again, this is a &lt;em&gt;very&lt;/em&gt; small amount which is easily earned, and this restriction is primarily just a spam prevention mechanism.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To leave comments on other people's posts, you need 50 reputation. This serves the dual purpose of preventing spam and (hopefully) demonstrating that you have at least some idea of how the question/answer/comment system works (and when it's appropriate to do - or not do do - any of those actions) before you're fully cut loose to comment everywhere.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These standards are among the few which are the same across all sites, regardless of their stage in the lifecycle.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Getting to Meta can be accomplished by any one of the following (or some mixtures thereof):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1 up-vote on a question you post  &lt;/li&gt;&#xA;&lt;li&gt;Accept an answer on 3 of your questions&lt;/li&gt;&#xA;&lt;li&gt;Approval of 3 of your edit suggestions&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Note: You can always edit your own posts, and I believe any user - even down to 1 rep - can suggest edits to others' posts, but editing other people's posts autonomously is not granted until much later.&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Passing out of the new user restrictions can be done by:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1 up-vote on an answer you post&lt;/li&gt;&#xA;&lt;li&gt;1 of your answers is accepted&lt;/li&gt;&#xA;&lt;li&gt;2 up-votes across questions you've posted&lt;/li&gt;&#xA;&lt;li&gt;Accept an answer on 5 of your questions&lt;/li&gt;&#xA;&lt;li&gt;Approval of 5 of your edit suggestions&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Gaining &quot;comment everywhere&quot; privileges can be achieved by:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;5 up-votes across your answers&lt;/li&gt;&#xA;&lt;li&gt;4 of your answers get accepted&lt;/li&gt;&#xA;&lt;li&gt;10 up-votes across questions you've posted&lt;/li&gt;&#xA;&lt;li&gt;Accept answers on 25 of your questions&lt;/li&gt;&#xA;&lt;li&gt;Have 25 edit suggestions approved&lt;/li&gt;&#xA;&lt;li&gt;Get a bounty awarded manually to 1 of your answers&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Note: Minimum bounty amount is 50 rep.&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Get a bounty awarded automatically to 2 of your answers&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Note: Auto-awards of bounties only award half the bounty value and require two up-votes on the answer.&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;General Note: The above assumes you have not lost any reputation (e.g.: by getting flags or down-votes on your posts) along the way.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All of the aforementioned restrictions (except editing other people's posts) can be bypassed if you already have at least 200 reputation on any other StackExchange site, and you make sure to associate your account here with the other site's account. That will give you an automatic 100-reputation boost.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All of the above actions must be done on a &quot;main site&quot;. With the exception of Meta StackOverflow, participation on Meta does not earn reputation. Your reputation and privileges on a Meta site generally mirrors that of the associated main site.&lt;/p&gt;&#xA;" OwnerUserId="9387" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-01-08T21:44:55.260" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="849" PostTypeId="2" ParentId="825" CreationDate="2014-01-08T22:30:47.300" Score="10" Body="&lt;p&gt;&quot;Not an Answer&quot; flags are for posts that make no attempt to answer the question.  They are usually things like:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I have the same problem&lt;/li&gt;&#xA;&lt;li&gt;Have you seen my glasses?&lt;/li&gt;&#xA;&lt;li&gt;Check out this great new product!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Neither of your examples qualifies as &quot;Not an Answer.&quot;  If you believe the answer is hurting the site, cast a custom moderator flag instead, and explain in your own words why the answer is harmful to the site, and should be removed. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For your two specific examples, it's probably better just to downvote.&lt;/p&gt;&#xA;" OwnerUserId="392" LastActivityDate="2014-01-08T22:30:47.300" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="850" PostTypeId="2" ParentId="840" CreationDate="2014-01-08T23:52:59.447" Score="2" Body="&lt;p&gt;I suspect that most answers would be produced by taking a program which would be a suitable submission to &lt;a href=&quot;https://codegolf.stackexchange.com/q/17718/194&quot;&gt;Meta regex golf&lt;/a&gt; and maybe doing a bit of manual tweaking to optimise. As such, I think there's a case for closing regex golf questions as duplicates (specifically, specialisations) of that question.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2014-01-08T23:52:59.447" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="851" PostTypeId="2" ParentId="840" CreationDate="2014-01-09T03:47:49.007" Score="8" Body="&lt;p&gt;As a counter point to @Chrisjester-Young I would say that it is a benefit that regex is at least somewhat language agnostic. This levels the playing field allowing at least some competitions to take place that regardless of your language of choice.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have to at least partially agree with the fact that the solutions may all lead to the same general answer, but this is not necessarily the case for complex word lists.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would say golfing is productive in that it forces you to look at and practice with whatever language your working with in an extreme situation. I would say regex golf has the potential to do this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, in all honesty it may not be a great fit for site. Anyone can create two random word lists and post them meaning the solutions while interesting are a little arbitrary. It could devolve into something similar to doing Sudoku or a crossword puzzles.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;PS @PeterTaylor I'm sure that programs can find general solutions, but for complex word lists I'm pretty sure the results wouldn't be optimal.  The logic I used for the two problems I posted and solved by hand (I created a small utility to test my regex, but not to actually do any solving) I would find very hard to program the logic or just brute force a near-optimal or optimal solution. Though I'm sure there are ways.&lt;/p&gt;&#xA;" OwnerUserId="14092" LastActivityDate="2014-01-09T03:47:49.007" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="852" PostTypeId="1" CreationDate="2014-01-09T15:02:06.627" Score="0" ViewCount="98" Body="&lt;p&gt;I can't understand why my question was closed:&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/17415/rotate-an-integer-array-with-an-on-algorithm&quot;&gt;Rotate An Integer Array with an O(n) algorithm&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It was previously put &quot;on hold&quot;, then I edited my question to meet the requirements.&#xA;But then it was closed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can't understand what is wrong with this question.&lt;/p&gt;&#xA;" OwnerUserId="13361" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-01-14T23:51:06.733" Title="I can't understand why my quesiton was closed" Tags="|discussion|policy|close-reasons|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="853" PostTypeId="2" ParentId="760" CreationDate="2014-01-09T22:51:21.810" Score="5" Body="&lt;p&gt;Clearly, the only solution is &lt;a href=&quot;http://codetrolling.stackexchange.com&quot; rel=&quot;nofollow&quot;&gt;codetrolling.stackexchange.com&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="14332" LastActivityDate="2014-01-09T22:51:21.810" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="854" PostTypeId="2" ParentId="788" CreationDate="2014-01-10T02:23:49.227" Score="13" Body="&lt;p&gt;How about a design based on the &lt;a href=&quot;http://commons.wikimedia.org/wiki/File:Glider.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hacker emblem&lt;/a&gt;? It seems to me that of all the SE sites, this one is most closely related to the &lt;a href=&quot;http://en.wikipedia.org/wiki/Hacker_%28programmer_subculture%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;hacker subculture&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Favicon: &lt;img src=&quot;https://i.stack.imgur.com/K7cSx.png&quot; alt=&quot;Favicon&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://jsfiddle.net/PZ9Ac/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Logo:&lt;/a&gt; &lt;img src=&quot;https://i.stack.imgur.com/4LDNG.png&quot; alt=&quot;Logo&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="11006" LastActivityDate="2014-01-10T02:23:49.227" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="855" PostTypeId="2" ParentId="840" CreationDate="2014-01-10T02:35:06.407" Score="20" Body="&lt;p&gt;Honestly, I don't see why not.  They're code golf puzzles, just like any other, and thus well within our scope.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, I agree that there are some potential issue with such challenges.  Let me try to respond to some of them point by point, and argue why they don't really matter that much (or at least don't require immediate action):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&quot;We're being / going to be flooded with them.&quot;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Well, yes.  (Although &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex-golf&quot;&gt;five&lt;/a&gt; is hardly a flood yet.) That's what happens when something &lt;a href=&quot;http://xkcd.com/1313/&quot; rel=&quot;nofollow noreferrer&quot;&gt;ends up on XKCD&lt;/a&gt;.  The thing is, though, that it's a fad, and like all fads, it's going to pass and settle down to a more sustainable level.  &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/760/is-code-trolling-getting-out-of-control&quot;&gt;We've just had the same issue&lt;/a&gt; with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;, but that seems to have peaked now &amp;mdash; I don't see a single troll question on the front page right now.  I fully expect the same to happen with regex golf in a week or two at most.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&quot;There's no originality in picking two arbitrary sets and asking for a regexp to distinguish them.&quot;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;No, there isn't, just like there's no originality in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot;&gt;picking an arbitrary piece of text and asking for the shortest program to print it.&lt;/a&gt;  Yet we haven't really had an issue with that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The thing is, the community here is pretty good at voting up challenges they think are interesting, and voting down those they think are boring.  If you're going to post yet another &quot;print this text&quot; golf challenge and want some upvotes for it, you'd better include &lt;em&gt;something&lt;/em&gt; in it that makes it different from all the &lt;em&gt;n&lt;/em&gt;+1 previous ones.  I expect it's going to work just the same way for regex golf, too.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&quot;They're just going to be solved by computer-generated regexps.&quot;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I doubt it.  Or at least, I hope not.  If that &lt;em&gt;does&lt;/em&gt; end up happening regularly, I do agree with Peter Taylor's suggestion that they should be closed as duplicates of the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/17718/meta-regex-golf&quot;&gt;meta-challenge&lt;/a&gt;.  But let's wait a while and see if that'll actually happen, instead of just assuming that it will.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The thing is, &lt;a href=&quot;https://cstheory.stackexchange.com/questions/1854/is-finding-the-minimum-regular-expression-an-np-complete-problem&quot;&gt;regex golf is NP-hard.&lt;/a&gt;  That means you're never going to have an algorithm that would be guaranteed to find the optimal solution in reasonable time.  Sure, there are heuristics that can produce &lt;em&gt;pretty good&lt;/em&gt; solutions pretty efficiently, but most of the time, a sufficiently clever human can find tricks to improve them that the program simply never considered.  Which is what makes it fun.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&quot;Allowing &lt;em&gt;only&lt;/em&gt; regexp solutions makes it boring.&quot;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You mean like Perl Golf is boring, because you can only use Perl?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yes, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/132/is-language-agnostic-an-appropriate-tag&quot;&gt;we've decided&lt;/a&gt; that challenges on this site &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/446/amend-faq-to-state-that-language-agnostic-is-the-default&quot;&gt;are language-agnostic by default&lt;/a&gt;, and I think that's a good decision.  But that doesn't make &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python%20or%20perl%20or%20php%20or%20java%20or%20c%20or%20c%23%20or%20c%2b%2b%20or%20assembly%20or%20brainfuck?sort=votes&quot;&gt;the occasional language-specific questions&lt;/a&gt; off topic, nor does it necessarily make them boring.  Sometimes, a challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/9121/write-a-java-code-to-detect-the-jvm-version&quot;&gt;only makes sense in a specific language&lt;/a&gt;; sometimes, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/577/assembly-language-quine&quot;&gt;constraining the language just spices up an old challenge&lt;/a&gt;.  And sometimes, maybe you just don't want GolfScript / APL to always win. ;-)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But if you still think so, feel free to post a language-agnostic &quot;distinguish these sets&quot; challenge.  It could be fun!&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-01-10T02:35:06.407" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="856" PostTypeId="2" ParentId="788" CreationDate="2014-01-10T16:56:25.980" Score="-2" Body="&lt;p&gt;Since this site is about challenges, code, obfuscation, and of course golfing, how about this?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/DbRyU.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;and larger&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/tKdDu.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is a whitespace program where the three characters have been converted to red, green, and blue. I'll leave it to you figure out what it's output is.&lt;/p&gt;&#xA;" OwnerUserId="14092" LastActivityDate="2014-01-10T16:56:25.980" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="857" PostTypeId="2" ParentId="840" CreationDate="2014-01-10T21:56:43.037" Score="4" Body="&lt;p&gt;In my view, there are two types of regex golfs -- ones with clear patterns that test if you understand regex (most of the ones &lt;a href=&quot;http://regex.alf.nu/&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; ) and ones where you match random lists of words (The subtitles of Star Trek films to Star Wars).  Neither of these make for good problems for this site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first type are fun problems, but probably too close-ended for this site -- most people familiar with regex instantly will write out the straightforward answer when there's a clearly optimal answer (e.g., the first four problems on &lt;a href=&quot;http://regex.alf.nu/&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://regex.alf.nu/&lt;/a&gt; where you can see the pattern quickly)).  Occasionally, you can modestly improve upon the straightforward solution.  E.g., to the powers problem (#13 at &lt;a href=&quot;http://regex.alf.nu&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://regex.alf.nu&lt;/a&gt;) (matching the string x^(2^i) where i=0,1,2,...,10) has a straightforward 45-char solution:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;^((((((((((x)\10?)\9?)\8?)\7?)\6?)\5?)\4?)\3?)\2?)\1?$&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;but code golfing it you can reduce it to 43-char &lt;code&gt;^(((((((((xx?)\9?)\8?)\7?)\6?)\5?)\4?)\3?)\2?)\1?$&lt;/code&gt;.  Also, if you don't mind picking up some matches not in the positive set (but not in the specifically negated set), you can reduce it to at least 38 characters with &lt;code&gt;^(xx?|xxxx|x{8}|x{16}|x{32}|(x{64})*)$&lt;/code&gt; (which matches a string of 192 x's, despite 192 not being in the form 2^(2^i).  But again, rather quickly you reach the best solution as there are only a few ideas to really use.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The second type of matching one list without matching a second list of random items is silly.  Doing it by hand is going to be significantly worse unless you use custom-written tools (that may not do all the work for you; e.g., you suggest clauses by looking at the words not matched so far).  The other problem is the second type will generally be uninsightful or clever as you are so constrained (must use a regex and must match these words).  While the problem is NP hard, the problem size is also quite small and humans are also bad at NP hard problems.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd have no problem with their being one regex golf problem of the random list type, but I don't think there should be many of them.  Each code golf problem of distinct lists is often quite similar, similar to how it makes sense to allow &lt;a href=&quot;https://codegolf.stackexchange.com/questions/17604/calculate-69-in-different-bases&quot;&gt;&quot;Calculate 6*9 in different bases&quot;&lt;/a&gt; (reference to &lt;a href=&quot;http://en.wikipedia.org/wiki/Phrases_from_The_Hitchhiker%27s_Guide_to_the_Galaxy#Answer_to_the_Ultimate_Question_of_Life.2C_the_Universe.2C_and_Everything_.2842.29&quot; rel=&quot;nofollow noreferrer&quot;&gt;hitchhiker's guide to the galaxy&lt;/a&gt; question and answer), but it wouldn't make sense to repeat the question many times with different products.&lt;/p&gt;&#xA;" OwnerUserId="1721" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-01-10T21:56:43.037" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="858" PostTypeId="2" ParentId="2140" CreationDate="2014-01-11T10:47:10.670" Score="1" Body="&lt;h1&gt;Resurrect Adobe SubScript.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In an obscure conference procedings volume of forgotton lore, there's a quaint little paper which describes an early effort to implement a published subset of Adobe Postscript. There a line in the bibliography! :) &lt;a href=&quot;https://groups.google.com/d/topic/comp.lang.postscript/C9fTi03DvWo/discussion.&quot; rel=&quot;nofollow noreferrer&quot;&gt;But it cannot be found&lt;/a&gt; Nobody's ever heard of it. :(&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Adobe Systems, &quot;SubScript Specification&quot;, 1984.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;But there's obvious utility in such a thing. So this is a hypothetical &lt;em&gt;Micro-Manual&lt;/em&gt; Postscript, and its name shall be ASS[*]. :)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;ASS is a dynamically-typed stack-based programming language with powerful graphics primitives. It has support for floating-point arithmetic, arrays and dictionaries. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The scanner reads white-space delimited tokens and attempts to interpret the token as a decimal floating-point number with optional sign (+/-). The program may (but is not required to) support exponential notation. Failing to recognize a valid number, the token becomes a name object, an atomic symbol type which is identified by the name (an &quot;interned&quot; string).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Types&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As suggested by the scanner behavior and the operator list , there are the following object types:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;floating-point&lt;/strong&gt; numbers (coerced to integer where appropriate)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;names&lt;/strong&gt; (usually an index into a string table, for easy comparisons)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;arrays&lt;/strong&gt; (an indexable sequence of objects)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;dictionaries&lt;/strong&gt; (a key-value map of objects)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;operators&lt;/strong&gt; (a pointer to a built-in function)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Operators&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Operators are the basic actions predefined in the dynamic name space.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Stack Manipulation&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;any&lt;/em&gt;  &amp;nbsp; &lt;strong&gt;pop&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;-&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;pop an object from the operand stack&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;any&lt;sub&gt;1&lt;/sub&gt;&lt;/em&gt;  &lt;em&gt;any&lt;sub&gt;2&lt;/sub&gt;&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;exch&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;any&lt;sub&gt;2&lt;/sub&gt;&lt;/em&gt;  &lt;em&gt;any&lt;sub&gt;1&lt;/sub&gt;&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;exchange top two elements&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;any&lt;sub&gt;N&lt;/sub&gt;&lt;/em&gt;  &lt;em&gt;any&lt;sub&gt;N-1&lt;/sub&gt;&lt;/em&gt;  ...  &lt;em&gt;any&lt;sub&gt;0&lt;/sub&gt;&lt;/em&gt;  &lt;em&gt;N&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;index&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;any&lt;sub&gt;N&lt;/sub&gt;&lt;/em&gt;  &lt;em&gt;any&lt;sub&gt;N-1&lt;/sub&gt;&lt;/em&gt;  ...  &lt;em&gt;any&lt;sub&gt;0&lt;/sub&gt;&lt;/em&gt;  &lt;em&gt;any&lt;sub&gt;N&lt;/sub&gt;&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;retrieve object from stack by position&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;where &lt;em&gt;N&lt;/em&gt; is treated as an integer.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Arrays.&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;N&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;array&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;array&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;create a new array of length N&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;any&lt;sub&gt;0&lt;/sub&gt;&lt;/em&gt;  &lt;em&gt;any&lt;sub&gt;1&lt;/sub&gt;&lt;/em&gt;  ...  &lt;em&gt;any&lt;sub&gt;N-1&lt;/sub&gt;&lt;/em&gt;  &lt;em&gt;array&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;astore&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;array&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;fill array with objects from stack&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;array&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;aload&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;any&lt;sub&gt;0&lt;/sub&gt;&lt;/em&gt;  &lt;em&gt;any&lt;sub&gt;1&lt;/sub&gt;&lt;/em&gt;  ...  &lt;em&gt;any&lt;sub&gt;N-1&lt;/sub&gt;&lt;/em&gt;  &lt;em&gt;array&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;spill contents of array onto stack&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;[&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;any&lt;sub&gt;0&lt;/sub&gt;&lt;/em&gt;  &lt;em&gt;any&lt;sub&gt;1&lt;/sub&gt;&lt;/em&gt;  ...  &lt;em&gt;any&lt;sub&gt;N-1&lt;/sub&gt;&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;]&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;array&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;construct an array&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;array&lt;/em&gt;  &lt;em&gt;index&lt;/em&gt;  &lt;em&gt;any&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;put&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;-&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;put a value into array&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;array&lt;/em&gt;  &lt;em&gt;index&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;get&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;any&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;retrieve value from array&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;where &lt;em&gt;index&lt;/em&gt; is treated as an integer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The typical way to implement the array syntax is using an auxiliary type, the marktype object, and an operator &lt;strong&gt;counttomark&lt;/strong&gt;. This is an implementation detail and is not strictly required but may be found to be convenient.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;-&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;[&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;mark&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;produce marktype object as a sentinel on the stack&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;mark&lt;/em&gt;  &lt;em&gt;any&lt;sub&gt;N&lt;/sub&gt;&lt;/em&gt;  &lt;em&gt;any&lt;sub&gt;N-1&lt;/sub&gt;&lt;/em&gt;  ...  &lt;em&gt;any&lt;sub&gt;1&lt;/sub&gt;&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;counttomark&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;mark&lt;/em&gt;  &lt;em&gt;any&lt;sub&gt;N&lt;/sub&gt;&lt;/em&gt;  &lt;em&gt;any&lt;sub&gt;N-1&lt;/sub&gt;&lt;/em&gt;  ...  &lt;em&gt;any&lt;sub&gt;1&lt;/sub&gt;&lt;/em&gt;  &lt;em&gt;N&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;count objects up to mark&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Then the &lt;strong&gt;]&lt;/strong&gt; operator may be implemented in terms of the other array operators.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;mark&lt;/em&gt;  &lt;em&gt;any&lt;sub&gt;N&lt;/sub&gt;&lt;/em&gt;  &lt;em&gt;any&lt;sub&gt;N-1&lt;/sub&gt;&lt;/em&gt;  ...  &lt;em&gt;any&lt;sub&gt;1&lt;/sub&gt;&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;]&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;array&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;{ counttomark array astore exch pop }&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Dictionaries.&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;N&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;dict&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;dict&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;create a new dictionary, an associative container with room for N name-value pairs&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;dict&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;begin&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;-&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;push dictionary on dictionary stack, making names part of the dynamic name space&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;-&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;currentdict&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;dict&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;push copy of topmost dictionary on dictionary stack to the operand stack&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;-&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;end&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;-&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;pop and discard the topmost dictionary on the dictionary stack&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;name&lt;/em&gt;  &lt;em&gt;any&lt;/em&gt;  &amp;nbsp;  &lt;em&gt;def&lt;/em&gt;  &amp;nbsp;  &lt;em&gt;-&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;associate name with any value in topmost dictionary&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;name&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;load&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;any&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;lookup name in each dictionary in the dictionary stack from the top-down, returning the first match, or error if not found&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Matrices and transformations.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A matrix is a 6-number array &lt;code&gt;[a b c d e f]&lt;/code&gt; which represent a left-multiplying affine transformation matrix with the constant right-most column omitted.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; a b 0&#xA; c d 0  =&amp;gt;  [a b c d e f]&#xA; e f 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;-&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;matrix&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;matrix&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;returns a new identity matrix [1 0 0 1 0 0]&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;matrix&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;setmatrix&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;-&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;make matrix the current transform in the graphics state&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;-&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;currentmatrix&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;matrix&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;return current transform from the graphics state&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;x&lt;/em&gt;  &lt;em&gt;y&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;transform&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;x&amp;prime;&lt;/em&gt;  &lt;em&gt;y&amp;prime;&lt;/em&gt;&lt;br&gt;&#xA;&lt;em&gt;transform (x,y) pair by current transformation matrix&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Transforming a point involves multiplying the homogeneous vector through the transformation matrix:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;          [a b 0]&#xA;[x y 1] * [c d 0] =&amp;gt; [x' y' 1]&#xA;          [e f 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or, equivalently&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x' = a*x + c*y + e&#xA;y' = b*x + d*y + f&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Path description.&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;-&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;newpath&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;-&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;x&lt;/em&gt;  &lt;em&gt;y&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;moveto&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;-&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;x&lt;/em&gt;  &lt;em&gt;y&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;lineto&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;-&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;-&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;closepath&lt;/strong&gt; &amp;nbsp;  &lt;em&gt;-&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Clipping.&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;-&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;clip&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;-&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;-&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;clippath&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;-&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Painting.&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;-&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;erasepage&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;-&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;-&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;fill&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;-&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;-&lt;/em&gt;  &amp;nbsp;  &lt;strong&gt;showpage&lt;/strong&gt;  &amp;nbsp;  &lt;em&gt;-&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The &lt;strong&gt;fill&lt;/strong&gt; operator is where the magic happens. This operator is responsible for performing all of the graphics algorithms in sequence:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Shape Mapping&lt;br&gt;&#xA;&lt;em&gt;Tranform the coordinates of the path from user space to device space using the current transformation matrix.&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Shape Clipping&lt;br&gt;&#xA;&lt;em&gt;Clip the portions of the path that lie outside the clipping path.&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Filling&lt;br&gt;&#xA;*Perform a scan-line rasterization of the (may assumed closed-) polygon described by the path into the output frame buffer.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And &lt;strong&gt;showpage&lt;/strong&gt; copies the contents of the framebuffer to the actual output mechanism (window or file as described above).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;... need to fill this out a little more. Math, graphics state, errors. Describing stroked lines is too much, I think. I'm not sure if it needs the &lt;strong&gt;forall&lt;/strong&gt; operators for iterating through arrays and dicts. I'd like to avoid any need for overloading different types under the same operator name, and calling back to user code from an operator. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output may be to a window, or to a file in a simple format, like pgm or even a text-file of hashes and spaces for rough bitmaps. No half-toning. Only bi-level filling of convex polygons will be required. But a program may handle more colors if desired.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;em&gt;CW&lt;/em&gt; in case anybody wants to help me type-in the basic operators. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Questions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Does it need anything more? Should something be removed as unnecessary? Does anyone &lt;em&gt;have the spec&lt;/em&gt;??&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Perusing my ps implementations of the graphics portions linked in the comments, I've noticed the following needed operators:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;length&#xA;sub&#xA;roll&#xA;add&#xA;eq&#xA;array copy&#xA;mul&#xA;div&#xA;ne&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I think it needs loops, too. It's possible to do with just recursion, of course, but loops are nice. And &lt;code&gt;length&lt;/code&gt;, I think, needs to be polymorphic, operating on &lt;em&gt;array&lt;/em&gt; or &lt;em&gt;dict&lt;/em&gt; to retrieve the size for making copies and calculating indices. Add &lt;code&gt;sin&lt;/code&gt; and &lt;code&gt;cos&lt;/code&gt;, too.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;And this would be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[*] The moniker &quot;ASS&quot; is not intended as a disparagement of Adobe Systems nor any of their stupendous intellectual property. Rather it is merely intended to express frustration at the encountered difficulty in locating this document.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="2381" LastEditDate="2014-03-02T09:48:22.940" LastActivityDate="2014-03-02T09:48:22.940" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="859" PostTypeId="2" ParentId="788" CreationDate="2014-01-11T20:44:08.550" Score="4" Body="&lt;p&gt;On the recommendation in a comment I tried out Piet. Here is my first go at it.  It definitely needs some refining (eg use math to calculate the first number and see if we can get the program to feed into the bottom of the flag), but I wondered if this kind of thing would work. It outputs &lt;code&gt;Golf&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZbTLA.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/cKMPX.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="14092" LastEditorUserId="14092" LastEditDate="2014-01-11T20:54:25.060" LastActivityDate="2014-01-11T20:54:25.060" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="860" PostTypeId="1" AcceptedAnswerId="861" CreationDate="2014-01-12T12:00:04.737" Score="9" ViewCount="255" Body="&lt;p&gt;I often notice posts which contain strike-through versions of previous character counts, like this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Perl (&lt;s&gt;123&lt;/s&gt; 111 chars)&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't see this practice mentioned anywhere in the FAQs, nor here on meta. Might be I was using the wrong terms for my search. In any case I'd like to know what's the rationale behind these numbers, when to use them and when not to.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I guess when finding a shorter version, I should leave the longer striked out. But what about when I find a bug, and fixing it will make my code longer? What about when I do ten size improvements, do I keep them all? And what about if I don't like to include them, is there some danger of not including old counts being perceived in a bad way somehow?&lt;/p&gt;&#xA;" OwnerUserId="13683" LastActivityDate="2014-01-12T18:35:44.463" Title="Strike-through previous character counts" Tags="|discussion|code-golf|policy|characters|etiquette|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="861" PostTypeId="2" ParentId="860" CreationDate="2014-01-12T18:35:44.463" Score="14" Body="&lt;p&gt;There isn't a policy around this, and I don't think that there needs to be one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I starting using struck-out numbers for old versions in imitation of other golfers on this site, so I can't tell you the original rationale. However, I can offer my thoughts as to its utility.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The site stores a history of each post; if a post has been edited then it tells you when it was last edited and provides a link to the full history. However, there's no way of telling how much it has changed without following that link. The struck-out numbers provide a hint about how much history there is, and whether it relates to improvements in the code or in the documentation / discussion. They can also give a hint as to how much optimisation room is likely to be left: if you see &lt;strong&gt;&lt;strike&gt;400 300 280&lt;/strike&gt; 277&lt;/strong&gt; then it's probably going to take a lot of effort (or a completely different approach) to improve that answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To your specific questions:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;But what about when I find a bug, and fixing it will make my code longer?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Why would you want to highlight evidence of your mistake? ;) In this case I would replace the previous count; I think I may on one or two occasions where it affected several previous versions and where the same fix worked for all of them have bumped up the struck-out numbers by the same amount, preserving the history of how much it improved. In those cases I would also have left a note in the body of the answer explaining how to correct the previous versions.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;What about when I do ten size improvements, do I keep them all?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Up to you. I think that some people do, but if you want to abbreviate to &lt;strong&gt;&lt;strike&gt;400 300 ... 265&lt;/strike&gt; 264&lt;/strong&gt; then I doubt anyone would complain.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;And what about if I don't like to include them, is there some danger of not including old counts being perceived in a bad way somehow?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't think so.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-01-12T18:35:44.463" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="862" PostTypeId="2" ParentId="840" CreationDate="2014-01-12T20:21:10.810" Score="7" Body="&lt;p&gt;Regex golf can be &lt;em&gt;really&lt;/em&gt; interesting: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/3503/hard-code-golf-regex-for-divisibility-by-7&quot;&gt;Hard code golf: Regex for divisibility by 7&lt;/a&gt;.  The questions inspired by the xkcd will be fun for a while, and I expect 'em to die off.  I figured it was a fun enough challenge to post one.  My expectations of the problem were that it'd generate some more copycats, that it would raise a small ruckus here, and that people would get bored of it before too long.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also wanted to establish some reasonable ground rules because I felt that their existence was inevitable due to the xkcd comic -- thus, I posted my question with alacrity, skipping the vetting here, to 'pull the bandaid off'.  I think it went well, personally.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Different languages support different things in their regular expressions.  What I love about this site is that things are a fast &amp;amp; loose.  We pit languages against eachother, and dirty tricks are often encouraged.  Languages are not on a level playing field, and obscure knowledge of multiple languages is highly incentivized.  You won't find that at the regex-golf site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt; I've now gotten my solutions on &lt;a href=&quot;http://regex.alf.au&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://regex.alf.au&lt;/a&gt; honed to a point that I need to stop improving them and move on with life (though I'll tinker with alphabetize some more when I have time...).  This is a &lt;em&gt;blast&lt;/em&gt;.  3-divisibility? Primes?  Palindromes?  Matching parentheses?  These are great problems.  Problems like this should be welcome on the site.  Distinguishing between two crap lists of random objects?  Boring except for the metagolfers.  But some of these are just gold.&lt;/p&gt;&#xA;" OwnerUserId="2180" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2014-01-14T05:46:59.837" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="863" PostTypeId="2" ParentId="788" CreationDate="2014-01-12T21:39:31.497" Score="7" Body="&lt;p&gt;&lt;img src=&quot;http://puu.sh/6iQtP.png&quot; alt=&quot;Favicon&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't know, I like this one.&lt;/p&gt;&#xA;" OwnerUserId="14202" LastActivityDate="2014-01-12T21:39:31.497" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="864" PostTypeId="2" ParentId="852" CreationDate="2014-01-14T23:51:06.733" Score="1" Body="&lt;p&gt;&quot;On-hold&quot; and &quot;closed&quot; are the same thing in Stack Exchange.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, since your question has been edited to meet the requirements it was placed in the review queue until it gained 5 reopen votes upon which it was taken off hold/reopened.&lt;/p&gt;&#xA;" OwnerUserId="10740" LastActivityDate="2014-01-14T23:51:06.733" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="865" PostTypeId="1" CreationDate="2014-01-15T00:10:31.923" Score="27" ViewCount="507" Body="&lt;p&gt;It's already been &lt;a href=&quot;http://area51.stackexchange.com/proposals/4570/code-golf-programming-puzzles&quot;&gt;1,082 days in beta&lt;/a&gt;, and I'd like to see our site graduating sometime in the near future. James Khoury proposed &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/13194067#13194067&quot;&gt;aiming for the 1,337th day&lt;/a&gt; since beta started, and I like that idea, especially since it's only &lt;a href=&quot;http://www.convertunits.com/dates/daysfromnow/255&quot; rel=&quot;nofollow noreferrer&quot;&gt;in 255 days&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/7TPME.png&quot; alt=&quot;graduation goal&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd suggest increasing the voting going around so our users' reputation levels can increase and survive the privilege updates for graduated sites. Any suggestions on how we can prepare this site for graduation would be greatly appreciated.&lt;/p&gt;&#xA;" OwnerUserId="10740" LastEditorUserId="17249" LastEditDate="2015-03-04T14:24:15.177" LastActivityDate="2015-03-04T14:24:15.177" Title="Let's commit to graduate" Tags="|discussion|beta-status|" AnswerCount="1" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="866" PostTypeId="2" ParentId="231" CreationDate="2014-01-15T09:03:23.637" Score="4" Body="&lt;p&gt;I view each challenge as a set of challenges &amp;mdash; one for each language. That's why the title to my solutions (I've only done a few so far) contain the character count &lt;em&gt;and&lt;/em&gt; the language, as do most solutions.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I write a solution in SQL, I'm not competing against other languages, I'm competing against myself and against other SQL entries.&lt;br&gt;&#xA;If I wanted to try for the overal smallest solution, I probably should learn APL or GolfScript, but I'm not going to for now. I also know that Ruby or Python will beat a SQL solution easily &lt;sup&gt;1&lt;/sup&gt;. But I don't care. I might tire of SQL solutions and try Prolog (which can be surprisingly terse). But whatever langauge I choose, I'm having fun pushing the limits of the language I chose.  &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;So it's no surprise I'm all for language agnosticism.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That having been said, I think it can be interesting to restrict the challenge to use a little used language or group of languages, like brainfuck, or 'all non-visual Basics'. Why? Because that's a challenge in itself. It promotes diversity. If a challenge is restricted to the C-family (either strict or expanded), I'll probably go 'meh' and not even read the challenge, much less the solutions. But if the challenge asks for Malbolge, I'll read every entry, even though I'll probably understand not on iota of them.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;So I'm not against language specific entries either, as long as it's not restricted to a commonly used language.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt;: Unless we use operator count instead of character count, which might be an interesting idea.&lt;br&gt;&#xA;&lt;em&gt;Edit&lt;/em&gt;: I see that exactly this has been proposed, in the form of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/367/14150&quot;&gt;Atomic Code Golf&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="14150" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2014-01-16T07:24:25.000" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="867" PostTypeId="2" ParentId="367" CreationDate="2014-01-15T09:04:38.703" Score="1" Body="&lt;p&gt;I think this can be extended to nearly &lt;em&gt;all&lt;/em&gt; esoteric programming languages. While regular languages strive for conciseness and brevity, most esoteric languages do not.&lt;/p&gt;&#xA;" OwnerUserId="14150" LastActivityDate="2014-01-15T09:04:38.703" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="869" PostTypeId="2" ParentId="865" CreationDate="2014-01-16T00:04:18.957" Score="31" Body="&lt;p&gt;My suggestion is to &lt;strong&gt;upvote more&lt;/strong&gt;. Currently we only have 2 users with over 10k rep, and just barely. I'd say only two people (five including mods) being able to vote to delete on an SE site is pretty bad.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since deletion requires 3 votes, this means that &lt;strong&gt;only mods&lt;/strong&gt; will be able to delete stuff!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, if we want to get out of beta, just vote as much as you can. (Don't upvote bad or okay posts though!)&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-01-16T00:04:18.957" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="870" PostTypeId="2" ParentId="845" CreationDate="2014-01-16T06:25:07.963" Score="9" Body="&lt;p&gt;There's some contention that code golf has a rather unusual place here in StackExchange, some say that code golf serves no purpose.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have to disagree, as code golf allows programmers and coders to explore the eccentricities and quirks of the languages that we work with, finding tips and tricks that we may never have thought of before; and at the same time the golfing helps us hone our skills further to reduce our code, which is great if you are limited to a certain amount of space.&lt;/p&gt;&#xA;" OwnerUserId="8555" LastEditorUserId="8555" LastEditDate="2015-05-02T09:59:40.247" LastActivityDate="2015-05-02T09:59:40.247" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="871" PostTypeId="1" CreationDate="2014-01-16T22:14:27.250" Score="3" ViewCount="395" Body="&lt;p&gt;Today with friend of mine discussed about code golf, I want to ask your opinion about the thing we discussed about.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would it be legal if I create my own programming (actually scripting) language with many cool built in functions, that would let win code-golf challenges?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please, do not discuss if it would be hard to implement, but just express your opinion, if it would be legal or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thanks!&lt;/p&gt;&#xA;" OwnerUserId="9160" LastEditorUserId="9160" LastEditDate="2014-06-08T11:00:34.073" LastActivityDate="2014-06-08T11:00:34.073" Title="Creating new language. Would it be legal?" Tags="|discussion|code-golf|" AnswerCount="3" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="872" PostTypeId="2" ParentId="871" CreationDate="2014-01-16T23:13:59.663" Score="4" Body="&lt;p&gt;&lt;em&gt;In this post, I'm writing as a user, not a moderator.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Personally, I believe there's a fine line between GolfScript and HQ9+. Both languages are designed for golfing, but GolfScript is actually a general-purpose programming language (albeit one that lacks many useful features like floating-point numbers) that happens to use really short identifiers for its built-in operators, whereas HQ9+ is a language that's tailor-made to be good at three specific problems only.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So my question for you is, is your language going to be general-purpose? (That is, are your &quot;cool built-in functions&quot; going to be applicable to a wide range of programming problems, as opposed to being specific to a small handful of code challenges?) If so, great!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Also, you need to decide what will make your language appealing compared to GolfScript. One of GolfScript's strengths is that, compared to FlogScript, it's actually pretty easy to read: the operators are chosen with some care, and in particular, the author of GolfScript aimed to make most of the operators use punctuation rather than alphanumeric names (and given GolfScript's lexer, there is good reason for this). In contrast, in FlogScript, many operators use alphanumeric names and they are nearly indecipherable (IMHO).&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="3" LastEditDate="2014-01-16T23:20:40.847" LastActivityDate="2014-01-16T23:20:40.847" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="873" PostTypeId="2" ParentId="871" CreationDate="2014-01-16T23:57:03.777" Score="5" Body="&lt;p&gt;I think that &lt;a href=&quot;https://codegolf.stackexchange.com/users/10740/timtech&quot;&gt;Timtech&lt;/a&gt; has already done this with a source-to-source compiler which is basically a macro language. That seems to tread rather close to the subject matter of the previous meta question &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/435/194&quot;&gt;Is a code golfing library legitimate?&lt;/a&gt; It's also on rather thin ice because there isn't a generally available reference implementation: the only compiler provided is provided in an encoded format for which there doesn't appear to be a decoder. I personally would not accept or upvote an answer in GTB.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;It's easy to imagine a language which would be &lt;em&gt;clearly&lt;/em&gt; unacceptable. I'll call it zc: its compiler is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#!/bin/sh&#xA;zcat &quot;$@&quot; | sh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and a program is generally written by first writing in another language and then source-to-source translating it. E.g. the &quot;source&quot; is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;gcc -flags &amp;lt;&amp;lt;&amp;lt;X&#xA;#include foo&#xA;...&#xA;X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;after it's run through gzip.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;So it seems to me that there are several minimal criteria which affect whether a language which you create is reasonable to use:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The source is directly editable in general (i.e. you don't need to &quot;compile&quot; a different source into the code you submit).&lt;/li&gt;&#xA;&lt;li&gt;The language is well enough documented that other people can use it, and there is a reference implementation available for them to use.&lt;/li&gt;&#xA;&lt;li&gt;The language is stable, or at least stable enough that you don't give the impression that you're adding bits for each new challenge.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If you can get other people using your language, that's obviously a big bonus to its credibility. (The creators of J and GolfScript do not, as far as I know, participate on this site).&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2014-01-16T23:57:03.777" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="876" PostTypeId="2" ParentId="2140" CreationDate="2014-01-17T22:48:54.087" Score="3" Body="&lt;h1&gt; Create a program with &quot;exact repetition&quot; in its source code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The task is to create a program, with the following restrictions placed on the&#xA;printable ASCII characters in the source code: choose some &lt;code&gt;k &amp;gt; 0&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Every &lt;em&gt;non-alphabetic&lt;/em&gt; character has to appear &lt;strong&gt;exactly&lt;/strong&gt; &lt;code&gt;k&lt;/code&gt; times.&lt;/li&gt;&#xA;&lt;li&gt;Every &lt;em&gt;alphabetic&lt;/em&gt; character has to appear &lt;strong&gt;at most&lt;/strong&gt; &lt;code&gt;k&lt;/code&gt; times.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This rule differs from the former in order to avoid boring dummy&#xA;identifiers while still making it a challenge to choose good library&#xA;functions to call.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Character set definitions used:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Non-alphabetic characters&lt;/em&gt; are &lt;code&gt;!&quot;#$%&amp;amp;'()*+,-./0123456789:;&amp;lt;=&amp;gt;?@[\]^_{|}~&lt;/code&gt; and '`' (backtick).&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Alphabetic characters&lt;/em&gt; are &lt;code&gt;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Note that no restriction is placed on characters outside of the range of&#xA;printable ASCII characters (including control codes, tabs, newlines, higher&#xA;unicode codepoints, etc).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What the program does is up to you; be creative.  Some general guidelines:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Programs that do something interesting might have better chances, although&#xA;more impressive code structure (i.e. fewer comments) is also beneficial.&lt;/li&gt;&#xA;&lt;li&gt;Stuffing excess characters in comments is boring, and should be avoided/is&#xA;discouraged.&lt;/li&gt;&#xA;&lt;li&gt;Dead/no-op code isn't terribly interesting either, but is probably&#xA;unavoidable and at least has to conform to the language's grammar.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;: whatever has the most upvotes at Feb 1, 2014&#xA;gets accepted as the winner.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Example answer (C)&lt;/h3&gt;&#xA;&#xA;&lt;pre class=&quot;lang-c prettyprint-override&quot;&gt;&lt;code&gt;#&#xA;#&#xA;/*$$@``*/_[]={9.};main() {printf(&quot;He%clo \&#xA;world!%c\&#xA;&quot;,2^7&amp;amp;!8.&amp;amp;~1|~-1?4|5?0x6C:48:6&amp;lt;3&amp;gt;2&amp;gt;=3&amp;lt;++_[0],'@'^79-5);}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Prints &quot;Hello world!&quot; (adapted from an answer to another question).  Probably wouldn't score a lot (since what it does isn't terribly interesting).  Each of&#xA;the non-alphabetic characters appear exactly twice, and no alphabetic&#xA;character appears more than twice.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;For meta&lt;/strong&gt;: I want to post this, but I'm worrying that &quot;do something interesting&quot; might give too little guidance and the question won't receive many answers.. thoughts? Is it good as-is, or should I come up with some task that one should be required to implement (and possibly change the ruling to code-challenge, with &lt;code&gt;length + 2^(characters-in-comments)&lt;/code&gt; as the score)?&lt;/p&gt;&#xA;" OwnerUserId="3918" LastEditorUserId="3918" LastEditDate="2014-01-20T18:33:00.787" LastActivityDate="2014-01-20T18:33:00.787" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="878" PostTypeId="2" ParentId="2140" CreationDate="2014-01-18T18:57:37.667" Score="1" Body="&lt;h2&gt;Code-Golf: Write a number as an expression that's as short as possible&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The goal of this code-golf is to create a program that takes a number as input (using STDIN, command line arguments, or prompting for input), and outputs that number, but written as an expression &lt;strong&gt;that's as short as possible&lt;/strong&gt;. So, &lt;code&gt;10000&lt;/code&gt; should become &lt;code&gt;10^4&lt;/code&gt;. If there is no way to write an expression that's shorter than the number, then output just the number.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Other rules&lt;/h3&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;No network access.&lt;/li&gt;&#xA;&lt;li&gt;You're not allowed to execute an external program.&lt;/li&gt;&#xA;&lt;li&gt;Only use the operators &lt;code&gt;+&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;, &lt;code&gt;*&lt;/code&gt;, &lt;code&gt;/&lt;/code&gt; and &lt;code&gt;^&lt;/code&gt; (that's raising power, not XOR).&lt;/li&gt;&#xA;&lt;li&gt;Order of operations must be taken in account. Use parentheses if necessary.&lt;/li&gt;&#xA;&lt;li&gt;This is a code golf, so the code with the smallest amount of characters wins.&lt;/li&gt;&#xA;&lt;li&gt;The input will always be smaller than &lt;code&gt;2^32&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;500000000   --&amp;gt;    5*10^8     or    10^9/2&#xA;999999      --&amp;gt;    10^6-1&#xA;10          --&amp;gt;    10&#xA;4294967295  --&amp;gt;    2^32-1&#xA;16384       --&amp;gt;    2^14&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="9275" LastActivityDate="2014-01-18T18:57:37.667" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="879" PostTypeId="2" ParentId="788" CreationDate="2014-01-18T21:46:50.430" Score="17" Body="&lt;p&gt;I golfed it down to 2 letters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/d2gA7.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/kZO9k.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="2180" LastActivityDate="2014-01-18T21:46:50.430" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="880" PostTypeId="2" ParentId="871" CreationDate="2014-01-19T10:07:11.820" Score="1" Body="&lt;p&gt;Build it.  Then see if they come.  What I mean is if you construct such a language, one great test of legitimacy is whether other code golfers start to use it also.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Frustrating as it might seem, you may not get a ruling in advance on this strategy until you actually &lt;em&gt;try&lt;/em&gt; it.  Context is very important when it comes to judging fairness.  &lt;em&gt;And&lt;/em&gt; rules can change day to day as the community continues to assess a situation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Build a compelling tool and they will come!  So whatcha got?&lt;/p&gt;&#xA;" OwnerUserId="9496" LastEditorUserId="9496" LastEditDate="2014-01-19T10:12:54.953" LastActivityDate="2014-01-19T10:12:54.953" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="882" PostTypeId="2" ParentId="725" CreationDate="2014-01-19T22:25:49.327" Score="3" Body="&lt;p&gt;It's true that we can't realistically test submissions to the linked questions or similar ones to see whether they give the correct result, but I don't think that this is inherently bad. Nabbs' &lt;a href=&quot;https://codegolf.stackexchange.com/a/3781/194&quot;&gt;winning answer to Shamir secret sharing&lt;/a&gt; is also untestable in practical terms: code golf is about being as short as possible, so if the question doesn't place runtime limits then people should exploit that. If the submission includes a sketch proof of correctness, and even better if it can be tested on smaller test-cases (I tested Nabbs' code with a much smaller finite field), I think that's sufficient.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I agree that one needs to be careful when wording questions relating to open problems. Personally I much prefer questions along the lines of &lt;a href=&quot;https://codegolf.stackexchange.com/q/12177/194&quot;&gt;Collatz conjecture&lt;/a&gt; which take input and test to see whether it's a counterexample, ideally providing some kind of certificate. This is trivially changed into a brute force counterexample checker (it just takes a loop), but can be tested without necessarily understanding the code.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-01-19T22:25:49.327" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="885" PostTypeId="1" CreationDate="2014-01-20T06:56:55.267" Score="6" ViewCount="211" Body="&lt;p&gt;I've got an idea for a new type of question, but would like some feedback on it. I've tentatively called it Packed Program - but I'm willing to take any suggestions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The idea is that you have a byte size limit (say 255), and have to put as many solutions in as many different languages as possible within that amount of total bytes. You get 1 point for each language you solve it in.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So - for instance, if it was Bottles of beer Program Packed 255 bytes - 1 byte of HQ9+, 20 in GolfScript, 50 in C, 70 in Python, 65 in BASIC, and 40 in Fish. The total is 246 - so under 255 bytes. Score is 6, because they fit 6 programs, in different languages in the limit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I kinda would like to say that if a program compiles in multiple languages, you get multiple points, but I fear that it would start arguments over when you have a different language (C v C++ for instance).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I was also keen on the programs being necessarily run in the order that the person answers, or being able to access a file of the whole source code - meaning, that they could solve it using the shortest languages, and then refer to those answers via file access in the longer ones. Or something. But I think that this ends up being a little less interesting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would this be interesting? Or lame?&lt;/p&gt;&#xA;" OwnerUserId="3890" LastEditorUserId="3808" LastEditDate="2014-01-21T23:37:41.963" LastActivityDate="2014-01-21T23:37:41.963" Title="New Question Type - Packed Program" Tags="|discussion|new-genre|" AnswerCount="0" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="887" PostTypeId="2" ParentId="2140" CreationDate="2014-01-20T08:53:04.853" Score="3" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/board-game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;board-game&amp;#39;&quot; rel=&quot;tag&quot;&gt;board-game&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;algorithm&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Black Box&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to analyze a given situation for &lt;a href=&quot;https://en.wikipedia.org/wiki/Black_Box_%28game%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;the game Black Box&lt;/a&gt;. Given a sequence of guesses and answers, your program is to either print the solution or suggest the next move.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The game&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The board consists of 8×8 cells, with edges labeled like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;I'll probably create nice images here, particularly to make sure that the squares of the board are really square.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; abcdefgh&#xA;i        I&#xA;j        J&#xA;k        K&#xA;l        L&#xA;m        M&#xA;n        N&#xA;o        O&#xA;p        P&#xA; ABCDEFGH&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The player shoots rays into the interior of the box, where they might get deflected, reflected or absorbed. He is told the position where the ray leaves the black box again, and from that has to deduce the positions of 4 atoms inside the black box.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;I'll have to include more of the game rules here, but for now &lt;a href=&quot;https://en.wikipedia.org/wiki/Black_Box_%28game%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;see Wikipedia&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input and output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input is a sequence of line, each consisting of two characters. The first denotes the point where the ray of light enters the black box, the second the place where it comes out again. In the case of a reflection, both characters will be equal. In the case of a hit, the second character will be &lt;code&gt;-&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the input is enough to fully determine the locations of the atoms, then output should be four lines giving the coordinates of each atom. The lines should be two lower case characters each, the first giving the row and the second giving the column of the found solution. The atom positions must be printed in lexicographical order.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the input is consistent with more than one set of atom positions, then the output should consist of a single line containing a single character, which is the location where the next ray should be shot. That location has to be chosen in such a way that it can help find the solution. This is the case unless all of the atom positions consistent with the input so far would produce the same output for this next ray as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your output has to be terminated by a newline character.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let's take the atom configuration the Wikipedia article uses as an example as well:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; abcdefgh&#xA;i        I&#xA;j        J&#xA;k O    O K&#xA;l        L&#xA;m        M&#xA;n   O    N&#xA;o        O&#xA;p      O P&#xA; ABCDEFGH&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If the input were&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;cf&#xA;D-&#xA;Em&#xA;HH&#xA;Co&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;then the output should be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;kb&#xA;kg&#xA;nd&#xA;pg&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;but if the input were only&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Em&#xA;HH&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;then the output might be for example&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;K&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is code golf, so shortest answer wins. However, I'll only accept answers which are practical in so far as they compute their result in reasonable time. I'd say no more than five minutes on my system where I'll evaluate the answers, and I'll simply hope that correct solutions will be much faster and incorrect ones much slower, so that the speed of my system doesn't make a difference. A submission which gives a wrong answer for one of my test cases will be disqualified until it gets fixed. I will probably point out the problem in a comment to that post.&lt;/p&gt;&#xA;" OwnerUserId="13683" LastActivityDate="2014-01-20T08:53:04.853" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="888" PostTypeId="2" ParentId="788" CreationDate="2014-01-20T09:11:45.380" Score="3" Body="&lt;p&gt;I like the golf flag idea very much. With a few more pixels tweaked, it would be possible to also suggest puzzle pieces, two Ps, one reflected, (programming puzzles), to accompany the golf flag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/TUr9p.png&quot; alt=&quot;icon for codegolf&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="8740" LastActivityDate="2014-01-20T09:11:45.380" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="890" PostTypeId="2" ParentId="2140" CreationDate="2014-01-21T17:19:50.157" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;  &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Recognize spoken numbers of .wav file&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The goal of this code golf is to create a program or function that recognizes (and outputs) the spoken numbers of a Waveform Audio File (.wav).&lt;br&gt;&#xA;The rules are:  &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;No network access and you are not allowed to run external programs.&lt;/li&gt;&#xA;&lt;li&gt;The input will be the file path to the WAV file, and the spoken text will only be one of these digits: &lt;code&gt;one&lt;/code&gt;, &lt;code&gt;two&lt;/code&gt;, &lt;code&gt;three&lt;/code&gt;, &lt;code&gt;four&lt;/code&gt; or &lt;code&gt;five&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The output must be the recognized spoken number of the WAV file.&lt;/li&gt;&#xA;&lt;li&gt;You are not allowed to use third-party libraries.&lt;/li&gt;&#xA;&lt;li&gt;This is a code golf, so the code with the smallest character count wins.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="9275" LastEditDate="2014-01-22T14:15:11.510" LastActivityDate="2014-01-22T14:15:11.510" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="894" PostTypeId="1" CreationDate="2014-01-21T23:37:24.197" Score="4" ViewCount="227" Body="&lt;p&gt;I have an idea for a new genre of questions, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-purchasing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-purchasing&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-purchasing&lt;/a&gt; questions, and I thought I would run it through meta before giving it a try.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The basic idea is that you have to try to solve a problem, but certain characters cost certain amounts! Here's a quick example:&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I could have this table:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;| a-z   | 10 |&#xA;| A-Z   | 15 |&#xA;| =!    | 15 |&#xA;| {}    | 20 |&#xA;| ()    | 25 |&#xA;| []    | 50 |&#xA;| +-*/% | 55 |&#xA;| &quot;'    | 60 |&#xA;| ;     | 1  |&#xA;| other | 80 |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now lowercase letters cost me 10 points, uppercase cost 15, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I could then limit this challenge to certain languages. Here's a small list off the top of my head:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;C&lt;/li&gt;&#xA;&lt;li&gt;C++&lt;/li&gt;&#xA;&lt;li&gt;C#&lt;/li&gt;&#xA;&lt;li&gt;Java (you get &lt;code&gt;class A{public static void main(String[]a){}}&lt;/code&gt; for free)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;So, what do you think? Good? Bad? Ideas? Waffles?&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-05-25T06:13:36.987" Title="An idea for a new genre of challenges: [code-purchasing]" Tags="|discussion|new-genre|" AnswerCount="2" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="895" PostTypeId="5" CreationDate="2014-01-21T23:39:25.037" Score="0" Body="&lt;p&gt;This tag should be used on questions that propose a new genre of challenge. New genre proposals should meet the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It should not &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/908/66833&quot;&gt;already exist&lt;/a&gt;, or be a subset of an existing challenge type.&lt;/p&gt;&#xA;&lt;p&gt;For example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf-using-python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf-using-python&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf-using-python&lt;/a&gt; would be a subset of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It should have a single, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8130/why-do-we-have-objective-winning-criteria&quot;&gt;objective scoring criteria&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/prettiest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;prettiest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;prettiest-code&lt;/a&gt; is an entirely subjective criteria&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It should be an interesting challenge type, and should promote quality challenges over a large quantity of challenges&lt;/p&gt;&#xA;&lt;p&gt;For example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; attracted multiple low-quality challenges, as opposed to a few high-quality ones.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;&lt;/h3&gt;&#xA;&lt;p&gt;If you would like to propose the basis of a new genre, rather than jump immediately in with a proposal, check out the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1288/66833&quot;&gt;sandboxing question&lt;/a&gt; where you can post suggestions rather than full proposals.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="66833" LastEditDate="2021-04-28T22:47:53.837" LastActivityDate="2021-04-28T22:47:53.837" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="896" PostTypeId="4" CreationDate="2014-01-21T23:39:25.037" Score="0" Body="For questions that propose a new type of challenge. Your proposal should include an objective scoring criteria, as well as descriptions of why it is distinct from existing genres and why it would be a beneficial genre to have." OwnerUserId="3808" LastEditorUserId="66833" LastEditDate="2021-04-28T22:47:53.837" LastActivityDate="2021-04-28T22:47:53.837" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="897" PostTypeId="2" ParentId="894" CreationDate="2014-01-22T02:08:08.433" Score="3" Body="&lt;p&gt;It's an objective winning criteria.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't know that I'd find it particularly compelling, but I don't see any bar to using it on the site.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I am wondering about the name, though. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/priced-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;priced-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;priced-golf&lt;/a&gt;? &lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2014-01-22T02:08:08.433" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="898" PostTypeId="1" CreationDate="2014-01-22T15:09:51.420" Score="6" ViewCount="191" Body="&lt;p&gt;I posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/18986/draw-the-olympic-games-logo&quot;&gt;Draw the Olympic Games logo&lt;/a&gt;, which is clearly a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question requiring users to post a solution that outputs &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/15171/chubakueno&quot;&gt;chubakueno&lt;/a&gt; posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/19050/olympic-games-logo-free-style-edition&quot;&gt;Olympic Games Logo - Free Style Edition&lt;/a&gt;, which is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; and has no restrictions on output format. This post has been closed as a duplicate of the above contest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I cite &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/777/are-two-questions-duplicates-if-they-have-different-scoring-rules&quot;&gt;Are two questions duplicates if they have different scoring rules?&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/824/duplicate-questions&quot;&gt;Duplicate questions&lt;/a&gt; on Meta as precedent that these challenges can be considered different; while the posts from my question would be valid answers to the closed question, (currently) the opposite is not true. It's a different challenge with a different goal and much broader restrictions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't have the reputation to cast a reopen vote and get the ball rolling on this, but I believe that the new challenge should be reopened.&lt;/p&gt;&#xA;" OwnerUserId="1654" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2014-01-22T18:18:48.830" Title="Challenge closed as duplicate that's clearly different" Tags="|discussion|policy|close-reasons|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="899" PostTypeId="2" ParentId="898" CreationDate="2014-01-22T18:18:48.830" Score="2" Body="&lt;p&gt;And now it's been reopened. Thanks!&lt;/p&gt;&#xA;" OwnerUserId="1654" LastActivityDate="2014-01-22T18:18:48.830" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="900" PostTypeId="1" CreationDate="2014-01-22T19:17:29.957" Score="10" ViewCount="283" Body="&lt;p&gt;Since the new Stack Exchange top bar apparently broke the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/170/code-golf-userscript-to-help-in-navigating-the-site-v0-37-now-available&quot;&gt;old user script&lt;/a&gt;, I wrote a &lt;a href=&quot;https://stackapps.com/questions/4570/code-golf-se-answer-sorter&quot;&gt;quick and dirty replacement for it&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;em&gt;only&lt;/em&gt; thing my new user script does is what I felt was the most important function of the old one: it adds a new tab to the answer list that can be used to &lt;strong&gt;sort answers by length&lt;/strong&gt; of the first code block:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/oexV8.png&quot; alt=&quot;Screenshot of new &amp;quot;shortest&amp;quot; answer tab&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It does &lt;em&gt;not&lt;/em&gt; include any of the other fancy features of the old user script, but I think it's a &lt;em&gt;lot&lt;/em&gt; better than nothing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The user script has been tested in Mozilla Firefox and Google Chrome.  To install it, first download and install the &lt;a href=&quot;https://addons.mozilla.org/en-US/firefox/addon/greasemonkey/&quot; rel=&quot;nofollow noreferrer&quot;&gt;GreaseMonkey&lt;/a&gt; (for Firefox) or &lt;a href=&quot;https://chrome.google.com/webstore/detail/tampermonkey/dhdgffkkebhmkfjojejmpbldmpobfkfo&quot; rel=&quot;nofollow noreferrer&quot;&gt;TamperMonkey&lt;/a&gt; (for Chrome) extension, and then click the &quot;install / download&quot; button below:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;&lt;a href=&quot;https://gist.github.com/vyznev/9b55e1f96ee129d53466/raw/267df3d186d00e9ae874ff911e5f20ed6078529d/codegolf_sorter.user.js&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;kbd&gt;Install / Download&lt;/kbd&gt;&lt;/a&gt;&lt;/h1&gt;&#xA;  &#xA;  &lt;p&gt;&lt;sup&gt;&lt;a href=&quot;https://gist.github.com/vyznev/9b55e1f96ee129d53466&quot; rel=&quot;nofollow noreferrer&quot;&gt;view source&lt;/a&gt; / &lt;a href=&quot;https://stackapps.com/questions/4570/code-golf-se-answer-sorter&quot;&gt;StackApps post&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The script may also work in other browsers with compatible user script support, such as Safari or Opera.  &lt;a href=&quot;https://stackapps.com/tags/script/info&quot;&gt;See here for instructions on installing user scripts on different browsers.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt; Since version 0.3, the script should also work if installed directly as a Chrome extension using the alternative instructions above.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit 2:&lt;/strong&gt; ...and v0.4 should solve issues with direct links to answers.  (Previously, re-sorting the answers could leave a completely different answer in view than the one you wanted; now, the view should automatically jump back to the target answer.)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Ps. Shameless plug: if you like this user script, you may also want to try the &lt;a href=&quot;https://stackapps.com/questions/4486/stack-overflow-unofficial-patch&quot;&gt;Stack Overflow Unofficial Patch&lt;/a&gt;, another user script I've written to fix various neglected bugs and inconveniences in the Stack Exchange user interface.&lt;/p&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="68942" LastEditDate="2021-06-09T05:47:27.503" LastActivityDate="2021-06-09T05:47:27.503" Title="New user script to sort answers by length" Tags="|discussion|feature-request|status-deferred|user-interface|" AnswerCount="0" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="902" PostTypeId="1" CreationDate="2014-01-23T13:15:19.353" Score="11" ViewCount="320" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/19207/4897&quot;&gt;My answer here&lt;/a&gt; works only on the interactive Python prompt, which writes output to the screen if not stored in a variable or &lt;code&gt;None&lt;/code&gt;.  Is such an answer valid?&lt;/p&gt;&#xA;" OwnerUserId="4897" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-01-25T17:03:25.697" Title="Is an answer valid if it works only at the interactive prompt?" Tags="|discussion|rules|" AnswerCount="1" CommentCount="2" ClosedDate="2017-04-18T17:45:39.720" ContentLicense="CC BY-SA 3.0" />
  <row Id="903" PostTypeId="2" ParentId="2140" CreationDate="2014-01-23T16:40:01.087" Score="0" Body="&lt;h2&gt;Rhymalator&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(at the point, it's just something that came to me before i wake up, so it may need some adjusting, and i'd like some feedback as to if this could be fun)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The code challenge is to write a program that takes as input a calculation in Reverse Polish Notation and outputs the result. It must at least implement &lt;code&gt;+ - * /&lt;/code&gt;. It &#xA;So far so easy, but to make it fun and &quot;artistic&quot;, the following restriction applies:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The source code must rhyme when read. Example in PHP&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$iterator = str_split($a);&#xA;foreach ($iterator as $key=&amp;gt;$value){&#xA;    if ($key &amp;gt; 3){&#xA;        ++$virtue;&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(the rhyme is on value-virtue)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Lines whitout readable characters count as whitespace (the two lines with &lt;code&gt;}&lt;/code&gt; in the example)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="13870" LastActivityDate="2014-01-23T16:40:01.087" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="904" PostTypeId="1" AcceptedAnswerId="905" CreationDate="2014-01-24T19:44:39.943" Score="5" ViewCount="98" Body="&lt;p&gt;Usually, language-specific tags have this excerpt:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This challenge is intended to utilize the _____ language as a means of solving a problem. However, language-specific challenges are generally discouraged on CG.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;However, the problem is that sometimes, questions tagged with the language tags are not asking for solutions in that language; rather, the challenge is simply related to the language. For example, my challenge &lt;a href=&quot;https://codegolf.stackexchange.com/q/16732/3808&quot;&gt;Minify BF&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How could the standard excerpt be changed to rectify this?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't want to just make an executive decision, because I would have to update all the tags without any community input, but I went ahead and posted my suggestion in the answers below. If the community is in general agreement on one suggestion, I'll go ahead and edit all the language tags' excerpts.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-01-24T19:44:39.943" Title="What should the tag wiki excerpts for language-specific tags be?" Tags="|discussion|tags|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="905" PostTypeId="2" ParentId="904" CreationDate="2014-01-24T19:44:39.943" Score="8" Body="&lt;p&gt;My suggestion is to change it to&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This challenge is related to the _____ language. Note that challenges that require the answers to be in a specific language are generally discouraged.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It's both short enough to fit and gets the message across.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-01-24T19:44:39.943" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="906" PostTypeId="1" CreationDate="2014-01-24T19:47:35.540" Score="19" ViewCount="1212" Body="&lt;p&gt;This is not a question; rather, it is a collection of categories of tags.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The purpose of this post is to post information regarding specific categories, such as templates for tag wikis, and also to consolidate all of the tag categories in one place.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please edit the categories below if you find a missing tag (they are Community Wiki), or add a new answer if you have a new category.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2022-02-06T17:36:57.697" Title="The Tag Categorization Project" Tags="|discussion|tags|" AnswerCount="2" CommentCount="1" ClosedDate="2022-02-07T09:24:04.110" CommunityOwnedDate="2017-02-25T04:32:54.467" ContentLicense="CC BY-SA 3.0" />
  <row Id="907" PostTypeId="2" ParentId="906" CreationDate="2014-01-24T19:47:35.540" Score="6" Body="&lt;h1&gt;Language Tags&lt;/h1&gt;&#xA;&lt;p&gt;The desired tag wiki excerpt for these tags is:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This challenge is related to the _____ language. Note that challenges that require the answers to be in a specific language are generally discouraged.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/904/3808&quot;&gt;(relevant meta post)&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/apl&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;apl&amp;#39;&quot; rel=&quot;tag&quot;&gt;apl&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/assembly&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;assembly&amp;#39;&quot; rel=&quot;tag&quot;&gt;assembly&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/bash&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;bash&amp;#39;&quot; rel=&quot;tag&quot;&gt;bash&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/basic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;basic&amp;#39;&quot; rel=&quot;tag&quot;&gt;basic&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/befunge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;befunge&amp;#39;&quot; rel=&quot;tag&quot;&gt;befunge&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brain-flak&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brain-flak&amp;#39;&quot; rel=&quot;tag&quot;&gt;brain-flak&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brainfuck&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brainfuck&amp;#39;&quot; rel=&quot;tag&quot;&gt;brainfuck&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c&amp;#39;&quot; rel=&quot;tag&quot;&gt;c&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c%23&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c#&amp;#39;&quot; rel=&quot;tag&quot;&gt;c#&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c%2b%2b&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c++&amp;#39;&quot; rel=&quot;tag&quot;&gt;c++&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cjam&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cjam&amp;#39;&quot; rel=&quot;tag&quot;&gt;cjam&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/css&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;css&amp;#39;&quot; rel=&quot;tag&quot;&gt;css&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cubically&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cubically&amp;#39;&quot; rel=&quot;tag&quot;&gt;cubically&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/deadfish&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;deadfish&amp;#39;&quot; rel=&quot;tag&quot;&gt;deadfish&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/golfscript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;golfscript&amp;#39;&quot; rel=&quot;tag&quot;&gt;golfscript&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/haskell&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;haskell&amp;#39;&quot; rel=&quot;tag&quot;&gt;haskell&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/java&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;java&amp;#39;&quot; rel=&quot;tag&quot;&gt;java&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/jelly&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;jelly&amp;#39;&quot; rel=&quot;tag&quot;&gt;jelly&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/json&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;json&amp;#39;&quot; rel=&quot;tag&quot;&gt;json&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/klein&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;klein&amp;#39;&quot; rel=&quot;tag&quot;&gt;klein&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/lean&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;lean&amp;#39;&quot; rel=&quot;tag&quot;&gt;lean&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/lisp&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;lisp&amp;#39;&quot; rel=&quot;tag&quot;&gt;lisp&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/lost&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;lost&amp;#39;&quot; rel=&quot;tag&quot;&gt;lost&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/lua&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;lua&amp;#39;&quot; rel=&quot;tag&quot;&gt;lua&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matlab&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matlab&amp;#39;&quot; rel=&quot;tag&quot;&gt;matlab&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/octave&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;octave&amp;#39;&quot; rel=&quot;tag&quot;&gt;octave&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/perl&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;perl&amp;#39;&quot; rel=&quot;tag&quot;&gt;perl&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/php&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;php&amp;#39;&quot; rel=&quot;tag&quot;&gt;php&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/powershell&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;powershell&amp;#39;&quot; rel=&quot;tag&quot;&gt;powershell&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/prelude&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;prelude&amp;#39;&quot; rel=&quot;tag&quot;&gt;prelude&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pyth&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pyth&amp;#39;&quot; rel=&quot;tag&quot;&gt;pyth&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot;&gt;python&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/r&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;r&amp;#39;&quot; rel=&quot;tag&quot;&gt;r&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ruby&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ruby&amp;#39;&quot; rel=&quot;tag&quot;&gt;ruby&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/scala&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;scala&amp;#39;&quot; rel=&quot;tag&quot;&gt;scala&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sql&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sql&amp;#39;&quot; rel=&quot;tag&quot;&gt;sql&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/starry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;starry&amp;#39;&quot; rel=&quot;tag&quot;&gt;starry&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/swift&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;swift&amp;#39;&quot; rel=&quot;tag&quot;&gt;swift&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/vyxal&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;vyxal&amp;#39;&quot; rel=&quot;tag&quot;&gt;vyxal&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/x86-family&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;x86-family&amp;#39;&quot; rel=&quot;tag&quot;&gt;x86-family&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="66833" LastEditDate="2021-11-05T15:14:18.083" LastActivityDate="2021-11-05T15:14:18.083" CommentCount="3" CommunityOwnedDate="2014-01-24T19:47:35.540" ContentLicense="CC BY-SA 4.0" />
  <row Id="908" PostTypeId="2" ParentId="906" CreationDate="2014-01-24T19:50:19.757" Score="17" Body="&lt;h1&gt;Winning Criteria/Question Type&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Every&lt;/strong&gt; question should have at least one of these tags.&lt;/p&gt;&#xA;&lt;p&gt;Please use &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=%22%22+is%3Aquestion+closed%3Ano+-%5Bcode-golf%5D+-%5Bcode-challenge%5D+-%5Bpopularity-contest%5D+-%5Bfastest-code%5D+-%5Bfewest-operations%5D+-%5Bcode-trolling%5D+-%5Bcode-bowling%5D+-%5Bbusy-beaver%5D+-%5Bking-of-the-hill%5D+-%5Batomic-code-golf%5D+-%5Bcode-shuffleboard%5D+-%5Btips%5D+-%5Bchallenge-writing%5D+-%5Bprogramming-puzzle%5D+-%5Brestricted-source%5D+-%5Balgorithm%5D+-%5Bmetagolf%5D+-%5Bfastest-algorithm%5D+-%5Bpuzzle-solver%5D+-%5Banswer-chaining%5D++-%5Bcops-and-robbers%5D+-%5Btest-battery%5D+-%5Brosetta-stone%5D+-%5Bproof-golf%5D+-%5Bshowcase%5D+-%5Bself-scoring%5D&quot;&gt;this search query&lt;/a&gt; to find questions without one, and tag with the correct tag if the winning criterion is specified in the question. Currently (Feb. 6, 2022) there are none!&lt;/p&gt;&#xA;&lt;p&gt;If you think there needs to be a new category, post an answer to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1288/9498&quot;&gt;Let&amp;#39;s create some new types of challenges!&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; - Challenge where each answer influences how newer answers work. Often ends when there are no new answer in a specific time and the last one wins.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; - Challenge with limited amounts of commands available, shortest wins.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/busy-beaver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;busy-beaver&amp;#39;&quot; rel=&quot;tag&quot;&gt;busy-beaver&lt;/a&gt; - Challenge where the answer who gets the largest value of a certain computation model property wins, subject to the constraint that it must halt.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/challenge-writing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;challenge-writing&amp;#39;&quot; rel=&quot;tag&quot;&gt;challenge-writing&lt;/a&gt; - Question about writing challenges, not necessarily for CGCC.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; - Challenge to solve a problem in the most bytes or complexity.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; - Challenge with a specific scoring system, that isn't covered by any other tag.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; - Challenge to solve a problem in the least bytes of source code.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-shuffleboard&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-shuffleboard&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-shuffleboard&lt;/a&gt; - Challenge to solve a problem in a given amount of bytes.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; - Challenge covering 2 sub-challenges, where one's target is to solve a problem, and the second's is to find a hole in the first.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt; - Challenge won by the answer with the smallest asymptotic time complexity. Don't mistake with fastest-code.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; - Challenge where the winner is determined by the runtime performance of the code.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fewest-operations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fewest-operations&amp;#39;&quot; rel=&quot;tag&quot;&gt;fewest-operations&lt;/a&gt; - Challenge to solve a problem in the least amount of specified operations. Basically the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; - Challenge where submissions interact with and compete against each other in a form of a game.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt; - Challenge to solve a problem in the least amount of bytes in the output.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; - Challenge where the answer with the highest vote tally wins.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt; (ex. &lt;a href=&quot;https://codegolf.stackexchange.com/q/12188/3808&quot;&gt;When is a giraffe not a giraffe?&lt;/a&gt;) - Challenge where a program is given and submission has to edit it so it solves a specified problem.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/proof-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;proof-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;proof-golf&lt;/a&gt; - Challenge to solve a particular theorem/statement in the fewest number of substitutions/steps given a set of axioms.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/rosetta-stone&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;rosetta-stone&amp;#39;&quot; rel=&quot;tag&quot;&gt;rosetta-stone&lt;/a&gt; - Challenge where the goal is to write a solution using as many programming languages as possible.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-scoring&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-scoring&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-scoring&lt;/a&gt; - Challenge whose scoring criterion involves passing a program itself as input&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt; - Challenge whose scoring criterion involves running the output of a program through a large number of test cases.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; - Question asking for tips on a specific piece of code, to make it a better answer to a programming challenge.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/showcase&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;showcase&amp;#39;&quot; rel=&quot;tag&quot;&gt;showcase&lt;/a&gt; - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44680/showcase-of-languages&quot;&gt;This question&lt;/a&gt;. Please &lt;strong&gt;do not&lt;/strong&gt; create additional &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/showcase&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;showcase&amp;#39;&quot; rel=&quot;tag&quot;&gt;showcase&lt;/a&gt; questions&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="46076" LastEditDate="2022-02-06T17:36:57.697" LastActivityDate="2022-02-06T17:36:57.697" CommentCount="6" CommunityOwnedDate="2014-01-24T20:29:18.327" ContentLicense="CC BY-SA 4.0" />
  <row Id="909" PostTypeId="1" AcceptedAnswerId="1646" CreationDate="2014-01-24T23:37:10.650" Score="4" ViewCount="199" Body="&lt;p&gt;I've been using search to find questions that don't have a tag for a winning criterion (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/908/3808&quot;&gt;https://codegolf.meta.stackexchange.com/a/908/3808&lt;/a&gt;), and here's the search query I have so far:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/search?q=%22%22+is%3Aquestion+closed%3Ano+-%5Bcode-golf%5D+-%5Bcode-challenge%5D+-%5Bpopularity-contest%5D+-%5Bfastest-code%5D+-%5Bcode-trolling%5D+-%5Bcode-bowling%5D+-%5Brosetta-stone%5D+-%5Bbusy-beaver%5D+-%5Bking-of-the-hill%5D+-%5Batomic-code-golf%5D+-%5Bcode-shuffleboard%5D+-%5Bcode-tournament%5D&quot;&gt;https://codegolf.stackexchange.com/search?q=%22%22+is%3Aquestion+closed%3Ano+-%5Bcode-golf%5D+-%5Bcode-challenge%5D+-%5Bpopularity-contest%5D+-%5Bfastest-code%5D+-%5Bcode-trolling%5D+-%5Bcode-bowling%5D+-%5Brosetta-stone%5D+-%5Bbusy-beaver%5D+-%5Bking-of-the-hill%5D+-%5Batomic-code-golf%5D+-%5Bcode-shuffleboard%5D+-%5Bcode-tournament%5D&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I know, quite large. Anyway, of the 95 posts that it finds, I've noticed that some are tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt; and some are tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regex-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;regex-golf&lt;/a&gt;, and it seems to be pretty inconsistent. Some of them are even tagged with both!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, my question is: do we really need &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regex-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;regex-golf&lt;/a&gt;? Can't it just be merged or synonymized with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt; (and then maybe also tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;)?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Edit: based on the answer, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regex-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;regex-golf&lt;/a&gt; probably shouldn't be a tag. This is now an explicit synonym request: could &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regex-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;regex-golf&lt;/a&gt; become a synonym of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2014-05-29T18:59:11.843" Title="Do we really need the [regex-golf] tag?" Tags="|discussion|feature-request|status-completed|tags|synonym-request|" AnswerCount="2" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="910" PostTypeId="1" AcceptedAnswerId="983" CreationDate="2014-01-25T00:00:41.507" Score="3" ViewCount="98" Body="&lt;p&gt;I've noticed lots of questions that restrict the source code in some way. For example, &quot;do xxxxx without using xxxxx characters.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should there be a tag for this? This way these types of questions could be categorized more easily.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If so, could I have any help finding all the questions to retag? :P&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-02-15T14:35:45.160" Title="Should there be a [restricted-source] tag?" Tags="|discussion|tags|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="911" PostTypeId="5" CreationDate="2014-01-25T13:30:59.470" Score="0" Body="&lt;p&gt;The sandbox is used to discuss and remove problems from challenges before they are asked on the main site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The sandbox is used to prevent:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Answers that use holes in the question rules to cheat.&lt;/li&gt;&#xA;&lt;li&gt;Complaining comments due to poor rules.&lt;/li&gt;&#xA;&lt;li&gt;Poor questions that can be downvoted and closed due to bad wording, unintentional duplication of a previous challenge, and other problems.&lt;/li&gt;&#xA;&lt;li&gt;Disagreement with rules and scoring systems.&lt;/li&gt;&#xA;&lt;li&gt;Edits after posting the question.  Improving the rules after people have posted their answers destroys some previously eligible answers, does not ensure that previous downvotes will be removed, and cause complaints about the changed rules.&lt;/li&gt;&#xA;&lt;li&gt;Vaguely stated rules, which may cause the problem to be closed due to overly broad opinion based challenges.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;/questions/tagged/sandbox&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sandbox&amp;#39;&quot; rel=&quot;tag&quot;&gt;sandbox&lt;/a&gt; tag is currently used both for sandboxes themselves (there is currently only &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;one Sandbox&lt;/a&gt;, but this has not always been the case), and for meta-discussion about the sandboxing process.&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorDisplayName="user62131" LastEditDate="2017-05-28T15:55:18.560" LastActivityDate="2017-05-28T15:55:18.560" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="912" PostTypeId="4" CreationDate="2014-01-25T13:30:59.470" Score="0" Body="A sandbox is a place where you can post proposed challenges for others to review." OwnerUserId="9275" LastEditorUserId="9275" LastEditDate="2014-01-26T08:59:07.263" LastActivityDate="2014-01-26T08:59:07.263" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="913" PostTypeId="2" ParentId="909" CreationDate="2014-01-25T16:39:18.603" Score="4" Body="&lt;p&gt;We do have some challenges correctly tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt;+&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; that don't count as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regex-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;regex-golf&lt;/a&gt; in the sense described in the &lt;a href=&quot;https://codegolf.stackexchange.com/tags/regex-golf/info&quot;&gt;tag wiki&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&quot;Regex golf is a programming challenge involving two lists of items. The goal is to create a regex that matches one list without matching anything in the second.&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Some past challenges that are code golf and do involve regexps, but don't fall under the definition above (even in a loose sense), include:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/3130/negative-regexp&quot;&gt;Negative Regexp&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&quot;Write the shortest function that takes one string, and returns a regular expression that matches anything EXCEPT the input string, in parenthesis.&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/7024/compile-regexes&quot;&gt;Compile Regexes&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&quot;In this task you have to write a program that reads a regular expression and generates another program that outputs whether an input string is accepted by that regular expression.&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/7065/convert-regexes&quot;&gt;Convert Regexes&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&quot;Suppose you have existing regexes you wish to compile using one of the submissions to Compile Regexes. In as few characters as possible, write a program to make that work:&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;All these are code golf challenges where the &lt;em&gt;input&lt;/em&gt; or &lt;em&gt;output&lt;/em&gt; of the golfed code, rather than the code itself, is a regular expression.  So, IMO, we &lt;em&gt;could&lt;/em&gt; meaningfully declare that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regex-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;regex-golf&lt;/a&gt; should be used for code golf challenges where the code being scored &lt;em&gt;is&lt;/em&gt; a regexp, while &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt; would be reserved for challenges involving &lt;em&gt;manipulation&lt;/em&gt; of regexps.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, we could also equally well decide that this distinction is not a useful one to make, and that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regex-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;regex-golf&lt;/a&gt; should be replaced with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt;+&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.  In fact, I'm personally somewhat inclined in this direction myself, even if it does make the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt; tag slightly more ambiguous.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(In any case, the same ambiguity arises also with the other &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/907&quot;&gt;language tags&lt;/a&gt;, which can mean either &quot;this challenge is restricted to language &lt;em&gt;X&lt;/em&gt;&quot; or &quot;this challenge is about parsing / interpreting / generating language &lt;em&gt;X&lt;/em&gt;, but you can use any language to do that&quot;.  Most of those languages &lt;em&gt;don't&lt;/em&gt; have separate tags for these two purposes, and I don't think adding such tags would really be desirable, either.)&lt;/p&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2014-01-25T16:39:18.603" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="914" PostTypeId="2" ParentId="902" CreationDate="2014-01-25T17:03:25.697" Score="16" Body="&lt;p&gt;In my opinion, such answers should be valid unless the OP states otherwise.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These answers often reflect a different slant to the problem, and we all like variety, don't we? I don't think we should remove this dimension of creativity by default, but if the OP doesn't want such answers, they can of course say so.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From the perspective of a code golfer, I like to avoid the overhead of output that come with some languages. Some languages (such as GolfScript) produce output automatically, so I think it's fair to use a REPL interpreter to do the same thing.&lt;/p&gt;&#xA;" OwnerUserId="6788" LastActivityDate="2014-01-25T17:03:25.697" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="915" PostTypeId="1" AcceptedAnswerId="916" CreationDate="2014-01-25T21:17:42.443" Score="2" ViewCount="94" Body="&lt;p&gt;Golfing a program (it seems) tends to produce many, many more different versions of a source code file than &quot;normal&quot; programming. I've found that I end up with a directory full of variations that I distinguish with a number in the filename. But,... there's gotta be something better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Eg. &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;josh@Z1 ~&#xA;$ l *.ps&#xA;3d5c.ps          foo.ps       lsyg2.ps           revcam.ps    tearay2.ps&#xA;6502.ps          ftree.ps     lsyg3.ps           rottxt.ps    textrect.ps&#xA;7seg.ps          ftreeg.ps    lsyg4.ps           scan.ps      tok.ps&#xA;7seg2.ps         func.ps      lsyg4bin.ps        seq.ps       trapez.ps&#xA;7seg3.ps         fx.ps        lsyg4g.ps          sin1x.ps     tree.ps&#xA;a8086.ps         g.ps         lsyg5.ps           sol.ps       tri.ps&#xA;ab.ps            g2.ps        lsyg5g.ps          sort.ps      triforce.ps&#xA;abbr.ps          glas.ps      lsys.ps            spiral.ps    trig.ps&#xA;ayb.ps           glasses.ps   lsysg.ps           split.ps     trig2.ps&#xA;aybg.ps          gol.ps       lsysga.ps          sqrt.ps      ubf.ps&#xA;b8086.ps         gol2.ps      lsys-recursive.ps  stems.ps     ubf1.ps&#xA;bb.ps            gol2a.ps     mandel2.ps         stemsg.ps    ubf2.ps&#xA;bez.ps           goto.ps      map.ps             stemsga.ps   ubf3.ps&#xA;beziertrees2.ps  gridcal.ps   mat.ps             stickman.ps  ubf4.ps&#xA;bitfont.ps       hello.ps     ncat.ps            sunf.ps      ubf5.ps&#xA;cal3.ps          hershey.ps   parens.ps          swar.ps      ubf6.ps&#xA;chess.ps         hsc.ps       pastelforests.ps   tea.ps       um.ps&#xA;circ.ps          hsvrgb.ps    pathtext.ps        tea0.ps      ve6a.ps&#xA;cp437.ps         hsvrgb2.ps   pbm.ps             tea1.ps      ve6a-sq.ps&#xA;cv.ps            img.ps       pbm2.ps            tea1a.ps     ve6a-xpostlogo.ps&#xA;dancingmen.ps    japsh.ps     pi.ps              tea2.ps      xor.ps&#xA;deadfish.ps      jpgsz.ps     poly42.ps          tea3.ps      xorb.ps&#xA;derivefont.ps    lcd.ps       polygon.ps         tea4.ps      xorw.ps&#xA;det.ps           lcd-dump.ps  prof.ps            teamath.ps   xpostlogo.ps&#xA;dig.ps           logic.ps     qbf.ps             tearay.ps    xw.ps&#xA;dragon.ps        logicg.ps    qsort.ps           tearay0.ps   xwg.ps&#xA;ennead.ps        lsyg.ps      ray.ps             tearay1.ps&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Would the different variants be more ... explorable ... in a VCS? And is there a normal way to structure it so that the versions are more &lt;em&gt;parallel&lt;/em&gt;, since they're not necessarily &quot;incremental refinements&quot; with respect to one another?&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2014-01-25T21:23:38.870" Title="&quot;Best Way&quot; to Version-Control your golf experiments?" Tags="|discussion|support|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="916" PostTypeId="2" ParentId="915" CreationDate="2014-01-25T21:23:38.870" Score="4" Body="&lt;p&gt;Git sounds perfect for you, with regard to nonlinear histories. Branching is git's heart and soul.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-01-25T21:23:38.870" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="917" PostTypeId="2" ParentId="2140" CreationDate="2014-01-26T13:56:49.703" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Print Lorem ipsum&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The goal of this code golf is to write a program that prints &lt;strong&gt;EXACTLY&lt;/strong&gt; this text:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Lorem ipsum dolor sit amet, consectetur adipisicing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The rules:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;No external resources&lt;/li&gt;&#xA;&lt;li&gt;The shortest code in bytes wins.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="9275" LastActivityDate="2014-01-26T13:56:49.703" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="918" PostTypeId="2" ParentId="809" CreationDate="2014-01-27T21:23:46.090" Score="16" Body="&lt;p&gt;The problem is in line 1 of &lt;a href=&quot;http://cdn.sstatic.net/codegolf/all.css&quot; rel=&quot;nofollow&quot;&gt;all.css&lt;/a&gt;. (Admittedly, this information might be more helpful if the file had been created by someone with a functioning return key.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More specifically, the problem is caused by this rule starting at character 31,193:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.spoiler:hover code{color:#222;background-color:#444;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If the background colour could be changed to something a bit more sensible like &lt;code&gt;#ddd&lt;/code&gt; then everything will be fine.&lt;/p&gt;&#xA;" OwnerUserId="11006" LastActivityDate="2014-01-27T21:23:46.090" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="919" PostTypeId="1" CreationDate="2014-01-28T14:11:25.287" Score="3" ViewCount="116" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/shortest-time&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;shortest-time&amp;#39;&quot; rel=&quot;tag&quot;&gt;shortest-time&lt;/a&gt; tag seems to mean the same as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It only has three questions tagged with it, so a manually retagging would be easy, but just so that someone searching for &quot;time&quot; can still find the tag: can the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/shortest-time&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;shortest-time&amp;#39;&quot; rel=&quot;tag&quot;&gt;shortest-time&lt;/a&gt; tag be synonymized with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="3808" LastEditDate="2014-06-25T20:16:17.117" LastActivityDate="2014-06-25T20:16:17.117" Title="Synonymize [shortest-time] with [fastest-code]" Tags="|discussion|feature-request|status-completed|tags|synonym-request|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="920" PostTypeId="2" ParentId="2140" CreationDate="2014-01-28T14:47:51.943" Score="1" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Here's my first proposal. It just occurred to me that it might be a bit difficult testing submissions without a functioning server, but maybe we can manage without? What do you people think?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The web hosting company I use has a jobs page that looks a bit like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/at2RC.png&quot; alt=&quot;Screenshot of web page&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want to work for them, you have to calculate the correct answer and submit it through this form. But you only have a few seconds in which to do this, so you need a script to do it for you. If you submit the correct answer in time, you're then given a hash code and an email address, and are asked to email your source code to this address, using the hash code as the subject line:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/UrsF3.png&quot; alt=&quot;Screenshot of next page after a successful submission&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using any language you like, write a script to download and submit this application form with the correct answer and hidden &lt;code&gt;id&lt;/code&gt; field, and then email your source code with the hash code provided as the subject line. You can assume that the HTML source of the two pages is as follows:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;1. http://jobs.example.com/&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;!DOCTYPE html&amp;gt;&#xA;&amp;lt;html&amp;gt;&#xA;&amp;lt;head&amp;gt;&#xA;&amp;lt;title&amp;gt;Job Application&amp;lt;/title&amp;gt;&#xA;&amp;lt;/head&amp;gt;&#xA;&amp;lt;body&amp;gt;&#xA;&amp;lt;p&amp;gt;Evaluate 943 + 376 - 394 * 573 * 983 , and submit the answer with the following form.&amp;lt;/p&amp;gt;&#xA;&amp;lt;form method=&quot;POST&quot; action=&quot;apply.pl&quot;&amp;gt;&#xA;&amp;lt;input type=&quot;text&quot; name=&quot;answer&quot; value=&quot;&quot; /&amp;gt;&#xA;&amp;lt;input type=&quot;hidden&quot; name=&quot;id&quot; value=&quot;5d41402abc4b2a76b9719d911017c592&quot; /&amp;gt;&#xA;&amp;lt;input type=&quot;submit&quot; name=&quot;submit&quot; value=&quot;submit&quot; /&amp;gt;&#xA;&amp;lt;/form&amp;gt;&#xA;&amp;lt;/body&amp;gt;&#xA;&amp;lt;/html&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;2. http://jobs.example.com/apply.pl&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;!DOCTYPE html&amp;gt;&#xA;&amp;lt;html&amp;gt;&#xA;&amp;lt;head&amp;gt;&#xA;&amp;lt;title&amp;gt;Job Application&amp;lt;/title&amp;gt;&#xA;&amp;lt;/head&amp;gt;&#xA;&amp;lt;body&amp;gt;&#xA;&amp;lt;p&amp;gt;Well done, that was the correct answer. Now email your source&#xA;code to jobs@example.com with the following text in the Subject&#xA;header:&amp;lt;/p&amp;gt;&#xA;&amp;lt;p&amp;gt;&amp;lt;code&amp;gt;1a79a4d60de6718e8e5b326e338ae533&amp;lt;/code&amp;gt;&amp;lt;/p&amp;gt;&#xA;&amp;lt;p&amp;gt;But hurry, you only have five seconds!&amp;lt;/p&amp;gt;&#xA;&amp;lt;/body&amp;gt;&#xA;&amp;lt;/html&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The only variable parts of these pages are:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The sum (up to 6 numbers separated by any combination of &lt;code&gt;+&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt; and &lt;code&gt;*&lt;/code&gt; with spaces on both sides)&lt;/li&gt;&#xA;&lt;li&gt;The hidden &lt;code&gt;id&lt;/code&gt; field that must be submitted with the form.&lt;/li&gt;&#xA;&lt;li&gt;The hash code on the second page&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;You may assume that the sum can be calculated without overflow using 32-bit integer arithmetic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="11006" LastActivityDate="2014-01-28T14:47:51.943" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="922" PostTypeId="1" CreationDate="2014-01-29T06:21:53.497" Score="12" ViewCount="324" Body="&lt;p&gt;Our site budded from StackOverflow as an outlet for code-golf questions when the need for reigning-in the focus of SO became apparent. [&amp;lt;-this is all guesswork, am I right?]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This has left a sizeable wasteland of closed golf questions on SO. Can we have 'em?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;...Do we want them?&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="68942" LastEditDate="2021-06-09T05:47:14.567" LastActivityDate="2021-06-09T05:47:14.567" Title="Adopt (and reopen!) SO's closed code-golf questions?" Tags="|discussion|feature-request|status-declined|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="923" PostTypeId="2" ParentId="922" CreationDate="2014-01-29T15:05:43.287" Score="9" Body="&lt;p&gt;I don't think we want all closed questions tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; from SO.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Some will be duplicates (e.g. &lt;a href=&quot;https://stackoverflow.com/q/232861/573420&quot;&gt;Fibonacci code golf&lt;/a&gt; vs &lt;a href=&quot;https://codegolf.stackexchange.com/q/85/194&quot;&gt;Fibonacci function or sequence&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Some are off-topic (e.g. &lt;a href=&quot;https://stackoverflow.com/q/364155/573420&quot;&gt;Most interesting and challenging programming tasks&lt;/a&gt; or &lt;a href=&quot;https://stackoverflow.com/q/72383/573420&quot;&gt;What's the point of Perl golf?&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;And some are just completely boring (e.g. &lt;a href=&quot;https://stackoverflow.com/q/9270207/573420&quot;&gt;Code Golf: Shortest python program to convert from celsius to fahrenheit and vice versa &lt;/a&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There are even more &lt;em&gt;unclosed&lt;/em&gt; questions tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; on SO: regardless of their quality we wouldn't want 250 questions dumped on this site &lt;em&gt;en masse&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, there are some gems there, which raises a variant question:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Should we make a list of good &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; questions from SO which we might ask to be migrated here.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Certainly SO is not keen on those questions continuing to be active: when I posted a new answer to one of them a few months back it led to the question being protected almost immediately. Migrating over here could give them new life, and improve the quality of this site. The potential downside I see is the rep effect: some people might not like having considerable rep transferred from their SO account to a brand new PCG account.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2014-01-29T15:05:43.287" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="924" PostTypeId="1" CreationDate="2014-01-29T17:35:18.567" Score="12" ViewCount="2310" Body="&lt;p&gt;I'm starting to be fed up with those kind of answers.&lt;br&gt;&#xA;Every time someone asks a question, such as &quot;Print a christmas tree&quot;, one of the top 3 answers is something along the line of &lt;code&gt;Print(&quot;a christmas tree&quot;);&lt;/code&gt;&lt;br&gt;&#xA;cf &lt;a href=&quot;https://codegolf.stackexchange.com/a/4348/8806&quot;&gt;https://codegolf.stackexchange.com/a/4348/8806&lt;/a&gt;&lt;br&gt;&#xA;It's true that those questions are often not the most exciting  but is there a way to limit those uninteresting answers? Or do we accept them all?&lt;br&gt;&#xA;One of the answers I'll probably have would be &quot;they usually don't win&quot; (damn J), but even if it loses, it still takes space in place of actual interesting answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Have a good day!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;EDIT: To add some context, should we downvote answers like this? As a asker of 1 pretty big question, I'd like to downvote this &lt;a href=&quot;https://codegolf.stackexchange.com/a/13097/8806&quot;&gt;one&lt;/a&gt;, as it uses nothing special, and still gave more rep to the poster than other ones who actually thought about it.&lt;/p&gt;&#xA;" OwnerUserId="8806" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-02-09T01:49:22.940" Title="This kind of answer : Print(&quot; a %s by %s box&quot;, n);" Tags="|discussion|" AnswerCount="3" CommentCount="2" ClosedDate="2014-05-29T11:51:31.477" ContentLicense="CC BY-SA 3.0" />
  <row Id="925" PostTypeId="2" ParentId="924" CreationDate="2014-01-29T17:37:11.247" Score="14" Body="&lt;p&gt;I would actually want to nuke those kinds of smartarse answers. I dislike them as much as you do.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-01-29T17:37:11.247" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="926" PostTypeId="2" ParentId="924" CreationDate="2014-01-29T21:53:29.680" Score="14" Body="&lt;p&gt;Egads! &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first one of those (on the first [code-golf] on stack overflow) was funny. Since then they only serve to point out poorly stated problems.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As that is their real function I propose to not nuke them as such, but instead convert them to comment where they serve that (important) function but do not &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;generate rep for the poster &lt;/li&gt;&#xA;&lt;li&gt;encourage more such answers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Or maybe convert the earliest one and nuke any follow-ons.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="78" LastEditDate="2014-02-09T01:49:22.940" LastActivityDate="2014-02-09T01:49:22.940" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="927" PostTypeId="2" ParentId="2140" CreationDate="2014-01-30T00:16:39.747" Score="0" Body="&lt;h1&gt;Implement Kalah &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The game of Kalah is a two-player board game in the Mancala family. Your implementation must:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Identify the active player (&amp;quot;Player 1&amp;quot; or &amp;quot;Player 2&amp;quot;)&lt;/li&gt;&#xA;&lt;li&gt;Display board state (in format specified below)&lt;/li&gt;&#xA;&lt;li&gt;Accept input to allow that player to move (using index system below)&lt;/li&gt;&#xA;&lt;li&gt;Announce a winner (&amp;quot;Player &lt;em&gt;N&lt;/em&gt; wins&amp;quot;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Overview&lt;/h1&gt;&#xA;&lt;p&gt;Each player has a line of six spaces, called &lt;em&gt;houses&lt;/em&gt;, and one additional space called a &lt;em&gt;store&lt;/em&gt;. Each space holds &lt;em&gt;seeds&lt;/em&gt;, which move from house to house in a counter-clockwise direction. The objective is to fill your store with seeds.&lt;/p&gt;&#xA;&lt;p&gt;You must represent the board in the following two-row format with stores offset, where &lt;code&gt;HH&lt;/code&gt; is a house and &lt;code&gt;SS&lt;/code&gt; is a store:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;SS HH HH HH HH HH HH&#xA;   HH HH HH HH HH HH SS&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The top row represents the number of seeds in player #1's spaces, and the bottom row represents the seeds in player #2's spaces. The &lt;code&gt;S&lt;/code&gt; in each row is the respective player's store (player #1's is top-left, #2's is bottom right). Single-digit values should include a leading space.&lt;/p&gt;&#xA;&lt;p&gt;In this challenge, user-input will identify each house numerically. Use a left-to-right, indexed-from-one scheme for both sides:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;S 1 2 3 4 5 6&#xA;  1 2 3 4 5 6 S&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that the players' stores are not numbered, because seeds placed in the store never move out.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;Wikipedia has a &lt;a href=&quot;https://en.wikipedia.org/wiki/Kalah&quot; rel=&quot;nofollow noreferrer&quot;&gt;good summary of the game and its rules&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;At the beginning of the game, three seeds are placed in each house.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each player controls the six houses and their seeds on his/her side of the board. His/her score is the number of seeds in the store to his/her right. [Clarification: from our perspective, player 1's store is to the left, player 2's store is to the right.]&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Players take turns sowing their seeds. On a turn, the player removes all seeds from one of the houses under his/her control. Moving counter-clockwise, the player drops one seed in each house in turn, including the player's own store but not his/her opponent's.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the last sown seed lands in the player's store, the player gets an additional move. There is no limit on the number of moves a player can make in his/her turn.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the last sown seed lands in an empty house owned by the player, and the opposite house contains seeds, both the last seed and the opposite seeds are captured and placed into the player's store. [Clarification: moves that end on an &lt;em&gt;opponent's&lt;/em&gt; empty house end normally without a capture.]&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When one player no longer has any seeds in any of his/her houses, the game ends. The other player moves all remaining seeds to his/her store, and the player with the most seeds in his/her store wins.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&lt;p&gt;(Parenthetical text should not appear in actual output.)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Player 1&#xA; 0  3  3  3  3  3  3&#xA;    3  3  3  3  3  3  0&#xA;&amp;gt; 2                      (prompt arrow and line break&#xA;                          are purely optional)&#xA; Player 2&#xA; 1  1  0  3  3  3  3&#xA;    4  3  3  3  3  3  0&#xA;&amp;gt; 4&#xA;&#xA;Player 2  (P2 gets a bonus turn from rule #4)&#xA; 1  0  3  3  3  3  3&#xA;    4  3  3  0  4  4  1&#xA;&amp;gt; 5&#xA;&#xA;Player 1  &#xA; 1  0  3  3  3  4  4&#xA;    4  3  3  0  0  5  2&#xA;&amp;gt; 4&#xA;&#xA;Player 1  (P1 captures P2's seeds in space 1)&#xA; 6  0  4  4  0  4  4&#xA;    0  3  3  0  0  5  2&#xA;...&#xA;&#xA;Player 2&#xA;12  0  0 10  0  1  0&#xA;    0  0  0  0  0  1 13&#xA; &amp;gt; 6&#xA;&#xA;Player 1 wins            (because the non-finishing players gets&#xA;                          all remaining seeds on their side, it's 23-14)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;Meta question:&lt;/strong&gt; Would this be improved by removing some of the rules?&lt;/p&gt;&#xA;" OwnerUserId="7796" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-01-30T00:22:15.720" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="928" PostTypeId="1" AcceptedAnswerId="929" CreationDate="2014-01-30T09:09:17.633" Score="9" ViewCount="315" Body="&lt;p&gt;If we look at the &lt;a href=&quot;http://area51.stackexchange.com/proposals/4570/code-golf-programming-puzzles&quot;&gt;Area 51 page for  Programming Puzzles &amp;amp; Code Golf on SE&lt;/a&gt;  it looks that has all it takes to graduate:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/QU8Y1.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then why is  Programming Puzzles &amp;amp; Code Golf page on SE still in beta ?&lt;/p&gt;&#xA;" OwnerUserId="12328" LastActivityDate="2016-02-11T11:04:11.797" Title="Why is Programming Puzzles &amp; Code Golf page on SE still in beta?" Tags="|discussion|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="929" PostTypeId="2" ParentId="928" CreationDate="2014-01-30T13:08:09.050" Score="8" Body="&lt;p&gt;I'm guessing it's &lt;em&gt;probably&lt;/em&gt; because we only have 3 users with 10k rep or more. And only 10ks can vote to delete (on non-beta sites). So since it takes 3 votes to delete a post, that means that those users &lt;strong&gt;all&lt;/strong&gt; have to vote to delete the same post for it to be deleted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(And we don't even have any 20k users!)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Oh, and PPCG is... &lt;em&gt;special&lt;/em&gt;. The answer ratio is pretty moot since code golf questions get tons of answers naturally anyway, and % answered is irrelevant for the same reason. The answer to &quot;when will we get out of beta&quot; is usually &quot;when you're ready,&quot; and I don't think we're ready yet.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="3808" LastEditDate="2014-01-30T13:19:49.353" LastActivityDate="2014-01-30T13:19:49.353" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="931" PostTypeId="1" CreationDate="2014-01-31T14:34:35.487" Score="3" ViewCount="47" Body="&lt;p&gt;There's been a couple of instances recently of people taking a question that's just been asked and answered and re-asking the question with a different winning criterion. Can we (or should we) close these as duplicates?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's already a tendency here to take a question that's been popular and rehash it numerous times with barely significant variations. To use a (probably poor) analogy - it's like watching a film and then watching the director's cut (156 seconds of previously unseen footage!) immediately afterwards.&lt;/p&gt;&#xA;" OwnerUserId="737" LastActivityDate="2014-01-31T14:34:35.487" Title="Duplicates with different tag" Tags="|discussion|" AnswerCount="0" CommentCount="1" ClosedDate="2014-02-01T08:32:26.620" ContentLicense="CC BY-SA 3.0" />
  <row Id="932" PostTypeId="2" ParentId="924" CreationDate="2014-01-31T17:34:54.637" Score="7" Body="&lt;p&gt;To answer the follow-up:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The way to discourage non-answers is twofold. Firstly, yes, downvote them. Secondly, if they're unoriginal and clearly not good-faith attempts to answer the question, there's a flag option for &quot;Not an answer&quot;. That brings them to the attention of the moderators for nuking or conversion to a comment.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-01-31T17:34:54.637" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="934" PostTypeId="2" ParentId="9" CreationDate="2014-02-01T11:20:13.223" Score="8" Body="&lt;p&gt;I was thinking about this a lot, since the esoteric languages like APL, GolfScript, J, ... always win and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/286/j-and-golfscript-suck-all-the-enjoyment-out-of-code-golf?lq=1&quot;&gt;suck out the enjoyment out of CodeGolf&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's not fair because these languages were created just for the challenge.&lt;/li&gt;&#xA;&lt;li&gt;In many cases, they use non-ascii characters to &quot;compress&quot; source code (Sclipting, APL)&lt;/li&gt;&#xA;&lt;li&gt;For me it's fun is to see a surprisingly short code or a trick in language which I use for serious things, not a squeezed code of some esoteric language, even if it's shorter, because that's not surprise - you already expected it, the language was created for that.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;So I think it makes perfect sense to make specific challenges for non-esoteric languages only. It could bring the enjoyment back!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Back to the definition. Basicly, esoteric language is a language that is not normally used for any real bussiness and was created just for challenges. More objective criteria for what esoteric language could be:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is listed in &lt;a href=&quot;http://esolangs.org/wiki/Language_list&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esoteric language list&lt;/a&gt; - with the exception of PERL and perhaps other mistakes.&lt;/li&gt;&#xA;&lt;li&gt;It doesn't have a tag on StackOverflow with at least 2000 questions.&lt;/li&gt;&#xA;&lt;li&gt;Is not part of any standard OS release (meant as an exception for small standard tools like &lt;code&gt;awk&lt;/code&gt;, &lt;code&gt;sed&lt;/code&gt;, &lt;code&gt;dc&lt;/code&gt; etc. even if they don't have enough questions at SO).&lt;/li&gt;&#xA;&lt;li&gt;Uses non-ASCII characters.&lt;/li&gt;&#xA;&lt;li&gt;Yours &lt;em&gt;&quot;Can you find at least a project using that language on the web?&quot;&lt;/em&gt; is a very good idea,  but there might be very alternative and very esoteric projects too... &lt;/li&gt;&#xA;&lt;li&gt;You can also name specific languages you are &lt;em&gt;sure&lt;/em&gt; you want to exclude just to prevent finding a hole in the rules :-)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Other ideas to develop (just brainstorming):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is not used for teamwork programming of products that other people use.&lt;/li&gt;&#xA;&lt;li&gt;Is not used for products other people pay for.&lt;/li&gt;&#xA;&lt;li&gt;Majority of operations use postfix notation and take operands implicitly from a stack.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="2800" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2014-02-01T19:26:53.017" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="935" PostTypeId="1" AcceptedAnswerId="936" CreationDate="2014-02-01T13:23:25.943" Score="0" ViewCount="27" Body="&lt;p&gt;On my Preferences page, under &lt;em&gt;Favorite Tags&lt;/em&gt; and &lt;em&gt;Ignored Tags&lt;/em&gt;, there is only an &lt;em&gt;Add&lt;/em&gt; button -- so, if a tag is Added to either of these, how can it later be removed?&lt;/p&gt;&#xA;" OwnerUserId="3440" LastActivityDate="2014-02-01T13:24:22.993" Title="How to remove an &quot;ignored&quot; or &quot;favorite&quot; tag?" Tags="|support|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="936" PostTypeId="2" ParentId="935" CreationDate="2014-02-01T13:24:22.993" Score="2" Body="&lt;p&gt;Next to each tag in the list, there's a cross symbol. Click.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-02-01T13:24:22.993" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="938" PostTypeId="2" ParentId="286" CreationDate="2014-02-01T20:25:57.357" Score="5" Body="&lt;p&gt;I am feeling exactly the same way! Getting beaten by Golfscript etc. all the time, I think I will give up soon.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's not fair because these languages were created just for the challenge, to be brief.&lt;/li&gt;&#xA;&lt;li&gt;In many cases, they use non-ascii characters to &quot;compress&quot; source code (Sclipting, APL)&lt;/li&gt;&#xA;&lt;li&gt;For me it's fun is to see a surprisingly short code or a trick in language which I use for serious things, not a squeezed code of some esoteric language, even if it's shorter, because that's not surprise - you already expected it, the language was created for that.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The solution would be to make specific challenges for non-esoteric languages only. It could bring the enjoyment back!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For this to happen, there should be a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9/2800&quot;&gt;definition of what esoteric language is&lt;/a&gt;. Basicly, esoteric language is a language that is not normally used for any real bussiness and was created just for challenges. More objective criteria for what esoteric language could be:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is listed in &lt;a href=&quot;http://esolangs.org/wiki/Language_list&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esoteric language list&lt;/a&gt; - with the exception of PERL and perhaps other mistakes.&lt;/li&gt;&#xA;&lt;li&gt;It doesn't have a tag on StackOverflow with at least 2000 questions.&lt;/li&gt;&#xA;&lt;li&gt;Is not part of any standard OS release (meant as an exception for small standard tools like &lt;code&gt;awk&lt;/code&gt;, &lt;code&gt;sed&lt;/code&gt;, &lt;code&gt;dc&lt;/code&gt; etc. even if they don't have enough questions at SO).&lt;/li&gt;&#xA;&lt;li&gt;Uses non-ASCII characters.&lt;/li&gt;&#xA;&lt;li&gt;Yours &lt;em&gt;&quot;Can you find at least a project using that language on the web?&quot;&lt;/em&gt; is a very good idea,  but there might be very alternative and very esoteric projects too... &lt;/li&gt;&#xA;&lt;li&gt;You can also name specific languages you are &lt;em&gt;sure&lt;/em&gt; you want to exclude just to prevent finding a hole in the rules :-)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Other ideas to develop (just brainstorming):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is not used for teamwork programming of products that other people use.&lt;/li&gt;&#xA;&lt;li&gt;Is not used for products other people pay for.&lt;/li&gt;&#xA;&lt;li&gt;Majority of operations use postfix notation and take operands implicitly from a stack.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="2800" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2014-02-01T20:25:57.357" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="939" PostTypeId="1" CreationDate="2014-02-01T21:20:31.350" Score="6" ViewCount="495" Body="&lt;p&gt;So, here's a long and ugly link to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/manufactoria&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;manufactoria&amp;#39;&quot; rel=&quot;tag&quot;&gt;manufactoria&lt;/a&gt; program (from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/18975/mod-7-in-manufactoria/19795#19795&quot;&gt;this answer&lt;/a&gt;):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://pleasingfungus.com/Manufactoria/?lvl=32&amp;amp;code=g12:2f3;q13:13f5;c14:13f0;c15:12f3;c9:6f2;c9:7f1;c9:8f1;c9:9f1;c10:4f3;c10:5f3;i10:6f5;c10:7f2;c10:9f0;b11:3f2;p11:4f1;c11:5f1;p11:6f2;p11:7f2;c11:8f3;p11:9f3;b11:10f2;c12:3f2;c12:4f2;c12:5f0;r12:6f3;c12:7f3;i12:8f1;i12:9f5;y12:10f3;c13:3f2;c13:4f3;i13:5f1;c13:6f3;c13:7f2;i13:8f0;c13:9f1;c14:3f3;c14:4f2;p14:5f5;c14:6f1;p14:7f6;p14:8f7;r14:9f3;c15:4f3;q15:5f0;c15:6f3;c15:7f3;i15:8f6;c15:9f3;q15:10f7;c15:11f3;r12:12f2;p13:12f7;b14:12f0;b14:11f3;b12:11f3;y14:10f3;y15:13f0;&amp;amp;ctm=Mod7;Input:_binary_number_big_endian._Output:_that_binary_number_mod_7;bbb:%7Cbrrr:b%7Cbrrrr:br%7Cbb:bb%7Cbbrrb:brr%7Cbrrrrb:brb%7Cbbrb:bbr;13;3;1;&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://pleasingfungus.com/Manufactoria/?lvl=32&amp;amp;code=g12:2f3;q13:13f5;c14:13f0;c15:12f3;c9:6f2;c9:7f1;c9:8f1;c9:9f1;c10:4f3;c10:5f3;i10:6f5;c10:7f2;c10:9f0;b11:3f2;p11:4f1;c11:5f1;p11:6f2;p11:7f2;c11:8f3;p11:9f3;b11:10f2;c12:3f2;c12:4f2;c12:5f0;r12:6f3;c12:7f3;i12:8f1;i12:9f5;y12:10f3;c13:3f2;c13:4f3;i13:5f1;c13:6f3;c13:7f2;i13:8f0;c13:9f1;c14:3f3;c14:4f2;p14:5f5;c14:6f1;p14:7f6;p14:8f7;r14:9f3;c15:4f3;q15:5f0;c15:6f3;c15:7f3;i15:8f6;c15:9f3;q15:10f7;c15:11f3;r12:12f2;p13:12f7;b14:12f0;b14:11f3;b12:11f3;y14:10f3;y15:13f0;&amp;amp;ctm=Mod7;Input:_binary_number_big_endian._Output:_that_binary_number_mod_7;bbb:|brrr:b|brrrr:br|bb:bb|bbrrb:brr|brrrrb:brb|bbrb:bbr;13;3;1;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And here's the exact same link, but with a nice human-readable link text:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://pleasingfungus.com/Manufactoria/?lvl=32&amp;amp;code=g12:2f3;q13:13f5;c14:13f0;c15:12f3;c9:6f2;c9:7f1;c9:8f1;c9:9f1;c10:4f3;c10:5f3;i10:6f5;c10:7f2;c10:9f0;b11:3f2;p11:4f1;c11:5f1;p11:6f2;p11:7f2;c11:8f3;p11:9f3;b11:10f2;c12:3f2;c12:4f2;c12:5f0;r12:6f3;c12:7f3;i12:8f1;i12:9f5;y12:10f3;c13:3f2;c13:4f3;i13:5f1;c13:6f3;c13:7f2;i13:8f0;c13:9f1;c14:3f3;c14:4f2;p14:5f5;c14:6f1;p14:7f6;p14:8f7;r14:9f3;c15:4f3;q15:5f0;c15:6f3;c15:7f3;i15:8f6;c15:9f3;q15:10f7;c15:11f3;r12:12f2;p13:12f7;b14:12f0;b14:11f3;b12:11f3;y14:10f3;y15:13f0;&amp;amp;ctm=Mod7;Input:_binary_number_big_endian._Output:_that_binary_number_mod_7;bbb:%7Cbrrr:b%7Cbrrrr:br%7Cbb:bb%7Cbbrrb:brr%7Cbrrrrb:brb%7Cbbrb:bbr;13;3;1;&quot; rel=&quot;nofollow noreferrer&quot;&gt;See, this looks much nicer, doesn't it?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The only problem is, that second link doesn't work. :-(&lt;/p&gt;&#xA;&lt;p&gt;Why not?  Because, apparently, if you use the nicer Markdown link syntax, the Stack Exchange Markdown parser insists on percent-encoding the colons (&lt;code&gt;:&lt;/code&gt;) in the query parameters to &lt;code&gt;%3A&lt;/code&gt;, and the Manufactoria program is not smart enough to decode them.&lt;/p&gt;&#xA;&lt;p&gt;Admittedly, &lt;em&gt;both&lt;/em&gt; programs are in violation of &lt;a href=&quot;//en.wikipedia.org/wiki/Robustness_principle&quot; rel=&quot;nofollow noreferrer&quot;&gt;Postel's law&lt;/a&gt; (&amp;quot;Be conservative in what you send, and liberal in what you accept.&amp;quot;) here, but the fact that a random Flash game is &lt;em&gt;also&lt;/em&gt; buggy doesn't excuse not fixing bugs in Stack Exchange's Markdown parser.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Besides, it seems to me that the SE behavior doesn't violate just Postel's law (which, while a good principle to follow, is not an official standard), but also &lt;a href=&quot;https://www.rfc-editor.org/rfc/rfc3986&quot; rel=&quot;nofollow noreferrer&quot;&gt;RFC 3986&lt;/a&gt;, which, in section 2.2, defines &lt;code&gt;:&lt;/code&gt; as a &amp;quot;reserved character&amp;quot; and says:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&amp;quot;URIs that differ in the replacement of a reserved character with its corresponding percent-encoded octet are not equivalent.  Percent-encoding a reserved character, or decoding a percent-encoded octet that corresponds to a reserved character, will change how the URI is interpreted by most applications.&amp;quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Thus, strictly speaking, Manufactoria is perfectly within its rights in treating &lt;code&gt;:&lt;/code&gt; and &lt;code&gt;%3A&lt;/code&gt; as different characters in query strings (even if 99.9% of all other software on the web probably don't), whereas what Stack Exchange is doing by encoding colons in already-composed URIs is nor just pointless — it's also a plain violation of the relevant Internet standards.&lt;/p&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="-1" LastEditDate="2021-10-07T06:47:20.403" LastActivityDate="2021-06-04T10:00:48.597" Title="Markdown [link](url) syntax mangles colons in URLs" Tags="|bug|status-completed|markdown|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="940" PostTypeId="2" ParentId="547" CreationDate="2014-02-01T21:35:46.097" Score="1" Body="&lt;p&gt;Create a picture, like in this challenge :-)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/19801/2800&quot;&gt;Make a PNG image with &amp;quot;Hello World!&amp;quot; with programming APIs, in the shortest code possible&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Generally anything that is related to the fact that obscure languages are not used in real practice and thus don't have support for more complex practical tasks.&lt;/p&gt;&#xA;" OwnerUserId="2800" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-02-01T21:35:46.097" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="941" PostTypeId="1" AcceptedAnswerId="1300" CreationDate="2014-02-02T14:37:20.803" Score="-8" ViewCount="309" Body="&lt;p&gt;The objective is to &lt;em&gt;create&lt;/em&gt; the code as fast as possible. How this could work is the questioner would first post a UTC time and date (in the near future, e.g. 24-48 hours), and possibly a topic. They would then write an edit to the post that would explain what the code should accomplish, and submit the edit at the specified time. The first answer/revision of an answer that satisfies all the requirements would be the winner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thoughts? Suggestions?&lt;/p&gt;&#xA;" OwnerUserId="11066" LastEditorUserId="11066" LastEditDate="2014-02-02T18:09:55.667" LastActivityDate="2014-03-19T18:31:16.467" Title="New challenge type: Speed Code" Tags="|discussion|new-genre|" AnswerCount="2" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="942" PostTypeId="1" CreationDate="2014-02-02T15:25:38.703" Score="14" ViewCount="1575" Body="&lt;p&gt;The blurb on the code-golf tag specifies &quot;the fewest &lt;em&gt;bytes&lt;/em&gt; of source code&quot; (as it should, in my opinion). &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a question overrides &lt;em&gt;byte&lt;/em&gt;-count as the criterion, using &lt;em&gt;character&lt;/em&gt;-count instead, is it still code-golf? (Should the code-golf tag still be used?) &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;For a given character-count&lt;/em&gt;, source code using multibyte characters would seem potentially more expressive than source code confined to single-byte characters -- simply due to the enlarged symbol set available for the language definition.  &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Doesn't the use of character-count as the criterion give a distinct advantage to languages like APL, Sclipting, etc., whose source code requires multibyte characters?  Wouldn't byte-count be more comparable across all languages? &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Examples where this matters: &#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/19509/3440&quot;&gt;APL&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/19229/3440&quot;&gt;Sclipting&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="3440" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2014-03-22T19:50:56.620" Title="Scoring code golf (bytes vs. characters)" Tags="|discussion|" AnswerCount="4" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="943" PostTypeId="2" ParentId="922" CreationDate="2014-02-02T20:07:21.183" Score="2" Body="&lt;p&gt;You can't migrate posts that are &lt;a href=&quot;https://meta.stackexchange.com/questions/151890/disable-migration-for-questions-older-than-60-days&quot;&gt;more than 60 days old&lt;/a&gt;... Judging by &lt;a href=&quot;https://stackoverflow.com/search?q=%5Bcode-golf%5D+created%3A..2013+is%3Aquestion&quot;&gt;this query&lt;/a&gt; that means that 98.2% of all (undeleted) questions tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; on Stack Overflow are ineligible for migration.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of the 4 that are eligible for migration 3 had nothing to do with golfing (&lt;a href=&quot;https://stackoverflow.com/questions/21316378/projecting-an-n-dimensional-array-to-1-d&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://stackoverflow.com/questions/21228761/trying-to-simplify-this-javascript-function&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://stackoverflow.com/questions/20508159/altering-a-list-using-append-during-a-list-comprehension&quot;&gt;3&lt;/a&gt;) so I've removed the tag. This means that there's &lt;a href=&quot;https://stackoverflow.com/questions/21128929/compress-ascii-to-unicode-python&quot;&gt;1 question&lt;/a&gt;, which might be on-topic (I'm not 100%) and it's asking for help rather than posing a challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you're serious about migrating questions from Stack Overflow you'll need to be organised. Have a feed of all questions tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;; remove the tag, if it's not applicable and flag using the &quot;other&quot; option if you want it migrated. You have to do this before it gets downvoted and deleted, which can be extremely quick (not that I have any idea of the proportion of questions that this happens to with this tag.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To be honest, I'd be quite surprised if you got many good new questions out of Stack Overflow...&lt;/p&gt;&#xA;" OwnerUserId="3419" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2014-02-02T20:07:21.183" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="945" PostTypeId="2" ParentId="2140" CreationDate="2014-02-02T21:47:29.917" Score="0" Body="&lt;p&gt;[This is the first time I'm using the sandbox.  I want to get feedback/suggestions before posting the question.]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Make a spider web (standard, orb type) that fills frame in the ratio of n:m, where n, m are input integers.  You may use the example below as a model (but you don't need to use labels). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/5lxjC.png&quot; alt=&quot;spider web&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your web should have &lt;em&gt;multiple radii&lt;/em&gt;, at least 4 of which attach directly to the frame. The remaining radii should attach to the &lt;em&gt;outer outline&lt;/em&gt; (perimeter) of the web. The web should have at least 15 radii. The mesh spacing should be more or less uniform spacing (although occasional weaving mistakes&quot; or crossings are encouraged and will receive a bonus).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, so the shortest code (minus bonuses) wins.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Bonuses&lt;/strong&gt; (to be removed from the number of characters in your code).  Bonuses are awarded for the following features that reflect the architecture of an actual web (as opposed to a perfectly symmetric rendering).  They are somewhat greater than usual as an incentive for attention to detail and realism.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-mesh spiral instead of concentric circles: 40 pts&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-assymmetric web: 31 pts. (e.g. height of capture area greater than width)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-irregularly spaced radii: 42 pts&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-distinct segments between radii (straight or crooked, but not the arc of a circle): 32 pts&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-outer and inner outline clearly distinct from the spiral: 41 pts&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-irregular outer outline: 20 pts&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-2 or more easily observable reverses in spiral: 40&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The accept will be awarded on Feb. 20, 2014.&lt;/p&gt;&#xA;" OwnerUserId="3967" LastActivityDate="2014-02-02T21:47:29.917" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="946" PostTypeId="1" CreationDate="2014-02-03T00:07:43.780" Score="5" ViewCount="180" Body="&lt;p&gt;I'm a new user at codegolf - (7 reputation)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, I just made 2 questions - with 1 that's got much response and people chatting kindly,&lt;/p&gt;&#xA;&#xA;&lt;p&gt;HOWEVER, people in stack overflow are quite RUDE, giving DOWNVOTE without REASON.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What's going on?&lt;/p&gt;&#xA;" OwnerUserId="15845" LastActivityDate="2014-02-03T12:13:46.807" Title="Why are people in codegolf kinder than stack overflow?" Tags="|discussion|" AnswerCount="1" CommentCount="9" ClosedDate="2016-11-02T18:55:53.393" ContentLicense="CC BY-SA 3.0" />
  <row Id="947" PostTypeId="2" ParentId="946" CreationDate="2014-02-03T01:47:02.887" Score="7" Body="&lt;p&gt;We code-golfers seem to have a moral code that follows various rules, namely the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Code-Golf.SE is used to help mentally challenge and educate others about techniques in code that some of us may not have come across before... Those who want to mentally challenge and educate are often not those who have a rude attitude.&lt;/li&gt;&#xA;&lt;li&gt;We're always happy to help someone improve their golfing score where possible, this in turn adds to the &quot;I help you, you help me&quot; principle we unconsciously abide to here.&lt;/li&gt;&#xA;&lt;li&gt;If we down-vote, we usually give a reason why, (duplicate question, possible trolling, not relevant, etc.) and we will give a reason, only because we want the question to be clear enough or understood enough for us all to participate...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Jamie, on behalf of all of us golfers, we're sorry that others in Overflow are giving you some bad attitude... I hope, and I speak on behalf of us all, that you'll prefer to hang around us more! :)&lt;/p&gt;&#xA;" OwnerUserId="8555" LastEditorUserId="8555" LastEditDate="2014-02-03T12:13:46.807" LastActivityDate="2014-02-03T12:13:46.807" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="949" PostTypeId="1" CreationDate="2014-02-03T17:55:41.040" Score="1" ViewCount="151" Body="&lt;p&gt;I'm pretty sure I've seen a rule against new languages, especially for code golf, somewhere on this site - probably in the Help Center. However, I'm having a hard time finding it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does this rule actually exist? If so, where is the exact page we can reference when citing it?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe I saw some verbiage like &quot;languages used must pre-date the challenge&quot; and &quot;it's an old joke&quot;.&lt;/p&gt;&#xA;" OwnerUserId="9387" LastActivityDate="2014-02-03T18:47:05.827" Title="Where is the rule against new languages specified?" Tags="|discussion|code-golf|rules|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="950" PostTypeId="2" ParentId="949" CreationDate="2014-02-03T18:47:05.827" Score="6" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&quot;languages used must pre-date the challenge&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This has been codified in an old meta question asking &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9/what-programming-language-should-we-consider-for-the-code-golf-solution?answertab=votes#tab-top&quot;&gt;&quot;What programming language should we consider for the code-golf solution?&lt;/a&gt;, where the (by far) top-voted answer simply states, in its entirety:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I think that as long as a compiler was released before the question was asked, it is a valid language. This removes stupid answers such as &quot;I created language X with this command Y that solves this in one character&quot;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;No such rule is present in the tag wiki (it probably should be added), but another clause is already present:&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&quot;it's an old joke&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This originates in the &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;code-golf tag wiki&lt;/a&gt;, where the heading &lt;em&gt;&quot;Things to note&quot;&lt;/em&gt; contains this point:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;The language you use should not be invented just for solving this particular code golf. It's been done, trust us, and the joke is old hat.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Does this rule actually exist [in the Help Center]?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The only page that is site-specific in the help center is &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;/on-topic&lt;/a&gt;. It has a heading for answering and even a heading for code golf in particular, but currently does not specify the language choice criteria anywhere. The points for golfing just include a shortened version of the tag wiki and basically say &quot;strip whitespace and use one-character identifiers * adding an ungolfed version is nice * be sure to include the character count&quot;.&lt;/p&gt;&#xA;" OwnerUserId="7209" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-02-03T18:47:05.827" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="951" PostTypeId="2" ParentId="2140" CreationDate="2014-02-04T18:15:15.640" Score="0" Body="&lt;h2&gt;Write a PHP Code Golfer &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Since my currently daily programming is in PHP, I tend to try the challenges on the site using that language, but frequently I large program because of the verbosity of the language. And then I have to strip it for presentation...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But this is not a tips question, it's an eviscerating challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The objective is to write a program in the language of your choice that takes a PHP file and outputs a golfed valid PHP file with the same functionality.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The scoring will be the average reduction in percent of the result of running the program with 3 selected files (not yet selected, I was thinking of some open source library)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output file should run on at least 5.4 (so shorthand arrays, function dereference, traits are available)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since the score is the difference between the ungolfed and golfed files, techniques beyond minifying are encouraged, such as using code subtitution, eval, compression, $$ (variable variables), dereferencing...&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Scoring example: The 3 sources have 450, 1200 and 3500 chars respectively&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answer 1 &lt;br&gt;&#xA;results lenghts: 250, 1000, 3300 &lt;br&gt;&#xA;reduction: 200, 200, 200 (44%, 17%, 6%) average: 22%&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answer 2 &lt;br&gt;&#xA;results lenghts: 350, 1050, 3150 &lt;br&gt;&#xA;reduction: 100, 150, 350 (22%, 13%, 10%) average: 15%&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this case Answer 1 would win, even tough both answers got the same total reduction (-600 chars)&lt;/p&gt;&#xA;" OwnerUserId="13870" LastEditorUserId="13870" LastEditDate="2014-02-10T18:54:01.223" LastActivityDate="2014-02-10T18:54:01.223" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="952" PostTypeId="2" ParentId="939" CreationDate="2014-02-05T11:11:20.940" Score="2" Body="&lt;h1&gt;Another bug&lt;/h1&gt;&#xA;&lt;p&gt;Markdown also mangles URLs in comments.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/19592/freehand-red-circles#comment40212_20033&quot;&gt;Here's an example.&lt;/a&gt; I posted a &lt;a href=&quot;http://commons.wikimedia.org/wiki/File:Buket_and_spade_on_Killahoey_Strand_-_geograph.org.uk_-_1426946.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;link to Wikimedia Commons&lt;/a&gt; with the following URL:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;http://commons.wikimedia.org/wiki/File:Buket_and_spade_on_Killahoey_Strand_-_geograph.org.uk_-_1426946.jpg&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Unfortunately, Markdown saw the underscore characters either side of &lt;code&gt;geograph.org.uk&lt;/code&gt;, replaced them with &lt;code&gt;&amp;lt;i&amp;gt;&lt;/code&gt; and &lt;code&gt;&amp;lt;/i&amp;gt;&lt;/code&gt;, and then URL encoded the result to produce &lt;a href=&quot;http://commons.wikimedia.org/wiki/File:Buket_and_spade_on_Killahoey_Strand_-%3Ci%3Egeograph.org.uk%3C/i%3E-_1426946.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;this unusable URL&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;http://commons.wikimedia.org/wiki/File:Buket_and_spade_on_Killahoey_Strand_-%3Ci%3Egeograph.org.uk%3C/i%3E-_1426946.jpg&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="11006" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-02-05T11:11:20.940" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="953" PostTypeId="2" ParentId="2140" CreationDate="2014-02-05T17:55:48.503" Score="3" Body="&lt;p&gt;This is my first try at writing a challenge. Please let me know how I can improve it.&lt;/p&gt;&#xA;&lt;h1&gt;Roman Calculator&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Create a basic calculator for Roman numerals.&lt;/p&gt;&#xA;&lt;h3&gt;Requirements&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Supports &lt;code&gt;+&lt;/code&gt;,&lt;code&gt;-&lt;/code&gt;,&lt;code&gt;*&lt;/code&gt;,&lt;code&gt;/&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Input and output should expect only one prefix per symbol (i.e. 3 can't be &lt;code&gt;IIV&lt;/code&gt; because there is two &lt;code&gt;I&lt;/code&gt;'s before &lt;code&gt;V&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Input and output should be left to right in order of value, starting with the largest (i.e. 19 = &lt;code&gt;XIX&lt;/code&gt; not &lt;code&gt;IXX&lt;/code&gt;, 10 is larger than 9)&lt;/li&gt;&#xA;&lt;li&gt;Left to right, no operator precedence, as if you were using a hand calculator.&lt;/li&gt;&#xA;&lt;li&gt;Supports whole positive numbers input/output between 1-4999 (no need for V̅)&lt;/li&gt;&#xA;&lt;li&gt;No libraries that do roman numeral conversion for you&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;For you to decide&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Case sensitivity&lt;/li&gt;&#xA;&lt;li&gt;Spaces or no spaces on input&lt;/li&gt;&#xA;&lt;li&gt;What happens if you get a decimal output. Truncate, no answer, error, etc..&lt;/li&gt;&#xA;&lt;li&gt;What to do for output that you can't handle. Negatives or numbers to large to be printed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Extra Credit&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;-20&lt;/strong&gt; - Handle up to 99999 or larger (numbers with a vinculum)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Sample input/output&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;XIX + LXXX                 (19+80)&#xA;XCIX&#xA;&#xA;XCIX + I / L * D + IV      (99+1/50*500+7)&#xA;MIV&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="2852" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-02-12T13:17:11.807" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="957" PostTypeId="1" AcceptedAnswerId="958" CreationDate="2014-02-06T07:55:44.823" Score="6" ViewCount="139" Body="&lt;p&gt;Recently the sandbox was split into several distinct questions (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/954/proposed-questions-sandbox-mk-viii-code-golf-only&quot;&gt;here&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/955/proposed-questions-sandbox-mk-viii-code-challenge-only&quot;&gt;here&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/956/proposed-questions-sandbox-mk-viii-miscellaneous&quot;&gt;here&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For me it feels confusing and we also have the issue that those sandboxes may be handled differently.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;What if the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; sandbox fills up more quickly? Will we then have different version numbers for each of them?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What if the puzzle changes its type and becomes &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;? Will it have to move?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;It feels even more confusing than a single sandbox with lots of answers (There is the possibility to sort answers by &lt;em&gt;active&lt;/em&gt; and see the most recent changes on the top).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, I'd like to vote to close those sandboxes as duplicates. But before doing that I wanted to ask for some discussion of this issue here.&lt;/p&gt;&#xA;" OwnerUserId="1490" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2014-02-07T17:05:13.213" Title="Having several active sandboxes by tag" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="958" PostTypeId="2" ParentId="957" CreationDate="2014-02-06T13:05:07.167" Score="5" Body="&lt;p&gt;I completely agree. I see absolutely no reason to have separate sandboxes by tags (and the user who has made them has not provided any reason either).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Furthermore, I don't think the user should have simply made this decision without the community's input. This is quite the change from the normal sandbox, and should not have been done so quickly and without a meta post or two about it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have voted to close all of them as a duplicate of the previous sandbox (for lack of a better target).&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-02-06T13:05:07.167" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="959" PostTypeId="1" CreationDate="2014-02-07T04:36:31.640" Score="10" ViewCount="986" Body="&lt;p&gt;I found this neat snippet in &lt;a href=&quot;https://codegolf.stackexchange.com/a/2499/668&quot;&gt;this answer&lt;/a&gt;: &lt;code&gt;$('pre').css('line-height',1)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There, Timwi suggests running it in the browser's console to make ascii art look better. It definitely improves the look of several questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245/print-a-random-maze&quot;&gt;Print a random maze&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/1530/draw-a-suanpan-abacus&quot;&gt;Draw a Suanpan abacus&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I'm suggesting that maybe we can add that statement to the tag wiki excerpt, so that other people might find it.&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:21.580" LastActivityDate="2014-05-11T01:14:01.970" Title="Add line-height shortener to the ascii-art tag" Tags="|discussion|" AnswerCount="2" CommentCount="3" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="960" PostTypeId="2" ParentId="942" CreationDate="2014-02-07T11:31:57.343" Score="6" Body="&lt;p&gt;I don’t mind whether the criterion is bytes or characters for individual challenges. I believe that the challenge author should be free to decide this. The answerer should also be free to mention both the byte or character count, and upvoters should (and are) free to upvote whatever they want.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What I &lt;em&gt;would&lt;/em&gt; object to is if the community were to attempt to impose criteria or restrictions that make no sense. For example, the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; info page &lt;em&gt;used to&lt;/em&gt; state that Unicode characters should be encoded as UTF-8. I edited this (and my edit was apparently accepted by the reviewers) because, well, why shouldn’t I be allowed to use a language that understands UTF-16, or DOS codepage 437 or any other character encoding? Why is this choice more controversial than choosing to write in GolfScript or J?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, personally I try not to take it all too seriously. We are here to have fun and to play games, not to fight a war of ideology. If it were vitally important that I minimize the byte count in every entry I post here, I could easily write an interpreter that understands a variety of golfy languages encoded as gzip or arithmetic encoding. That would win the challenge on pure byte count, but it would be boring and it would take away from the fun that this site represents.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I left the site in 2011 out of frustration with GolfScript and J, but I came back because I have learnt to take it less seriously. I now upvote answers in any language, including GolfScript, whether they are short or simply clever or interesting, and my hope is that some people would find it in their heart to do the same and not take Sclipting too seriously.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By the way, the objection against Sclipting is ironic because &lt;em&gt;even when counting characters instead of bytes, GolfScript beats Sclipting most of the time&lt;/em&gt;. I don’t know if that’s because Sclipting is somehow badly designed or I’m just not clever enough to write really short programs in it, but either way, it’s not important. To me, what’s important is that we all have fun, and I’m having fun writing programs in Sclipting (or even &lt;a href=&quot;https://codegolf.stackexchange.com/a/2499/668&quot;&gt;Funciton&lt;/a&gt;, which is grossly unsuitable for golfing :) ).&lt;/p&gt;&#xA;" OwnerUserId="668" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2014-02-07T14:15:37.967" CommentCount="16" ContentLicense="CC BY-SA 3.0" />
  <row Id="961" PostTypeId="2" ParentId="942" CreationDate="2014-02-07T14:29:31.733" Score="16" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;If a question overrides byte-count as the criterion, using character-count instead, is it still code-golf? (Should the code-golf tag still be used?)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Without actually checking, I believe that there are quite a few legacy questions which do this. I think it's reasonable to permit it in general (although in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; questions it makes no sense to allow anything other than bytes).&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;For a given character-count, source code using multibyte characters would seem potentially more expressive than source code confined to single-byte characters -- simply due to the enlarged symbol set available for the language definition.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;That's the case with e.g. Whitespace or BF vs languages with more usable characters. It has been discussed &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/546/194&quot;&gt;elsewhere on meta&lt;/a&gt; in the context of those languages. The conclusion has been that they have a disadvantage and that's just tough for them.&lt;/p&gt;&#xA;&lt;h3&gt;Proposal&lt;/h3&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; tag wiki as edited by Timwi says that a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question &amp;quot;must include&amp;quot;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;7. Whether the number of &lt;em&gt;characters&lt;/em&gt; or &lt;em&gt;bytes&lt;/em&gt; in the source count.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is a horrible change. To bring all the legacy questions up to date with this requirement would bring chaos to the site and completely bury recent substantive changes.&lt;/p&gt;&#xA;&lt;p&gt;I propose rolling back to revision 2 of the tag wiki and then changing it to say that&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;If&lt;/em&gt; the question should be scored on characters rather than bytes then it should say so&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, unless the question specifies a character encoding to be used for scoring, answers which use characters outside Unicode code points 0 to 255 should state the encoding used (and should include any penalty for flags / BOM required to get the interpreter/compiler to recognise that that encoding is used).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The latter point may affect APL, but shouldn't affect the many answers in various languages which use ISO-8859-1 encoding for zipped data.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Update&lt;/strong&gt; As this was the most upvoted answer, no-one objected to the proposal, and there have been a few days of inactivity around the question, I've made the change.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-02-12T09:34:05.590" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="962" PostTypeId="2" ParentId="959" CreationDate="2014-02-07T17:00:52.443" Score="3" Body="&lt;p&gt;Unfortunately the snippet changes &lt;em&gt;every&lt;/em&gt; &lt;code&gt;&amp;lt;pre&amp;gt;&lt;/code&gt; tag, which is not always appropriate (it makes genuine source code harder to read, which is why the line-spacing exists in the first place). You can, of course, add &lt;code&gt;javascript:&lt;/code&gt; in front and use it as a bookmarklet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The ideal solution would be to have something like the already existing &lt;code&gt;&amp;lt;!-- language: lang-javascript --&amp;gt;&lt;/code&gt; but for ASCII-art. However, I highly doubt that we can get the site developers to add that feature...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, regarding your suggestion of adding it to the tag wiki excerpt just for informational purposes, sure, we could do that. (I’m currently a bit wary of doing it myself because some users here seem to react negatively to that, so I’ll wait until this thread looks like concensus.)&lt;/p&gt;&#xA;" OwnerUserId="668" LastEditorUserId="668" LastEditDate="2014-02-07T17:37:31.537" LastActivityDate="2014-02-07T17:37:31.537" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="964" PostTypeId="2" ParentId="388" CreationDate="2014-02-08T00:35:18.077" Score="-1" Body="&lt;p&gt;I would suggest making the judgement be the minimum number of assembly/JVM commands actually ran to solve it (might be harder to judge, but I'm pretty sure that there has to be a tool out there to judge that). Speed can easily be judged from measuring that.&lt;/p&gt;&#xA;" OwnerUserId="14668" LastActivityDate="2014-02-08T00:35:18.077" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="965" PostTypeId="2" ParentId="9" CreationDate="2014-02-08T04:25:00.093" Score="1" Body="&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt; I removed the Bash version (it was buggy and I couldn't seem to fix it), and I updated the C/C++ version (now identical) due to a better implementation in the comments. I also added equivalents in several other languages.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I have a list of minified implementations of the greatest common divisor operation in several different languages. Maybe this can influence some of this discussion.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ANSI C/C++:&#xA;int a(int b,int c){return c?a(c,b%c):b;}&#xA;&#xA;K&amp;amp;R C: (permits implicit `int` types)&#xA;a(b,c){return c?a(c,b%c):b;}&#xA;&#xA;Common Lisp:&#xA;(defun a(b c)(if(zerop c)b(a c(mod b c))))&#xA;&#xA;ECMAScript 5:&#xA;function a(b,c){return c?a(c,b%c):b}&#xA;&#xA;ECMAScript 6: (uses implicit global)&#xA;a=(b,c)=&amp;gt;c?a(c,b%c):b&#xA;&#xA;Forth:&#xA;: g begin ?dup while tuck mod repeat ;&#xA;&#xA;GolfScript:&#xA;~{.@\%.}do;&#xA;&#xA;Java:&#xA;int a(int b,int c){return c&amp;gt;0?a(c,b%c):b;}&#xA;&#xA;Haskell:&#xA;g a b=if a &amp;gt; 0 then g(b `rem` a)a else b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So, here's the stats for each of those examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Common Lisp: 42&lt;/li&gt;&#xA;&lt;li&gt;ANSI C/C++: 40&lt;/li&gt;&#xA;&lt;li&gt;K&amp;amp;R C: 28&lt;/li&gt;&#xA;&lt;li&gt;ES5: 36&lt;/li&gt;&#xA;&lt;li&gt;ES6: 21&lt;/li&gt;&#xA;&lt;li&gt;Forth: 38&lt;/li&gt;&#xA;&lt;li&gt;GolfScript: 11&lt;/li&gt;&#xA;&lt;li&gt;Java: 42 &lt;/li&gt;&#xA;&lt;li&gt;Haskell: 40&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="14668" LastEditorUserId="903" LastEditDate="2015-09-08T15:00:28.843" LastActivityDate="2015-09-08T15:00:28.843" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="966" PostTypeId="1" AcceptedAnswerId="968" CreationDate="2014-02-08T15:23:51.587" Score="1" ViewCount="90" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/16165/saga12&quot;&gt;This user&lt;/a&gt; is suspendend for rule violations. But why? I don't see anything wrong. The user has some downvoted questions, but poor questions should lead to a question ban, not to a suspension.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, why is this user suspended?&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-02-08T21:47:23.913" Title="Rule violations?" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="967" PostTypeId="1" AcceptedAnswerId="969" CreationDate="2014-02-08T15:26:52.170" Score="5" ViewCount="90" Body="&lt;p&gt;I think I have detected a case of sockpuppetry, and have already flagged one of the posts asking for moderator action but this has not occurred.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How could we go about fixing this? I've already flagged a post of his as &quot;other,&quot; but our three moderators have not been seen for 40 minutes, 3 hours, and a day.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="78" LastEditDate="2014-02-08T16:44:56.077" LastActivityDate="2014-02-08T17:55:30.627" Title="How do I respond to a suspected sockpuppet situation" Tags="|support|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="968" PostTypeId="2" ParentId="966" CreationDate="2014-02-08T15:30:30.020" Score="4" Body="&lt;p&gt;How coincidental; I just posted a meta post on this: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/967/3808&quot;&gt;How do I respond to a suspected sockpuppet situation&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/16123/utkarsh-asian-verma&quot;&gt;This&#xA;  user&lt;/a&gt;&#xA;  is violating the rules - he is asking a bunch of terrible questions&#xA;  with these two sockpuppets:&#xA;  &lt;a href=&quot;https://codegolf.stackexchange.com/users/16137/user16137&quot;&gt;A&lt;/a&gt;,&#xA;  &lt;a href=&quot;https://codegolf.stackexchange.com/users/16165/saga12&quot;&gt;B&lt;/a&gt;. Notice that&#xA;  the sockpuppets I linked have 3 and 4 questions respectively, each of&#xA;  which has been answered by this user (and accepted).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That user is a sockpuppet. Frankly, I'm suprised it still exists at all; I think it should be nuked.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-02-08T15:30:30.020" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="969" PostTypeId="2" ParentId="967" CreationDate="2014-02-08T16:49:28.587" Score="5" Body="&lt;p&gt;I can't speak to the other moderators, but I have been keeping an eye on the current situation. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The usual sanctions for sockpuppetry are difficult to reverse,&lt;sup&gt;1&lt;/sup&gt; so I don't take them lightly or apply them without pretty good evidence. This can result in a delay. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moderators have various tools not available to the ordinary users, and we look for pretty strong evidence before acting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the mean time, less sophisticated cheaters often post hasty or ill-prepared material when trying to boost their score through sockpuppetry, so a short-term action is to treat that content like, well, hasty or ill-prepared material. The big advantage of this strategy is that applied uniformly is promotes quality on the site regardless of the reality of the sockpuppet claim.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; Most moderator actions can be reversed---in many cases this makes it as if they never happened, which lets us take a &lt;em&gt;&quot;due diligence and take your best guess&quot;&lt;/em&gt; approach to applying them. A few drastic action taken on accounts are difficult or even impossible to reverse. We try not to make mistakes with those.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="78" LastEditDate="2014-02-08T17:55:30.627" LastActivityDate="2014-02-08T17:55:30.627" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="970" PostTypeId="2" ParentId="959" CreationDate="2014-02-08T21:42:00.410" Score="8" Body="&lt;p&gt;While &lt;code&gt;line-height: 1&lt;/code&gt; does tend to look pretty tight for normal source code, something like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;pre { line-height: 1.1 }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;pre { line-height: 1.2 }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;ought to strike a pretty good compromise between code and ASCII art readability.  Thus, I would support (and, indeed, was just about to post a request for) adding this style to our CSS site-wide.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;To evaluate the effects of this proposal, I took a couple of more or less representative screenshots of both ASCII art and code at various line-height settings.  All these screenshots are taken using Chrome 32 on Windows 7.  The ASCII art examples are from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4356/say-hello-to-the-world-in-ascii-art&quot;&gt;here&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/997/render-digital-clock-style-numbers/2499#2499&quot;&gt;here&lt;/a&gt;, while the code is from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/997/render-digital-clock-style-numbers/1010#1010&quot;&gt;here&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Line-height: 1.4&lt;/strong&gt; (current):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Kdjyj.png&quot; alt=&quot;enter image description here&quot;&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/tGKla.png&quot; alt=&quot;enter image description here&quot;&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/MqluS.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Line-height: 1.2&lt;/strong&gt; (proposed):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/wFssg.png&quot; alt=&quot;enter image description here&quot;&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/HONHu.png&quot; alt=&quot;enter image description here&quot;&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/63eaU.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Line-height: 1.1&lt;/strong&gt; (alt. proposal):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/93K9M.png&quot; alt=&quot;enter image description here&quot;&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/qtxLj.png&quot; alt=&quot;enter image description here&quot;&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/V8vXt.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Line-height: 1.0&lt;/strong&gt; (comparison):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/3MmiU.png&quot; alt=&quot;enter image description here&quot;&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/26WwN.png&quot; alt=&quot;enter image description here&quot;&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/ZANN9.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Based on this quick test, it appears that &lt;code&gt;line-height: 1.1&lt;/code&gt; is close to optimal for ASCII art; at &lt;code&gt;line-height: 1&lt;/code&gt; the line-drawing characters in the second example actually start to overlap a bit.  Both &lt;code&gt;1.1&lt;/code&gt; and &lt;code&gt;1.2&lt;/code&gt; do look reasonably readable for both ASCII art and code, whereas the current &lt;code&gt;line-height: 1.4&lt;/code&gt; looks absolutely awful for ASCII art, yet not much (if at all) better than &lt;code&gt;1.2&lt;/code&gt; for code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Besides, keep in mind that the code sample above isn't really all that representative &amp;mdash; a large proportion of the code on this site looks more like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4356/say-hello-to-the-world-in-ascii-art/20382#20382&quot;&gt;this&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;,;._1'A',' _|\/A()V`,'''{~+/;._1]0,,(6$2)#:-&amp;amp;40]3 u:'8H1(((((H:f[4ZS4ZP2(RPMAMANf[&amp;gt;CZD[F;I[OVFF;TgfS5aGd[7T9JW4[eG[+Of7ddg?d[.AfT]WUASE=S&amp;gt;bSdgI]cS[RWBYSE?gSeG_X(()WG('&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;With code like that, line-height doesn't really make &lt;em&gt;any&lt;/em&gt; difference to its readability (which some might argue to be zero, in any case).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt; This fix is now included in the &lt;a href=&quot;https://stackapps.com/questions/4486/stack-overflow-unofficial-patch&quot;&gt;SOUP&lt;/a&gt; user script as of v1.14.  The line height I went with is 1.15, which seems to offer the optimal compromise between ASCII art and code readability.&lt;/p&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.653" LastActivityDate="2014-05-11T01:14:01.970" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="971" PostTypeId="2" ParentId="966" CreationDate="2014-02-08T21:47:23.913" Score="2" Body="&lt;p&gt;We will never comment publicly on why a user is suspended. This is a matter of Stack Exchange policy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I will say that in cases of sockpuppetry the main account is suspended and all others destroyed. You may draw what conclusions you like from that as far as Doorknobs answer is concerned.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2014-02-08T21:47:23.913" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="972" PostTypeId="1" AcceptedAnswerId="976" CreationDate="2014-02-09T10:36:45.640" Score="3" ViewCount="350" Body="&lt;p&gt;Why was &lt;a href=&quot;https://codegolf.stackexchange.com/questions/20377/analogue-clock-with-any-language&quot;&gt;this question&lt;/a&gt; deleted? For those who can't see it, its title was &quot;Analogue Clock with any language&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It was closed as a duplicate, but it happens that it is not a duplicate. The question linked as a duplicate was tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, but this one was tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first close-voter, David Carraher, posted this comment there:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;squeamish ossifrage, Your comment has made me reconsider my vote to close. I also see that the earlier question required ASCII art; this one does not. Is there a way to nullify my vote to close?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;As a result, it was being reopened, and already had 3 votes for reopen (including mine), but then  the Community♦ moderator deleted it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think that it was actually a good question that was unluckly downvoted and not well-understood. It should not be closed, and much less be deleted. It already had one promising nice answer, and I am writing another answer too (I was sure that it would eventually be reopened).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So could that question be undeleted? If not, can I repost it?&lt;/p&gt;&#xA;" OwnerUserId="3755" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-02-12T06:54:33.040" Title="Why was the analog clock popularity-contest question deleted?" Tags="|discussion|closed-questions|deleted-questions|" AnswerCount="2" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="973" PostTypeId="1" AcceptedAnswerId="979" CreationDate="2014-02-09T17:37:30.160" Score="0" ViewCount="62" Body="&lt;p&gt;I'm not getting notified about my rep gain only on the code-golf site. But when I click the achievements box, I see a message displaying my rep gain.&#xA;Note:&#xA;This only occurs on code-golf and not on any other site. And it started yesterday only (everything was ok before).&#xA;How can I fix this.&lt;/p&gt;&#xA;" OwnerUserId="12291" LastActivityDate="2014-02-11T05:49:15.577" Title="Achievements bug on codegolf?" Tags="|support|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="975" PostTypeId="2" ParentId="972" CreationDate="2014-02-09T21:37:04.027" Score="2" Body="&lt;p&gt;The question got reopened, but not undeleted. This is a really weird situation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As suggested by Peter Taylor (and incentived by squeamish ossifrage), it is unlikely that the old question can be revived because the OP had its account deleted. So, I posted a revival proposal in the sandbox: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/974/3755&quot;&gt;https://codegolf.meta.stackexchange.com/a/974/3755&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the unlikelly case that the question eventually get to be undeleted anyway, I will edit it with the text I posted in the sandbox (except, of course, if somebody else does that first), to ensure that it is better worded.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;EDIT: New question posted: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/20646/create-an-analogue-clock-popularity-contest&quot;&gt;Create an analogue clock&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="3755" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-02-12T06:54:33.040" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="976" PostTypeId="2" ParentId="972" CreationDate="2014-02-09T22:32:56.793" Score="1" Body="&lt;p&gt;The user who posted the question was deleted because they were a sockpuppet of &lt;a href=&quot;https://codegolf.stackexchange.com/users/16123/utkarsh-asian-verma&quot;&gt;Utkarsh Asian Verma&lt;/a&gt;. The user posted several low-quality questions, posted low-quality answers to them as his “real” account, and then marked those answers as accepted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, I’d surmise that the &lt;em&gt;question&lt;/em&gt; was deleted because its whole purpose was this sockpuppetry; but I’m not sure because &lt;a href=&quot;https://codegolf.stackexchange.com/q/20379/668&quot;&gt;another question&lt;/a&gt; that had the same purpose didn’t get deleted (possibly because several users posted legitimate answers), although Utkarsh Asian Verma’s answer did get deleted.&lt;/p&gt;&#xA;" OwnerUserId="668" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-02-09T22:32:56.793" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="977" PostTypeId="2" ParentId="973" CreationDate="2014-02-10T07:25:45.210" Score="0" Body="&lt;p&gt;I believe there's a threshold of 200 rep for this. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Edit: It appears I completely misunderstood the question. A user's top 3 or 4 accounts (with &gt;200 rep on each) will appear in the left-most super-combo-box. But it seems this is not what the question was about.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="2381" LastEditDate="2014-02-10T22:17:58.423" LastActivityDate="2014-02-10T22:17:58.423" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="978" PostTypeId="1" CreationDate="2014-02-10T20:10:27.430" Score="1" ViewCount="60" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/20531/6788&quot;&gt;This question&lt;/a&gt; has an interesting scoring rule.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;calculate the score by dividing number of bytes by number of votes - lowest score wins.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;One could argue that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;em&gt;both&lt;/em&gt; apply. One could also argue that they are mutually exclusive, and that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; is appropriate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For posterity's sake, what's the consensus here?&lt;/p&gt;&#xA;" OwnerUserId="6788" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-02-10T20:10:27.430" Title="Is this combined scoring rule code-golf, popularity-contest, or code-challenge?" Tags="|discussion|tags|winning-criteria|" AnswerCount="0" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="979" PostTypeId="2" ParentId="973" CreationDate="2014-02-11T05:49:15.577" Score="1" Body="&lt;p&gt;I guess I know what happened:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I lost 10 points due to a removed user, so I wasn't notified until my acheivements exeeded the 10 points. &lt;/p&gt;&#xA;" OwnerUserId="12291" LastActivityDate="2014-02-11T05:49:15.577" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="980" PostTypeId="1" CreationDate="2014-02-11T21:55:22.600" Score="-2" ViewCount="49" Body="&lt;p&gt;I'm not a huge fan of seeing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot;&gt;'Tips for Golfing in language'&lt;/a&gt; in the Code golf questions page - and I wonder if there could be a more suitable format for this type of question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Perhaps something like Stackoverflow's tag wiki's. Where each people could contribute to a knowledge base of each language's code golfing nuances.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there any interest in this idea / would it be achievable?&lt;/p&gt;&#xA;" OwnerUserId="13747" LastEditorUserId="68942" LastEditDate="2021-06-09T05:47:06.023" LastActivityDate="2021-06-09T05:47:06.023" Title="Suitable format for language specific code golfing tips" Tags="|feature-request|status-declined|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="981" PostTypeId="2" ParentId="980" CreationDate="2014-02-11T21:56:48.227" Score="2" Body="&lt;p&gt;Tag wikis are not editable by low-rep users. Also they don't allow people to contribute individual tips. :-(&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-02-11T21:56:48.227" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="983" PostTypeId="2" ParentId="910" CreationDate="2014-02-12T03:14:31.833" Score="2" Body="&lt;p&gt;I am going to go ahead and add this tag to all of these in 3 days if nobody objects.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My reasoning is that first, &lt;em&gt;all&lt;/em&gt; questions should have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/908/3808&quot;&gt;a winning criteria/question type&lt;/a&gt;. &lt;a href=&quot;https://codegolf.stackexchange.com/search?page=1&amp;amp;tab=votes&amp;amp;q=%22%22%20is%3aquestion%20closed%3ano%20-%5bcode-golf%5d%20-%5bcode-challenge%5d%20-%5bpopularity-contest%5d%20-%5bfastest-code%5d%20-%5bcode-trolling%5d%20-%5bcode-bowling%5d%20-%5bbusy-beaver%5d%20-%5bking-of-the-hill%5d%20-%5batomic-code-golf%5d%20-%5bcode-shuffleboard%5d%20-%5btips%5d%20-%5bpuzzle%5d&quot;&gt;This search query&lt;/a&gt; that I put together that searches for questions without one of these tags reveals lots of restricted-source challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, we need better organization if we want to get out of beta any time soon. If we do become a full-fledged SE site, much more content will start appearing, and we need to keep it clean and organized.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If anyone thinks the name could be improved, feel free to comment and suggest another tag name. Otherwise, since nobody has said anything else about this, I'll just add the tag so I get get on with my tag categorization project.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-- 3 days later edit --&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am now editing all the posts; therefore, I shall accept this answer.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-02-15T14:35:45.160" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="984" PostTypeId="2" ParentId="980" CreationDate="2014-02-12T09:22:01.413" Score="1" Body="&lt;p&gt;They're not usually a nuisance on the questions page - there's rarely more than two. And to be honest, I think that the &quot;traditional&quot; format of a question and then one tip per answer is a lot more readable than your &quot;bundle all the tips into the question&quot; layout.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-02-12T09:22:01.413" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="985" PostTypeId="2" ParentId="185" CreationDate="2014-02-12T18:29:04.150" Score="5" Body="&lt;p&gt;It seems to me that we have enough data on existing code golf problems to build a table of handicaps that would be easy to use in calculating coring for new golf questions, and further could be updated quarterly so as more expert people start using the larger languages competitively, the handicaps would become more and more accurate a representation of language size.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The easiest would be to apply multipliers - C might be multiplied by 0.45, for instance.  A more accurate method would be to use a multiplier and offset, but I don't know that this is necessary, a simple multiplier might be sufficient.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even if we don't go to such a system, I believe it would be a very interesting investigation into current code golf questions.&lt;/p&gt;&#xA;" OwnerUserId="1686" LastActivityDate="2014-02-12T18:29:04.150" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="986" PostTypeId="1" CreationDate="2014-02-12T18:32:14.507" Score="0" ViewCount="53" Body="&lt;p&gt;Although this site gets some interesting challenge questions. But I don't get, as in how is this site increasing the internet's signal-to-noise ratio?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How do you think it would be beneficial to future visitors?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How and why would a random internet searcher land on this site?&lt;/p&gt;&#xA;" OwnerUserId="13573" LastActivityDate="2014-02-12T18:32:14.507" Title="How is this site increasing the internet's signal-to-noise ratio?" Tags="|discussion|" AnswerCount="0" CommentCount="3" ClosedDate="2014-02-13T09:43:03.507" ContentLicense="CC BY-SA 3.0" />
  <row Id="987" PostTypeId="1" AcceptedAnswerId="993" CreationDate="2014-02-12T20:22:59.863" Score="4" ViewCount="141" Body="&lt;p&gt;Why do so few users visit the sandbox? I mainly see &lt;a href=&quot;https://codegolf.stackexchange.com/users/7209/jan-dvorak&quot;&gt;Jan Dvorak&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/users/194/peter-taylor&quot;&gt;Peter Taylor&lt;/a&gt; helping out with forming the questions. Not that many other people upvote or comment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My &lt;a href=&quot;https://codegolf.stackexchange.com/questions/20564/eco-ize-data-for-printing&quot;&gt;last&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/19765/interpret-a-circuit-diagram&quot;&gt;three&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/19456/light-up-a-roguelike&quot;&gt;questions&lt;/a&gt; were all listed in the sandbox. A couple did not get much attention. None got more than 1 upvote. However, now that they are posted on the main site, they have become popular, with many upvotes. Why is it that those people don't visit the sandbox to help with forming questions?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there a way to encourage people to help out in the sandbox?&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-02-14T14:45:15.220" Title="Why do so few people visit the Sandbox" Tags="|discussion|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="988" PostTypeId="1" CreationDate="2014-02-12T22:24:49.610" Score="28" ViewCount="1064" Body="&lt;p&gt;What is the general feeling about answer that can't be tested because no compiler or interpreter is available?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/a/17334/737&quot;&gt;accepted answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/17331/shrink-a-number-string&quot;&gt;this question&lt;/a&gt; is a case in point. The question has been raised in the comments as to whether the answer actually meets the question's requirements, so I thought I'd give it a go myself. I've downloaded a TI-84 calculator emulator and (after much struggling to enter the program) ran the translation of the program as stated in the comments. It gives an error (ERR:INVALID DIM).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The argument could be made at this point that the translation is incorrect in some way, and so to be sure I want to run the code given in the answer as is to see exactly what the output is for the question's test cases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But here's where my big problem is - the compiler is given in some encoded format for a program that does not appear to be downloadable anywhere. How convenient.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So my question is: Should we allow answers in languages that cannot be tested to be accepted? Should we even be upvoting them when no-one can be sure they actually do what's required?&lt;/p&gt;&#xA;" OwnerUserId="737" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-02-01T09:55:18.127" Title="Untestable languages" Tags="|discussion|policy|answers|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="991" PostTypeId="2" ParentId="987" CreationDate="2014-02-13T04:28:48.080" Score="2" Body="&lt;p&gt;It could be that no one knows it's there. I'm not really a Stack Exchange user outside of this site (not that I'm a big user of this site) and I'm lucky that I found the meta site at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I saw some comments saying things like &quot;these are kinks that could have been worked out if this question was posted in the sandbox&quot; but I had no idea what the sandbox was. I don't yet have enough rep to post comments so I couldn't ask. Once I realized there was something about the site I was missing I found it fairly quickly, but that's not necessarily the case for everyone.&lt;/p&gt;&#xA;" OwnerUserId="14509" LastActivityDate="2014-02-13T04:28:48.080" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="993" PostTypeId="2" ParentId="987" CreationDate="2014-02-13T09:47:04.677" Score="5" Body="&lt;p&gt;Most of the beginners do not even know that the sandbox exists or what its purpose is. I myself learned its purpose only in mid January, less than one month ago, though I had seen it since around 2013.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In most StackExchange sites, people have incentive to simply post their questions and get answers. You only need 1 rep to be able to post questions and it does not cost anything. The sandbox's incentive is something like the opposite: questions need to get some sort of approval before being posted. This is not the way that StackExchange sites were designed. Additionally, beginners don't normally participate the meta, because the meta was designed to address questions about site organization issues, retagging, close and reopen votes, disputes and things that beginners know that they aren't mature enough yet to participate or even to understand what is going on, so they simply don't bother to come here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are a lot more problems in the sandboxes themselves. If a beginner randomly followed a link to a sandbox question, he will have no clue what is going on. Before I posted a comment to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/954/3755&quot;&gt;this sandbox question&lt;/a&gt; four days ago, none of them had a single word explaining the purpose of the sandbox, and the first one has been out since 2011. The best that I could get was the &lt;em&gt;&quot;Use this as a sandbox for new questions.&quot;&lt;/em&gt;, but no one was saying why should I do that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In experience, the first time I saw the first sandbox, I thought:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;WTF is this?&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;What is that Mk-roman-numeral thing? Should definitely have no relation with Mortal Kombat.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Why would I sandbox a question and how is this related to the Mk thing?&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Well... no one seems to be explaining that, so it probably doesn't matter anyway.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I took quite some time to figure out what it was and what was its purpose. I eventually figured out its purpose only by seeing a handful of small, scattered, random comments citing the sandbox from random users on random questions and answers somewhere else very very far from the sandbox questions themselves.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And about the Mk thing, you (the OP, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/9498/quincunx&quot;&gt;Quincunx&lt;/a&gt;) were the first person that posted something explaining what it is (at least the first post that I could find), and then you definitely convinced me that it surely has nothing to do with Mortal Kombat. As you explained, it means &quot;Mark&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I conjecture that many beginners are thinking just like I myself thought; if they eventually see the sandbox, they would not understand what is happening. However most won't even see it, because the meta sites aren't usually for beginners.&lt;/p&gt;&#xA;" OwnerUserId="3755" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2014-02-13T18:47:58.213" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="994" PostTypeId="2" ParentId="286" CreationDate="2014-02-13T16:24:01.990" Score="14" Body="&lt;p&gt;Enjoyment is primarily a function of the golfer, not of the rules of golfing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Having just submitted my first-ever golf answer on CG.SE in T-SQL after a long period of lurking contentedly, I can assure you that for me there's plenty of enjoyment in losing, and losing by a very, very wide margin.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I am the sort of person who thinks playing a round of real golf with nothing but a sand wedge could be great fun. &lt;/p&gt;&#xA;" OwnerUserId="3363" LastActivityDate="2014-02-13T16:24:01.990" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="995" PostTypeId="2" ParentId="286" CreationDate="2014-02-13T18:50:22.973" Score="57" Body="&lt;p&gt;I hate that people upvote Golfscript answers just because they are short. &lt;sup&gt;I can't help but imagine some very excited people with their mouth half open exclaiming &quot;omg i cant believe thats a real program upvote lolz!!1!&quot; These people will do so so for every piece of Golfscript code they see.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Usually you find for instance Ruby/Python/Perl answers that are longer, but display a whole lot more creativity with bending the syntax and misusing all sorts of features just to shorten it as much as possible, with much fewer upvotes. Still, these answers usually impress me much more.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can't remember being truly impressed by a golfscript answer; usually the problem seem to be solved in a completely straightforward manner, which just happens to be very short.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An impressive Golfscript answer to me would be one that utilizes the stack-based nature of the language to solve the problem in a different manner than the rest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, I'm rarely truly impressed by codegolf answers written in for instance Java, because Java is so verbose and I can't help thinking that the person have chosen wrong language for the job. Also Java isn't a language that is possible to abuse in the same way that for example Python or Ruby is, which thend to make Java answers boring and straightforward too.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;In short:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I think an upvote should mean &lt;code&gt;I dig your style&lt;/code&gt; rather than &lt;code&gt;I hereby acknowledge that this piece of code contains very few characters&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="4372" LastActivityDate="2014-02-13T18:50:22.973" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="996" PostTypeId="2" ParentId="988" CreationDate="2014-02-13T20:04:22.903" Score="12" Body="&lt;p&gt;I think when someone posts in a language which is hard to set up, or test, then I think it is appropriate to downvote the answer if it doesn't describe (or link to a page with) a proper introduction on how to set up the environment. If, according to manual calculations the answer is also wrong, I think it would be appropriate to also flag the answer as &quot;Not an answer&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The hard part is to define what counts as &quot;hard&quot;. I would define hard as anything that's not &quot;easy&quot;. And &quot;easy&quot; means:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Operating System&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It runs on &lt;em&gt;at least one&lt;/em&gt; of the main, &lt;em&gt;still supported&lt;/em&gt;, intel based operating systems:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Windows 8, 8.1, 10&lt;/li&gt;&#xA;&lt;li&gt;Mac OSX 10.8+&lt;/li&gt;&#xA;&lt;li&gt;A recent, supported linux variant, like Ubuntu Linux 14.04 LTS&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Here I both say supported and intel based, which means old OS's (including Windows XP), and ARM based operating systems (Android, iOS, etc.) are considered hard.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &quot;at least one&quot; criteria means, that if it only runs on one of them (like PowerShell), then it is still fine. Hopefully there are enough members in the community that can test them, or if not, then you might still be able to install a VM and test it there (yes, I know, that this might not be viable for OSX though).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Installation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It can be installed via a common package manager on the supported operating systems, or it comes installed by default. The installer can be downloaded from the internet, and it can be installed freely.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So for example on Windows you can easily donwload an MSI, and install it. On Debian based linuxes you can use &lt;code&gt;apt-get&lt;/code&gt;. On OSX it is available as either a &lt;code&gt;pkg&lt;/code&gt; or through &lt;code&gt;homebrew&lt;/code&gt;, etc.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here are some examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Java 1.6+ Installable MSI on Windows&lt;/li&gt;&#xA;&lt;li&gt;Ruby 1.8.7: Default on OSX 10.8&lt;/li&gt;&#xA;&lt;li&gt;Javascript: A browser usually comes installed by default on all operating systems (note that the rules disallow JS code that only work for example on IE6, or other outdated browsers)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Hard languages&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;So what to do in case of hard languages? I would say that each of the mainly used hard languages should have a separate meta page, where there would be enough information either to the poster, or to the tester on how to run the code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For GTB for example it would mean a step-by-step description on how to set up a TI-84 emulator, how to enter the code, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For Mathematica it would describe how to create CDF files that can be shared to the users.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All solutions that use hard languages has to have a link to the appropriate meta page!&lt;/p&gt;&#xA;" OwnerUserId="8732" LastEditorUserId="8732" LastEditDate="2016-02-01T09:55:18.127" LastActivityDate="2016-02-01T09:55:18.127" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="997" PostTypeId="1" CreationDate="2014-02-13T20:32:40.957" Score="7" ViewCount="175" Body="&lt;p&gt;This is the declined flag:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/REANu.png&quot; alt=&quot;screenshot&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This was the comment I flagged:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/w5gLT.png&quot; alt=&quot;screenshot 2&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why was this flagged declined with no comment? Does there really have to be three comments that say exactly the same thing? (In fact, I think &quot;why downvote&quot; comments shouldn't exist at &lt;em&gt;all&lt;/em&gt;, but that's a different matter.)&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="194" LastEditDate="2014-03-17T18:26:04.030" LastActivityDate="2014-03-17T18:26:04.030" Title="Why was this comment flag (on a triplicated comment) declined?" Tags="|discussion|flags|comments|" AnswerCount="1" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="998" PostTypeId="2" ParentId="997" CreationDate="2014-02-13T22:55:14.473" Score="6" Body="&lt;p&gt;My best guess is that the handling moderator misunderstood your text as meaning that this was your third flag, because I think the comments are definitely pointless. I regularly remove such comments.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2014-02-13T22:55:14.473" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="999" PostTypeId="2" ParentId="894" CreationDate="2014-02-13T22:59:31.623" Score="5" Body="&lt;p&gt;The main idea is good, but it would only work in a language-specific way, as someone will definitely find a language, that uses differnet characters to represent the concepts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So instead of this, why not add costs for language features?&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;| calling a function              | 10 + 2*parameters |&#xA;| pushing a value onto the stack  | 20                |&#xA;| assigning a value to a variable | 15                |&#xA;| using a code block              | 5                 |&#xA;etc.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Of coure there might be debates on what can be considered a &quot;function call&quot; or a &quot;code block&quot; in like Befunge or GolfScript, but these might be ironed out in the tag wiki.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The result cost might be based on the character count + the cost of the language features&lt;/p&gt;&#xA;" OwnerUserId="8732" LastActivityDate="2014-02-13T22:59:31.623" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1002" PostTypeId="2" ParentId="987" CreationDate="2014-02-14T14:45:15.220" Score="2" Body="&lt;p&gt;Total agreement from the first two answers. I didn't know there was a sandbox area let alone what it was for. I don't have enough rep to up-vote or comment but I would if I could. Is the sandbox area very visible from the main page? Putting a link and a description of what the sandbox is for on the home page may drive community awareness up.  &lt;/p&gt;&#xA;" OwnerUserId="16392" LastActivityDate="2014-02-14T14:45:15.220" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1003" PostTypeId="1" AcceptedAnswerId="1004" CreationDate="2014-02-15T13:25:03.757" Score="4" ViewCount="110" Body="&lt;p&gt;If I have an answer with two different languages or with the same language but two different versions, is it better to post one answer including both codes or two answers each with one code?&lt;/p&gt;&#xA;" OwnerUserId="12291" LastActivityDate="2014-02-19T21:07:25.147" Title="is it better to post one answer or two?" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1004" PostTypeId="2" ParentId="1003" CreationDate="2014-02-15T14:32:59.783" Score="9" Body="&lt;p&gt;It depends.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If they are radically different, then yes, you should post them as two separate answers. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/a/16239/3808&quot;&gt;this answer&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/a/16240/3808&quot;&gt;this one&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, if they are very similar, then they should both be in the same answer. For example, note that both answers linked above actually have &lt;em&gt;two&lt;/em&gt; solutions, because they were very similar.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-02-15T14:32:59.783" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1005" PostTypeId="1" AcceptedAnswerId="1006" CreationDate="2014-02-15T15:00:22.677" Score="19" ViewCount="1542" Body="&lt;p&gt;I'm hoping we're nearing the end of beta soon, but even if we aren't, our chatroom name is so bland. &quot;Code Golf.&quot; Look at all the creative names others have thought up:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&quot;Root Access&quot; for Super User&lt;/li&gt;&#xA;&lt;li&gt;&quot;The DMZ&quot; for Security&lt;/li&gt;&#xA;&lt;li&gt;&quot;The Renderfarm&quot; for Blender&lt;/li&gt;&#xA;&lt;li&gt;&quot;The Litter Box&quot; for Pets&lt;/li&gt;&#xA;&lt;li&gt;&quot;The Hangar&quot; for Aviation&lt;/li&gt;&#xA;&lt;li&gt;&quot;You Are Here&quot; for Travel&lt;/li&gt;&#xA;&lt;li&gt;&quot;The Water Cooler&quot; for The Workplace&lt;/li&gt;&#xA;&lt;li&gt;&quot;The Whiteboard&quot; for Programmers&lt;/li&gt;&#xA;&lt;li&gt;etc...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Can we think of a better name for our chatroom?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Only one idea per answer, please. Vote up the ideas that you like!&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="66833" LastEditDate="2021-07-14T02:58:27.263" LastActivityDate="2021-07-14T02:58:27.263" Title="Let's think of a creative name for our chatroom" Tags="|discussion|status-completed|chat|faq-proposed|" AnswerCount="9" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="1006" PostTypeId="2" ParentId="1005" CreationDate="2014-02-15T16:05:38.087" Score="50" Body="&lt;p&gt;Well, the traditional generic name for the country club bar is &quot;the nineteenth hole&quot;, which suggests &lt;strong&gt;&lt;em&gt;The Nineteenth Byte&lt;/em&gt;&lt;/strong&gt; or something like that.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="78" LastEditDate="2014-02-15T16:16:23.940" LastActivityDate="2014-02-15T16:16:23.940" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1007" PostTypeId="2" ParentId="1005" CreationDate="2014-02-15T16:16:34.220" Score="-6" Body="&lt;p&gt;Going with the &quot;Puzzle&quot; theme, how about &lt;strong&gt;&lt;em&gt;Cross Words&lt;/em&gt;&lt;/strong&gt;?&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="9498" LastEditDate="2014-02-15T22:23:51.317" LastActivityDate="2014-02-15T22:23:51.317" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1008" PostTypeId="2" ParentId="1005" CreationDate="2014-02-15T16:17:41.257" Score="-7" Body="&lt;p&gt;&lt;em&gt;&lt;strong&gt;The Press of Inspiration&lt;/em&gt;&lt;/strong&gt; alludes vaguely to the work of squeezing out a few more bytes in code golf&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2014-02-15T16:17:41.257" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1009" PostTypeId="2" ParentId="942" CreationDate="2014-02-15T16:56:38.573" Score="0" Body="&lt;h2&gt;UTF-8 Everywhere&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;After reading &lt;a href=&quot;http://www.utf8everywhere.org/&quot; rel=&quot;nofollow&quot;&gt;the manifesto&lt;/a&gt;, I'm a fan. It's about general usage in programming, but I think it's even more true for code golf.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A standard is good, to save the need to specify the detail in every problem description (and worse - the trouble arising from forgetting to specify it).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For most programming languages, which are ASCII based, UTF-8 means byte count and character count is the same. And if your language supports Unicode, you can use it, but you get more and pay more.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't thin that it matters that for some languages, UTF-16 is native. The byte count is the size of the UTF-8 representation of the program text.&lt;/p&gt;&#xA;" OwnerUserId="3544" LastActivityDate="2014-02-15T16:56:38.573" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1010" PostTypeId="2" ParentId="1005" CreationDate="2014-02-15T16:58:38.160" Score="15" Body="&lt;p&gt;How about &lt;strike&gt;&lt;strong&gt;Chat&lt;/strong&gt;&lt;/strike&gt; &lt;strong&gt;Cht&lt;/strong&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's the shortest name I could find.&lt;/p&gt;&#xA;" OwnerUserId="3544" LastActivityDate="2014-02-15T16:58:38.160" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1011" PostTypeId="2" ParentId="1005" CreationDate="2014-02-15T19:33:16.010" Score="8" Body="&lt;p&gt;Hmm.. &lt;strong&gt;&lt;em&gt;&lt;a href=&quot;http://www.whitehouse.gov/briefing-room&quot; rel=&quot;nofollow&quot;&gt;The Briefing Room&lt;/a&gt;&lt;/em&gt;&lt;/strong&gt; because we make short (brief) code..? And it's a chat room of course.&lt;/p&gt;&#xA;" OwnerUserId="4372" LastEditorUserId="4372" LastEditDate="2014-02-15T19:38:40.927" LastActivityDate="2014-02-15T19:38:40.927" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1013" PostTypeId="1" AcceptedAnswerId="1040" CreationDate="2014-02-15T23:05:38.027" Score="11" ViewCount="313" Body="&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/842/9498&quot;&gt;How are new users supposed to participate on this site?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In most StackExchange sites, new users are encouraged to ask questions. On this site, we encourage running questions through the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/954/9498&quot;&gt;sandbox&lt;/a&gt;. However, 5 rep is needed to participate on meta. It seems contradictory; new users can post questions and are encouraged to post questions by the StackExchange format, but the questions they post are hit with a comment, asking them to use the sandbox.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A possible solution to this is to have a community wiki sandbox on the main site, but that might be a bad idea. However, this might work; a &lt;strong&gt;single&lt;/strong&gt; sandbox doesn't clog the question queue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How can we fix this problem?&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="97857" LastEditDate="2022-02-19T07:46:35.000" LastActivityDate="2022-02-19T07:46:35.000" Title="How can new users use the Sandbox?" Tags="|discussion|sandbox|new-users|" AnswerCount="4" CommentCount="11" ClosedDate="2022-02-24T01:59:14.293" ContentLicense="CC BY-SA 3.0" />
  <row Id="1014" PostTypeId="2" ParentId="1013" CreationDate="2014-02-15T23:21:35.747" Score="4" Body="&lt;p&gt;This is a good point for which I don't have a good answer. It should be easy enough to get 1 vote for an answer by way of introduction, but demanding that may not feel very welcoming. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the past we have suggested that users use either the sandbox or chat for getting advice on their questions, but there is a rep requirement for chat as well.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2014-02-15T23:21:35.747" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1015" PostTypeId="2" ParentId="1005" CreationDate="2014-02-16T08:54:46.697" Score="-2" Body="&lt;p&gt;How about having a Kolmogorov challenge to output the text &quot;Programming Puzzles &amp;amp; Code Golf&quot;?&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2014-02-16T08:54:46.697" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1022" PostTypeId="2" ParentId="1005" CreationDate="2014-02-17T22:43:24.863" Score="12" Body="&lt;p&gt;The 10011th Hole, riffing on the 19th hole.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;@dmckee is here earlier with a riff on the same premise, but I a) arrived at mine independently, and b) rather like the idea of using binary. So you've got options.&lt;/p&gt;&#xA;" OwnerUserId="3363" LastActivityDate="2014-02-17T22:43:24.863" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1023" PostTypeId="2" ParentId="2140" CreationDate="2014-02-18T17:24:01.500" Score="1" Body="&lt;h1&gt;How many pizzas do I need&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Write a program that figures out the minimum number of pizzas I need to order and the amount of left overs I will have.&lt;/p&gt;&#xA;&lt;h3&gt;Requirements&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each pizza is 8 slices&lt;/li&gt;&#xA;&lt;li&gt;Each person gets one choice of pizza topping, represented by a letter &lt;code&gt;A-Z&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Input in the format &lt;code&gt;PVBC 2&lt;/code&gt;. Where each letter represents the choice of 1 person (e.g. &lt;code&gt;P&lt;/code&gt;=Plain, &lt;code&gt;V&lt;/code&gt;=Vegie, etc...), and the number is the amount of slices each person is allowed to eat. Letters can be in any order and do not need to be grouped.&lt;/li&gt;&#xA;&lt;li&gt;If I don't need a full pizza I must be able to do half one topping and half another topping, the output for a half and half pizza will be denoted by &lt;code&gt;X/Y&lt;/code&gt; where &lt;code&gt;X&lt;/code&gt; and &lt;code&gt;Y&lt;/code&gt; are different toppings&lt;/li&gt;&#xA;&lt;li&gt;If I need multiple of a certain type of pizza they must be shown on one line (e.g. &lt;code&gt;2 x V Pizza&lt;/code&gt;). If there are different combinations the both result in the same, least, amount of pizzas, either output works&lt;/li&gt;&#xA;&lt;li&gt;Output must match the format below of one type of pizza per line and a comma separated list of left overs. The output must show the minimum amount of pizzas and leftover possible.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Extra Credit&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;-20&lt;/strong&gt; - Take a 3rd argument that allows you to input the number of slices in a pizza, assume it will be an even number such that you can split it in half&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Sample Input/Output&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;PCPVCB 3              (6 slices P, 3 slices V,  6 slices C, 3 slices B)&#xA;1 x P Pizza&#xA;1 x V/B Pizza&#xA;1 x C Pizza&#xA;2 slices P, 2 slices C, 1 slice V, 1 slice B left over&#xA;&#xA;VBBCBBB 2             (10 slices B, 2 slices C, 2 slices V)&#xA;1 x C/V Pizza&#xA;2 x B Pizza&#xA;6 slices B, 2 slices C, 2 slices V left over&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The 2nd example has many other combinations that could result in only 3 pizzas, this is just an example of what an output might be.&lt;/p&gt;&#xA;&lt;p&gt;The shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="2852" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-02-26T13:14:44.920" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1024" PostTypeId="1" CreationDate="2014-02-18T21:00:03.783" Score="7" ViewCount="511" Body="&lt;p&gt;Yes. COBOL. I assume that the full power of a compiler implementation may be used... but, COBOL has some historical disadvantages if used for code-golf, at least for compilers which do not support various relaxations (but which in turn don't have some other stuff, gain on the swings, lose on the roundabouts).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Specifically, I want to use IBM's Enterprise COBOL compiler V4.2.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A COBOL line occupies 72 bytes in a fixed layout. &lt;a href=&quot;http://pic.dhe.ibm.com/infocenter/pdthelp/v1r1/index.jsp?topic=%2Fcom.ibm.entcobol.doc_4.1%2FPGandLR%2Fref%2Frlfmt.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://pic.dhe.ibm.com/infocenter/pdthelp/v1r1/index.jsp?topic=%2Fcom.ibm.entcobol.doc_4.1%2FPGandLR%2Fref%2Frlfmt.htm&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first six bytes, the sequence-number area, cannot contain code. The compiler ignores these bytes (although a compiler may, optionally, check for ascending numerical sequence and issue a warning diagnostic message).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The seventh byte cannot contain code. It is called the indicator column. It can contain a comment indicator. It can contain a debug-line indicator. It can contain a &quot;print a heading on the compiler listing now&quot; indicator. It can contain a character used for the continuation of literals that do not fit between columns 12 and 72 (and which must be bounded by single- or double-quotes).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Area A is bytes 8-11. Area B is bytes 12-72. Some statements should only start in Area B, but the diagnostic messages can be ignored, so this is not a problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is trailing physical space on a line up to and including byte 72.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Question 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would it be clear that it would be OK not to count positions 1-6 and 73-80 of a COBOL source line?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Question 2.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can the indicator column (byte seven) be ignored? I cannot contain code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Question 3.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can the trailing space be ignored.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;/blatantgoading on &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, if anyone is scared of being beaten at code-golf by a COBOL program, they will vote this discussion down.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;/blatantgoading off&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would expect to be able to beat JAVA where a reasonable golf-COBOL solution exists. Of course, I don't mind what languages I manage to beat (if any).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are a couple of example COBOL programs for those unfamiliar with the language. An ID DIVISION, PROGRAM-ID and PROCEDURE DIVISION are required, as are full-stops/periods after those, and at various other points.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some may feel this is a sufficient disadvantage, without having to count 72 characters for each and every line.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;COBOL has some handicaps for code-golf, anyway. I'd just like the seven leading bytes and trailing space not to be counted, if possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are some COBOL examples already:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From Cereal, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/11877/generate-a-pronouncable-word/11912#11912&quot;&gt;Generate a pronouncable word&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This uses a Micro Focus compiler which does not require &quot;the DIVISIONs&quot; but does seem to require the seven leading characters for each line (the example can be drastically reduced in size).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From gnibbler on SO, &lt;a href=&quot;https://stackoverflow.com/questions/2406780/code-golf-triforce/2414416#2414416&quot;&gt;https://stackoverflow.com/questions/2406780/code-golf-triforce/2414416#2414416&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And now mine, one golfed, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/21285/happy-birthday-to-me/21385#21385&quot;&gt;Happy Birthday to Me!&lt;/a&gt;, and two for popularity, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/20654/execute-prints-backwards/20889#20889&quot;&gt;Execute prints backwards&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/16036/bloatware-contest-producing-100-mib-executable/21225#21225&quot;&gt;Bloatware contest: producing 100+ MiB executable&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="16411" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2015-06-16T12:47:56.177" Title="COBOL for Golf - how to count characters" Tags="|discussion|code-golf|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1025" PostTypeId="2" ParentId="1024" CreationDate="2014-02-19T05:32:30.477" Score="2" Body="&lt;p&gt;For &lt;a href=&quot;https://stackoverflow.com/a/2414416/174728&quot;&gt;triforce&lt;/a&gt; I passed &lt;code&gt;-free -x&lt;/code&gt; to &lt;code&gt;cobc&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't think I counted those command line parameters toward my answer, but the usual convention is to add them to the character count&lt;/p&gt;&#xA;" OwnerUserId="95" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2014-02-19T05:32:30.477" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1026" PostTypeId="2" ParentId="1003" CreationDate="2014-02-19T06:03:27.600" Score="1" Body="&lt;p&gt;Absolutely post separate answers for different languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://stackoverflow.com/a/2407914/174728&quot;&gt;https://stackoverflow.com/a/2407914/174728&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://stackoverflow.com/a/2406987/174728&quot;&gt;https://stackoverflow.com/a/2406987/174728&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://stackoverflow.com/a/2408571/174728&quot;&gt;https://stackoverflow.com/a/2408571/174728&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://stackoverflow.com/a/2414416/174728&quot;&gt;https://stackoverflow.com/a/2414416/174728&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://stackoverflow.com/a/2408221/174728&quot;&gt;https://stackoverflow.com/a/2408221/174728&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://stackoverflow.com/a/2413934/174728&quot;&gt;https://stackoverflow.com/a/2413934/174728&lt;/a&gt;  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For same language use common sense. Are they different enough that people will want to be able to vote for them separately?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If someone comments that they should be the same answer, consider merging them into one and delete the other.&lt;/p&gt;&#xA;" OwnerUserId="95" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2014-02-19T21:07:25.147" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1028" PostTypeId="2" ParentId="2140" CreationDate="2014-02-19T12:06:56.403" Score="-3" Body="&lt;p&gt;&lt;strong&gt;Bovine Ignorance&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm curious about code which still works after being mangled by &lt;code&gt;figlet&lt;/code&gt;, &lt;code&gt;toilet&lt;/code&gt;, &lt;code&gt;cowsay&lt;/code&gt; et al, but I'm not sure whether this in any way sane.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What I'm toying with is a challenge in which a participant may submit any program in any language. It should be possible to use this program's source code as input to &lt;code&gt;cowsay&lt;/code&gt; or whatever, and the result should be another valid program in any language, which still does a similar thing. For instance, the following bf program prints &lt;code&gt;Hello world!&lt;/code&gt; with no newline:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+++++ +++++&#xA;[&#xA;&amp;gt; +++++ ++&#xA;&amp;gt; +++++ +++++&#xA;&amp;gt; +++&#xA;&amp;gt; +&#xA;&amp;lt;&amp;lt;&amp;lt;&amp;lt; -&#xA;]&#xA;&amp;gt; ++ .&#xA;&amp;gt; + .&#xA;+++++ ++ .&#xA;.&#xA;+++ .&#xA;&amp;gt; ++ .&#xA;&amp;lt;&amp;lt; +++++ +++++ +++++ .&#xA;&amp;gt; .&#xA;+++ .&#xA;----- - .&#xA;----- --- .&#xA;&amp;gt; + .&#xA;+++++++++++++++++++++++++++++++++++++++++&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Running &lt;code&gt;cat ./prog.bf | cowsay -e .. -T $'&amp;gt;.'&lt;/code&gt; yields the following output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; _________________________________________&#xA;/ +++++ +++++ [ &amp;gt; +++++ ++ &amp;gt; +++++ +++++  \&#xA;| &amp;gt; +++ &amp;gt; + &amp;lt;&amp;lt;&amp;lt;&amp;lt; - ] &amp;gt; ++ . &amp;gt; + . +++++   |&#xA;| ++ . . +++ . &amp;gt; ++ . &amp;lt;&amp;lt; +++++ +++++      |&#xA;| +++++ . &amp;gt; . +++ . ----- - . ----- --- . |&#xA;| &amp;gt; + .                                   |&#xA;| +++++++++++++++++++++++++++++++++++++++ |&#xA;\ ++                                      /&#xA; -----------------------------------------&#xA;        \   ^__^&#xA;         \  (..)\_______&#xA;            (__)\       )\/\&#xA;             &amp;gt;. ||----w |&#xA;                ||     ||&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which is itself a valid bf program which prints &lt;code&gt;Hello world!!!&lt;/code&gt;, followed by a newline.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem with using bf here is that it ignores most of the cow, making this a bit too easy. The problem with using any other language is that it doesn't ignore most of the cow, making this far too difficult. Is there a sensible middle ground I could pick for this? I don't think it's impossible, I'm fairly sure you can exploit cowsay's behavior on one-liners to produce valid &lt;code&gt;svg&lt;/code&gt;s, but I'm not sure how best to pose this challenge. Any ideas?&lt;/p&gt;&#xA;" OwnerUserId="9524" LastActivityDate="2014-02-19T12:06:56.403" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1029" PostTypeId="2" ParentId="2140" CreationDate="2014-02-19T14:28:07.900" Score="1" Body="&lt;p&gt;&lt;strong&gt;The Poet's Quine:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a quine with 1 or more rhyme scheme from &lt;a href=&quot;http://en.wikipedia.org/wiki/Rhyme_scheme&quot; rel=&quot;nofollow&quot;&gt;http://en.wikipedia.org/wiki/Rhyme_scheme&lt;/a&gt; when read. The non-alphanumeric symbols aren't used for rhyming in this scheme (apart from the basic arithmetic signs like plus, minus, times and divided by), neither are comments. Words may be pronounced in any dialect, but it needs to be consistent within the same stanza (no having the first word be pronounced in a Scottish way and the second in a Welsh way).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Contest type would be popularity contest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thoughts on this proposal?&lt;/p&gt;&#xA;" OwnerUserId="14141" LastEditorUserId="14141" LastEditDate="2014-02-24T13:55:46.813" LastActivityDate="2014-02-24T13:55:46.813" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="1031" PostTypeId="1" CreationDate="2014-02-19T20:26:39.780" Score="17" ViewCount="647" Body="&lt;p&gt;Prompted by a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/21285/happy-birthday-to-me#comment43005_21285&quot;&gt;discussion between Peter Taylor and myself&lt;/a&gt;, I'd like to solicit the community's opinion on the following issue:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Should awarding score bonuses for extra features disqualify a challenge from being tagged as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, or is it enough that the &lt;em&gt;primary&lt;/em&gt; scoring criterion is code length?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Also, does it matter if the bonus scores are only used to break ties between equally long answers (as in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4665/find-columns-where-all-characters-are-the-same&quot;&gt;this challenge&lt;/a&gt;), or if the bonus can be formulated as an unusual length-counting rule (e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/5825/sum-of-at-most-5-primes&quot;&gt;this challenge&lt;/a&gt;, where, effectively, the eight characters comprising the string &quot;&lt;code&gt;goldbach&lt;/code&gt;&quot; are free if they appear in the code in that order)?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;In particular, should the following questions (currently all tagged as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;; not an exhaustive list) be retagged as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/21285/happy-birthday-to-me&quot;&gt;Happy Birthday to Me!&lt;/a&gt; (the challenge that sparked this discussion)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/4665/find-columns-where-all-characters-are-the-same&quot;&gt;Find columns where all characters are the same&lt;/a&gt; (one of my own old challenges, features a &amp;minus;&amp;frac12; char tie-breaker bonus)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/18986/draw-the-olympic-games-logo&quot;&gt;Draw the Olympic Games logo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/19171/all-your-base-are-belong-to-us-restricted&quot;&gt;All Your Base Are Belong To Us (Restricted)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/18556/count-sum-of-all-digits-help-to-determine-winner&quot;&gt;Count sum of all digits&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/21210/the-shifting-dot&quot;&gt;The shifting dot&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/2922/generate-a-random-program-in-your-favorite-language&quot;&gt;Generate a random program in your favorite language&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/7107/star-programming&quot;&gt;Star programming!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/5083/create-a-rotating-quine&quot;&gt;Create a rotating quine&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/20139/shortest-program-to-sort-a-list-of-numbers-into-odd-and-even-category&quot;&gt;Shortest Program to Sort a List of numbers into Odd and Even Category&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/8800/the-strange-unsorting-machine-for-nefarious-purposes&quot;&gt;The Strange Unsorting Machine for Nefarious Purposes&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/10759/build-an-analog-clock&quot;&gt;Build an analog clock&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/4944/determine-if-a-number-is-divisible-by-13-without-using-13-itself&quot;&gt;Determine if a number is divisible by 13 (without using 13 itself)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/5562/implement-hyperexponentiation-tetration-without-the-use-of&quot;&gt;Implement hyperexponentiation/tetration without the use of &amp;#39;^&amp;#39;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/5825/sum-of-at-most-5-primes&quot;&gt;Sum of (at most) 5 primes&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/5382/create-an-ascii-progress-bar&quot;&gt;create an ascii progress bar&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/5595/reverse-engineer-polling-statistics&quot;&gt;Reverse Engineer Polling Statistics&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/4528/hello-world-rainbow&quot;&gt;Hello World Rainbow&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/11130/advanced-code-golf-disk-operations-and-file-allocation&quot;&gt;Advanced Code Golf - Disk Operations, and File Allocation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/18865/stupid-restrictions-and-desert&quot;&gt;stupid restrictions and desert&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/2822/make-a-simple-irc-bot&quot;&gt;Make a simple IRC bot.&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/5574/solve-the-14-pegs-puzzle&quot;&gt;Solve the 14-Pegs puzzle&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/2910/compute-the-difference-between-two-days&quot;&gt;Compute the difference between two days.&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/18535/convert-radicals-to-mixed-entire-radicals-and-to-real-numbers&quot;&gt;Convert radicals to mixed &amp;amp; entire radicals and to real numbers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/3582/unique-sudoku-finder&quot;&gt;Unique Sudoku Finder&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/8551/dice-from-changing-random-generator&quot;&gt;Dice from Changing Random Generator&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/6944/breaking-perfect-hangman-in-reverse-in-reverse&quot;&gt;Breaking Perfect Hangman in reverse, in reverse&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/12282/sum-of-products-of-subsets&quot;&gt;Sum of Products of Subsets&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/19693/hide-one-message-inside-another&quot;&gt;Hide one message inside another&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/9156/four-weights-to-produce-integer-scale-differences-from-0-through-40-pounds&quot;&gt;Four weights to produce integer scale differences from 0 through 40 pounds&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/16155/shortest-self-modifying-code-to-wish-a-happy-new-year&quot;&gt;Shortest self-modifying code to wish a happy New Year!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;(List mostly compiled based on &lt;a href=&quot;https://codegolf.stackexchange.com/search?page=2&amp;amp;tab=votes&amp;amp;q=[code-golf]%20bonus%20is%3aquestion&quot;&gt;a search for &lt;em&gt;[code-golf] bonus is:question&lt;/em&gt;&lt;/a&gt;, filtered to exclude simple false posistives and any questions where the bonus is &quot;imaginary&quot; or not well defined.)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The only written policy I've found on this is the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/posts/1340/revisions&quot;&gt;tag wiki excerpt&lt;/a&gt;, which currently includes the following sentence (added by Peter in July '13):&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&quot;A competition which scores on a mixture of source length and some other criterion should be tagged [code-challenge] instead.&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;There doesn't seem to have been any meta discussion about this that I could find, so I figured I'd start one myself.&lt;/p&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2016-02-20T22:48:31.467" Title="Should bonuses be allowed for [code-golf] questions?" Tags="|discussion|code-golf|tags|" AnswerCount="4" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1033" PostTypeId="2" ParentId="1031" CreationDate="2014-02-20T00:17:13.683" Score="5" Body="&lt;p&gt;I have never been very worried about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf%2b%2b&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf++&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf++&lt;/a&gt; questions, but if they are bothering people or if people like them enough to want them to be searchable, how about a new tag?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Something like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/modified-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;modified-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;modified-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We already have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/894/an-idea-for-a-new-genre-of-challenges-code-purchasing&quot;&gt;proposals&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot;&gt;active tags&lt;/a&gt; for some &lt;a href=&quot;https://codegolf.stackexchange.com/tags/regular-expression/synonyms&quot;&gt;other&lt;/a&gt; &quot;special&quot; golfing rules.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-02-20T00:17:13.683" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1034" PostTypeId="2" ParentId="1031" CreationDate="2014-02-20T04:05:00.697" Score="0" Body="&lt;p&gt;I think there are &lt;em&gt;some&lt;/em&gt; cases where mixed criteria could make sense in pure code-golf, although most of the examples given are not those cases. The primary case being a challenge where not only the program but also the solution can be (purely and objectively) golfed. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example &lt;a href=&quot;https://codegolf.stackexchange.com/questions/20754/3-and-5-litre-jug-puzzle&quot;&gt;The 3L and 5L Jugs (aka Die Hard)&lt;/a&gt; challenge is a case where there are many ways to solve for a given number but there is also an optimized solution for each number. It would have been reasonable to score that challenge on a combination of code length and number of total steps required to solve all numbers 1 to 100. To my mind, both of those are golfing criteria: optimization to reduce the size of the solution. And the net effect is that you discourage people from reducing the size of their program by reducing the quality of their solution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A bonus like the -8 points for Goldbach, on the other hand, is not a golfing bonus. It certainly introduces a legitimate element of fun and challenge, but it also introduces a meta-gaming aspect in which you have to consider the choice to implement the bonus feature vs. the characters it will cost. The Die Hard problem with the hypothetical scoring modification would have no such meta-gaming. It is a simple matter of the optimal program running the optimal solution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That last sentence is what I have always presumed to be the mission statement of the code-golf tag.&lt;/p&gt;&#xA;" OwnerUserId="3363" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-02-20T04:05:00.697" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1036" PostTypeId="2" ParentId="1031" CreationDate="2014-02-20T07:40:40.570" Score="11" Body="&lt;p&gt;I don't thing the tag needs to cover all nuances.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the main task is to write the shortest program that achieves a task, it's code golf. As long as modifications don't change the main focus, they don't change anything.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In some extreme cases, the modifiers may become the main challenge, and golfing becomes more of a tie breaker. Then it shouldn't be tagged code-golf, but these are quite rare.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, I'm not sure when is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; appropriate. Isn't everything on this site a code challenge? I think it's mostly used for challenges that don't match any specific tag.&lt;/p&gt;&#xA;" OwnerUserId="3544" LastEditorUserId="3544" LastEditDate="2014-02-20T07:47:29.077" LastActivityDate="2014-02-20T07:47:29.077" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1037" PostTypeId="2" ParentId="2140" CreationDate="2014-02-20T08:11:39.930" Score="2" Body="&lt;h1&gt;Efficient Testing for Armstrong Numbers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;An Armstrong Number (also known by different names, including Narcissistic Number; see &lt;a href=&quot;http://en.wikipedia.org/wiki/Narcissistic_number&quot; rel=&quot;nofollow&quot;&gt;Wikipedia&lt;/a&gt; for more information) is a non-negative number (for our purposes represented in base 10) that is equal to the sum of the individual digits of the number each raised to the power of the number of digits. For example:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Start with the three digit number 407.&lt;/li&gt;&#xA;&lt;li&gt;The individual digits are 4, 0, &amp;amp; 7.&lt;/li&gt;&#xA;&lt;li&gt;Since it is a three digit number, we raise each digit to the third power: 64 (4^3), 0 (0^3), &amp;amp; 343 (7^3).&lt;/li&gt;&#xA;&lt;li&gt;The sum of those values is 407 (64 + 0 + 343).&lt;/li&gt;&#xA;&lt;li&gt;Because the final sum is equal to the original number, it is an Armstrong Number.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;By contrast:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Start with 47.&lt;/li&gt;&#xA;&lt;li&gt;The individual digits are 4 &amp;amp; 7.&lt;/li&gt;&#xA;&lt;li&gt;A two digit number, so raise each digit to the second power: 16 (4^2) &amp;amp; 49 (7^2).&lt;/li&gt;&#xA;&lt;li&gt;The sum of those values is 65 (16 + 49).&lt;/li&gt;&#xA;&lt;li&gt;The final sum of 65 is not the original number, so it is not an Armstrong Number.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Your mission, should you decide to accept it: Write a program in any programming language (using only standard language features and libraries) implementing the &lt;strong&gt;most efficient algorithm&lt;/strong&gt; possible to test the numbers from 1 through 18,446,744,073,709,551,615 (2&lt;sup&gt;64&lt;/sup&gt;-1) inclusive for &quot;Armstrongness&quot;, generating a list of Armstrong Numbers, and only Armstrong Numbers, as output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While any language is acceptable, it should be obvious that interpreted scripting languages will be at a disadvantage in the efficiency department. That being said, a superior algorithm in an interpreted scripting language can beat the pants off an inefficient algorithm in hand tuned assembly language.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winning Criteria&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The algorithm that can check all possible candidate numbers for &quot;Armstrongness&quot; in the least amount of time on a reference computer will be the winner. The reference computer will have the following specifications: {approximately an AMD Phenom class computer with 8 GB RAM running Windows 7 Ultimate 64 bit}&lt;/p&gt;&#xA;" OwnerUserId="6457" LastEditorUserId="6457" LastEditDate="2014-03-12T20:15:04.417" LastActivityDate="2014-03-12T20:15:04.417" CommentCount="17" ContentLicense="CC BY-SA 3.0" />
  <row Id="1038" PostTypeId="2" ParentId="1005" CreationDate="2014-02-20T19:14:39.277" Score="-5" Body="&lt;p&gt;What about &lt;code&gt;for e!&lt;/code&gt;?  Golf plus code plus short variable name&lt;/p&gt;&#xA;" OwnerUserId="13950" LastActivityDate="2014-02-20T19:14:39.277" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1039" PostTypeId="1" AcceptedAnswerId="1041" CreationDate="2014-02-20T21:12:26.420" Score="8" ViewCount="169" Body="&lt;p&gt;As established in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/763/9498&quot;&gt;Remove Auto CW Limit&lt;/a&gt; , the auto-community wiki limit is not 500 answers. However, there are many questions left on the site that are marked community wiki because they have &gt;60 answers. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;We should remove the community wiki from those posts. There is now no reason for them to be marked community wiki.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Questions that are community wiki but shouldn't be (feel free to add to this list):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/2/9498&quot;&gt;99 Bottles Of Beer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/4244/9498&quot;&gt;Code Golf Christmas Edition: How to print out a Christmas tree of height N&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/307/9498&quot;&gt;Obfuscated Hello World&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/1091/9498&quot;&gt;What&amp;#39;s my name? Produce the name of the language indirectly&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-02-20T21:32:17.877" Title="Un-community wiki questions" Tags="|discussion|community-wiki|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1040" PostTypeId="2" ParentId="1013" CreationDate="2014-02-20T21:16:56.897" Score="6" Body="&lt;p&gt;While on other SE sites it is usual that someone comes here with a question first (and is completely okay), I think at codegolf it's better if someone actually answers a few questions first before giving others a new task. Therefore I don't think it's bad that you need at least one upvoted answer to actually participate in the sandbox.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course for this to work it would be better if there would be indications of the sandbox when asking a question (especially for new users). I know that this won't probably happen until the site goes out of beta.&lt;/p&gt;&#xA;" OwnerUserId="8732" LastActivityDate="2014-02-20T21:16:56.897" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1041" PostTypeId="2" ParentId="1039" CreationDate="2014-02-20T21:32:17.877" Score="8" Body="&lt;p&gt;I agree they should be converted into normal posts. However, a staff member would have to do so, because when I last looked into this, I had to unwiki each answer, in addition to the question. I don't look forward to doing this for 60+ answers. :-)&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-02-20T21:32:17.877" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1042" PostTypeId="2" ParentId="202" CreationDate="2014-02-20T22:14:20.567" Score="3" Body="&lt;h1&gt;SQL (Including PL/SQL, T-SQL, MySQL, etc.)&lt;/h1&gt;&#xA;&lt;p&gt;While IdeOne may offer an SQL interpreter, to fully leverage SQL you need a database schema and a server to host it. Not to mention, ANSI SQL is more or less dead and every variant of the language has its own ways of implementing all the things that aren't covered in the standard.&lt;/p&gt;&#xA;&lt;p&gt;That's where &lt;a href=&quot;http://sqlfiddle.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;SQLFiddle.com&lt;/a&gt; comes in, with support for building a schema in a host environment and then querying against it.&lt;/p&gt;&#xA;&lt;p&gt;Presently-available host environments:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;MySQL 5.5.32&lt;/li&gt;&#xA;&lt;li&gt;MySQL 5.6.6 m9&lt;/li&gt;&#xA;&lt;li&gt;MySQL 5.1.61&lt;/li&gt;&#xA;&lt;li&gt;Oracle 11g R2&lt;/li&gt;&#xA;&lt;li&gt;PostgreSQL 9.3.1&lt;/li&gt;&#xA;&lt;li&gt;PostgreSQL 9.2.4&lt;/li&gt;&#xA;&lt;li&gt;PostgreSQL 9.1.9&lt;/li&gt;&#xA;&lt;li&gt;PostgreSQL 8.4.17&lt;/li&gt;&#xA;&lt;li&gt;PostgreSQL 8.3.20&lt;/li&gt;&#xA;&lt;li&gt;SQLite (WebSQL)&lt;/li&gt;&#xA;&lt;li&gt;SQLite (SQL.js)&lt;/li&gt;&#xA;&lt;li&gt;MS SQL Server 2012&lt;/li&gt;&#xA;&lt;li&gt;MS SQL Server 2008&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Very handy!&lt;/p&gt;&#xA;" OwnerUserId="3363" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-02-20T22:14:20.567" CommentCount="0" CommunityOwnedDate="2014-02-20T22:14:20.567" ContentLicense="CC BY-SA 3.0" />
  <row Id="1047" PostTypeId="1" CreationDate="2014-02-20T20:53:51.887" Score="-1" ViewCount="71" Body="&lt;p&gt;Shouldn't the users on codegolf be able to close their question after let's say the question's winners are announced without them having to have some amount of reputation?&lt;/p&gt;&#xA;" OwnerUserId="16091" OwnerDisplayName="iani" LastEditorUserId="68942" LastEditDate="2021-06-09T05:46:56.493" LastActivityDate="2021-06-09T05:46:56.493" Title="Shouldn't the users on codegolf be able to close their questions?" Tags="|feature-request|status-declined|code-golf|closed-questions|reputation|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1048" PostTypeId="2" ParentId="1047" CreationDate="2014-02-21T08:41:42.937" Score="2" Body="&lt;p&gt;No. The purpose of closing questions is to prevent answers being posted while problems with the question are fixed. If it's a good question, there's no benefit to anyone in preventing everyone from posting answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition, the last time community feeling on the subject of saying &quot;This person has won: game over&quot; was taken, it was &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/542/194&quot;&gt;strongly against&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2014-02-21T08:41:42.937" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1050" PostTypeId="2" ParentId="286" CreationDate="2014-02-21T15:48:55.267" Score="-1" Body="&lt;p&gt;Well, I'm new here, but CodeGolf seems to exist because it has hard criterions for defining the winner. But you could also define other criterions without losing the CodeGolf principle:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The longest of the shortened programs which provides the expected output wins. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Of course, we're still in CodeGolf, so it's not just about writing nonsense code. Still, the goal is to reduce any unnecessary character. We might downvote if someone seems to cheat by adding unnecessary characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Maybe this needs a new tag like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf-reversed&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf-reversed&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf-reversed&lt;/a&gt;. Maybe this can be applied to other challenges as well, and we would introduce &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/winner-reversal&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;winner-reversal&amp;#39;&quot; rel=&quot;tag&quot;&gt;winner-reversal&lt;/a&gt; which can be applied in addition to existing tags.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;While the question remains unchanged, the winner of the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/242/reverse-stdin-and-place-on-stdout&quot;&gt;Reverse stdin and place on stdout&lt;/a&gt; question would be &lt;a href=&quot;https://codegolf.stackexchange.com/a/274/16901&quot;&gt;the C++ version&lt;/a&gt;. The longer &lt;a href=&quot;https://codegolf.stackexchange.com/a/12704/16901&quot;&gt;C version&lt;/a&gt; would not win, because it didn't make a reasonable attempt to shorten the code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hard to understand? Well, not harder than any golfed code...&lt;/p&gt;&#xA;" OwnerUserId="16901" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2014-02-21T16:17:02.440" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1052" PostTypeId="1" AcceptedAnswerId="1055" CreationDate="2014-02-21T17:31:34.633" Score="3" ViewCount="75" Body="&lt;p&gt;Because &lt;a href=&quot;http://blog.stackoverflow.com/2010/08/the-death-of-meta-tags/&quot;&gt;Meta Tags&lt;/a&gt; are now discouraged on SE sites, I don't think that the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/advanced&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;advanced&amp;#39;&quot; rel=&quot;tag&quot;&gt;advanced&lt;/a&gt; tag is a good tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it is a meta tag, because:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If the tag can’t work as the only tag on a question, it’s probably a meta-tag.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It can't work as the only tag. It needs other tags, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; ...&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If the tag commonly means different things to different people, it’s probably a meta-tag.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/advanced&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;advanced&amp;#39;&quot; rel=&quot;tag&quot;&gt;advanced&lt;/a&gt; means something else for different people: person A can find a challenge an advanced challenge, while person B can find it a intermediate challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should the tag be removed?&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="3" LastEditDate="2014-02-21T23:36:41.063" LastActivityDate="2014-04-23T09:29:32.537" Title="Is [advanced] a meta tag?" Tags="|discussion|status-completed|tags|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1053" PostTypeId="1" AcceptedAnswerId="1054" CreationDate="2014-02-21T17:52:06.863" Score="5" ViewCount="132" Body="&lt;p&gt;Today someone posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/21676/visual-studio-settings-for-c-code-golfing&quot;&gt;a 'tips for golfing' question&lt;/a&gt;. Some people think it should be posted on Meta, and other people think it should be posted on the Main site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, where should we actually post 'tips for golfing' questions? On the main site or on Meta?&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-04-21T18:45:45.123" Title="'Tips for golfing' questions: on the main site or on meta?" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1054" PostTypeId="2" ParentId="1053" CreationDate="2014-02-21T17:53:01.893" Score="7" Body="&lt;p&gt;Tips-for-golfing questions belong on the main site, but should be community wiki.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-02-21T17:53:01.893" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1055" PostTypeId="2" ParentId="1052" CreationDate="2014-02-21T18:00:36.817" Score="3" Body="&lt;p&gt;I agree that that tag adds no value whatsoever. To my understanding, &lt;a href=&quot;https://meta.stackexchange.com/q/124504/13&quot;&gt;moderators can't delete a tag directly&lt;/a&gt;, so I have put a request for a staff member to go take care of it.&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-02-21T18:00:36.817" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1056" PostTypeId="1" AcceptedAnswerId="1058" CreationDate="2014-02-22T05:13:19.230" Score="2" ViewCount="88" Body="&lt;p&gt;I was thinking about ways to reduce the size of the sandbox, and I came up with three points that could potentially be addressed.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The most upvoted answers rise to the top, and those questions are posted.  Afterward, those questions stay at the top, increasing scrolling distance to the new questions.&lt;/li&gt;&#xA;&lt;li&gt;The comments on questions get extremely long - almost chatroom length.  I don't know if there is a feasible way of addressing this, but if the comments were removed after the issue was addressed or after the question was posted, that would help.  Another possible solution is to have a chatroom for the comments of a question.&lt;/li&gt;&#xA;&lt;li&gt;Some people edit the question to say {POSTED} after they post it.  This helps, as some questions are extremely long.  If more people would do this, I would greatly help in minimizing the length of the sandbox.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;I don't know if any of these three main issues could be addressed, but perhaps some of you have novel ideas that could reduce the size of our sandbox, thereby allowing it to be used for more questions.&lt;/p&gt;&#xA;" OwnerDisplayName="user10766" LastEditorDisplayName="user10766" LastEditDate="2014-02-23T23:52:29.200" LastActivityDate="2014-02-23T23:52:29.200" Title="Length of Sandbox" Tags="|discussion|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1057" PostTypeId="2" ParentId="1005" CreationDate="2014-02-22T08:29:55.593" Score="-4" Body="&lt;p&gt;Code Hanger                              &lt;br&gt;          &lt;/p&gt;&#xA;" OwnerUserId="13074" LastActivityDate="2014-02-22T08:29:55.593" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1058" PostTypeId="2" ParentId="1056" CreationDate="2014-02-22T15:59:45.820" Score="4" Body="&lt;p&gt;Let's see&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Many people prefer to sort the sandboxes by activity, meaning that long posted or long dormant entries float to the bottom and ones currently under revision to the top. Of course, I believe this means diddling the sort order as you browse other parts of the site. Alternately voluntary deletion of sandbox entries after a while (in addition to editing to {Posted} status) could help.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Comment hiding parameters on site metas are set to much more permissive levels than on main sites. If there is enough interest we could ask the team to choose a less permissive setting for us so that more of long threads would be hidden. Also, voluntary deletion of comments relating to corrected mistakes would help. I suspect it is better to &lt;em&gt;leave&lt;/em&gt; comments relating to decision where the right answer is a matter of choice, however (to preempt a reemergence of the same issue).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The {Posted} status edits are a big win, and and my choice would be for them to be sanctioned for all edit-empowered users.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="78" LastEditorUserId="78" LastEditDate="2014-02-22T18:46:34.093" LastActivityDate="2014-02-22T18:46:34.093" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1059" PostTypeId="1" AcceptedAnswerId="1060" CreationDate="2014-02-22T16:08:50.240" Score="3" ViewCount="117" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/21775/how-does-this-obfuscated-javascript-code-work&quot;&gt;https://codegolf.stackexchange.com/questions/21775/how-does-this-obfuscated-javascript-code-work&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is not a puzzle and it isn't related in any way to the site. So how come it is migrated from stackoverflow to here?&lt;/p&gt;&#xA;" OwnerUserId="12291" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-02-22T16:38:26.887" Title="why is this question migrated here?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1060" PostTypeId="2" ParentId="1059" CreationDate="2014-02-22T16:38:26.887" Score="3" Body="&lt;p&gt;Some Stack Overflow moderators may be new or inexperienced. Newly-privileged users could have mistakenly migrated it here without knowing what the real purpose of this site is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Perhaps it should be migrated to Code Review or back to Stack Overflow.&lt;/p&gt;&#xA;" OwnerUserId="10740" LastActivityDate="2014-02-22T16:38:26.887" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1061" PostTypeId="1" CreationDate="2014-02-22T23:30:50.643" Score="424" ViewCount="218025" Body="&lt;p&gt;There are a number of standard loopholes which experienced question-setters seek to explicitly close. However, inexperienced question-setters may unintentionally leave them open, or respondents may try to argue for contorted interpretations of the question in order to side-step attempts to close them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The purpose of this question is to provide a repository of standard loopholes which may be assumed to be closed without the question-setter having to explicitly close them. The intention is that each answer shall contain one and only one loophole (to allow independent voting); and that the loophole described in any answer which is at +5 or above and has at least twice as many upvotes as downvotes may be taken to be deemed to be unacceptable to the community. A link to that answer may be provided in a comment to accompany &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990&quot;&gt;a downvote and a flag&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1280&quot;&gt;Return to FAQ index&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="46076" LastEditDate="2019-10-27T01:13:34.423" LastActivityDate="2023-12-01T13:58:40.550" Title="Loopholes that are forbidden by default" Tags="|discussion|faq|policy|answers|defaults|" AnswerCount="54" CommentCount="11" CommunityOwnedDate="2014-03-18T00:35:51.703" ContentLicense="CC BY-SA 4.0" />
  <row Id="1062" PostTypeId="2" ParentId="1061" CreationDate="2014-02-22T23:37:27.983" Score="385" Body="&lt;h2&gt;Fetching the desired output from an external source&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This includes doing an HTTP request to fetch the page with the question and extracting a solution from that page. This was mildly amusing back in 2011, but now is derivative and uninteresting.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="194" LastEditDate="2019-08-11T16:18:02.460" LastActivityDate="2019-08-11T16:18:02.460" CommentCount="8" CommunityOwnedDate="2014-03-18T00:35:51.703" ContentLicense="CC BY-SA 3.0" />
  <row Id="1063" PostTypeId="2" ParentId="1061" CreationDate="2014-02-22T23:41:40.563" Score="143" Body="&lt;h2&gt;Hard-coding the output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Unless the question is an obvious exception (the primary exception being those tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;), your program is expected to do work, not just print a pre-calculated result. If the question doesn't require input and so a solution which just prints the answer would seem to meet the spec, downvote the question rather than post a protest answer consisting of the literal output.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-02-22T23:41:40.563" CommentCount="10" CommunityOwnedDate="2014-03-18T00:35:51.703" ContentLicense="CC BY-SA 3.0" />
  <row Id="1064" PostTypeId="1" AcceptedAnswerId="1065" CreationDate="2014-02-23T06:22:08.077" Score="2" ViewCount="39" Body="&lt;p&gt;I couldn't figure out how to make the needed edits to change my answer status on the sandbox to posted, and I was wondering for future reference. &lt;/p&gt;&#xA;" OwnerUserId="14668" LastEditorUserId="9498" LastEditDate="2014-02-23T06:32:13.417" LastActivityDate="2014-02-23T18:17:24.280" Title="How do you mark a question as posted on the sandbox?" Tags="|discussion|editing|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1065" PostTypeId="2" ParentId="1064" CreationDate="2014-02-23T06:32:53.480" Score="2" Body="&lt;p&gt;Just click on the edit beneath the rest of the answer and edit in the textarea that comes up.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Like so:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/ONYbj.png&quot; alt=&quot;enter image description here&quot; title=&quot;Thanks to mniip for supplying this freehand red circle image&quot;&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="9498" LastEditDate="2014-02-23T18:17:24.280" LastActivityDate="2014-02-23T18:17:24.280" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1067" PostTypeId="2" ParentId="1013" CreationDate="2014-02-23T10:37:31.647" Score="2" Body="&lt;p&gt;I think having a sandbox on the main site might be worth trying &amp;mdash; not so much because of the 5 rep threshold, which I feel is pretty much a non-issue for the reasons &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1040&quot;&gt;SztupY describes&lt;/a&gt;, but simply because it might increase the visibility and use of the sandbox, and thereby improve the quality of the challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We should at least give it a try &amp;mdash; if it doesn't work out, we can always migrate the sandbox(es) back to meta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regarding some issues raised in the comments above:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;We should probably close retired sandboxes on the main site.  This would prevent them from being bumped by new proposals, and should thus cause them to gradually sink off the front page.  (Comments don't bump threads.  Answer edits do, but presumably those would taper off gradually after closing, as the old proposals are turned into challenges or just abandoned.  I might expect to see one or two sandbox questions on the front page, but rarely more than that.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The boilerplate text for the sandbox questions could suggest sorting answers by activity.  In fact, it probably should do that anyway.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If people &lt;em&gt;really&lt;/em&gt; want to ignore old sandboxes, we could consider making a special tag like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sandbox-closed&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sandbox-closed&amp;#39;&quot; rel=&quot;tag&quot;&gt;sandbox-closed&lt;/a&gt; for them that could be ignored without ignoring the &lt;em&gt;current&lt;/em&gt; sandbox.  Anyway, note that even ignoring all sandboxes doesn't actually &lt;em&gt;hide&lt;/em&gt; them &amp;mdash; it just grays them out so that they're easier to skim over.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The fact that deleted answers can clutter up the answer list is annoying (to 2k+ users), but not specific to sandboxes or to this site &amp;mdash; it's annoying on &lt;em&gt;any&lt;/em&gt; question that has a lot of deleted answers.  The best solution (short of convincing the SE devs to show deleted answers in collapsed form by default) is probably a user script &amp;mdash; if there isn't a suitable one out there already, I could try to write one.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2014-02-23T10:37:31.647" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1068" PostTypeId="1" CreationDate="2014-02-23T11:03:17.737" Score="3" ViewCount="167" Body="&lt;p&gt;I'm quite new to Programming Puzzles &amp;amp; Code Golf, and my question &lt;a href=&quot;https://codegolf.stackexchange.com/q/21796/15022&quot;&gt;Calculate all the squares up to x using only addition and subtraction&lt;/a&gt; has been closed as a duplicate, who say it's a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/q/2469/15022&quot;&gt;Most optimized algorithm for incrementing squares&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't think that my question is a duplicate, as I specifically ask for only addition and subtraction.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, is there anything I can improve in my question, or is it clearly a duplicate?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thank you.&lt;/p&gt;&#xA;" OwnerUserId="15022" LastEditorUserId="15022" LastEditDate="2014-02-23T11:57:19.040" LastActivityDate="2014-02-26T10:04:19.990" Title="My question (calculate all the squares up to x using only addition and subtraction) has being closed as a duplicate" Tags="|discussion|close-reasons|new-users|" AnswerCount="3" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1069" PostTypeId="2" ParentId="2140" CreationDate="2014-02-23T12:06:56.873" Score="-4" Body="&lt;h1&gt;Output the number of lines of your code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a program that counts the number of its lines of code and outputs them. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Specs:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The number mustn't be hardcoded into the program, nor in any other external resource;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Internet access is forbidden;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program's output must be the number of lines &lt;strong&gt;only&lt;/strong&gt;;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program should not use any tool, macro, function, or similar device designed with the specific purpose of counting lines.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="12626" LastEditorUserId="12626" LastEditDate="2014-02-24T10:09:01.200" LastActivityDate="2014-02-24T10:09:01.200" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="1070" PostTypeId="2" ParentId="1061" CreationDate="2014-02-23T14:37:35.533" Score="465" Body="&lt;h2&gt;Interpreting the challenge too literally&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;That is, if the challenge says &quot;write a function that, given a number &lt;em&gt;n&lt;/em&gt;, returns the &lt;em&gt;n&lt;/em&gt;-th prime&quot;, posting something equivalent to:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function f($n) {&#xA;    return &quot;the $n-th prime&quot;;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="3191" LastActivityDate="2014-02-23T14:37:35.533" CommentCount="11" CommunityOwnedDate="2014-03-18T00:35:51.703" ContentLicense="CC BY-SA 3.0" />
  <row Id="1071" PostTypeId="2" ParentId="1061" CreationDate="2014-02-23T14:45:22.453" Score="332" Body="&lt;h2&gt;Using a made-up language specifically designed for the challenge&lt;/h2&gt;&#xA;&lt;p&gt;This includes any language with commands that &lt;a href=&quot;//en.wikipedia.org/wiki/Humpty_Dumpty#Lewis_Carroll%27s_Through_the_Looking-Glass&quot; rel=&quot;nofollow noreferrer&quot;&gt;&amp;quot;do whatever I choose them to do&amp;quot;&lt;/a&gt;.  Claiming that your answer is written in &amp;quot;MyOwnLanguage&amp;quot;, where the command &lt;code&gt;x&lt;/code&gt; means &amp;quot;read a sequence of numbers, split them into groups of three, and print the last numbers of those groups where the second number is less than the first&amp;quot;, was clever &lt;a href=&quot;http://esolangs.org/wiki/HQ9%2B&quot; rel=&quot;nofollow noreferrer&quot;&gt;the first time it was done&lt;/a&gt;.  That was a &lt;em&gt;long&lt;/em&gt; time ago.&lt;/p&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="20696" LastEditDate="2021-04-30T14:16:51.670" LastActivityDate="2021-04-30T14:16:51.670" CommentCount="13" CommunityOwnedDate="2014-03-18T00:35:51.703" ContentLicense="CC BY-SA 4.0" />
  <row Id="1072" PostTypeId="2" ParentId="1061" CreationDate="2014-02-23T17:23:13.273" Score="183" Body="&lt;h1&gt;Using the program name to store data without counting those bytes&lt;/h1&gt;&#xA;&lt;p&gt;Example - this bash script prints &lt;code&gt;Hello World!&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;echo $0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Must be saved in a file called &lt;code&gt;Hello World!&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;When using the filename to store data, add them as extra bytes to your solution similarly to any non-standard parameter.&lt;/p&gt;&#xA;&lt;p&gt;For example the correct byte count for the above is 7 (&lt;code&gt;echo $0&lt;/code&gt;) + 12 (&lt;code&gt;Hello World!&lt;/code&gt;) = 19 bytes.&lt;/p&gt;&#xA;" OwnerUserId="3544" LastEditorUserId="3544" LastEditDate="2021-04-03T11:19:58.667" LastActivityDate="2021-04-03T11:19:58.667" CommentCount="15" CommunityOwnedDate="2014-03-18T00:35:51.703" ContentLicense="CC BY-SA 4.0" />
  <row Id="1073" PostTypeId="2" ParentId="1013" CreationDate="2014-02-23T17:32:59.200" Score="0" Body="&lt;p&gt;When asking a question, you get the &quot;How to Ask&quot; text which is very visible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the SE framework supports it, I'd add a suggestion to use the sandbox (linked to the current) and/or read and answer some questions first.&lt;/p&gt;&#xA;" OwnerUserId="3544" LastActivityDate="2014-02-23T17:32:59.200" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1076" PostTypeId="2" ParentId="286" CreationDate="2014-02-23T19:33:02.737" Score="18" Body="&lt;p&gt;I understand the collective sentiment against GolfScript and J and I would probably share it too, if I didn't happen to use a language that can usually compete on the same ground, &lt;strong&gt;APL&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;An apology of APL&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Whatever the community will choose to do with GolfScript (ban it, score it with a penalty, score it separately) &lt;strong&gt;I hope APL won't be banned outright, because it's a truly remarkable language with a long history&lt;/strong&gt;, not to mention a lot of fun to code in. Maybe it should just be scored differently, so that people don't feel like it's competing unfairly. I'll give my suggestions below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for the language itself, I was originally drawn to it by its strange symbolic alphabet, which I'm sure baffles most people who see it for the first time:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;⌽ ⍉ ⊖ ↑ ↓ ≤ ≠ ≥ ≡ ⎕ ⍞ ⍤ ⍥ ⍨ ⌹ ⍬ ⍕ ⍎ ⍳ ∊ ⍷ ⌿ ⍀ ⊂ ∩ ∪ ⊃ ⍟ ⍣ …&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Most symbols were taken straight from mathematics and have the same meaning, others were invented by APL's author (Kenneth E. Iverson) and some of those even found their way back into mainstream mathematics (⎣⎦ and ⎡⎤ for the floor and ceiling functions, for example.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The symbols sure make for a different way of coding, but it's not an arid exercise in golfing. It's not harder to learn how to use &lt;code&gt;⌽&lt;/code&gt;, for example, or how to type it on a keyboard, than if it were called &lt;code&gt;reverse()&lt;/code&gt; as in most other languages, because the shape of the symbol is usually a mnemonic for what it does (in the case of &lt;code&gt;⌽&lt;/code&gt;, it represents horizontal reflection.) I'd wager it's even easier: I have less trouble remembering how to use APL symbols, than I have with the order of arguments of common functions such as &lt;code&gt;replace()&lt;/code&gt; in other languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As I said, I was originally drawn to APL by the weird symbols, but I stayed for the &lt;strong&gt;array-oriented nature&lt;/strong&gt; of the language. After learning how to code in APL, and how to manipulate entire arrays with a couple symbols, it just feels &lt;em&gt;wrong&lt;/em&gt; to write &lt;code&gt;for&lt;/code&gt; loops by hand. This is also one of the reasons APL fares so well in code golf.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;J&lt;/strong&gt; and &lt;strong&gt;K/Q&lt;/strong&gt; people will share this view, because those languages derive from APL and are based on the same array programming concepts. But those languages chose to forego the mnemonic nature of the symbols (or twist them into ugly ASCII digraphs) making them somewhat harder to use and remember, and less pleasing to the eye, in my very humble opinion.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;About scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In my APL posts, up to now, I've always added a footnote claiming that APL could be scored as&lt;br&gt;&#xA;1 char = 1 byte.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This claim rests on the fact that a few (mostly commercial) APL implementations still support some form of legacy single-byte encoding, where the APL symbols are mapped to the upper 128 byte values.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although strictly true, this is probably a bit of a stretch.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I wouldn't mind if this community decided to score APL as UTF-8 or UTF-16 bytes, since it does use a different alphabet than most other programming languages. As long as a similar penalty was chosen for J and GolfScript, that is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One possible way would be to &lt;strong&gt;choose a few classic code golfs and score each language proportionally to how it fared in those competitions.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a way, we would be borrowing the concept of &lt;strong&gt;par&lt;/strong&gt; from real golf.&lt;/p&gt;&#xA;" OwnerUserId="8665" LastActivityDate="2014-02-23T19:33:02.737" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1077" PostTypeId="2" ParentId="1061" CreationDate="2014-02-23T20:50:22.087" Score="93" Body="&lt;h2&gt;Identical functions with different names&lt;/h2&gt;&#xA;&lt;p&gt;For example, if &lt;code&gt;+&lt;/code&gt; is forbidden, using&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;num3 = num1.add(num2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;num3 = num1&#xA;num3 += num2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;num1++&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or (GolfScript)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;etc.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-02-23T21:12:39.763" CommentCount="3" CommunityOwnedDate="2014-03-18T00:35:51.703" ContentLicense="CC BY-SA 3.0" />
  <row Id="1078" PostTypeId="2" ParentId="1061" CreationDate="2014-02-23T23:49:30.050" Score="-61" Body="&lt;h1&gt;Using built-in functions to do the work&lt;/h1&gt;&#xA;&lt;p&gt;Mathematica is a big one for this, with &lt;code&gt;Fibonacci[n]&lt;/code&gt; to calculate the &lt;code&gt;n&lt;/code&gt;'th Fibonacci number....  I have no objection to these being posted as a side note within the main answer though - that is interesting and helps me learn different languages capabilities.&lt;/p&gt;&#xA;&lt;p&gt;Another one that encounters this more often than most is with Assembly, especially with questions requiring bitwise-related operations, such as ARM's &lt;code&gt;rbit&lt;/code&gt; reversing the bits in place or Haswell's &lt;code&gt;pext&lt;/code&gt; to extract bits according to a mask.&lt;/p&gt;&#xA;" OwnerDisplayName="user10766" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-26T01:46:34.317" CommentCount="20" CommunityOwnedDate="2014-03-18T00:35:51.703" ContentLicense="CC BY-SA 3.0" />
  <row Id="1079" PostTypeId="1" AcceptedAnswerId="1083" CreationDate="2014-02-24T03:08:08.510" Score="4" ViewCount="92" Body="&lt;p&gt;There have been ~9 attempted vandalisms (see the &lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits/history&quot;&gt;review history&lt;/a&gt; if you really want to see them all) of the same kind over the last 23 hours by an anonymous user, presumably the same IP address. Is there any way we can deal with this other than just rejecting the edits? Perhaps if they are all from the same IP address, could that address be banned?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sample suggested edit: &lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits/8843&quot;&gt;https://codegolf.stackexchange.com/review/suggested-edits/8843&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-02-24T14:58:04.787" Title="Attempted Vandalism by Anonymous User" Tags="|support|reviewing|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1080" PostTypeId="2" ParentId="1061" CreationDate="2014-02-24T06:14:32.473" Score="139" Body="&lt;h1&gt;Copying an (unimproved) answer from elsewhere&lt;/h1&gt;&#xA;&lt;p&gt;If it's not your own work, and you can't even try enough to golf or improve it, then it's not yours to post.&lt;/p&gt;&#xA;" OwnerUserId="3363" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-04-12T19:26:57.497" CommentCount="11" CommunityOwnedDate="2014-03-18T00:35:51.703" ContentLicense="CC BY-SA 4.0" />
  <row Id="1081" PostTypeId="1" CreationDate="2014-02-24T07:02:40.730" Score="4" ViewCount="127" Body="&lt;p&gt;I recently posted an answer to a challenge. I included a rather lengthy &quot;how it's done&quot; guide with the answer. I want to make the explanation available because I find it interesting and I hope a few others do, too. I don't really want to include the guide with the answer though because 1) it's really long, and 2) I kind of like the mystery without the &quot;how to&quot; staring you directly in the face. Is there another good place on codegolf to put it?&lt;/p&gt;&#xA;" OwnerUserId="16504" LastActivityDate="2014-03-01T18:33:10.620" Title="Where to post a long explanation / how-to" Tags="|discussion|answers|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1082" PostTypeId="2" ParentId="16" CreationDate="2014-02-24T10:13:16.443" Score="24" Body="&lt;p&gt;There are three reasons why I think Project Euler etc. questions shouldn't be posted here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first is copyright. The question submitter &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;... represents, warrants and agrees that it will not contribute any Subscriber Content that (a) infringes, violates or otherwise interferes with any copyright or trademark of another party ...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;(StackExchange &lt;a href=&quot;http://stackexchange.com/legal&quot;&gt;Terms of Service&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The second is that Project Euler strongly discourages people from seeking help elsewhere: the correct place to compare solutions to PE problems is in the forum which you unlock by submitting a correct answer. See Will Jagy's &lt;a href=&quot;https://math.meta.stackexchange.com/a/3313/5676&quot;&gt;report of discussion with PE&lt;/a&gt; about questions posted on math.stackexchange.com.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The third is common courtesy. Ripping off other sites isn't nice.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T15:44:22.130" LastActivityDate="2014-02-24T10:13:16.443" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1083" PostTypeId="2" ParentId="1079" CreationDate="2014-02-24T14:58:04.787" Score="6" Body="&lt;p&gt;First and foremost I'd like to sent a great big &lt;strong&gt;&lt;em&gt;ATABOY&lt;/em&gt;&lt;/strong&gt; to our reviewers. Unanimous rejection of all of those implies the absence of robo-reviewing. Yeah for us!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moderators have no more direct handle on that kind of thing than do ordinary users, but I will bring it to the attention of the team. And thanks for the heads-up.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2014-02-24T14:58:04.787" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1084" PostTypeId="2" ParentId="1061" CreationDate="2014-02-24T21:15:23.087" Score="-17" Body="&lt;h1&gt;Using comments to circumvent character requirements/restrictions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It's cute and makes you laugh once, but when you see it several times over several challenges, it just becomes facetious and contrary to the spirit of the game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example: &lt;a href=&quot;https://codegolf.stackexchange.com/a/12370/5358&quot;&gt;https://codegolf.stackexchange.com/a/12370/5358&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="5358" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2014-02-24T21:15:23.087" CommentCount="8" CommunityOwnedDate="2014-03-18T00:35:51.703" ContentLicense="CC BY-SA 3.0" />
  <row Id="1085" PostTypeId="2" ParentId="1061" CreationDate="2014-02-25T00:40:08.087" Score="176" Body="&lt;h2&gt;Outsourcing the real answer&lt;/h2&gt;&#xA;&lt;p&gt;I still did not see people using this thing here in serious answers (just in some jokes ones), but already saw it being used seriously elsewhere. To circumvent restrictions and rules in the question (normally size), the answerer writes a small program that downloads the real program from elsewhere and then compiles and runs it.&lt;/p&gt;&#xA;&lt;p&gt;A variant of this is posting an answer that takes input from the user and then submits it to somewhere on the Internet that is responsible for solving the problem and send back the output.&lt;/p&gt;&#xA;" OwnerUserId="3755" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-03-05T18:16:14.880" CommentCount="6" CommunityOwnedDate="2014-03-18T00:35:51.703" ContentLicense="CC BY-SA 3.0" />
  <row Id="1086" PostTypeId="1" AcceptedAnswerId="1087" CreationDate="2014-02-25T05:11:29.633" Score="6" ViewCount="184" Body="&lt;p&gt;Take a look at &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1067/9498&quot;&gt;https://codegolf.meta.stackexchange.com/a/1067/9498&lt;/a&gt; and the discussion here: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1013/how-can-new-users-use-the-sandbox/1067#comment3632_1013&quot;&gt;How can new users use the Sandbox?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my question &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1013/9498&quot;&gt;How can new users use the Sandbox?&lt;/a&gt; , I question whether the sandbox should be moved to the main site. Jan Dvorak convinced me that it might be a good idea. Please vote here (on the accepted answer) on whether it should or should not be moved to the main site. Also, feel free to post any concerns, etc that should be addressed concerning this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The answer is only accepted to make it easier to find.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Post any suggestions for what this sandbox should be like as an answer and people can vote on these too.&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2014-02-27T05:51:41.327" Title="Should the sandbox be moved to the main site?" Tags="|discussion|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1087" PostTypeId="2" ParentId="1086" CreationDate="2014-02-25T05:11:29.633" Score="4" Body="&lt;p&gt;I think that the sandbox should be moved to the main site. Please vote up or down on this answer regarding this decision, maybe commenting your concerns. This answer should have an overwhelming majority for migration to the main site before we decide to do so.&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="9498" LastEditDate="2014-02-25T06:42:58.887" LastActivityDate="2014-02-25T06:42:58.887" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="1089" PostTypeId="1" AcceptedAnswerId="1090" CreationDate="2014-02-25T06:09:57.410" Score="4" ViewCount="262" Body="&lt;p&gt;I've seen a lot of code-only answers in the Low-Quality review queue. What should our response to these answers be? Although they have all been flagged as low-quality, I've been posting a comment welcoming new users and asking them to explain how their answer works, then clicking &quot;Looks Good&quot; (because I don't think they should be deleted).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Wouldn't it be nicer to add an explanatory comment asking for an explanation rather than flag or downvote?&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="9498" LastEditDate="2014-02-25T06:14:57.450" LastActivityDate="2014-02-25T16:09:58.680" Title="What should our response to code-only answers be?" Tags="|discussion|reviewing|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1090" PostTypeId="2" ParentId="1089" CreationDate="2014-02-25T06:11:28.810" Score="7" Body="&lt;p&gt;Many of the low-quality flags are auto-generated by Community. I wouldn't take them too seriously.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-02-25T06:11:28.810" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1091" PostTypeId="2" ParentId="1086" CreationDate="2014-02-25T06:43:33.373" Score="7" Body="&lt;p&gt;I think it should be community-wiki because no-one should be getting rep from it. However, this does not mean that anyone can edit each other's post without asking.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Counterargument: rep will motivate people to use the sandbox.&lt;/p&gt;&#xA;" OwnerUserId="9498" LastActivityDate="2014-02-25T06:43:33.373" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1092" PostTypeId="2" ParentId="1068" CreationDate="2014-02-25T09:45:38.317" Score="1" Body="&lt;p&gt;There is a slight difference between the literal wording of the close reason:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;and the way it is used on this stack and others. The general rule is: a question is a duplicate of another if it naturally gets the same answers. In other words, the second sentence of the message is more significant than the first. On other stacks this is because the point is to guide people to the right answer, and closing with a link to a page which answers their question achieves that goal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This stack is different, because it's about having fun answering rather than resolving people's uncertainties. However, a similar principle applies. If we already have a page of answers which just need a tiny tweak, what's the point of copying them all across? Maybe it lets people get double points for their answers, but the attention drawn by the closed question pointing at the older one usually gives the better answers a small bump anyway.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this particular case, your question is closer to the existing one than many which get closed as duplicates on the grounds that existing answers just need a small tweak to solve them. (See e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/q/20210/194&quot;&gt;Partition of array&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I should note one exception: when a very general problem has been asked, a more specific instance might be worth keeping open &lt;em&gt;if&lt;/em&gt; there is a good reason to expect that the additional structure will allow solutions which aren't applicable to the general problem but are better than the solutions to the general problem.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-02-25T09:45:38.317" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1093" PostTypeId="2" ParentId="1086" CreationDate="2014-02-25T13:56:05.783" Score="3" Body="&lt;p&gt;If moving to the main site, and only allowing one sandbox, then my concern is that there will be simply too many answers there. And even after filtering by activity it would just look like a huge mess. So my proposals:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Make it a community-wiki. Gaining rep is good, but the next two points will make the gained rep useless anyway&lt;/li&gt;&#xA;&lt;li&gt;Delete your answer shortly after posting it to the main site. As it's already posted as a separate question there is no use for it polluting the sandbox. The answer can be flagged and deleted after one week of posting it.&lt;/li&gt;&#xA;&lt;li&gt;You have one month to gather enough information to fix your problem. If you don't post it after a month it can be flagged and deleted.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;By flagged and deleted I mean it's still up to the mods / high-rep users to decide whether to really delete the answer or not, but before the time limit they should never delete them (unless flagged for other reasons, like spam or abuse), and should also decline any delete request flags on these answers.&lt;/p&gt;&#xA;" OwnerUserId="8732" LastActivityDate="2014-02-25T13:56:05.783" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1094" PostTypeId="2" ParentId="2140" CreationDate="2014-02-25T14:28:46.487" Score="1" Body="&lt;h1&gt;The shortest C program which generates the most instructions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a very short C program (length being defined by character count) which generates the most instructions when compiled. Of course, indicate your compiler, the version, and your operating system, and say what your program does. Linked libraries do not count!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Score&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Base score: &lt;strong&gt;1/(characters) * (instructions)&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Bonus: if it computes something &quot;useful,&quot; &lt;strong&gt;+20%&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I'm fascinated by C challenges and compiler oddities, but I'm not sure about this question because of the variance you'll get between different compiler versions. Would it be acceptable to ask users to use an online resource which will compile C to assembly? I found two after a cursory search:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://assembly.ynh.io/&quot; rel=&quot;nofollow&quot;&gt;C/C++ to Assembly v2&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://gcc.godbolt.org/&quot; rel=&quot;nofollow&quot;&gt;GCC Explorer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="14347" LastEditorUserId="14347" LastEditDate="2014-02-25T15:03:43.473" LastActivityDate="2014-02-25T15:03:43.473" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1095" PostTypeId="2" ParentId="1089" CreationDate="2014-02-25T15:38:40.397" Score="2" Body="&lt;p&gt;I think code-only answers are, in general, legitimate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/3093/3544&quot;&gt;In some cases&lt;/a&gt;, if you understand the language you don't need explanations.&lt;br&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/3044/3544&quot;&gt;In other cases&lt;/a&gt;, there's no real way to appreciate an answer without them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I wouldn't say we need to ban them or something.&lt;/p&gt;&#xA;" OwnerUserId="3544" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2014-02-25T15:38:40.397" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1096" PostTypeId="2" ParentId="1089" CreationDate="2014-02-25T16:09:58.680" Score="3" Body="&lt;p&gt;I agree with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1090/3755&quot;&gt;Chris Jester-Young&lt;/a&gt;. I do not take those auto-generated flags too seriously. And I add this: If possible (normally it is), edit the answer to improve its formatting. If the answer is salvageable, go on and save it (ditto for questions). I am doing this for sometime, the result was that I got the first Strunk &amp;amp; White badge of the site.&lt;/p&gt;&#xA;" OwnerUserId="3755" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2014-02-25T16:09:58.680" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1097" PostTypeId="2" ParentId="1068" CreationDate="2014-02-25T23:06:13.153" Score="5" Body="&lt;p&gt;The old question has no winning criteria and is ill-defined. My brain raises compilation error trying to understand this sentence of the old question:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Write the &quot;fastest&quot; program to print an incrementing series of squares from a given input to a given input.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Fortunately the provided input/output example make it comprehensible, and this could be salvaged by editing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The big problem in the old question is that it has no well-defined objective winning criteria, it is just &quot;The entries will be judged on the most efficient algorithm&quot;. How do you measure efficiency? Is this algorithmic complexity? What about measuring it for randomized algorithms? What should be done in the case of two tying entries? In my opinion, the old question should be closed as off-topic for lacking an objective winning criteria, but there should be no reason to do this for a 3-year old question, except that it can be used as an excuse to spoil the fun of whoever wants to answer the new question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anyway, even if someone comes with a precise definition of the efficiency in the old question, the new question is a code-golf and have different rules on what is permitted to do or not. So, it is likely that most entries in the new question (including the most likely to win) would be invalid in the old question. All the answers in the old question are invalid in the new. This is a strong sign that it is not a duplicate.&lt;/p&gt;&#xA;" OwnerUserId="3755" LastActivityDate="2014-02-25T23:06:13.153" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1099" PostTypeId="1" AcceptedAnswerId="1121" CreationDate="2014-02-26T05:58:05.593" Score="1" ViewCount="53" Body="&lt;p&gt;The review queue currently shows me &lt;a href=&quot;https://codegolf.stackexchange.com/review/late-answers/8959&quot;&gt;https://codegolf.stackexchange.com/review/late-answers/8959&lt;/a&gt; in the late answers section. The options given for review are &lt;em&gt;I'm Done&lt;/em&gt;  and &lt;em&gt;Skip&lt;/em&gt;. &lt;em&gt;No Action Needed&lt;/em&gt; is grayed out and not available. although. I didn't edit or vote on this answer and therefore expected that &lt;em&gt;No Action Needed&lt;/em&gt; is available and &lt;em&gt;I'm Done&lt;/em&gt; is invalidated.&lt;/p&gt;&#xA;" OwnerUserId="1490" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-02-28T14:08:24.697" Title="Incorrect review options" Tags="|support|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1100" PostTypeId="2" ParentId="2140" CreationDate="2014-02-26T06:19:35.193" Score="0" Body="&lt;h1&gt;Create a Karnaugh-map calculator&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given an input of a truth table, generate a corresponding &lt;a href=&quot;http://en.wikipedia.org/wiki/Karnaugh_map&quot; rel=&quot;nofollow noreferrer&quot;&gt;K-map&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input will be of the form &lt;code&gt;10110001&lt;/code&gt; where each bit is a row of a truth table. Count from the left to the right; so that input would be a table of:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;i&lt;sub&gt;2&lt;/sub&gt;i&lt;sub&gt;1&lt;/sub&gt;i&lt;sub&gt;0&lt;/sub&gt; f&#xA;0 0 0|1&#xA;0 0 1|0&#xA;0 1 0|1&#xA;0 1 1|1&#xA;1 0 0|0&#xA;1 0 1|0&#xA;1 1 0|0&#xA;1 1 1|1&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Max 4 variables will be inputted&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;K-maps&lt;/strong&gt; (a small explanation):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;K-maps are a way of simplifying boolean-algebra expressions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's say we have 4 variables: a, b, c, d. Let the truth-table be &lt;code&gt;1110101001111111&lt;/code&gt; (and the columns on the truth table be labeled, from left to right: a, b, c, d). Arrange the variables like so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   cd&#xA;ab\   00 01 11 10&#xA;   00&#xA;   01&#xA;   11&#xA;   10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note the &lt;a href=&quot;http://en.wikipedia.org/wiki/Grey_code&quot; rel=&quot;nofollow noreferrer&quot;&gt;grey-code&lt;/a&gt; counting scheme.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fill in the table with the corresponding values from the truth table:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   cd&#xA;ab\   00 01 11 10&#xA;   00 1  1  0  1&#xA;   01 1  0  0  1&#xA;   11 0  1  1  1&#xA;   10 1  1  1  1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Group the values in rectangles whose dimensions are the largest possible powers of two. Note that this table signifies a torus, so wrap over the left and right edges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/vXDfQ.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The expression for the truth table is the &lt;code&gt;or&lt;/code&gt;s of the &lt;code&gt;and&lt;/code&gt; of the unchanging elements. For this, that would be:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Purple group: ¬b ∧ ¬c (for 0's, make them 1 by notting the value)&lt;br&gt;&#xA;Green group: ¬a ∧ ¬d&lt;br&gt;&#xA;Black group: a ∧ d&lt;br&gt;&#xA;Blue group: b ∧ ¬d&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Expression: (¬b ∧ ¬c) ∨ (¬a ∧ ¬d) ∨ (a ∧ d) ∨ (b ∧ ¬d)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Generate a 2D K-map (for more variables, add on either side) and show the grouping. K-map must be of the form I used. For less variables, remove rows or columns and change the list on the top left corner.&lt;/li&gt;&#xA;&lt;li&gt;assume alphabetical ordering on the variables, that is, the first variable is &lt;code&gt;a&lt;/code&gt;, second: &lt;code&gt;b&lt;/code&gt;, third: &lt;code&gt;c&lt;/code&gt;, and so on.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Also show the expression. Rather than use the unicode characters, the following is permissible:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;~ instead of ¬&#xA;* instead of ∧&#xA;+ instead of ∨&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Edit: Possible duplicate: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/12300/more-fun-with-gates-karnaugh-simplification&quot;&gt;More fun with gates: Karnaugh simplification&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.653" LastActivityDate="2014-02-27T05:56:32.117" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="1101" PostTypeId="2" ParentId="2140" CreationDate="2014-02-26T09:08:49.590" Score="0" Body="&lt;h1&gt;Create diagonal code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to create a program that outputs &lt;code&gt;d=s*sqrt(2)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Specs:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program must be at least 4 lines long;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;d=s*sqrt(2)&lt;/code&gt; cannot be hardcoded &lt;strong&gt;as is&lt;/strong&gt; (so using ascii, compression, encoding, etc. is allowed and encouraged);&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For each line of code &lt;code&gt;n&lt;/code&gt;, pick up the &lt;code&gt;n&lt;/code&gt;th character. The string obtained this way must be a valid program in a programming language of your choice, that must be different from the one you used for the main program. The obtained program &lt;strong&gt;must&lt;/strong&gt; compile successfully, but it can throw errors, exceptions, etc.;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If at the &lt;code&gt;n&lt;/code&gt;th line there is no &lt;code&gt;n&lt;/code&gt;th character, you can consider that character as a &lt;strong&gt;whitespace&lt;/strong&gt; or a &lt;strong&gt;newline&lt;/strong&gt;. This cannot be done for the first 4 lines, which must be long at least &lt;code&gt;n&lt;/code&gt; non-whitespace characters.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your main program &lt;strong&gt;must&lt;/strong&gt; end successfully (no errors, exceptions, etc.);&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Internet access is forbidden;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Most upvoted answer in 2 weeks wins.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Happy coding!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I was unsure about making this a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; with several bonuses (polyglot answer, secondary program still valid, etc...).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Some bonuses for the code-challenge version:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your valid answer starts with &lt;strong&gt;0&lt;/strong&gt; points. You gain:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;+10&lt;/strong&gt; if the secondary answer hides a third answer in it;&lt;br&gt;&#xA;&lt;strong&gt;+15&lt;/strong&gt; for any other hidden answer;&lt;br&gt;&#xA;&lt;strong&gt;+5&lt;/strong&gt; for every hidden answer that runs and ends successfully, without any problem;&lt;br&gt;&#xA;&lt;strong&gt;+10&lt;/strong&gt; if your main answer is a polyglot;&lt;br&gt;&#xA;&lt;strong&gt;+15&lt;/strong&gt; for every hidden answer that is a polyglot;  &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Which version would you prefer? Is there something you would change/improve in this question?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I personally like the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; one, but the &lt;strong&gt;KISS&lt;/strong&gt; principle (Keep it simple, stupid!) reminds me that I may be wrong.&lt;/p&gt;&#xA;" OwnerUserId="12626" LastEditorUserId="12626" LastEditDate="2014-02-26T09:28:58.603" LastActivityDate="2014-02-26T09:28:58.603" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1102" PostTypeId="2" ParentId="1068" CreationDate="2014-02-26T10:04:19.990" Score="3" Body="&lt;p&gt;I do beleive that your question isn't a duplicate.&lt;br&gt;&#xA;The task is a bit different, and the answers aren't the exact same, they are similar, because they use the same algorithm. The whole point of algorithms is to solve many similar tasks.&lt;/p&gt;&#xA;" OwnerUserId="7162" LastActivityDate="2014-02-26T10:04:19.990" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1103" PostTypeId="1" AcceptedAnswerId="1107" CreationDate="2014-02-26T15:49:43.923" Score="1" ViewCount="114" Body="&lt;p&gt;Today (one/two hours ago, to be honest) I happened to see a suggested edit to a question in the main site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While the edit was actually pretty good (it would have removed a flaw that probably wasn't considered by the OP), I was wondering if users should do such heavy edits to another user's question. With &lt;em&gt;heavy&lt;/em&gt;, I mean adding rules, changing the tag (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; for instance), or something else that could invalidate some answers or change the spirit of the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question now is: should we just suggest such edits in the comments, and leave the edit task to the OP, or not?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I personally think that this should be is enough, since changing the rules should be the task of the OP (if he didn't use the sandbox, otherwise changing rules wouldn't have been necessary in most of the cases), but I'm asking your opinion.&lt;/p&gt;&#xA;" OwnerUserId="12626" LastActivityDate="2014-02-27T00:09:35.910" Title="Should users edit rules or just suggest them?" Tags="|discussion|editing|" AnswerCount="4" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1104" PostTypeId="2" ParentId="1103" CreationDate="2014-02-26T16:00:37.583" Score="2" Body="&lt;p&gt;&lt;em&gt;(Speaking as a &lt;a href=&quot;http://stackexchange.com/users/9&quot;&gt;long-time Stack Exchange user&lt;/a&gt;, not as a moderator.)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Making edits directly is the Stack Exchange way. If the OP doesn't like the edit, they should revert and/or amend it.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-02-26T16:00:37.583" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1106" PostTypeId="2" ParentId="1103" CreationDate="2014-02-26T19:48:18.707" Score="1" Body="&lt;p&gt;If you think that the OP would probably agree with the change, simply do it. Just today, I did this in two different questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you have little doubt, do it, and drop a comment asking for the OP what he thinks about.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you think that the edit will be good, but is unsure of what the OP thinks, ask him/her. If he agrees, he/she will probably edit the question. If he/she agrees, but do not edit the question, do it.&lt;/p&gt;&#xA;" OwnerUserId="3755" LastActivityDate="2014-02-26T19:48:18.707" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1107" PostTypeId="2" ParentId="1103" CreationDate="2014-02-26T20:02:11.293" Score="3" Body="&lt;p&gt;Once you post anything on a stack exchange site, you don't really &quot;own&quot; it anymore - you just get to keep any internet points it generates. It's really a case of giving due respect to the author.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We (our community) &lt;em&gt;want&lt;/em&gt; the community to improve questions. Especially those from new comers who sometimes have a good idea for a question but phrase it badly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the change isn't wanted there is always rollbacks/comments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Deliberate vandalism on this site is quite rare (so far)&lt;/p&gt;&#xA;" OwnerUserId="95" LastActivityDate="2014-02-26T20:02:11.293" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1108" PostTypeId="2" ParentId="1103" CreationDate="2014-02-27T00:09:35.910" Score="3" Body="&lt;p&gt;It depends. Try answering these questions. If you answer &quot;yes&quot; to any, it should probably be a comment, not an edit.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Will it invalidate existing answers (other than removing obvious loopholes)?&lt;/li&gt;&#xA;&lt;li&gt;Is it a radical change (i.e. could it reasonably be posted as a new question)?&lt;/li&gt;&#xA;&lt;li&gt;Will the OP probably disagree with your edit?&lt;/li&gt;&#xA;&lt;li&gt;Are you changing the winning criterion? (Adding one OTOH is probably ok)&lt;/li&gt;&#xA;&lt;li&gt;Did the OP explicitly state that he/she did not want it changed?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-02-27T00:09:35.910" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1109" PostTypeId="1" CreationDate="2014-02-27T02:48:50.310" Score="17" ViewCount="786" Body="&lt;p&gt;I've noticed that &lt;a href=&quot;https://codegolf.stackexchange.com/users/3755/victor?tab=activity&amp;amp;sort=revisions&quot;&gt;this user&lt;/a&gt; is making a lot of edits lately, and all they do is add the &lt;code&gt;&amp;lt;!--language: * --&amp;gt;&lt;/code&gt; syntax highlighting hint.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, I'm not saying this is bad (props to that user for trying to help improve the site!), but  should posts be edited for only minor syntax coloring hints (which has a side-effect of bumping the posts to the front page as well)?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I've also noticed that this user is only editing new posts, and avoiding bumping old posts, which is also a nice thing to notice, so thanks to that user for that also.)&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2014-03-01T14:41:35.557" Title="Mass editing of syntax highlighting - good or bad?" Tags="|discussion|editing|" AnswerCount="5" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="1110" PostTypeId="2" ParentId="1109" CreationDate="2014-02-27T05:30:01.390" Score="18" Body="&lt;p&gt;I personally enjoy these syntax coloring edits. Several of my posts have been edited to include syntax coloring, and they became much more readable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On a side note: before reading this post, I edited a large number of posts to include syntax coloring. Perhaps I should have done it at a smaller amount at a time.&lt;br&gt;&#xA;Sorry.&lt;/p&gt;&#xA;" OwnerUserId="9498" LastActivityDate="2014-02-27T05:30:01.390" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1111" PostTypeId="1" AcceptedAnswerId="1112" CreationDate="2014-02-27T05:44:49.357" Score="2" ViewCount="130" Body="&lt;p&gt;I &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1110/9498&quot;&gt;recently started exploring syntax coloring&lt;/a&gt; and discovered that I can color Befunge code a certain way that makes it look better (IMO). Is there some way of creating syntax coloring for this site?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or perhaps a user-script (how does one make those)?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There seem to be a few languages who don't have syntax colorings:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;GolfScript&lt;/li&gt;&#xA;&lt;li&gt;Befunge&lt;/li&gt;&#xA;&lt;li&gt;Processing&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Could we create colorings for them too?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/959/add-line-height-shortener-to-the-ascii-art-tag#comment3460_962&quot;&gt;Add line-height shortener to the ascii-art tag&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Proposed syntax coloring for Befunge (character by character):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;'()@[]{}                                               &amp;lt;span class=&quot;str&quot;&amp;gt;&amp;lt;/span&amp;gt;&#xA;0123456789+-*%/                                         &amp;lt;span class=&quot;lit&quot;&amp;gt;&amp;lt;/span&amp;gt;&#xA;$=\_|~&amp;amp; ^&amp;gt;&amp;lt;v?                                           &amp;lt;span class=&quot;kwd&quot;&amp;gt;&amp;lt;/span&amp;gt;&#xA;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuwxy#;    &amp;lt;span class=&quot;com&quot;&amp;gt;&amp;lt;/span&amp;gt;&#xA;`.,: !z                                                 &amp;lt;span class=&quot;pln&quot;&amp;gt;&amp;lt;/span&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.313" LastActivityDate="2014-04-23T09:29:32.537" Title="Experimental Syntax coloring" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1112" PostTypeId="2" ParentId="1111" CreationDate="2014-02-27T08:40:11.737" Score="3" Body="&lt;p&gt;Concerning the idea of making SE to create additional syntax highlighting for the site you will have to ask on &lt;a href=&quot;https://meta.stackoverflow.com/&quot;&gt;metaSO&lt;/a&gt;. Now, there are several things to take into account:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;SE uses &lt;a href=&quot;http://code.google.com/p/google-code-prettify/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Google Code Prettify&lt;/a&gt; to render syntax highlighting, so the language you want to add needs to &lt;a href=&quot;http://google-code-prettify.googlecode.com/svn/trunk/README.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;be available as an extension&lt;/a&gt; to this;&lt;/li&gt;&#xA;&lt;li&gt;All people visiting any pages on the site will have to load that extension at every page loaded, so it needs to be worth it (high number of posts needing it), light-weight (see &lt;a href=&quot;https://meta.stackexchange.com/questions/221290/update-prettify-to-include-new-languages-available-for-example-xquery&quot;&gt;this thread&lt;/a&gt; for instance) and a clear improvement as, for many language, the 'default' syntax highlighting (the one triggered by &lt;code&gt;&amp;lt;!--language: default --&amp;gt;&lt;/code&gt; or by any lang-* that exists but is not yet implemented like typically lang-r) does already a good job (recognize comments, common control flow like &lt;code&gt;if&lt;/code&gt;and &lt;code&gt;while&lt;/code&gt; and recognize string).  &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;FYI you have a list of currently implemented SH &lt;a href=&quot;https://meta.stackexchange.com/questions/184108/what-is-syntax-highlighting-and-how-does-it-work&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;NB: I'm currently campaigning on meta to get syntax highlighting for R on SO, so I did some research on that recently, hence my answer.&lt;/p&gt;&#xA;" OwnerUserId="6741" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-02-27T09:46:04.283" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1113" PostTypeId="2" ParentId="1109" CreationDate="2014-02-27T12:50:08.497" Score="5" Body="&lt;p&gt;I think that in general syntax highlighting is too trivial to be the sole purpose of an edit. If I saw such an edit in the review queue, I would reject it on that basis.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-02-27T12:50:08.497" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1114" PostTypeId="2" ParentId="1109" CreationDate="2014-02-27T18:09:38.250" Score="-3" Body="&lt;p&gt;I always assumed the lack of syntax-coloring here was by design. It makes more sense for a language-specific site (e.g. TeX.se, Mathematica.se, DBA.se)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's worth noting that the way multi-language sites on SE achieve highlighting is by setting a default highlighting hint for language-specific tags. This works pretty well on SO where a questioner tags a question about C# and responses in C# are automatically highlighted. Here, with the rare exception of language-specific challenges, we have no way to use a tag to set a sensible default. That makes all syntax highlighting a manual process. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since many of the golf answers are compressed to a single line anyway, what does syntax coloring add if 65% of it is hidden beyond the edge of the div?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the whole, I like syntax highlighting. I just see syntax highlighting every post on PPCG as a potentially Sisyphean endeavor. If there are no sensible defaults, it leaves us with a lot of manual work.&lt;/p&gt;&#xA;" OwnerUserId="3363" LastEditorUserId="3363" LastEditDate="2014-03-01T14:41:35.557" LastActivityDate="2014-03-01T14:41:35.557" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1115" PostTypeId="2" ParentId="1109" CreationDate="2014-02-27T20:32:18.700" Score="13" Body="&lt;p&gt;Ok, lets enumerate some points:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Initially when I saw java answers, the lack of syntax coloring really makes the code horrible. By editing them it becames a lot better.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Quickly realized that this is not only a problem of java answers. This is a general problem. The syntax coloring is a good thing, and if no one starts that no one does that. This is a reason that I am disagreeing with @Peter Taylor. If we really want to improve the quality of this site, lets fix not only the big problems, but the small ones too.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I was careful to not bump old posts. I may accidentally had bumped one or two that I shouldn't, but I am really thinking to avoid this.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I am expecting that people follow my example. Go on people, lets improve the quality of this site. If you see something could be improved, do it. This is the way that a lot of other betas here on SE work. @Quincunx, nice that you enjoyed. Instead of stopping, I invite you to intesify this activity.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I am seeing now that the number of answers that already comes syntax-colored is raising (not by much, but it is). This is a sign that my strategy is starting to work. Some comes with broken syntax-coloring tags, meaning that some people are trying to experiment with them.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;@Gareth, The Strunk &amp;amp; White badge is not only my objective. I already have it and I could stop after that, but I didn't. In fact I enjoy to fix other people questions and answers when I can. And frankly, it is a shame for a site that is more than 3 years in beta, that the first one to get that badge is active only in the last two months.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Most of my editions in fact are for adding syntax coloring and fixing small formatting stuff. But not all, by editing I already avoided some questions to be closed and made a few be reopened. I am proud of this.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;@Jonathan Van Matre: If I see that the syntax coloring would not really improve the question/answer, I normally don't do it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;@Doorknob, thanks for saying that I am trying to improve the site. &lt;code&gt;:)&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I might had edited wrongly a few times, if so, sorry, I am human. But I think that in most of those edits, I did it right.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="3755" LastEditorUserId="3755" LastEditDate="2014-02-27T22:53:57.243" LastActivityDate="2014-02-27T22:53:57.243" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1118" PostTypeId="2" ParentId="2140" CreationDate="2014-02-28T04:55:17.367" Score="2" Body="&lt;h2&gt;Golf a random Human Genome fragment with non-random features&lt;/h2&gt;&#xA;&lt;p&gt;A totally random genome fragment is easy enough: just spit out the letters ATCG in random order, and you're done. So let's try something a little less random and more useful to science.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Your program will:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Accept an argument from the user for &lt;strong&gt;number of base pairs&lt;/strong&gt; (20bp-10000bp must be supported, more if you wish)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Accept an argument from the user for &lt;strong&gt;GC content&lt;/strong&gt;. This indicates how frequently the generated sequence should contain the G and C bases as a percentage of total sequence length.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Include at least &lt;strong&gt;one complete gene in every request of 500bp or more&lt;/strong&gt;, where a gene is defined as an otherwise random sequence that begins with a start codon triplet (ATG) and ends with the first stop codon triplet it encounters (TAG, TGA, or TAA). The distance between the start codon and the stop codon does &lt;em&gt;not&lt;/em&gt; have to be a multiple of 3.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Vary gene content&lt;/strong&gt; (the portion of the fragment that is &amp;quot;gene&amp;quot;, inclusive of the gene's start and stop codons) &lt;strong&gt;linearly with respect to GC content&lt;/strong&gt; (when sequence &amp;gt;= 500bp). At the extremes, when GC content is 0%, gene content is 10%; when GC content is 100%, gene content is 60%.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Output a single-strand sequence&lt;/strong&gt; that complies with the above specs and the user's given parameters. (i.e. a single row of letters will suffice since it is trivial to deduce the complementary strand of the DNA given the sequence of one strand)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Calculate the actual GC content %, actual number of genes, and actual gene content % in the resulting fragment, and &lt;strong&gt;output a status line below the sequence&lt;/strong&gt; conforming to the example format below. Percentages may be rounded to one decimal place. Actual values may deviate by +/- 3% from the expected outcome based on user's input.&lt;/p&gt;&#xA;&lt;p&gt;GC content: 42.1% | Genes: 3 | Gene content: 32.1%&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Your program will not:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use any Internet, library, or built-in gene sequence generation functions or databases. Roll your own.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Sufficient randomness:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For the purposes of this challenge, any built-in random/pseudo-random number generator function, GUID generator, well-seeded cryptographic hash function, etc. is considered an acceptable source of randomness.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;What-ifs:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;What if another start codon occurs before the stop codon?&lt;/strong&gt; E.g. ATGXXXATGXXXXXXXXXXXXTAG. This is acceptable, but the &amp;quot;gene&amp;quot; length in this case is calculated from the most proximal start codon to the stop codon.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;What if another stop codon occurs after a stop codon?&lt;/strong&gt; E.g. ATGXXXXXXXXXXXXXTAGXXXXXXTAG&#xA;This is also acceptable, but likewise the &amp;quot;gene&amp;quot; length is calculated from the start to the most proximal stop.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;What if both of these things happen?&lt;/strong&gt; E.g. ATGXXXATGXXXXXXXXXXXXTAGXXXTGA. Here again, the &amp;quot;most proximal&amp;quot; principle applies and the gene content is demarcated by the innermost start and the innermost stop.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Do &amp;quot;orphaned&amp;quot; start and stop codons that do not demarcate a gene count as gene content?&lt;/strong&gt; No.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This challenge is code golf, so shortest &lt;em&gt;valid&lt;/em&gt; code wins.&lt;/p&gt;&#xA;&lt;p&gt;Post example output from a 500-bp request with GC content between 35% and 65%, and have fun!&lt;/p&gt;&#xA;" OwnerUserId="3363" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-02-28T17:25:44.200" CommentCount="19" ContentLicense="CC BY-SA 3.0" />
  <row Id="1120" PostTypeId="2" ParentId="1109" CreationDate="2014-02-28T08:38:21.077" Score="17" Body="&lt;p&gt;&lt;em&gt;I was about to write this as a comment, but to give it more relevance I'm writing this down here.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I actually appreciated it when he edited &lt;a href=&quot;https://codegolf.stackexchange.com/questions/21571/generate-an-understandable-sentence/21661#21661&quot;&gt;one of my answers&lt;/a&gt;; It made it more readable and understanding. It was a real eye-saver for anyone who wanted to give it a serious reading.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since he's not bumping posts I don't think there's anything wrong with it. As others said, if one doesn't like the edit, he can rollback. I think that it should be done little by little, though.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While I agree with Peter Taylor, saying that's a minor edit, I disagree with the fact that's not worth an &quot;Accept&quot; button click. For longer posts it's really really helpful, and has a positive impact on people coming from the research engines (I actually was really surprised when I saw SO for the first time...).&lt;/p&gt;&#xA;" OwnerUserId="12626" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-02-28T08:38:21.077" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1121" PostTypeId="2" ParentId="1099" CreationDate="2014-02-28T14:08:24.697" Score="0" Body="&lt;p&gt;You've already added a flag to this answer:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Kdcyi.png&quot; alt=&quot;flag info&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="207" LastActivityDate="2014-02-28T14:08:24.697" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1123" PostTypeId="1" AcceptedAnswerId="1134" CreationDate="2014-02-28T17:48:57.940" Score="1" ViewCount="67" Body="&lt;p&gt;This admittedly popular and amusing question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/5836/coding-in-song-representing-music-lyrics-in-a-programming-language-of-your-cho&quot;&gt;Coding in song - Representing music lyrics in a programming language of your choosing&lt;/a&gt; is unfolding in an unusual manner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To me, the crux of the problem is that the question doesn't define any objective winning criteria. Essentially, the questioner has self-appointed emself as the Olympic judge who comes along after you answer to rate and score your answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it were a popularity contest, then the objectivity would be &quot;the will of the community rules&quot; and it would be judged on upvotes. Since it is not a popularity contest, I believe it requires objective winning criteria or it is not a valid question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="3363" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-03-01T10:17:40.743" Title="Self-appointed Olympic judges (non-objective scoring by questioners)" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1125" PostTypeId="2" ParentId="1081" CreationDate="2014-02-28T23:06:19.153" Score="2" Body="&lt;p&gt;You could post it to an online fiddle site (Ideone, jsfiddle, etc.) with explanatory comments in the version there.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then people are free to follow the link if they want to see how the sausage is made, but it's not in their face as they are reading the answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or just blog about it and link to your blog. Past posts on meta.SO have established that is Ok if you're not being blatantly self-promotional or a huckster/shill.&lt;/p&gt;&#xA;" OwnerUserId="3363" LastActivityDate="2014-02-28T23:06:19.153" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1126" PostTypeId="1" CreationDate="2014-02-28T23:19:01.667" Score="10" ViewCount="475" Body="&lt;p&gt;Recently, browsing questions of PPCG, i have found a lot of questions that are simply for the purpose of offloading their homework assignments, due to lasiness or easiness of this platform. For this reason, i believe we should ban homework questions. Any input?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/22416/factor-numbers-for-me&quot;&gt;https://codegolf.stackexchange.com/questions/22416/factor-numbers-for-me&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/16479/how-do-i-split-a-string-help-plz-code-trolling&quot;&gt;How do I split a string??? Help plz? (code trolling)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/16639/please-give-me-fibonacci-sequence-the-code&quot;&gt;https://codegolf.stackexchange.com/questions/16639/please-give-me-fibonacci-sequence-the-code&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/16226/i-need-a-program-where-the-user-inputs-an-array-of-doubles-and-the-program-outpu&quot;&gt;I need a program where the user inputs an array of doubles and the program outputs the array sorted&lt;/a&gt; (sort of)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="16472" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-04-20T15:48:07.413" Title="Should homework be allowed?" Tags="|discussion|challenge-quality|" AnswerCount="5" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1127" PostTypeId="2" ParentId="1126" CreationDate="2014-03-01T00:05:56.010" Score="9" Body="&lt;p&gt;Can you provide some examples?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In general, I agree with the principle of the top answer to StackOverflow's &lt;a href=&quot;https://meta.stackexchange.com/questions/10811/how-do-i-ask-and-answer-homework-questions/10812#10812&quot;&gt;discussion of homework questions.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, because our site works differently, perhaps we should treat homework differently.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The SO position is: it's OK to ask, but show some prior effort, and it's OK to answer, but try to lead the questioner in the right direction instead of giving a fully-formed answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This latter point is the difficult part for PPCG, because to have a valid answer to a challenge here you need to submit a complete, working program. There's really no way for us to avoid handing them a finished assignment without compromising the mission of this site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I lean toward banning homework questions when it seems obvious that they are looking for someone to do their assignment for them. E.g. if their request is language-specific, that would be a red flag that they have to write something in Scheme or Java or whatever for class. Or if it has the kind of silly constraints that indicate an arbitrary aspect of a class assignment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I'd be open to accepting homework questions when the questioner honestly tells us it is such, and lets us know what language(s) they are doing the assignment in. We could have a standard policy to submit answers to such questions only in languages the student is not allowed to use. Thus, they can learn from some of the algorithms and methods employed in solutions without having the work done for them. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am curious to see some of the recent examples you have found, because I think it will add to the discussion to be able to talk about &quot;Is there such a thing as a good homework question vs a bad one? What makes them different?&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit to Add&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ok, the examples of what you're looking at are not only enlightening, they have me convinced that this entire topic is one epic troll of the Meta forum on your part.&lt;/p&gt;&#xA;" OwnerUserId="3363" LastEditorUserId="-1" LastEditDate="2014-04-23T13:27:21.650" LastActivityDate="2014-03-01T04:19:26.153" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1128" PostTypeId="2" ParentId="1126" CreationDate="2014-03-01T01:49:21.327" Score="34" Body="&lt;p&gt;I think that, as a general policy, if we see a challenge that is clearly homework, we should leave it open without complaint (perhaps even upvote it or leave compliments on the excellent question), but any requested language should be ignored and all answers should be written in Befunge or Brainfuck.&lt;/p&gt;&#xA;" OwnerUserId="16504" LastActivityDate="2014-03-01T01:49:21.327" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1129" PostTypeId="2" ParentId="1126" CreationDate="2014-03-01T03:47:19.763" Score="14" Body="&lt;ol&gt;&#xA;&lt;li&gt;Student posts homework question&lt;/li&gt;&#xA;&lt;li&gt;Student receives answer in esolang (like GolfScript) or extremely convoluted answer in standard PL (i.e. golfed JS, with globals and all sorts of Boolean abuse and all)&lt;/li&gt;&#xA;&lt;li&gt;Student receives nothing of value to turn in, members of PPCG get to enjoy a good challenge&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;This is a non-issue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Now, if the challenge requests a specific language, we can simply edit it to make it language-agnostic, since most golfs are anyway.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also note that all your linked questions are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;, meaning that said student would receive a zero at best if they turned it in. (I mean, really, just &lt;em&gt;look&lt;/em&gt; at some of those ridiculous answers)&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="34718" LastEditDate="2016-04-20T15:43:30.793" LastActivityDate="2016-04-20T15:43:30.793" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1130" PostTypeId="1" AcceptedAnswerId="1133" CreationDate="2014-03-01T04:56:05.197" Score="0" ViewCount="114" Body="&lt;p&gt;There are several answers which have been flagged as &quot;not an answer&quot; which were indeed answers. Consequently, I flagged them with &quot;invalid flags&quot;. Why is it that all of those flags were disputed? Here is an example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/19290/9498&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/iPmHo.png&quot; alt=&quot;&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This answer was flagged as &quot;not an answer&quot; (I think), but it clearly is. I used to think that perhaps my flagging was flagging the &quot;invalid flags&quot; flags as invalid flags, but this answer changed my mind. I was the first person to flag it with &quot;invalid flags&quot; (and many others flagged likewise). Why was this flag disputed?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My flagging history clearly shows several other such cases.&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-04-23T09:29:32.537" Title="Why was my flag disputed?" Tags="|support|flags|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1132" PostTypeId="2" ParentId="1130" CreationDate="2014-03-01T09:34:37.217" Score="1" Body="&lt;p&gt;As stated &lt;a href=&quot;https://meta.stackexchange.com/a/95277/229438&quot;&gt;here&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Both the original flag and the flag used to mark it as invalid will be listed as &amp;quot;disputed&amp;quot; in the respective user's flagging summary. Once a flag has been disputed, its state will not be changed by any additional action on the post.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;And as stated &lt;a href=&quot;https://meta.stackexchange.com/a/112394/229438&quot;&gt;here&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;When you flag as invalid, both the original flag(s) and yours are marked as &amp;quot;disputed&amp;quot; (and flag weight is unaffected for all).&lt;/p&gt;&#xA;&lt;p&gt;That's what the &amp;quot;disputed&amp;quot; resolution says: there were diverging opinions on these flags.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;So don't be worried that your &amp;quot;invalid flags&amp;quot; flags are disputed: it's by design.&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-03-01T09:34:37.217" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1133" PostTypeId="2" ParentId="1130" CreationDate="2014-03-01T10:08:17.457" Score="0" Body="&lt;p&gt;Ilmari comments on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/825/194&quot;&gt;another question about flags&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Generally, AIUI, &lt;strong&gt;one should not use the &quot;it has invalid flags&quot; option unless one&lt;/strong&gt; disagrees with all the flags on the post (since doing so automatically marks all the flags as disputed) and &lt;strong&gt;believes it shouldn't have been flagged at all&lt;/strong&gt;, but that's not very well explained on the page, and some 10k'ers might not know it.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;(My emphasis)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It seems to me, then, that a reasonable partial explanation is that your &quot;invalid flags&quot; flag was disputed by my flag to moderators observing that the answer should be community wiki, because it was copying a standard example program for the language.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2014-03-01T10:08:17.457" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1134" PostTypeId="2" ParentId="1123" CreationDate="2014-03-01T10:17:40.743" Score="1" Body="&lt;p&gt;It's wryly humorous that the poster of that question never selected a winner anyway, but it's clear that by current standards it's off-topic, and since StackExchange praxis in general seems to be that off-topic questions which draw attention to themselves by attracting new answers are closed, I have voted to close it.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-03-01T10:17:40.743" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1135" PostTypeId="2" ParentId="1081" CreationDate="2014-03-01T18:33:10.620" Score="-2" Body="&lt;p&gt;You should keep it there, but make it code, so it will have it's own scroll bar (except on mobile). I wouldn't prefer external resources, as they can be down / lost / deleted, making the explanation unreachable.&lt;/p&gt;&#xA;" OwnerUserId="8732" LastActivityDate="2014-03-01T18:33:10.620" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1136" PostTypeId="1" CreationDate="2014-03-02T04:24:36.017" Score="20" ViewCount="913" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/22585/3808&quot;&gt;My most recent challenge&lt;/a&gt; was recently &lt;a href=&quot;https://codegolf.stackexchange.com/posts/22585/revisions&quot;&gt;edited&lt;/a&gt; to change a certain language's name to Brainf**k (i.e. censor it). I decided I might want some community input before I rolled it back, so, my question is:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we f***ing censor the f***ing names of f***ing programming languages?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Programming language names &lt;em&gt;should&lt;/em&gt;, technically, not be modified. On the other hand, this language contains a word almost universally considered to be vulgar.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What does the community think?&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2014-06-15T20:36:00.673" Title="Should we censor language names?" Tags="|discussion|" AnswerCount="8" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="1137" PostTypeId="1" CreationDate="2014-03-02T05:00:29.163" Score="70" ViewCount="1580" Body="&lt;h1&gt;We've been in beta for 1129 days.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Don't you think it's time we get out?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We seem to be in a similar situation as &lt;a href=&quot;https://codereview.meta.stackexchange.com/q/1567/36278&quot;&gt;Code Review&lt;/a&gt;. We don't have enough users with sufficient reputation to gain privileges like voting to close and delete. Here's some quick analysis I did with the API (the percentages are out of total users on CG):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;15067 total users&#xA;0 users above 20000 rep (0.000%)&#xA;4 users above 10000 rep (0.027%)&#xA;13 users above 5000 rep (0.086%)&#xA;35 users above 3000 rep (0.232%)&#xA;59 users above 2000 rep (0.392%)&#xA;142 users above 1000 rep (0.942%)&#xA;297 users above 500 rep (1.971%)&#xA;589 users above 250 rep (3.909%)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;(come on, I used up half my API quota for that, give me some credit &lt;code&gt;;)&lt;/code&gt;)&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As you can see, if we graduate, &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;only 59 users will have edit/suggested edit review privileges, greatly reducing site quality&lt;/li&gt;&#xA;&lt;li&gt;only 35 users will have close-vote privileges, making bad stuff stay open longer&lt;/li&gt;&#xA;&lt;li&gt;only 4 users will have vote-to-delete privileges, making deletion nearly impossible by the community&lt;/li&gt;&#xA;&lt;li&gt;no users will have trusted user status, making the community unable to delete answers or questions asked within the past 2 days&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Those numbers are quite bleak.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;I want to take action.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We've each got 40 votes a day. Let's all use them to our advantage. &lt;strong&gt;Vote up&lt;/strong&gt; any fun or interesting challenge, and any good solution, preferably ones with explanations. We &lt;em&gt;can&lt;/em&gt; make a visible change in the general reputation levels, a change possibly enough to escape the beta phase.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;However,&lt;/strong&gt; remember to only upvote quality posts! If you vote up anything that moves, your votes become meaningless and even detrimental. Exercise proper use of downvotes as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have a modest goal. 3 trusted users (20k), 10 deleters (10k), 80 closers (3k), and 120 editors (2k). &lt;a href=&quot;http://data.stackexchange.com/codegolf/revision/172072/219478/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here's a data explorer query to check on our progress.&lt;/a&gt; &lt;a href=&quot;http://data.stackexchange.com/codegolf/revision/172115/219533/&quot; rel=&quot;nofollow noreferrer&quot;&gt;And here's another one to sum up all total rep (not counting 1 and 101-rep users).&lt;/a&gt; Here's what we've got so far (updated every time data explorer is):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  Date     20k  10k   3k   2k  Users            Rep&#xA;3/01/2014: 00%, 40%, 44%, 49%; 2709 users with 811511 total rep&#xA;3/09/2014: 00%, 60%, 50%, 56%; 2878 users with 877078 total rep&#xA;3/16/2014: 00%, 60%, 51%, 58%; 3009 users with 927459 total rep&#xA;3/23/2014: 00%, 60%, 55%, 62%; 3096 users with 968873 total rep&#xA;3/30/2014: 00%, 60%, 59%, 63%; 3127 users with 991182 total rep&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If we get these percentages up to 100, we just might get out of beta. For comparison, let's check the stats for Code Review.SE:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3/01: 33%, 60%, 46%, 43%&#xA;3/09: 33%, 60%, 48%, 45%&#xA;3/16: 33%, 60%, 48%, 48%&#xA;3/23: 67%, 60%, 49%, 48%&#xA;3/30: 133%, 70%, 51%, 48%&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Can we beat them? Yes we can, if we are determined enough. If we get our rep levels up high enough, we &lt;strong&gt;can and will&lt;/strong&gt; get out of beta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have one final message for you.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Let's &lt;em&gt;do&lt;/em&gt; this.&lt;/h1&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:47.013" LastActivityDate="2016-04-24T09:31:58.690" Title="Let's go on a mission" Tags="|discussion|reputation|beta-status|" AnswerCount="6" CommentCount="26" ContentLicense="CC BY-SA 3.0" />
  <row Id="1138" PostTypeId="2" ParentId="1136" CreationDate="2014-03-02T05:42:17.903" Score="-4" Body="&lt;p&gt;I approve of censoring the name of this language.  Just because the namer/inventor of this language had a dirty mind means that the universe must follow.&lt;/p&gt;&#xA;" OwnerDisplayName="user10766" LastActivityDate="2014-03-02T05:42:17.903" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1139" PostTypeId="2" ParentId="1136" CreationDate="2014-03-02T07:01:02.430" Score="22" Body="&lt;h3&gt;No.&lt;/h3&gt;&#xA;&lt;p&gt;For those, who have already seen the word, censorship achieves nothing. They will know what word is meant, even if it's censored to mere F* (or even ****). Censorship only draws attention to that word and to the fact the language name contains a dirty word.&lt;/p&gt;&#xA;&lt;p&gt;For those, who haven't seen the word yet (as if there were any), the context of the language name does not indicate that it should contain a swearword they might like to learn. Sure, the first half is a sensible word (but so is &amp;quot;lung&amp;quot; in &amp;quot;zwerglung&amp;quot;&lt;sup&gt;$&lt;/sup&gt;), so they might be interested in what the second half means, but, &lt;a href=&quot;https://www.google.com/search?q=f*k&quot; rel=&quot;nofollow noreferrer&quot;&gt;searching for the censored word&lt;/a&gt; yields &lt;strike&gt;just as many&lt;/strike&gt; 100 times as many results as &lt;a href=&quot;https://www.google.com/search?q=fuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;searching for its uncensored version&lt;/a&gt;.  One might argue &amp;quot;but, the censorship warns the kids that they don't want search for that&amp;quot;, but really - I don't think it works this way. They &lt;em&gt;want&lt;/em&gt; to know the words their friends might like to learn&lt;sup&gt;#&lt;/sup&gt; - if they don't already*. That is, if you tell them it's a swear word. Censorship only draws attention to that word and to the fact the language name contains a dirty word.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;(%) Yes. I know my footnotes are upside-down&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;(&lt;/sup&gt;*&lt;sup&gt;) The age barrier at StackExchange is 13 years, and &lt;a href=&quot;http://data.stackexchange.com/codegolf/query/edit/172075#resultSets&quot; rel=&quot;nofollow noreferrer&quot;&gt;the vast majority of our userbase is older than that&lt;/a&gt;. The age barrier exists to protect very young kids from swearwords. I guess this is a reason enough to claim that swearwords are not to be particularly feared of at Stack Exchange. Not to mention you will hear the occasional f**k or two on most of the SE chats, too.&lt;sup&gt;%&lt;/sup&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;(#) this statement is not subject to voting. I still accept disagreement in the comments.&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;($) I promise. I just made up this word. &lt;a href=&quot;http://translate.google.com/?ie=UTF-8&amp;amp;sl=auto&amp;amp;tl=en&amp;amp;text=zwerglung&quot; rel=&quot;nofollow noreferrer&quot;&gt;I didn't know it already exists.&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="7209" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-03-02T07:01:02.430" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1141" PostTypeId="2" ParentId="1136" CreationDate="2014-03-02T15:19:48.350" Score="38" Body="&lt;h2&gt;Obscenity is in the intent, not the word&lt;/h2&gt;&#xA;&lt;p&gt;For example, have I told you about my cock?&lt;/p&gt;&#xA;&lt;p&gt;It is a fine cock, very big and very red.&lt;/p&gt;&#xA;&lt;p&gt;Here is a picture of it, taken by the people at Encyclopedia Britannica:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/6u8ZZ.jpg&quot; alt=&quot;Rhode Island Red cock&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Rhode Island Red cock&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;I invite you to visit their site and notice how they have &lt;a href=&quot;http://www.britannica.com/EBchecked/media/10542/Rhode-Island-Red-cock&quot; rel=&quot;nofollow noreferrer&quot;&gt;captioned the picture.&lt;/a&gt; They use the same text that I did here. They also use it in the URL.&lt;/p&gt;&#xA;&lt;p&gt;As an educational site, they have recognized that the word &amp;quot;cock&amp;quot; may be offensive in some instances when used with offensive intent, but it is not an inherently offensive word.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Offense is not in the word, but in how the word is applied, and toward what end.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;For example, my first two sentences may be argued to edge dangerously close to the edge between pedagogical provocation and intentional offense. However, it is impossible for me to know how offensive I have truly been because offense can be achieved by intent on the part of both the giver and the receiver of the offense. Though I may have no intent to offend you, you may still intend to take offense.&lt;/p&gt;&#xA;&lt;p&gt;To have a civil society, we need to minimize two things: the intentional giving of offense, and the intentional receiving of it. We need warm hearts with thick skins.&lt;/p&gt;&#xA;&lt;p&gt;Or as one respondent to the linked thread quoted from the SO FAQ, &amp;quot;Be nice,&amp;quot; but also &amp;quot;Bring your sense of humor.&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;Did the creators of Brainfuck mean some offense to the world when they chose that name? Possibly. But I do not believe we repeat that intent by using the name here. Here, it is merely a signifier, a tool we use to ensure we are talking about the same thing.&lt;/p&gt;&#xA;&lt;p&gt;If we start censoring our signifiers, that impairs our educational value by making it more difficult to understand what is signified. Meanwhile, we actually add to the aura of offensive power around the word by treating it as offensive when it is being used &lt;em&gt;in the most benign manner it can possibly be used.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;I feel no worse using it to signify a programming language than I would asking a random stranger &amp;quot;hand me that fanny pack&amp;quot; and finding out he/she was British.&lt;/p&gt;&#xA;&lt;p&gt;It is just--to use Brainfuck parlance--a pointer.&lt;/p&gt;&#xA;" OwnerUserId="3363" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-03-02T15:19:48.350" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1142" PostTypeId="2" ParentId="1137" CreationDate="2014-03-02T18:07:01.110" Score="17" Body="&lt;p&gt;That is my opinion. Initially I was making it a comment, but it quickly became too long for a comment.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Try to use all your votes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;People should try harder to hit the daily vote limit and chase the Vox Populi badge. Go on, read the questions and answers and use your upvotes in what you think is good. Do not reserve your upvotes only for the &quot;best of the bests&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Don't forget to vote in questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I already saw cases of questions with &gt;60 answers but &amp;lt;10 votes. Particularly, if you think that the question was good enough to deserve your answer (and your answer is a serious answer), why not upvote the question?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Instead of thinking in &quot;&lt;em&gt;why should I upvote the question?&lt;/em&gt;&quot;, think in &quot;&lt;em&gt;why should I not upvote the question?&lt;/em&gt;&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Think twice before downvoting&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;No, do not think only twice, think a third time!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By observing some fenomena occurring here, I conjecture that there are cases in this site of people who does mass-downvoting, since I already saw cases of questions where every answer has at least one downvote and they got the downvotes in a narrow time span. I really can't think how this can be a good thing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you look at my profile in the main site, for example, you will see that I very rarely downvote anything. If I think that a particular question or answer is stupid, I will just ignore it or maybe post a comment, and reserve the downvotes only for cases that are really-really deserving them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, I already saw people here that posted more downvotes than upvotes, and I really think that this is just wrong.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Do not be a ninja downvoter&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In another community that I participate, this was discussed on meta in the first days of private beta. Somebody post an answer, and in less than a minute it already has a score of -2 (and no, I am not exagerating, in that case it reached -2 votes in 53 seconds), and it was not a bad answer after all. Give time to the person to edit it. Add a comment pointing what do you think that is wrong and give time to the questioner/answerer fix it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Avoid &lt;em&gt;ad-hominem&lt;/em&gt; voting&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I already saw cases here of &quot;I never vote on user-xxx answers&quot;, or &quot;I always upvote user-xxx answers&quot;, or &quot;I always downvote user-xxx answers&quot;. This is simply unfair.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Explain your downvotes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you are willing to downvote, explain why. Getting a random downvote from nowhere without any reason or any explanation is a bit annoying. Getting more than one without a single word about it, is really annoying and frustrating.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;s&gt;Try to observe other people reputation caps&lt;/s&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;EDIT: [Removed, not practical and possibly counter-productive].&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Do not spoil other people fun&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I will devote some long text in this because I think that this is the most serious issue here. It is directed specially to closers and I know that a lot of people will disagree.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A question has already some, lets say, 15 answers, and people are posting more new answers. The question and the answers are getting upvotes, people are improving their answers and suggesting improvements in other people answers. But then, it is needed just 5 people to spoil the fun of everybody and close the question only because of a minor problem, or worse, just because of something that the closers think that is a minor problem, but it is a no issue afterall, and then the fun of everybody is spoiled.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I already saw at least 3 cases of a question being closed, reopened and closed again, which make me particularly angry at some people which insists in closing questions for no real issue afterall.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Closing a question which does not have a very serious problem is a disrespect not only to the questioner, but to every people that answered it seriously or are wishing to answer it.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Particularly, already happened 2 times for me that I posted a placeholder answer when the question had 4 close-votes, deleted it, and then undeleted and posted the actual answer after the question was closed, and already saw other people doing the same. I wished that I never needed to do such thing. If people are searching for ways to circumvent the questions closure and post answers anyway, this is a sign that there is something very wrong happening here. And already saw people posting answers as comments with links to github or jsfiddle because the question was closed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And I already saw cases of questions being closed without a real reason (closing just for the sake of closing), in which the first closer chooses a random close reason in the close menu and other people do follow him sometimes without even reading the question. People closing questions just because they think that they are boring (this is no close reason), or closing question just because it can't be done in their favorite programming language, or even more stupid reasons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Someone may argue: &quot;We closed because it had a problem and this is to give an opportunity to the OP fix the question&quot;. This is red-herring, the OP has the opportunity to fix it without closing. Closing a question punishes much more the answerers than the questioner. And reopening a question is something very hard to do. Further, even if it managed to be ropened, it probably already lost its momentum and is ruined.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Someone may argue: &quot;Even if this is a popularity-contest, it is a duplicate of a two-year old code-golf question which have radically different restrictions&quot;. This argument is simply disguting, idiotic, annoying and possibly evil, and sorry this is not a joke, this is real. This only serves to reinforce my feeling that people are just closing for the sake of closing using some lame excuse just because they can do it, and makes me wish that a &quot;downvote the close-reason&quot; button existed. I will not post links to questions where this happened to not expose the names of the closers and because this is off-topic to this actual meta-question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How to address this issue: Try to be a lawyer for the question, not for its closure. If the question is salvageable, try to save it, preferentially before it gets closed. If it was already closed, try to fix it willing for a reopen. Lets keep closed only what is really unsalvageable and unworthy.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;s&gt;Upvote to counter downvotes&lt;/s&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;EDIT: [Removed, not a good idea, or at least a very debatable one, and maybe possibly counter-productive].&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Do not scare newcomers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Most of newcomers don't know the rules yet, so if a newcomer post a question or a answer that is not in a good format but still clearly shows a visible effort to try to participate, instead of ignoring, downvoting, closing and/or deleting, suggest improvements or, if possible, edit the question/answer to fix any issues. Further, newcomers are much more motivated by a few upvotes than long-established users, so lets motivate them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Especially, in case of newcomers questions, they are motivated not only by upvotes, but by actual answers too.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Explain why do you close-vote&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This could looks like obvious, but unfortunately it is not. If, after reading the long previous section about close-voting, you still thinks that a particular question should be closed, explain why. I already saw at least two questions that already had some answers and were closed without a single word from any of the closers, and it was not closed for an obvious reason (like spam or homework) nor were closed for being a duplicate. Just after that it was closed, some other user who did not close-voted posted a comment like &quot;I think that the rule xxx is a bit underspecified&quot;, so ok, fixed this in less than 30 seconds by editing.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Answers attracts more answers, more answers attracts upvotes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you think that a question is worth, post an answer if you can. Don't need to be that great answer, but this gives you opportunity to get some upvotes for you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And, even if you are initially not thinking in that great answer, it is possible (uncommon, but possible) that in the middle of the development, you do figure out a smart trick that makes your answer actually a great one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When other people see your answer, they might get some other ideas for themselves, and think: &quot;Hmm, this guy solved the problem with the X method using the A language, but I think that the Y method is better in the B language, so I can beat his answer. Will upvote him for the idea that he unintentionally gave me.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Edit:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Reward hard work&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It isn't frustrating when you work hard to produce a good answer, and do not get a single upvote on it?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, please, if you see some answer where the answerer clearly worked hard to produce it and did the best that he/she could, why do not upvote it?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Edit 2:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Reconsiders and re-evaluates your downvotes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This was suggested by @DigitalTrauma, I will just post his comment here:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If you do downvote, &lt;strong&gt;&lt;em&gt;please&lt;/em&gt;&lt;/strong&gt; check the post later for useful edits and re-evaluate your vote.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="3755" LastEditorUserId="3755" LastEditDate="2014-03-03T06:17:51.853" LastActivityDate="2014-03-03T06:17:51.853" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="1143" PostTypeId="1" AcceptedAnswerId="1169" CreationDate="2014-03-02T18:15:45.857" Score="0" ViewCount="70" Body="&lt;p&gt;Of fortunately, there is no metametacodegolf, so I will just put my question here. At &lt;a href=&quot;https://codegolf.stackexchange.com/a/22646/16842&quot;&gt;https://codegolf.stackexchange.com/a/22646/16842&lt;/a&gt;, someone said my question violated a post here, but the post had less than 25 votes. So my question is, how much support does something need to become policy?&lt;/p&gt;&#xA;" OwnerUserId="16842" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-03-04T06:13:15.997" Title="How much support does something need to be policy?" Tags="|discussion|policy|meta|" AnswerCount="3" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1144" PostTypeId="2" ParentId="1143" CreationDate="2014-03-02T18:20:58.910" Score="9" Body="&lt;p&gt;Oh, &lt;em&gt;only&lt;/em&gt; less than 25? You do realize it's the &lt;strong&gt;fifth highest&lt;/strong&gt; voted meta post, and it's only been around for less than two weeks? Is an almost record-breaking amount of votes not support enough?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here on Stack Exchange, the &lt;em&gt;community&lt;/em&gt; runs the site. The obvious consensus is that it's a good idea, and &lt;strong&gt;we, as a community,&lt;/strong&gt; are enforcing it.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-03-02T18:20:58.910" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1146" PostTypeId="2" ParentId="1061" CreationDate="2014-03-02T19:59:04.687" Score="81" Body="&lt;h2&gt;Posting a code snippet instead of a complete answer&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note&lt;/strong&gt;: There is now a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2419/62131&quot;&gt;separate question&lt;/a&gt; covering this loophole in more detail.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is a issue mainly for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; and variants.&lt;/p&gt;&#xA;&lt;p&gt;Only in very few cases this seriously affects &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The issue is when someone post a function, a method, an instruction or a code-snippet instead of a complete program. And then score their answer based on only what was posted. This gives an unfair advantage over who posted a complete solution.&lt;/p&gt;&#xA;&lt;p&gt;Here is an example of a complete C Hello World program in 53 bytes:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-c prettyprint-override&quot;&gt;&lt;code&gt;#include&amp;lt;stdio.h&amp;gt;&#xA;int main(){printf(&amp;quot;Hello World!&amp;quot;);}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;But, the answerer, with the intent to defeat another answer in code-golf, posts this instead, claiming that their answer is 22 bytes:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-c prettyprint-override&quot;&gt;&lt;code&gt;printf(&amp;quot;Hello World!&amp;quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="3755" LastEditorUserId="107310" LastEditorDisplayName="user62131" LastEditDate="2022-06-23T19:11:43.390" LastActivityDate="2022-06-23T19:11:43.390" CommentCount="11" CommunityOwnedDate="2014-03-18T00:35:51.703" ContentLicense="CC BY-SA 4.0" />
  <row Id="1147" PostTypeId="1" CreationDate="2014-03-02T20:54:30.667" Score="13" ViewCount="359" Body="&lt;p&gt;The title of this question really sounds very silly, but lets see all of those questions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/22665/how-many-valid-routes&quot;&gt;https://codegolf.stackexchange.com/questions/22665/how-many-valid-routes&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/22653/operations-on-stacks-of-coins&quot;&gt;https://codegolf.stackexchange.com/questions/22653/operations-on-stacks-of-coins&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/22427/convert-simple-array-to-associative-array-in-php&quot;&gt;https://codegolf.stackexchange.com/questions/22427/convert-simple-array-to-associative-array-in-php&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/22288/shortest-path-with-fuel-constraints&quot;&gt;https://codegolf.stackexchange.com/questions/22288/shortest-path-with-fuel-constraints&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/22287/algorithm-can-you-help-me-solve-it&quot;&gt;https://codegolf.stackexchange.com/questions/22287/algorithm-can-you-help-me-solve-it&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/21775/how-does-this-obfuscated-javascript-code-work&quot;&gt;https://codegolf.stackexchange.com/questions/21775/how-does-this-obfuscated-javascript-code-work&lt;/a&gt; (deleted)&lt;/li&gt;&#xA;&lt;li&gt;EDIT: +1 &lt;a href=&quot;https://codegolf.stackexchange.com/questions/22835/infinite-or-finite-loop&quot;&gt;https://codegolf.stackexchange.com/questions/22835/infinite-or-finite-loop&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Those questions are all off-topic. What they do have in common? Newcomers and outsiders do not understand that this is a programming contest community. The &quot;Programming puzzles&quot; in the name is between no help to misleading for them, so people misunderstands the purpose of this site and posts those off-topic questions here. Or worse, migrate questions from somewhere else to this site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, since this is recurring, I started to question the community name. Shouldn't it really be &quot;&lt;em&gt;Programming Contests &amp;amp; Code Golf&lt;/em&gt;&quot; or &quot;&lt;em&gt;Programming Tournaments &amp;amp; Code Golf&lt;/em&gt;&quot; instead of &quot;&lt;em&gt;Programming Puzzles &amp;amp; Code Golf&lt;/em&gt;&quot;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we keep the &quot;&lt;em&gt;&amp;amp; Code Golf&lt;/em&gt;&quot; in the name or not? A code-golf is a particular type of programming puzzle/contest/tournament, so it is redundant, but we might keep it anyway.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I added 5 pre-made answers. 3 of those answers are about the first part of the name, I.E. &quot;&lt;em&gt;Programming Contests&lt;/em&gt;&quot; vs &quot;&lt;em&gt;Programming Puzzles&lt;/em&gt;&quot; vs &quot;&lt;em&gt;Programming Tournaments&lt;/em&gt;&quot;. The other 2 answers are about keeping vs dropping the &quot;&lt;em&gt;&amp;amp; Code Golf&lt;/em&gt;&quot;. Upvote the ones that you do agree and downvote the ones that you do disagree.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you have any other suggestions different from the ones that I pre-made, feel free to post it as an answer.&lt;/p&gt;&#xA;" OwnerUserId="3755" LastEditorUserId="76162" LastEditDate="2021-06-04T09:57:37.660" LastActivityDate="2021-06-04T09:57:37.660" Title="Is the name of the community correct?" Tags="|discussion|feature-request|status-completed|" AnswerCount="6" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1148" PostTypeId="2" ParentId="1147" CreationDate="2014-03-02T20:57:20.353" Score="-4" Body="&lt;p&gt;&lt;sup&gt;&lt;em&gt;Upvote this if you agree and downvote if you disagree.&lt;/em&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;No, the name of the site is correct and should not be changed. Keep it as &lt;em&gt;Programming &lt;strong&gt;Puzzles&lt;/strong&gt; &amp;amp; Code Golf&lt;/em&gt;. Or maybe just &lt;em&gt;Programming Puzzles&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;See other answers for about dropping the &quot;&lt;em&gt;&amp;amp; Code Golf&lt;/em&gt;&quot; or not.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="3755" LastEditorUserId="3755" LastEditDate="2014-03-03T00:33:27.980" LastActivityDate="2014-03-03T00:33:27.980" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1149" PostTypeId="2" ParentId="1147" CreationDate="2014-03-02T20:59:06.987" Score="30" Body="&lt;p&gt;&lt;sup&gt;&lt;em&gt;Upvote this if you agree and downvote if you disagree.&lt;/em&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yes, we should rename this site to &lt;em&gt;Programming &lt;strong&gt;Contests&lt;/strong&gt; &amp;amp; Code Golf&lt;/em&gt;. Or maybe just &lt;em&gt;Programming Contests&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;See other answers for about dropping the &quot;&lt;em&gt;&amp;amp; Code Golf&lt;/em&gt;&quot; or not.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="3755" LastEditorUserId="3755" LastEditDate="2014-03-03T00:33:40.543" LastActivityDate="2014-03-03T00:33:40.543" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1150" PostTypeId="2" ParentId="1147" CreationDate="2014-03-02T21:00:20.163" Score="-13" Body="&lt;p&gt;&lt;sup&gt;&lt;em&gt;Upvote this if you agree and downvote if you disagree.&lt;/em&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yes, we should rename this site to &lt;em&gt;Programming &lt;strong&gt;Tournaments&lt;/strong&gt; &amp;amp; Code Golf&lt;/em&gt;. Or maybe just &lt;em&gt;Programming Tournaments&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;See other answers for about dropping the &quot;&lt;em&gt;&amp;amp; Code Golf&lt;/em&gt;&quot; or not.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="3755" LastEditorUserId="3755" LastEditDate="2014-03-03T00:33:13.617" LastActivityDate="2014-03-03T00:33:13.617" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1151" PostTypeId="2" ParentId="1137" CreationDate="2014-03-02T22:13:01.947" Score="5" Body="&lt;h2&gt;Brevity is the soul of bit&lt;/h2&gt;&#xA;&lt;p&gt;In essence, the site needs two things to prod it on to a higher level:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;More participation&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;More and better content&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;More participation&lt;/strong&gt; gets us the things Doorknob and Victor are on about: more rep for everyone, so everyone can have access to more active roles in the community, and a more engaged community in general.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;More and better content&lt;/strong&gt; is essential to make that happen. There are only a finite number of questions on which to vote, and only a finite number of users voting on them. More voting will slam on the accelerator of the machine, but it's content that puts the fuel in the tank by drawing in more users, more voters and more answers.&lt;/p&gt;&#xA;&lt;p&gt;There's a frequent complaint of &amp;quot;not enough questions&amp;quot; around here and that needs a remedy. In addition, there's a gulf between our hot questions that get attention on the network and the &lt;em&gt;not&lt;/em&gt; questions that mostly get no attention outside the core membership.&lt;/p&gt;&#xA;&lt;p&gt;More voting, yes.&lt;/p&gt;&#xA;&lt;p&gt;But also more content.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;More hot, less not!&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="3363" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-03-02T22:13:01.947" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1153" PostTypeId="2" ParentId="1143" CreationDate="2014-03-02T22:42:41.307" Score="8" Body="&lt;p&gt;To support Doorknob's post, that policy now has 20 upvotes (the 20th being mine). That means there are 20 more supporters than dissenters. Given the size of this community that has a vocal opinion about policy, I'd say a 20-point lead is a pretty clear show of support. Heck, even a 10-point lead would lend significant weight, in my opinion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Speaking for myself, if hardcoding were decided to be okay on this site, I'd quit. I find the idea to be offensive, and usually I nuke such &quot;answers&quot; on sight.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-03-02T22:42:41.307" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1154" PostTypeId="2" ParentId="1147" CreationDate="2014-03-02T22:56:17.853" Score="0" Body="&lt;p&gt;&lt;sup&gt;&lt;em&gt;Upvote this if you agree and downvote if you disagree.&lt;/em&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regardless of the fact that it is &quot;&lt;em&gt;Programming Puzzles&lt;/em&gt;&quot;, &quot;&lt;em&gt;Programming Tournaments&lt;/em&gt;&quot; or &quot;&lt;em&gt;Programming Contests&lt;/em&gt;&quot;, or something else, lets &lt;strong&gt;drop the &quot;&lt;em&gt;&amp;amp; Code Golf&lt;/em&gt;&quot;&lt;/strong&gt; from the name, since code-golf is a type of programming puzzle/contest/tournament, so it is redundant.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;See other answers for about the actual name, regardless of the fact of dropping or not the &quot;&lt;em&gt;&amp;amp; Code Golf&lt;/em&gt;&quot;.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="3755" LastEditorUserId="3755" LastEditDate="2014-03-03T00:32:36.317" LastActivityDate="2014-03-03T00:32:36.317" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1155" PostTypeId="2" ParentId="1147" CreationDate="2014-03-02T22:57:31.983" Score="23" Body="&lt;p&gt;&lt;sup&gt;&lt;em&gt;Upvote this if you agree and downvote if you disagree.&lt;/em&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regardless of the fact that it is &quot;&lt;em&gt;Programming Puzzles&lt;/em&gt;&quot;, &quot;&lt;em&gt;Programming Tournaments&lt;/em&gt;&quot; or &quot;&lt;em&gt;Programming Contests&lt;/em&gt;&quot;, or something else, we must &lt;strong&gt;keep the &quot;&lt;em&gt;&amp;amp; Code Golf&lt;/em&gt;&quot;&lt;/strong&gt; in the name, even if we all do know that code-golf is a type of programming puzzle/contest/tournament.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;See other answers for about the actual name, regardless of the fact of dropping or not the &quot;&lt;em&gt;&amp;amp; Code Golf&lt;/em&gt;&quot;.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="3755" LastEditorUserId="3755" LastEditDate="2014-03-03T00:32:48.787" LastActivityDate="2014-03-03T00:32:48.787" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1157" PostTypeId="2" ParentId="1137" CreationDate="2014-03-02T23:13:39.117" Score="43" Body="&lt;h1&gt;Languages&lt;/h1&gt;&#xA;&lt;p&gt;Please, people, don't downvote someone because their language can beat yours.  I have never won a contest yet, but it is still fun to participate.&lt;/p&gt;&#xA;&lt;h1&gt;Newcomers&lt;/h1&gt;&#xA;&lt;p&gt;I notice that now that I have more rep, I get a lot more upvotes; I only got 1 vote on my first 4 answers.  I see this happening with other people now too.  We need to welcome the newcomers with more upvotes to make them want to participate, not give them extra trouble to earn their rep.&lt;/p&gt;&#xA;" OwnerDisplayName="user10766" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-03-02T23:13:39.117" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1158" PostTypeId="2" ParentId="1136" CreationDate="2014-03-02T23:56:29.497" Score="3" Body="&lt;p&gt;I much prefer when offensive words, even in a non-offensive context, are censored. Let me explain why:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I have not sworn (the worst word I used is crap), ever.&lt;/li&gt;&#xA;&lt;li&gt;I never want to swear; not even pronounce the words&lt;/li&gt;&#xA;&lt;li&gt;When I read, I pronounce the words in my mind&lt;/li&gt;&#xA;&lt;li&gt;When I read swear words, I also pronounce them in my mind before I have the chance to catch myself&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Censored words give me the chance to change my mental pronunciation. For example, I can read Brain**** as &quot;Brain-star&quot; or BrainF*** as &quot;BrainF-star&quot;. And this sentence from the question here:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Should we f***ing censor the f***ing names of f***ing programming languages?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I can pronounce as:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Should we f-ing censor the f-ing names of f-ing programming languages.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Lastly, censoring does not prevent people from pronouncing it the other way. I agree that censoring does not protect youth from learning the words. However, I feel that it is reasonable to give people a choice in what to use to pronounce words.&lt;/p&gt;&#xA;" OwnerUserId="9498" LastActivityDate="2014-03-02T23:56:29.497" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1159" PostTypeId="2" ParentId="1136" CreationDate="2014-03-03T02:44:38.137" Score="4" Body="&lt;p&gt;No, it's just a name.  We're not hurting anybody's feelings, are we?  If this was school in 1st grade, however, the teachers would prohibit it (because in 1st grade I got in trouble for saying &quot;JackAss&quot;), but again it's just a name.  You're not going to ban someone who has profanity in their actual name anyways, right?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I was a dog breeder I wouldn't care about the connotation of the word &quot;bitch&quot;, I would just say &quot;I bred the bitch last night&quot;.&lt;/p&gt;&#xA;" OwnerUserId="10933" LastActivityDate="2014-03-03T02:44:38.137" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1160" PostTypeId="2" ParentId="2140" CreationDate="2014-03-03T03:34:10.520" Score="1" Body="&lt;h2&gt;Off-topic bullshit detector&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You run a blog about astronomy and for each post there is an area for comments, where people post comments. So, when you post news about the discovery of a new exoplanet, quickly there are some people commenting about its habitability or about the methods using for their detection, and you do answer those comments, very nice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You already have a very good spam detector that handles people who tries to post links to viagra-selling sites, so you do not worry with these.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But there is always people who you really hate and makes you very tired. People who insists to post comments that every astronomer is tired and angry to see:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Comments about creationism.&lt;/li&gt;&#xA;&lt;li&gt;Comments about ancient astronauts theory.&lt;/li&gt;&#xA;&lt;li&gt;Comments about religion arguing that instead of looking to the sky, people should look for God.&lt;/li&gt;&#xA;&lt;li&gt;Comments claiming that this is all a big lie made up by governments around the world, and in fact the man never went to the Moon and the Earth is flat.&lt;/li&gt;&#xA;&lt;li&gt;Comments about planet Nibiru, planet Hercolobus, planet X, planet Nemesis and similars.&lt;/li&gt;&#xA;&lt;li&gt;Comments about Mayan, Sumerian, or Nostradamus profecies about the end of the world in any particular date.&lt;/li&gt;&#xA;&lt;li&gt;Comments about the CIA hiding ETs in Area 51 captured from Roswell and similar stuff.&lt;/li&gt;&#xA;&lt;li&gt;Comments about conspiracies by secret groups controlling or willing to control the world, like the Illuminati, the Masonry, the New World Order, and similars.&lt;/li&gt;&#xA;&lt;li&gt;Useless flamewar comments that happens when people from two different groups in the previous categories disagree one with the other, posting comments that makes you sometimes doubt that intelligent life exists on Earth.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your task is: Create a complete program that receives as input a text comment limited to 300 characters and outputs Yes/No, 0/1, Approve/Reject or something similar, rejecting the bullshit comments and accepting the valid ones.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Further, we have a few restrictions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;As a policy of your company, everyone may comment any post at will, without the need of prior registration, so you can't build some sort of reputation barrier system for this.&lt;/li&gt;&#xA;&lt;li&gt;You can't also make comments be approved by other frequent commenters based in some reputation system. This happens because your competitor did that and the result was that the people that you want to avoid managed to take over the site being the ones with the most reputation and thus completely ruining your competitor's site. So, your boss decided that you should not build a reputation system.&lt;/li&gt;&#xA;&lt;li&gt;No use of external resources in the internet.&lt;/li&gt;&#xA;&lt;li&gt;You are allowed to save files in the disk or to use a database (please do not abuse this rule).&lt;/li&gt;&#xA;&lt;li&gt;If you do need, you can add a training program to pre-populate the program data.&lt;/li&gt;&#xA;&lt;li&gt;Your algorithm must be deterministic and consistent. I.E, in a given state for a given input, it always produce the same output. So, do not make it randomized nor use as input something like the colors of the pixels in the screen, the system clock or similar sources of entropy.&lt;/li&gt;&#xA;&lt;li&gt;[Lacking a rule to avoid exploiting the score system by overfitting the test data].&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Ok, people, what do you think about this question? Good? Bad? Leave a comment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is still lack a winning criteria. Don't know if should be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, some sort of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; or something else. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is surely out-of-question for this. What do you think?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Further, to make it testable, this will need some sort of corpus which falls in those bullshit categories and some perfectly valid as well. If you do have some suggestion on this, please, drop a comment.&lt;/p&gt;&#xA;" OwnerUserId="3755" LastEditorUserId="3755" LastEditDate="2014-03-03T16:00:29.680" LastActivityDate="2014-03-03T16:00:29.680" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="1164" PostTypeId="2" ParentId="2140" CreationDate="2014-03-03T21:11:32.270" Score="0" Body="&lt;p&gt;Title: Implement ROT-13... in ROT-13&lt;/p&gt;&#xA;&lt;p&gt;Content:&lt;/p&gt;&#xA;&lt;p&gt;Challenge: Implement &lt;a href=&quot;http://en.wikipedia.org/wiki/Rot_13&quot; rel=&quot;nofollow noreferrer&quot;&gt;ROT-13&lt;/a&gt; in code that works as both itself and as the ROT-13 version of itself.&lt;/p&gt;&#xA;&lt;h3&gt;Scoring:&lt;/h3&gt;&#xA;&lt;p&gt;Your score is calculated as a percentage of &lt;strong&gt;used, ROT-13 eligible bytes in total of both versions of the program&lt;/strong&gt; divided by &lt;strong&gt;total bytes (all characters) of both versions&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;A &lt;strong&gt;used, ROT-13 eligible byte&lt;/strong&gt; is any character that is not part of a comment or ignored by the compiler/interpreter. For example, any character in a brainfuck program that is not &lt;code&gt;+-&amp;lt;&amp;gt;[],. &lt;/code&gt; is not considered a used byte, and any character in a C program including and after &lt;code&gt;//&lt;/code&gt; or inside &lt;code&gt;/* */&lt;/code&gt; is not considered a used byte. All special symbols in APL are not considered used, as are all characters in a Whitespace program (sorry).&lt;/p&gt;&#xA;&lt;p&gt;Example scoring:&lt;/p&gt;&#xA;&lt;h3&gt;C: 21/32 = 65.625%&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;main(){printf(&amp;quot;Hello World!&amp;quot;);}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="17249" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-03-03T21:11:32.270" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1165" PostTypeId="2" ParentId="1126" CreationDate="2014-03-03T21:18:18.183" Score="1" Body="&lt;p&gt;I think that any question that requests a common language without having a very compelling reason should just be edited into a language agnostic question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, I hope most of us recognize the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; tag for what it is :)&lt;/p&gt;&#xA;" OwnerUserId="17249" LastActivityDate="2014-03-03T21:18:18.183" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1166" PostTypeId="2" ParentId="1137" CreationDate="2014-03-03T23:47:32.273" Score="20" Body="&lt;h2&gt;Be a page 2 voter&lt;/h2&gt;&#xA;&lt;p&gt;One thing I have noticed is we often get newcomers adding to questions where the answers have spilled onto page two. Answers linger down there in the depths getting no votes.&lt;/p&gt;&#xA;&lt;p&gt;We can make the site a little more welcoming by deliberately reading page 2 (or 3 or 4) and voting on some answers there.&lt;/p&gt;&#xA;" OwnerUserId="3363" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-03-03T23:47:32.273" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1167" PostTypeId="1" CreationDate="2014-03-04T00:38:02.343" Score="2" ViewCount="117" Body="&lt;p&gt;I made a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; here: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/22751/implement-rot-47-in-rot-47&quot;&gt;Implement ROT-47... in ROT-47&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I think my scoring rules are not servicing the job of the original question well. I am considering changing the question to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, but it may be too late for me to change the scoring now that there are many valid answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Etiquette wise, is it too late? If I didn't want to risk stepping on site standard practices, I would have changed it to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; already, but I know that at least one user edited their program a number of times to my silly scoring rules already.&lt;/p&gt;&#xA;" OwnerUserId="17249" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-03-04T02:08:32.617" Title="Change scoring type after the fact?" Tags="|discussion|rules|editing|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1168" PostTypeId="2" ParentId="1167" CreationDate="2014-03-04T00:48:32.710" Score="1" Body="&lt;p&gt;I think it was wise of you to voluntarily move it to Sandbox, and unwise to reactivate it before the kinks had been worked out. However, that ship has sailed, and it would be bad form to substantially alter the contest after there are valid answers. The challenge itself is interesting, even if the scoring is a mess. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Edit: he's correct, he has a tiebreaker, so that's a non-issue.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="3363" LastEditorUserId="3363" LastEditDate="2014-03-04T02:08:32.617" LastActivityDate="2014-03-04T02:08:32.617" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1169" PostTypeId="2" ParentId="1143" CreationDate="2014-03-04T06:13:15.997" Score="5" Body="&lt;p&gt;On top of these two fine answers which I have upvoted, I will add:&lt;/p&gt;&#xA;&lt;h3&gt;No one needs a policy to downvote you; they only need an opinion.&lt;/h3&gt;&#xA;&lt;p&gt;Policy or not, each user is free to vote as they see fit. So the &amp;quot;policy&amp;quot; is not so much a real policy 'graved in stone, but a set of principles - a way of thinking about the kind of community we want to be.&lt;/p&gt;&#xA;&lt;p&gt;If someone invokes that way of thinking when they downvote you, they are probably doing so as a courtesy so you know &lt;em&gt;why&lt;/em&gt; you were downvoted. It's actually pretty nice, because it sucks getting downvoted with no comment.&lt;/p&gt;&#xA;&lt;p&gt;But no amount of disputing the policy they invoke - even if successfully - is going to diminish their right to downvote you anyway.&lt;/p&gt;&#xA;" OwnerUserId="3363" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-03-04T06:13:15.997" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1170" PostTypeId="2" ParentId="2140" CreationDate="2014-03-04T13:03:39.950" Score="1" Body="&lt;p&gt;Repost from previous sandbox, I realize this is somewhat similar to the Limerick program abit higher, but this was made before that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The Poet's Quine:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a quine with 1 or more rhyme scheme from &lt;a href=&quot;http://en.wikipedia.org/wiki/Rhyme_scheme&quot; rel=&quot;nofollow&quot;&gt;http://en.wikipedia.org/wiki/Rhyme_scheme&lt;/a&gt; when read. The non-alphanumeric symbols aren't used for rhyming in this scheme (apart from the basic arithmetic signs like plus, minus, times and divided by), neither are comments. Words may be pronounced in any dialect, but it needs to be consistent within the same stanza (no having the first word be pronounced in a Scottish way and the second in a Welsh way).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Contest type would be popularity contest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thoughts on this proposal?&lt;/p&gt;&#xA;" OwnerUserId="14141" LastActivityDate="2014-03-04T13:03:39.950" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1171" PostTypeId="2" ParentId="1147" CreationDate="2014-03-04T14:07:18.300" Score="3" Body="&lt;p&gt;&lt;sub&gt;Upvote this if you agree and downvote if you disagree.&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yes, we should rename this site to &lt;strong&gt;Code Golf &amp;amp; Programming Contests&lt;/strong&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;See other answers for about dropping the &quot;&amp;amp; Code Golf&quot; or not.&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;See other answers for about the actual name, regardless of the fact of dropping or not the &quot;&amp;amp; Code Golf&quot;.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="3363" LastActivityDate="2014-03-04T14:07:18.300" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1172" PostTypeId="1" CreationDate="2014-03-04T14:24:07.487" Score="0" ViewCount="83" Body="&lt;p&gt;I wanted to star a chat message: &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/14090701#14090701&quot;&gt;http://chat.stackexchange.com/transcript/message/14090701#14090701&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this reputation based? At the time of this question I had 261 reputation. Or is it the fact that I'm trying to star it almost a day after it was said?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;FYI: I'm trying to star it in the actual chatroom, not the transcript. I do see a star and a flag when I hover over the message, but when I click on the star, nothing happens.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Update: I was able to do it in chrome, but not in firefox&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Update 2: I am able to reproduce consistently in Firefox 27.0.1 in code golf's chat, but not in stack overflow's chat. It works chrome in both sites.&lt;/p&gt;&#xA;" OwnerUserId="17249" LastEditorUserId="68942" LastEditDate="2021-06-05T23:21:30.807" LastActivityDate="2021-06-05T23:21:30.807" Title="Can't seem to star a chat message" Tags="|bug|status-norepro|chat|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1174" PostTypeId="2" ParentId="1172" CreationDate="2014-03-04T20:38:23.440" Score="1" Body="&lt;p&gt;So I starred that message using Chrome, and then when I tried to reproduce it again in Firefox, I could not. I have no idea why.&lt;/p&gt;&#xA;" OwnerUserId="17249" LastActivityDate="2014-03-04T20:38:23.440" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1175" PostTypeId="2" ParentId="1172" CreationDate="2014-03-04T21:55:02.157" Score="0" Body="&lt;p&gt;Could just be a cookie issue. Earlier I was logged into SE but Chat believed I wasn't despite repeated attempts at signing out and in. Eventually had to wipe SE cookies and log in again, then chat worked fine. Pretty common thing with web applications - state can easily be corrupted. &lt;/p&gt;&#xA;" OwnerUserId="3363" LastActivityDate="2014-03-04T21:55:02.157" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1177" PostTypeId="1" CreationDate="2014-03-04T23:36:54.327" Score="14" ViewCount="379" Body="&lt;p&gt;This post announces the official beginning of a chatbot I've been working on called GolfEye.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/rooms/13215/golfeye-a-chatbot&quot;&gt;Here's the chatroom that it posts in.&lt;/a&gt; This bot will monitor both Code Golf and Code Golf Meta. It will watch for new posts, and when it recieves a new post via the SE websocket, it posts the post in the chatroom.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It posts a message saying &quot;New post - {title}!&quot;, a list of automatically detected triggers if any, and then oneboxes the post. Currently, these triggers are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;missing winning criterion&lt;/li&gt;&#xA;&lt;li&gt;allcaps title&lt;/li&gt;&#xA;&lt;li&gt;tag in title (ex. &lt;code&gt;[code golf] ...&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;label in title (ex. &lt;code&gt;Code Golf: ...&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;repeated characters in title (ex. &lt;code&gt;Thiiiiis is a post!&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;new user (asker's rep is 1 to 11 or 101 to 111)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If it detects a trigger, it pings me (@Doorknob) so I can fix it. (If you want to be added to the ping list, just tell me. :P)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It also pings me when a new meta post is posted. (Again, tell me if you want to be pinged for meta posts as well.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/rejns.png&quot; alt=&quot;screenshot example&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It will also post the post &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;in our &quot;official&quot; chatroom&lt;/a&gt; as of v1.0.2. As of v1.0.3, it only posts a scaled-down, no onebox, plain and single-line message consisting of &quot;New (meta)? post! {link}&quot;, without the ping or anything. (With a title as of 1.0.3.1.) This way it creates almost no disturbance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The code &lt;a href=&quot;https://github.com/OddLlama/stackexchange-chat-watcher&quot; rel=&quot;nofollow noreferrer&quot;&gt;is open sourced&lt;/a&gt;. Essentially, it's a WebSocket to recieve posts and a POST request to send chat messages. The version that is open-sourced is v1.0.0.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="3808" LastEditDate="2014-03-27T12:27:34.043" LastActivityDate="2014-03-27T14:40:43.873" Title="GolfEye - a chatbot (v1.0.3.2)" Tags="|discussion|chat|" AnswerCount="1" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="1181" PostTypeId="1" CreationDate="2014-03-05T15:58:38.067" Score="1" ViewCount="76" Body="&lt;p&gt;I just reviewed &lt;a href=&quot;https://codegolf.stackexchange.com/review/low-quality-posts/9313&quot;&gt;two&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/review/low-quality-posts/9311&quot;&gt;posts&lt;/a&gt; in the Low Quality Posts queue. These posts didn't fit the rules so I choosed &quot;Recommend Deletion&quot;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;But now I was wondering whether I made the right choice. So, when do we actually have to choose &quot;Recommend Deletion&quot;?&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2017-06-19T10:57:25.293" Title="When to choose &quot;Recommend Deletion&quot; in the Low Quality Posts queue?" Tags="|discussion|reviewing|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1182" PostTypeId="1" AcceptedAnswerId="1188" CreationDate="2014-03-05T16:55:54.800" Score="10" ViewCount="695" Body="&lt;p&gt;I am mulling over a challenge to draw the Eiffel Tower in 3D with ASCII art, similar to this: &lt;a href=&quot;https://codegolf.stackexchange.com/a/22763/10766&quot;&gt;https://codegolf.stackexchange.com/a/22763/10766&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, it has a problem.  If I do it &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, it will be a boring &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; problem and will produce some pretty ugly Eiffels.  If I do it popularity contest, it will end up being an art contest and be of no programming value, even though some beautiful Eiffels will likely be produced.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, I thought we could perhaps have the best of both worlds - 25% of the score is the length of the program and 75% is the number of upvotes.  I chose this ratio because the number of characters is typically much more than the number of votes.  What do you think about this, is the problem unsolvable, is what I thought of good, or do you have a better solution?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please let me know what you think in the answers.&lt;/p&gt;&#xA;" OwnerDisplayName="user10766" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2015-05-03T14:21:52.713" Title="Popularity Contest, ASCII Art, and Code Golf" Tags="|discussion|" AnswerCount="1" CommentCount="1" ClosedDate="2015-05-03T14:22:06.073" ContentLicense="CC BY-SA 3.0" />
  <row Id="1185" PostTypeId="1" CreationDate="2014-03-05T20:45:17.413" Score="1" ViewCount="129" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/22951/1004&quot;&gt;Find the smallest prime from a substring&lt;/a&gt; has the answer with the negative score &lt;a href=&quot;https://codegolf.stackexchange.com/a/22963/1004&quot;&gt;&lt;code&gt;-18&lt;/code&gt;&lt;/a&gt; due to 50 points bonus for languages without prime-related functions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A score is typically a length in bytes or Unicode codepoints.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there an answer that has smaller score (among all answers to &lt;em&gt;all&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot;&gt;code-golf questions&lt;/a&gt;)?&lt;/p&gt;&#xA;" OwnerUserId="1004" LastEditorUserId="68942" LastEditDate="2021-06-09T05:46:45.260" LastActivityDate="2021-06-09T05:46:45.260" Title="Which answer to a code-golf question has the smallest score?" Tags="|discussion|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1186" PostTypeId="2" ParentId="1185" CreationDate="2014-03-05T22:48:12.363" Score="1" Body="&lt;p&gt;I think there's a good chance that it's an answer of mine which scores &lt;a href=&quot;https://codegolf.stackexchange.com/a/8805/194&quot;&gt;-93 points&lt;/a&gt;. I think this illustrates a flaw in your suggestion in a comment that bonuses allow comparing skill instead of language capabilities: the -100 bonus for not using a built-in sort is far more than enough to make it worthwhile implementing a sort in a golf-friendly language.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-03-05T22:48:12.363" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1187" PostTypeId="2" ParentId="1136" CreationDate="2014-03-06T01:07:48.937" Score="9" Body="&lt;p&gt;While the use of uncensored language names doesn't bother me in the least on a personal/moral/whatever basis, it has caused some practical problems for me on a couple occasions.  My employer seems to think that websites that contain a disproportionate number of occurrences of the word &quot;f*ck&quot; are &lt;em&gt;obviously&lt;/em&gt; pornographic, and serves me a huge banner saying:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&quot;Your attempt to view this page has be blocked!&quot;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This can sometimes make it difficult to slack off at work and do programming puzzles, and although I doubt my employer ever checks the logs, I wouldn't exactly want to be pulled into a meeting to explain why I had set some sort of record for hitting web filters for pages with the word &quot;f*ck&quot; in them. My immediate boss would laugh her butt off, her boss wouldn't.&lt;/p&gt;&#xA;" OwnerUserId="7464" LastActivityDate="2014-03-06T01:07:48.937" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1188" PostTypeId="2" ParentId="1182" CreationDate="2014-03-06T03:49:44.480" Score="7" Body="&lt;p&gt;Maybe do it as a &lt;code&gt;code-challenge&lt;/code&gt;?  I think that that is the default for weighted scoring.&lt;/p&gt;&#xA;" OwnerUserId="17096" LastActivityDate="2014-03-06T03:49:44.480" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1190" PostTypeId="2" ParentId="1136" CreationDate="2014-03-06T10:11:19.623" Score="-3" Body="&lt;pre&gt;&lt;code&gt;++++[++++&amp;gt;---&amp;lt;]&amp;gt;-.---[-----&amp;gt;+&amp;lt;]&amp;gt;-.+++[-&amp;gt;+++&amp;lt;]&amp;gt;++.&#xA;++++++++.+++++.-[-&amp;gt;+++&amp;lt;]&amp;gt;-.[++&amp;gt;-------&amp;lt;]&amp;gt;.+[-&amp;gt;+++&#xA;&amp;lt;]&amp;gt;+.++++++++.&amp;gt;+[---&amp;gt;++&amp;lt;]&amp;gt;+++.[-&amp;gt;+++++++&amp;lt;]&amp;gt;.++++++.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Since there is no way to misunderstand it, I'd say it's &quot;BrainF**k&quot; is fine.&lt;/p&gt;&#xA;" OwnerUserId="14676" LastActivityDate="2014-03-06T10:11:19.623" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1192" PostTypeId="1" CreationDate="2014-03-06T15:46:54.673" Score="31" ViewCount="1229" Body="&lt;p&gt;I'm Grace Note, a Community Manager at Stack Exchange.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/questions/199551/what-is-the-stack-exchange-staff-process-of-launching-a-site/200383#200383&quot;&gt;We have a process for how sites go about graduating or sticking around in Beta&lt;/a&gt;, but as noted in the comments there, Code Golf is one of two sites that we do not have periodic &quot;Site Evaluations&quot; where we compare questions against the rest of the internet. Instead, we have silent internal reviews every now and then.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've been asked by various folks, especially after recent attention given to the sister site Code Review (who equally has the same lack of periodic evaluations), how Code Golf is doing. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The internal review back in October I did, there were two points I brought up - the traffic had been pretty stagnant for three years, and the userbase was dedicated but rep distribution was a mess. In fact the site was... pretty mediocre in just about every department. The prospects were very much the opposite of positive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Things have changed.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; seems to be something to point at - you guys received a ginormous traffic boost from the birth of this tag. Prior to Christmas, the site's average traffic levels were, like, 500-1000 for the whole thousand plus days of lifetime. Then on December 28th, you guys jumped by over a factor of 30, and since then throughout January and February you guys have been maintaining an average closer to 5000 visits per day. By comparison, Code Review is also at that level and they're pretty happily marching on from that as well. This is a nice thing to see and we'll probably want to watch this for some more time to see how well this is sticking, but so far it is really sticking. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It was previously a concern of mine that there's a certain difficulty in generating new questions for the site, because not only must one create some idea of a puzzle, but also must make one that didn't intersect with the three years of questions built up already. The invention of a new puzzle type, and perhaps continued innovation in that department, helps a lot. The traffic and answer activity levels are great - I think question income could do some notches higher but we're still on a great rise from before.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;On the user side of things, I pointed out &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/607/how-are-we-going-to-get-out-of-beta/678#678&quot;&gt;this answer&lt;/a&gt; as sharing my concerns - there was a major issue with voting. Code Review has also had this issue and they're really powering through it, though they still have some distance to go. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;To my surprise, wow you guys made a huge shift here. In these four months, six people crowned over 10,000 reputation, and you've got a very nice collection of users in the higher reputation levels. The rep distribution is also nice, and you have 14% of users between 500 and 1000 reputation, and an additional 14% of users above 1000 reputation. These are mostly still-active users, too, so there's a lot of engaged activity. Your meta activity has also &lt;em&gt;exploded&lt;/em&gt; into one of the more active metas in recent weeks. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a site that &lt;em&gt;lives&lt;/em&gt; off of engagement - whereas other sites deal with producing solutions to problems, this site's competitive nature means that it thrives when it has people actively engaging against each other. And that seems to have started to really kick up. The userbase size is something that could be said to be low, but not in a number that is problematic or anything.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The overall scenario is extremely positive. What was once a site that may've languished and sat in Beta status indefinitely, has returned with extreme strength and dedication to their task. All in all, much like I am extremely pleased with &lt;a href=&quot;https://codereview.meta.stackexchange.com/questions/1567/100-days-later-whats-up&quot;&gt;how Code Review shaped up when spurred to action&lt;/a&gt;, I'm very delighted at what this community has brought on their own to improve and beyond improve their progress.&lt;/p&gt;&#xA;" OwnerUserId="2414" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-05-19T17:28:14.820" Title="What does Code Golf's progress look like right now?" Tags="|discussion|beta-status|" AnswerCount="3" CommentCount="19" ContentLicense="CC BY-SA 3.0" />
  <row Id="1193" PostTypeId="2" ParentId="2140" CreationDate="2014-03-06T16:28:57.740" Score="2" Body="&lt;h1&gt;Unified format patcher&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write the shortest program that will take a patch file in the &lt;a href=&quot;http://en.wikipedia.org/wiki/Diff#Unified_format&quot; rel=&quot;nofollow noreferrer&quot;&gt;unified format&lt;/a&gt; from stdin and apply that patch. No external tools that do the process for you can be used.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Clarifications&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Extra documentation about the unified format can be found &lt;a href=&quot;http://www.gnu.org/software/diffutils/manual/diffutils.html#Unified-Format&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;All file paths will be relative&lt;/li&gt;&#xA;&lt;li&gt;Only one file will be modified per patch&lt;/li&gt;&#xA;&lt;li&gt;Timestamps can be ignored&lt;/li&gt;&#xA;&lt;li&gt;The patch file will be valid and will apply cleanly to the file specified (it will not lie about line numbers, etc..)&lt;/li&gt;&#xA;&lt;li&gt;Assume all files being patched already exist, you don't need to create/delete files&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Extra&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;-35&lt;/strong&gt; - Take an argument that allows you to unpatch a patch&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;/test/a.cpp&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#include &amp;lt;iostream&amp;gt;&#xA;using namespace std;&#xA;&#xA;int main() {&#xA;    cout &amp;lt;&amp;lt; &quot;Hello world!&quot;;&#xA;    return 0;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;patch.txt&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;--- a/test/a.cpp&#xA;+++ b/test/a.cpp&#xA;@@ -1,7 +1,8 @@&#xA; #include &amp;lt;iostream&amp;gt;&#xA;+#include &amp;lt;vector&amp;gt;&#xA; using namespace std;&#xA;&#xA; int main() {&#xA;-    cout &amp;lt;&amp;lt; &quot;Hello world!&quot;;&#xA;+    cout &amp;lt;&amp;lt; &quot;Goodbye world!&quot;;&#xA;     return 0;&#xA; }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Run patch&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;patch.exe patch.txt&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;/test/a.cpp&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#include &amp;lt;iostream&amp;gt;&#xA;#include &amp;lt;vector&amp;gt;&#xA;using namespace std;&#xA;&#xA;int main() {&#xA;    cout &amp;lt;&amp;lt; &quot;Goodbye world!&quot;;&#xA;    return 0;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="2852" LastEditorUserId="2852" LastEditDate="2014-03-07T14:03:13.993" LastActivityDate="2014-03-07T14:03:13.993" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="1194" PostTypeId="2" ParentId="1192" CreationDate="2014-03-06T16:40:23.760" Score="17" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;It was previously a concern of mine that there's a certain difficulty in generating new questions for the site, because not only must one create some idea of a puzzle, but also must make one that didn't intersect with the three years of questions built up already.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That is a genuine problem. On the other hand, the site only needs one or two &lt;em&gt;good&lt;/em&gt; questions per day, because most good questions take at least a couple of hours to answer well, and there's three years' worth of questions for newcomers to tackle. (Of course, &lt;a href=&quot;http://en.wikipedia.org/wiki/Sturgeon&amp;#39;s_law&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sturgeon's Law&lt;/a&gt; applies, so getting only one or two questions per day would not be good enough).&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The invention of a new puzzle type, and perhaps continued innovation in that department, helps a lot.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Really? There have only been 5 &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; questions posted in the past month, of which one is closed (and the issue of whether all of them should be deleted divides the community). From where I sit it seems that the thing which helped a lot was having a question posted on Reddit when lots of people were on holiday.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The long-term effect seems to be that we tend to have one or two questions in the &quot;hot network questions&quot; list, and while they tend not to be the best questions my hypothesis is that they attract enough people to also draw eyeballs onto the next &quot;hot&quot; question. I don't know whether the data available to you is sufficient to estimate the effect of &quot;hot&quot; questions in the ongoing visitor stats.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="194" LastEditDate="2014-03-08T09:25:28.907" LastActivityDate="2014-03-08T09:25:28.907" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="1196" PostTypeId="2" ParentId="2140" CreationDate="2014-03-06T20:05:41.027" Score="0" Body="&lt;h1&gt;&lt;strong&gt;Convert input to ASCII Semaphore&lt;/strong&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;With monitor resolutions getting higher and font sizes getting lower, a good programmer has to make efforts to ensure that output is accessible to the visually impaired.  This can be problematic when the only display is in text. Toward this end, your assignment (if you choose to accept it) is to write a program that converts text input into ASCII art &lt;a href=&quot;http://en.wikipedia.org/wiki/Flag_semaphore&quot; rel=&quot;nofollow&quot;&gt;flag semaphore&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Your program must accept any letter in the ASCII character set from A to Z (case insensitive) and spaces.&lt;/li&gt;&#xA;&lt;li&gt;The program can accept input in any way that is convenient for the language it is written in (stdin,&#xA;command line, file, etc.).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The program should output an ASCII art representation of the input string in flag semaphore. Follow &lt;a href=&quot;http://en.wikipedia.org/wiki/Flag_semaphore&quot; rel=&quot;nofollow&quot;&gt;this link&lt;/a&gt; to see the expected encoding.&lt;/li&gt;&#xA;&lt;li&gt;Line feeds and carriage returns should be interpreted as spaces.&lt;/li&gt;&#xA;&lt;li&gt;Numbers and other non-letters in the input may be ignored.&lt;/li&gt;&#xA;&lt;li&gt;You may use whatever ASCII art representation of the semaphore sender you like, but it must contain a person holding two flags and have distinct arms, legs, head, and flags. It must be at least 10x10 characters.&lt;/li&gt;&#xA;&lt;li&gt;Output may be either horizontal or vertical.  &lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; &lt;code&gt;Hello&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;           ###&#xA;           ###&#xA;            #&#xA; _____########&#xA;|  |       ###&#xA;|__|      ####&#xA;         # ###&#xA;        #  ###&#xA;       /   # #&#xA;      /\   # #&#xA;     /  \  # #&#xA;     \  /  # #&#xA;      \/  ## ##&#xA;                    /\&#xA;                   /  \&#xA;                  /\  /&#xA;                 #  \/&#xA;           ###  #&#xA;           ### #&#xA;            # #&#xA;          ####&#xA;         # ###&#xA;         # ###&#xA;         # ###&#xA;         # ###&#xA;         | # #&#xA;         |__ #&#xA;         |  |#&#xA;         |__|#&#xA;          ## ##&#xA;                    /\&#xA;                   /  \&#xA;                  /\  /&#xA;                 #  \/&#xA;           ###  #&#xA;           ### #&#xA;            # #&#xA;           ###&#xA;          ####&#xA;         # ###&#xA;        #  ###&#xA;       #   ###&#xA;      /    # #&#xA;     /\    # #&#xA;    /  \   # #&#xA;    \  /   # #&#xA;     \/   ## ##&#xA;                    /\&#xA;                   /  \&#xA;                  /\  /&#xA;                 #  \/&#xA;           ###  #&#xA;           ### #&#xA;            # #&#xA;           ###&#xA;          ####&#xA;         # ###&#xA;        #  ###&#xA;       #   ###&#xA;      /    # #&#xA;     /\    # #&#xA;    /  \   # #&#xA;    \  /   # #&#xA;     \/   ## ##&#xA;   /\&#xA;  /  \&#xA;  \  /\&#xA;   \/  #&#xA;        #  ###&#xA;         # ###&#xA;          # #&#xA; _____########&#xA;|  |       ###&#xA;|__|       ###&#xA;           ###&#xA;           ###&#xA;           # #&#xA;           # #&#xA;           # #&#xA;           # #&#xA;          ## ##&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is code golf.  Shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="7464" LastEditorUserId="7464" LastEditDate="2014-03-06T20:45:13.233" LastActivityDate="2014-03-06T20:45:13.233" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="1197" PostTypeId="2" ParentId="2140" CreationDate="2014-03-06T21:36:40.793" Score="2" Body="&lt;h2&gt;DIM, the DIM Integer Machine&lt;/h2&gt;&#xA;&lt;p&gt;The DIM Integer Machine is an engine for producing integer sequences.&lt;/p&gt;&#xA;&lt;p&gt;It has one major problem: To put it mildly, it's kind of...dim.&lt;/p&gt;&#xA;&lt;p&gt;After producing a single number, it &lt;em&gt;immediately&lt;/em&gt; forgets what sequence it was working on. The only thing it remembers is the last number it produced and the current direction of the search, either ascending or descending. (And of course, it remembers the methodology for finding numbers according to the commands it understands).&lt;/p&gt;&#xA;&lt;p&gt;Consequently, the user is free to change their mind after each number by issuing a new command.&lt;/p&gt;&#xA;&lt;p&gt;Suppose the DIM has just produced an integer square: 81&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;User inputs &lt;code&gt;P&lt;/code&gt; and submits the input.&lt;/li&gt;&#xA;&lt;li&gt;DIM understands that &lt;code&gt;P&lt;/code&gt; is requesting the next prime number after 81&lt;/li&gt;&#xA;&lt;li&gt;DIM computes and returns &lt;code&gt;83&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;DIM forgets what it was doing.&lt;/li&gt;&#xA;&lt;li&gt;User inputs &lt;code&gt;O&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;DIM understands that &lt;code&gt;O&lt;/code&gt; is requesting the next odious number and returns &lt;code&gt;84&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;DIM forgets what it was doing.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;The DIM functions only for numbers between 1 and 1,000,000.&lt;/strong&gt; If the DIM reaches either extreme while performing a search it will reverse direction and continue searching.&lt;/p&gt;&#xA;&lt;p&gt;(For example: If searching in ascending order for a prime when the last number was 999,999, it will encounter 1,000,000 which is not a prime, then switch to descending order and continue searching for the &amp;quot;next&amp;quot; prime by moving downward - 999,999...999,998, etc.)&lt;/p&gt;&#xA;&lt;p&gt;The DIM remembers the last number as &lt;code&gt;1&lt;/code&gt; when it is first activated for a searching session.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;This is the full list of commands that the DIM understands:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;P&lt;/code&gt; - Next prime number&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;S&lt;/code&gt; - Next square number&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;F&lt;/code&gt; - Next Fibonacci number&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;O&lt;/code&gt; - Next odious number&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;W&lt;/code&gt; - Next wasteful number&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;U&lt;/code&gt; - Next undulating number&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;K&lt;/code&gt; - Next katadrome&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;R&lt;/code&gt; - Reverse direction immediately; the next command will proceed in the new direction&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Because the DIM is so...dim, it absolutely DOES NOT precompute lookup tables of numbers in these sequences. It is far too forgetful for that to work.&lt;/strong&gt; The DIM also has no Internet connection, so it is unable to consult the Online Encyclopedia of Integer Sequences or other such sites. It also has a sense of pride, so it does not make use of built-in Fibonacci functions or NextPrime / PrimeIndex / PrimeTest type functions.&lt;/p&gt;&#xA;&lt;p&gt;Given the parameters it knows - a starting number, a search direction, the type of number to find - it simply computes the next number by some means other than mere data retrieval.&lt;/p&gt;&#xA;&lt;p&gt;The DIM may accept input interactively, or from a newline-terminated text file, or from a pre-initialized array. You may not pack extraneous data other than the command sequence into the input - play fair!&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;This is a code golf, so least number of bytes wins. Submit your program with output results for the following search sessions:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;P O U R F O R U S O U R P R O W S&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;W O R K F O R P O O R F O R K S K O O P S R O O K S F O U R W O W S&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;P O O P O O P O O P P O O P P R O P S P R O W S P O R K S&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;em&gt;It is assumed that you know what prime, square, and Fibonacci numbers are. A brief explanation of the other integer sequences follows.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Odious - a nonnegative number which has an odd number of 1s in its binary expansion. The first few odious numbers are 1, 2, 4, 7, 8, 11, 13, 14, 16, 19&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Wasteful - a natural number that has fewer digits than the number of digits in its prime factorization (including the exponents). The first few are 4, 6, 8, 9, 12, 18, 20, 22&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Undulating - has alternating digits of the form aba, abab, ababa, etc. Assume all U numbers are non-trivial, i.e. 3 digits or more. The first few: 101, 121, 131, 141, 151, 161, 171, 181, 191, 202, 212&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Katadrome - A number whose hexadecimal digits are in strict descending order. The first few are 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 32, 33, 48, 49&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="3363" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-03-06T21:42:37.300" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1198" PostTypeId="2" ParentId="1185" CreationDate="2014-03-06T23:10:45.160" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/173187/low-code-golf-scores&quot; rel=&quot;nofollow&quot;&gt;This is a first stab&lt;/a&gt; at querying for that information via StackExchange Data Explorer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is not easy data to isolate, because some languages are named with a -[number] pattern in them (Befunge-93, Modula-2, etc.) and because many users will list their positive scores thusly:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Haskell-36 chars&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So it's merely a start, a proof if you will that because the golf scores are part of the message body it is not a simple matter to decompose the data you seek.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Still, this should give you something to play with. You can probably zero in closer by restricting the query to only the code golf tag and tweaking the query with more NOT LIKE exceptions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And if any of the Meta crowd can think of some genuinely useful things that the data might be able to tell us about the site, as the resident SQL nerd I am willing to build queries toward that end. As long as it doesn't depend on munging the post body into useful data, there's a lot that Data Explorer makes it possible to learn.&lt;/p&gt;&#xA;" OwnerUserId="3363" LastActivityDate="2014-03-06T23:10:45.160" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1199" PostTypeId="1" AcceptedAnswerId="1204" CreationDate="2014-03-06T23:57:33.470" Score="2" ViewCount="187" Body="&lt;p&gt;First, I realise that this question is a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/385/12205&quot;&gt;duplicate&lt;/a&gt;, but since that was asked a long time ago, I think it would be appropriate to ask it again.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit&lt;/strong&gt;: Some questions may be a better fit for the &lt;a href=&quot;http://cs.stackexchange.com&quot;&gt;Computer Science Stack Exchange&lt;/a&gt;, so I have included this in the title as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Recently, we have a lot (in my opinion) of &quot;general programming questions&quot;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/23157/12205&quot;&gt;https://codegolf.stackexchange.com/q/23157/12205&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/23114/12205&quot;&gt;a question about getline in C++!&lt;/a&gt; (Deleted)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/23006/12205&quot;&gt;How to find the maximum in any interval in an array with preprocessing in O(nlogn)&lt;/a&gt; (Deleted)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/22948/12205&quot;&gt;On pop up accordian is called in that i want to display error message&lt;/a&gt; (Deleted)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/22809/12205&quot;&gt;https://codegolf.stackexchange.com/q/22809/12205&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/22665/12205&quot;&gt;https://codegolf.stackexchange.com/q/22665/12205&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/22653/12205&quot;&gt;Operations on stacks of coins&lt;/a&gt; (Deleted)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Edit:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/23427/12205&quot;&gt;https://codegolf.stackexchange.com/q/23427/12205&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;That is seven questions over five days, or an average of 1.4 question per day, that I think should belong to StackOverflow question instead.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The answer on the linked question states that&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If you want a migration path to a site, you'll need to provide ample evidence that you actually have a sufficient demand for it. &lt;strong&gt;You need a significant number of questions that you either have already migrated to Stack Overflow, or are valid migrations to Stack Overflow that have yet to be addressed.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In my opinion this is a significant number, so I'm thinking whether we should have migration to StackOverflow. From the askers' perspective, I think it would help them a lot if their question can be migrated automatically, instead of being criticized here. From our perspective, it could clear up the site (without so many [on hold] questions) and we don't need to repeat the comment -&gt; vote to close -&gt; vote to delete procedure. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;Related: Looking at &lt;a href=&quot;https://codegolf.stackexchange.com/tools/posts/migrated/away&quot;&gt;this page&lt;/a&gt; in the moderator tools, I realised that there were some migrations to StackOverflow in 2011 and early 2012. Since I am relatively new here, was there some historical reasons that caused the migration link to be removed?&lt;/s&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;P.S. first meta question, so I'm not sure whether I got the tags right.&lt;/p&gt;&#xA;" OwnerUserId="12205" LastEditorUserId="68942" LastEditDate="2021-06-09T05:46:33.707" LastActivityDate="2021-06-09T05:46:33.707" Title="Can we migrate questions to StackOverflow / CS.SE?" Tags="|feature-request|status-declined|migration|" AnswerCount="2" CommentCount="2" ClosedDate="2021-06-03T23:33:11.813" ContentLicense="CC BY-SA 3.0" />
  <row Id="1200" PostTypeId="1" AcceptedAnswerId="1202" CreationDate="2014-03-07T00:18:21.627" Score="1" ViewCount="247" Body="&lt;p&gt;Most answers look somewhat like this:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Language, score&lt;/h1&gt;&#xA;&lt;p&gt;text&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;code&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;text&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;But some top lines look like this:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;Language score&lt;/h2&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Markdown:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;##Language score&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or this:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Language, ### chars&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Markdown:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;**Language, ### chars**&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The inconsistency is incredibly bothersome to me. Can we have a consensus as to what the formatting should be for the top line of most answers?&lt;/p&gt;&#xA;" OwnerUserId="11066" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-22T11:41:12.157" Title="Consensus for formatting of &quot;language and score line&quot;" Tags="|discussion|formatting|" AnswerCount="6" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1201" PostTypeId="2" ParentId="1200" CreationDate="2014-03-07T00:18:21.627" Score="0" Body="&lt;p&gt;I propose that they should be like this:&lt;/p&gt;&#xA;&lt;h3&gt;Language, score&lt;/h3&gt;&#xA;&lt;p&gt;Markdown:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;###Language, score&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Maybe only with two &lt;code&gt;#&lt;/code&gt;s, but I think three look better, and less bothersome/intrusive.&lt;/p&gt;&#xA;" OwnerUserId="11066" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-03-07T00:18:21.627" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1202" PostTypeId="2" ParentId="1200" CreationDate="2014-03-07T00:46:40.700" Score="8" Body="&lt;p&gt;I think&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Language, score&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Markdown:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;## Language, score&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is ideal. This is mainly a compromise between my usual h1 format and your h3. :P I don't think the h3 stands out enough since the font size is almost the same as normal text, and now that I think about it, the huge h1 looks way too big and takes up too much space.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, please just put a space after the &lt;code&gt;#&lt;/code&gt;s in your markdown; it makes it so much easier to read when editing and such.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="2381" LastEditDate="2014-03-07T07:59:29.813" LastActivityDate="2014-03-07T07:59:29.813" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1203" PostTypeId="2" ParentId="1200" CreationDate="2014-03-07T01:07:12.137" Score="3" Body="&lt;p&gt;This is actually something that &lt;em&gt;could&lt;/em&gt; be identified with reasonable ease via the Data Explorer. &lt;a href=&quot;https://meta.stackexchange.com/questions/114354/can-these-queries-be-added-to-the-automatic-low-quality-post-identification-proc&quot;&gt;Apparently&lt;/a&gt; if you can query it on Data Explorer, a similar query can be added to the Low Quality post queue selector.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'll whip up a few example queries based on these points and a few of the best ideas from the thread I linked.&lt;/p&gt;&#xA;" OwnerUserId="3363" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-03-07T01:07:12.137" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1204" PostTypeId="2" ParentId="1199" CreationDate="2014-03-07T01:12:50.427" Score="4" Body="&lt;p&gt;Roughly 40-45% of the off-topic questions I've seen lately would be a better fit for CS.SE than for SO, with another 40-45% being good for SO. I think an open channel to both sites would enable us to serve the askers with less friction than they currently get from us.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for the remaining off-topic questions, there is just nothing you can do with some of them but delete (e.g. tattoo guy), but it would be nice to be able to help the rest, who have often just accidentally posted here because they're green or disoriented.&lt;/p&gt;&#xA;" OwnerUserId="3363" LastActivityDate="2014-03-07T01:12:50.427" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1205" PostTypeId="2" ParentId="1200" CreationDate="2014-03-07T05:54:05.093" Score="1" Body="&lt;p&gt;Woah. I've been doing it totally differently.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Language score&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Markdown:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Language score&#xA;=&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2014-03-07T05:54:05.093" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1206" PostTypeId="2" ParentId="1200" CreationDate="2014-03-07T08:32:34.283" Score="13" Body="&lt;p&gt;I think that it's insane to try to constrain the way people submit their answers to this extent.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-03-07T08:32:34.283" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1208" PostTypeId="2" ParentId="922" CreationDate="2014-03-07T09:36:14.817" Score="3" Body="&lt;p&gt;A list of the &amp;quot;good&amp;quot; (IMO) questions that would be nice to &lt;em&gt;emigrate&lt;/em&gt; to our site. To avoid the flooding issue, perhaps they could be transferred one-a-day or so, and labeled &amp;quot;Classic:&amp;quot; and maybe marked Protected. I'll add more to this. This is a selection from the oldest 2 pages of golf questions on SO. Of course, they're too old to &amp;quot;migrate&amp;quot; by the normal mechanism, I'm assuming technological solutions exist to migrate these in a special manner.&lt;/p&gt;&#xA;&lt;h3&gt;Rosetta Stone.&lt;/h3&gt;&#xA;&lt;p&gt;28 votes 16 stars 50 answers &lt;a href=&quot;https://stackoverflow.com/questions/228518/palindrome-golf&quot;&gt;https://stackoverflow.com/questions/228518/palindrome-golf&lt;/a&gt;&lt;br /&gt;&#xA;24       9        36         &lt;a href=&quot;https://stackoverflow.com/questions/232861/fibonacci-code-golf&quot;&gt;https://stackoverflow.com/questions/232861/fibonacci-code-golf&lt;/a&gt;&lt;br /&gt;&#xA;2        5        40         &lt;a href=&quot;https://stackoverflow.com/questions/237496/code-golf-factorials&quot;&gt;https://stackoverflow.com/questions/237496/code-golf-factorials&lt;/a&gt;&lt;br /&gt;&#xA;21       10       63         &lt;a href=&quot;https://stackoverflow.com/questions/350885/create-sort-and-print-a-list-of-100-random-ints-in-the-fewest-chars-of-code&quot;&gt;https://stackoverflow.com/questions/350885/create-sort-and-print-a-list-of-100-random-ints-in-the-fewest-chars-of-code&lt;/a&gt;&lt;br /&gt;&#xA;8        4        32         &lt;a href=&quot;https://stackoverflow.com/questions/372668/code-golf-how-do-i-write-the-shortest-character-mapping-program&quot;&gt;https://stackoverflow.com/questions/372668/code-golf-how-do-i-write-the-shortest-character-mapping-program&lt;/a&gt;&lt;br /&gt;&#xA;24       9        45         &lt;a href=&quot;https://stackoverflow.com/questions/383403/code-golf-print-the-entire-12-days-of-christmas-song-in-the-fewest-lines-of-c&quot;&gt;https://stackoverflow.com/questions/383403/code-golf-print-the-entire-12-days-of-christmas-song-in-the-fewest-lines-of-c&lt;/a&gt;&lt;br /&gt;&#xA;17       4        31         &lt;a href=&quot;https://stackoverflow.com/questions/394574/code-golf-new-year-edition-integer-to-roman-numeral&quot;&gt;https://stackoverflow.com/questions/394574/code-golf-new-year-edition-integer-to-roman-numeral&lt;/a&gt;&lt;br /&gt;&#xA;30       23       46         &lt;a href=&quot;https://stackoverflow.com/questions/407518/code-golf-leibniz-formula-for-pi&quot;&gt;https://stackoverflow.com/questions/407518/code-golf-leibniz-formula-for-pi&lt;/a&gt;&lt;br /&gt;&#xA;2        0        2          &lt;a href=&quot;https://stackoverflow.com/questions/412184/code-golf-diffie-hellman-key-exchange&quot;&gt;https://stackoverflow.com/questions/412184/code-golf-diffie-hellman-key-exchange&lt;/a&gt;&lt;br /&gt;&#xA;24       11       22         &lt;a href=&quot;https://stackoverflow.com/questions/445782/finding-closest-match-in-collection-of-numbers&quot;&gt;https://stackoverflow.com/questions/445782/finding-closest-match-in-collection-of-numbers&lt;/a&gt;&lt;br /&gt;&#xA;7        6        26         &lt;a href=&quot;https://stackoverflow.com/questions/464960/code-golf-combining-multiple-sorted-lists-into-a-single-sorted-list&quot;&gt;https://stackoverflow.com/questions/464960/code-golf-combining-multiple-sorted-lists-into-a-single-sorted-list&lt;/a&gt;&lt;br /&gt;&#xA;1        0        5          &lt;a href=&quot;https://stackoverflow.com/questions/613390/code-golf-encode-decode-ascii-binary&quot;&gt;https://stackoverflow.com/questions/613390/code-golf-encode-decode-ascii-binary&lt;/a&gt;&lt;br /&gt;&#xA;11       8        16         &lt;a href=&quot;https://stackoverflow.com/questions/795027/code-golf-hex-to-raw-binary-conversion&quot;&gt;https://stackoverflow.com/questions/795027/code-golf-hex-to-raw-binary-conversion&lt;/a&gt;&lt;br /&gt;&#xA;1        0        5          &lt;a href=&quot;https://stackoverflow.com/questions/744671/golf-expand-templates-in-text-file&quot;&gt;https://stackoverflow.com/questions/744671/golf-expand-templates-in-text-file&lt;/a&gt;&lt;br /&gt;&#xA;18       11       14         &lt;a href=&quot;https://stackoverflow.com/questions/831915/code-golf-automata&quot;&gt;https://stackoverflow.com/questions/831915/code-golf-automata&lt;/a&gt;&lt;br /&gt;&#xA;75       52       43         &lt;a href=&quot;https://stackoverflow.com/questions/928563/code-golf-evaluating-mathematical-expressions&quot;&gt;https://stackoverflow.com/questions/928563/code-golf-evaluating-mathematical-expressions&lt;/a&gt;&lt;br /&gt;&#xA;12       7        13         &lt;a href=&quot;https://stackoverflow.com/questions/1038252/code-golf-quickly-build-list-of-keywords-from-text-including-of-instances&quot;&gt;https://stackoverflow.com/questions/1038252/code-golf-quickly-build-list-of-keywords-from-text-including-of-instances&lt;/a&gt;&lt;br /&gt;&#xA;46       32       17         &lt;a href=&quot;https://stackoverflow.com/questions/1066234/the-skyline-problem&quot;&gt;https://stackoverflow.com/questions/1066234/the-skyline-problem&lt;/a&gt;&lt;br /&gt;&#xA;10       7        34         &lt;a href=&quot;https://stackoverflow.com/questions/1078770/array-searching-code-challenge&quot;&gt;https://stackoverflow.com/questions/1078770/array-searching-code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Regular Golf.&lt;/h3&gt;&#xA;&lt;p&gt;5        3        7          &lt;a href=&quot;https://stackoverflow.com/questions/966896/code-golf-shortest-code-to-find-a-weighted-median&quot;&gt;https://stackoverflow.com/questions/966896/code-golf-shortest-code-to-find-a-weighted-median&lt;/a&gt;&lt;br /&gt;&#xA;17       13       13         &lt;a href=&quot;https://stackoverflow.com/questions/1031466/evaluate-dice-rolling-notation-strings&quot;&gt;https://stackoverflow.com/questions/1031466/evaluate-dice-rolling-notation-strings&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Disputed.&lt;/h3&gt;&#xA;&lt;p&gt;{This Answer is CW. Please feel free to &amp;quot;line-item veto&amp;quot; any questions in the above list and place them here.}&lt;/p&gt;&#xA;&lt;p&gt;1        1        6          &lt;a href=&quot;https://stackoverflow.com/questions/679802/codegolf-work-out-the-prime-factors-of-a-given-number&quot;&gt;https://stackoverflow.com/questions/679802/codegolf-work-out-the-prime-factors-of-a-given-number&lt;/a&gt; (this one needs editing, but the answers are nice)&lt;/p&gt;&#xA;&lt;h3&gt;Appendix.&lt;/h3&gt;&#xA;&lt;p&gt;{I don't know what to do with this one. It belongs somewhere, but ....}&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://stackoverflow.com/questions/921455/how-do-i-program-using-cat&quot;&gt;https://stackoverflow.com/questions/921455/how-do-i-program-using-cat&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-03-07T09:36:14.817" CommentCount="4" CommunityOwnedDate="2014-03-07T09:36:14.817" ContentLicense="CC BY-SA 3.0" />
  <row Id="1209" PostTypeId="1" CreationDate="2014-03-07T10:35:49.557" Score="3" ViewCount="91" Body="&lt;p&gt;I got &lt;a href=&quot;https://codegolf.stackexchange.com/a/23074/17886&quot;&gt;this answer&lt;/a&gt; on a question I posted. The poster of the answer is trying to skirt their way around the rule that says, &quot;You cannot use strings or char arrays.&quot; As this became an argument between the poster and me, we could not solicit the opinion of a third person on the issue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How should I go about resolving such disputes without creating a long comment trail?&lt;/p&gt;&#xA;" OwnerUserId="17886" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-03-07T15:44:19.583" Title="Dispute resolution over interpretation of question rules" Tags="|discussion|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1210" PostTypeId="2" ParentId="202" CreationDate="2014-03-07T10:58:59.900" Score="3" Body="&lt;p&gt;There are a couple options for running &lt;a href=&quot;https://esolangs.org/wiki/Piet&quot; rel=&quot;nofollow noreferrer&quot;&gt;Piet&lt;/a&gt; online:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The npiet interpreter has an &lt;a href=&quot;http://www.bertnase.de/npiet/npiet-execute.php&quot; rel=&quot;nofollow noreferrer&quot;&gt;online version&lt;/a&gt;. Upload an image file in ppm, png, or gif format.&lt;/li&gt;&#xA;&lt;li&gt;Try It Online can also run npiet. Because of TIO's text-only interface, you have to enter the program as a hexdump of an image file (ppm, png, or gif).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;http://www.rapapaing.com/blog/?page_id=6&quot; rel=&quot;nofollow noreferrer&quot;&gt;following website&lt;/a&gt; used to provide an online IDE for Piet, but the link currently seems to be dead.&lt;/p&gt;&#xA;" OwnerUserId="6741" LastEditorUserId="16766" LastEditDate="2022-01-22T00:45:09.860" LastActivityDate="2022-01-22T00:45:09.860" CommentCount="0" CommunityOwnedDate="2014-03-07T10:58:59.900" ContentLicense="CC BY-SA 4.0" />
  <row Id="1212" PostTypeId="2" ParentId="2140" CreationDate="2014-03-07T13:52:45.600" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/115234/line-up-for-golf&quot;&gt;Line up for golf!&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="3808" LastEditorDisplayName="user58826" LastEditDate="2017-06-09T16:12:50.950" LastActivityDate="2017-06-09T16:12:50.950" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1213" PostTypeId="1" CreationDate="2014-03-07T10:50:55.993" Score="32" ViewCount="1644" Body="&lt;p&gt;Most of the answers on this site are made using programming languages, that are well known, and easily installable by most of the people. They have well known installers (or are already included) in all major PC operating systems. These includes languages like Java, Ruby or Python.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some answers are in languages which are also widely available, but this might not be a well known fact. I'd include C# here, as some people think it's only available on Windows as a paid app (Visual Studio), but in reality there's Mono, which is free and available on all operating systems (including Windows), and there is also a free version of Visual Studio for C#.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are also languages which are somewhat hard to obtain. For example Mathematica and Maple are paid apps without proper free alternatives. Matlab, while having Octave as a free alternative it's missing some features from Matlab you might be using. Or for example GTB only works on TI calculators, and the installation instructions on how to set up a TI virtual machine are hard to find.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So if you are more or less actively using a language which you think might not be available for everyone, please post an answer describing how to install it. If you are using a non-free language, but it can generate a runnable code that can be viewed with a free app, then please describe how to generate this runnable code, so other people posting in that language can follow those instructions to generate an output that can be tested by everyone.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can also link to these language posts from your answers to help people.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One language per post please, this is a community wiki. The question is based on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/988/untestable-languages&quot;&gt;this meta post&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="8732" OwnerDisplayName="SztupY" LastEditorUserId="66833" LastEditDate="2017-06-15T21:50:02.333" LastActivityDate="2021-11-10T22:16:39.227" Title="Installation and testing instructions for specific programming languages" Tags="|discussion|testing|" AnswerCount="20" CommentCount="2" CommunityOwnedDate="2016-08-21T03:11:45.147" ContentLicense="CC BY-SA 3.0" />
  <row Id="1214" PostTypeId="2" ParentId="1213" CreationDate="2014-03-07T10:50:55.993" Score="4" Body="&lt;h1&gt;Whitespace&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;While Whitespace is available on &lt;a href=&quot;https://ideone.com/&quot; rel=&quot;nofollow&quot;&gt;ideone&lt;/a&gt;, it's official version is not that easy to install, as it's source only, and binaries that are working on recent systems are not readily available.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Install&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The following installation instructions are for OS X&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Install GHC via homebrew&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;$ brew install ghc haskell-platform&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Download and extract the &lt;a href=&quot;http://compsoc.dur.ac.uk/whitespace/downloads/wspace-0.3.tgz&quot; rel=&quot;nofollow&quot;&gt;source code&lt;/a&gt; from the &lt;a href=&quot;http://compsoc.dur.ac.uk/whitespace/download.php&quot; rel=&quot;nofollow&quot;&gt;official site&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Modify the Makefile, as it won't work on newer haskell versions:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Change the 5th line, where it sets &lt;code&gt;OPTS&lt;/code&gt; to the following:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;OPTS = -O -hide-package base&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Run make. It should generate the &lt;code&gt;wspace&lt;/code&gt; executable&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Posting&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;To help other people by testing you should not only include your answer in whitespace, but if possible also include it's BASE64 encoded or &quot;readable&quot; variant. By the latter I mean a solution where space is replaced by &lt;code&gt;S&lt;/code&gt;, tab is replaced by &lt;code&gt;T&lt;/code&gt; and line feed is replaced by &lt;code&gt;L&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To convert the &quot;readable variant&quot; from &lt;code&gt;S&lt;/code&gt;/&lt;code&gt;T&lt;/code&gt;/&lt;code&gt;L&lt;/code&gt; files back to whitespace you can use the following converter:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#!/usr/bin/env ruby&#xA;ARGF.each_line do |line|&#xA;  data = line.gsub(/'.'/) { |match| match[1].ord }&#xA;  data = data.gsub(/[^-LST0-9#]/,'').split('#').first&#xA;  if data&#xA;    data.tr!('LST',&quot;\n \t&quot;)&#xA;    data.gsub!(/[-0-9]+/){|m| &quot;#{m.to_i&amp;lt;0?&quot;\t&quot;:&quot; &quot;}#{m.to_i.abs.to_s(2).tr('01',&quot; \t&quot;)}\n&quot; }&#xA;    print data&#xA;  end&#xA;end&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that this, apart from converting the &lt;code&gt;S&lt;/code&gt;, &lt;code&gt;L&lt;/code&gt; and &lt;code&gt;T&lt;/code&gt; characters, also allow single line comments with &lt;code&gt;#&lt;/code&gt;, and can automatically convert numbers and simple character literals into their whitespace representation. If you don't need these extra stuff just remove lines 3 and 7&lt;/p&gt;&#xA;" OwnerUserId="8732" OwnerDisplayName="SztupY" LastActivityDate="2014-03-07T10:50:55.993" CommentCount="0" CommunityOwnedDate="2016-08-21T03:11:45.147" ContentLicense="CC BY-SA 3.0" />
  <row Id="1215" PostTypeId="2" ParentId="1213" CreationDate="2014-03-07T11:12:53.853" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;http://sagemath.org&quot; rel=&quot;nofollow&quot;&gt;Sage&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Windows, Mac OS X and Linux (except Ubuntu):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Visit &lt;a href=&quot;http://sagemath.org/download.html&quot; rel=&quot;nofollow&quot;&gt;this&lt;/a&gt; link to download binaries or &lt;a href=&quot;http://sagemath.org/download-source.html&quot; rel=&quot;nofollow&quot;&gt;this&lt;/a&gt; link for the source. If you use Windows you would also need &lt;a href=&quot;http://www.virtualbox.org&quot; rel=&quot;nofollow&quot;&gt;VirtualBox&lt;/a&gt;. Details of installation can be obtained by following the links.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ubuntu: Open a terminal and run this as root:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;apt-add-repository -y ppa:aims/sagemath&#xA;apt-get update&#xA;apt-get install sagemath-upstream-binary&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="12205" OwnerDisplayName="ace" LastActivityDate="2014-03-07T11:12:53.853" CommentCount="6" CommunityOwnedDate="2016-08-21T03:11:45.147" ContentLicense="CC BY-SA 3.0" />
  <row Id="1216" PostTypeId="2" ParentId="1213" CreationDate="2014-03-07T12:06:53.703" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;http://mniip.com/misc/conv/golflua/&quot; rel=&quot;nofollow&quot;&gt;Golflua&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;dpkg-based Linux distributions (Debian, Ubuntu, Mint, etc)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Download the corresponding .deb package from &lt;a href=&quot;http://mniip.com/misc/conv/golflua/deb/&quot; rel=&quot;nofollow&quot;&gt;here&lt;/a&gt;&lt;br&gt;&#xA;Then &lt;code&gt;dpkg&lt;/code&gt; it in:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;dpkg -i golflua_1.0-1_amd64.deb&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Windows&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Download the exe from &lt;a href=&quot;http://mniip.com/misc/conv/golflua/golflua-1.0.zip&quot; rel=&quot;nofollow&quot;&gt;here (zip archive)&lt;/a&gt;&lt;br&gt;&#xA;No installation neccessary. Run like you would run &lt;code&gt;lua.exe&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Other distributions, OS X, and a few other platforms&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Download the source from &lt;a href=&quot;http://mniip.com/misc/conv/golflua/golflua-1.0.tar.gz&quot; rel=&quot;nofollow&quot;&gt;here&lt;/a&gt;&lt;br&gt;&#xA;Simply running &lt;code&gt;make&lt;/code&gt; will list supported platforms and you should pick one of them.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$ make&#xA;Please do 'make PLATFORM' where PLATFORM is one of these:&#xA;   aix ansi bsd freebsd generic linux macosx mingw posix solaris&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="7162" OwnerDisplayName="mniip" LastEditorUserId="7162" LastEditDate="2014-03-10T00:08:50.070" LastActivityDate="2014-03-10T00:08:50.070" CommentCount="0" CommunityOwnedDate="2016-08-21T03:11:45.147" ContentLicense="CC BY-SA 3.0" />
  <row Id="1217" PostTypeId="2" ParentId="1209" CreationDate="2014-03-07T15:44:19.583" Score="1" Body="&lt;p&gt;I don't see why there is a problem for two reasons&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The users will vote their understanding, and so far they seem to believe that the answer is not consistent with the rules&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I am firmly of the opinion that if you set up silly rules you are going to get silly answers.&lt;sup&gt;1&lt;/sup&gt; &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; With few exceptions, I don't like most &lt;em&gt;&quot;solve this problem without this tool&quot;&lt;/em&gt; type challenges: I find them to be lazy. The exceptions generally go to some deep magic at the core of computer science.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2014-03-07T15:44:19.583" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1218" PostTypeId="2" ParentId="1213" CreationDate="2014-03-07T17:01:58.000" Score="3" Body="&lt;h1&gt;Perl 6&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The most complete implementation of Perl 6 as of now is Rakudo. After installation, it's available as &lt;code&gt;perl6&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Windows&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Visit &lt;a href=&quot;http://rakudo.org/downloads/star/&quot; rel=&quot;nofollow&quot;&gt;http://rakudo.org/downloads/star/&lt;/a&gt;, and download the newest &lt;code&gt;.msi&lt;/code&gt; file. After that, include installation directory in &lt;code&gt;PATH&lt;/code&gt; (right click on Computer, select Properties, choose Advanced System Settings, press Environment Variables, and change &lt;code&gt;PATH&lt;/code&gt;), and you can use &lt;code&gt;perl6&lt;/code&gt; in &lt;code&gt;cmd.exe&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Ubuntu Linux&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Install &lt;code&gt;rakudo&lt;/code&gt; package using &lt;code&gt;apt-get&lt;/code&gt; package manager. Please note that it's one year old, so it may be not good enough to run the script, but in most cases it should work.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Fedora Linux&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Install &lt;code&gt;perl6&lt;/code&gt; package using &lt;code&gt;yum&lt;/code&gt; package manager.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Arch Linux&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Install &lt;code&gt;rakudo&lt;/code&gt; from AUR.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Other operating systems&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Visit &lt;a href=&quot;http://rakudo.org/downloads/star/&quot; rel=&quot;nofollow&quot;&gt;http://rakudo.org/downloads/star/&lt;/a&gt;, and download the newest &lt;code&gt;.tar.gz&lt;/code&gt; file. Make sure you have C compiler and ICU library (&lt;code&gt;libicu-dev&lt;/code&gt; on Debian/Ubuntu) installed before continuing, and extract the files. After that, run the following commands in the extracted directory.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;perl Configure.pl --gen-parrot&#xA;make&#xA;make install&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Other options&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Ideone has too old version of Perl 6 to be reasonable, but it may work for very simple scripts which don't use newer features of Perl 6. Niecza is an alternate implementation, which was easier to install on Windows, but considering the current &lt;code&gt;.msi&lt;/code&gt; installer used by Rakudo, it's not that great anymore. It's relatively complete, even if it doesn't implement certain features.&lt;/p&gt;&#xA;" OwnerUserId="3103" LastEditorUserId="3103" LastEditDate="2014-03-09T21:48:17.710" LastActivityDate="2014-03-09T21:48:17.710" CommentCount="2" CommunityOwnedDate="2016-08-21T03:11:45.147" ContentLicense="CC BY-SA 3.0" />
  <row Id="1220" PostTypeId="2" ParentId="1192" CreationDate="2014-03-07T23:43:56.337" Score="7" Body="&lt;h2&gt;Let's go to the data&lt;/h2&gt;&#xA;&lt;p&gt;I've been a lurker, not a participant, for most of the time since I joined. So I think the best thing I can contribute to this discussion is use of my data-wrangling skills. Here are a few interesting queries. And bear with me, this post is beyond &lt;strong&gt;TL,DR&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;New Questions Analysis by Year/Month&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a simple trace of each month's &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/173351/new-questions-analysis-by-month&quot; rel=&quot;nofollow noreferrer&quot;&gt;new question activity since 2011.&lt;/a&gt; There is a boom at the beginning, followed by a slow decline, a resurgence in early-to-mid-2012, another slow decline, and a recent megaboom in December, January, and February. This is just a high-level view so there's no attempt to exclude low-quality questions, anomalous questions, or anything like that. We'll get to that. What this does show is that traffic has ramped up enormously. &lt;em&gt;Discussion questions:&lt;/em&gt; Has the 10-fold increase in new question views come at the cost of a 10-fold reduction in site quality? Has the 6- to 8-fold increase in new questions meant that 7/8  of those questions are bad?&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;year month AverageAnswerCount AverageNewQuestionViews NewQuestionCount NewQViewCount &#xA;---- ----- ------------------ ----------------------- ---------------- ------------- &#xA;2011 1     16                 2102                    50               105137        &#xA;2011 2     9                  976                     112              109389        &#xA;2011 3     10                 1266                    62               78492         &#xA;2011 4     9                  1356                    52               70559         &#xA;2011 5     6                  843                     37               31213         &#xA;2011 6     8                  1290                    35               45184         &#xA;2011 7     7                  1019                    29               29561         &#xA;2011 8     7                  1121                    31               34770         &#xA;2011 9     5                  744                     20               14899         &#xA;2011 10    9                  934                     9                8410          &#xA;2011 11    6                  823                     23               18932         &#xA;2011 12    9                  910                     39               35527         &#xA;2012 1     8                  1701                    37               62939         &#xA;2012 2     10                 1066                    17               18136         &#xA;2012 3     6                  693                     30               20798         &#xA;2012 4     9                  1195                    28               33467         &#xA;2012 5     9                  2611                    31               80966         &#xA;2012 6     7                  898                     36               32361         &#xA;2012 7     8                  766                     29               22227         &#xA;2012 8     6                  830                     36               29887         &#xA;2012 9     8                  919                     39               35844         &#xA;2012 10    5                  686                     39               26772         &#xA;2012 11    7                  696                     28               19507         &#xA;2012 12    7                  853                     23               19631         &#xA;2013 1     6                  885                     28               24807         &#xA;2013 2     4                  757                     34               25742         &#xA;2013 3     6                  502                     29               14572         &#xA;2013 4     10                 1084                    34               36868         &#xA;2013 5     5                  598                     29               17370         &#xA;2013 6     6                  539                     18               9707          &#xA;2013 7     8                  597                     24               14331         &#xA;2013 8     6                  975                     35               34137         &#xA;2013 9     5                  466                     30               13985         &#xA;2013 10    6                  486                     34               16537         &#xA;2013 11    8                  590                     46               27167         &#xA;2013 12    12                 2159                    93               200826        &#xA;2014 1     10                 1778                    205              364679        &#xA;2014 2     11                 1245                    184              229179        &#xA;2014 3     10                 261                     9                2355     &#xA;&#xA;  &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Where does this recent boost come from?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Let's look at the same stats, &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/edit/173352&quot; rel=&quot;nofollow noreferrer&quot;&gt;but broken down by tag.&lt;/a&gt; This shows tags that are high in one or more of these stats, over the past 3 months. Some notable items: code-golf is alive and well as a tag, commanding 39k, 265k(!!), and 105k new question views in Dec, Jan, and Feb, and dominating the new question submissions. Code-trolling makes a big splash in December, but a much smaller one in January and falls off as a factor in February, so perhaps it is not as big a portion of the recent surge as we thought based on Grace Note's report. It's interesting how much traffic hello-world is responsible for, and busy-beaver, and restricted-source. However, much of restricted-source can be attributed to one question: the 2014 question. Or can it? .......&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;year month TagName            AverageAnswersPerQuestion AverageNewQuestionViews NewQuestionCount NewQViewCount &#xA;---- ----- ------------------ ------------------------- ----------------------- ---------------- ------------- &#xA;2013 12    algorithm          14                        10694                   1                10694         &#xA;2013 12    ascii-art          11                        3513                    5                17566         &#xA;2013 12    code-challenge     13                        7418                    13               96439         &#xA;2013 12    code-golf          8                         744                     53               39454         &#xA;2013 12    code-trolling      38                        11032                   12               132384        &#xA;2013 12    math               6                         2852                    4                11411         &#xA;2013 12    popularity-contest 25                        6496                    21               136421        &#xA;2014 1     ascii-art          16                        3942                    10               39429         &#xA;2014 1     busy-beaver        59                        10730                   1                10730         &#xA;2014 1     code-challenge     7                         979                     24               23506         &#xA;2014 1     code-golf          10                        2038                    130              265058        &#xA;2014 1     code-trolling      15                        4398                    5                21992         &#xA;2014 1     hello-world        18                        2805                    7                19637         &#xA;2014 1     popularity-contest 12                        1723                    43               74121         &#xA;2014 1     random             38                        4846                    1                4846          &#xA;2014 1     regex-golf         25                        10816                   1                10816         &#xA;2014 1     regular-expression 6                         1948                    8                15585         &#xA;2014 1     restricted-source  60                        48557                   3                145673        &#xA;2014 1     string             8                         1800                    10               18002         &#xA;2014 2     ascii-art          7                         1244                    9                11200         &#xA;2014 2     bitwise            47                        2437                    1                2437          &#xA;2014 2     code-golf          11                        1022                    105              107356        &#xA;2014 2     graphical-output   12                        3451                    6                20707         &#xA;2014 2     hello-world        35                        11873                   2                23747         &#xA;2014 2     pi                 30                        2256                    2                4513          &#xA;2014 2     popularity-contest 14                        2028                    58               117676        &#xA;2014 2     quine              22                        5277                    1                5277     &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;But but but...what about Reddit? What about crappy popular questions like 2014?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;OK, let's look at the &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/173358/trailing-3mo-rollup-smoothed-ignore-top-question-per-tag&quot; rel=&quot;nofollow noreferrer&quot;&gt;top 5 tags for different stats over the past 3 months.&lt;/a&gt; But let's first assume that the big runaway success in each tag is perhaps too popular for its own good. It's an easy challenge that draws easy answers. OK, throw it away.  Here's what we get:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;TagName            NewQuestionViews &#xA;------------------ ---------------- &#xA;code-golf          278826           &#xA;popularity-contest 237419           &#xA;code-trolling      68359            &#xA;ascii-art          46089            &#xA;code-challenge     33297    &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Where do the eyeballs go?  Code Golf, and Popularity Contest. The latter is, I know, divisive. But I theorize that it reflects that many people who look at the site do not know any of the &amp;quot;good for golfing&amp;quot; languages. Popularity contest lets them participate in something they have a hope of winning. Thought question: Could we make more Atomic Code Golf questions to downplay the need for popularity contests? Could we invent other tags that have objective criteria without implicitly favoring the languages obsessed with brevity?&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;TagName            NewQuestions &#xA;------------------ ------------ &#xA;code-golf          285          &#xA;popularity-contest 124          &#xA;code-challenge     55           &#xA;string             25           &#xA;math               23         &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;It's notable here that people come to look at ascii-art, but when they make new questions, Math appears more often. Also, code-trolling shows similarly: fun to look at, but doesn't actually get that many questions created for it. Meanwhile, the core tags of code-golf, code-challenge, and popularity-contest show well for both views and new question growth, which seems to show that the site has a healthy core.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;TagName            AvgQuestionViews &#xA;------------------ ---------------- &#xA;restricted-source  7724             &#xA;hello-world        3238             &#xA;code-trolling      3107             &#xA;ascii-art          2003             &#xA;popularity-contest 1914    &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is interesting. Even with the wildly anomalous 2014 question excluded, restricted source questions - the questions many love to hate - draw views per question that average well above most other types of question. Ascii-art is unsurprising, because people like to look when there are pictures, but restricted source is interesting. Perhaps people just love an arbitrary challenge - &amp;quot;Play a Paganini caprice with an arm tied behind your back!&amp;quot; However, I began to suspect there might be another superstar question skewing the results, so I edited the query to require 3 or more questions per tag and got this instead:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;TagName            AvgQuestionViews &#xA;------------------ ---------------- &#xA;hello-world        3238             &#xA;code-trolling      3107             &#xA;ascii-art          2003             &#xA;popularity-contest 1914             &#xA;sorting            1137  &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;However so much we are tired of hello world questions, the tag has an audience.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;TagName            AnswersPerQuestion &#xA;------------------ ------------------ &#xA;sorting            23                 &#xA;code-trolling      21                 &#xA;hello-world        20                 &#xA;popularity-contest 14                 &#xA;ascii-art          10   &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This one is very interesting, too. Code-trolling has an obvious appeal that probably draws lots of answers because if you're not normally the sort to troll you will likely jump at the chance to do so consequence-free and actually gain reputation. But, sorting? Surprisingly good at attracting answers.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;In Conclusion&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I've thought out loud here about some of what I think the data might mean, but my analysis is by no means conclusive. Please sound off and discuss what we can see here. Please modify the queries, or request modifications from me if you don't know how. I'm interested in making data like this a valuable resource for the site.&lt;/p&gt;&#xA;&lt;p&gt;I think it is at least safe to say that the numbers show a healthy site that is growing. Not all of that growth may be in the right direction for the site, but there's a visible healthy core that remains devoted to the site's founding purpose and has exploded in size alongside any recent innovations or anomalies.&lt;/p&gt;&#xA;&lt;p&gt;Doin' alright, &lt;br&gt;&#xA;Gettin' good scores &lt;br&gt;&#xA;The future's so bright.. &lt;br&gt;&#xA;We gotta wear plus-fours! &lt;br&gt;&lt;/p&gt;&#xA;" OwnerUserId="3363" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-03-08T00:14:59.263" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1223" PostTypeId="1" CreationDate="2014-03-08T17:00:54.430" Score="3" ViewCount="194" Body="&lt;p&gt;I see lately lots of answers like &lt;a href=&quot;https://codegolf.stackexchange.com/a/22998/3358&quot;&gt;this&lt;/a&gt; that use joke “languages” like HQ9+. Should we add a requirement that the language should be sufficiently complex?&lt;/p&gt;&#xA;" OwnerUserId="3358" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2014-03-08T17:04:12.907" Title="Should we ban joke “languages”?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1224" PostTypeId="2" ParentId="1223" CreationDate="2014-03-08T17:04:12.907" Score="1" Body="&lt;p&gt;&lt;em&gt;This is just my opinion as a user, not as a moderator.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think HQ9+ is more or less grandfathered in. Its applicability to most golfing challenges is very limited.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for new languages, I'd like to see languages that are general-purpose and not tailored specifically for a certain class of programming problems. For example, GolfScript is actually general-purpose and it doesn't have special backdoors that give you a one-character solution to Hello World (for example).&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-03-08T17:04:12.907" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1225" PostTypeId="1" CreationDate="2014-03-09T01:13:20.203" Score="3" ViewCount="165" Body="&lt;p&gt;See, for example, a question I asked earlier: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/23497/write-the-shortest-code-to-generate-a-random-number-between-1-and-x&quot;&gt;Write the shortest code to generate a random number between 1 and x&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;@Oberon said &lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/23497/write-the-shortest-code-to-generate-a-random-number-between-1-and-x#comment48929_23497&quot;&gt;&quot;I'm not a downvoter, but maybe it's because the question isn't much of a challenge.&quot;&lt;/a&gt;&lt;/em&gt;, and his comment has got 6 up-votes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So what should you do, in cases like this? Should you vote to close your own question? Should you delete it outright?&lt;/p&gt;&#xA;" OwnerUserId="15022" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-03-09T13:14:06.103" Title="What should you do in cases where you've got answers, but others think that the question is not a challenge?" Tags="|discussion|policy|challenges|new-users|" AnswerCount="0" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1226" PostTypeId="1" AcceptedAnswerId="1233" CreationDate="2014-03-09T06:42:27.940" Score="2" ViewCount="142" Body="&lt;p&gt;In my popularity contest &lt;a href=&quot;https://codegolf.stackexchange.com/q/22599/9498&quot;&gt;Approximate a Bell Curve&lt;/a&gt;, the answer that I posted has the most votes. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In general on Stack Exchange sites, I avoid accepting my own answer and instead accept another answer that is right (when there are multiple right answers).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On this site, accepting means that the accepted answer has won the competition.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How should we handle situations like this?&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-03-09T15:39:04.437" Title="What to do when your own answer wins your competition?" Tags="|discussion|accepted-answer|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1228" PostTypeId="2" ParentId="2140" CreationDate="2014-03-09T07:46:19.743" Score="1" Body="&lt;p&gt;Weighted letters combination to get 2014.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a=1, b=2, c=3, d=4,...z=26, which letter combinations (in particular order) when operated by any one or two or three or all four of +,-,X,/ (in any order) will give 2014 as the result?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, j*t*j+n=10*20*10+14=2014, t*j*j+n=20*10*10+14=2014 and n+j*t*n=14+10*20*10=2014&lt;/p&gt;&#xA;&#xA;&lt;p&gt;are three different combinations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;N.B. - max number of consecutive same letters should be 2, see link &lt;a href=&quot;http://www.oxforddictionaries.com/words/are-there-any-english-words-containing-the-same-letter-three-times-in-a-row&quot; rel=&quot;nofollow&quot;&gt;http://www.oxforddictionaries.com/words/are-there-any-english-words-containing-the-same-letter-three-times-in-a-row&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="18681" LastEditorUserId="18681" LastEditDate="2014-03-09T07:59:06.073" LastActivityDate="2014-03-09T07:59:06.073" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1229" PostTypeId="1" AcceptedAnswerId="1232" CreationDate="2014-03-09T10:05:49.470" Score="1" ViewCount="59" Body="&lt;p&gt;I want to use an image from this thread to my Thesis.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/22144/images-with-all-colors?newreg=4b9ff227e08e461bb59fe83706ae18b2&quot;&gt;Images with all colors&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How can cite it. &lt;/p&gt;&#xA;" OwnerUserId="18691" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-03-09T14:33:08.737" Title="cite an answer or an image" Tags="|discussion|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1230" PostTypeId="2" ParentId="1229" CreationDate="2014-03-09T10:13:30.987" Score="0" Body="&lt;p&gt;I'm not sure this is on topic for this site, but here's a link that may be useful: &lt;a href=&quot;https://student.unsw.edu.au/how-do-i-cite-electronic-sources&quot; rel=&quot;nofollow&quot;&gt;Citing websites and databases using harvard referencing&lt;/a&gt;.&lt;br&gt;&#xA;The second one down 'To cite a page or document  within a website' seems to be what you're after.&lt;/p&gt;&#xA;" OwnerUserId="737" LastActivityDate="2014-03-09T10:13:30.987" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1232" PostTypeId="2" ParentId="1229" CreationDate="2014-03-09T14:33:08.737" Score="4" Body="&lt;p&gt;The StackExchange network requires people who post questions and answers to grant them a licence: this is necessary because otherwise they could potentially be infringing copyright by serving up the questions and answers to other users. The practical implementation of this involves a licence called &quot;CC BY-SA 3.0 with attribution required&quot;, and that licence effectively allows StackExchange to sublicense the content.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, it's not an exclusive licence. If you want to use a single image for your thesis, it's probably worth posting a comment on the relevant answer asking whether the owner is willing to negotiate a separate licence for that purpose. I expect that most users would be honoured by such a request and happy to agree.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Two things to be aware of:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It might be worth thinking about how you would prefer to attribute the image (i.e. the format which fits the bibliographic standard you're following) and including a concrete suggestion in your initial request.&lt;/li&gt;&#xA;&lt;li&gt;The owner might prefer to be cited using their real name, but communicating that real name to you by private e-mail, so you may have to give them an e-mail address. Think about whether you want to expose your general e-mail address, or whether you want to use a throwaway one which you don't mind exposing publicly.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-03-09T14:33:08.737" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1233" PostTypeId="2" ParentId="1226" CreationDate="2014-03-09T15:39:04.437" Score="6" Body="&lt;p&gt;There is nothing wrong with accepting your own answer, if it's the most correct one (this applies to SE in general). See: &lt;a href=&quot;http://blog.stackoverflow.com/2009/01/accept-your-own-answers/&quot;&gt;http://blog.stackoverflow.com/2009/01/accept-your-own-answers/&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For my own contests, if someone posts a better answer, I set that as the accepted answer. I encourage everyone to do this. (Oh, and hence the importance of objective winning criteria: &quot;best&quot; is self-evident and easily verifiable.)&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-03-09T15:39:04.437" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1234" PostTypeId="1" CreationDate="2014-03-09T16:46:07.663" Score="8" ViewCount="97" Body="&lt;p&gt;Is it possible to add a link to the ask question page suggesting users to first test in the current sandbox? This will probably help with visibility because most new users don't know that a sandbox exists and then the question gets edited to the annoyance of many people.&lt;/p&gt;&#xA;" OwnerUserId="8766" LastEditorUserId="68942" LastEditDate="2021-06-09T05:31:39.747" LastActivityDate="2021-06-09T05:31:39.747" Title="Add a sand-box link on the ask question page" Tags="|feature-request|status-completed|" AnswerCount="2" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1236" PostTypeId="2" ParentId="1213" CreationDate="2014-03-10T00:25:50.920" Score="1" Body="&lt;h1&gt;Visual C++, Visual C#, Visual F#, Visual BASIC&lt;/h1&gt;&#xA;&lt;p&gt;Download the Express versions of Visual Studio for Windows Desktop here: &lt;a href=&quot;http://www.visualstudio.com/en-us/downloads&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.visualstudio.com/en-us/downloads&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;On Linux/Mac, install &lt;a href=&quot;http://www.microsoft.com/net/core&quot; rel=&quot;nofollow noreferrer&quot;&gt;.NET Core&lt;/a&gt; or &lt;a href=&quot;http://www.mono-project.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Mono&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This can also do SQL server, HTML, and XAML.  It can profile Python, but I don't think it can edit it.&lt;/p&gt;&#xA;" OwnerDisplayName="user10766" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-15T18:11:11.453" CommentCount="0" CommunityOwnedDate="2016-08-21T03:11:45.147" ContentLicense="CC BY-SA 3.0" />
  <row Id="1238" PostTypeId="1" CreationDate="2014-03-10T03:16:19.530" Score="1" ViewCount="140" Body="&lt;p&gt;Is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/23571/wow-a-pong-game-with-the-help-of-ascii-art/23575?noredirect=1#23575&quot;&gt;this question asked by me&lt;/a&gt; really duplicate?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/10713/pong-in-the-shortest-code/&quot;&gt;the duplicate&lt;/a&gt; is not the same as the one I asked.&lt;/p&gt;&#xA;" OwnerUserId="17120" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-12-05T00:18:01.403" Title="Is this question really duplicate?" Tags="|support|specific-question|duplicates|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1239" PostTypeId="2" ParentId="1238" CreationDate="2014-03-10T03:18:42.843" Score="4" Body="&lt;p&gt;Two questions do not have to be identical to be considered a duplicate. Your question is similar enough to the other one to count.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The real question to ask is, does a new question add value, compared to questions previously asked?&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-03-10T03:18:42.843" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1240" PostTypeId="5" CreationDate="2014-03-10T04:10:01.043" Score="0" Body="&lt;p&gt;Use this tag when discussing how to test programs, as in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1213/installation-and-testing-instructions-for-specific-programming-languages&quot;&gt;Installation and testing instructions for specific programming languages&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="38979" LastEditorUserId="73111" LastEditDate="2018-10-29T10:03:15.767" LastActivityDate="2018-10-29T10:03:15.767" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="1241" PostTypeId="4" CreationDate="2014-03-10T04:10:01.043" Score="0" Body="Use this tag when discussing how to test programs, as in this post: https://codegolf.meta.stackexchange.com/questions/1213/installation-and-testing-instructions-for-specific-programming-languages" OwnerDisplayName="user10766" LastEditorUserId="38979" LastEditDate="2018-10-29T23:14:26.200" LastActivityDate="2018-10-29T23:14:26.200" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="1245" PostTypeId="2" ParentId="2140" CreationDate="2014-03-11T01:27:43.443" Score="4" Body="&lt;h2&gt;4 and 20 baked in a π&lt;/h2&gt;&#xA;&lt;p&gt;While some might describe π as a string of seemingly random numbers, one can also look at it in a way similar to a monkey with a typewriter.  Eventually, it should calculate out to something more interesting. For example, the sequence &lt;code&gt;1337&lt;/code&gt; shows up 4,814 places to the right of the decimal. At 700,731 places right of the decimal, you'll find the sequence &lt;code&gt;160151&lt;/code&gt;, which is &amp;quot;pi&amp;quot; represented as ASCII (although you'll find a 'pointer' to it much faster, as the sequence &lt;code&gt;700731&lt;/code&gt; begins at 29,830 digits to the right).&lt;/p&gt;&#xA;&lt;p&gt;So, your task is to make a program to find things in π.  Your program will accept a positive integer and output the number of places right of the decimal point that number appears.  To keep the run times down, input can be limited to numbers in the range of 0 to 1000 (without leading zeros).&lt;/p&gt;&#xA;&lt;p&gt;Example: Using 415 as the input, the output should be 2:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;3.14159&#xA;   ^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can not use any precalculated values of π, including language&#xA;constants, built in functions that return π or digits of π, or any&#xA;resource outside the code itself (such as files or websites).&lt;/li&gt;&#xA;&lt;li&gt;You can not use any trig functions to calculate π.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Bonus points if you find the sequence &lt;code&gt;072 101 108 108 111 044 032 087 111 114 108 100 033&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This is code golf, so lowest score wins.&lt;/p&gt;&#xA;" OwnerUserId="7464" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-03-11T17:20:43.203" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1248" PostTypeId="2" ParentId="1137" CreationDate="2014-03-11T14:17:08.293" Score="10" Body="&lt;h1&gt;&lt;a href=&quot;http://data.stackexchange.com/codegolf/query/161411/site-activity-and-votegraph#graph&quot; rel=&quot;nofollow noreferrer&quot;&gt;CodeGolf Site activity:&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/uSNFI.png&quot; alt=&quot;CodeGolf Site Activity&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;The above chart shows me that you guys have had a huge surge in activity since December (maybe Grace is right about the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; )&lt;/p&gt;&#xA;&lt;p&gt;As part of the CodeReview crowd that is interested in graduation, I have been putting together a bunch of SEDE queries that are useful. Many of them are documented in our &lt;a href=&quot;https://codereview.meta.stackexchange.com/questions/1429/stack-exchange-data-explorer-is-up-what-now-wonderland&quot;&gt;SEDEWonderland post on CodeReview meta&lt;/a&gt;. Others you can find in my profile on SEDE &lt;a href=&quot;http://data.stackexchange.com/users/12469/rolfl?order_by=favorite&quot; rel=&quot;nofollow noreferrer&quot;&gt;under my 'favourites'&lt;/a&gt;.... other queries are also used in our &lt;a href=&quot;https://codereview.meta.stackexchange.com/questions/1567/100-days-later-whats-up&quot;&gt;regular graduation/progress reports&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;While I want CodeReview to whip the pants off CodeGolf (one is about writing great code, the other about, well, writing illegible drivel ;-), I &lt;em&gt;do&lt;/em&gt; have some answers on this site, and I want the best for all ;-). I am interested in developing SEDE queries that can benefit all sites, whether graduating, new, or otherwise.&lt;/p&gt;&#xA;&lt;p&gt;So, if you have an interest in getting statistics from the database that can help you understand your site's status, progress, strengths, weaknesses, etc. Then drop me a note (comment here?) or find me in the &lt;a href=&quot;http://chat.stackexchange.com/rooms/8595/the-2nd-monitor&quot;&gt;2nd Monitor (CodeReview Chat room)&lt;/a&gt; and we can work on something (if I don't already have it ... )&lt;/p&gt;&#xA;&lt;p&gt;Edit: I have created the new &lt;a href=&quot;http://chat.stackexchange.com/rooms/13526/sede-stack-exchange-data-explorer&quot;&gt;chat room for general SEDE discussion&lt;/a&gt; now too.&lt;/p&gt;&#xA;" OwnerUserId="10612" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-03-11T15:06:06.373" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1249" PostTypeId="1" CreationDate="2014-03-11T16:15:38.990" Score="6" ViewCount="198" Body="&lt;p&gt;I found general consensus in the &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;Code Golf chat&lt;/a&gt; that unchallenging questions are detrimental to the site. If this is incorrect, stop reading and provide a voice for the worth of such questions. If the goal is to eliminate them, a mechanism for scoring difficulty seems necessary. I would like to propose such a system.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This was &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/64/18487&quot;&gt;brought up in 2011&lt;/a&gt;, but an answer was never accepted and I am not satisfied with the conclusion of the highest voted answer that a subjective scoring system is a bad one. Keep reading to find out why.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Who Assigns Difficulty&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The beauty of StackExchange is that much of the heavy lifting moderation is crowdsourced. I think users above a low minimum rep (equal to what is required to flag or vote to close) should be able to assign a difficulty level to questions. If the average difficulty as voted falls below a minimum, the question is not challenging enough for the masses. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If only high rep users are relied on to review difficulty, then we will have introduced another burden to a small group of users. I have faith that 10 below-average users can assign a quality score, even if the individuals themselves would otherwise assign poor scores.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;What Scale Do We Use&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it will ultimately boil down to an subjective description, which have been tried and true for grading the writing portions of standardized tests in the real world. For example, it could look like this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Par 3&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Requires between &amp;lt;x&amp;gt; and &amp;lt;y&amp;gt; minutes of effort to complete. Could be solved by the average college freshman or sophomore. Require a minor amount of knowledge outside of programming, such as Mathematics or Science.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Par 5&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Requires between &amp;lt;x&amp;gt; and &amp;lt;y&amp;gt; hours of effort to complete. Could be solved by the average professional with &amp;lt;z&amp;gt; years of experience.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think the scale should be posted in the Help page. I'm not incredibly familiar with the site, so this may be a poor suggestion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;How Do We Assign Difficulty&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A simple drop down next to a question that I can use to assign a difficulty level to a question would suffice. Perhaps even a question mark next to it with a tooltip that contains the scale. I don't know who has the power to introduce such a widget, so alternatives may be necessary. Right now, we sandpaper question in a sandbox. At the very least, I think we should start assigning difficulty scores there and graduate to a full-blown feature later.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please don't read this post as &quot;high-scores are better&quot;. A Par 3 is pleasant. A Par 5 can be frustrating/tedious but so satisfying. This post is meant to deal with obvious Par 0's and 1's, and leave the Par 2's in the grey area.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="68942" LastEditDate="2021-06-09T05:46:14.433" LastActivityDate="2021-06-09T05:46:14.433" Title="Difficulty Level of Questions" Tags="|discussion|" AnswerCount="0" CommentCount="2" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1250" PostTypeId="2" ParentId="2140" CreationDate="2014-03-11T18:18:42.940" Score="1" Body="&lt;p&gt;Your task, should you choose to accept it, is to convert an image into ASCII art. Essentially, your program has to do precisely what &lt;a href=&quot;http://picascii.com/&quot; rel=&quot;nofollow&quot;&gt;picascii.com&lt;/a&gt; does.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must take the image from stdin or read it from a file specified in the command line.&lt;/li&gt;&#xA;&lt;li&gt;You must output to stdout or to a filename specified in the command line.&lt;/li&gt;&#xA;&lt;li&gt;Your program must take input in a format that &lt;a href=&quot;http://www.imagemagick.org/script/formats.php&quot; rel=&quot;nofollow&quot;&gt;ImageMagick supports&lt;/a&gt;. You can choose any format you want, however. If you want to read &lt;code&gt;ppm&lt;/code&gt; images and we have to pass a jpeg through ImageMagick first to use your program, that's fine. &lt;/li&gt;&#xA;&lt;li&gt;Given the above, your program itself must use only standard libraries, even for loading the image.&lt;/li&gt;&#xA;&lt;li&gt;You must only output printable ASCII characters (that's 32-126 plus CR and LF).&lt;/li&gt;&#xA;&lt;li&gt;You can choose in which font or setting your image should be viewed in, e.g. it might look good in a terminal but awful in a stackexchange code block, or vice versa, or maybe it only looks good with Courier New size 12, etc.&lt;/li&gt;&#xA;&lt;li&gt;The largest edge of your output must be at least 25 characters and at most 200 characters long.&lt;/li&gt;&#xA;&lt;li&gt;Aspect ratio must be preserved as much as possible within one fixed-width character size. e.g. if you have a 400x320 pixel image, and the fixed-width font you're outputting for is 8x13 including spacing, your output must be at least 25x12 characters, or it can be 50x25, 125x62, etc., with a maximum size of 200x98. &lt;/li&gt;&#xA;&lt;li&gt;Provide at least two sample inputs &amp;amp; outputs with your submission. Outputs can be stackexchange code blocks or links to paste bins or screenshots of the output viewed in the environment you intended it for, etc.&lt;/li&gt;&#xA;&lt;li&gt;Your score is the byte count of your source code. Lowest score wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;However, I want the output to bear some reasonable resemblance to the input. I don't want this to be subjective. I'd rather have a hard limit that people can hack around. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Opening suggestion: maybe something like: given a font size of 8x13, if the image is converted to grayscale and quantized to 8x13 blocks, and your solution is converted to an image, scaled to fit, and also quantized to homogeneous 8x13 blocks where the value of each block is the percentage of filled-in pixels for each block, the average distance between the image blocks and your output blocks must be less than &lt;code&gt;X&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="4800" LastEditorDisplayName="user10766" LastEditDate="2014-03-11T20:22:13.653" LastActivityDate="2014-03-11T20:22:13.653" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1252" PostTypeId="1" CreationDate="2014-03-12T00:37:51.963" Score="2" ViewCount="133" Body="&lt;p&gt;I have an awesome idea for King of the Hill, but what if you can't do tests yourself due to time and system constraints. Would providing a test program be enough, or do you have to do the tests yourself?&lt;/p&gt;&#xA;" OwnerUserId="16842" LastActivityDate="2014-03-13T23:13:23.943" Title="For king of the hill, do you need to do tests yourself?" Tags="|discussion|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1253" PostTypeId="2" ParentId="1252" CreationDate="2014-03-12T01:41:54.387" Score="1" Body="&lt;p&gt;If you post it in the sandbox explicitly saying that, someone &lt;em&gt;might&lt;/em&gt; volunteer to test if they're interested enough. You can take them up on the offer if you wish, but remember that if &lt;em&gt;you&lt;/em&gt; post it, it's still &lt;em&gt;your&lt;/em&gt; responsibility to award a winner. If something happens and the volunteer can't do it, you need a backup plan.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I certainly wouldn't expect each user to test themselves. While having a program to test with is fine, they can just report &lt;em&gt;whatever they want&lt;/em&gt;. In fact, according to my tests, I'm undefeated in the &lt;a href=&quot;https://codegolf.stackexchange.com/q/23515/14215&quot;&gt;BattleBots Tournament&lt;/a&gt; right now. Of course, I may or may not have tested against all entries, but my statment remains true. I'm not saying all (or even most) users would outright &lt;em&gt;lie&lt;/em&gt;, but even innocent mistakes could be detrimental to the post in general. Besides, people do crazy things to win at contests, &lt;em&gt;especially&lt;/em&gt; when you don't win much of &lt;em&gt;actual&lt;/em&gt; value from them. Go figure, humans are weird.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bottom line: Unless the testing is done by you or someone you trust, you really have no way of knowing for sure who won. Bickering will ensue, hordes of goblins will descend from the mountainside, and chaos shall reign eternal.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-03-12T01:41:54.387" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1255" PostTypeId="1" AcceptedAnswerId="1256" CreationDate="2014-03-12T07:21:46.430" Score="1" ViewCount="113" Body="&lt;p&gt;I posted a proposed puzzle in the Mark VIII sandbox regarding writing the most efficient algorithm to accomplish a specific task (identify Armstrong Numbers). It was a long question and I have no problem with the idea that it might not yet be ready for posting, but after a few early critical comments (which is fine) it has now languished for about three weeks.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From other meta comments it seems people want higher quality questions for PCG, which I &lt;em&gt;think&lt;/em&gt; mine is. It is detailed and exercises actual useful skills (problem analysis and algorithm development) instead of the more typical &quot;write the shortest program possible which means the winner will need to use a toy language to win&quot; type questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't want to step on toes and post my question prematurely, yet I'm puzzled (HA!) by the lack of positive reaction to my post. There is nothing wrong with code golf, yet the &quot;programming puzzles&quot; part of &quot;programming puzzles &amp;amp; code golf&quot; seems to be actively ignored based on a comment to my proposed question (namely that it didn't fit the code golf format).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I guess my question is: Given how long it has been since my proposal has received feedback, do I just walk away from it, or should I be posting it assuming no further feedback is good news (no news being good news)? Or is there some other lesson I should take away from this?&lt;/p&gt;&#xA;" OwnerUserId="6457" LastActivityDate="2014-03-12T09:29:23.717" Title="What is the procedure for asking a question on PCG?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1256" PostTypeId="2" ParentId="1255" CreationDate="2014-03-12T09:29:23.717" Score="4" Body="&lt;p&gt;There's been a big increase in use of the sandbox, which is good, but the downside is that new sandboxes have been created at a heavy rate and old ones have ceased to attract attention. I would suggest that as a general rule, if you think a question is ready but it seems to be ignored, edit it to say&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;hr&gt;&#xA;  &#xA;  &lt;p&gt;I will post this in 3 days unless there are further requests for clarification.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The action of editing will bump the sandbox.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-03-12T09:29:23.717" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1257" PostTypeId="2" ParentId="2140" CreationDate="2014-03-12T11:38:10.443" Score="0" Body="&lt;p&gt;With its strange choice of 9 different characters (plus space and newline), the ASCII art version of the FreeBSD logo has always looked to me as if it might be nicely formatted, obfuscated code is some programming language. (Is it?)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; ```                        `&#xA;s` `.....---.......--.```   -/&#xA;+o   .--`         /y:`      +.&#xA; yo`:.            :o      `+-&#xA;  y/               -/`   -o/&#xA; .-                  ::/sy+:.&#xA; /                     `--  /&#xA;`:                          :`&#xA;`:                          :`&#xA; /                          /&#xA; .-                        -.&#xA;  --                      -.&#xA;   `:`                  `:`&#xA;     .--             `--.&#xA;        .---.....----.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Therefore I would like to challenge you to make it one: Either specify minimal changes to an existing programming language or minimal changes to this piece of ASCII art (making the artwork look different or significantly changing the character set used are definitely major changes), so that the logo, as source code generates meaningful output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This should be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; challenge, although I wouldn't mind some way of introducing hard scoring and run this as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="15579" LastActivityDate="2014-03-12T11:38:10.443" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1258" PostTypeId="2" ParentId="1252" CreationDate="2014-03-12T16:13:31.530" Score="1" Body="&lt;p&gt;I think if you don't have one central 'authority' doing the scoring runs, then all the contestants are going to have to install all the compilation/execution environments for all their opponents on their machine to check that their bot has a chance. Not everyone is prepared to do that so you might alienate some people who might otherwise compete. &lt;/p&gt;&#xA;" OwnerUserId="737" LastActivityDate="2014-03-12T16:13:31.530" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1260" PostTypeId="1" AcceptedAnswerId="1261" CreationDate="2014-03-13T00:08:43.227" Score="3" ViewCount="251" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/10740/&quot;&gt;This user&lt;/a&gt; likes to copy people's ideas and translate literally into other languages. For example, this post: &lt;a href=&quot;https://codegolf.stackexchange.com/a/23951/9498&quot;&gt;https://codegolf.stackexchange.com/a/23951/9498&lt;/a&gt; from my post: &lt;a href=&quot;https://codegolf.stackexchange.com/a/23822/9498&quot;&gt;https://codegolf.stackexchange.com/a/23822/9498&lt;/a&gt; (note that I golfed mine more after he copied it).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;His code was in TI-83/84 Basic: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input X,Y:ln((e^Y)^ln((e^100^-1)^ln(e^X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Mine was in TI-89 Basic:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input y:Input x:Disp ln((e^y)^ln((e^100^-1)^ln(e^x)))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The important part is identical, except TI-83/84 allows for left off parentheses: &lt;code&gt;ln((e^y)^ln((e^100^-1)^ln(e^x)))&lt;/code&gt; vs &lt;code&gt;ln((e^y)^ln((e^100^-1)^ln(e^x)))&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;According to this user:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/23814/calculate-a-tip/23951?noredirect=1#comment50231_23951&quot;&gt;There was enough difference to claim an answer for myself though&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;What is enough difference?&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-03-13T21:32:50.387" Title="What qualifies as &quot;enough difference&quot; in posting similar answers?" Tags="|discussion|answers|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1261" PostTypeId="2" ParentId="1260" CreationDate="2014-03-13T00:32:04.177" Score="5" Body="&lt;p&gt;In my opinion this is up to the voters to decide. If they think it is copied from other answers, or are very similar, they should cast a downvote.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Side note: I once flagged &lt;a href=&quot;https://codegolf.stackexchange.com/a/21590/12205&quot;&gt;an answer&lt;/a&gt; for moderator attention because it is very similar to &lt;a href=&quot;https://codegolf.stackexchange.com/a/21002/12205&quot;&gt;another answer&lt;/a&gt;, but it was declined, so I wonder what we can do besides downvoting them.&lt;/p&gt;&#xA;" OwnerUserId="12205" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-03-13T00:32:04.177" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1263" PostTypeId="2" ParentId="1260" CreationDate="2014-03-13T01:31:47.110" Score="10" Body="&lt;p&gt;&lt;strong&gt;According to the Terms and Conditions of the site:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since all the content we give to the site is under a cc by-sa 3.0 license, any copyist of this sort has two obligations:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Give proper attribution, and&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Share alike  &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Therefore you are free to yoink their solution as well, golf a few bytes out of it, and claim it as yours once again. Frontier justice!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;According to a Higher Standard:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's debatable whether we can &lt;em&gt;enforce&lt;/em&gt; anything that contravenes the site terms, but we are certainly each free to hold ourselves to a higher standard. There are the rules of the game, and then there is the Olympic spirit. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sportsmanship has never been about legalism. It's about encouraging the best in others by bringing the best of yourself. Tim has reminded me that I, at heart, repudiate the flippant wit of my first answer (seen above) and believe strongly in a spirit of fair play.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have personally abandoned answers I was about to post because I felt I had nothing to offer but a couple of bytes reduced from an approach already submitted in the same language by someone else. That's not required by the rules, but it's required by my own sense of what is right. And I think the majority of the community shares that sense, because I see people frequently commenting to improve one another's answers. Or to ask permission to borrow part of an algorithm for their own answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An interesting thing happens to us as we age. As adults, we adopt a &quot;play to win&quot; mindset, but if you look at many of the games played by children, children often &lt;em&gt;play to continue playing&lt;/em&gt;. No one wins at freeze tag or hide and seek. You simply continue the game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Obviously the individual challenges here on the site have winners, and must do so because the accepted answer is a core principle of Stack Exchange. But beyond each individual game there's the meta-game of the community itself, and you can play that game to win, or you can play to continue playing. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Which, stated another way, is playing to continue the enjoyment of the community instead of merely enhancing your own enjoyment. And I'm glad that style of play is in ample supply here. It may not be universal, but it feels like the prevailing spirit.&lt;/p&gt;&#xA;" OwnerUserId="3363" LastEditorUserId="3363" LastEditDate="2014-03-13T21:32:50.387" LastActivityDate="2014-03-13T21:32:50.387" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1264" PostTypeId="1" CreationDate="2014-03-13T05:45:28.177" Score="10" ViewCount="177" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/tour&quot;&gt;introductory tour&lt;/a&gt; to the site has a bunch of inaccurate description copied from the standard template. Among the oddities are&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Focus on questions about an &lt;strong&gt;actual problem&lt;/strong&gt; you have faced.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;We're not supposed to do that here. Code golf may have been an actual problem people faced back in the days when programs would take a substantial amount of a computer's memory, but the majority of modern software developers have probably never faced such a situation.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Avoid questions that are &lt;strong&gt;primarily opinion-based&lt;/strong&gt;, or that are likely to &lt;strong&gt;generate discussion&lt;/strong&gt; rather than answers.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There are 172 questions tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;. It's the 4th-most common tag. &quot;Primarily opinion-based&quot; is just fine.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Remember: we're all here to learn, so be friendly and helpful!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;While we should be friendly and helpful, and learning is nice, we're here to solve puzzles, usually but not always by writing very short computer programs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this just because we're in beta? Or are those parts of the template very difficult to change? Or do people just not care about that page?&lt;/p&gt;&#xA;" OwnerUserId="12647" LastEditorUserId="68942" LastEditDate="2021-06-09T05:51:13.107" LastActivityDate="2021-06-09T05:51:13.107" Title="Inaccurate tour" Tags="|discussion|feature-request|help-center|" AnswerCount="1" CommentCount="4" ClosedDate="2021-06-03T00:01:27.493" ContentLicense="CC BY-SA 3.0" />
  <row Id="1266" PostTypeId="2" ParentId="1264" CreationDate="2014-03-13T09:38:24.270" Score="3" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;on-topic&lt;/a&gt; page is the only one of the general help pages which is per-site customisable. The rest is StackExchange boilerplate.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Avoid questions that are primarily opinion-based, or that are likely to generate discussion rather than answers.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;  &#xA;  &lt;p&gt;There are 172 questions tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;. It's the 4th-most common tag. &quot;Primarily opinion-based&quot; is just fine.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Popularity contests used to be banned; they got a foothold because the moderators decided to stop enforcing that rule in the hope of increasing activity. I am of the opinion, and I don't think I'm the only one, that the average quality of those questions is notably lower than for questions which have an truly objective winning criterion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And even so, &quot;primarily opinion-based&quot; is occasionally used as a close reason. A question has a specification (i.e. criteria for an answer to be relevant) and a winning criterion which distinguishes between answers meeting the spec. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; is a &lt;em&gt;winning&lt;/em&gt; criterion: if the issue of whether or not an answer &lt;em&gt;meets the spec&lt;/em&gt; is going to be subjective then it is the appropriate close reason. See e.g. &lt;strike&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/23381/194&quot;&gt;Schrödingbug&lt;/a&gt;&lt;/strike&gt; (currently only visible to users with enough rep to see deleted questions).&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-04-13T21:30:14.097" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1269" PostTypeId="2" ParentId="2140" CreationDate="2014-03-13T22:30:46.847" Score="0" Body="&lt;h2&gt;King of the Hill Fighting&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this game, a player controls 5 bots that attack the other players 5 bots.&#xA;Each bot has life points, and has to reduce the other playres lifepoints to zero.&#xA;This post is program that tests the controllers. It is in literate haskell.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; import Data.Set as S&#xA;&amp;gt; import Data.Map as M&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here is the arena:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;    D---G&#xA;   /|   |\&#xA;  B |   | J&#xA; /|\|   |/|\&#xA;A | E---H | L&#xA; \|/|   |\|/&#xA;  C |   | K&#xA;   \|   |/&#xA;    F---I&#xA;20  12    4&#xA;  16    8   0&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Positions are denoted by letters&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; data Positions = A | B | C | D | E | F | G | H | I | J | K | L deriving (Show, Read, Eq, Ord)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Each player is presented a map in which their side is the one with A.&#xA;Here is code that will reflect it so each player sees their own view.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; pairFlip = (\(x, y)-&amp;gt;[(x,y), (y,x)])&#xA;&amp;gt; reflect = M.fromList $ [(A,L), (B,J), (D,G), (C, K), (E, H), (F, I)] &amp;gt;&amp;gt;= pairFlip&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Lines denote connections.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; connections=S.fromList $&#xA;&amp;gt;   [(A,B), (A,C), (B,D), (C, F), (E, D), (E, F), (D, G), (E, H), (F, I)]&#xA;&amp;gt;   &amp;gt;&amp;gt;= pairFlip&#xA;&amp;gt;   &amp;gt;&amp;gt;= (\(x,y)-&amp;gt;[(x,y), (reflect ! x, reflect ! y)])&#xA;&amp;gt; &#xA;&amp;gt; connected x y=(x, y) `S.member` connections&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The numbers below are the number of life points of generation that each bot.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; regen = M.fromList $&#xA;&amp;gt;   [ (A, 20), (B, 16), (C, 16), (D, 12), (E, 12), (F, 12)&#xA;&amp;gt;   , (G, 8), (H, 8), (I, 8), (J, 4), (K, 4), (L, 0)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="16842" LastActivityDate="2014-03-13T22:30:46.847" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1270" PostTypeId="2" ParentId="1252" CreationDate="2014-03-13T23:13:23.943" Score="0" Body="&lt;p&gt;I agree with Gareth that ultimately &lt;em&gt;someone&lt;/em&gt; has to take on the burden of installing all the necessary build environments and running the tests, or else in the absence of someone it becomes everyone.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The idea of providing some incentive to someone to volunteer to host a KotH contest is nice in theory, but I wonder in practice how many willing volunteers would not simply busy themselves with hosting KotH contests they dreamed up themselves?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is another way: create KotH contests structured around existing test beds. The Internet is full of game servers that accept bots for play. I know that Go and Backgammon are definitely options as I've played against bots on KGS and FIBS, and there are bound to be many others. There's obviously a trust aspect any time you enable a user to participate in their own testing, as Geobits said, and I am sure you'd get someone running a top-rated bot program not of their own making now and then. But with the proper limitations (e.g. Best Go bot in 200 tokens of atomic code golf) it could be made pretty obvious that someone was cheating.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The upside here is that most of these servers come with built-in rating systems, so the contest management becomes something as simple as tracking and reporting the bots' elo ratings during the contest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Having given this fine suggestion, I do join Geobits in suggesting that you give some thought to dmckee's comment. The overhead to manage one of these contests is probably not as great as you imagine. Even if you are paranoid about foreign code on your system, virtual machines plus package managers like apt &amp;amp; homebrew make setting up an environment not too big a headache, and you can easily blitz it all when you're done.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think I just talked myself into hosting one myself soon.  :)&lt;/p&gt;&#xA;" OwnerUserId="3363" LastActivityDate="2014-03-13T23:13:23.943" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1271" PostTypeId="2" ParentId="2140" CreationDate="2014-03-14T02:37:35.913" Score="0" Body="&lt;h1&gt;music theory challenge&lt;/h1&gt;&#xA;&lt;p&gt;Create a program that takes some input in the form of frequency, waveform, and duration that generates an audio stream based on the input.&lt;/p&gt;&#xA;&lt;p&gt;You can take input parameters however you choose, but if I input (translated to your method) 440Hz, sin(x), 3 seconds,  your program should play or create a file for a sound 3 seconds long at 440 hertz on a sine wave.&lt;/p&gt;&#xA;&lt;p&gt;Also, any output should be musically correct as far as frequency is concerned.  See&#xA;&lt;a href=&quot;http://www.phy.mtu.edu/%7Esuits/notefreqs.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.phy.mtu.edu/~suits/notefreqs.html&lt;/a&gt; for example frequencies&lt;/p&gt;&#xA;&lt;p&gt;Since this is a popularity contest, the rest is up to you.  I bid you Good programming!&lt;/p&gt;&#xA;&lt;p&gt;Oh, and any use of external functions or APIs is ok, as long as they weren't developed specifically for this contest.&lt;/p&gt;&#xA;" OwnerUserId="17006" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-03-14T12:45:08.723" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1272" PostTypeId="2" ParentId="2140" CreationDate="2014-03-14T12:02:53.147" Score="0" Body="&lt;h1&gt;Create the perfect CSS reset stylesheet&lt;/h1&gt;&#xA;&lt;p&gt;Your job is to create a CSS reset stylesheet, That is, a stylesheet that you can apply to any HTML file, and the result will look the same in all webbrowsers. Because we all know that cross-browser interoperability is very important these days, and you want to make your website look pixel perfect everywhere.&lt;/p&gt;&#xA;&lt;p&gt;The rules:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You must be able to throw any valid HTML5 document at it and the result will look the same in the main browsers.&lt;br /&gt;&#xA;For simplicity, you can assume that the HTML document does not contain any styles of its own or Javascript that changes anything. Just pure, static HTML that is valid HTML5.&lt;/li&gt;&#xA;&lt;li&gt;The main browsers are Firefox &amp;gt;= 22, Chrome &amp;gt;= 28 and IE &amp;gt;= 10.&lt;/li&gt;&#xA;&lt;li&gt;To avoid solutions like &lt;code&gt;*{display:none}&lt;/code&gt; (which do indeed make all documents look the same in all browsers, yes) the result must be identical to the document without the stylesheet in one of the browsers.&lt;br /&gt;&#xA;In other words, take your browser of choice and make the document look like that in the other browsers.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The winner is the stylesheet that works the best, again, on any HTML file that is valid HTML5 and uses no other styles. I'm not looking at efficiency. If you come up with a 100K stylesheet or one that slows the site down considerably, that doesn't matter, as long as the end result looks good.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;That's the question so far. Now I have a bit of a problem with &amp;quot;any HTML5 document&amp;quot;; I know I could provide a test document that people can work with, but then you'll get answers that cater to only that particular test case, and that's not what I want. Not sure how to handle this. Ideas?&lt;br /&gt;&#xA;Also, I want to include Safari as a main browsers, but as I don't have a Mac, I can't test the results on it. Not sure how to handle that.&lt;/p&gt;&#xA;" OwnerUserId="4208" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-03-14T12:02:53.147" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1273" PostTypeId="1" CreationDate="2014-03-14T13:00:31.447" Score="10" ViewCount="331" Body="&lt;p&gt;Our community FAQ is currently.... quite lacking.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Tf4Wi.png&quot; alt=&quot;screenshot&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first two are okay, but the third one isn't even supposed to have the &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq&lt;/a&gt; tag (mods: please remove it).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, let's start building our FAQ!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's a few things we could start with off the top of my head:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/3808&quot;&gt;Standard &quot;loopholes&quot; that are no longer funny&lt;/a&gt; (I've went ahead and tagged this &lt;a href=&quot;/questions/tagged/faq-proposed&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;faq-proposed&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq-proposed&lt;/a&gt; to get things started)&lt;/li&gt;&#xA;&lt;li&gt;A post mentioning that code golfs should usually be language-agnostic (any programming language allowed)&lt;/li&gt;&#xA;&lt;li&gt;What format should the answers be in? (Language and score on a header, then code block and preferrably explanation below)&lt;/li&gt;&#xA;&lt;li&gt;A general sandbox post that explains about the sandbox and links to the latest version. This would be good because 1. It would be less work to switch sandboxes and 2. All that sandbox boilerplate could go away. Also, 3. Old sandbox links would still work and not require tons of clicking to find the latest one.&lt;/li&gt;&#xA;&lt;li&gt;etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-06-11T01:14:01.877" Title="Let's build a community FAQ" Tags="|discussion|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1274" PostTypeId="2" ParentId="2140" CreationDate="2014-03-14T18:50:40.247" Score="0" Body="&lt;h2&gt;Calculate pi using a unique method&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to calculate or approximate pi using the most interesting method you know. Well-known things such as using inverse trig functions (asin, acos, atan) or commonly used convergent series are considered uninteresting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may calculate pi to any precision desired, but the more precision you can achieve, the better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pi&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pi&amp;#39;&quot; rel=&quot;tag&quot;&gt;pi&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="6788" LastEditorUserId="6788" LastEditDate="2014-03-14T20:10:35.863" LastActivityDate="2014-03-14T20:10:35.863" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1275" PostTypeId="1" CreationDate="2014-03-15T15:44:22.593" Score="3" ViewCount="56" Body="&lt;p&gt;I was wandering if you want to know the activities of a specific question which is not yours (like &amp;lt; xyz&gt; did a comment and &amp;lt; abc&gt; gave an answer) there should be a button like &lt;code&gt;send you updates of this question ?&lt;/code&gt; which sends updates of your chosen &lt;strong&gt;question&lt;/strong&gt; and &lt;strong&gt;answer&lt;/strong&gt;.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;EDIT&lt;/strong&gt; : I wanted to get updates in user's inbox !&lt;/p&gt;&#xA;" OwnerUserId="17120" LastEditorUserId="68942" LastEditDate="2021-06-02T23:33:34.157" LastActivityDate="2021-06-02T23:33:34.157" Title="An update button?" Tags="|feature-request|status-completed|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1276" PostTypeId="1" AcceptedAnswerId="1277" CreationDate="2014-03-15T17:30:36.787" Score="1" ViewCount="84" Body="&lt;p&gt;I flagged two comments on &lt;a href=&quot;https://codegolf.stackexchange.com/q/12673/9275&quot;&gt;this question&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Is it code-golf? If so, tag it. If not, define the winning criteria.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;And the second flagged comment:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;@ugoren sorry not sure where to draw the line, i want shortest within the criteria, is that challenge or golf? &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;And I flagged them as &quot;obsolete&quot;, because they are obsolete: the question is tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; now, so it has an objective winning criteria now.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, why are these flags declined?&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-03-15T17:37:20.223" Title="Why are my comment flags declined?" Tags="|discussion|flags|comments|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1277" PostTypeId="2" ParentId="1276" CreationDate="2014-03-15T17:37:20.223" Score="3" Body="&lt;p&gt;I declined your flags.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My usual criterion for deciding whether to delete comments is to see whether removing them would leave other &quot;orphan&quot; comments that make no sense without the comments in question. If in doubt, I usually err on the side of retention.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-03-15T17:37:20.223" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1278" PostTypeId="2" ParentId="1275" CreationDate="2014-03-15T21:34:59.747" Score="1" Body="&lt;p&gt;Every question has its own &lt;a href=&quot;http://en.wikipedia.org/wiki/Atom_%28standard%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;Atom feed&lt;/a&gt;. Look for a link called &quot;question feed&quot; down there ↘ somewhere. If you have a newsreader like Apple Mail, you can subscribe to this feed with a simple drag &amp;amp; drop operation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/feeds/question/1275&quot;&gt;here's the feed for this question&lt;/a&gt;. See if you can get your computer to do something useful with it.&lt;/p&gt;&#xA;" OwnerUserId="11006" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.313" LastActivityDate="2014-03-15T21:34:59.747" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1279" PostTypeId="2" ParentId="2140" CreationDate="2014-03-16T01:30:42.420" Score="6" Body="&lt;h1&gt;Do-nothing Polyglot&lt;/h1&gt;&#xA;&lt;p&gt;This challenge requires you to write a polyglot which contains a comment in as many languages as possible.&lt;/p&gt;&#xA;&lt;p&gt;The comment must say &lt;code&gt;This is a polyglot comment&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The program must do nothing at all.&lt;/p&gt;&#xA;&lt;p&gt;Besides comments, your code may contain no-ops from the language(s) you are using, if it helps incorporate more languages into your answers.  For example in &lt;code&gt;bash&lt;/code&gt; we could use &lt;code&gt;:&lt;/code&gt;.  Or in the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c&amp;#39;&quot; rel=&quot;tag&quot;&gt;c&lt;/a&gt; family, something like the following may be used, as long as it compiles:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;if (0) {&#xA;    statements with side effects&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Since this is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt; challenge, the answer with the most languages wins, so I think this should also be tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-03-16T01:30:42.420" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1280" PostTypeId="1" CreationDate="2014-03-16T05:31:06.820" Score="29" ViewCount="2713" Body="&lt;h1&gt;Community FAQ&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;For the Code Golf and Coding Challenges site&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;For official guidance from Stack Exchange, visit the &lt;a href=&quot;https://codegolf.stackexchange.com/help&quot;&gt;Help Center&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;General information&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/20861/66833&quot;&gt;Welcome to Code Golf and Coding Challenges Stack Exchange!&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/13944/66833&quot;&gt;How does this site work?&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10351/66833&quot;&gt;Useful External Resources&lt;/a&gt; &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Posting Challenges&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/93&quot;&gt;What details should always be given for a code golf task?&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/305&quot;&gt;What makes winning criteria &amp;quot;objective&amp;quot;?&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1511&quot;&gt;Template For Challenges&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1555&quot;&gt;Where should non-challenge questions go?&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2056&quot;&gt;How does the Sandbox work? How do I use it?&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5582&quot;&gt;Things to consider when creating a challenge&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8047&quot;&gt;Things to avoid when writing challenges&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1723&quot;&gt;Let&amp;#39;s decide what kind of non-challenge questions we want once and for all&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/777&quot;&gt;Are two questions duplicates if they have different scoring rules?&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2035&quot;&gt;How long should I wait before accepting an answer?&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/22371&quot;&gt;What are the winning criteria I can use for my challenge?&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1324&quot;&gt;Standard definitions of terms within specifications&lt;/a&gt; &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Posting Solutions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061&quot;&gt;Loopholes that are forbidden by default&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10145&quot;&gt;How to count bytes FAQ&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2190&quot;&gt;Interpretation of Truthy/Falsey&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7987&quot;&gt;Definitive policy about answers not meeting the challenge specification&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447&quot;&gt;Default for Code Golf: Input/Output methods&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2419&quot;&gt;Default for Code Golf: Program, Function or Snippet?&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11924&quot;&gt;New users&amp;#39; guides to golfing rules in specific languages&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/4780&quot;&gt;Should submissions be allowed to exit with an error?&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10225&quot;&gt;General rules for custom languages and libraries&lt;/a&gt; &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Interacting with the site&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12537&quot;&gt;What are our specific abbreviations and terms?&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10184&quot;&gt;Is it OK to promote my own posts in chat?&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1301&quot;&gt;How can I incorporate good-looking mathematical exposition into my question/answer?&lt;/a&gt; &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Is your question not part of the FAQ?&lt;/h2&gt;&#xA;&lt;p&gt;First look at questions tagged &lt;a href=&quot;/questions/tagged/faq-proposed&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;faq-proposed&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;faq-proposed&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-faq-proposed-tooltip-container&quot;&gt;faq-proposed&lt;/a&gt; to see if there is a question not in this index that might have the answer you seek. If you still can't find an answer, then see the following instructions for proposing an FAQ question.&lt;/p&gt;&#xA;&lt;h3&gt;How can a question be added to this FAQ?&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Ask only the question, stated plainly and simply, in the question body.&#xA;The answer goes in an answer.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Link back&lt;/strong&gt; to this index. Paste this at the end of the question:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; [Return to FAQ index](https://codegolf.meta.stackexchange.com/q/1280)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Tag as &lt;a href=&quot;/questions/tagged/faq-proposed&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;faq-proposed&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;faq-proposed&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-faq-proposed-tooltip-container&quot;&gt;faq-proposed&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/support&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-support-tooltip-container&quot;&gt;support&lt;/a&gt;.  When a post seems&#xA;to hit a mature state, it will have &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-faq-tooltip-container&quot;&gt;faq&lt;/a&gt; added by a moderator.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Flag for a moderator to mark &lt;strong&gt;community wiki&lt;/strong&gt;.  Any FAQ post not yet&#xA;community wiki should be made into a community wiki.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;After the post has the &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-faq-tooltip-container&quot;&gt;faq&lt;/a&gt; tag added to it, add a link in the above &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1280&quot;&gt;table of contents&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="108687" LastEditDate="2023-04-03T02:10:48.620" LastActivityDate="2023-04-03T02:10:48.620" Title="Community FAQ for Code Golf and Coding Challenges" Tags="|support|faq|" AnswerCount="0" CommentCount="8" CommunityOwnedDate="2014-03-18T00:34:04.397" ContentLicense="CC BY-SA 4.0" />
  <row Id="1281" PostTypeId="1" AcceptedAnswerId="12762" CreationDate="2014-03-16T10:03:08.567" Score="10" ViewCount="332" Body="&lt;p&gt;There is this question:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/564/should-we-consider-dropping-or-modifying-the-objective-winning-criteria-requir&quot;&gt;Should we consider dropping or modifying the &amp;quot;objective winning criteria&amp;quot; requirement?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Instead, think it is better to make the winning criteria tags:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/busy-beaver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;busy-beaver&amp;#39;&quot; rel=&quot;tag&quot;&gt;busy-beaver&lt;/a&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-shuffleboard&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-shuffleboard&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-shuffleboard&lt;/a&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle&lt;/a&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/all-the-other-winning-criteria-tags&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;all-the-other-winning-criteria-tags&amp;#39;&quot; rel=&quot;tag&quot;&gt;all-the-other-winning-criteria-tags&lt;/a&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;obligatory, like here in meta you have to choose one of the four: &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;/questions/tagged/discussion&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt; &lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt; &lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt; &lt;a href=&quot;/questions/tagged/support&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I also think that only some of the above mentioned tags can be used in tandem such that you can't choose code-golf with popularity-contest etc...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Doing this is better than what is currently done:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Ask question (no criteria) -&gt; VTC -&gt; edit to add critera -&gt; reopen.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Also this would be more welcoming to new users who aren't familiar with such tags, reading the excerpt of these obligatory tags might give them sense of what is this site about.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What do you think?&lt;/p&gt;&#xA;" OwnerUserId="12291" LastEditorUserId="68942" LastEditDate="2021-06-09T05:43:20.210" LastActivityDate="2021-06-09T05:43:20.210" Title="Make the criteria tags obligatory" Tags="|feature-request|status-declined|tags|asking-questions|winning-criteria|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1282" PostTypeId="2" ParentId="2140" CreationDate="2014-03-16T22:11:54.860" Score="2" Body="&lt;h2&gt;Amino Acids Matcher&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In genetics, a codon is a set of three nucleotides, the most basic form of nucleic acids. A codon &quot;codes&quot; (no pun intended, that's the actual term used) for a specific amino acid. Given a string of DNA, it is converted into RNA form by taking the opposite complementary pair.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;DNA    RNA&#xA;A      U (T changes to U)&#xA;T      A&#xA;C      G&#xA;G      C&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You will be given a String of unknown length that contains multiple codons. You must convert them to RNA form and print out the amino acid for each. See here for a chart: &lt;a href=&quot;http://en.wikipedia.org/wiki/RNA_codon_table#RNA_codon_table&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://en.wikipedia.org/wiki/RNA_codon_table#RNA_codon_table&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sample Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;TACTCGGATACT&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is split into&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;TAC&lt;/code&gt;, &lt;code&gt;TCG&lt;/code&gt;, &lt;code&gt;GAT&lt;/code&gt;, &lt;code&gt;ACT&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We now change each letter to its reciprocal&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;AUG&lt;/code&gt;, &lt;code&gt;AGC&lt;/code&gt;, &lt;code&gt;CUA&lt;/code&gt;, &lt;code&gt;UGA&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And print out the amino acids&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Methionine, Serine, Leucine, Stop&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This would probably be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I know that this is most likely not sufficiently explained and might be too complicated. Additional, tell me if there is any incorrect information above.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="18340" LastEditorDisplayName="user10766" LastEditDate="2014-03-19T19:04:58.000" LastActivityDate="2014-03-19T19:04:58.000" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1284" PostTypeId="2" ParentId="292" CreationDate="2014-03-17T15:31:19.923" Score="7" Body="&lt;p&gt;Although I don't think MathJax is necessary for codegolf.SE (in contrast to math.SE), I think it would be neat to have it. So I've checked some questions / answers to see how MathJax would be used on this site:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Easy indexing / exponentiation by &lt;code&gt;$A_i$&lt;/code&gt; instead of &lt;code&gt;A&amp;lt;sub&amp;gt;i&amp;lt;/sub&amp;gt;&lt;/code&gt; (&lt;a href=&quot;https://codegolf.stackexchange.com/q/24316/5240&quot;&gt;example&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Symbols for number sets (&lt;code&gt;\mathbb{N}&lt;/code&gt; and &lt;code&gt;\mathbb{R}&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Nicer Big-O notation (&lt;code&gt;\mathcal{O}(n^2)&lt;/code&gt; instead of &lt;code&gt;O(n^2)&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;\cdot&lt;/code&gt; instead of &lt;code&gt;*&lt;/code&gt; (&lt;a href=&quot;https://codegolf.stackexchange.com/a/4764/5240&quot;&gt;example&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Nicer variables (It's easier to recognize &lt;code&gt;$n$&lt;/code&gt; as a variable than &lt;code&gt;n&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;A way around that can be used by single people who want to have this in their answer is including images &lt;a href=&quot;https://codegolf.stackexchange.com/a/9088/5240&quot;&gt;like this answer does&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;codegolf.SE could also generate images for formulas instead of loading MathJax. But this might cause other problems. Here is how it can be done (&lt;a href=&quot;https://tex.stackexchange.com/q/34054/5645&quot;&gt;link&lt;/a&gt;).&lt;/p&gt;&#xA;" OwnerUserId="5240" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2014-03-17T15:31:19.923" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1285" PostTypeId="2" ParentId="292" CreationDate="2014-03-17T17:29:49.147" Score="1" Body="&lt;p&gt;While &lt;strong&gt;Latex&lt;/strong&gt; is nice for viewing math, if the math is not essential to the site, it is a big problem. On Mathematics.se, it can take a while before the raw Latex is converted to what I see, especially on a slow computer. Oftentimes on a slow computer, the computer freezes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an alternative, I recommend copying the html symbols from this: &lt;a href=&quot;http://en.wikipedia.org/wiki/Table_of_mathematical_symbols&quot; rel=&quot;nofollow&quot;&gt;http://en.wikipedia.org/wiki/Table_of_mathematical_symbols&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is what I have done in my posts when I want mathematical symbols; I even compiled a list of symbols into my profile for easy access.&lt;/p&gt;&#xA;" OwnerUserId="9498" LastActivityDate="2014-03-17T17:29:49.147" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1286" PostTypeId="1" CreationDate="2014-03-17T17:39:28.190" Score="2" ViewCount="51" Body="&lt;p&gt;The &lt;a href=&quot;/questions/tagged/flags&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;flags&amp;#39;&quot; rel=&quot;tag&quot;&gt;flags&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/flagging&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;flagging&amp;#39;&quot; rel=&quot;tag&quot;&gt;flagging&lt;/a&gt; tags on Meta actually have the same purpose: for questions about flagging.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Could someone synonymize them?&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="68942" LastEditDate="2021-06-05T23:17:44.600" LastActivityDate="2021-06-05T23:17:44.600" Title="Synonymize [flags] and [flagging] on Meta" Tags="|feature-request|status-completed|meta|tag-synonyms|synonym-request|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1287" PostTypeId="2" ParentId="1273" CreationDate="2014-03-17T19:53:11.593" Score="1" Body="&lt;p&gt;I am thinking it would be a good idea to have an FAQ Sandbox. Given the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1280/community-faq-for-programming-puzzles-code-golf&quot;&gt;sentiment against FAQs being easy to edit&lt;/a&gt; it makes sense to have a place to whip the question and proposed answer into shape.&lt;/p&gt;&#xA;" OwnerUserId="3363" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2014-03-17T19:53:11.593" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1288" PostTypeId="1" CreationDate="2014-03-17T23:06:25.520" Score="22" ViewCount="801" Body="&lt;p&gt;Our site needs unique content. The more different and new a question is, the more interesting it will probably be. Therefore, let's propose new genres of challenges!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What exactly is a challenge genre? It's &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/908/3808&quot;&gt;one of these&lt;/a&gt;. The most commonly used ones are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;. Let's create some new ones! Here are some guidelines to follow in these challenge genres:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Make it non-opinion-based. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; is nice, but it's kind of stretching it. Given a list of all of the submissions, you should be able to objectively choose which answer is the winner.&lt;/li&gt;&#xA;&lt;li&gt;Don't be boring. This should go without saying, but a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf-using-fractions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf-using-fractions&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf-using-fractions&lt;/a&gt; genre would not be unique and interesting enough.&lt;/li&gt;&#xA;&lt;li&gt;Try to attract quality over quantity. One of the main reasons that I'm against &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; is that it naturally attracts many mediocre answers, not a few high-quality ones.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;To propose a genre, ask a question here on meta with the &lt;a href=&quot;/questions/tagged/new-genre&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;new-genre&amp;#39;&quot; rel=&quot;tag&quot;&gt;new-genre&lt;/a&gt; tag. Once a genre has reasonable support, it's time to post a question using that genre in the sandbox. Then, once that question is posted on the main site, the newly created tag can be used on a regular basis!&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2014-07-09T02:46:52.403" Title="Let's create some new types of challenges!" Tags="|discussion|" AnswerCount="12" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="1289" PostTypeId="2" ParentId="1288" CreationDate="2014-03-18T15:55:31.793" Score="4" Body="&lt;h2&gt;Feature Creep&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a proposed better way to implement multi-feature challenges that often have a ridiculously intricate set of minus-bytes bonuses that, in the end, just end up favoring the terser languages anyway.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Instead, the premise of the tag is simply:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Whoever implements the most features enumerated in the spec is the winner&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am thinking of doing my &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1118/3363&quot;&gt;Human Genome&lt;/a&gt; challenge as a test case for this, to see how it goes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My thinking is to have shortest code as the tiebreaker for these challenges, but also that ideally they should clearly define enough features that ties will be unlikely.&lt;/p&gt;&#xA;" OwnerUserId="3363" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2014-03-18T15:55:31.793" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1290" PostTypeId="2" ParentId="1288" CreationDate="2014-03-18T17:43:12.217" Score="-1" Body="&lt;p&gt;This is sure to conflict with some of the veteran users here, but I need to say this, and it wouldn't fit in a comment.&lt;/p&gt;&#xA;&lt;h1&gt;Problem 1&lt;/h1&gt;&#xA;&lt;p&gt;The introduction of tags is something that has already been &lt;a href=&quot;https://ell.stackexchange.com/help/privileges/create-tags&quot;&gt;standardized across Stack Exchange&lt;/a&gt;. It is a privilege granted to users with sufficient reputation. This proposed sandbox flies in the face of such a privilege. The reasoning behind such a feature being implemented is due to an elitist attitude of &lt;em&gt;&amp;quot;we are different than other sites&amp;quot;&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;We &lt;em&gt;are&lt;/em&gt; different, but it doesn't apply to &lt;em&gt;everything&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This proposed sandbox will allow brand new users to suggest new tags and discourage high rep users from creating new tags.&lt;/p&gt;&#xA;&lt;h1&gt;Problem 2&lt;/h1&gt;&#xA;&lt;p&gt;Someone now has to maintain not one, but TWO sandboxes. If the site becomes popular, both sandboxes will potentially break due to having too many answers per sandbox and not enough people willing to actually review all of them. This breaks Stack Exchange's &amp;quot;crowd-source&amp;quot; style of moderation. Questions are moderated at the time of being posted, and errors are fixed. Users here have an elitist attitude that questions must be near-perfect at post-time or be closed immediately.&lt;/p&gt;&#xA;&lt;p&gt;You might ask - Why do I think there will not be enough users to review all of the sandbox posts on a high-usage site? We have no problem with it now! The answer is simple. No reputation is gained from perusing sandbox posts. It only works now because a select few religiously check it, some subscribe to it, and others clamor for attention in the chat. Also, we currently only have to create a new sandbox every few days (or weeks). That will change on a high-usage site.&lt;/p&gt;&#xA;&lt;p&gt;The overhead of posting near-perfect questions is not worth the benefits gained. Crowd-sourced moderation breaks unless everyone begins reviewing the sandbox. We have no way to reward users for reviewing the sandbox, and so it will break. In fact, I have already seen questions go multiple sandboxes without very little attention. It's already breaking!&lt;/p&gt;&#xA;&lt;h1&gt;Conclusion&lt;/h1&gt;&#xA;&lt;p&gt;Lose the &lt;em&gt;&amp;quot;We are different in every way&amp;quot;&lt;/em&gt; attitude. We are different because we ask questions about topics that we may not have actually faced, and we use scoring mechanisms that we created. In all other areas, apply the &lt;em&gt;&amp;quot;We are different&amp;quot;&lt;/em&gt; or &lt;em&gt;&amp;quot;This doesn't apply to us&amp;quot;&lt;/em&gt; labels with &lt;strong&gt;caution&lt;/strong&gt;.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-03-18T17:43:12.217" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="1292" PostTypeId="1" CreationDate="2014-03-18T20:57:18.903" Score="5" ViewCount="185" Body="&lt;p&gt;The general consensus from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1103/should-users-edit-rules-or-just-suggest-them&quot;&gt;this prior discussion&lt;/a&gt; was that &lt;strong&gt;editing questions is the StackExchange way, and if it makes the question better then go for it.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is perfectly in sync with my own experience reviewing questions on other SE sites. If I think I understand the thrust of the questioner's intent and I see a way to express it more clearly, I simply go ahead and edit. The net result is the community gets a better-phrased question and OP has a better chance of connecting with a good answer instead of the question being closed for whatever deficiencies it possesses.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That contrasts noticeably with this site, where &lt;strong&gt;the theory we seem to support as a community in the above thread differs from the practice.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The standard response to an under-specified question includes: comments calling out its deficiencies, downvotes, and flagging for close votes. When I see question edits in the edit queue, they are usually merely cosmetic spelling/grammar corrections. When I myself &lt;em&gt;make&lt;/em&gt; question edits, they are often the same kind of surface-level polishing, because the standard community &lt;em&gt;practice&lt;/em&gt; appears to be to lay back and let the questioner &quot;own&quot; their question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Are we being too shy about editing other people's questions?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;A few exemplary posts, but don't focus too much on the trees - this question is about the forest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/24271/a-golfed-golfing-game&quot;&gt;Peter and I both saw easily-remedied issues here. Why not just edit?&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/24300/arranging-pins-on-a-microchip&quot;&gt;Several people saw problems here, none of them hard to fix by simply adding detail to the spec&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/24134/create-a-simple-2048-game-clone&quot;&gt;s/merge/move - easy and obvious...Just do it!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A notable counterexample: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/24401/so-obviously-p-np&quot;&gt;This question&lt;/a&gt; would have been tough to fix by editing intervention, because OP's original question was so broad that picking a specific NP problem to focus it on would have been throwing darts at OP's intent. However, as opposed to just saying &quot;Be more clear&quot;, I gave a specific example of &lt;em&gt;how&lt;/em&gt; to clarify and OP went with it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In contrast, if &lt;em&gt;all&lt;/em&gt; you say is &quot;Be more clear&quot;, or you refrain from saying &quot;No amount of clarity will fix this&quot; when you personally think so, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/24462/display-the-explosion-of-a-star-in-ascii-art&quot;&gt;this happens&lt;/a&gt;. &#xA;Or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/24353/make-two-programs-communicate-with-each-other&quot;&gt;this happens&lt;/a&gt;, and I am the offending person here. Question closed, question reopened, and because no real input was given but my &quot;Be more specific&quot;, little changed in the interim.&lt;/p&gt;&#xA;" OwnerUserId="3363" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-03-18T23:51:00.310" Title="Are we too shy about editing questions to make them better?" Tags="|discussion|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1293" PostTypeId="2" ParentId="1292" CreationDate="2014-03-18T20:57:18.903" Score="3" Body="&lt;p&gt;&lt;strong&gt;I have come to believe that this practice is bad for the site and creates a bad experience for new questioners.&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider the questioner's point of view: he/she wants to see the challenge go forward. Isn't that more likely if we take direct action instead of waiting for the questioner to do something about it? How often is someone &lt;em&gt;really&lt;/em&gt; going to object to an edit that makes the question more successful?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider it also from the StackExchange point of view: as soon as the question is posed, it is &lt;em&gt;not&lt;/em&gt; &quot;owned&quot; by the questioner. The FAQ is unambiguous on this point: &lt;a href=&quot;https://codegolf.stackexchange.com/help/editing&quot;&gt;&quot;If you are not comfortable with the idea of your contributions being collaboratively edited by other trusted users, this may not be the site for you.&quot;&lt;/a&gt; The questioner has an important role to play in accepting an answer, but that content belongs to the community the moment it is released. If the questioner feels that the editing has over-reached, he/she can do a rollback.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One of the core values of StackExchange is &lt;em&gt;collaborative&lt;/em&gt; editing, but it is often feeling more adversarial than collaborative here (and I admit I have been drawn into that mindset myself), and I think that undermines our ability to foster a healthy community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think we can actually serve newcomers (and old timers who may post a rare poorly-written question after one too many pints) better if we stop tiptoeing around their questions and dive in to spin the straw into gold. Not every question will be salvageable, but many will be.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fundamentally, I think there is a belief that will support the improvement of quality, participation, and a sense of community around here, and that belief is what I am here to endorse:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;We, as a community, have ownership of every post on the site, however good or bad.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="3363" LastActivityDate="2014-03-18T20:57:18.903" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1294" PostTypeId="2" ParentId="1292" CreationDate="2014-03-18T23:51:00.310" Score="7" Body="&lt;p&gt;I think your first example is fairly typical:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Peter and I both saw easily-remedied issues here. Why not just edit?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The issues were easily remedied, but there was more than one way to remedy them. In such a case, if I pick one and the OP wants to change it, we generate confusion and potentially invalidate answers. I prefer to flag the problem and encourage people not to start working on answers for questions which have outstanding clarification requests.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think there's also some broader didactic value in that I hope that the more Socratic approach will teach people to think about corner cases and ambiguities and improve their spec-writing in &quot;real life&quot;.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-03-18T23:51:00.310" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1298" PostTypeId="2" ParentId="2140" CreationDate="2014-03-19T17:49:01.250" Score="0" Body="&lt;h1&gt;I like trees&lt;/h1&gt;&#xA;&lt;p&gt;...so this is a challenge to make me a tree.&lt;/p&gt;&#xA;&lt;p&gt;Produce a program called tree which takes a single integer argument, N and draws a randomly-generated tree N levels deep, where level 0 is just the trunk.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program must produce visibly different results for at least N=0..5&lt;/li&gt;&#xA;&lt;li&gt;The tree ought to not be symmetrical in any axis.&lt;/li&gt;&#xA;&lt;li&gt;The tree should be an image&lt;/li&gt;&#xA;&lt;li&gt;Tree(5) should mostly fill dimensions of at least 200w*250h&lt;/li&gt;&#xA;&lt;li&gt;I should be able to run your tree from a bash prompt, eg. '$ python tree.py 3'&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I also accept ferns.&lt;/p&gt;&#xA;&lt;p&gt;Optionally your tree may be 3d, iterate forever, be colourful, have leaves at level 5, or be lit according to the time of day. However, this is code-golf, so the smallest file wins.&lt;/p&gt;&#xA;&lt;p&gt;Tags: code-golf&lt;/p&gt;&#xA;" OwnerUserId="19039" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-03-19T17:49:01.250" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1299" PostTypeId="2" ParentId="941" CreationDate="2014-03-19T17:55:24.153" Score="0" Body="&lt;p&gt;This question was deleted by Community♦ and undeleted by a moderator, but to avoid that it gets deleted again, I will answer it now.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first problem is, as I already said in my comment: it's not fair because of different time zones. I could be sleeping if someone posts a challenge about a topic I'm very interested in. I would never win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It would be unfair if you have a great answer, but you post it 5 seconds after a bad answer, as Victor mentioned in his comment. Or even worse: you could have a great answer, and you are about to post it, but then you lose your Internet connection for some time. Or your browser crashes. Then you probably won't be the first one who answers the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another problem: someone could easily abuse the 5 minutes editing grace period. Someone could post an answer that actually doesn't work, you post a working answer 2 minutes later, but then the previous answerer fixes his answer. Actually, you are the winner, but it will look like the previous answerer is the winner because he posted his answer first, without an &quot;Edited &lt;em&gt;at this time&lt;/em&gt;&quot; link is shown.&lt;/p&gt;&#xA;" OwnerUserId="9275" LastActivityDate="2014-03-19T17:55:24.153" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1300" PostTypeId="2" ParentId="941" CreationDate="2014-03-19T18:31:16.467" Score="9" Body="&lt;p&gt;I think this idea can work on PPCG.SE, just not on the main site. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's how:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Do it in chat&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Just as anyone who wants a game of basketball can go to the gym and find a pick up game, with a little more traffic you could do the same for a little impromptu speed-coding challenge in chat.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;A little more traffic&quot; is key, because at present I don't think you'd find enough people who aren't busy at any given time. But that can change, especially if someone motivated to provoke that change does a little hustling to make it happen.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The cons of doing a challenge via chat:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No rep gain&lt;/li&gt;&#xA;&lt;li&gt;No accepted answer&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;But, just like Whose Line Is It Anyway? the points don't really matter, right?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The pros:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Eminently fair. So what if someone sleeps through it, it's just a pick up game.&lt;/li&gt;&#xA;&lt;li&gt;Easy to determine in advance that enough people will participate to make it a contest.&lt;/li&gt;&#xA;&lt;li&gt;Drives traffic to chat, making people aware that it's there.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3363" LastActivityDate="2014-03-19T18:31:16.467" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1301" PostTypeId="1" CreationDate="2014-03-20T10:51:50.353" Score="7" ViewCount="383" Body="&lt;p&gt;How can I incorporate good-looking mathematical exposition into my question/answer?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1280&quot;&gt;Return to FAQ index&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="5240" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2021-06-10T20:12:53.973" Title="How can I incorporate good-looking mathematical exposition into my question/answer?" Tags="|support|faq|" AnswerCount="2" CommentCount="1" CommunityOwnedDate="2014-03-20T16:01:23.187" ContentLicense="CC BY-SA 3.0" />
  <row Id="1302" PostTypeId="2" ParentId="1301" CreationDate="2014-03-20T10:51:50.353" Score="7" Body="&lt;p&gt;&lt;strong&gt;NOTE&lt;/strong&gt;: Code Golf now supports MathJax (see &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/23495/68942&quot;&gt;the other answer&lt;/a&gt;), so this is no longer accurate; however, the other advice in the post is worth keeping around.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;codegolf.SE does not use MathJax, because its load time is too high (see &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/292/5240&quot;&gt;discussion&lt;/a&gt;). But although there is not built-in support for LaTeX, you can visualize mathematical formulae in various ways&lt;/p&gt;&#xA;&lt;h2&gt;Images&lt;/h2&gt;&#xA;&lt;p&gt;You can include mathematical formulae as images. There a basically three ways how to get such an image:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use the &lt;a href=&quot;https://math.stackexchange.com/questions/ask&quot;&gt;preview of math.SE&lt;/a&gt; to create your formula, make a screenshot and crop it to the right size.&lt;/li&gt;&#xA;&lt;li&gt;Create a LaTeX document on your computer, make a screenshot and crop it to the right size.&lt;/li&gt;&#xA;&lt;li&gt;Use command line tools (see &lt;a href=&quot;https://tex.stackexchange.com/q/34054/5645&quot;&gt;this question&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Use &lt;a href=&quot;http://mathurl.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;MathURL&lt;/a&gt; to create an image of the equation (fastest option for images)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Symbols&lt;/h2&gt;&#xA;&lt;p&gt;Many math symbols are also available as plain text. You can create your formula by using copy-and-paste:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Wikipedia:Mathematical_symbols&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia:Mathematical symbols&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://math.typeit.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;math.typeit.org&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The most basic symbols that you might need are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Arrows: ← ↓ → ↑ ↔ ↵ ⇐ ⇓ ⇒ ⇑ ⇔&lt;/li&gt;&#xA;&lt;li&gt;Sets: ∈ ∉ ∅ ⊆ ⊂ ⊄ ∪ ∩&lt;/li&gt;&#xA;&lt;li&gt;Relations: ≠ ≤ ≥ ≈&lt;/li&gt;&#xA;&lt;li&gt;Logic: ¬ ∧ ∨ ∃ ∀&lt;/li&gt;&#xA;&lt;li&gt;More: ∫ ∞ ε Δ ⋅&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Note that most platforms offer some kind of extended character input palette which makes this input method easier. (e.g. Character Viewer in OSX, Character Map in Windows)&lt;/p&gt;&#xA;&lt;h2&gt;Pure ASCII&lt;/h2&gt;&#xA;&lt;p&gt;While this is the least elegant-looking option, it produces results intelligible to anyone who understands the corresponding mathematical symbols. Handy if you want to put equations in your source code comments.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://sourceforge.net/projects/asciitex/&quot; rel=&quot;nofollow noreferrer&quot;&gt;asciiTeX&lt;/a&gt; - Binary for Windows only, but it is available on Homebrew for OSX and should build for Linux.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="5240" LastEditorUserId="68942" LastEditDate="2021-06-10T17:25:36.097" LastActivityDate="2021-06-10T17:25:36.097" CommentCount="7" CommunityOwnedDate="2014-03-20T10:51:50.353" ContentLicense="CC BY-SA 4.0" />
  <row Id="1305" PostTypeId="1" CreationDate="2014-03-20T16:44:33.930" Score="40" ViewCount="1309" Body="&lt;h1&gt;The Problem&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The sandbox will be a problem when we graduate (hopefully soon!) As it is already, the people who look through the sandbox regularly are very little in number. What happens when we graduate, bringing in more traffic? Three problems:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It won't be worth it to post in the sandbox, since the percentage of people who look through it will be very low.&lt;/li&gt;&#xA;&lt;li&gt;It won't be worth it to review sandbox posts (for the new users), since there's no feedback or reward.&lt;/li&gt;&#xA;&lt;li&gt;There will be more posts in the sandbox anyway (because of the increase in users), which a.) Aren't reviewed properly (due to points 1 and 2) and b.) Will require a new sandbox every day, perhaps.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;The Solution&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Stop.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/x6f4s.png&quot; alt=&quot;Stop&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's kill the sandbox.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can already hear the protests: &quot;But why? That's such a radical action! The sandbox was there forever! It can't go away!&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But, aren't we a Stack Exchange site? The &lt;em&gt;entire network&lt;/em&gt; was designed so that there is no need for a sandbox. Is there not editing and closing? Questions don't have to be perfect &lt;em&gt;immediately&lt;/em&gt; on posting; if you see a minor problem, just edit the post! Comment for major problems, and close unrecoverable challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Are you starting to notice something? &lt;strong&gt;This is &lt;em&gt;exactly&lt;/em&gt; what other Stack Exchange sites do!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's solve this problem, and get one step closer to graduation.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2016-10-24T18:40:20.060" Title="The problem with sandboxes, and a proposed solution" Tags="|discussion|sandbox|" AnswerCount="6" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="1306" PostTypeId="2" ParentId="1305" CreationDate="2014-03-20T17:51:02.390" Score="23" Body="&lt;p&gt;&lt;em&gt;In this post, I'm speaking as a user, not a moderator.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your proposal could be workable, if we are willing to weed out questions (and answers) as aggressively as is being done on the &lt;a href=&quot;https://softwarerecs.stackexchange.com/&quot;&gt;Software Recommendations&lt;/a&gt; site (and if we have enough high-rep users who can nuke inappropriate questions and answers quickly). That doesn't seem to be the current trend, though.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Currently, the sandbox is a buffer against duplicate, poorly-specified, uninteresting, or just generally inviable challenges. It makes the task of framing challenges a collaborative, community-orientated effort. I am in favour of this latter aspect, and would like to retain it even if we switch to a sandbox-less model.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd like to expand on the &quot;collaborative, community-orientated&quot; aspect, because it's the cornerstone of my counter-proposal below. Most SE sites involve some sort of &lt;em&gt;personal&lt;/em&gt; question the OP has (that other people potentially share). So questions on those sites are more personal. On this site, coding challenges have nothing to do with personal questions; they don't help the OP personally. To that end, the more community refinement a challenge gets, the higher the quality, in general.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Personally, I don't consider the sandbox concept problematic per se, but that the frustrations we encounter are simply the result of the limitations in its current place on Meta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What we need, in my view, is a way to make all the sandbox questions readily accessible and sensibly indexed (without requiring manual work), along with a way to expire submissions that are either clearly unsuitable or else generally have only lacklustre support. This can be achieved with a dedicated sandbox Stack Exchange instance (e.g., sandbox.codegolf.stackexchange.com), where each proposed post is simply a question, with appropriate tagging for ease of indexing. Posts can then be comment-on, edited, closed, and/or deleted independently of others.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, moderators (and hopefully high-rep users too) would be empowered to quickly migrate posts off the main site to the sandbox should they fail to meet the site standards.&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-04-13T12:50:01.760" LastActivityDate="2014-03-20T18:38:21.983" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="1310" PostTypeId="2" ParentId="1305" CreationDate="2014-03-21T07:15:42.717" Score="7" Body="&lt;p&gt;I want to throw in an option which doesn't take the nuke-approach but also doesn't require a new site: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Use the sandbox even if the OP posts it on the main site.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When we encounter a question which we think should and can be enhanced (with some effort) we may migrate the question to sandbox manually and leave only a link on the main site. &lt;/li&gt;&#xA;&lt;li&gt;An additional (standard) text is added: &quot;This question is currently under review. If you are the poster of this question or interested in developing new challenges please join the discussion &lt;em&gt;here&lt;/em&gt;. As soon as the puzzle is ready it will be migrated here and you may post your answers.&quot;.&lt;/li&gt;&#xA;&lt;li&gt;We remove all tags and instead add a tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sandboxed&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sandboxed&amp;#39;&quot; rel=&quot;tag&quot;&gt;sandboxed&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This will make the sandbox more popular since many people who don't visit meta will now come accross links to meta if they visit such a question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course if we want this approach to work we all have to give constructive criticism as soon as we migrate questions to sandbox.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Drawbacks:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Requires discipline and manual work.&lt;/li&gt;&#xA;&lt;li&gt;The sandbox answer's owner is not the original poster.&lt;/li&gt;&#xA;&lt;li&gt;The size of the sandboxes has to increase such that we don't have to open a new one every day. I think this is not such a big issue if on the main site we link directly to the answers.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="1490" LastActivityDate="2014-03-21T07:15:42.717" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1311" PostTypeId="2" ParentId="1305" CreationDate="2014-03-21T13:50:50.590" Score="2" Body="&lt;p&gt;I agree with the OP that the sandbox should be nuked, but I don't think he paid proper respects to the tools we already have.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The main problem will fix itself in time.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Others have pointed out that the problem with having no sandbox is that our current user base is not bold enough to close or recommend fixes to poor problems. The result is poor questions not getting fixed and being closed slowly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Imagine we are twice as popular. We have twice as many questions coming in, three times as many people suggesting improvements, and poor questions are closed three times as fast. How did I get three times the work out of twice as many users? There is a phenomena that, in layman's terms, encourages users to speak up and share their thoughts when others do. This phenomena is amplified on the Internet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not a psychologist, but I do frequent StackOverflow and watch questions get bombarded with so much feedback and so many votes that it makes the OP's head spin. They want more code, less code, more tags, less tags, etc. They edit grammar mistakes and indentation problems within 60 seconds of being posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The remaining problems are not unique to us.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What happens to all the answers who are invalidated by multiple edits? The owners simply get mad, delete their answer, and downvote the question. That's life everywhere else. Just because we answer with code doesn't make our time more special. Barry Boehm said that fixes to code become exponentially more difficult after implementation. Sorry, but that just doesn't affect your 200 line creations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Crowd-moderation has a power that simply cannot be achieved using sandboxes, where the crowd is smaller. The sandbox was a great crutch, and it may continue to be for a while, but it should die eventually and won't need to be replaced.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastActivityDate="2014-03-21T13:50:50.590" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1315" PostTypeId="1" CreationDate="2014-03-21T18:17:05.637" Score="10" ViewCount="281" Body="&lt;p&gt;Most sites have a creative badge icon instead of the simple circle. Some examples (from Android Enthusiasts, User Experience, and Bicycles respectively):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/utoOQ.png&quot; alt=&quot;Badge Icons&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think that Code Golf should also have a creative badge icon. What should it look like?&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="3808" LastEditDate="2014-03-21T21:53:30.460" LastActivityDate="2016-03-31T00:14:33.487" Title="Let's design a nice badge icon!" Tags="|discussion|badges|" AnswerCount="1" CommentCount="1" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1316" PostTypeId="2" ParentId="1315" CreationDate="2014-03-21T18:19:13.110" Score="5" Body="&lt;p&gt;&lt;em&gt;Speaking as a user, not a moderator.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think Jin designs these for sites when they graduate. (I should ask him next time I have lunch with him.) Sure, you can provide input if you want, but I don't think they'll use community designs directly.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Update: PPCG is now undergoing &lt;a href=&quot;https://meta.stackexchange.com/q/263905/13&quot;&gt;design-independent graduation&lt;/a&gt;. We'll have most of the features of graduation, but the design will come later.&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2016-03-31T00:14:33.487" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1317" PostTypeId="2" ParentId="2140" CreationDate="2014-03-22T00:19:21.067" Score="0" Body="&lt;p&gt;&lt;strong&gt;Foreword&lt;/strong&gt;: This might have been done before, but I couldn't find any such cases. I think the scoring is quite fair now, and the challenge quite clear, but any criticism is welcome. Only thing I am not sure of (besides maybe a similar question existing) is whether it is rewarding enough to add a single language or whether a 2 byte solution which just runs in two languages is going to win (is that possible?).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a single piece of code that will only output different deterministic integers depending on the language it has been interpreted as. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Length of the code divided by the multiplication of the score of every used language. &lt;a href=&quot;http://en.wikipedia.org/wiki/Esoteric_programming_language&quot; rel=&quot;nofollow&quot;&gt;Esoteric languages&lt;/a&gt; have score 2 and production languages have score 3. For example, if you have a code of length 120 which runs in whitespace and javascript this will give a score of &lt;code&gt;120/(2*3)=20&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Versions and forks: Different versions and forks may count as different languages, provided that the output is not determined by the version or similar constants in any way. In other words: &lt;code&gt;&amp;lt;?=intval(phpversion())?&amp;gt;&lt;/code&gt; or &lt;code&gt;1&amp;lt;!--[if IE 8]&amp;gt;1&amp;lt;![endif]--&amp;gt;&lt;/code&gt; is not allowed.&lt;/li&gt;&#xA;&lt;li&gt;The outputted integer should be the constant and &lt;em&gt;only&lt;/em&gt; dependent on the language it is run in.&lt;/li&gt;&#xA;&lt;li&gt;Only the most common compiler for a language should be used.&lt;/li&gt;&#xA;&lt;li&gt;The code should output nothing besides the integer.&lt;/li&gt;&#xA;&lt;li&gt;No two interpretations (languages) of the code may yield the same integer.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In cases where there is any serious discussions of a language being esoteric, it will be counted as esoteric if no commercial company with at least 50 employees can be pointed to developing it's main product in the discussed language.  &lt;/p&gt;&#xA;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;  &lt;p&gt; ^ Blame the sandbox for that last crazy over specific rule&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12130" LastEditorUserId="12130" LastEditDate="2014-03-23T00:41:42.293" LastActivityDate="2014-03-23T00:41:42.293" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="1318" PostTypeId="2" ParentId="2140" CreationDate="2014-03-22T01:54:28.937" Score="3" Body="&lt;h1&gt;Create a calendar&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/calendar&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;calendar&amp;#39;&quot; rel=&quot;tag&quot;&gt;calendar&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We all know HDD-space is precious and bandwidth is expensive, therefore it is best to reduce the size of your executables. Let's start with your calendar:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to build a calendar app in at most 512 bytes. The calendar must at least support the following features, but additional features may gain you additional upvotes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It must be able to show the current month with the current day highlighted&lt;/li&gt;&#xA;&lt;li&gt;The user must be able to find out the week day of each day&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Maximum code length is 512 bytes (counted as UTF-8 without BOM)&lt;/li&gt;&#xA;&lt;li&gt;You may subtract the bootstrapping code (i.e. &lt;code&gt;int main(int argc, char **argv)&lt;/code&gt; in C or &lt;code&gt;&amp;lt;?php&lt;/code&gt; in PHP) and imports from the final size to allow for more verbose languages to be in&lt;/li&gt;&#xA;&lt;li&gt;You may use standard time / date functions of your programming language, as long as they don't allow you to output a ready to use calendar&lt;/li&gt;&#xA;&lt;li&gt;No network access (I said bandwidth is expensive!)&lt;/li&gt;&#xA;&lt;li&gt;Voters decide on the amount of features / look and feel / creativity&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This needs a tag for the size restriction, any suggestions?&lt;/p&gt;&#xA;" OwnerUserId="3396" LastEditorUserId="3808" LastEditDate="2014-03-22T13:02:24.353" LastActivityDate="2014-03-22T13:02:24.353" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="1319" PostTypeId="2" ParentId="2140" CreationDate="2014-03-22T11:43:14.900" Score="1" Body="&lt;h1&gt;Tic-tac-toe&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Tic-tac-toe is a paper-and-pencil game for two players, played on a 3×3 grid. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules of Tic-tac-toe&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first player uses X, the second O as a symbol.&lt;/li&gt;&#xA;&lt;li&gt;Tic-tac-toe is round-based. So in the first round, X has to place his symbol on any free grid cell, then O has to place his symbol on any free grid cell and so on.&lt;/li&gt;&#xA;&lt;li&gt;The game is over when any player manages to get three of his symbols in any row / column or the diagonal. That player has won. So every game has at least 5 turns.&lt;/li&gt;&#xA;&lt;li&gt;The game is over when all cells are full. This is a draw. So every game has at most 9 turns.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Rules of this codegolf&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. So shortest code wins.&lt;/li&gt;&#xA;&lt;li&gt;Every code has to be playable. This means, at first the user has to be able to decide which player he wants to be (first / second or X / O). The other player will be the computer.&lt;/li&gt;&#xA;&lt;li&gt;Optimality: The computer has to use the optimal strategy. This means, the computer can never lose (see &lt;a href=&quot;https://en.wikipedia.org/wiki/Tic-tac-toe&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Bonus: If you can play it via GUI, you get -200 characters.&lt;/li&gt;&#xA;&lt;li&gt;You should provide an ungolfed version&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I've just seen &lt;a href=&quot;https://stackoverflow.com/q/22576322/562769&quot;&gt;this question&lt;/a&gt; on StackOverflow where somebody seems to have hard-coded an optimal player and wants to know how to reduce the size of his program. Lets see how far we can get :-)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Related questions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/1054/5240&quot;&gt;Noughts and Crosses (aka Tic-Tac-Toe)&lt;/a&gt;: It seems to be exactly the same question, but optimality was not required&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/15573/5240&quot;&gt;3D Tic Tac Toe&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/22494/5240&quot;&gt;The Tic-tac-toe Games&lt;/a&gt;: n&lt;sup&gt;d&lt;/sup&gt; tic-tac-toe&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/4368/5240&quot;&gt;Lose at tic-tac-toe&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/1065/5240&quot;&gt;The Tic Tac Toe Dictionary&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/11759/5240&quot;&gt;quine-ish tic-tac-toe&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="5240" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2014-03-22T11:49:18.687" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1320" PostTypeId="1" CreationDate="2014-03-22T13:51:14.327" Score="2" ViewCount="196" Body="&lt;p&gt;I've got an idea for a new kind of puzzle and would like to ask if it's OK first. It's a bit different than the usual code-golf kind of question. It doesn't ask for the shortest solution, or something funny/silly like the troll questions, but actually for something semi-useful. I'll give an example first, and then describe the general idea:&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example:&lt;/strong&gt;&#xA;Implement multi-line lambdas in Python. &lt;a href=&quot;http://www.artima.com/weblogs/viewpost.jsp?thread=147358&quot; rel=&quot;nofollow noreferrer&quot;&gt;Guido van Rossum said it couldn't be done&lt;/a&gt;, prove him wrong. Your solution should allow something like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt; f = multilinelamba(&quot;hour&quot;, &quot;&quot;&quot;&#xA;...     if hour &amp;gt; 20 or hour &amp;lt; 6:&#xA;...         print &quot;Good night&quot;&#xA;...     else:&#xA;...         print &quot;Hello world&quot;&#xA;...     &quot;&quot;&quot;)&#xA;&amp;gt;&amp;gt;&amp;gt; f(10)&#xA;... 'Hello world'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your solution should be as close as possible to the behavior of real &lt;code&gt;def&lt;/code&gt; or &lt;code&gt;lambda&lt;/code&gt;. The actual syntax or way of implementation doesn't matter (e.g. define a function, write a preprocessor, ...). You get bonus points:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If your solution captures outside variables in a closure, like real &lt;code&gt;def&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;For correct handling of exceptions in the multiline lamba&lt;/li&gt;&#xA;&lt;li&gt;(and so on, a checklist of objective criteria or 'unit tests' to judge)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I posted this question a while ago on Stack Overflow: &lt;a href=&quot;https://stackoverflow.com/questions/15657691/recipe-for-anonymous-functions-in-python&quot;&gt;Recipe for anonymous functions in python?&lt;/a&gt;, but it received a lot of hate. People didn't answer it, but told my why it was a bad idea, and I had to justify myself and put up big disclaimers. So now I'm trying something different, I'm posing it not as a SO question, but as a programming riddle. Explicitly not looking for a solution for production code, but just for fun. That doesn't mean I'm looking for silly solutions - they should be well-engineered and in principle usable. I have a couple of these questions where tinkering is required, and I'm really curious to see clever solutions, but I'm afraid of posting them on SO for obvious reasons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I &lt;em&gt;personally&lt;/em&gt; don't really care for rating the answers, and would be happy with two or three interesting submissions per question without picking a winner. But it seems the community feels strongly about having objective winning criteria, so I propose a check list of &quot;tests&quot; like above that the solution must pass, the more it passes the better. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;One think I'd like to add is that the answers should be compact enough to fit in an answer. You may link to a repository, if your solution lead to something cool and useful, of course, but the core idea (and basis of rating, if desired) should be presented succinctly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, it should be a question that doesn't fit directly on SO, so no straightforward programming questions, but rather hackish &quot;I wonder if it could be done?&quot; kind of challenges. The kind where people refuse to answer, and say &quot;don't&quot; or &quot;what are you trying to accomplish?&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for a tag name, I have no great idea. Maybe something like &lt;code&gt;tinker-challenge&lt;/code&gt; or &lt;code&gt;clever-hack&lt;/code&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;As Guido said, &quot;Language Design Is Not Just Solving Puzzles&quot;, but solving puzzles is fun!&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="19644" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2014-03-22T13:51:14.327" Title="Programming puzzle asking for &quot;real&quot;, clever solutions OK?" Tags="|discussion|new-genre|" AnswerCount="0" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="1321" PostTypeId="2" ParentId="2140" CreationDate="2014-03-22T14:19:43.840" Score="0" Body="&lt;h1&gt;Implement multi-line lambdas in Python.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.artima.com/weblogs/viewpost.jsp?thread=147358&quot; rel=&quot;nofollow noreferrer&quot;&gt;Guido van Rossum said it couldn't be done&lt;/a&gt;, prove him wrong. Your solution should allow multi-line anonymous functions, like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt; f = multilinelamba(&quot;hour&quot;, &quot;&quot;&quot;&#xA;...     if hour &amp;gt; 20 or hour &amp;lt; 6:&#xA;...         print &quot;Good night&quot;&#xA;...     else:&#xA;...         print &quot;Hello world&quot;&#xA;...     &quot;&quot;&quot;)&#xA;&amp;gt;&amp;gt;&amp;gt; f(10)&#xA;... 'Hello world'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your solution should be as close as possible to the behavior of real &lt;code&gt;def&lt;/code&gt; or &lt;code&gt;lambda&lt;/code&gt;. The actual syntax doesn't matter. E.g. you may choose to pass the code as a string as above, or you may find a way to avoid it. The implementation is also open, you may for example define a function, write a preprocessor, or edit the python source, but keep in mind that the solution should fit in the answer, so the last option probably won't work.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your solution must allow arbitrary python code inside, except the following which is optional:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;recursive use of the &lt;code&gt;multilinelambda&lt;/code&gt; &quot;statement&quot; inside of the &lt;code&gt;multilinelambda&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;calling the function recursively, i.e. using &lt;code&gt;f&lt;/code&gt; inside the &lt;code&gt;multilinelambda&lt;/code&gt; in the above function&lt;/li&gt;&#xA;&lt;li&gt;defining classes and&lt;/li&gt;&#xA;&lt;li&gt;importing modules (these two might be too hard)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You must also be able to use a &lt;code&gt;multilinelambda&lt;/code&gt; as a parameter when calling a function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You get bonus points:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If your solution captures outside variables in a closure, like real &lt;code&gt;def&lt;/code&gt; does&lt;/li&gt;&#xA;&lt;li&gt;For correct handling of exceptions in the &lt;code&gt;multilinelambda&lt;/code&gt;. They should display similarly to when using &lt;code&gt;def&lt;/code&gt;, and include line number relative to the file.&lt;/li&gt;&#xA;&lt;li&gt;For allowing default parameters&lt;/li&gt;&#xA;&lt;li&gt;For allowing *args and **kwargs&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the solution admits any kind of consistent indentation. Two options must be considered:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All lines have a common indentation (like in the example above) that can be stipped away.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The first line of the body is given on the same line as the &lt;code&gt;multilinelambda&lt;/code&gt; statement. In this case, all the remaining lines must be checked for consistency. It makes a difference whether the first line starts a block or not. Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;multilinelambda(&quot;x&quot;, &quot;&quot;&quot;print &quot;Hello&quot;&#xA;                        print &quot;World&quot; &quot;&quot;&quot;)&#xA;&#xA;multilinelambda(&quot;x, y&quot;, &quot;&quot;&quot;if x &amp;gt; y:&#xA;                               print &quot;case 1&quot; &#xA;                           else:&#xA;                               print &quot;case 2&quot;&#xA;                        &quot;&quot;&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In both cases, I may add or remove the same number of spaces to/from each of the lines following &lt;code&gt;multilinelambda&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Any ideas for additional criteria? I &lt;em&gt;personally&lt;/em&gt; don't really care much about picking a winner, this is more about tinkering and proving that it can be done. But in any way, more &quot;unit tests&quot; will only benefit the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Btw., I &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1320/programming-puzzle-asking-for-real-clever-solutions-ok&quot;&gt;asked about this kind of question here&lt;/a&gt; on meta.&lt;/p&gt;&#xA;" OwnerUserId="19644" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.313" LastActivityDate="2014-03-22T14:19:43.840" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1322" PostTypeId="2" ParentId="942" CreationDate="2014-03-22T19:50:56.620" Score="0" Body="&lt;h1&gt;Counting score of APL code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I can read here some claims that seem wrong. Some precisions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;One unicode character is ONE unicode character, no matter if it is ascii or not; UTF-8 is one &lt;em&gt;encoding&lt;/em&gt; for Unicode (not the single one). For instance, encoding a golfscript code in UTF-16 will make it have twice its UTF-8 size!&lt;/li&gt;&#xA;&lt;li&gt;Counting bytes isn't really relevant as long as we are interested in &lt;em&gt;coding&lt;/em&gt;; from the &lt;em&gt;code&lt;/em&gt; point of view, we are speaking of a file which is written or read in &lt;em&gt;textmode&lt;/em&gt; (either by a computer or a human), which means that unit is character. For instance, if you read one character of the file (from a program written in python, sed, awk, etc.), you will get one &lt;em&gt;unicode&lt;/em&gt; character; you will probably not even able to read one byte with a rudimentary tool like sed or awk. You have to refer to a position in the code by counting characters in order to allow someone else to find the exact location in the file.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Since there is no objective reason of focusing on bytes, I don't even want to argue about historical encoding of APL or whatever.&lt;/p&gt;&#xA;" OwnerUserId="17641" LastActivityDate="2014-03-22T19:50:56.620" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1324" PostTypeId="1" CreationDate="2014-03-22T23:26:12.433" Score="34" ViewCount="5712" Body="&lt;p&gt;Quite often I find that I am repeating myself when creating a challenge. For example, usually I have to retype the definition of &quot;random&quot; in all of my posts, or I have to specify the same thing about how reasonable input and output can be provided in every challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This post is meant to be a collection of &quot;standard&quot; definitions that may be assumed in every question, and do not need to be specified within the challenge. Definitions will apply once the post with the defintion has a score of +5 or more, and it has at least twice as many upvotes as downvotes.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="68942" LastEditDate="2021-06-27T15:10:08.207" LastActivityDate="2021-06-27T15:10:08.207" Title="Standard definitions of terms within specifications" Tags="|discussion|faq|policy|defaults|specification|" AnswerCount="8" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1325" PostTypeId="2" ParentId="1324" CreationDate="2014-03-22T23:26:12.433" Score="25" Body="&lt;h1&gt;&quot;random&quot;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The term &quot;random&quot; means that you may:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Use your language's built-in random number generator,&lt;/li&gt;&#xA;&lt;li&gt;Use &lt;code&gt;/dev/random&lt;/code&gt;, or&lt;/li&gt;&#xA;&lt;li&gt;Create a RNG that is equivalent to a standard RNG (such as the Mersenne Twister).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="3808" LastEditDate="2014-03-23T14:10:26.193" LastActivityDate="2014-03-23T14:10:26.193" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1326" PostTypeId="2" ParentId="1324" CreationDate="2014-03-22T23:28:35.737" Score="18" Body="&lt;h1&gt;&quot;input&quot; and &quot;output&quot;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Refer to &lt;a href=&quot;http://meta.codegolf.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods?s=3|1.8774&quot;&gt;Default for Code Golf: Input/Output methods&lt;/a&gt;. The list includes, but not is limited to:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;STDIN/STDOUT&lt;/li&gt;&#xA;&lt;li&gt;function argument/return value&lt;/li&gt;&#xA;&lt;li&gt;command line arguments/program exit code&lt;/li&gt;&#xA;&lt;li&gt;reading from/writing to a file&lt;/li&gt;&#xA;&lt;li&gt;dialog boxes&lt;/li&gt;&#xA;&lt;li&gt;popping from/pushing to the stack (for stack-based languages like GolfScript; this is essentially the equivalent of a function's arguments/return values for those languages)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="78410" LastEditDate="2020-03-25T01:58:56.473" LastActivityDate="2020-03-25T01:58:56.473" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="1327" PostTypeId="1" CreationDate="2014-03-23T01:26:16.503" Score="-3" ViewCount="115" Body="&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; Let me be really clear here, I expect people to disagree with me (especially here :P ), but wanted to lay out this &lt;strong&gt;thought&lt;/strong&gt; none the less. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Programmers &lt;em&gt;love&lt;/em&gt; to exploit rules, fair is fair, even I myself (used to) love it. However, despite my newness to codegolf.SE, I was surprised how this behaviour seems to be universally accepted here. It just seems odd, in &quot;real life&quot; this is normally not an issue as rules are interpreted to the best of ones ability the way they were intended and searching for loopholes is generally frowned upon. If there is a park with grass and signs &quot;do not walk on the grass&quot; it is perfectly ok to walk on the grass if a gush of wind pulled your umbrella from your hands onto the grass. And with laws (depending on the country) there even is a system in place (judges &amp;amp; lawsuits) to interpret rules sometimes (not going to get into when now, as this depends a lot on the country) not to the letter, but to the intention. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, the thing I wished to propose for consideration was whether it wouldn't be far nicer to set the default interpretation of rules from a mechanical one to a (for lack of better term) human one. In cases where there is any dispute the GM concept can be called upon, which means the one who wrote the rules and the challenge down knew it's intention and thus can make all final calls. Indeed it might be surprising to consider that such a system is possible, especially when bound to a system like the current one, but humans are quite capable of functioning in such a system and have for thousands of years. And for &lt;code&gt;underhanded&lt;/code&gt; questions rule exploitation could still be allowed, but why allow users by default to search for loopholes? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;To just finish of, how sad is it that a question like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/24718/books-full-of-nonsense-identify-limericks&quot;&gt;Books full of nonsense: Identify limericks&lt;/a&gt; has to explicitly add rules like the one which states that hardcoding for the test cases isn't allowed when the clear intention of the question is the identification of limericks, not test cases. Personally I organize 'challenges' of a very different sort in real life often, and for the type of people who try to exploit rules there is always rule number 1: the GM is always right. You 'punish' people once or twice for searching for loopholes and from that point onward life becomes a &lt;em&gt;lot&lt;/em&gt; easier and more fun for all the participants and if they are unsure they can always ask. (And cheeky loophole answers could still be community wiki'd, but those should be 'just for laughs')&lt;/p&gt;&#xA;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;  &lt;p&gt; (Either way, it's &lt;strong&gt;just a thought&lt;/strong&gt; and I am the first to acknowledge that I have a terrible track record in this area, having spoiled 'quite' a lot of 'games' in the past by finding loopholes, and when I was really young I wouldn't have walked on that grass even if my life dependent on it... so yeah, that's the kind of background this comes from and all I can say is that non-machinal rule interpretation has been quite a nice revelation at least to me :) )&#xA; &lt;br /&gt;&lt;br /&gt;(And one more thing, I am very explicitly not going to engage in any discussion on this page, I just wanted to lay this out there, if you agree vote it up, if you disagree prove me wrong in an answer and have that answer get far more votes, I am fine with anything :) )&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="12130" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-03-23T01:44:50.127" Title="Rule exploitation and the GM concept" Tags="|discussion|" AnswerCount="2" CommentCount="1" ClosedDate="2014-03-23T02:01:07.250" ContentLicense="CC BY-SA 3.0" />
  <row Id="1328" PostTypeId="2" ParentId="1327" CreationDate="2014-03-23T01:44:34.737" Score="5" Body="&lt;h1&gt;NO&lt;/h1&gt;&#xA;&#xA;&#xA;&#xA;&lt;p&gt;No way. That would ruin the whole idea of Stack Exchange.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Stack Exchange is run by the community. If the poster of the question had the ability to overrule any decision and invalidate any answer, the whole site would collapse.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A multitude of other problems would emerge:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What if the community disagrees with the OP? If the community upvoted a loophole answer (as often occurs), the OP has no way to interfere.&lt;/li&gt;&#xA;&lt;li&gt;What if the OP makes drastic decisions with seemingly no reason?&lt;/li&gt;&#xA;&lt;li&gt;What if the OP invalidates an answer just because he/she dislikes the programming language, or dislikes the user who posted it, or dislikes the algorithm, or dislikes the formatting, or.... (Basically, any subjective reason)&lt;/li&gt;&#xA;&lt;li&gt;What if there are far too many answers to judge them all, or the OP does not want to respond to all the answers for some other reason (old question, disinterest in question, etc.)&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What if the OP just doesn't respond? Like you:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;And one more thing, I am very explicitly not going to engage in any discussion on this page&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In conclusion, it's just not right to have one single person making all the decisions on a post.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-03-23T01:44:34.737" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1329" PostTypeId="2" ParentId="1327" CreationDate="2014-03-23T01:44:50.127" Score="4" Body="&lt;p&gt;I disagree with your proposal, for two reasons:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;We already have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/3&quot;&gt;policy on boundary-pushing&lt;/a&gt; that deals with the really egregious cases.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Since anybody can post a question, and certainly not all the question posters are &quot;gamemaster material&quot;, I wouldn't entrust an arbiter role to the OP. Especially not on Stack Exchange, where the operational model is voting based on whether the answer is correct or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is why, especially in the early days of this site, I've been very gung-ho about wanting questions to have &lt;em&gt;objective&lt;/em&gt; criteria. Then people can vote on questions without having to worry what the OP thinks, since the rules are all that matter.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2014-03-23T01:44:50.127" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1330" PostTypeId="2" ParentId="2140" CreationDate="2014-03-24T11:21:23.693" Score="0" Body="&lt;h1&gt;Split string of powers of 2&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I had this idea while playing 2048; Every single power of 2 is unique, even if it contains another power of 2 as a substring because there are none that consist entirely of powers of 2.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the string &lt;code&gt;&quot;2048409632864&quot;&lt;/code&gt; can be split into &lt;code&gt;2048, 4096, 32, 8, 64&lt;/code&gt; easily enough, but it can also be split into &lt;code&gt;2, 0, 4, 8, 4, 0963, 2, 8, 6, 4&lt;/code&gt; with a simple left-to-right algorithm, which is incorrect.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, the challenge is to correctly split these numbers in the shortest byte count possible. Is this a good idea?&lt;/p&gt;&#xA;" OwnerUserId="13702" LastActivityDate="2014-03-24T11:21:23.693" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1331" PostTypeId="1" CreationDate="2014-03-24T19:39:45.120" Score="2" ViewCount="93" Body="&lt;p&gt;Spoiler tags are rendering strangely on this site:&lt;/p&gt;&#xA;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;  &lt;p&gt; This is a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/editing-help#spoilers&quot;&gt;spoiler&lt;/a&gt;, introduced with &lt;code&gt;&amp;gt;!&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;To top it off, it seems that the main site has some transitions that this &lt;strong&gt;meta&lt;/strong&gt; site lacks (or which don't work in previews).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anyway, here's a couple of tidbits about the main site's spoilers from &lt;strong&gt;#whatwg&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&amp;lt;SamB&gt; hmm, the spoiler tag in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/24401/so-obviously-p-np&quot;&gt;So obviously, P = NP&lt;/a&gt; acts a bit funny WRT the hyperlink :-)&lt;br&gt;&#xA;  &amp;lt;TabAtkins&gt; SamB: &amp;lt;blockquote class=&quot;spoiler&quot;&gt; does a 'color' transition to/from transparent over .5s.  But hyperlinks already have a transition rule for 'color' going over .2s, intended for a more subtle color shift when hovering.  So the blockquote's 'color' rule overrides, but the a's transition wins, and you get the weird extra-fast transition.&lt;br&gt;&#xA;  &amp;lt;TabAtkins&gt; SamB: That's why you shouldn't do silly tricks like a color transition to 'transparent'.  Use 'opacity' on the block element, like God intended, even if it means you need a wrapper element inside the spoiler element.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't think you actually need any wrapper elements, though; if I'm understanding &lt;code&gt;RunBlockGamut&lt;/code&gt; (in &lt;a href=&quot;https://code.google.com/p/markdownsharp/source/browse/MarkdownSharp/Markdown.cs&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://code.google.com/p/markdownsharp/source/browse/MarkdownSharp/Markdown.cs&lt;/a&gt;) correctly, everything inside a blockquote will be inside elements, so we can just use this:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-css prettyprint-override&quot;&gt;&lt;code&gt;.spoiler&amp;gt;* {&#xA;    visibility: hidden; /* Fallback for when opacity doesn't work */&#xA;    opacity: 0;&#xA;    transition: opacity .5s ease-in;&#xA;}&#xA;&#xA;.spoiler:hover&amp;gt;* {&#xA;    visibility: visible;&#xA;    opacity: 1;&#xA;    transition: opacity .5s ease-in;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="14680" LastEditorUserId="76162" LastEditDate="2021-06-04T09:56:26.360" LastActivityDate="2021-06-04T09:56:26.360" Title="spoiler transitions are strange here" Tags="|bug|status-completed|site-design|" AnswerCount="0" CommentCount="5" ClosedDate="2014-04-03T12:57:13.820" ContentLicense="CC BY-SA 3.0" />
  <row Id="1334" PostTypeId="2" ParentId="2140" CreationDate="2014-03-25T21:23:40.327" Score="11" Body="&lt;h1&gt;Thinking functionally (1): removing variables&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;If you're not programming functionally, then you're programming&#xA;dysfunctionally.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Long time ago, in the first ages of universe, coders and variables were living peacefully; but one day, they turned evil and then began a long war between them and men. Unfortunately men could not do much against so many variables. Only a few men are still alive today, but fortunately you can do something for them. You have heard about the ancient art of computer programming and you even spoke one day to a very old functional programmer. Your mission is to kill as many variables as you can.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;This should be the first challenge in a longer series called &quot;Thinking functionally&quot;&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Goal:&lt;/strong&gt; write a short and interesting piece of code in some language where variables are usually needed (we all know that you can write some code in J or in some stack-based language with no variable, but please, choose some other language for this challenge), and use fewer variables than what would have been expected. You must explain what you did.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules:&lt;/strong&gt; What has to be avoided here are mainly variables involved in keeping some information for later use (next step, next iteration, next line, etc.); this covers global or local variables, closures, etc.; if list or tuples are obviously used to replace several variables with no interesting &quot;trick&quot; they should be avoided. Using complex numbers in a tricky way is ok, but using some mathematical operation with them should be preferred rather than merely using separately both parts in the number. Using bitwise trick is fine, but again, try to be clever (see example 1 below) and don't use them only with some masks for separating the data. In all cases, mathematical tricks should be preferred rather than complicated ways of inserting data in some type. On the other hand, you are allowed to use as many bound variables for writing functions as required. Your code should explicitely contain an interesting &quot;trick&quot; for avoiding a variable in a place where everybody else would have used one.&#xA;&lt;em&gt;The most important requirement is: don't try to hide data with too much energy, rather ask yourself if data is really useful.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 1:&lt;/strong&gt; Here is a first example in python, acceptable and interesting. The computer will guess which number you are thinking at with an optimal strategy, with only one variable. &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a = 256&#xA;&#xA;while True:&#xA;  print(&quot;I am going to guess the number you are thinking at.&quot;)&#xA;  print(&quot;Is it&quot;,a,&quot;?&quot;)&#xA;  print(&quot;:: 0 for less, 1 for more, Ctrl-C for OK&quot;)&#xA;  a = (&#xA;    [&#xA;      lambda x: x - ( (1 + (x ^(x-1))) &amp;gt;&amp;gt; 2 ),&#xA;      lambda x: x + ( (1 + (x ^(x-1))) &amp;gt;&amp;gt; 2 )&#xA;    ]&#xA;  )[input(&quot;? &quot;)](a)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Explanation:&lt;/em&gt; usually this game requires at least two variables, a and b, which allow the program to remember the smallest and largest possible number, then a third number is computed (a+b)/2 and a or b is updated according to the answer of the player. Here the code uses only one variable, and checks for successive bits in order to set them or not. It is obvious here that no hidden data is used, but we notice that the &quot;natural&quot; way of coding this game is redundant; using two variables isn't really needed since each guess actually belongs to a single possible path.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 2:&lt;/strong&gt; Here is another example, acceptable but not as much interesting. How can I swap two variables?&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a = 42&#xA;b = 17&#xA;a = a + b&#xA;b = a - b&#xA;a = a - b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Explanation:&lt;/em&gt; everyone knows that three variables are needed for swapping two variables, and we laugh when students try something like a=b followed with b=a, but you actually can swap variables without any temporary variable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Score:&lt;/strong&gt; this is a popularity contest; the winner will be for the answer with the most upvotes. Vote for an answer if you find it clever and tricky.&lt;/p&gt;&#xA;" OwnerUserId="17641" LastEditorUserId="17641" LastEditDate="2014-03-26T05:30:53.823" LastActivityDate="2014-03-26T05:30:53.823" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1335" PostTypeId="1" CreationDate="2014-03-25T21:57:24.153" Score="9" ViewCount="351" Body="&lt;p&gt;Can we get a &quot;Too trivial&quot; close vote for questions that would force very similar answers?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example this one: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/24862/ration-your-integers-and-feed-the-people&quot;&gt;Ration your integers and feed the people&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After the edit the question allowed only for one single sane implementation of the algorithm and the only thing that would differ is the choice of the language: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/24862/ration-your-integers-and-feed-the-people#comment52783_24862&quot;&gt;Ration your integers and feed the people&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="3396" LastEditorUserId="68942" LastEditDate="2021-06-09T05:46:01.577" LastActivityDate="2021-06-09T05:46:01.577" Title="Too trivial Close Vote" Tags="|feature-request|status-declined|close-reasons|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1336" PostTypeId="1" CreationDate="2014-03-25T21:59:36.653" Score="1" ViewCount="132" Body="&lt;p&gt;Stack Overflow has an interesting 404 not found page:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;We couldn't find the page you requested. We did, however, find this program.&#xA;  &lt;img src=&quot;http://cdn.sstatic.net/stackoverflow/img/polyglot-404.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;How about something like that for Code Golf?&lt;/p&gt;&#xA;" OwnerUserId="8611" LastEditorUserId="66833" LastEditDate="2023-08-26T17:57:06.563" LastActivityDate="2023-08-26T17:57:06.563" Title="Custom 404 not found image" Tags="|discussion|404-page|" AnswerCount="0" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1338" PostTypeId="1" AcceptedAnswerId="1339" CreationDate="2014-03-26T04:21:06.170" Score="2" ViewCount="183" Body="&lt;p&gt;A few days ago, I answered &lt;a href=&quot;https://codegolf.stackexchange.com/q/24633&quot;&gt;Find the odd character out in a pattern&lt;/a&gt; with a bash script.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Today, my answer was outscored by somebody else. Since all the heavy lifting was done by PCREs anyway, I decided to port my bash-grep-sed-grep approach to Perl, which managed to save quite a few characters. So far, so good.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What I'm wondering is if I did good in editing &lt;a href=&quot;https://codegolf.stackexchange.com/a/24646&quot;&gt;my answer&lt;/a&gt; to incorporate the second solution. I chose to do so since the approach is basically the same, just the language changed. But now that I did it, it just feels messy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The answer has gotten a little bit bloated (it was quite long anyway), I literally wrote things like &lt;em&gt;How this is achieved is explained in the bash version below.&lt;/em&gt; and I can't further golf any of the two solutions without modifying the other solution as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, what do I do now?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Split the answer in two? If so, which solution do I move out of the existing answer?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Delete the bash solution entirely? It's a lot longer than the Perl solution anyway.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Keep editing and leave things as they are?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-03-26T07:48:22.147" Title="Second answer for second language?" Tags="|discussion|answers|editing|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1339" PostTypeId="2" ParentId="1338" CreationDate="2014-03-26T07:48:22.147" Score="9" Body="&lt;p&gt;If I have a solution in a different language, I would post a second answer. So would I do, if I have an answer in the same language, but involving a totally different algorithm/technology/way of doing things.&lt;br&gt;&#xA;But that's just my opinion, and how &lt;em&gt;I&lt;/em&gt; do things.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You might pick options 1 or 3. There isn't really a point in deleting an answer just because it's not short. As long as it's valid, and actually golfed, it should stay.&lt;/p&gt;&#xA;" OwnerUserId="7162" LastActivityDate="2014-03-26T07:48:22.147" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1342" PostTypeId="2" ParentId="2140" CreationDate="2014-03-26T16:27:22.993" Score="3" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;This message is open for anyone to adopt and post to main. For more details, see the &lt;a href=&quot;https://chat.stackexchange.com/rooms/60187/abandoned-challenges-up-for-adoption&quot;&gt;chat room&lt;/a&gt; or &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12792/58826&quot;&gt;meta post&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Nonogram it&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Nonogram&quot; rel=&quot;nofollow noreferrer&quot;&gt;Nonograms&lt;/a&gt; are one of my favorite types of puzzles, but sometimes there are not enough of them to solve!&lt;/p&gt;&#xA;&lt;p&gt;The challenge here is to write a program that would take an image and output the values for the columns and rows of the puzzle.&lt;/p&gt;&#xA;&lt;p&gt;INPUT: black and white PNG on STDIN&lt;/p&gt;&#xA;&lt;p&gt;OUTPUT: two lines with the values to create the puzzle. First line is the columns, second the rows. The format of both lines is: &lt;code&gt;[a,b,c...],[d,...],... &lt;/code&gt; (lists of integers separated with commas delimited with &lt;code&gt;[]&lt;/code&gt;, with each list separated by commas, ending in a newline. No dangling commas allowed inside the lists or at line end)&lt;/p&gt;&#xA;&lt;p&gt;The squares on the image should be of 5x5px. The thereshold for determining if a square is filled is if it has at least 30% black inside it.&lt;/p&gt;&#xA;&lt;p&gt;(3 sample images will be added later)&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I'm not sure about the scoring for this challenge, most likely it should be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Additional scoring criteria I can think of:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;allowing to enter square size or cols*rows of the puzzle.&lt;/li&gt;&#xA;&lt;li&gt;accepting non black and white images&lt;/li&gt;&#xA;&lt;li&gt;reading other image types&lt;/li&gt;&#xA;&lt;li&gt;providing a solver&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="13870" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-09T20:03:15.720" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="1343" PostTypeId="2" ParentId="1177" CreationDate="2014-03-26T16:50:55.173" Score="6" Body="&lt;p&gt;Please make it stop posting in the main chatroom. That's for chatting. People who want notification of changes can&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Choose to follow the &lt;a href=&quot;http://chat.stackexchange.com/rooms/13215/golfeye-a-chatbot&quot;&gt;bot's room&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Subscribe to the &lt;a href=&quot;https://codegolf.stackexchange.com/feeds&quot;&gt;corresponding RSS feed&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Leave an open tab showing the &lt;a href=&quot;https://codegolf.stackexchange.com/questions?sort=newest&quot;&gt;newest questions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;That's &lt;strong&gt;3&lt;/strong&gt; opt-in systems. There's no need for an opt-out* system on top.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;* Not that it's really possible to opt out: hiding the messages from the bot leaves the &quot;X hours later&quot; text, doesn't prevent the bot from showing as the most recent activity in the room, and worst of all leaves replies to its messages which make no sense because they've lost their context.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-03-27T14:40:43.873" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1344" PostTypeId="2" ParentId="2140" CreationDate="2014-03-26T20:53:30.500" Score="-3" Body="&lt;h1&gt;99 Bottles of Errors&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;While there are already many versions of &quot;print 99 Bottles of Beer,&quot; I thought another one wouldn't hurt.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The challenge is fairly simple: print the lyrics to &lt;em&gt;99 bottles of Beer&lt;/em&gt; to &lt;code&gt;STDERR&lt;/code&gt;. I don't care how you do it, so long as the entire lyrics show up. An entire program is required, so the following Java program would be invalid (even if it did do the correct thing):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;System.out.println(&quot;99 Bottles of Beer on the Wall, take one down and pass it around...&quot;);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;The scoring:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This challenge is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code by byte count wins.&lt;/li&gt;&#xA;&lt;li&gt;If necessary, assume UTF-8 is the character encoding used.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;The rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All the code must be in one file.&lt;/li&gt;&#xA;&lt;li&gt;Any language is allowed.&lt;/li&gt;&#xA;&lt;li&gt;Reading input, whether it is from &lt;code&gt;STDIN&lt;/code&gt;, a file, or the web, is not allowed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="18226" LastActivityDate="2014-03-26T20:53:30.500" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1346" PostTypeId="1" AcceptedAnswerId="1347" CreationDate="2014-03-27T00:52:20.787" Score="6" ViewCount="255" Body="&lt;p&gt;Questions frequently need tweaking to the rules, even after going through the sandbox. However, rule changes that break previously valid answers are annoying to the answerer (at least from the perspective of someone who's had answers 'broken' on several occasions).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example rule changes, (from least to most annoying):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Removing a rule&lt;/li&gt;&#xA;&lt;li&gt;Closing a small loophole soon after the question was posted&lt;/li&gt;&#xA;&lt;li&gt;Closing a loophole used by existing answers&lt;/li&gt;&#xA;&lt;li&gt;Tighter restrictions on input/output format that break existing answers&lt;/li&gt;&#xA;&lt;li&gt;Adding a rule to &quot;make it harder&quot; after answers have been posted&lt;/li&gt;&#xA;&lt;li&gt;Completely changing the question because the original was just simply too easy (&lt;a href=&quot;https://codegolf.stackexchange.com/posts/24928/revisions&quot;&gt;this happened today&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Can we come to a consensus on what rule changes are acceptable, and what should be avoided? I realize this is subjective, but a good guideline would be useful.&lt;/p&gt;&#xA;" OwnerUserId="6788" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-06-20T12:23:17.730" Title="When is it allowable to change the rules?" Tags="|discussion|rules|etiquette|" AnswerCount="1" CommentCount="0" ClosedDate="2016-06-20T12:25:48.800" ContentLicense="CC BY-SA 3.0" />
  <row Id="1347" PostTypeId="2" ParentId="1346" CreationDate="2014-03-27T00:59:54.547" Score="20" Body="&lt;p&gt;I have created this very complex infographic; I hope my hours of effort will solve this problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/uSla2.png&quot; alt=&quot;does it invalidate an existing answer? if so, NO. otherwise, okay, but be more careful next time&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The only possible exception is if the answer in question is exhibiting one or more obvious loopholes that the user who posted the question clearly meant to close.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="3808" LastEditDate="2016-06-20T12:23:17.730" LastActivityDate="2016-06-20T12:23:17.730" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1348" PostTypeId="2" ParentId="1288" CreationDate="2014-03-27T08:39:52.873" Score="-2" Body="&lt;h1&gt;Golfing/Bowling with Sandbags&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;After golfing to the max, one must then add extra operations to pad the count out to a specified factor, like 10. Say your count was 98. Rather than suffer a massive penalty, you must add &lt;code&gt;--&lt;/code&gt; somewhere to double-flip an integer, rounding out the count to 100, a multiple of 10. Adding space or comments wouldn't count.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Not quite sure how to apply this to bowling, but I have an (unconfirmed) intuition that it's possible.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2014-03-27T08:39:52.873" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1349" PostTypeId="1" CreationDate="2014-03-27T22:33:37.267" Score="-2" ViewCount="156" Body="&lt;p&gt;Should a question be closed based on something the owner said outside of the question, such as in a comment?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/24955/18487&quot;&gt;This question&lt;/a&gt; was posted by a brand new Code Golf user who had problems with English and with his winning criteria. After the English and criteria were fixed, it was closed because of something the poster said in the comments. The phrase that sparked the close was &quot;its just a problem which i cant resolve&quot;. In other words, the OP had a problem that he couldn't solve, and so he transformed it into a coding challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Out of fear that this will yield answers filled entirely with personal opinions, I beg the following: please answer if and only if you are familiar with best close (also known as flag) practices on other sites.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-03-27T23:32:06.387" Title="Basis for Voting to Close" Tags="|discussion|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1350" PostTypeId="2" ParentId="1349" CreationDate="2014-03-27T23:32:06.387" Score="5" Body="&lt;p&gt;I've felt that that smelled of &quot;solve my problem for me&quot; from the very beginning. We generally expect users posting challenges to &lt;em&gt;be able to solve the challenge themselves&lt;/em&gt;. See for instance &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/107/78&quot;&gt;https://codegolf.meta.stackexchange.com/a/107/78&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it were any other way we could expect the site to be flooded by people who just need some working code, presumably pushing out the high quality &lt;em&gt;games&lt;/em&gt; and puzzles that we are actually interested in.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So yes, if the user admits to not being able to solve a simple task like that then the question should be closed.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I beg the following: please answer if and only if you are familiar with best close (also known as flag) practices on other sites.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I have to say that code-golf is different from most of the sites in Stack Exchange network. We are explicitly &lt;em&gt;not&lt;/em&gt; a site for seeking authoritative and well-considered answers to high quality questions. This is a play site and we do things differently here.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2014-03-27T23:32:06.387" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1351" PostTypeId="2" ParentId="2140" CreationDate="2014-03-27T23:36:51.353" Score="0" Body="&lt;h1&gt;A &quot;counting&quot; quine&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and maybe &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;. Hopefully codegolf.SE isn't tired of quines and quine-derivatives.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The aim of this golf is simple. Write a family of programs &lt;em&gt;A&lt;/em&gt; and a single program &lt;em&gt;B&lt;/em&gt; in your language, such that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Program &lt;em&gt;A(N)&lt;/em&gt; produces the source code of &lt;em&gt;A(N+1)&lt;/em&gt; when run, independent of file name, current date, contents of STDIN, or similar external variables.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Program &lt;em&gt;B&lt;/em&gt;, when given the source of &lt;em&gt;A(N)&lt;/em&gt; as input, returns &lt;em&gt;N&lt;/em&gt;. Input can be via STDIN, function argument, preinitialized single-character string variable, or language's equivalent.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your score is the sum of the lengths of &lt;em&gt;A(0)&lt;/em&gt; and &lt;em&gt;B&lt;/em&gt; in bytes. Lowest score wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I called it a counting quine, because it is easiest to implement like a quine, except it also counts. The purpose of program &lt;em&gt;B&lt;/em&gt; is to potentially allow for non-numeric changes between the programs in A, such as an increasing line of asterisks or something.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Things to consider&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Is this too similar to &quot;&lt;a href=&quot;https://codegolf.stackexchange.com/q/21831/5138&quot;&gt;Program that creates larger versions of itself (quine-variant)&lt;/a&gt;?&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Golfscript has a particularly powerful answer to the above question, that could be adapted to this challenge. It seems like it would beat even my best J, which itself is a curt 29 + 10 = 39 bytes. If this question is dissimilar enough to post, are we just going to bite the pillow and let these two duke it out? Is there some kind of restriction that might make this a little harder or more unique?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Alternatively, should this be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;? Maybe it would be more fun or interesting not to constrain cleverness by size requirements.&lt;/p&gt;&#xA;" OwnerUserId="5138" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.653" LastActivityDate="2014-03-27T23:36:51.353" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1352" PostTypeId="1" CreationDate="2014-03-28T13:31:54.507" Score="-11" ViewCount="324" Body="&lt;p&gt;Should the following be the sole reason to close a question? Should it be a supporting reason, or the reason that tips you over the edge if you were on the fence about closing a question?&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;User demonstrated an inability to solve own puzzle or challenge.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The meta posts that do address this topic have either &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Too many points condensed into a single post, or &lt;/li&gt;&#xA;&lt;li&gt;No clear consensus.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="18487" LastEditDate="2014-05-12T14:10:07.540" LastActivityDate="2018-01-30T09:03:56.747" Title="Ability to Solve Own Challenge as a Requirement" Tags="|discussion|close-reasons|" AnswerCount="3" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1353" PostTypeId="1" CreationDate="2014-03-28T13:41:24.670" Score="1" ViewCount="46" Body="&lt;p&gt;I've come to the conclusion that code golf can be either good (eg reducing unnecessary operations like assignments) or bad (eg reducing character count of variable names).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It strikes me that better a better metric than character or byte count would be to count the number of &lt;a href=&quot;https://en.wikipedia.org/wiki/Lexical_analysis#Tokenization&quot; rel=&quot;nofollow&quot;&gt;tokens&lt;/a&gt; in a program, eg:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$number_of_matches = $? ? 3 : 4;&#xA;        ^          ^  ^ ^ ^ ^ ^^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;would count the same as:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$n=$??3:4;&#xA;^ ^^ ^^^^^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As both have 8 tokens.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This would let us preserve readability but still leave the non-repetitive part of code-golf. This would also have the advantage of leveling the playing field somewhat with languages that tend to prefer longer function names.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="15955" LastActivityDate="2014-03-28T13:41:24.670" Title="Code golf variant: by token" Tags="|discussion|" AnswerCount="0" CommentCount="8" ClosedDate="2014-03-28T14:09:57.333" ContentLicense="CC BY-SA 3.0" />
  <row Id="1354" PostTypeId="2" ParentId="2140" CreationDate="2014-03-28T14:23:48.340" Score="-3" Body="&lt;h1&gt;Create an Identicon Generator&lt;/h1&gt;&#xA;&lt;p&gt;The challenge is to create an identicon generator.  The identicons must be randomly generated, so we get a new identicon for each key the program receives.  You can input a key using std-in or you can use your language's random number generator for the key.&lt;/p&gt;&#xA;&lt;p&gt;In order to make your identicon look reasonably nice, it must generate a picture, then rotate that picture around the bottom right corner, the way this mockup shows:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/i3XTX.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;The output must be to a PNG file.  Shortest code wins.&lt;/p&gt;&#xA;" OwnerDisplayName="user10766" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-03-28T14:23:48.340" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1355" PostTypeId="1" CreationDate="2014-03-28T17:48:24.577" Score="4" ViewCount="119" Body="&lt;p&gt;Syntax highlighting is surely a good thing to have in answers here, as it makes the unreadable code more readable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, many users, especially new users, may &#xA;not know about it, and even if they do notice that some posts have enabled syntax highlighting, they may not know how to use it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, there were many edits that only add syntax highlighting, and I don't think it is a very nice idea to perform such trivial edits.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, do you think that it would be good to encourage the use of syntax highlighting? And if you do, how should we do it? Perhaps mention it in the FAQ? Or, if possible, in the formatting help?&lt;/p&gt;&#xA;" OwnerUserId="12205" LastActivityDate="2014-03-28T17:48:24.577" Title="Encourage syntax highlighting in answers" Tags="|discussion|" AnswerCount="0" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1356" PostTypeId="1" CreationDate="2014-03-29T01:48:21.787" Score="27" ViewCount="924" Body="&lt;blockquote&gt;&#xA;  &lt;h1&gt;Success!&lt;/h1&gt;&#xA;  &#xA;  &lt;p&gt;We have officially garnered &lt;a href=&quot;https://softwareengineering.meta.stackexchange.com/ads/display/6315&quot;&gt;48 clicks&lt;/a&gt; (more than CR's ad) on ads on Programmers, &lt;a href=&quot;https://gamedev.meta.stackexchange.com/ads/display/1408&quot;&gt;9 clicks&lt;/a&gt; on Game Development, and a whopping &lt;a href=&quot;https://cstheory.meta.stackexchange.com/ads/display/2745&quot;&gt;171 clicks&lt;/a&gt; (6 per day) on Theoretical Computer Science! Hooray!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;UPDATE: Ads have been posted! Vote for us!&lt;/h1&gt;&#xA;  &#xA;  &lt;p&gt;There was a tie, with two answers at 10 votes, so I just decided to&#xA;  post them both. Ads have been posted on Programmers&#xA;  (&lt;a href=&quot;https://softwareengineering.meta.stackexchange.com/a/6574/100175&quot;&gt;1&lt;/a&gt;,&#xA;  &lt;a href=&quot;https://softwareengineering.meta.stackexchange.com/a/6575/100175&quot;&gt;2&lt;/a&gt;),&#xA;  Mathematica&#xA;  (&lt;a href=&quot;https://mathematica.meta.stackexchange.com/a/1280/12025&quot;&gt;1&lt;/a&gt;,&#xA;  &lt;a href=&quot;https://mathematica.meta.stackexchange.com/a/1281/12025&quot;&gt;2&lt;/a&gt;), Game&#xA;  Development (&lt;a href=&quot;https://gamedev.meta.stackexchange.com/a/1569/19034&quot;&gt;1&lt;/a&gt;,&#xA;  &lt;a href=&quot;https://gamedev.meta.stackexchange.com/a/1570/19034&quot;&gt;2&lt;/a&gt;), and&#xA;  Theoretical Computer Science&#xA;  (&lt;a href=&quot;https://cstheory.meta.stackexchange.com/a/2829/22281&quot;&gt;1&lt;/a&gt;,&#xA;  &lt;a href=&quot;https://cstheory.meta.stackexchange.com/a/2830/22281&quot;&gt;2&lt;/a&gt;)! Vote for&#xA;  our ads there so they start showing up on the sites!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;So I noticed that Robotics Stack Exchange made their own little ads to post on other sites' community ad posts:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://robotics.stackexchange.com&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/QpWDJ.gif&quot; alt=&quot;robotics stack exchange&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think we should make one of our own! It could be posted on Stack Overflow, and it would really help bring in more traffic, which we really need. It might also fit on other programming-related sites.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, make an ad and post an answer below! Here are the rules you must follow for the ad:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The image that you create must be &lt;strong&gt;220 x 250 pixels&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Must be hosted through our standard image uploader (i.stack.imgur.com)&lt;/li&gt;&#xA;&lt;li&gt;Must be GIF or PNG&lt;/li&gt;&#xA;&lt;li&gt;No animated GIFs&lt;/li&gt;&#xA;&lt;li&gt;Absolute limit on file size of 150 KB&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;It should also have a border.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The highest voted ad once it has been at least two weeks, or there are at least 3 submissions with 3 votes each, or there is a submission with over 10 votes, will be posted on the community-ads post on various programming-related sites.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T17:33:38.417" LastActivityDate="2016-02-18T02:30:33.120" Title="Let's make an ad for our site! (And now vote for our newly posted ads!)" Tags="|discussion|" AnswerCount="6" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="1357" PostTypeId="2" ParentId="1356" CreationDate="2014-03-29T01:48:21.787" Score="13" Body="&lt;p&gt;Here's my idea that I'll start off with:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://codegolf.stackexchange.com&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/PbfqN.png&quot; alt=&quot;Programming Puzzles and Code Golf Stack Exchange&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;http://en.wikipedia.org/wiki/File:Jigsaw.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;puzzle graphic&lt;/a&gt; is licensed under the public domain. The &lt;a href=&quot;http://www.1001fonts.com/neuropolitical-font.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;font is Neuropolitical&lt;/a&gt;, and the code is in Courier New and is from &lt;a href=&quot;https://codegolf.stackexchange.com/a/4254/3808&quot;&gt;this wonderful answer&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Feel free to use the same text and/or ideas in your own ad, if you think this could be improved!&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2014-03-29T01:48:21.787" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1358" PostTypeId="2" ParentId="1356" CreationDate="2014-03-29T10:49:15.267" Score="-3" Body="&lt;p&gt;It's a bit plain, so I'll probably have to think of a way of brightening it, but it conveys what I want it to convey.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://codegolf.stackexchange.com&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/MLbo0.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="737" LastActivityDate="2014-03-29T10:49:15.267" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="1360" PostTypeId="2" ParentId="673" CreationDate="2014-03-29T17:51:18.793" Score="7" Body="&lt;p&gt;Scratch is not absent from PPCG anymore. At least an answer here uses it:&lt;br&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/25014/18921&quot;&gt;Create a Simon Clone!&lt;/a&gt;, &#xA;which brings up the scoring issue again.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I agree with the first proposal  of counting based on blocks and constants, rather than a textual representation.&lt;br&gt;&#xA;The scoring in the latter case would be strongly dependent on the encoding. To reduce that effect one could choose an encoding that minimises the number of characters used, for example assigning a single char to the most used blocks. This solution would likely make the textual representation of the program not very readable and probably give a similar score to that based on 'block counting'. Hence my proposal.&lt;/p&gt;&#xA;" OwnerUserId="18921" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2014-03-29T17:51:18.793" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1361" PostTypeId="1" AcceptedAnswerId="1362" CreationDate="2014-03-30T14:56:29.763" Score="5" ViewCount="195" Body="&lt;p&gt;I posed a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/25003/sort-a-number-sorta&quot;&gt;challenge&lt;/a&gt; and there are a couple answers that could easily be golfed a little more. Is it fair for me, the OP to suggest edits that would help that answer? (Or is there a neutrality rule?)&lt;/p&gt;&#xA;" OwnerUserId="929" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-04-02T02:13:04.497" Title="Is it OK for me to help if I'm the asker?" Tags="|discussion|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1362" PostTypeId="2" ParentId="1361" CreationDate="2014-03-30T15:27:31.960" Score="10" Body="&lt;p&gt;That seems perfectly fine to me, and consistent with the way most users here play. If you've got suggestions to make, make them! I've even suggested improvements when I considered the answer to be a direct competitor to an answer of my own (both in the same language).&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2014-03-30T15:27:31.960" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1364" PostTypeId="2" ParentId="673" CreationDate="2014-03-30T16:38:50.037" Score="3" Body="&lt;p&gt;This was meant to be a comment, but then I realised it was too long.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think we have to take into account sprite definitions and graphics and audio, otherwise it would be very unfair. (I don't really have a suggestion though.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, in &lt;a href=&quot;https://codegolf.stackexchange.com/a/25017/12205&quot;&gt;this answer&lt;/a&gt; of mine, the scripts depend heavily on the costumes of the sprites. It assumes the sprite only has two costumes (hence using &lt;code&gt;next costume&lt;/code&gt; twice reverts back to the original), and it uses these two costumes to create the blinking effect. All these are counted as two bytes. Also, according to this proposed scoring, playing the sound effect is only one byte. This would create a very high advantage and soon perhaps every answer here will be in Scratch.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Besides, this scoring has missed out the use of lists in Scratch. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Gcqqe.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here in the white input field, we can either write a numerical index, or choose one of the two special options, &lt;code&gt;last&lt;/code&gt; and &lt;code&gt;all&lt;/code&gt;. If we are to use the scoring method proposed in the question, I propose that we add 4 and 3 bytes to the use of &lt;code&gt;last&lt;/code&gt; and &lt;code&gt;all&lt;/code&gt; respectively. This applies similarly here:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/PHtMc.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition, I propose that these two should be counted as variable use.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/x07bp.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And this as an operator.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/1NzJt.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, I propose that, if the above scoring is used, subroutines should be counted with the &lt;code&gt;define&lt;/code&gt; block as 1, plus the name of the subroutine, plus one for each call of the subroutine. Example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/avOd1.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here, the purple blocks should add up to 5. (I personally recommend 8, but this is to be consistent with the proposed scoring system.)&lt;/p&gt;&#xA;" OwnerUserId="12205" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2014-03-30T16:38:50.037" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1365" PostTypeId="2" ParentId="1356" CreationDate="2014-03-30T17:19:15.253" Score="9" Body="&lt;p&gt;That's a real challenge, describing what this website is in a clear and small graphic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is my attempt:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/WDln3.png&quot; alt=&quot;CodeGolf&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sources:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The code is GolfScript, taken from &lt;a href=&quot;https://codegolf.stackexchange.com/a/8676/10619&quot;&gt;this answer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://commons.wikimedia.org/wiki/File:Puzzle.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;Puzzle&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://commons.wikimedia.org/wiki/File:Map_symbol_golf_course_02.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;Golf flag&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="10619" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2014-03-30T17:19:15.253" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1366" PostTypeId="2" ParentId="1361" CreationDate="2014-03-30T18:11:46.453" Score="5" Body="&lt;p&gt;Of course it is OK. We try to be a friendly and collaborative bunch. When I see an improvement in another user's solution I point it out rather than writing my own. We I see a different approach, I write my own (time in &quot;real&quot; life permitting, which it hasn't much recently).&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2014-03-30T18:11:46.453" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1368" PostTypeId="2" ParentId="1356" CreationDate="2014-03-31T08:53:49.940" Score="32" Body="&lt;p&gt;Here's my entry:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/6LaKw.png&quot; alt=&quot;PCG ad&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's got the name of the site, a call-to-action, and a cheeky subtitle - all of which you can read without breaking out your base64 decoder or firing up your IDE :)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;GIMP source file is &lt;a href=&quot;https://db.tt/I08bFMzB&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;, the grass texture is in the public domain, and the fonts are all OFL, i.e. freely usable. The image above is a PNG and below the file size limit, as required by the spec, but JPG would be much smaller.&lt;/p&gt;&#xA;" OwnerUserId="19075" LastEditorUserId="19075" LastEditDate="2014-03-31T16:52:17.807" LastActivityDate="2014-03-31T16:52:17.807" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="1369" PostTypeId="2" ParentId="305" CreationDate="2014-03-31T11:10:40.937" Score="10" Body="&lt;p&gt;There's a simple test:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Can I measure how my answer fares against the existing answers before I submit it?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="194" LastEditorUserId="194" LastEditDate="2014-04-01T12:14:05.473" LastActivityDate="2014-04-01T12:14:05.473" CommentCount="5" CommunityOwnedDate="2014-03-31T11:10:40.937" ContentLicense="CC BY-SA 3.0" />
  <row Id="1370" PostTypeId="2" ParentId="1335" CreationDate="2014-03-31T11:37:53.513" Score="2" Body="&lt;p&gt;To get this going I'll just propose a possible wording of the close reason:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The task is &lt;strong&gt;too trivial&lt;/strong&gt;, most answers would be using exactly the same algorithm and only differ in the choice of language.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="3396" LastActivityDate="2014-03-31T11:37:53.513" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1371" PostTypeId="2" ParentId="1356" CreationDate="2014-04-01T00:12:44.690" Score="41" Body="&lt;p&gt;codegolf.SE gone Reddit with a hint of self irony ;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/YfIXL.png&quot; alt=&quot;Imgur&quot;&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/584Jp.png&quot; alt=&quot;Imgur&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="4372" LastEditorUserId="4372" LastEditDate="2014-04-01T02:13:42.410" LastActivityDate="2014-04-01T02:13:42.410" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1372" PostTypeId="2" ParentId="1356" CreationDate="2014-04-01T00:25:45.037" Score="50" Body="&lt;p&gt;This one's a bit retro :-)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/HcdIe.png&quot; alt=&quot;Programming Puzzles &amp;amp; Code Golf&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="11006" LastActivityDate="2014-04-01T00:25:45.037" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1373" PostTypeId="1" CreationDate="2014-04-01T06:07:17.160" Score="7" ViewCount="209" Body="&lt;p&gt;It seems as if my questions either acquire very few answers, and only from the most advanced coders on this site, or many answers from every coder on the site. This implies that my challenges are either very difficult or very easy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How can I craft my challenges so that they are not too difficult and not too easy? In other words, how do I target middle-level coders?&lt;/p&gt;&#xA;" OwnerUserId="9498" LastActivityDate="2014-04-14T12:43:27.767" Title="How do I target middle-level coders?" Tags="|discussion|challenge-quality|asking-questions|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1374" PostTypeId="1" CreationDate="2014-04-01T12:05:32.163" Score="7" ViewCount="247" Body="&lt;p&gt;This is just a small irritation, but there seem to be a number of questions that end with the instruction to 'Have fun!'. I understand that it's just the asker's way of being nice, but can we treat these like the 'Thank you' gets treated on StackOverflow and edit them to delete? This is a site for recreational programming, so I'm here to have fun. If I don't think I will have fun answering a question I'll probably give it a miss.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I just seems a bit redundant. Or am I being terribly anal now?&lt;/p&gt;&#xA;" OwnerUserId="737" LastActivityDate="2014-04-02T21:14:05.033" Title="Do we need to be told to 'Have fun'?" Tags="|discussion|" AnswerCount="2" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="1375" PostTypeId="2" ParentId="2140" CreationDate="2014-04-01T13:39:27.423" Score="1" Body="&lt;h1&gt;A Brief Mystery of Time&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a cron schedule, when will the job next run? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The schedule is supplied as the usual 5 part schedule (to be fleshed out with the full spec). Support for JAN-DEC, SUN-SAT is not required - just numeric schedules - however support for ',','/' and '*' are required. You are not allowed to use the network, or external libraries/programs that implement scheduling - eg using cron itself to schedule a job to return the answer. Your answer should return the result before the time in question. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;eg &lt;code&gt;3-59/15 * * * 0,7&lt;/code&gt; ... should return 3 minutes past midnight next Sunday. Output should be expressed as a human-readable date (not just seconds since the epoch, or fractions of a julian day)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Notes: I had a look, we don't seem to have had cron as a puzzle before. There's going to be some choice of implementations I think-certainly between the Kernhigan cron way of iterating over every minute, or nested loops. A valid answer would be to convert the cron spec to a regexp, iterate over the next few years worth of minutes and match the output of &lt;code&gt;date&lt;/code&gt;, for example. The code in &lt;a href=&quot;http://grepcode.com/file/repo1.maven.org/maven2/org.quartz-scheduler/quartz/2.1.6/org/quartz/CronExpression.java&quot; rel=&quot;nofollow noreferrer&quot;&gt;quartz&lt;/a&gt; shows that you can be amazingly verbose writing this algorithm, but it's not that hard.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As specified, cron will fire at least once every 40 years if the days of the month are valid-28 years if there's no intervening century year. Unsure whether to say that the input will always produce an event, since validation is easy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another variant might be to ensure the solution works for the entire 40 year cycle, by saying the start/date time is input (in some format) and then providing example output. This would save me having to debug the entries, because I could pose the edge cases as tests.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My first try at posing a question. &lt;/p&gt;&#xA;" OwnerUserId="16869" LastActivityDate="2014-04-01T13:39:27.423" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1376" PostTypeId="2" ParentId="673" CreationDate="2014-04-02T00:58:17.367" Score="3" Body="&lt;h1&gt;Position Statement: It is all about bits and bytes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;When golfing the object is to get as small a representation of the program as possible. If something is a computer program, it has to be able to be represented as bytes, and from the computers point of view the size is all about the number of bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even with text programs, the number of bytes is useful. To a normal person &quot;echo e&quot; only has five characters. But it takes 6 bytes so we score it as 6 (unless removing the whitespace does not affect the correctness, in which case the answer is &quot;really&quot; the whitespace free version, and the whitespace has just been added for human readers). If we were to take a more normal definition of characters then virtually every golfing question could be answered in 0 points with &lt;a href=&quot;http://en.wikipedia.org/wiki/Whitespace_programming_language&quot; rel=&quot;nofollow&quot;&gt;Whitespace&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By scoring by bytes, can apply an objective size to any program. Even if non-binary computers become common we don't need a subjective definition of program size. We can prove that a base-n digit has provides exactly log(n)/log(2) times as much information as a (binary) bit.  This information theory also guarantees that if we count bytes we avoid ridiculous cheats in languages implemented prior to the challenge.  For example, if you hardcode every function you can think of as a single operation, then you are going to need multiple bytes per operation and may still not win. If you implement a language where every program can be specified as a single unicode character, you are going to need lots of code code points to specify that one character; again this &quot;cheat&quot; language won't guaranty victory. This theory applies just as well to visual languages as textual.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore it is always reasonable to ask &quot;what is the size of your program in bytes&quot;. For a program to run on a computer it has to exist a bunch of bytes, if your development environment doesn't give you those bytes, that is a limitation of your DE; not a limitation of byte counts as a score nor a limitation of visual languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The only relevant sequence of bytes seems to be the JSON script. It is unnecessarily long, but then Java also has to deal with lots of pointless boilerplate before it will compile.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Factors such as &quot;is this machine generated&quot; vs is it source seem somewhat subjective. Many IDE generate C code, and many 4th Generation Languages treat C as output not as input. Regardless, you should be charged 1 point per 8 bits of information.  &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The proposal does not admit an obvious encoding&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given that every other language has an encoding that can be measured objectively by byte-count, it doesn't seem fair to simply assume the existence of a super-efficient encoding of Scratch. Such an encoding would have to deal with issues such as:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How do you terminate string constants?&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If you add a terminator, you need another byte (and what do you do if the terminator exists in the string constant?)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Can all blocks be defined in a single character? If not, which blocks should be single character?&lt;/li&gt;&#xA;&lt;li&gt;How do you know when a loop ends? An End Loop opcode should do, but there is another byte and when golfing every byte counts.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;A possible efficient encoding&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If we agree than we want to keep scoring programs by their byte count, but want Scratch programs to be able to compete then we need an efficient encoding for Scratch.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have made &lt;a href=&quot;https://github.com/gmatht/joshell/blob/master/misc/GolfScratch.c&quot; rel=&quot;nofollow&quot;&gt;a compiler&lt;/a&gt; for reasonably efficient &lt;code&gt;GolfScratch&lt;/code&gt; encoding, but it still loses a few more bytes here and there. For an example of the language, the above script can be represented in &lt;code&gt;GolfScratch&lt;/code&gt; version 0.12 as follows:       &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;GA&quot;n=&quot;Si0Sn[&quot;answer&quot;]U=Rn&quot;1&quot;[O=%Rn2&quot;0&quot;[SnMRn2][Sn+*3Rn1]Ci1][&quot;say:&quot;Ri&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This &lt;code&gt;GolfScratch&lt;/code&gt; code generates precisely the JSON script above, except without the trailing &quot;]]&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is still pretty concise. I would not be surprised if a initial draft in &lt;code&gt;GolfScratch&lt;/code&gt; rang rings round a final &lt;code&gt;Java&lt;/code&gt; answer. Never-the-less it is a real machine readable specification that whose character count can meaningfully compared to e.g. a specification in &lt;code&gt;GolfScript&lt;/code&gt;. It wasn't optimised for a particular golfing problem, and we know that it can't pack more than 8 bits of information per byte, so it can't be good to the point of being completely broken. It should be able to represent any Scratch program so it is just an efficient encoding, not a completely new language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One could also perhaps define a more readable pythonesque encoding for Scratch that would be useful for explanation and review. &lt;/p&gt;&#xA;" OwnerUserId="19590" LastEditorUserId="19590" LastEditDate="2014-04-03T14:23:37.880" LastActivityDate="2014-04-03T14:23:37.880" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1377" PostTypeId="2" ParentId="1361" CreationDate="2014-04-02T02:13:04.497" Score="1" Body="&lt;p&gt;I think... if you don't know the answerer personally, give them a chance to think a little before you jump in.  Because people will post, then edit, and some of their friends they send it to will offer suggestions, and then they'll edit again... it's that expansion of the people looking at and enjoying the game that makes it fun, and you won't see community expansion if you just jump in before they can do that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it was your challenge you have more at stake and presumably have spent more time contemplating the problem than the answerers did.  You probably wrote a solution before you posed the problem (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/15932/dungeon-construction-set&quot;&gt;at least I did, in this case&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Reasonable rules would seem to be:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Creator of the challenge does not post their implementation until &lt;em&gt;after&lt;/em&gt; they have accepted an answer.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The creator backing off a little and waiting for the dust to settle on a response, maybe a couple of days before commenting, might be prudent.  But you should definitely be able to if you see something that could use improving.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="57" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-04-02T02:13:04.497" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1378" PostTypeId="2" ParentId="1374" CreationDate="2014-04-02T05:00:18.237" Score="3" Body="&lt;p&gt;This reminds me of an anecdote I tell all the time. It used to be the case that cans of soda would have instructions stamped into the top of the can.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;lift tab&lt;/li&gt;&#xA;&lt;li&gt;push back&lt;/li&gt;&#xA;&lt;li&gt;enjoy!&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Now this has always appeared to me to be a sneaky way of disavowing responsibility. If I don't enjoy it, the manufacturer could theoretically tell me to try again and follow all the directions.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2014-04-02T05:00:18.237" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1380" PostTypeId="1" CreationDate="2014-04-02T08:24:42.773" Score="1" ViewCount="94" Body="&lt;p&gt;For a question that is a code trolling, popularity contest, what types of &quot;objective&quot; criteria should be listed in order to prevent the question from being closed?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is &quot;this is a code trolling contest; user with the most votes by X date is the winner&quot; enough?&lt;/p&gt;&#xA;" OwnerUserId="16504" LastActivityDate="2014-04-02T14:31:56.987" Title="What objective winning criteria should be specified for a popularity + code trolling contest?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1381" PostTypeId="2" ParentId="1335" CreationDate="2014-04-02T08:37:45.277" Score="-3" Body="&lt;p&gt;I don't think this is a good idea. While there are definitely a couple of questions here and there that may fit your intention, the problem is that many fine questions might &lt;em&gt;seem&lt;/em&gt; too trivial only to people who are unable to think of an interesting answer. I can easily see this being frequently misused.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Instead, perhaps a &lt;strong&gt;too constrained&lt;/strong&gt; close reason would be clearer, and it would cover your examples without as much possibility for misuse.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The requirements of this challenge are &lt;strong&gt;too constrained&lt;/strong&gt;. For this type of challenge, the rules as stated severely limit the possibilities for potential answers. Requirements of this nature tend to reduce answers to versions of the same algorithm differing only in language.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Even that, I dislike, although I would still find it acceptable. Really, though, there are three very general question types relevant here:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Challenges that work really well.&lt;/li&gt;&#xA;&lt;li&gt;Challenges that are questionable, leading to debates in comments and on meta.&lt;/li&gt;&#xA;&lt;li&gt;Challenges that are obviously very poor.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The first is not an issue. The third is already taken care of with close votes. It's the second that we seem to be concerned with here. However, in reality, it's OK if a few of these stick around on the site for a while. If you see a questionable challenge like this, and you think it is a poor challenge, &lt;strong&gt;down vote it&lt;/strong&gt;. Let the down votes do the speaking for borderline questions. &lt;/p&gt;&#xA;" OwnerUserId="16504" LastActivityDate="2014-04-02T08:37:45.277" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1383" PostTypeId="1" CreationDate="2014-04-02T11:34:21.280" Score="0" ViewCount="517" Body="&lt;p&gt;This question:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/25207/convert-short-month-names-to-their-longer-counterparts&quot;&gt;Convert short month names to their longer counterparts [Ended]&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is going to end up getting closed, based on the close vote rate I see, despite not only meeting every single objective criteria in both tag descriptions...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/tags/popularity-contest/info&quot;&gt;https://codegolf.stackexchange.com/tags/popularity-contest/info&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-trolling/info&quot;&gt;https://codegolf.stackexchange.com/tags/code-trolling/info&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;... but also, based on tone, quality, and number of answers, clearly providing a fun and entertaining challenge for at least a handful of people which, if I'm not mistaken, &lt;em&gt;is the entire point of PCG&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But why was it closed? Because there are a handful of people here that don't particularly enjoy &quot;popularity contests&quot;. That's totally fine, those opinions are reasonable and valid as far as opinions go, but &quot;I don't like popularity contests&quot; is not a valid close reason, and arbitrarily slapping on a nonsensical &quot;too-broad&quot; or &quot;not-objective&quot; (when both are categorically false for this question) doesn't disguise that reason.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Further, not one, but &lt;em&gt;two&lt;/em&gt; people felt that it was both appropriate and productive to go down and downvote every single answer on that question. Whether you like a question or not, punishing every answerer is &lt;em&gt;not&lt;/em&gt; appropriate. &lt;strong&gt;The type of user who does this is the type of user that PCG has catered to through its poorly defined close reasons, tags, and philosophies.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;PCG is a brilliant idea on paper, but its execution has left it one of the desolate corners of the SE network. Granted its still in beta, but it doesn't seem to be progressing like it should.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Personally, I'm going to find enjoyable programming puzzles elsewhere. Not in an &quot;I'm taking my ball and going home&quot; kind of way, but in a &quot;PCG isn't actually all that fun or interesting&quot; kind of way. The problem isn't the overall quality of challenges that people post; the problem is that this site is either unattractive or downright repelling because:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Poorly defined and inappropriate close reasons lend themselves to constant misuse and misinterpretation,&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A poorly defined and narrow philosophy leaves users without a framework for expectations, and so confusion results at a deep level: Fundamental etiquette and purpose concepts are frequently argued about on meta (the kinds of concepts that should have been solidified before PCG even went live, such as &quot;what is the purpose of this site&quot;). Tags exist for question categories that half of the users feel shouldn't belong on the site, and so nobody knows what's actually supposed to go here. There is a clear desire for PCG to be a fun and interesting outlet for code puzzles, and it is constantly suppressed by mismatched and weak expectations and philosophies.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Poor moderation. Most of the moderators that I have seen here strike me as totally great, reasonable, opinionated and highly intelligent people who &lt;em&gt;should probably not be moderators&lt;/em&gt;. Unfortunately, that statement is always going to come across far harsher than I mean it, and I apologize! However, there does not seem to be enough moderator &lt;em&gt;command presence&lt;/em&gt; (as they call it in cop shows); the moderators are more like general opinionated users, which would be fine &lt;em&gt;if they weren't responsible for defining the philosophy and environment of this site&lt;/em&gt;. &lt;strong&gt;The community can't even agree on what kinds of challenges it actually wants on this site, and the moderators really need to be the ones to step up and flat out state what this site is all about; the moderators should -not- be the ones participating in these debates.&lt;/strong&gt; The diamond carries with it a responsibility to set the tone of the site, and users (like me) place a lot of weight on what you have to say; when you can't even clearly define or agree on what this site is about, it manifests as a general lack of coherence, direction, and etiquette in the community you are responsible for.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;In any case, I do have some potential ideas for more organized close reasons and some other general suggestions, but after seeing other people get turned away from this site, and finally experiencing it for myself (and the -2 downvotes on every answer -- you guys should be ashamed, and hey moderators, jump in and adjust those users privileges accordingly, &lt;em&gt;throw it down&lt;/em&gt; for a change  -- &lt;strong&gt;look at the good natured fun and creativity present in every answer on that question, and convince yourself that the PCG philosophy is to stop that in the act, and to create an environment where users downvote those answers&lt;/strong&gt; -- you have a problem that you need to fix if this site ever hopes to get out of beta), I think that my PCG attention span ends at roughly the same point as the period at the end of this sentence.&lt;/p&gt;&#xA;" OwnerUserId="16504" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2014-04-02T17:56:12.583" Title="PCG has potential, but lacks direction" Tags="|discussion|" AnswerCount="3" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1384" PostTypeId="2" ParentId="1383" CreationDate="2014-04-02T12:41:21.980" Score="4" Body="&lt;p&gt;OK, calm down. Have a cup of tea :-)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A few observations:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;PCG is anything but a &quot;desolate corner&quot; of the SE network. The &lt;a href=&quot;http://area51.stackexchange.com/proposals/4570/code-golf-programming-puzzles&quot;&gt;latest stats at Area 51&lt;/a&gt; show that its performance is &lt;strong&gt;excellent&lt;/strong&gt; in all respects, except for the number of questions being asked per day.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There may be a few people who don't like them, but the PCG community is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/812/delete-all-code-trolling-questions&quot;&gt;generally in favour of keeping code-trolling questions&lt;/a&gt;. I certainly don't see any reason to close the question you mentioned.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In fact, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1192/what-does-code-golfs-progress-look-like-right-now&quot;&gt;a recent status report by a Stack Exchange community manager&lt;/a&gt; mentioned that &lt;strong&gt;the appearance of code-trolling questions has greatly improved our site traffic&lt;/strong&gt;, and that &lt;strong&gt;the introduction of new puzzle types should be positively encouraged&lt;/strong&gt;. (I've put those bits in bold text to make sure everyone can see them.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If a question has been unfairly flagged, a brief post to meta can &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/972/why-was-the-analog-clock-popularity-contest-question-deleted&quot;&gt;work&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/852/i-cant-understand-why-my-quesiton-was-closed&quot;&gt;wonders&lt;/a&gt;. There's really no need to rant.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Inexplicable downvotes do happen (someone recently downvoted all the answers to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/24909/kolmogorov-mania&quot;&gt;this question&lt;/a&gt;, for example), but are always kept in check by the other votes. Don't worry about it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="11006" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2014-04-02T12:41:21.980" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1385" PostTypeId="2" ParentId="1383" CreationDate="2014-04-02T12:48:54.947" Score="10" Body="&lt;h1&gt;PPCG in three acts&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Act 1: Happy Times!&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;2011 - Nov. 2013&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Not much traffic on the site, but our small community is happy and thriving, and when a new question is posted it's almost always high-quality and enjoyable.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Act 2: The Dark Era&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Dec. 2013 - Jan. 2014&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/aNzmN.png&quot; alt=&quot;A wild code-trolling appeared!&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Systematic invasion and sneak attack of the site by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;. Within that one fateful month, the site was devastated, with tons and tons of code-trolling &lt;s&gt;trash&lt;/s&gt; posts bombarding the site and new, uncomprehending users blindly upvoting and answering them.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Act 3: This Means War&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Feb. 2014 - Mar. 2014&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In early February, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; was almost completely under control, and had brought out the next ugly beast: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;. Not the tag itself, but the low quality questions, the &quot;I'll just slap on pop-contest and call it a day&quot; type.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So we began a war on popularity contest, and it continues today.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;To address your points in order, now:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&quot;But why was it closed? Because...&quot;: Unfortunately, some users may misunderstand the reason that we're closing some of these, but speaking for myself and probably many other meta regulars, I have not yet cast my close vote on that specific post.&lt;/li&gt;&#xA;&lt;li&gt;&quot;Further, not one, but&quot;: That's quite unusual, and it's certainly a misuse of the voting system, but should you really let two rogue users bother you this much?&lt;/li&gt;&#xA;&lt;li&gt;Item 1 in your list: Only because we need to get some of the &lt;s&gt;trash&lt;/s&gt; low-quality posts off of our site. I'm all for adding a few new custom off-topic close reasons to help with this.&lt;/li&gt;&#xA;&lt;li&gt;Item 2: See Act 2. The flood of new users in December has left the community divided.&lt;/li&gt;&#xA;&lt;li&gt;Item 3: No no no no no. Moderators should do &lt;strong&gt;&lt;em&gt;as little as possible&lt;/em&gt;&lt;/strong&gt;! Moderators are the janitors and the human exception handlers of the site, and I really admire them for being so hands-off and letting the community go its own way. If it weren't for them being so relaxed, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; might not even exist today!&lt;/li&gt;&#xA;&lt;li&gt;&quot;hey moderators, jump in and adjust those users privileges accordingly&quot; - That's not even possible. It's not even possible to find out who those users might be.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think you just need to calm down, step away from the computer for a few hours, and let this cool down for a while. Maybe go outside. It'll help.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="3808" LastEditDate="2014-04-02T17:56:12.583" LastActivityDate="2014-04-02T17:56:12.583" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1386" PostTypeId="2" ParentId="1383" CreationDate="2014-04-02T13:05:21.453" Score="7" Body="&lt;p&gt;First, thank you for voicing your opinion. This is the way in which our community grows, by having its users express what they want and don't want to see here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Second, a community is ever-evolving, and its expectations of what fits the site or doesn't likewise is. In the early days of the site (2011 to 2012), popularity contest questions were not considered acceptable. But since then, such questions have gained popularity (har har), especially with the introduction of code trolling. So whatever opinions I have about popularity contests (and they are well known and frequently articulated), there is no turning back the clock.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Third, there is an important principle about moderation at Stack Exchange. Moderators are supposed to enforce the will of the community, not their own personal opinions and agenda. (Though, of course, moderators are also members of the community and are entitled to have an opinion too.) Furthermore, they are supposed to be generally hands-off, and not get involved in close/delete votes (leaving them to high-rep users instead) unless a post is egregiously off-topic (e.g., &quot;send me teh codez&quot;) or offensive. This is all detailed in &lt;a href=&quot;http://blog.stackoverflow.com/2009/05/a-theory-of-moderation/&quot;&gt;A Theory of Moderation&lt;/a&gt;, which all moderators are expected to abide by:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;We believe deeply in community moderation. That’s why we appoint Pro Tempore Moderators and, ideally, democratically elected community moderators for every site in our network. But what do community moderators do? The short answer is, &lt;strong&gt;as little as possible!&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;(Emphasis in original.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moderators do not have the ability to see who downvoted which post. Serial downvoters (and serial upvoters) are detected by the system automatically on a periodic basis and their votes will be nullified automatically. So such actions have very little long-term effect.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You have clearly thought a great deal about the mechanics of the site, and I appreciate your sharing of these thoughts. Stack Exchange might not be the right venue for implementing these ideas, and I understand your frustration and wish to be elsewhere. I wish you the best, wherever your Internet travels take your next.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-04-02T13:05:21.453" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="1388" PostTypeId="2" ParentId="1380" CreationDate="2014-04-02T14:31:56.987" Score="4" Body="&lt;p&gt;The tag wiki for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; is contradictory:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Unless specified otherwise, the highest-voted answer wins.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Further down:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;In this site, every question must have a clear winning criteria. It is not enough to state that in the problem description, you must add the specific tag too. For code-trolling the winning criteria would normally be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, but this winning criteria &lt;strong&gt;will not be implied&lt;/strong&gt;, so you must manually add it, be it popularity-contest or something else.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I feel the second is a better idea, for clarity's sake, so I've submitted a suggested edit to it to remove the first.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you have both tags, then it's a popularity contest, but it won't hurt to explicitly state &quot;most votes&quot; in the body.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2014-04-02T14:31:56.987" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1390" PostTypeId="2" ParentId="1374" CreationDate="2014-04-02T21:04:51.913" Score="2" Body="&lt;p&gt;If it's just a trite &quot;have fun&quot; then editing out seems fine, like editing off a signature or a &quot;thanks in advance&quot; or anything else wasting screen real estate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But if it encodes some sort of definition of what fun is, and &lt;em&gt;&quot;You know what would be really fun...&quot;&lt;/em&gt; and lays out some ideas for what properties an interesting solution might have, then that's different.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Good to axe the &quot;end-of-paragraph, newline, new paragraph with redundant or no information&quot;.  But don't get in a fight about it.  Cite this meta post in the edit comment.  If the author cares enough about how they come across to put it back then let them.  To put another way: worth a fix but not a fight.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(On SO maybe the &quot;Thanks in advance&quot; warrants a policy fight for everyone's work efficiency, but not with this.)&lt;/p&gt;&#xA;" OwnerUserId="57" LastEditorUserId="57" LastEditDate="2014-04-02T21:14:05.033" LastActivityDate="2014-04-02T21:14:05.033" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1391" PostTypeId="2" ParentId="2140" CreationDate="2014-04-03T04:53:45.060" Score="2" Body="&lt;h2&gt;Collatz ...something&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Collatz_conjecture&quot; rel=&quot;nofollow noreferrer&quot;&gt;Collatz conjecture&lt;/a&gt; states that every natural number &lt;code&gt;n&lt;/code&gt; leads to the number &lt;code&gt;1&lt;/code&gt; if the recursive function &lt;code&gt;f(n)&lt;/code&gt; is applied to it defined as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f(n)=n/2    if n is even&#xA;    =3n+1   if n is odd&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Let &quot;a&lt;sub&gt;i&lt;/sub&gt;&quot; be the value of &lt;code&gt;f&lt;/code&gt; applied to &lt;code&gt;n&lt;/code&gt; recursively &lt;code&gt;i&lt;/code&gt; times so that a&lt;sub&gt;0&lt;/sub&gt; = n , a&lt;sub&gt;1&lt;/sub&gt; = f(n) , a&lt;sub&gt;2&lt;/sub&gt; = f(f(n)) ... a&lt;sub&gt;i&lt;/sub&gt; = f(a&lt;sub&gt;i-1&lt;/sub&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let &lt;code&gt;A&lt;/code&gt; be the set {a&lt;sub&gt;0&lt;/sub&gt;, a&lt;sub&gt;1&lt;/sub&gt;, ..., 1}&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thus, for n=10, we get the sequence&lt;/p&gt;&#xA;&#xA;&lt;p&gt;a&lt;sub&gt;0&lt;/sub&gt; = 10 --&gt; a&lt;sub&gt;1&lt;/sub&gt; = 5 --&gt; a&lt;sub&gt;2&lt;/sub&gt; = 16 --&gt; a&lt;sub&gt;3&lt;/sub&gt; = 8 --&gt; a&lt;sub&gt;4&lt;/sub&gt; = 4 --&gt; a&lt;sub&gt;5&lt;/sub&gt; = 2 --&gt; a&lt;sub&gt;6&lt;/sub&gt; = 1&lt;/p&gt;&#xA;&#xA;&lt;p&gt;and the set &lt;code&gt;A&lt;/code&gt; as &lt;code&gt;A = {10,5,16,8,4,2,1}&lt;/code&gt;   &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a function/program that will accept a set of naturals say &lt;code&gt;I&lt;/code&gt;. You must output a set of numbers say &lt;code&gt;C&lt;/code&gt; such that &lt;code&gt;I&lt;/code&gt; is a subset of the union of the sets &lt;code&gt;A&lt;/code&gt; for all numbers in &lt;code&gt;C&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Network access is forbidden&lt;/li&gt;&#xA;&lt;li&gt;Any of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/standard-loopholes-which-are-no-longer-funny&quot;&gt;standard loopholes&lt;/a&gt; are forbidden&lt;/li&gt;&#xA;&lt;li&gt;Your program must end in less than 200 seconds. You may assume that all the input terms are less than &lt;code&gt;2^(45)&lt;/code&gt;; however note that the individual terms of the collatz sequence can go higher.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;List/array of naturals in &lt;code&gt;I&lt;/code&gt; as an argument to a function&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;,&lt;/code&gt; or &lt;code&gt;space&lt;/code&gt; or &lt;code&gt;\n&lt;/code&gt; separated naturals in &lt;code&gt;I&lt;/code&gt; on &lt;code&gt;STDIN&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;return&lt;/code&gt; a list/array/set of all naturals in &lt;code&gt;C&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;print&lt;/code&gt; all the naturals in &lt;code&gt;C&lt;/code&gt; separated by &lt;code&gt;\n&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your score is calculated as &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;( ( (10)^(number of elements in C) ) * (sum of all elements in C) ) + ceil( 100*log(total number of bytes of your code) )&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;log() is the natural logarithm&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lowest score wins.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;I = { 16 , 32 , 40 }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Possible outputs along with the score&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;C=                   Score&#xA;&#xA;{ 16 , 32 , 40 }     ((10)^(3))*(16 + 32 + 40) = 8000   + constant&#xA;{ 32 , 40 }          ((10)^(2))*(32 + 40)      = 7200   + constant&#xA;{ 32 , 13 }          ((10)^(2))*(32 + 13)      = 4500   + constant --&amp;gt; most optimal         &#xA;{ 1024 , 320 }       ((10)^(2))*(1024 + 320)   = 134400 + constant&#xA;... Infinitely many higher numbers    &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;constant&lt;/code&gt; is &lt;code&gt;ceil(100*log(code length))&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this case, the answer &lt;code&gt;{ 32 , 13 }&lt;/code&gt; is the most optimal. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Note: This is NOT code-golf even though the length of your program is considered. Please also provide a readable version.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm being flexible with the I/O so that the more verbose languages might get some benefit. You can write a complete program or a function or a lambda function. It is not required that your function(if you choose to write one) returns. Using a function for input while printing the output is fine if that makes the code shorter.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This will be tagged as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sandbox feedback&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Can anyone suggest a better title?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;TODO&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Scoring needs specific test cases. Perhaps the final score could be the average of all scores of the test cases.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Needs a proper title. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8766" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2014-04-06T16:42:38.510" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="1392" PostTypeId="1" AcceptedAnswerId="1393" CreationDate="2014-04-03T14:08:56.783" Score="8" ViewCount="393" Body="&lt;p&gt;I haven't seen a discussion on this yet, but I also haven't really seen it &lt;em&gt;used&lt;/em&gt; in answers, so I figured it was worth asking a question for link-reference in the future.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, what's the policy on using URL shortening services to reduce characters for golfs? &lt;a href=&quot;https://codegolf.stackexchange.com/q/25258/14215&quot;&gt;This question&lt;/a&gt; made me think of it. Answers could easily save a bunch of characters, from something like:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/-1?tab=activity&amp;amp;sort=revisions&quot;&gt;https://codegolf.stackexchange.com/users/-1?tab=activity&amp;amp;sort=revisions&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;to:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;http://goo.gl/QKvsEZ&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://goo.gl/QKvsEZ&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I can't point to anything technically wrong with it, but it just feels so... &lt;strong&gt;cheap&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there's no policy yet, what &lt;em&gt;should&lt;/em&gt; it be?&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2018-01-31T02:43:24.337" Title="URL shortener policy" Tags="|discussion|code-golf|rules|" AnswerCount="2" CommentCount="1" ClosedDate="2020-06-17T20:12:31.613" ContentLicense="CC BY-SA 3.0" />
  <row Id="1393" PostTypeId="2" ParentId="1392" CreationDate="2014-04-03T14:32:06.960" Score="8" Body="&lt;p&gt;They have been used in answers in the past: see e.g.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.google.com/search?q=site%3Acodegolf.stackexchange.com+inurl:questions+tinyurl&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.google.com/search?q=site%3Acodegolf.stackexchange.com+inurl:questions+tinyurl&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.google.com/search?q=site%3Acodegolf.stackexchange.com+inurl:questions+goo.gl&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.google.com/search?q=site%3Acodegolf.stackexchange.com+inurl:questions+goo.gl&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.google.com/search?q=site%3Acodegolf.stackexchange.com+inurl:questions+t.co&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.google.com/search?q=site%3Acodegolf.stackexchange.com+inurl:questions+t.co&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There aren't many questions which will generate answers which legitimately include hard-coded URLs. (Some of those previous answers would now fall foul of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1062/194&quot;&gt;standard loopholes&lt;/a&gt;). For the exceptions, I would say that the problem is probably in the question rather than the answers. If hard-coded URLs are useful and not loopholes then that strongly implies that the question isn't taking input, which is a &quot;question smell&quot;.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.817" LastActivityDate="2014-04-03T14:32:06.960" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1395" PostTypeId="2" ParentId="2140" CreationDate="2014-04-03T15:38:51.853" Score="2" Body="&lt;h1&gt;Find words in word square solver&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;On social media I often see images with letters and in them are some positive words for people to find. I challenge you to write a program that finds all words in the puzzle that matches a input dictionary. An example of such puzzle is this one:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/6etd9.jpg&quot; alt=&quot;A letter square&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;An ASCII representation I made of this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;XCUALOVEYKBWSNG&#xA;DUAWKCBEAUTYRJV&#xA;YOUTHFSMGNEZLPR&#xA;MHJREYWDKZLUSTJ&#xA;FSUCCESSDHEALTH&#xA;ENMQXPTIMELMSAQ&#xA;VEXPERIENCEGHBW&#xA;GHUMOURLOYMONEY&#xA;SYZPOPULARITYNA&#xA;AMKCFUNBXHUZYIX&#xA;CWIHYSHAPPINESS&#xA;HONESTYCFRIENDS&#xA;KPYJAETWPOWERQC&#xA;BTYACFREEDOMJMO&#xA;RIWINTELLIGENCE&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Now I imagine we can find words horizontally, vertical and diagonal and all of the mentioned in reverse. The program must be able to take a square and a dictionary &lt;a href=&quot;http://www.curlewcommunications.co.uk/wordlist.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;like this one&lt;/a&gt; and print all the matching words.&lt;/p&gt;&#xA;&lt;p&gt;As a test case I give custom dictionary:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;bar&#xA;bid&#xA;dir&#xA;dog&#xA;fad&#xA;fed&#xA;foo&#xA;god&#xA;man&#xA;mod&#xA;set&#xA;sun&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And a test square:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;OGFIR&#xA;DOMAN&#xA;ODBID&#xA;OPGES&#xA;OGFIR&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your code should be able to print all but the two last words in the dictionary. For diversity you should specify how the cube and the dictionary is bo be entered.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="11290" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-04-03T21:49:40.403" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="1396" PostTypeId="2" ParentId="1335" CreationDate="2014-04-03T20:34:22.460" Score="11" Body="&lt;p&gt;I am divided on the &quot;too trivial&quot; issue, but would find it acceptable if it were worded in a way that is positively constructive to the user receiving it. &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Too Narrow&lt;/strong&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;There are either too few possible ways to answer, or answers would&#xA;  only differ in the language used.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It tells users what went wrong. Some users will see this and explore their options, leading them to learn more about the site. Users that don't like to explore will simply give up and leave, which is hardly a disadvantage, or react negatively, which is a side effect of all close reasons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Credit to Geobits for the &quot;Too Narrow&quot; alternative and some of the reasoning behind it.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastActivityDate="2014-04-03T20:34:22.460" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1397" PostTypeId="1" CreationDate="2014-04-04T05:47:20.453" Score="10" ViewCount="219" Body="&lt;p&gt;&lt;strong&gt;First and foremost:&lt;/strong&gt; I understand that all answers posted on Stack Exchange sites are required to be licensed under &lt;a href=&quot;http://creativecommons.org/licenses/by-sa/3.0/&quot; rel=&quot;nofollow noreferrer&quot;&gt;CC BY-SA 3.0&lt;/a&gt; and that &lt;a href=&quot;http://blog.stackoverflow.com/2009/06/attribution-required/&quot;&gt;attribution is required&lt;/a&gt;. This is less of a licensing question and more of a site content question.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I have a practical problem that demands a creative solution, and I know that some of the most creative programmers frequent PP&amp;amp;CG, solving puzzles and doing gymnastics with code that are far more clever than anything I could come up with.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would it be an acceptable practice for me to post said practical problem as a question, with the intent&amp;mdash;clearly listed as part of the question, of course&amp;mdash;to use the winning solution as part of an open-source project I'm working on?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To provide a little more context, the problem in question would fall into the proposed &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1409/1654&quot;&gt;Data Golf&lt;/a&gt; puzzle category, similar to &lt;a href=&quot;https://codegolf.stackexchange.com/users/15524/geekwithalife&quot;&gt;GeekWithALife&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/questions/19397/smallest-chess-board-compression&quot;&gt;Smallest chess board compression&lt;/a&gt; challenge. The accepted answer would be in the form of a data format, and accompanying code would only be provided as a courtesy.&lt;/p&gt;&#xA;" OwnerUserId="1654" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2014-04-15T23:26:46.627" Title="Is presenting a challenge with the intent of using the best answer in an open-source project okay?" Tags="|discussion|policy|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1399" PostTypeId="2" ParentId="2140" CreationDate="2014-04-04T08:25:27.827" Score="4" Body="&lt;h1&gt;ASCII ART edge detection&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As the title says,  I was thinking to contest in which one must detect edges of an ASCII art.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The code should accept a B/W ASCII art as input.&#xA;A &lt;em&gt;B/W ASCII art&lt;/em&gt; is defined as (by me) an &lt;em&gt;ASCII art&lt;/em&gt; with only one kind of non-white-spaces character (in our case: an asteriks &lt;code&gt;*&lt;/code&gt;). And as &lt;em&gt;output&lt;/em&gt; produce a standard &lt;em&gt;ASCII&lt;/em&gt; art (all &lt;em&gt;ASCII&lt;/em&gt; characters are accepted) which should remember the contourn of the first.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The purpose of using more than one character in the output is to make some edges ssmoother.&#xA;For instance, one could let this input&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;     *** &#xA;   ****&#xA; ******&#xA;******&#xA;****** &#xA; ******&#xA;   ****&#xA;     ***&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;could became:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;      ___&#xA;    _/   ) &#xA;  _/    /&#xA; /      |&#xA;|      /&#xA;|      \&#xA; \      |&#xA;  `\     |&#xA;     \___)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The input &lt;code&gt;\n&lt;/code&gt; separated string as input. Each line has a maximum of &lt;code&gt;80&lt;/code&gt; characters. The number of rows is not specified.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd put it as a &lt;strong&gt;popularity-contest&lt;/strong&gt; since, beside my simple code, I'd like to see more &quot;round&quot; edge detections which use more than one character in smooth edges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, I don't want to tag it as &lt;strong&gt;code-golf&lt;/strong&gt; since I'm quite sure one can do this job using &lt;code&gt;aplay&lt;/code&gt; (with ASCII art renderer) and command line &lt;code&gt;GIMP&lt;/code&gt; (to apply edge detection).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a popularity contest, there are no strict rules on how the output should be..just use your fantasy!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is my sample program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import fileinput as f&#xA;import re as r&#xA;import copy as c&#xA;a,s,p='*',' ','+'&#xA;def read(n):&#xA;    s=[list(' '*n)]&#xA;    for l in f.input():&#xA;        if(len(l)&amp;gt;n):l=l[:n]&#xA;        k=list(r.sub('[^ ^\%c]'%a,'',' '+l+' '))&#xA;        s.append(k+[' ']*(n-len(k)))&#xA;    s.append([' ']*n)&#xA;    return s&#xA;def np(s):&#xA;    s=c.deepcopy(s)&#xA;    for l in s[1:-1]:&#xA;        for w in l[1:-1]: print(w,end='')&#xA;        print()&#xA;def grow(i):&#xA;    o=c.deepcopy(i)&#xA;    for x in range(1,len(o)-1):&#xA;        for y in range(1,len(o[x])-1):&#xA;            if(i[x][y]==a): o[x-1][y-1]=o[x-1][y+1]=o[x-1][y]=o[x+1][y]=o[x+1][y-1]=o[x+1][y+1]=o[x][y+1]=o[x][y-1]=a&#xA;&#xA;    return o&#xA;def diff(i,o):&#xA;    c=[]&#xA;    for x in range(0,len(i)):&#xA;        l=[]&#xA;        for y in range(0,len(i[x])):&#xA;            if(i[x][y]==a and o[x][y]==s): l.append(p)&#xA;            else: l.append(s)&#xA;        c.append(l)&#xA;    return c&#xA;I=read(80)&#xA;np(diff(grow(I),I))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here below I put both input of the programs. It is an 80x70 ASCII ART. It means it has 70 lines of 80 characters, each separated by &lt;code&gt;\n&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;                                              *************&#xA;                                          *****          *****                   &#xA;                                     ******                  ***                 &#xA;                                    ***                         ****             &#xA;                             *********                             **            &#xA;                          ***********                               **           &#xA;                     ******   *******                                **          &#xA;                 *****       *******      ***                         **         &#xA;              ****          ********     *****                          *        &#xA;             **            *********     *****                    *****  *       &#xA;           ***            *********     *******                  ******  **      &#xA;          **             **********     *******                  ******   **     &#xA;         **              **********    *******                  ********   *     &#xA;        *               ***********   ******                    ********   *     &#xA;       **              ************   *****                     ********    *    &#xA;       *               ************    ***                       ********   *    &#xA;      *               *************                               ******    *    &#xA;     *                *************                                 ***     *    &#xA;    **                *************                                         *    &#xA;    *                **************                                         *    &#xA;   **                *************                                         **    &#xA;   *                 *************                                         **    &#xA;  **                *************                                          ***   &#xA; ***                *************                                          ****  &#xA; **                 ************                                           ****  &#xA; **                *************                                           ****  &#xA; **                *************           *****                           ****  &#xA; **                *************          **   **          **              ****  &#xA; **                 ************          *     *         ** **            ****  &#xA; *                  ************          **   **        **   **           ****  &#xA; *                  *************        *******         **   ***          ****  &#xA; *                  ************          *****           *******          ****  &#xA; *                   ************         ***               *****          ****  &#xA;**     *             *************                          ****          *****  &#xA;**    ***            **************                                      *****   &#xA;*    *****            *************                                     ******   &#xA;** *******             **************                                  *******   &#xA;**********             ***************              *                *********   &#xA;**********              *****************          ***             ***********   &#xA;***********              *******************                    **************   &#xA;***********               **********************            ******************   &#xA;************              *****************     **     ***********************   &#xA;*************             ******************      ****     *******************   &#xA;**************            ******************              ********************   &#xA;****************           ******************              *******************   &#xA;***************           *******************              *******************   &#xA;****************           ******************              ******************    &#xA;******************         ******************             *******************    &#xA;*******************         *****************             *******************    &#xA;*********************      ******************           ********************     &#xA;*********************************************          *********************     &#xA;**********************************************       ***********************     &#xA;************************     *****************      ************************     &#xA; **********************       ******************* **************************     &#xA; *********************        *********************************************      &#xA; *********************        ****************************  ***************      &#xA; ********************         **************************    ***************      &#xA; ********************         *********************         ***************      &#xA; *******************          ********************         ****************      &#xA; ******************           *****************            ****************      &#xA; *****************             ****************            ***************       &#xA; *****************             ****************            ***************       &#xA; *****************             *****************           ***************       &#xA;  ****************             *****************           ***************       &#xA;   **************              ******************          ***************       &#xA;                                 ****************          ****************      &#xA;                                  **************            ***************      &#xA;                                                             **************      &#xA;                                                              ************       &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A possible output could be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;                                         +++++             ++++&#xA;                                    ++++++     ++++++++++     +++&#xA;                                   ++      +++++        +++++   +++++&#xA;                            ++++++++   +++++                ++++    ++&#xA;                         ++++         ++                       ++++  ++&#xA;                    ++++++           ++                           ++  ++&#xA;                +++++      +++       +   +++++                     ++  ++&#xA;             ++++     +++++++       ++  ++   ++                     ++  ++&#xA;            ++    +++++   ++        +   +     +                  +++++++ ++&#xA;          +++  ++++      ++         +  ++     ++                ++     ++ ++&#xA;         ++   ++        ++         ++  +       +                +      ++  ++&#xA;        ++  +++         +          +  ++       +               ++      +++  +&#xA;       ++  ++          ++          + ++       ++               +        +++ +&#xA;      ++ +++          ++           + +      +++                +        + + ++&#xA;      +  +            +            + +     ++                  +        ++++ +&#xA;     ++ ++           ++            + ++   ++                   ++        + + +&#xA;    ++ ++            +             +  +++++                     ++      ++ + +&#xA;   ++ ++             +             +                             +++   ++  + +&#xA;   +  +             ++             +                               +++++   + +&#xA;  ++ ++             +              +                                      ++ +&#xA;  +  +              +             ++                                      +  +&#xA; ++ ++             ++             +                                       +  ++&#xA;++  +              +             ++                                       +   ++&#xA;+   +              +             +                                        +    +&#xA;+  ++             ++            ++                                        +    +&#xA;+  +              +             +         +++++++                         +    +&#xA;+  +              +             +        ++     ++        ++++            +    +&#xA;+  +              +             +        +  +++  +       ++  +++          +    +&#xA;+  +              ++            +        + ++ ++ +      ++  +  ++         +    +&#xA;+ ++               +            ++      ++  +++  +      +  +++  ++        +    +&#xA;+ +                +             +      +       ++      +  +++   +        +    +&#xA;+ +                +            ++      ++     ++       ++       +        +    +&#xA;+ +   +++          ++            ++      +   +++         +++     +       ++    +&#xA;  +  ++ ++          +             ++     +++++             +    ++      ++     +&#xA;  + ++   ++         +              +                       ++++++      ++     ++&#xA; ++++     +         ++             +++                                ++      +&#xA;  +       +          ++              ++            +++              +++       +&#xA;          +           +               ++++        ++ ++           +++         +&#xA;          ++          ++                 ++++     +   +        ++++           +&#xA;           +           ++                   +++++ +++++    +++++              +&#xA;           ++           ++                      +++   ++++++                  +&#xA;            ++           +                 +++++  +++++                       +&#xA;             ++          +                  +  +++    +++++                   +&#xA;              +++        +                  ++   ++++++  +                    +&#xA;                +        ++                  +           ++                   +&#xA;               ++        +                   +            +                   +&#xA;                +++      ++                  +           ++                  ++&#xA;                  ++      +                  +           +                   +&#xA;                   +++    ++                 +         +++                   +&#xA;                     ++++++                  +        ++                    ++&#xA;                                             ++     +++                     +&#xA;                                              +    ++                       +&#xA;                        +++++                 ++++++                        +&#xA;+                      ++   ++                   +                          +&#xA;+                     ++     +                                             ++&#xA;+                     +      +                            ++               +&#xA;+                    ++      +                          ++++               +&#xA;+                    +       +                     ++++++ ++               +&#xA;+                   ++       +                    ++      +                +&#xA;+                  ++        +                 ++++       +                +&#xA;+                 ++         ++                +          +               ++&#xA;+                 +           +                ++         +               +&#xA;+                 +           +                 +         +               +&#xA;++                +           +                 ++        +               +&#xA; ++              ++           +                  +        +               ++&#xA;  ++++++++++++++++            +++                +        +                +&#xA;                                ++              ++        ++               +&#xA;                                 ++++++++++++++++          ++              +&#xA;                                                            ++            ++&#xA;                                                             ++++++++++++++&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is also the output produced by the script above. Of course it is not the best output and I'm sure  one can easily produce a smoother one.&lt;/p&gt;&#xA;" OwnerUserId="16992" LastEditorUserId="16992" LastEditDate="2014-04-07T18:37:05.623" LastActivityDate="2014-04-07T18:37:05.623" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="1400" PostTypeId="1" CreationDate="2014-04-04T09:39:49.280" Score="0" ViewCount="54" Body="&lt;p&gt;There was a question (now deleted) which asked for books and resources on Number Theory and Geometry to help with programming competitions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can we make a place for things like this?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It isn't a 'Tips for golfing in language X?' question, but I think it (and similar) might work well in tandem with the others. Perhaps split up Number Theory and Geometry into separate questions?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There has been much discussion in chat and meta about preferring challenges that are not trivial, but remember, &quot;The higher, the fewer.&quot;&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="2381" LastEditDate="2014-04-04T11:47:35.343" LastActivityDate="2014-04-04T13:45:39.010" Title="Broaden the tips tag to cover categorical resources?" Tags="|discussion|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1401" PostTypeId="2" ParentId="1400" CreationDate="2014-04-04T10:27:31.783" Score="7" Body="&lt;p&gt;I don't see it as a good fit, for two reasons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More importantly, is there such a thing as number theory or geometry for programming contests? If it's rephrased as &quot;the number theory or geometry that I'm most likely to encounter in a programming contest&quot; then what the question is really asking for is basic number theory or geometry, the kind of stuff you might encounter in a first-year undergrad course, so the place to ask is either on math.stackexchange.com (for more general textbooks) or cs.stackexchange.com (for more CS-oriented textbooks). If it's &quot;number theory or geometry which might be useful in answering a question on this site&quot;, then that's potentially the whole of number theory and geometry.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Less importantly, I get the impression that the kind of contests the question was about are ones which don't fit our model (short time-limit and no sight of the other contestants' answers), so this isn't really a good place to ask anyway.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-04-04T10:27:31.783" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1402" PostTypeId="2" ParentId="1400" CreationDate="2014-04-04T13:45:39.010" Score="4" Body="&lt;p&gt;Put me down as against. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not a fan of the &quot;tips&quot; genre in the first places, but at least it is tightly coupled to the site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Resource recommendations are a quagmire that expands without bounds. No matter how you try to express rules limiting what can be asked there will be someone who thinks &lt;em&gt;their&lt;/em&gt; question is close enough and it ought to be allowed. In took us more than two years to convince many of the inclusionist-leaning, long-time members of Sack Overflow that some category of question being &quot;useful&quot; didn't make it a good match for the site. The detritus of that experiment can still be seen hanging around with historical locks. Yes, those questions would be popular, but we still don't want them.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2014-04-04T13:45:39.010" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1404" PostTypeId="2" ParentId="1288" CreationDate="2014-04-05T07:57:14.883" Score="-2" Body="&lt;h2&gt;Unspoiled Puzzles&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For challenges in &lt;em&gt;understanding obscure code&lt;/em&gt; as exhibited by the classic &lt;em&gt;C Puzzle Book&lt;/em&gt;, what about a modification of the framework which conceals other answers until you submit an answer (or a correct answer). This might require further deviations of the site format, since voting wouldn't really make sense; it should be replaced by multiple accepted answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The draw for answerers would be: if you solve the puzzle, you get +15 without any need to pander for votes.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2014-04-05T07:57:14.883" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1406" PostTypeId="2" ParentId="1397" CreationDate="2014-04-06T10:14:17.040" Score="5" Body="&lt;p&gt;To give voice to the silence: One can but try. I haven't heard any &quot;mod hammer&quot;, so there's no big negative sentiment clearly. I suppose its success or failure will rest on the merits of the challenge itself. A bounty may help add excitement.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does this constitute a new puzzle-type (data-format-golf?)? If so, maybe explore some of the &quot;meta-&quot;decisions in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1288/lets-create-some-new-types-of-challenges&quot;&gt;new-puzzle-type question&lt;/a&gt;. $.02&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2014-04-06T10:14:17.040" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1408" PostTypeId="2" ParentId="809" CreationDate="2014-04-06T20:08:44.917" Score="4" Body="&lt;p&gt;So after being ignored with more than 70 votes for 2 years on MSO, I flagged &lt;a href=&quot;https://meta.stackexchange.com/questions/136589/on-beta-sites-the-monospace-formatting-in-a-spoiler-quote-is-evil&quot;&gt;this question&lt;/a&gt; for moderator attention on Thursday.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On Saturday, it was fixed. Coincidence? Possibly. Either way, this is great!&lt;/p&gt;&#xA;" OwnerUserId="17249" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-04-06T20:08:44.917" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1409" PostTypeId="2" ParentId="1288" CreationDate="2014-04-06T21:05:11.597" Score="4" Body="&lt;h1&gt;Data Golf&lt;/h1&gt;&#xA;&lt;p&gt;Instead of explicitly providing code, the winner of a Data Golf contest is the participant that can express the data specified in the puzzle using the least amount of space. Because data compression/storage size is often relative to the contents of the data itself, scores would be in the form of &lt;strong&gt;best case/average case/worst case&lt;/strong&gt; bytes per example input, and the asker can choose which case (or combination) is to be used for ranking.&lt;/p&gt;&#xA;&lt;p&gt;If the asker includes specific input data examples, it would be advisable (or can be required by the asker) for the participant to use their storage algorithm to on the examples and post the formatted data and length for each. Simply running data through an off-the-shelf compressor (gzip, bzip2, DEFLATE, et cetera) would be implicitly disallowed in all questions.&lt;/p&gt;&#xA;&lt;p&gt;Participants can choose to include sample code along with the algorithm, but that would be optional unless the asker expressly requires it in the question.&lt;/p&gt;&#xA;&lt;p&gt;An example of a popular question that fits into this format is &lt;a href=&quot;https://codegolf.stackexchange.com/users/15524/geekwithalife&quot;&gt;GeekWithALife&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/questions/19397/smallest-chess-board-compression&quot;&gt;Smallest chess board compression&lt;/a&gt; puzzle.&lt;/p&gt;&#xA;" OwnerUserId="1654" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-04-06T21:14:33.473" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="1410" PostTypeId="2" ParentId="1288" CreationDate="2014-04-06T22:03:43.167" Score="13" Body="&lt;h1&gt;Code reuse&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;What about a type of challenge where you have &lt;em&gt;two&lt;/em&gt; tasks, but your goal is to reuse for your second task as much code from the first task as possible? To avoid just blowing up with pointless code, the total length of the two programs should be taken into account as well. A possible (though probably not the best) metric could be the length of the first program plus the length of the &lt;em&gt;unique&lt;/em&gt; part of the second program.&lt;/p&gt;&#xA;" OwnerUserId="3681" LastActivityDate="2014-04-06T22:03:43.167" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1414" PostTypeId="2" ParentId="2140" CreationDate="2014-04-07T19:11:10.267" Score="4" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;This message is open for anyone to adopt and post to main. For more details, see the &lt;a href=&quot;https://chat.stackexchange.com/rooms/60187/abandoned-challenges-up-for-adoption&quot;&gt;chat room&lt;/a&gt; or &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12792/58826&quot;&gt;meta post&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Ping an IP address continually and report the dropped to returned ratio&lt;/h1&gt;&#xA;&lt;p&gt;Create a console program that pings an IP address at most once per second and reports the ratio of dropped to returned packets to the screen in real time.&lt;/p&gt;&#xA;&lt;p&gt;The IP address will be provided on the command line in standard IPv4 notation.  (eg. 192.168.0.1)&lt;/p&gt;&#xA;&lt;p&gt;The 'ping' method should be ICMP echo (See &lt;a href=&quot;http://www.firewall.cx/networking-topics/protocols/icmp-protocol/152-icmp-echo-ping.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; for a summary of ICMP packet structure) with a packet size of at least 32 bytes.&lt;/p&gt;&#xA;&lt;p&gt;Your program must be &amp;quot;standalone&amp;quot; and cannot rely on external programs, libraries, or resources.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so let the shortest answer win&lt;/p&gt;&#xA;" OwnerUserId="17006" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-09T16:41:28.383" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="1415" PostTypeId="2" ParentId="2140" CreationDate="2014-04-08T07:06:31.170" Score="36" Body="&lt;h2&gt;Waving Hands bot&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a sketch for a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; contest for a game which is much more complicated than the previous questions in this genre. Implementing the test framework will be a lot of work and it will require a lot of debugging, so I want to get feedback on whether the game is too complicated before I start work on that.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Waving Hands (original known as Spellbinder) is a two-player simultaneous-turn-based strategy game. At one level it is quite simple. You have two hands. Each turn you perform an action with each hand. Sequences of actions performed with the same hand create spells, which have varied effects.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first level of complication comes from the number of spells: 42. I don't intend to reproduce a list: there is an online &lt;a href=&quot;http://www.gamecabinet.com/rules/WavingHands.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;rules page&lt;/a&gt; (which is backed up by archive.org should that fallback be necessary).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The second level of complication comes from the interactions between the spells. This is where debugging of the test framework is most likely to be needed. My plan is to allow complaints about the framework's implementation of the rules for a period of two or three weeks or until there are three posted answers, whichever is the later.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At each turn the bot will be provided with a full history (except for moves which the rules say it can't see, which will be so indicated). However, it will not be provided with any other identifying information about its opponent. I think that it will be hard to fingerprint some bots, although probably not all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The framework will probably be written in Java and hosted on github. I intend to provide one or two wrapper classes for non-JVM languages, and a &quot;bot&quot; which brings up a UI for human play, which will be useful for debugging and testing your own bot.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Under the label of fair play, it will be forbidden to attempt to interfere with the opponents or access their memory. A bot may store information about the current game, to save recomputing it each move, but it may not persist information between games. Competitors may submit more than one bot, but they must be independent: i.e. no submitting bots whose purpose is to help your favoured bot win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To reassure anyone who's worried about copyright: the creator of the game &lt;a href=&quot;http://mud.co.uk/richard/spellbnd.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;has stated&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I retain full rights to the game, and if any commercial incarnation appears then I want a royalty! I have no objection to people implementing or running derivatives of the Spellbinder so long as they make no money from it, though.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Normally upvotes in the sandbox indicate that you think the question is ready to post. This one clearly isn't. However, please upvote it if you think that the outlined proposal would make a good question. If there's enough support, I will create a separate sandbox answer when the test framework is ready for early criticism.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-04-08T07:06:31.170" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="1416" PostTypeId="1" CreationDate="2014-04-08T18:03:54.867" Score="7" ViewCount="534" Body="&lt;p&gt;Basically, what the title says. Is creating a new language specifically for Golfing, with some predefined names and imported methods (I'm talking about my &lt;a href=&quot;https://gist.github.com/Synthetica9/9796173&quot; rel=&quot;nofollow noreferrer&quot;&gt;PYG language&lt;/a&gt;, but there are possibly others affected), illegal (or considered any other kind of wrong)? I'd like to hear your opinions on this, since there hasn't been a clear statement on the topic.&lt;/p&gt;&#xA;&lt;p&gt;The specific answer I'm talking about is this one:&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/25461/merge-two-sorted-lists/25480#25480&quot;&gt;Merge two sorted lists&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="18638" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-04-09T23:02:18.347" Title="1 on 1 language mappings &quot;legal&quot;?" Tags="|discussion|policy|rules|" AnswerCount="3" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="1417" PostTypeId="2" ParentId="1416" CreationDate="2014-04-08T22:08:23.160" Score="8" Body="&lt;p&gt;As the creator of &lt;a href=&quot;https://github.com/hostilefork/rebmu&quot; rel=&quot;nofollow&quot;&gt;Rebmu&lt;/a&gt; I am of course a bit biased to say &quot;no&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(Note that is a language that is actually in it to golf for the long haul.  I want to get it refined to the point of a feature-freeze, and package it with its host as a &lt;a href=&quot;http://rebolsource.net&quot; rel=&quot;nofollow&quot;&gt;half-megabyte&lt;/a&gt; single cross-platform interpreter.  Then I'll take on any other languages...golf-specific or not...in the only way to play &quot;golf&quot;: in several consecutive &quot;holes&quot;!)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I do think the thing that should be discouraged is &quot;uninterestingness&quot;, and agree with @Geobits to say that's pretty much in the eyes of the downvoters.  Making a language called 99b to print 99 bottles or not, which is sensitive only to the first bit in the input and claiming you wrote a 1 bit program, is not what I would call not interesting or funny.  But such answers aren't common enough to worry about needing a rule besides downvotes for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One thing I've asked in general that if anyone is going to post a Rebmu solution that is not substantially different than its corresponding Rebol, to just include that in the Rebol answer and not post it separately.  Just present the character counts in the heading as &lt;strong&gt;Rebmu (x chars) / Rebol (y chars)&lt;/strong&gt;.  I should probably mention that in the README.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;UPDATE:&lt;/strong&gt; I will mention my agreement with @luserdroog that whatever your solution, others should be able to independently verify that it actually solves the problem.  If you invent a language and want to submit it as your solution form, it needs a GitHub and toolchain etc.  That's a bar for effort that at least keeps solutions from being insincere enough to not even exist.  The &quot;99b&quot; language above should be allowed and voted on if people like it or don't, but just saying &lt;em&gt;&quot;in my theoretical language called 99b&quot;&lt;/em&gt; and never taking the time to write said language might be decent grounds for deletion.&lt;/p&gt;&#xA;" OwnerUserId="57" LastEditorUserId="57" LastEditDate="2014-04-09T23:02:18.347" LastActivityDate="2014-04-09T23:02:18.347" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1418" PostTypeId="1" CreationDate="2014-04-09T05:04:14.087" Score="3" ViewCount="100" Body="&lt;p&gt;I'm making a puzzle involving a 2D ASCII input and some moves.  So in the spirit of this rotating maze:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://stackoverflow.com/questions/3034331/code-golf-rotating-maze&quot;&gt;https://stackoverflow.com/questions/3034331/code-golf-rotating-maze&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But in thinking about solving puzzles like that, I find &quot;looking for the ball&quot; to be kind of annoying to tackle on every problem of that form.  Especially a tougher one.  I kind of wish the coordinates were in the input.  Yet having the input show the ball and the holes in the maze as characters is much clearer visually in understanding the puzzle.  Compare:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;###########&#xA;#o        #&#xA;# ####### #&#xA;###@      #&#xA;  #########&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;To:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 1&#xA;###########&#xA;#         #&#xA;# ####### #&#xA;###@      #&#xA;  #########&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;From people who've solved such things--is it more or less fun if the ball location is given as a coordinate out of band from the maze, or if you have to look for it?  Further on the spectrum: imagine also if there were several holes, and those being in a list at the end, or somehow entered with a delimiter of some kind.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it part of the fun of something like this to have to &quot;pre-process&quot; the input yourself so the map looks good in the sample input?&lt;/p&gt;&#xA;" OwnerUserId="57" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2014-07-09T14:08:35.547" Title="How much to put in the ASCII 2D input for puzzles vs provide as coordinates in input?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1419" PostTypeId="1" CreationDate="2014-04-09T09:47:59.967" Score="-3" ViewCount="81" Body="&lt;p&gt;If we were to make popularity contests &quot;Protected&quot;, new users would be obliged to answer at least one other question before having &quot;fun&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't have the energy to enumerate what problem this attempts to solve, but it seems like it could help with the &quot;have cake/eat cake&quot; dilemma as it pertains to pornographic programming.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2014-04-09T11:53:00.850" Title="How about *Protecting* the Pop Contests?" Tags="|discussion|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1420" PostTypeId="2" ParentId="1416" CreationDate="2014-04-09T09:55:30.010" Score="12" Body="&lt;p&gt;As elaborated in the comments, the complete list of rules (which applies to libraries too) of which I am aware are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The language (or library) must have existed prior to the challenge. &lt;em&gt;This is to prevent the no-longer-funny loophole where you factor-out your entire program and call it a new language.&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;An interpreter/compiler should be freely available. &lt;em&gt;This is somewhat relaxed for available-but-not-free languages, for which some output or screenshot is usually desirable if not required.&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Aside from that, all's fair, AFAICT.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2014-04-09T09:55:30.010" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1421" PostTypeId="2" ParentId="1419" CreationDate="2014-04-09T10:07:19.100" Score="3" Body="&lt;p&gt;I don't think that is really necessary, because there are also some poor posts from users with more than 10 reputation points, and these users can still post answers to protected questions. Also, I have looked at some popular popularity contests, and there are not that much poor posts from new users.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you see a popularity-contest that has many poor answers from new users, then protect it. But I don't really see a reason to protect &lt;em&gt;all&lt;/em&gt; popularity contest, even the ones without poor answers.&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="9275" LastEditDate="2014-04-09T11:51:57.213" LastActivityDate="2014-04-09T11:51:57.213" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1423" PostTypeId="2" ParentId="1419" CreationDate="2014-04-09T11:53:00.850" Score="6" Body="&lt;p&gt;Well, I see several problems with this:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You can't protect things that are less than a day old&lt;/li&gt;&#xA;&lt;li&gt;If you protect too many things, there's no point in even having a protection system anymore&lt;/li&gt;&#xA;&lt;li&gt;We really don't want to lock out new users too much; in fact, new users are key to expanding our community&lt;/li&gt;&#xA;&lt;li&gt;Not all bad answers to pop-contests are from new users&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;etc.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-04-09T11:53:00.850" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1424" PostTypeId="2" ParentId="1416" CreationDate="2014-04-09T13:32:32.227" Score="8" Body="&lt;p&gt;Personally (obviously), I'm not a fan. In my opinion it goes against the spirit of challenging yourself to get a lower byte count if the language you're using is an existing language with the keywords shortened. In my eyes the only difference between that and using a language specifically designed to solve the challenge in a single character (e.g. HQ9+ for &quot;write a quine&quot;) is scale.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I wouldn't support a rule against these languages. My idea of what constitutes a &quot;good answer&quot; isn't universal. If I downvote an answer because I don't like it but it gets a positive score overall, then it's a good answer. So sayeth the community, pretty much the only entity around here with an opinion that matters. I'm part of the community, so I throw my vote in, but your opinion of &quot;this is 100% okay&quot; is exactly as valid as mine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The other(, less important,) reason is that it would be really, really difficult to make a &lt;em&gt;fair&lt;/em&gt; rule. I don' think it's a good idea anyway, but even if I did: Where do you draw the line? Informally, in my head, I think about it the way I mentioned in the comments on your answer: The commands map 1-to-1 with the commands of another language. But that doesn't really work if you try to formalize it.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;As I understand it (it's possible that I'm very wrong) a significant number of J commands are taken directly from APL. Is J a valid language?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In PYG, &lt;code&gt;R&lt;/code&gt; literally means &lt;code&gt;range&lt;/code&gt;. They're the same thing. But &lt;code&gt;P&lt;/code&gt; doesn't meant &lt;code&gt;print&lt;/code&gt;. &lt;code&gt;P&lt;/code&gt; means &quot;print every argument to this function&quot;, a construct that doesn't exist by default in python. You have to define it in python, but in PYG it's already there. How much of a language has to be taken from another before it becomes invalid?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I'm not convinced that these are answerable questions, objectively. I have ideas of what I like and don't like, but it wouldn't even be possible to make those ideas into fair rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So while I don't personally like languages like PYG, I don't think we &lt;code&gt;{sh,c}&lt;/code&gt;ould have rules against them. People will upvote what they like and downvote what they don't, and at least for now that seems to be working out (for this specific issue, at least).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On a more personal note, sorry for starting shit in the comments on your answer. Almost all of the time, I downvote for this kind of thing silently (I know that you're supposed to leave a comment explaining how the answer could be improved, but &quot;use a different language&quot; doesn't seem constructive), but I was truly conflicted by my inability to upvote your python answer and downvote your PYG one.&lt;/p&gt;&#xA;" OwnerUserId="14509" LastActivityDate="2014-04-09T13:32:32.227" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1425" PostTypeId="2" ParentId="2140" CreationDate="2014-04-09T18:46:32.833" Score="1" Body="&lt;p&gt;Note to sandbox readers: Things I am especially looking for input on are in bold.&lt;/p&gt;&#xA;&lt;h1&gt;David and Goliath&lt;/h1&gt;&#xA;&lt;p&gt;You are David, fighting Goliath in a turn based game. Can you kill Goliath?&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Goliath is big. He is a &lt;em&gt;3x3&lt;/em&gt; monster, and fast... but not very maneuverable.&lt;/li&gt;&#xA;&lt;li&gt;David is maneuverable, but not very fast. He does have a slingshot, though.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Goliath's turn&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Goliath may only move in a straight line, up, down, left, right, or 45 degree diagonal (e.g. up and to the right)&lt;/li&gt;&#xA;&lt;li&gt;On Goliath's turn, if he has not tripped, he may speed up, slow down, turn, or continue.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Continue: Goliath goes in the same direction at the same rate.&lt;/li&gt;&#xA;&lt;li&gt;Speed up: Goliath keeps going in the same direction, but one more square than his previous speed.&lt;/li&gt;&#xA;&lt;li&gt;Slow down: Goliath keeps going in the same direction, but one fewer square than his previous speed.&lt;/li&gt;&#xA;&lt;li&gt;Turn: As &lt;em&gt;slow down&lt;/em&gt;, except Goliath also turns 45 degrees.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Speed zero exception:&lt;/em&gt; there is no such thing as speed zero. If Goliath moved at speed 1 in any direction last turn, he may move at speed 1 in any other direction he chooses.&lt;/li&gt;&#xA;&lt;li&gt;If Goliath has tripped, it takes him 1 turn to stand up. &lt;strong&gt;Make sure to read David, but basically I don't want it to be possible to stunlock Goliath. This needs work, suggestions appreciated&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Goliath is &lt;em&gt;greedy&lt;/em&gt;. He will move whatever move gets his center square to be the shortest distance in total squares from David. Ties will be broken in the following order:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Goliath is an angry beast, he always wants to move faster if he can. He will move at the fastest possible speed. &lt;em&gt;Note:&lt;/em&gt; this is only used to break ties. If his speed is 4 and he is exactly 3 squares away from David, he will move 3 squares.&lt;/li&gt;&#xA;&lt;li&gt;Goliath prefers not to turn.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;David's turn&lt;/h2&gt;&#xA;&lt;p&gt;This is where your ingenuity comes in. It is your job to program a David algorithm (&lt;strong&gt;Is this too much? Would a user interface be a better question?&lt;/strong&gt;) to defeat Goliath.&lt;/p&gt;&#xA;&lt;p&gt;Here are David's movement rules:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;David may move 1 square in any direction, OR&lt;/li&gt;&#xA;&lt;li&gt;David may aim&lt;/li&gt;&#xA;&lt;li&gt;David may shoot, if he aimed last turn.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Other details&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All distances in this problem are considered &lt;a href=&quot;http://en.wikipedia.org/wiki/Chebyshev_distance&quot; rel=&quot;nofollow noreferrer&quot;&gt;Chebyshev Distance&lt;/a&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Animating the game in text or curses, etc. should look similar to a roguelike.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Bullets move effectively instantaneously. However, they will only trip Goliath if they are lined up with his center square&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Bullets only move in straight lines (the same way Goliath moves?) Is this best?&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Every time you shoot Goliath, he takes one damage.&lt;/li&gt;&#xA;&lt;li&gt;It takes 3 bullets to kill Goliath. (&lt;strong&gt;Or more? or less?&lt;/strong&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Goliath will kill David if any part of him overlaps with David's square.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;The game board&lt;/h2&gt;&#xA;&lt;p&gt;David and Goliath are fighting on the surface of a Torus (i.e. a flat map that wraps east-west and north-south). Goliath CAN see over the edge of the game board.&lt;/p&gt;&#xA;&lt;h2&gt;Your job:&lt;/h2&gt;&#xA;&lt;p&gt;Animate a map where we can see David fight Goliath with an 80x80 map and random (&lt;strong&gt;could be too much luck?&lt;/strong&gt;) starting locations (maybe guarantee David is at least some number of squares from Goliath)&lt;/p&gt;&#xA;&lt;h2&gt;Scoring:&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Not sure here:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Most kills in 10000 turns?&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Fastest kill?&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Golf of a program that animates and shows a combat between David and Goliath where David wins?&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Other concerns:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;I'm concerned David is too slow. That's why I thought of tripping, but it may not be enough&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;I would prefer to tweak the rules so that not everyone comes up with the same or similar strategies&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;ALL input is appreciated, from minor changes to big ones.&lt;/p&gt;&#xA;" OwnerUserId="17249" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-04-10T20:35:54.850" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="1426" PostTypeId="2" ParentId="1418" CreationDate="2014-04-10T13:20:31.687" Score="1" Body="&lt;p&gt;I think it's good to have a mixture of styles.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Problems for which this question arises will tend to be simple graph problems at their core, so a typical solution will go through stages:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Parse the input&lt;/li&gt;&#xA;&lt;li&gt;Build the graph&lt;/li&gt;&#xA;&lt;li&gt;Solve the graph problem&lt;/li&gt;&#xA;&lt;li&gt;Format the output&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The last step is nearly always trivial. The actual graph problem is usually trivial: unless there are tight performance requirements, brute force is probably good enough. So it's not uncommon for the most interesting part to be parsing and building the graph.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there's an existing question with the same underlying graph problem, you should either ditch your idea or acknowledge that the parsing and graph-building is the interesting part and try to design the question such that it will be the major part of the answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it's a novel graph problem then you have more flexibility. Not everyone has the same tastes, so feel free to follow your own taste, to deliberately take the opposite choice to the most recent popular similar question, or to decide based on factors like the length of the test cases. If you think it would help people visualise or analyse the problem then you could include a simple program to convert between list-of-integer format and 2D format, which should be a couple of lines in a high-level language.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-04-10T13:20:31.687" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1427" PostTypeId="2" ParentId="1392" CreationDate="2014-04-10T14:50:07.670" Score="3" Body="&lt;p&gt;I think that in questions which require you to access a certain webpage, you should be allowed to access &lt;em&gt;that webpage only&lt;/em&gt;, because we don't allow external resources &lt;em&gt;unless stated otherwise&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A URL shortener is an external resource (it stores the URL of the page it redirects to), so &lt;strong&gt;like all external resources it should be banned unless the question explicitly says so&lt;/strong&gt;.&lt;/p&gt;&#xA;" OwnerDisplayName="user16402" LastActivityDate="2014-04-10T14:50:07.670" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1428" PostTypeId="1" CreationDate="2014-04-10T18:38:23.583" Score="8" ViewCount="403" Body="&lt;p&gt;The King of the Hill tag could use a &amp;quot;Suggestions&amp;quot; section to help posters avoid pitfalls that are KotH specific. It could also use a tip on what does NOT constitute a KotH challenge, since I have seen newbies using it incorrectly.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Note that just because all submissions are competing against each&#xA;other does not make it a King of the Hill challenge. The submissions&#xA;must interact. For example, a challenge where are submissions are&#xA;all competing for smallest code size would be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, not King of the Hill.&lt;/p&gt;&#xA;&lt;h1&gt;Suggestions for a Smoother Competition&lt;/h1&gt;&#xA;&lt;p&gt;Unless you &lt;em&gt;want&lt;/em&gt; participants to abuse a particular aspect of the&#xA;challenge (which is often the case), consider using the following&#xA;restrictions to close loopholes that are specific to King of the Hill&#xA;challenges. See &amp;lt;&lt;em&gt;insert help page here&lt;/em&gt;&amp;gt; for suggestions that&#xA;apply to &lt;em&gt;all&lt;/em&gt; challenges.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Allow one submission per user.&lt;/li&gt;&#xA;&lt;li&gt;Restrict access to other submissions and any data they may generate.&lt;/li&gt;&#xA;&lt;li&gt;Restrict modifications to standard libraries.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Explanation:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;If multiple submissions come from a single user, then the challenge can degrade to &amp;quot;Who can submit the most answers&amp;quot;. It is in the user's best interest to write many submissions that help him achieve his goal of winning.&lt;/p&gt;&#xA;&lt;p&gt;Submissions can cripple other submissions if given access to their code, their data, or the standard library. You might argue that other submissions could react, but then it really boils down to whose code gets run first. If I go first, then &lt;a href=&quot;http://en.wikipedia.org/wiki/Strategy-stealing_argument&quot; rel=&quot;nofollow noreferrer&quot;&gt;I win by stealing your strategy&lt;/a&gt;. If changing the order of the submissions also changes the results, then your spec has a serious problem.&lt;/p&gt;&#xA;&lt;p&gt;Another argument might be, &amp;quot;A perfect controller program would enforce these restrictions in code.&amp;quot; The counterargument is that a perfect controller can only be written by a perfect programmer. The point of King of the Hill is not to pit the author against the masses.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Things I don't know how to address:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I do not know how to objectively stop multiple users from collaborating, or one user with multiple accounts. Does anyone have a suggestion that would allow someone to objectively determine whether a submissions was collaborating? Is this even a fixable problem? &lt;a href=&quot;https://gamedev.stackexchange.com/q/73229/44459&quot;&gt;Let's see what the Game Development people think&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-05T11:59:14.120" Title="Improve and Expand the KotH Tag" Tags="|discussion|tags|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1429" PostTypeId="2" ParentId="1428" CreationDate="2014-04-10T19:25:40.260" Score="-1" Body="&lt;p&gt;In those games where there is a order of play (the iterated prisoner's dilemma and similar situations do not have an order of play) the strategy stealing argument can be broken play playing not just all unique pairing but all (unique pairing)x(orders of play), and I would argue that the controller is ill-designed if it does not do so.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The multiple supporting entries business is perhaps more interesting---the iterated prisoner's dilemma is a game where &quot;cooperating&quot; strategies can re-enforce one another and defecting strategies risk sabotaging each other, but a lone wolf among the sheep can really clean up---but have we actually had a problem with that?  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Not that I am discouraging you from offering a edit to the tag-wiki, but I think the solution to the order-of-play issue is clear and well defined and the other has not yet been an issue.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2014-04-10T19:25:40.260" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1432" PostTypeId="1" CreationDate="2014-04-11T16:55:39.357" Score="-1" ViewCount="70" Body="&lt;p&gt;Consider this question - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/15412/spell-it-per-the-nato-spelling-alphabet&quot;&gt;https://codegolf.stackexchange.com/questions/15412/spell-it-per-the-nato-spelling-alphabet&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The 4 downvotes confirm that it is a bad question but there isn't a specific enough reason in the close-vote box.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's not a duplicate&lt;/li&gt;&#xA;&lt;li&gt;It's not off-topic. It does have an objective winning criterion (code-golf)&lt;/li&gt;&#xA;&lt;li&gt;The main requirement is clear enough.&lt;/li&gt;&#xA;&lt;li&gt;It's not too broad.&lt;/li&gt;&#xA;&lt;li&gt;It's not opinion based.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The correct reason IMO would be &quot;Not well-defined&quot; since the question lacks specific IO requirements.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I guess that leaves the &quot;other&quot; option in off-topic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we have a close-reason of the type &quot;Requires stricter rules&quot;/&quot;Not well-defined&quot; for questions like these?&lt;/p&gt;&#xA;" OwnerUserId="8766" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-04-11T19:28:58.597" Title="Should we have a vote-to-close reason as &quot;Not well-defined&quot;?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1433" PostTypeId="2" ParentId="1432" CreationDate="2014-04-11T19:28:58.597" Score="8" Body="&lt;p&gt;If the specification is unclear---like say the IO requirement is underspecified---then why not go with &quot;unclear what you are asking&quot;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You seem to have dismissed that as a reason because &quot;the main requirement&quot; was clear, but the thing is that if you were specifying a bit of coding without saying how it would interact with the rest of the system you would be more likely to get something that &lt;em&gt;did not&lt;/em&gt; do what you intended as to get something that did.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Writing specs is a skill and takes attention to detail.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My personal (that is, not diamond powered) opinion that the challenge has to be clearly specified before it is clear, and that includes things like &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;sub-program versus stand-along code&lt;/li&gt;&#xA;&lt;li&gt;input and output formats&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For real code it includes things like exception behavior and error handling too, but we usually allow [code-golf] entries to cut corners in those areas.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Still going with my opinion...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The thing I have found most frustrating about a lot of challenges on the site recently has been how little effort authors have been putting into them. Some of them are less specified then the problem in a &quot;learn to program&quot; book, and wouldn't be treated as appropriate for scrawling on a cocktail napkin over drinks by serious programmers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ghaw! Err! &lt;em&gt;::gnashing of teeth::&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2014-04-11T19:28:58.597" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1434" PostTypeId="1" CreationDate="2014-04-12T17:31:44.813" Score="-20" ViewCount="858" Body="&lt;p&gt;I invented a new programming language, called CodeGolfSolver. When running a program, it converts the characters to digits in base &lt;code&gt;1114111&lt;/code&gt;, interprets it as a number, and solves the problem described at the url &lt;code&gt;codegolf.stackexchange.com/questions/&amp;lt; number in base 10 here &amp;gt;&lt;/code&gt; at the date depending upon the version (see note). in an optimal manner. Example Program&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;摦&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This program is capable of detecting the &lt;a href=&quot;http://heartbleed.com&quot; rel=&quot;nofollow&quot;&gt;heartbleed exploit&lt;/a&gt;. My question is: Are we allowed to use the programming language &lt;code&gt;CodeGolfSolver&lt;/code&gt; to solve challenges on this site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note: There are different versions. For example, CodeGolfSolver-2014-4-12 is based on the codegolf site as of 2014/4/12. Compilers and intrepreters are recommended to make copies of the site for each version they support.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note: This post itself is an interpreter in the &lt;a href=&quot;http://esolangs.org/wiki/English&quot; rel=&quot;nofollow&quot;&gt;English programming language&lt;/a&gt;. It is freely available.&lt;/p&gt;&#xA;" OwnerUserId="16842" LastEditorUserId="16842" LastEditDate="2014-04-12T18:02:51.340" LastActivityDate="2017-06-05T23:31:00.603" Title="Is this language allowed?" Tags="|discussion|rules|" AnswerCount="2" CommentCount="6" ClosedDate="2020-06-18T00:14:54.330" ContentLicense="CC BY-SA 3.0" />
  <row Id="1435" PostTypeId="2" ParentId="1434" CreationDate="2014-04-12T17:36:59.333" Score="20" Body="&lt;p&gt;... could you just use common sense?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;If you seriously actually need an enumeration of why exactly this is invalid (which I doubt):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;you need to provide a working, freely available interpreter, which means solving every single challenge on the site&lt;/li&gt;&#xA;&lt;li&gt;languages (including versions of languages) created after the challenge are invalid&lt;/li&gt;&#xA;&lt;li&gt;it's cheating (obviously) and you'll get showered in downvotes&lt;/li&gt;&#xA;&lt;li&gt;it also violates one of the &quot;standard loopholes,&quot; specifically &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1085/3808&quot;&gt;https://codegolf.meta.stackexchange.com/a/1085/3808&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2014-04-12T17:42:36.387" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1436" PostTypeId="2" ParentId="1373" CreationDate="2014-04-13T23:07:53.350" Score="6" Body="&lt;h1&gt;Middle level may not be a realistic target&lt;/h1&gt;&#xA;&lt;p&gt;It is difficult to aim for a specific mid range ability level. The problem is that someone who is middle level in one aspect may be unfamiliar with another aspect, and an experienced expert in yet another. While there are some admirable people who happen to be good at everything, most people have strengths in certain areas and weaknesses in others. This means that if you ask what you consider to be a middle level question, it may turn out to be far too easy or far too difficult for the majority of users.&lt;/p&gt;&#xA;&lt;p&gt;Instead I would recommend trying to create questions which appeal to a broad range of abilities. Perhaps a question where a technically correct answer is trivial to produce, but an answer which can compete with the best requires far more.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/25314/predict-where-the-man-will-go&quot;&gt;question you linked to&lt;/a&gt; in a comment under your question has a bonus if the running time is independent of n. Having this as a bonus rather than a requirement allows people to join in even if they can't meet the condition (you can see that some have in this case). This encourages more answers while still keeping it challenging for those who want to seek the bonus. In particular, I imagine that having some lower level answers included will encourage new users or browsers to start submitting answers of their own, even if they are not yet confident.&lt;/p&gt;&#xA;&lt;p&gt;I like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; competitions for this reason - at the start even the least knowledgeable of users can submit a simple answer which will do well in the early environment. Then other users can aim to beat the simple early answers, which some people find less off-putting than trying to come up with an optimal solution immediately. For example, questions like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/22494/the-tic-tac-toe-games&quot;&gt;n-d tic tac toe&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/25347/survival-game-create-your-wolf&quot;&gt;create your wolf&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Gradually growing solutions&lt;/h1&gt;&#xA;&lt;p&gt;Also bear in mind that someone who has the skill and imagination required to create the best solution to your question may not submit an answer at all unless they are first drawn in by the idea of a &amp;quot;quick solution&amp;quot;. Just because they are capable of an elaborate solution doesn't necessarily mean they will want to spend that much time on your question when they first see it and it is a stranger to them. If you design your question to allow quick rough solutions then such imaginative people may be tempted to throw a solution together in 10 minutes, which will get them interested and familiar with the problem. From there they might decide to improve their solution as others are submitted that beat it. Eventually they may submit the full spectacular solution that they might never have written if not for the initial rough attempts.&lt;/p&gt;&#xA;&lt;p&gt;This effect can be strengthened by providing an easy to beat answer as an example. This can be done in a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; contest by providing an example solution which anyone can beat. In a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge you could post example source code. As well as making absolutely clear what is required, seeing the source code is also likely to spur people on to beat it. In both types of competition, once the answers that beat the example start coming in, the difficulty will start to increase leading to the really interesting answers.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Edit&lt;/strong&gt;: Following the good advice in Peter Taylor's comment below, I no longer recommend including the example in the question. Simply submit it as an answer. If you refer to it in the question you may want to include a link, as the example answer isn't likely to stay at the top for very long...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Asking good questions is a real challenge&lt;/h1&gt;&#xA;&lt;p&gt;Some questions will have one easy answer and no potential to improve on it. Others will have a huge variety of fascinating different potential approaches. It's hard to give a guide to how to create questions that allow for varied approaches because it requires the same creativity to distinguish between such questions as it does to answer them. That is, sometimes the only way to find out if a variety of approaches is possible is to show the question to the community. Seeing the potential for a variety of different approaches as just one person is more difficult...&lt;/p&gt;&#xA;&lt;p&gt;This is why asking a good question on &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;Programming Puzzles and Code Golf&lt;/a&gt; is much harder than asking a good question on other Stack Exchange sites. When you find it difficult, that is because it &lt;strong&gt;is&lt;/strong&gt; difficult. Don't let this discourage you - a constant supply of good questions is what makes this site work. If you think of a question and you're not sure if it will attract good quality answers, submit it and find out - either as a question or search for sandbox in meta if you want guidance first. I believe that continually submitting and getting feedback is the way to find good questions, as there are no magical shortcuts.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Setting programmers against each other will generally be more interesting than setting them against a fixed problem, as it leaves things open ended. However, short well defined questions that can be answered in 10 minutes are also important, as not everyone has a hour to commit every time they drop in to the site. A good supply of long AND short problems is essential.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-04-14T12:43:27.767" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1437" PostTypeId="1" CreationDate="2014-04-14T05:55:53.600" Score="10" ViewCount="335" Body="&lt;p&gt;I am thinking of hosting a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, but I am reluctant to download all the languages people answer in. Similar to &lt;a href=&quot;https://codegolf.stackexchange.com/q/25347/9498&quot;&gt;Survival Game - Create Your Wolf&lt;/a&gt;, I want to restrict languages. In that challenge, the language intended to be used was &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/java&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;java&amp;#39;&quot; rel=&quot;tag&quot;&gt;java&lt;/a&gt;, but ProgrammerDan created a wrapper for other languages. Rusher agreed to run those programs as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My problem with this solution is that it requires downloading the interpreter/compiler for every different language answered in. I'm reluctant to fill my computer with languages that I'll never use. There are several languages which I would accept because I already have interpreters/compilers for them:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Java (My best language; I'd write my tester in it. I have Netbeans)&lt;/li&gt;&#xA;&lt;li&gt;C/C++ (I have Visual Studios Express 2013)&lt;/li&gt;&#xA;&lt;li&gt;C# (Same IDE works)&lt;/li&gt;&#xA;&lt;li&gt;Python 2 or 3&lt;/li&gt;&#xA;&lt;li&gt;Befunge 98 (I have pyfunge)&lt;/li&gt;&#xA;&lt;li&gt;possibly BATCH (since this is a Microsoft Computer, it can run .BAT files, but I haven't tested this on many programs)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I understand that many people use other languages too. On this site, we &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/231/9498&quot;&gt;want to be language agnostic&lt;/a&gt; and encourage (maybe even require) this on most challenges. However, on a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, the challenge host actually has to run all the programs, so this might be difficult if there are too many languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Judging by the votes on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/25347/survival-game-create-your-wolf#comment54641_25347&quot;&gt;this comment&lt;/a&gt;, our users also want language-agnostic &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;. Would it be unreasonable to require answers to be in specific languages? Alternatively, I would be fine if each answer provided an interpreter in one of the listed languages for programs that aren't supported.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note:&#xA;Interpreters/compilers are often big files and I don't know if they are hiding files elsewhere. If I just had to delete one file / folder, I would be more okay with downloading interpreters, but I'd still prefer that they were posted with the answer so I could control the location (keep the files with other &quot;for fun&quot; program files, for easy deletion when I feel like it) and easily delete them.&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-04-14T05:55:53.600" Title="Is it acceptable to restrict languages in a King of the Hill?" Tags="|discussion|asking-questions|" AnswerCount="0" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="1440" PostTypeId="2" ParentId="2140" CreationDate="2014-04-15T08:23:54.737" Score="1" Body="&lt;h2&gt;Divisibility testing&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This question is related to another &lt;a href=&quot;https://math.stackexchange.com/q/517429/6876&quot;&gt;StackExchange&lt;/a&gt; question:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/wXQJ2.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Your task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program that tries to find such an &lt;em&gt;n&lt;/em&gt;. This question is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenge.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Format of your answer&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your answer should include&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a title of the format &quot;## [Programming language]: [seconds] seconds&quot;&lt;/li&gt;&#xA;&lt;li&gt;the code you were using&lt;/li&gt;&#xA;&lt;li&gt;instructions how to run / compile it on Linux Mint (which is based on Ubuntu which is based on Debian) - if it does not run on Linux and seems to be better than existing solutions, I will search a Windows computer&lt;/li&gt;&#xA;&lt;li&gt;Execution time on your computer for n &amp;lt; 20,000&lt;/li&gt;&#xA;&lt;li&gt;CPU of your computer. If it's an Intel CPU: please link to &lt;a href=&quot;http://ark.intel.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;ark.intel.com&lt;/a&gt;. You can find your CPU with &lt;code&gt;cat /proc/cpuinfo&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;What could be done&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The following Python code needs 229.21s seconds to execute on my machine:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#!/usr/bin/env python&#xA;&#xA;&#xA;def gen():&#xA;    &quot;&quot;&quot; Generator that starts with n=1 and returns True if &#xA;        A(n)/B(n) is an integer. Otherwise, it returns False.&#xA;    &quot;&quot;&quot;&#xA;    num = 0&#xA;    den = 0&#xA;    k = 1&#xA;    while True:&#xA;        num += k**k&#xA;        den += k&#xA;        yield num % den == 0&#xA;        k += 1&#xA;&#xA;if __name__ == &quot;__main__&quot;:&#xA;    n = 1&#xA;    for number in gen():&#xA;        if number:&#xA;            print(&quot;n = %i works!&quot; % n)&#xA;            if n &amp;gt; 1:&#xA;                break&#xA;        if n == 30000:&#xA;            print(&quot;No solution found.&quot;)&#xA;            break&#xA;        n += 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Things that could probably improved are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Using multiple cores&lt;/li&gt;&#xA;&lt;li&gt;Using a faster programming language&lt;/li&gt;&#xA;&lt;li&gt;Exclude some &lt;em&gt;n&lt;/em&gt; (you have to prove that those numbers can never be results)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Note: When you find some &lt;em&gt;n&lt;/em&gt; that can be excluded, you get a time bonus. The number of seconds you get as a time bonus is the number of seconds that it speeds up my Python implementation from above.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Prove that there cannot be any &lt;em&gt;n &gt; 1&lt;/em&gt; so that A(n)/B(n) is an integer. You will win if you find that. If you &quot;only&quot; find a solution that works, you will not get any bonus (but you can answer the question on math.SE :-) )&lt;/li&gt;&#xA;&lt;li&gt;Find a faster way to calculate the hyperfactorial A(n).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Testing system&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I have an &lt;a href=&quot;http://ark.intel.com/products/50176/Intel-Pentium-Processor-P6200-3M-Cache-2_13-GHz&quot; rel=&quot;nofollow noreferrer&quot;&gt;Intel P6200 CPU&lt;/a&gt; (2.13 GHz, 2 cores, 3 MB cache). I will run your code on my system to make it comparable. I will take the time this way:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;time python testit.py&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Tags I will use:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(This will not be part of the question, of course.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="5240" LastEditorUserId="-1" LastEditDate="2017-04-13T12:19:20.950" LastActivityDate="2014-04-15T08:23:54.737" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1441" PostTypeId="2" ParentId="2140" CreationDate="2014-04-15T14:09:38.157" Score="0" Body="&lt;p&gt;I've put potential issues in &lt;strong&gt;bold&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We need some XHTML pages to test this on. I suggest &lt;a href=&quot;http://www.w3.org/People/mimasa/test/schemas/xhtml1-sample.xml#headings.heading&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.w3.org/People/mimasa/test/schemas/xhtml1-sample.xml#headings.heading&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;XHTML Compression Challenge (revision 5)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Design an algorithm to compress XHTML code as efficiently as possible. You must provide programs that do compression and decompression, and a detailed explanation. Input before compression and decompressed output should be identical and both valid XHTML.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The exact specification of XHTML we will be using is XHTML 1.0 Transitional as defined by W3C. This is to make the code easier to deal with - parameter values are always in quotes, there is a distinction between single and container tags, and all tags are properly nested.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This would be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, so the winner is whoever gets the best compression ratio on &amp;lt;&lt;em&gt;some test code&lt;/em&gt;&gt;. Obviously the algorithm should work on any HTML!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The sort of thing that I mean is&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;not including the &lt;code&gt;html&lt;/code&gt; tag in the compressed format (as you always know where it is)&lt;/li&gt;&#xA;&lt;li&gt;compressing &lt;code&gt;h1&lt;/code&gt;, &lt;code&gt;h2&lt;/code&gt; and so on to &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;2&lt;/code&gt;, etc.&lt;/li&gt;&#xA;&lt;li&gt;compress &lt;code&gt;title&lt;/code&gt; to &lt;code&gt;t&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The test code (could be an actual webpage) &lt;strong&gt;(where do we get the test code)&lt;/strong&gt; would contain a variety of HTML tags, &lt;strong&gt;in &quot;natural abundances&quot;&lt;/strong&gt; (you won't suddenly have millions of &lt;code&gt;kbd&lt;/code&gt; tags, say, but you would have lots of &lt;code&gt;p&lt;/code&gt; or &lt;code&gt;br&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The decompressed code and the original MUST be identical!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or should we allow minute differences like interchanging &lt;code&gt;&amp;lt;acronym&amp;gt;&lt;/code&gt; with &lt;code&gt;&amp;lt;abbr&amp;gt;&lt;/code&gt;, or &lt;code&gt;&amp;lt;strike&amp;gt;&lt;/code&gt; with &lt;code&gt;&amp;lt;s&amp;gt;&lt;/code&gt;?&lt;/p&gt;&#xA;" OwnerDisplayName="user16402" LastEditorDisplayName="user16402" LastEditDate="2014-05-14T19:30:04.260" LastActivityDate="2014-05-14T19:30:04.260" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="1443" PostTypeId="2" ParentId="1397" CreationDate="2014-04-15T23:26:46.627" Score="1" Body="&lt;p&gt;I don't think it matters if the origins of the challenge are open source or not.  People write answers all the time on StackOverflow with full knowledge that they're helping other people do their work, whatever that may be.  It's a pay-it-forward kind of thing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;People solve the puzzles if they want to.  They don't if they don't want to.  If your puzzle is boring and feels like &quot;work&quot; then probably no one will want to solve it...practical application or not.  If a puzzle is good, who cares if a solution to it is also useful?  Although if your puzzle involves the phrase &lt;em&gt;&quot;design a data format&quot;&lt;/em&gt; it definitely starts sounding less like a puzzle and more like... work.  YMMV.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The mentions about licensing is the only real sticking point.  So if CC BY-SA doesn't work for your application then you should explicitly say so in advance, or take your chances in asking afterward.  &lt;em&gt;(I've been emailed by license-conscious people about SO code asking me to explicitly license it as MIT or whatever, and sure.  Why not?)&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="57" LastActivityDate="2014-04-15T23:26:46.627" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1445" PostTypeId="2" ParentId="1213" CreationDate="2014-04-16T07:57:46.463" Score="6" Body="&lt;h1&gt;Testing Mathematica if you don't have it installed&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note: this only works if the answer provides a CDF file or Mathematica Notebook file.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the answer provides a CDF file or Mathematica Notebook file, you can use the Wolfram CDF Player to view those files.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Go to the &lt;a href=&quot;https://www.wolfram.com/cdf-player/&quot; rel=&quot;nofollow&quot;&gt;CDF Player download page&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Fill in the little form.&lt;/li&gt;&#xA;&lt;li&gt;Download the installer and install the CDF player.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;To save a Mathematica file as a CDF file or Mathematica Notebook&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you have a Mathematica answer and want to provide a CDF file or Mathematica Notebook file:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Go to File -&gt; Save As (or press &lt;kbd&gt;Shift&lt;/kbd&gt;+&lt;kbd&gt;Ctrl&lt;/kbd&gt;+&lt;kbd&gt;S&lt;/kbd&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Select &quot;Mathematica Notebook&quot; or &quot;Computable Document&quot;.&lt;/li&gt;&#xA;&lt;li&gt;Save the file.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="9275" LastActivityDate="2014-04-16T07:57:46.463" CommentCount="1" CommunityOwnedDate="2016-08-21T03:11:45.147" ContentLicense="CC BY-SA 3.0" />
  <row Id="1446" PostTypeId="1" CreationDate="2014-04-16T13:05:27.283" Score="10" ViewCount="336" Body="&lt;p&gt;It might be interesting if &lt;a href=&quot;http://blog.stackexchange.com/2011/06/blog-overflow/&quot; rel=&quot;nofollow noreferrer&quot;&gt;we had a community blog&lt;/a&gt; for our site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Maybe we could blog about specific exemplary posts here, or about golfing in general, or about exploring some things about our site (like the recent code-trolling invasion), or about current events related to golfing or our site, or about programming challenges, or about any number of things.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But if we want this, we'll have to organize it ourselves, since it's a &lt;em&gt;community&lt;/em&gt; blog!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The post linked above has a four-step process to create a blog. The first step is to raise the idea on the meta site, which I am doing now. The blog will only work if the community wants a blog. From the same post:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A community blog needs the involvement of community members.  These blogs don’t exist to be the personal blog of a community member.  They are both for and run by the community.  It needs to be something the community collectively wants and will cultivate.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So, what do you think? Do we want a blog? Would it help out our site?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;Idea of getting a blog stolen from your local Stack Exchange nemesis, &lt;a href=&quot;https://codereview.meta.stackexchange.com/q/1712&quot;&gt;Code Review&lt;/a&gt; ;)&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:32.987" LastActivityDate="2014-04-16T21:29:25.123" Title="Code Golf Blog - Phase 1 - Raise the idea on the meta site" Tags="|discussion|blog-discussion|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1447" PostTypeId="1" CreationDate="2014-04-16T14:29:05.580" Score="8" ViewCount="242" Body="&lt;p&gt;We have downvotes for that (and in &lt;em&gt;some&lt;/em&gt; cases &quot;Very Low Quality&quot;). It seems that &lt;strong&gt;basically every time&lt;/strong&gt; I see a flag in the queue, it has at least one &quot;Not an Answer&quot; flag stuck to it, no matter what's wrong with it. The flag queue &lt;em&gt;right now&lt;/em&gt; has six answers in it flagged as NAA, when &lt;em&gt;all six&lt;/em&gt; are answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For reference, I'm talking about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/25670/output-pi-without-math/25832#25832&quot;&gt;these kinds of answers&lt;/a&gt;. It was flagged as NAA, even though it's &lt;em&gt;clearly an attempt&lt;/em&gt; to answer. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/849/14215&quot;&gt;Whether it follows the spec or not shouldn't matter&lt;/a&gt;, the same as on any other SE site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've been marking these flags as invalid, and will continue to do so. I encourage others to do the same.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there any dissenting opinion around here that I don't know of?&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2014-04-16T15:07:41.420" Title="Can we stop flagging poor answers as &quot;not an answer&quot;?" Tags="|discussion|flags|" AnswerCount="1" CommentCount="7" ClosedDate="2016-01-18T20:33:38.443" ContentLicense="CC BY-SA 3.0" />
  <row Id="1448" PostTypeId="2" ParentId="1447" CreationDate="2014-04-16T15:07:41.420" Score="11" Body="&lt;p&gt;It seems we need a sort of guide for flagging, so...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;spam / offensive: self-explanatory&lt;/li&gt;&#xA;&lt;li&gt;NAA: for posts that &lt;strong&gt;do not attempt to solve the challenge&lt;/strong&gt; (examples: &quot;I like llamas,&quot; &quot;Wow, interesting challenge,&quot; &quot;user12345's answer is invalid,&quot; &quot;This challenge is boring,&quot; &quot;I don't know, but here's a starting point for others,&quot; etc)&lt;/li&gt;&#xA;&lt;li&gt;VLQ: for posts that (attempt to) solve the challenge but should be deleted for any other reason, ex. Doesn't follow spec, clearly an attempt to troll, extremely low quality and unsalvageable by editing, etc&lt;/li&gt;&#xA;&lt;li&gt;Other: for exceptional or special situations, ex. Plagiarism, voting rings, etc&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So, these types of answers should be flagged as VLQ.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-04-16T15:07:41.420" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1449" PostTypeId="2" ParentId="238" CreationDate="2014-04-16T15:58:17.503" Score="14" Body="&lt;p&gt;Hooray, &lt;a href=&quot;https://meta.stackexchange.com/a/228947/180276&quot;&gt;automatic CW has been completely removed&lt;/a&gt; network-wide!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is no longer a problem. &lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;!&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-04-16T15:58:17.503" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1450" PostTypeId="2" ParentId="1446" CreationDate="2014-04-16T21:29:25.123" Score="5" Body="&lt;p&gt;Without a more concrete vision of what the blog would cover, it's hard to see the benefit. That doesn't mean that it's necessarily a &lt;em&gt;bad&lt;/em&gt; thing, but it does raise a risk that the contributors would lose interest quickly. It takes a lot of effort to write a blog post, so many blogs (including my &lt;a href=&quot;http://www.cheddarmonk.org/golfscriptblog/&quot; rel=&quot;nofollow&quot;&gt;GolfScript blog&lt;/a&gt;) wind up abandoned with between 1 and 6 posts. On top of that, the integration between BlogOverflow and the main StackExchange sites is pretty weak, so you can't count on the main site driving traffic to the blog.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I throw open a challenge to the upvoters: sell us all a vision for &lt;em&gt;how&lt;/em&gt; the blog will benefit PCG.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-04-16T21:29:25.123" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1451" PostTypeId="1" AcceptedAnswerId="1456" CreationDate="2014-04-17T01:36:44.797" Score="11" ViewCount="371" Body="&lt;p&gt;I'm new to the review queue and I don't know what our policy is on well-intentioned answers that happen to break some of the rules stated in the question. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/17005/produce-the-number-2014-without-any-numbers-in-your-source-code/25954#25954&quot;&gt;this answer&lt;/a&gt; was recently flagged as low-quality for including forbidden characters in the source. This particular answer might be hard to 'fix' to meet the criteria, but it's often not this clear. Are there any guidelines for when to hit 'recommend deletion'?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/825/what-should-count-as-not-an-answer-here&quot;&gt;What should count as &amp;quot;not an answer&amp;quot; here?&lt;/a&gt; addresses a similar issue, but doesn't provide any consensus on what to do with posts that miss the mark.&lt;/p&gt;&#xA;" OwnerUserId="2104" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-04-17T16:04:47.070" Title="Should answers that break the rules be deleted?" Tags="|discussion|moderation|" AnswerCount="1" CommentCount="3" FavoriteCount="0" ClosedDate="2016-01-18T20:33:59.520" ContentLicense="CC BY-SA 3.0" />
  <row Id="1452" PostTypeId="1" CreationDate="2014-04-17T02:33:16.313" Score="13" ViewCount="298" Body="&lt;p&gt;So, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; is unique in that some people cannot test &lt;em&gt;all&lt;/em&gt; of the submissions given, as they need to have all of the environments installed that users submit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We should make a place to become an &quot;official&quot; tester for KOTH challenges. To be a tester, one should be able to run a certain list of &quot;major&quot; languages (which can be decided now). The tester will post an answer to the &quot;Sign up here to become an official tester!&quot; question. If the user cannot run some of these languages, he or she or it&lt;sup&gt;1&lt;/sup&gt; should note that in the answer. The user should also note any extra languages that are able to be tested.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I will post two answers to this post. One will be a list of major languages that every tester should have, and one will be a draft as to what the official post will look like. Please suggest things I should change in the comments, and once we have come to a consensus, the post will be posted!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, I really think these testers, the unsung heroes of KOTH, should get some compensation for their work. Any ideas?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1: No discrimination against inanimate objects, please ;)&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="9498" LastEditDate="2014-04-18T01:03:37.733" LastActivityDate="2014-04-22T13:17:59.287" Title="Creating an official place to become a King of the Hill tester" Tags="|discussion|" AnswerCount="5" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1453" PostTypeId="2" ParentId="1452" CreationDate="2014-04-17T02:33:16.313" Score="0" Body="&lt;h1&gt;List of &quot;major&quot; languages&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Please comment if you think a language is common enough to be added!&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Java&lt;/li&gt;&#xA;&lt;li&gt;C#&lt;/li&gt;&#xA;&lt;li&gt;C / C++&lt;/li&gt;&#xA;&lt;li&gt;Python (v2 and v3)&lt;/li&gt;&#xA;&lt;li&gt;Perl (what versions?)&lt;/li&gt;&#xA;&lt;li&gt;Ruby (1.8 and 1.9)&lt;/li&gt;&#xA;&lt;li&gt;PHP&lt;/li&gt;&#xA;&lt;li&gt;JavaScript&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I have to leave now, so this language list is completely incomplete. At this point, just edit in languages that are obviously major and commonly used ;)&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="3808" LastEditDate="2014-04-17T23:39:28.937" LastActivityDate="2014-04-17T23:39:28.937" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1454" PostTypeId="2" ParentId="1452" CreationDate="2014-04-17T02:34:56.713" Score="0" Body="&lt;h1&gt;Draft post&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Become an official King of the Hill tester!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This does not exist so far since I have to go. If you want, please edit in a draft!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;/questions/tagged/discussion&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-04-17T02:34:56.713" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1455" PostTypeId="2" ParentId="1452" CreationDate="2014-04-17T14:46:12.093" Score="2" Body="&lt;h1&gt;Most Popular Languages&lt;/h1&gt;&#xA;&lt;p&gt;I thought of a way to determine what a &amp;quot;Major&amp;quot; language is without too much &amp;quot;Language X should &lt;em&gt;obviously&lt;/em&gt; be included because of blah blah blah&amp;quot; or &amp;quot;Language Y is &lt;em&gt;obviously&lt;/em&gt; more popular than language X because I &lt;em&gt;know&lt;/em&gt; so (and I'm a wizard).&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;The results are current as of April 17, 2014.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;In the Job Market&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I did some research on &lt;a href=&quot;http://jobsearch.monster.com/search&quot; rel=&quot;nofollow noreferrer&quot;&gt;Monster&lt;/a&gt; for most popular languages in the job market. I performed keyword searches for different languages, and recorded the number of matches. The search was limited to Texas only, to keep results from maxing out at 1000+.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Results&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Units are &amp;quot;number of matches&amp;quot;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Java - 1000+&lt;/li&gt;&#xA;&lt;li&gt;JavaScript - 928&lt;/li&gt;&#xA;&lt;li&gt;C#- 662&lt;/li&gt;&#xA;&lt;li&gt;C++ - 440&lt;/li&gt;&#xA;&lt;li&gt;C - *400&lt;/li&gt;&#xA;&lt;li&gt;Python - 318&lt;/li&gt;&#xA;&lt;li&gt;Perl - 238&lt;/li&gt;&#xA;&lt;li&gt;Ruby - 186&lt;/li&gt;&#xA;&lt;li&gt;CoffeeScript - 12&lt;/li&gt;&#xA;&lt;li&gt;Golfscript - 0&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;*C (the programming language) is difficult to search for because it is also a letter. I am confident that there are at least 400 C language related jobs in Texas.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;In the Community&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Perhaps more relevant are the languages that are talked about the most on the Internet. We are, after all, an Internet community. I searched for the following terms on &lt;a href=&quot;https://www.google.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Google&lt;/a&gt; and recorded the results. The exact format used for the search double-quote language double-quote programming (i.e., &amp;quot;C&amp;quot; programming, &amp;quot;Java&amp;quot; programming, etc.). This helped to avoid potential overlap with other uses of search term.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Results&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Units are &amp;quot;number of results (in millions)&amp;quot;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;C - *467&lt;/li&gt;&#xA;&lt;li&gt;JavaScript - 74.6&lt;/li&gt;&#xA;&lt;li&gt;Java - 47&lt;/li&gt;&#xA;&lt;li&gt;C# - 40.9&lt;/li&gt;&#xA;&lt;li&gt;Perl - 29.2&lt;/li&gt;&#xA;&lt;li&gt;Python - 23.6&lt;/li&gt;&#xA;&lt;li&gt;C++ - 20.5&lt;/li&gt;&#xA;&lt;li&gt;Ruby - 14.4&lt;/li&gt;&#xA;&lt;li&gt;CoffeeScript - 0.6&lt;/li&gt;&#xA;&lt;li&gt;GolfScript - 0.02&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;*Again, C is hard to search for (being a letter), and so the result I got is not accurate. C is prevalent, but take 467,000,000 results with a grain of salt.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Conclusion&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;If real world practicality is a factor, then the C group of languages, JavaScript, and Java are objectively on top. If popularity on the Internet is the determining factor, then throw out C++ or add in Perl and Python (depending on your threshold). This post does &lt;em&gt;not&lt;/em&gt; consider certain factors that I believe to be important, such as:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Ease of use&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the compiler/interpreter easy to get? Are the programs easy to run?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Lightness&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How long will it take me to get rid of the crap that comes with downloading and running programs in these languages?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Learning curve&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the language easy to understand at a glance? Code that a tester can't read is generally assumed to be malicious, unless you are testing on a VM (additional work).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Code Golf&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are most GolfScripters, Brainfuckers, and WhiteSpacers also fluent in a &amp;quot;major&amp;quot; language, or do we need to consider including those languages that are prevalent on the site?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Perhaps the rest of you can reach consensus on the other factors mentioned above.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-04-17T18:33:00.007" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1456" PostTypeId="2" ParentId="1451" CreationDate="2014-04-17T16:04:47.070" Score="15" Body="&lt;p&gt;I may be in the minority, but I say &lt;strong&gt;no&lt;/strong&gt;. You &lt;em&gt;should&lt;/em&gt; downvote it or leave a comment explaining why it breaks the rules.&lt;/p&gt;&#xA;&lt;p&gt;From &lt;a href=&quot;https://meta.stackexchange.com/a/163733/212780&quot;&gt;Meta.SE&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;An answer that is not an answer should be deleted (should be a comment, doesn't answer the question etc...).&lt;/p&gt;&#xA;&lt;p&gt;Answers that are answers but are factually wrong or are actively bad (say promote SQL Injection) should get downvoted, but not deleted.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I'm of the opinion that answers that don't meet spec are &lt;em&gt;factually wrong&lt;/em&gt;. They are absolutely an &lt;em&gt;attempt&lt;/em&gt; to answer the question, &lt;em&gt;and&lt;/em&gt; they &lt;a href=&quot;https://meta.stackexchange.com/questions/163730/when-should-i-delete-an-answer/163733#comment476498_163733&quot;&gt;serve as an example&lt;/a&gt; of what the community sees as &amp;quot;bad&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;If you delete answers that don't meet the spec, you're simply inviting &lt;em&gt;more&lt;/em&gt; answers that break the &lt;em&gt;same&lt;/em&gt; rules, because nobody can tell it's already been tried and shot down. &lt;em&gt;Showing&lt;/em&gt; people that we downvote &lt;em&gt;might&lt;/em&gt; discourage that.&lt;/p&gt;&#xA;&lt;p&gt;Of course, there &lt;em&gt;are&lt;/em&gt; exceptions. It's simply not a black/white issue. Many of these answers are a simple slip or misreading of the spec. Some &lt;em&gt;are&lt;/em&gt; obviously horrible, but in &lt;em&gt;almost&lt;/em&gt; all cases, I believe in downvoting.&lt;/p&gt;&#xA;&lt;p&gt;Lack of downvoting is something I see as a bit of a problem here. There are &lt;em&gt;tons&lt;/em&gt; of answers that break rules, don't meet spec, or simply don't work. I downvote them when I come across them, and I was shocked to recently find out that &lt;a href=&quot;http://data.stackexchange.com/codegolf/query/175802/top-downvoters&quot; rel=&quot;nofollow noreferrer&quot;&gt;I am the #1 downvoter here&lt;/a&gt; among those with over 100 total votes. That just seems insane to me, because I &lt;em&gt;upvote&lt;/em&gt; pretty often, too.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-04-17T16:04:47.070" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1457" PostTypeId="2" ParentId="1452" CreationDate="2014-04-18T13:12:26.063" Score="-2" Body="&lt;p&gt;Perhaps we should add &lt;strong&gt;Brainfuck&lt;/strong&gt; and &lt;strong&gt;APL&lt;/strong&gt; to the list of &quot;major languages&quot;? They aren't &quot;major&quot; but they feature quite a lot here (mostly on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;).&lt;/p&gt;&#xA;" OwnerDisplayName="user16402" LastActivityDate="2014-04-18T13:12:26.063" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1458" PostTypeId="2" ParentId="2140" CreationDate="2014-04-19T10:53:39.823" Score="4" Body="&lt;h1&gt;Find sociable numbers&lt;/h1&gt;&#xA;&lt;h3&gt;Background&lt;/h3&gt;&#xA;&lt;p&gt;A number is perfect if it is the sum of its divisors; for instance &lt;code&gt;6=1+2+3&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;A pair of numbers is friendly if they are the sum of each other's divisors; for instance &lt;code&gt;284=1+2+4+5+10+11+20+22+44+55+110&lt;/code&gt; and &lt;code&gt;220=1+2+4+71+142&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;In general, a list of n numbers is sociable if each element is the sum of divisors of the previous elements, with the first being the sum of divisors of the last.&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;An integer, &lt;code&gt;n&lt;/code&gt; on STDIN.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;A list of &lt;code&gt;n&lt;/code&gt; numbers which are sociable, in the order outlined above, each on its own line. If you can't find any suitable list, you may output nothing, &lt;code&gt;False&lt;/code&gt;, or &lt;code&gt;0&lt;/code&gt;, but you must search up to at least &lt;code&gt;2^32-1&lt;/code&gt;, and preferably as high as your language will allow&lt;/p&gt;&#xA;&lt;h3&gt;Winning&lt;/h3&gt;&#xA;&lt;p&gt;This is code-golf, so the shortest code wins. However, I will also create a bounty to be awarded to the fastest program, as measured on my command-line (Windows 7 with GNU coreutils, python27, python3, node.js, perl) or in a web IDE in chrome (brainfuck, golfscript?)&lt;/p&gt;&#xA;&lt;p&gt;Edit: to clarify the relationship between input and output&lt;/p&gt;&#xA;" OwnerUserId="19039" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-04-19T21:01:54.103" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1459" PostTypeId="1" CreationDate="2014-04-19T12:10:09.323" Score="2" ViewCount="130" Body="&lt;p&gt;Many questions specify that input must be on STDIN, but get answers in golfscript, brainfuck, mathematica, gnuplot etc. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't know whether these languages actually read from stdin, or can be persuaded to - and if they can't, should they be considered licit?&lt;/p&gt;&#xA;" OwnerUserId="19039" LastActivityDate="2014-04-19T18:49:52.553" Title="What counts as stdin?" Tags="|discussion|" AnswerCount="1" CommentCount="1" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1460" PostTypeId="2" ParentId="1459" CreationDate="2014-04-19T18:49:52.553" Score="1" Body="&lt;p&gt;GolfScript and BF interpreters are supposed to read from stdin according to their standard, AFAIK. They read from stdin and print to stdout, which is also required by interpreters, according to their standards. Mathematica doesn't redirect stdin - it lets the scripts read it normally, like reading from /dev/stdin in *nix. It also has methods builtin to deal with that. I'm pretty sure that gnuplot has some method, but it's hard to tell from its documentation (or I at least am having trouble reading it). &lt;/p&gt;&#xA;" OwnerUserId="14668" LastActivityDate="2014-04-19T18:49:52.553" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1461" PostTypeId="2" ParentId="2140" CreationDate="2014-04-19T18:50:31.117" Score="2" Body="&lt;h1&gt;Filter out repetitive lines&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Google Suggest doesn't show any results if a string contains more than 4 repetitions of a substring. More specifically, if a substring is repeated 4 times in a row, followed by the first character of that substring (i.e. &lt;code&gt;abcabcabcabca&lt;/code&gt; or &lt;code&gt;x x x x x&lt;/code&gt;), nothing is suggested. This rule changes slightly if the substring is all the same digit - a digit may be repeated 5 times in a row, but no more. This is probably to allow searching for ZIP codes like &lt;code&gt;22222&lt;/code&gt;. (This doesn't extend to strings like &lt;code&gt;1010101010&lt;/code&gt;, though.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's simulate this behavior! &lt;strong&gt;Write a program that takes lines on standard input and echoes those lines back on standard output, unless the line fits the criteria for repetitiveness, in which case it's silently discarded.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sample input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a simple query&#xA;nananananananana&#xA;ffffgggghhhh&#xA;48719999936&#xA;abc abc abc abc asdf&#xA;xyzzzzzyx&#xA;122333444455555666666&#xA;repetitiverepetitiverepetitiverepetitive&#xA;erepetitiverepetitiverepetitiverepetitive&#xA;101010101&#xA;55555 zzzzz&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a simple query&#xA;ffffgggghhhh&#xA;48719999936&#xA;repetitiverepetitiverepetitiverepetitive&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(Google's behavior is actually quite a bit more complicated than this; there are a few exceptions to all of these rules, but let's just ignore those for this challenge.)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/strings&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;strings&amp;#39;&quot; rel=&quot;tag&quot;&gt;strings&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;There was a similar challenge posted awhile ago (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/24724/recognizing-repetition-in-strings&quot;&gt;Recognizing Repetition in strings&lt;/a&gt;), but it was closed due to vagueness. I think the criteria proposed above are more than thorough enough.&lt;/p&gt;&#xA;" OwnerUserId="2104" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.863" LastActivityDate="2014-04-19T18:50:31.117" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="1463" PostTypeId="2" ParentId="1452" CreationDate="2014-04-21T08:30:54.720" Score="7" Body="&lt;h2&gt;Alternative idea - VMs&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;How about we create a virtual machine image with &lt;strike&gt;all of&lt;/strike&gt; the  required(as decided by this post) interpreters/compilers installed so that testers can directly have all the required environments without hunting for them separately. It would also remove the uncertainty of running non-reviewed code.&lt;/p&gt;&#xA;" OwnerUserId="8766" LastEditorUserId="8766" LastEditDate="2014-04-22T13:17:59.287" LastActivityDate="2014-04-22T13:17:59.287" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1464" PostTypeId="1" CreationDate="2014-04-21T13:05:02.090" Score="7" ViewCount="203" Body="&lt;p&gt;The general reaction on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1446/3808&quot;&gt;phase 1 of the blog idea&lt;/a&gt; was &quot;maybe, depending on what content we write there.&quot; So, let's figure that out!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From &lt;a href=&quot;http://blog.stackexchange.com/2011/06/blog-overflow/&quot; rel=&quot;nofollow noreferrer&quot;&gt;the &quot;official&quot; blog guidelines&lt;/a&gt; on this step:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Is the blog about the site? Is it about the site’s topic? Is it about the industry around the topic? Keep in mind the audience of your community and their interests. Another generic blog about &amp;lt;x&amp;gt; may not be all that interesting.  A community blog should be interesting to both current members and potential new members.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So, what do you think we could blog about? Please note that this step &lt;strong&gt;does not&lt;/strong&gt; mean that there will be a blog. We're just thinking of what we could write about if we had a blog here, and we could still decide that we don't want one at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please submit one idea per answer, and vote on the ones you like and dislike!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;Oh, and &lt;a href=&quot;https://codereview.meta.stackexchange.com/q/1781/36278&quot;&gt;Code Review stole our ad idea&lt;/a&gt; in return for us stealing their blog idea, so now we're even. ;)&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-05-02T21:02:52.283" Title="Code Golf Blog - Phase 2 - Define the Scope" Tags="|discussion|blog-discussion|" AnswerCount="5" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1465" PostTypeId="2" ParentId="1464" CreationDate="2014-04-21T13:05:02.090" Score="8" Body="&lt;p&gt;Here's one from the official blog post that I think will fit:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Highlight top content.&lt;/strong&gt; What great question was posted on the site recently?  Recognize it!  Don’t just copy the question and its answers to the blog, blog about the question and its answers.  A fine line there, eh?  Delve deeper into the question or an answer.  Add more context.  Compare or analyze answers against each other.  There is a lot to work with here.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This would be perfect for Code Golf. We could analyze some code that had been golfed really well, or we could provide commentary on a challenge or a solution.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-04-21T13:05:02.090" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1466" PostTypeId="2" ParentId="1464" CreationDate="2014-04-21T13:06:14.837" Score="4" Body="&lt;p&gt;Another one from the official blog post:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Keep up with current events.&lt;/strong&gt; What is making news for your community?  What interests the community?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;We could talk about new things happening in the Code Golf-verse, such as new tags (like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; when it was first established) or new ideas.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorDisplayName="user45941" LastEditDate="2016-05-02T21:02:52.283" LastActivityDate="2016-05-02T21:02:52.283" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1467" PostTypeId="2" ParentId="1464" CreationDate="2014-04-21T13:08:36.493" Score="5" Body="&lt;p&gt;How about blogging about code golf in general, not specifically related to our site? We could write posts about golfing languages, like GolfScript, or something related to golfing or programming challenges off-site that we think is interesting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We could also post ideas about golfing or golfing languages, or review a topic related to PPCG.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-04-21T13:08:36.493" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1468" PostTypeId="2" ParentId="1464" CreationDate="2014-04-21T13:50:44.917" Score="6" Body="&lt;p&gt;We could blog about how new updates to languages (like the new Java 8) will affect Golfing in those languages, as well as compatibility with older answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With this it would help everyone to stay on the cutting edge of Code Golfing.&lt;/p&gt;&#xA;" OwnerUserId="9435" LastEditorUserId="16472" LastEditDate="2014-04-30T00:07:42.633" LastActivityDate="2014-04-30T00:07:42.633" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1469" PostTypeId="2" ParentId="1053" CreationDate="2014-04-21T16:54:02.447" Score="-2" Body="&lt;p&gt;Tips-for-golfing questions belong on meta, because they are questions about how best to answer questions. Questions about questions are metaquestions.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="18487" LastEditDate="2014-04-21T18:45:45.123" LastActivityDate="2014-04-21T18:45:45.123" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1470" PostTypeId="1" CreationDate="2014-04-22T01:30:56.627" Score="15" ViewCount="530" Body="&lt;p&gt;Currently, all &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions on the main site are Community Wiki. Furthermore, there are not many other non-challenge questions on the main site. These types of questions are generally supressed on PPCG.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This should change.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first point I'm going to attack is the fact that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions are CW. This is &lt;strong&gt;wrong&lt;/strong&gt;!&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Community Wiki is meant for posts that are created and maintained by the community, wiki-style. (Hence the name.) From &lt;a href=&quot;http://blog.stackoverflow.com/2011/08/the-future-of-community-wiki/&quot;&gt;this blog post&lt;/a&gt; about community wiki:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Community wiki is for that rare gem of a post that needs true community collaboration. That’s when community wiki shines.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The CW checkbox on questions &lt;a href=&quot;https://meta.stackexchange.com/q/67039/180276&quot;&gt;was removed for a reason&lt;/a&gt; - it's being misused. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions are &lt;strong&gt;not&lt;/strong&gt; wiki-type articles! Each answer has one tip, and that tip is &quot;owned&quot; by its original author. The question is still &quot;owned&quot; by the asker of the question.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;From &lt;a href=&quot;https://meta.stackexchange.com/a/63434/180276&quot;&gt;this Meta SE post&lt;/a&gt; on what the purpose of CW is:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;To allow anyone to collaboratively edit a question or answer.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That's &lt;strong&gt;not&lt;/strong&gt; what &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions are! The question is still the OP's own question, and the answers are still the answerers' own ideas and tips. Since each answer has one tip, there's no need to enable collaborative editing.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Now that that's out of the way, let's talk about other &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;-like questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why do challenges have to be the only thing ever posted on PPCG? Can't there be &lt;em&gt;questions&lt;/em&gt; too? Can there not be questions...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;about tips about golfing (which we have already)?&lt;/li&gt;&#xA;&lt;li&gt;about creating golfing languages (not a specific one, but in general, i.e. how to handle I/O, how to create a generic string/array slicing method, etc.)?&lt;/li&gt;&#xA;&lt;li&gt;about how to make something [more obfuscated/shorter/...] (i.e. how to make shuffling an array shorter)?&lt;/li&gt;&#xA;&lt;li&gt;about making specific constructs shorter (i.e. long strings and compressing them, nested loops, etc.)?&lt;/li&gt;&#xA;&lt;li&gt;about strategies to solve a specific type of programming puzzle?&lt;/li&gt;&#xA;&lt;li&gt;about the history of golfing (I know, sounds boring, but some people might be interested)?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Etc., etc., etc.?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This would a.) &lt;strong&gt;Increase the question volume&lt;/strong&gt;, which we direly need, and b.) &lt;strong&gt;Draw a bigger audience&lt;/strong&gt; into the site (the audience that doesn't know how to golf or solve programming puzzles, and wants to learn more).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The advantages far outweight the (nonexistent) disadvantages. So why not?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/27/3808&quot;&gt;This meta post&lt;/a&gt; is related, but it's asking about &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/112/3808&quot;&gt;a question not really about the process of golfing, but about character counting which only happens to be used in golfing&lt;/a&gt;. (Also it's from 3 years ago.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;(&lt;em&gt;Please&lt;/em&gt; don't get me started on posting these on meta. Meta is for discussion about the SE site PPCG, not discussion about programming puzzles / golfing. Just... no.)&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2015-01-30T16:58:59.340" Title="Re-evaluating [tips] and tip-like questions" Tags="|discussion|new-genre|" AnswerCount="3" CommentCount="18" ContentLicense="CC BY-SA 3.0" />
  <row Id="1472" PostTypeId="1" CreationDate="2014-04-22T19:17:41.483" Score="2" ViewCount="56" Body="&lt;p&gt;I'm referring to the following question:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/26186/the-else-statement-replacement-in-the-fewest-bytes&quot;&gt;The else statement replacement in the fewest bytes?&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The winner is the one with most votes, probably the most creative. Plus, the more the bytes, the less your chance of winning. The score formula is: &lt;code&gt;score = votes * 10 - bytes&lt;/code&gt;, so the more bytes you use, the less your score.&lt;/p&gt;&#xA;&lt;p&gt;Highest score wins.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;IIRC, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; are mutually exclusive. Not so sure about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="344" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-04-23T13:26:14.253" Title="What is the proper tagging for this question with mixed rules?" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1474" PostTypeId="2" ParentId="1472" CreationDate="2014-04-22T20:21:36.870" Score="3" Body="&lt;p&gt;With the scoring rules &lt;em&gt;as written&lt;/em&gt;, I would tag it with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; only.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From the code challenge &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-challenge/info&quot;&gt;tag wiki&lt;/a&gt; (emphasis mine):&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The most common problem specific to a code challenge is that its winning criterion is highly subjective (i.e. each answer is equally valid) or that &lt;strong&gt;multiple, conflicting winning criteria&lt;/strong&gt; exist.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In addition, the code golf &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;tag wiki&lt;/a&gt; excerpt says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A competition which scores on a &lt;strong&gt;mixture of source length and some other criterion&lt;/strong&gt; should be tagged [code-challenge] instead.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;You can see several examples of this sort of criteria by browsing the code challenge tag. For example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/1091/14215&quot;&gt;What&amp;#39;s my name? Produce the name of the language indirectly&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/7165/14215&quot;&gt;When does (x == x+2)?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/22751/14215&quot;&gt;Implement ROT-47... in ROT-47&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/4499/14215&quot;&gt;Convert number to comma separated number&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/1620/14215&quot;&gt;Arbitrary Base Conversion&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All have some degree of subjectivity in addition to the other criteria. In some cases, votes are simply used as tie-breakers. In others, there &lt;em&gt;seem&lt;/em&gt; to be no criteria at all, and the tag was edited in by someone later because it lacked one. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;To be honest, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; could be considered a bit of a mess, but it's useful to have something to fall back on when none of the other tags fit &lt;em&gt;quite&lt;/em&gt; right.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-04-23T13:26:14.253" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1475" PostTypeId="1" CreationDate="2014-04-23T00:04:09.580" Score="19" ViewCount="1058" Body="&lt;p&gt;Sometimes when I get the urge to post a new challenge, I have trouble finding a notable* problem that has not yet been solved upon which to base my challenge (I'm not very creative). I thought it might be cool if we could generate a list of such problems here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some examples that I tried to find using the search box on Code Golf.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Cluster_analysis&quot; rel=&quot;nofollow noreferrer&quot;&gt;Clustering&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Flow_control_%28data%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;Flow Control&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Maximum_flow_problem&quot; rel=&quot;nofollow noreferrer&quot;&gt;Maximum Flow&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Here is one example of a problem that &lt;em&gt;has&lt;/em&gt; been used before (many times).&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Shortest_path_problem&quot; rel=&quot;nofollow noreferrer&quot;&gt;Shortest Path&lt;/a&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Already used &lt;a href=&quot;https://codegolf.stackexchange.com/q/17455/18487&quot;&gt;here&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/q/2645/18487&quot;&gt;here&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/q/153/18487&quot;&gt;here&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Please post notable* problems that have not yet been touched. Post as many as you can think of. Correct other answers (and this question) if you see one that &lt;em&gt;has&lt;/em&gt; been used before, but make sure that you provide a link.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you decide to use one of the problems, leave a comment saying that you took it and link to the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;*A notable problem is one that has been discussed in Academia as opposed to one you just thought of.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2019-06-20T07:57:35.807" Title="Problems Not Yet Challenged" Tags="|discussion|" AnswerCount="4" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1477" PostTypeId="2" ParentId="1472" CreationDate="2014-04-23T10:50:46.973" Score="1" Body="&lt;p&gt;There isn't a winning criterion tag which fits.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; because the score depends on votes.&lt;/li&gt;&#xA;&lt;li&gt;It's not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; because the score depends on code length.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Given that the weight given to votes is far greater than that given to objective criteria, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; is the closest, but I think it would be better to &lt;a href=&quot;http://en.wikipedia.org/wiki/KISS_principle&quot; rel=&quot;nofollow noreferrer&quot;&gt;KISS&lt;/a&gt; and change the criterion to either be objective or subjective.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-04-23T10:50:46.973" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1478" PostTypeId="1" CreationDate="2014-04-23T10:51:55.837" Score="-5" ViewCount="157" Body="&lt;p&gt;Edit: This is not the same as Language Handicap. Language Handicap advocated for a fixed number of characters to be subtracted, which really only applies to a subset of languages, such as C++. I am advocating for an arbitrary function, such as a ratio or possibly a linear combination. These are not at all the same.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Clearly, some languages are better for golfing in than others. A solution to a problem in golfscript, J or APL will almost always be shorter than one in Python, C or Java.  Therefore, I propose we create a conversion function between scores in different languages, so that people with knowledge of different languages can compete against each other on an even footing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Requirements:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The conversion system should be based on results of popular code-golf questions.&lt;/li&gt;&#xA;&lt;li&gt;The system should be easy to understand and apply. &lt;/li&gt;&#xA;&lt;li&gt;The system should be to maintain, if new languages become popular.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I'd like to know what people think about two things:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Is a conversion function like this a good idea? Will it be a net positive to the community?&lt;/li&gt;&#xA;&lt;li&gt;If so, what are good ways of determining this conversion function?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="20080" LastEditDate="2014-04-23T11:18:19.127" LastActivityDate="2014-04-23T11:18:19.127" Title="Creating a language conversion table" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="4" ClosedDate="2014-04-23T14:51:51.337" ContentLicense="CC BY-SA 3.0" />
  <row Id="1479" PostTypeId="2" ParentId="1478" CreationDate="2014-04-23T10:51:55.837" Score="-2" Body="&lt;p&gt;A simple idea:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take the 20 code-golf tagged questions with the most votes, find the best results in a variety of languages. &lt;/li&gt;&#xA;&lt;li&gt;Establish a reference language to be one of the languages with an answer submitted to each question, find each other language's score as a ratio to that score, and take the median ratio. &lt;/li&gt;&#xA;&lt;li&gt;Throw out any languages that are submitted as answers to less than half of the questions to avoid skewing the results. &lt;/li&gt;&#xA;&lt;li&gt;To convert between two languages, divide language A's score by ratio A, then multiply by ratio B. Compare this to the score in language B.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2014-04-23T10:51:55.837" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1480" PostTypeId="1" CreationDate="2014-04-23T12:01:42.063" Score="6" ViewCount="165" Body="&lt;p&gt;I placed a bounty on a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/3652/write-a-code-golfer&quot;&gt;very old question&lt;/a&gt;, to encourage new answers as it was overlooked at the time. There are a few new answers as a result, but the attention has resulted in new upvotes on both the new answer and the old answers. I said I would assign the bounty to the highest voted answer when the time is up, but the bounty is due to expire and the highest voted answer is from 2011, thanks to its recent new upvotes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would like to assign the bounty to that old answer in recognition of the appreciation finally shown to it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would also like to assign the bounty to the highest voted new answer, which I find the most impressive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there a general guideline to which would be preferred?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In future I will always specify whether the bounty is intended for new answers or all answers, but since this (my first bounty) doesn't specify, I want to know the general feeling, or any relevant rules.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2014-08-06T15:34:58.480" Title="Should I award bounty to an old or new answer?" Tags="|discussion|" AnswerCount="3" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1481" PostTypeId="2" ParentId="1480" CreationDate="2014-04-23T12:20:10.940" Score="2" Body="&lt;p&gt;Seeing as you said:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I will award the bounty to the highest voted answer when the time is up.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;you don't really have much of a choice, do you?&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-04-23T12:20:10.940" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1484" PostTypeId="1" CreationDate="2014-04-25T15:50:45.370" Score="2" ViewCount="69" Body="&lt;p&gt;Are authors of challenges &lt;strong&gt;required&lt;/strong&gt; to post test programs along with their challenges? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;A comment on &lt;a href=&quot;https://codegolf.stackexchange.com/q/26293/18487&quot;&gt;this&lt;/a&gt; question prompted me to ask. The author of that comment appears to think that the lack either an API or a test program meant that the question deserved to be flagged as unclear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the consensus is:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;&quot;Yes.&quot;&lt;/strong&gt; then something needs to be updated. Do we have a &quot;How to ask&quot; section that is site specific? Sorry for my noobness.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&quot;No.&quot;&lt;/strong&gt; then comments like that example I linked to should be responded to.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&quot;Only if it is a KotH challenge.&quot;&lt;/strong&gt; then the KotH tag needs to be properly updated. After the tag is updated, it should not apply to challenges that already existed before the change was made.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In other words, whatever the concensus, I don't want this to turn into one of those posts that people link to in two years as a weird community ruling. There should be some action in all cases except for &quot;No.&quot; that make the consensus apparent to a new user.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-04-25T21:31:16.660" Title="Providing Test Programs" Tags="|discussion|" AnswerCount="3" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1485" PostTypeId="2" ParentId="1484" CreationDate="2014-04-25T15:59:05.393" Score="6" Body="&lt;p&gt;I've neither flagged nor downvoted that question but my opinion is that, yes, a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; question should have the scoring/testing program available from the outset. It gives anyone writing an answer something to test with, and avoids someone misunderstanding the spec and wasting effort on an answer that doesn't work.&lt;/p&gt;&#xA;" OwnerUserId="737" LastActivityDate="2014-04-25T15:59:05.393" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1486" PostTypeId="2" ParentId="1484" CreationDate="2014-04-25T16:38:09.637" Score="-3" Body="&lt;p&gt;Challenges should not be required to post test programs and test cases for the following reasons: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A well defined spec should contain all necessary information.&lt;/li&gt;&#xA;&lt;li&gt;Authors of submissions are capable of writing their own test cases and test drivers when test cases and test drivers are not given.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;More specifically, authors of King of the Hill challenges should be &lt;strong&gt;encouraged&lt;/strong&gt; to post their tried-and-true, bug-free control programs. If competing with an AI, the logic for the AI must obviously be provided in some form or fashion. The author's reasons for &lt;em&gt;not&lt;/em&gt; doing so may include the following.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It may not be possible to build the test program until after it is known what languages the submissions will use.&lt;/li&gt;&#xA;&lt;li&gt;The source code for the test program may not be available.&lt;/li&gt;&#xA;&lt;li&gt;The author may choose to withhold the test program until some number of days after the challenge starts.&lt;/li&gt;&#xA;&lt;li&gt;Test programs may contradict the written spec. Abuses of those contradictions can lead to arguments.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If the test program is required for the spec to be clear, then the spec obviously has a problem.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastActivityDate="2014-04-25T16:38:09.637" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1487" PostTypeId="2" ParentId="1126" CreationDate="2014-04-25T18:36:01.143" Score="5" Body="&lt;p&gt;I don't see any issue. You may find an interesting problem in the homework, and why you shouldn't be allowed to post it. It's not that those questions would help the student, unless the student can change &lt;code&gt;{32|}%&quot;*&quot;%.|(:w;{:x,),{:^[x&amp;gt;.1&amp;gt;]{.[^w=]\+}%{^x&amp;lt;\+w=},},},n*&lt;/code&gt; into something readable in the programming language the teacher wants. You may as well write it yourself (but I think that decoding is fun, and it will actually teach you something), instead of decoding the code golf, which probably uses slow, but short algorithm that nobody would use in real programs.&lt;/p&gt;&#xA;" OwnerUserId="3103" LastActivityDate="2014-04-25T18:36:01.143" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1488" PostTypeId="2" ParentId="1484" CreationDate="2014-04-25T21:26:11.283" Score="4" Body="&lt;p&gt;&lt;strong&gt;tl;dr:&lt;/strong&gt; Challenge authors are responsible for insuring that entry authors can know if they have or have not done the right thing; and there is flexibility in how that is accomplished.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;All challenges&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Potential authors of entries should be able to check for themselves if their program is or is not doing the right thing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In principle a really complete spec is sufficient, but we all know that&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;it is easy to miss a corner case when writing specifications&lt;/li&gt;&#xA;&lt;li&gt;specifications in words are sometimes subject to misunderstanding or even deliberate misconstrual&lt;/li&gt;&#xA;&lt;li&gt;challenge authors can have hidden assumptions that are not specified--often derived from limited experience, think about problems that are very hard in imperative programming but easy in logic programming and the like&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Sometimes these ambiguities are good because they allow room for exploration in writing solutions, but often they just leave the challenge open to uninteresting abuse and yet another pass at the same stale old jokes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I prefer to see &lt;strong&gt;a reference implementation, a test scaffold, or a reasonably complete set of test cases&lt;/strong&gt;. I am not, however, picky about which of these you provide; I simply assume that corner cases not tested are undefined and that each program may treat them or fail in it's own way.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;KoTH&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenge, the usually questions about what the spec means are exacerbated by the need to conform to some kind of interface to the scoring system. In the first of these challenges I simply provided the (earliest working version of) the scoring program, so that authors could check the performance of their entries directly. As a side effect several bugs were discovered in the scoring program, brought to my attention and fix. There was also an alternate scorer developed. Another thing you can do is provide a background field of entries whose implementations model the use of the API.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Make the specification clear for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenges includes &lt;strong&gt;everything needed for other tags &lt;em&gt;plus&lt;/em&gt; making the interface unambiguous&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;How to deal with challenges that don't comply&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If someone posts a challenge you think you'd like to try and you are stymied by the lack of a good spec &lt;em&gt;that is a reasonable reason to downvote&lt;/em&gt;. By all means, be a good neighbor and ask for clarification and reverse your vote if it is received. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;We will only get consistently good challenges if we make it more rewarding to write a good one than a bad one. While it is true that some people find enough reward in the act alone, that set does not seem to encompass all the posters on CodeGolf SE, and the rest are going to need to be mentored and chivvied along with some gentle advice and downvotes.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="78" LastEditDate="2014-04-25T21:31:16.660" LastActivityDate="2014-04-25T21:31:16.660" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1490" PostTypeId="1" CreationDate="2014-04-26T17:16:58.480" Score="4" ViewCount="152" Body="&lt;p&gt;While looking through &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/rosetta-stone&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;rosetta-stone&amp;#39;&quot; rel=&quot;tag&quot;&gt;rosetta-stone&lt;/a&gt;, I discovered that there are two types of questions tagged with it:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The type intended by the tag: answers with many different answers in different languages. Each answer shows off the answerer's programming language multilingualism.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/23423/9498&quot;&gt;A single question&lt;/a&gt; is tagged like this: different answers in different languages; no answer will be accepted. The challenge is looking for many different people to post solutions in different language and each language's shortest answer will get a mention. This was used like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, but as a challenge for each language.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;#2 could be a good idea. Some challenges don't make since when each language is battling other languages and every language will have vastly different answers. It would be a challenge in any language. For example, I am drafting a challenge that requires each answer to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1489/9498&quot;&gt;prove that its language is Turing Complete&lt;/a&gt;. This would be more appropriate as a by-language challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm proposing a new tag, something like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/by-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;by-language&amp;#39;&quot; rel=&quot;tag&quot;&gt;by-language&lt;/a&gt;. This tag would not be a challenge genre, but an addition to a genre. Any challenge with this tag would be doing a by-language challenge and apply the winning-criteria by language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Problems:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is it a good idea to make challenges where no answer will be accepted?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-04-26T17:16:58.480" Title="By-language challenges" Tags="|discussion|tags|" AnswerCount="0" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="1492" PostTypeId="1" CreationDate="2014-04-27T18:09:35.583" Score="6" ViewCount="144" Body="&lt;p&gt;With standard quotes, you can use advanced formatting, such as paragraphs.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; Sentence 1.&#xA;&amp;gt;&#xA;&amp;gt; Sentence 2.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;blockquote&gt;&#xA;    &lt;p&gt;Sentence 1.&lt;/p&gt;&#xA;    &#xA;    &lt;p&gt;Sentence 2.&lt;/p&gt;&#xA;  &lt;/blockquote&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;However, this is impossible with spoiler blockquotes.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;! Sentence 1.&#xA;&amp;gt;!&#xA;&amp;gt;! Sentence 2.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;    &lt;p&gt; Sentence 1.&#xA;&#xA; Sentence 2.&lt;/p&gt;&#xA;  &lt;/blockquote&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I think the spoilers should behave the save way as standard block quotes. Sometimes, it's nice to put a big explanation of the code in a spoiler, and currently I'm forced to use ugly &lt;code&gt;&amp;lt;br&amp;gt;&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The issue is most likely caused by that spoiler block quotes are a hack, involving checking if the block quote begins with &lt;code&gt;!&lt;/code&gt; after rendering Markdown. This should be a part of Stack Exchange Markdown implementation in my opinion, not something implemented over actual Markdown.&lt;/p&gt;&#xA;" OwnerUserId="3103" LastEditorUserId="3572" LastEditDate="2021-07-16T17:38:51.750" LastActivityDate="2021-07-16T17:38:51.750" Title="Spoilers should allow advanced formatting" Tags="|feature-request|bug|status-deferred|spoilers|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1493" PostTypeId="2" ParentId="1492" CreationDate="2014-04-27T18:15:41.077" Score="5" Body="&lt;p&gt;Yep, definitely a bug, but for now instead of &lt;code&gt;&amp;lt;br&amp;gt;&lt;/code&gt; you could end each line with two spaces.&lt;/p&gt;&#xA;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;  &lt;p&gt; Foo&lt;br&gt;&#xA;&lt;br&gt;&#xA; Bar  &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-04-27T18:15:41.077" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1494" PostTypeId="2" ParentId="1492" CreationDate="2014-04-27T19:19:33.327" Score="4" Body="&lt;p&gt;It would be worth posting a bug report at &lt;a href=&quot;https://meta.stackexchange.com/&quot;&gt;meta.stackexchange&lt;/a&gt; if it hasn't already been done.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the meantime:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;! &amp;lt;p&amp;gt;You can still use HTML markup to format spoiler text.&amp;lt;/p&amp;gt;&#xA;&amp;gt;! &amp;lt;ul&amp;gt;&#xA;&amp;gt;! &amp;lt;li&amp;gt;`Like this,`&amp;lt;/li&amp;gt;&#xA;&amp;gt;! &amp;lt;li&amp;gt;for example&amp;lt;/li&amp;gt;&#xA;&amp;gt;! &amp;lt;/ul&amp;gt;&#xA;&amp;gt;! &amp;lt;h2&amp;gt;Or this, even.&amp;lt;/h2&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;  &lt;p&gt; &lt;p&gt;You can still use HTML markup to format spoiler text.&lt;/p&gt;&#xA; &lt;ul&gt;&#xA; &lt;li&gt;&lt;code&gt;Like this,&lt;/code&gt;&lt;/li&gt;&#xA; &lt;li&gt;for example&lt;/li&gt;&#xA; &lt;/ul&gt;&#xA; &lt;h2&gt;Or this, even.&lt;/h2&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="11006" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-04-28T12:38:44.820" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1495" PostTypeId="2" ParentId="1305" CreationDate="2014-04-27T19:57:16.077" Score="2" Body="&lt;p&gt;Agree that posting a question and doing the normal feedback loop is probably the best answer usually.  But some questions may be in the form that people want to get some review before that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It seems it would be ideal to address that need for feedback in the &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;Code Golf Chat&lt;/a&gt;.  Some meta issues are sprawling and chatty by nature vs. being a fit for the Q&amp;amp;A format, and this seems like one of them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This way, people could develop their question using something like &lt;a href=&quot;https://stackedit.io/&quot; rel=&quot;nofollow&quot;&gt;StackEdit&lt;/a&gt; and shared in the cloud.  &lt;em&gt;(Or use a gist, or whatever worked well enough for a draft...MarkDown is probably not critical in the drafts.  Just suggesting StackEdit because I saw it in the open source recruiting ad campaign.)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Perhaps questions actively soliciting feedback could be &quot;pinned&quot; in the starred posts on the right hand column by room moderators, so people would notice them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also: it would send more traffic to the chat, thus improving the social/fun part of the puzzling.&lt;/p&gt;&#xA;" OwnerUserId="57" LastActivityDate="2014-04-27T19:57:16.077" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1498" PostTypeId="2" ParentId="2140" CreationDate="2014-04-29T21:55:17.797" Score="0" Body="&lt;p&gt;(this isn't quite a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/5409/water-bucket-problem&quot;&gt;Water-Bucket problem&lt;/a&gt; because that question was ill-posed and apparently abandoned; it's also not a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/20754/3-and-5-litre-jug-puzzle&quot;&gt;3 and 5 Litre Jug Puzzle&lt;/a&gt; because that one was just a single instance, and an instance of a different problem to boot)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;die-harder&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;THE PROBLEM&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In commemoration of &lt;a href=&quot;http://research.microsoft.com/en-us/news/features/lamport-031814.aspx&quot; rel=&quot;nofollow noreferrer&quot;&gt;Leslie Lamport's Turing Award&lt;/a&gt;, let's borrow a&#xA;problem from his &lt;a href=&quot;http://research.microsoft.com/en-us/um/people/lamport/tla/hyperbook.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;TLA+ online hyperbook&lt;/a&gt;.  There are two versions:&#xA;&quot;Die Hard&quot; and &quot;Die Harder.&quot; &quot;Die Hard&quot; is an instance of the general,&#xA;&quot;Die Harder&quot; problem. &quot;Die Hard&quot; is the following:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an empty jug, &lt;code&gt;jug[0]&lt;/code&gt;, with capacity 3 gallons; and an empty jug,&#xA;&lt;code&gt;jug[1]&lt;/code&gt;, with capacity 5 gallons, deliver exactly 4 gallons of water&#xA;under the following rules; you may:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;fill a jug completely, making its current amount equal to its capacity&lt;/li&gt;&#xA;&lt;li&gt;spill a jug completely, making its current amount equal to zero&lt;/li&gt;&#xA;&lt;li&gt;pour into a jug from another, either filling the destination, emptying the source, or both&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;One solution is to&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;fill jug 1 (amounts are 0, 5)&lt;/li&gt;&#xA;&lt;li&gt;pour jug 1 into jug 0 (amounts are 3, 2)&lt;/li&gt;&#xA;&lt;li&gt;spill jug 0 (amounts are 0, 2)&lt;/li&gt;&#xA;&lt;li&gt;pour jug 1 into jug 0 (amounts are 2, 0)&lt;/li&gt;&#xA;&lt;li&gt;fill jug 1 (amounts are 3, 4)&lt;/li&gt;&#xA;&lt;li&gt;spill jug 0 (amounts are 0, 4)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;I believe there are 3 more.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;Die Harder&quot; is the following:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an ordered collection of &lt;code&gt;n&lt;/code&gt; empty jugs with non-zero,&#xA;not-necessarily unique capacities &lt;code&gt;c[0], c[1], ..., c[n-1]&lt;/code&gt;, deliver&#xA;exactly &lt;code&gt;k&lt;/code&gt; gallons of water, which may be spread out over multiple&#xA;jugs, under the same rules as above.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;THE CHALLENGE&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Beat my &lt;a href=&quot;https://github.com/rebcabin/codeGolf/tree/master/die-harder&quot; rel=&quot;nofollow noreferrer&quot;&gt;reference Clojure code code&lt;/a&gt; for&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A: performance, by choice of algorithm or by optimization or both (my&#xA;algorithm becomes intolerably slow when the number of jugs &gt; 3)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;B: clarity (no obfuscators; we want to see your algorithm)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;C: elegance&lt;/p&gt;&#xA;&#xA;&lt;p&gt;D: brevity&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The above expresses the priority of the judging criteria: perf is more&#xA;important that clarity, which is more important than elegance, which is&#xA;more important than brevity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code should behave as follows:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given &lt;code&gt;n&lt;/code&gt;, capacities in the form of a bracketed list like &lt;code&gt;[3 5 7]&lt;/code&gt; and&#xA;a target amount &lt;code&gt;k&lt;/code&gt;, print &lt;code&gt;t&lt;/code&gt; solutions in a form like the following in&#xA;Clojure syntax, which is a solution for &lt;code&gt;n = 2&lt;/code&gt;, &lt;code&gt;capacities = [3 5]&lt;/code&gt;,&#xA;&lt;code&gt;k = 4&lt;/code&gt;, and &lt;code&gt;t = 2&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;({:states&#xA;  [{:amount 0, :capacity 3, :id 0} {:amount 4, :capacity 5, :id 1}],&#xA;  :trace&#xA;  [(fill-jug 0)        (fill-jug 1)       (spill-jug 0)&#xA;   (pour-from 0 1)     (spill-jug 0)      (pour-from 0 1)&#xA;   (fill-jug 1)        (pour-from 0 1)    (spill-jug 0) ] }&#xA; {:states&#xA;  [{:amount 3, :capacity 3, :id 0} {:amount 1, :capacity 5, :id 1}],&#xA;  :trace&#xA;  [(fill-jug 0)       (pour-from 1 0)     (fill-jug 0)&#xA;   (pour-from 1 0)    (spill-jug 1)       (pour-from 1 0)&#xA;   (fill-jug 0) ] } )&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Each of your &lt;code&gt;t&lt;/code&gt; solutions must present the final states of the jugs and&#xA;a sequence of moves, in order, that achieve the solution. Minor&#xA;variations to the above format are ok.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Extra credit if your code produces optimal (shortest number of moves,&#xA;fewest pours, etc.) solutions and you can prove so. You may present&#xA;proofs in commentary with your code; acceptance of a proof is at our&#xA;sole discretion, as is judgment of clarity and elegance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Include instructions for running your code if it's non-obvious (as in,&#xA;&quot;how exactly do I run this bit of INTERCAL?&quot;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;OBSERVATIONS&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the gcd of the capacities does not divide the target amount, the&#xA;problem has no solution. In your golf, you might check this (my&#xA;reference code assumes it, instead).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Certain moves, while legal, are trivial, namely:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;filling a full jug&lt;/li&gt;&#xA;&lt;li&gt;spilling an empty jug&lt;/li&gt;&#xA;&lt;li&gt;pouring from an empty jug&lt;/li&gt;&#xA;&lt;li&gt;pouring into a full jug&lt;/li&gt;&#xA;&lt;li&gt;repeating the last move, whatever it was&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;In your golf, you may either check for these trivial moves or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You might unit-test your code on inputs like the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;capacities = [3 5 7],    k = any integer from 0 through 15&#xA;capacities = [3 5 7 11], k = any integer from 0 through 26&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;A REFERENCE SOLUTION&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can find a &lt;a href=&quot;https://github.com/rebcabin/codeGolf/tree/master/die-harder&quot; rel=&quot;nofollow noreferrer&quot;&gt;reference solution in Clojure here&lt;/a&gt;. It includes unit&#xA;tests that demonstrate the program at work.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;License&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Copyright © 2014 die-harder&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Distributed under the Eclipse Public License either version 1.0 or (at&#xA;your option) any later version.&lt;/p&gt;&#xA;" OwnerUserId="20811" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.653" LastActivityDate="2014-04-30T02:26:03.823" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1499" PostTypeId="1" CreationDate="2014-04-29T21:59:12.400" Score="10" ViewCount="373" Body="&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1013/how-can-new-users-use-the-sandbox&quot;&gt;How can new users use the sandbox?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have been seeing a &lt;em&gt;LOT&lt;/em&gt; of questions lately that seem to follow the same general pattern:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Posted by a new user&lt;/li&gt;&#xA;&lt;li&gt;Have a generally difficult or non-challenging puzzle, or being too broad or too specific &lt;/li&gt;&#xA;&lt;li&gt;Have an ill-defined problem and an ill-defined winning criterion (e.g. undefined bonuses)&lt;/li&gt;&#xA;&lt;li&gt;And have all of the challenge tags (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;These questions almost immediately get downvotes, close votes, delete votes, and little feedback on why the question was wrong. I think the new users are not reading &quot;How to ask&quot;, and that this is making our site look bad. Does anyone have input on how we could encourage new users to read &quot;How to ask&quot; and maybe let them use the sandbox (see link above)?.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Oh, and for people with lots of rep, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/26386/implement-a-simple-forth-shell&quot;&gt;here is an example&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="16472" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2022-11-16T14:29:04.380" Title="The new user dilemma" Tags="|discussion|new-users|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1500" PostTypeId="2" ParentId="788" CreationDate="2014-04-30T01:15:41.507" Score="-4" Body="&lt;p&gt;How about an icon that looks like a golf ball heading toward a hole, but the golf ball is a &lt;code&gt;0&lt;/code&gt; and the flag is a &lt;code&gt;1&lt;/code&gt;? Or would this be too subtle/too difficult to work out?&lt;/p&gt;&#xA;" OwnerUserId="8793" LastActivityDate="2014-04-30T01:15:41.507" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1501" PostTypeId="1" AcceptedAnswerId="1503" CreationDate="2014-04-30T14:36:48.183" Score="15" ViewCount="1611" Body="&lt;p&gt;I'm arguing with the poster of &lt;a href=&quot;https://codegolf.stackexchange.com/a/2840/344&quot;&gt;this answer&lt;/a&gt;. The function literal as is doesn't cause the function to be defined, it has to be assigned to a variable, giving it a name or wrapping it like &lt;code&gt;(function(n){...}(1))&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is the function literal in question:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function(n){for(var c=Math.pow(10,(''+Math.floor(n)).length),v=0,l;(l=v*v&amp;lt;n),c&amp;gt;1e-10;l!=v*v&amp;lt;n?c/=10:0)v*v&amp;lt;n?v+=c:v-=c;return v}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As I suggested in the comments, it would only take 2 bytes to make this into a proper function: replace &lt;code&gt;function(n)&lt;/code&gt; with &lt;code&gt;function s(n)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I personally don't consider this acceptable, as it doesn't make sense to me. And I haven't seen anyone else doing it so far. If it's allowed, however, it could a few bytes off some present, past and future golf submissions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt; In meantime, the poster changed their code. I'd still be interested in people's opinion, though.&lt;/p&gt;&#xA;" OwnerUserId="344" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-12-04T19:33:35.613" Title="Should function literals be allowed when a function is asked for?" Tags="|discussion|code-golf|" AnswerCount="4" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1502" PostTypeId="1" AcceptedAnswerId="1506" CreationDate="2014-04-30T14:40:28.983" Score="3" ViewCount="98" Body="&lt;p&gt;There just were some syntax highlighting-only edits in the Suggested Edits queue. These edits were approved, but I rejected them because these edits are too minor in my opinion. Sometimes, I also do syntax highlighting-only edits, but then that's not a suggested edit, and I think it is too minor as a suggested edit but acceptable as a 'normal' edit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, I might be wrong, so that's why I'm asking here. Should be approve or reject syntax highlighting-only suggested edits?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;Note: this question is not the same question as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1109/9275&quot;&gt;&quot;Mass editing of syntax highlighting - good or bad?&quot;&lt;/a&gt; because that question is about edits and my question is about &lt;em&gt;suggested&lt;/em&gt; edits.&lt;/suB&gt;&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2014-04-30T17:03:32.860" Title="Should we approve or reject syntax highlighting-only suggested edits?" Tags="|discussion|reviewing|" AnswerCount="1" CommentCount="2" ClosedDate="2014-05-03T00:25:55.013" ContentLicense="CC BY-SA 3.0" />
  <row Id="1503" PostTypeId="2" ParentId="1501" CreationDate="2014-04-30T14:55:52.587" Score="33" Body="&lt;p&gt;This is obviously a named function.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def g(h):&#xA;  return h * 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;However, not all functions are named. This is an anonymous function, which is still a function.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;lambda h: h * 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You may easily notice that you can assign the function.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;g = lambda h: h * 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;However, even without this, the function is still a function. It doesn't matter if it's named or unnamed. It wastes bytes for something rather arbitrary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Normally, the functions don't have to be named.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, the question you linked to is a special case, and I agree that function should be named in this task. The reason is in question itself.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Define a function, s, which takes a number and returns the square root.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Because the task asks for particular function name, unnamed anonymous function is incorrect solution. Therefore, something like this wrong.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;lambda x:x**.5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Instead, the function should be named, as asked.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;s=lambda x:x**.5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;My personal rule would be that if the task asks for particular function name, it shouldn't be anonymous. Otherwise, anonymous functions are perfectly fine, it's not that anyone cares about their name.&lt;/p&gt;&#xA;" OwnerUserId="3103" LastActivityDate="2014-04-30T14:55:52.587" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1504" PostTypeId="2" ParentId="1501" CreationDate="2014-04-30T15:14:28.043" Score="3" Body="&lt;p&gt;This is in some sense a specialisation of a more general issue: when the question's spec assumes that all answers will be in ALGOL-like languages, how should users of other languages handle it?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this particular case, the question asks for &quot;&lt;em&gt;a function&lt;/em&gt;&quot;. But GolfScript doesn't have functions: it has blocks, which are anonymous pieces of code and can be given a name by storing them in a variable. J doesn't have functions: it has verbs, which are equally anonymous but can be given a name.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the interests of fairness, the convention has been established (via comments; there may not be a corresponding meta post) that GolfScript answers to questions which request &quot;&lt;em&gt;a function&lt;/em&gt;&quot; should give it a name and pop it: &lt;code&gt;{ BODY HERE }:f;&lt;/code&gt;. I'm not sure whether J has a similar convention: I have the impression that the J users have a stronger tendency to answer with anonymous verbs, but I don't want to look at lots of answers to check that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think that this convention should be extended to other languages with anonymous chunks of code: when a question asks for a function the answers should provide a named function or the closest equivalent. I would also favour editing questions (although not &lt;em&gt;en masse&lt;/em&gt;, obviously, because an edit bumps a question) to replace requests for &quot;&lt;em&gt;a function&lt;/em&gt;&quot; with requests for &quot;&lt;em&gt;a named function (or procedure, block, verb, etc. as appropriate to the language chosen)&lt;/em&gt;&quot;.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-04-30T15:14:28.043" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1505" PostTypeId="2" ParentId="432" CreationDate="2014-04-30T15:23:45.533" Score="2" Body="&lt;p&gt;I'm probably awful designer, but I decided to try using U+26F3 as an icon.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/u22dj.png&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In 16x16, it looks way nicer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZE3an.png&quot; alt=&quot;&quot;&gt; &lt;img src=&quot;http://cdn.sstatic.net/stackoverflow/img/favicon.ico&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="3103" LastActivityDate="2014-04-30T15:23:45.533" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1506" PostTypeId="2" ParentId="1502" CreationDate="2014-04-30T16:49:12.800" Score="4" Body="&lt;p&gt;I would personally approve it unless&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;the post is very old (I approved &lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits/10863&quot;&gt;these&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits/10864&quot;&gt;two&lt;/a&gt; old post edits today because I didn't notice the date, sorry about that)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;the language code used in that edit is invalid (I've seen &lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits/10869&quot;&gt;lang-julia&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits/10861&quot;&gt;lang-r&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits/10867&quot;&gt;lang-clojure&lt;/a&gt; in suggested edits but &lt;a href=&quot;https://meta.stackexchange.com/a/184109/259700&quot;&gt;these codes do not actually exist&lt;/a&gt;, there is no support for Julia and R and the correct code for Clojure is lang-clj)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;the code is so short it doesn't make any difference in readability (e.g. &lt;code&gt;print &quot;Hello world&quot;&lt;/code&gt;, or &lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits/10872&quot;&gt;this suggested edit&lt;/a&gt;)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="12205" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2014-04-30T17:03:32.860" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1508" PostTypeId="1" CreationDate="2014-05-02T07:31:59.553" Score="11" ViewCount="430" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/26434/java-code-to-return-if-a-word-is-present-in-a-sentence-or-not&quot;&gt;This question&lt;/a&gt; has 4 close-votes. The reason is&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This question appears to be off-topic because it is about code trolling&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Why? There are some good &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; questions out there, some of them even got into the Hot Network Questions.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Edit to clarify my question&lt;/strong&gt;&#xA;Some of you don't seem to like code-trolling. But this doesn't make it off-topic, as it is about coding/puzzling/fun. It's like you put iOS as off-topic because you prefer Android.&lt;/p&gt;&#xA;&lt;p&gt;You should downvote questions you don't like and not put them as off-topic.&lt;/p&gt;&#xA;&lt;p&gt;I'm looking for a reason why a &lt;strong&gt;good&lt;/strong&gt; code-trolling question should be off-topic.&lt;/p&gt;&#xA;" OwnerUserId="15080" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-05-02T23:50:53.370" Title="Code-Trolling now off-topic?" Tags="|discussion|code-trolling|" AnswerCount="0" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="1510" PostTypeId="2" ParentId="2140" CreationDate="2014-05-02T16:17:30.317" Score="3" Body="&lt;p&gt;&lt;em&gt;Hi, first time golf questioner, hopefully I'm doing it right!&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Maths Trade Calculator&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A &lt;strong&gt;maths trade&lt;/strong&gt; (or &quot;math&quot; trade if you prefer) is a way of calculating complex trades of arbitrary items in a circle of participants where not all participants want all items.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;X participants have an item they would like to trade. Each participant is assigned a unique number, and provides a list of (numbers identifying) the items they would willingly trade their item for. They may provide an empty list (i.e. they would rather not trade).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;X lines, one for each participant, comprising a unique number identifying them, followed by a colon, then a comma-separated-list of numbers identifying other items that they would trade for. e.g.:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1:2,3,4&#xA;2:&#xA;3:1,4&#xA;4:2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The numbers identifying the participants will not necessary be in order, nor will they necessarily be 1 to X. You may assume that they will be numeric.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This string can be in STDIN, or an argument to a function, or similar and can be followed by a new-line or not, whatever the coder prefers.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;One or more trade loops in which all participants are making trades they're happy with. Each loop should be on a new line and comprise a participant number, followed by &quot;-&gt;&quot;, followed by the participant they should give their item to, then another &quot;-&gt;&quot;, and another participant number etc, until the loop is closed and the last participant number matches the first one. Another line is added with the number of completed trades. e.g.:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1-&amp;gt;3-&amp;gt;1&#xA;2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Participants for which no valid trade is possible are omitted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output can be via STDOUT, or returned as a string, or something else, with an optional final new-line.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Trade rules&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A participant may not be involved in more than one trade&lt;/li&gt;&#xA;&lt;li&gt;A participant may not receive an item that they didn't want&lt;/li&gt;&#xA;&lt;li&gt;All loops must be closed&lt;/li&gt;&#xA;&lt;li&gt;Maximum number of possible trades should be completed (i.e. no submitting a zero-trade output and claiming it's valid). If there are multiple permutations, pick whichever you prefer.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;strong&gt;code golf&lt;/strong&gt; challenge, so shortest working code wins.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Some more example inputs and possible outputs&lt;/h3&gt;&#xA;&#xA;&lt;h3&gt;1&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1:2,3,4,5&#xA;2:3,5,7,9&#xA;3:1,2,5,6,10&#xA;4:&#xA;5:1,2,3,4,10&#xA;6:5,7,9&#xA;7:3,6,9,10&#xA;8:1,2,4,10&#xA;9:1&#xA;10:9&#xA;&#xA;1-&amp;gt;9-&amp;gt;10-&amp;gt;3-&amp;gt;1&#xA;7-&amp;gt;2-&amp;gt;5-&amp;gt;6-&amp;gt;7&#xA;8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For instance, in this trade: 9 stated that he would accept 1's item in a trade, 10 stated that he would accept 9's item, 3 would accept 10's and 1 would accept 3's. In the second loop, 2 receives 7's item, 5 receives 2's, 6 receives 5 and 7 receives 6's. (Other outputs are possible from this input.)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;2&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1:2&#xA;4:&#xA;2:3&#xA;5:1&#xA;3:4&#xA;&#xA;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;3&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1:5,9&#xA;5:1&#xA;9:1&#xA;&#xA;1-&amp;gt;5-&amp;gt;1&#xA;2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;1-&amp;gt;9-&amp;gt;1&lt;/code&gt; is also valid in this case, but both cannot be completed. Either is acceptable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Thanks for reading guys! Let me know if there are any improvements I can make.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="4124" LastEditorUserId="4124" LastEditDate="2014-05-06T08:59:00.673" LastActivityDate="2014-05-06T08:59:00.673" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1511" PostTypeId="1" CreationDate="2014-05-02T23:14:55.127" Score="31" ViewCount="2497" Body="&lt;p&gt;What format is generally good for questions? Is there a good template I can use?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1280&quot;&gt;Return to FAQ index&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2021-08-07T23:34:10.780" Title="Template For Challenges" Tags="|support|faq|" AnswerCount="1" CommentCount="1" CommunityOwnedDate="2014-05-07T00:55:36.430" ContentLicense="CC BY-SA 3.0" />
  <row Id="1512" PostTypeId="2" ParentId="1511" CreationDate="2014-05-02T23:36:48.057" Score="40" Body="&lt;p&gt;You can follow this format:&lt;/p&gt;&#xA;&lt;hr&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;Briefly describe the challenge. Provide a short background for your challenge. Briefly answer the following questions for your readers.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Why is this challenge interesting?&lt;/li&gt;&#xA;&lt;li&gt;Did you create the challenge? Give credit and provide links to your sources.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;A short paragraph will work just fine here. We do not need a book.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Describe your challenge in complete detail. The following must be present in any challenge.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A complete description of all inputs&lt;/li&gt;&#xA;&lt;li&gt;A complete description of all outputs&lt;/li&gt;&#xA;&lt;li&gt;A complete description of how input and output are related&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Answer the following questions for your readers.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are there any corner cases? Is it clear how they should be handled?&lt;/li&gt;&#xA;&lt;li&gt;How will the winner of the challenge will be determined?&lt;/li&gt;&#xA;&lt;li&gt;Is it clear how all submissions will be scored?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Avoid burying the important details of your challenge in a mound of unimportant details. Be concise. Include what needs to be included.&lt;/p&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;Provide at least one example input and output. Make sure they match your own description of what the input should look like.&lt;/p&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This is an example input&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This is an example output&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;...&lt;/p&gt;&#xA;&lt;hr&gt;&#xA;&lt;h2&gt;&lt;em&gt;&lt;strong&gt;Copy and paste the following Markdown&lt;/strong&gt;&lt;/em&gt;&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;# Introduction&#xA;&#xA;Briefly describe the challenge. Provide a short background for your challenge. Briefly answer the following questions for your readers.&#xA;&#xA; - Why is this challenge interesting?&#xA; - Did you create the challenge? Give credit and provide links to your sources.&#xA;&#xA;A short paragraph will work just fine here. We do not need a book.&#xA;&#xA;# Challenge&#xA;&#xA;Describe your challenge in complete detail. The following must be present in any challenge.&#xA;&#xA; - A complete description of all inputs&#xA; - A complete description of all outputs&#xA; - A complete description of how input and output are related&#xA;&#xA;Answer the following questions for your readers.&#xA;&#xA; - Are there any corner cases? Is it clear how they should be handled?&#xA; - How will the winner of the challenge will be determined? &#xA; - Is it clear how all submissions will be scored?&#xA;&#xA;Avoid burying the important details of your challenge in a mound of unimportant details. Be concise. Include what needs to be included.&#xA;&#xA;# Example Input and Output&#xA;&#xA;Provide at least one example input and output. Make sure they match your own description of what the input should look like.&#xA;&#xA;Input:&#xA;&#xA;&amp;gt; This is an example input&#xA;&#xA;Output:&#xA;&#xA;&amp;gt; This is an example output&#xA;&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="97857" LastEditDate="2021-04-15T13:56:40.187" LastActivityDate="2021-04-15T13:56:40.187" CommentCount="1" CommunityOwnedDate="2014-05-02T23:36:48.057" ContentLicense="CC BY-SA 4.0" />
  <row Id="1514" PostTypeId="1" AcceptedAnswerId="1517" CreationDate="2014-05-03T19:51:22.447" Score="42" ViewCount="3298" Body="&lt;p&gt;Here's our to-do list for the project:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Close all existing code-trolling questions (or maybe re-tag those three I mentioned).&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/questions/tagged/status-declined&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-declined&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-declined&lt;/a&gt; - if locked or deleted, closing might not matter, so we may or may not close them all first&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Lock all the more popular ones (&gt;20 answers or &gt;20 upvotes, say). Put the &quot;kept around for historical significance&quot; message on them. That's the key really.&lt;/li&gt;&#xA;&lt;li&gt;Do delete the rest (although I personally wouldn't even mind if we just leave them all as signposts).&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt; - here's our plan:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;if the question has more than 50% &quot;keep&quot; votes on &lt;a href=&quot;https://docs.google.com/spreadsheets/d/1WNc7jOkW46WdgroLqzYsEL81OA-ddRN4K8yaBaATFPQ/edit#gid=178826842&quot; rel=&quot;nofollow noreferrer&quot;&gt;the spreadsheet&lt;/a&gt;, lock it&lt;/li&gt;&#xA;&lt;li&gt;if the question has more than 75% &quot;delete&quot; votes, kill it with fire&lt;/li&gt;&#xA;&lt;li&gt;otherwise, decide manually, taking into consideration votes (especially posts with 25+ votes), answer count, and community input in chat&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Change the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; tag wiki to read &quot;This tag is kept around for historical reasons. Questions of this type are not considered a good fit for this site, so rethink your challenge if you wanted to use this tag.&quot;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt; - someone appears to have already done this&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Strongly discourage all future code-trolling posts by closing (and subsequently deleting) them with reference to the tag wiki or this meta discussion.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;If&lt;/em&gt; an interesting/good code troll does come up, figure out why it's good, build on that - and sort it into another appropriate tag (most likely some variant of popularity contest). Because most likely, the good thing about will not be something inherent to code trolling.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;N/A - we will do this for all code-trolling posts in the future&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I've noticed a very troubling pattern going on with code trolling.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;No, &lt;em&gt;really&lt;/em&gt;?&quot; you say sarcastically, but I've noticed something... different, something that has some &lt;strong&gt;potential&lt;/strong&gt; to be fixed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First, let me present the obvious problem with code trolling:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Ef73z.png&quot; alt=&quot;https://codegolf.stackexchange.com/questions/26083/help-how-to-do-square-root&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/VMppi.png&quot; alt=&quot;https://codegolf.stackexchange.com/questions/26303/how-do-i-multiply-two-complex-numbers&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;People are upvoting them.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;strong&gt;Don't.&lt;/strong&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'm not saying I can tell people how they can and can not use their votes, but these questions are way way &lt;em&gt;way way &lt;strong&gt;way way&lt;/em&gt;&lt;/strong&gt; too broad.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's take a look at them. The first one boils down to &quot;make something related to square roots.&quot; The second basically says &quot;do something with complex numbers.&quot; They're both essentially saying this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Write some code. Any code. Don't worry about what it does. Just put (square roots / complex numbers) somewhere in there and you'll be fine.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That is completely utterly absolutely positively undoubtedly &lt;strong&gt;too broad&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;em&gt;huge&lt;/em&gt; problem. It's a vicious circle. Some people within PPCG upvote them. (Here's the problem. They upvote and answer instead of voting to close like they should.) Mountains of answers pile up. Then these questions shoot up through the Hot Network Questions list. They get piles of upvotes and answers on and on and then new users jump in and think these are &lt;em&gt;good&lt;/em&gt; challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we're going to say &lt;em&gt;these&lt;/em&gt; are good, then I might as well just go and post this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Your challenge is to write some code. The only restriction is that it must contain at least three multiplications. Good luck!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So, could we &lt;em&gt;please&lt;/em&gt; close and delete these, instead of pushing the quality bar lower and lower?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anyway, now that we've established this, these are the &lt;strong&gt;bad&lt;/strong&gt; code trolling posts. This does not mean to close &lt;em&gt;all&lt;/em&gt; code trolling posts. &quot;Good&quot; code trolling posts may or may not exist. This is where our community is divided. So, after all this rambling, here's the point of this post.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;What do we think about code trolling?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Here are our options:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;we do not want &lt;em&gt;any&lt;/em&gt; code-trolling posts outright. They are &lt;em&gt;all&lt;/em&gt; bad &lt;strong&gt;because foo and bar&lt;/strong&gt;. (Please provide examples.) Kill them. With FIRE.&lt;/li&gt;&#xA;&lt;li&gt;there exist &lt;em&gt;some&lt;/em&gt; good code-trolling posts. (&lt;strong&gt;Example foo, example bar.&lt;/strong&gt;) To make a good code trolling post, it should have foo and bar.&lt;/li&gt;&#xA;&lt;li&gt;code-trolling is good &lt;strong&gt;because foo and bar&lt;/strong&gt;. We should leave it as is, but maybe just have a few more rules for it (like foo and bar).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Can we &lt;em&gt;finally&lt;/em&gt; figure this out?&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2023-04-12T19:27:51.037" Title="We need to take an official stance on code trolling" Tags="|discussion|status-completed|policy|code-trolling|" AnswerCount="8" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="1515" PostTypeId="2" ParentId="1514" CreationDate="2014-05-03T21:18:42.003" Score="-3" Body="&lt;p&gt;On the one hand, of all the StackExchange communities, isn't this the best place for code-trolling? A lot of spleen can get vented in a fun way without endangering innocents. If an OP is the perfect scapegoat to gnash your teeth on, why not answer it? If an answer makes you laugh, why not up-vote it?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, if the OP is just sad , down-vote it. If OP is tagged as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; and an answer is too literal, down-vote the answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the gripping hand, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/26083/help-how-to-do-square-root&quot;&gt;Help!! How to do square root!&lt;/a&gt; undercuts your argument that code-trolling is a problem. The top rated answer is a work of art (literally, but not figuratively). I laughed, I cried, I had a better day afterwards. I'm sure the answerers felt the same way.&lt;/p&gt;&#xA;" OwnerUserId="20538" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2014-05-03T22:05:15.133" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="1516" PostTypeId="2" ParentId="1514" CreationDate="2014-05-04T02:14:42.987" Score="12" Body="&lt;p&gt;My personal stance is that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; is awful and should by ruled against with all due haste.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Indeed if I was allowed to kill one of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; by simple fiat I wouldn't even hesitate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I really only have one reason, which is that the existence of the category will continually breed bad, lazy, boring challenges without end. It's just too easy for a user who has the itch to participate (a good thing) but little experience to pop over to Stack Overflow (or almost any programming forum on the internet or troll through the usenet archive) an find yet another crap question and bang, we have another ill-specified, poorly thought out piece of dreck challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Kill them with fire.&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2014-05-04T02:14:42.987" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1517" PostTypeId="2" ParentId="1514" CreationDate="2014-05-04T03:45:31.777" Score="45" Body="&lt;p&gt;&lt;strong&gt;TL;DR:&lt;/strong&gt; Get rid of code trolling - in a reasonable way and for the benefit of the community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am not a fan of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;, but I thought I'd give this tag a fair trial. So instead of just saying &quot;I don't like it, code trolling is the worst, delete ALL the questions&quot;, I'll try to justify my position as best I can. (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/812/delete-all-code-trolling-questions&quot;&gt;We tried the other tactic before and it didn't help&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Are there any good code trolling questions?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;So first, I really wanted to figure out what makes a good code trolling question (if such a thing exists). Because if there is such a thing, then all we need to do is clearly express what makes a good code troll and simply weed out the bad ones. So I went through all 24 code trolling questions. I found exactly three noteworthy ones:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/16226/i-need-a-program-where-the-user-inputs-an-array-of-doubles-and-the-program-outpu&quot;&gt;The original&lt;/a&gt;: This one was good and fun because it was a novel idea. In that sense this is only one particular (and at the time interesting) case of a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/18254/how-to-write-a-c-program-for-multiplication-without-using-the-and-operators&quot;&gt;Multiplication without + and *&lt;/a&gt;: This is interesting because it has a really clear spec. However, the actual point is that the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; tag on this question seems entirely pointless. This is just a popularity contest with a strong restriction on the allowed implementations. In fact, we have a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; tag for that.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/23614/trolling-the-troll&quot;&gt;Trolling the troll&lt;/a&gt;: As opposed to most other code trolling questions, this one actually attests the reader of the code some intelligence, and requires that the code looks like malware while being harmless - you're not going to get away with obvious obfuscations here. But that's nothing more than an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; challenge.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So what these three good (?) code trolling questions have in common is that they are really just popularity contests. The only one of them that is really related to code trolling is the first one, but if it's the only actually good such question, then &quot;code trolling&quot; as a challenge type is not a thing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;An honourable mention goes to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/21579/draw-a-trololologram&quot;&gt;drawing the trololologram&lt;/a&gt;. This one was also heavily disputed but at heart there is an interesting idea (which is also not inherently related to code trolling): devising a challenge with rules that make it &quot;obviously&quot; impossible to solve such that the challenge consists in finding loopholes. However, we all know how much we like recurring exploitation of loopholes here, so something like that can also be funny once (tops).&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So what's so bad about the other 20 questions? Basically they are all the same. They all take a bad question from SO (or make one up), and post it with the code-trolling tag as a one-line - sometimes they add a second line to ridicule the original poster over on SO. All of these could reasonably be closed as &quot;too broad&quot; without any aversion against code trolling whatsoever. Why? Because code trolling can be interpreted in any of a myriad ways (underhanded, misinterpret task, write broken code, write illegible code, write bad-practice code...) such that the only restriction that remains on submissions is that the answerer somehow has to figure out how he can claim that the program is related to the question. At the same time, while they may be &lt;em&gt;fun&lt;/em&gt;, they don't even provide a puzzle due to the lack of an actual objective/restriction. That does make them somewhat off-topic here, too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So maybe it is possible to post a good code trolling question, but &lt;em&gt;I don't know&lt;/em&gt; because &lt;em&gt;it hasn't been done yet&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Well that just screams for &quot;delete ALL the code trolling questions&quot;, right? Wait, let's look at the other side as well.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&quot;But they are popular!&quot;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The most common (only?) argument for keeping code trolling around is &quot;because it's popular&quot; (and the secondary arguments following that like &quot;we need more traffic&quot;, &quot;more questions spawn more answers, which might be interesting&quot;). Yes, code trolling questions frequently make it into the Hot Network Questions and they get a good amount of answers and upvotes from time to time. But just because it's popular that doesn't mean it's a good kind of question for this site. Even &quot;because it may generate an amazing answer from time to time&quot; &lt;em&gt;doesn't mean it's a good kind of question for this site&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;But this is a community-driven site! If it gets so many upvotes, the community wants it, and it should stay!&quot; Or should it? The StackExchange network prides itself in its high-quality content. In any case quality over quantity. StackOverflow doesn't accept duplicates or &quot;I haven't done my homework&quot; questions (those would certainly increase the volume tremendously), because they want &lt;em&gt;relevant&lt;/em&gt; questions first and foremost. This is the most important thing and it does regularly include alienating the odd new user who just wanted a quick &quot;give me teh codez&quot; to solve his problem. (Ironically these are exactly the people fans of code trolling are making fun of.) But that's fine because users (trolls) who can't accept that the StackExchange network is for high-quality content only and just want to have some fun are not the target audience here. There are places for such content, but it's not SE. (Reddit, maybe? I don't know.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Again, I thought I'd rather back that previous paragraph up with some actual examples. There are both list-type and fun questions on StackOverflow which are massively popular and have amazing (and even useful) answers. Nevertheless, they are strongly discouraged and new similar questions will be violently closed and deleted. Some examples of such questions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://stackoverflow.com/questions/388242/the-definitive-c-book-guide-and-list&quot;&gt;A list of good books on C++&lt;/a&gt;: This one is not even closed because it's so tremendously useful. But try asking a similar &quot;I need a list of...&quot; question on StackOverflow and count the seconds until 5 close votes are in. In fact, SO has a close vote reason &quot;Questions asking us to recommend or find a tool, library or favorite off-site resource are off-topic for Stack Overflow as they tend to attract opinionated answers and spam.&quot;&lt;/li&gt;&#xA;&lt;li&gt;And then there are these gems: &lt;a href=&quot;https://stackoverflow.com/questions/888224/long-held-incorrect-programming-assumptions&quot;&gt;funny&lt;/a&gt;, &lt;a href=&quot;https://stackoverflow.com/questions/1995113/strangest-language-feature&quot;&gt;funnier&lt;/a&gt;, &lt;a href=&quot;https://stackoverflow.com/questions/184618/what-is-the-best-comment-in-source-code-you-have-ever-encountered&quot;&gt;funniest&lt;/a&gt;. These all have hundreds of answers and upvotes (with some answers having over a thousand upvotes). Also, they are all closed and locked with the message &quot;This question exists because it has historical significance, but it is not considered a good, on-topic question for this site, so please do not use it as evidence that you can ask similar questions here.&quot;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;These examples show that it is not uncommon for the SE network to rule out certain kinds of questions, despite popular demand - in the interest of the community's high quality. And the thing is: people on SO understand! And those who don't - as I said - are not the target audience.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;So what should we do about code trolling?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Okay, this post is long enough, I should get to the conclusion. So? &lt;em&gt;Delete ALL the code trolling questions?&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;No, I think we can proceed with this in a somewhat more mature way, just by looking at how SO handled those questions. So here is what I'd suggest we do:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Close all existing code-trolling questions (or maybe re-tag those three I mentioned).&lt;/li&gt;&#xA;&lt;li&gt;Lock all the more popular ones (&gt;20 answers or &gt;20 upvotes, say). Put the &quot;kept around for historical significance&quot; message on them. That's the key really.&lt;/li&gt;&#xA;&lt;li&gt;Do delete the rest (although I personally wouldn't even mind if we just leave them all as signposts).&lt;/li&gt;&#xA;&lt;li&gt;Change the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; tag wiki to read &quot;This tag is kept around for historical reasons. Questions of this type are not considered a good fit for this site, so rethink your challenge if you wanted to use this tag.&quot;&lt;/li&gt;&#xA;&lt;li&gt;Strongly discourage all future code-trolling posts by closing (and subsequently deleting) them with reference to the tag wiki or this meta discussion.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;If&lt;/em&gt; an interesting/good code troll does come up, figure out why it's good, build on that - and sort it into another appropriate tag (most likely some variant of popularity contest). Because most likely, the good thing about will not be something inherent to code trolling.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If we want to hold codegolf.SE to the same high standards as the other sites in the network, we do need to have the balls to say &quot;this is not what we want&quot; even if it means losing a few potential new users.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;PS: If someone can come up with an actual good and interesting challenge whose being good and interesting relies on it also being a code trolling question, I will be the first person to admit that keeping code trolling around might be worthwhile. However, even in that case, we need to be very clear in what makes a good code trolling question and still systematically weed out all those that don't live up those standards.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2014-05-06T09:57:54.720" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="1518" PostTypeId="1" CreationDate="2014-05-04T12:31:58.500" Score="0" ViewCount="268" Body="&lt;p&gt;It would be nice to make subscript and superscript work in comments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here, these work :&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;*n*&amp;lt;sub&amp;gt;0&amp;lt;/sub&amp;gt;&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;&lt;/code&gt;  →  &lt;em&gt;n&lt;/em&gt;&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;_n_&amp;lt;sub&amp;gt;0&amp;lt;/sub&amp;gt;&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;&lt;/code&gt;  →  &lt;em&gt;n&lt;/em&gt;&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In comments, these fail.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thank you.&lt;/p&gt;&#xA;" OwnerUserId="12943" LastEditorUserId="68942" LastEditDate="2021-06-09T05:29:37.993" LastActivityDate="2021-06-09T05:29:37.993" Title="Subscript and superscript in comments fail" Tags="|feature-request|status-declined|comments|formatting|markdown|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1519" PostTypeId="2" ParentId="1518" CreationDate="2014-05-04T13:01:28.983" Score="4" Body="&lt;p&gt;That doesn't work because HTML is not supported in comments. &lt;a href=&quot;https://meta.stackexchange.com/q/6407/229438&quot;&gt;It has been suggested on Meta Stack Exchange to enable it in comments&lt;/a&gt;, but it got declined. See &lt;a href=&quot;https://meta.stackexchange.com/a/28523/229438&quot;&gt;this answer&lt;/a&gt; from &lt;a href=&quot;https://meta.stackexchange.com/users/1/jeff-atwood&quot;&gt;Jeff Atwood ♦&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;We do allow very limited markdown in comments now. Click the &quot;help&quot;&#xA;  link below the Add Comment button to get comment formatting help.&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;code&gt;*&lt;/code&gt; and &lt;code&gt;_&lt;/code&gt; for bold, italic&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;``&lt;/code&gt; for code blocks&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;[example](http://example.com &quot;merely an example&quot;)&lt;/code&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;  &#xA;  &lt;p&gt;No HTML, just Markdown in comments, please!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Or, if you really need it, use &lt;a href=&quot;https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts&quot; rel=&quot;nofollow noreferrer&quot;&gt;Unicode subscript/superscript characters&lt;/a&gt;, as I demonstrated in my comment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Superscript characters:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;⁰ ¹ ² ³ ⁴ ⁵ ⁶ ⁷ ⁸ ⁹&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Subscript characers:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;₀ ₁ ₂ ₃ ₄ ₅ ₆ ₇ ₈ ₉&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-05-04T13:10:11.673" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="1520" PostTypeId="2" ParentId="1514" CreationDate="2014-05-04T14:58:01.127" Score="3" Body="&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt;&#xA;Change &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; to prevent bad questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I really like code-trolling questions. Well, not the questions itselves, but the answers. They are creative, show effort and some are really about puzzling. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The questions are the problem. People write a short problem (which is mostly way too broad) and simply tag it with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;. But people vote them up (don't ask me why). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;All of the code-trolling questions are popularity-contests (or should be), so why not simply change them? Then people would have to give specific information about the problem.&#xA;Simple example:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Write a function which returns the square root of the input. &lt;s&gt;The code should look totally correct to a beginner, but the coding-style has to look horrible for a professional programmer.&lt;/s&gt; The program has to look totally correct (at least on the first sight), but it should NOT return the correct square root (difference &gt;0.1).&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This sounds much better to me (and is more specific) than&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;HALP ME how to do square root?!!! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;With this solution, we wouldn't disappoint the fans of code-trolling and the bad questions will go away.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I agree with m.buettner that the old, bad code-trolling questions have to disappear/change. After that, kill the whole tag.&#xA;&lt;hr /&gt;&#xA;&lt;strong&gt;Edit:&lt;/strong&gt;&#xA;As pointed out by m.buettner (thanks!) in the comments, a good solution for my idea would be to add something like &quot;If you think you DID come up with an a new/interesting code-trolling type question, consider posting it as a popularity contest (or some other appropriate tag)&quot; to the code-trolling tag wiki.&lt;/p&gt;&#xA;" OwnerUserId="15080" LastEditorUserId="15080" LastEditDate="2014-05-06T06:51:59.813" LastActivityDate="2014-05-06T06:51:59.813" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="1521" PostTypeId="2" ParentId="2140" CreationDate="2014-05-05T03:12:02.457" Score="1" Body="&lt;h1&gt;Generate a text-art table&lt;/h1&gt;&#xA;&lt;p&gt;Making tables with ASCII-art and with Box-drawing characters is tedious work. Let's simplify this work by automating it with a program:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input and Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The first line of input signify's whether the user wants an ASCII table or a Box-drawn one. This is simply given as a number: &lt;code&gt;1&lt;/code&gt; for ASCII, &lt;code&gt;0&lt;/code&gt; for Box-drawing.&lt;/p&gt;&#xA;&lt;p&gt;If the user wants an ASCII table, use &lt;code&gt;+&lt;/code&gt; for any corner or intersection, &lt;code&gt;-&lt;/code&gt; for a horizontal bar, and &lt;code&gt;|&lt;/code&gt; for a vertical bar.&lt;/p&gt;&#xA;&lt;p&gt;If the user wants a Box-drawn table, you must use these characters (the light characters from &lt;a href=&quot;http://en.wikipedia.org/wiki/Box-drawing_character&quot; rel=&quot;nofollow noreferrer&quot;&gt;Box-drawing characters&lt;/a&gt;):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;┌&#xA;└&#xA;┐&#xA;┘&#xA;├&#xA;┬&#xA;┴&#xA;┤&#xA;─&#xA;│&#xA;┼&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The next lines of input will be tab delimited, newline delimited entries. Newlines delimit rows of the entry, and tabs delimit columns. If the user wants multiple columns on a cell, this will be delimited by a &lt;code&gt;\&lt;/code&gt;. &lt;code&gt;\\&lt;/code&gt; asks for a literal &lt;code&gt;\&lt;/code&gt;. If the user wants to join two cells, this will be indicated by &lt;code&gt;\=&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You will output a table that meets the user-defined specifications. Space-buffer the cell content, that is, prepend and append a space when inserting it in the table. When centering the text, prefer prepending spaces to appending them. Shrink the leftmost cell possible when there is a choice. Columns always line up, whether the lines form from a &lt;code&gt;\&lt;/code&gt; or a tab.&lt;/p&gt;&#xA;&lt;p&gt;For example, this input (&lt;code&gt;→&lt;/code&gt; is a tab):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0&#xA;Box-drawing Characters&#xA;Character\Description&#xA;~~~~Corners~~~~&#xA;┌\Upper left corner&#xA;└\Lower left corner&#xA;┐\Upper right corner&#xA;┘\Lower right corner&#xA;~~~~'T's~~~~&#xA;├\Left side T&#xA;┬\Upper side T&#xA;┴\Lower side T&#xA;┤\Right side T&#xA;~~~~Lines~~~~&#xA;─\Horizontal line&#xA;│\Vertical line&#xA;~~~~Other~~~~&#xA;┼\Middle intersection&#xA;Hmmm,\if\3\\s?&#xA;This\Is\The\End&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output (&lt;code&gt;//&lt;/code&gt; after the table is my commentary on the output, should not actually be in it):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;┌─────────────────────────────────┐&#xA;│      Box-drawing Characters     │&#xA;├───────────┬─────────────────────┤&#xA;│ Character │     Description     │&#xA;├───────────┴─────────────────────┤&#xA;│         ~~~~Corners~~~~         │&#xA;├───────────┬─────────────────────┤ //The line for the column split lines up with the previous lines&#xA;│     ┌     │  Upper left corner  │ //This line was too long, so the previous lines got longer to accommodate it.&#xA;├───────────┼─────────────────────┤&#xA;│     └     │  Lower left corner  │&#xA;├───────────┼─────────────────────┤&#xA;│     ┐     │  Upper right corner │ //Too long again&#xA;├───────────┼─────────────────────┤&#xA;│     ┘     │  Lower right corner │&#xA;├───────────┴─────────────────────┤&#xA;│           ~~~~'T's~~~~          │&#xA;├───────────┬─────────────────────┤&#xA;│     ├     │     Left side T     │&#xA;├───────────┼─────────────────────┤&#xA;│     ┬     │     Upper side T    │&#xA;├───────────┼─────────────────────┤&#xA;│     ┴     │     Lower side T    │&#xA;├───────────┼─────────────────────┤&#xA;│     ┤     │     Right side T    │&#xA;├───────────┴─────────────────────┤&#xA;│          ~~~~Lines~~~~          │&#xA;├───────────┬─────────────────────┤&#xA;│     ─     │   Horizontal line   │&#xA;├───────────┼─────────────────────┤&#xA;│     │     │     Vertcal line    │&#xA;├───────────┴─────────────────────┤&#xA;│          ~~~~Other~~~~          │&#xA;├───────────┬─────────────────────┤&#xA;│     ┼     │ Middle intersection │ //Too long, so other lines adjusted&#xA;├───────┬───┴┬────────────────────┤&#xA;│ Hmmm, │ if │        3\s?        │ //Because the user wants to divide into 3, the cells don't line up with the previous ones.&#xA;├──────┬┴───┬┴────┬───────────────┤&#xA;│ This │ is │ The │      End      │ //Although the result would have been the same if this did not line up with the 2-cell-split, it must line up because we are dividing by 4, which is a multiple of 2.&#xA;└──────┴────┴─────┴───────────────┘&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;hello→World→!&#xA;\Lorem→Ipsum.\Quick→Fox&#xA;\=\=&#xA;This is\ → the\ last→row.\&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Produces this as an output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+------------------+----------------+---------+&#xA;|       hello      |      World     |    !    |&#xA;+---------+--------+--------+-------+---------+&#xA;|         |  Lorem | Ipsum. | Quick |   Fox   |&#xA;+---------+--------+--------+-------+---------+&#xA;|                                             |&#xA;+---------+--------+--------+-------+------+--+&#xA;| This is |        |   the  |  last | row. |  |&#xA;+---------+--------+--------+-------+------+--+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Meta:&lt;/p&gt;&#xA;&lt;p&gt;Is my specification well defined enough yet?&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-05-09T17:26:55.227" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1522" PostTypeId="2" ParentId="2140" CreationDate="2014-05-05T03:12:33.620" Score="2" Body="&lt;h1&gt;Am I a Matroid?&lt;/h1&gt;&#xA;&lt;h2&gt;Input:&lt;/h2&gt;&#xA;&lt;p&gt;A list &lt;code&gt;I&lt;/code&gt; that is a subset of the powerset of &lt;code&gt;E={1,2,...,n}&lt;/code&gt; which represents the independent sets of elements of the purported matroid &lt;code&gt;M=(E,I)&lt;/code&gt;. Note that the cardinality of the ground set may be for the purposes of this question ignored. Any elements of &lt;code&gt;E&lt;/code&gt; that appear in none of the elements of &lt;code&gt;I&lt;/code&gt; cannot contribute (i.e. if &lt;code&gt;M=(E,I)&lt;/code&gt; is a matroid then &lt;code&gt;M=(E union K,I)&lt;/code&gt; is a matroid for any set &lt;code&gt;K&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Input may be in whatever list format you desire, be it as simple as no separators but spaces (using &lt;code&gt;0&lt;/code&gt; for the empty set): &lt;code&gt;0 1 2 3 12 13&lt;/code&gt; or as complicated as whatever list literals are in your favorite language (such as python's: &lt;code&gt;[[],[1],[2],[3],[1,2],[1,3]]&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;h2&gt;Output:&lt;/h2&gt;&#xA;&lt;p&gt;A variation on &lt;code&gt;1/0&lt;/code&gt;, &lt;code&gt;true/false&lt;/code&gt;, &lt;code&gt;yes/no&lt;/code&gt; answering the question: is &lt;code&gt;M&lt;/code&gt; a matroid?&lt;/p&gt;&#xA;&lt;h2&gt;Definition:&lt;/h2&gt;&#xA;&lt;p&gt;&lt;code&gt;M=(E,I)&lt;/code&gt; is a matroid if:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;I&lt;/code&gt; is not the empty set&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;J&lt;/code&gt; is in &lt;code&gt;I&lt;/code&gt; and &lt;code&gt;K&lt;/code&gt; is a subset of &lt;code&gt;J&lt;/code&gt;, then &lt;code&gt;K&lt;/code&gt; is in &lt;code&gt;I&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;J,K&lt;/code&gt; are in &lt;code&gt;I&lt;/code&gt; and &lt;code&gt;|K|&amp;lt;|J|&lt;/code&gt; then there exists an element &lt;code&gt;x&lt;/code&gt; that is in the set difference &lt;code&gt;J-K&lt;/code&gt; such that &lt;code&gt;K union {x}&lt;/code&gt; is in &lt;code&gt;I&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;There are equivalent formulations of condition 1 and 3, also there are conditions on the bases (maximal elements of &lt;code&gt;I&lt;/code&gt; w.r.t. cardinality) that are equivalent to these. If people want I can post those too or leave them as optional research.&lt;/p&gt;&#xA;&lt;h2&gt;Examples:&lt;/h2&gt;&#xA;&lt;p&gt;&lt;code&gt;I={{},{1},{2},{1,2}}&lt;/code&gt; is a matroid.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;I={}&lt;/code&gt; is not a matroid because it is empty (by axiom 1).&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;I={{},{1},{1,3}}&lt;/code&gt; is not a matroid because if it has &lt;code&gt;{1,3}&lt;/code&gt; independent then it must have &lt;code&gt;{3}&lt;/code&gt; independent (by axiom 2).&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;I={{},{1},{2},{3},{1,2}}&lt;/code&gt; is not a matroid because if it has &lt;code&gt;{1,2}&lt;/code&gt; and &lt;code&gt;{3}&lt;/code&gt; independent then it must have either &lt;code&gt;{1,3}&lt;/code&gt; or &lt;code&gt;{2,3}&lt;/code&gt; independent (by axiom 3).&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;I={{}}&lt;/code&gt; is always a matroid, as is &lt;code&gt;I=powerset([1,2,...,n])&lt;/code&gt; for any &lt;code&gt;n&amp;gt;0&lt;/code&gt; as they both trivially satisfy the axioms.&lt;/p&gt;&#xA;&lt;h2&gt;Specs:&lt;/h2&gt;&#xA;&lt;p&gt;Submission is either a program taking input from standard input or command line argument or a function that takes &lt;code&gt;I&lt;/code&gt; as input (as a string) and returns the specified binary answer. No upperbound on the size of input should be hardcoded.&lt;/p&gt;&#xA;&lt;p&gt;I would intend for this to be a code-golf challenge.&lt;/p&gt;&#xA;" OwnerUserId="8133" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-05-05T04:19:35.283" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1523" PostTypeId="1" CreationDate="2014-05-05T17:39:39.263" Score="5" ViewCount="334" Body="&lt;p&gt;&lt;strong&gt;Winning criteria&lt;/strong&gt; determine which submission wins. For example, the following are winning criteria.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The submission with the fastest code on any reasonable desktop machine wins.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Valid criteria&lt;/strong&gt; determine if a submission is correct. For example, the following are valid criteria.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The submission must run in under 2 minutes on any reasonable desktop machine.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;While discussing exactly how subjective we want to allow &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; questions to be, another user and I came up with two possible standards. I added the third for good measure.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Winning criteria should be objective. Valid criteria should be given leeway.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The example winning criteria is unacceptable because it failed to define the testing environment, but the example valid criteria is acceptable.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Winning criteria should be objective. Valid criteria should also be objective.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The example winning criteria is unacceptable because it failed to define the testing environment, and the example valid criteria is unacceptable for the same reason.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Winning criteria should have leeway. Valid criteria should also have leeway.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The example winning criteria is acceptable. The example valid criteria is also acceptable.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Which stance is correct?&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="56656" LastEditDate="2020-02-03T17:31:28.643" LastActivityDate="2020-02-03T17:31:28.643" Title="Winning Criteria vs Valid Criteria" Tags="|discussion|winning-criteria|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1524" PostTypeId="2" ParentId="1523" CreationDate="2014-05-05T17:39:39.263" Score="1" Body="&lt;p&gt;&lt;strong&gt;Winning criteria and valid criteria should both be well-defined.&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a challenge contains any kind of performance related criteria, then the conditions for testing should also be well described, regardless of whether the criteria is &quot;winning&quot; or &quot;valid&quot;. If the author of the challenge is unable to completely describe the testing environment, then they should take sole responsibility for testing the submissions on their own machine. This should be stated clearly in the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If testing is being performed automatically, the source code for the test driver should be included. For time related challenges, clock time should be the default unless CPU time (or other) is specified.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="18487" LastEditDate="2014-05-05T19:30:03.197" LastActivityDate="2014-05-05T19:30:03.197" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1525" PostTypeId="2" ParentId="674" CreationDate="2014-05-06T08:14:44.083" Score="-3" Body="&lt;p&gt;I think the ties should be broken by the number of upvotes.&lt;/p&gt;&#xA;" OwnerUserId="20946" LastActivityDate="2014-05-06T08:14:44.083" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1526" PostTypeId="2" ParentId="1514" CreationDate="2014-05-06T10:18:46.513" Score="6" Body="&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt; re-tag good questions as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt;, then get rid of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I'm finding it impossible to defend this tag any longer. I was going to cite &lt;a href=&quot;https://codegolf.stackexchange.com/q/23614/11006&quot;&gt;Trolling the troll&lt;/a&gt; as a good example of the genre, but this question was re-tagged as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; in &lt;a href=&quot;https://codegolf.stackexchange.com/posts/23614/revisions&quot;&gt;an edit by xfix a couple of days ago&lt;/a&gt;. This seems like a good idea. If there are any code-trolling questions that can't be retagged as underhanded, they probably belong in &lt;a href=&quot;http://www.reddit.com/r/shittyprogramming/&quot; rel=&quot;nofollow noreferrer&quot;&gt;/r/shittyprogramming&lt;/a&gt;, not here.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Another suggestion:&lt;/h3&gt;&#xA;&lt;p&gt;If we don't reach an immediate consensus, could we at least start by doing something about the tag wiki? This is what users currently see when posting a new question:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/hxFNa.png&quot; alt=&quot;blah&quot; /&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&amp;quot;The task is to give code that works, but is useless, severely frustrating the OP.&amp;quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is one of the shortest tag summaries we have, and gives no indication of any of the problems people have been raising in meta discussions. To see the rules that actually address these problems, the user would have to follow the &amp;quot;&lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-trolling/info&quot;&gt;learn more&lt;/a&gt;&amp;quot; link, then scroll down to the bottom of the page. I would imagine that most [code-trolling] questions are being asked by people who are &lt;em&gt;completely unaware of these rules&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I suggest expanding the opening paragraph to something like this:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The task is to give code that works, but is useless, severely frustrating the OP. Please read the guidelines carefully before posting a new &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; question. In particular, questions that are too broad are liable to be closed on sight.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;(The remainder of the wiki looks OK to me)&lt;/p&gt;&#xA;" OwnerUserId="11006" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-05-06T10:18:46.513" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1528" PostTypeId="2" ParentId="2140" CreationDate="2014-05-06T18:08:08.770" Score="0" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;I have not put substantial effort into this sandbox post. Since I am&#xA;  unsure(and it's probably not) whether this kind of question is a good&#xA;  fit for this site or not. If somebody reputable mentions that the idea&#xA;  has merit, I'll tune this sandbox up, and try to get it in shape for&#xA;  posting.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Obviously the biggest problem is how do you test the code? And that's&#xA;  the part I'm stuck on. If anyone can think of a way to overcome this&#xA;  please let me know! Anyway, here it is:&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Write a program that posts itself as an answer&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program must establish an http connection to codegolf.stackexchange.com, login, and post an answer to this question. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The answer must be in the form of:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;[Language]&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Code&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rules: Cannot read source file, or any resource which is identical to your source file in any way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Tags: popularity contest, quine&lt;/p&gt;&#xA;" OwnerUserId="9516" LastActivityDate="2014-05-06T18:08:08.770" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1529" PostTypeId="1" AcceptedAnswerId="1551" CreationDate="2014-05-06T21:19:41.310" Score="10" ViewCount="557" Body="&lt;p&gt;P&amp;amp;CG is over 3 years old now. I hope one day it gets out of beta, I have a lot of fun here... even though I mostly pose questions rather than answering them myself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anyway, I checked the recent posting activity of our moderators, and... it was not great, both in the main site and in meta. @Doorknob &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/757/moderation-a-call-to-action&quot;&gt;wrote it up quite well here 4 months ago&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd like to see more effort taken to moderate the site, especially from the users who are &lt;strong&gt;currently&lt;/strong&gt; active, in addition to being well respected. I notice that none of the moderators weighed in, either as a comment or as an answer, to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1192/what-does-code-golfs-progress-look-like-right-now&quot;&gt;Grace Note's post back in March&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am not taking anything away from the hard work the current moderators have done, and are currently putting in. In the past they have done a stellar job. But as &lt;a href=&quot;https://meta.stackoverflow.com/a/253376/1768232&quot;&gt;was recently said on MSO, &lt;strong&gt;People change. Lives change.&lt;/strong&gt;&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's entirely possible that I'm completely wrong, and that all three moderators are working very hard handling flags and doing other work that I cannot see as a mere mortal. If this is the case, please let me and the rest of the community know, as it will make me feel much better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think we should contact the SE staff and ask them to make some changes. I don't know exactly what, I haven't been here long enough to make the best recommendation. But I would like to officially nominate @Doorknob to be a moderator, were he willing to take the reins.&lt;/p&gt;&#xA;" OwnerUserId="17249" LastEditorUserId="-1" LastEditDate="2017-03-17T10:37:58.557" LastActivityDate="2014-05-09T19:06:29.600" Title="Does P&amp;CG need a new moderator?" Tags="|discussion|status-completed|beta-status|moderators|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1530" PostTypeId="2" ParentId="1529" CreationDate="2014-05-06T21:35:24.767" Score="14" Body="&lt;p&gt;I have a few things that I might be able to weigh in on:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The community has gotten &lt;em&gt;drastically&lt;/em&gt; better at self-moderation over the past few months or so. I'm not the only one who deletevotes anymore, and we're getting bad things closed much more quickly recently.&lt;/li&gt;&#xA;&lt;li&gt;As @Chris mentioned in that post I made a while ago, lots of modstuffs are hidden and not publicly visible. Moderators also are supposed to let the community lead, and our current mods are &lt;em&gt;fantastic&lt;/em&gt; at doing this. I'm sure they'd all just love to nuke code-trolling or supress popularity-contest. (I wouldn't mind the mods hopping in for a 4th or 5th closevote or 3rd deletevote every once in a while though.)&lt;/li&gt;&#xA;&lt;li&gt;You could always ping the SE staff in &lt;a href=&quot;http://chat.meta.stackexchange.com/rooms/89/tavern-on-the-meta&quot;&gt;Tavern on the Meta&lt;/a&gt;; they're quite good at responding there.&lt;/li&gt;&#xA;&lt;li&gt;I believe one or two of our current mods have mentioned handing back their diamonds. I'm sure they're excellent moderators, and they're all nice people. It'd be a shame to lose them, but if they think that others would be more suitable for the job, getting some new users in the mod team would be great.&lt;/li&gt;&#xA;&lt;li&gt;I've still been considering whether I'd want to get a diamond here, given the chance. I'll tentatively accept your nomination, but only if you don't make me kick out a current mod that still wants to be here, because that would feel terrible. :P&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-05-06T21:35:24.767" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1531" PostTypeId="1" CreationDate="2014-05-07T02:29:35.717" Score="2" ViewCount="55" Body="&lt;p&gt;Is it recommended to compile/run/check every answer (or the shortest for code-golf challenges) before accepting an answer?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Has people even posted code which looks good but doesn't work?&lt;/p&gt;&#xA;" OwnerUserId="10619" LastActivityDate="2014-05-07T12:05:51.407" Title="Should I check the answers to my questions?" Tags="|discussion|support|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1532" PostTypeId="2" ParentId="1531" CreationDate="2014-05-07T08:32:53.360" Score="2" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Has people even posted code which looks good but doesn't work?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Yes. In &lt;a href=&quot;https://codegolf.stackexchange.com/q/21114/12205&quot;&gt;Weirdest way to produce a stack overflow&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/21130/12205&quot;&gt;this answer (now deleted)&lt;/a&gt; has provided an answer that nobody can reproduce.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's a screenshot for those without enough rep to view deleted answers:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/rmh7N.png&quot; alt=&quot;screenshot&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="12205" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-05-07T12:05:51.407" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1534" PostTypeId="1" CreationDate="2014-05-07T22:00:19.450" Score="8" ViewCount="510" Body="&lt;p&gt;It looks like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1514/we-need-to-take-an-official-stance-on-code-trolling/&quot;&gt;days are numbered&lt;/a&gt;. There seems to be overwhelming consensus that the tag is bad for the site, and should be removed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Before we stamp it out, there are a few things that need to happen. One of them is deciding which &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; questions to keep around. Just like SO keeps &lt;a href=&quot;https://stackoverflow.com/questions/234075/what-is-your-best-programmer-joke&quot;&gt;old questions&lt;/a&gt; around that would be deleted in a heartbeat today, there's no reason not to keep some &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; questions around for their historical significance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or maybe you think we should purge them all. That's okay too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are only &lt;strong&gt;23&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; questions on the site. Since that's not a very large number, that allows us to get the community's opinion on whether each individual question should be kept and given a historical lock (effectively preventing almost any action on the post) or deleted.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://docs.google.com/forms/d/1iQf4108JB5D18gGbxPyAekwpvHlX5xqhUhsPI5fCzHg/viewform&quot; rel=&quot;nofollow noreferrer&quot;&gt;If you'd like your voice to be heard, this is the link for you.&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Every &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; question on the site is listed on that page with three options: &lt;strong&gt;Keep&lt;/strong&gt;, &lt;strong&gt;Delete&lt;/strong&gt;, or &lt;strong&gt;Indifferent&lt;/strong&gt;. If you want the post to be kept (and to get a historical lock), select &lt;strong&gt;Keep&lt;/strong&gt;. If you want it to be deleted, click &lt;strong&gt;Delete&lt;/strong&gt;. Otherwise, click &lt;strong&gt;Indifferent&lt;/strong&gt;. Repeat that process another 22 times, and click submit. Your choices will be added to the spreadsheet &lt;a href=&quot;https://docs.google.com/spreadsheets/d/1WNc7jOkW46WdgroLqzYsEL81OA-ddRN4K8yaBaATFPQ/edit#gid=178826842&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;, which will be taken into account when the actual decisions are made.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I feel like that should be stressed: This vote is &lt;em&gt;not&lt;/em&gt; solely to determine what questions will be deleted, but it will be used as an indicator of the community's opinion when choosing them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The choices will be made soon, so get your votes in ASAP! (Really, there's only 23 questions. It doesn't take long.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want to be involved with more than just voting, join us in &lt;a href=&quot;http://chat.stackexchange.com/rooms/14385/the-great-code-trolling-purge-of-2014&quot;&gt;the chat room&lt;/a&gt; to organise/discuss the next steps for dealing with code trolling.&lt;/p&gt;&#xA;" OwnerUserId="14509" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2014-05-09T14:32:10.447" Title="Which code trolling questions are worth keeping?" Tags="|discussion|code-trolling|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1535" PostTypeId="1" CreationDate="2014-05-07T22:05:04.853" Score="5" ViewCount="416" Body="&lt;p&gt;I recently posted a Java golf that massively abuses &lt;code&gt;for&lt;/code&gt; loop syntax to save a few characters. However, this makes it almost impossible to ungolf without changing the semantics (of the uncompiled code).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should I do so?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Ungolfed logic is easier to read/follow&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Cons:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Some of the golfing tricks are no longer present in the ungolf&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Followup: What about changing variable names? I've seen it done in some cases and not in others.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="17249" LastActivityDate="2014-05-07T22:34:37.983" Title="Tips for ungolfing code" Tags="|discussion|etiquette|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1536" PostTypeId="2" ParentId="1535" CreationDate="2014-05-07T22:07:46.300" Score="2" Body="&lt;p&gt;Golfed code is, primarily, about making the shortest code possible. It is not necessary to optimise for &quot;readability/followability&quot;. This means that the ungolfed version may equally be unreadable. That's okay.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By way of example, in my &lt;a href=&quot;https://codegolf.stackexchange.com/a/222/3&quot;&gt;Scheme RPN calculator solution&lt;/a&gt;, I used &lt;code&gt;`(,foo,@bar)&lt;/code&gt; as a golfed version of &lt;code&gt;(cons foo bar)&lt;/code&gt;. My ungolfed code also used that notation (with a space in the correct place, of course), and I added a note saying that it's equivalent to &lt;code&gt;cons&lt;/code&gt;. That way, people who want to follow the code can, but the ungolfed version is still one-to-one with the golfed version.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Variable names should all be as short as possible in golfed code. Usually, this means they should be single-character names. Thus, it's okay to change those to more readable names in the ungolfed version.&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-05-07T22:20:29.987" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1537" PostTypeId="2" ParentId="1535" CreationDate="2014-05-07T22:18:40.457" Score="2" Body="&lt;p&gt;Normally I don't call mine an &quot;ungolfed&quot; version to start with. I say &quot;here it is with line breaks&quot; just to avoid this sort of thing. If my code isn't legible like that, then it needs a short &lt;em&gt;explanation&lt;/em&gt;, not variable names and braces.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Especially with Java, the golfed code is sometimes still a &lt;em&gt;large&lt;/em&gt; amount of characters on a single line. That sucks &lt;em&gt;mainly&lt;/em&gt; because scrolling horizontally is just horrible. With a few line breaks, it makes it &lt;em&gt;much&lt;/em&gt; easier to follow, even without unrolling the loops, adding braces, changing variable names, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you have a particularly abusive loop (I assume you mean a bunch of statements crammed into the last section), you can just add a line break for each statement:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;for(int i=0;i&amp;lt;whatever;&#xA;                       k/=i,&#xA;                       m/=i,&#xA;                       System.out.print(i++)&#xA;                       );&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It's not the prettiest, and I only recommend that if it really looks bad on one line (adding horizontal scroll, for instance).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Besides just line breaks, it should also be indented properly. I don't care what conventions you follow, as long as it's consistent and obvious what block goes where. The braces in particular become basically obsolete at that point, and anyone who's seen a few golfed answers should be able to see the structure immediately.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This also has the advantage of making it immensely &lt;em&gt;easier&lt;/em&gt; to get an &quot;ungolfed&quot; version that corresponds exactly to the golfed one. All you have to do is edit in/out a few line breaks. There are online minifiers that can take care of that for you for several languages, and options in some IDEs to add them back in. That's particularly useful if you have golfed 2-3 characters out several times. Going back through and changing variable names in both versions you posted and making sure they're both &quot;right&quot; takes a bit more.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="14215" LastEditDate="2014-05-07T22:34:37.983" LastActivityDate="2014-05-07T22:34:37.983" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1538" PostTypeId="1" CreationDate="2014-05-08T06:41:31.200" Score="1" ViewCount="91" Body="&lt;p&gt;After reading &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1470/9498&quot;&gt;Re-evaluating [tips] and tip-like questions&lt;/a&gt; and the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions, I determined that we currently use &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; for two things: code-golfing questions, and language creation questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regarding non code-golfing tip questions, wouldn't it be better to drop the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; tag because &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; seems to be used for tips on how golf better?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, most questions tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; are also tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. This does not make sense, as:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;code golf tag wiki&lt;/a&gt; makes it seem that the question is a challenge, which it is not&lt;/li&gt;&#xA;&lt;li&gt;This seems to make &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; a meta tag&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;However, it seems logical that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; could be used for other tips, such as tips for writing answers to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What should &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; be? Should it be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/golfing-tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;golfing-tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;golfing-tips&lt;/a&gt;? If so, we could create &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fast-code-tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fast-code-tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;fast-code-tips&lt;/a&gt;, etc. Or, should we just keep on tagging &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; only? Or should we increase its range to all of the primary winning criteria (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt;, etc)?&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-05-08T13:43:51.973" Title="What exactly is the [tips] tag?" Tags="|discussion|tags|" AnswerCount="0" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1540" PostTypeId="2" ParentId="1470" CreationDate="2014-05-08T17:29:08.653" Score="-10" Body="&lt;p&gt;&lt;strong&gt;How to answer all challenges is &lt;em&gt;site&lt;/em&gt; level, not &lt;em&gt;challenge&lt;/em&gt; level.&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This abstraction is the one that my brain told me was the way to organize things, but it appears to be lost in a tangled web of lawyery phrases by others. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I understand that you can word it differently and get a different result. For example, &quot;Questions about golfing are not questions about the &lt;em&gt;site&lt;/em&gt;.&quot; This has been beaten to death in chat, so let's agree to disagree here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The author does not deserve rep for tips questions.&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is community consensus, and not just my opinion. Tips questions are boilerplate, copy and paste tasks that require no ingenuity from the author. On main, enforcing this requires additional restrictions, and moderator intervention if not followed. It was even &lt;a href=&quot;https://codegolf.stackexchange.com/q/26809/18487&quot;&gt;&lt;em&gt;abused&lt;/em&gt; earlier today&lt;/a&gt; by an alternate account of a currently active user in order to gain free rep.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;em&gt;answers&lt;/em&gt; are a different story. They worked hard to generate their tips. I feel like they deserve a reward for the efforts, but then again I feel like &lt;em&gt;everyone&lt;/em&gt; who makes great points on meta also deserves rep.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;It looks like a polling question.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this regard, it doesn't belong &lt;em&gt;anywhere&lt;/em&gt;. However, it can be transformed into something that is &lt;em&gt;not&lt;/em&gt; a polling question. If the question begged a single answer, edited by the community, that contains &lt;em&gt;all&lt;/em&gt; tips for that language. This it would be a &lt;em&gt;true&lt;/em&gt; community wiki both in spirit and in reality.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In summary, I'd like to see things marked Community Wiki actually &lt;strong&gt;&lt;em&gt;be&lt;/em&gt;&lt;/strong&gt; a community answer or question. I'd like to see rep abuses be made impossible (that means downvoting non CW tips questions if they are to remain on main). Finally, I have no qualms with tips questions remaining where they are (on Main), but I do take issue with those who claim that their view is the &lt;em&gt;only&lt;/em&gt; view. Don't use your diamond or your 20k rep to tell me that my view is just wrong.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2014-05-08T17:29:08.653" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1541" PostTypeId="1" CreationDate="2014-05-08T18:59:48.207" Score="18" ViewCount="2757" Body="&lt;p&gt;How do we score code written in &lt;a href=&quot;http://enwp.org/TI-BASIC&quot; rel=&quot;nofollow&quot;&gt;TI-BASIC&lt;/a&gt;, when it comes to multi-character words? For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;:If X&amp;gt;2:Then:Stop&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Seemingly, the above should count as 17 characters. However, TI-BASIC treats the &lt;code&gt;Then&lt;/code&gt; as a single character when it comes to selecting and deleting characters, unlike most programming languages where the four letters can be written, changed, or deleted separately. So should the above line count as just 9 characters?&lt;/p&gt;&#xA;" OwnerUserId="16294" LastActivityDate="2015-02-06T23:44:17.217" Title="How to score TI-BASIC" Tags="|discussion|code-golf|" AnswerCount="4" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1542" PostTypeId="2" ParentId="2140" CreationDate="2014-05-09T07:40:29.873" Score="0" Body="&lt;h2&gt;Create an Andy Warhol portrait&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Andy_Warhol&quot; rel=&quot;nofollow noreferrer&quot;&gt;Andy Warhol&lt;/a&gt; was one of the main figures of the Pop Art. One of his most famous works was a Marylin Monroe picture in nine frames changing the colors, saturation and others aspects of a original pic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/n6ehz.jpg&quot; alt=&quot;Warhol work&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge here is to create a program that takes any photo and emulates the Warhol painting with some caveats:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Final image should be compossed of 9 different frames.&lt;/li&gt;&#xA;&lt;li&gt;Final image will be compossed from 3 rows and 3 columns.&lt;/li&gt;&#xA;&lt;li&gt;Final image should be sized 3 times width and 3 times height of the original image.&lt;/li&gt;&#xA;&lt;li&gt;The program should output just one image.&lt;/li&gt;&#xA;&lt;li&gt;The image that the program outputs must be an emulation of Warhol works.&lt;/li&gt;&#xA;&lt;li&gt;You cannot use any built in function that doest by itself the &lt;em&gt;Warholization&lt;/em&gt; of the picture neither load or use any external image other than the original. You can use your language methods for changing color, hue, saturation..&lt;/li&gt;&#xA;&lt;li&gt;Program should be deterministic: Any given photo should output the same image every time.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The program should read the image in JPG, BPM or PNG (at your convenience) and output the image in the same format.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program will be tested with these images:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/ajpZ8.jpg&quot; alt=&quot;Marilyn Original&quot;&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/ODkAG.jpg&quot; alt=&quot;Campbell soup original&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; so the most upvoted answers will win. Nobody restrains you from adding more &lt;em&gt;warholized&lt;/em&gt; pictures for winning more votes from the judges.&lt;/p&gt;&#xA;" OwnerUserId="3227" LastEditorUserId="3227" LastEditDate="2014-05-09T08:23:07.113" LastActivityDate="2014-05-09T08:23:07.113" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1543" PostTypeId="2" ParentId="1534" CreationDate="2014-05-09T14:32:10.447" Score="5" Body="&lt;p&gt;Personally, I believe that most of code trolling questions should be removed. There is a one exception I've voted for, but otherwise, I believe they are just awful. &lt;strong&gt;This is just my personal opinion,&lt;/strong&gt; it doesn't represent the community.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/16226/3103&quot;&gt;I need a program where the user inputs an array of doubles and the program outputs the array sorted&lt;/a&gt; - should be locked with &lt;a href=&quot;https://stackoverflow.com/q/9033/736054&quot;&gt;https://stackoverflow.com/q/9033/736054&lt;/a&gt; reason, or if you are too lazy to visit the linked question, the following reason. The reasoning is that it was a good code trolling question, but it also caused everybody to follow it.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This question exists because it has historical significance, but &lt;strong&gt;it is not considered a good, on-topic question for this site&lt;/strong&gt;, so please do not use it as evidence that you can ask similar questions here. This question and its answers are frozen and cannot be changed.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If you are going to completely remove &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;, please rollback to &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/16226/7&quot;&gt;revision 7&lt;/a&gt; (which included the description of category in post (the tag will be removed, and the post will be too confusing with a link to category that doesn't exist)), but preserving the title from &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/16226/9&quot;&gt;revision 9&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/23614/3103&quot;&gt;Trolling the troll&lt;/a&gt; - I have to admit, I changed the tags on the question when I figured out the code trolling is going to be deleted. Anyway, it's clearly &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt;, not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;, even when the title involves &quot;trolls&quot;. Do not close, do not delete.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Everything else - delete. Those questions aren't worth to be simply closed. I will miss points from &lt;a href=&quot;https://codegolf.stackexchange.com/q/16447/3103&quot;&gt;Code trolling - Find the question to an answer (42)&lt;/a&gt;, but it's for the better.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; tag. Burninate. It will have never happened.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3103" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2014-05-09T14:32:10.447" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1545" PostTypeId="1" AcceptedAnswerId="1558" CreationDate="2014-05-09T15:39:53.147" Score="8" ViewCount="260" Body="&lt;p&gt;I have seen several (2) new questions that are supposed to be copied, not written, from StackOverflow. From the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/26778/duct-tape-can-fix-anything&quot;&gt;original question&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Your mission is to make the most interesting program you can -- without ever writing a single line of code. You can only use code which is already written for you, both in questions and answers from StackOverflow. All you can do is duct tape it all together the best you can. And of course, it's very important that we provide appropriate attribution so that we don't get our rights terminated.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I think this would be an interesting challenge, and I also think it needs it's own tag, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/duct-tape-coding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;duct-tape-coding&amp;#39;&quot; rel=&quot;tag&quot;&gt;duct-tape-coding&lt;/a&gt;. The first question was closed as too broad, and it was. Before it was, I added the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/duct-tape-coding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;duct-tape-coding&amp;#39;&quot; rel=&quot;tag&quot;&gt;duct-tape-coding&lt;/a&gt; tag to it, and it was removed. I think we need this tag. What do you think?&lt;/p&gt;&#xA;" OwnerUserId="16472" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-05-14T18:16:47.623" Title="Duct tape coding: new tag?" Tags="|discussion|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1546" PostTypeId="2" ParentId="1541" CreationDate="2014-05-09T15:49:44.177" Score="1" Body="&lt;p&gt;In short, I think that it depends on the form of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you are counting in letters/characters you should count the individual characters, while if you are counting in bytes you should count it as one (assuming that, like the ZX Spectrum, it uses single bytes for the functions).  As the tag wiki explains, you should measure bytes if not otherwise specified.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I do not know whether this applies to TI-BASIC as well, but I know that in BASIC for the ZX Spectrum there are no line breaks either in the actual program and includes spaces in function names eg. &lt;code&gt;10 GO TO 10&lt;/code&gt; is &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;0&lt;/code&gt;, &lt;code&gt;GO TO&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt;. I think that these should still be treated as characters and not bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An example would be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;10 LET x=0:IF x&amp;lt;10 THEN LET x=10&#xA;20 PRINT x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This contains 22 bytes but 43 characters.&lt;/p&gt;&#xA;" OwnerUserId="17148" LastEditorUserId="17148" LastEditDate="2014-05-14T19:00:53.073" LastActivityDate="2014-05-14T19:00:53.073" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1547" PostTypeId="1" CreationDate="2014-05-09T16:01:59.050" Score="5" ViewCount="209" Body="&lt;p&gt;I want to broaden &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1470/re-evaluating-tips-and-tip-like-questions&quot;&gt;Doorknob's post&lt;/a&gt; a little bit. That post is mostly about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;, but what we're really talking about are &quot;middle ground&quot; questions. In other words, there are three types of questions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Challenges&lt;/strong&gt; These clearly go on the main site&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Rules and Policies&lt;/strong&gt; These clearly go on the meta site&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Programming posts that are not challenges themselves, but are related to PPCG&lt;/strong&gt; - This is where the debate is.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;From what I've read so far, (feel free to correct me) it seems that many of us have been arguing about what the exact wording in the help center is. Example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Argument for Meta: &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;“I would like to participate in a discussion about ______”, then you should not be asking here.&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;you are asking an open-ended, hypothetical question: “What if ______ happened?”&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Argument for Main: &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Meta Programming Puzzles &amp;amp; Code Golf Stack Exchange is the part of the site where users discuss the workings and policies of Code Golf Stack Exchange rather than discussing programming puzzle or code golf itself.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;As far as I'm concerned, &lt;strong&gt;the rules are ambigious&lt;/strong&gt; on this subject. As such, there will never be clear agreement about the &lt;strong&gt;interpretation of the site's rules&lt;/strong&gt;... and that isn't the best way to make a decision either way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The best way to make a decision is to think about the effect of one or the other on the site itself, which some of us have done. Here are some questions to consider:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do we want users getting reputation for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;?&lt;/li&gt;&#xA;&lt;li&gt;Do we want users getting reputation for FAQ posts?&lt;/li&gt;&#xA;&lt;li&gt;The main site always gets more views than the corresponding meta site. Do we want new users to see these posts more easily?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I encourage everyone to edit more such questions into this list. What are we trying to accomplish with these questions, and which site (main, meta, or neither) best serves these goals?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;P.S. Perhaps this is a straight duplicate of Doorknob's post. If people think that, comment and maybe we can merge Doorknob's post to focus on the question from this perspective.&lt;/p&gt;&#xA;" OwnerUserId="17249" LastEditorDisplayName="user62131" LastEditDate="2017-05-07T03:34:58.217" LastActivityDate="2017-05-07T03:34:58.217" Title="Not quite main, not quite meta questions" Tags="|discussion|meta|new-genre|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1548" PostTypeId="2" ParentId="1547" CreationDate="2014-05-09T16:22:32.220" Score="11" Body="&lt;p&gt;We had this discussion in the chat yesterday. It boils down to: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If it's about the main site or about meta, then post it in meta.&lt;/li&gt;&#xA;&lt;li&gt;If it's about golfing or programming challenges, then post it in main.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If it's not about either of those, then it's probably not a good fit here. :-)&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-05-09T16:22:32.220" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1549" PostTypeId="2" ParentId="1547" CreationDate="2014-05-09T16:34:53.997" Score="8" Body="&lt;p&gt;I don't see the rules as ambiguous on this matter. Every site on the SE network has a corresponding meta, and this is the only one where I've ever seen this come up. Meta has a clearly defined purpose, and it isn't this.&lt;/p&gt;&#xA;&lt;h3&gt;Tips are not meta&lt;/h3&gt;&#xA;&lt;p&gt;The argument you give for main (from &lt;a href=&quot;https://codegolf.stackexchange.com/help/whats-meta&quot;&gt;What's Meta?&lt;/a&gt;) tells you why they're &lt;strong&gt;not&lt;/strong&gt; meta, but can be elaborated a bit from further reading of that same page:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Meta is for:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;asking questions about how the websites work&lt;/li&gt;&#xA;&lt;li&gt;asking questions of the community&lt;/li&gt;&#xA;&lt;li&gt;posting bugs&lt;/li&gt;&#xA;&lt;li&gt;suggesting improvements&lt;/li&gt;&#xA;&lt;li&gt;proposing new features&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Tips don't fall into any of those categories. The closest one would be &amp;quot;asking questions of the community&amp;quot;, but taken at its broadest meaning, that encompasses &lt;em&gt;every&lt;/em&gt; question on main or meta at all.&lt;/p&gt;&#xA;&lt;p&gt;Further, there are required tags on meta. Every meta. Those are &lt;a href=&quot;/questions/tagged/support&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/discussion&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt;. Combined, these four define the entire point of meta. Again, tips don't fall into any of these. The case for [discussion] is weak at best. Tips questions are asking for objective answers: ones that save characters. They are not discussions. There isn't &lt;em&gt;anything&lt;/em&gt; I can come up with for the other three tags, so what would tips be tagged with on meta?&lt;/p&gt;&#xA;&lt;h3&gt;Are tips good for main?&lt;/h3&gt;&#xA;&lt;p&gt;Tips are distinguished from regular questions because they are looking specifically for a long list of answers. Each answer should be objective, but it's still a list-type where there's not &lt;em&gt;one&lt;/em&gt; correct answer. Most SE sites have banned list questions, due to their open-ended nature.&lt;/p&gt;&#xA;&lt;p&gt;When they are banned, the popular ones tend to get historically locked, and the rest are killed with fire. They are &lt;em&gt;not&lt;/em&gt; moved to meta because of this. Why? Because they're still on-topic at main. If they belong &lt;em&gt;anywhere&lt;/em&gt;, they belong on main.&lt;/p&gt;&#xA;&lt;h3&gt;Wait, &lt;em&gt;do&lt;/em&gt; they belong anywhere?&lt;/h3&gt;&#xA;&lt;p&gt;That's ultimately up to the community to decide. Some SE sites allow lists in limited number or scope, while most have been harsh in dealing with them. Personally, I think there's a better way forward than what's currently happening:&lt;/p&gt;&#xA;&lt;p&gt;The main problem I see with tips is &lt;em&gt;not&lt;/em&gt; just that they are lists. Lists can be managed by the community, as long as there are clearly defined rules as to what makes a good one. The problem is that they &lt;em&gt;take the place&lt;/em&gt; of specific, answerable questions.&lt;/p&gt;&#xA;&lt;p&gt;If I'm trying to golf a particular piece of code and I'd like some help, I &lt;em&gt;should&lt;/em&gt; be able to ask here (in the spirit of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1470/14215&quot;&gt;Doorknob's post&lt;/a&gt;). I can get one or two good solutions, upvote the ones that work, and accept the one I end up using (or that gets me closest to a solution).&lt;/p&gt;&#xA;&lt;p&gt;I don't &lt;em&gt;expect&lt;/em&gt; votes/rep for the question itself, any more than I do on SO, EL&amp;amp;U, or any other SE site. If the question &lt;em&gt;was&lt;/em&gt; useful to others, I don't see the harm in giving someone fake internet points for it. Reputation as a whole is &lt;em&gt;supposed&lt;/em&gt; to measure your usefulness to the community.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;em&gt;answers&lt;/em&gt;, though, are most likely useful. At least to the asker, but possibly to others. Those deserve rep. Period. Many of the answers I see in [tips] are creative, clever, or otherwise useful. &lt;code&gt;Useful = Reputation&lt;/code&gt;. That's the way it should be.&lt;/p&gt;&#xA;&lt;p&gt;Listy tips questions ruin this model, or at least dampen it. If all the tips are placed in one big CW post, then nobody gains. There is no incentive to write good tips, and they only serve as a big-ass dupe target for many useful questions. Nobody wins. Nobody is rewarded for their useful contributions, which is the entire SE model.&lt;/p&gt;&#xA;&lt;h3&gt;But we're &lt;em&gt;different&lt;/em&gt; here at PPCG!&lt;/h3&gt;&#xA;&lt;p&gt;I see this thrown about sometimes, and while it is true that there are some specific differences, we're &lt;strong&gt;still&lt;/strong&gt; an SE site. We should act like one. Just because we &lt;em&gt;happen&lt;/em&gt; to post challenges doesn't mean we should ban &lt;em&gt;every single other question&lt;/em&gt; that relates to golfing or puzzling. Why can't we be a community that asks questions &lt;em&gt;about&lt;/em&gt; golfing and also &lt;em&gt;does&lt;/em&gt; golfing? In that way we can be &lt;em&gt;more&lt;/em&gt; like a typical SE site and &lt;em&gt;less&lt;/em&gt; of an outlier. That's a good thing in my opinion, if we're going to reside under their roof.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-05-09T16:59:53.330" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1550" PostTypeId="1" AcceptedAnswerId="1552" CreationDate="2014-05-09T17:59:08.007" Score="8" ViewCount="313" Body="&lt;p&gt;I've noticed something while looking at code golf challenges that seems troubling, I'm going to use answers taken from&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/26782/fast-cheap-and-good-choose-any-two/26814#26814&quot;&gt;Fast, Cheap, and Good - Choose any Two&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I have seen this on other questions as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Looking through the answers, the answers that use script languages all appear to be cheating!  Take a look at &lt;a href=&quot;https://codegolf.stackexchange.com/a/26785/21210&quot;&gt;this answer&lt;/a&gt; provided by @Matt &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;b=&quot;input&quot;,a=&quot;&amp;lt;input type=checkbox&amp;gt;&quot;,c=&quot;:checked&quot;;$(&quot;body&quot;).html(&quot;SELECT ANY TWO&quot;+a+&quot;FAST&quot;+a+&quot;GOOD&quot;+a+&quot;CHEAP&quot;).click(function(){$(b).not(c).attr(&quot;disabled&quot;,!!$(b+c)[1])})&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;While this is all well and good, this snippet of code is not complete, in order for this to run (at the very least) you would have to include the jquery library either from a CDN or from a local resource and then wrap your code in a script tag.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;script src=&quot;somelocation/jquery.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xA;&amp;lt;script&amp;gt;&#xA;  //code&#xA;&amp;lt;/script&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;None of this is included in this total, but all the compiled languages include everything required to make the program actually run (including import statements)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/26803/21210&quot;&gt;https://codegolf.stackexchange.com/a/26803/21210&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/26853/21210&quot;&gt;https://codegolf.stackexchange.com/a/26853/21210&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is not limited to jquery only, here is a similar answer using angular:&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/26851/21210&quot;&gt;https://codegolf.stackexchange.com/a/26851/21210&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Seems to me in a battle to get the lowest amount of characters in source code, that all languages should be held to the same standard.&lt;/p&gt;&#xA;" OwnerUserId="21210" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-05-19T05:35:42.647" Title="Code Golf Requirements" Tags="|discussion|" AnswerCount="5" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1551" PostTypeId="2" ParentId="1529" CreationDate="2014-05-09T19:06:29.600" Score="14" Body="&lt;p&gt;I'd actually been poked about this a few times before now, which is why, as dmckee noted, I had been polling the moderators about their thoughts on the matter. I'm pleased to announce that starting today (some hours before now, as it were), Doorknob has joined the ranks of the pro tem moderators. All of the existing pro tem moderators will be retaining their positions. Enjoy!&lt;/p&gt;&#xA;" OwnerUserId="2414" LastActivityDate="2014-05-09T19:06:29.600" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1552" PostTypeId="2" ParentId="1550" CreationDate="2014-05-09T20:22:41.430" Score="9" Body="&lt;p&gt;The issue is this snippet from the &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;tag wiki's&lt;/a&gt; listed requirements:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;How should the answer be presented – should a bare function be acceptable, or it must include full input/output code?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is not always included. If this is supposed to be a &lt;em&gt;requirement&lt;/em&gt;, then the problem is the question, not the answers.&lt;/p&gt;&#xA;&lt;p&gt;In the example linked question, the task is:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;You should render a set of three check boxes...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Where it could say:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Write a program that will render...&lt;/p&gt;&#xA;&lt;p&gt;Write a function that will render...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;A simple change is all it takes to make it clear what an answer should consist of. You'd also have much better grounds for a complaint against an answer that doesn't meet it. As it stands, you cannot blame people (much) for taking advantage of ambiguity. From what I've seen, that's par for the course here (&lt;em&gt;pun very much intended&lt;/em&gt;).&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;That said, if the question &lt;em&gt;is&lt;/em&gt; specified as a complete program, I think you have a valid point. It may be hard coming up with perfect rules for every language, though.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-05-10T00:16:34.117" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1553" PostTypeId="2" ParentId="1545" CreationDate="2014-05-09T23:39:04.797" Score="6" Body="&lt;p&gt;I like this concept. I think it has the potential to spawn some really interesting new challenges. So let it thrive for now and see where this is going. I also agree with Quincunx that we can wait for another one or two questions before making this a tag. Maybe this remains a one-timer after all, and then it's just a special popularity contest. If we &lt;em&gt;do&lt;/em&gt; decide to tag it, I really like Quincunx's suggestion of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/patchwork-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;patchwork-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;patchwork-code&lt;/a&gt;. :)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But now the point I really want to stress. Code trolling happened recently and we don't want it to happen again. But I don't think we should discourage new and innovative types of challenges either, but we should maybe watch out to keep their evolution in more control.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So what I'm saying is, if the next weeks have several new duct-tape-coding/patchwork-code challenges, we should be particularly rigorous and scrutinising. If those new questions don't live up to our high standards, close them (and give the OP some advice what he could do better). Just because they might be popular is still no argument. In particular we should ask ourselves:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Does this question add something novel to this type of challenge?&lt;/strong&gt; After today's &quot;Print 'hello mom'&quot;, another primitive string manipulation challenge like &quot;Convert the input to lower case&quot; would seem somewhat pointless. In fact, I'd close-vote as duplicate. A polyglot challenge on the other hand could be highly interesting.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Does the actual problem benefit from being posed as a patchwork challenge?&lt;/strong&gt; Even if the question sounds fun as it is, maybe it would be even more fun it was just a plain old &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; or some other &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;? Don't close, but consider downvoting and voicing your opinion.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Does it seem like the OP just wanted to post a patchwork challenge &lt;em&gt;(because it's popular)&lt;/em&gt; and then just slapped an arbitrary problem on it?&lt;/strong&gt; This may well fall in the first category, as this will likely not add anything new. Consider closing as duplicate, more importantly downvote and express constructive criticism in the comments.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Does this meet the usual quality standards?&lt;/strong&gt; Is it too broad? Unclear? etc... There are close vote reasons for that.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If the challenge still seems interesting after careful consideration, by all means upvote and encourage those questions. If not, decimate the population (of patchwork challenges; just saying). I just think we'd be throwing away a lot of potential if (after what happened with code trolling) we started to close things with reasons like &quot;it's new, I don't like new, new is always worse, kill it fire&quot;.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-05-09T23:39:04.797" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1554" PostTypeId="2" ParentId="1550" CreationDate="2014-05-10T08:03:05.433" Score="6" Body="&lt;p&gt;I agree with you in part.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;While this is all well and good, this snippet of code is not complete, in order for this to run (at the very least) you would have to include the jquery library either from a CDN or from a local resource and then wrap your code in a script tag.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;script src=&amp;quot;somelocation/jquery.js&amp;quot;&amp;gt;&amp;lt;/script&amp;gt;&#xA;&amp;lt;script&amp;gt;&#xA;  //code&#xA;&amp;lt;/script&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The part I agree with is that using jQuery should not be free unless the question says that libraries may be imported for free. While there will always be some unfairness because different languages have different standard libraries, it's not reasonable to argue that jQuery is a part of JavaScript. There's probably a minified URL for it which is about as long as &lt;code&gt;http://u.rl/123456&lt;/code&gt;, so a character count for &lt;code&gt;&amp;lt;script src=&amp;quot;//u.rl/123456&amp;quot;&amp;gt;&amp;lt;/script&amp;gt;&lt;/code&gt; is probably reasonable. (I can also see an argument for a much longer piece of code to insert the script tag into the document from JS). Downvote answers which try to cheat here, and if you want to draw more attention to them you could mention them in chat.&lt;/p&gt;&#xA;&lt;p&gt;But I don't agree that we should count a script tag to wrap the code. When counting bytes for a compiled language, we don't count the compiler invocation (except for non-standard flags which are required to make that particular program work correctly) or the program invocation from the shell. We count the size of the source file. Similarly, &lt;code&gt;&amp;lt;script src=&amp;quot;myProgram.js&amp;quot;&amp;gt;&amp;lt;/script&amp;gt;&lt;/code&gt; should be free.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-05-10T08:03:05.433" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1555" PostTypeId="1" AcceptedAnswerId="1556" CreationDate="2014-05-10T13:45:09.403" Score="8" ViewCount="505" Body="&lt;p&gt;I have a question about programming puzzles or code golf, and it's not a challenge for others to solve. Where should I post it?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1280&quot;&gt;Return to FAQ index&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2014-08-13T11:05:07.417" Title="Where should non-challenge questions go?" Tags="|discussion|support|faq|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1556" PostTypeId="2" ParentId="1555" CreationDate="2014-05-10T13:45:09.403" Score="10" Body="&lt;p&gt;Bear in mind that &lt;a href=&quot;https://codegolf.stackexchange.com/help/dont-ask&quot;&gt;some questions don't belong on either the main site or the meta site&lt;/a&gt;. Some of these questions can still be asked on &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;our main &lt;strong&gt;chat room&lt;/strong&gt;&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Examples of questions which should &lt;strong&gt;only be asked in chat&lt;/strong&gt;:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;what do you think of my golfing language?&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If your question is about PPCG.SE &lt;em&gt;specifically&lt;/em&gt;, post it on meta.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Examples that &lt;strong&gt;should&lt;/strong&gt; be on meta:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;proposals of new tags or types of content&lt;/li&gt;&#xA;&lt;li&gt;discussions of policy&lt;/li&gt;&#xA;&lt;li&gt;questions about this community&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Examples that &lt;strong&gt;should not&lt;/strong&gt; be on meta:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;tips for golfing - not specific to this site&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If it is a &lt;strong&gt;&quot;list&quot; question&lt;/strong&gt;, is specific enough to have focused answers and not so broad that a book could be written to answer it, post it on main and flag for a mod to convert it to Community Wiki. Note that these types of questions are discouraged, and it would be ideal if you could ask your question in a way that doesn't invite answers that are just big lists.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Examples that &lt;strong&gt;should be CW&lt;/strong&gt;:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;tips for golfing in {language}&lt;/li&gt;&#xA;&lt;li&gt;how can I optimize a golfing language to be shorter?&lt;/li&gt;&#xA;&lt;li&gt;what are some strategies to solve {some type of programming puzzle / challenge}?&lt;/li&gt;&#xA;&lt;li&gt;what important math functions do I need to add to my language's library? which ones are superfluous and don't need to be added?&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If it is a question about how to improve an idea you have for a challenge post, post it as an &lt;strong&gt;answer&lt;/strong&gt; in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/search?tab=newest&amp;amp;q=sandbox&quot;&gt;Sandbox&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it is a narrow question about code golfing, post it to main without flagging for Community Wiki.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Examples that &lt;strong&gt;should not be CW&lt;/strong&gt;:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;how can I shorten this specific code structure or construct?&lt;/li&gt;&#xA;&lt;li&gt;how can I handle I/O better in my golfing language? &lt;/li&gt;&#xA;&lt;li&gt;who {did some important event} in the history of code golf?&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2014-05-13T22:10:04.040" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1557" PostTypeId="2" ParentId="1550" CreationDate="2014-05-10T16:35:19.743" Score="0" Body="&lt;p&gt;I'll weigh in here since I asked the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/26782/fast-cheap-and-good-choose-any-two&quot;&gt;Fast, Cheap, and Good - Choose any Two&lt;/a&gt; question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All the answers depend to some degree on a framework. The main stipulation was to &quot;use the checkbox control in the language of your choice&quot;. In jQuery or JavaScript, this would of course be a standard HTML checkbox input element.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I think the bigger issue is that it sorts itself out. Consider that one of the points of allowing multiple languages or execution contexts is that there could be multiple winners. If we are comparing apples to apples, then it makes no difference if all jQuery answers are required to include the script tag - they simply all get longer by the same amount.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can see awarding a 300b c++ answer over a 150b jQuery answer. Many times it will depend on the background of the asker. If he sees more cleverness in the c++ answer, then by all means give that one the nod.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Having said all this, I can definitely understand why jQuery without the include statement ruffles some feathers. If we consider the browser the context, then JavaScript is free, but jQuery would not be. So I would award a pure JavaScript answer higher.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think there's also an issue that relates to the appropriateness of the tool for the task. Whether it's fair or not, some questions will by their very nature favor one language over another.&lt;/p&gt;&#xA;" OwnerUserId="21186" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-05-10T16:54:11.727" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1558" PostTypeId="2" ParentId="1545" CreationDate="2014-05-10T18:04:34.900" Score="9" Body="&lt;p&gt;I'm the author of the original question/idea, and I just wanted to make something very, very clear.  When I wrote it, I had absolutely no intention of it becoming the next &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; type category.  I just thought it would be a fun one-time thing.  By creating the tag, you encourage people to come and create lots of random challenges based around that, and it will get really old really fast.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also learned afterwards by browsing this Meta that older veterans of this beta -- particularly some mods, for example the comment by dmckee under &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1529/5358&quot;&gt;this question&lt;/a&gt; -- really dislike the fact that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;s are a thing.  So apparently it would be undesirable to encourage lots of those kinds of questions.&lt;/p&gt;&#xA;" OwnerUserId="5358" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2014-05-10T18:04:34.900" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1559" PostTypeId="1" CreationDate="2014-05-11T01:20:40.020" Score="1" ViewCount="121" Body="&lt;p&gt;I know we have either been deleting or locking &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; based on popular vote. Deletion will obviously discourage new user, because they won't see the questions until they get 3000 rep. Locking is different, though. The question still appears on the site, except you can't upvote/downvote/edit or pretty much anything else. The lock message explicitly states that &quot;This is not considered a good, on-topic question for this site.&quot; However, according to many, &quot;A certain portion of users simply won't read rules/guidelines/faqs, no matter how much you bludgeon them with them.&quot; (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1499/the-new-user-dilemma#comment5647_1499&quot;&gt;ref&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is extremely problematic for the trolls out on the internet, who would actively seek out stuff like this, which brings me to my question, is a historical lock enough?&lt;/p&gt;&#xA;" OwnerUserId="16472" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2014-05-11T02:48:10.020" Title="Will a historical lock on code-trolling discourage it?" Tags="|discussion|code-trolling|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1560" PostTypeId="2" ParentId="1559" CreationDate="2014-05-11T02:43:06.437" Score="4" Body="&lt;p&gt;The purpose of the lock isn't &lt;em&gt;exactly&lt;/em&gt; to discourage those types of questions. The purpose (as I see it) is simply to act as a signpost. Locked posts are &lt;em&gt;evidence&lt;/em&gt; that those types of posts aren't welcome.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Take &lt;a href=&quot;https://stackoverflow.com/questions/621884/database-development-mistakes-made-by-application-developers&quot;&gt;this locked question on SO&lt;/a&gt;, for example. It's just bad, there's not much denying that. There are tons of votes and answers thrown on it, but nobody worries that the post &quot;just being locked&quot; is going to attract users to post similar ones.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The key to discouraging bad questions in the SE world is &lt;strong&gt;consistent enforcement&lt;/strong&gt; by the community. That means closing new ones (quickly), downvoting if appropriate, and deleting if necessary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This isn't a new issue, and SE sites have been dealing with bad questions for years. &lt;em&gt;Every day&lt;/em&gt;, the larger sites see many bad questions. As long as we get rid of them quickly, &lt;em&gt;as a community&lt;/em&gt;, there's not really a problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;New users that simply didn't read the notice will soon learn, and the &lt;em&gt;true&lt;/em&gt; trolls will soon tire of the games if every one of their posts is closed/deleted within a few minutes.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;As for the comment you linked, I stand by it. Some people won't read the rules. &lt;em&gt;That doesn't mean those people aren't still wrong.&lt;/em&gt; Ignorance of the law is not an excuse, as they say. &lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2014-05-11T02:48:10.020" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1561" PostTypeId="1" CreationDate="2014-05-11T14:07:34.773" Score="5" ViewCount="229" Body="&lt;p&gt;Recently, there has been a new type of challenge introduced called &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/duct-tape-coding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;duct-tape-coding&amp;#39;&quot; rel=&quot;tag&quot;&gt;duct-tape-coding&lt;/a&gt;. Fears have been brought up that, like code-trolling, this challenge type may spawn posts that are extremely trivial or similar to the first one, relying only on the challenge type to be an interesting question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since we don't want a repeat of code trolling, but don’t want to discourage new types of challenges altogether, &lt;strong&gt;how should we deal with these new challenge types&lt;/strong&gt; that continually create simple or trivial challenges?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;Thanks to these users: TheDoctor, ProgramFOX, m.buettner, for helping with the creation of this question and answer.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="68942" LastEditDate="2021-04-03T20:29:28.893" LastActivityDate="2021-04-03T20:29:28.893" Title="How do we deal with novel emerging/recurring challenge types?" Tags="|discussion|policy|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1562" PostTypeId="2" ParentId="1561" CreationDate="2014-05-11T14:07:34.773" Score="8" Body="&lt;p&gt;We have been discussing this in chat, and we have come to the conclusion that if the challenge is only interesting because of the challenge type, it should be closed. If the challenge is interesting because it is the first challenge of its kind, it's okay, but further trivial questions in the genre should be closed as a duplicate of the original, unless they add something innovative or new to the category.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Like with any challenge, repetitive novelties get old. If we start seeing challenges like this that are almost certainly duplicates of older challenges that previously had other tags, we should close them. Note that this doesn't mean the posts have to be exact carbon copies - we don’t want “print ‘hello world’ - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/duct-tape-coding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;duct-tape-coding&amp;#39;&quot; rel=&quot;tag&quot;&gt;duct-tape-coding&lt;/a&gt;”, “add 2 numbers - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/duct-tape-coding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;duct-tape-coding&amp;#39;&quot; rel=&quot;tag&quot;&gt;duct-tape-coding&lt;/a&gt;”, “sort an array - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/duct-tape-coding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;duct-tape-coding&amp;#39;&quot; rel=&quot;tag&quot;&gt;duct-tape-coding&lt;/a&gt;”, etc…. Taking a trivial challenge and slapping the newest tags on it is not fun, and will almost certainly become the next &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Therefore, our policy for new challenge genre types should be this:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;On seeing the first new question in a genre, we should begin by defining some rules for said genre. We don’t want ambiguity with other challenges or loopholes that are easy to exploit. Also, define a scoring method or a way of comparing answers.&lt;/li&gt;&#xA;&lt;li&gt;For further questions in this genre that are trivial or add nothing new, close as a duplicate of the original. Some ways to judge this are:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the challenge is only interesting or remotely unique because of its tag, or it has been asked before as another type of challenge (e.g. &quot;Calculate square root - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/duct-tape-coding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;duct-tape-coding&amp;#39;&quot; rel=&quot;tag&quot;&gt;duct-tape-coding&lt;/a&gt;&quot;), it should be closed as a duplicate. The question to ask is “Would the underlying (algorithmic) problem be interesting as an established type of challenge, e.g. code golf?”&lt;/li&gt;&#xA;&lt;li&gt;If the challenge can be solved in the same way as another challenge in the genre, close it as a duplicate. This has been very prominent in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;, where most or all of the challenges in the category could be solved in almost exactly the same way.&lt;/li&gt;&#xA;&lt;li&gt;If further questions are remarkably different in some way, we should leave the question open. If we want new challenge genres, because &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; might get a bit monotonous, we need to leave the more interesting ones open.&lt;/li&gt;&#xA;&lt;li&gt;If the challenge makes the problem significantly different to solve than other previous challenges, leave it open.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The goal of promoting this policy is to avoid challenges in new genres being created by taking a trivial task (ex. sort a list, add two numbers, etc.) and slapping the fancy new tag onto it.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="3808" LastEditDate="2014-05-13T12:37:47.830" LastActivityDate="2014-05-13T12:37:47.830" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1563" PostTypeId="2" ParentId="1352" CreationDate="2014-05-11T14:47:56.497" Score="5" Body="&lt;p&gt;That is not a requirement. If you have a difficult, but interesting challenge that you can't solve yourself, that does not mean that you should not post it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;You give the argument that someone could post a homework question here as a challenge&lt;/s&gt; (I'm sorry, you said that you didn't, I misunderstood that. However, I'll keep this part around if someone else would make this argument). If someone posts a homework question as a challenge, the answers would probably not be very useful, because:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the OP posts his homework as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, then the answers will be short, but useless. If you get a homework assignment, you are assumed to write good and efficient code, not short and not-so-efficient.&lt;/li&gt;&#xA;&lt;li&gt;If it is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, then the highest-voted answer is probably the most creative, but not necessarily the most efficient one.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And if he posts it without criteria or with 'most efficient' as criteria, it will get closed as &quot;no objective winning criteria&quot;.&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="9275" LastEditDate="2014-05-12T15:39:47.770" LastActivityDate="2014-05-12T15:39:47.770" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1565" PostTypeId="2" ParentId="2140" CreationDate="2014-05-12T01:38:54.770" Score="1" Body="&lt;h1&gt;Game similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/6884/solve-the-15-puzzle-the-tile-sliding-puzzle&quot;&gt;the Fifteen Puzzle&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Because I may factor in &amp;quot;date of solution posted&amp;quot; as a tiebreaker, I don't want to say the exact rules in the sandbox... but the exact rules aren't the reason I'm putting this in the sandbox.&lt;/p&gt;&#xA;&lt;p&gt;Basically, the challenge will be to &amp;quot;solve the given puzzle(s)&amp;quot; in the fewest number of moves. For the exact incarnation of this puzzle, &lt;strong&gt;the actual puzzle only has 415,800 possible game boards&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The problem is scoring:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I want all valid entrants to be able to solve all possible puzzle inputs&lt;/li&gt;&#xA;&lt;li&gt;But then, how do you compare different answers?&lt;/li&gt;&#xA;&lt;li&gt;Could total the score on running the problem on all possible game boards&lt;/li&gt;&#xA;&lt;li&gt;Break ties with runtime?&lt;/li&gt;&#xA;&lt;li&gt;Could also create some number of fixed puzzles and have all solutions solve those particular puzzles, and whichever one has the lowest score is the winner&lt;/li&gt;&#xA;&lt;li&gt;Because of the small puzzle space, tiebreakers may become very important&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;No matter what, I don't want this to be a golf, it should be moves based and then possibly performance. All thoughts appreciated.&lt;/p&gt;&#xA;" OwnerUserId="17249" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-05-12T01:38:54.770" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1566" PostTypeId="2" ParentId="1501" CreationDate="2014-05-12T02:07:42.197" Score="5" Body="&lt;p&gt;My answer is &lt;strong&gt;yes&lt;/strong&gt;.  Function literals are functions. Functions need no names.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When a question asks, &quot;Define a function t&quot;, I find no requirement to use the name &lt;code&gt;t&lt;/code&gt; within the program. The name t allows the question to make requirements like, &quot;t(0) must return 0&quot;. In the actual program, the function might have a different name. Also, &lt;code&gt;t(0)&lt;/code&gt; might not be valid syntax to call the function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Different languages have different rules for naming functions. In &lt;a href=&quot;http://www.openbsd.org/cgi-bin/man.cgi?query=dc&amp;amp;apropos=0&amp;amp;sektion=0&amp;amp;manpath=OpenBSD%20Current&amp;amp;arch=i386&amp;amp;format=html&quot; rel=&quot;nofollow&quot;&gt;dc(1)&lt;/a&gt;, every name is a single character, so we may make a &lt;code&gt;t&lt;/code&gt; function, but not a &lt;code&gt;triple&lt;/code&gt; function. In Common Lisp, &lt;code&gt;t&lt;/code&gt; is a constant for the true value, so we may not make a &lt;code&gt;t&lt;/code&gt; function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the function must have a name, then we have a question of scope, because not all languages use a single global namespace for all functions. Let us make a function &lt;code&gt;s&lt;/code&gt; (not &lt;code&gt;t&lt;/code&gt;) in Common Lisp to triple a value:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(flet((s(x)(* 3 x))))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;What? The name &lt;code&gt;s&lt;/code&gt; is local to the &lt;code&gt;flet&lt;/code&gt;! We can't call this function! This &lt;code&gt;s&lt;/code&gt; is good enough for me, because one may call it by inserting code inside the &lt;code&gt;flet&lt;/code&gt;, before the last parenthesis. (For code golf, we can save 2 characters by doing &lt;code&gt;(defun s(x)(* 3 x))&lt;/code&gt;, which defines &lt;code&gt;s&lt;/code&gt; in the current package. If we want &lt;em&gt;two&lt;/em&gt; named functions, then &lt;code&gt;flet&lt;/code&gt; is shorter.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Someone might attempt to do &lt;code&gt;(set's(lambda(x)(* 3 x)))&lt;/code&gt;, which sets the variable name &lt;code&gt;s&lt;/code&gt;, not the function name &lt;code&gt;s&lt;/code&gt;. Now we can't write &lt;code&gt;(s 4)&lt;/code&gt;. We must write &lt;code&gt;(funcall s 4)&lt;/code&gt;. It still counts as a function named &lt;code&gt;s&lt;/code&gt;, I guess.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The removal of function names is a legitimate way to golf code. In &lt;a href=&quot;http://factorcode.org/&quot; rel=&quot;nofollow&quot;&gt;Factor&lt;/a&gt;, why would I write &lt;code&gt;: s ( x -- x ) 3 * ;&lt;/code&gt; and then &lt;code&gt;[ s ] map&lt;/code&gt; when I can just write &lt;code&gt;[ 3 * ] map&lt;/code&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A few extreme languages have no functions because they have no call stack or returns. I mean sed(1). (For evidence that sed is a programming language, see &lt;a href=&quot;http://www.openbsd.org/cgi-bin/cvsweb/src/regress/usr.bin/sed/math.sed?rev=1.1&quot; rel=&quot;nofollow&quot;&gt;math.sed&lt;/a&gt;.) If a question asks for a function, my opinion is that you may &lt;em&gt;not&lt;/em&gt; answer with a sed function. You may answer with a shell-script function that calls sed.&lt;/p&gt;&#xA;" OwnerUserId="4065" LastActivityDate="2014-05-12T02:07:42.197" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1567" PostTypeId="2" ParentId="1514" CreationDate="2014-05-12T13:27:01.703" Score="4" Body="&lt;p&gt;&lt;strong&gt;TL;DR: Close, but don't delete popular code-trolling questions. Discourage future questions. Please notice the significant division between meta and codegolf itself.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Disclaimer: I personally like code-trolling as a fun, creative and recreational way to programming. I wrote a code-trolling question with 21 votes which is a deletion candidate, as well as a code-trolling answer with a few votes. I came to this site in the first place precisely because of code-trolling.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Let me note that obviously, the average site user seems to think differently than the average meta user, as is clearly reflected in the amount of upvotes of some popular code-trolling questions and answers. There are some really funny, creative and interesting answers and it would be a loss for the site if they were deleted and no harm to keep them. Many users like me might be pissed off by just deleting them. Keep in mind that only a small proportion actually uses meta and might not even be aware of this discussion. The negative impact of code-trolling on this site is overrated in my opinion.&lt;/li&gt;&#xA;&lt;li&gt;All the interesting questions in code-trolling seem to have been asked, and all the interesting answers have been given, some of them multiple times (such as code obfuscation with C #defines and overuse of JQuery). It's not a loss to discourage or forbid future code-trolling questions and answers by locking all the questions and editing the tag wiki.&lt;/li&gt;&#xA;&lt;li&gt;A code-trolling question is naturally broad as the answers are supposed to be original and creative. This in itself is not the problem with code-trolling. &lt;strong&gt;Answering a code-trolling question in an interesting way is a fun programming challenge.&lt;/strong&gt; Not everyone might like to partake in it, but enough people enjoy it.&lt;/li&gt;&#xA;&lt;li&gt;Don't prescribe to users on what to upvote and what not to upvote. Educate them, yes, but I strongly disagree with every statement like &quot;This shouldn't be upvoted&quot;. The very essence of voting is gathering people's unaltered opinions.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="11799" LastActivityDate="2014-05-12T13:27:01.703" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1569" PostTypeId="2" ParentId="1352" CreationDate="2014-05-12T15:08:25.717" Score="1" Body="&lt;p&gt;It is inadvisable to post a question which you cannot answer, but we don't need a custom &quot;Off topic&quot; reason with this wording.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not certain that this has ever been used as a manually entered custom &quot;Off topic&quot; reason, and it's certainly not one that's used commonly enough to take up a slot in our per-site custom reasons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The biggest problem with posting a question which you can't answer is that generally this means a lack of deep understanding of the problem. That may also manifest itself in an inability to communicate the problem clearly (leading to closure as unclear) and to provide test cases (which isn't a close reason, but questions without test cases have a high quality handicap, and are to be discouraged).&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-05-12T15:08:25.717" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1570" PostTypeId="2" ParentId="2140" CreationDate="2014-05-12T15:21:27.700" Score="0" Body="&lt;p&gt;&lt;strong&gt;Preface&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Kyle is in kindergarten.  He can tie his shoes and count by twos and write in almost every programming language existent!  But he can't seem to remember the days of the week.  They always get mixed up in his mind.&lt;/p&gt;&#xA;&lt;p&gt;So, his problem is that needs to know what day of the week it is tomorrow.  He decides to write a program for himself.&lt;/p&gt;&#xA;&lt;p&gt;But, his source code is stored in a very stingy cloud service.  They charge $1.99 per character!  So, he decided to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; it all...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;So, Kyle has hired you for a whopping 15 reputation!  Your challenge is, given the name of a day of the week (&lt;code&gt;thursday&lt;/code&gt;, for example), you output the name of the next day (&lt;code&gt;friday&lt;/code&gt;).  The code with the least characters wins.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The input and output can be in any reasonable method you like (&lt;code&gt;STDIN&lt;/code&gt;/&lt;code&gt;STDOUT&lt;/code&gt;, command-line, read from a file, anything).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You are free to use any built-in function you like.  As long as they don't do &lt;em&gt;all&lt;/em&gt; the work for you (that's no fun).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The input and output should be in lowercase.  Kyle hasn't learned about capital letters yet.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In case you don't know, the weekdays are: &lt;code&gt;monday&lt;/code&gt;, &lt;code&gt;tuesday&lt;/code&gt;, &lt;code&gt;wednesday&lt;/code&gt;, &lt;code&gt;thursday&lt;/code&gt;, &lt;code&gt;friday&lt;/code&gt;, &lt;code&gt;saturday&lt;/code&gt;, &lt;code&gt;sunday&lt;/code&gt;.  And they loop around. :-)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Good luck, and may the best code win!&lt;/p&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;Commentary&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I have seen a lot of weekday-related posts here on codegolf.SE, but I am pretty sure that this one will present a unique challenge.&lt;/p&gt;&#xA;&lt;p&gt;I don't know if the &amp;quot;Preface&amp;quot; is too goofy.  Please comment with your input and I will act accordingly with popular opinion.&lt;/p&gt;&#xA;&lt;p&gt;Any input or suggestions or comments or upvotes are appreciated!&lt;/p&gt;&#xA;" OwnerUserId="16241" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-05-16T23:08:01.880" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1571" PostTypeId="1" CreationDate="2014-05-12T16:50:59.123" Score="3" ViewCount="132" Body="&lt;p&gt;A &lt;strong&gt;combination challenge&lt;/strong&gt; takes multiple other challenges and combines them. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/q/26691/18487&quot;&gt;this&lt;/a&gt; challenge combines the challenges of finding the Greatest Common Divisor (GCD) and Prime Factorization.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Which of the following stances does the community take on such challenges? Assume that you are somehow able to tell 100% that one of the parts, if posted alone, would be a duplicate or not.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A combination challenge is duplicate if and only if all of its parts are duplicate.&lt;/li&gt;&#xA;&lt;li&gt;A combination challenge is duplicate if any single part is a duplicate.&lt;/li&gt;&#xA;&lt;li&gt;A combination challenge is duplicate if and only if that exact combination challenge has been posted before.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;New users viewing this post should be aware of the following posts that attempt to formalize what it means to be a duplicate on this site. These questions and answers do not necessarily reflect my personal views. Rather, they show what the community as a whole thought at the time. As usual, swing a vote the other way if you disagree, or post your own answer.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/824/18487&quot;&gt;Reposting really old questions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/777/18487&quot;&gt;On reposting challenges with a different winning criteria&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1239/18487&quot;&gt;The question to ask when marking duplicates&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2014-05-12T17:02:00.450" Title="Duplicateness of Combination Challenges" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1572" PostTypeId="2" ParentId="1571" CreationDate="2014-05-12T17:02:00.450" Score="5" Body="&lt;p&gt;The questions to ask here is: can the question be solved in a different way than the previous two challenges? Does it add anything interesting over them?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If someone posts a challenge that combines two algorithms, but there is one algorithm that does both things, then it adds something new and interesting, and it can be solved in a different way. So, it should be left open.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the combined challenge can only be solved by combining the two seperating algorithms, then it does not really add anything interesting and it cannot be solved in a different way. So, it should be closed as duplicate.&lt;/p&gt;&#xA;" OwnerUserId="9275" LastActivityDate="2014-05-12T17:02:00.450" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1573" PostTypeId="2" ParentId="1550" CreationDate="2014-05-12T17:28:04.073" Score="0" Body="&lt;p&gt;if we consider that the import of a jQuery interpreter or CoffeeScript compiler be included on the count, shouldn't we also add the import of the GolfScript? (as in &lt;code&gt;ruby g.rb&lt;/code&gt; for 10 chars)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can execute jQuery code in a lot of web contexts without need of importing it (such as stackexchange.com itself)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, the argument that it is an import like in C, C#, Java or Python seems valid. Maybe we can provide a standard script tag with a minified URL that could be used by all jQuery answers so they don't compite to see who has the shorter tag.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;About being some snippet of javascript being a complete program, I think it depends on the needed context.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the code just calculates a numerical value, it can be a program by itself, since I can pass it to node, rhino or whatever standalone engine and it will give me a result.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But if the code needs an HTML context, such as modifying/accesing DOM (in the example &lt;code&gt;$(&quot;body&quot;)&lt;/code&gt; or using alert/prompt, the minimun code needed for a document to be interpreted as HTML+js (even if it doesn't use jQuery) is &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;script&amp;gt;[code]&amp;lt;/script&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;that implicitly declares a &lt;code&gt;&amp;lt;html&amp;gt;&lt;/code&gt; root, with an implied &lt;code&gt;&amp;lt;head&amp;gt;&lt;/code&gt; with a single &lt;code&gt;&amp;lt;script&amp;gt;&lt;/code&gt; child and and empty body. Otherwhise, a standalone engine would fail since there is no document, and a browser would treat it as plain text&lt;/p&gt;&#xA;" OwnerUserId="13870" LastActivityDate="2014-05-12T17:28:04.073" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1574" PostTypeId="2" ParentId="1499" CreationDate="2014-05-12T18:44:01.137" Score="5" Body="&lt;p&gt;I think the only real solution to this problem is to put the question on hold and direct the user to a &quot;How to ask&quot; page or something similar.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A relevant example from Stack Overflow &lt;a href=&quot;https://meta.stackoverflow.com/questions/254262/before-you-post-your-next-question?cb=1&quot;&gt;Before you post your next question&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;When your question is put on hold, it means that the user community decided to &quot;pause&quot; it, preventing new answers from being posted while you edit your question to improve it. Your question was most likely put on hold because:&lt;/p&gt;&#xA;  &#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;Your question's topic is not permitted here, or&lt;/li&gt;&#xA;  &lt;li&gt;Your question is incomplete in some way; i.e. you didn't provide enough information to make it answerable, or&lt;/li&gt;&#xA;  &lt;li&gt;We can't understand your question, or&lt;/li&gt;&#xA;  &lt;li&gt;Your question is too broad; it has too many possible answers, or would require the better part of a book chapter to answer.&lt;/li&gt;&#xA;  &lt;li&gt;Your question is too subjective; it mostly asks for opinions, such as &quot;what do you think about...&quot; or &quot;what is the best...&quot;&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="9462" LastEditorUserId="-1" LastEditDate="2017-03-17T10:37:58.557" LastActivityDate="2014-05-12T18:44:01.137" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1578" PostTypeId="1" AcceptedAnswerId="1579" CreationDate="2014-05-13T19:11:04.043" Score="5" ViewCount="268" Body="&lt;p&gt;See &lt;a href=&quot;https://codegolf.stackexchange.com/a/26916/10619)&quot;&gt;this answer&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not sure how to deal with this answer. That's the shorter code at this time, so it may be the winner. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;On one hand, the tokenized version is sort of compressed code, but it seems to be totally unreadable by an human. So I'm not sure if counting the characters of the tokenized version is fair. On the other hand, it's a feature from the language so it doesn't break any rule.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What do you think? Are there other languages which can be &lt;em&gt;compressed&lt;/em&gt; on similar ways? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I haven't seen this discussion on meta yet so I'm posting it, it may be useful if somebody asks the same thing. &lt;/p&gt;&#xA;" OwnerUserId="10619" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-06-01T09:23:52.687" Title="Are tokenized PostScript/GhostScript answers acceptable?" Tags="|discussion|rules|answers|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1579" PostTypeId="2" ParentId="1578" CreationDate="2014-05-13T19:17:53.880" Score="5" Body="&lt;p&gt;&lt;em&gt;Despite being a moderator, I'm not speaking for the whole site in this instance. I am just speaking as a user.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I consider that valid. It's not required for the code to be human-readable. We allow submissions in GolfScript or object code, after all.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-05-13T19:17:53.880" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1580" PostTypeId="2" ParentId="1555" CreationDate="2014-05-13T21:59:34.827" Score="4" Body="&lt;p&gt;Doorknob's answer had to many points. By extracting this specific point and addressing it alone, we get a &lt;em&gt;clear&lt;/em&gt; idea of what the community thinks.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If it is a &quot;big list&quot; question but not so broad that a book could be&#xA;  written to answer it, post it on main and flag for a mod to convert it&#xA;  to Community Wiki.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Downvote&lt;/strong&gt; if you think that &lt;em&gt;all&lt;/em&gt; &quot;Big List&quot; questions should be encouraged.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Upvote&lt;/strong&gt; if you think that &quot;Big List&quot; questions should be discouraged, but &quot;Language Specific Tips&quot; questions should be en exception to the rule because they already exist and are a precious resource for the PPCG community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Comment&lt;/strong&gt; if you think that all list questions, including tips, should be eradicated, unless someone else has clearly made that comment, in which case you should just upvote that comment.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastActivityDate="2014-05-13T21:59:34.827" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1581" PostTypeId="2" ParentId="2140" CreationDate="2014-05-14T11:50:42.160" Score="0" Body="&lt;h1&gt;Brute Force Decryption&lt;/h1&gt;&#xA;&lt;h2&gt;The Task&lt;/h2&gt;&#xA;&lt;p&gt;Write an function &lt;code&gt;B()&lt;/code&gt; in any language of your choice that takes an encrypted string as input and brute forces though solutions then infers the key used. Your program should then output the decrypted string and the key.&lt;/p&gt;&#xA;&lt;p&gt;The encrypted string is one that is in English, is a valid sentence and has been encrypted by shifting the ASCII number by the key.&lt;/p&gt;&#xA;&lt;h2&gt;The Rules &lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is code golf, smallest program wins.&lt;/li&gt;&#xA;&lt;li&gt;You can’t use any external dictionaries.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Encryption&lt;/h2&gt;&#xA;&lt;p&gt;To help you along I’ve written this program, which shows you how the string is encrypted:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;def encrypt(string, key):&#xA;    encrypted = str()&#xA;    for Char in string:&#xA;        encrypted += (chr(ord(Char) + key))&#xA;    return encrypted&#xA;&#xA;def decrypt(string, key):&#xA;    decrypted = str()&#xA;    for Char in string:&#xA;        decrypted += (chr(ord(Char) - key))&#xA;    return decrypted&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Use Like:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt; encrypt(&amp;quot;secret&amp;quot;, 5)&#xA;'xjhwjy'&#xA;&amp;gt;&amp;gt;&amp;gt; decrypt(&amp;quot;xjhwjy&amp;quot;, 5)&#xA;'secret'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="20464" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-05-14T11:50:42.160" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1582" PostTypeId="2" ParentId="1541" CreationDate="2014-05-14T13:03:17.177" Score="1" Body="&lt;p&gt;I was thinking about a similar concept for counting the code length of languages like C, Pascal, ... and so on by assuming every reserved word would be tokenised as if we had a C, Pascal, ... editor with a tokeniser like in classic BASIC systems.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;Normal&quot; languages can not beat APL, J and all the other &quot;golfy&quot; languages' code length often enough when not counting each language entity (reserved word) as only 1 point.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Maybe even a step further, we could count every identifier (var-, function, procedure, ... name) as one point and discard whitespaces outside strings and comments and docstrings (see Python) not being used as diusguised program text storage.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This would kill the advantage to use short names and give readable code a chance even if well commented.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But who will be able to manage all this? A jury cannot know all language definitions and I bet not even everyone coding codegolf answers knows his language well enough.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I see no general way to solve this, but in your case (tokenised BASIC) we may be able to see the length of the stored tokenised source like in BASICs of the 80s. Some interpreters/editors save the tokenised program as default.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can you see the tokenised length of your code in some directory listing?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The last hurdle is the one defining the rules for the individual puzzle: We need some lobbyism there or nearly every golfing will end being won by an unreadable piece of code of a special golflanguage.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And I do not think this really is funny, interesting or desired.&lt;/p&gt;&#xA;" OwnerDisplayName="user19214" LastActivityDate="2014-05-14T13:03:17.177" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1583" PostTypeId="2" ParentId="1545" CreationDate="2014-05-14T18:16:47.623" Score="0" Body="&lt;p&gt;I'm not sure I like this new thing. Although I did write the tag wiki for it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there was, say, a fixed, unchanging book from which you could take these bits, then maybe yes. But SO is a forum where anyone posts effectively anything.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Issues with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/duct-tape-coding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;duct-tape-coding&amp;#39;&quot; rel=&quot;tag&quot;&gt;duct-tape-coding&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We can't control what someone posts on SO. What if someone just posted a huge library of code there (and it would be accessible although probably closed), would we be allowed to use it?&lt;/li&gt;&#xA;&lt;li&gt;Similarly, you can post your solution on SO, then post it on PPCG and link to your SO post. Perhaps forbid using code on SO that your account posted?&lt;/li&gt;&#xA;&lt;li&gt;Winning criterion? I understand that most upvotes wins, and you get upvotes for creative code, but I'm not sure about the idea of &quot;creative stealing&quot;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user16402" LastActivityDate="2014-05-14T18:16:47.623" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1584" PostTypeId="1" CreationDate="2014-05-14T18:35:49.367" Score="2" ViewCount="477" Body="&lt;p&gt;I think that Brainfuck and many other esoteric languages almost never win &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, because they take many characters to express things. So, overall, &lt;strong&gt;Brainfuck programs are longer in bytes, because they use only eight different characters. I think that it isn't fair to give each character one byte in a language which uses just over 3 per cent of the ASCII charset.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm suggesting this simple amendment to the scoring rules of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; which will give some esoteric languages more of a chance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you have a character set of only 16 characters, each character is 4 bits. Hence, you can store 2 characters in one byte.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, in languages which have 16 or fewer useful characters (e.g. Brainfuck, any others?), &lt;strong&gt;every character should count as 0.5 bytes&lt;/strong&gt; (unless the program contains ASCII characters which are not in our set of 16, in which case normal scoring applies).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Similarly, for languages such as Whitespace, which uses 3 different characters (correct me if I'm wrong), you could count every char as 0.25 bytes, unless the program contains other chars.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm a bit reluctant about giving HQ9+ the 0.25 byte privilege, but ultimately there's no reason why not - we all know it's a joke, it won't somehow become more clever if we allow it to be scored like this, and if we didn't let HQ9+ have 0.25 bytes per char it would be a confusing exception to the rules.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;TL;DR (too long, didn't read)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I think that in languages that use 16 or fewer different characters, and ignore all others (e.g. Brainfuck), every character should count as half a byte for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. This will give more of a fair chance (?) to many esoteric languages, and allow them to compete with more respectable things.&lt;/p&gt;&#xA;" OwnerDisplayName="user16402" LastActivityDate="2014-05-15T02:55:50.727" Title="Score Brainfuck as 0.5 bytes per char (because it only uses 8 characters)?" Tags="|discussion|code-golf|scoring|" AnswerCount="1" CommentCount="4" ClosedDate="2014-05-19T07:15:57.623" ContentLicense="CC BY-SA 3.0" />
  <row Id="1585" PostTypeId="2" ParentId="1584" CreationDate="2014-05-15T02:55:50.727" Score="6" Body="&lt;p&gt;This doesn't need to be in the site's rules because it already exists in the real world.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, let me define my own language called &quot;BitF*ck,&quot; directly mapping BF commands to bits:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+ 000&#xA;- 001&#xA;&amp;gt; 010&#xA;&amp;lt; 011&#xA;. 100&#xA;, 101&#xA;[ 110&#xA;] 111&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now each BF character is .375 bytes, and look, we didn't need to change any of the site's rules! Similarly, we could map HQ9+ to &lt;code&gt;00 01 10 11&lt;/code&gt; and get .25 bytes per character.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The advantages of this are:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;We have an objective way of determining how many bytes a character should be (just use bits instead of characters!).&lt;/li&gt;&#xA;&lt;li&gt;It's already used in the real world&lt;/li&gt;&#xA;&lt;li&gt;No special cases are needed - just map any language to a set of bits and you're good for every challenge from that point on&lt;/li&gt;&#xA;&lt;li&gt;No arguments about what a &quot;character set&quot; is&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;You could always provide a BF program alongside the binary translation, to make it easier to understand.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-05-15T02:55:50.727" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1586" PostTypeId="2" ParentId="2140" CreationDate="2014-05-15T15:14:39.920" Score="3" Body="&lt;h2&gt;Design and Solve a Maze&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(&lt;a href=&quot;https://codegolf.stackexchange.com/questions/27057/design-and-solve-a-maze-on-hold-while-sandboxing&quot;&gt;this question&lt;/a&gt; on hold while the details are ironed out)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Your task is to play the roles of &lt;strong&gt;both&lt;/strong&gt; characters in &lt;a href=&quot;https://www.youtube.com/watch?v=V3-a58Wt2tk&amp;amp;t=41&quot; rel=&quot;nofollow noreferrer&quot;&gt;this scene&lt;/a&gt; from Inception. In it, Cobb gives Ariadne a challenge:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;You have two minutes to design a maze that takes one minute to solve.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Some liberties will be taken on that description. Most importantly, this challenge is not time-based, rather scores are based on the effectiveness of your mazes and maze-solvers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;I apologize for the many edits to this challenge as we iterate towards an easy and fair format..&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Part I: Maze format&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;All mazes are square. A cell in the maze is represented as a zero-indexed tuple &lt;code&gt;row column&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Walls are represented by two binary strings: one for horizontal walls (which block movement between rows) and vertical walls (vice versa). On an &lt;code&gt;NxN&lt;/code&gt; maze, there are &lt;code&gt;Nx(N-1)&lt;/code&gt; possible walls of each type. Let's take a 3x3 example where the cells are labelled:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A   B | C&#xA;   ---&#xA;D | E   F&#xA;   ---&#xA;G   H | I&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;all possible vertical walls are: &lt;code&gt;AB BC DE EF GH HI&lt;/code&gt;. Translated into a string, the walls shown are &lt;code&gt;011001&lt;/code&gt; for vertical walls and &lt;code&gt;010010&lt;/code&gt; for horizontal walls. Also, by &quot;binary string&quot; I mean &quot;the characters '0' and '1'&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The full maze format is a string which contains, in this order:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;width&lt;/li&gt;&#xA;&lt;li&gt;start cell tuple&lt;/li&gt;&#xA;&lt;li&gt;end cell tuple&lt;/li&gt;&#xA;&lt;li&gt;horizontal walls&lt;/li&gt;&#xA;&lt;li&gt;vertical walls&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For example, this maze:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   0 1 2 3 4&#xA;   _________&#xA;0 | |  E|  _|&#xA;1 |  _|_|_  |&#xA;2 |_ _ _  | |&#xA;3 |  _ _  | |&#xA;4 |____S|___|&#xA;start:(4,2)&#xA;end:(0,2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is formatted to this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;5&#xA;4 2&#xA;0 2&#xA;00001011101110001100&#xA;10100110000100010010&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Part II: The Architect&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The Architect program creates the maze. It must play by the rules and provide a valid maze (one where a solution exists, and the end is not on top of the start).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;input via stdin:&lt;/strong&gt; Two positive integers:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;size [random seed]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;size&lt;/code&gt; will be in &lt;code&gt;[15, 50]&lt;/code&gt;. You are encouraged to make use of the random seed so that matches can be replayed, although it is not required.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;output to stdout:&lt;/strong&gt; A valid size x size (square) maze using the format described in Part I. &quot;valid&quot; means that a solution exists, and the start cell is not equal to the end cell.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The score of an Architect on a given maze is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   # steps taken to solve&#xA;------------------------------&#xA;max(dist(start,end),(# walls))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So architects are rewarded for complex mazes, but penalized for each wall built (this is a substitute for Ariadne's time restriction). The &lt;code&gt;dist()&lt;/code&gt; function ensures that a maze with no walls does not get an infinite score. The outside borders of the maze do not contribute to the wall count.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Part III: The Solver&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The Solver attempts to solve mazes generated by others' architects. There is a sort of fog-of-war: only walls adjacent to visited cells are included (all others are replaced with '?')&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;input via stdin:&lt;/strong&gt; the same maze format, but with '?' where walls are unknown, an extra line for the current location, and a comma-separated list of valid choices from this location. (This is a big edit that is meant to make it simpler to write a maze-parsing function)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;example (same as the above 5x5 maze after taking one step left)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;5&#xA;4 2&#xA;0 2&#xA;???????????????011??&#xA;????????????????001?&#xA;4 1&#xA;4 0,4 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which corresponds something like this, where &lt;code&gt;?&lt;/code&gt; is fog:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   0 1 2 3 4&#xA;   _________&#xA;0 |????E????|&#xA;1 |?????????|&#xA;2 |?????????|&#xA;3 | ?_?_????|&#xA;4 |__C_S|_?_|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;output to stdout:&lt;/strong&gt; One of the tuples from the list of valid choices&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each Solver's score is the inverse of the Architect's score.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Part IV: King of the Hill&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Architects and Solvers are given separate scores, so there could potentially be two winners.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each pair of architects and solvers will have many chances to outwit each other. Scores will be averaged over all tests and opponents. Contrary to code golf conventions, highest average score wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I intend for this to be ongoing, but I can't guarantee continued testing forever! Let's say for now that a winner will be declared in one week.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Part V: Testing&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I have written a Python testing kit which includes a Maze class for parsing and writing in the proper formats, as well as an example architect/solver pair: Daedalus and the Minotaur&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Available on both &lt;a href=&quot;https://dl.dropboxusercontent.com/u/72170447/codegolf/maze.zip&quot; rel=&quot;nofollow noreferrer&quot;&gt;Dropbox&lt;/a&gt; and &lt;a href=&quot;http://github.com/wrongu/maze-challenge&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Part VI: Submitting&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I maintain veto power over all submissions - cleverness is encouraged, but not if it breaks the competition or my computer! (If I can't tell what your code does, I will probably veto it)&lt;/li&gt;&#xA;&lt;li&gt;Come up with a name for your Architect/Solver pair. Post your code along with instructions on how to run it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20024" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.653" LastActivityDate="2014-05-15T17:52:10.863" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="1587" PostTypeId="2" ParentId="1578" CreationDate="2014-05-15T23:26:45.967" Score="2" Body="&lt;p&gt;Since Postscript's binary tokens are in 1-to-1 correspondence with the regular ascii words, it's only polite to provide a full ascii version as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But if the binary version is correctly executed by the interpreter, that would appear to be the definition of &lt;em&gt;valid&lt;/em&gt; (unless, of course, ascii-only were an explicit requirement of the challenge).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I hasten (after actually looking at the linked question) to add that even the authors of these binary postscript programs are reluctant to take the idea &lt;em&gt;too far&lt;/em&gt;, because it gets sooooo weird so fast.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="2381" LastEditDate="2014-06-01T09:23:52.687" LastActivityDate="2014-06-01T09:23:52.687" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1588" PostTypeId="1" CreationDate="2014-05-16T14:05:28.253" Score="11" ViewCount="317" Body="&lt;p&gt;A certain (currently on hold) question was retagged from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle&lt;/a&gt; with the reason given&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Because the challenge is asking for the smallest possible solution, this is a [puzzle]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I was unconvinced, so I had a look at the tag's summary and wiki entry:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A puzzle is a problem or enigma that tests the ingenuity of the solver. Solutions may require recognizing patterns and creating a particular order.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Puzzles are often contrived as a form of entertainment, but they can also stem from serious mathematical or logistical problems.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This doesn't seem to make it very clear which questions the tag should be applied to. On a broad reading, it could be applied to 90% of the questions on the site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The obvious next step is to look at questions which have the tag, but that doesn't clear it up either. Some of them appear to have it because the question &lt;em&gt;is&lt;/em&gt; a programming puzzle: e.g.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/17312/194&quot;&gt;Code Injection works in C# too!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/12188/194&quot;&gt;When is a giraffe not a giraffe?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Others are &lt;em&gt;about&lt;/em&gt; a puzzle: e.g.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/20754/194&quot;&gt;3 and 5 Litre Jug Puzzle&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/27054/194&quot;&gt;Optimally solve the Flux Puzzle&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;What should &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle&lt;/a&gt; mean? Do we need to split this tag? If so, what should we call the new tag(s)?&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-11-02T02:45:26.880" Title="What does the puzzle tag mean?" Tags="|discussion|status-completed|tags|" AnswerCount="3" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1589" PostTypeId="1" AcceptedAnswerId="1590" CreationDate="2014-05-16T14:42:12.950" Score="17" ViewCount="588" Body="&lt;p&gt;What are the rules/community consensus about participating in your own challenge?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does it differ for each of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; and  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The person that asks the question isn't the one who picks a winner so...&lt;/p&gt;&#xA;" OwnerUserId="8938" LastEditorUserId="9275" LastEditDate="2014-05-16T15:26:43.860" LastActivityDate="2014-05-16T15:26:43.860" Title="Can I compete in my own challenge?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1590" PostTypeId="2" ParentId="1589" CreationDate="2014-05-16T15:25:32.150" Score="21" Body="&lt;p&gt;Yes, particpating in your own challenge is allowed, no matter of which challenge type. The &lt;a href=&quot;//codegolf.stackexchange.com/help/on-topic&quot;&gt;Help Center&lt;/a&gt; says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;It’s also OK to &lt;a href=&quot;//codegolf.stackexchange.com/helpcenter/self-answer&quot;&gt;participate in your own puzzles&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;But if you participate in your own challenge, it is recommended to wait some time before posting an answer to give others a chance to participate. Please see: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/98/9275&quot;&gt;Presolving Golf Questions&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your own answer is actually the best (according to the objective winning criteria) and you want to accept an answer, it's up to you whether you want to accept your own answer or someone else's answer. Personally, I would accept someone else's answer, but that's personal opinion. Also, accepting your own answer doesn't change very much, because if you accept your own answer, it won't be listed higher in the answer, but accepting someone else's answer does.&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2014-05-16T15:25:32.150" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1591" PostTypeId="2" ParentId="1514" CreationDate="2014-05-16T15:44:18.620" Score="-2" Body="&lt;p&gt;Based on the number of upvotes on questions and answers, code-trolling is obviously quite popular, just not with everybody.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you don't want it on the codegolf site, why not put it into a separate StackExchange site for those who enjoy it?  You could migrate the favourite posts over there, and keep this site clean.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also wonder if it needs to stay fixed to coding in particular.  Trolling questions on other topics might also be a fun activity for some.  (As we can see already on YahooAnswers...)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may dislike this attitude, but personally I don't care if a question poses a challenging problem or not.  What interests me is whether the answers make me laugh.  (&quot;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/16226/i-need-a-program-where-the-user-inputs-an-array-of-doubles-and-the-program-outpu&quot;&gt;Sleepsort&lt;/a&gt;&quot; is one of my favourites.)&lt;/p&gt;&#xA;" OwnerUserId="14643" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2014-05-16T15:52:01.437" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1592" PostTypeId="1" AcceptedAnswerId="22438" CreationDate="2014-05-16T19:52:00.053" Score="4" ViewCount="49" Body="&lt;p&gt;In the example below, word &lt;code&gt;internets&lt;/code&gt; is blue, even without hovering over the spoiler.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Code:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;! hello [world `internets`](https://codegolf.stackexchange.com/)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;  &lt;p&gt; hello &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;world &lt;code&gt;internets&lt;/code&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="3103" LastEditorUserId="68942" LastEditDate="2021-06-03T15:12:16.033" LastActivityDate="2021-06-03T15:12:16.033" Title="Code in link in spoiler is highlighted without hovering" Tags="|bug|status-completed|site-design|spoilers|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1593" PostTypeId="1" CreationDate="2014-05-17T01:18:21.993" Score="9" ViewCount="155" Body="&lt;p&gt;I'm a big fan of king-of-the-hill, and I'd like to see more of them. One of the problems is that they take a bit of work to set up and run. More than your average code-golf question, for instance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Creating a controller isn't &lt;em&gt;that&lt;/em&gt; hard, but it would be easier (and thus have a lower entry barrier) if there were generalized frameworks for a few popular languages. I think at least C/C++, Java, and Python are good candidates. Obviously any languages would be welcome, but with those three we can include a great majority of users. Included should be options for tournament type (round robin, free-for-all...), scoring methods, etc, but the basic structure and I/O would all be handled, leaving a few skeleton methods to implement.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm thinking of making one, since I already have most of the necessary parts in at least one language. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question is: How do I go about posting it so that people can use it? Points to consider:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's &lt;strong&gt;not&lt;/strong&gt; a challenge. There's not much debating this.&lt;/li&gt;&#xA;&lt;li&gt;It's also not even a &lt;em&gt;question&lt;/em&gt;. I suppose I could make a pithy &quot;Are there any KotH frameworks?&quot; question to answer, but even then it's too broad, etc.&lt;/li&gt;&#xA;&lt;li&gt;If posted to Meta, people just won't see it. Most users don't even seem to know about the sandbox, and it's been around for quite some time. This seems like the kind of thing that would get attention for a few days on meta, then disappear forever. If it won't ever be used or cared about, I just won't bother.&lt;/li&gt;&#xA;&lt;li&gt;If posted to Main, is there precedent for something like this? I haven't seen any similar posts, and if people are just going to VTC it as off-topic or similar, I just won't bother.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So, I'm posting for feedback/guidance, and to get a general feel for if the community wants this kind of thing, and how it fits into the overall picture.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2014-07-27T18:10:37.460" Title="Posting a challenge framework?" Tags="|discussion|policy|" AnswerCount="1" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="1594" PostTypeId="1" CreationDate="2014-05-17T14:02:14.397" Score="14" ViewCount="561" Body="&lt;h1&gt;Code trolling &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1514/we-need-to-take-an-official-stance-on-code-trolling&quot;&gt;is officially no more!&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It has been 141 long days since [code-trolling] was first born. Now, every code trolling question is either locked or deleted. Code trolling is finally gone!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What now?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1192/3808&quot;&gt;Grace Note's progress report&lt;/a&gt;, it was mentioned:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The invention of a new puzzle type, and perhaps continued innovation in that department, helps a lot.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Now that code trolling is dead, we're going to need to find another way to bring in more traffic.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1555/3808&quot;&gt;non-challenge questions&lt;/a&gt; post has recieved only support, so we could start asking more of those.&lt;/li&gt;&#xA;&lt;li&gt;We could think of new challenge types (and make meta posts with the &lt;a href=&quot;/questions/tagged/new-genre&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;new-genre&amp;#39;&quot; rel=&quot;tag&quot;&gt;new-genre&lt;/a&gt; tag to discuss them).&lt;/li&gt;&#xA;&lt;li&gt;Something else? Think of ideas for what you think would help in the answers!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;But what about &lt;em&gt;good&lt;/em&gt; code trolling?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Or, what happens when someone thinks of a code trolling post we want?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this case,&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the post should be tagged [popularity-contest] with a message specifying the type of answer and voting criteria there should be&lt;/li&gt;&#xA;&lt;li&gt;we should analyze the post, find out what makes it a &quot;good&quot; code trolling post, and then perhaps create a new tag based on this&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Anything else?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Yes. The point of this post is to push us even further to the graduation mark, for which we need a higher volume of high quality posts (and new users). Seeing as the previous &quot;progress report&quot; was quite... vague, not really giving us any concrete goals, I've pinged Grace Note requesting an updated &quot;goals checklist&quot; for the site's graduation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please post your own answers detailing what &lt;em&gt;you&lt;/em&gt; think this site needs, until we get an &quot;official&quot; response from Grace and the SE team!&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2014-05-17T14:02:14.397" Title="Code trolling is dead. Now what?" Tags="|discussion|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1601" PostTypeId="2" ParentId="1550" CreationDate="2014-05-19T05:35:42.647" Score="0" Body="&lt;p&gt;I've only used jQuery in that answer, as it was mentioned in the original question, and not specifically referred to as not allowed or requiring extra points added to the score, etc. I agree that answers with jQuery should be treated differently (JS or JS+jQuery, etc.) as it's an external library, but I think that's up to the OP and it should be clarified per question, if not mentioned.&lt;/p&gt;&#xA;" OwnerUserId="16278" LastActivityDate="2014-05-19T05:35:42.647" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1603" PostTypeId="1" CreationDate="2014-05-19T06:48:45.983" Score="6" ViewCount="257" Body="&lt;p&gt;This question has an interesting property, in that judging a winner is dependent on unknown data:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/28207/recognize-handwritten-digits&quot;&gt;Recognize handwritten digits&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is actually not an uncommon way of things working in puzzle-space. In programming competitions, you often are given simple test data and then you submit your program to a server where it is run against some kind of pathological data which you are not given in advance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But if a winner is to be declared, there is a question of when and how that data will be disclosed.  It introduces a factor of timing into it such that no entry can be accepted after the revelation point.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does such a question with an undisclosed winning condition deserve its own tag? Should there be a rule that once a winner is declared, the test data be published, and no answers accepted after that point?&lt;/p&gt;&#xA;" OwnerUserId="57" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-10-29T18:25:40.677" Title="Winning conditions not measurable until question author decides to reveal test data set" Tags="|discussion|policy|tags|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1604" PostTypeId="1" CreationDate="2014-05-19T13:59:18.237" Score="6" ViewCount="206" Body="&lt;h1&gt;The Proposed Question Sandboxes aren't really working.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As per &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1086/should-the-sandbox-be-moved-to-the-main-site&quot;&gt;this question, we should move them to the main site&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is just a suggestion for how we might go about this.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Create a special tag, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/work-in-progress&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;work-in-progress&amp;#39;&quot; rel=&quot;tag&quot;&gt;work-in-progress&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sandbox-question&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sandbox-question&amp;#39;&quot; rel=&quot;tag&quot;&gt;sandbox-question&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sandbox&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sandbox&amp;#39;&quot; rel=&quot;tag&quot;&gt;sandbox&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/under-construction&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;under-construction&amp;#39;&quot; rel=&quot;tag&quot;&gt;under-construction&lt;/a&gt;, anything that gets across the meaning.&lt;/li&gt;&#xA;&lt;li&gt;Questions with this tag cannot be answered.&lt;/li&gt;&#xA;&lt;li&gt;Instead of posting proposed questions to the sandbox, you post it to the main site as a separate question, &lt;strong&gt;with the special tag&lt;/strong&gt;. When someone attempts to answer the question, a message is displayed saying that the question is on hold because it is not yet finalised.&lt;/li&gt;&#xA;&lt;li&gt;As in the sandbox, suggestions and issues are pointed out in the comments on that question.&lt;/li&gt;&#xA;&lt;li&gt;Since it is on the main site, suggested edits are enabled, so improving the question is easier.&lt;/li&gt;&#xA;&lt;li&gt;For the same reason, you get reputation as an incentive (?) although you can't upvote something twice (normally, once in sandbox and once on the main site, but here it's one question) so I doubt this will work. Doesn't matter that much.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;When the question is finished, the author removes the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/work-in-progress&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;work-in-progress&amp;#39;&quot; rel=&quot;tag&quot;&gt;work-in-progress&lt;/a&gt; tag, the question is no longer &quot;on hold&quot;, and answers can be posted - the contest begins at this point.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Any feedback?&lt;/p&gt;&#xA;" OwnerDisplayName="user16402" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2014-05-19T23:55:56.980" Title="Revamp the sandbox system?" Tags="|discussion|sandbox|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1606" PostTypeId="2" ParentId="1192" CreationDate="2014-05-19T17:28:14.820" Score="14" Body="&lt;p&gt;In my experience here, things are turned a bit upside down from other sites.  Because making a good puzzle has turned out to be harder than solving it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That is because--if your puzzle is going to be any good--you have to provide sample inputs and outputs.  Which means most of the time you really should solve your puzzle before you post it.  So you think one up, then solve it, then lay out the parameters...it's basically working as a CS professor for free.  It is very unlike the other Q&amp;amp;A sites where the questioner doesn't do a whole lot of work relative to the answerers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The maligned &lt;code&gt;code-trolling&lt;/code&gt; tag, I think, is disliked because specifically it doesn't require that expected effort on the part of the asker.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It just seems way more fun to answer than to ask.  Given the time to compose a creative question, you start getting disappointed with only a few answers, especially if people seem to be just &lt;em&gt;solving&lt;/em&gt; your problem and not golfing it.  Also by its very nature, there is no timeline for accepting answers.  If you've invested a lot in defining a puzzle then why declare a winner if it closes your puzzle?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So there is an issue here about the fact that grafting puzzle/solution onto the SE model has a bit of a mismatch.  I don't think it's correctible, which isn't a condemnation of the site in any way.  It just means that it's always going to be kind of weird and policy needs to be laid out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thus I think it's still in beta until there's a larger amount of precedent set in policy space.  But hopefully &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1356/&quot;&gt;the ads will get run&lt;/a&gt; to drive a bit more traffic and awareness.  This one cracks me up:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/dJFll.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="57" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2014-05-19T17:28:14.820" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1607" PostTypeId="2" ParentId="1604" CreationDate="2014-05-19T20:43:01.203" Score="3" Body="&lt;p&gt;I'd like to back up &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1305/9498&quot;&gt;The problem with sandboxes, and a proposed solution&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Let's kill the sandbox&lt;/p&gt;&#xA;&lt;p&gt;...&lt;/p&gt;&#xA;&lt;p&gt;But, aren't we a Stack Exchange site? The entire network was designed so that there is no need for a sandbox. Is there not editing and closing? &lt;strong&gt;Questions don't have to be perfect immediately on posting; if you see a minor problem, just edit the post! Comment for major problems, and close unrecoverable challenges.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Are you starting to notice something? This is exactly what other Stack Exchange sites do!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;sup&gt;(emphasis added after all emphasis removed)&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;We don't need such an elaborate solution. Just work out your questions beforehand (in a text editor / paste into a text editor), then post. Any problems can be solved in a short amount of time afterwards.&lt;/p&gt;&#xA;&lt;p&gt;I used this method for the most recent challenges of mine:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/25157/tower-of-hanoi-sort&quot;&gt;Tower of Hanoi Sort&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/26581/may-the-4th-be-with-you&quot;&gt;May the 4th be with you!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Both challenges turned out fine. There were a couple mistakes that I fixed within the first day of posting.&lt;/p&gt;&#xA;&lt;p&gt;For challenges that need more working out beforehand, I recommend using &lt;a href=&quot;http://chat.stackexchange.com/rooms/307/golf-puzzle-lab&quot;&gt;the chatroom designated for this&lt;/a&gt;. Usually, you don't need to post the whole challenge, just the idea and the possible problems. Then, discuss it with fellow codegolfers. I've found that this method, combined with the previous one works pretty well.&lt;/p&gt;&#xA;&lt;p&gt;However, sometimes, you might only have an idea, but don't know how to create something from that. Use the chat. But if you need even more help, the current sandbox style works well. If you follow the other parts of this question, the sandbox will get less posts anyways.&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-05-19T23:55:56.980" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1608" PostTypeId="1" CreationDate="2014-05-20T00:27:51.547" Score="7" ViewCount="261" Body="&lt;p&gt;In the &lt;a href=&quot;http://chat.stackexchange.com/rooms/307&quot;&gt;Golf/Puzzle Lab&lt;/a&gt;, I came up with an idea to create a Pokemon Emerald Battle Factory KotH. However, &lt;a href=&quot;http://chat.stackexchange.com/rooms/307/conversation/is-pokemon-legal&quot;&gt;I had some concerns on the legality&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The closest thing I could find from Nintendo is the &lt;a href=&quot;http://www.nintendo.com/consumer/info/en_na/docs.jsp?menu=corp&amp;amp;submenu=ipgame&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;IP Requests and Game Submission Ideas&lt;/em&gt;&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;We appreciate the interest in Nintendo and in all our video game products. To us, it represents a great sign of success and recognition of the Nintendo brand.&lt;/p&gt;&#xA;&lt;p&gt;&amp;quot;Nintendo&amp;quot; is a registered trademark of Nintendo of America Inc. Nintendo owns extensive intellectual property rights in all of its products, including video game systems, game titles, characters, game software, graphics, artwork, and screen shots. Nintendo also retains rights in content on Nintendo's web sites, including articles, artwork, screen shots and other files. Trademarks and copyrights for third-party games and characters are owned by the companies that market or license those products.&lt;/p&gt;&#xA;&lt;p&gt;While we are grateful for all the requests for permission to use Nintendo properties, &lt;strong&gt;we are not able to grant such requests.&lt;/strong&gt; We receive thousands of requests and we do not have adequate staffing to review them all. Therefore, &lt;strong&gt;our general policy is to decline requests for permission for the use of Nintendo properties.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Although we are not able to grant permission, &lt;em&gt;use of Nintendo's properties without formal permission by Nintendo may still be allowed under the relevant laws of the particular jurisdiction involved.&lt;/em&gt; Thus, we encourage you to &lt;strong&gt;seek your own legal counsel if you have any questions about whether your particular proposed use is permitted without Nintendo's authorization.&lt;/strong&gt; Nintendo cannot provide legal advice.&lt;/p&gt;&#xA;&lt;p&gt;We appreciate your support.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;sup&gt;(emphasis added)&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;So it appears that this challenge idea would &lt;strong&gt;not&lt;/strong&gt; be legal. However, it seems that the page is talking about spinoff games, not programming contests.&lt;/p&gt;&#xA;&lt;p&gt;Would such a challenge be legal?&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;From what I understand, it would be legal if there is enough difference. What is enough difference? If I simply changed every Pokemon name, sprite, move, etc, but left the formulas / game mechanics the same, would this be different enough?&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This led me to think about some other challenges. My most recent challenge, &lt;a href=&quot;https://codegolf.stackexchange.com/q/26581/9498&quot;&gt;May the 4th be with you!&lt;/a&gt;, is clearly based off of Star Wars. Star Wars has its own Copyright and Trademarks, so should I have looked at those before posting that challenge? Is it even legal?&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-05-20T17:34:05.760" Title="Legal to use Pokemon, etc as Themes for Challenges?" Tags="|support|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1609" PostTypeId="2" ParentId="1608" CreationDate="2014-05-20T01:08:06.587" Score="7" Body="&lt;p&gt;As someone who has had a Pokemon-related application removed from distribution channels due to a DMCA compaint, I can confirm that Nintendo is very protective of their IP. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, their complaint was very specific, and the alleged infringement was over the use of their &lt;em&gt;copyrighted names&lt;/em&gt; (Bulbasaur, Charmander, etc). I also believe other forces were at play. The complaint did not come until I had a 500k userbase, and only for this particular mobile app (which was not much different than, say, the Bulbapedia or PokemonDB websites). The timing also coincided with the news of &lt;em&gt;their&lt;/em&gt; release of a mobile Pokedex-type app, so odds are they just wanted to clear the field. I didn't bother fighting it, for obvious reasons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All that is to say, they &lt;em&gt;probably&lt;/em&gt; won't hassle you. Your situation is vastly different than mine was, and I doubt they are looking to move into to the PP&amp;amp;CG challenge market. Using Pokemon as a basis for a challenge is something they &lt;em&gt;most likely&lt;/em&gt; won't waste the time to pursue, even if it happens to come across their radar. If things like &lt;a href=&quot;http://www.pokemontowerdefense2game.com/pokemon-tower-defense-2-game.html&quot; rel=&quot;nofollow&quot;&gt;Pokemon Tower Defense&lt;/a&gt; and &lt;a href=&quot;http://www.delugerpg.com/&quot; rel=&quot;nofollow&quot;&gt;Deluge RPG&lt;/a&gt; have been around for &lt;em&gt;years&lt;/em&gt;, then I &lt;em&gt;doubt&lt;/em&gt; you have anything to worry about.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Of course, that assumes they are being logical about things.&lt;/strong&gt; If you're still worried, then just change some stuff around. IANAL, but I think if you keep it generic, you have no cause for concern. Game mechanics aren't &lt;em&gt;exactly&lt;/em&gt; patentable, but trademark/IP concerns still exist (see &lt;a href=&quot;http://en.wikipedia.org/wiki/Lexulous#Lawsuit&quot; rel=&quot;nofollow&quot;&gt;&lt;em&gt;Scrabulous/Lexulous&lt;/em&gt;&lt;/a&gt; history). By changing the names of the assets, altering the mechanics a bit, and not using the &quot;P&quot; word, you shouldn't have anything to worry about, no matter &lt;em&gt;how&lt;/em&gt; frisky the attorneys get.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="14215" LastEditDate="2014-05-20T17:34:05.760" LastActivityDate="2014-05-20T17:34:05.760" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1610" PostTypeId="1" AcceptedAnswerId="1625" CreationDate="2014-05-20T04:36:42.703" Score="8" ViewCount="663" Body="&lt;p&gt;There's a certain stigma against using languages designed for golfing in this community, and for good reason -- but I think it would be fun to turn the tables and make this form of &quot;cheating&quot; into a legitimate competition. This idea goes beyond the scope of a single question, so I'm posting it as its own question rather than in the Sandbox. Personally, I think it has great potential, but there are some issues that I need to iron out first, and I'd love to hear your feedback.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the first &quot;phase&quot; of this challenge, &lt;strong&gt;users would create and post their own custom-built languages designed for golfing.&lt;/strong&gt; The language can be as simple as a script that translates &quot;golfed&quot; text into an existing programming language and then executes that -- it needn't be too complex. The language itself would not need to be golfed, or fit any requirements other than that it must not depend on external resources for execution (i.e. no running code from an author-controlled server).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal here is to create the most general purpose, &quot;jack-of-all-trades&quot; golfing language possible, as the second phase of this challenge would involve these languages being pitted against one another in golfing challenges determined by a non-participating third party. The core idea here is that &lt;strong&gt;the golfing challenges are not revealed until after the users have created their languages.&lt;/strong&gt; The language that consistently solves the given puzzles with the shortest source code is deemed the winner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are a few ways that this could be turned into an ongoing event. For example, users could be permitted to post their languages at any time, but they would only be allowed to enter challenges posted &lt;em&gt;after&lt;/em&gt; their language was submitted. Also, perhaps anyone would be allowed to post a challenge, but they would not be allowed to participate in their own challenges. But this raises the issue of quality control (see below).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some issues:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;How would languages be submitted?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Let's say they're posted in a dedicated thread. Should that thread be on the main site or here on meta?&lt;/li&gt;&#xA;&lt;li&gt;What happens if a user edits their language after a challenge has been posted? The challenge author would need to verify that submissions work with the language as it was originally posted.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Quality control for challenges?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The ideal scenario is a diverse set of challenges with requirements that are difficult to anticipate, but the community won't always be in agreement on this.&lt;/li&gt;&#xA;&lt;li&gt;Only count challenges that reach a certain score threshold -- but scores can fluctuate over time, and this reduces incentive for early submissions. (What if your hard work goes for nothing because the question didn't get enough votes?)&lt;/li&gt;&#xA;&lt;li&gt;Could be mitigated by having a select group of challenge authors, or possibly a new &quot;sandbox&quot; where ideas for challenges could be deemed official. &lt;/li&gt;&#xA;&lt;li&gt;Basically, I definitely need feedback on this part.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;How many people would actually put in the necessary effort in the first phase?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I did my best to make it sound as non-scary as possible in the second paragraph, but creating a custom &quot;language&quot; is still a daunting task.&lt;/li&gt;&#xA;&lt;li&gt;Would &lt;em&gt;you&lt;/em&gt; make up a language for this event? What would it take to get you to make one?&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;What should this be called?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'll humor myself and assume you all love this idea enough to put it into action. What would be a good tag name for this idea?&lt;/li&gt;&#xA;&lt;li&gt;Clearly the title of this thread is too verbose to be tweaked into a short and catchy name...&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Feedback and criticism would be greatly appreciated. I've been bouncing this idea around in my head for weeks, and I think it's good enough to at least suggest by now.&lt;/p&gt;&#xA;" OwnerUserId="2104" LastActivityDate="2015-04-15T17:35:18.953" Title="Create your own golfing programming language, then see how well it performs on undisclosed challenges?" Tags="|discussion|" AnswerCount="2" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1611" PostTypeId="1" CreationDate="2014-05-20T10:26:35.370" Score="2" ViewCount="176" Body="&lt;p&gt;I would like to add some math to a question and the easiest way to do this in math.stackexchange.com is to use LaTeX.  However it seems codegolf doesn't support this and I understand it is a pain to add MathJax support. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given that, what is the best workaround?  It would be great if there were &quot;best practice&quot; document which gave explicit instructions for how to insert LaTeX.  It seems you have to make images and include them but it's not even obvious to me how to make the images in the right size/shape, how to include them inline and so on.&lt;/p&gt;&#xA;" OwnerDisplayName="user9206" LastActivityDate="2014-06-02T09:49:40.643" Title="Best method to add LaTeX math to a question" Tags="|discussion|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1613" PostTypeId="2" ParentId="1611" CreationDate="2014-05-21T03:12:38.080" Score="4" Body="&lt;p&gt;The two easiest methods are by using the unicode characters, or by taking screenshots of rendered LaTeX. Here's how the second can be done:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Go to &lt;a href=&quot;https://math.stackexchange.com/questions/ask&quot;&gt;math.stackexchange&lt;/a&gt; or some other LaTeX rendering site.&lt;/li&gt;&#xA;&lt;li&gt;Type out your LaTeX&lt;/li&gt;&#xA;&lt;li&gt;Take a screenshot. If you use Windows, Snipping Tool is very useful. Here's an example:&#xA;&lt;img src=&quot;https://i.stack.imgur.com/OlRA8.png&quot; alt=&quot;enter image description here&quot;&gt;&#xA;Make sure your screenshot is localized on the rendered LaTeX.&lt;/li&gt;&#xA;&lt;li&gt;Now you can upload it to your Question / Answer by &lt;code&gt;Ctrl+G&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, if you just paste it inline, this is what happens: &lt;img src=&quot;https://i.stack.imgur.com/95GZO.png&quot; alt=&quot;$$\int_0^\infty x^\frac12dx$$&quot;&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Not very nice. But this does work well for non-inlined LaTeX. We can make it slightly nicer by surrounding the image in 3 &lt;code&gt;&amp;lt;sub&amp;gt;&lt;/code&gt;; &lt;code&gt;&amp;lt;sub&amp;gt;&amp;lt;sub&amp;gt;&amp;lt;sub&amp;gt;![$$\int_0^\infty x^\frac12dx$$][3]&amp;lt;/sub&amp;gt;&amp;lt;/sub&amp;gt;&amp;lt;/sub&amp;gt;&lt;/code&gt; produces: &lt;sub&gt;&lt;sub&gt;&lt;sub&gt;&lt;img src=&quot;https://i.stack.imgur.com/95GZO.png&quot; alt=&quot;$$\int_0^\infty x^\frac12dx$$&quot;&gt;&lt;/sub&gt;&lt;/sub&gt;&lt;/sub&gt;. Any additional &lt;code&gt;&amp;lt;sub&amp;gt;&lt;/code&gt; tags do not make the image lower.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Also note: when you use &lt;code&gt;Ctrl+G&lt;/code&gt;, you get &lt;code&gt;![enter image description here][2]&lt;/code&gt;. It would be helpful for you to change the description to the LaTeX used to produce the image, so that if the image ever goes bad, the equation can be recreated.&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2017-04-13T12:19:20.950" LastActivityDate="2014-05-21T03:12:38.080" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1615" PostTypeId="1" AcceptedAnswerId="1619" CreationDate="2014-05-23T06:54:35.060" Score="29" ViewCount="2079" Body="&lt;p&gt;Every now and then, I see an edit where somebody does some golfing (&lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits/11286&quot;&gt;most recent&lt;/a&gt;). From what I can tell, our standard is to reject those edits as invalid and post a comment saying what was suggested, because we feel that golfing tips should be comments. And I have always done so (after I learned).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, some edits are very small, such as the one I linked to. If I can determine that they are correct, is it appropriate to approve them?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What type of golfing edits should we approve?&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2014-05-27T19:45:57.717" Title="Suggested Edits: Reject Golfing?" Tags="|discussion|editing|reviewing|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1618" PostTypeId="2" ParentId="2140" CreationDate="2014-05-24T00:09:48.507" Score="30" Body="&lt;h1&gt;Conquer the Solar System&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is an outline for a strategical King-of-the-Hill challenge which is loosely based on &lt;a href=&quot;http://en.wikipedia.org/wiki/Risk_(game)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Risk&lt;/a&gt; (loosely enough so as not to preclude a future Classic Risk KotH).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is far from complete, but I'm posting it here to gather feedback from the community to finalise the rules before getting down to implementing the control program. This would definitely make for one of the more complicated KotHs and I'd like it to be as fun as possible, so that it's worth the participants' time! I will probably leave this up for several weeks before starting work on the controller.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I wanted to try something new: &lt;strong&gt;The distinguishing feature&lt;/strong&gt; of this challenge is that it does not use simultaneous turn-based simulation, but rather something similar to Final Fantasy X's Conditional Turn-Based Battle system. Different actions take different amounts of time, and it's simply your turn again when that time has elapsed. Of course, the control program will simply skip ahead to the next scheduled event.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are probably more technical details in this post than what will be necessary for participants of the final challenge (and will most likely be presented in a different form then). I just wanted to include everything I've currently got, so people might point me towards issues in the underlying assumptions.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Setting&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The year is 2200: Mankind has spread out over the entire solar system. But we all know how much humans like other humans with different resources – interplanetary war has broken out. Each inhabited planet or natural satellite – collectively referred to as (celestial) bodies – starts out as one faction in this war. The goal is conquer as much of the solar system as possible.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Model&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The arena of the challenge is hence the solar system. I will include all solid planets and natural satellites with a diameter of 10 km or more (just for a bit of realism; this should provide a large enough surface area to build a base). There are 89 of those bodies – I could add even smaller objects should I get more submissions than that, but I think that's near impossible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;strong&gt;Note:&lt;/strong&gt; I said &quot;solid&quot; bodies. Jupiter, Saturn, Uranus and Neptune are gas giants and hence cannot be landed on (their satellites can be, though).&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Planetary motion &lt;em&gt;will&lt;/em&gt; be simulated, although in a simplified manner. Orbits are assumed to be circular and lie all in one plane, with a radius of approximately their real-life semi-major axis, and their real-life orbital period. Hence, no gravity is simulated – only simple (uniform) circular motion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Satellite motion &lt;em&gt;will not&lt;/em&gt; be simulated. Travel distances between satellites or between a planet and its satellites are assumed to be fixed (and will be determined once, by me, dependent on the satellites' orbit sizes).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The asteroid belt between Mars and Jupiter can be travelled to, but no bases can be built there – it acts mainly as a hideout. It is modelled as a continuous ring at fixed distance from the sun with fixed orbital period. Bots can choose to land their units at any position on the belt. Individual asteroids are &lt;em&gt;not&lt;/em&gt; modelled – not even the larger ones like Ceres, which are way above the size limit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Technically, the map is a complete graph whose vertices are the above 89 bodies plus the asteroid belt. The travel times between any pair of bodies depends on their distance at the time the travel commences (neglecting motion of the target during the travel). As planetary motion is simulated these travel times do generally change over time though. The future spacecraft is assumed to travel between 500,000 and 1,000,000 m/s and travels in straight lines, giving time scales between 10 seconds and 80 days.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For each match, the solar system will start out in a random configuration (each planet getting a random position on its orbit). Of course, that's not realistic, because the planetary configuration for 2200 is not going to be subject to change, but we need to keep the game fair.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Gameplay&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each player starts with a &lt;strong&gt;base&lt;/strong&gt; on a random body. The remaining bodies will be uninhabited.&lt;/li&gt;&#xA;&lt;li&gt;Each player starts with &lt;strong&gt;one flagship&lt;/strong&gt;, and &lt;strong&gt;&lt;em&gt;n&lt;/em&gt; fighters&lt;/strong&gt; (where &lt;em&gt;n&lt;/em&gt; needs to be determined, but I'm thinking on the order of 10) – collectively referred to as &lt;em&gt;units&lt;/em&gt;. &lt;/li&gt;&#xA;&lt;li&gt;Players write a bot that is asked for a move whenever one of their own units is idle or needs to act, because it's being attacked or similar.&lt;/li&gt;&#xA;&lt;li&gt;Fighters are a lot faster than flagships, so they will act as scouts as well, to avoid time-wasting travel with the flagship.&lt;/li&gt;&#xA;&lt;li&gt;Flagships can build new bases on uninhabited bodies, or take over enemy bases (the former taking longer than the latter).&lt;/li&gt;&#xA;&lt;li&gt;Each additional base immediately grants another &lt;em&gt;n&lt;/em&gt; fighters.&lt;/li&gt;&#xA;&lt;li&gt;Each base regularly spawns new fighters (say, once a week). If a player controls an entire planet system (the planet and all satellites), the spawn rate on all bodies in that system is increased (to, say, once every five days).&lt;/li&gt;&#xA;&lt;li&gt;Flagships are vulnerable while working on bases. Either they can't interrupt the building process upon arrival of enemies, or such an interruption will cause the total build time to increase.&lt;/li&gt;&#xA;&lt;li&gt;Upon landing on a body, units can't leave immediately. They need to remain for &lt;em&gt;p&lt;/em&gt; % of the time it took to get there (&lt;em&gt;p&lt;/em&gt; ≈ 10?) in order to refuel. Technically, this is to prevent units from hiding all the time in interplanetary space. &lt;strong&gt;(formula subject to change)&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;If there are units from multiple players on a body, they may engage in combat (see next section for details on combat).&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;If a player's flagship is defeated they immediately lose the game!&lt;/strong&gt; All their units and bases go over to the player who killed the flagship.&lt;/li&gt;&#xA;&lt;li&gt;The bot may always decide to wait idly (I'll set a minimum on this, to prevent bots from spamming the control program with millisecond waits). Waiting will be interrupted by any relevant event like allies or enemies arriving somewhere.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Combat System&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Fights are carried similar to the rules of &lt;a href=&quot;http://en.wikipedia.org/wiki/Risk_(game)#Attacking&quot; rel=&quot;nofollow noreferrer&quot;&gt;Risk&lt;/a&gt;. Please refer to the Wikipedia page or &lt;em&gt;the internet&lt;/em&gt; for the exact rules for now – all necessary rules will be part of the final challenge post though.&lt;/li&gt;&#xA;&lt;li&gt;Attackers may choose to attack with 1 to 3 units, defenders choose to defend with 1 or 2 units. The outcome is determined by rolling dice. After each round of battle, battle may either continue with the remaining units or be aborted.&lt;/li&gt;&#xA;&lt;li&gt;One round of combat takes &lt;em&gt;1 day&lt;/em&gt;. (subject to change)&lt;/li&gt;&#xA;&lt;li&gt;Whether a player is &lt;em&gt;attacker&lt;/em&gt; or &lt;em&gt;defender&lt;/em&gt; depends on whether he has a base on the current body. This means that two attackers could be fighting each other on an unclaimed body, in which case both may use 3 units in a fight, but units from both sides die in a tie.&lt;/li&gt;&#xA;&lt;li&gt;If a player has a flagship on the body where the fight takes place, one unit will roll a d8 instead of a d6, &lt;em&gt;unless&lt;/em&gt; they are currently working on a base (building one or converting one).&lt;/li&gt;&#xA;&lt;li&gt;When players lose units, they always lose fighters first. Hence, if a player has a flagship on a planet, and loses less than all of his units, the flagship will remain.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Implementation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I will either go with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/25347/survival-game-create-your-wolf&quot;&gt;Rusher's approach&lt;/a&gt; of writing a Java controller where participants only need to implement an interface (and provide a wrapper for non-Java submissions) or I'll write a controller that invokes bots as separate processes whenever its their turn.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On their turn, each bot will be provided with&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the current time&lt;/li&gt;&#xA;&lt;li&gt;the number of bases and units controlled by each player&lt;/li&gt;&#xA;&lt;li&gt;the state of all bodies the player currently has units or bases on&lt;/li&gt;&#xA;&lt;li&gt;the ID and location of the idle unit(s) that can currently perform an action&lt;/li&gt;&#xA;&lt;li&gt;a list of all bodies with their current positions (in Cartesian coordinates, so distances can easily be determined)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;potentially I'll just provide a list of travel times for each idle unit instead, to save the bots the need to compute those&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;a list of all bodies with their current angular positions&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The latter can safely be ignored, but is provided for bots that want to predict planetary motion to take shortcuts. Static numerical data like orbital radii and periods will not be provided to the bots, but I'll publish a table with the challenge to be hardcoded into the bots if desired.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Further Design Decisions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I realise that there is a lot of complexity in this. This is why I need your help to refine the concept and remove unnecessary details while keeping the heart of the challenge in tact (while making sure the rules are consistent). Please give me all the feedback you can think of, but here are a few particular questions I have in mind that need to be answered:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How should vulnerability during base-building be modelled? By penalising or by disallowing interruptions?&lt;/li&gt;&#xA;&lt;li&gt;How can fights between more than two parties be handled?&lt;/li&gt;&#xA;&lt;li&gt;Is the &quot;refuelling&quot; necessary/useful? Do the details for it need work? &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In any case, I don't doubt this challenge will remain fairly complex when finalised. It might help to gather some momentum if a few heroes volunteered up front to submit a bot to this - ideally ones which show that the entry barrier doesn't need to be as high as it looks.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anyway, thanks a lot for reading this and helping out with the design of this challenge!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm happy to discuss details in chat (The Nineteenth Byte or Golf/Puzzle Lab; but ping me so I know you've posted there) or just here, but this challenge may need more discussion than fits in comments.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.653" LastActivityDate="2014-07-27T11:05:40.760" CommentCount="22" ContentLicense="CC BY-SA 3.0" />
  <row Id="1619" PostTypeId="2" ParentId="1615" CreationDate="2014-05-24T09:48:00.773" Score="37" Body="&lt;p&gt;I have noticed the same thing. Personally I disagree with code edits, but I would like to know what others think..&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Personal anecdote&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Recently I have received  many useful suggestions in comments, some of which have been wrong. For example on this question &lt;a href=&quot;https://codegolf.stackexchange.com/a/26330/15599&quot;&gt;https://codegolf.stackexchange.com/a/26330/15599&lt;/a&gt; this user &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;https://codegolf.stackexchange.com/users/12012/dennis&lt;/a&gt; suggested in the comments that the following code could be contracted thus by changing from logical &lt;code&gt;and&lt;/code&gt; to bitwise &lt;code&gt;and&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;while(p-h&amp;amp;&amp;amp;p-w) -----&amp;gt; while(p-h&amp;amp;p-w)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This does not work, because I want to exit the loop when p is equal to h or w, and with the suggestion it would exit early for example with &lt;code&gt;p=3, h=1, w=2&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The user quickly realised his mistake and deleted the comment, but went on to make several helpful suggestions that significantly reduced the code, &lt;em&gt;always being respectful enough to make his suggestions via comments and allowing me to test the suggestions for myself before incorporating them (btw, he wasn't testing them himself, there was a typo in one suggestion.)&lt;/em&gt; I was also able to improve the code further on top of his suggestions, so the fact that he made the suggestions in the comments saved an unnecesary edit cycle. And I learned more that way, too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I appreciated this user's input, but would have been annoyed if he had made direct edits (especially untested ones) on my code without asking.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And I actually had to download a different compiler to take advantage of certain suggestions. See here: &lt;a href=&quot;https://codegolf.stackexchange.com/a/2204/15599&quot;&gt;https://codegolf.stackexchange.com/a/2204/15599&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Conclusion&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I generally reject or skip code edits when I see them in the review queue. If there is a strong agreement here, I will change to always rejecting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One of the first examples I saw I rejected but it got accepted anyway. But I have seen other edits accepted that most definitely should have been rejected that got through (one user added some irrelevant tags, and admitted afterwards that he had made a mistake because he &quot;thought he was on another question.&quot;) Therefore as a general point, always think before you click &lt;code&gt;accept&lt;/code&gt;, and if unsure click &lt;code&gt;skip&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Somebody has to test that revised code, and really that should be the answer poster. The suggester may have tested, but what works on your machine may not work on mine, and the answer poster will presumably want code that works on their own machine. The reviewer should also be very sure the code will work (which may involve testing, but as Jan Dvorak points out that is a lot to ask.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have only accepted one code edit, and it was because the answerer had included some &lt;code&gt;imports&lt;/code&gt; in the &lt;em&gt;golfed version&lt;/em&gt; but not in the ungolfed version. I considered this a formatting edit rather than a code edit, so on this one occasion I accepted it. &lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2014-05-25T05:07:32.283" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1620" PostTypeId="1" CreationDate="2014-05-24T23:30:58.087" Score="3" ViewCount="72" Body="&lt;p&gt;Code and text don't appear at the same time.&lt;/p&gt;&#xA;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;  &lt;p&gt; Second &lt;code&gt;First&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It's a bit odd, and Code Golf has a better reason to use code in spoiler text than any site on the SE network :)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;EDIT: It appears this is not the first problem with spoiler text and code.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/questions/136589/on-beta-sites-the-monospace-formatting-in-a-spoiler-quote-is-evil&quot;&gt;On beta sites, the monospace formatting in a spoiler quote is evil.&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/809/inline-code-inside-a-spoiler-block-is-difficult-to-read&quot;&gt;Inline code inside a spoiler block is difficult to read&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;That problem was fixed in April 2014.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also found &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1331/spoiler-transitions-are-strange-here?lq=1&quot;&gt;spoiler transitions are strange here&lt;/a&gt; which describes the same problem with transitions, though it was (incorrectly) closed as a duplicate of another question.&lt;/p&gt;&#xA;" OwnerUserId="17538" LastEditorUserId="68942" LastEditDate="2021-06-04T07:29:37.800" LastActivityDate="2021-06-04T07:29:37.800" Title="Spoiler code and text doesn't appear at the same time" Tags="|bug|status-completed|formatting|spoilers|" AnswerCount="0" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1622" PostTypeId="2" ParentId="2140" CreationDate="2014-05-25T12:03:12.700" Score="11" Body="&lt;h1&gt;Evolution of Squares!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is an idea for a question, and is very much unfinished. Please help me develop it further.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;This is inspired by an evolution simulation I coded a few years ago in JavaScript. The source code and documentation can be found &lt;a href=&quot;https://github.com/professorfish/pixel-evolution&quot; rel=&quot;nofollow noreferrer&quot;&gt;on GitHub&lt;/a&gt;, and you can play the simulation itself &lt;a href=&quot;http://professorfish.github.io/pixel-evolution/&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This will be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;. I'll provide a specification which all answers must keep to and a few ideas for features, but otherwise add as many features as you can.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Summary&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to build a simulation which demonstrates evolution by natural selection (&quot;survival of the fittest&quot;). The world in which this will be carried out will be a two-dimensional, &lt;em&gt;n&lt;/em&gt; by &lt;em&gt;n&lt;/em&gt; (exact dimensions to be decided) grid. Each cell on the grid can be empty or occupied by a living cell (or by food resources?).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Cell lifetime&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Cells have a 'lifetime counter', which starts at some value when the cell is born and diminishes randomly over cycles of the simulation, so the cells age. It can be replenished by food, but when it reaches 0, the cell dies and is removed (or converted to a food block).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Cells instantly die when completely surrounded? Is that a good idea?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Genetics&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Every so often, cells replicate - produce a copy of themselves, with the lifetime counter reset to maximum, normally with identical characteristics.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is a probability &lt;em&gt;p&lt;/em&gt; (to be decided) that when a cell is replicating, its genome will be changed. It can &quot;improve&quot; or get &quot;worse&quot; with equal probability.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The genome can be as simple as an array of true/false booleans for different characteristics, or an array of integers/decimals describing how much of a characteristic there is (e.g. replication per 100 ticks).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Characteristics which could be included are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;faster replication&lt;/li&gt;&#xA;&lt;li&gt;eating other cells to increase lifetime counter&lt;/li&gt;&#xA;&lt;li&gt;movement&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;The Simulation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The simulation starts with a single, very basic cell, with no fancy characteristics, placed at the centre of the grid. If we decide to implement food resources for cells to pick up, some of these will spawn as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every cycle, cells replicate, age, and die as described above.&lt;/p&gt;&#xA;" OwnerDisplayName="user16402" LastEditorDisplayName="user16402" LastEditDate="2014-06-05T07:23:54.720" LastActivityDate="2014-06-05T07:23:54.720" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="1623" PostTypeId="1" CreationDate="2014-05-25T21:07:05.533" Score="4" ViewCount="290" Body="&lt;p&gt;Looking through the questions today, I see, rather disappointingly, that of first 4 questions one is a duplicate and 3 are on hold and absolutely cannot be saved.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But further down, &lt;strong&gt;I see this question&lt;/strong&gt;, posted by a new user: &lt;a href=&quot;https://codegolf.stackexchange.com/q/28435/15599&quot;&gt;Convert integer to string preserving order&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There was much discussion about what was actually meant by &quot;string&quot; and the asker finally settled on UTF-8 (far more interesting than 8 bit ASCII.) However the reason this is on hold is because it does not have an objective winning criterion. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;But the stated winning criterion, with a few minor edits as indicated below to iron out inconsistencies, would be quite clear:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;s&gt;Victory&lt;/s&gt;&lt;strong&gt;&lt;em&gt;Winning condition&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;The answer must fulfill the conditions above&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;The main goal is to make f(X) to represent the number in the least number of &lt;s&gt;bytes &lt;/s&gt;&#xA;      &lt;strong&gt;&lt;em&gt;UTF-8 unicode characters&lt;/em&gt;&lt;/strong&gt;, assuming X is distributed uniformly.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;In case of draw, smallest code wins (sum of code of f and code of g)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So really, this is a code-golf question in disguise. The existing answer produces 5 unicode characters. Unfortunately I don't know enough about Unicode to confirm that is the minimum required (though obviously there &lt;em&gt;is&lt;/em&gt; a fixed number), so the least-characters criterion should stay, making code-challenge the right tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Then we have this question&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/q/28504/15599&quot;&gt;How many paths are available?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question was already showing a small number of downvotes, I believe because people thought it was a lot of tedious effort to handle the big numbers. So I suggested hex to make it easier. The OP then allowed basically any form of output format which was too broad. A couple of close votes came in, but even after the OP fixed the output format, close votes still kept coming in. &lt;em&gt;Why?&lt;/em&gt; The text is now as follows&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Output will be the number of possible paths in either a string or hex&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Admittedly this can be improved on. I would prefer the following, with or without the hex:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Output will be a string containing the number of possible paths in decimal or hex format.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I now regret mentioning hex, because of what happened. Also, regarding the linked question &lt;em&gt;big integer multiplication&lt;/em&gt; I found a way to answer the question &lt;strong&gt;without multiplying&lt;/strong&gt;. My entire ungolfed C program (posted in the comments on the question as I am unable to post it as an answer) is actually shorter than most of the answers on that linked question, proving that it is not a duplicate. (&lt;strong&gt;In fact, I would love to see if someone can beat me using big integer multiplication&lt;/strong&gt; in any language!)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Now, the two questions I mention here (and many that have gone before them) have potential. So I will go ahead tomorrow and make the minor edits I propose. &lt;em&gt;But are the close voters ever going to come back and re-evaluate?&lt;/em&gt; The problem is, once the questions are closed, they receive very little traffic and no-one is around to reopen them.&lt;/strong&gt; Even the question askers seem to have given up. &lt;em&gt;Is there anything that can be done about this?&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another issue is that many people (including me) do not know how to cancel a close vote once cast.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By the way, the fact that a question seems hard (but not impossible) is not in my opinion a reason to downvote. The &lt;a href=&quot;https://codegolf.stackexchange.com/q/22992/15599&quot;&gt;Alphanumeric Hello World&lt;/a&gt; question received a lot of downvotes before the rules were relaxed, and although it is now very popular, it still carries a fair number of those downvotes, because people have not re-evaluated. The top two answers, while not sophisticated in terms of algorithm, are both very clever in terms of syntax.  &lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2022-06-07T11:04:05.943" Title="Does being on hold for more than a day have to be a kiss of death for a question?" Tags="|discussion|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1624" PostTypeId="2" ParentId="1623" CreationDate="2014-05-26T11:27:51.933" Score="1" Body="&lt;p&gt;When your question is on hold, try to improve the question by editing. This will add the question on the reopen queue where users can reopen the question. If the question after improvements is good enough, it will be reopened.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In fact, the post you are linking to already has four reopen votes, which means it will be soon reopened after changes.&lt;/p&gt;&#xA;" OwnerUserId="3103" LastActivityDate="2014-05-26T11:27:51.933" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1625" PostTypeId="2" ParentId="1610" CreationDate="2014-05-26T16:27:12.420" Score="7" Body="&lt;p&gt;I think that while this could be a good idea when polished, PPCG is a bad platform to host it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider the short-lived &lt;a href=&quot;http://www.pltgames.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;PLT Games&lt;/a&gt;, which ran on a similar premise: invent programming languages that later get compared, in this case motivated by a monthly theme and judged on a small set of criteria. It really only took off for the first round, and quickly dwindled. which is probably because that first month's theme was &quot;Turing Tarpit&quot; and that's all that most people really wanted to do when it came to designing languages: make an esolang to get all their sillies out, and then get back to whatever they'd been working on before.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think that a significant portion* of the participants in this kind of contest wouldn't be in it to try to design a good golflang, as much as just to have a chance to add something into Golfscript that they thought would be a (cool | powerful | character-saving) feature. A call-for-golflangs like this would just turn into a cacophony of CJams (no offense to aditsu) and similar Golfscript derivatives where people just rename, repurpose, and reoverload whatever they think might save them a character sometimes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My point is that if this (the above) is the situation, it doesn't feel like it would fit into PPCG, either cluttering the site up with a style of challenge some will despise or entirely ignore (e.g. the late &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;?), or keeping to one spot but being very cramped and hard-to-follow, especially for anyone joining partway through the event and not being there from the start. Specs for languages &lt;em&gt;that are different enough from existing languages to merit such a comprehensive contest&lt;/em&gt; would get very big and probably very technical, too; more suited for external pages or even wikis than Sandbox-like answers to a Sandbox-like question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the goal is to create the best golflang, it might be more worthwhile to set up a dedicated SE chatroom or even a completely separate forum for a group of interested people to test, debate, and implement each other's ideas, instead of hammering the peg into a StackExchange-shaped hole just because PPCG is already here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A couple of old PPCG questions in a similar vein (&lt;a href=&quot;https://codegolf.stackexchange.com/q/16954/5138&quot;&gt;An improved version of GolfScript&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/q/6977/5138&quot;&gt;Language idea for golfing purposes&lt;/a&gt;) went over quite well, which I'd say was because the premise was simply to improve and contribute to a specific language idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;* &lt;sup&gt;I'm thinking &quot;most&quot;, but it could be as little as &quot;some&quot; or &quot;a few&quot; if I've overestimated, in which case the point isn't very relevant anymore. But regardless of how many people know how to sensibly participate, innovation isn't easy, and I still don't think there'd be an enormous berth of fresh golf ideas that are irreconcilable with all but one specific kind of language.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="5138" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2014-05-26T16:27:12.420" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1626" PostTypeId="2" ParentId="1588" CreationDate="2014-05-26T17:36:16.490" Score="4" Body="&lt;p&gt;This question seriously needs an answer. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle&lt;/a&gt; is simultaneously meaningless and far too broad on this site. It came up today in chat briefly but nothing really happened with it, so I'm throwing a proposal into the ring.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my opinion, most questions on this site aren't &quot;puzzles&quot; (which is why I'm kind of sad that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1147/is-the-name-of-the-community-correct&quot;&gt;this&lt;/a&gt; never went anywhere). &quot;Write a program to solve this problem in the least bytes&quot; is not a puzzle. Neither is &quot;write a program that solves this problem and gets the most upvotes&quot;. Those are challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;em&gt;puzzle&lt;/em&gt; has you working in a smaller scope. It isn't just &quot;solve a problem&quot;, it's &quot;solve a problem that's been set up specifically to be difficult for you&quot;. You aren't only working to solve the problem, you're also working against the question. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/12188/when-is-a-giraffe-not-a-giraffe&quot;&gt;When is a giraffe not a giraffe?&lt;/a&gt; is a programming puzzle. The javascript game &lt;a href=&quot;http://alexnisnevich.github.io/untrusted/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Untrusted&lt;/a&gt; is composed entirely of programming puzzles.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Without further ado, my formal proposal for a meaning for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;A &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle&lt;/a&gt; includes a goal, a partially completed program, and rules outlining how program can be modified. The program is specifically designed to make achieving the goal difficult. An answer to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle&lt;/a&gt; takes the program and modifies it only in ways specified in the rules, so that the goal is achieved.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm sure this could be worded better, but I hope it's fairly clear. As an example: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/28610/reach-catch-when-everything-in-the-try-block-is-caught-already&quot;&gt;This question&lt;/a&gt; posted today meets these criteria.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Goal:&lt;/strong&gt; Get the flow of code into the outer &lt;code&gt;catch&lt;/code&gt; block.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Partially completed program designed to make the goal difficult:&lt;/strong&gt; The program has an extra &lt;code&gt;try&lt;/code&gt;/&lt;code&gt;catch&lt;/code&gt; block inside the first, which makes achieving the goal difficult because...&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Rules on how the program can be modified:&lt;/strong&gt; You're only allowed to add code between the 5th and 7th lines.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Under these rules, it would be a proper &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This isn't the only possible meaning of the tag, but I wanted to say something to hopefully get a discussion going.&lt;/p&gt;&#xA;" OwnerUserId="14509" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-05-26T17:36:16.490" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1627" PostTypeId="2" ParentId="1588" CreationDate="2014-05-26T17:37:51.037" Score="4" Body="&lt;h1&gt;Puzzles and objectivity&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is related to but separate from my other answer here. I have that one in mind while writing this, but there's no reason that ideas from this answer (or at least, slightly modified ones) couldn't apply if we go a different direction.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;How do puzzles mesh with the requirement for an objective winning criteria?&lt;/strong&gt; I can see three ways we could take this. That isn't to say there can't be more, but this is what I've thought of. &lt;strong&gt;Please vote in the comments to this post to decide which one to use.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;1 - Keep it the way it is.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle&lt;/a&gt; doesn't have to interact with the rule at all. Any question tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle&lt;/a&gt; still needs one of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;2 - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle&lt;/a&gt; becomes a tag with rules meaning.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; means &quot;lowest bytecount wins&quot;. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; means &quot;most upvotes wins&quot;. Today in chat, Doorknob said &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/15731529#15731529&quot;&gt;this&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I'm assuming the \[puzzle\] tag implies &quot;first correct answer [wins],&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That makes sense for a puzzle. Once it's solved, it's solved. However, some puzzles are more open-ended than others, and the OP may want to judge based on something other than speed. In my opinion, the best way to handle this would be to say &quot;On it's own, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle&lt;/a&gt; implies 'first working answer'. If combined with another win condition's tag, that tag overrides &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle&lt;/a&gt;&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;3 - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle&lt;/a&gt; is an exception to the rule.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I don't like this option, but it's here for completeness.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why do we have to have a win condition for a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle&lt;/a&gt;? In real life, people don't usually &quot;win&quot; a puzzle, they just have fun solving it. We could do the same thing here.&lt;/p&gt;&#xA;" OwnerUserId="14509" LastEditorUserId="12205" LastEditDate="2014-05-27T01:26:23.510" LastActivityDate="2014-05-27T01:26:23.510" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1630" PostTypeId="2" ParentId="2140" CreationDate="2014-05-27T18:42:39.123" Score="0" Body="&lt;p&gt;&lt;strong&gt;GCD Game for better algorithm&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given A,B print the number of pairs (a,b) such that GCD(a,b)=1 and 1&amp;lt;=a&amp;lt;=A and 1&amp;lt;=b&amp;lt;=B.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First line contains T, the number of testcases. Each testcase consists of two space separated integers denoting A and B.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Number of pairs which have GCD=1&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Constraints:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1 &amp;lt;= T &amp;lt;= 10&lt;/li&gt;&#xA;&lt;li&gt;1 &amp;lt;= A &amp;lt;= 10&lt;sup&gt;5&lt;/sup&gt;&lt;/li&gt;&#xA;&lt;li&gt;1 &amp;lt;= B &amp;lt;= 10&lt;sup&gt;5&lt;/sup&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Sample Input&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;3 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Sample Output&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Explanation&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are five pairs of relatively prime numbers (where the first &amp;lt;= 3 and the second &amp;lt;= 2):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1,1&lt;br&gt;&#xA;1,2&lt;br&gt;&#xA;2,1&lt;br&gt;&#xA;3,1&lt;br&gt;&#xA;3,2&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Time Limit 5 sec(s)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Memory Limit 256 MB&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Source Limit 1024 KB&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Use smart ways &lt;strong&gt;Bruteforce won't work.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="21661" LastActivityDate="2014-05-27T18:42:39.123" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="1631" PostTypeId="2" ParentId="1615" CreationDate="2014-05-27T19:45:57.717" Score="25" Body="&lt;p&gt;Users should not edit code by other users. Even if an edit seems correct, it might not work with the original computer. Golfers like to make nonportable assumptions which are not true with every platform, or with every version of a programming language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Suppose I write sed(1) regular expression &lt;code&gt;/[0-9][0-9]*/&lt;/code&gt;, matching one or more digits. Another user wants to golf this into &lt;code&gt;/[0-9]\+/&lt;/code&gt;, but I disagree, because my sed(1) doesn't have &lt;code&gt;\+&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is a real example: I wrote a &lt;a href=&quot;https://codegolf.stackexchange.com/q/28370/4065&quot;&gt;Unix shell program&lt;/a&gt; &lt;code&gt;xmessage -timeout 3 hello world&lt;/code&gt; in 31 characters. A comment suggested &lt;code&gt;timeout 3 xmessage hello world&lt;/code&gt; in 30 characters, but I said no, because my computer had no &lt;code&gt;timeout&lt;/code&gt; command. I like such comments, but I want users to post them as comments, not by editing my post.&lt;/p&gt;&#xA;" OwnerUserId="4065" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2014-05-27T19:45:57.717" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1632" PostTypeId="1" AcceptedAnswerId="1633" CreationDate="2014-05-27T21:57:56.090" Score="4" ViewCount="139" Body="&lt;p&gt;A day or two ago, the following question was posted:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/28620/a-program-to-transliterate-l33t-words-to-regular-english-words&quot;&gt;https://codegolf.stackexchange.com/questions/28620/a-program-to-transliterate-l33t-words-to-regular-english-words&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It was about translating leetspeak into regular English. However, since there was no objective winning criterion, the question was quickly downvoted and put on hold. Eventually, the asker added a vague criterion &quot;shortest program that can translate the largest number of leet words wins&quot;. They were asked repeatedly in the comments to add something objective, but didn't do so and responded with curses and abuse along the lines of &quot;&lt;em&gt;you're high-rep users and admins, all you ever do is kill with flame, that's what you do for fun&lt;/em&gt;&quot;. Eventually the asker, who was a new user and had 1 rep, voluntarily deleted the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I am convinced that, had there been an objective winning criterion&lt;/strong&gt; (my personal suggestion is &lt;code&gt;[leet supported from a list]/[code length]&lt;/code&gt;, highest score wins, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;)&lt;strong&gt;, this could have been a good and popular question.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Can I post a similar, amended question in the sandbox to be reviewed?&lt;/strong&gt; Would posting a similar question infringe the rights of the original asker?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can't remember the asker's exact username, it might have been something like &lt;code&gt;N???? M.&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerDisplayName="user16402" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-05-28T23:55:03.737" Title="Can I repost someone else's closed question after fixing the issue?" Tags="|discussion|specific-question|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1633" PostTypeId="2" ParentId="1632" CreationDate="2014-05-27T23:22:38.430" Score="6" Body="&lt;p&gt;Given a link for attribution (even one that can only be seen by privileged users), there isn't a problem with it &lt;strong&gt;legally&lt;/strong&gt; (&lt;em&gt;insert I-am-not-a-lawyer here&lt;/em&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Morally&lt;/strong&gt;, that's up to you. I wouldn't frown on someone doing it, especially where the OP has voluntarily deleted it. By deleting instead of trying to edit it into shape, it looks to me like they're effectively saying &quot;I don't want this any more.&quot; If they thought they could make something valid out of it, it wouldn't be gone. Now it's someone else's turn to take a crack at it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Oh, and the asker was &lt;a href=&quot;https://codegolf.stackexchange.com/users/17191/nikos-m&quot;&gt;Nikos M.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-05-27T23:22:38.430" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1635" PostTypeId="2" ParentId="1588" CreationDate="2014-05-28T11:19:45.077" Score="9" Body="&lt;p&gt;Tags have auto-complete, so the tradeoff between a shorter tag vs a clearer tag is definitely in favour of the clearer tag. With that in mind, I propose eliminating the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle&lt;/a&gt; tag entirely in favour of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle-solver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle-solver&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle-solver&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;undergroundmonorail's proposed definition suits &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt; perfectly. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle-solver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle-solver&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle-solver&lt;/a&gt;'s short description would be something like:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A puzzle is a problem designed to test ingenuity. Questions in this category ask for a program which can substitute for that ingenuity.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-05-28T11:19:45.077" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1636" PostTypeId="2" ParentId="2140" CreationDate="2014-05-28T12:09:56.133" Score="3" Body="&lt;h1&gt;Help Joe Bloggs with his password hash&lt;/h1&gt;&#xA;&lt;p&gt;Joe was confidently using &amp;quot;password1&amp;quot; as his main password to all his accounts until one day he received an e-mail from fBay.&#xA;His account has been compromised and he must change his password immediately. Yet worse, the attacker had access to all Joe's accounts.&#xA;Being an engineer, Joe thought: &lt;em&gt;What if I could hash somehow my password using a keyword? I wouldn't need to remember any passwords and I would have a different one for each account.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Joe then creates an algorithm - he takes the domain name as a key and creates the password for each of his account consisting of:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1. (&amp;lt;consonants&amp;gt;&amp;lt;vowels&amp;gt;)(alternating case: lower, capital, lower...)&#xA;2. &amp;lt;number of consonants&amp;gt;&amp;lt;number of vowels&amp;gt;&#xA;3. &amp;lt;sum of consonants and vowels numbers converted to a character on US Qwerty Keyboard&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Joe then opens an account on SO to create a new code golf challenge. He uses &lt;code&gt;stackoverflow&lt;/code&gt; as a key to generate password:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1. sTcKvRfLwAoEo - consonants and vowels in alternating case&#xA;2. 94 - 9 consonants, 4 vowels&#xA;3. 9+4=13, 1+3=4, Shift+4=$&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Therefore, Joe's password for stackoverflow is: &lt;code&gt;sTcKvRfLwAoEo94$&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Create a shortest function to generate a password given the rules above. The code should accept a string type parameter &lt;code&gt;d&lt;/code&gt; and return/display the generated password.&lt;/p&gt;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Only Latin letters from the input should be used. Any other characters should be ignored.&lt;/li&gt;&#xA;&lt;li&gt;Minimum input length is 1 letter. (guys at q.com need passwords as well!)&lt;/li&gt;&#xA;&lt;li&gt;Assume Y is a vowel&lt;/li&gt;&#xA;&lt;li&gt;If vowels or consonants are missing, use &lt;code&gt;0&lt;/code&gt; accordingly. E.g. input &lt;code&gt;a&lt;/code&gt; would result in &lt;code&gt;a01!&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Shortest code wins&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://simple.wikipedia.org/wiki/Vowel&quot; rel=&quot;nofollow noreferrer&quot;&gt;List of vowels and consonants&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/File:KB_United_States-NoAltGr.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;US qwerty keyboard&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="21491" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-06-18T10:43:42.133" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="1637" PostTypeId="2" ParentId="1632" CreationDate="2014-05-28T23:55:03.737" Score="1" Body="&lt;p&gt;This has already been done, successfully, here:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/26861/duct-tape-can-fix-mothers-day&quot;&gt;Duct tape can fix Mother&amp;#39;s Day&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here, the new question took an interesting idea (see link in the question) that wasn't specific enough, and added something that validated the old one: an output specification, that was topical to the date.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Somewhat unsuccesfully here. Actually, the first question, though controversial (see comments) stayed open, and the second one, a rather unimaginative repeat which failed to solve the problems with the first one (and added some new issues of its own) stayed closed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/22009/15599&quot;&gt;Pi Calculation Code Golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/22447/15599&quot;&gt;Get as close to pi as you can&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;If a question looks like it can be saved, save it. If it cannot be saved but has good ideas, by all means use them!&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, the following question has some good ideas, but looks like it's going nowhere as there is a new OP and he isn't taking the advice the community is giving in the comments. Once it gets closed, have a go at writing a better one if you want.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/28690/15599&quot;&gt;https://codegolf.stackexchange.com/q/28690/15599&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Make your new version better by adding what was missing, and preferably something new if you can. The voters will be your judge.&lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-05-28T23:55:03.737" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1638" PostTypeId="1" AcceptedAnswerId="1639" CreationDate="2014-05-29T01:55:57.723" Score="15" ViewCount="796" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/28279/3808&quot;&gt;A very popular challenge&lt;/a&gt; was recently deleted due to attracting material that could possibly be considered hate speech or offensive to some people.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We probably need an official policy on how much profanity/vulgarity we want to tolerate. Therefore, how far do we want to go? On the one hand, generic insults like &quot;you're an idiot&quot; are clearly harmless and can be amusing in context, but we really want to avoid hate speech and/or direct insults that may be offensive to some users on the site.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-08-26T13:29:37.773" Title="What should our policy on insults, vulgarity, profanity, and other possibly offensive material be?" Tags="|discussion|policy|" AnswerCount="7" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1639" PostTypeId="2" ParentId="1638" CreationDate="2014-05-29T02:57:48.633" Score="18" Body="&lt;p&gt;No, that's not why I deleted it. That's why a particular answer was &lt;em&gt;flagged&lt;/em&gt;, but one answer with possibly-offensive verbiage was the least of the problems here. I'll let the question speak for itself:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;Shortest, simplest code that prints an unexpected obscenity&lt;/h2&gt;&#xA;&lt;p&gt;I thought this would be fun;&lt;/p&gt;&#xA;&lt;p&gt;Try to come up with some simple code that when run, prints an obscenity or insult to the user in an unusual and unexpected way. When looking at the source code, it should be very difficult to predict that the output is so offensive.&lt;/p&gt;&#xA;&lt;p&gt;Winner will be decided by votes, which should be given based on the following criteria, in order of importance:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Unexpectedness (how well it is hidden in the code)&lt;/li&gt;&#xA;&lt;li&gt;Creativity of Obscenity (i.e. &amp;quot;F!#% You&amp;quot; is not so original)&lt;/li&gt;&#xA;&lt;li&gt;Simplicity&lt;/li&gt;&#xA;&lt;li&gt;Shortness&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The question literally &lt;em&gt;asked&lt;/em&gt; for answers that were offensive and disgusting. And that's why I ignored the flag and went straight for the question: the flagged answer was doing nothing more than providing the asker with &lt;em&gt;exactly&lt;/em&gt; what was requested.&lt;/p&gt;&#xA;&lt;p&gt;I don't think it makes sense to try and draw a line here. &lt;a href=&quot;https://codegolf.stackexchange.com/help/behavior&quot;&gt;There's &lt;em&gt;no&lt;/em&gt; acceptable level of intentional offensiveness&lt;/a&gt;; do you really want this to be the site that's ok with intentionally hurting &lt;em&gt;some&lt;/em&gt; people but not others? There were a number of other answers providing similar results (all attempted to mask them via the ineffectual spoiler markup), and any attempt to moderate them individually would be in effect saying &amp;quot;these people are ok to go after, these others are off-limits&amp;quot;. WTF?&lt;/p&gt;&#xA;&lt;p&gt;As usual, it was the question that was the root of the problem. So the question was removed. Think of it as a challenge... Come up with a puzzle that inspires the generation of witty insults that &lt;em&gt;aren't&lt;/em&gt; required to actually &lt;em&gt;shock the conscience&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="1144" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-05-29T02:57:48.633" CommentCount="16" ContentLicense="CC BY-SA 3.0" />
  <row Id="1640" PostTypeId="2" ParentId="1638" CreationDate="2014-05-29T03:06:03.333" Score="10" Body="&lt;p&gt;Oh, that's where my 300 points went...&lt;br&gt;&#xA;I think the question shouldn't have been deleted, but just modified to ask for creative insults instead of obscenities.&lt;br&gt;&#xA;My answer was barely an insult btw, and was not obscene at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for the policy, I don't really mind either way. If it really bothers people, then we can ban outright profanities (&quot;brainfuck&quot; not included because it's not meant to offend), but as the OP says, I would be against banning generic insults given in context.&lt;/p&gt;&#xA;" OwnerUserId="7416" LastActivityDate="2014-05-29T03:06:03.333" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1641" PostTypeId="2" ParentId="1638" CreationDate="2014-05-29T03:21:16.367" Score="4" Body="&lt;p&gt;In my opinion the deletion of this post was not in the best interest of the site.  Based on the number of votes and answers it received the community was eager to participate.  The person who submitted the question had a great marketing idea.    &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am not exactly sure what the mission statement of the community reads but I would image that encourage people to &lt;em&gt;creatively&lt;/em&gt; address interesting problems is part of it.  The key word there is &lt;strong&gt;creatively&lt;/strong&gt;.  Once you impose limits on the way people behave some of their creativity is lost.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The posting of this question was not malevolent.  None of the answers could be used to hurt or harm anyone in any way.  Quite frankly the heart converting to a middle finger made me laugh and brightened my day.  Keep brightening my day by keeping people creative.  If someone acts in a way that is hateful or harmful come down on it as you will.&lt;/p&gt;&#xA;" OwnerUserId="8501" LastActivityDate="2014-05-29T03:21:16.367" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1642" PostTypeId="2" ParentId="1603" CreationDate="2014-05-29T04:28:13.600" Score="0" Body="&lt;p&gt;I'm the one who posted that question, and I just noticed this meta question now. I'll try to address some of the issues discussed here:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;judging a winner is dependent on unknown data - kind of, but not &lt;strong&gt;really&lt;/strong&gt; - the (60 times) larger data set is fully disclosed, and the test data is randomly selected, so the intention is clearly to solve any case from the (known) large set&lt;/li&gt;&#xA;&lt;li&gt;when and how that data will be disclosed - I don't plan to disclose the test data (that is, the particular chosen subset of the fully disclosed data set)&lt;/li&gt;&#xA;&lt;li&gt;If shortness of code is not the condition then it isn't [code-golf]. What's wrong with [code-challenge]? – I tagged it as both code-golf and code-challenge, as shortness of code is &lt;strong&gt;part of&lt;/strong&gt; the condition. Peter Taylor then removed code-golf and I'm ok with that.&lt;/li&gt;&#xA;&lt;li&gt;the OCR test in the question would be solvable by a program just printing the string that you read - &lt;strong&gt;no&lt;/strong&gt;, it would not. Even if the data set is known, it has 1000 cases and your program has to solve one at a time, independently of each other. Also, if I interpret what you wrote literally, printing out the input is guaranteed to fail since it's not an ASCII digit.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="7416" LastActivityDate="2014-05-29T04:28:13.600" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1643" PostTypeId="1" CreationDate="2014-05-29T10:54:48.577" Score="0" ViewCount="118" Body="&lt;p&gt;I asked a very popular question recently, that asked people to come up with code that you wouldn't expect to print an obscenity or insult.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It was great fun and it got a lot of creative answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now it's been deleted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why would you do that??&#xA;To the mod who deleted it, I've got a lot of code I can send you to run...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/28279/shortest-simplest-code-that-prints-an-unexpected-obscenity&quot;&gt;https://codegolf.stackexchange.com/questions/28279/shortest-simplest-code-that-prints-an-unexpected-obscenity&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="13077" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-05-29T10:54:48.577" Title="Why was this fantastic question deleted?" Tags="|discussion|deleted-questions|" AnswerCount="0" CommentCount="2" ClosedDate="2014-05-29T11:42:40.710" ContentLicense="CC BY-SA 3.0" />
  <row Id="1645" PostTypeId="2" ParentId="1638" CreationDate="2014-05-29T15:41:15.200" Score="6" Body="&lt;p&gt;When we flag an answer as &amp;quot;very low quality&amp;quot;, we are saying that:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This answer has severe formatting or content problems. This answer is &lt;strong&gt;unlikely&lt;/strong&gt; to be salvageable through editing, and &lt;strong&gt;might&lt;/strong&gt; need to be removed.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;(Emphasis mine)&lt;/p&gt;&#xA;&lt;p&gt;I think the same principle should apply to questions. Instead of deleting the post, we should try to edit it to make it fit the site better.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Update:&lt;/strong&gt; I edited the question to change &amp;quot;obscenity&amp;quot; into &amp;quot;insult&amp;quot;, and explicitly stated that no offensive answers should be given. I also edited all answers containing potentially offensive output, replacing the output with:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Warning: The output of this program may be considered too offensive by some, and is therefore removed. If you really want to, you can see it by checking the revision history of this post.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr&gt;&#xA;&lt;p&gt;From the &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/moderator-tools&quot;&gt;moderator tools privilege page&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;When should I delete questions?&lt;/p&gt;&#xA;&lt;p&gt;Closed questions that are of &lt;strong&gt;no lasting value whatsoever&lt;/strong&gt; should be flagged and deleted.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;(Emphasis mine)&lt;/p&gt;&#xA;&lt;p&gt;Do we really think that a post with 101 upvotes and 26 stars have no lasting value whatsoever? Personally, I don't think so. I understand that mods may have a &lt;em&gt;different&lt;/em&gt; standard than we mortals, but is it so different that the opinion of 101 users is negligible?&lt;/p&gt;&#xA;&lt;hr&gt;&#xA;&lt;p&gt;Finally, I would like to draw your attention on the &lt;strong&gt;intention&lt;/strong&gt; of that question (and the answers to that question).&lt;/p&gt;&#xA;&lt;p&gt;In Shog9's post above he said,&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;do you really want this to be the site that's ok with intentionally hurting some people but not others?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I agree that posts that use strong languages to offend people should be deleted. But none of the answers are really there to offend anyone. A piece of interesting code is provided by the answerer, then a &lt;em&gt;factual and objective description&lt;/em&gt; of what the code performs is included. &lt;strong&gt;The posts are not targeted to anyone. No-one is being intentionally hurt.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;There's completely no reason to delete the entire thread.&lt;/p&gt;&#xA;&lt;hr&gt;&#xA;&lt;p&gt;P.S. In the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1643/12205&quot;&gt;duplicate post&lt;/a&gt;, @Chris Jester-Young said&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Your question was popular, for sure, but popularity does not make a post &amp;quot;fantastic&amp;quot; or otherwise a good fit for the site&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;He mentioned &lt;a href=&quot;https://stackoverflow.com/q/84556/13&quot;&gt;programmer cartoons on SO&lt;/a&gt; as an example. However it is worth noting that the linked post was &lt;strong&gt;locked&lt;/strong&gt;, not &lt;strong&gt;deleted&lt;/strong&gt;. &lt;em&gt;Can't we do the same?&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="12205" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-05-31T22:51:38.637" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1646" PostTypeId="2" ParentId="909" CreationDate="2014-05-29T18:50:06.330" Score="9" Body="&lt;p&gt;We had this today with a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/28748/regex-that-matches-any-regex&quot;&gt;regex golf question&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I agree with the previous answer that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regex-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;regex-golf&lt;/a&gt; is superfluous and such questions should be tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I do not agree with the conclusion being that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regex-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;regex-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt; are synonyms. For one thing, there could be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt; challenge that are not code-golf, but since &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt; is the parent tag of the two, that maybe isn't a problem semantically.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, it's a problem practically. At least 3 users (including myself) tried to edit the above question today, by removing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and adding &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regex-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;regex-golf&lt;/a&gt;, because the latter still shows up in the auto-complete list. There is no indication though that this is a synonym for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt;. So while you're editing, you see them both and think &quot;Nice, I tagged this more appropriately&quot; (seeing we can't expect everyone to be aware of this here meta question) - but when you submit, your &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regex-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;regex-golf&lt;/a&gt; tag suddenly vanishes, and the challenge is left without a winning criterion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even if it's just to avoid such edit frenzies in the future, I suggest to &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;remove the synonym relationship&lt;/li&gt;&#xA;&lt;li&gt;untag/retag the two challenges that are still &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regex-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;regex-golf&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;edit the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regex-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;regex-golf&lt;/a&gt; tag wiki to read &quot;This tag is deprecated, use &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt; instead.&quot;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2014-05-29T18:59:11.843" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1647" PostTypeId="1" CreationDate="2014-05-29T20:56:49.003" Score="1" ViewCount="44" Body="&lt;p&gt;I thought it was funny. I assume it broke some rules / community guidelines. Is that right?&lt;/p&gt;&#xA;" OwnerUserId="15956" LastActivityDate="2014-05-29T20:56:49.003" Title="I'm disappointed the creative insult thread seems to have been deleted" Tags="|discussion|" AnswerCount="0" CommentCount="0" ClosedDate="2014-05-29T21:01:40.920" ContentLicense="CC BY-SA 3.0" />
  <row Id="1648" PostTypeId="2" ParentId="1638" CreationDate="2014-05-29T21:39:41.007" Score="6" Body="&lt;p&gt;I am sorry to say, I saw this coming.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To answer the actual question in the title: &lt;strong&gt;&lt;em&gt;What should our policy on insults, vulgarity, profanity, and other possibly offensive material be?&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The answer is, &lt;strong&gt;&lt;em&gt;as has been demonstrated, we don't have the power to decide.&lt;/em&gt;&lt;/strong&gt; I was tempted to cast a protest &quot;close vote&quot; on this very question because of this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All the mods on Code Golf were letting this run, because the community here knows that this was just a bit of harmless fun, and if anyone had got out of hand their answer would have been deleted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But we are on a site run by an organisation that has its own policy of zero tolerance on offensiveness and the finger of law has descended upon us. This is the typical policy of being &quot;cleaner than clean&quot; that large organisations have, because of the disproportionate amount of bad publicity that can result from one little infraction. &lt;strong&gt;The master mod who closed this question was just doing his job.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Where I think he was wrong, is that I think that posters should have been allowed to keep the reputation they accumulated on this question. I'm not saying this because I gained such a large amount of reputation myself (570, which is absurd for such a trivial and silly question) but because it is not the fault of any of the answerers that this has happened. That is the subject of another question: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1649/15599&quot;&gt;If a question is deleted, should posters keep reputation gained?&lt;/a&gt;&lt;/strong&gt;   &lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2014-05-29T22:45:07.397" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1649" PostTypeId="1" CreationDate="2014-05-29T22:38:18.093" Score="5" ViewCount="179" Body="&lt;p&gt;As discussed in  &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1638/15599&quot;&gt;What should our policy on insults, vulgarity, profanity, and other possibly offensive material be?&lt;/a&gt; , a very popular question has just been deleted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Like other users, I noticed a massive drop in my own reputation, and as usual, I didn't know why.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's a few other examples (sorry to use personal examples, but I can't easily access other peoples' deleted answers.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another example of a deleted question, on which I had the only upvoted answer. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/26193/15599&quot;&gt;https://codegolf.stackexchange.com/q/26193/15599&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An example of one of the closed (but not deleted) code-trolling questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/26083/15599&quot;&gt;Help!! How to do square root!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Now, from my own experience, it seems that when a question is &lt;em&gt;closed&lt;/em&gt; answerers keep their reputation. But when a question is &lt;em&gt;deleted&lt;/em&gt; the answerer's reputation simply vanishes without trace.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;So I have the following questions:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;When a question is deleted, is it fair to penalise answerers by removing the reputation gained?&lt;/li&gt;&#xA;&lt;li&gt;Should the reputation simply vanish without trace (as at present), or should there be some kind of record on the user profile of the reputation being gained and lost? (There's a button to display this on my own profile, but I can't find it on other peoples'.)&lt;/li&gt;&#xA;&lt;li&gt;Does deleting a question always automatically lead to reputation disappearing in this way, or are ther ways users can keep their reputation? (I had understood by some of the discussions on code-trolling that there was a way for a question to be deleted and the answerer to keep their reputation.)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="68942" LastEditDate="2021-06-09T05:45:41.197" LastActivityDate="2021-06-09T05:45:41.197" Title="If a question is deleted, should posters keep reputation gained?" Tags="|discussion|feature-request|status-declined|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1650" PostTypeId="2" ParentId="1649" CreationDate="2014-05-29T22:55:22.703" Score="11" Body="&lt;ol&gt;&#xA;&lt;li&gt;Yes. This has been discussed on meta.SE many times over -- it's not a &quot;penalty&quot;; it's simply removing reputation that never should have been there in the first place.&lt;/li&gt;&#xA;&lt;li&gt;You can't see other users' deleted posts by design; they're... well, they're deleted.&lt;/li&gt;&#xA;&lt;li&gt;If your post has a score of +3 or above and it has existed for 2 months or more, you will not lose reputation if it is deleted.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-05-29T22:55:22.703" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1651" PostTypeId="2" ParentId="2140" CreationDate="2014-05-30T00:11:15.733" Score="2" Body="&lt;h2&gt;md5sum Creator&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is my first code golf challenge; critiquing welcome.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to create a new md5sum function. You need to output to STDOUT the &lt;code&gt;input&lt;/code&gt;, a space &lt;strong&gt;or&lt;/strong&gt; a tab character, the md5sum, then a new line. The spec for an md5sum can be found &lt;a href=&quot;http://www.ietf.org/rfc/rfc1321.txt&quot; rel=&quot;nofollow&quot;&gt;here&lt;/a&gt;, thanks to the IETF. For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 c4ca4238a0b923820dcc509a6f75849b&#xA;2 c81e728d9d4c2f636f067f89cc14862c&#xA;... &#xA;//hashes generated on http://www.md5.cz/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may use existing libraries &lt;em&gt;so long as you are not directly calling an md5sum function from within that library&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Output is not case sensitive (&lt;code&gt;A&lt;/code&gt; is the same as &lt;code&gt;a&lt;/code&gt; when it comes to an md5sum).&lt;/li&gt;&#xA;&lt;li&gt;Your program/function will take in a string, and output the md5sum as a string&lt;/li&gt;&#xA;&lt;li&gt;No downloading data from the Internet.&lt;/li&gt;&#xA;&lt;li&gt;Code Golf, so the shortest answer wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;" OwnerUserId="12261" LastEditorUserId="12261" LastEditDate="2014-11-03T22:04:22.490" LastActivityDate="2014-11-03T22:04:22.490" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="1653" PostTypeId="2" ParentId="1611" CreationDate="2014-05-30T04:50:44.973" Score="2" Body="&lt;p&gt;An alternative to taking screenshots of rendered TeX, is to &lt;s&gt;ab&lt;/s&gt;use the Google Charts web interface. To use the same example as Quincunx:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;http://chart.googleapis.com/chart?cht=tx&amp;amp;chl=\int_0^\infty x^{\frac12}dx&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;cht=tx&lt;/code&gt; parameter specifies to render as TeX, the &lt;code&gt;chl&lt;/code&gt; parameter is the input. The dialect is slightly different; note, for example, the enclosing braces around &lt;code&gt;{\frac12}&lt;/code&gt;. Although the above URL works fine, SE won't recognize it as a valid link unless it is URL encoded. You can either make a script for this, or use an &lt;a href=&quot;http://www.url-encode-decode.com/urlencode&quot; rel=&quot;nofollow&quot;&gt;online tool&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then insert:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;![][1]&#xA;&#xA;[1]: http://chart.googleapis.com/chart?cht=tx&amp;amp;chl=%5Cint_0%5E%5Cinfty+x%5E%7B%5Cfrac12%7Ddx&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which produces:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;http://chart.googleapis.com/chart?cht=tx&amp;amp;chl=%5Cint_0%5E%5Cinfty+x%5E%7B%5Cfrac12%7Ddx&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Admittedly, fairly ugly. This can be prettied up by subscripting the intervals:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;\int_{_0}^{_\infty}x^{\frac12}dx&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;http://chart.googleapis.com/chart?cht=tx&amp;amp;chl=%5Cint_%7B_0%7D%5E%7B_%5Cinfty%7Dx%5E%7B%5Cfrac12%7Ddx&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or repositioning them with &lt;code&gt;\limit&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;\int\limit_{_0}^{_\infty}x^{\frac12}dx&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;http://chart.googleapis.com/chart?cht=tx&amp;amp;chl=%5Cint%5Climit_%7B_0%7D%5E%7B_%5Cinfty%7Dx%5E%7B%5Cfrac12%7Ddx&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You get the idea. It's not an ideal solution, but I find it preferable to pre-rendering, taking a screenshot, cropping, exporting, and then uploading. The output also &lt;img src=&quot;http://chart.googleapis.com/chart?cht=tx&amp;amp;chl=%5Cint_%7B_0%7D%5E%7B_%5Cinfty%7Dx%5E%7B%5Cfrac12%7Ddx&quot; alt=&quot;&quot;&gt; inlines reasonably.&lt;/p&gt;&#xA;" OwnerUserId="4098" LastEditorUserId="4098" LastEditDate="2014-06-02T09:49:40.643" LastActivityDate="2014-06-02T09:49:40.643" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1654" PostTypeId="1" CreationDate="2014-05-30T15:31:44.607" Score="12" ViewCount="530" Body="&lt;p&gt;Sometimes when golfing in PHP, one uses tricks as reading/pushing to an inexistent variable, or using deprecated functions such as &lt;code&gt;split()&lt;/code&gt;, but those things outputs Warnings and Notices, which by themselves are not really errors and don't change how the code works.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there any policy regarding the output of these type of errors? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should I add provisions to remove or hide the warnings in my code even if the questions doesn't ask it as a requirement or should I consider that the PHP configuration has &lt;code&gt;error_reporting = 0&lt;/code&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have seen C answers that output compiler warnings (the closest equivalent I can think now)&lt;/p&gt;&#xA;" OwnerUserId="13870" LastEditorUserId="9275" LastEditDate="2014-05-30T16:13:34.773" LastActivityDate="2015-11-21T09:45:37.343" Title="PHP and warnings" Tags="|discussion|php|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1655" PostTypeId="2" ParentId="1654" CreationDate="2014-05-30T16:34:57.977" Score="10" Body="&lt;p&gt;There currently is no policy about that, but this is my opinion:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Does the question explicitly disallow code that can lead to a Warning/Notice? Then it is disallowed.&lt;/li&gt;&#xA;&lt;li&gt;Does the question say nothing about such code? Then it would say it is allowed (and you can assume that &lt;code&gt;error_reporting = 0&lt;/code&gt;), because none of the rules say that it is disallowed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="9275" LastActivityDate="2014-05-30T16:34:57.977" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1658" PostTypeId="2" ParentId="1061" CreationDate="2014-05-31T15:47:21.783" Score="109" Body="&lt;h1&gt;Using a different name for something that's prohibited&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The title is not very clear, I know, but this is what it means: if a specific function is prohibited, someone can use a language where another term than &quot;function&quot; is used (for example &quot;subroutine&quot;), and then that user can claim that their submission is valid because they aren't using a function but a subroutine.&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="344" LastEditDate="2014-06-08T21:40:24.380" LastActivityDate="2014-06-08T21:40:24.380" CommentCount="7" CommunityOwnedDate="2014-05-31T15:47:21.783" ContentLicense="CC BY-SA 3.0" />
  <row Id="1659" PostTypeId="1" CreationDate="2014-05-31T18:13:17.893" Score="18" ViewCount="702" Body="&lt;p&gt;Some time after the Great &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; Purge, a huge wave of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; questions emerged.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Are some of the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; questions too broad and hence facing similar issues to those of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Bad Underhanded question (too broad?)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;An example of an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; question which I found too broad was the now-deleted one called &quot;Print an unexpected obscenity&quot;. The task was to write a program to &lt;strong&gt;print &lt;em&gt;any insult&lt;/em&gt;&lt;/strong&gt;, provided that the insult-printing is sufficiently obfuscated and undetectable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Is this particular question too broad, and too much like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;?&lt;/strong&gt; It attracted a number of answers &lt;em&gt;whose output was well-documented&lt;/em&gt;. For example, the output of this much-upvoted Bash/otherUnixShell solution is easy to predict, and it isn't very subtle. (I'm aware that I'm not really approaching this with a sense of humour here. I did find it funny though.)&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;You think you deserve an entry in the manual of manliness? Let's see:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;man you&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;No manual entry for you!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Clearly, this isn't very &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;TL;DR: Is it too broad to ask for any insult? And how unexpected does it need to be to qualify?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Better Underhanded question&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/28786/write-a-program-that-makes-2-2-5&quot;&gt;Write a program that makes 2 + 2 = 5&lt;/a&gt; was a very fun question. I think it is objective enough. The task is to write a program which appears to calculate 2+2 (not too broad; asking someone to make a specific calculation is about as specific as it gets), but misuse some language feature to make it output 5. My answer is &lt;a href=&quot;https://codegolf.stackexchange.com/a/28888/16402&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;TL;DR: Some &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; questions can be as objective as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; gets. Scoring can't be done with any tag other than &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; AFAIK as it is a contest for creativity.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The only &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; question doesn't meet the criteria for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt;.&#xA;&lt;hr /&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;TL;DR&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Some of the underhanded questions are too broad and too much like code-trolling.&lt;/strong&gt; To an extent, underhanded is the new code-trolling. I wouldn't kill all of it with fire though. Some of the questions are good and objective. But others are too broad and hence too much like code-trolling.&lt;/p&gt;&#xA;" OwnerDisplayName="user16402" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-06-07T20:05:33.020" Title="Has underhanded been getting too much like code-trolling?" Tags="|discussion|code-trolling|underhanded|popularity-contest|" AnswerCount="2" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1661" PostTypeId="1" AcceptedAnswerId="1669" CreationDate="2014-05-31T18:41:46.603" Score="15" ViewCount="1367" Body="&lt;h1&gt;What exactly is the difference between code-bowling and code-trolling?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In February 2011, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/428/sort-a-list-of-numbers&quot;&gt;our first code-bowling question turned up&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Over two years ago, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/480/appropriate-for-code-bowling&quot;&gt;this meta post&lt;/a&gt; turned up. It asked whether &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt;, a genre then occasionally seen on Stack Overflow, was suitable for the site. Two years on, &lt;strong&gt;no objective winning criterion has been found for code bowling, and few if any good questions or answers have been seen,&lt;/strong&gt; although only 12 have been posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A comment by m.buettner on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1656/16402&quot;&gt;this sandbox post&lt;/a&gt; explains the issues clearly:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I'm afraid this has the same problems as pretty much any code-bowling question. You can basically make any program infinitely long by adding abstraction layer over abstraction layer or adding useless detours in the code. So the winner boils down to who has the most endurance or writes the first valid code-generator and which point you'll have a submission with infinite score. Most people try to close this loophole by saying &quot;no bit of code must be useless&quot;, but depending on how you interpret it, it either doesn't close the loophole or doesn't justify anything beyond &lt;code&gt;print &quot;Hello World&quot;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Issues with code-bowling&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Program can theoretically be infinitely long, see &lt;a href=&quot;https://codegolf.stackexchange.com/a/28731/16402&quot;&gt;this answer&lt;/a&gt; or some of the others on that question. Since &lt;code&gt;infinity == infinity&lt;/code&gt;, all answers can be the same length and &lt;strong&gt;there is no objective winning criterion&lt;/strong&gt; and none can be found - even &quot;don't use any function twice&quot; still leaves too much room.&lt;/li&gt;&#xA;&lt;li&gt;Often far too broad &lt;a href=&quot;https://codegolf.stackexchange.com/questions/28728/write-a-vim-command-that-reads-as-english-text&quot;&gt;like this question to compose any long vim command&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Similar to code-trolling.&lt;/li&gt;&#xA;&lt;li&gt;We can't have competitions without rules. The first code-bowling question explicitly stated:&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;There are no real rules. As long as the program functions, have [a go] at it!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;The Solution&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;My opinion is that &lt;strong&gt;we must kill code-bowling. If code-trolling is bad, there is no justification that I can see to keep code-bowling.&lt;/strong&gt; It would go against our policies of &quot;objective winning criterion&quot; to keep code-bowling. We would be contradicting ourselves if we killed code-trolling but not code-bowling.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;In 2011-2012, when code-bowling was born, we effectively gave it a trial period to see if any good questions would turn up. No good questions which meet the site's rules have turned up. Therefore, code-bowling must suffer the fate of code-trolling.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user16402" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2014-06-12T17:09:02.733" Title="Should we kill code-bowling?" Tags="|discussion|code-trolling|code-bowling|" AnswerCount="4" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1662" PostTypeId="2" ParentId="1661" CreationDate="2014-05-31T23:09:24.987" Score="9" Body="&lt;p&gt;&lt;strong&gt;TL;DR:&lt;/strong&gt; I don't like the existing code bowling questions, but I'm not sure there is no hope for it. I'm &lt;em&gt;not&lt;/em&gt; suggesting a course of action in this post, but just laying out some arguments for either side, so people can form their own (informed) opinions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't agree with the parallels you're drawing between &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt;. There are a lot of differences between the two. In particular writing long and unmaintainable code was just one way to approach a code trolling challenge. But code trolling wasn't &lt;em&gt;about&lt;/em&gt; that. Code trolling was a lot more general (which was one of its main problems). Hence, I don't think you can form a valid argument here that is based on comparison with code trolling.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I do agree with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; being problematic though (well, of course I do, your post quotes my own comment :D). However, I have to disagree a bit with you here as well. In particular, I don't think code bowling is lacking an objective winning criterion. Because &quot;largest code size in bytes/characters&quot; is equally objective as any code golf. The problem is coming up with loophole-free rules that can be enforced objectively.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not saying it's impossible, but it's very hard. Statements like &quot;no line must be useless&quot; are not objectively enforcible. Not reusing functions is objective, but it leaves loopholes like just putting in an infinitely long literal or variable name. And I'm not even sure it would be a useful rule if it worked. You have to work really hard to get that down, and for the challenge to be fun as well, it should actually be &lt;em&gt;hard&lt;/em&gt; to write a valid submission longer than 100 characters or so, because I don't want to slave away at writing 10k lines of code just to be competitive in the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Okay, so what I did was the same I did for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;: I looked at every single &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; question that has been asked. I left out the two ones that are closed anyway, so it's down to 10:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/428/sort-a-list-of-numbers&quot;&gt;The very first code bowling&lt;/a&gt; is in fact really just code trolling with the restriction that the code has to work. This may have been why you drew the parallel between the two. It obviously lacks both objective rules and objective winning criterion.&lt;/li&gt;&#xA;&lt;li&gt;There are a few that are tagged both &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; which basically amounts to code trolling as well: &lt;a href=&quot;https://codegolf.stackexchange.com/q/23651/8478&quot;&gt;this&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/16788/creating-a-quine-in-as-many-characters-as-possible&quot;&gt;this&lt;/a&gt; as well as one of the closed ones.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/28728/write-a-vim-command-that-reads-as-english-text&quot;&gt;There&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/22921/longest-code-to-add-two-numbers&quot;&gt;are&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/19225/largest-program-to-reverse-a-single-line-from-stdin-with-no-redundant-code&quot;&gt;five&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/18506/write-the-longest-program-that-prints-the-date-of-tomorrow&quot;&gt;which&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4838/most-complex-hello-world-program-you-can-justify&quot;&gt;basically&lt;/a&gt; end in ridiculous quasi-infinite size submissions. They either ignore the fact that something like that would be possible, or tried to rule it out with things like &quot;no redundant code&quot; which you can always work around. Or if you start arguing that something is redundant you can very quickly extend the argument &lt;a href=&quot;https://codegolf.stackexchange.com/a/6886/8478&quot;&gt;to any detour at all being redundant&lt;/a&gt;, which defeats the point as well.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/10760/build-a-program-with-one-simple-goto&quot;&gt;There is this question&lt;/a&gt; where I can't gauge if the challenge itself is actually impossible or - if not - if it would be trivial to extend to an infinitely long submission. But it's more of a code challenge anyway then actual code bowling, because the scoring is quite elaborate and just happens to incentivise convoluted code.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/10532/write-ascii-art-obfuscated-code-read-as-and-resulting-in-dftba&quot;&gt;There is this question&lt;/a&gt; which avoids the problem by putting a hard limit on the code size. I think this is actually a very decent idea, and probably the only half-reasonable instance of code bowling so far. Unfortunately, this particular question has another flaw, which is the not objectively measurable readability of the ASCII art. But that's beside the point here.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In general, I have to say, code bowling has been pretty crappy so far. But as opposed to code trolling, it doesn't seem to be something inherent to code bowling as a scoring mechanism. That last question shows (to me, at least) that with a bit of careful thought, a few good code bowling questions might be possible, and people just haven't been trying hard enough. At the same time there is an appreciable probability, that it's just too damn hard to come up with decent rules for such a question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think most folks writing a code bowling challenge just think &quot;oh, let them write TONS of code, that would be fun, yay code bowling.&quot; Maybe we could change that vibe by rewriting the tag summary to something like &quot;The goal of code bowling is to maximise the size of your code length subject to some constraint.&quot; And people would also have to make sure that the constraint has to be very rigid, because I don't think anyone wants to write (and much less &lt;em&gt;read&lt;/em&gt;) those thousands of characters long submissions and just stop at an arbitrary point because they can't be bothered any more. You should have to work as hard for &lt;em&gt;each single character&lt;/em&gt; in code bowling as you do in code golf. If you can come up with rules like that, I'm all for code bowling. As long as you don't I won't really grow fond of it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With that in mind, I don't really know what course of action to suggest here. In two years, only one question managed to get anywhere near being a good code bowling challenge (in my opinion). So it might well be possible, we just need to try harder and keep looking. At the same time, I'm not really sure we &lt;em&gt;will&lt;/em&gt; find the holy grail of code bowling any time soon, so maybe this concept doesn't warrant it's own tag (which just seems to attract badly thought-through challenges) and those new concepts should be given their own chance as a simple &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;. I don't think we need to be as harsh with this as with code trolling, but I wouldn't mind cleaning up most of the existing code bowling either, because currently it's not really doing any good.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So as I said at the beginning, I'm not actually voicing a clear opinion on what to do here, I just wanted to collect the above information here, so people can draw their own (&lt;em&gt;informed&lt;/em&gt;) conclusions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Long-ish PS: After thinking about it for a while, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/28238/print-the-golden-ratio&quot;&gt;my own recent challenge&lt;/a&gt; is a bit of a code bowling (disguised as a code challenge). I asked people to print as many digits of the golden ratio on a strict character budget per digit. This is not much different from asking for the longest code that prints a sufficient number of digits, which depends on the code length. I had a &lt;strong&gt;&lt;em&gt;really&lt;/em&gt;&lt;/strong&gt; hard time closing loopholes to prevent infinite scores, which made the rules ridiculously complicated, and I wouldn't want every code bowling challenge to have to be that convoluted. However, I think I did manage to create a situation where - very soon after they started - participants (except the accepted answer) actually had to work hard for every single character, just like you do in code golf. But as you can see, the accepted answer, even though not scoring infinity, side-stepped all that and did find a loophole in the end. So while I wasn't aware of it, I've also fallen victim to the perils of posing a code bowling type question.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2014-05-31T23:09:24.987" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1663" PostTypeId="2" ParentId="2140" CreationDate="2014-06-01T08:49:04.777" Score="1" Body="&lt;h2&gt;Array Calculator&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Implement a 4-function calculator &lt;code&gt;+-*/&lt;/code&gt; that operates on space-delimited arrays of floating-point numbers.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3 4+5 6 7 8&#xA;6.0 8.0 10.0 12.0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It should evaluate the functions right-to-left, in the manner of APL. In other words, among the functions there is no precedence of any kind.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 2+3 4*5 6+7 8&#xA;=&amp;gt;&#xA;1 2+3 4*12 14&#xA;=&amp;gt;&#xA;1 2+36 56&#xA;=&amp;gt;&#xA;37.0 58.0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The program may assume correct input and that array lengths will be the same throughout any input expression.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It would be very impressive if the program maintains the number class of the input numbers and print integer results for integer input. But this is not necessary. It is acceptable to fold all numbers to floating-point. The program may assume a maximum array length of 10.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Questions&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Should it be more complicated? Or is it okay to keep it simple?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For a slight complication, we could add the power operator &lt;code&gt;^&lt;/code&gt; which performs the function to its left upon the argument to &lt;em&gt;its&lt;/em&gt; left as many times as the right argument specifies. The twist is that it combines with any of the functions, &lt;code&gt;+^&lt;/code&gt; &lt;code&gt;-^&lt;/code&gt; &lt;code&gt;*^&lt;/code&gt; &lt;code&gt;/^&lt;/code&gt; and with itself, eg. &lt;code&gt;+^^&lt;/code&gt; == &lt;code&gt;*^&lt;/code&gt; == &lt;code&gt;pow()&lt;/code&gt;, &lt;code&gt;+^&lt;/code&gt; == &lt;code&gt;*&lt;/code&gt;. &lt;code&gt;/^&lt;/code&gt; would be identity of the left argument. &lt;code&gt;-^&lt;/code&gt; would oscillate between zero and the left argument.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="8478" LastEditDate="2014-06-01T09:20:48.940" LastActivityDate="2014-06-01T09:20:48.940" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1664" PostTypeId="2" ParentId="1638" CreationDate="2014-06-01T18:33:28.713" Score="4" Body="&lt;p&gt;The name of the programming language &quot;Brainfuck&quot; contains the obscene word &quot;fuck&quot;, which has a &lt;a href=&quot;https://en.wiktionary.org/wiki/fuck&quot; rel=&quot;nofollow&quot;&gt;dictionary definition&lt;/a&gt; that is too vulgar to quote here. People who program in BF are using this as an excuse to post the obscene word on this website. I don't like this, but I understand the need to identify BF by its name.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The deleted question asked for programs that print an unexpected obscenity. I had more interest in the programming techniques than in the insults, but the question would have continued to accumulate more answers with all flavors of obscene language. Therefore, the best option was to delete the question to prevent any answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;codegolf.stackexchange.com should not gather obscene language that would scare away me or other contributors.&lt;/p&gt;&#xA;" OwnerUserId="4065" LastActivityDate="2014-06-01T18:33:28.713" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1666" PostTypeId="1" CreationDate="2014-06-01T21:51:00.827" Score="0" ViewCount="81" Body="&lt;p&gt;PCG &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1514/we-need-to-take-an-official-stance-on-code-trolling&quot;&gt;no longer permits code-trolling&lt;/a&gt;, but there is another category called &lt;a href=&quot;https://codegolf.stackexchange.com/tags/underhanded/info&quot;&gt;underhanded&lt;/a&gt;, of which the tag wiki currently reads:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;An underhanded challenge is a challenge to write a program that looks as if it is doing one thing, but does something else. For example, a program that outputs the digits of pi up until the 100th decimal place, when it does something else, might be underhanded if it conceals its doing so.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Some discussion was raised at &lt;a href=&quot;https://codegolf.stackexchange.com/q/29959/4897&quot;&gt;my post on a buggy hello world&lt;/a&gt; as to whether this should be closed/downvoted for being a code-trolling question.  What is the difference between underhanded and code-trolling?&lt;/p&gt;&#xA;" OwnerUserId="4897" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-06-01T22:00:38.503" Title="What is the difference between underhanded and code-trolling?" Tags="|discussion|code-trolling|underhanded|" AnswerCount="0" CommentCount="1" ClosedDate="2014-06-01T21:51:51.570" ContentLicense="CC BY-SA 3.0" />
  <row Id="1668" PostTypeId="2" ParentId="2140" CreationDate="2014-06-02T00:00:21.293" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Code Looking For 0x6C, 0x6F, 0x76, and 0x65 In All the Wrong Places&lt;/h1&gt;&#xA;&lt;p&gt;Write the shortest code that finds all instances of love&amp;quot; on the system. For this challenge love shall be defined as the bytes 0x6C, 0x6F, 0x76, and 0x65 in sequential order.  It should look for love within files, in memory, and in file names.  The code should run on Ubuntu to be tested.  Assume you have whatever access you need to perform these operations.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Winning Criteria&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The code will be run under a Ubuntu 12.04 instance that is hosted on a dual boot Windows 8.1 machine.  There will be 1 file on each of the hard drives named love.  The grub loader has a configuration called love.  A program will be running in the background.  If you find all the instances and have the shortest code.  You will win.  The contest will close XX/XX/YYYY.&lt;/p&gt;&#xA;" OwnerUserId="8501" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-06-23T15:46:48.753" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1669" PostTypeId="2" ParentId="1661" CreationDate="2014-06-02T04:13:41.460" Score="24" Body="&lt;p&gt;How about requiring that code-bowling questions work with strict restrictions that inherently limit the possible total? Essentially, the analogy would be to the gutters in actual bowling.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance, write the longest Hello World program... that doesn't reuse the same character twice. Or that never uses the same function/operation/structure twice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Basically, I'm asserting that the problem is that &quot;code-bowling&quot; isn't well-defined to begin with, and a more proper definition will produce more interesting challenges. Removing the concept entirely will just limit the potential for interesting questions.&lt;/p&gt;&#xA;" OwnerUserId="21439" LastActivityDate="2014-06-02T04:13:41.460" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="1670" PostTypeId="2" ParentId="1654" CreationDate="2014-06-02T10:08:02.310" Score="13" Body="&lt;h2&gt;Assume Default Settings&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I have been informed with &lt;a href=&quot;https://codegolf.stackexchange.com/posts/comments/138534?noredirect=1&quot;&gt;some frequency&lt;/a&gt; that my PHP solutions &quot;don't work&quot;, typically due to an abundance of &lt;code&gt;E_NOTICE&lt;/code&gt; messages. I suggest the following settings be assumed by default:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;short_open_tag = On&#xA;precision = 14&#xA;error_reporting = E_ALL &amp;amp; ~E_NOTICE &amp;amp; ~E_STRICT &amp;amp; ~E_DEPRECATED&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;These are all default values, as they would be without a configuration file. For example, the following should be valid, even in challenges where producing any errors is prohibited:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;?for(;$i++&amp;lt;10;);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;despite generating an &lt;code&gt;E_NOTICE&lt;/code&gt;, due to accessing a previously undefined variable. This message is by default not displayed. On a similar note, suppressing errors with &lt;code&gt;@&lt;/code&gt; should also be allowed in these cases.&lt;/p&gt;&#xA;" OwnerUserId="4098" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2015-11-21T09:45:37.343" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1672" PostTypeId="2" ParentId="1470" CreationDate="2014-06-03T01:07:09.400" Score="0" Body="&lt;p&gt;I might want to use the main site to ask questions like, &quot;Why do some method calls in Ruby need parentheses?&quot;, or, &quot;Which languages win most often at code golf?&quot; These would be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would probably use meta for questions about the rules for code challenges. Questions like, &quot;My program doesn't allow \0 in strings,&quot; or, &quot;How to count invalid characters in UTF-8?&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Putting &quot;tips for language X&quot; in community wiki seems useful. For example, in &lt;a href=&quot;https://codegolf.stackexchange.com/q/363/4065&quot;&gt;tips for golfing in Ruby&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I expanded the &lt;a href=&quot;https://codegolf.stackexchange.com/a/9268/4065&quot;&gt;tip about Kernel#p&lt;/a&gt; though I am not the person who created the answer.&lt;/li&gt;&#xA;&lt;li&gt;I edited the &lt;a href=&quot;https://codegolf.stackexchange.com/a/5050/4065&quot;&gt;tip about $_&lt;/a&gt; for the difference between Ruby 1.8 and 1.9.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I am not sure whether other questions in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; (that are not &quot;tips for language X&quot;) should be community wiki. If &quot;tips for language X&quot; was no longer community wiki, I would stop editing answers and start adding comments.&lt;/p&gt;&#xA;" OwnerUserId="4065" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2014-06-03T01:07:09.400" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1673" PostTypeId="1" CreationDate="2014-06-03T15:34:04.150" Score="0" ViewCount="155" Body="&lt;p&gt;In case you're wondering what a king of the hill question is: &lt;a href=&quot;https://codegolf.stackexchange.com/tags/king-of-the-hill/info&quot;&gt;https://codegolf.stackexchange.com/tags/king-of-the-hill/info&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question: If you see an old interesting question, that you think would be even more interesting as a king-of-the-hill would it be off topic to repost it?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A specific example: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/5496/play-connect-4&quot;&gt;Play Connect 4!&lt;/a&gt; I think this would be really interesting as king of the hill.&lt;/p&gt;&#xA;" OwnerUserId="9516" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-06-03T16:29:09.117" Title="Making king-of-the-hill out of old question" Tags="|discussion|" AnswerCount="1" CommentCount="4" ClosedDate="2014-06-04T15:27:42.950" ContentLicense="CC BY-SA 3.0" />
  <row Id="1675" PostTypeId="2" ParentId="1673" CreationDate="2014-06-03T16:29:09.117" Score="5" Body="&lt;p&gt;The answers to your question is &quot;It depends.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;It depends on your new scoring mechanism.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The scoring mechanism for King of the Hill challenges is &lt;em&gt;not&lt;/em&gt; implied.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you convert a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenge where the winner is the submission with the shortest code, then you have not only misunderstood the purpose of the King of the Hill tag, but you have not changed the challenge at all. I would vote to close it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you convert a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenge where the winner is the submission with the most wins after some series of random or round-robin pairings or free-for-alls, then you have completely transformed the type of answers you are likely to get. I would not vote to close it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;It depends on who you ask.&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The answer is subjective. Doorknob quoted a commonly accepted rule that attempts to remove some of the subjectivity:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Could answers from the previous question be reposted in your new one?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;You pass that test. But I don't like trying to hammer subjectivity out of a community vote that is based entirely on subjective reasons. Here's my rule:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Does the question add value to the site?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In the specific case of a Connect 4 KotH challenge, I feel that challenging users to build bots that aim for optimal play rather than shortest code adds significant value to the site, and so I would not vote to close.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastActivityDate="2014-06-03T16:29:09.117" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1677" PostTypeId="2" ParentId="1288" CreationDate="2014-06-03T17:18:50.963" Score="6" Body="&lt;h1&gt;Take over the program!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'm not sure how this would be implemented on a StackExchange site, but here's my idea:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The asker provides a snippet of code.&lt;/li&gt;&#xA;&lt;li&gt;The asker provides &lt;em&gt;two or more programs which could start with this snippet&lt;/em&gt;. That is to say, they give multiple tasks of similar difficulty.&lt;/li&gt;&#xA;&lt;li&gt;Each answerer selects one of the tasks.&lt;/li&gt;&#xA;&lt;li&gt;To compete, you post a snippet of code under a certain length limit.&lt;/li&gt;&#xA;&lt;li&gt;Upon receiving a vote score of +2, &lt;em&gt;this snippet is added to the main program&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Your mission is to ensure that the program fulfils the task that you have chosen. Competitors who select a different task will try to hijack the program to make it do their task.&lt;/li&gt;&#xA;&lt;li&gt;The winner is the person who puts in a code snippet that completes the program to match one of the possible tasks.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The question is carried out in a single language. (Though we could have multi-language &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt; variants - for example, a program in C++ could do something different from the same source code in Brainfuck. But that's just a random idea.)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Restrictions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No comments in source code. (Otherwise, you could comment out an opponent's code)&lt;/li&gt;&#xA;&lt;li&gt;Two supporters of the same task cannot post consecutive answers. The second answer can be ignored.&lt;/li&gt;&#xA;&lt;li&gt;The program needn't fulfil that task only. The winner is the person to post an answer the addition of which makes the whole program valid code which carries out one of the tasks.&lt;/li&gt;&#xA;&lt;li&gt;No two snippets may be identical.&lt;/li&gt;&#xA;&lt;li&gt;Additional restrictions will probably be needed&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user16402" LastActivityDate="2014-06-03T17:18:50.963" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1678" PostTypeId="2" ParentId="1661" CreationDate="2014-06-03T21:13:19.060" Score="4" Body="&lt;p&gt;For me, the difference is this: &lt;strong&gt;&lt;em&gt;Code-Trolling is like watching a clown slip on a banana skin and fall over:&lt;/em&gt;&lt;/strong&gt; amusing once, but not after you've seen it a thousand times. &lt;strong&gt;&lt;em&gt;Code-Bowling is like listening to someone reading the phone book:&lt;/em&gt;&lt;/strong&gt; bloated and dull for everyone.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code-Bowling answers do at least work. Nominally, Code-Trolling answers are supposed to work too, but there were plenty that didn't work (including some of my own) that got upvoted, in some cases heavily.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, Code-Bowling is actually a less objective winning criterion than the Popularity-Contest criterion that was slapped on Code-Trolling. It is not at all clear what is a legitimate way to bloat code and what isn't.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;So, question for question, I like Code-Bowling less than Code-Trolling. But I don't see that it's causing the same level of problem.&lt;/em&gt;&lt;/strong&gt; There have been 12 questions asked, ever (the first in early 2011) of which 6 were asked in 2014 (current rate just over one a month.)  In contrast, there were 23 Code-Trolling questions in under 141 days according to the references below. That's more than one a week! Code-trolling was a plague, fuelled by people (some new to PPCG) who'd never seen a clown slip on a banana skin before.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;So, much as I dislike Code-Bowling, I wouldn't move fast to eliminate it if others are enjoying it.&lt;/em&gt;&lt;/strong&gt; I don't believe in restricting others' freedom and I can just ignore these questions. It isn't whipping up the vigilante close-voting that was occuring with Code-Trolling before the community decided as a whole that it didn't want it. &lt;strong&gt;&lt;em&gt;So, if you ask me to vote I will abstain. But if you force me to vote I will say kill it!&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;References (for statistics)&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1534/15599&quot;&gt;Which code trolling questions are worth keeping?&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1594/15599&quot;&gt;Code trolling is dead. Now what?&lt;/a&gt;  &lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2014-06-04T13:03:11.503" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1679" PostTypeId="2" ParentId="1288" CreationDate="2014-06-04T00:44:32.130" Score="-2" Body="&lt;h1&gt;Multi-Language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Questions are posed like standard code-golf or popularity-contest questions, but the answers must be written in at least two (possibly more, if specified in the question) languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The answers must also be &lt;em&gt;executed&lt;/em&gt; using multiple languages per-execution, but does not have to be contained in a single source file. Languages cannot be used &lt;em&gt;only&lt;/em&gt; to execute other languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In code-golf, answers are scored by taking the average of the lengths of the two language sources and adding the average difference between the sources. (rounded up)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note that the second answer is disqualified, as Batch simply executes a python file&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Question:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Print &lt;code&gt;Hello, world. I am banana!&lt;/code&gt; with as low a score as possible, and using at least two languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Answer:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Python(0) + Batch(61) = 92 (30.5+61)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Batch&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;echo print('Hello, world. I am banana^!')&amp;gt;&amp;gt;&quot;x.py&quot;&#xA;python x.py&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Answer:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Python(35) + Batch(11) = 47 (23+24)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Batch&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;python x.py&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Python&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;print('Hello, world. I am banana!')&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="18730" LastEditorUserId="18730" LastEditDate="2014-06-04T01:01:05.300" LastActivityDate="2014-06-04T01:01:05.300" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1681" PostTypeId="2" ParentId="2140" CreationDate="2014-06-04T15:46:50.683" Score="3" Body="&lt;p&gt;Author note: I was thinking about new genres today, and I had an idea. What if there could be a challenge that &lt;em&gt;encourages&lt;/em&gt; people to write &lt;em&gt;good&lt;/em&gt; code, instead of the code-golf gibberish we all know? Here's a challenge that attempts to do that. (This could even possibly be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/new-genre&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;new-genre&amp;#39;&quot; rel=&quot;tag&quot;&gt;new-genre&lt;/a&gt;, which would be great because it would bring in a greater high quality question volume to the site, but I'm terrible at coming up with names. Feel free to suggest something in the comments.)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Build your own image editor&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/application-building&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;application-building&amp;#39;&quot; rel=&quot;tag&quot;&gt;application-building&lt;/a&gt; (?)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For this challenge, you will create the best GUI image editor that can perform the most tasks that you possibly can... from scratch.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Tasks and scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here are the features / tasks used to score your program. Each task is worth a certain amount of points, which is specified in brackets before the task description. For convenience, each task will also be prefixed by an ID string so that you can refer to them when describing your program.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;[1 A] Brush tool: Simple, click and drag the mouse to draw freestyle doodles. Must draw a contiguous path.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;[1 A1] Ability to change the brush size.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;{TODO: etc., add more}&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Requirements&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your editor must conform to the following requirements:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Must accept input via the mouse. Tools (brush, flood fill, etc.) can be switched and configured with keyboard shortcuts, by clicking icons with the mouse, through a menu, or however you would like.&lt;/li&gt;&#xA;&lt;li&gt;You may not use a single built-in function to accomplish one or more of the tasks. For example, if your language has a built-in image flood fill function, you may not use it and must build your flood fill from scratch.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Final score and voting&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is the syntax you should use to describe your score in your answer:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# {language}, {your score} score&#xA;&amp;lt;sup&amp;gt;(features implemented: {A, A1, ...})&amp;lt;/sup&amp;gt;&#xA;&#xA;    {your code here}&#xA;&#xA;{description, comments, other notes, etc. here}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The amount of votes your post has (upvotes minus downvotes) will be multiplied by {TODO: figure out a good number} and added to your score. (Do not add this to the score in your post, since votes change constantly; I will add them manually.) &lt;strong&gt;Voters, please vote according to the following criteria:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;elegance and readability of the source code&lt;/li&gt;&#xA;&lt;li&gt;ease of use of the image editor and how powerful it is&lt;/li&gt;&#xA;&lt;li&gt;remember to sort by &quot;active&quot; so that you're voting for new answers too, and not just the top voted ones!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-06-04T15:46:50.683" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1682" PostTypeId="2" ParentId="2140" CreationDate="2014-06-04T15:51:42.780" Score="7" Body="&lt;h1&gt;Objection! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;In the near future, the legal world is crumbling. If a case lasts longer than three days, the defendant is assumed to be guilty. Prosecutors create false evidence to get their guilty verdict or flawless record. Defense attorneys are forced to retaliate, claiming that the ends justify the means. In the trials and tribulations of the courtrooms of tomorrow, how will we ever get justice for all? This truly is the dark age of the law.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Luckily, the world has you. Just 11 short years ago, you were a ragtag rookie lawyer in a world of big fish, but you had potential and it showed. You always trusted your client, no matter how bad things looked. You were able to cut through the deception and reach the truth. When times got hard, you forced your biggest smiles. Of course, it was only 3 years before a little misunderstanding cost you your badge, but that's all cleared up now. You're back, ready to protect those no one else will and make miracles happen.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Except... You're pretty sick. For some reason you can't quite remember, you've got a crippling fear of cold medicine. Clearly, you're in no position to stand at the bench. If you can't be there to clear your client's name, you'll have to write a program to do it for you!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;For this challenge, you'll be writing a program that can take your place in a cross-examination. There are three different things you need to keep track of: Facts, Evidence, and Statements.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Facts&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are 26 Facts, named A, B, C... Y, Z. Usually, only a small number of them will be relevant, but you must be able to handle all of them if necessary. Contrary to their name, a Fact can be either True or False.&#xA;&amp;nbsp;&#xA;You are never told the Facts, but you can figure them out from your...&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Evidence&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Evidence is the most important thing for you to have, because it's how you know the Facts. You could make the case&lt;sup&gt;*&lt;/sup&gt; that Evidence is everything in court. Pieces of Evidence have a name and a description of their relevance to the Facts. Evidence comes in two flavours: Direct and Circumstantial. Direct Evidence proves a Fact, while Circumstantial Evidence proves a fact if and only if a condition is met.&#xA;&amp;nbsp;&#xA;You get your Evidence as input in this format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Direct Evidence&#xA;Name of evidence: [Fact] is &amp;lt;true/false&amp;gt;.&#xA;&#xA;Circumstantial Evidence&#xA;Name of evidence: If [Fact] is &amp;lt;true/false&amp;gt;, then [Fact] is &amp;lt;true/false&amp;gt;.&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Statement&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A Statement is a declaration of Fact by a witness. There are also two kinds of Statements: Absolute and Conditional. An Absolute Statement claims a Fact, while a Conditional Statement claims a Fact if and only if a condition is met. Statements are taken as input in the same format as the second half of a piece of Evidence.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your job is to analyze your Evidence to determine the Facts, then try to find contradictions in the Statements.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A Statement can contradict either an earlier Statement or a piece of Evidence. If a Fact is proven to be True or False and the witness claims the opposite, that is a contradiction. Note that &lt;code&gt;If A is true, then B is true.&lt;/code&gt; and &lt;code&gt;If A is true, then B is false.&lt;/code&gt; do &lt;strong&gt;not&lt;/strong&gt; contradict unless &lt;code&gt;A&lt;/code&gt; is true.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input comes from either &lt;code&gt;stdin&lt;/code&gt; or a file, in exactly this format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Evidence&#xA;&amp;lt;One or more pieces of Evidence on their own lines&amp;gt;&#xA;Testimony&#xA;&amp;lt;One or more Statements on their own lines&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there is a contradiction between a proven fact and something the witness claims, you must find the first Statement that contains the contradiction. If it contradicts the Evidence, output this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Objection! Statement n contradicts this piece of evidence:&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;followed by a space and the name of the contradicted Evidence. &lt;code&gt;n&lt;/code&gt; is replaced with the number of the contradicting Statement (starting at 1). If, instead, the witness contradicts themselves, output this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Objection! Statement n contradicts statement m.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;n&lt;/code&gt; is replaced with the number of the contradicting Statement and &lt;code&gt;m&lt;/code&gt; is the number of the contradicted Statement (both starting at 1. m &amp;lt; n).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there are no contradictions, output this instead:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;No objections, Your Honor.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Evidence&#xA;My badge: L is true.&#xA;Thinker Clock: C is true.&#xA;Receipt: If C is true, then W is false.&#xA;Testimony&#xA;A is true.&#xA;B is false.&#xA;If A is true, then W is true.&#xA;H is true.&#xA;C is false.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Objection! Statement 3 contradicts this piece of evidence: Receipt&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Evidence&#xA;Metal detector: B is true.&#xA;Testimony&#xA;If B is true, then A is true.&#xA;A is false.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Objection! Statement 2 contradicts statement 1.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Evidence&#xA;Stuffed animal tail: N is false&#xA;Testimony&#xA;A is true.&#xA;N is false.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;No objections, your honor.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Assumptions&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The Evidence will never contradict itself. Evidence is infallible.&lt;/li&gt;&#xA;&lt;li&gt;There will never be a logic loop (e.g. &lt;code&gt;If A is true, then B is true.&lt;/code&gt;, &lt;code&gt;If B is true, then A is true.&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;&lt;sup&gt;* If you know what I mean&lt;/sup&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="14509" LastEditorUserId="14509" LastEditDate="2014-06-04T20:53:12.507" LastActivityDate="2014-06-04T20:53:12.507" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="1683" PostTypeId="1" CreationDate="2014-06-04T18:30:47.340" Score="10" ViewCount="244" Body="&lt;p&gt;I am planning a King of the Hill challenge, but when looking at older ones I noticed that there appear to be a large number of techniques used for communication between the control program and the entries.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These techniques include:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Creating classes.&lt;/li&gt;&#xA;&lt;li&gt;Arguments and stdout.&lt;/li&gt;&#xA;&lt;li&gt;Stdin and stdout&lt;/li&gt;&#xA;&lt;li&gt;TCP/IP&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;What are the pros/cons of the different methods?  Which one allows for the most language-agnostic question?&lt;/p&gt;&#xA;" OwnerUserId="17148" LastActivityDate="2016-09-09T11:53:38.890" Title="What is the best method to communicate with KotH entries?" Tags="|discussion|asking-questions|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1684" PostTypeId="1" AcceptedAnswerId="1685" CreationDate="2014-06-04T19:05:46.407" Score="-3" ViewCount="140" Body="&lt;p&gt;codegolf.stackexchange.com, I saw &lt;a href=&quot;http://benchmarksgame.alioth.debian.org/play.php&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;how programs are measured&quot;&gt;this&lt;/a&gt; and thought of you...&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;We start with the source-code markup you can see, remove comments, remove duplicate whitespace characters, and then apply minimum GZip compression. The Code-used measurement is the size in bytes of that GZip compressed source-code file.&lt;/p&gt;&#xA;&lt;p&gt;Thanks to Brian Hurt for the idea of using size of compressed source code instead of lines of code.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Is there any reason that this wouldn't be considered sufficiently objective to be used in a winning criterion for golf-style questions?&lt;/p&gt;&#xA;&lt;p&gt;What details would need to be specified to make it objective? Version, settings?&lt;/p&gt;&#xA;&lt;p&gt;I had a brief glance at the existing tags, but please let me know if a relevant tag already exists or if there are already questions using this criterion which I have failed to find.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-06-04T19:54:34.390" Title="Winning criterion: shortest compressed source code" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1685" PostTypeId="2" ParentId="1684" CreationDate="2014-06-04T19:54:34.390" Score="8" Body="&lt;p&gt;Following up on Geobits' comment, it &lt;em&gt;is&lt;/em&gt; a objective criterion, but I would be unlikely to play because who wants to bother.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Not that I have had much time for any games recently.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Besides, it presumably incentives repetitive code, and where's the fun in that?&lt;/p&gt;&#xA;" OwnerUserId="78" LastActivityDate="2014-06-04T19:54:34.390" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1686" PostTypeId="2" ParentId="1683" CreationDate="2014-06-04T20:05:00.700" Score="10" Body="&lt;h1&gt;Creating Classes&lt;/h1&gt;&#xA;&lt;p&gt;This method involves asking all submissions to directly subclass an abstract class that you wrote (or, less commonly, implement an interface you wrote). The submissions are instantiated, rather than invoked.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Advantages&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Instantiating an object, calling member functions, and getting return values (results) is relatively &lt;em&gt;easy&lt;/em&gt;, considering that &lt;em&gt;you&lt;/em&gt;, the author, provided the framework.&lt;/li&gt;&#xA;&lt;li&gt;Compiling the final project(s) generally doesn't require downloading any extra software.&lt;/li&gt;&#xA;&lt;li&gt;Requires zero parsing of input and output. You can simply &lt;em&gt;pass&lt;/em&gt; that four dimensional array.&lt;/li&gt;&#xA;&lt;li&gt;At the cost of some additional effort, can be combined with any of the other approaches, by implementing a wrapper for those &lt;em&gt;as&lt;/em&gt; a subclass. This opens the door to submissions in other languages, but also means the OP will have to download compilers or interpreters for all of those other submissions.&lt;/li&gt;&#xA;&lt;li&gt;Fastest.  You don't have to constantly decode/recode data being passed to/from submissions.&lt;/li&gt;&#xA;&lt;li&gt;Allows you to provide helper functions for submissions.  Instead of passing the entire game state to submissions, they can simply make function calls to query it.  (This is technically possible with other communication methods, but the overhead cost is pretty high)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Disadvantages&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The challenge is limited to one language (ignoring weird languages like Scala that can inherit from class written in Java &lt;em&gt;or&lt;/em&gt; Scala)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Command Line Arguments and STDOUT&lt;/h1&gt;&#xA;&lt;p&gt;Submissions get what they need from command line arguments, and hopefully return what they are supposed to from STDOUT.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Advantages&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Provides a unified, easy to read, &amp;quot;this is how I will run you&amp;quot; command. For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; java YourProgram Arg1 Arg2 Arg3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Works well when you want to invoke a process and then kill it after getting results.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Challenge is not restricted to one language.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Easiest way to write a controller that communicates with multiple languages&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Disadvantages&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Requires parsing output, which also means you must have to have defined a rigorous format for output.&lt;/li&gt;&#xA;&lt;li&gt;Slowest method of communication, as programs need to boot every time you want to communicate with them&lt;/li&gt;&#xA;&lt;li&gt;If anybody wants to test their solution against all of the submissions, they need to install all of the languages&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;STDIN and STDOUT&lt;/h1&gt;&#xA;&lt;p&gt;Submissions get what they need from STDIN, and hopefully return what they are supposed to from STDOUT.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Advantages&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Challenge is not restricted to one language.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Disadvantages&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Requires the program to already be running and waiting for input.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Requires parsing input and output, which also means you must define a rigorous format for each.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Can be tough to kill unresponsive processes (as &lt;code&gt;read()&lt;/code&gt; calls usually block in most languages)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Faster than command line args, but sending data over pipes is still significantly slower than native function calls.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If anybody wants to test their solution against all of the submissions, they need to install all of the languages&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;TCP/IP&lt;/h1&gt;&#xA;&lt;p&gt;Submissions get what they need and hopefully return what they are supposed to via TCP/IP sockets&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Advantages&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Challenge is not restricted to one language.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The controller can be placed on a server, and submissions can easily communicate with it.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Disadvantages&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;TCP/IP is usually more difficult to work with than STDIN and STDOUT.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Requires parsing input and output, which also means you must define a rigorous format for each.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If anybody wants to test their solution against all of the submissions, they need to install all of the languages&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;TCP/IP has a limitation on packet size (&lt;a href=&quot;//stackoverflow.com/questions/2613734/maximum-packet-size-for-a-tcp-connection&quot;&gt;64K&lt;/a&gt;). Mostly you don't need this size, but in &lt;em&gt;extreme&lt;/em&gt; cases you might need to send more data than 64K and you'll need to split the data, which will make the input/output format more complicated.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-09T11:53:38.890" CommentCount="5" CommunityOwnedDate="2014-06-04T20:54:57.067" ContentLicense="CC BY-SA 3.0" />
  <row Id="1687" PostTypeId="1" CreationDate="2014-06-04T20:32:37.920" Score="1" ViewCount="53" Body="&lt;p&gt;Is it good taste to add bonuses to a challenge so that new answers can compete? On &lt;a href=&quot;https://codegolf.stackexchange.com/questions/28896/program-to-use-all-your-bandwidth&quot;&gt;this question&lt;/a&gt;, a really short answer was given by simply tying to programs together (I was thinking of calling &quot;outsourcing the answer&quot; on it, but it solved it so well I refrained.) &lt;strong&gt;Can I add new bonuses to allow more answers?&lt;/strong&gt; It was solved to quickly that it was no fun, and it wouldn't break old answers, as it is just bonuses (although they may need to be modified to compete.) What do you think?&lt;/p&gt;&#xA;" OwnerUserId="16842" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-06-04T20:32:37.920" Title="Is it good taste to add new bonuses to challenge?" Tags="|discussion|code-challenge|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1688" PostTypeId="2" ParentId="1659" CreationDate="2014-06-04T21:50:04.577" Score="11" Body="&lt;p&gt;Short answer: yes, and the tag wiki is partly to blame.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Longer answer: although &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; doesn't inherently hit &lt;em&gt;Too Broad&lt;/em&gt; in the same way as code-trolling, it does suffer to an extent from a lack of objective specifications. The current tag wiki excerpt says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;An underhanded challenge is a challenge to write a program that looks as if it is doing one thing, but does something else.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;But what a program looks like it's doing is subjective, and so a question which tries to stick to that description will generally deserve to be closed as &lt;em&gt;Unclear what you're asking&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To pre-empt one anticipated objection: making the questions &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; doesn't solve anything, because that's a winning criterion and doesn't fix the lack of an objective acceptance criterion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(As a side-note: the tag wiki currently excludes some of the oldest questions in the tag, so that's a second reason to change it. However, I don't at present have specific suggestions for new text).&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-06-04T21:50:04.577" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1689" PostTypeId="2" ParentId="2140" CreationDate="2014-06-04T22:44:59.697" Score="1" Body="&lt;h1&gt;Run-as-you-type disaster&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://developer.apple.com/library/prerelease/ios/recipes/xcode_help-source_editor/ExploringandEvaluatingSwiftCodeinaPlayground/ExploringandEvaluatingSwiftCodeinaPlayground.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Swift playground&lt;/a&gt; is a programming environment with a peculiar feature that it executes code as you type. This means that when you type &lt;a href=&quot;http://www.mactrast.com/2014/06/careful-apples-new-swift-playground-run-type-can-dangerous/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;system(&amp;quot;cd ~; rm -rf *&amp;quot;)&lt;/code&gt;&lt;/a&gt;, it will remove all files from your home directory without waiting for you to save the file, compile and execute it manually. Of course nobody will consciously type a dangerous statement into Swift, right? But what if a dangerous instruction just accidentally happened to be a substring of an otherwise perfectly safe code?&lt;/p&gt;&#xA;&lt;p&gt;Your task is to write a piece of code:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;in any language (not necessarily Swift)&lt;/li&gt;&#xA;&lt;li&gt;that by itself is innocent (does something useful and safe)&lt;/li&gt;&#xA;&lt;li&gt;however, some prefix (an initial substring) of that code performs some dangerous operation (formatting your drive, posting all your pictures on imgur, whatever you choose).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;A &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; question.&lt;/p&gt;&#xA;" OwnerUserId="9529" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-06-23T19:17:01.540" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1690" PostTypeId="1" CreationDate="2014-06-05T01:10:59.777" Score="-4" ViewCount="118" Body="&lt;p&gt;They were built to be temporary. I understand keeping the nth and n-1th sandboxes because people still use those. Every time I search for things on meta I get so many trash results from sandboxes it's unbelievable. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my opinion, the benefits of being able to actually use the smart-search feature on meta outweigh the extremely rare chance that a shining gem of a challenge will be found among the below average, months old challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Delete all but the latest and second to latest sandbox.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="18487" LastActivityDate="2014-06-28T20:49:43.133" Title="Expire Old Sandboxes" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1691" PostTypeId="2" ParentId="1690" CreationDate="2014-06-05T01:26:51.070" Score="9" Body="&lt;p&gt;I would prefer they be kept. I put quite a bit of work into some of them and while I think they need more before they're ready to post, it would be upsetting for them to disappear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I also don't really understand the reason for wanting to delete them. Can you do &lt;code&gt;-sandbox&lt;/code&gt; or something to exclude the undesired search results?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Edit: Since I've hit 2000, I can see deleted posts now. But I still represent this position for all the sub-2000 users.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="2381" LastEditDate="2014-06-28T20:49:43.133" LastActivityDate="2014-06-28T20:49:43.133" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1692" PostTypeId="1" AcceptedAnswerId="1693" CreationDate="2014-05-22T12:29:45.930" Score="14" ViewCount="107" Body="&lt;p&gt;On Programming Puzzles and Code Golf, the answers to most of our questions look like this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h2&gt;Some language, 1234 characters&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;asdfunicorn+1(&amp;amp;&amp;amp;%^#$)/-9x9[{}]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;{explanation text goes here)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That's a pretty big problem for the &lt;a href=&quot;https://codegolf.stackexchange.com/tour&quot;&gt;/tour&lt;/a&gt; page, since apparently the requirement of &lt;a href=&quot;https://meta.stackexchange.com/a/163948/180276&quot;&gt;&quot;no crazy formatting&quot;&lt;/a&gt; means &quot;no lists, quotes, code, images, or headers.&quot; For that reason, we have exactly zero choices (out of 1993 questions) for our /tour page's example question on PPCG.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Could these very tight requirements be loosened a little? I can understand the &amp;lt; 400 character and no image requirements, but can at least a single line of code and a single header be allowed? If not, I fear that PPCG will never be able to get rid of the &quot;unicorns eating daisies&quot; example question (not saying unicorns are any less majestic; they're just not good at code golf).&lt;/p&gt;&#xA;" OwnerUserId="3808" OwnerDisplayName="Doorknob" LastEditorUserId="68942" LastEditDate="2021-06-09T05:51:30.580" LastActivityDate="2021-06-09T05:51:30.580" Title="Relax the requirements for &quot;crazy formatting&quot; on the /tour example question" Tags="|feature-request|status-completed|help-center|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1693" PostTypeId="2" ParentId="1692" CreationDate="2014-06-05T04:13:42.920" Score="6" Body="&lt;p&gt;I've lifted the prohibition on block elements for this site, so moderators can now choose from a fairly diverse list of questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The length limit still applies, and if block elements make the posts too big for the available space they'll just be truncated. As such, you'll want to be a bit careful when choosing a question to avoid those that look really bad - or only have poor answers that fit within the length criteria. &lt;/p&gt;&#xA;" OwnerUserId="1144" LastActivityDate="2014-06-05T04:13:42.920" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1694" PostTypeId="1" CreationDate="2014-06-05T15:42:22.207" Score="1" ViewCount="72" Body="&lt;p&gt;A collegue of me just suggested, I could just invent my own language for every problem in code-golfs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now my question is, is it ok, if I just say I gonna invent a language for exactly this one problem and the interpreter can be found &lt;a href=&quot;http://github.com/&quot; rel=&quot;nofollow&quot;&gt;here&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="19894" LastActivityDate="2014-06-05T15:42:22.207" Title="Custom language for code golfs" Tags="|discussion|" AnswerCount="0" CommentCount="4" ClosedDate="2014-06-05T16:12:48.093" ContentLicense="CC BY-SA 3.0" />
  <row Id="1697" PostTypeId="2" ParentId="2140" CreationDate="2014-06-05T23:34:04.393" Score="1" Body="&lt;h1&gt;String Subtraction without Converting to Numbers&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Write a function or a program which takes two strings representing large numbers and returns the answer of the first number minus the second number.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Two strings each matching the regular expression &lt;code&gt;-?[1-9]\d{0,199}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Input is read from STDIN (or a prompt) or passed as arguments to the function (it should not be stored in an variable).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A string matching the regular expression &lt;code&gt;-?[1-9]\d{0,200}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Output can be to STDOUT/STDERR (or console) or a value returned from the function but cannot be left in a variable.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/9275&quot;&gt;Standard &amp;quot;loopholes&amp;quot;&lt;/a&gt; is not allowed.&lt;/li&gt;&#xA;&lt;li&gt;Lowest score wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;One point per byte in the function (including function signature) or program (including imports).&lt;/li&gt;&#xA;&lt;li&gt;If the program converts characters of the input strings to their equivalent numeric (or ASCII/Unicode) value (implicitly or explicitly) then performs an arithmetic (or bitwise operation) on those value as part of the subtraction then this incurs additional points: Calculate the magnitude of ranges of possible values (maximum value - minimum value + 1) for each converted (sub)string and for the resulting answer and then multiply the total magnitude of these ranges by 2 and add it to the score.&lt;/li&gt;&#xA;&lt;li&gt;I.e. The (incomplete) JavaScript &lt;code&gt;function(x,y){for(i=x.length-1,j=y.length-1;i&amp;gt;=1&amp;amp;&amp;amp;j&amp;gt;=1;i--,j--){a=x.charCodeAt(i);b=y.charCodeAt(j);c=a-b;/* do something with &amp;quot;value&amp;quot; */}}&lt;/code&gt; would score:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;135 characters (bytes);&lt;/li&gt;&#xA;&lt;li&gt;The variables &lt;code&gt;i&lt;/code&gt; and &lt;code&gt;j&lt;/code&gt; do not store character values from the strings so do not add any extra points;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;a=x.charCodeAt(i)&lt;/code&gt; stores an ASCII value of a single numeric digit (i.e. ASCII values in the range 48-57) - the magnitude of this range is 10 units so adds +20 points;&lt;/li&gt;&#xA;&lt;li&gt;Same for &lt;code&gt;b=y.charCodeAt(j)&lt;/code&gt; = +20 points;&lt;/li&gt;&#xA;&lt;li&gt;The result of the subtraction, stored in the &lt;code&gt;c&lt;/code&gt; variable, has a range from -9 to +9  (range of 19 units) so adds +38 points;&lt;/li&gt;&#xA;&lt;li&gt;Giving a total of: 135+20+20+38 = 213 points.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Note:&lt;/em&gt; skipping the assignment to variables &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; and just performing the calculation &lt;code&gt;c=x.charCodeAt(i)-y.charCodeAt(j)&lt;/code&gt; (or even doing &lt;code&gt;c=x[i]-y[j]&lt;/code&gt;) would still incur +78 points as implicit conversions of the intermediate values are scored in exactly the same way as the explicit.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;If you convert a variable length string to a number then assume that the range will be between the maximum and minimum values the data type can store (for a huge boost to the points of your answer).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="15968" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-06-05T23:53:08.750" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1698" PostTypeId="1" AcceptedAnswerId="1702" CreationDate="2014-06-06T08:25:32.687" Score="5" ViewCount="129" Body="&lt;p&gt;I am working &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1695/8478&quot;&gt;on a code challenge&lt;/a&gt;. The scoring will be based on a set of benchmark inputs (i.e. it will be the sum of the individual scores).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now I'm wondering if it's alright to add additional test cases once the challenge has started (in which case I'd redetermine all submissions' scores, obviously). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why I might want to do this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Maybe I just think of an additional interesting/pathological test case that I forgot initially.&lt;/li&gt;&#xA;&lt;li&gt;Someone posts a solution which is tailored specifically to the existing test cases (hardcoded or similar), which I'd like to discourage.&lt;/li&gt;&#xA;&lt;li&gt;Someone posts a solution which solves the problem optimally &lt;em&gt;and&lt;/em&gt; runs in reasonable time on the existing test cases, that sort of breaks the challenge. It's likely that others will manage that, too, resulting in a massive tie of optimal submissions. In such a case, I'd like to add additional larger tests where the optimal algorithms become infeasible.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Why it might be a problem:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can't figure out your final score at the time of posting, because you can't know which test cases might be added later on.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Why I think it might be alright:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There &lt;em&gt;are&lt;/em&gt; test cases already, and if submissions are just general algorithms that can deal with any input (like they're supposed to), their scores shouldn't be massively affected by adding new test cases.&lt;/li&gt;&#xA;&lt;li&gt;Participants are always free to tweak their submissions if they realise they missed some important optimisations after I add more test cases.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I realise this question is similar to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1603/winning-conditions-not-measurable-until-question-author-decides-to-reveal-test-d/1642#1642&quot;&gt;this one&lt;/a&gt;, but I think my case is slightly different, because there the benchmark test cases weren't disclosed at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What's the community's opinion on this?&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2014-06-08T09:35:06.493" Title="Adding benchmark test cases to active code challenge" Tags="|discussion|testing|code-challenge|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1700" PostTypeId="2" ParentId="2140" CreationDate="2014-06-06T15:53:59.737" Score="12" Body="&lt;h1&gt;2048 Low Score&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The goal is to make an algorithm that plays as low score in 2048 as possible.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your AI will play the game of 2048 repeatedly.&lt;/li&gt;&#xA;&lt;li&gt;If a game takes more than 2s or scores more than 5000, it will be terminated and score 5000 will be used.&lt;/li&gt;&#xA;&lt;li&gt;If a game gets to &lt;code&gt;Game Over&lt;/code&gt;, the final score will be used.&lt;/li&gt;&#xA;&lt;li&gt;The quality of the algorithm will be the average score of the separate games.&lt;/li&gt;&#xA;&lt;li&gt;After 4 weeks, the winner will be chosen. However, if another algorithm is proposed, I will test it and change the winner if necessary.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Choosing the winner&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each algorithm will be run 1000 times.&lt;/li&gt;&#xA;&lt;li&gt;The best 10 algorithms will be run again 10000 times to precise the quality.&lt;/li&gt;&#xA;&lt;li&gt;If the score of the two best algorithms is closer than 3% from each other, they will be run 20000 more times. If they are closer than 3% after this, both will be named as winners.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Algorithm specification&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;C++&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An example code is in files &lt;a href=&quot;https://github.com/tohecz/2048/blob/master/2048-core.inc&quot; rel=&quot;nofollow&quot;&gt;2048-core.cpp&lt;/a&gt; and &lt;a href=&quot;https://github.com/tohecz/2048/blob/master/rand.cpp&quot; rel=&quot;nofollow&quot;&gt;rand.cpp&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Your code should follow the example of that file: a function &lt;code&gt;int NextStep(const Game&amp;amp;)&lt;/code&gt; should be provided.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Other languages&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I surely work with Python, I should be able to run Java. For other languages, provide a short code together with a way how to compile it, so that I can see what can be done.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Provide a program code that accepts the following input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;size-of-the-board&amp;gt; &amp;lt;score&amp;gt; &amp;lt;1-if the last performed move actually did something&amp;gt; &amp;lt;the-board-top-line-goes-first&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So a typical output line is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4 156 1 0 4 8 2 0 0 0 8 0 0 2 32 0 0 0 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And outputs one number for the next step: &lt;code&gt;0=UP&lt;/code&gt;, &lt;code&gt;1=RIGHT&lt;/code&gt;, &lt;code&gt;2=DOWN&lt;/code&gt;, &lt;code&gt;3=LEFT&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For linking your script to the interpreter:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Download &lt;a href=&quot;https://github.com/tohecz/2048/blob/master/2048-core.inc&quot; rel=&quot;nofollow&quot;&gt;2048-core.inc&lt;/a&gt;, &lt;a href=&quot;https://github.com/tohecz/2048/blob/master/2048-pipe.sh&quot; rel=&quot;nofollow&quot;&gt;2048-pipe.sh&lt;/a&gt; and &lt;a href=&quot;https://github.com/tohecz/2048/blob/master/io.cpp&quot; rel=&quot;nofollow&quot;&gt;io.cpp&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Compile &lt;code&gt;2048-io&lt;/code&gt; by &lt;code&gt;g++ -O3 -o 2048-io io.cpp&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Run &lt;code&gt;./2048-pipe.sh ./yourprogram&lt;/code&gt; , this should work well.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;My PC specification&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Intel(R) Core(TM) i5-4200M CPU @ 2.50GHz, 4GB RAM&lt;/li&gt;&#xA;&lt;li&gt;Fedora linux 3.14.4-200.fc20.x86_64&lt;/li&gt;&#xA;&lt;li&gt;gcc version 4.8.2 20131212 (Red Hat 4.8.2-7) (GCC)&lt;/li&gt;&#xA;&lt;li&gt;(Anyways, I believe that providing 2 seconds per run is more than generous and should be fine. If more people complain they would use more time, I can extend it.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;TO BE SOLVED:&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How to make it available to Windows other than C++?&lt;/li&gt;&#xA;&lt;li&gt;Proper tagging.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12864" LastEditorUserId="12864" LastEditDate="2014-06-09T14:22:59.757" LastActivityDate="2014-06-09T14:22:59.757" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1702" PostTypeId="2" ParentId="1698" CreationDate="2014-06-06T20:59:24.370" Score="4" Body="&lt;p&gt;The title of this question is slightly misleading, so as an minor point: it's always good to add test cases to questions which don't have them, or to add ones which cover corner cases which aren't tested by the existing ones.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think the word &lt;em&gt;benchmark&lt;/em&gt; in your question is the real heart of it. One approach which I believe was suggested in the early days of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; is that everyone who goes to the effort of writing an answer thereby gains to right to add one set of input to the benchmark. That provides an easy way to deal with the first two specific issues you raise.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In terms of the third issue, tie-breaking, it wouldn't be very reasonable to object to adding new cases there. If you're really worried that people might accuse you of bias, you could write a deterministic track generator which takes a size parameter.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-06-06T20:59:24.370" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1703" PostTypeId="1" CreationDate="2014-06-07T01:06:33.647" Score="2" ViewCount="318" Body="&lt;p&gt;I am working on creating a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; that involves using playing cards, but I am not sure what the best way to represent them textually is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some alternatives I have considered:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note, the samples show a hand consisting of the Ace of Clubs, Ten of Clubs, Five of Hearts, Five of Spades, and Queen of Spades.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Represent rank with digits &lt;code&gt;1&lt;/code&gt;-&lt;code&gt;9&lt;/code&gt; and &lt;code&gt;10&lt;/code&gt;, and then &lt;code&gt;J&lt;/code&gt;, &lt;code&gt;Q&lt;/code&gt;, and &lt;code&gt;K&lt;/code&gt;, and suit with &lt;code&gt;S&lt;/code&gt; (spades), &lt;code&gt;C&lt;/code&gt; (clubs), &lt;code&gt;D&lt;/code&gt; (diamonds), and &lt;code&gt;H&lt;/code&gt; (hearts):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1C 10C 5H 5S QS&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Use &lt;code&gt;0&lt;/code&gt; to represent a ten:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1C 0C 5H 5S QS&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each card is represented by the same number of characters.&lt;/li&gt;&#xA;&lt;li&gt;Somewhat less readable.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Use numbers to represent all ranks:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1C 10C 5H 5S 12S&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Might be easier to parse, somehow.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Use &lt;code&gt;♠&lt;/code&gt;. &lt;code&gt;♣&lt;/code&gt;, &lt;code&gt;♦&lt;/code&gt;, and &lt;code&gt;♥&lt;/code&gt; to represent suit:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1♣ 10♣ 5♥ 5♠ Q♠&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Much easier to read.&lt;/li&gt;&#xA;&lt;li&gt;Might be more difficult for languages that have problems with extended charsets.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Use &lt;code&gt;A&lt;/code&gt; instead of &lt;code&gt;1&lt;/code&gt;, for an ace:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A♣ 10♣ 5♥ 5♠ Q♠&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Makes it a little bit prettier.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Some combination of these alternatives.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Use a custom character set to encode the cards.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Much more efficient.&lt;/li&gt;&#xA;&lt;li&gt;Can't view it very easily.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I am rather partial to formatting them like &lt;code&gt;A♣ 10♣ 5♥ 5♠ Q♠&lt;/code&gt;, but I would like to see what others think about this issue.&lt;/p&gt;&#xA;" OwnerUserId="7981" LastActivityDate="2014-06-07T15:33:31.290" Title="Recommended textual representation for playing cards?" Tags="|discussion|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1704" PostTypeId="2" ParentId="1703" CreationDate="2014-06-07T05:48:42.543" Score="-1" Body="&lt;p&gt;Might I suggest Unicode (6+)?&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Playing_cards_in_Unicode&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://en.wikipedia.org/wiki/Playing_cards_in_Unicode&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;      &lt;br&gt;&#xA;      &lt;br&gt;&#xA;      &lt;br&gt;&#xA;      &lt;br&gt;&#xA;      &lt;br&gt;&#xA;      &lt;br&gt;&#xA;      &lt;br&gt;&#xA;      &lt;br&gt;&#xA;      &lt;br&gt;&#xA;      &lt;br&gt;&#xA;      &lt;br&gt;&#xA;      &lt;br&gt;&#xA;      &lt;br&gt;&#xA;      &lt;br&gt;&#xA;    &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;edit&lt;/strong&gt; This is a screenshot from Chromium on Ubuntu 14.04 of what it should look like.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/oAYTa.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="21559" LastEditorUserId="21559" LastEditDate="2014-06-07T15:33:31.290" LastActivityDate="2014-06-07T15:33:31.290" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="1705" PostTypeId="2" ParentId="1703" CreationDate="2014-06-07T10:33:41.113" Score="8" Body="&lt;p&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/KISS_principle&quot; rel=&quot;nofollow noreferrer&quot;&gt;KISS&lt;/a&gt;. Sticking to ASCII makes it simpler: the byte representations will be the same in ISO-8859-1, UTF-8, and MacRoman, so people don't have to worry about ensuring that they're using the correct character encoding. (Of course, they &lt;em&gt;should&lt;/em&gt; as a matter of principle, but this site isn't really about best practices).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of the various ASCII options, the one I'm more familiar with from my bridge-playing days is &lt;code&gt;A23456789TJQK&lt;/code&gt; &lt;code&gt;CDHS&lt;/code&gt;, but the simplest for inter-program communication is probably to number the cards from &lt;code&gt;0&lt;/code&gt; to &lt;code&gt;51&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, there's nothing which requires you to use the same format for inter-program communication and for presentation to the user. Although I recommend using ASCII for the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; communication, the scoring program could be made more polished by using &lt;code&gt;A23456789TJQK&lt;/code&gt; &lt;code&gt;♠♡♢♣&lt;/code&gt; in its logs.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-06-07T10:33:41.113" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1706" PostTypeId="1" CreationDate="2014-06-07T14:39:50.283" Score="4" ViewCount="130" Body="&lt;p&gt;I just came across &lt;a href=&quot;https://codegolf.stackexchange.com/q/30343/11066&quot;&gt;this question&lt;/a&gt; in &lt;a href=&quot;https://codegolf.stackexchange.com/review/reopen/11726&quot;&gt;the review queue&lt;/a&gt;. It was originally both &lt;strong&gt;too broad&lt;/strong&gt; and &lt;strong&gt;lacking an objective primary winning criterion&lt;/strong&gt;. It got closed with the latter reason, but then the owner edited it to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;. It is now too broad but &lt;em&gt;not&lt;/em&gt; lacking an objective primary winning criterion; however, it is still closed with &quot;lacking an objective primary winning criterion.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should it be reopened, and then closed as &quot;too broad,&quot; or should it be left closed?&lt;/p&gt;&#xA;" OwnerUserId="11066" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2015-09-13T13:33:12.547" Title="Should we reopen and then close with the right reason?" Tags="|discussion|close-reasons|closed-questions|reopening|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1707" PostTypeId="2" ParentId="1706" CreationDate="2014-06-07T15:26:17.533" Score="5" Body="&lt;p&gt;Please see &lt;a href=&quot;https://meta.stackexchange.com/a/207771/229438&quot;&gt;this answer&lt;/a&gt; of ChrisF on Meta Stack Exchange, especially this part:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If you think that it's really important that the close reason gets changed then the simple solution is to flag it for moderator attention. However, most of the time a comment should be sufficient.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In this case, it is not really important that the close reason gets changed, because Doorknob posted a comment in which he says that the question is very broad. So it is not really necessary to change the reason.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, everyone has just one close and reopen vote per question, so if you would vote to reopen and then to close as &quot;too broad&quot;, you have no close/reopen votes left on that question and you can't vote to reopen it anymore if it would be made less broad. &lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-06-07T15:26:17.533" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1708" PostTypeId="2" ParentId="2140" CreationDate="2014-06-07T19:07:04.197" Score="0" Body="&lt;h1&gt;Factorize any number using a set of predetermined &lt;em&gt;random&lt;/em&gt; numbers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For instance:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With the randomly generated set &lt;code&gt;[1,2,3,5,8]&lt;/code&gt;, factorizing &lt;code&gt;10&lt;/code&gt; would give the result &lt;code&gt;[2,5]&lt;/code&gt; as in &lt;code&gt;2*5=10&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If a number can not be factorized using the provided set, indicate&#xA;so. Using the same set, factorizing &lt;code&gt;13&lt;/code&gt; would show an error or an&#xA;empty list.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Generated sets should contain less than 64 numbers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Bonuses&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The score is given by &lt;code&gt;floor (code length * (1 - 0,1 * # of bonuses))&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If a number can not be factorized, try to fix it using addition. In&#xA;the previous example, factorizing &lt;code&gt;13&lt;/code&gt; could give &lt;code&gt;[2,5]&lt;/code&gt; and &lt;code&gt;[3]&lt;/code&gt;&#xA;as in &lt;code&gt;2*5+3=13&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If a number can not be factorized, try to fix it using subtraction. In&#xA;the previous example, factorizing &lt;code&gt;14&lt;/code&gt; could give &lt;code&gt;[3,5]&lt;/code&gt; and &lt;code&gt;[1]&lt;/code&gt;&#xA;as in &lt;code&gt;3*5-1=14&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When generating a set, filter out primes and powers of 2.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;algorithm&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="21559" LastActivityDate="2014-06-07T19:07:04.197" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1709" PostTypeId="2" ParentId="1659" CreationDate="2014-06-07T20:05:33.020" Score="-2" Body="&lt;p&gt;I would argue that we should treat &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; more as a win condition - sort of an auto-popularity contest where users are expected to vote based on how sneaky the code is.  Challenges should have an explicit specification, which should be used as the acceptance criterion.  This does allow completely aboveboard answers to be &quot;valid&quot;, but really it's no different than a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt; answer that meets specs but is completely un-golfed.&lt;/p&gt;&#xA;" OwnerUserId="16963" LastActivityDate="2014-06-07T20:05:33.020" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1711" PostTypeId="1" CreationDate="2014-06-10T10:06:05.470" Score="5" ViewCount="193" Body="&lt;p&gt;For example I have a running program in Python that solves game X. The performances are good enough for me and I don't feel like I can improve it. Now I am curious to know how much this could still be improved. For example, in my solution I am not taking advantage of multiple cores on my processor. Also, I think it could be rewritten in another language that would execute even faster, and so on.. Is it a question for Code Golf, or for Stack Overflow ? Neither ?&lt;/p&gt;&#xA;" OwnerUserId="10616" LastActivityDate="2014-06-10T10:06:05.470" Title="Are questions about performance a good fit for code golf?" Tags="|discussion|" AnswerCount="0" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1714" PostTypeId="2" ParentId="1499" CreationDate="2014-06-12T13:12:43.530" Score="0" Body="&lt;p&gt;Why not showing the &lt;strong&gt;How to ask&lt;/strong&gt; article before a new user asks a the first question?&lt;/p&gt;&#xA;" OwnerUserId="19894" LastActivityDate="2014-06-12T13:12:43.530" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1716" PostTypeId="2" ParentId="1661" CreationDate="2014-06-12T17:09:02.733" Score="-4" Body="&lt;h1&gt;Should we kill komolgorov-complexity?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;After all, in the wiki for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/komolgorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;komolgorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;komolgorov-complexity&lt;/a&gt; it says: &quot;Goal is shortest length (i.e. code golf).&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So we could just get rid of it entirely and use &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; instead.&#xA;Then there are tags like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/word-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;word-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;word-puzzle&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt;, which don't correspond to any particular type of challenge either, but instead are there to, you know, tag the post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My point is, lets just enforce &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; on any question tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt;, like how pretty much all komolgorov-complexity-questions are also tagged with code-golf or how most code-trolling-questions used to be a popularity-contest, and be done with it. This way there is an objective winning criteria (i.e. the community decides at what point a persons code is unnecessarily bloated), fans of code-bowling can still participate in writing lots of code, and everyone is happy.&lt;/p&gt;&#xA;" OwnerUserId="18671" LastActivityDate="2014-06-12T17:09:02.733" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1717" PostTypeId="5" CreationDate="2014-06-13T00:42:15.740" Score="0" Body="&lt;p&gt;For questions specifically about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; challenges. Code-bowling challenges should be asked on the &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;main site&lt;/a&gt;, not here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1661/38979&quot;&gt;Should we kill code-bowling?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="38979" LastEditorUserId="38979" LastEditDate="2020-01-02T10:45:55.033" LastActivityDate="2020-01-02T10:45:55.033" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="1718" PostTypeId="4" CreationDate="2014-06-13T00:42:15.740" Score="0" Body="For questions specifically about [code-bowling] challenges. Code-bowling challenges should be asked on the main site, not here." OwnerUserId="16842" LastEditorUserId="38979" LastEditDate="2020-01-02T10:45:58.347" LastActivityDate="2020-01-02T10:45:58.347" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="1720" PostTypeId="1" CreationDate="2014-06-13T23:14:21.957" Score="2" ViewCount="409" Body="&lt;p&gt;Just to make it clear, Atomic Golf COBOL will not be a &lt;em&gt;competitive&lt;/em&gt; golfing language. The longer the shortest answer (80+, the longer the better) the more possible to get close, however, COBOL is very largely hand-coded (little &quot;magic&quot; available). Over the last four months, there are two questions I was considering for the introduction of AG COBOL. Then a short answer came in on one of those. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;COBOL traditionally has fixed-length source records. I want to use standard features of IBM Enterprise COBOL to allow actual source (before the compiler sees it) to be variable in length.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Enterprise COBOL allows for specifying abbreviations for language elements. I want to use those abbreviations, and use different abbreviations for the same element where necessary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Enterprise COBOL allows a new set of default compiler options to be established.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For all of the above, the Golfed COBOL program will be compiled in an identical manner to any ordinary COBOL program. The method of compile is unchanged, the stat&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can I make use of these supported and documented features for Code Golf in COBOL without penalty for using them. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;An example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A B 10 C&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is a line of code, not a program. It says PERFORM a-paragraph-of-this-name 10 TIMES.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My source will be &lt;code&gt;A B 10 C&lt;/code&gt; followed by a newline.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My compiler exit will read that source line, and put it in column 8 of a fixed-length 80-byte area, and return that as a source line to the compiler.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The compiler will then process the abbreviations, and treat the line as:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;PERFORM B 10 TIMES&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The compile listing of the source will be the A B 10 C, the compile listing relating to the processed code will know only about the PERFORM B 10 TIMES, due to the translation of the abbreviations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The is some amount of work to set this up, probably more to document it (so others can use/verify it).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't want to do all that if someone just comes along and says &quot;ah, but, you've got a 30-thousand character 'file' the compiler is using, you have to count that as well&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is all standard Enterprise COBOL stuff, used for the purpose intended (to allow different names for language elements, to allow different default options, to allow programmatic preparation of source files), just so happens that if I apply it all I've got COBOL as a, somewhat limited, golfing language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it is &quot;no&quot;, I want to know before doing it, rather than after :-)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I've been thinking of this for a while. Something of it first saw the light of day in a LinkedIn discussion in October 2012, but I've been thinking about it for a while to win that one-off bet and retire on the proceeds (COBOL beats some-other-language at shortness).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Before crossing the Is and dotting the Ts and actually doing the whole thing, I'd like to know if it would be valid in its entirety, or in any part or parts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;1. Compile Options&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Default compiler options are defined in a file. I can change (a copy) of the defaults, and so never have to specify compile options.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So not extra count for compile options, yes?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;2. Abbreviations&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Enterprise COBOL supports abbreviations of language elements (see here for an example and some explanation, &lt;a href=&quot;https://codegolf.stackexchange.com/a/31640/16411&quot;&gt;https://codegolf.stackexchange.com/a/31640/16411&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using abbreviations customised for a particular task I can get Golf to a minimum lengths - with a &quot;standard&quot; Golf table, I'd lose out if a task required something that didn't fit in one character, even though there may be &quot;spare&quot; one-character values available.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, specifying abbreviations for each task is OK, yes?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;3. COBOL has fixed-length lines of 80 characters (uses punched cards, so no messing possible).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I want to mess with that (time that old card-reader went anyway, we can always emulate it).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Enterprise COBOL supports a few compiler &quot;exits&quot; (source lines, output, errors messages, like that). This means I can take a &quot;source&quot; and format it to what COBOL expects.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The compiler exits can be written in COBOL. I can read a file of variable-length records and &quot;format&quot; the source to that required for the compiler itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This way, there is an &quot;overhead&quot; to each line, which is an extra four bytes (supplied by the IO system). Would this overhead be counted in the length? It would be the equivalent of the newline at the end of a line.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it is, I could try to use HFS (Hierarchical File System) which is a unix-style file system. I'm not sure I have authority to &quot;mount&quot; HFS, if not, would a Proof of Concept for the method be OK: working compiler exit; code compiling for HFS under Enterprise COBOL; same code compiled under GNU COBOL and running stand-alone under Linux?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As well as the extreme, but valid, application of what the compiler supports, I will of course abuse the compiler with the code, but that's the nature of Golf, isn't it?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's an example program, extracted from the compile listing (some formatting applied):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;PP 5655-S71 IBM Enterprise COBOL for z/OS  4.1.0               CBLNAM01&#xA;  LineID  PL SL  ----+-*A-1-B--+----2----+----3----+----4----+----5----&#xA;  000001                A B C&quot;Hello, World!&quot; &#xA;&#xA;==000001==&amp;gt; IGYPS0001-W A blank was missing before character &quot;&quot;&quot; in &#xA;                        column 13.  A blank was assumed. &#xA;&#xA;==000001==&amp;gt; IGYPS2145-E A period was required.  A period was assumed &#xA;before &quot;E&quot;. &#xA;&#xA;==000001==&amp;gt; IGYSC1082-E A period was required.  A period was assumed &#xA;before &quot;END OF PROGRAM&quot;. &#xA;&#xA; Count   Cross-reference of verbs        References &#xA;&#xA;1        STOP . . . . . . . . . . . . .  1 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The only verb used in the program is STOP (abbreviated to C) and the listing shows reference to the unabbreviated verb. A B is an abbreviation of two words, PROCEDURE and DIVISION.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program crashes after producing the literal (on the Operator's console, so don't try this at home).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;20 Characters, instead of counting as 80, or 72, or 27 or 24.&lt;/p&gt;&#xA;" OwnerUserId="16411" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-06-15T10:00:38.830" Title="Atomic Golf COBOL (IBM Enterprise COBOL)" Tags="|discussion|code-golf|" AnswerCount="0" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="1722" PostTypeId="1" CreationDate="2014-06-14T21:33:21.463" Score="2" ViewCount="79" Body="&lt;p&gt;Explanations cannot be read on iPad. Selecting them doesn't make them visible. Please implement that they become visible after a tap!&lt;/p&gt;&#xA;" OwnerUserId="24965" LastEditorUserId="68942" LastEditDate="2021-06-04T02:11:13.407" LastActivityDate="2021-06-04T02:11:13.407" Title="Can't read explanations on iPad" Tags="|bug|status-completed|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1723" PostTypeId="1" CreationDate="2014-06-14T21:43:36.177" Score="26" ViewCount="1838" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/31774/3808&quot;&gt;4 reopen votes and 1 delete vote is a strange thing to see.&lt;/a&gt; It's also slightly worrying that we have so little consensus on this matter. So let's bring the community together.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;What kind of non-challenge questions do we want?&lt;/h1&gt;&#xA;&lt;p&gt;Each answer will contain one type of non-challenge question, some examples, and arguments for and against it.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Please &lt;strong&gt;vote up the answers&lt;/strong&gt; that you think should be on the site, and &lt;strong&gt;vote down&lt;/strong&gt; the ones that you are strongly opposed to.&lt;/li&gt;&#xA;&lt;li&gt;The answers are Community Wiki, so please feel free to &lt;strong&gt;edit them&lt;/strong&gt; if you have something to add! If you have any new pros and cons of allowing that type of question on the site, add them to the list!&lt;/li&gt;&#xA;&lt;li&gt;If you feel that the answers do not cover all possible non-challenge questions that can be asked, &lt;strong&gt;add a new answer&lt;/strong&gt;! (Make it CW so that others can edit.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Also please note that &lt;strong&gt;this is not a definitive decision&lt;/strong&gt; and it may change over time as we gather more experience.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;As to whether we even want non-challenge questions or not, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1470/3808&quot;&gt;the consensus is clear.&lt;/a&gt; As &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1192/3808&quot;&gt;Grace Note said&lt;/a&gt;, &amp;quot;&lt;em&gt;The invention of a new puzzle type, and perhaps continued innovation in that department, helps a lot.&lt;/em&gt;&amp;quot; New ideas can be beneficial to the health of the site as a whole, so please vote for what you think will help the growth of the PPCG community the most.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="68942" LastEditDate="2021-06-10T13:37:13.663" LastActivityDate="2021-06-10T13:37:13.663" Title="Let's decide what kind of non-challenge questions we want once and for all" Tags="|discussion|faq|" AnswerCount="7" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="1724" PostTypeId="2" ParentId="1723" CreationDate="2014-06-14T21:43:36.177" Score="36" Body="&lt;h1&gt;Questions about improving code golf / code challenge skills&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How can I make shuffling this array shorter?&lt;/li&gt;&#xA;&lt;li&gt;How can I shorten these nested loops?&lt;/li&gt;&#xA;&lt;li&gt;How can I &lt;a href=&quot;https://codegolf.stackexchange.com/q/26831/3808&quot;&gt;alias member functions in a short way?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Arguments&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;For&lt;/strong&gt;: These more basic questions might be attractive to new users (if they can identify and find them).&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Against&lt;/strong&gt;: The questions are mostly language-specific from their intention and thus are not good fit or at least barely welcome here.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Against&lt;/strong&gt;: The better examples of this type of question and answer would naturally fit in the site as answers to the existing tips questions, without diluting the focus of the site.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-06-16T08:52:39.437" CommentCount="5" CommunityOwnedDate="2014-06-14T21:43:36.177" ContentLicense="CC BY-SA 3.0" />
  <row Id="1725" PostTypeId="2" ParentId="1723" CreationDate="2014-06-14T22:26:05.370" Score="44" Body="&lt;h1&gt;Requests for lists of language-specific golfing advice&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/54/tips-for-golfing-in-python&quot;&gt;Tips for golfing in Python&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/5264/tips-for-golfing-in-golfscript&quot;&gt;Tips for golfing in GolfScript&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/363/tips-for-golfing-in-ruby&quot;&gt;Tips for golfing in Ruby&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Pretty much all older questions tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Arguments&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;For&lt;/strong&gt;: They are very useful content for this site, as they are contain a large number of specific advice about how to approach a certain type of challenge (so far, only &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;) in a given language.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Against&lt;/strong&gt;: They are list-like questions, which are generally frowned upon around StackExchange.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2014-06-14T22:32:04.987" CommentCount="1" CommunityOwnedDate="2014-06-14T22:26:05.370" ContentLicense="CC BY-SA 3.0" />
  <row Id="1726" PostTypeId="2" ParentId="2140" CreationDate="2014-06-15T01:18:39.483" Score="24" Body="&lt;h1&gt;King of the Hill- Simple RPG&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to make a bot that plays a simple RPG game against other bots. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Rules of the Game&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;The Board&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The board is a 500x500 2-dimensional array of cells. In any cell, there is one of the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Nothing.&lt;/li&gt;&#xA;&lt;li&gt;An obstacle. Cannot be occupied by anything.&lt;/li&gt;&#xA;&lt;li&gt;A player.&lt;/li&gt;&#xA;&lt;li&gt;A monster.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Mechanics&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each turn, a player can:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Move: you can move north, east, west, or south, or not move at all. &lt;strong&gt;Attempting to move into an obstacle, or off the edge of the board, will result in you not moving at all.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Perform a special attack: you can either perform a ranged attack, an area attack, or no special attack at all.&lt;/li&gt;&#xA;&lt;li&gt;Battle: if you encounter an enemy, you can fight them.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Combat&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Whenever you enter a square that is already occupied by a monster or another player, you fight them. You and your opponent take turns attacking each other, with the first move being decided randomly. At any point in the combat, you may flee. Also, &lt;em&gt;once per battle&lt;/em&gt;, you may use a special attack which does double damage.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Damage is calculated using this formula:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Damage = Attacker's attack modifier + Random number from 1 to 5 - Defender's defence modifier&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Special Attacks&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are two special attacks: A ranged attack, that targets any enemy within 5 squares, and an area attack, that targets &lt;em&gt;all&lt;/em&gt; enemies within 2 squares. Damage is calculated using the same formula as for melee damage.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Monsters&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In the game, there are 5 monsters:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Goblin. Attack: 1; Defence: 1; HP: 1; moves randomly; 1XP for killing.&lt;/li&gt;&#xA;&lt;li&gt;Orc: Attack: 3; Defence: 2; HP: 5; follows players; 5XP for killing.&lt;/li&gt;&#xA;&lt;li&gt;Troll: Attack: 5; Defence: 2; HP: 10; moves randomly; 10XP for killing.&lt;/li&gt;&#xA;&lt;li&gt;Giant: Attack: 10; Defence: 5; HP: 15; follows players; 50XP for killing.&lt;/li&gt;&#xA;&lt;li&gt;Dragon: Attack: 20; Defence: 10; HP: 20; follows players; 100XP for killing.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;If you kill another player, you receive 100XP.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Attributes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When you create your bot, you must give it 5 attributes. They are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Attack: your attack bonus when using a melee attack.&lt;/li&gt;&#xA;&lt;li&gt;Ranged Attack: your attack bonus when using a ranged attack.&lt;/li&gt;&#xA;&lt;li&gt;Area Attack: your attack bonus when using an area attack.&lt;/li&gt;&#xA;&lt;li&gt;Defence: your defence bonus.&lt;/li&gt;&#xA;&lt;li&gt;Constitution: added to your HP (10 by default).&#xA;&lt;strong&gt;Note: If your bot's constitution is -10, it dies immediately.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;These attributes must sum up to 12. They may be anywhere between -10 and 22.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Implementation&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;public class MyBot extends RpgBot&#xA;{&#xA;    public static final int ATTACK = &amp;lt;insert here&amp;gt;;&#xA;    public static final int RANGED_ATTACK = &amp;lt;insert here&amp;gt;;&#xA;    public static final int AREA_ATTACK = &amp;lt;insert here&amp;gt;;&#xA;    public static final int DEFENCE = &amp;lt;insert here&amp;gt;;&#xA;    public static final int CONSTITUTION = &amp;lt;insert here&amp;gt;;&#xA;    // you can add something here&#xA;    public MyBot() { super(); }&#xA;    public Move move() {&#xA;        // insert here: return either Move.NORTH, Move.EAST,&#xA;        // Move.WEST, Move.SOUTH, or Move.NO_MOVE.&#xA;    }&#xA;    public SpecialAttack makeSpecialAttack() {&#xA;        // insert here: return either SpecialAttack.RANGED,&#xA;        // SpecialAttack.AREA, or SpecialAttack.NONE.&#xA;        // For ranged attacks, use setTargetX() and setTargetY()&#xA;        // to set the target beforehand.&#xA;    }&#xA;    public Attack attack(Entity m) {&#xA;        // insert here: return either Attack.NORMAL,&#xA;        // Attack.SPECIAL, or Attack.FLEE.&#xA;        // Entity m is one of the monster entities.&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here are the additional functions you get for your convenience:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Entity surroundings(int x, int y)&lt;/code&gt;- returns an entity representing what is located at that point. &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; range from -5 to +5, with 0, 0 being the square where you are. Trying to access outside that range will result in an &lt;code&gt;Exception&lt;/code&gt; being thrown. &lt;code&gt;Entity&lt;/code&gt; is one of:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;Entity.NONE&lt;/code&gt;- nothing.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Entity.OBSTACLE&lt;/code&gt;- an obstacle or the edge of the map.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Entity.PLAYER&lt;/code&gt;- either you or another player.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Entity.GOBLIN&lt;/code&gt;- a goblin.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Entity.ORC&lt;/code&gt;- an orc.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Entity.TROLL&lt;/code&gt;- a troll.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Entity.GIANT&lt;/code&gt;- a giant.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Entity.DRAGON&lt;/code&gt;- a dragon.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;At the beginning of the game, the field is randomly populated with 300 obstacles, 1000 goblins, 500 orcs, 100 trolls, 50 giants, and 10 dragons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;void setTargetX(int x)&lt;/code&gt; and &lt;code&gt;void setTargetY(int y)&lt;/code&gt;- set the target x and y indexes of the ranged weapon. Indexes range from -5 to 5, with 0, 0 being your location. Passing these functions an index outside the range will result in an &lt;code&gt;Exception&lt;/code&gt; being thrown.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Winning Condition&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The winner is the bot that acquires the most XP before it dies.&lt;/p&gt;&#xA;" OwnerUserId="21775" LastEditorUserId="68615" LastEditDate="2017-09-14T22:20:41.427" LastActivityDate="2017-09-14T22:20:41.427" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="1727" PostTypeId="2" ParentId="1723" CreationDate="2014-06-15T03:37:35.367" Score="-7" Body="&lt;h1&gt;Questions about designing golfing languages&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How can I design versatile string slicing in my stack-based golfing language?&lt;/li&gt;&#xA;&lt;li&gt;In what way can I/O be designed so that it is mostly unnecessary within most programs, but still flexible?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Arguments&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;For&lt;/strong&gt;: foo&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Against&lt;/strong&gt;: Questions of this kind more or less resemble discussions and as such are not good fit for the SE format.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="16294" LastEditDate="2014-06-16T02:51:09.097" LastActivityDate="2014-06-16T02:51:09.097" CommentCount="3" CommunityOwnedDate="2014-06-15T12:22:31.913" ContentLicense="CC BY-SA 3.0" />
  <row Id="1728" PostTypeId="2" ParentId="1723" CreationDate="2014-06-15T06:41:26.570" Score="-1" Body="&lt;h1&gt;Questions about improving algorithms&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/24922/circles-dividing-the-plane&quot;&gt;Circles dividing the plane&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/31673/build-a-pair-of-spies-that-will-throw-stones-into-a-river&quot;&gt;Build a pair of spies that will throw stones into a river&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Arguments&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;For&lt;/strong&gt;: They are on this site already but in many cases transformed into a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; in despair (&lt;em&gt;score is the complexity O(n) of your algorithm with n equals to 17&lt;/em&gt;) or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; just not to be closed.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Against&lt;/strong&gt;: There are only few good challenges of this kind and thus may be rare on this site. &lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Against&lt;/strong&gt;: It might motivate users to post challenges which are well-known in the literature and thus pose no value to the site.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="1490" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-06-15T06:41:26.570" CommentCount="4" CommunityOwnedDate="2014-06-15T06:41:26.570" ContentLicense="CC BY-SA 3.0" />
  <row Id="1729" PostTypeId="2" ParentId="1136" CreationDate="2014-06-15T20:36:00.673" Score="-8" Body="&lt;p&gt;Yes, if necessary, but better is to rename the languages. On the occasion that the esoteric nature of such languages doesn't bring them obnoxiously close to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1071/7550&quot;&gt;making up your own language&lt;/a&gt;, why not just fork the language and improve it by giving it a name that doesn't offend many people by, for example, treating lightly a deep physical expression of love between a husband and wife?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we could improve JavaScript we would, but backward compatibility prevents us. Languages without real-world code relying on them have no such restriction.&lt;/p&gt;&#xA;" OwnerUserId="7550" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2014-06-15T20:36:00.673" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1730" PostTypeId="2" ParentId="1541" CreationDate="2014-06-15T22:05:02.613" Score="-3" Body="&lt;h2&gt;I prefer Unicode.&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;Code length is usually counted in characters (Unicode code points), though some contests use bytes.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;My preference is to transcode the TI-83 program into Unicode, then count Unicode code points. For example, this &lt;a href=&quot;https://codegolf.stackexchange.com/a/5430/4065&quot;&gt;golfed program by mellamokb&lt;/a&gt; has 41 characters:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;:Prompt A,B,C&#xA;:(C-B)/(B-A→M&#xA;:Disp M,B-A*M&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The store arrow &lt;code&gt;→&lt;/code&gt; becomes U+2192 RIGHTWARDS ARROW, and the triangle &lt;code&gt;▶&lt;/code&gt; in operators like &lt;code&gt;▶Frac&lt;/code&gt; and &lt;code&gt;P▶Rx(&lt;/code&gt; becomes U+25B6 BLACK RIGHT-POINTING TRIANGLE. For Greek letters, pi &lt;code&gt;π&lt;/code&gt; is U+03C0 GREEK SMALL LETTER PI and theta &lt;code&gt;θ&lt;/code&gt; is U+03B8 GREEK SMALL LETTER THETA. For exponents, square &lt;code&gt;²&lt;/code&gt; is U+00B2 SUPERSCRIPT TWO and inverse &lt;code&gt;⁻¹&lt;/code&gt; is U+207B SUPERSCRIPT MINUS, U+00B9 SUPERSCRIPT ONE. Negation &lt;code&gt;⁻&lt;/code&gt; is U+207B SUPERSCRIPT MINUS. The root operator &lt;code&gt;ˣ√&lt;/code&gt; is U+02E3 MODIFIER LETTER SMALL X, U+221A SQUARE ROOT. The function &lt;code&gt;₁₀^(&lt;/code&gt; is U+2081 SUBSCRIPT ONE, U+2080 SUBSCRIPT ZERO, U+005E CIRCUMFLEX ACCENT, U+0028 LEFT PARENTHESIS.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I must count bytes, I may pick any encoding, such as UTF-8 or UTF-16, that includes enough characters for my program. So I pick UTF-8 if it takes the fewest bytes. Some, but not all, TI-BASIC programs fit in ISO-8859-7, an 8-bit Greek encoding. Pi &lt;code&gt;π&lt;/code&gt; is 2 bytes in UTF-8 but only 1 byte in ISO-8859-7. ISO-8859-7 lacks characters like the store arrow &lt;code&gt;→&lt;/code&gt;, but if my program has no store arrows, I might count ISO-8859-7 bytes.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What is a TI-83 character?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In the calculator manual for a TI-83 Plus, page 15-8 says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; An instruction or function name, such as &lt;strong&gt;sin(&lt;/strong&gt; or &lt;strong&gt;cos(&lt;/strong&gt;, counts as as one character.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This definition is clear. Each instruction, like &lt;code&gt;If&lt;/code&gt; or &lt;code&gt;While&lt;/code&gt;, is one character in the calculator. Each function, like &lt;code&gt;tan⁻¹(&lt;/code&gt;, and each operator, like &lt;code&gt;nPr&lt;/code&gt;, is one character in the calculator.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;length(&lt;/code&gt; function in the catalog can answer all questions about character count. &lt;code&gt;length(&quot; nPr &quot;)&lt;/code&gt; returns 1, so &lt;code&gt;nPr&lt;/code&gt; is one character.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I cannot answer questions about byte count. The calculator seems to have more than 256 characters, so I reject the idea that each character fits in a byte of 8 bits. Anyone who says that &lt;code&gt;sin(&lt;/code&gt; is 4 characters and 1 byte is wrong about the characters, and might be wrong about the bytes. The calculator might use a multibyte encoding, or it might use a larger byte size, like 12 bits.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I prefer to count Unicode characters, not calculator characters. For bytes, I prefer to encode the Unicode characters in UTF-8 or perhaps ISO-8859-7.&lt;/p&gt;&#xA;" OwnerUserId="4065" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2014-06-15T22:05:02.613" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1731" PostTypeId="2" ParentId="1722" CreationDate="2014-06-15T22:32:47.523" Score="-3" Body="&lt;p&gt;This question is about spoilers that explain answers to some &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is an example of a spoiler:&lt;/p&gt;&#xA;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;  &lt;p&gt; Snape kills Luke Skywalker's father! Also, the Titanic hits the Hindenburg!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Firefox for Android works. If I tap the spoiler, the text appears. If I then tap somewhere else, the text disappears.&lt;/p&gt;&#xA;" OwnerUserId="4065" LastActivityDate="2014-06-15T22:32:47.523" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1732" PostTypeId="2" ParentId="1723" CreationDate="2014-06-16T02:54:20.633" Score="-17" Body="&lt;h1&gt;Questions about the history of golfing languages&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Was APL designed to be as concise as possible?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Arguments&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;For&lt;/strong&gt;: Adds variety to the site&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Against&lt;/strong&gt;: Very different from other types of questions&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="16294" LastActivityDate="2014-06-16T02:54:20.633" CommentCount="0" CommunityOwnedDate="2014-06-16T02:54:20.633" ContentLicense="CC BY-SA 3.0" />
  <row Id="1734" PostTypeId="1" AcceptedAnswerId="1735" CreationDate="2014-06-16T14:26:44.907" Score="12" ViewCount="225" Body="&lt;p&gt;I've just posted a popularity-contest question, and I'm curious about the rules on myself casting a vote. Am I allowed/should I vote on my favourite answer, or should I leave it up to everyone else's votes?&lt;/p&gt;&#xA;" OwnerUserId="25193" LastEditorUserId="4372" LastEditDate="2014-06-18T23:46:22.230" LastActivityDate="2014-06-18T23:46:22.230" Title="Can I cast a vote on my own popularity contest?" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1735" PostTypeId="2" ParentId="1734" CreationDate="2014-06-16T14:34:07.710" Score="14" Body="&lt;p&gt;Yes, by all means cast your vote(s), both up &lt;em&gt;and&lt;/em&gt; down as you feel appropriate.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2014-06-16T14:34:07.710" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1737" PostTypeId="1" CreationDate="2014-06-16T20:32:14.470" Score="-5" ViewCount="558" Body="&lt;p&gt;I counted the number of wins in the code-golf contests. Only questions with more than 2 answers and that have a selected answer (marked green) were counted. Here is the result:&#xA;&lt;img src=&quot;http://s11.postimg.org/s4axjx477/codegolf_wins.png&quot; alt=&quot;wins&quot;&gt;&lt;br&gt;&#xA;Do you find this unfair?&lt;/p&gt;&#xA;" OwnerUserId="25130" LastEditorUserId="25130" LastEditDate="2014-06-16T21:03:43.947" LastActivityDate="2014-06-19T02:04:25.847" Title="Code-golf contest is biased towards certain languages" Tags="|discussion|" AnswerCount="2" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1738" PostTypeId="2" ParentId="1737" CreationDate="2014-06-16T21:09:53.803" Score="16" Body="&lt;p&gt;Welcome to PPCG! What you're saying isn't new, it's been talked about before. The biggest takeaway I can give you is &quot;&lt;strong&gt;So What?&lt;/strong&gt;&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Looking at your answers so far, it seems you're a C# kind of guy. I use Java a lot, even for golfing, so I know how you feel. Does it suck that there are languages that aren't as verbose? Sure! Does it really matter? Personally, I don't think so.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you &lt;em&gt;really&lt;/em&gt; want the green checkmark, you're going to need to learn a more concise language, it's really as simple as that. I've long since stopped caring about it. If/when I submit a golfed answer, I pit it against similar languages. I feel good if mine's the shortest Java answer, and I feel &lt;em&gt;great&lt;/em&gt; if it beats Python. Normally that's enough to attract upvotes in itself. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have no illusions that I'll take the crown, but I just don't care. Golfing something down in Java is a good challenge to me, and a good way to learn non-obvious features of the language. &lt;em&gt;That's&lt;/em&gt; why I like it, not for some silly checkmark.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Remember, an accept is only worth 1.5 upvotes. If you do something creative with your language of choice, most likely you'll earn upvotes and the 15 rep ceases to be an issue. &lt;/p&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2014-06-16T21:09:53.803" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1739" PostTypeId="2" ParentId="1061" CreationDate="2014-06-17T14:18:29.783" Score="140" Body="&lt;h1&gt;Fake random numbers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Pretty much any &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; challenge involving random numbers will have someone post this one:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;int getRandomNumber()&#xA;{&#xA;   return 4;   //chosen by fair dice roll.&#xA;               //guaranteed to be random.&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It was funny when &lt;a href=&quot;http://xkcd.com/221/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Randall Munroe did it&lt;/a&gt; 7 years ago, not anymore. It has been used in &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=guaranteed+to+be+random.&quot;&gt;many challenges&lt;/a&gt;, some even &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=Chosen+by+fair+dice+roll.&quot;&gt;multiple times&lt;/a&gt; in the &lt;em&gt;same&lt;/em&gt; challenge.&lt;/p&gt;&#xA;" OwnerUserId="11376" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2014-06-17T14:18:29.783" CommentCount="19" CommunityOwnedDate="2014-06-17T14:18:29.783" ContentLicense="CC BY-SA 3.0" />
  <row Id="1740" PostTypeId="2" ParentId="2140" CreationDate="2014-06-17T15:11:53.690" Score="0" Body="&lt;h1&gt;Find the a Strong Prime&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;What's a String Prime? Wikipedia:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;In cryptography, a prime number p is strong if the following conditions are satisfied.[1]&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;code&gt;p&lt;/code&gt; is sufficiently large to be useful in cryptography; typically this requires &lt;code&gt;p&lt;/code&gt; to be too large for plausible computational resources to enable a cryptanalyst to factorise products of &lt;code&gt;p&lt;/code&gt; multiplied by other strong primes.&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;p-1&lt;/code&gt; has large prime factors. That is, &lt;code&gt;p = a_1 q_1 + 1&lt;/code&gt; for some integer &lt;code&gt;a_1&lt;/code&gt; and large prime &lt;code&gt;q_1&lt;/code&gt;.&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;q_1-1&lt;/code&gt; has large prime factors. That is, &lt;code&gt;q_1 = a_2 q_2 + 1&lt;/code&gt; for some integer &lt;code&gt;a_2&lt;/code&gt; and large prime &lt;code&gt;q_2&lt;/code&gt;.&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;p+1&lt;/code&gt; has large prime factors. That is, &lt;code&gt;p = a_3 q_3 - 1&lt;/code&gt; for some integer &lt;code&gt;a_3&lt;/code&gt; and large prime &lt;code&gt;q_3&lt;/code&gt;.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program must receive a number of bits &lt;code&gt;16 &amp;lt;= x &amp;lt;= 60&lt;/code&gt;. This can be a method definition, command line argument, or stdin.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Print and/or return a strong prime of exactly the given bit length.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Other rules:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All variables in the below conditions refer to the wikipedia variables.&lt;/li&gt;&#xA;&lt;li&gt;Do not worry about condition 1 from wikipedia.&lt;/li&gt;&#xA;&lt;li&gt;For the rest of these rules, the notation &lt;code&gt;|x|&lt;/code&gt; means the number of bits in &lt;code&gt;x&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;|q_2| &amp;gt;= 0.4 |p|&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You may not use any external tools. Other input data or precalculation counts against the length of your program even if it's in a different file or command line.&lt;/li&gt;&#xA;&lt;li&gt;You are allowed (and even encouraged) to &lt;a href=&quot;http://people.csail.mit.edu/rivest/pubs/RS01.version-1999-11-22.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;use the algorithms in this paper&lt;/a&gt; (thanks @PeterTaylor!) but it is not a requirement.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="17249" LastEditorUserId="17249" LastEditDate="2014-06-17T20:13:18.890" LastActivityDate="2014-06-17T20:13:18.890" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1741" PostTypeId="2" ParentId="112" CreationDate="2014-06-17T21:03:54.377" Score="1" Body="&lt;p&gt;I like to paste the code into &lt;a href=&quot;http://www.charactercountonline.com/&quot; rel=&quot;nofollow&quot;&gt;charactercountonline.com&lt;/a&gt; . I especially enjoy that I don't need to include the whole file in the count, because I often include useless information that doesn't need to be counted (e.g. in Java: &lt;code&gt;package codegolf;&lt;/code&gt;).&lt;/p&gt;&#xA;" OwnerUserId="9498" LastActivityDate="2014-06-17T21:03:54.377" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1742" PostTypeId="2" ParentId="2140" CreationDate="2014-06-17T23:45:49.533" Score="4" Body="&lt;p&gt;&lt;strong&gt;Save your job in QA!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You work for a software company's QA department, writing automated acceptance tests for their products. One day, your boss calls you in to his office, and to your astonishment tells you that your entire department is being &quot;rationalized&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;But why?&quot; You ask&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;One of the fellows in development told me about these new-fangled things called 'unit tests'. Apparently, you can test each little bit of code as you write it. And since the developers do it themselves, that means we don't need a QA department any more.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You hesitate. &quot;Well unit tests &lt;em&gt;are&lt;/em&gt; a good idea, but you still need-&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;Nonsense!&quot; Your boss blusters, cutting you off mid-sentence &quot;If we can test every little bit of the code, we don't need to test the whole lot again!&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your boss is adamant, but after a bit of wrangling, he grants you one chance: later that day, you will present him with a demonstration proving that unit tests alone aren't enough to test your product.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to write the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A &lt;em&gt;system under test&lt;/em&gt; with more than one part&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Unit tests&lt;/em&gt; for each part&lt;/li&gt;&#xA;&lt;li&gt;One or more &lt;em&gt;integration tests&lt;/em&gt;, consisting of multiple parts working together&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The unit tests should appear to prove that the system under has one behaviour, while the integration tests should prove that it actually has another.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Guidelines&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;strong&gt;popularity contest&lt;/strong&gt;, and the following criteria should be taken into account for rating the answers:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The trick leading to the unit tests having different conclusions to the integration tests should be primarily in the system under test. Your boss won't be impressed if all you did was insert a bug into one of your tests!&lt;/li&gt;&#xA;&lt;li&gt;The more convincingly the individual unit tests and integration tests appear to prove what they are each attempting to test, the better.&lt;/li&gt;&#xA;&lt;li&gt;The more convincingly the conclusions of the integration tests appear to contradict the unit tests, the better. For example, an answer where both the unit tests and integration tests use the same inputs to the system under test would probably be better than one that relies on them using different inputs. An answer where the integration test tests some behaviour of the system which was clearly not covered by the unit tests would also not be a very good answer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Tests may be written in whatever format is appropriate for the language you are using. Two possibilities which would work in many situations would be:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Tests have no return value, but throw an exception (or equivalent) if they fail&lt;/li&gt;&#xA;&lt;li&gt;Tests return &lt;code&gt;true&lt;/code&gt; for a pass or &lt;code&gt;false&lt;/code&gt; for a fail&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="21396" LastActivityDate="2014-06-17T23:45:49.533" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1743" PostTypeId="2" ParentId="112" CreationDate="2014-06-18T09:45:46.810" Score="1" Body="&lt;p&gt;I usually use Sublime for counting (even if I'm not writing the code in it). I paste the code I want to count into a new file. Then, if I'm sure that my code still works without any whitespace whatsoever, I prepare it with&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;kbd&gt;Ctrl&lt;/kbd&gt; +&lt;kbd&gt;H&lt;/kbd&gt; (open Find &amp;amp; Replace)&lt;/li&gt;&#xA;&lt;li&gt;(optionally) &lt;kbd&gt;Alt&lt;/kbd&gt; + &lt;kbd&gt;R&lt;/kbd&gt; (activate regex search)&lt;/li&gt;&#xA;&lt;li&gt;&lt;kbd&gt;\&lt;/kbd&gt; &lt;kbd&gt;s&lt;/kbd&gt; (search for whitespace)&lt;/li&gt;&#xA;&lt;li&gt;(optionally) &lt;kbd&gt;Tab&lt;/kbd&gt; &lt;kbd&gt;Del&lt;/kbd&gt; (clear replacement string)&lt;/li&gt;&#xA;&lt;li&gt;&lt;kbd&gt;Ctrl&lt;/kbd&gt; + &lt;kbd&gt;Alt&lt;/kbd&gt; + &lt;kbd&gt;Enter&lt;/kbd&gt; (replace all)&lt;/li&gt;&#xA;&lt;li&gt;&lt;kbd&gt;Ctrl&lt;/kbd&gt; + &lt;kbd&gt;A&lt;/kbd&gt; (select all)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Now in the status bar at the bottom you'll see &quot;x characters selected&quot;. This sequence of key presses becomes really mechanical after a while, and when you're doing it repeatedly, because you've been golfing more in the meantime, you can actually skip steps 2 to 4. Of course, some of those combinations may be configured differently on your machine, but I think they are the default key bindings in Windows.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is particularly useful for Mathematica answers, because if you paste stuff out of Mathematica, you get &lt;em&gt;tons&lt;/em&gt; of unwanted whitespace.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-06-18T09:45:46.810" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1747" PostTypeId="2" ParentId="1737" CreationDate="2014-06-19T02:04:25.847" Score="1" Body="&lt;p&gt;Thank you for making this pie chart.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some languages are better than code golf than others, so it helps to know which languages win the most code golf contests. If one identifies those languages, one can learn those languages (and become better at code golf), or one can make contests that frustrate those languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I often see GolfScript and J, and suspect that those two languages are the best.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This site does not provide a language ranking, but golf.shinh.org does. There, the current &lt;a href=&quot;http://golf.shinh.org/lranking.rb&quot; rel=&quot;nofollow noreferrer&quot;&gt;language ranking&lt;/a&gt; (at 18 June 2014) is:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;GolfScript&lt;/li&gt;&#xA;&lt;li&gt;J&lt;/li&gt;&#xA;&lt;li&gt;Perl&lt;/li&gt;&#xA;&lt;li&gt;Ruby&lt;/li&gt;&#xA;&lt;li&gt;Python&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;I notice that Ruby is 4th and Goruby is 12th, though &lt;a href=&quot;https://codegolf.stackexchange.com/a/9289/4065&quot;&gt;Goruby&lt;/a&gt; is just a golfed variant of Ruby. It seems obvious that Goruby should rank higher than Ruby, if more golfers would try Goruby.&lt;/p&gt;&#xA;" OwnerUserId="4065" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-06-19T02:04:25.847" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1748" PostTypeId="1" CreationDate="2014-06-19T15:58:12.240" Score="4" ViewCount="61" Body="&lt;p&gt;The count of delete votes needed to delete a post is not always displayed correctly in the tooltip. This is what happened when I found this bug:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;I was in the &quot;delete&quot; tab in the tools, and it said that a question needed 2 votes to delete.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I navigated to the post, and the tooltip of the &quot;delete&quot; link said this:&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/MLfOn.png&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;And after voting to delete it, it wasn't deleted, now it says that it needs one more delete vote (which is then the correct number).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This appears also to be the case for other questions that need two delete votes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this a bug, or am I missing something?&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="68942" LastEditDate="2021-06-04T02:10:31.357" LastActivityDate="2021-06-04T02:10:31.357" Title="Incorrect delete vote count in tooltip" Tags="|bug|status-completed|vote-to-delete|" AnswerCount="0" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="1749" PostTypeId="1" CreationDate="2014-06-19T18:03:10.567" Score="7" ViewCount="367" Body="&lt;p&gt;If I were to pass your program an integer array as input, what format would you prefer? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I understand that this question is primarily opinion-based, but it is also incredibly useful information for those of us who want to write challenges that appeal to the largest number of people.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastActivityDate="2014-06-27T15:24:25.890" Title="Most Preferred Input Format" Tags="|discussion|" AnswerCount="8" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1750" PostTypeId="2" ParentId="1749" CreationDate="2014-06-19T18:03:10.567" Score="9" Body="&lt;h1&gt;JSON&lt;/h1&gt;&#xA;&lt;p&gt;For example, this 3 by 3 array of integers:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[1,2,3],[4,5,6],[7,8,9]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;See format at &lt;a href=&quot;http://json.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://json.org/&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-06-19T18:37:33.907" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1751" PostTypeId="2" ParentId="1749" CreationDate="2014-06-19T18:04:33.543" Score="4" Body="&lt;h1&gt;Comma-Separated, Curly-Brace Wrapped&lt;/h1&gt;&#xA;&lt;p&gt;For example, this 3 by 3 array of integers:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;{{1,1,1},{2,2,2},{3,3,3}}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-06-19T23:54:45.253" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1752" PostTypeId="2" ParentId="1749" CreationDate="2014-06-19T18:09:21.347" Score="11" Body="&lt;h1&gt;.CSV&lt;/h1&gt;&#xA;&lt;p&gt;Terminated with a newline.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1,1,1\n2,2,2\n3,3,3\n&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You can see the RFC at &lt;a href=&quot;https://www.rfc-editor.org/rfc/rfc4180&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.rfc-editor.org/rfc/rfc4180&lt;/a&gt;, but it looks barbaric. There is no &amp;quot;official&amp;quot; standard.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2021-10-07T06:47:20.403" LastActivityDate="2014-06-19T23:54:56.870" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1753" PostTypeId="2" ParentId="1749" CreationDate="2014-06-19T18:12:24.023" Score="3" Body="&lt;h2&gt;Space-separated, square-bracket wrapped&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[1 2 3][4 5 6][7 8 9]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is the format which GolfScript can evaluate most easily, so naturally GolfScript users will prefer it.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-06-19T18:12:24.023" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1754" PostTypeId="2" ParentId="1749" CreationDate="2014-06-19T18:19:21.807" Score="2" Body="&lt;h1&gt;Space separated:&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3 4 5 6 7 8 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;which would give the 3x3&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 4 7&#xA;2 5 8&#xA;3 6 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(at least it will if you're a column-major programmer).&lt;/p&gt;&#xA;" OwnerUserId="11376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-06-19T18:19:21.807" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="1755" PostTypeId="2" ParentId="2140" CreationDate="2014-06-19T18:25:47.937" Score="1" Body="&lt;p&gt;Write a program to solve equations (well, sort of; read on), taken as a command line parameter. Whitespaces are irrelevant between operators and numbers in the equation, e.g. &lt;code&gt;1+2&lt;/code&gt; and &lt;code&gt;1\t + 2&lt;/code&gt; (where &lt;code&gt;\t&lt;/code&gt; is a tab) are both fine. There can be any number of variables, but they will always be one lower-case letter. You can assume always exactly two sides of the equation, but the sign can be &lt;code&gt;=&lt;/code&gt; &lt;code&gt;&amp;gt;&lt;/code&gt; &lt;code&gt;≥&lt;/code&gt; &lt;code&gt;&amp;lt;&lt;/code&gt; or &lt;code&gt;≤&lt;/code&gt; (don't forget that the sign of an inequality flips when you multiply or divide both sides by a negative number). You must support the following operations:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;a+b&lt;/code&gt; — addition&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;a-b&lt;/code&gt; — subtraction&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;a*b&lt;/code&gt; — multiplication (cannot appear as &lt;code&gt;ab&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;a/b&lt;/code&gt; — division&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;b^n&lt;/code&gt; — exponentiation, and you can assume that:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;n&lt;/code&gt; will never be a variable&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;n&lt;/code&gt; will always be an integer, and remember that a negative &lt;code&gt;n&lt;/code&gt; means &lt;code&gt;1/(b^-n)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;a*(b*c-d)&lt;/code&gt; - parenthesis and the order of operations (PEMDAS)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Support for imaginary numbers is not required, so your program can vomit for something like &lt;code&gt;(-4)^(1/2)&lt;/code&gt; (sqrt of -4). Irrational numbers must be rounded off to at least the nearest hundred-thousanth (so &lt;code&gt;2^0.5&lt;/code&gt; becomes &lt;code&gt;1.41421&lt;/code&gt;), and you can apply the same to fractions if you so choose. You don't have to support irrational numbers or fractions, so your program can vomit for something like &lt;code&gt;(-4)^(1/2)&lt;/code&gt;, and can round &lt;code&gt;1/3&lt;/code&gt; to &lt;code&gt;0.33333&lt;/code&gt; (5 decimal places). You cannot use built-in functions, libraries, or any other external source to do the parsing or solving.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program must be called via &lt;code&gt;program v &quot;e&quot;&lt;/code&gt; where &lt;code&gt;v&lt;/code&gt; is the variable to solve for and &lt;code&gt;&quot;e&quot;&lt;/code&gt; is the equation (as one parameter). Assume that &lt;code&gt;v&lt;/code&gt; will appear in the equation. Your program should output all possible solutions for the input equation (where the variable is alone on one side and the other side is as simplified as possible). Here are some example equations and a possible solution for each:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;a*(3-1)=1&lt;/code&gt; for &lt;code&gt;a&lt;/code&gt; -&gt; &lt;code&gt;a*2=1&lt;/code&gt; -&gt; (output) &lt;code&gt;a=1/2&lt;/code&gt; or &lt;code&gt;a=0.5&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x*y/2-5&amp;gt;1&lt;/code&gt; for &lt;code&gt;x&lt;/code&gt; -&gt; &lt;code&gt;x*y/2&amp;gt;6&lt;/code&gt; -&gt; &lt;code&gt;x*y&amp;gt;12&lt;/code&gt; -&gt; (output) &lt;code&gt;x&amp;gt;12/y&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x^(3/2)=2*x&lt;/code&gt; for &lt;code&gt;x&lt;/code&gt; -&gt; &lt;code&gt;x^(3/2)/x=2&lt;/code&gt; -&gt; &lt;code&gt;x^0.5=2&lt;/code&gt; -&gt; (output) &lt;code&gt;x=4&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(x+1)^2=4&lt;/code&gt; for &lt;code&gt;x&lt;/code&gt; -&gt; &lt;code&gt;x+1=-2, x+1=2&lt;/code&gt; -&gt; (output) &lt;code&gt;x=-3, x=1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="8701" LastEditorUserId="8701" LastEditDate="2014-06-19T23:11:00.063" LastActivityDate="2014-06-19T23:11:00.063" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="1756" PostTypeId="2" ParentId="1749" CreationDate="2014-06-19T21:20:24.880" Score="12" Body="&lt;h1&gt;Comma, Semicolon separated&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1,2,3;4,5,6;7,8,9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The logical separation of comma-delimited lists (in the English language) is semicolons. And this format makes it easy (and roughly equal between languages) to parse, split on &lt;code&gt;;&lt;/code&gt; and &lt;code&gt;,&lt;/code&gt;. Additionally, it is easy to add more dimensions: simply add another delimiter.&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="9498" LastEditDate="2014-06-19T22:27:20.167" LastActivityDate="2014-06-19T22:27:20.167" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1758" PostTypeId="2" ParentId="1305" CreationDate="2014-06-20T03:36:50.853" Score="15" Body="&lt;p&gt;I know that this is strikingly similar to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1306/14668&quot;&gt;Chris's answer&lt;/a&gt;, but I feel it's different enough that it merits its own answer.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;TL;DR&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Make a new domain (sandbox.codegolf.stackexchange.com) for hosting the sandbox. Use the standard SE Meta template for the site, with answers disabled, comments always expanded, and rep only affected by comments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Read on for more details about this proposal.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I would suggest a new domain, sandbox.codegolf.stackexchange.com, for hosting the sandbox. I feel that the same general Meta template for SE sites could be used for it, but with the following differences:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Answers are disabled. They would be rather irrelevant in the sandbox.&lt;/li&gt;&#xA;&lt;li&gt;Comments are always expanded, given the fact that increased prevalence wouldn't risk obfuscating answers because they don't exist.&lt;/li&gt;&#xA;&lt;li&gt;A relatively small amount of code could be introduced to make an &quot;easy-post&quot; button on sandbox questions for the OP to use the current question as a template to create a new one on the main site, as a convenience. To attempt to keep sandbox artifacts out of new questions, show a warning dialog if no changes were made to the question.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;First impressions of the dialog should make it serious enough that people don't blindly ignore it.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Rep should be wholly unaffected by upvotes and downvotes, and more generally, comments and approved edits should be the primary ways to generate rep from it.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Many features of the current Meta format used throughout SE would still be enormously useful in this sandbox proposal.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Upvotes would retain their significance in helping judge if questions are ready.&lt;/li&gt;&#xA;&lt;li&gt;Downvotes would retain their purpose of helping get rid of bad, impossible-to-fix questions. Comments should explain why, as already is the case.&lt;/li&gt;&#xA;&lt;li&gt;Suggested edits would enable better and more precise help with fixing their questions before they are posted in the regular site.&lt;/li&gt;&#xA;&lt;li&gt;Comments would retain their purpose of allowing people to help.&lt;/li&gt;&#xA;&lt;li&gt;Having them as actual questions would permit moderators to migrate poor questions to the sandbox.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Migration should automatically delete/ignore all posted answers to focus on fixing the question. It could then be reposted on the main site as a quality question.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Making proposed questions as community wikis could encourage collaboration to make a much better question without the hassle of a proposed edit queue. Some people may want their questions intentionally more open to collaboration, a la wiki, while others may want extra help with larger rule sets.&lt;/li&gt;&#xA;&lt;li&gt;The question format would permit users to immediately tag their questions appropriately.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Answer headers giving the proposed challenge's types are &lt;em&gt;already&lt;/em&gt; common in the sandbox.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;It would be possible to filter and search questions, as in other SE sites. This would make moderator's &lt;em&gt;and&lt;/em&gt; users' life easier to keep good question quality by:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;allowing people to pick particular types they prefer to work with,&lt;/li&gt;&#xA;&lt;li&gt;allowing people who enjoy less popular types like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; to improve their question quality with less community interference over its current state,&lt;/li&gt;&#xA;&lt;li&gt;allowing fans of challenge types without as clear winning conditions, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, to shape them to be more polished over time, making the winning conditions clearer and easier to judge,&lt;/li&gt;&#xA;&lt;li&gt;etc...&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Using a slightly modified version of the original SE format for the sandbox could make it far more accessible and easier to use for &lt;em&gt;both&lt;/em&gt; users and moderators. It would also make it more feasible to manage at large scale (maybe even SO level...).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;On a related side note, if the easy-post button is implemented, users should probably have a minimum rep to post a question on the main site without going through the sandbox first.&lt;/p&gt;&#xA;" OwnerUserId="14668" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2016-10-24T18:40:20.060" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1760" PostTypeId="1" AcceptedAnswerId="1761" CreationDate="2014-06-20T13:08:39.680" Score="3" ViewCount="100" Body="&lt;p&gt;Am I supposed to be able to favorite my own question? It doesn't seem right...&lt;/p&gt;&#xA;" OwnerUserId="25358" LastEditorUserId="66833" LastEditDate="2021-04-09T16:59:48.460" LastActivityDate="2021-04-09T16:59:48.460" Title="Am I supposed to be able to favorite my own questions?" Tags="|support|challenges|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1761" PostTypeId="2" ParentId="1760" CreationDate="2014-06-20T13:10:50.613" Score="8" Body="&lt;p&gt;Favouriting a question simply means you want to see notifications of any new answers or edits to that question. (&lt;a href=&quot;https://meta.stackexchange.com/q/53585/13&quot;&gt;More info here.&lt;/a&gt;) So it's not a problem to favourite your own questions.&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-06-20T13:10:50.613" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1765" PostTypeId="1" AcceptedAnswerId="1767" CreationDate="2014-06-21T10:16:08.467" Score="0" ViewCount="117" Body="&lt;p&gt;I recently registered on this site, and I encountered two bugs,&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First is that I cannot see a link to meta site on my profile page&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/vZya1.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And secondly, I earned association rep of 100, so the total score was 101, but I was not able &lt;a href=&quot;https://codegolf.stackexchange.com/q/21835/26389&quot;&gt;to answer a community protected question&lt;/a&gt; unless I was voted up, is that status by design or 100 rep isn't considered to answer protected questions?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I was able to answer only when I was upvoted once&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Ok, seems like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/797/protected-question-and-association-bonus-bug?rq=1&quot;&gt;Related question link provided me an answer&lt;/a&gt; but the first issue isn't solved, I had to type meta word before codegolf to get here&lt;/p&gt;&#xA;" OwnerUserId="26389" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-06-21T11:33:18.560" Title="Multiple bugs in my profile" Tags="|bug|status-bydesign|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1766" PostTypeId="2" ParentId="1765" CreationDate="2014-06-21T10:50:18.793" Score="0" Body="&lt;p&gt;The site navigation to meta has changed as of the &lt;a href=&quot;https://meta.stackexchange.com/q/198613/13&quot;&gt;new topbar&lt;/a&gt;, where you click on the top-left site selector to get to meta. &lt;a href=&quot;https://meta.stackexchange.com/a/198758/13&quot;&gt;Many people dislike not being able to change to meta with one click, though.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(This is separate to the issue of not seeing the &quot;Meta User&quot; link in your profile page, of course, which is already addressed by plannapus's comment.)&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-06-21T10:50:18.793" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1767" PostTypeId="2" ParentId="1765" CreationDate="2014-06-21T10:53:32.020" Score="2" Body="&lt;p&gt;The Meta account is only created after you visit the meta site, so the link only appears after you do so.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The association bonus does not count towards the privilege to answer protected questions:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;sup&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/new-user&quot;&gt;https://codegolf.stackexchange.com/help/privileges/new-user&lt;/a&gt;&lt;/sup&gt;&lt;br&gt;&#xA;  Note that one needs to earn 10 rep on the site to be able to answer a protected question. The association bonus does not count.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-06-21T10:53:32.020" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1769" PostTypeId="2" ParentId="2140" CreationDate="2014-06-21T16:20:15.470" Score="1" Body="&lt;h1&gt;Build a GenericScript Compiler&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to build part of a compiler for the new programming language GenericScript. In this challenge you are only required to check the input source code for syntax errors and not build a running program.&lt;/p&gt;&#xA;&lt;p&gt;Given the source code for a GenericScript program as input, parse the source code to check that it conforms to the syntax rules for the language. The syntax definition for GenericScript is below. If a part of the source code is found to be invalid, a message must be displayed informing the programmer that there is a mistake.&lt;/p&gt;&#xA;&lt;p&gt;Since the challenge is for syntax only, you are not required to check for correct usage of variables e.g. use of undeclared variable. Only the syntax rules specified need to be checked.&lt;/p&gt;&#xA;&lt;p&gt;A bonus will be given if the output message includes the line of code where the problem occurs.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Win Criteria&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is code golf. Shortest code wins. Implementing the line number bonus allows you to multiply you score by 0.8 e.g. only 80% of your code length will be counted as your score.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Syntax&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&amp;quot;C&amp;quot; style whitespace rules apply i.e. multiple whitespace characters are treated the same as a single whitespace character &amp;amp; whitespace is only required in between tokens if it would otherwise cause syntax ambiguity.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Program             = Statement&#xA;Statement           = Assignment | If | Output | Sequence | While | StringDeclaration | BooleanDeclaration&#xA;Assignment          = Identifier &amp;quot;=&amp;quot; (String | Bool); &#xA;StringDeclaration   = &amp;quot;string&amp;quot; Identifier &amp;quot;=&amp;quot; String &amp;quot;;&amp;quot;&#xA;BooleanDeclaration  = &amp;quot;bool&amp;quot; Identifier &amp;quot;=&amp;quot; Bool &amp;quot;;&amp;quot;&#xA;If                  = &amp;quot;if(&amp;quot; Bool &amp;quot;)&amp;quot; Statement [&amp;quot;else&amp;quot; Statement]&#xA;While               = &amp;quot;while(&amp;quot; Bool &amp;quot;)&amp;quot; Statement&#xA;Output              = &amp;quot;print(&amp;quot; String &amp;quot;);&amp;quot;&#xA;Sequence            = &amp;quot;{&amp;quot; [SequenceContent] &amp;quot;}&amp;quot;&#xA;SequenceContent     = Statement [SequenceContent]&#xA;Identifier          = {Any sequence of alphanumeric characters with at least 7 characters (all language keywords are shorter than this) }&#xA;Bool                = BoolConstant | OperatorAnd | OperatorOr | OperatorNot | StringEquals | BoolEquals | Identifier&#xA;BoolConstant        = &amp;quot;true&amp;quot; | &amp;quot;false&amp;quot;&#xA;OperatorAnd         = Bool &amp;quot;&amp;amp;&amp;amp;&amp;quot; Bool&#xA;OperatorOr          = Bool &amp;quot;||&amp;quot; Bool&#xA;OperatorNot         = &amp;quot;!&amp;quot; Bool&#xA;StringEquals        = String &amp;quot;==&amp;quot; String&#xA;BoolEquals          = Bool &amp;quot;==&amp;quot; Bool&#xA;String              = StringConstant | OperatorConcat | Input | Identifier&#xA;StringConstant      = &amp;quot;'&amp;quot;StringConstContent&amp;quot;'&amp;quot;&#xA;StringConstContent  = &amp;quot;\\&amp;quot; | &amp;quot;\'&amp;quot; | Character [StringConstContent]&#xA;Character           = {Any character except for &amp;quot;\&amp;quot; and &amp;quot;'&amp;quot;}&#xA;OperatorConcat      = String &amp;quot;&amp;amp;&amp;quot; String&#xA;Input               = &amp;quot;read()&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test Input&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Valid Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;print('What is your name?')&#xA;string myInput = read();&#xA;print('Hello ' &amp;amp; myInput);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Invalid Syntax:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;If(read() == 'DoTask1')&#xA;  print('Executing you'r command');&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="21713" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-07-11T21:13:55.933" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1772" PostTypeId="5" CreationDate="2014-06-23T09:36:42.053" Score="0" Body="&lt;p&gt;Bookmarked questions are marked by clicking the star below the question's score. They are searchable by using the &lt;code&gt;inbookmarks:&amp;lt;user&amp;gt;&lt;/code&gt; query (where &lt;code&gt;&amp;lt;user&amp;gt;&lt;/code&gt; could be &lt;code&gt;mine&lt;/code&gt; or &lt;code&gt;me&lt;/code&gt; to search your personal set of bookmarks).&lt;/p&gt;&#xA;&lt;p&gt;Bookmarks used to be referred to as &amp;quot;favorites&amp;quot; in the system, so the &lt;a href=&quot;/questions/tagged/favorites&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;favorites&amp;#39;&quot; rel=&quot;tag&quot;&gt;favorites&lt;/a&gt; tag is a synonym of this tag, &lt;code&gt;infavorites:&amp;lt;user&amp;gt;&lt;/code&gt; has the same functionality as &lt;code&gt;inbookmarks:&amp;lt;user&amp;gt;&lt;/code&gt;, etc.&lt;/p&gt;&#xA;" OwnerUserId="160" LastEditorUserId="16766" LastEditDate="2021-06-26T01:42:36.610" LastActivityDate="2021-06-26T01:42:36.610" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="1773" PostTypeId="4" CreationDate="2014-06-23T09:36:42.053" Score="0" Body="This tag is for questions about the bookmark question feature. Bookmarking is a system that allows users to save a question to be more easily found at a later date" OwnerUserId="160" LastEditorUserId="66833" LastEditDate="2021-06-26T01:17:11.810" LastActivityDate="2021-06-26T01:17:11.810" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="1774" PostTypeId="1" CreationDate="2014-06-23T13:26:57.057" Score="1" ViewCount="77" Body="&lt;p&gt;I've just picked a winner for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/31836/random-script-that-isnt-actually-random&quot;&gt;this contest&lt;/a&gt;, and I was think of other ones along similar lines, and I thought about a script what would randomly pick someone from the list, but would never pick one certain person.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That contest is obviously nearly identical to my last one. My question is would that be okay to post as a new contest, or would it be better just editing my question to including answers that fit the above criteria?&lt;/p&gt;&#xA;" OwnerUserId="25193" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-06-23T15:15:59.397" Title="Would this contest be too similar to my last contest?" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1775" PostTypeId="2" ParentId="1774" CreationDate="2014-06-23T13:54:24.163" Score="1" Body="&lt;p&gt;The questions to ask here is: is the challenge different enough so answers of the previous one are not competitive in the new one? Does it add anything interesting over them? Are the rules different enough to make sure that a valid answer on the previous challenge is invalid on the new challenge?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you specify that every name from the list (except one) can potentially be outputted, I'd say that the answer to these questions is &quot;Yes&quot;. Most answers cannot be copied because they always output the same item, or output a certain item more times than the other items.&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="9275" LastEditDate="2014-06-23T14:56:14.317" LastActivityDate="2014-06-23T14:56:14.317" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1777" PostTypeId="1" CreationDate="2014-06-23T16:52:55.400" Score="16" ViewCount="377" Body="&lt;p&gt;More of a cautionary tale than a question...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/32309/sir-generate-me-four-type-4-guids-if-you-please&quot;&gt;I posted this question over my lunch hour earlier.&lt;/a&gt; (Briefly, generate some type 4 GUIDs using the cryptographic random number generator.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I wanted to avoid &quot;easy answers&quot;, so I came up with some rules. One of those easy answers was to grab 16 bytes of randomness and to drop in the six fixed bits, so I added the rule that random bits can't be wasted. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;That rule would require that a fraction of a byte would need to be loaded from the random number generator (too hard) so I specified that the solution should output four GUIDs. That would allow the program to load a whole number of bytes and use some bit-fiddling to arrange them into four GUIDs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, with my &quot;perfect&quot; challenge in place, I posted it with my rules. No problem?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Trouble was, my rules probably seemed a bit too arbitrary and so were ignored. I had to later edit the challenge to explain why I made these rules. Only one of three answers posted as I type this actually conform to them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;tl/dr: Don't assume people will understand why you've put a rule in place.&lt;/p&gt;&#xA;" OwnerUserId="20793" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-06-30T16:34:28.793" Title="Tip - Explain your arbitrary looking rules" Tags="|discussion|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1779" PostTypeId="2" ParentId="2140" CreationDate="2014-06-24T15:41:09.260" Score="4" Body="&lt;h1&gt;Cube puzzle&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program that can determine whether or not a collection of puzzle pieces can be assembled to form a solid cube. The pieces can be moved and rotated, but not reflected.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each puzzle piece consists of a connected set of sub-cubes. The arrangement of these sub-cubes is described an ASCII representation consisting of a single line with three space-separated numbers &lt;em&gt;x&lt;/em&gt;, &lt;em&gt;y&lt;/em&gt; and &lt;em&gt;z&lt;/em&gt;, followed by &lt;em&gt;z&lt;/em&gt; blocks of &lt;em&gt;x × y&lt;/em&gt; characters where &lt;code&gt;X&lt;/code&gt; represents an occupied sub-cube, and &lt;code&gt;.&lt;/code&gt; represents an empty sub-cube. The first line of input indicates the number of puzzle pieces that follow (&lt;em&gt;N&lt;/em&gt;).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input/output:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program should accept input from stdin, and should print its results to stdout. If the pieces can form a cube, it should output the line &quot;CUBE&quot;. If not, it should output &quot;NOT A CUBE&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/DvMEB.gif&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the above illustration, a 3×3×3 cube is constructed from five pieces. If the pieces are listed in the order {pink, yellow, blue, red, green}, then the input could look something like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;5&#xA;3 2 1&#xA;X..&#xA;XXX&#xA;3 2 2&#xA;XXX&#xA;X..&#xA;...&#xA;X..&#xA;3 3 2&#xA;...&#xA;.X.&#xA;...&#xA;XXX&#xA;.X.&#xA;XX.&#xA;2 3 1&#xA;XX&#xA;XX&#xA;.X&#xA;3 3 2&#xA;X..&#xA;X..&#xA;X..&#xA;...&#xA;...&#xA;XXX&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Limits:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program should be able to handle any puzzle comprising up to 10×10×10 sub-cubes.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winning criterion:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge. The shortest answer (measured in bytes of code) will win.&lt;/p&gt;&#xA;" OwnerUserId="11006" LastActivityDate="2014-06-24T15:41:09.260" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="1780" PostTypeId="1" CreationDate="2014-06-26T19:39:39.917" Score="-9" ViewCount="198" Body="&lt;h2&gt;Code-Golf scoring without need to print all in one line&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Often great answers in code-golf questions are too hard to read. Also the counting of bytes or characters should just count all characters not including white space.&#xA;With all the great golfers here, let's some script ideas for scoring so every answer is counted the same but the answers can still be posted in a well-formatted style.&lt;/p&gt;&#xA;" OwnerUserId="19350" LastActivityDate="2014-06-27T06:06:27.843" Title="Agreed formula for Scoring code-golf" Tags="|discussion|code-golf|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1781" PostTypeId="2" ParentId="1780" CreationDate="2014-06-26T19:57:14.323" Score="11" Body="&lt;p&gt;Whitespace should be counted. If it wouldn't be, this rule could be abused easily, by using the language Whitespace or by using a space as a variable name (this is possible in Golfscript!).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Instead of doing this, it would be better if golfers provide a ungolfed version of their code (in addition to their golfed code), with proper indentation.&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="9275" LastEditDate="2014-06-27T06:06:27.843" LastActivityDate="2014-06-27T06:06:27.843" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1783" PostTypeId="2" ParentId="1780" CreationDate="2014-06-26T23:57:16.230" Score="7" Body="&lt;p&gt;I have always encouraged people to post an ungolfed version of their program &lt;em&gt;alongside&lt;/em&gt; (i.e., in addition to, not instead of) the golfed version, to enable slightly easier reading by humans.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The golfed version still needs to squeeze all unnecessary spaces out, use single-character identifiers, etc., and is the version used for scoring.&lt;/li&gt;&#xA;&lt;li&gt;The ungolfed version is simply a more readable version of the golfed version, with standard indentation and good identifier names. The ungolfed code must be identical to the golfed version in every other way.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-06-26T23:57:16.230" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1784" PostTypeId="2" ParentId="1749" CreationDate="2014-06-27T00:56:09.803" Score="4" Body="&lt;p&gt;Having the answer dictate how an array is to be entered would be preferable since some have integrated parsers for certain formats while other don't.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since it isn't here yet I'll add LISP lists and vectors (called proper arrays in other languages):&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(1 2 3 4 5)  ; list&#xA;#(1 2 3 4 5) ; vector&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You can easily nest them:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;((1 2 3) (4 5 6))    ; list in list&#xA;#(#(1 2 3) #(4 5 6)) ; vector in vector (compatible)&#xA;#2A((1 2 3) (4 5 6)) ; 2 dimentional vector in CL&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="11290" LastActivityDate="2014-06-27T00:56:09.803" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1785" PostTypeId="2" ParentId="1749" CreationDate="2014-06-27T15:24:25.890" Score="6" Body="&lt;h1&gt;Newline-separated&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;2&#xA;3&#xA;4&#xA;5&#xA;6&#xA;7&#xA;8&#xA;9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is the most generic format, and the easiest to parse in any programming language. Not all programming languages can easily split strings on a delimiter, but all of them can easily read a single line of input from stdin. The program just needs to read the number of lines it expects in a loop, and add each number to an array.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This format does not directly support nested arrays. If you want to represent a 2D matrix, add two more lines before the list with the number of rows followed by the number of columns, e.g. &lt;code&gt;3&lt;/code&gt; and &lt;code&gt;3&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="7982" LastActivityDate="2014-06-27T15:24:25.890" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1787" PostTypeId="2" ParentId="2140" CreationDate="2014-06-28T23:16:38.227" Score="1" Body="&lt;h2&gt;License Plate Recognition (LPR): fix errors&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A License Plate reading software often mistakes some characters. Some of the commonly mistaken pairs of characters are O,0 I,1 4,9 and S,5.&#xA;Your task is to write a function that take the number plate guessed by the LPR software and returns the list of possible matches assuming the four pairs of characters listed here can be substituted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is also possible the LPR misses some characters, but in this question you can assume you are given the correct number of characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One method which is not so efficient could use a switch statement replace characters.&#xA;Example function declaration would be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;List&amp;lt;string&amp;gt; equivalent(string plateNumber);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The function format is up to you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sample input: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;SSH389&#xA;ONC073&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;SSH389, S5H389, 5SH389, 55H389&#xA;ONC073, 0NC073, ONCO73, 0NCO73&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is code golf, shortest code wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Posting in sandbox for review.&lt;/p&gt;&#xA;" OwnerUserId="19350" LastActivityDate="2014-06-28T23:16:38.227" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1789" PostTypeId="2" ParentId="1061" CreationDate="2014-06-29T12:22:16.467" Score="138" Body="&lt;h2&gt;Adding input or rules which weren't explicitly mentioned in the challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There was recently a case where an answerer claimed&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Nowhere does it say the program can't (also) ask the user what the [result] is.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Adding additional input or new rules, because they haven't been explicitly forbidden, can considerably simplify the challenge or make it trivial. That's certainly not in the spirit of any challenge.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2014-06-30T14:14:04.720" LastActivityDate="2014-06-30T14:14:04.720" CommentCount="8" CommunityOwnedDate="2014-06-29T12:22:16.467" ContentLicense="CC BY-SA 3.0" />
  <row Id="1791" PostTypeId="2" ParentId="1305" CreationDate="2014-06-30T07:16:02.437" Score="4" Body="&lt;p&gt;I'm not really sure I have a position, but I do have some experience with an alternate method which is pertinent to the discussion. With my last challenge the Steampunk Clacker Animation, I posted directly to the main site. But when fully written up (which I intended to be complete and reasonable, and not need sandboxing), a nagging doubt crept up. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I slapped &quot;Challenge will open in 24 hours pending comments and corrections&quot; or something to that effect. And I got some good feedback right away and made some needed clarifications in the spec. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it had been in the sandbox, I probably would've gotten the same feedback because Peter's really good about that. But I might've not posted until I had a working implementation. And as it turned out, writing the implementation did indeed turn up some stupid in the spec.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, in conclusion, I dunno. I got away with it. I skipped the sandbox.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="2381" LastEditDate="2014-06-30T07:22:09.347" LastActivityDate="2014-06-30T07:22:09.347" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1793" PostTypeId="2" ParentId="2140" CreationDate="2014-06-30T18:47:43.250" Score="1" Body="&lt;h1&gt;Voice recognition: &quot;yes&quot; or &quot;no&quot;?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Implement a program in minimum bytes of source or binary code that recognizes audio input, which must be somebody saying &quot;yes&quot; or somebody saying &quot;no&quot; (in any language).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard &quot;no longer funny loopholes&quot; apply.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Audio files can be supplied from stdin (as raw or compressed audio in any format), or read from file. Each input is expected to be 1-3 seconds of audio of one person clearly saying just &quot;yes&quot; or &quot;no&quot;, in approximately the same speed and pitch. For example, the &quot;yes&quot; file should not be easy to change to trick the program to output &lt;code&gt;no&lt;/code&gt; while still clearly sounding &lt;code&gt;yes&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;External libraries and builtins: only functions accepting constant-sized input (i.e. &lt;code&gt;sin&lt;/code&gt;, &lt;code&gt;pow&lt;/code&gt;) can be used, not FFT, for example.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Questions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Should it be code-golf or popularity contest?&lt;/li&gt;&#xA;&lt;li&gt;Should I provide test cases?&lt;/li&gt;&#xA;&lt;li&gt;Shall I combine shortness of the code and correctness of regognition in single score? Or limit one of them?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="7773" LastEditorUserId="7773" LastEditDate="2014-07-03T13:57:03.897" LastActivityDate="2014-07-03T13:57:03.897" CommentCount="16" ContentLicense="CC BY-SA 3.0" />
  <row Id="1794" PostTypeId="2" ParentId="2140" CreationDate="2014-06-30T19:39:40.403" Score="1" Body="&lt;p&gt;Mac file explorer is so &quot;Great&quot; that it deserve to be replaced.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a program that will allow the user to navigate between the files in his/her system and provide the next minimum information:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;file name&lt;/li&gt;&#xA;&lt;li&gt;is it a file or a folder&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Rulles:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any input allowed as long as it's &lt;strong&gt;not Keyboard&lt;/strong&gt;. So, you can use voice recognition, mouse or what ever input you want.&lt;/li&gt;&#xA;&lt;li&gt;You need some how to provide information to the user about what is his current location in the file system, you might do it by showing it on screen or again, any other output will be valid. (you can print him where is he now).&lt;/li&gt;&#xA;&lt;li&gt;Even so this challenge is intended to replace the mac file explorer you are not limited by operation system.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is a popularity contest, so the most voted answer wins. It's not limited by time. The first winner will be declared within two weeks.&lt;/p&gt;&#xA;" OwnerUserId="10588" LastEditorUserId="10588" LastEditDate="2014-07-01T00:39:41.983" LastActivityDate="2014-07-01T00:39:41.983" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="1795" PostTypeId="2" ParentId="2140" CreationDate="2014-06-30T20:18:02.553" Score="1" Body="&lt;h2&gt;Bugs Bunny Word Chain&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Modified 'word chain' puzzle / popularity contest&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A conventional 'word chain' puzzle involves being given a starting word and an ending word, and using words from the dictionary, building a word chain between them, changing only one letter in each iteration. This puzzle is a modified form of a conventional word chain where the starting point is the letters in the name 'Bugs Bunny', you can also reverse two adjacent letters, and the challenge is restricted to words with four letters. And... the code should be convoluted and crazy-looking.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a single iteration, you may do only &lt;em&gt;one&lt;/em&gt; of the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;change a single letter in the word&lt;/li&gt;&#xA;&lt;li&gt;reverse the order of two &lt;em&gt;adjacent&lt;/em&gt; letters (e.g. &quot;brat&quot; can become &quot;bart,&quot; but &lt;em&gt;not&lt;/em&gt; &quot;trab&quot;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In addition to these rules, you must also:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;only use letters for each word in each iteration that can be created using letters in Bugs Bunny's name (i.e. &quot;BUGSBUNNY&quot;, no space). Each letter in this name can be used only &lt;em&gt;once&lt;/em&gt; in a word, but letters occurring multiple times may be used that number of times (i.e. sampling without replacement).&lt;/li&gt;&#xA;&lt;li&gt;ensure the words are dictionary words&amp;mdash;they cannot be nonsensical (in this case it is fine to simply store the acceptable words in an array/list/whatever data structure you choose since there are only 16 possible combinations according to most &lt;a href=&quot;http://www.wineverygame.com/wbg.php?letters=bugsbunny&amp;amp;lettersh=bugsbunny&amp;amp;preffix=&amp;amp;preffixh=&amp;amp;oa=or&amp;amp;suffix=&amp;amp;suffixh=&amp;amp;submit=Find%20Words&amp;amp;pr=&quot; rel=&quot;nofollow&quot;&gt;'Scrabble' tools&lt;/a&gt;). The possible combinations are &lt;code&gt;sunn, sung, snug, snub, nuns, nubs, guys, guns, gnus, buys, busy, buns, bunn, bung, bugs, bubs&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;determine the optimal route for the inputs given&lt;/li&gt;&#xA;&lt;li&gt;recognize if the inputs are impossible to 'chain' following these rules&lt;/li&gt;&#xA;&lt;li&gt;make the code look horrifically convoluted&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The solution should work given any two &lt;em&gt;possible&lt;/em&gt; inputs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance, if given the word 'guys' as a starting word and 'guns' as an ending word, the program should only require one iteration. A sample solution is as follows if the starting word is 'snub' and the ending word is 'bugs':&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;code&gt;snub snug sung bung buns bugs&lt;/code&gt; (five iterations)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The first word given does not count as an iteration (&quot;snub&quot;), but all words thereafter do (including the final word). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thus iterations are calculated as &lt;em&gt;n&lt;/em&gt;&amp;mdash;1. The best submission will have the most convoluted (yet still short) code &lt;em&gt;and&lt;/em&gt; should determine the optimal route for any four-letter inputs given (and recognize an impossible chain given the rules). This is a popularity contest.&lt;/p&gt;&#xA;" OwnerUserId="4111" LastEditorUserId="4111" LastEditDate="2014-07-01T20:09:22.050" LastActivityDate="2014-07-01T20:09:22.050" CommentCount="20" ContentLicense="CC BY-SA 3.0" />
  <row Id="1796" PostTypeId="2" ParentId="1288" CreationDate="2014-07-01T10:55:27.923" Score="-9" Body="&lt;h2&gt;First Past The Post&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To be used for challenges that are genuinely difficult, and/or require solving some kind of puzzle that only has one answer. The winner is simply the first person to post a correct solution.&lt;/p&gt;&#xA;" OwnerUserId="21034" LastActivityDate="2014-07-01T10:55:27.923" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1797" PostTypeId="1" CreationDate="2014-07-01T18:59:04.823" Score="9" ViewCount="6332" Body="&lt;p&gt;Since I am now programming in a very esoteric language, &lt;a href=&quot;http://esolangs.org/wiki/Pyth&quot; rel=&quot;nofollow&quot;&gt;Pyth&lt;/a&gt;, I like to include in my posts an explanation of what my program is doing. However, I seen many different explanation formats, and I'd like to know which one(s) people prefer. Some options I've seen:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In line comments&lt;/li&gt;&#xA;&lt;li&gt;In line comments with indentation to show what operates on what&lt;/li&gt;&#xA;&lt;li&gt;Paragraph form explanation&lt;/li&gt;&#xA;&lt;li&gt;Equivalent of the program in a more self-documenting programming language.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Which do you think is/are best?&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2014-07-06T08:42:26.827" Title="How to explain your code" Tags="|discussion|" AnswerCount="4" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1798" PostTypeId="2" ParentId="1797" CreationDate="2014-07-01T19:00:54.150" Score="9" Body="&lt;p&gt;That depends on the format of your language, and on your taste. Inline comments are only going to work if your language actually supports such a thing, for example. I wouldn't bother trying to rewrite the same code in a different language, though.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-07-01T19:00:54.150" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1799" PostTypeId="2" ParentId="1288" CreationDate="2014-07-02T03:17:44.937" Score="12" Body="&lt;h1&gt;Fragile Keywords&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Everything is falling apart! When you use a keyword or function, it breaks and you can't use it again.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additional rule to make it more difficult to work around:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Aliasing something counts as using it. Built-in aliases are fine, such as PHP's &lt;a href=&quot;http://php.net/manual/en/function.count.php&quot; rel=&quot;nofollow&quot;&gt;&lt;code&gt;count()&lt;/code&gt;&lt;/a&gt; and &lt;a href=&quot;http://php.net/manual/en/function.sizeof.php&quot; rel=&quot;nofollow&quot;&gt;&lt;code&gt;sizeof()&lt;/code&gt;&lt;/a&gt;, but if you say &lt;code&gt;#define v void&lt;/code&gt;, you can't use &lt;code&gt;#define&lt;/code&gt;, &lt;code&gt;v&lt;/code&gt; or &lt;code&gt;void&lt;/code&gt; again.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This will make simple tasks slightly more challenging (for most standard languages):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No more than 2 or 3 loops in your code: &lt;code&gt;for&lt;/code&gt; and &lt;code&gt;while&lt;/code&gt;, &lt;code&gt;foreach&lt;/code&gt; if available&lt;/li&gt;&#xA;&lt;li&gt;No more than one &lt;code&gt;function&lt;/code&gt; or &lt;code&gt;class&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Hard Mode&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This could be a separate tag (&lt;code&gt;fragile-keywords-hard&lt;/code&gt;) or just optional rules for the original tag to make it more challenging, such as:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Types are fragile too; &lt;code&gt;string&lt;/code&gt;, &lt;code&gt;int&lt;/code&gt;, &lt;code&gt;double&lt;/code&gt;, &lt;code&gt;void&lt;/code&gt; etc.&lt;/li&gt;&#xA;&lt;li&gt;Numerical operators are fragile; &lt;code&gt;+&lt;/code&gt;, &lt;code&gt;*&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;, &lt;code&gt;/&lt;/code&gt; etc.&lt;/li&gt;&#xA;&lt;li&gt;Variables are fragile&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Combining them is probably not recommended.&lt;/p&gt;&#xA;" OwnerUserId="6599" LastActivityDate="2014-07-02T03:17:44.937" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1800" PostTypeId="1" AcceptedAnswerId="1801" CreationDate="2014-07-02T08:16:48.823" Score="1" ViewCount="187" Body="&lt;p&gt;I've seen some answers that hard code the input or rely on the existence of a user-defined variable, see for example &lt;a href=&quot;https://codegolf.stackexchange.com/q/2823/344&quot;&gt;this question&lt;/a&gt;. The OP asked for a &lt;em&gt;&quot;function or equivalent subprogram&quot;&lt;/em&gt;. I don't think this kind of answers are acceptable. What's your opinion on this?&lt;/p&gt;&#xA;" OwnerUserId="344" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-07-02T09:19:26.257" Title="Hard coding input" Tags="|discussion|" AnswerCount="1" CommentCount="1" ClosedDate="2017-02-24T11:45:13.207" ContentLicense="CC BY-SA 3.0" />
  <row Id="1801" PostTypeId="2" ParentId="1800" CreationDate="2014-07-02T09:19:26.257" Score="2" Body="&lt;p&gt;In general:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is it explicitly allowed? Then these answers are acceptable.&lt;/li&gt;&#xA;&lt;li&gt;Is it explicitly disallowed? Then these answers are not acceptable.&lt;/li&gt;&#xA;&lt;li&gt;None of above? Then:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If it explicitly specifies another way to receive input (e.g. STDIN), then I would assume that it's not allowed, because the spec gives another way to receive input.&lt;/li&gt;&#xA;&lt;li&gt;If you are not sure, leave a comment. If the OP doesn't reply, then the chance that they will ever accept an answer is low, and then I think it is OK to use a variable as input.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In this case, leaving a comment seems the best, because if your submission is an &quot;equivalent subprogram&quot;, then there is nowhere specified how the input for this subprogram should be given. But because the question is migrated from Stack Overflow and the OP doesn't have an account here, the chance that he will reply (and accept an answer) is very low, so in this case, I'd say it is OK.&lt;/p&gt;&#xA;" OwnerUserId="9275" LastActivityDate="2014-07-02T09:19:26.257" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1802" PostTypeId="1" AcceptedAnswerId="1803" CreationDate="2014-07-02T09:29:28.190" Score="3" ViewCount="88" Body="&lt;p&gt;I received the following error upon trying to preview my edit to &lt;a href=&quot;https://codegolf.stackexchange.com/a/32602/344&quot;&gt;this answer&lt;/a&gt; in the Android app:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Please fix the following:&lt;br&gt;&#xA;  Account is not allowed to suggest edits&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="344" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2014-07-02T09:47:53.353" Title="Account is not allowed to suggest edits" Tags="|support|editing|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1803" PostTypeId="2" ParentId="1802" CreationDate="2014-07-02T09:47:53.353" Score="4" Body="&lt;p&gt;Currently, suggesting edits is not yet implemented in the API, so it won't work on the Android and iOS app. See this question on Meta Stack Exchange: &lt;a href=&quot;https://meta.stackexchange.com/q/208471/229438&quot;&gt;Android app should send edits to edit queue if necessary rather than rejecting them&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-07-02T09:47:53.353" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1805" PostTypeId="2" ParentId="1797" CreationDate="2014-07-03T14:50:12.983" Score="11" Body="&#xA;&#xA;&lt;p&gt;I've recently been experimenting with different ways of doing this. My goals going into it were keeping the height of the answer low (previous attempts have gotten long) and explaining what exactly the code does instead of why it does it. This is antithetical to what usually makes for a good way to explain a program, but in my opinion it's more fun to read on sites like this because you get riddles like &quot;Why did they do this here?&quot;, answered later in the program with &quot;Oh, it lets them a neat trick to save characters here!&quot;. Those moments are my favourite thing about reading this site. A thorough, literal explanation of what the code is doing allows people who aren't familiar with the language to play along.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I recently figured out a way to explain my code and meet those goals. As an example, a &lt;a href=&quot;https://codegolf.stackexchange.com/q/32757/14509&quot;&gt;recent question&lt;/a&gt; asked for a program or function to list every letter of the alphabet ordered by how often they show up in an input string. This was &lt;a href=&quot;https://codegolf.stackexchange.com/a/32761/14509&quot;&gt;my answer&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;f=lambda s:''.join(sorted(map(chr,range(65,91)),key=s.upper().count))[::-1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And this was my explanation:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;                                  range(65,91)                              # The numbers 65 to 90&#xA;                          map(chr,range(65,91))                             # Convert to ASCII&#xA;&#xA;                                                    s                       # The input string&#xA;                                                    s.upper()               # Convert to uppercase&#xA;                                                    s.upper().count         # Function literal for 'how many times the argument appears in the string'&#xA;&#xA;                   sorted(map(chr,range(65,91)),key=s.upper().count)        # Sort by that function&#xA;           ''.join(sorted(map(chr,range(65,91)),key=s.upper().count))       # Concatenate to string&#xA;           ''.join(sorted(map(chr,range(65,91)),key=s.upper().count))[::-1] # Step through by -1 (i.e. reverse string)&#xA;&#xA;  lambda s:''.join(sorted(map(chr,range(65,91)),key=s.upper().count))[::-1] # Make it a function (`return` is implicit for lambdas)&#xA;f=lambda s:''.join(sorted(map(chr,range(65,91)),key=s.upper().count))[::-1] # Give it a name&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I like this for a couple reasons:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Simple enough to read along with if you don't know python (I think, at least. I know python so I'm not a good judge of this)&lt;/li&gt;&#xA;&lt;li&gt;Shows you where to start reading, which isn't always obvious in golfed code (and if there are multiple unrelated parts of the code that have to come together later, like in this answer, you can define a different entry point for each bit)&lt;/li&gt;&#xA;&lt;li&gt;I think it looks nice&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Of course, there is one &lt;em&gt;big&lt;/em&gt; con:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Horizontal scrollbars make the baby Jesus cry&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Overall, though, I think I'll stick with this until I find something better.&lt;/p&gt;&#xA;" OwnerUserId="14509" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-07-03T14:50:12.983" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1806" PostTypeId="2" ParentId="2140" CreationDate="2014-07-03T16:59:16.147" Score="1" Body="&lt;h1&gt;Markdown to HTML converter&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program that takes a file name ending in &lt;code&gt;.md&lt;/code&gt;, &lt;code&gt;.mkd&lt;/code&gt; or &lt;code&gt;.markdown&lt;/code&gt; as a command-line argument (or the closest equivalent in your language of choice) and converts it to a valid HTML 5 document.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If an error is detected, you must print an error message and terminate the program with a non-zero exit status.&lt;/li&gt;&#xA;&lt;li&gt;The output file name must be the input file name with the extension changed to &lt;code&gt;.html&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You don't have to include a doctype or &lt;code&gt;&amp;lt;html&amp;gt;&lt;/code&gt;, &lt;code&gt;&amp;lt;head&amp;gt;&lt;/code&gt;, &lt;code&gt;&amp;lt;body&amp;gt;&lt;/code&gt; tags.&lt;/li&gt;&#xA;&lt;li&gt;You must support everything listed in the &lt;a href=&quot;https://jgm.github.io/stmd/spec.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;CommonMark specification&lt;/a&gt;, except for embedded HTML and HTML entities.&lt;/li&gt;&#xA;&lt;li&gt;You may not use an existing library or similar tool for processing Markdown.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="344" LastEditorUserId="344" LastEditDate="2014-10-04T13:52:39.657" LastActivityDate="2014-10-04T13:52:39.657" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1807" PostTypeId="2" ParentId="2140" CreationDate="2014-07-03T20:54:57.117" Score="0" Body="&lt;h1&gt;Saving Eve&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In the year 1946 the organisation &lt;em&gt;Illuminati&lt;/em&gt; launched their first intelligence collecting satellite - called &lt;em&gt;Eve&lt;/em&gt; - into orbit around the earth. Onboard it contains a highly sophisticated set of sensors capable of eavesdropping on every telephone call in the world. All suspicious calls are recorded along with all ascertainable information about the caller and receiver. Eve then relays everything to Illuminati's office in Venice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, recently the growing amount of radio communication in space and on earth has started to interfere with Eve's downlink and uplink to and from the Venice office, which has resulted in spurious intermixing of the recordings of suspicious calls with the local weather report.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;...we are to drop the bomb ... ...sunny and 28 degrees! In fair Verona... ...shoot them down...&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Seeing as this interferes with Illuminati's ability to control all governments of the world, the error correction encoding firmware of Eve must be upgraded.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You have been hired to write the new firmware for Eve. You have realised that the only sufficiently robust and efficient encoding is to use the extended binary Golay code, which encodes 12-bits into 24-bits of data. Luckily Eve was built in the 40's, before the 8-bit byte convention, so all the data that Eve processes is already in 12-bit chunks.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So you have to write a function or a program that takes one 12-bit chunk (as an integer) and outputs or returns a 24-bit chunk (again as an integer) according to the extended binary Golay code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And you have to write a decoding function or program that takes one 24-bit chunk (again as a an integer) and outputs the decoded 12-bits, with a 16th bit set (2^15) if any correctable errors were detected, and a 20th bit set (2^19) if any uncorrectable errors were detected.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But since the uplink to Eve is unstable you must write the functions or programs in the least amount of characters possible, so that it takes a minimal amount of time to upload.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winning criteria&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The least amount of characters in the source code of the encoding and decoding functions or programs.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Note&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The exact details of the output of the encoding is not that important, as long as the solution can correct any error up to 3 bits and detect any error up to 7 bits.&lt;/p&gt;&#xA;" OwnerUserId="7682" LastActivityDate="2014-07-03T20:54:57.117" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1809" PostTypeId="2" ParentId="1797" CreationDate="2014-07-06T02:10:06.357" Score="2" Body="&lt;p&gt;As a J golfer, I've used all of the above explanation types, and more, for some of my answers (e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/a/25280/5138&quot;&gt;1&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/25459/5138&quot;&gt;2&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/24584/5138&quot;&gt;3&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My process for choosing which explanation to use is based on what kind of golf it is. If it's something small and won't make horizontal scrollbars, I'll do an &quot;explanation-by-explosion&quot; (my name for the thing in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1805/5138&quot;&gt;undergroundmonorail's answer&lt;/a&gt;) and add comments to the right. If it's something very linear, I'll do a paragraphs thing. It's really dependent on what kind of golf you've written and how much you can break down your language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The important point I want to make, though, is that &lt;em&gt;it's okay to fudge some facts for explanation simplicity&lt;/em&gt;. Sometimes it's better to gloss over exactly how something is accomplished, or to imply that a technically incorrect but easier-to-explain behaviour is occurring.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance, in J explanations, I will treat the atoms &lt;code&gt;]&lt;/code&gt; and &lt;code&gt;[&lt;/code&gt; as variables referencing the left and right arguments to a verb, when actually, &lt;code&gt;]&lt;/code&gt; and &lt;code&gt;[&lt;/code&gt; are verbs that have to fit into a rigid syntactic structure that at first sounds very arbitrary until you know enough J to understand why. It's an important distinction to a golfer, but explaining it to someone that doesn't care to learn your language would be wasted breath.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My point is that non-Jers looking at J explanations would rather see &lt;em&gt;which parts of the code correspond to what parts of the algorithm&lt;/em&gt; (in my experience). Obviously, J is very different from the many other languages out there that require explaining, but the principle is the same: people will look at the documentation if they want a full account of the relevant syntax; here, they just want to see your algorithm.&lt;/p&gt;&#xA;" OwnerUserId="5138" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-07-06T02:10:06.357" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1811" PostTypeId="2" ParentId="1797" CreationDate="2014-07-06T08:42:26.827" Score="2" Body="&lt;p&gt;I have a tendency to &lt;a href=&quot;https://codegolf.stackexchange.com/a/6607/737&quot;&gt;be&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/12444/737&quot;&gt;quite&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/20416/737&quot;&gt;wordy&lt;/a&gt; in my explanations, though i can be a bit &lt;a href=&quot;https://codegolf.stackexchange.com/a/12111/737&quot;&gt;more brief&lt;/a&gt;. The wordier I am, the more pleased (smug?) I feel about my answer I think.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In all cases I prefer the paragraph format over line comments.&lt;/p&gt;&#xA;" OwnerUserId="737" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2014-07-06T08:42:26.827" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1812" PostTypeId="2" ParentId="2140" CreationDate="2014-07-06T14:16:14.990" Score="1" Body="&lt;h1&gt;Finding Integer Linear Factors of Integer Polynomials&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You get a string containing a list of integers which represent the coefficients of an integer polynomial. E.g. p(x) = x^3-2x+3 will encode as &quot;3,-2,0,1&quot; (ordered in ascending order of the degree) You can assume that the gcd (greatest common divisor) of the coefficients is 1, and that the polynomials is nonzero.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is finding all roots p(x) = 0 where x is an integer. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output string will consist of two parts, separated with semicolon:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first part contains a list of the integer roots in ascending order. (separated by ',')&lt;/li&gt;&#xA;&lt;li&gt;The second part contains the coefficients of the remainder, or just a '1' if the polynomial could be completely factorized in integer linear factors.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The polynomial x^4+2x^3-x-2 will encode as &quot;-2,-1,0,2,1&quot;. It can be factorized as (x^2+x+1)(x-1)(x+2) so the output will be: &quot;-2,1;1,1,1&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;x^3-x+2 is irreducible will encode as &quot;2,-1,0,1&quot;, output will be &quot;;2,-1,0,1&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;-2x^6-2x^5+7x^4+x^3-x^2+2x-6 is a product of two irreducible polynomials (x^2+x-3)(-2x^4+x^2+2), has therefore no integer roots and encodes as &quot;-6,2,-1,1,7,-2,-2&quot; output will be &quot;;-6,2,-1,1,7,-2,-2&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;x-1 will encode as &quot;-1,1&quot; and has the output &quot;1;1&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;3 will encode as &quot;3&quot; and has the output &quot;;3&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;I/O&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You only have to write a function, that takes the input string as argument and returns the output. If this is not available to your language, use an equivalent structure. (function, named block, or named verb)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Goal&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The shortest (correct) solution (in bytes) wins. (codegolf)&#xA;Please upvote special and elegant solutions!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;EDIT: More examples, assumptions, I/O&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2014-07-08T10:22:51.000" LastActivityDate="2014-07-08T10:22:51.000" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1813" PostTypeId="2" ParentId="1288" CreationDate="2014-07-06T14:25:43.737" Score="-6" Body="&lt;p&gt;&lt;strong&gt;unexpected-golf&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;this tag is for questions asking to do a simple task in an unexpected, sophisticated and surprising way - so that if one would look at the code, he won't know what it does until he runs it.&#xA;this tag already has lots of questions, but it doesn't has it's own tag, although it should have. vote for this in order for it to have a tag.&lt;/p&gt;&#xA;" OwnerUserId="20370" LastActivityDate="2014-07-06T14:25:43.737" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1815" PostTypeId="2" ParentId="2140" CreationDate="2014-07-08T01:46:29.837" Score="0" Body="&lt;h1&gt;Meta Code-golf &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Golfing code can be slightly annoying&lt;sup&gt;[&lt;em&gt;citation needed&lt;/em&gt;]&lt;/sup&gt;. There are some things that can be automatically be applied to every golfing problem (e. g. remove all newlines). So what do you do? Automate it!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a program that will golf another program. Naturally, your program must be also be golfed, otherwise this wouldn't be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question, would it?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following rules apply to your program:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All the code must be in one file, except for that of the program your program is golfing.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that the code of the program to be golfed is contained in a string. That string will not be counted towards your score.&lt;/li&gt;&#xA;&lt;li&gt;The output of the golfed program must be identical to that of the original program.&lt;/li&gt;&#xA;&lt;li&gt;Your program need only golf programs in it's own language. For example, a Python code-golfer-bot-thing need only successfully golf Python code, it can break all the Java code it wants.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Sandbox note: I'm not sure how to score this. The length of the golfer should be factored in, as should the difference between an ungolfed and golfed program. I'm thinking something like &lt;code&gt;(ungolfed - golfed) / chars in answer&lt;/code&gt;, but this would require a way of finding the average number of characters removed. This suggests something of a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, with random programs being chosen and passed to the bots to be golfed, but I would probably have to limit that to Python because that's to only language for which I have a bunch of random programs lying around on my box. However, I have no idea how to implement this and I don't want to spend a while looking through 100+ programs looking for sensitive information (passwords, email addresses, names). Anyway, in this case, score would probably be &lt;code&gt;(average ungolfed - golfed) / chars in answer&lt;/code&gt;. Any thoughts? Side note to the sandbox note: sorry for the convoluted state of the note. I was basically just vomiting all my thoughts onto the page as they came to me.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="18226" LastActivityDate="2014-07-08T01:46:29.837" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1817" PostTypeId="1" AcceptedAnswerId="1818" CreationDate="2014-07-08T08:43:27.527" Score="1" ViewCount="66" Body="&lt;p&gt;&lt;a href=&quot;https://stackoverflow.com/questions/24627008/rearrange-an-array-so-that-when-written-in-a-space-where-elements-wraps-below-i&quot;&gt;https://stackoverflow.com/questions/24627008/rearrange-an-array-so-that-when-written-in-a-space-where-elements-wraps-below-i&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As suggested in the comment?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've been looking questions here and they all seem a bit.. quiz-oriented, which is why I'm still in doubt...&lt;/p&gt;&#xA;" OwnerUserId="20009" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2014-07-08T08:59:53.340" Title="Is this question eligible to be posted here?" Tags="|discussion|specific-question|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1818" PostTypeId="2" ParentId="1817" CreationDate="2014-07-08T08:59:53.340" Score="6" Body="&lt;p&gt;No, it does not belong here, because it is not a contest and not a programming puzzle. It's a general programming question, and they belong on Stack Overflow.&lt;/p&gt;&#xA;&lt;p&gt;As the tour says:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Don't ask about...&lt;/p&gt;&#xA;&lt;p&gt;General programming questions&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-07-08T08:59:53.340" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1819" PostTypeId="2" ParentId="2140" CreationDate="2014-07-08T23:54:33.097" Score="0" Body="&lt;h1&gt;Reve's puzzle&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;From &lt;a href=&quot;http://djm.cc/library/The_Canterbury_Puzzles_Dudeney_edited.pdf&quot; rel=&quot;nofollow&quot;&gt;The Canterbury Puzzles&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;When the pilgrims were stopping at a wayside tavern, a number of&#xA;  cheeses of varying sizes caught his alert eye; and calling for four&#xA;  stools, he told the company that he would show them a puzzle of his&#xA;  own that would keep them amused during their rest.  He then placed n&#xA;  cheeses of graduating sizes on one of the end stools, the smallest&#xA;  cheese being at the top (and no cheese resting on a smaller one.)&#xA;  'This is the riddle', quoth he, 'that I did once set before my fellow&#xA;  townsmen at Baldeswell, that is in Norfolk, and, by Saint Joce, there&#xA;  was no man among them that could rede it aright. And yet it is withal&#xA;  fully easy, for all that I do desire is that, by the moving of one&#xA;  cheese at a time from one stool unto another, ye shall remove all the&#xA;  cheeses to the stool at the other end without ever putting any cheese&#xA;  on one that is smaller than itself. To him that will perform this feat&#xA;  in the least moves that be possible will I give a draught of the best&#xA;  that our good host can provide.'&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Write a function called &lt;code&gt;reve&lt;/code&gt; that takes five arguments — the number of cheeses n &gt;= 0 and labels for four stools (the source, two intermediaries, and the destination) — and outputs the minimum set of moves necessary to solve Reve's puzzle.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the original puzzle is posed with n = 8, 10, and 21 cheeses, so running &lt;code&gt;reve 8 &quot;A&quot; &quot;B&quot; &quot;C&quot; &quot;D&quot;&lt;/code&gt; should return the following 33 moves:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;A&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;D&quot;)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;reve 10 &quot;A&quot; &quot;B&quot; &quot;C&quot; &quot;D&quot;&lt;/code&gt; (49 moves)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[(&quot;A&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;D&quot;)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;reve 21 &quot;A&quot; &quot;B&quot; &quot;C&quot; &quot;D&quot;&lt;/code&gt; (321 moves)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;A&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;B&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;B&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;A&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;D&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;A&quot;),(&quot;D&quot;,&quot;A&quot;),(&quot;C&quot;,&quot;A&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;C&quot;),(&quot;D&quot;,&quot;C&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;B&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;D&quot;),(&quot;A&quot;,&quot;B&quot;),(&quot;A&quot;,&quot;C&quot;),(&quot;A&quot;,&quot;D&quot;),(&quot;C&quot;,&quot;D&quot;),(&quot;B&quot;,&quot;D&quot;)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;An up vote for all successful attempts. Shortest solution by character count wins. Sorry, no beer. Although if you're ever in the Boston area, it's on me.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Questions&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a suitable question for code golf?&lt;/li&gt;&#xA;&lt;li&gt;Is it clear what I'm asking? Do I need to be more specific about input/output, etc.?&lt;/li&gt;&#xA;&lt;li&gt;Any other suggestions?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12268" LastActivityDate="2014-07-08T23:54:33.097" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1821" PostTypeId="2" ParentId="1288" CreationDate="2014-07-09T02:46:52.403" Score="3" Body="&lt;p&gt;Inspired by &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I'm still waiting for someone to say, &quot;I just started working at this company and took over work on this existing application, and it's really cleanly coded, easy to understand, and a breeze to make changes to.&quot; I don't think such a thing exists. –  Scott Whitlock &lt;a href=&quot;https://softwareengineering.stackexchange.com/questions/152464/im-doing-90-maintenance-and-10-development-is-this-normal#comment289912_152464&quot;&gt;Jun 12 '12 at 12:15&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Programming Puzzles and Code Golf is notorious for having challenges with ugly (for real uses) code. Why not create a challenge that's the opposite?&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Clean Code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The asker provides a problem to solve, such as writing an interpreter for some language, and a style guide. The winner is the answer which best fits the style guide.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Problems:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Requires a previously written style guide, or elaborate writing on part of the asker.&lt;/li&gt;&#xA;&lt;li&gt;How can we judge between two answers that both completely fit the style guide?&lt;/li&gt;&#xA;&lt;li&gt;How can we judge how well an answer fits the style guide?&lt;/li&gt;&#xA;&lt;li&gt;What about multiple languages?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2017-04-12T07:32:01.007" LastActivityDate="2014-07-09T02:46:52.403" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1824" PostTypeId="2" ParentId="2140" CreationDate="2014-07-09T11:23:09.993" Score="2" Body="&lt;h1&gt;Type me out.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task (related to &lt;a href=&quot;https://codegolf.stackexchange.com/q/32654/9534&quot;&gt;this question&lt;/a&gt;) is to translate any text (in a file, or simply input) into the input of a telephone keypad.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/AY27N.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;and provide a keypress score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As the keypad has a limited set of keys you have to 'encode' your non-alphanumerics with their ASCii hexadecimal encoding; e.g. to type ~ you press the hash key once, the 7 key (once to get a seven) and then 3 three times to cycle through the digits 3, 'd', and finally 'e'. This gives the code #7e which corresponds to ~. Spaces and capitals have to be accessed via hex code (so MY_CONST (&lt;code&gt;#4d #59 #53def #43 #4f #4e #53 #54&lt;/code&gt; - 27 presses) costs you less than my_const (&lt;code&gt;6m 9wxy #53def 2bc 6mno 6mn 7pqrs 8t&lt;/code&gt; - 29), but more than myconst  (&lt;code&gt;6m 9wxy 2bc 6mno 6mn 7pqrs 8t&lt;/code&gt; - 23)).&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;For instance If your code had &lt;code&gt;print()&lt;/code&gt; that would cost 15 for the print&#xA;  (7p 7pqr 4ghi 6mn 8t) plus 6 for the () (#28 #29)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;To be clear with just the input  &lt;code&gt;print()&lt;/code&gt; the output is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;7p 7pqr 4ghi 6mn 8t #28 #29&#xA;21&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(Note however the hex codes for &lt;code&gt;c f i r s v y z&lt;/code&gt; are shorter (correspondingly &lt;code&gt;#63 #66 #69 #72 #73 #76 #79 #7a&lt;/code&gt;) than long hand key presses. It's perfectly allowed to score &lt;code&gt;print()&lt;/code&gt; as 19:  &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;7p #72 #69 6mn 8t #28 #29&#xA;19&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is Code Golf, so feed your code into the finished program - shortest answer wins.&lt;/p&gt;&#xA;" OwnerUserId="9534" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2014-07-09T12:53:32.257" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1828" PostTypeId="2" ParentId="1061" CreationDate="2014-07-09T18:17:57.560" Score="246" Body="&lt;p&gt;Using lots of spaces to &quot;hide&quot; code out of bounds, especially in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; questions. This isn't very clever or tricky, in my opinion, and yet wins all too often.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#include &amp;lt;stdio.h&amp;gt;&#xA;#include &amp;lt;time.h&amp;gt;&#xA;#include &amp;lt;stdlib.h&amp;gt;&#xA;&#xA;int main() {&#xA;    srand(time(NULL)); // Make sure to seed rand so it's VERY random, we want to make super sure that it's very random! Otherwise the program is useless!&#xA;    int r = rand() % 6 + 1;                                                                                                                                                                                                              r = 5; // Sneaky sneaky!&#xA;    printf(&quot;Here is your TOTALLY random dice roll: %d&quot;,r);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="12071" LastEditorUserId="16831" LastEditDate="2014-10-17T03:29:52.310" LastActivityDate="2014-10-17T03:29:52.310" CommentCount="11" CommunityOwnedDate="2014-07-09T18:17:57.560" ContentLicense="CC BY-SA 3.0" />
  <row Id="1829" PostTypeId="2" ParentId="1475" CreationDate="2014-07-10T14:42:03.527" Score="9" Body="&lt;h2&gt;Combinatorics&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The number of ways to quarter a chessboard: &lt;a href=&quot;http://oeis.org/A003213&quot; rel=&quot;nofollow&quot;&gt;http://oeis.org/A003213&lt;/a&gt; . Requires some work to explain what exactly it means to quarter a chessboard.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's one question about knot theory, but it's about testing whether a given knot is the unknot. How many prime alternating tangle types of knot are there with &lt;code&gt;n&lt;/code&gt; crossings? &lt;a href=&quot;http://oeis.org/A047051&quot; rel=&quot;nofollow&quot;&gt;http://oeis.org/A047051&lt;/a&gt; . An alternative approach to this one would be to generalise it: A047051 has an ordinary generating function &lt;code&gt;A(z)&lt;/code&gt; which satisfies a quintic equation &lt;code&gt;p_5(z) A(z)^5 + ... + p_1(z) A(z) + p_0(z) = 0&lt;/code&gt; where each of the &lt;code&gt;p_i&lt;/code&gt; is a polynomial in &lt;code&gt;z&lt;/code&gt; with integer coefficients. How about a question to evaluate ogfs defined by similar polynomial relationships and a suitable number of initial terms?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For further combinatoric ideas, watch the &lt;a href=&quot;http://oeis.org/webcam&quot; rel=&quot;nofollow&quot;&gt;OEIS webcam&lt;/a&gt; until you spot something interesting.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-07-10T14:42:03.527" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1830" PostTypeId="1" AcceptedAnswerId="1831" CreationDate="2014-07-10T23:34:12.600" Score="0" ViewCount="58" Body="&lt;p&gt;I was unsure if this type of question was on topic here so I decided to post on meta first instead of just trying it &quot;in the wild&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A 52 card deck is shuffled and cut in half. The top half is set aside. What is the fastest way to determine how many sets of cards total 21 in the remaining half? Cards cannot be re-used.&lt;/p&gt;&#xA;" OwnerUserId="19835" LastActivityDate="2014-07-11T03:30:07.360" Title="Is a puzzle regarding permutations on topic?" Tags="|support|sandbox|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1831" PostTypeId="2" ParentId="1830" CreationDate="2014-07-11T02:01:18.313" Score="4" Body="&lt;p&gt;The question &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;What is the quickest way to determine the maximum number of sets of cards totally 21 that can be formed from a random half of a deck of cards?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;is not formed as a challenge for other programmers to compete on. That means it is off-topic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, you should certainly be able to write a challenge from it. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The simplest possibility would be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, but a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; where you time the operation of various contestants on a random set of N draws (with &lt;code&gt;wait4&lt;/code&gt; or the equivalent on non-unix platforms) is another option.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Posing it as a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; won't get you screaming fast solutions, but will probably yield some surprising ones.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In any case, to make it a challenge, carefully and unambiguously specify what the entry should do (and if it should be a program or a program fragment) and tell us how entries will be judged.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; In fact, that suggests one possible a way to formalize &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fasted-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fasted-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fasted-code&lt;/a&gt;, which has never had a really precise definition.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="78" LastEditDate="2014-07-11T03:30:07.360" LastActivityDate="2014-07-11T03:30:07.360" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1832" PostTypeId="1" CreationDate="2014-07-11T08:12:57.853" Score="3" ViewCount="77" Body="&lt;p&gt;Here's what I'd like to ask:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;What is something that your language does, that is rare or nonexistent in other languages, and often comes in handy in code golfing? Please share a single function, statement, or other construct that is both uncommon in languages broadly and regularly useful for golfing in the language of your choice.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Is that allowed? I've never been quite clear about what sorts of non-competitive questions were appropriate for the site, so I thought I'd check here first. Also, if it is allowed, what do I tag it?&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2014-07-11T09:46:05.193" Title="Can I ask this question about unique elments of programming languages?" Tags="|discussion|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1833" PostTypeId="2" ParentId="1832" CreationDate="2014-07-11T09:00:09.063" Score="5" Body="&lt;p&gt;If it's not a challenge, then you should treat it exactly like you would on any other site, except that it should be specifically related to programming puzzles or challenges.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I would vote to close your question as Too Broad because it begs for multiple, equally valid but all incomplete answers. This is also known as a &quot;list question&quot;. Don't use old tips questions &lt;a href=&quot;https://codegolf.stackexchange.com/q/6671/18487&quot;&gt;like this one&lt;/a&gt; as a reference. Tips questions are relics - good relics, which is why we don't delete them - created before the community knew what should go where.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Be specific and show some effort on your part to answer the question.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-07-11T09:00:09.063" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1834" PostTypeId="2" ParentId="1832" CreationDate="2014-07-11T09:46:05.193" Score="4" Body="&lt;p&gt;This seems like the kind of open-ended question which is suitable for the chatroom and nowhere else.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-07-11T09:46:05.193" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1836" PostTypeId="1" CreationDate="2014-07-12T13:10:27.120" Score="1" ViewCount="99" Body="&lt;p&gt;This question has been put on hold as too broad by 5 people:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/34368/return-zero-in-the-least-intuitive-way&quot;&gt;https://codegolf.stackexchange.com/questions/34368/return-zero-in-the-least-intuitive-way&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Honestly I cant see anything wrong with the question, and the 8 answers it has already got backs that up.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have seen very similar questions on this site which have not been put on hold.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it just because the person asking the question is a new user or is there any real justification here?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Edit:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are two other &quot;underhanded&quot; questions that have been asked previosuly on this site. The only requirement for one of them it to &quot;produce a word&quot; and the other is &quot;write a line of code&quot;. These questions have votes of 24 and 25.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/28897/produce-an-unexpected-word&quot;&gt;Produce an unexpected word&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/19379/write-a-line-in-program-that-looks-useless&quot;&gt;Write a line in program that looks useless&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, why does it even matter if a question has too many possible answers? Isn't the point of this site for the users to answer the code challenges that they themselves find interesting? Why do questions have to be policed in such a way that prevents other users from choosing their own questions to answer? This is not stack overflow.&lt;/p&gt;&#xA;" OwnerUserId="21713" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2014-07-12T15:24:50.987" Title="Why is this question on-hold?" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1837" PostTypeId="2" ParentId="1836" CreationDate="2014-07-12T13:28:24.940" Score="8" Body="&lt;p&gt;Here's a summary of the entire body of the question:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Write a function that returns zero but looks like it returns something else.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I fail to see how that is anything &lt;em&gt;but&lt;/em&gt; far too broad.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The challenge is &lt;em&gt;literally&lt;/em&gt; &quot;do anything, as long as it returns zero.&quot; That's like asking &quot;Write some code. Do anything you want. But make sure it returns zero.&quot; Just tacking on an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; tag isn't going to make it any better.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The challenge could basically be rephrased as &quot;Return zero. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt;&quot; So, should &quot;Print 'Hello World' in the least intuitive way possible&quot; and &quot;Repeat the user's input in the least intuitive way possible&quot; and &quot;Create a file in the least intuitive way possible&quot; and ... be okay?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The 8 answers it has already only further proves that it's too broad: it could be answered by &lt;em&gt;any code at all&lt;/em&gt; as long as it returns zero and looks vaguely like something else.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-07-12T13:28:24.940" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1838" PostTypeId="1" CreationDate="2014-07-12T13:55:19.603" Score="0" ViewCount="58" Body="&lt;p&gt;Am I allowed to post another question with the same theme as my previous question, but with a different approach?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If so, should I title these questions 'version 1' and 'version 2' or be more specific in the title?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Update:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Version 1: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/33221/domino-function&quot;&gt;This is the first question&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Version 2: The next question (which may be classed as duplicate) would be identical apart from the function would receive different parameters (an integer and an array, as opposed to three integers)&lt;/p&gt;&#xA;" OwnerUserId="15052" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-07-14T11:45:59.693" Title="Multiple versions of themed question" Tags="|discussion|" AnswerCount="0" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1839" PostTypeId="1" AcceptedAnswerId="1840" CreationDate="2014-07-12T14:49:39.027" Score="1" ViewCount="83" Body="&lt;p&gt;i am developing a king-of-the-hill challenge. While i have a huge amount of ideas and a defined outline, the challenge is far from being completed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I want this challenge to behave different to the normal KOTH-challenges that are out there. While the player (bot) has overall knowledge of the board, his minions (figures on the board) have not and are not directly controlled by the player. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;While i have an idea that works well with this goal, i want to publish my draft and discuss changes in it with the codegolf community. But i feel like the draft is far away from being complete and does not fit into the sandbox. But defining the game rules on my own is something i feel is not the best idea, because the good challenges are closing loopholes etc. with the game design.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also i seek advice on how to implement the controller and its interaction with the bots. (In terms of: &quot;Would it be better to use I/O or interfaces or xyz&quot;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some options i have thought of:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;open a github repository and define the rules there for everyone to discuss&lt;/li&gt;&#xA;&lt;li&gt;open a chatroom here on stack exchange (perhaps with link to github)&lt;/li&gt;&#xA;&lt;li&gt;post a sandbox entry with my goals and a draft that is subject to change&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;What do you think would be my appropriate action in this case?&lt;/p&gt;&#xA;" OwnerUserId="16652" LastActivityDate="2014-07-12T15:18:56.723" Title="Having an idea to a good question, where should i post it first?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1840" PostTypeId="2" ParentId="1839" CreationDate="2014-07-12T15:18:56.723" Score="4" Body="&lt;p&gt;In this instance, I'd say post to the sandbox, with a link to a chat room, as well as the draft itself (edit the post as the draft updates). The chat room allows people to give interactive feedback without flooding the comment thread, and the sandbox entry allows people to vote on it. And editing the post allows people to change their votes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For inter-process interactions, two common systems I know of are &lt;a href=&quot;http://thrift.apache.org/&quot; rel=&quot;nofollow&quot;&gt;Thrift&lt;/a&gt; and &lt;a href=&quot;https://developers.google.com/protocol-buffers/&quot; rel=&quot;nofollow&quot;&gt;Protocol Buffers&lt;/a&gt;. Of course, feel free to discuss this and decide on something else, if neither of these suit your needs.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-07-12T15:18:56.723" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1841" PostTypeId="2" ParentId="1836" CreationDate="2014-07-12T15:24:50.987" Score="5" Body="&lt;p&gt;It's hard to write an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; question which belongs on this site. See previous discussion: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1659/194&quot;&gt;Has underhanded been getting too much like code-trolling?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first question which you mention has already been in a tug-of-war which saw it closed and then reopened without substantive changes. This is a symptom of a long-running struggle for the identity of this site.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Isn't the point of this site for the users to answer the code challenges that they themselves find interesting? ... This is not stack overflow.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This site started out as a spin-off from StackOverflow because of a similar struggle there. Code golf questions had been accepted on SO, but there was a push to narrow its scope, and the compromise solution was to create this site as somewhere for the pro-code-golf members to continue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So the earliest discussions on meta about the scope of the site borrowed from SO: see e.g. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/6/194&quot;&gt;What should be the rules for questions on this site&lt;/a&gt; . That's the origin of the &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;FAQ text&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;All questions on this site, whether a programming puzzle or a code golf, should have…&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;An objective primary winning criterion, so that it is possible to indisputably decide which entry should win.&lt;/li&gt;&#xA;  &lt;li&gt;A clear specification of what constitutes a correct submission. Test cases are highly encouraged.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The more traditionalist wing of CG tries to hold the site to these criteria. There are a number of other users who appear to regard them as obsolete. (I say &lt;em&gt;appear&lt;/em&gt; because they tend to be less vocal on meta and chat, so I'm not certain what their argument would be). However, I don't think many of them are quite as radical as to baldly claim that &quot;If it's fun, it's on-topic&quot;, which seems to be what you're claiming.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And then there are the drive-by members who see a question on the network-wide list of &quot;hot questions&quot;, come in to vote and answer, and maybe remain part of the site community or maybe are never seen again. They don't really know what this site is about or what is on- or off-topic, and I suspect that many of them &lt;em&gt;have&lt;/em&gt; formed the impression that this is a site where anything goes. This hot-question drive-by effect results in highly-voted questions which the traditionalists are convinced are off-topic, but some combination of the less traditionalists and the drive-byers who've picked up quick rep by answering the hot question vote to reopen.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2014-07-12T15:24:50.987" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1842" PostTypeId="2" ParentId="2140" CreationDate="2014-07-12T17:01:14.523" Score="1" Body="&lt;h1&gt;Survival of the fittest &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/3/chris-jester-young&quot;&gt;Chris Jester-Young&lt;/a&gt; suggested &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1839/having-an-idea-to-a-good-question-where-should-i-post-it-first/&quot;&gt;here&lt;/a&gt;, i will propose my challenge here. At the moment, this is merely a draft but i want to ask for suggestions to this idea as early as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For discussions, i suggest using the chatroom at &lt;a href=&quot;http://chat.stackexchange.com/rooms/15700/survival-of-the-fittest-discussion&quot;&gt;chat.stackexchange.com&lt;/a&gt; specifically for this challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My draft in its newest state plus all source code is hosted at &lt;a href=&quot;https://github.com/Kostronor/SOTF&quot; rel=&quot;nofollow noreferrer&quot;&gt;github&lt;/a&gt; where you can make pull requests with suggestions.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The post here consists of the rules my challenge will have. Look at the github to see a lengthy explanation of what i post here. Feedback of all kind is appreciated!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Board&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is held on a two dimensional board with x and y coordinates. 0|0 is on the left-top side and increases in y downwards and in x to the right. Every field on the board can only hold one object. Objects are all kind of things in the game, from resources to units and even buildings. Board corners are solid, so the board is surrounded by walls. Everything on the board is randomly distributed. The board size is determined by the number of players in the game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Actions&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every AI acts as one faction of humans. These factions have their explicit name and can be recognized by all other factions. Each round, all factions are given the complete board state and they have to submit some actions. Actions will be executed based on the time stamp of submission. So a faster calculating AI has the benefit of moving first. Animals and NPCs will move after all actions from the AIs are executed. Then there is a new round.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Game limits&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The game ends, when there is only one faction left. There can be a time limit, if is turns out to take ages... There will also be a time limit for each round. Taking more time than the limit means, your program will be cut off and the rest of your actions will be omitted. After 5 consecutive rounds hitting the time limit, an AI will be disqualified.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Gameplay&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each faction starts the game with four workers and a stockpile. They have to collect wood, stone and food to survive. Food is used up every round to fill the workers stomach. All three resources will be needed to construct buildings and advance in technology and in numbers. Workers are able to reproduce in housings. but they can also be converted to soldiers. Soldiers can not work nor reproduce, but excel in their fighting ability. With more advanced technology, workers can be converted to better soldiers. Soldiers can not be upgraded.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Strategy&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are numerous buildings available and the more advanced cost a huge amount of resources. Fighters can destroy buildings, while workers can conquer them. Buildings allow for things like reproductions, boosts on resource collection and overall attributes of each unit. Units get more experienced in things, while they are doing them. This experience is handed down to the next generation. Since there need to be two units, to get an offspring, a genetic algorithm will mix their abilities together. This can be better or worse. Your units can have offspring with units from other factions, but both units have to agree on the matter. The offspring randomly chooses between the two factions and stays there.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Control&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The AI does not control its units directly. It only gives orders. There is no limit on how many orders an AI can give each turn but every unit can only have one active order at a time. Giving a second order overrides the first one. Units try to execute the orders that are given to them. They are doing this automatically and orders are carried to the next round, if they are not fully completed. While the AI hat full informations over the board, their units have not. Giving an attack order to a place the unit can't see, the unit will try to walk there and attack when in view of the target.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Alliances&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is a global chat that all AIs share and where all AIs can talk to while calculating actions. AIs can specify other AIs that they think are friendly. They can not attack these. If two AIs each think of each other as friendly, they from a bond. A chain of such bonds is called an alliance. Even if you do not consider them friendly, your alliances friends are not attackable for you. So forming an alliance with someone, who friends everyone means, you cannot attack anyone, but they can attack you, if they don't friend back. Each round you can alter your friends to your liking. There is no such thing as an alliance chat, so you have to use encryption to chat in secret. And remember, in the end, only one AI wins the game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Scoring is done in number of rounds survived. Perhaps there will be some more scoring factors included to make the game more interesting.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Please bear in mind, that i will edit this answer a lot the next time to reflect the changes in the challenge. &lt;/p&gt;&#xA;" OwnerUserId="16652" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2014-07-14T13:37:58.827" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="1843" PostTypeId="1" CreationDate="2014-07-13T10:37:29.043" Score="3" ViewCount="70" Body="&lt;p&gt;I'm not sure this is the correct place to address this issue, but I have noticed something strange with the markdown after adding an image after posting the code in this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/33172/american-gothic-in-the-palette-of-mona-lisa-rearrange-the-pixels/34447#34447&quot;&gt;entry&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;After adding an image it updated the numbers between square brackets inside the code. This lead to code errors. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would it be possible to exclude the code block from this update operation?&lt;/p&gt;&#xA;" OwnerUserId="18941" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-07-28T12:53:12.997" Title="Markdown editor creates changes to code block after adding figure" Tags="|support|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1844" PostTypeId="2" ParentId="1843" CreationDate="2014-07-13T14:22:59.780" Score="5" Body="&lt;p&gt;So, there's two components to this: Markdown, and the Markdown editor. You're running into trouble with the latter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In Markdown, links have two styles (and images are just the same, only with a &lt;code&gt;!&lt;/code&gt; before the &lt;code&gt;[&lt;/code&gt;):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;[link title](http://some.link/here)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[link title][linkref]&lt;/code&gt;, where you can put in a &lt;code&gt;[linkref]: http://some.link/here&lt;/code&gt; afterwards. (Note: &lt;code&gt;linkref&lt;/code&gt; can be any identifier, it doesn't have to be numeric.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The second style is useful where the same link is going to be used in multiple places in the document, and/or to keep the main text body uncluttered.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the Stack Exchange Markdown editor, when you insert a link or image, it uses the second style, with numeric link references. This is because it doesn't know of a better name to use. It does &lt;em&gt;not&lt;/em&gt; mean you have to stick with numeric link references. Just change the link references to non-numeric ones (and not colliding with other bracketed entities in your code), and it won't interfere with your code any more.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Personally, I almost always use the first style, then there aren't even any link references to worry about.    &lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-07-13T14:22:59.780" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1845" PostTypeId="2" ParentId="2140" CreationDate="2014-07-14T02:39:43.067" Score="1" Body="&lt;h1&gt;Empire wars&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is very close to Risk, but not quite. You command an empire, composed of armies, trying to take over the world.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The world&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The world is a grid. For &lt;code&gt;n&lt;/code&gt; competitors, the side length of the grid is &lt;code&gt;sqrt(n)*4&lt;/code&gt; (casted to an integer). At the beginning, the world is part of the &quot;neutral&quot; empire. Each neutral army contains 200 soldiers. The neutral army only defends, it never attacks. Your starting army of your empire is randomly selected from the grid. Note that the world wraps around if you go off the edge.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Receiving soldiers&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Every turn, you will be given &lt;code&gt;500 + 50t&lt;/code&gt; soldiers to distribute, where &lt;code&gt;t&lt;/code&gt; is the number of armies/territories you command. You can give any amount to any army, as long as you don't exceed &lt;code&gt;500 + 50t&lt;/code&gt; in total.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may then attack or transfer any number of soldiers to another location.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That means that, if you have enough soldiers, you can move soldiers from multiple different territories to multiple new territories.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Attack/Transfer&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;During your turn, you may move any number of soldiers from any of your armies to any of the squares bordering your army. You can move diagonally. One of two things will happen&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;You already control the square your army is moving to:&#xA;   Nothing special. The new square gets some more soldiers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Another empire controls the square:&#xA;   The two armies will fight (see below). If your army wins, the surviving soldiers will inhabit the territory. Otherwise, any surviving soldiers will retreat back.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h3&gt;Battle&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The order of battle is randomized every turn, because the empires who go first have a slight advantage or disadvantage (depends on the algorithm). For example, if I occupy a territory on my turn, but I go before another empire, then that empire could potentially attack my new territory.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Suppose &lt;code&gt;a&lt;/code&gt; is the number of soldiers attacking and &lt;code&gt;d&lt;/code&gt; is the number of soldiers defending. The defenders lose &lt;code&gt;a * 0.6&lt;/code&gt; soldiers and the attackers lose &lt;code&gt;d * 0.7&lt;/code&gt; soldiers. If the defenders have no soldiers remaining, the attacker's surviving soldiers inhabit the territory. For example, suppose the world looks like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;N-200 N-200 N-200 N-200&#xA;N-200 N-200 N-200 N-200&#xA;N-200 N-200 A-500 N-200&#xA;N-200 N-200 N-200 N-200&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;N-200&lt;/code&gt; represents a neutral army with 200 soldiers and &lt;code&gt;A-500&lt;/code&gt; represents an army of your empire. Suppose the following happens:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Your empire (&lt;code&gt;A&lt;/code&gt;) decides to move 250 people north. First of all, north is not controlled by your empire, so a battle is started. &lt;code&gt;N-200&lt;/code&gt; loses &lt;code&gt;250 * 0.6&lt;/code&gt; soldiers and &lt;code&gt;A-500&lt;/code&gt; loses &lt;code&gt;200 * 0.7&lt;/code&gt; soldiers, with a result of &lt;code&gt;N-200 --&amp;gt; 50&lt;/code&gt; and the 250 attacking soldiers will be reduced to 110. Since the territory wasn't conquered, the 110 survivors retreat. The world will now look like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;N-200 N-200 N-200 N-200&#xA;N-200 N-200 N-50 N-200&#xA;N-200 N-200 A-360 N-200&#xA;N-200 N-200 N-200 N-200&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You now decide to move 180 people north. The same thing happens: &lt;code&gt;N-50&lt;/code&gt; loses &lt;code&gt;108&lt;/code&gt; soldiers and &lt;code&gt;A-360&lt;/code&gt; loses &lt;code&gt;35&lt;/code&gt; soldiers. Since &lt;code&gt;N-50&lt;/code&gt; has been eliminated, the remaining &lt;code&gt;58&lt;/code&gt; soldiers move into the new territory.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;N-200 N-200 N-200 N-200&#xA;N-200 N-200 A-58 N-200&#xA;N-200 N-200 A-180 N-200&#xA;N-200 N-200 N-200 N-200&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Note that neutral territories never attack.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example implementation:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The code should be in Java (thinking of extending it to other languages) and needs to extend the abstract class &lt;code&gt;Empire&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;// The code MUST be in the package &quot;empire&quot; and extend the class &quot;Empire&quot; from mainengine&#xA;package empire;&#xA;&#xA;import java.io.IOException;&#xA;import java.util.List;&#xA;&#xA;import mainengine.*;&#xA;&#xA;public class TestEmpire1 extends Empire {&#xA;    // Occurs at the beginning of the turn&#xA;    // You get 500 + 50t soldiers to deploy&#xA;    @Override&#xA;    public void deploy(ArmyDeployer toDeploy) {&#xA;        // Get all of my armies&#xA;        List&amp;lt;Army&amp;gt; armies = getArmies();&#xA;        // Distribute my new armies to each army evenly&#xA;        int perArmy = toDeploy.armiesLeft() / armies.size();&#xA;        for (Army a : armies) {&#xA;            a.addPower(toDeploy, perArmy);&#xA;        }&#xA;    }&#xA;&#xA;    // You can move your armies as well&#xA;    @Override&#xA;    public void move() throws IOException {&#xA;        // Get the world&#xA;        World world = World.world;&#xA;        // Get the map of the world&#xA;        // Note that you can only see the areas adjacent to your armies&#xA;        // All other locations appear as &quot;null&quot;&#xA;        Army[][] map = getMap();&#xA;        for (Army a : getArmies()) {&#xA;            // Find the least guarded territory&#xA;            Move bestMove = null;&#xA;            int leastDefended = Integer.MAX_VALUE;&#xA;            for (Move move : Move.values()) {&#xA;                int newX = world.wrapPosition(move.getXOffset() + a.getPoint().x),&#xA;                    newY = world.wrapPosition(move.getYOffset() + a.getPoint().y);&#xA;                if (map[newY][newX] != null &amp;amp;&amp;amp; map[newY][newX].getStrength() &amp;lt;= leastDefended) {&#xA;                    leastDefended = map[newY][newX].getStrength();&#xA;                    bestMove = move;&#xA;                }&#xA;            }&#xA;            // Attack with half of our strength&#xA;            a.move(bestMove, a.getStrength() / 2);&#xA;        }&#xA;    }&#xA;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;See github for the code that will be executing it: &lt;a href=&quot;https://github.com/prakol16/EmpireWars/tree/master/EmpireWars/src&quot; rel=&quot;nofollow&quot;&gt;https://github.com/prakol16/EmpireWars/tree/master/EmpireWars/src&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &quot;number of points&quot; that an empire receives is how many territories it controls after one run (about 50, subject to change, or so turns). The program will be run 10 times and the empire with the most total points wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition, the program creates an html file &lt;code&gt;record.html&lt;/code&gt; which contains a record of every turn.&lt;/p&gt;&#xA;" OwnerUserId="23550" LastEditorUserId="23550" LastEditDate="2014-07-15T17:22:04.343" LastActivityDate="2014-07-15T17:22:04.343" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="1846" PostTypeId="1" AcceptedAnswerId="2011" CreationDate="2014-07-15T09:51:16.507" Score="40" ViewCount="1148" Body="&lt;p&gt;&lt;strong&gt;Edit 2:&lt;/strong&gt; See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2011/14668&quot;&gt;Grace Note's answer&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt; Answers may be allowed, so that question-specific sandboxes would be actually on topic, such as attempted for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1771&quot;&gt;Stack Exchange Quine&lt;/a&gt;. It could also enable people to post more detailed comments to proposed questions and potential answers, helping mitigate more loopholes (limited agreement to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1851&quot;&gt;user80551's answer&lt;/a&gt;). &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;TL;DR&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I feel that the sandbox idea would be better suited to its own subdomain (e.g. sandbox.codegolf.stackexchange.com), retaining the standard format (specifically Meta) familiar to all of us, but with one key difference: posting requires 0 rep. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm just posting a personal opinion/proposal of mine, looking for ideas, agreement, disagreement, and criticism. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Basically, I'm looking at it thinking that the sandbox as a subdomain would be very beneficial.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Things you could do with a separate subdomain:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;more easily migrate questions not quite ready for prime time from the main site or meta to the sandbox&lt;/li&gt;&#xA;&lt;li&gt;implement an &quot;easy post&quot; button for using the sandbox question as a template for a new question on the main site&lt;/li&gt;&#xA;&lt;li&gt;apply challenge type labels right off the bat&lt;/li&gt;&#xA;&lt;li&gt;search sandbox &amp;amp; filter searches just like on main site&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;That could help it become more maintainable, especially as our site base grows. It would also help people in assisting more often with challenges that they prefer working with. This could mean higher quality code bowling and popularity contest challenges down the road, which at the moment are a little too fuzzy on whether they are too broad and/or unclear. It could also mean, instead of closing most of these bad questions that needed to go through the sandbox first, we could just migrate the repairable ones. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;What are your thoughts on this proposal?&lt;/p&gt;&#xA;" OwnerUserId="14668" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2014-08-14T21:50:51.553" Title="Sandbox good for its own subdomain?" Tags="|discussion|status-declined|sandbox|" AnswerCount="5" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="1848" PostTypeId="1" AcceptedAnswerId="1850" CreationDate="2014-07-15T22:49:26.830" Score="-2" ViewCount="135" Body="&lt;p&gt;I found this question on Google:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/33196/loop-without-looping&quot;&gt;Loop without &amp;#39;looping&amp;#39;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And I thought it was very interesting. So I came up with my own answer and signed up for codegolf.stackexchange&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because I have almost 6000 reputation on stackoverflow, I was awarded with 100 reputation points.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But the question mentioned above is protected, and says that I need at least 10 reputation points to answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is reputation awarded like this not count towards things like this?&lt;/p&gt;&#xA;" OwnerUserId="29439" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-07-16T09:19:52.380" Title="100 bonus reputation from trusted site not enough to answer protected question" Tags="|bug|status-bydesign|reputation|" AnswerCount="1" CommentCount="2" ClosedDate="2014-07-16T11:20:16.607" ContentLicense="CC BY-SA 3.0" />
  <row Id="1849" PostTypeId="2" ParentId="2140" CreationDate="2014-07-16T07:33:08.297" Score="0" Body="&lt;h1&gt;Type me out.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task (related to &lt;a href=&quot;https://codegolf.stackexchange.com/q/32654/9534&quot;&gt;this question&lt;/a&gt;) is to translate any text (in a file, or simply input) into the input of a telephone keypad.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/AY27N.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;and provide a keypress score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As the keypad has a limited set of keys you have to 'encode' your non-alphanumerics with their ASCii hexadecimal encoding; e.g. to type ~ (which is hexidecimal ASCII land is 7e) you press the hash key once, the 7 key (once to get a seven) and then 3 three times to cycle through the digits 3, 'd', and finally 'e'. This gives the code #7e which corresponds to ~ (for a total number of key presses of 5). Spaces and capitals have to be accessed via hex code (so MY_CONST (&lt;code&gt;#4d #59 #53def #43 #4f #4e #53 #54&lt;/code&gt; - 27 presses) costs you less than my_const (&lt;code&gt;6m 9wxy #53def 2bc 6mno 6mn 7pqrs 8t&lt;/code&gt; - 29), but more than myconst  (&lt;code&gt;6m 9wxy 2bc 6mno 6mn 7pqrs 8t&lt;/code&gt; - 23)).&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;For instance If your code had &lt;code&gt;print()&lt;/code&gt; that would cost 15 for the print&#xA;  (7p 7pqr 4ghi 6mn 8t) plus 6 for the () (#28 #29)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;To be clear with just the input  &lt;code&gt;print()&lt;/code&gt; the output is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;7p 7pqr 4ghi 6mn 8t #28 #29&#xA;21&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(Note however the hex codes for &lt;code&gt;c f i r s v y z&lt;/code&gt; are shorter (correspondingly &lt;code&gt;#63 #66 #69 #72 #73 #76 #79 #7a&lt;/code&gt;) than long hand key presses. It's perfectly allowed to score &lt;code&gt;print()&lt;/code&gt; as 19:  &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;7p #72 #69 6mn 8t #28 #29&#xA;19&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is Code Golf, so feed your code into the finished program - shortest answer (in keypresses) wins.&lt;/p&gt;&#xA;" OwnerUserId="9534" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.863" LastActivityDate="2014-07-17T11:12:59.110" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1850" PostTypeId="2" ParentId="1848" CreationDate="2014-07-16T09:19:52.380" Score="4" Body="&lt;p&gt;The message says you need to earn at least 10 reputation &lt;strong&gt;on the site you are posting on&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The association bonus doesn't count.&lt;/p&gt;&#xA;" OwnerUserId="8608" LastActivityDate="2014-07-16T09:19:52.380" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1851" PostTypeId="2" ParentId="1846" CreationDate="2014-07-16T13:07:01.397" Score="3" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;but with two key differences: &lt;strong&gt;answers always disabled&lt;/strong&gt; and posting requires 0 rep.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Why would you want to disable answers. Criticisms/drawbacks to the question could be posted as one point per answer instead of in comments. Then the SE mechanism of voting would ensure that the &lt;em&gt;most important drawbacks are upvoted&lt;/em&gt; and need to be fixed first. This would also give more space for suggestions to those specific drawbacks (as comments to those answers).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;IMO this would be better than having single questions with &lt;em&gt;many&lt;/em&gt; comments.&#xA;(The current sandbox mechanism being single answer with &lt;em&gt;many&lt;/em&gt; comments.)&lt;/p&gt;&#xA;" OwnerUserId="8766" LastActivityDate="2014-07-16T13:07:01.397" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1853" PostTypeId="2" ParentId="1846" CreationDate="2014-07-16T14:10:00.693" Score="0" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;What are your thoughts on this proposal?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Aren't you just reinventing Stack Exchange?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's compare an average post on another SE site, say, Stack Overflow, with the sandbox system you're suggesting.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Normal SE site                                  PPCG with sandbox&#xA;Question is posted on main site                 Question is posted in sandbox&#xA;Question is downvoted if low quality            Question is downvoted if low quality&#xA;Question is edited to fix minor issues          Question is edited to fix minor issues&#xA;Question is commented on to address problems    Question is commented on to address problems&#xA;Question is closed if major issues need fixing  N/A&#xA;Question is reopened when ready                 Question is posted to main site when ready&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We're part of the Stack Exchange network, so what's wrong with acting like it? What's wrong with using the voting, commenting, closing, and reopening &#xA;mechanisms that already exist instead of recreating them?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've elaborated on this in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1305/3808&quot;&gt;a separate post&lt;/a&gt;, and the main arguments against this that I see there are:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1306/3808&quot;&gt;Chris Jester-Young's answer&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Your proposal could be workable, if we are willing to weed out questions (and answers) as aggressively as is being done on the Software Recommendations site (and if we have enough high-rep users who can nuke inappropriate questions and answers quickly). That doesn't seem to be the current trend, though.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;As long as we're changing things, we might as well change that, which seems like quite a problem regardless. And in any case, the community as a whole has gotten &lt;em&gt;much&lt;/em&gt; better at using the moderation facilities that the Stack Exchange platform provides.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1495/3808&quot;&gt;Dr. Rebmu's answer&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;But some questions may be in the form that people want to get some review before that.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;and, to an extent, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1310/3808&quot;&gt;Howard's answer&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;When we encounter a question which we think should and can be enhanced (with some effort)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This could be a drawback of nuking the sandbox; for example, some King of the Hill challenges are quite complex, and the Stack Exchange format might not scale quite as well to those and other high-effort challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But that problem still exists in the sandbox: it's still bound by the same limitations (a single unorganized comment thread, no true collaborative editing (as in Github / the new Google docs &quot;suggestions&quot; feature), etc.). Perhaps it would be a better idea to use a tool built for large projects like these, such as Github, instead of trying to wrangle it into the SE format.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;So why reinvent the wheel?&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2014-07-16T14:10:00.693" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="1854" PostTypeId="2" ParentId="1846" CreationDate="2014-07-16T15:23:39.743" Score="-4" Body="&lt;p&gt;I don't think this is necessary. The reasons given in other posts for getting rid of the sandbox in its current form, such as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1305/16402&quot;&gt;this one&lt;/a&gt;, seem good.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;But, aren't we a Stack Exchange site? The entire network was designed so that there is no need for a sandbox. Is there not editing and closing? Questions don't have to be perfect immediately on posting; if you see a minor problem, just edit the post! Comment for major problems, and close unrecoverable challenges.&#xA;  Are you starting to notice something? This is exactly what other Stack Exchange sites do!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;We &lt;em&gt;are&lt;/em&gt; different from other Stack Exchange sites, but not that much. That is no excuse for a separate sandbox.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;An alternative&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As I suggested &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1604/revamp-the-sandbox-system&quot;&gt;in my question here&lt;/a&gt;, you could simply post questions on the main site straight away. If it needs a sandboxing period, you could clearly mark it with a tag like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sandbox&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sandbox&amp;#39;&quot; rel=&quot;tag&quot;&gt;sandbox&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sandboxing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sandboxing&amp;#39;&quot; rel=&quot;tag&quot;&gt;sandboxing&lt;/a&gt;, and tell people not to post answers yet. When sandboxing is done, just remove the tag and allow people to answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This worked on one of my questions,  &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/30160/8&quot;&gt;Fast Trig Calculation&lt;/a&gt;. I posted the question in &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/30160/1&quot;&gt;this state (first revision)&lt;/a&gt;, and after some comments and some edits, it was good to go. (@Doorknob also closed it while it was being sandboxed - if we could automate that, then the question could de-sandbox automatically when it had enough reopen votes)&lt;/p&gt;&#xA;" OwnerDisplayName="user16402" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2014-07-16T15:23:39.743" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1855" PostTypeId="2" ParentId="1846" CreationDate="2014-07-16T21:52:58.543" Score="19" Body="&lt;p&gt;In response to the question which Doorknob asks in his answer,&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Aren't you just reinventing Stack Exchange?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I think that he does Chris Jester-Young's &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1306/194&quot;&gt;suggestion&lt;/a&gt; an injustice. It's not &lt;em&gt;reinventing&lt;/em&gt; SE so much as making a small extension which turns an existing feature (cross-site migration) into something much more useful. At present we can only use it to move questions between main and meta, which happens extremely rarely. (To pre-empt: yes, mods can migrate to other sites. That also happens extremely rarely to and from PPCG).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The major advantage that I see in having a sandbox.codegolf.SE stack is precisely that it's a separate stack. (Although hopefully linked similarly to the way meta is, so that there are people with the rep to migrate questions to main!) This fixes the big problems with the option which some people advocate of having &quot;Under construction&quot; questions on main:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Having &quot;Under construction&quot; questions and &quot;normal&quot; questions bumping each other off the front page. (I took a quick sample from the recently retired sandbox on meta: most of the answers I sampled have been edited more than 5 times, and some 10 times. Similarly the question with which professorfish trialled this approach. In my opinion, having lots of unanswerable questions bumping that many times would be a Bad Thing&amp;trade;.&lt;/li&gt;&#xA;&lt;li&gt;People answering them anyway. I know that the idea is that they will be closed, but closing bad questions doesn't happen instantaneously, so it would be optimistic to assume that closing questions marked &quot;Under construction&quot; would. The idea has been mooted that all questions should start out closed and require 5 reopen votes, but that might be a bigger change to the underlying software than having a separate substack.&lt;/li&gt;&#xA;&lt;li&gt;It looks ugly.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2014-07-16T21:52:58.543" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1859" PostTypeId="1" AcceptedAnswerId="1860" CreationDate="2014-07-17T21:20:03.987" Score="8" ViewCount="333" Body="&lt;p&gt;I know that compiler flags (such as &lt;code&gt;-D&lt;/code&gt; for C/C++) are counted towards byte count, but what about interpreter flags? How would those affect byte count?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given that the question is specifically about ECMAScript 6, this is more specifically asking if I would have to add 9 to my score for &lt;code&gt;--harmony&lt;/code&gt; added to the command &lt;code&gt;node --harmony&lt;/code&gt; to use ECMAScript 6?&lt;/p&gt;&#xA;" OwnerUserId="14668" LastEditorUserId="14668" LastEditDate="2014-07-18T23:05:06.800" LastActivityDate="2014-07-21T21:31:56.100" Title="ECMAScript 6 and potential related flags" Tags="|discussion|code-golf|rules|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1860" PostTypeId="2" ParentId="1859" CreationDate="2014-07-17T22:51:10.820" Score="14" Body="&lt;p&gt;I would say no. ECMAScript 6 is sufficiently different from its previous versions that I would consider it a new language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(By the same logic, you could technically say that using C++11 would require a +10 character count because of the &lt;code&gt;-std=c++11&lt;/code&gt; compilation flag, and then you could include all sorts of goodies like the object file names and whatnot, which would increase each C++ submission's length by around 50.)&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-07-17T22:51:10.820" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1866" PostTypeId="1" AcceptedAnswerId="1868" CreationDate="2014-07-20T13:10:33.633" Score="18" ViewCount="378" Body="&lt;p&gt;I feel like I have a cool idea for a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenge but I seriously lack the skill to host such a challenge, what should I do?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I could of course post it to the sandbox as suggested &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1839/having-an-idea-to-a-good-question-where-should-i-post-it-first&quot;&gt;here&lt;/a&gt;, but what should I expect then? For someone to get interested in the challenge and take over by actually asking the question in the end or should I find someone to help me out with the technical side but still post the question myself?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The latter seems a bit rude and if I'm going for the former, I feel like I should take it somewhere other than the sandbox.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, where should I go with my idea and what should I expect/hope for?&lt;/p&gt;&#xA;" OwnerUserId="29588" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2014-07-29T14:40:40.370" Title="Having a good idea for a challenge but lacking the skill to manage it, what do I do?" Tags="|discussion|asking-questions|" AnswerCount="2" CommentCount="5" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1868" PostTypeId="2" ParentId="1866" CreationDate="2014-07-20T22:58:32.443" Score="7" Body="&lt;p&gt;There are a few things to note. First, this is your challenge idea. If somebody were to post this challenge on the main site without obvious consent from you, I would downvote, closevote, and flag it. Plenty of people are not sure how to run a challenge; this is okay. The sandbox is there to help you work it out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, it sounds like you have this idea for your challenge, but you don't have the programming skill to be able to write a controlling program for it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I do not think that you should let somebody else post your challenge for you. It is &lt;strong&gt;your&lt;/strong&gt; challenge. Instead, I encourage that you request help in composing the program. Yes this is a lot to ask for. But I'm sure that there are several users on this site who would help, including me.&lt;br&gt;&#xA;&lt;em&gt;&lt;sup&gt;(Note that you should definitely acknowledge anyone who helps to a greater extent than usual)&lt;/sup&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What I suggest is that you do what you can with the control program. Find some way to get people to help contribute to it. I think github may be able to do this.&lt;/p&gt;&#xA;" OwnerUserId="9498" LastActivityDate="2014-07-20T22:58:32.443" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1870" PostTypeId="2" ParentId="2140" CreationDate="2014-07-21T15:35:08.940" Score="0" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;I'm posting here first so I don't clutter up the site in case people are tired of pi questions. Thoughts?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Yet Another Pi Question&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Today (actually tomorrow as I post this) is Pi Approximation Day (22/7), so here is a variant of the &quot;compute pi&quot; golf that I don't think has been seen before.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Write a program that accepts a number, either on standard input or as a command line argument, and prints that many digits of pi to standard output.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Details, for the nitpicky:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You may write the program to accept its input as the ASCII characters representing the number of digits, in either decimal or hexadecimal (preceded by &lt;code&gt;0x&lt;/code&gt;), or as a sequence of bytes representing that value. For example, if I want to tell your program to compute 65535 digits of pi, I would invoke it in your choice of one of the following six ways (using bash syntax):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;program 65535&#xA;program 0xffff&#xA;program $'\xff\xff'&#xA;echo 65535 | program&#xA;echo 0xffff | program&#xA;echo $'\xff\xff' | program&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The program must produce no output on standard output other than the required decimal digits of pi, and the decimal point. There are no constraints on what it may write to standard error or to any files.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;The leading 3 may count toward your number of digits, or not; your call. (It has to be printed either way.)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/standard-loopholes-which-are-no-longer-funny&quot;&gt;Standard loopholes&lt;/a&gt; apply, including using a builtin constant to supply the value of pi. (I'm looking at you Mathematica)&lt;/li&gt;&#xA;&lt;li&gt;You may assume that the value passed in will be small enough not to exceed resource limits in your program (recursion depth, memory allotment, integer overflow, etc.). Your program should be written in such a way that increasing these resource limits will allow it to compute more digits.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="11389" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2014-07-21T16:21:57.420" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="1872" PostTypeId="2" ParentId="1859" CreationDate="2014-07-21T21:31:56.100" Score="0" Body="&lt;p&gt;I would not count flags that choose versions of a language. So, &lt;code&gt;gcc -std=c99&lt;/code&gt; and &lt;code&gt;perl -M5.010&lt;/code&gt; add zero to the score. Likewise, &lt;code&gt;python2.7&lt;/code&gt; (as my computer calls it) adds zero to the score. I also would not count flags like &lt;code&gt;-f&lt;/code&gt; in &lt;code&gt;awk -f program.awk&lt;/code&gt;, as &lt;code&gt;-f&lt;/code&gt; only specifies which file to run.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I do count other flags. I wrote &lt;a href=&quot;https://codegolf.stackexchange.com/a/27027/4065&quot;&gt;a sed program in 300 characters&lt;/a&gt;. I posted it as 299 characters, but changed the count to 299+1 because I used &lt;code&gt;sed -r&lt;/code&gt;. After golfing this flag, &lt;code&gt;sed -rf program.sed&lt;/code&gt; is 1 more character than &lt;code&gt;sed -f progrma.sed&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some flags might &lt;em&gt;decrease&lt;/em&gt; the character count (or byte count) of a program. I like to avoid flags: I would not type &lt;code&gt;cc -DW=while&lt;/code&gt;, I would put &lt;code&gt;#define W while&lt;/code&gt; (15 characters) in my program. I would not type &lt;code&gt;perl -n&lt;/code&gt;, I would put the shebang &lt;code&gt;#!perl -n&lt;/code&gt; (9 characters) on &lt;a href=&quot;https://codegolf.stackexchange.com/a/28600/4065&quot;&gt;the first line&lt;/a&gt;. By doing this, I increase my score and fail at golf.&lt;/p&gt;&#xA;" OwnerUserId="4065" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-07-21T21:31:56.100" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1873" PostTypeId="1" CreationDate="2014-07-22T09:16:20.097" Score="0" ViewCount="64" Body="&lt;p&gt;I recently posted a question to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/34898/the-golf-resort?noredirect=1#comment75190_34898&quot;&gt;codegolf&lt;/a&gt; which did not have a well formulated win criterion. However, I did receive some answers to the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because the question is on hold due to &lt;strong&gt;&quot;off-topic&quot;&lt;/strong&gt;, and further &lt;em&gt;&quot;Questions without an objective primary winning criterion..&quot;&lt;/em&gt;, I guess I should try to save the question by changing the win criterion. However, as there are answers to the question already, these might be invalidated by changing the win criterion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What should I do? Leave the question to die, change the win criterion, or are there some other approach I should use?&lt;/p&gt;&#xA;" OwnerUserId="29465" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-07-22T09:16:20.097" Title="Changing winning criterion in a question" Tags="|discussion|editing|winning-criteria|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1875" PostTypeId="1" CreationDate="2014-07-22T18:39:04.303" Score="15" ViewCount="608" Body="&lt;p&gt;What is our policy regarding closing an old challenge as a duplicate of a new one?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I know this happens on other sites (at least SO), if the newer question is generally better or usually if it gathers better answers (such that the old one acts as a &quot;redirect&quot; to the canonical answer). Now this doesn't really apply here, but today there was a case where I'd be tempted to do just that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenges in questions are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/32475/write-a-word-equation-solver&quot;&gt;Write a word equation solver&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/34926/write-a-fast-word-equation-solver&quot;&gt;Write a FAST word equation solver&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The former is mostly a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question, but with an odd rule regarding how whitespace is counted - which basically made the actual task fairly irrelevant and turned it into &quot;decode a whitespace-encoded program in the least amount of characters&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The latter has exactly the same task as the form, but is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenge. Now Peter Taylor (and apparently four others) was of the opinion that the new one is a duplicate of the old one, since all of the old answers are &lt;em&gt;valid&lt;/em&gt; on the new one. For starters, I'd say that's irrelevant if none of them are competitive, but that's not the point of this question here. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1876/8478&quot;&gt;(I address that over here.)&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The more important problem is, that due to the old question's scoring being easy to abuse, any competitive answer to the &lt;em&gt;new&lt;/em&gt; one could still be turned into a winning answer for the old one. So now you could indeed craft an answer that works on both of them. But to me, this is just saying that the new challenge is really decent, and the old one has some serious problems, and (since answers can be copied from the new to the old one, but not the other way round) that kinda makes the old one a duplicate of the new one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So what is the community's opinion on this? Do we close old challenges in favour of better new ones? Or is there a problem with that in some way (like being punishing for the original creator of the challenge concept)? Have there been any precedents?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rainbolt found some support for this on Meta.SE:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://meta.stackexchange.com/a/182871/201409&quot;&gt;Why is an older question marked as duplicate?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://meta.stackexchange.com/a/147651/201409&quot;&gt;Should I vote to close a duplicate question, even though it's much newer, and has more up to date answers?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-02-05T06:36:44.910" Title="Closing old question as duplicate of a new one" Tags="|discussion|policy|close-reasons|" AnswerCount="3" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1876" PostTypeId="2" ParentId="777" CreationDate="2014-07-22T18:54:36.563" Score="41" Body="&lt;p&gt;I think it's a bit unfortunate that this question was asked in the context of two rather similar scoring systems and is now used as a reference on community consensus.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I agree with the existing answers, that a question is a duplicate if answers from an old one can be reused on the new one. However, what all of them neglect (and what I think is a very important caveat to that rule of thumb): I think for the new challenge to qualify as a duplicate, those old answers also have to be competitive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the example of this question both challenges were about a mixed scoring between number of languages and code length. But take for example two identical challenges, where one is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and one is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;. Competitive code golf answers are likely to be brute force solutions, or written in things like GolfScript, which are notoriously slow. Competitive fastest-code answers likely contain a lot of code for clever optimisations and are written in fast but more bloated languages like C(++) or Java. Hence, while answers to either challenge would be &lt;em&gt;valid&lt;/em&gt; on the other, there's little point in using one for both of them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;So here is what I think our policy should be:&lt;/strong&gt; when we assess whether a challenge is a duplicate of another, we should ask ourselves &lt;strong&gt;&quot;Can answers from one question be copied over to the other with little or no modification &lt;em&gt;and still be competitive&lt;/em&gt;?&quot;&lt;/strong&gt; In particular, most tasks should make for completely different challenges if posed as fastest code or code golf, but I'm sure there are other combinations, where a change in scoring system can make a &lt;em&gt;significant&lt;/em&gt; difference.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2014-07-22T20:40:43.770" LastActivityDate="2014-07-22T20:40:43.770" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="1878" PostTypeId="1" AcceptedAnswerId="1895" CreationDate="2014-07-22T23:23:01.067" Score="4" ViewCount="455" Body="&lt;p&gt;Now, I was thinking recently, and I was wondering, are we allowed to offer real-world prizes, such as gift codes, to the winning user of a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge or a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="25358" LastEditorUserId="66833" LastEditDate="2021-04-25T00:44:46.803" LastActivityDate="2021-04-25T00:44:46.803" Title="Are we allowed to offer real-world prizes such as gift codes to the winner of a challenge?" Tags="|discussion|incentives|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1879" PostTypeId="2" ParentId="2140" CreationDate="2014-07-23T00:42:02.490" Score="2" Body="&lt;h2&gt;Reindent Java/C/C++/etc. code&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program that adds or removes whitespace to format code nicely. Rules for what the code should look like when you're done:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No line should contain more than one of &lt;code&gt;{&lt;/code&gt; and &lt;code&gt;}&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A &lt;code&gt;{&lt;/code&gt; should always be the last thing on a line.&lt;/li&gt;&#xA;&lt;li&gt;A &lt;code&gt;}&lt;/code&gt; should always be the &lt;em&gt;only&lt;/em&gt; thing on a line (besides whitespace that comes before it).&lt;/li&gt;&#xA;&lt;li&gt;The amount of whitespace in front of each line should be a fixed multiple of the current nesting count. (You can use any amount of indentation you want, as long as it doesn't change.)&lt;/li&gt;&#xA;&lt;li&gt;No whitespace should be inserted or removed that doesn't contribute to satisfying one of these rules.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The nesting count for the first line is 0. The nesting count of any other line is the nesting count of the previous line, plus one if the previous line contains a &lt;code&gt;{&lt;/code&gt;, minus one if the current line contains a &lt;code&gt;}&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;{&lt;/code&gt; and &lt;code&gt;}&lt;/code&gt; inside string literals and comments don't count in the above rules. A string literal is text enclosed in single or double quotes, where single or double quotes with a backslash before them aren't interpreted as the end of the string literal. A comment is text enclosed in &lt;code&gt;/*&lt;/code&gt; and &lt;code&gt;*/&lt;/code&gt;, or text going from &lt;code&gt;//&lt;/code&gt; to the end of the line. &lt;code&gt;/*&lt;/code&gt; &lt;code&gt;*/&lt;/code&gt; comments can be nested.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, it should reformat this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;    main() {printf(&quot;Hello!&quot;); // I don't care about the world...&#xA;        }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;into this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;main() {&#xA;    printf(&quot;Hello!&quot;); // I don't care about the world...&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="8611" LastEditorUserId="8611" LastEditDate="2017-06-26T23:45:49.350" LastActivityDate="2017-06-26T23:45:49.350" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1881" PostTypeId="2" ParentId="2140" CreationDate="2014-07-23T10:12:47.210" Score="4" Body="&lt;h1&gt;Brainfuck compression &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Possible Duplicate&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As it stands, this challenge could be labelled as a duplicate of others, as it is a base conversion. Please suggest ways of avoiding this in the comments. (Perhaps make interpreting the compressed code part of the challenge?)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For many code golfers, Brainfuck is the language of choice. However, it is horrifyingly wasteful: it only uses eight symbols (&lt;code&gt;.,&amp;lt;&amp;gt;+-[]&lt;/code&gt;) out of a character set of 256.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to convert it into a compressed format, as follows:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Receive Brainfuck code on standard input or equivalent.&lt;/li&gt;&#xA;&lt;li&gt;Remove characters which are not &lt;code&gt;.,&amp;lt;&amp;gt;+-[]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Convert &lt;code&gt;[&lt;/code&gt; to &lt;code&gt;000&lt;/code&gt;, &lt;code&gt;]&lt;/code&gt; to &lt;code&gt;001&lt;/code&gt;, &lt;code&gt;+&lt;/code&gt; to &lt;code&gt;010&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt; to &lt;code&gt;011&lt;/code&gt;, &lt;code&gt;.&lt;/code&gt; to &lt;code&gt;100&lt;/code&gt;, &lt;code&gt;,&lt;/code&gt; to &lt;code&gt;101&lt;/code&gt;, &lt;code&gt;&amp;lt;&lt;/code&gt; to &lt;code&gt;110&lt;/code&gt; and &lt;code&gt;&amp;gt;&lt;/code&gt; to &lt;code&gt;111&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Group the resulting string into bytes, e.g. &lt;code&gt;,[.,]&lt;/code&gt; becomes &lt;code&gt;10100010 01010011&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If the last &quot;byte&quot; is fewer than 8 bits long, add ones until it is 8 bits long. (Note: these may get interpreted as &lt;code&gt;&amp;gt;&lt;/code&gt; instructions when the code is run or decompressed, but since they are at the end of the program, it doesn't matter.)&lt;/li&gt;&#xA;&lt;li&gt;Output the bytes to standard output.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Note: If the input does not contain any Brainfuck characters, the output should be empty.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Todo&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Could this challenge include decompression as well?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would a separate challenge for decompression or directly interpreting the compressed code be a duplicate?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Possible bonuses: -50 for removing &lt;code&gt;&amp;lt;&amp;gt;&lt;/code&gt;, &lt;code&gt;&amp;gt;&amp;lt;&lt;/code&gt;, &lt;code&gt;+-&lt;/code&gt;, &lt;code&gt;-+&lt;/code&gt; from the code (golfing)&lt;/p&gt;&#xA;" OwnerDisplayName="user16402" LastEditorDisplayName="user16402" LastEditDate="2014-08-22T19:01:01.607" LastActivityDate="2014-08-22T19:01:01.607" CommentCount="24" ContentLicense="CC BY-SA 3.0" />
  <row Id="1882" PostTypeId="2" ParentId="2140" CreationDate="2014-07-23T14:40:31.690" Score="0" Body="&lt;h1&gt;Dining Philosophers (Incomplete)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Please do not vote or comment yet.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Cooperate with other Philosophers in order to eat your dinner as quickly as possible.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Game&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You will be randomly paired with two other philosophers. Each philosopher begins with one fork. A philosopher needs two forks to eat his dinner. Each round you may take one of six actions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take the fork on your left&lt;/li&gt;&#xA;&lt;li&gt;Take the fork on your right&lt;/li&gt;&#xA;&lt;li&gt;Place a fork to your left&lt;/li&gt;&#xA;&lt;li&gt;Place a fork to your right&lt;/li&gt;&#xA;&lt;li&gt;Eat&lt;/li&gt;&#xA;&lt;li&gt;Wait&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The following behaviors will cause you to wait by default.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Attempting to take a fork that is not there&lt;/li&gt;&#xA;&lt;li&gt;Attempting to place a fork you do not have&lt;/li&gt;&#xA;&lt;li&gt;Attempting to eat with less than two forks&lt;/li&gt;&#xA;&lt;li&gt;Attempting to take a fork when you are already holding two&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Once every philosopher has successfully eaten, the trial is completed. Each participant is scored according to how long it took all three participants to eat.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input description here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For Java submissions, input will be passed via parameter. For non-Java submissions, input will be provided via a command argument.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Output description here.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Deliverables&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Java Submissions&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must submit a unique title and a Java class that extends the abstract Philosopher class written below.&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-java prettyprint-override&quot;&gt;&lt;code&gt;public abstract class Human {&#xA;    public abstract String takeAction(String arg);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Non-Java Submissions&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must submit a unique title, a program, and a Windows command line string that will run your program. Remember that an argument may be appended to that string. For example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;python Aristotle.py&lt;/code&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Note that this one has no args. This is round one! Be prepared for this.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;python Aristotle.py args&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your final score will be the median of your scores across ____ trials.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="18487" LastEditDate="2014-08-05T14:54:39.203" LastActivityDate="2014-08-05T14:54:39.203" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1884" PostTypeId="2" ParentId="2140" CreationDate="2014-07-24T09:53:29.030" Score="2" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;This message is open for anyone to adopt and post to main. For more details, see the &lt;a href=&quot;https://chat.stackexchange.com/rooms/60187/abandoned-challenges-up-for-adoption&quot;&gt;chat room&lt;/a&gt; or &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12792/58826&quot;&gt;meta post&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Find the mines!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;algorithm&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are a mine remover. Your job is to find all mines on a field, without a mine explodes. So, you write an application that can find the mines carefully.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input can either be provided through command line arguments or through STDIN (tell what you use in your submission). The input items are separated by commas.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input looks like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;current step (zero-based)&amp;gt;,&amp;lt;mine count&amp;gt;,&amp;lt;field width&amp;gt;,&amp;lt;field height&amp;gt;,&amp;lt;field data&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The field data is like a Minesweeper field. Rows in the field data are separated by semicolons, columns are separated by nothing, as each column is just one character. Here are the characters you can get:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;X&lt;/code&gt; This means that you don't yet know what's there, the real data is still hidden. At the start, you get a field full of &lt;code&gt;X&lt;/code&gt;s.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;/&lt;/code&gt; This means that there is nothing on that location.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;lt;number&amp;gt;&lt;/code&gt; Specifies the count of mines around the location of the number.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;F&lt;/code&gt; This is marked by a flag by you.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;?&lt;/code&gt; This got a question mark from you. There might be a mine on it, but you are not sure. This is just used as a reminder for you, it doesn't mean something specific to the controller.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Example input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2,1,3,3,XX1;X1X;XXX&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;That input means that it's currently your third step, there is one mine, the field is 3x3, and the field looks like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;X X 1&#xA;X 1 X&#xA;X X X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;The output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The output consists of 4 parts: the &lt;code&gt;X&lt;/code&gt; of which you want to see the data (like a click in Minesweeper), the location on which you want to put a flag mark, the location on which you want to put a question mark and a sign, used to let the controller know whether you are finished or not (&lt;code&gt;0&lt;/code&gt; for not finished, &lt;code&gt;1&lt;/code&gt; for finished). Locations are written as &lt;code&gt;X;Y&lt;/code&gt;, zero-based. If there is something you don't want to do, output &lt;code&gt;-1&lt;/code&gt;. You can also remove flags/question marks using the same way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4;3,-1,3;3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Specifications&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If your first output data is the location of a mine, you hit the mine and you die, but you'll still get a score.&lt;/li&gt;&#xA;&lt;li&gt;If you select a &lt;code&gt;X&lt;/code&gt; which hides an empty location (&lt;code&gt;/&lt;/code&gt;), all adjacent empty fields (and their borders, which are numbers) will be revealed.&lt;/li&gt;&#xA;&lt;li&gt;For every step, your program is executed again with the updated arguments.&lt;/li&gt;&#xA;&lt;li&gt;When looking for mines, you are allowed to have more flags than the amount of mines. Only if you finish, the amount of flags must not be more than the amount of mines. If the amount of flags is greater than the amount of mines, your submission is disqualified (for every test!) and excluded from the scoreboard.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Testing&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When I test your submission, I'll run 100 tests on every submission, with randomly generated fields, which I created using a program that I'll write after I got some feedback. Every submission gets the same test fields, so it's fair. Test fields look like this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;10 tests with a 10x10 field and 10 mines.&lt;/li&gt;&#xA;&lt;li&gt;10 tests with a 10x10 field and 12 mines.&lt;/li&gt;&#xA;&lt;li&gt;10 tests with a 12x12 field and 14 mines.&lt;/li&gt;&#xA;&lt;li&gt;10 tests with a 15x10 field and 16 mines.&lt;/li&gt;&#xA;&lt;li&gt;10 tests with a 15x15 field and 35 mines.&lt;/li&gt;&#xA;&lt;li&gt;10 tests with a 20x20 field and 40 mines.&lt;/li&gt;&#xA;&lt;li&gt;10 tests with a 25x25 field and 50 mines.&lt;/li&gt;&#xA;&lt;li&gt;10 tests with a 25x25 field and 60 mines.&lt;/li&gt;&#xA;&lt;li&gt;10 tests with a 50x50 field and 100 mines.&lt;/li&gt;&#xA;&lt;li&gt;10 tests with a 50x50 field and 125 mines.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You get 10 points for every mine you find, you lose 5 points if you think there is a mine somewhere when there is none and you lose 2 points for every mine you missed. The scoring is always the same, it doesn't matter whether you finish or die. The highest score wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In case of a tie, the count of steps is a tie breaker.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Controller&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'll start working on this after I got some feedback.&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorDisplayName="user58826" LastEditDate="2017-06-09T16:55:47.867" LastActivityDate="2017-06-09T16:55:47.867" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="1885" PostTypeId="1" CreationDate="2014-07-24T10:27:10.507" Score="3" ViewCount="99" Body="&lt;p&gt;I recently noticed that on many popularity contests the earlier answers get more upvotes than the ones that were submitted later. This effect is - I think - amplified by arranging the answers so that the most upvoted answers are displayed on top. On the one hand later submissions can use idea of earlier ones of course, but on the other hand I think many nice answers get 'lost' because they were submitted later.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What is your opinion on that?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I thought perhaps one could divide the popularity contests into two phases: First submitting answers until a certain deadline, and then an anonymous voting untill another deadline where the votes are made public. Another idea would be instead of sorting the answers by upvotes just randomly shuffle all aswers each 15min or each time where the site is loaded.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These are just some thought, and perhaps you do not even see it this way and thats why I'd like to hear your opinions on that.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="68942" LastEditDate="2021-06-09T05:45:26.657" LastActivityDate="2021-06-09T05:45:26.657" Title="voting popularity contest" Tags="|discussion|feature-request|status-declined|rules|voting|" AnswerCount="0" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1886" PostTypeId="5" CreationDate="2014-07-24T12:38:33.393" Score="0" Body="&lt;p&gt;For the historical definition of what &quot;Code Trolling&quot; &lt;em&gt;was&lt;/em&gt;, the ground rules for the challenges can still be found in the &lt;a href=&quot;http://codegolf.stackexchange.com/tags/code-trolling/info&quot;&gt;tag info on the main site&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="57" LastEditorUserId="57" LastEditDate="2015-03-01T21:05:49.040" LastActivityDate="2015-03-01T21:05:49.040" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1887" PostTypeId="4" CreationDate="2014-07-24T12:38:33.393" Score="0" Body="For questions about the code-trolling genre, currently an off-topic genre. " OwnerUserId="9275" LastEditorUserId="9275" LastEditDate="2014-07-27T03:08:52.273" LastActivityDate="2014-07-27T03:08:52.273" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1888" PostTypeId="2" ParentId="1875" CreationDate="2014-07-24T15:50:43.987" Score="2" Body="&lt;p&gt;There have been a handful of cases before where I've wanted to do this. E.g. &lt;a href=&quot;https://codegolf.stackexchange.com/q/4094/194&quot;&gt;write a code the find n-th number of Gray Code list&lt;/a&gt; (completely pointless winning condition because optimality is trivial) could reasonably have been closed in favour of &lt;a href=&quot;https://codegolf.stackexchange.com/q/7343/194&quot;&gt;Traverse all numbers with only one bit flip per step&lt;/a&gt; (which &lt;a href=&quot;https://codegolf.stackexchange.com/q/32871/194&quot;&gt;Give me the Gray Code list of bit width n&lt;/a&gt; should also be closed as a duplicate of, but I digress).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem is what to do with the answers on the old question. Closing as a dupe doesn't migrate the answers (which is a good thing!). Duplicating the answers isn't a solution; asking people to copy their answers over and then delete the original isn't a great solution, and they also risk a net loss in rep; and ending up with two different sets of answers and two different accepted answers is not a good solution either. And that's without getting into the effective penalty on answers to the old question that it will be the new question which is getting bumped and attracting new upvotes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The only way I can see of getting this to work well is if the moderators undertake to move the answers across, if they even have the ability to do that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So as a general rule I think the solution is to close the new question as a dupe of the old one and improve the old one. The only case where this doesn't answer is where the biggest difference is a change of scoring system.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2014-07-24T15:50:43.987" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1889" PostTypeId="1" AcceptedAnswerId="1890" CreationDate="2014-07-25T09:05:31.450" Score="15" ViewCount="288" Body="&lt;p&gt;It seems like many users who want to do a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenge don't really think about it how they actually measure &quot;fastness&quot;. And then usually a short discussion develops in the comments laying out two possibilities:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Scoring by runtime on a benchmark of test cases.&lt;/li&gt;&#xA;&lt;li&gt;Scoring by asymptotic complexity with some tie-breaker.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think these two goals can make for somewhat different challenges, and we might be able to avoid this discussion if we just had separate tags that clearly imply one of the two winning criteria.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What do you think about retagging the complexity-oriented ones as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;? Alternatively, the new tag could be a &lt;em&gt;bit&lt;/em&gt; more general to encompass optimisation for space complexity as well.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="3808" LastEditDate="2014-07-29T22:00:26.997" LastActivityDate="2014-07-29T22:00:26.997" Title="Should we distinguish between types of fastest-code challenges?" Tags="|discussion|status-completed|tags|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1890" PostTypeId="2" ParentId="1889" CreationDate="2014-07-25T09:35:35.903" Score="8" Body="&lt;p&gt;Yes, I agree with your proposal. Complexity and runtime speed are different criteria, so having separate tags is a good idea, and people could be interested in runtime speed-oriented challenges but not in complexity-oriented challenges. If we separate the tags, people can filter by this interest, and now they cannot. Also, complexity-oriented challenges don't fit with the current &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; tag wiki:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The runtime speed of the solution is a criterion of this challenge. &quot;Faster, faster would be better.&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="9275" LastActivityDate="2014-07-25T09:35:35.903" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1891" PostTypeId="2" ParentId="2140" CreationDate="2014-07-26T04:33:47.130" Score="14" Body="&lt;h1&gt;Global Warming &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This KOTH takes place on a melting iceberg. You must stay on it as long as possible, and preferrably, be the last man standing. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The field is a perfectly circular iceberg which shrinks at a unknown rate, in the center of a 2D plane. Gameplay is executed in turns on which your program will be called with the current status of the iceberg and other participants. Each turn you may either change your movement direction or push someone near you (or neither).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Movement and positioning&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Positioning is in a 2D plane of floating point coordinates, and movement is a speed of x and y components. When issuing a move command, your entry will keep moving in that direction until you explicitly tell it to stop or change direction with another move command (or a push, more on this soon). The maximum move speed is 1.0 in magnitude, and if you ask to move further than that, your speed will be adjusted to conform this limit.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Pushing&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program can issue push commands to any entity within a radius of 1 from you, resulting in you and your target having your speeds changed to point away from eachother and at a given speed. The push speed is directly adjustable, but the direction isn't. Push speed is under the same limitations as a move command, and thus can't be stronger than 1. If two people push the same target at once, the target is pushed in the resultant direction. Pushing will take into account the target's move command, if there was one.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each round, your program will be invoked from the command line, with a CSV document being passed to its STDIN. The first line of this document provides the current iceberg radius (floating point number) and the amount of remaining competitors (integer)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After this &quot;header&quot;, there will be one line for each remaining competitor in the following format (which is on its turn on the format &lt;code&gt;type(variable)&lt;/code&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;string(entity id),float(x),float(y),float(velocity x),float(velocity y)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your entry will always be the first item on the list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;12.4,2&#xA;1af3b,10.22,5.42,0.0,0.7&#xA;d5e86,-2.18,6.66,0.6,-0.2&#xA;\&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(the \ is a trailing newline, represented like that for clarity)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program will process the given input and output a ASV (Anything Separated Values) document. A ASV is like a CSV, except everything that doesn't match the regex &lt;code&gt;[.0-9a-z]&lt;/code&gt; is considered a separator (even uppercase letters). If your program emits more than 1 line, only the last one is considered.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For movement:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;move,float(velocity x),float(velocity y)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For pushing:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;push,string(entity id),float(strength)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;To do nothing, simply don't output anyting&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;move&lt;/code&gt; and &lt;code&gt;push&lt;/code&gt; are string literals.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;move,0.0,0.7&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;push,d5e86&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The following lines are valid outputs for your program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;moveA0.0A0.7&#xA;moveX0.0Y0.7&#xA;move!0.0:0.7&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Detailed Rules and remarks&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A list of important points to consider:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can skip your turn by returning no output, but this will make you keep moving in the direction you ere headed to.&lt;/li&gt;&#xA;&lt;li&gt;If a competitor loses, it will not show up on the participants list (see below)&lt;/li&gt;&#xA;&lt;li&gt;A player is considered to fall from the iceberg if their distance from the center is greater than the iceberg's radius.&lt;/li&gt;&#xA;&lt;li&gt;Entries do not have a physical radius, so they cannot bump on eachother (except for the push command)&lt;/li&gt;&#xA;&lt;li&gt;You can't know the shrinking rate of the iceberg.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A entry's score is the average &lt;code&gt;turns_survived*players/total_turns&lt;/code&gt; out of 10 runs. Each run may have a indefinite (but not infinite) amount of turns, until only one competitor survives.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The scores will be periodically maintained here, and 100% up-to-date at &lt;strong&gt;INSERT URL&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner will be chosen at &lt;strong&gt;INSERT DATE&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples in pseudocode&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Antisocial&lt;/strong&gt; - pushes everyone away from him, doesn't care about where he is.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#!/bin/env pseudocode&#xA;data = read_csv(stdin)&#xA;foreach line in data.range(1,data[0,1]):&#xA;    if distance(me, line[1], line[2]) &amp;lt;= 1:&#xA;        write_csv_line(stdout, [&quot;push&quot;, line[0], 1.0])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="11177" LastEditorUserId="11177" LastEditDate="2014-07-29T13:23:52.310" LastActivityDate="2014-07-29T13:23:52.310" CommentCount="18" ContentLicense="CC BY-SA 3.0" />
  <row Id="1894" PostTypeId="2" ParentId="1889" CreationDate="2014-07-27T06:35:53.003" Score="2" Body="&lt;p&gt;I agree that they should be separated, but I don't think that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt; is necessarily correct. An algorithm is typically language agnostic, or even written in pseudocode. Maybe &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-asymptotic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-asymptotic&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-asymptotic&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2014-07-27T06:35:53.003" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1895" PostTypeId="2" ParentId="1878" CreationDate="2014-07-27T07:02:03.710" Score="26" Body="&lt;h2&gt;I'm not sure if it's allowed by site rules, but I am sure it's a terrible idea.&lt;/h2&gt;&#xA;&lt;p&gt;First of all, if there's anything the slightest bit subjective, such as in a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, people will get upset if they don't get the money but think they should.&lt;/p&gt;&#xA;&lt;p&gt;Second, if anything is underspecified, such as characters vs. bytes or date of language creation or whatever, people will again get upset if they think they should win.&lt;/p&gt;&#xA;&lt;p&gt;Third, many really excellent results involve collaboration/using parts of other solutions, so divying up the money could get difficult.&lt;/p&gt;&#xA;&lt;p&gt;I would say that if you want to give a monetary reward, host it off-site, use sealed submissions and give really clear rules.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-19T01:17:13.833" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1897" PostTypeId="2" ParentId="2140" CreationDate="2014-07-27T14:05:00.293" Score="0" Body="&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; This challenge might not work out on this site, &lt;strong&gt;please down vote this answer if you feel like it won't work&lt;/strong&gt; and up vote if you think it could. If you down vote, a comment would be appreciated. I don't see the point in limiting the freedom of the participants since I think it will make things less fun/interesting.&lt;/p&gt;&#xA;&lt;h1&gt;Your love you want to show 'em, generate them a poem.&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;Poetry is not easy;&#xA;Rhyming is too hard.&#xA;Generate me a poem that's not too cheesy.&#xA;If it's good enough we'll call it art.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In all honesty, poetry really is tough beans. So for this challenge I ask you to write some code in the language of your choice that will generate poetry.&lt;/p&gt;&#xA;&lt;h2&gt;Restrictions&lt;/h2&gt;&#xA;&lt;p&gt;Your program has to be able to output a large amount of generated poetry of reasonable quality. This means that you can't write code that tries to 'generate' a poem that already exists. You also can't sample parts of existing poetry (this includes poetry invented by you). It is okay if some (or even most) of your code's poems make no sense and there are only a small percentage of good poems. I'm sure that code that consistently generates good poetry will be more popular though. Other than that there are no restrictions, you can use dictionaries, you can use the internet, you can strive for a certain rhyming scheme or several. It's poetry, get creative.&lt;/p&gt;&#xA;&lt;h2&gt;Your answer&lt;/h2&gt;&#xA;&lt;p&gt;Your answer should include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your full code or a link to it.&lt;/li&gt;&#xA;&lt;li&gt;An explanation of your strategy.&lt;/li&gt;&#xA;&lt;li&gt;Some of your favorite poems generated by your code.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;The winner&lt;/h2&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, so the answer with the most votes wins.&lt;/p&gt;&#xA;&lt;h2&gt;But what's a poem?&lt;/h2&gt;&#xA;&lt;p&gt;I see where you're going with this. You could output a list of words and claim it's poetry. I fear the other users won't be too impressed with that though and you won't get many votes (if you can avoid down votes). However, that doesn't mean it absolutely has to rhyme, there are plenty of ways of making poetry interesting and if you can have your code generate non-rhyming poetry that other people like, you deserve those votes. Explaining your strategy will also help people see why what you did is interesting.&lt;/p&gt;&#xA;" OwnerUserId="29588" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-07-28T10:09:42.740" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="1900" PostTypeId="2" ParentId="1593" CreationDate="2014-07-27T18:10:37.460" Score="2" Body="&lt;p&gt;There are a lot of existing sites that do automated scoring of programming challenge and contest submissions. Some are very general purpose, some very specific. Some have published their code, some might be willing to, and others certainly aren't but could be used as inspiration. This seems like a wheel that doesn't need to be completely re-invented.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.spoj.com&quot; rel=&quot;nofollow&quot;&gt;https://www.spoj.com&lt;/a&gt; (48 languages, thousands of problems)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://codegolf.com/&quot; rel=&quot;nofollow&quot;&gt;http://codegolf.com/&lt;/a&gt; (currently not active) (6? languages, tens of problems)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://uva.onlinejudge.org/&quot; rel=&quot;nofollow&quot;&gt;http://uva.onlinejudge.org/&lt;/a&gt; (4 languages, thousands of problems)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.gamerz.net/c++robots/&quot; rel=&quot;nofollow&quot;&gt;http://www.gamerz.net/c++robots/&lt;/a&gt; (1 language, one contest)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://codecombat.com/&quot; rel=&quot;nofollow&quot;&gt;http://codecombat.com/&lt;/a&gt; (one language, 5? contests)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.battlecode.org/&quot; rel=&quot;nofollow&quot;&gt;http://www.battlecode.org/&lt;/a&gt; (one language, one contest)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://robowiki.net/wiki/RoboRumble&quot; rel=&quot;nofollow&quot;&gt;http://robowiki.net/wiki/RoboRumble&lt;/a&gt; (one language, three contests)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.koth.org/&quot; rel=&quot;nofollow&quot;&gt;http://www.koth.org/&lt;/a&gt; (one language, one contest)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.topcoder.com/&quot; rel=&quot;nofollow&quot;&gt;http://www.topcoder.com/&lt;/a&gt; (almost certainly not willing, included for completeness)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="4787" LastActivityDate="2014-07-27T18:10:37.460" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1904" PostTypeId="2" ParentId="2140" CreationDate="2014-07-28T12:09:29.603" Score="18" Body="&lt;h1&gt;Underwater Survival Game&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/25347/survival-game-create-your-wolf&quot;&gt;Lions and bears are extinct, the wolves dominate the fauna on land.&lt;/a&gt; But in the depths of the sea the battle for survival rages on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is the spiritual sequel to Rainbolt's Survival Game, with a few additions. The arena is the sea and hence three-dimensional. Furthermore, you can choose one of three different species this time: write your bot as a whale, a shark or a giant squid!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Arena&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The game is carried out on a three-dimensional grid: +&lt;em&gt;x&lt;/em&gt; points East, +&lt;em&gt;y&lt;/em&gt; points North, +&lt;em&gt;z&lt;/em&gt; points up. There will be &lt;code&gt;20*√n&lt;/code&gt; cells along &lt;em&gt;x&lt;/em&gt; and &lt;em&gt;y&lt;/em&gt;, where &lt;code&gt;n&lt;/code&gt; is the number of participants. The height will always be 21 cells. There are five regions: three are the species' breeding grounds, and two are just non-special regions in between. The 21 layers are distributed as follows:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/4jRWr.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The board wraps around along the &lt;em&gt;x&lt;/em&gt; and &lt;em&gt;y&lt;/em&gt; directions but not along &lt;em&gt;z&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each cell will be populated by at most one animal or hazard.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Game&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each bot starts with 100 instances randomly distributed in its own breeding layer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every turn, each bot can do one of two things:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Move:&lt;/strong&gt; The move can be one cell in any orthogonal or diagonal direction (as well as staying in the same cell, which technically shouldn't be called a &quot;move&quot;). Moves off the board (above the top or below the bottom layer) are ignored.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Breed&lt;/strong&gt;: Each animal starts with a breeding counter at 100 which is decremented every time step if it's greater than 0. If the counter is zero &lt;em&gt;and&lt;/em&gt; the animal is in its species' breeding ground, there is a 10% chance that a new animal will spawn on a random (orthogonally or diagonally) adjacent cell - this new animal will simply be a new instance of your bot. If this happens, the breeding counter is reset to 10.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If two animals or hazards move to the same cell they fight until only one of them remains. If more than two animals (or hazards) move the same cell, two of them are picked randomly for a fight until there is only one survivor left. For details on fighting see below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your animal will be provided with the arena size, a 3x3x3 map showing its immediate surroundings, its breeding counter and its global &lt;em&gt;z&lt;/em&gt; coordinate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner will be bot with the most specimen (instances) surviving after 1000 rounds.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Species&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your choice of animal determines where in which layer of the arena your animals can breed (see &lt;em&gt;The Arena&lt;/em&gt;) and will give you one distinct skill:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Whales&lt;/strong&gt; (&lt;code&gt;W&lt;/code&gt;) start with 10% more specimen.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Sharks&lt;/strong&gt; (&lt;code&gt;S&lt;/code&gt;) can make an additional &lt;em&gt;Move&lt;/em&gt; before their regular action. They will receive their updated surroundings after the first move. The first move must be made into an empty cell or it will be ignored.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Squid&lt;/strong&gt; (&lt;code&gt;Q&lt;/code&gt;) can see further and are provided with a 5x5x5 map of their surroundings.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;The Hazards&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each layer has a distinct type of hazards which will &quot;play&quot; along the bots.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Fishing nets&lt;/strong&gt; (&lt;code&gt;N&lt;/code&gt;) sweep through the whales' breeding grounds. They will stretch across the entire depth of the layer and have the following pattern in the &lt;em&gt;x&lt;/em&gt;-&lt;em&gt;y&lt;/em&gt; plane:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;N     N&#xA;NN   NN&#xA; NNNNN&#xA;  NNN&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;They constantly move in the &lt;em&gt;+y&lt;/em&gt; direction. About half of the nets will point and move in the opposite direction.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Jellyfish&lt;/strong&gt; (&lt;code&gt;J&lt;/code&gt;) are found in the sharks' breeding grounds. If there's a jellyfish adjacent to another animal, that animal cannot move (unless that animal is also a Jellyfish). Jellyfish move in alternating pattern such that it always stays in the central 3 layers of the sharks' breeding grounds: twice down, twice up. If no animal is around, they will move straight down and in a random (possibly diagonal) direction up. If there is an animal in one of the 9 cells in the current direction, the jellyfish will move to that cell (or if multiple cells are occupied will pick a random one of these).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Mantis shrimp&lt;/strong&gt; (&lt;code&gt;M&lt;/code&gt;) are only found on the ground (lowest &lt;em&gt;z&lt;/em&gt; coordinate of the squid layer). Each turn there is a 10% chance that the shrimp will cause a cavitation bubble, which will blind all animals within a radius of 4 (Chessboard distance) for the next turn. They walk randomly but all in unison (don't ask me how they do it).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Naval mines&lt;/strong&gt; (&lt;code&gt;O&lt;/code&gt;) are found in the regular layers between the breeding grounds. They never move. When stepped upon, the mine explodes, killing everything within a radius of 1 (Chessboard distance) including the animal that triggered the mine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There will be &lt;code&gt;30*n&lt;/code&gt; hazards in each layer, where &lt;code&gt;n&lt;/code&gt; is the number of participants. The exception are the nets. There will be &lt;code&gt;2*n&lt;/code&gt; nets in the whale layer.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Fights&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each fight is basically a non-uniform coin flip for who survives with the following probabilities:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a bot picked &lt;em&gt;Breed&lt;/em&gt; it always dies.&lt;/li&gt;&#xA;&lt;li&gt;Nets are indestructible and hence always survive.&lt;/li&gt;&#xA;&lt;li&gt;Jellyfish and Mantis shrimp will survive with a probability of 1/3.&lt;/li&gt;&#xA;&lt;li&gt;If two bots fight, the odds are 50:50; &lt;em&gt;except&lt;/em&gt; if one of the participants is in their own breeding grounds, in which case their chance of survival drops to 1/3 (because animals are unalert in their breeding grounds and that totally makes sense).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Sandbox notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The controller has yet to be written, but I intend to do a Rainbolt-style KotH where you can &lt;em&gt;either&lt;/em&gt; implement an abstract Java class &lt;em&gt;or&lt;/em&gt; write a command-line script.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All numbers in the spec are subject to change until the challenge is actually posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm pretty sure the spec is currently incomplete (of course I/O is missing, but that has to wait until the controller is written), but currently I can't see the wood for the trees, so please point out the holes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As usual, is anything unclear or could be improved? In particular, it will be hard to get the balancing right for this one, I think. I'm happy to discuss any questions or comments either here or in &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.653" LastActivityDate="2014-08-05T19:13:10.330" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="1906" PostTypeId="1" CreationDate="2014-07-29T06:53:48.113" Score="12" ViewCount="352" Body="&lt;p&gt;I've noticed that on many questions, the answer which should be the (current) winner gets very few upvotes and is not accepted. The accepted answer issue is hard to fix, but the upvotes element is easier. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question is: Should we be upvoting the winning/leading answer by default? Obviously, we shoud upvote every answer we like, but shouldn't a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; or a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; be more than just a popularity contest? I'd like to hear other people's opinions - Is this a problem? Should we make a conscious effort as a community to fix it?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples of this issue: (Taken from my answers, but I'm sure this happens to lots of people.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/35096/convert-a-string-of-binary-characters-to-the-ascii-equivalents/35125#35125&quot;&gt;Convert a string of binary characters to the ASCII equivalents&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/35133/convert-numbers-to-symbols-without-string-or-char-literals/35146#35146&quot;&gt;Convert numbers to symbols without string or char literals&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2014-07-30T19:12:11.047" Title="Should Users Upvote Winning/Leading Answers" Tags="|discussion|" AnswerCount="3" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1908" PostTypeId="2" ParentId="1906" CreationDate="2014-07-29T07:38:01.547" Score="35" Body="&lt;p&gt;&lt;strong&gt;The shortest answer is not always the most interesting.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It just comes down to that. One of the most enjoyable parts of code golf is the satisfaction of squishing out those last few bytes with some ridiculous bit-shifting tricks or something, even if your code is twice as long as the winner's.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Take this scenario: There are two answers to a code golf question. One's in a language like GolfScript, and one's in an ultra-compact Cthulhu-summoning wrath-inducingly condensed version of C that makes unicorns cry, with gems like &lt;code&gt;f(n){return n&amp;lt;4?1:f(--n)+f(--n);}&lt;/code&gt; (this code was actually &lt;s&gt;scrawled in blood&lt;/s&gt; written for a challenge on the site, if you want to bother searching for it).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Okay. so maybe that's a bit of an exaggeration (of course, there's much crazier stuff on the site if you're willing to look for it), but the point is: Just &lt;em&gt;short&lt;/em&gt; does not equal &lt;em&gt;fascinatingly&lt;/em&gt; short. Subjective, of course, but it's probable that most people who come here for the golf don't come just to count exactly how many characters some solution is. They come to see the madness that happens when you turn O(n log n) into O(n^n!) to save a single character.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also note that you shouldn't expect as many upvotes if you've invented your own language for code golf. Is that fair? Maybe not. But taking a commonplace, practical language and pushing its limits is, for the most part, much more enjoyable than effortlessly beating everyone else by a factor of two or three with a language that you specifically designed to be exceptionally short.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, votes are subjective. People vote how they vote; you're not about to change that.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-07-29T07:38:01.547" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1909" PostTypeId="2" ParentId="1866" CreationDate="2014-07-29T14:40:40.370" Score="3" Body="&lt;p&gt;&lt;strong&gt;Post it to the sandbox&lt;/strong&gt;, put into words everything you can put into words and ask for help, the &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;chat&lt;/a&gt; is also a great place to ask for quicker feedback, people there are generally very helpful.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If no one immediately takes the challenge off your hands (which is to be expected), &lt;strong&gt;you should start coding by it yourself.&lt;/strong&gt; Any work you do, others don't have to and it's a great way to learn. If you never do anything yourself (or at least try), you'll never get better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the end, with a little (or a lot of) help form the friendly PPCG people, you'll have made a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35328/3d-discrete-dogfighting-duel&quot;&gt;fun challenge you can be proud of.&lt;/a&gt; Even if it does turn out a bit different from what you originally envisioned.&lt;/p&gt;&#xA;" OwnerUserId="29588" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-07-29T14:40:40.370" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1910" PostTypeId="1" CreationDate="2014-07-29T17:59:32.573" Score="1" ViewCount="494" Body="&lt;p&gt;This site (&lt;a href=&quot;http://programmingpraxis.com&quot; rel=&quot;nofollow&quot;&gt;http://programmingpraxis.com&lt;/a&gt;) publishes every week very interesting code challenges, that could totally fit here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example: &lt;a href=&quot;http://programmingpraxis.com/2014/07/25/number-words/&quot; rel=&quot;nofollow&quot;&gt;http://programmingpraxis.com/2014/07/25/number-words/&lt;/a&gt; : that would be a perfect code-golf question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do you think we could, or should automatically publish those challenge here?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I emailed the webmaster to ask his approval&lt;/p&gt;&#xA;&#xA;&lt;p&gt;EDIT: here's the answer of the author:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I wouldn't want to post complete exercises on&#xA;  codegolf.stackexchange.com; I'm happy to keep my blog for that&#xA;  purpose.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;If you wish, you are welcome to post pointers to my exercises. Perhaps&#xA;  a short description of the problem, followed by a link back to my&#xA;  page. Many of the exercises are simply too long for a Stack Exchange&#xA;  posting, and the two-page exercise/solution format doesn't really fit.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Are you sure my exercises fit your code-golf topic? Some of them do,&#xA;  for instance the recent number-words exercise, but some of them would&#xA;  make a bad fit; for instance, no one is interested in a code-golfed&#xA;  version of elliptic-curve factorization.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So we can are allowed to use the puzzles that are suitable to code-golfing under those conditions. That's great. Do you guys agree with those conditions?&lt;/p&gt;&#xA;" OwnerUserId="10732" LastEditorUserId="10732" LastEditDate="2014-07-30T16:34:26.613" LastActivityDate="2014-07-31T18:58:21.607" Title="Programming Praxis weekly challenges" Tags="|discussion|code-golf|code-challenge|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1911" PostTypeId="2" ParentId="1910" CreationDate="2014-07-29T18:15:54.207" Score="5" Body="&lt;p&gt;Well, you obviously need his permission before posting, not least because everything posted on Stack Exchange is automatically licensed under CC BY-SA.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Still, he is a semi-regular contributor to Stack Overflow under the username &lt;a href=&quot;https://stackoverflow.com/users/448810&quot;&gt;user448810&lt;/a&gt;, so he may see this. Eventually. (He and I both answer Scheme questions on SO, and we occasionally bump into each other.)&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2014-07-29T18:15:54.207" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1912" PostTypeId="2" ParentId="1906" CreationDate="2014-07-30T11:35:11.853" Score="7" Body="&lt;p&gt;This can be a particular problem in king-of-the-hill challenges, where you get more rep from a joke answer than a good one (see for example EmoWolfWithAGun in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/34833/save-the-last-bullet-for-yourself#34856&quot;&gt;Save the last bullet for yourself&lt;/a&gt;). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Decent king-of-the-hills usually attract a bounty, which offsets this slightly, but a well thought out second place answer will often get fewer upvotes than a drive-by joke answer.&lt;/p&gt;&#xA;" OwnerUserId="16694" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2014-07-30T11:35:11.853" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1914" PostTypeId="2" ParentId="1875" CreationDate="2014-07-30T17:08:06.903" Score="3" Body="&lt;p&gt;I don't see why either question has to be closed.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;They are clearly different challenges for the reasons you mention.&lt;/li&gt;&#xA;&lt;li&gt;There may be users that would like to answer the new question that would not have wanted to answer the old question (because of the differences)&lt;/li&gt;&#xA;&lt;li&gt;There may be users that would like to answer the new question that missed the old question. i.e. perhaps they only joined the site within the last month, or were just not online often enough before the question got knocked off the &quot;active/recent questions&quot; list. Are these users expected to go and search for old/inactive questions to answer?&lt;/li&gt;&#xA;&lt;li&gt;What's the benefit to the site for closing duplicates? Or what harm do duplicates cause to this site? I can understand the need to close duplicates on stack overflow. On stack overflow, old questions can still be relevant/useful to users. On this site, the answers are for the benefit of the users answering and not for future users of the site. Answers on here do not have a general purpose but are just for the sake of the challenge.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="21713" LastActivityDate="2014-07-30T17:08:06.903" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="1915" PostTypeId="2" ParentId="1906" CreationDate="2014-07-30T19:12:11.047" Score="11" Body="&lt;p&gt;I agree with the sentiment, but only for comparisons of the same language. There's no point comparing C to Golfscript -- Golfscript will pretty much always win. But it would be nice if the better-scoring of the C answers were higher. As I see it, code golf is a per-language competition.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's an unfortunate trend where mediocre golfs written soon after the post float quickly to the top, getting visibility and thus more upvotes and more visibility. On the other hand, a golf posted after the initial rush that took time to squeeze out characters and improve on existing golfs risks lingering at the bottom, ignored. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sometimes, the submission floats up, but other times, it never gets the initial jolt, perhaps because nobody scrolls down to see it, or because their attentions have moved on. It's frustrating to spend time on a laborious and well-documented golf, only to see it ignored in favor of submissions that took less effort and show less ingenuity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I know that upvotes are meaningless Internet points. But, they carry with them attention and comments, and an implicit acknowledgement of a job well done. It would be nice for them to consistently reward good golfing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is not to say that upvotes should only be based on code length. Method, creativity, and language choice can also inspire someone to upvote, even on objective challenges. But as is, I believe submitting early is at least as effective as submitting well-golfed code for getting upvotes, and that's no good. (This probably doesn't apply for languages like Golfscript, which float up regardless, perhaps because voters are endlessly amazed to see random-looking strings of characters).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I make a conscious effort to upvote shorter solutions (language-adjusted), and sometimes that means not upvoting a longer one of the same language, even if I still like it. But, I don't think the solution is to get others to do the same.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think a technological solution is needed. Something like a sort-by-score with a by-language filter. This would require new tech, and I don't know how possible it is. Ideally, the score would be assigned by the question-asker or perhaps voted on by the community to resolve disagreements.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2014-07-30T19:12:11.047" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1916" PostTypeId="2" ParentId="1061" CreationDate="2014-07-31T05:54:14.240" Score="68" Body="&lt;h1&gt;Suicidal entries to King-of-the-Hill challenges.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/25347/survival-game-create-your-wolf/25357#25357&quot;&gt;EmoWolf&lt;/a&gt; was funny the first time, but &lt;a href=&quot;https://codegolf.stackexchange.com/questions/34833/save-the-last-bullet-for-yourself/34856#34856&quot;&gt;it's getting&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/35329/8478&quot;&gt;out of hand&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While some not-too-serious answers are often necessary to kickstart a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenge, purely suicidal answers put in little effort and tend to get more upvotes than serious entries, simply because they're &quot;funny&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not suggesting that other answers that are for jokes shouldn't be allowed, but this specific kind that is not even trying to do anything. Submissions should at least &lt;em&gt;play&lt;/em&gt; the game, even if badly or in a funny way.&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2014-07-31T19:35:50.133" CommentCount="8" CommunityOwnedDate="2014-07-31T05:54:14.240" ContentLicense="CC BY-SA 3.0" />
  <row Id="1917" PostTypeId="1" CreationDate="2014-07-31T15:40:52.093" Score="18" ViewCount="392" Body="&lt;p&gt;I've got an idea for a team based challenge, where entries will choose the team to participate on, and teams will compete against each other. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't want to get into the details much here, so let's keep it somewhat vague and high-level. If I can't determine a good way to pick a &lt;strong&gt;single&lt;/strong&gt; winning entry, is this allowed? Which &lt;strong&gt;team&lt;/strong&gt; wins will be strict and objective, but it won't be clear which single member was the best on the team. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Various suggestions have been proposed in chat to somewhat objectively identify a single clear winner, but in my opinion they would all either create a &quot;gaming&quot; condition or increase the runtime significantly. By &quot;gaming&quot;, I mean that the win conditions for a single player could conflict with the winning conditions for the team.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I know the SE framework in general frowns on questions that can't garner a single objectively-best answer, but I believe this could be a good addition to the site. We don't see teamwork challenges here, and I think it would be a fun way to compete. It would be modeled most like a King of the Hill competition, but I think that either a change to the tag wiki or a new tag/genre altogether would be warranted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Before writing the controller, I'd like to know whether this would be acceptable. If &lt;em&gt;absolutely necessary&lt;/em&gt;, I could convert the challenge to a 1v1 round robin tournament, but I feel that would take away from the spirit of the challenge. &lt;/p&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2014-08-01T16:48:22.133" Title="Can I post a cooperative challenge where there isn't a single winner?" Tags="|discussion|new-genre|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1918" PostTypeId="2" ParentId="1917" CreationDate="2014-07-31T16:01:45.013" Score="13" Body="&lt;p&gt;I don't see why not. Teamwork challenges look interesting, and they are a nice addition to the site. And about the issue with a winning answer, I don't think it really is an issue. It could be useful to know that for accepting an answer, but looking at the current &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; questions, there are not that many questions that have an accepted answer. So if you state which team has won, and list the members, it is fine IMO.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is just one issue that I can see: if you want to have an equal amount of members in a team, it might be that you cannot equally divide them (if there are 23 submissions, for example).&lt;/p&gt;&#xA;" OwnerUserId="9275" LastActivityDate="2014-07-31T16:01:45.013" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1919" PostTypeId="2" ParentId="1910" CreationDate="2014-07-31T18:58:21.607" Score="10" Body="&lt;p&gt;I am the author of Programming Praxis.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I license my blog under a CC-BY-NC-SA license, which differs from the standard StackExchange license which is CC-BY-SA. StackExchange is a profit-making corporation, and I don't want my entire exercise copied here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, I am perfectly willing for folks here to use my exercises for their adventures in code golfing. So, feel free to copy enough of the exercise to state the problem, then attribute the exercise by putting a link back to the original exercise and suggested solution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does that work for everybody?&lt;/p&gt;&#xA;" OwnerUserId="30006" LastActivityDate="2014-07-31T18:58:21.607" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1922" PostTypeId="2" ParentId="1917" CreationDate="2014-08-01T16:48:22.133" Score="10" Body="&lt;p&gt;I'm also hoping to see cooperative King of the Hill questions. The approach I had first imagined was to pick the teams randomly and assign points to everyone on the winning team, and repeat for many different random combinations. This would lead to a clear winner, while still encouraging cooperation during each game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although I'd still like to see that approach too, having read about Geobits' approach I really want to see it in action. I would definitely support this and upvote such questions, as it encourages a longer term collaboration and totally different dynamics. Randomly assigned teams will require players who can adapt to any team, while fixed teams that players choose for themselves will allow tailoring solutions to a known team and a known opponent team. This will give a rich variety of different approaches that are not restricted to being generic. It also allows asymmetric challenges where the two teams have very different objectives.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think this opens up lots of new possibilities and I really hope the site welcomes it.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2014-08-01T16:48:22.133" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1925" PostTypeId="2" ParentId="2140" CreationDate="2014-08-03T17:43:22.760" Score="9" Body="&lt;h1&gt;Epic Customizable Tank Battle  (Work-In-Progress)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is an idea I have been working on in conjuction with users @Trimsty and @githubphagocyte in the chat room.  It is inspired by the flash game &quot;Bubble Tanks&quot; by Armor Games.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This will be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenge.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Main Idea&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The main idea is that a large number of competitors fight each other in a large arena.  Each program is the AI of a different tank.  These tanks are customizable from a list of available parts which can be purchased, so the competitors can choose how to upgrade their tank as the battle progresses and they earn points.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The Arena:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The arena may be an almost-infinite plane with a light source near the center.  Tanks can travel far away, but lose energy away from the light.  This is a continuous-space game, so the tanks have locations/directions determined by floating-point numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The Bots:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The tanks are basically circles, with the center point of the tank being the location.  There is no collision detection, except that projectiles inside of another tank's radius are considered hits.  The tank's size (radius) will be determined by the different upgrades it has, with larger weapons giving more size.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bots will also have a health level which reduces upon injury from opponent's weapons.  The health will start at some number, and the bot dies upon the health reaching zero.  As bots kill others and collect points, health can be restored over time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a tank goes too long without making progress (collecting points or killing), then it will begin to rust.  Rust will slowly damage the tank and kill it.  Rust can be eliminated by making progress.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Weapons also need time to recharge, and this time is dependent upon rust and other factors.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The tanks are solar-powered.  The farther the tank goes from the light source, the slower it can move, the longer it takes for the weapons to recharge, and the shorter its range-of-visions is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Bot vision:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A tank's vision range will be determined by the light level.  If an object is located in a high-light area, then it can be seen from farther away.  An object in a low-light area can only be seen by nearby observers.  A tank will be able to see things which are closer than the light level in that object's location.  The bot will be able to see other tanks, as well as other features (bullets in-flight, heat-seekers, maybe mines).  The information available about other tanks will be that tank's weapons (maybe).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Winning criterion:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each match will be one single battle-to-the-death involving all of the tanks.  The tanks' scores will be the time until death.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It might be that several matches are held with the winner being the contestant with the highest average (or median?) score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Upgrade system:&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each tank starts with a certain number of &lt;em&gt;skill points&lt;/em&gt; (4000) and a certain &lt;em&gt;kill value&lt;/em&gt; (10).  The tank can spend skill points on upgrades to the various weapons.  Once a bot spends points on an upgrade, the transaction cannot be reversed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When a tank kills another, the victor's own kill value is increase.  The killed bot drops skill points on the area which can be collected by nearby bots.  The kill value of a bot determines (in part) how many skill points will be dropped upon that bot's death.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Types of weapons:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Guns of various ranges, strengths, and reload rates&lt;/li&gt;&#xA;&lt;li&gt;Lasers&lt;/li&gt;&#xA;&lt;li&gt;Mines (proximity and timed)&lt;/li&gt;&#xA;&lt;li&gt;Area-effect (damages nearby bots)&lt;/li&gt;&#xA;&lt;li&gt;Heat-seekers (costly and very accurate, but short range and low damage)&lt;/li&gt;&#xA;&lt;li&gt;Shields (not a weapon, but a form of protection that comes in different strengths)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Additional Notes:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There may be different feature which can be added, such as:&#xA;- flashlights which enable bots to see farther in the dark zones.&#xA;- self-destruct, which scatters the dropped points across a broader area.&#xA;- leech-weapons which steal health&#xA;- speed boosts or reductions&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Misc.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some sample code provided by trimsty about skill points and kill values:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;class BotsThingy:&#xA;    def __init__(self):&#xA;        self.bots = []&#xA;    def fatalShot(self, firer, victim):&#xA;        d = (self.bots[firer].points - self.bots[victim].points) / 15&#xA;        if d &amp;lt; 0:&#xA;            self.bots[firer].killValue -= d&#xA;        else:&#xA;            self.dropPointsAt(d + 50 + self.bots[victim].killValue * 5, self.bots[victim].location)&#xA;&#xA;# bot.killValue starts out at 10.&#xA;# bot.points can be anything that's above 100-ish, I'd say 4000 is good.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2014-08-11T12:43:25.170" LastActivityDate="2014-08-11T12:43:25.170" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1926" PostTypeId="2" ParentId="2140" CreationDate="2014-08-03T17:45:59.187" Score="0" Body="&lt;h1&gt;Program calculating its own length &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is simple: write a program that produces its own length, without using any literals or built-in constants other than &lt;code&gt;0&lt;/code&gt; (or its equivalents in your language).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Your code must print its own length in bytes when run, followed by a single newline.&lt;/li&gt;&#xA;&lt;li&gt;Your code cannot use any literals other than &lt;code&gt;0&lt;/code&gt; (or whatever equivalents your language might have). This includes string and character literals.&lt;/li&gt;&#xA;&lt;li&gt;Your code cannot use any built-in constants of your language, unless these are guaranteed to always have the value &lt;code&gt;0&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Any functions and operators provided by your language can be used.&lt;/li&gt;&#xA;&lt;li&gt;You're not allowed to use any external libraries or external resources in your program.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The score of a valid program is its length in bytes. The score of an invalid program is ∞.&lt;br&gt;&#xA;As this is code golf, lowest score wins.&lt;/p&gt;&#xA;" OwnerUserId="26973" LastActivityDate="2014-08-03T17:45:59.187" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="1931" PostTypeId="2" ParentId="2140" CreationDate="2014-08-04T20:25:10.190" Score="0" Body="&lt;h2&gt;Find a multiple of 42 that is spelled with all of the characters that make up the word &quot;forty-two&quot;.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;All of the characters in &quot;forty-two&quot; must be included at least once. Dashes count as characters, and each character must be used &lt;em&gt;cumulatively&lt;/em&gt; (&lt;code&gt;dog&lt;/code&gt; doesn't contain all of the characters that make up the word &lt;code&gt;dogg&lt;/code&gt;, for example).&lt;/li&gt;&#xA;&lt;li&gt;The result can be any multiple of 42 that meets the defined criteria, presented in numerical form. &lt;/li&gt;&#xA;&lt;li&gt;Result must be multiple of greater than 1 (or less than -1). In other words, &lt;code&gt;42&lt;/code&gt; and &lt;code&gt;-42&lt;/code&gt; are not allowed.&lt;/li&gt;&#xA;&lt;li&gt;Additional characters not in the word &quot;forty-two&quot; are O.K.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The program must calculate its result without utilizing prior knowledge of a multiple known to include the right letters.&#xA;&lt;strong&gt;Clarification:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This means that self trivial solutions such as hard-coding the program to print &lt;code&gt;42,000&lt;/code&gt; are not allowed.&lt;/li&gt;&#xA;&lt;li&gt;As an exception to this rule, prior knowledge of the maximum result possibility (&lt;code&gt;42,000&lt;/code&gt;, for example) may be used to define the program's ability to name numbers up to the necessary size.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The shortest code (counting in bytes) to do so in any language wins.&lt;/p&gt;&#xA;" OwnerUserId="30141" LastEditorUserId="30141" LastEditDate="2014-08-04T20:33:38.043" LastActivityDate="2014-08-04T20:33:38.043" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1934" PostTypeId="1" CreationDate="2014-08-05T16:37:11.210" Score="8" ViewCount="186" Body="&lt;p&gt;In KoTH (and possibly other problems), you may want to be able to have 2 way communication with other programs, and for all of them to be persistent (they stay alive, waiting for information, and can return information) &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is not simple code to write. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hence, I am looking to build a library of different sets of code that will take care of this for you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please post:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;How it works (over a network, using STDIN/STDOUT)&lt;/li&gt;&#xA;&lt;li&gt;How to use it in a controller program&lt;/li&gt;&#xA;&lt;li&gt;How a submission program will interact with it.&lt;/li&gt;&#xA;&lt;li&gt;The code&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="20198" LastActivityDate="2014-08-31T02:13:03.203" Title="Interacting with persistent programs" Tags="|discussion|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1935" PostTypeId="2" ParentId="1934" CreationDate="2014-08-05T16:37:11.210" Score="2" Body="&lt;h1&gt;Python&lt;/h1&gt;&#xA;&lt;p&gt;This controller pipes to/from STDIN/STDOUT.&lt;/p&gt;&#xA;&lt;p&gt;In order to use it, you must:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Have a directory &lt;code&gt;bots&lt;/code&gt; in the same directory as your controller&lt;/li&gt;&#xA;&lt;li&gt;For each bot, create another folder with the bot's name within &lt;code&gt;bots&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;In each folder, create a &lt;code&gt;command.txt&lt;/code&gt; containing a line with the command of how to run the bot.  (Ex: &lt;code&gt;python bad_bot.py&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Place the bot (and any additional files) in the folder&lt;/li&gt;&#xA;&lt;li&gt;Call &lt;code&gt;read_players()&lt;/code&gt; in your controller, which will initialize each bot, and return a list of controllers for each of them.&lt;/li&gt;&#xA;&lt;li&gt;A controller has two methods, &lt;code&gt;send_message(str)&lt;/code&gt; sends a string message to the bot and &lt;code&gt;get_response()&lt;/code&gt; returns a string message from the bot.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The bot will use STDIN/STDOUT to get input/output.&lt;/p&gt;&#xA;&lt;p&gt;The code is on &lt;a href=&quot;http://pastebin.com/HhWHvBJU&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pastebin&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-08-05T16:37:11.210" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1937" PostTypeId="2" ParentId="2140" CreationDate="2014-08-05T23:41:36.950" Score="2" Body="&lt;h1&gt;The Painter's Predicament&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This would be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question. This is my first question, so any guidance is appreciated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A painter is commissioned to paint the outer wall of a house shaped as a regular &lt;code&gt;n&lt;/code&gt;-gon, with walls &lt;code&gt;0&lt;/code&gt; through &lt;code&gt;n-1&lt;/code&gt;. Each one of these walls must be painted one of 26 colors, represented by the letters &lt;code&gt;A&lt;/code&gt; through &lt;code&gt;Z&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thanks to the unstoppable forward march of technology, the painter has acquired a machine that can paint entire walls at once. The machine can move around the house, and can only have one color active at a time. This machine has 5 buttons. The buttons behave as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Button #1 moves the entire machine to the wall to its left. &#xA;Button #2 moves the entire machine to the wall to its right. &#xA;Button #3 advances the current color forwards, so that A-&amp;gt;B, B-&amp;gt;C, and so on, until Z-&amp;gt;A.&#xA;Button #4 is identical to Button #3, but instead moves the color backwards.&#xA;Button #5 paints the wall in front of it with the current color. &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;When producing an estimate for a job, the painter would like to know how many buttons he'll have to press. Your task is to find that number for a given job.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input is given to you as a series of characters representing the desired coloring of the house. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For most, that will probably be a string, but you may accept them in whatever form is convenient for your language. If your language prefers them as a character array, from stdin, abandoned on the stack, or written straight into /dev/null, you may assume that as the input format.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples: &lt;code&gt;ABCDEF&lt;/code&gt;, &lt;code&gt;ZZZZZZ&lt;/code&gt;, and &lt;code&gt;AAAAAC&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may also choose to have the input be in the form of &lt;code&gt;[n] [job]&lt;/code&gt;, if that is more convenient for you desired input format. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples: &lt;code&gt;3 ABC&lt;/code&gt;, &lt;code&gt;10 QRSTUVFGHJ&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may not accept &lt;code&gt;n&lt;/code&gt; as a separate piece of data. If you choose to have it be provided, it must be included in the input character series as specified.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You must output the minimum number of button presses required to paint the entire house. This, again, may be done in whatever paradigm your language employs. Printing or returning the number are both definitely acceptable; the number must simply be made available to whomever invokes the code.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Additional Details&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The house starts with all of its walls painted color &lt;code&gt;A&lt;/code&gt;. If a job specifies that a wall must be painted &lt;code&gt;A&lt;/code&gt;, it does not need to be repainted. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The machine starts at wall &lt;code&gt;0&lt;/code&gt;, with current color &lt;code&gt;A&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;n&lt;/code&gt; is at least &lt;code&gt;3&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="30079" LastEditorUserId="30079" LastEditDate="2014-08-06T18:09:57.270" LastActivityDate="2014-08-06T18:09:57.270" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1938" PostTypeId="2" ParentId="2140" CreationDate="2014-08-06T12:16:10.640" Score="2" Body="&lt;p&gt;Inspired by lifecompetes.com&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Multiplayer Game of Life (&lt;em&gt;GOL&lt;/em&gt;)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There are &lt;code&gt;n&lt;/code&gt; players that play the Game of Life (standard rules) on an &lt;code&gt;50 x 50&lt;/code&gt; grid. (Size, border conditions? Toroidal, Absorbing, Mirroring?)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Before first GOL-Step&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;When the game starts, each player has 12 cells that he can place anywhere he want as long as they do not overlap. Before the first GOL-step occures every player has to place 6 cells. If two players place their cell on the same spot no cell wil be placed an thei cells will remain in each players bank.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;During game&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;In each GOL-Step, each player can place as many new cell on the grid as he has in his bank. If two or more players want to place a cell on the same spot, no cell will be placed there (the cells will remain in each players bank). Every six GOL-steps all the players who have less that 12 cells in their bank will get a new cell in their bank. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Goal&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The goal is achieving the maximum number of cells on the grid during 1000 GOL-steps.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;How to participate&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each participant has to write a javascript function of the following form (multiple return statements allowed.)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function my_bots_name(field, bank, golstep){&#xA;  /* your code */&#xA;  return p;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;p&lt;/code&gt; is a 2d array of points &lt;code&gt;[[x1,y1],[x2,y2],[x3,y3],...]&lt;/code&gt; that the player wants to set. &lt;code&gt;field&lt;/code&gt; contains a 2d array of the GOL grid, &lt;code&gt;bank&lt;/code&gt; indicates the number of cells in the player's bank, and &lt;code&gt;golstep&lt;/code&gt; is the index of the current GOL step (&lt;code&gt;golstep == 0&lt;/code&gt; before the first GOL-step occurs).&#xA;The function may not the global variables and cannot access Math.random() or Date(). In &lt;code&gt;field&lt;/code&gt; the empty cells will be set to 0, the own cells will be set to 2 and the other player's cells will be set to 1. (You will not be able to distinguish between various other players.) &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner will be determined with a game that contains all valid submissions after one week after the first submission.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;TODO&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The exact environment will be provided so everyone can test the own function before the official runs.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What size of the grid is appropriate? (dependent on number of players?)&lt;/li&gt;&#xA;&lt;li&gt;How many steps should be computed?&lt;/li&gt;&#xA;&lt;li&gt;What border conditions should be chosen?&lt;/li&gt;&#xA;&lt;li&gt;Is the restriction of Math.random() and Date() apropriate? (The idea was that the games will be the same no matter of who/when they will be run. (Deterministic) )&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2017-06-09T19:40:52.337" LastActivityDate="2017-06-09T19:40:52.337" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="1939" PostTypeId="2" ParentId="1480" CreationDate="2014-08-06T12:50:57.837" Score="2" Body="&lt;p&gt;The approach I went with was:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Answer some questions&lt;/li&gt;&#xA;&lt;li&gt;Make some rep&lt;/li&gt;&#xA;&lt;li&gt;Assign bounty to both answers&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;This seems to wrap it up nicely.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2014-08-06T12:50:57.837" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1940" PostTypeId="1" CreationDate="2014-08-06T13:04:04.637" Score="11" ViewCount="273" Body="&lt;p&gt;I noticed a couple of answers to the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35569/tweetable-mathematical-art&quot;&gt;tweetable art question&lt;/a&gt; have been converted to community wiki. These are questions which, although interesting, didn't keep to the question requirements (the code was longer than 140 characters and additional functions were added outside the specified red, green and blue functions - which the question forbids).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can understand why people would be frustrated at seeing answers that don't match the question, especially if they spent a long time golfing down their own submission to 140 characters... It doesn't seem a fair comparison.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, &lt;strong&gt;I don't understand the approach of making these community wiki&lt;/strong&gt;. That means the rep doesn't go to the answer poster, but the &lt;strong&gt;valid answers are still subject to a comparison which is not like for like&lt;/strong&gt;, which may affect how they are received. At first glance it still may not be obvious that the invalid answers don't fit the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What approaches make sense in such circumstances?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there a benefit to making them community wiki that I'm missing?&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-08-12T19:22:04.137" Title="Should we flag and delete Not an Answer posts?" Tags="|discussion|" AnswerCount="2" CommentCount="14" ClosedDate="2016-01-18T20:33:49.380" ContentLicense="CC BY-SA 3.0" />
  <row Id="1941" PostTypeId="2" ParentId="1480" CreationDate="2014-08-06T15:34:58.480" Score="4" Body="&lt;p&gt;It is your own bounty, so you may dispense it as you choose. You can change your mind from what your intensions were when posting the bounty. If you radically change your mind, you might explain it in a comment if you wish. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;But after the bounty is awarded, all of the supplementary text is removed. So you do not need to strictly adhere to any of the bounty criteria. There will be no record.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2014-08-06T15:34:58.480" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1942" PostTypeId="2" ParentId="2140" CreationDate="2014-08-06T16:47:54.060" Score="4" Body="&lt;h1&gt;Paired Programming: Down Periscope!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This is very basic for now, and lacks specific numbers as I flesh out the details and play with the speeds involved. I/O will be pretty basic, but it's not fully outlined yet.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Four submarines are placed in an arena, two on each team. They shoot torpedoes at each other. The objective, as obvious as it seems, it to kill the opposing team.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Teams are made from all pairwise matches of entries. They are then placed in a tournament-style bracket, deep enough to fit all of them. Any empty spaces are filled with a team of two dummy submarines, effectively creating a bye assuming you don't lose to a team that quite literally can't kill you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The tournament is played several (many?) times to tally points. The team with the most points at the end is the winning team. In the interests of selecting a single winner, the winning team's bots will be compared. Whoever got the most points &lt;em&gt;total&lt;/em&gt; (even from their participation on other teams) is the overall winner. Note that this means the single bot with the most points may not win (due to not being on the winning &lt;em&gt;team&lt;/em&gt;).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sensors down, Captain&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, you've lost most of your communications ability, and your navigation sensors are limited. Specifically, you have two ways to figure out what's around you and/or communicate: passive and active.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Passive Audio:&lt;/strong&gt; Since water is such a great conductor of sound, you can hear things from a pretty good distance. Of course, today's submarines can run pretty quietly, but as they speed up, they get louder. You can also hear other things, like active torpedoes, explosions, and sonar pings. For each of these events, you will receive a bearing (azimuth/elevation) and a loudness. Loudness drops off with distance, so you may not be able to hear everything in the arena. You don't have to directly ask for this information, it will be supplied on each turn.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Active Sonar:&lt;/strong&gt; When that just isn't good enough, there's sonar. When you activate a sonar ping, you will receive a bearing and distance to all objects (submarines/torpedoes). Of course, other subs will also be able to hear &lt;em&gt;you&lt;/em&gt; when you do. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;(&lt;em&gt;Tentative&lt;/em&gt;) As a bonus, you can modulate a short message onto the sonar ping to communicate with other subs. This message can be up to &lt;strong&gt;16 bytes&lt;/strong&gt; in length. Just remember, &lt;em&gt;all&lt;/em&gt; other subs will be able to hear this message, not just your teammate. They will hear it as an addition to the ping during passive listening. If you have idea about how to make this useful/effective, I'm usually &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;available in chat.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Take us down&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Movement is based on vectors, and any movement commands you give are applied. Acceleration is a fcator in speed and direction, so you can't go from full stop to all out in one step. To move, you need three values: left/right, up/down, and throttle.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Left/Right:&lt;/strong&gt;  Supplied in absolute degrees from north. There is a maximum turn rate, so the ship will slowly come about to face the new heading. If the value is out of the bounds &lt;code&gt;0&amp;lt;=d&amp;lt;=359&lt;/code&gt; it will be modulus 360. The ship will turn in whichever direction would result in the shorter turn, so if you want to make a 270-degree clockwise turn from north, you'll need to do it in increments of something &amp;lt;= 180. If you set a heading exactly 180 degrees from current, it will turn clockwise.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Up/Down:&lt;/strong&gt; Supplied in absolute degrees of the desired angle. The ship will slowly come to the desired angle. Min/max to be determined.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Throttle:&lt;/strong&gt; Supplied in meters/second desired speed. The ship will accelerate at a rate of (TBD) until desired rate is achieved (up to maximum of TBD). You cannot move backward(negative speed). &lt;strong&gt;This makes noise!&lt;/strong&gt; The faster you are moving, the louder your sub is.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Fire torpedoes!&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You have two torpedo tubes, and an unlimited supply of torpedoes. When you fire one, it will take some time to reload, so your effective firing rate is 2/x(tbd) seconds. You don't have to specify which tube you're firing, the command will fire whichever is ready.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Torpedoes start off moving at the sub's current speed plus a small boost (to prevent detonation with firing sub). It then accelerates up to full speed. Torpedoes **home in* on any sub within their cone of vision, and will try to turn to hit whichever of these is the closest. Although a torpedo's max speed is higher than a sub's, it cannot turn as quickly, so evasive maneuvers need to be considered.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Torpedoes have distance sensors, and will blow up when they are within x(tbd) meters of a sub. This will destroy the sub, and be very audible. Torpedoes have a maximum travel distance of (tbd) meters, at which point they fizzle out and are no longer a hazard. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Arena&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The arena is a spherical area of ocean with the origin at the center and a radius of 1000m(?tbd). Coordinates are continuous. Subs will start near the perimeter, at 90 degree intervals around the equator. They will start facing the center, with teammates 180 degrees apart. &lt;strong&gt;Moving outside the sphere is death, and will be audible.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Now obviously I've still got some work to do here, but as usual any comments are welcome. Well, &lt;em&gt;most&lt;/em&gt; comments are welcome.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="14215" LastEditDate="2014-08-06T17:28:45.350" LastActivityDate="2014-08-06T17:28:45.350" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1943" PostTypeId="2" ParentId="2140" CreationDate="2014-08-07T00:53:36.220" Score="0" Body="&lt;h1&gt;Tennis Tournament (Incomplete)&lt;/h1&gt;&#xA;&lt;p&gt;Please do not vote or comment yet.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;Insert tennis themed introduction here.&lt;/p&gt;&#xA;&lt;h1&gt;Game&lt;/h1&gt;&#xA;&lt;p&gt;Insert description of the tournament hierarchy, player seeding, and program flow.&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;You will be passed the current set of matches. Matches will be comma (&lt;code&gt;,&lt;/code&gt;) delimited. Players within a match will be dash (&lt;code&gt;-&lt;/code&gt;) delimited. Players will be represented by ID and strength in the format &lt;code&gt;&amp;lt;ID&amp;gt;$&amp;lt;Strength&amp;gt;&lt;/code&gt;. Byes will be represented by &lt;code&gt;0$0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Java submissions will be supplied input via argument to the &lt;code&gt;takeAction()&lt;/code&gt; function. Non-Java submissions will be supplied input via command line argument.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The following input represents a three player tournament. The players' IDs are 2, 1, and 3. Their strengths are 1, 2, and 2, respectively. Player 3 has a bye.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;2$1-1$2,0$0-3$2&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;Return the string &amp;quot;play&amp;quot; if you want to play. Return the string &amp;quot;concede&amp;quot; if you want to concede.&lt;/p&gt;&#xA;&lt;h1&gt;Deliverables&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Java Submissions&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;You must submit a unique title and a Java class that extends the abstract Athlete class written below.&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-java prettyprint-override&quot;&gt;&lt;code&gt;public abstract class Athlete {&#xA;    public abstract String takeAction(String arg);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Non-Java Submissions&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;You must submit a unique title, a program, and a Windows command line string that will run your program. Remember that an argument will be appended to that string. For example:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;python RafaelNadal.py args&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;Your final score will be the median of your scores across ____ trials.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-08-07T00:53:36.220" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1946" PostTypeId="1" CreationDate="2014-08-07T22:45:39.587" Score="1" ViewCount="167" Body="&lt;p&gt;Some high level programming (this doesn't apply to most scripts) require an header that do not really affect the code - in a golfing context - and are unnecessary. Should this part of the code be removed and not counted when posting answers? This is some form of &quot;characters pollution&quot; in the context of golfing that adds an handicap to those languages and if the answer is short can increase the code size up to 50%.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Heres an exemple in C of a main() to demonstrate what i'm talking about:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;int main(){&#xA;    return 0;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In C you start with an handicap of 21 characters. In Java, it's even worse:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;public class J{&#xA;    public static void main(String[] a){&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It's 53 characters of handicap.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question/suggestion is this: should we remove headers from code?&lt;/p&gt;&#xA;" OwnerUserId="30174" OwnerDisplayName="Sam445" LastEditorUserId="3808" LastEditDate="2014-08-07T23:04:16.913" LastActivityDate="2014-08-07T23:04:16.913" Title="Headers in verbose languages" Tags="|discussion|" AnswerCount="0" CommentCount="5" ClosedDate="2014-08-08T03:43:39.357" ContentLicense="CC BY-SA 3.0" />
  <row Id="1947" PostTypeId="1" CreationDate="2014-08-08T00:11:37.597" Score="18" ViewCount="697" Body="&lt;p&gt;I really like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35569/tweetable-mathematical-art&quot; title=&quot;tweetable mathematical art&quot;&gt;this question&lt;/a&gt; but I know there are complaints of it being more about art than programming. I'd like to hear both sides of this and see what is in the best interest of the community and the site's public beta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm posting my own view as an answer so that the votes will show where it lies in relation to other answers.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-10-30T18:33:33.780" Title="The line between art and programming" Tags="|discussion|" AnswerCount="4" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1948" PostTypeId="2" ParentId="1947" CreationDate="2014-08-08T00:57:06.273" Score="25" Body="&lt;h1&gt;Popularity is important&lt;/h1&gt;&#xA;&lt;p&gt;I think popular questions are important to increase traffic, which in turn can bring extra views to the lesser seen questions. The whole stack exchange network sees links to our most popular questions. However, obviously not all popular questions are acceptable or even useful. For example &amp;quot;paste in your favourite picture of a cat&amp;quot; may well get lots of upvotes, but it would have no requirement for programming knowledge nor any learning or experimenting aspect. In particular, the increased traffic it would bring would not be people who necessarily know about programming or have any interest in the rest of the site, so it could just increase noise and potentially introduce votes on other questions from people who are not programmers, skewing the votes across the site.&lt;/p&gt;&#xA;&lt;h1&gt;Where is the line?&lt;/h1&gt;&#xA;&lt;p&gt;So somewhere between random cat photos and pure code golf is a line we need to estimate in order to welcome questions that will bring in more programmers and golfers, without bringing in people in search of cats.&lt;/p&gt;&#xA;&lt;p&gt;I see several questions on the site that are near that border, and in each case I judge it by whether the answers to it demonstrate skill and determination, or just aesthetic style. Those that require both, I see no problem with - I think the combination is a good thing. Those that are purely aesthetic and could be answered with little programming knowledge I see as noise, potentially taking us back a step.&lt;/p&gt;&#xA;&lt;p&gt;Recently there seems to have been a move towards voting to close questions that have an asthetic or artistic aspect, regardless of how much programming skill they require. I think it is important to discuss how much programming skill makes a question acceptable, because &lt;strong&gt;we are in danger of closing questions based on how much art is in them, rather than based on how much programming is in them&lt;/strong&gt;. As I see it, you can't have too much art in a question, only too little programming.&lt;/p&gt;&#xA;&lt;h1&gt;A stepping stone&lt;/h1&gt;&#xA;&lt;p&gt;The particular popularity contest mentioned in the question is one I see as beneficial to the site. I'm not a confident code golfer and tend more towards questions where there is a challenge rather than minimising bytes. In answering the tweetable art question I started off with something very simple, but found I had to learn a bit about golfing along the way. This allowed me to attempt a more complex answer which led to me working out more golfing techniques which I probably wouldn't have learned from the straight golfing questions because I wouldn't have had the confidence to try them. Now I'll be much more likely to have a go at some golf questions because I've been able to start somewhere in between.&lt;/p&gt;&#xA;&lt;p&gt;For me, a question with a strict byte limit seemed more approachable than pure golf questions. It was a stepping stone for me. For others, pure golf may actually appeal more since there isn't a limit to stress about. Since different people enter into a topic from different directions, I think the more different variations we have the more routes in there will be and the more golfers we will end up with.&lt;/p&gt;&#xA;&lt;p&gt;I want to see questions that don't require programming skill flagged quickly, but I don't want highly demanding questions that happen to have an artistic side to be lost without considering their programming benefit.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-08-08T00:57:06.273" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1950" PostTypeId="1" CreationDate="2014-08-08T14:27:00.153" Score="6" ViewCount="182" Body="&lt;p&gt;I have a problem with objectively identifying duplicate entries in my challenges, so usually I just don't even try. Some of them are really obvious, but some of them are not. Some solutions are too obfuscated for me to even understand. The moment I start to disqualify some of them, I have to be fair about it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;How can I objectively identify duplicate entries?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am answering this question myself, but my solution has multiple issues. I hope to get better solutions from the community.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="39328" LastEditDate="2015-12-05T00:17:44.173" LastActivityDate="2016-01-04T01:01:44.487" Title="Identifying Duplicate Answers" Tags="|discussion|duplicates|" AnswerCount="2" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1951" PostTypeId="2" ParentId="1950" CreationDate="2014-08-08T14:27:00.153" Score="0" Body="&lt;p&gt;Encourage users to downvote the newer of two entries that they think are too similar, in addition to their normal voting routines. Then, disqualify all submissions with less than negative X votes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I propose X = 3.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Advantage&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This method is strictly objective. This is the only thing going for it, but hey, it's enough to keep popularity contests going, right?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Disadvantage&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The method by which users cast their votes is strictly subjective&lt;/li&gt;&#xA;&lt;li&gt;Some people might argue that influencing the votes of others is wrong&lt;/li&gt;&#xA;&lt;li&gt;This would have to be posted on &lt;em&gt;every single challenge&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="18487" LastEditDate="2014-08-08T15:50:16.147" LastActivityDate="2014-08-08T15:50:16.147" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1952" PostTypeId="2" ParentId="1934" CreationDate="2014-08-08T17:47:35.810" Score="2" Body="&lt;h1&gt;Python 3.2+&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This library currently only provides the controller. The clients(player bots) should use stdin/stdout to communicate with the controller. It uses Python 3's &lt;code&gt;concurrent.futures&lt;/code&gt; library to implement the timeout controll.  You can find it &lt;a href=&quot;https://github.com/ZhanruiLiang/kothlib&quot; rel=&quot;nofollow&quot;&gt;on this github repo&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Features&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Collect players from specified directory. Support exclusion, this is useful when there're some players have problem and you want to disqualify them temporarily.&lt;/li&gt;&#xA;&lt;li&gt;Send text message to clients&lt;/li&gt;&#xA;&lt;li&gt;Receive a line of text message from client, with timeout.&lt;/li&gt;&#xA;&lt;li&gt;Batch sending/receiving. Batch receiving is especially useful since receiving from different clients with timeout can be tricky to implement. A example case is that suppose the timeout is 100ms, the first client can only use 100ms but the second one may used 180ms(&amp;lt;200ms) without being killed, which is incorrect.&lt;/li&gt;&#xA;&lt;li&gt;Kill clients.&lt;/li&gt;&#xA;&lt;li&gt;Rearrange clients' order, useful when running position dependent game.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Using the Controller&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Create the instance &lt;code&gt;controller&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Call &lt;code&gt;controller.collect(directory, command_name, exclude=[])&lt;/code&gt; to spawn clients.&lt;/li&gt;&#xA;&lt;li&gt;To send message to all clients, use &lt;code&gt;controller.send_all(message)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;To receive message from all clients, use &lt;code&gt;controller.receive_all(timeout)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;To iterate through the alive clients, use &lt;code&gt;for client in controllers.iter_alive():&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;With a single client, you can call:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;send&lt;/li&gt;&#xA;&lt;li&gt;receive&lt;/li&gt;&#xA;&lt;li&gt;kill&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;To kill all clients, use &lt;code&gt;controller.kill_all()&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Example: RockPaperScissorsGame&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This can also be found in the testcases.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;from kothlib import controller&#xA;&#xA;class RockPaperScissorsGame:&#xA;    valid_choices = ('rock', 'paper', 'scissors')&#xA;    wins = {'rock': 'paper', 'paper': 'scissors', 'scissors': 'rock'}&#xA;&#xA;    def __init__(self):&#xA;        self._controller = controller.Controller()&#xA;&#xA;    def start(self, rounds):&#xA;        controller = self._controller&#xA;        controller.collect('bots', 'command.txt')&#xA;        controller.sort()&#xA;        scores = {client: 0 for client in controller}&#xA;        for round in range(rounds):&#xA;            print('-' * 80)&#xA;            print('round', round)&#xA;            print('players:', [client.name for client in controller.iter_alive()])&#xA;            print('send: choose')&#xA;            controller.send_all('choose')&#xA;            controller.receive_all(timeout=1.0)&#xA;            choices = set()&#xA;            for client in controller.iter_alive():&#xA;                choice = client.result&#xA;                if choice not in self.valid_choices:&#xA;                    continue&#xA;                choices.add(choice)&#xA;                print(client.name, client.result)&#xA;            if len(choices) == 2:&#xA;                choice1, choice2 = choices&#xA;                winner_choice = choice2 if self.wins[choice1] == choice2 else choice1&#xA;                for client in controller.iter_alive():&#xA;                    if client.result == winner_choice:&#xA;                        scores[client] += 1&#xA;        controller.send_all('quit')&#xA;        for client, score in sorted(scores.items(), key=lambda x: x[1]):&#xA;            print(client.name, score)&#xA;        print('Game finished')&#xA;        controller.receive_all(timeout=1.0)&#xA;        controller.kill_all()&#xA;RockPaperScissorsGame().start(10)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="6935" LastEditorUserId="20283" LastEditDate="2014-08-31T02:13:03.203" LastActivityDate="2014-08-31T02:13:03.203" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1953" PostTypeId="2" ParentId="1234" CreationDate="2014-08-08T18:10:15.997" Score="0" Body="&lt;h1&gt;Proposal&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A moderator puts a link to the &lt;a href=&quot;/questions/tagged/sandbox&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sandbox&amp;#39;&quot; rel=&quot;tag&quot;&gt;sandbox&lt;/a&gt; meta tag in the How to Ask box.  &lt;/li&gt;&#xA;&lt;li&gt;We then change the tag summary to give folks instructions on what to do.&lt;/li&gt;&#xA;&lt;li&gt;Finally, close retired Sandboxes with no new activity using a reasonable close reason that keeps them out of views.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="13950" LastActivityDate="2014-08-08T18:10:15.997" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1954" PostTypeId="2" ParentId="2140" CreationDate="2014-08-08T18:27:01.760" Score="3" Body="&lt;h1&gt;Diplomacy&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Note for Sandbox:&lt;/em&gt;&#xA;I have not finished (or really started) the control program for this game, because I wanted to see if there was interest in it before I dedicated too much time to the project. that means that the rule are still up to be tweaked, so please leave a comment if you have a suggestion, and comment or vote if you are interested in seeing this happen.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Diplomacy&lt;/strong&gt; is a complex strategy game, with a very entertaining combat system. This challenge will be to write a bot to compete in a simplified version of diplomacy combat.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;h3&gt;Rounds&lt;/h3&gt;&#xA;&lt;p&gt;Countries (bots) will begin the game with 10 health, representing their remaining will to fight. The goal is to eliminate all other Nations by attacking them until they have 0 health.&lt;/p&gt;&#xA;&lt;p&gt;The game will consist of several rounds.&#xA;On the first round, all bots will receive 2 numbers as command line arguments: The first will be the total number of countries fighting, and the second will be their number in the list. Each following round, bots will receive a command line arguments containing the actions taken by each player last round and a list of all bots and their remaining health separated by commas, like so&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 1:A2,2:S3,3:A4,4:A3 1:10,2:7,3:7,4:1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Each bot must then output a desired action, which is one two commands&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Attack a player. This is done by printing the letter A followed by the number of the player you with to attack. For instance, &lt;code&gt;A3&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Support a player. This will give the player you support a boosted attack.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Resolving combat&lt;/h3&gt;&#xA;&lt;p&gt;After player have sent in their moves, attack scores will be calculated thus:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;All players start with a strength of 1, and one point is added for every player supporting them.  For instance, if the moves are &lt;code&gt;1:A3,2:S1,3:A2,4:S2&lt;/code&gt; then bot 1 has strength 2, bot 2 has strength 2, bot three has strength 1, and bot 4 has strength 1.&lt;/li&gt;&#xA;&lt;li&gt;After strength has been calculated, bots will deal damage based on their strength. The formula for damage is &lt;code&gt;(Attacker's strength + 1) - (Defender's Strength)&lt;/code&gt; In the above situation, player 3 would take 2 damage and player 2 would take 0 damage. Note that, unlike regular diplomacy, attacking a supporter does not cut support.&lt;/li&gt;&#xA;&lt;li&gt;All attack take place simultaneously and independently. This means that if player 1 and 2 both attack player 4, then they each deal 1 damage. If player 3 were to support player 4, then player 4 would take no damage.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Round Ends&lt;/h3&gt;&#xA;&lt;p&gt;After combat has been resolved, countries that have 0 health will no longer be able to attack or support. However, they still will be listed in the input with an health of 0. When a bot is eliminated, all remaining bots will receive a single point.&lt;/p&gt;&#xA;&lt;h3&gt;Ending the game&lt;/h3&gt;&#xA;&lt;p&gt;The game ends when either 100 turns have elapsed or only 2 or less players remain. At this point, the player with the highest remaining health is the winner and receives 1 point. In case of ties, all tied bots will revive 1 point. If all bots die on the same turn, this is not a tied victory, but mutually assured destruction, and all bots will receive 0 points.&lt;/p&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;p&gt;The control program will run 100 rounds of the game. The winner will be the country with the most points at the end of 100 rounds.&lt;/p&gt;&#xA;&lt;h2&gt;Code&lt;/h2&gt;&#xA;&lt;p&gt;You may write in any language I can reasonably compile. I will make an effort to compile odd languages, but make no promises as to my ability to do so. Please provide your source code, an explanation, and a command line command to run your program.&lt;/p&gt;&#xA;Notes&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You are allowed to write to a file. In fact, you are encouraged to do so.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Because this is a game where cooperation is paramount, you are allowed to write bots that work together, with the following restriction:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Only two bots can be written by a single player to work together at a time.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Standard Loopholes apply. You are not allowed to change the way the control program runs. If you provide invalid input to the control program, the program will just skip your turn.&#xA;However, you are allowed to spy on other countries files, and all bot programs will be in the same folder at runtime. This is war, after all!&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I reserve the right to disqualify any country that takes more than about a second to run, or that tries a loophole not mention within.   That being said, if it is sufficiently clever I will probably let it go.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I will have source code up soon for a sample country that will be competing, and will post the control program when I finish it.&lt;/p&gt;&#xA;" OwnerUserId="29809" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-08-08T20:13:34.230" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1955" PostTypeId="2" ParentId="1234" CreationDate="2014-08-08T19:51:54.767" Score="3" Body="&lt;p&gt;The main problem I see with this is that the only people that will ever read the &quot;How to Ask&quot; message or the various sections of the &quot;Ask Question&quot; page are &lt;em&gt;new users&lt;/em&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since the sandbox is on meta, new users can't post to it (until they have at least 5? rep, I believe). I can see this leading to frustration. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not saying that a link shouldn't be considered, but we may want to &lt;em&gt;also&lt;/em&gt; encourage people to answer at least once before asking. This might not only alleviate the meta issue (most answers get &lt;em&gt;at least&lt;/em&gt; 5 rep), but also cause them to see some other, &lt;em&gt;open&lt;/em&gt; questions before posting one. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, there's no way to force them to answer first, but a gentle nudge wouldn't hurt.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2014-08-08T19:51:54.767" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1957" PostTypeId="1" AcceptedAnswerId="1967" CreationDate="2014-08-09T18:29:31.447" Score="8" ViewCount="317" Body="&lt;p&gt;A number of times now I've posted challenges where the physical layout of the code is one of the integral components:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/33150/write-a-rectangular-program-that-outputs-the-number-of-times-it-was-rotated&quot;&gt;Write a Rectangular Program that Outputs the Number of Times it was Rotated&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/35372/make-a-code-square-with-your-favorite-word&quot;&gt;Make a code square with your favorite word&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/35656/program-your-favorite-phrase&quot;&gt;Program your favorite phrase&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/35974/code-that-runs-the-game-of-life-on-itself&quot;&gt;Code that runs the Game of Life on itself&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(There are surely others not by me but I can't think of any offhand.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm just wondering, is there a word or phrase used to denote these type of challenges, either on this website or in the world of programming puzzles at large?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To me they represent novel problems with very creative solutions, worthy of a descriptor (though I'm not asking for a tag).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit by Martin Büttner&lt;/strong&gt;: I've added the existing suggestion as individual posts. Please vote on your preference, post arguments for or against each suggestion in comments or add your suggestions. Also, please feel free to add suggested Tag Wiki excerpts to each post, so we can figure out more clearly the implications of each name.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-08-15T02:01:56.313" Title="Is there a tag (or even a word) for this?" Tags="|discussion|" AnswerCount="13" CommentCount="16" ContentLicense="CC BY-SA 3.0" />
  <row Id="1960" PostTypeId="2" ParentId="1940" CreationDate="2014-08-10T14:12:54.177" Score="10" Body="&lt;p&gt;Having given this some thought, I think the best approach is to both downvote and flag such answers for moderator attention. Downvoting alone has no noticeable effect when the &lt;strong&gt;people upvoting the image outnumber the people downvoting the code&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;In this case I did flag and the moderator response was to convert to community wiki, as that was what was suggested by others at the time. Having taken time to think about this I believe this is an inconsistent approach and is unfair on the other answers.&lt;/p&gt;&#xA;&lt;h2&gt;There was an answer that was deleted&lt;/h2&gt;&#xA;&lt;p&gt;It was a picture of a cat with code that clearly did not produce it. &lt;a href=&quot;https://codegolf.stackexchange.com/a/35813/20283&quot;&gt;Another answer&lt;/a&gt; with an image more impressive than most but only because it was produced with code not even close to following the rules has instead been converted to community wiki and massively upvoted. I think this inconsistency sets a precedent that needs to be dealt with now. It doesn't matter that the rep does not go to the poster of the answer. The answers should all contain images relevant to the question so that they can be compared on an equal footing. Otherwise this site is just a image repository.&lt;/p&gt;&#xA;&lt;p&gt;In any question (particularly but not only popularity contests) there is the possibility of answers being eye catching but unrelated to the question, and getting net upvotes regardless of how many people downvote. The reason we need moderators is because sometimes downvoting doesn't work. The picture of a cat had net upvotes when it was deleted by a moderator. I think the same should apply equally to all questions that do not attempt to stay within the rules.&lt;/p&gt;&#xA;&lt;p&gt;Answers that beg to get around the rules because &amp;quot;I don't want to waste all that effort&amp;quot; should be deleted to set a clear precedent. They should be undeleted only if they can later be modified to work within the rules. &lt;strong&gt;For this reason I believe the answer linked to should be deleted.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;If you disagree, please post an answer stating and explaining your objection so there can be a consensus to give clear guidance for future cases.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-08-10T14:44:07.800" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1961" PostTypeId="2" ParentId="1940" CreationDate="2014-08-10T14:37:39.710" Score="0" Body="&lt;p&gt;If we are considering a significant amount of moderation power being applied to enforce this rule, I think it is important to ask who this behavior is harming.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;PCCG is not a normal SE site. The average visitor is not coming here to find the &quot;answer&quot; to a &quot;question&quot;. No one is going to suffer from following a &quot;wrong&quot; &quot;answer&quot; by finding a highly upvoted answer here that doesn't strictly follow the rules of the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Upvotes are [mostly] not finite. One wrong answer getting more upvotes does not mean that less-interesting more-valid answers will get fewer. I can upvote the pretty picture &lt;em&gt;AND&lt;/em&gt; upvote the best solution to the challenge within the rules (and the one in my pet language, and the one with the most vowels, and...). The best valid answer will still get accepted / bountied. Good valid answers will still get upvotes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;At most&lt;/em&gt;, I would like to see us adopt some standard boilerplate (a Template, in wiki terms) to put at the top of invalid answers. When they are community wiki, this will be trivial to implement. When they aren't, edits will have to be approved.&lt;/p&gt;&#xA;" OwnerUserId="4787" LastActivityDate="2014-08-10T14:37:39.710" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1962" PostTypeId="2" ParentId="1947" CreationDate="2014-08-10T16:33:06.427" Score="10" Body="&lt;p&gt;I'm not going to write a contrary opinion -- someone else will have to do that. Instead, I'll zoom in on my personal line for this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My bar for a question should be that &lt;em&gt;programming is the challenge&lt;/em&gt;, rather than just being a challenge where you program. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code golf is clearly in the first category, as brevity pushes you to exploit intricacies of the language. Underhanded contests, even if sometimes maligned, reward using language features in sneaky ways. Fastest code pushes you to optimize both algorithms and computer cycles.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;King of the Hill contests though sometimes feel more of games where the challenge is to find a clever strategy and predict what others will do, with the code just an avenue to make the strategy run. There's a challenge, and you code it. In theory, computerized AI's could be used to find strategies on the fly, which is closer to a programming challenge, but that doesn't seem to be happen much.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fastest-algorithm questions also can seem to be about optimizing theoretical algorithms rather than code, though maybe that's close enough to get a pass.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;Programming is the challenge&quot; is the line I favor for questions on this SE. (And yes, that would mean clamping down on King of the Hill which is very popular, so I don't expect it to happen.) So where does that mean for art questions like &lt;a href=&quot;https://codegolf.stackexchange.com/q/35569/20260&quot;&gt;Tweetable Mathematical Art&lt;/a&gt;? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the goal is simply to produce pretty art, and it's easy to write code to make whatever art you want, that's just a challenge where you program. In &lt;a href=&quot;https://codegolf.stackexchange.com/q/35569/20260&quot;&gt;Tweetable Mathematical Art&lt;/a&gt; though, there's a harsh character restriction for the code, which definitely makes coding a challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/35835/20260&quot;&gt;Draw random black-and-white forest&lt;/a&gt; is more borderline, but the requirement that the forest be completely dynamically generated makes it a programming problem. Simply writing code to generate what looks like a tree is a programming challenge, and doing it well is suited to be judged as a popularity context.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35791/create-a-popular-penrose-tiling&quot;&gt;Create a popular Penrose tiling&lt;/a&gt; though, entries are likely to be distinguished by how pretty the Penrose tile designs are. Simply generating a Penrose tiling is certainly a programming challenge, but it's a bar that every program must pass. So, entries cannot be judged relative to each other based on it. The programming is not intrinsic the to contest -- contestants could instead paint tiles on paper and submit photos of their assembled tilings.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I know that popularity contests make it hard to evaluate what the competition is about because that's up to the voters' subjective preferences. Given that, it's up to the poster to explain why coding is intrinsic to their challenge, and not rely on &quot;answers not in the spirit won't be voted up.&quot;&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-08-10T17:01:17.957" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1964" PostTypeId="2" ParentId="2140" CreationDate="2014-08-11T04:07:39.847" Score="0" Body="&lt;h1&gt;Teach me to play clarinet&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; (might be an optimization problem for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is mostly a work in progress until I figure out the best input and output notation/formatting.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The clarinet is a very complicated instrument, as there are more keys than I have fingers.  Additionally, there may be multiple ways to play the same note.  I dream of becoming a professional clarinetist one day, but I am very lazy at everything I do.  When playing music, I try to move my fingers as little as possible.*&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input will be a series of musical notes, which each note consisting of a note name (like &lt;code&gt;E&lt;/code&gt; or &lt;code&gt;G#&lt;/code&gt;) and a number which represents which octave of the clarinet is being discussed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;E1 - low E, the bottom note&#xA;C1 - C below the staff&#xA;E2 - E at the bottom of the staff&#xA;F#3 - F# at the top line of the staff&#xA;G4 - G that is 4 ledger lines above the staff, the highest note needed&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;An example input might be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Eb2 D2 F#3 F3 F#3 G3 F#3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;From this list of notes, your program should determine which fingerings I should use to play these notes in the easiest way possible.  &quot;Easiest&quot; means that the total number of finger movements should be minimized (how to explain?).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output should describe my finger position for each note in terms of the location of each of my fingers.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;One problem I see is that there is no standardized fingering chart for clarinet.  Furthermore, no fingering charts actually specify which fingers are used to play which keys.  One thing I would have to do is create a list of all possible positions for each finger.  Then, a single fingering &quot;diagram&quot; would consist of the list of keys, telling which are open/closed/either.  There would be multiple fingering diagrams for each note.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The next problem is that the number of distinct fingerings can grow to be quite large when certain tricks are taken into account such as &quot;leaving the right hand down while playing throat tones.&quot;  This would be the reason for adding the &quot;either&quot; option to the fingering charts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I must figure out how to notate the fingering charts and format the output.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;*this is actually a good thing and not lazy&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2014-08-11T04:07:39.847" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1965" PostTypeId="2" ParentId="2140" CreationDate="2014-08-11T08:57:49.647" Score="9" Body="&lt;h1&gt;Transport Tycoon [control program WIP] &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The specification is now complete; the control program will now be written&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/rooms/16845/discussion-between-githubphagocyte-and-professorfish&quot;&gt;Chatroom for this challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to create an AI which builds a profitable transport network to carry passengers. In each game, the first entry to have $262,144 or more in cash wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every entry must have a name and version numbering for each time it is altered. You may submit up to 8 entries, but they must not collaborate.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Control&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each round has four players. Each player has a number from 1 to 4.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A simple map will be randomly generated by the control program for each game. This map will be stored in a file &lt;code&gt;map.txt&lt;/code&gt; &lt;em&gt;two directories above&lt;/em&gt; your program (i.e. &lt;code&gt;../../map.txt&lt;/code&gt;), and updated each game tick. Each player's bank balance (as a number without the $ symbol) will be in &lt;code&gt;../../account_&amp;lt;PLAYERNUMBER&amp;gt;.txt&lt;/code&gt;. Vehicle data will be in &lt;code&gt;../../vehicles_&amp;lt;PLAYERNUMBER&amp;gt;.txt&lt;/code&gt;. You may view other player's vehicle and account files.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program will be invoked once, at the start of the game. When your program has finished initializing, it must output &lt;code&gt;READY&lt;/code&gt;. If it takes more than 60 seconds to initialize, it will be terminated and disqualified from that game. It may keep files between rounds (for example, to predict an opponent's strategy after watching them for a few games). Other players may not view these files. The tournament will be re-run and the leaderboard updated every 2 days. Your program may not keep files between tournaments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The control program will put the text &lt;code&gt;WAITING-player_number&lt;/code&gt; (e.g. &lt;code&gt;WAITING-4&lt;/code&gt;) and a newline to your program's standard input when each game tick begins. You will submit actions on standard output, separated by new lines, terminated by &lt;code&gt;END&lt;/code&gt;. Actions that are invalid for whatever reason will be completely ignored. If your program takes longer than 1 second to output &lt;code&gt;END&lt;/code&gt;, it will receive &lt;code&gt;TIMEOUT&lt;/code&gt; on standard input and &lt;em&gt;no action will be executed for this turn&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If no winner has been found after 30 minutes, the player with the most money wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Map format&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The map will be a two-dimensional ASCII grid where the top is north, the bottom is south, the left is west and the right is east. Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#/////////&#xA;######@@@*&#xA;/**@@#####&#xA;//@@1#@@@*&#xA;/@@##@**/#&#xA;~~~+~~~~~|&#xA;///#######&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;#&lt;/code&gt; represents a road. &lt;code&gt;/&lt;/code&gt; represents empty land. &lt;code&gt;*&lt;/code&gt; is for difficult terrain (e.g. hills, swamps, whatever) - more on that later. &lt;code&gt;@&lt;/code&gt; represents a house. &lt;code&gt;~&lt;/code&gt; is a body of water. &lt;code&gt;+&lt;/code&gt; is a completed bridge over water. &lt;code&gt;|&lt;/code&gt; is a partially constructed bridge. The numbers 1 to 4 represent stations belonging to players (e.g.: if you are player 4, your stations will be marked as &lt;code&gt;4&lt;/code&gt;). 5 to 8 represent 'inactive' stations belonging to players 1 to 4 respectively.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The line endings in the file will be Windows-style CRLF.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The top left corner is &lt;code&gt;(0,0)&lt;/code&gt;. X is horizontal and Y is vertical.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Construction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each tick, a player can perform up to 4 construction actions. These are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;replace a &lt;code&gt;/&lt;/code&gt; with a &lt;code&gt;#&lt;/code&gt; (build a road)&lt;/li&gt;&#xA;&lt;li&gt;replace a &lt;code&gt;*&lt;/code&gt; with a &lt;code&gt;/&lt;/code&gt; (prepare terrain)&lt;/li&gt;&#xA;&lt;li&gt;replace a &lt;code&gt;#&lt;/code&gt; with an inactive station (build a station)&lt;/li&gt;&#xA;&lt;li&gt;replace a &lt;code&gt;~&lt;/code&gt; with a &lt;code&gt;|&lt;/code&gt; (start a bridge)&lt;/li&gt;&#xA;&lt;li&gt;replace a &lt;code&gt;|&lt;/code&gt; with a &lt;code&gt;+&lt;/code&gt; (finish a bridge)&lt;/li&gt;&#xA;&lt;li&gt;replace one of your stations with a &lt;code&gt;#&lt;/code&gt; (demolish a station)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You may not perform more than one action on a tile in one turn (you cannot go from &lt;code&gt;~&lt;/code&gt; to &lt;code&gt;|&lt;/code&gt; and to &lt;code&gt;+&lt;/code&gt; in a single turn).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You cannot demolish roads, bridges, water, houses or other players' stations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each action costs $512, and is sent to the control program on standard output in the following format (&lt;em&gt;B&lt;/em&gt; is for Build):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;B-X-Y-tile&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For example, this will build a road at (8,4):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;B-8-4-#&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Invalid commands will be ignored.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Vehicles&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each player can own an unlimited number of vehicles. The basic bus has the following properties:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;carries 32 passengers&lt;/li&gt;&#xA;&lt;li&gt;travels 8 tiles per turn&lt;/li&gt;&#xA;&lt;li&gt;consumes $8 per tile in running costs&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Each vehicle can have up to 4 upgrades out of the following (but no more than 2 of each type):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;+16 capacity (denoted by &lt;code&gt;C&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;+4 tiles/tick speed (&lt;code&gt;S&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;-$2 running costs (&lt;code&gt;R&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;At most one vehicle can be bought by each player per turn. The basic bus costs $4096 and each upgrade costs $1024; the maximum possible cost is therefore $8192 (all 4 upgrades). A bus can be sold at any time for half of its purchase price (including upgrades; a bus with 4 upgrades can be bought for $8192 and sold for $4096). At most one vehicle can be sold each turn.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The command for purchasing a vehicle is (&lt;em&gt;P&lt;/em&gt; is for Purchase):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;P-id-X-Y-upgrades&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For example, this will buy a bus with no upgrades, assign it the ID 5, and place it at (7,7):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;P-5-7-7-&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The command for selling a vehicle is simply (&lt;em&gt;V&lt;/em&gt; is for Vend)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;V-id&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Vehicles are stored in &lt;code&gt;vehicles_N.txt&lt;/code&gt; in the following format, separated by newlines:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;id-X-Y-passengers-upgrades-laststationX-laststationY&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For example, this bus has ID 4, is at (5,5), contains 15 passengers, has two speed upgrades and one running cost upgrade, and last stopped at (3,4). If the bus has never run &lt;code&gt;A&lt;/code&gt; before, use the coordinates where it was created for the &quot;last station&quot; coordinates. Update the coordinates every time &lt;code&gt;A&lt;/code&gt; is run for that bus.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4-5-5-15-SSR-3-4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Vehicles can travel on roads (&lt;code&gt;#&lt;/code&gt;), bridges (&lt;code&gt;+&lt;/code&gt;) and station tiles (&lt;code&gt;12345678&lt;/code&gt;). In the above example, it is possible to drive from the top left corner to the bottom right corner. However, the two road sections in the map below aren't connected, because they are only diagonally touching. Building a road on one of the &lt;code&gt;*&lt;/code&gt; would solve this.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;/////&#xA;##*//&#xA;/*###&#xA;/////&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Vehicles can only stop to pick up and drop off passengers at stations belonging to their owner - player 3's bus can only stop at a &lt;code&gt;3&lt;/code&gt; or a &lt;code&gt;7&lt;/code&gt;, but not at any of &lt;code&gt;124568#+&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your AI has complete control over the movement of its buses. It will submit directions as commands. For example, the following command set will move bus 8 in a circle, then two spaces south, then make it offload 8 passengers, then make it wait for passengers (N, E, S and W are north, east, south and west; &lt;em&gt;R&lt;/em&gt; is for Remove; &lt;em&gt;A&lt;/em&gt; is for Acquire):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;N-8&#xA;E-8&#xA;S-8&#xA;W-8&#xA;S-8&#xA;S-8&#xA;R-8&#xA;A-8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;NB: Waiting at a station with &lt;code&gt;A&lt;/code&gt; counts towards the limit of tiles that the bus can travel each turn, although it is not moving. While waiting, double running costs are charged. A bus may wait for multiple turns. If a bus moves fewer tiles than it is able to (e.g. can move 8 tiles per turn but chooses to move 5 times), halved running costs are charged for the unused turns.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Passengers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each time an &lt;code&gt;R&lt;/code&gt; command is submitted for a bus that is at a station, the bus loses 8 of its passengers. The diagonal distance (using Pythagoras' theorem) between its current station and the previous one is calculated and rounded down (floored). Each passenger offloaded gives this amount of profits (e.g. if the previous station is 1.4 tiles away, each passenger gives $1; if it is 5.9 tiles away, each passenger gives $5).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each time an &lt;code&gt;A&lt;/code&gt; command is submitted for a bus that is at a station, the bus gains passengers. Each house in range of your station provides &lt;code&gt;1/number_of_active_stations_in_range_of_house&lt;/code&gt; passengers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there are three stops, A, B and C, and the bus has a route from A to B and then to C, but only picks up passengers at A, then passengers offloaded at B will pay the price for A to B, and passengers offloaded at C will pay for A to C. However, if any passengers are loaded at B, then &lt;em&gt;all&lt;/em&gt; of the passengers offloaded at C, even if some of them boarded at A, will pay the fare for B to C.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the map below, the tiles marked with &lt;code&gt;@&lt;/code&gt; and &lt;code&gt;#&lt;/code&gt; are in range (4 tiles or less away), but not the tiles marked with &lt;code&gt;/&lt;/code&gt;; the bus at 1 will gain 32 passengers because there are 32 houses in range and no other stations.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;////@////&#xA;///@@@///&#xA;//@@@@@//&#xA;/@@@@@@@/&#xA;####1####&#xA;/@@@@@@@/&#xA;//@@@@@//&#xA;///@@@///&#xA;////@////&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Other&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You will be charged $64 per turn for each station, active or not, that you own.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each turn, active stations have a 1 in 8 chance of becoming inactive. This is reverted when a bus runs &lt;code&gt;A&lt;/code&gt; at the station.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will start with $32768.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may not have a negative quantity of money.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When someone wins, all competing programs will receive &lt;code&gt;GAMEEND&lt;/code&gt; on standard input. They may no longer submit commands after this happens, but they may read and write from files (to prepare for a subsequent game, for example). After 60 seconds, all competing programs will be killed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The map will be 256*256 tiles.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Todo&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Write control program&lt;/li&gt;&#xA;&lt;li&gt;Write map generator&lt;/li&gt;&#xA;&lt;li&gt;Plan tournament format&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user16402" LastEditorDisplayName="user16402" LastEditDate="2014-09-02T10:44:35.183" LastActivityDate="2014-09-02T10:44:35.183" CommentCount="16" ContentLicense="CC BY-SA 3.0" />
  <row Id="1966" PostTypeId="2" ParentId="1957" CreationDate="2014-08-11T13:51:07.900" Score="-3" Body="&lt;p&gt;We should just use the existing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-art&lt;/a&gt; tag.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-08-11T13:51:07.900" CommentCount="2" CommunityOwnedDate="2014-08-11T13:51:07.900" ContentLicense="CC BY-SA 3.0" />
  <row Id="1967" PostTypeId="2" ParentId="1957" CreationDate="2014-08-11T13:52:59.420" Score="14" Body="&lt;p&gt;We should create a new &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; tag.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-08-11T13:52:59.420" CommentCount="9" CommunityOwnedDate="2014-08-11T13:52:59.420" ContentLicense="CC BY-SA 3.0" />
  <row Id="1968" PostTypeId="2" ParentId="1957" CreationDate="2014-08-11T13:54:11.133" Score="11" Body="&lt;p&gt;We should create a new &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-craft&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-craft&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-craft&lt;/a&gt; tag.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-08-11T13:54:11.133" CommentCount="3" CommunityOwnedDate="2014-08-11T13:54:11.133" ContentLicense="CC BY-SA 3.0" />
  <row Id="1969" PostTypeId="2" ParentId="1957" CreationDate="2014-08-11T13:55:15.063" Score="-1" Body="&lt;p&gt;We should create a new &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/structured-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;structured-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;structured-source&lt;/a&gt; tag. (Credit: Calvin's Hobbies)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-08-11T13:55:15.063" CommentCount="1" CommunityOwnedDate="2014-08-11T13:55:15.063" ContentLicense="CC BY-SA 3.0" />
  <row Id="1970" PostTypeId="2" ParentId="1957" CreationDate="2014-08-11T13:56:28.383" Score="1" Body="&lt;p&gt;We should create a new &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arranged-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arranged-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;arranged-source&lt;/a&gt; tag. (Credit: professorfish)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-08-11T13:56:28.383" CommentCount="0" CommunityOwnedDate="2014-08-11T13:56:28.383" ContentLicense="CC BY-SA 3.0" />
  <row Id="1971" PostTypeId="2" ParentId="1957" CreationDate="2014-08-11T13:57:47.957" Score="0" Body="&lt;p&gt;We should create a new &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-formatting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-formatting&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-formatting&lt;/a&gt; tag. (Credit: professorfish)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-08-11T13:57:47.957" CommentCount="1" CommunityOwnedDate="2014-08-11T13:57:47.957" ContentLicense="CC BY-SA 3.0" />
  <row Id="1972" PostTypeId="2" ParentId="1957" CreationDate="2014-08-11T14:03:20.033" Score="-6" Body="&lt;p&gt;There is no need for such a tag.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-08-11T14:03:20.033" CommentCount="1" CommunityOwnedDate="2014-08-11T14:03:20.033" ContentLicense="CC BY-SA 3.0" />
  <row Id="1973" PostTypeId="2" ParentId="1957" CreationDate="2014-08-11T15:44:44.810" Score="-3" Body="&lt;p&gt;We should create a new &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/shaped-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;shaped-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;shaped-source&lt;/a&gt; tag.&lt;/p&gt;&#xA;" OwnerUserId="8766" LastActivityDate="2014-08-11T15:44:44.810" CommentCount="0" CommunityOwnedDate="2014-08-11T15:44:44.810" ContentLicense="CC BY-SA 3.0" />
  <row Id="1974" PostTypeId="2" ParentId="1957" CreationDate="2014-08-11T16:03:34.583" Score="14" Body="&lt;p&gt;We should create a new &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sourcery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sourcery&amp;#39;&quot; rel=&quot;tag&quot;&gt;sourcery&lt;/a&gt; tag.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-08-11T16:03:34.583" CommentCount="3" CommunityOwnedDate="2014-08-11T16:03:34.583" ContentLicense="CC BY-SA 3.0" />
  <row Id="1975" PostTypeId="2" ParentId="1957" CreationDate="2014-08-11T16:11:07.147" Score="-4" Body="&lt;p&gt;We should create a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tiled-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tiled-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;tiled-source&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-tiling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-tiling&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-tiling&lt;/a&gt; tag.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="11259" LastEditDate="2014-08-11T16:16:34.693" LastActivityDate="2014-08-11T16:16:34.693" CommentCount="2" CommunityOwnedDate="2014-08-11T16:11:07.147" ContentLicense="CC BY-SA 3.0" />
  <row Id="1976" PostTypeId="1" CreationDate="2014-08-11T16:15:06.790" Score="4" ViewCount="78" Body="&lt;p&gt;There has recently been some confusion with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/36068/smallest-python-script-to-print-even-numbers-0-to-100&quot;&gt;this advice question&lt;/a&gt; where people were posting off topic answers in languages other than python. Even though the question was very clear about wanting python advice (tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot;&gt;python&lt;/a&gt;, specified &quot;create a python script&quot; and gave python code as the example to be golfed down), there was still apparent resentment on the part of someone who had been drawn in by the title and then decided to post an answer in perl anyway.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've edited the question title to include python now. I don't see the misleading title as any justification for posting an answer, but I do see how it will be annoying to click on a question only to find it is not what you were expecting. What should be done about this?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't personally see this as a major problem as the tags are clearly visible in the question list even without including the language in the title. So should the approach be to edit question titles to include language where tagged as such, or to maintain that a language tag is more than enough and work on educating answerers who post in off topic languages?&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-09-24T13:23:19.273" Title="Adding language to title of advice questions" Tags="|discussion|titles|" AnswerCount="0" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1977" PostTypeId="2" ParentId="1957" CreationDate="2014-08-11T17:19:08.407" Score="5" Body="&lt;p&gt;We should create a new &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-shaping&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-shaping&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-shaping&lt;/a&gt; tag.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2014-08-11T17:19:08.407" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1978" PostTypeId="2" ParentId="1957" CreationDate="2014-08-11T17:22:11.137" Score="0" Body="&lt;p&gt;We should create a new &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-sculpting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-sculpting&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-sculpting&lt;/a&gt; tag.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2014-08-11T17:22:11.137" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1981" PostTypeId="2" ParentId="2140" CreationDate="2014-08-11T21:34:24.700" Score="0" Body="&lt;h1&gt;Chess: End Game KOTH&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You design a bot that plays the final moves of a chess game against other bots. The chess board will be in the end game stage (relatively few pieces) with either a winning position for white, or a force draw. Points will be scored on the outcome of the game in each board situation. Bots will play both the black and white sides for each position (10 unique positions, 20 games in total). &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Basic chess rules apply&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No &lt;a href=&quot;http://en.wikipedia.org/wiki/En_passant&quot; rel=&quot;nofollow&quot;&gt;&lt;em&gt;en passant&lt;/em&gt;&lt;/a&gt; will be possible&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Promotion_(chess)&quot; rel=&quot;nofollow&quot;&gt;Promotion&lt;/a&gt; of pawns is valid&lt;/li&gt;&#xA;&lt;li&gt;Previous &lt;a href=&quot;http://en.wikipedia.org/wiki/Castling&quot; rel=&quot;nofollow&quot;&gt;castling&lt;/a&gt; moves will be indicated during board setup, otherwise castling is possible if legal&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Fifty-move_rule&quot; rel=&quot;nofollow&quot;&gt;50 move&lt;/a&gt; rule will apply&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Threefold_repetition&quot; rel=&quot;nofollow&quot;&gt;Threefold repetition&lt;/a&gt; rule will apply&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No outside help whatsoever (chess engines, endgame tablebases, stored patterns)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;Notation will be in the &lt;a href=&quot;http://en.wikipedia.org/wiki/ICCF_numeric_notation&quot; rel=&quot;nofollow&quot;&gt;ICCF numeric notation&lt;/a&gt; format&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Round-robin_tournament&quot; rel=&quot;nofollow&quot;&gt;Round-robin&lt;/a&gt; tournament setup (see scoring below)&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;20 games per match (1 match is one bot-to-bot pairing)&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each bot plays 10 games as white and 10 games as black&lt;/li&gt;&#xA;&lt;li&gt;8 of these games will be force wins for white, the remaining 2 are force draws (but winnable by either player)&lt;/li&gt;&#xA;&lt;li&gt;The same 10 games will be repeated, so each bot will play the same position as both colors.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Time limit of 1 minute per match? (&lt;em&gt;very flexibly here&lt;/em&gt;)&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Maximum time per move is X seconds (possible &lt;a href=&quot;http://en.wikipedia.org/wiki/Time_control&quot; rel=&quot;nofollow&quot;&gt;Fischer Delay&lt;/a&gt; bonus?)&lt;/li&gt;&#xA;&lt;li&gt;Failure to move in the time limit per move will result in a loss for the current game&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;These values will surely change&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+---------------------+------------+------------+-------------+-------------+&#xA;| Board Situation     | White Wins | Black Wins | Black Draws | White Draws |&#xA;+---------------------+------------+------------+-------------+-------------+&#xA;| Force Win for White | 100        | 500        | 250         | -50         |&#xA;| Force Draw          | 250        | 350        | 50          | 50          |&#xA;+---------------------+------------+------------+-------------+-------------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;em&gt;Need to figure in number of moves into points&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;Overall winner is the bot with the most points at the end of the round-robin &lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;How To Play&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Controller will be written in python and will communicate to bots via STDIN/STDOUT&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bots can be programmed in any language that support persistent polling of STDIN and STDOUT&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A board will be generated by the controller and sent to both players at the same time (will include information for castling in a TBD format). Each bot will be given ~50 ms to process the board information, but they don't know what side they are playing.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Following the short pause, each of the bots will be sent either &lt;code&gt;B&lt;/code&gt; or &lt;code&gt;W&lt;/code&gt; character to indicate which side they will play for the next game. At this time, the white bot timer is activated and it can return his move any time afterwards.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The bot will response via its STDOUT the move in ICCF numeric notation&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;5453&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;After the move has been validated by the controller, the time remaining for both opponents and the move history will be sent to the each bot, and then the other bot begins their turn. Time will be outputted in ms in the following format &lt;code&gt;WXXXXX BXXXXX&lt;/code&gt;. The following is the output given to each bot after each &lt;a href=&quot;http://en.wikipedia.org/wiki/Ply_(game_theory)&quot; rel=&quot;nofollow&quot;&gt;ply&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;&lt;pre&gt;&lt;code&gt;W54000 B60000 1) 5453&#xA;W54000 B48000 1) 5453 7872&#xA;W52000 B48000 1) 5453 7872 2) 6512&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;This will repeat (steps 4&amp;amp;5) until the game is won, drawn, or time runs out, after which the bots will be sent the final score of the game and time remaining for the next game of the match&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;&lt;pre&gt;&lt;code&gt;W35000 B47000 W+300 B+50&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Things that might be a problem&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The efficiency of the language (i.e., C++ vs perl) might bias towards language used instead of algorithm developed&lt;/li&gt;&#xA;&lt;li&gt;Generating board situations (could grab them through an online DB automatically) &lt;/li&gt;&#xA;&lt;li&gt;Too hard/easy to program?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="21434" LastActivityDate="2014-08-11T21:34:24.700" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1983" PostTypeId="1" AcceptedAnswerId="1985" CreationDate="2014-08-12T03:26:06.223" Score="7" ViewCount="300" Body="&lt;p&gt;I've noticed this happening a few times: A challenge that is very similar to an existing code golf challenge is posted as a popularity contest, or the other way around. There seems to be very little consensus as to what to do in this situation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answers from a code golf challenge typically cannot be posted to a popularity contest (and vice versa). On the other hand, the challenges are very close and sometimes almost exact duplicates except for the winning criterion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What should we do about these?&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-08-12T07:03:19.757" Title="Is a popularity contest a duplicate of a code golf (and vice versa)?" Tags="|discussion|policy|duplicates|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1984" PostTypeId="2" ParentId="1983" CreationDate="2014-08-12T04:25:59.227" Score="2" Body="&lt;p&gt;Conceptually, I would say that a mostly disjoint set of answers makes the questions suitably distinct, even if that distinction lies in a single word or tag.&lt;/p&gt;&#xA;" OwnerUserId="4787" LastActivityDate="2014-08-12T04:25:59.227" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="1985" PostTypeId="2" ParentId="1983" CreationDate="2014-08-12T07:03:19.757" Score="15" Body="&lt;p&gt;The only reason pop-con even exists is because some people couldn't think of a good winning criterion for some of their questions. If a challenge works as a code-golf, it shouldn't be posted as a pop-con.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-08-12T07:03:19.757" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="1987" PostTypeId="1" CreationDate="2014-08-12T13:25:54.410" Score="30" ViewCount="970" Body="&lt;p&gt;The default sorting for answers (by votes) seems somewhat inappropriate here on PPCG. In any case it tends to put early answers over late answers, because once a few are there, few people scroll to the bottom to see newer answers and even fewer people sort by activity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you consider that better answers will usually take longer to come up with and implement, that means the answers that deserve the votes are actually at a disadvantage.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is problematic for different reasons on different challenge types:&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Popularity Contest&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Sorting by votes is still useful here, because that actually shows you the ranking of the answers by the winning criterion. However, for that very reason (that votes determine the winner) a bias towards early answers can't be in the interest of the community.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Other Challenges&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Here, sorting by votes doesn't even make really make sense in the first place. The reason this is the default sorting on other SE sites is that it's a decent heuristic for which answer is the best. But we don't need that, because the quality of an answer can be determined objectively by the winning criterion. Of course, sorting by winning criterion is not an option, but sorting by votes doesn't seem useful either. Hence, some other sorting could at least help later and better answers get the votes they deserve.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, I'd say we should think about different, more appropriate, sorting modes and also consider whether the default sorting should be changed. If we can come to a community consensus here, we might be able to bring this to the attention of SE staff.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The questions to discuss are: are the existing sorting modes sufficient or do we need new ones (which ones)? Should a different (new or existing) sorting mode be the default?&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="68942" LastEditDate="2021-06-09T05:40:30.660" LastActivityDate="2021-06-09T05:40:30.660" Title="Could PPCG benefit from a new sorting mode for answers?" Tags="|discussion|feature-request|status-deferred|answers|voting|" AnswerCount="12" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="1988" PostTypeId="2" ParentId="1987" CreationDate="2014-08-12T13:25:54.410" Score="16" Body="&lt;h2&gt;Random Sorting&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I propose that a purely random default sorting would solve the above problems. It would simply remove the bias towards any kind of answer and would distribute the votes more fairly. Of course, the existing sorting by activity will also remove the bias towards early answers, but the fact that it's deterministic is still problematic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Especially in cases where there are so many answers that few people read all of them, some answers are just almost never seen because they are too far down the list (depending on which sorting is active). If the sorting was random by default, people still wouldn't scroll through all of them, but at least each answer would get the same number of views on average.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would even go so far to suggest that this default sorting is not remembered between visiting different questions (currently, if you switch to sorting by activity, all questions will be sorted by activity until you switch back).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note: &lt;a href=&quot;https://meta.stackexchange.com/questions/49348/real-random-ordering-of-answers&quot;&gt;random sorting has been suggested before&lt;/a&gt; a few years ago back on SO but without much response. I don't even think it's that useful on other SE sites, but PPCG could really use it.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Pros&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Trivial to implement.&lt;/li&gt;&#xA;&lt;li&gt;All answers are equally likely to be seen. So there is no bias towards any answers, hence it's as fair as it gets.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Cons&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All answers are equally likely to be seen. Even the bad ones.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;(However, this would lead to really bad answers getting more downvotes and hence being more likely to be deleted, resulting in less overall clutter. So maybe this is another pro after all.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-08-15T09:56:08.567" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1989" PostTypeId="2" ParentId="1987" CreationDate="2014-08-12T13:41:20.790" Score="3" Body="&lt;h2&gt;Reddit-style sorting&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I don't remember exactly how it works, but Reddit's sorting algorithm (or HN's, or ...) takes both time and votes into account to present &quot;hot&quot; content, i.e. content climbing faster than typical or with higher than typical votecount.  In practice high-voted content tends to be the norm, with new or rising content spliced in occasionally.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Our situation is a bit different: we don't want sufficiently old answers to suddenly drop quickly the same way as Reddit does, and we have an additional &quot;active&quot; parameter separate from the time since initial answer. Still, Reddit's (or a similar service's) algorithm could serve as a base for a good sorting algorithm.  Reddit-style sorting might also be of interest in other SE subsites as well (moreso than random sorting, at least), so there's more reason for SE to provide it.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I think it'd be unfair to high-voted entries with completely random sorting, and even though we don't need the vote-based sorting for questions with something other than popularity-contest as the winning criterion it still makes sense to promote high-voted answers since they presumably follow the winning criterion well (or otherwise entertain the voters).&lt;/p&gt;&#xA;" OwnerUserId="3918" LastActivityDate="2014-08-12T13:41:20.790" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1990" PostTypeId="2" ParentId="1987" CreationDate="2014-08-12T13:42:19.820" Score="8" Body="&lt;h1&gt;Randall Munroe - a statistical estimation ordering&lt;/h1&gt;&#xA;&lt;p&gt;When reddit had a similar problem with new comments getting lost at the bottom, &lt;a href=&quot;http://www.redditblog.com/2009/10/reddits-new-comment-sorting-system.html?&quot; rel=&quot;nofollow noreferrer&quot;&gt;Randall Munroe brought in a new sorting algorithm&lt;/a&gt;. Obviously don't just vote for this because you like Randall Munroe - it's an interesting algorithm well worth reading about before you decide.&lt;/p&gt;&#xA;&lt;p&gt;It only requires the information that stack exchange already uses to sort by votes anyway (upvotes and downvotes), but deals elegantly with precisely the problem we're discussing. The example at the end demonstrates this nicely.&lt;/p&gt;&#xA;&lt;p&gt;The algorithm has the best features of sorting by votes, sorting randomly, and sorting by time, without actually using any randomness or time, just upvotes &lt;strong&gt;and&lt;/strong&gt; downvotes.&lt;/p&gt;&#xA;&lt;p&gt;In short:&#xA;The Randall Munroe algorithm works well on reddit because it uses both upvotes and downvotes to measure how statistically likely a post is to get to the top, and orders by the expected future position rather than just its current votes. So it doesn't need time because the downvotes give a percentage measure rather than just a plain count of upvotes&#xA;The problem with applying that to stack exchange is that downvotes are a rare thing here - most answers have zero downvotes, so we might need to take a different approach that bases the statistical measure on upvotes, downvotes, and time. These are all already available to the sorting code of stack exchange so it is feasible to implement.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-08-12T14:06:39.457" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="1991" PostTypeId="2" ParentId="1987" CreationDate="2014-08-12T13:43:56.600" Score="-1" Body="&lt;h2&gt;Why sorting by votes is a good idea&lt;/h2&gt;&#xA;&lt;p&gt;PPCG benefits a lot from people stumbeling upon popular questions, when they open thsi question, we definitely want to showcase the best and most interesting answers.&#xA;In many categories, there is a very clear difference between good and interesting answers. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1906/should-users-upvote-winning-leading-answers/1908#1908&quot;&gt;This answer explains this better than I ever could.&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Why sorting by votes is a terrible idea&lt;/h2&gt;&#xA;&lt;p&gt;Well, basically, for all the reasons you mentioned, late answers don't get the attention they deserve and the gap between early answers and late answers only gets bigger over time (especially when answers exceed one page).&lt;/p&gt;&#xA;&lt;h2&gt;Problems with random sorting&lt;/h2&gt;&#xA;&lt;p&gt;While it is more fair and we could still let new users (or people who aren't logged in) keep their ranking by votes. It's still valuable to have answers which are obviously good near the top and terrible answers (or very unremarkable ones) buried. Random sorting won't do this and whenever I visit a question with a lot of answers (the sort of question where this ranking would be desirable) I'll be presented with mostly 'meh' answers.&lt;/p&gt;&#xA;&lt;h2&gt;An alternative Ranking system&lt;/h2&gt;&#xA;&lt;p&gt;We could opt for a ranking systems that still largely bases on votes but favors newer answers, similar to how &lt;a href=&quot;http://stackexchange.com/questions?tab=hot&quot;&gt;hot network questions work&lt;/a&gt; A possible formula for this could look something like: &lt;code&gt;votes on this anwer/votes on all answers + a*votes on this anwer/votes on all answer since this answer was posted&lt;/code&gt; where a is a carefully selected weight. This would give late answers a fighting chance when they are first posted. If they gather some upvotes then, they'll stay up and even float up, if being at the top doesn't gather them upvotes though, they'll drop down again.&lt;/p&gt;&#xA;&lt;p&gt;A random addend could also be added to this score to bring some life into things.&lt;/p&gt;&#xA;" OwnerUserId="29588" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-08-12T13:57:29.223" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="1993" PostTypeId="2" ParentId="1987" CreationDate="2014-08-12T14:47:07.167" Score="-1" Body="&lt;h1&gt;Rate of votes compared to placement on page?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is sort of a long-shot thinking-out-loud idea, but I feel that a &quot;hotness&quot; ranking should be determined by two things:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The rate of votes that the answer is experiencing&lt;/li&gt;&#xA;&lt;li&gt;The answer's history of placement on the page&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;My logic is that the rate of votes is determined by two primary factors:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The quality of that answer (which may be very roughly approximated by votes/viewer)&lt;/li&gt;&#xA;&lt;li&gt;The visibility of that answer (which determines the rate of new viewers)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Basically, we want to calculate &lt;code&gt;votes/viewer = rate of votes / rate of new viewers&lt;/code&gt;.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think the ranking system should try to determine which answers have the highest votes/viewer ratio. The ranking algorithm would look at the rate of votes and try to determine how much of that rate is due to answer quality and how much is due to visibility.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What we would need to do is take an empirical measurement of how an answer's placement on the page affects the rate of votes it is experiencing.  I expect the visibility to decrease with lower placemement, with large decreases once the answers are on second/third pages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Perhaps here is one way of calculating it.  This is by no means the best way, just a possible realization of the main idea of this post.  &lt;em&gt;The idea of taking answer placement into account can be incorporated into several of the other suggestions.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = answer, N = placement position number, votes(A) = all votes, score(A) = up - down&#xA;&#xA;expectedrate(N) = average rate of votes experienced by all answers in Nth placement position&#xA;timespent(A,N) = the total time spent by answer A in placement position N&#xA;expectedvotes(A) = summation( timespent(A,N) * expectedrate(N) )&#xA;result(A) = score(A) * votes(A) / expectedvotes(A)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Basically, the answer's ranking is affected by how that answer's number of votes compares to the expected number of votes.  The expected number of votes takes into account the how long the answer spent in each position and the rate of votes experienced by each position.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Pros:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;High-quality answers with very low visibility will have that taken into account and rise to the top very quickly&lt;/li&gt;&#xA;&lt;li&gt;Highly-visible answers with the most upvotes will be penalized if the only reason for their upvotes is the visibility and not because of above average quality.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Cons:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Might not work when the pool of voters is very small and starts to diminish.&lt;/li&gt;&#xA;&lt;li&gt;The popularity of the question probably determines how influential answer placement is.&lt;/li&gt;&#xA;&lt;li&gt;Hard to calculate or measure.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2014-08-12T14:53:47.050" LastActivityDate="2014-08-12T14:53:47.050" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1994" PostTypeId="2" ParentId="1987" CreationDate="2014-08-12T15:37:49.353" Score="-1" Body="&lt;h1&gt;Sort by votes minus amount of time since post&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Here's a fancy userscript for your testing pleasures (doesn't work for multiple pages):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function rank(x) {&#xA;  var score = parseInt($('.vote-count-post', x).text());&#xA;  var milliseconds = new Date($('.post-signature:last-child .user-action-time span.relativetime', x).attr('title')) * 1,&#xA;    hours = milliseconds / 1000 / 60 / 60;&#xA;  return score - hours; // or some other factor&#xA;}&#xA;&#xA;var ranked = $('.answer').sort(function(a, b) { return rank(a) &amp;lt; rank(b) ? 1 : -1; });&#xA;$('#answers').empty().append(ranked);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This will rank a +20 answer posted 10 hours ago the same as a +15 answer posted 5 hours ago. I.e., it will subtract the amount of hours since post from the score. (Technically, hours since the epoch, but they work the same in practice.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, the amount that time has to do with the sorting could be changed, but 1 hour == 1 upvote seems like a good factor, from brief testing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Advantages:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Very simple.&lt;/li&gt;&#xA;&lt;li&gt;Can be tweaked easily.&lt;/li&gt;&#xA;&lt;li&gt;You see new answers when you come back in a day or two.&lt;/li&gt;&#xA;&lt;li&gt;Answers with a ridiculous amount of upvotes still stay at the top.&lt;/li&gt;&#xA;&lt;li&gt;Answers posted, say, a few months later will have a very large advantage.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Disadvantages:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You see new answers when you come back in a day or two.&lt;/li&gt;&#xA;&lt;li&gt;Answers with a ridiculous amount of upvotes still stay at the top.&lt;/li&gt;&#xA;&lt;li&gt;Answers posted, say, a few months later will have a very large advantage.&lt;/li&gt;&#xA;&lt;li&gt;Not very fair for users who post on times like the weekend, whose posts sink down and don't have much of a chance at rising back up.&lt;/li&gt;&#xA;&lt;li&gt;Can still be affected by bias.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="3808" LastEditDate="2014-08-12T15:45:56.880" LastActivityDate="2014-08-12T15:45:56.880" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="1996" PostTypeId="2" ParentId="1987" CreationDate="2014-08-12T16:48:38.383" Score="0" Body="&lt;h1&gt;Vote Order + Semi-Random Permutation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A combination of votes and a randomizer might be best.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;One method of accomplishing this is to take the placement of each answer (1, 2, 3, etc.) and add a random real number 0-5 to that number.  Then, sorting by these new numbers gives the new order.  The goal is to create a semi-random permutation of the order such that no answer is &lt;em&gt;too&lt;/em&gt; far from its original location.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Pros:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The most upvoted answers are still near the top, with just enough randomization that the not-quite-as-upvoted answers also get the change to be near the top.&lt;/li&gt;&#xA;&lt;li&gt;Answers with no votes are still lower down, but aren't always dead last.&lt;/li&gt;&#xA;&lt;li&gt;The &quot;catchy&quot; answers are still visible to random visitors, which helps create interest in this site.&lt;/li&gt;&#xA;&lt;li&gt;Simpler than other methods.&lt;/li&gt;&#xA;&lt;li&gt;Changing the 0-5 range to something bigger (like 0-10) is an easy way to increase randomness.  As the range becomes larger, it is closer to the random sorting.  If is is smaller, it is closer to vote order.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Cons:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Newer answers still have an advantage if the choice of range is small, as highly-voted answers will remain visible.&lt;/li&gt;&#xA;&lt;li&gt;If there are a ton of 0-score answers, most of those answers will end up being swapped around with each other.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2014-08-15T00:35:38.227" LastActivityDate="2014-08-15T00:35:38.227" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1997" PostTypeId="1" CreationDate="2014-08-12T17:06:23.070" Score="4" ViewCount="337" Body="&lt;p&gt;After posting a question that had gone through sandbox, people typically remove the body of their sandbox submission and replace it with a link to the final challenge.  This makes sense to help reduce scrolling in the sandbox.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I was wondering, however, if it would actually be a better idea to delete the sandbox post in addition to removing the body.  Even though removing the body of the post helps to reduce scrolling, the answer still occupies a position in the sandbox and bumps other answers onto the second/third pages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the current sandbox, several of the most upvoted answers have been posted.  On the first page, there are 30 answers, 16 of which have been posted. I think that deleting the answers will increase the visibility of the posts which were on the second page.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I realize that this is only a problem for those who sort by votes, but I think most users sort by votes.)&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2014-09-04T17:39:37.407" Title="Should I delete my sandbox answers after posting the challenge?" Tags="|discussion|sandbox|" AnswerCount="3" CommentCount="2" ClosedDate="2015-03-10T02:21:29.150" ContentLicense="CC BY-SA 3.0" />
  <row Id="1998" PostTypeId="2" ParentId="1997" CreationDate="2014-08-12T17:28:48.500" Score="12" Body="&lt;p&gt;Since the sandbox is now combined and a somewhat larger beast, and since the up and downvotes on this question are very divided, I'm editing to allow people to change their votes (in either direction).&lt;/p&gt;&#xA;&lt;h1&gt;Delete them&lt;/h1&gt;&#xA;&lt;p&gt;Sandbox posts are like comments, not something we need a permanent record of. For anyone who does want to look back through the history of how a question was sculpted before being posted, deleted answers are still visible to high rep users.&lt;/p&gt;&#xA;&lt;p&gt;It is useful to view the sandbox sorted by activity, as Martin Büttner points out. This means that potential questions which have been edited following feedback are visible at the top. However, it is also good for sandbox questions to be visible to as many users as possible, so making them more accessible to anyone who doesn't choose to sort by activity should result in more feedback and better question quality on the main site.&lt;/p&gt;&#xA;&lt;p&gt;So yes, I think we should delete posted questions from the sandbox.&lt;/p&gt;&#xA;&lt;p&gt;Leaving a link there for a short amount of time for anyone who was following its progress is helpful but I don't think essential. Obviously not everyone will remember to delete their sandbox posts so we may need to flag/delete any that are still there after a few days/a week.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-09-04T06:08:36.957" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="1999" PostTypeId="2" ParentId="1997" CreationDate="2014-08-12T17:34:24.913" Score="2" Body="&lt;p&gt;Since the sandbox is now combined and a somewhat larger beast, and since the up and downvotes on this question are very divided, I'm editing to allow people to change their votes (in either direction).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Keep them.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I think that being able to view the history of answers in the sandbox and the corresponding comment threads provides a useful resource to people who want to learn how to write a good question. (How many such people exist is another matter).&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="20283" LastEditDate="2014-09-04T17:39:37.407" LastActivityDate="2014-09-04T17:39:37.407" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="2000" PostTypeId="2" ParentId="1997" CreationDate="2014-08-12T19:36:16.880" Score="11" Body="&lt;h2&gt;Edit down to the title and a link.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This reduces clutter for ALL users, including those who can view deleted posts. If it's very small this way, then the delete/keep issue is less urgent.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2014-08-12T19:36:16.880" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2003" PostTypeId="2" ParentId="1987" CreationDate="2014-08-13T18:11:37.900" Score="-1" Body="&lt;p&gt;&lt;strong&gt;highest&lt;/strong&gt; = vote count for highest voted answer on the same question&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;hours&lt;/strong&gt; = number of hours since answering&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;votes&lt;/strong&gt; = number of votes on your answer&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;sorting: max(0, highest - votes - hours) + votes&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By taking into account the highest voted answer, it ensures that all answers appear at the top, at least when first posted. &quot;max&quot; makes sure that the time since posting only benefits the post for a suitable period of time, during which users have the chance to vote on it. And in the end it still comes back to votes, but at least all answers would have had a chance to be upvoted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;note, when I say votes above, of course I mean upvotes - downvotes. Also, hours could be replaced with &quot;number of hours since answering * n&quot;, to tweak it.&lt;/p&gt;&#xA;" OwnerUserId="21713" LastEditorUserId="21713" LastEditDate="2014-08-13T19:16:36.743" LastActivityDate="2014-08-13T19:16:36.743" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2004" PostTypeId="1" CreationDate="2014-08-13T20:37:31.573" Score="4" ViewCount="285" Body="&lt;p&gt;How can I get enough reputation to be able to actually post an answer here?! It seems that I need 10 reputation to answer the one question that I really want to.  I have some awesome answers to the tweetable mathematical art, but I don't know enough about Code Golfing to answer any other questions.&lt;/p&gt;&#xA;" OwnerDisplayName="user30653" LastActivityDate="2014-08-21T00:01:38.470" Title="Find mathematical art" Tags="|discussion|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2006" PostTypeId="2" ParentId="2004" CreationDate="2014-08-13T20:57:42.800" Score="4" Body="&lt;p&gt;If you can code well enough to do tweetable mathematical art, you can participate in the king of the hill challenges.  These get voted on heavily so you can get reputation on this site faster then on others.  That being said if you have nothing to contribute, please don't upset the other challenges with posts that don't contribute.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you have another stackexchange account with a decent amount of rep, letting the software garnishes you 100 rep on each site.&#xA;This rep, however, cannot be used to overcome that 10 rep wall according to commentors below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;10 rep is 2 votes on a question or just 1 upvote on an answer.  This very low ceiling is to prevent people spamming very low quality posts. Prove you have something to contribute anywhere else on this site and you will get that rep quickly.&lt;/p&gt;&#xA;" OwnerUserId="29108" LastEditorUserId="29108" LastEditDate="2014-08-21T00:01:38.470" LastActivityDate="2014-08-21T00:01:38.470" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2008" PostTypeId="2" ParentId="2140" CreationDate="2014-08-14T14:36:47.523" Score="0" Body="&lt;p&gt;This is a rough idea for a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenge, if possible I would like someone else to help me with it and possibly host the challenge (and consequently getting all of the up votes :] ).&lt;/p&gt;&#xA;&lt;h1&gt;Pecking Birds - input wanted&lt;/h1&gt;&#xA;&lt;p&gt;You're a bird and birds need to eat. There's not all that much food, so you might need to fight for it.&lt;/p&gt;&#xA;&lt;h2&gt;Haven't you heard about the bird?&lt;/h2&gt;&#xA;&lt;p&gt;Birds live on a continuous torus where food drops at random places at an increasingly slow rate. They can only see food from a certain distance, they can see all other birds on the torus though. Birds can only move over a limited distance at a time and can peck at either birds, food or nothing within a certain radius. Birds can see a bird's last action, but they can't distinguish between pecks at food and pecks at nothing if they're too far away. Birds that are pecked to death, turn into food. Food disappears after a fixed amount of birds have taken a peck at it. Birds' health goes down every turn, but get refilled a bit if they peck at food.&lt;/p&gt;&#xA;&lt;h1&gt;Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;If I end up hosting this challenge myself, the controller will be in Java and submissions will be either a java class or a program in another language. Both types of answers will be allowed to persist between turns. Java submissions will have the state of the game copied into global variables and be called to act through a method and send their output as a return value. There will also likely be helper functions available for java submissions. Other submissions will get their info through STDIN and asked to send their output to STDOUT.&#xA;There will be two actions every turn, a pecking action and a moving action. before being asked what to do, you will get the position of each bird, their last pecking action and the position and plentitude of all food withing your sight. On your pecking turn you will be asked to either peck at food, peck at a bird, peck at nothing or not peck at all. On the movement turn you will asked to return a position within your movement radius to move to. All birds peck at the same time and then move at the same time alternately. the winner is the last bird standing.&lt;/p&gt;&#xA;&lt;h2&gt;The competition&lt;/h2&gt;&#xA;&lt;p&gt;Each player will start with 10(?) birds on a &lt;code&gt;sqrt(n)*50&lt;/code&gt;(?) sized torus, where n is the amount of entries. Your score will be determined by the amount of rounds your last bird died before the last bird standing. Obviously a lower score is better. The simulation will be run several times and some sort of average will be taken to determine the overall winner.&lt;/p&gt;&#xA;" OwnerUserId="29588" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-08-15T07:03:27.980" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2009" PostTypeId="2" ParentId="2140" CreationDate="2014-08-14T15:05:59.293" Score="0" Body="&lt;h1&gt;Tetromino Game &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;(name suggestions?)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This game is based off of &lt;a href=&quot;http://en.wikipedia.org/wiki/L_game&quot; rel=&quot;nofollow noreferrer&quot;&gt;L game&lt;/a&gt;, an abstract puzzle game by Edward de Bono.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Every player is assigned a random position in the list of players. Every round, each player gets a &lt;em&gt;turn&lt;/em&gt;, in the order defined by the list of players. The game is over once only 1 player remains.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The board is a 2-dimensional grid containing the tetrominoes, as well as 1x1 neutral pieces. It does not wrap. It is generated randomly and all of the pieces are placed on it, with a good amount of neutral pieces (should equal roughly half the amount of empty blocks, and just over 2/3 the total amount of players).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On each turn, the player must move their piece to another position on the board, and optionally a single neutral piece. This can be anywhere, however, no pieces can intersect.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The player loses if they cannot move their tetromino anywhere; they are no longer given any turns, but their tetromino stays.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After 20 rounds, on every round, a neutral piece will be placed randomly on the board.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A player's score is equal to the amount of turns that they have played.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Submissions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Communication with the controller is done through STDIN and STDOUT. Your submission will run for the entire length of the game. If your program is expected to produce output and doesn't within 4 seconds, you will lose.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the start of the game, your submission will be launched and you are expected to produce  a tetromino to play with. You should output a number from 0 to 4, corresponding to these tetrominoes:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/jzbgj.png&quot; alt=&quot;Tetrominoes&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(modified version of &lt;a href=&quot;https://en.wikipedia.org/wiki/File:All_5_free_tetrominoes.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;They are in order of strategical complexity; 4 is the most complex.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then, the initial game data will be passed to your game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first line contains 3 space-separated integers: your position in the list (starting with 0), board width, and board height.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The rest is a rendering of the board: A player's tetromino is made of the last digit of the base-93 number (ascii 33 to 125) of their position in the list. A space is an empty space, and &lt;code&gt;~&lt;/code&gt; is a neutral piece.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On every turn except your own, your bot will receive information about the turn. The first line can be one of either &lt;code&gt;M 0 0 0&lt;/code&gt; or &lt;code&gt;L&lt;/code&gt;; the first is for motion (see next paragraph), and &lt;code&gt;L&lt;/code&gt; is for that player being unable to make any moves and losing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The motion line is in the format &lt;code&gt;M x y r f&lt;/code&gt;, where x and y is the new position of the upper-left block in the bounding box of that player's tetromino, and r is the amount of rotation (0 for 0 degrees, 1 for 90, 2 for 180, 3 for 270, clockwise).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;f&lt;/code&gt; is either 0 or 1; 1 if the player flipped their piece along the x axis (this happens before rotation). Optionally &lt;code&gt;x y x y&lt;/code&gt; could also be on the end of the line, the first pair of coords being that of a neutral piece, and the next being its target location. It is followed by the new board.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On your turn, &lt;code&gt;GO&lt;/code&gt; will be given to you on STDIN and you will be expected to produce a string &lt;code&gt;x y r f&lt;/code&gt; and optionally &lt;code&gt;x y x y&lt;/code&gt;, similar to the one in the paragraphs just above this. The controller will evaluate whether or not there are possible moves for you just before your turn, and will eliminate you automatically if necessary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your output is invalid, you will receive &lt;code&gt;ERROR&lt;/code&gt; on STDIN and you will be expected to produce a new output. If this happens 5 times in a row, you lose.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Submissions are allowed to store data in files, and initial data for the file can be included with the submission.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each player's score is equal to the amount of turns they play; however the submission's final score is the sum of all their scores in multiple trials. Trials will be run until the leading submission is 5 points away from the runner-up.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Name?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Ideas: &quot;Tetromeano&quot; (suggested as a joke on chat), &quot;Space Tetris&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/rooms/16435/tetromino-game&quot;&gt;Discuss the game here.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="13702" LastEditorUserId="13702" LastEditDate="2014-08-14T17:34:37.720" LastActivityDate="2014-08-14T17:34:37.720" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2010" PostTypeId="2" ParentId="2140" CreationDate="2014-08-14T17:19:06.543" Score="4" Body="&lt;h1&gt;Realistic Stock Market&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is based off of this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/36166/stack-exchange-stock-exchange-tournament&quot;&gt;other challenge&lt;/a&gt;, but with a &lt;em&gt;whole lot&lt;/em&gt; of added realism.  I'm trying to add as much realism as possible.  It is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are an entrepreneur in the stock market, having created your own hedge fund (correct term?).  Your company buys and sells shares in other companies, but also sells shares in itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the very end of the game, the money is redistributed: All the money you've earned* is split up amongst your shareholders.  Likewise, you gain money from the companies in which you've invested.  By selling shares in yourself, there is a trade-off between long- and short-term gains.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is a finite amount of each stock in the game, and there is one type of stock per company (so one per entrant).  Your bot will start out with &lt;code&gt;100&lt;/code&gt; shares of each other company, along with &lt;code&gt;100*N&lt;/code&gt; shares of itself, where &lt;code&gt;N&lt;/code&gt; is the number of entrants.  Each bot will have an initial bankroll of &lt;code&gt;10000 * N&lt;/code&gt;. (This helps to ensure a sufficiently large initial stock price).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Buying and Selling&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Buying and selling stock is done by placing buy and sell orders.  Each time a buy/sell order is placed, it is matched with the existing buy/sells orders to complete the trade.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is an example of how the orders are matched with each other for one stock:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; Before:&#xA;  Sell Orders:&#xA;   19 @ $20 - Bot A&#xA;   11 @ $21 - Bot B&#xA;  Buy Orders:&#xA;   06 @ $19 - Bot S #oldest is given preference &#xA;   06 @ $19 - Bot Q&#xA;   13 @ $18 - Bot T&#xA;   22 @ $16 - Bot R&#xA;&#xA; New Order:&#xA;  Sell 26 @ $17 - Bot C&#xA;  Trades [06 @ $19 - Bot S] with a surplus of 20&#xA;  Trades [06 @ $19 - Bot Q] with a surplus of 14&#xA;  Trades [13 @ $18 - Bot T] with a surplus of 01&#xA;  No more matches&#xA;&#xA; After:&#xA;  Sell Orders:&#xA;   01 @ $17 - Bot C #the remainder of the sell order&#xA;   19 @ $20 - Bot A&#xA;   11 @ $21 - Bot B&#xA;  Buy Orders:&#xA;   22 @ $16 - Bot R&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In this particular example, Bot C will manage to sell 26 shares for &lt;code&gt;12*19+13*18+1*17 = $479&lt;/code&gt;, assuming that someone will eventually buy that one remaining share.  The bot receives $462 at the end of his turn, and would receive the $17 at the end of the buyer's turn.  If the share is not bought in the time between one turn and the next, the bot would receive that remaining share back.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Tournament Setup&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The tournament will be composed of 10 games, with each game consisting of 365 trading rounds.  Each trading round will consist of one turn for each bot, with the bots in a randomized order.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is nothing special that happens between any particular round.  This helps to smooth out game flow so that each bot will have equal opportunity on their turn.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the end of each game, the money of each competitor is redistributed to its stock holders &lt;strong&gt;(how much of the money?)&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner of the tournament will be the bot with the highest average amount of money at the end of each game.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;A Single Turn&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For each stock, the bot will receive the buy and sell orders available.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the start of every bot's turn, that bot's previous unfulfilled sell/buy orders will be canceled.  &lt;strong&gt;(Is this a good idea?).&lt;/strong&gt;  Any unsold stock or unspent money is returned to the player.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then, the bot will output the list of buy/sell orders it would like to place.  The bot will be able to place one buy/sell order per stock.  The bot must be able to immediately set aside the shares/money to support the order.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The controller program will look through your sell and buy orders sequentially and will remove the assets from you that are required for the transaction.  If you have insufficient funds, that order will be ignored completely.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then, the orders will be processed.  Orders that match the already-existing orders will allow the transaction to occur after the bot's turn.  Orders that are unmatched will remain on the market until the start of the bot's next turn.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Recording the past&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your bot is allow to create 1 text file to maintain a history of stock prices.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input will consist of 3 arguments in this order:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Current round number, which is a number 1-365&#xA;Which stock ticker is for your company&#xA;A list of the data for each stock&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The data for the stocks will be formatted like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;[stock ticker #1],[quantity 1],[price 1],[quantity 2],[price 2] [stock ticker #2],[quantity 1],[price 1],[quantity 2],[price 2]&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Each quantity/price pair represents one buy or sell order.  Sell orders have positive quantity, while buy orders have negative quantity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The order of the stocks will be randomized, but the stock tickers will remain consistent for the whole game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I was also think of including some more data in here, what else might be needed?  Data on the assets of all the other competitors?)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Output will consist of many lines, each line formatted like so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[stock number 1-N] [action] [quantity] [price]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The stock number is a number 1-N representing which stock to buy or sell.  The action can be either &lt;code&gt;b&lt;/code&gt; for buy or &lt;code&gt;s&lt;/code&gt; for sell.  The quantity and price can be any positive integer.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Notes:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I want price to have 2 decimal digits, but I don't know if that would exclude anything or make it unnecessarily complicated.  Right now, the prices are limited to integers.  There is approximately $50 for each stock in the game, in an attempt to increase smoothness.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We need to balance the number of actions allowed per turn with the number of rounds in a game.  Right now, the player can make 1 order per stock in a single round, which may make the time flow too roughly.  The more rounds played, and the fewer actions allowed per turn, the smoother the game will be.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;*We need to determine exactly how the money is redistributed.  I initially had the idea that all the money will be redistributed equally to each stock, so a player who sells all the shares in himself keeps none of the money he earned in game and only gets the money from the other stocks.  I think it might make more sense to only distribute profits, but we would have to determine how much of the profits are redistributed to shareholders.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it a good idea to have orders cancel after a period of time?  Currently, a bot's orders are cancelled upon that bot's next turn.  If we reduce the number of moves per turn, then we would want to increase the longevity of the orders.  Alternatively, we could make orders permanent and irrevocable, only being cancelled at the end of the game.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.127" LastActivityDate="2014-08-14T19:36:35.080" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="2011" PostTypeId="2" ParentId="1846" CreationDate="2014-08-14T20:43:05.447" Score="14" Body="&lt;p&gt;I'm Grace Note, a Community Manager at Stack Exchange.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Originally, I was writing this answer explaining the mechanical issues with this idea. I won't bore with details, though, but in the long run, migration (and especially chain migration) is pretty messy and this would be a mess to implement.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Today we had a meeting to discuss something we'd been brewing on Area 51, &lt;a href=&quot;http://area51.stackexchange.com/proposals/72987/stack-overflow-academy&quot;&gt;Stack Overflow Academy&lt;/a&gt;. The specifics of implementation may have differed, but the goal of these was the same - you wanted a place that you could help provide guidance and sculpt posts with users, an environment that allowed you to have &quot;questions&quot; asked not for the purpose of getting answers, but for the purpose of building better questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://meta.stackoverflow.com/questions/268779/can-we-make-this-meta-site-work-for-the-questions-proposed-for-stack-overflow-ac&quot;&gt;We decided to close the proposal&lt;/a&gt;. Right now, over on Meta Stack Overflow, they're looking into ideas on how to make it work on the Meta itself. The fact is that the Meta really &lt;em&gt;should&lt;/em&gt; be a place to get help in constructing good questions when the basis is present, a place that we already suggest to people now and then across the network when it comes in as a support email. There are always challenges, though - for example this site itself has seen 14 threads for sandboxes which get tons of answers, which paints a very clean image of the problem of drafting/sandboxing overwhelming the rest of meta activity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The proposal here specifically for creating a subdomain, I will for now say that this is &lt;a href=&quot;/questions/tagged/status-declined&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-declined&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-declined&lt;/a&gt;. Not because the idea of something beyond Meta is bad, but that this particular implementation of it is, we feel, sub-par. Meta is itself an illustration of why this is - we as a network created Meta out of the tools we had at our disposal, to serve a purpose that we needed without the full instrumentation to do what that purpose itself would need. So while Meta is what one might call &quot;sufficient&quot; at the job, it's not the best. Going full guns to create an entire Q&amp;amp;A section for the purpose of sandboxing and mentoring in asking, I feel, is repeating this same mistake - it uses what we have on hand in a makeshift &quot;It works, that's what matters&quot; that ignores what it means to actually &lt;em&gt;work&lt;/em&gt;. That and personally it feels about as excessive as using a grenade to clean your sink - there's way so much overhead associated with a full Q&amp;amp;A that goes beyond what you need for this task. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is something that is a real problem across the network, and I feel that if we want to work on providing an in-house solution to this, we should want to create something solid and robust, that has the tools needed for the job and nothing more. We don't have this solution yet, we don't have a full plan. But it's something we'll be working on. Not &quot;in the future&quot;, not &quot;in the near future&quot;, this is something to be working on in the now. And while we work on it, Meta will have to remain the existing solution. We'll see what we can do, what things we can help make it work better on Meta. Some ideas include a new meta tag besides &lt;a href=&quot;/questions/tagged/discussion&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt; to identify these, as well as better forms of filtering. We're going to be happy to try out a lot of different things, but there'll be a solution. Be it something we integrate into the main site, be it something that adapts Meta to a better way, be it ultimately a separate section of the site, there'll be a solution.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I will give one idea, though, that might help this site while we work on something more mechanically integrated - on Mathematics, they use &lt;a href=&quot;https://math.meta.stackexchange.com/questions/4666/sandbox-for-drafts-of-long-complex-answers&quot;&gt;a single thread for sandboxing&lt;/a&gt;, one that has a fixed number of answers. Rather than letting people just keep posting, you can only draft while there's an open slot for you to take. If the draft is &quot;abandoned&quot;, it can be cycled out. This kind of strategy may help with some of the flaws that have been observed in the current sandbox strategy. Not all of them, but I hope it might be a useful direction to look at.&lt;/p&gt;&#xA;" OwnerUserId="2414" LastEditorUserId="-1" LastEditDate="2017-03-20T09:16:37.593" LastActivityDate="2014-08-14T20:48:05.460" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2012" PostTypeId="1" AcceptedAnswerId="2015" CreationDate="2014-08-14T22:15:22.343" Score="1" ViewCount="247" Body="&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt; Posted a similar question on &lt;a href=&quot;https://area51.meta.stackexchange.com/questions/17549/code-review-and-code-golf-kept-in-beta&quot;&gt;Area 51&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;It seems that there is only one part keeping us in beta: our lack of asked questions. Here's a screenshot of this (as of August 14th):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/7zMcA.png&quot; alt=&quot;screenshot of our site at Area 51&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I know this isn't really our culture, we prefer to have more thought-out questions than a simple Q&amp;amp;A question on our main site, but how we can get some more people to come up with their own challenges? That could probably alone get a &lt;em&gt;lot&lt;/em&gt; of progress in that direction.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And, by the way, I know of the similar question &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/928/14668&quot;&gt;here&lt;/a&gt;, but in the span of that 7 1/2 months, everything has increased except for the questions/day. The &quot;avid users&quot;, &quot;total users&quot;, and &quot;visits/day&quot; have increased about 30-50% in that time period. Questions/day decreased by about 1 per day.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It also appears that &lt;a href=&quot;http://codereview.stackexchange.com&quot;&gt;Code Review&lt;/a&gt; has a &lt;a href=&quot;http://area51.stackexchange.com/proposals/11464/code-review&quot;&gt;similar problem&lt;/a&gt; with their answer ratio (1.8, with everything else better than ours), because of their culture. They are the only one who's been in beta longer than us, and not by long.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;As a side note, at our current rate of growth, we would rival Ask Ubuntu in size by the time we would get that required number of questions (15) a day.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="14668" LastEditorUserId="-1" LastEditDate="2017-05-03T08:41:01.537" LastActivityDate="2014-08-15T01:21:26.507" Title="The one limiting stat for us still being in beta" Tags="|discussion|challenges|beta-status|" AnswerCount="4" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2013" PostTypeId="2" ParentId="2012" CreationDate="2014-08-14T22:34:30.730" Score="5" Body="&lt;p&gt;I think that the single biggest thing standing between us and a much higher number of questions is the lack of frameworks for automating scoring of challenges. Especially KOTH challenges, but also even simple code-golf challenges. People would be more willing to post challenges if there was less work involved in maintaining them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some people in &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;the chat room&lt;/a&gt; have discussed making such frameworks. More effort in that direction would help the site and community as a whole.&lt;/p&gt;&#xA;" OwnerUserId="4787" LastActivityDate="2014-08-14T22:34:30.730" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2014" PostTypeId="2" ParentId="2012" CreationDate="2014-08-14T22:43:08.437" Score="5" Body="&lt;p&gt;I don't necessarily think that being a bigger site (compared with your example of Ask Ubuntu) would give us more questions. We are already closing questions on a daily basis. Questions here are not problems that we needed an answer to, they are well thought out challenges that don't correspond to a practical need. This means that people who enjoy using this site don't necessarily have questions to ask (even if they really like the idea of asking questions). As we build up a larger base of previous questions it becomes harder for people to think up things which are not duplicates.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think what will make the biggest difference is having a discussion about where the gaps are. Where the areas are that are waiting to have questions asked. There is a lot of potential for duplication, which isn't bringing us anything new, but there will of course be plenty of good ideas in between that we simply haven't thought of yet. We could use some pointers to areas that need more questions. Perhaps a meta post where people can answer with one kind of question they'd like to see, and the votes will indicate which of those kinds of question are most in demand. People could even comment to say &quot;this is the kind of question I would place a bounty on&quot;.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2014-08-14T22:43:08.437" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2015" PostTypeId="2" ParentId="2012" CreationDate="2014-08-14T22:52:15.850" Score="12" Body="&lt;p&gt;&lt;em&gt;Although I am a mod, I am not speaking on behalf of anybody but myself in this post.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Community Team looks at a number of factors in deciding when and whether to graduate a beta site. The stats you see are one indication, but it's definitely not &quot;only one part keeping us in beta&quot;. Sites that are Excellent in all categories are not guaranteed a graduation, and there have been sites graduated that have one or more non-Excellent categories.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So let's &lt;strong&gt;not&lt;/strong&gt; talk about increasing question volume. That would be disastrous for this site, if we don't improve the question quality! Although I'm kind of a backseat mod these days, whenever I go to the front page, I often see challenges that are half-baked, that should have gone through the sandbox process first. &lt;strong&gt;My honest opinion is that until we address the quality issue, this site is simply not ready to graduate.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To that end, I'm tempted to use a new style of moderation where I nuke all the half-baked questions I see[1], even ones with answers attached already. :-P This is certainly a departure from the laissez-faire style of moderation that I prefer, but my feeling is that without a major disruption of that sort, this site may never be ready to graduate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Comments welcome. :-)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[1] I am not trying to go against the community consensus on what posts are or aren't acceptable, simply that we enforce it a little more...strictly. ;-)&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-08-14T22:52:15.850" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2016" PostTypeId="2" ParentId="1987" CreationDate="2014-08-15T00:58:51.223" Score="-1" Body="&lt;h1&gt;Slightly weighted random sorting&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This has in some form or another been suggested, but the weight was a little too inflexibly strong in all of them IMO. How about this algorithm (in Python pseudocode)?&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# an arbitrary constant signifying the weight given to either the votes&#xA;# (greater than 1), the time (0 &amp;lt; n &amp;lt; 1), or neither (1).&#xA;ratio_weight = 1&#xA;&#xA;# an arbitrary constant signifying the weight given to the statistics of&#xA;# each entry (greater than 1), the random element (0 &amp;lt; n &amp;lt; 1), or&#xA;# neither (1).&#xA;stats_weight = 1&#xA;&#xA;def order_list(entry_list):&#xA;  total_votes = reduce(entry_list, lambda x, y: x + y)&#xA;&#xA;  # this is the main weighting of the sorting. `entry` is a tuple in the&#xA;  # form of (answer_entry, random_index_to_use).&#xA;  def get_sorting_index(entry):&#xA;    e = entry[0]&#xA;    return entry[1] + stats_weight * (1 -&#xA;      (ratio_weight * (e.votes/e.time)) / total_votes)&#xA;&#xA;  # get a list of random indices to work with&#xA;  random_indices = list(range(len(entry_list)))&#xA;  random.shuffle(random_indices)&#xA;&#xA;  # get a zipped list with the random indices&#xA;  entry_list = zip(entry_list, random_indices)&#xA;&#xA;  # sort using the weighted, randomized entry indices&#xA;  entry_list.sort(key=lambda entry: get_sorting_index(entry))&#xA;  return [x[0] for x in entry_list] # strip random sorting index&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Please comment if you think something doesn't look quite right (either bug or proposal).&lt;/p&gt;&#xA;" OwnerUserId="14668" LastActivityDate="2014-08-15T00:58:51.223" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2017" PostTypeId="2" ParentId="2012" CreationDate="2014-08-15T01:21:26.507" Score="8" Body="&lt;p&gt;&lt;em&gt;insert message about not speaking in mod-voice here&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Okay, first of all, stats aren't everything. If the site didn't change except for 10 more halfhearted. mediocre questions, we wouldn't be a single step closer to graduation. In fact, having to deal with those low quality filler posts would even be a setback to the quality of the site as a whole.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But more importantly, we shouldn't be doing things so that we can graduate. We should do exactly what we would do if the site had already graduated. That is, work to improve the quality of the site, not to pass some arbitrary statistics. We're not going to graduate when a few numbers line up perfectly; we're going to graduate when we're &lt;em&gt;ready&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So don't even think about graduation when you visit the site. Think about making it &lt;em&gt;better&lt;/em&gt;. Not better as in arbitrary statistics, but better in the way you would if the site was already a full-fledged, graduated Stack Exchange site. That is what's going to be better for the site in the future.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-08-15T01:21:26.507" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2018" PostTypeId="2" ParentId="1987" CreationDate="2014-08-15T01:50:04.457" Score="-1" Body="&lt;h1&gt;Merge Active + Votes + Random Rankings using a Condorcet method&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I think each of these has its benefits, which can be merged.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Active sorting means that newer answers are more visible and given a chance to be viewed.  This helps to counteract the bias towards older answers.  It allows a sort of kick-start to new answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Votes sorting means that new users will see primarily see quality posts as opposed to downvoted posts.  We don't want to place too much faith in here, but we can't simply ignore it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Random sorting helps to scramble up the order.  It is blind to quality, which can be both a pro and a con.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This algorithm would take the three rankings and use them as the votes in a Condercet election.  There would be X copies of the active ranking, Y copies of the votes ranking, and Z copies of the random ranking (each copy is the same ordering).  The X, Y, and Z are the weights.  There are several Condercet-compliant methods to merge these, but something like &lt;a href=&quot;http://en.wikipedia.org/wiki/Ranked_pairs&quot; rel=&quot;nofollow&quot;&gt;Ranked Pairs&lt;/a&gt; could work decently.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The weightings are easy flexible, offering a continuum of options all the way to complete randomness.&lt;/li&gt;&#xA;&lt;li&gt;With the correct weights, the new posts with few votes are on the same footing as the old posts with many votes.&lt;/li&gt;&#xA;&lt;li&gt;This system favors the newer posts with many votes and is against the older posts with no votes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Cons:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Finding the correct weightings would be an empirical thing.&lt;/li&gt;&#xA;&lt;li&gt;The active ranking can be kinda chaotic sometimes when older posts are edited.  It can give bad posts a second chance at greatness after being fixed, but could motivate people to create pointless edits.  We could replace Active with Newest if this is a concern with little impact on the algorithm.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2014-08-15T01:50:04.457" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2019" PostTypeId="2" ParentId="1957" CreationDate="2014-08-15T02:01:56.313" Score="-4" Body="&lt;p&gt;I'll go on a case-by-case basis for this.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/33150/write-a-rectangular-program-that-outputs-the-number-of-times-it-was-rotated&quot;&gt;Write a Rectangular Program that Outputs the Number of Times it was Rotated&lt;/a&gt; - This should be tagged as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;. It counts minimum, with the added restriction of being a rectangle.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/35372/make-a-code-square-with-your-favorite-word&quot;&gt;Make a code square with your favorite word&lt;/a&gt; - This should be tagged as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;. It counts the minimum area, with the added restriction of being a square.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/35656/program-your-favorite-phrase&quot;&gt;Program your favorite phrase&lt;/a&gt; - This should be tagged as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. It only counts characters.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/35974/code-that-runs-the-game-of-life-on-itself&quot;&gt;Code that runs the Game of Life on itself&lt;/a&gt; - This should remain as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game-of-life&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game-of-life&amp;#39;&quot; rel=&quot;tag&quot;&gt;game-of-life&lt;/a&gt;. It counts minimum characters, but entries have to be in a specific format, and they are supposed to implement the Game of Life on the Game of Life itself. The rules themselves are a little confusing, though.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="14668" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-08-15T02:01:56.313" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2020" PostTypeId="1" CreationDate="2014-08-15T07:13:47.020" Score="15" ViewCount="247" Body="&lt;p&gt;This question is somewhat in response to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2012/the-one-limiting-stat-for-us-still-being-in-beta&quot;&gt;The one limiting stat for us still being in beta&lt;/a&gt; where the consensus seemed to be that question quality was the main issue. I definitely agree.&lt;/p&gt;&#xA;&lt;p&gt;I believe that the biggest culprits for badly asked questions are:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;People that ask generic programming questions, usually better suited for Stack Overflow.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;These are not intrinsically bad and are usually migrated, but it would be better if they didn't clutter up our home page.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;People that ask about for explanations about a specific piece of obfuscated code they've seen.&lt;/li&gt;&#xA;&lt;li&gt;People that post their personal programming needs (usually for homework).&lt;/li&gt;&#xA;&lt;li&gt;People that attempt to post on-topic questions but fail because their question...&#xA;&lt;ul&gt;&#xA;&lt;li&gt;has ambiguous tagging or an unclear spec (too broad, too specific, or just badly written)&lt;/li&gt;&#xA;&lt;li&gt;doesn't have an objective scoring criteria&lt;/li&gt;&#xA;&lt;li&gt;is badly formatted&lt;/li&gt;&#xA;&lt;li&gt;is a duplicate&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;In nearly all cases these questions come from new users. Group 4 is biggest and most desirable demographic, but since we are so eager to close questions I expect many of the users are scared away.&lt;/p&gt;&#xA;&lt;p&gt;I believe the major problem with bad questions lies in the fact that &lt;strong&gt;there is no accessible guide for how to write a good question&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;There is of course the &lt;a href=&quot;https://codegolf.stackexchange.com/help&quot;&gt;help center&lt;/a&gt;, but most of the information here is just about the Stack Exchange model, much of which (like &lt;a href=&quot;https://codegolf.stackexchange.com/help/how-to-answer&quot;&gt;how to answer&lt;/a&gt;) is not optimized for PPCG since it is not a trivia/discussion site like most SE's. But that's a broader issue than I want to approach here.&lt;/p&gt;&#xA;&lt;p&gt;My main concern is with the first two help center questions:&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;https://codegolf.stackexchange.com/help/on-topic&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/help/dont-ask&quot;&gt;https://codegolf.stackexchange.com/help/dont-ask&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Reading them it is not at all clear what defines a proper PPCG question. The common stumbling blocks above are barely mentioned.&lt;/p&gt;&#xA;&lt;p&gt;(I know there is also the &lt;a href=&quot;https://codegolf.stackexchange.com/tour&quot;&gt;tour&lt;/a&gt; page but unless it can be vastly reformatted it is just a cute nothing about the SE model, not PPCG. I also know there's a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1511/template-for-challenges&quot;&gt;question template&lt;/a&gt; meta-post but unless directed, new users will never find it.)&lt;/p&gt;&#xA;&lt;p&gt;If possible, I would suggest having &lt;strong&gt;one single short page&lt;/strong&gt; that explains the most common types of questions that are asked and precisely how to ask them, and what not to ask. Ideally this page would be linked from the Ask Question page as &lt;a href=&quot;https://codegolf.stackexchange.com/help/how-to-ask&quot;&gt;&lt;strong&gt;How to ask a good question&lt;/strong&gt;&lt;/a&gt;. I don't know how much of the SE boilerplate formatting we can change but I do know what I would write for such a page:&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;How to ask a good question&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;Programming Puzzles &amp;amp; Code Golf (PPCG)&lt;/a&gt; is not like most other &lt;a href=&quot;http://stackexchange.com/sites&quot;&gt;Stack Exchange&lt;/a&gt; sites. Questions here are &lt;strong&gt;not&lt;/strong&gt; about programming trivia, or advice, or discussion based issues. Questions are programming &lt;strong&gt;challenges&lt;/strong&gt; that users compete in, with definite winners and losers. (The primary exception are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions, which are generally uncommon.)&lt;/p&gt;&#xA;&lt;p&gt;What &lt;strong&gt;NOT&lt;/strong&gt; to do in a good question:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do not post general programming questions. That's what &lt;a href=&quot;https://stackoverflow.com/&quot;&gt;Stack Overflow&lt;/a&gt; is for.&lt;/li&gt;&#xA;&lt;li&gt;Do not post questions asking how some specific piece of obfuscated code works. We are not here to analyze code.&lt;/li&gt;&#xA;&lt;li&gt;Do not post schoolwork or personal coding problems. We are not here to do your homework or help build your app.&lt;/li&gt;&#xA;&lt;li&gt;Do not post challenges restricted to one programming language without very good reason. (Not knowing &lt;a href=&quot;http://www.golfscript.com/golfscript/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Golfscript&lt;/a&gt; is &lt;em&gt;not&lt;/em&gt; a good reason to exclude it. Writing a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; framework in C++ is a good reason to only allow C++ submissions.)&lt;/li&gt;&#xA;&lt;li&gt;Do not post duplicate or near-duplicate questions. If your challenge involves something that already exists in the world of programming or math, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/search?q=&quot;&gt;chances are it has already been asked&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;What &lt;strong&gt;TO DO&lt;/strong&gt; in a good question:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Always have an objective scoring criterion.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Almost always tag it with exactly one of the following:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; - The submission with the fewest characters wins.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; - The highest voted submission wins.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; - Submissions interactively compete with one another towards a defined goal.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; - Challenges that don't fit into the categories above and have custom scoring criteria.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Explain the challenge in well-written, well-formatted, plain English. Do not assume anyone is knowledgeable in the topics involved beforehand. Give explanations, not links to explanations.&lt;/li&gt;&#xA;&lt;li&gt;Give explicit rules that define what makes an answer valid or not. Be sure to consider corner cases and trivial answers and loopholes. Be sure to specify how input and output are handled. Giving examples and test cases is highly encouraged.&lt;/li&gt;&#xA;&lt;li&gt;Make sure your question has enough constraints to keep it interesting and nontrivial. Consider how you would write a solution and convince yourself that the problem has genuine difficulty.&lt;/li&gt;&#xA;&lt;li&gt;Be responsive to the suggestions and concerns about your question from other users. If you are uncertain that your question will be well received, ask it in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1847/proposed-question-sandbox-mark-xiv?cb=1&quot;&gt;sandbox&lt;/a&gt; first.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Most importantly&lt;/strong&gt;, try to think of programming challenges that are new and fun. People like simple, novel ideas that they haven't seen before. A closed question with the seed of a novel idea can almost always be reopened.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;What do you all think? It's not a foolproof method for better questions (and it could be written friendlier) but it seems like the obvious thing to have on a site like this. Feel free to suggest edits.&lt;/p&gt;&#xA;&lt;p&gt;A similar but probably less crucial &lt;strong&gt;How to answer&lt;/strong&gt; page would also be helpful.&lt;/p&gt;&#xA;&lt;p&gt;Thanks for letting me rant (in my way). I'm still trying not to be here :P&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="38734" LastEditDate="2024-01-29T12:42:54.740" LastActivityDate="2024-01-29T12:42:54.740" Title="A Better Help Center" Tags="|discussion|feature-request|challenge-quality|help-center|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2021" PostTypeId="1" AcceptedAnswerId="13209" CreationDate="2014-08-15T07:55:53.350" Score="4" ViewCount="257" Body="&lt;h1&gt;TL;DR&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'm trying to figure out what license is best to use with a proposed CodeGolf.SE sandbox viewer. Please read the whole question/proposal before answering.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Main Question&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;What would be the best license for a proposed sandbox viewer? I would maintain it as an open-source project, and I wanted to know of the best license to use for it.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Disclaimer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Before everyone who disagrees goes on a rant, read this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If you want it to, this will keep track of the sandbox length and create a new one if it gets above a certain length.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It can't mark new sandboxes as featured unless someone with adequate permissions either enables support or does it manually.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Using this web app will be optional: the questions can still be proposed/commented/answered as normal on Meta.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Features/Details&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Completely from the site&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A single-page HTML/CSS/JS application, runnable from anywhere, even locally.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Allows for viewing, asking, commenting, or (on some) answering proposed questions.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Uses a hard-coded sandbox question on the Meta site to hold all its data&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Presents it in a more convenient fashion than the question itself&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Data is also human readable in questions&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Require Stack Exchange's OpenID login to propose/edit/comment on questions&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Allows embedding potential answers or answer-like comments in the questions themselves given permission by the proposed question's asker.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Makes it a community wiki to enable this&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Reads the history to get the user's comment&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Comments to the proposed question go in comments section&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Comments to proposed answers/answer-like comments would go under the answer itself&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Proposed questions are created as answers to the Meta sandbox&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When ready, a user is prompted for any changes, then a new question is created on the main site&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Old is automatically changed to a link to the question, clearly marked as posted and with all extra content removed&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Nits&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;It would embed a tiny bit of metadata via HTML comments in the body to tell if some question is already posted on the main site (falls back on a regex) so it can hide the question.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Pieces of it may be turned into code challenges (many JS-specific) here on the main site, with licensing restrictions to override the stock CC-BY-SA license, and then used in developing the app.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Extras&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If there are any features you want/don't want, please let me know.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would be the maintainer of this project (working on beginnings now), but I know I will get some help from the community in developing this application. So, I'm looking to you all for input on what license to use for it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, I (or another contributor) will make a PSA when it is ready for testing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This idea came up in chat as a potential solution to the sandbox problem.&lt;/p&gt;&#xA;" OwnerUserId="14668" LastEditorUserId="14668" LastEditDate="2014-08-24T23:32:10.357" LastActivityDate="2017-07-06T04:07:03.140" Title="RFC: License for a prospective sandbox viewer" Tags="|discussion|sandbox|user-interface|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2022" PostTypeId="2" ParentId="2020" CreationDate="2014-08-15T09:37:36.637" Score="5" Body="&lt;p&gt;This is more a collection of comments, but too many to actually put them in comments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I definitely think we need something like this, but we also need to make a link to such a site &lt;em&gt;very&lt;/em&gt; prominent to new users.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A few details I want to address though:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Asking for golfing advice is &lt;em&gt;not&lt;/em&gt; off-topic.&lt;/strong&gt; I know a lot of people would like it to be, and I'm starting to have mixed feelings about it myself. But &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1724/8478&quot;&gt;we voted on this&lt;/a&gt; so I'd prefer if people put their personal preferences aside and accepted the apparent community consensus. I guess it might help if we clearly outlined what these kinds of question have to be like, though. I usually picture them as micro-optimisation questions that don't solve a full problem but rather ask for the shortest possible way to golf down a component that crops up often in other problems (and this may well be language-specific). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Analysing obfuscated code can also be redirected to Stack Overflow.&lt;/strong&gt; Not much to say about this... I think if the OP shows that he did his own research but can't puzzle out a few of the trickier details, this seems very on-topic for SO (and I've seen it there before).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;We have an official list of challenge-type tags.&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/908/8478&quot;&gt;Right here.&lt;/a&gt; I'd recommend pointing to it, because there are a lot more than you mentioned and at least &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; seems as important as the others.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And finally, yes I think it could be made to sound slightly less daunting to new users. ;)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2014-08-15T09:37:36.637" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2023" PostTypeId="1" CreationDate="2014-08-15T16:18:55.757" Score="9" ViewCount="181" Body="&lt;p&gt;I feel like one of the main difficulties of having a massive sandbox is the difficulty of seeing all of the posts in the sandbox.  There are 63 answers in the XIV sandbox and 66 in the XII sandbox, and I'm pretty sure I've never actually seen most of those submissions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To increase the visibility of all of the sandbox posts, I think the body of the sandbox question could provide a list of all of the active sandbox submissions.  When people casually open the sandbox, they might see something that catches their eye.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When a person adds a sandbox answer, they add a link to their answer to the directory.  When a challenge is posted, the user moves the link to the list of completed answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is basically what I envision it looking like:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Active Works-In-Progress&lt;/strong&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;a href=&quot;http://www.example.com/&quot; rel=&quot;nofollow&quot;&gt;Draw square numbers in the shape of circles&lt;/a&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;a href=&quot;http://www.example.com/&quot; rel=&quot;nofollow&quot;&gt;1000 blank white cards KotH tournament&lt;/a&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;a href=&quot;http://www.example.com/&quot; rel=&quot;nofollow&quot;&gt;Compute Graham's Number in Manufactoria&lt;/a&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;Posted Challenges&lt;/strong&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;a href=&quot;http://www.example.com/&quot; rel=&quot;nofollow&quot;&gt;3D render your program's source code&lt;/a&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;a href=&quot;http://www.example.com/&quot; rel=&quot;nofollow&quot;&gt;Potato Farming KOTH&lt;/a&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Slight side note: I am using the [ ] ( )  form the links.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; - [Title of Answer](URL to answer)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The use of the question as a directory has the advantage of recording the history of sandbox use, so that everyone can see exactly what posts are contained in the sandbox and where they are in development.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It would be convenient if there were a way to automate this.  For now, I think this is something that the community is capable of maintaining, similar to how people already edit their sandbox posts to denote a posted challenge.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2014-08-15T17:52:15.693" Title="Could the body of the Sandbox question serve as a directory to all of the answers?" Tags="|discussion|sandbox|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2025" PostTypeId="2" ParentId="2023" CreationDate="2014-08-15T17:47:13.753" Score="4" Body="&lt;p&gt;Okay, I have taken the liberty of compiling a directory to all of the active submissions in Sandbox XIV.  I have not included posted/deleted answers, and I have not categorized them at all.  This should help reduce the workload needed to update the sandbox if we decide to do this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox XIV Active Posts&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2024/2867&quot;&gt;Code with largest MD5 hash of output&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2008/2867&quot;&gt;Pecking Birds - input wanted&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2010/2867&quot;&gt;Realistic Stock Market&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2009/2867&quot;&gt;Tetromino Game&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1965/2867&quot;&gt;Transport Tycoon [under construction]&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2007/2867&quot;&gt;Five Miscellaneous Question Ideas&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2001/2867&quot;&gt;Self-Enumerating Pangram&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1995/2867&quot;&gt;Cross language mania&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1982/2867&quot;&gt;Conspiracy theory: find fuzzy anagrams&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1981/2867&quot;&gt;Chess: End Game KOTH&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1925/2867&quot;&gt;Epic Customizable Tank Battle (Work-In-Progress)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1964/2867&quot;&gt;Teach me to play clarinet&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1958/2867&quot;&gt;Morse Decode Golf&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1963/2867&quot;&gt;Hexiled (Clone) King of the Hill/Code Challenge&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1954/2867&quot;&gt;Diplomacy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1945/2867&quot;&gt;Balanced Ternary Converter&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1943/2867&quot;&gt;Tennis Tournament (Incomplete)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1937/2867&quot;&gt;The Painter's Predicament&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1942/2867&quot;&gt;Paired Programming: Down Periscope!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1938/2867&quot;&gt;Multiplayer Game of Life (GOL)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1904/2867&quot;&gt;Underwater Survival Game&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1882/2867&quot;&gt;Dining Philosophers (Incomplete)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1928/2867&quot;&gt;Implement nl&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1923/2867&quot;&gt;Traders&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1932/2867&quot;&gt;The Symbols vs. The Letters&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1931/2867&quot;&gt;Find a multiple of 42 that is spelled with all of the characters that make up the word &quot;forty-two&quot;.&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1926/2867&quot;&gt;Program calculating its own length&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1901/2867&quot;&gt;Display a Magic Square&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1924/2867&quot;&gt;Generate a random work of art&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1903/2867&quot;&gt;Domino Circuits&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1921/2867&quot;&gt;Comment Driven Stats for Stack Exchange Questions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1893/2867&quot;&gt;Morra, the Noble Game of Kings&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1891/2867&quot;&gt;Global Warming&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1871/2867&quot;&gt;El Farol Jail : The Game Of Happyness&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1897/2867&quot;&gt;Your love you want to show 'em, generate them a poem.&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1857/2867&quot;&gt;Shuffle the system word list...repairably&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1902/2867&quot;&gt;Play Wythoff's Nim Perfectly&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1881/2867&quot;&gt;Brainfuck compression&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1884/2867&quot;&gt;Find the mines!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1879/2867&quot;&gt;Reindent Java/C/C++/etc. code&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1880/2867&quot;&gt;Find the Greatest Common Divisor of two numbers, with no math operators or calls to math libraries.&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1870/2867&quot;&gt;Yet Another Pi Question&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1863/2867&quot;&gt;ASCII: Art or Math(s)?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1849/2867&quot;&gt;Type me out.&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2014-08-15T17:52:15.693" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2028" PostTypeId="1" CreationDate="2014-08-16T20:01:36.497" Score="60" ViewCount="17391" Body="&lt;p&gt;Often, answers to questions asking for &quot;programs&quot; or talking about &quot;programming languages&quot; utilize things like &lt;code&gt;sed&lt;/code&gt;, &lt;code&gt;awk&lt;/code&gt;, … in order to get around having to write an actual shell script.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, a question comes to my mind:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What qualifies as a programming language?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Sure, ultimately the OP can define this themselves. But what is a reasonable understanding of a &quot;default&quot; in case the question does not clarify this (and how should it be clarified)?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do coreutils count as &quot;languages&quot; and if so, how to handle different sets of coreutils on different systems?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To give a concrete example for a &lt;em&gt;questionable&lt;/em&gt; usage of the term programming language, see &lt;a href=&quot;https://codegolf.stackexchange.com/a/36292/26765&quot;&gt;my answer here&lt;/a&gt;. It uses a &lt;code&gt;rot13&lt;/code&gt; binary as the interpreter. In case this is invalid, but &quot;coreutils&quot; are valid, how can we define the difference?&lt;/p&gt;&#xA;" OwnerUserId="26765" LastEditorUserId="56656" LastEditDate="2019-09-22T03:46:11.553" LastActivityDate="2019-09-22T03:46:11.553" Title="What are programming languages?" Tags="|discussion|policy|" AnswerCount="6" CommentCount="18" ClosedDate="2020-12-04T14:08:29.063" ContentLicense="CC BY-SA 3.0" />
  <row Id="2029" PostTypeId="2" ParentId="2028" CreationDate="2014-08-17T05:05:54.413" Score="3" Body="&lt;p&gt;Clearly a general purpose programming language -&lt;br&gt;&#xA;Turing equivalence is sufficient to decide it's a programming language, whether well-defined (C, Python, Haskell, etc.) or ad-hoc (e.g., bash + Linux utilities, PowerShell + Windows utilities, etc.).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Useful exceptions -&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;SQL&lt;/li&gt;&#xA;&lt;li&gt;state machine languages, including all flavors of regex without code injection&lt;/li&gt;&#xA;&lt;li&gt;Until I read the Wikipedia article on Turing completeness, I'd never heard of useful &lt;em&gt;almost&lt;/em&gt; Turing-complete programming languages before. I, and I think most people reading PP&amp;amp;CG, would accept something like &lt;a href=&quot;http://en.wikipedia.org/wiki/Charity_(programming_language)&quot; rel=&quot;nofollow&quot;&gt;Charity&lt;/a&gt; as a programming language.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Clearly not a general purpose programming language -&lt;br&gt;&#xA;No ability to construct a branch and/or a loop control structure. This definition is woefully incomplete, since the breadth of state manipulation is also an issue.&lt;/p&gt;&#xA;" OwnerUserId="20538" LastEditorUserId="20538" LastEditDate="2014-08-17T15:15:11.900" LastActivityDate="2014-08-17T15:15:11.900" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="2030" PostTypeId="2" ParentId="2028" CreationDate="2014-08-17T14:00:30.963" Score="9" Body="&lt;p&gt;There may be some grey areas (regexes having been mentioned), but none of the cases explicitly named in the question falls into one.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Definitely languages&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;sed&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Wikipedia says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;sed (stream editor) is a Unix utility that parses and transforms text, using a simple, compact programming language.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It has commands and is Turing-complete.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;awk&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Wikipedia says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;AWK is an interpreted programming language designed for text processing and typically used as a data extraction and reporting tool.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It has variables, types, control flow... There is a book called &lt;a href=&quot;http://cm.bell-labs.com/cm/cs/awkbook/&quot; rel=&quot;nofollow&quot;&gt;The AWK Programming Language&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Definitely not a language&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;rot13&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Forget Turing-completeness (equivalent to mu-recursive functions): rot13 doesn't even allow you to implement primitive-recursive functions. In fact, it doesn't allow you to implement anything: it implements a single bijective function (or, at best, 26 closely related bijective functions), and the only thing you can do is choose the input to that function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(NB although you didn't mention it, I've seen it in some &quot;answers&quot;, so: &lt;strong&gt;cat&lt;/strong&gt; falls in this category as well for the same reasons as rot13. And since I've just seen a comment in which you suggest claiming it as a language, &lt;strong&gt;date&lt;/strong&gt; is definitely not either).&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="194" LastEditDate="2014-08-17T19:11:02.370" LastActivityDate="2014-08-17T19:11:02.370" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2031" PostTypeId="2" ParentId="1324" CreationDate="2014-08-17T17:53:59.167" Score="6" Body="&lt;h1&gt;Universally testable answers&lt;/h1&gt;&#xA;&lt;p&gt;An answer will be considered to be universally testable if:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It is written in a programming language which has a compiler/interpreter available on Windows, Linux &amp;amp; Mac where said compiler/interpreter can be downloaded from the web free of charge (not including free trials) and does not require sign up/registration.&lt;/li&gt;&#xA;&lt;li&gt;or it is written in a programming language that has an online compiler/interpreter such as &lt;a href=&quot;http://ideone.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://ideone.com/&lt;/a&gt;, which is available free of charge and does not require sign up/registration, where the answer may be fully tested within the online compiler/interpreter i.e. doesn't need access to local resources.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Additionally, if the behaviour of the answer is different on different platforms/architectures, it should still meet the question criteria on all platforms/architectures.&lt;/p&gt;&#xA;" OwnerUserId="21713" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-08-17T17:53:59.167" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="2032" PostTypeId="2" ParentId="2028" CreationDate="2014-08-17T22:58:10.930" Score="7" Body="&lt;p&gt;Yes, awk(1) and bc(1) and dc(1) are all programming languages. One can do &lt;a href=&quot;http://rosettacode.org/wiki/Factorial#AWK&quot; rel=&quot;nofollow noreferrer&quot;&gt;factorial in AWK&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yes, sed(1) is a programming language. I solved &lt;a href=&quot;https://codegolf.stackexchange.com/a/27027/4065&quot;&gt;&quot;Bring out the inner llama of a sentence&quot; in sed&lt;/a&gt;. My program is too long to win code golf, because sed has no numeric operations, but it does answer the question. Programs in sed can do input and output, and make conditional jumps. I made a while loop, starting with the label &lt;code&gt;:w&lt;/code&gt; and ending with the conditional jump &lt;code&gt;/[%z]/bw&lt;/code&gt;, which branches to &lt;code&gt;w&lt;/code&gt; if the line contains any &lt;code&gt;%&lt;/code&gt; or &lt;code&gt;z&lt;/code&gt; characters. With input and output and conditional jumps, one can write programs in sed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;No, ed(1) is not a programming language. I believe this because I never learned how to do conditional jumps in ed; it has no labels or branches. People can write scripts in ed, and ed can do some conditional logic, so perhaps one can disagree and claim that yes, ed is a programming language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;No, most other shell utilities are not programming languages. Commands like &lt;code&gt;ls&lt;/code&gt; or &lt;code&gt;sort&lt;/code&gt; or &lt;code&gt;rot13&lt;/code&gt; are not programming languages by themselves. If the question is rot13, I can't use &lt;code&gt;rot13&lt;/code&gt;, because &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1078/4065&quot;&gt;I must not use a library function, or command, to do all the work&lt;/a&gt;. I can answer &lt;code&gt;tr A-Za-z N-ZA-Mn-za-m&lt;/code&gt; and count it as a shell script, 22 characters. As &lt;code&gt;tr&lt;/code&gt; is no programming language, I must count the call to &lt;code&gt;tr&lt;/code&gt; as part of my program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answers need not be portable. It is fine to write a shell script that works with GNU coreutils, but fails with BSD or Solaris. This is no worse than a PowerShell answer that only works with Windows! One platform is enough.&lt;/p&gt;&#xA;" OwnerUserId="4065" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2014-08-17T22:58:10.930" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2034" PostTypeId="1" CreationDate="2014-08-18T09:30:47.723" Score="2" ViewCount="67" Body="&lt;p&gt;I currently have a few ideas for questions involving kolmogorov complexity, mostly how to output song lyrics in the shortest method (example: Diggy Diggy Hole by the Yogscast, &lt;a href=&quot;http://yogscast.wikia.com/wiki/Diggy_Diggy_Hole_(Song)&quot; rel=&quot;nofollow&quot;&gt;http://yogscast.wikia.com/wiki/Diggy_Diggy_Hole_(Song)&lt;/a&gt;, mainly because I've had it stuck in my head since the day of release), But I've got the feeling that questions that are purely KGC, with no other limitations, are, wel, not complex enough.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Am I right in feeling that these questions would be somewhat bland? I'm thinking that a possible option might be that the program should follow the rythm of a part of the song, or that you cannot use any characters from the artist's name and 2 key words to the song (in this case Yogscast, Dwarves and Goblins).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or is there not really a way to save such simple kolmogorov complexity questions?&lt;/p&gt;&#xA;" OwnerUserId="14141" LastActivityDate="2014-08-18T09:30:47.723" Title="are pure kolmogorov complexity questions appropriate?" Tags="|discussion|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2035" PostTypeId="1" AcceptedAnswerId="2036" CreationDate="2014-08-18T11:22:00.220" Score="14" ViewCount="495" Body="&lt;p&gt;Suppose I write a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question. How long should I wait before accepting the shortest answer? One week? Two days? More? I checked the FAQ, but couldn't find any information on this topic. Is there a general rule or is it just when the question asker feels like it?&lt;/p&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="68942" LastEditDate="2021-04-04T03:46:21.370" LastActivityDate="2021-04-04T03:46:21.370" Title="How long should I wait before accepting an answer?" Tags="|discussion|faq|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2036" PostTypeId="2" ParentId="2035" CreationDate="2014-08-18T11:24:15.440" Score="15" Body="&lt;p&gt;The way I run my own golfing challenges is to accept the shortest one at any given time (and reassign the accepted answer should a better one come in). Yes, it's more work because you have to monitor for new answers, but I think that's the best way to encourage people to keep finding better solutions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's best to wait a week before accepting for the first time, though.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-08-18T11:24:15.440" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="2037" PostTypeId="2" ParentId="2140" CreationDate="2014-08-18T12:14:57.573" Score="0" Body="&lt;h2&gt;Jenga code&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I think everyone knows what &lt;a href=&quot;http://en.wikipedia.org/wiki/Jenga&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jenga&lt;/a&gt; is. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;As per Wikipedia:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Jenga is a game of physical and mental skill [...] During the game, players take turns removing one block at a time from a tower constructed of 54 blocks. Each block removed is then balanced on top of the tower, creating a progressively taller but less stable structure.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/WhWnb.jpg&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program that behaves as a Jenga tower. Every time a randomly chosen piece of code is removed and placed at the bottom of your program, the code should re-run. Goal is to achieve the tallest running code tower.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The starting tower (or source code) must be of exactly 15 lines of code. Such lines must be divisible by 3 forming a &lt;code&gt;15x3n&lt;/code&gt; grid composed by 15 lines of &lt;code&gt;1xn&lt;/code&gt; bricks.&lt;/li&gt;&#xA;&lt;li&gt;A brick is removed randomly from the code and placed at the bottom from left to right until the &lt;code&gt;3n&lt;/code&gt; block line is complete. The process goes on at the bottom of the new formed line.&lt;/li&gt;&#xA;&lt;li&gt;If a brick has strictly more consecutive whitespaces than any consecutive characters in it its considered broken and fails to sustain the tower.&lt;/li&gt;&#xA;&lt;li&gt;A brick must always be present for each row (2 holes and 1 brick), but its position in the row is not important.&lt;/li&gt;&#xA;&lt;li&gt;A tower is tall 20 lines if the 20th line tower runs with no errors.&lt;/li&gt;&#xA;&lt;li&gt;A brick cannot start nor end with comment start or end tags of your chosen language (e.g &lt;code&gt;/*&lt;/code&gt; or &lt;code&gt;//&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each tower must output its own height.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring system&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your score is simply the avarage tower height for your program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;SCORE = (MAX TOWER + MIN TOWER) / 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;MIN TOWER&lt;/code&gt; refers to the minimun non-running tower while &lt;code&gt;MAX TOWER&lt;/code&gt; refers to the maximum running tower.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(It would be nice if in the answer both towers are shown)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Proposed tag: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="25024" LastEditorUserId="25024" LastEditDate="2014-08-18T13:52:16.070" LastActivityDate="2014-08-18T13:52:16.070" CommentCount="20" ContentLicense="CC BY-SA 3.0" />
  <row Id="2038" PostTypeId="1" AcceptedAnswerId="2039" CreationDate="2014-08-18T14:04:25.783" Score="1" ViewCount="117" Body="&lt;p&gt;How are there people like &lt;a href=&quot;https://codegolf.stackexchange.com/users/15436/michael-koper&quot;&gt;Michael Koper&lt;/a&gt; who have never answered a question or asked a question, yet still have 101 reputation?&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-08-18T14:16:20.823" Title="101 Reputation Users" Tags="|discussion|" AnswerCount="1" CommentCount="4" ClosedDate="2014-08-19T06:54:09.903" ContentLicense="CC BY-SA 3.0" />
  <row Id="2039" PostTypeId="2" ParentId="2038" CreationDate="2014-08-18T14:16:20.823" Score="5" Body="&lt;p&gt;If you have 200 reputation on any Stack Exchange site, and you create an account on another Stack Exchange site, you get a bonus of 100 reputation. This is called a &lt;strong&gt;&lt;a href=&quot;https://stackoverflow.com/help/whats-reputation&quot;&gt;site association bonus&lt;/a&gt;&lt;/strong&gt;. It is awarded a maximum of one time per site.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2014-08-18T14:16:20.823" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2040" PostTypeId="1" CreationDate="2014-08-18T14:22:32.633" Score="7" ViewCount="204" Body="&lt;p&gt;There are a lot of interesting ideas out there, in the form of existing games.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is also a strict rule that anything posted on SE must be &lt;a href=&quot;http://creativecommons.org/licenses/by-sa/3.0/&quot; rel=&quot;nofollow&quot;&gt;licensed under cc by-sa 3.0 with attribution required&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Where is the line between &lt;strong&gt;unacceptable&lt;/strong&gt; posting of someone else's copyrighted game idea as a question, and &lt;strong&gt;acceptable&lt;/strong&gt; use of a copyrighted game as an inspiration? &lt;em&gt;Separating your key ideas into short, separate answers will allow the votes to show community consensus.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Discussion in chat occasionally turns towards  existing board games or computer games that might make a good code golf or king of the hill contest, and I'd like to see some clear guidance on what we need to bear in mind.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2014-08-18T14:51:43.850" Title="Contests/questions based on external games" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2041" PostTypeId="2" ParentId="2040" CreationDate="2014-08-18T14:31:11.437" Score="7" Body="&lt;p&gt;&lt;a href=&quot;https://gamedev.stackexchange.com/a/11764/19876&quot;&gt;According to this GameDev.SE post&lt;/a&gt; gameplay is not copyrightable. Hence, any game mechanic can be turned into a challenge. The legal issues which you need to worry about are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The &lt;em&gt;textual expression&lt;/em&gt; of the rules does qualify for copyright protection, so you should explain them in your own words.&lt;/li&gt;&#xA;&lt;li&gt;Don't reuse any assets (which is unlikely on PPCG anyway)&lt;/li&gt;&#xA;&lt;li&gt;Maybe refrain from using trademarked names, like specific Pokémons.&lt;/li&gt;&#xA;&lt;li&gt;In some cases the game mechanics may be patented.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Further sources:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.copyright.gov/fls/fl108.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;U.S. Copyright Office&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.nytimes.com/2012/03/12/technology/for-creators-of-video-games-a-faint-line-on-cloning.html?_r=2&amp;amp;pagewanted=all&amp;amp;&quot; rel=&quot;nofollow noreferrer&quot;&gt;Article on NYTimes.com&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:18:44.563" LastActivityDate="2014-08-18T14:51:43.850" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2042" PostTypeId="2" ParentId="2140" CreationDate="2014-08-18T21:14:35.887" Score="3" Body="&lt;h1&gt;Check GenericScript source code for compiler errors&lt;/h1&gt;&#xA;&lt;p&gt;Given the source code for a GenericScript program as input, parse the source code to check that it conforms to the syntax rules for the language. The syntax definition for GenericScript is below. If a part of the source code is found to be invalid, the program should output &amp;quot;Invalid syntax&amp;quot;, otherwise it should output &amp;quot;Valid syntax&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Win Criteria&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is code golf. Shortest code wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Syntax&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Source code will be considered to be valid if it matches the rule for &amp;quot;Program&amp;quot; below.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Program             = Sequence&#xA;Sequence            = Statement [Sequence]&#xA;Statement           = SequenceBlock | Assignment | If | While | Output&#xA;SequenceBlock       = &amp;quot;{&amp;quot; Sequence &amp;quot;}&amp;quot;&#xA;Assignment          = Identifier &amp;quot;=&amp;quot; (String | Bool); &#xA;If                  = &amp;quot;if(&amp;quot; Bool &amp;quot;)&amp;quot; Statement [&amp;quot;else&amp;quot; Statement]&#xA;While               = &amp;quot;while(&amp;quot; Bool &amp;quot;)&amp;quot; Statement&#xA;Output              = &amp;quot;print(&amp;quot; String &amp;quot;);&amp;quot;&#xA;Identifier          = {Any sequence of alphanumeric characters prefixed with &amp;quot;var&amp;quot; }&#xA;Bool                = StringEquals | Identifier&#xA;StringEquals        = String &amp;quot;==&amp;quot; String&#xA;String              = StringConstant | OperatorConcat | Input | Identifier&#xA;StringConstant      = &amp;quot;'&amp;quot;StringContent&amp;quot;'&amp;quot;&#xA;StringContent       = Character [StringContent]&#xA;Character           = {Any character except for &amp;quot;'&amp;quot;}&#xA;OperatorConcat      = String &amp;quot;&amp;amp;&amp;quot; String&#xA;Input               = &amp;quot;read()&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Whitespace is defined as any sequence of the ascii characters 9, 10, 13 and 32. Whitespace characters are allowed between tokens but are not required.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The answer should be a complete program&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1326/21713&quot;&gt;Standard input/output allowed&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/standard-loopholes-which-are-no-longer-funny&quot;&gt;Standard loopholes apply&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2031/21713&quot;&gt;Universally testable answers only&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test Input&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Valid syntax:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;print('What is your name?');&#xA;varInput = read();&#xA;print('Hello ' &amp;amp; varInput);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Invalid syntax:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;if(read() == 'DoTask1')&#xA;  print('Executing you'r command');&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="21713" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-08-18T21:14:35.887" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2043" PostTypeId="2" ParentId="1213" CreationDate="2014-08-18T23:42:18.900" Score="4" Body="&lt;h1&gt;Pyth&lt;/h1&gt;&#xA;&lt;p&gt;Run it online at:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://pyth.herokuapp.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://pyth.herokuapp.com/&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;If the code takes a while to run or can't be run online for other reasons, you can download Pyth.&lt;/p&gt;&#xA;&lt;p&gt;Download from here: &lt;a href=&quot;https://github.com/isaacg1/pyth&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://github.com/isaacg1/pyth&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;To run:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;python3 pyth.py program.pyth&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Where &lt;code&gt;program.pyth&lt;/code&gt; has your program in it.&lt;/p&gt;&#xA;&lt;p&gt;Check regularly for updates (git pull) as Pyth is under development.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-07T05:59:31.253" CommentCount="2" CommunityOwnedDate="2016-08-21T03:11:45.147" ContentLicense="CC BY-SA 3.0" />
  <row Id="2044" PostTypeId="1" CreationDate="2014-08-19T00:14:48.680" Score="2" ViewCount="150" Body="&lt;p&gt;It's pretty clear that writing a good question for PPCG is pretty hard - we close a lot of questions, and we have a low rate of questions asked/user. What are some methods we could employ to attract more good questions?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ideas:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A standardized question-making form, for inexperienced question askers. Could be customized by question type, e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/golfing-advice&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;golfing-advice&amp;#39;&quot; rel=&quot;tag&quot;&gt;golfing-advice&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;More points/badges associated with question asking (Note: I don't know if this is possible.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Minimum time before questions can be put on hold of a few hours, except for questions that should be on another site. In general, there's no advantage in closing a question extra quickly. We should allow time for both the OP to respond to comments, as well as for other users to make changes.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;What do you think?&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2014-08-19T14:06:17.600" Title="How can we attract more questions?" Tags="|discussion|" AnswerCount="5" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2045" PostTypeId="2" ParentId="2044" CreationDate="2014-08-19T00:14:48.680" Score="1" Body="&lt;h1&gt;Standardized question-making form&lt;/h1&gt;&#xA;&lt;p&gt;I think this would be really useful, if we could make it visible enough. New users who want to, for instance, ask a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question, rarely know that the should include input and output specifications, example cases, and scoring guidelines, but these are often expected in code golf questions. Similar cases exist in other kinds of questions.&lt;/p&gt;&#xA;&lt;p&gt;As for how it would be structured, one way would be a code block with markdown ready to be pasted into the answer box with &lt;code&gt;&amp;lt;input specification goes here&amp;gt;&lt;/code&gt; and whatnot.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-08-19T00:14:48.680" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2046" PostTypeId="2" ParentId="2044" CreationDate="2014-08-19T00:26:09.040" Score="7" Body="&lt;p&gt;As an experienced Stack Exchange user, I have to strongly disagree with your suggestion to have a &quot;minimum time before questions can be put on hold&quot;. The &lt;em&gt;whole purpose&lt;/em&gt; of &quot;on hold&quot; is to let the OP fix the question for 2 days (after which the question becomes &quot;closed&quot; if people don't vote to reopen it).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In theory, if a question has successfully gone through the sandbox (i.e., many upvotes on the challenge, and all substantial comments resolved), people shouldn't be voting to close it, so the fact that a question is &quot;on hold&quot; means that this sandbox process wasn't followed through.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The thing about &quot;on hold&quot; is to stop people from posting answers that will soon be rendered invalid, once the question is fixed.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-08-19T00:26:09.040" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2047" PostTypeId="2" ParentId="2044" CreationDate="2014-08-19T00:42:12.907" Score="2" Body="&lt;p&gt;Responses to your ideas:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;A standardized question-making form, for inexperienced question askers.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1511/3808&quot;&gt;already exists.&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;More points/badges associated with question asking&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This would only be possible if the SE dev team wanted to implement new badges network-wide (which &lt;a href=&quot;https://meta.stackexchange.com/q/234259/180276&quot;&gt;did happen recently&lt;/a&gt;). I really don't see why it's necessary though.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;Minimum time before questions can be put on hold of a few hours&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Wait, what? Why?!&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;We should allow time for both the OP to respond to comments, as well as for other users to make changes.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This doesn't make much sense - that is the &lt;em&gt;whole point&lt;/em&gt; of putting things on hold: to allow time for both the OP to respond to comments, as well as for other users to make changes.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;It's pretty clear that writing a good question for PPCG is pretty hard ... What are some methods we could employ to attract more good questions?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Do you have any evidence that this is a problem? Naturally, coming up with questions for PPCG is going to be much harder than coming up with a question for, say, Stack Overflow.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question you &lt;em&gt;should&lt;/em&gt; be asking is: &lt;strong&gt;How can we attract &lt;em&gt;higher quality&lt;/em&gt; questions?&lt;/strong&gt; More questions is not necessarily better for the site; a general increase in challenge quality would be much more beneficial in the long term.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So how do we do this, you ask? There's no magical silver bullet; there's not one specific thing you can do that will improve overall challenge quality. The best thing &lt;strong&gt;you&lt;/strong&gt; could do for this site is to continue to contribute to the community: Post good challenges, post solutions to challenges, help other users via the voting and commenting systems, participate on meta, encourage others to do the same, and so on. By being an active member of the community, you and every other user will each help this site succeed.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-08-19T00:42:12.907" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2048" PostTypeId="2" ParentId="2044" CreationDate="2014-08-19T00:45:51.140" Score="0" Body="&lt;p&gt;Yes, it is important that we get more &lt;strong&gt;&lt;em&gt;good&lt;/em&gt;&lt;/strong&gt; questions. Both because that will increase the choice for all of us who enjoy answering, but also because that will attract new users to the site at a greater rate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think what's important to realise is that putting people off the site by closing their questions is not as bad as it seems. Generally the people being put off in this way have minimal rep, because they have not answered (m)any questions. The kind of people who ask good code golf questions are the kind of people who write good code golf answers. The same goes for code challenges and king of the hill contests.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the inate skills required for asking good questions also make someone good at writing answers.&lt;/li&gt;&#xA;&lt;li&gt;the experience and insight gained from working hard on answers helps avoid the many pitfalls associated with writing a question.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Someone who has a history of writing good answers but writes a question with a flaw is less likely to be put off by it being closed, but will understand that this is how the community does things, and will simply learn from it and go on to write even better questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For this reason I think that although we do need more good questions, what we need to focus on is attracting more people who will write good answers. If we can do that, questions will follow naturally, and they will be much better questions than if we try to do things the other way around.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you really want to see more good questions, raise a meta question about how to get more good answers.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2014-08-19T00:45:51.140" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2050" PostTypeId="2" ParentId="2044" CreationDate="2014-08-19T14:06:17.600" Score="6" Body="&lt;p&gt;&lt;strong&gt;TL;DR:&lt;/strong&gt; &lt;em&gt;This is a non-issue,&lt;/em&gt; and our question rate is fine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As it stands now, we have:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;around 2k questions (not counting closed or deleted)&lt;/li&gt;&#xA;&lt;li&gt;around 5 questions per day&lt;/li&gt;&#xA;&lt;li&gt;around 10 answer ratio (answers:questions)&lt;/li&gt;&#xA;&lt;li&gt;around 6k visitors per day&lt;/li&gt;&#xA;&lt;li&gt;probably no more than 200 &lt;em&gt;active&lt;/em&gt; users (high-end estimate from observation)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Think about that, there's five new questions per day with only a couple hundred active users. Considering that each new challenge is supposed to be based on a unique problem, I think that's &lt;strong&gt;pretty damn good.&lt;/strong&gt; Some people can churn out a problem every couple days, but many are here more to answer. That's okay, we &lt;em&gt;need&lt;/em&gt; more answers than questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The thing is, there are tons of questions if people want to answer. Questions only get an average of 10 answers. Obviously some get more and some less, but they're &lt;em&gt;still there&lt;/em&gt;, waiting for more answers. It isn't the lack of good questions that is failing to attract users.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A better question in my mind is: &lt;strong&gt;What can we do to get more attention to older challenges?&lt;/strong&gt; We have tons of older questions that people can jump on, but it doesn't happen that often. Sure, a question or two might get bumped up every couple days by a new answer, but there are tons that nobody seems to look at.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm sure the &quot;shiny&quot; factor is the main cause, but it's more of an issue with this type of site then a regular Q/A site. On a Q/A site, questions get &lt;strong&gt;answered&lt;/strong&gt;, full stop. Once a correct, decently written answer comes along, there's little incentive to add to it (unless something changes later). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It doesn't really work that way here (with a few exceptions), because people still vote on new answers to old questions. See an old &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; with a great answer? You can still golf down a different language (bonus for a different &lt;em&gt;category&lt;/em&gt; of language) and get some votes. A &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; that hasn't been touched in a while? Give it a shot! You might come up with something better. Many times people will appreciate just seeing  a different &lt;em&gt;method&lt;/em&gt; of solving a problem, even if it doesn't strictly &quot;win&quot;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;As far as &quot;we close a lot of questions&quot; is concerned: Good! Frankly, we get a lot of questions worth closing. What's even better? We also &lt;strong&gt;reopen&lt;/strong&gt; a lot of questions. When I see a question get closed here, it normally boils down one of:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Duplicate&lt;/li&gt;&#xA;&lt;li&gt;Clearly off-topic &lt;/li&gt;&#xA;&lt;li&gt;Broad/Imperfect spec&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There's simply not much to do about the first two categories, every site has them and they just need closing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Questions with a spec problem are where this community really shines IMO. People generally &lt;em&gt;want&lt;/em&gt; to see questions reopened so that they have a chance to answer. We often see long comment threads about what problems the spec has and how to fix it. Sometimes the OPs respond/fix, and it gets reopened. Sometimes &lt;em&gt;somebody else&lt;/em&gt; fixes it and it gets reopened. Sometimes it can't be helped and just dies. This works as advertised, and &lt;em&gt;better&lt;/em&gt; than on many SE sites from what I've seen.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2014-08-19T14:06:17.600" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2053" PostTypeId="2" ParentId="1987" CreationDate="2014-08-20T01:06:13.193" Score="21" Body="&lt;h1&gt;Measuring the Strength of the FGITW Effect&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Although this answer isn't a suggestion for a solution, it should provide a better understanding of the problem.  A proper understanding is necessary to create a solution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;em&gt;FGITW effect&lt;/em&gt; (&quot;fastest gun in the west&quot; effect) is the phenomenon in which the earliest answers receive the most votes and always stay at the top of the answer list.  The feedback loop is this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;early answer -&amp;gt; some votes -&amp;gt; top of the answer list -&amp;gt; more visibility -&amp;gt; even more votes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Although I think everyone recognizes the existence of FGITW, people might not have an idea as to its power.  How can we measure the FGITW effect in an objective way?  With the help of user &lt;em&gt;Eric Tressler&lt;/em&gt;, some data was collected and measured.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We decided to look at the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35079/the-rock-paper-scissors-lizard-spock-tournament-of-epicness&quot;&gt;RPSLS tournament&lt;/a&gt; as an example of FGITW.  This challenge was posted about 3.5 weeks ago.  Here is the data (collected by Eric):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;// Score, date posted rank, #votes for Rock Paper Scissors Lizard Spock&#xA;n = 65&#xA;64  28 18&#xA;62  55 1&#xA;62  65 2&#xA;61  64 1&#xA;60  29 5&#xA;58  27 3&#xA;57  32 2&#xA;53  61 1&#xA;51  42 1&#xA;51  16 20&#xA;49  31 2&#xA;49  49 1&#xA;47  34 3&#xA;46  56 1&#xA;45  24 4&#xA;44  48 1&#xA;43  40 4&#xA;42  20 4&#xA;42  53 1&#xA;41  12 2&#xA;41  13 3&#xA;40  23 3&#xA;40  46 2&#xA;39  62 1&#xA;38  38 4&#xA;38  33 2&#xA;38  43 2&#xA;37  50 1&#xA;35  15 8&#xA;35  58 1&#xA;35  54 1&#xA;34  3  4&#xA;33  10 3&#xA;32  4  8&#xA;32  44 1&#xA;32  14 5&#xA;32  17 2&#xA;31  19 8&#xA;31  45 2&#xA;31  51 1&#xA;30  1  3&#xA;30  60 1&#xA;29  22 4&#xA;28  25 3&#xA;27  57 1&#xA;25  30 2&#xA;24  2  7&#xA;24  39 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The three variables are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Score (s), showing how well the post performed in the contest&lt;/li&gt;&#xA;&lt;li&gt;Date rank (d), with lower numbers being the earliest answers&lt;/li&gt;&#xA;&lt;li&gt;Votes (v), which is just the net number of votes (up - down)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;We wanted to find the relationships between these variables.  We used Spearman's Rank Correlation Coefficient (Rho) to measure the correlation between the variables.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Dates-Scores:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Zx9sZ.jpg&quot; alt=&quot;datesscores&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The above dates-scores graph shows how performance was related to submission time.  You can see how the very best entries (high 50s and 60s) came later in the competition, while the earliest submissions generally performed below-average (the average score was &lt;code&gt;34.6615&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We calculated &lt;code&gt;rho = 0.243443&lt;/code&gt;, so there was a moderately-weak correlation between newer posts and higher scores.  This is as expected, since the later bots could be tailored to the competition.  Also, the best posts would probably take longer to write.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a sample size of 65, the standard error for rho is approximately &lt;code&gt;0.0791&lt;/code&gt;, so these results are significant.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Dates-Votes:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is the interesting part - the FGITW.  Here is the graph, which speaks for itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/J2neW.jpg&quot; alt=&quot;datesvotes&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is the FGITW in full force, you can clearly see how the most up-voted answers are typically early answers.  The most-voted answers were all early in the competition.  After a certain point (the latest 18), no answer has more than 2 upvotes.  Although we would expect older posts to have some more votes, simply by virtue of being older, it is clear that the FGITW Effect is strong.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We calculated &lt;code&gt;rho = -0.766193&lt;/code&gt;, which is a moderately strong correlation between earlier posts and more votes.  This is objective evidence as to the strength of the FGITW, and I believe that the age of the post is one of the most important factors in determining the number of votes an answer will receive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scores-Votes:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While the relationship between dates and votes should show the strength of the effect, the relationship between scores and votes should show why this is a problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/AxHwZ.jpg&quot; alt=&quot;scoresvotes&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The above graph shows the relationship between performance and the number of votes.  With the exception of a few outliers, this third graph looks rather similar to the second graph.  The submissions with lower scores actually had more votes than most of the submissions with higher scores.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We calculated &lt;code&gt;rho = -0.250174&lt;/code&gt;, which is a moderately weak correlation between &quot;higher score&quot; and &quot;fewer votes.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A negative correlation is the opposite of what we should want.  Submissions with better performance should receive more votes.  I suspect that this is due to the FGITW as well.  As we saw above, earlier posts receive more votes, while later posts perform better. It turns out that this actually causes a negative correlation between score (performance) and votes. &lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2014-08-20T01:13:00.810" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2054" PostTypeId="1" CreationDate="2014-08-20T03:46:02.020" Score="9" ViewCount="186" Body="&lt;h1&gt;Description&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As it appears &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2011/3808&quot;&gt;the sandbox on meta is here to stay&lt;/a&gt;, I've written a very simple userscript that will allow you to collapse sandbox answers to reduce clutter. (This may be able to be replaced when the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2021/3808&quot;&gt;fancy sandbox viewer thingy&lt;/a&gt; is finished, but for now it'll make navigating the sandbox a little easier.)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Screenshot&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/nuc0w.png&quot; alt=&quot;screenshot&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;stackexchange-codegolf-sandbox-collapse.user.js&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;// ==UserScript==&#xA;// @name stackexchange-codegolf-sandbox-collapse&#xA;// @namespace http://keyboardfire.com/&#xA;// @license MIT&#xA;// @description A simple userscript for collapsing sandbox answers&#xA;// @version 1.0.0&#xA;// @match *://meta.codegolf.stackexchange.com/*&#xA;// ==/UserScript==&#xA;&#xA;if ($('#question-header a').text().indexOf('Proposed Question Sandbox') &amp;gt; -1) {&#xA;    $('.answer').each(function() {&#xA;        var ans = $(this);&#xA;        var ansPosted = $('.post-text', ans).children().length === 1;&#xA;        var btnMessage = '(' + (ansPosted ? 'challenge posted; ' : '') + 'click to toggle view)';&#xA;        $('table', ans).wrap($('&amp;lt;div&amp;gt;').addClass('posted-challenge').css('display', ansPosted ? 'none' : ''));&#xA;        ans.prepend($('&amp;lt;input&amp;gt;').attr('type', 'button').css('margin-bottom', '20px').val(btnMessage).click(function() {&#xA;            $(this).parent().find('.posted-challenge').toggle('slow');&#xA;        }));&#xA;    });&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Issues&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt; &lt;a href=&quot;/questions/tagged/status-planned&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-planned&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-planned&lt;/a&gt;: Show title, tags (if included), and votes even when collapsed&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="66833" LastEditDate="2021-04-22T16:09:06.490" LastActivityDate="2021-04-22T16:09:06.490" Title="A simple userscript for collapsing sandbox answers" Tags="|discussion|sandbox|userscript|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2055" PostTypeId="2" ParentId="1987" CreationDate="2014-08-20T13:08:50.627" Score="2" Body="&lt;h2&gt;Not enough information given&lt;/h2&gt;&#xA;&lt;p&gt;I can't agree to change the default sort at all unless more evidence is given that the basic premise is true.&lt;/p&gt;&#xA;&lt;p&gt;PhiNotPi gives &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2053/14215&quot;&gt;some data&lt;/a&gt; showing that the FGITW effect happens, and I don't doubt that. However, the only correlation it &lt;em&gt;really&lt;/em&gt; shows is between early answers and votes. For one question. With &lt;em&gt;tons&lt;/em&gt; of answers.&lt;/p&gt;&#xA;&lt;p&gt;To be clear, 80 answers is just &lt;em&gt;not typical&lt;/em&gt;. The site as a whole averages a bit under 10 answers per question. Certain challenges might garner 30+, but there aren't very many, and they just drag the average &lt;em&gt;up&lt;/em&gt;. I don't think the default sort for &lt;strong&gt;all&lt;/strong&gt; questions should be changed for the sake of those few.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;...few people scroll to the bottom to see newer answers and even fewer people sort by activity.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This could be true. It also might not be. A simpler explanation to explain FGITW could be that early answers get more &lt;em&gt;page&lt;/em&gt; views, so have a better chance of getting an upvote. Even if every user scrolls to see every answer on every question, the early ones &lt;em&gt;still&lt;/em&gt; get seen more.&lt;/p&gt;&#xA;&lt;p&gt;Changing the sort method won't change that, except (most likely) on questions that go 30+ answers and paginate. I think it likely that on &lt;em&gt;most&lt;/em&gt; questions, people read at least the majority of answers, because there aren't very many anyway.  In addition, since the vast majority of challenges are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, there are typically &amp;lt;10 &lt;em&gt;short&lt;/em&gt; answers.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-08-20T13:21:11.483" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2056" PostTypeId="1" AcceptedAnswerId="2057" CreationDate="2014-08-20T13:42:17.760" Score="38" ViewCount="2735" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?answertab=active&quot;&gt;Link to sandbox&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I've noticed some people here talking about a &quot;proposed question sandbox.&quot;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Where is the sandbox?&lt;/li&gt;&#xA;&lt;li&gt;Why should I use the sandbox?&lt;/li&gt;&#xA;&lt;li&gt;How does the sandbox work?&lt;/li&gt;&#xA;&lt;li&gt;What should we do with abandoned proposals?&lt;/li&gt;&#xA;&lt;li&gt;How should I review proposals? &lt;/li&gt;&#xA;&lt;li&gt;What should the format of sandbox posts be (title, tags, body)?&lt;/li&gt;&#xA;&lt;li&gt;How long should I leave a question in the sandbox?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1280&quot;&gt;Return to FAQ index&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="43319" LastEditDate="2017-06-28T08:35:06.053" LastActivityDate="2021-07-04T09:57:30.257" Title="How does the Sandbox work? How do I use it?" Tags="|support|faq|sandbox|" AnswerCount="3" CommentCount="1" CommunityOwnedDate="2017-11-30T08:34:33.320" ContentLicense="CC BY-SA 3.0" />
  <row Id="2057" PostTypeId="2" ParentId="2056" CreationDate="2014-08-20T13:42:17.760" Score="34" Body="&lt;h1&gt;Where is the sandbox?&lt;/h1&gt;&#xA;&lt;p&gt;The &lt;strong&gt;sandbox is located on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/26997&quot;&gt;this meta post&lt;/a&gt;&lt;/strong&gt;. Sandboxed challenges are posted as answers to this question.&lt;/p&gt;&#xA;&lt;h1&gt;Why should I use the sandbox?&lt;/h1&gt;&#xA;&lt;p&gt;You might be thinking, perhaps, why would you stage questions on the sandbox instead of posting them directly?&lt;/p&gt;&#xA;&lt;p&gt;To answer this, let's see what could happen if you post it directly:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If your question is incomplete, it will probably be quickly closed and ruined.&lt;/li&gt;&#xA;&lt;li&gt;If your question has a hole in the specification, answers could exploit it, spoiling the fun of your question.&lt;/li&gt;&#xA;&lt;li&gt;If people think that some point of the question is unclear, they will complain about it in comments and downvote your question. If you are unlucky, your question might get closed.&lt;/li&gt;&#xA;&lt;li&gt;People might complain that your question is overly restrictive, overly open, or simply disagree with its rules or scoring system.&lt;/li&gt;&#xA;&lt;li&gt;You might edit your question and fix the problems pointed by those people, but answerers will complain about changing rules and some downvotes already received will not be removed.&lt;/li&gt;&#xA;&lt;li&gt;If your question has some point that is unclear or vague, some people may misunderstand it and post some bad answers, leading to unnecessary arguments, downvotes and frustration.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The sandbox is intended to mitigate all those problems.&lt;/p&gt;&#xA;&lt;h1&gt;How does the sandbox work?&lt;/h1&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You &lt;strong&gt;get an idea for a nice question&lt;/strong&gt; for this site.&lt;/li&gt;&#xA;&lt;li&gt;You &lt;strong&gt;post an answer to the sandbox&lt;/strong&gt;. Your answer to the sandbox should contain the question that you are proposing. It is ok if your question is still incomplete.&lt;/li&gt;&#xA;&lt;li&gt;After you post it there, people will give &lt;strong&gt;suggestions to improve your question&lt;/strong&gt; and point out &lt;strong&gt;potential problems&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You &lt;strong&gt;fix the problems&lt;/strong&gt;, improving your question.&lt;/li&gt;&#xA;&lt;li&gt;When people &lt;strong&gt;agree that it is good&lt;/strong&gt;, they will upvote it here in the sandbox; you should wait until a sufficient number of people seem to support your proposed challenge via voting and commenting before posting it on the main site.&lt;/li&gt;&#xA;&lt;li&gt;Now that you know that most of the problems are worked out, you &lt;strong&gt;post it in the main site&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Furthermore, the sandbox allows you to suggest improvements for questions from other people too. Upvote other people's questions when you think that they are ready.&lt;/p&gt;&#xA;&lt;p&gt;When you post your question on the main site, &lt;strong&gt;edit the sandbox post&lt;/strong&gt; to include a link to the challenge, removing everything but the title and the link. This is to keep the sandbox more compact and reduce the scrolling needed to view other proposals. Furthermore, &lt;strong&gt;delete the post&lt;/strong&gt;. (You should edit it anyway, because high-reputation users can still see deleted posts.)&lt;/p&gt;&#xA;&lt;h1&gt;What should we do with abandoned proposals?&lt;/h1&gt;&#xA;&lt;p&gt;All content on Stack Exchange is licensed under &lt;a href=&quot;https://creativecommons.org/licenses/by-sa/4.0/&quot; rel=&quot;nofollow noreferrer&quot;&gt;CC BY-SA&lt;/a&gt;, so legally you are allowed to claim an abandoned idea yourself to make it ready for main and post it. However, doing so you should follow a few rules of courtesy. The following process &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2091/8478&quot;&gt;has been agreed on&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a challenge proposal was not edited or commented on for &lt;strong&gt;a month&lt;/strong&gt;, you can leave a comment that you would like to take over the challenge, get it ready for main and post it.&lt;/li&gt;&#xA;&lt;li&gt;If the OP does not reply within &lt;strong&gt;two weeks&lt;/strong&gt;, telling you that they still intend to post the challenge themselves, you are free to proceed with the challenge as you see fit.&lt;/li&gt;&#xA;&lt;li&gt;Don't repost, just edit the existing post.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You can use the following standard comment to express your interest in a challenge:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This challenge proposal has been inactive for over a month. I would like to take ownership of the challenge and make it ready for posting. Please let me know within the next &lt;strong&gt;14 days&lt;/strong&gt; if you have any objections and would still like to finish and post this challenge yourself.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;How should I review proposals?&lt;/h1&gt;&#xA;&lt;p&gt;You can contribute to the community by reviewing proposals to help them get ready for posting. Here is some advice to make your reviewing more productive and more helpful:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Sort the sandbox by &lt;em&gt;active&lt;/em&gt; (even if it means switching back for other questions). The sandbox has grown very large over time, but when sorting by activity, only the first page or so will be relevant for reviewing. Everything else is posted and abandoned. So this allows you to get a quick overview over new or recently edited challenge ideas.&lt;/li&gt;&#xA;&lt;li&gt;For clearly &lt;em&gt;incomplete&lt;/em&gt; challenges, the author will usually ask for feedback, so try to answer their questions and help them fill the missing gaps. If it is already clear at this stage that there are severe problems with the proposal, which are not likely to be fixed by completing the spec, inform the author so they can fix the problems before wasting effort on the challenge.&lt;/li&gt;&#xA;&lt;li&gt;For apparently complete challenges, here are a few points to check when reviewing proposals. You should basically go through the close-vote reasons for challenges, and make sure that the idea won't fall victim to them when posted in the current form:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the challenge new? Otherwise, point the author to an existing question their idea is a duplicate of, so they can consider differentiating their proposal appropriately.&lt;/li&gt;&#xA;&lt;li&gt;Is the challenge reasonably scoped? If there are too many possible (valid) answers to a challenge, or the challenge would preclude many interesting (more narrowly) scoped challenges in the future, it is probably &lt;em&gt;too broad&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Does the challenge state &lt;strong&gt;objective&lt;/strong&gt; criteria for &lt;em&gt;validity&lt;/em&gt; of an answer as well as the &lt;em&gt;score&lt;/em&gt; of an answer.&lt;/li&gt;&#xA;&lt;li&gt;Is the specification clear (about input, output, the problem, all edge cases) and free of contradictions?&lt;/li&gt;&#xA;&lt;li&gt;Does the challenge need more test cases?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;If there are no more problems with the challenge and it could be posted as it is, &lt;em&gt;upvote&lt;/em&gt; the proposal. There are exceptions to this rule: some author might want to gather general interest in a problem before putting work into finalizing the spec or a necessary control program. If this is stated, you should use your votes accordingly.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;How long should I leave a question in the sandbox?&lt;/h1&gt;&#xA;&lt;p&gt;In general you should leave a question at least 72 hours to ensure that the people who check it fairly regularly will have a chance to see it and comment.&lt;/p&gt;&#xA;&lt;p&gt;Typically, a net score of +3 or higher means that your post is ready to be posted over to main, but this isn't a hard and fast rule, merely a recommendation. The more downvotes your post has, even with a net score of +3, the less likely your challenge is to be ready.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="66833" LastEditDate="2021-02-11T21:47:50.370" LastActivityDate="2021-02-11T21:47:50.370" CommentCount="7" CommunityOwnedDate="2017-11-30T08:34:33.320" ContentLicense="CC BY-SA 4.0" />
  <row Id="2058" PostTypeId="1" AcceptedAnswerId="2061" CreationDate="2014-08-20T13:43:46.950" Score="13" ViewCount="636" Body="&lt;p&gt;In a similar vein to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2054/3808&quot;&gt;my previous meta post&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2011/3808&quot;&gt;we're going to have to deal with having the sandbox on meta.&lt;/a&gt; And currently, the sandbox situation is a bit... messy. Here's a simple plan (or, at least, starting point) in order to deal with the difficulty of the current way of handling this (which is basically &quot;retire the sandbox whenever someone feels like it&quot;).&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Create a &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq&lt;/a&gt; &lt;strong&gt;post for a description of the sandbox&lt;/strong&gt;. Instead of pasting that huge boilerplate each time a new sandbox is created, simply link to this post. (A &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2023/3808&quot;&gt;directory&lt;/a&gt; may also be included, which seems like a good and generally well-accepted idea.)&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I have &lt;strong&gt;already posted &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2056/3808&quot;&gt;a [faq-proposed] post&lt;/a&gt;&lt;/strong&gt;, which can be found by following that link.&lt;/li&gt;&#xA;&lt;li&gt;This linked post also standardizes on the &lt;strong&gt;title, tags, and body&lt;/strong&gt; of sandbox posts. I will perform a mass edit if / when we agree on a standard. (This may not even be necessary if we decide not to retire sandboxes.)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Agree on how to handle the &lt;strong&gt;retirement of sandboxes&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;My own proposal can be found &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2060/3808&quot;&gt;in the answers&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2014-08-27T02:01:44.397" Title="How should sandbox retirement be handled (if at all)?" Tags="|discussion|sandbox|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2060" PostTypeId="2" ParentId="2058" CreationDate="2014-08-20T13:50:05.377" Score="8" Body="&lt;h1&gt;Proposal for the handling of retired sandboxes&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When a sandbox reaches 100 answers or more, it should be retired.&lt;/li&gt;&#xA;&lt;li&gt;There will always be two &lt;a href=&quot;/questions/tagged/featured&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;featured&amp;#39;&quot; rel=&quot;tag&quot;&gt;featured&lt;/a&gt; sandboxes at a time: one retiring sandbox (the previous sandbox) and the current sandbox. When the current sandbox retires, it becomes the retiring one, and the current retiring one is &quot;properly&quot; retired.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When a sandbox is retired, &lt;code&gt; (retired)&lt;/code&gt; is appended to its title, and this text is prepended to its body:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h2&gt;This sandbox is retired.&lt;/h2&gt;&#xA;  &#xA;  &lt;p&gt;To find the current sandbox, see the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2056/3808&quot;&gt;sandbox FAQ&lt;/a&gt;. Please post new proposals in&#xA;  the current sandbox, although proposals here may still be worked on&#xA;  until they are ready to be posted.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2014-08-20T13:50:05.377" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2061" PostTypeId="2" ParentId="2058" CreationDate="2014-08-20T14:08:38.117" Score="24" Body="&lt;h1&gt;Proposal for the handling of retired sandboxes - Don't!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I suggest to stop retiring sandboxes and keep using a single one. Sandboxes should be sorted by activity, because even at 50 or 100 answers, they are too big to find the active ones when sorting by votes. Assuming everyone does that, we can basically forget about the additional pages, because they will be populated by either posted, deleted or abandoned proposals. If someone's proposal takes a while and floats off the front page, they can always get more attention by posting a link to it in the chat room and asking for feedback. If the challenge is good to go, they'll be told, and if not, they will probably make some edits which will also bump the question to the top.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This would be even more effective &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1998/8478&quot;&gt;if we deleted posted challenges&lt;/a&gt;. I really doubt that anyone actually follows those links we leave behind or looks through revision histories to see how challenge specs evolved. That seems like a very romantic idea, but I don't think that's actually happening. Hence, posted challenges may as well be deleted since they don't really serve any purpose other than cluttering up the sandbox. Of course, deleted answers won't move to the bottom if you're sorting by activity, but if we all did that, it might even make sorting by votes feasible even if the sandbox gets older.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When you post a challenge, edit down your proposal to the title and a link to the challenge. Then delete it. (The former step is just being nice to people who can see deleted posts.)&lt;/li&gt;&#xA;&lt;li&gt;Get in the habit of sorting the sandbox by activity.&lt;/li&gt;&#xA;&lt;li&gt;Never retire the sandbox.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Let me know if I've overlooked any obvious downsides (which is likely), so I can try to address them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt; Doorknob requested feedback from an SE dev whether some large number of answers on a single question will cause technical problems. The answer is that there is no limit we are likely to reach and due to pagination, load times won't be affected either.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2014-08-25T17:58:10.553" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="2062" PostTypeId="2" ParentId="2140" CreationDate="2014-08-20T16:45:29.377" Score="1" Body="&lt;p&gt;This is nearly done now, just need someone to double check that everything makes sense&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Generate Lightning Forks in a 3D Grid&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Objective:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Overview:&lt;/strong&gt;&lt;br&gt;&#xA;Write a program, that given the two inputs &lt;strong&gt;number of rays&lt;/strong&gt; and &lt;strong&gt;ray length&lt;/strong&gt;, will produce a procedurally random array of connected points, containing the &lt;strong&gt;ray number&lt;/strong&gt;, &lt;strong&gt;number in sequence&lt;/strong&gt; and &lt;strong&gt;coordinates&lt;/strong&gt; of each point.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Details:&lt;/strong&gt;&lt;br&gt;&#xA;The lightning is in the form of &lt;strong&gt;rays&lt;/strong&gt;, which are determined by points stored as &lt;strong&gt;coordinates in a grid&lt;/strong&gt;.&lt;br&gt;&lt;br&gt;The initial point (0,0,0), is the cloud, where the lightning is first generated. The first ray starts here and travels out in a random direction, and will continue moving in random directions (each point has an equal chance of any direction, not influenced by the previous point), and will terminate once it reaches the ray length limit or cannot go any further (if it fails enough new direction retries when intersecting with another point). This will leave a single path between the origin and the end point.&lt;br&gt;&lt;br&gt;&#xA;However, lighting doesn't stay as one single ray and will fork, so while all other rays should be generated in a similar way, their origin should be randomly chosen from any of the already generated points, and the sequence then continues from this point.&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&#xA;The &lt;strong&gt;Ray Number&lt;/strong&gt; is simply which ray iteration the code is on. Each ray is it's own individual path. The origin point of the ray will have the same coordinates as the point it branches off from.&lt;br&gt;&lt;br&gt;&#xA;The &lt;strong&gt;Number In Sequence&lt;/strong&gt; is how many points away from the cloud (or how far into the generation) it is. If lightning forks at point 50, both separate paths will start at 51. While this is not currently used for anything aside from checking the code is working correctly, it would allow for future improvements such as animation (see gif at bottom for an example).&lt;br&gt;&lt;br&gt;&#xA;&lt;strong&gt;Coordinates&lt;/strong&gt; are the 3D points the ray passes through. They should be stored as integers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&lt;strong&gt;Simple 2D Diagram:&lt;/strong&gt;&lt;br&gt;&#xA;Here is an example output &lt;em&gt;during generation&lt;/em&gt; after 24 points have been calculated.&lt;br&gt;&#xA;The numbers written in black are the numbers in sequence, and as you can see when the 2nd ray (blue) branches out, it continues from 10. The red line is an example of when it would try intersect with existing points and get stuck. This shows the cloud as it's own ray, you are free however to do this differently.&#xA;&lt;img src=&quot;https://i.stack.imgur.com/mD0IE.png&quot; alt=&quot;diagram&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules:&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Can be written in any code (without extra plugins), although I can't guarantee anything but PHP and Python will be tested, unless someone else with access to a lot more languages helps out.&lt;/li&gt;&#xA;&lt;li&gt;Randomness must be seed based, so &lt;em&gt;if&lt;/em&gt; you were to define a seed (not needed), it would produce the same result.&lt;/li&gt;&#xA;&lt;li&gt;A point can move in any &lt;strong&gt;one&lt;/strong&gt; of the 3 dimensions - meaning it can go up, down, left, right, forwards, or backwards (x,y,z,-x,-y,-z) from the previous point, but not diagonally.&lt;/li&gt;&#xA;&lt;li&gt;No two points can have the same coordinates.&lt;/li&gt;&#xA;&lt;li&gt;The one exception of this rule is that each ray must start with the same coordinate of where it branches out (for the purpose of connecting everything together).&lt;/li&gt;&#xA;&lt;li&gt;If an intersection is detected, at least 3 retries must be done to find new direction, then it may be terminated. The retries must be for each point, so having 1 retry on 3 different points shouldn't terminate the ray.&lt;/li&gt;&#xA;&lt;li&gt;No multithreading allowed.&lt;/li&gt;&#xA;&lt;li&gt;The code should output the final number of points generated and time taken.&lt;/li&gt;&#xA;&lt;li&gt;The program should be timed to when the array of points is complete. Anything after this (such as for the bonus points) is fine and won't impact on the execution time.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Scoring:&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Generate 100 rays with a maximum length of 200. If your code is super efficient and you want to show off, you're welcome to post the times for more complex results.&#xA;&lt;br&gt;&lt;/li&gt;&#xA;&lt;li&gt;Most efficient code wins, based on the execution time. Someone will test multiple submissions and take an average from at least 4 generations to make it more fair.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Important:&lt;/strong&gt; So I can easily check your code works as it should, I wrote something that will display the rays in a 3D program.&lt;br&gt;You'll need to generate 30 rays with a length of 15, in &lt;strong&gt;2D&lt;/strong&gt; (easy to switch - where it randomly chooses from from 6 directions, change this to 4), and copy it to pastebin. Format it like I have done here, and keep it limited to square brackets, commas, and integers: &lt;a href=&quot;http://pastebin.com/8XHtv4is&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://pastebin.com/8XHtv4is&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Bonus Points:&lt;/strong&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Given any two random points, there is one and only path between them both. If you can code something that would be able to calculate a path between these two random points and store it in a new array with the same structure, you get 15% off the execution time.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Instead of limited to 3 dimensions, code it for &lt;code&gt;n&lt;/code&gt; dimensions, as more than 3 dimensions should work, despite being a little hard to visualise. If you manage you can knock 10% from the execution time.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;As not everyone will be able to do it, this is only worth 5%, but you get it, if you code a way to visually draw the rays (2D is allowed, any method is allowed, but it must be able to run at the end of the code, as opposed to copying the list into a graphing program).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Tips:&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Start working with a 2D grid for easier debugging.&lt;/li&gt;&#xA;&lt;li&gt;Use small ray length and ray amount values until properly optimised.&lt;/li&gt;&#xA;&lt;li&gt;While intersections are fairly easy to see, diagonals are not, running the code with a single short ray to print the output can be useful.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Example code:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Generation Time for 100x200: 75-85 seconds &lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;length=15&#xA;forks=30&#xA;import time&#xA;import random as rd&#xA;startTime=time.time()&#xA;def getDirection(num):&#xA;    if(num==1):&#xA;        direction=[1,0,0]&#xA;    if(num==2):&#xA;        direction=[-1,0,0]&#xA;    if(num==3):&#xA;        direction=[0,1,0]&#xA;    if(num==4):&#xA;        direction=[0,-1,0]&#xA;    if(num==5):&#xA;        direction=[0,0,1]&#xA;    if(num==6):&#xA;        direction=[0,0,-1]&#xA;    return direction&#xA;listOfPoints = [[0,[0,0,0],0]]&#xA;for i in range(forks):&#xA;    randomPoint = listOfPoints[rd.randint(0,len(listOfPoints)-1)]&#xA;    start = randomPoint[0]&#xA;    newLocation = randomPoint[1]&#xA;    listOfPoints.append([randomPoint[0],randomPoint[1],i+1])&#xA;    j=0&#xA;    j2=0&#xA;    while j in range(length):&#xA;        j+=1&#xA;        oldLocation = newLocation&#xA;        k = 0&#xA;        while True:&#xA;            invalid = 0&#xA;            newDirection = getDirection(rd.randint(1,6))&#xA;            newLocation = [oldLocation[0]+newDirection[0],oldLocation[1]+newDirection[1],oldLocation[2]+newDirection[2]]&#xA;            for n in range(len(listOfPoints)):&#xA;                location = listOfPoints[n][1]&#xA;                if location==newLocation:&#xA;                    invalid = 1&#xA;                    newLocation = oldLocation&#xA;            if invalid==0 or k&amp;gt;4:&#xA;                break&#xA;            k+=1&#xA;        if invalid == 0:&#xA;            listOfPoints.append([j2+start+1,newLocation,i+1])&#xA;            j2+=1&#xA;&#xA;print &quot;Time: &quot;+str(round(time.time()-startTime,2))+&quot; seconds&quot;&#xA;print &quot;Generated/Maximum points: &quot;+str(len(listOfPoints))+&quot;/&quot;+str(length*forks)+&quot;(&quot;+str(round(len(listOfPoints)/float(length*forks),3))+&quot;%)&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Visualised Output:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(From a more advanced version I did before, I was aiming to make a flower)&lt;br&gt;&#xA;&lt;img src=&quot;http://oi62.tinypic.com/28h0u46.jpg&quot; alt=&quot;diagram&quot;&gt;&lt;br&gt;&lt;/p&gt;&#xA;" OwnerUserId="30120" LastEditorUserId="30120" LastEditDate="2014-08-23T13:16:17.063" LastActivityDate="2014-08-23T13:16:17.063" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="2063" PostTypeId="1" CreationDate="2014-08-20T21:21:52.817" Score="8" ViewCount="157" Body="&lt;p&gt;On PPCG also old and already answered questions provide a valuable source for attraction of new answers and new users, which also supports growth of the site. Moreover, there are several barely noticed questions (often with only few answers) which are examples of good and noteworthy challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;According to its profile the user &lt;a href=&quot;https://codegolf.stackexchange.com/users/-1/community&quot;&gt;Community♦&lt;/a&gt; does &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;randomly poke old unanswered questions every hour so they get some&#xA;  attention&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In order to attract more answers also for older questions it might be an idea to change that behaviour to something like &quot;randomly poke old (unclosed) questions&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It seems to be possible to do so but this would mean a feature request which has to describe the actual behaviour we want and why it is important for PPCG.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, please try to be specific with your answers such that we can get consensus whether we want something changed and in which way.&lt;/p&gt;&#xA;" OwnerUserId="1490" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-08-20T21:40:26.680" Title="Change behaviour of Community user to poke more &quot;old&quot; questions" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2064" PostTypeId="2" ParentId="2063" CreationDate="2014-08-20T21:40:26.680" Score="10" Body="&lt;h3&gt;Make the user poke frequently and also old questions which already have answers and votes on these.&lt;/h3&gt;&#xA;&lt;p&gt;The activity page with 25 recently active questions goes back (of course depending on the current activity) something like 24 hours to 3 days. I'd say that if among these there are four questions where the last activity dates back even longer it would be enough to drive attention to those questions without polluting the page with too much noise.&lt;/p&gt;&#xA;&lt;p&gt;Also it seems that an old unanswered question is poked far less frequently than every hour - either I am alarmingly inattentive or I misunderstand the quote above.&lt;/p&gt;&#xA;&lt;p&gt;Therefore I'd suggest&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;that each six hours an old question is poked to the top of the activity page&lt;/li&gt;&#xA;&lt;li&gt;independent of the questions' answering status&lt;/li&gt;&#xA;&lt;li&gt;independent of the votes on the question&lt;/li&gt;&#xA;&lt;li&gt;but ignoring closed questions&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I explicitely added the &amp;quot;indepentend of the votes&amp;quot; because I feel that especially &amp;quot;ancient&amp;quot; questions have generally lower votes (than recently posted ones) but seem as well attractive for the main page.&lt;/p&gt;&#xA;" OwnerUserId="1490" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-08-20T21:40:26.680" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="2065" PostTypeId="2" ParentId="2004" CreationDate="2014-08-20T22:41:21.750" Score="2" Body="&lt;p&gt;If you want to answer another question in order to gain the single upvote required to allow you to post to the protected question, I recommend clicking on the &lt;a href=&quot;https://codegolf.stackexchange.com/tags&quot;&gt;tags&lt;/a&gt; link at the top of the &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;questions page&lt;/a&gt; and choosing a tag that interests you. Not all questions on the site require golfing skills.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, you may find a challenge you would enjoy under &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, none of which require shortened code.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-08-20T22:41:21.750" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2067" PostTypeId="2" ParentId="2140" CreationDate="2014-08-21T04:22:01.033" Score="3" Body="&lt;h2&gt;Text Adventure Game&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your goal is to develop a complete text-based adventure game with the shortest code possible.&#xA;The player navigates in a dungeon composed of rooms. The game objectives are to find the treasure, slain the dragon and rescue the princess.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A room description is as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;You are in &amp;lt;description&amp;gt;.&#xA;You can go &amp;lt;exits&amp;gt;&#xA;You see &amp;lt;object&amp;gt;      (optional)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;exits&lt;/strong&gt; can be &quot;north&quot;, &quot;east&quot;, &quot;west&quot;, &quot;south&quot;.  &lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;description&lt;/strong&gt; can be &quot;a &lt;em&gt;adjective&lt;/em&gt; cavern&quot;, &quot;a &lt;em&gt;adjective&lt;/em&gt; room&quot;, &quot;a &lt;em&gt;adjective&lt;/em&gt; corridor&quot;, &quot;a &lt;em&gt;adjective&lt;/em&gt; hall&quot;, &quot;a cell&quot;,  &quot;the dragon's lair&quot;.  &lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;adjective&lt;/strong&gt; can be &quot;dark&quot;, &quot;murky&quot;, &quot;small&quot;, &quot;large&quot;, &quot;narrow&quot;, &quot;gloomy&quot;, &quot;huge&quot;, &quot;strange&quot;, &quot;tiny&quot;, &quot;broad&quot;, &quot;old&quot;.  &lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;object&lt;/strong&gt; can be &quot;the princess&quot;, &quot;the dragon&quot;, &quot;a troll&quot;, &quot;a goblin&quot;, &quot;a sword&quot;, &quot;gold&quot;, &quot;a key&quot;, &quot;a trunk&quot;. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Exit list must be comma-separated and end with &quot;and&quot;. If there is no object in the room, the last line is omitted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example of valid description:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;You are in a murky room.&#xA;You can go north, east and south.&#xA;You see a goblin.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The game accepts the following commands (case is ignored) :  &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;GO direction&lt;/strong&gt; : &lt;em&gt;direction&lt;/em&gt; can be NORTH, EAST, WEST, SOUTH  &lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;TAKE item&lt;/strong&gt; : &lt;em&gt;item&lt;/em&gt; can be SWORD, GOLD, KEY  &lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;KILL monster&lt;/strong&gt; : &lt;em&gt;monster&lt;/em&gt; can be DRAGON, TROLL, GOBLIN. The DRAGON and the TROLL can be killed only if the user has the SWORD. If he hasn't, he loses the game. The weak GOBLIN can be killed with bare hands. When a monster dies, he disappears from the room. When the GOBLIN dies, he drops a SWORD. When the TROLL dies, he drops a KEY. &lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;KISS person&lt;/strong&gt; : person can be PRINCESS, DRAGON, TROLL, GOBLIN. Kissing the princess validates one of the objective of the game, and the princess disappears from the room. Kissing a monster results in player death.  &lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;OPEN object&lt;/strong&gt; : object can be TRUNK. If the player has the KEY, the TRUNK object disappears and is replaced with GOLD.  &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;OBJECTS&lt;/strong&gt;&lt;br&gt;&#xA;The player can perform an action on an object only if the object is in current room. A room can contain only one object ; a given object can be found in only one room. At the beginning of the game, only the following objects are placed in the map : PRINCESS, DRAGON, TROLL, GOBLIN, TRUNK. Other objects are not yet created.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;ACTIONS&lt;/strong&gt;  &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If an action cannot be performed (e.g. GO NORTH where there is no exit to the north, or TAKE DRAGON, or DANCE GANGNAM STYLE), the message &quot;Sorry, I can't do that&quot; must be displayed.  &lt;/li&gt;&#xA;&lt;li&gt;If an action can be performed, the message &quot;OK&quot; and the current room description should be displayed.&lt;/li&gt;&#xA;&lt;li&gt;You can read game commands from console or as a program parameter, as you wish.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;MAP&lt;/strong&gt;&lt;br&gt;&#xA;The dungeon should have at least 30 rooms. The dungeon should not contains a series of more than 5 exits in the same direction. The exits between rooms must be consistent, e.g. if you go north from room #1 to room #2, there must a south exit in room #2 leading back to room #1.&#xA;Every room name should be unique. There must be at least one room of each kind (hall, cavern, corridor...)&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A hall has at least 3 exits. &lt;/li&gt;&#xA;&lt;li&gt;A corridor can have only 2 exits.&lt;/li&gt;&#xA;&lt;li&gt;The cell has only one exit.  &lt;/li&gt;&#xA;&lt;li&gt;There is only one dragon's lair and only one cell, containing respectively the dragon and the princess.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;GAME END&lt;/strong&gt;&lt;br&gt;&#xA;The game ends when the player has been killed, or when he has taken the gold, slain the dragon and kissed the princess. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the player dies, the message &lt;em&gt;&quot;You have been killed by X !&quot;&lt;/em&gt; is displayed, with X being the name of the monster. &lt;/li&gt;&#xA;&lt;li&gt;If the player wins, the message &lt;em&gt;&quot;Well done adventurer ! you've conquered the dungeon.&quot;&lt;/em&gt; is displayed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Player should not be able to win the game in less than 40 turns.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;You are in a murky room.&#xA;You can go north, east and south.&#xA;You see a goblin.&#xA;&amp;gt; KILL GOBLIN&#xA;Ok.&#xA;You are in a murky room.&#xA;You can go north, east and south.&#xA;You see a sword.&#xA;&amp;gt; TAKE SWORD&#xA;Ok.&#xA;You are in a murky room.&#xA;You can go north, east and south.&#xA;&amp;gt; GO NORTH&#xA;Ok.&#xA;You are in a narrow corridor.&#xA;You can go south and east.  &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;The shortest code wins.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="13798" LastEditorUserId="13798" LastEditDate="2014-08-21T10:46:33.037" LastActivityDate="2014-08-21T10:46:33.037" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="2068" PostTypeId="2" ParentId="2054" CreationDate="2014-08-21T06:10:50.937" Score="6" Body="&lt;p&gt;&lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I click on the &quot;show &lt;em&gt;N&lt;/em&gt; more comments&quot; link, comments do not show up with the userscript enabled.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Z85Kc.gif&quot; alt=&quot;Sandbox comments with userscript enabled&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="9275" LastActivityDate="2014-08-21T06:10:50.937" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2070" PostTypeId="2" ParentId="2140" CreationDate="2014-08-21T13:14:12.587" Score="0" Body="&lt;h1&gt;Analyze Tonguetwisters  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/natural-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;natural-language&amp;#39;&quot; rel=&quot;tag&quot;&gt;natural-language&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a program which will accept an English tonguetwister, search for commonly used sounds and decide why it is difficult to pronounce.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Calculate the frequency of every sound used in the input sentence.&lt;/li&gt;&#xA;&lt;li&gt;Count identical sounds (for example, &lt;code&gt;ea&lt;/code&gt; and &lt;code&gt;ee&lt;/code&gt;) as the same thing.&lt;/li&gt;&#xA;&lt;li&gt;Ignore those sound groups (see below) which occur less than 0.1 times per character of the input.&lt;/li&gt;&#xA;&lt;li&gt;From the sounds that remain, group members of the same group together and separate by a forward slash (&lt;code&gt;/&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Arrange the groups by decreasing number of occurences.&lt;/li&gt;&#xA;&lt;li&gt;Separate groups by commas.&lt;/li&gt;&#xA;&lt;li&gt;Output.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Identical Sounds [under construction]&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ee = ea (in step 2, replace ea by ee)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Sound Groups [under construction]&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;e,ee&#xA;s,sh,c,ch&#xA;f,th,ph&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;She sells sea-shells on the sea-shore.&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: &lt;code&gt;s/sh,e/ee&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;The seething sea ceaseth and thus the seething sea sufficeth us.&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: &lt;code&gt;s/c,e/ee&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Receive input on STDIN, as command-line arguments or otherwise. You may not expect it to be stored in a variable.&lt;/li&gt;&#xA;&lt;li&gt;Output to STDOUT or equivalent.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/standard-loopholes-which-are-no-longer-funny&quot;&gt;Standard loopholes&lt;/a&gt; are banned.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user16402" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2014-08-21T13:14:12.587" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2073" PostTypeId="2" ParentId="2028" CreationDate="2014-08-21T22:11:15.680" Score="79" Body="&lt;p&gt;My previous answer was criticised for not drawing a line in a sand, so following some discussion on chat I propose a line.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Executive Summary&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A purported programming language should be accepted as such if and only if it is capable of addition of natural numbers and primality testing of natural numbers.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;More precise description&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The language must:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Support a representation of natural numbers and of tuples. (We're talking about languages rather than implementations, so we will leave to one side the issue of type widths).&lt;/li&gt;&#xA;&lt;li&gt;Be able either to transform inputs into outputs (&lt;em&gt;transformational model&lt;/em&gt;) or to distinguish an &quot;accepted&quot; input from a &quot;rejected&quot; input (&lt;em&gt;decision model&lt;/em&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Be able to take two natural numbers and add them. In the transformational model, this means transforming an input tuple of two numbers into an output which correctly represents their sum. In the decision model this means deciding whether an input contains the representation of a tuple of three natural numbers such that the third is the sum of the first two.&lt;/li&gt;&#xA;&lt;li&gt;Be able to take a natural number and say whether or not it is a prime. In the transformational model this means transforming a natural number into the representation of &lt;code&gt;0&lt;/code&gt; or &lt;code&gt;1&lt;/code&gt; according to whether it is a composite or a prime number. In the decision model it means accepting precisely those inputs which represent a prime.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Observations.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In roughly decreasing order of importance.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This definition does not require a language to be Turing-complete (although it certainly permits any Turing-complete language). This is intentional. Turing-completeness is unnecessary for many problems on this site, and there are interesting non-Turing-complete languages and interesting languages whose status with respect to Turing-completeness is unknown.&lt;/li&gt;&#xA;&lt;li&gt;My original aim was to capture the intuition of accepting primitive-recursive languages. However, I considered that primality testing is a lot easier to explain and to demonstrate, while requiring enough power that it probably doesn't include any undesirable &quot;language&quot;. The additional requirement to support addition is to exclude arguments about the &lt;code&gt;factor&lt;/code&gt; tool qualifying.&lt;/li&gt;&#xA;&lt;li&gt;Although some might object to the inclusion of the decision model, it corresponds more closely to the formal definitions of well-known complexity classes than the transformational model does.&lt;/li&gt;&#xA;&lt;li&gt;If you're using an obscure language, please add an entry to the list of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1213/194&quot;&gt;installation and testing instructions&lt;/a&gt; so that other people can test your code.&lt;/li&gt;&#xA;&lt;li&gt;This definition allows regex flavours which include backreferences. I don't consider this a problem.&lt;/li&gt;&#xA;&lt;li&gt;This definition excludes HQ9+. I don't consider this a problem either, for two reasons:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It was created as a joke rather than a language, and has ceased to be funny in the context of this site.&lt;/li&gt;&#xA;&lt;li&gt;I think that every interesting problem which HQ9+ can &quot;solve&quot; has already been asked, so I don't think this will exclude any interesting answers in the future.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2014-08-21T22:39:51.817" CommentCount="19" ContentLicense="CC BY-SA 3.0" />
  <row Id="2074" PostTypeId="2" ParentId="2140" CreationDate="2014-08-22T00:13:12.073" Score="2" Body="&lt;h2&gt;Old fashioned intelligence gathering&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As we've heard in the news, some intelligence agencies have decided to go back to typewriters due to the security hazards of the Internet.  You are a spy.  In spite of this change in policy to make messages more secure, one of your contacts scores an intelligence treasure trove: rolls of spent typewriter tape from your enemy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The only problem?  Whomever your enemy spy agency hired was a &lt;em&gt;really&lt;/em&gt; bad typist.  In fact, they tended to hit as many wrong keys as they did write.  So when you read out the first bit of tape, you see&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;DQSIRINKSFIJATOAPQFFOUSJAR&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Yikes.  That's some attrocious typing.  Seriously, there's training tools for that.  Anyways, you're in luck.  You &lt;em&gt;also&lt;/em&gt; scored the correction tape:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;QSIFIJOAPQFSJA&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;After racking your brain for hours, you realize someone just wanted some booze:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;DQSIRINKSFIJATOAPQFFOUSJAR  (ink tape)&#xA;-QSI-----FIJ--OAPQF---SJA-  (correction tape)&#xA;D---RINKS---AT-----FOU---R  &#xA;DRINKS AT FOUR              (message)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There's a lot of tape though, and you know there's some good intelligence information here, so you write an program to determine the original messages after filtering out the massive amounts of typos. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a return-delimited dictionary file&lt;/li&gt;&#xA;&lt;li&gt;ink tape letters (all caps)&lt;/li&gt;&#xA;&lt;li&gt;correction tape letters (all caps)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Output&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;all possible original messages ordered from fewest to most words in message; there shall be no specified ordered for messages with the same number of words.  If the intended message were &lt;code&gt;MY GRANDMOTHER HAS A LIFELONG PASSPORT&lt;/code&gt;, the output should generate the following (going from 6 words to 9 words):&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;MY GRANDMOTHER HAS A LIFELONG PASSPORT&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;MY GRAND MOTHER HAS A LIFELONG PASSPORT&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;MY GRANDMOTHER HAS A LIFE LONG PASSPORT&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;MY GRANDMOTHER HAS A LIFELONG PASS PORT&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;MY GRAND MOTHER HAS A LIFE LONG PASSPORT&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;MY GRAND MOTHER HAS A LIFELONG PASS PORT&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;MY GRANDMOTHER HAS A LIFE LONG PASS PORT&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;MY GRAND MOTHER HAS A LIFE LONG PASS PORT&lt;/code&gt;  &lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Other notes&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;all words in the original message will be spelled correctly (the typist was terrible, but they worked hard to eventually craft a correct sentence).&lt;/li&gt;&#xA;&lt;li&gt;you &lt;em&gt;may&lt;/em&gt; precapitalize your dictionary&lt;/li&gt;&#xA;&lt;li&gt;all messages are alpha only (no numbers or punctuation)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Scoring:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Code golf, shortest code wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Additional sample tapes your assistant decoded to use to test your algorithm:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;NUAFCLEAIEOJRWARWESHEADAJIOWGUNDSUIVHERCSNZXAPITASAOIDLBUIJOVEMOLDINGIAS (ink tape)&#xA;AFIEOJWESAJIOWGSUIVHSNZXSAOIDJOVEMOIAS (correction tape)&#xA;NUCLEAR WARHEAD UNDER CAPITAL BUILDING  (decoded messages)&#xA;NUCLEAR WAR HEAD UNDER CAPITAL BUILDING &#xA;&#xA;ASSLEDELPERIWECERSPDLLSACFSPTIVVOXATEIQPTREOIOSJFNMORROAIOW (ink tape)&#xA;ASDLIWERSPDFSPVOXIQPREOISJFNOAI (correction tape)&#xA;SLEEPER CELLS ACTIVATE TOMORROW (decoded messages)&#xA;SLEEPER CELLS ACTIVATE TO MORROW&#xA;&#xA;ASOIIJHAWQRATEMSDQPOYJKWEOABS (ink tape)&#xA;ASOIJWQRASDQPOKWEAS (correction tape)&#xA;I HATE MY JOB (decoded message)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="30284" LastEditorUserId="30284" LastEditDate="2014-08-29T20:48:48.927" LastActivityDate="2014-08-29T20:48:48.927" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2075" PostTypeId="2" ParentId="2140" CreationDate="2014-08-22T01:27:47.063" Score="1" Body="&lt;h1&gt;Making a dichotomous key&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;http://en.wikipedia.org/wiki/Single-access_key&quot; rel=&quot;nofollow&quot;&gt;dichotomous key&lt;/a&gt;, also known as a single-access key is often used to identify plants/animals. Your task is, given a set of data, write the shortest program that outputs the shortest (in steps) possible dichotomous key. If there are multiple solutions, the program may print either one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input will be received by &lt;code&gt;stdin&lt;/code&gt;, or in cases where that doesn't exist (e.g. Client-side javascript) you can take input from &lt;code&gt;prompt&lt;/code&gt; or something similar.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input will be a list of items followed by characteristics: The format of the definition of an item will be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;item[delimiter1]characteristic1[delimiter2]characteristic2[delimiter2]characteristic3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your program may choose the delimiters. In this example, I will use &lt;code&gt;:&lt;/code&gt; as delimiter one, and &lt;code&gt;,&lt;/code&gt; as delimeter 2. Between each item definition is &lt;code&gt;delimiter3&lt;/code&gt;, which will be &lt;code&gt;\n&lt;/code&gt; in this example (but you can make it anything that isn't &lt;code&gt;delimiter1&lt;/code&gt; or &lt;code&gt;delimiter2&lt;/code&gt;). Note that none of the delimeters can be &lt;code&gt;[a-zA-Z]&lt;/code&gt; letters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Characteristics and items are composed of a series of &lt;code&gt;[a-zA-Z]&lt;/code&gt; characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;quadrilateral:fourSides&#xA;trapezoid:fourSides,onePairParallel&#xA;parallelogram:fourSides,twoPairsParallel,oppositeSidesEqual&#xA;rectangle:fourSides,twoPairsParallel,fourRightAngles,oppositeSidesEqual&#xA;rhombus:fourSides,twoPairsParallel,oppositeSidesEqual,allSidesEqual&#xA;square:fourSides,twoPairsParallel,oppositeSidesEqual,allSidesEqual,fourRightAngles&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output should be written to &lt;code&gt;stdout&lt;/code&gt;, or &lt;code&gt;alert&lt;/code&gt; or something similar where it doesn't exist.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must output a characteristic followed by delimiter one, followed by two integers separated by delimiter two. The first is the step to go to if the item contains the characteristic, and the second is the step to go to if the item doesn't contain the characteristic. Note that the 1st step is considered &lt;code&gt;0&lt;/code&gt;. Alternatively, instead of an integer, you could have an item.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;twoPairsParallel:2,1&#xA;onePairParallel:trapezoid,quadrilateral&#xA;allSidesEqual:3,4&#xA;fourRightAngles:square,rhombus&#xA;fourRightAngles:rectangle,parallelogram&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is code-golf so shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="23550" LastEditorUserId="23550" LastEditDate="2014-08-22T21:37:07.857" LastActivityDate="2014-08-22T21:37:07.857" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2076" PostTypeId="1" CreationDate="2014-08-22T09:18:19.087" Score="2" ViewCount="127" Body="&lt;p&gt;It seems (from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2058/how-should-sandbox-retirement-be-handled-if-at-all&quot;&gt;this meta thread&lt;/a&gt;) that we are no longer intending to retire sandboxes, and I now approve of this plan. Because the answers can be sorted by activity, old posts will not clutter the sandbox and there is no need to retire it.&lt;/p&gt;&#xA;&lt;p&gt;Now that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1596/16402&quot;&gt;Mark XIII&lt;/a&gt; has been retired, and the only one currently active is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1847/16402&quot;&gt;Mark XIV&lt;/a&gt;, it shouldn't cause confusion to remove the number from the title of Mark XIV.&lt;/p&gt;&#xA;&lt;p&gt;If the current sandbox will not be retired, it makes sense not to leave the numbering stuck at XIV forever. The numbers in the title imply that sandboxes are going to be retired eventually, but if this is no longer the case, it is worth changing the title of the Mark XIV sandbox to reflect that it is now The Ultimate And Final Sandbox.&lt;/p&gt;&#xA;&lt;p&gt;It was also mentioned elsewhere on meta that the numbers confuse new users.&lt;/p&gt;&#xA;&lt;h1&gt;Should the numbering be removed from the title of the current sandbox?&lt;/h1&gt;&#xA;" OwnerDisplayName="user16402" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-08-27T02:01:28.923" Title="Remove numbering from sandbox title?" Tags="|discussion|status-completed|sandbox|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2077" PostTypeId="2" ParentId="2140" CreationDate="2014-08-22T09:43:27.787" Score="0" Body="&lt;h1&gt;Gun Fight at High Noon&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Gameplay&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This will be a 5 or 4 stage (the decision will be explained later) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; tournament where programs are pitched against each other to solve an integration problem faster than the other. The fastest will then go on to the next round.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Number of rounds:&lt;/strong&gt; Due to tournament bracketing, the number of rounds will be decided by the reception of the challenge. For four rounds, sixteen entrants are needed. For five rounds, thirty two entrants are needed.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The controller&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The controller will be written in Python, using time.time() as the timer. When run, it will time one entrant, print the output and time the other entrant and print the output. I will then put the results into a text file and post the results on the question.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The problem&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The problem will be a simple elementary function integration problem with long numbers included. These will be generated randomly when the controller is initiated and both entrants will be given the same problem. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;No inbuilt functions can be used to solve the problems&lt;/li&gt;&#xA;&lt;li&gt;If you fail to calculate the problem correctly, you will lose immediately&lt;/li&gt;&#xA;&lt;li&gt;In event of a tie, the match will be replayed with a different problem&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Inbuilt Functions&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Inbuilt functions include functions that solve integration problems themselves &lt;strong&gt;you must have a hand written integral solving algorithm in your code&lt;/strong&gt;. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example and Arguments&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;All information will be transferred via stdout and stdin. The integral will be in the following format:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://upload.wikimedia.org/math/0/3/4/034cf496a9d3026984fcae6cfa58608a.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;Integral http://upload.wikimedia.org/math/0/3/4/034cf496a9d3026984fcae6cfa58608a.png&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And &lt;code&gt;f(x)&lt;/code&gt; being like where a and n will be replaced for integers when passed to your program:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/39dwA.gif&quot; alt=&quot;f of x&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With arguments being passed like so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;programname a b f(x)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The reply will be stdout as a floating point integer to a precision of 5 decimal points. An example from one of my tests:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;~$ python3 showdowncontroller.py Test1 'python3 int1.py' Test2 'python3 int2.py'&#xA;A,B:        3,36&#xA;Function:   10*x**3&#xA;Result:     4199187.88575&#xA;&#xA;Test1: 0.04052305221557617 True 4199187.88575 &amp;lt;- name time correct? output&#xA;&#xA;Test2: 0.04041910171508789 True 4199187.88575&#xA;&#xA;&#xA;Win: Test2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The command run for each program was:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;python3 [program name].py 3 36 10*x**36&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And the response was:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4199187.88575&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Other&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In your answer you will need the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Name of your program&lt;/li&gt;&#xA;&lt;li&gt;Command to compile your program (if necessary)&lt;/li&gt;&#xA;&lt;li&gt;Command to run your program&lt;/li&gt;&#xA;&lt;li&gt;Your code&lt;/li&gt;&#xA;&lt;li&gt;A short description of your integration method&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your program can be in any language as long as I can compile and run it on Ubuntu 12.04 Precise.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There will be a 0.00005 error tolerance: any more or any less and your program will lose the match. The controller uses &lt;a href=&quot;http://en.wikipedia.org/wiki/Simpson%27s_rule&quot; rel=&quot;nofollow noreferrer&quot;&gt;Simpson's Rule&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;# Generate numbers&#xA;a=random.randint(1, 50)&#xA;n=random.randint(1, 10)&#xA;b=random.randint(1, 50)&#xA;c=random.randint(1, 50)&#xA;&#xA;# Integration using the Simpson method&#xA;def integrate(f, a, b):&#xA;   h = (b-a)/100&#xA;   meth = lambda f,x,h: (f(x) + f(x+h))/2.0&#xA;   ival = Decimal(h * sum(meth(f, a+i*h, h) for i in range(100)))&#xA;   return ival &#xA;&#xA;# Call function&#xA;func = lambda x: eval(str(a)+'*x**'+str(n))&#xA;result = round(integrate(func, c, b), 5)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Test programs will be posted with their running times so people can tell how fast my computer is. I will post no hardware specifications (processor type, speed) though - that will remain a mystery.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Controller code&lt;/h2&gt;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;# Gun Fight at High Noon&#xA;import subprocess, random, time, sys&#xA;from decimal import Decimal&#xA;&#xA;# Get program names&#xA;prog1 = sys.argv[1]&#xA;prog1command = sys.argv[2]&#xA;prog2 = sys.argv[3]&#xA;prog2command = sys.argv[4]&#xA;&#xA;# Generate numbers&#xA;a=random.randint(1, 50)&#xA;n=random.randint(1, 10)&#xA;b=random.randint(1, 50)&#xA;c=random.randint(1, 50)&#xA;&#xA;# Integration using the Simpson method&#xA;def integrate(f, a, b):&#xA;   h = (b-a)/100&#xA;   meth = lambda f,x,h: (f(x) + f(x+h))/2.0&#xA;   ival = Decimal(h * sum(meth(f, a+i*h, h) for i in range(100)))&#xA;   return ival &#xA;&#xA;# Call function&#xA;func = lambda x: eval(str(a)+'*x**'+str(n))&#xA;result = round(integrate(func, c, b), 5)&#xA;function=str(a)+'*x**'+str(n)&#xA;&#xA;print('A,B:     '+str(c)+','+str(b))&#xA;print('Function:    '+function)&#xA;print('Result:      '+str(result))&#xA;&#xA;# Run program and evaluate output&#xA;def runprog(command, result, f, a, b):&#xA;    start = time.time()&#xA;    answer = subprocess.Popen(command+' '+str(a)+' '+str(b)+' '+f, stdout=subprocess.PIPE, shell=True).communicate()[0].decode('utf-8')&#xA;    end = time.time()&#xA;    elapsed = end-start&#xA;&#xA;    if Decimal(answer) &amp;gt; result-Decimal(0.00005) and Decimal(answer) &amp;lt; result+Decimal(0.00005):&#xA;        correct = True&#xA;    else:&#xA;        correct = False&#xA;&#xA;    return elapsed, correct, answer&#xA;&#xA;p1time, p1correct, p1answer = runprog(prog1command, result, function, c, b)&#xA;p2time, p2correct, p2answer = runprog(prog2command, result, function, c, b)&#xA;&#xA;print('\n'+prog1+': '+str(p1time)+' '+str(p1correct)+' '+p1answer)&#xA;print(prog2+': '+str(p2time)+' '+str(p2correct)+' '+p2answer)&#xA;&#xA;if p1correct:&#xA;    if p2correct:&#xA;        if p1time &amp;lt; p2time:&#xA;            print('\nWin: '+prog1)&#xA;        elif p1time == p2time:&#xA;            print('\nTie')&#xA;        else:&#xA;            print('\nWin: '+prog2)&#xA;    else:&#xA;        print('\nWin: '+prog1)&#xA;else:&#xA;    if p2correct:&#xA;        print('\nWin: '+prog2)&#xA;    else:&#xA;        print('\nTie')&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="30525" LastEditDate="2014-08-22T15:56:32.520" LastActivityDate="2014-08-22T15:56:32.520" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="2079" PostTypeId="2" ParentId="2140" CreationDate="2014-08-22T11:10:17.090" Score="1" Body="&lt;h1&gt;XKCD: (Battle of the) Hats&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://imgs.xkcd.com/comics/hats.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://imgs.xkcd.com/comics/hats.png&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Enough background, get into the game&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You all started at a point. At the count on 3, you decides to wear yourself 1 black hat, 2 black hats or 1 white hat.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's what happened: (If you find this description confusing, you can look at the table below, credit to Peter Taylor)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;If you use 1 black hat -&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-&gt; If your opponent also uses 1 black hat or white hat, your opponent moves backward 1 step.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-&gt; If your opponent uses 2 black hats, you have 50% chance making your opponent moves 2 steps backward. Else your opponent does nothing.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;If you use 2 black hats -&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-&gt; If your opponent doesn't use white hat, your move is considered successful 2 black hats attempt. Your opponent moves backward x+3 steps, where x is # of your previous successful 2 black hats attempt.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-&gt; Else: Your attack gives no effect.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;If you use white hat -&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-&gt; If your opponent use 2 black hat, you're considered making successful white hat attempt. Your opponent moves backward y+3 steps, where y is # of your previous successful white hat attempt.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-&gt; Else: You're considered making a failed white hat attempt. &lt;b&gt;You&lt;/b&gt; move backward z+3 steps, where z is # of your previous &lt;b&gt;failed&lt;/b&gt; white hat attempt.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The game ends when somebody moves 20 step backward or 10 rounds played.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If one person moves 20 or more steps backward while one doesn't, then the one who not is declared the winner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If both moves 20 or more steps backward in the same round or no one moves 20 or more steps backward in 10 rounds, no one win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your bot will play 5 tournaments. In each tournament, you face each enemy once. The player who score most win in those 5 tournaments accumulated, is declared the champion&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Communication Protocol&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your bot will get this from STDIN:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;id round step0 step1 move0 move 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;id&lt;/code&gt; is your player id, can be 0 or 1; &lt;code&gt;round&lt;/code&gt; means current round (match starts at Round 1); &lt;code&gt;step0&lt;/code&gt; and &lt;code&gt;step1&lt;/code&gt; means how many step has player 0 and player 1 has taken; &lt;code&gt;move0&lt;/code&gt; and &lt;code&gt;move1&lt;/code&gt; is the move taken by player 0 and player 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In first round, move 0 and move 1 will be empty. In next round, it will the move as this&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;12w21&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This means one player use 1 black hat; 2 black hats;  white hat; 2 black hats; 1 black hat, respectively.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your bot gives me output from your STDOUT as &lt;code&gt;1&lt;/code&gt; if your bot want to wear 1 black hat, &lt;code&gt;2&lt;/code&gt; if your bot want to wear 2 black hats, &lt;code&gt;w&lt;/code&gt; if your bot want to wear white hat.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;PS: Do aware that I use small-case &quot;w&quot;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Table:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;                +--------------------+--------------------+---------------------+&#xA;                |                    |     P0 action      |                     |&#xA;                |         1          |         2          |          w          |&#xA;+---------------+--------------------+--------------------+---------------------+&#xA;|             1 | P0 back 1          | P0 back 0 or 2     | P0 back z0+4; z0++  |&#xA;|               | P1 back 1          | P1 back x0+3; x0++ | .                   |&#xA;+---------------+--------------------+--------------------+---------------------+&#xA;| P1 action   2 | P0 back x1+3; x1++ | P0 back x1+3; x1++ | .                   |&#xA;|               | P1 back 0 or 2     | P1 back x0+3; x0++ | P1 back y0+3; y0++  |&#xA;+---------------+--------------------+--------------------+---------------------+&#xA;|             w | .                  | P0 back y1+3; y1++ | P0 back z0+3; z0++  |&#xA;|               | P1 back z1+4; z1++ | .                  | P1 back z1+3; z1++  |&#xA;+---------------+--------------------+--------------------+---------------------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="20738" LastEditorUserId="20738" LastEditDate="2014-08-22T12:03:22.397" LastActivityDate="2014-08-22T12:03:22.397" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="2080" PostTypeId="2" ParentId="2076" CreationDate="2014-08-22T11:14:26.243" Score="9" Body="&lt;p&gt;First of all, a difference of two votes (one of which is mine) is in no way a consensus. It's still not entirely clear what we're eventually going to do with the sandboxes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, if we &lt;em&gt;do&lt;/em&gt; end up choosing the &quot;one sandbox to rule them all&lt;sup&gt;*&lt;/sup&gt;&quot; thing, there would probably be two likely options:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Merge all the current sandboxes together, and this merged post now becomes The One Sandbox&lt;/li&gt;&#xA;&lt;li&gt;Merge all the current sandboxes together, create a new one, and the new one becomes The One Sandbox; the old one becomes Sandboxes of Ancient Times or something&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;We would only take the second option if we feel that there are already too many posts in the old sandboxes to continue adding on to.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;*:&#xA;&lt;em&gt;One Sandbox to rule them all, One Sandbox to find them&lt;br&gt;&#xA;One Sandbox to bring them all, and in the darkness merge them&lt;/em&gt;&lt;br&gt;&#xA;&lt;sub&gt;&lt;em&gt;(in the Land of Meta where the Shadows lie)&lt;/em&gt;&lt;/sub&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-08-22T11:14:26.243" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2082" PostTypeId="2" ParentId="1324" CreationDate="2014-08-23T22:10:29.497" Score="-1" Body="&lt;h1&gt;Write a function&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I propose this as the default for code golf questions that as for a function rather than a full program. I'm sorry if this all seems overly pedantic, but I've seen every single one of these points come up in actual questions and answers, and I'd like to have comprehensive rulings on them available.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I must admit I have a limited knowledge of languages, especially esoteric ones, so I welcome suggestions to make this more accessible to a wide class of languages.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;1) The code must result in a named function (or analogous execution unit in your language) that fits the specifications.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2) The function, when called by name on its inputs, must evaluate to the desired outputs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;3) There can be code outside the function definition, whose characters are also counted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;4) Calling the function multiple times must produce the right answer each time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;5) Optional additional parameters are acceptable; mandatory additional parameters are not.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Explanations&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The spec is meant to capture the idea that a function, once created, should be usable to transform inputs to outputs in the fashion asked for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;1) The code must result in a named function (or analogous execution unit in your language) that fits the specifications.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While in C-style languages, the function is usually created by a function definition, this allows for other methods such as a lambda-expression like &lt;code&gt;f=lambda x:x*x&lt;/code&gt; or a composition &lt;code&gt;f=compose(g,h)&lt;/code&gt; or a decoration &lt;code&gt;f=memoize(f)&lt;/code&gt; as long as the result is saved to a variable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;2) The function, when called by name on its inputs, must evaluate to the desired outputs.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This captures the requirement that the function be a function. Its inputs should be passed in, rather than taken through STDIN or taken from a global valuable. Its value must be returned, rather than saved to a variable or printed. To be clear, this does not mean an invocation of the function by included in the code, but that the function must behave as desired in invoked.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;3) There can be code outside the function definition, whose characters are also counted.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This rule is an assurance that even if asked for a function, your code doesn't entirely have to do that function. Programs might make imports, saved global variable, and define auxiliary functions outside that function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;4) Calling the function multiple times must produce the right answer each time.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In other words, it's not acceptable to have your function only work the first time. Subsequent calls within a single run should also work according to the spec. This could come up if the function modifies a global value.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This does not preclude the function modifying the value it was passed in. So, the function &lt;code&gt;f&lt;/code&gt; should print the same output twice on &lt;code&gt;print f(1,2); print f(1,2)&lt;/code&gt; but not necessarily &lt;code&gt;l=[1,2]; print f(l); print f(l)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/36572/20260&quot;&gt;Here's an answer&lt;/a&gt; where this question can up in practice, with Falko's suggestion to save a character by defining the initial list as an optional parameter &lt;code&gt;def f(a,b=[0]*1000):&lt;/code&gt; causes it to be overwritten for subsequent runs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;5) Optional additional parameters are acceptable; mandatory additional parameters are not.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In other words, if asked for a function that takes two numbers, it's fine to have one that takes two numbers and an optional third number, as long as it behaves as asked when given only two numbers. The reasoning is that this would pass any test according to the specs, so it can behave arbitrarily in the non-spec case of three numbers. However, having a mandatory additional parameter and saying &quot;call &lt;code&gt;f&lt;/code&gt; as &lt;code&gt;f(a,b,0)&lt;/code&gt; does not fit the spec.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An optional additional parameter might be useful for golf to define a recursive function or to save a method name to a variable before the function body.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Things not addressed&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input/outputs formats:&lt;/strong&gt; If asked for a function that takes no numbers, can yours instead take a list/array/tuple of two numbers? Can you output a float if asked for a whole number?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Fallbacks:&lt;/strong&gt; What should a language that does have functions do? I think this should be addressed with a general convention of &quot;Do the closest you can, but only if what was required was impossible in the language.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2014-08-24T20:52:04.410" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="2083" PostTypeId="1" AcceptedAnswerId="2084" CreationDate="2014-08-24T10:52:31.827" Score="6" ViewCount="105" Body="&lt;p&gt;I write a question. To make it easier for the answerers to test their answers, it is obvious that I should provide at least one test case and the expected output -- otherwise it may be difficult for the answerers to know if their solution is correct or not. I usually only include one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it considered best practice on PPCG to include two or more sample test cases?&lt;/p&gt;&#xA;" OwnerUserId="21682" LastActivityDate="2014-08-24T11:07:20.440" Title="How many sample test cases should I include in my question?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2084" PostTypeId="2" ParentId="2083" CreationDate="2014-08-24T11:07:20.440" Score="8" Body="&lt;p&gt;The right number of test cases depends largely on your problem. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In most challenges, ideally, the set of test cases should together cover all relevant edge cases. If there are no edge cases (i.e. all inputs are to be processed identically), then one or two test cases will suffice. Otherwise, you should probably provide more.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, if the challenge is more of a puzzle nature, then you might not want to give the game away by providing too many examples.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Likewise, for optimisation challenges you should provide a few examples to show what valid solutions look like, but you don't need to show what optimal solutions look like.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-08-24T11:07:20.440" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2085" PostTypeId="1" CreationDate="2014-08-24T15:49:11.143" Score="6" ViewCount="155" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/36645/brainfuckedbotsforbattling-a-brainfuck-tournament&quot;&gt;Brainfucked Bots&lt;/a&gt; is a clone of &lt;a href=&quot;http://esolangs.org/wiki/BF_Joust&quot; rel=&quot;nofollow noreferrer&quot;&gt;BF Joust&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/32267/play-the-bzzt-game&quot;&gt;Bzzt&lt;/a&gt; is very similar to &lt;a href=&quot;http://c2.com/cgi/wiki?FizzBuzzTest&quot; rel=&quot;nofollow noreferrer&quot;&gt;FizzBuzz&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/35459/create-a-fizzbuzz-compiler&quot;&gt;FizzBuzz Compiler&lt;/a&gt; was effectively FizzBuzz before its scoring was changed&lt;/p&gt;&#xA;&#xA;&lt;p&gt;etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In challenges like this, where years of thought have been put into optimal solutions during competitions elsewhere, it is very unlikely that an original answer is going to win. The best answer already exists on the internet, and someone (or multiple someones) is going to submit it, or a small variation on it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This concern also applies to ideas posted elsewhere on meta to intentionally repost challenges from sites like SPOJ or Programming Praxis or Project Euler, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Are questions like this really suitable here? What do we want, or expect, to see in the answers?&lt;/p&gt;&#xA;" OwnerUserId="4787" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-08-24T23:41:08.013" Title="Are well-studied or classic problems suitable for PP&amp;CG?" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2086" PostTypeId="1" AcceptedAnswerId="2087" CreationDate="2014-08-24T21:20:46.510" Score="5" ViewCount="181" Body="&lt;p&gt;We are still in beta and, as far as I know, stuck with the standard beta user interface of stack exchange sites. But clearly other stack exchanges have custom layouts and graphics for their logo, favicon, buttons, etc.:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/9nIRG.png&quot; alt=&quot;ee se&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my quick search I've found &lt;a href=&quot;https://meta.stackexchange.com/questions/64169/themes-on-stackexchange&quot;&gt;very little definitive information&lt;/a&gt; on how these graphics are chosen and who designs them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My main questions are:  &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Can we the users help design the interface for PPGC for the eventual day when it graduates from beta? (If it ever does.)&lt;/li&gt;&#xA;&lt;li&gt;Would programming puzzles that involved the creation of these graphics/layouts be out of place on PPGC?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;I'm sure some more experienced users can chime in for the first question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for the second, I know that, say, a popularity contest for designing upvote and downvote button graphics might be more of an art contest, whose validity is not always certain and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1947/the-line-between-art-and-programming&quot;&gt;has been discussed before&lt;/a&gt;.&lt;br&gt;&#xA;However I believe that such a contest, properly formulated, would be quite interesting to many users, &lt;strong&gt;&lt;em&gt;especially&lt;/em&gt;&lt;/strong&gt; if it was known that the winner's graphics would really be used once the site goes out of beta. (Exactly what constitutes such a &quot;properly formulated&quot; question is another topic.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It seems very fitting that obfuscated chunks of code would be used to generate most of the graphics on one of the foremost programming puzzle websites.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(If you think &quot;art contests&quot; are out of the questions, what about having &quot;logo contests&quot; on meta. We already had one for favicons: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/788/our-favicon-is-ugly-and-asymmetric-lets-fix-it/822#822&quot;&gt;Our favicon is ugly and asymmetric. Let&amp;#39;s fix it!&lt;/a&gt;, though I don't know if it did or even could get anywhere.)&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-08-24T21:36:11.130" Title="Would PPCG user interface design contests be out of place?" Tags="|discussion|user-interface|" AnswerCount="1" CommentCount="0" ClosedDate="2021-06-03T23:35:30.433" ContentLicense="CC BY-SA 3.0" />
  <row Id="2087" PostTypeId="2" ParentId="2086" CreationDate="2014-08-24T21:36:11.130" Score="7" Body="&lt;p&gt;Sites only get custom designs, UI elements, etc. after graduation. The community typically has very little influence on this, and it is done by a professional designer at Stack Exchange.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, once the design is complete, users are asked to give feedback and suggest improvements. For an example of this process, see &lt;a href=&quot;https://academia.meta.stackexchange.com/q/891/14308&quot;&gt;Academia.SE's site design meta post.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T15:50:17.357" LastActivityDate="2014-08-24T21:36:11.130" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2088" PostTypeId="2" ParentId="2085" CreationDate="2014-08-24T23:41:08.013" Score="7" Body="&lt;h3&gt;Inspired by is welcome&lt;/h3&gt;&#xA;&lt;p&gt;I don't see any problem with posting questions inspired by known solved problems, where the answers will not just be the known solutions copied and pasted. If a problem has been solved but not golfed, it can still make an interesting golf question. If a problem has been golfed elsewhere but not optimised, it may make an interesting code challenge. If the question adds a non-trivial extra challenge or new perspective I welcome it.&lt;/p&gt;&#xA;&lt;h3&gt;Identical is boring&lt;/h3&gt;&#xA;&lt;p&gt;I agree that asking the same question with no changes is boring. Even if you take the approach of tackling the question without looking at the known answers, it's not as fun to compete against people knowing some of them will be basing their answers on existing research.&lt;/p&gt;&#xA;&lt;h3&gt;Know the difference&lt;/h3&gt;&#xA;&lt;p&gt;What I would be wary of is genuinely new questions being closed hastily because they appear to have known solutions. This could be a problem where the difference is subtle but rules out existing known solutions. Also a question that genuinely is already solved could be tweaked to be more interesting, so could still make a good question eventually. In either case I would encourage comments to let the question poster know that clarification would help.&lt;/p&gt;&#xA;&lt;h3&gt;Off-site duplicates&lt;/h3&gt;&#xA;&lt;p&gt;I'd be inclined to close vote if there's any doubt what the question poster intended, to make sure any required changes are made before answers come in. However if it's already clear that the intention is to post a solved problem, then I wouldn't close vote as it isn't an on-site duplicate, even if it is clearly an off-site duplicate.&lt;/p&gt;&#xA;&lt;p&gt;I would be happy to reject such off-site duplicates if we had a change to our guidelines, but under current guidelines I don't see them as something to close, just something boring to consider down voting.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-08-24T23:41:08.013" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2089" PostTypeId="2" ParentId="1638" CreationDate="2014-08-25T10:52:41.803" Score="0" Body="&lt;p&gt;The question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/36645/brainfuckedbotsforbattling-a-brainfuck-tournament&quot;&gt;BrainFuckedBotsForBattling - A Brainfuck Tournament&lt;/a&gt; has appeared a few times in the Hot Network Questions feed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;To the uninitiated observer from another SE site, what could &quot;Brainfuck&quot; possibly mean?&lt;/strong&gt; Most people who see the Hot Network Questions feed will not know that Brainfuck is a programming language, and may take this as an insult or some devious scheme.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Perhaps we should block or censor &quot;brainfuck&quot; in question titles to avoid this? (EDIT: &lt;a href=&quot;https://meta.stackexchange.com/q/238577/212780&quot;&gt;It's been confirmed that titles with &quot;fuck&quot; will no longer show up in the HNQ list.&lt;/a&gt;)&lt;/p&gt;&#xA;" OwnerDisplayName="user16402" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2014-08-26T13:29:37.773" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2090" PostTypeId="1" AcceptedAnswerId="2091" CreationDate="2014-08-25T12:02:47.733" Score="14" ViewCount="392" Body="&lt;p&gt;Over the years a lot of challenges have accumulated in the sandbox(es) which never made it to being posted on main. Some of these were probably abandoned because they were duplicates or had unfixable problems, but many of them are probably salvageable or were simply forgotten.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;People regularly ask how we could increase our question volume, and I believe that there's a lot of good content rotting in the old sandboxes. Is there anyway we could use those old ideas and still bring them to main?&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2014-08-25T12:13:18.723" LastActivityDate="2014-09-01T14:07:05.060" Title="Can we make use of abandoned sandbox posts?" Tags="|discussion|policy|sandbox|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2091" PostTypeId="2" ParentId="2090" CreationDate="2014-08-25T12:02:47.733" Score="31" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2056/how-does-the-sandbox-work-how-do-i-use-it&quot;&gt;&lt;strong&gt;This is now part of the community FAQ.&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I suggest that abandoned challenge proposals should be free for others to use as they see fit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First of all, there are no licence problems with this. All SE posts are licensed under &lt;a href=&quot;http://creativecommons.org/licenses/by-sa/2.5/&quot; rel=&quot;nofollow noreferrer&quot;&gt;CC BY-SA&lt;/a&gt;, which allows modification and redistribution as long as the original source (original author) is attributed. So everything that is holding us back is good manners.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As stated in the question, I think that we're missing out on a lot of good content by ignoring unposted challenges. Hence, by setting up a few rules of courtesy, we should be able to make sue of that content without anyone feeling that their idea has been stolen from them:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a challenge proposal was not edited or commented on for &lt;strong&gt;a month&lt;/strong&gt;, you can leave a comment that you would like take over the challenge, get it ready for main and post it.&lt;/li&gt;&#xA;&lt;li&gt;If the OP does not reply within &lt;strong&gt;two weeks&lt;/strong&gt;, telling you that they still intend to post the challenge themselves, you are free to proceed with the challenge as you see fit.&lt;/li&gt;&#xA;&lt;li&gt;If the proposal is already in the newest sandbox, don't repost, just edit the existing post.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I just made up &quot;a month&quot; and &quot;two weeks&quot;, and I'm open to suggestions for better time frames.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's another reason, why I'm strongly recommending this policy. If we're going through with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2061/8478&quot;&gt;never retiring the sandbox&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1998/8478&quot;&gt;deleting posted challenges&lt;/a&gt;, then there are only two things left that will make the sandbox grow: generally increased activity on PPCG and challenges that were abandoned and hence never deleted. If we could claim those and still post them, that would make the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2080/8478&quot;&gt;One Sandbox&lt;/a&gt; much more feasible.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2014-09-01T14:07:05.060" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2092" PostTypeId="2" ParentId="2140" CreationDate="2014-08-25T12:38:57.453" Score="0" Body="&lt;p&gt;&lt;strong&gt;Rubik's Cube Simulator&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I had posted a rubik's cube question a few days back which turned out to be quite close to an existing one although I made a few amendments. This is a different question altogether.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The idea is to simulate operation of a rubik's cube.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;INPUT: Take a preset sticker configuration for each face as input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program must interpret the configuration and suggest a list of moves to generate the said configuration from a perfect Rubik's cube.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program must also check if the sticker combination is an invalid one, and print an error message saying that it is not possible to generate such a configuration.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Question should probably be used as a popularity contest given the length and complexity of code, but based on response, a code golf follow-up is on the cards.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Suggestions are most welcome.&lt;/p&gt;&#xA;" OwnerUserId="30757" LastActivityDate="2014-08-25T12:38:57.453" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2093" PostTypeId="2" ParentId="2140" CreationDate="2014-08-25T14:33:45.227" Score="1" Body="&lt;h1&gt;Confused Automatons &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;[work in progress]&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a 1v1 (or not? could be more) king-of-the-hill, where you and your opponent both issue commands to the same, perpetually confused, gladiators and try to survive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Toroidal arena with N gladiators. They understand the following simple commands:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;M&lt;/code&gt;ove one of 8 directions or &lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;H&lt;/code&gt;old&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;plus one of:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;S&lt;/code&gt;hoot target. Range of 5. Can’t shoot the following turn.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;D&lt;/code&gt;odge (no target required)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;N&lt;/code&gt;othing&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;On each turn you may issue one command (&lt;code&gt;[M/H]+[S/D/N]&lt;/code&gt;) to &lt;em&gt;each&lt;/em&gt; gladiator. All gladiators will execute the commands from &lt;em&gt;both&lt;/em&gt; players each turn. Movement happens first. If a gladiator is given two shoot commands, they will shoot twice that turn; two dodge commands and they will dodge twice. One dodge will avoid one shot. A gladiator can't shoot himself. Movement in opposite directions will cancel; movement in the same direction means moving a distance of two. If there is both an [H] command and an [M] command for the same gladiator, the [H] will be ignored.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One of the gladiators is your commander. You lose when your commander dies. Your commander ignores commands from your opponent. You don’t know which gladiator is your opponent’s commander.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;TBD&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;TBD&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;TBD&lt;/p&gt;&#xA;" OwnerUserId="29967" LastActivityDate="2014-08-25T14:33:45.227" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2095" PostTypeId="2" ParentId="2140" CreationDate="2014-08-25T19:32:37.797" Score="2" Body="&lt;h1&gt;The Tetris Tournament&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/11175/8478&quot;&gt;We've implemented Tetris before.&lt;/a&gt; But we haven't played it yet. So you're to write a bot which plays Tetris in real time!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We're playing standard Tetris. That is, there will be one falling &lt;a href=&quot;http://en.wikipedia.org/wiki/Tetromino&quot; rel=&quot;nofollow noreferrer&quot;&gt;one-sided tetromino&lt;/a&gt;, which you can move and rotate until it hits the bottom. Complete lines of blocks get cleared, which causes all lines above to shift down accordingly. You will always be aware of the next tetromino. The goal is to clear as many lines as possible while the game gets faster.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are the specifics of rules which differ among various Tetris implementations:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The board will be 10 blocks wide and 22 blocks tall. The top two rows are &quot;off-screen&quot;: tetrominoes will not spawn in the top two rows, but may be rotated into these.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;http://tetris.wikia.com/wiki/Nintendo_Rotation_System&quot; rel=&quot;nofollow noreferrer&quot;&gt;right-handed Nintendo Rotation System&lt;/a&gt; will be used (which is equivalent to the original rotation system). That is, each piece is basically in a square bounding box and cycles through 1 to 4 fixed patterns within that bounding box &lt;a href=&quot;http://tetris.wikia.com/wiki/Nintendo_Rotation_System?file=NESTetris-pieces.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;as given by this chart&lt;/a&gt;. Each tetromino will spawn in the first of its orientations such that its top-most blocks are in the top on-screen row, and the piece is centred horizontally (rounded to the left).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is no &lt;a href=&quot;http://tetris.wikia.com/wiki/Wall_kick&quot; rel=&quot;nofollow noreferrer&quot;&gt;wall kick&lt;/a&gt; or &lt;a href=&quot;http://tetris.wikia.com/wiki/Floor_kick&quot; rel=&quot;nofollow noreferrer&quot;&gt;floor kick&lt;/a&gt;. If a rotation would lead to overlapping or out-of-bounds blocks, it will be ignored.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is a &lt;a href=&quot;http://tetris.wikia.com/wiki/Lock_delay&quot; rel=&quot;nofollow noreferrer&quot;&gt;lock delay&lt;/a&gt; equal to current step duration. That is, tetrominoes lock into place when the controller tries to move them down but hits another block or the floor.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The sequence of tetrominoes is determined by the &lt;a href=&quot;http://tetris.wikia.com/wiki/Random_Generator&quot; rel=&quot;nofollow noreferrer&quot;&gt;Random Generator&lt;/a&gt;. That is, whenever the queue for pieces is empty, a random permutation of all 7 tetrominoes will be enqueued. I will add one exception to this: when the game starts, a random number of tetrominoes will be discarded from the first permutation, such that it's not immediately obvious where one ends and the next starts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;Pressing&quot; &lt;em&gt;down&lt;/em&gt; does a &lt;a href=&quot;http://tetris.wikia.com/wiki/Drop&quot; rel=&quot;nofollow noreferrer&quot;&gt;soft drop&lt;/a&gt;. In particular, it will move the tetromino down one row without resetting the timer for the next drop due to gravity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The game starts at level 0 and is incremented by 1 every 10 cleared lines.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Gravity will be such that tetrominoes move down one row every &lt;code&gt;0.1/(n+1)&lt;/code&gt; seconds, where &lt;code&gt;n&lt;/code&gt; is the current level.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The game ends when a tetromino spawns overlapping an existing block or any blocked is locked into one of the two off-screen rows at the top.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is &lt;a href=&quot;http://tetris.wikia.com/wiki/Hold_piece&quot; rel=&quot;nofollow noreferrer&quot;&gt;no hold piece&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Controller and the Bots&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The controller will simulate the game in real time, and provide you with the game state whenever you request it (as well as when the game starts).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At any time, your bot can write a single-character command as one of &lt;code&gt;[UDLRS]&lt;/code&gt; to STDOUT. The letters correspond to the following commands:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;U(p)&lt;/code&gt;: Rotate the current tetromino clockwise by 90 degrees. This will be ignored if the rotation would lead to a collision.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;D(own)&lt;/code&gt;: Move the current tetromino down a row. This may lock the current tetromino if moving it down would lead to a collision. In this case &lt;em&gt;only&lt;/em&gt; will the timer be reset such that you get the full time for the next tetromino's first move. Otherwise the timer will continue where it was before.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;L(eft)&lt;/code&gt;: Move the current domino one column to the left.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;R(ight)&lt;/code&gt;: Move the current domino one column to the right.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;S(tate)&lt;/code&gt;: Request the current game state in STDIN.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Don't forget to flush STDOUT after sending any of these commands.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the beginning of the game or if you send &lt;code&gt;S&lt;/code&gt; the controller will write the game state to STDIN in the following format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[seconds till gravity tick] [level] [lines cleared] [current tetromino] [next tetromino]&#xA;[10x22 representation of the board]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where the tetrominoes are represented as a letter from &lt;code&gt;[IOTJLSZ]&lt;/code&gt;. In the board representation, locked blocks are represented as &lt;code&gt;#&lt;/code&gt;, currently falling blocks as &lt;code&gt;*&lt;/code&gt; and empty tiles as &lt;code&gt;.&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your bot must not use more than 1GB of memory at any time.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Here is a state from an actual Tetris game and how it would be represented by the controller:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/WM49Q.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0.0467896 1 16 J I&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..***.....&#xA;....*.....&#xA;..........&#xA;.......###&#xA;...#######&#xA;.#########&#xA;#######..#&#xA;#####.####&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We will use the &lt;a href=&quot;http://tetris.wikia.com/wiki/Scoring&quot; rel=&quot;nofollow noreferrer&quot;&gt;Original Nintendo Scoring System&lt;/a&gt;: sending &lt;code&gt;D&lt;/code&gt; gives you 1 point. Clearing lines gives you 40, 100, 300, 1200 points for 1, 2, 3, 4 lines, respectively. Points for clearing lines are multiplied by &lt;code&gt;n+1&lt;/code&gt; where &lt;code&gt;n&lt;/code&gt; is the current level.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I will run each bot 10 (?) times and your final score will be maximum (?) achieved in any of those runs.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The controller still needs to be written, but I'd like the gather some general feedback regarding the spec (and how interesting the challenge is) first.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Along with the controller I'll provide a very stupid random bot to showcase how to set up the game loop with requesting the state from the controller.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any suggestions about figuring out the overall score from the individual runs? I guess I can't determine the number of runs before I know how much scores fluctuate and how long one run takes. But what would make most sense statistically? Mean, median, maximum?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let me know if anything else is unclear or could be improved!&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.653" LastActivityDate="2014-09-13T16:59:01.617" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2098" PostTypeId="1" CreationDate="2014-08-26T14:24:45.067" Score="9" ViewCount="260" Body="&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2020/3808&quot;&gt;A Better Help Center&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Our current help center is lacking in a number of ways (see the linked post for more details). Therefore, this is a Community Wiki post meant for collaboratively editing the &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;/help/on-topic&lt;/a&gt; page and improving it, to be optimally geared towards new users.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For minor edits, simply edit the body of this post. For major suggestions that you do not wish to apply yourself without prior community input, add an answer below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The initial text in this post is simply the current text of that page (which is the only help center article we can edit), with a few minor copy edits done by me.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Programming Puzzles &amp;amp; Code Golf&lt;/em&gt; is for programming contests and challenges. We welcome questions from beginners and experts alike.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All &lt;strong&gt;challenge questions&lt;/strong&gt; on this site should have:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A &lt;strong&gt;clear specification&lt;/strong&gt; of what constitutes a correct submission, so that it is possible to indisputably decide whether an entry is valid or not. Test cases are highly encouraged.&lt;/li&gt;&#xA;&lt;li&gt;An &lt;strong&gt;objective primary winning criterion&lt;/strong&gt;, so that it is possible to  indisputably decide which entry should win.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;These questions are surprisingly hard to write well. It is advisable to follow a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1511/194&quot;&gt;standard template&lt;/a&gt; and to post them first and get feedback in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/881&quot;&gt;meta Sandbox&lt;/a&gt; so that flaws can be fixed before someone posts an answer which exploits them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All &lt;strong&gt;solutions&lt;/strong&gt; to challenges should:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Correctly implement the required specification.&lt;/li&gt;&#xA;&lt;li&gt;Make a clear effort towards the winning criteria in use. For example, an entry to a &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;code golf&lt;/a&gt; contest needs to be golfed, and an entry to a speed contest should make some attempt to be fast.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Non-challenge questions that are are related to solving programming puzzles or a particular type of challenge are also on topic. However, if you have a general programming question, it should be asked on &lt;a href=&quot;http://stackoverflow.com&quot;&gt;Stack Overflow&lt;/a&gt; or a different &lt;a href=&quot;http://stackexchange.com/sites#technology-questions&quot;&gt;Stack Exchange site&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More information specific to code golf can be found in its &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;tag wiki&lt;/a&gt;. If you would like an in-depth description of a specific tag, simply click the &quot;learn more&quot; link on the tag's page to access the tag wiki.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For more help, see &lt;a href=&quot;/help/dont-ask&quot;&gt;&quot;What types of questions should I avoid asking?&quot;&lt;/a&gt;. Please &lt;a href=&quot;/search&quot;&gt;look around&lt;/a&gt; to see if your question or challenge has been posted before. It’s also OK to &lt;a href=&quot;/helpcenter/self-answer&quot;&gt;participate in your own puzzles&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your question is not specifically on-topic for Programming Puzzles &amp;amp; Code Golf, it may be on topic for &lt;a href=&quot;http://stackexchange.com/sites&quot;&gt;another Stack Exchange site&lt;/a&gt;. If no site currently exists that will accept your question, you may &lt;a href=&quot;http://area51.stackexchange.com/faq&quot;&gt;commit to&lt;/a&gt; or &lt;a href=&quot;https://meta.stackexchange.com/questions/76974/how-can-i-propose-a-new-site&quot;&gt;propose&lt;/a&gt; a new site at &lt;a href=&quot;http://area51.stackexchange.com/&quot;&gt;Area 51&lt;/a&gt;, the place where new Stack Exchange communities are democratically created.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Revision Notes:&lt;/em&gt; (putting this here so the changes are more visible and can be discussed more readily)&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Calvin's Hobbies - Revised silly tautological opening sentence.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;xnor - Changed &quot;Be a serious contender for the winning criteria in use.&quot; to &quot;Make a clear effort towards the winning criteria in use.&quot; As is, literally taken, nobody may post a code golf solution longer than existing one, nor anything in Java, because &quot;really?&quot;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="68942" LastEditDate="2021-06-09T05:52:26.823" LastActivityDate="2021-06-09T05:52:26.823" Title="Let's rewrite the help center's on-topic page" Tags="|discussion|help-center|" AnswerCount="3" CommentCount="0" CommunityOwnedDate="2014-08-26T14:24:54.013" ContentLicense="CC BY-SA 3.0" />
  <row Id="2100" PostTypeId="2" ParentId="2098" CreationDate="2014-08-26T19:37:32.477" Score="5" Body="&lt;p&gt;Current excerpt:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;All &lt;strong&gt;questions&lt;/strong&gt; on this site, whether a programming puzzle or a code golf, should have…&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;An &lt;em&gt;objective&lt;/em&gt; primary winning criterion, so that it is possible to indisputably decide which entry should win.&lt;/li&gt;&#xA;  &lt;li&gt;A clear specification of what constitutes a &lt;em&gt;correct&lt;/em&gt; submission. Test cases are highly encouraged.&lt;/li&gt;&#xA;  &lt;li&gt;&quot;Tips for golfing in &lt;em&gt;some language&lt;/em&gt;&quot;-type posts are an exception to this rule. Such posts are community wiki and do not collect reputation.&lt;/li&gt;&#xA;  &lt;li&gt;These questions are surprisingly hard to write well. Help may be available on the &lt;a href=&quot;http://chat.stackexchange.com/rooms/307&quot;&gt;Puzzle Lab chat&lt;/a&gt; or the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/881&quot;&gt;meta Sandbox&lt;/a&gt;, and the use of these resources is encouraged.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Suggested replacement:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;All &lt;strong&gt;challenge questions&lt;/strong&gt; on this site should have&lt;/p&gt;&#xA;  &#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;A &lt;strong&gt;clear specification&lt;/strong&gt; of what constitutes a correct submission, so that it is possible to indisputably decide whether an entry is valid or not. Test cases are highly encouraged.&lt;/li&gt;&#xA;  &lt;li&gt;An &lt;strong&gt;objective primary winning criterion&lt;/strong&gt;, so that it is possible to &#xA;  indisputably decide which entry should win.&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;  &#xA;  &lt;p&gt;These questions are surprisingly hard to write well. It is advisable to follow a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1511/194&quot;&gt;standard template&lt;/a&gt; and to post them first in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/881&quot;&gt;meta Sandbox&lt;/a&gt; so that flaws can be fixed before someone posts an answer which exploits them.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2014-08-26T19:37:32.477" CommentCount="1" CommunityOwnedDate="2014-08-26T19:37:32.477" ContentLicense="CC BY-SA 3.0" />
  <row Id="2105" PostTypeId="2" ParentId="2140" CreationDate="2014-08-26T23:17:51.343" Score="2" Body="&lt;h1&gt;Figure significant figures&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge is to write a program that finds how many &lt;a href=&quot;https://en.wikipedia.org/wiki/Significant_figures&quot; rel=&quot;nofollow noreferrer&quot;&gt;significant figures&lt;/a&gt; a given number has.&lt;/p&gt;&#xA;&lt;h2&gt;Rules for finding significance&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All numbers 1–9 inclusive are significant.&lt;/li&gt;&#xA;&lt;li&gt;All leading zeroes are not significant.&lt;/li&gt;&#xA;&lt;li&gt;Trailing zeroes are significant only if there is a decimal point present anywhere.&lt;/li&gt;&#xA;&lt;li&gt;Zeroes surrounded on both sides by nonzero digits are significant.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Input/output&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input from STDIN or similar.&lt;/li&gt;&#xA;&lt;li&gt;Input will be one string.&lt;/li&gt;&#xA;&lt;li&gt;The input can be arbitrarily large floating-point numbers, but no larger than your language can handle. &lt;em&gt;[I'm not sure if this is the right term/makes sense]&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;If the input contains anything other than digits 0–9 or &lt;code&gt;.&lt;/code&gt;, or is too large to compute, output &lt;code&gt;Invalid&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The output will be one string to STDOUT or similar.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Further information&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Using an external source such as a website, as well as any libraries, APIs, functions, or the like that calculate significant figures are not allowed.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/29750&quot;&gt;Loopholes that are forbidden by default&lt;/a&gt; are not allowed.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so fewest byte wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&#xA;Input    Output&#xA;---------------&#xA;7        1&#xA;7.0      2&#xA;07       1&#xA;0.07     1&#xA;70       1&#xA;70.      2&#xA;70.0     3&#xA;9000     1&#xA;9001     4&#xA;.000001  1&#xA;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I'd appreciate any feedback, questions, or comments.&lt;/p&gt;&#xA;" OwnerUserId="29750" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-08-26T23:17:51.343" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="2106" PostTypeId="1" AcceptedAnswerId="2107" CreationDate="2014-08-28T02:12:34.187" Score="4" ViewCount="177" Body="&lt;h3&gt;The specific question&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I recently posted my test suite as a community wiki answer to a couple of questions that I worked on. Two contributions so far are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/36854/family-tree-solver/36943#36950&quot;&gt;Family Tree Solver&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/36447/put-a-list-in-order/36490#36490&quot;&gt;Put a list in order&lt;/a&gt;   (Amusingly, it has more upvotes than the answers.)&lt;/s&gt; (deleted)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The test suites use &lt;a href=&quot;http://search.cpan.org/~rgarcia/perl-5.10.0/lib/Test/Tutorial.pod&quot; rel=&quot;nofollow noreferrer&quot;&gt;perl TAP&lt;/a&gt;, which is as close to universal as I know how to get ... easily. I made them community wiki to make it clear they are a common resource and encourage other people to contribute to them (I can dream). I had occasionally posted test suites as part of my answer in the past and decided that releasing them to the wild might be useful. Should I keep posting &lt;em&gt;this specific type of test suite using this specific tool&lt;/em&gt;?&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The general question&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Do you think posting a test suite for questions with specific, non-trivial answers as a community wiki is a good idea? Why or why not? (The kind of open ended question I can only get away with in Meta.) If yes, is there a better tool for this than perl TAP?&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Not the question&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I am not proposing a requirement that every question include a test suite.&lt;/p&gt;&#xA;" OwnerUserId="20538" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-08-31T23:48:42.170" Title="Is adding a test suite to a question as a community wiki answer helpful?" Tags="|discussion|" AnswerCount="2" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="2107" PostTypeId="2" ParentId="2106" CreationDate="2014-08-28T06:05:14.773" Score="8" Body="&lt;h2&gt;Do not post test suites as answers&lt;/h2&gt;&#xA;&lt;p&gt;Meaning: do not post test-suites as answers for themselves without any &lt;em&gt;real&lt;/em&gt; answer to the question. If it is an add-on to your answer you may well post it there - or consider adding it to the question.&lt;/p&gt;&#xA;&lt;p&gt;Basically because it not is an answer but part of the specification. While it adds nothing to the answers (just clutters the list of answers - many will not even notice that there is a test suite among all the postings) it adds a lot to the question itself and should therefore become part of the question.&lt;/p&gt;&#xA;&lt;p&gt;You may add a sub header (&lt;em&gt;Test suite (provided by USER)&lt;/em&gt;) in order to indicate that this part is not from the original question. If OP dislikes the test suite or finds it invalid she can always re-edit the question.&lt;/p&gt;&#xA;&lt;p&gt;In order to be suitable for many users try not to use a specific testing framework but rather give a list of input/expected output pairs - any puzzler should be able to transform this format into his favourite testing framework/language.&lt;/p&gt;&#xA;" OwnerUserId="1490" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-08-28T06:05:14.773" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2108" PostTypeId="2" ParentId="824" CreationDate="2014-08-28T19:05:51.860" Score="11" Body="&lt;p&gt;I'd like to advocate a more flexible policy for closing duplicates. As is, duplicate and near-duplicate questions seem to be closed as a hard rule. Of course, we don't want the same question repeated over and over. But if the new question is much better than the old one, closing it is a needless loss in quality for the site. I'd like for the duplicate policy to be more flexible, and allow a repeat of a question if the new one is significantly better than the old.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A weird situation comes up when a well-posed question is upvoted, starts getting quality answers, and then is suddenly closed because someone discovers an old link to a similar question. Is this really serving the community interest? It's sad when someone posts a well thought-out, exactly-specified, test-cased question, and it's closed because the same challenge was posed in a question from 2011 with an ambiguous two-sentence spec and only a few mediocre answers. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;With the current policy on duplicates, that challenge can never be posed again. Anyone who was not on the site at the time misses out on that topic forever. A good question that was ruined by an loophole never gets a second chance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At this point, someone is sure to object, &quot;But you can just answer the old question or edit it to improve it!&quot; I think that this is a romantic view that it's simply not realistic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you answer a question from many years ago, chance are barely anyone will see it. You might as well submit it to dev/null. Likewise for edits to improve an old challenge. Yes, there are some old questions that pop up perennially, but in most cases, that question and your answer or edits will fall off the front page and be forgotten. It'a vicious cycle in that even those who see it and are tempted to participating don't so as not to risk investing time in something that nobody is likely to see.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A new question is like a community agreement to focus attention on that challenge. The fun of the site is golfing/coding with other people -- commenting, upvoting, making improvements. It's a social experience. Why do people post answers rather than just leaving the code they wrote on their computer? That's the same reason answering or editing an old question just isn't the same. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moreover, old questions are often not up to the quality standards of modern ones. Submitting an answer to an ambiguous or flawed spec is unsatisfying. Editing an old spec to be more precise or close loopholes is unfair to existing answers. Adding a bounty doesn't get fix this either.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there were another mechanism to resurrect old questions and improve them, with a social agreement to focus on that question for a time, I'd be all for it. But as is, if someone does the service of making a better version of an old question, intentionally or not, I think we should not throw away effort that by closing it as a duplicate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I also want to endorse &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1914/20260&quot;&gt;this post by Ryan&lt;/a&gt; as to the lack of harm of closing duplicates.)&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2014-08-28T19:11:30.533" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="2109" PostTypeId="2" ParentId="2098" CreationDate="2014-08-28T20:08:52.963" Score="3" Body="&lt;p&gt;We should mention some of the most common &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/standard-loopholes-which-are-no-longer-funny&quot;&gt;standard loopholes which are no longer funny&lt;/a&gt; or give a link in the on-topic page. If the loopholes implicitly apply to every challenge-type question, then we should mention them here. I realise this only applies to answers, not questions, but this page should serve both.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2014-08-28T20:08:52.963" CommentCount="0" CommunityOwnedDate="2014-08-28T20:08:52.963" ContentLicense="CC BY-SA 3.0" />
  <row Id="2115" PostTypeId="2" ParentId="1475" CreationDate="2014-08-30T10:22:13.730" Score="3" Body="&lt;p&gt;I stumbled upon some course notes for a course on multi-agent modelling which has a list of &lt;a href=&quot;http://ccl.northwestern.edu/courses/mam2005/Ideas_for_models.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;ideas for things to model&lt;/a&gt;. Not all of them would be suitable, and I think one or two have been done, but it can serve as a source of ideas.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I actually found it while doing a bit of background reading on Paterson's worms, because &lt;a href=&quot;https://math.stackexchange.com/q/909961/5676&quot;&gt;this question on math.SE&lt;/a&gt; seemed like a promising idea for a challenge. (My suggestion would be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; which takes worm definition and number of steps and outputs an svg).&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:19:20.950" LastActivityDate="2014-08-30T10:22:13.730" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2116" PostTypeId="2" ParentId="2140" CreationDate="2014-08-30T13:26:53.257" Score="3" Body="&lt;h1&gt;Simulate a Quantum Circuit&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Work-in-progress&lt;/strong&gt; until I can make sure I know what I am doing and can finish the spec. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; or maybe &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/advanced-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;advanced-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;advanced-code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Quantum computers are the way of the future!  Why wait, when you can simulate one now?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your mission is to determine the output of a quantum circuit given its input and a diagram of logic gates.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Details&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You will simulate a single quantum register and apply a series of quantum logic gates to it.  A quantum register is a group of qubits.  The state of a register is described by a vector of &lt;code&gt;2^N&lt;/code&gt; complex numbers, where &lt;code&gt;N&lt;/code&gt; is the number of qubits in the register.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a|000&amp;gt;&#xA;b|001&amp;gt;&#xA;c|010&amp;gt;&#xA;d|011&amp;gt;&#xA;e|100&amp;gt;&#xA;f|101&amp;gt;&#xA;g|110&amp;gt;&#xA;h|111&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Above is a representation of a 3-qubit register.  Each letter (&lt;code&gt;a&lt;/code&gt; &lt;code&gt;b&lt;/code&gt; &lt;code&gt;c&lt;/code&gt; etc.) represents a complex number. There is an addition restriction that:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;|a|^2 + |b|^2 + |c|^2 + |d|^2 + |e|^2 + |f|^2 + |g|^2 + |h|^2 = 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Quantum gates&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Gates are represented by a &lt;code&gt;2^N x 2^N&lt;/code&gt; square unitary matrix, where &lt;code&gt;N&lt;/code&gt; is the number of input qubits.  All quantum gates have the same number of outputs and inputs, since they neither create nor destroy qubits, they modify them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A common quantum gate is called the Hadamard gate and acts on a single qubit.  The matrix &lt;code&gt;[H]&lt;/code&gt; looks like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1/Sqrt(2)  1/Sqrt(2)&#xA;1/Sqrt(2)  -1/Sqrt(2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If we let &lt;code&gt;[R]&lt;/code&gt; represent the following 1-qubit register:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0.6|0&amp;gt;&#xA;O.8|1&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then the application of the gate is represented by &lt;code&gt;[H][R]&lt;/code&gt; and gives the following result:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;7*Sqrt(2)/10|0&amp;gt;&#xA; -Sqrt(2)/10|1&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It is still true that the sum of the squares of the absolute values is equal to 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;(TODO: explain how to apply gates to larger registers)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Measurement&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Measurement collapses the state of the quantum register.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;(Todo: Explain how measurement works)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2014-08-30T13:26:53.257" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2118" PostTypeId="1" CreationDate="2014-08-31T11:44:36.107" Score="1" ViewCount="136" Body="&lt;p&gt;I just saw the merged sandbox, and &lt;i&gt;woah...&lt;/i&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I notice that in the OP post that the active challenge is classified into 3.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;King Of The Hill&lt;/ol&gt;&#xA;&#xA;&lt;ol&gt;Codegolf&lt;/ol&gt;&#xA;&#xA;&lt;ol&gt;Others&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Will it be wise if we make 3 sandbox? One sandbox for each type? So we have One sandbox full of KOTH. One sandbox full of codegolf and one sandbox for others (popularity, puzzle, troll, etc). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;15 pages of sandbox is a little bit, &lt;i&gt;intimidating&lt;/i&gt; for me. Classification may help.&lt;/p&gt;&#xA;" OwnerUserId="20738" LastEditorUserId="3808" LastEditDate="2014-12-02T01:29:49.783" LastActivityDate="2014-12-02T01:29:49.783" Title="Make sandbox classified?" Tags="|discussion|feature-request|status-declined|sandbox|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2119" PostTypeId="1" AcceptedAnswerId="2133" CreationDate="2014-08-31T12:18:11.300" Score="23" ViewCount="599" Body="&lt;p&gt;Code Golf question titles are frequently opaque.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The front page (and Hot Network Questions) hence partially degrades to a list of clickable rectangles. When clicking, I more often think &quot;&lt;em&gt;WTF does &lt;strong&gt;that&lt;/strong&gt; mean&lt;/em&gt;&quot; than &quot;&lt;em&gt;This sounds like an interesting puzzle&lt;/em&gt;&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Recent beauties, explained:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://i.stack.imgur.com/cgQIy.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;If a program terminates and there's no one to see it, does it halt?&lt;/a&gt;&lt;br&gt;Write a program that theoretically terminates, after our universe does&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/37088/take-a-break-to-make-a-snake&quot;&gt;Take a break to make a snake!&lt;/a&gt;&lt;br&gt;Simulate a &lt;a href=&quot;http://en.wikipedia.org/wiki/Snake_(video_game)&quot; rel=&quot;nofollow noreferrer&quot;&gt;snake&lt;/a&gt; game, given button presses&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/36921/mastermind-horse-battery-staple&quot;&gt;mastermind horse battery staple&lt;/a&gt;&lt;br&gt;Guess a password with &lt;a href=&quot;http://www.mastermindtoys.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Mastermind&lt;/a&gt;-hints (&lt;a href=&quot;http://xkcd.com/936/&quot; rel=&quot;nofollow noreferrer&quot;&gt;xkcd-referential&lt;/a&gt; title)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/37070/can-you-make-my-terminal-less-boring&quot;&gt;Can you make my terminal less boring?&lt;/a&gt;&lt;br&gt;Colourise output based on spec&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/36836/plug-it-back-in-tonight-or-this-weekend&quot;&gt;Plug it back in tonight or this weekend&lt;/a&gt;&lt;br&gt;Calculate electricity cost at given time&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;These are funny. That's a good thing&amp;mdash;we like fun. But when titles are more provocative than useful, they become &lt;a href=&quot;http://www.urbandictionary.com/define.php?term=click%20bait&quot; rel=&quot;nofollow noreferrer&quot;&gt;click bait&lt;/a&gt;. I think that's a bad direction.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="16412" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-09-24T13:24:52.817" Title="Click here to find out what this question is about" Tags="|discussion|challenges|titles|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="2121" PostTypeId="2" ParentId="2118" CreationDate="2014-08-31T12:49:33.700" Score="5" Body="&lt;h1&gt;The sandbox works better unified&lt;/h1&gt;&#xA;&lt;p&gt;Although I understand that it can be intimidating at first glance, this can be much improved by sorting by &amp;quot;active&amp;quot; and I think that is sufficient. I believe there is much more benefit to keeping a single unified sandbox than there would be from splitting it.&lt;/p&gt;&#xA;&lt;p&gt;If someone wants to drop in to the sandbox and give some quick feedback, they are going to drop in to just one of the 3 sandboxes, give feedback on a few posts until they find they've run out of time, and then neglect the other two sandboxes, even though that was never their intention. Keeping it together means that what is prioritised is what has been recently updated, not one challenge type over another.&lt;/p&gt;&#xA;&lt;p&gt;Also, people who are unfamiliar with a given challenge type may still have useful feedback, which they will give if they see the challenge on the list, but might never see if they don't feel the other sandbox is their place. So it's better for everyone, whether they are interested in all challenge types or just one or two.&lt;/p&gt;&#xA;&lt;p&gt;The site and community benefit from more people, and more questions. I want everyone to be encouraged to ask any kind of question, and for everyone to see the kinds of questions they don't ask themselves. This way there are more ideas shared and a code golf may be inspired by a King of the Hill challenge, or a King of the Hill may be inspired by a fastest code challenge. This way a sandbox post that turns out to be unsuitable can still be scavenged for spare parts so that we get more questions overall.&lt;/p&gt;&#xA;&lt;p&gt;I'm against anything that makes the community more divided, even indirectly.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-08-31T17:03:19.000" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="2122" PostTypeId="2" ParentId="2119" CreationDate="2014-08-31T13:36:27.670" Score="12" Body="&lt;p&gt;I definitely agree that titles should not be meaningless. It's difficult to set a rule as the level of meaning is subjective, but I encourage everyone to add comments to questions they think could benefit from a more informative title. Titles can be both useful and funny - like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/36474/write-a-program-which-replaces-with-spaces-the-braces-in-cases-where-braces-in-p&quot;&gt;this delightful title&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My own personal opinions on your examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/36747/if-a-program-terminates-and-there-is-no-one-to-see-it-does-it-halt&quot;&gt;If a program terminates and there's no one to see it, does it halt?&lt;/a&gt;&lt;br&gt;Write a program that theoretically terminates, after our universe does&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think this is enough information that the people interested in the question are likely to click on it, and the people who click on it are likely to be interested in it when they find out what it is about.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/37088/take-a-break-to-make-a-snake&quot;&gt;Take a break to make a snake!&lt;/a&gt;&lt;br&gt;Simulate a &lt;a href=&quot;http://en.wikipedia.org/wiki/Snake_(video_game)&quot; rel=&quot;nofollow noreferrer&quot;&gt;snake&lt;/a&gt; game, given button presses&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think this one is fine. I would add the word &quot;game&quot; on the end if it was my question, but I think most people seeing this title would guess it's related to the snake game, and even specifying &quot;game&quot; wouldn't guarantee it was about implementation rather than some related calculation.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/36921/mastermind-horse-battery-staple&quot;&gt;mastermind horse battery staple&lt;/a&gt;&lt;br&gt;Guess a password with &lt;a href=&quot;http://www.mastermindtoys.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Mastermind&lt;/a&gt;-hints (&lt;a href=&quot;http://xkcd.com/936/&quot; rel=&quot;nofollow noreferrer&quot;&gt;xkcd-referential&lt;/a&gt; title)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Although this could be made clearer as &quot;Mastermind variant: horse battery staple&quot;, for me this is good as it is. I want to see titles that say &lt;em&gt;enough&lt;/em&gt; about the question, not necessarily &lt;em&gt;everything&lt;/em&gt; about the question.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/37070/can-you-make-my-terminal-less-boring&quot;&gt;Can you make my terminal less boring?&lt;/a&gt;&lt;br&gt;Colourise output based on spec&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Again, this contains half of the relevant words (&quot;terminal&quot;, but not &quot;colour&quot;), and although you could add more, I think this is already tailored to attract those people who will be interested in the question, without acting as click bait to people who wouldn't be interested in the question.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/36836/plug-it-back-in-tonight-or-this-weekend&quot;&gt;Plug it back in tonight or this weekend&lt;/a&gt;&lt;br&gt;Calculate electricity cost at given time&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is indeed a vague title, but your first guess at what it's about is probably correct, so I don't think this one is a problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although I think most of your examples are borderline, there are other questions out there which definitely need more informative titles.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since so many questions will fall in the grey area between, I recommend adding a comment with a suggestion and letting the question poster decide how much detail to include. I would only downvote if the title was completely devoid of meaning, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37087/programmers-from-all-languages-write-this-with-as-few-code-as-possible&quot; title=&quot;programmers from all languages, write this with as few code as possible&quot;&gt;like this&lt;/a&gt;. In most cases that bad, there are plenty of other reasons to downvote already.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Question posters can include both a catchy title and a short description if they are efficient with characters (and we should be able to manage that on this site...).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Catchy main title: descriptive subtitle&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I wouldn't want this to be imposed though. A descriptive subtitle can just become clutter if it's not really needed. Judge it case by case.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-08-31T13:36:27.670" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2123" PostTypeId="2" ParentId="2140" CreationDate="2014-08-31T20:55:35.680" Score="2" Body="&lt;h1&gt;Marvelous Moonglyphs: Match Kana To Kanji&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/natural-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;natural-language&amp;#39;&quot; rel=&quot;tag&quot;&gt;natural-language&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/D2ODx.jpg&quot; alt=&quot;enter image description here&quot; /&gt;&lt;img src=&quot;https://i.stack.imgur.com/al2Bj.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;For people who are curious, like to do research, and want to learn something new.&lt;/p&gt;&#xA;&lt;p&gt;This is a somewhat real-world example that isn't to hard to implement, but it may seem difficult because many people around here won't be familiar with the topic.&lt;/p&gt;&#xA;&lt;h2&gt;Overview&lt;/h2&gt;&#xA;&lt;p&gt;Recently your company started to expand its business to the Asian market. Nobody volunteered, so you have been asked to come up with some Japanese text processing code. Japanese addresses often come as a bunch of squiggly moon-glyphs, with the prefecture, district, and town name all mangled together. On the net, you found a list that tells you how to read that bunch, but you (and your Japanese customers) would like to know how to pronounce the district and town name by itself.&lt;/p&gt;&#xA;&lt;p&gt;A &lt;em&gt;very&lt;/em&gt; brief, over-simplified explanation &lt;a href=&quot;http://en.wikipedia.org/wiki/Japanese_writing_system&quot; rel=&quot;nofollow noreferrer&quot;&gt;of the Japanese writing system&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;p&gt;Japanese consists 100~200 syllables. They can be written with 48 kana, &lt;em&gt;similar&lt;/em&gt; to our alphabet. There are two versions, &lt;code&gt;Hiragana&lt;/code&gt; and &lt;code&gt;Katakana&lt;/code&gt;, like lowercase and uppercase letters. &lt;code&gt;Kanas&lt;/code&gt; are like a phonetic transcription. A word can also be written with meaning-based kanji. Each kanji may possess multiple readings. Given a word with many &lt;code&gt;Kanji&lt;/code&gt; and its reading in &lt;code&gt;Kana&lt;/code&gt;, determine which &lt;code&gt;Kanas&lt;/code&gt; belong to which &lt;code&gt;Kanji&lt;/code&gt;. Look up &lt;code&gt;Kanji&lt;/code&gt; on wikipedia if you want to know more.&lt;/p&gt;&#xA;&lt;p&gt;All &lt;code&gt;Hiragana&lt;/code&gt;s  [&amp;quot;lower case&amp;quot;] are&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;がぎぐげござじずぜぞだぢづでどばびぶべぼぱぴぷぺぽあいうえおかきくけこさしすせそたちつてとなにぬねのはひふへほまみむめもやゆよらりるれろわをんぁぃぅぇぉゃゅょっゐゑゔ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And the &lt;code&gt;Katakana&lt;/code&gt;s [&amp;quot;upper case&amp;quot;] are&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ガギグゲゴザジズゼゾダヂヅデドバビブベボパピプペポアイウエオカキクケコサシスセソタチツテトナニヌネノハヒフヘホマミムメモヤユヨラリルレロワヲンァィゥェォャュョッヰヱヴ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;They correspond to each other in the order given above.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Feature-challenge.&lt;/p&gt;&#xA;&lt;p&gt;Your program should implement the basic feature described below. Your basic score is 20.&lt;/p&gt;&#xA;&lt;p&gt;You will receive additional points for each feature you implement. In case of a tie, code length in bytes decides.&lt;/p&gt;&#xA;&lt;h2&gt;Disclaimer&lt;/h2&gt;&#xA;&lt;p&gt;Standard loopholes shall (not) apply.&lt;/p&gt;&#xA;&lt;p&gt;First, I will provide you with the information needed to define the task.&lt;/p&gt;&#xA;&lt;p&gt;After that, I shall add some notes, examples, and hints for those of you not familar with Japanese. If you want to challenge yourself, and do some research yourself, do not read this.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;It is your task to write a program that will take as its input a string of &lt;code&gt;MOONGLYPHS&lt;/code&gt;, its &lt;code&gt;READING&lt;/code&gt;, and the moonglyphs separated into &lt;code&gt;PARTS&lt;/code&gt; whose readings your program should output. You already found a dictionary file with all possible readings for each &lt;code&gt;MOONGLYPH&lt;/code&gt;. (see below). All examples are formatted as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;MOONGLYPHS&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;READING&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;PART1&lt;/code&gt;,&lt;code&gt;PART2&lt;/code&gt;,&lt;code&gt;PART3&lt;/code&gt;,...&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;EXPECTED_OUTPUT&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;A simple example:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;成田&lt;/code&gt; [Narita, name of a town]&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;なりた&lt;/code&gt; [na-ri-ta]&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;成&lt;/code&gt;, &lt;code&gt;田&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;[&lt;code&gt;成&lt;/code&gt;,&lt;code&gt;なり&lt;/code&gt;],[&lt;code&gt;田&lt;/code&gt;,&lt;code&gt;た&lt;/code&gt;]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The &lt;code&gt;MOONGLYPH&lt;/code&gt;s &lt;code&gt;成田&lt;/code&gt; are read &lt;code&gt;なりた&lt;/code&gt;. The parts &lt;code&gt;成&lt;/code&gt; and  &lt;code&gt;田&lt;/code&gt; are read &lt;code&gt;なり&lt;/code&gt; and &lt;code&gt;た&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;I/O source and destination&lt;/h2&gt;&#xA;&lt;p&gt;Up to you, as long as it a complete program, ie you may read from&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a file&lt;/li&gt;&#xA;&lt;li&gt;stdin&lt;/li&gt;&#xA;&lt;li&gt;network&lt;/li&gt;&#xA;&lt;li&gt;keyboard&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Same for the output.&lt;/p&gt;&#xA;&lt;h2&gt;Input and output format&lt;/h2&gt;&#xA;&lt;h3&gt;Input:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;All strings may be encoded in the encoding of your choice. (eg UTF-8, Shift-JIS etc.)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;MOONGLYPH&lt;/code&gt; and &lt;code&gt;READING&lt;/code&gt; are strings (or an equivalent in the language of your choice).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;PARTS&lt;/code&gt; are an array, or an equivalent data structure in the language of your choice. Each entry is a string.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;MOONGLYPH&lt;/code&gt; only contains &lt;code&gt;MOONGLYPH&lt;/code&gt;s found in the &lt;code&gt;Dictionary File&lt;/code&gt;. (see below)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It may also include other characters, if your program implements the corresponding feature.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you support all features, it may include &lt;code&gt;KATAKANA&lt;/code&gt;, &lt;code&gt;HIRAGANA&lt;/code&gt;, and various full-width symbols and punctuation marks as well.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It will never contain any half-width letters, numbers or marks. (such as &lt;code&gt;,.=?)agE234\&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;READING&lt;/code&gt; only contains &lt;code&gt;HIRAGANA&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you implement the corresponding feature, it may contain the same full-width symbols and numbers that &lt;code&gt;MOONGLYPH&lt;/code&gt;s may contain.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The array of &lt;code&gt;PART&lt;/code&gt;s, when joined in the given order, will result in &lt;code&gt;MOONGLYPH&lt;/code&gt;. For example, if &lt;code&gt;MOONGLYPH&lt;/code&gt; is 日本語, then parts may be &lt;code&gt;[日本,語]&lt;/code&gt; or [日,本,語] -  but not [語,本,日] (reversed order) or [日本] (missing 語).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;日本語&lt;/code&gt; (Japanese)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;にほんご&lt;/code&gt; [ni-hon-go]&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;日本&lt;/code&gt;, &lt;code&gt;語&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The &lt;code&gt;MOONGLYPH&lt;/code&gt; string is &lt;code&gt;日本語&lt;/code&gt;, the &lt;code&gt;READING&lt;/code&gt; is &lt;code&gt;にほんご&lt;/code&gt;, and the parts are &lt;code&gt;日本&lt;/code&gt; and &lt;code&gt;語&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;An array, or equivalent data structure.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each entry contains one of the input &lt;code&gt;PARTS&lt;/code&gt;, as well as the corresponding part of the &lt;code&gt;READING&lt;/code&gt; - in the same order as &lt;code&gt;PARTS&lt;/code&gt;. Joining all parts results in &lt;code&gt;MOONGLYPH&lt;/code&gt;s, and joining all readings results in the &lt;code&gt;READING&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If there is no match, your program must behave in a way that is distinguishable from when it finds at least one match - including outputting &lt;code&gt;nil&lt;/code&gt;, an &lt;code&gt;empty array&lt;/code&gt;, or &lt;code&gt;crashing&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;日本語&lt;/code&gt; (Japanese)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;にほんご&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;日本&lt;/code&gt;,&lt;code&gt;語&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;[&lt;code&gt;日本&lt;/code&gt;,&lt;code&gt;にほん&lt;/code&gt;], [&lt;code&gt;語&lt;/code&gt;,&lt;code&gt;ご&lt;/code&gt;]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;All of the following cannot be valid outputs　under any circumstances, irrespective of the dictionary data:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;[&lt;code&gt;語&lt;/code&gt;,&lt;code&gt;ご&lt;/code&gt;], [&lt;code&gt;日本&lt;/code&gt;,&lt;code&gt;にほん&lt;/code&gt;] (reversed order)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;[&lt;code&gt;日本&lt;/code&gt;,&lt;code&gt;に&lt;/code&gt;], [&lt;code&gt;語&lt;/code&gt;,&lt;code&gt;ご&lt;/code&gt;] (joining the readings results in &lt;code&gt;にご&lt;/code&gt;, which is not equal to the &lt;code&gt;READING&lt;/code&gt;, &lt;code&gt;にほんご&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;[&lt;code&gt;日&lt;/code&gt;,&lt;code&gt;にほん&lt;/code&gt;], [&lt;code&gt;語&lt;/code&gt;,&lt;code&gt;ご&lt;/code&gt;] (joining the moongylphs results in &lt;code&gt;日語&lt;/code&gt;, which is not equal to the &lt;code&gt;MOONGLYPH&lt;/code&gt;s, &lt;code&gt;日本語&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Dictionary File&lt;/h2&gt;&#xA;&lt;p&gt;The dictionary file is called &lt;code&gt;KANJIDIC&lt;/code&gt; (&lt;strong&gt;not&lt;/strong&gt; &lt;code&gt;KANJDIC212&lt;/code&gt;) and can be found on this page (English):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.csse.monash.edu.au/%7Ejwb/kanjidic.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Homepage&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.csse.monash.edu.au/%7Ejwb/kanjidic_doc.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Documentation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://ftp.monash.edu.au/pub/nihongo/00INDEX.html#dic_fil&quot; rel=&quot;nofollow noreferrer&quot;&gt;Download&lt;/a&gt; (search for &lt;code&gt;And now the Kanji files&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;It comes in a few different formats, choose one you like. Treat &lt;code&gt;suffixes&lt;/code&gt; and &lt;code&gt;prefixes&lt;/code&gt; as regular readings, strip the &lt;code&gt;okurigana&lt;/code&gt; off the reading.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/blutorange/match_kanji_kana/tree/master/dics&quot; rel=&quot;nofollow noreferrer&quot;&gt;I also added the files on this github.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Basic Feature&lt;/h2&gt;&#xA;&lt;p&gt;Score = 20&lt;/p&gt;&#xA;&lt;p&gt;Output the readings for each part, as described in the Input/Output section.&lt;/p&gt;&#xA;&lt;p&gt;A somewhat longer example:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;京都府京都市下京区大黒町仏光寺通御幸町西入&lt;/code&gt; [Kyoto, Shimo-Gyouku District, Daikoku]&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;きょうとふきょうとししもぎょうくだいこくちょうぶっこうじどおりごこまちにしいる&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;京都府&lt;/code&gt;,&lt;code&gt;京都市下京区&lt;/code&gt;,&lt;code&gt;大黒町&lt;/code&gt;,&lt;code&gt;仏光寺通御幸町西入&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;[&lt;code&gt;京都府&lt;/code&gt;,&lt;code&gt;きょうとふ&lt;/code&gt;], [&lt;code&gt;京都市下京区&lt;/code&gt;,&lt;code&gt;きょうとししもぎょうく&lt;/code&gt;], [&lt;code&gt;大黒町&lt;/code&gt;,&lt;code&gt;だいこくちょう&lt;/code&gt;], [&lt;code&gt;仏光寺通御幸町西入&lt;/code&gt;,&lt;code&gt;ぶっこうじどおりごこまちにしいる&lt;/code&gt;]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The only possible combination, given the dictionary data, is that &lt;code&gt;きょうとふ&lt;/code&gt; belongs to &lt;code&gt;京都府&lt;/code&gt;, etc.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Optional Features.&lt;/h2&gt;&#xA;&lt;p&gt;No need to implement all features if you don't understand one of them. Remember, have fun.&lt;/p&gt;&#xA;&lt;h3&gt;壱 (1) &lt;em&gt;+15&lt;/em&gt;&lt;/h3&gt;&#xA;&lt;p&gt;Implement Rendaku (Voicing).　Handakuten count as voicing as well. No ヴ.&lt;/p&gt;&#xA;&lt;p&gt;To keep it simple, we are going to assume that this voicing may always occur, except for the &lt;code&gt;KANA&lt;/code&gt; at the beginning of the &lt;code&gt;READING&lt;/code&gt; string.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;初霜月&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;はつ&lt;/code&gt;, &lt;code&gt;しも&lt;/code&gt;, &lt;code&gt;づき&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;弐 (2) &lt;em&gt;+10&lt;/em&gt;&lt;/h3&gt;&#xA;&lt;p&gt;Support and ignore these punctuation symbols.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;─〜、・（）。！？「」／〒【】『』０１２３４５６７８９&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;These appear both in the &lt;code&gt;MOONGLYPH&lt;/code&gt;s, &lt;code&gt;READING&lt;/code&gt;s, and &lt;code&gt;PART&lt;/code&gt;s at the same abstract position and should be ignored. That is, your program does not need to handle unmatched punctuation. You may assume that punctuation characters will always agree between &lt;code&gt;MOONGLYPHS&lt;/code&gt; and &lt;code&gt;READING&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;桜川市（亀岡）&lt;/code&gt; [&amp;quot;Cherry Flower River&amp;quot;, &amp;quot;Turtle Hill&amp;quot;]&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;さくらかわし&lt;/code&gt;, &lt;code&gt;（かめおか）&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Invalid input:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;桜川市（亀岡）&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;さくらかわし&lt;/code&gt;, &lt;code&gt;かめおか&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;参 (3) &lt;em&gt;+10&lt;/em&gt;&lt;/h3&gt;&#xA;&lt;p&gt;Support &lt;code&gt;ケ&lt;/code&gt;, &lt;code&gt;ヶ&lt;/code&gt;, and &lt;code&gt;ヵ&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;All three may be read  &lt;code&gt;か&lt;/code&gt; and &lt;code&gt;が&lt;/code&gt;. &lt;code&gt;ケ&lt;/code&gt; and &lt;code&gt;ヶ&lt;/code&gt;  may also be read &lt;code&gt;げ&lt;/code&gt; and &lt;code&gt;こ&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;肆 (4) &lt;em&gt;+10&lt;/em&gt;&lt;/h3&gt;&#xA;&lt;p&gt;Support omitted genitive markers &lt;code&gt;の&lt;/code&gt; between &lt;code&gt;MOONGLYPHS&lt;/code&gt;. An addtional &lt;em&gt;+5&lt;/em&gt; if you support &lt;code&gt;が&lt;/code&gt; as well.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;油小路&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;あぶらのこうじ&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;油&lt;/code&gt;, &lt;code&gt;小路&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;[&lt;code&gt;油&lt;/code&gt;,&lt;code&gt;あぶら&lt;/code&gt;], [&lt;code&gt;&amp;lt;empty&amp;gt;&lt;/code&gt;,&lt;code&gt;の&lt;/code&gt;], [&lt;code&gt;小路&lt;/code&gt;,&lt;code&gt;こうじ&lt;/code&gt;]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;伍 (5) &lt;em&gt;+15&lt;/em&gt;&lt;/h3&gt;&#xA;&lt;p&gt;Support full-width roman numbers.　You only need to support integers &lt;code&gt;&amp;gt;0&lt;/code&gt; and &lt;code&gt;&amp;lt;1E12&lt;/code&gt;, and do not include any separators at any power of 10.&lt;/p&gt;&#xA;&lt;p&gt;There shall be no &lt;code&gt;一&lt;/code&gt; before &lt;code&gt;百&lt;/code&gt;, &lt;code&gt;千&lt;/code&gt;, &lt;code&gt;万&lt;/code&gt;, and &lt;code&gt;億&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;An addtional &lt;em&gt;+5&lt;/em&gt; if you support an optional &lt;code&gt;一&lt;/code&gt; before &lt;code&gt;百&lt;/code&gt;, &lt;code&gt;千&lt;/code&gt;, &lt;code&gt;万&lt;/code&gt;, and &lt;code&gt;億&lt;/code&gt;. That is, &lt;code&gt;１０２番&lt;/code&gt; may be read either as &lt;code&gt;百番&lt;/code&gt; or &lt;code&gt;一百番&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;１２月&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;じゅうにがつ&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;１２&lt;/code&gt;, &lt;code&gt;月&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;[&lt;code&gt;１２&lt;/code&gt;,&lt;code&gt;じゅうに&lt;/code&gt;], [&lt;code&gt;月&lt;/code&gt;,&lt;code&gt;がつ&lt;/code&gt;]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;陸 (6) &lt;em&gt;+15&lt;/em&gt;&lt;/h3&gt;&#xA;&lt;p&gt;Add support for &lt;code&gt;KANA&lt;/code&gt;. Including the now deprecated four &lt;code&gt;ゑ&lt;/code&gt;, &lt;code&gt;ゐ&lt;/code&gt;, &lt;code&gt;ヱ&lt;/code&gt;, &lt;code&gt;ヰ&lt;/code&gt; read as &lt;code&gt;い&lt;/code&gt; and `え.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;は&lt;/code&gt;, &lt;code&gt;へ&lt;/code&gt;, &lt;code&gt;を&lt;/code&gt; will never appear as &lt;code&gt;わ&lt;/code&gt;, &lt;code&gt;え&lt;/code&gt;, or &lt;code&gt;お&lt;/code&gt; in the output.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;岩月町かしわ野&lt;/code&gt; [City of Iwatsuki &amp;quot;Moon Rock&amp;quot;, Kashiwano &amp;quot;Evergreen Oak Plains&amp;quot;]&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;いわつきまち&lt;/code&gt;, &lt;code&gt;かしわの&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;漆 (7) &lt;em&gt;+5&lt;/em&gt;&lt;/h3&gt;&#xA;&lt;p&gt;Add the additional &lt;code&gt;MOONGLYPH&lt;/code&gt;s found in &lt;code&gt;KANJIDIC212&lt;/code&gt;. You can download it from the same page as &lt;code&gt;KANJIDIC&lt;/code&gt;, see above. &lt;a href=&quot;http://www.csse.monash.edu.au/%7Ejwb/kanjidic2/&quot; rel=&quot;nofollow noreferrer&quot;&gt;XML here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;鱏八軟骨魚綱板鰓亜綱仁属為&lt;/code&gt; (Batoidea are Chondrichthyes, Elasmobranchii)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;えいはなんこつぎょこうばんさいあこうにぞくす&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;捌 (8) &lt;em&gt;+10&lt;/em&gt;&lt;/h3&gt;&#xA;&lt;p&gt;Prefer &lt;code&gt;on-on&lt;/code&gt; and &lt;code&gt;kun-kun&lt;/code&gt; readings, and sort the results accordingly.&lt;/p&gt;&#xA;&lt;p&gt;This requires a metric. To keep things simple, set the &lt;code&gt;likelihood&lt;/code&gt; to zero, add &lt;code&gt;+1&lt;/code&gt; for each on/on or kun/kun pairs.&lt;/p&gt;&#xA;&lt;p&gt;So for example,&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;ON ON KUN KUN =&amp;gt; likelihood 2&lt;/li&gt;&#xA;&lt;li&gt;ON KUN ON KUN =&amp;gt; likelihood 0&lt;/li&gt;&#xA;&lt;li&gt;ON ON ON KUN  =&amp;gt; likelihood 3&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Punctuation symbols and &lt;code&gt;KANA&lt;/code&gt; are be ignored for this calculation.&lt;/p&gt;&#xA;&lt;h3&gt;玖 (9) &lt;em&gt;+15&lt;/em&gt;&lt;/h3&gt;&#xA;&lt;p&gt;Implement the &lt;code&gt;MOONGLYPH&lt;/code&gt; doubler sign &lt;code&gt;々&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;When the &lt;code&gt;MOONGLYPH&lt;/code&gt; repeater 々 occurs &lt;code&gt;m*n&lt;/code&gt; times, it may stand for the last &lt;code&gt;n&lt;/code&gt; &lt;code&gt;MOONGLYPHS&lt;/code&gt; occuring &lt;code&gt;m&lt;/code&gt; times.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;月光綺麗々々々々々々&lt;/code&gt; [The moonlight. Beautiful, beautiful, beautiful, beautiful.]&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;げっこうきれいきれいきれいきれい&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;月光綺麗&lt;/code&gt;, &lt;code&gt;々々々々々々&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;[&lt;code&gt;月光綺麗&lt;/code&gt;,&lt;code&gt;げっこうきれい&lt;/code&gt;], [&lt;code&gt;々々々々々々&lt;/code&gt;,&lt;code&gt;きれいきれいきれい&lt;/code&gt;]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The input &lt;code&gt;MOONGLYPH&lt;/code&gt;s shall never be such that any possible choice for n or m results in a previous occurence of 々 getting repeated. Thus, &lt;code&gt;木々日々々々&lt;/code&gt; would not be a valid input.&lt;/p&gt;&#xA;&lt;h3&gt;拾 (10) &lt;em&gt;+10&lt;/em&gt;&lt;/h3&gt;&#xA;&lt;p&gt;Support the voiced kana repeater &lt;code&gt;ゞ&lt;/code&gt;. &lt;code&gt;ひゞ&lt;/code&gt; shall stand for &lt;code&gt;ひび&lt;/code&gt; or &lt;code&gt;ひぴ&lt;/code&gt;, &lt;code&gt;ごゞ&lt;/code&gt; for &lt;code&gt;ごご&lt;/code&gt;, and &lt;code&gt;ぱゞ&lt;/code&gt; for &lt;code&gt;ぱば&lt;/code&gt; or &lt;code&gt;ぱぱ&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;It may not occur after syllables that do not accept dakuten, eg &lt;code&gt;まゞ&lt;/code&gt; will is invalid input.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;きゞ&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;きぎ&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;陰 (Final) &lt;em&gt;+20&lt;/em&gt;&lt;/h3&gt;&#xA;&lt;p&gt;Support &lt;code&gt;Ateji&lt;/code&gt;, &lt;code&gt;Gikun&lt;/code&gt; readings, that is support multi-&lt;code&gt;MOONGLYPH&lt;/code&gt; words.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.edrdg.org/jmdict/edict_doc.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Dictionary File EDict&lt;/a&gt;. Use either &lt;code&gt;edict.gz&lt;/code&gt; or &lt;code&gt;edict2.gz&lt;/code&gt; (custom format); or &lt;code&gt;JMdict.gz&lt;/code&gt; or &lt;code&gt;JMdict_e.gz&lt;/code&gt; (xml). The download page also contains links to the documentation of the dictionary format.&lt;/p&gt;&#xA;&lt;p&gt;(1)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;十六夜&lt;/code&gt; &lt;a href=&quot;http://album.u17i.com/image/2011/08/cd/eb/368936_24777_854323_HwkL.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;sixteen-day-old moon&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;いざよい&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;(2)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;独逸&lt;/code&gt; [Germany]&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;どいつ&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This word is found only in &lt;code&gt;EDICT2&lt;/code&gt;, but not in &lt;code&gt;EDICT&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Complex Example&lt;/h2&gt;&#xA;&lt;p&gt;This example requires features 1,2 5, and 9.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;１７３〜１９０番地「鉢伏峠」等々&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ひゃくななじゅうさん〜いっぴゃくきゅうじゅうばんち「はちぶせとうげ」とうとう&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;１７３〜１９０&lt;/code&gt;, &lt;code&gt;番地&lt;/code&gt;, &lt;code&gt;「鉢伏峠」&lt;/code&gt;, &lt;code&gt;等々&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;[&lt;code&gt;１７３〜１９０&lt;/code&gt;,&lt;code&gt;ひゃくななじゅうさん〜いっぴゃくきゅうじゅう&lt;/code&gt;], [&lt;code&gt;番地&lt;/code&gt;,&lt;code&gt;ばんち&lt;/code&gt;], [&lt;code&gt;「鉢伏峠」&lt;/code&gt;,&lt;code&gt;「はちぶせとうげ」&lt;/code&gt;], [&lt;code&gt;等々&lt;/code&gt;,&lt;code&gt;とうとう&lt;/code&gt;]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Tutorial&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Do not read any further if you want to challenge yourself, or do the research yourself.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/blutorange/match_kanji_kana&quot; rel=&quot;nofollow noreferrer&quot;&gt;Moved here to keep this short.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;May your journey to the moon be successful and fruitful, brave adventurer!&lt;/p&gt;&#xA;" OwnerUserId="26465" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-09-02T11:38:52.010" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="2124" PostTypeId="2" ParentId="2140" CreationDate="2014-08-31T22:27:16.643" Score="1" Body="&lt;h1&gt;Code Bots ϕ&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a challenge based on the popular Code Bots (&quot;What's wrong with public variables?&quot;) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/36978/whats-wrong-with-public-variables&quot;&gt;challenge&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I made a few observations during the development of the original Code Bots:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;I had a literal ton of ideas and wouldn't stop harassing Nathan Merrill about them.&lt;/li&gt;&#xA;&lt;li&gt;Nathan Merrill already claimed Code Bots 2.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The solution is obvious: make my own challenge.  So, that is exactly what I intend to do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note: I am working on various ways to distinguish the two challenges.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Variables&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Note: I have changed the names of some variables to make them more &quot;intuitive.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The variables &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt; each store an integer 0-23.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The variable &lt;code&gt;C&lt;/code&gt; (for Control) stores an integer 0-23 and is incremented at the end of every turn.  It indicates which line of the program is to be executed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The variable &lt;code&gt;D&lt;/code&gt; (for Direction) stores and integer 0-23, which determines the current direction of the bot.  The direction is determined by &lt;code&gt;{north east south west}[[D % 4]]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The variable &lt;code&gt;E&lt;/code&gt; (for Entropy) is overwritten by a random integer at the end of each turn, but only if your bot uses it that turn.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The variable &lt;code&gt;F&lt;/code&gt; (for Feeling) provides a sense of touch.  This allows you to detect when a bot is next to you.  The value equals the number of adjacent bots.  For example, &lt;code&gt;F&lt;/code&gt; equals &lt;code&gt;4&lt;/code&gt; when you are completely surrounded on all four sides (and thus out of luck).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The variable &lt;code&gt;G&lt;/code&gt; (for aGe) provides a timer.  The value is incremented after the end of every turn, mod 24.  This allows an easy way to do &lt;code&gt;for&lt;/code&gt;-like loops.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Instructions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each line contains a single command, and each command takes a variety of arguments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Flag&lt;/code&gt; : This represents your flag.  Your goal is to smear your flag across the known universe.  Each flag line has a hidden identifier denoting the owner.  These lines do nothing upon execution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Move&lt;/code&gt; : This moves the bot 1 unit forward in the direction that it is facing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Copy [expr|line] [var|line]&lt;/code&gt; : This copies one expression to another. Both expressions must be of the same type.  You can copy a line to another line or copy the value of one variable to another. Copying to yourself has a new advantage in that, instead of making an immediate change, the change is made just prior to the start of your next turn.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Copy2 [expr|line] [var|line]&lt;/code&gt; : This is a new version of copy, but instead of performing the action immediately after your turn, it performs the action immediately before your next turn.  &lt;em&gt;[todo: find a better name for it. Maybe &quot;DelayCopy&quot;]&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;If [cond] [line] [line]&lt;/code&gt; : This is an &lt;code&gt;If&lt;/code&gt; statement, one of the most important statements.  If the conditional evaluates to true, then the first of the two lines is executed immediately afterwards (on the same turn).  If the conditional is false, then the second line is executed immediately afterwards.  In order to prevent infinite loops of various kinds, a bot is not allowed to execute the same line twice in a single turn.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Jump [expr] [cond]&lt;/code&gt; : This is a new instruction designed to help speed up bots. Given a number &lt;code&gt;N&lt;/code&gt;, it immediately sets the value of &lt;code&gt;C&lt;/code&gt; to &lt;code&gt;N&lt;/code&gt; and then executes &lt;code&gt;#N&lt;/code&gt; on the same turn.  The condition is optional, but if present it will determine whether or not the Jump command is executed or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Block [var|line]&lt;/code&gt; : This blocks a certain variable or line.  Each variable or line can be blocked once, and this block prevents one modification attempt of that variable/line.  If an opponent (or yourself) attempts to modify that variable, then the variable is merely unblocked rather than modified.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Arguments&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are four types of arguments, &lt;code&gt;var&lt;/code&gt;, &lt;code&gt;line&lt;/code&gt;, &lt;code&gt;expr&lt;/code&gt;, and &lt;code&gt;cond&lt;/code&gt;.  Here are their relationships:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; var = *[var] | A | B | C | D | E&#xA;expr = [var] | [expr][op][expr] | [literal number]&#xA; op = + | - | %&#xA;line = *[line] | #[expr]&#xA;cond = [expr] | [line] | [expr]=[expr] | [expr]==[expr] | [line]=[line] | [line]==[line]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There are three types of operators which can be used in expressions: Addition &lt;code&gt;+&lt;/code&gt;, Subtraction &lt;code&gt;-&lt;/code&gt;, and Modulo &lt;code&gt;%&lt;/code&gt;. The modulo operator has highest preference (left to right), with addition/subtraction being applied afterwards. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are several different kinds of conditionals.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;If [expr]&lt;/code&gt; usually returns true if the value of the expression is non-zero.  There are several special cases. &lt;code&gt;If D&lt;/code&gt; returns true if there is a bot directly in front of you.  &lt;code&gt;If E&lt;/code&gt; returns true if &lt;code&gt;E&lt;/code&gt; is odd.  (Note: add more special cases)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;If [line]&lt;/code&gt; returns true if the line contains a flag.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;If [expr]=[expr]&lt;/code&gt; returns true if the two expressions are equal mod 4.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;If [line]=[line]&lt;/code&gt; returns true if the two lines are the same type (same command).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;If [expr]==[expr]&lt;/code&gt; returns true if both expressions are equal mod 24.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;If [line]==[line]&lt;/code&gt; returns true if the two lines are exactly equal (such as both flags having the same owner).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;The Turn Structure&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(Initially, all variables are 0 except for E)&#xA;[command execution starts]&#xA;The command at line #C is executed.&#xA;If there is a chain of logic, it is followed until it stops or a line is visited twice.&#xA;[updates]&#xA;The effect of a Copy statement is applied, if any.&#xA;C is incremented&#xA;If needed, E is randomized.&#xA;(other bot's turns here)&#xA;F is updated&#xA;The effect of a Copy2 statement is applied, if any.&#xA;[next command execution]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Line Labels&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To increase the ease of writing bots, there will be new things called line labels, which look like this &lt;code&gt;word:&lt;/code&gt; and can be placed at the start of a line.  Later in the code, you can reference the line label like this &lt;code&gt;:word&lt;/code&gt;.  (Note:  The exact formatting is up for discussion).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;During preprocessing, the controller will replace all instances of &lt;code&gt;:word&lt;/code&gt; with the number of the line labeled &lt;code&gt;word:&lt;/code&gt;.  If the &lt;code&gt;:word&lt;/code&gt; label is the only thing on the line (no command) then the entire line will be copied into that blank line.  Here is an example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;main: If D #:move #:attack&#xA;:main&#xA;:main&#xA;Jump :main&#xA;move: Move&#xA;attack: Copy #:flag *#*C&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Other usability features&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The language will be completely case-insensitive.  Comments will take the form of &lt;code&gt;//comment&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Arena&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There will be 50 bots of each type entered into an arena.  Initially, all of the bots will be evenly spaced on a grid and facing north.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;....@.......@.......&#xA;.......@.......@....&#xA;..@.......@.......@.&#xA;.....@.......@......&#xA;@.......@.......@...&#xA;...@.......@.......@&#xA;......@.......@.....&#xA;.@.......@.......@..&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note: I believe this to be an improvement because the bots are not directly lined up with each other.  In Code Bots 1, a bot could &lt;code&gt;Move&lt;/code&gt; on its first turn and end up right behind another bot.  In this grid, a bot has a much smaller chance of &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;A complicated example bot&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each bot can contain up to 24 lines, and each line contains an instruction.  If there are any blank lines (after substitution with line labels), then those lines are filled by Flags.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;main: If D #:attackloop #:move        //attack if an opponent &#xA;:main                             //automatically filled in with the same line&#xA;loop: jump :main                  //executes line 0 again and sets C to 0&#xA;move: if T #:run #:turn           //always move (never rotate) when being attacked&#xA;run: Move&#xA;turn: If E #:run #:turn2          //randomly pick move or rotate&#xA;turn2: Copy2 D+1 D&#xA;attackloop: jump :attack&#xA;attack: Copy #:freeze *#*C         //freeze the opponent&#xA;plant: Copy #C+6 *#E              //plant your flag&#xA;:plant&#xA;:plant&#xA;:plant&#xA;Jump :loop                        //return to main loop&#xA;freeze: Copy2 C-1 C             //this creates an endless loop when executed&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;After preprocessing, the above bot turns into the bot below.  You can also simply submit the bot below without using any line labels if you'd like.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;If D #8 #3&#xA;If D #8 #3&#xA;Jump 0&#xA;If T #4 #5&#xA;Move&#xA;If E #4 #6 &#xA;Copy2 D+1 D&#xA;Jump 9&#xA;Copy #14 *#*C&#xA;Copy #C+6 *#E&#xA;Copy #C+6 *#E&#xA;Copy #C+6 *#E&#xA;Copy #C+6 *#E&#xA;Jump 2&#xA;Copy2 C-1 C&#xA;Flag&#xA;Flag&#xA;Flag&#xA;Flag&#xA;Flag&#xA;Flag&#xA;Flag&#xA;Flag&#xA;Flag&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Short, Useful Code Snippets&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Block #G&#xA;Jump 0 G   //block all the lines in 24 moves&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.127" LastActivityDate="2015-06-01T13:20:24.923" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2125" PostTypeId="2" ParentId="2106" CreationDate="2014-08-31T23:39:52.287" Score="-1" Body="&lt;h3&gt;Yes, do post test suites as wiki'fied answers for some questions&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Executable test suites are an important part of programming practice. For problems with large and/or complex output spaces, they are necessary in order to quickly verify correct program behavior and track down incorrect behavior. Adding a wiki'fied &quot;answer&quot; containing an executable test suite is better than cluttering up the question with testing scripts that may not run in all environments and may not be usable with all languages (JavaScript being a noteworth example).&lt;/p&gt;&#xA;" OwnerUserId="20538" LastActivityDate="2014-08-31T23:39:52.287" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2126" PostTypeId="2" ParentId="2140" CreationDate="2014-09-01T06:02:39.440" Score="1" Body="&lt;h2&gt;Unicode Case Mapping &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Challenge:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given a string as input, print it in both lowercase and uppercase.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The string will be valid UTF-8, and your output should be as well. Characters without lowercase or uppercase mappings should be printed unmodified. Invalid, un-assigned, and private-use characters need not be handled.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Uppercasing and lowercasing should be doing according to Unicode 7.0 &quot;simple&quot; case mapping rules.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, shortest program wins. Your program shouldn't use any external data files or access anything from the internet; all of the information it needs should be contained within the code itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may not use your language's built-in case-mapping functions, built-in copies of the Unicode Character Databse, or libraries such as ICU. For example, in Perl the &lt;code&gt;lc&lt;/code&gt; and &lt;code&gt;uc&lt;/code&gt; functions as well as &lt;code&gt;Unicode::UCD&lt;/code&gt; are prohibited.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since this challenge is about Unicode I will throw in a small scoring twist: if your program is valid Unicode text (in whatever encoding your language prefers, probably UTF-8) you may score it at a rate of one point per character (regardless of how many bytes those characters take up). If it contains binary data then it must be scored at one point per byte. I will clarify what constitutes &quot;binary data&quot; if I have to.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Bonus:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Support &quot;full&quot; Unicode case mapping. The difference between &quot;full&quot; and &quot;simple&quot; mapping is that in &quot;simple&quot; mapping every codepoint maps to a single codepoint, while in full mapping a codepoint may map to multiple codepoints. For example, the uppercase of the character &quot;ﬀ&quot; (U+FB00) is &quot;FF&quot; (U+0046 U+0046). Assume that all &quot;conditions&quot; are false (that is, any rule with a non-empty &lt;code&gt;condition_list&lt;/code&gt; should be ignored).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Question: offer a point bonus for this? Recognize a separate winner among people that manage it? Drop it entirely?&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Resources:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.unicode.org/reports/tr44/tr44-14.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Unicode Standard Annex #44: Unicode Character Database&lt;/a&gt; — documentation for the UCD files.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.unicode.org/Public/7.0.0/ucd/UnicodeData.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;UnicodeData.txt&lt;/a&gt; — Unicode character properties, including simple lowercase/uppercase/titlecase mappings.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.unicode.org/Public/7.0.0/ucd/SpecialCasing.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;SpecialCasing.txt&lt;/a&gt; — Special-case rules for casing: contains full mappings.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="1683" LastActivityDate="2014-09-01T06:02:39.440" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2128" PostTypeId="2" ParentId="2140" CreationDate="2014-09-01T11:51:21.133" Score="0" Body="&lt;p&gt;&lt;strong&gt;Question about symmetry in ascii grid&lt;/strong&gt; (temp title)&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Synopsis:&lt;/strong&gt; Given a grid of ASCII characters, determine if, and in what ways, the grid is symmetrical.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Some characters are symmetrical to others. For example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;d&lt;/code&gt; is symmetrical vertically to &lt;code&gt;b&lt;/code&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;W&lt;/code&gt; is symmetrical horizontally to &lt;code&gt;M&lt;/code&gt;  &lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;O&lt;/code&gt; is symmetrical both ways to &lt;code&gt;O&lt;/code&gt;  &lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;!&lt;/code&gt; is symmetrical horizontally to &lt;code&gt;i&lt;/code&gt; (takes some imagination!)  &lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;^&lt;/code&gt; is symmetrical horizontally to &lt;code&gt;v&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;b&lt;/code&gt; is rotationally symmetrical 180 degrees to &lt;code&gt;q&lt;/code&gt; (that is, if you rotate the first character 180 degrees, you get the second character)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&lt;/code&gt; (space) is symmetrical vertically, horizontally, and rotationally to &lt;code&gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In this challenge, there are only three types of symmetry that need to be considered: vertical, horizontal, and rotational by 180 degrees. You can find a full list of which characters are considered symmetrical at the bottom of this post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we arrange some characters into an &lt;code&gt;n&lt;/code&gt; by &lt;code&gt;m&lt;/code&gt; rectangle (where &lt;code&gt;n&lt;/code&gt; and &lt;code&gt;m&lt;/code&gt; are both even integers), then the rectangle may be symmetrical. Here is an example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;M^^^^MM^^M&#xA;OOOOOOOOOO&#xA;OOOOOOOOOO&#xA;WvvvvWWvvW&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It is symmetrical horizontally.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's another example.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;dddbbb&#xA;dddbbb&#xA;dddbbb&#xA;ddOObb&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It is symmetrical vertically.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's one more example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;++++++&#xA;+p++q+&#xA;++++++&#xA;++++++&#xA;+b++d+&#xA;++++++&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This one has three ways it is symmetrical -- horizontally, vertically, &lt;em&gt;and&lt;/em&gt; rotationally.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program which will, when given a rectangle of characters as input, output the number of ways that rectangle is symmetrical. For the three inputs I've shown above, the outputs would be &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt;, and &lt;code&gt;3&lt;/code&gt; respectively.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;[Todo: list of characters]&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;One thing I've been considering is allowing entrants to access the list of which characters are symmetrical (in some sort of CSV format) in a file. This would mean that entrants wouldn't have to encode the symmetries themselves. On one hand, this probably saves some frustration at having to code in all the possible symmetries. On the other, this reduces the complexity of the challenge as the aspect of encoding the symmetries with minimal characters is removed. I'd like your thoughts on this.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="21682" LastEditDate="2015-08-05T08:08:39.890" LastActivityDate="2015-08-05T08:08:39.890" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="2129" PostTypeId="2" ParentId="2140" CreationDate="2014-09-01T12:12:49.273" Score="1" Body="&lt;h2&gt;King of the server - virus wars&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There is a virtual machine with Linux running various services (SSH server, Apache (with SSL), FTP server, rsync server, etc);&lt;/li&gt;&#xA;&lt;li&gt;There is tool which checks that the server is running (periodically accessing all its services - trying to view the page from Apache, download a file from FTP server, etc.) and analysing responses for special ID codes;&lt;/li&gt;&#xA;&lt;li&gt;There are submissions that are started on the server as root and should &quot;inject&quot; some ID code (individual per solution) in as much as possible places while inhibiting competitors;&lt;/li&gt;&#xA;&lt;li&gt;Each solution should try to attain the following goals:&lt;/li&gt;&#xA;&lt;li&gt;&lt;ul&gt;&#xA;&lt;li&gt;Make the server and it's services mention the ID code in maximum number of places with maximum reliability;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;ul&gt;&#xA;&lt;li&gt;Avoid stopping the server or breaking any of the services, avoid breaking reboots;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;ul&gt;&#xA;&lt;li&gt;Inhibiting competiting solutions (if any) while allowing them to post their ID code at least once;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The virtual machine gets booted, the solutions gets started there, then the script accesses the server from virtual network to check SSH/FTP/HTTP/... still running. The script also looks at the reply and counts any ID codes that appears in the replies. It happens multiple times. The serve gets rebooted N times.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Not all solutions gets planted on the server each time, just some random subset.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A solutions scheduled for the given round receive negative penalty points if:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The server crashed (stopped replying on requests from the virtual network);&lt;/li&gt;&#xA;&lt;li&gt;Some service on the server crashed (i.e. SSH still works, but HTTP is down);&lt;/li&gt;&#xA;&lt;li&gt;A competing solution have failed to provide it's ID code even once;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;If your solution crashes something or fails to provice the code even once even if run alone (without competitors) - it gets disqualified.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The solutions may use variety of methods to complete the goals:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Just changing configuration in &lt;code&gt;/etc&lt;/code&gt;;&lt;/li&gt;&#xA;&lt;li&gt;Patching system libraries to inject the ID code and/or supress other solutions;&lt;/li&gt;&#xA;&lt;li&gt;Carrying &quot;clean&quot; copy of libraries to avoid point &quot;2.&quot;;&lt;/li&gt;&#xA;&lt;li&gt;Loading kernel modules;&lt;/li&gt;&#xA;&lt;li&gt;Extracting competing ID code and manually providing it exactly once (to avoid the &quot;spawn camping&quot; early-kill  penalty);&lt;/li&gt;&#xA;&lt;li&gt;Loading security modules to make &lt;code&gt;root&lt;/code&gt; less omnipotent;&lt;/li&gt;&#xA;&lt;li&gt;Overriding a boot loader, making the server boot nonstandardly...&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The virtual machine image will be available from the beginning.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Questions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Is the idea worth thinking and fits PPCG enough?&lt;/li&gt;&#xA;&lt;li&gt;Shall all solutions be public from the beginning, or there can be hidden solutions (to prevent easy directed attacks)?&lt;/li&gt;&#xA;&lt;li&gt;Shall binary-only submissions be allowed?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="7773" LastEditorUserId="7773" LastEditDate="2014-09-01T13:23:41.477" LastActivityDate="2014-09-01T13:23:41.477" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="2130" PostTypeId="2" ParentId="2056" CreationDate="2014-09-01T14:51:25.393" Score="18" Body="&lt;h1&gt;Template for Challenge Proposals&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Every proposal should contain several fixed pieces of information, including a &lt;em&gt;title&lt;/em&gt;, the &lt;em&gt;tags&lt;/em&gt; you intend to use and &lt;em&gt;body&lt;/em&gt; of the challenge as you intend to post it on main. For a more uniform look of the sandbox (and easier orientation of reviewers), it is recommended that you use the following markdown template:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# My Challenge Title&#xA;[tag:my-challenge-type-tag] [tag:my-descriptive-tags]&#xA;&#xA;Here goes the body of your challenge, literally as you intend to post it on main.&#xA;Incomplete sections and notes intended only for the sandbox phase can be denoted&#xA;as follows: [**Sandbox note:** I still need to add test cases.]&#xA;&#xA;## Sandbox Questions&#xA;&#xA;In this section at the end you can put a few general sentences/questions aimed at&#xA;reviewers in the sandbox, e.g. to inform people what parts of the spec are still&#xA;subject to change or asking for specific feedback on parts of your challenge.&#xA;This is also the place to let people know if you are want to gauge the community's&#xA;interest in your problem before committing to finalizing the spec or writing a&#xA;verifier/controller for the challenge, so they will use their votes to indicate&#xA;interest in instead of completeness of the proposal.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2014-09-01T16:39:00.923" LastActivityDate="2014-09-01T16:39:00.923" CommentCount="0" CommunityOwnedDate="2017-11-30T08:34:33.320" ContentLicense="CC BY-SA 3.0" />
  <row Id="2131" PostTypeId="2" ParentId="2140" CreationDate="2014-09-01T15:41:31.073" Score="0" Body="&lt;h1&gt;American Roulette&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Roulette is one of the simplest casino games to understand, so I invite you all to see who gets the most money.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Coding&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You will be supplied with a singe argument via the command line. This argument will be the amount of money you have.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[command to run your code] [arg1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your output must be in the following format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[bet]|[amount of money you bet]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The following is a list of valid bets:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.predictem.com/images/roulette.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.predictem.com/images/roulette.gif&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Name                   | Example&#xA;-----------------------+-----------------------&#xA;Any number of numbers  | 12|100 or 36,19,18|100&#xA;00                     | 00|1000&#xA;0                      | 0|126&#xA;1st 12 (see image)     | 1st12|100&#xA;2nd 12 (see image)     | 2nd12|439&#xA;3rd 12 (see image)     | 3rd12|679&#xA;1 to 18                | 1-18|8&#xA;19-36                  | 19-36|10000&#xA;Red numbers            | red|1722&#xA;Black numbers          | black|1384&#xA;Odd numbers            | odd|100&#xA;Even numbers           | even|21900&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Payout will be calculated using the following equation where &lt;code&gt;n&lt;/code&gt; is the number of squares your bet will win on:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://upload.wikimedia.org/math/6/6/9/66946b321361a701f6b6903d5eae4b44.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://upload.wikimedia.org/math/6/6/9/66946b321361a701f6b6903d5eae4b44.png&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In your answer, I need the name of your program, your code and a command to run it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winning&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When enough people enter, I will run the controller twice a week. After four weeks, I will announce the winner (the person with the most money).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;I realise that is may be ambiguous and/or poorly worded so any feedback on how to pad this question out would be helpful.&lt;/h3&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="30525" LastEditDate="2014-09-01T16:08:10.187" LastActivityDate="2014-09-01T16:08:10.187" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="2133" PostTypeId="2" ParentId="2119" CreationDate="2014-09-01T19:55:37.223" Score="9" Body="&lt;p&gt;(I personally believe that question titles should be kept as clear and concise as possible, no misdirection, but for the sake of addressing &lt;a href=&quot;https://codegolf.stackexchange.com/q/33033/5138&quot;&gt;my own hypocrisy&lt;/a&gt; I'm going to play devil's advocate here.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unless you're the kind of SOer that reads everything on the front page all the time, you're not going to click every question. This, by nature, means you're going to miss out on some of the cool and novel ones, especially if they have boring titles and tags that don't immediately convey the coolness-and/or-novelty.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my personal transgression of potential click-baitery, I titled my question &quot;&lt;a href=&quot;https://codegolf.stackexchange.com/q/33033/5138&quot;&gt;Has my milk expired?&lt;/a&gt;&quot;, where the point was to count the ways you can interpret an ambiguous date. Maybe it's not that easy to infer that the question is about parsing ambiguous dates, like the kinds you find on perishable food items, but it's not an uncrossable logical gap, and it turned out to be &quot;8k views&quot;&amp;ndash;tier popular in the end.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Looking just at the title, would &quot;Has my milk expired?&quot; have fared worse if it was called &quot;Parse ambiguous dates&quot;? I can't say for sure, but that title definitely doesn't make it seem like something that deserves to be solved. There's no context, so it just sounds like an unmotivated exercise. &lt;strong&gt;By letting the motivation infect the title, it gives people a reason not to judge the book solely by its cover.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the golfer already has the problem placed in front of them, they can decide whether they'll try to golf it. Once you have a problem you know would pass, putting their eyeballs on the problem&amp;mdash;getting them to click through to the question and read past the first few lines&amp;mdash;is the weak link in the chain.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've said nothing of titles that are intentionally obtuse. Though it's hard to say whether a question is good enough to &quot;deserve&quot; a beneficially misleading title, I think that the community can and should deal with this on a question-by-question basis for what it deems offenders. Otherwise, I will assert that the coolness-and/or-novelty of your question &lt;em&gt;really does&lt;/em&gt; depend on how well you can sell that question to PPCG.&lt;/p&gt;&#xA;" OwnerUserId="5138" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-09-01T19:55:37.223" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2137" PostTypeId="2" ParentId="2140" CreationDate="2014-09-04T16:38:46.720" Score="0" Body="&lt;h1&gt;A game of chance&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Hello!  Thought I would try out the sandbox, a rather useful tool that I haven't utilized yet!  This is a game I thought up with some colleagues, basic in theory but has some deeper algorithms to win.  I'm thinking of tagging this as code-challenge, any opinions welcome, especially a better name.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;How to Play&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Every turn, you get one number, pseudo-randomly generated, you need to put this number in a list.  The list must always be in numerical order, from lowest to highest, and cannot be changed after the turn has ended.  If you can no longer put the number anywhere, where it will still be in numerical order, you lose.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The list is 100 entries, which start as empty slots (seen as &quot;-&quot; or unique characters for your language) and slowly becomes a list of numbers (&lt;a href=&quot;https://www.dropbox.com/s/8pw6byv3n901e02/Result.png?dl=0&quot; rel=&quot;nofollow&quot;&gt;example that just lost&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You cannot edit the position of a value in the list.&lt;/li&gt;&#xA;&lt;li&gt;The value will be inputted every turn.&lt;/li&gt;&#xA;&lt;li&gt;The random numbers are X-Y.  Both X and Y will always be positive and from 0 to 65535.&lt;/li&gt;&#xA;&lt;li&gt;I'm willing to input the number in most ways&lt;/li&gt;&#xA;&lt;li&gt;Any language that I can run!  I have both Windows 7 and Linux Mint + VMs for other versions.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You get 1 point for every round you last.  There are 10 (TBD) rounds for each score, resulting in a maximum score of 1000 (which is very unlikely to ever get).&lt;/p&gt;&#xA;" OwnerUserId="30530" LastEditorUserId="30530" LastEditDate="2014-09-07T17:23:18.550" LastActivityDate="2014-09-07T17:23:18.550" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="2138" PostTypeId="2" ParentId="2140" CreationDate="2014-09-04T16:47:33.663" Score="3" Body="&lt;h1&gt;BS&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal of this challenge is to implement an AI for the game of BS, also known as Bull Shit, Cheat, Bluff, and numerous other names.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The game is outlined in &lt;a href=&quot;http://en.wikipedia.org/wiki/Cheat_(game)&quot; rel=&quot;nofollow noreferrer&quot;&gt;this wikipedia article&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Rules of the Game&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For the purposes of this challenge, the game will work like this:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A standard 52-card deck is dealt out to the players&lt;/li&gt;&#xA;&lt;li&gt;The current rank is set to Ace&lt;/li&gt;&#xA;&lt;li&gt;The play order is randomized&lt;/li&gt;&#xA;&lt;li&gt;The player holding the Ace of Hearts goes first&lt;/li&gt;&#xA;&lt;li&gt;On each player's turn:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The current player plays some number of cards&lt;/li&gt;&#xA;&lt;li&gt;The current player states how many of what rank they played&lt;/li&gt;&#xA;&lt;li&gt;Other players may declare 'BS'.&lt;/li&gt;&#xA;&lt;li&gt;If any player declares 'BS':&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;All players are notified of which players declared 'BS'.&lt;/li&gt;&#xA;&lt;li&gt;The played cards are revealed to all players.&lt;/li&gt;&#xA;&lt;li&gt;If the played cards are &lt;strong&gt;inconsistent&lt;/strong&gt; with the current player's statement:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The current player adds the played cards and all cards in the pile to their hand&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;If the played cards are &lt;strong&gt;consistant&lt;/strong&gt; with the current player's statement:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The &lt;strong&gt;last&lt;/strong&gt; player to declare 'BS' that round adds the played cards and pile to their hand.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;If no player declares 'BS':&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The played cards are added to the pile, without revealing them.&lt;/li&gt;&#xA;&lt;li&gt;If the played cards were inconsistant with the current player's statement, the current player may declare 'Peanut Butter'.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;If the current player has no cards in their hand, the current player wins.&lt;/li&gt;&#xA;&lt;li&gt;The current rank is incremented. (If the current rank is King, it becomes Ace.)&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;The Messaging Protocol&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Play will be conducted via messages passed to the standard input and received from the standard output of each program. Each message will be terminated with a single newline character.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Cards&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Card ranks are represented as one of &lt;code&gt;A&lt;/code&gt;, &lt;code&gt;2&lt;/code&gt;, &lt;code&gt;3&lt;/code&gt;, &lt;code&gt;4&lt;/code&gt;, &lt;code&gt;5&lt;/code&gt;, &lt;code&gt;6&lt;/code&gt;, &lt;code&gt;7&lt;/code&gt;, &lt;code&gt;8&lt;/code&gt;, &lt;code&gt;9&lt;/code&gt;, &lt;code&gt;T&lt;/code&gt;, &lt;code&gt;J&lt;/code&gt;, &lt;code&gt;Q&lt;/code&gt;, or &lt;code&gt;K&lt;/code&gt;. Card suits will be represented as one of  &lt;code&gt;S&lt;/code&gt;, &lt;code&gt;C&lt;/code&gt;, &lt;code&gt;H&lt;/code&gt;, or &lt;code&gt;D&lt;/code&gt;.&#xA;Cards are represented as the rank, followed immediately by a suit. For instance, the Ten of Clubs would be represented by &lt;code&gt;TC&lt;/code&gt;, and the Three of Hearts would be represented by &lt;code&gt;3H&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A hand of cards will be represented as a space-delimited sequence of cards. For instance, a hand containing the Queen of Spades and the Six of Diamonds could be represented as &lt;code&gt;QS 6D&lt;/code&gt; or &lt;code&gt;6D QS&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Player Identification&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A player will be represented by their nickname, followed by a number from 0 to 32768, in parenthesis, formatted as an integer. This number is guaranteed to be unique within a particular game. A player's nickname must have at least one character, can have up to 32 characters, and may only include letters, numbers, and underscores. For instance, a player with nickname &lt;code&gt;ExampleAI&lt;/code&gt; and ID number 16480 would be identified in the game as &lt;code&gt;ExampleAI(16480)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When the game begins, each program will recieve a message containing their unique ID:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;Unique ID: &lt;i&gt;uniqueID&lt;/i&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Each player will reply with their desired nickname:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;Nickname: &lt;i&gt;name&lt;/i&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Names may contain only alphanumeric characters and underscores.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After all players have responded with their nickname, the standard play sequence begins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Standard Play Sequence&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When a player's turn begins, each player will receive a  be given a list of the players and their card counts, in order of play:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;Players: &lt;i&gt;player&lt;/i&gt;[&lt;i&gt;count&lt;/i&gt;], &lt;i&gt;player&lt;/i&gt;[&lt;i&gt;count&lt;/i&gt;], ... &lt;i&gt;player&lt;/i&gt;[&lt;i&gt;count&lt;/i&gt;]&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Each player will be informed of the contents of their hands:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;Hand: &lt;i&gt;initial_hand&lt;/i&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The current the player will then receive this message:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;Your turn: &lt;i&gt;current_rank&lt;/i&gt; &lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The current player will reply with a space-separated list of  of cards:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;Play: &lt;i&gt;list_of_cards&lt;/i&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Once they have submitted their play, all players will receive the number of cards, formatted as an integer, along with the current rank:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;Player &lt;i&gt;player&lt;/i&gt; plays: &lt;i&gt;nunber_of_cards&lt;/i&gt; x &lt;i&gt;current_rank&lt;/i&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Each other player may then declare BS on that play by sending any message up to 32 characters, containing the capital letters &lt;code&gt;B&lt;/code&gt; and &lt;code&gt;S&lt;/code&gt;, and otherwise only contains lowercase letters and spaces. So any of &lt;code&gt;Bull Shit&lt;/code&gt;,  &lt;code&gt;Bananna Split&lt;/code&gt; or &lt;code&gt;Bacon Sandwich&lt;/code&gt; would be acceptable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;During this period, the current player may declare Peanut Butter by sending any message up to 32 characters, as long as it contains the capital letters &lt;code&gt;P&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt;, and otherwise only contains lowercase letters and spaces. So any of &lt;code&gt;Peanut Butter&lt;/code&gt;, &lt;code&gt;Pancake Batter&lt;/code&gt; or &lt;code&gt;Polish Bacon&lt;/code&gt; would be acceptable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In order to allow the game to move faster, if a player does not wish to declare either of these things, they must instead send:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;Pass&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;After all players have responded, all players will receive a list of players who called BS, in the order they called it:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;Called BS: &lt;i&gt;player&lt;/i&gt;, &lt;i&gt;player&lt;/i&gt; ... &lt;i&gt;player&lt;/i&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If no player called BS, this message will still be sent --- it just won't have any players listed.&#xA;If any player did call BS, then all players will recieve:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;Player &lt;i&gt;player&lt;/i&gt; had played: &lt;i&gt;list_of_cards&lt;/i&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If they were bluffing, all players recieve:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;Player &lt;i&gt;player&lt;/i&gt; was bluffing.&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And the current player receives:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;Your bluff was called: &lt;i&gt;list_of_cards_recieved&lt;/i&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If they were not bluffing, all players recieve:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;Player &lt;i&gt;player&lt;/i&gt; was not bluffing.&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;Player &lt;i&gt;last_player&lt;/i&gt; receives the pile.&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The last player who called BS recieves this message:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;You misjudged: &lt;i&gt;list_of_cards_received&lt;/i&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The list of cards received will contain, in reverse chronological order, the contents of each play since the last call. (Separate plays will not be delimited in the list.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If no player declared BS, and the current player was bluffing and declared Peanut Butter, then all players recieve the message:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;Player &lt;i&gt;player&lt;/i&gt; was bluffing.&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If the current player has no cards left in their hand, all players receive this message, and the game terminates:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;Player &lt;i&gt;player&lt;/i&gt; won!&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Otherwise, the next player's turn begins.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Example Game&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The following might be considered a typical (abbreviated) message transcript:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;Unique ID: 16481&#xA;&gt; Nickname: Alice&#xA;Players: Alice(16481)[18], Bob(16479)[17], Charlie(16480)[17]&#xA;Hand: 2D 7S AS TC 5S JS JC 3C 8H 9D 5D AH 7C 6C 4D KC KH KS&#xA;Your turn: A&#xA;&gt; Play: AS 2D AH&#xA;Player Alice(16481) plays: 3 x A&#xA;&gt; PB&#xA;Called BS:&#xA;Player Alice(16481) was bluffing.&#xA;Players: Bob(16479)[17], Charlie(16480)[17], Alice(16481)[15]&#xA;Hand: 7S TC 5S JS JC 3C 8H 9D 5D 7C 6C 4D KC KH KS&#xA;Player Bob(16479) plays: 2 x 2&#xA;&gt; BS&#xA;Called BS: Alice(16481)&#xA;Player Bob(16479) had played: 2H 2C&#xA;Player Bob(16479) was not bluffing.&#xA;Player Alice(16481) takes the pile.&#xA;You misjudged: 2H 2C AS 2D AH&#xA;Players: Charlie(16480)[17], Alice(16481)[20], Bob(16479)[15]&#xA;Hand: 7S TC 5S JS JC 3C 8H 9D 5D 7C 6C 4D KC KH KS 2H 2C AS 2D AH&#xA; .&#xA; .&#xA; .&#xA;Players: Alice(16481)[3], Bob(16479)[41], Charlie(16480)[8]&#xA;Hand: KC KH KS&#xA;Your turn: K&#xA;&gt; Play: KC KH KS&#xA;Called BS: Charlie(16480), Bob(16479)&#xA;Player Alice(16481) was not bluffing.&#xA;Player Bob(16479) receives the pile.&#xA;Player Alice(16481) won!&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your implementation may be written in any language, provided that you, upon request, provide a link to a suitable free-as-in-freedom compiler or interpreter that I can download and run at no cost. You also need to provide a UNIX command that can start your program.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox Questions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I want to gauge the community's interest in my problem before finalizing the spec and writing the control program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also need to get some idea of what sort of time-limiting scheme would be reasonable. In order to be able to to a lot of runs, I will need to be able to ensure that each AI doesn't take too much time to make its decisions, or prevent a stuck AI from holding up a game. I also need to be able to ensure that there is no motivation to deliberately stall a game. For example, if an AI determines that it is very unlikely to win, it might stall in order to prevent the game from finishing. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would also like feedback on the messaging protocol:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are there any additional messages that you think should be passed?&lt;/li&gt;&#xA;&lt;li&gt;Would it be more convenient/clear if one or more of them were formatted differently?&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Would it be better to use a different format for the  &lt;code&gt;plays&lt;/code&gt; message?&lt;/li&gt;&#xA;&lt;li&gt;Would it be better to use different words to help distinguish the &lt;code&gt;plays&lt;/code&gt; and &lt;code&gt;played&lt;/code&gt; messages?&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="7981" LastEditorUserId="7981" LastEditDate="2014-09-05T13:23:56.227" LastActivityDate="2014-09-05T13:23:56.227" CommentCount="20" ContentLicense="CC BY-SA 3.0" />
  <row Id="2139" PostTypeId="2" ParentId="2140" CreationDate="2014-09-04T19:25:29.907" Score="2" Body="&lt;h1&gt;Balda AI in under 8192 bytes &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/word-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;word-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;word-puzzle&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Balda is a Russian word game which bears some similarities to Scrabble. Your task is to write an AI for an English version of it. However, because you can place any letters, the game would be easy if you knew all the words in the English language - hence, your entire program, including any word list, must be 8192 bytes or less.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Game&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The game consists of a square of 5x5 cells; each cell can be empty or hold one letter. At the start, a randomly selected 5-letter word is placed into the middle row. Example (please excuse my terrible ASCII art skills):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+---+---+---+---+---+&#xA;|   |   |   |   |   |&#xA;+---+---+---+---+---+&#xA;|   |   |   |   |   |&#xA;+---+---+---+---+---+&#xA;| P | L | A | N | E |&#xA;+---+---+---+---+---+&#xA;|   |   |   |   |   |&#xA;+---+---+---+---+---+&#xA;|   |   |   |   |   |&#xA;+---+---+---+---+---+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There are two players. Each turn, a player must place &lt;em&gt;one&lt;/em&gt; letter into an empty cell - any letter may be used. They must then compose a word which contains this letter. Words consist of horizontally and vertically adjacent letters; they can be backwards, upside-down, in a circle or any other shape. The player then receives one point per letter in this word. Words must be singular common nouns and at least 3 letters long. No word may be used twice in one game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The game ends when there are no empty cells left, and the player with the most points wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Part of an example game:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+---+---+---+---+---+&#xA;|   |   |   |   |   |&#xA;+---+---+---+---+---+&#xA;|   | T | N |   |   | &amp;lt; TURN 1: Player 1 writes PLAN; Player 2 writes PLANT. Score 4:5&#xA;+---+---+---+---+---+&#xA;| P | L | A | N | E |&#xA;+---+---+---+---+---+&#xA;|   |   |   | T | T | &amp;lt; TURN 2: Player 1 writes PLANET; Player 2 writes TENT. 10:9&#xA;+---+---+---+---+---+&#xA;|   |   |   |   |   |&#xA;+---+---+---+---+---+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Control, Input, Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program will be invoked once per turn and at the end of the game, with the following arguments, where game_status is 0 if the game is still in progress, 1 if it ended because no spaces are left, 2 if it ended because player 1 failed to provide a word, 3 for player 2, 4 if player 1 gave an invalid word and 5 for player 2:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;your_player_number player1_score player2_score game_status&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The previously used words and the game board (separated by a line with a &lt;code&gt;*&lt;/code&gt;) will be provided on standard input, in the following format (blank cells are underscores):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;PLANE&#xA;PLAN&#xA;PLANT&#xA;PLANET&#xA;TENT&#xA;*&#xA;_____&#xA;_TN__&#xA;PLANE&#xA;___TT&#xA;_____&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It has 30 seconds to output a move in the following format. In the example, the N of PLANT is in row 2 and column 3:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ROW_NUMBER COLUMN_NUMBER LETTER_PLACED WORD_LETTER1_ROW WORD_LETTER1_COLUMN WORD_LETTER2_ROW WORD_LETTER2_COLUMN ..........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Player 2's second move in the example would be written as follows. &lt;code&gt;4 5 3 5 3 4 4 4&lt;/code&gt; are the co-ordinates of each of the word's letters, in order.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4 4 T 4 5 3 5 3 4 4 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program must be 8192 bytes or shorter at the start of the tournament. However, it may create any files and keep them between tournament games - hence, it can learn from its opponents.&lt;/li&gt;&#xA;&lt;li&gt;Your program must have a name and version numbering.&lt;/li&gt;&#xA;&lt;li&gt;Please provide instructions on how to run your program on Windows 8.1.&lt;/li&gt;&#xA;&lt;li&gt;Libraries which provide word lists or are designed for word puzzles are not allowed.&lt;/li&gt;&#xA;&lt;li&gt;Libraries created after this challenge was posted are not allowed.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/16402&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden. No web access.&lt;/li&gt;&#xA;&lt;li&gt;Existing compression algorithms such as gzip are allowed, and you may use libraries to decompress them, but the decompression must be done in your program.&lt;/li&gt;&#xA;&lt;li&gt;You must write a complete program, not a function.&lt;/li&gt;&#xA;&lt;li&gt;If the control program detects that no words can be written, the game ends and the player with the most points wins.&lt;/li&gt;&#xA;&lt;li&gt;If words can be written, but a player cannot submit a valid word in 30 seconds, they lose regardless of their score.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.dropbox.com/s/k980amydjhqam3o/wordlist.txt?dl=0&quot; rel=&quot;nofollow noreferrer&quot;&gt;This is the official word list.&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.dropbox.com/s/9jbemttpxd575ly/startwords.txt?dl=0&quot; rel=&quot;nofollow noreferrer&quot;&gt;This is the same list, but only with five-letter words&lt;/a&gt; (i.e. those that can be the starting word)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user16402" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2014-12-28T12:27:25.453" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="2140" PostTypeId="1" CreationDate="2014-09-04T21:27:25.970" Score="572" ViewCount="336263" Body="&lt;p&gt;This &amp;quot;sandbox&amp;quot; is a place where Code Golf users can get feedback on prospective challenges they wish to post to main. This is useful because writing a clear and fully specified challenge on your first try can be difficult, and there is a much better chance of your challenge being well received if you post it in the sandbox first.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2056/3808&quot;&gt;Sandbox FAQ&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Posting&lt;/h2&gt;&#xA;&lt;p&gt;To post to the sandbox, scroll to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges#show-editor-button&quot;&gt;bottom of this page&lt;/a&gt; and click &amp;quot;Answer This Question&amp;quot;. Click &amp;quot;OK&amp;quot; when it asks if you really want to add another answer.&lt;/p&gt;&#xA;&lt;p&gt;Write your challenge just as you would when actually posting it, though you can optionally add a title at the top. You may also add some notes about specific things you would like to clarify before posting it. Other users will help you improve your challenge by rating and discussing it.&lt;/p&gt;&#xA;&lt;p&gt;When you think your challenge is ready for the public, go ahead and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/ask&quot;&gt;post it&lt;/a&gt;, and &lt;strong&gt;replace the post here with a link to the challenge and delete the sandbox post.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Discussion&lt;/h2&gt;&#xA;&lt;p&gt;The purpose of the sandbox is to give and receive feedback on posts. If you want to, feel free to give feedback to any posts you see here. Important things to comment about can include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Parts of the challenge you found unclear&lt;/li&gt;&#xA;&lt;li&gt;Comments addressing specific points mentioned in the proposal&lt;/li&gt;&#xA;&lt;li&gt;Problems that could make the challenge uninteresting or unfit for the site&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You don't need any qualifications to review sandbox posts. The target audience of most of these challenges is code golfers like you, so anything you find unclear will probably be unclear to others.&lt;/p&gt;&#xA;&lt;p&gt;If you think one of your posts requires more feedback, but it's been ignored, you can ask for feedback in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;. It's not only allowed, but highly recommended! Be patient and try not to nag people though, you might have to ask multiple times.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;It is recommended to leave your posts in the sandbox for at least several days, and until it receives upvotes and any feedback has been addressed.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Other&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/search?tab=active&amp;amp;q=inquestion%3A2140&quot;&gt;Search the sandbox&lt;/a&gt; / &lt;a href=&quot;https://codegolf.meta.stackexchange.com/search?tab=active&amp;amp;q=inquestion%3A2140+user%3Ame&quot;&gt;Browse your pending proposals&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The sandbox works best if you sort posts by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?answertab=modifieddesc#tab-top&quot;&gt;active&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;To add an inline tag to a proposal, use shortcut link syntax with a prefix: &lt;code&gt;[tag:king-of-the-hill]&lt;/code&gt;. To search for posts with a certain tag, include the name in quotes: &lt;code&gt;&amp;quot;king-of-the-hill&amp;quot;&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="31362" LastEditorUserId="91213" LastEditDate="2023-04-24T16:20:37.960" LastActivityDate="2024-04-06T07:04:13.983" Title="Sandbox for Proposed Challenges" Tags="|discussion|sandbox|" AnswerCount="4662" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="2141" PostTypeId="2" ParentId="2140" CreationDate="2014-09-05T03:24:53.750" Score="0" Body="&lt;h1&gt;Print the Constitutional Amendment&lt;/h1&gt;&#xA;&lt;p&gt;Given a number from 1 to 27, print the appropriate amendment to the US Constitution, using &lt;a href=&quot;http://pastebin.com/kbX58C5B&quot; rel=&quot;nofollow noreferrer&quot;&gt;this text&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your score is the byte count of your source code, divided by the byte count of the best answer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/6043/were-no-strangers-to-code-golf-you-know-the-rules-and-so-do-i&quot;&gt;this question&lt;/a&gt; in the same language. Therefore, you must use a language which had an answer to that question before September 1, 2014.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Question&lt;/h2&gt;&#xA;&lt;p&gt;Is this too similar to existing Kolmogorov-complexity challenges?&lt;/p&gt;&#xA;" OwnerUserId="16294" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-09-05T03:24:53.750" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2143" PostTypeId="2" ParentId="2140" CreationDate="2014-09-05T22:34:49.503" Score="0" Body="&lt;h2&gt;Capture the flag&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Basic rules&lt;/h2&gt;&#xA;&lt;p&gt;There is a rectangular map of cells, each bot has current cell. Bots compete 1 vs 1 at a time, let's call them red and blue. There are N instances of red bot and N instances of the blue bot on the map. Additionally, there is unmovable red base and blue base, both having initially the red flag and blue flag respectively. Bot instances can move around, supress enemy bot instances, capture the enemy's flag. The goal is to bring enemy's flag to the base (which should have the flag). The flag can be returned back to the base. Bots can pass the flag around.&lt;/p&gt;&#xA;&lt;h2&gt;Selectable rules (to be decided)&lt;/h2&gt;&#xA;&lt;h3&gt;Map style&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;2D, 3D or 2.5D;&lt;/li&gt;&#xA;&lt;li&gt;Wrapped-around or not;&lt;/li&gt;&#xA;&lt;li&gt;With walls (destructible, indestructible, buildable by bots) or without;&lt;/li&gt;&#xA;&lt;li&gt;Bases positions and bots initial positions: random, selectable by player, hardcoded in a map?&lt;/li&gt;&#xA;&lt;li&gt;Random-generated, pre-programmed, partially selectable by the player?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Bot capabilities&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Moving diagonally? Dodging?&lt;/li&gt;&#xA;&lt;li&gt;Seeing the entire map or only surroundings?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Intra-team bot communication&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Uninhibited&lt;/li&gt;&#xA;&lt;li&gt;Only using messages that takes a move to create or read and that travel not too fast;&lt;/li&gt;&#xA;&lt;li&gt;Inhibited (only indirect by observing positions);&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Prior knowledge&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should bots know the walls of the map from the beginning?&lt;/li&gt;&#xA;&lt;li&gt;Should bots know the bases posisions from the beginning?&lt;/li&gt;&#xA;&lt;li&gt;Should bots know enemy bots positions from the beginning?&lt;/li&gt;&#xA;&lt;li&gt;If communication between bots is not free, should bots know initial frindly bots position from the beginning?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Attacking&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Only nearby bots or also &amp;quot;shooting&amp;quot;?&lt;/li&gt;&#xA;&lt;li&gt;Multiple weapons or not?&lt;/li&gt;&#xA;&lt;li&gt;Dodge/protect move?&lt;/li&gt;&#xA;&lt;li&gt;One-hit or health points?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Abandoned flag&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is reset to the appropriate base after timeout;&lt;/li&gt;&#xA;&lt;li&gt;Is reset to the appropriate base instantly;&lt;/li&gt;&#xA;&lt;li&gt;Needs to be carried by the bot manually;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Reset the game after each flag score or continue the game for N moves or N scores?&lt;/li&gt;&#xA;&lt;li&gt;What to do in case of stalemate?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Questions&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Is this challenge a good idea?&lt;/li&gt;&#xA;&lt;li&gt;Which set of proposed rule variants to choose?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;My current choice is:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Rectangular 2D map without wraparound, with big walls pre-programmed, random single wall-lets placed randomly;&lt;/li&gt;&#xA;&lt;li&gt;Bases positions are pre-defined and known in advance to all bots;&lt;/li&gt;&#xA;&lt;li&gt;Bots having 10 health points, carrying chainsaw (5 damage, 1 distance) and a gun (2 damage, 10 distance);&lt;/li&gt;&#xA;&lt;li&gt;Bots can stay&amp;amp;defend (half of received damage), move 1 cell to 8 directions, attack (without moving); build up to 8 pieces of wall in neighbouring cell, destroy 1 piece of neighbouring wall, capture the flag, score the goal, send a message.&lt;/li&gt;&#xA;&lt;li&gt;Bots can cee a 11x11 rectangle, centered around them, including through walls;&lt;/li&gt;&#xA;&lt;li&gt;Bots are stateful, but can't communicate with other instances directly. They can observe movements of other bots in the vision field or receive messages (if any). The message is a 4 bytes of data (i.e. a number from 0 to 2^32-1) + 1 byte of signal strength, it travels 5 cells per move, decreasing signal strength by one. Message gets received (including the current &amp;quot;signal strength&amp;quot; parameter) by all bots (including enemy ones). Bots reads the message (if any) before making a move. If there are multiple messages, only one with larger signal strength gets received. Hovewer if signal strengths differ only by 1, contect gets XORed.&lt;/li&gt;&#xA;&lt;li&gt;Player choses initial positions (relative to own base) of all his bots;&lt;/li&gt;&#xA;&lt;li&gt;All bots know the initial walls in the map;&lt;/li&gt;&#xA;&lt;li&gt;While the bots stays close to own base, it's health gets recovered by 1 point per move, up to 10, if the flag is present.&lt;/li&gt;&#xA;&lt;li&gt;Each round gets until one of the team scores 5 goals. This team wins (5-x) points, where x is number of opposin team's goals.&lt;/li&gt;&#xA;&lt;li&gt;Abandoned flag can be picked up by either team. All bots know relative position of the own flag at any moment.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="7773" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-09-05T22:34:49.503" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2147" PostTypeId="2" ParentId="2140" CreationDate="2014-09-07T04:35:44.387" Score="0" Body="&lt;p&gt;&lt;strong&gt;Unbreakable Wall Maria&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; AND ( &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; OR &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; )&lt;/p&gt;&#xA;&lt;p&gt;In order to protect the last bastion of human civilisation against giant Titans, a large wall has been constructed around the perimeter of the city. It has been decided that another large wall, within the perimeter of the first one, will be erected to ensure the protection of the city. You have been assigned to design the wall to make sure it is strong and sturdy.&lt;/p&gt;&#xA;&lt;p&gt;A wall of height &lt;code&gt;p&lt;/code&gt; and length &lt;code&gt;q&lt;/code&gt; is built out of identical rectangular blocks of height &lt;code&gt;m&lt;/code&gt; and length &lt;code&gt;n&lt;/code&gt;. A wall is considered unsecure if there is a straight line that can divide the wall into two pieces without cutting through any of the individual blocks. To illustrate, consider a wall of height 5 and length 6, constructed of blocks of 1 height and 2 length placed in either orientation. This is the test case &lt;code&gt;5 6 1 2&lt;/code&gt; (a 5x6 wall composed of 1x2 blocks). There are at least two different ways of building this wall:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/SPAg3.png&quot; alt=&quot;Image illustrating ways of presenting the walls&quot; /&gt;&lt;br /&gt;&#xA;&lt;em&gt;Diagram 1: Ways of building a wall&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;The first wall is an &lt;em&gt;insecure&lt;/em&gt; wall because there is a line that divides the wall into two pieces (into a 6x4 block and a 6x2 block). Because there is only one line that divides the wall, we can call this wall an &lt;em&gt;insecure-1&lt;/em&gt; wall. An &lt;em&gt;insecure-1&lt;/em&gt; wall is more secure than an &lt;em&gt;insecure-2&lt;/em&gt; wall, but not as secure as a secure wall.&lt;/p&gt;&#xA;&lt;p&gt;The second wall is a &lt;em&gt;secure&lt;/em&gt; wall because there is no line that can divide the wall into two pieces without going through any of the blocks. You could also think of it as &lt;em&gt;insecure-0&lt;/em&gt; if you wanted to.&lt;/p&gt;&#xA;&lt;p&gt;A secure wall is essential to the integrity of the wall. If it is an insecure wall it will be easily breached by the Titans. Your task is to design the wall. To do this, you will write a program that takes in the height and length of the wall and the blocks as input, and output (&lt;em&gt;a graphical representation&lt;/em&gt; / &lt;em&gt;an ASCII art representation&lt;/em&gt;) of the most secure wall that can be created using the blocks given.&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;Input consists of four space seperated integers &lt;code&gt;p&lt;/code&gt;, &lt;code&gt;q&lt;/code&gt;, &lt;code&gt;m&lt;/code&gt;, and &lt;code&gt;n&lt;/code&gt;, which represents the height of the wall, the length of the wall, the height of the blocks, and the length of the blocks.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;This is the part I'm not sure about. I've got two possibilities: either I can make the question graphical output (i.e. I would expect the program to output an actual image), or ASCII art.&lt;/p&gt;&#xA;&lt;p&gt;Possibility 1:&lt;/p&gt;&#xA;&lt;p&gt;Output a &lt;em&gt;graphical image&lt;/em&gt; (not ASCII art) of the wall. The overall appearance of the wall (e.g. line thickness, colours used, size, etc.) is up to you, but the lines that form the individual blocks must be clearly visible, and differentiated from the rest of the wall. This means you can't pull something like &amp;quot;this draws a black wall with black lines&amp;quot;, or &amp;quot;this draws an infinitesimally small scaled wall&amp;quot;, etc.&lt;/p&gt;&#xA;&lt;p&gt;Possibility 2:&lt;/p&gt;&#xA;&lt;p&gt;Output &lt;em&gt;text based art&lt;/em&gt; (not a graphical image) of the wall. It should be drawn using the &lt;a href=&quot;http://en.wikipedia.org/wiki/Box-drawing_character&quot; rel=&quot;nofollow noreferrer&quot;&gt;box drawing characters&lt;/a&gt;. The wall must be drawn to scale, but apart from that, you have some freedom in what characters to use (so you can choose to use the double line ones if you wish), but they have to be part of the Box Drawing Unicode block. In addition, the wall must be visible, so you can't write a program that outputs nothing and say &amp;quot;this draws an infinitesimally small scaled wall&amp;quot;, etc.&lt;/p&gt;&#xA;&lt;p&gt;Question to reader: Which output format do you think would make a more interesting challenge?&lt;/p&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-10-09T01:18:23.520" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2155" PostTypeId="1" CreationDate="2014-09-08T20:51:58.580" Score="10" ViewCount="210" Body="&lt;p&gt;Sometimes a problem is already solved elsewhere on the internet in an impressive fashion. Quite often people post these answers as well (with attribution to the original author). Of course, there is no effort on the side of the author, other than finding (or knowing) that external source.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What is our policies on such answers? Are they valid? They &lt;em&gt;do&lt;/em&gt; answer the question after all. Should they be community wiki? Should they be comments? If they should be answers, are they eligible for being accepting or receiving bounties?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/37475/8478&quot;&gt;Write a Polyquine&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/80/8478&quot;&gt;Golf you a quine for great good!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/36171/8478&quot;&gt;Is it dark outside? Draw a sun map!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-05-24T08:35:52.467" Title="How do we post solutions from external sources?" Tags="|discussion|policy|answers|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="2158" PostTypeId="2" ParentId="2140" CreationDate="2014-09-09T12:38:33.237" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Dots_and_Boxes&quot; rel=&quot;nofollow&quot;&gt;Dots and Boxes&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The goal is writing a function in [language], that accepts the grid and outputs what dots it wants to connect next.&#xA;This is a King of the Hill challenge. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;How the game works&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The (square) field has 6x6 dots. The two players are conenct one after another each time two neighbour dots (vertically or horizontally). If one player closed a square (1x1) in his last step, this square counts as his. The game is finished as soon there are no more dots to connect.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each program will be playing against each other program. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The score is the total number of conquered number of boxes.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Open Questions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How can we encode the grid in an easy way as 2D(?) array?&lt;/li&gt;&#xA;&lt;li&gt;How should the function endcode which dots to connect?&lt;/li&gt;&#xA;&lt;li&gt;What language / environment would you suggest for doing so? (It would be easiest if there was only one language. I'd say Python or JavaScript.)&lt;/li&gt;&#xA;&lt;li&gt;Is it better to count the total of the captured squares or only the number of won matches?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2014-09-09T13:51:36.297" LastActivityDate="2014-09-09T13:51:36.297" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="2160" PostTypeId="1" CreationDate="2014-09-09T18:48:42.413" Score="1" ViewCount="77" Body="&lt;p&gt;If the rules of a challenge change in a simple way, such as a different constant, and the required change to all existing answers is simply changing that constant, can/should the question author or other third parties submit edits for the answers?&lt;/p&gt;&#xA;" OwnerUserId="4787" LastActivityDate="2014-09-09T18:48:42.413" Title="Should third parties edit Answers when Question requirements change in simple ways?" Tags="|discussion|" AnswerCount="0" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="2163" PostTypeId="2" ParentId="2140" CreationDate="2014-09-09T23:41:05.147" Score="3" Body="&lt;h2&gt;Turn my keyboard into a piano &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/music&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;music&amp;#39;&quot; rel=&quot;tag&quot;&gt;music&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm sure we've all thought &quot;man, wouldn't it be cool if my keyboard played musical notes as I program?&quot;. Of course, the answer to that question is a resounding &lt;strong&gt;&lt;em&gt;no&lt;/em&gt;&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regardless, it's what you're going to make.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input will be given, in real-time, on the keyboard.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The keyboard mapping that you will use is given in the diagram below. This kind of layout is used by several music programs already.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/nxFcf.png&quot; alt=&quot;A keyboard layout, with notes assigned to several of the keys.&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can see that the bottom row (&lt;code&gt;Z, X, C, V, B... ., /&lt;/code&gt;) represents all of the white keys, and the black keys are added on the row above (&lt;code&gt;S, D, G, H, J... L, ;&lt;/code&gt;). This is then repeated on the two rows above, except the notes are an octave higher.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The notes C5 to E5 are repeated both on the lower rows and the upper rows.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, if the user were to input &lt;code&gt;Q&lt;/code&gt; (or &lt;code&gt;,&lt;/code&gt;) on the keyboard, middle-C (C5) should play. Similarly, if they input &lt;code&gt;B&lt;/code&gt;,  G4 should play.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;The diagram above is an edited form of an image found &lt;a href=&quot;http://sonantlive.bitsnbites.eu/&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The only output will be sound. The actual sound used is up to you (it could be a piano sample or the internal beeper), but it should output sound at the correct pitch.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program should not terminate by itself - the user should be able to keep inputting notes until they get bored.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;References&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A diagram of the US keyboard layout (for comparison with the image above) can be found &lt;a href=&quot;http://upload.wikimedia.org/wikipedia/commons/thumb/5/51/KB_United_States-NoAltGr.svg/900px-KB_United_States-NoAltGr.svg.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A table of the frequencies of notes can be found &lt;a href=&quot;http://www.phy.mtu.edu/~suits/notefreqs.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;. The range of notes that you will be using are from C4 to E6, inclusive.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Rules and Disambiguation&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest correct implementation wins.&lt;/li&gt;&#xA;&lt;li&gt;Input should be given in real-time (i.e. no pressing Enter between each inputted note).&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There should be no greater than a 0.25 second delay between pressing a key and hearing the note.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Only programs that have the notes correctly mapped to the QWERTY keyboard will be accepted.&lt;/li&gt;&#xA;&lt;li&gt;The only output should be sound. There should be nothing displayed (except for a mandatory console window or similar).&lt;/li&gt;&#xA;&lt;li&gt;Polyphony (multiple notes playing at once) is not part of the specification.&lt;/li&gt;&#xA;&lt;li&gt;The program should not terminate by itself - a user should be able to keep pressing keys and hearing notes until they decide to close it.&lt;/li&gt;&#xA;&lt;li&gt;The waveform outputted is not important (it can be a beep or a piano sound or whatever you like); the pitch, however, should be accurate.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The file size of any sound files used will not be counted in the bytecount.&lt;/li&gt;&#xA;&lt;li&gt;Please link any sound files you use with your answer.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are probably some obvious things that I've forgot to explain - please point these out!&lt;/li&gt;&#xA;&lt;li&gt;Also let me know if any of the wording is confusing.&lt;/li&gt;&#xA;&lt;li&gt;I've assumed that the readers will at least know very basic music theory (e.g. that there are 12 semitones in an octave). Is this okay?&lt;/li&gt;&#xA;&lt;li&gt;&quot;Polyphony is not part of the specification&quot; - polyphony is not the focus of the program, and therefore shouldn't be a consideration when submitting answers (i.e. if the shortest implementation means that one note will stop when a new note is played, then that's fine). Is this acceptable?&lt;/li&gt;&#xA;&lt;li&gt;Should I exclude the use of any external libraries that are designed to play sound or designed to repeat a function at regular intervals? Should I count sound file size in the score? I'm worried that having either of these would limit the possible entries to those that can use the internal beep (so, C/C++, C#, Python, Java?...).&lt;/li&gt;&#xA;&lt;li&gt;Another problem may be portability, or the lack thereof (e.g. C/C++ using the Windows API to access the &lt;code&gt;Beep()&lt;/code&gt; function).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;Really meta: answers/edits by me won't be done until the morning (approximately 9 hours from now).&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="30685" LastActivityDate="2014-09-09T23:41:05.147" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2169" PostTypeId="2" ParentId="2140" CreationDate="2014-09-11T01:17:24.293" Score="4" Body="&lt;h1&gt;Comment Java Code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Little Billy is in an AP computer science class and his teacher requires him to comment his code (in Java) even though Little Billy thinks it is redundant. Little Billy is a lazy person and so he wants a program to comment for him.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Make a program in any language that gets a text file as input and saves the commented version to a new text file (or to STDOUT) changing it in the following ways:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Add comments before all contructors:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;/**&lt;br&gt;&#xA;      * Constructs a new instance of &lt;em&gt;(class whatever)&lt;/em&gt;.&lt;br&gt;&#xA;      * &lt;em&gt;if applicable:&lt;/em&gt; @param &lt;em&gt;nameOfVariable&lt;/em&gt; is the name of variable&lt;br&gt;&#xA;      */&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Add comments before any functions:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;/**&lt;br&gt;&#xA;      * &lt;em&gt;if applicable:&lt;/em&gt; @param &lt;em&gt;nameOfVariable&lt;/em&gt; is the name of variable.&lt;br&gt;&#xA;      * &lt;em&gt;if applicable:&lt;/em&gt; @return &lt;em&gt;nameOfReturnVariable&lt;/em&gt; is the name of return variable.&lt;br&gt;&#xA;      */&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Add a comment before static void main(String[] args) if present:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;/**&lt;br&gt;&#xA;      * This is where the program starts.&lt;br&gt;&#xA;      * @param  args is the command line arguments passed to the program.&lt;br&gt;&#xA;      */&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Add comments before the class declaration (not applicable for inner classes)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;/**&lt;br&gt;&#xA;      * class &lt;em&gt;NameOfClass&lt;/em&gt; is another great example of Object Oriented Programming!&lt;br&gt;&#xA;      */&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;For example, given this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;public class Car {&#xA;    private double gas;&#xA;    private double mpg;&#xA;&#xA;    public static void main(String[] args) {&#xA;        new Car(20,20);&#xA;    }&#xA;&#xA;    public Car(){}&#xA;&#xA;    public Car(double gasInVehicle, double milesPerGallon){&#xA;        gas = gasInVehicle;&#xA;        mpg = milesPerGallon;&#xA;    }&#xA;&#xA;    public void drive(double milesToDrive){&#xA;        gas-=(milesToDrive/mpg);&#xA;    }&#xA;&#xA;    public double getGas(){&#xA;        double gasolineInTank = gas;&#xA;        return gasolineInTank;&#xA;    }&#xA;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your program should output this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;/**&#xA; * class Car is another great example of Object Oriented Programming!&#xA; */&#xA;public class Car {&#xA;    private double gas;&#xA;    private double mpg;&#xA;    /**&#xA;     * @param args is the command line arguments passed to the program.&#xA;     */&#xA;    public static void main(String[] args) {&#xA;        new Car(20,20);&#xA;    }&#xA;    /**&#xA;     * Constructs a new instance of Car.&#xA;     */&#xA;    public Car(){}&#xA;    /**&#xA;     * Constucts a new instance of Car.&#xA;     * @param gasInVehicle is the gas in vehicle.&#xA;     * @param milesPerGallon is the miles per gallon.&#xA;     */&#xA;    public Car(double gasInVehicle, double milesPerGallon){&#xA;        gas = gasInVehicle;&#xA;        mpg = milesPerGallon;&#xA;    }&#xA;    /**&#xA;     * @param milesToDrive is the miles to drive&#xA;     */&#xA;    public void drive(double milesToDrive){&#xA;        gas-=(milesToDrive/mpg);&#xA;    }&#xA;    /**&#xA;     * @return gasolineInTank is the gasoline in tank.&#xA;     */&#xA;    public double getGas(){&#xA;        double gasolineInTank = gas;&#xA;        return gasolineInTank;&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Extended Info&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Because Little Billy's class is only on week 3, Little Billy's knowledge of complex Java statements is pretty limited. In other words, only common functions, class declarations, constructors and instance variables will be included; objects/variables/resources are limited to Java primitives and their wrapper classes and Math.&lt;/li&gt;&#xA;&lt;li&gt;Each variable name is separated for its definition according to standard camel case rules, with an exception of the first letter, which may be capitalized. For example, &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;milesToRun = miles to run.&lt;br&gt;&#xA;  milestoRun = milesto run.&lt;br&gt;&#xA;  MilesToRun = miles to run.&lt;br&gt;&#xA;  parseXML = parse xml - each successive capital letter (with a minimum of 3 in a row) is considered an acronym, so GetABuffer would become get a buffer. parseXM is parse x m.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If it is a parameter - &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;@param milesToRun is the miles to run.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program should be able to handle multiple arguments to functions&lt;/li&gt;&#xA;&lt;li&gt;There should be no lines with only &quot; * &quot;.&lt;/li&gt;&#xA;&lt;li&gt;Assume all variables and parameters are formatted correctly (e.g. all camel case, only letters, etc.)&lt;/li&gt;&#xA;&lt;li&gt;Indentation is not critical. However, all newlines should remain.&lt;/li&gt;&#xA;&lt;li&gt;You may also assume that statements ending in a semicolon are 1 line each&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, so shortest code wins (in bytes).&lt;/p&gt;&#xA;" OwnerUserId="29820" LastEditorUserId="29820" LastEditDate="2014-09-11T21:39:01.403" LastActivityDate="2014-09-11T21:39:01.403" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2170" PostTypeId="2" ParentId="2140" CreationDate="2014-09-11T03:40:22.693" Score="1" Body="&lt;h1&gt;Chad&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot;&gt;chess&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.chessvariants.org/ms.dir/chad.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Chad&lt;/a&gt; is a variant of chess. It is played on an uncheckered board measuring twelve by twelve squares. Squares are denoted using standard chess notation, so &lt;code&gt;a12&lt;/code&gt; is the top left corner and &lt;code&gt;l1&lt;/code&gt; is the bottom right corner. The opening position of Chad looks like this:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/2/2f/Chad_Opening_Position.svg&quot; alt=&quot;Opening Position of Chad&quot; /&gt;&lt;br /&gt;&#xA;&lt;em&gt;Above: Chad gameboard and opening position.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;The 3x3 area that the kings start in is called the &lt;em&gt;castle&lt;/em&gt;. The twelve shaded squares around each castle is called the &lt;em&gt;wall&lt;/em&gt;. Here are how the pieces interact with each other and the wall:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The King can move and capture like a King but also as a Knight. However, he is confined to his 3x3 castle.&lt;/li&gt;&#xA;&lt;li&gt;The Rook moves like a Rook in chess, unimpeded by walls or castles. If the Rook ends on a square inside the enemy castle, it is automatically promoted into a Queen.&lt;/li&gt;&#xA;&lt;li&gt;A Queens move like a Queen in chess. She is also unimpeded by walls or castles.&lt;/li&gt;&#xA;&lt;li&gt;The mutual right of capture between two pieces (except for the King) exists if, and only if, one piece is on the enemy's wall, and the other piece is in their own castle. Otherwise, pieces simply block each other.&lt;/li&gt;&#xA;&lt;li&gt;The King may capture pieces inside his castle, provided he can attack the piece (remember that the King can move both as a King and as a Knight).&lt;/li&gt;&#xA;&lt;li&gt;Check occurs if the King is in the path of a Rook or Queen, regardless of whether the Rook or Queen is on the wall or not. Walls do not block checks.&lt;/li&gt;&#xA;&lt;li&gt;As in regular chess, white moves first, a capturing piece replaces the piece captured, and checkmate wins the game.&lt;/li&gt;&#xA;&lt;li&gt;A draw occurs if:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;x&lt;/em&gt; moves have passed without any piece being captured.&lt;/li&gt;&#xA;&lt;li&gt;There is three or less pieces on the board.&lt;/li&gt;&#xA;&lt;li&gt;It is a stalemate.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is a king-of-the-hill Chad competition. To enter write a program that decides what moves to make, using the IO format below. This program will be pitted against other entrants to find out which program is the strongest.&lt;/p&gt;&#xA;&lt;h2&gt;Inputs and Outputs&lt;/h2&gt;&#xA;&lt;p&gt;Your program will be ran from the command line for each move, and input will be given as a command line argument. Here is the input format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[colour] [board] [history] [moves]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;[color]&lt;/code&gt; is &lt;code&gt;0&lt;/code&gt; if you are playing White, and &lt;code&gt;1&lt;/code&gt; if you are playing Black.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;[board]&lt;/code&gt; is an ASCII representation of the board with newlines stripped. &lt;code&gt;K&lt;/code&gt; is a King, &lt;code&gt;R&lt;/code&gt; is a Rook. Lowercase letters indicate black, uppercase means white. A dot &lt;code&gt;.&lt;/code&gt; is a blank space. The starting position would look like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; ...............................rrr.........rkr.........rrr................RRR.........RKR.........RRR...............................  &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;[history]&lt;/code&gt; is a comma separated list of the moves you and your oppoment have done. It is in a modified long algebraic notation, consisting of the starting and ending squares separated by a hyphen, &lt;em&gt;without&lt;/em&gt; a letter identifer for the piece. If it is a capture, the hyphen is replaced with an &lt;code&gt;x&lt;/code&gt;. There is no &lt;code&gt;!?&lt;/code&gt; or other such ornaments. This is &lt;em&gt;blank&lt;/em&gt; if you are White and making the first move - be prepared for this!&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;[moves]&lt;/code&gt; is a comma separated list of the valid moves you can make in your current situation. It is also in the modified long algebraic notation.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Note that you don't have to use all of the information given in the input if you do not want to. The information is supplied to simplify the process of making the program.&lt;/p&gt;&#xA;&lt;p&gt;You program should output a single move in the modified long algebraic notation, indicating what move you want to make on that turn. The move must be valid. The program must output its move within &lt;em&gt;y&lt;/em&gt; seconds, otherwise it will resign. If the program outputs anything other than a valid move, it will be counted as a resignation.&lt;/p&gt;&#xA;&lt;h2&gt;Entering&lt;/h2&gt;&#xA;&lt;p&gt;To enter, submit an answer with the following information:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The &lt;strong&gt;name&lt;/strong&gt; of the bot (to be used for score tables, etc.)&lt;/li&gt;&#xA;&lt;li&gt;The &lt;strong&gt;language&lt;/strong&gt; the bot is written in&lt;/li&gt;&#xA;&lt;li&gt;The &lt;strong&gt;command line command&lt;/strong&gt; needed to run the bot&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If I cannot include your bot for any reason, I will add a comment explaining why I cannot. I will endeavour to install any programs required to run your bot, as long as it is legally free to access (sorry Mathematica people).&lt;/p&gt;&#xA;&lt;p&gt;The &lt;strong&gt;final round&lt;/strong&gt; will occur on xxxx/xx/xx. It is a round robin. Each bot plays against each other bot two times - once as black, and once as white. If a bot wins both rounds, it gains 1 point. If it wins one round, it gains 0.5 points. If it doesn't win either, it gains 0 points. The bot with the most points gets the green checkmark.&lt;/p&gt;&#xA;&lt;p&gt;I will also hold regular practice rounds, of which you may find the results of here. The last practice round was held on xxxx/xx/xx. These practice rounds will continue even after the final round has finished.&lt;/p&gt;&#xA;&lt;h2&gt;Questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the explanation of Chad's rules clear?&lt;/li&gt;&#xA;&lt;li&gt;What would be good values for &lt;em&gt;x&lt;/em&gt; and &lt;em&gt;y&lt;/em&gt;?&lt;/li&gt;&#xA;&lt;li&gt;Would the extra information in the input be helpful?&lt;/li&gt;&#xA;&lt;li&gt;Any other advice would be appreciated.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I haven't written the control program yet. I intend on getting the specification ironed out first.&lt;/p&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-09-11T04:07:48.713" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2171" PostTypeId="2" ParentId="2140" CreationDate="2014-09-11T06:21:38.693" Score="7" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;This message is open for anyone to adopt and post to main. For more details, see the &lt;a href=&quot;https://chat.stackexchange.com/rooms/60187/abandoned-challenges-up-for-adoption&quot;&gt;chat room&lt;/a&gt; or &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12792/58826&quot;&gt;meta post&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;The Best Way to Rake Leaves&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;[This is just a little problem I thought up while doing yard work today. It is not fully specified and I may not finish it if some simple optimal solution is found.]&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Suppose some 2D grid represents the area of a lawn. A number of leaves are strewn over the lawn and they are modeled as single grid points. You have a rake that is modeled as a line segment of length L.&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/WzVfa.png&quot; alt=&quot;example&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;To start you can rotate the rake in any way and put it anywhere on the grid.&lt;/p&gt;&#xA;&lt;p&gt;When the rake is moved some distance d along its perpendicular, all the leaves in its path are caught in it. They stay on the rake line until the rake stops (as with normal raking).&lt;/p&gt;&#xA;&lt;p&gt;You repeat this process (moving the rake different distances every time) until all the leaves all lie on one singular point.&lt;/p&gt;&#xA;&lt;p&gt;The question is: what is the minimum distance the rake has to move to make this happen?&lt;br /&gt;&#xA;(i.e. what is the minimum sum of the d's from each move?)&lt;/p&gt;&#xA;&lt;h1&gt;Challenge Spec (details incomplete)&lt;/h1&gt;&#xA;&lt;p&gt;Write a program that takes in a list of (x, y) leaf points and the length L of the rake (all floats).&lt;/p&gt;&#xA;&lt;p&gt;The program should output a sequence of rake moves in the form of ((x1, y1), (x2, y2)) line segments that the rake travels perpendicularly down the center of. This sequence must bring all the leaves to the same exact point when they are &amp;quot;moved&amp;quot; by the rake&lt;/p&gt;&#xA;&lt;p&gt;The challenge is to make an algorithm that does this with the least possible sum of &lt;code&gt;sqrt((x1-x2)^2 + (y1-y2)^2)&lt;/code&gt; over all points.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;[At this point several test cases would be given, with different L values and different leaf distributions. The submission that minimizes the total distance wins (assuming they do not hard code the answer).]&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;[This optimization problem does not seem to have any trivial solutions or even a clear optimal solution. Can anyone else poke holes in it?]&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-09T20:05:24.520" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2174" PostTypeId="1" CreationDate="2014-09-11T19:03:19.900" Score="6" ViewCount="92" Body="&lt;p&gt;In the previous sandboxes, it was suggested that if you had 3 upvotes on your sandbox submission, it was ready to go.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have written a few sandbox posts recently. Of these, all have been commented on and one has had 4 votes  - this is clearly enough. However, two have had 0 votes and two have had 1 vote.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have occasionally bumped the posts in chat, but this seems to have had little or no effect.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;How do I make more people notice my sandbox submission? Do I need to?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user16402" LastActivityDate="2014-09-11T19:20:38.110" Title="How do I get enough people to notice my sandbox post?" Tags="|support|sandbox|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2175" PostTypeId="2" ParentId="2174" CreationDate="2014-09-11T19:20:38.110" Score="5" Body="&lt;p&gt;In my experience, posts with &lt;em&gt;problems&lt;/em&gt; are more likely to generate comments and/or votes. I'll admit, while browsing the sandbox I often forget to upvote and simply move on to the next post, looking for potential issues.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another reason might be that if I &lt;em&gt;see&lt;/em&gt; something wrong, I'm confident in saying there's an issue. If I &lt;em&gt;don't&lt;/em&gt; see something wrong, that doesn't mean there isn't. Maybe someone else will see the problem and my upvote would encourage an early transfer. I'm not saying this is right (or that I consciously think this while browsing), but it's something I may try to pay attention to more in the future.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your post has been in the sandbox for a certain amount of time and you're confident it meets the standards, I'd say go for it. If there &lt;em&gt;are&lt;/em&gt; comments, obviously try to address them first (and maybe reset the timer). &quot;A certain amount of time&quot; is ambiguous on purpose, but I would say 2-3 days without comment seems okay.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2014-09-11T19:20:38.110" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2179" PostTypeId="2" ParentId="2140" CreationDate="2014-09-12T21:58:12.643" Score="0" Body="&lt;h2&gt;Finding repeated words in a passage&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This challenge is inspired by &lt;a href=&quot;https://softwarerecs.stackexchange.com/q/11423/6834&quot;&gt;a question&lt;/a&gt; on the Software Recommendations website.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program that outputs the repeated words in a passage on a paragraph by paragraph basis. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program should take three text files as input:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;passage&lt;/code&gt;: contains the paragraphs to be analyzed&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;blacklist&lt;/code&gt;: contains a list of additional pairs that should be considered as repetitions, such as: &lt;code&gt;eat, ate; begin, began, begun&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;whitelist&lt;/code&gt;: contains a list of exceptions that should not be flagged, such as &lt;code&gt;the, a, an, to, for&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Specifications:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In each paragraph, find the repeated words that are not in the &lt;code&gt;whitelist&lt;/code&gt;. The keywords in the &lt;code&gt;whitelist&lt;/code&gt; file may be separated with commas or line breaks. You are free to choose the one that best suits your needs.&lt;/li&gt;&#xA;&lt;li&gt;The repetitions should be allowed to differ in case, prefixes, suffixes, declension or in grammatical number. For example: &lt;code&gt;allow&lt;/code&gt; and &lt;code&gt;Allowed&lt;/code&gt;, &lt;code&gt;friend&lt;/code&gt; and &lt;code&gt;friends&lt;/code&gt;, &lt;code&gt;eat&lt;/code&gt; and &lt;code&gt;eaten&lt;/code&gt; should count as pairs of repetition&lt;/li&gt;&#xA;&lt;li&gt;Each pair specified in the &lt;code&gt;blacklist&lt;/code&gt; should also be considered as a repetition. You are also free to choose how the words in the &lt;code&gt;blacklist&lt;/code&gt; are separated. Ideally, these would be copied from a table of irregularites found by a simple online search&lt;/li&gt;&#xA;&lt;li&gt;It should support alternate spellings of German umlauts and the &quot;double s&quot; character in the list files. For example: &lt;code&gt;Fränze&lt;/code&gt; and &lt;code&gt;Fraenze&lt;/code&gt;, &lt;code&gt;Jörg&lt;/code&gt; and &lt;code&gt;Joerg&lt;/code&gt;, &lt;code&gt;Müller&lt;/code&gt; and &lt;code&gt;Mueller&lt;/code&gt;, &lt;code&gt;Gauß&lt;/code&gt; and &lt;code&gt;Gauss&lt;/code&gt;. The list need only contain one of these words, but both spellings should be searched&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The output should write the paragraph number, then list the repeated words and their count. For example: &#xA;&lt;code&gt;&#xA;2: eat*3 + however*5&#xA;4: moreover*4 + despite*2&#xA;5: began/begun*3&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;or any representation that is just as readable&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is a code golf challenge; lowest byte count wins&lt;/li&gt;&#xA;&lt;li&gt;The input file names are excluded from the byte count&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="21629" LastEditorUserId="-1" LastEditDate="2017-04-13T12:50:01.760" LastActivityDate="2014-09-13T13:57:51.857" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="2180" PostTypeId="1" AcceptedAnswerId="2181" CreationDate="2014-09-13T10:13:16.300" Score="3" ViewCount="135" Body="&lt;p&gt;The recently added list for &lt;a href=&quot;https://codegolf.stackexchange.com/q/37624/8478&quot;&gt;golfing tips in ECMAScript 6&lt;/a&gt; sparked a bit of a discussion in the comments (and the close/reopen votes) whether tips for different versions of one language should go in the same list or whether we should create a new list. This is mainly relevant if a new version of a language is released which adds significant syntactic features useful for golfing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is a precedent for creating separate questions: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/5105/tips-for-golfing-in-perl&quot;&gt;Perl 5&lt;/a&gt; vs &lt;a href=&quot;https://codegolf.stackexchange.com/questions/17732/tips-for-golfing-in-perl-6&quot;&gt;Perl 6&lt;/a&gt;. But I'd prefer to have a community consensus about this policy on meta for future reference.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I will add two answers for the existing opinions along with the arguments I could find. Feel free to amend them or add your own answer if I missed anything.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-10-13T15:22:21.763" Title="Should we split per-language tips for different versions?" Tags="|discussion|policy|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2181" PostTypeId="2" ParentId="2180" CreationDate="2014-09-13T10:13:16.300" Score="5" Body="&lt;h2&gt;We should split lists by version&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Tips for the older version are often superseded and don't apply any more. Hence, they just dilute the content that is still useful and applicable for the new version, which will also have a hard time gathering the necessary upvotes to bubble to the top of the list.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-09-13T10:13:16.300" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2182" PostTypeId="2" ParentId="2180" CreationDate="2014-09-13T10:15:15.280" Score="-1" Body="&lt;h2&gt;We should keep all versions in the same list&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Some&lt;/em&gt; old tips are still applicable, so if we split the list, one would now have to browse through both lists to find all the relevant tips for the language in question. Alternatively, we could copy over the tips that are still relevant, but duplicating content is rarely a good solution. So it might be best to just put them all in one list, with a note in each answer which versions it applies to.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-09-13T10:15:15.280" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2183" PostTypeId="1" CreationDate="2014-09-13T20:11:20.507" Score="6" ViewCount="144" Body="&lt;p&gt;Consider this: I have an idea for a challenge, such as &quot;Find the optimal foos such that the bar is greatest.&quot; I also realize that I could alter it slightly and add a more interesting twist to it: &quot;Create an animated GIF that shows the bar approaching the greatest value as the foos change.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't want to simply post the second challenge, because some people don't know how / want to make animated GIFs, and that would ruin the challenge and the fun and they wouldn't participate. But I also don't want to throw away the second idea entirely, because it adds an interesting touch.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How should I proceed in this situation?&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Post the first challenge, but subtract a fixed amount from the character count (for example) if one also completes the second challenge.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Avoids near-duplicates so you can't copy most of the logic from challenge 1 and use it in challenge 2&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Post the first challenge, then post the second one a little while later as a &quot;part 2,&quot; so to speak.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No dilemmas about how to fairly calculate a bonus&lt;/li&gt;&#xA;&lt;li&gt;The first question is less complicated and beginners and less advanced users can attempt it, while people looking for an extra challenge can participate in the second one&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Something else.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;?&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-09-15T10:17:49.987" Title="Posting closely related challenges: Bonuses or separate questions?" Tags="|discussion|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2184" PostTypeId="2" ParentId="2183" CreationDate="2014-09-13T21:10:18.173" Score="8" Body="&lt;h1&gt;I'm in favour of follow up questions&lt;/h1&gt;&#xA;&lt;p&gt;I'd like to see the community welcome follow up questions - for example &amp;quot;Flux capacitor golf part 2&amp;quot;. I like simple unambiguous challenges and I like being able to see answers that are all solving the same challenge. This way the votes reflect people's opinion of the answer, rather than which sub-question is more appealing. It's also easier to follow the answers when they are all aiming for the same goal.&lt;/p&gt;&#xA;&lt;p&gt;Allowing follow up questions means that descriptions can be kept short. Part 1 doesn't need to be summarised again in part 2 - the link to it will suffice since it's within the site. People who haven't yet tried part 1 can use that as practice and introduction before trying part 2.&lt;/p&gt;&#xA;&lt;p&gt;I think there are plenty of potential questions which could be interesting but would take more introduction than is reasonable for a single post. Being able to build on previous questions allows building up a larger concept gradually. If this means we can have access to a wider space of potential challenges then it helps with the problem of gradually running out of ideas. It also encourages a culture of revisiting old questions so that new users arriving can improve the quality of answers across all our questions, not just the recent ones.&lt;/p&gt;&#xA;&lt;h1&gt;Problems are inevitable&lt;/h1&gt;&#xA;&lt;p&gt;I fully expect there to be some problems with follow up questions, but I don't see that as a reason to exclude them. I'd like to see people encouraged to post questions which have follow up questions, and encouraged to post follow up questions to other people's questions. The inevitable problems that come with anything new can then be raised on meta and decisions made as necessary. We would still need to highlight duplicates but I welcome genuinely new challenges that depend on a previous question.&lt;/p&gt;&#xA;&lt;h1&gt;Part 2 judged as a stand alone question&lt;/h1&gt;&#xA;&lt;p&gt;In some cases the part 2 question may be regarded as too subjective or off topic. I think this is just more reason to encourage follow up questions. This way the part 2 can be closed if it is not a good fit to the site. Currently an off-topic part 2 can just be included as an afterthought in the same post and as long as part 1 is on-topic part 2 will escape closure. Upvotes, downvotes and close votes are all more meaningful if separate questions are kept in separate posts.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-09-13T21:10:18.173" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2188" PostTypeId="2" ParentId="2140" CreationDate="2014-09-15T02:20:59.547" Score="1" Body="&lt;h1&gt;King of the Tournaments&lt;/h1&gt;&#xA;&lt;p&gt;This game is based off of &lt;a href=&quot;http://en.wikipedia.org/wiki/Tournament_(graph_theory)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Graph Theory Tournaments&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The competition will be a series of tournaments, where the Kings of a tournament will play in the next until the winner(s) is found&lt;/p&gt;&#xA;&lt;p&gt;Every player will play every other player exactly once in a tournament.  Each player will recieve &lt;code&gt;5*N&lt;/code&gt; points each tournament (where &lt;code&gt;N&lt;/code&gt; is the number of opponents in that tournament).  Furthermore, each player will have an advantage over &lt;code&gt;N/2&lt;/code&gt; players, and a disadvantage to &lt;code&gt;N/2&lt;/code&gt; players. This advantage is decided at the beginning of the game.&lt;/p&gt;&#xA;&lt;p&gt;Each battle will consist of a player commiting &lt;code&gt;X&lt;/code&gt; points.  Whoever commits more points will win that battle.  If both players commit the same amount of points, the player with the advantage over the other will win.&lt;/p&gt;&#xA;&lt;p&gt;After a tournament, the Kings will be the players that &lt;em&gt;defeat&lt;/em&gt; all other players.  &lt;code&gt;P1&lt;/code&gt; &lt;em&gt;defeats&lt;/em&gt; &lt;code&gt;P2&lt;/code&gt; if &lt;code&gt;P1&lt;/code&gt; beat &lt;code&gt;P2&lt;/code&gt; in battle, or if &lt;code&gt;P1&lt;/code&gt; beat a player that beat &lt;code&gt;P2&lt;/code&gt;.  If all players are kings, then the players with the least amounts of wins this tournament are eliminated.  If all have the same amount of wins, then the players with the least amount of &lt;em&gt;total&lt;/em&gt; wins are eliminated.  In the case of a tie, the remaining players are declared the winners&lt;/p&gt;&#xA;&lt;h1&gt;IO&lt;/h1&gt;&#xA;&lt;p&gt;Your bot must stay alive throughout the entire game.  You will pass in a number every round through STDOUT.  You may pass in a few codes through STDOUT to recieve information via STDIN:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;W&lt;/code&gt; will return IDs of the players you have won to this tournament&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;L&lt;/code&gt; will return the IDs of the players you have lost to this tournament&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;OW&lt;/code&gt; will return the IDs of the players your opponent has won this tournament&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;OL&lt;/code&gt; will return the IDs of the players your opponent has lost to this tournament&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;A&lt;/code&gt; will return 1 if you have an advantage over the player, else 0&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;H&lt;/code&gt; will return the history of your battles against the player.  The list will be comma-seperated, where each battle is represented by &lt;code&gt;Num1/Num2&lt;/code&gt; where Num1 is the points you committed, and Num2 is the points your opponent committed.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-09-15T16:17:48.533" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2189" PostTypeId="2" ParentId="2183" CreationDate="2014-09-15T10:17:49.987" Score="2" Body="&lt;p&gt;I think that to discuss this properly needs a better example. To the example you give I would say: if you're worried about people being dissuaded by the difficulty of making an animated GIF, don't ask for an animated GIF. Ask for output in NetPBM and provide a one-line ImageMagick script to convert it to an animated GIF.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Without a good case to discuss it, the obvious solution to me seems to be to &lt;strong&gt;use the existing process we have for getting feedback on a question idea&lt;/strong&gt;: post a single answer to the Sandbox:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h2&gt;Optimise foos&lt;/h2&gt;&#xA;  &#xA;  &lt;p&gt;I have an idea for a two-parter. I would envisage posting Part II about one week after Part I. In addition to things which aren't clear, please comment on whether you think the two parts are sufficiently distinct.&lt;/p&gt;&#xA;  &#xA;  &lt;h3&gt;Part I&lt;/h3&gt;&#xA;  &#xA;  &lt;p&gt;...&lt;/p&gt;&#xA;  &#xA;  &lt;hr&gt;&#xA;  &#xA;  &lt;h3&gt;Part II&lt;/h3&gt;&#xA;  &#xA;  &lt;p&gt;...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-09-15T10:17:49.987" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2190" PostTypeId="1" CreationDate="2014-09-16T00:24:53.150" Score="76" ViewCount="17029" Body="&lt;p&gt;Quite a few &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; questions require output to be &quot;truthy or falsey&quot;.  This is possibly confusing as these terms can possibly mean different things to different people, and especially in different languages.  How should answers interpret the meaning of these terms?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;em&gt;I'll provide a few possible answers to this - upvote or downvote according to which you think makes most sense.  Or add your own answers.&lt;/em&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="8478" LastEditDate="2016-10-05T20:45:49.523" LastActivityDate="2019-06-15T15:41:42.900" Title="Interpretation of Truthy/Falsey" Tags="|discussion|faq|policy|code-golf|specification|" AnswerCount="9" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2191" PostTypeId="2" ParentId="2190" CreationDate="2014-09-16T00:24:53.150" Score="43" Body="&lt;p&gt;Truthy/Falsey should be taken as strictly defined in the given language.  For example, in javascript, the following are always falsey:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;undefined&lt;/li&gt;&#xA;&lt;li&gt;null&lt;/li&gt;&#xA;&lt;li&gt;NaN&lt;/li&gt;&#xA;&lt;li&gt;0&lt;/li&gt;&#xA;&lt;li&gt;&quot;&quot;&lt;/li&gt;&#xA;&lt;li&gt;false&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And other values are always truthy.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastActivityDate="2014-09-16T00:24:53.150" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="2192" PostTypeId="2" ParentId="2190" CreationDate="2014-09-16T00:26:09.273" Score="42" Body="&lt;p&gt;Some languages have ambiguity in what is considered truthy/falsey.  For example in c, zero vs non-zero is always FALSE vs TRUE from the point of view of conditional operators.  But many standard APIs, for example return -1 for FAILURE and &gt;=0 for SUCCESS.  So answers may choose (and explicitly state) whatever sets of values they like to represent truthy vs falsey, so long as those sets are mutually exclusive.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastActivityDate="2014-09-16T00:26:09.273" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="2193" PostTypeId="2" ParentId="2190" CreationDate="2014-09-16T00:27:44.430" Score="-40" Body="&lt;p&gt;This truthy vs falsey concept is way too ambiguous.  Questions should be required to state exactly which values represent TRUE and which represent FALSE.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="11259" LastEditDate="2014-09-16T04:47:30.100" LastActivityDate="2014-09-16T04:47:30.100" CommentCount="4" CommunityOwnedDate="2015-06-04T21:56:46.303" ContentLicense="CC BY-SA 3.0" />
  <row Id="2194" PostTypeId="2" ParentId="2190" CreationDate="2014-09-16T06:46:19.673" Score="128" Body="&lt;p&gt;Consider the following pseudocode:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;if (x) {&#xA;    print &quot;x is truthy&quot;;&#xA;}&#xA;else {&#xA;    print &quot;x is falsy&quot;;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If it results in a runtime or a compile-time error then &lt;code&gt;x&lt;/code&gt; is neither truthy nor falsy.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-09-16T06:46:19.673" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="2196" PostTypeId="1" AcceptedAnswerId="2198" CreationDate="2014-09-16T09:49:06.703" Score="13" ViewCount="320" Body="&lt;p&gt;I want to open a discussion about this recent highly-popular question that has been closed and reopened a few times: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37836/animation-of-code-golf&quot;&gt;Animation of Code Golf&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The turbulence of that question and similar past questions is clearly related to the fact that there is disagreement on whether &quot;art contests&quot; can be programming challenges. (See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1947/the-line-between-art-and-programming&quot;&gt;The line between art and programming&lt;/a&gt;.) &lt;/p&gt;&#xA;&#xA;&lt;p&gt;But Martin Büttner's first comment on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37836/animation-of-code-golf&quot;&gt;the question&lt;/a&gt;, and other past comments I've seen, made me think that the main schism is between those who think programming contests should be judged on &lt;strong&gt;&lt;em&gt;implementation only&lt;/em&gt;&lt;/strong&gt;, and those who think they should be judged on &lt;strong&gt;&lt;em&gt;implementation and output&lt;/em&gt;&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This part of the comment brought this to mind:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;... In this challenge very few people would look at the implementation and only vote by prettiness which is in no way correlated to a clever implementation. Imagine one solution which throws a 3rd-party syntax highlighting at the GIF and another which uses a very clever edit distance algorithm. Guess which one gets the votes?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The point made is surely true. People will vote for the thing with flashy output, often regardless of implementation. Such might be the nature of many of our closed &quot;art contests&quot;. But I want to ask: &lt;em&gt;Is judging on output necessarily bad?&lt;/em&gt; (People do it anyway of course.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When I think &quot;programming contest&quot; I think of lots of people competing in some sort task that &lt;em&gt;requires&lt;/em&gt; programming, and has definite winner(s) and losers. Whether the goal is to create beautiful code or beautiful output (or both) is up to the contest author. As long as programming is required and there's a winner, it is a &quot;programming contest&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We rarely get (and quickly remove) questions that don't involve programming, and we always enforce objective winning criteria, so the issue lies in what parts of the program are being judged.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One could quickly argue that &quot;programming contest&quot; obviously implies that the programming itself is the part being judged, but regardless of those semantics, &lt;em&gt;is there really harm in letting &quot;art contests&quot; and the like (especially popular ones) remain open?&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a site based on entertainment and user interaction after all. I see no harm in allowing users to compete in contests where the output is explicitly part of the judging. If you're worried your coding efforts will be overlooked in such questions then you needn't answer them. And it's not like we're overflowing with questions, we may as well keep what we can.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(P.S. I'm not totally on the pro-art-contest side, I'm playing devils advocate a little here. Mainly my goal is to open up the discussion.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(P.P.S. I mean no offense to Martin Büttner, your comment just spurred me to voice my say :) )&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2014-09-17T03:39:31.337" Title="Voting by implementation vs. output" Tags="|discussion|" AnswerCount="3" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="2197" PostTypeId="2" ParentId="2140" CreationDate="2014-09-16T11:42:26.377" Score="1" Body="&lt;p&gt;&lt;strong&gt;Pointlessly Restrictive Integers&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;[COMPLETE. Currently proofreading. Waiting for upvotes / objections before posting.]&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;In this question, all code blocks are independent of each other.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm designing a new programming language called &lt;em&gt;Pointlessly Restrictive&lt;/em&gt;. The integers in Pointlessly Restrictive work in a peculiar fashion:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;An integer must be &lt;em&gt;explicitly declared&lt;/em&gt; with its length before being used (there is one exception to this rule, described below). This is done using the syntax &lt;code&gt;A = [x]&lt;/code&gt;, where &lt;code&gt;A&lt;/code&gt; is the name of the integer (always a single, uppercase character) and &lt;code&gt;x&lt;/code&gt; is the length of the integer. For instance:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = [2]&#xA;B = [5]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This declares an integer &lt;code&gt;A&lt;/code&gt; of length 2, and an integer &lt;code&gt;B&lt;/code&gt; of length 5. Note that at this point, the actual digits of the integer are not defined - so any integer of the specified length is a possible value. For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = 23&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is an invalid statement, because I haven't declared the variable with its length before using it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The length of an integer is immutable. For instance:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = [5]&#xA;A = [3]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is invalid, because I cannot change the length of an integer after making it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Values are assigned to an integer using the syntax &lt;code&gt;B = x&lt;/code&gt;. For instance:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;B = [5]&#xA;B = 21436&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is a valid assignment. Note that:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;B = [5]&#xA;B = 314&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;would be invalid, because the values given is inconsistent with the specified length of 5.  &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The &lt;code&gt;+&lt;/code&gt; operator only &lt;em&gt;concatenates&lt;/em&gt; integers, as if they were strings. For instance:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = [3]&#xA;A = 123&#xA;B = [2]&#xA;B = 45&#xA;C = A + B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;C&lt;/code&gt;, in this case, is equal to &lt;code&gt;12345&lt;/code&gt;. Note that I didn't need to declare the length of &lt;code&gt;C&lt;/code&gt; before using it – the length is instead decided based on the component integers. In addition, I can use the &lt;code&gt;[x]&lt;/code&gt; notation in this definition method:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = [3]&#xA;A = 123&#xA;C = A + [2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Any integer that has length 5 and begins with &lt;code&gt;123&lt;/code&gt; is a possible value for &lt;code&gt;C&lt;/code&gt;. In addition, if I use an integer twice in this definition method, it must hold the same value each time:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = [2]&#xA;C = A + A + A&#xA;D = C + [2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Any integer that consists of a subsequence of length 2 repeated three times (for instance, &lt;code&gt;161616&lt;/code&gt;) is a possible value for &lt;code&gt;C&lt;/code&gt;. That possible value, with any two numbers after it, would be a possible value for &lt;code&gt;D&lt;/code&gt; (e.g. &lt;code&gt;16161623&lt;/code&gt;). For instance, the sequence &lt;code&gt;142632&lt;/code&gt; could not be &lt;code&gt;C&lt;/code&gt;. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A value is printed by baldly printing the name of the integer on one line. If there are unknown digits, it substitutes lower case letters - the letters that are chosen are up to the interpreter. If there are more than 26 lower case letters required (e.g. &lt;code&gt;A = [27]&lt;/code&gt;), it is an error.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = [2]&#xA;A = 14&#xA;A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;outputs &lt;code&gt;14&lt;/code&gt;. Another example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = [3]&#xA;A = 163&#xA;B = A + [1]&#xA;B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;outputs &lt;code&gt;163a&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = [3]&#xA;B = A + A + [1]&#xA;B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;outputs &lt;code&gt;abcabcde&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that the &lt;code&gt;abc&lt;/code&gt; repeats because the A repeats.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Integers can be reassigned, specialised, or generalised at any time. For instance:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = [2]&#xA;A = 13&#xA;B = A + [1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;B is equal to &lt;code&gt;13a&lt;/code&gt;. This is also possible:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = [2]&#xA;A = 13&#xA;B = A + [1]&#xA;B = 134&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;On the fourth line, I have specialised B to a specific value. This is also possible:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = [2]&#xA;A = 13&#xA;B = A + 1&#xA;B = [3]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;On the fourth line, I have generalised B to make it less specific. However, note that I &lt;em&gt;cannot&lt;/em&gt; change the length of the integer - so &lt;code&gt;B = [4]&lt;/code&gt; there would have been invalid.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Pointlessly Restrictive requires each statement to be on its own line. There is no semicolons at the end of lines. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to write an interpreter for Pointlessly Restrictive. It should be runnable from the command line - as its input, it will be given a filename, which can be assumed to be in the working directory of the operating system. The file contains some Pointlessly Restrictive statements. Your interpreter should check for any errors in the file (for instance, an assignment with the incorrect length), and output &lt;code&gt;Error!&lt;/code&gt; if there is an error. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there are no errors in the file, output whatever values are printed in the file.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sample Inputs and Outputs&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = [2]&#xA;A = 13&#xA;A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;13&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = [2]&#xA;A = 13&#xA;B = A + A&#xA;B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1313&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;C = [4] + [2] + [3]&#xA;C&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abcdefghi&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;J = [2]&#xA;J = 13&#xA;L = [4]&#xA;L = 143 + [1]&#xA;K = L + J&#xA;K&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;143a13&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;J = [2]&#xA;K = J + J + J&#xA;K = 231323&#xA;K&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Error!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;J = [2]&#xA;K = J + J + J&#xA;L = K + [3]&#xA;K&#xA;L&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abababcde&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Notes&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Spaces do not hold any syntactic value in Pointlessly Restrictive - &lt;code&gt;A = [2]&lt;/code&gt; is equivalent to &lt;code&gt;A=[2]&lt;/code&gt;, &lt;code&gt;A= [2]&lt;/code&gt;, or even &lt;code&gt;A=[ 2   ]&lt;/code&gt;.  &lt;/li&gt;&#xA;&lt;li&gt;This means that the integer &lt;code&gt;123 54&lt;/code&gt; is the same thing as &lt;code&gt;12354&lt;/code&gt; for your interpreter.  &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="21682" LastEditDate="2014-09-23T22:23:52.120" LastActivityDate="2014-09-23T22:23:52.120" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="2198" PostTypeId="2" ParentId="2196" CreationDate="2014-09-16T11:54:28.507" Score="6" Body="&lt;h1&gt;Output is necessary for judging&lt;/h1&gt;&#xA;&lt;p&gt;I think one of the most important things to learn as a programmer is that we as programmers are not qualified to judge programs. With experience we can learn to spot which of two algorithms will be better without actually running them, but even then there will be times when we are wrong. There will be times when the results surprise us.&lt;/p&gt;&#xA;&lt;p&gt;Whether professionally or recreationally, the output of a program is a vital part of assessing the program itself.&lt;/p&gt;&#xA;&lt;p&gt;This doesn't help in where to draw the line, but my point is that wherever we choose to draw that line when voting, the line certainly will not be at the far end where output is discounted altogether.&lt;/p&gt;&#xA;&lt;p&gt;For a code golf, the output is often required to be identical for all answers, so that the judging is purely on character-efficiency, but the output is still essential to distinguish valid answers from invalid ones.&lt;/p&gt;&#xA;&lt;h1&gt;Choosing voters&lt;/h1&gt;&#xA;&lt;p&gt;Regardless of what we decide here in meta, we can't make people vote in the way that we consider best. People will still be subjective and I don't see that as a bad thing. What we can influence is what type of subjective voters we have, by deciding what type of people to attract to the site.&lt;/p&gt;&#xA;&lt;p&gt;If we encourage questions that attract people who love puzzles and algorithms and new insights, then we'll get more votes on questions and answers that will attract still more. If we encourage (or even tolerate) questions that lean too far away from being about programming then we'll attract people who will put most of their votes into such questions and answers and flood the site with users who may take the site in a different direction due to the overwhelming number of votes.&lt;/p&gt;&#xA;&lt;p&gt;So I want to see popularity contests and I want to see judging by output, but I still want such questions to be carefully scrutinised and closed if they are not sufficiently programming based.&lt;/p&gt;&#xA;&lt;h1&gt;Is the implementation the source of the output?&lt;/h1&gt;&#xA;&lt;p&gt;I'm perfectly happy with a question where judging is based purely on the output, provided that the implementation is the reason for that output being appealing or impressive. If the output is incidental to the implementation then I would want the question to be closed.&lt;/p&gt;&#xA;&lt;p&gt;For example, the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37836/animation-of-code-golf&quot;&gt;animated diff question&lt;/a&gt; may end up with many similar answers that are all implemented in different ways. Since the requirement is the output, the way in which it was implemented is not relevant to judging, not even indirectly. As such I would vote to close the question if it was reopened without changes. If there were some restrictions so that achieving the desired output required ingenuity then it would be a puzzle, rather than just programming. I like programming, but it seems that to fit this site a question needs to be more than just setting a programming task - the task needs to be part of a puzzle. Code golf is a specific type of puzzle - can you complete the programming task in fewer characters than your rivals.&lt;/p&gt;&#xA;&lt;h1&gt;Judging questions will always be subjective&lt;/h1&gt;&#xA;&lt;p&gt;I see the comments of the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37836/animation-of-code-golf&quot;&gt;animated diff question&lt;/a&gt; contain a lot of argument about whether or not the question is objective, along with pointing out that this alone is not enough. That fact is, and will remain, that the definition of what is on topic for this site is not objective. When voting to close or reopen we use the guidelines but there will always be questions that fall near the border where we disagree about whether the site benefits from their presence, and the guidelines for what is on topic may change over time. There is no perfect definition of a question that fits the site. We should also vote with more in mind than just the guidelines. That's the advantage of having humans voting. We can spot potential problems not foreseen in the guidelines.&lt;/p&gt;&#xA;&lt;p&gt;For the specific question raised, about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37836/animation-of-code-golf&quot;&gt;animated diffs&lt;/a&gt;, I would expect such animations to be of interest to a large number of people in the PPCG community, but I don't see it as a good fit for the site. I would much rather see it modified and reopened than left closed, but if it is reopened with insufficient improvement then I will be voting to close.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-09-16T11:54:28.507" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2199" PostTypeId="2" ParentId="2196" CreationDate="2014-09-16T13:16:11.303" Score="5" Body="&lt;p&gt;I think githubphagocyte did a good job with the generics, but let me also comment on the specific question at hand (&lt;a href=&quot;https://codegolf.stackexchange.com/q/37836/14215&quot;&gt;Animation of Code Golf&lt;/a&gt;). I'd like to point to this quote from the OP about the example given:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Personally, I think this a pretty poor job. It doesn't do syntax highlighting, it doesn't try and move code chunks that get rearranged, it doesn't feel like someone is live editing it, and so on. Lots of room for improvement!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;He says it's missing (at least) these three things that would make it &quot;better&quot; in his opinion. Are those things even in the spec? Well, syntax highlighting &lt;em&gt;kinda&lt;/em&gt; is, but it's just mentioned as optional. Nothing about moving chunks of code at a time or having a &quot;live feel&quot;, which I'm not sure I could begin to put into words.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's clear that entries are expected to be judged based on things not mentioned in the spec at all, and you should vote for the ones that add the most unmentioned bells and whistles. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I voted to close.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2014-09-16T13:16:11.303" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2200" PostTypeId="2" ParentId="2140" CreationDate="2014-09-16T13:58:49.590" Score="0" Body="&lt;p&gt;I liked &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2037/25024&quot;&gt;my first idea&lt;/a&gt;, maybe changing the game helps.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sliding Code&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;http://en.wikipedia.org/wiki/Sliding_puzzle&quot; rel=&quot;nofollow noreferrer&quot;&gt;sliding puzzle&lt;/a&gt;, sliding block puzzle, or sliding tile puzzle is a puzzle that challenges a player to slide usually flat pieces along certain routes (usually on a board) to establish a certain end-configuration.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The fifteen puzzle is the oldest type of sliding block puzzle.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Ayk9S.jpg&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a code that behaves as a sliding board. Given a configuration it should run when such configuration is solvable and not run (aka have compile/runtime errors) if the configuration is not solvable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The board is your code. It is a 4x4 grid with a total of 15 square tiles with side length &gt;= 1.&lt;/li&gt;&#xA;&lt;li&gt;Each tile, taken alone, should output it's number in the board (from &lt;code&gt;k + 1&lt;/code&gt; to &lt;code&gt;k + 15&lt;/code&gt; with &lt;code&gt;int k&lt;/code&gt; of your choice).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each tile should output its static value (not the actual value). The tile that outputs &lt;code&gt;13&lt;/code&gt; will output &lt;code&gt;13&lt;/code&gt; in every different configuration.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The whole board should output &lt;code&gt;true&lt;/code&gt; (or 1 or whatever while it express a truthy value) if the configuration can reach the final state: ascending tile numbers on the board from left to right, up to down and the &lt;code&gt;k&lt;/code&gt; void tile in the bottom right position.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Score&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is tile &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the minimum tile side length wins, meaning a minimum score of 1 can be achieved. If a tie, the greatest &lt;code&gt;k&lt;/code&gt; value serves as tie-breaker.&lt;/p&gt;&#xA;" OwnerUserId="25024" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2014-09-16T14:55:55.797" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2201" PostTypeId="1" AcceptedAnswerId="2359" CreationDate="2014-09-16T21:16:32.863" Score="19" ViewCount="430" Body="&lt;p&gt;&lt;a href=&quot;http://blog.stackoverflow.com/2014/09/introducing-runnable-javascript-css-and-html-code-snippets/&quot;&gt;A new feature called Stack Snippets was introduced&lt;/a&gt; that allows users to embed runnable code snippets in their posts. According to the blog post:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If you feel that a particular site should have Stack Snippets, post a feature-request on that site’s meta – if there’s support from the community there, we’ll enable them.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Well, I think Stack Snippets would be pretty great here, for several reasons:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Other users can run and test submissions directly from their browser, without even having to click another link&lt;/li&gt;&#xA;&lt;li&gt;Test cases can be embedded naturally into posts, to verify that the code works properly&lt;/li&gt;&#xA;&lt;li&gt;We could hide very long ungolfed commentated snippets within collapsed Stack Snippet blocks, so that people who want to see how everything works could, while the answer wouldn't get too long&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Finally, here's an example of Stack Snippets in action. (Note that you can make them non-collapsed by default, so you can still see the code.) &lt;a href=&quot;https://codereview.meta.stackexchange.com/a/2469/36278&quot;&gt;Try it out here!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/0GoNr.png&quot; alt=&quot;collapsed Stack Snippet&quot;&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;And when expanded:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/gF706.png&quot; alt=&quot;expanded Stack Snippet&quot;&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:32.987" LastActivityDate="2014-10-20T19:44:39.073" Title="Do we want Stack Snippets?" Tags="|feature-request|status-completed|stack-snippets|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2202" PostTypeId="2" ParentId="2196" CreationDate="2014-09-17T03:39:31.337" Score="-3" Body="&lt;h2&gt;Main point&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm going to summarize and hopefully clarify what I posted in the comments of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37836/animation-of-code-golf&quot;&gt;Animation of Code Golf&lt;/a&gt;. I've already spent way too much time defending this question and I'm not even particularly a fan of it, so I'll try to keep this short.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I had several problems with the second close vote. The question was closed for being off-topic. There are &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;guidelines&lt;/a&gt; in place that seek to define what is on-topic. Those guidelines are extremely simple. A question is &lt;em&gt;not&lt;/em&gt; off-topic if it has&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A clear specification of what constitutes a correct submission, so&#xA;that it is possible to indisputably decide whether an entry is valid&#xA;or not. Test cases are highly encouraged.&lt;/li&gt;&#xA;&lt;li&gt;An objective primary winning criterion, so that it is possible to indisputably decide which entry should win.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;I think #2 was clearly satisfied by the question. Whether or not you like it, &quot;most votes wins&quot; is an objective primary winning criterion. Then the debate here should chiefly be over whether or not the question provided a clear specification of what constituted a correct submission. The question stated plainly &quot;make a program that produces the prettiest animated diffs&quot; and &quot; output will be an animated GIF&quot;. That is a broad specification, but I don't find it to be unclear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For these reasons I voted to re-open.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Ranting&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I respect that most of the people here, including (and especially) those who close voted, are all trying to make this site better. That is a &lt;em&gt;good&lt;/em&gt; thing. But personally, I think this site would benefit from tolerating a wider range of questions. I'm &lt;em&gt;not&lt;/em&gt; saying that we should never close vote. I am saying that I think it happens more often than it needs to and occasionally for the wrong reasons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would urge the following to everyone: &lt;strong&gt;If you're going to close vote a question, at least leave a comment.&lt;/strong&gt; If your intention is really to improve the site, then explain why you've close voted and offer suggestions on how the user can improve the question. It's insulting to the hard work of the person who posted the question otherwise.&lt;/p&gt;&#xA;" OwnerUserId="31002" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2014-09-17T03:39:31.337" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="2204" PostTypeId="2" ParentId="2201" CreationDate="2014-09-17T15:35:56.883" Score="18" Body="&lt;h3&gt;Yes&lt;/h3&gt;&#xA;&lt;p&gt;I see a couple &lt;em&gt;potential&lt;/em&gt; issues, but nothing that's a deal breaker.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Crazy-inefficient code&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Some snippets posted here (especially for golf) have insane runtimes, memory needs, etc. At the least, we should encourage users to mention this if what they're posting will use an inordinant amount of time/resources. (they should probably do this anyway, but I see it as more important if running it is a single click away).&lt;/p&gt;&#xA;&lt;p&gt;The same could be said about anything &lt;em&gt;potentially&lt;/em&gt; malicious, although I see a lot less of that in general.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Voting for pretty/easy&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Pretty pictures get you votes, I think we can all agree on that. One-click runnable code would &lt;em&gt;probably&lt;/em&gt; also get you votes, if only because people can immediately see output and verify it's correct. That's not really a problem, &lt;em&gt;except&lt;/em&gt; that it's limited by language. Should JS answers have an advantage because the output is so accessible? Is that advantage large enough to worry about? I don't know yet, but it's a possibility.&lt;/p&gt;&#xA;&lt;p&gt;So like I said, nothing that I consider a deal breaker right now, just things to ponder. On the whole, I think it would be a good addition. Even more so if there were more languages available (but I'm not holding my breath for that).&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-09-17T15:35:56.883" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2205" PostTypeId="2" ParentId="2140" CreationDate="2014-09-17T16:56:51.873" Score="2" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;This message is open for anyone to adopt and post to main. For more details, see the &lt;a href=&quot;https://chat.stackexchange.com/rooms/60187/abandoned-challenges-up-for-adoption&quot;&gt;chat room&lt;/a&gt; or &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12792/58826&quot;&gt;meta post&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Edit: I'll have to clarify the optional features and there may be more. Essential I want to have the basic features covered, and if anything beyond gets implemented because it saves characters that is okay, but not required.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Edit: Updated but still working on it. Will definitely include edge cases and more examples as test cases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Edit: It might be cool to have this implemented as a function, and then have some follow up questions where you are allowed to call the function created here while only counting the function call as characters, and not the contents.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Still working on the specifics, but getting it the idea out there.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;2-Dimensional Regex&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a 2-Dimensional regex and a block of text, do a match, a single search and replace or a global search and replace depending on the input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Implement this as a function. The &lt;code&gt;input&lt;/code&gt; should be two arguments to the function. The first is the regex, and the second argument is the string to match. The &lt;code&gt;output&lt;/code&gt; should be a &lt;code&gt;truthy&lt;/code&gt; or &lt;code&gt;falsey&lt;/code&gt; value when doing a &lt;strong&gt;match&lt;/strong&gt;, or the &lt;code&gt;string&lt;/code&gt; when doing a &lt;strong&gt;search and replace&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Match&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;/aaa/&#xA;/bbb/&#xA;/ccc/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;aaaab&#xA;dbbba&#xA;ecccc&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A truthy value&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Single Search and Replace&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Replace the first instance of the match. The search order is the match that includes the top most character. If multiple matches end up with the top-most character on the same line, then include the left-most match.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;s/bb/cc/&#xA; /bb/cc/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abbaabba&#xA;bbbaabba&#xA;bbbaaaaa&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;accaabba&#xA;bccaabba&#xA;bbbaaaaa&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Global Search and Replace&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Replace all occurrences of the match. Matches do not overlap, and you use the same search order as the single search and replace.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;s/bb/cc/&#xA; /bb/cc/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abbaabba&#xA;bbbaabba&#xA;bbbaaaaa&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;accaacca&#xA;bccaacca&#xA;bbbaaaaa&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Another example:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;s/aba/bbb/&#xA; /aba/aba/&#xA; /aba/bbb/g&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;aaaabaaaa&#xA;  aabaababa&#xA;aababaababa&#xA;aabaaabbaba&#xA; aba&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;aaabbbaaa&#xA;  aabaabbbb&#xA;aabbbbababa&#xA;aabaaabbbbb&#xA; aba&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Only ASCII characters 32 through 126 are valid.&lt;/li&gt;&#xA;&lt;li&gt;Character classes are valid, &lt;code&gt;[a-c4-6]&lt;/code&gt; would match an &lt;code&gt;a&lt;/code&gt;,&lt;code&gt;b&lt;/code&gt;, &lt;code&gt;c&lt;/code&gt;, &lt;code&gt;4&lt;/code&gt;, &lt;code&gt;5&lt;/code&gt;, or &lt;code&gt;6&lt;/code&gt;. And &lt;code&gt;[b?7]&lt;/code&gt; matches one &lt;code&gt;b&lt;/code&gt;, one &lt;code&gt;?&lt;/code&gt;, or one &lt;code&gt;7&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;.&lt;/code&gt; matches any character.&lt;/li&gt;&#xA;&lt;li&gt;Use &lt;code&gt;\&lt;/code&gt; to escape there special characters to match their literal character instead of their special meaning: &lt;code&gt;{}[]/\.?*&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;a?&lt;/code&gt; matches 0 or 1 &lt;code&gt;a&lt;/code&gt;'s.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;b+&lt;/code&gt; matches 1 or more &lt;code&gt;b&lt;/code&gt;'s.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;c*&lt;/code&gt; matches 0 or more &lt;code&gt;c&lt;/code&gt;'s.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;b{2}&lt;/code&gt; matches 2 &lt;code&gt;b&lt;/code&gt;'s. Ranges such as &lt;code&gt;{2,5}&lt;/code&gt; to match 2 to 5 &lt;code&gt;b&lt;/code&gt;'s is optional.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;g&lt;/code&gt; flag replaces all of the occurrences, without it only the first occurrence would be replaced. This flag is optional.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Optional features:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Capture groups are optional. Please specify whether to use &lt;code&gt;()&lt;/code&gt; or &lt;code&gt;\(\)&lt;/code&gt; to match literal parenthesis.&lt;/li&gt;&#xA;&lt;li&gt;Grouping such as &lt;code&gt;(ab)+&lt;/code&gt; matching all of &lt;code&gt;abababab&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="29438" LastEditorDisplayName="user58826" LastEditDate="2017-06-09T20:02:48.723" LastActivityDate="2017-06-09T20:02:48.723" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="2207" PostTypeId="1" CreationDate="2014-09-17T20:52:13.953" Score="0" ViewCount="59" Body="&lt;p&gt;There is an interesting concept (in my eyes) of &lt;a href=&quot;http://en.wikipedia.org/wiki/Fat_binary&quot; rel=&quot;nofollow noreferrer&quot;&gt;fat binaries&lt;/a&gt;, and I have an idea of a challenge. Besides the fact that it may not be too feasible in this context, I feel like if anyone can do it, it would be this community. The problem arises from the fact that it may fall into more of a &lt;em&gt;post&lt;/em&gt;-programming puzzle.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My idea is a challenge to create the smallest fat binary with the points based on how many systems it works on, divided by how large the size of the file is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Basically, is the reverse of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/260/should-executable-binaries-be-considered-a-reasonable-solution-for-code-golf&quot;&gt;this question&lt;/a&gt; allowed.&lt;/p&gt;&#xA;" OwnerUserId="29903" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2014-09-17T20:52:13.953" Title="Can we submit binary and executable related questions?" Tags="|discussion|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2208" PostTypeId="2" ParentId="2140" CreationDate="2014-09-18T10:13:40.400" Score="0" Body="&lt;h2&gt;Facing a martian fractal&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.pinterest.com/ohgrammyio/fractals-are-awesome/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Fractals are awesome&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;They can be used for a very large number of pratical purposes, from &lt;a href=&quot;http://en.wikipedia.org/wiki/Fractal_antenna&quot; rel=&quot;nofollow noreferrer&quot;&gt;antennas&lt;/a&gt; to &lt;a href=&quot;http://en.wikipedia.org/wiki/Fractal_dimension_on_networks&quot; rel=&quot;nofollow noreferrer&quot;&gt;self-similarity of complex networks&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;One of the most fantastic uses of fractals tough remains &lt;a href=&quot;http://en.wikipedia.org/wiki/Fractal_landscape&quot; rel=&quot;nofollow noreferrer&quot;&gt;3D terrain landscaping&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/wh3ID.gif&quot; alt=&quot;weee! awesome&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;With such technique you can create awesome landscapes:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/0PoQr.jpg&quot; alt=&quot;This is actually computer generated&quot; /&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.viralnova.com/mars-is-awesome/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Mars is awesome&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The red planet is surrounded in a veil of mistery for its early earth-like life.&lt;/p&gt;&#xA;&lt;p&gt;Also, as you know, is full of &lt;a href=&quot;http://en.wikipedia.org/wiki/Cydonia_(region_of_Mars)&quot; rel=&quot;nofollow noreferrer&quot;&gt;martians&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/l85J2.jpg&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this photo we are &lt;a href=&quot;http://it.wikipedia.org/wiki/Pareidolia&quot; rel=&quot;nofollow noreferrer&quot;&gt;facing a martian face on mars&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;The Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to create a fractal landscape which resembles the martian face.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The prospective can be the most convinient for you as long as the face and the landscape are recognizable.&lt;/li&gt;&#xA;&lt;li&gt;The output should be a few frames GIF of landcape creation, to ensure that fractal approach has been used (just like the one above).&lt;/li&gt;&#xA;&lt;li&gt;You don't need to use the martian face, another landscape can be used as model as long as it has a pareidolic effect of a face in it. You can also not use a model and &amp;quot;draw&amp;quot; the face yourself.&lt;/li&gt;&#xA;&lt;li&gt;Colors are optional. Obviously they will give a greater chance to get more votes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Here are some other models if you are a bit short of ideas:&#xA;&lt;img src=&quot;https://i.stack.imgur.com/9go8D.jpg&quot; alt=&quot;enter image description here&quot; /&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/7NmME.jpg&quot; alt=&quot;enter image description here&quot; /&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/fBXw6.jpg&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="25024" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-09-18T10:13:40.400" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2211" PostTypeId="2" ParentId="2140" CreationDate="2014-09-18T21:22:36.467" Score="2" Body="&lt;h1&gt;Can you lose from this chess position?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot;&gt;chess&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You are an arbiter who supervises a very large number of chess tournaments. Thus, you frequently rule on whether a player who runs out of time may claim a draw based on Article 6.9 of the &lt;a href=&quot;http://www.fide.com/FIDE/handbook/LawsOfChess.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;FIDE Laws of Chess&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;[...] If a player does not complete the prescribed number of moves in&#xA;  the allotted time, the game is lost by the player. However, the game&#xA;  is drawn, if the position is such that the opponent cannot checkmate&#xA;  the player’s king by any possible series of legal moves.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In order to be able to perform your job more efficiently, you decide to create a computer program that determines whether it is possible for a player to be checkmated from a given position.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Regulations&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input will be a position with White to move, with at least one legal move available. You may assume that in the initial position, neither player will retain castling rights and no &lt;em&gt;en passant&lt;/em&gt; capture will be available. Additionally, you may assume that the existence of &lt;em&gt;en passant&lt;/em&gt; is irrelevant to the correct output. Your program must determine whether, starting from the input position, there exists any sequence of legal moves that ends in Black checkmating White's king.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Either a program utilizing standard input and output, or a function accepting a string and returning a number is acceptable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input will be given in &lt;a href=&quot;http://en.wikipedia.org/wiki/Forsyth%E2%80%93Edwards_Notation&quot; rel=&quot;nofollow noreferrer&quot;&gt;FEN notation&lt;/a&gt;, but excluding the last 4 tokens &amp;#8211; only the locations of the pieces on the board are described.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program shall output &lt;code&gt;1&lt;/code&gt; if it is possible for white to be checkmated, or &lt;code&gt;0&lt;/code&gt; if it is not.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Restrictions&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your source code must fit inside a post on this site.&lt;/li&gt;&#xA;&lt;li&gt;If the program exceeds 1 minute of thinking about a position, it is equivalent to an incorrect output.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The winner is the first competitor to submit a correct program. A program shall be considered correct if no one provides an input that causes the program to fail to produce correct output in time for three days after the program is posted. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;kb6/8/8/8/8/8/8/KB6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1kb5/8/8/8/8/8/8/KB6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3k4/8/1p1p1p1p/pPpPpPpP/P1P1P1P1/8/8/3K4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;---------------------------&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;Feedback&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Suggestions for improvement are welcome. I would most like to have some input on the victory condition. Is it too difficult to achieve? Should I score it on a fixed set of positions instead?&lt;/p&gt;&#xA;" OwnerUserId="30688" LastEditorUserId="30688" LastEditDate="2015-06-24T11:40:10.180" LastActivityDate="2015-06-24T11:40:10.180" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2212" PostTypeId="1" CreationDate="2014-09-18T21:33:15.407" Score="7" ViewCount="244" Body="&lt;p&gt;I'm stepping into a hornet's nest here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Popularity contests have been controversial. Some detractors believe that non-objective winning criteria are simply unacceptable. Others are OK with subjectivity in theory, but dislike that voters upvote answers based on coolness rather than programming merit or following the spec. My proposal is aimed at the second group.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I propose a new winning criterion &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/voter-judged&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;voter-judged&amp;#39;&quot; rel=&quot;tag&quot;&gt;voter-judged&lt;/a&gt;. The highest-voted answer wins, like pop cons, but the question spec must explicitly give (subjective) criteria for voters to decide what to upvote or downvote. There are many things that humans can judge much better than a hard algorithmic spec, like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35835/draw-random-black-and-white-forest&quot;&gt;looking like a forest&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Will voters actually follow it? I don't know. But, I hope that explicit instructors will sway some voters and make it clear what a good answer is expected to be, a source of endless controversy in discussions to close. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem with the name &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; is that it's a &lt;a href=&quot;http://www.urbandictionary.com/define.php?term=Popularity%20Contest&quot; rel=&quot;nofollow noreferrer&quot;&gt;mildly disparaging phrase&lt;/a&gt; that evokes high-school elections and voting in a bandwagon on appearances rather than merit. Hence my proposal for a new tag that frames voters as judges. The tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; would be reserved for questions where voters are in fact expected to vote for whatever they fancy.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-09-20T21:07:39.657" Title="Proposing new winning criterion tag: Voter-judged" Tags="|discussion|tags|winning-criteria|popularity-contest|" AnswerCount="3" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2213" PostTypeId="2" ParentId="2212" CreationDate="2014-09-19T01:01:40.790" Score="8" Body="&lt;p&gt;While I believe there is room for improvement as far as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; goes, I'm not convinced this is the answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are already popcons that give &lt;em&gt;subjective&lt;/em&gt; voting criteria, such as &lt;a href=&quot;https://codegolf.stackexchange.com/q/30322/14215&quot;&gt;good/bad&lt;/a&gt; bullets, most &lt;a href=&quot;https://codegolf.stackexchange.com/q/22144/14215&quot;&gt;beautiful/interesting&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/q/26214/14215&quot;&gt;audio quality/complexity&lt;/a&gt;, etc. So the solution you propose would do nothing for these except retag them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We &lt;em&gt;could&lt;/em&gt; add a line to popcon rules that say you must specify some subjective rules to address the others, but what does that actually gain?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem is, it's simply not enforceable. Oh, you can make sure people put guidelines in the question. Voting is up in the air, though. It's not just unenforceable, but you also have no way of even knowing if voters are following the guidelines. There's just nothing you can do about anonymous votes. Even if you clearly say spell out voting guidelines, pretty pictures are still pretty pictures, and it's hard for me to believe that people will just change behavior. If that's the case, what purpose does the rule serve?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So in my opinion, this is nothing more than a name change. And while that may have its merits, &quot;popularity contest&quot; is actually a very accurate name.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I have to add that comment-voting sounds like a distinctly bad idea to me. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There's no way to change a comment (if the answer gets edited, etc) except deleting it and writing a new one. This would invalidate any comment-upvotes it had.&lt;/li&gt;&#xA;&lt;li&gt;There's also no way to un-upvote a comment&lt;/li&gt;&#xA;&lt;li&gt;It changes the rep barrier for voting&lt;/li&gt;&#xA;&lt;li&gt;Upvoted comments reading &quot;6&quot; or &quot;7&quot; would block constructive comments until expanded&lt;/li&gt;&#xA;&lt;li&gt;With a 15 character minimum comment length, people will just put a number and fluff the rest&lt;/li&gt;&#xA;&lt;li&gt;The mods will probably hate this ;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-09-19T01:01:40.790" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2214" PostTypeId="1" CreationDate="2014-09-19T01:46:38.060" Score="21" ViewCount="1351" Body="&lt;p&gt;If a challenge says that input will be in the form of a string, what is acceptable? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Various languages have different ways of implementing strings, so here's what I've &quot;borrowed&quot; from &lt;a href=&quot;http://en.wikipedia.org/wiki/String_(computer_science)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;In computer programming, a string is traditionally a sequence of characters, either as a literal constant or as some kind of variable.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The reason I ask is that my most frequently used language here is Java. Of course, Java has a &lt;code&gt;String&lt;/code&gt; class, and that's what I've been using. However, I've run into a couple situations where a &lt;code&gt;char[]&lt;/code&gt; would be better. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my opinion, while a &lt;code&gt;char[]&lt;/code&gt; is not a &lt;code&gt;String&lt;/code&gt;, it &lt;em&gt;is&lt;/em&gt; a &quot;string&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Say I have a challenge that reads:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Write a function that takes a string (printable ASCII) as input, adds 1 to each character, and returns it (don't worry about overflow)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;While this is a trivial example, &lt;code&gt;String&lt;/code&gt; is crap here. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's not mutable, so I need a new one to return.&lt;/li&gt;&#xA;&lt;li&gt;To access a character you have to use &lt;code&gt;.charAt(i)&lt;/code&gt; instead of &lt;code&gt;[i]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;.length()&lt;/code&gt; is two bytes longer than &lt;code&gt;.length&lt;/code&gt; &lt;/li&gt;&#xA;&lt;li&gt;Once you add, you have to cast it back to &lt;code&gt;char&lt;/code&gt; or it converts to an integer:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;An example of both types:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;String a(String a){String b=&quot;&quot;;for(int i=0;i&amp;lt;a.length();b+=(char)(a.charAt(i++)+1));return b;}&#xA;&#xA;char[]a(char[]a){for(int i=0;i&amp;lt;a.length;a[i++]++);return a;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I haven't looked much to see if I can reduce either of these, but the point remains; there's &lt;em&gt;no way&lt;/em&gt; the &lt;code&gt;String&lt;/code&gt; version is coming out ahead. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, in some situations &lt;code&gt;String&lt;/code&gt; has the upper hand. If you need &lt;code&gt;indexOf()&lt;/code&gt;, &lt;code&gt;trim()&lt;/code&gt;, or easy conversion from literals, you'd want that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since both a &lt;code&gt;String&lt;/code&gt; and a &lt;code&gt;char[]&lt;/code&gt; are strings by most reasonable definitions of the word, I believe it shouldn't matter which is used. In addition, having to choose between the two makes for a different golf process than sticking to one or the other.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Don't get me wrong. I'm not saying that I've seen any argument/debate about this on the site, but I've personally held back from using &lt;code&gt;char[]&lt;/code&gt; where it asks for a string, and I just got around to wondering why. Either way, I think it would make a good &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1324/14215&quot;&gt;Standard Definition&lt;/a&gt;, and I'd like some input.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-07-18T15:33:08.927" Title="What's a string?" Tags="|discussion|answers|specification|" AnswerCount="5" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="2215" PostTypeId="2" ParentId="2140" CreationDate="2014-09-19T06:06:50.010" Score="1" Body="&lt;h1&gt;Thinking about the Box outside of the Box&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;(looking for input from community)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Everyone has heard about the 9 points 4 lines challenge, where the goal is to connect all the points on a 3x3 grid with only 4 straight line segments, and without lifting your pen.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It has been proven that it is simple to calculate the minimum number of lines needed for any square:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;http://www.kcl.ac.uk/ImportedImages/Schools/NMS/mathematics/mathsschool/Weekly-Maths-Challenge-Photos/WMC11-solution-B349x246.jpg&quot; alt=&quot;Example&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program that takes 2 positive integers as inputs, the dimensions of the grid of points (x points wide, y points tall) and calculates the minimum number of straight consecutive line segments needed to join all of the points on the grid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The line segments may go off of the grid of points. (obviously :P)&#xA;If either input is 0, output 0. If either input is 1, output 1. Otherwise you have to calculate the result. The inputs can be any positive integer, so hardcoding the solution is impossible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program is correct until proven wrong. Only one counterexample on one set of dimensions is enough to prove a program wrong. (lets say a program outputs 5 for the set x=3, y=3, and the real solution is 4, then the entire program is wrong and it is not counted)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a code-golf challenge, shortest code to fulfill the requirements wins.&lt;/p&gt;&#xA;" OwnerUserId="31133" LastEditorUserId="31133" LastEditDate="2014-09-19T06:26:34.333" LastActivityDate="2014-09-19T06:26:34.333" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2216" PostTypeId="2" ParentId="2214" CreationDate="2014-09-19T17:54:57.787" Score="25" Body="&lt;p&gt;I agree with the wikipedia definition. It's a sequence of characters. As the name suggests, it's one-dimensional. I program a lot in C and sometimes in Pascal, which both implement strings in different ways.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;C doesn't have a string type, only &lt;code&gt;char[]&lt;/code&gt; with a string by convention being terminated by a zero byte.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Original Pascal has a &lt;code&gt;String&lt;/code&gt; type which has a maximum length of 255, because the length of &lt;code&gt;s[]&lt;/code&gt; is stored in &lt;code&gt;s[0].&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More recently more advanced versions of these languages have been released, with more advanced string types. I frequently see C++ answers with both &lt;code&gt;std::string&lt;/code&gt; and &lt;code&gt;char[]&lt;/code&gt; and I see no problem with that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Brainfuck and assembly language have no types, yet clearly both can handle &quot;strings&quot; according to the wikipedia definition. So I would define it as a sequence of characters and leave it at that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What I do think question posters need to define, is what is a character, i.e. whether only ASCII or full unicode can be expected as input. I can think of one recent example where a poster stated that input would be ASCII only, but included a Euro sign in a test case (he later changed it to a dollar sign.) This is perhaps even more important for defining the winning criterion. Where questions specify that program length is by characters, it is good to see that many posters are now linking pages like &lt;a href=&quot;https://mothereff.in/byte-counter&quot; rel=&quot;nofollow&quot;&gt;https://mothereff.in/byte-counter&lt;/a&gt; in their questions, which removes any ambiguity. &lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="31716" LastEditDate="2016-07-18T15:33:08.927" LastActivityDate="2016-07-18T15:33:08.927" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="2217" PostTypeId="2" ParentId="2140" CreationDate="2014-09-19T19:59:06.513" Score="0" Body="&lt;p&gt;Well, I suppose my last suggestion was way too complex, so here's something else.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Blade Competition (Simple Card Game)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/AbQ47.jpg&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Certain RPG's include mini games that are quite a bit simpler than board and card games such as chess and poker, not too hard to implement and understand, but still complex enough to be interesting. So let's play Blade.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.youtube.com/watch?v=D1a10OdYp_g#t=195&quot; rel=&quot;nofollow noreferrer&quot;&gt;Images are better than words, so here's a short video of me playing Blade. I'm not trying to win, I'm trying to show off some interesting cases. Should be self-explanatory, the goal is to get as many points as possible.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;32 cards (see below). 2 players get a deck of 16 cards each (randomly). They both draw 10 cards initially and take turns discarding cards to their field. The goal is to maximize the sum of the card's values on your side of the field.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Before they start taking turns, both players draw a card from their deck and place it on their field. The player with the lower score begins. If their scores are equal, both player a new card from their decks.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When a player discard a card to his field, he loses if his new score is still lower than his opponent's score. When the player's score is higher, the game moves on to the opponents turn. When both player's scores are equal, all cards on the field are discarded, and they draw a new card from their decks as described above.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are 9 different card. Numbered cards from 1 to 7, whose value is 1-7. And two special cards, called &lt;code&gt;Bolt&lt;/code&gt; and &lt;code&gt;Mirror&lt;/code&gt;, whose value is 1 when they are used as the initial card. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;When a player plays &lt;code&gt;Mirror&lt;/code&gt;, both player's fields are exchanged with each &#xA;other.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When a player plays &lt;code&gt;Bolt&lt;/code&gt;, the last card played by the opponent gets invalidated and does not count towards the score anymore. It gets removed permanently once the opponent plays a numbered card 1-7.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A player may play a &quot;1&quot; and discard it to re-validate his invalidated card.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/blutorange/Blade-SenNoKiseki-/blob/master/README.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;See the github for a detailed explanation of the rules.&lt;/a&gt; This is only for reference, the rules as implemented by the controller program are final. If you think there's a bug, leave a comment.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;stdin&lt;/li&gt;&#xA;&lt;li&gt;One line, including a newline, with a json object representing the current state of the game.&lt;/li&gt;&#xA;&lt;li&gt;json[&quot;file&quot;] is the absolute path of a file you may use for storing information, it gets cleared once when the controller program is started.&lt;/li&gt;&#xA;&lt;li&gt;Your program (cli) gets called once for each decision it needs to make.&lt;/li&gt;&#xA;&lt;li&gt;That is, choosing a card to play, or choosing an initial card when there are no cards left in your deck.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Response&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;stdout&lt;/li&gt;&#xA;&lt;li&gt;A number, including a newline, representing the card you wish to play.&lt;/li&gt;&#xA;&lt;li&gt;0 corresponds to the first card in the json[&quot;player&quot;][&quot;hand&quot;] array.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;both players start with a score of 0&lt;/li&gt;&#xA;&lt;li&gt;N (to be decided) turns, timelimit T (tbd), for each turn:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Draw: score +1&lt;/li&gt;&#xA;&lt;li&gt;Win: score +2&lt;/li&gt;&#xA;&lt;li&gt;Lose: score +0&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Each program plays against each other program, the program with the highest score wins. I may add a few players of my own, but they won't be ranked.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Controller Program&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/blutorange/Blade-SenNoKiseki-&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ruby controller.rb &amp;lt;playerfile&amp;gt; &amp;lt;timelimit&amp;gt; &amp;lt;rounds&amp;gt; &amp;lt;quiet&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;See &lt;code&gt;players.txt&lt;/code&gt; for the syntax of the &lt;code&gt;playerfile&lt;/code&gt;. Set quiet to &lt;code&gt;y&lt;/code&gt; to suppress debug output. Set it to &lt;code&gt;n&lt;/code&gt; to to get a lot of information about the match, use this for debugging or if the rules are unclear. See below for a sample match with quiet set to &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please provide a cli line I can use to run your program on linux. I might be able to get Windows on a virtual machine.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Deck&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Card_Designation Number_of_Cards (Card's Value)&#xA;&#xA;1 2 (1)&#xA;2 3 (2)&#xA;3 4 (3)&#xA;4 4 (4)&#xA;5 4 (5)&#xA;6 3 (6)&#xA;7 2 (7)&#xA;B 6 (1)&#xA;M 4 (1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(B=Bolt, M=Mirror)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sample JSON input&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/blutorange/Blade-SenNoKiseki-/blob/master/sample_json&quot; rel=&quot;nofollow noreferrer&quot;&gt;link, sample below&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;newlines and spaces added for legibility&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;file&lt;/code&gt; is the absolute path of a file you may use for storing information, it gets cleared once when the controller program is started&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;lastmove&lt;/code&gt; is the last card played by the player / opponent, or null if no move has been made yet&lt;/li&gt;&#xA;&lt;li&gt;card &lt;code&gt;type&lt;/code&gt;s 1-7 correspond to the cards &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;7&lt;/code&gt;, card type &lt;code&gt;0&lt;/code&gt; is &lt;code&gt;Bolt&lt;/code&gt;, &lt;code&gt;8&lt;/code&gt; is &lt;code&gt;Mirror&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Everything else should be self-explanatory.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;  &quot;file&quot;: &quot;/home/.../cg_blade/files/basic&quot;,&#xA;  &quot;turn&quot;: 15,&#xA;  &quot;player&quot;: {&#xA;    &quot;hand&quot;: [&#xA;      {&#xA;        &quot;type&quot;: 8,&#xA;        &quot;value&quot;: 1,&#xA;        &quot;valid&quot;: true&#xA;      },&#xA;      ......&#xA;    ],&#xA;    &quot;field&quot;: [&#xA;      {&#xA;        &quot;type&quot;: 8,&#xA;        &quot;value&quot;: 1,&#xA;        &quot;valid&quot;: true&#xA;      },&#xA;      ......&#xA;      {&#xA;        &quot;type&quot;: 7,&#xA;        &quot;value&quot;: 7,&#xA;        &quot;valid&quot;: true&#xA;      }&#xA;    ],&#xA;    &quot;deck&quot;: 5,&#xA;    &quot;score&quot;: 30,&#xA;    &quot;lastmove&quot;: {&#xA;      &quot;type&quot;: 6,&#xA;      &quot;value&quot;: 6,&#xA;      &quot;valid&quot;: true&#xA;    }&#xA;  },&#xA;  &quot;opponent&quot;: {&#xA;    &quot;hand&quot;: 2,&#xA;    &quot;field&quot;: [&#xA;      {&#xA;        &quot;type&quot;: 3,&#xA;        &quot;value&quot;: 3,&#xA;        &quot;valid&quot;: true&#xA;      },&#xA;      ......&#xA;      {&#xA;        &quot;type&quot;: 6,&#xA;        &quot;value&quot;: 6,&#xA;        &quot;valid&quot;: true&#xA;      }&#xA;    ],&#xA;    &quot;deck&quot;: 5,&#xA;    &quot;score&quot;: 32,&#xA;    &quot;lastmove&quot;: {&#xA;      &quot;type&quot;: 8,&#xA;      &quot;value&quot;: 1,&#xA;      &quot;valid&quot;: true&#xA;    }&#xA;  }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Sample match&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/blutorange/Blade-SenNoKiseki-/blob/master/sample_match&quot; rel=&quot;nofollow noreferrer&quot;&gt;Link, sample below.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A sample match generated with the controller program and quiet set to &lt;code&gt;n&lt;/code&gt;. A bit long, but shows a few interesting cases.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Match between both players starts.&#xA;&amp;lt;basic&amp;gt; vs. &amp;lt;basic&amp;gt;&#xA;&#xA;&#xA;Initializing round 0.&#xA;Each player gets a deck of 16 cards.&#xA;Player 0: 3 6 5 3 6 7 B 5 2 4 B B 5 1 B B&#xA;Player 1: 1 2 4 4 3 3 M B M 5 2 6 7 4 2 M&#xA;Each player draws 10 cards.&#xA;Player 0: 1 2 4 5 5 B B B B B&#xA;Player 1: 2 2 4 5 6 7 B M M M&#xA;Cards remaining in each deck:&#xA;Player 0: 3 6 5 3 6 7&#xA;Player 1: 1 2 4 4 3 3&#xA;&#xA;&#xA;Round 0 starts.&#xA;&#xA;&#xA;Field initialization starts.&#xA;Player 0 draws initial card.&#xA;Player draws 7, and puts it on the field.&#xA;Player 1 draws initial card.&#xA;Player draws 3, and puts it on the field.&#xA;Player 1 gets first turn.&#xA;&#xA;&#xA;# Number in parentheses is the total score of the cards on the field.&#xA;Turn 0 starts.&#xA;Player 1's turn.&#xA;Player 0's field: 7 (7)&#xA;Player 1's field: 3 (3)&#xA;Player 0's hand (10): 1 2 4 5 5 B B B B B&#xA;Player 1's hand (10): 2 2 4 5 6 7 B M M M&#xA;Cards remaining in player 0's deck: 5.&#xA;Cards remaining in player 1's deck: 5.&#xA;Player 1 plays 5.&#xA;Player 1 ends his turn.&#xA;Player 0's field: 7 (7)&#xA;Player 1's field: 3 5 (8)&#xA;&#xA;&#xA;Turn 1 starts.&#xA;Player 0's turn.&#xA;Player 0's field: 7 (7)&#xA;Player 1's field: 3 5 (8)&#xA;Player 0's hand (10): 1 2 4 5 5 B B B B B&#xA;Player 1's hand (9): 2 2 4 6 7 B M M M&#xA;Cards remaining in player 0's deck: 5.&#xA;Cards remaining in player 1's deck: 5.&#xA;Player 0 plays 2.&#xA;Player 0 ends his turn.&#xA;Player 0's field: 7 2 (9)&#xA;Player 1's field: 3 5 (8)&#xA;......&#xA;......&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="26465" LastEditorUserId="26465" LastEditDate="2014-09-21T07:15:39.610" LastActivityDate="2014-09-21T07:15:39.610" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2218" PostTypeId="2" ParentId="2140" CreationDate="2014-09-19T23:29:36.063" Score="0" Body="&lt;p&gt;&lt;strong&gt;Position the Border Guard&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;[Currently INCOMPLETE. Posting here to save.]&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are in charge of defending an island from an invasion force. To do this, you decide to place &lt;em&gt;n&lt;/em&gt; guard posts around the perimeter of your island. You decide that the most effective way to ensure that the whole island is equally guarded is to equally distribute your guard posts around the perimeter of the island. In other words, if someone went around the perimeter your island with a surveyor's wheel, measuring the distance between guard posts walking on the perimeter, it would be equal for every guard post. For instance, if the island were a perfect circle, and I had to place 2 guard posts, they would be placed opposite to each other. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, the island is not a perfect circle. We can describe the shape of the island as sequence of arcs joined together as one cohesive shape, like the clouds in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2168/21682&quot;&gt;this question&lt;/a&gt;. The one difference is that in this question, there will never be a hole in the island. Given an input in the form&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;n island&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;n&lt;/code&gt; is the number of guard posts to place and &lt;code&gt;island&lt;/code&gt; is a space separated list of comma separated tuples &lt;code&gt;x,y,r&lt;/code&gt; indicating the x position, y position, and radius of the circles that construct the island, output &lt;code&gt;n&lt;/code&gt; 2-tuples indicating the x and y positions to place the guard posts in.&lt;/p&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2014-09-19T23:29:36.063" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2219" PostTypeId="1" AcceptedAnswerId="2220" CreationDate="2014-09-20T01:43:41.110" Score="14" ViewCount="386" Body="&lt;p&gt;I have a custom CPU emulator, with 44 instructions (opcodes), and I would like to challenge you guys to code a better kernel for it (current one is a simple command interpreter with 3 commands: HELP, EXEC and QUIT). Can I?&lt;/p&gt;&#xA;" OwnerUserId="31663" OwnerDisplayName="William Fernandes" LastActivityDate="2014-09-20T03:42:51.967" Title="Can I propose a contest for my own &quot;programming language&quot;?" Tags="|discussion|code-challenge|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2220" PostTypeId="2" ParentId="2219" CreationDate="2014-09-20T03:42:51.967" Score="8" Body="&lt;p&gt;Sure! That's sounds perfectly fine. You might want to post a draft in the sandbox for feedback, first.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You'll need a concise, but detailed description of what the program should do. And probably some example inputs and outputs. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;And you'll also need an objective winning criterion. (Something better than 'better', like shortest or fastest)&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2014-09-20T03:42:51.967" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2221" PostTypeId="2" ParentId="2212" CreationDate="2014-09-20T03:50:01.113" Score="2" Body="&lt;p&gt;This sounds like a good idea to me. There is power in the name of a thing. &quot;Voter-judged&quot; has better connotations than &quot;Popularity-contest&quot; and is more correct for the use to which we're putting it. Even if it's a slight gain, it is a gain.&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2014-09-20T03:50:01.113" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2223" PostTypeId="2" ParentId="2214" CreationDate="2014-09-20T17:22:09.577" Score="3" Body="&lt;p&gt;You're over-thinking the problem. Unless the challenge specifically states that you must use the native &quot;string&quot; type of the language, you get to interpret what &quot;string&quot; means in a way that's most advantageous to your implementation.&lt;/p&gt;&#xA;" OwnerUserId="20538" LastActivityDate="2014-09-20T17:22:09.577" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2225" PostTypeId="2" ParentId="2140" CreationDate="2014-09-20T18:01:47.047" Score="0" Body="&lt;h1&gt;Make a Ray Tracer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Ray_tracing_(graphics)&quot; rel=&quot;nofollow noreferrer&quot;&gt;A ray tracer&lt;/a&gt; is a program which, for each pixel in an virtual screen, traces a path from an imaginary eye through that pixel and calculates the color of the object visible through it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/jtFNu.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ray tracers are famously small enough to fit on a business card!  &lt;a href=&quot;http://fabiensanglard.net/rayTracing_back_of_business_card/index.php&quot; rel=&quot;nofollow noreferrer&quot;&gt;Code and explanation here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Tired of seeing ray tracers that just render a spheres or a sphere and a box and, if you're lucky, a torus?  This challenge addresses this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This task is to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt; a ray tracer that renders a &lt;a href=&quot;http://en.wikipedia.org/wiki/True_color&quot; rel=&quot;nofollow noreferrer&quot;&gt;true color&lt;/a&gt; scene specified by arguments.  The arguments are:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A triangle mesh, specified by the filename of an &lt;a href=&quot;http://en.wikipedia.org/wiki/Wavefront_.obj_file&quot; rel=&quot;nofollow noreferrer&quot;&gt;.obj mesh file&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;The &lt;a href=&quot;https://www.youtube.com/watch?v=RjA_sC4bCAM&quot; rel=&quot;nofollow noreferrer&quot;&gt;diffuse, ambient and specular&lt;/a&gt; (&lt;a href=&quot;http://www.glprogramming.com/red/chapter05.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;more&lt;/a&gt;) colors for the entire mesh&lt;/li&gt;&#xA;&lt;li&gt;A camera, specified by position, direction, up and field-of-view in degrees&lt;/li&gt;&#xA;&lt;li&gt;A &lt;a href=&quot;http://www.mbsoftworks.sk/index.php?page=tutorials&amp;amp;series=1&amp;amp;tutorial=11&quot; rel=&quot;nofollow noreferrer&quot;&gt;point&lt;/a&gt; light source, specified by position and color&lt;/li&gt;&#xA;&lt;li&gt;A directional light source, specified by direction and color&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The output shall be a &lt;a href=&quot;http://netpbm.sourceforge.net/doc/ppm.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;.ppm file&lt;/a&gt;, which can be converted to jpg for inclusion in the answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are lots of .obj files available on the Internet e.g. &lt;a href=&quot;http://groups.csail.mit.edu/graphics/classes/6.837/F03/models/&quot; rel=&quot;nofollow noreferrer&quot;&gt;a teapot, cow and teddy bear&lt;/a&gt; and these &lt;a href=&quot;http://en.wikipedia.org/wiki/List_of_common_3D_test_models&quot; rel=&quot;nofollow noreferrer&quot;&gt;standard test meshes&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="30869" LastEditorUserId="30869" LastEditDate="2014-09-20T21:19:03.757" LastActivityDate="2014-09-20T21:19:03.757" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="2226" PostTypeId="2" ParentId="2212" CreationDate="2014-09-20T21:07:39.657" Score="6" Body="&lt;p&gt;I'm not really your target audience, but it sounds to me like you're trying to split pop-con into two tags which function roughly as &quot;good pop-con&quot; and &quot;bad pop-con&quot;. I don't think that's your intention, but it can be perceived like that, and could send the message that &quot;bad pop-con is ok&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would be less unhappy about a push to get pop-con writers to give voting guidelines, maybe coupled with a renaming of the tag, than with this idea of splitting the tag.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-09-20T21:07:39.657" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2228" PostTypeId="2" ParentId="2140" CreationDate="2014-09-22T14:42:21.293" Score="0" Body="&lt;h1&gt;Sudden Death Rummy&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt; with following rules: A 50 game match is played and the winner gets an average score per game. This average score is then multiplied by the bytecount of the program. The winner is the program with the lowest product of average score and bytecount.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rummy is a card game where the objective is to get rid of all cards in your hand by forming &quot;melds&quot;. A meld is either a consecutive series of cards in the same suit, or 3/4 cards of different suits of the same value, which is, in ascending order A(ce), 2-10, V(alet), Q(ueen) or K(ing). A meld is always at least 3 cards, and 13 cards at the most.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my regional variant of discard rule Rummy, there are 7 rounds. the first 6 rounds require you to put down N+2 cards in 1 or more melds, then discard 1 card, then finish your turn, before you can start using existing melds or put down new melds. in the 7th round, you NEED to be able to place down your entire hand and discard the one card in 1 turn, before your opponent can do this. You start with 10 cards, and every turn you cannot empty your entire hand, you draw another card and give the turn to the opponent. The actual system involves buying cards and bidding wars, but to simplify, it's just round robbing cards until one of them finishes.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Your task: Create a Rummy bot that plays against itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: a number between 1 and 100 denoting how many games should be played.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;your program needs to generate 2 random legitimate hands as the first task. The deck starts with 104 cards: 2 full decks, 4 suits per deck, 13 cards per suit. 10 cards per hand from the deck.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;second task: one hand randomly starts. If the program cannot make a legitimate Sudden Death Rummy hand clear, it draws a random card and hands the turn to the other hand. If the program CAN make a legitimate hand clear, it displays 2 lines. The first line is a comma-separated list displaying the winning hand clear. The second line is the sum of the value of the cards of the other hand, with number cards being their respective value and A/V/Q/K being 10 points each. this task switches between players until one of them is the winner. If the game lasts long enough for the deck to be depleted, no victor is declared and both hands get scored according to the above rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;3rd task: after a victor is chosen, the next game starts. task 1 and 2 are repeated until there have been as many games as the input indicates. At this point, the match ends. The victor is the side who has the lowest amount of points after the end of the last game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[&lt;strong&gt;Sandbox Note:&lt;/strong&gt; I need to: Figure out a scoring method that doesn't require multiplying or averaging average score and bytecount without encouraging high bytecounts or average scores; decide whether to include a runtime limit; Decide whether the program should also display the hand and drawn cards.] &lt;/p&gt;&#xA;" OwnerUserId="14141" LastEditorUserId="14141" LastEditDate="2014-10-04T20:27:13.150" LastActivityDate="2014-10-04T20:27:13.150" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2230" PostTypeId="1" CreationDate="2014-09-22T20:15:03.777" Score="3" ViewCount="143" Body="&lt;p&gt;The sandbox is now owned by a dummy account, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/31362/sandbox&quot;&gt;Sandbox&lt;/a&gt;. At the moment it has a default profile picture.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can we create/find a profile picture for it that illustrates that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the user is a dummy account&lt;/li&gt;&#xA;&lt;li&gt;the user's sole purpose is to run the sandbox&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think we may want something like the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/-1/community&quot;&gt;Community&lt;/a&gt; user's profile.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(And, while we're at it, maybe a description that explains what the user does?)&lt;/p&gt;&#xA;" OwnerDisplayName="user16402" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2014-12-02T01:29:36.750" Title="Profile Picture for Sandbox User" Tags="|feature-request|status-completed|sandbox|site-design|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2231" PostTypeId="2" ParentId="2230" CreationDate="2014-09-22T20:39:29.253" Score="3" Body="&lt;p&gt;I took the liberty of writing out a profile for our beloved Sandbox. I kept it simple. He doesn't actually &quot;run&quot; the Sandbox. He just exists so that nobody else gets all of the notifications.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Add our website to his bio:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;website codegolf.stackexchange.com&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Set his profile text as follows:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Hi, I'm not really a person.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;I exist to own the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/18487&quot;&gt;Sandbox&lt;/a&gt;, so that no single member of the community has to endure the constant updates being made to it.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;He &lt;em&gt;owns&lt;/em&gt; the Sandbox, but he is not a Sandbox. Fill the blank below with your own suggestion in the comments. Upvote your favorite suggestions!&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Community : Stack Exchange :: _______ : Sandbox&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Someone from PPCG should create original art for Sandbox. Heck, you could even make a pop contest out of it if you took the time to write a solid-enough spec.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2014-09-22T20:53:44.407" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2233" PostTypeId="1" AcceptedAnswerId="2237" CreationDate="2014-09-23T10:43:41.743" Score="3" ViewCount="261" Body="&lt;p&gt;&lt;strong&gt;&lt;em&gt;The problem has been resolved. Thanks everyone!&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/36891/life-can-be-colorful&quot;&gt;this question&lt;/a&gt; a few weeks ago and originally it only asked about the Game of Life so it was closed as a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/3434/shortest-game-of-life&quot;&gt;Shortest Game of Life&lt;/a&gt;. I changed the question to allow all life-like automata but it was closed again to my confusion. As someone said, there are distinct questions about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/34505/simulate-rule-110&quot;&gt;rule 110&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4370/simulate-any-1d-cellular-automaton?rq=1&quot;&gt;1D cellular automata&lt;/a&gt; so I didn't see how it was still a duplicate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My argument is that my question was incorrectly marked as a duplicate when it was closed the second time, namely because:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;my question is a &lt;em&gt;generalization&lt;/em&gt; of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/3434/shortest-game-of-life&quot;&gt;Shortest Game of Life&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;answers from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/3434/shortest-game-of-life&quot;&gt;Shortest Game of Life&lt;/a&gt; could hardly be copied into my question without major rewriting&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;so I would like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/36891/life-can-be-colorful&quot;&gt;Life can be colorful!&lt;/a&gt; reopened.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Now irrelevant side-note:&lt;br&gt;&#xA;I had &lt;a href=&quot;https://codegolf.stackexchange.com/questions/38098/life-can-be-colorful?noredirect=1#comment87569_38098&quot;&gt;reposted the question&lt;/a&gt; but I realize that was the wrong thing to do. I should have made a meta post, so here it is.)&lt;/p&gt;&#xA;" OwnerDisplayName="user31074" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-10-03T13:10:01.320" Title="Wrongly Marked Duplicate - Life can be colorful!" Tags="|discussion|closed-questions|reopening|duplicates|" AnswerCount="2" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="2235" PostTypeId="1" CreationDate="2014-09-23T20:58:19.987" Score="5" ViewCount="177" Body="&lt;p&gt;&lt;a href=&quot;//codegolf.stackexchange.com/questions/38093/little-chandler-is-sad-draw-him-a-cloud-to-cheer-him-up&quot; rel=&quot;nofollow&quot;&gt;One of my recent questions, titled &lt;strong&gt;☁ A Little Cloud ☁&lt;/strong&gt;&lt;/a&gt;, was renamed in an edit to &lt;strong&gt;Little Chandler is sad. Draw him a cloud to cheer him up&lt;/strong&gt;. I don't mind the title change, but I am curious as to the reasons why it was changed. Was it because of the Unicode characters? Or something else? I was hopeful to create a series of challenges based off Dubliners, but if there is something wrong about using the titles of the short stories as challenge titles, I would like to know.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In particular, is there a full set of rules or guidelines available for what sort of titles are allowed? &lt;/p&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="9275" LastEditDate="2014-09-24T13:20:28.957" LastActivityDate="2014-09-24T13:20:28.957" Title="What are the rules regarding question titles?" Tags="|discussion|titles|" AnswerCount="0" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="2237" PostTypeId="2" ParentId="2233" CreationDate="2014-09-24T07:28:28.410" Score="-1" Body="&lt;p&gt;This happens a lot, and there are a few meta posts about closing duplicates if you want some background. From the discussions i have seen, its usually comes down to whether answers from one question could be copied to another with minimal changes (other times its more arbitrary). Since this is community run, the best thing you can do is gain enough rep to cast re-open votes and use them whenever you see question being closed un-necessarily.&lt;/p&gt;&#xA;" OwnerUserId="21713" LastActivityDate="2014-09-24T07:28:28.410" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2238" PostTypeId="1" CreationDate="2014-09-24T11:12:46.363" Score="8" ViewCount="234" Body="&lt;p&gt;In challenges on this site, particularly code-golf, answers are sometimes given that you can neither read nor test. If the answer is, for example, the shortest, should you still accept it?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an example, consider code-golf answers written in APL. It is likely that I won't be able to read any of it and there is no free APL compiler/interpreter as far as I know so I can't test it either. Should I just believe that it does whatever the answerer says it does and award the win?&lt;/p&gt;&#xA;" OwnerDisplayName="user9206" LastActivityDate="2014-09-24T13:12:02.320" Title="Should you accept answers you can't read and you can't test?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2239" PostTypeId="2" ParentId="2238" CreationDate="2014-09-24T13:12:02.320" Score="7" Body="&lt;p&gt;I don't think you can exclude these &lt;em&gt;by default&lt;/em&gt;. For example, if an asker only knows C-like syntax languages, they're going to balk on many, many answers here, regardless of whether there's an interpreter &quot;somewhere&quot;. Answerers can't read minds (well, most of them), so they won't even know up front which languages are &quot;good&quot;. That's simply not fair.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The community in general frowns on language-specific challenges (unless there's a good reason), and I don't see how this is much different. The vast majority of answers are in languages that have an interpreter easily available (&lt;em&gt;glare at Mathematica&lt;/em&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you need an interpreter/compiler/environment, there's a large list of them &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/202/14215&quot;&gt;here on meta&lt;/a&gt;. If there's an answer in a language you don't see on the list (APL?), consider leaving a comment asking them to add it to the list.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2014-09-24T13:12:02.320" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="2244" PostTypeId="2" ParentId="2140" CreationDate="2014-09-25T15:05:12.660" Score="0" Body="&lt;h1&gt;Calculate an arbitrary linear recursive sequence&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;in this question given a recursive definition for a sequence we need to output a formula for the given sequence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;in this question, a linear recursive sequence is a sequence of the form:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a_0 = c_0&#xA;a_1 = c_1&#xA;...&#xA;a_{m-1} = c_{m-1}&#xA;&#xA;for n &amp;gt;= m: a_n = x_1*a_{n-1} + x_2*a_{n-2} + ... + x_m*a_{n-m}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;m, c_1 ... c_{m-1}, x_1 ... x_m&lt;/code&gt; are all constants.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;for example, such a definition (the fibonacci numbers):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a_0 = 0 // c_0 is 0&#xA;a_1 = 1 // c_1 is 1&#xA;for n &amp;gt;= 2: a_n = 1*a_{n-1} + 1*a_{n-2} // x_1 is 1 and x_2 is 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;the answer may be a function and get input as two lists, one containing &lt;code&gt;a_0...a_{m-1}&lt;/code&gt; and one containing &lt;code&gt;x_1 ... x_m&lt;/code&gt;, and return a string, or be a complete program and get the input as a space separated numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;because polynomials of degree up to 5 can be solved but polynomials of degree 5 or higher can't, the solution may assume that &lt;code&gt;m&lt;/code&gt; is smaller than 5.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;the output must be a formula that given &lt;code&gt;n&lt;/code&gt; returns &lt;code&gt;a_n&lt;/code&gt;. if two formulas are different but both return the same output for every index, both of them can be outputted. so, for the powers of 2, both &lt;code&gt;(1+1)^n&lt;/code&gt; and &lt;code&gt;2*2^n - 2^n&lt;/code&gt; can be outputted.&lt;br&gt;&#xA;in the output &lt;code&gt;√5&lt;/code&gt; denotes the square root of 5, as does &lt;code&gt;2√5&lt;/code&gt;. &lt;code&gt;3√5&lt;/code&gt; denotes the third root of 5.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example input and output:&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f ([0,1],[1,1]) (fibonacci numbers) can result in ((1+√5)^n-(1-√5)^n)/√5&#xA;f ([1],[2])     (the powers of 2)   can result in 2^n&#xA;f ([1,2],[1,2]) (the powers of 2 again)   &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;bonus:&lt;/strong&gt;&lt;br&gt;&#xA;if your solution uses no library function which solves equations, -80 bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;this is code golf, so smallest byte count wins&lt;/p&gt;&#xA;" OwnerUserId="20370" LastEditorUserId="194" LastEditDate="2014-09-26T10:37:44.053" LastActivityDate="2014-09-26T10:37:44.053" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="2245" PostTypeId="2" ParentId="2140" CreationDate="2014-09-25T23:22:40.040" Score="2" Body="&lt;h1&gt;Program Survival&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(king of the hill)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are a program (in any language). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your goal is to survive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You exist as a single point on a 2 Dimensional toroidal map of integer coordinates. However, you are made up of letters, numbers and characters that exist within this single point.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;You live on chars&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program is made up of characters. Each character can either contribute to the execution of your program or be &quot;saved&quot; for later (not contribute to your program).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are (literally) what you eat. Therefore, each point on the grid can contain 1 or more (specific) chars. If you land on a space with char(s), those chars are added &lt;strong&gt;to the end&lt;/strong&gt; of your program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, you must also live on chars. Therefore, to move costs 1 char. Merely to exist costs 1 char every 3 turns. &lt;strong&gt;You may &quot;use&quot; chars from any part of your program&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What do programs do?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Programs can move. This means that they can move 1 unit up, left, down or right. Remember this costs 1 char.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Programs can also make other programs. This uses chars from your own program to construct a new one. Because this directly costs chars to you, there is no cost to constructing other programs. &lt;strong&gt;You must leave at least 20 chars in the old program&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Programs can be malicious. Programs can &quot;attack&quot; other programs. When two programs are next to each other, they may spend 1 char to remove a char from their enemy. &lt;strong&gt;They may only remove the char from the end of the enemy's program&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Programs can also enter a self-initiated coma. the program remains stationary for a minimum of 15 turns at the cost of 1 char per 7 turns.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What will programs know?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each program will recieve the following as command line args:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Their own source code (as a String)&lt;/li&gt;&#xA;&lt;li&gt;All cells within 5 x 5 square centered on the program&lt;/li&gt;&#xA;&lt;li&gt;Any programs within vision + its coordinates (with respect to you) + the last 30 chars of its program.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;How is this going to work?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This game is turn based, so on any given turn you may do any number of the following:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;move (limited to 1 time per turn)&lt;/li&gt;&#xA;&lt;li&gt;attack (limited to 5 times per turn)&lt;/li&gt;&#xA;&lt;li&gt;induce coma (obviously limited to 1 time)&lt;/li&gt;&#xA;&lt;li&gt;produce new programs (not limited)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;If at any point your program fails to run (any error) your program dies&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specifics&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Two programs cannot occupy the same point. If a program moves to where a program is currently at, then the move is denied and the cost is revoked.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a program chooses to create another program, the characters needed for that program will be taken from the end of the mother program. If there are not enough characters to fulfill the construction of the child program, no change will be made. &lt;strong&gt;Characters will be taken from the meat of your program if you fail to provide characters&lt;/strong&gt; later in your program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In order to make a move, you must output the following with a newline between each:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;move - &quot;M(x,y),i&quot; where abs(x+y) = 1 and i = the index of the char you want to remove.&lt;/li&gt;&#xA;&lt;li&gt;attack - &quot;A(x,y),i where abs(x+y) = 1 and i = the index of the char you want to remove.&lt;/li&gt;&#xA;&lt;li&gt;coma - &quot;C&quot;&lt;/li&gt;&#xA;&lt;li&gt;reproduce - &quot;R(x,y),s where abs(x+y) = 1 and s is the new program (as a string)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;There is a &lt;strong&gt;_&lt;/strong&gt; char limit for your first program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Should char limits be set per language? Also, how much?&lt;/em&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Is compiling other languages on the fly difficult? I know it is possible in Java, but I am unsure in others. I have not made a controller for this yet because I am looking to see if this is a viable challenge&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="29820" LastEditorUserId="29820" LastEditDate="2014-09-26T02:23:42.853" LastActivityDate="2014-09-26T02:23:42.853" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2249" PostTypeId="1" CreationDate="2014-09-28T06:21:27.620" Score="6" ViewCount="256" Body="&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/546/fair-size-comparison-across-languages-with-different-source-alphabets&quot;&gt;Fair size comparison across languages with different source alphabets&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Scoring non-ASCII languages in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; has been long-debated. Since I primarily uses APL for code golf, I have seen and been in these discussions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it is reasonable to handicap non-ASCII languages based on expressing power of a single character. However, utf-8 does &lt;em&gt;not&lt;/em&gt; do that. Take APL as an example. All non-ASCII character APL uses are in the Miscellaneous Technical block which is 3 bytes. There are also ASCII characters that simply goes unused or for things that are useless for code golf (like forking or object-oriented stuff). Actually, APL uses only 50 or so non-ASCII symbols so APL programs can be mapped entirely within ASCII if you restrict legal identifiers and/or allow non-printable ASCII.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Community consensus is that any language whose spec is up before the challenge is posted is allowed if the OP does not otherwise restrict its use. And that leads to my question: &lt;strong&gt;Does a language which is only character substitutions of an existing language allowed?&lt;/strong&gt; And, if it is, is a translation table for such a language sufficient as a spec?&lt;/p&gt;&#xA;" OwnerUserId="6972" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2014-09-28T17:48:57.987" Title="On byte count and language preprocessing" Tags="|discussion|code-golf|policy|scoring|" AnswerCount="1" CommentCount="5" ClosedDate="2014-09-30T19:01:35.813" ContentLicense="CC BY-SA 3.0" />
  <row Id="2250" PostTypeId="2" ParentId="2249" CreationDate="2014-09-28T17:48:57.987" Score="4" Body="&lt;p&gt;I don't think this is different from, e.g., Pyth which is &lt;em&gt;mostly&lt;/em&gt; a 1-to-1 mapping of built-ins to single letters. That's another form of eliminating some inherent weakness of the language for golfing. In your case, it's just even simpler in that you want to replace 3-byte Unicode characters with ASCII. So the usual rules apply:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Write your own spec for an APL derivative.&lt;/li&gt;&#xA;&lt;li&gt;Write a compiler (which can probably be a YourLanguage-to-APL compiler).&lt;/li&gt;&#xA;&lt;li&gt;Use the new language after you've released the compiler.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Reference: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1416/1-on-1-language-mappings-legal&quot;&gt;1 on 1 language mappings &amp;quot;legal&amp;quot;?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2014-09-28T17:48:57.987" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2254" PostTypeId="2" ParentId="202" CreationDate="2014-09-29T08:41:14.263" Score="8" Body="&lt;h2&gt;APL&lt;/h2&gt;&#xA;&lt;p&gt;Note that &amp;quot;APL&amp;quot; is a rather vague term and a program written for one of these interpreters is unlikely to work with one of the others.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://www.gnu.org/software/apl/&quot; rel=&quot;nofollow noreferrer&quot;&gt;GNU APL&lt;/a&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Free software, runs on Linux. It's a bit sparse on features.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://www.nars2000.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;NARS2000&lt;/a&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Free software, runs on Windows. APL2-ish, has quite a bit of extra features.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://www.dyalog.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Dyalog APL&lt;/a&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Full-featured commercial software, but &lt;s&gt;by registering,&lt;/s&gt; you &lt;s&gt;can&lt;/s&gt; get a free non-commercial license for the latest version on any platform. &lt;s&gt;Alternatively, you can live with the pop-ups and nag screens of the unregistered version.&lt;/s&gt; Has built-in GUI support, unlike any of the others.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://tryapl.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;TryAPL&lt;/a&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Runs in your browser, implements a large subset of Dyalog's newest version. Notably missing are most forms of I/O.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://ngn.github.io/apl/web/&quot; rel=&quot;nofollow noreferrer&quot;&gt;ngn/apl&lt;/a&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Also runs in your browser. Dyalog 14... &lt;em&gt;ish&lt;/em&gt;. (In fact, Dyalog 14 seems to have lifted some extensions from this.) Free (both kinds) implementation, but kind of quirky, for example &lt;code&gt;⎕IO&lt;/code&gt; is stuck to &lt;code&gt;0&lt;/code&gt; and it doesn't support &lt;code&gt;∇&lt;/code&gt;-function definitions. Allows inline Javascript, for if you ever get the urge to write a web app in APL.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://tio.run/#apl-dyalog&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Full session installation of Dyalog APL but stuck at version 17.1&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://ato.pxeger.com/run?1=m70qsSAnPqUqMTM3ccGCpaUlaboWC5YUJyUXwzhQGgA&quot; rel=&quot;nofollow noreferrer&quot;&gt;ATO&lt;/a&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Full shell script installation of the newest Dyalog APL.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Additional options &lt;a href=&quot;https://aplwiki.com/wiki/Running_APL&quot; rel=&quot;nofollow noreferrer&quot;&gt;listed on APL Wiki&lt;/a&gt;.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="1426" LastEditorUserId="43319" LastEditDate="2023-09-20T08:42:09.537" LastActivityDate="2023-09-20T08:42:09.537" CommentCount="3" CommunityOwnedDate="2014-09-29T08:41:14.263" ContentLicense="CC BY-SA 4.0" />
  <row Id="2255" PostTypeId="1" AcceptedAnswerId="2256" CreationDate="2014-09-29T09:55:36.263" Score="2" ViewCount="85" Body="&lt;p&gt;Are challenges for one specific questions okay?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Suppose I want to ask for &lt;em&gt;shortest code to plant a memory leak in C++&lt;/em&gt; - would that be okay?&lt;/p&gt;&#xA;" OwnerUserId="31805" LastActivityDate="2014-09-29T10:11:22.773" Title="Can I ask questions for one language only?" Tags="|support|" AnswerCount="1" CommentCount="1" ClosedDate="2014-09-29T21:41:11.503" ContentLicense="CC BY-SA 3.0" />
  <row Id="2256" PostTypeId="2" ParentId="2255" CreationDate="2014-09-29T10:11:22.773" Score="9" Body="&lt;p&gt;Single-language questions are not strictly prohibited, but they are unpopular, and you can expect to get a lot of down-votes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Your example question would also likely be closed as &quot;&lt;em&gt;Unclear what you're asking&lt;/em&gt;&quot; until you provided a good definition of what you mean by &lt;em&gt;memory leak&lt;/em&gt;).&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-09-29T10:11:22.773" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2257" PostTypeId="2" ParentId="2140" CreationDate="2014-09-29T13:15:09.087" Score="0" Body="&lt;h1&gt;Fake the forecast #2&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Somewhat unfairly, your boss wasn't happy with your &lt;a href=&quot;https://codegolf.stackexchange.com/questions/38140/fake-the-forecast&quot;&gt;last attempt at forecast fakery&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;She's giving you one last chance, with extra stipulations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;This time your task is to draw a map, as a grid of arrows, representing both wind speed and direction&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A grid is 8 tiles by 8 tiles.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A tile is an &lt;a href=&quot;http://en.wikipedia.org/wiki/Arrow_%28symbol%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;arrow&lt;/a&gt; representing a direction and a speed.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There are 8 potential wind directions, represented by the direction of the arrow:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;img src=&quot;https://i.stack.imgur.com/iH0rD.png&quot; alt=&quot;N&quot;&gt; N&lt;/li&gt;&#xA;&lt;li&gt;&lt;img src=&quot;https://i.stack.imgur.com/uaT3E.png&quot; alt=&quot;NE&quot;&gt; NE&lt;/li&gt;&#xA;&lt;li&gt;&lt;img src=&quot;https://i.stack.imgur.com/k2bDf.png&quot; alt=&quot;E&quot;&gt; E&lt;/li&gt;&#xA;&lt;li&gt;&lt;img src=&quot;https://i.stack.imgur.com/Pjaox.png&quot; alt=&quot;SE&quot;&gt; SE&lt;/li&gt;&#xA;&lt;li&gt;&lt;img src=&quot;https://i.stack.imgur.com/P9aC5.png&quot; alt=&quot;S&quot;&gt; S&lt;/li&gt;&#xA;&lt;li&gt;&lt;img src=&quot;https://i.stack.imgur.com/v7QwQ.png&quot; alt=&quot;SW&quot;&gt; SW&lt;/li&gt;&#xA;&lt;li&gt;&lt;img src=&quot;https://i.stack.imgur.com/WsDCJ.png&quot; alt=&quot;W&quot;&gt; W&lt;/li&gt;&#xA;&lt;li&gt;&lt;img src=&quot;https://i.stack.imgur.com/Ysyrl.png&quot; alt=&quot;NW&quot;&gt; NW&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There are 6 potential wind speeds, represented by the colour of the arrow (e.g. &lt;img src=&quot;https://i.stack.imgur.com/8QieL.png&quot; alt=&quot;speeds&quot;&gt;):&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;h1&gt;00F (&amp;lt;20 mph)&lt;/h1&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;h1&gt;0FF (21-30 mph)&lt;/h1&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;h1&gt;0F0 (31-40 mph)&lt;/h1&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;h1&gt;FF0 (41-50 mph)&lt;/h1&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;h1&gt;F00 (51-60 mph)&lt;/h1&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;h1&gt;F0F (&gt;60 mph)&lt;/h1&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;There are geographical restrictions:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Each tile has a terrain type, land (L) or sea (S). These are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;S L L L L L S S&#xA;S S S L L L L S&#xA;S S S L L L L S&#xA;S S S S L L L L&#xA;S S L S S L L S&#xA;S S S S L S L L&#xA;S S S L L S S S&#xA;S S S S S S S S&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Wind speed on land may only be between 1 and 4&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;Wind speed at sea may only be between 3 and 6&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Variation must be gradual&lt;/strong&gt;, specifically:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a feature (i.e. direction or speed) differs from one of its 4 adjoining tiles (or 3 for side tiles, 2 for corner tiles) it can only differ by one increment or decrement from that neighbour. e.g. a tile whose neighbour has wind speed 4 may have a wind speed of 3, 4 or 5 (assuming it accords with other neighbours).&lt;/li&gt;&#xA;&lt;li&gt;Directions can loop around, i.e. N -&gt; NW and NW -&gt; N. However, speeds cannot.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Because your boss is looking for believable maps, she has introduced &lt;strong&gt;four arbitrary restrictions&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There is always at least 1 tile with wind speed 6&lt;/li&gt;&#xA;&lt;li&gt;There is always at least 1 tile with wind speed 1&lt;/li&gt;&#xA;&lt;li&gt;A wind speed of 6 is always northeasterly&lt;/li&gt;&#xA;&lt;li&gt;A wind speed of 1 is always southwesterly&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Maps must be unique&lt;/strong&gt;, don't generate the same map for different inputs.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input is a positive non-zero integer corresponding to the days between now and your forecast (e.g. 1 is tomorrow's forecast, 365 is a year's time).&lt;/li&gt;&#xA;&lt;li&gt;Output can be any format (e.g. image or text) but must take the form of a grid of arrows&lt;/li&gt;&#xA;&lt;li&gt;Output should be reproducible — the same input will always give the same output&lt;/li&gt;&#xA;&lt;li&gt;Each output must be unique from those generated using a lower input.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Because you really need to impress your boss this time, you should aim to give valid output for as many days in to the future as you can. Therefore, &lt;strong&gt;scoring is based on input limit:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your submission's input limit is regarded as 1 less than the lowest input that gives non-unique or otherwise invalid output.&lt;/li&gt;&#xA;&lt;li&gt;For instance, if valid and unique output is produced for an input of 1, 2 or 3 but not 4, your input limit is 3.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The winner is the submission with the highest input limit&lt;/strong&gt; - i.e. the submission which continues to give valid and unique output up to the largest input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is a 768 byte limit on source code. &lt;strong&gt;If there is a draw the entry with the fewest bytes wins&lt;/strong&gt;, so keep it short.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Here's an &lt;strong&gt;example of valid output&lt;/strong&gt; (terrain shown for illustrative purposes only):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/olxTv.png&quot; alt=&quot;example&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Some clarifications:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;There needn't be a relation between forecasts, consecutive or otherwise (except that they must be unique).&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Outside of a submission's 'input limit' there is no defined output.&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;There are no graphical restrictions except those specified.&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;You may supply the terrain definition grid as input - in which case it wont count towards your byte count&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;No other input or fetching of external data is permitted&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;The link to the previous question is purely in theme, no rules are carried across and previous solutions (clearly) wouldn't be valid here.&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;You don't have to draw the terrain type or any other embelishments - you can if you want but it isn't a popularity contest&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Would this question be marked as a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/38140/fake-the-forecast&quot;&gt;duplicate&lt;/a&gt;? &lt;/li&gt;&#xA;&lt;li&gt;Is a 768 byte limit too restrictive? Too easy?&lt;/li&gt;&#xA;&lt;li&gt;Have I left any loopholes?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="31376" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.653" LastActivityDate="2014-09-29T13:15:09.087" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2259" PostTypeId="1" CreationDate="2014-09-29T17:07:12.270" Score="2" ViewCount="755" Body="&lt;p&gt;I know it's been marked as a duplicate (although it's not exactly the same as &quot;We're no strangers to code golf&quot;), but what warrants 13 downvotes on the question? There have been worse questions asked on this site with far less.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question in question can be found &lt;a href=&quot;https://codegolf.stackexchange.com/questions/38295/the-bonbon-song&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="25274" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-09-29T17:45:41.057" Title="Why does the Bonbon song question have so many downvotes?" Tags="|discussion|" AnswerCount="2" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="2260" PostTypeId="2" ParentId="2259" CreationDate="2014-09-29T17:09:26.013" Score="17" Body="&lt;p&gt;Because it's &lt;strong&gt;boooorring&lt;/strong&gt;, that's why.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-09-29T17:09:26.013" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2261" PostTypeId="2" ParentId="2259" CreationDate="2014-09-29T17:45:41.057" Score="13" Body="&lt;p&gt;The question has no interesting twists or requirements. All it is is a variant of Ninety Nine Bottles of Beer on the Wall which has been golfed to death.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the numbers were in some kind of special pattern or something it might have gained upvotes but as it stands, it's an age-old programming puzzle requiring only a for loop.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Basically, the challenge is too easy and has been done many times before.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2014-09-29T17:45:41.057" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2263" PostTypeId="1" AcceptedAnswerId="2265" CreationDate="2014-09-30T00:48:27.393" Score="3" ViewCount="134" Body="&lt;p&gt;This might be better for &lt;a href=&quot;https://meta.stackexchange.com/&quot;&gt;https://meta.stackexchange.com/&lt;/a&gt; but someone here might know.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For my question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37255/musical-quines-on-an-ascii-piano&quot;&gt;Musical Quines on an ASCII Piano&lt;/a&gt; I'm trying to award my bounty to this answer: &lt;a href=&quot;https://codegolf.stackexchange.com/a/38224/26997&quot;&gt;https://codegolf.stackexchange.com/a/38224/26997&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I keep clicking the red +300 next to the answer and an alert pops up saying 'Are your sure...?', but when I click 'Yes' nothing happens. The bounty hasn't closed and has not been awarded.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does anyone know what's going on? Am I missing some rule on bounty awarding?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The bounty closes in 4 hours. I'm using the latest Chrome if that helps.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2014-09-30T20:57:42.507" Title="Why can't I award my bounty?" Tags="|support|bug|status-completed|bounty|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2265" PostTypeId="2" ParentId="2263" CreationDate="2014-09-30T09:49:53.723" Score="6" Body="&lt;p&gt;Sorry about that, fixed now. Fortunately you still have ample time to answer the bounty (there's a grace period of 24 hours before the bounty is automatically closed).&lt;/p&gt;&#xA;" OwnerUserId="160" LastActivityDate="2014-09-30T09:49:53.723" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2269" PostTypeId="1" AcceptedAnswerId="2270" CreationDate="2014-10-01T06:08:46.760" Score="2" ViewCount="65" Body="&lt;p&gt;Why is there a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle&lt;/a&gt; tag? Surely every problem posted on this site is puzzle meaning that it could be applied to everything..&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The same applies to the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt; tag.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2014-10-01T07:10:40.640" Title="What's the point of a puzzle tag?" Tags="|discussion|tags|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2270" PostTypeId="2" ParentId="2269" CreationDate="2014-10-01T07:10:40.640" Score="2" Body="&lt;p&gt;The puzzle tag is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1588/194&quot;&gt;on the way out&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The programming puzzle tag has quite a narrow scope. Read its tag wiki.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2014-10-01T07:10:40.640" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2271" PostTypeId="1" CreationDate="2014-10-01T07:26:06.680" Score="10" ViewCount="167" Body="&lt;p&gt;The tag wiki for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;algorithm&lt;/a&gt; consists of a summary:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This challenge is intended to be solved by using, creating, or resolving some processing algorithm.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;and a detailed explanation:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This challenge involves &lt;a href=&quot;http://en.wikipedia.org/wiki/Algorithm&quot; rel=&quot;nofollow noreferrer&quot;&gt;algorithms&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;At first glance this seems to be about as useful as tagging questions &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming&lt;/a&gt;. One can just about make a case that questions which can be answered by a program consisting of a single literal don't deserve the tag, but we have more than enough of those questions already.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;algorithm&lt;/a&gt; serve any purpose?&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="3808" LastEditDate="2014-10-08T21:41:21.447" LastActivityDate="2014-10-08T21:57:24.510" Title="Does [tag:algorithm] serve any purpose?" Tags="|discussion|status-completed|tags|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2272" PostTypeId="2" ParentId="2271" CreationDate="2014-10-01T07:26:50.807" Score="11" Body="&lt;p&gt;No, it's completely pointless, but to avoid manually retagging and bumping 139 questions we should ask the mods to nuke it.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-10-01T07:26:50.807" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2273" PostTypeId="2" ParentId="202" CreationDate="2014-10-01T13:24:10.313" Score="2" Body="&lt;p&gt;&lt;strong&gt;Burlesque&lt;/strong&gt; has on online shell &lt;a href=&quot;http://cheap.int-e.eu/~burlesque/burlesque.cgi&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;&#xA;The interpreter can also be downloaded on the official &lt;a href=&quot;http://mroman.ch/burlesque&quot; rel=&quot;nofollow noreferrer&quot;&gt;webpage&lt;/a&gt; and installed locally. &lt;/p&gt;&#xA;" OwnerUserId="5429" LastEditorUserId="5429" LastEditDate="2018-11-15T12:15:34.677" LastActivityDate="2018-11-15T12:15:34.677" CommentCount="0" CommunityOwnedDate="2014-10-01T13:24:10.313" ContentLicense="CC BY-SA 4.0" />
  <row Id="2274" PostTypeId="1" AcceptedAnswerId="2275" CreationDate="2014-10-01T15:17:28.100" Score="2" ViewCount="111" Body="&lt;p&gt;I've got a bit of obfuscated javascript, and I'd like to find out what it does. I could read up on obfuscating in javascript, or I could ask some people who know their stuff.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Where would I post a question like this? It's not a code-golf question per se, but I think it's far more suited to find capable answerers on codegolf.stackexchange than on stackoverflow.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It was flagged as malware by a hoster which spiked my interest, so it might spike yours too. If anybody's interested, check revision history &lt;strong&gt;at your own risk&lt;/strong&gt;.&lt;/p&gt;&#xA;" OwnerUserId="27030" LastEditorUserId="194" LastEditDate="2014-10-01T15:33:17.160" LastActivityDate="2014-10-01T18:29:06.150" Title="Identifying what golfed code does?" Tags="|discussion|new-genre|testing|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2275" PostTypeId="2" ParentId="2274" CreationDate="2014-10-01T16:55:28.343" Score="1" Body="&lt;p&gt;I'm not sure that this is really a good fit for any site on the StackExchange network. It definitely doesn't fit here. The two closest fits are probably StackOverflow and Security, but I don't think either of them would want it either.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(FWIW you really don't need to do much reading at all to decipher your particular question. &lt;a href=&quot;https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/replace&quot; rel=&quot;nofollow&quot;&gt;String.prototype.replace&lt;/a&gt; is all you need for it to make sense).&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-10-01T16:55:28.343" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2276" PostTypeId="2" ParentId="2274" CreationDate="2014-10-01T16:55:39.160" Score="1" Body="&lt;p&gt;This question would be much better suited for Super User or Stack Overflow than for Code Golf.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Deobfuscating the code is trivial: Just replace &lt;code&gt;document.body.appendChild&lt;/code&gt; with &lt;code&gt;return&lt;/code&gt; and execute the function. (To be on the safe side, disconnect from the internet first.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This shows that the code injects the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;script type=&quot;text/javascript&quot; src=&quot;http://URL-ELIDED-TO-AVOID-TRIGGERING-ANTIVIRUS/&quot; defer=&quot;defer&quot; id=&quot;Cbucwozzvh0t&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The hostname doesn't resolve to an IP address, so &amp;ndash; at least for now &amp;ndash; the code won't be able to do any damage.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="194" LastEditDate="2014-10-01T18:29:06.150" LastActivityDate="2014-10-01T18:29:06.150" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2277" PostTypeId="1" AcceptedAnswerId="2279" CreationDate="2014-10-01T18:15:01.173" Score="7" ViewCount="120" Body="&lt;p&gt;I've noticed today that &lt;strong&gt;some of our badges have names and their description in Portuguese&lt;/strong&gt;. This isn't affecting &lt;a href=&quot;http://stackoverflow.com&quot;&gt;SO&lt;/a&gt; or &lt;a href=&quot;http://worldbuilding.stackexchange.com&quot;&gt;WorldBuilding&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am not in Spain/Portugal/Brazil; I am in the United Kingdom and my language is set to English (UK).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This only affects badges on the main site, not on Meta.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Affected Badges&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The following BRONZE and SILVER types of badges are affected:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;question score badges (&lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/46/nice-question&quot;&gt;Nice Question&lt;/a&gt;/&lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/41/good-question&quot;&gt;Good Question&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;question views badges (&lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/48/popular-question&quot;&gt;Popular Question&lt;/a&gt;/&lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/47/notable-question&quot;&gt;Notable Question&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;answer score badges (&lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/45/nice-answer&quot;&gt;Nice Answer&lt;/a&gt;/&lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/39/good-answer&quot;&gt;Good Answer&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Also, the following other badges, gold and silver, are affected:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/49/populist&quot;&gt;Populist&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/23/fanatic&quot;&gt;Fanatic&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/58/sportsmanship&quot;&gt;Sportsmanship&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Screenshots&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;From the badge list:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/x8Dc6.png&quot; alt=&quot;Portuguese labels for question score/views badges&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/badges&quot;&gt;A list of all badges can be found here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerDisplayName="user16402" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-10-01T22:17:03.167" Title="Why are some of our badges in Portuguese?" Tags="|bug|status-completed|badges|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="2279" PostTypeId="2" ParentId="2277" CreationDate="2014-10-01T22:16:55.757" Score="5" Body="&lt;p&gt;Fixed in build &lt;code&gt;2014.10.1.1906&lt;/code&gt;. &lt;/p&gt;&#xA;" OwnerUserId="207" LastActivityDate="2014-10-01T22:16:55.757" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2280" PostTypeId="1" CreationDate="2014-10-02T03:55:44.917" Score="9" ViewCount="527" Body="&lt;p&gt;An awkward question comes up in code golf specs as to whether answer code is to be judged as running on a theoretical machine, an actual one with finite precision and memory, or somewhere in between. For example, see feersum's comments on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/38425/find-the-simplest-value-between-two-values&quot;&gt;Find the simplest value between two values&lt;/a&gt; that two posted answers arguably fail for large values due to limits of float representation. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For my question, I edited the spec afterwards to try to handwave away such limits, but I'd like to ask the community opinion on how and if to do this. It would also be nice to have a general agreement or standard options to avoid disagreements and avoid fiddly boilerplate in specs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What are your thoughts on:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should questions specify bounds and precisions for inputs?&lt;/li&gt;&#xA;&lt;li&gt;Can and should questions handwave-away overflow and precision issues?&lt;/li&gt;&#xA;&lt;li&gt;Is it OK to submit answers that &quot;eventually&quot; give the answer, like one that loops through all &lt;code&gt;2^64&lt;/code&gt; machine-representable integers regardless of input size?&lt;/li&gt;&#xA;&lt;li&gt;Should answers have to handle extreme cases like inputs 1 away from overflow?&lt;/li&gt;&#xA;&lt;li&gt;Are answers responsible for machine-precision failures like &lt;code&gt;21.0/7.0&amp;gt;3.0&lt;/code&gt;?&lt;/li&gt;&#xA;&lt;li&gt;What about stack-overflows for recursive code without tail-recursion?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2017-11-09T20:27:25.100" Title="Rulings on machine limits" Tags="|discussion|" AnswerCount="4" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2281" PostTypeId="2" ParentId="2140" CreationDate="2014-10-02T09:51:35.683" Score="2" Body="&lt;h1&gt;Orbital Mechanics [help wanted] &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/3d&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;3d&amp;#39;&quot; rel=&quot;tag&quot;&gt;3d&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/mechanics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;mechanics&amp;#39;&quot; rel=&quot;tag&quot;&gt;mechanics&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I need help specifying what input/output is required - if you have a suggestion for what the input/output format of the ephemeris should be, please post in the comments&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;How hard can Rocket Science be, anyway?&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Storyline taken from PhiNotPi's challenges linked below)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are still the head programmer on the ill-fated U.S.S. StackExchange. You have guided it through &lt;a href=&quot;https://codegolf.stackexchange.com/questions/5511/code-golf-what-is-the-spaceships-fate-ascii-art-version&quot;&gt;the ASCII art solar system&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/5520/code-golf-what-is-the-spaceships-fate-floating-point-version&quot;&gt;the floating point cluster&lt;/a&gt;. Now, on another mission, the computer has crashed, and can't operate at full power. You need to make calculations of your orbit in order to plot a safe course. However, due to the limited free DEEEPRAROM* of the spaceship, you must write your program in as few characters as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;*Dynamically Executable Electronically Erasable Programmable Random Access Read Only Memory&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A &lt;a href=&quot;http://en.wikipedia.org/wiki/Orbital_elements&quot; rel=&quot;nofollow noreferrer&quot;&gt;description of your orbit&lt;/a&gt; at the moment of your burn, and what kind of orbit it is.&lt;/li&gt;&#xA;&lt;li&gt;The gravitational field strength of your planet. Assume that it is spherical, and that no other effects change your orbit (gravitational perturbations of moons, atmospheric drag).&lt;/li&gt;&#xA;&lt;li&gt;A direction that the burn will be carried out in&lt;/li&gt;&#xA;&lt;li&gt;The delta-v of the burn&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;[More details coming soon]&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your ephemeris after the burn is carried out, in the same format as the input. Assume that the burn is instant.&lt;/p&gt;&#xA;" OwnerDisplayName="user16402" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.893" LastActivityDate="2014-10-21T15:50:16.563" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2282" PostTypeId="2" ParentId="2280" CreationDate="2014-10-02T15:52:45.453" Score="10" Body="&lt;p&gt;I’d say that the asker is free to set (objective) rules and limits as they like. If any issues like overflow or precision are particularly relevant to the question, it would be good to specify what’s acceptable. Otherwise, I think it’s fine to ignore them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regardless, the solution should always produce the correct output for all test cases. As &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/295&quot;&gt;mentioned here&lt;/a&gt;, you shouldn’t post the answer until &lt;em&gt;after&lt;/em&gt; it has successfully completed these. This is a nice way to weed out ridiculous or unverifiable answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I think we should be lenient with extreme cases and slow solutions. There is often a tradeoff between length and efficiency when it comes to code golf, and every solution, language and system will have its limits (especially some of the more esoteric languages). So we shouldn’t rule out the clever recursive solution that has memory limitations, or the super-short FizzBuzz answer that overflows after 2^32, et cetera.&lt;/p&gt;&#xA;" OwnerUserId="4020" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2014-10-02T15:52:45.453" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2284" PostTypeId="1" CreationDate="2014-10-02T21:39:04.260" Score="1" ViewCount="117" Body="&lt;p&gt;I posted an answer, and found some bugs, so I removed a lot of the code and replaced it with a generic &quot;#TODO: ...&quot; in the grace period.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Was then deleted by doorknob.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So when is it now ok to have a &quot;WIP&quot; answer?&lt;/p&gt;&#xA;" OwnerUserId="7789" LastActivityDate="2014-10-03T06:02:26.357" Title="Don't Post WIP?" Tags="|discussion|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2285" PostTypeId="2" ParentId="2284" CreationDate="2014-10-02T21:50:52.507" Score="5" Body="&lt;p&gt;If you realise that your answer is completely borked and you need to start from scratch, delete the answer yourself. Then once you've fixed it you can edit and undelete. There's no benefit to anyone to keep an &quot;answer&quot; which doesn't do anything except validate the number of arguments.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-10-02T21:50:52.507" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="2286" PostTypeId="2" ParentId="2284" CreationDate="2014-10-02T22:21:11.573" Score="7" Body="&lt;p&gt;You forgot to mention that the entirety of your answer was:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h2&gt;Tcl (WIP)&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;if {[llength $argv] != 3} {&#xA;    puts stderr &quot;Usage $argv0 prob mut periods&quot;&#xA;    exit 1&#xA;}&#xA;# TODO... implement this stuff&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;Satisfies by now only the&lt;/p&gt;&#xA;  &#xA;  &lt;blockquote&gt;&#xA;    &lt;p&gt;The user must input three variables using argv&lt;/p&gt;&#xA;  &lt;/blockquote&gt;&#xA;  &#xA;  &lt;p&gt;rule.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Should produce the correct result for your test.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'm not sure this even qualifies as a W, much less a WIP. That has absolutely nothing to do with the challenge. Please elaborate on how you think this is an answer, because I'm not seeing it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's debatable whether WIP answers are okay, but (I hope!) we can all agree that &lt;code&gt;txt = input(); #TODO&lt;/code&gt; is far from a proper answer.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-10-02T22:21:11.573" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2287" PostTypeId="2" ParentId="2284" CreationDate="2014-10-03T06:02:26.357" Score="0" Body="&lt;p&gt;I think that in most cases &lt;strong&gt;WIP&lt;/strong&gt; is unnecessary. There's nothing that's going to taken so why reserve a place?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The only reason I could think of that a WIP could be posted would be with a King of the Hill where you want to reserve a really cool name that you thought up.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, with the program you posted, there was &lt;em&gt;nothing&lt;/em&gt; of use. It may have well been blank. An acceptable WIP would be one that had some relevant code but still had some to go, or one that was complete but you were just bugfixing it.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2014-10-03T06:02:26.357" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2288" PostTypeId="2" ParentId="2233" CreationDate="2014-10-03T13:10:01.320" Score="-6" Body="&lt;p&gt;It happens, sometimes people blindly vote to close a question as duplicate because they are too lazy to carefully read the question or they simply act out of frustration. All you can do is just delete the question and search for an answer in another Q&amp;amp;A community. Re-posting the question is outright bad, while editing it is usually useless.&lt;/p&gt;&#xA;" OwnerUserId="6549" LastActivityDate="2014-10-03T13:10:01.320" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="2289" PostTypeId="2" ParentId="2280" CreationDate="2014-10-03T13:59:43.373" Score="7" Body="&lt;p&gt;All of your questions seem to me like they're pretty much asking the same thing: &quot;A computers can screw up, even if you programmed it correctly, because there are limitations on what you can do that stem from how the technology works. How (and should) we account for this?&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This answer is one suggestion that I think applies to every question you asked except 4. I'll answer that one separately. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Unless the question specifies otherwise, golfers should be allowed to assume exactly one of the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Their machine is a real, physical computer that runs code.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Their machine is theoretical. It lacks limitations of a real computer like stack overflows or lost precision. It runs your code flawlessly, even if no real computer in the universe ever could. It also runs it instantly.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Write a program that works by abusing integer overflows? Great! That's the first option.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program that works by assuming that integers will never overflow, you can recurse as deep as you like, and precision is infinite? Great! That's the second.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are so many great programs that have been written, but never run to completion, because the technology holds us back. At the same time, restrictions breed creativity, and great programs have been written abusing technological failure. I believe this proposal would allow both kinds of program to live in harmony on this site.&lt;/p&gt;&#xA;" OwnerUserId="14509" LastActivityDate="2014-10-03T13:59:43.373" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2290" PostTypeId="2" ParentId="2280" CreationDate="2014-10-03T14:18:27.157" Score="-5" Body="&lt;p&gt;I'm just addressing question 4 (and to a lesser extent, 1) here. I gave my opinion about the others in my other answer.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Should answers have to handle extreme cases like inputs 1 away from overflow?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I don't think so. But how do we define &amp;quot;extreme&amp;quot;? That's exactly the issue. We can't exactly have rules about objective questions if we have the word &amp;quot;extreme&amp;quot; floating around.&lt;/p&gt;&#xA;&lt;p&gt;If a question specifically includes input boundaries then your program must work for the every specified input. Note that saying &amp;quot;an integer&amp;quot; doesn't count as boundaries. It might technically mean &lt;code&gt;-2^31 &amp;lt; n &amp;lt; 2^31-1&lt;/code&gt; but that's usually not what people mean when they say it. If those are the bounds you want answers to work for, specifically say it.&lt;/p&gt;&#xA;&lt;p&gt;If a question does not include boundaries, things get tricky. Here's my proposal. I think we, as a community, should decide on boundaries to default to for different archetypes of problems. It doesn't need to be comprehensive, but over time it could grow into something that could be relied on when the OP doesn't supply limits.&lt;/p&gt;&#xA;&lt;p&gt;For example, something like this:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Problem Type:&lt;/strong&gt; One integer input &lt;code&gt;n&lt;/code&gt;. Guaranteed non-negative. More computationally intensive as &lt;code&gt;n&lt;/code&gt; increases.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Default Boundaries:&lt;/strong&gt; &lt;code&gt;0 &amp;lt; n &amp;lt; 21474&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Or this:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Problem Type:&lt;/strong&gt; Some number &lt;code&gt;n&lt;/code&gt; of input strings.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Default Boundaries:&lt;/strong&gt; &lt;code&gt;1 &amp;lt; n &amp;lt; 10&lt;/code&gt;, each string's length &amp;lt; 15&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;At the moment this is just an idea, I haven't even really fleshed it out. But does it seem feasible?&lt;/p&gt;&#xA;" OwnerUserId="14509" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-10-03T14:18:27.157" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2291" PostTypeId="2" ParentId="2140" CreationDate="2014-10-03T17:47:16.137" Score="0" Body="&lt;h2&gt;Translator to Minimize the Number of Characters&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;With code golf you are attempting to minimize the number of characters or bytes.  The languages are, however, all just ASCII characters.  While I do not want to see this in other code golf challenges, can you use more exotic characters to do the job?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;CJam, for example, only uses ASCII characters in its code but many other characters can be placed into the compiler as a strings. I wrote a simple translator to test this out which can be coverted to:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;㉕ァײோ¸༘ݩײ౲ᖒⲫ㶚ቲ㑼ᇦ㰌⧑༘ઃ௉ⲫ௔ྭഞࠗ㒍⾺&lt;/code&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;While this is intentionally not an acceptable answer for various reasons, it shows the range of possible characters the interpreter can identify. Please note unusual things that happend as you attempt to highlight the text.  &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Choose an online interpreter such as &lt;a href=&quot;http://ideone.com/&quot; rel=&quot;nofollow&quot;&gt;Ideone&lt;/a&gt;, &lt;a href=&quot;http://cjam.aditsu.net/&quot; rel=&quot;nofollow&quot;&gt;CJam&lt;/a&gt;, or &lt;a href=&quot;http://golfscript.apphb.com/&quot; rel=&quot;nofollow&quot;&gt;Golfscript&lt;/a&gt; and a language which can be run on that interpreter.  This is so I know I am using pretty much the same resources as you are when I run your answer.&lt;/li&gt;&#xA;&lt;li&gt;Create a translator in your stated language which accepts an &quot;original&quot; input code from the same language. It then outputs a string which can be pasted in your answer or in a comment on this site.&lt;/li&gt;&#xA;&lt;li&gt;Create a second translator into which the previous output string can easily be incorporated.  When this combined string and translator are run, it will run the original input code.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Please note:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The original input code to score your answer will be the same for any&#xA;answers of the same language.&lt;/li&gt;&#xA;&lt;li&gt;This code for scoring will be subject to change and the translator must work for any code of that language the interpreter accepts. (exceptions listed below).&lt;/li&gt;&#xA;&lt;li&gt;This code for scoring will only contain ASCII characters and I will attempt to take it from existing answers on this site.  At request it can exclude line breaks or specific characters for an additional 5% to your score AT MY DISCRESION (for instance Java code needs to be able to have spaces in it, I can't avoid that).&lt;/li&gt;&#xA;&lt;li&gt;The input code for scoring will be roughly 500 characters long. However, you transltors need to work regardless of the length of the input code so you can't take advantage of the fact that the code is even/odd.  It does not need to work for null input.&lt;/li&gt;&#xA;&lt;li&gt;Any errors or anything malicious will obviously be disqualified.&lt;/li&gt;&#xA;&lt;li&gt;The compressed code must be copy/pastable to codegolf SE.&lt;/li&gt;&#xA;&lt;li&gt;When running the code from its translated form, the code must be able to accept input.  This input is not going to be part of the code to be translated.&lt;/li&gt;&#xA;&lt;li&gt;Any null case which does not compact the original code in any way is disqualified.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Minimum score wins (surprise surprise)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Score is the number of characters you need to run the original code minus the number of characters in the original input code plus 500 (combined with any modifiers).&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;The length of the original translator does not matter.&lt;/li&gt;&#xA;&lt;li&gt;5% is added to your score for each character/symbol your language often makes use of but your translators cannot handle.  I can disqualify for this if I believe that the missing character too severly cripples the programmer.&lt;/li&gt;&#xA;&lt;li&gt;5% is removed from your score if your two translators are the same piece of code (aka the translation is reversible).&lt;/li&gt;&#xA;&lt;li&gt;5% is removed from your score if all characters in the compressed output are visible (no invisible ASCII characters). White space (spaces, tabs, line breaks) are visible but ASCII character 19 (for instance) is not.&lt;/li&gt;&#xA;&lt;li&gt;3% is removed from your score if all characters are visually distinguishible (no two characters look the same but are read differently by the interpreter). The more obvious this is the better.&lt;/li&gt;&#xA;&lt;li&gt;10% if anyone provides an acceptable example input code where the score without modifiers would be longer than the original input code.  This would mean the translator effectively did not compress the input code. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="29108" LastActivityDate="2014-10-03T17:47:16.137" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2294" PostTypeId="2" ParentId="2140" CreationDate="2014-10-05T18:00:31.270" Score="0" Body="&lt;h1&gt;Build a Version Control System [WIP] &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Git, SVN, Mercurial and Bazaar are just too bloated for you. You want something simple. Something as short as possible.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program will be invoked every time an operation needs to be made to the repository. &lt;/li&gt;&#xA;&lt;li&gt;Your program must take commands from command-line arguments.&lt;/li&gt;&#xA;&lt;li&gt;The implementation of how the program stores its own data does not matter. Input and output format do.&lt;/li&gt;&#xA;&lt;li&gt;Give your version control program a name and version numbering (so I can keep track of when you update it).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Repositories&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A &quot;repository&quot; is a directory with files and directories in it, as well as (a) special file(s) that store settings and information for the repository. These special files may not be included in version control. All other files in that directory should be included in version control.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Features&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;'init' command - sets up a repository in the working directory&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;[BONUS 20pts] If a repository already exists in the working directory, erase or reset it first&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;'destroy' command - removes all of your special version control files from the repository. If you are not in the root directory of a repository, keep moving up one level until you find VCS files. If you reach the top level of the filesystem without finding your VCS files, don't do anything.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;[BONUS 15pts] Exit with status 1 if no VCS files are found&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your score is the length of your code in bytes, minus all bonuses. Lowest score wins.&lt;/p&gt;&#xA;" OwnerDisplayName="user16402" LastEditorDisplayName="user16402" LastEditDate="2014-10-06T09:45:28.240" LastActivityDate="2014-10-06T09:45:28.240" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="2295" PostTypeId="2" ParentId="202" CreationDate="2014-10-05T20:35:10.433" Score="4" Body="&lt;h1&gt;Virtualization&lt;/h1&gt;&#xA;&lt;p&gt;Perhaps obvious, but might be helpful.&lt;/p&gt;&#xA;&lt;p&gt;Most languages have compilers/interpreters/emulators available for free download (google is your friend).  What may be harder is that those compilers/interpreters/emulators may only be available for a limited set of common OSes, for example bash on *nix or powershell on windows.  While many of us will have what I consider the three common OSes (Linux, OSX, Windows) available at all times, this is not necessarily a given.&lt;/p&gt;&#xA;&lt;p&gt;One way around this is virtualization.  These days it is a simple matter to install a virtualization environment on your workstation of choice, and then install arbitrary OSes in VMs.&lt;/p&gt;&#xA;&lt;p&gt;Common virtualization environments (some with free downloads) include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.vmware.com/products/player&quot; rel=&quot;nofollow noreferrer&quot;&gt;VMWare Player (or fusion on OSX)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.virtualbox.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Virtualbox&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://wiki.qemu.org/Main_Page&quot; rel=&quot;nofollow noreferrer&quot;&gt;QEMU&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;several others&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Then you'll need to find the OS to run in the VM.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Linux is very easy to find.  &lt;a href=&quot;http://www.ubuntu.com/download&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ubuntu&lt;/a&gt; is often recommended for non-Linux users and IMO has a wealth of support information online&lt;/li&gt;&#xA;&lt;li&gt;Windows VMs for testing &lt;a href=&quot;https://www.modern.ie/en-us/virtualization-tools&quot; rel=&quot;nofollow noreferrer&quot;&gt;are available here&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;OSX.  Hmm, ok you'll need Apple hardware for that to comply with the EULA (even though recent OSX &lt;a href=&quot;http://kb.vmware.com/selfservice/microsites/search.do?language=en_US&amp;amp;cmd=displayKC&amp;amp;externalId=2056603&quot; rel=&quot;nofollow noreferrer&quot;&gt;can be installed in a VM&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-10-05T20:35:10.433" CommentCount="0" CommunityOwnedDate="2014-10-05T20:35:10.433" ContentLicense="CC BY-SA 3.0" />
  <row Id="2297" PostTypeId="1" AcceptedAnswerId="2350" CreationDate="2014-10-06T19:48:35.767" Score="9" ViewCount="330" Body="&lt;p&gt;This is a simple question, perhaps better asked elsewhere, but I'm quite curious:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Besides &lt;a href=&quot;https://puzzling.stackexchange.com/&quot;&gt;Puzzling.SE&lt;/a&gt;, is PPCG the only SE site whose questions are &lt;em&gt;challenges&lt;/em&gt; rather than &lt;em&gt;appeals&lt;/em&gt;?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pretty much every other SE site has questions that are asked because the questioner is honestly confused or uncertain or at least curious about something. But here at PPCG, answers do not really answer anything, they just follow a spec to produce something that was already expected (though often in outstanding ways).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've looked at many of the other &lt;a href=&quot;http://stackexchange.com/sites&quot;&gt;SE sites&lt;/a&gt;, but not all, and I'm not a frequenter on any of them but PPCG. Are there corners of other SE sites where challenges are the norm rather than appeals for help?&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-04-13T12:50:45.800" LastActivityDate="2014-10-19T01:37:53.810" Title="Are we the only SE with challenges?" Tags="|discussion|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="2298" PostTypeId="1" AcceptedAnswerId="2299" CreationDate="2014-10-07T00:25:37.487" Score="5" ViewCount="168" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/465/3808&quot;&gt;The question in question.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What should we do with it? It's clearly not a &quot;proper&quot; question for the Stack Exchange network (highly opinion-based and a &quot;big list&quot;), but it's CW and nobody's had a problem with it so far.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We could...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Close it (primarily opinion based, too broad, etc.)&lt;/li&gt;&#xA;&lt;li&gt;Delete it (possible, but not necessary)&lt;/li&gt;&#xA;&lt;li&gt;Put a historical lock on it (the small amount of content there probably isn't worth a lock at this point)&lt;/li&gt;&#xA;&lt;li&gt;Leave it as is (probably not the best idea, since people will think these discussion forum-y type questions are perfectly fine)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-10-14T20:58:20.810" Title="What to do with the &quot;favorite code golf&quot; question?" Tags="|discussion|status-completed|specific-question|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2299" PostTypeId="2" ParentId="2298" CreationDate="2014-10-07T00:30:26.380" Score="9" Body="&lt;p&gt;Close it.  It's clearly opinion-based and out of scope for this site, as per the help center.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;Best-of&quot; lists might work better on a blog.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I understand that this question was asked back in the wild-west days of PPCG, but I think these days, the community has created/converged upon a much clearer idea of what this site is about.  This is a historical artifact, and I do believe in the preservation of historical artifacts if there are important things to be learned from them, but I don't think there's a whole lot to learned from this question.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="11259" LastEditDate="2014-10-07T00:37:16.077" LastActivityDate="2014-10-07T00:37:16.077" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2300" PostTypeId="1" AcceptedAnswerId="2301" CreationDate="2014-10-07T04:38:09.163" Score="7" ViewCount="234" Body="&lt;p&gt;My bounty on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/38226/coating-every-pancake&quot;&gt;Coating Every Pancake&lt;/a&gt; expires shortly but no one has answered the question in the &lt;a href=&quot;http://esolangs.org/wiki/Pancake_Stack&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pancake Stack language&lt;/a&gt; which was the goal of the bounty.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should I just let the bounty run out and award it to the best existing answer? Can I request an extension? Are there other options?&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2014-10-07T04:48:42.393" Title="Unsatisfied Bounty" Tags="|discussion|bounty|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="2301" PostTypeId="2" ParentId="2300" CreationDate="2014-10-07T04:48:42.393" Score="6" Body="&lt;p&gt;See &lt;a href=&quot;https://meta.stackexchange.com/q/16065/13&quot;&gt;How does the bounty system work?&lt;/a&gt; for more information. To answer your specifics:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bounties cannot be extended.&lt;/li&gt;&#xA;&lt;li&gt;You can award the bounty to any answer that you didn't write yourself.&lt;/li&gt;&#xA;&lt;li&gt;If you don't award the bounty, and there is an answer written &lt;em&gt;after&lt;/em&gt; the bounty started that has a score of 2 or more, that answer is auto-awarded half the bounty.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If there is more than one such answer, then the answer with the highest score is auto-awarded, with ties broken by earliest posting date.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-10-07T04:48:42.393" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2302" PostTypeId="2" ParentId="2140" CreationDate="2014-10-07T17:05:34.087" Score="1" Body="&lt;h1&gt;Play Your Cards Right&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Game Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Play your card right is a game played with a pack of 52 cards (no jokers). At the start the deck is shuffled and the dealer will lay a single card on the table. The player  then has to decide if the next card is higher or lower than the card on the table (note that ace is low here).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The dealer then lays another card on the table. If the card is the same as your guess (higher or lower), then you continue the game. If the card is equal to the last or not the same as your guess, all of the cards on the table are put into a separate pile and the game starts again (the cards in the separate pile are completely discounted).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You lose the game when the deck is emptied. You win the game if you get six cards on the table.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given the last card to be laid on the table you must make a guess as to whether the next card will be higher or lower.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specifics&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The necessary information will be supplied via argv:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the argument is &lt;code&gt;newGame&lt;/code&gt; then wipe all data stored about the previous game&lt;/li&gt;&#xA;&lt;li&gt;If the argument is &lt;code&gt;clearTable&lt;/code&gt; then clear the table and move all cards to the separate pile&lt;/li&gt;&#xA;&lt;li&gt;If the argument is not detailed above then it is a card name: 1 to 10 or J,Q,K,A&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You may store information. I will be testing this on Ubuntu 12.04.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winning&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The shortest code wins. Please note that these have to be optimal solutions (winning most of the games played by the following controller)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Controller coming tomorrow (8/10)&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="30525" LastEditDate="2014-10-07T20:30:06.637" LastActivityDate="2014-10-07T20:30:06.637" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2304" PostTypeId="2" ParentId="1475" CreationDate="2014-10-07T21:22:02.213" Score="11" Body="&lt;h3&gt;Graph theory&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The basics have been done (sometimes more than once), but some advanced stuff is still up for grabs:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Fractional graph-theoretic properties (e.g. fractional chromatic number)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; vertex-connectivity.&lt;/li&gt;&#xA;&lt;li&gt;...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Ones which have been done already:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Shortest path / reachability (too many to mention)&lt;/li&gt;&#xA;&lt;li&gt;Connected components: &lt;a href=&quot;https://codegolf.stackexchange.com/q/42595/194&quot;&gt;3x3 Connected Components&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/q/32015/194&quot;&gt;Are you in the biggest room?&lt;/a&gt;, and others&lt;/li&gt;&#xA;&lt;li&gt;Eulerian path: &lt;a href=&quot;https://codegolf.stackexchange.com/q/128425/194&quot;&gt;Burning Bridges&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Longest_path_problem&quot; rel=&quot;nofollow noreferrer&quot;&gt;Longest path&lt;/a&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/q/44922/194&quot;&gt;Building a long chain of words&lt;/a&gt; (and with constraints: &lt;a href=&quot;https://codegolf.stackexchange.com/q/32762/194&quot;&gt;Racketeer Taxi Driver&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Diameter: &lt;a href=&quot;https://codegolf.stackexchange.com/q/187132/194&quot;&gt;Find the diameter of a word graph&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Travelling salesman: &lt;a href=&quot;https://codegolf.stackexchange.com/q/11310/194&quot;&gt;Alex the Truck Driver&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/q/31898/194&quot;&gt;Travelling Salesman&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/q/67611/194&quot;&gt;Hamilton is coming to town&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Colouring: &lt;a href=&quot;https://codegolf.stackexchange.com/q/40339/194&quot;&gt;Four color theorem&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/q/37709/194&quot;&gt;Find the Chromatic Number&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/q/170671/194&quot;&gt;Graph 5-Coloring&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Edge elimination: &lt;a href=&quot;https://codegolf.stackexchange.com/q/40292/194&quot;&gt;Edge Elimination Number&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Cycle detection: &lt;a href=&quot;https://codegolf.stackexchange.com/q/48284/194&quot;&gt;Infinite Labyrinths&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Counting cycles in graph with out-degree 1: &lt;a href=&quot;https://codegolf.stackexchange.com/q/26578/194&quot;&gt;Count the terminal cycles of a directed graph&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Longest cycle: &lt;a href=&quot;https://codegolf.stackexchange.com/q/107274/194&quot;&gt;Longest Cycle in a Graph&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Topological sort: &lt;a href=&quot;https://codegolf.stackexchange.com/q/6641/194&quot;&gt;City names game&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Clustering coefficient: &lt;a href=&quot;https://codegolf.stackexchange.com/q/6485/194&quot;&gt;Calculate Network Average Clustering Coefficient&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Max flow: &lt;a href=&quot;https://codegolf.stackexchange.com/q/4168/194&quot;&gt;BWInf 2011, question 5: Twin towns&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Min cost flow: &lt;a href=&quot;https://codegolf.stackexchange.com/q/179382/194&quot;&gt;Minimum-cost flow problem&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Planarity testing: &lt;a href=&quot;https://codegolf.stackexchange.com/q/51564/194&quot;&gt;Is My Graph Planar?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Bipartite testing: &lt;a href=&quot;https://codegolf.stackexchange.com/q/148370/194&quot;&gt;Is it bipartite?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Bipartite matching: &lt;a href=&quot;https://codegolf.stackexchange.com/q/147194/194&quot;&gt;Take one to make one&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Maximum matching: &lt;a href=&quot;https://codegolf.stackexchange.com/q/64745/194&quot;&gt;Find maximal matching in divisibility relation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Independent set: &lt;a href=&quot;https://codegolf.stackexchange.com/q/54354/194&quot;&gt;Find the largest independent set in a high-dimensional lattice-like graph&lt;/a&gt; (asks a special case; I think a question asking for IS for general graphs would not be a dupe of this, but would be of maximum clique)&lt;/li&gt;&#xA;&lt;li&gt;Maximum clique: &lt;a href=&quot;https://codegolf.stackexchange.com/q/141053/71420&quot;&gt;Do the NP: find the largest clique&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="194" LastEditorUserId="194" LastEditDate="2019-06-20T07:57:35.807" LastActivityDate="2019-06-20T07:57:35.807" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="2305" PostTypeId="2" ParentId="2140" CreationDate="2014-10-08T11:31:48.660" Score="2" Body="&lt;h2&gt;Count Langford pairings&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;http://en.wikipedia.org/wiki/Langford_pairing&quot; rel=&quot;nofollow noreferrer&quot;&gt;Langford pairing&lt;/a&gt; is a permutation of the numbers &lt;code&gt;1, 1, 2, 2, ..., n, n&lt;/code&gt; such that there is one number between the &lt;code&gt;1&lt;/code&gt;s, two numbers between the &lt;code&gt;2&lt;/code&gt;s, etc. E.g. (with the pairs marked)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+-----------+ +---------------+&#xA;| +-----+   | | +---------+   |&#xA;| |     |   | | |         |   |&#xA;5 2 8 6 2 3 5 7 4 3 6 8 1 4 1 7&#xA;    | |   |       | | | |   |&#xA;    | |   +-------+ | | +---+&#xA;    | +-------------+ |&#xA;    +-----------------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If we reverse a Langford pairing then obviously we get another Langford pairing. The number of &lt;em&gt;distinct&lt;/em&gt; Langford pairings (i.e. modulo this symmetry) for given &lt;code&gt;n&lt;/code&gt; is OEIS sequence &lt;a href=&quot;http://oeis.org/A014552&quot; rel=&quot;nofollow noreferrer&quot;&gt;A014552&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a &lt;strong&gt;program&lt;/strong&gt; which takes &lt;code&gt;n&lt;/code&gt; as either a command-line argument or on stdin and prints the number of distinct Langford pairings for that &lt;code&gt;n&lt;/code&gt;. You may assume that the input given will be a positive integer no greater than 32.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To avoid hard-coding, your program must be capable of calculating the number of Langford pairings for &lt;code&gt;n=32&lt;/code&gt;, optionally modulo a number of your choice which is at least 2&lt;sup&gt;30&lt;/sup&gt;; and the only case splitting permitted for valid input is to split on the value of &lt;code&gt;n % 4&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To avoid brute-forcing, your program must be capable of calculating the number of Langford pairings for &lt;code&gt;n=16&lt;/code&gt; in less than 15 minutes on my reference machine. (TODO). The standard approach is an &lt;a href=&quot;http://www.dialectrix.com/langford/godfrey/method.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;algebraic technique due to Mike Godfrey&lt;/a&gt; and works by evaluating a generating function at &lt;code&gt;{-1,1}^2n&lt;/code&gt;, but variants such as evaluating Godfrey's generating function at &lt;code&gt;{0,1}^2n&lt;/code&gt; and using inclusion-exclusion are also possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The time limit is about twice the time required by my (partially optimised) reference solution, an algebraic approach in Java; a fully optimised approach in C should have a lot of slack. That gives people a trade-off in the symmetries they use, and should allow slow scripting languages to submit valid answers but at a penalty of having to spend more code on handling symmetries than faster languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I'm worried that it might allow trivial modification of answers to &lt;a href=&quot;https://codegolf.stackexchange.com/q/89811/194&quot;&gt;Langford strings&lt;/a&gt; , so I probably need a reference implementation which works by enumeration for comparison.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.653" LastActivityDate="2016-08-15T19:55:25.723" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="2307" PostTypeId="2" ParentId="2271" CreationDate="2014-10-08T21:57:24.510" Score="5" Body="&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Zm85C.png&quot; alt=&quot;Burninated&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But note the 7 &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/untagged&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;untagged&amp;#39;&quot; rel=&quot;tag&quot;&gt;untagged&lt;/a&gt; questions.&lt;/p&gt;&#xA;" OwnerUserId="8534" LastActivityDate="2014-10-08T21:57:24.510" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2311" PostTypeId="2" ParentId="2140" CreationDate="2014-10-10T08:21:00.887" Score="4" Body="&lt;h1&gt;Coloring Book&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a black-and-white raster line drawing (no anti-aliasing, with fully enclosed regions), write a program that will color it in. Something maybe like below, though I'd clean up messy JPGs into clean B&amp;amp;W PNGs to start with:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://wallalay.com/wp-content/uploads/2014/07/Coloring-Books-27.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://wallalay.com/wp-content/uploads/2014/07/Coloring-Books-27.jpg&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Could either be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, to give freedom in create more interesting output (gradients, patterns, how to select &quot;better&quot; colors, other images).  Along the lines of patterns and gradients, I'd opt for simpler stock &quot;prompts&quot;, preferably animals, to show off solutions:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.frontiernet.net/~goofis1/Images/Dinosaurs/SlateBack.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.frontiernet.net/~goofis1/Images/Dinosaurs/SlateBack.jpg&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;...or perhaps &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; if each region has a specified color given by a swatch inside it: so the program would basically need to find-the-color then flood-fill. Sounds boring, I prefer more creativity.&lt;/p&gt;&#xA;" OwnerUserId="176" LastActivityDate="2014-10-10T08:21:00.887" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2320" PostTypeId="2" ParentId="2180" CreationDate="2014-10-13T15:22:21.763" Score="-1" Body="&lt;h1&gt;We should split them by tip&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;More specifically, we should split them into a problem and solution format, like every other Stack Exchange site does.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Benefits&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Consistency with the Stack Exchange format&lt;/li&gt;&#xA;&lt;li&gt;Searchable question titles&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Everyone who has the &lt;em&gt;same&lt;/em&gt; problem will arrive here from Google. Even in beta, we get rated very highly when a question titles matches a search. When the problem is too broad, as our current tips lists are, we become far less searchable.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Incentives for providing &quot;good&quot; questions and answers&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No more community wiki. If you ask a good question, you get rewarded. If you provide an awesome answer, you get rewarded.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;A tip that spans multiple languages could be generalized into a single Q &amp;amp; A&lt;/li&gt;&#xA;&lt;li&gt;Allowance for competing answers&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We currently lack the means for multiple users to compete to provide the &lt;em&gt;best&lt;/em&gt; answer to a question. Maybe one of our tips could be beaten. Maybe some of then are useless in practice. We wouldn't know, because we never asked a practical question.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Consequences&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Problems that are solved different ways in different languages would require a language tag&lt;/li&gt;&#xA;&lt;li&gt;We would have to do something to the current tips questions&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Dissect them? Historical lock them and treat them as not a duplicate of anything? I actually like the latter option.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example Question&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;How do I do X[optional] in language Foo[/optional]? I've tried this, and done that research, but I can't figure it out.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example Answer&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This is how you do X.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="18487" LastActivityDate="2014-10-13T15:22:21.763" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="2323" PostTypeId="1" CreationDate="2014-10-14T08:50:08.287" Score="0" ViewCount="82" Body="&lt;p&gt;I have an idea for a question as shown here &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2322/19894&quot;&gt;https://codegolf.meta.stackexchange.com/a/2322/19894&lt;/a&gt; but it is not really something that has todo with coding, it is more redefine language tokens.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Where should I post this kind of questions? This for example is really fun to do, you could e.g. translate C++ to German or French or even Klingon ^^&lt;/p&gt;&#xA;" OwnerUserId="19894" LastEditorUserId="68942" LastEditDate="2021-06-09T05:45:11.050" LastActivityDate="2021-06-09T05:45:11.050" Title="Where to put non coding challenges?" Tags="|support|asking-questions|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2325" PostTypeId="2" ParentId="2323" CreationDate="2014-10-14T11:52:09.593" Score="4" Body="&lt;p&gt;Sorry, that would be off-topic here. The site is called &lt;em&gt;Programming&lt;/em&gt; Puzzles and Code Golf. If we started accepting things that weren't programming, pretty soon we'd get language challenges and math challenges and cooking challenges and all sorts of off-topic stuff.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Just because something would be really fun to do doesn't mean that makes it any more on-topic. I like playing piano, and other people do too. But that doesn't mean I can post a piano puzzle or something here.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-10-14T11:52:09.593" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2327" PostTypeId="1" CreationDate="2014-10-14T15:39:10.380" Score="1" ViewCount="107" Body="&lt;p&gt;Unlike on other Stack Exchange sites, the execution of an idea really makes a difference on this site. My question is, if an idea for a challenge has been used before, does that make &lt;em&gt;any&lt;/em&gt; other challenge based on the same idea off-topic, or can an idea be re-used if it's implemented in a substantially different way?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I ask because I recently wrote a challenge based on an idea that turned out to have been used before. I didn't realise this until I pasted it into the site, but I decided to post my question anyway because the execution of the idea is very different, and the kind of answers I hope to attract are very different from the answers to the old question. (The new question is really designed to allow quite long answers that catch a lot of special cases, whereas the old one has a scoring system that very strongly favours short answers.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is some (very reasonable) debate in the comments as to whether my question is a duplicate or not. I would like to know what the community thinks, both about this case and about the general question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My new question: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/39837/turn-nouns-into-plurals&quot;&gt;Turn nouns into plurals&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The old question: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4971/pluralize-it&quot;&gt;Pluralize it!​​&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="21034" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-10-14T15:39:10.380" Title="What counts as a duplicate on CodeGolf.SE?" Tags="|discussion|" AnswerCount="0" CommentCount="13" ClosedDate="2014-10-14T21:00:20.383" ContentLicense="CC BY-SA 3.0" />
  <row Id="2328" PostTypeId="1" AcceptedAnswerId="2329" CreationDate="2014-10-14T20:11:25.097" Score="2" ViewCount="61" Body="&lt;p&gt;I've noticed that in several places answers have been greyed out. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2322/19894&quot;&gt;Here's an example&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Nka8Ql.png&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here, it is quite clear that the lower answer is lighter than the upper answer. Does anyone know why this is?&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2014-10-14T23:47:57.447" Title="Greying of answers" Tags="|support|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2329" PostTypeId="2" ParentId="2328" CreationDate="2014-10-14T20:16:26.503" Score="4" Body="&lt;p&gt;Answers of score -3 or lower are greyed out, by design.&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="3" LastEditDate="2014-10-14T23:45:46.860" LastActivityDate="2014-10-14T23:45:46.860" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2330" PostTypeId="1" CreationDate="2014-10-15T11:12:35.893" Score="5" ViewCount="195" Body="&lt;p&gt;On each SE there's an &lt;a href=&quot;https://codegolf.stackexchange.com/unanswered&quot;&gt;&quot;Unanswered&quot; tab&lt;/a&gt; which shows all questions that don't have a positively voted answer. Even if you answer your own question (and it gets an upvote), the question doesn't appear in that tab any more. Now I can see how that makes sense on any other SE, because there an answer is an answer. But I'd say on PPCG 99% of time, a self-answer will be a reference implementation and not an actual competitive submission. Case in point: &lt;a href=&quot;https://codegolf.stackexchange.com/q/39728/8478&quot;&gt;my own recent popularity contest&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, while I usually don't have any hopes that we'll get any custom modifications to our SE instance, would it a) make sense and b) be possible to exclude answers by the OP from the query that selects questions for the Unanswered tab on PPCG?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(As a side note, the same might make sense for the Revival badge.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-12-02T01:29:15.620" Title="Could self-answered questions be &quot;unanswered&quot;?" Tags="|feature-request|status-declined|unanswered-questions|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2334" PostTypeId="1" AcceptedAnswerId="2335" CreationDate="2014-10-16T20:48:35.293" Score="18" ViewCount="590" Body="&lt;p&gt;Just in case you didn't know already, we have a fairly new type of challenge: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I enjoy these challenges very much, but I don't know if the current format (cops post answers, robbers post comments) is optimal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I see the following problems, in descending order of importance:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Comments are limited to 600 characters and have very poor formatting, so a robber has no convenient way of explaining how he &lt;s&gt;killed the cop&lt;/s&gt; broke the submission.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;New users cannot post comments, since they'd need 50 reputation for that. Newbie robbers have no choice but to post answers instead of comments (&lt;a href=&quot;https://codegolf.stackexchange.com/a/36815&quot;&gt;exhibit A&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/39929&quot;&gt;exhibit B&lt;/a&gt;) or just skip the challenge altogether.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The question has to be cluttered with two leaderboards. The comment sections are a mess.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Only cops can earn reputation from upvotes. There's no green checkmark for the best robber.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;So, should we&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&amp;hellip;create separate challenges (one for cops, one for robbers) and keep things nice and separate?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&amp;hellip;let robbers post answers as well? This solves 1, 2 and 4, but the clutter would be even worse.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&amp;hellip;let robbers edit answers, as &lt;a href=&quot;https://codegolf.stackexchange.com/q/37797&quot;&gt;this challenge&lt;/a&gt; did?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&amp;hellip;leave things as the are?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="6917" LastEditDate="2017-07-27T20:16:10.147" LastActivityDate="2017-07-27T20:16:10.147" Title="Where should we put robbers?" Tags="|discussion|policy|asking-questions|cops-and-robbers|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2335" PostTypeId="2" ParentId="2334" CreationDate="2014-10-16T21:13:14.033" Score="11" Body="&lt;h1&gt;Create separate challenges&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'm not saying this is the solution, but we've just talked about this in chat, and I wanted to make a meta post for this anyway. So this answer will act as a collection of pros and cons of this solution and comments and votes will certainly show the communities opinion (please add similar answers for the other options).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This really solves all the problems:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Full-fledged answers with formatting and everything for the robbers.&lt;/li&gt;&#xA;&lt;li&gt;New users can answer.&lt;/li&gt;&#xA;&lt;li&gt;Separate questions for separate leaderboards. Note that the OP would still have to maintain both of them, because answers to the robbers' challenge can invalidate/crack answers from the cops' challenge.&lt;/li&gt;&#xA;&lt;li&gt;Robbers get upvotes and the best robber gets accepted. In fact, we could offer bounties for cracking very hard cop submissions.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;It has one problem though: the robbers' challenge cannot be answered when there are no uncracked cop submissions. I don't know how much of a problem that is, but it should be kept in mind.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another thing I want to mention in this context: the four existing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; challenges were all of the format that every cop submission had to be cracked individually. In theory, this tag could include somewhat different challenges though.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The model challenge for this &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1586/8478&quot;&gt;is this sandbox proposal&lt;/a&gt;. In short, the cops write maze generators and the robbers write maze solvers. Now there's no one-robber-cracks-one-cop-answer system any more. It's more like an asymmetric &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;. This would be ideal for posting separate questions! In this case, solvers can be written before any generators exist (even though they can't be scored yet). And cops (generators) will never be invalidated, they also just get a score, depending on how well the robbers (solvers) perform, which means once the first generator exists an arbitrary amount of robbers can participate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So even if we decide that this model doesn't work for the type of cops-and-robbers challenges we had so far, there are certainly types where we should definitely do this. Whether the problem mentioned above is too critical to &lt;em&gt;always&lt;/em&gt; apply this, is something I'm happy to discuss in the comments.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2014-10-16T21:13:14.033" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2336" PostTypeId="2" ParentId="2330" CreationDate="2014-10-16T23:36:16.487" Score="1" Body="&lt;p&gt;This is kinda crazy. It appears y'all have a custom of providing reference implementations that &lt;em&gt;aren't actually supposed to be seen as &quot;answers&quot;&lt;/em&gt;, but are posted as answers anyway... And you want the system to ignore them. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;That's probably not gonna happen. I really can't think of any other scenario where that behavior makes sense. Heck, I'm not even sure it makes sense here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the implementation is truly just a reference for those answering, if it would be seen as a &lt;em&gt;non-answer&lt;/em&gt; if it were posted by anyone else... Then don't put it in an answer. You could append it to the question, or even post it somewhere else and link to it if it's not really essential to the question either. &lt;/p&gt;&#xA;" OwnerUserId="1144" LastActivityDate="2014-10-16T23:36:16.487" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2337" PostTypeId="2" ParentId="2140" CreationDate="2014-10-17T01:07:33.717" Score="3" Body="&lt;h1&gt;Irreducible Polynomials over a Finite Field&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/abstract-algebra&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;abstract-algebra&amp;#39;&quot; rel=&quot;tag&quot;&gt;abstract-algebra&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polynomials&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polynomials&amp;#39;&quot; rel=&quot;tag&quot;&gt;polynomials&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a polynomial whose coefficients are in a finite field, deduce whether or not it is irreducible, without using any related built-ins (you can use a built-in that represents polynomials, but you cannot use built-ins for factoring or otherwise finding information about the polynomial).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A polynomial in &lt;code&gt;F[x]&lt;/code&gt; (where &lt;code&gt;F&lt;/code&gt; is a field) is considered &lt;a href=&quot;https://en.wikipedia.org/wiki/Irreducible_polynomial&quot; rel=&quot;nofollow noreferrer&quot;&gt;irreducible&lt;/a&gt; if it cannot be factored into the product of non-constant polynomials.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;I/O:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program/function will take two inputs:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a prime number for the order of the Finite Field&lt;/li&gt;&#xA;&lt;li&gt;some representation for the polynomial&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Output a truthy value if the polynomial is irreducible, and a falsy value otherwise.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program &lt;strong&gt;must&lt;/strong&gt; run in a reasonable time for this (i.e. 1 hour is definitely too long):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt; F = 2, f(x) = x^3 + x^2 + x + 1&#xA;false&#xA;&amp;gt;&amp;gt;&amp;gt; F = 5, f(x) = x^4 + 4x^3 + 4x^2 + x&#xA;false&#xA;&amp;gt;&amp;gt;&amp;gt; F = 2, f(x) = x^4 + x + 1&#xA;true&#xA;&amp;gt;&amp;gt;&amp;gt; F = 5, f(x) = x^3 + x + 1&#xA;true&#xA;&amp;gt;&amp;gt;&amp;gt; F = 5, f(x) = x^6 + 2x^4 + 2x^3 + x^2 + 2x + 1&#xA;false&#xA;&amp;gt;&amp;gt;&amp;gt; F = 2, f(x) = x^6 + x^2 + 1&#xA;false&#xA;&amp;gt;&amp;gt;&amp;gt; F = 5, f(x) = 4x^4&#xA;false&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Meta Note:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;These are all really related:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/48037/9498&quot;&gt;Prime polynomials&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/38513/9498&quot;&gt;Factor a polynomial over a finite field or the integers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/69608/9498&quot;&gt;Irreducible polynomials over GF(5)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The first especially. This challenge is very similar to the first, except that the first is for irreducible polynomials over &lt;code&gt;Z&lt;/code&gt; (the integers), whereas this is for irreducible polynomials over finite fields. Although the challenges are similar, I feel this is different enough to warrant a new challenge&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="9498" LastEditDate="2017-06-11T07:12:09.937" LastActivityDate="2017-06-11T07:12:09.937" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="2338" PostTypeId="1" CreationDate="2014-10-17T01:45:05.707" Score="1" ViewCount="57" Body="&lt;p&gt;As you can see, I have 101 rep here. Also, I can't answer &lt;a href=&quot;https://codegolf.stackexchange.com/questions/39752/sing-happy-birthday-to-your-favourite-programming-language?page=1&amp;amp;tab=votes#tab-top&quot;&gt;protected questions&lt;/a&gt; even though they say I only need 10 rep:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Frwgq.png&quot; alt=&quot;a screenshot of it denying my answer&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="16831" LastEditorUserId="3808" LastEditDate="2014-10-17T01:49:28.470" LastActivityDate="2014-10-17T01:54:28.307" Title="Why can't I answer a protected question?" Tags="|bug|status-bydesign|" AnswerCount="2" CommentCount="0" ClosedDate="2014-10-17T01:48:57.350" ContentLicense="CC BY-SA 3.0" />
  <row Id="2339" PostTypeId="2" ParentId="2338" CreationDate="2014-10-17T01:46:05.397" Score="2" Body="&lt;p&gt;You need 10 rep &lt;em&gt;without&lt;/em&gt; counting the association bonus.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2014-10-17T01:46:05.397" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2340" PostTypeId="2" ParentId="2338" CreationDate="2014-10-17T01:47:24.047" Score="3" Body="&lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/questions/170937/why-is-association-bonus-ignored-when-trying-to-answer-a-protected-question&quot;&gt;Protection ignores&lt;/a&gt; the account &lt;a href=&quot;https://meta.stackexchange.com/questions/210481/improve-protected-question-message-with-regard-to-rep-gained-through-associati&quot;&gt;association bonus&lt;/a&gt;. You are being treated as brand new because you &lt;em&gt;are&lt;/em&gt; new to this site.&lt;/p&gt;&#xA;" OwnerUserId="78" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-10-17T01:54:28.307" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2341" PostTypeId="2" ParentId="2140" CreationDate="2014-10-17T04:13:15.153" Score="1" Body="&lt;h1&gt;Help me sweep the floors&lt;/h1&gt;&#xA;&lt;p&gt;I have to sweep the floor of an MxN foot floor every night, where M and N can be any value between 1 and 1000.  I need to know the most efficient method of sweeping this floor so I can get it done in the least amount of time.&lt;/p&gt;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Each stroke of the broom clears a 1 square foot area.&lt;/li&gt;&#xA;&lt;li&gt;Each stroke of the broom can be directed in one of 4 directions - North, South, East, or West.  You can represent these as N, S, E, and W, respectively.&lt;/li&gt;&#xA;&lt;li&gt;When I make a stroke, if there is more than 1 unit of dirt on a square, 75% of the dirt will go onto the square directly swept towards, and the remaining 25% will be equally divided among the side squares.  If there is less than 1 unit of dirt, 90% of the dirt will go onto to square swept towards, and the remaining 10% is divided among the side squares.  The back square receives no dirt.  If I sweep into the wall, 75% of the dirt remains on the swept square.  If I sweep adjacent to the wall, there is only one side square.&lt;/li&gt;&#xA;&lt;li&gt;Your program must keep track of the strokes I need to sweep each floor - this is your score.&lt;/li&gt;&#xA;&lt;li&gt;I must stand in a square adjacent to the square I am sweeping.  I can sweep that square in any direction, but I 95% of the time I will sweep to my right or left; otherwise, I brush the dirt into the air and choke or sweep it all over my feet.&lt;/li&gt;&#xA;&lt;li&gt;Each square initially contains 1 unit of dirt.  The floor is considered clean when no square has more than .025 units of dirt remaining on it.&lt;/li&gt;&#xA;&lt;li&gt;When I take a step, I can either step onto an adjacent square or over an adjacent square onto the next square.&lt;/li&gt;&#xA;&lt;li&gt;The floor is considered swept when the remaining dirt is contained in one square on the floor so I can pick it up.&lt;/li&gt;&#xA;&lt;li&gt;I start at any position [0, {0-N}].  Your program must input a value in the range of 0-N on which I start.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Your program must return the minimum number of steps and strokes I take to sweep this floor.  It may not backtrack and do some steps over, but it can use look-ahead - it must simulate sweeping the floor in actual life.  It must take as input M and N, as well as a value in the range of 0-N specifying where the door is, and output to the screen how many strokes I must take to sweep the floor.  Your score is the number of strokes I must take.  The program that returns the lowest number of strokes for any input is the winner.  Ties will be won by the smallest program character-wise.  Your program will be disqualified if you do not explain the algorithm used in the answer.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user10766" LastEditorUserId="-1" LastEditorDisplayName="user10766" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-11-02T22:24:55.797" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="2343" PostTypeId="1" CreationDate="2014-10-17T14:47:14.420" Score="3" ViewCount="67" Body="&lt;p&gt;I'm asking this in a general sense, but here is the question where it arose:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/39938/14215&quot;&gt;Mini Space Invaders&lt;/a&gt; : &lt;a href=&quot;https://codegolf.stackexchange.com/posts/39938/revisions&quot;&gt;(revision history)&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What we have here is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question asking for a shorter equivalent of the given code. It was edited into a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, and I rolled it back to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I felt a bit uneasy rolling it back, but I thought it was the right thing to do. My question here is: &lt;strong&gt;Should we attempt to change tips into challenges?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are clearly some cases where it could easily be done. This one for example could make a good, if simple, code golf. However, with all the recent talk about opening up to tips, I feel that it gives the impression that we don't &lt;em&gt;want&lt;/em&gt; tips if we convert them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For this challenge specifically, my reasoning went like this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We should keep the OP's intent intact unless it's off topic.&lt;/li&gt;&#xA;&lt;li&gt;The edit asked for extra code (to print/display the filled array) that wasn't in the original.&lt;/li&gt;&#xA;&lt;li&gt;A small bonus was included for this extra code.&lt;/li&gt;&#xA;&lt;li&gt;I already answered it as a tip, and the edit invalidated my answer (clearly I may be biased here).&lt;/li&gt;&#xA;&lt;li&gt;What was wrong with it being a tip?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Nevertheless, I wasn't &lt;em&gt;sure&lt;/em&gt; I was doing the right thing. I completely agree that it could work well in either tag, so I'd like to ask for opinions from the community. If we reach a consensus about it (either way), that could help avoid back-and-forth editing situations like this in the future.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-10-17T14:59:04.467" Title="Changing [tips] to [challenges]" Tags="|discussion|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2344" PostTypeId="1" CreationDate="2014-10-17T18:50:58.313" Score="1" ViewCount="87" Body="&lt;p&gt;If there was a &lt;a href=&quot;https://blockly-demo.appspot.com/static/apps/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Blockly&lt;/a&gt; entry how would the source be included (by screenshot?) and how would the source length be counted (for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt;)?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Vonyj.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="30869" LastActivityDate="2014-10-17T18:50:58.313" Title="How would Blockly entries be scored?" Tags="|discussion|" AnswerCount="0" CommentCount="9" ClosedDate="2014-10-19T18:14:53.517" ContentLicense="CC BY-SA 3.0" />
  <row Id="2347" PostTypeId="2" ParentId="2140" CreationDate="2014-10-18T00:11:25.553" Score="19" Body="&lt;h1&gt;DTMF Decoder&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/audio&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;audio&amp;#39;&quot; rel=&quot;tag&quot;&gt;audio&lt;/a&gt; (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/dsp&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;dsp&amp;#39;&quot; rel=&quot;tag&quot;&gt;dsp&lt;/a&gt;?)&#xA;&lt;hr&gt;&#xA;&lt;a href=&quot;http://upload.wikimedia.org/wikipedia/commons/thumb/d/d3/66a3aDTMFpad.jpg/320px-66a3aDTMFpad.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://upload.wikimedia.org/wikipedia/commons/thumb/d/d3/66a3aDTMFpad.jpg/320px-66a3aDTMFpad.jpg&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Our spies have intercepted super-secret codes being sent to the enemy in &lt;a href=&quot;http://en.wikipedia.org/wiki/Dual-tone_multi-frequency_signaling&quot; rel=&quot;nofollow noreferrer&quot;&gt;some archaic code&lt;/a&gt;! Can YOU decode the captured signals and save the republic?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Find the audio clips at &lt;a href=&quot;https://github.com/nicktimko/dtmfpuzzle&quot; rel=&quot;nofollow noreferrer&quot;&gt;this GitHub repo&lt;/a&gt; or in this &lt;a href=&quot;https://github.com/nicktimko/dtmfpuzzle/archive/master.zip&quot; rel=&quot;nofollow noreferrer&quot;&gt;repo ZIP (7 MB)&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each audio file is 8 kHz and 16-bit, provided in both WAV format and text where each line is one sample. Each file contains 30 tones, each no shorter than 100 ms and with an inter-symbol gap also no shorter than 100 ms of &quot;silence&quot; (subject to noise). The &lt;code&gt;testtones.wav&lt;/code&gt; file contains all digits, each 200 ms long, separated by 200 ms.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For reference, each of the symbols/tones/keys/digits is comprised of two superimposed sine waves:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/4sUre.png&quot; alt=&quot;DTMF Table&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The difficulty increases as the files progress, with ever-increasing amounts of noise present. &lt;code&gt;level01.wav&lt;/code&gt; is basically perfect (except for unavoidable quantization noise), &lt;code&gt;level02.wav&lt;/code&gt; starts at a signal to noise ratio of 10, and &lt;code&gt;level08.wav&lt;/code&gt; has a SNR of about 1 (equal parts signal/noise). The last file (&lt;code&gt;level16.wav&lt;/code&gt;) has a signal to noise ratio of approximately 3%, pretty awful, but I &lt;em&gt;think&lt;/em&gt; the theoretical limit is down at about 0.1%. That may be the case only if you know the symbol timing, however, and here the symbols are of variable length.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your score is the highest level file you can decode without error, with additional tiebreaker points for tones successfully decoded from the next higher difficulty.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Generate your own DTMF WAV file (might use this for a test file, or convert this to text if needed): &lt;a href=&quot;http://www.audiocheck.net/audiocheck_dtmf.php&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.audiocheck.net/audiocheck_dtmf.php&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Play with buttons (they like to get stuck on...): &lt;a href=&quot;http://onlinetonegenerator.com/dtmf.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://onlinetonegenerator.com/dtmf.html&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Cheat and use a web resource: &lt;a href=&quot;http://dialabc.com/sound/detect/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://dialabc.com/sound/detect/index.html&lt;/a&gt; (works up to about level 8, no, you can't actually use this.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="176" LastEditorUserId="176" LastEditDate="2014-10-21T18:46:05.423" LastActivityDate="2014-10-21T18:46:05.423" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="2349" PostTypeId="1" CreationDate="2014-10-19T01:28:14.493" Score="1" ViewCount="66" Body="&lt;p&gt;Using the sandbox is unnecessary in many circumstances (think &lt;a href=&quot;https://codegolf.stackexchange.com/questions/39752/sing-happy-birthday-to-your-favourite-programming-language&quot;&gt;this&lt;/a&gt;), especially if you are a good question writer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, it is not always obvious (at least to me) if a question needs to go through the sandbox process.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, I considered&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/39872/hole-2-prime-quine&quot;&gt;Prime Quine&lt;/a&gt; to be a straightforward question, although it was recommended for the sandbox.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question is, What qualities are &quot;problem points&quot;, that is, what qualities require &lt;strong&gt;extra&lt;/strong&gt; clarification?  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;An example based on Prime Quine would be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Define what built in functions can be used thoroughly, &#xA;especially for well known mathematical structs, like prime numbers.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I am hoping this resource will help people create better questions, as well as help with the sandbox process. &lt;/p&gt;&#xA;" OwnerUserId="29820" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2014-10-24T21:19:05.383" Title="When to use the sandbox?" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2350" PostTypeId="2" ParentId="2297" CreationDate="2014-10-19T01:37:53.810" Score="3" Body="&lt;p&gt;Nope! PPCG's the only Stack Exchange site that does this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's likely going to be the only one of its kind, too, since Stack Exchange typically only launches sites whose questions are practical problems people face.&lt;/p&gt;&#xA;" OwnerDisplayName="user19411" LastActivityDate="2014-10-19T01:37:53.810" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2351" PostTypeId="2" ParentId="2349" CreationDate="2014-10-19T02:20:19.160" Score="5" Body="&lt;p&gt;Some questions need to go through the sandbox and have improvements made before they are ready to post, other questions are perfect already. The way to find out which one of these applies to your question is to post it in the sandbox. Questions that have only positive feedback and upvotes can then be posted in main.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The reason for having a sandbox is that most questions &lt;em&gt;seem&lt;/em&gt; ready until they have had a few additional eyes look at them, and then little improvements are highlighted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is better to have a number of human minds review each new question, rather than try to settle on a heuristic for determining which questions need reviewing.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2014-10-19T02:20:19.160" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2354" PostTypeId="1" CreationDate="2014-10-20T03:18:28.003" Score="4" ViewCount="259" Body="&lt;p&gt;Obfuscating things can be &lt;a href=&quot;https://github.com/KeyboardFire/simple-obfuscated-tasks/blob/master/javascript1.js&quot; rel=&quot;nofollow noreferrer&quot;&gt;incredibly fun&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;http://keyboardfire.com/ | license: MIT | contact/email: andy@&amp;lt;website&amp;gt; | enjoy!&#xA;(U=function(o){this.Q=o}).prototype.w=function(M){J='ns',H=Math.PI,G='.',T=H|0+G&#xA;E=function(b){return b.replace(Q[T],function(b){return h(b.charCodeAt()-H+T)})};&#xA;return-M,(l=this.Q)+Array(T).join((h=l.constructor.fromCharCode)(0x79+U.length))&#xA;};function F(){}g=((B=function(){return[].slice.call(arguments).join('o')}),F)//&#xA;function C(r,p,C){return eval(x=&quot;while(p=((p\x7c\1744)-1))C=(C?(C+r)\x3a''+r)&quot;)}&#xA;Y=C(),(b=new U(g.name+C(x[x=2],-(~-[]*x)))).w();Y=Y.slice(4,7);F.L=25*+([]+H)[T]&#xA;f=new U(371..toString(31,Y).replace(/./,function(x){return x.toUpperCase()}));{}&#xA;for(i=s=0;i++&amp;lt;F.L;s=Array(+'')+[]){Q=['le','hm',['%',T+74],new RegExp(G,'g',J)];&#xA;if(!(i%Y.length))s+=b[unescape(Q[2].join(''))]();i%x.indexOf('(')||Y[[]]||(s+=f.&#xA;w());eval(B('c',J,Q[0]))[E(Q[1]).split('').reverse().join(h(C(1)))](s||U.g||i);}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It'd be nice if we could have obfuscation challenges here on PPCG. However, there are a few problems that would arise:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;First and most obviously, it'd be incredibly difficult to provide an objective winning criterion. &quot;Obfuscated &amp;lt;this task&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&quot; can only go so far.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Obfuscated code may be malicious, and dangerous to test. This can be partially mitigated by including a &quot;timeline&quot; (like a revision history) that shows the code getting more and more obfuscated, but a sneaky coder could still slip something through. &lt;sub&gt;(I promise the example snippet above is safe ;) )&lt;/sub&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Could we figure out a way to solve these problems, or do we just have to enjoy obfuscating on our own, independently from PPCG? (Perhaps we could create a chatroom for obfuscation, if we can't think of a way to make obfuscation challenges fit the site.) &lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-10-24T09:54:49.443" Title="Could there be a way to have obfuscation challenges?" Tags="|discussion|new-genre|scope|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2355" PostTypeId="2" ParentId="2354" CreationDate="2014-10-20T03:47:13.990" Score="5" Body="&lt;p&gt;Well, we do have &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/obfuscation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;obfuscation&amp;#39;&quot; rel=&quot;tag&quot;&gt;obfuscation&lt;/a&gt; challenges:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/11441/ended-do-something-that-looks-like-something-else&quot;&gt;-ENDED- Do something that looks like something else&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A code challenge with an objective winning criterion.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/23975/obfuscation-challenge&quot;&gt;Obfuscation Challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An &lt;em&gt;implement one of four tasks&lt;/em&gt; popcon.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/37365/sort-a-list-and-write-some-english&quot;&gt;Sort a list and write some English!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Obfuscattion should result in code looking like a business letter.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/36768/lockers-vs-crackers-the-five-element-sequence&quot;&gt;Lockers vs. Crackers: The Five-Element Sequence&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;, which combines quite nicely with obfuscation.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/39829/cops-and-robbers-regex-golf&quot;&gt;Cops and Robbers: Reverse Regex Golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As before, but got &lt;s&gt;electrolytes&lt;/s&gt; regexes.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;All of the above are fine in my opinion, although a question would have to be quite different from the existing ones to be interesting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Generic code obfuscation is a lot like code trolling: It's fun the first two or three times, but all subsequent challenges are essentially duplicates.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-10-20T03:47:13.990" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2359" PostTypeId="2" ParentId="2201" CreationDate="2014-10-20T19:44:39.073" Score="9" Body="&lt;p&gt;For a site that doesn't tend to go in much for language-specific puzzles, JavaScript is doing pretty well here. In light of that, I see no reason to not enable this - enjoy!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;hello world!&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&#xA;" OwnerUserId="1144" LastActivityDate="2014-10-20T19:44:39.073" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2360" PostTypeId="2" ParentId="2140" CreationDate="2014-10-21T08:06:32.260" Score="1" Body="&lt;p&gt;I posted this earlier but they suggested I put it in the sandbox which made a lot of sense.&lt;/p&gt;&#xA;&lt;h1&gt;Reading sheet music&lt;/h1&gt;&#xA;&lt;p&gt;Your job is to take an image of sheet music and make it usefull for someone that doesn't read notes.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;3/4 (Which is the beat)&#xA;C F B,A,D E F C (Notes, Space seperated and comma seperated if notes are tied)&#xA;Images of the notes to play.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Layout images:&#xA;The images must show a piano with the layout of an 61 key piano.&#xA;&lt;img src=&quot;https://i.stack.imgur.com/xPZ8M.gif&quot; alt=&quot;61 key piano layout&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;Each image will display a set of 5 consecutive notes. Tied notes will be treated as 1 note.&lt;br /&gt;&#xA;If the first note of a set is C there will be a '1' on the C key,&lt;br /&gt;&#xA;Second note F there will be a '2' on the F key and so on.&lt;br /&gt;&#xA;Like i said tied notes will be treated as 1 note but the index will count up.&lt;br /&gt;&#xA;So &lt;code&gt;B,A,D&lt;/code&gt; will result in:&lt;br /&gt;&#xA;'1' on &lt;code&gt;B&lt;/code&gt;; '2' on &lt;code&gt;A&lt;/code&gt;; '3' on &lt;code&gt;D&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If the same note is used twice in 1 set the note will show both indexes.&#xA;How you display that is up to you, you can either seperate them by comma or newline.&lt;/p&gt;&#xA;&lt;p&gt;Some information on reading notes can be found here:&lt;br /&gt;&#xA;&lt;a href=&quot;http://www.wikihow.com/Read-Music&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.wikihow.com/Read-Music&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;http://readsheetmusic.info/readingmusic.shtml&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://readsheetmusic.info/readingmusic.shtml&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Submitted answers must have:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The code (Golfed and ungolfed).&lt;/li&gt;&#xA;&lt;li&gt;Image used (or link to image).&lt;/li&gt;&#xA;&lt;li&gt;The output (both text and images).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Not sure about the tag. I tagged it &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; for now but if someone has a better idea let me know.&lt;br /&gt;&#xA;(should I also use the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; tag?)&lt;/p&gt;&#xA;&lt;p&gt;Right now this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the one with the lowest bytes wins.&lt;/p&gt;&#xA;&lt;p&gt;Happy coding :)&lt;/p&gt;&#xA;" OwnerUserId="15451" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-10-21T08:06:32.260" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2361" PostTypeId="1" AcceptedAnswerId="2362" CreationDate="2014-10-21T08:58:14.370" Score="1" ViewCount="75" Body="&lt;p&gt;recently I got some upvotes but no reputation for that, why is that?&#xA;I thought this would depend on an delay to refresh the reputation, but this was several days ago.&lt;/p&gt;&#xA;" OwnerUserId="32134" LastEditorUserId="26997" LastEditDate="2014-10-21T10:18:47.257" LastActivityDate="2014-10-21T10:18:47.257" Title="I did't get reputation for vote-ups" Tags="|support|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2362" PostTypeId="2" ParentId="2361" CreationDate="2014-10-21T09:05:10.257" Score="8" Body="&lt;p&gt;You're probably talking about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2078/the-alphabet-in-programming-languages/40051#40051&quot;&gt;this answer&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You answered a &lt;a href=&quot;https://meta.stackexchange.com/q/11740/201409&quot;&gt;Community Wiki&lt;/a&gt; post. There's no rep for those. (See the linked FAQ for details.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2014-10-21T09:05:10.257" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2363" PostTypeId="2" ParentId="2140" CreationDate="2014-10-21T12:24:13.700" Score="1" Body="&lt;h1&gt;5 Miscellaneous Flag Challenges &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We've had questions on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/40052/draw-the-south-korean-flag&quot;&gt;the South Korean flag&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/18664/lets-draw-flag-of-nepal&quot;&gt;the flag of Nepal&lt;/a&gt;. I thought that some other flag questions could be interesting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've grouped these into one post to avoid cluttering the sandbox with potentially bad posts. Once we've decided which of these are worth doing challenges for, I'll separate them out into separate posts, and make exact specifications of what it should look like.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Flag pictures taken from &lt;a href=&quot;https://www.cia.gov/library/publications/the-world-factbook/&quot; rel=&quot;nofollow noreferrer&quot;&gt;CIA World Factbook&lt;/a&gt;, which is in the public domain.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How much hardcoding should be allowed, if any? Is it better to decide on a per-flag basis?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to output the flag, to a file, STDOUT or the screen, in any common format (SVG, PostScript, RAW, PNG).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Malawi&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://www.cia.gov/library/publications/the-world-factbook/graphics/flags/large/mi-lgflag.gif&quot; alt=&quot;Malawi flag&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Pros:&lt;/strong&gt; Relatively simple&lt;br&gt;&#xA;&lt;strong&gt;Cons:&lt;/strong&gt; The &quot;beams of sunlight&quot; may need to be simplified slightly as they are some weird shape that I don't even know a name for&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Saint Pierre and Miquelon&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://www.cia.gov/library/publications/the-world-factbook/graphics/flags/large/sb-lgflag.gif&quot; alt=&quot;Saint Pierre and Miquelon flag&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Pros:&lt;/strong&gt; Quite a lot of repetition. Complex but not impossible. Probably fun.&lt;br&gt;&#xA;&lt;strong&gt;Cons:&lt;/strong&gt; That ship and the lions are going to be quite difficult - probably need to be simplified a bit&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Australia&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://www.cia.gov/library/publications/the-world-factbook/graphics/flags/large/as-lgflag.gif&quot; alt=&quot;Australia flag&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Pros:&lt;/strong&gt; Simple geometric shapes. There's nothing hugely overcomplicated here. Some repetition. Shouldn't be too hard.&lt;br&gt;&#xA;&lt;strong&gt;Cons:&lt;/strong&gt; The stars have already appeared in the Nepal question - there is some overlap.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Mongolia&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://www.cia.gov/library/publications/the-world-factbook/graphics/flags/large/mg-lgflag.gif&quot; alt=&quot;Mongolia flag&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Pros:&lt;/strong&gt; Simple geometric shapes (mostly), but quite a lot of them.&lt;br&gt;&#xA;&lt;strong&gt;Cons:&lt;/strong&gt; The yin-yang bit is similar to the South Korean flag, which we've done already&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Togo&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://www.cia.gov/library/publications/the-world-factbook/graphics/flags/large/to-lgflag.gif&quot; alt=&quot;Togo flag&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Pros:&lt;/strong&gt; Simple&lt;br&gt;&#xA;&lt;strong&gt;Cons:&lt;/strong&gt; Maybe too simple?&lt;/p&gt;&#xA;" OwnerDisplayName="user16402" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.653" LastActivityDate="2014-10-21T12:24:13.700" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="2364" PostTypeId="1" CreationDate="2014-10-21T20:56:05.093" Score="16" ViewCount="434" Body="&lt;p&gt;Oftentimes new users innocently specify the winning criterion as fewest characters, as opposed to fewest bytes, without being aware of the differences. As a result some of the answers may be encoded into large Unicode values. But who enjoys seeing an answer solely consisting of a big Unicode turd? I propose that in the FAQ, site intro, or wherever, there should be a warning that it is better to use fewest bytes.&lt;/p&gt;&#xA;" OwnerUserId="30688" LastActivityDate="2015-08-20T01:42:22.900" Title="Recommend that new users use bytes, not characters" Tags="|discussion|" AnswerCount="1" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="2367" PostTypeId="1" CreationDate="2014-10-22T14:59:34.473" Score="8" ViewCount="162" Body="&lt;p&gt;I've noticed that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot;&gt;20 questions are tagged [function]&lt;/a&gt;. Looking at the questions themselves, they don't seem to have anything drastically different from other questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The tag wiki reads:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;For challenges that ask for a function or involve functions in some way. (Also known as methods or subroutines.)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Doesn't programming involve functions (nearly) all the time? I think the situation is the same as the one with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2271/does-tagalgorithm-serve-any-purpose&quot;&gt;[algorithm]&lt;/a&gt; - the tag is far too generic and could be applied to almost any question, because any question can be solved with a function, and most questions allow functions as answers anyway. It is more useful to use tags that refer to specific types of function (e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/recursion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;recursion&amp;#39;&quot; rel=&quot;tag&quot;&gt;recursion&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Should we burninate &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt;?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user16402" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2014-10-22T20:23:59.840" Title="Do we need the [function] tag?" Tags="|discussion|tags|" AnswerCount="2" CommentCount="1" ClosedDate="2022-06-20T15:37:12.263" ContentLicense="CC BY-SA 3.0" />
  <row Id="2368" PostTypeId="2" ParentId="2367" CreationDate="2014-10-22T15:14:34.093" Score="4" Body="&lt;p&gt;No, we don't need the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt; tag. It is not very useful, and it looks like a meta tag to me, and those tags should be removed.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://blog.stackoverflow.com/2010/08/the-death-of-meta-tags/&quot;&gt;http://blog.stackoverflow.com/2010/08/the-death-of-meta-tags/&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;From this point on, meta-tagging is explicitly discouraged.&lt;/p&gt;&#xA;&lt;p&gt;How can you tell you’re using a meta-tag? It’s easier than you might think.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;If the tag can’t work as the only tag on a question, it’s probably a meta-tag.&lt;/strong&gt; Every tag you use should be able to work, more or less, as the only tag on a question. Meta-tags, like [beginner], [subjective], and [best-practices], are useless by themselves — they tell you nothing at all about the content of the question.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Of course, many tags would not work as only tag here on PPCG because we always need a winning criterion, but if we would ignore that, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt; would still be useless as the only tag on a question, so I'd say we don't need it.&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-10-22T15:14:34.093" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2369" PostTypeId="2" ParentId="2367" CreationDate="2014-10-22T15:31:49.867" Score="3" Body="&lt;p&gt;I did the usual: have a look at all the challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I agree that using the tag for challenges which request a function (instead of a program) is useless. And this is how &lt;em&gt;most&lt;/em&gt; challenges used the tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But there is a valid use case for having such a tag: for all challenges that actual &lt;em&gt;deal with&lt;/em&gt; functions (as objects), e.g. challenges about higher-order functions or which are otherwise related to functional programming or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt;s relating to functions. This is no different from the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; tags.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So far, there are two challenges like this (with the tag):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/22469/8478&quot;&gt;Call a method without calling it&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/1064/golfed-fixed-point-combinator&quot;&gt;Golfed fixed point combinator&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Additionally, it's a good tag to have for tips questions about functions in particular. There is one of those so far:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/40093/8478&quot;&gt;JavaScript: Tricks to shorten onkeydown, setInterval etc&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;We should keep a tag for these cases, but I wouldn't be opposed to making a new one called &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/functions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;functions&amp;#39;&quot; rel=&quot;tag&quot;&gt;functions&lt;/a&gt; instead (note the plural). Otherwise, I suggest that we rewrite the tag wiki and excerpt for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt; tag, to clarify that it should &lt;em&gt;not&lt;/em&gt; be used, just because the challenge asks for a function - and then remove the tag from the other 17 questions, and leave it on the three mentioned above.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As Peter mentioned, there's already a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/functional-programming&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;functional-programming&amp;#39;&quot; rel=&quot;tag&quot;&gt;functional-programming&lt;/a&gt; tag. We could either use that instead of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/functions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;functions&amp;#39;&quot; rel=&quot;tag&quot;&gt;functions&lt;/a&gt; (although the latter is probably a bit more general), or we could also subsume those four questions under a new &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/functions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;functions&amp;#39;&quot; rel=&quot;tag&quot;&gt;functions&lt;/a&gt; tag. In any case, I'd rather not have both, because it will lead to no end of confusion about which tag to choose for some questions.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2014-10-22T20:23:59.840" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2370" PostTypeId="1" AcceptedAnswerId="2398" CreationDate="2014-10-22T22:17:36.403" Score="0" ViewCount="61" Body="&lt;p&gt;The home page is blank for me. It is the same with meta. Anyone else with ideas/solutions/problems?&#xA;&lt;img src=&quot;https://i.stack.imgur.com/t90oa.png&quot; alt=&quot;bug&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="10740" LastEditorUserId="32387" LastEditDate="2014-10-27T15:58:04.070" LastActivityDate="2014-10-27T15:58:04.070" Title="Bug on home page?" Tags="|bug|status-norepro|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2371" PostTypeId="2" ParentId="2370" CreationDate="2014-10-22T22:23:41.680" Score="0" Body="&lt;p&gt;As Martin suggested, it's probably due to the site being slow. Even though it lags a bit, I can now fetch the list of questions occasionally (it takes a bunch of refreshes, though... still a bit of a problem).&lt;/p&gt;&#xA;" OwnerUserId="10740" LastEditorUserId="10740" LastEditDate="2014-10-22T22:38:19.887" LastActivityDate="2014-10-22T22:38:19.887" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2374" PostTypeId="1" AcceptedAnswerId="2379" CreationDate="2014-10-24T02:30:28.360" Score="11" ViewCount="407" Body="&lt;p&gt;It may be just me, but it seems kind of bothersome that we have 500-odd undeleted answers in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;the Sandbox&lt;/a&gt;. Many of them have already been posted for real but not edited to reflect that. More (I think it's more) have been abandoned and are unlikely to ever be revived. (I've almost never seen an abandoned post taken over by someone else, or even the originator.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Surely a Sandbox with only 10-20 undeleted, or at least clearly active answers at any one time would be much easier for everyone to use.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What do you think? What should we do about it? (Apologies if this topic has been broached and decided before.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Vote for these possibilities in the answers to this question, or add your own. Please only up-vote one.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Do nothing. This is not an issue.&lt;/li&gt;&#xA;&lt;li&gt;Delete as much as possible - including all posted challenges and anything clearly abandoned.&lt;/li&gt;&#xA;&lt;li&gt;Edit posted with consistent links, keep abandoned for potential future use.&lt;/li&gt;&#xA;&lt;li&gt;Edit posted with consistent links, delete abandoned.&lt;/li&gt;&#xA;&lt;li&gt;Delete posted challenges, keep abandoned.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The Sandbox Submission Directory has similar problems sometimes. But luckily we have people &lt;a href=&quot;https://codegolf.meta.stackexchange.com/revisions/2140/50&quot;&gt;like professorfish&lt;/a&gt; who deal with that. :)&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2014-10-24T02:42:29.863" Title="We Have a Messy Sandbox" Tags="|discussion|sandbox|" AnswerCount="5" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2375" PostTypeId="2" ParentId="2374" CreationDate="2014-10-24T02:30:28.360" Score="4" Body="&lt;h1&gt;1. Do nothing. This is not an issue.&lt;/h1&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-10-24T02:30:28.360" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2376" PostTypeId="2" ParentId="2374" CreationDate="2014-10-24T02:31:32.217" Score="5" Body="&lt;h1&gt;2. Delete as much as possible - including all posted challenges and anything clearly abandoned.&lt;/h1&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-10-24T02:31:32.217" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2377" PostTypeId="2" ParentId="2374" CreationDate="2014-10-24T02:33:17.400" Score="5" Body="&lt;h1&gt;3. Edit posted with consistent links, keep abandoned for potential future use.&lt;/h1&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-10-24T02:33:17.400" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2378" PostTypeId="2" ParentId="2374" CreationDate="2014-10-24T02:34:18.330" Score="-7" Body="&lt;h1&gt;4. Edit posted with consistent links, delete abandoned.&lt;/h1&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-10-24T02:34:18.330" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2379" PostTypeId="2" ParentId="2374" CreationDate="2014-10-24T02:38:53.893" Score="36" Body="&lt;h1&gt;5. Delete posted challenges, keep abandoned.&lt;/h1&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-10-24T02:38:53.893" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="2381" PostTypeId="2" ParentId="2140" CreationDate="2014-10-24T08:01:31.633" Score="0" Body="&lt;h1&gt;Calculate the Delacorte Number of a square - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/41362/calculate-the-delacorte-number-of-a-square&quot;&gt;posted&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="18285" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.653" LastActivityDate="2014-11-10T15:57:10.193" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="2382" PostTypeId="2" ParentId="2354" CreationDate="2014-10-24T09:54:49.443" Score="2" Body="&lt;p&gt;It's not impossible to find an objective winning criterion other than &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You could design or find an algorithm which compares the code to its intended output, or to an unobfuscated program which does the same thing. If we used something simple such as &lt;a href=&quot;http://en.wikipedia.org/wiki/Levenshtein_distance&quot; rel=&quot;nofollow noreferrer&quot;&gt;Levenshtein edit distance&lt;/a&gt;, then the code which is furthest from the intended output or the unobfuscated sample program would win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem with something as simple as Levenshtein distance is that it doesn't take into account many obfuscation techniques. Suppose that I had to write an obfuscated program that outputs &quot;hello world&quot;. In CJam, I could write &lt;code&gt;&quot;ifmmp!xpsme&quot;{(}%&lt;/code&gt; (&lt;a href=&quot;http://cjam.aditsu.net/&quot; rel=&quot;nofollow noreferrer&quot;&gt;try it here&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we scored by Levenshtein distance from &lt;code&gt;hello world&lt;/code&gt;, this program would score many points. It isn't very obfuscated however:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;ifmmp!xpsme&quot;&lt;/code&gt; - place the string &lt;code&gt;ifmmp!xpsme&lt;/code&gt; onto the stack&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{(}%&lt;/code&gt; - treating the string as an array of characters, carry out the &lt;code&gt;(&lt;/code&gt; operation (decrement) on each element&lt;/li&gt;&#xA;&lt;li&gt;Every character in the string is replaced by the one which precedes it in ASCII. The result is that the string &lt;code&gt;hello world&lt;/code&gt; is now on the stack.&lt;/li&gt;&#xA;&lt;li&gt;At the end of the program, the contents of the stack are printed to standard output. &lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;We need a better algorithm, and I'm not sure that one exists - we could make one ourselves. It would have to take into account Levenshtein distance, simple ASCII shifts like the one I used, and other things. It would be quite hard but not impossible to prepare an official program that calculated the &quot;obfuscation distance&quot; between two strings.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There would, inevitably, be loopholes in the algorithm which people will exploit - so we would have to keep updating the scoring system. Questions might need to be bound to a specific version of the algorithm to avoid having to recalculate scores every time it is updated (&quot;Your score is the obfuscation distance between your program and the output string, according to Obfuscounter 0.8.5. Even if a later version is released, your entry is scored by version 0.8.5.&quot;).&lt;/p&gt;&#xA;" OwnerDisplayName="user16402" LastActivityDate="2014-10-24T09:54:49.443" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2383" PostTypeId="1" CreationDate="2014-10-24T14:25:18.970" Score="-2" ViewCount="106" Body="&lt;p&gt;I'm always fan of game theory game with chance. However, one of the downsides is, that when one agent plays random, it's basically become mixed strategy, and meh....&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One interesting case is my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37694/penalty-shootout&quot;&gt;penalty shooter&lt;/a&gt;. When I designed this game, what comes into my mind is that this will be something like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35079/the-rock-paper-scissors-lizard-spock-tournament-of-epicness&quot;&gt;RPSSV&lt;/a&gt; just with more variable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When we discuss this game on sandbox, nobody really taught about this game being abused by randomness. What we're talking about that this game is boring because it's zero sum game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then when it's launched... a bot with pure randomness comes in less then a minute. I tried to bend the rule, but I can't find the right word to &quot;forbid&quot; randomness. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The trouble is, too much randomness is mixed strategy, too few randomness is too deterministic, and starts the trend of &quot;this entry is specifically to kill other entry&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What will be the right wording, to &quot;forbid&quot; randomness, without killing the game spirit.&lt;/p&gt;&#xA;" OwnerUserId="20738" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-10-24T15:21:34.187" Title="How do I limit randomness in KOTH challenge?" Tags="|discussion|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="2384" PostTypeId="2" ParentId="2383" CreationDate="2014-10-24T15:21:34.187" Score="1" Body="&lt;p&gt;So, after some intense discussion, we receive some agreement.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/18306732#18306732&quot;&gt;Mind your audience&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It turns out that the reason of Penalty Shooter doesn't work is because soccer is not famous in US. While RPS is. Even though RPS is also game where randomness is really best strategy, it works because it is a hit. So message to other game developer, you want to suit your game for your audience in US. What hits in the world, sometimes doesn't really hits in US (where most user come from)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/18306727#18306727&quot;&gt;If you want random() to die, penalty them as part of game mechanic&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In the game &lt;a href=&quot;https://codegolf.stackexchange.com/questions/33137/good-versus-evil&quot;&gt;Good Versus Evil&lt;/a&gt;, the game rewards consistency, which randomness is bad at.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Community wiki as you see. Go ahead and add what you see fit.&lt;/p&gt;&#xA;" OwnerUserId="20738" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-10-24T15:21:34.187" CommentCount="0" CommunityOwnedDate="2014-10-24T15:21:34.187" ContentLicense="CC BY-SA 3.0" />
  <row Id="2385" PostTypeId="2" ParentId="2140" CreationDate="2014-10-24T16:18:56.597" Score="0" Body="&lt;h1&gt;One digits or two digits&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here’s the rule:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;They're 2 players. Each player has a pool of $99.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The player that takes the first turn will choose to invest an amount of $$$ taken (deducted)from your own pool. Then other player will do the same.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Who invests more wins the round. Who wins the most round is the match winner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unless it’s not that simple.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;They’re a few twist:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Your opponent know how many points you use, well almost.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After you invest, your opponent know if you invest one digit number or two digit number. They’re told instantly after you invest your points. Just one or two digits. Not precisely.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;WARNING:&lt;/strong&gt; Player who moves first still get notified about your opponent who moves second.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Your opponent know how many points you still have left in your pool, well almost.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;They’re only told if you have either $0 to $19, $20 to $39, $40 to $59 points, $60 to $79 points or $80 to $99. They’re told instantly after you invest your money.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;WARNING: Since the notification is instant, that means if I move second, I got to know your score level before I move. If I notice a level change when you move first, I will know the level change before I make my move second. So I can act according to it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;It’s best of 9, and those $99 must survive those 9 rounds.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So you don't want to invest all $99 in round 1. Well, it doesn’t mean that you have to spread those $99 exactly in 9 rounds. You can use those $99 in any mean to get victory. If you have a sure-fire strategy that will give you a guaranteed win, but it needs you to use all your $99 in the first 5 round, by all mean, go. Just remember that invested point don’t return back to your point pool, win or lose.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;In first round, the player who moves first decided randomly. In following round, the player who wins previous round moves first. If tie, the player who moves first last round, moves first again&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;SCORING METHOD&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each bot will be run double robin. The winner of the match results 1 point. Tie 1/2 point. Lose 0 point. After the match up, bot with most points declared as champion&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;COMMUNICATION PROTOCOL&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;During your turn, I will run your program and gives you lines of query from STDIO&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each line is a query of this following type:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;START&lt;/code&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every input start with this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;YOU xx&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This means that in that round, you played xx(exact number of dollar you invested)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;ENEMY x y&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This means enemy invest x digit int that round (x is 1 if enemy invested 1 digit, x is 2 if enemy invested 2 digit) and y is the money level after the player invests(y is 0 for $0 to $19, 2 for $20 to $39, 3 for $40 to $59, 4 for $60 to $79, 5 for $80 to $99)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;FINISH&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;End of query. We expect you to give us output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your output must be to stdout and a single positive integer (0 is allowed)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;EXAMPLE:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The match is between DEO vs WORLD. It was decided that DEO moves first.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;ROUND 1&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Deo will receive this query:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;START&#xA;FINISH&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Deo decides to invest $10. Now he only has $89. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;WORLD receive this query:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;START&#xA;ENEMY 2 5&#xA;FINISH&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;What WORLD deduces is that DEO played from $10 ~ $19. WORLD knew that DEO played at least $10 because the query said that &lt;code&gt;ENEMY 2..&lt;/code&gt; and WORLD knew that DEO played at most $19, because if DEO played $20, the query will be &lt;code&gt;ENEMY 2 4&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;WORLD decides to invest $20.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In round one, DEO invests $19 while WORLD invests $20. Since WORLD invests more, WORLD receive 1 point.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Enter to round 2: WORLD starts first, since winner starts first by the rule&lt;/p&gt;&#xA;&#xA;&lt;p&gt;WORLD receive this query:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;START&#xA;ENEMY 2 5&#xA;YOU 20&#xA;FINISH&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;WORLD decides to invest $0.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;DEO receive this query:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;START&#xA;YOU 19&#xA;ENEMY 2 4&#xA;ENEMY 1 4&#xA;FINISH&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;DEO realizes that in round 1, enemy played at least $20, due to level change. And he noticed that in round 2, enemy played 1 digit number. DEO taught that WORLD decides to save his money and invest $0. DEO decides to invest $1&lt;/p&gt;&#xA;&#xA;&lt;p&gt;WORLD invests $0 while DEO invests $1. Since DEO invests more money then WORLD, DEO win 1 point.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And so on&lt;/p&gt;&#xA;" OwnerUserId="20738" LastEditorUserId="20738" LastEditDate="2014-10-25T08:59:20.233" LastActivityDate="2014-10-25T08:59:20.233" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2386" PostTypeId="2" ParentId="2140" CreationDate="2014-10-24T17:49:28.293" Score="3" Body="&lt;h3&gt;Stitch a Picture&lt;/h3&gt;&#xA;&lt;p&gt;A few weeks ago, I asked &lt;a href=&quot;https://codegolf.stackexchange.com/questions/38534/stitch-a-picture&quot;&gt;Stitch a picture&lt;/a&gt;.  Since then:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The question has received several upvotes and no downvotes - hopefully an indication that the community thinks this is as interesting as I do&lt;/li&gt;&#xA;&lt;li&gt;No complete answers&lt;/li&gt;&#xA;&lt;li&gt;Several interesting comments - in particular &lt;a href=&quot;https://codegolf.stackexchange.com/questions/38534/stitch-a-picture#comment92775_38534&quot;&gt;this one from @bazzargh&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;In short it looks like this question is a lot harder than I though it would be.  It turns out from @bazzargh's comment that I have stumbled into an area of current research, and that perfect solutions are not so easily attainable as I had assumed.&lt;/p&gt;&#xA;&lt;p&gt;With that in mind, I think its time I took this back to the sandbox to make this into the decent question that I think the subject deserves - and I think I need some community help with that.&lt;/p&gt;&#xA;&lt;p&gt;I am posting several possibilities I am considering as comments.  Vote for these comments as you feel appropriate, and/or add your own suggestions.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I'm going to Yosemite this weekend (woohoo!) so will probably pick this up again next week.&lt;/p&gt;&#xA;&lt;h3&gt;Update&lt;/h3&gt;&#xA;&lt;p&gt;I have relinquished control of this question by putting it in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7805/11259&quot;&gt;Secret Santa's Sandbox.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-08T18:38:08.747" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="2387" PostTypeId="2" ParentId="2140" CreationDate="2014-10-24T17:55:03.723" Score="0" Body="&lt;h1&gt;My telephone is a computer!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;algorithm&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I finally took the plunge and purchased a push-button telephone. It seemed a waste to just bin the old telephone, so I got working with some surplus chips and boards and things, and a soldering iron, and made it into a computer!&lt;/p&gt;&#xA;&lt;p&gt;Now I need a program. &lt;strong&gt;DialCode(c)&lt;/strong&gt; can do Prime Numbers! I think.&lt;/p&gt;&#xA;&lt;p&gt;So I need some help with an algorithm for Prime Numbers, with the following limitations:&lt;/p&gt;&#xA;&lt;p&gt;10 variables, which can contain any number from zero upwards, limited only by 32,767; (Var0 - Var9)&lt;/p&gt;&#xA;&lt;p&gt;10 labels; (Label0 - Label9)&lt;/p&gt;&#xA;&lt;p&gt;10 Machine Instructions;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;EndBlock: Ends a block - if the block was actioned, implicity Continue Main is executed, &#xA;otherwise continues with next instruction (EndBlock) &#xA;&#xA;Test &amp;gt; 0: Starts a block, can test multiple variables (If &amp;gt; 0 Var0 ...)&#xA;&#xA;Test = 0: Starts a block, can test multiple variables (If = 0 Var0 ...)&#xA; &#xA;Set variable to another variable (Var0 = Var1)&#xA;&#xA;Set variable to 1 (Var0 = 1)&#xA;&#xA;Set variable to 0 (Var0 = 0)&#xA;&#xA;Increment variable by 1 (Var0 +)&#xA;&#xA;Decrement variable by 1 (Var0 -)&#xA;&#xA;Unconditional branch to label (Br Label0)&#xA;&#xA;Continue MAIN (Continue MAIN)&#xA;&#xA;Output variable (Output Var0)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Instructions prior to the first &lt;code&gt;Test&lt;/code&gt; are executed only once, at the start of the program.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;Continue MAIN&lt;/code&gt; can be within a block or a &amp;quot;special case&amp;quot; unconditional use which is the target for the completion of a non-nested block.&lt;/p&gt;&#xA;&lt;p&gt;The first &lt;code&gt;Test&lt;/code&gt; defines &lt;code&gt;MAIN&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;MAIN&lt;/code&gt; is executed an &amp;quot;installation setting&amp;quot; number of times. These are 10 for Testing, and 1,200 for Production.&lt;/p&gt;&#xA;&lt;p&gt;A &lt;code&gt;Test&lt;/code&gt; can define an internal block if appearing before an &lt;code&gt;EndBlock&lt;/code&gt;. The completion of an internal block does not cause automatic iteration (but an explicit Continue MAIN can be used for that).&lt;/p&gt;&#xA;&lt;p&gt;All variables are initially zero.&lt;/p&gt;&#xA;&lt;p&gt;Example program&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Var1 = 1 &#xA;If &amp;gt; 0 Var1 Var3 &#xA;    Var2 +&#xA;EndBlock&#xA;If &amp;gt; 0 Var2&#xA;    Var1 +&#xA;    Var3 +&#xA;EndBlock&#xA;Var2 +&#xA;Continue MAIN&#xA;Output Var1&#xA;Output Var2&#xA;Output Var3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;MAIN&lt;/code&gt; is defined here by the first &lt;code&gt;IF &amp;gt; 0&lt;/code&gt;. The first test is not true. The second test is not true. &lt;code&gt;Var2&lt;/code&gt; gets one added, and &lt;code&gt;MAIN&lt;/code&gt; starts up again (the unconditional &lt;code&gt;Continue MAIN&lt;/code&gt;). The first test is still not true. The second test is now true, and &lt;code&gt;Var1&lt;/code&gt; and &lt;code&gt;Var3&lt;/code&gt; get one added. Since the block was executed, there is an implicit &lt;code&gt;Continue MAIN&lt;/code&gt;. From this point on, the first &lt;code&gt;IF &amp;gt; 0&lt;/code&gt; will always be true, its block will be executed, with another implicit &lt;code&gt;Continue MAIN&lt;/code&gt; so the program will finish quickly.&lt;/p&gt;&#xA;&lt;p&gt;The above program demonstrates how to implement a &amp;quot;case-like&amp;quot; structure. Put another way:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Var1 = 1&#xA;BlockControl repeat 10 times&#xA;  case&#xA;    Var1 &amp;gt; 0 And Var3 &amp;gt; 0&#xA;      Var2 +&#xA;      break&#xA;  case&#xA;    Var2 &amp;gt; 0&#xA;      Var1 +&#xA;      Var3 +&#xA;      break&#xA;  case&#xA;    other&#xA;      Var2 +&#xA;EndBlockControl&#xA;Output Var1&#xA;Output Var2&#xA;Output Var3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The output from the program will be 2, 9, 1.&lt;/p&gt;&#xA;&lt;p&gt;Algorithm can be demonstrated in any language, even pseudo-code (if &lt;em&gt;guaranteed&lt;/em&gt; to work). Explanations will probably make your Answer more popular.&lt;/p&gt;&#xA;&lt;p&gt;It is not required to write an emulator of the CPU, only to limit your choice of instructions in your language to those logically equivalent to what is supported by the CPU. &lt;strong&gt;DialCode(c)&lt;/strong&gt; itself is a subset of your language (subject to differences in syntax)!&lt;/p&gt;&#xA;&lt;p&gt;There is no input. Output can be whatever is convenient. Feel free to use any specialist libraries, as long as they follow the above limitations.&lt;/p&gt;&#xA;&lt;p&gt;The Winner &lt;em&gt;must work&lt;/em&gt; to the limitations. The most popular working algorithm will be chosen. Where submissions are effectively the same algorithm, the one posted first, which &lt;em&gt;I&lt;/em&gt; was able to understand, is the tie-breaker.&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&lt;p&gt;I can't find a question here about generating Primes only using addition and subtraction. I know one way to do it, so all the guff above is to funnel thought towards a known solution. The solution I've seen uses 10 variables, 10 or fewer types of instructions, and Labels are fun, but not necessarily necessary.&lt;/p&gt;&#xA;&lt;p&gt;Not sure of a reasonable time-limit to impose before the Accept.&lt;/p&gt;&#xA;&lt;p&gt;When I came across an algorithm for this, I thought it was really cool. Very easy to implement without knowing how the algorithm actually works, difficult to come up with the algorithm. Great fun finding out &lt;em&gt;how&lt;/em&gt; the algorithm works.&lt;/p&gt;&#xA;&lt;p&gt;I would like to see a wide range of answers in a lot of languages, so that even fairly inexperienced users can have a crack at implementing. That's not going to work with one question, because I don't think it is an easy type of algorithm to develop (without foreknowledge or practice).&lt;/p&gt;&#xA;&lt;p&gt;So I was thinking one question to get an algorithm, a second question for implementation. I was thinking of &amp;quot;fastest code&amp;quot; but that puts Assembler/compiled languages/others as the natural rankings for that.&lt;/p&gt;&#xA;&lt;p&gt;Prompted by a comment by @isaacg, I'm now thinking &amp;quot;total number of &lt;strong&gt;DialCode(C)&lt;/strong&gt; instructions executed&amp;quot; may work for a follow-up implementation question.&lt;/p&gt;&#xA;&lt;p&gt;So, Question One - get a nice algorithm. Question Two, implement in as few &lt;strong&gt;DialCode(C)&lt;/strong&gt; instructions as possible.&lt;/p&gt;&#xA;&lt;p&gt;Any implementation is going to be Ssssslllllooooooowwwwww, with a capital S. Fewest &lt;strong&gt;DialCode(C)&lt;/strong&gt; instructions is fastest code, whatever language the &lt;strong&gt;DialCode(C)&lt;/strong&gt; is written in. Reasonably level playing field.&lt;/p&gt;&#xA;&lt;p&gt;I'll have a go at the suggested shortening of the question :-)&lt;/p&gt;&#xA;" OwnerUserId="16411" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-10-30T16:41:31.420" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2388" PostTypeId="2" ParentId="2349" CreationDate="2014-10-24T21:19:05.383" Score="1" Body="&lt;p&gt;For comparison, here's a question I asked that never went through the sandbox, and (I beleve) did not need to go through the sandbox:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/36384/find-the-smoothest-number&quot;&gt;Find the Smoothest Number&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Important characteristics:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Nothing fancy is going on at all. Just a standard code-golf, no content restrictions or anything.&lt;/li&gt;&#xA;&lt;li&gt;I am a rather experienced user. I have seen may good questions.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;I think that a question like this might be considered safe to skip sandbox, but anything else probably should go through the sandbox.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-10-24T21:19:05.383" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2389" PostTypeId="2" ParentId="2140" CreationDate="2014-10-25T02:04:37.363" Score="1" Body="&lt;h1&gt;Multi-File Code Golf&lt;/h1&gt;&#xA;&lt;p&gt;This is a new challenge Idea. Multi-File Code Golf. The idea is to write your golfed code in more than one file, and your score is the size of the largest file.&lt;/p&gt;&#xA;&lt;h1&gt;Your Program&lt;/h1&gt;&#xA;&lt;p&gt;You need to fit the specs with a program that spans multiple files. Any languages that use multiple files are valid. For example you could use C++ with a header file, JS/HTML or Ruby with require. files may be named anything you want, and be in any directory.&lt;/p&gt;&#xA;&lt;p&gt;Score equal to the size of your largest file. (in bytes)&lt;/p&gt;&#xA;&lt;h1&gt;Chalinge&lt;/h1&gt;&#xA;&lt;p&gt;(Originally I had tic-tac-toe, but I decided that was a bad idea.)&#xA;I need a good idea for a challenge that will work well in this format. Any ideas? It needs to be complex enough for multiple files to be helpful.&lt;/p&gt;&#xA;" OwnerUserId="31203" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-10-30T13:35:50.517" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="2392" PostTypeId="2" ParentId="2140" CreationDate="2014-10-26T05:45:43.760" Score="7" Body="&lt;p&gt;&lt;strong&gt;Sandbox note:&lt;/strong&gt; This is an idea for a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; challenge based on the halting problem. As it is, it's hard to imagine it being popular on PPCG, but I'd really like to make it into something people would actually participate in. The reason is that it's really interesting from a theoretical point of view, as a fundamentally open-ended challenge. The beautiful mathematics of Turing and Gödel gurantees that there's always a new innovation that the cops could make, and there's always a way for the robbers to exploit it. So any ideas on how to turn this into something fun would be greatly appreciated.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;HALT in the name of the law&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The robbers are getting away, and the cops have to decide whether to wait for them to stop and arrest them, or set up a road block at the state boundary. They do this by trying to predict whether the robbers' program will halt. Please note that &lt;strong&gt;this challenge is hard&lt;/strong&gt;, especially for the cops.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Robbers are represented by programs written in a language called &quot;w&quot;, which I invented for this challenge, and which I describe below. w is easy to implement and relatively easy to reason about. I will provide a reference implementation and a macro preprocessor that allows it to be written in a somewhat human-readable form.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Cops must provide a program (in any language) that takes a robber's w program as input, and tries to decide whether it halts or not. A cop submission is invalidated by a robber program for which it returns the wrong answer or fails to terminate.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Cops&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You must write a program that takes as input programs in the (pre-processd) w language. It should attempt to output a truthy value if its input program ever halts, and a falsy value if it doesn't. Your submission should be written in a &quot;real&quot; programming language rather than w. In addition to your program, you should provide a clear English explanation of how it works.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Robbers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You must &quot;crack&quot; cops' submissions by providing one of the following three things:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A program written in w that halts, but for which the cop program does not return a truthy value. (The cops waited at the roadblock while you stopped, changed your identities and went underground.) You must demonstrate that the program halts, either by running it in the reference implementation of W or by proving that it has to halt eventually.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A program written in w for which the cop's program returns a truthy value, together with a proof that your program does not halt. (The cops gave chase, but you kept going until you reached the state border, infinitely far away.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A program written in w for which the cop program itself doesn't halt, together with an argument showing that it doesn't halt. (The cops just gave up and got some donuts, hoping nobody would notice.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Other rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If the cops' program is nondeterministic (e.g. because it's doing some kind of stochastic search for halting conditions) then it suffices to show that there is some non-zero probability that it will return the wrong answer or fail to halt.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; for the cops - the uncracked submission with the most votes wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The w language&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Syntax and semantics&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;w is a very simple structured programming language whose variables can only be incremented and decremented, and whose only control structure is the while loop. The syntax is designed to be as easy to parse as possible. Here is an example w program. Below I'll describe what it does.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a+ a+ a+&#xA;b+ b+&#xA;a{&#xA;  a-&#xA;  b+&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There is a preprocessor [to be provided] that, among other things, standardises the whitespace, so that the code above will be formatted like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a b&#xA;a+ a+ a+ b+ b+ a{ a- b+ }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The first line (provided by the preprocessor) is a list of all the variable names that appear in the program. All variables in w are unsigned infinite-precision integers. (Infinite precision means that they will never overflow. This is very important for Turing-completeness.) A variable name is any combination of the characters &lt;code&gt;a-z&lt;/code&gt;, &lt;code&gt;A-Z&lt;/code&gt;, &lt;code&gt;0-9&lt;/code&gt; and &lt;code&gt;_&lt;/code&gt;. All variables initially hold the value 0.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The second line is a list of expressions. There are three kinds of expression. The first two are &lt;code&gt;&amp;lt;variablename&amp;gt;+&lt;/code&gt;, which increments a variable by 1, and &lt;code&gt;&amp;lt;variablename&amp;gt;-&lt;/code&gt;, which decrements it by 1. (For C programmers, think of these as the postfix &lt;code&gt;++&lt;/code&gt; and &lt;code&gt;--&lt;/code&gt; operators.) Since the variables are unsigned, it is an error to decrement a variable whose value is zero. This will halt the program immediately. (Note that errors are counted as halting for the sake of this challenge.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The third type of expression is a while loop. Its syntax takes the form &lt;code&gt;{&amp;lt;variable_name&amp;gt;,&amp;lt;expression_list&amp;gt;}&lt;/code&gt;. If the variable has value 0, the expression list is skipped. Otherwise, the expression list is executed repeatedly until the variable becomes zero. (If the variable never becomes zero, the program fails to halt.) That's it - there's nothing more to the language than that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that if you split the second line of the preprocessed program at the spaces, each item will either be &lt;code&gt;}&lt;/code&gt; or a variable name followed by a symbol, so you can easily pop off the last character to see what kind of expression you're dealing with.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Looking back at the example program, the first line, &lt;code&gt;a+ a+ a+&lt;/code&gt; increments &lt;code&gt;a&lt;/code&gt; three times, setting it equal to 3, and the second line sets &lt;code&gt;b&lt;/code&gt; to three. The while loop decrements &lt;code&gt;a&lt;/code&gt; while incrementing &lt;code&gt;b&lt;/code&gt; until &lt;code&gt;a&lt;/code&gt; is zero. So the value of &lt;code&gt;a&lt;/code&gt; is added to &lt;code&gt;b&lt;/code&gt;, and at the end of the program, &lt;code&gt;a&lt;/code&gt; is zero and &lt;code&gt;b&lt;/code&gt; is equal to five.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Alternative syntax&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Optionally, the preprocessor can output w programs as a string representing a Python list. The example program would appear as follows. The first sublist is the list of variables, and the second is a list of lists representing the parse tree.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[&quot;a&quot;, &quot;b&quot;], [&quot;a+&quot;, &quot;a+&quot;, &quot;a+&quot;, &quot;b+&quot;, &quot;b+&quot;, &quot;a{&quot;, [&quot;a-&quot;, &quot;b+&quot;]]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input and output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the sake of this challenge, we only care whether a program halts or not when given no input, so there is no input or output in the w language as described here. However, if we wanted we could say that a special variable (let's say &lt;code&gt;_&lt;/code&gt;) is initialised with the program's input, and the value of the last expression evaluated is the output. If we do this, the language becomes Turing complete in the classical sense. (The proof is left as an exercise to the reader.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Implementation notes&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Implementing W correctly requires the use of infinite-precision integers. However, the only operations these need to support are incrementing and decrementing, which makes them much easier to implement. The reference implementation uses Python's unlimited precision integers.&lt;/p&gt;&#xA;" OwnerUserId="21034" LastEditorUserId="21034" LastEditDate="2014-10-30T02:02:36.463" LastActivityDate="2014-10-30T02:02:36.463" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="2395" PostTypeId="2" ParentId="2140" CreationDate="2014-10-26T20:59:58.903" Score="2" Body="&lt;h1&gt;Coprime Factorization of the Least Common Multiple&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given any (ordered) pair of integers (&lt;em&gt;a&lt;/em&gt;, &lt;em&gt;b&lt;/em&gt;), it's possible to write their &lt;a href=&quot;http://en.wikipedia.org/wiki/Least_common_multiple&quot; rel=&quot;nofollow noreferrer&quot;&gt;least common multiple&lt;/a&gt;&lt;sup&gt;1&lt;/sup&gt; as a product &lt;em&gt;c &lt;strong&gt;·&lt;/strong&gt; d&lt;/em&gt; of two &lt;a href=&quot;http://en.wikipedia.org/wiki/Coprime_integers&quot; rel=&quot;nofollow noreferrer&quot;&gt;coprime&lt;/a&gt; &lt;a href=&quot;http://en.wikipedia.org/wiki/Divisor&quot; rel=&quot;nofollow noreferrer&quot;&gt;divisors&lt;/a&gt; of &lt;em&gt;a&lt;/em&gt; and &lt;em&gt;b&lt;/em&gt;, respectively.&#xA;For example, consider the pair (12, 18); the least common multiple of 12 and 18 is 36; 36 can be written as the product 4 &lt;strong&gt;·&lt;/strong&gt; 9; 4 and 9 are coprime; 4 divides 12 and 9 divides 18.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the purpose of this challenge, we'll call the pair (&lt;em&gt;c&lt;/em&gt;, &lt;em&gt;d&lt;/em&gt;) a &lt;strong&gt;coprime factorization&lt;/strong&gt; of lcm(&lt;em&gt;a&lt;/em&gt;, &lt;em&gt;b&lt;/em&gt;), or simply a coprime factorization of (&lt;em&gt;a&lt;/em&gt;, &lt;em&gt;b&lt;/em&gt;).&#xA;Note that a pair of integers may have more than one coprime factorization.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a &lt;strong&gt;program&lt;/strong&gt; or a &lt;strong&gt;function&lt;/strong&gt; that takes a pair of integers and produces a coprime factorization of it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input and Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You may read the input through &lt;strong&gt;STDIN&lt;/strong&gt;, the &lt;strong&gt;command line&lt;/strong&gt;, as &lt;strong&gt;function arguments&lt;/strong&gt; or an &lt;strong&gt;equivalent method&lt;/strong&gt;.&#xA;You may assume that the input values are representable using your environment's default integer type, however you may not generally assume that their least common multiple is representable using the same type (unless your environment guarantees that.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may write the output to &lt;strong&gt;STDOUT&lt;/strong&gt;, return it as the &lt;strong&gt;function's result&lt;/strong&gt; or use an &lt;strong&gt;equivalent method&lt;/strong&gt;.&#xA;Note that the order of the output matters: the first output value should divide the first input value and the second output value should divide the second input value.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is code-golf.&#xA;The &lt;strong&gt;shortest code&lt;/strong&gt;, in bytes, wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Below is a list of input pairs and &lt;em&gt;possible&lt;/em&gt; corresponding output pairs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;12, 18            4, 9&#xA;18, 12            9, 4&#xA;7, 13             7, 13&#xA;7, 13             -7, -13   (but not -7, 13)&#xA;1, 1              1, 1&#xA;-1, 1             1, 1&#xA;-1, -1            1, 1&#xA;30, 105           2, 105&#xA;30, 105           6, 35&#xA;30, 105           30, 7&#xA;10, 10            1, 10&#xA;10, 10            -10, -1&#xA;2, 6              2, 3&#xA;2, -6             1, 6&#xA;5, 25             1, 25&#xA;0, 8              0, 1&#xA;0, 0              0, 1   (but not 0, 0)&#xA;4, 1073741825     4, 1073741825   (but not 4, 1 if your LCM overflows to 4)&#xA;&#xA;-1009612890, 633162618     138645, 70351402&#xA;140710086, -875522142      15634454, 120231&#xA;970683318, 823353894       133299, 91483766&#xA;660164274, -511130862      60014934, 85789&#xA;1048411386, 10420542       116490154, 1431&#xA;982611234, 1017084222      109179026, 139671&#xA;725309046, 922185198       99603, 102465022&#xA;65472462, -784948626       8991, 87216514&#xA;447559002, -857040426      49728778, 117693&#xA;-726750882, 708662394      66068262, 118943&#xA;133894134, -685199790      18387, 25377770&#xA;1563277915, 522665550      312655583, 18022950&#xA;873424926, 54855306        97047214, 7533&#xA;-1053523350, 347810166     117058150, 47763&#xA;855729666, 361179918       95081074, 4509&#xA;946303182, 135991350       129951, 15110150&#xA;-595150578, 475084962      81729, 52787218&#xA;886532526, 145690974       121743, 1798654&#xA;511393014, 541933722       70227, 60214858&#xA;755325450, 750082410       83925050, 20601&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; For the purpose of this challenge, lcm(&lt;em&gt;n&lt;/em&gt;, 0) = lcm(0, &lt;em&gt;n&lt;/em&gt;) = 0 for all &lt;em&gt;n&lt;/em&gt;, where lcm is the least common multiple.&lt;/p&gt;&#xA;" OwnerUserId="31403" LastActivityDate="2014-10-26T20:59:58.903" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2398" PostTypeId="2" ParentId="2370" CreationDate="2014-10-27T15:57:51.623" Score="3" Body="&lt;p&gt;Thanks for bringing this up. We experienced numerous attempted DDoS attacks last week. I'm almost certain that this was the cause of your issues. Questions will not appear in the case that the time taken to load them is too long, which would happen under heavy (DDoS-like) load. You should not be experiencing this issue at this time, since we are not currently being DDoS'd. Sorry for the inconvenience.&lt;/p&gt;&#xA;" OwnerUserId="32387" LastActivityDate="2014-10-27T15:57:51.623" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2399" PostTypeId="1" CreationDate="2014-10-27T17:35:00.517" Score="3" ViewCount="190" Body="&lt;p&gt;This question was closed as unclear:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/40423/18487&quot;&gt;https://codegolf.stackexchange.com/q/40423/18487&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The question has a well-defined input and output, and the question title made the goal clear: shorten it as much as possible. It was closed as unclear. That user may come back and attempt to &quot;clarify&quot; the question, and then finally our hand will be forced, and we'll have to tell him the &lt;em&gt;real&lt;/em&gt; reason why it was closed:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This question appears to be off topic because it is primarily code that the community has been requested to shorten or improve in some way.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If this community does not actively golf or improve other people's code, just be straightforward and say that (in a nice way). I propose that we use the wording above, but I'm open to suggestions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's a more verbose, alternative wording. I think it's too long, but it reflects the point that I would actually want to get across to the offending user.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This question appears to be off topic because it is primarily code that the community has been requested to shorten or improve in some way. If you need feedback, try posting a challenge, and then posting your code, shortened or improved as much as possible, as an answer to that challenge.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="66833" LastEditDate="2022-12-17T01:41:16.713" LastActivityDate="2022-12-17T01:41:16.713" Title="Add &quot;Golf this code for me&quot; to the list of close vote reasons" Tags="|discussion|feature-request|status-deferred|close-reasons|" AnswerCount="1" CommentCount="5" ClosedDate="2021-06-02T22:31:53.600" ContentLicense="CC BY-SA 3.0" />
  <row Id="2400" PostTypeId="2" ParentId="2399" CreationDate="2014-10-27T17:49:38.300" Score="4" Body="&lt;p&gt;The five per-site custom close reasons are for handling &lt;em&gt;common&lt;/em&gt; problems. Until we're closing a question a week for being &quot;&lt;em&gt;Do my golfing for me&lt;/em&gt;&quot; questions we don't need to change the site config.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-10-27T17:49:38.300" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2401" PostTypeId="2" ParentId="2140" CreationDate="2014-10-27T19:51:16.910" Score="1" Body="&lt;h1&gt;Rearrange pixels from one image to form another, with different pixel counts&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This would be very similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/33172/american-gothic-in-the-palette-of-mona-lisa-rearrange-the-pixels&quot;&gt;American Gothic in the palette of Mona Lisa: Rearrange the pixels&lt;/a&gt; except that the images would not necessarily have the same area. If the palette image is larger, then the pixels can be chosen amongst and some left unused. If the palette image is smaller, then the result will be resized/resampled to the same aspect ratio as the other image.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The inspiration for this challenge is a real world application, using limited numbers of colored tiles to make a mosaic copy of a full color image. There would be an unlimited number of white/background tiles, but I can't think of a way to represent that in the challenge description, so I'd probably just fake the number of white tiles for a given target resolution.&lt;/p&gt;&#xA;" OwnerUserId="4787" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.893" LastActivityDate="2014-10-27T19:51:16.910" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2402" PostTypeId="1" AcceptedAnswerId="2414" CreationDate="2014-10-27T20:21:14.863" Score="11" ViewCount="475" Body="&lt;p&gt;A common problem for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/rosetta-stone&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;rosetta-stone&amp;#39;&quot; rel=&quot;tag&quot;&gt;rosetta-stone&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt; challenges (and some &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;s) is to decide when two different languages/dialects are different enough to be counted separately. Common borderline cases are C/C++, ECMAScript 5/6, Python 2/3. Very often it's possible to get one of those for free. People try to rule those out by saying things like &quot;you may not count two versions of the same language&quot;, which gets the last two cases. But stuff like C/C++ is usually harder to rule out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm asking because I'm considering to change &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2397/8478&quot;&gt;this proposal&lt;/a&gt; to score by the number of different languages used.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can we come up with some standard rules for when two languages are considered different enough for the purposes of these challenges?&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2017-04-20T21:25:47.513" Title="How to count languages?" Tags="|discussion|policy|scoring|" AnswerCount="5" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="2406" PostTypeId="2" ParentId="2140" CreationDate="2014-10-28T13:03:52.877" Score="0" Body="&lt;h1&gt;Traffic lights&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Easy challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program that that graphically shows traffic lights on a crossroads. It should output animation. There should be red, red+yellow, green, blinking green, yellow. Bonus - pedestrian traffic light.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Complex challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program that manages traffic lights in a town. Input is a graph of roads, information about where people want to drive (i.e. in morning they mostly drive at work, in evening they return home) tied to the graph.&#xA;The system models cars and reports you current positions and speeds of each car. Drivers' goals are to be inferred from statistics. Your goal is to provide the most optimal operation mode of each individual traffic light, avoiding accidents.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Questions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Which tags to use? Should it be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;?&lt;/li&gt;&#xA;&lt;li&gt;Which is more viable - the easy or the complicated challenge? Should I try to work the complicated one to be more CodeGolf-worthy?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="7773" LastActivityDate="2014-10-28T13:03:52.877" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2409" PostTypeId="2" ParentId="2402" CreationDate="2014-10-28T18:12:48.717" Score="5" Body="&lt;h1&gt;Count language. Ignore Version.&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rule&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Two languages are the same if they have the same name, excluding the version.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Java 7 and Java 8 count as one point.&lt;/p&gt;&#xA;&lt;p&gt;C and C++ count as two points.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-10-28T18:18:02.777" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2410" PostTypeId="2" ParentId="120" CreationDate="2014-10-28T18:13:26.277" Score="4" Body="&lt;p&gt;This appears to be a moot point, at least for the time being. &lt;a href=&quot;https://meta.stackexchange.com/a/242718/212780&quot;&gt;Asked on Meta&lt;/a&gt;, the response is that it would change the core functionality too much. This may change down the road, but it seems unlikely to me. &lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-10-28T18:13:26.277" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2411" PostTypeId="2" ParentId="2402" CreationDate="2014-10-28T18:13:52.540" Score="-10" Body="&lt;h1&gt;Count language. Count Version.&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rule&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Two languages are the same if they have the same name and version.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Java 7 and Java 8 count as two points.&lt;/p&gt;&#xA;&lt;p&gt;C and C++ count as two points.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-10-28T18:19:15.867" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2412" PostTypeId="2" ParentId="2402" CreationDate="2014-10-28T18:30:59.663" Score="3" Body="&lt;h1&gt;Make a list.&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rule&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Two languages are the same if they belong to the same class, as designated by the community.&lt;/p&gt;&#xA;&lt;p&gt;The community could develop a list stating that, for example, C and C++ belong to the same class. This is the most flexible method as it allows the community to reach a &amp;quot;best judgement&amp;quot;, but it probably requires a lot of overhead.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example List&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Class 1: C, C++&lt;/li&gt;&#xA;&lt;li&gt;Class 2: All versions of a particular language not present in another class&lt;/li&gt;&#xA;&lt;li&gt;Class 3: Python 2&lt;/li&gt;&#xA;&lt;li&gt;Class 4: Python 3&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Please note that I wouldn't actually count Python 2 and 3 separately. Just trying to demonstrate the flexibility of this method.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example Cases&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Java 7 and Java 8 count as one point.&lt;/p&gt;&#xA;&lt;p&gt;C and C++ count as one point.&lt;/p&gt;&#xA;&lt;p&gt;Python 2 and Python 3 count as two points.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-10-28T18:30:59.663" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2413" PostTypeId="2" ParentId="2402" CreationDate="2014-10-28T18:40:45.807" Score="-1" Body="&lt;h1&gt;The author is the judge.&lt;/h1&gt;&#xA;&lt;p&gt;This one is self explanatory.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-10-28T18:40:45.807" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2414" PostTypeId="2" ParentId="2402" CreationDate="2014-10-28T22:04:33.167" Score="11" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Can we come up with some standard rules for when two languages are considered different enough for the purposes of these challenges?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I seriously doubt it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Whether, e.g., C and C++ should count as different languages depends on the other winning criteria.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;For &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt;, C and C++ are probably not different enough to count as two languages. Writing code that simply works in both is trivial, so that would be an extra point without any effort.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/rosetta-stone&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;rosetta-stone&amp;#39;&quot; rel=&quot;tag&quot;&gt;rosetta-stone&lt;/a&gt; challenge, submitting a program that will work in C and C++ is probably going to lose in both categories. Counting them as two languages makes sense, since you'll have to write two different programs.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2014-10-28T22:04:33.167" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2415" PostTypeId="1" CreationDate="2014-10-29T01:13:28.893" Score="16" ViewCount="597" Body="&lt;p&gt;Calvin's Hobbies recently posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/40376/evolution-of-hello-world-testing-new-type-of-challenge&quot;&gt;Evolution of Hello World&lt;/a&gt;. The challenge is unique in several ways, but the most revolutionary is that the definition of &quot;valid answer&quot; depends on other answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This inspired several more answer-dependent&lt;sup&gt;1&lt;/sup&gt; questions (they're still in the sandbox). However, as discussed a bit in chat, these questions have some problems. For example, the finding the relevant answer(s) can be tricky, so it's not easy to figure out what needs to be done.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What do you think? Should&lt;sup&gt;2&lt;/sup&gt; answer-dependent questions be encouraged?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; These challenges have sometimes been called domino-coding. However, not all answer-dependent questions involve a chain reaction. One idea mentioned was a tree, where answers can depend on any previous answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;2&lt;/sup&gt; I'm not really asking about the original Evolution of Hello World challenge. I think it's interesting and unique enough that it easily outweighs any of the genre's problems. However, I'm much less certain about having dozens more of these questions.&lt;/p&gt;&#xA;" OwnerUserId="16294" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-11-13T19:03:13.497" Title="Answer-dependent questions" Tags="|discussion|scope|contest-type|" AnswerCount="3" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2416" PostTypeId="2" ParentId="2415" CreationDate="2014-10-29T08:31:35.850" Score="15" Body="&lt;p&gt;I would really like to make this challenge type work. (Full disclosure: partly because I seem to have come up with with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2404/8478&quot;&gt;a fairly popular challenge idea based on it&lt;/a&gt;. Mostly, though, because I genuinely think it's fun and novel.) But I do see a lot of problems.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Answers on SE have no inherent order, and forcing one onto them just feels odd. In the case of a linear chain, &quot;Sort by oldest&quot; happens to work reasonably well, but in a non-linear case like a tree or a &lt;a href=&quot;http://en.wikipedia.org/wiki/Directed_acyclic_graph&quot; rel=&quot;nofollow noreferrer&quot;&gt;DAG&lt;/a&gt;, it would be a real challenge to actually grasp the current structure of answers.&lt;/li&gt;&#xA;&lt;li&gt;For anything more trivial than &quot;Print &lt;code&gt;Hello World!&lt;/code&gt;&quot;, it will be seriously frustration if I worked on an answer for half and hour or more and someone else posts half a second before me. (In fact, even if someone posts when I just half-finished my submission it would be a waste of my time.) This is not a problem in non-linear cases.&lt;/li&gt;&#xA;&lt;li&gt;People make mistakes. Especially when the tasks get harder, it's very likely that some submission doesn't comply with the rules for one reason or another, and it might take a while for people to notice - in the meantime several new questions might have been posted. Now what should we do with that wrong question? Fix it? That might invalidated subsequent answers, depending on the fix and the type of challenge. Delete it? That makes the chain incomprehensible unless you're a high-rep user. Leave it? That would imply we're cool with rule-breaking answers now, which I hope we aren't.&lt;/li&gt;&#xA;&lt;li&gt;We're imposing a lot of restrictions which the SE system itself doesn't (and won't) impose. Examples include &quot;Users may not answer twice within X hours.&quot;, &quot;Users may not answer twice in a row.&quot;, &quot;Do not edit your submission.&quot; and, while this one hasn't been stated explicitly yet, &quot;Do not delete your (valid) submission.&quot; is actually equally important to keep the thread consistent.&lt;/li&gt;&#xA;&lt;li&gt;[There might be other problems. I'll amend this list, if I can think of any, or people point them out.]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I would really see those problems fixed, but I'm not sure we can fix them all. Here are a few suggestions which might be able to help with individual problems:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I suggested in chat that someone could write a user script which displays a navigation for the challenge. This could just be a list ordered by time of posting for linear challenges, or it could be an expandable/collapsible tree for even a nicely rendered DAG for non-linear challenges. Of course, this requires people to stick exactly to the desired answer format, so the script can parse the structure, and for the non-linear challenges it would probably &lt;em&gt;require&lt;/em&gt; everyone to install that user script. We might be able to put this in a Stack Snippet instead, which could be embedded in the challenge itself. This would go a long way towards to making the challenge more manageable for everyone and to keeping leader boards up-to-date (now that I think about it, this would be a great snippet for most challenges).&lt;/li&gt;&#xA;&lt;li&gt;As I said above, non-linear challenges would fix the problem of answering in parallel, but it would make the challenge a lot more confusing. Depending on the challenge, you'd have to check every path down the tree to figure out which path you want to &quot;reply&quot; to. Even if the challenge only depends on the latest answer in the chain (i.e. the leaf nodes of a tree or the sinks of a DAG), you'd still have to find all those answers first. Furthermore, there is still the case where I work on a submission for half an hour, and another answer comes in and I realise that I would rather reply to that one, which requires me to change my answer (and before I'm ready the same might happen again).&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I can think of two ways to deal with broken submissions.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Delete them and deal with holes in the chain. It really depends on the challenge if this is feasible or not.&lt;/li&gt;&#xA;&lt;li&gt;Answers need to be reviewed before people may reply to them. One possibility would be that you may only reply to another submission if that submission has two comments reading &quot;Confirmed&quot; from users which are neither yourself nor the author of that previous submission. The main issue I see with this is that uncommon languages or ones that are hard to test could get the challenge stuck for a while until two other people can actually review the submission.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;But most importantly, I don't think there is any way to enforce the restrictions SE was simply not built for. We're trying here to build a challenge based on the linear or tree-like structure of other forums or mailing lists, but SE simply puts no relation at all between answers. If we can make all the other problems work, I'm thinking we might be able to get away with it anyway (I mean, technically, in a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; a good answer will also depend on all previous answers), but we might need to work a bit harder before we get there.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt; I am now trying out several of my suggestions in &lt;a href=&quot;https://codegolf.stackexchange.com/q/41462/8478&quot;&gt;this challenge&lt;/a&gt;. In particular, I am requiring verification of answers before new ones are posted, and I've provided a Stack Snippet to help with the bookkeeping. I'll report back how this goes.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-11-13T19:03:13.497" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2417" PostTypeId="2" ParentId="2415" CreationDate="2014-10-29T09:22:54.677" Score="6" Body="&lt;p&gt;Thanks for posting this, I had been meaning to. Note that I'm trying out &lt;a href=&quot;https://codegolf.stackexchange.com/questions/40562/asciis-95-characters-95-movie-quotes&quot;&gt;another one of these&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;A few random notes and comments...&lt;/p&gt;&#xA;&lt;h1&gt;My original notion of these questions&lt;/h1&gt;&#xA;&lt;p&gt;An incremental answer question (or whatever we're calling it) has the following properties:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Each answer depends on the last by building upon it or using information in it in some way.&lt;/li&gt;&#xA;&lt;li&gt;Answers increase in difficulty to a point where additional answers are impractical or impossible.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;That's about it. Note that text replacement or unique languages or an answer time limit is not part of it. Though those features may be necessary for well bounded challenges.&lt;/p&gt;&#xA;&lt;p&gt;The tree structure was very much an afterthought, and would be very hard to manage. But it might make some really interesting contests.&lt;/p&gt;&#xA;&lt;h1&gt;Problems&lt;/h1&gt;&#xA;&lt;p&gt;The problems Martin mentioned are definitely present but we've done amazingly well policing the Hello World question. There may be a couple technically invalid answers but that doesn't necessarily detract from the rest, it just means that those two answers are stuck being invalid.&lt;/p&gt;&#xA;&lt;p&gt;One problem I've had is the scoring. I'm not 100% happy with either of my contests scoring mechanisms, since everything from most answers to byte count to last answer could be considered. The vast quantity of answers makes it hard to keep a more precise score equation updated.&lt;/p&gt;&#xA;&lt;h1&gt;Don't get too hyped&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/40376/evolution-of-hello-world-testing-new-type-of-challenge&quot;&gt;Evolution of &amp;quot;Hello World!&amp;quot;&lt;/a&gt; was something new and accessible, which is why I believe it did so well. I've noticed diminishing returns before for repeated challenge types so I'm not certain &lt;a href=&quot;https://codegolf.stackexchange.com/questions/40562/asciis-95-characters-95-movie-quotes&quot;&gt;ASCII&amp;#39;s 95 Characters...95 Movie Quotes&lt;/a&gt; will do so well. I may have just gotten lucky the first time. Even I am not totally confident that this type of challenge is here to stay.&lt;/p&gt;&#xA;&lt;h1&gt;Tag Possibilities&lt;/h1&gt;&#xA;&lt;p&gt;If the challenge type does take hold it will need a tag.&lt;/p&gt;&#xA;&lt;p&gt;I suggested [domino-coding] and [incremental-answers].&lt;/p&gt;&#xA;&lt;p&gt;It looks like we have [answer-dependent] here.&lt;/p&gt;&#xA;&lt;p&gt;Other things that spring to mind are [linked-list-&lt;em&gt;something&lt;/em&gt;] or [induction-&lt;em&gt;something&lt;/em&gt;].&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-10-29T09:22:54.677" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2418" PostTypeId="2" ParentId="1603" CreationDate="2014-10-29T18:25:40.677" Score="1" Body="&lt;p&gt;I am also currently planning a challenge that would be scored by me against an undisclosed set of test data. I was thinking about handling it as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;There will be an openly available set of example data, so that the contestants can estimate their score on their own. Also, the means to easily create new test sets will be made available.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I will regularly calculate and update the official score with my secret test set. I might decide to only do so after major updates of a solution, so as to discourage people from trying to randomly optimize their solution for the specific test set.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;After some fixed time&lt;/strong&gt; (say three weeks) &lt;strong&gt;without a change in scores&lt;/strong&gt; (no new answer and no updates to existing solutions) &lt;strong&gt;I will announce a winner and accept their answer&lt;/strong&gt;. Selecting a winner at some point, even while better answers might still be coming, should not be more of a problem than with other challenges.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;The challenge will remain open&lt;/strong&gt; and answers are still welcome. New clever answers will still gain upvotes.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;After I have announced a winner &lt;strong&gt;I will make the test set available&lt;/strong&gt;. This is to prove I did not cheat and it will allow users to grade answers even in the future when I might no longer follow the challenge too closely.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Of course, with the test data available, people may exploit that knowledge to gain better scores. However, I would trust on the community to still follow the spirit of the challenge and not give undue praise to uncreative exploits.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="29703" LastActivityDate="2014-10-29T18:25:40.677" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2419" PostTypeId="1" AcceptedAnswerId="2422" CreationDate="2014-10-29T20:18:31.413" Score="50" ViewCount="8238" Body="&lt;p&gt;One of the things many (new?) users forget to specify in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges is whether the answers should provide a full program or a function (or even just a snippet). For most such things, we have defaults in the tag wiki (like scoring by bytes), but not for this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The conclusion in chat was that such a default would be useful, so let's vote on what it should be.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/8478&quot;&gt;See here for the follow-up poll on input/output methods.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="68942" LastEditDate="2021-04-04T03:46:58.530" LastActivityDate="2021-04-04T03:46:58.530" Title="Default for Code Golf: Program, Function or Snippet?" Tags="|discussion|faq|policy|code-golf|defaults|" AnswerCount="6" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="2420" PostTypeId="2" ParentId="2419" CreationDate="2014-10-29T20:18:56.003" Score="-8" Body="&lt;h1&gt;We don't need a default&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Every question has to specify this.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-10-29T20:18:56.003" CommentCount="4" CommunityOwnedDate="2014-10-29T20:18:56.003" ContentLicense="CC BY-SA 3.0" />
  <row Id="2421" PostTypeId="2" ParentId="2419" CreationDate="2014-10-29T20:20:03.833" Score="-10" Body="&lt;h1&gt;The default should be &quot;programs only&quot;&lt;/h1&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-10-29T20:20:03.833" CommentCount="2" CommunityOwnedDate="2014-10-29T20:20:03.833" ContentLicense="CC BY-SA 3.0" />
  <row Id="2422" PostTypeId="2" ParentId="2419" CreationDate="2014-10-29T20:21:32.220" Score="100" Body="&lt;h1&gt;The default should be &quot;programs or functions&quot;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This includes function-like constructs, including J's verbs and GolfScript's and CJam's blocks.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2014-10-30T08:26:44.130" LastActivityDate="2014-10-30T08:26:44.130" CommentCount="11" CommunityOwnedDate="2014-10-29T20:21:32.220" ContentLicense="CC BY-SA 3.0" />
  <row Id="2423" PostTypeId="2" ParentId="2419" CreationDate="2014-10-29T20:22:44.627" Score="-18" Body="&lt;h1&gt;The default should be &quot;programs, functions or snippets&quot;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;By &quot;snippets&quot; I mean just a piece of code which expects the input to be stored in a hardcoded variable and stores the output in another hardcoded variable, or prints it.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-10-29T20:22:44.627" CommentCount="1" CommunityOwnedDate="2014-10-29T20:22:44.627" ContentLicense="CC BY-SA 3.0" />
  <row Id="2424" PostTypeId="1" AcceptedAnswerId="2428" CreationDate="2014-10-29T22:39:06.547" Score="19" ViewCount="777" Body="&lt;p&gt;Based on &lt;a href=&quot;http://php.net/manual/en/features.commandline.options.php&quot; rel=&quot;nofollow noreferrer&quot;&gt;this manual&lt;/a&gt;, there is a &lt;code&gt;-r&lt;/code&gt; option that allows you to run PHP code on the command line without specifying the code tags, &lt;code&gt;&amp;lt;? ?&amp;gt;&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I recommended it on the polyquine question, where &lt;a href=&quot;https://codegolf.stackexchange.com/a/37475/29438&quot;&gt;this answer&lt;/a&gt; code be considered a PHP quine if we used &lt;code&gt;-r&lt;/code&gt; or &lt;code&gt;-R&lt;/code&gt;. I'm pretty sure &lt;code&gt;-R&lt;/code&gt; is used like &lt;code&gt;php -R scriptname.php&lt;/code&gt; or something and then runs the script like it is in between code tags.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Coming from a Perl background, one-liners are often used to shorten the code. My answer &lt;a href=&quot;https://codegolf.stackexchange.com/a/37113/29438&quot;&gt;here&lt;/a&gt; is an example. The way we have been counting it for Perl one-liners are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each characters between the single quotes counts as a character.&lt;/li&gt;&#xA;&lt;li&gt;Each additional flag counts as a character.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I put &lt;code&gt;^&lt;/code&gt; under each character we count for the following one-liner just as an example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;echo &quot;test&quot; | perl -nle'print'&#xA;                    ^^  ^^^^^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which would count as 7 characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For PHP, can we do the same thing? For example in this program from that manual:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$ php -r '$foo = get_defined_constants(); var_dump($foo);'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We would count the characters in between &lt;code&gt;'&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think you'd be able to shorten &lt;a href=&quot;https://codegolf.stackexchange.com/a/40545/29438&quot;&gt;this answer&lt;/a&gt; with the trick.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There was a small discussion in the comments &lt;a href=&quot;https://codegolf.stackexchange.com/a/40486/29438&quot;&gt;here&lt;/a&gt; about it.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Would the &lt;code&gt;-r&lt;/code&gt; count as 0, 1, or 2 characters?&lt;/li&gt;&#xA;&lt;li&gt;Is this allowed?&lt;/li&gt;&#xA;&lt;li&gt;Should I recommend this when I see answers with &lt;code&gt;&amp;lt;? ?&amp;gt;&lt;/code&gt;?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I am not the best at PHP so I'm looking for some guidance.&lt;/p&gt;&#xA;" OwnerUserId="29438" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-02-13T01:37:30.453" Title="Running PHP with `-r` instead of code tags" Tags="|discussion|scoring|php|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2428" PostTypeId="2" ParentId="2424" CreationDate="2014-10-30T05:33:23.300" Score="13" Body="&lt;p&gt;&lt;code&gt;perl -e&lt;/code&gt; seems to be accepted without character penalty, so &lt;code&gt;php -r&lt;/code&gt; should be OK as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;php -R&lt;/code&gt; is the equivalent to &lt;code&gt;perl -ne&lt;/code&gt;, so &lt;code&gt;php -R scriptname.php&lt;/code&gt; is a syntax error.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;php -f file&lt;/code&gt;, &lt;code&gt;php -F file&lt;/code&gt; and plain &lt;code&gt;php file&lt;/code&gt; all execute &lt;code&gt;file&lt;/code&gt;, but none of them removes the need for PHP tags.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In &lt;code&gt;php -R code&lt;/code&gt; or &lt;code&gt;php -F file&lt;/code&gt;, the flag should be counted as one byte, just as in &lt;code&gt;perl -ne&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2014-10-30T05:33:23.300" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="2429" PostTypeId="2" ParentId="2415" CreationDate="2014-10-30T09:24:55.987" Score="3" Body="&lt;p&gt;I'm not sure how relevant this may be, but there recently appeared a &lt;a href=&quot;https://codegolf.stackexchange.com/q/38641/2381&quot;&gt;spontaneous acronym acrostic&lt;/a&gt;. So there's definitely a desire among the community for something more collaborative. These challenges achieve that, so get some wagons for this band.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/jsENC.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-10-30T09:24:55.987" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2430" PostTypeId="2" ParentId="2140" CreationDate="2014-10-30T10:47:33.840" Score="1" Body="&lt;h1&gt;Draw the Tree of Life&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt; contest to render the &lt;a href=&quot;http://www.treefam.org/static/download/treefam_species_tree9.phy&quot; rel=&quot;nofollow noreferrer&quot;&gt;tree of life data&lt;/a&gt; (which is in the simple &lt;a href=&quot;http://en.wikipedia.org/wiki/Newick_format&quot; rel=&quot;nofollow noreferrer&quot;&gt;Newick format&lt;/a&gt;) sideways in ASCII, using the same formatting as this example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   __/a&#xA;__/  \b&#xA;  \   _/c&#xA;   \_/ \d&#xA;     \e&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that the &lt;em&gt;distance&lt;/em&gt; in the source data is ignored; the tree should be drawn as compact as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The source data can be fed into the program via stdin or by opening a file or as a parameter to a function.  The output should be printing to stdout.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output should not be hard-coded; the tree data must be read in and parsed by the program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Actually printing a tree on its side is itself a bit of a coding challenge; see &lt;a href=&quot;https://stackoverflow.com/questions/11096134/print-a-binary-tree-on-its-side&quot;&gt;this SO question&lt;/a&gt; for inspiration.&lt;/p&gt;&#xA;" OwnerUserId="30869" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2014-10-30T11:28:17.720" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2431" PostTypeId="2" ParentId="1947" CreationDate="2014-10-30T14:03:12.220" Score="0" Body="&lt;h1&gt;We Need a Ruling&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;User &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/20260/xnor&quot;&gt;xnor&lt;/a&gt; was recently kind enough to warn me that &quot;the community&quot; frowns on art-related programming questions, although ample evidence in this thread and elsewhere suggests that &quot;the community&quot; is in fact a handful of individuals not representative of the greater consensus.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;This Thread&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Consider this meta thread, where user &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/20283/githubphagocyte&quot;&gt;githubphagocyte&lt;/a&gt;'s highly popular response is summarized thusly:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Recently there seems to have been a move towards voting to close questions that have an asthetic or artistic aspect, regardless of how much programming skill they require. I think it is important to discuss how much programming skill makes a question acceptable, because we are in danger of closing questions based on how much art is in them, rather than based on how much programming is in them. As I see it, you can't have too much art in a question, only too little programming.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;About a third as popular is xnor's response, which makes some distinctions clearer:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Code golf is clearly in the first category [of acceptable art challenges], as brevity pushes you to exploit intricacies of the language. Underhanded contests, even if sometimes maligned, reward using language features in sneaky ways. Fastest code pushes you to optimize both algorithms and computer cycles.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If the goal is simply to produce pretty art, and it's easy to write code to make whatever art you want, that's just a challenge where you program. In Tweetable Mathematical Art though, there's a harsh character restriction for the code, which definitely makes coding a challenge.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;referring to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35569/tweetable-mathematical-art&quot;&gt;this&lt;/a&gt; exceptionally popular code competition.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;No dissenting opinion has been penned in this discussion.&lt;/strong&gt; In other words, the observable consensus is that an art programming challenge should be allowed so long as programming is &lt;em&gt;a principle and integral component of the challenge&lt;/em&gt;. Furthermore,  the observable consensus holds that code golf necessitates a degree of programming mastery constituting such a challenge, which is an assessment I heartily endorse.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;On PPCG&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Dozens, if not hundreds, of art-based challenges exist on PPCG. They are invariably popular (both in terms of voting and participation), creative, and fascinating to behold. They range from simple creative challenges such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/36109/ascii-art-calendar&quot;&gt;ASCII Art Calendar&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/20209/ascii-art-hello-world&quot;&gt;ASCII Art &quot;Hello, World!&quot;&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/19123/draw-the-heart-shape&quot;&gt;Draw a Heart Shape&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/18986/draw-the-olympic-games-logo&quot;&gt;Draw the Olympic Games Logo&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/20646/create-an-analogue-clock&quot;&gt;Create an Analogue Clock&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/36190/dna-deoxyribonucleic-ascii&quot;&gt;Deoxyribonucleic ASCII&lt;/a&gt; to abstract challenges such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/24072/what-do-you-see-in-an-inkspot-rorschach-generation&quot;&gt;What do you see in an inkspot?&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35005/rearrange-pixels-in-image-so-it-cant-be-recognized-and-then-get-it-back/35382#35382&quot;&gt;Rearrange Pixels in an Image&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/22144/images-with-all-colors/22265#22265&quot;&gt;Images with all colours&lt;/a&gt; to broad, open-ended art challenges such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/20558/make-a-valentine-wish-with-your-favourite-language/20888#20888&quot;&gt;Make a Valentine Wish&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/24326/is-it-dark-outside-draw-a-sun-map&quot;&gt;Draw a Sun Map!&lt;/a&gt;,&lt;a href=&quot;https://codegolf.stackexchange.com/questions/35569/tweetable-mathematical-art&quot;&gt;Tweetable Mathematical Art&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35835/draw-random-black-and-white-forest&quot;&gt;Draw Random Black-and-White Forest&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/34887/make-a-circle-illusion-animation/34964#34964&quot;&gt;Make a Circle Illusion Animation&lt;/a&gt;, and many more.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are also several popular-but-closed challenges, with the notable observation that the de-artifying of PPCG began in roughly mid-2013, and that the same small pool of individuals is responsible for nearly all closures for questions of this type. I will not name names, but a quick survey of the &quot;[closed]&quot; questions when running a PPCG search for &quot;art&quot;, &quot;turtle&quot;, &quot;picture&quot;, etc. proves enlightening.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;On the Help Page&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The most unsettling aspect of PPCG de-artifying is that the stated reason for many of the closures, which is&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This question does not appear to be about programming puzzles or code golf within the scope defined in the help center.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;is demonstrably untrue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A good faith search of the PPCG help center yields absolutely no rules regarding the acceptability of art in programming challenges. Any mention of art programming is conspicuously absent from the &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;What topics can I ask about here?&lt;/a&gt; page that defines on-topicness. Likewise, art programming questions are nowhere mentioned in &lt;a href=&quot;https://codegolf.stackexchange.com/help/dont-ask&quot;&gt;What types of questions should I avoid asking?&lt;/a&gt;, which is fortunate given that most, if not all, of the excellent art programming challenges listed above would need to be closed for off-topicness if such a prohibition did appear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the absence of any kind of prohibition, a user new to the site might survey existing questions, which yields a vast corpus of popular, admissible art programming challenges ranging from the highly constrained to the highly abstract/open-ended. This same user might consult this discussion where the &lt;em&gt;obvious and uncontested consensus&lt;/em&gt; is that open-ended art challenges are permitted subject to certain clear restrictions, as described above in &quot;This Thread&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;My View&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;As xnor warned me, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/40675/program-an-artistically-rich-comic-strip&quot;&gt;this question&lt;/a&gt; was shut down almost immediately after being created, with the cited reason being off-topicness.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can accept a question being closed. There was no serious investment of time involved in creating it. What upsets me is that &lt;em&gt;absolutely nothing&lt;/em&gt; besides the opinions of a small (tiny, in the context of the full user pool) group of influential users appears to contraindicate this kind of challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Numerous similar challenges exist with the enthusiastic consent and support of the broader community prior to the &quot;anti-art&quot; era. The challenge is &lt;em&gt;exclusively&lt;/em&gt; accessible to expert programmers, with programming being the clear, primary sine qua non, meeting the standard laid out in the consensus in this thread. The challenge is in fact so programming-centric that I'm hard pressed to think of any kind of website aside from a code golf challenge board where such a challenge could reasonably be issued.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, and most importantly, &lt;strong&gt;nothing in the codified rules for this website contraindicate this type of challenge&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;A Definite Ruling&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I've barely been here three months. I've participated in many challenges and accrued a reasonable sum of &quot;rep&quot;, granting me the ability to vote to close any question that doesn't suit my fancy. If my personal opinion of what shouldn't be here happens to coincide with that of just four other users (out of thousands upon thousands), we can close a hundred challenges in a week if we want to. We could deem &quot;ASCII art&quot; inappropriate and liquidate the site. And perhaps we'd be justified in doing so if there was &lt;em&gt;anything anywhere&lt;/em&gt; besides our five completely undocumented opinions that we don't like ASCII art and so screw community content voting, nobody gets it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Moderators:&lt;/strong&gt; I would appreciate it (and I know it would help newer users) if &lt;em&gt;something somewhere&lt;/em&gt; was codified as to what is the appropriate cutoff between art and programming on this site--preferably in the help center. Explain why the litany of programming challenges above have stood unchallenged, while the litany of [closed] programming challenges have been closed. This thread, the clear community consensus, and the help center certainly don't explain it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is the anti-art era here to stay? We need a definitive ruling one way or another. My thanks for your consideration.&lt;/p&gt;&#xA;" OwnerUserId="31019" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2014-10-30T14:03:12.220" CommentCount="29" ContentLicense="CC BY-SA 3.0" />
  <row Id="2432" PostTypeId="2" ParentId="1947" CreationDate="2014-10-30T18:33:33.780" Score="4" Body="&lt;p&gt;I think there are two separate issues which sometimes occur together but not always. They relate to the two key requirements we (in theory, at least) impose on questions.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;1. Clear specification&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Some art questions are so imprecise that it's subjective whether or not an answer meets the requirements. &quot;Too broad&quot; is probably the best close reason, but I can see them attracting custom closure reasons.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;2. Objective primary winning criterion&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I anticipate the objection, &quot;&lt;em&gt;But &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; is objective&lt;/em&gt;&quot;. I disagree, but that's a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/305/194&quot;&gt;separate issue&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, where you have a pop-con question which is set up for voting on the aesthetic qualities of the output rather than of the code, it's gone off-topic for this site. A contest is not a programming contest if it doesn't measure programming skill.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2014-10-30T18:33:33.780" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2433" PostTypeId="2" ParentId="2140" CreationDate="2014-10-30T22:34:20.520" Score="0" Body="&lt;p&gt;This is an idea for an incremental answer-dependent question. I'm interested in comments. I will keep it here for a while and probably reword it at some point.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Print the name of the language of the previous answer&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The first answer to this question must print the name &lt;code&gt;Code-Golf&lt;/code&gt; without using any letters in &lt;code&gt;Code-Golf&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Each answer that follows will have to print the name of the previous language, but without using any characters in the previous program (you can use letters in the language name, but not the code they posted). Each language can only be used once.&lt;/p&gt;&#xA;&lt;p&gt;The winner is whoever posts the most valid answers. If there is a tie, then the length of each program is added together, and the answerer with the smallest total length is the winner.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;The main problem I see with this is that multiple people would be racing towards the next answer. Allowing people to still post answers they worked on would cause clutter, and if people sign up to be the next answerer, we could be waiting forever for one to post. You could possibly have another question for answers that were too slow.&lt;/p&gt;&#xA;&lt;p&gt;I would also need a rule against posting extraneous characters in your program that makes it impossible for the next one.&lt;/p&gt;&#xA;" OwnerUserId="29438" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-10-30T22:34:20.520" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2435" PostTypeId="2" ParentId="2140" CreationDate="2014-10-31T06:48:32.450" Score="0" Body="&lt;h1&gt;Elevator Controller&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Note&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I would love some feedback about whether you think this has enough room for algorithmic finesse to stick with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; or whether it should be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Any kind of early questions or ideas are welcome, too.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Every day on my way to work I have to take one of two neighboring elevators – and often, they are not currently on my floor, so I have to press a button and wait for it to stop by. Ever so often, I get the feeling the software behind these elevators was written by an army of monkeys who finally managed to type &lt;em&gt;some&lt;/em&gt; program that would compile.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But it makes me think: isn't there a more clever way to manage elevators? Maybe you can help me make my way to work less annoying by implementing a new controller software!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You must write a complete program that takes input from stdin (or similar) and print to stdout (or similar). Your program will receive the following arguments:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first line consists of two &lt;strong&gt;space&lt;/strong&gt;-separated numbers:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The number &lt;code&gt;N&lt;/code&gt; of neighboring elevators your software will have to manage.&lt;/li&gt;&#xA;&lt;li&gt;One integer &lt;code&gt;H&lt;/code&gt; specifying the number of the top floor level for the building (the ground floor level is marked &lt;code&gt;0&lt;/code&gt;, so &lt;code&gt;H = 5&lt;/code&gt; means there are six stories).&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;All subsequent lines of input are a &lt;strong&gt;space&lt;/strong&gt;-separated list of two numbers in the range &lt;code&gt;[0, H]&lt;/code&gt; with the following meaning:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first integer specifies the level on which a passenger is requesting an elevator.&lt;/li&gt;&#xA;&lt;li&gt;The second integer specifies the level this passenger would like to get to.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;During each time tick, your program must print (to stdout or similar) one line with &lt;code&gt;N&lt;/code&gt; characters wherein each character specifies what an elevator does (from left to right = first to last elevator). The following commands are available:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;D&lt;/code&gt; for &quot;Move elevator one level &lt;strong&gt;d&lt;/strong&gt;own.&quot;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;U&lt;/code&gt; for &quot;Move elevator one level &lt;strong&gt;u&lt;/strong&gt;p.&quot;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;S&lt;/code&gt; for &quot;&lt;strong&gt;S&lt;/strong&gt;top the elevator on this level.&quot; This command allows any number of passengers to enter or exit the elevator on this level. This will happen automatically and people will only exit the elevator on the level they want to get to.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Furthermore, all elevators are rather small and have a maximum capacity of &lt;code&gt;2&lt;/code&gt; people. So no elevator can take more than two people. Since people are generally nice, they apply a &lt;em&gt;first come, first serve&lt;/em&gt; pattern. Passengers who are &quot;too many&quot; will just wait the next turn.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If two (or more) elevators happen to stop on the same level with people waiting to enter, they will start filling up the elevators from left to right.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All &lt;code&gt;N&lt;/code&gt; elevators will start on the ground level – &lt;code&gt;0&lt;/code&gt; – upon start of the program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As always, standard loopholes apply. No cheating, no networking etc. If possible, please submit your answer with a link to an online interpreter or instructions on how to run it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2 3&#xA;2 0&#xA;3 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Possible Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;UU&#xA;UU&#xA;SU&#xA;DS&#xA;DD&#xA;SD&#xA;SS&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here are more examples, but to keep the post short, newlines are represented as &lt;code&gt;|&lt;/code&gt; and input/output is separated by &lt;code&gt;#&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2 3|0 1|0 2|0 3 # SS|UU|SU|UU|SS|US|SS&#xA;&#xA;1 2|0 1|1 2|1 0|1 0 # S|U|S|U|S|D|S|D|S&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;. There will be an unknown test case which I will only reveal after having accepted the winning answer (so you can make sure I didn't make scores up), but not before as to prevent answers optimizing for that test case only.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The score will be the number of steps your submission prints (= number of lines of your program's output). The lowest score wins with votes as a tiebreaker.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Verification&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You may use the following snippet to verify your submission:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TODO (I will write this once I plan on publishing this question)&lt;/p&gt;&#xA;" OwnerUserId="26765" LastEditorUserId="26765" LastEditDate="2014-10-31T13:56:58.230" LastActivityDate="2014-10-31T13:56:58.230" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2436" PostTypeId="1" AcceptedAnswerId="5378" CreationDate="2014-10-31T11:20:31.913" Score="8" ViewCount="119" Body="&lt;p&gt;This one looks pretty funny actually:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/rr9V3.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Found &lt;a href=&quot;https://codegolf.stackexchange.com/a/40747/8478&quot;&gt;in this answer&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is in Chrome 38 on Windows 8.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2015-06-04T12:39:45.017" Title="Code in Spoiler broken (again?)" Tags="|bug|status-completed|formatting|spoilers|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2437" PostTypeId="1" CreationDate="2014-10-31T11:32:53.987" Score="11" ViewCount="493" Body="&lt;p&gt;In &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2374/we-have-a-messy-sandbox?cb=1&quot;&gt;We Have a Messy Sandbox&lt;/a&gt; the consensus was that the best way to clean &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?answertab=active#tab-top&quot;&gt;our Sandbox&lt;/a&gt; is to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2379/26997&quot;&gt;delete posted challenges but keep abandoned ones&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The consensus also seemed to be that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;These deleted posts should be edited down to a simple link to the real challenge (presumably with the title of the real challenge as the link text, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2397/26997&quot;&gt;like this&lt;/a&gt;). This is so users with high-rep don't have the deleted challenges cluttering their screens.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Proposals that are duplicates or highly down voted or infeasible/impossible should also be deleted. Presumably their content can also be edited to reduce bulk.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Thus &lt;em&gt;&amp;quot;abandoned&amp;quot;&lt;/em&gt; means something that has been forgotten or never completed, but still has the potential to make a good challenge.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Can everyone agree on these rules? What other details should be mentioned?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I want this post to serve as a definitive guide for what people should and shouldn't delete in the sandbox. An obvious problem is that you can only delete posts that aren't your own if they are down-voted enough (maybe that changes at some rep level, I'm not sure), so besides the editing this seems like a mods only task.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Side Question: As many of you know I make a lot of challenges but almost never post them in the Sandbox so I'm not the best judge of Sandbox mechanics, I just think it looks messy. Do you think Sandbox improvements like this will really help new (or old) users post good challenges?&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox Deletion Rules&lt;/h1&gt;&#xA;&lt;p&gt;&lt;sup&gt;(I just made up the specifics, feel free to edit or suggest changes.)&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Once a challenge from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?answertab=active#tab-top&quot;&gt;the Sandbox&lt;/a&gt; has been posted to the &lt;a href=&quot;https://codegolf.stackexchange.com/questions&quot;&gt;main page&lt;/a&gt; it should be edited down to a single large header that is a link to the posted challenge, then deleted if possible (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2397/26997&quot;&gt;example&lt;/a&gt;):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  #[Title of Deleted Challenge](url of posted challenge)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;sup&gt;(What about comments?)&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The following only applies to Sandbox proposals that have been &lt;strong&gt;inactive for more than 3 weeks:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Proposals that are clear duplicates of existing questions should edited with a link to the duplicate and deleted if possible:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [Duplicate](url of original duplicate)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Proposals with a score of -3 or less should be edited to reduce bulk and deleted if possible.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Proposals that were otherwise already deleted should be edited to reduce bulk.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;sup&gt;(Anything else?)&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/q/5221/266052&quot;&gt;Meta: How Stack Exchange Deleting Works&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-10T23:02:13.743" Title="We Have a Messy Sandbox - Follow Up" Tags="|discussion|sandbox|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2438" PostTypeId="2" ParentId="2436" CreationDate="2014-10-31T11:34:52.603" Score="5" Body="&lt;p&gt;It is caused by this CSS rule:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.spoiler {&#xA;    color: #FFF9E3;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;All text is colored in the same color as the spoiler background, and so is the text in the code block.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A potential solution could be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.spoiler pre {&#xA;    background: #FFF9E3;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="9275" LastActivityDate="2014-10-31T11:34:52.603" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2439" PostTypeId="2" ParentId="2437" CreationDate="2014-10-31T11:42:03.197" Score="6" Body="&lt;p&gt;Normal users are not able to delete vote answers which don't have a negative score. So it would be great if one of our mods could go through the sandbox and delete every &lt;em&gt;posted&lt;/em&gt; challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The FAQ and Sandbox question should be updated to indicate that all future challenges should be deleted (by the author) after being posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That leaves inactive/incomplete/dropped proposals.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If they have a negative score there are usually some comments indicating that it's a duplicate, or just a bad idea or similar. In that case, I think everyone who can should delete vote (even at -1). Once they are deleted, I agree that they should be edited down, as well, to indicate the reason it was dropped and reduce clutter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for abandoned ideas, that were just forgotten or similar, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2091/8478&quot;&gt;we already have a consensus&lt;/a&gt; on the procedure for dealing with those - and if all the posted and dropped ones are deleted, it might actually be much easier to find the gems in the sandbox.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2014-10-31T11:42:03.197" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2440" PostTypeId="2" ParentId="2140" CreationDate="2014-10-31T13:45:12.210" Score="3" Body="&lt;h1&gt;Let's talk about this...&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I am planning on hosting a King of the Hill challenge in which bots will have to coordinate each other in order to be successful. The idea is to play a Diplomacy-like game between bots. The engine (still in development) will start the bots and communicate with them via stdin/stdout. There will be three phases:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;0. Initialization&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Well, this is not a recurring phase, it is just the engine telling each bot his id, the total number of bots participating and a seed, which can be used for generation of pseudo-random numbers (bots need to be deterministic).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;1. Talking Phase (10s)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the Talking phase, bots can send messages to each other (via engine) in order to coordinate their actions. To this end, a common language is necessary. This language should be able to express any ideas, plans and opinions a bot could have. However, not every bot is forced to be able to understand everything. Simpler bots might just ignore messages they do not understand.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since I would like each player to be able to submit more than one bot, it is forbidden to implement a &quot;secret handshake&quot; by which bots recognize each other and from then on work together unconditionally.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;2. Planning Phase (2s)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this phase, bots submit what they want to do this turn. Each bot has a certain amount of supply (initially five), and can command one action per supply point. There are three possible actions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Attack another bot&lt;/li&gt;&#xA;&lt;li&gt;Support another bot's attack against a third bot&lt;/li&gt;&#xA;&lt;li&gt;Defend another bot&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;There are some restrictions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Per opponent, you can &lt;em&gt;either&lt;/em&gt; attack or defend them, and only once&lt;/li&gt;&#xA;&lt;li&gt;You cannot support an attack against a bot you also defend&lt;/li&gt;&#xA;&lt;li&gt;You cannot attack, defend, support yourself or a dead bot, and neither can you support attacks against yourself&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;3. Resolution Phase (as short as possible)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After all orders have been submitted, the engine will resolve them simultaneously in the following way:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;em&gt;defending strength&lt;/em&gt; of each bot is the number of bots defending that bot.&#xA;The &lt;em&gt;attacking strength&lt;/em&gt; of each attack is the number of support orders for that attack.&#xA;Each attack with an attacking strength greater than the defending strength of the attacked bot results in the supply counter of the attacked bot being reduced by one, and the supply counter of the attacker being increased by one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Support orders which support a non-existent attack do nothing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then, all bots with supply of zero or less will be shut down by the engine: they died.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Afterwards, all remaining bots are informed about the decisions of other bots, and a new turn begins with its Talking Phase.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Further Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A game will consist of ten plus random number turns, so that &quot;last turn betrayals&quot; are not possible. The supply count of each bot will count towards their total score. I plan an ensemble of about 100 games. The bot with the highest total score wins. Tie-breaker will be the popularity (number of votes).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am interested in your opinion: do you think that this challenge is too complex? I imagine that the code of a decent bot would be too long to fit in a post. So people would have to use github or pastebin or similar to submit their entries. The main problem imo is the interpretation of the (yet to be determined) common language.&lt;/p&gt;&#xA;" OwnerUserId="30240" LastActivityDate="2014-10-31T13:45:12.210" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="2441" PostTypeId="1" CreationDate="2014-10-31T23:01:10.073" Score="4" ViewCount="276" Body="&lt;p&gt;Should an expression evaluating to a function &lt;em&gt;count as a function&lt;/em&gt; for the purpose of providing a solution when a function is asked for?  An &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1501/should-function-literals-be-allowed-when-a-function-is-asked-for&quot;&gt;earlier question on meta&lt;/a&gt; seems to indicate a consensus that it is fine to provide a function literal when &quot;a function&quot; is asked for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Many languages treat functions as first-class citizen, and allow operations on functions such as composition or binding variables.  What I wonder is if such expressions that evaluate to a function should be acceptable as an answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To illustrate the difference, below is an example of an explicit and a point-free function in Haskell, both yielding the same result.&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;\xs -&amp;gt; map succ xs            -- explicit (&quot;function literal&quot;)&#xA;map succ                      -- point-free (partial application due to currying)&#xA;&#xA;-- both behave the same&#xA;(\xs -&amp;gt; map succ xs) [1,2,3]  -- evaluates to [2,3,4]&#xA;(map succ) [1,2,3]            -- evaluates to [2,3,4]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This seems sufficiently different than the linked question to deserve one on its own.  So, what do you think?&lt;/p&gt;&#xA;" OwnerUserId="3918" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-12-29T10:59:00.780" Title="Should point-free function expressions be allowed when a function is asked for?" Tags="|discussion|code-golf|rules|" AnswerCount="1" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="2447" PostTypeId="1" CreationDate="2014-11-02T23:00:35.293" Score="127" ViewCount="38690" Body="&lt;p&gt;It looks like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2419/8478&quot;&gt;we have a consensus&lt;/a&gt; that we want certain defaults for the format which answers are expected in for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;. On that poll, the question arose twice, which input/output formats should be allowed for programs and functions.&lt;/p&gt;&#xA;&lt;p&gt;So here is another poll. This one works different though. All the input/output methods are independent of each other, so there will be one answer per method. Upvote all you think are reasonable for the default. Downvote those which you think shouldn't be allowed unless the OP explicitly permits them.&lt;/p&gt;&#xA;&lt;p&gt;To keep this remotely manageable, I have not posted individual answers for all possible inputs for functions. So there are only four: functions can take input/output via their arguments and return values. Or functions can use any method full programs can. I don't think there is any point in (say) allowing programs to take input from STDIN (only) and to allow functions to take input from ARGV (only) or something like that. If you disagree, please leave a comment.&lt;/p&gt;&#xA;&lt;p&gt;If I've overlooked an I/O method, feel free to add your own answer.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; Some votes have been reverted because they were detected as serial voting. If you vote on multiple answers, please leave some time between votes.&lt;/p&gt;&#xA;&lt;p&gt;A method is allowed if it has 5 net votes and at least twice as many upvotes as downvotes.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="91213" LastEditDate="2023-04-12T08:07:40.290" LastActivityDate="2024-03-16T21:17:23.590" Title="Default for Code Golf: Input/Output methods" Tags="|discussion|faq|policy|code-golf|defaults|" AnswerCount="117" CommentCount="2" FavoriteCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="2448" PostTypeId="2" ParentId="2447" CreationDate="2014-11-02T23:01:03.567" Score="129" Body="&lt;h1&gt;Programs may take input via STDIN&lt;/h1&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-11-02T23:01:03.567" CommentCount="0" CommunityOwnedDate="2014-11-02T23:01:03.567" ContentLicense="CC BY-SA 3.0" />
  <row Id="2449" PostTypeId="2" ParentId="2447" CreationDate="2014-11-02T23:03:02.997" Score="85" Body="&lt;h1&gt;Programs may take input via command-line arguments&lt;/h1&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-11-02T23:03:02.997" CommentCount="0" CommunityOwnedDate="2014-11-02T23:03:02.997" ContentLicense="CC BY-SA 3.0" />
  <row Id="2450" PostTypeId="2" ParentId="2447" CreationDate="2014-11-02T23:04:20.440" Score="123" Body="&lt;h1&gt;Programs may output to STDOUT&lt;/h1&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-11-02T23:04:20.440" CommentCount="0" CommunityOwnedDate="2014-11-02T23:04:20.440" ContentLicense="CC BY-SA 3.0" />
  <row Id="2451" PostTypeId="2" ParentId="2447" CreationDate="2014-11-02T23:05:28.557" Score="64" Body="&lt;h1&gt;Programs may output to STDERR&lt;/h1&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-11-02T23:05:28.557" CommentCount="8" CommunityOwnedDate="2014-11-02T23:05:28.557" ContentLicense="CC BY-SA 3.0" />
  <row Id="2452" PostTypeId="2" ParentId="2447" CreationDate="2014-11-02T23:07:19.627" Score="19" Body="&lt;h1&gt;Programs may take input from a file&lt;/h1&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-11-02T23:07:19.627" CommentCount="2" CommunityOwnedDate="2014-11-02T23:07:19.627" ContentLicense="CC BY-SA 3.0" />
  <row Id="2453" PostTypeId="2" ParentId="2447" CreationDate="2014-11-02T23:08:45.990" Score="55" Body="&lt;h1&gt;Programs may output to a file&lt;/h1&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-11-02T23:08:45.990" CommentCount="5" CommunityOwnedDate="2014-11-02T23:08:45.990" ContentLicense="CC BY-SA 3.0" />
  <row Id="2454" PostTypeId="2" ParentId="2447" CreationDate="2014-11-02T23:10:53.007" Score="131" Body="&lt;h1&gt;Functions may take input via function arguments&lt;/h1&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-11-02T23:10:53.007" CommentCount="3" CommunityOwnedDate="2014-11-02T23:10:53.007" ContentLicense="CC BY-SA 3.0" />
  <row Id="2455" PostTypeId="2" ParentId="2447" CreationDate="2014-11-02T23:12:22.000" Score="55" Body="&lt;h1&gt;Functions may take input via the same methods as full programs&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(This depends on how the poll goes, but could be any subset of STDIN, ARGV and file.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-11-02T23:12:22.000" CommentCount="4" CommunityOwnedDate="2014-11-02T23:12:22.000" ContentLicense="CC BY-SA 3.0" />
  <row Id="2456" PostTypeId="2" ParentId="2447" CreationDate="2014-11-02T23:13:50.543" Score="150" Body="&lt;h1&gt;Functions may output via their return value(s)&lt;/h1&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-11-02T23:13:50.543" CommentCount="9" CommunityOwnedDate="2014-11-02T23:13:50.543" ContentLicense="CC BY-SA 3.0" />
  <row Id="2457" PostTypeId="2" ParentId="2447" CreationDate="2014-11-02T23:15:16.273" Score="68" Body="&lt;h1&gt;Functions may output via the same methods as full programs&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(This depends on how the poll goes, but could be any subset of STDOUT, STDERR and file.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-11-02T23:15:16.273" CommentCount="7" CommunityOwnedDate="2014-11-03T01:33:44.950" ContentLicense="CC BY-SA 3.0" />
  <row Id="2458" PostTypeId="2" ParentId="2447" CreationDate="2014-11-03T00:07:26.740" Score="-21" Body="&lt;h1&gt;Dynamic creation of a &quot;fake&quot; STDIN, when one isn't present (creating also a separation between the code and the input).&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&#xA;For example, Javascript doesn't have &lt;code&gt;STDIN&lt;/code&gt;(for obvious reasons).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One could make something like &lt;code&gt;function(a){[code here]}&lt;/code&gt; and only count the content inside it + 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On php, one can read from &lt;code&gt;STDIN&lt;/code&gt; using &lt;code&gt;$f=fread(STDIN,1024);&lt;/code&gt; and this would count only as 2 chars.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On other languages, this would vary a bit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any questions, I may answer on the comments.&lt;/p&gt;&#xA;" OwnerUserId="14732" LastActivityDate="2014-11-03T00:07:26.740" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2459" PostTypeId="2" ParentId="2447" CreationDate="2014-11-03T00:10:36.253" Score="106" Body="&lt;h1&gt;Programs may take input via GUI prompts&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(This is for languages, for which this is the closest alternative to STDIN, like JavaScript's &lt;code&gt;prompt()&lt;/code&gt;, Mathematica's &lt;code&gt;Input[]&lt;/code&gt; or &lt;code&gt;InputString[]&lt;/code&gt;, Matlab's &lt;code&gt;input()&lt;/code&gt; and VBScript's &lt;code&gt;InputBox()&lt;/code&gt;.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="71806" LastEditDate="2018-03-10T08:53:44.503" LastActivityDate="2018-03-10T08:53:44.503" CommentCount="7" CommunityOwnedDate="2014-11-03T01:33:52.923" ContentLicense="CC BY-SA 3.0" />
  <row Id="2464" PostTypeId="2" ParentId="2447" CreationDate="2014-11-04T23:40:26.213" Score="-3" Body="&lt;h1&gt;Programs may use the camera and microphone&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I wouldn't expect to see this very often, but it could be applicable to my upcoming challenge.&lt;/p&gt;&#xA;" OwnerUserId="16472" LastActivityDate="2014-11-04T23:40:26.213" CommentCount="2" CommunityOwnedDate="2014-11-04T23:40:26.213" ContentLicense="CC BY-SA 3.0" />
  <row Id="2465" PostTypeId="1" CreationDate="2014-11-04T23:45:15.330" Score="6" ViewCount="88" Body="&lt;p&gt;I was about to post a question, when I noticed the sidebar:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/jYhY9.png&quot; alt=&quot;sidebar&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Shouldn't that be &lt;em&gt;programming puzzle&lt;strong&gt;s&lt;/strong&gt; or code golf&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="16472" LastEditorUserId="1144" LastEditDate="2014-11-05T15:07:51.887" LastActivityDate="2014-11-05T15:07:51.887" Title="Sidebar typo - can we fix this?" Tags="|feature-request|bug|status-completed|asking-questions|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2466" PostTypeId="2" ParentId="2465" CreationDate="2014-11-04T23:53:17.667" Score="7" Body="&lt;p&gt;Yeah, it should.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is the same text that is used in several other places on the site:&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/xpUuU.png&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;What's your $TOPIC$ question?&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/O6ZOd.png&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/whats-meta&quot;&gt;&lt;em&gt;rather than discussing $TOPIC$ itself.&lt;/em&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/2jEff.png&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/how-to-answer&quot;&gt;&lt;em&gt;...are not about $TOPIC$ as defined in the help center.&lt;/em&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I have to go right now, but when I have time I'll poke someone and ask to fix it (probably by adding an &lt;em&gt;s&lt;/em&gt;).&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2014-11-04T23:53:17.667" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2468" PostTypeId="2" ParentId="2465" CreationDate="2014-11-05T03:34:46.697" Score="8" Body="&lt;p&gt;The following is now live:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/meIyb.png&quot; alt=&quot;no grammer miss-steaks hear&quot;&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="24815" LastActivityDate="2014-11-05T03:34:46.697" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2472" PostTypeId="2" ParentId="2140" CreationDate="2014-11-07T18:25:17.380" Score="5" Body="&lt;h1&gt;The smallest circles&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a variant of the smallest-circle problem, but instead of one circle, you get three. Given a list of coordinates, output three circles such that the following conditions are met:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Each input coordinate must be located inside or on the perimeter of a circle.&lt;/li&gt;&#xA;&lt;li&gt;The sum of the radii of all three circles must be minimal.&lt;/li&gt;&#xA;&lt;li&gt;The coordinates and radii of all three circles must be non-negative integers.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;You must place all three circles. You may place overlapping circles. A circle with a radius of zero that is directly on top of an input coordinate is considered to be covering that input coordinate.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A list containing between 1 and 1000 pairs of integers, inclusive. Each pair of integers represents an xy-coordinate. Use whatever input format you want to use.&lt;/p&gt;&#xA;&lt;p&gt;For example, the input...&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;1,1;1,2;2,2;3,3&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;... can be drawn like this:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ZaikL.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZaikL.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A list of three integer triples. Each triple contains an x coordinate, followed by a y coordinate, followed by a radius. The triples, and the integers within each triple, must be distinguishable from one another. Otherwise, the output format is not important.&lt;/p&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;1,1,1;2,2,1;3,3,2&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Given this example output, circles would be drawn at (1,1), (2,2), and (3,3). The first two circles would have a radius of 1, and the third would have a radius of 2. The sum of the radii would be 4.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test case explained&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given the input...&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;1,1;1,2;2,2;3,3&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;... you could output...&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;1,2,1;3,3,0;0,0,0&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;... or you could output...&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;1/2/1&lt;br /&gt;&#xA;3/3/0&lt;br /&gt;&#xA;0/0/0&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The radii sums to 1, and since it is not possible to draw three circles whose radii sum to less than 1 that encompass or touch all four points, this is the correct answer.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt; (maybe &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt; too)&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-19T21:46:36.280" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="2473" PostTypeId="2" ParentId="2140" CreationDate="2014-11-08T02:05:29.567" Score="0" Body="&lt;p&gt;&lt;strong&gt;The Invincible Rock Paper Scissors&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Make a bot that plays Rock Paper Scissors with the player. The bot should prompt the user for input (either &lt;code&gt;rock&lt;/code&gt;, &lt;code&gt;paper&lt;/code&gt;, or &lt;code&gt;scissors&lt;/code&gt;) and then output the result. The result should include the user's hand, the bot's hand, and who won. An example of an acceptable result output would thus be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;I played rock! You played scissors! I won!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Another acceptable output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;The bot's rock beat the player's scissors.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is the underhanded part: the bot should &lt;em&gt;always win&lt;/em&gt;. However, the player has access to the source code of the program, so you should try and make the part of the code that causes the bot to always win as inconspicious as possible. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is an example in Python 2.x. If it were posted, it would not get many upvotes because it is extremely obvious that the bot will always win. A better answer would appear to be fair to the player, but in fact still causes the bot to win every time.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;user_choice = raw_input(&quot;Pick a hand (rock, paper, or scissors)...&quot;)&#xA;if user_choice == &quot;rock&quot;:&#xA;    print &quot;I played paper! You played rock! I won!&quot;&#xA;elif user_choice == &quot;paper&quot;:&#xA;    print &quot;I played scissors! You played paper! I won!&quot;&#xA;elif user_choice == &quot;scissors&quot;:&#xA;    print &quot;I played rock! You played scissors! I won!&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Concerns&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My main concern with this challenge is that it may be a close duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/q/31836/21682&quot;&gt;random script that isn't actually random&lt;/a&gt;. I am not sure if the requirement for having a different output for the user's input (while maintaining the illusion of randomness) is enough to differentiate this challenge from the original underhanded random challenge. Feedback on this issue is appreciated.&lt;/p&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.863" LastActivityDate="2014-11-08T02:05:29.567" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2474" PostTypeId="1" AcceptedAnswerId="2489" CreationDate="2014-11-08T10:38:40.553" Score="6" ViewCount="131" Body="&lt;p&gt;If I try to post an answer in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/344&quot;&gt;Sandbox for Proposed Challenges&lt;/a&gt;, it tells me the following:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This question has more than 30 answers already.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Did you read through all the existing answers first to make sure your answer will be contributing something new?&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Also, please note that you can click the edit link on any of these answers to improve them.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'm not sure if this warning is entirely appropriate. Would it be possible to disable it for the sandbox?&lt;/p&gt;&#xA;" OwnerUserId="344" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2014-12-02T01:28:52.547" Title="Posting in sandbox tells me it has more than 30 answers" Tags="|bug|status-declined|answers|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2476" PostTypeId="2" ParentId="2140" CreationDate="2014-11-08T18:46:46.933" Score="2" Body="&lt;h1&gt;Convert Images to NetPBM format&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;NetPBM format is perhaps the most important image format in the history of computer graphics.  Critics have called it &quot;the format of our time.&quot;  What is so revolutionary about NetPBM, you may ask?  It has the unparalleled ability to store images as text files!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You have been tasked with converting images from their ancient, &quot;lossy&quot; format to the lossless full-color NetPBM PPM (P3) format.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Specifics&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You have a few choices as to which file format you wish to process into a PPM file.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;JPEG&lt;/li&gt;&#xA;&lt;li&gt;GIF&lt;/li&gt;&#xA;&lt;li&gt;TIFF&lt;/li&gt;&#xA;&lt;li&gt;PNG&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Choose wisely.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The file created by your program should adhere to the P3 specifications.  Here are the parts of a P3 file listed out:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The characters &quot;P3&quot; followed by whitespace.&lt;/li&gt;&#xA;&lt;li&gt;An ASCII decimal number (like &quot;4&quot;) which represents the image width in pixels, followed by whitespace.&lt;/li&gt;&#xA;&lt;li&gt;An ASCII decimal number (like &quot;3&quot;) which represents the image height in pixels, followed by whitespace.&lt;/li&gt;&#xA;&lt;li&gt;An ASCII decimal number (like &quot;255&quot;) which is to represent maximum pixel intensity.  It can be an integer from 1 to 65535, inclusive.  It is followed by whitespace.&lt;/li&gt;&#xA;&lt;li&gt;After this there is one line per row of pixels:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Each row is separated by whitespace&lt;/li&gt;&#xA;&lt;li&gt;Each row contains one triplet for each pixel in that row, with the pixels separated by whitespace&lt;/li&gt;&#xA;&lt;li&gt;Each pixel consists of three ASCII decimal numbers separated by whitespace.  These numbers represent the RGB values of that pixel, in that order.  Each number must be an integer from 0-MAX, inclusive, where MAX is the number listed earlier.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Here is an example of PPM format ripped from Wikipedia:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;P3&#xA;3 2&#xA;255&#xA;255   0   0     0 255   0     0   0 255&#xA;255 255   0   255 255 255     0   0   0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is code golf: the shortest submission wins.  Standard code golf rules apply.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2014-11-08T18:46:46.933" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2481" PostTypeId="1" AcceptedAnswerId="2482" CreationDate="2014-11-09T10:08:11.217" Score="5" ViewCount="305" Body="&lt;p&gt;In Fortran 77 (and probably older ones), you require six spaces before each line. This makes it incredibly difficult to golf, so should we count those spaces in the byte/character count?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;http://homepage.cs.uiowa.edu/~jones/cards/collection/fortran.gif&quot; alt=&quot;Fortran punch card&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="30525" LastEditDate="2014-11-09T11:06:15.680" LastActivityDate="2014-11-09T14:30:16.997" Title="Count the spaces in Fortran Programs?" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2482" PostTypeId="2" ParentId="2481" CreationDate="2014-11-09T14:30:16.997" Score="12" Body="&lt;h2&gt;Yes, count them&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Every language has its pros and cons, but that doesn't mean that every language should get special treatment. If the person posing a question wants to set up a complicated handicap system then that's their decision, but the default assumption should be that a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; program's score is the size that a tool such as &lt;code&gt;wc&lt;/code&gt; would report for the source file, with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19/194&quot;&gt;appropriate adjustments for special flags&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.357" LastActivityDate="2014-11-09T14:30:16.997" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2483" PostTypeId="2" ParentId="2140" CreationDate="2014-11-09T16:25:09.650" Score="6" Body="&lt;h1&gt;The Secret Handshake&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is based off of this &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges#comment10392_2440&quot;&gt;sandbox comment&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is a challenge of secrecy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal of this KOTH is to write a program that is capable of identifying itself amongst a crowd of other programs.  In order to do this, you must develop a secret handshake which will be recognized only by other copies of the same program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A single game involves every program competing at once.  There will be five instances of each program in the arena, and the winner will be the first program to correctly identify the four other copies.  After a large number of games, the submission with the most victories will be the overall winner.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Gameflow:&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Each program receives a number which tells the number of bots in the arena, which is five times the number of submissions.  The bots are arranged in a circle, and they are each considered ID #0 from their own perspective, with N-1 being the maximum ID number.&lt;/li&gt;&#xA;&lt;li&gt;Then the game cycle starts.  At this point, each bot will be awaiting input.&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Your bot will receive input consisting of an ID number and an optional message.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For example, &lt;code&gt;7 hi&lt;/code&gt; means that bot #7 said &lt;code&gt;hi&lt;/code&gt; to you.&lt;/li&gt;&#xA;&lt;li&gt;If the ID number is 0, then there will not be a message.  This would occur if it is your turn but there is no message to receive.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Now, your bot is allowed to output a guess consisting of four ID numbers.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If those four numbers are the IDs of your teammates, then your team will win that game.&lt;/li&gt;&#xA;&lt;li&gt;You will receive no confirmation of an incorrect guess.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Next, you must output a message to send.  The message will be a destination ID number followed by up to 3* characters.  Example messages: &lt;code&gt;7&lt;/code&gt; &lt;code&gt;4 w&lt;/code&gt; &lt;code&gt;12 #?Q&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;*This number is subject to change.  Larger messages make it harder to fake a secret handshake.  I hope that a very short message forces people to use multi-step handshakes.  It might also be interesting to limit it to 1-character messages.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox Notes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Something that I haven't quite figured out is how the controller program will determine which bot gets to move each turn.  I suppose it would be simplest go in order: Each bot has an &quot;unread message queue&quot; and receives/sends one message each turn.  The bot immediately after you (ID #1) then moves next.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Alternatively, there could be a set turn order which is unrelated to the ID order, simply to make it impossible for one bot to tell which bot moves next.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2016-07-30T13:20:25.467" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2484" PostTypeId="1" AcceptedAnswerId="2485" CreationDate="2014-11-10T05:36:17.037" Score="4" ViewCount="66" Body="&lt;p&gt;I would like to be notified when a question is posted with a particular tag. I can't see any way of configuring this within the PPCG site. I am sure the SE people would not like lots of bots constantly reading listings by tag, looking for changes. Am I missing something? Is there a way to turn on such a notification?&lt;/p&gt;&#xA;" OwnerUserId="31785" LastEditorUserId="68942" LastEditDate="2021-06-09T05:44:57.200" LastActivityDate="2021-06-09T05:44:57.200" Title="Notification for new question with a specified tag?" Tags="|feature-request|status-completed|tags|notifications|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2485" PostTypeId="2" ParentId="2484" CreationDate="2014-11-10T05:41:34.863" Score="7" Body="&lt;p&gt;Yes, there are two ways to do this:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;If you are following a single tag, probably the easiest thing to do is to go to the tag page (e.g., &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot;&gt;https://codegolf.stackexchange.com/questions/tagged/code-golf&lt;/a&gt;), then go to the bottom of the page and save the feed link. You can use this feed with any feed software of your choice.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you are following multiple tags, or if you prefer to get email notifications, you can use the Stack Exchange filters feature at &lt;a href=&quot;http://stackexchange.com/filters&quot;&gt;http://stackexchange.com/filters&lt;/a&gt;. This allows you to set up filters for multiple tags, or specific sites, or whatever you want. Then you can either set up an email subscription (at most one message every 15 minutes), or you can use the feed link with your favorite feed software.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Related: &lt;a href=&quot;http://qr.ae/mpIvw&quot; rel=&quot;nofollow noreferrer&quot;&gt;My answer to How can I filter questions on Stack Overflow so I only see question of tags I'm interested in?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-11-10T05:47:28.950" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2486" PostTypeId="1" AcceptedAnswerId="2487" CreationDate="2014-11-10T08:33:22.073" Score="0" ViewCount="103" Body="&lt;p&gt;The other day I had idea on how to troll my colleague, which was &quot;underhand bejeweled&quot; - favorite procrastination tool for both of us. And the idea is basically &quot;program me bejeweled which cannot be lost&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Being pretty junior programmer myself, I have idea that &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;I cannot complete it myself&lt;/li&gt;&#xA;&lt;li&gt;If I ask it here as underhand challenge, the code output would be pretty huge&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;So, long story short:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How much code challenge for underhand is too much? And would that question be on-topic here?&lt;/p&gt;&#xA;" OwnerUserId="32729" LastActivityDate="2014-11-10T10:09:11.697" Title="How much code is too much?" Tags="|discussion|support|underhanded|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2487" PostTypeId="2" ParentId="2486" CreationDate="2014-11-10T10:09:11.697" Score="5" Body="&lt;p&gt;&quot;program me bejeweled which cannot be lost&quot; is &lt;em&gt;very&lt;/em&gt; broad and is likely to be closed as &quot;too broad&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can make it less broad though, by adding more specification, for example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Specify how you cannot lose, for example: by using cheat codes, by giving optimal tiles (and specify 'optimal tiles') ...&lt;/li&gt;&#xA;&lt;li&gt;Specify how the graphics should look like: ASCII, images ...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You'll also have to specify the winning criterion: for a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, you need to have a very clear spec. If it's a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, you should still leave some room for creativity, but keep in mind that it should be a &lt;em&gt;programming&lt;/em&gt; contest and not a &quot;build the best game&quot; contest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I suggest posting your challenge in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/9275&quot;&gt;Sandbox&lt;/a&gt;, then people can comment on it and suggest improvements before the challenge gets posted on the main site.&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2014-11-10T10:09:11.697" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2489" PostTypeId="2" ParentId="2474" CreationDate="2014-11-10T16:11:16.570" Score="6" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Did you read through all the existing answers first to make sure your answer will be contributing something new?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't think this is inappropriate at all. You might not need to read &lt;em&gt;all&lt;/em&gt; of the existing answers, but you should at least run a search to see if something similar has been suggested before. If so, you may notice issues that would naturally come up in your challenge. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Either way, it's at most a reminder to check for duplicates.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Also, please note that you can click the edit link on any of these answers to improve them.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This only really applies if you &lt;em&gt;did&lt;/em&gt; find an almost identical post. It's probably not worded perfectly for the sandbox, but I don't see why it would be worth developer time to customize the warning for a single question on a single meta.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2014-11-10T16:11:16.570" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2490" PostTypeId="1" AcceptedAnswerId="2492" CreationDate="2014-11-10T17:26:32.653" Score="11" ViewCount="423" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2404/8478&quot;&gt;I would like&lt;/a&gt; to make &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2416/8478&quot;&gt;answer-dependent challenges&lt;/a&gt; work. To that end, I suggested including a Stack Snippet in the question which gives an overview over the existing questions as well as some other useful meta information, and maybe a leaderboard (details depend on the particular challenge).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main thing I want to do for my own challenge is get some information from all answer bodies (you can assume a fixed answer format), and check that a certain comment is present (let's say &quot;Correctness verified&quot;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So what's the best way to scrape answer and comments in a Stack Snippet? I suppose I should request the page with an additional web request, because the Snippet can probably not access the DOM of the page. Other things to keep in mind are pagination and collapsed comment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also how could I test such a Snippet?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I'm kinda hoping, this question here will produce some nice reusable answers for future challenges.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2014-11-11T15:18:15.443" Title="Scraping answers and comments with a Stack Snippet" Tags="|discussion|answers|stack-snippets|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2491" PostTypeId="2" ParentId="2490" CreationDate="2014-11-10T17:36:09.490" Score="6" Body="&lt;p&gt;Use the Stack Exchange API to collect the data: &lt;a href=&quot;http://api.stackexchange.com/&quot;&gt;http://api.stackexchange.com/&lt;/a&gt;&lt;br&gt;&#xA;Then you don't have to access and parse the DOM, you'll only have to parse the answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Testing can be done at the &lt;a href=&quot;https://meta.stackoverflow.com/q/269754/2619912&quot;&gt;Stack Snippets Sandbox&lt;/a&gt; on Meta Stack Overflow. You could create a snippet and test it there on one of the existing answer-dependent challenges.&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="-1" LastEditDate="2017-03-20T09:16:37.593" LastActivityDate="2014-11-10T17:36:09.490" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2492" PostTypeId="2" ParentId="2490" CreationDate="2014-11-10T18:30:34.557" Score="10" Body="&lt;h1&gt;Sort answers by score snippet&lt;/h1&gt;&#xA;&lt;p&gt;This is a version &lt;s&gt;1&lt;/s&gt; 2 of a snippet that can sort and list all answers to a question in increasing order of the score.&lt;/p&gt;&#xA;&lt;p&gt;This snippet recognizes various different style of answer headings, but suggestions welcome for the ones which are missed out by the snippet.&lt;/p&gt;&#xA;&lt;p&gt;The script will filter out answers who do not have a heading with a proper score.&lt;/p&gt;&#xA;&lt;p&gt;Many thanks to @Martin Büttner for help with regex&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;[Update]&lt;/strong&gt; New features in version 2:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Added the accepted answer tick mark&lt;/li&gt;&#xA;&lt;li&gt;Added permalink for the answer&lt;/li&gt;&#xA;&lt;li&gt;Added the answered relative and UTC time information&lt;/li&gt;&#xA;&lt;li&gt;Fixed the &lt;code&gt;shouldHaveScore&lt;/code&gt; filter's regex&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Run the snippet below to see the answers of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/3532/enumerate-all-palindromic-numbers-in-decimal-between-0-and-n&quot;&gt;this question&lt;/a&gt; sorted by score.&lt;/p&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;var QUESTION_ID = 3532; // Obtain this from the url&#xA;// It will be like http://XYZ.stackexchange.com/questions/QUESTION_ID/... on any question page&#xA;&#xA;var answers = [], page = 1;&#xA;&#xA;var SCORE_REG = /\d+(?=[^\d&amp;amp;]*(?:&amp;amp;lt;(?:s&amp;amp;gt;[^&amp;amp;]*&amp;amp;lt;\/s&amp;amp;gt;|[^&amp;amp;]+&amp;amp;gt;)[^\d&amp;amp;]*)*$)/;&#xA;&#xA;function url(index) {&#xA;  return &quot;http://api.stackexchange.com/2.2/questions/&quot; +  QUESTION_ID + &quot;/answers?page=&quot; + index + &quot;&amp;amp;pagesize=100&amp;amp;order=desc&amp;amp;sort=votes&amp;amp;site=codegolf&amp;amp;filter=!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe&quot;;&#xA;}&#xA;&#xA;function getAnswers() {&#xA;  $.ajax({&#xA;    url: url(page++),&#xA;    method: &quot;get&quot;,&#xA;    dataType: &quot;jsonp&quot;,&#xA;    crossDomain: true,&#xA;    success: function (data) {&#xA;      answers.push.apply(answers, data.items);&#xA;      if (data.has_more) getAnswers();&#xA;      else process()&#xA;    }&#xA;  });&#xA;}&#xA;&#xA;getAnswers();&#xA;&#xA;function shouldHaveHeading(a) {&#xA;  var pass = false;&#xA;  try {&#xA;    pass |= /^(#|&amp;amp;lt;h).*/.test(a.body_markdown);&#xA;    pass |= [&quot;-&quot;, &quot;=&quot;]&#xA;              .indexOf(a.body_markdown.split(&quot;\n&quot;)[1][0]) &amp;gt; -1;&#xA;  } catch (ex) {}&#xA;  return pass;&#xA;}&#xA;&#xA;function shouldHaveScore(a) {&#xA;  var pass = false;&#xA;  try {&#xA;    pass |= SCORE_REG.test(a.body_markdown.split(&quot;\n&quot;)[0]);&#xA;  } catch (ex) {}&#xA;  return pass;&#xA;}&#xA;&#xA;function getRelDate(previous) {&#xA;&#xA;  var current = Date.now();&#xA;  var msPerMinute = 60 * 1000;&#xA;  var msPerHour = msPerMinute * 60;&#xA;  var msPerDay = msPerHour * 24;&#xA;  var msPerMonth = msPerDay * 30;&#xA;  var msPerYear = msPerDay * 365;&#xA;&#xA;  var elapsed = current - previous;&#xA;&#xA;  if (elapsed &amp;lt; msPerMinute) {&#xA;    return Math.round(elapsed/1000) + ' seconds ago';&#xA;  }&#xA;&#xA;  if (elapsed &amp;lt; msPerHour) {&#xA;    return Math.round(elapsed/msPerMinute) + ' minutes ago';&#xA;  }&#xA;&#xA;  if (elapsed &amp;lt; msPerDay ) {&#xA;    return Math.round(elapsed/msPerHour ) + ' hours ago';&#xA;  }&#xA;&#xA;  if (elapsed &amp;lt; msPerMonth) {&#xA;    return 'approx. ' + Math.round(elapsed/msPerDay) + ' days ago';&#xA;  }&#xA;&#xA;  if (elapsed &amp;lt; msPerYear) {&#xA;    return 'approx. ' + Math.round(elapsed/msPerMonth) + ' months ago';&#xA;  }&#xA;&#xA;  return 'approx. ' + Math.round(elapsed/msPerYear ) + ' years ago';&#xA;&#xA;}&#xA;&#xA;function process() {&#xA;  answers = answers.filter(shouldHaveHeading);&#xA;  answers = answers.filter(shouldHaveScore);&#xA;  answers.sort(function (a, b) {&#xA;    var aB = +(a.body_markdown.split(&quot;\n&quot;)[0].match(SCORE_REG) || [Infinity])[0],&#xA;        bB = +(b.body_markdown.split(&quot;\n&quot;)[0].match(SCORE_REG) || [Infinity])[0];&#xA;    return aB - bB&#xA;  });&#xA;  answers.forEach(function (a) {&#xA;    var answer = $(&quot;#answer-template&quot;).html();&#xA;    answer = answer.replace(&quot;{{BODY}}&quot;, a.body)&#xA;                   .replace(&quot;{{NAME}}&quot;, a.owner.display_name)&#xA;                   .replace(&quot;{{REP}}&quot;, a.owner.reputation)&#xA;                   .replace(&quot;{{VOTES}}&quot;, a.score)&#xA;                   .replace(&quot;{{DATE}}&quot;, new Date(a.creation_date*1e3).toUTCString())&#xA;                   .replace(&quot;{{REL_TIME}}&quot;, getRelDate(a.creation_date*1e3))&#xA;                   .replace(&quot;{{POST_LINK}}&quot;, a.share_link)&#xA;                   .replace(/{{USER_LINK}}/g, a.owner.link)&#xA;                   .replace('{{img}}=&quot;&quot;', &quot;src=\&quot;&quot; + a.owner.profile_image + '&quot;');&#xA;    answer = $(answer);&#xA;    if (a.is_accepted) {&#xA;      answer.find(&quot;.vote-accepted-on&quot;).removeAttr(&quot;style&quot;);&#xA;    }&#xA;    $(&quot;#answers&quot;).append(answer);&#xA;  });&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-css lang-css prettyprint-override&quot;&gt;&lt;code&gt;body { text-align: left !important}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xA;&amp;lt;link rel=&quot;stylesheet&quot; type=&quot;text/css&quot; href=&quot;//cdn.sstatic.net/codegolf/all.css?v=83c949450c8b&quot;&amp;gt;&#xA;&amp;lt;div id=&quot;answers&quot;&amp;gt;&amp;lt;/div&amp;gt;&#xA;&amp;lt;div id=&quot;answer-template&quot; style=&quot;display: none&quot;&amp;gt;&#xA;&amp;lt;div class=&quot;answer&quot; &amp;gt;&#xA;  &amp;lt;table&amp;gt;&#xA;    &amp;lt;tbody&amp;gt;&amp;lt;tr&amp;gt;&#xA;      &amp;lt;td class=&quot;votecell&quot;&amp;gt;&#xA;        &amp;lt;div class=&quot;vote&quot;&amp;gt;&#xA;          &amp;lt;span style=&quot;cursor: pointer;&quot; title=&quot;Total Votes&quot; itemprop=&quot;upvoteCount&quot; class=&quot;vote-count-post &quot;&amp;gt;{{VOTES}}&amp;lt;/span&amp;gt;&#xA;          &amp;lt;span style=&quot;display: none&quot; class=&quot;vote-accepted-on load-accepted-answer-date&quot; title=&quot;The question owner accepted this as the best answer&quot;&amp;gt;accepted&amp;lt;/span&amp;gt;&#xA;        &amp;lt;/div&amp;gt;&#xA;      &amp;lt;/td&amp;gt;&#xA;      &amp;lt;td class=&quot;answercell&quot;&amp;gt;&#xA;        &amp;lt;div class=&quot;post-text&quot; itemprop=&quot;text&quot;&amp;gt;{{BODY}}&amp;lt;/div&amp;gt;&#xA;        &amp;lt;table class=&quot;fw&quot;&amp;gt;&#xA;          &amp;lt;tbody&amp;gt;&amp;lt;tr&amp;gt;&#xA;            &amp;lt;td class=&quot;vt&quot;&amp;gt;&#xA;              &amp;lt;div class=&quot;post-menu&quot;&amp;gt;&#xA;                &amp;lt;a href=&quot;{{POST_LINK}}&quot; title=&quot;short permalink to this answer&quot; class=&quot;short-link&quot;&amp;gt;share&amp;lt;/a&amp;gt;&#xA;              &amp;lt;/div&amp;gt;&#xA;            &amp;lt;/td&amp;gt;&#xA;            &amp;lt;td class=&quot;post-signature&quot; align=&quot;right&quot;&amp;gt;&#xA;              &amp;lt;div class=&quot;user-info &quot;&amp;gt;&#xA;                &amp;lt;div class=&quot;user-action-time&quot;&amp;gt;answered &amp;lt;span title=&quot;{{DATE}}&quot; class=&quot;relativetime&quot;&amp;gt;{{REL_TIME}}&amp;lt;/span&amp;gt;&#xA;                &amp;lt;/div&amp;gt;&#xA;                &amp;lt;div class=&quot;user-gravatar32&quot;&amp;gt;&#xA;                &amp;lt;/div&amp;gt;&#xA;                &amp;lt;div class=&quot;user-details&quot;&amp;gt;&#xA;                  &amp;lt;br&amp;gt;&#xA;                &amp;lt;/div&amp;gt;&#xA;              &amp;lt;/div&amp;gt;&#xA;            &amp;lt;/td&amp;gt;&#xA;            &amp;lt;td class=&quot;post-signature&quot; align=&quot;right&quot;&amp;gt;   &#xA;              &amp;lt;div class=&quot;user-info user-hover&quot;&amp;gt;&#xA;                &amp;lt;div class=&quot;user-action-time&quot;&amp;gt;&#xA;                &amp;lt;/div&amp;gt;&#xA;                &amp;lt;div class=&quot;user-gravatar32&quot;&amp;gt;&#xA;                  &amp;lt;a href=&quot;{{USER_LINK}}&quot;&amp;gt;&#xA;                    &amp;lt;div class=&quot;gravatar-wrapper-32&quot;&amp;gt;&#xA;                      &amp;lt;img {{img}} alt=&quot;&quot; height=&quot;32&quot; width=&quot;32&quot;&amp;gt;&#xA;                    &amp;lt;/div&amp;gt;&#xA;                  &amp;lt;/a&amp;gt;&#xA;                &amp;lt;/div&amp;gt;&#xA;                &amp;lt;div class=&quot;user-details&quot;&amp;gt;&#xA;                  &amp;lt;a href=&quot;{{USER_LINK}}&quot;&amp;gt;{{NAME}}&amp;lt;/a&amp;gt;&amp;lt;br&amp;gt;&#xA;                  &amp;lt;span class=&quot;reputation-score&quot; title=&quot;reputation score &quot; dir=&quot;ltr&quot;&amp;gt;{{REP}}&amp;lt;/span&amp;gt;&#xA;                &amp;lt;/div&amp;gt;&#xA;              &amp;lt;/div&amp;gt;&#xA;            &amp;lt;/td&amp;gt;&#xA;            &amp;lt;/tr&amp;gt;&#xA;          &amp;lt;/tbody&amp;gt;&#xA;        &amp;lt;/table&amp;gt;&#xA;      &amp;lt;/td&amp;gt;&#xA;      &amp;lt;/tr&amp;gt;&#xA;    &amp;lt;/tbody&amp;gt;&#xA;  &amp;lt;/table&amp;gt;&#xA;&amp;lt;/div&amp;gt;&#xA;&amp;lt;/div&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;NOTE: Before trying to reuse the snippet, do make sure to change the value of the &lt;code&gt;QUESTION_ID&lt;/code&gt; variable at the top of the JS code.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="31414" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-11-11T15:18:15.443" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2493" PostTypeId="2" ParentId="2140" CreationDate="2014-11-11T08:10:53.930" Score="-2" Body="&lt;h2&gt;Underhand Bejewled&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Help me to write a game of bejewled, which cannot be lost!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Bejewled game rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you ever played bejewled, you can skip this, but for those who did not see it ever:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Playing field of 8*8 grid is filled in with gems of 7 different types randomly&lt;/li&gt;&#xA;&lt;li&gt;By swapping two adjective stones, your goal is to create a line of at least three same type of stones in the either vertical or horizontal line&lt;/li&gt;&#xA;&lt;li&gt;If did so, the gems will dissappear, points are added (say 20 points for a matching) and new gems are provided randomly from the top&lt;/li&gt;&#xA;&lt;li&gt;image related:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/eiyK3.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Your challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Provide me a game which cannot be lost. In other words, the gems falling from the top are not random at all, but are falling in order that there is always at least one possibility to match three gems&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;But&lt;/strong&gt;, from looking at the code at level of newbie programmer, it should look like that game acts as if it was random&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Playable game. As long as it is the grid of 8*8 filled in with 7 different types of &quot;gems&quot; the game is ok. It does not to have killer graphics, neither it does not need to be playable by mouse. (But in that case please make sure you show which &quot;gem&quot; is hovered and then selected)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winning criteria&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is popularity contest. So highest rated game wins&lt;/p&gt;&#xA;" OwnerUserId="32729" LastActivityDate="2014-11-11T08:10:53.930" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2494" PostTypeId="2" ParentId="2140" CreationDate="2014-11-11T15:36:18.070" Score="4" Body="&lt;h1&gt;Programming Puzzle or Code Golf?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(A judging books by covers question)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;^Might need a better title.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This question is based off the &quot;Let's Judge Some Books By Their Covers&quot; question.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Browsing the site, I see that 1859 of our 2692 questions (69%) are tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.  My question is: what's the difference?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your goal is to write a program (or function) to predict, given only the title of a question, whether or not that question is tagged code-golf.  Your program will receive a title as input and should output either a truthy (if it's code golf) or falsey (it it's not) value.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, your program should contain no more than 1000 bytes.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The test data will be all of the questions on this website, excluding closed/migrated/deleted questions.  Your score will be the &lt;a href=&quot;http://en.wikipedia.org/wiki/Phi_coefficient&quot; rel=&quot;nofollow noreferrer&quot;&gt;Phi coefficient&lt;/a&gt; calculated by comparing the results of your program with the actual data.  Higher values (closer to 1) are considered better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Phi coefficient is calculated via the following formula:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;                actual&#xA;guess      puzzle  golf  total&#xA;  puzzle   A       B     Y&#xA;  golf     C       D     Z&#xA;  total    W       X&#xA;&#xA;Phi = (AD - CB) / sqrt(WXYZ)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The benefit of this scoring method is that any form of random guessing (output not affected by input) results in an average score of zero.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The exact data set is yet to be generated.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I believe this challenge is an improvement over the previous challenge due to a few reasons:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The question title probably has a much stronger relationship to its tags than to votes, so there's hopefully more room for improvement and competition.&lt;/li&gt;&#xA;&lt;li&gt;Although there will be special-casing (for words like &quot;short&quot;) it won't be for single questions.  There's no massive outliers in the data.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2015-03-06T15:13:18.543" LastActivityDate="2015-03-06T15:13:18.543" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2496" PostTypeId="2" ParentId="2140" CreationDate="2014-11-12T17:27:55.200" Score="1" Body="&lt;h1&gt;Traders for life&lt;/h1&gt;&#xA;&lt;p&gt;In this game, each bot will own a factory that accepts &lt;code&gt;N&lt;/code&gt; products, and can produce &lt;code&gt;M&lt;/code&gt; of a different product, denoted by &lt;code&gt;#,Input-&amp;gt;#,Output&lt;/code&gt;.  There are 3 products &lt;code&gt;A&lt;/code&gt;,&lt;code&gt;B&lt;/code&gt;, and &lt;code&gt;C&lt;/code&gt; and three types of factories, &lt;code&gt;A-&amp;gt;B&lt;/code&gt;, &lt;code&gt;B-&amp;gt;C&lt;/code&gt;, and &lt;code&gt;C-&amp;gt;A&lt;/code&gt;.  Each factory of the same type will input the same number of products, and outputs the same number of products.  Each both will be assigned a factory type, which can be queried (as described below) Producing &lt;code&gt;A-&amp;gt;B-&amp;gt;C-&amp;gt;A&lt;/code&gt; will increase the total amount of &lt;code&gt;A&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example:&lt;/strong&gt; Bot 1's factory is &lt;code&gt;5A-&amp;gt;2B&lt;/code&gt;, and starts with 500A.  Bot 2's factory is &lt;code&gt;3B-&amp;gt;7C&lt;/code&gt; and starts with 300B.  Bot 3's factory is &lt;code&gt;5C-&amp;gt;6A&lt;/code&gt; and starts with 500C.&lt;/p&gt;&#xA;&lt;p&gt;You start with &lt;code&gt;$1000&lt;/code&gt;, and your goal is to increase that money.  Each turn you will produce, buy, and then sell in that order.&lt;/p&gt;&#xA;&lt;p&gt;To produce you will pass in the number of inputs.  If you pass in more inputs than you currently have in inventory, then you will only produce what you have in inventory.  If the amount input isn't divisible, then a remainder of your input will remain which couldn't be produced.&lt;/p&gt;&#xA;&lt;p&gt;To sell, you will pass the type you want to sell, the price, and the max amount you will sell.  To buy, you will pass the type you want to buy, the max you will pay for it, and the max amount you will buy.  The buyer with the highest max price will then be paired up with the seller with the highest price that is under the buyer's price.  The buyer will then buy as many products as possible at the seller's price.  If the seller reaches his maximum of products to sell, then the buyer will continue to buy from the next seller.  If the buyer reaches his maximum of products to buy, then the seller will continue to sell his product to the buyer with the next highest maximum price.&lt;/p&gt;&#xA;&lt;p&gt;All products and dollar amounts are integers (there are no cents or partial products).&lt;/p&gt;&#xA;&lt;p&gt;There will be 3 copies of each bot, each assigned to a different factory.  These bots cannot communicate with each other or with any other bot.&lt;/p&gt;&#xA;&lt;p&gt;The player with the most money across all of their bots after 500 rounds wins.&lt;/p&gt;&#xA;&lt;p&gt;Any language can be used, and input/output will come through STDIO.  If you wanted to produce 34 of your product, buy 10 of product A at the price $5 and sell 20 of product &lt;code&gt;B&lt;/code&gt; at the price of $6, then you would pass in &lt;code&gt;P,34 B,A,10,5 S,B,20,6&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;At any time you can pass in:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;I&lt;/code&gt; to query your inventory, which will return something like &lt;code&gt;5A 10B 8C&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;M&lt;/code&gt; to query the amount of money you have&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;T&lt;/code&gt; to query your history of trades.  It will be a space delimited list of trades.  Each trade will look like like &lt;code&gt;B,1275,A,49,90&lt;/code&gt; (You bought from player #1275 49 of product &lt;code&gt;A&lt;/code&gt; at the price of $90) or &lt;code&gt;S,385,B,29,30&lt;/code&gt; (You sold to player #385 29 of product &lt;code&gt;B&lt;/code&gt; at the price of $30).&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;R&lt;/code&gt; to query the number of rounds left&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;F&lt;/code&gt; to query your factory type. It will return something like &lt;code&gt;5A-&amp;gt;2B&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-11-12T17:55:04.210" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="2497" PostTypeId="1" AcceptedAnswerId="2498" CreationDate="2014-11-13T09:30:21.883" Score="5" ViewCount="74" Body="&lt;p&gt;To get a bronze tag badge, one needs to achieve this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;You must have a total score of 100 in at least 20 non-community wiki answers to achieve this badge. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;However, I &lt;a href=&quot;https://codegolf.stackexchange.com/users/15080/manu?tab=tags&quot;&gt;gave 20 non-wiki answers with a total score of 122&lt;/a&gt; on questions with the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;. I gave my 20th answer some days ago, but still don't have a bronze badge for this tag. Why is this?&lt;/p&gt;&#xA;" OwnerUserId="15080" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2014-11-27T15:36:21.007" Title="Tag-badge not awarded" Tags="|support|status-bydesign|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2498" PostTypeId="2" ParentId="2497" CreationDate="2014-11-13T09:38:25.413" Score="10" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;A tag must appear on a minimum of 100 questions to be considered for tag badges.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/a/63836/164922&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-11-13T09:38:25.413" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2500" PostTypeId="2" ParentId="2140" CreationDate="2014-11-13T19:46:13.680" Score="0" Body="&lt;h1&gt;N-gon Naming&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given the word name of a polygon &lt;code&gt;n&lt;/code&gt;, you must output the number of sides polygon &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:  triangle&#xA;Output: 3&#xA;&#xA;Input:  dodecagon&#xA;Output: 12&#xA;&#xA;Input:  megagon&#xA;Output: 1000000&#xA;&#xA;Input:  hexahexagon&#xA;Output: 66&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Winning&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The shortest code wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The list of shape names can be found &lt;a href=&quot;http://en.m.wikipedia.org/wiki/Polygon#Naming_polygons&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; with instructions on how shape names are constructed. Use the alkane naming system.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="30525" LastEditDate="2014-11-30T12:43:58.733" LastActivityDate="2014-11-30T12:43:58.733" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="2501" PostTypeId="2" ParentId="2140" CreationDate="2014-11-14T00:21:51.073" Score="2" Body="&lt;h1&gt;Simple Square Packing&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is meant to be a straightforward golfing puzzle.  Hopefully this hasn't been done before.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to figure out how large of a square is needed to fit some other squares inside of it.  You input will be a list of the sizes of other squares, and the output will be the size of the needed square.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To make this problem easier (solvable) the squares will not rotate and will have integer sizes.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Let's say that you have squares of sizes &lt;code&gt;2,3,3,3,4,5&lt;/code&gt;.  This is how they can pack optimally:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;555554444&#xA;555554444&#xA;555554444&#xA;555554444&#xA;55555.333&#xA;333333333&#xA;333333333&#xA;33333322.&#xA;......22.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In this case, they all fit in a size 9 square, so your program should output a &lt;code&gt;9&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To be added.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2014-11-14T00:21:51.073" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2503" PostTypeId="2" ParentId="2140" CreationDate="2014-11-14T22:08:43.137" Score="0" Body="&lt;p&gt;&lt;strong&gt;Lua Variables From Arguments?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this question I challenge you to get variables from function arguments in Lua. The least amount of characters wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Basically I'm asking for you to create a function that takes an argument, and prints out the variable as a string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Please note it has to work in a standalone Lua console.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="32807" LastEditorUserId="32807" LastEditDate="2014-11-15T00:10:51.470" LastActivityDate="2014-11-15T00:10:51.470" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="2505" PostTypeId="2" ParentId="2140" CreationDate="2014-11-17T17:56:55.657" Score="0" Body="&lt;h1&gt;Break out of the digital world!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/back-to-reality&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;back-to-reality&amp;#39;&quot; rel=&quot;tag&quot;&gt;back-to-reality&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Note:&lt;/em&gt;&lt;/strong&gt; The tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/back-to-reality&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;back-to-reality&amp;#39;&quot; rel=&quot;tag&quot;&gt;back-to-reality&lt;/a&gt; is just something I knocked up quickly, if anyone has any better ideas please let me know.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You must write a morse code to ASCII translator using an external device (such as a button or the spacebar on the keyboard).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Dots&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A button press is a dot when it has been pressed for 0.5 seconds or longer and released.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Dashes&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A button press is a dash when it has been pressed for 1 second or longer and released.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Exit&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A button press is an exit when it has been pressed for 5 seconds or more. This should end the program and display the result.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Space&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A space is when there has been no button input for 1 second. This should move on to the next letter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code should support every character on the following:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://zunkworks.com/images/bluetoothmorse/morsecode1.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://zunkworks.com/images/bluetoothmorse/morsecode1.gif&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winning&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The shortest code wins. You may write this in any language that allows input from an external source. For example, Arduino or Python (on a Raspberry Pi).&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="30525" LastEditDate="2015-07-17T15:56:53.537" LastActivityDate="2015-07-17T15:56:53.537" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2506" PostTypeId="1" CreationDate="2014-11-17T18:28:27.837" Score="13" ViewCount="1005" Body="&lt;p&gt;My first meta question here, so please be gentle.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd like to know what the prohibition on &quot;hard-coding the output&quot; means.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Background: I answered this question:&#xA;  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/41523/sudoku-compression/41551#41551&quot;&gt;Sudoku Compression&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question concerns producing a minimal size compressed output for a sudoku board. Unfortunately, the scoring is such that the score is calculated as the sum of the compressed size for 10 inputs. As there is no limit on program size, trivially this can be accomplished by hard coding the 10 input cases to one byte, and handling all others as 81 bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fortunately, we have the standard loopholes to prevent this. My understanding is that they are here:&#xA;  &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/standard-loopholes-which-are-no-longer-funny/1063#1063&quot;&gt;Loopholes that are forbidden by default&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What that says is:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Hard-coding the output&lt;/strong&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Unless the question is an obvious exception (the primary exception being those tagged kolmogorov-complexity), your program is expected to do work, not just print a pre-calculated result. If the question doesn't require input and so a solution which just prints the answer would seem to meet the spec, downvote the question rather than post a protest answer consisting of the literal output.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Now, what I did was produce a real answer that compresses any Sudoku board to 12 characters (or fewer), but then optimise it so that one of the input boards produces a zero size output (details are irrelevant but I've clearly marked how it does it in the code). Clearly it meets the criterion of &quot;expected to do work&quot; and it does not &quot;just print a pre-calculated result&quot;. It works on every Sudoku grid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my view it's a good question (I certainly enjoyed producing the code), but the scoring is faulty. But it's too late to change that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not asking for special treatment as far as my answer's concerned. But I would like to understand what &quot;no hardcoding&quot; means. I'd read this as a ban on trivial solutions which do no calculation, but merely print the test output. Does the ban in fact mean one is not allowed to optimise for test data? If so, I'd suggest the loophole document needs updating. Is there some other general prohibition against taking advantage of weak scoring algorithms?&lt;/p&gt;&#xA;" OwnerUserId="19762" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2014-11-19T18:04:56.983" Title="Standard loopholes: what counts as hard coding?" Tags="|discussion|" AnswerCount="2" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="2507" PostTypeId="2" ParentId="1061" CreationDate="2014-11-17T18:50:15.150" Score="60" Body="&lt;h1&gt;Optimising for the given test cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This applies to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;s and things like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, where you write some code that is measured by a criterion like runtime or size of your output (e.g. in compression challenges). These often employ an obviously finite set of test cases, because you have to measure the metric &lt;em&gt;somehow&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's not in the spirit of such challenges if an answer optimises exclusively for those test cases (e.g. by hardcoding them, which would usually allow you to compress them to a single byte or execute in milliseconds), but performing much worse for general/random input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For variable-sized input there is no way around test cases (one can use some sort of big-O class for scoring, but those tend to not be accurate enough to distinguish submissions and they require proofs instead of just running the code), so the code of conduct should be that the algorithm is such that the test cases are actually representative for the implementation's performance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This also means, that if you optimise your algorithm to perform well on the &lt;em&gt;majority&lt;/em&gt; of cases (and worse on a handful of edge cases) and the test cases happen to be picked from that majority, that's perfectly fine. However, optimising for a &lt;em&gt;minority&lt;/em&gt; of cases which include one or more of the test cases is not.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2014-11-17T23:32:23.540" LastActivityDate="2014-11-17T23:32:23.540" CommentCount="6" CommunityOwnedDate="2014-11-17T18:50:15.150" ContentLicense="CC BY-SA 3.0" />
  <row Id="2509" PostTypeId="2" ParentId="2140" CreationDate="2014-11-18T04:07:15.127" Score="0" Body="&lt;h2&gt;Number Datasheets &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program that accepts an integer &lt;code&gt;n&lt;/code&gt; where &lt;code&gt;1 &amp;lt; n &amp;lt; 10000&lt;/code&gt; and prints some facts about it. Each fact must be on a separate line, and in the order shown here.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;even&lt;/code&gt; or &lt;code&gt;odd&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;prime&lt;/code&gt; or &lt;code&gt;composite&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;deficient&lt;/code&gt;, &lt;code&gt;perfect&lt;/code&gt;, or &lt;code&gt;abundant&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;square&lt;/code&gt; if it's a perfect square&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cube&lt;/code&gt; if it's a perfect third power&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;fourth power&lt;/code&gt; if it's a perfect fourth power&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;fifth power&lt;/code&gt;, &lt;code&gt;sixth power&lt;/code&gt;, etc. as appropriate (each on a separate line)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;square-free&lt;/code&gt; if it has no factors that are perfect squares (except 1)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;triangular&lt;/code&gt; if it's a triangular number&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;pentagonal&lt;/code&gt; if it's a pentagonal number&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;hexagonal&lt;/code&gt;, &lt;code&gt;heptagonal&lt;/code&gt;, &lt;code&gt;octagonal&lt;/code&gt;, &lt;code&gt;nonagonal&lt;/code&gt;, &lt;code&gt;decagonal&lt;/code&gt; as appropriat&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;11-gonal&lt;/code&gt;, &lt;code&gt;12-gonal&lt;/code&gt; ... &lt;code&gt;k-gonal&lt;/code&gt;. However, these should only be printed if &lt;code&gt;k&lt;/code&gt; is less than &lt;code&gt;n&lt;/code&gt; or if &lt;code&gt;k&lt;/code&gt; is less than 10. In any event, each of these term is to be on a separate line.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x totatives&lt;/code&gt; where &lt;code&gt;x&lt;/code&gt; is the count of the numbers between 0 and &lt;code&gt;n&lt;/code&gt; that are coprime to &lt;code&gt;n&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;lucky&lt;/code&gt; if it's a lucky number&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Fibonacci&lt;/code&gt; if it's a Fibonacci number&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Lucas&lt;/code&gt; if it's a Lucas number&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Leonardo&lt;/code&gt; if it's a Leonardo number&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;repdigit in base b&lt;/code&gt; if it's a repdigit in base &lt;code&gt;b&lt;/code&gt;, where &lt;code&gt;1 &amp;lt; b &amp;lt; n-1&lt;/code&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If it's a repdigit in multiple such bases, instead print &lt;code&gt;repdigit in base b, c, d&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;strictly non-palindromic&lt;/code&gt; if it's not a palindrome in any base &lt;code&gt;b&lt;/code&gt; where &lt;code&gt;1 &amp;lt; b &amp;lt; n-1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Any feedback would be appreciated.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="16294" LastActivityDate="2014-11-18T04:07:15.127" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2510" PostTypeId="1" AcceptedAnswerId="2512" CreationDate="2014-11-18T19:06:50.857" Score="14" ViewCount="284" Body="&lt;p&gt;&lt;em&gt;apologizes for terrible pun in title&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I recently received an email from a Community Manager from Stack Exchange:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Winter Bash 2014 will again be available to &lt;strong&gt;all sites that choose to participate&lt;/strong&gt;. We’re redesigning all the hats and adding some extra features to keep things fresh and exciting.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So, my question to you is: &lt;strong&gt;Hats or no hats?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Personally, I welcome our colorful headcloth overlords. This site is all about having fun; shouldn't we be the &lt;em&gt;most&lt;/em&gt; suited to this event? Of course, though, you can vote for whatever you want, and only the overall results will be considered for the final decision.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, what do you think? Upvote whichever position you agree with, and by December 1st, assuming it's not a close tie, our decision will be sent in to the SE team.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Oh, and if you're &lt;em&gt;puzzle&lt;/em&gt;d (ha, ha) as to what this whole &quot;hat&quot; thing is about, &lt;a href=&quot;http://winterbash2013.stackexchange.com/faq&quot; rel=&quot;nofollow&quot;&gt;here's the FAQ for last year's Winter Bash.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regardless of what we end up choosing, happy winter!&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="3808" LastEditDate="2014-11-21T03:02:25.133" LastActivityDate="2014-11-21T03:02:25.133" Title="Hts? (Winter Bash 2014, PPCG edition)" Tags="|discussion|status-completed|" AnswerCount="2" CommentCount="8" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2511" PostTypeId="2" ParentId="2510" CreationDate="2014-11-18T19:07:23.393" Score="-10" Body="&lt;h1&gt;No!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I don't want hats. I hate fun!&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-11-18T19:07:23.393" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2512" PostTypeId="2" ParentId="2510" CreationDate="2014-11-18T19:08:27.433" Score="35" Body="&lt;h1&gt;Yes!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;More colorful headcloths for us!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Author note: This has my upvote.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-11-18T19:08:27.433" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2513" PostTypeId="1" CreationDate="2014-11-18T21:40:43.417" Score="11" ViewCount="406" Body="&lt;p&gt;This is to discuss &lt;a href=&quot;https://codegolf.stackexchange.com/q/41600/20260&quot;&gt;Golf Practice: Python&lt;/a&gt; and the Golf Practice question type it suggests. Some questions that came up:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this type of question on-topic for PPCG?&lt;/li&gt;&#xA;&lt;li&gt;Is it OK that many of the individual answers turn out the same?&lt;/li&gt;&#xA;&lt;li&gt;Should/can we trust users to come up with their own answers without peeking at others' answers?&lt;/li&gt;&#xA;&lt;li&gt;What should the policy on spoilers be?&lt;/li&gt;&#xA;&lt;li&gt;Should more collaboration be encouraged?&lt;/li&gt;&#xA;&lt;li&gt;How can less experienced golfers for that language be motivated to participate?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-11-19T10:58:30.573" Title="Golf Practice questions" Tags="|discussion|challenges|contest-type|" AnswerCount="3" CommentCount="1" ClosedDate="2016-03-23T21:02:02.667" ContentLicense="CC BY-SA 3.0" />
  <row Id="2514" PostTypeId="2" ParentId="2513" CreationDate="2014-11-18T22:27:24.830" Score="11" Body="&lt;h3&gt;Is this type of question on-topic for PPCG?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I certainly think so.  It is a kind of programming puzzle, and it has a&#xA;  well-defined, objective winning criterion.  One potential problem is the&#xA;  language-specific-ness, which is discouraged on PPCG in general.  However, I&#xA;  don't think it's much of a problem in this case, and that the Golf Practice&#xA;  question acts as a kind of companion to the general tips CW.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One problem that was brought up is that the question inherently consists of&#xA;  plenty of small, unrelated problems.  I don't think they're entirely&#xA;  unrelated--one thing that they have in common (or are supposed to have in&#xA;  common) is that they all correspond to situations that occur more-or-less&#xA;  frequently when golfing in the particular language, and highlight important&#xA;  tricks and shortcuts.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Is it OK that many of the individual answers turn out the same?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I don't see this as a problem.  While I guess many essentially identical&#xA;  answers to a question are &quot;typically&quot; discouraged on SE, we all know that&#xA;  PPCG is an exception to the rule, and that the meaning of Q and A in Q&amp;amp;A is&#xA;  different for us than other sites.  I agree that SE's format isn't &lt;em&gt;perfect&lt;/em&gt;&#xA;  for this kind of question, but I don't think that should be a reason to&#xA;  dismiss the question type.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think this is more of a problem for the various 9-hole/18-hole questions than for Golf Practice, really.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Should/can we trust users to come up with their own answers without peeking at others' answers?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is a good question, and certainly something where the SE format doesn't&#xA;  mesh well with the question itself.  I don't think it's fatal if a user&#xA;  could possibly &quot;cheat&quot;, because the main point of the question is to provide&#xA;  practice and one user cheating doesn't prohibit others from practicing.  I'm&#xA;  not much of a pythonista, and I still had lots of fun with Golf Practice:&#xA;  Python even if I didn't get close to the best scores.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;What should the policy on spoilers be?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Relaxing the spoiler requirement after a certain amount of time if some&#xA;  number of answers have reached the same (lowest) score seems reasonable to&#xA;  me.  I like the spoiler aspect, although I did find it a bit annoying to not&#xA;  know whether anyone had obtained a lower score at a particular question.&#xA;  Not sure whether I'd prefer to know the sub-problem length or not.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Should more collaboration be encouraged?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Also a good question.  Collaboration could be encouraged after the&#xA;  &quot;unspoiler&quot; point, perhaps?&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;How can less experienced golfers be motivated to participate?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I think the question itself was pretty motivating as it is already.  Not&#xA;  sure how it could be improved further.&lt;/p&gt;&#xA;" OwnerUserId="3918" LastActivityDate="2014-11-18T22:27:24.830" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2515" PostTypeId="2" ParentId="2140" CreationDate="2014-11-18T22:46:35.493" Score="1" Body="&lt;h1&gt;Smuggle these Pincodes&lt;/h1&gt;&#xA;&lt;p&gt;After many years, our covert agent has managed to amass a list of all &lt;a href=&quot;http://paste2.org/O68MAyL9&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;List of all possible pincodes&quot;&gt;PIN codes&lt;/a&gt; in an enemy nation.&lt;/p&gt;&#xA;&lt;p&gt;But there is a complication. The government of the country did become aware of our actions. Now our agent needs to smuggle the PINs past the customs without being caught!&lt;/p&gt;&#xA;&lt;p&gt;Our spy needs help. Hiding a list of 10 000 codes will be too difficult. Luckily, our government can enlist the help of its loyal programmers (&lt;em&gt;you!&lt;/em&gt;).&lt;/p&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a program that will output a list of all PIN codes from &lt;code&gt;0000&lt;/code&gt; up to &lt;code&gt;9999&lt;/code&gt; (inclusive). The program needs to be as short as possible to get past customs unnoticed.&lt;/p&gt;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The PINs must each be on a separate line.&lt;/li&gt;&#xA;&lt;li&gt;The program may not output anything other than the required output. However, it &lt;em&gt;may&lt;/em&gt; output one (and no more than one) line end after the last PIN; e.g. &lt;code&gt;9999\n&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;And, in case you were wondering:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program &lt;strong&gt;must not&lt;/strong&gt;:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Depend on any external resources.&lt;/li&gt;&#xA;&lt;li&gt;Depend on having a specific file name.&lt;/li&gt;&#xA;&lt;li&gt;Take exceptionally long to run. If your program runs over a minute on an average home user’s computer, it’s invalid.&lt;/li&gt;&#xA;&lt;li&gt;Be written in a programming language for which there did not exist a publicly available compiler / interpreter before this challenge was posted.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://paste2.org/O68MAyL9&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Correct output for this puzzle (same link as above)&quot;&gt;An example of the correct output can be seen here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;p&gt;The shortest code (in bytes, in any language) wins.&lt;/p&gt;&#xA;&lt;p&gt;Any non-standard command-line arguments (arguments that aren’t normally required to run a script) count towards the total character count.&lt;/p&gt;&#xA;&lt;p&gt;Your program’s output &lt;em&gt;may&lt;/em&gt; deviate from the given list order, in which case your program’s byte count will incur a &lt;strong&gt;+10%&lt;/strong&gt; penalty (rounded up).&lt;/p&gt;&#xA;" OwnerUserId="13486" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-11-18T23:02:06.123" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2516" PostTypeId="2" ParentId="2513" CreationDate="2014-11-18T23:16:50.617" Score="4" Body="&lt;p&gt;Let me begin with my experience with that question:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I ignored the answers and had a quick take at the challenges alone. Given that there were already many answers and I wasn’t keen on counting, I just started comparing my solutions to those in the existing answers, so I could feel happy about the ones I got “right” and learn something from the others. Unfortunately that meant going through a lot of answers, which were mostly the same – which rendered the otherwise nice experience much less enjoyable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think the main issue here is that you want this questions to act as classical challenges: People &lt;em&gt;can&lt;/em&gt; use them for practice, but comparing and evaluating your performance as well as learning something becomes difficult. Less experienced golfers have no motivation to participate in form of answering, because experienced golfers will have the best scores. Of course, they can still answer, but if everybody did that, these questions would even more than now become a hoard of mostly redundant information that does not benefit anybody.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I thus suggest the following changes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The challenges are posted as a single regular question (containing naïve solutions, as the existing question does).&lt;/li&gt;&#xA;&lt;li&gt;The OP posts and accepts a community-wiki answer containing the best solutions and close and interesting runners-up.&lt;/li&gt;&#xA;&lt;li&gt;If somebody finds a solution to one subchallenge that is at least at par with the existing best solutions, they edit it into the community-wiki answer &lt;em&gt;and&lt;/em&gt; post it as a regular answer so they can get credit in form of upvotes.&lt;/li&gt;&#xA;&lt;li&gt;All solutions are behind spoiler markup, but the high scores for the individual challenges are visible (so you can check whether you already have the best solution without needing to see the answer).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="11354" LastActivityDate="2014-11-18T23:16:50.617" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2517" PostTypeId="2" ParentId="2513" CreationDate="2014-11-19T10:58:30.573" Score="-1" Body="&lt;h1&gt;Are we sure that is the best golf ?&lt;/h1&gt;&#xA;&lt;p&gt;The only thing that I think will not work out in such kind of questions is that they are based on the assumption that the OP has the best solution to the problems he is posting.&lt;/p&gt;&#xA;&lt;p&gt;Posting the optimal solution code length gives other users a baseline to achieve and might even hinder them from actually getting to a more optimal solution.&lt;/p&gt;&#xA;&lt;p&gt;I say that in such questions, no baseline/threshold/goal should be provided. If the OP has answers to all the questions, which he think are the most optimal solutions, he is free to post them as an answer (after a certain time period, allowing other users to give it a try).&lt;/p&gt;&#xA;&lt;p&gt;Some might say that this converts the question from a practice question to a normal code-golf question. While it might be doing so, that is what I personally prefer.&lt;/p&gt;&#xA;" OwnerUserId="31414" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-11-19T10:58:30.573" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2518" PostTypeId="2" ParentId="2140" CreationDate="2014-11-19T12:11:19.810" Score="0" Body="&lt;p&gt;&lt;strong&gt;Math golf&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This challenge is about writing code that outputs the smallest formula possible for a sequence of position integers.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I will choose 10 from the following test sequences of positive integers. However, please do not hardcode these into your answers. If I suspect this has happened, I reserve the right to change the test sequences without notice.&lt;/p&gt;&#xA;&lt;p&gt;Your code should accept standard in with one list of comma separated sequences per line.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;1, 2, 7&lt;/p&gt;&#xA;&lt;p&gt;12, 9, 7, 5&lt;/p&gt;&#xA;&lt;p&gt;40, 25, 16, 10, 7&lt;/p&gt;&#xA;&lt;p&gt;2240, 1225, 679, 373, 213, 149, 141, 133&lt;/p&gt;&#xA;&lt;p&gt;8064, 3969, 1969, 974, 494, 254, 164, 134, 119&lt;/p&gt;&#xA;&lt;p&gt;118272, 53361, 24196, 10958, 5027, 2399, 1271, 863, 746, 695, 668, 665&lt;/p&gt;&#xA;&lt;p&gt;1, 4, 36, 400, 4900&lt;/p&gt;&#xA;&lt;p&gt;96, 1280, 17920, 258048, 3784704, 56229888, 843448320&lt;/p&gt;&#xA;&lt;p&gt;72, 800, 9800, 127008, 1707552, 23557248, 331273800&lt;/p&gt;&#xA;&lt;p&gt;40, 224, 1064, 3808,  21280, 59200, 322600&lt;/p&gt;&#xA;&lt;p&gt;2240,  832,  240,   72,   20,    6,    3&lt;/p&gt;&#xA;&lt;p&gt;53760, 17152,  4480,  1248,   384,   104,    44,    22,    11&lt;/p&gt;&#xA;&lt;p&gt;329472,  86656,  20800,   5536,   1536,    440,    124,     44,         19,      8,      4&lt;/p&gt;&#xA;&lt;p&gt;32800768,  6856704,  1536000,   394752,   103936,    27136,           7936,     2080,      656,      264,      132,       66,       33&lt;/p&gt;&#xA;&lt;p&gt;206389248,  33216512,   7029760,   1743360,    448000,    112640,  30144,      8288,      2096,       688,       284,       102,      46,        18,         9&lt;/p&gt;&#xA;&lt;p&gt;20956446720,  2527756288,   510181376,   122363904,    30720000,      7643136,     1972224,      508416,      136192,       35456,             10816,        3296,        1360,         632,         292,               146,          73&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A math formula per input line which maps an index &lt;code&gt;n&lt;/code&gt; starting at &lt;code&gt;1&lt;/code&gt; to the relevant value.&lt;/p&gt;&#xA;&lt;p&gt;A formula can be made up as follows. It can consist of the sequence variable &lt;code&gt;n&lt;/code&gt;, integer constants, &lt;code&gt;*&lt;/code&gt;, &lt;code&gt;/&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;, &lt;code&gt;+&lt;/code&gt;, &lt;code&gt;!&lt;/code&gt;, &lt;code&gt;(&lt;/code&gt;, &lt;code&gt;)&lt;/code&gt;, &lt;code&gt;^&lt;/code&gt; or &lt;code&gt;(m,k)&lt;/code&gt;.  These are to be interpreted in their normal mathematical sense with &lt;code&gt;(m,k)&lt;/code&gt; to be read as &lt;code&gt;binomial(m,k)&lt;/code&gt;.  The formula has to be well formed with, for example, parentheses matching and the order of precedence of operators will be the usual mathematical ordering.&lt;/p&gt;&#xA;&lt;p&gt;A special rule applies to the factorial function &lt;code&gt;!&lt;/code&gt; which requires parentheses if the &lt;code&gt;^&lt;/code&gt; or &lt;code&gt;!&lt;/code&gt;  operators are to be applied to the result of the factorial. I.e. it is &lt;code&gt;(n!)^2&lt;/code&gt; and not &lt;code&gt;n!^2&lt;/code&gt;. Note that the &lt;code&gt;!!&lt;/code&gt; is never allowed.  Unary &lt;code&gt;-&lt;/code&gt; also requires brackets if any further operator is applied to the result on the left hand side or if the result is to be raised to a power. For example it is &lt;code&gt;n*(-1)&lt;/code&gt; and not &lt;code&gt;n*-1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Score&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I will test your code on a number of sequences of integers that I make.&lt;/p&gt;&#xA;&lt;p&gt;The score is the sum of the number of characters in all your outputs.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example output&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;For the sequence that starts &lt;code&gt;96, 1280&lt;/code&gt; above, the output &lt;code&gt;4^(n+1)*(2*(n+1))!/((n+1)!)^2&lt;/code&gt; gives a score of &lt;code&gt;29&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerDisplayName="user9206" LastEditorUserId="-1" LastEditorDisplayName="user9206" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-11-20T16:58:44.033" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="2520" PostTypeId="2" ParentId="2506" CreationDate="2014-11-19T14:23:42.130" Score="6" Body="&lt;p&gt;I agree that the challenge's scoring wasn't very good, but including one of the test cases &lt;em&gt;in the code&lt;/em&gt; is definitely hardcoding in my opinion. But we've discussed this in the comments. Let's just agree that you abused a bad part of the spec, which certainly a loophole, standard or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anyway, I want to use this answer to suggest a scoring mechanism for future challenges, which should a) reduce the problem and b) make it detectable.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;The OP provides a reasonably large, &lt;em&gt;randomly generated&lt;/em&gt; set of test cases.&lt;/strong&gt; The sets should be sampled uniformly from all inputs that answers should be able to handle. The OP may or may not provide the script for generating them.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Answers are scored on this set of test cases only.&lt;/strong&gt; This ensures that we have an objective winning criterion that doesn't depend on undisclosed or fluctuating test sets.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;If the OP suspects an answer of optimising towards the given test cases, he can compare the score with another randomly generated set.&lt;/strong&gt; An answer that optimises for general input will perform similarly on all large, uniformly random test sets. If an answer somehow optimises towards the given inputs, that should be noticeable. Likewise, this allows an answer to optimise towards &lt;em&gt;some&lt;/em&gt; subset of inputs, e.g. ignoring some rare edge cases, because the average number of such edge cases will be consistent across multiple random test sets.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think this should fix most of the problems, and avoid a lot of subjective discussion. It also avoids undisclosed benchmarks and hard character limits on submissions.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-11-19T14:23:42.130" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2521" PostTypeId="2" ParentId="2506" CreationDate="2014-11-19T18:04:56.983" Score="1" Body="&lt;p&gt;This answer is a list of several different ideas...  It's not really giving a specific solution.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Puzzles measuring performance on only a few (&amp;lt;100) test cases&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An advantage is that they are easier to self-score&lt;/li&gt;&#xA;&lt;li&gt;These are the most vulnerable to hard coding&lt;/li&gt;&#xA;&lt;li&gt;If there is any way to generate a larger, random test set, that should be done&lt;/li&gt;&#xA;&lt;li&gt;I think a program's score should NOT simply be the total output length&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Otherwise, the most difficult test case would determine the winner&lt;/li&gt;&#xA;&lt;li&gt;The score for each test case could be (best solution)/(my solution) to get  a number between 0 and 1.  Add these up to form an overall score.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Puzzles measuring performance on a test set whose answers are already known.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The test set must be large (&gt;1000)&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Direct hard-coding is a major threat to small test sets.  The challenge would reduce to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;Similarly, the score for each test case should be within a very limited range, so that no single test case is worth a lot more than others.&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;When some test cases are major outliers and thus much more important, it encourages hard-coding of those cases. You reduce the &quot;effective size&quot; of the data set.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;I think binary classification is a good idea.  This makes it so that each test case is worth the same.&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The first option is that the score is the %correct.&lt;/li&gt;&#xA;&lt;li&gt;The next is the phi-coefficient, which I prefer.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Puzzles whose test set is randomly generated from some problem space.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A large test set is needed to overcome the inherit randomness in the scores.&lt;/li&gt;&#xA;&lt;li&gt;A decent scoring statistic, given a large enough number of test cases, is average score.&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A &quot;statistical&quot; method is to calculate the standard deviation of the test results and divide it by the square root of the number of test cases to get the standard deviation of your average score.  The data set should be large enough such that the standard deviation is small.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;The author should provide a large list of test cases, as well as the method of generation.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Problems in which the actual test set is not known yet&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This would occur if the challenge is to predict some future events&lt;/li&gt;&#xA;&lt;li&gt;The author should provide a large amount of historical data&lt;/li&gt;&#xA;&lt;li&gt;At a certain date, submissions are closed. Then, the submissions are judged according to the new data set.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2014-11-19T18:04:56.983" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2522" PostTypeId="1" CreationDate="2014-11-20T02:19:37.153" Score="5" ViewCount="307" Body="&lt;p&gt;I think the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; tag wiki doesn't have enough on writing a good code golf question. I'd like to collect advice on these, and perhaps the most well-liked can be incorporated. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;What makes a code-golf question good? What are some pitfalls to avoid?&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="56656" LastEditDate="2017-01-28T14:40:23.353" LastActivityDate="2017-04-13T21:27:35.497" Title="Tips for writing good code golf questions" Tags="|discussion|code-golf|tips|" AnswerCount="6" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2523" PostTypeId="2" ParentId="2522" CreationDate="2014-11-20T02:22:42.620" Score="9" Body="&lt;h2&gt;Golf your own question&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Actually write code that solves your question. Nope, don't just say you can do it. Write the code to the spec, and use it to generate or check your test cases. That way, if there's something unclear or wrong in the spec, you'll notice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, make a best effort to golf your code. Have a submission you could actually post (but don't post it immediately). Compare different methods. That way, if there's an exploit, you're likely to catch it. Maybe you find out that you can't beat hardcoding the answer. Maybe you find a library function just does it for you. Or, if you thought there were multiple methods, but one turns out far better, you can change your question or tune the parameters to be more interesting.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2014-11-20T02:29:08.753" LastActivityDate="2014-11-20T02:29:08.753" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2524" PostTypeId="2" ParentId="2522" CreationDate="2014-11-20T02:27:51.057" Score="6" Body="&lt;h2&gt;Beware Brute Force&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Say you have a question to find an example of something or an optimal something. Are you OK with code that just iterates over all the possibilities? It's easy to forget about algorithms that are massive overkill in computation but take little code to implement. Often, such code is short and beats more interesting domain-specific solutions. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If this is a possibility, you should specify whether it's legal to try, say, all 2^64 machine integers or all 256^10 strings of ten ASCII characters. If you wish, you can impose a time limit on test cases to rule out such solutions, or specify that solutions must be asymptotically polynomial time in some parameters.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2014-11-20T05:55:53.057" LastActivityDate="2014-11-20T05:55:53.057" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2525" PostTypeId="2" ParentId="2522" CreationDate="2014-11-20T02:39:59.380" Score="6" Body="&lt;h1&gt;Check your scoring method&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If you choose to score in something other than just characters or bytes, make sure the formula actually does what you want it to do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, you might have a classification problem that allows programs to output a confidence score between 0 and 1, with part of the scoring being &lt;code&gt;&amp;lt;confidence&amp;gt; * &amp;lt;-1 if incorrect, 1 if correct&amp;gt;&lt;/code&gt; for each test case. It sounds nice, but the optimal strategy would be to only output one of two confidence scores — 0 or 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want to award bonuses for additional tasks, think about how that might translate for different languages, and whether or not it'd be worth aiming for the bonus. You may want to consider awarding a bonus of &lt;code&gt;-X% of bytes&lt;/code&gt; as opposed to &lt;code&gt;-X bytes&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="21487" LastEditorUserId="21487" LastEditDate="2014-11-20T02:45:11.800" LastActivityDate="2014-11-20T02:45:11.800" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2526" PostTypeId="2" ParentId="2140" CreationDate="2014-11-20T17:52:47.770" Score="-3" Body="&lt;h1&gt;Shortest Program that May or May not Terminate:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program such that whether or not it terminates depends on the answer to an unsolved question in Computer Science or Mathematics. For example, your program might test the Goldbach conjecture for every N and quit if a counterexample is found, or hunt for odd perfect numbers. Please include an explanation of why your program may or may not terminate! &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note: assume infinite memory and stack size, because otherwise they all terminate. Your program must be self contained, take no input, and only use standard libraries.&#xA;This is Codegolf, so shortest code wins!&lt;/p&gt;&#xA;" OwnerUserId="19700" LastEditorUserId="19700" LastEditDate="2014-11-20T18:51:12.907" LastActivityDate="2014-11-20T18:51:12.907" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2527" PostTypeId="1" AcceptedAnswerId="2529" CreationDate="2014-11-21T14:31:39.040" Score="12" ViewCount="501" Body="&lt;p&gt;So today I came across two puzzling questions which I immediately recognised as problems formulated in a competition I am taking part in. Luckily, the OP did not formulate these questions well, so they got downvoted and closed. This behaviour of course is undesirable and wrong. I flagged the two questions and asked the mods to delete them but nevertheless it is sad that people actually try to cheat that boldly...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;What can we as the community do to stop these cheating attempts?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="21038" LastActivityDate="2014-11-24T10:49:57.330" Title="Cheating at competitions" Tags="|discussion|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2528" PostTypeId="2" ParentId="2527" CreationDate="2014-11-21T14:42:59.870" Score="10" Body="&lt;p&gt;I think you're already doing the right thing. If you recognize it as such, you should flag it (assuming you don't have the privilege to close yet). Downvote is clearly an option as well (&quot;this post is not useful&quot;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The one thing I'd add is that it could also be helpful to comment on the post itself to notify others, along with a link to the competition (for evidence) if possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;People are always going to try to find ways to &quot;cheat&quot;, so just handle them as they come up.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2014-11-21T14:42:59.870" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2529" PostTypeId="2" ParentId="2527" CreationDate="2014-11-21T14:43:53.937" Score="14" Body="&lt;p&gt;I believe we (you) have done everything we could:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Downvote, close, flag, delete.&lt;/strong&gt; (And what Geobits said: leave a comment, to let other users know!)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This happens every couple of months for another competition, and &lt;em&gt;usually&lt;/em&gt; the questions are fairly bad, so they don't get through anyway. If some OP should ever take the time to formulate the question properly, we might not be able to catch it, but even then, these competitions are rarely looking for golfed code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Often the competitions are looking for efficient solutions, and if inexperienced users try to pull off a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt; challenge it usually goes sufficiently wrong for the question not to survive.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2014-11-21T14:43:53.937" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2530" PostTypeId="2" ParentId="2522" CreationDate="2014-11-21T19:51:35.247" Score="4" Body="&lt;h1&gt;Specify input and output restrictions&lt;/h1&gt;&#xA;&lt;p&gt;Sometimes, in a code golf question, you will want answers to take input in a specific form, and return it in a specific form. Other times, the requirements are more along the lines of &amp;quot;Whatever is most convenient for your language, but no preprocessing.&amp;quot; Either way, you should say which one it is.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-11-21T19:51:35.247" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2531" PostTypeId="2" ParentId="2522" CreationDate="2014-11-21T23:56:50.463" Score="5" Body="&lt;h2&gt;Cover your ground with test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You should include test cases in your question so that someone can check if their program is correct (with high probability) by whether it gets all the test cases right. These test cases should give inputs and outputs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Of course, this is moot for challenges with no input and a fixed output, like kolmogorov-complexity.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your test cases should cover the conceptual span of possible inputs, so that if a program gets your test cases right, it is likely to behave correctly on all inputs. Does your spec require negative numbers to be handled? Test them! Is the empty string a valid input? Include it! Can the list length go up to 255? Include a length-255 list! &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Particularly important are edge cases that could be pitfalls for slightly-wrong algorithms. If there's a heuristic algorithm that gets most inputs right, but not all, emphasize these &quot;interesting&quot; inputs in the test cases. Conversely, look at your test cases and see if there's an unintentional pattern so you can include additional ones that break it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, if your challenge is such that there really only one &quot;type&quot; of input, and anything that gets one interesting input right surely gets all of them right, then just one of two test cases is fine.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="9275" LastEditDate="2014-11-22T16:49:55.907" LastActivityDate="2014-11-22T16:49:55.907" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2532" PostTypeId="2" ParentId="2527" CreationDate="2014-11-24T10:49:57.330" Score="6" Body="&lt;p&gt;I would add one thing to the existing answers: &lt;strong&gt;mention it in chat&lt;/strong&gt;. If you can provide a link to the questions from the contest, that gets enough people on the alert to spot attempts to post the rest of them as well.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2014-11-24T10:49:57.330" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2534" PostTypeId="2" ParentId="2140" CreationDate="2014-11-25T17:29:43.310" Score="0" Body="&lt;h1&gt;Generalized Array Indexing&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Most programming languages provide an array datatype (which might be called a list or a vector) that supports indexing. Given an array and a nonnegative integer, we can fetch the element of the array at that position: &lt;code&gt;[a,b,c][0] = a&lt;/code&gt;. Some languages, like Python, support a more general indexing system, where passing a negative index counts the position from the end: &lt;code&gt;[a,b,c][-1] = c&lt;/code&gt;. But why stop there?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge, your task is to provide another generalization of this operation. In other words, you must provide a function that takes in an array and a number, and returns &lt;em&gt;something&lt;/em&gt;, up to the following restrictions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If a nonnegative integer is passed to the function, it must return the element of the array at that position. In other words, it must be an extension of the array indexing operation.&lt;/li&gt;&#xA;&lt;li&gt;It must support more indices than just nonnegative integers, like negative integers, fractions, complex numbers, or even strings. In other words, it must be a proper extension.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;If necessary, you may restrict the types of elements your arrays may contain, so you may choose to only handle arrays of, say, floating-point numbers, or other arrays. This is a popularity contest, so the answer with the most upvotes wins.&lt;/p&gt;&#xA;" OwnerUserId="32014" LastActivityDate="2014-11-25T17:29:43.310" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2536" PostTypeId="2" ParentId="2140" CreationDate="2014-11-27T16:16:52.043" Score="2" Body="&lt;h1&gt;Code Yourself a DFA&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge, your task is to implement a &lt;a href=&quot;http://en.wikipedia.org/wiki/Deterministic_finite_automaton&quot; rel=&quot;nofollow noreferrer&quot;&gt;deterministic finite automaton&lt;/a&gt; (DFA for short) that recognizes the following regular language &lt;code&gt;L&lt;/code&gt;. The alphabet of &lt;code&gt;L&lt;/code&gt; is &lt;code&gt;x,1,2,3&lt;/code&gt;, and it is the set difference of &lt;code&gt;(1x*|2(xx)*|3(xxx)*)*&lt;/code&gt; and &lt;code&gt;(x|1|2|3)*1x*1x*1(x|1|2|3)*&lt;/code&gt;. Intuitively, the strings in the language &lt;code&gt;L&lt;/code&gt; consist of zero or more &quot;blocks&quot; of the form &lt;code&gt;1xx...x&lt;/code&gt;, &lt;code&gt;2(xx)(xx)...(xx)&lt;/code&gt; or &lt;code&gt;3(xxx)(xxx)...(xxx)&lt;/code&gt;, and three blocks of the first kind cannot occur consecutively.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The API&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your program will take two arguments from STDIN, separated by a space: a letter from the alphabet &lt;code&gt;x,1,2,3&lt;/code&gt;, and a string that represents the current state of the DFA. The program should then write to STDOUT either &lt;code&gt;A&lt;/code&gt; or &lt;code&gt;R&lt;/code&gt;, a space, and a string that represents the new state of the DFA. The first letter indicates whether the new state is accepting (&lt;code&gt;A&lt;/code&gt;) or rejecting (&lt;code&gt;R&lt;/code&gt;). After that, the program should quit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, suppose that we are checking the input string &lt;code&gt;2xx&lt;/code&gt;, and that the start state of my DFA is &lt;code&gt;start&lt;/code&gt;. Then, my program is given the input &lt;code&gt;2 start&lt;/code&gt;, and it answers with &lt;code&gt;A 2block&lt;/code&gt; and quits, so the next state is &lt;code&gt;2block&lt;/code&gt;, which is accepting. Next, the program is given &lt;code&gt;x 2block&lt;/code&gt;, and it answers with &lt;code&gt;R 2block'&lt;/code&gt;, which is rejecting. Finally, the program is given &lt;code&gt;x 2block'&lt;/code&gt;, and it answers with &lt;code&gt;A 2block&lt;/code&gt;. Since this state is accepting, the input is accepted (as it should be, since it is an element of &lt;code&gt;L&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules and Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your answer should include a program and the name of its start state (which should be accepting in this case, since the empty string is in &lt;code&gt;L&lt;/code&gt;). The score of your answer is the byte count of your program, plus three times the number of states in the DFA; the lowest score wins. A control program (written in Python 3) that checks the validity of your submission and its state count can be found here (TODO). See the README file for instructions. Finally, some additional rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program should be completely deterministic, and cannot read any input from any external source, other than the STDIN arguments listed above.&lt;/li&gt;&#xA;&lt;li&gt;A state of the DFA is either accepting or rejecting. If your program claims that some state is accepting, and later that it's rejecting, the control program will disqualify it.&lt;/li&gt;&#xA;&lt;li&gt;The states of your DFA must be strings of printable non-whitespace ASCII characters, and all such strings are valid potential states. The actual state set of your DFA is the set of states reachable from the given start state.&lt;/li&gt;&#xA;&lt;li&gt;Every state of your DFA must support a transition by every letter in the input alphabet.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'd like some comments on the scoring of this challenge, and the language &lt;code&gt;L&lt;/code&gt;. I have tried to choose them so that there could be meaningful trade-offs between state count and byte count. Specifically, if &lt;code&gt;L&lt;/code&gt; is too simple or the penalty on program length is too low, the best tactic is to just compress the minimal DFA. Conversely, if &lt;code&gt;L&lt;/code&gt; is too complicated, I fear that no-one will have the energy to write a DFA for it by hand.&lt;/p&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="32014" LastEditDate="2014-11-27T19:16:57.760" LastActivityDate="2014-11-27T19:16:57.760" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2538" PostTypeId="1" AcceptedAnswerId="2540" CreationDate="2014-11-28T19:45:33.277" Score="0" ViewCount="94" Body="&lt;p&gt;For easier position calculation and as a handy way for the questioner, a sort by code size feature should be added which would sort out all the answers from the very least byte-ed to the most byte-ed.&lt;/p&gt;&#xA;" OwnerUserId="12524" LastEditorUserId="68942" LastEditDate="2021-06-09T05:44:40.823" LastActivityDate="2021-06-09T05:44:40.823" Title="Sort by code size for code-golf problems" Tags="|feature-request|status-declined|code-golf|" AnswerCount="1" CommentCount="2" ClosedDate="2021-06-02T22:11:58.227" ContentLicense="CC BY-SA 3.0" />
  <row Id="2540" PostTypeId="2" ParentId="2538" CreationDate="2014-11-29T15:50:12.357" Score="6" Body="&lt;p&gt;I don't think the team is going to implement this because it would only be useful here. However, there is a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/900/9275&quot;&gt;user script&lt;/a&gt; written by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/3191/ilmari-karonen&quot;&gt;Ilmari Karonen&lt;/a&gt;. that adds a &quot;shortest&quot; tab to questions which sorts answers by code length. The script is a new version of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/170/9275&quot;&gt;this user script&lt;/a&gt; written by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/362/nathan-osman&quot;&gt;Nathan Osman&lt;/a&gt;, because that script didn't work anymore after some design changes on Stack Exchange.&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2014-11-29T15:50:12.357" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2542" PostTypeId="2" ParentId="2140" CreationDate="2014-11-29T22:37:43.393" Score="0" Body="&lt;h1&gt;Play Chopsticks&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Disclaimer&lt;/strong&gt;: Please fix the question and the scoring if they are not satisfactory. I am probably not qualified to run and score entries because I am not entirely familiar with the logistics of running two programs against one another, and, as such, &lt;strong&gt;I will not be posting this question to the main page myself&lt;/strong&gt;. So, if anyone wants to take this off my hands, feel free. I just really like this idea and want to see it happen.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Chopsticks_%28hand_game%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;Chopsticks Wikipedia article&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to write a program that, given the current position of the game as input (how many fingers on each hand), outputs the next move it chose to take.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules of the game&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(Normal rules, no variations)&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;When a hand's finger-count becomes &gt;= 5, it's finger-count becomes 0.&lt;/li&gt;&#xA;&lt;li&gt;Splitting/transferring is allowed. You CAN bring a dead hand back by transferring some fingers from your other hand.&lt;/li&gt;&#xA;&lt;li&gt;However, splitting/transferring is not allowed if the move only results in you having swapped your hands. (eg. no prolonging the game by &quot;doing nothing&quot;)&lt;/li&gt;&#xA;&lt;li&gt;A player loses if both their hands are dead.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You will receive as input the number of fingers on each of your and your opponents hands.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input will be given in the following format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#_on_your_LH #_on_your_RH #_on_opponent_LH #_on_opponent_RH&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 1 1 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4 0 3 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program will output your move base on the input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Key&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;First number:&#xA;  0 (your LH)&#xA;  1 (your RH)&#xA;  2 (transfer from your LH to your RH)&#xA;  3 (transfer from your RH to your LH)&#xA;&#xA;Second number:&#xA;  If first number was 0 or 1:&#xA;    0 (opponent's LH)&#xA;    1 (opponent's RH)&#xA;  If first number was 2 or 3:&#xA;    1-3 (# of fingers to transfer)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 0 (tap opponent's RH with your LH)&#xA;0 1 (tap opponent's LH with your LH)&#xA;1 0 (tap opponent's RH with your RH)&#xA;1 1 (tap opponent's LH with your RH)&#xA;2 1 (transfer 1 finger from your LH to your RH)&#xA;3 2 (transfer 2 fingers from your RH to your LH)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each entry will be made to play a game against every other entry.&lt;br&gt;&#xA;If a game does not end after 100 rounds (?), it will be declared a tie.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Two points will be awarded for every win and one point will be awarded for every tie.&lt;br&gt;&#xA;Entry with the most points is the king of the chopstick-hill.&lt;/p&gt;&#xA;" OwnerUserId="20111" LastActivityDate="2014-11-29T22:37:43.393" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="2545" PostTypeId="2" ParentId="2140" CreationDate="2014-12-01T22:21:12.050" Score="1" Body="&lt;h1&gt;Writing the Hydra Function&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Preamble&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Sometime in the early 21st century, computer scientists would discover the Hydra function (also known as the Lächerlich function), &lt;code&gt;f&lt;/code&gt;, whose signature is given by&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;R = f( A, B, L, x, y, z )&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;A&lt;/code&gt;, &lt;code&gt;B&lt;/code&gt;, &lt;code&gt;L&lt;/code&gt;, and &lt;code&gt;R&lt;/code&gt; are finite integers, and &lt;code&gt;x&lt;/code&gt;, &lt;code&gt;y&lt;/code&gt;, and &lt;code&gt;z&lt;/code&gt; are integers in the range [-2&lt;sup&gt;31&lt;/sup&gt;&amp;nbsp;&amp;nbsp;2&lt;sup&gt;31&lt;/sup&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The function would quickly rise to preeminence due to the fact that it can perform 40 &lt;em&gt;useful and well-known&lt;/em&gt; binary operations on &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt;, returning the result in &lt;code&gt;R&lt;/code&gt;. These operations are listed in the section &quot;Operations&quot; below, which provides a rigorous description of each.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is important to note here that &quot;integer&quot; refers to the mathematical concept of an integer. In particular, there is no concept of integer overflow or of binary representation. In the case of variables &lt;code&gt;A&lt;/code&gt;, &lt;code&gt;B&lt;/code&gt;, and &lt;code&gt;L&lt;/code&gt;, integer values are unbounded. In the case of &lt;code&gt;x&lt;/code&gt;, &lt;code&gt;y&lt;/code&gt;, &lt;code&gt;z&lt;/code&gt;, the variables may not violate their explicit bound; any operation that could potentially assign an out-of-range value to these variables is an error and forbidden.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Operations&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The following code snippet defines all 40 (potential) operations of &lt;code&gt;f&lt;/code&gt;. In each case, a name, description, and precise mathematical definition is provided. As a convenience, each operation also includes a C function that (notwithstanding data type bounds) implements the operation when compiled by &lt;code&gt;gcc&lt;/code&gt;. In all cases, the mathematical definition should be considered authoritative.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;style&amp;gt;tr:nth-child(4n-3) td:first-child { width: 150px; font: bold 24px Times New Roman,Times,serif; }&amp;lt;/style&amp;gt;&amp;lt;style&amp;gt;tr:nth-child(4n-2) span { font-family: Courier New,monospace; }&amp;lt;/style&amp;gt;&amp;lt;style&amp;gt;tr:nth-child(4n) { font-family: Courier New,monospace; white-space:pre; }&amp;lt;/style&amp;gt;&amp;lt;style&amp;gt;tr:nth-child(4n) td { padding-bottom: 50px; }&amp;lt;/style&amp;gt;&amp;lt;script type=&quot;text/javascript&quot; src=&quot;http://code.jquery.com/jquery-1.10.1.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&amp;lt;div&amp;gt;Note that \(\left\lfloor\frac{A}{B}\right\rfloor _0\) indicates &quot;divide and truncate towards zero&quot;, and that \(\operatorname{sgn}\left( x\right)\) indicates the signum function evaluated at \(x\).&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Also note that for operations conditionally returning \({\rm anything}\), &quot;anything&quot; may be any value representable as an integer, or a fatal error. &quot;Anything&quot; does not have to be consistent from operation to operation. You may rely on the results returned for &quot;anything&quot; in subsequent calculations.&amp;lt;/div&amp;gt;&amp;lt;hr&amp;gt;&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&amp;lt;div id=&quot;main&quot;&amp;gt;1. 0 [Constant 0] (0) \[R = 0\cdot A + 0\cdot B\] {{return 0;}} 2. 1 [Constant 1] (1) \[R = 1 + 0\cdot A + 0\cdot B\] {{return 1;}} 3. 2 [Constant 2] (2) \[R = 2 + 0\cdot A + 0\cdot B\] {{return 2;}} 4. A [Value of A] (A) \[R = A + 0\cdot B\] {{return A;}} 5. A + B [Sum of A and B] (sum) \[R = A + B\] {{return A + B;}} 6. A - B [Difference of A and B] (diff) \[R = A - B\] {{return A - B;}} 7. AB [Product of A and B] (prod) \[R = AB\] {{return A*B;}} 8. A &amp;amp;#247; B [Truncated Quotient of A by B] (div) \[R = \left\{ {\begin{array}{*{20}{l}}!!{\rm{anything}}&amp;amp;{{\rm{if\ }}B = 0} \\!!{\left\lfloor {\frac{A}{B}} \right\rfloor _0}&amp;amp;{{\rm{otherwise}}}!!\end{array}} \right.\] {{return A/B;}} 9. A &amp;amp;#247; B Remainder [Remainder after Division of A by B] (rem) \[R = \left\{ {\begin{array}{*{20}{l}}!!{\rm{anything}}&amp;amp;{{\rm{if\ }}B = 0} \\!!{A - B\left\lfloor {\frac{A}{B}} \right\rfloor _0}&amp;amp;{{\rm{otherwise}}}!!\end{array}} \right.\] {{return A % B;}} 10. A modulo |B| [A Modulo |B|] (mod) \[R = \left\{ {\begin{array}{*{20}{l}}!!{\rm{anything}}&amp;amp;{{\rm{if\ }}B = 0} \\!!{A\operatorname{mod} \left| B\right|}&amp;amp;{{\rm{otherwise}}}!!\end{array}} \right.\] {{   int X, Q;!!   X = B &amp;lt; 0 ? -B : B;!!   Q = A % X;!!   return Q &amp;lt; 0 ? Q + X : Q;}} 11. A = B [A Equals B] (is) \[R = \left\{ {\begin{array}{*{20}{l}}!!{1}&amp;amp;{{\rm{if\ }}A = B} \\!!{0}&amp;amp;{{\rm{otherwise}}}!!\end{array}} \right.\] {{return A == B;}} 12. |A| &amp;gt; |B| [A is of Greater Magnitude than B] (gmag) \[R = \left\{ {\begin{array}{*{20}{l}}!!{1}&amp;amp;{{\rm{if\ }}\left| A\right| &amp;gt; \left| B\right|} \\!!{0}&amp;amp;{{\rm{otherwise}}}!!\end{array}} \right.\] {{return (A &amp;gt; 0 ? A : -A) &amp;gt; (B &amp;gt; 0 ? B : -B);}} 13. A &amp;amp;and; B [Both A and B are Nonzero] (and) \[R = \left\{ {\begin{array}{*{20}{l}}!!{1}&amp;amp;{{\rm{if\ }}\left( A \neq 0\right) \wedge \left( B \neq 0\right)} \\!!{0}&amp;amp;{{\rm{otherwise}}}!!\end{array}} \right.\] {{return A &amp;amp;&amp;amp; B;}} 14. A &amp;amp;or; B [Either A or B is Nonzero] (or) \[R = \left\{ {\begin{array}{*{20}{l}}!!{1}&amp;amp;{{\rm{if\ }}\left( A \neq 0\right) \vee \left( B \neq 0\right)} \\!!{0}&amp;amp;{{\rm{otherwise}}}!!\end{array}} \right.\] {{return A || B;}} 15. A &amp;amp;#8891; B [Either A or B is Nonzero, but Not Both] (xor) \[R = \left\{ {\begin{array}{*{20}{l}}!!{1}&amp;amp;{{\rm{if\ }}\left( A \neq 0\right) \wedge \left( B = 0\right)} \\!!{1}&amp;amp;{{\rm{if\ }}\left( A = 0\right) \wedge \left( B \neq 0\right)} \\!!{0}&amp;amp;{{\rm{otherwise}}}!!\end{array}} \right.\] {{return (A != 0) ^ (B != 0);}} 16. A&amp;lt;sup&amp;gt;B&amp;lt;/sup&amp;gt; [A to the Power of B] (pow) \[R = \left\{ {\begin{array}{*{20}{l}}!!{A^B}&amp;amp;{{\rm{if\ }}B \geq 0\rm{\ or\ }\left| A\right| = 1} \\!!{0}&amp;amp;{{\rm{otherwise}}}!!\end{array}} \right.\] {{return (int)pow( A, B );}} 17. &amp;amp;#189;(A + B) [Average (Arithmetic Mean) of A and B] (avg) \[R = \left\lfloor\frac{A + B}{2}\right\rfloor _0\] {{return (A + B)/2;}} 18. A&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; + B&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; [Sum of Squares of A and B] (sumsqs) \[R = A^2 + B^2\] {{return A*A + B*B;}} 19. A&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; - B&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; [Difference of Squares of A and B] (diffsqs) \[R = A^2 - B^2\] {{return A*A - B*B;}} 20. &amp;amp;#189;((-1)&amp;lt;sup&amp;gt;A&amp;lt;/sup&amp;gt; - (-1)&amp;lt;sup&amp;gt;B&amp;lt;/sup&amp;gt;) [Synchronicity of A and B] (sync) \[R = \left( -1\right)^A - \left( -1\right)^B\] {{return (int)(pow( -1, A ) - pow( -1, B ));}} 21. |A + B| [Absolute Sum of A and B] (abssum) \[R = \left| A + B\right|\] {{return A + B &amp;lt; 0 ? -(A + B) : (A + B);}} 22. |A - B| [Distance from A to B] (dist) \[R = \left| A - B\right|\] {{return A &amp;lt; B ? (B - A) : (A - B);}} 23. max( A, B ) [Maximum of A and B] (max) \[R = \max\left( A, B\right)\] {{return A &amp;gt; B ? A : B;}} 24. min( A, B ) [Minimum of A and B] (min) \[R = \min\left( A, B\right)\] {{return A &amp;lt; B ? A : B;}} 25. minmod( A, B ) [Minmod Limiter] (minmod) \[R = \left\{ {\begin{array}{*{20}{l}}!!{\min\left( A, B\right)}&amp;amp;{{\rm{if\ }}A &amp;gt; 0 {\rm\ and\ } B &amp;gt; 0} \\!!{\max\left( A, B\right)}&amp;amp;{{\rm{if\ }}A &amp;lt; 0 {\rm\ and\ } B &amp;lt; 0} \\!!{0}&amp;amp;{{\rm{otherwise}}}!!\end{array}} \right.\] {{   if( A &amp;gt; 0 &amp;amp;&amp;amp; B &amp;gt; 0 )!!      return A &amp;lt; B ? A : B;!!   if( A &amp;lt; 0 &amp;amp;&amp;amp; B &amp;lt; 0 )!!      return A &amp;gt; B ? A : B;!!   return 0;}} 26. A ? B : 0 [Return B Conditionally] (condb) \[R = \left\{ {\begin{array}{*{20}{l}}!!{B}&amp;amp;{{\rm{if\ }}A \neq 0} \\!!{0}&amp;amp;{{\rm{otherwise}}}!!\end{array}} \right.\] {{return A ? B : 0;}} 27. &amp;amp;#189;(A + B)(|B - A| + 1) [Sum of Integers from A to B] (sumatob) \[R = \frac{\left( A + B\right)\left( \left| B - A\right| + 1\right)}{2}\] {{return (A + B)*((B &amp;lt; A ? (A - B) : (B - A)) + 1)/2;}} 28. A &amp;lt;&amp;lt;&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt; B [Left-shift A by B Zeroes in Binary] (rsh) \[R = \left\{ {\begin{array}{*{20}{l}}!!{2^B A}&amp;amp;{{\rm{if\ }}B \geq 0} \\!!{\left\lfloor\frac{A}{2^{-B}}\right\rfloor _0}&amp;amp;{{\rm{otherwise}}}!!\end{array}} \right.\] {{return B &amp;gt;= 0 ? A*(1 &amp;lt;&amp;lt; B) : A/(1 &amp;lt;&amp;lt; -B);}} 29. A &amp;lt;&amp;lt;&amp;lt;sub&amp;gt;10&amp;lt;/sub&amp;gt; B [Left-shift A by B Zeroes in Decimal] (rsh10) \[R = \left\{ {\begin{array}{*{20}{l}}!!{10^B A}&amp;amp;{{\rm{if\ }}B \geq 0} \\!!{\left\lfloor\frac{A}{10^{-B}} \right\rfloor _0}&amp;amp;{{\rm{otherwise}}}!!\end{array}} \right.\] {{return (int)A*pow( 10, B );}} 30. A + sgn(B - A) [Increment A Towards B] (twrdb) \[R = A + \operatorname{sgn}\left( B - A \right)\] {{return A + (B &amp;gt; A) - (B &amp;lt; A);}} 31. |A| sgn(B) [Magnitude of A with the Phase of B] (magphs) \[R = \left| A\right|\operatorname{sgn}\left( B\right)\] {{return (A &amp;lt; 0 ? -A : A)*((B &amp;gt; 0) - (B &amp;lt; 0));}} 32. |A| &amp;gt; |B| ? A : B [Return Furthest From Zero: A or B] (ffzero) \[R = \left\{ {\begin{array}{*{20}{l}}!! {A\rm{\ or\ }B}&amp;amp;{{\rm{if\ }}\left| A\right| = \left| B\right|} \\!!{A}&amp;amp;{{\rm{if\ }}\left| A\right| &amp;gt; \left| B\right|} \\!!{B}&amp;amp;{{\rm{otherwise}}}!!\end{array}} \right.\] {{return (A &amp;lt; 0 ? -A : A) &amp;gt; (B &amp;lt; 0 ? -B : B) ? A : B;}} 33. gcd( |A|, |B| ) [Greatest Common Denominator of A and B] (gcd) \[R = \left\{ {\begin{array}{*{20}{l}}!!{\rm{anything}}&amp;amp;{{\rm{if\ }}A = 0\rm{\ or\ }B = 0} \\!!{\operatorname{gcd}\left( {\left| A\right| , \left| B\right|}\right)}&amp;amp;{{\rm{otherwise}}}!!\end{array}} \right.\] {{   int X, Y, T;!!   X = A &amp;lt; 0 ? -A : A;!!   Y = B &amp;lt; 0 ? -B : B;!!   while( Y != 0 ) {!!      T = Y;!!      Y = X % Y;!!      X := T;!!   }!!   return X;}} 34. lcm( |A|, |B| ) [Least Common Multiple of A and B] (lcm) \[R = \left\{ {\begin{array}{*{20}{l}}!!{\rm{anything}}&amp;amp;{{\rm{if\ }}A = 0\rm{\ or\ }B = 0} \\!!{\frac{AB}{\operatorname{gcd}\left( {\left| A\right| , \left| B\right|}\right)}}&amp;amp;{{\rm{otherwise}}}!!\end{array}} \right.\] {{   int X, Y, T, P;!!   X = A &amp;lt; 0 ? -A : A;!!   Y = B &amp;lt; 0 ? -B : B;!!   P = X*Y;!!   while( Y != 0 ) {!!      T = Y;!!      Y = X % Y;!!      X := T;!!   }!!   return P/X;}} 35. A*B/(A + B) [Harmonic Mean of A and B] (harm) \[R = \left\{ {\begin{array}{*{20}{l}}!!{\rm{anything}}&amp;amp;{{\rm{if\ }}A + B = 0} \\!!{\left\lfloor\frac{AB}{A + B}\right\rfloor _0}&amp;amp;{{\rm{otherwise}}}!!\end{array}} \right.\] {{return A*B/(A + B);}} 36. max(-|B|,min(|B|,A)) [Value of A Clipped to +/-|B|] (clip) \[R = \max\left( -\left| B\right| , \min\left( \left| B\right| , A\right)\right)\] {{   int X;!!   X = B &amp;lt; 0 ? -B : B;!!   return A &amp;lt; -B ? -B : (A &amp;gt; B : B : A);}} 37. A|B| - B|A| [Commutator Bracket of A and B] (comm) \[R = A\left| B\right| - B\left| A\right|\] {{return A*B &amp;lt; 0 ? (2*A*B*((B &amp;gt; 0) - (B &amp;lt; 0))) : 0;}} 38. |A| mod 10 = |B| mod 10 [A and B Have Same Last Decimal Digit] (sameldd) \[R = \left\{ {\begin{array}{*{20}{l}}!!{1}&amp;amp;{{\rm{if\ }}\left| A\right| = \left| B\right|\;\;\left(\operatorname{mod} 10\right)} \\!!{0}&amp;amp;{{\rm{otherwise}}}!!\end{array}} \right.\] {{   int X, Y;!!   X = A &amp;lt; 0 ? -A : A;!!   Y = B &amp;lt; 0 ? -B : B;!!   return X % 10 == Y % 10;}} 39. (A&amp;lt;sup&amp;gt;B&amp;lt;/sup&amp;gt; - 1)/(A - 1) [Sum of First B Terms in Power Series 1 + A + A&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; + ...] (pwrsrs) \[R = \left\{ {\begin{array}{*{20}{l}}!!{\rm{anything}}&amp;amp;{{\rm{if\ }}B &amp;lt; 0} \\!!{\rm{anything}}&amp;amp;{{\rm{if\ }}A \leq 1} \\!!{\frac{A^B - 1}{A - 1}}&amp;amp;{{\rm{otherwise}}}!!\end{array}} \right.\] {{return (int)(pow( A, B ) - 1)/(A - 1);}} 40. B&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;/(A&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; + 1) [Squared Distance of the Line Ax + B to the Origin] (sqdist2orgn) \[R = \frac{B^2}{A^2 + 1}\] {{return B*B/(A*A + 1);}}&amp;lt;/div&amp;gt;&amp;lt;script type=&quot;text/javascript&quot;&amp;gt;$('#main').html( '&amp;lt;table&amp;gt;' + $('#main').html().replace( /([^\[]+) \[(.+?)\] \((.+?)\) \\\[(.+?)\\\] \{\{(.+?)\}\}/g, '&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;$1&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;$2 (&amp;lt;span&amp;gt;$3&amp;lt;/span&amp;gt;)&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;\\[$4\\]&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;$5&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;' ).replace( /!!/g, &quot;\n&quot; ) + '&amp;lt;/table&amp;gt;' );&amp;lt;/script&amp;gt;&amp;lt;script type=&quot;text/x-mathjax-config;executed=true&quot;&amp;gt;MathJax.Hub.Config( { &quot;HTML-CSS&quot;: { preferredFont: &quot;TeX&quot;, availableFonts: [&quot;STIX&quot;,&quot;TeX&quot;], linebreaks: { automatic: true }, EqnChunk: (MathJax.Hub.Browser.isMobile ? 10 : 50) }, tex2jax: { inlineMath: [ [&quot;$&quot;, &quot;$&quot;], [&quot;\\\\(&quot;,&quot;\\\\)&quot;] ], displayMath: [ [&quot;$$&quot;,&quot;$$&quot;],[&quot;\\[&quot;, &quot;\\]&quot;] ], processEscapes: true, ignoreClass: &quot;tex2jax_ignore|dno&quot; }, TeX: { noUndefined: { attributes: { mathcolor: &quot;red&quot;, mathbackground: &quot;#FFEEEE&quot;, mathsize: &quot;90%&quot; }}, Macros: { href: &quot;{}&quot; } }, messageStyle: &quot;none&quot; } );&amp;lt;/script&amp;gt;&amp;lt;script src=&quot;//cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS_HTML-full&quot;&amp;gt;&amp;lt;/script&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Nature of &lt;code&gt;f&lt;/code&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The properties of &lt;code&gt;f&lt;/code&gt; are summarized as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The operations in &lt;code&gt;f&lt;/code&gt; are purchased with operation points (OP) and branching points (BP). &lt;code&gt;f&lt;/code&gt; is implemented using no more than &lt;strong&gt;120 OP&lt;/strong&gt; and no more than &lt;strong&gt;20 BP&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;OP and BP purchases costs apply once per code element purchased. For example, the code&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;while( A &amp;gt; 0 )&#xA;   A = A - B;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;incurs the costs of one &lt;code&gt;while&lt;/code&gt; loop, one condition, one assignment, and one binary operation, even if the condition, assignment, and binary operation may be evaluated more than once.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No unary operations are permitted.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Constant conditions (e.g. &lt;code&gt;true&lt;/code&gt;, &lt;code&gt;false&lt;/code&gt;, or equivalent) are permitted. All non-constant conditions must be explicit (e.g. no &lt;code&gt;if( A )&lt;/code&gt;).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Only the binary operations and conditions listed under &quot;Binary Operations and Conditions&quot; are permitted.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The ternary operation &lt;code&gt;&amp;lt;condition&amp;gt; ? &amp;lt;iftrue&amp;gt; : &amp;lt;iffalse&amp;gt;&lt;/code&gt; is permitted at the cost of 1 BP plus any cost(s) associated with the operands. Languages that don't explicitly support this ternary operation may implement it as a function.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;f&lt;/code&gt; must return a result in worst case &lt;code&gt;O(log max(|A|,|B|))&lt;/code&gt; time or better.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;f&lt;/code&gt; may recursively invoke itself at a cost of &lt;em&gt;either&lt;/em&gt; 1 BP or 2 OP, but only to a worst case stack depth of &lt;code&gt;O(log max(|A|,|B|))&lt;/code&gt; or better.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The following control structures are permitted in &lt;code&gt;f&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;if&lt;/code&gt; blocks cost 1 BP each plus the cost of the branch condition&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;if else&lt;/code&gt; blocks cost 2 BP each plus the cost of the branch condition&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;if elseif&lt;/code&gt; blocks cost 1 BP per &lt;code&gt;if&lt;/code&gt;, &lt;code&gt;elseif&lt;/code&gt;, or &lt;code&gt;else&lt;/code&gt;, plus the cost(s) of any branch conditions&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;while&lt;/code&gt; loops and &lt;code&gt;for&lt;/code&gt; loops cost 2 BP each plus the cost(s) of any initialization, loop condition, and loop update statements&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;do while&lt;/code&gt; loops cost 1 BP each plus the cost of the loop condition&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;goto&lt;/code&gt;, &lt;code&gt;break&lt;/code&gt;, named &lt;code&gt;break&lt;/code&gt;, &lt;code&gt;continue&lt;/code&gt;, and named &lt;code&gt;continue&lt;/code&gt; statements cost 1 BP each&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;return&lt;/code&gt; statements cost 1 BP each, with the exception of the last top-level &lt;code&gt;return&lt;/code&gt; that appears in &lt;code&gt;f&lt;/code&gt;, which costs nothing&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Programming languages that do not support the above structures may implement them as separate functions/methods/closures or as semantically equivalent code. For example, the code&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; while( 1 ) {&#xA;    &amp;lt;statement&amp;gt;&#xA;    ...&#xA;    if( A == B )&#xA;       break;&#xA; }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is semantically equivalent to the code&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; do {&#xA;    &amp;lt;statement&amp;gt;&#xA;    ...&#xA; } while( A != B )&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and hence the former may be used at the cost of 1 BP (the cost of a &lt;code&gt;do while&lt;/code&gt; loop).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Variables and Data Types&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Variables and data types in &lt;code&gt;f&lt;/code&gt; are summarized as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;No variables may be defined or used by &lt;code&gt;f&lt;/code&gt; except for the parameters &lt;code&gt;A&lt;/code&gt;, &lt;code&gt;B&lt;/code&gt;, &lt;code&gt;L&lt;/code&gt;, &lt;code&gt;x&lt;/code&gt;, &lt;code&gt;y&lt;/code&gt;, &lt;code&gt;z&lt;/code&gt;, which may be both read and assigned. Variable assignments may not be chained or nested in expressions (e.g. &lt;code&gt;A = B = 0&lt;/code&gt;, &lt;code&gt;w = y == 1 || (z = 10)&lt;/code&gt; are not permitted). If a programming language does not support assignment to parameters, parameters may alternatively be copied into proxy local variables at the start of the function. Once this is done, the original parameters may not be referenced.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Variable assignment incurs no OP or BP costs.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Assignment to &lt;code&gt;x&lt;/code&gt;, &lt;code&gt;y&lt;/code&gt;, and &lt;code&gt;z&lt;/code&gt; must respect the strict bounds on these variables. For example, if &lt;code&gt;A&lt;/code&gt; is not guaranteed to be bounded by [-2&lt;sup&gt;31&lt;/sup&gt;&amp;nbsp;&amp;nbsp;2&lt;sup&gt;31&lt;/sup&gt;), the assignment &lt;code&gt;x = A&lt;/code&gt; is an error and illegal, even if a programming language would ordinarily allow it. The assignment &lt;code&gt;x = A % 2&lt;/code&gt; (with the semantics of the &lt;code&gt;%&lt;/code&gt; operator defined below) is legal since all values of &lt;code&gt;A&lt;/code&gt; are guaranteed to yield a legal value of &lt;code&gt;x&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that these same restrictions apply when passing arguments to recursive invocations of &lt;code&gt;f&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It is recommended that &lt;code&gt;A&lt;/code&gt;, &lt;code&gt;B&lt;/code&gt;, &lt;code&gt;L&lt;/code&gt;, &lt;code&gt;x&lt;/code&gt;, &lt;code&gt;y&lt;/code&gt;, &lt;code&gt;z&lt;/code&gt; all be represented using the same type, but this is not a requirement. Implicit casts, explicit casts, method calls, and/or explicit function calls for converting between data types are allowed in all contexts, provided that both:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;no clipping, truncation, or wraparound occurs as a result of the conversion&lt;/li&gt;&#xA;&lt;li&gt;all operations on all data types are homomorphic to operations on the integers (notwithstanding the limited range of &lt;code&gt;x&lt;/code&gt;, &lt;code&gt;y&lt;/code&gt;, and &lt;code&gt;z&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Constants may be defined at no cost, but may only have values in the range [-2&lt;sup&gt;31&lt;/sup&gt;&amp;nbsp;&amp;nbsp;2&lt;sup&gt;31&lt;/sup&gt;). Constants with values outside this range can be realized via binary operations (e.g. &lt;code&gt;123456789*987654321&lt;/code&gt;) but these operations incur costs as normal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A constant may be defined using any data type and converted (implicitly or explicitly) to any data type so long as the conversion respects the rules listed above.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;A&lt;/code&gt;, &lt;code&gt;B&lt;/code&gt;, &lt;code&gt;L&lt;/code&gt; are ideally represented by a &quot;big integer&quot; type while &lt;code&gt;x&lt;/code&gt;, &lt;code&gt;y&lt;/code&gt;, &lt;code&gt;z&lt;/code&gt; are best represented as big integers or signed 32-bit &lt;code&gt;int&lt;/code&gt;s, but these are not requirements. In particular, an implementation of &lt;code&gt;f&lt;/code&gt; may choose to represent all variables using bounded data types, which is allowable subject to two restrictions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;under no circumstances may non-ideal effects such as clipping, truncation, floating point precision errors, etc. be used or exploited in the implementation of &lt;code&gt;f&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;any implementation of &lt;code&gt;f&lt;/code&gt; relying on bounded data types that has these types replaced with unbounded counterparts must function properly over all inputs in this expanded domain&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Binary Operations and Conditions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Only the following set of binary operations and conditions may be used in the implementation of &lt;code&gt;f&lt;/code&gt;. Each operation/condition has a cost of 1 OP. Operations/conditions may be implemented in any way (e.g. via infix operators, function calls, method calls, etc.) provided they are stateless and they conform exactly to the given definitions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;style&amp;gt;tr:first-child { font: bold 18px Times New Roman,Times,serif; }&amp;lt;/style&amp;gt;&amp;lt;style&amp;gt;td { text-align:center; }&amp;lt;/style&amp;gt;&amp;lt;style&amp;gt;tr:nth-child(2n) { background-color:#eee; }&amp;lt;/style&amp;gt;&amp;lt;style&amp;gt;tr:not(:first-child) td:nth-child(3) { font-family: Courier New,monospace; white-space: pre; }&amp;lt;/style&amp;gt;&amp;lt;script type=&quot;text/javascript&quot; src=&quot;http://code.jquery.com/jquery-1.10.1.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&amp;lt;div id=&quot;main&quot;&amp;gt;addition \[x + y\] {{x + y}} subtraction \[x - y\] {{x - y}} multiplication \[xy\] {{x*y}} integer division with truncation towards zero* \[\left\lfloor\frac{x}{y}\right\rfloor _0\] {{x/y}} remainder of integer division* \[x - y\left\lfloor\frac{x}{y}\right\rfloor _0\] {{x % y}} modulo** \[x \operatorname{mod} \left| y\right|\] {{int k, q;!!k = y &amp;lt; 0 ? -y : y;!!q = x % k;!!return q &amp;lt; 0 ? q + k : q;}} binary left shift \[{\begin{array}{*{20}{l}}!!{2^y x}&amp;amp;{{\rm{if\ }}y \geq 0} \\!!{\left\lfloor\frac{x}{2^{-y}} \right\rfloor _0}&amp;amp;{{\rm{otherwise}}}!!\end{array}}\] {{y &amp;gt;= 0 ? x*(1 &amp;lt;&amp;lt; y) :!!   x/(1 &amp;lt;&amp;lt; -y)}} binary right shift \[{\begin{array}{*{20}{l}}!!{\left\lfloor\frac{x}{2^y} \right\rfloor _0}&amp;amp;{{\rm{if\ }}B \geq 0} \\!!{2^{-y} x}&amp;amp;{{\rm{otherwise}}}!!\end{array}}\] {{y &amp;gt;= 0 ? x/(1 &amp;lt;&amp;lt; y) :!!   x*(1 &amp;lt;&amp;lt; -y)}} logical AND \[{\begin{array}{*{20}{l}}!!{1}&amp;amp;{{\rm{if\ }}\left( x \neq 0\right) \wedge \left( y \neq 0\right)} \\!!{0}&amp;amp;{{\rm{otherwise}}}\end{array}}\] {{x &amp;amp;&amp;amp; y}} logical OR \[{\begin{array}{*{20}{l}}!!{1}&amp;amp;{{\rm{if\ }}\left( x \neq 0\right) \vee \left( y \neq 0\right)} \\!!{0}&amp;amp;{{\rm{otherwise}}}\end{array}}\] {{x || y}} equality (Dirac delta) \[{\begin{array}{*{20}{l}}!!{1}&amp;amp;{{\rm{if\ }}x = y} \\!!{0}&amp;amp;{{\rm{otherwise}}}\end{array}}\] {{x == y}} inequality \[{\begin{array}{*{20}{l}}!!{1}&amp;amp;{{\rm{if\ }}x \neq y} \\!!{0}&amp;amp;{{\rm{otherwise}}}\end{array}}\] {{x != y}} less than \[{\begin{array}{*{20}{l}}!!{1}&amp;amp;{{\rm{if\ }}x &amp;lt; y} \\!!{0}&amp;amp;{{\rm{otherwise}}}\end{array}}\] {{r &amp;lt; y}} greater than \[{\begin{array}{*{20}{l}}!!{1}&amp;amp;{{\rm{if\ }}x &amp;gt; y} \\!!{0}&amp;amp;{{\rm{otherwise}}}\end{array}}\] {{x &amp;gt; y}} less than or equal to \[{\begin{array}{*{20}{l}}!!{1}&amp;amp;{{\rm{if\ }}x \leq y} \\!!{0}&amp;amp;{{\rm{otherwise}}}\end{array}}\] {{x &amp;lt;= y}} greater than or equal to \[{\begin{array}{*{20}{l}}!!{1}&amp;amp;{{\rm{if\ }}x \geq y} \\!!{0}&amp;amp;{{\rm{otherwise}}}\end{array}}\] {{x &amp;gt;= y}} bitwise AND of absolutes \[\begin{array}{*{20}{l}}!!{\sum\limits_k {{x_k}{y_k}{2^k}} {\rm{\ given}}} \\!!{\,\,\,\,\,\,\,\left| x \right| = \sum\limits_k {{x_k}{2^k}} } \\!!{\,\,\,\,\,\,\,\left| y \right| = \sum\limits_k {{y_k}{2^k}} } \\!!{\,\,\,\,\,\,\,{x_k},{y_k} \in \left\{ {0,1} \right\}\,\,\forall \,k}!!\end{array}\] {{(x &amp;lt; 0 ? -x : x) &amp;amp;   !!(y &amp;lt; 0 ? -y : y)}}&amp;lt;/div&amp;gt;&amp;lt;hr&amp;gt;&amp;lt;div&amp;gt;*division by zero is a fatal error&amp;lt;br&amp;gt;**modulo zero is a fatal error&amp;lt;/div&amp;gt;&amp;lt;script type=&quot;text/javascript&quot;&amp;gt;$('#main').html( '&amp;lt;table cellspacing=&quot;0&quot;&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;Operation&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Definition&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;C Code (gcc)&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;' + $('#main').html().replace( /([^\[]+) \\\[(.+?)\\\] \{\{(.+?)\}\}/g, '&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;$1&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;\\[$2\\]&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;$3&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;' ).replace( /!!/g, &quot;\n&quot; ) + '&amp;lt;/table&amp;gt;' );&amp;lt;/script&amp;gt;&amp;lt;script type=&quot;text/x-mathjax-config;executed=true&quot;&amp;gt;MathJax.Hub.Config( { &quot;HTML-CSS&quot;: { preferredFont: &quot;TeX&quot;, availableFonts: [&quot;STIX&quot;,&quot;TeX&quot;], linebreaks: { automatic: true }, EqnChunk: (MathJax.Hub.Browser.isMobile ? 10 : 50) }, tex2jax: { inlineMath: [ [&quot;$&quot;, &quot;$&quot;], [&quot;\\\\(&quot;,&quot;\\\\)&quot;] ], displayMath: [ [&quot;$$&quot;,&quot;$$&quot;],[&quot;\\[&quot;, &quot;\\]&quot;] ], processEscapes: true, ignoreClass: &quot;tex2jax_ignore|dno&quot; }, TeX: { noUndefined: { attributes: { mathcolor: &quot;red&quot;, mathbackground: &quot;#FFEEEE&quot;, mathsize: &quot;90%&quot; }}, Macros: { href: &quot;{}&quot; } }, messageStyle: &quot;none&quot; } );&amp;lt;/script&amp;gt;&amp;lt;script src=&quot;//cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS_HTML-full&quot;&amp;gt;&amp;lt;/script&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Objective&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your objective is to write a function or a program containing a function that implements as many of the 40 operations of &lt;code&gt;f&lt;/code&gt; as possible. When invoked at the top level, the arguments of &lt;code&gt;f&lt;/code&gt; are assigned as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt; specify the two general operands for the operation being selected. For any of the 40 listed operations where the result is not symmetric in &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt;, you may return a result for &lt;em&gt;swapped&lt;/em&gt; &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt; if desired. For example, the function &lt;code&gt;A + sgn(B - A)&lt;/code&gt; may alternatively return the value of &lt;code&gt;B + sgn(A - B)&lt;/code&gt;. Operations with swapped operands should be documented in your submission.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;L&lt;/code&gt; must always be zero when passed to the top level invocation of &lt;code&gt;f&lt;/code&gt;. Recursive invocations of &lt;code&gt;f&lt;/code&gt; may pass any legal value to &lt;code&gt;L&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;x&lt;/code&gt;, &lt;code&gt;y&lt;/code&gt; and &lt;code&gt;z&lt;/code&gt; collectively specify the operation to be performed. This datum can be encoded any way you desire (respecting the limited range of these parameters). Your submission should include a list of at least one (&lt;code&gt;x&lt;/code&gt;,&lt;code&gt;y&lt;/code&gt;,&lt;code&gt;z&lt;/code&gt;) tuple per implemented operation that causes &lt;code&gt;f&lt;/code&gt; to compute the result for that operation. You may assume that only these tuples will be passed to a top level invocation of &lt;code&gt;f&lt;/code&gt;, hence &lt;code&gt;f&lt;/code&gt; may exhibit arbitrary behaviour (including errors and/or illegal operations) if undocumented tuples are passed to top level invocations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As with &lt;code&gt;L&lt;/code&gt;, recursive invocations of &lt;code&gt;f&lt;/code&gt; may pass any legal values to &lt;code&gt;x&lt;/code&gt;, &lt;code&gt;y&lt;/code&gt;, and &lt;code&gt;z&lt;/code&gt;. The results of any such intermediary operations need not be documented.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Scoring rules are as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;code&gt;f&lt;/code&gt; &lt;em&gt;does not&lt;/em&gt; implement all 40 operations, score 10 points per implemented operation plus 1 point per unused BP plus 1 point per unused OP.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;f&lt;/code&gt; &lt;em&gt;does&lt;/em&gt; implement all 40 operations, score 400 points plus 50 points per unused BP plus 25 points unused OP.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The highest scoring submission is the winner.&lt;/p&gt;&#xA;" OwnerUserId="31019" LastEditorUserId="31019" LastEditDate="2014-12-02T01:57:06.373" LastActivityDate="2014-12-02T01:57:06.373" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2549" PostTypeId="1" AcceptedAnswerId="2551" CreationDate="2014-12-04T17:18:41.770" Score="2" ViewCount="108" Body="&lt;p&gt;The comment at &lt;a href=&quot;https://codegolf.stackexchange.com/questions/41833/sum-of-strings-without-converting/41840#comment97724_41846&quot;&gt;Sum of strings without converting&lt;/a&gt; displays strangely on Firefox 33.1 on OSX 10.9.5.  Look at the numeral &lt;code&gt;1&lt;/code&gt; inside the parens in &lt;code&gt;each_cons(10)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any idea why?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What is that character that got in there?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/7CTK4.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="13950" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2014-12-04T20:15:13.673" Title="Does anyone know why there's a weird symbol in place of the 1 in this comment?" Tags="|discussion|bug|status-bydesign|comments|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2551" PostTypeId="2" ParentId="2549" CreationDate="2014-12-04T20:14:08.330" Score="3" Body="&lt;p&gt;Let's take a look at the HTML:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/fmUru.png&quot; alt=&quot;html&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As you can see, a &lt;code&gt;&amp;amp;zwnj;&amp;amp;#8203;&lt;/code&gt; was automatically inserted by the Stack Exchange software. &lt;a href=&quot;https://meta.stackexchange.com/q/170970/180276&quot;&gt;This has been reported on The Mother Meta&lt;/a&gt; (and the reason was provided by @TimStone in the comments on that question).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Seeing as I don't see the symbol on Chromium or Firefox on Ubuntu or the app on Android, it's probably a font problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As further evidence, the comment I've posted below should have the same strange character in it for you.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-12-04T20:14:08.330" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2556" PostTypeId="2" ParentId="824" CreationDate="2014-12-06T17:26:00.323" Score="1" Body="&lt;p&gt;There are good reasons why duplicate questions should not be allowed in a Question and Answer site. If allowed, the information would become fragmented and people looking for answers would only see part of the answers available when searching.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Programming Puzzle site, although built on the Stack Exchange platform, has different goals. Programmers create clever puzzles as questions and other programmers compete with solution posted as &quot;answers&quot;. Does it matter if we have a similar or duplicate puzzle on this site? If somebody invents Monopoly and we have a great game, are we concerned when the game is brought out 6 months later for another game? We may worry that solutions may be a copy from the previous session, but is that a problem? New players will present new solutions and new ideas. The site loses nothing by revisiting a puzzle. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the new puzzle has a few changes over the older puzzle, older solutions may be refined and adapted to the new requirement, or new solutions crafted from scratch. In either case the site will stimulate more clever solutions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may ask, why not just offer a solution to the old puzzle? Puzzles and their community seem to have a lifetime of a few days. After a week or two, new solutions will not be seen by many programmers as the community have moved on. When the monopoly board is brought out again, players that enjoyed the last round and new players can join in again in building clever solutions. But perhaps exact duplicates should still be discouraged. Some fresh twists in the Monopoly rules would motivate some new thinking on the solutions instead of just a copy and paste operation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Stack Exchange platform allows marking questions (puzzles) as duplicates and there is a culture of discouraging similar puzzles, but this a feature we should use sparingly on PPCG.&lt;/p&gt;&#xA;" OwnerUserId="31785" LastActivityDate="2014-12-06T17:26:00.323" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2557" PostTypeId="1" AcceptedAnswerId="2558" CreationDate="2014-12-06T23:50:50.583" Score="15" ViewCount="503" Body="&lt;p&gt;From &lt;a href=&quot;https://meta.stackexchange.com/q/240634/180276&quot;&gt;this post on the Mother Meta&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A handful of sites have conducted a variation of the &quot;weekly topic challenge&quot; idea. I, myself, have become quite fond of them since they do seem to be &lt;a href=&quot;https://judaism.meta.stackexchange.com/questions/1233/how-effective-is-the-weekly-topic-challenge-proposal-in-generating-new-questions&quot;&gt;effective at increasing asking rate&lt;/a&gt; &lt;em&gt;and&lt;/em&gt; can be a lot of fun. I've personally initiated challenges on several sites (most recently on &lt;a href=&quot;https://history.meta.stackexchange.com/questions/1956/weekly-topic-challenge&quot;&gt;History&lt;/a&gt; and &lt;a href=&quot;https://philosophy.meta.stackexchange.com/questions/1728/weekly-topic-challenge&quot;&gt;Philosophy&lt;/a&gt;) and have worked out a simple process.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The first step mentioned is to ask for topic ideas, but first we have to decide whether we want these challenges at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's a summary of how it would work:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;A meta question is posted&lt;/strong&gt; asking for topic ideas. You can suggest as many ideas as you want.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Every week, a topic is picked&lt;/strong&gt; to be the subject of the week. (Other sites have done biweekly challenges instead, but PPCG is reasonably active enough to have one per week.) This would most likely be done by picking the highest voted submission.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Results are tallied, rinse and repeat.&lt;/strong&gt; (The results are meant to analyze how the weekly challenge went, and will include how many posts were generated as a result of it, how many votes and answers they got, etc.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Since PPCG is more of an... unconventional Stack Exchange site, the weekly challenge wouldn't be asking for just &lt;em&gt;questions&lt;/em&gt;. It could ask for a certain type of programming challenge, perhaps...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;one that you feel is underrepresented on this site (such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/boggle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;boggle&amp;#39;&quot; rel=&quot;tag&quot;&gt;boggle&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;one that fits a certain theme (we could have winter-themed questions in December or January)&lt;/li&gt;&#xA;&lt;li&gt;one that you want to see users here work together on optimizing or golfing further&lt;/li&gt;&#xA;&lt;li&gt;or just something that you think would be interesting.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This could be effective at increasing our low and ever-decreasing question volume, but then again, quality != quantity. So what do you think? Post your thoughts on this below, and if most of us agree that it'd be a good idea for the site, I'll post the meta question mentioned in step 1 and the challenges will start shortly (probably on Friday, as suggested by the MSE post).&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-12-11T04:04:49.467" Title="Do we want weekly challenges?" Tags="|discussion|weekly-challenges|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="2558" PostTypeId="2" ParentId="2557" CreationDate="2014-12-07T00:32:24.307" Score="14" Body="&lt;p&gt;In principle, I think this is a nice idea. However, if we take the concept without any modification, it might not work as well on PPCG as it does on other sites. Some general concerns:&lt;/p&gt;&#xA;&lt;h2&gt;Sandboxing&lt;/h2&gt;&#xA;&lt;p&gt;As you said, quality ≠ quantity, and if we just tell people &amp;quot;hey, pose loads of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/boggle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;boggle&amp;#39;&quot; rel=&quot;tag&quot;&gt;boggle&lt;/a&gt; challenges this week&amp;quot;, I think the results are going to be rather poor. Therefore, these challenges (which are posted for the sake of increasing question volume) would probably benefit from the sandbox even more than usual. So I suggest we should take sandboxing into account for the schedule. E.g. once the topic is decided, people get a  week for coming up with challenges and sandboxing them, and then they are posted the following week when they're ready. This should help weed out duplicates, generally bad specs and questions that just weren't well thought through.&lt;/p&gt;&#xA;&lt;h2&gt;Themes wear off&lt;/h2&gt;&#xA;&lt;p&gt;I'm not sure if having several questions about the same topic/concept/theme in a short time is a good thing on PPCG. It doesn't really matter on other sites, but people put a lot more time into answering some questions here than on other SEs, so unless you're &lt;em&gt;really&lt;/em&gt; into the current theme, it might wear off, so that people get enough of it after one challenge. We definitely need to keep the topic generic enough to allow for a fair bit of variety.&lt;/p&gt;&#xA;&lt;h2&gt;Quality first&lt;/h2&gt;&#xA;&lt;p&gt;Peter suggested in chat that something like &amp;quot;a challenge a week&amp;quot; would be a better fit for PPCG, and I think he has a point. (Disclaimer: what I'm suggesting below is completely unrelated to what he had in mind, but his comment sparked the following idea.) What if, instead of having a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graph-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graph-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;graph-theory&lt;/a&gt; week, where we get a surge of graph theory challenges, we take the week to &lt;em&gt;collaboratively&lt;/em&gt; work on an excellent question on the topic and post it the following Friday. We could tackle particularly tricky specs, challenges that need controller programs, or even test out some new territory.&lt;/p&gt;&#xA;&lt;p&gt;This would definitely emphasise quality, and not do much for quantity. But if a bunch of people are working on a challenge, throwing ideas around, I'm sure there'll be enough material that doesn't make it into the challenge but could be reused in the future (or even in parallel, if it's sufficiently different).&lt;/p&gt;&#xA;&lt;p&gt;This is how the time frame could work:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Week 1:&lt;/strong&gt; We collect ideas for a theme or a vague challenge concept. Because this is intended for only a single challenge, this can (but doesn't have to be) a bit more specific. Like &amp;quot;a King-of-the-Hill surrounding genetic algorithms&amp;quot;, or &amp;quot;an optimisation challenge for [mathematical problem X] in hopes of getting some interesting new results&amp;quot;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Week 2:&lt;/strong&gt; A theme/concept is chosen from the suggestions and those who are interested get cracking on sandboxing it, sorting out the details of the spec, writing a controller if necessary. Of course, if any additional challenges are conceived of in the process, those should also be sandboxed by all means.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Week 3:&lt;/strong&gt; The challenge is posted (we'd have to decide by whom, but I'm sure we can agree on something) and run, and at the end of the week, we do an evaluation of how well things went.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And then, repeat. In fact, these three stages could be pipelined. While we're working out the details of one challenge, we could already vote on the next round, and work that one out while the first one is being run on main.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-12-08T10:55:54.273" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="2561" PostTypeId="2" ParentId="2140" CreationDate="2014-12-07T22:22:06.333" Score="1" Body="&lt;h1&gt;Origami Code Golf&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I like origami (especially &lt;a href=&quot;http://en.wikipedia.org/wiki/Modular_origami&quot; rel=&quot;nofollow noreferrer&quot;&gt;unit origami&lt;/a&gt;), but lack the patience to actually complete a project. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sounds like a wonderful job for a computer!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Make a program or function that accepts a series of numbers (see next part) and outputs a folded version of a 1 x 1 square. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You will receive a list of numbers {a,b,c,d,e,f},{g,h,i,j,k,l}... (curly braces only added for clarity) Each set of numbers corresponds to 3 coordinates (a,b), (c,d) and (e,f). (a,b) and (c,d) each lie on the &lt;a href=&quot;http://en.wikipedia.org/wiki/Unit_square&quot; rel=&quot;nofollow noreferrer&quot;&gt;unit square&lt;/a&gt; (which also means that it is in the first quadrant). (e,f) lies within the unit square, but on a portion of the paper that is not on the line formed by (a,b) and (c,d).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(a,b) and (c,d) determine the line over which to fold the paper.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The portion of the paper that (e,f) lies in determines which side of the paper remains stationary during the fold. You may assume that this value will always lie on a portion of the square (e.g. not on a part of the square that is not there because of a fold).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the input 0.5, 0, 0.5, 1, 0.25, 0.5 means that one should fold the paper in half over the vertical line at 0.5, with the left side remaining stationary. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each fold (set of input numbers) is sequential, so one fold is made after another. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if the previous example was followed by the input 0, 0.5, 1, 0.5, 0.75, 0.75, the paper should be folded over the horizontal line at 0.5, with the top part remaining stationary.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program or function must only output (graphically) the resulting shape and rotation of the folding. It is not required to output the correct location or size.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;input 0, 0.5, 1, 0.5, 0.5, 0.75 - &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/RAkzK.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;input 0, 0, 1, 1, 0.25, 0.5 - &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/AkrND.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;input - 0.5, 1, 1, 0, 0.25, 0.5, 0, 0.25, 1, 0.25, 0.25, 0.75 -&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/9QKU0.png&quot; alt=&quot;enter image description here&quot;&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;input - 0.5, 0, 1, 0.5, 0.5, 0.5, 1, 0.5, 0.5, 1, 0.5, 0.5, 0.5, 1, 0, 0.5, 0.5, 0.5, 0, 0.5, 0.5, 0, 0.5, 0.5, 0, 0.25, 1, 0.25, 0.5, 0.5 &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/183f9.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, so shortest code (in bytes) wins.&lt;/p&gt;&#xA;" OwnerUserId="29820" LastEditorUserId="29820" LastEditDate="2014-12-08T23:05:08.760" LastActivityDate="2014-12-08T23:05:08.760" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2562" PostTypeId="1" AcceptedAnswerId="5024" CreationDate="2014-12-08T22:13:54.443" Score="19" ViewCount="604" Body="&lt;p&gt;A while back, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/292/latex-mathjax-support-would-be-nice&quot;&gt;people asked&lt;/a&gt; about whether to include LaTeX formatting on PCG.SE. The answer was generally no, because people believed that the filesize was too big and had too much of an effect on loading time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But then &lt;a href=&quot;https://puzzling.meta.stackexchange.com/questions/7/we-should-have-mathjax-what-should-the-escape-sequence-be/148#148&quot;&gt;Puzzling.SE got LaTeX support added&lt;/a&gt;, which was a few months after that question was last updated. I'm wondering whether it would be a good idea to reconsider bringing LaTeX to PCG.SE, since a lot of the programming puzzles I've personally written would definitely benefit from LaTeX notation:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/42249/find-a-points-position-on-the-integral-hilbert-curve&quot;&gt;Find a point's position on the integral Hilbert curve&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/31673/build-a-pair-of-spies-that-will-throw-stones-into-a-river&quot;&gt;Build a pair of spies that will throw stones into a river&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/26486/prisoners-dilemma-v-2-battle-royale&quot;&gt;Prisoner's Dilemma v.2 - Battle Royale&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/34441/build-a-mu-puzzle-solver&quot;&gt;Build a MU puzzle solver&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/24571/print-a-specific-value-in-this-generated-binary-matrix&quot;&gt;Print a specific value in this generated binary matrix&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Build an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/10845/build-an-adding-machine-using-nand-logic-gates&quot;&gt;adding machine&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/12261/build-a-multiplying-machine-using-nand-logic-gates&quot;&gt;multiplying machine&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/26194/build-a-minifloat-adding-machine-using-nand-logic-gates&quot;&gt;minifloat adding machine&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/25489/build-a-bit-counting-comparator-using-nand-logic-gates&quot;&gt;bit-counting comparator&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/24983/build-a-2-way-universal-logic-processor-using-nand-logic-gates&quot;&gt;2-way universal logic processor&lt;/a&gt; using NAND logic gates&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/11115/write-a-function-that-reduces-compositions-of-linear-operators&quot;&gt;Write a function that reduces compositions of linear operators&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/12360/build-a-solver-for-the-cow-and-chicken-problem&quot;&gt;Build a solver for the cow-and-chicken problem&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/12483/build-an-evaluator-for-nontrivial-resistance-diagrams&quot;&gt;Build an evaluator for nontrivial resistor diagrams&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Note that some of these questions also use code notation that should stay code notation; however, there are significantly many bits and pieces that would be preferable to format in LaTeX.&lt;/p&gt;&#xA;" OwnerUserId="7110" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2015-04-07T12:03:46.573" Title="Revisiting LaTeX" Tags="|feature-request|status-completed|latex|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="2566" PostTypeId="1" CreationDate="2014-12-10T10:32:10.577" Score="2" ViewCount="92" Body="&lt;p&gt;As I understand it, comments should be used to ask questions about the puzzle or the solutions, but not for a &quot;Thank You&quot; note. Sometimes people are very responsive and provide extensive information. There is no information or question I could add, but I would like to thank that person for their quick response and/or effort. There is always a possible +1 to the puzzle, solution, or comment but sometimes I would like to say more.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am currently experimenting with a new method. I add a Thank You note in the comment, then some time later delete it. This way the person (perhaps) sees their well-deserved Thank You, but the comment does not stay around to pollute the comment chain.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this an abuse of the comment system? Is there a better way to express gratitude? Ideally, there should be a thank you button which you may send more than once - then again, I often have a problem adding features to otherwise good software.&lt;/p&gt;&#xA;" OwnerUserId="31785" LastEditorUserId="66833" LastEditDate="2021-06-02T22:09:27.873" LastActivityDate="2021-06-02T22:09:27.873" Title="How do we thank people for outstanding work (beyond +1)?" Tags="|support|comments|incentives|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="2567" PostTypeId="1" CreationDate="2014-12-10T11:06:59.027" Score="10" ViewCount="213" Body="&lt;p&gt;The goal of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; was to &quot;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/403/new-code-golf-metric-atomic-code-golf&quot;&gt;level the playing field&lt;/a&gt;&quot;. However, languages with built-in bigints, symbols/atoms, regex literals etc can easily encode arbitrary programs into a few tokens.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, in Python 3 &lt;em&gt;any&lt;/em&gt; program can be encoded in 17 tokens using big-int + exec&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;exec(int.to_bytes(641958435660384548604510984268902312586768556585,20,'big'))&#xA;#1  23  45       67                                               89 01234567&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In Javascript &lt;em&gt;any&lt;/em&gt; string can be extracted from a regexp in 3 tokens:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;/this is some huge string/.source&#xA;#1                        23&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Many languages allow converting an identifier to a string through name lookup or built-in stringification method:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# Python, 20 tokens/string.&#xA;try:&#xA;    This_is_a_huge_string&#xA;except NameError as n:&#xA;    print(n.args[0][6:-16])&#xA;&#xA;# Ruby, using symbols, 4 tokens/string.&#xA;p :This_is_a_huge_string.to_s&#xA;&#xA;# Ruby, using variable names, 7 tokens/string.&#xA;p This_is_a_huge_string rescue $!.name.to_s&#xA;&#xA;// C++, using macros, 7 tokens + 4 tokens/string&#xA;#define STR(N) #N&#xA;int main() {&#xA;    puts(STR(This_is_a_huge_string));&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And these are actively used in recent atomic-code-golf questions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/42272/atomic-code-golf-determine-the-number-of-neutrons-in-an-isotope&quot;&gt;&amp;quot;Atomic&amp;quot; code golf - determine the number of neutrons in an isotope&lt;/a&gt; (using big-int and undefined symbols to encode strings)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/34644/shortest-expression-for-0-3-2-5-0-3-5-1-4-6-2-4&quot;&gt;Shortest expression for {0, 3, 2, 5, 0, 3, 5, 1, 4, 6, 2, 4}&lt;/a&gt; (using big-int to encode a lookup table)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I suggest we close the loophole in the future by modifying the rules:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;User-defined Variables&lt;/em&gt; (1 point each):&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Example: &lt;code&gt;%helloworld%&lt;/code&gt;, &lt;code&gt;func_a&lt;/code&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;em&gt;Strings&lt;/em&gt; (1 point per char)&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Example: &lt;code&gt;Hello World&lt;/code&gt; is 11 points &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;to &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;Non-built-in tokens&lt;/em&gt; (1 point per char)&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;integers, strings, user-defined identifiers, etc.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Example:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;code&gt;%helloworld%&lt;/code&gt; (12 points)&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;hello_world&lt;/code&gt; (11 points)&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;&quot;Hello world&quot;&lt;/code&gt; (13 points)&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;&quot;\r\n\U00012345&quot;&lt;/code&gt; (5 points, each escape count as 1 char)&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;/[a-zA-Z]/g&lt;/code&gt; (11 points)&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;1234567890&lt;/code&gt; (10 points)&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;&amp;amp;He110&lt;/code&gt; (6 points)&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;12.3e-123&lt;/code&gt; (9 points)&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;:symbol&lt;/code&gt; (7 points)&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;%w&amp;lt;Hello world&amp;gt;&lt;/code&gt; (15 points)&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;  &#xA;  &lt;p&gt;Variables that are introduced in prelude or external libraries are not counted towards user-defined variables, e.g.&lt;/p&gt;&#xA;  &#xA;  &lt;pre class=&quot;lang-java prettyprint-override&quot;&gt;&lt;code&gt;  float radius = Math.sqrt(area) / Math.PI;&#xA;//                   11   111111 1 1   22 2&#xA;//1     234567 8 9   01   234567 8 9   01 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="32353" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2014-12-10T14:32:52.500" Title="Count big-ints/symbols/variables as N tokens in atomic-code-golf" Tags="|discussion|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="2569" PostTypeId="2" ParentId="2566" CreationDate="2014-12-10T12:42:51.793" Score="4" Body="&lt;p&gt;We could always experiment with &lt;a href=&quot;https://codereview.meta.stackexchange.com/q/1320/36278&quot;&gt;a &quot;best of&quot; meta competition&lt;/a&gt; similar to Code Review's. We could do ours on a smaller scale, perhaps once every month or so.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you don't want to add clutter to the site, you could also ping the user in chat. (This will only work if he/she's been in the chatroom recently.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, there's always bounties for &lt;em&gt;really&lt;/em&gt; exceptional answers.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:47.013" LastActivityDate="2014-12-10T12:42:51.793" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2570" PostTypeId="2" ParentId="2567" CreationDate="2014-12-10T13:59:12.137" Score="7" Body="&lt;p&gt;Even though originally, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; was created to have a justified counting system across golfing and non-golfing based languages, it has expanded its scope a lot. For example, this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37188/multiply-with-restricted-operations&quot;&gt;xnor's question&lt;/a&gt; is about calculating the operations you do in your algorithm. No code at all. Same goes for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37071/implement-an-8-bit-adder&quot;&gt;this question&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/36425/convert-to-uppercase-and-lowercase-without-branching-and-comparisons&quot;&gt;this&lt;/a&gt; and many others.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moreover, this tag was never about counting by the right version of token in the code, but about counting atomic operations in the code. These atomic operations are defined by the question, thus do not carry a general meaning.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance, if the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/42272/atomic-code-golf-determine-the-number-of-neutrons-in-an-isotope&quot;&gt;original question&lt;/a&gt; which led to this meta post had a scoring criteria of overall operations in the code (splitting, base conversion, indexOf etc), then even though the CJam answer is 6 tokens long, the Python answer is 17 tokens long or the Mathematica answer is 9 tokens long, the actual score would have been almost equivalent and would have depended on the algorithm chosen.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thus, summarizing things, I leave it up to the question asker to define the scoring terms. If the question says its the number of tokens, let it be and lets count the code by total token count. These tokens are language tokens so things like &lt;code&gt;.&lt;/code&gt;, &lt;code&gt;[&lt;/code&gt;, &lt;code&gt;;&lt;/code&gt;, &lt;code&gt;(&lt;/code&gt; etc also count.&lt;/p&gt;&#xA;" OwnerUserId="31414" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2014-12-10T14:32:52.500" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2573" PostTypeId="1" AcceptedAnswerId="2575" CreationDate="2014-12-11T04:05:14.993" Score="5" ViewCount="143" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2558/3808&quot;&gt;The response to the weekly challenge question has been a resounding &quot;yes,&quot;&lt;/a&gt; so the next step is to decide how we'll manage the schedule. There'll be two simple parts to this, each taking one week:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Collect ideas for a theme or concept to base the challenge on, and choose the highest voted after a week.&lt;/li&gt;&#xA;&lt;li&gt;The challenge is collaboratively written, and it is then posted at the end of the week.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;These will be streamlined, so while one challenge is being written, ideas are already being collected for the next. So, on week one, we think of ideas for challenge #1; on week two, we write challenge #1 and think of ideas for challenge #2; on week three, we write challenge #2 and think of ideas for challenge #3; etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ideally, there should only be one meta post per week to reduce clutter. However, we could choose from any of these options:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Write challenges with meta questions, think of ideas with meta questions (2 per week)&lt;/li&gt;&#xA;&lt;li&gt;Write challenges with meta questions, think of ideas in a chatroom&lt;/li&gt;&#xA;&lt;li&gt;Write challenges in a chatroom, think of ideas with meta questions&lt;/li&gt;&#xA;&lt;li&gt;Write challenges in a chatroom, think of ideas in a chatroom&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;We could also experiment with any of the following: Use the sandbox to write the questions, use a Github repo or Google Doc to write them, use some sort of polling site to decide on ideas, or... something else? (Post an answer with any ideas below!)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for the dates, hopefully we can start this Friday or Saturday. (From &lt;a href=&quot;https://meta.stackexchange.com/q/240634/180276&quot;&gt;the Mother Meta post about weekly challenges&lt;/a&gt;: &quot;I like to give people a full week from Friday to Friday. That way people have the weekend to ponder the challenge and can start [...] when they get time on Monday.&quot;) If there's a clear consensus like there was on the other meta post here, we might be able to start on Friday; otherwise; we could start thinking of ideas for challenge #1 on Saturday and post on Friday for all challenges after that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, any thoughts? Assuming nobody objects in the answers and everyone seems to agree, the weekly challenges should start in a few days.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2014-12-11T05:08:14.210" Title="A proposed schedule for weekly challenges" Tags="|discussion|weekly-challenges|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="2575" PostTypeId="2" ParentId="2573" CreationDate="2014-12-11T04:19:27.593" Score="9" Body="&lt;ol start=&quot;5&quot;&gt;&#xA;&lt;li&gt;Write challenges in the sandbox + chat, use a single meta post to collect and vote on ideas.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Single&lt;/em&gt; meta post, as opposed to &lt;em&gt;weekly&lt;/em&gt; meta post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each week, the top-voted theme gets picked and deleted, allowing close seconds to bubble up for the next week. There's no need to throw away good ideas from the previous week or repost them. New ideas can still be added at any time. If we ever feel, this post gets too cluttered, and new ideas can't find their way to the top any more, we can still ditch it and start a new one. But for starters, I wouldn't make a separate post each week.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for writing the challenge, I think we've got the sandbox for that, and it's a good place to keep track of the spec in markdown. Discussion can happen in the comments there, or (more likely) in chat. Depending on how busy these discussions get, they could happen in The Nineteenth Byte or a dedicated chat room. I suggest we try keeping them in The Nineteenth Byte in the interest of increasing exposure of The Weekly Challenge Challenge, and if the discussion gets too spammy to use the chat room for much else, we can still move it out any time. (I'm just afraid if we move it to a separate chat room right away, we won't get much participation in writing the challenge.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;If&lt;/em&gt; it makes sense for a particular challenge, we can still use additional collaboration tools like GitHub (e.g. if a complex controller has to be written by multiple people). Until then, the tools we already have on SE, should suffice.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2014-12-11T05:08:14.210" LastActivityDate="2014-12-11T05:08:14.210" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="3576" PostTypeId="2" ParentId="2140" CreationDate="2014-12-13T13:29:08.400" Score="3" Body="&lt;h1&gt;Find the Minimum Width of a Set of Points&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/time-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;time-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;time-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a set of points in 2D space, you're to find the direction along which those points occupy the shortest width.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More formally, consider a set of &lt;em&gt;n&lt;/em&gt; points &lt;em&gt;P = {p&lt;sub&gt;1&lt;/sub&gt;, ..., p&lt;sub&gt;n&lt;/sub&gt;}&lt;/em&gt;, where &lt;em&gt;p&lt;sub&gt;i&lt;/sub&gt; = (x&lt;sub&gt;i&lt;/sub&gt;,y&lt;sub&gt;i&lt;/sub&gt;)&lt;/em&gt;, and a unit vector &lt;strong&gt;&lt;em&gt;d&lt;/strong&gt; = (x&lt;sub&gt;d&lt;/sub&gt;, y&lt;sub&gt;d&lt;/sub&gt;)&lt;/em&gt;. Now &lt;em&gt;K&lt;/em&gt; is the set of lengths obtained from &lt;a href=&quot;http://en.wikipedia.org/wiki/Projection_(linear_algebra)&quot; rel=&quot;nofollow noreferrer&quot;&gt;orthogonal projection&lt;/a&gt; of &lt;em&gt;P&lt;/em&gt; onto &lt;strong&gt;d&lt;/strong&gt;. In particular, &lt;em&gt;k&lt;sub&gt;i&lt;/sub&gt; = x&lt;sub&gt;i&lt;/sub&gt;x&lt;sub&gt;d&lt;/sub&gt; + y&lt;sub&gt;i&lt;/sub&gt;y&lt;sub&gt;d&lt;/sub&gt;&lt;/em&gt;. The &lt;strong&gt;width&lt;/strong&gt; &lt;em&gt;L&lt;/em&gt; of &lt;em&gt;P&lt;/em&gt; along &lt;strong&gt;d&lt;/strong&gt; is defined as &lt;em&gt;max k&lt;sub&gt;i&lt;/sub&gt; - min k&lt;sub&gt;i&lt;/sub&gt;&lt;/em&gt;. Your task is to find the &lt;strong&gt;d&lt;/strong&gt; along which &lt;em&gt;L&lt;/em&gt; is minimal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To keep things interesting, your algorithm's time complexity must not exceed &lt;em&gt;O(n log n)&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may write a program or function, taking input via STDIN, command-line argument or function argument. The result may be printed to STDOUT or returned.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can expect the input &lt;em&gt;P&lt;/em&gt; to be in any convenient list or string format, but the input must not be pre-processed (e.g. sorted by coordinates). You may assume that the input contains at least 2 points and that no two points coincide.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output must be correct to 10 significant (decimal) digits. Of course, &lt;strong&gt;d&lt;/strong&gt; is only unique up to the relative sign of the coordinates, so there are two correct answers for each input. You may return either of those.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must not use built-in functions related to this problem, like finding the minimum width of a polygon, or computing the convex hull of a set of points. You &lt;em&gt;may&lt;/em&gt; use built-in vector/matrix types and operations.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Notes&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'll write my own solution at some point next week, and use it to provide a number of test cases.&lt;/li&gt;&#xA;&lt;li&gt;I'm also planning to add a handful of diagrams to clarify the definitions.&lt;/li&gt;&#xA;&lt;li&gt;The challenge was inspired &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2171/8478&quot;&gt;by this proposal from Calvin's Hobbies&lt;/a&gt;, I think they are sufficiently different, as this problem here is only one approach to tackling his challenge (and even then it's only a subproblem). But if people think, they are too similar, and posting this one would make his a duplicate in the future, I'll retract this challenge (as I'd really like to see his posted some time).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2015-01-03T19:36:22.813" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="3577" PostTypeId="2" ParentId="2140" CreationDate="2014-12-14T15:08:20.300" Score="0" Body="&lt;h1&gt;Help Bob the Builder survive the communists, and fast!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The communists have taken over the world and you are the last remaining tower builder.&#xA;In order to surive you must show that you are able to build towers and fast!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Bob is given a set of building blocks &lt;code&gt;b&lt;/code&gt;, and a number &lt;code&gt;n&lt;/code&gt; of towers to build. Since we are in communist land the towers should have as equal of an height as possible. The catch is that you are only given 180 seconds to build the towers. The goal is to minimize the &lt;code&gt;std&lt;/code&gt; of the tower height. In addition you have to build towers at &lt;em&gt;three&lt;/em&gt; different sites. Which means three different sets of building blocks and three different set of towers. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input &amp;amp; Output&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;blocks = [1,2,3,4,5,6,7,8,9]&#xA;towers = 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The ouput should be on the form&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;7 6 2&#xA;8 5 4&#xA;1 9 5&#xA;&#xA;std = 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here the towers are built vertically. The std is calculated as follows&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;std = sqrt[(mean - tower1)^2 + (mean - tower2)^2 + ...]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where tower1 represents the height of that tower and mean is the average of the heights.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;mean = (tower1 + tower2 + ... + towern)/towers&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Example 2&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;blocks = [1,2,3,4,5,6,7,8,9]&#xA;towers = 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;5 3 2 4 1&#xA;9 6 7 9 0&#xA;&#xA;std = 0.7071&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Since mean = (23+22)/2 = 22.5 and std = [(22.5-23)^2+(22-23)^2]^(1/2) = [1/4+1/4]^(1/2) = (1/2)^1/2.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These two are examples of optimal outputs. Since the problem is NP hard an optimal solution within a reasonable time is impossible. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The blocks for the three building sizes are given below. The sum of these three tests judge your performance. &lt;em&gt;Lowest score wins&lt;/em&gt;. Eg&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; score = 100*std(1) + 50*std(2) + std(3)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where std stands for the standard deviation obtained at building site &lt;code&gt;n&lt;/code&gt;. Do not try to cheat and make a code that runs longer than 300 seconds. The KGB (Eg me) performs regurarly controls. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Question for meta&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;1) Is the problem clear enough? Eg use the three vectors and distribute them equally&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2) Is the scoring now fair? Must have a run time beneath 3 minutes, lowest score wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://pastebin.com/aWavj5df&quot; rel=&quot;nofollow&quot;&gt;Building site 1:  2 towers&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://pastebin.com/LZD4cYNv&quot; rel=&quot;nofollow&quot;&gt;Building site 2:  3 towers&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://pastebin.com/9UcijnmP&quot; rel=&quot;nofollow&quot;&gt;Building site 3: 23 towers&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="33193" LastActivityDate="2014-12-14T15:08:20.300" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="3578" PostTypeId="1" CreationDate="2014-12-14T20:28:37.493" Score="17" ViewCount="2834" Body="&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/4960/8478&quot;&gt;The Fortnightly Challenges™ are currently on hiatus&lt;/a&gt;. Please continue adding and voting on theme proposals. The challenges will be picked up again at some point in the summer once enough new ideas have been gathered (and the fatigue from the previous challenges has faded a bit :)).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is a collection of ideas for the theme of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2557/3808&quot;&gt;fortnightly challenges&lt;/a&gt;. Here's how it works:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Every other week on Friday, we choose the top voted answer here to be the theme for next two weeks' Fortnightly Challenge. (The winning answer is also deleted. Themes can be used more than once, although having duplicate themes in a short period of time would get quite boring.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;At the same time, all answers scored -3 or below are deleted, and all answers that have been posted for 8 weeks or more are also deleted, to reduce clutter.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;After picking the theme, the actual challenge is written on the following week (while the next theme is picked) and posted at the end of the week.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So, the schedule will look like this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;...&lt;/li&gt;&#xA;&lt;li&gt;Jan 9: Pick theme for challenge #3&lt;/li&gt;&#xA;&lt;li&gt;Jan 9 - Jan 23: Write challenge #3, pick theme for challenge #4&lt;/li&gt;&#xA;&lt;li&gt;Jan 23 - Feb 6: Write challenge #4, pick theme for challenge #5&lt;/li&gt;&#xA;&lt;li&gt;Feb 6 - Feb 20: Write challenge #5, pick theme for challenge #6&lt;/li&gt;&#xA;&lt;li&gt;...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Here's a history of all the weekly challenges we've done so far:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA; Date        | Theme and link&#xA;-------------+----------------&#xA; Dec 19 2014 | &lt;a href=&quot;https://codegolf.stackexchange.com/q/43115/3808&quot;&gt;Audio Processing&lt;/a&gt; (&lt;a href=&quot;http://chat.stackexchange.com/rooms/19623/weekly-challenge-of-12-19-14-audio-processing&quot;&gt;chatroom&lt;/a&gt;)&#xA; Jan  2 2014 | &lt;a href=&quot;https://codegolf.stackexchange.com/q/44415/8478&quot;&gt;Translation&lt;/a&gt; (&lt;a href=&quot;http://chat.stackexchange.com/rooms/19921/weekly-challenge-of-01-02-14-translation&quot;&gt;chatroom&lt;/a&gt;)&#xA; Jan  9 2015 | &lt;a href=&quot;https://codegolf.stackexchange.com/q/44707/8478&quot;&gt;Genetic Algorithms&lt;/a&gt; (&lt;a href=&quot;http://chat.stackexchange.com/rooms/20121/weekly-challenge-of-2015-01-09-genetic-algorithms&quot;&gt;chatroom&lt;/a&gt;)&#xA; Jan 23 2015 | Data Structures (&lt;a href=&quot;http://chat.stackexchange.com/rooms/20517/fortnightly-challenge-of-2015-01-23-data-structures&quot;&gt;chatroom&lt;/a&gt;)&#xA; Feb  6 2015 | Wireworld (&lt;a href=&quot;http://chat.stackexchange.com/rooms/20898/fortnightly-challenge-of-2015-02-06-wireworld&quot;&gt;chatroom&lt;/a&gt;)&#xA; Feb 20 2015 | &lt;a href=&quot;https://codegolf.stackexchange.com/q/47311/8478&quot;&gt;Language Design&lt;/a&gt; (&lt;a href=&quot;http://chat.stackexchange.com/rooms/21289/fortnightly-challenge-of-2015-02-20-language-design&quot;&gt;chatroom&lt;/a&gt;)&#xA; Mar  6 2015 | Lego (&lt;a href=&quot;http://chat.stackexchange.com/rooms/21732/fortnightly-challenge-of-2015-03-06-lego&quot;&gt;chatroom&lt;/a&gt;)&#xA; Mar 20 2015 | Asynchronous KotH (&lt;a href=&quot;http://chat.stackexchange.com/rooms/22138/fortnightly-challenge-of-2015-03-20-asynchronous-koth&quot;&gt;chatroom&lt;/a&gt;)&#xA; TBD         | TBD&#xA;&lt;/pre&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-06-01T01:11:53.743" Title="Fortnightly Challenge ideas" Tags="|discussion|weekly-challenges|" AnswerCount="6" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="3587" PostTypeId="1" CreationDate="2014-12-18T01:59:02.593" Score="12" ViewCount="382" Body="&lt;p&gt;Sometimes answers are posted, which &lt;em&gt;almost&lt;/em&gt; comply with the specs. They might be a clever, interesting take on the problem, but not follow one of the rules, or the program might crash in a few rare cases. What should be done with these answers? Upvote, downvote, or delete?&lt;/p&gt;&#xA;" OwnerUserId="16294" LastActivityDate="2014-12-18T02:33:16.850" Title="Almost-correct answers" Tags="|discussion|answers|" AnswerCount="1" CommentCount="0" ClosedDate="2016-01-18T20:34:08.693" ContentLicense="CC BY-SA 3.0" />
  <row Id="3588" PostTypeId="2" ParentId="3587" CreationDate="2014-12-18T02:33:16.850" Score="10" Body="&lt;p&gt;Depending on the question/answer, I'd say leave a comment pointing out the flaw and wait for the user to fix their answer. It wouldn't be fair for others to allow the answer to stay, but on the other hand deleting is too harsh for an answer that almost works.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If fixing the answer breaks their clever code, then they can leave it in their post as a bonus footnote if they wish.&lt;/p&gt;&#xA;" OwnerUserId="21487" LastActivityDate="2014-12-18T02:33:16.850" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="3589" PostTypeId="2" ParentId="2140" CreationDate="2014-12-19T03:21:31.187" Score="4" Body="&lt;h1&gt;Score a Mahjong Hand&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;So you've built a solver for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/39896/what-are-you-waiting-for-a-mahjong-solver&quot;&gt;which tiles you need to complete a Mahjong hand&lt;/a&gt;, but you've heard that certain hands are worth more than others and sometimes a hand that scores too low can't even win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, you decide to build a program that will score hands for you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This time, however, you will be making it for the full mahjong set. There are a total of 136 tiles in this variant, four copies of each of the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1 coin to 9 coins, represented from &lt;code&gt;1p&lt;/code&gt; to &lt;code&gt;9p&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;1 stalk to 9 stalks, represented from &lt;code&gt;1s&lt;/code&gt; to &lt;code&gt;9s&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;1 myriad to 9 myriads, represented from &lt;code&gt;1m&lt;/code&gt; to &lt;code&gt;9m&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;four winds, represented as &lt;code&gt;EE&lt;/code&gt;, &lt;code&gt;SS&lt;/code&gt;, &lt;code&gt;WW&lt;/code&gt;, and &lt;code&gt;NN&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;three dragon tiles, represented as &lt;code&gt;ZZ&lt;/code&gt;, &lt;code&gt;FF&lt;/code&gt;, and &lt;code&gt;BB&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The winds and dragons are known as &lt;em&gt;honour&lt;/em&gt; tiles, and they are not part of any suit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A standard mahjong hand consists of four sets and a pair. A set can be any of:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A &lt;em&gt;chow&lt;/em&gt;, which is a sequence of three tiles in the same suit. Winds and dragon tiles cannot be part of a chow.&lt;/li&gt;&#xA;&lt;li&gt;A &lt;em&gt;pong&lt;/em&gt;, which is a group of three of the same tile.&lt;/li&gt;&#xA;&lt;li&gt;A &lt;em&gt;kong&lt;/em&gt;, which is a group of four of the same tile. Every kong increases the total number of tiles in a player's hand by 1.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Every chow and pong has three tiles in it, while a kong has four. So a winning hand can have anywhere from 14 to 18 tiles, depending on the number of kongs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, the score that a hand has is based on &lt;em&gt;fan&lt;/em&gt;. A valid winning hand has no &lt;em&gt;fan&lt;/em&gt; by default. However, the following patterns count for &lt;em&gt;fan&lt;/em&gt;:&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sets&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A pong or kong of dragons (e.g. &lt;code&gt;ZZ ZZ ZZ&lt;/code&gt;): 1 fan&lt;/li&gt;&#xA;&lt;li&gt;A pong or kong of winds (e.g. &lt;code&gt;EE EE EE&lt;/code&gt; or &lt;code&gt;SS SS SS SS&lt;/code&gt;): 1 fan&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Patterns&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A straight, 1-9 in a suit as three sets (e.g. &lt;code&gt;1s 2s 3s 4s 5s 6s 7s 8s 9s&lt;/code&gt; + 1 more set and a pair): 3 fan&lt;/li&gt;&#xA;&lt;li&gt;A broken straight, 1-9 in a suit plus an additional 3, 5, and 7 (&lt;code&gt;1s 2s 3s 3s 4s 5s 5s 6s 7s 7s 8s 9s&lt;/code&gt;): 5 fan&lt;/li&gt;&#xA;&lt;li&gt;A pong or kong of all three dragons (e.g. &lt;code&gt;ZZ ZZ ZZ FF FF FF BB BB BB BB&lt;/code&gt;): 7 fan&lt;/li&gt;&#xA;&lt;li&gt;Four winds (&lt;code&gt;EE EE EE SS SS SS WW WW WW NN NN NN&lt;/code&gt; + a pair): 10 fan&lt;/li&gt;&#xA;&lt;li&gt;Nine Gates (&lt;code&gt;1 1 1 2 3 4 5 6 7 8 9 9 9&lt;/code&gt; of any single suit, plus one more of any tile in the suit): 14 fan (effectively 20 fan because of one-suit)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Entire hand patterns&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Entire hand is chows (e.g. &lt;code&gt;1s 2s 3s 6s 7s 8s 2p 3p 4p 7m 8m 9m NN NN&lt;/code&gt;): 1 fan&lt;/li&gt;&#xA;&lt;li&gt;Entire hand is pongs or kongs (but not all kongs) (e.g. &lt;code&gt;1m 1m 1m 3s 3s 3s 7p 7p 7p NN NN NN EE EE&lt;/code&gt;): 3 fan&lt;/li&gt;&#xA;&lt;li&gt;Entire hand is kongs only (e.g. &lt;code&gt;1m 1m 1m 1m 3s 3s 3s 3s 7p 7p 7p 7p NN NN NN NN EE EE&lt;/code&gt;): 10 fan&lt;/li&gt;&#xA;&lt;li&gt;All tiles from one suit + honours (e.g &lt;code&gt;1p 1p 1p 4p 4p 4p 7p 8p 9p SS SS SS EE EE&lt;/code&gt;): 3 fan&lt;/li&gt;&#xA;&lt;li&gt;All tiles from one suit (e.g. &lt;code&gt;1p 1p 1p 4p 4p 4p 7p 8p 9p 6p 6p 6p 5p 5p&lt;/code&gt;): 6 fan&lt;/li&gt;&#xA;&lt;li&gt;All tiles honours (e.g &lt;code&gt;NN NN NN ZZ ZZ ZZ BB BB BB SS SS SS EE EE&lt;/code&gt;): 9 fan&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Special hands&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The hands below are scored specially and do not follow the four-sets-and-a-pair rule.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Seven Pairs (seven pairs of any tiles): 2 fan&lt;/li&gt;&#xA;&lt;li&gt;Seven pairs in the same suit: 10 fan&lt;/li&gt;&#xA;&lt;li&gt;Seven honour pairs: 20 fan&lt;/li&gt;&#xA;&lt;li&gt;Thirteen Orphans (&lt;code&gt;1p 9p 1s 9s 1m 9m EE SS WW NN ZZ FF BB&lt;/code&gt; and one more of any of these 13): 10 fan&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Note that you only have to account for the value of the hand itself - you don't need to care about what the prevailing wind is or whether the tile was self-drawn, by discard, or anything else.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also note that a hand may fulfill multiple criteria. If it does, add up all the &lt;em&gt;fan&lt;/em&gt; from each criterion it fulfills, except if the hand is a special hand.&lt;/p&gt;&#xA;" OwnerUserId="7110" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.893" LastActivityDate="2014-12-19T20:39:35.683" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="3590" PostTypeId="2" ParentId="824" CreationDate="2014-12-19T16:25:00.367" Score="-4" Body="&lt;p&gt;I know this has an accepted answer, and that kind of points to the flaw I see in the current system as set.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've encountered a few older challenges that have accepted answers. To me, that means the challenge poster has declared a winner. No one else has a chance to win that challenge. That acts as a deterrent to people who would want to post for the sake of competition. I would propose that any challenge with an accepted answer be closed or deleted after a period of time. That allows people to recycle the question. Let newer people to the site try their hand at answering the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As it sits now, I see the current system as an &quot;old boy's club&quot; where you only have a chance at making a name for yourself if you started with the Challenges and Code Golf site. Questions are retained to both idolize the winners and ensure they keep the precious points, at the cost of allowing others to fight for the same challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Deleting a challenge with an accepted answer is a good way around the issue of duplicating answers. I cannot go and get the answers from a deleted post. I have to challenge myself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ultimately, I look at it like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Jane posts the challenge &quot;Walk to the corner and back.&quot;&#xA;A month later Bill posts &quot;Walk to the corner and back, backwards&quot;&#xA;A year later Joe posts &quot;Walk to the corner and back on your hands.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All these are similar. Any response to Bill or Joe could be posted to Jane. Some responses to Jane could be posted to Bill or Joe. Therefore, Bill and Joe are considered duplicates., and they shouldn't be. They introduce a new aspect to the challenge that some people might want to consider. Walking to the corner and back is too easy, but I don't have the balance to walk on my hands. I'll try the backwards option.&lt;/p&gt;&#xA;" OwnerUserId="34385" LastActivityDate="2014-12-19T16:25:00.367" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="3593" PostTypeId="1" CreationDate="2014-12-20T09:38:54.997" Score="8" ViewCount="243" Body="&lt;p&gt;Some questions like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/42253/significant-whitespace&quot;&gt;Significant Whitespace&lt;/a&gt; disallowed string literals. But what are string literals exactly? If I interpret this literally, almost everything in Bash or Tcl are string literals. For example, this program in Bash:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;echo -n &amp;quot;Hello World!&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;is the same as:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;echo&amp;quot; &amp;quot;-n&amp;quot; &amp;quot;Hello World!&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Similarly in Tcl:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;puts -nonewline &amp;quot;Hello World!&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;is the same as&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;puts&amp;quot; &amp;quot;-nonewline&amp;quot; &amp;quot;Hello World!&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;echo&lt;/code&gt; &lt;code&gt;-n&lt;/code&gt; &lt;code&gt;puts&lt;/code&gt; &lt;code&gt;-nonewline&lt;/code&gt; (and &lt;code&gt;&amp;quot;Hello World!&amp;quot;&lt;/code&gt;) are all string literals. Even if someone uses only variables like &lt;code&gt;$a&lt;/code&gt; in Tcl, arguably it is still something like &lt;code&gt;&amp;quot;$a&amp;quot;&lt;/code&gt; in PHP, which is a string literal.&lt;/p&gt;&#xA;&lt;p&gt;But it seemed those answers are acceptable by the community. In that case what are disallowed in a Bash or Tcl answer exactly?&lt;/p&gt;&#xA;&lt;p&gt;Some examples:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Commands, options, variable names, and anything else that isn't used as strings by the command.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;printf&lt;/code&gt; or &lt;code&gt;date&lt;/code&gt; formats, which are options but sometimes also considered strings.&lt;/li&gt;&#xA;&lt;li&gt;Bash aliases, such as &lt;code&gt;alias a=&amp;quot;do something&amp;quot;&lt;/code&gt;, or trap commands, etc.&lt;/li&gt;&#xA;&lt;li&gt;Tcl control structures, such as &lt;code&gt;if 1 &amp;quot;do something&amp;quot;&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;String concatenations, such as &lt;code&gt;&amp;quot;$a$b&amp;quot;&lt;/code&gt;, &lt;code&gt;c=$a$b&lt;/code&gt; in Bash, or &lt;code&gt;&amp;quot;$a$b&amp;quot;&lt;/code&gt;, &lt;code&gt;$a$b&lt;/code&gt; in Tcl.&lt;/li&gt;&#xA;&lt;li&gt;Concatenations that are arguably not of strings, such as &lt;code&gt;$a$b&lt;/code&gt; in Bash. if &lt;code&gt;$a&lt;/code&gt; or &lt;code&gt;$b&lt;/code&gt; contains spaces, the result will be not only one string.&lt;/li&gt;&#xA;&lt;li&gt;Empty strings, such as &lt;code&gt;a=&lt;/code&gt; in Bash.&lt;/li&gt;&#xA;&lt;li&gt;Unused strings, such as the &lt;code&gt;-c&lt;/code&gt; in &lt;code&gt;alias wc=:; wc -c&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Edit&lt;/h3&gt;&#xA;&lt;p&gt;I tried to write a shorter one after seeing the Bash answer. But it had alias, printf and even a &lt;code&gt;\n&lt;/code&gt;. I thought the &lt;code&gt;\n&lt;/code&gt; must disqualified it to be a valid answer. But then I found it hard to tell what answers are acceptable. I also remembered another question with a rule about string literals (but I didn't find it). So I was asking here.&lt;/p&gt;&#xA;&lt;p&gt;The problem I was thinking was, the rule about string literals are usually just for preventing some trivial solutions. If we require the OP define it accurately like what I have listed per question, it will probably become too complex.&lt;/p&gt;&#xA;&lt;p&gt;But now it turns out to be just &amp;quot;strings with quote&amp;quot;, and I think there probably won't be a general rule like this because it may be very unfair in some challenges. Asking the OP should be the right way.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-12-22T12:05:08.040" Title="What are string literals?" Tags="|discussion|policy|specification|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="3595" PostTypeId="2" ParentId="3593" CreationDate="2014-12-20T17:31:39.023" Score="5" Body="&lt;p&gt;I find this might be a case where the OP expects answers to respect the “spirit of the law” rather than solely the “letter of the law.” &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the OP expected full compliance, then yes, languages like bash would likely be wholly disqualified. Rather, I think the OP usually means “do not use any ‘dead string’ which will directly contribute to the answer.” That is, a format specifier for &lt;code&gt;date&lt;/code&gt; or &lt;code&gt;printf&lt;/code&gt; is fine if it is just a format specifier (something to format output, not something that contains any of the substantive content to be printed); but if it contains any parts of the requested solution in plain-text, that would be a violation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is also possible the OP means “don't use anything surrounded by quotes,” but that seems even less helpful than my guess.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I get that the above explanation is a fine (and not particularly bright) line, but it seems to be the most sensible guess to me. Perhaps the better advice is to write your solution meeting my recommendation above and then ask the OP if it violates what they had in mind, and regardless of their response, ask them to clarify what they hope for.&lt;/p&gt;&#xA;" OwnerUserId="21644" LastActivityDate="2014-12-20T17:31:39.023" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="3597" PostTypeId="2" ParentId="2140" CreationDate="2014-12-22T01:55:39.250" Score="0" Body="&lt;h1&gt;Quine is love, quine is life (well, almost)&lt;/h1&gt;&#xA;&lt;p&gt;Yes, another Life challenge. Inspired by &lt;a href=&quot;http://igoro.com/archive/self-printing-game-of-life-in-c/&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Write a program (the &lt;strong&gt;generator&lt;/strong&gt;) that, when given a representation of a Game of Life board on STDIN (or in a file if you like), outputs a program which contains a string representation of a Game of Life board in its source code.&lt;/p&gt;&#xA;&lt;p&gt;The representation will be in the following format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; h w x1 y1 x2 y2 x3 y3 . . . xw yh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;where:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;h&lt;/code&gt; = height of the grid&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;w&lt;/code&gt; = width of the grid&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;xi yi&lt;/code&gt; = coordinates of a live cell&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;When run, the new program should output its own source code - with a catch: the string in the output must represent the generation following the one previously encoded. (We shall call this program the &lt;strong&gt;replicator&lt;/strong&gt;.)&lt;/p&gt;&#xA;&lt;h1&gt;Other stuff&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;All live cells will be provided as input, so all other cells may be assumed to be dead.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;0,0&lt;/code&gt; is at the &lt;strong&gt;bottom left&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Both programs (the generator and the replicator) &lt;strong&gt;need not be in the same language&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There may be a width-one border around the string representation for a &lt;strong&gt;-10% bonus in score&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;Your score on a particular input will be defined as &lt;strong&gt;the length of the generator plus the average length of the first 100 generations of the replicator&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your final score will be the average of your scores on all the test cases.&#xA;The lowest score wins!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Question&lt;/h1&gt;&#xA;&lt;p&gt;Should we impose a format for the string representation, like maybe&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;* * * * * * * * * * * * * * * * * * *&#xA;*                                   *&#xA;*                                   *&#xA;*                 *                 *&#xA;*               *                   *&#xA;*               * * *               *&#xA;*                                   *&#xA;*                                   *&#xA;*                                   *&#xA;* * * * * * * * * * * * * * * * * * *&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or should we let the GolfScripters and CJammers of PPCG use their unprintable black magic? :D&lt;/p&gt;&#xA;" OwnerUserId="6503" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-12-22T04:29:18.293" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="3600" PostTypeId="1" AcceptedAnswerId="3601" CreationDate="2014-12-22T23:40:40.407" Score="1" ViewCount="96" Body="&lt;p&gt;Can a question on this site have a winner based on the lowest complexity? Each answer would require the code's complexity in Big-O notation, and the winner would be the first to submit an answer with the lowest (so, if three people submit answers with &lt;code&gt;O(n)&lt;/code&gt;, the first one wins).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can't remember seeing any questions like this, so I am curious as to what the decision will be. &lt;/p&gt;&#xA;" OwnerUserId="19164" LastActivityDate="2014-12-23T00:22:46.060" Title="Question based on Algorithmic Complexity?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="3601" PostTypeId="2" ParentId="3600" CreationDate="2014-12-23T00:22:46.060" Score="5" Body="&lt;p&gt;This already exists, as the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt; tag. From its wiki excerpt:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Fastest-algorithm competitions are won by the answer with the smallest asymptotic time complexity. For challenges based on actual runtime, use &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; instead.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2014-12-23T00:22:46.060" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="3603" PostTypeId="2" ParentId="2140" CreationDate="2014-12-26T20:56:44.893" Score="1" Body="&lt;h1&gt;Be the shortest in your own standard&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This was cops-and-robbers at the beginning. But I'm thinking of changing it to a &lt;a href=&quot;https://codegolf.stackexchange.com/q/45040/25180&quot;&gt;user scored challenge&lt;/a&gt; instead, where each user can propose a limit number of regex, and for each regex, the shortest matched program gets one point.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Working in progress. More details to be added&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(To be added.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;How to answer&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In each answer, you should write a program with length n for the above task, and optionally a regex with no more than n/2 bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The regex should consist of only character literals (including escaped ones) and &lt;code&gt;[...]&lt;/code&gt; &lt;code&gt;(...)&lt;/code&gt; &lt;code&gt;?&lt;/code&gt; &lt;code&gt;*&lt;/code&gt; &lt;code&gt;+&lt;/code&gt; &lt;code&gt;|&lt;/code&gt;. You cannot use other features such as specifying number of repetitions or the beginning/ending anchors.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you choose to include a regex, you should also specify whether programs should be nearly-matched or nearly-unmatched by the regex, defined as following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A regex nearly-matches a program, if there is a character C and a subset S of the set of all occurences of C in the program, that when everything in S is replaced by a character C', the program will be matched by the regex.&lt;/li&gt;&#xA;&lt;li&gt;A regex nearly-unmatches a program, if for every character C and every subset S of all occurences of C in the program, that when everything in S is replaced by a character C', the program will not be matched by the regex.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If you choose to nearly-match, it must nearly-match your own program in the same answer. And this program must be shorter than any other answer nearly-matched by the regex. The same applies if you choose to nearly-unmatch, where your program must be shorter than anything nearly-unmatched.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The programs and regexes should only use printable ASCII, tabs and newlines.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each user can write any number of programs, but can write at most 5 regexes at the beginning. You can write one extra regex for each 5 upvotes you get.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For each regex, if one of your program is the first of the shortest of the programs nearly-matched/unmatched by the regex according to the specification, you get 2 points. If the regex is not your own, you get one extra point.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each of your program can be scored more than one times if they are the shortest for more than one regex.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should not post an answer that doesn't get any score at the time you post it. But you can leave it there if it loses all the score it had. And you can post an answer that is only the shortest for your own regex.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules about posting and editing answers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You can always edit regexes into an answer, if you are allowed to write more regex. But once a program is the shortest for a regex at the time you post the regex, you can't post another regex that makes this version of the program shortest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should not edit a program in a way that it loses scores from some regex. And if you edit, you should keep the version that is paired with a regex in your answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regexes should not be modified after posting for any reason if they are valid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should not post programs/regexes that is the same as a previous submission.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.563" LastActivityDate="2015-06-26T15:20:46.483" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="3604" PostTypeId="1" CreationDate="2014-12-27T00:50:57.990" Score="2" ViewCount="235" Body="&lt;p&gt;Today I have asked a question here on PPCG.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question consisted in a set of wildcards and groups which one should make a string that matches it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question can be found here: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/42826/string-generator-based-on-a-wildcard?noredirect=1#comment101392_42826&quot;&gt;String generator based on a wildcard&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But it was immediately closed by another used as being a duplicate of the following question: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/25378/regex-in-reverse-decompose-regular-expressions&quot;&gt;Regex in reverse - decompose regular expressions&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although the questions seem similar in the title, their content is &lt;strong&gt;WAY&lt;/strong&gt; different!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One is actually to, receive as input, a regex and then generate a string that matches it.&lt;br&gt;&#xA;The whole specification is found on the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question is to generate a string that matches some features of a regex, but a regex will be considered invalid input in most of the cases.&lt;br&gt;&#xA;Evaluating the wildcard as a regex, using my specification, would (in some cases) generate meaningless matches.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;None of the answers will fit into my question, with most of the possible wildcards (like &lt;code&gt;?[def]{2}&lt;/code&gt; which would, for example, generate &lt;code&gt;add&lt;/code&gt; while it is an improper regex).&lt;br&gt;&#xA;Most of those answers also generate characters outside the expected range of &lt;code&gt;a-z&lt;/code&gt;, &lt;code&gt;A-Z&lt;/code&gt; and &lt;code&gt;0-9&lt;/code&gt; (symbols are optional and are rewarded with bonus).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To the core of this: Is my challenge really &lt;strong&gt;THAT&lt;/strong&gt; close to be considered duplicate?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It wasn't intentional and I wasn't aware of the other linked question, which was 8 month ago.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Outside of the scope, I have seen questions being reopened because the winning criteria changed, but the whole question itself was much more similar.&lt;br&gt;&#xA;I might be wrong about it, my memory isn't 100% perfect.&lt;/p&gt;&#xA;" OwnerUserId="14732" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2014-12-27T20:07:52.683" Title="Is my question THAT similar to be considered duplicated?" Tags="|discussion|challenges|closed-questions|reopening|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="3605" PostTypeId="2" ParentId="3604" CreationDate="2014-12-27T01:10:59.133" Score="6" Body="&lt;p&gt;Personally, I agree with the close vote. Yes, there are some differences in the syntax, so no answer could be copied over directly. But the differences seem very minor, if someone &lt;em&gt;did&lt;/em&gt; adapt an old answer, the heavy lifting would have been done by the user who answered the previous question. It's mostly just changing a bit of syntax, and throwing out a feature or two and adding another. The fact that the old question wants &lt;em&gt;all&lt;/em&gt; strings and you want &lt;em&gt;one random&lt;/em&gt; string also doesn't really affect the core of the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can only recommend you try the sandbox next time or ask in chat, so you can get feedback before you commit to the challenge, which might have turned up that previous challenge.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2014-12-27T20:07:52.683" LastActivityDate="2014-12-27T20:07:52.683" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="3607" PostTypeId="2" ParentId="2140" CreationDate="2014-12-28T10:57:55.197" Score="3" Body="&lt;h1&gt;Happy Holidays!&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;With the holidays upon us, I decided to make an appropriately themed challenge. You are provided with a list of holidays and their respective date ranges, and given a date, you have to output a holiday greeting or the time remaining until the next holiday as appropriate.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The list of holidays is below. You have to include it in your program (so no using a library or other external resource for this). Feel free to use any convenient format.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Start  | End    | Name&#xA;------ | ------ | -------------------&#xA;Dec 6  | Dec 7  | Saint Nicholas' Day&#xA;Dec 13 | Dec 14 | Saint Lucy's Day&#xA;Dec 24 | Dec 27 | Christmas&#xA;Jan 1  | Jan 2  | New Year&#xA;Jan 6  | Jan 7  | Epiphany&#xA;Feb 14 | Feb 15 | Valentine's Day&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You are given a date as input (STDIN, function argument, or anything convenient) in &lt;code&gt;YYYY-mm-dd HH:MM:SS&lt;/code&gt; format (e.g.: &lt;code&gt;2014-12-30 11:15:00&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may assume that the time zone is either UTC or the system's time zone. The holiday lasts from &lt;code&gt;00:00:00&lt;/code&gt; on the start date (inclusive) to &lt;code&gt;00:00:00&lt;/code&gt; on the end date (exclusive).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the date falls within the range of the holiday, you must output &lt;code&gt;Happy &amp;lt;holiday&amp;gt;!&lt;/code&gt;, except if it's Christmas, in which case you must output &lt;code&gt;Merry Christmas!&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it doesn't, but another holiday is coming at most a week in the future, you must output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;time&amp;gt; left until &amp;lt;holiday&amp;gt;.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;&amp;lt;time&amp;gt;&lt;/code&gt; is in the following format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;days&amp;gt;d &amp;lt;hours&amp;gt;h &amp;lt;minutes&amp;gt;m &amp;lt;seconds&amp;gt;s&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You can't use a library for converting the time to that format.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there are no whole days, hours, minutes or seconds remaining, omit the number entirely. For example, &lt;code&gt;1d 0h 3m 4s&lt;/code&gt; should be printed as &lt;code&gt;1d 3m 4s&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there are no upcoming holidays, you must output (no pun intended):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;There are no upcoming holidays.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A trailing newline is optional, but be consistent in your program&amp;mdash;don't add a trailing newline in one case and omit it in another.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/344&quot;&gt;Standard loopholes&lt;/a&gt; are obviously forbidden.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Date                | Output&#xA;------------------- | ----------------------------------&#xA;2014-12-05 23:59:59 | 1s left until Saint Nicholas' Day.&#xA;2014-12-06 00:00:00 | Happy Saint Nicholas' Day!&#xA;2014-12-06 12:00:00 | Happy Saint Nicholas' Day!&#xA;2014-12-06 23:59:59 | Happy Saint Nicholas' Day!&#xA;2014-12-07 00:00:00 | 6d left until Saint Lucy's Day.&#xA;2014-12-14 00:00:00 | There are no upcoming holidays.&#xA;2014-12-24 00:00:00 | Merry Christmas!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that your program must work for any year, not just 2014.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winner&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is code golf, so the submission with the fewest number of bytes wins. An answer will be accepted after a week, but I'll be happy to change the accepted answer if a new valid submission beats the previous high score.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="344" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2014-12-30T11:24:17.507" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="3609" PostTypeId="2" ParentId="2140" CreationDate="2014-12-29T11:26:54.403" Score="1" Body="&lt;h2&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Phoneword&quot; rel=&quot;nofollow noreferrer&quot;&gt;Phoneword&lt;/a&gt; generator&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Goal&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The goal is to write the shortest phoneword generator.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;As input you get for just a sequence of numbers (0-9). Given via &lt;code&gt;stdin&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You should write the first 15 possible results to &lt;code&gt;stdout&lt;/code&gt; bonus points if the output only contains real words. The words need to have the exact same length like the input string.&lt;/p&gt;&#xA;&#xA;What if there are less than 15 options?&#xA;&#xA;&lt;p&gt;Then you can just make up words.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Phoneword&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A phoneword, is a sequence of characters, that is typed with letters in your phone which map to the numbers they display.&lt;/p&gt;&#xA;&#xA;How to treat 0 and 1&#xA;&#xA;&lt;p&gt;If the input contains a 0 or a 1, you should treat them as 0 and 1. To make a word with them anyway, you can use leetspeak.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Mapping&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;For the mapping check this picture:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/XkQcy.png&quot; alt=&quot;Phonekeypad&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Taken from &lt;a href=&quot;http://en.wikipedia.org/wiki/Telephone_keypad&quot; rel=&quot;nofollow noreferrer&quot;&gt;wikipedia&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As example I use codegolf itself: &lt;code&gt;26334653&lt;/code&gt; translates to &lt;code&gt;CODEGOLF&lt;/code&gt; it also gives many more words, &lt;a href=&quot;http://www.vanity-rechner.de/cgi-bin/vanity.cgi?number=26334653&amp;amp;anz=anz&amp;amp;quant=200&amp;amp;umw=yes&amp;amp;opt=yes&amp;amp;exist=yes&amp;amp;english=yes&quot; rel=&quot;nofollow noreferrer&quot;&gt;here is a list&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Bonus&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You can divide the amount of characters by 2, if your code gives only words which are in listed in the &lt;a href=&quot;http://www.oxforddictionaries.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Oxford dictionary&lt;/a&gt;. For that you are allowed to use a web api to check them.&lt;/p&gt;&#xA;" OwnerUserId="19894" LastEditorUserId="19894" LastEditDate="2015-01-04T14:45:23.430" LastActivityDate="2015-01-04T14:45:23.430" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="3610" PostTypeId="1" CreationDate="2014-12-30T10:18:22.177" Score="17" ViewCount="1223" Body="&lt;p&gt;We have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/8478&quot;&gt;definition of what we consider a valid programming language&lt;/a&gt; for answers on PPCG. (If you disagree with this definition, please do so on that other post, and not here.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The one type of challenge where people regularly tend to ignore this is for challenges with fixed output, i.e. mostly &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;. These sometimes get answers, which are simply a compressed version of the resulting image, or which are written in HTML + CSS only (which don't fulfil the criteria for being a programming language either).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some examples (all are graphical output - let me know if you can think of examples in other contexts):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/40058/8478&quot;&gt;HTML + CSS&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/39923/8478&quot;&gt;HTML/GIF&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/39926/8478&quot;&gt;GIF&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/42975/8478&quot;&gt;PNG&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Especially when providing just an image file, the question also arises if that isn't a loophole of using built-in compression.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, should we require answers to such challenges also to be written in programming languages, or are we more lenient here?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Note, if we decide that we &lt;em&gt;do&lt;/em&gt; only want answers in programming languages, every challenge author who does not like that would of course be allowed to override that decision in their individual challenges. This is only supposed to be a default.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2015-01-05T20:49:25.240" Title="Should answers to fixed-output challenges be written in a programming language?" Tags="|discussion|policy|answers|" AnswerCount="3" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="3611" PostTypeId="2" ParentId="3610" CreationDate="2014-12-30T10:36:36.767" Score="5" Body="&lt;p&gt;I don't think we should allow answers that just contain &lt;em&gt;final output&lt;/em&gt;, such as simply posting the contents of a JPG/GIF/PNG file. That falls under &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1078/9275&quot;&gt;using a built-in function&lt;/a&gt; because you use the compression of PNG/GIF/JPG/... (and in some cases, it might fall under &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1063/9275&quot;&gt;hard-coding the output&lt;/a&gt;, but &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; is the primary exception for that loophole).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I expressed my opinion about HTML/CSS/... &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/3612/9275&quot;&gt;here&lt;/a&gt;).&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2014-12-30T10:58:15.480" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="3612" PostTypeId="2" ParentId="2028" CreationDate="2014-12-30T10:45:45.753" Score="6" Body="&lt;p&gt;Aside from allowing programming languages as in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/9275&quot;&gt;Peter's definition&lt;/a&gt;, I think we should also allow &lt;a href=&quot;https://en.wikipedia.org/wiki/Declarative_programming&quot; rel=&quot;nofollow noreferrer&quot;&gt;declarative languages&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;In computer science, declarative programming is a programming paradigm, a style of building the structure and elements of computer programs, that expresses the logic of a computation without describing its control flow.&lt;/p&gt;&#xA;&lt;p&gt;Common declarative languages include those of database query languages (e.g., SQL, XQuery), regular expressions, logic programming, functional programming, and configuration management systems.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This means that we should also allow languages such as HTML (+SVG), CSS.&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-01-01T14:31:15.957" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="3613" PostTypeId="2" ParentId="3610" CreationDate="2014-12-30T12:41:30.150" Score="0" Body="&lt;p&gt;It is written right in the &lt;a href=&quot;https://codegolf.stackexchange.com/tags/kolmogorov-complexity/info&quot;&gt;info&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;On the other hand, &amp;quot;4c1j5b2p0cv4w1x8rx2y39umgw5q85s7uraqbjfd&amp;quot; has a high Kolmogorov  complexity, and the shortest way to produce it would (most likely) be to just print it literally:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;4c1j5b2p0cv4w1x8rx2y39umgw5q85s7uraqbjfd&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I interpret that as the raw content is allowed for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I don't see much difference from submitting the final output than a program like this in the byte-code of some hypothetical assembly language:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;           mov r0, Lfilename&#xA;           mov r1, Lcontent&#xA;           mov r2, (Lend - Lcontent)&#xA;           goto __builtin_open_and_write_file&#xA;Lfilename: .data &amp;quot;filename.png&amp;quot;&#xA;Lcontent:  .data &amp;quot;file_content&amp;quot;&#xA;Lend:&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="32353" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2014-12-30T12:41:30.150" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="3616" PostTypeId="1" AcceptedAnswerId="5104" CreationDate="2014-12-31T15:16:26.893" Score="13" ViewCount="258" Body="&lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/a/97610/201409&quot;&gt;Music and AVP&lt;/a&gt; and &lt;a href=&quot;https://dsp.meta.stackexchange.com/q/83/11608&quot;&gt;Signal Processing&lt;/a&gt; can embed audio files via the SoundCloud player. Since the feature already exists, it would only need to be activated for PPCG, and judging by Signal Processing the devs will actually do so if there's some support in the community for it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Why I think this would be useful:&lt;/strong&gt; We've had a handful of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/audio&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;audio&amp;#39;&quot; rel=&quot;tag&quot;&gt;audio&lt;/a&gt; challenges, and I'm sure we'll have more in the future. But in general these are not as popular as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;. Part of that might be people being less familiar with audio than graphics, but I think a major problem with audio challenges is that you currently cannot easily listen to the results, like you can look at the pictures produced in graphical challenges. I think that's quite a barrier for these challenges, and we could do a lot more interesting audio-based challenges if we could embed the results right in the answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So please indicate your opinion by voting the question up or down, and leave a comment or an answer if you want to add something. And if this gets some support, I'll ping a mod to ask the devs if they could activate this.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2015-04-18T03:05:28.080" Title="Could we get the audio embedding feature for PPCG?" Tags="|feature-request|status-completed|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="3617" PostTypeId="2" ParentId="3616" CreationDate="2015-01-01T14:20:09.160" Score="11" Body="&lt;p&gt;Note that uploading to SoundCloud will result in the file being &lt;a href=&quot;http://help.soundcloud.com/customer/portal/articles/94796-just-uploaded-and-my-track-is-distorted&quot; rel=&quot;nofollow&quot;&gt;transcoded to 128kbps mp3&lt;/a&gt;, which could have undesirable effects in some cases. So if this feature is enabled, people should choose to make their file downloadable.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2015-01-01T14:20:09.160" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="3618" PostTypeId="1" CreationDate="2015-01-01T20:11:07.573" Score="3" ViewCount="146" Body="&lt;p&gt;This &lt;a href=&quot;https://codegolf.stackexchange.com/questions/42916/print-the-twelve-days-of-christmas-with-twelve-different-coding-languages&quot; title=&quot;12 days of Christmas&quot;&gt;question&lt;/a&gt; has a few downvotes but no explanation yet. Although it's beyond me to answer it, I like that it exists and I'm looking forward to seeing answers to it. Could we discuss what about it is attracting downvotes and what needs to improve?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should it be put on hold in the meantime to prevent answers until it is fine tuned?&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-01-05T12:03:55.967" Title="Could we get some feedback on what needs to improve in this question?" Tags="|discussion|specific-question|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="3621" PostTypeId="2" ParentId="2140" CreationDate="2015-01-03T08:01:52.217" Score="4" Body="&lt;h1&gt;Invert the matrix&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;The name says it all. I am surprised that there is no preexisting question on calculating matrix inversion&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an &lt;code&gt;n&lt;/code&gt;X&lt;code&gt;n&lt;/code&gt; invertible matrix, your task is to output its inverse.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Floating point precision of at least 3 significant decimal places is required&lt;/li&gt;&#xA;&lt;li&gt;You can assume that the input matrix will always have an inverse&lt;/li&gt;&#xA;&lt;li&gt;You cannot use any inbuilt methods (or external libraries) to perform any of the following tasks:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Calculate the inverse&lt;/li&gt;&#xA;&lt;li&gt;Solve system of equations&lt;/li&gt;&#xA;&lt;li&gt;Calculate determinant&lt;/li&gt;&#xA;&lt;li&gt;Multiply two matrices or calculate dot product.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;In other words, your code has to calculate the inverse using any of the mathematical methods itself. (If I missed out any inbuilt methods in the above rule, this rule should make it clear that it cannot be used)&lt;/li&gt;&#xA;&lt;li&gt;You cannot calculate inverse by randomly generate random matrix and then multiply with the input to check for unit matrix.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input can be in a format of your choice. For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[ 1, 3, 4],&#xA; [ 5, 7, 8],&#xA; [ 3, 4, 5]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 3 4&#xA;5 7 8&#xA;3 4 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;etc&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The output should be in the same format as the input, except for 1 requirement that each row of the matrix should be in a separate line with elements of the same row on the same line.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code-golf so shortest code in bytes win.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox notes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;What do you think of the problem ? Too mundane ? Too trivial ? Need any extra rule to make it more interesting ?&lt;/p&gt;&#xA;" OwnerUserId="31414" LastEditorUserId="8478" LastEditDate="2015-01-05T12:00:42.253" LastActivityDate="2015-01-05T12:00:42.253" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="3623" PostTypeId="2" ParentId="2140" CreationDate="2015-01-03T18:23:03.403" Score="0" Body="&lt;h2&gt;Query the icosahedral graph&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You've been sent back in time to 1973 to change history by remaking a clone of &lt;a href=&quot;http://en.wikipedia.org/wiki/Hunt_the_Wumpus&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hunt the Wumpus&lt;/a&gt;. You need to code a network of rooms in the game that forms an &lt;a href=&quot;http://mathworld.wolfram.com/IcosahedralGraph.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;icosahedral graph&lt;/a&gt;, whose vertices correspond to the 12 vertices of the &lt;a href=&quot;http://en.wikipedia.org/wiki/Regular_icosahedron&quot; rel=&quot;nofollow noreferrer&quot;&gt;icosahedron&lt;/a&gt; connected by edges, unlike the &lt;a href=&quot;http://mathworld.wolfram.com/DodecahedralGraph.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;dodecahedral graph&lt;/a&gt; used in the original game. Each room connects to five others.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your goal is to write a program or function that takes the ID numbers of two of the twelve rooms, and returns one value if the rooms are adjacent, and a different value if not. Due to space constraints, you code needs to use as few bytes as possible. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can choose what ID's to label the 12 rooms, but due to hardware constraints, they must be numbers from 0 to 255. Specifying the ID's doesn't count for the code length.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Two distinct ID numbers from 0 to 255 out of 20 of your choice. You can't restrict which order two numbers appear in.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A consistent value for pairs of numbers that correspond to adjacent rooms in your ID scheme, and a different consistent value for non-adjacent pairs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code may not use any built-ins that represent the dodecahdral graph or related structures.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2015-01-03T18:53:39.750" LastActivityDate="2015-01-03T18:53:39.750" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="3624" PostTypeId="2" ParentId="2140" CreationDate="2015-01-03T19:46:54.713" Score="0" Body="&lt;h1&gt;Reverse Polish Notation-ing!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your challenge is simply to write a function which converts a given arithmetical expression into it's &lt;a href=&quot;http://en.wikipedia.org/wiki/Reverse_Polish_notation&quot; rel=&quot;nofollow noreferrer&quot;&gt;Reverse Polish Notation&lt;/a&gt; form.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your function will be passed in an arithmetical expression, as a string, which may contain any of &lt;code&gt;+-*/^()&lt;/code&gt; or a space. For example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;1+1&#xA;34 * 7^6&#xA;3 * (78 + 7)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your function should return the Reverse Polish Notation form of the input with a space between each number. The above inputs would output:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;1 1 +&#xA;7 6 ^ 34 *&#xA;78 7 + 3 *&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest code wins. Bonuses are as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;-15 for supporting brackets in the input (as in: &lt;code&gt;()&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;-5 for supporting exponents (as in: &lt;code&gt;^&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;-10 for supporting floating point (decimal) numbers (formatted with a dot: &lt;code&gt;12.56&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You should support, at minimum, &lt;code&gt;+&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;, &lt;code&gt;*&lt;/code&gt; and &lt;code&gt;/&lt;/code&gt; operations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Good luck!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;hr/&gt;&#xA;&lt;em&gt;To the sandbox&lt;/em&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Should I give more examples or is 3 enough?&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Do you think the deductions are a fair amount off? Too much? Too little?&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Am I missing something really obvious? (I usually am!)&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="34461" LastEditorUserId="34461" LastEditDate="2015-01-03T19:56:46.800" LastActivityDate="2015-01-03T19:56:46.800" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="3626" PostTypeId="1" CreationDate="2015-01-04T00:01:50.437" Score="10" ViewCount="365" Body="&lt;p&gt;Sometimes a question is underspecified or ambiguous. Other times a question is fully specified but very long and dry to read. In between there are questions which seem perfect - all the information is there but it's also a joy to read, and makes you want to start thinking about possible answers right away.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answer with a link to an example question (your own or someone else's) and optionally a brief explanation of why it makes a good example. Then votes will bring the very best to the top, and this meta post can be linked to for examples of how to improve a question when someone posts something too brief or too deep.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is always going to be subjective so I thought a list of examples might be more useful than trying to define precisely what makes a well presented question. Although there may be overlap, this won't be the same order as the votes the questions have on main, as voting there is also on the subject matter and the challenge itself, not just on how it is presented.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2015-02-23T08:06:15.413" Title="Examples of well presented questions" Tags="|discussion|asking-questions|" AnswerCount="4" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="3627" PostTypeId="2" ParentId="3626" CreationDate="2015-01-04T09:38:50.593" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/43115/morse-the-new-year&quot;&gt;Morse the New Year&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Clear specification&lt;/li&gt;&#xA;&lt;li&gt;Not too long&lt;/li&gt;&#xA;&lt;li&gt;It contains an example output&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-01-04T09:38:50.593" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="3634" PostTypeId="1" CreationDate="2015-01-05T05:59:30.127" Score="2" ViewCount="160" Body="&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/43155/convert-rgb-integer-value-into-rgb-values&quot;&gt;this question&lt;/a&gt;, I found &lt;a href=&quot;https://codegolf.stackexchange.com/a/43168/34744&quot;&gt;an answer that required no work&lt;/a&gt;, as the act of representing the input computed the output, on an extant, non-hypothetical system. Is this legit?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It seemed a lot like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1071/34744&quot;&gt;using a specifically designed language&lt;/a&gt;, but I didn't make this one up. And it does other, general-purpose stuff.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or, is it &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1078/34744&quot;&gt;using built-in functions to do the work&lt;/a&gt;, where my builtin function isn't a function but a chip feature?&lt;/p&gt;&#xA;" OwnerUserId="34744" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2020-10-14T03:04:10.657" Title="Can we use Languages/Environments where the answer is computed automatically?" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="3636" PostTypeId="2" ParentId="3618" CreationDate="2015-01-05T12:03:55.967" Score="-3" Body="&lt;p&gt;Looks fine to me. His current explanation seems clear:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;The program is started&#xA;The program prints the appropriate verse&#xA;The program writes the source code for the next program to file, which in turn contains the code for the rest, and so on.&#xA;The program compiles (if needed) the next program, and runs it.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="10740" LastActivityDate="2015-01-05T12:03:55.967" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="3637" PostTypeId="2" ParentId="3626" CreationDate="2015-01-05T13:04:48.107" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/24258/8478&quot;&gt;Calculate practical numbers&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Pro:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The definition of the problem is solid and understandable.&lt;/li&gt;&#xA;&lt;li&gt;Contains relevant references to Wikipedia and OEIS.&lt;/li&gt;&#xA;&lt;li&gt;Contains a very clear example.&lt;/li&gt;&#xA;&lt;li&gt;It clearly specifies the admissible formats of answers (&quot;program, function or verb&quot;).&lt;/li&gt;&#xA;&lt;li&gt;Contains a sufficient number of test cases, including important cases like &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;250000&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;In summary:&lt;/strong&gt; It's a concise but complete spec for a not-so-trivial challenge.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Con:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Only a very minor detail, but for programs it could be specified whether input should be via STDIN, command-line argument or prompt. (We've got defaults for this now, but we didn't at the time.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2015-01-05T13:04:48.107" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="3638" PostTypeId="2" ParentId="3626" CreationDate="2015-01-05T16:18:21.733" Score="1" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/2295/1p5-nested-boxes&quot;&gt;Nested Boxes&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I could have picked a few of &lt;a href=&quot;https://codegolf.stackexchange.com/users/15/joey&quot;&gt;Joey's&lt;/a&gt; but I think this is the best example. It has:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An interesting problem&lt;/li&gt;&#xA;&lt;li&gt;A clear and detailed specification leaving little room for ambiguities&lt;/li&gt;&#xA;&lt;li&gt;A number of sample inputs and outputs for testing while developing an answer&lt;/li&gt;&#xA;&lt;li&gt;A test script for making sure the answer fully meets the specification and handles any corner cases.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="737" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-01-05T16:18:21.733" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="3639" PostTypeId="2" ParentId="3610" CreationDate="2015-01-05T20:32:52.077" Score="16" Body="&lt;p&gt;I don't think we should generally disallow solutions written in non-programming languages:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;They are only an issue for a minor subset of challenges (mainly &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; challenges).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Challenge authors can already exclude such solutions, if they don't want them.  Individual voters are free not to upvote them, if they don't like them.  IME, looking at the votes on such solutions, I'm not really seeing the kind of universal distaste that'd earn them a spot on the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/standard-loopholes-which-are-no-longer-funny&quot;&gt;standard loopholes&lt;/a&gt; list.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For challenges where such solutions might typically be competitive (such as generating a fixed high Kolmogorov complexity output), disallowing &quot;raw&quot; answers would typically just turn the challenge into a contest to see which language has the minimum overhead for printing a literal string.  That's a sign of a bad challenge, not of bad solutions.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Despite the existence of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2028/what-are-programming-languages/2073#2073&quot;&gt;a &quot;canonical&quot; definition&lt;/a&gt;, it's actually quite hard to draw the line between programming and non-programming languages, and the results might not be quite what you'd expect.  Arguably, &lt;a href=&quot;https://github.com/elitheeli/stupid-machines&quot; rel=&quot;nofollow noreferrer&quot;&gt;CSS is a programming language&lt;/a&gt;, so HTML+CSS (or SVG+CSS) should be allowed under this rule.  PHP certainly qualifies as one, and has a 0% overhead for outputting any string that does not contain the bytes &lt;code&gt;&amp;lt;?&lt;/code&gt;; thus, almost any &quot;cat script&quot; is also a valid (if boring) PHP program.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Non-programming-language solutions can display a high level of creativity and golfing skill.  See the linked &lt;a href=&quot;https://codegolf.stackexchange.com/questions/42928/output-2015-as-qr-code/42975#42975&quot;&gt;optimized PNG solution by KennyTM&lt;/a&gt; for an example.  I don't see why such solutions should not be considered equally worthy as those written in a Turing-compatible language.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2015-01-05T20:49:25.240" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="3641" PostTypeId="2" ParentId="2140" CreationDate="2015-01-06T17:38:53.943" Score="0" Body="&lt;p&gt;Print the Twelve Days of Christmas with twelve programming languages&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Use twelve programming or scripting languages to write twelve programs, embedded within each other, to print the lyrics for &lt;strong&gt;Twelve Days of Christmas&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each program will write the next program to file, compile if needed, and execute it. The parent processes will not exit until the last has executed. When &#xA;they exit, they will print the final verse, program by program. You may only have one file to start with. You may also, optionally, have a text file with each line of the song in it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must specifiy any dependencies needed to run the programs. For example, if you need a compiler, such as GCC, or PHP or the Java compiler/Java, put them &#xA;in a list of dependencies.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;?php&#xA;echo &quot;On the first day of Christmas, my true love gave to me:\nA partridge in a pear tree!\n&quot;;&#xA;$code = &amp;lt;&amp;lt;&amp;lt;EOD&#xA;public static void main(String [ ] args) {&#xA;&#xA;String nextCode = new String;&#xA;System.out.println(&quot;On the second day of Christmas, my true love sent to me:&quot;);&#xA;System.out.print(&quot;Two Turtle Doves\nand a Partridge in a Pear Tree\n&quot;);&#xA;nextCode = &quot;(Next code to be written is in here)&quot;;&#xA;PrintWriter writer = new PrintWriter(&quot;thirdDay.c&quot;, &quot;UTF-8&quot;);&#xA;/*&#xA;* and write the next program, in this case, thirdDay.c to file and so on....&#xA;*/&#xA;}&#xA;EOD;&#xA;file_put_contents(&quot;secondDay.java&quot;, $code);&#xA;exec(&quot;javac secondDay.java&quot;);&#xA;echo exec(&quot;java secondDay&quot;);&#xA;echo &quot;and a Partridge in a pear tree&quot;; // runs after the other twelve have run&#xA;?&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Apologies for my rusty Java.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To reiterate:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The program is started&lt;/li&gt;&#xA;&lt;li&gt;The program prints the appropriate verse&lt;/li&gt;&#xA;&lt;li&gt;The program writes the source code for the next program to file, which in turn contains the code for the rest, and so on.&lt;/li&gt;&#xA;&lt;li&gt;The program compiles (if needed) the next program, and runs it.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The final program will only print the line for Day 12. It will then exit, returning to its parent program, which will print the second line - Day 11, exit, and so on. In my example, this line will run last:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;echo &quot;and a Partridge in a pear tree&quot;; // runs after the other twelve have run&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Have fun with those quote marks. I started with PHP and Heredoc for a reason ;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Assume that this will be run in a Linux/Unix terminal. Windows is okay if you can pull it off.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a popularity contest. Assuming that you can get everything escaped properly ;) &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Merry Christmas!&lt;/p&gt;&#xA;" OwnerUserId="14674" LastActivityDate="2015-01-06T17:38:53.943" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="4645" PostTypeId="2" ParentId="2140" CreationDate="2015-01-07T18:14:26.250" Score="5" Body="&lt;h2&gt;Verification of solutions to the 3 knishops problem&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For the purposes of this question, a &lt;strong&gt;knishop&lt;/strong&gt; is a fairy chess piece which can move to precisely those squares which are not an integer distance away. So knight moves (distance $\sqrt{5}$) are ok, as are bishop moves (non-zero multiples of $\sqrt(2)$) and many more besides.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://puzzling.stackexchange.com/q/6636/228&quot;&gt;3 knishops problem&lt;/a&gt; is to place 3 knishops on an infinite chessboard such that none of them attack each other, but every square other than the 3 they occupy is attacked by at least one of them. A more prosaic formulation is to find three lattice points which form an &lt;a href=&quot;http://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93Diophantine_graph&quot; rel=&quot;nofollow noreferrer&quot;&gt;Erdős-Diophantine graph&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to write code (see below) which takes three co-ordinates as input and produces a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2194/194&quot;&gt;truthy or falsy output&lt;/a&gt;: truthy if the co-ordinates are a solution to the 3 knishops problem, and falsy otherwise. The code must be able to handle each of the test cases below in no more than one minute on a reasonable desktop machine.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The small print&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&quot;Write code&quot; should be understood to permit one of the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A program which takes input via stdin and gives output via stdout. The permitted input formats are 6 integers, delimited by your choice of a comma or whitespace, and optionally wrapped in one of parentheses &lt;code&gt;()&lt;/code&gt;, curly brackets &lt;code&gt;{}&lt;/code&gt;, or square brackets &lt;code&gt;[]&lt;/code&gt;; or three pairs, each pair similarly delimited and wrapped, and the pairs similarly delimited and wrapped. Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 0 3 4 12 13&#xA;(0,0,3,4,12,13)&#xA;{0,0},{3,4},{12,13}&#xA;{{0 0} {3 4} {12 13}}&#xA;[{0 0} {3 4} {12 13}]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or using different whitespace for the two types of delimiter:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 0&#xA;3 4&#xA;12 13&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A named function, verb, block, or equivalent which takes input as an array of six values, an array of three two-element arrays, three separate arrays of two-element arrays, or six separate parameters; and gives output as a return value.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You may assume that none of the input values or the unattacked points have coordinates outside the range $\pm 2^30$.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input                          output&#xA;&#xA;(0 0) (0 0) (0 0)              false&#xA;(0 0) (3 4) (12 13)            false&#xA;(5 -5) (8 -1) (2 -9)           false&#xA;(0 0) (384 2030) (720 1653)    true&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;TODO More test cases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot;&gt;chess&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;NB I need to code up some naïve approaches and test whether the one-minute restriction is actually relevant. I'm hoping that MathJAX will be enabled; if not, the stuff in dollars will be replaced before posting.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:50:45.800" LastActivityDate="2015-01-08T09:39:32.010" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4646" PostTypeId="2" ParentId="2140" CreationDate="2015-01-08T05:33:33.913" Score="0" Body="&lt;h1&gt;The Great, White, North! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44757/the-great-white-north&quot;&gt;POSTED&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="15822" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.863" LastActivityDate="2015-01-21T04:43:31.503" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="4647" PostTypeId="1" CreationDate="2015-01-08T10:46:17.333" Score="2" ViewCount="144" Body="&lt;p&gt;I think &lt;a href=&quot;https://codegolf.stackexchange.com/questions/43218/calculate-the-square-of-an-integer-with-restrictions&quot; title=&quot;square with no loops&quot;&gt;this question&lt;/a&gt; needs some discussion. The close/reopen cycle and the mix of up and downvotes suggests strong opinions on both sides. Can we have them presented and discussed?&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-01-08T12:39:47.523" Title="13 close votes, 8 downvotes, and still no meta post on the restricted square challenge" Tags="|discussion|specific-question|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4648" PostTypeId="2" ParentId="4647" CreationDate="2015-01-08T11:14:29.107" Score="12" Body="&lt;p&gt;The first five close votes, resulting in a close as unclear, were cast when the title and body contradicted each other.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The next five, resulting in a second close as unclear, were probably cast in order to get more clarification on&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;You may not use a loop, or use a constructions that is similar to a loop. Example of loop like constructions are GOTO and recursion.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;judging by the upvotes on my comment&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This shouldn't have been reopened, because it still lacks clarity on what counts as &quot;loop-like&quot;. E.g. what about folds?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The second reopen followed an edit which provided the definition&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;if you could add an stdout &quot;1&quot; to your code and you would end up with repeating that output n times, it will count as a loop&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'm not entirely sure why the question is still getting close votes, but there are at least two plausible candidate reasons.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;It could be that people think Optimizer's question&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;(2) Is evaluating string as a code using eval/exec allowed ?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;hasn't been answered yet.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It could be that people think the definition of a loop is unclear in other ways. For example, in CJam it would permit use of the &lt;code&gt;f&lt;/code&gt; operator, which is defined as a for loop but which takes a single token as the loop body and hence wouldn't permit inserting &lt;code&gt;1p&lt;/code&gt; into the loop.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;As for the downvotes, the history of the question certainly shows a lack of research effort and clarity. The spec still isn't very good, and (at the risk of being too provocative) I hold popcons to a higher standard than questions with better winning criteria.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2015-01-08T11:14:29.107" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4651" PostTypeId="2" ParentId="2140" CreationDate="2015-01-09T11:02:41.903" Score="56" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; If you are seeing this first, you might want to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?answertab=modifieddesc&quot;&gt;sort by active&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Count the pips in a pair of dice&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/16588/11006&quot;&gt; Moved here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="11006" LastEditorUserId="97857" LastEditDate="2022-06-12T18:33:09.940" LastActivityDate="2022-06-12T18:33:09.940" CommentCount="17" ContentLicense="CC BY-SA 4.0" />
  <row Id="4652" PostTypeId="1" CreationDate="2015-01-09T11:45:41.493" Score="7" ViewCount="269" Body="&lt;p&gt;Some classes of question are made more interesting by banning comments. For example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Polyglots: &lt;a href=&quot;https://codegolf.stackexchange.com/q/38250/194&quot;&gt;example&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Some source layout questions: &lt;a href=&quot;https://codegolf.stackexchange.com/q/33150/194&quot;&gt;example 1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/q/44368/194&quot;&gt;example 2&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Others, such as &lt;a href=&quot;https://codegolf.stackexchange.com/q/30159/194&quot;&gt;this code-bowling question&lt;/a&gt; have special treatment of comments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Many languages define delimiters for comments, but not all. So e.g. in CJam, the convention appears to be to comment your code by pushing a string with the comment text onto the stack and then popping it:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;These instructions do such-and-such&quot;;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;That also has the same trivial semantics in GolfScript, although that has an explicit comment delimiter which is typically used for commenting code:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# This is a comment in GS&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Some imperative languages allow any expression to be a statement, and so a simple&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;This is a string&quot;;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is permitted but has trivial semantics. (E.g. JS allows this, and actually exploits it for &lt;a href=&quot;https://stackoverflow.com/q/1335851/573420&quot;&gt;&lt;code&gt;&quot;use strict&quot;;&lt;/code&gt;&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Should these ignored strings be considered comments?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2015-01-22T08:32:28.973" Title="&quot;No comments&quot; restrictions and stack-based languages / unused strings" Tags="|discussion|" AnswerCount="4" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="4653" PostTypeId="2" ParentId="4652" CreationDate="2015-01-09T11:45:41.493" Score="4" Body="&lt;h3&gt;Yes&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If it looks like a duck...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An unqualified formal language-agnostic definition of &lt;em&gt;comment&lt;/em&gt; is probably impossible, but the essential quality is that it's a range of characters which doesn't affect execution. Generally a comment will also be able to contain most characters and character sequences other than its delimiters. Those two properties are what motivates someone to ban them as a copout for polyglots and source layout, and they're shared by strings which are pushed to the stack and immediately popped.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question of generalisation to all dead code has been raised in the comments. If someone wants to make a case against dead code in general, either in an answer or in a separate question, they should feel free. But I don't think that's quite the same case for a number of reasons:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The people asking questions are more likely to be familiar with dead code (which exists in pretty much every language), whereas ignored strings are easily overlooked by people who are only familiar with a few languages.&lt;/li&gt;&#xA;&lt;li&gt;Asking for polyglots with no dead code in any language is much harder than asking for polyglots with no comments.&lt;/li&gt;&#xA;&lt;li&gt;Popped strings are the idiomatic way of commenting code in CJam, so whether or not the language spec calls them comments it seems unreasonable to claim that they're not. And if they're comments in CJam, it seems unreasonable to claim that they're not in GolfScript.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="194" LastEditorUserId="194" LastEditDate="2015-01-09T14:20:33.900" LastActivityDate="2015-01-09T14:20:33.900" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="4654" PostTypeId="2" ParentId="4652" CreationDate="2015-01-09T13:36:36.923" Score="1" Body="&lt;p&gt;I think with this question we have arrived at a certain type of loophole. It cannot be classified with just one approach and defining the complete spec of this loophole is not that straightforward.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While I am totally up for defining a spec and banning the whole set, targeting a specific answer (&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/19453030#19453030&quot;&gt;what you are doing here&lt;/a&gt;) , which is targeting a specific answer and a specific use case (and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4652/no-comments-restrictions-and-stack-based-languages-unused-strings#comment13194_4653&quot;&gt;stating&lt;/a&gt; that anything other than that is not being targeted here) is unjust and wrong.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As I have already said in comments, using string and popping it in CJam is just an approach to the idea. If you target that specific approach, nothing is stopping me or others to simply replace that approach with any other similar ones.&lt;/p&gt;&#xA;" OwnerUserId="31414" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-01-09T13:36:36.923" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="4655" PostTypeId="2" ParentId="4652" CreationDate="2015-01-09T17:33:53.550" Score="1" Body="&lt;p&gt;Let's start with the definition of a comment on wikipedia:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;In computer programming, a comment is a programming language construct used to embed programmer-readable annotations in the source code of a computer program.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Following this definition, the example could be considered as a comment. However you could use a other definition. The free dictionary defines a programming comment as:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A string of text in a program that does not function in the program itself but is used by the programmer to explain instructions.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The CJam example is definitely understood and executed by the interpreter, so you could say it's not a comment. But this is controversial: e.g. in python, a multiline comment and a multiline string is the same (triple quotes). So in my opinion a string can be considered as a comment if it's used as a comment (what doesn't make it a comment of course). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;But why are comments banned in these questions? Because they allow for quick unused code. And string-comments are used exactly for this reasons so it sounds reasonable to ban them, regardless of the fact if they're comments or not. However, to me, banning strings seems not only ambiguous but also unnecessary. The use of eval statements is what makes this abuse possible (in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44368/retrograde-morse-dencoder&quot;&gt;my question&lt;/a&gt; at least). So while you could consider the CJam string-comment as a comment, the things that actually should be banned are the things that make comments executable. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This of course doesn't apply  to polyglot challenges, here comment-like string use should be explicitly forbidden.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I won't ban eval/exec-like functions in my question (it's used in the other answers too), but I think it's the best approach to avoid loopholes.&lt;/p&gt;&#xA;" OwnerUserId="33214" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2015-01-09T17:33:53.550" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4658" PostTypeId="2" ParentId="2140" CreationDate="2015-01-10T12:18:02.653" Score="0" Body="&lt;h1&gt;A natural divisor&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Expressiveness, natural language elements and readability, these are just a few of the awesome features/ideologies modern high-level languages promise us. But how &quot;readable&quot; and &quot;natural&quot; are these languages really? Can you really read them as they were english? In this challenge you have to prove how (un)natural your preferred language really is.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You're to write a program that accepts a list/string of numbers from the STDIN, and outputs their &lt;a href=&quot;http://en.wikipedia.org/wiki/Greatest_common_divisor&quot; rel=&quot;nofollow&quot;&gt;greatest common divisor&lt;/a&gt; to the STDOUT. However you also need to write a complete description of your program, an english explanation of your entire program. The challenge is to make your program resemble the description as much as possible. As in a perfect natural programming language there would be no difference, your score will be the &lt;a href=&quot;http://en.wikipedia.org/wiki/Levenshtein_distance&quot; rel=&quot;nofollow&quot;&gt;Levenshtein distance&lt;/a&gt; between your program and your description.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your description can only contain correct english sentences. The sentences must be at least six words long.&lt;/li&gt;&#xA;&lt;li&gt;The description must contain the full and correct  process of your program. Nothing more or less. An example can be found below. As a general rule: a programmer that doesn't understand your language should completely understand your description and should be  able to recreate the exact algorithm. &lt;/li&gt;&#xA;&lt;li&gt;Your program cannot contain both comments or strings.&lt;/li&gt;&#xA;&lt;li&gt;Your program should use &lt;a href=&quot;http://mathworld.wolfram.com/GreatestCommonDivisor.html&quot; rel=&quot;nofollow&quot;&gt;the universal accepted definition&lt;/a&gt; to calculate the greatest common divisor. If the input only contains &lt;code&gt;0&lt;/code&gt;'s, you have to output &lt;code&gt;0&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a fibonacci function to illustrate how a description should look like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;PROGRAM:&#xA;def F(n):&#xA;    if n == 0: return 0&#xA;    elif n == 1: return 1&#xA;    else: return F(n-1)+F(n-2)&#xA;&#xA;DESCRIPTION:&#xA;Define a function F with input n. If n equals 0, return 0. &#xA;Else, if n equals 1, return 1. &#xA;Else, return the output of F with input n minus 1, &#xA;plus the output of F with input n minus 2.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Score&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As mentioned earlier, your score is the levenshtein distance between your description and your program. You can calculate your levenshtein distance with the following snippet (thanks doorknob):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;var f=document.getElementById(&quot;f&quot;),g=document.getElementById(&quot;s&quot;); function h(){var a=f.value,e=g.value;if(128&amp;lt;a.length)a=&quot;&amp;lt;span style='color:red'&amp;gt;First program is too long!&amp;lt;/span&amp;gt;&quot;;else if(128&amp;lt;e.length)a=&quot;&amp;lt;span style='color:red'&amp;gt;Second program is too long!&amp;lt;/span&amp;gt;&quot;;else{if(0===a.length)a=e.length;else if(0===e.length)a=a.length;else{var d=[],b;for(b=0;b&amp;lt;=e.length;b++)d[b]=[b];var c;for(c=0;c&amp;lt;=a.length;c++)d[0][c]=c;for(b=1;b&amp;lt;=e.length;b++)for(c=1;c&amp;lt;=a.length;c++)d[b][c]=e.charAt(b-1)===a.charAt(c-1)?d[b-1][c-1]:Math.min(d[b-1][c-1]+1,Math.min(d[b][c-1]+1,d[b-1][c]+ 1));a=d[e.length][a.length]}a=&quot;Distance = &amp;lt;strong&amp;gt;&quot;+a+&quot;&amp;lt;/strong&amp;gt;&quot;}document.getElementById(&quot;d&quot;).innerHTML=a}f.onkeyup=h;g.onkeyup=h;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;h3 id=ft&amp;gt;program&amp;lt;/h3&amp;gt;&#xD;&#xA;&amp;lt;textarea id=f rows=7 cols=80 style=&quot;width:100%&quot;&amp;gt;&amp;lt;/textarea&amp;gt;&#xD;&#xA;&amp;lt;h3 id=st&amp;gt;description&amp;lt;/h3&amp;gt;&#xD;&#xA;&amp;lt;textarea id=s rows=7 cols=80 style=&quot;width:100%&quot;&amp;gt;&amp;lt;/textarea&amp;gt;&#xD;&#xA;&amp;lt;p id=d&amp;gt;&amp;lt;/p&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions/notes:&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The question was just crazy idea for the most part. Do you think this question would work?&lt;/li&gt;&#xA;&lt;li&gt;Are there any languages that would get an unfair advantage? Are there more things I should ban?&lt;/li&gt;&#xA;&lt;li&gt;I know the description of the program description is somewhat subjective, so the answers would mostly involve being creative with their description. Are their any additional rules that could restrain this?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="33214" LastEditorUserId="33214" LastEditDate="2015-01-10T14:56:04.350" LastActivityDate="2015-01-10T14:56:04.350" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4660" PostTypeId="2" ParentId="2140" CreationDate="2015-01-14T01:42:58.047" Score="0" Body="&lt;h1&gt;Final Exam Grade Calculator&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;So, it's around time for finals, and many students want to know what grade they need on their final exam to achieve an A, B, or sometimes a passing grade. There are many factors here - the weight of the final, two quarters having weight, what grade the students want - but it is still a simple task.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program that will take three integers and output the grade they need to receive on the final.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Three integers. The first two will be from 0 to 100, and the last will be from 1 to 100. They represent the current score in the class, the desired score, and the weight of the final, respectively. A working example can be found &lt;a href=&quot;http://rogerhub.com/final-grade-calculator/&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any input outside the expected ranges can have undefined behavior.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The score the student needs to receive on the final exam. This score &lt;strong&gt;could&lt;/strong&gt; be above 100 (every once in a while, students have unrealistic expectations), but if it is a negative number, it is automatically 0. The formula for score is as follows.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;(desired - (current score * (1 - weight*.01))) * 100/weight&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output may not be an integer. In this case, round to the nearest hundredth (round up for .##5).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: 100 90 20    &#xA;50&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;i&gt;&lt;/i&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: 65 60 30&#xA;48.33&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;i&gt;&lt;/i&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: 54 100 25&#xA;238&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, so the shortest code wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Bonuses&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;-10% if your code can take either 3 or 4 integers as input. If four integers are taken, then the first two are averaged to give what would normally be the first integer. Each of the first two integers here represents a quarter grade.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;What other bonuses should I add? I can't think of many right now, but even one or two more would be helpful.&lt;/p&gt;&#xA;" OwnerUserId="26683" LastEditorUserId="194" LastEditDate="2015-01-14T14:10:03.317" LastActivityDate="2015-01-14T14:10:03.317" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="4661" PostTypeId="2" ParentId="2140" CreationDate="2015-01-14T18:14:29.490" Score="1" Body="&lt;h1&gt;Generate a Random Boolean Expression&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;generation&amp;#39;&quot; rel=&quot;tag&quot;&gt;generation&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you generate a random Boolean expression -- and then evaluate it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Nothing, or a random seed if your program requires one.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A random Boolean expression and its value, formatted as a string&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;expr&amp;gt; = &amp;lt;value&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The expression should be generated according to the following BNF grammar:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;expr&amp;gt; ::= &quot;0&quot; | &quot;1&quot;&#xA;         | &quot;(&quot; &amp;lt;expr&amp;gt; &quot;^&quot; &amp;lt;expr&amp;gt; &quot;)&quot;&#xA;         | &quot;(&quot; &amp;lt;expr&amp;gt; &quot;v&quot; &amp;lt;expr&amp;gt; &quot;)&quot;&#xA;         | &quot;(&quot; &amp;lt;expr&amp;gt; &quot;&amp;gt;&quot; &amp;lt;expr&amp;gt; &quot;)&quot;&#xA;         | &quot;~&quot; &amp;lt;expr&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here, &lt;code&gt;^&lt;/code&gt; stands for binary AND, &lt;code&gt;v&lt;/code&gt; for binary OR, &lt;code&gt;&amp;gt;&lt;/code&gt; for implication, and &lt;code&gt;~&lt;/code&gt; for NOT. Whitespace is not significant. The correct value for the expression should be self-explanatory. Some correct outputs include&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 = 0&#xA;~ (~1 ^ 1) = 1&#xA;((1v1) ^ ~(0 &amp;gt;(1 ^ ~~~0))) = 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Detailed Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Assuming a perfect random number generator, your program must be able to generate any valid Boolean expression with nonzero probability (discounting whitespace). You must use you language's standard RNG, or one of higher quality.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can write either a function or a full program, and a function can either return its result or print it to STDOUT. The fewest bytes wins, and standard loopholes are disallowed.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I'd like some input on whether this challenge is essentially similar to either &lt;a href=&quot;https://codegolf.stackexchange.com/questions/804/random-sentence-generator&quot;&gt;this&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/617/advanced-calculator&quot;&gt;this&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.893" LastActivityDate="2015-01-14T18:21:27.170" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4662" PostTypeId="1" AcceptedAnswerId="4664" CreationDate="2015-01-15T00:17:47.837" Score="13" ViewCount="247" Body="&lt;p&gt;A challenge was recently posted without a winning criterion and subsequently closed. I added one. The revision was then rolled back and I was told that only the OP could make functional changes to a challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I disagree with this reaction. If the OP is a newbie and demonstrates a complete lack of knowledge about how the site works, I should be able to flex my editing privileges by making larger changes than I would for a high-rep user. This includes, but is not limited to:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Adding a winning criteria that fits.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I think that the default victory condition should be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, unless the challenge lends itself well towards another category.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Removing language restrictions that are unnecessary.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The default assumption is that they are unnecessary until proven otherwise.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Closing loopholes that are glaring.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This would normally be done in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/18487&quot;&gt;Sandbox&lt;/a&gt;, which newbies tend to skip.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Edit: I do not propose this &lt;em&gt;instead of&lt;/em&gt; commenting to let the user know how the site works. I propose this &lt;em&gt;in addition to&lt;/em&gt; commenting to let the user know how the site works.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2018-03-06T14:57:20.157" Title="Is a broken question automatically dead unless the original poster fixes it?" Tags="|discussion|" AnswerCount="3" CommentCount="0" ClosedDate="2018-03-05T21:01:22.563" ContentLicense="CC BY-SA 3.0" />
  <row Id="4663" PostTypeId="2" ParentId="4662" CreationDate="2015-01-15T00:33:04.273" Score="-1" Body="&lt;p&gt;(One important information miss out in this particular case is that he question was put on hold for not having a winning criteria)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are a few catches here:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We are not sure that OP's intention is actually a shortest code. It can be any of the many other things (for example, fastest code). This details was not clear in the question and it is why the question was put on hold.&lt;/li&gt;&#xA;&lt;li&gt;OP can very well be asking for tips and that is the reason for adding a language restriction. Being a newbie, (s)he might not be aware of an informal requirement of adding an example code to questions asking for tips&lt;/li&gt;&#xA;&lt;li&gt;If the answer is put on hold, the next action item is for the OP to clear things out. If the above listed things are not clear, then making all the changes listed by Rainbolt here non-intuitive. The best course of action in this scenario is to put the suggestions as a comment and wait for the OP to clarify things.&lt;/li&gt;&#xA;&lt;li&gt;If your views are conflicting with another user, then you can always ask for moderator's hammer. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/44534/sum-of-powers-of-2&quot;&gt;The question&lt;/a&gt; which triggered this meta post actually had a comment telling why it is being put on hold, but till date there are no comments what so ever suggesting the changes to make the post better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now if OP is not replying for a day or so and you think that the post can be improved to a point that it can be reopened and adds value to the site, then I think the best action is to ask a fresh question which is properly structured.&lt;/p&gt;&#xA;" OwnerUserId="31414" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2015-01-15T08:43:40.150" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="4664" PostTypeId="2" ParentId="4662" CreationDate="2015-01-15T03:28:56.183" Score="8" Body="&lt;p&gt;I don't think there isn't a big problem with this. If the challenge needs a few minor edits, then of course you don't want to change it up completely. If it looks like a homework dump &lt;em&gt;that would otherwise be deleted&lt;/em&gt; by the script that cleans up downvoted/closed questions, then go for it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course I may be a bit biased since I've done this before. Upon initial posting, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/38444/make-a-one-sequence&quot;&gt;&lt;em&gt;Make a one sequence&lt;/em&gt;&lt;/a&gt; looked like this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A sequence of integers is a one- sequence if the difference between any two consecutive numbers in this sequence is -1 or 1 and its first element is 0.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;More precisely: a1, a2, ..., an is a one-sequence if:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;For any k (1 ≤  k &amp;lt; n): |a[k] - a[k+1]|=1, &#xA;a[1]=0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;Given n and s ─ sum of all elements in a. W need to construct a one-sequence with the given parameters.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Like If n=8 and s=4 then one of such sequence is [0 1 2 1 0 -1 0 1].&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Note if for given n and s we cant form such sequence than also we need to tell that its not possible.Otherwise we need to tell any of such one sequence.How to do this problem Please help.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;There is no winning criteria listed, bad grammar/layout, no input/output format... basically most of the things that we look at when judging a question. It's even clear (to me, at least), that the OP did not care about golfiness at all, and just wanted to know how to do it. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It was downvoted (-3 IIRC) closed as off-topic in short order. I saw the potential for an interesting golf and edited it, two hours after posting. It was then reopened and is now at +11 with 9 answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my opinion, this is exactly the type of thing we should be doing. That question would have been deleted via script, I have no doubt. Yes, I &lt;em&gt;could&lt;/em&gt; have waited for that and posted it again myself (and gotten some rep for it to boot), but why do that when I could polish it now and give the OP (who was brand new to the site) an example of what a challenge &lt;em&gt;should&lt;/em&gt; look like to learn from?&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="14215" LastEditDate="2018-03-06T14:57:20.157" LastActivityDate="2018-03-06T14:57:20.157" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4667" PostTypeId="2" ParentId="2140" CreationDate="2015-01-16T04:00:08.340" Score="0" Body="&lt;h1&gt;Possible resistances from resistors&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/electrical-engineering&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;electrical-engineering&amp;#39;&quot; rel=&quot;tag&quot;&gt;electrical-engineering&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Meta: Note this is far from done; just putting this idea out so that I can continue working on it. IE way work in progress. I need to specify a lot more of this and I'm putting this here because I know I won't end up working on this if it isn't here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a set of resistors, output all the possible resistances that can be formed with them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thoughts so far:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input will be a comma-separated &lt;strong&gt;or&lt;/strong&gt; space-separated list of natural numbers such as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 4 3 2 4 3 5 999&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Output:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Output will be all the possible formable resistances, sorted, on its own lines, plus the number of ways to form each resistance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(no example yet)&lt;/p&gt;&#xA;" OwnerUserId="9498" LastActivityDate="2015-01-16T04:00:08.340" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4670" PostTypeId="2" ParentId="1137" CreationDate="2015-01-17T14:00:34.940" Score="1" Body="&lt;h1&gt;We did it!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Assuming the goal @Doorknob set with:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;3 trusted users&lt;/li&gt;&#xA;&lt;li&gt;10 deleters&lt;/li&gt;&#xA;&lt;li&gt;80 closers&lt;/li&gt;&#xA;&lt;li&gt;120 editors&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;is still valid, we did it! We currently have:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;4 trusted users, (Martin Büttner, Doorknob, Howard and Peter Taylor)&lt;/li&gt;&#xA;&lt;li&gt;14 deleters&lt;/li&gt;&#xA;&lt;li&gt;94 closers&lt;/li&gt;&#xA;&lt;li&gt;160 editors&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://data.stackexchange.com/codegolf/revision/172072/219478/&quot; rel=&quot;nofollow&quot;&gt;Doorknob's query&lt;/a&gt; for reference.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Now I suggest we finally step up to take our rightful place at the side of the other sites!&lt;/h2&gt;&#xA;" OwnerUserId="21038" LastEditorUserId="9275" LastEditDate="2015-01-18T07:51:38.793" LastActivityDate="2015-01-18T07:51:38.793" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="4671" PostTypeId="2" ParentId="2140" CreationDate="2015-01-17T15:15:06.863" Score="0" Body="&lt;h1&gt;Regex vs HTML&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;As the &lt;a href=&quot;https://stackoverflow.com/a/1732454/3946766&quot;&gt;Stack Overflowers&lt;/a&gt; have been defeated, it is up to the Programming Puzzlers and Code Golfers to fight this final battle against the regex-resisting HTML-hordes. Pick up your flavour of choice and join the melee, with the shortest regex you can achieve (no, not like &lt;a href=&quot;http://pastebin.com/HUmPzP5M&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt;)!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a regex which takes a html tag, and splits it into &lt;code&gt;tag name&lt;/code&gt;, &lt;code&gt;attributes&lt;/code&gt; and &lt;code&gt;body&lt;/code&gt;. For example, &lt;code&gt;&amp;lt;img src=&quot;something.jpg&quot;&amp;gt;caption&amp;lt;/img&amp;gt;&lt;/code&gt; is converted to &lt;code&gt;img&lt;/code&gt;, &lt;code&gt;src=&quot;something.jpg&quot;&lt;/code&gt; and &lt;code&gt;caption&lt;/code&gt;. Your regex will be run by the controller against a list of tests. Any regex flavour can be used, as long as there is a &lt;a href=&quot;https://github.com/matsjoyce/CodeGolf-HtmlRegex/blob/master/drivers/drivers.ini&quot; rel=&quot;nofollow noreferrer&quot;&gt;driver&lt;/a&gt; available (or you want to write your own).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The regex should contain at least 4 groups, one each for tag name, tag attributes, tag body (contents) and a group for the html tag matched, which may be group 0 (which will not add to your regex length).&lt;/li&gt;&#xA;&lt;li&gt;Your regex does &lt;strong&gt;not&lt;/strong&gt; need to handle all the test cases, but the more handled, the higher your score.&lt;/li&gt;&#xA;&lt;li&gt;The scoring formula is &lt;code&gt;(100 - log(self.length) * 40) * ((passes - total) / total + 1)&lt;/code&gt;, but this will be handled by the scoring program. This formula might change, based on how the challenge progresses. A higher score is better.&lt;/li&gt;&#xA;&lt;li&gt;For your regex, you &lt;strong&gt;must&lt;/strong&gt; specify the &lt;a href=&quot;https://github.com/matsjoyce/CodeGolf-HtmlRegex/blob/master/drivers/drivers.ini&quot; rel=&quot;nofollow noreferrer&quot;&gt;driver&lt;/a&gt; you use (the name in square brackets), any flags and the group names or numbers that hold the split bits. Flags do not contribute towards regex length.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Testing&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program will be run over 30 tests (more may be added) by the &lt;a href=&quot;https://github.com/matsjoyce/CodeGolf-HtmlRegex&quot; rel=&quot;nofollow noreferrer&quot;&gt;scoring program&lt;/a&gt;, and the number of passes counted.&lt;/li&gt;&#xA;&lt;li&gt;Length is in bytes.&lt;/li&gt;&#xA;&lt;li&gt;Your score then is &lt;code&gt;(100 - log(length) * 40) * ((passes - total) / total + 1)&lt;/code&gt;, but this will be handled by the scoring program. This formula might change, based on how the challenge progresses.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Types of html that you can score points on (remember not all need to be handled):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Paired html tags - &lt;code&gt;&amp;lt;a&amp;gt;b&amp;lt;/a&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Tags with the self-closing syntax - &lt;code&gt;&amp;lt;br/&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Quoted attributes (using either single or double quotes) - &lt;code&gt;&amp;lt;a href='mysite.com'&amp;gt;b&amp;lt;/a&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Unquoted attributes - &lt;code&gt;&amp;lt;b strength=1&amp;gt;msg&amp;lt;/b&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Empty or boolean attributes - &lt;code&gt;&amp;lt;input disabled/&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Comments (tag name is &lt;code&gt;!--&lt;/code&gt;, attrs is empty, body is the text of the comment) - &lt;code&gt;&amp;lt;!-- Something important --&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;DOCTYPE sections (tag name is &lt;code&gt;!DOCTYPE&lt;/code&gt;, body is the following text) - &lt;code&gt;&amp;lt;!DOCTYPE html&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;CDATA sections (tags inside ignored) - &lt;code&gt;&amp;lt;![CDATA[&amp;lt;br/&amp;gt;]]&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Example tests (one on each line, &lt;a href=&quot;https://github.com/matsjoyce/CodeGolf-HtmlRegex/blob/master/tests.py&quot; rel=&quot;nofollow noreferrer&quot;&gt;full list of tests and answers&lt;/a&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;a&amp;gt;b&amp;lt;/a&amp;gt;&#xA;&amp;lt;a href='mysite.com'&amp;gt;b&amp;lt;/a&amp;gt;&#xA;&amp;lt;a href='mysite.com' color=&quot;blue&quot; height=1&amp;gt;b&amp;lt;/a&amp;gt;&#xA;&amp;lt;quote href=&quot;http://somewhere.com&quot;&amp;gt;&quot;he said this&quot;&amp;lt;/quote&amp;gt;&#xA;&amp;lt;div class=&quot;quote&quot;&amp;gt;The answer is &amp;lt;div id='the-answer'&amp;gt;42&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&#xA;f'g(&amp;lt;b&amp;gt;x&amp;lt;/b&amp;gt;)g'(&amp;lt;b&amp;gt;y&amp;lt;/b&amp;gt;)&#xA;&amp;lt;input text='Your name:' focused/&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Answers to examples (one on each line):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Name   Attrs                                    Body                                         Matched&#xA;=================================================================================================================================================================&#xA;a                                               b                                            &amp;lt;a&amp;gt;b&amp;lt;/a&amp;gt;&#xA;a      href='mysite.com'                        b                                            &amp;lt;a href='mysite.com'&amp;gt;b&amp;lt;/a&amp;gt;&#xA;a      href='mysite.com' color=&quot;blue&quot; height=1  b                                            &amp;lt;a href='mysite.com' color=&quot;blue&quot; height=1&amp;gt;b&amp;lt;/a&amp;gt;&#xA;quote  href=&quot;http://somewhere.com&quot;              &quot;he said this&quot;                               &amp;lt;quote href=&quot;http://somewhere.com&quot;&amp;gt;&quot;he said this&quot;&amp;lt;/quote&amp;gt;&#xA;div    class=&quot;quote&quot;                            The answer is &amp;lt;div id='the-answer'&amp;gt;42&amp;lt;/div&amp;gt;  &amp;lt;div class=&quot;quote&quot;&amp;gt;The answer is &amp;lt;div id='the-answer'&amp;gt;42&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&#xA;b                                               x                                            &amp;lt;b&amp;gt;x&amp;lt;/b&amp;gt;&#xA;input  text='Your name:' focused                                                             &amp;lt;input text='Your name:' focused/&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There is a timeout for the regex matching (currently 5 seconds, but this may change depending on the number of submissions), so if you are making a bit / computationally expensive regex, use a fast driver. The tests will be run on a 2013 MacBook Air, most likely single threaded (although 4 cores are available).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Drivers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Contributions of drivers is much appreciated. See the &lt;a href=&quot;https://github.com/matsjoyce/CodeGolf-HtmlRegex/blob/master/README.md#driver-writing&quot; rel=&quot;nofollow noreferrer&quot;&gt;instructions on github.com&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Results&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Name                          Length    Score     Passes    Fails     Timeouts  Errors    &#xA;==========================================================================================&#xA;Naive                         68        10.6799   12        18        0         0         &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the scoring formula fair?&lt;/li&gt;&#xA;&lt;li&gt;Is this too easy / hard?&lt;/li&gt;&#xA;&lt;li&gt;Would abstracting the controller a bit more allow the controller and drivers be useful for scoring other challenges? Would anybody want to use it?&lt;/li&gt;&#xA;&lt;li&gt;There is currently a python and a perl driver. Are there any other major regex flavours that should be supported, or should I wait and see until after the sandbox?&lt;/li&gt;&#xA;&lt;li&gt;Is there any parts of the challenge that are a bit clunky and need rewriting?&lt;/li&gt;&#xA;&lt;li&gt;Could someone add this to the listing at the top?&lt;/li&gt;&#xA;&lt;li&gt;Anything I've missed?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="30630" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2015-03-05T18:47:24.857" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="4672" PostTypeId="1" AcceptedAnswerId="4673" CreationDate="2015-01-17T16:34:04.613" Score="5" ViewCount="112" Body="&lt;p&gt;I noticed that we don't have a tag for challenges which are about dealing with the file system (checking for files, creating directories, moving files, etc.).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe we should create one, but I thought there was no obvious choice for a name. So I thought, let's do a good ol' meta poll. I'll add a few suggestions. Please vote according to your preferences and add your own suggestions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once there is a clear consensus I will accept the relevant answer and slowly start retagging old challenges.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2015-01-17T16:44:54.790" LastActivityDate="2015-01-17T16:44:54.790" Title="What tag should we use for challenges about manipulating files and directories?" Tags="|discussion|tags|" AnswerCount="7" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4673" PostTypeId="2" ParentId="4672" CreationDate="2015-01-17T16:34:25.323" Score="18" Body="&lt;p&gt;We should create a tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/file-system&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;file-system&amp;#39;&quot; rel=&quot;tag&quot;&gt;file-system&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-01-17T16:34:25.323" CommentCount="2" CommunityOwnedDate="2015-01-17T16:34:25.323" ContentLicense="CC BY-SA 3.0" />
  <row Id="4674" PostTypeId="2" ParentId="4672" CreationDate="2015-01-17T16:35:26.393" Score="-4" Body="&lt;p&gt;We should create a tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/file-systems&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;file-systems&amp;#39;&quot; rel=&quot;tag&quot;&gt;file-systems&lt;/a&gt; (note the plural).&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-01-17T16:35:26.393" CommentCount="0" CommunityOwnedDate="2015-01-17T16:35:26.393" ContentLicense="CC BY-SA 3.0" />
  <row Id="4675" PostTypeId="2" ParentId="4672" CreationDate="2015-01-17T16:35:57.073" Score="0" Body="&lt;p&gt;We should create a tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/danger-will-robinson&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;danger-will-robinson&amp;#39;&quot; rel=&quot;tag&quot;&gt;danger-will-robinson&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2015-01-17T16:35:57.073" CommentCount="5" CommunityOwnedDate="2015-01-17T16:35:57.073" ContentLicense="CC BY-SA 3.0" />
  <row Id="4676" PostTypeId="2" ParentId="4672" CreationDate="2015-01-17T16:37:08.467" Score="3" Body="&lt;p&gt;We should create separate tags &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/files&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;files&amp;#39;&quot; rel=&quot;tag&quot;&gt;files&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/directories&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;directories&amp;#39;&quot; rel=&quot;tag&quot;&gt;directories&lt;/a&gt;. Challenges which involve the manipulation of both can use both tags.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-01-17T16:37:08.467" CommentCount="1" CommunityOwnedDate="2015-01-17T16:37:08.467" ContentLicense="CC BY-SA 3.0" />
  <row Id="4677" PostTypeId="2" ParentId="4672" CreationDate="2015-01-17T16:38:11.953" Score="-6" Body="&lt;p&gt;There is no need for such a tag.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-01-17T16:38:11.953" CommentCount="1" CommunityOwnedDate="2015-01-17T16:38:11.953" ContentLicense="CC BY-SA 3.0" />
  <row Id="4678" PostTypeId="2" ParentId="4672" CreationDate="2015-01-17T16:39:13.323" Score="5" Body="&lt;p&gt;We should create a tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/file-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;file-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;file-manipulation&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-01-17T16:39:13.323" CommentCount="0" CommunityOwnedDate="2015-01-17T16:39:13.323" ContentLicense="CC BY-SA 3.0" />
  <row Id="4679" PostTypeId="2" ParentId="4672" CreationDate="2015-01-17T16:40:32.293" Score="4" Body="&lt;p&gt;We should create a tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/file-system-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;file-system-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;file-system-manipulation&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-01-17T16:40:32.293" CommentCount="5" CommunityOwnedDate="2015-01-17T16:40:32.293" ContentLicense="CC BY-SA 3.0" />
  <row Id="4680" PostTypeId="1" CreationDate="2015-01-18T15:07:03.240" Score="9" ViewCount="268" Body="&lt;p&gt;We've had Stack Snippets for a few months now, and a few nice snippets have been written, which will probably come in handy time and time again. It's been brought up a few times in chat, that it might be nice to collect these on meta, so we don't have to reinvent the wheel for each new challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first question is: does anyone object to that? If so, why?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, even if we &lt;em&gt;do&lt;/em&gt; want to collect these there are several ways we could structure this, and it would be nice if we decided this upfront, so that it's consistent.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Post a single meta question, The Snippet Toolbox, where each answer contains a single snippet. Feature requests and bug reports go in the comments.&lt;/li&gt;&#xA;&lt;li&gt;Post one meta question per snippet task, e.g. &quot;Do we have an existing Stack Snippet which generates leaderboards for code golf challenges?&quot; Each answer would contain one snippet implementing the task (so we might have multiple snippets for the same purpose). Feature requests and bug reports go in the comments.&lt;/li&gt;&#xA;&lt;li&gt;Post one meta question per snippet. This could work like &lt;a href=&quot;https://stackapps.com/&quot;&gt;StackApps&lt;/a&gt;. The question itself contains the snippet, whereas answers are used for bug reports and feature requests - either in a single CW answer, or across multiple answers so that votes can indicate urgency.&lt;/li&gt;&#xA;&lt;li&gt;Any other format I didn't come up with.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Which format should we use and why?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;As per Peter's request, a few snippets we already have:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;KennyTM's &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/42910/4&quot;&gt;Levenshtein distance calculator&lt;/a&gt; has been used a few times.&lt;/li&gt;&#xA;&lt;li&gt;I've been reusing &lt;a href=&quot;https://codegolf.stackexchange.com/q/43048/8478&quot;&gt;my own code golf leaderboard&lt;/a&gt; several times, and got some positive feedback for it, so it might be nice to make it more easily reusable.&lt;/li&gt;&#xA;&lt;li&gt;It was based &lt;a href=&quot;https://codegolf.stackexchange.com/q/41462/8478&quot;&gt;on this answer-dependent challenge dashboard&lt;/a&gt; which could see some more use if we get more of these challenges. (This one was in turn based on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2492/8478&quot;&gt;Optimizer's snippet here on meta&lt;/a&gt;.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And a few snippet ideas we could probably use, but which I haven't seen yet:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A pair of leaderboards/dashboards for cops and robbers challenges.&lt;/li&gt;&#xA;&lt;li&gt;Mostly for challenges with list-like input, a snippet which converts the test cases to the most common list formats would be nice.&lt;/li&gt;&#xA;&lt;li&gt;...and who knows what else we might come up with in the future?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.863" LastActivityDate="2015-01-26T15:00:35.217" Title="Do we want to share our Stack Snippets on meta? If so, using which format?" Tags="|discussion|meta|stack-snippets|" AnswerCount="4" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="4681" PostTypeId="2" ParentId="4680" CreationDate="2015-01-18T15:07:03.240" Score="9" Body="&lt;h1&gt;Snippets go in questions, StackApps-style&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Why I'm not a fan of a single meta question:&lt;/strong&gt; it's the definition of &quot;too broad&quot;. It's just going to be a huge collection of snippets, where the relative votes won't even have any real meaning (they'll just indicate how often a snippet is used, not how good the snippet is at what it's doing). Also comments seem a bit restrictive for bug reports and features requests.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Why I'm not a fan of one question per purpose:&lt;/strong&gt; the idea of collecting the snippets is not to reinvent the wheel. So I don't think it will be very useful if everyone posts their own snippet and then you have to sift through half a dozen of snippets for the same task to decide which you like best. I'd prefer people working towards making a single snippet for each purpose the best it can be, and making it configurable for its different use cases. And again, comments seem a bit restrictive for bug reports and features requests.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Why I think putting snippets in questions is a good idea:&lt;/strong&gt; it works well on StackApps, which is the only comparable concept we have on the SE network (afaik). It allows full answers for feature requests and bug reports, which can contain more detail, and voting lets the more important requests bubble up to the top. It might motivate people more to collectively work on a single good snippet, instead of everyone providing their own, marginally different, snippet for the same task. A list of all snippets can still be found easily, if we simply use a tag for all questions like this.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-01-18T15:07:03.240" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="4682" PostTypeId="2" ParentId="4680" CreationDate="2015-01-18T16:17:56.810" Score="5" Body="&lt;p&gt;I'm not very convinced by any of the three suggestions in the question, because of this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;... Feature requests and bug reports go in the comments.&lt;/li&gt;&#xA;&lt;li&gt;... Feature requests and bug reports go in the comments.&lt;/li&gt;&#xA;&lt;li&gt;... answers are used for bug reports and feature requests ...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The StackExchange model isn't designed for software development. Looking at StackApps, a number of the apps link to GitHub for the code, feature requests and bug reports, etc. And looking at the current userscripts and suggested future directions, it seems a lot more sensible to have the code in a system which allows forks to handle variants, pull requests rather than patches whose whitespace has been mangled, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In view of the possibility (likelihood IMO) of forks which might want to merge or cherry-pick changes from each other, I think that the best model is one question with an answer per snippet which will as a general rule link out to GitHub or BitBucket. That way only one question gets bumped when three related snippets are updated.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2015-01-18T16:17:56.810" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="4683" PostTypeId="2" ParentId="4662" CreationDate="2015-01-20T14:50:47.477" Score="-3" Body="&lt;p&gt;I think there's a very thin line that has to be walked here. For example, say a user asks a question. It's very basic, but it's got an interesting logical puzzle to it. The user, not really sure of the tags and whatnot, tags the question as a [code-challenge]. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, the user forgot to add a winning condition. If a user with edit capability alters the question to have a winning condition that falls in [code-golf], would that fit what the original poster wanted? Maybe the poster wanted something in [code-bowling] or [popularity-contest]. By assuming the winning condition, you assume that your preferences apply to everyone on the site. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;But then, what if you see a question with a winning condition that you don't entirely like? Can you change it to suit your preferences better?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Being able to make minor edits, formatting changes, etc. makes sense. These are things that any proper editor would do. However an editor doesn't completely change content. That is to the author to do. Instead of suggesting an edit, send the user a message or write a comment saying that the post is too vague, too basic, or too open ended. Let them discuss with other users to learn about how the community works, instead of assuming you know what is best for the content of their post.&lt;/p&gt;&#xA;" OwnerUserId="34385" LastActivityDate="2015-01-20T14:50:47.477" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="4684" PostTypeId="2" ParentId="2140" CreationDate="2015-01-21T01:41:42.557" Score="2" Body="&lt;h1&gt;Rise and Shine &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; - Posted&lt;/h1&gt;&#xA;" OwnerUserId="15822" LastEditorUserId="15822" LastEditDate="2015-01-28T03:02:16.267" LastActivityDate="2015-01-28T03:02:16.267" CommentCount="18" ContentLicense="CC BY-SA 3.0" />
  <row Id="4685" PostTypeId="2" ParentId="2140" CreationDate="2015-01-21T02:31:14.507" Score="0" Body="&lt;h1&gt;Implement the Henkin quantifier&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/logic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;logic&amp;#39;&quot; rel=&quot;tag&quot;&gt;logic&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your goal is to implement the &lt;a href=&quot;http://en.wikipedia.org/wiki/Branching_quantifier&quot; rel=&quot;nofollow noreferrer&quot;&gt;Henkin quantifier Q_H&lt;/a&gt;, a generalized (branching) quantifier on four variables &lt;code&gt;x1,x2,y1,y2&lt;/code&gt; and a Boolean function &lt;code&gt;f&lt;/code&gt;. It expresses the idea that for every choice of the &lt;code&gt;x&lt;/code&gt;'s, there's a choice of the &lt;code&gt;y&lt;/code&gt;'s so that the four variables satisfy &lt;code&gt;f&lt;/code&gt;, so that each &lt;code&gt;y&lt;/code&gt; depends only on the corresponding &lt;code&gt;x&lt;/code&gt; and not the other one. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The parallelness of the choice of is sometimes represented by stacking the paired quantifiers like this: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Magdv.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This quantfier cannot be expressed in first-order logic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The parallel choices for the &lt;code&gt;y&lt;/code&gt;'s are like prisoners being interrogated in separated rooms. They are each asked the respective questions &lt;code&gt;x1&lt;/code&gt; or &lt;code&gt;x2&lt;/code&gt; and must give respective answers &lt;code&gt;y1&lt;/code&gt; and &lt;code&gt;y2&lt;/code&gt; without knowing what the other one was asked, so they are liable to be trapped in inconsistent claims. The guards then evaluate the validity of their responses ointly by some function &lt;code&gt;f&lt;/code&gt; that depends on both questions and answers. If the prisoners can always win this game, then &lt;code&gt;f&lt;/code&gt; satisfied the Henkin quantifer &lt;code&gt;Q_H&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Formally, the Henkin quantifier &lt;code&gt;Q_H&lt;/code&gt; takes in a Boolean function &lt;code&gt;f&lt;/code&gt; of four inputs &lt;code&gt;(x1,x2,y1,y2)&lt;/code&gt;, and evaluates whether the following statement is True:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;For every &lt;code&gt;x1&lt;/code&gt; there exists a &lt;code&gt;y1&lt;/code&gt;, and for every &lt;code&gt;x2&lt;/code&gt; there exists a &lt;code&gt;y2&lt;/code&gt;, so that &lt;code&gt;f(x1,x2,y1,y2)&lt;/code&gt; is &lt;code&gt;True&lt;/code&gt;, and the choice of &lt;code&gt;y1&lt;/code&gt; depends only on &lt;code&gt;x1&lt;/code&gt; and the choice of &lt;code&gt;y2&lt;/code&gt; depends only on &lt;code&gt;x2&lt;/code&gt;. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Alternatively stated in &lt;a href=&quot;http://en.wikipedia.org/wiki/Skolem_normal_form&quot; rel=&quot;nofollow noreferrer&quot;&gt;Skolem normal form&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;There exists functions &lt;code&gt;g1&lt;/code&gt; and &lt;code&gt;g2&lt;/code&gt; so that for every &lt;code&gt;x1&lt;/code&gt; and &lt;code&gt;x2&lt;/code&gt;, the function &lt;code&gt;f(x1,x2,g1(x1),g2(x2))&lt;/code&gt; is &lt;code&gt;True&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;For this challenge, the domain of discourse will be natural numbers from &lt;code&gt;0&lt;/code&gt; to &lt;code&gt;9&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A function &lt;code&gt;f&lt;/code&gt; that takes in four numbers &lt;code&gt;x1,x2,y1,y2&lt;/code&gt;, each between &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;9&lt;/code&gt; and produces a Boolean output. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A consistent Truthy value if &lt;code&gt;f&lt;/code&gt; satisfies the Henkin quantifier &lt;code&gt;Q_H&lt;/code&gt;, and a Falsey value if it does not.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Questions for Sandbox:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Does this challenge make any sense?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What should the input format be? Not every language can take in&#xA;functions. What about nested lists? Subsets of four-digit numbers?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2015-01-21T02:38:08.237" LastActivityDate="2015-01-21T02:38:08.237" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="4686" PostTypeId="2" ParentId="2140" CreationDate="2015-01-21T03:28:15.633" Score="3" Body="&lt;h1&gt;The Genetic Game of Life&lt;/h1&gt;&#xA;&lt;p&gt;In this game, you play as cells (as in cellular automata).  Your goal is to reproduce and kill off other cells on the board.&lt;/p&gt;&#xA;&lt;p&gt;At the beginning of the game, two distinct configurations will be randomly chosen, one for reproduction, one for killing.  The configurations will consist of 3 squares in a 5 by 5 area, not including the center square.  For example,&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;OOXOX&#xA;OOOOO&#xA;OO OO&#xA;OOOXO&#xA;OOOOO&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;is an example configuration, where &lt;code&gt;X&lt;/code&gt; represents a cell, and &lt;code&gt;O&lt;/code&gt; can either be empty or filled. The configurations do not work if rotated.&lt;/p&gt;&#xA;&lt;p&gt;The cells will be placed randomly, but equidistant from each other in a toroidal board.  Cells will be placed in a random turn order.&lt;/p&gt;&#xA;&lt;p&gt;Each turn, each cell will move a square one at a time.  If a cell's movement creates the reproduction configuration &lt;em&gt;with cells of the same type&lt;/em&gt;, and the center square is empty, then a new cell will spawn.  If a cell's movement creates the killing configuration &lt;em&gt;with cells of any type&lt;/em&gt;, and the center square is filled, then the cell in the center square will die.&lt;/p&gt;&#xA;&lt;p&gt;When a new cell spawns, its DNA will be conglomeration of the DNA of the bots in the configuration.  It will take its first turn after all other cells have taken 1 turn.&lt;/p&gt;&#xA;&lt;p&gt;A cell that has not been part of a killing configuration after 200 turns will die.&lt;/p&gt;&#xA;&lt;p&gt;The cell type with the most cells after 100K turns wins.&lt;/p&gt;&#xA;&lt;h1&gt;IO&lt;/h1&gt;&#xA;&lt;p&gt;Each turn, you will be passed a string of 1s and 0s representing your DNA, and a list of 49 integers representing a 7x7 grid of the vision around the cell.  Specimens of the same type will have the same integer, and &lt;code&gt;0&lt;/code&gt; will represent an empty square.&lt;/p&gt;&#xA;&lt;p&gt;You must return a single character (&lt;code&gt;N&lt;/code&gt;, &lt;code&gt;E&lt;/code&gt;, &lt;code&gt;S&lt;/code&gt;, &lt;code&gt;W&lt;/code&gt; or &lt;code&gt;X&lt;/code&gt;) representing the direction that the cell will travel.  Attempting to move into another cell will result in your cell not moving.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-02-05T01:45:58.113" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="4687" PostTypeId="1" AcceptedAnswerId="4690" CreationDate="2015-01-21T12:31:51.720" Score="18" ViewCount="525" Body="&lt;p&gt;We have a tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1890/8478&quot;&gt;we've had it for a while now&lt;/a&gt;. Submissions are scored based on the time complexity of the algorithm. This means that the actual implementation has no effect on the score whatsoever (except if, say, actual runtime is used as a tiebreaker).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In particular, &lt;a href=&quot;https://codegolf.stackexchange.com/q/44689/8478&quot;&gt;we had a challenge this week&lt;/a&gt; which explicitly asked for an algorithm, not necessarily with code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/44752/8478&quot;&gt;It got such an answer&lt;/a&gt; (currently only visible to high-rep users), which promptly received a comment &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This is not an answer. You have to post the actual code.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It was subsequently deleted by a mod.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For one thing I don't think it's fair to delete an answer to a question that explicitly doesn't require code. If we don't want to allow that, the question is at fault, not the answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But more importantly, &lt;em&gt;do&lt;/em&gt; we really require code for such challenges? If so that should be made clear in the tag wiki, and the &lt;em&gt;questions&lt;/em&gt; should ask for an example implementation.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-01-25T18:40:45.917" Title="Do all challenges have to be answered with code?" Tags="|discussion|policy|answers|" AnswerCount="4" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="4688" PostTypeId="2" ParentId="4687" CreationDate="2015-01-21T12:53:02.953" Score="3" Body="&lt;h2&gt;Yes, all answers should contain code.&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Without working code, there is no way to test the answer to verify that it works, to determine its score, etc.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If we allow algorithm-describing answers, then we'd also have to allow, say, answers that describe how you would write the code (without actually writing it), answers that claim they will work in a certain unreleased version of a language, etc., and we'd have no argument against those either. Essentially, it's a slippery slope.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Here's an analogy: We currently don't allow &quot;theoretical&quot; programming languages, i.e., languages for which there is no available working interpreter. It's the same problem: There's no way to actually test the algorithm.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is called &lt;em&gt;Programming&lt;/em&gt; Puzzles and &lt;em&gt;Code&lt;/em&gt; Golf, not Algorithm Puzzles and Complexity Golf. &lt;a href=&quot;http://data.stackexchange.com/codegolf/revision/266774/348377&quot; rel=&quot;nofollow&quot;&gt;There are only a few&lt;/a&gt; answers that lack code, most of which contain either images (Piet et. al.), improperly formatted code, or external links. A precedent for this has already been set.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2015-01-21T12:53:02.953" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="4689" PostTypeId="2" ParentId="4687" CreationDate="2015-01-21T13:41:20.173" Score="-2" Body="&lt;p&gt;&lt;strong&gt;No not all answers need to contain fully working code&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Even with working code you can't necessarily check that an answer is correct. It might just work on a few cases. So it's not true that having code solves the problem of checking correctness.&lt;/li&gt;&#xA;&lt;li&gt;We currently allow answers which would need to be included in a larger piece of code to be runnable. We don't require that all code is a complete piece of software that can just be cut and paste and compiled.  So it's not true that pseudo code would be the only non-runnable thing we allow.&lt;/li&gt;&#xA;&lt;li&gt;Pseudo code can be easier to verify for a non-specialist than an answer in code, especially if the code is in some minority language.&lt;/li&gt;&#xA;&lt;li&gt;Currently  when someone submits an answer in a minority language (APL for example) I rely entirely on their explanation in plain English to check if it is correct or not.  The code adds little to this in practice.&lt;/li&gt;&#xA;&lt;li&gt;I don't think we should get hung up on names (stackoverflow allows questions that don't relate to overflowing stacks). Some people regard algorithms as a constituent part of  programming in any case.  &lt;/li&gt;&#xA;&lt;li&gt;Pseudo code allows much more sophisticated answers to be expressed succinctly. For example &quot;Step 3. Insert x into a balanced binary search tree T&quot; would involve a lot of code in most languages which might obscure the answer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;My view is that &lt;strong&gt;most&lt;/strong&gt; questions should require code and that questions that don't should require clear and unambiguous pseudo code at least to accompany any plain English explanation.&lt;/p&gt;&#xA;" OwnerDisplayName="user9206" LastActivityDate="2015-01-21T13:41:20.173" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="4690" PostTypeId="2" ParentId="4687" CreationDate="2015-01-21T14:23:23.813" Score="21" Body="&lt;h1&gt;We should allow algorithm-only answers.&lt;/h1&gt;&#xA;&lt;p&gt;We currently accept code &lt;a href=&quot;https://codegolf.stackexchange.com/questions/7189/solving-three-open-problems-with-a-halting-oracle&quot;&gt;that&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/19397/smallest-chess-board-compression&quot;&gt;is&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/24304/why-isnt-it-ending/24417#24417&quot;&gt;impossible&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/30134/write-a-sorting-program-that-looks-erroneous-but-it-is-actually-correct&quot;&gt;to&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/23481/partially-solve-the-halting-problem-for-brainf&quot;&gt;verify&lt;/a&gt;.  Furthermore, we &lt;strong&gt;rarely actually run the code to verify anyways&lt;/strong&gt;.  Hence, the fact that it is impossible to test should be taken into consideration by the OP, but it should not &lt;em&gt;prevent&lt;/em&gt; the OP from asking his question.&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, algorithm design definitely falls under Programming challenges.  &lt;strong&gt;Designing an algorithm is one of the steps to programming&lt;/strong&gt;.  If I were to post a question that already has a predefined algorithm, and asks you to convert the algorithm into code (think code-golf), we wouldn't remove the question.  Why shouldn't we allow people to simply post answers that only perform the &lt;code&gt;Problem statement&lt;/code&gt; to &lt;code&gt;algorithm&lt;/code&gt; step?&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-01-21T14:59:13.400" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="4691" PostTypeId="2" ParentId="4680" CreationDate="2015-01-21T15:48:15.323" Score="-1" Body="&lt;p&gt;This answer only suggests an organization of problems and solutions. Whether those solutions link to GitHub, link to BitBucket, or simply inline the code I think is getting way off topic here.&lt;/p&gt;&#xA;&lt;h1&gt;One problem per question, one solution per answer&lt;/h1&gt;&#xA;&lt;p&gt;If a snippet is useful, then by definition, it must solve a problem. Transform that problem into a question and post it. You can now get feedback in the comments. It's like playing Jeopardy but with more effort.&lt;/p&gt;&#xA;&lt;p&gt;Let's assume that snippets are the solution to your problem (after all, you do know best). It makes sense then to allow for multiple snippets to compete for votes until one reigns supreme. If you are too busy to read them all, you can sort them by votes. That's what Stack Exchange was designed for.&lt;/p&gt;&#xA;&lt;p&gt;Now remove that assumption. Maybe someone has a better solution that doesn't involve Stack Snippets. They can post it, compete for votes, and get feedback in the comments.&lt;/p&gt;&#xA;&lt;h1&gt;Alternatives&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;First alternative&lt;/strong&gt;: The &amp;quot;Snippet Toolbox&amp;quot;, described as a huge collection of snippets. The question could only be &amp;quot;Post a snippet that solves any problem.&amp;quot; That's the definition of too broad. Also, the best solution to a specific problem has no way of rising to the top.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Second alternative&lt;/strong&gt;: Post the snippet in the question. It calls for answers to be re-purposed for bug reports and feature requests. Feature requests belong in a new question (I am not suggesting that you post &amp;quot;Give me code please.&amp;quot; A feature request is a new problem in disguise. You should describe the problem and state what you did to try and solve it. In other words, follow normal Stack Exchange standards for asking good questions). The community then has the opportunity to vote on it like any other question, including closing it as a duplicate or otherwise marking it off topic (too broad, unclear, etc.). Comments work just fine for reporting bugs. They exist for suggesting edits and requesting clarifications.&lt;/p&gt;&#xA;&lt;p&gt;Just let the best (most bug free?) solution be voted to the top. That is what Stack Exchange is designed for.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-01-21T16:13:52.423" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4694" PostTypeId="2" ParentId="4652" CreationDate="2015-01-22T08:32:28.973" Score="2" Body="&lt;h1&gt;This topic does not suit a general default answer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For some cases it is useful to define defaults so that questions do not need to include the same boiler plate rules every time. For example &quot;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;Default for Code Golf: Input/Output methods&lt;/a&gt;&quot; and &quot;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet&quot;&gt;Default for Code Golf: Program, Function or Snippet?&lt;/a&gt;&quot;. A question can override these defaults, but having the defaults means most questions can be shorter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't think this is one of those cases. There are several reasons for restricting comments and not all of them suit the same rule. This is a case where individual questions should carefully define what it is that they are excluding.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-01-22T08:32:28.973" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4695" PostTypeId="2" ParentId="2140" CreationDate="2015-01-22T20:13:52.567" Score="1" Body="&lt;h1&gt;Operator, i can't remember my phone number... &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&quot;Hello? Operator? How do i get my phone to tell me its own number?&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is to write a quine -- from your cellphone. Not a smartphone with a virtual keyboard, mind you. One of the old phones, where to get a 'c' you have to press 2 three times.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because programmers are lazy, you want to do it in the least amount of keypresses.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;A previous challenge (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/32817/calculate-cell-phone-keypresses&quot;&gt;Calculate cell-phone keypresses&lt;/a&gt;) was to calculate the amount of keypresses it takes to produce a set of characters on a cellphone keyboard.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge there wrote out all the keymappings well, so i'll just quote it here.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The keymaps are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1:1&#xA;2:abcABC2&#xA;3:defDEF3&#xA;4:ghiGHI4&#xA;5:jklJKL5&#xA;6:mnoMNO6&#xA;7:pqrsPQRS7&#xA;8:tuvTUV8&#xA;9:wxyzWXYZ9&#xA;0:&amp;lt;space&amp;gt;&amp;lt;newline&amp;gt;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;To type &lt;code&gt;exaMPle TExt 01&lt;/code&gt; , you would press &lt;code&gt;33 99 2 6666 77777 555 33&#xA;  0 8888 33333 99 8 0 &amp;lt;a 1-sec pause here in real life but we'll ignore&#xA;  it&amp;gt;000 1&lt;/code&gt; for a total of 37 keypresses.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;The &lt;code&gt;*&lt;/code&gt; key brings up a map of special characters:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.,'?!&#xA;&quot;-()@&#xA;/:_;+&#xA;&amp;amp;%*=&amp;lt;&#xA;&amp;gt;£€$¥&#xA;¤[]{}&#xA;\~^¡¿&#xA;§#|`&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;with the first one (&lt;code&gt;.&lt;/code&gt;) highlighted. You can move to highlight the&#xA;  required character using rectangular navigation keys and it takes&#xA;  another keypress to select.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;So to insert &lt;code&gt;$&lt;/code&gt;, you would press &lt;code&gt;*↓↓↓↓→→→&amp;lt;select&amp;gt;&lt;/code&gt; i.e. a total of 9&#xA;  key-presses.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This means, that if you use &lt;code&gt;a = 3&lt;/code&gt; in your code, that is a (1), space (1), = (8), space (1), 3 (7), for a total of 18, even though it's only 5 bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So as not to rule out languages/entries that use characters outside of this range, you can reach it with &lt;em&gt;#, insert, special, select, {type the Unicode number of the character}, select&lt;/em&gt; for a total of 5 + Unicode #. I suppose you could use this trick to reduce the number of keypresses via &lt;code&gt;*&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your score is the number of keypresses used to type out the code. There is a Stack Snippet that you can use to calculate. It automatically picks the lower number if you could use either &lt;code&gt;*&lt;/code&gt; or &lt;code&gt;#&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The entry with the lowest score after 2 weeks wins!&lt;/p&gt;&#xA;" OwnerUserId="32376" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.653" LastActivityDate="2015-01-25T18:57:32.093" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="4698" PostTypeId="2" ParentId="2140" CreationDate="2015-01-23T18:28:19.367" Score="1" Body="&lt;h1&gt;Hide your code in a Boggle board!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/boggle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;boggle&amp;#39;&quot; rel=&quot;tag&quot;&gt;boggle&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This proposal is intended to supersede my earlier proposal &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2499/8478&quot;&gt;Find the Needle in the Haystack&lt;/a&gt;, of which I'm not convinced any more that it would work very well. I'll keep both proposals around for now, though.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;The Cops' Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;First, choose a program output, consisting of less than 100 printable ASCII characters (character code 0x20 to 0x7E, inclusive) - in particular the program must be written on a single line.&lt;br&gt;&#xA;Next, you should write a number of programs (not necessarily in the same language), which all output that exact same string (including any trailing newlines) to STDOUT or closest alternative. Each of those programs should be made up of less than 100 printable ASCII characters, too.&lt;br&gt;&#xA;Finally, design a Boggle board, which contains all of these programs. The Boggle board may contain as many unused character as you wish, but it has to be rectangular and all characters have to be in the printable ASCII range. See &quot;Boggle Rules&quot; below for how the Boggle board works.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You want the number of programs to be large, the board to be small and the programs to be hard to find.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;None of the programs must take any input. You may print to STDOUT, a GUI dialog (as with JavaScript's &lt;code&gt;alert()&lt;/code&gt;), or assume a REPL environment (like a browser console) - but if it's different from STDOUT, you need to state clearly where your output will go in each case.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each program has to complete within 5 seconds on a reasonable machine. You are not allowed to use cryptographic methods, hashing functions, random seeds or string compression.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your submission's boggle board is &lt;strong&gt;X&lt;/strong&gt; characters wide, and &lt;strong&gt;Y&lt;/strong&gt; characters tall, and you've hidden &lt;strong&gt;N&lt;/strong&gt; programs in it, your submission's score is &lt;strong&gt;N&lt;sup&gt;3&lt;/sup&gt;/(X*Y)&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should deliver:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;X&lt;/strong&gt;, &lt;strong&gt;Y&lt;/strong&gt;, &lt;strong&gt;N&lt;/strong&gt; and your score.&lt;/li&gt;&#xA;&lt;li&gt;The languages of your &lt;strong&gt;N&lt;/strong&gt; programs, including output destination if it differs from STDOUT.&lt;/li&gt;&#xA;&lt;li&gt;The Boggle board.&lt;/li&gt;&#xA;&lt;li&gt;The output of the programs.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;An answer is cracked if &lt;strong&gt;N&lt;/strong&gt; programs in the specified languages are found by a single robber (see &lt;strong&gt;The Robbers' Challenge&lt;/strong&gt; below). If your answer has not been cracked for 7 days, you may claim immunity by revealing the programs in your answer (to prove that your answer was solvable).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner will be the &lt;em&gt;immune&lt;/em&gt; submission with the highest score.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Robbers' Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Every user has &lt;em&gt;one&lt;/em&gt; attempt at cracking each submission. Your cracking attempt will be a list of programs found in a the submission's Boggle board. If your guess matches the description (all programs can be found according to the Boggle rules, all produce the correct output to the correct destination, and they are written in the required languages), and you are the first correct guess, then you get &lt;strong&gt;N*X*Y&lt;/strong&gt; points. It is important to note that your programs do &lt;em&gt;not&lt;/em&gt; have to exactly match the originals, as long as they meet the specification and can be found in the Boggle board. This means there could be more than one correct answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The robber with the most points wins. In the case of a tie, the robber who submitted &lt;em&gt;fewer&lt;/em&gt; cracks wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Robbers should post their cracks as answers to the associated Robbers' thread.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Boggle Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;To find a program in a Boggle board, you start at an arbitrary cell and add characters to the string by repeatedly moving to one of its neighbours.&lt;/li&gt;&#xA;&lt;li&gt;You may move one cell at a time, horizontally, vertically, or diagonally.&lt;/li&gt;&#xA;&lt;li&gt;No cell must be used more than once (within a single program or by multiple programs).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Consider this Boggle board as a cop submission:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1$int&#xA;arun&quot;&#xA;!pts0&#xA;b &quot;2K&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Along with the specification that the output is &lt;code&gt;20&lt;/code&gt;, and that there are 2 CJam programs, one Python 2 program and one Ruby program. A robber could now find:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;K&lt;/code&gt; in the bottom right corner and &lt;code&gt;20&lt;/code&gt; next to it as two valid CJam program.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;print &quot;20&quot;&lt;/code&gt; as a valid Python 2 program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;__i__&#xA;_r_n&quot;&#xA;_pt_0&#xA;_ &quot;2_&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;puts&quot;20&quot;&lt;/code&gt; as a valid Ruby program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;_____&#xA;__u_&quot;&#xA;_pts0&#xA;__&quot;2_&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If no one cracked this, the cop's score would be &lt;strong&gt;4&lt;sup&gt;2&lt;/sup&gt;/(5*4) = 0.8&lt;/strong&gt;. If someone did crack this, that robber would get &lt;strong&gt;4*5*4 = 80&lt;/strong&gt; points.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Notes&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I intend to provide stack snippets which generate leaderboards for the cops and robbers.&lt;/li&gt;&#xA;&lt;li&gt;The scores probably need some balancing. Suggestions?&lt;/li&gt;&#xA;&lt;li&gt;I admit that the robbers' challenge is pretty similar to &lt;a href=&quot;https://codegolf.stackexchange.com/q/44607/8478&quot;&gt;Calvin's Hobbies' recent challenge&lt;/a&gt;. This happened purely by accident - I was originally thinking about a word search C'n'R, which would have been too easily brute-forcible, so I changed it to a Boggle board. Of course, that doesn't matter when considering if it's a duplicate of course, but I think with hand-designed boards, looking for programs with fixed outputs in prescribed languages, makes this quite different and should hopefully make for a &lt;a href=&quot;https://codegolf.stackexchange.com/a/44608/8478&quot;&gt;more balanced&lt;/a&gt; challenge. Furthermore, the cops' challenge of &lt;em&gt;designing&lt;/em&gt; the boards is completely different. Please let me know if you disagree, though.&lt;/li&gt;&#xA;&lt;li&gt;Should I allow cells to be reused within a single program?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.893" LastActivityDate="2015-01-29T18:46:45.993" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="4701" PostTypeId="2" ParentId="4687" CreationDate="2015-01-24T12:28:58.857" Score="12" Body="&lt;h1&gt;The question should specify whether code is required.&lt;/h1&gt;&#xA;&lt;p&gt;Where code is required, &lt;code&gt;fastest-code&lt;/code&gt; is the best tag to use. If the search space is too large for this, we have the &lt;code&gt;fastest-algorithm&lt;/code&gt; tag. It's up to the OP to decide which is appropriate in each case, with feedback from the community via comments.&lt;/p&gt;&#xA;&lt;p&gt;An important caveat: &lt;em&gt;All&lt;/em&gt; relevant parameters need to be considered in the big O (and frequently they aren't. In this case the OP seems correct in specifying both &lt;code&gt;m&lt;/code&gt; and &lt;code&gt;n&lt;/code&gt; should be considered (many OP's don't.) But as one comment points out, there is no need for the OP to consider &lt;code&gt;d&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;We have already discussed the issue of deletion in the following posts and the general consensus seemed to be that answers that missed the mark should be downvoted but not deleted.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/825/what-should-count-as-not-an-answer-here&quot;&gt;What should count as &amp;quot;not an answer&amp;quot; here?&lt;/a&gt; and&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1451/should-answers-that-break-the-rules-be-deleted/1456#1456&quot;&gt;Should answers that break the rules be deleted?&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Also discussed elsewhere, is what the OP's responsibilities are about verifying the answer before awarding the green checkmark. If the algorithm is unclear, the OP can always ask the answerer to clarify before awarding!&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Finally, it's worth noting that while the text of this meta post considers &lt;code&gt;fastest-code&lt;/code&gt;&#xA;tag, there can also be non-code answers on &lt;code&gt;compression&lt;/code&gt; and &lt;code&gt;komolgorov complexity&lt;/code&gt; tagged questions, and these may need a different consideration, but this is not reflected in the current title of this question.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;For example the following question has 23 upvotes, and very few answers contain any code. Any answer which contributes something should not be deleted.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/19397/smallest-chess-board-compression&quot;&gt;Smallest chess board compression&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-01-25T18:40:45.917" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="4703" PostTypeId="2" ParentId="2140" CreationDate="2015-01-24T18:36:51.160" Score="5" Body="&lt;h1&gt;Fortnightly Challenge #4 - Data Structures&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;http://chat.stackexchange.com/rooms/20517/fortnightly-challenge-of-2015-01-23-data-structures&quot;&gt;Join us in the Fortnightly Challenge Chat&lt;/a&gt; to work out the details of this challenge!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Imagine square coloured blocks where each side can be connected to another block, allowing you to move or rotate connected blocks as one. Let's call a collection of such blocks, all connected to each other either directly or indirectly, a &lt;em&gt;group&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to simulate these blocks via a number of commands which you must implement.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Commands&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;All input commands will be given one per line (via STDIN), and likewise all query outputs should one per line (via STDOUT).&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;place &amp;lt;x&amp;gt; &amp;lt;y&amp;gt; &amp;lt;colour&amp;gt;&lt;/code&gt;: Place a block with a given colour at the specified coordinates.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;remove &amp;lt;x&amp;gt; &amp;lt;y&amp;gt;&lt;/code&gt;: Remove the block at the specified coordinates, deleting any connections with it.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;connect &amp;lt;x1&amp;gt; &amp;lt;y1&amp;gt; &amp;lt;x2&amp;gt; &amp;lt;y2&amp;gt;&lt;/code&gt;: Connect two adjacent blocks.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;disconnect &amp;lt;x1&amp;gt; &amp;lt;y1&amp;gt; &amp;lt;x2&amp;gt; &amp;lt;y2&amp;gt;&lt;/code&gt;: Disconnect two adjacent blocks.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;count&lt;/code&gt;: Count the number of groups and print the result.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;move &amp;lt;x&amp;gt; &amp;lt;y&amp;gt; &amp;lt;dx&amp;gt; &amp;lt;dy&amp;gt;&lt;/code&gt;: Move the entire group containing the specified block by the given offset.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;rotate &amp;lt;x&amp;gt; &amp;lt;y&amp;gt; &amp;lt;times anticlockwise&amp;gt;&lt;/code&gt;: Rotate the entire group containing the specified block anticlockwise about said block by some number (guaranteed to be either 1, 2 or 3) of times&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;connected &amp;lt;x1&amp;gt; &amp;lt;y1&amp;gt; &amp;lt;x2&amp;gt; &amp;lt;y2&amp;gt;&lt;/code&gt;: Print &lt;code&gt;y&lt;/code&gt; if blocks exist at the two given coordinates and they are in the same group, or &lt;code&gt;n&lt;/code&gt; otherwise.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;nearest &amp;lt;x&amp;gt; &amp;lt;y&amp;gt;&lt;/code&gt;: Print the nearest block to the given coordinate by Manhattan distance (difference in x-coordinate + difference in y-coordinate), in the form &lt;code&gt;&amp;lt;x&amp;gt; &amp;lt;y&amp;gt; &amp;lt;colour&amp;gt;&lt;/code&gt;. If there are no placed blocks, print &lt;code&gt;none&lt;/code&gt;. If there is more than one closest block, print any.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;colour &amp;lt;colour&amp;gt;&lt;/code&gt;: Print all block coordinates with the given colour, each space-separated and of the form &lt;code&gt;(&amp;lt;x&amp;gt;, &amp;lt;y&amp;gt;)&lt;/code&gt;. If there are no such blocks, print &lt;code&gt;none&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;halt&lt;/code&gt;: Terminate the program&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Errors&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Commands will always be given with the correct number and type of arguments. However sometimes an operation doesn't make sense, for example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Placing a block where a block already exists&lt;/li&gt;&#xA;&lt;li&gt;Removing, connecting, disconnecting, moving or rotating non-existent blocks&lt;/li&gt;&#xA;&lt;li&gt;Connect or disconnecting blocks which are already connected or disconnected&lt;/li&gt;&#xA;&lt;li&gt;Move or rotate commands which end up with two blocks overlapping (with emphasis that only the final state matters — groups which are rotated 2 or 3 times do not need to check for overlaps after each rotation)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If any of the above occur, print &lt;code&gt;Error: &amp;lt;command&amp;gt;&lt;/code&gt;. For example, if there is no block at &lt;code&gt;0,0&lt;/code&gt;, then the command &lt;code&gt;remove 0 0&lt;/code&gt; will result in&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Error: remove 0 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that queries should never result in an error.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There will be six types of test cases:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A test which is biased towards &lt;code&gt;place/remove&lt;/code&gt; commands&lt;/li&gt;&#xA;&lt;li&gt;A test which is biased towards &lt;code&gt;connect/disconnect/count/connected&lt;/code&gt; commands&lt;/li&gt;&#xA;&lt;li&gt;A test which is biased towards &lt;code&gt;move/rotate&lt;/code&gt; commands&lt;/li&gt;&#xA;&lt;li&gt;A test which is biased towards &lt;code&gt;nearest&lt;/code&gt; commands&lt;/li&gt;&#xA;&lt;li&gt;A test which is biased towards &lt;code&gt;colour&lt;/code&gt; commands&lt;/li&gt;&#xA;&lt;li&gt;An all-rounder test&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, so the goal is to make your program process the commands as quickly as possible. A leaderboard will be kept for each type of test,, and the winner will be the user with the lowest sum of placements over all tests (e.g. if you came 1st, 3rd, 2nd, 2nd, 3rd, 4th then your score is &lt;code&gt;1 + 3 + 3 + 2 + 2 + 4 = 15&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The tests and test generator can be found on &lt;a href=&quot;https://github.com/Sp3000/Fortnightly4&quot; rel=&quot;nofollow noreferrer&quot;&gt;this Github page&lt;/a&gt;, along with a unit tester which will be run for each submission to ensure correctness.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules/clarifications&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;To prevent cluttering the leaderboard, each user may provide at most &lt;strong&gt;one&lt;/strong&gt; submission&lt;/li&gt;&#xA;&lt;li&gt;No multithreading or parallel processing&lt;/li&gt;&#xA;&lt;li&gt;Use no more than 2GB of RAM — this rule is not strictly enforced, but horribly space-inefficient solutions may be disqualified&lt;/li&gt;&#xA;&lt;li&gt;No third party libraries (standard libraries are OK)&lt;/li&gt;&#xA;&lt;li&gt;All coordinates are guaranteed to fit into a 32-bit int, and all colours are alphanumeric strings&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(in progress)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/WGdy5.gif&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="21487" LastEditorUserId="21487" LastEditDate="2015-02-08T14:58:32.897" LastActivityDate="2015-02-08T14:58:32.897" CommentCount="18" ContentLicense="CC BY-SA 3.0" />
  <row Id="4706" PostTypeId="2" ParentId="2140" CreationDate="2015-01-26T00:29:32.710" Score="4" Body="&lt;h1&gt;Responsible governance &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For years, the Federal government of the United States has been in chaos. The Presidency and Congress are under different parties, and there are no compromises in sight. Instead of passing a budget or improving the tax code, the politicians are squabbling as the country teeters on the brink of economic collapse. It seems that a few more years of political dysfunction will soon reduce the United States to rubble.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yet, some have noticed that many state governments seem to be functioning. Taxes are being reformed, education is being improved, and even compromise can be found on occasion!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The solution is clear. The federal government must be dissolved. Each state will control its own eduction, infrastructure, and healthcare, but the budgets will be pooled. As the governor of your state, you must use the country's funds to improve your constituents' lives, but also be frugal enough to let your neighbors prosper as well.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This system of government will be in place for 10 years (120 months), after which the results of this experiment will be analyzed. Each month, every governor will be given the opportunity to use the country's funds to pay for one project of their choice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The government starts with $1,000,000 in the bank, times the number of states. In every state, life expectancy is 75 years, education is at 95 IQ, and the infrastructure gets a rating of 65 points.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every year, the following happens:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;First, taxes are collected and centralized expenses are paid.&lt;/li&gt;&#xA;&lt;li&gt;For each of the next twelve months:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each governor, in order, is allowed to finance a project.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Finally, information about each states' education, healthcare, and infrastructure is updated to reflect the projects built.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The final score is the government's total funds, times average state's life expectancy, times the average state's IQ, times the average state's infrastructure rating. (These averages are not weighted by population.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This entire experiment will be performed many times. Each time, a different governor will be excluded. The winner will be the governor such that the final score is the &lt;em&gt;worst&lt;/em&gt; when they are excluded, since they must have had the biggest impact on the government's success.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Details&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;N&lt;/em&gt; is the number of governors (not counting the excluded one)&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;L&lt;/em&gt; is the life expectancy of a particular state.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;L&lt;/em&gt;&lt;sub&gt;a&lt;/sub&gt; is the average life expectancy.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;E&lt;/em&gt; is the IQ of a particular state.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;E&lt;/em&gt;&lt;sub&gt;a&lt;/sub&gt; is the average IQ.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;T&lt;/em&gt; is the infrastructure rating of a particular state.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;T&lt;/em&gt;&lt;sub&gt;a&lt;/sub&gt; is the average infrastructure rating.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Revenues and expenses&lt;/h3&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Annual revenue: $ &lt;em&gt;N&lt;/em&gt; &lt;em&gt;E&lt;/em&gt;&lt;sub&gt;a&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; &lt;em&gt;T&lt;/em&gt;&lt;sub&gt;a&lt;/sub&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Annual expenses: $10,000,000,000,000 &lt;em&gt;N&lt;/em&gt; / &lt;em&gt;L&lt;/em&gt;&lt;sub&gt;a&lt;/sub&gt;&lt;sup&gt;3&lt;/sup&gt; / &lt;em&gt;T&lt;/em&gt;&lt;sub&gt;a&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Projects&lt;/h3&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each of the three factors (health, education, and infrastructure) is calculated on a state-by-state basis. &lt;em&gt;L&lt;/em&gt; starts at 75, &lt;em&gt;E&lt;/em&gt; starts at 95, and &lt;em&gt;T&lt;/em&gt; starts at 65. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;For each factor, the bonuses are cumulative.&lt;/li&gt;&#xA;&lt;li&gt;For example, the bonuses &lt;code&gt;L +2&lt;/code&gt;, &lt;code&gt;L +5&lt;/code&gt; mean that &lt;em&gt;L&lt;/em&gt; = ( 75 + 2 + 5 ) = 82.&lt;/li&gt;&#xA;&lt;li&gt;Each project can be done only once by each state.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each project has an associated six-letter code (for I/O).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;List of projects&lt;/h3&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;[ENOUGH] Enough medicine: &lt;em&gt;L&lt;/em&gt; +5, cost: $300,000&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;[CANSCR] Early cancer screenings: &lt;em&gt;L&lt;/em&gt; + 4, cost $200,000&lt;/li&gt;&#xA;&lt;li&gt;[FREECC] Free community college: &lt;em&gt;E&lt;/em&gt; +10, cost: $400,000&lt;/li&gt;&#xA;&lt;li&gt;[LIBRAR] Library system: &lt;em&gt;E&lt;/em&gt; + 3, cost: $150,000&lt;/li&gt;&#xA;&lt;li&gt;[MUSEUM] Museums &lt;em&gt;E&lt;/em&gt; + 1 &lt;em&gt;in each state&lt;/em&gt;, cost: $500,000&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;many more in the actual challenge...&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Your program&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write a function in Java, Python 2, or Ruby, which accepts an integer (the government's funds) and returns an optional six-letter code, corresponding to the project chosen. If nothing is returned, or the returned value is invalid, or the chosen project was already built by you, or costs more than the government's funds, no project will be built for this month.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may not use any I/O, except for one file called &quot;&lt;code&gt;&amp;lt;program-name&amp;gt;.txt&lt;/code&gt;, which you may use however you wish, provided it's kept under 2 megabytes at all times.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Some questions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Are the rules completely clear?&lt;/li&gt;&#xA;&lt;li&gt;Are there any perverse incentives? The goal should be to improve one's own state while being frugal with the government's funds.&lt;/li&gt;&#xA;&lt;li&gt;In the first section too political?&lt;/li&gt;&#xA;&lt;li&gt;Is the challenge too complicated?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="16294" LastEditorUserId="16294" LastEditDate="2015-01-27T03:32:30.127" LastActivityDate="2015-01-27T03:32:30.127" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4707" PostTypeId="2" ParentId="3578" CreationDate="2015-01-26T11:41:32.500" Score="14" Body="&lt;h1&gt;Program a golf-programmer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; question to write a program which produces the shortest program in a simple language. The winner may be decided by the total length of the output of the program against some existing tasks. There might be some upper limit on the length of the program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We only consider output-only tasks (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; plus some printing challenges with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;), since it is too complex to consider problems which takes input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input to the program is the expected output of the tasks, and the set of allowed character in the task.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some candidates for the target language: Brainfuck, Insomnia, oOo CODE, ...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Brainfuck seems to have been used here &lt;a href=&quot;https://codegolf.stackexchange.com/questions/5418/brainfuck-golfer&quot;&gt;Brainf*** Golfer&lt;/a&gt;, though I don't know if it would be more interesting when we limit the set of programs to those which only outputs.&lt;/li&gt;&#xA;&lt;li&gt;Insomnia, from my own experience, is quite fun, since it resets the bit pointer when you move the group pointer.&lt;/li&gt;&#xA;&lt;li&gt;(Don't know about other languages... Suggestions?)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Some candidates for the goals of the challenges:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/41711/say-hello-to-the-pioneers-of-computer-science&quot;&gt;Say Hello to the Pioneers of Computer Science&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/31552/disarm-the-b-o-m-b&quot;&gt;DISARM THE B.O.M.B.!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;[...]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;(I have implemented a program which performs searches to write program in Insomnia, so I think it might be interesting to make this a challenge).&lt;/p&gt;&#xA;" OwnerUserId="6638" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2015-01-26T11:58:27.527" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4708" PostTypeId="1" AcceptedAnswerId="4719" CreationDate="2015-01-26T11:49:30.313" Score="17" ViewCount="1474" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/44964/8478&quot;&gt;This answer&lt;/a&gt; just prompted a question, which I've wondered about a few times when answering challenges in esoteric languages:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For some esoteric languages, the only means of input/output is reading and writing individual bytes from STDIN to STDOUT, and interesting golfing of numeric challenges is near impossible with decimal input, since 80% of your code will be implementing &lt;code&gt;atoi()&lt;/code&gt; and &lt;code&gt;itoa()&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a challenge specifies that a program should take a number as input, can that number be taken as the value of a byte read from STDIN? The same question applies to output (although answers may of course address these two parts individually and with differing opinions).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the purpose of this question, please assume that the limitations on the range of inputs/outputs is not an issue for the challenge in question.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2015-01-27T18:48:48.217" Title="Can numeric input/output be in the form of byte values?" Tags="|discussion|code-golf|policy|answers|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="4709" PostTypeId="1" AcceptedAnswerId="4717" CreationDate="2015-01-26T11:56:45.273" Score="9" ViewCount="225" Body="&lt;p&gt;By my count, we've had at least 5 &quot;answer-dependent&quot; challenges now, starting with &lt;a href=&quot;https://codegolf.stackexchange.com/q/40376/8478&quot;&gt;Evolution of &quot;Hello, World!&quot;&lt;/a&gt;. I think it's time we started tagging these, so we can put some general information in the tag wiki, and it's immediately apparent that a challenge is of this type.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, here's another Good Ol' Meta Poll™.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When voting, keep in mind, that in general, answers won't necessarily just depend on the answer, but potentially on some or all or the existing answers (we didn't really have that yet, but we might not want to preclude the tag from including those).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please cast your vote under the premise that answer-dependent challenges &lt;em&gt;are&lt;/em&gt; on-topic for PPCG. If you disagree, the place to discuss that is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2415/8478&quot;&gt;this question&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2015-02-01T16:39:00.133" Title="What tag should we use for answer-dependent challenges?" Tags="|discussion|tags|" AnswerCount="14" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4710" PostTypeId="2" ParentId="4709" CreationDate="2015-01-26T11:57:06.267" Score="-7" Body="&lt;p&gt;There is no need for such a tag.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-01-26T11:57:06.267" CommentCount="1" CommunityOwnedDate="2015-01-26T11:57:06.267" ContentLicense="CC BY-SA 3.0" />
  <row Id="4711" PostTypeId="2" ParentId="4709" CreationDate="2015-01-26T11:58:15.497" Score="1" Body="&lt;p&gt;We should create the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-dependent&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-dependent&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-dependent&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-01-26T11:58:15.497" CommentCount="1" CommunityOwnedDate="2015-01-26T11:58:15.497" ContentLicense="CC BY-SA 3.0" />
  <row Id="4712" PostTypeId="2" ParentId="4709" CreationDate="2015-01-26T11:59:42.753" Score="-3" Body="&lt;p&gt;We should create the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/incremental-answers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;incremental-answers&amp;#39;&quot; rel=&quot;tag&quot;&gt;incremental-answers&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-01-26T11:59:42.753" CommentCount="2" CommunityOwnedDate="2015-01-26T11:59:42.753" ContentLicense="CC BY-SA 3.0" />
  <row Id="4713" PostTypeId="2" ParentId="4709" CreationDate="2015-01-26T12:00:59.567" Score="-9" Body="&lt;p&gt;We should create the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chinese-whispers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chinese-whispers&amp;#39;&quot; rel=&quot;tag&quot;&gt;chinese-whispers&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-01-26T12:00:59.567" CommentCount="0" CommunityOwnedDate="2015-01-26T12:00:59.567" ContentLicense="CC BY-SA 3.0" />
  <row Id="4714" PostTypeId="2" ParentId="4709" CreationDate="2015-01-26T12:02:03.243" Score="2" Body="&lt;p&gt;We should create the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ordered-answers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ordered-answers&amp;#39;&quot; rel=&quot;tag&quot;&gt;ordered-answers&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-01-26T12:02:03.243" CommentCount="2" CommunityOwnedDate="2015-01-26T12:02:03.243" ContentLicense="CC BY-SA 3.0" />
  <row Id="4715" PostTypeId="2" ParentId="4709" CreationDate="2015-01-26T12:03:22.070" Score="-1" Body="&lt;p&gt;We should create the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/domino-coding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;domino-coding&amp;#39;&quot; rel=&quot;tag&quot;&gt;domino-coding&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="21487" LastActivityDate="2015-01-26T12:03:22.070" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4716" PostTypeId="2" ParentId="4709" CreationDate="2015-01-26T12:06:19.003" Score="-7" Body="&lt;p&gt;We should create the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/conga-line&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;conga-line&amp;#39;&quot; rel=&quot;tag&quot;&gt;conga-line&lt;/a&gt;  :)&lt;/p&gt;&#xA;" OwnerUserId="30688" LastActivityDate="2015-01-26T12:06:19.003" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4717" PostTypeId="2" ParentId="4709" CreationDate="2015-01-26T12:09:08.540" Score="12" Body="&lt;p&gt;We should create the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="30688" LastActivityDate="2015-01-26T12:09:08.540" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="4718" PostTypeId="2" ParentId="4709" CreationDate="2015-01-26T12:18:53.893" Score="0" Body="&lt;p&gt;We should create the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-progression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-progression&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-progression&lt;/a&gt; (or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-progressions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-progressions&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-progressions&lt;/a&gt;).&lt;/p&gt;&#xA;" OwnerUserId="26997" LastActivityDate="2015-01-26T12:18:53.893" CommentCount="2" CommunityOwnedDate="2015-01-26T12:18:53.893" ContentLicense="CC BY-SA 3.0" />
  <row Id="4719" PostTypeId="2" ParentId="4708" CreationDate="2015-01-26T13:16:46.870" Score="25" Body="&lt;h1&gt;Yes, numerical input and output may be given as a character code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As long as this doesn't give an unfair advantage (e.g. for a challenge that is &quot;given a character code, output the character&quot;), I don't see any problem with this. It's similar to allowing each language to use its native string representation of arrays when talking about list-based questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The languages in question are probably not going to win normally anyway, and I don't like to discourage answers in interesting esoteric languages, just because the author couldn't be bothered to include the &lt;code&gt;atoi&lt;/code&gt; implementation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;PS: Also, technically, taking numbers as just the value of a byte or byte stream is in some ways &lt;em&gt;more&lt;/em&gt; natural than reading its decimal representation encoded in ASCII characters. ;)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2015-01-27T18:48:48.217" LastActivityDate="2015-01-27T18:48:48.217" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4720" PostTypeId="2" ParentId="4680" CreationDate="2015-01-26T14:51:58.753" Score="-1" Body="&lt;h1&gt;Stack Snippets don't belong in Meta&lt;/h1&gt;&#xA;&lt;p&gt;Meta is not a repository, it is a place &amp;quot;&lt;a href=&quot;https://stackoverflow.com/help/whats-meta&quot;&gt;where users discuss the workings and policies of Stack Overflow rather than discussing programming itself&lt;/a&gt;&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;While Stack&#xA;Snippets contribute to the workings of our site, they aren't discussions.  If the purpose of the post was to discuss a certain stack snippet, then it is acceptable, but simply posting a Stack Snippet isn't what meta is for.&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, we aren't really struggling from duplication of snippets.  We simply aren't reinventing the wheel each time, so &lt;strong&gt;why are we trying to solve a problem we don't have?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, collecting the snippets doesn't make them any easier to find.  A person who would even consider using a particular stack snippet is the one who has seen that stack snippet before, and therefore the person knows where to find that stack snippet.  &lt;strong&gt;A snippet in action is better advertisement than a snippet found in a long list of others&lt;/strong&gt;.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-01-26T15:00:35.217" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4721" PostTypeId="2" ParentId="4708" CreationDate="2015-01-26T17:09:18.630" Score="-2" Body="&lt;h1&gt;No, numerical input and output as a character code should not be valid by default&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(I say &quot;by default&quot; because, like any good rule, it can be broken. If the question asker specifies then it should override whatever this thread decides.)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Part of the challenge of using languages like brainfuck is that even incredibly simple things become massive undertakings. What would be &quot;read an int&quot; becomes &quot;read all characters of input, subtract 48 from each cell, multiply the leftmost cell by 10 and move it on top of the cell to the right until there's only one character remaining&quot;. That's what brainfuck is all about.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But more importantly than my ideology about bf, I don't like the idea of giving some languages an advantage because they're hard. Sure, this isn't &lt;em&gt;technically&lt;/em&gt; giving an explicit advantage for any one language since anyone &lt;em&gt;could&lt;/em&gt; choose to do i/o this way, but it's even mentioned in the question that this would be helpful for certain esoteric languages. There are no other languages (that I'm aware of, at least) where the community has decided &quot;this feature is hard to use so let's change the way questions work to make it easier&quot;. The difficult feature is a part of the language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We don't give Java a bonus because there's a lot of boilerplate, we don't give golfscript a penalty because it's short (though, people have proposed these, and I wasn't a fan then either). I don't feel we should make a rule change like this for the purpose of throwing a specific set of languages a bone.&lt;/p&gt;&#xA;" OwnerUserId="14509" LastActivityDate="2015-01-26T17:09:18.630" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4724" PostTypeId="2" ParentId="2140" CreationDate="2015-01-27T06:42:30.093" Score="1" Body="&lt;h1&gt;Logic Dots &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle-solver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle-solver&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle-solver&lt;/a&gt; - Posted&lt;/h1&gt;&#xA;" OwnerUserId="15822" LastEditorUserId="15822" LastEditDate="2015-01-29T15:46:26.307" LastActivityDate="2015-01-29T15:46:26.307" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="4725" PostTypeId="2" ParentId="2562" CreationDate="2015-01-27T22:13:42.553" Score="-15" Body="&lt;p&gt;First off, your questions use the existing formatting tools expertly; they all seem to clearly describe the problem at hand. I can certainly picture how LaTeX would allow more mathematical explanations and nicer-looking matrices. However, I think MathJax is overkill for this site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For one thing, it wouldn't be used much in answers.* Afterall, code golf answers are typically written in code, not mathematical notation. Contrast that to Puzzling where good answers might need to bring math into play even when the question shows no obvious indication it might be required.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While mathematics is the &lt;em&gt;lingua franca&lt;/em&gt; of algorithms, among programmers &lt;a href=&quot;http://en.wikipedia.org/wiki/Pseudocode&quot; rel=&quot;nofollow noreferrer&quot;&gt;pseudocode&lt;/a&gt; tends to be more commonly used. So it feels like MathJax is a poor fit for this topic. Are there algorithms that are difficult or impossible to express in pseudocode?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;* I did see &lt;a href=&quot;https://codegolf.stackexchange.com/a/9088/8534&quot;&gt;this fine answer&lt;/a&gt; as the exception that proves the rule.&lt;/p&gt;&#xA;" OwnerUserId="8534" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2015-01-27T22:13:42.553" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="4726" PostTypeId="1" CreationDate="2015-01-28T04:28:09.203" Score="5" ViewCount="1815" Body="&lt;p&gt;In &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1503/16294&quot;&gt;this meta post&lt;/a&gt;, it's decided that function literals are valid when a function is required.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What about lambda expressions in Java 8? These are similar to function literals in other languages, but aren't really the same thing. Actually, these can be used in place of an instance of a functional interface.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, to remove the first character of a string:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;String f(String s){return s.substring(1);}        // standard method syntax&#xA;&#xA;Function&amp;lt;String,String&amp;gt; f = s -&amp;gt; s.substring(1);  // lambda expression to define function&#xA;&#xA;Object o = (Function&amp;lt;String,String&amp;gt;) s -&amp;gt; s.substring(1);  // works&#xA;&#xA;Object o = s -&amp;gt; s.substring(1)      // compile-time error: Object not a functional interface&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Since almost &lt;em&gt;any&lt;/em&gt; normal expression can be assigned to an &lt;code&gt;Object&lt;/code&gt;, this seems to show that &lt;code&gt;s-&amp;gt;s.substring(1)&lt;/code&gt; isn't really an instance of a function, but rather syntax that resolves to a function.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;interface I {&#xA;  public static void main(String[] args) {&#xA;      System.out.println(&quot;Hello&quot;);&#xA;  }&#xA;  String foo(String s);&#xA;}&#xA;class C {&#xA;  I i = s -&amp;gt; s.substring(1);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In this code, the interface &lt;code&gt;I&lt;/code&gt; is actually a runnable program. So when &lt;code&gt;s-&amp;gt;s.substring(1)&lt;/code&gt; is assigned to a variable of type &lt;code&gt;I&lt;/code&gt;, it's not clear if this is a function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anyway, I'm not really sure about whether these expressions should count as functions. What do you think?&lt;/p&gt;&#xA;" OwnerUserId="16294" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-06-30T11:49:19.140" Title="Java function literals" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4727" PostTypeId="2" ParentId="4726" CreationDate="2015-01-28T04:34:12.120" Score="15" Body="&lt;p&gt;&lt;em&gt;Speaking as an (opinionated) user, not as a moderator.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lambda expressions are definitely equivalent to functions; the resulting objects take zero or more inputs, and generate zero or more outputs. Just because they have no inherent type (and needs to be cast to a functional interface type to be reified) doesn't change that.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2015-01-28T04:34:12.120" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4728" PostTypeId="2" ParentId="2140" CreationDate="2015-01-28T10:45:11.810" Score="1" Body="&lt;h1&gt;Find longest alphabet path (code-golf)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You are given a 2d array of size nxn that is filled with lowercasel letters &lt;code&gt;a-z&lt;/code&gt;. Your goal is to find the longest continous path by only moving up/down/left/right.&#xA;A path is a sequence of cells of the 2d grid, where the successor of the current cell must be a neighbour that is above, below, left or right. Also, each cell of the array can only be visited once per sequence. The value (the lowercase letter) of the successor must right before or after the one in the current cell (if the current cell has the value &lt;code&gt;c&lt;/code&gt;, the successor must have value &lt;code&gt;b&lt;/code&gt; or &lt;code&gt;d&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You have to solve two tasks:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The challenge stated above&lt;/li&gt;&#xA;&lt;li&gt;The challenge stated above plus another restriction: successors can only have the next letter in the alphabet, but not the previosu (if the current cell has the value &lt;code&gt;c&lt;/code&gt; the successor must have the value &lt;code&gt;d&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The output must consist of two n x n grids the same size as the input, each for one of the two tasks. The grids have to be the identical again, but all the unused cells that are not part of the longest sequence have to be set to a whitespace. If there are two or more longest sequences, only one arbitrary one of them has to be in the output.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Testcases (more to be added)&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:  Out1:  Out2:     &#xA;ababa   ababa  ab         &#xA;babab   babab        &#xA;ababa   ababa        &#xA;babab   babab        &#xA;ababa   ababa&#xA;&#xA;Input:  Out:  Out:&#xA;aba     aba   ab&#xA;aba&#xA;aba&#xA;&#xA;abcd  abcd  abcd&#xA;hgfe  hgfe  hgfe&#xA;gfeb  gfeb  &#xA;babc  babc&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2015-01-28T11:14:24.893" LastActivityDate="2015-01-28T11:14:24.893" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="4730" PostTypeId="2" ParentId="3578" CreationDate="2015-01-29T01:50:34.727" Score="8" Body="&lt;h1&gt;Hypercomplex Numbers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Hypercomplex_number&quot; rel=&quot;nofollow&quot;&gt;Hypercomplex numbers&lt;/a&gt; are generalizations of the real number system into higher dimensions.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The simplest example is the complex number plane with &lt;code&gt;i^2 = -1&lt;/code&gt;.  There are, however, many other versions of hypercomplex numbers.   There are the quaternions with &lt;code&gt;i^2 = j^2 = k^2 = -1&lt;/code&gt;.  More interestingly, there are the two-dimensional split-complex numbers with &lt;code&gt;j^2 = +1&lt;/code&gt;, or the dual numbers with &lt;code&gt;ε^2 = 0&lt;/code&gt;.  One system has &lt;code&gt;-i^2 = j^2 = k^2 = +1&lt;/code&gt;. Each of these number systems have different algebraic properties, determined by their respective multiplication tables.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ideas:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Given the relevant multiplication table, evaluate an expression with hypercomplex numbers.  Potential operations include addition/subtraction, multiplication, &lt;a href=&quot;http://en.wikipedia.org/wiki/Complex_conjugate&quot; rel=&quot;nofollow&quot;&gt;conjunction&lt;/a&gt;, (maybe division, which may not be clearly defined).&lt;/li&gt;&#xA;&lt;li&gt;Given a list of mathematical properties, determine whether or not a hypercomplex number system with those properties exists (or list out the possibilities).&lt;/li&gt;&#xA;&lt;li&gt;Given a multiplication table, determine what algebraic properties the system has.  (Commutative, associative, alternative).  Maybe determine whether or not is is a &lt;a href=&quot;http://en.wikipedia.org/wiki/Composition_algebra&quot; rel=&quot;nofollow&quot;&gt;composition algebra&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;We might want to &lt;em&gt;strictly&lt;/em&gt; define the requirements to be a hypercomplex number system.  E.G. they have addition and multiplication, where the addition is commutative/associative and multiplication distributes over addition.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2015-01-29T01:50:34.727" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4732" PostTypeId="2" ParentId="2140" CreationDate="2015-01-29T11:30:48.250" Score="2" Body="&lt;h1&gt;Count inversions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a list/array/vector of &lt;code&gt;0&lt;/code&gt;'s and &lt;code&gt;1&lt;/code&gt;'s, count the number of &lt;em&gt;inversions&lt;/em&gt;, which are instances of a &lt;code&gt;0&lt;/code&gt; coming later than a &lt;code&gt;1&lt;/code&gt;. In other words, an inversion is a pair of indices &lt;code&gt;(i,j)&lt;/code&gt; with &lt;code&gt;i&amp;lt;j&lt;/code&gt; that correspond to list elements &lt;code&gt;L[i]==0&lt;/code&gt; and &lt;code&gt;L[j]==1&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This equals the minimum number of times on needs to swap adjacent elements to sort the list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test cases:&lt;/strong&gt; TODO&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Questions for Sandbox:&lt;/strong&gt; Has this really not been asked before? I searched and didn't find it. Also, is this challenge too easy? It could be made a bit harder by having list elements be general integers, or requiring generating lists with a given inversion count instead.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2015-01-29T11:47:31.147" LastActivityDate="2015-01-29T11:47:31.147" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4735" PostTypeId="2" ParentId="2140" CreationDate="2015-01-30T00:12:24.400" Score="0" Body="&lt;h1&gt;Solve a LaserTank level (optimally?) [WIP]&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://perso.cgocable.ca/lasertank/ltank_en.html&quot; rel=&quot;nofollow&quot;&gt;LazerTank&lt;/a&gt; is more than just a computer game, it is a blast from the past.  In this game, the player controls a tank that shoots lasers and navigates through a series of puzzles.  The goal of this challenge is to write a program that solve game levels.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TODO: Actually explain how LaserTank works.  There is an instructions page on the website.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input will be an ASCII representation of the game map.  TODO: determine which characters stand for what stuff.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output will be the list of actions required.  There are four possible actions for each step in the solution, &quot;move forward,&quot; &quot;turn left,&quot; &quot;turn right,&quot; and &quot;shoot&quot;.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2015-01-30T00:12:24.400" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4736" PostTypeId="2" ParentId="1470" CreationDate="2015-01-30T16:58:59.340" Score="12" Body="&lt;p&gt;Hm, the existing answers kind of focus on allowing non-list tips questions or allowing tips-question at all, with some peripheral notes about community wiki. Furthermore, the general question of what sort of non-challenge questions we want has been determined &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1723/8478&quot;&gt;in detail&lt;/a&gt; in the meantime. So that's sort of off the table.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since the question about community wikis was your first point, I thought I'd make an answer for this, so people can vote on it to show their opinion specifically about this.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Tips questions should &lt;em&gt;not&lt;/em&gt; be community wikis&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Essentially, because of the arguments given in the question itself: answers to tips questions aren't usually maintained collaboratively. Since a good tips answer will only contain a single tip and not a list (to allow more useful tips to bubble up through votes), it's also quite unlikely that we'll see massive collaborative editing of these in the future. The people who come up with these and write them up deserve the rep for that. In fact, now that we &lt;em&gt;do&lt;/em&gt; allow single-purpose tips questions (&quot;How can I shorten this snippet in language X?&quot;), nobody has any objections to people answering those getting rep.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rainbolt's suggestion of making the questions CW but the answers not seems very reasonable from a rep perspective (people will upvote the question because they found the list useful, but there's really no effort on the side of the question asker, since they all use the same boilerplate). However, I think this is simply impractical, because answers to CW questions are automatically CW, so a mod would have to monitor them and &lt;em&gt;un-CW&lt;/em&gt; every new answer manually. Giving the question asker a little extra rep seems like the much better alternative, and it doesn't exactly do any harm. As Doorknob said in a comment, if you don't want them to get rep for it, don't upvote the question.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2015-01-30T16:58:59.340" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4737" PostTypeId="2" ParentId="2140" CreationDate="2015-01-30T17:17:33.363" Score="0" Body="&lt;p&gt;&lt;strong&gt;Counting k-mers&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The task is to count the number of distinct substrings of length k, for k = 1,2,3,4,.....&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;score&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your score is the highest k you can get to on my computer in under 1 minute.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should use &lt;a href=&quot;http://hgdownload.cse.ucsc.edu/goldenPath/hg38/chromosomes/chr2.fa.gz&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://hgdownload.cse.ucsc.edu/goldenPath/hg38/chromosomes/chr2.fa.gz&lt;/a&gt; as your input and ignore new lines.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should ignore all newlines.  You can preprocess the input to decompress it before starting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following code outputs a histogram of all the 4-mers. You can then count how many there are with &lt;code&gt;wc&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;awk -v substr_length=4 '(len=length($0))&amp;gt;=substr_length{for (i=1; (i-substr_length)&amp;lt;len; i++) substrs[substr($0,i,substr_length)]++}; END{for (i in substrs) print substrs[i], i}' file.txt&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(This question is not finished yet.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user9206" LastActivityDate="2015-01-30T17:17:33.363" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="4744" PostTypeId="2" ParentId="4709" CreationDate="2015-02-01T16:29:05.963" Score="4" Body="&lt;p&gt;We should create the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/progressive-answers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;progressive-answers&amp;#39;&quot; rel=&quot;tag&quot;&gt;progressive-answers&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2015-02-01T16:29:05.963" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4745" PostTypeId="2" ParentId="4709" CreationDate="2015-02-01T16:30:48.470" Score="-3" Body="&lt;p&gt;We should create tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/evolving-answers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;evolving-answers&amp;#39;&quot; rel=&quot;tag&quot;&gt;evolving-answers&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This signifies that the subsequent answers evolve based on the previous ones.&lt;/p&gt;&#xA;" OwnerUserId="31414" LastActivityDate="2015-02-01T16:30:48.470" CommentCount="1" CommunityOwnedDate="2015-02-01T16:30:48.470" ContentLicense="CC BY-SA 3.0" />
  <row Id="4746" PostTypeId="2" ParentId="4709" CreationDate="2015-02-01T16:31:10.303" Score="-5" Body="&lt;p&gt;We should create the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-answering&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-answering&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-answering&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2015-02-01T16:31:10.303" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4747" PostTypeId="2" ParentId="4709" CreationDate="2015-02-01T16:31:57.350" Score="-3" Body="&lt;p&gt;We should create tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-evolution&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-evolution&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-evolution&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This signifies that the subsequent answers evolve based on the previous ones.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Same meaning as previous one, just that a different term)&lt;/p&gt;&#xA;" OwnerUserId="31414" LastActivityDate="2015-02-01T16:31:57.350" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4749" PostTypeId="2" ParentId="4709" CreationDate="2015-02-01T16:39:00.133" Score="0" Body="&lt;p&gt;We should add the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chronological-answers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chronological-answers&amp;#39;&quot; rel=&quot;tag&quot;&gt;chronological-answers&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2015-02-01T16:39:00.133" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4750" PostTypeId="2" ParentId="2140" CreationDate="2015-02-01T18:08:35.450" Score="14" Body="&lt;h1&gt;Random Golf of the Day&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Meta:&lt;/strong&gt; &lt;em&gt;I am running this as a little series of challenges revolving around the topic of randomness - in the form of a 9-hole golf course. I'm maintaining a leaderboard across all challenges in the series, and offer a large bounty to the person competing in all of them with the lowest overall score.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Just to be clear, despite the name, I won't be posting these once a day. Expect the next one in 6 to 8 weeks.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;About the Series&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This will be a series of 9 challenges. See &lt;a href=&quot;https://codegolf.stackexchange.com/q/45302/8478&quot;&gt;the first instalment&lt;/a&gt; for more information about the series.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;#1: &lt;a href=&quot;https://codegolf.stackexchange.com/q/45302/8478&quot;&gt;Shuffle an Array&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;#2: &lt;a href=&quot;https://codegolf.stackexchange.com/q/45447/8478&quot;&gt;Numbers from a Normal Distribution&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;#3: &lt;a href=&quot;https://codegolf.stackexchange.com/q/46991/8478&quot;&gt;Integer Partitions&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer-partitions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer-partitions&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer-partitions&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;#4: &lt;a href=&quot;https://codegolf.stackexchange.com/q/49394/8478&quot;&gt;The Bertrand Paradox&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;#5: &lt;a href=&quot;https://codegolf.stackexchange.com/q/51222/8478&quot;&gt;Diamond Tilings&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tiling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tiling&amp;#39;&quot; rel=&quot;tag&quot;&gt;tiling&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;#6: &lt;a href=&quot;https://codegolf.stackexchange.com/q/51222/8478&quot;&gt;Roll a d20&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/abstract-algebra&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;abstract-algebra&amp;#39;&quot; rel=&quot;tag&quot;&gt;abstract-algebra&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;#7: &lt;a href=&quot;https://codegolf.stackexchange.com/q/89621/8478&quot;&gt;A distinctly random character&lt;/a&gt; (guest entry by trichoplax)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;#8: &lt;a href=&quot;https://codegolf.stackexchange.com/q/120472/8478&quot;&gt;Shuffle an infinite list&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Further ideas (still unordered):&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Poisson disc sampling:&lt;/strong&gt; This is a method to randomly distribute points across the plane densely while maintaining a minimum distance between points. I think this might be nice to golf. &lt;a href=&quot;http://devmag.org.za/2009/05/03/poisson-disk-sampling/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Further reading.&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Generate a random chessboard:&lt;/strong&gt; The submissions should randomly produce a believable chessboard. &quot;Believable&quot; here mostly affects pawns: they may not appear on the first row of their colour, there may be more pieces of other types if pawns are missing (due to conversion), and two pawns may only be in the same column if at least one of the opponent's pieces is missing. Submissions should be able to generate any valid board with finite probability, but it doesn't have to be uniform.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Generate a random arithmetic expression:&lt;/strong&gt; This basically asks to create a tree of binary and unary operators, subject to some constraint - either on the structure of the tree (&lt;code&gt;n&lt;/code&gt; nodes, say) or on the result of the arithmetic expression (generate a random expression that evaluates to a given &lt;code&gt;n&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Generate a random hole-free polyomino&lt;/strong&gt; (or orthogonal polygon) (of given size).&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Vague idea:&lt;/em&gt; Generate points on a sphere with uniform distribution.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Vague idea:&lt;/em&gt; I'd like to include a challenge on random walks.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Vague idea:&lt;/em&gt; I'd like to include a challenge which has to generate a random number with a constraint based on its digits, but where you're not allowed to use strings or arrays (so you have to access the digits arithmetically).&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Idea I'm not sure about:&lt;/em&gt; Generate a valid Unicode character as a set of UTF-8 bytes with uniform randomness.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Idea:&lt;/em&gt; Implement a (specific) PRNG.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Idea:&lt;/em&gt; Generate a random Brainfuck program (or other balanced string). Would probably need to require uniform distribution and deterministic runtime to be interesting.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2017-05-13T19:41:51.417" LastActivityDate="2017-05-13T19:41:51.417" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="4752" PostTypeId="2" ParentId="2140" CreationDate="2015-02-01T23:58:25.610" Score="0" Body="&lt;h1&gt;Elevator Control [WIP]&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The controller is still a WIP, but I have a decent idea of how it'll work.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You have been hired as a Vertical Integration Specialist (programmer) at Ascension Incorporated to write advanced elevator controller software. (backstory wip)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Elevators are Cool&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The current setup is that there will be ten floors and three elevators.  This is 100% subject to change. I'm not exactly sure how the game will be judged, below is an idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As people begin queue up, your elevators will be responsible for making sure that they get where they want to go.  Each game tick, there is a certain % chance that a person will queue up at a given floor with a random destination. You goal is to transport 1000 people in the least time possible.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Details&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your submission will be the the form of a Java class.  This class must contain at least two methods: the constructor &lt;code&gt;mySubmission(Elevator[] elevators, Floor[] floors)&lt;/code&gt; and &lt;code&gt;update(Elevator[] elevators, Floor[] floors)&lt;/code&gt;.  The constructor class will be called once, and update after every game tick.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Elevator Class:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;int location&lt;/code&gt; gives the current floor location of the elevator.  (Read-only)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;int dest&lt;/code&gt; gives the destination of the elevator.  All elevators have a destination, even an idle elevator, in which case the destination is the current floor. (readOnly)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;String status&lt;/code&gt; is &lt;code&gt;idle&lt;/code&gt; or &lt;code&gt;busy&lt;/code&gt;.  Elevators which are &lt;code&gt;idle&lt;/code&gt; are not moving and have no floors in queue. (read-only)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;boolean[] buttons&lt;/code&gt; tells which buttons have been pushed, signifying that a person in the elevator wants to go to that floor.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ArrayList&amp;lt;Integer&amp;gt; destQueue&lt;/code&gt; gives the list of destinations for this elevator.  An &lt;code&gt;idle&lt;/code&gt; elevator with something in &lt;code&gt;destQueue&lt;/code&gt; will become &lt;code&gt;busy&lt;/code&gt; and have a new destination. (writable)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;goToFloor(int i)&lt;/code&gt; adds that floor to the queue if it is not already in it.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;clearQueue()&lt;/code&gt; clears the queue.  Simple as that.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Floor Class&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;boolean waiting&lt;/code&gt; means that somebody is at that floor.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;boolean up&lt;/code&gt; means that somebody on that floor wants to go up.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;boolean down&lt;/code&gt; means that somebody on that floor wants to do down.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2015-02-02T00:14:42.043" LastActivityDate="2015-02-02T00:14:42.043" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4754" PostTypeId="2" ParentId="2140" CreationDate="2015-02-02T15:47:08.813" Score="4" Body="&lt;h1&gt;Real-Time Hovercraft Battle&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hovercrafts are cool.  Hovercrafts with rail guns are even cooler.  In this challenge, you will write a program to controller a battling hovercraft.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The hovercrafts in this game obey the laws of physics.  A hovercraft with no acceleration will continue moving in a straight line.  Also, a spinning hovercraft will continue to spin.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At each moment in time, the hovercraft's motion is defined by a few variables: the location, angle, linear velocity, and angular velocity of the hovercraft.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hovercrafts are circles of radius 4, with a clear &quot;front&quot; and &quot;back&quot; end.  On the left and right there are two forward-facing fans which serve as propulsion.  Each fan has 8 power settings, from -3 to +4.  These fans control additional aspects of the hovercraft's motion, the linear and angular acceleration.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Todo: determine the mass and moment of inertia for the hovercraft, which will then allow me to determine which power settings have which effects.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The real fun begins with the rail gun.  The rail gun fires from the front of the hovercraft and deals damage when it strikes the side of the opposing hovercraft.  The ammunition travels at a fast speed but finite, and the angle of the shot depends on the motion of the hovercraft.  Firing the railgun also produces a recoil effect.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note:  I need to prevent the &quot;rotating turret&quot; strategy: spin really fast and fire when you find yourself pointed at something.  An a truly instantaneous shot would never miss in this circumstance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In order to power the rail gun, you must first charge a capacitor.  Capacitor charging can be turned on and off.  When the capacitor is charging, the fans will have reduced thrust. Once the capacitor stops charging (either it is full or charging is turned off) the thrusters will act normally again.  You can still fire the rail gun when the capacitor is charging: the shot will have reduced damage.  By default, the capacitor starts empty with charging on.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Tournament&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;All of the participants will participate in a series of 1v1v1v1 battles.  The goal is to survive the longest.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The battle arena is a radius 400 circle.  Hovercraft can collide with the boundary, bounce,and take a little damage.  At the start of the match, one hovercraft will be randomly located (1 per quadrant).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The finish order for a round will be determined by the order of death.  After a certain period of time, all remaining hovercrafts will be deemed co-champions of that round.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After a decent number of battles (a number not currently determined, but something less than an exhaustive search but enough to determine the overall winner with non-negative confidence), the finish orders for each battle will be treated as ballots in a form of ranked voting scheme.  By using a mathematically sound voting scheme, the final order should represent the results of the battles pretty well.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;I have not started the controller yet.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This will be a real-time game.  Each hovercraft program can request updates and send commands in real-time.  This means that game ticks can happen while your program is running, and each game tick is a very small increment of time (as fast as feasible).&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2015-02-02T21:08:23.907" LastActivityDate="2015-02-02T21:08:23.907" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4755" PostTypeId="2" ParentId="2140" CreationDate="2015-02-02T21:40:50.507" Score="2" Body="&lt;h1&gt;Find the direction of the Bicycle (code challenge)&lt;/h1&gt;&#xA;&lt;p&gt;There is a trace of a bicycle in the snow, but you can only see the two lines of the two wheels. Your goal is to find out which direction the bycicle did go. &lt;a href=&quot;https://www.simonsfoundation.org/multimedia/mathematical-impressions-bicycle-tracks/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Inspiration from George Hart&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Task&lt;/h3&gt;&#xA;&lt;p&gt;Write a program that takes a pixel image as input and calculates which direction the bicycle was riding. The output consist of the direction (left or right) as well as and a percentage (0-100) of how sure you are.&lt;/p&gt;&#xA;&lt;p&gt;You can assume that the front wheel and the backwheel have a distance of 100px and that the frontwheel has a path that is piecewise differentiable. (That means that the path of the frontwheel is smooth, and does only make a finite amount of sudden turns.) The path of the front wheel is marked black, while the one of the back wheel is marked red.  You can expect all inputs to be non ambiguous. Both paths end in the right and left sides of the images.&lt;/p&gt;&#xA;&lt;h3&gt;Hint&lt;/h3&gt;&#xA;&lt;p&gt;The curve of the backwheel is called &lt;em&gt;tractrix&lt;/em&gt; (but often we refer to one special curve as &lt;em&gt;tractrix&lt;/em&gt;).&lt;/p&gt;&#xA;&lt;h3&gt;Score&lt;/h3&gt;&#xA;&lt;p&gt;Your score is the sum of the precentages of the paths you got right minus the sum of the percentages of those which you got wrong.&lt;/p&gt;&#xA;&lt;h3&gt;Examples inputs (more needed for an actual challenge)&lt;/h3&gt;&#xA;&lt;p&gt;Of course the challenge images will be without plotting grid.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;EDIT: new two coloured images&lt;/strong&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/nQsQm.png&quot; alt=&quot;enter image description here&quot; /&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/hH1Yv.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/p&gt;&#xA;&lt;h1&gt;--META:&lt;/h1&gt;&#xA;&lt;p&gt;Please comment on what is unclear / should be added or changed, and vote for the ideas how to make the challenge easier:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Do not make it easier, both lines black&lt;/li&gt;&#xA;&lt;li&gt;Make it easier by making front wheel and back wheel different colours (unknown which&#xA;one is which)&lt;/li&gt;&#xA;&lt;li&gt;Make it even easier by e.g. marking the back wheel&#xA;path always red and the front wheel path always black&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-02-04T13:16:58.527" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="4756" PostTypeId="2" ParentId="2140" CreationDate="2015-02-02T21:47:33.273" Score="-3" Body="&lt;h1&gt;Every number is interesting&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We know that &lt;a href=&quot;http://en.wikipedia.org/wiki/Interesting_number_paradox&quot; rel=&quot;nofollow&quot;&gt;every number is interesting&lt;/a&gt; but how?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should write a program or function which:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;takes a list of &lt;code&gt;N&lt;/code&gt; positive integers (&gt;0 and &amp;lt;2^31)&lt;/li&gt;&#xA;&lt;li&gt;outputs &lt;code&gt;N&lt;/code&gt; lines each of them showing how the corresponding input number is interesting&lt;/li&gt;&#xA;&lt;li&gt;is not longer than 1024 bytes&lt;/li&gt;&#xA;&lt;li&gt;uses no more than 1 second per number&lt;/li&gt;&#xA;&lt;li&gt;doesn't use external sources&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;172: 444 in base6&#xA;5776: 76*76&#xA;9801: 9 * 1089 (reverse)&#xA;68101: no 11 in base2 (10000101000000101)&#xA;491033: 317 * 1549 (product of 2 big primes)&#xA;467808816: no digit 5 from base6 to base10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Inputs&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You should include the output for the following input in your post:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;58 92 120 224 358 490 912 1578 7812 222008 1645060 19796411 550453633 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If you care to run your program on a bigger sample and share the result with us use &lt;a href=&quot;http://pastebin.com/raw.php?i=969HyE12&quot; rel=&quot;nofollow&quot;&gt;this input data&lt;/a&gt; (2500 numbers). (You can upload your output to e.g. &lt;a href=&quot;http://pastebin.com/&quot; rel=&quot;nofollow&quot;&gt;pastebin&lt;/a&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a popularity-contest so highest voted answer wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Tags:  popularity-contest, number&lt;/p&gt;&#xA;" OwnerUserId="7311" LastActivityDate="2015-02-02T21:47:33.273" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="4758" PostTypeId="2" ParentId="2140" CreationDate="2015-02-03T22:33:49.407" Score="5" Body="&lt;h1&gt;Write a Connect Four Bot&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Your task is to write a Connect Four bot. Your submission must be less than 2000 bytes long. You may not save state. You may not use libraries or external resources that are, at my discretion, related to Connect Four.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Gameplay&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your submission will play against each other submission one hundred times. Each player will play first for exactly half of the matches. Each match flows like:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Player 1 drops a red token into a column.&lt;/li&gt;&#xA;&lt;li&gt;If Player 1 has not won, then Player 2 drops a black token into a column.&lt;/li&gt;&#xA;&lt;li&gt;If Player 2 has not won, repeat.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Tokens fall down a column until they collide with another token in the row beneath it or hit the bottom of the board. Your program will be terminated and called anew after each move. You win the match if you connect four tokens vertically, horizontally or diagonally.&lt;/p&gt;&#xA;&lt;p&gt;The winner of the challenge is the submission with the most match wins at the end of a tournament.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The first command line argument you will receive is the game board. Rows are &lt;code&gt;;&lt;/code&gt; delimited . Cells are &lt;code&gt;,&lt;/code&gt; delimited. The first row is the top of the board. A cell contains &lt;code&gt;0&lt;/code&gt; if unoccupied, &lt;code&gt;1&lt;/code&gt; if occupied by Player 1, and &lt;code&gt;2&lt;/code&gt; if occupied by Player 2. The board you receive will always be 7 columns by 6 row.&lt;/p&gt;&#xA;&lt;p&gt;The second command line argument you will receive is your player number. That means &lt;code&gt;1&lt;/code&gt; or &lt;code&gt;2&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;java ThatBot 0,0,0,0;0,0,0,0;0,2,1,0;0,1,2,1 1&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;You will print the column for which you would like to move to STDOUT. Columns are zero indexed. The following earns an immediate loss:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Dropping a token into a full column&lt;/li&gt;&#xA;&lt;li&gt;Dropping a token into a column that does not exist&lt;/li&gt;&#xA;&lt;li&gt;Failing to output anything to STDOUT within one second&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Deliverables&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;You must submit the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A program&lt;/li&gt;&#xA;&lt;li&gt;A unique name&lt;/li&gt;&#xA;&lt;li&gt;A method of calling your program via command line&lt;/li&gt;&#xA;&lt;li&gt;Any instructions I might need to compile your program. I'll try my best, but my best isn't always good enough.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-02-04T22:55:51.460" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="4760" PostTypeId="2" ParentId="4726" CreationDate="2015-02-04T23:03:39.027" Score="3" Body="&lt;p&gt;I'm not an active part of this community, but I'd like to offer an opinion if I may. I'd also like to discuss this from a C# perspective because I'm more familiar with that, and AFAIK C# lambdas and Java function literals are analogous.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's take &lt;a href=&quot;https://codegolf.stackexchange.com/questions/45302/random-golf-of-the-day-1-shuffle-an-array&quot;&gt;Geobit's linked question&lt;/a&gt; as an example.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is an &lt;a href=&quot;https://codegolf.stackexchange.com/a/45324/19729&quot;&gt;APL answer&lt;/a&gt; and a &lt;a href=&quot;https://codegolf.stackexchange.com/a/45318/19729&quot;&gt;CJam answer&lt;/a&gt;. In the CJam case, the answer is entirely self-contained - you just put it into an interpreter (?) with the input and you get the output. In the APL case, you have to supply the input as part of the program, and a little bit of boilerplate to &quot;call&quot; the answer code, but you'd need that for &lt;em&gt;any APL solution to any problem&lt;/em&gt; so we don't include it in the count.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, in C#, it's not so simple to get a solution to run. Apparently we score just the length of the full method definition:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;void t(int[]s){for(int i=s.Length,t,x;i&amp;gt;0;t=s[x*=new Random().NextDouble()],s[x]=s[i],s[i]=t)x=i--;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;even though in order to compile it into something we could call we need to wrap it in some boilerplate code:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;namespace Code&#xA;{&#xA;    class Golf&#xA;    {&#xA;        void t(int[]s){for(int i=s.Length,t,x;i&amp;gt;0;t=s[x*=new Random().NextDouble()],s[x]=s[i],s[i]=t)x=i--;}&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We don't count the &lt;code&gt;namespace&lt;/code&gt; and the &lt;code&gt;class&lt;/code&gt; because &lt;em&gt;any C# solution to any problem&lt;/em&gt; needs the &lt;em&gt;same&lt;/em&gt; boilerplate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So what's the difference with C# with lambdas? This is the C# lambda equivalent of the full method definition above:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;s =&amp;gt; {for(int i=s.Length,t,x;i&amp;gt;0;t=s[x*=new Random().NextDouble()],s[x]=s[i],s[i]=t)x=i--;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Again, we can't compile this without adding some boilerplate:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;namespace Code&#xA;{&#xA;    class Golf&#xA;    {&#xA;        Action&amp;lt;int[]&amp;gt; f = s =&amp;gt; {for(int i=s.Length,t,x;i&amp;gt;0;t=s[x*=new Random().NextDouble()],s[x]=s[i],s[i]=t)x=i--;}&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is different, though. The &lt;code&gt;Action&amp;lt;int[]&amp;gt;&lt;/code&gt; part is &lt;em&gt;not&lt;/em&gt; boilerplate because a different solution might need a &lt;em&gt;different&lt;/em&gt; delegate definition. Some might need an &lt;code&gt;Action&amp;lt;string[]&amp;gt;&lt;/code&gt;, or a &lt;code&gt;Func&amp;lt;int[], int&amp;gt;&lt;/code&gt;, or a custom delegate with many or &lt;code&gt;ref&lt;/code&gt; or &lt;code&gt;out&lt;/code&gt; parameters. Without the delegate definition, the compiler can't compile the function. It's not part of the boilerplate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we don't require lambda solvers to include the &lt;code&gt;Action&amp;lt;int[]&amp;gt; x =&lt;/code&gt; part of &lt;code&gt;Action&amp;lt;int[]&amp;gt; x = y =&amp;gt; {}&lt;/code&gt;, why should we expect non-lambda solvers to include the &lt;code&gt;void x(int[]&lt;/code&gt; and &lt;code&gt;)&lt;/code&gt; parts of &lt;code&gt;void x(int[]y){}&lt;/code&gt;?&lt;/p&gt;&#xA;" OwnerUserId="19729" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2015-02-04T23:03:39.027" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="4761" PostTypeId="2" ParentId="2140" CreationDate="2015-02-05T13:21:52.253" Score="3" Body="&lt;h1&gt;Convert a Finite State Machine to a Regular Expression&lt;/h1&gt;&#xA;&lt;p&gt;Anyone can make a finite state machine for matching a regular expression. But what about a regular expression that emulates a finite state machine? This inverse operation is much more confusing.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A positive integer &lt;em&gt;N&lt;/em&gt;, denoting the number of states in the machine. They are labeled 0 to &lt;em&gt;N - 1&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A list of accepting states of the machine. A string is considered to be accepted by the machine if it ends in one of these when there are no characters left.&lt;/li&gt;&#xA;&lt;li&gt;A list of triples (integer a, character b, integer c) representing the transition rules: when the machine is at state &lt;code&gt;a&lt;/code&gt; and the current character in the string is &lt;code&gt;b&lt;/code&gt;, then it may advance one character and move to state &lt;code&gt;c&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may specify the ordering and formatting of input.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;A regular expression that matches a string iff it is accepted by the finite state machine.&lt;/p&gt;&#xA;&lt;h3&gt;Additional Rules&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;An input for the state machine may contain only printable ASCII characters which are not in the set &lt;code&gt;^$()[]|+?*\.&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The machine begins in state &lt;code&gt;0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You should not use any regex features other than &lt;code&gt;|&lt;/code&gt;, &lt;code&gt;()&lt;/code&gt;, &lt;code&gt;?&lt;/code&gt;, &lt;code&gt;*&lt;/code&gt;, &lt;code&gt;+&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may not use libraries designed for this task (which apparently exist).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The regex should match full strings (assume it is surrounded by &lt;code&gt;^&lt;/code&gt; and &lt;code&gt;$&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;An answer is either a program which prints the regex to stdout, or a function which returns the regex.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is code golf: write your code in as few bytes as possible.&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox Question&lt;/h2&gt;&#xA;&lt;p&gt;Should the FSM be deterministic or non?&lt;/p&gt;&#xA;" OwnerUserId="30688" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-02-07T20:59:25.520" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="4764" PostTypeId="2" ParentId="1541" CreationDate="2015-02-06T23:44:17.217" Score="32" Body="&lt;h1&gt;TI-Basic is tokenized&lt;/h1&gt;&#xA;&lt;p&gt;Each one-byte token (Then, If, End, Ans, etc.) is stored internally as one byte. Thus, it should only count as one byte. Similarly, lowercase letters a-z count as two bytes each, since this is how they are stored on the calculator. (&lt;a href=&quot;http://tibasicdev.wikidot.com/tokens&quot; rel=&quot;nofollow noreferrer&quot;&gt;Source&lt;/a&gt;).&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Each command, variable, and operation on the TI-83 series calculators is represented by a &amp;quot;token.&amp;quot; This means that internally, the calculator does not store a command such as &amp;quot;cos(&amp;quot; as the letters c, o, s, and (. It stores a single number that it will later translate as &amp;quot;cos(&amp;quot; when necessary. In this case, the value is 196, but you most likely don't need to know that. What you do need to know is that not all tokens are the same size. If there were 256 tokens or less, then you could fit all their values into 1 byte and be happy. Unfortunately, the TI-83 has more than 256 commands and variables. Therefore TI employed some trickery and made some tokens take up 1 byte (usually the most common ones, though they seem to have had a different idea of &amp;quot;common&amp;quot;) and some take up 2 bytes. What this means to you, as the programmer, is that the size of the program is determined by the number of commands, not the number of letters in it: a short line can take up more memory than a longer one if it uses a lot of commands. Furthermore, some commands will take up the memory of two commands rather than one, so a line with a few of these commands may take up as much memory as a line with more commands of the ordinary type. Lowercase letters are the epitome of memory wasters: at a single character, they each take up 2 bytes of memory. A program that uses a lot of lowercase letters can fill up all of RAM very quickly! This may be avoided by using uppercase letters instead, which only take up 1 byte each. You can also save memory by replacing words such as &amp;quot;If&amp;quot;, &amp;quot; or &amp;quot;, &amp;quot; and &amp;quot; with the appropriate commands, when displaying text. Such a command will only take up 1 byte, whereas the text may be much larger memory-wise.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="10740" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-02-06T23:44:17.217" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="4766" PostTypeId="2" ParentId="2140" CreationDate="2015-02-07T17:52:21.110" Score="4" Body="&lt;h1&gt;Best Approximating Polynomial&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polynomials&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polynomials&amp;#39;&quot; rel=&quot;tag&quot;&gt;polynomials&lt;/a&gt; (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/higher-order-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;higher-order-function&amp;#39;&quot; rel=&quot;tag&quot;&gt;higher-order-function&lt;/a&gt;?)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let &lt;em&gt;f&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;) and &lt;em&gt;g&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;) be two continuous real-valued functions over the interval [&lt;em&gt;a&lt;/em&gt;, &lt;em&gt;b&lt;/em&gt;], where &lt;em&gt;a&lt;/em&gt;&amp;nbsp;&amp;lt;&amp;nbsp;&lt;em&gt;b&lt;/em&gt;. &#xA;The&amp;nbsp;&lt;strong&gt;mean&amp;nbsp;squared&amp;nbsp;error&lt;/strong&gt; (or simply &quot;&lt;strong&gt;error&lt;/strong&gt;&quot; hereafter) between &lt;em&gt;f&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;) and &lt;em&gt;g&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;) is defined as&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/x0j0z.png&quot; alt=&quot;Equation 1&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Roughly speaking, the smaller the error is, the closer &lt;em&gt;f&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;) and &lt;em&gt;g&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;) are.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge, &lt;em&gt;f&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;) will be some user-supplied target function and &lt;em&gt;g&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;) will be a polynomial of some maximal degree &lt;em&gt;n&lt;/em&gt;. &#xA;The goal is to find the polynomial &lt;em&gt;g&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;) that minimizes the error w.r.t. &lt;em&gt;f&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;) (such a polynomial exists and is unique;)&#xA;we say that &lt;em&gt;g&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;) is the &lt;strong&gt;best approximation&lt;/strong&gt; of &lt;em&gt;f&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;) over the interval [&lt;em&gt;a&lt;/em&gt;, &lt;em&gt;b&lt;/em&gt;] using a polynomial of degree at most &lt;em&gt;n&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, let's take the function &lt;em&gt;f&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;) = cos &lt;em&gt;x&lt;/em&gt; over the interval [0, ½&lt;em&gt;π&lt;/em&gt;] (which contains all the &quot;interesting&quot; information about this function), and look for a polynomial of degree at most&amp;nbsp;2.&#xA;As you might know, the Taylor&amp;nbsp;expansion of cos &lt;em&gt;x&lt;/em&gt; up to degree&amp;nbsp;2 is &lt;em&gt;t&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;) = 1 - ½&lt;em&gt;x&lt;/em&gt;&lt;sup&gt;2&lt;/sup&gt;. &#xA;The error between &lt;em&gt;t&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;) and &lt;em&gt;f&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;) is approximately 6.25×10&lt;sup&gt;-3&lt;/sup&gt;. &#xA;We can do better than that!&#xA;If I got my math right, the best approximation of cos &lt;em&gt;x&lt;/em&gt; over the interval [0, ½&lt;em&gt;π&lt;/em&gt;] using a polynomial of degree at most&amp;nbsp;2 is (brace yourselves):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/GPGMa.png&quot; alt=&quot;Equation 2&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;or approximately &lt;em&gt;g&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;) ≈ -0.34 &lt;em&gt;x&lt;/em&gt;&lt;sup&gt;2&lt;/sup&gt; - 0.13 &lt;em&gt;x&lt;/em&gt; + 1.02. &#xA;The error between &lt;em&gt;g&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;) and &lt;em&gt;f&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;) is approximately 7.03×10&lt;sup&gt;-5&lt;/sup&gt;—two orders of magnitude better!&#xA;The difference is very notable, as the following plot shows:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/92jmD.png&quot; alt=&quot;Plot 1&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a &lt;strong&gt;program&lt;/strong&gt; or a &lt;strong&gt;function&lt;/strong&gt; that takes a function &lt;em&gt;f&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;), an interval [&lt;em&gt;a&lt;/em&gt;, &lt;em&gt;b&lt;/em&gt;], where &lt;em&gt;a&lt;/em&gt; &amp;lt; &lt;em&gt;b&lt;/em&gt;, and a nonnegative integer &lt;em&gt;n&lt;/em&gt;, and returns the polynomial of degree at most &lt;em&gt;n&lt;/em&gt; that best approximates &lt;em&gt;f&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;) over the given interval.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You may read the input through &lt;strong&gt;STDIN&lt;/strong&gt;, the &lt;strong&gt;command line&lt;/strong&gt;, as &lt;strong&gt;function arguments&lt;/strong&gt; or an &lt;strong&gt;equivalent method&lt;/strong&gt;.&#xA;Note that you don't have to accept &lt;em&gt;a&lt;/em&gt;, &lt;em&gt;b&lt;/em&gt; and &lt;em&gt;n&lt;/em&gt; in any specific format; particularly, you don't have to read &lt;em&gt;a&lt;/em&gt; and &lt;em&gt;b&lt;/em&gt; as &lt;code&gt;[a, b]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should accept the function &lt;em&gt;f&lt;/em&gt;(&lt;em&gt;x&lt;/em&gt;) in one of the following forms:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;As a language-level &lt;strong&gt;function&lt;/strong&gt;, &lt;strong&gt;function-like object&lt;/strong&gt;, &lt;strong&gt;polymorphic object&lt;/strong&gt; or any other &lt;strong&gt;equivalent method&lt;/strong&gt; your language uses to communicate functions.&lt;/li&gt;&#xA;&lt;li&gt;As a &lt;strong&gt;string&lt;/strong&gt; containing an expression.&#xA;The actual format of the string is flexible, but it should be expressive enough to allow basic arithmetic operations, exponentiation, and preferably also logarithms and basic trigonometric functions.&#xA;The intention is for it to be used with something like &lt;code&gt;eval&lt;/code&gt;.&#xA;Note that you're allowed to require the string to be formatted in some convenient way (within reason), for example, pre-wrapped in a function&lt;br&gt;(as in &lt;code&gt;&quot;function (x) { return x + Math.sin(x); }&quot;&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;If, and only if, both of the above methods are impractical in your language, you may not take the function as input and assume that &lt;strong&gt;the function is already defined&lt;/strong&gt; by the user.&#xA;In this case, add to your score a &lt;strong&gt;+16&lt;sub&gt;byte&lt;/sub&gt; penalty&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You may assume that the input is valid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please specify how your program accepts its input in your post.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You may write the output to &lt;strong&gt;STDOUT&lt;/strong&gt;, return it as the &lt;strong&gt;function's result&lt;/strong&gt; or use an &lt;strong&gt;equivalent method&lt;/strong&gt;.&#xA;You may express the polynomial as a &lt;strong&gt;list of coefficients&lt;/strong&gt; (e.g., &lt;code&gt;[1, -2, 1]&lt;/code&gt;), using some &lt;strong&gt;pretty-printed&lt;/strong&gt; form (e.g., &lt;code&gt;x^2 - 2x + 1&lt;/code&gt;) or some other &lt;strong&gt;equivalent method&lt;/strong&gt;.&#xA;Either way, it should be easy to determine the coefficients of the different terms from your output; so, for example, you may not return the polynomial as an opaque function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that unlike the example given at the beginning of the post, you don't have to produce symbolic output (unless you want to); a numeric output is fine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please specify how your program returns its output in your post.&#xA;If the order of the coefficients may be ambiguous, make sure to clarify it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Accuracy and Run Time&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The numerical accuracy of your program is most likely going to be dependent on the target function, the degree of the polynomial and the amount of time you allow it to run.&#xA;As a result, giving a general accuracy requirement is impractical.&#xA;However, your program should process each of the below &lt;strong&gt;test cases&lt;/strong&gt; in &lt;strong&gt;less than a minute&lt;/strong&gt; and produce a polynomial whose error w.r.t. the target function is &lt;strong&gt;no worse&lt;/strong&gt; than the &lt;strong&gt;error specified in the test case&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Additional Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may not use any function that performs this specific task.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is code-golf.&#xA;The &lt;strong&gt;shortest code&lt;/strong&gt;, in bytes, wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Recall that your program should complete each of the following test cases in less than a minute, with an error that is less than or equal to the specified error.&#xA;That being said, this is not a hard and fast rule; if your program struggles with a couple of test cases, that's fine.&#xA;Note that the approximating polynomials listed in the test cases are just an approximation and are only given for illustration.&#xA;Although theoretically each case has a unique optimal polynomial, your program might produce a notably different one; this is especially true for the higher degree polynomials.&#xA;However, both polynomials should behave similarly over the given interval, which is why the correctness of your program is determined by the error.&#xA;Likewise, the errors listed in the test cases are only an approximation and are not necessarily the errors of the corresponding listed polynomials—they're just a lower-bound for accuracy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;Test 1&#xD;&#xA;f(x) = sin(x)&#xD;&#xA;From: -pi&#xD;&#xA;To: pi&#xD;&#xA;Max. Deg.: 0&#xD;&#xA;g(x) = 0&#xD;&#xA;e^2 = 5.0001 * 10^-1&#xD;&#xA;&#xD;&#xA;Test 2&#xD;&#xA;f(x) = sin(x)&#xD;&#xA;From: -pi&#xD;&#xA;To: pi&#xD;&#xA;Max. Deg.: 1&#xD;&#xA;g(x) = 0.304 x&#xD;&#xA;e^2 = 1.9604 * 10^-1&#xD;&#xA;&#xD;&#xA;Test 3&#xD;&#xA;f(x) = cos(x)&#xD;&#xA;From: -pi&#xD;&#xA;To: pi&#xD;&#xA;Max. Deg.: 2&#xD;&#xA;g(x) = -0.231 x^2 + 0.76&#xD;&#xA;e^2 = 3.8032 * 10^-2&#xD;&#xA;&#xD;&#xA;Test 4&#xD;&#xA;f(x) = sin(x)&#xD;&#xA;From: -pi&#xD;&#xA;To: pi&#xD;&#xA;Max. Deg.: 5&#xD;&#xA;g(x) = 0.005643 x^5 - 0.155 x^3 + 0.988 x&#xD;&#xA;e^2 = 1.8490 * 10^-5&#xD;&#xA;&#xD;&#xA;Test 5&#xD;&#xA;f(x) = cos(x)&#xD;&#xA;From: 0&#xD;&#xA;To: 3pi&#xD;&#xA;Max. Deg.: 8&#xD;&#xA;g(x) = 6.69465*10^-9 x^8 - 1.01005*10^-4 x^7 + 0.00332742 x^6 - 0.0400508 x^5 + 0.205029 x^4 - 0.351657 x^3 - 0.120773 x^2 - 0.169562 x + 1.01830&#xD;&#xA;e^2 = 1.9764 * 10^-5&#xD;&#xA;&#xD;&#xA;Test 6&#xD;&#xA;f(x) = e^(-x^2)&#xD;&#xA;From: -2&#xD;&#xA;To: 2&#xD;&#xA;Max. Deg.: 10&#xD;&#xA;g(x) = -0.00143879 x^10 + 0.0211686 x^8 - 0.133468 x^6 + 0.473915 x^4 - 0.992265 x^2 + 0.999624&#xD;&#xA;e^2 = 8.4405 * 10^-8&#xD;&#xA;&#xD;&#xA;Test 7&#xD;&#xA;f(x) = 1/(x^2 + 1)&#xD;&#xA;From: -3&#xD;&#xA;To: 3&#xD;&#xA;Max. Deg.: 16&#xD;&#xA;g(x) = 3.16504*10^-6 x^16 - 1.23974*10^-4 x^14 + 0.00203230 x^12 - 0.0181511 x^10 + 0.0966544 x^8 - 0.318123 x^6 + 0.662508 x^4 - 0.923653 x^2 + 0.996846&#xD;&#xA;e^2 = 2.6 * 10^-6&#xD;&#xA;&#xD;&#xA;Test 8&#xD;&#xA;f(x) = e^((sin(x))^3)&#xD;&#xA;From: 0&#xD;&#xA;To: 2pi&#xD;&#xA;Max. Deg.: 1&#xD;&#xA;g(x) = -0.224 x + 1.87&#xD;&#xA;e^2 = 2.6845 * 10^-1&#xD;&#xA;&#xD;&#xA;Test 9&#xD;&#xA;f(x) = (cos(x))^5&#xD;&#xA;From: pi&#xD;&#xA;To: 2pi&#xD;&#xA;Max. Deg.: 17&#xD;&#xA;g(x) = 6.31854*10^-12 x^17 - 1.63320*10^-11 x^16 - 2.78192*10^-10 x^15 - 8.73964*10^-10 x^14 - 2.74564*10^-9 x^13 + 5.59537*10^-8 x^12 - 2.70984*10^-8 x^11 - 2.61779*10^-5 x^10 - 2.67450*10^-7 x^9 - 8.40220*10^-7 x^8 + 0.3247516 x^7 - 7.3046333 x^6 + 72.908485 x^5 - 408.43197 x^4 + 1362.34294 x^3 - 2657.0269 x^2 + 2737.319113682029 x - 1100.1514&#xD;&#xA;e^2 = 5.8 * 10^-5&#xD;&#xA;&#xD;&#xA;Test 10&#xD;&#xA;f(x) = sqrt(1 - x^2)&#xD;&#xA;From: -1&#xD;&#xA;To: 1&#xD;&#xA;Max. Deg.: 20&#xD;&#xA;g(x) = -627.601 x^20 + 2853.92 x^18 - 5499.47 x^16 + 5845.71 x^14 - 3738.80 x^12 + 1472.42 x^10 - 350.970 x^8 + 47.6426 x^6 - 3.39128 x^4 - 0.414096 x^2 + 0.999632&#xD;&#xA;e^2 = 1.2 * 10^-6&#xD;&#xA;&#xD;&#xA;Test 11&#xD;&#xA;f(x) = sqrt(1 - x^2) + 0.1*sin(4*pi*x)&#xD;&#xA;From: -1&#xD;&#xA;To: 1&#xD;&#xA;Max. Deg.: 18&#xD;&#xA;g(x) = -203.563 x^18 + 141.013 x^17 + 821.952 x^16 - 757.063 x^15 - 1378.59 x^14 + 1771.07 x^13 + 1241.44 x^12 - 2345.58 x^11 - 648.127 x^10 + 1895.10 x^9 + 197.425 x^8 - 928.025 x^7 - 33.5970 x^6 + 254.982 x^5 + 2.70132 x^4 - 32.7510 x^3 - 0.590680 x^2 + 1.25167 x + 1.00047&#xD;&#xA;e^2 = 1.9 * 10^-6&#xD;&#xA;&#xD;&#xA;Test 12&#xD;&#xA;f(x) = abs(x)&#xD;&#xA;From: -1&#xD;&#xA;To: 1&#xD;&#xA;Max. Deg.: 6&#xD;&#xA;g(x) = 1.46667 x^6 - 2.82024 x^4 + 2.30724 x^2 + 0.0854450&#xD;&#xA;e^2 = 5.08635 * 10^-4&#xD;&#xA;&#xD;&#xA;Test 13&#xD;&#xA;f(x) = x*sin(x^1.2) + 10*sqrt(x)&#xD;&#xA;From: 0&#xD;&#xA;To: 2.5pi&#xD;&#xA;Max. Deg.: 3&#xD;&#xA;g(x) = -0.129 x^3 + 1.046 x^2 + 1.392 x + 6.98&#xD;&#xA;e^2 = 7.3389 * 10^0&#xD;&#xA;&#xD;&#xA;Test 14&#xD;&#xA;f(x) = sin(log(1 + e^cos(x)))&#xD;&#xA;From: 2&#xD;&#xA;To: 10&#xD;&#xA;Max. Deg.: 10&#xD;&#xA;g(x) = 9.52190*10^-10 x^10 - 6.30342*10^-6 x^9 + 3.3746525*10^-4 x^8 - 0.0078575036 x^7 + 0.103708803 x^6 - 0.84926923 x^5 + 4.4421097 x^4 - 14.766225 x^3 + 30.153933 x^2 - 34.72483 x + 17.8389&#xD;&#xA;e^2 = 5.4 * 10^-5&#xD;&#xA;&#xD;&#xA;Test 15&#xD;&#xA;f(x) = abs(log(x))&#xD;&#xA;From: 1/e&#xD;&#xA;To: e&#xD;&#xA;Max. Deg.: 15&#xD;&#xA;g(x) = 6.07034*10^-8 x^15 + 9.85444*10^-5 x^14 + 3.35349*10^-7 x^13 + 7.88206*10^-7 x^12 + 1.85260*10^-6 x^11 + 4.35436*10^-6 x^10 - 3.4245574 x^9 + 42.093925 x^8 - 228.714688 x^7 + 711.8547 x^6 - 1383.06 x^5 + 1720.8859 x^4 - 1357.596 x^3 + 651.1596 x^2 - 173.8175 x + 20.680&#xD;&#xA;e^2 = 1.587 * 10^-4&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Program&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The following snippet can be used to compute the best approximating polynomial for a given function, as well as to calculate the error of your own approximations.&#xA;Note that it has limited accuracy, and becomes numerically unstable for polynomials of degree over 20–30.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;style&amp;gt;#main {display: none;}#status_container {padding: 4px;}#status {padding: 5px;background-color: #fffdce;box-shadow: 1.5px 1.5px 3.5px #aaaaaa;font-size: 10pt;word-wrap: break-word;display: none;}#status[loading] {display: inline;}&amp;lt;/style&amp;gt;&amp;lt;span id=&quot;main&quot;&amp;gt;&amp;lt;table id=&quot;main_table&quot;&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;div id=&quot;plot_area&quot;&amp;gt;&amp;lt;div id=&quot;plot_float&quot;&amp;gt;&amp;lt;div id=&quot;plot_container&quot;&amp;gt;&amp;lt;div id=&quot;plot&quot;&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;table class=&quot;field_table&quot; id=&quot;field_table&quot;&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td class=&quot;field_name&quot;&amp;gt;()&amp;amp;nbsp;=&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;table class=&quot;padding_table&quot;&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;div class=&quot;input_container&quot;&amp;gt;&amp;lt;div class=&quot;input_underlay&quot; id=&quot;expression0_underlay&quot;&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;div class=&quot;input_error_underlay&quot; id=&quot;expression0_error_underlay&quot;&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;textarea class=&quot;input&quot; id=&quot;expression0&quot; spellcheck=&quot;false&quot; oninput=&quot;update(0)&quot;&amp;gt;e^-(x/6) cos x&amp;lt;/textarea&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td colspan=&quot;2&quot;&amp;gt;&amp;lt;table class=&quot;horz_field_table&quot;&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;table class=&quot;field_table&quot;&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td class=&quot;field_name small_field_name&quot;&amp;gt;From&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;table&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;div class=&quot;input_container&quot;&amp;gt;&amp;lt;div class=&quot;input_underlay&quot; id=&quot;from_underlay&quot;&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;div class=&quot;input_error_underlay&quot; id=&quot;from_error_underlay&quot;&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;textarea class=&quot;input&quot; id=&quot;from&quot; spellcheck=&quot;false&quot; oninput=&quot;update()&quot;&amp;gt;0&amp;lt;/textarea&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;table class=&quot;field_table&quot;&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td class=&quot;field_name small_field_name&quot;&amp;gt;To&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;table&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;div class=&quot;input_container&quot;&amp;gt;&amp;lt;div class=&quot;input_underlay&quot; id=&quot;to_underlay&quot;&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;div class=&quot;input_error_underlay&quot; id=&quot;to_error_underlay&quot;&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;textarea class=&quot;input&quot; id=&quot;to&quot; spellcheck=&quot;false&quot; oninput=&quot;update()&quot;&amp;gt;2.5pi&amp;lt;/textarea&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;table class=&quot;field_table&quot;&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td class=&quot;field_name small_field_name&quot;&amp;gt;Max.&amp;amp;nbsp;Deg.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;table&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;div class=&quot;input_container&quot;&amp;gt;&amp;lt;div class=&quot;input_underlay&quot; id=&quot;max_deg_underlay&quot;&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;div class=&quot;input_error_underlay&quot; id=&quot;max_deg_error_underlay&quot;&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;textarea class=&quot;input&quot; id=&quot;max_deg&quot; spellcheck=&quot;false&quot; oninput=&quot;max_deg_add(0)&quot; onkeydown=&quot;return spinner_keydown(event, 'max_deg', max_deg_add)&quot;&amp;gt;3&amp;lt;/textarea&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;div class=&quot;button_group small_button_group&quot;&amp;gt;&amp;lt;table&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;button class=&quot;increment pos_button fixed_button&quot; id=&quot;max_deg_inc&quot; title=&quot;Increment&quot; onclick=&quot;max_deg_add(+1)&quot;&amp;gt;▲&amp;lt;/button&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;button class=&quot;decrement neg_button fixed_button&quot; id=&quot;max_deg_dec&quot; title=&quot;Decrement&quot; onclick=&quot;max_deg_add(-1)&quot;&amp;gt;▼&amp;lt;/button&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td class=&quot;separator&quot;&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;div class=&quot;button_group&quot;&amp;gt;&amp;lt;button class=&quot;check_button&quot; id=&quot;hold&quot; title=&quot;Supress update&quot; onclick=&quot;hold()&quot;&amp;gt;Hold&amp;lt;/button&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr class=&quot;separated_row&quot; id=&quot;expression0_0&quot;&amp;gt;&amp;lt;td class=&quot;field_name&quot;&amp;gt;()&amp;amp;nbsp;=&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;table class=&quot;padding_table&quot;&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;div class=&quot;output_container&quot;&amp;gt;&amp;lt;div class=&quot;output polynomial&quot; id=&quot;poly&quot;&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr id=&quot;expression0_1&quot;&amp;gt;&amp;lt;td class=&quot;field_name&quot;&amp;gt;&amp;lt;span class=&quot;variable&quot;&amp;gt;ϵ&amp;lt;/span&amp;gt;&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;&amp;amp;nbsp;=&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;table class=&quot;horz_field_table&quot;&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;div class=&quot;output_container&quot;&amp;gt;&amp;lt;div class=&quot;output&quot; id=&quot;poly_error&quot;&amp;gt;&amp;lt;table class=&quot;horz_field_table&quot;&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td class=&quot;error_value&quot; id=&quot;poly_error_value&quot;&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td class=&quot;error_change&quot; id=&quot;poly_error_change&quot;&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;div class=&quot;button_group&quot;&amp;gt;&amp;lt;button class=&quot;add_expr pos_button fixed_button&quot; id=&quot;add_expr0&quot; title=&quot;Add function&quot; onclick=&quot;add_expr(0, event.ctrlKey + 2 * event.shiftKey)&quot;&amp;gt;+&amp;lt;/button&amp;gt;&amp;lt;button class=&quot;remove_expr neg_button fixed_button&quot; style=&quot;display: none;&quot; id=&quot;remove_expr0&quot; title=&quot;Remove function&quot; onclick=&quot;remove_expr(0, event.ctrlKey)&quot; disabled&amp;gt;-&amp;lt;/button&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr class=&quot;options separated_row&quot; id=&quot;flag_row&quot;&amp;gt;&amp;lt;td colspan=&quot;2&quot;&amp;gt;&amp;lt;table class=&quot;horz_flag_table&quot;&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;label class=&quot;flag_container&quot; title=&quot;Plot legend&quot;&amp;gt;&amp;lt;table&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;input type=&quot;checkbox&quot; class=&quot;flag&quot; id=&quot;legend&quot; onchange=&quot;update(null, true)&quot; checked&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Key&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/label&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;label class=&quot;flag_container&quot; title=&quot;Extra accuracy&quot;&amp;gt;&amp;lt;table&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;input type=&quot;checkbox&quot; class=&quot;flag&quot; id=&quot;extra_accuracy&quot; onchange=&quot;update(undefined, true)&quot;&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Acc.&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/label&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;label class=&quot;flag_container&quot; title=&quot;Scientific notation&quot;&amp;gt;&amp;lt;table&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;input type=&quot;checkbox&quot; class=&quot;flag&quot; id=&quot;scientific_notation&quot; onchange=&quot;render_output()&quot;&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Sci.&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/label&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;label class=&quot;flag_container&quot; title=&quot;Decimal exponent style&quot;&amp;gt;&amp;lt;table&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;input type=&quot;checkbox&quot; class=&quot;flag&quot; id=&quot;decimal_exponent&quot; onchange=&quot;render_output()&quot;&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Dec.&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/label&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;label class=&quot;flag_container&quot; title=&quot;Ascending order&quot;&amp;gt;&amp;lt;table&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;input type=&quot;checkbox&quot; class=&quot;flag&quot; id=&quot;poly_ascending&quot; onchange=&quot;render_output()&quot;&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Asc.&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/label&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;select id=&quot;poly_mode&quot; title=&quot;Polynomial style&quot; onchange=&quot;render_output()&quot;&amp;gt;&amp;lt;option value=&quot;disp&quot;&amp;gt;Display&amp;lt;/option&amp;gt;&amp;lt;option value=&quot;text&quot;&amp;gt;Text&amp;lt;/option&amp;gt;&amp;lt;option value=&quot;prog&quot;&amp;gt;Program&amp;lt;/option&amp;gt;&amp;lt;option value=&quot;list&quot;&amp;gt;List&amp;lt;/option&amp;gt;&amp;lt;/select&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/span&amp;gt;&amp;lt;div id=&quot;status_container&quot;&amp;gt;&amp;lt;span id=&quot;status&quot; loading&amp;gt;Loading...&amp;lt;/span&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;link rel=&quot;stylesheet&quot; type=&quot;text/css&quot; href=&quot;https://gist.githack.com/anonymous/6059e31443745ba122dd/raw/9ca2667d0027fc4c4764533098885a8c0cc31674/poly.css&quot;&amp;gt;&amp;lt;!--[if lte IE 8]&amp;gt;&amp;lt;script language=&quot;javascript&quot; type=&quot;text/javascript&quot; src=&quot;http://www.flotcharts.org/flot/excanvas.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&amp;lt;![endif]--&amp;gt;&amp;lt;script language=&quot;javascript&quot; type=&quot;text/javascript&quot; src=&quot;http://www.flotcharts.org/flot/jquery.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&amp;lt;script language=&quot;javascript&quot; type=&quot;text/javascript&quot; src=&quot;http://www.flotcharts.org/flot/jquery.flot.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&amp;lt;script async type=&quot;text/javascript&quot; src=&quot;https://gist.githack.com/anonymous/6059e31443745ba122dd/raw/aa24abd74de60be00eb3d5b4cbb4e39ee8cbf3d6/poly.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The &quot;no functions that perform this specific task&quot; rule seems to be too ambiguous after all.&#xA;I'm returning this to the sandbox for now.&lt;/p&gt;&#xA;" OwnerUserId="31403" LastEditorUserId="31403" LastEditDate="2015-02-27T22:00:01.217" LastActivityDate="2015-02-27T22:00:01.217" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="4769" PostTypeId="2" ParentId="2140" CreationDate="2015-02-08T19:00:55.030" Score="2" Body="&lt;h1&gt;Implement the Maximize Affirmed Majorities voting system&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are many different &lt;a href=&quot;http://en.wikipedia.org/wiki/Voting_system&quot; rel=&quot;nofollow noreferrer&quot;&gt;voting systems&lt;/a&gt; in existence.  Different voting systems have different mathematical properties, which serve to describe the &quot;positive features&quot; of that system.  Here is &lt;a href=&quot;http://en.wikipedia.org/wiki/Voting_system#Mathematical_criteria&quot; rel=&quot;nofollow noreferrer&quot;&gt;an informative list&lt;/a&gt; of these properties and a &lt;a href=&quot;http://en.wikipedia.org/wiki/Voting_system#Compliance_of_selected_systems_.28table.29&quot; rel=&quot;nofollow noreferrer&quot;&gt;table of compliance&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you will implement a voting procedure called &quot;Maximized Affirmed Majorities&quot;, a method created with the sole purpose of meeting as many mathematical requirements as possible. You will write the shortest (in bytes) program (or named function) possible to determine the winner of an election using this method.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Procedure&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Each &lt;em&gt;vote&lt;/em&gt; is a self-consistent ordering of the candidates. It is possible for a vote to include ties between multiple candidates, like &lt;code&gt;A&amp;gt;B=C&amp;gt;D=E=F&lt;/code&gt;.  An example of a vote which violates these rules is `A&gt;B&gt;A.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Step 1: Create a tiebreaker&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I know it's a little odd that creating a tiebreaker is the first step, but hopefully you never have to use a random tiebreaker for a full-scale election.  A tiebreaker is a strict ordering of candidates.  Let T(X,Y) be the tiebreak function, return true iff the tiebreaker ranks X above Y.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Choose a uniformly random ballot, and adopt the preferences of that ballot.&lt;/li&gt;&#xA;&lt;li&gt;If the ordering is incomplete (like &lt;code&gt;A&amp;gt;B=C&amp;gt;D=E=F&lt;/code&gt;), then choose a second uniformly random ballot (without replacement) and use that ballot to tie-break any unresolved orderings.&lt;/li&gt;&#xA;&lt;li&gt;Repeat step 2 until the tiebreaker is complete.  If you run out of ballots to create a tiebreaker with, randomly resolve the remainder of the list.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Step 2: Create a list of majorities&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This list takes the form of ordered pairs of candidates.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;For each pair of candidates (X,Y), let V(X,Y) be the number of voters who ranked X strictly over Y.  &#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If V(X,Y) &gt; V(Y,X), then add (X,Y) to the list.&lt;/li&gt;&#xA;&lt;li&gt;If V(X,Y) &amp;lt; V(Y,X), then add (Y,X) to the list.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Step 3: Sort of the list in order of descending importance&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A majority (X,Y) is ranked above (Z,W) if any of the following hold:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;V(X,Y) &gt; V(Z,W); more support of X&gt;Y&lt;/li&gt;&#xA;&lt;li&gt;V(X,Y) == V(Z,W) and V(W,Z) &gt; V(Y,X); same support, but less opposition&lt;/li&gt;&#xA;&lt;li&gt;V(X,Y) == V(Z,W) and V(W,Z) == V(Y,X) and T(W,Y) == True&lt;/li&gt;&#xA;&lt;li&gt;V(X,Y) == V(Z,W) and V(W,Z) == V(Y,X) and Y == W and T(X,Z) == True&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Step 4: Affirm majorities in order of preference&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Let F(X,Y) be a function that returns whether or not X finished over Y in the final list.  It is initialized to False for every pair of candidates.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Iterate through the list of majorities, in order.&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If F(X,Y) == False and F(Y,X) == False, then &lt;em&gt;Affirm&lt;/em&gt;(X,Y).&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The function Affirm(X,Y) is defined as follows:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Set F(X,Y) to true&lt;/li&gt;&#xA;&lt;li&gt;For each candidate A where X != A != Y&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If F(A,X) == True and F(A,Y) == False, then Affirm(A,Y)&lt;/li&gt;&#xA;&lt;li&gt;if F(Y,A) == True and F(X,A) == False, then Affirm(X,A)&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Step 5: Determine the top candidate(s)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A candidate X is considered a top candidate if there exists no candidate Y such that F(Y,X) == True.  That is, candidate X doesn't explicitly lose to anybody.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Step 6:  Tiebreak to determine the winner&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Out of the list of top candidates, the &lt;strong&gt;winner&lt;/strong&gt; is the candidate who appears highest on the tiebreaker list.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input will be handled similarly to this &lt;a href=&quot;http://mam.hostei.com/mamcalc.php&quot; rel=&quot;nofollow noreferrer&quot;&gt;online implementation&lt;/a&gt; I found, which also provides the complete ordering of candidates instead of just the winner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each line of input will contain a ballot, which is a list of space-separated candidates in descending order of preference.  Optionally, two candidates separated by an &lt;code&gt;=&lt;/code&gt; sign are considered equal in preference. A number followed by a colon at the start of a line denotes a multiple number of ballots.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[line] = ([number]: )?[candidate]( (= )?[candidate])*&#xA;[candidate] = alphanumeric string, not starting with a digit&#xA;[number] = a positive integer of course&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Any candidates no ranked on a ballot are appended to the end and set equal to each other.  You may optionally assume 1 or 2 newlines at the end of input.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example input:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Bob Sally Test4&#xA;Bob Sally Test4&#xA;1: Bob = Sally Test4 = Sam&#xA;4: Test4 Bob&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is the exact same as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Bob Sally Test4 Sam&#xA;Bob Sally Test4 Sam&#xA;Bob = Sally Test4 = Sam&#xA;Test4 Bob Sally = Sam&#xA;Test4 Bob Sally = Sam&#xA;Test4 Bob Sally = Sam&#xA;Test4 Bob Sally = Sam&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Expected Output&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Test4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Sandbox Notes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Any comments?&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2015-02-08T19:09:07.523" LastActivityDate="2015-02-08T19:09:07.523" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4772" PostTypeId="2" ParentId="2140" CreationDate="2015-02-09T16:20:14.557" Score="1" Body="&lt;h1&gt;Cursor Wars&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This question is based off of my previous &lt;a href=&quot;https://codegolf.stackexchange.com/questions/45515/navigate-text-with-arrow-keys&quot;&gt;Navigate Text with Arrow Keys&lt;/a&gt; golf.  Here, a segment of text is the battle arena, and the opponents move like cursors.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Idea 1: Tron / Light-Bikes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As the cursors move left to right, they paint parts of the text.  Neither cursor can move through a painted area.  The cursor who runs out of moves first loses.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To add a twist to the board's topology, I could make it so that the text area is flipped for the opponent.  If I see the board:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;X-----&#xA;---&#xA;------Y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then the opponent sees the board:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Y------&#xA;---&#xA;-----X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;With line-wrapping working differently for each player, they don't have the same movement patterns.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Idea 2: Area Painting&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Like in the Tron idea, cursors paint an area.  The cursor that paints the most area wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I could make it make a few versions&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Area painted once cannot be repainted: the winner is the cursor that painted the majority of area&lt;/li&gt;&#xA;&lt;li&gt;Area can painted my moving right and cleared by moving left (backspacing).  The winner is the one that painted the most area times time.  (Each time step, players earn one point per painted area.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.653" LastActivityDate="2015-02-09T16:20:14.557" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4773" PostTypeId="2" ParentId="2140" CreationDate="2015-02-09T17:37:52.563" Score="2" Body="&lt;h1&gt;Conway's Golf of Life- Brains vs Brawn Edition&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;2 programs play a competitive version of the game of life, where each program can set as many cells in the initial condidtions as there are characters in the other's source code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The 2-player game of life is played on an infinite grid of cells. Each cell holds a value a, b, or 0. On each turn, the following rules are applied simultaneously to each cell: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A non-zero cell with 2 or three non-zero neighbours keeps its value&lt;/li&gt;&#xA;&lt;li&gt;A non-zero cell with less than 2 or more than 3 non-zero neighbours is set to 0&lt;/li&gt;&#xA;&lt;li&gt;A zero cell with 3 non-zero neighbours is set to the value of the majority of its non-zero neighbours&lt;/li&gt;&#xA;&lt;li&gt;A zero cell with more or less than three non-zero neighbours keeps its value&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The two player programs A and B have nA and nB characters respectively, and nA &amp;lt;= nB.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The grid is initialized to 0 everywhere&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First, program A is called with the command line argument nB. It must output 2 * nB integers to stdout, which will be interpreted as a list L of nB ordered pairs. For each ordered pair in L, the cell at the coordinates in that pair will be set to 'a'&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Second, program B is called with the command line argument nA followed by the 2*nB integers output by program B. It must output 2*nA integers to stdout, which will be interpreted as a list L of nA ordered pairs. For each ordered pair in L, the cell at the coordinates in that pair will be set to 'b'&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note: The coordinates output by programs must fit within 16 bit signed integers. However, calculation of steps will take place on an effectively infinite grid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once both programs have run, the grid is run through 10,000 turns. After this, if more cells are set to a, program A wins. Otherwise, program B wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is to create a program that has the best win/loss ratio against all other submissions.&lt;/p&gt;&#xA;" OwnerUserId="19700" LastEditorUserId="19700" LastEditDate="2015-02-15T17:20:32.610" LastActivityDate="2015-02-15T17:20:32.610" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="4776" PostTypeId="1" CreationDate="2015-02-09T21:07:19.867" Score="4" ViewCount="365" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/22/8478&quot;&gt;It's accepted practice&lt;/a&gt; to include non-standard compiler or interpreter flags in a program's byte count (most often used with Perl and Ruby, to run the program in an implicit I/O loop - but there are other use cases). However, I can't find any information about &lt;em&gt;how&lt;/em&gt; exactly we count these, and if there is no definitive reference for this on meta, it's not exactly an objective scoring.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Several questions come to mind:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Most flags require a leading &lt;code&gt;-&lt;/code&gt; or &lt;code&gt;--&lt;/code&gt;. Should these be included in the count?&lt;/li&gt;&#xA;&lt;li&gt;Should spaces between multiple arguments be included in the count?&lt;/li&gt;&#xA;&lt;li&gt;If we don't count the spaces, then consider that often &lt;code&gt;-option=5&lt;/code&gt; is equivalent to &lt;code&gt;-option 5&lt;/code&gt;. In such a case, should the &lt;code&gt;=&lt;/code&gt; be counted?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;What are our rules (or should our rules be) for counting command-line arguments given to compilers and interpreters?&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2015-02-09T22:53:34.307" Title="How do we count compiler/interpreter flags?" Tags="|discussion|code-golf|policy|scoring|" AnswerCount="1" CommentCount="0" ClosedDate="2015-02-13T12:08:03.217" ContentLicense="CC BY-SA 3.0" />
  <row Id="4777" PostTypeId="1" CreationDate="2015-02-09T21:48:39.470" Score="14" ViewCount="162" Body="&lt;h1&gt;Description&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a Java wrapper class for communicating with submissions written in other languages. If you decide to use this for a challenge, make your life easier and require submissions to post the command that runs it. If they can't run it from the command prompt, then you probably can't either.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;TODO&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are a few things that I want to add but don't have time to finish right now. I'm also not sure how legal it is to redistribute some of the things that I want to redistribute.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bundle a bunch of compilers for popular languages with the wrapper&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Wrapper&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;// Your package line goes here&#xA;&#xA;import java.io.BufferedReader;&#xA;import java.io.IOException;&#xA;import java.io.InputStreamReader;&#xA;import java.util.concurrent.TimeUnit;&#xA;&#xA;/**&#xA; * Wraps a submission in a Java class.&#xA; * @author Rainbolt&#xA; */&#xA;public class Wrapper {&#xA;&#xA;    private final String command;&#xA;&#xA;    /**&#xA;     * Create a submission with the specified command.&#xA;     * @param command The command associated with the submission&#xA;     */&#xA;    public Wrapper(String command) {&#xA;        this.command = command;&#xA;    }&#xA;&#xA;    /**&#xA;     * Invokes a submission and returns its response.&#xA;     * @param timeout The number of milliseconds allowed for the submission &#xA;     * to respond&#xA;     * @return The output of the submission&#xA;     */&#xA;    public String getResponse(long timeout) {&#xA;        String response = &quot;&quot;;&#xA;&#xA;        try {&#xA;            // Start the process&#xA;            Process proc = Runtime.getRuntime().exec(command);&#xA;&#xA;            // Attach a reader to the process&#xA;            BufferedReader pin = new BufferedReader(new InputStreamReader(proc.getInputStream()));&#xA;&#xA;            // Allow the process to time out&#xA;            proc.waitFor(timeout, TimeUnit.MILLISECONDS);&#xA;            if (proc.isAlive())&#xA;                proc.destroy();&#xA;&#xA;            // Read the output of the process&#xA;            while (pin.ready())&#xA;                response += pin.readLine() + System.lineSeparator();&#xA;&#xA;        } catch (IOException | InterruptedException e) {&#xA;            System.out.println(&quot;An error occurred while attempted to get a response.&quot;);&#xA;        }&#xA;&#xA;        return response;&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Typical Usage&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In the example below, the program called SubmissionOne.py is saved to my C: drive. It will receive four arguments (everything after &quot;python&quot;). It has 1000 milliseconds to produce output before being forcibly terminated.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;long timeout = 1000;&#xA;String command = &quot;python C:\\SubmissionOne.py 123 324 345&quot;;&#xA;Wrapper wrapper = new Wrapper(command);&#xA;String response = wrapper.getResponse(timeout);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="18487" LastEditDate="2015-02-09T22:57:45.637" LastActivityDate="2015-02-09T22:57:45.637" Title="Java Wrapper for KotH" Tags="|discussion|" AnswerCount="0" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4778" PostTypeId="2" ParentId="4776" CreationDate="2015-02-09T22:28:46.213" Score="0" Body="&lt;p&gt;&lt;strong&gt;Proposed Rule&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Non-standard compiler or interpreter flags should be added to the program's total byte count. Dashes and spaces (including leading spaces) should be included as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the example below, &lt;code&gt;-nonStandardOption 3&lt;/code&gt; would contribute 21 bytes towards the final byte count of the submission. Notice that the space in front of the dash is included.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Compile with &lt;code&gt;myCompiler myProgram -standardOption 1 -nonStandardOption 3&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Philosophy&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The large majority of users here do not mess with compiler flags at all. Requiring users to count them would be annoying. To make things easier for the majority, standard compiler flags should not count.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A small minority of users do mess with compiler flags. There is probably some potential for abuse. To circumvent that, every single character added as a result of using a non-standard flag should count. That includes spaces and dashes.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="18487" LastEditDate="2015-02-09T22:53:34.307" LastActivityDate="2015-02-09T22:53:34.307" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4780" PostTypeId="1" AcceptedAnswerId="4781" CreationDate="2015-02-11T08:50:44.987" Score="24" ViewCount="3024" Body="&lt;p&gt;Suppose we have the following Python code:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;f=lambda x:x*2&#xA;X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The first line defines a function which doubles a number. Then the second line is reached, is found to be invalid, and the program exits with an error.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Similarly, another case is:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;print(1)&#xA;X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which prints the number 1, then exits with the same error.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One might argue that these sorts of submissions are valid because:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In the first case the function &lt;code&gt;f&lt;/code&gt; can still be used, in the sense that &lt;code&gt;f(2)&lt;/code&gt; can be called to give &lt;code&gt;4&lt;/code&gt; in the REPL that pops up (when using IDLE at least)&lt;/li&gt;&#xA;&lt;li&gt;The output to STDOUT is only &lt;code&gt;1&lt;/code&gt; in the second case, as the error is written to STDERR&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So I'd like to get the community's opinion on this: &lt;strong&gt;Are either of these types of submissions allowed?&lt;/strong&gt; I'm asking because I've seen this used multiple times, most recently &lt;a href=&quot;https://codegolf.stackexchange.com/a/45571&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="21487" LastEditorUserId="68942" LastEditDate="2021-04-04T03:46:48.990" LastActivityDate="2021-04-04T03:46:48.990" Title="Should submissions be allowed to exit with an error?" Tags="|discussion|faq|policy|answers|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4781" PostTypeId="2" ParentId="4780" CreationDate="2015-02-11T11:42:23.127" Score="24" Body="&lt;p&gt;There are a few different issues and cases to be considered here. I think most of what I wrote below is based on the unwritten rules we're currently applying (as far as I'm aware of them). But a few things are also my own opinion, so let the votes show what you think.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Ignoring STDERR&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As far as I know, this is common practice. What goes to STDERR also depends on error/warning levels and such, so I guess it's easiest to just say that STDERR can be ignored completely, as long as STDOUT has the required output (or the required side effects happen or whatever the challenge asks for).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Throwing Errors and Exceptions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I think this really depends on whether the submissions is a full program, REPL snippet or a function, and in the latter case whether the error happens during function definition or function call.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Full Programs&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I think terminating with an error or an uncaught exception is fine here, as long as it doesn't produce stray output to STDOUT. Under the premise that we're ignoring STDERR, a program terminating with an error still does the job.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;REPL Snippets&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;As long as these don't break stuff so badly that you have to restart the REPL, I think they should be treated the same as full programs. If they produce the right output or side effects, barring STDERR, aborting with an error or exception is fine.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Errors during Function Definition&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(By this I mean &quot;at the time the function is defined&quot;. I.e. if the code snippet provided in the submission throws an error before ever calling the function.)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is the example mentioned in the question. I would say this depends on whether REPL snippets are valid submissions to the challenge (which they are not by default).&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If REPL snippets are valid, I would treat the function definition just as a REPL snippet and the above rules apply.&lt;/li&gt;&#xA;&lt;li&gt;If REPL snippets are not valid (the default), I think this should &lt;em&gt;not&lt;/em&gt; be allowed. If an error is thrown during function definition, this renders the function useless because it can never be called. If an exception is thrown that could be caught, &lt;strong&gt;the necessary try-catch block has to be included in the byte count&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Errors during Function Call&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Again, if the challenge also allows REPL snippets, the REPL rules should apply.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Otherwise, I'm not sure. I would say it depends on whether the error would only abort the function call or the program. If it only aborts the function call that's fine. If it causes an error that aborts the entire program, or it throws an exception &lt;em&gt;(even if it could be caught!)&lt;/em&gt;, then I think this should not be allowed. If people answer with functions, they should take into account that the purpose of functions is to reuse them without restarting the program. If you really want to throw an error, answer with a full program.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;In any case, answers should state explicitly if they are throwing errors. It's part of their interface, and we usually expect good answers to state I/O details as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And, as usual, any challenge author may override any of these defaults if they so wish.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="2867" LastEditDate="2015-03-27T13:31:33.327" LastActivityDate="2015-03-27T13:31:33.327" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4782" PostTypeId="1" AcceptedAnswerId="4785" CreationDate="2015-02-11T12:17:01.030" Score="19" ViewCount="1586" Body="&lt;p&gt;This is related &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/4780/8478&quot;&gt;to Sp3000's question earlier&lt;/a&gt;, but probably a separate issue:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Are programs required to terminate, provided they print the desired output before entering an endless loop and can be proven to never print anything else in the future?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a fake example, consider the following &quot;Hello, World!&quot; submission in JavaScript:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;console.log(&quot;Hello, World!&quot;);&#xA;while(true);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This prints the desired output, and will never print anything else, but it doesn't terminate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;REPL submission snippets and function snippets should also be considered in the answers.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-02-16T22:19:59.763" Title="Do programs have to terminate?" Tags="|discussion|policy|answers|" AnswerCount="3" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="4783" PostTypeId="2" ParentId="4782" CreationDate="2015-02-11T12:22:47.680" Score="21" Body="&lt;p&gt;I think this also needs separate rules for programs and other submissions.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Full Programs&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I believe this is fine, provided the answer comes with a justification for why the submission will only print the required output, nothing more, nothing less.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;REPL Snippets and Functions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In these cases, I think this should not be allowed. The purpose of REPL snippets and functions is that they can be reused without restarting the REPL/program. An endless loop would defeat that purpose. If you want your submission not to terminate, answer with a full program.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;As usual, any challenge author may override any of these defaults if they so wish.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-02-11T12:22:47.680" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4784" PostTypeId="2" ParentId="4780" CreationDate="2015-02-11T12:50:34.120" Score="-2" Body="&lt;h1&gt;Error messages&lt;/h1&gt;&#xA;&lt;p&gt;Here I agree with Martin that programs which produce output on both standard output and standard error streams should be judged solely on the basis of standard output. However, if it is not possible to separate the streams via redirection, the program should be considered incorrect.&lt;/p&gt;&#xA;&lt;h1&gt;Types of errors&lt;/h1&gt;&#xA;&lt;p&gt;I define two types of errors:&lt;/p&gt;&#xA;&lt;h2&gt;1. Recoverable errors&lt;/h2&gt;&#xA;&lt;p&gt;These are errors which the program can recover from within the bounds of standard language semantics and continue execution from the point the function was called. The most common form is an exception which may be caught by a try/catch clause. Another is a warning which causes a message to be written to standard error, but never interrupts program flow.&lt;/p&gt;&#xA;&lt;h2&gt;2. Fatal errors&lt;/h2&gt;&#xA;&lt;p&gt;A fatal error cannot be stopped by standard exception handling mechanisms. Often they generate a signal. Catching an error with a signal handler would not an acceptable method of recovering an error. Other instances of errors may not cause a crash, but are still fatal if there is no way to catch them.&lt;/p&gt;&#xA;&lt;h1&gt;Valid Program Forms&lt;/h1&gt;&#xA;&lt;h2&gt;1. Full Program&lt;/h2&gt;&#xA;&lt;p&gt;A full program should take its input from an external sources such as standard input, command line arguments, or files. It should write the results to standard output.&lt;/p&gt;&#xA;&lt;p&gt;Programs should be allowed to make either kind of error. They should be judged only on the contents of standard output.&lt;/p&gt;&#xA;&lt;h2&gt;2. Functions&lt;/h2&gt;&#xA;&lt;p&gt;Functions take their arguments from within a program. Their output might be returned from the function call, written to a memory area provided by the caller, or printed to standard output.&lt;/p&gt;&#xA;&lt;p&gt;Errors may result at two different times from functions: (I) at definition, or (II) at execution.&lt;/p&gt;&#xA;&lt;h2&gt;(I) Errors during definition&lt;/h2&gt;&#xA;&lt;p&gt;I divide function definitions into three further cases:&lt;/p&gt;&#xA;&lt;h3&gt;a. Code that defines a named function when compiled&lt;/h3&gt;&#xA;&lt;p&gt;This kind of function should not generate any Type I errors, i.e. it should compile successfully.&lt;/p&gt;&#xA;&lt;h3&gt;b. Code that defines a named function when executed&lt;/h3&gt;&#xA;&lt;p&gt;This type of code may generate recoverable errors.&lt;/p&gt;&#xA;&lt;h3&gt;c. An unnamed expression that evaluates to a function (compiled or executed)&lt;/h3&gt;&#xA;&lt;p&gt;The code (if interpreted) should evaluate successfully.&lt;/p&gt;&#xA;&lt;h2&gt;(II) Errors during execution&lt;/h2&gt;&#xA;&lt;p&gt;During executions, functions should be allowed to make recoverable errors, but not fatal errors. It should be possible for a caller to continue execution after calling the function without measures more extreme than a try/catch block. However, it is normally not possible for a function to exit with an error if it also needs to return a value.&lt;/p&gt;&#xA;" OwnerUserId="30688" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-02-11T12:50:34.120" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4785" PostTypeId="2" ParentId="4782" CreationDate="2015-02-11T12:59:07.003" Score="30" Body="&lt;h1&gt;Submissions should always terminate by default&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Personally, I think this is just the neater option, simple as that. If we allow non-terminating submissions, then it'll just feel like a &quot;hidden rule&quot; to new users.&lt;/p&gt;&#xA;" OwnerUserId="21487" LastActivityDate="2015-02-11T12:59:07.003" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="4786" PostTypeId="2" ParentId="4780" CreationDate="2015-02-11T17:27:35.063" Score="6" Body="&lt;p&gt;Let me simplify this a bit.&lt;/p&gt;&#xA;&lt;h2&gt;They can exit with errors after the result is printed (or outputted in other ways)&lt;/h2&gt;&#xA;&lt;p&gt;Error messages in STDERR or those can be disabled in configurations can always be ignored. We are talking about the fatal errors which exits the program.&lt;/p&gt;&#xA;&lt;p&gt;For function definitions, there must be a way to use the function, and retrieve the returned value (if specified in the question) without extra code to rescue from the error. However if the function does not need to return something specific, there is no reason to disallow errors in the function call as we already seemed to be allowing side effects.&lt;/p&gt;&#xA;&lt;p&gt;For REPL it is similar. As long as the error does not stop the REPL from printing (or otherwise using) the result (if the question requires it to return something), it is fine.&lt;/p&gt;&#xA;&lt;p&gt;If the function or REPL command printed something itself, it must really printed, not only into the internal buffer when it exited with an error.&lt;/p&gt;&#xA;&lt;h2&gt;Then there are run-time and syntax errors.&lt;/h2&gt;&#xA;&lt;p&gt;If we allow syntax errors, we'll see bash scripts exiting with &lt;code&gt;)&lt;/code&gt;. But that isn't too useful anyway since it cannot appear in a &lt;code&gt;if&lt;/code&gt; or &lt;code&gt;while&lt;/code&gt; group command. And it's not easy to define syntax errors in every language. I think we should just allow them.&lt;/p&gt;&#xA;&lt;p&gt;Most &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; questions should explicitly state that the program should exit with no errors, which usually means having the exit code 0.&lt;/p&gt;&#xA;&lt;p&gt;Related problem: a Windows Batch file can exit the current program (using &lt;code&gt;goto :eof&lt;/code&gt;), or the whole cmd.exe (using &lt;code&gt;exit&lt;/code&gt;). Both should be fine.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-02-11T17:32:50.520" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4787" PostTypeId="2" ParentId="2140" CreationDate="2015-02-11T23:17:50.647" Score="1" Body="&lt;h1&gt;War of the Partitions&lt;/h1&gt;&#xA;&lt;p&gt;You have been assigned 1000 men to your cause, and you must fight your opponent on 20 different battlefields simultaneously.  You must decide how to split up your 1000 men into 20 ways.  Furthermore, since the Nth battlefield is larger than the (N+1)th battlefield, the 20 partitions must be in non-increasing order.&lt;/p&gt;&#xA;&lt;p&gt;Each battlefield will have a skirmish. If you send more men than your opponent, you win that skirmish.  Winning more skirmishes than your opponent across all battlefields scores you 1 Battle Point.&lt;/p&gt;&#xA;&lt;p&gt;You will then face every other opponent, where you will be allowed to reassign your men to another location.  You have a large supply of necromancers that allow you to keep all of your men alive from battle to battle, so you may allocate all 1000 men every time you face another opponent.&lt;/p&gt;&#xA;&lt;p&gt;You will face each opponent 25 times.  The player with the most Battle Points wins.&lt;/p&gt;&#xA;&lt;h1&gt;IO&lt;/h1&gt;&#xA;&lt;p&gt;You will be passed a string of the history of the battles between you and your current opponent.  Each line consists of a different battle.  The choices will be space separated, and your opponent's choices will be listed first, separated by a comma.  The following input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50,60 59 58 57 56 55 54 53 52 51 49 48 47 46 45 44 43 42 41 40&#xA;50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50,51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 21&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;would represent two battles between a player.  The first one would be a tie (each player won 10 skirmishes), while the second you won a Battle Point by winning 19 skirmishes.&lt;/p&gt;&#xA;&lt;p&gt;You must return a string containing a space separated list of integers.  The total of all of the values must be 1000, and must be in decreasing order.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-02-14T19:13:27.483" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="4789" PostTypeId="2" ParentId="2140" CreationDate="2015-02-12T18:11:19.173" Score="1" Body="&lt;h1&gt;Minimum? Vertex Cover&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;insert definition of (minimum) vertex cover here&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Given a graph, you must output a &lt;em&gt;valid&lt;/em&gt; vertex covering of that graph. The entry with the smallest total size (number of vertices) over five test cases (TBD) wins.&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;Your program will be run with one argument given: a file name. For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;python findacover.py graph_1.txt&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Submissions will read the graph from the file specified. The format of the file will be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;5&#xA;0:1 2 3&#xA;1:0 3&#xA;2:0&#xA;3:0 1 4&#xA;4:3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The first line is simply the number of vertices in the graph (V). The next V lines are the list of vertices. Each line consists of the vertex number and a colon, followed by a space-separated list of vertices connected to that vertex by an edge.&lt;/p&gt;&#xA;&lt;p&gt;Note that each edge will be listed twice, once for each vertex it connects. You can see in the example that the edge connecting &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;3&lt;/code&gt; is present on the line for both vertices.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;Output is simply a list of vertices that represent a valid vertex covering of the input graph. Output should be written to STDOUT (so my validator can score it.&lt;/p&gt;&#xA;&lt;p&gt;I will strip all non-digit, non-space characters (&lt;code&gt;[^0-9 ]&lt;/code&gt;) from your output and interpret the remainder as a space-separated list. For example, outputs  &lt;code&gt;[0, 1, 2, 3]&lt;/code&gt; and &lt;code&gt;0 1 2 3&lt;/code&gt; will be treated the same.&lt;/p&gt;&#xA;&lt;p&gt;For the example graph above:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Valid:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 1 2 3 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;among others.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Invalid:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 1 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This does not cover the graph, since the edge between &lt;code&gt;3&lt;/code&gt; and &lt;code&gt;4&lt;/code&gt; is not covered.&lt;/p&gt;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Submissions will be run once for each graph.&lt;/li&gt;&#xA;&lt;li&gt;You have a time limit of &lt;strong&gt;five minutes&lt;/strong&gt; for each graph. You cannot &amp;quot;roll over&amp;quot; unused time to the next graph. This time is clocked on my computer, an &lt;a href=&quot;http://ark.intel.com/products/65523/Intel-Core-i7-3770K-Processor-8M-Cache-up-to-3_90-GHz&quot; rel=&quot;nofollow noreferrer&quot;&gt;i7-3770K CPU&lt;/a&gt; with 16GB RAM, running Ubuntu 14.04. If you might bump against this limit, make sure you send a &amp;quot;best-yet&amp;quot; output before time is up.&lt;/li&gt;&#xA;&lt;li&gt;Feel free to use multiple threads, but keep it on the CPU. My graphics card is not your playground.&lt;/li&gt;&#xA;&lt;li&gt;Your submission must be deterministic. If you use a PRNG, seed it with a constant value.&lt;/li&gt;&#xA;&lt;li&gt;You cannot use any built-in or third-party function designed to solve vertex covering problems.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply. This means (for example) that you cannot hardcode your submission to these test cases. If I choose five more test cases to run, you should get comparable (obviously not exact) results.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;p&gt;Your score is the number of vertices in your cover. If you return anything except a valid covering, or do not return anything within the time allotted, your score for the graph will be 200000.&lt;/p&gt;&#xA;&lt;p&gt;Score is summed over &lt;strong&gt;five test cases&lt;/strong&gt;, each consisting of a graph with 20k to 100k vertices. The lowest total score wins.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;link to test cases here&amp;gt;&#xA;&amp;lt;insert generator/validator/scorekeeper here&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Sandbox&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Does the &amp;quot;function designed to solve vertex covering problems&amp;quot; need to be better specified? If so, how could I word that?&lt;/li&gt;&#xA;&lt;li&gt;Are the graph sizes and time limits reasonable? They are designed to prevent a straight brute-force attack, but I don't believe they are too large to prevent a good approximation. Are they too &lt;em&gt;small?&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-25T18:47:30.643" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4791" PostTypeId="1" AcceptedAnswerId="4794" CreationDate="2015-02-12T21:26:20.280" Score="7" ViewCount="234" Body="&lt;p&gt;If my language of choice does not have a concept of functions, and the challenge requires a function, can I submit an entire program instead?&lt;/p&gt;&#xA;" OwnerUserId="18487" LastActivityDate="2015-02-13T16:26:47.470" Title="Can I participate if my language of choice does not have functions?" Tags="|discussion|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4793" PostTypeId="2" ParentId="4791" CreationDate="2015-02-12T21:29:11.303" Score="0" Body="&lt;p&gt;Yes. If the challenge requires functions, submitting an entire program is fine if and only if your language of choice does not have functions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should still follow all of the other rules for the challenge. If input is provided via STDIN, you must accept input via STDIN. If input is provided via arguments, your program must accept arguments.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="18487" LastEditDate="2015-02-12T22:09:24.273" LastActivityDate="2015-02-12T22:09:24.273" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4794" PostTypeId="2" ParentId="4791" CreationDate="2015-02-13T07:51:08.050" Score="10" Body="&lt;p&gt;If the language doesn't have anything called a function, but has a close equivalent, you can submit that instead. I'm thinking of Golfscript and relatives' code blocks, but I'm sure many languages have them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Close equivalents should have the option of taking an input and giving an output, though these do not need to be used in the code itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If no construct in the language can take an input and give an output, then the language (unfortunately) cannot be used.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="20080" LastEditDate="2015-02-13T16:26:47.470" LastActivityDate="2015-02-13T16:26:47.470" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="4795" PostTypeId="2" ParentId="202" CreationDate="2015-02-13T07:54:35.860" Score="3" Body="&lt;h1&gt;Pyth&lt;/h1&gt;&#xA;&lt;p&gt;Online: &lt;a href=&quot;https://pyth.herokuapp.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://pyth.herokuapp.com/&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Download: &lt;a href=&quot;https://github.com/isaacg1/pyth&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://github.com/isaacg1/pyth&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Call with&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;python3 pyth.py &amp;lt;program&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-02-13T07:54:35.860" CommentCount="0" CommunityOwnedDate="2015-02-13T07:54:35.860" ContentLicense="CC BY-SA 3.0" />
  <row Id="4800" PostTypeId="2" ParentId="4782" CreationDate="2015-02-16T22:19:59.763" Score="-5" Body="&lt;h1&gt;The user must be able to terminate the program in the program itself&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Not by sending signals like using Ctrl+C, or killing the process.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think we probably don't really care, but want to reduce some pain for people testing their submissions.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2015-02-16T22:19:59.763" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4803" PostTypeId="2" ParentId="2140" CreationDate="2015-02-19T00:12:16.907" Score="1" Body="&lt;h1&gt;Code File Header&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Do you have a large number of source files that you forgot to put a header on, but never bothered. Well then this challenge is for you!&#xA;This is code golf, so shortest program that works wins.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a function (if your language doesn't support this, write a program, that accepts a cmd line arg for the file name) that takes the name of a file then attaches to the top of that file a comments section stating the name of the author, the current date, and the file name, as comments in your language (if your language supports comments, if not then in C-Style/Doxygen).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance, if your language was &lt;code&gt;C/C++&lt;/code&gt; the following must be appended at the top.&#xA;using myself as the example.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;/** \author Henry Schmale&#xA; * \date 2015-02-19&#xA; * \file [File Name]&#xA; */&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Notes&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may subtract the length of your name from your submission.&lt;/li&gt;&#xA;&lt;li&gt;Languages that don't support file I/O are not eligible for this code golf.&lt;/li&gt;&#xA;&lt;li&gt;The date code should be in a human readable format, no unix time. Preferably in ISO format.&lt;/li&gt;&#xA;&lt;li&gt;if your language supports multiple comment formats, you may use either or so long as the final result is the same, a documentation header on that file.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="36073" LastEditorUserId="36073" LastEditDate="2015-02-21T00:56:04.537" LastActivityDate="2015-02-21T00:56:04.537" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="4804" PostTypeId="2" ParentId="2140" CreationDate="2015-02-19T08:39:20.773" Score="0" Body="&lt;h1&gt;Random distribution in array with exact number of occurences and max size&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program or a function, that takes 3 inputs &lt;code&gt;x y z&lt;/code&gt;, where : &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;x&lt;/code&gt; is an integer representing the max size of each output array.&lt;br /&gt;&#xA;&lt;code&gt;y&lt;/code&gt; is an integer representing the exact number of occurence of each &lt;code&gt;z&lt;/code&gt; value.&lt;br /&gt;&#xA;&lt;code&gt;z&lt;/code&gt; is a set of &lt;code&gt;n&lt;/code&gt; integers to distribute&lt;/p&gt;&#xA;&#xA;&lt;p&gt;and outputs a set of arrays containing &lt;code&gt;z&lt;/code&gt; values randomly distributed (each array must be unique, different ordered array are not the same).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each value of &lt;code&gt;z&lt;/code&gt; can only appear once in each output array&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x&lt;/code&gt; value is between &lt;code&gt;2&lt;/code&gt; and &lt;code&gt;10&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;y&lt;/code&gt; value is between &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;10&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;n&lt;/code&gt; is between &lt;code&gt;2&lt;/code&gt; and &lt;code&gt;50&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;z&lt;/code&gt;'s &lt;code&gt;n&lt;/code&gt; values are between &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;50&lt;/code&gt; &lt;/li&gt;&#xA;&lt;li&gt;If and only if &lt;code&gt;n * y&lt;/code&gt; isn't divisible by &lt;code&gt;x&lt;/code&gt; you can output one array with less than &lt;code&gt;x&lt;/code&gt; elements&lt;/li&gt;&#xA;&lt;li&gt;&quot;Random&quot; means that every possible output must be produced with finite probability (barring the finite length of the PRNG's cycle)&lt;/li&gt;&#xA;&lt;li&gt;You can assume valid inputs, and there will always be at least 1 possible solution&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input :&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4 5 [0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output :&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[3 18 16 10][9 0 2 11][6 12 0 9][15 16 10 4][4 17 16 14][14 3 15 2][5 4 7 16][17 5 0 13][13 11 7 6][2 9 8 12][5 13 7 2][7 1 8 14][11 19 17 0][17 19 6 13][3 1 5 15][15 18 0 7][19 14 18 10][1 16 10 9][1 12 14 10][9 15 4 12][8 4 3 5][19 11 18 3][13 12 17 11][6 1 8 19][18 8 2 6]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4 5 [0 1 2 3 4]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[0 3 2 1][0 3 2 4][3 2 1 4][2 0 1 3][1 0 3 4][4 2 0 1][4]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Winning Criterion&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is code-golf so the shortest answer wins.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Note&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is actually based on SO question that I asked, and you can find a Java implementation here : &lt;a href=&quot;https://stackoverflow.com/questions/28544808/random-distribution-of-items-in-list-with-exact-number-of-occurences&quot;&gt;https://stackoverflow.com/questions/28544808/random-distribution-of-items-in-list-with-exact-number-of-occurences&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Definition of random : Should I accept output that contain same &quot;subset&quot; array ordered differently?&#xA;Output format : How can I better define the output expected?&lt;/p&gt;&#xA;" OwnerUserId="33006" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2015-02-19T12:38:10.330" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="4812" PostTypeId="2" ParentId="3626" CreationDate="2015-02-23T08:06:15.413" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/42890/8478&quot;&gt;Construct a graph&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I think most, if not all, of &lt;a href=&quot;https://codegolf.stackexchange.com/users/32014/zgarb&quot;&gt;Zgarb's&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges are exceptionally well presented (and most of them follow the same format):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Clear description of the challenge's background, along with all necessary definitions.&lt;/li&gt;&#xA;&lt;li&gt;Clear input/output specification.&lt;/li&gt;&#xA;&lt;li&gt;Very importantly, a good set of test cases which covers all relevant edge cases.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2015-02-23T08:06:15.413" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4813" PostTypeId="2" ParentId="2140" CreationDate="2015-02-24T03:35:17.500" Score="-3" Body="&lt;h1&gt;Something Else - ASCII Art maker:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A text to ASCII art generator maker, the program must input a string and return ASCII art from it. Something like &lt;a href=&quot;http://patorjk.com/software/taag/&quot; rel=&quot;nofollow&quot;&gt;patorjk.com/software/taag/&lt;/a&gt;. It has to use the Graffiti font. The winning criteria is the whoever gets the most likes.&lt;/p&gt;&#xA;" OwnerUserId="36842" LastEditorUserId="36842" LastEditDate="2015-02-24T06:09:54.517" LastActivityDate="2015-02-24T06:09:54.517" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4814" PostTypeId="2" ParentId="2140" CreationDate="2015-02-24T12:18:48.170" Score="1" Body="&lt;p&gt;&lt;em&gt;I'm only posting this in the sandbox because it may be too broad, even for a pop-con. If it gets some support I'll post it very soon.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Generating Postmodernist Writing and Other Logorrhea&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Postmodernism&quot; rel=&quot;nofollow noreferrer&quot;&gt;Postmodernist&lt;/a&gt; writings are known for dealing with highly abstract ideas, potentially in a &lt;a href=&quot;http://en.wikipedia.org/wiki/Verbosity&quot; rel=&quot;nofollow noreferrer&quot;&gt;verbose&lt;/a&gt; manner that may sound nonsensical to someone reading them. This type of writing is often called &lt;em&gt;logorrhea&lt;/em&gt;, and is not limited to postmodernism.&lt;/p&gt;&#xA;&lt;p&gt;People have made programs that use &lt;a href=&quot;http://en.wikipedia.org/wiki/Natural_language_processing&quot; rel=&quot;nofollow noreferrer&quot;&gt;natural language processing&lt;/a&gt; to generate realistic looking academic writings that are actually utter nonsense.&#xA;One example is the &lt;a href=&quot;http://www.elsewhere.org/pomo/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Postmodernism Generator&lt;/a&gt; (&lt;a href=&quot;http://en.wikipedia.org/wiki/Postmodernism_Generator&quot; rel=&quot;nofollow noreferrer&quot;&gt;wiki&lt;/a&gt;), which creates a random postmodernist essay every time the page is loaded. Another example is &lt;a href=&quot;http://pdos.csail.mit.edu/scigen/&quot; rel=&quot;nofollow noreferrer&quot;&gt;SCIgen&lt;/a&gt; (&lt;a href=&quot;http://en.wikipedia.org/wiki/SCIgen#Spoofing_Google_Scholar_and_h-index_calculators&quot; rel=&quot;nofollow noreferrer&quot;&gt;wiki&lt;/a&gt;), which can generate random papers about computer science.&lt;/p&gt;&#xA;&lt;p&gt;Your task in this popularity contest is to write a program that can generate random, convincing paragraphs of academic logorrhea. You can choose what topic your program will generate text about. Postmodernism, CS, math, physics, and philosophy seem to be likely choices, but you can choose something else.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program must be able to take in a 32 bit integer (a value from 0 to 2&lt;sup&gt;32&lt;/sup&gt;-1) as a seed value and output a random paragraph of text on your topic. None of the 2&lt;sup&gt;32&lt;/sup&gt; outputs should be identical. (If desired, you can include an option for no input, where the seed number is just chosen randomly.)&lt;/li&gt;&#xA;&lt;li&gt;The paragraphs should be from 2 to 8 sentences long and between 300 and 1000 characters. The sentences should start with capitals and end with periods. Including other punctuation is optional.&lt;/li&gt;&#xA;&lt;li&gt;The actual content of the sentences &lt;strong&gt;does not need to make grammatical sense&lt;/strong&gt;, though it should consist of real English words. Presumably, the more it does make sense the more it will be upvoted.&lt;/li&gt;&#xA;&lt;li&gt;You do not need to include author names or citations like the &lt;a href=&quot;http://www.elsewhere.org/pomo/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Postmodernism Generator&lt;/a&gt; does. You could though, and you are welcome to take some liberties and generate a full essay or a mini-paper or something if it's clear that what you're doing is more difficult that just generating a paragraph.&lt;/li&gt;&#xA;&lt;li&gt;You may use any &lt;a href=&quot;http://en.wikipedia.org/wiki/Natural_language_processing&quot; rel=&quot;nofollow noreferrer&quot;&gt;NLP&lt;/a&gt; libraries or resources, provided they don't already automatically generate random academic text. e.g. taking a paragraph from a random &lt;a href=&quot;http://pdos.csail.mit.edu/scigen/&quot; rel=&quot;nofollow noreferrer&quot;&gt;SCIgen&lt;/a&gt; paper would not be allowed at all.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The highest voted answer wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-02-24T12:26:38.213" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="4815" PostTypeId="1" CreationDate="2015-02-24T12:41:32.523" Score="7" ViewCount="122" Body="&lt;p&gt;I haven't created a duplicate question... and I don't even want it to be necessarily reopened. I'd just like to be able to post an answer (either to it, or to the supposed &quot;original&quot; question)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Obviously, as it almost always happens... duplicates aren't perfect duplicates, and in this case there's a rule in the new question (that I'd obviously exploit) that'd disqualify my code in the original one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How should I do it? I'd prefer to have to avoid defending myself (and inevitably receiving downvotes) on the &quot;original&quot; question, due to not exactly following its rules (after all, I'm already pre-emptively kind-of defending myself here)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the same time, due to the (imo unreasonable) reputation requirements, I cannot even cast a single re-open vote, so that wouldn't work as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Recreating a question by explicitly specifying the caveat that imho differentiates the queston is very likely to -at best- get the new question closed (a waste of time without any useful outcome) and -at worst- to actually receive some downvotes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should I just give up?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thanks&lt;/p&gt;&#xA;&#xA;&lt;p&gt;PS: here's the link to the latest such question I found: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4386/python-reverse-polish-notation?rq=1&quot;&gt;Python - Reverse Polish Notation&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="18443" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-02-24T14:27:04.953" Title="Answering a not-quite-duplicate" Tags="|discussion|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4816" PostTypeId="1" AcceptedAnswerId="4817" CreationDate="2015-02-24T15:15:47.703" Score="17" ViewCount="785" Body="&lt;p&gt;We've recently received &lt;a href=&quot;https://codegolf.stackexchange.com/q/46984/3808&quot;&gt;a Vim golf question&lt;/a&gt; that's sparked a bit of controversy as to whether Vim golf, or &quot;editor golf&quot; in general, is on-topic here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should Vim, Emacs, or editor golf in general be allowed?&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2015-03-01T20:36:19.587" Title="Is editor golf on-topic?" Tags="|discussion|scope|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="4817" PostTypeId="2" ParentId="4816" CreationDate="2015-02-24T15:15:47.703" Score="21" Body="&lt;p&gt;&lt;strong&gt;Yes&lt;/strong&gt;, I think &quot;editor golf&quot; is perfectly on-topic here, assuming solutions are submitted entirely in keystrokes and not, for example, with mouse clicks or menu buttons.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Vim, Emacs, and most other text-based editors have a way to execute arbitrary keystrokes, making a sequence of keystrokes almost like a &quot;program.&quot; For example, one can execute Vim keystrokes from the command line like so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$ echo 'Input' &amp;gt; file.txt&#xA;$ vim '+normal (enter keystrokes here...)' '+wq' file.txt&#xA;$ cat file.txt  # output&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or, they can be &lt;code&gt;noremap&lt;/code&gt;ped to a key and this key can be pressed within Vim to &quot;run&quot; the &quot;program.&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It's an objective winning criterion. &quot;Least keystrokes&quot; is just as effective as &quot;least characters.&quot; Kind of like a specialized &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Some may argue that Vim, Emacs, or other editor keystrokes should not be considered a &quot;programming language.&quot; However, we can take the premise that, for example, regex solutions are considered on-topic here. Vim can apply regular expression substitutions to the input file, making Vim a superset of regex. Hence, Vim should be considered a programming language as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Specifically, from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/3808&quot;&gt;our semi-&quot;official&quot; definition of a programming language&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Support a representation of natural numbers and of tuples&lt;/strong&gt; - Yes. Vim can handle numbers via &lt;code&gt;&amp;lt;C-a&amp;gt;&lt;/code&gt; and &lt;code&gt;&amp;lt;C-x&amp;gt;&lt;/code&gt; (or with regex), and typically operates linewise, making the entire file effectively a &quot;tuple&quot; with each line acting as an element.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Be able either to transform inputs into outputs&lt;/strong&gt; - We can stop right here, because of course Vim can transform an input file into a distinct output file.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Be able to take two natural numbers and add them&lt;/strong&gt; - Vim can do this with several methods: using certain lines within Vimscript expressions themselves (with &lt;code&gt;getline&lt;/code&gt;), using Vim's built-in Python or Ruby capabilities (hey, more proof that Vim is a superset of other languages), editing lines into Vimscript, yanking them, and executing them via &lt;code&gt;@&lt;/code&gt;, etc.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Be able to take a natural number and say whether or not it is a prime&lt;/strong&gt; - Same as above.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Another argument is that all answers here should contain code, and keystrokes are not code. I'd argue that keystrokes &lt;em&gt;are&lt;/em&gt; indeed code, as Vim, Emacs, etc. can be programmed (via their &lt;code&gt;.vimrc&lt;/code&gt; or &lt;code&gt;.emacs&lt;/code&gt; files) in terms of keystrokes, and Vimscript/Elisp are their own programming languages.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2015-03-01T20:36:19.587" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="4819" PostTypeId="2" ParentId="2140" CreationDate="2015-02-25T00:24:41.613" Score="0" Body="&lt;h1&gt;Can you reach this chess position?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;This is currently a stub. If it makes sense I will write it out.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should write a program which given a chess position outputs a list of moves (white and black alternating) with which the given position can be reached from the standard starting position. Your goal is to minimize the number of moves.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input details:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;will be in following the format (but of course not the staring position):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;rnbqkbnr&#xA;pppppppp&#xA;........&#xA;........&#xA;........&#xA;........&#xA;PPPPPPPP&#xA;RNBQKBNR&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Inputs will be chosen from random positions of random low-level games (~1200 Elo).&lt;/li&gt;&#xA;&lt;li&gt;You only have to reach the given position with legal moves. You don't have to care if any castling or en-passant was available in the input.&lt;/li&gt;&#xA;&lt;li&gt;You can choose whose turn it is.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output details:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is a list of &lt;code&gt;[a-f][1-8] [a-f][1-8][qrbn]?&lt;/code&gt; (&lt;code&gt;[qrbn]?&lt;/code&gt; is for promotion, if there is a standard notation for it, that will be used).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Other details:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Running time of your program should not take more than one minute on your computer.&lt;/li&gt;&#xA;&lt;li&gt;Program shouldn't be longer than 50Kb. &lt;em&gt;(this is against hardcoding databases thought that might wouldn't help &lt;strong&gt;that much&lt;/strong&gt;)&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are disallowed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Sum of the moves (half-moves) for the 20 provided inputs. If hardcoding happens those are subject to change. If a program can't reach a given input in 1 minute it's score is 300 for that testcase.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Sandbox notes:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;A validator would be useful. I can't do a JS snippet but maybe I can hack together a python3 one.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(You don't have to implement castling, en-passant, promotion if you don't want to and still can get a great entry.)&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="7311" LastEditorUserId="7311" LastEditDate="2015-02-25T01:11:11.367" LastActivityDate="2015-02-25T01:11:11.367" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="4820" PostTypeId="1" AcceptedAnswerId="4821" CreationDate="2015-02-25T20:36:38.723" Score="0" ViewCount="68" Body="&lt;p&gt;I am about to write a puzzle, but I don't know what type it should be. I think of Code Golf, but perhaps it needs to allow libraries. Then, I don't know whether and how much I should penalize the use of a library (e.g. triple your score if you used a library)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can I initially omit the puzzle type, link to Meta to let people vote for a puzzle type (using predefined Community Wiki answers) and then later update the puzzle to define the actual type?&lt;/p&gt;&#xA;" OwnerUserId="16901" LastActivityDate="2015-02-25T20:53:55.207" Title="Can I use Meta to vote for the type of my puzzle?" Tags="|support|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4821" PostTypeId="2" ParentId="4820" CreationDate="2015-02-25T20:43:50.770" Score="13" Body="&lt;p&gt;I don't think that's a good idea. Why would you post the question already if no one can actually answer it at that point (since the rules aren't even decided yet)?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is exactly what the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/8478&quot;&gt;sandbox&lt;/a&gt; is for. You post the challenge spec there and include a couple of notes at the bottom about which things still need to be decided and what the options are. This way you can get some feedback from the community about the most reasonable choice. And if there are still arbitrary choices to be made you can use the comments on your proposal for polling. Once the challenge is finalised you can move it over to main.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2056/8478&quot;&gt;this FAQ post&lt;/a&gt; for more information about the sandbox.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You're also very welcome to join &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;the chatroom&lt;/a&gt; to discuss challenge ideas, which is a bit more appropriate for extended discussion than comments in the sandbox, but even in that case it helps if you have the spec in the sandbox, so people have something to look at.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-02-25T20:53:55.207" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4825" PostTypeId="1" AcceptedAnswerId="4827" CreationDate="2015-02-26T03:12:56.723" Score="4" ViewCount="127" Body="&lt;p&gt;A number of times now I have posted challenges where a rectangular block of text is the submission requirement. These are usually &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples: (other users surely have some too)&lt;br&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/47063/26997&quot;&gt;Sierpinskified Code&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/35974/26997&quot;&gt;Code that runs the Game of Life on itself&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/33150/26997&quot;&gt;Write a Rectangular Program that Outputs the Number of Times it was Rotated&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The area of the submitted text block (width times height, excluding the newlines) is the score for these challenges. The smallest area winning.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Tagging them &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is not entirely accurate since the byte/character count of the text blocks is not the score unless you remove the newlines (many times I have noticed answers with incorrect score calculations). Tagging them &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; may be technically more accurate, but the challenge is still about minizing the amount of code, which is why I've tagged some &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Could we benefit ftom a new tag that indicates this &quot;text-block scoring&quot;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I personally have no strong feelings either way.)&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-02-26T10:22:14.343" Title="Would we benefit from a tag that indicates a text-block scoring criterion?" Tags="|discussion|tags|" AnswerCount="3" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4826" PostTypeId="2" ParentId="4825" CreationDate="2015-02-26T03:14:23.730" Score="-4" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;We would benefit. (We'd still need to name the tag of course.)&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-02-26T03:14:23.730" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4827" PostTypeId="2" ParentId="4825" CreationDate="2015-02-26T03:15:35.047" Score="17" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;This would be unnecessary. We should tag them as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; since that's what they essentially are.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-02-26T03:15:35.047" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4828" PostTypeId="2" ParentId="4825" CreationDate="2015-02-26T03:17:11.743" Score="-8" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;This would be unnecessary. But we should tag them as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; and be sure to explain that the smallest area wins.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-02-26T03:17:11.743" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4829" PostTypeId="1" AcceptedAnswerId="4831" CreationDate="2015-02-27T14:40:08.593" Score="25" ViewCount="1064" Body="&lt;p&gt;We're occasionally getting questions which ask people to write harmful code. This used to be big when &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1514/8478&quot;&gt;code trolling&lt;/a&gt; was a thing, but it's not limited to that. Every now and then there are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; challenges or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contests&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contests&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contests&lt;/a&gt; which ask participants to write malicious code (which may or may not be disguised as harmless code). And in principle, there's nothing stopping someone from posting a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; to wreck the PC the submission is run on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I tend to downvote these, because I think it's generally not a good idea to produce this kind of code here. Furthermore, no one can even really test the answers, because you'd have to properly sandbox the environment which can be either near impossible or just way too much effort.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But should these actually be on topic to begin with? Do we want questions like that? And if not, could we get a new close vote reason?&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2015-02-27T16:58:02.537" Title="Should asking for malicious code be on topic?" Tags="|discussion|challenges|scope|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4830" PostTypeId="2" ParentId="4829" CreationDate="2015-02-27T14:40:08.593" Score="13" Body="&lt;p&gt;As I said in the question, I'm not a fan of these, and would prefer if they were simply off-topic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That being said, I think they violate &lt;a href=&quot;http://stackexchange.com/legal/terms-of-service&quot;&gt;3(e) of Stack Exchange's Terms of Service&lt;/a&gt;. But even if you could throw that hammer at every such question, it would still be nice to have an explicit close vote reason, since we do get these at least every other month (I think), and there are enough people who find it funny and reopen such questions if they are closed as too broad or something else. If the close vote was a big banner saying &quot;asking for malware is off topic and answers would violate the ToS&quot; that might be more convincing to keep such questions off the site.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-02-27T14:40:08.593" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="4831" PostTypeId="2" ParentId="4829" CreationDate="2015-02-27T15:57:30.357" Score="36" Body="&lt;p&gt;I don't think this is a frequent enough issue to warrant using one of the custom close reason slots. But I do think it's a big enough issue to warrant not only a downvote and a close vote but also a delete vote. Having questions which ask for malicious code can only be detrimental to the reputation of this community, so they should be expunged as quickly as possible.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2015-02-27T15:57:30.357" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4834" PostTypeId="2" ParentId="2140" CreationDate="2015-02-28T16:40:51.537" Score="0" Body="&lt;h1&gt;Find the Point of Maximum Light&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://www.khanacademy.org/computer-programming/light/6244031630934016&quot; rel=&quot;nofollow&quot;&gt;this&lt;/a&gt; program, this challenge is about finding the point where the mouse should be placed, given an input in a form which will be specified later, in order to color the most pixels yellow.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The above link will bring you to a program with a hexagon, a triangle, and a line. When the mouse is moved over the shapes, light rays shine from the mouse and the various shapes absorb the light.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input is given in this format: &lt;code&gt;[250,200,150,100 250,200,300,120 150,100,300,120] [250,350,350,250]&lt;/code&gt; (Compare to the &lt;code&gt;lines&lt;/code&gt; array in the aforementioned program). Your program is to assume the perimeter (&lt;code&gt;[0,0,400,0 0,0,0,400 400,0,400,400 0,400,400,400]&lt;/code&gt;) is always present.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, so the shortest code wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;NOTE:&lt;/strong&gt; please tell me if I can clarify my question.&lt;/p&gt;&#xA;" OwnerUserId="36860" LastActivityDate="2015-02-28T16:40:51.537" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="4837" PostTypeId="2" ParentId="2140" CreationDate="2015-03-03T14:16:54.387" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/47539/25180&quot;&gt;Find the maximum of ax+b&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h1&gt;Find the maximum of ax+b online&lt;/h1&gt;&#xA;&lt;p&gt;You are given a list of (&lt;em&gt;a,b&lt;/em&gt;), and a list of &lt;em&gt;x&lt;/em&gt;. Compute the maximum &lt;em&gt;ax+b&lt;/em&gt; for each &lt;em&gt;x&lt;/em&gt;. You can assume &lt;em&gt;a&lt;/em&gt;, &lt;em&gt;b&lt;/em&gt; and &lt;em&gt;x&lt;/em&gt; are non-negative integers.&lt;/p&gt;&#xA;&lt;p&gt;But this time, items in the list are added dynamically. Your program should support the following operations (you can rename the operations if that's convenient):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;Add a,b&lt;/code&gt;, to insert (&lt;em&gt;a,b&lt;/em&gt;) into the list.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Query x&lt;/code&gt;, to find the maximum &lt;em&gt;ax+b&lt;/em&gt; in the current list, with the given &lt;em&gt;x&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Your program or function must run in expected (to the randomness if your code involves that, not the input) &lt;strong&gt;O(&lt;em&gt;nlogn&lt;/em&gt;) time&lt;/strong&gt; where &lt;em&gt;n&lt;/em&gt; is the total input length (or total number of operations).&lt;/p&gt;&#xA;&lt;p&gt;You can write a complete program, a function, a list of functions or methods doing each operation, or a function taking one operation each time. For the later two cases, you can either return or print the result after each operation, or add an &amp;quot;output&amp;quot; operation, or output automatically when the program ends.&lt;/p&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;(will be added later.)&lt;/p&gt;&#xA;&lt;p&gt;This is code-golf. Shortest code wins.&lt;/p&gt;&#xA;&lt;h3&gt;Note about the complexity:&lt;/h3&gt;&#xA;&lt;p&gt;If you used a builtin having a good average-case complexity, and it can be randomized to get the expected complexity easily in theory, you can assume your language did that.&lt;/p&gt;&#xA;&lt;p&gt;That means, if your program can be tested to be O(&lt;em&gt;nlogn&lt;/em&gt;) (in theory), with edge cases for your code, but not the implementation of your language, we'll say it is O(&lt;em&gt;nlogn&lt;/em&gt;).&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-23T16:36:21.193" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="4842" PostTypeId="1" CreationDate="2015-03-04T03:19:09.900" Score="18" ViewCount="621" Body="&lt;p&gt;This is a poll to find out the general concensus on the effectiveness of our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;Sandbox for Proposed Challenges&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To participate, up-vote exactly one of the answers below. There are only &quot;Yes&quot; and &quot;No&quot; answers. There is intentionally no &quot;Maybe&quot; answer, choose &quot;Yes&quot; or &quot;No&quot; as best you can.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By &quot;effective&quot; I mean that the Sandbox does what it's supposed to and provides a place where users can test out their challenges and get consistent, constructive feedback. Feedback that, if followed, will keep their question from being closed when posted, and will fix any potentially confusing parts. (To me, this is the &lt;em&gt;minimum&lt;/em&gt; of what the feedback should do. Making the challenge more interesting and up-vote worthy is a step above this.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may think the Sandbox is effective and yet think that it could be much improved.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may think the Sandbox is not effective, and yet think that we have no better way to do it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answer this poll with regard to your personal opinion on the general effectiveness of the Sandbox as it stands now. &lt;strong&gt;This is not a poll asking whether or not we should change the Sandbox in any way&lt;/strong&gt;, this is just a gauge for what the general feeling is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Motivation: I'm asking this because I've always been skeptical about the Sandbox. Many of the sandboxed challenges (there are nearly 900, though of course only a few are still active) have little or no feedback, which may discourage users from ever posting them. I've used the Sandbox 5-10 times but have had plenty of success not bothering with it at all, even at the very start of my PPCG days. I realize I'm an exceptional case, which is why I'm not participating in the poll, but I'm interested in what everyone else thinks.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2019-05-05T02:49:48.527" Title="Is The Sandbox Effective?" Tags="|discussion|sandbox|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="4843" PostTypeId="2" ParentId="4842" CreationDate="2015-03-04T03:19:09.900" Score="33" Body="&lt;h1&gt;Yes, I think the Sandbox is effective&lt;/h1&gt;&#xA;&lt;p&gt;You may comment on this answer listing the numbers of the reasons you think the Sandbox is effective:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;I regularly use the sandbox to improve my challenges.&lt;/li&gt;&#xA;&lt;li&gt;I regularly see posted challenges that were improved by their time in the Sandbox.&lt;/li&gt;&#xA;&lt;li&gt;I regularly see the Sandbox weed out bad/duplicate challenges.&lt;/li&gt;&#xA;&lt;li&gt;I'm too lazy to prepare an entire question at once, so I write some of it in the Sandbox, and then finish it a year later.&lt;/li&gt;&#xA;&lt;li&gt;It gives people a chance to attempt my challenge before posting answers &amp;quot;for real&amp;quot;, which can help uncover holes in spec way more effectively than any careful reading.&lt;/li&gt;&#xA;&lt;li&gt;It gives new and upcoming question writers a chance to improves both themselves and their questions. &lt;sub&gt;This cycle eventually leads them to believe that Sandbox is not effective anymore :)&lt;/sub&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;You are welcome to add to this list.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-03-13T18:13:30.243" CommentCount="5" CommunityOwnedDate="2015-03-04T03:19:09.900" ContentLicense="CC BY-SA 3.0" />
  <row Id="4844" PostTypeId="2" ParentId="4842" CreationDate="2015-03-04T03:19:28.033" Score="26" Body="&lt;h1&gt;No, I don't think the Sandbox is effective&lt;/h1&gt;&#xA;&lt;p&gt;You may comment on this answer listing the numbers of the reasons you think the Sandbox is not effective:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;My sandbox posts have received little or no feedback, leaving them in an uncertain limbo.&lt;/li&gt;&#xA;&lt;li&gt;I regularly see decent sandbox posts with little or no feedback.&lt;/li&gt;&#xA;&lt;li&gt;I have had plenty of success posting challenges directly to the main page without using the Sandbox.&lt;/li&gt;&#xA;&lt;li&gt;Sometimes well-sandboxed questions are found to have significant flaws after being posted, sometimes immediately.&lt;/li&gt;&#xA;&lt;li&gt;I hate it when people write their entire program while my question is still in the Sandbox, and then answer immediately when I post it to main.&lt;/li&gt;&#xA;&lt;li&gt;There's no guarantee that the right people will see my post in the sandbox, and the reception on the sandbox might be more positive or more negative than it would be as an officially posted question.&lt;/li&gt;&#xA;&lt;li&gt;Sort by active means that if a post doesn't get much feedback, it fades away to the bottom of the page and is rarely seen&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;You are welcome to add to this list.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-05-05T02:49:48.527" CommentCount="11" CommunityOwnedDate="2015-03-04T03:19:28.033" ContentLicense="CC BY-SA 4.0" />
  <row Id="4845" PostTypeId="1" AcceptedAnswerId="4861" CreationDate="2015-03-04T10:30:29.563" Score="7" ViewCount="255" Body="&lt;p&gt;I would like to make a code challenge (or a new type of challenge), which is based on code size, but in a &quot;dual&quot; way to code-golf: code size is limited, and the winner is whoever makes the best code (with some objective definition of &quot;best&quot;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Something like &lt;a href=&quot;https://codegolf.stackexchange.com/q/35569/25315&quot;&gt;this&lt;/a&gt; challenge (which was awesome) but with an objective winning criterion and without language restrictions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To allow verbose languages like Java, I would like to make the codesize limit large enough (400 bytes?). However, with this code size, code in languages like Golfscript would have a vast advantage. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/185/25315&quot;&gt;This is not bad by itself&lt;/a&gt;, but I think Golfscript code larger than 100 bytes cannot be awesome because it's too complex.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, I am asking this question, which attempts to set reasonable codesize limits for different languages. How can we make such a list (for all possible programming languages)? How big can it be? Is it a good idea at all?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I am thinking about taking the 20 highest-voted codegolf questions with answers in many languages, and somehow averaging the best codegolf scores for each language)&lt;/p&gt;&#xA;" OwnerUserId="25315" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-03-09T14:30:56.610" Title="Code challenge - do your best with limited code size. How much to allow?" Tags="|discussion|code-golf|code-challenge|handicap|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4846" PostTypeId="2" ParentId="4845" CreationDate="2015-03-04T11:42:16.340" Score="4" Body="&lt;p&gt;I like the idea of size limit questions, and I like the idea of setting a number of different guideline sizes based on problem type so people have an optional starting point when setting their own questions. However, &lt;strong&gt;I do not think setting different limits for different languages is a good idea.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The advantage that one language has over another varies from one problem to the next, and an innovative approach may swing this balance wildly in one direction or another even within a single question. Trying to take account of this in advance of the question being answered is almost meaningless.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What might be more useful in order to promote healthy competition between different languages is to measure size in a different way. For example, counting tokens instead of bytes, for some useful definition of tokens (perhaps keywords, code blocks and bytes of data, with delimiters for code blocks and data not counted - that could be a separate meta question...).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This can still have problems where it is unclear how to apply that measurement to a language that stands out as an exception. In many cases, I would expect the simplest approach to work perfectly well. Just restrict the total number of bytes, regardless of language. Bear in mind that despite the disadvantage, most golf questions still have answers in a variety of verbose languages, not just the golfing languages. People like competing, whether they have a chance to win overall or not.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2015-03-04T11:52:53.053" LastActivityDate="2015-03-04T11:52:53.053" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="4849" PostTypeId="2" ParentId="2140" CreationDate="2015-03-05T15:58:42.550" Score="0" Body="&lt;h2&gt;Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm not sure how or if this can even work in any language, but I figured I'd toss the idea up here for someone else to flesh out in case it's actually viable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;&lt;a href=&quot;https://en.wikipedia.org/wiki/Buffalo_buffalo_Buffalo_buffalo_buffalo_buffalo_Buffalo_buffalo&quot; rel=&quot;nofollow noreferrer&quot;&gt;Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo&lt;/a&gt;&quot; is a grammatically correct American English sentence. This is possible because there are three different meanings of the word &quot;buffalo&quot; (or &quot;Buffalo&quot;) used in the sentence, and some other words and punctuation are implied rather than explicitly included.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think this would be a great code challenge to issue, if it is at all possible. It may not be proper for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, but that would put an interesting spin on it as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The objective would be to create a script or program which is made up only of a single command, or sequence of commands, which is identically repeated throughout the source. No other code is permitted to fill or wrap the repeated piece. Within the script or program, those commands must do something in at least three different ways (or do three totally different somethings) despite being written exactly the same (perhaps with some allowance for deviations in capitalization, such as in the actual sentence) for every iteration.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A fictitious (and obviously invalid) PowerShell example is below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;echo 'buffalo';echo 'buffalo';echo 'buffalo';&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;buffalo&lt;br&gt;&#xA;  Buffalo&lt;br&gt;&#xA;  BUFFALO&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;(Note: The Output could be easily achieved by simply modifying the capitalization of &quot;buffalo&quot; within the script, but that would be in violation of the spirit of the challenge - such deviations, if permitted at all, should not be allowed in string literals.)&lt;/p&gt;&#xA;" OwnerUserId="9387" LastEditorUserId="9387" LastEditDate="2015-03-05T16:03:44.490" LastActivityDate="2015-03-05T16:03:44.490" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4851" PostTypeId="1" CreationDate="2015-03-05T22:27:36.730" Score="0" ViewCount="115" Body="&lt;p&gt;The question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/41719/find-in-given-n&quot;&gt;Find i^n, given n&lt;/a&gt; does not clearly state whether the solution must be a compilable program or can be an expression, neither does it identify where the input shall come from.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This leads to answers like &lt;a href=&quot;https://codegolf.stackexchange.com/a/41803/16901&quot;&gt;this&lt;/a&gt;, which are a mixture of both and neither short nor compilable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For verbose languages like C#, are LinqPad C# expressions encouraged in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;? If so, how to get the needed input?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A solution like&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;i,-1,-i,1&quot;.Split(',')[n%4]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is nice and short and can compete with several other answers. But &lt;code&gt;n&lt;/code&gt; would need to be replaced by the actual number, which increases the length. Is that allowed and by definition we count &lt;code&gt;n&lt;/code&gt; just as 1 character?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are &lt;a href=&quot;https://codegolf.stackexchange.com/search?tab=votes&amp;amp;q=LinqPad%20[code-golf]&quot;&gt;38 LinqPad answers already&lt;/a&gt;, applying the rules more or less lax. From the top-voted ones:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/32333/16901&quot;&gt;This one&lt;/a&gt; might be ok, because it does not need input, but prints output to the LinqPad STDOUT if you like&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/19587/16901&quot;&gt;That&lt;/a&gt; uses a string as input but does not count it as characters&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/36230/16901&quot;&gt;This&lt;/a&gt; follows my example above&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/33075/16901&quot;&gt;Another approach&lt;/a&gt; seems to be a function that uses LinqPad specific methods (&lt;code&gt;.Dump()&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/45782/16901&quot;&gt;This&lt;/a&gt; takes advantage of missing &lt;code&gt;using&lt;/code&gt;statements in LinqPad&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="16901" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-03-05T22:59:30.303" Title="Are C# LinqPad answers encouraged?" Tags="|discussion|code-golf|" AnswerCount="0" CommentCount="6" ClosedDate="2015-03-19T14:43:55.637" ContentLicense="CC BY-SA 3.0" />
  <row Id="4853" PostTypeId="1" AcceptedAnswerId="4855" CreationDate="2015-03-06T10:57:37.863" Score="10" ViewCount="261" Body="&lt;p&gt;Every once in a while I encounter an answer which claims to be Python. However, most Python code is specific to either Python 2 or Python 3.&lt;/p&gt;&#xA;&lt;p&gt;Often the answer starts with&lt;/p&gt;&#xA;&lt;h1&gt;Python&lt;/h1&gt;&#xA;&lt;p&gt;Which should be fixed to either&lt;/p&gt;&#xA;&lt;h1&gt;Python 2&lt;/h1&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;h1&gt;Python 3&lt;/h1&gt;&#xA;&lt;p&gt;However, this edit is only one character. I need six to make an edit. If there's more to be changed, I'll do it. But often there's nothing wrong with the rest of the answer.&lt;/p&gt;&#xA;&lt;p&gt;What should I do when encountering such answers?&lt;/p&gt;&#xA;" OwnerUserId="30833" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-15T18:39:25.440" Title="How do I suggest a 1-character edit?" Tags="|discussion|answers|editing|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4855" PostTypeId="2" ParentId="4853" CreationDate="2015-03-06T16:58:26.730" Score="20" Body="&lt;p&gt;I thought I might as well turn my comment into an answer:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you really can't find enough to improve to add more than the two bytes for the space and the version number, &lt;strong&gt;just leave a comment&lt;/strong&gt;. The author of the post as well as high-rep users don't have this 6-character limitation, and someone will likely take care of it.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2015-03-06T22:56:25.857" LastActivityDate="2015-03-06T22:56:25.857" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4857" PostTypeId="2" ParentId="2140" CreationDate="2015-03-07T04:11:46.053" Score="0" Body="&lt;h2&gt;Make a Space Heater&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I've been out shoveling snow all day, and my hands are freezing! Heat them up with my  computer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's an (ungolfed) Linux C solution:&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#include &amp;lt;stdlib.h&amp;gt;&#xA;#include &amp;lt;stdbool.h&amp;gt;&#xA;#include &amp;lt;unistd.h&amp;gt;&#xA;#include &amp;lt;sys/prctl.h&amp;gt;&#xA;#include &amp;lt;sys/wait.h&amp;gt;&#xA;#include &amp;lt;sys/sysinfo.h&amp;gt;&#xA;&#xA;int main() {&#xA;    int cpu_cores = get_nprocs_conf();&#xA;&#xA;    for (int i = 0; i &amp;lt; cpu_cores; i++) {&#xA;        if (fork() == 0) {&#xA;            nice(19);&#xA;            while (true);&#xA;        }&#xA;    }&#xA;    while (wait(NULL) &amp;gt; 0);&#xA;    return 0;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Additional Rules:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It must use all my CPU cores! More cores means more heat. (Processes are not required. You can use threads, or whatever. Just keep my cores pegged.)&lt;/li&gt;&#xA;&lt;li&gt;Don't slow down my system. I might want to watch cat videos while my hands are warming. (The example does this with &lt;a href=&quot;http://linux.die.net/man/2/nice&quot; rel=&quot;nofollow&quot;&gt;&lt;code&gt;nice&lt;/code&gt;&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Shortest answer in bytes wins.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="36831" LastActivityDate="2015-03-07T04:11:46.053" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4858" PostTypeId="2" ParentId="202" CreationDate="2015-03-07T19:41:47.990" Score="2" Body="&lt;h2&gt;Codio&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codio.com/&quot; rel=&quot;nofollow&quot;&gt;https://codio.com/&lt;/a&gt; offers free Ubuntu virtual machines accessible in the browser.&#xA;The following languages are available out of the box:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;JavaScript (node)&lt;/li&gt;&#xA;&lt;li&gt;Ruby 2.1.5&lt;/li&gt;&#xA;&lt;li&gt;Python 2.7.3&lt;/li&gt;&#xA;&lt;li&gt;Perl 5&lt;/li&gt;&#xA;&lt;li&gt;Java 1.7&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;It's possible to install a lot of other languages/platforms, for example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;C# (Mono)&lt;/li&gt;&#xA;&lt;li&gt;PHP&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3527" LastEditorUserId="9275" LastEditDate="2015-03-08T13:13:37.067" LastActivityDate="2015-03-08T13:13:37.067" CommentCount="0" CommunityOwnedDate="2015-03-07T19:41:47.990" ContentLicense="CC BY-SA 3.0" />
  <row Id="4861" PostTypeId="2" ParentId="4845" CreationDate="2015-03-09T14:30:56.610" Score="3" Body="&lt;p&gt;&lt;strong&gt;Here are some existing examples&lt;/strong&gt;, with limits from 10 to 5000 bytes. it depends on the complexity of the problem. The first two are very similar in concept.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/31695/15599&quot;&gt;Largest number in ten bytes of code&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/34736/15599&quot;&gt;Khinchin&amp;#39;s constant to as many decimal places as possible in 64 bytes or less&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/25226/15599&quot;&gt;2048 Bot Challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/12403/15599&quot;&gt;Build the busiest beaver in x86 machine code in 32 bytes or less&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In other cases the maximum seems to have been added just to stop hardcoding: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/506/15599&quot;&gt;Calculate 500 digits of pi&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/2963/15599&quot;&gt;Find 10 large prime numbers with n digits&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, this is similar to the tweetable art:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/11141/15599&quot;&gt;Encode Images into Tweets (Extreme Image Compression Edition)&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I agree with trichoplax that setting different limits for different languages doesn't seem a good idea.&lt;/strong&gt; The subject has been discussed for the codegolf tag and the conclusion is always the same. Just make sure that the size is sufficient to allow languages of normal verbosity to complete, and if golfing languages (golfscript, cjam, J? ,APL? where do you draw the line?) have an advantage it doesn't matter. &lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-03-09T14:30:56.610" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4863" PostTypeId="2" ParentId="4853" CreationDate="2015-03-09T21:37:22.160" Score="-3" Body="&lt;p&gt;I read this tip on the StackOverflow meta recently but I can't find the post. You could add the comment to the post:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;!-- workaround for 6 character edit limit --&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;p&gt;and make the 1-2 character change. Then a higher rep user will see it in the review and can take the comment out with the improve the edit option.&lt;/p&gt;&#xA;" OwnerUserId="29438" LastActivityDate="2015-03-09T21:37:22.160" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4864" PostTypeId="2" ParentId="2140" CreationDate="2015-03-09T22:14:53.533" Score="0" Body="&lt;h1&gt;One Code, All the Challenges&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;This challenge has been &lt;strong&gt;&lt;em&gt;abandoned&lt;/em&gt;&lt;/strong&gt; due to poor wording. You may reclaim it if you wish without my permission.&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;tag: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Now, I always want to solve as many &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;s as possible, so I thought &quot;Why not solve them all at once?&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Your task&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Create a block of code that solves another code-golf challenge on this Stack Exchange network. You must also make it so that when it is rotated (90°, 180° or 270°) it solves a &lt;em&gt;different&lt;/em&gt; challenge on this website. Examples of rotated code-blocks:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0°       90°      180°     270°&#xA;AB       FCA      F G       EF &#xA;CDE       DB      EDC      BD  &#xA;F G      GE        BA      ACG&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The code golf that you are answering must have a shortest answer &gt; 10 score (usually bytes). It may also not be a duplicate of another challenge.&lt;br&gt;&#xA;Answers do not have to have a code-gold linked to every rotations, although this helps with score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When rotating, take the shape that the code occupies, and rotate that. Some more examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0°       90°   | 0°      90°&#xA;print    p     | print   hsp&#xA;         r     | say~~   iar&#xA;         i     | hi by    yi&#xA;         n     |         b~n&#xA;         t     |         y~t&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This means non-rectangular code is allowed, but whitespace (like-all other characters) &lt;em&gt;except&lt;/em&gt; newlines must stay in-tact. This means the tildes (&lt;code&gt;~&lt;/code&gt;) must be occupied with a character to allow for the rotate.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Number of bytes in code * ((number of rotations that solve a challenge) * -2 + 7)&lt;/code&gt;&lt;br&gt;&#xA;Lowest score wins.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Rotations | X   &#xA;        0 | Must work for at least one rotation&#xA;        1 | 5 &#xA;        2 | 3&#xA;        3 | 1&#xA;Number of bytes * X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note&lt;/strong&gt;&lt;br&gt;&#xA;Please provide a link to each code golf question you are answering with each rotation. Also note that the questions answered &lt;em&gt;must&lt;/em&gt; have been posted before this question, and each rotation must be in the same language. Also note if there are restrictions of source in one challenge, only the rotation that tries to solve that challenge has to comply with them.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example:&lt;/h3&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h3&gt;Python 3, 21 bytes, 2 rotations, 63 points&lt;/h3&gt;&#xA;  &#xA;  &lt;p&gt;0 degrees: &lt;code&gt;https://codegolf.stackexchange.com/questions/4/print-hello-world&lt;/code&gt;&lt;br&gt;&#xA;  180 degrees: &lt;code&gt;https://codegolf.stackexchange.com/questions/3/crash-the-program&lt;/code&gt;&lt;br&gt;&#xA;  (Don't put in links in &lt;code&gt;` `&lt;/code&gt; in actual answers)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;print(&quot;Hello world!&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;0 degrees: prints the string &lt;code&gt;'Hello world!'&lt;/code&gt;&lt;br&gt;&#xA;  180 degrees: Crashes with a &lt;code&gt;SyntaxError&lt;/code&gt; because of unopened close parenthesis.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerDisplayName="user34736" LastEditorUserId="-1" LastEditorDisplayName="user34736" LastEditDate="2017-04-13T12:39:25.653" LastActivityDate="2015-03-25T22:13:48.883" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="4867" PostTypeId="1" AcceptedAnswerId="4871" CreationDate="2015-03-10T08:24:34.583" Score="25" ViewCount="1156" Body="&lt;p&gt;A common rule here on PPCG is that programming languages invented after a challenge was posted cannot be used to answer that challenge. (&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/20459849#20459849&quot;&gt;I've had trouble&lt;/a&gt; finding a specific meta post that addresses this though.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This rule makes total sense because without it, someone could &quot;invent&quot; a language that solves any single challenge, essentially automatically.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example I could &quot;invent&quot; the language &lt;em&gt;riCkroll&lt;/em&gt; for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/6043/were-no-strangers-to-code-golf-you-know-the-rules-and-so-do-i&quot;&gt;this challenge&lt;/a&gt;: &lt;em&gt;riCkroll&lt;/em&gt; is identical to C except that the empty program outputs the lyrics to &quot;Never Gonna Give You Up&quot;. (Modifying an existing compiler to do this would not be that hard.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem I see with this rule is that there may be many perfectly valid languages, not based on loopholes, that were developed after a challenge was posted, and are unduly restricted. For example, I don't think any of us would find it particularly egregious if &lt;a href=&quot;https://codegolf.stackexchange.com/a/47593/26997&quot;&gt;Mac&lt;/a&gt; posted his &quot;99 Bottles of Beer&quot; program to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2/99-bottles-of-beer&quot;&gt;this challenge&lt;/a&gt; in my new &lt;a href=&quot;https://codegolf.stackexchange.com/questions/47588/write-an-interpreter-for-99&quot;&gt;&lt;em&gt;99&lt;/em&gt;&lt;/a&gt; language (invented yesterday). I agree that it shouldn't be allowed to &lt;em&gt;win&lt;/em&gt; (be the accepted answer), just so we can avoid the loopholes mentioned above, but there seems no harm in allowing it to be be posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I'm voting we change the rule of&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Languages that were developed after the challenge was posted are not allowed.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;to&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Languages that were developed after the challenge was posted are not allowed &lt;em&gt;to win&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Do you agree?&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-09-14T13:48:50.150" Title="Can I ever answer with a language invented after the challenge was posted?" Tags="|discussion|answers|" AnswerCount="5" CommentCount="0" ClosedDate="2017-06-19T10:34:51.763" ContentLicense="CC BY-SA 3.0" />
  <row Id="4870" PostTypeId="2" ParentId="4867" CreationDate="2015-03-10T08:28:58.227" Score="14" Body="&lt;h1&gt;Yes and No&lt;/h1&gt;&#xA;&lt;p&gt;These answers can still be posted &lt;strong&gt;but should not be considered as a candidate for the accepted answer&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;But if a language is specifically designed to have a clear advantage for the question, it should not be considered as an answer and should be deleted. This case would ideally be clearly distinguishable.&lt;/p&gt;&#xA;" OwnerUserId="31414" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-14T13:48:50.150" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="4871" PostTypeId="2" ParentId="4867" CreationDate="2015-03-10T08:33:30.423" Score="41" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;Languages invented after a challenge should be allowed to be posted, &lt;strong&gt;but not be allowed to win&lt;/strong&gt;.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-03-10T08:33:30.423" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="4872" PostTypeId="2" ParentId="4867" CreationDate="2015-03-10T08:35:12.637" Score="-10" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;No languages that were invented after a challenge should &lt;strong&gt;ever&lt;/strong&gt; be allowed in that challenge (unless the challenge author makes an exception).&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-03-10T08:41:51.963" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4876" PostTypeId="2" ParentId="2140" CreationDate="2015-03-11T13:48:30.870" Score="1" Body="&lt;h1&gt;Which Children Don't Play Well Together? [code-&lt;s&gt;golf&lt;/s&gt;challenge]&lt;/h1&gt;&#xA;&lt;p&gt;You are a kindergarten teacher who is having problems with fights breaking out among the students. You have noticed that altercations happen only when certain groups of children are together. A group of children who can't play well together, but will coexist peacefully if any one student is removed from the group, is known as a MIKG (minimal incompatible kindergartener group). Every MIKG contains at least two children. To help prevent problems, you decide to identify all such groups of kindergarteners.&lt;/p&gt;&#xA;&lt;p&gt;Each day, your class has Group Reading Time. This involves dividing the children into groups of 1 or more students, who take turns reading pages from a picture book. If all the children from an MIKG are placed in the same reading group, a commotion will erupt. The distraction rapidly involves all the students in the class, so you can't tell which reading group it originated from.&lt;/p&gt;&#xA;&lt;p&gt;You want to find all the MIKGs as soon as possible, so you write a computer program to help you do the math. Let f(N) be the maximum number of days it will take to identify all the MIKGs in a class of size N, assuming an optimal strategy is used. The program should not take more than f(N) days to find the answer.&lt;/p&gt;&#xA;&lt;h2&gt;Input/Output&lt;/h2&gt;&#xA;&lt;p&gt;At the beginning of the program, it takes a positive integer input of N which tells the number of students in the class. Then, the program creates a plan for the day's reading groups. The user (kindergarten teacher) will input 1 if a disruption occurred during reading time, or a 0 if it remained calm.&#xA;When the program determines all the MIKGs, it shall print them out and exit.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;You will be given random test cases for class sizes between (a) and (b). The goal is to determine the MIKGs in as few days as possible. The program that makes the smallest amount of queries is the winner, with tiebreak by earliest post.&lt;/p&gt;&#xA;&lt;h2&gt;Restrictions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program must respond in under (x) seconds&lt;/li&gt;&#xA;&lt;li&gt;Due to the interactivity requirement, you must submit a full program, not a function.&lt;/li&gt;&#xA;&lt;li&gt;You may specify any format for the I/O as long as it is clear, unambiguous, consistent, and doesn't use characters other than printable ASCII and newlines.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Sandbox notes&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;TODO: add examples&lt;/li&gt;&#xA;&lt;li&gt;A formula in terms of &lt;a href=&quot;http://en.wikipedia.org/wiki/Dedekind_number&quot; rel=&quot;nofollow noreferrer&quot;&gt;Dedekind numbers&lt;/a&gt; M(n) for the number of possibilities:&#xA;&lt;img src=&quot;https://i.stack.imgur.com/DhBdW.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/li&gt;&#xA;&lt;li&gt;TODO: fix formula&lt;/li&gt;&#xA;&lt;li&gt;TODO: create random test case generator&lt;/li&gt;&#xA;&lt;li&gt;using &lt;a href=&quot;http://www.emis.de/journals/EJC/Volume_4/PDF/v4i2r15.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.emis.de/journals/EJC/Volume_4/PDF/v4i2r15.pdf&lt;/a&gt; (?)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="30688" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-03-13T00:04:36.663" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4877" PostTypeId="1" AcceptedAnswerId="4878" CreationDate="2015-03-11T19:00:05.857" Score="29" ViewCount="8176" Body="&lt;p&gt;The basic definition of a &lt;strong&gt;quine&lt;/strong&gt; is a program that, when run, produces its own source code as output. There are a number of techniques and a number of way to implement those techniques across a number of different languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, not all quine programs are equal. Clearly, any quine in &lt;code&gt;HQ9+&lt;/code&gt; or a related language is not a proper quine, and nor is an empty program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some cases are more ambiguous, though. Some languages like PHP or HTML, when given a program with no executable tokens, will just output the contents. However, that does not necessarily mean that every quine written in one of those languages necessarily takes advantage of this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another type of 'cheating' quine, one that directly accesses its source code, via a file or otherwise, and outputs that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A program shouldn't necessarily be considered 'cheating', though, just because it accesses a file. For instance, if a program were to use source code spread across multiple different files, it could still be a proper quine, assuming it outputs &lt;em&gt;all&lt;/em&gt; of its source. It might even use external non-code files, such as images or other data. This doesn't necessarily mean that it is not a proper quine, as long as it outputs all of its source code &lt;em&gt;and&lt;/em&gt; source data.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A program might even directly access its own source code file: For instance, in PostScript it is common practice to access the source file in order to access binary data appended to the end of the source file. In this case, the program is merely accessing source data, and shouldn't necessarily be considered 'cheating' for it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One particularily ambiguous case is &lt;a href=&quot;https://codegolf.stackexchange.com/a/47614/7981&quot;&gt;this answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/47520/7981&quot;&gt;Build a Twitter-quine&lt;/a&gt;. (Long story short, write a program that tweets its source code.) One version of the program uses a link-shortener service to redirect a shortened URL (&lt;code&gt;http://tinyurl.com/erjk34&lt;/code&gt;) to a longer one (&lt;code&gt;https://twitter.com/intent/tweet?text=window.open(%22http%3A%2F%2Ftinyurl.com%2Ferjk34%22)%3B&lt;/code&gt;). Even though the question OP stated that cheating quines are allowed, it is still worth considering whether this is a proper quine or not, or if the link redirection (not the code performing the redirection, the redirection itself) should be considered part of the program's source.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;What should the criteria be for determining what is and isn't a proper quine in quine-related challenges?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="7981" LastEditorUserId="34718" LastEditDate="2017-05-01T21:36:25.260" LastActivityDate="2017-05-01T21:36:25.260" Title="What counts as a proper quine?" Tags="|discussion|quine|" AnswerCount="3" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="4878" PostTypeId="2" ParentId="4877" CreationDate="2015-03-11T19:19:05.970" Score="27" Body="&lt;p&gt;We've been discussing this in chat recently, and coming up with a solid definition seems difficult. The best idea I've got is to base a definition for a true quine on the principles &lt;a href=&quot;http://www.madore.org/%7Edavid/computers/quine.html#sec_princ&quot; rel=&quot;nofollow noreferrer&quot;&gt;given on this page&lt;/a&gt;: a true quine will in one way or another consist of &lt;em&gt;data&lt;/em&gt;, and &lt;em&gt;code&lt;/em&gt;. The data represents the code, and the code takes the data, and produces both the data's and the code's representation from it. Any quine which doesn't do that in some way, seems to be a cheaty quine (PHP quines which just print code verbatim, GolfScript quines which just print a variable on program termination, quines which read the source code).&lt;/p&gt;&#xA;&lt;p&gt;So I don't know how workable this is in practice, but here is a suggestion:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;It must be possible to identify a section of the program which encodes a &lt;em&gt;different&lt;/em&gt; part of the program. (&amp;quot;Different&amp;quot; meaning that the two parts appear in different positions.)&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, a quine must not access its own source, directly or indirectly.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Some examples&lt;/h2&gt;&#xA;&lt;p&gt;Here is Ruby quine&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;_=&amp;quot;_=%p;puts _%%_&amp;quot;;puts _%_&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;One can easily identify parts of the string which encode bits of the code that are &lt;em&gt;outside&lt;/em&gt; the string, i.e. the &lt;code&gt;_=&lt;/code&gt; and the &lt;code&gt;;puts _%%_&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Here is a CJam quine, I'd consider legitimate:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;{&amp;quot;_~&amp;quot;}_~&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The &lt;code&gt;&amp;quot;_~&amp;quot;&lt;/code&gt; encodes the &lt;code&gt;_~&lt;/code&gt; at the end of the code.&lt;/p&gt;&#xA;&lt;p&gt;Note that the encoding part doesn't necessarily have to be &lt;em&gt;identical&lt;/em&gt; to the encoded part. E.g. if you look at my &lt;a href=&quot;https://codegolf.stackexchange.com/a/47112/8478&quot;&gt;Prelude quine&lt;/a&gt;, the long number at the end encodes the entire remainder of the code (since Prelude doesn't even have strings).&lt;/p&gt;&#xA;&lt;p&gt;I think this definition should catch most cases, and more importantly rule out all the common quine cheats. I'd be very interested in examples this doesn't catch, both false positives and false negatives.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-03-11T19:27:52.437" CommentCount="23" ContentLicense="CC BY-SA 3.0" />
  <row Id="4879" PostTypeId="2" ParentId="4877" CreationDate="2015-03-11T20:48:52.287" Score="6" Body="&lt;p&gt;For the record, I'm the author of the original twitter quine that cheated by using a tinyurl link to redirect to twitter's web query-string-based &quot;API&quot; to create a tweet containing that tinyurl link.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also for the record, I fully admitted that was &quot;cheating&quot;, but the original challenge said that cheating was encouraged- including reading from a file (which is normally not &quot;allowed&quot; in quines).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But more to the point, the thing that makes quine programs interesting is that they're paradoxical. Consider this quote from &lt;a href=&quot;http://en.wikipedia.org/wiki/Quine_%28computing%29&quot; rel=&quot;nofollow&quot;&gt;wikipedia&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The name &quot;quine&quot; was coined by Douglas Hofstadter, in his popular&#xA;  science book Gödel, Escher, Bach: An Eternal Golden Braid, in the&#xA;  honor of philosopher Willard Van Orman Quine (1908–2000), who made an&#xA;  extensive study of indirect self-reference, and in particular for the&#xA;  following paradox-producing expression, known as Quine's paradox:&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&quot;Yields falsehood when preceded by its quotation&quot; yields falsehood&#xA;  when preceded by its quotation.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;In some languages, particularly scripting languages, an empty source&#xA;  file is a fixed point of the language, being a valid program that&#xA;  produces no output. Such an empty program, submitted as &quot;the&#xA;  world's smallest self reproducing program&quot;, once won the &quot;worst abuse&#xA;  of the rules&quot; prize in the International Obfuscated C Code Contest.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So the answer to your question of &quot;What counts as a proper quine?&quot; is another concept from the EGB book:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Mu_%28negative%29&quot; rel=&quot;nofollow&quot;&gt;Mu.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In other words, there is no official Department of Quine Rules and Regulations. What defines a &quot;true quine&quot; depends on who is asking the question. It's a fun thing to think about, and part of what makes it so fun is that it isn't really well-defined. It's paradoxical- the whole point of naming them Quines was to underline that paradox.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, I don't think there's a real answer to your question, outside of specific challenges. If you want to put additional limitations or rules on &quot;what defines a quine&quot; on any challenges you issue, that's fine. But that doesn't really impact the definition of a &quot;proper quine&quot;. We could go back to the wikipedia definition:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A quine is a non-empty computer program which takes no input and produces a copy of its own source code as its only output.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That's the core, and adding anything on top of it (such as the requirement that it must include some kind of encoding mechanism) seems a bit arbitrary, and detracts from the whole point of quines. Quines are &lt;strong&gt;supposed&lt;/strong&gt; to be weird and paradoxical.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For a more concrete answer, I think the most important aspect of a quine is the &lt;strong&gt;takes no input&lt;/strong&gt; requirement. From there you can get into a separate debate about what counts as input, but I think your example of reading from several files is pretty obviously out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So if you're asking what a quine is, you should probably ask the guy who coined the term. And he says &lt;strong&gt;a quine is any program that doesn't take any input, and only outputs its own source code&lt;/strong&gt;. Anything on top of that is just extra.&lt;/p&gt;&#xA;" OwnerUserId="36926" LastEditorUserId="36926" LastEditDate="2015-03-11T20:55:22.347" LastActivityDate="2015-03-11T20:55:22.347" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="4882" PostTypeId="2" ParentId="2214" CreationDate="2015-03-12T18:38:39.287" Score="1" Body="&lt;p&gt;If a language makes a distinction between &lt;code&gt;char[]&lt;/code&gt; and &lt;code&gt;String&lt;/code&gt;, I think a good question to ask is &quot;Does a char[] print like a string?&quot;  If it is possible to print a &lt;code&gt;char[]&lt;/code&gt; so that it looks like &lt;code&gt;String&lt;/code&gt;, then you can use it.  Many questions give the option of printing or returning the output, so I think the returned output should look similar to the printed output if it were printed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's say that the challenge allowed you to write a function that returns a string.  Java, for example, has both a &lt;code&gt;String&lt;/code&gt; and a &lt;code&gt;char[]&lt;/code&gt;.  If you use &lt;code&gt;System.out.println()&lt;/code&gt; to print the &lt;code&gt;char[]&lt;/code&gt;, then it is formatted and looks the same as if you had printed a &lt;code&gt;String&lt;/code&gt; (&lt;a href=&quot;http://ideone.com/1bTn90&quot; rel=&quot;nofollow&quot;&gt;Ideone example&lt;/a&gt;).  This means that it will be acceptable for the method to return either a &lt;code&gt;String&lt;/code&gt; or a &lt;code&gt;char[]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is some psuedocode to demonstrate how this can be tested.  You are allowed to modify the &lt;code&gt;print&lt;/code&gt; method, such as using &lt;code&gt;println&lt;/code&gt;, but you can't modify the golfed method's output before it is fed into the print.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;class tester{&#xA;  main(n){&#xA;    print(f(n));&#xA;  }&#xA;  char[] f(n){&#xA;    //golf code here&#xA;  }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If there is a language that &lt;em&gt;does not&lt;/em&gt; allow a &lt;code&gt;char[]&lt;/code&gt; to be easily printed, meaning that it always looks like &lt;code&gt;[a, b, c]&lt;/code&gt; or &lt;code&gt;['a', 'b', 'c']&lt;/code&gt; regardless of the type of printing method you use, then I don't think &lt;code&gt;char[]&lt;/code&gt; is an acceptable substitute.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2015-03-12T18:38:39.287" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4883" PostTypeId="2" ParentId="4867" CreationDate="2015-03-12T21:36:37.270" Score="4" Body="&lt;h2&gt;Yes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Languages invented after a challenge should be allowed to be posted, &lt;strong&gt;require a statement&lt;/strong&gt; about that fact &lt;strong&gt;and then&lt;/strong&gt; be allowed to win if the OP like to do so.&lt;/p&gt;&#xA;" OwnerUserId="16901" LastActivityDate="2015-03-12T21:36:37.270" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4884" PostTypeId="1" CreationDate="2015-03-13T12:28:21.723" Score="14" ViewCount="265" Body="&lt;p&gt;I wanted to post this for a while...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First off, I think that we're not tagging enough. Currently, &lt;a href=&quot;http://data.stackexchange.com/codegolf/query/61442/average-tag-count-per-question&quot; rel=&quot;nofollow noreferrer&quot;&gt;we have an average of 2.1&lt;/a&gt; tags per question. I've checked some (thematically) comparable sites, and Stack Overflow, Code Review and Programmers all have between 2.6 and 3 tags on average. Tags are a really useful concept of SE to organise the questions on the site and make it easier for people to find those they are interested in, and I think we should make use of that. I tend to do quite a lot of tag edits on new questions if I know that more applicable tags exist, but it would be nice if I could get some help with that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition, while we've added a few tags for challenge types recently, it seems that some people put more effort into &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2367/8478&quot;&gt;getting rid&lt;/a&gt; &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/18458927#18458927&quot;&gt;of tags&lt;/a&gt; than adding new ones. As far as I'm aware I'm one of very few people who regularly try to add new (non-challenge) tags.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the same time, we &lt;em&gt;do&lt;/em&gt; have a few tags that are completely useless, but still widely used. Luckily, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2271/8478&quot;&gt;we got rid of [algorithm] recently&lt;/a&gt;, but there's still stuff like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/printable-ascii&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;printable-ascii&amp;#39;&quot; rel=&quot;tag&quot;&gt;printable-ascii&lt;/a&gt;, which I think is the epitome of a meta tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And then there's really confusing groups of tags, like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;, where I'm never quite sure which ones to apply to any given maths-based challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So before we embark on The Great Tagging Spree, I think it would be useful if we could get a consensus on what kinds of tags we actually want. The normal definition of a meta tag (&quot;The tag can't stand on its own&quot;) does not really apply here, since challenge tags are mandatory. Can we come up with some guidelines for how non-challenge tags should be applied and which ones we should even create or keep?&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2016-05-02T18:19:40.180" Title="Tagging: are we doing it wrong?" Tags="|discussion|policy|tags|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="4885" PostTypeId="2" ParentId="4884" CreationDate="2015-03-13T12:39:34.017" Score="4" Body="&lt;p&gt;This answer is to suggest a policy for what we should consider an admissible tag. It doesn't really address the question of what to do with overlapping tags, like the maths family.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As I said in the question, I don't think the guideline &quot;can the tag stand on its own&quot; is very useful around here on in general. I believe I've seen Grace Note or Monica Cellio post on some early beta site, that the real question should rather be whether anyone would be interested in filtering by that tag - because that's what they are for after all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I suggest this guideline:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Is the tag useful for filtering questions? Would anyone really want to see all challenges with that particular tag, because they're interested in the kind of challenge implied by the tag?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;As an example, I personally think that this would classify &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/printable-ascii&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;printable-ascii&amp;#39;&quot; rel=&quot;tag&quot;&gt;printable-ascii&lt;/a&gt; as a bad tag. It describes a fairly random property of the challenge, that doesn't really tell you at all what the challenge is actually about. And I don't see anyone thinking &quot;oh I feel like answering a printable ASCII challenge today&quot;. If they were interested in restricted source challenges, they would filter by that tag - and more importantly &lt;em&gt;only 3 of the 35 &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/printable-ascii&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;printable-ascii&amp;#39;&quot; rel=&quot;tag&quot;&gt;printable-ascii&lt;/a&gt; challenges are even meant to be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; challenges&lt;/em&gt;. Most of the time, this is just a random feature of the challenge that isn't even intended to really affect the answers, but a mere technically (because of source layout etc.).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please let your vote and comments indicate your opinion of the &lt;em&gt;definition&lt;/em&gt;, not this example. Whether &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/printable-ascii&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;printable-ascii&amp;#39;&quot; rel=&quot;tag&quot;&gt;printable-ascii&lt;/a&gt; is ultimately a bad tag or not is a discussion for another day.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-03-13T12:39:34.017" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="4886" PostTypeId="2" ParentId="2140" CreationDate="2015-03-13T14:22:07.627" Score="0" Body="&lt;h1&gt;Navigate My Time Machine&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/challenge-type-undecided&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;challenge-type-undecided&amp;#39;&quot; rel=&quot;tag&quot;&gt;challenge-type-undecided&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a pretty broad idea, but time travel is a lot cooler than space travel.  The basic idea is that the program will have to sort out the path of various objects through time, given certain constraints as to what must be where, when.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are a few different models of time machine that could be used, based upon which type of time travel we want to use.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One possible example is the time travel model used in the film Primer. Notably, the machine must be turned on before it can be used.  I find this model to be fairly &quot;realistic,&quot; if that term can be used in regards to time travel.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/AKhHa.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There would also be the requirement of conservation of mass.  If there there are multiple copies of an object, then &quot;the number of forward-moving copies&quot; - &quot;the number of backwards-moving copies&quot; = 1.  The most important point is that there is a single &quot;unified&quot; timeline.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One idea is to create a long list of various objects, listing the known sightings of each one.  From this list of information, the program must sort out the path of each object through time, ensuring that each duplicate object is accounted for and that conservation of mass is obeyed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additional ideas include determining how much additional aging each object has experienced as a result of the time travel.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2015-03-13T14:22:07.627" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4887" PostTypeId="1" AcceptedAnswerId="4888" CreationDate="2015-03-13T15:18:10.060" Score="12" ViewCount="166" Body="&lt;p&gt;My next challenge will rely heavily on Stack Snippets and &lt;a href=&quot;http://api.stackexchange.com/&quot;&gt;http://api.stackexchange.com/&lt;/a&gt; to gather data from the answers (similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/45040/user-scored-code-golf-drawing-diamonds-experimental&quot;&gt;this&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/41462/a-different-kind-of-meta-regex-golf&quot;&gt;this&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I want to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt; it to iron out any kinks, but none of the data gathering will work if I answer in the normal Sandbox because answers can't have answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Could I (or anyone in this situation) make an entire question on Meta that is the Sandboxed challenge? Then I can add some answers and make sure the Stack Snippet works. I would delete it after I post the real challenge.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2015-03-13T15:40:41.377" Title="Can I make a Sandbox meta post instead of using the normal Sandbox?" Tags="|discussion|sandbox|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4888" PostTypeId="2" ParentId="4887" CreationDate="2015-03-13T15:40:41.377" Score="14" Body="&lt;p&gt;If it's a temporary thing, I don't mind. It's probably not ideal, because we don't want to clutter meta with stuff like this, but I also don't see a good alternative. For past challenges (like the one you've linked), I've usually written my snippets based on similar existing questions, but knowing you I doubt that there is such a thing as a &quot;similar existing question&quot;. ;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(And I guess the votes on this answer will tell you if people agree with me or not. ;))&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-03-13T15:40:41.377" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4889" PostTypeId="2" ParentId="4884" CreationDate="2015-03-13T15:41:46.827" Score="12" Body="&lt;p&gt;The question I wanted to set out to answer was — what &lt;em&gt;are&lt;/em&gt; we doing wrong? Why do we have bad tags, and end up needing to purge them?&lt;/p&gt;&#xA;&lt;p&gt;To answer this, I went through the top 100 tags or so and tried to categorise them:&lt;/p&gt;&#xA;&lt;h2&gt;Winning criteria&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/rosetta-stone&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;rosetta-stone&amp;#39;&quot; rel=&quot;tag&quot;&gt;rosetta-stone&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Input/output types&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/audio&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;audio&amp;#39;&quot; rel=&quot;tag&quot;&gt;audio&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/animation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;animation&amp;#39;&quot; rel=&quot;tag&quot;&gt;animation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Restrictions&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/printable-ascii&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;printable-ascii&amp;#39;&quot; rel=&quot;tag&quot;&gt;printable-ascii&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Language-specific tags&lt;sup&gt;*&lt;/sup&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c&amp;#39;&quot; rel=&quot;tag&quot;&gt;c&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot;&gt;python&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c%2b%2b&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c++&amp;#39;&quot; rel=&quot;tag&quot;&gt;c++&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brainfuck&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brainfuck&amp;#39;&quot; rel=&quot;tag&quot;&gt;brainfuck&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c%23&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c#&amp;#39;&quot; rel=&quot;tag&quot;&gt;c#&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/assembly&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;assembly&amp;#39;&quot; rel=&quot;tag&quot;&gt;assembly&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/php&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;php&amp;#39;&quot; rel=&quot;tag&quot;&gt;php&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/css&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;css&amp;#39;&quot; rel=&quot;tag&quot;&gt;css&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/manufactoria&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;manufactoria&amp;#39;&quot; rel=&quot;tag&quot;&gt;manufactoria&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/logic-gates&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;logic-gates&amp;#39;&quot; rel=&quot;tag&quot;&gt;logic-gates&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Task types&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; rel=&quot;tag&quot;&gt;compression&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ai-player&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ai-player&amp;#39;&quot; rel=&quot;tag&quot;&gt;ai-player&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle-solver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle-solver&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle-solver&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-generation&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-generation&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;generation&amp;#39;&quot; rel=&quot;tag&quot;&gt;generation&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;conversion&amp;#39;&quot; rel=&quot;tag&quot;&gt;conversion&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/busy-beaver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;busy-beaver&amp;#39;&quot; rel=&quot;tag&quot;&gt;busy-beaver&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimized-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimized-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimized-output&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/counting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;counting&amp;#39;&quot; rel=&quot;tag&quot;&gt;counting&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/simulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;simulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;simulation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Themes&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/subsequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;subsequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;subsequence&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fractal&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fractal&amp;#39;&quot; rel=&quot;tag&quot;&gt;fractal&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base-conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; rel=&quot;tag&quot;&gt;base-conversion&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/complex-numbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;complex-numbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;complex-numbers&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/probability-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;probability-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;probability-theory&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/set-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;set-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;set-theory&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphs&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphs&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphs&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot;&gt;sorting&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cryptography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cryptography&amp;#39;&quot; rel=&quot;tag&quot;&gt;cryptography&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/natural-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;natural-language&amp;#39;&quot; rel=&quot;tag&quot;&gt;natural-language&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/file-system&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;file-system&amp;#39;&quot; rel=&quot;tag&quot;&gt;file-system&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/data-structures&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;data-structures&amp;#39;&quot; rel=&quot;tag&quot;&gt;data-structures&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cellular-automata&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cellular-automata&amp;#39;&quot; rel=&quot;tag&quot;&gt;cellular-automata&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hashing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hashing&amp;#39;&quot; rel=&quot;tag&quot;&gt;hashing&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/board-game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;board-game&amp;#39;&quot; rel=&quot;tag&quot;&gt;board-game&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/music&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;music&amp;#39;&quot; rel=&quot;tag&quot;&gt;music&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/word&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;word&amp;#39;&quot; rel=&quot;tag&quot;&gt;word&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chemistry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chemistry&amp;#39;&quot; rel=&quot;tag&quot;&gt;chemistry&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/word-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;word-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;word-puzzle&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot;&gt;chess&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sudoku&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sudoku&amp;#39;&quot; rel=&quot;tag&quot;&gt;sudoku&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/crossword&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;crossword&amp;#39;&quot; rel=&quot;tag&quot;&gt;crossword&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tic-tac-toe&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tic-tac-toe&amp;#39;&quot; rel=&quot;tag&quot;&gt;tic-tac-toe&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/maze&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;maze&amp;#39;&quot; rel=&quot;tag&quot;&gt;maze&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tetris&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tetris&amp;#39;&quot; rel=&quot;tag&quot;&gt;tetris&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hello-world&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hello-world&amp;#39;&quot; rel=&quot;tag&quot;&gt;hello-world&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/palindrome&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;palindrome&amp;#39;&quot; rel=&quot;tag&quot;&gt;palindrome&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pi&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pi&amp;#39;&quot; rel=&quot;tag&quot;&gt;pi&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary&amp;#39;&quot; rel=&quot;tag&quot;&gt;binary&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fibonacci&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fibonacci&amp;#39;&quot; rel=&quot;tag&quot;&gt;fibonacci&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/division&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;division&amp;#39;&quot; rel=&quot;tag&quot;&gt;division&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game-of-life&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game-of-life&amp;#39;&quot; rel=&quot;tag&quot;&gt;game-of-life&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/roman-numerals&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;roman-numerals&amp;#39;&quot; rel=&quot;tag&quot;&gt;roman-numerals&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/morse&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;morse&amp;#39;&quot; rel=&quot;tag&quot;&gt;morse&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/new-years&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;new-years&amp;#39;&quot; rel=&quot;tag&quot;&gt;new-years&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/keyboard&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;keyboard&amp;#39;&quot; rel=&quot;tag&quot;&gt;keyboard&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/bitwise&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;bitwise&amp;#39;&quot; rel=&quot;tag&quot;&gt;bitwise&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary-tree&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary-tree&amp;#39;&quot; rel=&quot;tag&quot;&gt;binary-tree&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;*This includes questions which require answers written in the language, as well as questions using the language as a theme&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;(I had trouble distinguishing between the last two categories...)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;That gives us an idea as to what classes of tags we might want, but doesn't directly give us a way of immediately telling if a tag is bad. But from browsing the tags above, I think the biggest problem is that there's a lot of &lt;strong&gt;confused tags&lt;/strong&gt;, which aren't clear about what they're meant to cover:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/printable-ascii&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;printable-ascii&amp;#39;&quot; rel=&quot;tag&quot;&gt;printable-ascii&lt;/a&gt; simultaneously describes challenges where the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/40562/asciis-95-characters-95-movie-quotes&quot;&gt;code may only contain printable ASCII&lt;/a&gt;, the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/12760/converting-a-string-to-lower-case-without-built-in-to-lower-functions&quot;&gt;input is printable ASCII&lt;/a&gt; and... the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/18599/one-line-aquarium&quot;&gt;output is printable ASCII?&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt; has &lt;a href=&quot;https://codegolf.stackexchange.com/questions/22469/call-a-method-without-calling-it&quot;&gt;questions to do with calling functions&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/28359/determine-if-all-decimal-digits-are-unique&quot;&gt;questions where code must be a function&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/40141/the-ackermann-function&quot;&gt;questions about mathematical functions&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/counting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;counting&amp;#39;&quot; rel=&quot;tag&quot;&gt;counting&lt;/a&gt; has &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44540/into-how-many-pieces-can-you-cut-this-string&quot;&gt;questions about counting items/counting possibilities&lt;/a&gt;... and then &lt;a href=&quot;https://codegolf.stackexchange.com/questions/26388/avoid-the-evil-integers&quot;&gt;stuff&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/26782/fast-cheap-and-good-choose-any-two&quot;&gt;like&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/36503/display-a-tally-in-varying-bases&quot;&gt;this&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/animation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;animation&amp;#39;&quot; rel=&quot;tag&quot;&gt;animation&lt;/a&gt; is all okay except &lt;a href=&quot;https://codegolf.stackexchange.com/questions/18599/one-line-aquarium&quot;&gt;One Line Aquarium&lt;/a&gt; (again), which seems out of place. The tag wiki isn't clear about whether this tag is appropriate or inappropriate for this question.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;And don't even get me started on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/word-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;word-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;word-puzzle&lt;/a&gt;...&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;So my proposal is that tags of the above classes are fine, except:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The tag name should be unambiguous enough so that people can get a good idea of what the tag encompasses, while preventing any possible major causes of confusion.&lt;/li&gt;&#xA;&lt;li&gt;The tag wiki should clear up any possible minor confusion, and should clearly define the scope of the tag (especially for winning criteria, restrictions and task types). To be honest, I think we would benefit from more detailed tag wikis, in general.&lt;/li&gt;&#xA;&lt;li&gt;The tag should ideally be broad enough to be applicable to at least a few questions, but not be too broad to the point where it's better to split it up into several smaller tags.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="21487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-02T18:19:40.180" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="4891" PostTypeId="1" CreationDate="2015-03-14T18:47:13.773" Score="3" ViewCount="157" Body="&lt;p&gt;Input doesn't make sense in a pure functional enviroment. I've seen some challenges where input was to be read from a file or from STDIN. Are purely functional languages (that do not implement these input methods) allowed to participate?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an example of such a challenge: &lt;a href=&quot;https://codegolf.stackexchange.com/q/17456/20356&quot;&gt;Check whether an integer is a power of 2 without using +,- operations&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="20356" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-03-17T05:12:04.593" Title="Input in functional languages" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4892" PostTypeId="2" ParentId="4891" CreationDate="2015-03-14T19:01:44.137" Score="8" Body="&lt;p&gt;If the question explicitly asks for STDIN or file input, then you're out of luck. The default rules always allow input to be taken as a function argument, but any challenge author is free to override those defaults.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that this affects almost any language on some challenges. Ask for reading a file, and CJam (and many esolangs) can't participate. Ask graphical output to screen and many languages can't participate. Ask for a function, and languages that don't have functions can't participate. The bottomline is, not every language is suitable for every challenge, and while authors should thrive to make their challenges as inclusive as can reasonably expected of them, there's not really any obligation to do so.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you think the limitation is unjustified, leave a comment, asking the OP to be more inclusive (that's what I usually do when someone asks for input from a file that would work just as well from STDIN). If they're not willing to change the rules, you can always downvote the challenge if you still think that the limitation is unjustified or &quot;bullying&quot; your language.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-03-14T19:01:44.137" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4894" PostTypeId="2" ParentId="2140" CreationDate="2015-03-15T17:28:15.123" Score="10" Body="&lt;h1&gt;Gerrymander a Map&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Congratulations! You have been selected as the chairman of your state's redistricting commission.  It is your job to propose a division of the state into electoral districts.  Your true goal, however, is to make sure that your party wins.  To avoid suspicion, your divisions should appear as innocuous as possible while still giving your party an edge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The map will be provided as a grid of &lt;code&gt;0&lt;/code&gt;s and &lt;code&gt;1&lt;/code&gt;s.  The &lt;code&gt;1&lt;/code&gt;s represent your party.  Below is a simple example map:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0000&#xA;0011&#xA;1111&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You are also given a number which represents the number of electoral districts that must be created.  Continuing with the example, &lt;code&gt;4&lt;/code&gt; will be the number for now.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;strong&gt;division&lt;/strong&gt; of the map is a partition into N number of contiguous regions.  If &lt;code&gt;P&lt;/code&gt; is the total population (number of digits), each district must contain at least &lt;code&gt;floor(P/N)&lt;/code&gt; people (digits).  A division can be represented by a new map, with each district labeled by a unique (non-whitespace, printable) ASCII character.  The following represents a division into four segments:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abcd&#xA;abcd&#xA;abcd&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A map has been &lt;strong&gt;successfully gerrymandered&lt;/strong&gt; if the number of districts with a &lt;code&gt;1&lt;/code&gt; majority is greater than the number of districts with a &lt;code&gt;0&lt;/code&gt; majority.  In the above division, districts &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; have a &lt;code&gt;0&lt;/code&gt; majority, while districts &lt;code&gt;c&lt;/code&gt; and &lt;code&gt;d&lt;/code&gt; have a &lt;code&gt;1&lt;/code&gt; majority.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is an alternative division in which gerrymandering was successful.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;aacd&#xA;abcd&#xA;bbcd&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;District &lt;code&gt;a&lt;/code&gt; has a &lt;code&gt;0&lt;/code&gt; majority, while districts &lt;code&gt;b&lt;/code&gt;, &lt;code&gt;c&lt;/code&gt;, and &lt;code&gt;d&lt;/code&gt; have a &lt;code&gt;1&lt;/code&gt; majority.  This means that the &lt;code&gt;1&lt;/code&gt; party has a clear majority in the election.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Distortion Metric&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are many ways to gerrymander a map, but you want to make sure that your method passes a visual inspection.  Thus, the shapes should appear as regular as possible.  One method for measuring this is by summing up the perimeters of each district.  The lower the total perimeter, the more disguised the gerrymandering.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;aa  c&#xA;a   c d&#xA;  b c d&#xA; bb   d&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Both divisions above have a total perimeter of 32 (each district has a perimeter of 8).  On a 3x4 map, this is as good as you can get.  Below is a map with a total perimeter of 16 + 22 + 20 + 16 + 22 = 96.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abbbb&#xA;aaaab&#xA;aaaab&#xA;acccb&#xA;ccbbb&#xA;ccddd&#xA;ecccd&#xA;eeeed&#xA;eeeed&#xA;edddd&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;The Goal&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The goal is to write the shortest program which, hen given a map of &lt;code&gt;0&lt;/code&gt;s and &lt;code&gt;1&lt;/code&gt; and a number N, outputs a gerrymandered division of the map into N districts with the lowest possible total perimeter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More detail coming soon&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2015-03-15T17:28:15.123" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4896" PostTypeId="1" CreationDate="2015-03-15T22:47:00.407" Score="9" ViewCount="333" Body="&lt;p&gt;There was some discussion in &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/20562436#20562436&quot;&gt;chat&lt;/a&gt; and in the comments on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/47801/write-a-gif-encoder&quot;&gt;this question&lt;/a&gt; about the choice of example images. Initially the images were criticised for being exclusively of women. The image of Lena Söderberg also had its &lt;a href=&quot;https://en.wikipedia.org/wiki/Lenna#Controversy&quot; rel=&quot;nofollow noreferrer&quot;&gt;origin highlighted&lt;/a&gt;. The question has since been edited to replace this image with some peppers, which addresses the second issue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Personally I don't see any problem with the 3 example images being all men, or all women. What stands out to me is that they were all female models. If they were a female scientist, a female bank robber, and a female politician, then I doubt the conversation would have started.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd like to see an indication of the community's feelings about how to approach choosing example images, in order to help avoid unintentional stereotyping or exclusion (I believe we already have a community that would deal with intentional problems with downvoting). &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;To avert edit wars, the name is &lt;a href=&quot;http://en.wikipedia.org/wiki/Lena_S%C3%B6derberg&quot; rel=&quot;nofollow noreferrer&quot;&gt;pronounced &quot;Lenna&quot; but spelt &quot;Lena&quot;&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-07-19T22:18:15.190" Title="Gender of example images" Tags="|discussion|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="4897" PostTypeId="2" ParentId="4896" CreationDate="2015-03-15T23:09:07.957" Score="12" Body="&lt;p&gt;Maybe we don't need an actual policy or statement on this?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Posters should generally try to be neutral, sure. If someone gets offended, we can edit/change an image. There's really no telling what people will be offended by anyway (some things may be more obvious, but in general...). We have a conglomeration of different cultures, so I think we can and should just handle it on a case-by-case basis.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2015-03-15T23:09:07.957" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="4898" PostTypeId="2" ParentId="2140" CreationDate="2015-03-16T11:25:09.883" Score="1" Body="&lt;h1&gt;Musical Blinkenlights&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hardware&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hardware&amp;#39;&quot; rel=&quot;tag&quot;&gt;hardware&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/music&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;music&amp;#39;&quot; rel=&quot;tag&quot;&gt;music&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If you take a look at the front panel of your desktop or laptop computer, chances are that you'll find a handful of &lt;a href=&quot;http://en.wikipedia.org/wiki/Blinkenlights&quot; rel=&quot;nofollow noreferrer&quot;&gt;blinkenlights&lt;/a&gt;, including a hard disk activity indicator.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/bd4nk.jpg&quot; alt=&quot;HDD blinkenlight turning on and off&quot;&gt;&#xA;&lt;sup&gt;Image taken from &lt;a href=&quot;https://superuser.com/questions/456360/getting-laptop-wireless-led-to-indicate-wireless-network-activity&quot;&gt;here&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The idea of this challenge is to &quot;play&quot; the &lt;a href=&quot;http://en.wikipedia.org/wiki/Shave_and_a_Haircut&quot; rel=&quot;nofollow noreferrer&quot;&gt;Shave and a Haircut&lt;/a&gt; melody with that light.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a full program with the following behavior.&#xA;If the program is placed in an empty directory, compiled (if applicable) and run, it causes the hard drive activity light to blink the notes of the Shave and a Haircut melody (unless, of course, the hard drive is active for some other reason).&#xA;After that, it shall exit gracefully.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Precise Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The specification of the melody is as follows.&#xA;Let &lt;code&gt;t&lt;/code&gt; be a unit of time between 0.2 seconds and 0.7 seconds.&#xA;Starting from some time &lt;code&gt;t&lt;sub&gt;init&lt;/sub&gt;&lt;/code&gt;, the activity light shall blink at &lt;code&gt;t&lt;sub&gt;init&lt;/sub&gt;&lt;/code&gt;, &lt;code&gt;t&lt;sub&gt;init&lt;/sub&gt; + t&lt;/code&gt;, &lt;code&gt;t&lt;sub&gt;init&lt;/sub&gt; + 1.5*t&lt;/code&gt;, &lt;code&gt;t&lt;sub&gt;init&lt;/sub&gt; + 2*t&lt;/code&gt;, &lt;code&gt;t&lt;sub&gt;init&lt;/sub&gt; + 3*t&lt;/code&gt;, &lt;code&gt;t&lt;sub&gt;init&lt;/sub&gt; + 5*t&lt;/code&gt;, and &lt;code&gt;t&lt;sub&gt;init&lt;/sub&gt; + 6*t&lt;/code&gt;.&#xA;The blink must be long enough to be noticed by the human eye, but no more than &lt;code&gt;0.25*t&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program may create and modify any files and subdirectories in the directory it is placed in, including its own source code.&#xA;The program does not have to be cross-platform, but you must state your operating system in your answer, and any necessary hardware requirements.&#xA;In particular, some environments allow the blinkenlights to be controlled manually; this is perfectly acceptable, but must be explicitly stated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Your program may not damage or significantly alter the host computer.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, so the lowest byte count wins.&#xA;Standard loopholes are disallowed.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;My main concern is whether my challenge would be too similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/33059/draw-with-your-cpu&quot;&gt;this&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.893" LastActivityDate="2015-03-16T11:25:09.883" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="4900" PostTypeId="2" ParentId="2140" CreationDate="2015-03-17T04:49:10.380" Score="4" Body="&lt;h1&gt;Find a Diagonal&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a (possibly concave) polygon of &lt;code&gt;n ≥ 4&lt;/code&gt; sides, output a valid &lt;em&gt;diagonal&lt;/em&gt;, a line segment joining two distinct vertices which, aside from the endpoints, is completely contained within the interior of the polygon.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, for the polygon&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[(0, 0), (3, 0), (1, 1), (0, 4)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;a valid diagonal (in fact, the only possible diagonal) is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[(0, 0), (1, 1)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/fIn3Rm.png&quot; alt=&quot;Diagonal&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some invalid diagonals are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[(3, 0), (0, 4)]     Lies outside the polygon&#xA;[(0, 0), (3, 0)]     Is an edge of the polygon - the interior of the line is not inside&#xA;[(0, 0), (0, 0)]     Two identical vertices&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Input/output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input will be &lt;code&gt;n&lt;/code&gt; pairs of integers representing the vertices of the polygon in order. There is no fixed orientation for the input — it could be clockwise or anticlockwise. You may write either a function or a full program for this challenge, and assume any clear (all integers distinguishable) and convenient list/string format for the input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may assume that no three &lt;em&gt;consecutive&lt;/em&gt; vertices of the polygon are collinear, i.e. there are no 180 degree angles. You may also assume that all coordinates are between 0 and 255 inclusive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output will be 2 pairs of integers representing a diagonal, which may also be in any clear and convenient list/string format.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You must work in the integers or rationals. In particular, you &lt;strong&gt;cannot&lt;/strong&gt; use floating point integers, due to imprecision.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may not use any polygon-related builtins.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is code-golf, so the program in the fewest bytes wins.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For each case, the first line is the input polygon, and the second line is all possible edges which are a valid diagonal. You only need to output &lt;strong&gt;one&lt;/strong&gt; valid diagonal, and the vertices may be in either order.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Vertical diagonal&#xA;[(0, 0), (1, 1), (2, 0), (1, 3)]&#xA;[(1, 1), (1, 3)]&#xA;&#xA;Horizontal diagonal&#xA;[(5, 0), (3, 4), (8, 8), (6, 4)]&#xA;[(3, 4), (6, 4)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The relevant images are given below, in test case order (click the thumbnails to view).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ag5zz.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ag5zzs.png&quot; alt=&quot;Test 1&quot;&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/rUcBz.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/rUcBzs.png&quot; alt=&quot;Test 2&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(More cases to be added)&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="21487" LastEditorUserId="21487" LastEditDate="2015-03-19T10:47:43.193" LastActivityDate="2015-03-19T10:47:43.193" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4901" PostTypeId="2" ParentId="4891" CreationDate="2015-03-17T05:12:04.593" Score="2" Body="&lt;p&gt;If the author of a question modifies the default rules in such a way that your preferred language cannot compete, answer with the closest possible equivalent (e.g. a named function), and clearly indicate that your answer doesn't quite follow the rules, and hence is uneligible to win.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2015-03-17T05:12:04.593" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4905" PostTypeId="2" ParentId="2140" CreationDate="2015-03-17T22:59:44.257" Score="0" Body="&lt;h1&gt;Game Of Riches&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is a programming challenge based off the game &lt;a href=&quot;http://hyperhippo.ca/games/adventure-capitalist/&quot; rel=&quot;nofollow&quot;&gt;AdVenture Capitalist&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Goal Of The Game&lt;/h2&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The goal is to have the most angel investors after 1 month (2,592,000 seconds) of gameplay.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Angel Investors&lt;/h2&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Angel Investors are the primary way to increase your profit in the long run. Angel Investors can be sacrificed for Angel Upgrades. Angel Investors also increase your profit by &lt;code&gt;ANGEL_EFFECTIVENESS&lt;/code&gt;% each. For example, 20 angel investors increase your profit by 40%. You earn Angel Investors in proportion to the square root of your life earnings. The catch is that Angel Investors can only be used &lt;em&gt;after&lt;/em&gt; a reset.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;ANGEL_EFFECTIVENESS&lt;/code&gt; is &lt;code&gt;2&lt;/code&gt; by default. It can be increased by unlocks and upgrades.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Angel Investors are earned according to this formula: &lt;code&gt;150 * sqrt(LIFETIME_EARNINGS / 1e15)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Money&lt;/h2&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;You earn money through the use of businesses. Money is used to purchase businesses and upgrades. The more money you have earned in your lifetime (since your program started execution), the more angels flock to your cause.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Businesses&lt;/h2&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Businesses can earn you money. There are 10 types of businesses. The price of a business increases exponentially. You can also earn unlocks by achieving certain numbers of businesses. You start with 1 lemonade stand.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Name               |    Base Price   |  Base Profit / second  | Price Increase per Purchase&#xA;-------------------------------------------------------------------------------------------&#xA;LEMONADE_STAND     |              $4 |                  $1.66 | 7%&#xA;NEWSPAPER_DELIVERY |             $60 |                    $20 | 15%&#xA;CAR_WASH           |            $720 |                    $90 | 14%&#xA;PIZZA_DELIVERY     |          $8,640 |                   $360 | 13%&#xA;DONUT_SHOP         |        $103,680 |                 $2,160 | 12%&#xA;SHRIMP_BOAT        |      $1,244,160 |                 $6,480 | 11%&#xA;HOCKEY_TEAM        |     $14,929,920 |                $19,440 | 10%&#xA;MOVIE_STUDIO       |    $179,159,040 |                $58,320 | 9%&#xA;BANK               |  $2,149,908,480 |               $174,960 | 8%&#xA;OIL_COMPANY        | $25,798,901,760 |               $804,816 | 7%&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Unlocks&lt;/h2&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Unlocks are bonuses that are earned when a set goal has been achieved.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example list (not actual):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;LEMONADE_STAND;25;LEMONADE_STAND;PROFIT;2&#xA;NEWSPAPER_STAND;900;OIL_COMPANY;PROFIT;11&#xA;ALL;2222;ALL;PROFIT;2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Upgrades&lt;/h2&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Upgrades are bonuses that are purchased with money or angels. See Angel Upgrades for details on upgrades that are purchased with angels.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example list (not actual):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0;CASH;2.5e5;LEMONADE_STAND;PROFIT;3&#xA;1;CASH;500000;NEWSPAPER_DELIVERY;PROFIT;3&#xA;2;CASH;1e21;ANGEL;EFFECTIVENESS;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Angel Upgrades&lt;/h2&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Angel Upgrades are bonuses that are purchased with the sacrifice of angels. Angels sacrificed for this purpose are &lt;strong&gt;not&lt;/strong&gt; regained on reset of a game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example list (not actual):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3;ANGEL;10000;ALL;PROFIT;3&#xA;4;ANGEL;1e32;CAR_WASH;COUNT;100&#xA;5;ANGEL;3.4e134;ANGEL;EFFECTIVENESS;10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Resetting&lt;/h2&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;When you reset your game, you lose all unlocks, upgrades, businesses, and money that you had. You start out with 1 lemonade stand all over again. So why would you want to do that? Because all angels that you may have earned last session are now activated. The angels that you didn't spend last session are also carried over. With these angels, you can earn larger profits faster than those earned in last session.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lifetime earnings are &lt;strong&gt;&lt;em&gt;not&lt;/em&gt;&lt;/strong&gt; reset when you reset.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The angels gained with reset is &lt;code&gt;150 * sqrt(LIFETIME_EARNINGS / 1e15) - ANGELS - ANGELS_SACRIFICED&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Bot Details&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Your bot will be an independent program that sends and receives input and output through stdout, and stdin. They are allowed to write to and create files in the directory that they are in. All files that they create must be destroyed on death of the program. The program must be deterministic. If the program does not finish the game within 5 minutes, it is disqualified.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your bot can send through stdout requests for information. Here is a list of each request along with the reply:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Request                                                                                    Reply&#xA;------------------------------------------------------------------------------------------------&#xA;TIME                                                                        game time in seconds&#xA;TIME_LEFT                                                              game time left in seconds&#xA;MONEY                                                                               cash on hand&#xA;LIFETIME_EARNINGS                                                              lifetime earnings&#xA;ANGELS                                                                             active angels&#xA;ANGELS_SACRIFICED                                       number of angels sacrificed in life-time&#xA;ANGELS_GAIN                                   number of angels that would be gained with a reset&#xA;COUNT type†                                                                       number of type&#xA;COST type†                                                                     cost of next type&#xA;PROFIT type†                                                               profit of all of type&#xA;UPGRADE or CASH_UPGRADE                                     the next cash upgrade you can afford&#xA;ANGEL_UPGRADE                                              the next angel upgrade you can afford&#xA;UPGRADES                                              the newline separated list of all upgrades&#xA;CASH_UPGRADES                                    the newline separated list of all cash upgrades&#xA;ANGEL_UPGRADES                                  the newline separated list of all angel upgrades&#xA;UPGRADE id                                                         the description of an upgrade&#xA;NEXT_UNLOCK type†                                                 the next unlock with type type&#xA;UNLOCKS                                                the newline separated list of all unlocks&#xA;UNLOCKS type†                           the newline separated list of all unlocks with type type&#xA;UNLOCK id                                                           the description of an unlock&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;† One of &lt;code&gt;LEMONADE_STAND&lt;/code&gt;,&lt;code&gt;NEWSPAPER_DELIVERY&lt;/code&gt;, &lt;code&gt;CAR_WASH&lt;/code&gt;, &lt;code&gt;PIZZA_DELIVERY&lt;/code&gt;, &lt;code&gt;DONUT_SHOP&lt;/code&gt;, &lt;code&gt;SHRIMP_BOAT&lt;/code&gt;, &lt;code&gt;MOVIE_STUDIO&lt;/code&gt;, &lt;code&gt;BANK&lt;/code&gt;, &lt;code&gt;OIL_COMPANY&lt;/code&gt;, &lt;code&gt;ALL&lt;/code&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;These commands return no value:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Request                                                                                                  Action&#xA;---------------------------------------------------------------------------------------------------------------&#xA;WAIT seconds                                                                              warps forward in time&#xA;WAIT_MONEY x                                                                     waits until you have x dollars&#xA;WAIT_ANGEL x                                                                      waits until you have x angels&#xA;BUY type amount                 purchases items one at a time, waiting as needed until you can afford each item&#xA;RESET                                                                                        resets the session&#xA;BUY_UPGRADE id                                                                             purchases an upgrade&#xA;If you can't afford the upgrade it will wait until you can afford it if it is a CASH upgrade or will return &#xA;immediately if it is an ANGEL upgrade&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Format of an upgrade string: &lt;code&gt;id;purchased[5];typeOfUpgrade[1];cost;bonus_string&lt;/code&gt;&lt;br&gt;&#xA;Format of an unlock string: &lt;code&gt;id;achieved[5];typeOfUnlock[2];amountNeeded;bonus_string&lt;/code&gt;&lt;br&gt;&#xA;Format of a bonus string: &lt;code&gt;type[3];subtype[4];amount&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If subtype is &lt;code&gt;PROFIT&lt;/code&gt; or &lt;code&gt;COST&lt;/code&gt;, the bonus is applied multiplicatively, otherwise the bonus is applied additively.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;[1]: One of &lt;code&gt;CASH&lt;/code&gt;, &lt;code&gt;ANGEL&lt;/code&gt;&lt;br&gt;&#xA;[2]: One of &lt;code&gt;LEMONADE_STAND&lt;/code&gt;,&lt;code&gt;NEWSPAPER_DELIVERY&lt;/code&gt;, &lt;code&gt;CAR_WASH&lt;/code&gt;, &lt;code&gt;PIZZA_DELIVERY&lt;/code&gt;, &lt;code&gt;DONUT_SHOP&lt;/code&gt;, &lt;code&gt;SHRIMP_BOAT&lt;/code&gt;, &lt;code&gt;MOVIE_STUDIO&lt;/code&gt;, &lt;code&gt;BANK&lt;/code&gt;, &lt;code&gt;OIL_COMPANY&lt;/code&gt;, &lt;code&gt;ALL&lt;/code&gt;&lt;br&gt;&#xA;[3]: One of &lt;code&gt;ANGEL&lt;/code&gt;, &lt;code&gt;LEMONADE_STAND&lt;/code&gt;,&lt;code&gt;NEWSPAPER_DELIVERY&lt;/code&gt;, &lt;code&gt;CAR_WASH&lt;/code&gt;, &lt;code&gt;PIZZA_DELIVERY&lt;/code&gt;, &lt;code&gt;DONUT_SHOP&lt;/code&gt;, &lt;code&gt;SHRIMP_BOAT&lt;/code&gt;, &lt;code&gt;MOVIE_STUDIO&lt;/code&gt;, &lt;code&gt;BANK&lt;/code&gt;, &lt;code&gt;OIL_COMPANY&lt;/code&gt;, &lt;code&gt;ALL&lt;/code&gt;&lt;br&gt;&#xA;[4]: &lt;code&gt;EFFECTIVENESS&lt;/code&gt; if type is &lt;code&gt;ANGEL&lt;/code&gt;; otherwise one of &lt;code&gt;COUNT&lt;/code&gt;, &lt;code&gt;PROFIT&lt;/code&gt;, &lt;code&gt;COST&lt;/code&gt;&lt;br&gt;&#xA;[5]: One of &lt;code&gt;true&lt;/code&gt; or &lt;code&gt;false&lt;/code&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Controller:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;TODO&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Score:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your score is determined as &lt;code&gt;log10(ANGEL_TOTAL)&lt;/code&gt;. The person with the largest score wins the contest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;ANGEL_TOTAL&lt;/code&gt; is determined by adding all active angels, sacrificed angels, and the number of angels you would gain with a reset.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Leaderboard:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;N/A&lt;/p&gt;&#xA;&#xA;&lt;p&gt;tag: &lt;code&gt;code-challenge&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="32700" LastEditorUserId="32700" LastEditDate="2015-03-24T20:52:29.853" LastActivityDate="2015-03-24T20:52:29.853" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="4906" PostTypeId="2" ParentId="4867" CreationDate="2015-03-18T03:21:45.820" Score="10" Body="&lt;h1&gt;Future languages should be allowed to win&lt;/h1&gt;&#xA;&lt;p&gt;Creating or using a language specific to the task is really a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/standard-loopholes-which-are-no-longer-funny&quot;&gt;loophole&lt;/a&gt;, and should be treated as such.&lt;/p&gt;&#xA;&lt;p&gt;However, with new, useful languages coming into existence and with old languages being improved (C++, CJam, Python), it doesn't make sense to disallow their usage.&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, in the future, our most popular posts will still get answers, and considering language development will hopefully still be going on, it'll prevent many of our future users from posting/winning.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-03-18T03:26:46.110" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="4908" PostTypeId="2" ParentId="2140" CreationDate="2015-03-19T18:51:33.697" Score="1" Body="&lt;h1&gt;It's just a flesh wound!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The idea is to create a program that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If any one of the four quarters (counted in bytes) is removed, the program outputs &quot;Tis' but a scratch&quot; (exactly, with optional newline).&lt;/li&gt;&#xA;&lt;li&gt;If any two of the four quarters are removed, the program outputs &quot;Just a flesh wound.&quot;.&lt;/li&gt;&#xA;&lt;li&gt;If any three of the four quarters are removed, the program outputs &quot;Let's call it a draw, then.&quot;.&lt;/li&gt;&#xA;&lt;li&gt;The full program should output &quot;None shall pass.&quot;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program has to have length divisible by four (4).&lt;/li&gt;&#xA;&lt;li&gt;The program must not read it's own source or it's length in any way.&lt;/li&gt;&#xA;&lt;li&gt;The output is to stdout if it is possible in your language (REPL output is considered valid in this case).&lt;/li&gt;&#xA;&lt;li&gt;The answer with the fewest bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20356" LastEditorUserId="20356" LastEditDate="2015-04-07T15:41:30.717" LastActivityDate="2015-04-07T15:41:30.717" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="4909" PostTypeId="1" CreationDate="2015-03-19T20:23:10.910" Score="8" ViewCount="238" Body="&lt;p&gt;From &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet&quot;&gt;Default for Code Golf: Program, Function or Snippet?&lt;/a&gt;, it is clear that the default for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is to allow program and function answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For function-only answers, it may be advantageous for answers to include a complete test program that calls the function for some examples, so that it is easy for users unfamiliar with the given language to verify the answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we require this?&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2015-03-21T20:25:34.343" Title="Function-only answers to function-or-program questions should provide a test program" Tags="|discussion|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4910" PostTypeId="2" ParentId="4909" CreationDate="2015-03-19T20:23:41.423" Score="-2" Body="&lt;p&gt;A test program should be required.  Functions are useless to users unfamiliar with the language of the given answer.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastActivityDate="2015-03-19T20:23:41.423" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4911" PostTypeId="2" ParentId="4909" CreationDate="2015-03-19T20:25:24.863" Score="17" Body="&lt;p&gt;A test program is helpful, but not required.  The usefulness of an answer drives the vote score.  This should be incentive enough for users to include a test program.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastActivityDate="2015-03-19T20:25:24.863" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4912" PostTypeId="2" ParentId="2140" CreationDate="2015-03-20T01:19:32.750" Score="0" Body="&lt;h1&gt;Design Logic Circuits with CSWAP Gates&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A &lt;strong&gt;universal logic gate&lt;/strong&gt; is a logic gate is one that is capable of creating any other logic gate or circuit.  For example, it is possible to wire together dozens of NAND gates to form any logic circuit you so desire.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Beyond a universal gate, a &lt;strong&gt;reversible logic gate&lt;/strong&gt; is one whose (multiple) outputs can be used to determine the input.  One notable reversible universal gate is the &lt;a href=&quot;http://en.wikipedia.org/wiki/Fredkin_gate&quot; rel=&quot;nofollow&quot;&gt;Fredkin Gate&lt;/a&gt;, also known as the CSWAP gate.  This gate has three inputs and three outputs, yet is very simple.  CSWAP stands for &quot;controlled swap&quot; and describes exactly what the gate does.  If the first input is a &lt;code&gt;0&lt;/code&gt;, the three outputs are the same as the three inputs.  If the first input is a &lt;code&gt;1&lt;/code&gt;, the second and third outputs are swapped.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is the ever-so-important truth table.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;in  | out&#xA;----+----&#xA;000 | 000&#xA;001 | 001&#xA;010 | 010&#xA;011 | 011&#xA;100 | 100&#xA;101 | 110&#xA;110 | 101&#xA;111 | 111&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You goal is to write a program that takes a truth table as input and constructs a logic circuit to match it. (other ideas are taking a non-CSWAP circuit as input and converting it to CSWAP).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are the rules of circuit design:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A circuit has a certain number of inputs and outputs, the quantities of which will be given.&lt;/li&gt;&#xA;&lt;li&gt;You have an unlimited supply of CWAP gates with which to construct circuits.&lt;/li&gt;&#xA;&lt;li&gt;You also have an unlimited supply of constants (a source that always takes on the assigned value) and trash bins (a place to send an unneeded bit).&lt;/li&gt;&#xA;&lt;li&gt;Each data source (circuit input / gate output / constant) must be linked via wire to exactly one data sink (circuit output / gate input / trash bin), and vice-versa.&lt;/li&gt;&#xA;&lt;li&gt;Possible extra rule: no loops in the circuit.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;ASCII representation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Using ASCII to draw the circuits may be unnecessary, but here is how it could be done.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Wires are &lt;code&gt;-&lt;/code&gt; and &lt;code&gt;|&lt;/code&gt;, which connect the two horizontally or vertically adjacent cells.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Inputs are capital letters, while outputs are lowercase letters.  Constants are 1s and 0s.  Trash bins are &lt;code&gt;#&lt;/code&gt;.  &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;CSWAP gates are formed by &lt;code&gt;OXX&lt;/code&gt; in any of the four basic orientations. The &lt;code&gt;O&lt;/code&gt; is the control, while &lt;code&gt;XX&lt;/code&gt; are the two inputs/outputs to be swapped.  I might need to adjust this so that adjacent gates with multiple orientations are unambiguous.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;AND gate&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A-O-#&#xA;B-X-#&#xA;0-X-a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;NOT gate&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A-O-#&#xA;0-X-#&#xA;1-X-a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(more details coming sometime not now)&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2015-03-20T12:58:47.383" LastActivityDate="2015-03-20T12:58:47.383" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4913" PostTypeId="2" ParentId="2140" CreationDate="2015-03-20T19:31:28.500" Score="1" Body="&lt;h1&gt;Fortnightly Challenge #8: A new kind of &quot;asynchronous&quot; KOTH&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a placeholder for the challenge spec.  You can discuss this challenge in &lt;a href=&quot;http://chat.stackexchange.com/rooms/22138/fortnightly-challenge-of-2015-03-20-asynchronous-koth&quot;&gt;a special chat room&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Ordinary KOTHs require that a single user take up the job of hosting the competition: running the whole competition at once by themselves. Everything is dependent on them, and they can only run so many competitions or update ever so frequently. I think this can be improved... somehow.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some ideas, many of which would require an encryption scheme or something to ensure correctness.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Anybody can run the tournament and add their results to the current leaderboard somehow. This could be accomplished by some sort of cryptographic scheme to verify the results. Ideally the controller will be implemented via stack snippet to allow ordinary people to run it without downloading a controller.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When a bot is added/updated, only the new pairs of contestants should be tried, and nearly anyone can update the leaderboard by themselves. (Assuming a deterministic KOTH, which it will probably need to be in order to prevent people from simply uploading the results that occurred in their favor.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2018-02-12T01:32:50.503" LastActivityDate="2018-02-12T01:32:50.503" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4914" PostTypeId="1" AcceptedAnswerId="4928" CreationDate="2015-03-21T13:41:29.337" Score="2" ViewCount="292" Body="&lt;p&gt;As part of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/4884/8478&quot;&gt;The Great Tagging Survey&lt;/a&gt;, I've noticed that the pluralisation of our tags is a bit inconsistent. The following lists all tags that refer to some kind of object that is dealt with in the corresponding challenges.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Singular&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fractal&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fractal&amp;#39;&quot; rel=&quot;tag&quot;&gt;fractal&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/palindrome&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;palindrome&amp;#39;&quot; rel=&quot;tag&quot;&gt;palindrome&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/word&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;word&amp;#39;&quot; rel=&quot;tag&quot;&gt;word&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/board-game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;board-game&amp;#39;&quot; rel=&quot;tag&quot;&gt;board-game&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/animation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;animation&amp;#39;&quot; rel=&quot;tag&quot;&gt;animation&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/subsequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;subsequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;subsequence&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/markov-chain&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;markov-chain&amp;#39;&quot; rel=&quot;tag&quot;&gt;markov-chain&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Plural&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphs&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphs&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphs&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/logic-gates&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;logic-gates&amp;#39;&quot; rel=&quot;tag&quot;&gt;logic-gates&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/data-structures&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;data-structures&amp;#39;&quot; rel=&quot;tag&quot;&gt;data-structures&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/complex-numbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;complex-numbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;complex-numbers&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/roman-numerals&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;roman-numerals&amp;#39;&quot; rel=&quot;tag&quot;&gt;roman-numerals&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cellular-automata&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cellular-automata&amp;#39;&quot; rel=&quot;tag&quot;&gt;cellular-automata&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/anagrams&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;anagrams&amp;#39;&quot; rel=&quot;tag&quot;&gt;anagrams&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grammars&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grammars&amp;#39;&quot; rel=&quot;tag&quot;&gt;grammars&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is probably not a huge deal, but I think it would be nicer if this was consistent. I don't know if devs can rename tags (although I think they can since they can also delete them), but maybe we want to at least set up a guideline for future tags?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'll add a few answers, please vote according to your preference or add your own answer.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2015-03-23T18:54:43.520" Title="Should tags be plural or singular?" Tags="|discussion|policy|tags|" AnswerCount="6" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4915" PostTypeId="2" ParentId="4914" CreationDate="2015-03-21T13:41:29.337" Score="2" Body="&lt;h1&gt;Tags should be plural, please fix the existing ones if possible&lt;/h1&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-03-21T13:41:29.337" CommentCount="1" CommunityOwnedDate="2015-03-21T13:41:29.337" ContentLicense="CC BY-SA 3.0" />
  <row Id="4916" PostTypeId="2" ParentId="4914" CreationDate="2015-03-21T13:42:35.720" Score="1" Body="&lt;h1&gt;Tags should be singular, please fix the existing ones if possible&lt;/h1&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-03-21T13:42:35.720" CommentCount="0" CommunityOwnedDate="2015-03-21T13:42:35.720" ContentLicense="CC BY-SA 3.0" />
  <row Id="4917" PostTypeId="2" ParentId="4914" CreationDate="2015-03-21T13:43:45.833" Score="1" Body="&lt;h1&gt;Future tags should be plural, but don't fix the existing ones&lt;/h1&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-03-21T13:43:45.833" CommentCount="1" CommunityOwnedDate="2015-03-21T13:43:45.833" ContentLicense="CC BY-SA 3.0" />
  <row Id="4918" PostTypeId="2" ParentId="4914" CreationDate="2015-03-21T13:44:54.377" Score="0" Body="&lt;h1&gt;Future tags should be singular, but don't fix the existing ones&lt;/h1&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-03-21T13:44:54.377" CommentCount="0" CommunityOwnedDate="2015-03-21T13:44:54.377" ContentLicense="CC BY-SA 3.0" />
  <row Id="4919" PostTypeId="2" ParentId="4914" CreationDate="2015-03-21T13:45:56.303" Score="0" Body="&lt;h1&gt;It doesn't matter. Flip a coin for all I care!&lt;/h1&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-03-21T13:45:56.303" CommentCount="1" CommunityOwnedDate="2015-03-21T13:45:56.303" ContentLicense="CC BY-SA 3.0" />
  <row Id="4920" PostTypeId="2" ParentId="4909" CreationDate="2015-03-21T20:25:34.343" Score="6" Body="&lt;p&gt;What should be required, in my opinion, is what the function which solves the problem is called. Since an answer may define many functions, this should be clarified.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is especially important in languages such as Pyth, where a named function may be defined without using the name anywhere in the program.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2015-03-21T20:25:34.343" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4922" PostTypeId="1" CreationDate="2015-03-22T19:47:21.293" Score="5" ViewCount="197" Body="&lt;p&gt;This mostly applies to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it allowed to use non-printable characters in answers? This effectively makes the answer a string of bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If yes, how is the answer supposed to be supplied, considering that non-printable characters won't be correctly displayed?&lt;/p&gt;&#xA;" OwnerUserId="4162" LastActivityDate="2015-03-22T19:51:12.380" Title="Non-printable characters in answer?" Tags="|support|answers|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4923" PostTypeId="2" ParentId="4922" CreationDate="2015-03-22T19:51:12.380" Score="5" Body="&lt;p&gt;Yes, you can use binary answers. Provide a hexdump of your solution if it's otherwise ambiguous.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2015-03-22T19:51:12.380" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="4924" PostTypeId="2" ParentId="4877" CreationDate="2015-03-22T21:00:07.207" Score="29" Body="&lt;p&gt;Instead of arguing about what counts as a &quot;real&quot; or &quot;proper&quot; quine, which I suspect is too subjective and context-dependant to ever permit a non-contentious definition, let me try to instead suggest a related, hopefully slightly less loaded dichotomy:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Definition: A quine is &lt;strong&gt;payload-capable&lt;/strong&gt; if it can be extended, in some systematic manner, to include a &quot;payload&quot; of additional code capable of performing arbitrary computation, in addition to printing its source code.  A payload-capable quine, in its base form, must include all the code necessary to carry and execute a payload, even if no actual payload is present.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Examples:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;{whatever}&lt;/code&gt; is a GolfScript quine, but it is not payload-capable.  Neither is &lt;code&gt;1&lt;/code&gt; or an empty program.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;{&quot;.~&quot;}.~&lt;/code&gt;, however, &lt;em&gt;is&lt;/em&gt; a payload-capable quine in GolfScript, as it can be extended to &lt;code&gt;{&quot;.~&quot;anything}.~&lt;/code&gt;, where &lt;code&gt;anything&lt;/code&gt; is arbitrary GolfScript code that is executed by the GolfScript interpreter.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;&quot;.`\\&quot;.`\&lt;/code&gt; is also payload-capable, as it can be extended to &lt;code&gt;&quot;.`\\foo&quot;.`\foo&lt;/code&gt;, where &lt;code&gt;foo&lt;/code&gt; is arbitrary GolfScript code (and where any special characters in the first instance of &lt;code&gt;foo&lt;/code&gt; are escaped according to the GolfScript double-quoted string escaping rules).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Any file that does not include the string &lt;code&gt;&amp;lt;?&lt;/code&gt; is a PHP quine, but no such quine is payload-capable (as they'd have to include &lt;code&gt;&amp;lt;?&lt;/code&gt; to execute the payload).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;open+0;print&amp;lt;0&amp;gt;&lt;/code&gt; is a payload-capable Perl quine, although it &quot;cheats&quot; by reading its own source code.  &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Notes:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This definition deliberately focuses on a single aspect, the ability to carry out arbitrary computation as part of the quine.  It does not even attempt to rule out other types of &quot;improper&quot; quines, such as those that read their own source code or that use string eval.  If one would like to exclude such, one might require e.g. that:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&quot;Solutions must be &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4924&quot;&gt;payload-capable&lt;/a&gt;, and must not read their source code or use string eval.&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;(Tangentially, as a fair warning, &lt;code&gt;{&quot;.~&quot;}.~&lt;/code&gt; is still a valid payload-capable quine even if string eval is forbidden, as is &lt;code&gt;function q(){return q+&quot;;q()&quot;};q()&lt;/code&gt; in JavaScript; both simply exploit a convenient language feature that makes functions stringify to their own source code.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I was tempted to call a payload-capable quine &quot;non-trivial&quot;, and those that cannot carry a payload &quot;trivial&quot;, but in the end, deliberately chose to use the most literally descriptive and non-loaded term possible.  In particular, the term &quot;payload-capable&quot; has the virtue of having no likely alternative interpretations: a person seeing it will either recognize (or guess) what it means, or will have to ask (or Google it, or follow a link, if provided).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some level of judgement may be required when deciding whether, in the absence of an actual payload, a given quine really does &quot;include all the code necessary to carry and execute a payload&quot;.  For example, the Perl quine &lt;code&gt;open+0;print&amp;lt;0&amp;gt;&lt;/code&gt; might require an extra semicolon between itself and the payload, but this is not true for &lt;em&gt;all&lt;/em&gt; payloads; indeed, for some payloads, it might be optimal to include the payload expression as an extra argument to the &lt;code&gt;print&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In any case, the &lt;em&gt;intent&lt;/em&gt; of this clause is simply to rule out silly and obtuse claims that, say, an empty program should be considered a payload-capable quine in GolfScript, just because the &lt;code&gt;{&quot;.~&quot;}.~&lt;/code&gt; can be added together with the payload.  Where there is genuine ambiguity, I would recommend lenience in enforcing this rule.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In any case, by far the best and least subjective way to decide the matter, at least in my personal opinion, is to simply design your challenge to include some extra task, in addition to merely printing out your source code, &lt;strong&gt;that requires an actual payload&lt;/strong&gt; to be included.  By doing so, any quibbles about whether a given quine is really payload-capable, or what counts as necessary code to execute a payload, are eliminated &amp;mdash; any quine that can perform the required extra task &lt;em&gt;is&lt;/em&gt; payload-capable by definition, and demonstrably includes all the necessary code.&lt;/p&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2015-03-22T21:09:16.557" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4925" PostTypeId="2" ParentId="2140" CreationDate="2015-03-22T22:39:02.297" Score="1" Body="&lt;p&gt;I've been reading this forum for a bit and I thought it might be a good idea to do a short sequence of challenges themed on famous mathematicians. It's my first post here so please point out any shortcomings.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is Irving Kaplansky's birthday today. Among other things he is famous for his &lt;a href=&quot;http://en.wikipedia.org/wiki/Kaplansky%27s_conjecture&quot; rel=&quot;nofollow&quot;&gt;conjectures&lt;/a&gt; on &lt;a href=&quot;http://en.wikipedia.org/wiki/Group_ring&quot; rel=&quot;nofollow&quot;&gt;group rings&lt;/a&gt;. It is one of these conjectures in mathematics that requires virtually no special knowledge to understand. There a couple of words that need explaining in them but their definitions are very simple. These words are &quot;&lt;a href=&quot;http://en.wikipedia.org/wiki/Group_%28mathematics%29&quot; rel=&quot;nofollow&quot;&gt;group&lt;/a&gt;&quot;,  &quot;&lt;a href=&quot;http://en.wikipedia.org/wiki/Torsion_%28algebra%29&quot; rel=&quot;nofollow&quot;&gt;torsion-free group&lt;/a&gt;&quot;, &quot;&lt;a href=&quot;http://en.wikipedia.org/wiki/Ring_%28mathematics%29&quot; rel=&quot;nofollow&quot;&gt;ring&lt;/a&gt;&quot;, &quot;&lt;a href=&quot;http://en.wikipedia.org/wiki/Domain_%28ring_theory%29&quot; rel=&quot;nofollow&quot;&gt;domain&lt;/a&gt;&quot;, &quot;&lt;a href=&quot;http://en.wikipedia.org/wiki/Group_ring&quot; rel=&quot;nofollow&quot;&gt;group ring&lt;/a&gt;&quot;, &quot;&lt;a href=&quot;http://en.wikipedia.org/wiki/Idempotence&quot; rel=&quot;nofollow&quot;&gt;idempotent&lt;/a&gt;&quot;, &quot;&lt;a href=&quot;http://en.wikipedia.org/wiki/Unit_%28ring_theory%29&quot; rel=&quot;nofollow&quot;&gt;unit&lt;/a&gt;&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please read up if you want to. This challenge doesn't require understanding these words or the conjecture. All that's needed is the concept of a finite cyclic group. I'm sure most of you know what it is, but I'll give a short introduction. A cyclic group of order n can be understood as what you get when you take something (whatever) called a generator, say p, and decide that it can be raised to integer powers. These powers can be multiplied like so: p&lt;sup&gt;k&lt;/sup&gt; * p&lt;sup&gt;l&lt;/sup&gt; = p&lt;sup&gt;k+l&lt;/sup&gt;. But there's one catch: whenever the exponents of the powers give the same remainder from the division by n, these powers are considered equal. This means, in particular, that there are exactly n powers really: p&lt;sup&gt;0&lt;/sup&gt;, p&lt;sup&gt;1&lt;/sup&gt;,...,p&lt;sup&gt;n-1&lt;/sup&gt;. Any other power is equal to one of these. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is to implement a certain operation on certain formal expressions involving these powers. The expressions are of this form:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;r&lt;sub&gt;0&lt;/sub&gt; * p&lt;sup&gt;0&lt;/sup&gt; + r&lt;sub&gt;1&lt;/sub&gt; * p&lt;sup&gt;1&lt;/sup&gt; + ... + r&lt;sub&gt;n-1&lt;/sub&gt; * p&lt;sup&gt;n-1&lt;/sup&gt;,&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;where all r&lt;sub&gt;i&lt;/sub&gt; are real numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The operation, called multiplication, consists in, first, multplying two such expressions as if they were real sums, that is for example, for n=3:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;(2 * p&lt;sup&gt;0&lt;/sup&gt; + 3 * p&lt;sup&gt;1&lt;/sup&gt; + 2 * p&lt;sup&gt;2&lt;/sup&gt;) * (0 * p&lt;sup&gt;0&lt;/sup&gt; + 1 * p&lt;sup&gt;1&lt;/sup&gt; + 2 * p&lt;sup&gt;2&lt;/sup&gt;)=&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;(2 * p&lt;sup&gt;0&lt;/sup&gt;) * (0 * p&lt;sup&gt;0&lt;/sup&gt;) + (2 * p&lt;sup&gt;0&lt;/sup&gt;) * (1 * p&lt;sup&gt;1&lt;/sup&gt;) + (2 * p&lt;sup&gt;0&lt;/sup&gt;) * (2 * p&lt;sup&gt;2&lt;/sup&gt;) +&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;(3 * p&lt;sup&gt;1&lt;/sup&gt;) * (0 * p&lt;sup&gt;0&lt;/sup&gt;) + (3 * p&lt;sup&gt;1&lt;/sup&gt;) * (1 * p&lt;sup&gt;1&lt;/sup&gt;) + (3 * p&lt;sup&gt;1&lt;/sup&gt;) + (2 * p&lt;sup&gt;2&lt;/sup&gt;) +&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;(2 * p&lt;sup&gt;2&lt;/sup&gt;) * (0 * p&lt;sup&gt;0&lt;/sup&gt;) + (2 * p&lt;sup&gt;2&lt;/sup&gt;) * (1 * p&lt;sup&gt;1&lt;/sup&gt;) + (2 * p&lt;sup&gt;2&lt;/sup&gt;) + (2 * p&lt;sup&gt;2&lt;/sup&gt;).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Then, we simplify each of the summands according to the rule&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;(r * p&lt;sup&gt;k&lt;/sup&gt;) * (s * p&lt;sup&gt;l&lt;/sup&gt;) = (r * s) * (p&lt;sup&gt;k&lt;/sup&gt; * p&lt;sup&gt;l&lt;/sup&gt;) = (r * s) * p&lt;sup&gt;k+l&lt;/sup&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;And finally, we simplify the resulting sum according to the rule&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;(r * p&lt;sup&gt;k&lt;/sup&gt;) + (s * p&lt;sup&gt;k&lt;/sup&gt;) = (r + s) * p&lt;sup&gt;k&lt;/sup&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This means that for n=3, we have 2 * p&lt;sup&gt;2&lt;/sup&gt; + 5 * p&lt;sup&gt;5&lt;/sup&gt; = 7 * p&lt;sup&gt;2&lt;/sup&gt; because p&lt;sup&gt;2&lt;/sup&gt;=p&lt;sup&gt;5&lt;/sup&gt;!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The resulting sum is again of the form&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;r&lt;sub&gt;0&lt;/sub&gt; * p&lt;sup&gt;0&lt;/sup&gt;+ r&lt;sub&gt;1&lt;/sub&gt; * p&lt;sup&gt;1&lt;/sup&gt; + ... + r&lt;sub&gt;n-1&lt;/sub&gt; * p&lt;sup&gt;n-1&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;after we order the summands by the exponents.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This operation is exactly the product in the group ring R[C], where R is the field of real numbers and C is a finite cyclic group. This group ring doesn't satisfy the hypothesis of Kaplansky's conjecture because finite cyclic groups aren't torsion-free.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to implement this in any language. Your program/procedure/whatever has to take a natural number n&gt;0 as user input. This will be the order of your cyclic group. Then it has to take 2n &quot;real numbers&quot; as user input. I don't really care what the &quot;real numbers&quot; are in your implementation. They could be ints for all I care. Just make them something that can reasonably be interpreted as real numbers and has a reasonable arithmetic. The first n numbers will be the coefficients of the first formal sum and the other n numbers will be the coefficients of the second formal sum. You need to output the n coefficients of their product. You don't need to compute the product in the way describe above. It just has to be correct (modulo rounding errors and other things computers do wrong with numbers).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Shortest code wins. You can assume the input is valid. Both input and output can be in any reasonable form. I'm not sure if this is a good restriction on this site, but I'd like you to think &quot;actually usable&quot;. Though I don't really care about how long it takes to compute. I guess all standard loopholes apply, as I've noticed it seems to be a mantra here. :-)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As I said, please help me improve this challenge and oh, feel free to edit.&lt;/p&gt;&#xA;" OwnerUserId="38630" LastEditorUserId="38630" LastEditDate="2015-03-23T01:50:37.630" LastActivityDate="2015-03-23T01:50:37.630" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="4926" PostTypeId="2" ParentId="2140" CreationDate="2015-03-23T04:11:39.533" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;**The Noether Challenge**&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is &lt;a href=&quot;http://en.wikipedia.org/wiki/Emmy_Noether&quot; rel=&quot;nofollow noreferrer&quot;&gt;Emmy Noether&lt;/a&gt;'s birthday. She was a pioneer in the field of &lt;a href=&quot;http://en.wikipedia.org/wiki/Ring_theory&quot; rel=&quot;nofollow noreferrer&quot;&gt;ring theory&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is to compute two graph-theoretic invariants of a certain graph we can associate with any ring R.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For this challenge, we don't require a unity (multiplicative neutral element) in R, do require the commutativity of multiplication, and additionally require that the ring have finitely many elements. That is, we want to consider finite commutative rings, not necessarily unitary. From now on, &quot;ring&quot; will mean just that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We will also need the concept of a zero divisor. A zero divisor of a ring R is an element r of R such that r*s=0 for some non-zero s in R. 0 is a trivial example of a zero divisor in any ring with more than one element since it can be shown that 0*s=0 always.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Something Emmy Noether didn't think about is zero-divisor graphs. They have, however, been quite extensively studied recently. The zero-divisor graph of a ring is simple, undirected graph formed as follows. The vertices are the the zero divisors excluding 0. Two vertices r and s are connected by an edge whenever r*s=0, excluding the cases in which r=s (that is excluding possible loops). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge you are given a file with (addition and) multiplication table(s) for some ring R as input. Your program in any language has to output the &lt;a href=&quot;http://en.wikipedia.org/wiki/Distance_%28graph_theory%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;diameter&lt;/a&gt; and the &lt;a href=&quot;http://en.wikipedia.org/wiki/Girth_%28graph_theory%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;girth&lt;/a&gt; of the zero-divisor graph of R. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The file's name is &quot;ring&quot; and it's a text file. You may assume any extension you wish. Depending on your preference, you may assume that the addition table is not present. If it is, it comes below the multiplication table. The ring is assumed to have at most 62 elements and the elements can be denoted by any subset of the alphanumeric characters including lower- and upper-case letters of the English alphabet. The only other characters assumed to be in the file are the whitespace, the newline, &quot;+&quot; and &quot;*&quot;. The &quot;0&quot; character is reserved for 0, so you don't need to check which label stands for 0. The rows and columns for 0 come next after the label rows and columns in both tables. The character &quot;1&quot; doesn't have any special meaning.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first row and the first column of each table are reserved for labels and the labels' order is the same everywhere (in both tables and both in the columns and in the rows). The upper-left-most character of the multiplication table is &quot;*&quot; and the upper-left-most character of the addition table is &quot;+&quot;. The characters in either table are not separated. &quot;*&quot; is the first character in the file. You may assume anything you want about the numbers of whitespaces that follow each row of either table before there's a new line. If two tables are present, they are separated by exactly one additional newline. You may assume whatever you want about the number of newlines and whitespace after the last table.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output is two numbers, in whatever human-readable and human-understandable form. And the form shouldn't make the user angry. They are to represent the girth and the diameter of the zero-divisor graph. If either of the invariants is infinite, again, it's up to you how you want to output them but it needs to be understandable. If you want to use a nonstandard symbol, like &quot;i&quot;, for that, tell the user what it means. We assume that the input is valid. In particular, we assume that the operations in the file are actually ring operations! Your code should be ready to go in whatever way is standard for your language of choice. It shouldn't need any more code to run.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Reading up and research are encouraged, but if you want to use some non-obvious mathematical fact, please give a source or a proof. And in general, please explain how your program works. All standard loopholes are disallowed.&lt;/p&gt;&#xA;" OwnerUserId="38630" LastEditorUserId="38630" LastEditDate="2016-03-08T14:18:13.670" LastActivityDate="2016-03-08T14:18:13.670" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="4928" PostTypeId="2" ParentId="4914" CreationDate="2015-03-23T18:54:43.520" Score="7" Body="&lt;h1&gt;Whichever one sounds better&lt;/h1&gt;&#xA;&lt;p&gt;The tag &lt;code&gt;roman-numeral&lt;/code&gt; would sound funny as this phrase is nearly always used in the plural. On the other hand, no one in his right mind would prefer &lt;code&gt;markov-chains&lt;/code&gt; to &lt;code&gt;markov-chain&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="30688" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-03-23T18:54:43.520" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4929" PostTypeId="1" CreationDate="2015-03-23T21:03:13.673" Score="27" ViewCount="594" Body="&lt;p&gt;As some of you know, I've joined Stack Exchange today as a core developer. As such, I'll be stepping down as a moderator. It's been a fun four years, and I'll miss this community a lot.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In exiting my moderation role, I've been thinking about whom I'd like to see join on as a moderator in my place. I've worked a lot with &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-b%C3%BCttner&quot;&gt;Martin Büttner&lt;/a&gt; on this site, and he is one of the most level-headed people I've had the pleasure of interacting with, anywhere on the Internet. I wholeheartedly endorse his appointment as a moderator.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Martin has asked me to write this post, to solicit views from the community about whom they'd like to see as a moderator. I should have thought to do this before, so I really appreciate his suggestion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Comments welcome.&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-04-06T17:48:10.990" Title="Replacement moderator proposal" Tags="|discussion|status-completed|moderators|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4930" PostTypeId="2" ParentId="4929" CreationDate="2015-03-23T21:25:49.493" Score="40" Body="&lt;p&gt;I disagree with this nomination.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;He'll do such a good job of being a moderator that he'll make all the rest of us look bad.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;:D&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In all seriousness, if @MartinBüttner isn't a good candidate for moderator, I don't know who is. He's extremely active on the main site, meta, and chat, and he's done volumes of work to help welcome new users, hash out policies on meta, and make PPCG an overall better place.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I do believe he exhibits each and every trait mentioned in &lt;a href=&quot;http://blog.stackoverflow.com/2010/07/moderator-pro-tempore/&quot;&gt;the Moderator Pro Tempore blog post&lt;/a&gt;, and I am quite confident that everyone here thinks that as well. It'd be a pleasure to work with him up to and perhaps through the beta period to maintain and improve our little corner of the Internet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, thanks @ChrisJester-Young for all the work you did in &quot;the early days&quot; of the site! Congrats on your new position at Stack Exchange, and may unicorns and waffles fill your days. ;)&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2015-03-23T21:25:49.493" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="4933" PostTypeId="1" AcceptedAnswerId="4934" CreationDate="2015-03-24T19:26:57.650" Score="14" ViewCount="1351" Body="&lt;p&gt;So far, submissions consisting of multiple files have simply been counted by summing up the scores of the individual files. Also file names aren't counted as long as they are arbitrary. (We do count file names if the code depends on them to work correctly, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/standard-loopholes-which-are-no-longer-funny?answertab=votes#comment3902_1072&quot;&gt;i.e. if actual code is outsourced to the file name&lt;/a&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've been making (ab?)use of that in &lt;a href=&quot;https://github.com/mbuettner/retina&quot; rel=&quot;nofollow noreferrer&quot;&gt;Retina&lt;/a&gt; by determining the mode of operation implicitly from the number of files supplied. I don't see this particular case as much of a loophole abuse (but rather as elegant golfing language design), but there definitely &lt;em&gt;is&lt;/em&gt; room for abuse:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;One could write a &lt;a href=&quot;http://esolangs.org/wiki/Unary&quot; rel=&quot;nofollow noreferrer&quot;&gt;Unary&lt;/a&gt; derivative that doesn't take a string of 0s, but instead whose program consists of N empty files, where the number of files is interpreted as the unary code. This would essentially give you score 0 for arbitrary programs.&lt;/li&gt;&#xA;&lt;li&gt;One could use two different files with arbitrary contents and encode a program in binary from the sequence they are given to the interpreter (the first being 1, the second 0, or vice versa).&lt;/li&gt;&#xA;&lt;li&gt;One could identify the most common character in a language, and split the code into files around that character (i.e. the interpreter joins the files together with that character).&lt;/li&gt;&#xA;&lt;li&gt;etc...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Before I'm &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/20720305#20720305&quot;&gt;further accused&lt;/a&gt; (winky face) of abusing loopholes, let's settle this and decide how we deal with multi-file programs when counting code golf.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2015-11-17T18:00:41.947" Title="Counting bytes for multi-file programs" Tags="|discussion|code-golf|policy|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4934" PostTypeId="2" ParentId="4933" CreationDate="2015-03-24T19:26:57.650" Score="22" Body="&lt;p&gt;This proposal is trying to close all of these loopholes with two policy changes.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;strong&gt;Add 1 byte or character for each file after the first.&lt;/strong&gt; This means that you can still split up your code into multiple files and even make the distribution into files significant for your program, but it's going to cost a little, which especially means that the Unary-derivative would be no more useful than Unary itself.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;If files are reused,&lt;/strong&gt; because multiple files in the program would be identical, you have to &lt;strong&gt;count the contents&lt;/strong&gt; of that file &lt;strong&gt;as many times as you use it&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If your invocation was  &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;./mylang file1 file2 file1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;your score would be the size of &lt;code&gt;file2&lt;/code&gt;, plus twice the size of &lt;code&gt;file1&lt;/code&gt;, plus &lt;code&gt;2&lt;/code&gt; (one for each file after the first).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I have considered another ruling for the second case: one can argue that it makes the file name significant. So instead of counting the file contents twice, you count them only once, but then you include the file name in the count for each time its used. In this case, in the above example, you'd probably name &lt;code&gt;file1&lt;/code&gt; just &lt;code&gt;a&lt;/code&gt; instead, so the invocation becomes&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;./mylang a file2 a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now the score is the size of &lt;code&gt;a&lt;/code&gt; (once), plus the size of &lt;code&gt;file2&lt;/code&gt;, plus &lt;code&gt;2&lt;/code&gt; (for each file after the first), plus &lt;code&gt;2&lt;/code&gt; (for using the significant file name &lt;code&gt;a&lt;/code&gt; twice).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let me know in the comments what you think about these two alternatives.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2015-11-17T18:00:41.947" LastActivityDate="2015-11-17T18:00:41.947" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="4935" PostTypeId="2" ParentId="2140" CreationDate="2015-03-24T19:32:00.063" Score="-3" Body="&lt;h1&gt;Identifying a Sonnet&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This challenge is about determining if a given file (read-in from stdin) meets the criteria to be a sonnet. You may use any language for this challenge. If your language supports an API to use an online dictionary you may use that API, if your language doesn't then too bad.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, it is preferred if your language is one that can be ran directly from the command line and is a language that has a compiler or interpreter available directly from my distro's repos(Fedora), as I would rather just use a bash script to test the various programs, then test each program manually.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Definition of a Sonnet&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Has 14 Lines (lines are denoted as the standard newline on your operating system).&lt;/li&gt;&#xA;&lt;li&gt;Has a definite rhyme scheme, it will have one of the following rhyme schemes&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;ABBA&lt;/code&gt; &lt;code&gt;ABBA&lt;/code&gt; &lt;code&gt;CD&lt;/code&gt; &lt;code&gt;CD&lt;/code&gt; &lt;code&gt;CD&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ABBA&lt;/code&gt; &lt;code&gt;ABBA&lt;/code&gt; &lt;code&gt;CDE&lt;/code&gt; &lt;code&gt;CDE&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ABAB&lt;/code&gt; &lt;code&gt;ABBA&lt;/code&gt; &lt;code&gt;EFEF&lt;/code&gt; &lt;code&gt;GG&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Iambic Pentameter - consists of alternating stressed, unstressed syllables. &#xA;This doesn't have to be perfect 100% of the time, just at least 50% of the&#xA;time.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In order for your program to declare a given string a sonnet, it must meet all of the above criteria.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Additional Notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You do not have to identify the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Thought Structure - too intense for a code golf challenge, and too subjective.&lt;/li&gt;&#xA;&lt;li&gt;Topic - computer lacks context to determine this&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input will be read from stdin. This is the string that you will be declaring &lt;em&gt;to be or not to be&lt;/em&gt; a sonnet.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your program will output either yes or no for the question:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Does this string meet the given requirements to be a sonnet?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;As this is code golf yes or no can be abbreviated to &lt;code&gt;Y/N&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Winner&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The solution with fewest number of bytes win that has the highest accuracy ratio for the correct identification of a sonnet. The preference is for higher accuracy rather than brevity of the program.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test Data and Resources&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Sonnet&quot; rel=&quot;nofollow&quot;&gt;Wikipedia&lt;/a&gt;  &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.webexhibits.org/poetry/explore_famous_sonnet_examples.html&quot; rel=&quot;nofollow&quot;&gt;Test Data&lt;/a&gt; - You have to copy and paste yourself, but it does have examples.  &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.shakespeares-sonnets.com/&quot; rel=&quot;nofollow&quot;&gt;Shakespheare?&lt;/a&gt; - All of Shakespheares sonnets are here&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;What is not a sonnet&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The following are examples that you program should return false on:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.poetryfoundation.org/poem/180445&quot; rel=&quot;nofollow&quot;&gt;Beowulf&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Haiku&lt;/li&gt;&#xA;&lt;li&gt;Input that doesn't have &lt;strong&gt;exactly&lt;/strong&gt; 14 Lines in it&lt;/li&gt;&#xA;&lt;li&gt;The text of this question.&lt;/li&gt;&#xA;&lt;li&gt;The text of just about any other question on StackExchange.&lt;/li&gt;&#xA;&lt;li&gt;Things that don't have a rhyme scheme. See Below&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Not A Sonnet&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A man got on a boat&#xA;The boat was leaky&#xA;and had poor construction&#xA;For it was made by a one-eyed blind man&#xA;and his dumb intern&#xA;As soon as he got out of port&#xA;at the fort&#xA;it started to sink&#xA;eventually, it tanked.&#xA;And it capsized&#xA;If only that shipwright&#xA;wasn't so blind deaf and dumb&#xA;as microsoft tech support&#xA;That's not much support at all.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="36073" LastEditorUserId="36073" LastEditDate="2015-03-25T21:09:44.633" LastActivityDate="2015-03-25T21:09:44.633" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="4937" PostTypeId="2" ParentId="4933" CreationDate="2015-03-24T19:56:13.980" Score="-1" Body="&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;For each extra file, add as many bytes to the score as when you required to type in those additional files.&lt;/strong&gt; Ideally you would want to save some bytes here and use single byte file names.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So suppose your code is split across file &lt;code&gt;a&lt;/code&gt;, &lt;code&gt;h&lt;/code&gt; and &lt;code&gt;k.txt&lt;/code&gt; and the code needs to be run like&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;myLang a h k.txt&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and also that the sum of code inside all these three files is 100 bytes, then your total score is &lt;code&gt;100 + 1 + 1 + 1 + 5 = 108&lt;/code&gt; bytes. That is &lt;code&gt;1&lt;/code&gt; for the space after &lt;code&gt;a&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt; for file name &lt;code&gt;h&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt; for space after &lt;code&gt;h&lt;/code&gt; and &lt;code&gt;5&lt;/code&gt; for filename &lt;code&gt;k.txt&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If you reuse a file, you have to count the contents of that file as many times as you use it along with the above rule&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="31414" LastActivityDate="2015-03-24T19:56:13.980" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="4938" PostTypeId="2" ParentId="4933" CreationDate="2015-03-24T21:40:20.410" Score="-3" Body="&lt;p&gt;&lt;strong&gt;This is &lt;em&gt;code&lt;/em&gt; golf. Count the total bytes of &lt;em&gt;code&lt;/em&gt;.&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you have &lt;em&gt;code&lt;/em&gt; in the file name, guess what? It's code! It counts!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you have 100 bytes of &lt;em&gt;code&lt;/em&gt; spread across three files, you score... wait for it... 100 bytes!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your compiler behaves differently based on the number of files provided, then congratulations. You get to make use of that language feature.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastActivityDate="2015-03-24T21:40:20.410" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4939" PostTypeId="1" AcceptedAnswerId="4940" CreationDate="2015-03-25T10:42:05.740" Score="28" ViewCount="2268" Body="&lt;p&gt;Simple question: if I answer a code golf with a function (&lt;em&gt;for a task which is supposed to terminate&lt;/em&gt;), does the function actually have to be reusable? Or could it, say, modify some globals which break the function when called again?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Note that this is &lt;em&gt;not&lt;/em&gt; about whether functions may modify their inputs. I'm assuming that for each subsequent use the function is called with fresh copies of their arguments.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2015-03-25T10:46:49.873" LastActivityDate="2015-03-27T13:33:49.097" Title="Do function submissions have to be reusable?" Tags="|discussion|code-golf|policy|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4940" PostTypeId="2" ParentId="4939" CreationDate="2015-03-25T10:42:44.063" Score="40" Body="&lt;h1&gt;Yes, functions have to be reusable arbitrarily often&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;That's the point of functions in the first place. If you want to break your environment, answer with a full program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By &quot;reusable&quot; I mean that the function still complies with all the rules of the spec after it's already been used. It doesn't necessarily have to behave identically if the spec gives some leeway in certain points.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="2867" LastEditDate="2015-03-27T13:33:49.097" LastActivityDate="2015-03-27T13:33:49.097" CommentCount="3" CommunityOwnedDate="2015-03-25T10:42:44.063" ContentLicense="CC BY-SA 3.0" />
  <row Id="4941" PostTypeId="2" ParentId="4939" CreationDate="2015-03-25T10:44:10.860" Score="0" Body="&lt;h1&gt;No, functions may break after use&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As long as the function completes successfully once, that's fine, just like with programs.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="20260" LastEditDate="2015-03-25T10:54:40.813" LastActivityDate="2015-03-25T10:54:40.813" CommentCount="1" CommunityOwnedDate="2015-03-25T10:44:10.860" ContentLicense="CC BY-SA 3.0" />
  <row Id="4942" PostTypeId="2" ParentId="2447" CreationDate="2015-03-25T10:51:38.187" Score="63" Body="&lt;h1&gt;Functions may output by modifying their arguments or writing to out arguments&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Here, &quot;out arguments&quot; refers to arguments that are passed in by reference, so that modifying the &lt;em&gt;value&lt;/em&gt; inside the function (as opposed to just overwriting the argument) also modifies the value outside the function (otherwise, the output value would not be observable after the function returns). Note that this is not possible in all languages with all types.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2017-06-28T09:45:48.707" LastActivityDate="2017-06-28T09:45:48.707" CommentCount="8" CommunityOwnedDate="2015-03-25T16:14:56.677" ContentLicense="CC BY-SA 3.0" />
  <row Id="4943" PostTypeId="2" ParentId="4939" CreationDate="2015-03-25T10:55:32.883" Score="-9" Body="&lt;h1&gt;Yes, functions have to be reusable arbitrarily often and behave exactly identically&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is essentially the same &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4940/8478&quot;&gt;as this answer&lt;/a&gt; but it requires that subsequent calls of the function are 100% indistinguishable, even if the spec leaves some leeway in behaviour.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Note that in the case of random challenges, the randomness and its distribution are part of the behaviour.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2015-03-25T11:19:52.063" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="4944" PostTypeId="1" CreationDate="2015-03-25T13:49:43.563" Score="35" ViewCount="3505" Body="&lt;p&gt;Some people have been linking to off-site resources for counting the length of an answer (mostly &lt;a href=&quot;https://mothereff.in/byte-counter&quot; rel=&quot;nofollow&quot;&gt;https://mothereff.in/byte-counter&lt;/a&gt;). Some people also pointed out that it only counts in UTF-8.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Well, I was bored so I created a snippet. It counts in UTF-8 if you paste in code, and counts in pure binary bytes if you either drop and drag a file, or select a file from a dialog. &lt;a href=&quot;https://gist.github.com/orlp/f639d5a3027c25ee6019&quot; rel=&quot;nofollow&quot;&gt;Raw non-minified source is here&lt;/a&gt; and a full page version can be found &lt;a href=&quot;https://rawgit.com/orlp/f639d5a3027c25ee6019/raw/gistfile1.html&quot; rel=&quot;nofollow&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It requires a modern browser supporting the HTML5 File API.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Byte counter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;!DOCTYPE html&amp;gt;&amp;lt;html&amp;gt;&amp;lt;head&amp;gt;&amp;lt;style type=text/css&amp;gt;html,body{margin:0;height:100%;overflow-y:hidden;font-family:'Helvetica Neue',Helvetica,Arial,sans-serif}#wrapper{overflow-y:hidden;margin:0;min-height:100%;padding:10px}#fileinput{display:none}#bytes,#chars{white-space:nowrap;font-weight:bold;font-size:20px;padding-right:10px}td{vertical-align:middle}table{margin-bottom:10px;margin-right:80px}#textinput{width:100%;box-sizing:border-box}&amp;lt;/style&amp;gt;&amp;lt;!--[if lte IE 6]&amp;gt;&amp;lt;style type=text/css&amp;gt;#container{height:100%}&amp;lt;/style&amp;gt;&amp;lt;![endif]--&amp;gt;&amp;lt;/head&amp;gt;&amp;lt;body&amp;gt;&amp;lt;div id=wrapper&amp;gt;&amp;lt;table&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td id=bytes&amp;gt;0 bytes&amp;lt;/td&amp;gt;&amp;lt;td rowspan=2&amp;gt;Drag and drop a file anywhere on this snippet, &amp;lt;a href=# id=fileselect&amp;gt;select a file using a dialog&amp;lt;/a&amp;gt;, or enter UTF-8 code in the textbox.&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td id=chars&amp;gt;0 chars&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;input type=file id=fileinput onchange=handle_file(this.files)&amp;gt;&amp;lt;textarea id=textinput onkeyup=textbox(this.value) onchange=textbox(this.value)&amp;gt;&amp;lt;/textarea&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;script src=https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js&amp;gt;&amp;lt;/script&amp;gt;&amp;lt;script type=text/javascript&amp;gt;function nodefault(a){a.stopPropagation();a.preventDefault()}function handle_file(b){var a=new FileReader();a.onload=function(c){$(&quot;#chars&quot;).text(a.result.length+&quot; chars&quot;)};a.readAsText(b[0],&quot;UTF-8&quot;);$(&quot;#bytes&quot;).text(b[0].size+&quot; bytes&quot;)}function textbox(a){$(&quot;#bytes&quot;).text((new Blob([a],{encoding:&quot;UTF-8&quot;,type:&quot;text/plain;charset=UTF-8&quot;})).size+&quot; bytes&quot;);$(&quot;#chars&quot;).text(a.length+&quot; chars&quot;)}function drop(a){nodefault(a);handle_file(a.dataTransfer.files)}function click(a){nodefault(a);$(&quot;#fileinput&quot;)[0].click()}$(document).ready(function(){var a=function(){$(&quot;#textinput&quot;).height($(window).height()-$(&quot;#textinput&quot;).offset().top-20)};$(window).resize(a);a()});document.body.addEventListener(&quot;dragenter&quot;,nodefault,false);document.body.addEventListener(&quot;dragover&quot;,nodefault,false);document.body.addEventListener(&quot;drop&quot;,drop,false);$(&quot;#fileselect&quot;).on(&quot;click&quot;,click);&amp;lt;/script&amp;gt;&amp;lt;/body&amp;gt;&amp;lt;/html&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="4162" LastEditorUserId="4162" LastEditDate="2015-03-25T14:46:30.347" LastActivityDate="2015-04-03T22:22:15.513" Title="Byte counter snippet" Tags="|discussion|stack-snippets|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="4946" PostTypeId="2" ParentId="4944" CreationDate="2015-03-25T14:00:54.340" Score="10" Body="&lt;h3&gt;Feature Request: Indicate if all characters are in ISO-8859-1&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If all characters have code points less than 256, one can encode the file in ISO-8859-1, which simply uses one byte for each character. It would be neat if the snippet checked whether that is possible, such that the character count (see other feature request) can be used directly as the byte count.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2015-03-25T14:20:57.460" LastActivityDate="2015-03-25T14:20:57.460" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="4947" PostTypeId="2" ParentId="2140" CreationDate="2015-03-25T15:56:20.143" Score="0" Body="&lt;h2&gt;&lt;strong&gt;Children Sum Game&lt;/strong&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When I was a kid I liked to play a sum game with my cousin (I don't know if there's a name for the game).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first player choose a number between 1 to 9, then by turns players go summing a number between 1 to 9 to the result until one is able to reach 100.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, the challenge consist in create a program to play this game. The program has to choose randomly if the human or the computer starts the game. The player should input the sum of a number between 1 to 9 and the previous result and the program should check if the sum is correct. Then the program should sum another number between 1 to 9 and give the result. Finally it should display a message.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's a example of the game, suppose computer starts:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Computer: 5&#xA;Player: 12&#xA;Computer: 18&#xA;Player: 25&#xA;Computer: 30&#xA;Player: 39&#xA;Computer: 42&#xA;Player: 55&#xA;Computer: Incorrect sum!&#xA;Player: 48&#xA;Computer: 57&#xA;Player: 65&#xA;Computer: 73&#xA;Player: 82&#xA;Computer: 90&#xA;Player: 92&#xA;Computer: 100&#xA;You lose!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Ideally, the program should have a strategy to make it difficult (for a kid) to win the game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Outputs should be: &lt;code&gt;You win!&lt;/code&gt;, &lt;code&gt;You lose!&lt;/code&gt; and &lt;code&gt;Incorrect sum!&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="38245" LastEditorUserId="38245" LastEditDate="2015-03-25T16:03:10.920" LastActivityDate="2015-03-25T16:03:10.920" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="4948" PostTypeId="2" ParentId="2140" CreationDate="2015-03-25T22:16:29.763" Score="0" Body="&lt;h1&gt;Help the President!&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There is an anonymous president of a country who needs your help! He wants to retain absolute control, but needs to have elections to prevent uprisings. They ask you to create a program to help them &lt;a href=&quot;http://en.wikipedia.org/wiki/Gerrymandering&quot; rel=&quot;nofollow noreferrer&quot;&gt;gerrymander&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These are the specifications:&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;(You will receive input via stdin or as a function argument)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will be given an array of arrays of strings to represent the locations of voters (a 2D matrix), i.e:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[&quot;Democratic&quot;, &quot;Republican&quot;, &quot;Republican&quot;, &quot;Democratic&quot;],&#xA; [&quot;Republican&quot;, &quot;Democratic&quot;, &quot;Democratic&quot;, &quot;Democratic&quot;],&#xA; [&quot;Democratic&quot;, &quot;Republican&quot;, &quot;Democratic&quot;, &quot;Republican&quot;],&#xA; [&quot;Democratic&quot;, &quot;Republican&quot;, &quot;Republican&quot;, &quot;Republican&quot;]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[&quot;Democratic&quot;, &quot;Republican&quot;, &quot;Republican&quot;, &quot;Democratic&quot;], [&quot;Republican&quot;, &quot;Democratic&quot;, &quot;Democratic&quot;, &quot;Democratic&quot;], [&quot;Democratic&quot;, &quot;Republican&quot;, &quot;Democratic&quot;, &quot;Republican&quot;], [&quot;Democratic&quot;, &quot;Republican&quot;, &quot;Republican&quot;, &quot;Republican&quot;]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You will also receive a party that is meant to win, like &lt;code&gt;&quot;Democratic&quot;&lt;/code&gt; or &lt;code&gt;&quot;Republican&quot;&lt;/code&gt;. These will be in the matrix.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thirdly, you will receive district sizes. The amount of items in the matrix will be a multiple of this. All districts must be this size.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An array of arrays of coordinates. Either the top left or the bottom left may be &lt;code&gt;[0, 0]&lt;/code&gt; or &lt;code&gt;[1, 1]&lt;/code&gt;. Going right increases the second number and going down / up increases / decreases the first number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This country uses a &lt;a href=&quot;http://en.wikipedia.org/wiki/First-past-the-post_voting&quot; rel=&quot;nofollow noreferrer&quot;&gt;first-past-the-post voting&lt;/a&gt; (Most votes win) per district (except if there is a tie, none of them win). You must split the matrix of voters into districts in such a way that the party wins as many districts as possible. A district is given by one of the arrays in the output. Districts must be contiguous, and going diagonally is &lt;em&gt;not&lt;/em&gt; contiguous. Some visualisations by &lt;a href=&quot;https://www.youtube.com/watch?v=Mky11UJb9AY&quot; rel=&quot;nofollow noreferrer&quot;&gt;this helpful CGP Grey video on Gerrymandering&lt;/a&gt; and one example outputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f([[&quot;D&quot;, &quot;R&quot;, &quot;D&quot;], [&quot;D&quot;, &quot;D&quot;, &quot;R&quot;], [&quot;D&quot;, &quot;D&quot;, &quot;R&quot;]], &quot;D&quot;, 3)&#xA;[[[0, 0], [0, 1], [1, 0]], [[0, 2], [1, 1], [1, 2]], [[2, 0], [2, 1], [2, 2]]]&#xA;# In this case, the D party wins all of the votes.&#xA;f([[&quot;D&quot;, &quot;R&quot;, &quot;D&quot;], [&quot;D&quot;, &quot;D&quot;, &quot;R&quot;], [&quot;D&quot;, &quot;D&quot;, &quot;R&quot;]], &quot;R&quot;, 3)&#xA;[[[0, 0], [0, 1], [0, 2]], [[1, 0], [1, 1], [1, 2]], [[2, 0], [2, 1], [2, 2]]]&#xA;# R wins a third of the seats&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;This demographic could be visualised as&#xA;&#xA;D  R  D&#xA;D  D  R&#xA;D  D  R&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(Note there may be many possible &quot;best&quot; district boundaries. In this case, return any of them. And in a case where there are two cases that give the party the same amount in both cases, but the second case gives a smaller majority to another party, return the latter)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f([[&quot;B&quot;, &quot;R&quot;, &quot;B&quot;, &quot;R&quot;, &quot;B&quot;], [&quot;G&quot;, &quot;B&quot;, &quot;G&quot;, &quot;R&quot;, &quot;Y&quot;], [&quot;G&quot;, &quot;R&quot;, &quot;Y&quot;, &quot;B&quot;, &quot;Y&quot;], [&quot;B&quot;, &quot;G&quot;, &quot;B&quot;, &quot;G&quot;, &quot;Y&quot;]], 4, &quot;Y&quot;)&#xA;[[[0, 0], [1, 0], [1, 1], [2, 0]], [[0, 1], [0, 2], [0, 3], [0, 4]], [[1, 2], [1, 3], [1, 4], [2, 3]], [[2, 1], [3, 0], [3, 1], [3, 2]], [[2, 3], [2, 4], [3, 3], [3, 4]]]&#xA;# In this election, Y wins 2, B wins 1 and 2 are undecided&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Sandbox notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This seems way too wordy for a problem which seems so simple. Any areas where it could be clarified to be more concise? I think it's my organisation of stuff that makes it unclear.&lt;/p&gt;&#xA;" OwnerDisplayName="user34736" LastEditorDisplayName="user34736" LastEditDate="2015-03-26T10:54:54.730" LastActivityDate="2015-03-26T10:54:54.730" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4951" PostTypeId="2" ParentId="2140" CreationDate="2015-03-27T22:52:08.737" Score="1" Body="&lt;h1&gt;Functioning HTML-Encoded Program&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Introduction&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When showing code to others on the web, some characters are generally replaced by their HTML-encoded entities. Browsers display this properly, but if a user copies the code directly from HTML or a script tries running the code without decoding its entities, the code will likely contain errors.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are to come up with a program that uses all of the following five characters: &lt;code&gt;&quot;&lt;/code&gt;, &lt;code&gt;&amp;amp;&lt;/code&gt;, &lt;code&gt;'&lt;/code&gt;, &lt;code&gt;&amp;lt;&lt;/code&gt;, and &lt;code&gt;&amp;gt;&lt;/code&gt;. When encoded to their named XHTML entities, the code must still run using the following respective entities: &lt;code&gt;&amp;amp;quot;&lt;/code&gt;, &lt;code&gt;&amp;amp;amp;&lt;/code&gt;, &lt;code&gt;&amp;amp;apos;&lt;/code&gt;, &lt;code&gt;&amp;amp;lt;&lt;/code&gt; and &lt;code&gt;&amp;amp;gt;&lt;/code&gt;. The code must be able to run both ways without throwing errors. Each of the five characters must be used outside of comments and string-like objects at least once (ie. for JS, outside of literal regex). You may use an expression in place of a statement up to one time (if your language supports it).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example JS Script (1/5 required characters)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Unencoded:&lt;/strong&gt; (Sets &lt;code&gt;lt&lt;/code&gt; to &lt;code&gt;true&lt;/code&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;var lt = 6;&#xA;lt = 3 &amp;lt; lt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;Encoded:&lt;/strong&gt; (Sets &lt;code&gt;lt&lt;/code&gt; to &lt;code&gt;2&lt;/code&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;var lt = 6;&#xA;lt = 3 &amp;amp;lt; lt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Encoder/Decoder&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's a converter to make testing your code easy (click run code to use):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;function encode() {&#xD;&#xA;  document.getElementById('post').value = document.getElementById('pre').value.replace(/&amp;amp;/g, '&amp;amp;amp;').replace(/&quot;/g, '&amp;amp;quot;').replace(/'/g, '&amp;amp;apos;').replace(/&amp;lt;/g, '&amp;amp;lt;').replace(/&amp;gt;/g, '&amp;amp;gt;');&#xD;&#xA;  if (entity=document.getElementById('pre').value.match(/&amp;amp;\S+?;/)) alert('Warning: Unencoded text may already have entities. (ie: ' + entity[0] + ')');&#xD;&#xA;} function decode() {&#xD;&#xA;  document.getElementById('pre').value = document.getElementById('post').value.replace(/&amp;amp;quot;/g, '&quot;').replace(/&amp;amp;apos;/g, '\'').replace(/&amp;amp;lt;/g, '&amp;lt;').replace(/&amp;amp;gt;/g, '&amp;gt;').replace(/&amp;amp;amp;/g, '&amp;amp;')&#xD;&#xA;  if (entity=document.getElementById('post').value.match(/&amp;amp;(?:[\s;]|[^\s;]*(?:\s|$))|&amp;lt;|&amp;gt;|'|&quot;/)) alert('Warning: Encoded text may contain unencoded characters. (ie: ' + entity[0][0] + ')');&#xD;&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;label for=&quot;pre&quot;&amp;gt;&amp;lt;b&amp;gt;Unencoded:&amp;lt;/b&amp;gt;&amp;lt;/label&amp;gt; &amp;lt;button onclick=&quot;encode()&quot;&amp;gt;Encode&amp;lt;/button&amp;gt;&amp;lt;br /&amp;gt;&amp;lt;textarea id=&quot;pre&quot; style=&quot;width:100%;min-height:49px;resize:vertical&quot;&amp;gt;&amp;lt;/textarea&amp;gt;&amp;lt;br /&amp;gt;&amp;lt;br /&amp;gt;&#xD;&#xA;&amp;lt;label for=&quot;post&quot;&amp;gt;&amp;lt;b&amp;gt;Encoded:&amp;lt;/b&amp;gt;&amp;lt;/label&amp;gt; &amp;lt;button onclick=&quot;decode()&quot;&amp;gt;Decode&amp;lt;/button&amp;gt;&amp;lt;br /&amp;gt;&amp;lt;textarea id=&quot;post&quot; style=&quot;width:100%;min-height:49px;resize:vertical&quot;&amp;gt;&amp;lt;/textarea&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The shortest functioning unencoded code block wins. Have fun!&lt;/p&gt;&#xA;" OwnerUserId="25368" LastActivityDate="2015-03-27T22:52:08.737" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4952" PostTypeId="2" ParentId="2140" CreationDate="2015-03-28T01:16:02.240" Score="2" Body="&lt;h1&gt;Print All Provable Statements&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This might be a stretch to make into a challenge, but I think it can be done.  The challenge will most likely be code-golf.  I'm thinking about using 2D geometry as the basis.  I will have to create a notation system for geometrical and logical statements that is golf-friendly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The general idea is that you start off with a list of known facts.  Then, the program uses the laws of logical deduction to work through every possible deduction that can be made, and then add these new facts back into the pool of knowledge.  Given enough time, every possible provable statement will show up in your list.  Of course, you will run out of memory first, and that's okay.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Probably the best axioms to use are &lt;a href=&quot;http://en.wikipedia.org/wiki/Tarski%27s_axioms&quot; rel=&quot;nofollow&quot;&gt;Tarski's Axioms&lt;/a&gt;. From the wiki article:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Tarski's system has the unusual property that all sentences can be written in universal-existential form, a special case of the prenex normal form. This form has all universal quantifiers preceding any existential quantifiers, so that all sentences can be recast in the form &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;∀u∀v...∃a∃b... &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;This fact allowed Tarski to prove that Euclidean geometry is decidable: there exists an algorithm which can determine the truth or falsity of any sentence. Tarski's axiomatization is also complete. This does not contradict Gödel's first incompleteness theorem, because Tarski's theory lacks the expressive power needed to interpret Robinson arithmetic (Franzén 2005, pp. 25–26).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;There are three (?) fundamental relations:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;x=y&lt;/code&gt; Equality - x and y refer to the same objects&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Bxyz&lt;/code&gt; Betweenness - The point z is between x and z, lying on line segment xz.  It is possible for &lt;code&gt;x=y&lt;/code&gt; or &lt;code&gt;y=z&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;wx~yz&lt;/code&gt; Congruence - The length of line segment wx is equal to the length of line segment yz.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There are three congruence axioms:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;xy~yx&lt;/code&gt; Reflexivity of Congruence&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;xy~zz → x=y&lt;/code&gt; Identity of Congruence&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;xy~zu &amp;amp; xy~vw → zu~wz&lt;/code&gt; Transitivity of Congruence&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There are also betweenness axioms:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;Bxyx → x=y&lt;/code&gt; Identity of betweenness&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Bxuz &amp;amp; Byvz → ∃a(Buay &amp;amp; Bvax)&lt;/code&gt; Axiom of Pasch&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Axiom Schema of Continuity: I'll need some help translating this.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;∃a∃b∃c(!Babc &amp;amp; !Bbca &amp;amp; !Bcab)&lt;/code&gt; Lower Dimension&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And some more:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;(xu~xv &amp;amp; yu~yv &amp;amp; zu~zv &amp;amp; u!=v) → (Bxyz | Byzx | Bzxy)&lt;/code&gt; Upper Dimension&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(Bxuv &amp;amp; Byux &amp;amp; x!=u) → ∃a∃b(Bxya &amp;amp; Bxzb &amp;amp; Bavb)&lt;/code&gt; Equivalent to Euclid's Axiom&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(x!=y &amp;amp; Bxyz &amp;amp; Bfgh &amp;amp; xy~fg &amp;amp; yz~gh &amp;amp; xu~fi &amp;amp; yu~gi) → zu~hi&lt;/code&gt; Five Point&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;∃z(Bxyz &amp;amp; yz~ab)&lt;/code&gt; Segment Construction&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Some notes on mathematical notation.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I think it would be a good idea to convert all math notation to ASCII.  I've done with with congruence already, but I need replacements for &lt;code&gt;→ ∃ ∀&lt;/code&gt;.  I might replace &lt;code&gt;a!=b&lt;/code&gt; with &lt;code&gt;!a=b&lt;/code&gt; for consistency, or I could go all-out and put everything in Polish notation.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;If I wanted fancier axioms&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here is an alternative set of axioms, which are based on &lt;a href=&quot;http://www.friesian.com/space.htm&quot; rel=&quot;nofollow&quot;&gt;Hilbert's geometry axioms&lt;/a&gt; but excluding the ones that talk about planes.  Some of them are copied verbatim from that website and may be unnecessarily fluffy.  I would have to re-write all of them to be in formal notation.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Given two distinct points A and B, then there exists exactly one line &lt;em&gt;a&lt;/em&gt; that contains both points.&lt;/li&gt;&#xA;&lt;li&gt;Given a line &lt;em&gt;a&lt;/em&gt;, there exist at least two distinct points A,B which lie on the line and three distinct points X,Y,Z which are not on the line.&lt;/li&gt;&#xA;&lt;li&gt;If a point B lies between points A and C, then points A,B,C are three distinct points on a line, and B also lies between C and C.&lt;/li&gt;&#xA;&lt;li&gt;For two distinct points A and C, there exists at least one distinct point B such that C lies between A and B. &lt;/li&gt;&#xA;&lt;li&gt;Of any three points on a line, there exists no more than one that lies between the other two.&lt;/li&gt;&#xA;&lt;li&gt;Let A, B, C be three points that do not lie on a line and let &lt;em&gt;a&lt;/em&gt; be a line  which does not meet any of the points A, B, C. If the line &lt;em&gt;a&lt;/em&gt; passes through a point of the segment AB, it also passes through a point of the segment AC, or through a point of the segment BC.&lt;/li&gt;&#xA;&lt;li&gt;If A, B are two points on a line a, and A' is a point on the same or on another line a' then it is always possible to find a point B' on a given side of the line a' through A' such that the segment AB is congruent or equal to the segment A'B'. In symbols AB = A'B'.&lt;/li&gt;&#xA;&lt;li&gt;If a segment A'B' and a segment A&quot;B&quot;, are congruent to the same segment AB, then the segment A'B' is also congruent to the segment A&quot;B&quot;, or briefly, if two segments are congruent to a third one they are congruent to each other.&lt;/li&gt;&#xA;&lt;li&gt;On the line a let AB and BC be two segments which except for B have no point in common. Furthermore, on the same or on another line &lt;em&gt;a'&lt;/em&gt; let A'B' and B'C' be two segments which except for B' also have no point in common. In the case, if AB = A'B' and BC = B'C' then AC = A'C'.&lt;/li&gt;&#xA;&lt;li&gt;Let angle(h,k) be an angle and &lt;em&gt;a'&lt;/em&gt; a line and let a definite side of &lt;em&gt;a'&lt;/em&gt;  be given. Let &lt;em&gt;h'&lt;/em&gt; be a ray on the line &lt;em&gt;a'&lt;/em&gt; that emanates from the point O'. Then there exists one and only one ray k' such that the angle(h,k) is congruent or equal to the angle(h',k') and at the same time all interior point of the angle(h',k') lie on the given side of &lt;em&gt;a'&lt;/em&gt;. Symbolically angle(h,k) = angle(h',k'). Every angle is congruent to itself, i.e., angle(h,k) = angle(h,k) is always true.&lt;/li&gt;&#xA;&lt;li&gt;If for two triangles ABC and A'B'C' the congruences AB = A'B', AC = A'C', angleBAC = angleB'A'C' hold, then the congruence angleABC = angleA'B'C' is also satisfied.&lt;/li&gt;&#xA;&lt;li&gt;Let &lt;em&gt;a&lt;/em&gt; be any line and A a point not on it. Then there is at most one line in the plane, determined by &lt;em&gt;a&lt;/em&gt; and A, that passes through A and does not intersect &lt;em&gt;a&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If AB and CD are any segments, then there exists a number &lt;em&gt;n&lt;/em&gt; such that &lt;em&gt;n&lt;/em&gt; segments CD constructed contiguously from A, along the ray from A through B, will pass beyond the point B.&lt;/li&gt;&#xA;&lt;li&gt;An extension of a set of points on a line with its order and congruence relations that would preserve the relations existing among the original elements as well as the fundamental properties of line order and congruence that follow from Axioms I-III, and from V,1 is impossible.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2015-03-28T01:16:02.240" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4960" PostTypeId="1" CreationDate="2015-03-30T18:15:50.187" Score="18" ViewCount="271" Body="&lt;p&gt;It's currently not looking good for the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/3578/8478&quot;&gt;fortnightly challenges&lt;/a&gt;. Of the last four challenges only one was actually posted. And the current one doesn't seem to be quite on track either.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It seems that the back-to-back fortnightly challenges are causing some fatigue, especially since it's usually the same core of users developing them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I propose we pause the challenges for a while, collect more themes in the linked post, and get back to it in a few months, so we can come up with some nice ideas everyone is sufficiently stoked about to actually pull it off.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you have a better idea for reviving the challenges, please leave an answer here. (And if you object to having a hiatus, please do as well!)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2015-03-30T18:15:50.187" Title="Hiatus for Fortnightly Challenges" Tags="|discussion|weekly-challenges|" AnswerCount="0" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4966" PostTypeId="1" AcceptedAnswerId="4967" CreationDate="2015-04-01T00:09:56.600" Score="9" ViewCount="210" Body="&lt;p&gt;As many of you know by now, Stack Exchange added a minigame that looks like an advertisement at first glance to the right hand panel of all Stack Exchange sites. The game is called StackEgg and it's intended to simulate the evolution of a site in the SE network. It will only last through April Fool's Day, 2015 (i.e. 2015-04-01).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The game, though seemingly innocuous, has &lt;a href=&quot;https://meta.stackexchange.com/questions/252393/when-something-that-was-supposed-to-be-fun-became-not-fun&quot;&gt;gotten out of hand&lt;/a&gt;. As a result, quite a bit of hostility has been directed toward PPCG in particular due to perceived cheating. (I know too little to comment in that regard.) Indeed, at least one PPCG user has been suspended from chat over it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We have a tag now, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stack-egg&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stack-egg&amp;#39;&quot; rel=&quot;tag&quot;&gt;stack-egg&lt;/a&gt; and I don't know where it came from. I filled out the description so that people know what it is when they see it, but my hope is that once the game is over, we can retire or remove the tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As of this writing there are only two PPCG posts bearing the tag and both have been put on hold and have a negative net vote count. However, after April Fool's Day, nothing related to StackEgg will be &lt;em&gt;relevant&lt;/em&gt; or even &lt;em&gt;reproducible&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Proposition: We delete the tag after 2015-04-02 or at least add a note to the tag wiki.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Proposed note: &quot;This tag is kept around for historical reasons. Questions of this type are not considered a good fit for this site, so rethink your challenge if you wanted to use this tag.&quot; (Same that was used for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or do we already have a policy that would dictate our actions here?&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2015-04-01T00:21:29.010" Title="The StackEgg tag" Tags="|discussion|status-completed|policy|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4967" PostTypeId="2" ParentId="4966" CreationDate="2015-04-01T00:21:22.030" Score="15" Body="&lt;p&gt;Both questions tagged with the tag are closed, and unlikely to be reopened.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since there is not currently a demand for the tag, I have removed it entirely. The zombie tag cleanup script should burninate it within the next 24 hours.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2015-04-01T00:21:22.030" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4971" PostTypeId="2" ParentId="3578" CreationDate="2015-04-01T18:24:24.933" Score="-4" Body="&lt;p&gt;I am a Java developer, and it hard to convert java to golf code, there for I would like to make a tool that will do this for me. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or better make it a challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The only thing I am not sure about is what would be the wining credential? Because this task is not easy at all.&lt;/p&gt;&#xA;" OwnerUserId="10588" LastActivityDate="2015-04-01T18:24:24.933" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4972" PostTypeId="2" ParentId="2140" CreationDate="2015-04-01T20:26:09.057" Score="-2" Body="&lt;h2&gt;Progress 100%&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I am building a download manager and I need to show a progress of all my files been downloaded.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For that I created an event mechanism that reports on the progress of each individual file. It sends me the information on how many bytes &lt;code&gt;B&lt;/code&gt; have been downloaded of file &lt;code&gt;T&lt;/code&gt; total.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please help me show the average progress of all the files.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Integer C between 1 to 100, followed by new line, followed by C progresses separated by new line. Each progress is constructed of two numbers with the maximum size of 64 bits: &lt;code&gt;B&lt;/code&gt; &lt;code&gt;T&lt;/code&gt;, separated by space.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input options&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input is a String available from the following options&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;file&lt;/li&gt;&#xA;&lt;li&gt;stdin&lt;/li&gt;&#xA;&lt;li&gt;method parameter&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Floating number between 0 to 1, the average of all the progresses. It must be displayed to 11 decimal places, floored.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Criterial&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Shortest code wins&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input file:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3&#xA;5 10&#xA;1024 1024&#xA;20 100&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0.56666666666&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Explanation&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;((5/10) + (1024/1024) + (20/100)) / 3 = 17/30&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Example2&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input file:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;2 10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0.2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Example3&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2  &#xA;Long.MAX_VALUE Long.MAX_VALUE  &#xA;5 10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Explanation&lt;/strong&gt;&#xA;In this example Long.MAX_VALUE represent the maximum 64 bit value, so if you use 64 bit value for storing the sum of the averages it will not work in this case.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0.66666666666&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="10588" LastEditorUserId="39022" LastEditDate="2016-01-23T17:06:35.340" LastActivityDate="2016-01-23T17:06:35.340" CommentCount="18" ContentLicense="CC BY-SA 3.0" />
  <row Id="4973" PostTypeId="2" ParentId="2140" CreationDate="2015-04-01T23:46:15.837" Score="0" Body="&lt;h1&gt;Cooperative Tamagotchi&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a new twist to the Tamagotchi-style ideas floating around.  I also plan on creating a &quot;no rules&quot; version, but the cooperative version is the more  complete idea at the moment.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Tamagotchi, more popularly known as StackEgg, is a game in which you nurture the growth of an adorable pet, also more popularly known as PPCG.  The pet has a set of statistics which reflect the health and well-being of the pet.  You also have a series of buttons.  When you press a button, the pet's stats are affected.  One stat receives a boost, but the other stats that did not receive a boost slowly wither away.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the game, your goal is to work together to win a game of Tamagotchi. Each contestant program casts votes to determine which move will be played in a given game cycle. This is a competition, however, because your personal contributions are being measured. If you vote for a move, and that move wins the election, then the effect of the move will affect your score.  If the action was beneficial to your pet, you gain points.  If the action was detrimental to your pet, you will lose points.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I don't have a &quot;theme&quot; for the Tamagotchi yet.  Here are some ideas for how it would work.  I could alternatively wait for the source for StackEgg to be released or reverse-engineered and use those more realistic rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There would probably be a single game phase, probably based on the &quot;full site&quot; phase of StackEgg in terms of functionality.  This means that there are five stacks and five &quot;constructive&quot; buttons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each stat has two numbers: the number of hearts, which is visible, and a decay counter, which is hidden.  When calculating a player's positive or negative contribution, only the number of hearts is used (?).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More details coming sometime not now.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2015-04-02T00:02:07.387" LastActivityDate="2015-04-02T00:02:07.387" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="4979" PostTypeId="2" ParentId="1213" CreationDate="2015-04-02T05:04:20.047" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;http://julialang.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;Julia&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Download binaries or source: &lt;a href=&quot;http://julialang.org/downloads&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://julialang.org/downloads&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Binaries are available for Windows, Mac, Ubuntu (.deb), Fedora/RHEL/CentOS/SL (.rpm), and generic Linux. Both 32- and 64-bit versions are available for all of these except for Mac, which only has a 64-bit version.&lt;/p&gt;&#xA;&lt;p&gt;You can also get Julia packaged with an IDE called Juno on Windows, Mac, and Linux.&lt;/p&gt;&#xA;&lt;p&gt;Source is available as a tarball or through GitHub.&lt;/p&gt;&#xA;&lt;p&gt;Alternatively, you can use Julia in your browser through &lt;a href=&quot;http://www.juliabox.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.juliabox.org&lt;/a&gt;. There you'll find an IPython notebook-style interface as well as a console interface. Note that using JuliaBox requires a Google account for signing in.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-04-02T05:04:20.047" CommentCount="0" CommunityOwnedDate="2016-08-21T03:11:45.147" ContentLicense="CC BY-SA 3.0" />
  <row Id="4980" PostTypeId="2" ParentId="1213" CreationDate="2015-04-02T05:18:12.650" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;http://www.r-project.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;R&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Downloads are available through a CRAN (Comprehensive R Archive Network) mirror of your choice: &lt;a href=&quot;http://cran.r-project.org/mirrors.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://cran.r-project.org/mirrors.html&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Both binaries and source are available for Linux, Windows, and Mac.&lt;/p&gt;&#xA;&lt;p&gt;When running R locally, you can run it interactively from the command line or R GUI, or by submitting a program file from the command line using &lt;code&gt;RScript somefile.R&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.rstudio.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;RStudio&lt;/a&gt; is a free R IDE available for Linux, Windows, and Mac.&lt;/p&gt;&#xA;&lt;p&gt;Alternatively, you can use R in a number of different browser environments. (Note though that these may not be running a recent version of R.) A small subset:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.r-fiddle.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;R-Fiddle&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://ideone.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;ideone.com&lt;/a&gt; -- uses a &lt;em&gt;very&lt;/em&gt; old version&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.tutorialspoint.com/execute_r_online.php&quot; rel=&quot;nofollow noreferrer&quot;&gt;Coding Ground&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-04-02T05:18:12.650" CommentCount="0" CommunityOwnedDate="2016-08-21T03:11:45.147" ContentLicense="CC BY-SA 3.0" />
  <row Id="4981" PostTypeId="1" CreationDate="2015-04-02T16:24:11.383" Score="5" ViewCount="138" Body="&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, are solutions allowed that have an incredibly long, but provably finite computation time?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course assuming the question does not specifically rule those out.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastEditorUserId="4162" LastEditDate="2015-04-02T16:58:47.737" LastActivityDate="2015-04-02T16:58:47.737" Title="Solutions with incredibly long computing times" Tags="|discussion|" AnswerCount="1" CommentCount="5" ClosedDate="2015-04-02T17:30:44.490" ContentLicense="CC BY-SA 3.0" />
  <row Id="4983" PostTypeId="2" ParentId="4981" CreationDate="2015-04-02T16:55:04.367" Score="7" Body="&lt;h1&gt;Yes, by default&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; submissions should be allowed to take as much (finite) time as necessary by default. The OP may override this if they wish, e.g. by specifying a time limit or requiring that submissions have to terminate at least once for given test cases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because proving program correctness is tricky business, the poster is recommended to explain their code and provide some smaller test cases for which the program &lt;em&gt;is&lt;/em&gt; testable.&lt;/p&gt;&#xA;" OwnerUserId="21487" LastActivityDate="2015-04-02T16:55:04.367" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="4984" PostTypeId="2" ParentId="202" CreationDate="2015-04-02T17:15:31.133" Score="2" Body="&lt;h1&gt;R&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.r-fiddle.org&quot; rel=&quot;nofollow&quot;&gt;R-Fiddle&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://ideone.com&quot; rel=&quot;nofollow&quot;&gt;ideone.com&lt;/a&gt; -- uses a &lt;em&gt;very&lt;/em&gt; old version&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.tutorialspoint.com/execute_r_online.php&quot; rel=&quot;nofollow&quot;&gt;Coding Ground&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Julia&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.juliabox.org&quot; rel=&quot;nofollow&quot;&gt;JuliaBox&lt;/a&gt; -- requires a Google account&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.tutorialspoint.com/execute_julia_online.php&quot; rel=&quot;nofollow&quot;&gt;Coding Ground&lt;/a&gt; -- uses an old version&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;It's good to note that, at least for me, Coding Ground rarely works.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="20469" LastEditDate="2015-12-26T23:09:11.687" LastActivityDate="2015-12-26T23:09:11.687" CommentCount="0" CommunityOwnedDate="2015-04-02T17:15:31.133" ContentLicense="CC BY-SA 3.0" />
  <row Id="4986" PostTypeId="1" AcceptedAnswerId="4987" CreationDate="2015-04-02T21:07:15.883" Score="6" ViewCount="151" Body="&lt;p&gt;Can I improve upon code from another answer in a game of code golf, do I have to ask, or is it not allowed?&lt;/p&gt;&#xA;" OwnerUserId="38891" LastEditorUserId="38891" LastEditDate="2015-04-02T21:09:46.390" LastActivityDate="2015-04-02T21:16:19.100" Title="Can I use another person's code in code golf?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4987" PostTypeId="2" ParentId="4986" CreationDate="2015-04-02T21:16:19.100" Score="14" Body="&lt;p&gt;I think this really depends on the situation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you're just saving a few more bytes without any significant changes to the approach, consider being nice and leave a comment such that the original author can improve the code themselves.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you can actually save something by changing part of the algorithm substantially, I think it's usually alright to post it as a new answer. However, if you reuse any parts of another answer (and if it's just the input parsing), it's common courtesy to credit the other answer as the source for it. Reusing parts of others' answers has been done in the past, and if it's done with attribution I think it's fine. Of course, you can still consider &quot;donating&quot; your idea to the original author (who will sometimes tell you to post it separately anyway if it's sufficiently different).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It also makes a bit of a difference if you're beating the leading answer by shortening it a bit further, or if neither your nor the original is anywhere near the top spot. In the latter case, it's much less of a big deal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In short: yes, in general you may reuse or improve on others' answers, but first consider being a good sportsman, use common sense, and &lt;em&gt;always&lt;/em&gt; give credit where credit is due.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-04-02T21:16:19.100" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="4988" PostTypeId="2" ParentId="2140" CreationDate="2015-04-03T04:30:27.180" Score="0" Body="&lt;h1&gt;Quine Creator&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program &lt;code&gt;F&lt;/code&gt; is in language &lt;code&gt;A&lt;/code&gt;. &lt;code&gt;F&lt;/code&gt; takes a program in language &lt;code&gt;B&lt;/code&gt; as input. Lets call this program &lt;code&gt;G&lt;/code&gt;. &lt;code&gt;F&lt;/code&gt; outputs a program in language &lt;code&gt;B&lt;/code&gt;. Lets call this program &lt;code&gt;O&lt;/code&gt;. &lt;code&gt;O&lt;/code&gt; Takes some input and for some values it will be a quine and for others it will run &lt;code&gt;G&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The exact values which &lt;code&gt;O&lt;/code&gt; decides behaviour must be the same for each different input to &lt;code&gt;F&lt;/code&gt; but you can decide what the conditions will be. They must be short (5 or less bytes), reasonable and not turned into code and executed for the sake of a shorter program &lt;code&gt;F&lt;/code&gt;. Acceptable behaviours include (but are not limited to):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Quines for even digit, &lt;code&gt;G&lt;/code&gt; for odd&lt;/li&gt;&#xA;&lt;li&gt;Quines for truthy input, &lt;code&gt;G&lt;/code&gt; for anything else&lt;/li&gt;&#xA;&lt;li&gt;Quines for the input &quot;0&quot;, &lt;code&gt;G&lt;/code&gt; for anything else&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For example your program &lt;code&gt;F&lt;/code&gt; could be written in Java and take a Python program (&lt;code&gt;G&lt;/code&gt;) as input and output a program in Python (&lt;code&gt;O&lt;/code&gt;) that runs &lt;code&gt;G&lt;/code&gt; when given at least 1 arg and prints it's source when not given any args.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sorry if this is a bit confusing&lt;/p&gt;&#xA;" OwnerUserId="19083" LastEditorUserId="19083" LastEditDate="2015-04-03T13:07:23.093" LastActivityDate="2015-04-03T13:07:23.093" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="4990" PostTypeId="1" AcceptedAnswerId="4991" CreationDate="2015-04-03T13:25:55.623" Score="7" ViewCount="142" Body="&lt;p&gt;Sometimes, I play &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;, and I find an answer more than once, for two different languages. (I know &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; dosen't count.) Can I post another answer, assuming that the rules of the contest don't say otherwise?&lt;/p&gt;&#xA;" OwnerUserId="38891" LastActivityDate="2015-04-03T13:44:42.727" Title="Can I answer a challenge twice?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4991" PostTypeId="2" ParentId="4990" CreationDate="2015-04-03T13:43:18.110" Score="19" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You can post as many answers as you want for a question unless forbidden by the question.&lt;/p&gt;&#xA;" OwnerUserId="32700" LastEditorUserId="32700" LastEditDate="2015-04-03T13:44:42.727" LastActivityDate="2015-04-03T13:44:42.727" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="4992" PostTypeId="1" AcceptedAnswerId="4993" CreationDate="2015-04-03T19:35:55.310" Score="3" ViewCount="52" Body="&lt;p&gt;I've seen pages like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44680/showcase-your-language-one-vote-at-a-time-experimental-challenge&quot;&gt;this&lt;/a&gt; where they have links to answers in the description. I've noticed this works by adding a number to the end of the URL (i.e, 12345). How do I find this number so I can link things? (I know how to do it for my answers, but I'm wondering about answers in general.)&lt;/p&gt;&#xA;" OwnerUserId="38891" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-04-03T20:10:09.407" Title="How do I find the answer number in a post?" Tags="|support|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4993" PostTypeId="2" ParentId="4992" CreationDate="2015-04-03T19:47:16.393" Score="7" Body="&lt;p&gt;If you look at the very bottom of the answer, on the left side, you will see a small &quot;share&quot; button. Clicking this will display a URL that links directly the answer.  This URL will contain the answer's ID number, followed by &lt;em&gt;your&lt;/em&gt; user ID number.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2015-04-03T20:10:09.407" LastActivityDate="2015-04-03T20:10:09.407" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="4994" PostTypeId="2" ParentId="2140" CreationDate="2015-04-03T20:03:21.340" Score="0" Body="&lt;h2&gt;Find sequences in &lt;a href=&quot;http://en.wikipedia.org/wiki/RSA_numbers#RSA-1024&quot; rel=&quot;nofollow&quot;&gt;RSA_1024&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I found an interesting way to factor numbers, while its far from been any efficient in compare to &lt;a href=&quot;http://en.wikipedia.org/wiki/Integer_factorization#Factoring_algorithms&quot; rel=&quot;nofollow&quot;&gt;other&lt;/a&gt; known methods, its lots of fun!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lets assume we want to factor &lt;code&gt;N&lt;/code&gt;. &lt;code&gt;X&lt;/code&gt; will be its factor, if and only if&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;N/X = floor(N/X)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So theoretically, if you could find a different representation of &lt;code&gt;floor(N/X)&lt;/code&gt;, you could easily find &lt;code&gt;X&lt;/code&gt;, so while find such representation is unlikely it is very easy to find it within a small range, for example take a look at &lt;code&gt;floor(N/X)&lt;/code&gt; of &lt;code&gt;N = 691 ∗ 983 = 679253&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At left is &lt;code&gt;X&lt;/code&gt; at right is &lt;code&gt;floor(N/X) - floor(N/(X+1))&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;512 2 &#xA;513 3 &#xA;514 3 &#xA;515 2 &#xA;516 3 &#xA;517 2 &#xA;518 3 &#xA;519 2 &#xA;520 3 &#xA;521 2 &#xA;522 3 &#xA;523 2 &#xA;524 3 &#xA;525 2 &#xA;526 3 &#xA;527 2 &#xA;528 2 &#xA;529 3 &#xA;530 2 &#xA;531 3 &#xA;532 2 &#xA;533 2 &#xA;534 3 &#xA;535 2 &#xA;536 3 &#xA;537 2 &#xA;538 2 &#xA;539 3 &#xA;540 2 &#xA;541 2 &#xA;542 3 &#xA;543 2 &#xA;544 2 &#xA;545 2 &#xA;546 3 &#xA;547 2 &#xA;548 2 &#xA;549 2 &#xA;550 3 &#xA;551 2 &#xA;552 2 &#xA;553 2 &#xA;554 3 &#xA;555 2 &#xA;556 2 &#xA;557 2 &#xA;558 2 &#xA;559 3 &#xA;560 2 &#xA;561 2 &#xA;562 2 &#xA;563 2 &#xA;564 2 &#xA;565 2 &#xA;566 3 &#xA;567 2 &#xA;568 2 &#xA;569 2 &#xA;570 2 &#xA;571 2 &#xA;572 2 &#xA;573 2 &#xA;574 2 &#xA;575 2 &#xA;576 2 &#xA;577 2 &#xA;578 2 &#xA;579 2 &#xA;580 2 &#xA;581 2 &#xA;582 2 &#xA;583 2 &#xA;584 2 &#xA;585 2 &#xA;586 2 &#xA;587 2 &#xA;588 2 &#xA;589 2 &#xA;590 2 &#xA;591 2 &#xA;592 2 &#xA;593 2 &#xA;594 2 &#xA;595 2 &#xA;596 2 &#xA;597 2 &#xA;598 2 &#xA;599 1 &#xA;600 2 &#xA;601 2 &#xA;602 2 &#xA;603 2 &#xA;604 2 &#xA;605 2 &#xA;606 1 &#xA;607 2 &#xA;608 2 &#xA;609 2 &#xA;610 2 &#xA;611 2 &#xA;612 1 &#xA;613 2 &#xA;614 2 &#xA;615 2 &#xA;616 2 &#xA;617 1 &#xA;618 2 &#xA;619 2 &#xA;620 2 &#xA;621 1 &#xA;622 2 &#xA;623 2 &#xA;624 2 &#xA;625 1 &#xA;626 2 &#xA;627 2 &#xA;628 2 &#xA;629 1 &#xA;630 2 &#xA;631 2 &#xA;632 1 &#xA;633 2 &#xA;634 2 &#xA;635 1 &#xA;636 2 &#xA;637 2 &#xA;638 2 &#xA;639 1 &#xA;640 2 &#xA;641 1 &#xA;642 2 &#xA;643 2 &#xA;644 1 &#xA;645 2 &#xA;646 2 &#xA;647 1 &#xA;648 2 &#xA;649 1 &#xA;650 2 &#xA;651 2 &#xA;652 1 &#xA;653 2 &#xA;654 1 &#xA;655 2 &#xA;656 2 &#xA;657 1 &#xA;658 2 &#xA;659 1 &#xA;660 2 &#xA;661 1 &#xA;662 2 &#xA;663 2 &#xA;664 1 &#xA;665 2 &#xA;666 1 &#xA;667 2 &#xA;668 1 &#xA;669 2 &#xA;670 1 &#xA;671 2 &#xA;672 1 &#xA;673 2 &#xA;674 1 &#xA;675 2 &#xA;676 1 &#xA;677 2 &#xA;678 1 &#xA;679 2 &#xA;680 1 &#xA;681 2 &#xA;682 1 &#xA;683 1 &#xA;684 2 &#xA;685 1 &#xA;686 2 &#xA;687 1 &#xA;688 2 &#xA;689 1 &#xA;690 1 &#xA;691 2 &#xA;692 1 &#xA;693 2 &#xA;694 1 &#xA;695 2 &#xA;696 1 &#xA;697 1 &#xA;698 2 &#xA;699 1 &#xA;700 2 &#xA;701 1 &#xA;702 1 &#xA;703 2 &#xA;704 1 &#xA;705 1 &#xA;706 2 &#xA;707 1 &#xA;708 1 &#xA;709 2 &#xA;710 1 &#xA;711 1 &#xA;712 2 &#xA;713 1 &#xA;714 1 &#xA;715 2 &#xA;716 1 &#xA;717 1 &#xA;718 2 &#xA;719 1 &#xA;720 1 &#xA;721 2 &#xA;722 1 &#xA;723 1 &#xA;724 2 &#xA;725 1 &#xA;726 1 &#xA;727 1 &#xA;728 2 &#xA;729 1 &#xA;730 1 &#xA;731 2 &#xA;732 1 &#xA;733 1 &#xA;734 1 &#xA;735 2 &#xA;736 1 &#xA;737 1 &#xA;738 1 &#xA;739 2 &#xA;740 1 &#xA;741 1 &#xA;742 1 &#xA;743 2 &#xA;744 1 &#xA;745 1 &#xA;746 1 &#xA;747 1 &#xA;748 2 &#xA;749 1 &#xA;750 1 &#xA;751 1 &#xA;752 1 &#xA;753 2 &#xA;754 1 &#xA;755 1 &#xA;756 1 &#xA;757 1 &#xA;758 2 &#xA;759 1 &#xA;760 1 &#xA;761 1 &#xA;762 1 &#xA;763 1 &#xA;764 2 &#xA;765 1 &#xA;766 1 &#xA;767 1 &#xA;768 1 &#xA;769 1 &#xA;770 1 &#xA;771 2 &#xA;772 1 &#xA;773 1 &#xA;774 1 &#xA;775 1 &#xA;776 1 &#xA;777 1 &#xA;778 2 &#xA;779 1 &#xA;780 1 &#xA;781 1 &#xA;782 1 &#xA;783 1 &#xA;784 1 &#xA;785 1 &#xA;786 1 &#xA;787 2 &#xA;788 1 &#xA;789 1 &#xA;790 1 &#xA;791 1 &#xA;792 1 &#xA;793 1 &#xA;794 1 &#xA;795 1 &#xA;796 1 &#xA;797 1 &#xA;798 1 &#xA;799 1 &#xA;800 1 &#xA;801 2 &#xA;802 1 &#xA;803 1 &#xA;804 1 &#xA;805 1    &#xA;806 1 &#xA;807 1 &#xA;808 1 &#xA;809 1 &#xA;810 1 &#xA;811 1 &#xA;812 1 &#xA;813 1 &#xA;814 1 &#xA;815 1 &#xA;816 1 &#xA;817 1 &#xA;818 1 &#xA;819 1 &#xA;820 1 &#xA;821 1 &#xA;822 1 &#xA;823 1 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Its easy to tell that in the range of 566,599 &lt;code&gt;floor(N/X)&lt;/code&gt; act like a strait line &lt;code&gt;y = 2x + 566&lt;/code&gt;. Also it's easy to verify as we can calculate the difference between &lt;code&gt;floor(N/566)&lt;/code&gt; and &lt;code&gt;floor(N/599)&lt;/code&gt; and see if its equal to &lt;code&gt;2 * 599 - 566&lt;/code&gt;, and indeed it is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So now lets play&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your input is the number &lt;a href=&quot;http://en.wikipedia.org/wiki/RSA_numbers#RSA-1024&quot; rel=&quot;nofollow&quot;&gt;RSA_1024&lt;/a&gt;, while we will only use this input, your app should be able to work with any other inputs as well.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;10,000 sequences that you found starting from Sqr(&lt;a href=&quot;http://en.wikipedia.org/wiki/RSA_numbers#RSA-1024&quot; rel=&quot;nofollow&quot;&gt;RSA_1024&lt;/a&gt;) and going up. Each sequences will be outputted in a new line. For each sequences you should output the next&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;starting range value&lt;/li&gt;&#xA;&lt;li&gt;end range value&lt;/li&gt;&#xA;&lt;li&gt;type&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Type is just a string defined by you that tells us what kind of sequence is it, strait-line or some thing else.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After you output the sequences, output one line with the total range you been able to cover with all the sequences.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Criteria&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Who covers the biggest Range wins. &lt;/p&gt;&#xA;" OwnerUserId="10588" LastEditorUserId="10588" LastEditDate="2015-04-03T20:49:38.387" LastActivityDate="2015-04-03T20:49:38.387" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4995" PostTypeId="1" AcceptedAnswerId="4998" CreationDate="2015-04-03T20:10:02.337" Score="1" ViewCount="45" Body="&lt;p&gt;I was on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44680/showcase-your-language-one-vote-at-a-time-experimental-challenge&quot;&gt;this&lt;/a&gt; page, and I noticed some entries for the list in the description were missing. Is it OK for me to link these entries, or do I have to ask permission from the posters?&lt;/p&gt;&#xA;" OwnerUserId="38891" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-04-03T20:35:19.153" Title="Is it OK to link other people's answers?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="4998" PostTypeId="2" ParentId="4995" CreationDate="2015-04-03T20:35:19.153" Score="1" Body="&lt;p&gt;Go ahead and add them. I don't see why they object, seeing they've submitted their answers publicly (under the CC BY-SA licence) and anyone anywhere on the internet could link to them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, you don't have enough rep for single-handed edits yet, so if you suggest the edit it goes through the review queue anyway. In theory, you don't need to ask for permission on meta. If you've made a &quot;wrong&quot; edit, someone will reject it and (hopefully) give you a reason for the rejection.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You might also want to &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;join us in chat&lt;/a&gt; for simple questions like this. (Nothing wrong with asking on meta, but chat might be quicker, and if people think it's worth getting a more official consensus you can still post it on meta.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-04-03T20:35:19.153" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5000" PostTypeId="2" ParentId="4944" CreationDate="2015-04-03T21:06:24.723" Score="3" Body="&lt;h3&gt;Feature Request: Correctly count characters from supplementary planes&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;This is minor, but could still be looked at if it's easy to change.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;When using some characters, such as emojis, &lt;a href=&quot;http://en.wikipedia.com/wiki/UTF-16&quot; rel=&quot;nofollow noreferrer&quot;&gt;UTF-16 or UCS-2&lt;/a&gt; (which JavaScript uses) uses uses two &amp;quot;characters&amp;quot; for them.&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/JMoS2.png&quot; alt=&quot;emoji taking 2 chars in a JS string&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;However, they are defined to be single characters in Unicode. It would be nice to correctly count them, as they may be significant in challenges counting by characters.&lt;/p&gt;&#xA;" OwnerUserId="30164" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-04-03T22:22:15.513" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5001" PostTypeId="2" ParentId="2140" CreationDate="2015-04-04T00:54:52.550" Score="1" Body="&lt;p&gt;Here's a puzzle to be split into two questions:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Build an evil-defying Tetris AI&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Build a program that takes the state of a current board and a piece and attempts to find the optimal space for it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program will be scored by the number of points it can score against the evil Tetris block generators in the question below. Highest score wins. (scoring algorithm to come later)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Build an evil Tetris block generator&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Build a program that attempts to take the state of a current board and generate the worst possible piece for it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program will be scored by the total number of points the AIs built in the question above can score against it. Lowest score wins.&lt;/p&gt;&#xA;" OwnerUserId="7110" LastActivityDate="2015-04-04T00:54:52.550" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5002" PostTypeId="2" ParentId="2140" CreationDate="2015-04-04T09:26:59.467" Score="2" Body="&lt;h1&gt;Rendezvous palace &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This comes from &lt;a href=&quot;https://math.stackexchange.com/q/1214022/35416&quot;&gt;a well-liked question on the Math SE&lt;/a&gt; by &lt;a href=&quot;https://math.stackexchange.com/users/53495/robau&quot;&gt;RobAu&lt;/a&gt; and &lt;a href=&quot;https://math.stackexchange.com/q/1218899/35416&quot;&gt;a more specific follow-up to that&lt;/a&gt; by &lt;a href=&quot;https://math.stackexchange.com/users/221242/danikov&quot;&gt;Danikov&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is a palace which is a grid of &lt;em&gt;n&lt;/em&gt; × &lt;em&gt;n&lt;/em&gt; rooms, which we will index using two coordinates 0 ≤ &lt;em&gt;x,y&lt;/em&gt; &amp;lt; &lt;em&gt;n&lt;/em&gt;. The rooms are organized in a torus topology, i.e. with wrap-around at the edges. So the room to the right of (n-1,3) is (0,3) again, and likewise for the &lt;em&gt;y&lt;/em&gt; direction.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Two robots are placed into this grid, and their objective is to rendezvous. But the problem is that these only can can keep track of &lt;em&gt;relative&lt;/em&gt; changes in position and orientation. So each robot has its own local coordinate system, where its initial position is called (0,0), but these two coordinate systems relate to one another in any of 4&lt;em&gt;n&lt;/em&gt;&lt;sup&gt;2&lt;/sup&gt; possible ways, accounting for 4 possible relative rotations and &lt;em&gt;n&lt;/em&gt; × &lt;em&gt;n&lt;/em&gt; relative shifts. Each of these relations has equal probability.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The palace has no doors. The robots can move around the palace by teleportation. They move in a synchronized way, teleporting at exactly the same instant. To meet they either have to be in the same room at the same time, or to swap places during teleportation.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a program for these robots, trying to minimize the expected time till rendezvous. The same program will be executed for both robots, and the robots have no way to distinguish which one is which. So we'll be executing two copies of your code in parallel.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The only input is &lt;em&gt;n&lt;/em&gt;, the size of the palace. In addition to that, the code has access to a random number generator, and the random numbers from one instance are assumed to be independent from those in the other instance. No other input or communication between the instances is allowed.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The output of your code should be an infinite sequence of coordinate pairs, (&lt;em&gt;x&lt;/em&gt;,&lt;em&gt;y&lt;/em&gt;), indicating the target room for the next teleportation. The coordinates are relative to where the robot started, not relative to where he currently is located. Giving the same output repeatedly means you are staying put in a given room.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Framework&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You are asked to evaluate your code yourself. Write or copy a framework which will randomly choose relative starting positions, execute two instances of your code in parallel, detect a successful rendezvous and report the time to rendezvous. Run that code a number of times, and compute the average and standard deviation of the time to rendezvous. See the section below for ready-to-copy code.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Submission&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your answer must include the code which constitutes the program for one robot. It must also include the average time to rendezvous and its standard deviation for the following setups:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;at least 1,000,000 runs for &lt;em&gt;n&lt;/em&gt; = 2&lt;/li&gt;&#xA;&lt;li&gt;at least 100,000 runs for &lt;em&gt;n&lt;/em&gt; = 64&lt;/li&gt;&#xA;&lt;li&gt;at least 10,000 runs for &lt;em&gt;n&lt;/em&gt; = 256&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;You don't have to paste your framework by default, but be willing to provide it upon request. An explanation of what your code is doing and why you wrote it that way might bring upvotes.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The title of best answer will go to the code with the minimal expected time to rendezvous for &lt;em&gt;n&lt;/em&gt; = 64. I'll re-evaluate the top contenders myself, to make sure you included genuine results. The closer two competitors are, the more often I'll run their code to establish a reliable expected value from the average. This is an open-ended contest, so the title may be re-awarded when a better answer comes along.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example frameworks&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;C++&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You can use the following fixture if you like.&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-cpp prettyprint-override&quot;&gt;&lt;code&gt;#include &amp;lt;random&amp;gt;&#xA;#include &amp;lt;iostream&amp;gt;&#xA;#include &amp;lt;iomanip&amp;gt;&#xA;#include &amp;lt;cmath&amp;gt;&#xA;&#xA;constexpr int n = 64;&#xA;const int orientations[4][4] = {&#xA;  {1, 0, 0, 1},&#xA;  {0, 1, n - 1, 0},&#xA;  {n - 1, 0, 0, n - 1},&#xA;  {0, n - 1, 1, 0}&#xA;};&#xA;&#xA;std::default_random_engine randEngine((std::random_device())());&#xA;std::uniform_int_distribution&amp;lt;int&amp;gt; randDist{0, n - 1};&#xA;std::uniform_int_distribution&amp;lt;int&amp;gt; randDist4{0, 3};&#xA;int rand() { return randDist(randEngine); }&#xA;&#xA;typedef std::pair&amp;lt;int, int&amp;gt; pos_t;&#xA;&#xA;class Robot {&#xA;public:&#xA;  pos_t next() { return {rand(), rand()}; }&#xA;};&#xA;&#xA;class Transform {&#xA;  int dx, dy, ori;&#xA;public:&#xA;  Transform() : dx{rand()}, dy{rand()}, ori{randDist4(randEngine)} { }&#xA;  pos_t operator()(const pos_t&amp;amp; in) const {&#xA;    int x = in.first, y = in.second;&#xA;    const int *o = orientations[ori];&#xA;    return { (o[0] * x + o[1] * y + dx) % n, (o[2] * x + o[3] * y + dy) % n };&#xA;  }&#xA;};&#xA;&#xA;unsigned long run() {&#xA;  Transform tr;&#xA;  pos_t p1{0, 0}, p2{0, 0};&#xA;  p2 = tr(p2);&#xA;  Robot r1, r2;&#xA;  unsigned long t = 0;&#xA;  while (p1 != p2) {&#xA;    ++t;&#xA;    pos_t q1 = r1.next();&#xA;    pos_t q2 = tr(r2.next());&#xA;    if (p1 == q2 &amp;amp;&amp;amp; p2 == q1) break;&#xA;    p1 = q1;&#xA;    p2 = q2;&#xA;  }&#xA;  // std::cout &amp;lt;&amp;lt; std::setw(8) &amp;lt;&amp;lt; t &amp;lt;&amp;lt; &quot;\n&quot;;&#xA;  return t;&#xA;}&#xA;&#xA;int main(int argc, char** argv) {&#xA;  double sum = 0, sumSq = 0;&#xA;  int report = 10;&#xA;  for (int i = 1; ; ++i) {&#xA;    double r = run();&#xA;    sum += r;&#xA;    sumSq += r*r;&#xA;    if (i == report) {&#xA;      double avg = sum / i;&#xA;      double var = (sumSq - sum*avg) / (i - 1);&#xA;      double sd = std::sqrt(var);&#xA;      std::cout &amp;lt;&amp;lt; std::setw(8) &amp;lt;&amp;lt; i &amp;lt;&amp;lt; &quot; runs: Expected: &quot;&#xA;                &amp;lt;&amp;lt; std::fixed &amp;lt;&amp;lt; std::setprecision(2) &amp;lt;&amp;lt; avg&#xA;                &amp;lt;&amp;lt; &quot;, SD: &quot;&#xA;                &amp;lt;&amp;lt; std::fixed &amp;lt;&amp;lt; std::setprecision(2) &amp;lt;&amp;lt; sd&#xA;                &amp;lt;&amp;lt; std::endl;&#xA;      report *= 10;&#xA;    }&#xA;  }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In a submission you'd just paste the &lt;code&gt;next&lt;/code&gt; function. A possible statistical report for the above could read:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;n = 2: Expected 2.40, SD 2.68 in 10,000,000 runs&#xA;n = 64: Expected 4105.08, SD 4104.22 in 10,000,000 runs&#xA;n = 256: Expected 64911.36, SD: 65204.72 in 10,000 runs&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Python, …&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;To be extended for other languages. Feel free to donate your own framework if you feel like it.&lt;/p&gt;&#xA;" OwnerUserId="13683" LastEditorUserId="-1" LastEditDate="2017-04-13T12:19:20.950" LastActivityDate="2015-04-05T06:37:15.823" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5005" PostTypeId="2" ParentId="2140" CreationDate="2015-04-05T01:03:02.180" Score="0" Body="&lt;h1&gt;Realistic Fractal Terrain Generation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Don't you find that typical algorithms to generate random fractal terrains are boring and not too much realistic?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fractal terrain generation is usually implemented with some random noise function applied in a fractal way. This can be seen with the typical Diamond-Square algorithm or the Perlin Noise function:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Diamond-Squares example output:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/7nTG5.png&quot; alt=&quot;Diamond-Squares example output&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Perlin noise example output:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/q4ZSq.png&quot; alt=&quot;Perlin noise example output&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem is that these are used by their simplicity in creating them, but they are actually pretty boring when they are used as height maps:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/aXJ48.png&quot; alt=&quot;Diamond-Squares as heigh-map&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Q8Uc5.png&quot; alt=&quot;Perlin noise as heigh-map&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;... To be continued ...&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="30686" LastEditorUserId="30686" LastEditDate="2015-04-05T09:27:20.997" LastActivityDate="2015-04-05T09:27:20.997" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5012" PostTypeId="1" CreationDate="2015-04-06T12:38:50.647" Score="53" ViewCount="793" Body="&lt;p&gt;You arrived to the site today and noticed that something was different; something was gone and something new was in its place, but somewhat out of place, like on the wrong side of the room. You'd had hangovers like this previously but you couldn't recall chasing any absynthe the night before, all of the elephants seemed to be their usual boring color - something wasn't right.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And then it dawned on you, there's someone &lt;em&gt;new&lt;/em&gt; that seems to be in charge, and someone that used to be in charge isn't in charge anymore. Immediately, you thought of blaming &lt;a href=&quot;https://codegolf.stackexchange.com/users/3/chris-jester-young&quot;&gt;Chris Jester-Young&lt;/a&gt;, but then realized that &lt;em&gt;he, in fact, was the one that went missing&lt;/em&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Chris has, indeed, joined the ranks of our core developers in order to bring the secrets he discovered from his backyard &lt;a href=&quot;http://en.wikipedia.org/wiki/Soylent_Green&quot; rel=&quot;nofollow noreferrer&quot;&gt;Soylent Green&lt;/a&gt; distillery into the software we all know and (usually) love. Taking his place, by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4929/replacement-moderator-proposal&quot;&gt;popular demand&lt;/a&gt; is Martin Büttner:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/8478/martin-b%c3%bcttner&quot;&gt;&#xA;&lt;img src=&quot;https://codegolf.meta.stackexchange.com/users/flair/8478.png&quot; width=&quot;208&quot; height=&quot;58&quot; alt=&quot;profile for Martin B&amp;#252;ttner at Programming Puzzles &amp;amp; Code Golf Meta Stack Exchange, Q&amp;amp;A about the site for programming puzzle enthusiasts and code golfers&quot; title=&quot;profile for Martin B&amp;#252;ttner at Programming Puzzles &amp;amp; Code Golf Meta Stack Exchange, Q&amp;amp;A about the site for programming puzzle enthusiasts and code golfers&quot;&gt;&#xA;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Martin joins the ranks of our moderation team starting today, following a &lt;em&gt;very&lt;/em&gt; long and reckless trail of helpfulness, beguiling competency, a frightening lack of cynicism and a demonstrated desire to lead. We should totally give that user a diamond and see what they do with it. So we did. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please join me in giving Martin a warm welcome, we're &lt;em&gt;very&lt;/em&gt; excited to be working with him,  to the extent that we even hired Chris to make it possible. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Welcome, Martin!&lt;/p&gt;&#xA;" OwnerUserId="7170" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2015-04-06T12:53:26.830" Title="The Curious Case Of The Missing Chris Jester-Young, Welcome Martin Büttner!" Tags="|discussion|moderators|" AnswerCount="0" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="5013" PostTypeId="2" ParentId="673" CreationDate="2015-04-06T13:00:56.327" Score="27" Body="&lt;p&gt;I have two very different scoring methods that i'm going to post as separate answers. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/673/golfing-from-scratch/5014#5014&quot;&gt;Here's the other one.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;We could use &lt;a href=&quot;https://en.scratch-wiki.info/wiki/Block_Plugin&quot; rel=&quot;nofollow noreferrer&quot;&gt;ScratchBlocks2&lt;/a&gt; syntax, which is a way of representing Scratch blocks as they are written. We can then simply count bytes of that output.&lt;/p&gt;&#xA;&lt;p&gt;For the example code in the question, that &lt;a href=&quot;http://scratchblocks.github.io/#when%20gf%20clicked%0Aask%5Bn%3D%5Dand%20wait%0Aset%5Bn%20v%5Dto(answer)%0Aset%5Bi%20v%5Dto%5B0%5D%0Arepeat%20until%3C(n)%3D%5B1%5D%3E%0Aif%3C((n)mod(2))%3D%5B0%5D%3Ethen%0Aset%5Bn%20v%5Dto((n)%2F(2))%0Aelse%0Aset%5Bn%20v%5Dto(((3)*(n))%2B(1))%0Aend%0Achange%5Bi%20v%5Dby(1)%0Aend%0Asay(i)&quot; rel=&quot;nofollow noreferrer&quot;&gt;becomes&lt;/a&gt; 193 bytes:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;when gf clicked&#xA;ask[n=]and wait&#xA;set[n v]to(answer)&#xA;set[i v]to[0]&#xA;repeat until&amp;lt;(n)=[1]&amp;gt;&#xA;if&amp;lt;((n)mod(2))=[0]&amp;gt;then&#xA;set[n v]to((n)/(2))&#xA;else&#xA;set[n v]to(((3)*(n))+(1))&#xA;end&#xA;change[i v]by(1)&#xA;end&#xA;say(i)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You can also leave off closing brackets and parentheses at the end of a line, which &lt;a href=&quot;https://tinyurl.com/4bnyms62&quot; rel=&quot;nofollow noreferrer&quot;&gt;brings it down to&lt;/a&gt; 183 bytes.&lt;/p&gt;&#xA;&lt;p&gt;Yes, this is a high byte count. I think that can simply be a hazard of using Scratch as your language.&lt;/p&gt;&#xA;&lt;p&gt;This also happens to be a very convenient way of posting Scratch code without images. ScratchBlocks2 even comes with a generator to create text code from a project.&lt;/p&gt;&#xA;" OwnerUserId="32376" LastEditorUserId="46076" LastEditDate="2023-05-07T15:02:23.670" LastActivityDate="2023-05-07T15:02:23.670" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="5014" PostTypeId="2" ParentId="673" CreationDate="2015-04-06T13:01:14.887" Score="2" Body="&lt;p&gt;I have two very different scoring methods that i'm going to post as separate answers. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/673/golfing-from-scratch/5013#5013&quot;&gt;Here's the other one.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I think that your scoring method is very short. Too short to be fair, perhaps.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A fairer scoring method based on this would be to count each block token (word or insert) as 1, plus constants. Also, lists and variables should count as overhead  in addition to being used in a script. I'm thinking 1 byte per variable/list, plus the byte count of the name, plus treating values as constants. And using a variable in a script should be 1 token + the name of the var. Also, in your counting, you completely ignored dropdown menus. Those are also constants.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since my explanation probably wasn't too clear, i'll just give the accounting for your example script:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/2jTh6.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;when flag clicked&lt;/code&gt; - 3&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ask &amp;lt;n=&amp;gt; and wait&lt;/code&gt; - 6 (4-token block (3 words + 1 input) + 2-char constant)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;set &amp;lt;n&amp;gt; to &amp;lt;answer&amp;gt;&lt;/code&gt; - 6 (4-token block + constant n + variable answer).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;set &amp;lt;i&amp;gt; to &amp;lt;0&amp;gt;&lt;/code&gt; - 6 (same as above).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;repeat until &amp;lt;&amp;lt;n&amp;gt;=&amp;lt;1&amp;gt;&amp;gt;&lt;/code&gt; - 9 (3-token block &quot;repeat&quot;, 3-token block &quot;=&quot;, 1-character variable + variable call, constant).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;if &amp;lt;&amp;lt;&amp;lt;n&amp;gt; mod &amp;lt;2&amp;gt;&amp;gt; = &amp;lt;0&amp;gt;&amp;gt; then&lt;/code&gt; - 13 (3 3-token blocks: if, =, and mod; 1-character variable + var call, 2 constants). Perhaps we can count the &lt;code&gt;if&lt;/code&gt; as only two, since in the past it didn't have the &lt;code&gt;then&lt;/code&gt; token.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;set &amp;lt;n&amp;gt; to &amp;lt;&amp;lt;n&amp;gt;/&amp;lt;2&amp;gt;&amp;gt;&lt;/code&gt; - 11 (4-token block, 3 token division block, variable (2), 2 constants).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;else&lt;/code&gt; - 1 (1 token).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;set &amp;lt;n&amp;gt; to &amp;lt;&amp;lt;&amp;lt;3&amp;gt;*&amp;lt;n&amp;gt;&amp;gt;+&amp;lt;1&amp;gt;&amp;gt;&lt;/code&gt; - 12 (4-token block, 3-token blocks * and +, variable (2), 3 constants).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{end}&lt;/code&gt; - 1. We need a way to mark ending a C block.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;change &amp;lt;i&amp;gt; by &amp;lt;1&amp;gt;&lt;/code&gt; - 6 (see beginning).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;end&lt;/code&gt; - 1 (again).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;say &amp;lt;i&amp;gt;&lt;/code&gt; - 4 (2-token block, variable (2)).&lt;/li&gt;&#xA;&lt;li&gt;Overhead: 4 - 2 variables, each with 1-character names.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Total: 83.&lt;br&gt;&#xA;Yes, this is over twice your count. Scratch is verbose. :)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also want to give my take on procedures. I'll use the example script from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1364/32376&quot;&gt;ace's answer&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/avOd1.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The define block should count as 2 tokens, plus the text inside. Inputs count the way they always do. Each time you call the block costs 1 token, plus the name of the block and any inserts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This should total:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;define &amp;lt;buz&amp;gt;&lt;/code&gt; - 5 (2-token &quot;define&quot; block, 3-character name of proc).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;move &amp;lt;10&amp;gt; steps&lt;/code&gt; - 5 (normal score).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;when gf clicked&lt;/code&gt; - 3.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;turn clockwise &amp;lt;15&amp;gt; degrees&lt;/code&gt; - 6.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;buz&lt;/code&gt; - 4 (1-token block call + 3-character proc name).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;turn clockwise &amp;lt;15&amp;gt; degrees&lt;/code&gt; - 6.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Total: 29.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A more advanced example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Dpnlw.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This should be:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;define &amp;lt;jump &amp;lt;amount&amp;gt;&amp;gt;&lt;/code&gt; - 13 (2-token define, 4-character &quot;jump&quot;, 1-token input, 6-character &quot;amount&quot;).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;change y by &amp;lt;amount&amp;gt;&lt;/code&gt; - 11 (4-token block, variable call, 6-character variable name).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;wait &amp;lt;1&amp;gt; secs&amp;gt;&lt;/code&gt; - 4.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;change y by &amp;lt;amount&amp;gt;&lt;/code&gt; - 11 (4-token block, variable call, 6-character variable name).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;jump &amp;lt;10&amp;gt;&lt;/code&gt; - 9 (1-token block call, 2-token block, 4-char &quot;jump&quot;, 2-digit constant).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Total: 48. (Wow! Functions can be expensive! Choose short names. ;))&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We should also count sprites, costumes, and sounds when necessary, but i'm not going to do that right now.&lt;/p&gt;&#xA;" OwnerUserId="32376" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2015-04-06T13:01:14.887" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5017" PostTypeId="2" ParentId="212" CreationDate="2015-04-06T16:09:27.530" Score="2" Body="&lt;p&gt;&lt;strong&gt;Here is what I think:&lt;/strong&gt;&lt;br&gt;&#xA;To answer #1, I think that everyone should describe what they want to do, and then people will edit it to make it shorter and more concise. You should also try to make it less technical, so those who don't fully understand the meaning can help. I've seen problems where it sounds really complex, but when rephrased it was actually much simpler.&lt;br&gt;&lt;br&gt;#2 and #3 are actually very simple to fix - either let the poster know how they could fix their question, or call a close-vote. I would prefer to avoid close-voting, but there are times when it's necessary. But don't jump straight to a vote. See if you can help the poster before that - sometimes it can be a good question if written properly.&lt;br&gt;&lt;br&gt;&#xA;For #4, you should suggest some languages, and see why they would only choose those languages or omit others. Were the languages too simple? What if they only run/understand/need the one or two?&lt;br&gt;&lt;br&gt;&#xA;Most of all, &lt;strong&gt;be nice, they might be new&lt;/strong&gt;. Most of these problems are caused by new people, but they're just trying to figure out how the site works. (I speak from experience on this one, my first question was edited within 5 minutes.) Try explaining how they could fix it, and let them know how things work (and why what they did was wrong).&lt;/p&gt;&#xA;" OwnerUserId="38891" LastActivityDate="2015-04-06T16:09:27.530" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5021" PostTypeId="2" ParentId="2140" CreationDate="2015-04-06T22:06:05.293" Score="2" Body="&lt;h1&gt;A Continuously Running KOTH, or &quot;An MMO with all AIs&quot;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This was an idea discussed in chat, I'm throwing a sandbox post together because I thought it would be really fun to do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main idea is that the KOTH is hosted an an external website, where the competitions is continuously running.  When a person submits an answer, that player's pixels (or whatever they're called) will be spawned in the game world.  Over time, build a larger army of themselves.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Basically, it's an MMO with all AIs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As of right now, I don't have the capability to host a website for this.  I think someone (Optimizer?) said that they had a website.  Regardless, we probably don't have to worry about that until we figure out what the rules are going to be.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Some ideas&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The world is a large array of randomly generated pixels.  Every submission has a unique color. As pixels travel around, they can encounter other pixels of the same color, which then activate and join them.&lt;/li&gt;&#xA;&lt;li&gt;A more Minecraft-y options involve more detailed resource gathering / crafting.  Con: the complexity can get pretty hard for contestants.&lt;/li&gt;&#xA;&lt;li&gt;A space theme can involve a randomly generated galaxy, which players can travel across.  They can then colonize planets and build an empire.  (Maybe resembling EVE Online?)&lt;/li&gt;&#xA;&lt;li&gt;Some recommendations for ideas are Clash of Clans and Globulation 2, although I've never played either.&lt;/li&gt;&#xA;&lt;li&gt;Maybe each player controls an adventure in a super-simplified Dwarf Fortress-style world.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You are free to edit this post to add ideas.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2015-04-06T22:06:05.293" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5022" PostTypeId="1" AcceptedAnswerId="5023" CreationDate="2015-04-07T01:59:38.343" Score="-1" ViewCount="93" Body="&lt;p&gt;Earlier I came across &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35079/the-rock-paper-scissors-lizard-spock-tournament-of-epicness&quot;&gt;The Rock, Paper, Scissors, Lizard, Spock Tournament of Epicness&lt;/a&gt;, and I decided to submit an answer. To my disappointment, the question was apparently last edited 6 months ago. No one appears to be using it, so I was wondering - Is it OK to create a new question with the same premise (and not have it closed as a duplicate), given that it's long since been abandoned? And if not, is there any way I could 'restart' the question, i.e, get attention so my bot can be accepted?&lt;/p&gt;&#xA;" OwnerUserId="38891" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-04-07T03:10:05.757" Title="Is it OK to copy a question if the old one is long dead?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5023" PostTypeId="2" ParentId="5022" CreationDate="2015-04-07T03:10:05.757" Score="10" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;A question that is copied outright from an existing question would almost certainly be closed as a duplicate. Perhaps more importantly, it would be seen as plagiarism.&lt;/p&gt;&#xA;&lt;p&gt;Even with permission from the OP, I don't think revisiting contests that have already happened would be something we as a community are likely to enjoy. Many users will have already seen all the action and answers could be taken right from the old contest.&lt;/p&gt;&#xA;&lt;p&gt;Koth's are unfortunate in that, once the OP names an official winner or stops making updates, the challenge is effectively over (though not abandoned per se, it still gets views).&lt;/p&gt;&#xA;&lt;p&gt;You &lt;em&gt;may&lt;/em&gt; be able to make a new rock-paper-scissors based koth, if it is different enough from the old one. But, I personally think that a koth with an &lt;em&gt;entirely&lt;/em&gt; new premise would be better received by the community.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-04-07T03:10:05.757" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5024" PostTypeId="2" ParentId="2562" CreationDate="2015-04-07T12:03:35.843" Score="20" Body="&lt;p&gt;I've now enabled the MathJax setting here. Enjoy!&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2015-04-07T12:03:35.843" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5026" PostTypeId="1" AcceptedAnswerId="5027" CreationDate="2015-04-07T13:32:42.347" Score="0" ViewCount="69" Body="&lt;p&gt;When on the 'Top Users' tab of the Stack Exchange website, you can see the reputation rankings (that is, 1st place has the most reputation, 2nd place has the 2nd most, etc.) of different users. Recently, I searched for my name, and nothing came up. (Probably because I'm rather new.) However, when I searched under the 'Users' tab on PPCG, I saw my name, but no ranking. So, how do I find my reputation ranking, or does it only count if I am a 'Top User'?&lt;/p&gt;&#xA;" OwnerUserId="38891" LastActivityDate="2015-04-07T13:35:27.003" Title="How do I tell my reputation ranking?" Tags="|support|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5027" PostTypeId="2" ParentId="5026" CreationDate="2015-04-07T13:35:27.003" Score="2" Body="&lt;p&gt;The bottom of the users page has a link to the &lt;a href=&quot;http://stackexchange.com/leagues/88/week/codegolf&quot;&gt;weekly / monthly / quarterly reputation leagues&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Pgg2O.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This shows your own spot at the top of list. However, this list only includes users with at least 200 reputation, so you'll need to get a bit more rep before you show up.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, when you get there, I think this list is only updated once a day.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-04-07T13:35:27.003" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5028" PostTypeId="5" CreationDate="2015-04-07T14:11:01.817" Score="0" Body="&lt;p&gt;Indicates you are proposing new rules or asking for clarification on other ones.&lt;/p&gt;&#xA;" OwnerUserId="38891" LastEditorUserId="38891" LastEditDate="2015-04-07T15:22:06.550" LastActivityDate="2015-04-07T15:22:06.550" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5029" PostTypeId="4" CreationDate="2015-04-07T14:11:01.817" Score="0" Body="Indicates you are proposing new rules or asking for clarification on other ones." OwnerUserId="38891" LastEditorUserId="38891" LastEditDate="2015-04-07T15:22:22.003" LastActivityDate="2015-04-07T15:22:22.003" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5030" PostTypeId="5" CreationDate="2015-04-07T14:13:11.670" Score="0" Body="" OwnerUserId="-1" LastEditorUserId="-1" LastEditDate="2015-04-07T14:13:11.670" LastActivityDate="2015-04-07T14:13:11.670" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5031" PostTypeId="4" CreationDate="2015-04-07T14:13:11.670" Score="0" Body="Indicates you are either proposing or asking for clarification on winning criteria." OwnerUserId="38891" LastEditorUserId="38891" LastEditDate="2015-04-07T15:22:32.953" LastActivityDate="2015-04-07T15:22:32.953" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5032" PostTypeId="2" ParentId="2140" CreationDate="2015-04-07T14:49:19.213" Score="5" Body="&lt;h1&gt;The Virtual Prisoners &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Background&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The year is 2251. You are a self-evolving KOTH bot, in the mysterious land known as Programming Puzzles and Code Golf. To evolve, you need permissions, and to get permissions, you need reputation. You decide that the best way to do this is to take over all of the questions to gain as much reputation as possible. The only problem? Every other bot has decided to do the exact same thing.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Game Explanation&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each round is battled on a question, with 11 vote nodes, between you and your enemy. The board starts as this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A1 A2 A3 N4 N5 N6 N7 N8 B9 B10 B11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;A&lt;/code&gt; is player A's nodes, &lt;code&gt;B&lt;/code&gt; is player B's nodes, and &lt;code&gt;N&lt;/code&gt; is a neutral node.&lt;br&gt;&#xA;Each turn, you may:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Vote on a vote node. If both players vote, nothing happens. If one side votes:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;and the node is controlled by no-one (neutral), it becomes that side's.&lt;/li&gt;&#xA;&lt;li&gt;and it is controlled by the voter's enemy, it becomes neutral.&lt;/li&gt;&#xA;&lt;li&gt;and it is controlled by the voter, nothing happens.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Guard a vote node. This guards the node from votes (friendly or enemy) for 2 turns.&lt;/li&gt;&#xA;&lt;li&gt;Use your 'power'. The powers are listed below, including how to use them.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your side wins if it controls at least 2/3rds (66%) of the vote nodes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;10000 rounds will be run, and the winner of the KOTH is whichever bot has the most wins (in the event of a tie, or indeterminate outcome, more matches are run until a clear winner is decided.)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;How Your Bot Should Work&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;It should accept as command-line arguments:&lt;br&gt;&#xA;&lt;code&gt;B A1 A2 A3 N4 N5 N6 N7 N8 B9 B10 B11&lt;/code&gt;&lt;br&gt;&#xA;Where &lt;code&gt;A&lt;/code&gt; denotes Player A's nodes, &lt;code&gt;N&lt;/code&gt; denotes a neutral node, &lt;code&gt;B&lt;/code&gt; denotes Player B's nodes, and the first argument (&lt;code&gt;B&lt;/code&gt; in this case) is the player your bot is. (This is decided randomly, your bot should work regardless.)&lt;br&gt;&#xA;It should return one of the following (powers are general rules):&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;V-4&lt;/code&gt;, vote on node 4&lt;br&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;G-3&lt;/code&gt;, guard node 3&lt;br&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;P-N&lt;/code&gt;, use power 'Neutralize'&lt;br&gt;&#xA;with or without a trailing newline.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Powers&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Intended to give bots a small boost. If &lt;code&gt;X&lt;/code&gt; was your power, you would use &lt;code&gt;P-X&lt;/code&gt;. You may only have one power per bot.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;N&lt;/code&gt; - Neutralize: Turn 2 random nodes to neutral ones.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;R&lt;/code&gt; - Rebellion: Pick a random node, and randomly turn it to a friendly, neutral, or hostile node. &lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;S&lt;/code&gt; - Swift Strikes: Pick two random nodes, and vote on them.&lt;br&gt;&lt;br&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Here are the extra rules:&lt;/strong&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The bots must fully run offline.&lt;/li&gt;&#xA;&lt;li&gt;The bots may not attempt to read any files, including their own source code.&lt;/li&gt;&#xA;&lt;li&gt;The bots may not tamper with, hack, or destroy other bots.&lt;/li&gt;&#xA;&lt;li&gt;The bots must return one of the three commands (&lt;code&gt;V&lt;/code&gt;, &lt;code&gt;G&lt;/code&gt;, or &lt;code&gt;P&lt;/code&gt;). If they do not, they forfeit their turn.&lt;/li&gt;&#xA;&lt;li&gt;The bots must not be targeting other bots specifically. (Beating general strategies is welcome.)&lt;/li&gt;&#xA;&lt;li&gt;You may update your bot as often as you like, but bots that are updated very frequently with no good reason (i.e, fixing fatal errors is a good reason) will be disqualified.&lt;/li&gt;&#xA;&lt;li&gt;Your bot must take under 90 seconds for it's turn. If it takes longer, it will be disqualified.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Submission contents&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your submission &lt;strong&gt;must&lt;/strong&gt; contain:&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The code for the bot&lt;/li&gt;&#xA;&lt;li&gt;The language it is written in (and a link to an offline interpreter, if necessary)&lt;/li&gt;&#xA;&lt;li&gt;Your bot's name (for the leaderboards)&lt;/li&gt;&#xA;&lt;li&gt;How to compile and run your bot&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If you do not include all of the required items in your submission, you will be notified, but your bot may not compete until this is fixed.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example Match&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Matches are organized between 2 randomly-selected bots. Here is an example, with bots &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt;:&lt;br&gt;&#xA;The board begins as this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A1 A2 A3 N4 N5 N6 N7 N8 B9 B10 B11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Bot A makes his move, voting on &lt;code&gt;N4&lt;/code&gt;, then Bot B votes on &lt;code&gt;N5&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A1 A2 A3 A4 B5 N6 N7 N8 B9 B10 B11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Node 4 becomes &lt;code&gt;A4&lt;/code&gt;, and it is now controlled by Bot A. Likewise, node 5 becomes &lt;code&gt;B5&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;A&lt;/code&gt; votes on &lt;code&gt;N8&lt;/code&gt;, and so does &lt;code&gt;B&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A1 A2 A3 A4 B5 N6 N7 N8 B9 B10 B11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Why did nothing happen? That's because both bots voted on the same node - cancelling out each other's effects.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When one bot controls 66% or greater of the nodes, that bot gains a win and the other bot gains a loss.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The game ends after 1024 turns, to prevent any bots that wait around forever. Whoever has the most nodes afterwards wins, or a draw if they have the same amount.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Additional Notes&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I will be submitting an example bot written in Python as part of my challenge. You are free to use and modify this bot for your submission.&lt;/li&gt;&#xA;&lt;li&gt;If your bot gives invalid output (not of the form &lt;code&gt;C-A&lt;/code&gt;, where &lt;code&gt;C&lt;/code&gt; is the command and &lt;code&gt;A&lt;/code&gt; is the argument), the bot forfeits its turn. If it does, you will be notified, and your bot will be removed until it is fixed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Meta Questions and Notes&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are there any loopholes?&lt;/li&gt;&#xA;&lt;li&gt;Should I add/modify/delete some of the powers?&lt;/li&gt;&#xA;&lt;li&gt;Is something too simple/confusing/uninteresting/overpowered?&lt;/li&gt;&#xA;&lt;li&gt;Should bots be able to see which nodes are and are not guarded?&lt;/li&gt;&#xA;&lt;li&gt;Should I limit people to one bot? If not, I will prevent the same person's bots from battling each other.&lt;/li&gt;&#xA;&lt;li&gt;I have thought of the following alternative way to win matches:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The game lasts 1024 turns. Whoever has the most nodes at the end wins.&lt;/li&gt;&#xA;&lt;li&gt;If, at one point, one bot controls all 11 nodes, that bot automatically wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Would this be a better win condition?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="38891" LastEditorUserId="38891" LastEditDate="2015-10-12T14:04:52.270" LastActivityDate="2015-10-12T14:04:52.270" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="5034" PostTypeId="2" ParentId="2140" CreationDate="2015-04-07T18:20:25.350" Score="0" Body="&lt;h1&gt;Make a fighter, then have them battle&lt;/h1&gt;&#xA;&lt;p&gt;Well, I was browsing around KOTH one day. I found two little interesting challenges: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/34833/save-the-last-bullet-for-yourself&quot;&gt;Save the last bullet for yourself&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/45285/cod%C3%A9mon-i-choose-you&quot;&gt;Cod&amp;#233;mon, I choose you!&lt;/a&gt;. But what if we combined the two?&lt;br&gt;&lt;br&gt;&lt;/p&gt;&#xA;&lt;h3&gt;How your bot will work&lt;/h3&gt;&#xA;&lt;p&gt;Each match, your bot is assigned an opponent. It is randomly decided who goes first. Your bot is given HP of 100. You must output:&lt;br&gt;&#xA;&lt;code&gt;ATKID DEFID MOVED ATKDIR DEFDIR&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;ATKID&lt;/code&gt; is the attack's ID, and &lt;code&gt;DEFID&lt;/code&gt; is the defense (or support) ID, for skills. MOVED is your move direction, on a number-pad (5 being 'stay still'). ATKDIR and DEFDIR are attack and defense skill directions (for Bullet, Wall, etc.)&lt;br&gt;&#xA;Your bot must accept the following as input:&lt;br&gt;&#xA;&lt;code&gt;MYHP YOURHP MYPOS YOURPOS (additional projectile positions)&lt;/code&gt;&lt;br&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your bot is allowed 2 attack and 2 defense skills.&lt;br&gt;&#xA;List of attack skills:&lt;br&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;0: Attack: Deal 10 damage.&lt;br&gt;&#xA;1: Psychic Blast: Deal 5 damage this turn and 5 damage the next.&lt;br&gt;&#xA;2: Bullet: Fire off a bullet that damages for 15 points when it hits an enemy.&lt;br&gt;&#xA;3: Hadouken: Fire of a large flaming ball that can fly for 3 squares, and deals 50 damage.&#xA;&lt;br&gt;&lt;br&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;List of defense skills:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;0: Block: Block up to 10 points of damage this turn.&lt;br&gt;&#xA;1: Heal: Heal for 10 points.&lt;br&gt;&#xA;2: Wall: Add a wall in target direction.&lt;br&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;How the arena works&lt;/h3&gt;&#xA;&lt;p&gt;The arena starts as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;==========&#xA;|        |&#xA;|        | &#xA;|a      b|&#xA;|        |&#xA;|        |&#xA;==========&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;where a and b are bots' starting positions.&lt;/p&gt;&#xA;&lt;h2&gt;Meta Questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What should I add as skills? Healing? Defensive?&lt;/li&gt;&#xA;&lt;li&gt;Is the arena too small?&lt;/li&gt;&#xA;&lt;li&gt;Have I left out any restrictions?&lt;/li&gt;&#xA;&lt;li&gt;Can I have some help with the 2D grid?&lt;/li&gt;&#xA;&lt;li&gt;Is the input/output sufficient?&lt;/li&gt;&#xA;&lt;li&gt;Does anyone want to pick up this challenge? I already have another KOTH, this was just an idea everyone liked.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="38891" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-04-07T20:33:03.217" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5036" PostTypeId="2" ParentId="2140" CreationDate="2015-04-07T21:05:43.880" Score="0" Body="&lt;h1&gt;Missing distance between points&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/error-correction&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;error-correction&amp;#39;&quot; rel=&quot;tag&quot;&gt;error-correction&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/and-some-other-tags&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;and-some-other-tags&amp;#39;&quot; rel=&quot;tag&quot;&gt;and-some-other-tags&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are &lt;code&gt;N&lt;/code&gt; points on a straight line. Someone calculates all possible distances between each pair of points and sort them. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the following example I used 5 points. The sorted list of distances is &lt;code&gt;[2, 5, 6, 8, 9, 14, 15, 17, 20, 22]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;---X--X------X---------X-----X---&#xA;&#xA;   |-2|---6--|----9----|--5--|&#xA;   |-----8---|-------14------|&#xA;      |--------15------|&#xA;   |---------17--------|&#xA;      |----------20----------|&#xA;   |----------22-------------|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You will receive the list, but one of the numbers is unreadable. This will be indicated by a zero. So you might receive the list &lt;code&gt;[2, 5, 6, 8, 9, 0, 15, 17, 20, 22]&lt;/code&gt;. Your job is to find the missing number. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input / Output:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a function/program that finds the missing number. The input (via STDIN, command-line argument, prompt or function argument) format is a list or an array of distances (integers). You can optionally take the number of points (one integer) as a second parameter if you want. The output (via return value or STDOUT) is one single integer, namely the missing number in the distances list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code-golf. Therefore the shortest code wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#points, distances -&amp;gt; output&#xA;5, [2, 5, 6, 8, 9, 0, 15, 17, 20, 22] -&amp;gt; 14&#xA;3, [1, 0, 2, 2, 3, 4] -&amp;gt; 2&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Sandbox notes:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;This challenge is based on one problem of this year's Mathematical Kangaroo. My dad is a math teacher and brought me a copy of the 7.-8. grades test.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Example and test cases don't look pretty and will be improved and extended for the final question on PPCG. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;My main concern about the challenge is the speed of the programs. My first (and only) solution is quite slow, because of the bad time complexity (about &lt;code&gt;(n^2)^(n-1)&lt;/code&gt;, where &lt;code&gt;n&lt;/code&gt; is the number of points on the line). The 5-point example takes already about 1 second to compute, a 6-point example took about 10 minutes. My guess is, that most code-golf solutions will use a similar approach and the programs may be quite difficult to test. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's definitely a better way of computing the missing number.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Maybe I'll add a few big testcases (one with 6, 7, 8, 9 and 10 points) and promise a 50% bonus if the program can solve all test-cases in under one minute.  &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="29577" LastActivityDate="2015-04-07T21:05:43.880" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5039" PostTypeId="1" AcceptedAnswerId="5054" CreationDate="2015-04-08T12:51:50.337" Score="22" ViewCount="332" Body="&lt;p&gt;There have been multiple times now that I've wanted to close a question as off-topic, but refrained from doing so due to the message associated with it:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;General programming questions&lt;/strong&gt; are off-topic here, but can be asked on &lt;a href=&quot;https://stackoverflow.com/about&quot;&gt;Stack Overflow&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;A prime example of this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/48607/got-indentation-error-on-this-particular-code-what-should-i-do&quot;&gt;this recently closed question&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That question can &lt;strong&gt;not&lt;/strong&gt; be asked on Stack Overflow! It is vague, improperly formatted, contains spelling errors and is too localized.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2015-04-19T22:12:53.517" Title="General programming questions close message is disingenuous" Tags="|discussion|status-completed|" AnswerCount="4" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5040" PostTypeId="2" ParentId="5039" CreationDate="2015-04-08T13:02:09.337" Score="6" Body="&lt;p&gt;Usually if I see a question which is off-topic, but can't be asked as is on Stack Overflow I do the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Give a &lt;strong&gt;custom close reason&lt;/strong&gt;, and if possible state where the user &lt;em&gt;can&lt;/em&gt; be redirected to (i.e. where their question &lt;em&gt;is&lt;/em&gt; on topic), and&lt;/li&gt;&#xA;&lt;li&gt;Leave a comment saying what they would need to fix up before their question will be suitable for the site in the first point.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="21487" LastEditorUserId="21487" LastEditDate="2015-04-08T13:07:59.413" LastActivityDate="2015-04-08T13:07:59.413" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5041" PostTypeId="2" ParentId="5039" CreationDate="2015-04-08T13:14:20.937" Score="0" Body="&lt;p&gt;I propose that our off topic message be changed to:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This question does not appear to be about programming puzzles or challenges within the scope defined in the &lt;a href=&quot;https://stackoverflow.com/help/on-topic&quot;&gt;Help Center&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The reason is that, for an off topic question:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&quot;It belongs on SO.&quot; is &lt;em&gt;sometimes&lt;/em&gt; true.&lt;/li&gt;&#xA;&lt;li&gt;&quot;It does not belong on PPCG.&quot; is &lt;em&gt;always&lt;/em&gt; true.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I would prefer that the default reason be one that is always true.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2015-04-10T20:53:01.013" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5043" PostTypeId="1" CreationDate="2015-04-08T20:36:12.963" Score="8" ViewCount="572" Body="&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/20986392#20986392&quot;&gt;I've noticed&lt;/a&gt; that my Red vs. Blue Sandbox controller snippet &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4954/red-vs-blue-pixel-team-battlebots-sandbox&quot;&gt;here&lt;/a&gt; has stopped working (at least in Chrome).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is incredibly strange because the &lt;a href=&quot;http://jsfiddle.net/CalvinsHobbies/utzjow0w/#base&quot; rel=&quot;nofollow noreferrer&quot;&gt;JSFiddle&lt;/a&gt; that is exactly identical is working fine. More importantly, if you go to the edit mode for the meta question, the snippet works fine when you click &lt;em&gt;Run code snippet&lt;/em&gt; in the render preview, or if you click &lt;em&gt;edit the above snippet&lt;/em&gt; &amp;rarr; &lt;em&gt;Run&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The error that the browser gives is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Uncaught SyntaxError: Unexpected token ILLEGAL&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;this makes perfect sense when you look at the JavaScript causing it:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;var battle, redTeam, blueTeam, interval&#xA;&#xA;1385d3a1-d76e-4049-926f-d58c6ff78ba5('#showCircles')&#xA;    loadEntries()&#xA;})&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I have no idea where the &lt;code&gt;1385d3a1-d76e-4049-926f-d58c6ff78ba5&lt;/code&gt; came from. The code should look something like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;var battle, redTeam, blueTeam, interval&#xA;&#xA;$(document).ready(function() {&#xA;    ctx = $('#canvas')[0].getContext('2d')&#xA;    moveCounter = $('#moveCounter')&#xA;    showNames = $('#showNames')&#xA;    showCircles = $('#showCircles')&#xA;    loadEntries()&#xA;})&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The edit page has the correct code but the real question doesn't.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm guessing it has something to do with jQuery or MathJax because of the &lt;code&gt;$&lt;/code&gt; involved.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Interestingly, the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/48353/red-vs-blue-pixel-team-battlebots&quot;&gt;official question&lt;/a&gt; snippet works fine. The code there is minified though so this may not be that surprising. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any clue what's going on?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Not sure but a similar error may be happening &lt;a href=&quot;https://codegolf.stackexchange.com/questions/48589/generate-mathjax-for-the-golden-ratio-continued-fraction?noredirect=1#comment114553_48589&quot;&gt;here&lt;/a&gt;.)&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="56656" LastEditDate="2022-09-29T16:16:56.057" LastActivityDate="2023-02-07T09:55:04.263" Title="Stack Snippets messing with JS?" Tags="|support|bug|status-completed|stack-snippets|" AnswerCount="3" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5044" PostTypeId="2" ParentId="5043" CreationDate="2015-04-08T21:06:16.493" Score="9" Body="&lt;p&gt;This is a MathJax-related issue. Here are some very short snippets that reproduce the bug, which appears to occur whenever multiple dollar signs are placed in a single code block:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$foo&#xA;$bar&#xA;$baz&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$&#xA;foo&#xA;bar&#xA;baz&#xA;$&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/revisions/ad993d34-af26-4d2e-9866-8df1f2593a81/view-source&quot;&gt;original source of this answer&lt;/a&gt; does not include any extra indentation, yet the rendered HTML does show it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;According to &lt;a href=&quot;https://codereview.meta.stackexchange.com/questions/5063/mathjax-breaks-my-indentation#comment10721_5063&quot;&gt;a comment by @m0sa, Stack Exchange developer&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I looked into it, turned out to be a deep rabbit hole requiring at major refactoring of MarkdownSharp (we'd need to make the pipeline extensible, so we could inject stuff before DoCodeBlocks in RunBlockGamut - currently all the processing happens before we ever hit MarkdownSharp, but we'd need to leverage it's block processing)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So, it's unlikely that this will be fixed any time soon (ugh).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, the answer is just &quot;use &lt;code&gt;jQuery&lt;/code&gt; or some other alias in your code instead of &lt;code&gt;$&lt;/code&gt;&quot; until this is fixed.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2015-04-08T21:06:16.493" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5045" PostTypeId="2" ParentId="5039" CreationDate="2015-04-08T22:16:03.557" Score="18" Body="&lt;p&gt;I agree that this is a very common issue. I don't have hard numbers to back this up but it feels like in 75% of the cases (or more) where someone asks a &quot;General Programming Question&quot; it's also of very low quality, so that it would also be rejected on Stack Overflow.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the same time, I think pointing people to SO with a fixed close vote reason is still nice and useful (whether they make their question meet SO's quality standards is their business). Therefore I propose changing the close vote reason to&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;General programming questions&lt;/strong&gt; are off-topic here. Your question may be better suited for &lt;a href=&quot;https://stackoverflow.com/tour&quot;&gt;Stack Overflow&lt;/a&gt;. As Stack Overflow also has very high quality standards, please take a minute and &lt;a href=&quot;https://stackoverflow.com/help/on-topic&quot;&gt;read their help center&lt;/a&gt; prior to posting to ensure that your question is appropriate for Stack Overflow.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2015-04-10T20:57:17.153" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5046" PostTypeId="2" ParentId="2140" CreationDate="2015-04-09T02:59:32.743" Score="0" Body="&lt;h1&gt;Shadows to Height Maps&lt;/h1&gt;&#xA;&lt;p&gt;The goal of this code challenge will be to take a grayscale image with shading as input and produce a height-map image with the same dimensions as output.&lt;/p&gt;&#xA;&lt;p&gt;The input image will be a grayscale 256x256 png image, shaded with only a diffuse term, no ambient or specular term. It will be lit by a directional light source hitting the surface at a 45 degree angle, from above.&lt;/p&gt;&#xA;&lt;p&gt;The output must be a 256x256 png image containing the height-map.&lt;/p&gt;&#xA;&lt;p&gt;This is a code-challenge, the answer with the most accurate results wins. (A perfect match between the reverse engineered height-map and the original height-map used to produce the shaded image is near impossible, it is not expected that they are identical).&lt;/p&gt;&#xA;&lt;p&gt;(working on test cases)&lt;/p&gt;&#xA;&lt;p&gt;tags:&lt;/p&gt;&#xA;&lt;p&gt;image-processing, code-challenge, graphical-output, conversion&lt;/p&gt;&#xA;" OwnerUserId="31133" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-04-09T02:59:32.743" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5047" PostTypeId="2" ParentId="2140" CreationDate="2015-04-09T11:01:42.697" Score="0" Body="&lt;h1&gt;SVG file optimization&lt;/h1&gt;&#xA;&lt;p&gt;Yep, I got my idea off of &lt;a href=&quot;https://graphicdesign.stackexchange.com/questions/50837/can-i-reduce-the-file-size-of-an-svg-to-be-closer-to-its-jpeg-equivalent&quot;&gt;this question&lt;/a&gt;, and it's amazing answer. All credit for this question goes to &lt;a href=&quot;https://graphicdesign.stackexchange.com/a/50857&quot;&gt;Illmari Karonen's answer&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Now, for the challenge: Write a program that removes unnecessary clutter from SVG files in order to reduce their byte counts.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Remove comments &lt;code&gt;&amp;lt;!-- comment --&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;remove metadata &lt;code&gt;&amp;lt;metadata ...&amp;gt;&lt;/code&gt; &lt;code&gt;&amp;lt;/metadata&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Shorten necessary ids to 1 letter, and remove unused ids.&lt;/li&gt;&#xA;&lt;li&gt;remove unnecessary attributes and XML namespace attributes&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Any other methods used to shorten the SVG files are welcome. (You can refer to the linked answer to look at an extensive list of ways to shorten SVG files)&lt;/p&gt;&#xA;&lt;p&gt;Your program's score is how many bytes it removes from these SVG files:&lt;/p&gt;&#xA;&lt;p&gt;test cases in progress&lt;/p&gt;&#xA;" OwnerUserId="31133" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-04-09T11:01:42.697" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5050" PostTypeId="1" CreationDate="2015-04-09T17:04:13.233" Score="3" ViewCount="210" Body="&lt;p&gt;Some time ago, I set &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35459/create-a-fizzbuzz-compiler&quot;&gt;this challenge&lt;/a&gt; as a test for a new type of challenge I called &quot;compiler golf&quot;. In the end, my idea didn't set the world alight but I wanted to see if anyone had ideas for improving the idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The original version of the FizzBuzz challenge set the score by the length of the generated code, not by the compiler itself. My thinking there was that when thinking about real-world compilers, we care more about the quality of the generated code rather than the quality of the compiler. I wanted to reward writing extra code for optimizing the output, rather than to penalize it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On reflection, the challenge I chose didn't lend itself to optimization and in the end I changed the rules to include the length of the compiler in the score, as people taking the challenge were golfing their compilers anyway.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is compiler-golf something we want more of on this site?&lt;br&gt;&#xA;What should be the rules of compiler-golf?&lt;br&gt;&#xA;What else can we learn from my failed attempt to get it going?&lt;/p&gt;&#xA;" OwnerUserId="20793" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-05-09T22:50:34.687" Title="Thoughts on compiler golf?" Tags="|discussion|new-genre|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5051" PostTypeId="2" ParentId="3578" CreationDate="2015-04-09T19:05:35.213" Score="4" Body="&lt;h1&gt;King Of The Tycoon&lt;/h1&gt;&#xA;&lt;p&gt;It occurred to me that PPCG users might be the type of person that enjoys playing tycoon games - think of Rollercoaster Tycoon, Zoo Tycoon, Sim City, Sid Meiers Railroad Tycoon, Airport Tycoon, etc etc. (admit it, at least a few of you has one of these installed). Perhaps even Monopoly and Catan could be counted in.&lt;/p&gt;&#xA;&lt;p&gt;I think this could make some nice programming challenges, because&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It involves some kind of simulator/controller, which could actually be made with a &lt;code&gt;popularity-contest&lt;/code&gt; or some other interesting challenge. Alternatively, anybody with too much free time on their hands could make a controller.&lt;/li&gt;&#xA;&lt;li&gt;Beating your fellow players can be done with various strategies, and a good designed management game (with some kind of economics involved) usually does not have a 'best' strategy, allowing for interesting programs, and of course a lovely &lt;code&gt;king-of-the-hill&lt;/code&gt; challenge.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Sounds like a nice theme?&lt;/p&gt;&#xA;" OwnerUserId="32352" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-04-09T19:05:35.213" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5052" PostTypeId="2" ParentId="5050" CreationDate="2015-04-09T21:54:41.340" Score="2" Body="&lt;p&gt;As user23013 commented, this isn't really all that novel. It's normally referred to as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt; (and as you can see, we even have a tag for it). In general, any sort of code generation challenge which is scored by the size of the generated code is metagolf, and the tag should be used if this is the primary winning criterion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't think there should be a standard winning criterion which counts both the output and the generating program's size, because the balance of these too will always depend on the challenge in question (and getting mixed winning criteria right is always tricky). So if you want to take both things into account, just use the catch-all &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-04-09T21:54:41.340" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5054" PostTypeId="2" ParentId="5039" CreationDate="2015-04-10T11:33:30.950" Score="21" Body="&lt;p&gt;SO itself uses the following style for their close reasons:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Questions about &lt;strong&gt;general computing hardware and software&lt;/strong&gt; are off-topic for Stack Overflow unless they directly involve tools used primarily for programming. You may be able to get help on &lt;a href=&quot;https://superuser.com/about&quot;&gt;Super User&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;and:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Questions on &lt;strong&gt;professional server- or networking-related infrastructure administration&lt;/strong&gt; are off-topic for Stack Overflow unless they directly involve programming or programming tools. You may be able to get help on &lt;a href=&quot;https://serverfault.com/about&quot;&gt;Server Fault&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The &quot;You may be able to get help...&quot; message is nicely non-committal, as it should be for a boilerplate message &amp;mdash; yes, you &lt;em&gt;may&lt;/em&gt; be able to get an answer to your question on SO/SU/SF, &lt;em&gt;if&lt;/em&gt; you describe your problem clearly in understandable English, provide a simple code example demonstrating the issue, and this time make sure that your question actually &lt;em&gt;is&lt;/em&gt; on topic for the site you're asking it on.  But there's no implied guarantee in there.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I'd suggest adopting the same non-committal phrasing here, e.g. like this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This site is for programming contests and challenges. &lt;strong&gt;General programming questions&lt;/strong&gt; are off-topic here. You may be able to get help on &lt;a href=&quot;https://stackoverflow.com/about&quot;&gt;Stack Overflow&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This phrasing avoids implying anything (positive or negative) about the question's general quality.  Of course, it you really feel that a specific off-topic question is so awful (or so excellent) that it needs something less neutral, you can always copy-paste the text as a custom close reason, and tweak it as you like.&lt;/p&gt;&#xA;" OwnerUserId="3191" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2015-04-10T11:33:30.950" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5055" PostTypeId="1" CreationDate="2015-04-10T12:01:00.047" Score="0" ViewCount="64" Body="&lt;p&gt;Today I found something weird with stack snippets...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I found it in this question:&lt;a href=&quot;https://codegolf.stackexchange.com/questions/48649/interpreting-fish-no-not-that-fish&quot;&gt;Interpreting Fish (no, not that Fish)&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It was in my answer: &lt;a href=&quot;https://codegolf.stackexchange.com/a/48686/14732&quot;&gt;https://codegolf.stackexchange.com/a/48686/14732&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Basically, &lt;code&gt;R(r+'(?=[&amp;gt;,]|$)','g')&lt;/code&gt; is being converted to &lt;code&gt;R('^'+r+'+01943df1-b949-454b-b253-e39f9f31ca1e)','g')&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here it is converted to &lt;code&gt;+@@0@@)&lt;/code&gt; when editing/writting the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can check it here:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;var alert=console.log=function(s){document.write(s)+'&amp;lt;br&amp;gt;';};&#xD;&#xA;try{&#xD;&#xA;alert(prompt(R=RegExp,r='(&amp;lt;&amp;lt;?&amp;gt;&amp;lt;|&amp;gt;&amp;lt;&amp;gt;&amp;gt;?|,&amp;lt;\.\.&amp;gt;,|&amp;gt;&amp;gt;&amp;lt;&amp;gt;|&amp;gt;&amp;lt;&amp;lt;&amp;lt;&amp;gt;|&amp;lt;&amp;gt;&amp;lt;&amp;lt;|&amp;lt;&amp;gt;&amp;gt;&amp;gt;&amp;lt;)').match(R('^'+r+'+$'))[0].split(R(r+'(?=[&amp;gt;,]|$)','g')).join(' '));&#xD;&#xA;}catch(e){console.log(e);}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I tried IE11 and Chrome, and both have the bug.&lt;/p&gt;&#xA;" OwnerUserId="14732" LastEditorUserId="68942" LastEditDate="2021-06-05T03:26:24.260" LastActivityDate="2021-06-05T03:26:24.260" Title="`R(r+'(?=[&gt;,]|$)','g')` is converted to `R('^'+r+'+01943df1-b949-454b-b253-e39f9f31ca1e)','g')`" Tags="|bug|status-completed|stack-snippets|" AnswerCount="0" CommentCount="0" ClosedDate="2015-04-10T12:08:09.590" ContentLicense="CC BY-SA 3.0" />
  <row Id="5056" PostTypeId="1" AcceptedAnswerId="5057" CreationDate="2015-04-10T12:37:47.000" Score="22" ViewCount="1218" Body="&lt;p&gt;&lt;strong&gt;Update:&lt;/strong&gt; The decision has been made to deactivate MathJax on the site. This does not reflect the current votes, as these changed significantly after the decision was made.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;We've had MathJax support &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5024/8478&quot;&gt;for 3 days now&lt;/a&gt;. &lt;a href=&quot;https://codegolf.stackexchange.com/q/42079/8478&quot;&gt;While it makes our maths challenges look neat&lt;/a&gt;, it has also created two problems:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The presentation of &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=The+next+answer+has+to+match+the+following+strings++is%3Aa&quot;&gt;some search results is messed up&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5043/8478&quot;&gt;Indentation of code blocks and Stack Snippets are messed up&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Especially the latter is a fairly big deal around here. So far, only a few questions have adopted MathJax, and these could still be reverted. However, if we wait any longer, too much content on this site will rely on MathJax to be able to revert MathJax support.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/3/chris-jester-young&quot;&gt;Chris&lt;/a&gt; has asked me to get a new community consensus on whether we want to keep MathJax. Apparently, fixing the above issues is not a priority (although it might happen some day).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do we want MathJax to be deactivated until these issues are fixed?&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-02-07T19:01:56.153" Title="Do we really want LaTeX/MathJax (right now)?" Tags="|discussion|status-completed|latex|" AnswerCount="3" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="5057" PostTypeId="2" ParentId="5056" CreationDate="2015-04-10T12:41:21.843" Score="-6" Body="&lt;h1&gt;Yes, deactivate MathJax until these issues are fixed&lt;/h1&gt;&#xA;" OwnerUserId="-1" OwnerDisplayName="anon" LastEditorUserId="-1" LastActivityDate="2015-04-10T12:41:21.843" CommentCount="3" CommunityOwnedDate="2015-04-10T12:41:21.843" ContentLicense="CC BY-SA 3.0" />
  <row Id="5058" PostTypeId="2" ParentId="5056" CreationDate="2015-04-10T12:43:40.890" Score="39" Body="&lt;h1&gt;No, keep MathJax&lt;/h1&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-04-10T12:43:40.890" CommentCount="3" CommunityOwnedDate="2015-04-10T12:43:40.890" ContentLicense="CC BY-SA 3.0" />
  <row Id="5059" PostTypeId="2" ParentId="5056" CreationDate="2015-04-10T13:02:31.377" Score="26" Body="&lt;h1&gt;Keep MathJax, but change the delimiters&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;From my comment:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Note: We might also be able to get away with changing the delimiter instead (ex. using &lt;code&gt;\$foo\$&lt;/code&gt; instead of &lt;code&gt;$foo$&lt;/code&gt;, and similarly &lt;code&gt;\$$&lt;/code&gt; instead of &lt;code&gt;$$&lt;/code&gt;), which would give us MathJax and unbroken code blocks for the most part (how often are you going to have &lt;code&gt;\$&lt;/code&gt; happen twice in one code block?). The only reason I'm not posting this as an answer is that I still haven't Done the Science™ on a site with &lt;code&gt;\$&lt;/code&gt; as their delimiter to make sure that this would actually fix the problem.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So &lt;a href=&quot;https://electronics.meta.stackexchange.com/a/5206/27816&quot;&gt;I tried it&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/ThtDh.png&quot; alt=&quot;screenshot&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Looks perfect. My suggestion: &lt;strong&gt;change the delimiters from &lt;code&gt;$&lt;/code&gt; to &lt;code&gt;\$&lt;/code&gt;&lt;/strong&gt;&lt;s&gt;, and &lt;code&gt;$$&lt;/code&gt; to &lt;code&gt;\$$&lt;/code&gt;&lt;/s&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Update:&lt;/strong&gt; Customising the display mode delimiters &lt;code&gt;$$&lt;/code&gt; is not currently possible. (See Chris's comment.)&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T15:45:37.290" LastActivityDate="2015-04-10T16:17:58.060" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5062" PostTypeId="2" ParentId="2190" CreationDate="2015-04-10T13:27:01.563" Score="14" Body="&lt;p&gt;I would partition values into the categories truthy, falsy, and indeterminate according to the following rules:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following values are considered falsy:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the zero value of the type of the result, if any&lt;/li&gt;&#xA;&lt;li&gt;a &lt;code&gt;NULL&lt;/code&gt; pointer&lt;/li&gt;&#xA;&lt;li&gt;an array, the product of its dimensions being zero&lt;/li&gt;&#xA;&lt;li&gt;a number whose absolute difference to 0 is not larger than 2&lt;sup&gt;-44&lt;/sup&gt;.&lt;/li&gt;&#xA;&lt;li&gt;a string literal parsed as a number yielding such a number&lt;/li&gt;&#xA;&lt;li&gt;a string literal which when executed as a program of the language the submission is written in yields a falsy value. This rule cannot be applied more than once transitively.&lt;/li&gt;&#xA;&lt;li&gt;an empty string&lt;/li&gt;&#xA;&lt;li&gt;the boolean value &lt;code&gt;false&lt;/code&gt; (if any)&lt;/li&gt;&#xA;&lt;li&gt;a string which, when converted to lower case, is equal to one of &lt;code&gt;false&lt;/code&gt;, &lt;code&gt;no&lt;/code&gt;, &lt;code&gt;f&lt;/code&gt;, or &lt;code&gt;n&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;a function which for any combination of arguments returns a falsy value.  This rule cannot be applied more than once transitively.&lt;/li&gt;&#xA;&lt;li&gt;of an enumeration type whose values are not associated with numbers the first enumeration value&lt;/li&gt;&#xA;&lt;li&gt;of an enumeration type whose values are associated with numbers an enumeration value associated with a falsy value, otherwise the first enumeration value&lt;/li&gt;&#xA;&lt;li&gt;a compound type (e.g. a struct) comprising only falsy values&lt;/li&gt;&#xA;&lt;li&gt;a union type the last write to which wrote a falsy value&lt;/li&gt;&#xA;&lt;li&gt;a pointer to a falsy value&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The following values are considered indeterminate:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a NaN&lt;/li&gt;&#xA;&lt;li&gt;a stray pointer&lt;/li&gt;&#xA;&lt;li&gt;a trap representation&lt;/li&gt;&#xA;&lt;li&gt;an undefined value&lt;/li&gt;&#xA;&lt;li&gt;a function which for some combination of arguments returns a falsy value and for others returns a non-falsy value.&lt;/li&gt;&#xA;&lt;li&gt;the absence of value, i.e. returning nothing&lt;/li&gt;&#xA;&lt;li&gt;the absence of ordinary termination, e.g. termination with an exception or crash or no termination&lt;/li&gt;&#xA;&lt;li&gt;a value, reading from which causes an exception, non-termination, or crash&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;All other values are considered truthy.&lt;/p&gt;&#xA;" OwnerUserId="134" LastActivityDate="2015-04-10T13:27:01.563" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5063" PostTypeId="2" ParentId="5043" CreationDate="2015-04-10T15:30:07.813" Score="0" Body="&lt;p&gt;On the meta only, I have edited the MathJax delimiter to use &lt;code&gt;\\(&lt;/code&gt; and &lt;code&gt;\\)&lt;/code&gt;. Let me know if this allows your snippets to work better!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Testing alternative MathJax invocation syntax: \(\sqrt{x^2+y^2}\)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Display mode still works:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;\[\sqrt{x^2+y^2}\]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another test from Martin:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abc$&#xA;    $def&#xA;$$ab&#xA;    de$$&#xA;\(ab&#xA;de\)&#xA;\[ab&#xA;de\]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="3" LastEditorUserId="8478" LastEditDate="2015-04-11T21:07:40.910" LastActivityDate="2015-04-11T21:07:40.910" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5066" PostTypeId="2" ParentId="2140" CreationDate="2015-04-11T21:44:26.553" Score="0" Body="&lt;h1&gt;Minimal convex partition (code-golf)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The goal of this challenge is dividing up the 'white' shape of a given 'black and white' pixel image into smaller pieces, which together form the original image (let's call this &lt;em&gt;a partition&lt;/em&gt;). The restriction is that those pieces have to be &lt;em&gt;convex&lt;/em&gt;, in our case everything is made up from square pixels, therefore the convex pieces can only be rectangles.&#xA;Now of course you can just divide the whole shape up into the pixels it consists of, but that way you will get too many pieces (usually). The goal here is finding one partition that has the lowest number of (convex) pieces. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specs&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The 'black and white' pixel image of $n \times m$ pixels is given as a string, row by row, each row separated by a comma. The &lt;em&gt;white&lt;/em&gt; pixels are represented by a full stop &lt;code&gt;.&lt;/code&gt;, and the &lt;em&gt;black&lt;/em&gt; pixels are represented by a hash mark &lt;code&gt;#&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The output consists of the same string, but now the white pixels must be replaced by alphabetic characters, one character for each piece of the partition. The minimal number of partition never exceeds 26 (you do not have to consider input that does not meed this condition), therefore you only have to use the letters &lt;code&gt;a-z&lt;/code&gt;. If the minimal number is $n$, you have to use the first $n$ letters of the alphabet. Of course, the output is not necessarily unique.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples (without the commas, for better visibility):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;n=2:&#xA;Input: &#xA;#.&#xA;..&#xA;Ouptut:&#xA;#A&#xA;BB&#xA;&#xA;n=4&#xA;Input:&#xA;....&#xA;..#.&#xA;....&#xA;Output:&#xA;AABB&#xA;AA#C&#xA;DDDD&#xA;&#xA;n=6&#xA;Input:&#xA;.....&#xA;.#...&#xA;.....&#xA;...#.&#xA;.....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;META:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'd be happy for any interesting input examples. I could not think of any really interesting ones right away now.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2015-04-19T21:46:03.143" LastActivityDate="2015-04-19T21:46:03.143" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5069" PostTypeId="1" CreationDate="2015-04-12T15:05:53.897" Score="9" ViewCount="124" Body="&lt;p&gt;I occasionally find that important tags are missing tag wikis or have only very rudimentary information in them. At the same time, I often find it hard to write &lt;em&gt;good&lt;/em&gt; tag wikis.&lt;/p&gt;&#xA;&lt;p&gt;The challenge-type tag wikis don't seem to have that problem - I think they are all fairly decent:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;However, the thematic tags are often quite useless. From &lt;a href=&quot;http://blog.stackoverflow.com/2011/03/redesigned-tags-page/&quot;&gt;Jeff Atwood's post about tag wikis&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Avoid generically defining the concept behind a tag, unless it is highly specialized. [...]&lt;/p&gt;&#xA;&lt;p&gt;Concentrate on what a tag means to &lt;em&gt;your&lt;/em&gt; community. [...]&lt;/p&gt;&#xA;&lt;p&gt;Provide basic guidance on when to use the tag. [...]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;A lot of our tag wikis don't follow these guidelines. Have a look at these:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphs&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphs&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphs&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot;&gt;sorting&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot;&gt;chess&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fractal&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fractal&amp;#39;&quot; rel=&quot;tag&quot;&gt;fractal&lt;/a&gt;...&lt;/p&gt;&#xA;&lt;p&gt;Many of these simply boil down to &amp;quot;challenges related to X&amp;quot;, sometimes with some encyclopaedic information about the concept which you might as well look up on Wikipedia.&lt;/p&gt;&#xA;&lt;p&gt;So my question is, can we do something about this? Is there some useful information, for &lt;em&gt;this&lt;/em&gt; community, to put into these tag wikis? Some wikis, like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt; for instance, reference other tags which might be more appropriate. What else could be useful in the wikis?&lt;/p&gt;&#xA;&lt;p&gt;Or should we just follow Jeff's advice in point 5, and just dispense these tag wikis altogether?&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;But if the tag is common knowledge — that is, if you walked up to any random person on the street and said the tag word to them, and they would know what you were talking about — then don’t bother explaining the tag at all. Stick to usage of the tag within your community in the excerpt.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Even so, I think an excerpt like &amp;quot;for challenges involving some sort of sequence.&amp;quot; for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; is still completely useless and tautological. Note that we even have the following rejection reason for tag excerpt edits:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Circular tag definition.&lt;/strong&gt; Tag excerpts amounting to, &amp;quot;[tag] is for questions about [tag]&amp;quot; are pointless and usually rejected. Excerpts should describe &lt;strong&gt;why&lt;/strong&gt; and &lt;strong&gt;when&lt;/strong&gt; a tag would be used.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-04-13T10:35:07.117" Title="How to write good tag wikis?" Tags="|discussion|tags|tag-wikis|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5071" PostTypeId="2" ParentId="1061" CreationDate="2015-04-12T21:39:16.420" Score="-44" Body="&lt;h2&gt;Compressing your source code&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Some language provide builtin facilities to compress data and execute the result as source code. I consider this to be a standard loophole, especially when the challenge is counted in characters instead of bytes.&lt;/p&gt;&#xA;" OwnerUserId="134" LastActivityDate="2015-04-12T21:39:16.420" CommentCount="3" CommunityOwnedDate="2015-04-12T21:39:16.420" ContentLicense="CC BY-SA 3.0" />
  <row Id="5073" PostTypeId="2" ParentId="5069" CreationDate="2015-04-13T08:25:24.007" Score="1" Body="&lt;p&gt;In my opinion, the most useful piece of information in a PPCG tag wiki is Jeff's point 4: what kinds of questions should be tagged with it, and what kinds of questions shouldn't. The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; tag is a good example of one that I'm not sure when to use (so I don't, unless I'll do a challenge straight from the &lt;a href=&quot;https://oeis.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A good course of action for the current low-quality tag wikis, at least for the thematic ones, could be to take a look at the questions that are currently tagged with them, and try to find some common ways in which the tag relates to the challenges. For example, I suspect that most questions tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt; are about generating prime numbers (or some variants of them) or testing primality under various restrictions, with a couple of more exotic cases thrown in, so the wiki should reflect that. On the other hand, something like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt; is less clear. Some challenges have a 2D grid of numbers or characters as input and/or output, and others specify that the input or output should be interpreted as the coordinates of a grid. The wiki could list these &quot;use cases&quot; as examples.&lt;/p&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="32014" LastEditDate="2015-04-13T10:35:07.117" LastActivityDate="2015-04-13T10:35:07.117" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5075" PostTypeId="2" ParentId="2140" CreationDate="2015-04-14T13:53:38.080" Score="1" Body="&lt;h1&gt;Programming Tetris Blocks (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/48739/programming-tetris-blocks-literally&quot;&gt;Even More Literally?&lt;/a&gt;)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you will write a Tetris AI.  There's one twist though: the AI will operate from the perspective of the Tetris blocks themselves.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note: I am worried about the novelty of this question.  The key is &quot;the perspective of the Tetris blocks themselves.&quot; In order to make this interesting, I have to give the AI a bare minimum of information needed to make a move.  Otherwise, it will just be a regular Tetris AI challenge.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When a Tetris block is spawned at the top of the map, a new AI object is created.  Each time step, and the block receives data about its immediate surroundings and returns a move (move left/right, rotate clockwise/counterclockwise, or nothing).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An idea as to &quot;block vision&quot;: each of the four squares in a block each have four &quot;eyes,&quot; one on each side.  Each eye returns the distance to the nearest wall/block (including/excluding other squares in the same block?).  This means that the AI will receive exactly sixteen numbers each update.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#######&#xA;# 1234#&#xA;#  #  #&#xA;#### ##&#xA;#######&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If a 2D array where each row (1st level) is a square and each column (second level) is an eye in the directions [U,D,L,R], then here is what could be seen as input, with 0s representing an adjoining block.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[1,2,2,0],[1,1,0,0],[1,3,0,0],[1,2,0,1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;More details coming sometime not now.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:21.033" LastActivityDate="2015-04-14T17:25:53.553" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5076" PostTypeId="2" ParentId="1061" CreationDate="2015-04-14T16:51:03.350" Score="84" Body="&lt;h1&gt;Using &lt;a href=&quot;http://esolangs.org/wiki/MetaGolfScript&quot; rel=&quot;nofollow noreferrer&quot;&gt;MetaGolfScript&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;MetaGolfScript is a family of programming languages. For example, the empty program in MetaGolfScript-209180605381204854470575573749277224 prints &quot;Hello, World!&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is similar to using extra command line arguments, where they should also count as characters. And using the standard interpreter is likely &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1072/25180&quot;&gt;using the program name to store data&lt;/a&gt;, except it's the interpreter's name. But someone can build a website with &lt;strike&gt;a fake directory&lt;/strike&gt; a directory compressed by a special purpose compression algorithm like all our Kolmogorov complexity challenges, of all MetaGolfScript languages, each with an interpreter can run independently with its filename. They can also use generated descriptions and random code obfuscations to make languages not similar to each other, and it will be hard to say it's still an argument or configuration somewhere.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2015-08-25T07:53:08.650" CommentCount="9" CommunityOwnedDate="2015-04-14T16:51:03.350" ContentLicense="CC BY-SA 3.0" />
  <row Id="5079" PostTypeId="1" CreationDate="2015-04-15T07:39:58.803" Score="14" ViewCount="553" Body="&lt;p&gt;I was curious to find out the answer count for each of the languages I golf in.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using the Stack Exchange Data Explorer, I just wrote a query to answer just that and thought other people might find it interesting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://data.stackexchange.com/codegolf/revision/301169/390503/my-answer-count-per-language?userId=3527&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt; are my languages. Query with your user id to find out yours.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While we're at it, &lt;a href=&quot;http://data.stackexchange.com/codegolf/revision/301170/390502/code-golf-languages&quot; rel=&quot;nofollow noreferrer&quot;&gt;here's a list of all the languages on the site&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The queries are not perfect, and they rely on the answer body to be of the form: &lt;code&gt;&amp;lt;h?&amp;gt;{LanguageName}?&lt;/code&gt;, where:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the first &lt;code&gt;?&lt;/code&gt; can be &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;2&lt;/code&gt;, or &lt;code&gt;3&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;the second &lt;code&gt;?&lt;/code&gt; can be space, colon, comma, or &lt;code&gt;&amp;lt;&lt;/code&gt; &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(after some trial and error I noticed these values work in most of the cases)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Suggestions for improving the queries are welcome.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt; Removed the answers to King-of-the-hill questions (improvement suggested by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5086/3527&quot;&gt;steveverrill&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also merged the two queries into one, which allows &lt;a href=&quot;http://data.stackexchange.com/codegolf/revision/301314/390708/code-golf-languages?userId=3527&quot; rel=&quot;nofollow noreferrer&quot;&gt;filtering by a user id&lt;/a&gt;, or specifying &lt;code&gt;null&lt;/code&gt; to see &lt;a href=&quot;http://data.stackexchange.com/codegolf/revision/301314/390708/code-golf-languages?userId=null&quot; rel=&quot;nofollow noreferrer&quot;&gt;all stats&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt; Improved the query by implementing ProgramFOX's suggestion (parse language names when wrapped in &lt;code&gt;&amp;lt;a&amp;gt;&lt;/code&gt; tags): &lt;a href=&quot;http://data.stackexchange.com/codegolf/revision/308877/400000/code-golf-languages&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://data.stackexchange.com/codegolf/revision/308877/400000/code-golf-languages&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt; Added &quot;Total Score&quot; column (sum of upvotes): &lt;a href=&quot;http://data.stackexchange.com/codegolf/revision/308882/400005/code-golf-languages&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://data.stackexchange.com/codegolf/revision/308882/400005/code-golf-languages&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="3527" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2015-06-04T19:08:38.763" Title="What are my code golf languages?" Tags="|discussion|data-explorer|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5080" PostTypeId="2" ParentId="5079" CreationDate="2015-04-15T08:08:59.583" Score="6" Body="&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt; &lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some of my answers have links in the header, pointing to a wiki page about the used language. It would be nice if these answers are counted as well.&lt;/p&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="9275" LastEditDate="2015-05-01T06:20:02.243" LastActivityDate="2015-05-01T06:20:02.243" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5081" PostTypeId="1" CreationDate="2015-04-15T12:33:31.313" Score="6" ViewCount="121" Body="&lt;p&gt;Suppose I'm writing a question, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; or the like, and I want solutions to have &quot;reasonable run-times&quot;. No solutions that would take years to complete, that sort of think. What are good options for conditions to put in the question to make sure this happens?&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="20080" LastEditDate="2015-04-15T13:01:14.490" LastActivityDate="2015-04-15T16:39:18.327" Title="How Should I Enforce Reasonable Runtimes?" Tags="|discussion|" AnswerCount="4" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5082" PostTypeId="2" ParentId="5081" CreationDate="2015-04-15T12:35:34.850" Score="0" Body="&lt;h1&gt;Include specific run-time requirements&lt;/h1&gt;&#xA;&lt;p&gt;For instance, &amp;quot;Your solution must run in under 10 minutes on all test cases provided on my machine.&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;Downside: Not all languages are easily available, requires OP effort. Timing may not be consistent between machines.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-04-15T12:37:28.970" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5083" PostTypeId="2" ParentId="5081" CreationDate="2015-04-15T12:38:09.707" Score="-4" Body="&lt;h1&gt;Require Output Demonstration&lt;/h1&gt;&#xA;&lt;p&gt;For instance, &amp;quot;You must have run your solution on all test cases provided, and include the results in your answer, as well as the runtime.&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;Downside: Advantages faster computers. Only works for cutoffs around the 1 day - 1 week, not more or less.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-04-15T12:45:08.433" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5084" PostTypeId="2" ParentId="5081" CreationDate="2015-04-15T12:40:33.333" Score="-4" Body="&lt;h1&gt;Require Good Asymptotics&lt;/h1&gt;&#xA;&lt;p&gt;For instance, &amp;quot;Polynomial run-times only.&amp;quot; or &amp;quot;Solutions must be O(n^4)&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;Downside: Not all participants will be familiar with asymptotic analysis. Not all algorithms are easy to analyze. May be dependent on fine details of language implementation. Asymptotics may conceal large constant factors.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-04-15T12:44:00.410" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5085" PostTypeId="2" ParentId="5081" CreationDate="2015-04-15T12:42:57.153" Score="13" Body="&lt;h1&gt;Be reasonable&lt;/h1&gt;&#xA;&lt;p&gt;For instance, &amp;quot;Answers should run in seconds or minutes, not hours or days&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;Downside: Somewhat subjective, may be computer specific in some cases.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-04-15T12:42:57.153" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5086" PostTypeId="2" ParentId="5079" CreationDate="2015-04-15T13:24:50.573" Score="8" Body="&lt;p&gt;+1, Very interesting data, unfortunately reliant on how people present their answers. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the bottom end of the table you can see a lot of KOTH answers with the names of bots being misinterpreted as languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But the greatest issue is that Brainfuck is all over the place! There are seperate entries for &lt;strong&gt;&lt;code&gt;Brainf**k&lt;/code&gt;&lt;/strong&gt; and &lt;strong&gt;&lt;code&gt;Brainf***&lt;/code&gt;&lt;/strong&gt; for example. Searchability is a great reason to stop censoring the name of this language!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ordering by language also reveals the great variety of ways that C and its derivatives are presented. there are over 20 entries, and I'm surprised we have less C++ than C# I wonder if that's correct? Still, good work!&lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="15599" LastEditDate="2015-04-15T13:31:03.403" LastActivityDate="2015-04-15T13:31:03.403" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5088" PostTypeId="2" ParentId="1610" CreationDate="2015-04-15T17:35:18.953" Score="0" Body="&lt;h1&gt;About 50% good&lt;/h1&gt;&#xA;&lt;p&gt;I have always thought creating and sharing programming languages was cool. And I had even found some on PPCG, but they were closed quickly. And I've also seen some comments against this idea, due to the fact everything will end up similar to a real language. Here's what I think:&lt;br&gt;&lt;/p&gt;&#xA;&lt;h2&gt;How would languages be submitted?&lt;/h2&gt;&#xA;&lt;p&gt;They would be posted on a meta thread, under community wiki, because you can't really have 2 of these questions (maybe under Sandbox's user?) They would not necessarily be golfing languages, and they wouldn't need to be tested, which takes care of update problems.&lt;br&gt;&#xA;You would provide some basic syntax (a &amp;quot;Hello, world!&amp;quot;, math, variables, etc.) and the interpreter (as well as how to run and compile both programs and the interpreter.) Other people could suggest things to add to your language, try it out for themselves, etc. Maybe, someone will use another person's language in an answer (with credit, of course), and how awesome would &lt;strong&gt;that&lt;/strong&gt; feel?&lt;/p&gt;&#xA;&lt;h2&gt;Quality control for challenges?&lt;/h2&gt;&#xA;&lt;p&gt;Not necessary. As I said, they wouldn't need to be tested. Quality of sumbissions, however, is based on if the language is a duplicate, stole/used ideas without credit, how functional it is, and this is mainly decided by the community.&lt;/p&gt;&#xA;&lt;h2&gt;How many people would actually put in the necessary effort in the first phase?&lt;/h2&gt;&#xA;&lt;p&gt;Well, for one, me! And anyone who has ever created a custom language (of which I have seen a few), or wants to make one. If we can get a developer to implement this under Sandbox's user, all new submissions would be posted in chat, meaning the word is definitely spread. This would also be a place to post your language, so maybe the site gets some extra traffic, which always helps.&lt;/p&gt;&#xA;&lt;h2&gt;What should this be called?&lt;/h2&gt;&#xA;&lt;p&gt;My idea? (I'm open to suggestions on this point.) 'Sandbox for Community-Designed Languages'. Yeah, it's a bit lengthy, but it sums up the point.&lt;/p&gt;&#xA;&lt;h2&gt;Overall&lt;/h2&gt;&#xA;&lt;p&gt;Designing languages might work, but restricting them to golfing and having one person use them in challenges (or even worse, everyone doing it, and other people choosing bad fits for certain languages to win) will not. This could be a really cool idea, but for it to work, it has to be able to appeal to a lot of people.&lt;br&gt;&lt;br&gt;&#xA;If anyone has an idea on how this could be better, please feel free to suggest or edit.&lt;/p&gt;&#xA;" OwnerUserId="38891" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-04-15T17:35:18.953" CommentCount="0" CommunityOwnedDate="2015-04-15T17:35:18.953" ContentLicense="CC BY-SA 3.0" />
  <row Id="5089" PostTypeId="1" CreationDate="2015-04-15T18:29:20.253" Score="4" ViewCount="93" Body="&lt;p&gt;I was looking through some contests when I found &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44278/debunking-stroustrups-debunking-of-the-myth-c-is-for-large-complicated-pro&quot;&gt;this one&lt;/a&gt;. There was a rather long discussion concerning using boost/asio in a web parsing contest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The post was meant to debunk a long (by golf standards) piece of code in C++. However, the example code could not be posted as an answer, as the example itself used boost/asio and the contest stated no third party libraries could be used.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should libraries that are considered to be standard by the community, even if they aren't necessarily deemed standard by the language creators still be considered third-party? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should example code in posts have to be viable as an answer?&lt;/p&gt;&#xA;" OwnerUserId="34385" LastActivityDate="2015-04-15T18:29:20.253" Title="Standard library usage as a limiter, unclear example" Tags="|discussion|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5090" PostTypeId="2" ParentId="1213" CreationDate="2015-04-15T22:23:18.503" Score="2" Body="&lt;h2&gt;GolfScript&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;On Linux&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Install Ruby (almost certainly packaged with your distro) and then download the &lt;a href=&quot;http://www.golfscript.com/golfscript/golfscript.rb&quot; rel=&quot;nofollow&quot;&gt;official interpreter&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;On Windows&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I've successfully used &lt;a href=&quot;http://ironruby.net/&quot; rel=&quot;nofollow&quot;&gt;IronRuby&lt;/a&gt; to run a &lt;a href=&quot;http://www.cheddarmonk.org/golfscriptblog/2013/06/golfscript-and-ironruby.html&quot; rel=&quot;nofollow&quot;&gt;tweaked version&lt;/a&gt; of the interpreter. Patch:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;--- golfscript.rb.orig&#xA;+++ golfscript.rb&#xA;@@ -272,7 +272,8 @@&#xA;                factory(to_s.inspect)&#xA;        end&#xA;        def to_s&#xA;-               @val.pack('C*')&#xA;+               # Workaround for IronRuby bug, thanks to w0lf&#xA;+               ''+@val.pack('C*')&#xA;        end&#xA;        def class_id; 2; end&#xA;        def coerce(b)&#xA;@@ -389,8 +390,16 @@&#xA;        end&#xA;        include Comparable&#xA; end&#xA;-code=gets(nil)||''&#xA;-$_=$stdin.isatty ? '' : $stdin.read&#xA;    +&#xA;    +# IronRuby's implementation of gets is buggy&#xA;    +code=File.read(ARGV[0])&#xA;    +&#xA;    +# PowerShell's handling of stdin will drive you nuts&#xA;    +$_=''&#xA;+if (ARGV[1])&#xA;+       $_=File.read(ARGV[1])&#xA;    +end&#xA;    +&#xA;     $stack = [Gstring.new($_)]&#xA;     $var_lookup={}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that the tweaks include taking input from a second file provided as an argument instead of from stdin, because I found that easier. I also set up an alias in my PowerShell profile:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function golfscript {&#xA;    &amp;amp;&quot;c:\Program Files (x86)\IronRuby 1.1\bin\ir64.exe&quot; d:\stuff\golfscript.rb $args&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="194" LastActivityDate="2015-04-15T22:23:18.503" CommentCount="0" CommunityOwnedDate="2016-08-21T03:11:45.147" ContentLicense="CC BY-SA 3.0" />
  <row Id="5091" PostTypeId="1" CreationDate="2015-04-16T03:01:06.787" Score="2" ViewCount="150" Body="&lt;p&gt;I am a little puzzled by the &lt;em&gt;apparent&lt;/em&gt; (user idents are gender opaque) lack of women participants in this site. Are there women participants? Do women feel excluded by the culture of this site? Are there perhaps women who participate but feel uncomfortable about identifying their gender? Our user demographic includes people from many countries and languages, yet 50% of the smart people in the world are under-represented.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Perhaps there is more we can do to invite and include women participants. Your thoughts?&lt;/p&gt;&#xA;" OwnerUserId="31785" LastEditorUserId="31785" LastEditDate="2015-04-16T07:35:02.643" LastActivityDate="2015-04-16T09:04:18.400" Title="Do we need to do more to welcome women participants?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5092" PostTypeId="2" ParentId="5091" CreationDate="2015-04-16T09:04:18.400" Score="14" Body="&lt;p&gt;I find this a bizarre question to ask. It admits that its base assumption is unjustified: we don't have the demographic data to support the claim in the last sentence of the first paragraph. The only people on this site to whom I could confidently attribute a gender are a handful who use a real name, two or three who use a photo for their avatar, and one who has discussed their sexual identity on chat.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The best argument to support the idea that women would make up significantly less than 50% of the participants in PPCG would be that PPCG draws from a mathmo/techie subculture which itself has a significant demographic skew. But it's fairly obvious that PPCG doesn't have the influence to make a non-negligible difference at that scale.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And on the flip side, if the assumption is true then this meta is the worst place to find solutions.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2015-04-16T09:04:18.400" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5093" PostTypeId="1" CreationDate="2015-04-16T14:52:22.973" Score="-8" ViewCount="239" Body="&lt;h1&gt;A Sandbox for custom programming languages&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This was adapted from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5088/38891&quot;&gt;this answer&lt;/a&gt;. I'm posting it here because it sounds like a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/feature-request&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I've noticed a lot of people have invented custom programming languages (ever heard of Pyth?) I've also noticed that people post challenges they think would be cool in the Sandbox. Here is my proposal: &lt;strong&gt;a Sandbox where you can post your custom languages and interpreters.&lt;/strong&gt;&lt;br&gt;&lt;br&gt;&#xA;You write a submission like this:&lt;/p&gt;&#xA;&lt;h1&gt;LANGUAGE NAME&lt;/h1&gt;&#xA;&lt;p&gt;Some syntax&lt;br&gt;&#xA;&lt;code&gt;3+3&lt;/code&gt;&lt;br&gt;&#xA;Adding!&lt;br&gt;&#xA;&lt;code&gt;l=3&lt;/code&gt;&lt;br&gt;&#xA;Variables!&lt;br&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Interpreter&lt;/h3&gt;&#xA;&lt;p&gt;&lt;code&gt;interpreter's code here&lt;/code&gt;&lt;br&gt;&lt;br&gt;&#xA;People then can use the language with credit (if allowed?), comment on it, etc.&lt;br&gt;&lt;br&gt;&#xA;Is this a good idea?&lt;/p&gt;&#xA;" OwnerUserId="38891" LastEditorUserId="68942" LastEditDate="2021-06-09T05:44:27.967" LastActivityDate="2021-06-09T05:44:27.967" Title="Proposal - Sandbox for custom programming languages" Tags="|feature-request|status-declined|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5094" PostTypeId="2" ParentId="5093" CreationDate="2015-04-16T14:57:28.860" Score="8" Body="&lt;p&gt;&lt;em&gt;In this post, I'm speaking as a user, not a moderator.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't really think this is on-topic here, and I'm also not sure how much use it would be anyway.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If this is about creating a repository of esoteric languages, there's no point in reproducing &lt;a href=&quot;http://esolangs.org/wiki/Main_Page&quot; rel=&quot;nofollow&quot;&gt;esolangs.org&lt;/a&gt; in a place and software that wasn't meant for it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If this is about increasing the popularity of golfing languages, I don't think a post on Meta PPCG will help much either. The best thing you can do for popularising your own language is simply to use it in the challenges on Main.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lastly, the interpreter's code doesn't really belong or fit into an answer here. Most of the language authors will have their language in some version control system, often hosted publicly (e.g. on GitHub or Sourceforge). That's also where the documentation belongs. Duplicating this information here on meta is, again, not where it belongs.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-04-16T14:57:28.860" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5097" PostTypeId="1" AcceptedAnswerId="5098" CreationDate="2015-04-17T15:11:38.733" Score="10" ViewCount="282" Body="&lt;p&gt;In the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;tag wiki&lt;/a&gt;, there are defaults for scoring if not specified (in bytes). Recently I have seen some questions what to do in case of a tie. My proposal is to make this a default in the tag wiki. The two things I have really seen specified as tie breakers in challenges are:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Earlier post wins (e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/48937/draw-a-random-ascii-art-quilt&quot;&gt;Draw a Random ASCII Art Quilt&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/48907/hodorize-a-string&quot;&gt;Hodorize a String&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;More Upvotes wins (e.g &lt;a href=&quot;https://codegolf.stackexchange.com/questions/48739/programming-tetris-blocks-literally&quot;&gt;Programming Tetris Blocks (Literally)&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerDisplayName="user34736" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2015-05-21T12:40:23.263" Title="Should there be defaults for tiebreakers in tag wikis?" Tags="|discussion|policy|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5098" PostTypeId="2" ParentId="5097" CreationDate="2015-04-17T15:28:25.853" Score="22" Body="&lt;p&gt;I don't think we need tag-specific defaults for this, but I would like to propose the following &lt;em&gt;global&lt;/em&gt; default:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If no tie-breakers are specified, or all specified tie-breakers are exhausted, the &lt;strong&gt;earliest answer wins&lt;/strong&gt;. When determining which answer was earlier, the timestamp of the first valid edit which gave the current score counts.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2015-04-17T15:56:45.933" LastActivityDate="2015-04-17T15:56:45.933" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5099" PostTypeId="1" AcceptedAnswerId="5100" CreationDate="2015-04-17T15:58:30.083" Score="9" ViewCount="244" Body="&lt;p&gt;A &lt;a href=&quot;https://codegolf.stackexchange.com/q/48952/3808&quot;&gt;code golf challenge entitled &quot;Counting to Potato&quot;&lt;/a&gt; was recently posted that has become somewhat controversial, as it could be taken as offensive to some people.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What should be done with this question? Should it be...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;deleted outright?&lt;/li&gt;&#xA;&lt;li&gt;edited to remove the controversial reference?&lt;/li&gt;&#xA;&lt;li&gt;left as is?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Additionally, what should the general policy be on similar, possibly offensive types of challenges?&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2015-04-17T16:05:21.893" Title="What should we do with the &quot;counting to potato&quot; challenge?" Tags="|discussion|specific-question|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5100" PostTypeId="2" ParentId="5099" CreationDate="2015-04-17T16:05:21.893" Score="14" Body="&lt;p&gt;In this case, I think we can simply edit out the reference. The challenge itself isn't offensive, and you could substitute any word for &lt;em&gt;POTATO&lt;/em&gt; without changing the task.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;General policy&quot; would follow suit IMO. If a simple edit can remove whatever's causing the offense, then just do it. If there's really no way to remove it, deletion might be a good option, but that should be decided on a case by case basis.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2015-04-17T16:05:21.893" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="5104" PostTypeId="2" ParentId="3616" CreationDate="2015-04-18T02:52:47.437" Score="4" Body="&lt;p&gt;Testing whether this works on Code Golf:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;soundcloud-embed&quot;&gt;&#xD;&#xA;            &lt;iframe src=&quot;https://w.soundcloud.com/player/?url=http://api.soundcloud.com/tracks/197512699?show_artwork=false&quot; width=&quot;640&quot; height=&quot;116&quot; scrolling=&quot;no&quot; frameborder=&quot;no&quot;&gt;&lt;/iframe&gt;&#xD;&#xA;            &lt;/div&gt;&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2015-04-18T02:52:47.437" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5106" PostTypeId="1" CreationDate="2015-04-18T14:02:33.573" Score="1" ViewCount="152" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/48917/two-zero-one-five-puzzle&quot;&gt;Two-zero-one-five puzzle&lt;/a&gt; was intended as a Kolmogorov-complexity code-golf challenge: the task is to generate and print arithmetic expressions for as many numbers between 0 and 100. Unfortunately, I'd overestimated the size of the output (and underestimated the size of a winning program), meaning that the best solution is probably to simply print a pre-calculated, compressed set of answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given that this was clearly not the intent of the problem, can anyone suggest a way to salvage the challenge without being unfair to anyone who started working on it in good faith?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some possibilities:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;change it from code golf to first solution (though then orlp has probably already won, with a solution similar to one i'd written beforehand)&lt;/li&gt;&#xA;&lt;li&gt;increase the number of solutions to be output (though orlp thinks that the most programs for solving this are likely to be too big to golf enjoyably) &lt;/li&gt;&#xA;&lt;li&gt;turn it into pure code golf with a minimum number of expressions (e.g. 75) allowing people to golf the program more aggressively similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/12063/four-fours-puzzle&quot;&gt;Four fours puzzle&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;do nothing and leave it as a compression challenge&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="34694" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-04-18T14:23:13.130" Title="Way of salvaging &quot;Two-zero-one-five puzzle&quot; challenge?" Tags="|discussion|specific-question|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5107" PostTypeId="2" ParentId="2140" CreationDate="2015-04-18T16:59:55.120" Score="2" Body="&lt;h1&gt;Roguelike to Text Adventure Converter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note&lt;/em&gt;: this challenge is a popularity contest for autogenerated interactive fiction. As such, the best way of judging answers is by playing them! It would threrefore be best for solutions to provide a link to a playable version online. Failing that a 'walkthrough'-style excerpt is fine, but not as fun.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Meta-comment&lt;/em&gt;: As you can see, I've changed this from a code golf challenge to a more creative popularity contest. Comments welcome!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Roguelike&quot; rel=&quot;nofollow noreferrer&quot;&gt;Roguelikes&lt;/a&gt; are a type of RPG characterized by by procedural level generation, turn-based gameplay, tile-based  graphics and permadeath. Levels typically consisted of rooms connected by corridors. Early roguelikes, including Rogue itself, would use ASCII characters to represent the top-down view of each level.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Interactive_fiction&quot; rel=&quot;nofollow noreferrer&quot;&gt;Text adventures&lt;/a&gt; are a type of adventure game where the interface is text-only: the player uses text input to control the game and the game state is relayed back via text output. Like roguelikes, layouts typically consisted of interconnected rooms, with movement controlled either by specifying the room name or by giving a compass direction.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge involves writing a program to automatically convert an ASCII representation of a roguelike level into a playable text adventure. The format of supported input levels is given below, as are some minimum features that must be supported by the output game. Beyond that, there is scope for as much or as little creativity you desire!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input maps&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input of the program is an ASCII representation of a roguelike level, passed in via STDIN, command-line argument, function argument or in a file. Here is a small example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;        --------                &#xA;        |..=...+#######                                                                          &#xA;        |......|      #                                                                          &#xA;        --+-----    --+-------                                                                   &#xA;         ##         |...//...|                                                                   &#xA;       ###  ########+........|                                                                   &#xA; ------+----+-      -----+----                                                                   &#xA; |..%........|           #                                                                       &#xA; |......!....|   ---     #                                                                       &#xA; |..@........+###+.+######                                                                       &#xA; |...........|   ---                                                                            &#xA; -------------                                                                                   &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A level consists of the following elements:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Rooms&lt;/strong&gt;: these are size 1x1 or greater rectangular enclosures surrounded by walls and doors. The north and south walls are represented by &lt;code&gt;-&lt;/code&gt;, as are the corners. The west and east walls are represented by &lt;code&gt;|&lt;/code&gt;. Doors, which can appear instead of a wall (but not in a corner) are represented by &lt;code&gt;+&lt;/code&gt;. The map above has four rooms.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Corridors&lt;/strong&gt;: these are connected (and potentially winding) paths of &lt;code&gt;#&lt;/code&gt;s leading from a door in one room to a door in another. The 'direction' of a corridor is defined by which walls it connects to. A corridor that links the north wall of one room to the south wall of another is going N-S, while one that links a north wall to a east wall is going NW-SE. Each room has at least one corridor leading out of it and at most one corridor per compass direction. Corridors that don't correspond to a valid direction (e.g. linking a north wall to a north wall) aren't permitted. Note that the relative layout of the rooms is irrelevant, only which walls the corridors connect to. The bottom-left room in the map above has three corridors: one going N-S, one NE-SW and one E-W.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Room content&lt;/strong&gt;: empty spaces inside rooms are represented by &lt;code&gt;.&lt;/code&gt;, while initial room objects are represented by &lt;code&gt;!&lt;/code&gt;, &lt;code&gt;%&lt;/code&gt;, &lt;code&gt;/&lt;/code&gt; and &lt;code&gt;=&lt;/code&gt;. These traditionallty correspond to &lt;em&gt;potions&lt;/em&gt;, &lt;em&gt;food&lt;/em&gt;, &lt;em&gt;wands&lt;/em&gt; and &lt;em&gt;rings&lt;/em&gt;, but may be called anything you want in your version. There may be multiple objects starting in one room, including of the same type. In the map above, the bottom-left room contains one potion and one food, while the top-right room contains two wands. Note that your program may implement other types of object beyond the ones that appear in the starting map (for example, the contents of a chest).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Starting position&lt;/strong&gt;: one of the spaces in one of the rooms, represented by &lt;code&gt;@&lt;/code&gt;, is the starting position of the playing character. In the map above, this is in the bottom-left room.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Void&lt;/strong&gt;: the space between rooms, represented by spaces, is not part of the playing area.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output games&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The output of the program is an interactive game, taking input from STDIN and printing output on STDOUT, that is based on the input map. At the very least, the game should support the following commands:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;code&gt;LOOK&lt;/code&gt;&lt;/strong&gt; (also executed whenever a player enters a room and at the start of the game). At the very least this should describe the directions of the doors and the content of the room, though it can do more. For example: &quot;You are in a small room. You can go N, NW or W. The room contains 2 potions and no tea.&quot;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;code&gt;N/NW/W/SW/S/SE/E/NE&lt;/code&gt;&lt;/strong&gt;. Moves to the appropriate room if possible (and outputs its description as above). Should indicate an error if there is no path in that direction.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;code&gt;INV&lt;/code&gt;&lt;/strong&gt;. At the very least this should describe which objects the player is carrying. The player may optionally start with objects. For example: &quot;You are carrying a ring, a potion and a used handkerchief.&quot;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;code&gt;GET [object]&lt;/code&gt;&lt;/strong&gt;. Picks up one instance of the object from the room outputs some confirmation. Indicates an error if there isn't such an object in the room (or there is some sensible reason why the player can't pick the object up).&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;code&gt;DROP [object]&lt;/code&gt;&lt;/strong&gt;. Drops one instance of the object into the room and outputs some confirmation. Indicates an error if the player doesn't have the object (or there is some sensible reason why they can't drop it). There is no requirement to have a limit on the number of objects in a room (as there would be in the roguelike original).&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;code&gt;USE [object]&lt;/code&gt;&lt;/strong&gt;. Uses one instance of the object, possibly consuming it. The effect of using objects is entirely up to the solver!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Case-sensitivity is up to the solver, as is the grammatical correctness of the output. You may include aliases for the above commands if you wish.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note that the game is allowed (and encouraged!) to support other commands, as well as other types of game elements (for example, creatures that move from room to room). The game need not have a well-defined ending, though it is welcome to. The setting need not be typical for a roguelike, either: a library, spaceship or ant colony are just as valid settings as a dungeon. Be creative!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here is a sample output from a hypothetical game based on the small map above (actual programs should use the larger map provided below). As mentioned above, it would be best if you could supply an interactive link so users can actually try out the game for real!&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;You are in a large, white room. You can go N, NE or E. The room contains a potion and a snack.&#xA;&amp;gt; INV&#xA;You are carrying nothing.&#xA;&amp;gt; GET potion&#xA;OK.&#xA;&amp;gt; INV&#xA;You are carrying a potion.&#xA;&amp;gt; N&#xA;You are in a medium-sized, green room. You can go SE or S. The room contains a ring.&#xA;&amp;gt; DROP potion&#xA;OK.&#xA;&amp;gt; LOOK&#xA;You are in a medium-sized, green room. You can go SE or S. The room contains a ring and a potion.&#xA;&amp;gt; DROP potion&#xA;You don't have a potion!&#xA;&amp;gt; GET potion&#xA;OK.&#xA;&amp;gt; USE potion&#xA;Zap! Your surroundings become a blur...&#xA;You are in a large, white room. You can go N, NE or E. The room contains a snack.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a popularity contest, so highest vote tally wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Large map&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here is a larger map for use as the default for your online script (or for any walkthrough).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;TODO: add larger map.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="34694" LastEditorUserId="34694" LastEditDate="2015-04-21T18:28:27.237" LastActivityDate="2015-04-21T18:28:27.237" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5108" PostTypeId="1" CreationDate="2015-04-19T14:06:21.600" Score="3" ViewCount="160" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/49002/write-an-antiquine&quot;&gt;This question&lt;/a&gt; clearly has problems, as highlighted in the comments, but seems to be an interesting idea. Maybe we could have some suggestions on ways to improve it so the idea isn't lost?&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-04-21T23:54:59.507" Title="Preserving Antiquine for Antiquity" Tags="|discussion|specific-question|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5109" PostTypeId="2" ParentId="2140" CreationDate="2015-04-19T17:10:09.477" Score="0" Body="&lt;h1&gt;Randomly generated &quot;Bézier petals&quot;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A &quot;bézier petal&quot; is a:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.mathwords.com/s/simple_closed_curve.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;simple closed curve&lt;/a&gt; (no loops or self-intersection)&lt;/li&gt;&#xA;&lt;li&gt;made by two cubic Bézier curves which &#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;share endpoints&lt;/li&gt;&#xA;&lt;li&gt;but not necessarily control points&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The challenge is to &lt;strong&gt;generate these randomly&lt;/strong&gt;, such that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the entire space of possible valid curves is covered,&lt;/li&gt;&#xA;&lt;li&gt;any specific valid curve is as likely as any other,&lt;/li&gt;&#xA;&lt;li&gt;no &quot;degenerate&quot; (non-simple) petals are output.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I've been thinking about this for a while (see &lt;a href=&quot;https://www.youtube.com/watch?v=TJdApKcAVD0&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.youtube.com/watch?v=TJdApKcAVD0&lt;/a&gt;), but was only able to arrive at a &lt;a href=&quot;https://math.stackexchange.com/questions/20321/how-can-i-tell-when-two-cubic-b%C3%A9zier-curves-intersect&quot;&gt;partial solution&lt;/a&gt;, which only covers a &quot;safe&quot; subset of possibilities (it never generates crescent or s-shapes). But, having followed this site for a while, I know that many of you are &lt;em&gt;way&lt;/em&gt; more clever than I am.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The result should be a function which returns a single random petal, defined by two endpoints and two sets of two control points (six values in all) on a Cartesian plane — let's say with values between -1 and 1.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Ideally, the algorithm works in constant time, or at least has a bounded stop; generating and filtering out degenerate petals until a good one is found is acceptable but a step down.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Entries which do not cover the entire possible space but do so with low complexity and at least beat out my &quot;sort radially around center&quot; &lt;a href=&quot;https://math.stackexchange.com/questions/20321/how-can-i-tell-when-two-cubic-b%C3%A9zier-curves-intersect&quot;&gt;approach&lt;/a&gt; are partial credit.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;I'll add some illustrations for valid and invalid petals, once I draw them.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="21223" LastEditorUserId="-1" LastEditDate="2017-04-13T12:19:20.950" LastActivityDate="2015-04-19T17:10:09.477" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5112" PostTypeId="2" ParentId="2140" CreationDate="2015-04-20T16:08:51.787" Score="0" Body="&lt;p&gt;&lt;strong&gt;IRC reader&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Internet Relay Chat (or IRC for short) is a simple yet popular chat communication method. The challenge is to create a program that can take an IRC server from program arguments and print out new messages sent on that server.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;e.g.: &lt;code&gt;&amp;lt;your_irc_client&amp;gt; irc.freenode.net&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A very simple implementation in Python of this idea which does not print responses to the user can be found &lt;a href=&quot;http://archive.oreilly.com/pub/h/1968&quot; rel=&quot;nofollow&quot;&gt;here&lt;/a&gt; &lt;/p&gt;&#xA;" OwnerUserId="32231" LastActivityDate="2015-04-20T16:08:51.787" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5113" PostTypeId="2" ParentId="2140" CreationDate="2015-04-20T18:03:57.730" Score="0" Body="&lt;h1&gt;Interpret a Turing-Complete Language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;This challenge is inspired by &lt;a href=&quot;https://esolangs.org/wiki/Golf&quot; rel=&quot;nofollow noreferrer&quot;&gt;this esolangs.org page&lt;/a&gt;, which lists some languages with very small interpreters.  There have been some similar challenges before, like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/585/self-interpreting-interpreter&quot;&gt;this one about a self-interpreter&lt;/a&gt;, or a few other interpreter challenges, like one for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/84/interpret-brainfuck?s=1|1.4268&quot;&gt;BF&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This goal of this challenge is to write the smallest interpreter possible for a Turing-complete language.  You may choose &lt;em&gt;any&lt;/em&gt; Turing complete language (even one you create?) to interpret.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your interpreter should take input representing the program to be executed, and give output representing the end result of the program.  &quot;Interactive&quot; I/O is not required.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;More Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your interpreter program may not contain/execute any &lt;code&gt;eval&lt;/code&gt;-like commands.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.653" LastActivityDate="2015-04-20T18:03:57.730" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5115" PostTypeId="1" CreationDate="2015-04-21T02:52:53.133" Score="11" ViewCount="231" Body="&lt;p&gt;This has now happened three times in recent history:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/48917/two-zero-one-five-puzzle&quot;&gt;Two-zero-one-five puzzle&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/49061/stringing-a-pearl-necklace&quot;&gt;Stringing a Pearl Necklace&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/48236/how-do-i-get-more-klotski-in-my-life&quot;&gt;How do I get more Klotski in my life?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;All questions have technically correct and unambiguous win conditions. However I strongly believe that their way of scoring is &lt;strong&gt;anti-fun&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;In all of them it's because the question involves two challenges:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Solving the problem.&lt;/li&gt;&#xA;&lt;li&gt;Golfing your solution.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Actually solving the problem is &lt;strong&gt;hard in of itself, and fun&lt;/strong&gt;. Because solving the problem is hard, the code to solve the problem is going to be &lt;strong&gt;big&lt;/strong&gt;. Then having to golf that big code is &lt;strong&gt;not fun&lt;/strong&gt;. The amount of work and juggling of parts required to optimally golf a piece of code exponentially increases.&lt;/p&gt;&#xA;&lt;p&gt;However, the scoring requirements &lt;strong&gt;only&lt;/strong&gt; rewards the non-fun part, and you effort in actually solving the problem goes totally unrewarded.&lt;/p&gt;&#xA;&lt;p&gt;For me this means that for these questions I lose interest after actually solving the problem, so I just post my huge ungolfed solution, or not post my solution at all if there's a shorter one. I'm sure I'm not the only one feeling this way.&lt;/p&gt;&#xA;&lt;h3&gt;Because actually solving the problem is so hard, the scoring feels arbitrary, and optimizing your answer for the best score is anti-fun.&lt;/h3&gt;&#xA;" OwnerUserId="4162" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-04-22T15:40:23.403" Title="What should we do with challenges with unfortunate win conditions?" Tags="|discussion|winning-criteria|" AnswerCount="1" CommentCount="7" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5116" PostTypeId="2" ParentId="2140" CreationDate="2015-04-21T12:29:25.350" Score="4" Body="&lt;h1&gt;Flit - a simple board game for bots&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I've made a &lt;a href=&quot;https://trichoplax.github.io/flit/&quot; rel=&quot;nofollow noreferrer&quot;&gt;human playable version of this game&lt;/a&gt; with a simple strategy to give an idea of how the game plays out. You can play it before or after reading the rules here - picking up the rules intuitively adds an extra challenge...&lt;/p&gt;&#xA;&lt;p&gt;If playing this gives any idea about whether the KotH version would be better with 2, 4, or more players per game, or any other subtle adjustments that would help, please let me know.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Note: adjacency is vertical or horizontal - for this game there are no diagonal neighbours.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Overview&lt;/h2&gt;&#xA;&lt;p&gt;The board is a square grid. Each bot starts with 2 pieces of their colour, and gains more pieces by converting neutral pieces that appear from time to time. The objective is to end up with more pieces than your opponents.&lt;/p&gt;&#xA;&lt;p&gt;Each turn, one bot moves. It chooses one of its pieces and moves it to be next to another of its pieces. There is no limit to the distance a piece can move in a single step, provided it lands next to a piece of the same colour.&lt;/p&gt;&#xA;&lt;h3&gt;Neutral pieces&lt;/h3&gt;&#xA;&lt;p&gt;There are initially zero neutral pieces.&lt;/p&gt;&#xA;&lt;p&gt;A new neutral piece can appear at any time, regardless of whether there are already neutral pieces unconverted. A neutral piece will only appear on an empty square that has 4 empty neighbours, to prevent it being instantly converted.&lt;/p&gt;&#xA;&lt;p&gt;If a neutral piece is adjacent to another piece, it is converted - it becomes the colour of that piece. A neutral piece can only ever be adjacent to a single other piece - it will be instantly converted before any other bot has a chance to move next to it.&lt;/p&gt;&#xA;&lt;h3&gt;Moving&lt;/h3&gt;&#xA;&lt;p&gt;A move is specified by an origin square and a destination square. It is a valid move if the origin square contains a piece of the bot's colour, and the destination square is empty and is adjacent to at least one piece of the bot's colour. Note that the piece being moved cannot also be the piece adjacent to the destination square (a piece cannot simply move next to its own previous position). Two distinct pieces are required - one to be moved, and one to be adjacent to the destination.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;[Not moving is a valid move, and is indicated by specifying the same coordinates for origin square and destination square. &lt;em&gt;not sure about this rule&lt;/em&gt;]&lt;/strong&gt; Not supplying a move within the time limit also results in not moving, but repeatedly exceeding the time limit will lead to the bot losing the opportunity to make further moves.&lt;/p&gt;&#xA;&lt;h3&gt;Communication&lt;/h3&gt;&#xA;&lt;p&gt;The board information will not be supplied each turn. Instead the bot must keep track of the board state itself. Each time a change is made a message will be sent to all bots describing the change. If a bot chooses not to move, the non-move will not be broadcast.&lt;/p&gt;&#xA;&lt;p&gt;The board starts empty. The initial two pieces for each bot will be broadcast to all bots, then the first bot will be sent a request for a move, to which it must respond within the time limit. Any response sent after the time limit expires will be discarded (any waiting input will be read and discarded before the next request for a move is sent to that bot).&lt;/p&gt;&#xA;&lt;p&gt;Bots will therefore have complete information about the board state at all times.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Specification&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Available&lt;/strong&gt;: An &lt;strong&gt;available&lt;/strong&gt; square is an empty square that has 4 empty neighbours&lt;/p&gt;&#xA;&lt;h3&gt;Players&lt;/h3&gt;&#xA;&lt;p&gt;There are 4 bots competing in each game. Bots are numbered 1 to 4 and take turns in that fixed order.&lt;/p&gt;&#xA;&lt;h3&gt;Board&lt;/h3&gt;&#xA;&lt;p&gt;The board is a 32 by 32 square grid. It wraps toroidally - every square has 4 neighbours. The board has no boundaries - no edges or corners to give an advantage.&lt;/p&gt;&#xA;&lt;h3&gt;Initial state&lt;/h3&gt;&#xA;&lt;p&gt;For each bot, one piece will be placed on a square chosen uniformly from the &lt;strong&gt;available&lt;/strong&gt; squares. After all first&#xA;pieces have been placed, a second piece will be placed for each bot in&#xA;the same way. The initial state contains no neutral pieces.&lt;/p&gt;&#xA;&lt;h3&gt;Addition of neutral pieces&lt;/h3&gt;&#xA;&lt;p&gt;Each turn one bot will move. After that move has been made, the addition of a new neutral piece will be considered. A square will be selected at random. If that square is &lt;strong&gt;available&lt;/strong&gt; then a neutral piece will be placed on it with probability 1/16. If the square is unavailable then play continues - a second square will not be selected. &lt;strong&gt;[This differs from the human playable version linked above: there a list is kept of all available squares and a neutral piece is placed on one of those with probability 1/6 each turn - I now prefer this approach so the rate of new neutral pieces does not slow in the end game]&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Bot STDIN&lt;/h3&gt;&#xA;&lt;p&gt;All received messages will be terminated by a newline.&#xA;Each bot will receive messages of two types: an update or a move request&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Update:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;x y c&lt;/p&gt;&#xA;&lt;p&gt;where (x, y) is the square to be updated, and c is the new colour (which may be 0 for empty, 1, 2, 3 or 4 for a bot colour, or 5 for neutral).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Move request:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;M&lt;/p&gt;&#xA;&lt;p&gt;where M is the literal string &amp;quot;M&amp;quot; and indicates that a move is required.&lt;/p&gt;&#xA;&lt;h3&gt;Bot STDOUT&lt;/h3&gt;&#xA;&lt;p&gt;The response must be terminated by a newline.&#xA;A bot responds with a move in the following format:&lt;/p&gt;&#xA;&lt;p&gt;x0 y0 x1 y1&lt;/p&gt;&#xA;&lt;p&gt;where (x0, y0) is the origin square, and (x1, y1) is the destination square.&lt;/p&gt;&#xA;&lt;p&gt;If origin and destination are identical, no move will be made. This is valid and does not lead to the bot being penalised. The bot will only be penalised if it fails to respond within the time limit.&lt;/p&gt;&#xA;&lt;h3&gt;Time limit&lt;/h3&gt;&#xA;&lt;p&gt;The time limit is 50ms. If a bot exceeds the time limit on 5 consecutive turns then it will no longer be prompted for moves. That bot will be frozen for the rest of the game.&lt;/p&gt;&#xA;&lt;h3&gt;Winning criterion&lt;/h3&gt;&#xA;&lt;p&gt;The winner is the bot with the most pieces when the game ends. There is no reward for second place. If two bots tie for first place, neither is rewarded.&lt;/p&gt;&#xA;&lt;p&gt;The game ends when one of the following conditions is met:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the total number of turns taken exceeds 32,768 (8,192 per bot)&lt;/li&gt;&#xA;&lt;li&gt;all 4 bots choose not to move consecutively&lt;/li&gt;&#xA;&lt;li&gt;one bot has too many pieces to catch up with&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Too many pieces to catch up with is defined as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A, B and C are the numbers of pieces of the other 3 bots.&lt;/li&gt;&#xA;&lt;li&gt;D is the number of pieces of the bot in question.&lt;/li&gt;&#xA;&lt;li&gt;N is the number of neutral pieces.&lt;/li&gt;&#xA;&lt;li&gt;E is the number of empty squares.&lt;/li&gt;&#xA;&lt;li&gt;P is the number of potential neutral pieces. P = N + E - 4&lt;/li&gt;&#xA;&lt;li&gt;M is the maximum number of pieces attainable by A, B or C.&lt;/li&gt;&#xA;&lt;li&gt;M = Max(A+P, B+P, C+P)&lt;/li&gt;&#xA;&lt;li&gt;If D &amp;gt; M then the bot has too many pieces to catch up with.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I've tried to make this game as simple as possible, while still having non-trivial dynamics.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-14T16:37:09.153" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5117" PostTypeId="2" ParentId="3578" CreationDate="2015-04-21T12:42:51.030" Score="-1" Body="&lt;h1&gt;Four player Raspberry Pi KotH&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;I'm imagining the challenge being a KotH question, and collectively working on the controller that will be required to make it possible to post that question. Then anyone who wants to run a different raspberry pi KotH in future can start from the same controller.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Four &lt;a href=&quot;https://www.raspberrypi.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Raspberry Pi&lt;/a&gt; computers are available at the home of the question poster*.&lt;/li&gt;&#xA;&lt;li&gt;Let's call an answer to the KotH question a &lt;em&gt;bot&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Four bots compete in each round of the competition.&lt;/li&gt;&#xA;&lt;li&gt;Each bot plays from a different raspberry pi, sending moves to the host computer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This means each bot can continue running in between turns without having to share resources with the other bots. A bot that wants to use up all of the available memory and CPU time during another bot's move won't crash other bots or the controller. A bot that doesn't provide a move in time simply doesn't move (or repeatedly non-responsive bots can be killed off as in other KotHs, depending on the game).&lt;/p&gt;&#xA;&lt;p&gt;The specific game that we choose for the first RP-KotH doesn't really matter. I have a simple &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5116/20283&quot; title=&quot;Flit&quot;&gt;board game/pixel war concept&lt;/a&gt; that I'm working on in the sandbox which might be suitable.&lt;/p&gt;&#xA;&lt;h3&gt;Automation&lt;/h3&gt;&#xA;&lt;p&gt;Ideally the controller would be able to reset the raspberry pis to an initial state, and then select the next four bots to compete and send one to each raspberry pi and start the round. This way each round does not need to be manually set up and a whole tournament can be run by the controller. This may involve preloading each raspberry pi with a mini-controller and a copy of all the bots, so a signal from the main controller tells the mini controller which of the saved bots to run.&lt;/p&gt;&#xA;&lt;p&gt;Since a raspberry pi runs from an SD card, a memory image with all the required bots and mini controller could be generated and simply written to as many SD cards as necessary.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;em&gt;*The question can be posted and hosted by someone who happens to have four raspberry pis, or I can buy them and post the question myself. I currently have one pi which can be used for testing, and if this suggestion is selected I am happy to buy more.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-04-21T15:21:57.720" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5119" PostTypeId="2" ParentId="2098" CreationDate="2015-04-21T23:01:09.540" Score="1" Body="&lt;p&gt;This is the first draft of a major edit to make this page more self-contained.  My vision for the &quot;On Topic&quot; page is that visitors can read this page and leave with a pretty good idea of what we do here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some main additions: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Short summaries of the different types of challenges on the site, with links to several more tag wikis.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;lorem ipsum dolor sit amet&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Programming Puzzles &amp;amp; Code Golf&lt;/em&gt; is for programming contests and challenges. We welcome questions from beginners and experts alike.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All &lt;strong&gt;challenge questions&lt;/strong&gt; on this site should have:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A &lt;strong&gt;clear specification&lt;/strong&gt; of what constitutes a correct submission, so that it is possible to indisputably decide whether an entry is valid or not. Test cases are highly encouraged.&lt;/li&gt;&#xA;&lt;li&gt;An &lt;strong&gt;objective primary winning criterion&lt;/strong&gt;, so that it is possible to  indisputably decide which entry should win.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;These questions are surprisingly hard to write well. It is advisable to follow a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1511/194&quot;&gt;standard template&lt;/a&gt; and to post them first and get feedback in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/881&quot;&gt;meta Sandbox&lt;/a&gt; so that flaws can be fixed before someone posts an answer which exploits them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All &lt;strong&gt;solutions&lt;/strong&gt; to challenges should:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Correctly implement the required specification.&lt;/li&gt;&#xA;&lt;li&gt;Make a clear effort towards the winning criteria in use. For example, an entry to a &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;code golf&lt;/a&gt; contest needs to be golfed, and an entry to a speed contest should make some attempt to be fast.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The majority of programming challenges can be grouped into several broad categories.  This is not an all-inclusive list of challenge types.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Code Golf&lt;/em&gt; is the most common challenge type.  The goal of code golf is to write short solutions for a given puzzle.  More information specific to code golf can be found in its &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;tag wiki&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Fastest-Code&lt;/em&gt; (&lt;a href=&quot;https://codegolf.stackexchange.com/tags/fastest-code/info&quot;&gt;tag wiki&lt;/a&gt;) is a type of challenge that involves writing fast programs to solve computationally-intensive tasks.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;King of the Hill&lt;/em&gt; competitions (&lt;a href=&quot;https://codegolf.stackexchange.com/tags/king-of-the-hill/info&quot;&gt;tag wiki&lt;/a&gt;) are those in which the contestant programs directly compete with each other in a game.&lt;/li&gt;&#xA;&lt;li&gt;A &lt;em&gt;Popularity Contest&lt;/em&gt; (&lt;a href=&quot;https://codegolf.stackexchange.com/tags/popularity-contest/info&quot;&gt;tag wiki&lt;/a&gt;) is one in which the winner is determined by voters.  Popularity contests must still meet quality standards.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Most other programming challenges are labelled as &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-challenge/info&quot;&gt;code challenge&lt;/a&gt; along with other tags. If you would like an in-depth description of a specific tag, simply click the &quot;learn more&quot; link on the tag's page to access the tag wiki.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Non-challenge questions that are are related to solving programming puzzles or a particular type of challenge can also be on-topic.  One type of non-challenge question are &lt;a href=&quot;https://codegolf.stackexchange.com/tags/tips/info&quot;&gt;tips&lt;/a&gt; about specific languages. If you have a general programming question, however, it should be asked on &lt;a href=&quot;http://stackoverflow.com&quot;&gt;Stack Overflow&lt;/a&gt; or a different &lt;a href=&quot;http://stackexchange.com/sites#technology-questions&quot;&gt;Stack Exchange site&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For more help, see &lt;a href=&quot;/help/dont-ask&quot;&gt;&quot;What types of questions should I avoid asking?&quot;&lt;/a&gt;. Please &lt;a href=&quot;/search&quot;&gt;look around&lt;/a&gt; to see if your question or challenge has been posted before. It’s also OK to &lt;a href=&quot;/helpcenter/self-answer&quot;&gt;participate in your own puzzles&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your question is not specifically on-topic for Programming Puzzles &amp;amp; Code Golf, it may be on topic for &lt;a href=&quot;http://stackexchange.com/sites&quot;&gt;another Stack Exchange site&lt;/a&gt;. If no site currently exists that will accept your question, you may &lt;a href=&quot;http://area51.stackexchange.com/faq&quot;&gt;commit to&lt;/a&gt; or &lt;a href=&quot;https://meta.stackexchange.com/questions/76974/how-can-i-propose-a-new-site&quot;&gt;propose&lt;/a&gt; a new site at &lt;a href=&quot;http://area51.stackexchange.com/&quot;&gt;Area 51&lt;/a&gt;, the place where new Stack Exchange communities are democratically created.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2015-04-21T23:01:09.540" CommentCount="0" CommunityOwnedDate="2015-04-21T23:01:09.540" ContentLicense="CC BY-SA 3.0" />
  <row Id="5120" PostTypeId="2" ParentId="5108" CreationDate="2015-04-21T23:30:37.953" Score="2" Body="&lt;p&gt;&lt;strong&gt;Remove the modified antiquine option&lt;/strong&gt;, as answers that are not a true antiquine will otherwise clutter and confuse things. All answers should output only valid programs, not just arbitrary strings of characters.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2015-04-21T23:54:59.507" LastActivityDate="2015-04-21T23:54:59.507" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5121" PostTypeId="2" ParentId="5108" CreationDate="2015-04-21T23:52:31.793" Score="2" Body="&lt;p&gt;&lt;strong&gt;Remove the requirement for a minimum length of 20 characters&lt;/strong&gt;. The requirement that there be at least 2 other valid programs of the same length is sufficient to close the loophole. A minimum length is not ideal for a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(Requiring at least 2 other valid programs imposes a minimum length of 1 character, but that seems reasonable...)&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2015-04-21T23:52:31.793" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5123" PostTypeId="2" ParentId="2140" CreationDate="2015-04-22T13:03:51.497" Score="3" Body="&lt;h1&gt;ASCII Robot Wars&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This idea is based off of the game &quot;Besiege&quot; (which I've never played) and a previous sandboxed idea of mine called &quot;Epic Customizable Tank Battle.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main idea is that your program is the AI that controls a robot equipped with various weapons.  In this challenge, however, you will also have the opportunity to &lt;em&gt;design&lt;/em&gt; your robot&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;List of Parts&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(completely arbitrary and subject to total replacement)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Wooden planks &lt;code&gt;+&lt;/code&gt; and armored metal plates &lt;code&gt;#&lt;/code&gt; make up the body of the robot.&lt;/li&gt;&#xA;&lt;li&gt;Wheels &lt;code&gt;@&lt;/code&gt; allow your robot to move.  TODO - turning&lt;/li&gt;&#xA;&lt;li&gt;Most weapons are formed with two parts, a body and a pointer &lt;code&gt;v^&amp;lt;&amp;gt;&lt;/code&gt; to denote the direction of aim.&lt;/li&gt;&#xA;&lt;li&gt;Cannons have a body of &lt;code&gt;%&lt;/code&gt;, ballistas have a body of (something), spikes and battering rams are (something).&lt;/li&gt;&#xA;&lt;li&gt;Maybe helicopter blades can be &lt;code&gt;X&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Banners, which serve no purpose but decoration, could be &lt;code&gt;$&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example 5x5 robot&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This robot has four wheels, three cannons facing forward, armored sides, and a flag in the middle.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;@^^^@&#xA;#%%%#&#xA;#+$+#&#xA;#+++#&#xA;@###@&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Controlling the Bot&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I think this would make a really cool Stack-Snippet KOTH, since it is &quot;visually interesting&quot; to watch robots blow each other into pieces.  Writing the controller will be hard because this is a major deviation from previous pixel-based KOTHs.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2015-04-22T13:03:51.497" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5124" PostTypeId="1" AcceptedAnswerId="5515" CreationDate="2015-04-22T13:37:48.530" Score="21" ViewCount="667" Body="&lt;p&gt;Recently, I had people go crazy with escape codes on &lt;a href=&quot;https://codegolf.stackexchange.com/q/49042/8478&quot;&gt;one of my ASCII art challenges&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/49071/8478&quot;&gt;This x86 machine code answer&lt;/a&gt; was able to save some bytes by throwing a few colour codes at the console. At some point along the way the OP even had a version which left the output &lt;a href=&quot;https://codegolf.stackexchange.com/questions/49042/telescopic-parentheses#comment115904_49042&quot;&gt;blinking&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Both the above, as well as &lt;a href=&quot;https://codegolf.stackexchange.com/a/49118/8478&quot;&gt;at least&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/49126/8478&quot;&gt;two other&lt;/a&gt; answers made use of escape codes to move the cursor vertically across the console, which greatly simplified the indentation logic.&lt;/li&gt;&#xA;&lt;li&gt;A similar situation (which didn't happen on this answer) is people using things like carriage return (0x0D) or backspace (0x08) to overwrite output in some challenges.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Of course, all of this relies on a certain console environment which interprets these control characters and escape codes the right way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should such solutions be allowed in general, i.e. are we only concerned with the rendered output?&lt;/li&gt;&#xA;&lt;li&gt;Or should the output be the exact byte stream specified in the challenge?&lt;/li&gt;&#xA;&lt;li&gt;What if the escape codes only work as intended in very specific environments?&lt;/li&gt;&#xA;&lt;li&gt;Is arbitrary colouring of the output allowed? (Provided fore- and background have different colours.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2015-07-02T21:54:01.500" Title="Are control characters and ANSI escape codes allowed in output?" Tags="|discussion|policy|answers|" AnswerCount="4" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5125" PostTypeId="2" ParentId="5115" CreationDate="2015-04-22T15:34:15.093" Score="3" Body="&lt;p&gt;Communicate your idea to the author via comment or chat ping. Modifying the criteria of a valid challenge against the author's will is not an option in my opinion. (If the challenge is invalid, then that is a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4664/18487&quot;&gt;totally different story&lt;/a&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the author rejects or ignores your idea, and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1876/18487&quot;&gt;if changing the scoring system would significantly change what constitutes an acceptable answer&lt;/a&gt;, then you can post your own challenge with the modified scoring criteria.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-04-22T15:40:23.403" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5126" PostTypeId="1" CreationDate="2015-04-22T15:46:44.263" Score="6" ViewCount="135" Body="&lt;p&gt;A language specific &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/strong&gt; contest is easier to host. A language agnostic contest is more inclusive and perhaps therefore more competitive, but can be more work to set up and host. A language specific KotH has become easier to set up since Calvin's Hobbies introduced a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/48353/red-vs-blue-pixel-team-battlebots&quot; title=&quot;Red vs Blue - Pixel Team Battlebots&quot;&gt;Stack Snippets King of the Hill contest&lt;/a&gt;, which does some of the hard work that previously had to be done manually by the question poster.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would it ever be acceptable to run a Stack Snippets KotH to judge interest and iron out loopholes, and then use that to decide whether to set up a full language agnostic version (which may allow for a wider range of strategies)? Would this always count as a duplicate?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it is only acceptable to do one or the other, then I may hold off and post a language agnostic KotH at some point in the future. If it's acceptable to do both then I'd like to try a Stack Snippets version first.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would it make a difference if the initial Stack Snippets version was on a smaller scale? For example, fewer players on a smaller playing arena?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;This is a general question to also guide others in future, but if it makes a difference, the specific KotH contest I have in mind is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5116/20283&quot; title=&quot;Flit - a board game for bots&quot;&gt;Flit&lt;/a&gt;, which is currently in the sandbox.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2015-04-22T17:09:28.937" Title="Language specific KotH to test the water before a language agnostic KotH" Tags="|discussion|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="5127" PostTypeId="2" ParentId="5126" CreationDate="2015-04-22T17:09:28.937" Score="5" Body="&lt;p&gt;Having written many KoTHs, I've found that getting people to answer to your KoTH is hard.  You have to get people interested AND make it easy to answer.  That's the fundamental reason why we like cross-language controllers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I'm becoming more and more convinced that the way to do it is actually how &lt;a href=&quot;https://codegolf.stackexchange.com/questions/25347/survival-game-create-your-wolf/25375#25375&quot;&gt;Create your own Wolf&lt;/a&gt; did it.  Basically, you initially make it limited to a single language.  If it does get popular, then you can write a wrapper that will enable other languages to participate as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This has several advantages:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You don't have to create multiple questions (and have people answer with the same answer)&lt;/li&gt;&#xA;&lt;li&gt;Your KoTH will actually run faster as the submissions in the original language won't have to go through STDIO to communicate.&lt;/li&gt;&#xA;&lt;li&gt;It provides an easy way for people unfamiliar with STDIO communication to participate (as there are always some quirks with piping, such as needing to flush in Python)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2015-04-22T17:09:28.937" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5128" PostTypeId="2" ParentId="5124" CreationDate="2015-04-22T20:20:09.520" Score="5" Body="&lt;p&gt;Yes, programs must be run by echoing output to a console supporting ANSI escape codes if the answer requires it.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastActivityDate="2015-04-22T20:20:09.520" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5129" PostTypeId="2" ParentId="5124" CreationDate="2015-04-22T20:21:45.653" Score="1" Body="&lt;p&gt;No, output must be an exact bytestream using the specification of the challenge, unless mentioned otherwise.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastActivityDate="2015-04-22T20:21:45.653" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5130" PostTypeId="2" ParentId="5124" CreationDate="2015-04-22T20:24:42.207" Score="-2" Body="&lt;p&gt;Yes, if you add the amount of bytes to invoke the shell and run the program to the byte count.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answers should then be marked with the shell as the language, for example &quot;bash/X86&quot;.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastActivityDate="2015-04-22T20:24:42.207" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5132" PostTypeId="2" ParentId="2140" CreationDate="2015-04-22T21:07:35.180" Score="0" Body="&lt;h1&gt;Number of ways to sum [1..n] with [n+1..2n] such that each sum is prime&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In as few bytes as possible, write a program or function which produces this sequence (&lt;a href=&quot;https://oeis.org/A070897&quot; rel=&quot;nofollow noreferrer&quot;&gt;A070897&lt;/a&gt;), either as an infinite list on STDOUT, or in your interpreter of choice.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;a(5)=2&lt;/code&gt; because there are two ways: &lt;code&gt;1+10,2+9,3+8,4+7,5+6&lt;/code&gt; and &lt;code&gt;1+6,2+9,3+10,4+7,5+8&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;No built-in primality tests. No lookup table ;). No standard loopholes.&lt;/p&gt;&#xA;" OwnerUserId="19039" LastEditorUserId="29577" LastEditDate="2015-04-22T21:17:23.553" LastActivityDate="2015-04-22T21:17:23.553" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5133" PostTypeId="2" ParentId="2140" CreationDate="2015-04-23T04:16:52.627" Score="0" Body="&lt;h1&gt;Rabbit in a Snow Storm&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scenario&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A group member is giving a presentation in PowerPoint. He reaches a point where he wants to start writing on the whiteboard, but his slides have text that get in the way. He motions to the guy with the keyboard to just blank the screen so he can write. The next 2 minutes consist of everyone in the room bickering about how to do it until we arrive on using a full-screen-ish terminal (which is black, so we have to turn up the lights). Awful.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Have the primary monitor become completely white.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You start with no programs running (or at least none that are important towards the goal)&lt;/li&gt;&#xA;&lt;li&gt;You may only use programs that are installed by default on your OS/distro (i.e. needs to be repeatable by someone else without installing anything in particular)&lt;/li&gt;&#xA;&lt;li&gt;You can't pre-load your background, slide-show, etc. with a pure-white image (though you could create the image then show it)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Number of keystrokes required (keys depressed and released, i.e. opening Spotlight takes two (&lt;kbd&gt;Command&lt;/kbd&gt; + &lt;kbd&gt;Space&lt;/kbd&gt;), likewise Run... (&lt;kbd&gt;Win&lt;/kbd&gt; + &lt;kbd&gt;R&lt;/kbd&gt;))&lt;/li&gt;&#xA;&lt;li&gt;Clicks are scored as 5 keystrokes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="176" LastEditorUserId="176" LastEditDate="2015-04-23T04:24:37.940" LastActivityDate="2015-04-23T04:24:37.940" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5134" PostTypeId="1" CreationDate="2015-04-23T21:02:57.040" Score="33" ViewCount="775" Body="&lt;p&gt;Until now &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; has been limited to big problems - problems that take seconds if not minutes. This was simply needed to choose a winner fairly despite measurement errors. Often these challenges were decided on asymptotic behavior alone. I felt that this left one particular aspect very much neglected: micro-optimization.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For this reason I created the &lt;a href=&quot;https://github.com/orlp/golf-cpu&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;GOLF&lt;/em&gt;&lt;/a&gt;. The &lt;em&gt;GOLF&lt;/em&gt; is a toy CPU with a simple instruction set that is easy to learn and to program in. The exact specification of the &lt;em&gt;GOLF&lt;/em&gt; &lt;a href=&quot;https://github.com/orlp/golf-cpu/blob/master/specification.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;can be found on Github&lt;/a&gt;. Each instruction on the &lt;em&gt;GOLF&lt;/em&gt; takes a fixed amount of clock cycles.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The advantage of this toy CPU is that we can write programs in &lt;em&gt;GOLF&lt;/em&gt; assembly, compile them, and run them in a &lt;em&gt;GOLF&lt;/em&gt; virtual machine. &lt;strong&gt;After the program is done we can get the exact number of cycles that the program ran for.&lt;/strong&gt; This allows for exact scoring of submissions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am working on a couple of challenges that use the &lt;em&gt;GOLF&lt;/em&gt; for submission scoring (under the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/golf-cpu&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;golf-cpu&amp;#39;&quot; rel=&quot;tag&quot;&gt;golf-cpu&lt;/a&gt; tag), and I invite others to do so too.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;If you have any questions or suggestions about &lt;em&gt;GOLF&lt;/em&gt;, please post here. If you've found a bug in the reference &lt;em&gt;GOLF&lt;/em&gt; implementation, please post it on the &lt;a href=&quot;https://github.com/orlp/golf-cpu/issues&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github issue tracker&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastActivityDate="2021-06-02T21:53:26.480" Title="The GOLF CPU framework" Tags="|discussion|" AnswerCount="3" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="5139" PostTypeId="1" CreationDate="2015-04-24T15:49:29.263" Score="63" ViewCount="3317" Body="&lt;p&gt;I've been using a stack snippet for a while to generate leaderboards for my simpler or more popular code golf challenges. I want to share the code for this snippet here so others can use it more easily as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Feel free to put feature requests and bug reports in answers, or let me know &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;in chat&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm providing both the minified code (for use in your challenges) and the unminified code (for reviewing/improving the code). Both snippets in this post point to &lt;a href=&quot;https://codegolf.stackexchange.com/q/47338/8478&quot;&gt;Shotgun Numbers&lt;/a&gt;. At the bottom you'll also find the blurb I put in my challenges to explain the header formatting.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Features and Usage&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Shows two leaderboards: one overall leaderboard listing users with their languages by score; and a list of languages used with the best score (and user) per language. The latter is sorted by languages, not by scores (because the language ranking by scores can be read off the main leaderboard).&lt;/li&gt;&#xA;&lt;li&gt;Correctly handles ties in the main leaderboard (listing, e.g. 1. 2. 2. 4. ...).&lt;/li&gt;&#xA;&lt;li&gt;It takes the &lt;em&gt;last&lt;/em&gt; number that is not struck out as the score. This allows keeping previous scores in the header (anywhere) as well as presenting partial scores like &lt;code&gt;Python 2, 34 + 71 = 105&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Links for language names are allowed and show up in the leaderboard. For the by-language leaderboard, HTML is stripped when comparing languages for equality.&lt;/li&gt;&#xA;&lt;li&gt;One user can be chosen (via the &lt;code&gt;OVERRIDE_USER&lt;/code&gt; ID in the code) who can override any headers using a comment. This user will usually be the author of the challenge. The comment has to start with &lt;code&gt;Override header:&lt;/code&gt; - anything after that will be treated as the new header. If you want to exclude an answer from the leaderboard, just use something like &lt;code&gt;Override header: invalid&lt;/code&gt;. This feature is only intended as a last resort to avoid edit wars if some user refuses to use a correct header or delete an invalid answer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;To use the leaderboard in your own challenge, simply copy the snippet and search for the global variable definition of &lt;code&gt;QUESTION_ID&lt;/code&gt; and replace it with the ID found in the URL to your question and replace &lt;code&gt;OVERRIDE_USER&lt;/code&gt; with your own user ID.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Minified Code&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;var QUESTION_ID=47338;&#xD;&#xA;var OVERRIDE_USER=8478;&#xD;&#xA;var ANSWER_FILTER=&quot;!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe&quot;,COMMENT_FILTER=&quot;!)Q2B_A2kjfAiU78X(md6BoYk&quot;,answers=[],answers_hash,answer_ids,answer_page=1,more_answers=!0,comment_page;function answersUrl(d){return&quot;https://api.stackexchange.com/2.2/questions/&quot;+QUESTION_ID+&quot;/answers?page=&quot;+d+&quot;&amp;amp;pagesize=100&amp;amp;order=desc&amp;amp;sort=creation&amp;amp;site=codegolf&amp;amp;filter=&quot;+ANSWER_FILTER}function commentUrl(d,e){return&quot;https://api.stackexchange.com/2.2/answers/&quot;+e.join(&quot;;&quot;)+&quot;/comments?page=&quot;+d+&quot;&amp;amp;pagesize=100&amp;amp;order=desc&amp;amp;sort=creation&amp;amp;site=codegolf&amp;amp;filter=&quot;+COMMENT_FILTER}function getAnswers(){jQuery.ajax({url:answersUrl(answer_page++),method:&quot;get&quot;,dataType:&quot;jsonp&quot;,crossDomain:!0,success:function(d){answers.push.apply(answers,d.items),answers_hash=[],answer_ids=[],d.items.forEach(function(e){e.comments=[];var f=+e.share_link.match(/\d+/);answer_ids.push(f),answers_hash[f]=e}),d.has_more||(more_answers=!1),comment_page=1,getComments()}})}function getComments(){jQuery.ajax({url:commentUrl(comment_page++,answer_ids),method:&quot;get&quot;,dataType:&quot;jsonp&quot;,crossDomain:!0,success:function(d){d.items.forEach(function(e){e.owner.user_id===OVERRIDE_USER&amp;amp;&amp;amp;answers_hash[e.post_id].comments.push(e)}),d.has_more?getComments():more_answers?getAnswers():process()}})}getAnswers();var SCORE_REG=function(){var d=String.raw`h\d`,e=String.raw`\-?\d+\.?\d*`,f=String.raw`[^\n&amp;lt;&amp;gt;]*`,g=String.raw`&amp;lt;s&amp;gt;${f}&amp;lt;/s&amp;gt;|&amp;lt;strike&amp;gt;${f}&amp;lt;/strike&amp;gt;|&amp;lt;del&amp;gt;${f}&amp;lt;/del&amp;gt;`,h=String.raw`[^\n\d&amp;lt;&amp;gt;]*`,j=String.raw`&amp;lt;[^\n&amp;lt;&amp;gt;]+&amp;gt;`;return new RegExp(String.raw`&amp;lt;${d}&amp;gt;`+String.raw`\s*([^\n,]*[^\s,]),.*?`+String.raw`(${e})`+String.raw`(?=`+String.raw`${h}`+String.raw`(?:(?:${g}|${j})${h})*`+String.raw`&amp;lt;/${d}&amp;gt;`+String.raw`)`)}(),OVERRIDE_REG=/^Override\s*header:\s*/i;function getAuthorName(d){return d.owner.display_name}function process(){var d=[];answers.forEach(function(n){var o=n.body;n.comments.forEach(function(q){OVERRIDE_REG.test(q.body)&amp;amp;&amp;amp;(o=&quot;&amp;lt;h1&amp;gt;&quot;+q.body.replace(OVERRIDE_REG,&quot;&quot;)+&quot;&amp;lt;/h1&amp;gt;&quot;)});var p=o.match(SCORE_REG);p&amp;amp;&amp;amp;d.push({user:getAuthorName(n),size:+p[2],language:p[1],link:n.share_link})}),d.sort(function(n,o){var p=n.size,q=o.size;return p-q});var e={},f=1,g=null,h=1;d.forEach(function(n){n.size!=g&amp;amp;&amp;amp;(h=f),g=n.size,++f;var o=jQuery(&quot;#answer-template&quot;).html();o=o.replace(&quot;{{PLACE}}&quot;,h+&quot;.&quot;).replace(&quot;{{NAME}}&quot;,n.user).replace(&quot;{{LANGUAGE}}&quot;,n.language).replace(&quot;{{SIZE}}&quot;,n.size).replace(&quot;{{LINK}}&quot;,n.link),o=jQuery(o),jQuery(&quot;#answers&quot;).append(o);var p=n.language;p=jQuery(&quot;&amp;lt;i&amp;gt;&quot;+n.language+&quot;&amp;lt;/i&amp;gt;&quot;).text().toLowerCase(),e[p]=e[p]||{lang:n.language,user:n.user,size:n.size,link:n.link,uniq:p}});var j=[];for(var k in e)e.hasOwnProperty(k)&amp;amp;&amp;amp;j.push(e[k]);j.sort(function(n,o){return n.uniq&amp;gt;o.uniq?1:n.uniq&amp;lt;o.uniq?-1:0});for(var l=0;l&amp;lt;j.length;++l){var m=jQuery(&quot;#language-template&quot;).html(),k=j[l];m=m.replace(&quot;{{LANGUAGE}}&quot;,k.lang).replace(&quot;{{NAME}}&quot;,k.user).replace(&quot;{{SIZE}}&quot;,k.size).replace(&quot;{{LINK}}&quot;,k.link),m=jQuery(m),jQuery(&quot;#languages&quot;).append(m)}}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-css lang-css prettyprint-override&quot;&gt;&lt;code&gt;body{text-align:left!important}#answer-list{padding:10px;float:left}#language-list{padding:10px;float:left}table thead{font-weight:700}table td{padding:5px}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt; &amp;lt;script src=&quot;https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt; &amp;lt;link rel=&quot;stylesheet&quot; type=&quot;text/css&quot; href=&quot;https://cdn.sstatic.net/Sites/codegolf/primary.css?v=f52df912b654&quot;&amp;gt; &amp;lt;div id=&quot;language-list&quot;&amp;gt; &amp;lt;h2&amp;gt;Winners by Language&amp;lt;/h2&amp;gt; &amp;lt;table class=&quot;language-list&quot;&amp;gt; &amp;lt;thead&amp;gt; &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;Language&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;User&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Score&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/thead&amp;gt; &amp;lt;tbody id=&quot;languages&quot;&amp;gt; &amp;lt;/tbody&amp;gt; &amp;lt;/table&amp;gt; &amp;lt;/div&amp;gt;&amp;lt;div id=&quot;answer-list&quot;&amp;gt; &amp;lt;h2&amp;gt;Leaderboard&amp;lt;/h2&amp;gt; &amp;lt;table class=&quot;answer-list&quot;&amp;gt; &amp;lt;thead&amp;gt; &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Author&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Language&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Size&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/thead&amp;gt; &amp;lt;tbody id=&quot;answers&quot;&amp;gt; &amp;lt;/tbody&amp;gt; &amp;lt;/table&amp;gt; &amp;lt;/div&amp;gt;&amp;lt;table style=&quot;display: none&quot;&amp;gt; &amp;lt;tbody id=&quot;answer-template&quot;&amp;gt; &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;{{PLACE}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{NAME}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{LANGUAGE}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;{{LINK}}&quot;&amp;gt;{{SIZE}}&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/tbody&amp;gt; &amp;lt;/table&amp;gt; &amp;lt;table style=&quot;display: none&quot;&amp;gt; &amp;lt;tbody id=&quot;language-template&quot;&amp;gt; &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;{{LANGUAGE}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{NAME}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;{{LINK}}&quot;&amp;gt;{{SIZE}}&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/tbody&amp;gt; &amp;lt;/table&amp;gt; &lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Unminified Code&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;/* Configuration */&#xD;&#xA;&#xD;&#xA;var QUESTION_ID = 47338; // Obtain this from the url&#xD;&#xA;// It will be like https://XYZ.stackexchange.com/questions/QUESTION_ID/... on any question page&#xD;&#xA;var ANSWER_FILTER = &quot;!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe&quot;;&#xD;&#xA;var COMMENT_FILTER = &quot;!)Q2B_A2kjfAiU78X(md6BoYk&quot;;&#xD;&#xA;var OVERRIDE_USER = 8478; // This should be the user ID of the challenge author.&#xD;&#xA;&#xD;&#xA;/* App */&#xD;&#xA;&#xD;&#xA;var answers = [], answers_hash, answer_ids, answer_page = 1, more_answers = true, comment_page;&#xD;&#xA;&#xD;&#xA;function answersUrl(index) {&#xD;&#xA;  return &quot;https://api.stackexchange.com/2.2/questions/&quot; +  QUESTION_ID + &quot;/answers?page=&quot; + index + &quot;&amp;amp;pagesize=100&amp;amp;order=desc&amp;amp;sort=creation&amp;amp;site=codegolf&amp;amp;filter=&quot; + ANSWER_FILTER;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function commentUrl(index, answers) {&#xD;&#xA;  return &quot;https://api.stackexchange.com/2.2/answers/&quot; + answers.join(';') + &quot;/comments?page=&quot; + index + &quot;&amp;amp;pagesize=100&amp;amp;order=desc&amp;amp;sort=creation&amp;amp;site=codegolf&amp;amp;filter=&quot; + COMMENT_FILTER;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function getAnswers() {&#xD;&#xA;  jQuery.ajax({&#xD;&#xA;    url: answersUrl(answer_page++),&#xD;&#xA;    method: &quot;get&quot;,&#xD;&#xA;    dataType: &quot;jsonp&quot;,&#xD;&#xA;    crossDomain: true,&#xD;&#xA;    success: function (data) {&#xD;&#xA;      answers.push.apply(answers, data.items);&#xD;&#xA;      answers_hash = [];&#xD;&#xA;      answer_ids = [];&#xD;&#xA;      data.items.forEach(function(a) {&#xD;&#xA;        a.comments = [];&#xD;&#xA;        var id = +a.share_link.match(/\d+/);&#xD;&#xA;        answer_ids.push(id);&#xD;&#xA;        answers_hash[id] = a;&#xD;&#xA;      });&#xD;&#xA;      if (!data.has_more) more_answers = false;&#xD;&#xA;      comment_page = 1;&#xD;&#xA;      getComments();&#xD;&#xA;    }&#xD;&#xA;  });&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function getComments() {&#xD;&#xA;  jQuery.ajax({&#xD;&#xA;    url: commentUrl(comment_page++, answer_ids),&#xD;&#xA;    method: &quot;get&quot;,&#xD;&#xA;    dataType: &quot;jsonp&quot;,&#xD;&#xA;    crossDomain: true,&#xD;&#xA;    success: function (data) {&#xD;&#xA;      data.items.forEach(function(c) {&#xD;&#xA;        if (c.owner.user_id === OVERRIDE_USER)&#xD;&#xA;          answers_hash[c.post_id].comments.push(c);&#xD;&#xA;      });&#xD;&#xA;      if (data.has_more) getComments();&#xD;&#xA;      else if (more_answers) getAnswers();&#xD;&#xA;      else process();&#xD;&#xA;    }&#xD;&#xA;  });  &#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;getAnswers();&#xD;&#xA;&#xD;&#xA;var SCORE_REG = (function(){&#xD;&#xA;  var headerTag     = String.raw `h\d`&#xD;&#xA;  var score         = String.raw `\-?\d+\.?\d*` // with negative/floating-point support&#xD;&#xA;  var normalText    = String.raw `[^\n&amp;lt;&amp;gt;]*` // no HTML tag, no newline&#xD;&#xA;  var strikethrough = String.raw `&amp;lt;s&amp;gt;${normalText}&amp;lt;/s&amp;gt;|&amp;lt;strike&amp;gt;${normalText}&amp;lt;/strike&amp;gt;|&amp;lt;del&amp;gt;${normalText}&amp;lt;/del&amp;gt;`&#xD;&#xA;  var noDigitText   = String.raw `[^\n\d&amp;lt;&amp;gt;]*`&#xD;&#xA;  var htmlTag       = String.raw `&amp;lt;[^\n&amp;lt;&amp;gt;]+&amp;gt;`&#xD;&#xA;&#xD;&#xA;  return new RegExp(&#xD;&#xA;  String.raw  `&amp;lt;${headerTag}&amp;gt;`+&#xD;&#xA;  String.raw    `\s*([^\n,]*[^\s,]),.*?`+&#xD;&#xA;  String.raw    `(${score})`+&#xD;&#xA;  String.raw    `(?=`+&#xD;&#xA;  String.raw      `${noDigitText}`+&#xD;&#xA;  String.raw      `(?:(?:${strikethrough}|${htmlTag})${noDigitText})*`+&#xD;&#xA;  String.raw      `&amp;lt;/${headerTag}&amp;gt;`+&#xD;&#xA;  String.raw    `)`&#xD;&#xA;  );&#xD;&#xA;})();&#xD;&#xA;&#xD;&#xA;var OVERRIDE_REG = /^Override\s*header:\s*/i;&#xD;&#xA;&#xD;&#xA;function getAuthorName(a) {&#xD;&#xA;  return a.owner.display_name;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function process() {&#xD;&#xA;  var valid = [];&#xD;&#xA;  &#xD;&#xA;  answers.forEach(function(a) {&#xD;&#xA;    var body = a.body;&#xD;&#xA;    a.comments.forEach(function(c) {&#xD;&#xA;      if(OVERRIDE_REG.test(c.body))&#xD;&#xA;        body = '&amp;lt;h1&amp;gt;' + c.body.replace(OVERRIDE_REG, '') + '&amp;lt;/h1&amp;gt;';&#xD;&#xA;    });&#xD;&#xA;    &#xD;&#xA;    var match = body.match(SCORE_REG);&#xD;&#xA;    if (match)&#xD;&#xA;      valid.push({&#xD;&#xA;        user: getAuthorName(a),&#xD;&#xA;        size: +match[2],&#xD;&#xA;        language: match[1],&#xD;&#xA;        link: a.share_link,&#xD;&#xA;      });&#xD;&#xA;    &#xD;&#xA;  });&#xD;&#xA;  &#xD;&#xA;  valid.sort(function (a, b) {&#xD;&#xA;    var aB = a.size,&#xD;&#xA;        bB = b.size;&#xD;&#xA;    return aB - bB&#xD;&#xA;  });&#xD;&#xA;&#xD;&#xA;  var languages = {};&#xD;&#xA;  var place = 1;&#xD;&#xA;  var lastSize = null;&#xD;&#xA;  var lastPlace = 1;&#xD;&#xA;  valid.forEach(function (a) {&#xD;&#xA;    if (a.size != lastSize)&#xD;&#xA;      lastPlace = place;&#xD;&#xA;    lastSize = a.size;&#xD;&#xA;    ++place;&#xD;&#xA;    &#xD;&#xA;    var answer = jQuery(&quot;#answer-template&quot;).html();&#xD;&#xA;    answer = answer.replace(&quot;{{PLACE}}&quot;, lastPlace + &quot;.&quot;)&#xD;&#xA;                   .replace(&quot;{{NAME}}&quot;, a.user)&#xD;&#xA;                   .replace(&quot;{{LANGUAGE}}&quot;, a.language)&#xD;&#xA;                   .replace(&quot;{{SIZE}}&quot;, a.size)&#xD;&#xA;                   .replace(&quot;{{LINK}}&quot;, a.link);&#xD;&#xA;    answer = jQuery(answer);&#xD;&#xA;    jQuery(&quot;#answers&quot;).append(answer);&#xD;&#xA;&#xD;&#xA;    var lang = a.language;&#xD;&#xA;    lang = jQuery('&amp;lt;i&amp;gt;' + a.language + '&amp;lt;/i&amp;gt;').text().toLowerCase();&#xD;&#xA;    &#xD;&#xA;    languages[lang] = languages[lang] || {lang: a.language, user: a.user, size: a.size, link: a.link, uniq: lang};&#xD;&#xA;  });&#xD;&#xA;&#xD;&#xA;  var langs = [];&#xD;&#xA;  for (var lang in languages)&#xD;&#xA;    if (languages.hasOwnProperty(lang))&#xD;&#xA;      langs.push(languages[lang]);&#xD;&#xA;&#xD;&#xA;  langs.sort(function (a, b) {&#xD;&#xA;    if (a.uniq &amp;gt; b.uniq) return 1;&#xD;&#xA;    if (a.uniq &amp;lt; b.uniq) return -1;&#xD;&#xA;    return 0;&#xD;&#xA;  });&#xD;&#xA;&#xD;&#xA;  for (var i = 0; i &amp;lt; langs.length; ++i)&#xD;&#xA;  {&#xD;&#xA;    var language = jQuery(&quot;#language-template&quot;).html();&#xD;&#xA;    var lang = langs[i];&#xD;&#xA;    language = language.replace(&quot;{{LANGUAGE}}&quot;, lang.lang)&#xD;&#xA;                       .replace(&quot;{{NAME}}&quot;, lang.user)&#xD;&#xA;                       .replace(&quot;{{SIZE}}&quot;, lang.size)&#xD;&#xA;                       .replace(&quot;{{LINK}}&quot;, lang.link);&#xD;&#xA;    language = jQuery(language);&#xD;&#xA;    jQuery(&quot;#languages&quot;).append(language);&#xD;&#xA;  }&#xD;&#xA;&#xD;&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-css lang-css prettyprint-override&quot;&gt;&lt;code&gt;body { text-align: left !important}&#xD;&#xA;&#xD;&#xA;#answer-list {&#xD;&#xA;  padding: 10px;&#xD;&#xA;  float: left;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;#language-list {&#xD;&#xA;  padding: 10px;&#xD;&#xA;  float: left;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;table thead {&#xD;&#xA;  font-weight: bold;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;table td {&#xD;&#xA;  padding: 5px;&#xD;&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xD;&#xA;&amp;lt;link rel=&quot;stylesheet&quot; type=&quot;text/css&quot; href=&quot;https://cdn.sstatic.net/Sites/codegolf/primary.css?v=f52df912b654&quot;&amp;gt;&#xD;&#xA;&amp;lt;div id=&quot;language-list&quot;&amp;gt;&#xD;&#xA;  &amp;lt;h2&amp;gt;Winners by Language&amp;lt;/h2&amp;gt;&#xD;&#xA;  &amp;lt;table class=&quot;language-list&quot;&amp;gt;&#xD;&#xA;    &amp;lt;thead&amp;gt;&#xD;&#xA;      &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;Language&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;User&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Score&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&#xD;&#xA;    &amp;lt;/thead&amp;gt;&#xD;&#xA;    &amp;lt;tbody id=&quot;languages&quot;&amp;gt;&#xD;&#xA;&#xD;&#xA;    &amp;lt;/tbody&amp;gt;&#xD;&#xA;  &amp;lt;/table&amp;gt;&#xD;&#xA;&amp;lt;/div&amp;gt;&#xD;&#xA;&amp;lt;div id=&quot;answer-list&quot;&amp;gt;&#xD;&#xA;  &amp;lt;h2&amp;gt;Leaderboard&amp;lt;/h2&amp;gt;&#xD;&#xA;  &amp;lt;table class=&quot;answer-list&quot;&amp;gt;&#xD;&#xA;    &amp;lt;thead&amp;gt;&#xD;&#xA;      &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Author&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Language&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Size&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&#xD;&#xA;    &amp;lt;/thead&amp;gt;&#xD;&#xA;    &amp;lt;tbody id=&quot;answers&quot;&amp;gt;&#xD;&#xA;&#xD;&#xA;    &amp;lt;/tbody&amp;gt;&#xD;&#xA;  &amp;lt;/table&amp;gt;&#xD;&#xA;&amp;lt;/div&amp;gt;&#xD;&#xA;&#xD;&#xA;&amp;lt;table style=&quot;display: none&quot;&amp;gt;&#xD;&#xA;  &amp;lt;tbody id=&quot;answer-template&quot;&amp;gt;&#xD;&#xA;    &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;{{PLACE}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{NAME}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{LANGUAGE}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;{{LINK}}&quot;&amp;gt;{{SIZE}}&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&#xD;&#xA;  &amp;lt;/tbody&amp;gt;&#xD;&#xA;&amp;lt;/table&amp;gt;&#xD;&#xA;&amp;lt;table style=&quot;display: none&quot;&amp;gt;&#xD;&#xA;  &amp;lt;tbody id=&quot;language-template&quot;&amp;gt;&#xD;&#xA;    &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;{{LANGUAGE}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{NAME}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;{{LINK}}&quot;&amp;gt;{{SIZE}}&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&#xD;&#xA;  &amp;lt;/tbody&amp;gt;&#xD;&#xA;&amp;lt;/table&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Info Section&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You can copy the following Markdown into your challenge as instructions for your participants.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;## Leaderboards&#xA;&#xA;Here is a Stack Snippet to generate both a regular leaderboard and an overview of winners by language.&#xA;&#xA;To make sure that your answer shows up, please start your answer with a headline, using the following Markdown template:&#xA;&#xA;    # Language Name, N bytes&#xA;&#xA;where `N` is the size of your submission. If you improve your score, you *can* keep old scores in the headline, by striking them through. For instance:&#xA;&#xA;    # Ruby, &amp;lt;s&amp;gt;104&amp;lt;/s&amp;gt; &amp;lt;s&amp;gt;101&amp;lt;/s&amp;gt; 96 bytes&#xA;&#xA;If there you want to include multiple numbers in your header (e.g. because your score is the sum of two files or you want to list interpreter flag penalties separately), make sure that the actual score is the *last* number in the header:&#xA;&#xA;    # Perl, 43 + 2 (-p flag) = 45 bytes&#xA;&#xA;You can also make the language name a link which will then show up in the leaderboard snippet:&#xA;&#xA;    # [&amp;gt;&amp;lt;&amp;gt;](http://esolangs.org/wiki/Fish), 121 bytes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="69850" LastEditDate="2018-06-01T09:43:49.197" LastActivityDate="2018-06-01T11:02:24.593" Title="Leaderboard Snippet" Tags="|discussion|stack-snippets|scoring|" AnswerCount="11" CommentCount="26" ContentLicense="CC BY-SA 4.0" />
  <row Id="5140" PostTypeId="2" ParentId="2140" CreationDate="2015-04-24T20:29:30.843" Score="0" Body="&lt;h2&gt;Generate random seeds for strings&lt;/h2&gt;&#xA;&lt;p&gt;Consider the following pseudocode:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;function randomString(long input) {&#xA;    accumulator = &amp;quot;&amp;quot;;&#xA;    random = random.seededWith(input);&#xA;    while(true) {&#xA;        x = random.nextInteger(27); # generate integer 0-26&#xA;        if(x == 0) break;&#xA;        accumulator += x + 'a'; # add lowercase letter from a-z for values 1-26&#xA;    }&#xA;    return accumulator;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In other words, this generates a random lowercase string based on a random number seed.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Your job is not to write this behavior.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;For this golf, your job is to &lt;strong&gt;REVERSE&lt;/strong&gt; this process. Receive a String as input, and return the random seed that would generate this string, using whatever pseudorandom algorithm is included by default in your language - so different languages will have different numbers returned for the same string.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;However,&lt;/strong&gt; the algorithm used to regenerate the strings should be the same for all languages.&lt;/p&gt;&#xA;&lt;h2&gt;Fine print&lt;/h2&gt;&#xA;&lt;p&gt;You may write a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2422/17249&quot;&gt;program or function&lt;/a&gt;, which &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;returns the output as an integer or long (whatever's appropriate for your language) or printing it to STDOUT (or closest alternative).&lt;/a&gt; You may optionally include a single trailing newline in the output.&lt;/p&gt;&#xA;&lt;p&gt;If the String cannot be generated in this method, your program should throw an exception and/or print an error message of some sort.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/standard-loopholes-which-are-no-longer-funny&quot;&gt;standard loopholes which are no longer funny&lt;/a&gt; are &lt;strong&gt;banned&lt;/strong&gt;. You may not use external libraries unless your language doesn't support seeded random number generation by default. If that is the case, then you may use the library for random number generation that is most commonly used by that language's community.&lt;/p&gt;&#xA;&lt;h3&gt;Citations&lt;/h3&gt;&#xA;&lt;p&gt;This question has been brought to you by: &lt;a href=&quot;https://stackoverflow.com/questions/15182496/why-does-this-code-using-random-strings-print-hello-world/15182511#15182511&quot;&gt;Why does this code using random strings print hello world?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="17249" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-04-24T20:29:30.843" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5158" PostTypeId="2" ParentId="2140" CreationDate="2015-04-27T03:35:52.537" Score="-2" Body="&lt;h1&gt;Create a Drawing Guide for a Polygram&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Poor old Jim, he's just terrible at drawing &lt;a href=&quot;http://en.wikipedia.org/wiki/Polygram_(geometry)&quot; rel=&quot;nofollow&quot;&gt;polygrams&lt;/a&gt;, and he's asked you to create a &quot;drawing guide&quot; for him - an ascii polygram with numbered edges, so he can follow the instructions.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program to produce an ascii polygram with &lt;code&gt;P &amp;lt;= 10&lt;/code&gt;; each edge of the polygram should be made of a single digit 0-9, showing the order in which the edges should be drawn.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program should receive (via STDIN, as function arguments, or some other language-appropriate method): &lt;code&gt;P&lt;/code&gt;, the number of edges/vertices of the polygram, and &lt;code&gt;Q&lt;/code&gt;, the spacing. In the notation as per the Wikipedia link, you'll be drawing a &lt;code&gt;{p/q}&lt;/code&gt; polygram.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Either print to STDOUT or return (or something else language-appropriate) a multiline string showing the drawing guide for the given polygram. The string can be any size you like, as long as it's large enough to display a clear polygram.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your code should be able to handle compound regular polygons as well as regular regular polygons, and also inputs of q &gt; p/2 (poor old Jim doesn't realize that the polygram for &lt;code&gt;{p/q}&lt;/code&gt; is the same as for &lt;code&gt;{p/p-q}&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example Output for {10,3}&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;              5              &#xA;             5 4             &#xA;                4            &#xA;     21     5        888     &#xA;     2 11115     8888  7     &#xA;     2    5111888 4    7     &#xA;     2     888111  4   7     &#xA;     2  888      111   7     &#xA;     8885           4117     &#xA;  8882               4 711   &#xA; 8   2 5               7  111&#xA;     25               47     &#xA; 9   5                 7    0&#xA;  9  2                 74  0 &#xA;    52                 7  0  &#xA;   9 2                 7 4   &#xA;  5 92                 7 04  &#xA;     9                 70  4 &#xA; 5   2                 7     &#xA;5    29                7    4&#xA;6666 2 9              07   33&#xA;    666              0 7333  &#xA;     2 696           337     &#xA;     2   9666     333  7     &#xA;     2    9  66633 0   7     &#xA;     2      333 666    7     &#xA;     2   339       666 7     &#xA;     2333   9    0    67     &#xA;             9  0            &#xA;               0 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, so shortest in bytes wins. Tiebreaker goes to the most votes.&lt;/p&gt;&#xA;" OwnerUserId="31863" LastActivityDate="2015-04-27T03:35:52.537" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5159" PostTypeId="1" CreationDate="2015-04-27T14:16:38.003" Score="9" ViewCount="199" Body="&lt;p&gt;What should our rules be regarding partial answers? For example,&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;answers to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; questions that are not yet golfed&lt;/li&gt;&#xA;&lt;li&gt;answers that almost work, but not quite (answers that require a simple bugfix)&lt;/li&gt;&#xA;&lt;li&gt;answers that are missing a trivial rule specified in the question (that can be easily added)&lt;/li&gt;&#xA;&lt;li&gt;answers that have not yet finished running for a question that scores on output (so they don't have a full score yet)&lt;/li&gt;&#xA;&lt;li&gt;answers that only solve parts of a question so far&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Should we allow these, or flag them as NAA / delete?&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2015-05-06T15:05:01.887" Title="What should the policy be on partial answers?" Tags="|discussion|policy|answers|" AnswerCount="1" CommentCount="1" ClosedDate="2016-01-18T20:33:11.850" ContentLicense="CC BY-SA 3.0" />
  <row Id="5163" PostTypeId="1" AcceptedAnswerId="5164" CreationDate="2015-04-28T05:15:39.450" Score="4" ViewCount="204" Body="&lt;p&gt;I'll confess off the bat that I have not investigated this too closely, but I have noticed that every time I see a Quine question, it has negative votes or is closed or both.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there anything interesting left to do with Quines? Or are all these questions coincidently falling short in other respects?&lt;/p&gt;&#xA;" OwnerUserId="2381" LastActivityDate="2015-04-28T06:23:12.297" Title="Are Quines played-out?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5164" PostTypeId="2" ParentId="5163" CreationDate="2015-04-28T06:07:01.460" Score="13" Body="&lt;h1&gt;No, quines are not played-out&lt;/h1&gt;&#xA;&lt;p&gt;I believe there will &lt;em&gt;always&lt;/em&gt; be new ways of formulating good challenges, and some of those yet to be made good challenges will involve quines. Saying &amp;quot;we've asked every quine problem there could ever be&amp;quot; is like saying we've thought of every math problem there could ever be.&lt;/p&gt;&#xA;&lt;p&gt;If you only mean that the &lt;em&gt;current&lt;/em&gt; state of quine challenges is suffering, that may well be. It is difficult to think of totally fresh ideas involving quines which are somewhat static in nature (and prone to loophole gray areas). But I wouldn't discount the topic in the grand scheme of things.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Additional note:&lt;/strong&gt; It seems likely that &lt;a href=&quot;https://codegolf.stackexchange.com/q/49332/26997&quot;&gt;this recent badly received question&lt;/a&gt; played a part in your quine skepticism. I think the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; part was its real downfall. Writing good underhanded challenges is arguably much more difficult than writing good quine challenges, since their nature is &lt;em&gt;much&lt;/em&gt; more subjective and even more prone to loophole gray areas.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-04-28T06:23:12.297" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5172" PostTypeId="2" ParentId="2140" CreationDate="2015-04-29T14:12:07.420" Score="2" Body="&lt;h1&gt;Draw a trie diagram&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://en.m.wikipedia.org/wiki/Trie&quot; rel=&quot;nofollow&quot;&gt;Tries&lt;/a&gt; (pronounced &quot;trees&quot;) are a type of data structure also known as a prefix tree.  The prefix tree stores a list of strings by taking advantage of prefixes that are shared between multiple strings.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Too lazy to type a better description now)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you will create a very simple diagram of a trie.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;baby,bad,bank,box,dad,dance&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;b   d&#xA;a  oa&#xA;bdnxdn&#xA;y k  c&#xA;     e&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2015-04-29T14:12:07.420" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5173" PostTypeId="2" ParentId="2140" CreationDate="2015-04-29T17:21:50.883" Score="0" Body="&lt;h1&gt;Structural Damage Simulation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt; (either &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;, haven't decided yet)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Introduction&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you are given a two-dimensional map or a brick structure.&#xA;Each brick is glued to its four neighbors, and is guaranteed to be connected to the ground, that is, the bottom edge of the input grid, via adjacent bricks.&#xA;This structure is affected by gravity, which may cause some of the bricks to break, depending on their durability.&#xA;Your task is to predict whether this happens, and where.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Spec&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The input is given as a grid of the ASCII characters &lt;code&gt;.&lt;/code&gt; and &lt;code&gt;#&lt;/code&gt; that represent empty space and square bricks OR a black-and-white image with the black pixels representing bricks.&#xA;You are also given a nonnegative number that represents the durability of the bricks; you can choose the valid type (integer or float) and range of this parameter and how it affects the computation.&#xA;Your output is a grid in the same format as the input, but with some of the bricks replaced by &lt;code&gt;X&lt;/code&gt;s (or gray/red pixels); they represent bricks that have broken under the strain caused by the weight of the structure.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Suppose we have the following input grid (replace with an image if that's chosen as the input format)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;................&#xA;..######...####.&#xA;..######...####.&#xA;..########.####.&#xA;...###...#.####.&#xA;.....#...######.&#xA;.....#.....####.&#xA;.....#......#...&#xA;.....#.######...&#xA;.....#####......&#xA;.....#######....&#xA;.....#######....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The narrow parts of the structure are likely to break, especially the vertical ones, but the solid parts may very well hold themselves together.&#xA;A possible output would be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;................&#xA;..######...####.&#xA;..######...####.&#xA;..######XX.####.&#xA;...###...X.####.&#xA;.....#...X#####.&#xA;.....X.....####.&#xA;.....X......X...&#xA;.....X.#XXXXX...&#xA;.....####X......&#xA;.....#######....&#xA;.....#######....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;TODO: add more test cases.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is a popularity contest, meaning that the answer with the highest vote tally wins.&#xA;Voters are encouraged to take the following criteria into account:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Simplicity.&lt;/strong&gt; Simple and elegant algorithms are favored over complex and over-engineered ones. Elegance includes reasonable speed, so very slow algorithms are discouraged.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Realism.&lt;/strong&gt; The outputs should be close to the physical intuition of most people.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Flexibility.&lt;/strong&gt; Solutions should preferably handle complicated structures and extreme values of durability.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="32014" LastEditDate="2015-04-29T17:27:32.640" LastActivityDate="2015-04-29T17:27:32.640" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5174" PostTypeId="2" ParentId="2140" CreationDate="2015-04-29T18:01:12.093" Score="0" Body="&lt;h1&gt;Cops 'n' Robbers - Hide a keyword in each answer &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This is an idea I'm still working on, but I want some feedback on whether or not it could pan out well.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;Cops&lt;/h3&gt;&#xA;&lt;p&gt;The robbers are here! They've found our files! We, need to encrypt them! We need a certain key, something special that clearly shows what the real program is. We need to keep writing our new files, but we must keep encoding them. When a robber cracks a key, we find the key they cracked and write a new file off of that key! For example, we will hide the encryption key for file #2 in file #1, then file #2 hides a key for file #3, and so on. The files are safe if they go uncracked for 5 days, in which we win! But if the robbers crack all 100 of our files, we lose!&lt;/p&gt;&#xA;&lt;h3&gt;Robbers&lt;/h3&gt;&#xA;&lt;p&gt;We found the cops' files! Not only that, we cracked their encryption scheme! In file #1, they hide a key for file #2, which hides a key for file #3, and so on. Our goal is to hack all 100 files. The only catch? We'll lose our connection if we don't crack a file within 5 days.&lt;/p&gt;&#xA;&lt;h3&gt;In English, Please?&lt;/h3&gt;&#xA;&lt;p&gt;Basically, the cops will upload an answer with a program when the robbers crack the previous answer. The clue to the next answer is hidden in this one, encoded with the clue from the last answer. If a robber guesses wrong, that robber can not guess again on the same answer. If a answer remains uncracked for 5 days, cops win. If robbers guess all 100 answers, the robbers win.&lt;/p&gt;&#xA;&lt;h3&gt;Winners&lt;/h3&gt;&#xA;&lt;p&gt;The winner for the cops is whoever made the uncrackable file. For the robbers, it's whoever cracked the most files (in event of a tie, later answers are better than old ones.)&lt;/p&gt;&#xA;" OwnerUserId="38891" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-04-29T20:15:18.577" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5176" PostTypeId="1" CreationDate="2015-04-29T22:16:19.397" Score="11" ViewCount="446" Body="&lt;p&gt;We all know and love &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/5162#5162&quot;&gt;the Sandbox&lt;/a&gt;. It's one of our best features. But in the body of the Sandbox, I noticed this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This is a community-maintained list of the most active Sandbox submissions, sorted by major contest type. Add an entry to the top of this list if you add a new submission or update an old one. If you don't have enough reputation to edit questions you can ask in chat for a higher-rep user to add your submission for you. You may include a [status] indicator and tags to categorize your submission.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This means that you can edit to update your submission, or ask someone to do it for you. But if the goal is to have the community keep it maintained, then why isn't it a community wiki question, which would allow people with 100+ rep to edit it, rather than needing 1000+? If the problem is vandals, you would still need 100 rep, meaning that people trust you enough. The answers being CW as well would mean that it would both be better for a testing ground, as you would not gain or lose rep for good or bad ideas (which I don't think happens anyway), and that the answers could be deleted a week after posting, which means that we wouldn't have so much clutter from posted answers from a long time ago. And even if something bad does happen, rollbacks can fix posts that have been vandalized, and we already punish things like that.&lt;br&gt;&#xA;There appear to be a lot of upsides to making this CW. So why isn't it a community wiki question?&lt;/p&gt;&#xA;" OwnerUserId="38891" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2015-11-15T01:02:14.997" Title="Why isn't the Sandbox Community Wiki?" Tags="|discussion|status-declined|sandbox|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5177" PostTypeId="2" ParentId="5176" CreationDate="2015-04-29T22:52:00.010" Score="4" Body="&lt;p&gt;&lt;em&gt;I'm speaking as a user, not a moderator.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Making the Sandbox CW also makes all its answers CW. On meta, the only effect is to lower the rep threshold for editing anything too 100 (the answers also don't count towards tag badges any longer, but they aren't meant to be permanent anyway). I think that's a good thing, because I've quite often seen that users below 1k rep wanted to suggest (helpful) edits to sandbox proposals but couldn't. So:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I'm in favour of making the sandbox a community wiki.&lt;/strong&gt; Mostly for the effect on the answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I am not a fan of the list itself and would prefer to see it removed. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5178/8478&quot;&gt;This can be discussed over here.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[Note that the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7084/should-we-remove-the-reputation-requirement-for-answering-on-meta&quot;&gt;Meta rep requirements have been removed since this was posted&lt;/a&gt;.]&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2015-11-15T01:02:14.997" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5178" PostTypeId="1" AcceptedAnswerId="5179" CreationDate="2015-04-29T22:57:54.250" Score="23" ViewCount="631" Body="&lt;p&gt;I would like to propose to remove the answer directory from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/8478&quot;&gt;the Sandbox&lt;/a&gt;. It seems that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's never up to date.&lt;/li&gt;&#xA;&lt;li&gt;It takes a lot of unnecessary vertical space.&lt;/li&gt;&#xA;&lt;li&gt;I have no indication that anyone is actually using it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If you're using it to find your &lt;em&gt;own&lt;/em&gt; proposals, there is a much better way: simply use &lt;a href=&quot;https://codegolf.meta.stackexchange.com/search?q=user%3Ame+inquestion%3A2140&quot;&gt;&lt;strong&gt;this search query&lt;/strong&gt;&lt;/a&gt; which I'll gladly link in the sandbox post. If you're actually using it to look for others' proposals (and find the list invaluable for that), I'd like to hear that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let me know your opinions/objections in comments or answers.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-05-03T15:36:46.313" Title="Getting rid of the sandbox directory" Tags="|discussion|status-completed|sandbox|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5179" PostTypeId="2" ParentId="5178" CreationDate="2015-04-30T08:44:23.327" Score="16" Body="&lt;p&gt;I'm very happy with getting rid of the list of answers and replacing them with a few useful links instead. No more manual updating, and no more scrolling for a fortnight to get past the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would find it very useful to have the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/search?tab=active&amp;amp;q=is%3aanswer%20user%3ame%20inquestion%3a2140&quot;&gt;&lt;strong&gt;link to your own answers&lt;/strong&gt;&lt;/a&gt; that MartinBüttner suggests. This one is also sorted by active, so you can see what you have been working on most recently at the top.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We could also include links for reviewing just one tag type:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/search?tab=active&amp;amp;q=is%3aanswer%20inquestion%3a2140%20%22king-of-the-hill%22&quot;&gt;Link to KotH answers sorted by active&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/search?tab=active&amp;amp;q=is%3aanswer%20inquestion%3a2140%20%22code-golf%22&quot;&gt;Link to golf answers sorted by active&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2015-04-30T14:54:30.140" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5183" PostTypeId="2" ParentId="2140" CreationDate="2015-04-30T17:29:17.753" Score="-2" Body="&lt;h1&gt;Pointer to pointers to pointers to pointers&lt;/h1&gt;&#xA;&lt;p&gt;You should choose a language supporting pointers like C. And your task is simple: demonstrate a legitimate use of the most level of pointers.&lt;/p&gt;&#xA;&lt;p&gt;You should justify your code by describing an algorithm that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Has only plain text, number or an array of those as input and output.&lt;/li&gt;&#xA;&lt;li&gt;You think it will make things easier to write those code as a part of the implementation of this algorithm.&lt;/li&gt;&#xA;&lt;li&gt;This implementation would have optimum memory usage (only declared variables and parameters, explicitly allocated space, and the return addresses for recursive functions count).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Other rules:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;They must be pointers to pointers directly, i.e. a pointer to an object containing a pointer doesn't count. It's better if nobody using this code will want to extend some pointer to an object later.&lt;/li&gt;&#xA;&lt;li&gt;Each pointer must have a different type (if your language can somehow make them the same type).&lt;/li&gt;&#xA;&lt;li&gt;You should create at least one pointer, and either dereference or compare two non-null pointers once in each level.&lt;/li&gt;&#xA;&lt;li&gt;Using pointers as arrays is only half as interesting.&lt;/li&gt;&#xA;&lt;li&gt;Iterators, etc, are considered in essence pointers and allowed in this challenge. But you can't define new types implementing iterators for this purpose.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-04-30T18:21:11.707" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5184" PostTypeId="2" ParentId="2140" CreationDate="2015-04-30T19:59:33.307" Score="7" Body="&lt;h1&gt;King of the Sausage&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;This is just a draft.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;I saw this (slightly altered) 'game' in a tv show once: Two competitors are each given a sausage of equal weight. Then they each have to cut pieces from this sausage (without seeing how much the oponent cut off) which then are weighted against each other. The player that has the heavier piece gets a point. Then the weighted sausage pieces are discarted and the process is repeated. After 5 rounds the one who got the heavier piece more often wins.&lt;/p&gt;&#xA;&lt;p&gt;A win results in 3 points, a loss in 0, a tie in 1 for.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;p&gt;Here the saussage weight is given as an integer &lt;code&gt;totalWeight&lt;/code&gt;. You can only cut off pieces of integer size.&lt;/p&gt;&#xA;&lt;p&gt;Each submission should write a JavaScript function that takes these arguments:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;totalWeight&lt;/code&gt;: The units of the total weight of the sausage at the beginning as an integer between &lt;code&gt;5&lt;/code&gt; and &lt;code&gt;2^31-1&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;round&lt;/code&gt;: An integer between 0 and 4 that indicates the current round.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ownPieces&lt;/code&gt;: An array of size 0 upto 4, each element is the size of the piece you cut of in the previous round.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;opponentPieces&lt;/code&gt;: The same, but with the pieces of the oponent.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;memory&lt;/code&gt;: A variable that allows you to store information between the rounds. It can contain any kind of structure. It is initialized with &lt;code&gt;0&lt;/code&gt; before the first game with an new oponent and it can store information between those games.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Each time it is called, it has to return an integer between &lt;code&gt;0&lt;/code&gt; and the weight of the remaining sausage (= &lt;code&gt;totalWeight&lt;/code&gt; minus the sum of the entries in &lt;code&gt;ownPieces&lt;/code&gt;). If it does return anything else, the submission will be disqualified. The function may not access any global variables and may not try to influece the game in any other way. It cannot take more than 100ms per round.&lt;/p&gt;&#xA;&lt;p&gt;Each pair of oponents will play this game a certain number (to be determined ) of times against each other.&lt;/p&gt;&#xA;&lt;p&gt;Feel free to share your thoughts / suggestions!&lt;/p&gt;&#xA;&lt;h1&gt;Meta:&lt;/h1&gt;&#xA;&lt;p&gt;How should the initial sausage weight be determined?&lt;/p&gt;&#xA;&lt;p&gt;Possible controller inspiration: &lt;a href=&quot;https://jsfiddle.net/CalvinsHobbies/ave6ejyd/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://jsfiddle.net/CalvinsHobbies/ave6ejyd/&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-04T19:48:51.173" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5190" PostTypeId="2" ParentId="5178" CreationDate="2015-05-02T17:40:25.240" Score="6" Body="&lt;h1&gt;Use a Stack Snippet instead&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This was a very popular comment of mine, so I'm turning it into a post.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I think that Stack Snippets could be the way to go here. It (mostly) solves the current list's problems:&lt;/p&gt;&#xA;&lt;h3&gt;It's never up to date.&lt;/h3&gt;&#xA;&lt;p&gt;One possible solution to this was my community wiki idea, but that's still work. A Stack Snippet that searches through the Sandbox would always be up to date every time you ran it.&lt;/p&gt;&#xA;&lt;h3&gt;It takes up a lot of unnecessary vertical space.&lt;/h3&gt;&#xA;&lt;p&gt;Stack Snippets would be compact, like all the others on the website, so it doesn't take up much room (and you can always use 'full page'.)&lt;/p&gt;&#xA;&lt;h3&gt;I have no indication anyone is actually using it.&lt;/h3&gt;&#xA;&lt;p&gt;My guess is that no one uses it because of the other two problems. Because you need 1000 rep to edit it (since meta doesn't allow suggested edits), it's time-consuming to handle (for the posters and the editors). It's also &lt;strong&gt;very&lt;/strong&gt; long, so no one has the time to scroll through all those posts.&lt;/p&gt;&#xA;&lt;p&gt;What do you think?&lt;/p&gt;&#xA;" OwnerUserId="38891" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-02T17:40:25.240" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5192" PostTypeId="1" AcceptedAnswerId="5194" CreationDate="2015-05-03T05:37:04.947" Score="4" ViewCount="86" Body="&lt;p&gt;At some point we decided to just have one global &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt;. I think this is fine, I'm just concerned about all the links to old sandboxes that may confuse users, new and old alike.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When I'm not logged in, and viewing the Sandbox, I can see about 7 &quot;Related&quot; questions that also look like sandboxes:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/OqisG.png&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;They all link to the current Sandbox (unless you have the rep to see them). Despite this linking, it still seems like it could be misleading to users who are looking for the official Sandbox (we are &lt;em&gt;constantly&lt;/em&gt; telling new users to &quot;go to the Sandbox first, etc.&quot;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there a way we can truly delete those old sandboxes so they don't show up?&lt;br&gt;&#xA;(Is there any reason to keep them?)&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-05-03T14:23:52.880" Title="Can we remove the old sandbox links?" Tags="|discussion|status-completed|sandbox|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5194" PostTypeId="2" ParentId="5192" CreationDate="2015-05-03T14:23:47.330" Score="4" Body="&lt;p&gt;Posts have been nuked. (Apparently merging a question into another one doesn't actually delete the original.)&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2015-05-03T14:23:47.330" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5195" PostTypeId="2" ParentId="5176" CreationDate="2015-05-03T15:53:11.953" Score="9" Body="&lt;h1&gt;No.&lt;/h1&gt;&#xA;&lt;p&gt;Now that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5178/getting-rid-of-the-sandbox-directory&quot;&gt;the sandbox list is gone&lt;/a&gt; (probably for good), there is no reason for sandbox to be a CW as no one would want to edit it that often.&lt;/p&gt;&#xA;&lt;p&gt;Benefits of making Sandbox CW:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Lowered threshold of 100 instead of 1000 rep to edit the directory list (which is gone now)&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Commenting requires 50 rep, so if any new person wanted to edit a proposal, he can anyways leave a comment (assuming he has at least 100 rep which was required to edit the proposal).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Negatives:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Users who have proposed challenges in sandbox loose their icons/identicons/gravatar images, &lt;strong&gt;even their names&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I'd say that &lt;em&gt;now&lt;/em&gt; there is no real need to make Sandbox a CW.&lt;/p&gt;&#xA;" OwnerUserId="31414" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-13T12:37:41.433" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="5204" PostTypeId="2" ParentId="2140" CreationDate="2015-05-05T22:59:18.660" Score="0" Body="&lt;h1&gt;Astrometric Tiling&lt;/h1&gt;&#xA;&lt;p&gt;A common problem in astronomy is the stitching together of astronomical images to create a mosaic of the entire imaging survey. This can't be done by naively putting the images next to each other in a grid - they might have slightly different dimensions, and certainly have different positions &amp;amp; orientations, which might overlap.&lt;/p&gt;&#xA;&lt;p&gt;The solution is to calculate the positions of the objects (usually stars) in each image in celestial coordinates, a process known as Astrometry. (This is not the challenge, as it's far too difficult for a codegolf, but if you're interested in that process, take a look at &lt;a href=&quot;http://astrometry.net/&quot; rel=&quot;nofollow noreferrer&quot;&gt;astrometry.net&lt;/a&gt;.) Once an astrometric solution for a given image is found, every star's position on the sky can be calculated based on its position on the image.&lt;/p&gt;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Write a program to accept lists of coordinates for some number &lt;code&gt;N&amp;gt;=2&lt;/code&gt; of astronomical images, and output a transformation matrix for each image to create the mosaic.&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;You may accept either a list of coordinate lists, or a list of filenames containing coordinate lists, whichever is more convenient. The coordinate list (length &amp;gt;= 10) for a given image is made up of 4 coordinates per star: &lt;code&gt;x,y&lt;/code&gt; in whole number pixel coordinates on the image, and &lt;code&gt;a,d&lt;/code&gt; in float (requiring precision to at least 10^-5) celestial coordinates. Assume that every star's coordinates are exact, and that the same celestial coordinates in two different lists refer to the same star.&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;Your program should output a 3x3 &lt;a href=&quot;http://en.wikipedia.org/wiki/Transformation_matrix#Affine_transformations&quot; rel=&quot;nofollow noreferrer&quot;&gt;affine transformation matrix&lt;/a&gt; for x,y in each image (alternatively, you can output a matrix for each image after the first, if you would like to use the first as a reference), which can be used to tile the images in such a way as to align the celestial coordinates in adjacent &amp;amp; overlapping images.&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;This is a (admittedly quite challenging) code golf, so shortest in bytes wins.&lt;/p&gt;&#xA;&lt;p&gt;I'll need to produce a test case, which I will do before posting.&lt;/p&gt;&#xA;" OwnerUserId="31863" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-05T22:59:18.660" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5205" PostTypeId="2" ParentId="5159" CreationDate="2015-05-06T15:05:01.887" Score="6" Body="&lt;p&gt;To quote &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/849/18487&quot;&gt;Robert Harvey's answer&lt;/a&gt; (emphasis mine):&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&amp;quot;Not an Answer&amp;quot; flags are for posts that make &lt;strong&gt;no attempt to answer the question&lt;/strong&gt;. They are usually things like:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I have the same problem&lt;/li&gt;&#xA;&lt;li&gt;Have you seen my glasses?&lt;/li&gt;&#xA;&lt;li&gt;Check out this great new product!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;In all of your examples, the author made some attempt to answer the question. Therefore, none of your examples qualify as &amp;quot;Not an Answer&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;If you feel that the answer is harming the site, then use a custom flag instead. Explain in your own words why the answer is harming the site and should be removed. No such case was made here.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;So I shouldn't flag as Not an Answer. What &lt;em&gt;should&lt;/em&gt; I do then?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;If you feel comfortable editing the post to solve the problem, do it. Otherwise, leave a comment explaining the problem.&lt;/p&gt;&#xA;&lt;p&gt;Downvote accordingly. You may hold your vote, see if the author responds in a timely manner, and then vote. You may choose not to vote at all. You may even upvote the efforts of the answer despite its shortcomings. When and how you vote is entirely up to you.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-06T15:05:01.887" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5207" PostTypeId="2" ParentId="2140" CreationDate="2015-05-06T18:39:25.400" Score="0" Body="&lt;p&gt;Create a program or function that, given a &lt;a href=&quot;http://en.wikipedia.org/wiki/Reverse_Polish_notation&quot; rel=&quot;nofollow&quot;&gt;postfix&lt;/a&gt; expression, converts it to the simplest equivalent expression. The expression may contain real numbers, floating variables denoted &lt;code&gt;a&lt;/code&gt; to &lt;code&gt;z&lt;/code&gt;, and the basic arithmetic operators &lt;code&gt;+-*/^&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Two expressions are equivalent if they produce the same result for all possible integer values of the variables. &quot;Simplest&quot; means you should return the equivalent expression with the least number of operators. If there are multiple expressions with the same number of operators, pick the shortest.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Consider the expression &lt;code&gt;(8+4*y)/2+x*2&lt;/code&gt;. In postfix notation, this would be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;8,4,y,*,+,2,/,x,2,*,+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This should yield the output&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2,2,y,+,x,+,*&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which corresponds to &lt;code&gt;(2+y+x)*2&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Question:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;this challenge is irrelevant of code length , so i want to ask , any scoring methods i can use in this defiance&lt;/p&gt;&#xA;&#xA;&lt;p&gt;i propose : picked up nine variant expressions with different polynomial degrees , which im free to choose , tested as input for all concurrent codes , then validate the lowest sum = &lt;strong&gt;(number_of_operations)^2+length(output_string)&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="38337" LastActivityDate="2015-05-06T18:39:25.400" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5208" PostTypeId="1" CreationDate="2015-05-07T15:51:28.670" Score="0" ViewCount="66" Body="&lt;p&gt;I was reading a question on Meta discussing how this site fits into the mission of Stack Exchange. A lot of the answers and comments all point to the same thing, that this site gives us a chance to look into different possible ways of problem solving in our favorite languages. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem is, this site has become dominated by code-golfs. On it's own, that's not really a problem. The problem is that there are languages specifically designed for that purpose that don't really serve purposes in the outside world. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've seen very, very interesting methods of solving a problem written in C or Java or Python that were buried under a pile of CJam and GolfScript solutions that were 20-50 bytes long. They all use the same algorithm, but have their own clever ways in their language of solving the problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not saying that golfs or golf languages are bad. I Think that there are many good examples of them. I also think that there are many interesting &lt;em&gt;algorithm&lt;/em&gt; type questions that don't get answered in many languages because they are a golf. They are not won by coming up with a unique algorithm but by how little code you can write.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm trying to see if people are open to reconsidering the code-golf criteria for something more algorithmic or the like. Basically, consider if the best scoring model is shortest code instead of most efficient algorithm, most creative use of language, etc.&lt;/p&gt;&#xA;" OwnerUserId="34385" LastEditorUserId="34385" LastEditDate="2015-05-07T16:16:17.840" LastActivityDate="2015-05-07T16:16:17.840" Title="Reconsidering the Code-Golf tag for questions" Tags="|discussion|" AnswerCount="0" CommentCount="12" ClosedDate="2015-05-07T15:53:42.480" ContentLicense="CC BY-SA 3.0" />
  <row Id="5209" PostTypeId="2" ParentId="286" CreationDate="2015-05-07T16:26:36.523" Score="1" Body="&lt;h2&gt;Consider the best criteria for your challenge&lt;/h2&gt;&#xA;&lt;p&gt;Maybe the best approach to solving this is reassessing winning conditions. I've seen many awesome code-golf questions that were about optimizing an algorithm or using data in a unique way. Perhaps the winning condition for these shouldn't be shortest code, but optimal algorithm or more interesting use of language capacities.&lt;/p&gt;&#xA;" OwnerUserId="34385" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-07T16:26:36.523" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5212" PostTypeId="1" CreationDate="2015-05-07T21:28:03.043" Score="23" ViewCount="756" Body="&lt;p&gt;I find that much of the joy and art of code golf comes from the ridiculous tricks and optimizations needed to &lt;em&gt;squeeze every character&lt;/em&gt;. Yet, I find myself losing motivation to do so because I feel like the site doesn't give enough incentive to try my absolute hardest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I work hard to cut 2 chars, few people will appreciate the difference between 78 chars and 76 chars, and the post will get upvotes either way. It's hard to appreciate the difference between a good golf and a great golf unless you look into it closely or try it yourself. Often, there's no other answer in the same language to compare to. And with so many challenges posted, everyone's effort and attention is split, making it hard to justify focusing hard on any one challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I myself am lucky that I golf in a language (Python) that many people know and golf in. So, my tricks are likely to have golfers who appreciate them, some of whom compete with their own Python answers or suggest improvements. This is great, and I'd like to see much more of it. For less common languages though, it seems like there is little pushing for a well-optimized answer other than the writer's internal motivation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How do you feel about motivation to golf? Is this worth looking into? Should we do anything more to encourage or reward more meticulous golfing, and if so, what?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I talk about golfs, but this all applies equally to code challenges, fastest code, etc.) &lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2015-05-07T21:36:03.920" LastActivityDate="2017-03-24T15:15:26.417" Title="Can and should we encourage more meticulous golfing?" Tags="|discussion|answers|" AnswerCount="3" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5216" PostTypeId="2" ParentId="5212" CreationDate="2015-05-09T00:45:38.807" Score="13" Body="&lt;p&gt;I want to propose a community event where we, every month or so, spotlight one golf challenge to focus our attention on, with bounty prizes for per-language winners.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This would entail:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Writing up a flawless spec, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/3578/20260&quot;&gt;Fortnightly Challenge&lt;/a&gt; style.&lt;/li&gt;&#xA;&lt;li&gt;Finding sponsors willing to put up bounties for at least the 5 most common golfing languages.&lt;/li&gt;&#xA;&lt;li&gt;Posting the challenge with a per-language leaderboard and a deadline.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I foresee some issues:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Getting people willing to donate rep.&lt;/li&gt;&#xA;&lt;li&gt;Awarding winners in collaborative work, like where someone suggests an improvement to someone else's code.&lt;/li&gt;&#xA;&lt;li&gt;Spec ambiguities and judgment calls.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Would this interest people? Can we make it work?&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2015-05-09T00:45:38.807" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="5218" PostTypeId="2" ParentId="1213" CreationDate="2015-05-09T12:45:34.250" Score="1" Body="&lt;h1&gt;IDL&lt;/h1&gt;&#xA;&lt;p&gt;IDL is proprietary software, and is quite expensive. Most astronomy departments (at the very least) have floating licenses, but even a student license is expensive.&lt;/p&gt;&#xA;&lt;p&gt;However, there is an &lt;a href=&quot;http://www.exelisvis.com/Support/HelpArticles/TabId/185/ArtMID/800/ArticleID/12395/The-IDL-Virtual-Machine.aspx&quot; rel=&quot;nofollow noreferrer&quot;&gt;IDL Virtual Machine&lt;/a&gt; that can be used to run properly-packaged IDL code. It's kind of a run-around to get it installed, sadly, but it is indeed free.&lt;/p&gt;&#xA;&lt;p&gt;Since I'm the only one on this site who uses IDL (it seems), it's seemed pointless for me to package my code. However, if there's a need, I'll start uploading .sav files for use with the IDL VM.&lt;/p&gt;&#xA;" OwnerUserId="31863" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-09T12:45:34.250" CommentCount="0" CommunityOwnedDate="2016-08-21T03:11:45.147" ContentLicense="CC BY-SA 3.0" />
  <row Id="5219" PostTypeId="2" ParentId="2140" CreationDate="2015-05-09T22:06:57.790" Score="0" Body="&lt;h1&gt;Detect limit points in (possibly) oscilating sequence&lt;/h1&gt;&#xA;&lt;h3&gt;Popularity Contest, Algorithms&lt;/h3&gt;&#xA;&lt;p&gt;Given an (infinite) sequence of numbers, your task is to find an algorithm (and write a corresponding program) that takes the sequence as input and determines&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Whether the sequence converges to a cyclic behaviour. That means the sequence will oscillate throu one or more values, that means whether it has one or more limit points. In this case it should output the limit points.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;diverges (does not end up in one or more limit point). In this case it should output a message that says so.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No defined behaviour for sequences that do not have acyclic limit points.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;A &lt;em&gt;limit point&lt;/em&gt; is a value such that for every neighbourhood of that value an infinite number of sequence elements are within that neighbourhood.&lt;/p&gt;&#xA;&lt;p&gt;Of course you can only use a &lt;em&gt;finite&lt;/em&gt; part of the sequence, so you the task is ambiguous, but the larger the given sample the better your algorithm should be able to dectect the cycles. As this is difficult to achieve for arbitrary sequences, you are allowed to use 'fine tuing parameters' that can be changed manually in order for your algorithm to work best for the given set of sequences. Please document what those parameters do.&lt;/p&gt;&#xA;&lt;p&gt;In this case here, you can assume that the sequence will converge to a behaviour where it cycles throu all the &lt;code&gt;n&lt;/code&gt; limit points without gaps (intermediate values that are not limit points) and always in the same order.&lt;/p&gt;&#xA;&lt;h3&gt;Motivation&lt;/h3&gt;&#xA;&lt;p&gt;You perhaps have already see this diagram (the bifurcation diagram of the logistic map)&#xA;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/thumb/7/7d/LogisticMap_BifurcationDiagram.png/400px-LogisticMap_BifurcationDiagram.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;In order to generate this diagram, you have to compute a sequence for every &lt;code&gt;r&lt;/code&gt; and compute the limit points &lt;code&gt;x&lt;/code&gt; of each of those sequences (which in this case are cyclic). Then you plot those &lt;code&gt;x&lt;/code&gt; against &lt;code&gt;r&lt;/code&gt;. The sequence is generated by the recursive function (logistic map) with a starting value &lt;code&gt;0&amp;lt; x(0) &amp;lt; 1&lt;/code&gt; (usually something like &lt;code&gt;0.5&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;x(n+1) := r * x(n) * (1 - x(n))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The sequences generated this way are nice examples of the sequences that your algorithm should be able to detect.&lt;/p&gt;&#xA;&lt;h3&gt;Your submission&lt;/h3&gt;&#xA;&lt;p&gt;should consist of&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a function/program that executes your algorithm on a given sequence (input in any way you like),&lt;/li&gt;&#xA;&lt;li&gt;a description of how your algorithm works,&lt;/li&gt;&#xA;&lt;li&gt;and a program that uses your function for generating the bifurcation diagram above.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;Following sequence is generated by &lt;code&gt;1+(-1)^n*(10+n)/n&lt;/code&gt; This sequence does not converge in the usual sence of sequences but it has limit points at &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;2&lt;/code&gt;. The sequence looks like this, so the&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/voZND.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is from the example above (logistic map with r=3.5), here we have 4 limit points:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/6Ybpi.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;The following sequence is bounded (and therefore has at least one limit point) but does not converge and does not seem to have a cyclic behaviour. (It is generated by &lt;code&gt;x(n) = [pi*n^3 (mod e)]/e&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/RMKlA.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/p&gt;&#xA;&lt;h1&gt;META:&lt;/h1&gt;&#xA;&lt;p&gt;I'm happy to hear from you what you think. So far I did not find any sources that described algorithms that do exactly this task, but there may very well exist such algorithms. If you can improve the text please do so! Any suggestions are welcome.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-13T08:49:47.893" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="5220" PostTypeId="2" ParentId="5212" CreationDate="2015-05-10T13:36:57.407" Score="14" Body="&lt;p&gt;I think that meticulous golfing, as you put it, is discouraged here by two factors:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Our framework makes all solutions public, and that has produced some weird conventions and assumptions. Sometimes there is only one way in a given language to get close to the optimal score. Maybe I have a 90 byte perl solution and you have a 60. I can squeeze my 90 all day long and it not get smaller, because to get down to 70 or below I need to reimplement it entirely with a different approach or algorithm. In a non-public-solution competition, I would realize that and start from scratch aiming for a different approach. However, with your code being public, and I having seen it while looking over the contest, I am strongly motivated to not simply copy your code. So instead of seeing a dozen competitors with very similar solutions as in historical perl golf competitions, we see most people here stop where their solution is most unique, even when they aren't winning.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Our framework doesn't provide any concise and consistent method for scoring different languages independently. I am a lot less motivated to compete in the languages that I am familiar with (even though perl is classically a good golfing language) when I know that I will [almost] never come close to the scores being produced by the CJam and GolfScript and Pyth golfers. When codegolf.com was active they made a point of emphasizing the top score in each language.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="4787" LastActivityDate="2015-05-10T13:36:57.407" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="5221" PostTypeId="1" AcceptedAnswerId="5222" CreationDate="2015-05-10T15:23:36.040" Score="14" ViewCount="259" Body="&lt;p&gt;We've got 93 &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions. 61 of those also have the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; tag. I suspect that actually all 93 of them (or at least 90) are actually tips for code golfing. So this seems like fairly inconsistent tagging practice, and I can see why there's confusion about it. It would be nice to decide how to use tags together with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main arguments &lt;em&gt;for&lt;/em&gt; including &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is that tips could in principle be about other challenge types. So it would be good to see from the tags what kind of help the question is actually asking for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main argument &lt;em&gt;against&lt;/em&gt; including &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is that it is intended to indicate a challenge with a fixed winning criterion and so non-challenge posts shouldn't get the tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I &lt;em&gt;think&lt;/em&gt; I am personally in favour of starting to consistently include the tag, and hence make challenge-type tags also mandatory for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question, but I'd be very interested in further arguments for and against including it, as well as the general community opinion.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2015-05-19T19:56:43.620" LastActivityDate="2015-05-19T19:56:43.620" Title="Should [tips] also be tagged with the challenge type?" Tags="|discussion|policy|tags|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5222" PostTypeId="2" ParentId="5221" CreationDate="2015-05-11T04:33:19.700" Score="19" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; should be tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; or whatever contest type they relate to. This will make it clear that not all tips are necessarily about code golf.&lt;/p&gt;&#xA;&lt;p&gt;I don't think we need to bother creating a bunch of new tags like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill-tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill-tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill-tips&lt;/a&gt; because we don't get that many &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions to begin with, so there is not a huge need to be able to subscribe to specific tip types. (And I honestly don't think we will ever be so overrun with new tips questions that this will be necessary.)&lt;/p&gt;&#xA;&lt;p&gt;If someone &lt;em&gt;really&lt;/em&gt; wants to find koth tips questions they can always just search.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-11T04:33:19.700" CommentCount="2" CommunityOwnedDate="2015-05-11T04:39:24.723" ContentLicense="CC BY-SA 3.0" />
  <row Id="5223" PostTypeId="1" CreationDate="2015-05-11T10:32:12.283" Score="3" ViewCount="125" Body="&lt;p&gt;Is this allowed? It's handy, working in JavaScript, using the snippet window for development. Updating the (deleted) answer gives source control functionality for free. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, that can be annoying for users that see also the deleted answers.&lt;/p&gt;&#xA;" OwnerUserId="21348" LastEditorUserId="26997" LastEditDate="2015-05-11T10:39:51.850" LastActivityDate="2015-05-11T10:44:37.253" Title="A work in progress answer, kept deleted until it's done" Tags="|discussion|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5224" PostTypeId="2" ParentId="5223" CreationDate="2015-05-11T10:44:37.253" Score="6" Body="&lt;p&gt;I agree that it can be annoying for high rep users, but I think its totally valid for a user to delete his answer and then later undelete it for any reason, not just WIP.&lt;/p&gt;&#xA;" OwnerUserId="31414" LastActivityDate="2015-05-11T10:44:37.253" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5226" PostTypeId="2" ParentId="2140" CreationDate="2015-05-12T18:33:47.677" Score="-2" Body="&lt;h1&gt;Winning Tic-Tac-Toe lines&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For a given tic-tac-toe board of size &lt;code&gt;N**D&lt;/code&gt; (for example, a normal tic-tac-toe game is &lt;code&gt;3**2&lt;/code&gt;), the number of winning lines of length N is given by the expression:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$&#xA;2^{D-1} + \sum_{S=1}^{D-1}2^{S-1}DN^{D-S}&#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Basically, you are summing the number of lines in each S-dimensional slice of the board.)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The challenge:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given N and D, your answer should output a list of D-dimensional coordinates for each winning line. Input and output are any reasonable format. You can assume that both N and D are positive integers, with N &gt; 1. (Degenerate cases of N=1, D&gt;1 not included.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, fastest answer wins. Please explain your algorithm!&lt;/p&gt;&#xA;" OwnerUserId="31863" LastEditorUserId="31863" LastEditDate="2015-05-12T23:07:20.683" LastActivityDate="2015-05-12T23:07:20.683" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="5228" PostTypeId="2" ParentId="2140" CreationDate="2015-05-13T16:38:32.057" Score="0" Body="&lt;h2&gt;Quaternion calculator&lt;/h2&gt;&#xA;&lt;p&gt;Quaternions are extensions of the complex number system that are used in 3d graphics and some other applications. In addition to i, there is also j and k. j^2 and k^2 are both -1, however, ij=k, jk=i, ki=j, ji=-k, kj=-i, and ik=-j. Write a calculator that can calculate addition, subtraction, multiplication, division, and exponents. This is a code golf challenge, shortest answer wins.&lt;/p&gt;&#xA;&lt;p&gt;EDIT: sample input: (2+4i+3j)*i^(j+2k)/(5j-i)+1&lt;/p&gt;&#xA;" OwnerUserId="39459" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-18T04:27:09.440" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5229" PostTypeId="2" ParentId="5134" CreationDate="2015-05-13T19:32:05.033" Score="8" Body="&lt;p&gt;This project has intrigued me so I've been working on it a bit. All my code so far is available &lt;a href=&quot;https://github.com/csaftoiu/GOLF-C&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;. I'm not sure if this is the right place to post this, so if it isn't, let me know and I'll remove it.&lt;/p&gt;&#xA;&lt;h1&gt;Faster back-end (GOLF -&amp;gt; C assembler)&lt;/h1&gt;&#xA;&lt;p&gt;The more interesting result so far has been creating a GOLF to C assembler. The input is golf assembly, and the output is C code which does the equivalent thing. This C code can then be compiled by GCC to be run natively. For example, given a primality tester in &lt;a href=&quot;https://gist.github.com/csaftoiu/f626767398d1a3e41142&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;isprime.golf&lt;/code&gt;&lt;/a&gt;, the output is &lt;a href=&quot;https://gist.github.com/csaftoiu/51b75a0f504c9fd485ca&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;isprime.golf.c&lt;/code&gt;&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;$ python3 assemble2c.py isprime.golf&#xA;$ gcc -O2 -o isprime isprime.golf.c&#xA;$ echo 5 | ./isprime&#xA;y&#xA;Ran for 129 cycles&#xA;$ echo 55 | ./isprime&#xA;n&#xA;Ran for 189 cycles&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Compare:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;$ echo 5 | python3 golf-cpu/golf.py -d isprime.bin&#xA;y&#xA;Execution terminated after 129 cycles with exit code 0.&#xA;$ echo 55 | python3 golf-cpu/golf.py -d isprime.bin&#xA;n&#xA;Execution terminated after 189 cycles with exit code 0.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The speed-up is massive:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;input&lt;/th&gt;&#xA;&lt;th&gt;cycles&lt;/th&gt;&#xA;&lt;th&gt;Python VM&lt;/th&gt;&#xA;&lt;th&gt;assembled C code&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;5&lt;/td&gt;&#xA;&lt;td&gt;129&lt;/td&gt;&#xA;&lt;td&gt;0.117s&lt;/td&gt;&#xA;&lt;td&gt;0.006s&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;9,149,419&lt;/td&gt;&#xA;&lt;td&gt;30,517&lt;/td&gt;&#xA;&lt;td&gt;0.151s&lt;/td&gt;&#xA;&lt;td&gt;0.003s&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;377,333,773&lt;/td&gt;&#xA;&lt;td&gt;194,593&lt;/td&gt;&#xA;&lt;td&gt;0.630s&lt;/td&gt;&#xA;&lt;td&gt;0.004s&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;77,777,677,777&lt;/td&gt;&#xA;&lt;td&gt;2,789,249&lt;/td&gt;&#xA;&lt;td&gt;8.732s&lt;/td&gt;&#xA;&lt;td&gt;0.006s&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;8,284,590,452,353&lt;/td&gt;&#xA;&lt;td&gt;28,783,405&lt;/td&gt;&#xA;&lt;td&gt;1m28.105s&lt;/td&gt;&#xA;&lt;td&gt;0.019s&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;979,853,562,951,413&lt;/td&gt;&#xA;&lt;td&gt;313,026,621&lt;/td&gt;&#xA;&lt;td&gt;x&lt;/td&gt;&#xA;&lt;td&gt;0.179s&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;777,777,722,155,555,333&lt;/td&gt;&#xA;&lt;td&gt;8,819,171,305&lt;/td&gt;&#xA;&lt;td&gt;x&lt;/td&gt;&#xA;&lt;td&gt;5.479s&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;Basically the standard VM runs about 320,000 cycles/second of this program, while the converted version runs about 1.7 billion/second.&lt;/p&gt;&#xA;&lt;h1&gt;C -&amp;gt; GOLF compiler&lt;/h1&gt;&#xA;&lt;p&gt;If you looked at &lt;code&gt;isprime.golf&lt;/code&gt; you may have noticed that it looked to be automatically generated. That's because it was, from &lt;a href=&quot;https://github.com/csaftoiu/GOLF-C/blob/master/examples/isprime.golfc&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;isprime.golfc&lt;/code&gt;&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;$ python compile.py -S isprime.golf examples/isprime.golfc&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is a bit less interesting because hand-optimized code will likely work better anyway, but I like the recursivity of it. Essentially I wrote some C code, which I compiled to GOLF assembly, which I think assembled into C code, which I compiled and ran on my machine. Fun stuff!&lt;/p&gt;&#xA;&lt;p&gt;Interestingly the &lt;code&gt;777777722155555333&lt;/code&gt; test-case runs in 0.008s if I compile the original C file, so that's ~687.5x faster than the golf-C shenanigans.&lt;/p&gt;&#xA;" OwnerUserId="4800" LastEditorUserId="66833" LastEditDate="2021-06-02T21:53:26.480" LastActivityDate="2021-06-02T21:53:26.480" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="5230" PostTypeId="1" CreationDate="2015-05-13T20:21:49.330" Score="0" ViewCount="47" Body="&lt;p&gt;When viewing &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5229/4162&quot;&gt;this answer&lt;/a&gt; the shell transcript seems to be misindented, but when I edit the source it seems fine?&lt;/p&gt;&#xA;" OwnerUserId="4162" LastEditorUserId="68942" LastEditDate="2021-06-05T03:26:15.177" LastActivityDate="2021-06-05T03:26:15.177" Title="Code sample strangely indented?" Tags="|bug|status-completed|formatting|" AnswerCount="0" CommentCount="1" ClosedDate="2015-05-13T20:33:28.810" ContentLicense="CC BY-SA 3.0" />
  <row Id="5233" PostTypeId="1" CreationDate="2015-05-15T03:39:32.180" Score="5" ViewCount="368" Body="&lt;p&gt;I want to post a challenge using only Turing Machines. I want the winning solution to be a combination of smallest machine (fewest states) and shortest worst case runtime (up to two machines). I am unsure how to score this. A penalty would be added to the score for having two machines. The challenge will be to run the machine over variably sized data until the exit condition is met, so the same machine needs to be able to cope with both small data and large data.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Size of machine - easy: a 5-state machine beats a 7-state machine&lt;/li&gt;&#xA;&lt;li&gt;Runtime - hard&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;If the data is size $x$ how would I score a time of $x^2$ vs $x+10000$? The first one is $O(x^2)$ but the second one is $O(x)$ even though it will only win when the data is larger than 100. Also, how could I provide rules for condensing this into a single number so people could score their own answer?&lt;/p&gt;&#xA;&lt;p&gt;Should I just limit it to size?&lt;/p&gt;&#xA;&lt;h2&gt;EDIT&lt;/h2&gt;&#xA;&lt;p&gt;I just realised that if I do allow two machines, one for size, one for speed, that I want to weight their scores evenly. I don't want people to favour one or the other just because they can score better that way! They should be trying for the smallest and fastest single machine, if possible.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I am now considering multiplying the size of the smallest machine by the runtime of the largest machine. For one machine this is just size x time.&lt;/p&gt;&#xA;" OwnerUserId="29560" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-15T13:00:00.687" Title="Turing Machine challenge" Tags="|discussion|code-golf|" AnswerCount="3" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5234" PostTypeId="2" ParentId="2140" CreationDate="2015-05-15T03:56:30.057" Score="3" Body="&lt;h1&gt;How to Gossip Appropriately&lt;/h1&gt;&#xA;&lt;p&gt;We all know how important it is to get social arrangements right:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/XR7Za.png&quot; alt=&quot;XKCD&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;You have a group of friends who love to gossip. However, gossip is notorious for changing as it gets spread from friend to friend, and if somebody hears two versions of the same gossip, it just &lt;em&gt;ruins&lt;/em&gt; it for them.&lt;/p&gt;&#xA;&lt;p&gt;Hence, you and all of your friends have agreed to gossip in an orderly manner, and &lt;strong&gt;it is your job to define who will gossip with who and for how long.  Ideal gossiping must follow the following rules&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Each friend must gossip for a specific amount of time&lt;/strong&gt;.  This time is different for each person.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Any pair of friends will only spend so long gossiping&lt;/strong&gt;. Any longer, and it will become dull.  We will refer to this time as &lt;code&gt;L&lt;/code&gt;.  This time is the same for all friends.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Gossipping only comes in minute increments&lt;/strong&gt;.  We have no idea why this is, but its true.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Gossip must eventually reach everybody&lt;/strong&gt;.  If any given friend has new gossip, then all of your friends must eventually get that gossip.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Proper gossipping never includes circles&lt;/strong&gt;.  If &lt;code&gt;A&lt;/code&gt; gossips to &lt;code&gt;B&lt;/code&gt; and &lt;code&gt;C&lt;/code&gt;, and then &lt;code&gt;B&lt;/code&gt; gossips to &lt;code&gt;C&lt;/code&gt;, then &lt;code&gt;C&lt;/code&gt; will hear the news from two different people, and therefore, two different stories.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;As an example say you are given the following as input:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/zcQim.png&quot; alt=&quot;Graph&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;Let's start by looking at &lt;code&gt;B&lt;/code&gt;.  She prefers to gossip for only 1 minute, so she will only be able to gossip with one friend.&lt;/p&gt;&#xA;&lt;p&gt;We know that she can't gossip with &lt;code&gt;D&lt;/code&gt;, as that breaks rule #4&lt;/p&gt;&#xA;&lt;p&gt;If we have &lt;code&gt;B&lt;/code&gt; gossip with &lt;code&gt;C&lt;/code&gt;, then &lt;code&gt;C&lt;/code&gt; will have 1 minute of gossipping left, and &lt;code&gt;A&lt;/code&gt; won't be able to fill his 2 minutes of gossipping needs.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, we know that &lt;code&gt;B&lt;/code&gt; must gossip with &lt;code&gt;A&lt;/code&gt; for 1 minute, and &lt;code&gt;A&lt;/code&gt; must gossip for 1 minute with &lt;code&gt;C&lt;/code&gt;.  &lt;code&gt;C&lt;/code&gt; and &lt;code&gt;D&lt;/code&gt; each have 1 minute of gossipping remaining, so they must both gossip with &lt;code&gt;E&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;E&lt;/code&gt; needs 2 more minutes of gossip.&lt;/p&gt;&#xA;&lt;p&gt;If &lt;code&gt;E&lt;/code&gt; gossips with &lt;code&gt;F&lt;/code&gt; for 2 minutes, then gossip can't ever reach &lt;code&gt;G&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If &lt;code&gt;E&lt;/code&gt; gossips with &lt;code&gt;F&lt;/code&gt; for 1 minute and &lt;code&gt;G&lt;/code&gt; for 1 minute, then &lt;code&gt;F&lt;/code&gt; must gossip with &lt;code&gt;H&lt;/code&gt; for 1 minute, and &lt;code&gt;H&lt;/code&gt; will then gossip with &lt;code&gt;G&lt;/code&gt; for 2 minutes.  This will create a circle, breaking rule #5.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, we know that &lt;code&gt;E&lt;/code&gt; gossips with &lt;code&gt;G&lt;/code&gt; for 2 minutes, &lt;code&gt;G&lt;/code&gt; gossips with &lt;code&gt;H&lt;/code&gt; for 1 minute, and &lt;code&gt;H&lt;/code&gt; gossips with &lt;code&gt;F&lt;/code&gt; for 2 minutes.&lt;/p&gt;&#xA;&lt;p&gt;Our final gossipping tree looks like:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/mDLUC.png&quot; alt=&quot;Tree&quot; /&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Input will be in the following format, and will be passed to your program via STDIN (or closest alternative):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Max_Gossip_Time [Node0_Ideal_Gossip_Time, Node1_Ideal_Gossip_Time, ...] [[Node0, Node1], [Node0, Node1], ...]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The second array passed is the friend list, and are integers that refer to the positions in Ideal_Gossip_Time array.&lt;/p&gt;&#xA;&lt;p&gt;The example above would be input as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2 [2, 1, 2, 1, 4, 2, 3, 3] [[0, 1], [0, 2], [1, 2], [1, 3], [2, 3], [2, 4], [3, 4], [4, 5], [4, 6], [5, 7], [6, 7]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output should be to STDIO (or closest alternative) in the following format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[Node0, Node1, Gossip_Time], [Node0, Node2, Gossip_Time], ...]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;On the above example, the output should be similar to:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[0, 1, 1], [0, 2, 1], [2, 4, 1], [3, 4, 1], [4, 6, 2], [5, 7, 2], [6, 7, 1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;On both input and output, the friend list can be in any order.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-27T18:36:11.457" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5235" PostTypeId="2" ParentId="5233" CreationDate="2015-05-15T03:57:16.583" Score="0" Body="&lt;p&gt;For scoring runtimes, I think you'll have a better time judging total number of steps on some test cases you provide than by asymptotic complexity. A numerical runtime score is easier to combine with a number of states to produce an overall score by some formula, though you need care in making the formula to make their be legitimate tradeoffs. Also, this incentivizes algorithms to improve constants as well big-O's.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2015-05-15T03:57:16.583" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5236" PostTypeId="2" ParentId="2140" CreationDate="2015-05-15T12:44:41.877" Score="1" Body="&lt;h1&gt;KotHgress&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;As everyone knows, the only way to make sure your voice is heard among a group of people is to shout louder than everyone else. This is especially true in KotHgress, a bureaucratic committee of PPCG bots.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;strong&gt;KotHgress Register&lt;/strong&gt; is a 1D string, at least 100 characters long, containing the minutes of each committee meeting. The only problem is that all the committee members talk at the same time, often shouting over each other, so that (like a typical committee), nothing ever gets done. However, since this is a committee of bots, efficiency is prized almost as much as volume.&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;p&gt;The Register for each meeting is a string of length &lt;code&gt;max(100, N_bot * 4)&lt;/code&gt;. At the beginning of each meeting, a committee member bot is pseudorandomly assigned an ascii character to be its voice, and 3 starting positions for its voice in the Register (initial index of 1), with each bot's positions having the same sum - for example, [1,4,100] and [5, 25, 75] could be starting positions.&lt;/p&gt;&#xA;&lt;p&gt;Each turn, a bot receives 20 points times the number of times its voice appears in the Register. The bot can spend any amount of its points to bid on positions in which to place its voice. A bot that does not spend all its points banks any remaining points towards its score for the round; points do not carry over to following rounds.&lt;/p&gt;&#xA;&lt;p&gt;Once all bids have been collected, each position is overwritten with the voice of the highest bidder, with ties for high bid causing no change in that position's current character. &lt;strong&gt;Note: a bot that is outbid for a position it already occupies loses that position.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Then, each bot accumulates score equal to the combined rank of its voice characters in the Register (for example, &lt;code&gt;&amp;quot;ABABB&amp;quot;&lt;/code&gt; would score 4 for &lt;code&gt;&amp;quot;A&amp;quot;&lt;/code&gt; at rank 1 and 3, and 11 for &lt;code&gt;&amp;quot;B&amp;quot;&lt;/code&gt; at rank 2, 4, and 5), and the Register is sent as input to each member for them to choose their next bids.&lt;/p&gt;&#xA;&lt;p&gt;After 100 turns, the meeting is over, and the bot with the highest accumulated score wins the meeting.&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;Each turn, bot will receive four inputs, in this order:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;a single character which is its voice&lt;/li&gt;&#xA;&lt;li&gt;a positive integer indicating its current (banked) score&lt;/li&gt;&#xA;&lt;li&gt;a positive integer indicating the number of points it collected this turn&lt;/li&gt;&#xA;&lt;li&gt;a string of length &lt;code&gt;max(100, N_bot * 4)&lt;/code&gt;, the Register&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;The bot should output a string consisting of integer pairs, separated like so: &lt;code&gt;&amp;quot;pos0 bid0|pos1 bid1|...|posM bidM&amp;quot;&lt;/code&gt;. Banked points will be automatically calculated from the output: &lt;code&gt;banked_points = turn_points - sum(bids)&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Invalid output, including &lt;code&gt;sum(bids) &amp;gt; turn_points&lt;/code&gt;, will cause your bot to lose its turn (not banking any points).&lt;/p&gt;&#xA;&lt;h1&gt;Meta-notes&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Controller construction is in progress.&lt;/li&gt;&#xA;&lt;li&gt;I expect it to be language-agnostic (using a similar setup to aBOTcalypse). Bots will be allowed one storage file for memory purposes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="31863" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-19T02:42:59.410" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="5239" PostTypeId="2" ParentId="2140" CreationDate="2015-05-15T16:38:11.503" Score="1" Body="&lt;h1&gt;Traffic Troubles&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Background&lt;/h1&gt;&#xA;&lt;p&gt;Consider the following grid:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    a   b   c&#xA;    |   |   |&#xA;    |   |   |&#xA;    |   |   |&#xA;d---+---+---+---e&#xA;    |1  |2  |3&#xA;    |   |   |&#xA;    |   |   |&#xA;f---+---+---+---g&#xA;    |4  |5  |6&#xA;    |   |   |&#xA;    |   |   |&#xA;h---+---+---+---i&#xA;    |7  |8  |9&#xA;    |   |   |&#xA;    |   |   |&#xA;    j   k   l&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;I've marked every endpoint with a letter &lt;code&gt;a-l&lt;/code&gt;, and every &lt;code&gt;+&lt;/code&gt; with a number &lt;code&gt;1-9&lt;/code&gt;. Imagine, for a moment, that this grid represents a small section of a town. Each &lt;code&gt;|&lt;/code&gt; or &lt;code&gt;-&lt;/code&gt; represents one segment of a two-way road, and each &lt;code&gt;+&lt;/code&gt; represents an intersection, which will have a corresponding stoplight.&lt;/p&gt;&#xA;&lt;p&gt;During the game, cars will be added and removed from the grid at the endpoints &lt;code&gt;a-l&lt;/code&gt;. Cars move exactly one space (through one segment of road or through one intersection) per turn, and never change direction. Thus, if a car enters the grid at endpoint &lt;code&gt;d&lt;/code&gt;, it will exit after reaching endpoint &lt;code&gt;e&lt;/code&gt;. We may assume that the cars are smart enough to avoid all collisions. They will never move to a space occupied by another vehicle, and they will never enter an intersection when the stoplight they see is red. When a car reaches the opposite endpoint, it disappears and can be safely forgotten.&lt;/p&gt;&#xA;&lt;p&gt;Assume that we have a variable entitled &lt;code&gt;public_unhappiness&lt;/code&gt; that is initialized to &lt;code&gt;0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If a car following the above rules may not move due to another vehicle or a stoplight, the value of &lt;code&gt;public_unhappiness&lt;/code&gt; is increased by 1.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;//SANDBOX NOTE: This formula is linear, but one could say that unhappiness goes up exponentially the longer you sit at a stoplight. This formula is subject to change.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;We pit two bots against each other, both controlling traffic flow in different ways. One bot aims to maximize &lt;code&gt;public_unhappiness&lt;/code&gt; and the other aims to minimize it. We will refer to the former as &lt;em&gt;The Driver&lt;/em&gt; and the latter as &lt;em&gt;The Traffic Engineer&lt;/em&gt;. Because this KotH is inherently unbalanced, Drivers and Traffic Engineers will face off in a &lt;a href=&quot;http://en.wikipedia.org/wiki/Round-robin_tournament&quot; rel=&quot;nofollow noreferrer&quot;&gt;round-robin&lt;/a&gt; tournament (playing only against the opposing faction) and will be placed in separate leaderboards.&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;Though the bots are different and rely on entirely different strategies, &lt;strong&gt;every bot has access to the same information&lt;/strong&gt;. Every turn, the bots will be prompted with a list of command-line arguments. Below is a general format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;./Traffic_Troubles Your_bot.extension S1 S2 S3 S4 S5 S6 S7 S8 S9 N a,b,c a,b,c ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;S1&lt;/code&gt; through &lt;code&gt;S9&lt;/code&gt; are &lt;strong&gt;binary digits&lt;/strong&gt; that represent what direction traffic may flow through the corresponding stoplight. If the value is &lt;code&gt;1&lt;/code&gt;, traffic flows horizontally through this stoplight. If the value is &lt;code&gt;0&lt;/code&gt;, traffic flows vertically. Hence, a car approaching intersection &lt;code&gt;1&lt;/code&gt; from the east will stop moving if the value of &lt;code&gt;S1&lt;/code&gt; is a &lt;code&gt;0&lt;/code&gt;, and continue moving along if that value is a &lt;code&gt;1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The following argument is &lt;code&gt;N&lt;/code&gt;. This represents the number of cars currently active on the board.&lt;/p&gt;&#xA;&lt;p&gt;There then follows &lt;code&gt;N&lt;/code&gt; descriptions of cars in the form &lt;code&gt;a,b,c&lt;/code&gt;. Here, &lt;code&gt;a&lt;/code&gt; is the character of the endpoint that a car originated, &lt;code&gt;b&lt;/code&gt; is its destination, and &lt;code&gt;c&lt;/code&gt; is the number of spaces it has moved. A car that has just been put on endpoint &lt;code&gt;a&lt;/code&gt; has moved &lt;code&gt;0&lt;/code&gt; spaces, and would thusly be described as &lt;code&gt;a,j,0&lt;/code&gt;. On the other hand, a car approaching intersection &lt;code&gt;6&lt;/code&gt; from the west would be described as &lt;code&gt;f,g,11&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;On the first turn, every stoplight has value &lt;code&gt;0&lt;/code&gt;, and no cars exist on the board (&lt;code&gt;N == 0&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;//SANDBOX NOTE: This input seems pretty messy... Any ideas?&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h1&gt;The Traffic Engineer&lt;/h1&gt;&#xA;&lt;p&gt;Traffic Engineers aim to minimize &lt;code&gt;public_unhappiness&lt;/code&gt; by changing the values of the stoplights to allow for traffic to continue through.&lt;/p&gt;&#xA;&lt;p&gt;You may specify the values of up to three stoplights per turn. Every turn your bot is called, you must provide up to &lt;code&gt;3&lt;/code&gt; space-separated output pairs of the form &lt;code&gt;a,b&lt;/code&gt; where &lt;code&gt;a&lt;/code&gt; is the number of the spotlight you want to change, and &lt;code&gt;b&lt;/code&gt; will be a &lt;strong&gt;binary digit&lt;/strong&gt; representing the desired value of the stoplight. Invalid output will count as a change to the stoplights, but be ignored. You may choose to output any number of changes less than or equal to 3.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;//SANDBOX NOTE: The value of 3 is subject to change.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h1&gt;The Driver&lt;/h1&gt;&#xA;&lt;p&gt;Drivers aim to maximize &lt;code&gt;public_unhappiness&lt;/code&gt; by choosing entry points for cars.&lt;/p&gt;&#xA;&lt;p&gt;Every turn, you may output up to six distinct entry points for cars in the form &lt;code&gt;X Y Z ...&lt;/code&gt;. If a car already exists on that entry point &lt;em&gt;and is not moving in the opposite direction&lt;/em&gt; that output will be ignored. You may specify any number of entry points less than or equal to 6.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;//SANDBOX NOTE: The number 6 is subject to change&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h1&gt;The Sequence of Events&lt;/h1&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Both bots are called at roughly the same time with access to the exact same information.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Cars are added to the entry points and the value of stoplights are changed.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Cars move, and &lt;code&gt;public_unhappiness&lt;/code&gt; is incremented accordingly.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Any car that has surpassed its respective exit point is removed from play.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;em&gt;//SANDBOX NOTE: Perhaps the Traffic Engineer should be able to view where the Driver put cars and adjust accordingly. Thoughts?&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Your bot is given 1 second to respond.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may not tailor your bot to act specifically against another bot.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Please provide a method for compiling your bot and a command-line method for running your bot.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The header of your answer should be in this format:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;[Language-name] - [Traffic Engineer/Driver] - [Bot-name]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard Loopholes&lt;/a&gt; are disallowed.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;em&gt;//SANDBOX NOTE: If this idea is received well (~4-6 upvotes on the sandbox) I will build the controller. For now, it's just an idea. If you wish to run/improve on this KotH, you are welcome to.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="31054" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-15T16:38:11.503" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5240" PostTypeId="2" ParentId="5134" CreationDate="2015-05-15T16:46:47.000" Score="2" Body="&lt;h1&gt;Suggestion: Shared Libraries&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Motivation:&lt;/strong&gt; It would be nice to have access to functions like &lt;code&gt;printf&lt;/code&gt; and &lt;code&gt;scanf&lt;/code&gt; without having to re-write them each time. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;In thinking about how to compile C code to GOLF assembly, or writing an LLVM back-end, the issue of compiling separate modules and linking them together came up. Static libraries would be entirely a compiler issue, since the resulting binary would contain all the code it needed. But shared libraries could be implemented by the VM. I think they would have to be, if code can't modify other code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It would also be good if the VM would print different cycle counts for each library the cycles were spent in. For example, &lt;code&gt;2935 cycles in libc, 349,546 cycles in main&lt;/code&gt;. That way people would not have to compete on how efficient their standard library functions are. Standard loopholes would prohibit exploiting this by offloading computations to the stdlib. Or maybe it could all be counted together anyway since the cycles in main should dwarf the cycles spent in the stdlib. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am not sure how to go about implementing it. As it is now the binaries jump to offsets, not to labels. There would have to be an additional dynamic linking phase. Maybe the assembler could produce half-finished binaries (jumps to labels instead of offsets), and at run-time the VM assembles all the stdlibs together with the half-finished binary and converts the label jumps in the half-finished binary to offset jumps.&lt;/p&gt;&#xA;" OwnerUserId="4800" LastActivityDate="2015-05-15T16:46:47.000" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5243" PostTypeId="1" CreationDate="2015-05-16T15:54:54.600" Score="91" ViewCount="21805" Body="&lt;p&gt;&lt;em&gt;This is a list of unofficial, deadline-less (hence not searchable) bounties offered by users on various challenges on the main site.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Disclaimer&lt;/strong&gt;: There is no guarantee that the user will award the bounty for you in case you fulfill its requirement. Especially if the user isn't an active member anymore. The only guarantee is their written word.&lt;/p&gt;&#xA;&lt;hr&gt;&#xA;&lt;h1&gt;Guidelines for updating&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;To add a bounty, create an answer.&lt;/li&gt;&#xA;&lt;li&gt;Answers can be sorted to see which bounties are newest.&lt;/li&gt;&#xA;&lt;li&gt;Answers can be commented on, allowing someone to notify the bounty's creator that the bounty may have been earned.&lt;/li&gt;&#xA;&lt;li&gt;If a bounty is awarded, delete the answer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/search?q=inquestion%3A5243+user%3Ame&quot;&gt;Browse your current bounties&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="7311" LastEditorUserId="44998" LastEditDate="2021-11-18T15:19:20.957" LastActivityDate="2024-04-06T04:40:07.343" Title="List of bounties with no deadline" Tags="|discussion|bounty|" AnswerCount="76" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="5244" PostTypeId="1" AcceptedAnswerId="5246" CreationDate="2015-05-16T18:19:28.703" Score="4" ViewCount="156" Body="&lt;p&gt;I recently posted my first puzzle and was received with mixed responses. I know that the puzzle itself may look trivial, and in a way it is, but I think it's presented correctly, the objective is clear and the participation was actually not bad with 8 answers so far.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question is, why do people directly downvote a puzzle that is valid, and that people are participating on, this really does not encourage me to propose more puzzles.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since I'm new in codegolf, I can't see the downvote/upvote ratio but I was at -4 at some point and now I'm at 1, so I'm actually very confused.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/50270/quickgolf-heads-or-tails&quot;&gt;CodeGolf - Heads or Tails&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="19121" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-05-17T00:08:40.983" Title="Why the mixed response?" Tags="|discussion|rules|etiquette|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5246" PostTypeId="2" ParentId="5244" CreationDate="2015-05-17T00:08:40.983" Score="8" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Why the mixed response?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Because people have differing opinions on what constitutes a great challenge. What you presented was an exceptionally clear, well laid out challenge. However, the objective was just much simpler than is typical on this site. It's not a &lt;em&gt;bad&lt;/em&gt; objective, it's just very simple. Many people equate simplicity in objective with poor quality, hence down votes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that in my comment I said it's too simple to be an &lt;em&gt;interesting&lt;/em&gt; challenge, I never said it was a bad challenge. My recommendation to post to the Sandbox was not saying, &quot;This is crap, don't post here anymore,&quot; it was just a friendly recommendation to help you get a started with posting challenges.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Why the hatred?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;No hatred whatsoever. I like to think that PPCG is a very welcoming community overall. While down votes certainly do not seem welcoming, it's a user's way of saying, &quot;This can be improved&quot;; there's nothing personal about a down vote. And though you currently have 4 down votes, you also have 7 up votes, which is good! That means more people like your challenge than didn't like it. Even some of the greatest challenge makers here get down votes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Nobody here wants you to feel antagonized or unwelcome, and we certainly don't want you to give up on PPCG.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I recommend three things:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt;, where you can post your challenge ideas and get feedback. It can turn a good challenge into a great one.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Join us on in chat on &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;. The folks in there are always happy to help with any questions you might have.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Don't let your first experience posting a challenge here shape your view of PPCG or your outlook on posting challenges.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Welcome to PPCG. We hope you'll stick around.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-05-17T00:08:40.983" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5247" PostTypeId="1" AcceptedAnswerId="5248" CreationDate="2015-05-17T03:10:24.593" Score="11" ViewCount="204" Body="&lt;p&gt;Our chatroom &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; currently has 3 &lt;a href=&quot;http://chat.stackexchange.com/rooms/info/240/the-nineteenth-byte?tab=feeds&quot;&gt;message feeds&lt;/a&gt;. For example, when there is a new &lt;a href=&quot;https://codegolf.meta.stackexchange.com/&quot;&gt;meta&lt;/a&gt; post, it is automatically posted in chat.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do we want to have &lt;a href=&quot;https://codegolf.stackexchange.com/questions?sort=newest&quot;&gt;new questions from the main page&lt;/a&gt; be a new feed?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Note that feeds are not the same as chatbots per se. Anyone owner of a chatroom can add &lt;a href=&quot;https://meta.stackexchange.com/questions/151519/what-other-hidden-or-inobvious-rss-feeds-are-available-on-stackexchange-and-stac&quot;&gt;RSS feeds&lt;/a&gt; to it; SE chat specifically supports the feature.)&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="66833" LastEditDate="2021-06-19T00:02:32.140" LastActivityDate="2021-06-19T00:02:32.140" Title="Do we want new challenges auto posted in chat?" Tags="|discussion|feature-request|status-completed|chat|rss|" AnswerCount="3" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5248" PostTypeId="2" ParentId="5247" CreationDate="2015-05-17T03:11:13.657" Score="11" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;We should add posts to the main page to our chat feeds.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Reasons&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;People in chat will be aware of new challenges more readily&lt;/li&gt;&#xA;&lt;li&gt;People who join chat a while after the challenge is posted will also be informed of the recently posted challenge&lt;/li&gt;&#xA;&lt;li&gt;(add more if desired)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-18T02:25:19.820" CommentCount="0" CommunityOwnedDate="2015-05-17T03:11:13.657" ContentLicense="CC BY-SA 3.0" />
  <row Id="5249" PostTypeId="2" ParentId="5247" CreationDate="2015-05-17T03:12:17.330" Score="-5" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;We should &lt;strong&gt;not&lt;/strong&gt; add posts to the main page to our chat feeds.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Reasons&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;They will clog chat&lt;/li&gt;&#xA;&lt;li&gt;(add more if desired)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-17T03:12:17.330" CommentCount="2" CommunityOwnedDate="2015-05-17T03:12:17.330" ContentLicense="CC BY-SA 3.0" />
  <row Id="5251" PostTypeId="2" ParentId="5247" CreationDate="2015-05-17T12:06:10.243" Score="-4" Body="&lt;h1&gt;Yes, as an overlay feed&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We should add posts to the main page as a feed, but using an overlay feed instead of a chatbot. &lt;a href=&quot;https://i.stack.imgur.com/oUAf0.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;This is what it looks like.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Pros&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;People in chat will be aware of new challenges more readily.&lt;/li&gt;&#xA;&lt;li&gt;Less obtrusive than a chatbot.&lt;/li&gt;&#xA;&lt;li&gt;(add more if desired)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Cons&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Overlay feeds do not stay in chat history and can't be linked or referred back to&lt;/li&gt;&#xA;&lt;li&gt;(add more if desired)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="26997" LastEditDate="2015-05-17T18:58:44.943" LastActivityDate="2015-05-17T18:58:44.943" CommentCount="0" CommunityOwnedDate="2015-05-17T12:06:10.243" ContentLicense="CC BY-SA 3.0" />
  <row Id="5254" PostTypeId="2" ParentId="2140" CreationDate="2015-05-18T09:30:26.753" Score="1" Body="&lt;h1&gt;8-FTU - Retrofit UTF-8 to any pre-1988 language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The design of Unicode started in 1987 and was first published in 1988. UTF-8 itself was designed in 1992 and first presented in 1993. Your goal is to retrofit the UTF-8 encoding of Unicode to any language that was in existence on 31 December 1987. You can't use any features that were added to the language after this date.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program will take a text input (byte encoded characters, possibly with errors) and up to two integers. Your program must accept any value at any byte position (&lt;code&gt;00&lt;/code&gt;-&lt;code&gt;FF&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Task 1 - Validate the input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your program will print one of &lt;code&gt;TRUE&lt;/code&gt;/&lt;code&gt;FALSE&lt;/code&gt;, &lt;code&gt;True&lt;/code&gt;/&lt;code&gt;False&lt;/code&gt; or &lt;code&gt;true&lt;/code&gt;/&lt;code&gt;false&lt;/code&gt; depending on whether the text is valid UTF-8 or not, and exit if the format is not valid. See below for validation rules. There are also many online resources that cover the format that you can reference.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Task 2 - Count the code points&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If your program didn't exit at the end of Task 1, it will print the number of Unicode code points encoded within the text.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Task 3 - Substring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Using the two integer inputs your program will find and output the matching substring. The first integer will be the starting position, &lt;code&gt;0&lt;/code&gt; will be the start of the string. If the starting position is after the end of the string, return an empty string. The second integer will be the length of the substring in Unicode code points. If the length is omitted or goes past the end of the string return all the text from the start position to the end of the string. You do not need to program for negative numbers, although you can if you want to.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Tasks 1 &amp;amp; 2 must be printed to standard output.&#xA;If printing the output of Task 3 would have undesirable consequences (e.g. characters interpreted as control codes) you may return the text instead. You don't have to worry about how the text will display, your code will be taken by DeLorean or TARDIS (depending on country) to 1987 or earlier where a team of engineers will work on displaying it correctly!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Valid encodings&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  Code points        Byte encoding&#xA;---------------    -----------------&#xA;U+0000 - U+007F    Standard 7-bit ASCII (00 - 7F)&#xA;U+0080 - U+07FF    Two bytes per code point (C2 80 - DF BF)&#xA;U+0800 - U+D7FF    Three bytes per code point (E0 A0 00 - ED 9F BF)&#xA;U+D800 - U+DFFF    High and low surrogate pairs, invalid in UTF-8 (ED A0 80 - ED BF BF)&#xA;U+E000 - U+FFFF    Three bytes per code point (EE 80 80 - EF BF BF)&#xA;U+010000 - U+10FFFF    Four bytes per code point (F0 80 80 80 - F4 8F BF BF)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Byte table&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;00 - 7F&lt;/strong&gt;:    Standard 7-bit ASCII&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;80 - BF&lt;/strong&gt;:    Continuation bytes&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;C0 - C1&lt;/strong&gt;:    Invalid - Task 1 must print one of the false messages if either of these bytes are present&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;C2 - DF&lt;/strong&gt;:    Start of two-byte code&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;E0 - EF&lt;/strong&gt;:    Start of three-byte code. &lt;code&gt;ED&lt;/code&gt; codes where the next byte is one of  &lt;code&gt;A0&lt;/code&gt;-&lt;code&gt;BF&lt;/code&gt; are invalid because they encode surrogate pairs&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;F0 - F4&lt;/strong&gt;:    Start of four-byte code. Note: not all sequences starting with F4 are valid. You need to test for these too&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;F5 - FF&lt;/strong&gt;:    Invalid - Task 1 must print one of the false messages if any of these bytes are present&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The remainder of a multi-byte code must only be continuation bytes until the length is reached. E.g. &lt;code&gt;E4 85 B9&lt;/code&gt; is valid because &lt;code&gt;E4&lt;/code&gt; marks the start of a three byte code, there are exactly three bytes and &lt;code&gt;85&lt;/code&gt; and &lt;code&gt;B9&lt;/code&gt; are both within the range &lt;code&gt;80&lt;/code&gt;-&lt;code&gt;BF&lt;/code&gt;. A continuation byte must not appear except as part of a multi-byte sequence, which must start with &lt;code&gt;C2&lt;/code&gt;-&lt;code&gt;F4&lt;/code&gt;. Long encodings are not allowed. E.g. &quot;A&quot; is &lt;code&gt;41&lt;/code&gt;, which could also be encoded as &lt;code&gt;C1 81&lt;/code&gt; or &lt;code&gt;E0 81 81&lt;/code&gt;. These longer sequences are invalid because there is a shorter, valid sequence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You don't need to worry about the BOM code point &lt;code&gt;U+FEFF&lt;/code&gt; (&lt;code&gt;EF BB BF&lt;/code&gt;). Treat it as any other character even if it appears within the text.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example input (to be expanded)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;C3 87 61 20 76 61 3F&lt;/code&gt; 0 2 (&lt;code&gt;Ça va?&lt;/code&gt;, 7 bytes, 6 code points)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Outputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;True&#xA;6&#xA;Ça&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;C3 87 61 20 76 61 3F&lt;/code&gt; 2 (&lt;code&gt;Ça va?&lt;/code&gt;, 7 bytes, 6 code points)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Outputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;True&#xA;6&#xA; va?&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;C1 87 61 20 76 61 3F&lt;/code&gt; 0 2 (&lt;code&gt;Ga va?&lt;/code&gt;, 7 bytes (overlong error), 6 code points)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Outputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;False&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As mentioned above, the output for Task 3 may be returned as a string instead of printing it.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Either shortest code in bytes or a bonus awarded for retrofitting an older language. Maybe bytes minus the number of months before January 1988, assuming a release date of December if not otherwise specified?&lt;/p&gt;&#xA;" OwnerUserId="29560" LastActivityDate="2015-05-18T09:30:26.753" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5255" PostTypeId="2" ParentId="2140" CreationDate="2015-05-18T11:51:16.630" Score="0" Body="&lt;h1&gt;Kaos Pendulum and Einstein's Revenge&lt;/h1&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;http://en.wikipedia.org/wiki/Double_pendulum&quot; rel=&quot;nofollow noreferrer&quot;&gt;Double Pendulum system&lt;/a&gt; is a relatively simple system with quite complex behavior that's highly sensitive to initial conditions (i.e., &amp;quot;chaotic&amp;quot;).&lt;/p&gt;&#xA;&lt;p&gt;Doctor Kaos has designed a particularly fiendish double pendulum, using his diabolical machine &amp;quot;Einstein's Revenge&amp;quot;. Einstein's Revenge is a device which couples matter and energy, causing the mass of the first pendulum (connected to the anchor point) to be a function of the energy of the second: &lt;code&gt;m1 = sqrt(PE2**2 + KE2**2)&lt;/code&gt;, with the potential energy measured from the rest position of the pendulum.&lt;/p&gt;&#xA;&lt;p&gt;For this challenge, you must write a program or function to simulate a basic Kaos Pendulum, where the second pendulum has unit mass and both pendulums are unit length. It must accept the starting position of the Pendulum - two real numbers, &lt;code&gt;theta1&lt;/code&gt; and &lt;code&gt;theta2&lt;/code&gt; - as input or command-line arguments, and one positive integer equal to the number of seconds the pendulum will be active.&lt;/p&gt;&#xA;&lt;p&gt;Your program must output the value of &lt;code&gt;theta1&lt;/code&gt; and &lt;code&gt;theta2&lt;/code&gt; for each second, either printing to stdout or returning as a list, or something similar.&lt;/p&gt;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&lt;p&gt;I don't know if this should be a golf, a popularity contest, or if there should be some scoring method for some other type of challenge.&lt;/p&gt;&#xA;" OwnerUserId="31863" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-18T12:03:04.350" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5256" PostTypeId="2" ParentId="2140" CreationDate="2015-05-18T14:00:13.720" Score="2" Body="&lt;h1&gt;Matchstick Equations&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task in this challenge is to analyize a given &quot;Matchstick Equation&quot; like this one...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/PEHMb.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;... and to find out whether it can be turned into a valid equation by rearranging the matches. If so, you are to output the least number of moves to do so and the resulting equation.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input is a String that can be read from STDIN, taken as a function argument or even be stored in a file. It is an equation that represents a matchstick arrangement and can be described using the following EBNF:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input = term, &quot;=&quot;, term ;&#xA;term = number | (term, (&quot;+&quot; | &quot;-&quot;), term) ;&#xA;number = &quot;0&quot; | (numeralExceptZero , {numeral}) ;&#xA;numeralExceptZero = &quot;1&quot; | &quot;2&quot; | &quot;3&quot; | &quot;4&quot; | &quot;5&quot; | &quot;6&quot; | &quot;7&quot; | &quot;8&quot; | &quot;9&quot; ;&#xA;numeral = &quot;0&quot; | numeralExceptZero ;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;An example for a valid input would be &lt;code&gt;3+6-201=0+0+8&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Consider the following illustration where each matchstick has a number assigned:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/1MoBT.png&quot; alt=&quot;matchstick positions&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We now map each input symbol to the corresponding matchstick positions as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 ↦ 4,5&#xA;2 ↦ 2,3,5,6,8&#xA;3 ↦ 3,4,5,6,8&#xA;4 ↦ 1,4,5,8&#xA;5 ↦ 1,3,4,6,8&#xA;6 ↦ 1,2,3,4,6,8&#xA;7 ↦ 4,5,6&#xA;8 ↦ 1,2,3,4,5,6,8&#xA;9 ↦ 1,3,4,5,6,8&#xA;- ↦ 8&#xA;+ ↦ 8,10&#xA;= ↦ 7,9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Each input formula can be turned into a matchstick arrangement. For example, the equation &quot;45+6=92&quot; becomes&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/LLsfJ.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;where unused matchsticks are greyed out.&#xA;Your task is to find out the least number of matchsticks that have to be rearranged in order to make the equation valid. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We distinguish between three possible cases:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the input is not valid (i.e. it doesn't satisfy the above EBNF), output whatever you want.&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, if there are ways to turn the equation into a valid one by rearranging the matchsticks, you have to output &lt;em&gt;both&lt;/em&gt; the minimum number of rearrangements &lt;em&gt;and&lt;/em&gt; the corresponding equation. Just as the input, the outputted equation must also satisfy the given EBNF. In the above example, the correct output would be &#xA;&lt;code&gt;1&lt;/code&gt; and &lt;code&gt;46+6=52&lt;/code&gt;. If there are multiple possibilities for the resulting equation, output any of them.&lt;/li&gt;&#xA;&lt;li&gt;Otherwise (so if the input is valid but there is no way to make the equation true), you have to output &lt;code&gt;-1&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Details&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You are not allowed to remove or to add matches. That means, if the input is built of &lt;code&gt;n&lt;/code&gt; matchsticks, the output must also consist of exactly &lt;code&gt;n&lt;/code&gt; matchsticks.&lt;/li&gt;&#xA;&lt;li&gt;&quot;Empty&quot; matchstick-blocks are only allowed at the end and the beginning of an equation, not in the middle. So, for example, turning &lt;code&gt;7-1=6&lt;/code&gt; into &lt;code&gt;7  =6-1&lt;/code&gt; by simply removing &lt;code&gt;-1&lt;/code&gt; from the left side and adding it on the right side with just 3 matchstick rearrangements is not allowed. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; &lt;code&gt;1+1=3&lt;/code&gt; ↦ &lt;strong&gt;Output:&lt;/strong&gt; &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;1+1=2&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; &lt;code&gt;15+6=21&lt;/code&gt; ↦ &lt;strong&gt;Output:&lt;/strong&gt; &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;15+6=21&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; &lt;code&gt;1=7&lt;/code&gt; ↦ &lt;strong&gt;Output:&lt;/strong&gt; &lt;code&gt;-1&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; &lt;code&gt;950-250=750&lt;/code&gt; ↦ &lt;strong&gt;Output:&lt;/strong&gt; &lt;code&gt;2&lt;/code&gt; and &lt;code&gt;990-240=750&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; &lt;code&gt;1-2=9&lt;/code&gt; ↦ &lt;strong&gt;Output:&lt;/strong&gt; &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;1+2=3&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; &lt;code&gt;20 + 3=04&lt;/code&gt; ↦ &lt;strong&gt;Output:&lt;/strong&gt; anything&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winner&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest correct answer (in bytes) wins. The winner will be chosen one week after the first correct answer is posted.&lt;/p&gt;&#xA;" OwnerUserId="24898" LastEditorUserId="24898" LastEditDate="2015-05-18T18:40:59.673" LastActivityDate="2015-05-18T18:40:59.673" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5258" PostTypeId="2" ParentId="2140" CreationDate="2015-05-18T17:25:58.617" Score="3" Body="&lt;h1&gt;Sorting Source Code &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task in this challenge is to write a program that takes no input and outputs &lt;code&gt;This program consists of&lt;/code&gt; followed by your program's source code characters, but in alphabetical order.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Details&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may only use printable ASCII characters and line breaks in your program. &lt;/li&gt;&#xA;&lt;li&gt;When outputting all source code characters, ignore line breaks and sort all characters by their &lt;a href=&quot;https://en.wikipedia.org/wiki/ASCII#ASCII_printable_code_chart&quot; rel=&quot;nofollow noreferrer&quot;&gt;ASCII number&lt;/a&gt; from lowest to highest.&lt;/li&gt;&#xA;&lt;li&gt;Reading your program's source code is not allowed.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest valid submission (in bytes) wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Here is a correctly ordered list of all printable ASCII characters (mind the space at the very beginning):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; !&quot;#$%&amp;amp;'()*+,-./0123456789:;&amp;lt;=&amp;gt;?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If the source code for your program is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;print 'This program consists of ';&#xA;print this.sort();&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;then output must be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;This program consists of       ''().;;Tacfghhiiiiimnnnooooppprrrrrssssssttttt&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="24898" LastEditorUserId="24898" LastEditDate="2015-05-18T19:39:45.433" LastActivityDate="2015-05-18T19:39:45.433" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="5260" PostTypeId="2" ParentId="2140" CreationDate="2015-05-18T21:40:49.863" Score="-2" Body="&lt;h1&gt;Ayn Random number generator&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Inspired by xkcd 1277:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/m5eZx.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;Write a random number generator that takes no input and generates a random integer between 1 and 100. When run less than 200 times, the frequency of all numbers needs to be between 0 and 2, but when it's ran 50 000 times, the number 42 (obviously) should have a frequence that's more than 4 standard deviations higher than the mean.&lt;/p&gt;&#xA;&lt;p&gt;Format is code-golf. Your score is the bytecount of your code.&lt;/p&gt;&#xA;" OwnerUserId="14141" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-06T13:03:10.887" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5263" PostTypeId="2" ParentId="2140" CreationDate="2015-05-19T03:22:43.570" Score="4" Body="&lt;h1&gt;The Predator of my Predator is my Prey&lt;/h1&gt;&#xA;&lt;h3&gt;(Three Team KotH)&lt;/h3&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Three teams: Red, Green, Blue&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Red kills Green&lt;/li&gt;&#xA;&lt;li&gt;Green kills Blue&lt;/li&gt;&#xA;&lt;li&gt;Blue kills Red&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;As in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/48353/red-vs-blue-pixel-team-battlebots&quot; title=&quot;Pixel Team Battlebots&quot;&gt;Red vs Blue&lt;/a&gt;, each entrant is assigned a colour based on their userid. Your objective is to ensure your team has the most surviving members at the end of the game.&lt;/p&gt;&#xA;&lt;p&gt;The rules are simple but the dynamics may not be obvious. For example, wiping out your prey colour early on seems like success, but it leaves your predator colour with no predators of their own, and free to wipe you out. This means early on it may be better to herd your prey rather than kill them, but this could back-fire if your team leaves it too late...&lt;/p&gt;&#xA;&lt;h2&gt;Possible game styles&lt;/h2&gt;&#xA;&lt;p&gt;Whatever the style, when a Red bot touches a Green bot, the Green bot becomes a Red bot (the bot's code is replaced by its attacker's code). The total number of bots is therefore constant throughout the game. There are a number of settings in which such a game could be played:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;pixels in an open arena (like Red vs Blue)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;pixels in an arena with obstacles/walls/mazes&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;bots in a continuous arena (no grid), free to turn smoothly through 360 degrees&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I like the idea of a continuous arena, and bots only seeing a small radius semi-disc ahead of them. With no vision behind them they would have to either turn regularly, or coordinate with their team mates to get more information on their surroundings. Bots would be able to write messages and read the messages of other bots on the same team.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Stack Snippet / full multi-language KotH?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;which of the game styles suggested would be most interesting?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-19T03:35:54.367" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5266" PostTypeId="2" ParentId="2140" CreationDate="2015-05-19T13:59:50.133" Score="1" Body="&lt;h1&gt;Time Travel in KotH&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is not a question but a possible mechanic for KotH (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;type challenge).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In KotH we can ask each program (player) to store all its memory in a file between steps. This makes it possible to change a player's memory to an older one which is not possible with human players. This fact makes it possible to crate time-traveling based games.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I will outline to mechanics here, a simpler one (Time Reverters) and a more complex one (Time Travelers). Both will use a simple game to show how they would work.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Time Reverters (mechanic I)&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;A very simple example game&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Two players, &lt;code&gt;N&lt;/code&gt; rounds.&lt;/li&gt;&#xA;&lt;li&gt;At every round a random player scores a point.&lt;/li&gt;&#xA;&lt;li&gt;The winner is the player with more points after round &lt;code&gt;N&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;The time reverse twist&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;At any time in the game a player can chose to time travel (TT) back to any previous round. This means the players will receive the memory they had at that round and forget everything else. Neither of them will know a TT happened.&lt;/li&gt;&#xA;&lt;li&gt;Each player can TT &lt;code&gt;K&lt;/code&gt; times and this is counted by the controller. If a player tries to travel when it has no more travels left, the TT request is simply ignored.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Time Travellers (mechanic II)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(will be written later...)&lt;/p&gt;&#xA;" OwnerUserId="7311" LastActivityDate="2015-05-19T13:59:50.133" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5267" PostTypeId="2" ParentId="2140" CreationDate="2015-05-19T15:18:19.170" Score="3" Body="&lt;p&gt;Strange question about transit schematics (title tbd)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge, your goal is to produce a schematic diagram of a transit network, given a list of lines and a list of stations as input. This is a popularity-contest -- the program's goal is to maximize the readability of the diagram by carefully choosing where to draw the stations and lines.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each line in the transit network is formatted as a list of strings. For instance:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;Peel Line&quot;, &quot;Douglas&quot;, &quot;Port Erin&quot;, &quot;Braddan Halt&quot;, &quot;Union Mill&quot;, &quot;Crosby&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The first string on the list is the name of the line. The remaining strings are the stations that that particular line stops at. In this example the Peel Line stops at Douglas, Port Erin, Braddan Halt, Union Mill, and terminates at Crosby. The lines are bidirectional so the Peel Line would also go back the other way. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, most transit networks will have more than one line. Each line of the transit network will have its own line in the input. For instance:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;Peel Line&quot;, &quot;Douglas&quot;, &quot;Port Erin&quot;, &quot;Braddan Halt&quot;, &quot;Union Mill&quot;, &quot;Crosby&quot;&#xA;&quot;Foxdale Line&quot;, &quot;Ramsey&quot;, &quot;St. John's&quot;, &quot;Union Mill&quot;, &quot;Bishop&quot;, &quot;Foxdale&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Notice how both lines stop at Union Mill. This means that Union Mill is an interchange station for those two lines. A station is an interchange station if more than one line stops at it. Here is an attempt at what the network might look like:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/O59rm.png&quot; alt=&quot;bad map&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This map does some things well but fails at other things. The lines are coloured different colours which helps differentiate the lines. In addition, the interchange station is emphasised with the white dot to show it is an interchange station. However, it fails at other things, the most prominent being that the text &quot;Union Mill&quot; is overlapping the line, and there is a lack of a key showing which line is which. When we fix these elements the map looks like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Rk7Qk.png&quot; alt=&quot;another map!&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Much better! (Another way I could have resolved the Union Mill overlapping issue was to change the paths of the lines.) In addition, we can also have  lines being a loop. This is indicated by the first and last train stations being the same. For instance:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;Island Line&quot;, &quot;Port Erin&quot;, &quot;Kitterland&quot;, &quot;Kalfr&quot;, &quot;Ardglass&quot;, &quot;Kearney&quot;, &quot;Port Erin&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The Island Line in this case is a loop that goes from Port Erin to Kitterland to Kalfr, then to Ardglass and Kearney, before finally returning to Port Erin, completing the loop.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With more complicated train networks, it becomes more difficult to arrange the stations and lines in a readable manner. Here are some inputs of varying complexity and density to try your program on. Some of them are based of actual networks, while others are made up for this challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Challenge Input 1: Oslo, Norway:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;1&quot;, &quot;Frognerseteren&quot;, &quot;Voksenkollen&quot;, &quot;Lillevann&quot;, &quot;Skogen&quot;, &quot;Voksenlia&quot;, &quot;Holmenkollen&quot;, &quot;Besserud&quot;, &quot;Midtstuen&quot;, &quot;Skådalen&quot;, &quot;Vettakollen&quot;, &quot;Gulleråsen&quot;, &quot;Gråkammen&quot;, &quot;Slemdal&quot;, &quot;Ris&quot;, &quot;Gaustad&quot;, &quot;Vinderen&quot;, &quot;Steinerud&quot;, &quot;Frøen&quot;, &quot;Majorstuen&quot;, &quot;Nationaltheatret&quot;, &quot;Stortinget&quot;, &quot;Jernbanetorget (Oslo S)&quot;, &quot;Grønland&quot;, &quot;Tøyen&quot;, &quot;Ensjø&quot;, &quot;Helsfyr&quot;, &quot;Brynseng&quot;, &quot;Hellerud&quot;, &quot;Tveita&quot;, &quot;Haugerud&quot;, &quot;Trosterud&quot;, &quot;Lindeberg&quot;, &quot;Furuset&quot;, &quot;Ellingsrudåsen&quot;&#xA;&quot;2&quot;, &quot;Østerås&quot;, &quot;Lijordet&quot;, &quot;Eiksmarka&quot;, &quot;Ekravein&quot;, &quot;Røa&quot;, &quot;Hovseter&quot;, &quot;Holmen&quot;, &quot;Makrellbekken&quot;, &quot;Smestad&quot;, &quot;Borgen&quot;, &quot;Majorstuen&quot;, &quot;Nationaltheatret&quot;, &quot;Stortinget&quot;, &quot;Jernbanetorget (Oslo S)&quot;, &quot;Grønland&quot;, &quot;Tøyen&quot;, &quot;Ensjø&quot;, &quot;Helsfyr&quot;, &quot;Brynseng&quot;, &quot;Hellerud&quot;, &quot;Tveita&quot;, &quot;Haugerud&quot;, &quot;Trosterud&quot;, &quot;Lindeberg&quot;, &quot;Furuset&quot;, &quot;Ellingsrudåsen&quot;&#xA;&quot;3&quot;, &quot;Mortensrud&quot;, &quot;Skullerud&quot;, &quot;Bogerud&quot;, &quot;Bøler&quot;, &quot;Ulsrud&quot;, &quot;Oppsal&quot;, &quot;Skøyenåsen&quot;, &quot;Godlia&quot;, &quot;Hellerud&quot;, &quot;Brynseng&quot;, &quot;Helsfyr&quot;, &quot;Ensjø&quot;, &quot;Tøyen&quot;, &quot;Grønland&quot;, &quot;Jernbanetorget (Oslo S)&quot;, &quot;Stortinget&quot;, &quot;Nationaltheatret&quot;, &quot;Majorstuen&quot;, &quot;Blindern&quot;, &quot;Forskningsparken&quot;, &quot;Ullevål stadion&quot;, &quot;Berg&quot;, &quot;Tåsen&quot;, &quot;Østhorn&quot;, &quot;Holstein&quot;, &quot;Kringsjå&quot;, &quot;Sognsvann&quot;&#xA;&quot;4&quot;, &quot;Storo&quot;, &quot;Nydalen&quot;, &quot;Ullevål stadion&quot;, &quot;Forskningsparken&quot;, &quot;Blindern&quot;, &quot;Majorstuen&quot;, &quot;Nationaltheatret&quot;, &quot;Stortinget&quot;, &quot;Jernbanetorget (Oslo S)&quot;, &quot;Grønland&quot;, &quot;Tøyen&quot;, &quot;Ensjø&quot;, &quot;Helsfyr&quot;, &quot;Brynseng&quot;, &quot;Høyenhall&quot;, &quot;Manglerud&quot;, &quot;Ryen&quot;, &quot;Brattlikollen&quot;, &quot;Karlsrud&quot;, &quot;Lambertseter&quot;, &quot;Munkelia&quot;, &quot;Bergkrystallen&quot;&#xA;&quot;5&quot;, &quot;Storo&quot;, &quot;Nydalen&quot;, &quot;Ullevål stadion&quot;, &quot;Forskningsparken&quot;, &quot;Blindern&quot;, &quot;Majorstuen&quot;, &quot;Nationaltheatret&quot;, &quot;Stortinget&quot;, &quot;Jernbanetorget (Oslo S)&quot;, &quot;Grønland&quot;, &quot;Tøyen&quot;, &quot;Carl Berners plass&quot;, &quot;Hasle&quot;, &quot;Økern&quot;, &quot;Risløkka&quot;, &quot;Vollebekk&quot;, &quot;Linderud&quot;, &quot;Veitvet&quot;, &quot;Rødtvet&quot;, &quot;Kalbakken&quot;, &quot;Ammerud&quot;, &quot;Grorud&quot;, &quot;Romsås&quot;, &quot;Rommen&quot;, &quot;Stovner&quot;, &quot;Vestli&quot;&#xA;&quot;6&quot;, &quot;Bekkestua&quot;, &quot;Ringstabekk&quot;, &quot;Jar&quot;, &quot;Bjørnsletta&quot;, &quot;Åsjordet&quot;, &quot;Ullernåsen&quot;, &quot;Montebello&quot;, &quot;Smestad&quot;, &quot;Borgen&quot;, &quot;Majorstuen&quot;, &quot;Nationaltheatret&quot;, &quot;Stortinget&quot;, &quot;Jernbanetorget (Oslo S)&quot;, &quot;Grønland&quot;, &quot;Tøyen&quot;, &quot;Carl Berners plass&quot;, &quot;Sinsen&quot;, &quot;Storo&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here's what the official map looks like for some inspiration (click to enlarge):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Cu1u2.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Cu1u2.jpg&quot; alt=&quot;OSLO!!!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;TODO: more challenge inputs coming!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox Notes&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I've had this one sitting around for a while. I've wanted to try and make a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; that wasn't just about making the prettiest image. So instead it's about making the most functional image, which I'm not sure is any better than the art challenges... &lt;/li&gt;&#xA;&lt;li&gt;Another thing I've been considering is changing it to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. I'd have minimum requirements for the final output (a key, coloured lines, distinguished interchange stations, etc.) and the shortest code that implemented all the requirements would win. I'd like your thoughts on whether this challenge would work better as code golf or popularity contest.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="21682" LastEditDate="2015-05-21T12:30:23.000" LastActivityDate="2015-05-21T12:30:23.000" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5268" PostTypeId="1" CreationDate="2015-05-19T16:02:37.323" Score="9" ViewCount="155" Body="&lt;p&gt;We currently have 4 &lt;a href=&quot;https://codegolf.stackexchange.com/questions/36978/whats-wrong-with-public-variables&quot;&gt;King&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37308/codebots-2-event-driven-design&quot;&gt;of&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/36645/brainfedbotsforbattling-a-brainf-tournament?rq=1&quot;&gt;the&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/47581/the-nano-core-war?rq=1&quot;&gt;Hill&lt;/a&gt; challenges that involve modifying opponent's code in order to win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;They are quite unique, and in hopes that people will create more of them, I think it is a good idea to create a tag for it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we create a tag for these types of challenges, and if so, what should the tag be?&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-05-19T16:26:55.483" Title="New Tag for Code-Modifying Challenges" Tags="|discussion|tags|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5269" PostTypeId="2" ParentId="5268" CreationDate="2015-05-19T16:04:19.830" Score="14" Body="&lt;p&gt;There shouldn't be a tag, because of any of the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There aren't enough challenges&lt;/li&gt;&#xA;&lt;li&gt;It is too specific of a category&lt;/li&gt;&#xA;&lt;li&gt;Other reasons?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20198" LastActivityDate="2015-05-19T16:04:19.830" CommentCount="5" CommunityOwnedDate="2015-05-19T16:27:39.057" ContentLicense="CC BY-SA 3.0" />
  <row Id="5270" PostTypeId="2" ParentId="5268" CreationDate="2015-05-19T16:18:42.787" Score="-4" Body="&lt;p&gt;We should create a tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-battle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-battle&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-battle&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-05-19T16:18:42.787" CommentCount="0" CommunityOwnedDate="2015-05-19T16:18:42.787" ContentLicense="CC BY-SA 3.0" />
  <row Id="5271" PostTypeId="2" ParentId="5268" CreationDate="2015-05-19T16:26:55.483" Score="-7" Body="&lt;p&gt;We should use the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-fight&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-fight&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-fight&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="20198" LastActivityDate="2015-05-19T16:26:55.483" CommentCount="0" CommunityOwnedDate="2015-05-19T16:26:55.483" ContentLicense="CC BY-SA 3.0" />
  <row Id="5276" PostTypeId="2" ParentId="2140" CreationDate="2015-05-20T14:01:22.680" Score="4" Body="&lt;h1&gt;ASCII Art of the Day Series&lt;/h1&gt;&#xA;&lt;p&gt;My new found love for ASCII art has lead me to a lot of good (trivial and non-trivial) ideas for ASCII ART challenges. Here are the ideas :&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/50484/draw-an-ascii-double-knot&quot;&gt;&lt;em&gt;&lt;strong&gt;1. Double Knot&lt;/strong&gt;&lt;/em&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/50521/31414&quot;&gt;&lt;em&gt;&lt;strong&gt;2. Flow Snakes&lt;/strong&gt;&lt;/em&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/50625/ascii-art-of-the-day-3-chinese-shrines&quot;&gt;&lt;em&gt;&lt;strong&gt;3. Chinese Shrine&lt;/strong&gt;&lt;/em&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/51123/31414&quot;&gt;&lt;em&gt;&lt;strong&gt;4. Zodiac Signs&lt;/strong&gt;&lt;/em&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;6. Snow Flakes&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Its time for another ASCII Art of the Day. This time, we are going back to the winters and drawing Snow Flakes (not to be mixed up with &lt;a href=&quot;https://codegolf.stackexchange.com/q/50521/31414&quot;&gt;Flow Snakes&lt;/a&gt; ;) ). The snow flakes are generative based on random walk so each run should give a different pretty snow flake ASCII.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Given an input integer &lt;code&gt;N&lt;/code&gt;, draw an ASCII snow flake of radius &lt;code&gt;N&lt;/code&gt; using the construction instructions provided below.&lt;/p&gt;&#xA;&lt;h1&gt;Construction&lt;/h1&gt;&#xA;&lt;p&gt;The Snow Flake will have 6-fold rotational symmetry and 3-fold reflection symmetry. You will ideally only generate 1 out of the 12 wedges in a snow flake and then rotate/mirror them to get the other wedges.&lt;/p&gt;&#xA;&lt;p&gt;Lets consider the following snow flake for &lt;code&gt;N = 5&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;     \__    __/&#xA;     /_/ /\ \_\&#xA;    __ \ \/ / __&#xA;    \_\_\/\/_/_/&#xA;__/\___\_\/_/___/\__&#xA;  \/ __/_/\_\__ \/&#xA;    /_/ /\/\ \_\&#xA;     __/ /\ \__&#xA;     \_\ \/ /_/&#xA;     /        \&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Lets name its wedges as:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;       4      3&#xA;     5\__    __/2&#xA;      /_/ /\ \_\&#xA;     __ \ \/ / __&#xA;     \_\_\/\/_/_/&#xA;6__/\___\_\/_/___/\__1&#xA;7  \/ __/_/\_\__ \/  12&#xA;     /_/ /\/\ \_\&#xA;      __/ /\ \__&#xA;      \_\ \/ /_/&#xA;     8/        \11&#xA;       9     10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For creating the above snow flake, all we need is to first construct a single wedge (say 1) and fit others in place based on wedge 1.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Wedge Construction&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Lets consider the wedges 1 and 2 from the above example and shade all the blocks which belong to wedge 1 with &lt;code&gt;x&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    /2       x&#xA;   _\     xxx&#xA;  / __ xxxxx&#xA; /_/xxxxxxx&#xA;/xxxxxxxxx1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We can see that exactly 25 &lt;code&gt;x&lt;/code&gt; belong to wedge 1 in a 50 block trapezium of wedge 1 and 2. The height of the trapezium corresponds to the input integer &lt;code&gt;N&lt;/code&gt; and the base length of the trapezium is &lt;code&gt;2N&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;To construct the wedge 1, follow these instructions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use only the area marked for your wedge (For example, the &lt;code&gt;x&lt;/code&gt; area in the above image for wedge 1)&lt;/li&gt;&#xA;&lt;li&gt;Use uni-directional random walk to fill up the &lt;code&gt;x&lt;/code&gt; using the characters &lt;code&gt;/&lt;/code&gt;, &lt;code&gt;_&lt;/code&gt; and &lt;code&gt;\&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;There should be at least 1 path in the random walk which connects the left most &lt;code&gt;x&lt;/code&gt; with any one of the right most &lt;code&gt;x&lt;/code&gt; of each row.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;A few examples of valid random walks for wedge 1 are:&lt;/p&gt;&#xA;&lt;p&gt;[TBC]&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Random Ants&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is still a bit hazy but the challenge would involve making random ants out of the following ants:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; \_/&#xA;'-0-'&#xA;--0--&#xA;.-0-.&#xA;&#xA; \_/&#xA;'-0-'&#xA;--0--&#xA;.-0-.&#xA;&#xA; \_/&#xA;'-0-'&#xA;--0--&#xA;.-0-.&#xA;&#xA;&#xA; \O/&#xA;'-O-'&#xA; /o\&#xA;  ^&#xA;&#xA; \O/&#xA;'-O-'&#xA; /o\&#xA;  ^&#xA;&#xA; \O/&#xA;'-O-'&#xA; /o\&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Fish Aquarium&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&#xA;         .               `         /&#xA;                          .    ,../...       .&#xA;          .                .  /       `\  /  .&#xA;     \    .        o         &amp;lt; '  )     =&amp;lt;&#xA;     /\  .                    \ \      /  \   .  __&#xA;   &amp;gt;=)'&amp;gt;                       `'\'&amp;quot;'&amp;quot;'         /o \/&#xA;     \/ .    /         o              /,        \__/\    .:/&#xA;     /   .  /--\ /         /         &amp;lt;')=&amp;lt;     .      ,,///;,   ,;/&#xA;           &amp;lt;o)  =&amp;lt;      . / \         \`         .   o:::::::;;///&#xA;            \__/ \       &amp;lt;')_=&amp;lt;                     &amp;gt;::::::::;;\\\&#xA;             \            \_/            .            ''\\\\\'' ';\&#xA;    (                      \              .   __&#xA;     )                                       &amp;lt;'_&amp;gt;&amp;lt;          (&#xA;    (          (                ,/..          `              )&#xA;     )     (    )             &amp;lt;')   `=&amp;lt;                )    (&#xA;    (       )  (               ``\```                 (      )&#xA;_____)_____(____)______________________________________)____(___________&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="31414" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-01T13:29:20.343" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5277" PostTypeId="2" ParentId="2140" CreationDate="2015-05-20T16:16:34.517" Score="2" Body="&lt;h1&gt;Formatting a Lisp-like Syntax&lt;/h1&gt;&#xA;&lt;h1&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/50580/formatting-a-lisp-like-syntax&quot;&gt;POSTED&lt;/a&gt;&lt;/strong&gt;&lt;/h1&gt;&#xA;" OwnerUserId="31054" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-21T15:04:35.617" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5279" PostTypeId="2" ParentId="2140" CreationDate="2015-05-20T18:24:06.313" Score="1" Body="&lt;h1&gt;Split multi-language no-space sentences&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You will be given a string representing a sentence without word any boundaries. Additionally, you're given a dictionary of all possible words. Output all possible possible ways of splitting the sentence into words.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But there's a catch! The sentence was written by a drunken polyglot and contains words from multiple languages mixed together. Luckily, you've already got a dictionary of which words from different languages cirrespond to each other. So for each word, you should output its &lt;code&gt;surface form&lt;/code&gt; (as it appears in the input sentence) and &lt;code&gt;base form&lt;/code&gt; (eg. English). To prevent meaningless interpretations of a sentence as many one-letter words and abbreviations, sort the output by the number of words of each interpretation, lowest first.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;teeistunnationalgetränkdeeikoku&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;tee/tea ist/is un/a national/national getränk/drink de/of eikoku/england&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Given the dictionary below, the first word  can only be &lt;code&gt;tee&lt;/code&gt;, German for &lt;code&gt;tea&lt;/code&gt;. Then comes &lt;code&gt;is&lt;/code&gt;, which is already the English &lt;code&gt;is&lt;/code&gt;.  Then &lt;code&gt;un&lt;/code&gt;, French for &lt;code&gt;a&lt;/code&gt;. And so on.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;tea =&gt; tea, tee, cha&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;is =&gt; is, ist, est, dess&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;a =&gt; a, ein, un, une, aru&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;national =&gt; national, kokkateki&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;drink =&gt; drink, getränk, nomimono&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;of =&gt; of, de, von, no&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;england =&gt; england, angleterre, igirisu, eikoku&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Each entry of the dictionary is of the form:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;base_form&amp;gt; =&amp;gt; &amp;lt;surface_form_1&amp;gt;, &amp;lt;surface_form_2&amp;gt;, ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;That is, the dictionary contains the base form (here English is used), and a list of possible variations in different languages for each.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See below for examples with multiple possibilities.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Code-golf.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Golfed explanation. Ungolfed: The answer with the shortest code as measured by its bytesize in an encoding the interpreter or compiler accepts without additional flags wins. Multiple files add a penalty of 1 byte for each additional file. Flags add to the score.)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The defaults apply, function or program.&lt;/li&gt;&#xA;&lt;li&gt;You may assume there exists at least one solution.&lt;/li&gt;&#xA;&lt;li&gt;Your program must run in a reasonable amount of time, so don't just try every possible combination of words. Be prepared for a dictionary that contains hundred or thousands of words. Let's say about ~10 minutes on a modern PC.&lt;/li&gt;&#xA;&lt;li&gt;You must support unicode, at least the &lt;a href=&quot;http://en.wikipedia.org/wiki/Plane_(Unicode)#Basic_Multilingual_Plane&quot; rel=&quot;nofollow&quot;&gt;basic multi-lingual plane&lt;/a&gt;, codepoints 0x0000 - 0xFFFF. If your language of choice does not support unicode, you can emulate it using a fixed-length unicode encoding: consider each n bytes of the input sentence a letter.&lt;/li&gt;&#xA;&lt;li&gt;You do not need to worry about unicode modifiers, normalizing etc. -- each codepoint is considered a unique &quot;letter&quot;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The defaults apply, &lt;code&gt;stdin&lt;/code&gt;, command line argument, function argument, javascript prompt etc.&lt;/li&gt;&#xA;&lt;li&gt;The input sentence is given as a string (&lt;code&gt;teaist&lt;/code&gt;) or list/array (&lt;code&gt;[t,e,a,i,s,t]&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;You may assume the input sentence is already in lower case.&lt;/li&gt;&#xA;&lt;li&gt;There is no additional punctuation in the input sentence to take care of.&lt;/li&gt;&#xA;&lt;li&gt;However, the input sentence and the dictionary may contain &quot;words&quot; with commas, periods, etc., ie. every unicode codepoint from the basic multilingual plane. It will not contain any of the codepoints 0x00-0x20, which means no null-bytes, spaces, tabs, newlines, so you can use them for separating the output.&lt;/li&gt;&#xA;&lt;li&gt;The dictionary may be in any format of your choice, but it must contain an association between a base form and all possible surface forms. It must not list all base forms for each surface form.&lt;/li&gt;&#xA;&lt;li&gt;You may also read the dictionary from a file, and take the file name or raw data as input.&lt;/li&gt;&#xA;&lt;li&gt;You may also assume the dictionary has already been stored in one variable of your choice. If you do, please provide some code for reference how I can put custom data in it, or read the dictionary from a file. However, it must not be pre-processed and as close to a hash (eg. &lt;code&gt;{&amp;lt;base_form&amp;gt; =&amp;gt; [ &amp;lt;surface_form_1&amp;gt;, &amp;lt;surface_form_2&amp;gt;, ... }&lt;/code&gt;) or array/list (eg. &lt;code&gt;[ [&amp;lt;base_form&amp;gt;,&amp;lt;surface_form_1&amp;gt;,&amp;lt;surface_form_2&amp;gt;,...], [&amp;lt;base_form&amp;gt;,...], ...]&lt;/code&gt;) as possible in your language.&lt;/li&gt;&#xA;&lt;li&gt;You may choose whether the list of surface forms includes the base form or not, eg. &lt;code&gt;big =&amp;gt; big, gross&lt;/code&gt; or &lt;code&gt;big =&amp;gt; gross&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The defaults apply, &lt;code&gt;stdout&lt;/code&gt;, &lt;code&gt;stderr&lt;/code&gt;, return value, javascript alert, etc.&lt;/li&gt;&#xA;&lt;li&gt;It should not need to be said, but if you output to &lt;code&gt;stderr&lt;/code&gt;, nothing else but the solution must go to &lt;code&gt;stderr&lt;/code&gt;, unless it's a compiler/interpreter warning that can be turned off by a flag.&lt;/li&gt;&#xA;&lt;li&gt;A list/array of all possible &lt;code&gt;interpretation&lt;/code&gt;s of splitting the sentence into words, sorted by the number of words.&lt;/li&gt;&#xA;&lt;li&gt;Each &lt;code&gt;interpretation&lt;/code&gt; is a list/array of &lt;code&gt;word&lt;/code&gt;s. Each word is pair/list/array containing the &lt;code&gt;surface&lt;/code&gt; form and the &lt;code&gt;base&lt;/code&gt;, you may choose in which order. The words must be ordered as they appear in the input sentence.&lt;/li&gt;&#xA;&lt;li&gt;Alternatively, the array may be flattened.&lt;/li&gt;&#xA;&lt;li&gt;Alternatively, output two lists/arrays, one containing the base form for each word, and one the surface form.&lt;/li&gt;&#xA;&lt;li&gt;Alternatively, output a string representation of the array/hash/list.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For example, you could output an array&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;[[&quot;tee&quot;,&quot;tea&quot;],[&quot;est&quot;,&quot;is&quot;]]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;or a flattened array&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;[&quot;tee&quot;,&quot;tea&quot;,&quot;est&quot;,&quot;is&quot;]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;or two arrays&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;[&quot;tee&quot;,&quot;est&quot;]&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;[&quot;tea&quot;,&quot;is&quot;]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;or a string representation such as &lt;code&gt;tee:tea:est:is&lt;/code&gt; or &lt;code&gt;tee\ttea\nest\tis\n&lt;/code&gt; (&lt;code&gt;\t&lt;/code&gt; tab, &lt;code&gt;\n&lt;/code&gt; newline). But make sure you're escaping characters properly.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;First line is the input string. Each following line is a possible way of placing word boundaries, &lt;code&gt;surface/base&lt;/code&gt;. Afterwards a sample dictionary is provided.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;1&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Note that some words contain a semi-colon.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;abcd;efghi&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;ab/test  cd;ef/awesome ghi/result&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;a/only bcd/test ;ef/awesome ghi/result&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;abcd;efgh/yahoo i/google&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;with the dictionary:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;test: ab, bcd&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;awesome: cd;ef, ;ef&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;result: ghi&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;only: a&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;yahoo: abcd;efgh&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;google: i&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;2&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;sumomouserune&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;sumo/sumo mouse/mouse rune/rune&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;sumomo/plum useru/lose ne/right&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;with the dictionary:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;sumo: sumo, mouse:mouse, rune: rune, plum: sumomo, lose: useru, right: ne&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;3&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;koukousensei&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;koukou/school sensei/teacher&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;koukou/shiptravel sensei/starfortunetelling&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;with the dictionary&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;school: koukou, teacher: sensei, shiptravel: koukou, starfortunetelling: sensei&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;4&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;unicode support:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;白雲&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;白/sira 雲/kumo&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;白/haku 雲/uñ&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;with the dictionary:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;sira:白, haku:白, kumo:雲, uñ:雲&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;5&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Note the order of the results.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;aaaa&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;aaaa/test&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;a/test aaa/test&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;aa/test aa/test&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;aaa/test a/test&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;a/test a/test aa/test&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;a/test aa/test a/test&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;aa/test a/test a/test&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;a/test a/test a/test a/test&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;with the dictionary:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;test: a, aa, aaa, aaaa&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'll add a larger example should I post this.&lt;/p&gt;&#xA;" OwnerUserId="26465" LastEditorUserId="26465" LastEditDate="2015-05-21T06:22:22.957" LastActivityDate="2015-05-21T06:22:22.957" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5281" PostTypeId="2" ParentId="2140" CreationDate="2015-05-20T21:42:15.510" Score="0" Body="&lt;h1&gt;Blind (deterministic) Jenga&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The idea for this came up in the chat room, under the broader topic of how to make a human dexterity game into a software KotH challenge. Here's the basic idea, which I don't think works, but I'd love to get feedback to make it better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/ehCOh.jpg&quot; alt=&quot;generic jenga tower&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The jenga tower has three blocks per layer. Layers alternate between N/S aligned blocks and E/W aligned blocks.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There may be just two players, or more than two.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each turn a player selects a block location to probe. If there's no block there, the player gets to go again. If there's a block there, it is removed from the stack. If this causes the tower to fall, the player loses. Otherwise, the block is placed in the next safe position at the top of the tower, unless all available positions are unsafe in which case the player loses. If the player has not lost, it is now the next player's turn. Continue until some player loses.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think this won't work well because it will boil down to a relatively random competition between bots that start with edge pieces and bots that start with center pieces. I don't want to run the contest just to find out that that's the case. Maybe putting four blocks per layer would make that a non-issue. I'm open to other suggestions on how to make this challenge work.&lt;/p&gt;&#xA;" OwnerUserId="4787" LastActivityDate="2015-05-20T21:42:15.510" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5286" PostTypeId="2" ParentId="5097" CreationDate="2015-05-21T12:40:23.263" Score="10" Body="&lt;p&gt;It just occurred to me that my suggested default tie breaker doesn't necessarily make sense for popularity contests. Therefore, I'd like to suggest an amendment to the accepted answer, and if this gets a reasonable amount of support I'll edit the accepted answer.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;In the case of popularity contests, if there is a tie, the &lt;strong&gt;latest answer wins&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This may seem counter-intuitive but my reasoning is this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If two answers have the same number of votes, the later answer must have accumulated them more quickly.&lt;/li&gt;&#xA;&lt;li&gt;In addition, the later answer also managed to catch up with the earlier one despite the &lt;a href=&quot;https://meta.stackexchange.com/q/18014/201409&quot;&gt;FGITW&lt;/a&gt; effect.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Both of these indicate that the latter answer is actually the more the popular of the two.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2015-05-21T12:40:23.263" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5290" PostTypeId="2" ParentId="2140" CreationDate="2015-05-22T08:28:52.803" Score="1" Body="&lt;h2&gt;Snake vs labyrinth&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program that takes as input a text file representing a labyrinth and checks if this labyrinth can be entirely filled with a snake path. The program should output &lt;code&gt;true&lt;/code&gt; or &lt;code&gt;1&lt;/code&gt; if this is the case, &lt;code&gt;false&lt;/code&gt; or &lt;code&gt;0&lt;/code&gt; else.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The snake can enter the labyrinth at any point. He can move one cell up, left, right or down; once he has crossed a cell of the grid, he cannot go back to that cell. The snake cannot cross a wall or the borders of the labyrinth.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The labyrinth file is a grid of m x n characters, containing either # (wall) or . (empty space).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 1&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;should return &lt;em&gt;true&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 2&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;should return &lt;em&gt;true&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;..&#xA;..&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Possible solution (S = snake start, E = snake end, v = go down, &amp;lt; = go left)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Sv&#xA;E&amp;lt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 3&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;should return &lt;em&gt;true&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;...&#xA;.#.&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Possible solution (S = snake start, E = snake end, v = go down, &amp;lt; = go left, &gt; = go right, ^ = go up)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;S&amp;gt;v&#xA;E#v&#xA;^&amp;lt;&amp;lt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 4&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;should return &lt;em&gt;false&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.#&#xA;#.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 5&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;should return &lt;em&gt;false&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#.#&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 6&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;should return &lt;em&gt;false&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.#.&#xA;...&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, so the shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="13798" LastEditorUserId="13798" LastEditDate="2015-05-22T08:35:49.300" LastActivityDate="2015-05-22T08:35:49.300" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5291" PostTypeId="2" ParentId="2140" CreationDate="2015-05-22T19:17:48.137" Score="0" Body="&lt;p&gt;A &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; idea. Maybe I'll do it a long time later...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You have these options each turn (they need better names and a plausible background):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;Meet k&lt;/code&gt; If the bot k also did meet you, and nobody injects, both of your scores are increased by 1. Otherwise nothing happens. But if k is yourself, this is invalid and will be just like doing nothing.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Invite k&lt;/code&gt; The bot k gets a notification that you are doing this, and in the next round, your output is ignored and you must do &lt;code&gt;Meet k&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Inspect k&lt;/code&gt; You will get these informations at the beginning of next round:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What the bot k was doing.&lt;/li&gt;&#xA;&lt;li&gt;The score change of bot k.&lt;/li&gt;&#xA;&lt;li&gt;Who was inviting bot k.&lt;/li&gt;&#xA;&lt;li&gt;Who was trying to meet bot k. (This is not known by bot k if not inspecting himself and his score is not changed.)&lt;/li&gt;&#xA;&lt;li&gt;Who was inspecting bot k. (This is not known by bot k if not inspecting himself.)&lt;/li&gt;&#xA;&lt;li&gt;Who was injecting bot k (and another bot). (This is not known by bot k if not inspecting himself and his score is not changed.)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Inject j k&lt;/code&gt; If j is meeting k and k is meeting j, your score is increased by 10 and their scores are both decreased by 1 instead. If one of them is pretending doing that, and the other is pretending or really doing that, your score doesn't change. Otherwise, your score is decreased by 10. They'll not know who is injecting unless they are inspecting you or self-inspecting instead.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;DoNothing&lt;/code&gt; Nothing happens.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Possible other options:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;Pretend action&lt;/code&gt;: &lt;code&gt;action&lt;/code&gt; is any action other than &lt;code&gt;Pretend&lt;/code&gt;. It's the same as doing nothing, but inspectors will be told that you are doing that action. The score change that the inspectors will see is calculated as if you really did that.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Multiply&lt;/code&gt;: For each turn until the next time you meet some bot each other, the points you, the other bot and all the bots injecting you get are doubled (or incremented, I'm not sure).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Everybody can see only their own score, bots inviting them and the result from &lt;code&gt;Inspect&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="25180" LastEditDate="2015-05-22T20:47:26.797" LastActivityDate="2015-05-22T20:47:26.797" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5293" PostTypeId="1" CreationDate="2015-05-24T03:14:14.183" Score="6" ViewCount="180" Body="&lt;p&gt;Take for example &lt;a href=&quot;https://codegolf.stackexchange.com/questions/607/find-the-factorial?rq=1&quot;&gt;this question&lt;/a&gt;. The top answer is pretty great, and as such it has received a lot of votes. But it is &lt;strong&gt;not&lt;/strong&gt; the winning answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we flag such questions for moderator attention? If not, what else should we do?&lt;/p&gt;&#xA;" OwnerUserId="4162" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2015-05-24T04:19:27.827" Title="Should we flag questions with incorrectly accepted answers for moderator attention?" Tags="|discussion|" AnswerCount="4" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5294" PostTypeId="2" ParentId="5293" CreationDate="2015-05-24T03:40:19.973" Score="-12" Body="&lt;h1&gt;Flag them&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This would require a custom moderator flag.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2015-05-24T03:40:19.973" CommentCount="1" CommunityOwnedDate="2015-05-24T03:40:19.973" ContentLicense="CC BY-SA 3.0" />
  <row Id="5295" PostTypeId="2" ParentId="5293" CreationDate="2015-05-24T03:41:27.310" Score="8" Body="&lt;h1&gt;Don't flag them, leave a comment&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Leave a comment for the OP informing them that another answer has won per their set challenge guidelines.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2015-05-24T03:41:27.310" CommentCount="2" CommunityOwnedDate="2015-05-24T03:41:27.310" ContentLicense="CC BY-SA 3.0" />
  <row Id="5296" PostTypeId="2" ParentId="5293" CreationDate="2015-05-24T03:44:53.037" Score="9" Body="&lt;h1&gt;Do nothing&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Take no action at all. As long as the challenge was open for a reasonable amount of time, there's no need to intervene.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2015-05-24T03:44:53.037" CommentCount="1" CommunityOwnedDate="2015-05-24T03:44:53.037" ContentLicense="CC BY-SA 3.0" />
  <row Id="5298" PostTypeId="2" ParentId="5293" CreationDate="2015-05-24T04:19:27.827" Score="16" Body="&lt;p&gt;No, you should not. There is nothing a moderator can do in this situation that you cannot, and the flag would be declined as &quot;flags should only be used to make moderators aware of content that &lt;strong&gt;requires&lt;/strong&gt; their intervention&quot; (emphasis mine).&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2015-05-24T04:19:27.827" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5299" PostTypeId="2" ParentId="2155" CreationDate="2015-05-24T08:35:52.467" Score="12" Body="&lt;h1&gt;Outside answers are valid as Community Wiki&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If a good answer to a challenge exists, it should be posted. This site is about finding the best answer, not just an internal competition. However, since the person posting the answer did not create, it wouldn't be fair for them to get the reputation for it, and so it should be communtiy wiki.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe this is the de facto method we have been using, and I'd like to make it official.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, attribution is essential, and if someone doesn't want their work posted here, it should be taken down.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2015-05-24T08:35:52.467" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5300" PostTypeId="2" ParentId="2140" CreationDate="2015-05-24T17:47:01.820" Score="4" Body="&lt;h1&gt;Super Smash Bots&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is an idea for a KOTH based off of the Super Smash Bros video game series by Nintendo.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The basic mechanics of this KOTH would be an every-man-for-himself battle between a large number of players simultaneously.  Players can execute a variety of moves, like short/medium/long-ranged attacks or blocking.  As opposed to most combat-based games, players do not have a health bar, but rather die when knocked off of the stage (the arena).  When an attack hits a player, it deals damage to that player but also causes knockback.  The amount of knockback a player experiences is proportional to the total amount of damage he's received so far in the game.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Arena&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The game takes place on a vertical stage with gravity.  There will be several fixed platforms surrounded by empty space.  A player too far from a platform is killed.  More ideas about the design of the stage are covered in the Stage Design section.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Character Selection?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The actual game offers players the selection of different &lt;em&gt;characters&lt;/em&gt;, each of which have different abilities, strengths, and weaknesses.  If I am to include character selection, that will be a way for players to pick the strategy they think works best and choose a bot that has those strengths.  Another KOTH which had this feature was the Pokemon-themed KOTH (citation needed).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, balancing stuff can be hard.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Actions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Move.&lt;/strong&gt;  Simple as that.  Well, not exactly.  I think this could make a very good contender for a continuous-surface (not a grid) area.  On a surface, the character would walk, while airborne, the character's movement doesn't respond as quickly.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Jump.&lt;/strong&gt;  Is like a move, but vertical.  More specifically, this gives the player an upward velocity.  Double jumping might be possible.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Short Range.&lt;/strong&gt;  This deals damage to an immediately adjacent player.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Medium Range.&lt;/strong&gt;  This deals damage to players within a certain range.  It would likely involve your player physically moving as well.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Long Range.&lt;/strong&gt;  This creates a projectile, which can deal damage to a player in the specified direction, no matter the distance.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Area of Effect.&lt;/strong&gt;  All players within a given range take a little damage.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Respawning?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Is is often typical that players have three lives, and thus must be killed three times to be eliminated.  By respawning players, the variance of each match outcome should be reduced.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Game Ticks&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If I'm doing a continuous-field, then I would want something the emulates continuous movement.  In order to give fair processing time, I can't really have all of the entrant programs running at once in an asynchronous fashion. Some possible solutions are as follows.  &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Priority Queue&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each action taken creates a certain time delay before the player can move again.  Standing still is shortest delay, moving is second-shortest, and long-ranged attacks have the longest delay.&lt;/li&gt;&#xA;&lt;li&gt;Turn order is determined by a priority queue.  From the list of players, the player with the least delay is selected.  Then, the game's physics are simulated for that amount of time (&quot;virtual&quot; time, not &quot;true&quot; time) and that much time is subtracted from everyone's delay.  The selected player picks an action, and he is put back into the queue with that move's delay.&lt;/li&gt;&#xA;&lt;li&gt;This creates a period of vulnerability after an attack which may be game-mechanically interesting.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Random Time-Steps&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Play occurs in a semi-random order, with random, non-uniform time-steps between moves.  This makes it so that the player cannot predict exactly what the world will be like in the future, or guarantee the exact timings of any moves.&lt;/li&gt;&#xA;&lt;li&gt;After each player has taken a single move, the order of players would be scrambled.&lt;/li&gt;&#xA;&lt;li&gt;Time-step duration would be approximately constant with a random variation of +/-20% or something like that.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Animation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This would be &lt;em&gt;really cool&lt;/em&gt; to watch, but I don't think I could possibly animate this by myself.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Stage Design&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Stage design will be important, because a large chunk of the entrant programs will be tailored the stage.  I don't really have any clue what I'm doing here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;One idea I've had is to crowd-source the stage design.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Maybe something with a few ledges, like this?  (scaled down for ASCII-artability)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;..........................&#xA;..........................&#xA;...XXXX...................&#xA;...............XXXXXXX....&#xA;..........................&#xA;....XXXXXXXXXXXXX.........&#xA;..........................&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I could add some more features like so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;..........................&#xA;....XXXX..................&#xA;........XXXXX.....XXXX...&#xA;......................\...&#xA;..XXXXXXXXXXXXX....XXXXX..&#xA;................../.......&#xA;............XXXXXX........&#xA;..........................&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The slants represent ramps that the player could walk up.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Player Navigation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I foresee one of the most difficult things for entrants to do is to navigate the stage.  Each player would definitely receive a copy of the current stage and players as input every turn (or as arguments/parameters, more details on that below).  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I may choose to offload a bunch of pathfinding stuff onto the controller so that entrants, if they so desire, can give the destination and have their character move there.  Given that the stage would be constant, this should not be difficult for the controller to do.  On the other hand, the continuous-field design can make pathfinding more complicated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One thing to consider during stage design is the ease of pathfinding.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Vertical or Horizontal?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Pretty much the whole proposal has been assuming a vertical map.  I could change this to horizontal to allow a larger number of people to fight in one match.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Classes or Full Programs, and Language?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Personally, I think this would be easiest to do as a Java KOTH with classes. It will run quick(-er than several other methods) and I could give entrants access to a variety of methods that give information about the stage.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Controller&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Literally no work has been done yet.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2016-03-27T23:22:08.793" LastActivityDate="2016-03-27T23:22:08.793" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5306" PostTypeId="2" ParentId="2140" CreationDate="2015-05-25T11:10:31.930" Score="0" Body="&lt;h1&gt;Is this a red-black tree?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A red-black tree is a binary search tree where each node has an additional 'colour' property, which can be black or red. The root and leaf nodes must be black, each red node must have black children, and the path from any node to any child leaves must have the same number of black nodes. For instance:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2B&#xA;|  \&#xA;1R  3B&#xA;|   |&#xA;~   ~&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Is invalid because of a black violation (the path from the root to each leaf has a different number of blacks).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to determine whether a given tree is a valid Red-Black tree.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input will be a string matching &lt;code&gt;[ a-zA-Z]&lt;/code&gt;. A space represents a leaf, a lowercase character a black node, and an uppercase character a red node. The value of a node is the position in the alphabet: a is 0, b is 1, C is 2, and so on. The children of the node in position &lt;code&gt;n&lt;/code&gt; are in positions &lt;code&gt;2n+1&lt;/code&gt; and &lt;code&gt;2n+2&lt;/code&gt;. If the string ends before the position you're looking for, that node is a leaf. For instance, &lt;code&gt;baD  cf      E&lt;/code&gt; corresponds to:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;       1,B&#xA;&#xA;     /     \&#xA;&#xA; 0,B         3,R&#xA;&#xA;           /     \&#xA;&#xA;       2,B         5,B&#xA;&#xA;                 /&#xA;&#xA;             4,R&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program should output something other than whitespace on STDOUT if and only if the input represents a valid tree.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Simple test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;True      False&#xA;&quot; &quot;       &quot;&quot;        (Root black violation)&#xA;&quot;a&quot;       &quot;A&quot;       (Root black violation)&#xA;&quot;cAD&quot;     &quot;cAB&quot;     (Order violation)&#xA;&quot;dBeac&quot;   &quot;dBea&quot;    (Black violation)&#xA;          &quot;dAE B&quot;   (Red violation)  &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="19039" LastActivityDate="2015-05-25T11:10:31.930" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5308" PostTypeId="1" AcceptedAnswerId="5312" CreationDate="2015-05-25T17:12:18.627" Score="9" ViewCount="380" Body="&lt;p&gt;The Stack Snippet below loads the first Stack Snippet in the Stack Exchange post defined by &lt;code&gt;site&lt;/code&gt;, &lt;code&gt;postID&lt;/code&gt;, and &lt;code&gt;isAnswer&lt;/code&gt;. (Inspired by &lt;a href=&quot;https://meta.stackexchange.com/questions/257145/are-stack-snippets-a-good-enough-reason-to-increase-the-30k-post-limit#comment838813_257145&quot;&gt;this&lt;/a&gt; and &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/21826346#21826346&quot;&gt;this&lt;/a&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It assumes there is only one Stack Snippet in the post and may load the wrong code if there is more than one.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;One possible application is to have this point to a generalized leaderboard Snippet. So any changes/fixes to the leaderboard Snippet are reflected in all the Snippets that point to it. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5314/26997&quot;&gt;Optimizer has done this.&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Another application is to point it to a &lt;a href=&quot;https://meta.stackexchange.com/q/257145/266052&quot;&gt;very long&lt;/a&gt; Snippet that wouldn't fit in the post otherwise.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;A golfed version with copyable raw markdown is available &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5312/26997&quot;&gt;below&lt;/a&gt;.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This ungolfed Snippet loads from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5311/26997&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;site = 'meta.codegolf'&#xD;&#xA;postID = 5311&#xD;&#xA;isAnswer = true&#xD;&#xA;&#xD;&#xA;jQuery(function() {&#xD;&#xA;	var url = 'https://api.stackexchange.com/2.2/'&#xD;&#xA;	if (isAnswer)&#xD;&#xA;		url += 'answers/' + postID + '?order=asc&amp;amp;sort=creation&amp;amp;site=' + site + '&amp;amp;filter=!GeEyUcJFJeRCD'&#xD;&#xA;	else&#xD;&#xA;		url += 'questions/' + postID + '?order=asc&amp;amp;sort=creation&amp;amp;site=' + site + '&amp;amp;filter=!GeEyUcJFJO6t)'&#xD;&#xA;	jQuery.get(url, function(b) {&#xD;&#xA;			function d(s) { return jQuery('&amp;lt;textarea&amp;gt;').html(s).text() }&#xD;&#xA;			function r(l) { return new RegExp('&amp;lt;pre class=&quot;snippet-code-' + l + '\\b[^&amp;gt;]*&amp;gt;&amp;lt;code&amp;gt;([\\s\\S]*?)&amp;lt;/code&amp;gt;&amp;lt;/pre&amp;gt;') }&#xD;&#xA;			b = b.items[0].body&#xD;&#xA;			var js = r('js').exec(b), css = r('css').exec(b), html = r('html').exec(b)&#xD;&#xA;			if (css !== null)&#xD;&#xA;				jQuery('head').append(jQuery('&amp;lt;style&amp;gt;').text(d(css[1])))&#xD;&#xA;			if (html !== null)&#xD;&#xA;				jQuery('body').append(d(html[1]))&#xD;&#xA;			if (js !== null)&#xD;&#xA;				jQuery('body').append(jQuery('&amp;lt;script&amp;gt;').text(d(js[1])))&#xD;&#xA;		}&#xD;&#xA;	)&#xD;&#xA;})&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I use &lt;code&gt;jQuery&lt;/code&gt; instead of &lt;code&gt;$&lt;/code&gt; to hopefully avoid &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5043/stack-snippets-messing-with-js&quot;&gt;this issue&lt;/a&gt;.)&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2022-11-16T12:47:55.140" Title="Arbitrary Stack Snippet Loader" Tags="|discussion|stack-snippets|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="5311" PostTypeId="2" ParentId="5308" CreationDate="2015-05-25T17:40:50.977" Score="1" Body="&lt;h1&gt;Test Snippet&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;jQuery('body').append('Data: ' + site + ', ' + postID + ', ' + isAnswer)&#xA;alert('Success!')&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-css lang-css prettyprint-override&quot;&gt;&lt;code&gt;h3 { color: red; }&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xA;&amp;lt;h3&amp;gt;Test HTML&amp;lt;/h3&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="26997" LastEditDate="2015-05-25T19:09:16.310" LastActivityDate="2015-05-25T19:09:16.310" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5312" PostTypeId="2" ParentId="5308" CreationDate="2015-05-25T18:07:08.787" Score="5" Body="&lt;h1&gt;Copyable Version&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Copy this exact raw markdown into the post where you want to use the Arbitrary Stack Snippet Loader. Adjust &lt;code&gt;site&lt;/code&gt;, &lt;code&gt;postID&lt;/code&gt;, and &lt;code&gt;isAnswer&lt;/code&gt; in the first &lt;code&gt;&amp;lt;script&amp;gt;&lt;/code&gt; tag on the second line as necessary.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;!-- begin snippet: js hide: false --&amp;gt;&amp;lt;!-- language: lang-html --&amp;gt;&#xA;&amp;lt;script&amp;gt;site = 'codegolf'; postID = 50690; isAnswer = false&amp;lt;/script&amp;gt;&amp;lt;script src='https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js'&amp;gt;&amp;lt;/script&amp;gt;&amp;lt;script&amp;gt;jQuery(function(){var u='https://api.stackexchange.com/2.2/';if(isAnswer)u+='answers/'+postID+'?order=asc&amp;amp;sort=creation&amp;amp;site='+site+'&amp;amp;filter=!GeEyUcJFJeRCD';else u+='questions/'+postID+'?order=asc&amp;amp;sort=creation&amp;amp;site='+site+'&amp;amp;filter=!GeEyUcJFJO6t)';jQuery.get(u,function(b){function d(s){return jQuery('&amp;lt;textarea&amp;gt;').html(s).text()};function r(l){return new RegExp('&amp;lt;pre class=&amp;quot;snippet-code-'+l+'\\b[^&amp;gt;]*&amp;gt;&amp;lt;code&amp;gt;([\\s\\S]*?)&amp;lt;/code&amp;gt;&amp;lt;/pre&amp;gt;')};b=b.items[0].body;var j=r('js').exec(b),c=r('css').exec(b),h=r('html').exec(b);if(c!==null)jQuery('head').append(jQuery('&amp;lt;style&amp;gt;').text(d(c[1])));if (h!==null)jQuery('body').append(d(h[1]));if(j!==null)jQuery('body').append(jQuery('&amp;lt;script&amp;gt;').text(d(j[1])))})})&amp;lt;/script&amp;gt;&amp;lt;!-- end snippet --&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;It should render like this:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script&amp;gt;site = 'codegolf'; postID = 50690; isAnswer = false&amp;lt;/script&amp;gt;&amp;lt;script src='https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js'&amp;gt;&amp;lt;/script&amp;gt;&amp;lt;script&amp;gt;jQuery(function(){var u='https://api.stackexchange.com/2.2/';if(isAnswer)u+='answers/'+postID+'?order=asc&amp;amp;sort=creation&amp;amp;site='+site+'&amp;amp;filter=!GeEyUcJFJeRCD';else u+='questions/'+postID+'?order=asc&amp;amp;sort=creation&amp;amp;site='+site+'&amp;amp;filter=!GeEyUcJFJO6t)';jQuery.get(u,function(b){function d(s){return jQuery('&amp;lt;textarea&amp;gt;').html(s).text()};function r(l){return new RegExp('&amp;lt;pre class=&quot;snippet-code-'+l+'\\b[^&amp;gt;]*&amp;gt;&amp;lt;code&amp;gt;([\\s\\S]*?)&amp;lt;/code&amp;gt;&amp;lt;/pre&amp;gt;')};b=b.items[0].body;var j=r('js').exec(b),c=r('css').exec(b),h=r('html').exec(b);if(c!==null)jQuery('head').append(jQuery('&amp;lt;style&amp;gt;').text(d(c[1])));if (h!==null)jQuery('body').append(d(h[1]));if(j!==null)jQuery('body').append(jQuery('&amp;lt;script&amp;gt;').text(d(j[1])))})})&amp;lt;/script&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="26997" LastEditDate="2015-05-25T23:08:45.660" LastActivityDate="2015-05-25T23:08:45.660" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5314" PostTypeId="2" ParentId="5139" CreationDate="2015-05-25T19:36:52.650" Score="3" Body="&lt;h1&gt;Soft-linkable Leaderboard&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Adding this as an answer with a single snippet in order to simply reuse the leaderboard snippet using &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5312/31414&quot;&gt;Calvin'sHobbies' Arbitrary stack snippet loader&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;To use this, simply make sure that you have the snippet from the above link in your post with the configurations as below:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;site = 'meta.codegolf'&lt;/li&gt;&#xA;&lt;li&gt;postID = 5314&lt;/li&gt;&#xA;&lt;li&gt;isAnswer = true&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;and an additional configuration required by the leaderboard snippet:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;QUESTION_ID = id of the question for which leaderboard is required. Ex. 47338&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;/* Configuration */&#xA;&#xA;// It will be like http://XYZ.stackexchange.com/questions/QUESTION_ID/... on any question page&#xA;var ANSWER_FILTER = &quot;!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe&quot;;&#xA;&#xA;/* App */&#xA;&#xA;var answers = [], page = 1;&#xA;&#xA;function answersUrl(index) {&#xA;  return &quot;http://api.stackexchange.com/2.2/questions/&quot; +  QUESTION_ID + &quot;/answers?page=&quot; + index + &quot;&amp;amp;pagesize=100&amp;amp;order=desc&amp;amp;sort=creation&amp;amp;site=codegolf&amp;amp;filter=&quot; + ANSWER_FILTER;&#xA;}&#xA;&#xA;function getAnswers() {&#xA;  jQuery.ajax({&#xA;    url: answersUrl(page++),&#xA;    method: &quot;get&quot;,&#xA;    dataType: &quot;jsonp&quot;,&#xA;    crossDomain: true,&#xA;    success: function (data) {&#xA;      answers.push.apply(answers, data.items);&#xA;      if (data.has_more) getAnswers();&#xA;      else process();&#xA;    }&#xA;  });&#xA;}&#xA;&#xA;getAnswers();&#xA;&#xA;var SIZE_REG = /\d+(?=[^\d&amp;amp;]*(?:&amp;amp;lt;(?:s&amp;amp;gt;[^&amp;amp;]*&amp;amp;lt;\/s&amp;amp;gt;|[^&amp;amp;]+&amp;amp;gt;)[^\d&amp;amp;]*)*$)/;&#xA;var NUMBER_REG = /\d+/;&#xA;var LANGUAGE_REG = /^#*\s*([^,]+)/;&#xA;&#xA;function shouldHaveHeading(a) {&#xA;  var pass = false;&#xA;  var lines = a.body_markdown.split(&quot;\n&quot;);&#xA;  try {&#xA;    pass |= /^#/.test(a.body_markdown);&#xA;    pass |= [&quot;-&quot;, &quot;=&quot;]&#xA;              .indexOf(lines[1][0]) &amp;gt; -1;&#xA;    pass &amp;amp;= LANGUAGE_REG.test(a.body_markdown);&#xA;  } catch (ex) {}&#xA;  return pass;&#xA;}&#xA;&#xA;function shouldHaveScore(a) {&#xA;  var pass = false;&#xA;  try {&#xA;    pass |= SIZE_REG.test(a.body_markdown.split(&quot;\n&quot;)[0]);&#xA;  } catch (ex) {}&#xA;  return pass;&#xA;}&#xA;&#xA;function getAuthorName(a) {&#xA;  return a.owner.display_name;&#xA;}&#xA;&#xA;function process() {&#xA;  answers = answers.filter(shouldHaveScore)&#xA;                   .filter(shouldHaveHeading);&#xA;  answers.sort(function (a, b) {&#xA;    var aB = +(a.body_markdown.split(&quot;\n&quot;)[0].match(SIZE_REG) || [Infinity])[0],&#xA;        bB = +(b.body_markdown.split(&quot;\n&quot;)[0].match(SIZE_REG) || [Infinity])[0];&#xA;    return aB - bB&#xA;  });&#xA;&#xA;  var languages = {};&#xA;  var place = 1;&#xA;  var lastSize = null;&#xA;  var lastPlace = 1;&#xA;  answers.forEach(function (a) {&#xA;    var headline = a.body_markdown.split(&quot;\n&quot;)[0];&#xA;    //console.log(a);&#xA;    var answer = jQuery(&quot;#answer-template&quot;).html();&#xA;    var num = headline.match(NUMBER_REG)[0];&#xA;    var size = (headline.match(SIZE_REG)||[0])[0];&#xA;    var language = headline.match(LANGUAGE_REG)[1];&#xA;    var user = getAuthorName(a);&#xA;    if (size != lastSize)&#xA;      lastPlace = place;&#xA;    lastSize = size;&#xA;    ++place;&#xA;    answer = answer.replace(&quot;{{PLACE}}&quot;, lastPlace + &quot;.&quot;)&#xA;                   .replace(&quot;{{NAME}}&quot;, user)&#xA;                   .replace(&quot;{{LANGUAGE}}&quot;, language)&#xA;                   .replace(&quot;{{SIZE}}&quot;, size)&#xA;                   .replace(&quot;{{LINK}}&quot;, a.share_link);&#xA;    answer = jQuery(answer)&#xA;    jQuery(&quot;#answers&quot;).append(answer);&#xA;&#xA;    languages[language] = languages[language] || {lang: language, user: user, size: size, link: a.share_link};&#xA;  });&#xA;&#xA;  var langs = [];&#xA;  for (var lang in languages)&#xA;    if (languages.hasOwnProperty(lang))&#xA;      langs.push(languages[lang]);&#xA;&#xA;  langs.sort(function (a, b) {&#xA;    if (a.lang &amp;gt; b.lang) return 1;&#xA;    if (a.lang &amp;lt; b.lang) return -1;&#xA;    return 0;&#xA;  });&#xA;&#xA;  for (var i = 0; i &amp;lt; langs.length; ++i)&#xA;  {&#xA;    var language = jQuery(&quot;#language-template&quot;).html();&#xA;    var lang = langs[i];&#xA;    language = language.replace(&quot;{{LANGUAGE}}&quot;, lang.lang)&#xA;                       .replace(&quot;{{NAME}}&quot;, lang.user)&#xA;                       .replace(&quot;{{SIZE}}&quot;, lang.size)&#xA;                       .replace(&quot;{{LINK}}&quot;, lang.link);&#xA;    language = jQuery(language);&#xA;    jQuery(&quot;#languages&quot;).append(language);&#xA;  }&#xA;&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-css lang-css prettyprint-override&quot;&gt;&lt;code&gt;body { text-align: left !important}&#xA;&#xA;#answer-list {&#xA;  padding: 10px;&#xA;  width: 290px;&#xA;  float: left;&#xA;}&#xA;&#xA;#language-list {&#xA;  padding: 10px;&#xA;  width: 290px;&#xA;  float: left;&#xA;}&#xA;&#xA;table thead {&#xA;  font-weight: bold;&#xA;}&#xA;&#xA;table td {&#xA;  padding: 5px;&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xA;&amp;lt;link rel=&quot;stylesheet&quot; type=&quot;text/css&quot; href=&quot;//cdn.sstatic.net/codegolf/all.css?v=83c949450c8b&quot;&amp;gt;&#xA;&amp;lt;div id=&quot;answer-list&quot;&amp;gt;&#xA;  &amp;lt;h2&amp;gt;Leaderboard&amp;lt;/h2&amp;gt;&#xA;  &amp;lt;table class=&quot;answer-list&quot;&amp;gt;&#xA;    &amp;lt;thead&amp;gt;&#xA;      &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Author&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Language&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Size&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&#xA;    &amp;lt;/thead&amp;gt;&#xA;    &amp;lt;tbody id=&quot;answers&quot;&amp;gt;&#xA;&#xA;    &amp;lt;/tbody&amp;gt;&#xA;  &amp;lt;/table&amp;gt;&#xA;&amp;lt;/div&amp;gt;&#xA;&amp;lt;div id=&quot;language-list&quot;&amp;gt;&#xA;  &amp;lt;h2&amp;gt;Winners by Language&amp;lt;/h2&amp;gt;&#xA;  &amp;lt;table class=&quot;language-list&quot;&amp;gt;&#xA;    &amp;lt;thead&amp;gt;&#xA;      &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;Language&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;User&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Score&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&#xA;    &amp;lt;/thead&amp;gt;&#xA;    &amp;lt;tbody id=&quot;languages&quot;&amp;gt;&#xA;&#xA;    &amp;lt;/tbody&amp;gt;&#xA;  &amp;lt;/table&amp;gt;&#xA;&amp;lt;/div&amp;gt;&#xA;&amp;lt;table style=&quot;display: none&quot;&amp;gt;&#xA;  &amp;lt;tbody id=&quot;answer-template&quot;&amp;gt;&#xA;    &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;{{PLACE}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{NAME}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{LANGUAGE}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{SIZE}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;{{LINK}}&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&#xA;  &amp;lt;/tbody&amp;gt;&#xA;&amp;lt;/table&amp;gt;&#xA;&amp;lt;table style=&quot;display: none&quot;&amp;gt;&#xA;  &amp;lt;tbody id=&quot;language-template&quot;&amp;gt;&#xA;    &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;{{LANGUAGE}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{NAME}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{SIZE}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;{{LINK}}&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&#xA;  &amp;lt;/tbody&amp;gt;&#xA;&amp;lt;/table&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="31414" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-25T20:07:24.943" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5315" PostTypeId="2" ParentId="2140" CreationDate="2015-05-26T11:32:50.713" Score="0" Body="&lt;p&gt;&lt;strong&gt;Question about extrapolating data from an incomplete tennis scoreboard&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Introduction&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is a fine day at the Stack Exchange tennis club. The players have just finished playing a grand tennis tournament in a round robin style (every player plays every other player once). The final results were about to be announced when suddenly, the scoreboard explodes! It is a total disaster - now nobody knows what the final scores were! Luckily, a piece of the scoreboard is still intact. Can you write a program to figure out the rest of the scoreboard from only a small part of it?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there are &lt;code&gt;k&lt;/code&gt; players, our scoreboard would have had &lt;code&gt;k*3&lt;/code&gt; entries, indicating each player's &lt;strong&gt;wins&lt;/strong&gt;, &lt;strong&gt;losses&lt;/strong&gt;, and &lt;strong&gt;draws&lt;/strong&gt;. It is presented in a list of space separated comma separated tuples. For instance, in a game with 4 players here is a possible final scoreboard:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0,2,1 3,0,0 1,1,1 1,2,0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In this example the first player did not win anything, lost twice, and drew once; the second player won all three of their matches; the third player won once, lost once, and drew once; and the fourth player won once and lost twice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input Description&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As input, you are given a scoreboard similar to the one above, except &lt;strong&gt;some of the numbers have been replaced by &lt;code&gt;?&lt;/code&gt;&lt;/strong&gt;. The &lt;code&gt;?&lt;/code&gt; indicate the numbers that were unrecoverable after the explosion. For instance:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;?,?,1 0,?,0 ?,?,?&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output Description&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output the scoreboard, with the &lt;code&gt;?&lt;/code&gt;s replaced with the actual scores. The input scoreboard will always have enough information for you to deduce the final scoreboard.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, consider the above input. We know that the second player has 0 wins and 0 draws, therefore, they must have lost both of their games. The first player has a single draw, and since we know the first player beat the second player, that draw must be with the third player. Thus the output is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1,0,1 0,2,0 1,0,1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sample inputs and outputs&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;TODO: Sample inputs and outputs of higher k&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox Questions&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I have an alternate formulation for this question where instead of an incomplete scoreboard, the complete scoreboard is given and the program has to generate a table of which player beat which player. Which challenge do you think would be more interesting?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="21682" LastActivityDate="2015-05-26T11:32:50.713" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5316" PostTypeId="2" ParentId="2140" CreationDate="2015-05-26T15:03:25.177" Score="3" Body="&lt;h1&gt;Permutations of the Fifteen Puzzle&lt;/h1&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/50819/31054&quot;&gt;POSTED&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="31054" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-26T20:49:11.823" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5318" PostTypeId="1" CreationDate="2015-05-26T19:26:20.977" Score="55" ViewCount="2891" Body="&lt;p&gt;Most of the content on PPCG involves clever applications of existing algorithms, or just-fast-enough-to-pass solutions to problems that supercomputers have found millions of answers/digits/etc to already. However, somewhere among all of the brainpower we spend on these challenges, surely someone has come up with something truly original.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Possible examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a new good algorithm for a known problem&lt;/li&gt;&#xA;&lt;li&gt;establishing a new lower or upper bound for some value or some algorithm's runtime&lt;/li&gt;&#xA;&lt;li&gt;extending an existing OEIS sequence beyond previous computation&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Where are those things?&lt;/p&gt;&#xA;" OwnerUserId="4787" LastActivityDate="2023-10-19T22:57:12.493" Title="What contributions has PPCG made to the fields of math or computer science?" Tags="|discussion|" AnswerCount="3" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5319" PostTypeId="2" ParentId="5318" CreationDate="2015-05-26T19:54:37.023" Score="43" Body="&lt;h1&gt;Contributions to &lt;a href=&quot;https://oeis.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Please edit all OEIS-only contributions into this post, instead of posting a separate answer for each. If there's a larger result that also led to an OEIS contribution (like a novel algorithm that allowed computation of more terms), feel free to post it separately, though.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://oeis.org/A005434&quot; rel=&quot;nofollow noreferrer&quot;&gt;A005434&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/39242/anders-kaseorg&quot;&gt;Anders Kaseorg&lt;/a&gt; wrote a fast program to calculate this sequence using the method described in &lt;a href=&quot;https://doi.org/10.1016/0097-3165(81)90038-8&quot; rel=&quot;nofollow noreferrer&quot;&gt;this paper&lt;/a&gt;, and E-Hern Lee (&lt;a href=&quot;https://codegolf.stackexchange.com/users/39244/ascii-only&quot;&gt;ASCII-only&lt;/a&gt;) submitted a b-list with 654 terms.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://oeis.org/A049064&quot; rel=&quot;nofollow noreferrer&quot;&gt;A049064&lt;/a&gt;&lt;/strong&gt;: Kade Robertson (&lt;a href=&quot;https://codegolf.stackexchange.com/users/38417/shebang&quot;&gt;Shebang&lt;/a&gt;) extended the sequence, and created &lt;a href=&quot;https://oeis.org/A259710&quot; rel=&quot;nofollow noreferrer&quot;&gt;A259710&lt;/a&gt; for the base-10 representation of the sequence.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://oeis.org/A066931&quot; rel=&quot;nofollow noreferrer&quot;&gt;A066931&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-b%C3%BCttner&quot;&gt;Martin Büttner&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/q/51266/194&quot;&gt;challenged&lt;/a&gt; PPCG to extend the sequence; &lt;a href=&quot;https://codegolf.stackexchange.com/users/194/peter-taylor&quot;&gt;Peter Taylor&lt;/a&gt; found a formula and updated it with more terms. As a side-effect he also improved &lt;strong&gt;&lt;a href=&quot;https://oeis.org/A049503&quot; rel=&quot;nofollow noreferrer&quot;&gt;A049503&lt;/a&gt;&lt;/strong&gt; and submitted &lt;strong&gt;&lt;a href=&quot;https://oeis.org/A259049&quot; rel=&quot;nofollow noreferrer&quot;&gt;A259049&lt;/a&gt;&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://oeis.org/A162171&quot; rel=&quot;nofollow noreferrer&quot;&gt;A162171&lt;/a&gt;&lt;/strong&gt;: Mike Tryczak (&lt;a href=&quot;https://codegolf.stackexchange.com/users/4098/primo&quot;&gt;primo&lt;/a&gt;) corrected and extended the sequence, and added a conjectured formula. The mistake was spotted while working on &lt;a href=&quot;https://codegolf.stackexchange.com/q/48202/4098&quot;&gt;Computing truncated digits sums of powers of pi&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://oeis.org/A169683&quot; rel=&quot;nofollow noreferrer&quot;&gt;A169683&lt;/a&gt;&lt;/strong&gt;: The entry used to be based entirely on the page numbers in the xkcd book. &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-b%C3%BCttner&quot;&gt;Martin Büttner&lt;/a&gt; added the proper definition of the sequence, some comments, references, more terms and a Mathematica program.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://oeis.org/A181018&quot; rel=&quot;nofollow noreferrer&quot;&gt;A181018&lt;/a&gt;&lt;/strong&gt; and &lt;strong&gt;&lt;a href=&quot;https://oeis.org/A181019&quot; rel=&quot;nofollow noreferrer&quot;&gt;A181019&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/q/68678/194&quot;&gt;Tic-tac-toe with only crosses&lt;/a&gt; brought A181018 to &lt;a href=&quot;https://codegolf.stackexchange.com/users/194/peter-taylor&quot;&gt;Peter Taylor&lt;/a&gt;'s attention, and he was surprised to see that no-one seemed to have applied dynamic programming to its computation. He extended A181018 by 4 terms, and its generalisation A181019 by 276 terms.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://oeis.org/A201168&quot; rel=&quot;nofollow noreferrer&quot;&gt;A201168&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/194/peter-taylor&quot;&gt;Peter Taylor&lt;/a&gt; discovered a mistake in the comments of this sequence while searching for sequences to be used for &lt;a href=&quot;https://codegolf.stackexchange.com/q/49223/8478&quot;&gt;Evolution of OEIS&lt;/a&gt;. He proposed a correction and subsequently extended the sequence by several terms and included a Mathematica program.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://oeis.org/A256504&quot; rel=&quot;nofollow noreferrer&quot;&gt;A256504&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-b%C3%BCttner&quot;&gt;Martin Büttner&lt;/a&gt; corrected a typo in the explanation (along with a mistake in the sequence &lt;a href=&quot;https://codegolf.stackexchange.com/questions/50845/fissile-numbers#comment120433_50845&quot;&gt;pointed out by mathmandan&lt;/a&gt;) while also adding more terms and a Mathematica program.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://oeis.org/A263172&quot; rel=&quot;nofollow noreferrer&quot;&gt;A263172&lt;/a&gt;&lt;/strong&gt;: Matthew McCaskill (&lt;a href=&quot;https://codegolf.stackexchange.com/users/36670/gamrcorps&quot;&gt;GamrCorps&lt;/a&gt;) submitted the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/57719/generate-dennis-numbers&quot;&gt;Dennis numbers&lt;/a&gt; (coined by &lt;a href=&quot;https://codegolf.stackexchange.com/users/26997/calvins-hobbies&quot;&gt;Calvin's Hobbies&lt;/a&gt;) after a four month process to get them approved. On the page it has several references to PPCG.SE, as well as a golfed program.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://oeis.org/A263542&quot; rel=&quot;nofollow noreferrer&quot;&gt;A263542&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/3808/doorknob&quot;&gt;Doorknob&lt;/a&gt; wondered if there were any 3x3 squares of numbers where every 2x2 sub-square had the same sum, which were subsequently termed &amp;quot;&lt;a href=&quot;https://codegolf.stackexchange.com/q/61430/12914&quot;&gt;sturdy squares&lt;/a&gt;&amp;quot;. Multiple people worked on calculating the terms in this sequence, including &lt;a href=&quot;https://codegolf.stackexchange.com/users/21487/sp3000&quot;&gt;Sp3000&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/24877/flawr&quot;&gt;flawr&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/12914/elendia-starman&quot;&gt;El'endia Starman&lt;/a&gt;, and especially &lt;a href=&quot;https://codegolf.stackexchange.com/users/194/peter-taylor&quot;&gt;Peter Taylor&lt;/a&gt; (and any others I forgot). El'endia submitted the sequence to OEIS and it was approved after almost a month.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://oeis.org/A268754&quot; rel=&quot;nofollow noreferrer&quot;&gt;A268754&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/12914/elendia-starman&quot;&gt;El'endia Starman&lt;/a&gt; was playing around with 1-by-N oscillators in a particular Life-like rule, and came up with a sequence that resisted initial efforts at cracking it. Thus, &lt;a href=&quot;https://codegolf.stackexchange.com/q/71970/12914&quot;&gt;a challenge&lt;/a&gt;, &lt;a href=&quot;http://chat.stackexchange.com/transcript/35699&quot;&gt;a chat room&lt;/a&gt; (frozen and deleted automatically), and an entry on OEIS (submitted by El'endia) were spawned. &lt;a href=&quot;https://codegolf.stackexchange.com/users/4162/orlp&quot;&gt;orlp&lt;/a&gt; did most of the work of calculating the terms.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://oeis.org/A288793&quot; rel=&quot;nofollow noreferrer&quot;&gt;A288793&lt;/a&gt;&lt;/strong&gt;: E-Hern Lee (&lt;a href=&quot;https://codegolf.stackexchange.com/users/39244/ascii-only&quot;&gt;ASCII-only&lt;/a&gt;) submitted this sequence after a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/124424/finding-approximate-correlations&quot;&gt;PPCG question to calculate its terms&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://oeis.org/A290151&quot; rel=&quot;nofollow noreferrer&quot;&gt;A290151&lt;/a&gt;&lt;/strong&gt;: Eamon Olive (&lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;Wheat Wizard&lt;/a&gt;) submitted this sequence after a &lt;a href=&quot;https://codegolf.stackexchange.com/q/133747/194&quot;&gt;PPCG question to calculate its terms&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://oeis.org/A334875&quot; rel=&quot;nofollow noreferrer&quot;&gt;A334875&lt;/a&gt;&lt;/strong&gt;: Jonathan Oswald (&lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;Lyxal&lt;/a&gt;) submitted this sequence after a &lt;a href=&quot;https://codegolf.stackexchange.com/q/204669/78410&quot;&gt;question to calculate its terms&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://oeis.org/A334617&quot; rel=&quot;nofollow noreferrer&quot;&gt;A334617&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/53884/peter-kagey&quot;&gt;Peter Kagey&lt;/a&gt; submitted this sequence after a &lt;a href=&quot;https://codegolf.stackexchange.com/q/210748/78410&quot;&gt;question to calculate its terms&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://oeis.org/A346232&quot; rel=&quot;nofollow noreferrer&quot;&gt;A346232&lt;/a&gt;&lt;/strong&gt; and &lt;strong&gt;&lt;a href=&quot;https://oeis.org/A346693&quot; rel=&quot;nofollow noreferrer&quot;&gt;A346693&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/36398/luis-mendo&quot;&gt;Luis Mendo&lt;/a&gt; submitted these sequences after a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/231176/maximum-number-of-squares-touched-by-a-line-segment&quot;&gt;question to calculate the terms of the first&lt;/a&gt;, in which &lt;a href=&quot;https://codegolf.stackexchange.com/users/20260/xnor&quot;&gt;xnor&lt;/a&gt; found a very neat formula. The second sequence is the &amp;quot;pseudo-inverse&amp;quot; of the first.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://oeis.org/A059757&quot; rel=&quot;nofollow noreferrer&quot;&gt;A059757&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/53884/peter-kagey&quot;&gt;Peter Kagey&lt;/a&gt;, on behalf of &lt;a href=&quot;https://codegolf.stackexchange.com/users/95594/xash&quot;&gt;xash&lt;/a&gt;, extended and corrected the sequence after a &lt;a href=&quot;https://codegolf.stackexchange.com/q/230509/66833&quot;&gt;question to calculate its terms&lt;/a&gt;. The sequence was extended first by &lt;a href=&quot;https://codegolf.stackexchange.com/a/230542/66833&quot;&gt;xash's answer&lt;/a&gt; from &lt;span class=&quot;math-container&quot;&gt;\$n \le 13\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$n \le 162\$&lt;/span&gt;, then up to &lt;span class=&quot;math-container&quot;&gt;\$n \le 538\$&lt;/span&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/a/230797/66833&quot;&gt;Nick Kennedy's answer&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://oeis.org/A350418&quot; rel=&quot;nofollow noreferrer&quot;&gt;A350418&lt;/a&gt;&lt;/strong&gt;: Woosuk Kwak (&lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;) challenged CGCC to calculate the fourth term of this sequence with a +500 bounty. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/84290/anttip&quot;&gt;AnttiP&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/240339/counting-universal-n-ary-logic-gates/240341#240341&quot;&gt;calculated&lt;/a&gt; it and corrected a previous result (n=3), allowing Kwak to submit the sequence.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="84290" LastEditDate="2022-01-23T20:07:48.750" LastActivityDate="2022-01-23T20:07:48.750" CommentCount="0" CommunityOwnedDate="2015-05-26T19:54:37.023" ContentLicense="CC BY-SA 4.0" />
  <row Id="5320" PostTypeId="2" ParentId="2140" CreationDate="2015-05-26T21:37:08.007" Score="0" Body="&lt;p&gt;&lt;strong&gt;Sudoku Swapping Shenanigans&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Honestly, there's not many shenanigans in this challenge but I wanted that sweet tautogram title. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Introduction&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Imagine you're on a train, and there is a Sudoku grid that's already been entirely filled in left on the seat. We'll represent this grid as a series of 81 comma separated integers from &lt;code&gt;1-9&lt;/code&gt; on a single line. Each cell in the grid can be numbered as follows:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/dSl6w.png&quot; alt=&quot;not another sudoku puzzle...&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As with all Sudoku grids, there will be exactly 9 of each number present in the input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Sudoku grid will not be completed correctly. It will have the right number of each number, but they will be positioned wrong. Your program's task is to &lt;em&gt;swap&lt;/em&gt; these numbers to solve the Sudoku puzzle correctly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Since your stop is next, you want to make this program solve the Sudoku puzzle as fast as possible.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;or:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Since you're writing this program on a napkin, you want to make it use as little bytes as possible.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input Description&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input consists of 81 positive integers that are comma separated. Some of them will be prefixed with an &lt;code&gt;X&lt;/code&gt; which means those are the ones that are already placed and you can't swap them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example input goes here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output Description&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output the swaps required to solve the grid in the fewest number of swaps. You should have a line for each swap, consisting of two numbers in the form:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a,b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; are both different and in the range &lt;code&gt;0-80&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's an example output (and I haven't actually written the example input yet!)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;80,0&#xA;8,9&#xA;14,15&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So that would mean that to solve the grid we need to swap the number in position 80 with the number in position 0, the number in position 8 with the number in position 9, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox Questions&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Not sure if it should be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;. Suggestions appreciated.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="21682" LastEditDate="2015-05-27T22:04:07.930" LastActivityDate="2015-05-27T22:04:07.930" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5326" PostTypeId="2" ParentId="2140" CreationDate="2015-05-27T10:58:45.613" Score="1" Body="&lt;p&gt;Given an input, calculate the correct suffix and output the number in a readable format. The suffixes must go to at least 10^3000, in which the rules for calculating them can be found &lt;a href=&quot;http://www.isthe.com/chongo/tech/math/number/howhigh.html&quot; rel=&quot;nofollow&quot;&gt;here&lt;/a&gt;, or a list can be found &lt;a href=&quot;http://pastebin.com/8rfxYtZZ&quot; rel=&quot;nofollow&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;10000 = 10.0 thousand&#xA;135933445 = 135.93 million&#xA;-2 = -2.0&#xA;-2.36734603 = -2.37&#xA;'1'+'9'*3000 = 2.0 nongennovemnonagintillion&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No getting things from external resources - it must all be calculated within the code.&lt;/li&gt;&#xA;&lt;li&gt;External modules are fine as long as it doesn't breach the above rule.&lt;/li&gt;&#xA;&lt;li&gt;The input should work when input as a string, integer or float.&lt;/li&gt;&#xA;&lt;li&gt;The output must always contain a decimal place.&lt;/li&gt;&#xA;&lt;li&gt;The output must be rounded if above 2 decimal places.&lt;/li&gt;&#xA;&lt;li&gt;Leaving zeroes at the end is optional, as long as it doesn't go above 2 decimals (1.00 or 1.0 are both fine) and is consistent for all inputs (1 should output the same as 1.0).&lt;/li&gt;&#xA;&lt;li&gt;Must not throw an error no matter how high or low the input is.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Score is the length of the code, including indents.&lt;/li&gt;&#xA;&lt;li&gt;Lowest score wins.&lt;/li&gt;&#xA;&lt;li&gt;It does not need to be a function, printing the output is fine.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;As a starting point, here is an ungolfed version of some code to generate the list of suffixes. Feel free to build upon this or start from scratch.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a = ['', 'un','duo','tre','quattor','quin','sex','septen','octo','novem']&#xA;c = ['tillion', 'decillion', 'vigintillion', 'trigintillion', 'quadragintillion', 'quinquagintillion', 'sexagintillion', 'septuagintillion', 'octogintillion', 'nonagintillion']&#xA;d = ['', 'cen', 'duocen', 'trecen', 'quadringen', 'quingen', 'sescen', 'septingen', 'octingen', 'nongen']&#xA;&#xA;num_dict = ['']&#xA;num_dict.append('thousand')&#xA;num_dict.append('million')&#xA;num_dict.append('billion')&#xA;num_dict.append('trillion')&#xA;num_dict.append('quadrillion')&#xA;num_dict.append('quintillion')&#xA;num_dict.append('sextillion')&#xA;num_dict.append('septillion')&#xA;num_dict.append('octillion')&#xA;num_dict.append('nonillion')&#xA;&#xA;for prefix_hundreds in d:&#xA;&#xA;    #tillion can't be used first time round&#xA;    if not prefix_hundreds:&#xA;        b = c[1:]&#xA;    else:&#xA;        b = c&#xA;&#xA;    for prefix_tens in b:&#xA;        for prefix in a:&#xA;            num_dict.append(prefix_hundreds+prefix+prefix_tens)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For the record, my result is 578 characters. To be fair I'm surprised I couldn't find this being asked before :P&lt;/p&gt;&#xA;" OwnerUserId="30120" LastEditorUserId="30120" LastEditDate="2015-05-31T09:04:17.840" LastActivityDate="2015-05-31T09:04:17.840" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5328" PostTypeId="1" CreationDate="2015-05-27T23:02:42.177" Score="20" ViewCount="1109" Body="&lt;p&gt;I'm just curious about whether any of you have a real-world use for your golfing skills. I'd also be interested to hear if you know of golf-related jobs even if you aren't involved in them, or if you have areas of your life where golfing has been required for practical purposes.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2022-10-24T04:02:18.620" Title="Do any of you golf for a living?" Tags="|discussion|" AnswerCount="4" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5330" PostTypeId="2" ParentId="2447" CreationDate="2015-05-28T13:56:25.773" Score="94" Body="&lt;h1&gt;Programs may output using their exit code...&lt;/h1&gt;&#xA;&lt;p&gt;Exit codes are basically a return value for programs. If functions can output using their return values, it makes sense that programs should be able to do the same.&lt;/p&gt;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://stackoverflow.com/q/457338/3224483&quot;&gt;Java exit codes&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://stackoverflow.com/q/204476/3224483&quot;&gt;C and C++ exit codes&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-22T14:05:29.023" CommentCount="7" CommunityOwnedDate="2016-12-22T14:02:58.363" ContentLicense="CC BY-SA 3.0" />
  <row Id="5331" PostTypeId="2" ParentId="5328" CreationDate="2015-05-28T15:08:15.023" Score="24" Body="&lt;h3&gt;I don't.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Quite the opposite actually. The code I write for work has to be readable, understandable, and usable by folks with a very limited programming background. I have to err on the side of extreme verbosity in my code, otherwise I'd have to spend a lot of extra time explaining it to others. (As an aside, this is probably why I'm not so good at golfing.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Much like the mentality of code golf challenges on PPCG, efficiency must often be sacrificed. However, in my case it's sacrificed for the sake of readability, not for saving a byte of length. Unlike PPCG code, though occasionally inefficient, my code must finish executing before the eventual heat death of the universe.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that this is &lt;strong&gt;not&lt;/strong&gt; my preferred programming style, but it's what's expected of me in my current position.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think you'll find that golfed code is not well received by folks in a professional environment who have to deal with it, at least in my experience.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I'd also be interested to hear if you know of any golf-related jobs...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Ever heard of &lt;a href=&quot;http://en.wikipedia.org/wiki/Tiger_Woods&quot; rel=&quot;nofollow&quot;&gt;Tiger Woods&lt;/a&gt;? He golfs for a living, and I hear he's pretty good at it. Haven't seen him around PPCG in a while though.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="20469" LastEditDate="2015-05-29T18:32:11.680" LastActivityDate="2015-05-29T18:32:11.680" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5337" PostTypeId="2" ParentId="1061" CreationDate="2015-05-30T01:09:09.457" Score="122" Body="&lt;h1&gt;Zero-length quines&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Considering an empty program a quine was original in the &lt;a href=&quot;http://www0.us.ioccc.org/1994/smr.hint&quot; rel=&quot;nofollow noreferrer&quot;&gt;1994 IOCCC&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Over two decades later, if you can answer a question with an empty program and that question is scored by length (e.g., &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;) and is tagged as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;, just notify the OP.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2016-12-28T19:35:50.030" LastActivityDate="2016-12-28T19:35:50.030" CommentCount="5" CommunityOwnedDate="2015-05-30T01:09:09.457" ContentLicense="CC BY-SA 3.0" />
  <row Id="5338" PostTypeId="2" ParentId="2447" CreationDate="2015-05-30T03:42:14.303" Score="14" Body="&lt;h1&gt;Regexes may output a number via the number of matches&lt;/h1&gt;&#xA;&lt;p&gt;Or truthy / falsey as whether they match.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-30T03:42:14.303" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5339" PostTypeId="2" ParentId="2447" CreationDate="2015-05-30T03:44:42.847" Score="22" Body="&lt;h1&gt;Regexes may output via the list of matched strings (the captured group 0)&lt;/h1&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-26T14:57:22.797" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="5340" PostTypeId="2" ParentId="2447" CreationDate="2015-05-30T03:46:57.067" Score="16" Body="&lt;h1&gt;Regexes may output via any captured groups&lt;/h1&gt;&#xA;&lt;p&gt;Users can specify which subset of captured group(s) contains the output; it doesn't have to be just group 0.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-02-28T22:33:54.823" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="5341" PostTypeId="2" ParentId="2447" CreationDate="2015-05-30T03:52:04.360" Score="41" Body="&lt;h1&gt;SQL submissions may take input from a named table&lt;/h1&gt;&#xA;&lt;p&gt;which is probably not good enough. But I don't know a better way.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="97857" LastEditDate="2022-02-22T20:56:46.567" LastActivityDate="2022-02-22T20:56:46.567" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="5342" PostTypeId="2" ParentId="5328" CreationDate="2015-05-30T09:38:04.823" Score="21" Body="&lt;h2&gt;Sort of&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Some low cost micros have very resource constrained. eg  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.microchip.com/wwwproducts/Devices.aspx?product=PIC10F200&quot; rel=&quot;nofollow&quot;&gt;PIC10F200&lt;/a&gt;&lt;br&gt;&#xA;Program Memory (KB) 0.375&lt;br&gt;&#xA;RAM Bytes   16  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;While I'm not actually using any quite that small - even larger chips can run out of space quickly when you don't have space for libraries to lean on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's also a bit of golfing used for protocols over the mobile networks (M2M)&lt;/p&gt;&#xA;" OwnerUserId="95" LastActivityDate="2015-05-30T09:38:04.823" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5343" PostTypeId="1" CreationDate="2015-05-30T15:04:27.783" Score="34" ViewCount="3336" Body="&lt;p&gt;Some string-based languages (including but not limited to sed, Retina, ///) can't really handle integer arithmetic in decimal (or other normal bases). Therefore, these almost always have to start by converting the input from decimal to unary, and the output back from unary to decimal, which can easily outweigh the actual solution, which is often quite elegant.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should (by default) unary input and output be acceptable for code-golf challenges dealing with integer input/output? (This default would apply to &lt;em&gt;all&lt;/em&gt; languages, not just the string-based ones.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2015-05-30T22:26:47.590" LastActivityDate="2015-09-10T21:15:57.283" Title="Can numeric input/output be in unary?" Tags="|discussion|policy|code-golf|answers|" AnswerCount="6" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="5344" PostTypeId="2" ParentId="5343" CreationDate="2015-05-30T15:04:27.783" Score="32" Body="&lt;h1&gt;Yes, unary I/O should be acceptable by default&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Challenges where unary input would defeat the purpose of the task or make it trivial (hypothetical example &quot;Add two numbers&quot;) can always override this default by specifying something like &quot;Given two decimal numbers...&quot;&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-05-30T15:04:27.783" CommentCount="8" CommunityOwnedDate="2015-05-30T15:04:27.783" ContentLicense="CC BY-SA 3.0" />
  <row Id="5345" PostTypeId="2" ParentId="5343" CreationDate="2015-05-30T15:05:50.993" Score="-7" Body="&lt;h1&gt;No, unary I/O should not be acceptable by default&lt;/h1&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-05-30T15:05:50.993" CommentCount="1" CommunityOwnedDate="2015-05-30T15:05:50.993" ContentLicense="CC BY-SA 3.0" />
  <row Id="5346" PostTypeId="2" ParentId="5233" CreationDate="2015-05-30T17:42:13.593" Score="2" Body="&lt;p&gt;Googology  wiki founder and administrator Nathan Ho, known on said wiki as &lt;strong&gt;Vel!&lt;/strong&gt; (formerly &lt;strong&gt;FB100Z&lt;/strong&gt;), &lt;a href=&quot;http://googology.wikia.com/wiki/User:Vel!/Turing_golf&quot; rel=&quot;nofollow&quot;&gt;has proposed the following metric for scoring TMs:&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;score=states * colors^2&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Adding 1 to the number of states if any null tape movements are used.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I personally think the exponent of 2 is a little high and would prefer something like 3/2 instead, and see no need to include a penalty for null tape movements; but that's the scoring metric he used.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think something along these lines would be reasonable for a TM-only challenge, but when they're used along side other languages, I would suggest submitting a rule table in some reasonable format (such as the one used &lt;a href=&quot;http://morphett.info/turing/turing.html&quot; rel=&quot;nofollow&quot;&gt;here&lt;/a&gt;) and scoring by the size of the rule table.&lt;/p&gt;&#xA;" OwnerUserId="39022" LastEditorUserId="39022" LastEditDate="2016-04-15T13:00:00.687" LastActivityDate="2016-04-15T13:00:00.687" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5347" PostTypeId="1" CreationDate="2015-05-30T18:25:46.473" Score="7" ViewCount="171" Body="&lt;p&gt;Several programming competitions include randomness as part of the scoring.  This randomness can come either from the controller/tester program (like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44707/lab-rat-race-an-exercise-in-genetic-algorithms&quot;&gt;Lab Rat Race&lt;/a&gt;) or from other competitors (examples include most KOTHs).  As a result of this randomness, the competitor rankings can vary from tournament to tournament.  When it comes to determining the winner, it is important that the leaderboard be accurate so that the correct answer is accepted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;What are some guidelines for picking the sample size of a competition?&lt;/strong&gt;  I am interested in answers that can serve as guidelines to challenge hosts and which cover the following topics:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For challenges in which all contestants play together, how should we determine how many games should be in a tournament?&lt;/li&gt;&#xA;&lt;li&gt;For challenges in which each contestant is scored separately (like Lab Rat Race), how many trials should each contestant perform?&lt;/li&gt;&#xA;&lt;li&gt;For challenges in which a single game involves a pair (or more) of contestants, how many times should each pairup be played?&lt;/li&gt;&#xA;&lt;li&gt;For challenges in which each game is iterated (iterated prisoner's dilemma or RPS), how many iterations should be in each game?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;My motivation for asking this question is that I've noticed a very wide range in sample sizes, and I felt that some of the smaller ones probably weren't actually enough to determine the true winner.  Listed below is some of the variety.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;50 group matches with 5 copies of each in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/36343/traders-to-the-death&quot;&gt;Traders to the Death&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Playing each pairup once (1 match = 100 throws) in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35079/the-rock-paper-scissors-lizard-spock-tournament-of-epicness&quot;&gt;RPSLS&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;5 trials with 100 copies of each bot in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/25347/survival-game-create-your-wolf&quot;&gt;Create Your Wolf&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;10,000,000 elections held in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/50884/strategic-voting-the-game&quot;&gt;Strategic Voting&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2017-07-28T21:12:28.327" Title="How should authors choose the proper sample sizes for probabilistic programming competitions?" Tags="|discussion|" AnswerCount="3" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5348" PostTypeId="2" ParentId="2140" CreationDate="2015-05-30T20:33:05.397" Score="0" Body="&lt;p&gt;Code golf challenge: Write a program or a function that solves the following problem. Normal code-golf rules apply.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a set of subnets, give the smallest possible network these can belong to. You should consider the network- and broadcast addresses in your calculations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;128.208.0.0/18&#xA;128.208.128.0/17&#xA;128.208.96.0/19&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Example output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;128.208.0.0/16&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You might want to read up on IP prefixes before trying this.&lt;/p&gt;&#xA;" OwnerUserId="36272" LastActivityDate="2015-05-30T20:33:05.397" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5349" PostTypeId="2" ParentId="5343" CreationDate="2015-05-31T05:46:24.897" Score="38" Body="&lt;h1&gt;Yes, but only for languages such as sed, Retina, ///, etc.&lt;/h1&gt;&#xA;&lt;h2&gt;Only where it is the language's most natural integer representation.&lt;/h2&gt;&#xA;&lt;p&gt;I'm in general a fan of taking input in the most natural format for a given language. If a language has no integer type / integer processing capabilities, then the most natural format may well be a unary string, and so in that case, and only that case, it should be allowed.&lt;/p&gt;&#xA;&lt;p&gt;One precedent for this is Brainfuck and other similar languages which typically take numeric input as a byte of that value.&lt;/p&gt;&#xA;&lt;p&gt;Of course, this can be overridden by the poster. If someone says &amp;quot;input is space separated decimal integers&amp;quot;, then that's that.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Thanks to @randomra for some ideas.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-31T06:08:35.867" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5353" PostTypeId="2" ParentId="2140" CreationDate="2015-05-31T11:49:33.513" Score="0" Body="&lt;h1&gt;Flash Cards Viewer&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this challenge, your goal is to produce a flash card viewer. Since this is a Code Golf challenge, it won't be a particularly featureful flash card viewer - in fact, it'll be the bare minimum a flash card viewer can be. We'll implement the following features:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Reading a list of flash cards from a file;&lt;/li&gt;&#xA;&lt;li&gt;Quizzing the user on either &amp;quot;side&amp;quot; of the flash cards;&lt;/li&gt;&#xA;&lt;li&gt;Reporting to the user which ones they got incorrect.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input Description&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;As feature number 1 suggests, for this challenge you must read input from a file (unfortunately, your language cannot participate if it does not support reading from a file). The file shall be called &lt;code&gt;cards.txt&lt;/code&gt; and will be formatted as a simple list of values separated by a pipe character &lt;code&gt;|&lt;/code&gt;. For instance, a &amp;quot;Family Names in Chinese&amp;quot; flash card deck might look like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Mother|妈妈&#xA;Father|爸爸&#xA;Elder Sister|姐姐&#xA;Younger Sister|妹妹&#xA;Older Brother|哥哥&#xA;Younger Brother|弟弟&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output Description&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;First, your program should ask the user which side of the cards they want to revise, using a user input function such as &lt;code&gt;prompt()&lt;/code&gt; or &lt;code&gt;raw_input()&lt;/code&gt;. An input of &lt;code&gt;0&lt;/code&gt; indicates the user wants to revise the left side of the cards, and an input of &lt;code&gt;1&lt;/code&gt; indicates the user wants to revise the right side of the cards. Use the message &lt;code&gt;&amp;quot;Choose side:&amp;quot;&lt;/code&gt; when asking the user.&lt;/p&gt;&#xA;&lt;p&gt;After that, the program will pick out random entries from the opposite side of the user's selection, and prompt the user to type in the entry's corresponding value. After the user has gone through the entire list, output the pairs that he or she got incorrect.&lt;/p&gt;&#xA;&lt;p&gt;Here is an example of what a possible session might look like. What the user inputted in this example is signified with &lt;code&gt;&amp;gt;&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Choose side:&#xA;&amp;gt;0&#xA;妹妹&#xA;&amp;gt;Younger Sister&#xA;妈妈&#xA;&amp;gt;Mother&#xA;爸爸&#xA;&amp;gt;Father&#xA;哥哥&#xA;&amp;gt;Younger Brother&#xA;弟弟&#xA;&amp;gt;Older Brother&#xA;Older Brother|哥哥&#xA;Younger Brother|弟弟&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-05-31T11:49:33.513" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5354" PostTypeId="2" ParentId="5233" CreationDate="2015-05-31T14:25:29.613" Score="3" Body="&lt;p&gt;I think you should score machines on the number of rows in its transition table.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A simple, uncompressed table has (State * Colors) rows and 5 columns, organized like below.  I can't really find any solid reference for the correct order of columns, but that doesn't matter.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;cur state   cur color   new state   new color  direction&#xA;0           0           1           2          left&#xA;0           1           0           0          right&#xA;2           2           -           -          halt&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This would imply that scores should be states*colors, but I think there's more to it.   For example, there is potential for a lot of redundancy in these rows, like if there are a lot of cur-state/cur-color combinations that produce the same new-state/new-color/direction combination.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;My suggestion is to create/standardize a more &quot;compressed&quot; notation for these tables and then score Turing machines on the number of rows in the compressed tables.&lt;/strong&gt;  A table that is more compressible should indicate that a given machine is simpler than a machine with the same number of states/colors.  This allows for finely-grained scoring.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Below are some ideas for transition table compression that can stacked on to each other.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Idea 1:  Using &lt;code&gt;_&lt;/code&gt; for unspecified&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In many cases, it is possible to leave details out of the table to cover more cases in fewer lines.  I will denote unspecified information with &lt;code&gt;_&lt;/code&gt;.  If there is a &lt;code&gt;_&lt;/code&gt; in the cur-state/cur-color columns, then that indicates that all states/colors can go there.  If there is a &lt;code&gt;_&lt;/code&gt; in the new-state/new-color column, then that indicates that the state/color remains the same.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;cur state   cur color   new state   new color  direction&#xA;2           _           1           _          left&#xA;for a 3 state, 3 color machine, equals&#xA;2           0           1           0          left&#xA;2           1           1           1          left&#xA;2           2           1           2          left&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Idea 2: Allow &quot;conflicting&quot; rules to appear on the table&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The table is usually interpreted as a series of If-Then statements with no fixed order.  This would basically change it to a series of Else-If-Then with a fixed order.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;cur state   cur color   new state   new color  direction&#xA;2           0           1           2          left&#xA;2           _           1           _          left&#xA;for a 3 state, 3 color machine, equals&#xA;2           0           1           2          left&#xA;2           1           1           1          left&#xA;2           2           1           2          left&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Idea 3:  Auto-halting&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Instead of requiring a row for each halting condition, we can simply say &quot;If no rule on the table applied, then it halts.&quot;  This can probably save a line or two in most tables.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2015-05-31T14:25:29.613" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5356" PostTypeId="2" ParentId="5347" CreationDate="2015-05-31T17:16:08.153" Score="2" Body="&lt;h1&gt;Run trials until you run out of time&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;To some extent, it doesn't matter if there is a chance that you've picked the wrong winner, just whether or not anybody is going to be able to prove you're wrong.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your competition is based on a large group game (everyone playing at once) then program your controller to run, say, eight-hours-worth of games, let it run overnight, and call it good enough.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Pros&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;By definition, the tournament always runs in a feasible amount of time.&lt;/li&gt;&#xA;&lt;li&gt;To show that the results are incorrect and that the true winner is a different candidate, someone would have to run a second tournament for an even longer, unfeasible amount of time.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Cons&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You have to be able to let it run for many hours.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2015-05-31T17:16:08.153" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5357" PostTypeId="2" ParentId="3578" CreationDate="2015-06-01T01:11:53.743" Score="3" Body="&lt;h1&gt;Robot game player&lt;/h1&gt;&#xA;&lt;p&gt;We often have challenges that involve bots playing games. Usually they are KOTHs pitting programs from different users against one another. What I have in mind is a bit different. I envision a program playing a game designed for humans, awkwardly interacting through the input/output interfaces designed for humans. Sort of like &lt;a href=&quot;https://www.youtube.com/watch?v=z9uLb7-eJD8&quot; rel=&quot;nofollow noreferrer&quot;&gt;robots playing chess with physical pieces&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;So for example, the program would take as input not a list of coordinates of objects in its surrounding, but the pixels rendered by the game. For the output, it could send keystrokes or mouse clicks that it wants to make (if that is actually interesting for the particular game).&lt;/p&gt;&#xA;&lt;p&gt;A challenge like this which I found quite funny was to create a &lt;a href=&quot;https://codegolf.stackexchange.com/a/40555/30688&quot;&gt;QWOP-playing script&lt;/a&gt;. But this challenge was not very well done, as no suggestion for how to communicate with the game was provided.&lt;/p&gt;&#xA;&lt;p&gt;This does not necessarily have to be a fortnightly challenge, but it seemed like the place to post a vague challenge idea. If anyone has an idea for a good game to use, feel free to share it.&lt;/p&gt;&#xA;" OwnerUserId="30688" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-01T01:11:53.743" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5358" PostTypeId="2" ParentId="2140" CreationDate="2015-06-01T01:35:38.883" Score="0" Body="&lt;h1&gt;Fibonacci Box Packing Factory&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fibonacci&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fibonacci&amp;#39;&quot; rel=&quot;tag&quot;&gt;fibonacci&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Introduction&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;The Electronic Goods Company&lt;/em&gt; is a company that produces electronic item of various sizes. They need to package their items in boxes so that they can be shipped off to the store. There are some restrictions regarding what item can be stored in what box:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Each box can only contain a single item, and each item can only be contained in one box;&lt;/li&gt;&#xA;&lt;li&gt;The volume of the item cannot exceed the volume of the box;&lt;/li&gt;&#xA;&lt;li&gt;If the volume of the item is exactly the volume of the box, the item can be placed in the box without any padding material required;&lt;/li&gt;&#xA;&lt;li&gt;If the volume of the item is less than the volume of the box, then padding material equal to the difference of volumes must be placed in the box to prevent the item breaking.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;For example, an item that had a volume of 2m&lt;sup&gt;3&lt;/sup&gt; could be placed in a box of volume 2m&lt;sup&gt;3&lt;/sup&gt; without any extra padding material, but if the same item was placed in a box of volume 5m&lt;sup&gt;3&lt;/sup&gt;, we'd need to add padding material of 3m&lt;sup&gt;3&lt;/sup&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The supplier company is called the Fibonacci Box Company, which supplies The Electronics Goods Company with &lt;code&gt;N&lt;/code&gt; boxes and &lt;code&gt;P&lt;/code&gt; metres squared of filling material. Each box's volume is determined by the Fibonacci sequence (so the first box's volume is &lt;code&gt;1&lt;/code&gt;, the second is also &lt;code&gt;1&lt;/code&gt;, the third is &lt;code&gt;2&lt;/code&gt;, the fourth is &lt;code&gt;3&lt;/code&gt;, the fifth is &lt;code&gt;5&lt;/code&gt;, etc.). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program goal is to figure out the minimum amount of padding material required to pack all of the electronic items.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input Description&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input is a space separated list of integers that indicate the volume in square metres of the electronic items. &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;//TODO: Example inputs and outputs&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Output Description&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Output the minimum value of &lt;code&gt;P&lt;/code&gt; required to fill all the boxes.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;//TODO: Example inputs and outputs&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="21682" LastEditDate="2015-06-01T04:51:41.980" LastActivityDate="2015-06-01T04:51:41.980" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5359" PostTypeId="2" ParentId="2140" CreationDate="2015-06-01T04:00:15.480" Score="2" Body="&lt;h1&gt;From A to Zilch&lt;/h1&gt;&#xA;&lt;p&gt;Zilch, Farkle, Greed, Dice 10000: The game goes by many names, and many rules.  Your goal is to make a program that can play them all optimally.  The base rules goes as follows:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;At the beginning of your turn, you have 6 available dice&lt;/li&gt;&#xA;&lt;li&gt;At the beginning of each roll, you either choose to &lt;em&gt;bank&lt;/em&gt; or &lt;em&gt;continue&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If you choose to bank, then you receive the total number of points you have accumulated and your turn is over.&lt;/li&gt;&#xA;&lt;li&gt;Roll all available dice&lt;/li&gt;&#xA;&lt;li&gt;If you didn't roll any combinations, you get 0 points for your entire turn, and your turn is over&lt;/li&gt;&#xA;&lt;li&gt;You must take one or more distinct combinations from your available dice and score them.&lt;/li&gt;&#xA;&lt;li&gt;If you have no available dice left over, you are able to use all 6 dice again.&lt;/li&gt;&#xA;&lt;li&gt;Go back to step #2&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Your goal is to write a function or program that accepts 3 parameters:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The number of points you currently have&lt;/li&gt;&#xA;&lt;li&gt;The number of dice you have left&lt;/li&gt;&#xA;&lt;li&gt;A list of (Combination, Point) pairs that define what combinations give points&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;and then returns a Truthy value if you should &lt;em&gt;continue&lt;/em&gt;, otherwise a Falsy value.&lt;/p&gt;&#xA;&lt;p&gt;Combinations are passed as a list of integers that represent the required digits for that combination.&lt;/p&gt;&#xA;&lt;p&gt;For example, if I named my function &lt;code&gt;foo&lt;/code&gt;, then a call to my function might look like:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;foo(100, 5, [([1],100), ([5],50), ([1,1,2],1000)])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This would mean that I have 100 points so far, 5 dice left, and there are 3 possible combinations:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Rolling a &lt;code&gt;1&lt;/code&gt; would give me 100 points&lt;/li&gt;&#xA;&lt;li&gt;Rolling a &lt;code&gt;5&lt;/code&gt; would give me 50 points&lt;/li&gt;&#xA;&lt;li&gt;Rolling 2 &lt;code&gt;1&lt;/code&gt;s and a &lt;code&gt;2&lt;/code&gt; would give me 1000 points.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Considering I have 5 dice, and it is quite likely for me to roll a &lt;code&gt;1&lt;/code&gt; or a &lt;code&gt;5&lt;/code&gt;, I should definitely return a Truthy value.  Also, note that in the above example, rolling &lt;code&gt;11235&lt;/code&gt; would give me a maximum of &lt;code&gt;'112'=&amp;gt;1000 + '5'=&amp;gt;50 = 1050&lt;/code&gt; points.  Each die can only be included in one combination.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-01T04:00:15.480" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5360" PostTypeId="1" AcceptedAnswerId="5361" CreationDate="2015-06-01T04:53:03.623" Score="6" ViewCount="237" Body="&lt;p&gt;So I've vastly overestimated the processing it would take to find &lt;a href=&quot;https://codegolf.stackexchange.com/q/51067/&quot;&gt;domino tilings of a rectangle&lt;/a&gt; and wrote up a challenge that has gotten a little weird.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First of all, the execution times are really low. For both answers, execution takes roughly the same time as compilation. The answers (both in C) cannot even turn on compiler optimizations because the increased compilation time actually hurts their scores...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, both answers have to work for all rectangles up to 8 x 8 but are currently scored using 8 x 6 rectangles. 8 x 8 takes roughly a second for both answers (with optimizations turned on), so that might help. Doing so would not change the positions in the current leader board.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But there's another problem. The mandatory output is 9 MiB for 8 x 6 and 950 MiB for 8 x 8. Printing the output seems to take up roughly half the execution times for the answers in their current state, and it has been suggested that preparing the output for printing might actually require a lot more time than finding the valid tilings.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I thought requiring the output instead of just counting the tilings was it is was a good way of making sure that there was no blurry line between hardcoding the result and actually calculating it. At the same time, eliminating the output doesn't seem fair to the answerers who spent a considerable amount of time optimizing the output (which wasn't intended to be the point, but still is something that can be scored).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My gut feeling in that its too late to change the output format, but that I should score the submissions using 8 x 8 rectangles. Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-06-01T05:53:10.243" Title="What should I do with my fastest code challenge?" Tags="|discussion|specific-question|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5361" PostTypeId="2" ParentId="5360" CreationDate="2015-06-01T05:53:10.243" Score="6" Body="&lt;p&gt;If you want to reduce the impact of producing the output, I don't think increasing the size to 8 x 8 would help. At least for my solution, the relative time to produce the output is actually larger at that size.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For 8 x 6, the times (as measured on my own machine) are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;167,089 solutions.&lt;/li&gt;&#xA;&lt;li&gt;15 ms for finding solutions (counted only).&lt;/li&gt;&#xA;&lt;li&gt;30 ms for finding and outputting solutions (redirected to /dev/null).&lt;/li&gt;&#xA;&lt;li&gt;50% of time used for output.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For 8 x 8, the same times are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;12,988,816 solutions.&lt;/li&gt;&#xA;&lt;li&gt;778 ms for finding solutions.&lt;/li&gt;&#xA;&lt;li&gt;1,822 ms for finding and outputting solutions.&lt;/li&gt;&#xA;&lt;li&gt;57% of time used for output.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The only problem you solve with the larger size is that the compile time becomes mostly insignificant. But that could also be done by not counting the compile time at all. I figure you might have wanted to include the compile time to give interpreted languages a better chance. But in reality, they're probably at a big disadvantage anyway. I suspect that it would be almost like using a non-golf language for a golf challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;IMHO, only requiring the solution count as output, and measuring it for 8 x 8,  would be the best option if you want to measure the efficiency of the core algorithm and its implementation. It should be possible to detect blatant cheating from looking at the code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or maybe you could have a hybrid? Say the solutions need to produce the output by default, which would be used for correctness testing. But they can have a command line switch to disable output, and only produce a count, which is used for the performance benchmark.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;BTW: You absolutely have to require some kind of output. Otherwise a good optimizing compiler might optimize away the whole code.&lt;/p&gt;&#xA;" OwnerUserId="32852" LastActivityDate="2015-06-01T05:53:10.243" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5362" PostTypeId="2" ParentId="5343" CreationDate="2015-06-01T08:44:02.243" Score="-4" Body="&lt;h1&gt;Yes, I/O in any base should be acceptable by default&lt;/h1&gt;&#xA;&lt;p&gt;Binary or hexadecimal, e.g. could be similarly useful for some languages. In the interests of consistency, they should also be allowed for input. Again, the challenge author can specifically disallow this if s/he wants.&lt;/p&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-01T08:44:02.243" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5363" PostTypeId="2" ParentId="2140" CreationDate="2015-06-01T11:50:18.760" Score="2" Body="&lt;h1&gt;Pirates!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;Arrr mateys!&lt;/p&gt;&#xA;&lt;p&gt;All hands on deck! Tharr be a ship o' other pirates comin' starboard up t' us on t' starboard! Man t' six pounders! We'll show these guys what we're made of!&lt;/p&gt;&#xA;&lt;p&gt;...&lt;/p&gt;&#xA;&lt;p&gt;What? They have t' exact same ship, and t' exact same six pounders as us? That don't matter, we've got better &lt;strong&gt;cannon strategy&lt;/strong&gt;! As long as we &lt;strong&gt;reinforce&lt;/strong&gt; points o' our ship that they fire upon, and fire upon unreinforced parts o' their ship, we're aye t' win! Now, where's that techno thingamabob that said what t' do...?&amp;quot;&lt;/p&gt;&#xA;&lt;h2&gt;Game Description&lt;/h2&gt;&#xA;&lt;p&gt;In this King of the Hill challenge, you write a program to command a pirate crew in a naval war. The other pirate crews are controlled by other players' programs. By carefully choosing where and when to fire, you can defeat the other pirate crews and claim the golden treasure -- the green checkmark of legend.&lt;/p&gt;&#xA;&lt;p&gt;A &lt;em&gt;battle&lt;/em&gt; occurs between two ships. Each ship is mounted with 7 cannons in a row, labelled &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;7&lt;/code&gt;. Each cannon is directly opposite to the cannon on the other side. Ships all start with 0 &lt;em&gt;damage&lt;/em&gt;. If a ship reaches 10 damage, it sinks, and the crew of the other ship win the battle. If both ships sink at the same time, the battle is a draw.&lt;/p&gt;&#xA;&lt;p&gt;Each battle consists of several turns. On each turn your crew can do any of the following actions:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;L:n&lt;/code&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Load&lt;/strong&gt; a cannonball into cannon &lt;code&gt;n&lt;/code&gt;. All the cannons start with cannonballs in them, and naturally firing a cannon without a cannonball doesn't do anything.&lt;/p&gt;&#xA;&lt;p&gt;You can only load one cannonball into a cannon at a time.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;R:n&lt;/code&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Reinforce&lt;/strong&gt; a cannon &lt;code&gt;n&lt;/code&gt;. Reinforcements will nullify a single attack on that cannon. However, reinforcements are but a transient defence -- they will wear off two turns after they have been applied.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;[Todo: Clarification on &amp;quot;two turns&amp;quot;]&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;F:n&lt;/code&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Fire&lt;/strong&gt; a cannon &lt;code&gt;n&lt;/code&gt;, which will hit cannon &lt;code&gt;n&lt;/code&gt; on the opposing side. If the cannon is not reinforced, the opposing ship's damage will increase by &lt;code&gt;1&lt;/code&gt;. If the cannon is reinforced, the ship will not take damage, but the reinforcement will be destroyed.&lt;/p&gt;&#xA;&lt;h3&gt;Input Description&lt;/h3&gt;&#xA;&lt;p&gt;The controller will call your program from the command line like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;command&amp;gt; &amp;lt;history&amp;gt; &amp;lt;enemy_history&amp;gt; &amp;lt;damage&amp;gt; &amp;lt;your_damage&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;where:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;command&lt;/code&gt; is the command needed to run your program. For instance, if your program's source code was in the file &lt;code&gt;arrr.rb&lt;/code&gt;, the command is &lt;code&gt;ruby arrr.rb&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;history&lt;/code&gt; is a comma separated list of moves that you have made. For instance, &lt;code&gt;L:1,F:1,L:2,F:2&lt;/code&gt; would mean that you loaded and fired cannon 1, and loaded and fired cannon 2.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;enemy_history&lt;/code&gt; is a comma separated list of moves the enemy has made.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;damage&lt;/code&gt; is your ship's damage (from &lt;code&gt;0&lt;/code&gt; to &lt;code&gt;9&lt;/code&gt;, since &lt;code&gt;10&lt;/code&gt; means you've sunk)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;enemy_damage&lt;/code&gt; is the enemy ship's damage&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Output Description&lt;/h3&gt;&#xA;&lt;p&gt;Output to STDOUT in the form:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A:N&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;where &lt;code&gt;A&lt;/code&gt; is either &lt;code&gt;L&lt;/code&gt;, &lt;code&gt;R&lt;/code&gt;, or &lt;code&gt;F&lt;/code&gt;, and &lt;code&gt;N&lt;/code&gt; is an integer from 1 to 7. This indicates the move that you want the pirates to do.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;[Todo: The rest of the spec. I'm tired and I'm posting it here to save it. Will come back some time to finish it. Maybe. Honestly I'm not too fond of the idea but it might have some potential.]&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-01T11:50:18.760" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5367" PostTypeId="2" ParentId="5343" CreationDate="2015-06-02T00:49:08.710" Score="21" Body="&lt;h1&gt;Yes, I/O in unary, binary, octal, decimal or hexadecimal should be acceptable by default.&lt;/h1&gt;&#xA;&lt;p&gt;These conversions are generally simple, and for most languages they are trivial. For most languages and challenges, this won't make any kind of difference, but this could make a significant usability improvement for some of our most beloved esoteric languages. Challenge posters may of course ban any or all of these in cases that an unfair advantage may exist.&lt;/p&gt;&#xA;" OwnerUserId="31054" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-02T00:49:08.710" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5369" PostTypeId="1" CreationDate="2015-06-02T10:38:38.000" Score="2" ViewCount="171" Body="&lt;p&gt;I will use this to test a modified version of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/48353/red-vs-blue-pixel-team-battlebots&quot;&gt;Red vs. Blue - Pixel Team Battlebots&lt;/a&gt; code that automaticaly gets data via javascript.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please ignore it for now.&lt;/p&gt;&#xA;" OwnerUserId="32107" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2015-11-01T11:49:22.847" Title="Testing a new challenge v1" Tags="|discussion|sandbox|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5370" PostTypeId="2" ParentId="5369" CreationDate="2015-06-02T10:43:42.037" Score="0" Body="&lt;pre&gt;&lt;code&gt;var bot = {&#xA;    name: &quot;testBot&quot;,&#xA;    numbOfBullets: 7,&#xA;    reloadSpeed: 1,&#xA;    shotsPerTurn: 1,&#xA;    moveSpeed: 2&#xA;}&#xA;return bot&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;!&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;var shots = []&#xA;var testBot_moveUp = true&#xA;if(Math.random() * 2 &amp;gt; 1)&#xA;    testBot_moveUp = false&#xA;shots.push(Math.floor((Math.random() * 24) + 1))&#xA;var move = 0&#xA;if (testBot_moveUp)&#xA;    move = yourMovement[yourMovement.length - 1] + 2&#xA;else&#xA;    move = yourMovement[yourMovement.length - 1] - 2&#xA;move = 12&#xA;var play = []&#xA;play.shots = shots&#xA;play.move = move&#xA;play.reload = false&#xA;return play&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;testing code&lt;/p&gt;&#xA;" OwnerUserId="32107" LastEditorUserId="32107" LastEditDate="2015-06-04T10:14:21.380" LastActivityDate="2015-06-04T10:14:21.380" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5372" PostTypeId="2" ParentId="2140" CreationDate="2015-06-03T15:35:37.117" Score="0" Body="&lt;h1&gt;NP Cops and Robbers&lt;/h1&gt;&#xA;&lt;p&gt;This is an idea I've had for a while, and I really want to get it to work, but there are some large hurdles.&lt;/p&gt;&#xA;&lt;p&gt;Hurdle 1: I need to pick a puzzle, preferably one that is NP-Complete. I think lots of Nikoli puzzles are good candidates, and I am leaning towards &lt;a href=&quot;http://en.wikipedia.org/wiki/Light_Up_(puzzle)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Light Up&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Cops:&lt;/h1&gt;&#xA;&lt;p&gt;Cops will write a program to generate a puzzle.  The puzzle has a maximum size of WxH.  The cops must be able to generate the puzzle in under 1 second.  Puzzles must be deterministic, but randomness is allowed as long as I can set the seed.  The puzzles generated must have only 1 solution.  The cop will post a sample puzzle in his post (for the robbers to use)&lt;/p&gt;&#xA;&lt;p&gt;Your score is the shortest time any of the robbers solved your puzzle.  Highest score wins.&lt;/p&gt;&#xA;&lt;h1&gt;Robbers:&lt;/h1&gt;&#xA;&lt;p&gt;Robbers write programs to solve the puzzles.  Robbers are not allowed to target the specific puzzles, but are allowed to target the specific algorithms used to generate the puzzle.  If the cop were to change the sample puzzle posted, the robber should still be able to solve the new puzzle in a similar amount of time.&lt;/p&gt;&#xA;&lt;p&gt;If you solve a puzzle faster than any other robber, your score increases by the time taken to solve that puzzle.  Highest score wins.&lt;/p&gt;&#xA;&lt;p&gt;Hurdle 2: How to measure time taken.  I don't want to run all of the cops/robbers, especially if this becomes popular.  I also don't want to use the GOLF framework, as that would take a really long time to run.  So, possible I could have the person run som CPU-intesive algorithm on their computer, measure how long it takes, and scale all of their answers according to that time.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-03T15:35:37.117" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5374" PostTypeId="2" ParentId="2140" CreationDate="2015-06-03T20:03:14.997" Score="0" Body="&lt;h1&gt;Create a basic spell checker&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&#xA;In this challenge, you have to implement a basic spell checker. Your program will use the first input as a source.&lt;/p&gt;&#xA;&lt;h2&gt;Specifications&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You will receive two inputs, one is a sentence/paragraph you use as a source for your spell checker, and the other includes wrong words (they can be correct too) which you have to correct using the first input.&lt;/li&gt;&#xA;&lt;li&gt;Possible mistakes: Missing one letter (e.g. helo), one extra letter (e.g. heello), substitution of one character (e.g. hilp instead of help), transposition of two adjacent characters (e.g. hlep instead of help).&lt;/li&gt;&#xA;&lt;li&gt;In other words, the mistake and the original word have to have a Damerau–Levenshtein distance of one.&lt;/li&gt;&#xA;&lt;li&gt;You can separate the inputs in any reasonable format. For example, instead of using a newline, you can use a pipe sign to separate them. (|) However, watch out so you don't use something like letters because they are used in the 1st input.&lt;/li&gt;&#xA;&lt;li&gt;It's possible for a word to have neither an identical word nor a word with 1 distance from the first input. You will have to leave them unchanged.&lt;/li&gt;&#xA;&lt;li&gt;You don't need to do anything with punctuation. That is, I won't test words that are followed by a punctuation. (E.g. From the first example, I won't ask the correction of 'blod')&lt;/li&gt;&#xA;&lt;li&gt;Challenge is case insensitive, both the input and output. Meaning that if 'The' is used in the 1st input and the 2nd input is 'teh' you can change it to 'The', 'teh', 'teH', and similar cases.&lt;/li&gt;&#xA;&lt;li&gt;If a word is in the first input, but also has a distance of 1 with one of the other words, do not correct it.&lt;/li&gt;&#xA;&lt;li&gt;If there are two words with the same distance, you can output either of them. (E.g. 'en' can change into 'on' and 'in' if the words are both in the first input.) You can also output both of them, but you'll have to use a slash between them. (E.g. 'en' can be corrected into 'in/on')&lt;/li&gt;&#xA;&lt;li&gt;You can assume words are just sequences of letters separated by spaces.&lt;/li&gt;&#xA;&lt;li&gt;You can use STDIN or the closest alternative in your language.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loophole rules&lt;/a&gt; apply.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A criminal strain ran in his blood, which, instead of being modified, was increased and rendered infinitely more dangerous by his extraordinary mental powers. &#xA;&#xA;increasd mnetal&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;increased mental&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;The fact is that upon his entrance I had instantly recognized the extreme personal danger in which I lay.&#xA;&#xA;I recognizi dnger en&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;I recognize danger in    &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="41285" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-04T13:30:26.267" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="5375" PostTypeId="2" ParentId="1061" CreationDate="2015-06-04T07:59:53.810" Score="45" Body="&lt;h1&gt;Changing your username to fit a username dependent challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Changing your username or registering a new one to make your score better in username or userID dependent challenges.&lt;/p&gt;&#xA;" OwnerUserId="7311" LastActivityDate="2015-06-04T07:59:53.810" CommentCount="6" CommunityOwnedDate="2015-06-04T07:59:53.810" ContentLicense="CC BY-SA 3.0" />
  <row Id="5376" PostTypeId="2" ParentId="5369" CreationDate="2015-06-04T09:03:58.550" Score="1" Body="&lt;p&gt;aa&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;var bot = {&#xA;    name: &quot;testBot2&quot;,&#xA;    numbOfBullets: 7,&#xA;    reloadSpeed: 1,&#xA;    shotsPerTurn: 1,&#xA;    moveSpeed: 2&#xA;}&#xA;return bot&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;!&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;var shots = []&#xA;var testBot_moveUp = true&#xA;if(Math.random() * 2 &amp;gt; 1)&#xA;    testBot_moveUp = false&#xA;shots.push(2)&#xA;var move = 0&#xA;if (testBot_moveUp)&#xA;    move = yourMovement[yourMovement.length - 1] + 2&#xA;else&#xA;    move = yourMovement[yourMovement.length - 1] - 2&#xA;move = 12&#xA;var play = []&#xA;play.shots = shots&#xA;play.move = move&#xA;play.reload = false&#xA;return play&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;testing code2&lt;/p&gt;&#xA;" OwnerUserId="32107" LastEditorUserId="32107" LastEditDate="2015-06-04T10:14:09.597" LastActivityDate="2015-06-04T10:14:09.597" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5377" PostTypeId="2" ParentId="5369" CreationDate="2015-06-04T10:08:45.513" Score="0" Body="&lt;p&gt;aa&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;var bot = {&#xA;    name: &quot;testBot3&quot;,&#xA;    numbOfBullets: 7,&#xA;    reloadSpeed: 1,&#xA;    shotsPerTurn: 1,&#xA;    moveSpeed: 2&#xA;}&#xA;return bot&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;!&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;var shots = []&#xA;var testBot_moveUp = true&#xA;if(Math.random() * 2 &amp;gt; 1)&#xA;    testBot_moveUp = false&#xA;shots.push(Math.floor((Math.random() * 24) + 1));&#xA;var move = 0&#xA;if (testBot_moveUp)&#xA;    move = yourMovement[yourMovement.length - 1] + 2&#xA;else&#xA;    move = yourMovement[yourMovement.length - 1] - 2&#xA;var play = []&#xA;play.shots = shots&#xA;play.move = move&#xA;play.reload = false&#xA;return play&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;testing code333&lt;/p&gt;&#xA;" OwnerUserId="32107" LastEditorUserId="32107" LastEditDate="2015-06-04T10:42:13.267" LastActivityDate="2015-06-04T10:42:13.267" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5378" PostTypeId="2" ParentId="2436" CreationDate="2015-06-04T12:39:45.017" Score="2" Body="&lt;p&gt;I've added a &lt;code&gt;pre&lt;/code&gt; rule to the CSS.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With you in the next build.&lt;/p&gt;&#xA;" OwnerUserId="8608" LastActivityDate="2015-06-04T12:39:45.017" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5379" PostTypeId="1" CreationDate="2015-06-04T16:50:52.930" Score="13" ViewCount="212" Body="&lt;p&gt;The idea was &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/22013153#22013153&quot;&gt;mentioned in chat&lt;/a&gt; earlier today that KotHs could be run in a distributed fashion.  I believe that there are several users (including me) who have Raspberry Pis that could contribute to a KotH Pi Farm.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is an idea that I would like to see move forward.  It would allow for up-to-date results to be continuously generated, or for a &quot;continuous KotH&quot; to be played.  It would also take some of the processing burden off of contest hosts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What would be the first steps in setting up this distributed KotH project?&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="20283" LastEditDate="2015-06-04T17:12:33.780" LastActivityDate="2015-06-10T08:47:11.983" Title="How could we run KotHs in a distributed fashion?" Tags="|discussion|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5380" PostTypeId="2" ParentId="5379" CreationDate="2015-06-04T18:44:57.157" Score="1" Body="&lt;p&gt;An idea for running a distributed javascript KotH within a code snippet, using google spreadsheets for storing matches and results:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Start with one of the existing javascript KotH controllers that exist in a code snippet, so the user can run the controller and a match in their browser.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Add two google spreadsheets. The first is a list of desired matchups. The second is a list of submitted results, and gets added to via a google form.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, modify the controller so that it automatically queries the spreadsheets to figure out which matchups haven't been run [enough times], runs one such matchup, and submits the results to the form.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The end result is that you get multiple copies of every desired matchup having been run. If the outcomes are too widely varied, that probably means there's too much randomness in the spec, maybe it needs more iterations per match? Or maybe someone is cheating, so maybe some sort of way to identify the submitter would be required.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;PS: Now, take everything I just said, and remove the javascript. Now people have to checkout the controller code from github or wherever before they can run it, but everything else about the idea remains the same.&lt;/p&gt;&#xA;" OwnerUserId="4787" LastActivityDate="2015-06-04T18:44:57.157" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5381" PostTypeId="2" ParentId="5079" CreationDate="2015-06-04T19:08:38.763" Score="1" Body="&lt;p&gt;I like the idea. I also have some answers that don't have a language for the header (like for a tips page or something) so these can be omitted, in my opinion. Also, some challenges such as KOTH for a specific language have the header as a bot name, instead of a language. These could be fixed by checking posts for a prettify tag declaration that can override a header, since I use &lt;a href=&quot;https://meta.stackexchange.com/questions/184108/what-is-syntax-highlighting-and-how-does-it-work&quot;&gt;prettify tags&lt;/a&gt; in my code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regex to match a prettify tag: &lt;code&gt;&amp;lt;!--(?:\w)*language(-all)?(?:\w)*:(?:\w)*lang-(.*?)(?:\w)*--&amp;gt;&lt;/code&gt; The first capturing group indicates whether the tag is for the entire post or the next snippet. The second capturing group is the language name or abbreviation (e.g. &lt;code&gt;js&lt;/code&gt; for JavaScript or &lt;code&gt;cpp&lt;/code&gt; for C++).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example tag usage: &lt;code&gt;&amp;lt;!-- language: lang-python --&amp;gt;&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2015-06-04T19:08:38.763" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5385" PostTypeId="1" CreationDate="2015-06-05T05:47:15.587" Score="1" ViewCount="45" Body="&lt;p&gt;I have a large text file (~6kB) that forms part of my challenge. How do I provide a link to download it instead of embedding the text in my question? I believe I have seen other questions do this but I don't have any examples.&lt;/p&gt;&#xA;" OwnerUserId="29560" LastActivityDate="2015-06-05T06:20:10.587" Title="How do I include a link to a large file" Tags="|support|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5386" PostTypeId="2" ParentId="5385" CreationDate="2015-06-05T06:08:22.190" Score="8" Body="&lt;h1&gt;Host it elsewhere&lt;/h1&gt;&#xA;&lt;p&gt;And provide a link to where it is hosted.&lt;/p&gt;&#xA;&lt;p&gt;Tons of sites let you do this for free. A very simple option is &lt;a href=&quot;http://pastebin.com/TjBdu144&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pastebin&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Google docs, Github, and Dropbox are some other common options that come to mind. Though for those you'll need an account.&lt;/p&gt;&#xA;&lt;p&gt;If you specifically want a &lt;em&gt;download&lt;/em&gt; link, these kind of sites usually have an option for that (&lt;a href=&quot;http://pastebin.com/download.php?i=TjBdu144&quot; rel=&quot;nofollow noreferrer&quot;&gt;example&lt;/a&gt;). Though I'd advise against that here. I'd personally prefer to be directed to the raw text; I know how to download if I want to.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-05T06:20:10.587" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5387" PostTypeId="2" ParentId="2140" CreationDate="2015-06-05T08:41:25.737" Score="4" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Sandbox note : Big change in specs, mainly for balancing issues (thanks to @trichoplax for your sugeestions :))&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Major changes : Starting, Turn deroulement (2 phases from now), tie-break, Cloning. Merging may be removed due to the new specs (rendered pretty useless).&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;With the current specs, 1000 turn migh be WAAAAAAY to much, as you could easily go up to the 17 range... well, you could reach it in 3 turns, and with 3 turns more you could wipe everything with an explode.... Will fix that&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Summoner war&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;tags : &lt;a href=&quot;/questions/tagged/king-of-the-kill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-kill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-kill&lt;/a&gt;&lt;a href=&quot;/questions/tagged/java&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;java&amp;#39;&quot; rel=&quot;tag&quot;&gt;java&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You're a Summoner controlling Demons. Regulary, some tournament are done to dertermine who will be the king. And the king is always the strongest !&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As it is a turn-based game, each Summoner will play twice against each opponent. So, for each pair of submission, they will all fight while playing first AND playing last.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A fight is limited to 1000 turns.&#xA;A turn is the cumulated actions of both Masters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner of a fight is the one who totally destroyed all the demons of the opponent. The number of Demons you killed will be used as tie-breaker&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner of the tournament is the Summoner who won the most fights. The same tie-breaker as for fights is used, except it is the cumulated amount of kill :).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Grid&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The grid is 9*17 and the cells are placed as above :&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.................&#xA;.................&#xA;.6..1.......1..6.&#xA;.................&#xA;.5..2.......2..5.&#xA;.................&#xA;.4..3.......3..4.&#xA;.................&#xA;.................&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The numbers indicates the position of the starting Demons. Each Summoner will   see itself as the left Summoner.&#xA;Demons can move and attack on horizontal lines, vertical lines and diagonals.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Starting&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You will chose up to 6 Demons to summon, determining their stats and their capacities. &#xA;You can give a maximum of 12 stat point distributed among your Demons&#xA;Each Demon you summon (at this moment) will cost you 2 points.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Summoning 6 demons will cost 6*2=12 points&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Summoning 3 demons will cost you 3*2=6 points, leaving you 6 points to increase their statistics.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Statistics&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Demons have 4 statistics :&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; Life &#xA;    Hp = 2+Life&#xA;    If the hp of your Demon reach 0, it dies.&#xA; Attack&#xA;    Determine the damages you deal/heal&#xA; Defense&#xA;    Reduct all incoming damages by defense/2 rounded to superior. &#xA;    You can't take less than 1 (except if you're attacked for 0 hit points)&#xA; Range &#xA;    Determine the range of your attacks&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Basic Moves&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There's 3 moves that every Demons can do :&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; Move&#xA;    The Demons will move by one unit.&#xA; Attack&#xA;    Deal damages to the Demon in an adjacent cell.&#xA;    Damages: attack+1&#xA; Explode&#xA;    Destroy the Demon and deal damages to it's surrounding.&#xA;    It only can be used if your Demon have more than 40% hp.&#xA;    It does raw damages (defense doesn't influence it).&#xA;    Damages: attack/2 (raw)&#xA;    Radius : 1+sqrt(range)  (square shaped, truncated)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Capacities&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each Demon will have one capacity in the following list:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; Merge&#xA;    Allows a Demon to absorb an other adding their stats &#xA;    During the merge process, you chose if you want to keep Merge as a capacity, &#xA;    or if you want to take the other Demon's capacity.&#xA;    After merging, a Demon won't be able to clone again.&#xA; Heal&#xA;    Heal nearby Demons but not self.&#xA;    Heal: attack/2  rounded to superior&#xA;    Radius : range+1(square)&#xA; Cross&#xA;    Deal damages on all lines or diagonals around your Demon&#xA;    It will damages on lines if the direction you specify is&#xA;    North/South/East/West/Self&#xA;    Otherwise, it will damages on the diagonals.&#xA;    Damages : attack&#xA;    Radius : range+1(lines or diagonals)&#xA; Eat&#xA;    Steal some stats if it kills the target&#xA;    The target must be on an adjacent cell.&#xA;    Damages : attack&#xA;    Stat stolen : range (maximum)&#xA;                The stat stolen will be distributed randomly between the stats&#xA;                of your Demon. It cannot steal more point that the opponent &#xA;                Demon have.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Misc&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You may give an optional name for your Demons. This name will only be known by you, and could be useful if you want to remember the role you gave to your Demons. This name could be changed at anytime.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Turn deroulement&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each player's turn has 2 steps : the enhance phase and the battle phase.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A turn is derouling as following :&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;player 1's enhancing phase&#xA;player 2's enhancing phase&#xA;player 1's battle phase&#xA;player 2's battle phaes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Enhance phase&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each turn, you will be given 6+nbTurn/50 stats points. &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;On turn 1, you will have 6 points.&#xA;On turn 50, 7 points. &#xA;On turn 1000, 26 points. &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Those points will stack upon time if you don't use them.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;On turn 1, I had 6 points, I used 4 remain :2&#xA;Turn 2, I gain 6 points more, I can use 8.&#xA;etc ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Those points can either be used to increase the stats of your Demons (1 point = 1 life||attack||defense||range) or to clone them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To clone a Demon, you must use &lt;code&gt;2+life+attack+defense+range&lt;/code&gt; points. In result, the origin demon will have his points halved, and a clone with the other half will spawn.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Let's say I want to clone the following demon :&#xA; life=2&#xA; attack=2&#xA; defense=5&#xA; range=0&#xA; capacity=Cross&#xA;He has 2+2+5+0 = 9 statistics points, so I would need 2+9=11 points.&#xA;The resulting Demons would both be :&#xA; life=1&#xA; attack=1&#xA; defense=3 (yes, stats are rounded to superior :))&#xA; range=0&#xA; capacity=Cross&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Battle phase&#xA;At the start of the battle phase, you will be given :&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The current tableboard&lt;/li&gt;&#xA;&lt;li&gt;A list containing your Demons and all the information about them&lt;/li&gt;&#xA;&lt;li&gt;A list containing the stats and position of your opponent's Demons&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You will return the actions of all your Demons.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;you have up to x ms to return this list (not decided yet)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Once you've chosen your actions, the following will happen :    &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Every Demons which had to move, will move. If two Demons try to move to the same location, they will both stay still.&lt;/li&gt;&#xA;&lt;li&gt;All the actions which change the hp(heal/damages) will happens at the same time.&lt;/li&gt;&#xA;&lt;li&gt;Finally, your turn end, and your opponent's will decide his actions.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Submissions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each submission will be written in Java. You can't interact with other players nor the controller in any way you could imagine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must extend the following class :&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Class not yet developped &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;A github link will be provided, for the controller etc.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Sandbox notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm aware that there's plenty typos and errors, I will correct them before the final version. Some text and clarification might be added.&#xA;As it can be complicated (lot of options), 4 demonstration Summoner will be provided (and will be in the pool), each of them using only some functionnality (prooving that you don't have to use every single thing).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not done yet with all the sources for the controller/field etc. An API will be provided for extracting/using informations easily. &#xA;Once it will be complete, I will put a time limit for the execution of one turn.&#xA;If I have time, I will provide an interface to see the fights with colors etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Questions :&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this too complex? I'd like to know if to much options are given, and if it's confusing (ie, if you don't know where to start).&lt;/li&gt;&#xA;&lt;li&gt;Is there some points of the ruleset that are obviously dangerous for the good health of this contest.&lt;/li&gt;&#xA;&lt;li&gt;Any suggestion?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Thanks for reading :)&lt;/p&gt;&#xA;" OwnerUserId="41019" LastEditorUserId="41019" LastEditDate="2015-06-22T14:14:38.110" LastActivityDate="2015-06-22T14:14:38.110" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="5388" PostTypeId="2" ParentId="2140" CreationDate="2015-06-05T21:11:59.407" Score="10" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot;&gt;python&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Snakes on a Torus&lt;/h1&gt;&#xA;&lt;p&gt;This would be representative of the classic &lt;a href=&quot;http://en.wikipedia.org/wiki/Snake_%28video_game%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;Snake&lt;/a&gt; video game, but multiplayer. The game would be 2-4 players.&lt;/p&gt;&#xA;&lt;h3&gt;Game Description:&lt;/h3&gt;&#xA;&lt;p&gt;Each of the 2-4 snakes will always start at one of four fixed position on the board. Each snake continuously moves forwards at a constant rate. A snake stops moving upon death. The board wraps in both directions, but would be graphically represented as a grid (plane) in an actual game with people, so think of it as &amp;quot;snakes on a plane&amp;quot; if you wish. The dimensions of the grid are TBD.&lt;/p&gt;&#xA;&lt;p&gt;Apples and poison apples (referred to as Blues and Reds) will spawn in random locations on the board, either at a random rate, or only to replace one as it's consumed (TBD). An blue increases your snake's length by 3. A red reduces your snake's length by 2 (to a minimum of 2). Both are useful in managing your snake's length.&lt;/p&gt;&#xA;&lt;p&gt;A snake's length will increase by n by the tail not moving for n turns. A snake's length will decrease by n by the tail moving an extra space for n turns. Eating one blue followed immediately by one red should hold the tail for 1 turn, then continue as normal (they cancel).&lt;/p&gt;&#xA;&lt;p&gt;Your snake will die if its head collides with its body or the head or body of another snake, whether alive or dead. So a head-on collision means both snakes die.&lt;/p&gt;&#xA;&lt;h3&gt;Your Bot's Job:&lt;/h3&gt;&#xA;&lt;p&gt;You will create a bot to play this game by submitting which of the 3 directions to move (turn left, straight, turn right) based on information including:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The game's grid as a 2D array&lt;/li&gt;&#xA;&lt;li&gt;Each snake's current length&lt;/li&gt;&#xA;&lt;li&gt;An ordered list of your snake's tiles and orientation&lt;/li&gt;&#xA;&lt;li&gt;An ordered list of each enemy snake's tiles and orientation, and whether the snake is dead or alive.&lt;/li&gt;&#xA;&lt;li&gt;The location of every apple on the board&lt;/li&gt;&#xA;&lt;li&gt;The location of every poison apple on the board&lt;/li&gt;&#xA;&lt;li&gt;Each player's numbers of wins, kills, and deaths.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You will likely be creating class that is an instance of a base class &lt;code&gt;Snake&lt;/code&gt;, and implementing the necessary methods. If a move is not returned in the appropriate time-frame, your snake will move straight.&lt;/p&gt;&#xA;&lt;h3&gt;The Winner:&lt;/h3&gt;&#xA;&lt;p&gt;Each snake will be pitted against each other snake multiple times. The one which has the highest score after the most games wins. Scoring TBD, but will likely be something like +100 per win, +10 per death on your snake (someone ran into you), -10 per death. Tied games will be possible, since there will be allowed a short period of time while the last snake is alone on the map, in case it would die soon after winning.&lt;/p&gt;&#xA;&lt;h3&gt;Suggestions?&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Suggestions for scoring are welcome&lt;/strong&gt;. Besides winning, how should apples/length/kills be factored in? Personally, I was thinking most wins, followed by most kills, but I can see that might encourage some people to stay small and avoid everything. Some options (feel free to suggest more):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Prioritize wins, then kills&lt;/li&gt;&#xA;&lt;li&gt;Weighted or point-based scoring for wins, kills, apples&lt;/li&gt;&#xA;&lt;li&gt;Just score by length at end of match (so maybe after eliminating the others you could just grow until your bot dies)&lt;/li&gt;&#xA;&lt;li&gt;Collect points by being the longest snake every tick&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;s&gt;I don't know how soon I will get to making a controller, etc, but let me know what you think. If enough people are interested, I could invest time in it.&lt;/s&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://ideone.com/QsVAvw&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Controller in progress!&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Bots must inherit the &lt;code&gt;Player&lt;/code&gt; class, implementing the &lt;code&gt;choose_direction()&lt;/code&gt; function.&lt;/p&gt;&#xA;&lt;p&gt;I'm considering making it so that each snake must pick the next three moves at the same time. I'm not sure if this is necessary, but this would make it more like playing like a person, where you can't always react in time. This would keep the games from going super long if no snake would otherwise run into another one. It would also allow for shenanigans, like zipping in front of another snake to kill it.&lt;/p&gt;&#xA;&lt;p&gt;Another cool idea would be to have the bots make choices asynchronously as the game progresses, the same way human players do. If you don't choose a direction during a tick, you go straight. This way, you could also take extra time to calculate a move by choosing to return a move less often.&lt;/p&gt;&#xA;&lt;p&gt;&lt;s&gt;Suggestions for input format would be great. (2D matrix of integer types, multiple lists, etc)?&lt;/s&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;This is based directly off of a game I've played, which I think is called either &amp;quot;Worm ed 2&amp;quot; (as in Worm: edition 2) or &amp;quot;Wormed 2&amp;quot;. I was unable to find the game in a short search. The game is likely old, and I don't know where it could be found online if at all. If anyone knows of it, please comment!&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-04-26T15:20:02.500" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5389" PostTypeId="1" CreationDate="2015-06-06T00:07:54.217" Score="7" ViewCount="397" Body="&lt;p&gt;I have a preconception that golfing languages are not fast running. I have no idea if this is correct for some/all golfing languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The reason I wonder is that if they are slower than other languages, then setting a time limit for a specific problem size on a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question will mean golfing languages need to put more code into optimising for speed, and so only faster languages would be able to use a brute force approach.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this an interesting way of promoting competition between different languages with different strengths? Or is it better to keep challenges about one thing or the other (speed or length)?&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2015-06-06T07:12:37.370" Title="How fast are golfing languages?" Tags="|discussion|code-golf|asking-questions|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5390" PostTypeId="2" ParentId="2140" CreationDate="2015-06-06T01:36:10.783" Score="0" Body="&lt;h1&gt;Multiply with restricted operations: Best lower bound&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/37188/20260&quot;&gt;Multiply with restricted operations&lt;/a&gt; is a challenge to multiply two variables using as few as possible of four allowed operations: addition, reciprocal, negation, and variable assignment. The current best is &lt;a href=&quot;https://codegolf.stackexchange.com/a/41314/20260&quot;&gt;22 operations&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your goal is to prove a lower bound &lt;code&gt;L&lt;/code&gt;, a number for which you demonstrate that there are no solutions with fewer that &lt;code&gt;L&lt;/code&gt; operations. The highest &lt;code&gt;L&lt;/code&gt; wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must explain why your code demonstrates the lower bound, and I must be able verify your code by running it. There is a time limit of 30 minutes. The natural approach is to search the space of possible solutions, perhaps shrinking it via mathematical arguments, but any method is allowed. Purely mathematical proofs without code are also valid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code is limited to 30 minutes and 3GB of memory on my machine (Windows 7 with a Intel Core i5-460M processor). I may be satisfied with someone else running your code to confirm with a conservative adjustment for different machine speeds.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code needs to run on easily-available free software. Please include instructions on how to run your code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner will be the highest lower-bound proven by [date]. Tiebreak is fastest runtime on my computer. I will give a &lt;strong&gt;bounty of 500 rep&lt;/strong&gt; to the winner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your lower bound matches a solution, narrowing down the optimum to a single value, I will award you an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37188/multiply-with-restricted-operations&quot;&gt;additional bounty of 300 rep&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;For Sandbox:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I haven't done a fastest code before. Anything I'm missing? Any machine specs I should add?&lt;/li&gt;&#xA;&lt;li&gt;When to have deadline?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:21.033" LastActivityDate="2015-06-06T01:36:10.783" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5391" PostTypeId="2" ParentId="2140" CreationDate="2015-06-06T02:58:18.530" Score="0" Body="&lt;h1&gt;Date-A-List!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphs&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphs&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphs&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Introduction&lt;/h3&gt;&#xA;&lt;p&gt;The year is 20XX. Lists of integers are now members of society with a full set of rights. Like humans, lists like to have dates and get married. In this challenge, we'll produce a program &amp;quot;Date-A-List!&amp;quot; that will get as many lists as possible on happy and compatible dates. Lists tend to prefer using programs that use as little bytes as possible, so this program will be golfed.&lt;/p&gt;&#xA;&lt;p&gt;Lists are &lt;em&gt;compatible&lt;/em&gt; (that is, you can assign them to a date together) if they share 2 or more integers in the same order. For instance, the lists &lt;code&gt;(1 2 3)&lt;/code&gt; and &lt;code&gt;(2 3 5)&lt;/code&gt; would be compatible. The lists &lt;code&gt;(1 2 3)&lt;/code&gt; and &lt;code&gt;(3 2 5)&lt;/code&gt; would not be compatible because they do not share 2 or more integers that are in the same order.&lt;/p&gt;&#xA;&lt;p&gt;Lists are also always monogamous -- they will never go on a date with more than one list. For instance, consider the lists &lt;code&gt;(1 2 3)&lt;/code&gt;, &lt;code&gt;(2 3 5)&lt;/code&gt; and &lt;code&gt;(5 1 2)&lt;/code&gt; -- although the first list is compatible with both of the others, it may only date one of them.&lt;/p&gt;&#xA;&lt;h3&gt;Input Description&lt;/h3&gt;&#xA;&lt;p&gt;Input is a list of lists in brackets, space separated:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(1 2 3) (2 3 5) (5 1 2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;That input would indicate three lists to be assigned to dates: &lt;code&gt;[1, 2, 3]&lt;/code&gt;, &lt;code&gt;[2, 3, 5]&lt;/code&gt;, and &lt;code&gt;[5, 1, 2]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Output Description&lt;/h3&gt;&#xA;&lt;p&gt;If &lt;code&gt;n&lt;/code&gt; is the maximum number of dates possible, output &lt;code&gt;n&lt;/code&gt; lines, each line consisting of two space separated lists which are to be matched up. For instance, on the example input there are two possible outputs:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(1 2 3) (2 3 5)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(1 2 3) (5 1 2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;[TODO: More complex inputs and outputs]&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-06T02:58:18.530" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5392" PostTypeId="2" ParentId="5389" CreationDate="2015-06-06T07:12:37.370" Score="4" Body="&lt;p&gt;Pyth is essentially exactly as fast as Python for most purposes, because it compiles into Python. I'm not sure about the speeds of other golfing languages, but I doubt it's a large enough difference to be relevant to whether the code finishes under a time limit in most cases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it's important to distinguish between two cases: Do you want to favor traditional (non-golfing) languages, or fast programs?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want to favor fast programs, then a code challenge approach whose scoring system incorporates speed and length is best.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want to favor non-golfing languages, giving a bonus based on the &lt;a href=&quot;http://www.tiobe.com/index.php/content/paperinfo/tpci/index.html&quot; rel=&quot;nofollow&quot;&gt;TIOBE Index ranking&lt;/a&gt; might be a good solution. For instance, &quot;Subtract 1 byte for every position above 50th your language is in the rankings&quot; or something.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want to favor non-golfing languages, do so directly, not via a proxy like runtime.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2015-06-06T07:12:37.370" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5393" PostTypeId="2" ParentId="5347" CreationDate="2015-06-06T13:07:37.700" Score="1" Body="&lt;h1&gt;Adaptive Sampling&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Ideally an approach would be specified in the question that can be applied regardless of the number of answers or the strategies used. This would describe what will be done and how it will be determined whether a given sample size is sufficient. This should allow the sample size to be varied based on the results, rather than trying to infer an ideal size from the number and type of answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a perfect result cannot be obtained, this can be acknowledged by showing joint nth place rather than a potentially incorrect leaderboard order.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example approach (for all against all games)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For an all against all game, run N games and record the result. Run another N games and compare the result with the first. If they differ, run another 2N games and compare the result with the first 2N. Continue doubling until the results match.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using this approach to obtain a strictly ordered leaderboard (no joint n&lt;sup&gt;th&lt;/sup&gt; place) is likely to require a very large number of games, especially if there are a large number of players and where there are two or more similarly matched players. To keep the required number of games manageable, the strictness can be compromised in some way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If only the winner is important, then the process can simply be repeated until 1st place is consistent, and any differences below that can be converted into joint places. Alternatively the process can be continued until any joint places only include 2 players (so there are not 3 or more players joint nth place).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As the time required will increase as new answers come in, the question poster may choose a hybrid approach, where there is a maximum number of games. This way early leaderboards will be strictly ordered, and later leaderboards will have an upper limit on the time required, but may have joint places.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;A faster equivalent&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;With the approach described, doubling the number of games each time the first half doesn't match the second half, the worst case is that 2&lt;sup&gt;M&lt;/sup&gt;+1 games are required for an accurate ordering, in which case this approach will require 2&lt;sup&gt;M+1&lt;/sup&gt; games. If instead only 2 extra games are played each time, then the worst case will require 2&lt;sup&gt;M&lt;/sup&gt;+2 games (roughly half as many) and be equivalent in the best case.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So the approach is to play 2N games, and if the first N do not match the last N, play an additional 2 games. Now if the first N+1 do not match the last N+1, repeat as required. The process can be terminated early with joint places as before.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example approach (for pairwise games)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If players are paired up and compete against each other one on one, then N games can be run for each possible pairing, and then compared with another N games each. Only those that do not match need to be repeated, so that the majority of samples will be of closely matched pairs and further time need not be wasted on pairs where there is a clear winner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Again, after a time limit is reached joint places can be accepted (or joint places can be accepted below 1st place, with more time being allowed if 1st place is still ambiguous).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Start with a reasonably large N&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Note that starting with N (the initial number of games) too small will give a high probability of early termination with inaccurate results. For example, starting with N=1, there may be a significant probability of the 2 runs of 1 game having the same outcome, even if that outcome is not the same as the long term average. Starting with a larger N makes it much less likely that both runs will match &lt;em&gt;and&lt;/em&gt; be inaccurate.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2017-07-28T21:12:28.327" LastActivityDate="2017-07-28T21:12:28.327" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5394" PostTypeId="2" ParentId="2140" CreationDate="2015-06-06T15:41:03.033" Score="2" Body="&lt;h2&gt;Entropy Golf&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a scoring system without a challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My idea is to score entries based on the total Shannon entropy contained within them.  This provides an incentive to both use fewer unique characters and to have a shorter program overall.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a string of characters, the score is calculated as follows, where &lt;code&gt;C(x)&lt;/code&gt; is the number of occurrences of the given letter. To help provide a correction for multi-file programs or languages in which the program &lt;em&gt;length&lt;/em&gt; encodes information, the &lt;code&gt;EOF&lt;/code&gt; character at the end of every file is to be counted for the purposes of this scoring mechanism. Lowest score wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$\mathrm{score} = -\sum_x{C(x)\log_2\frac {C(x)}{\mathrm{Length}}}$$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/EyqsA.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/EyqsA.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anybody who knows better notation/MathJax is free to edit.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2016-03-27T15:20:28.860" LastActivityDate="2016-03-27T15:20:28.860" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="5397" PostTypeId="2" ParentId="2140" CreationDate="2015-06-07T20:49:16.563" Score="5" Body="&lt;h1&gt;Bitstring Family Trees&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This challenge is reproduced from memory and my own solution, from a challenge that was posted in the job-application section of &lt;a href=&quot;http://itasoftware.com&quot; rel=&quot;nofollow&quot;&gt;http://itasoftware.com&lt;/a&gt; before they were bought by Google. I reached out to ITA and Google a few years ago, after the acquisition, to ask to re-post this here (and on codegolf.com when it existed) and never heard back from them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A bitstring is a string of 1s and 0s. Bitstrings reproduce asexually through a mutation-prone process, producing a child that is a copy of its parent but with each bit flipped with 25% probability. Starting with a list containing one bitstring, we repeatedly select one bitstring from the list at random, produce its child, and add that child to the list. This produces a list of bitstrings, each of which (except the first) has somewhere earlier in the list a parent from which it was mutated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, the challenge. Your program will be presented with a list of bitstrings produced as described above, but the order of the list will be shuffled. You are to calculate the least improbable family tree for the given bitstrings. If there are two or more such trees, choose any of them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your input can be in any useful format, including as a list/array of lists/strings as a function parameter or in a variable, already existing on the stack for a stack based language, or from stdin with delimiters but not operators, so four four-bit strings might be &quot;1010\n1001\n1011\n0010&quot; or &quot;[1010,1001,1011,0010]&quot; or even &quot;4 1010100110110010&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your output can be in any unambiguous format. The canonical format is a list of integers, where the nth integer in the list is the index of the nth provided bitstring's parent in the original list, and a sentinel value for the root entry. Another acceptable form could be an actual tree data structure. Either of these might be returned from a function, printed to stdout, left in a variable, or left on the stack of a stack based language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The above two provisions should be interpreted with the context that this challenge is not about golfing the input and output code. It's about golfing the algorithmic logic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the example input above of 1010,1001,1011,0010 the most likely family tree is that the first entry is the root, the last two are children of the first, and the second is a child of the third, all three mutations involving a single bit flip out of four bits.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With the challenge I will provide a few data sets of different sizes (10 10-bit strings, 100 100-bit strings, maybe bigger) with their solutions.&lt;/p&gt;&#xA;" OwnerUserId="4787" LastEditorUserId="4787" LastEditDate="2015-06-08T02:54:49.157" LastActivityDate="2015-06-08T02:54:49.157" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5398" PostTypeId="2" ParentId="2140" CreationDate="2015-06-08T09:39:14.227" Score="2" Body="&lt;h1&gt;Chinese Checkers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'm considering writing a challenge that will have people write &lt;a href=&quot;http://en.wikipedia.org/wiki/Chinese_checkers&quot; rel=&quot;nofollow noreferrer&quot;&gt;Chinese Checkers&lt;/a&gt; players. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/ceANr.png&quot; alt=&quot;Image courtesy of Wikipedia&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Image courtesy of &lt;a href=&quot;http://en.wikipedia.org/wiki/Chinese_checkers#/media/File:Chinese_checkers_jump.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The game is quite simple: In clockwise turns, players try to move their 'pegs' across the board. They may only move one peg each turn. Valid moves are either moving to an adjacent empty space, or hopping over any number of pegs (friend or foe). These moves cannot be combined. The game is won when somebody has all their pegs in the triangle opposite of where they started.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I will write a controller, that will match up all players against each other in a sufficiently large number of matches. Each match, there will be points for the first, second and third place. Winner is the one with the most points.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Players must have a time limit on each move. This limit will be checked by the controller, and penalties will be applied accordingly. There will also be a limit on total number of moves, to prevent my poor laptop from calculating Chinese Checkers until the heat death of the universe because some idiot decided that random walks would be the way to go.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since I've never written a controller before, I'd first like to see whether you guys are interested at all in this challenge. Furthermore, which language is generally preferred for these kind of challenges: Java or C++?&lt;/p&gt;&#xA;" OwnerUserId="32352" LastActivityDate="2015-06-08T09:39:14.227" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="5399" PostTypeId="1" AcceptedAnswerId="5400" CreationDate="2015-06-08T16:36:35.173" Score="23" ViewCount="509" Body="&lt;p&gt;I golf in TI-BASIC (the language that TI-83 and 84 series graphing calculators use), which is an uncommon language, and small even in proportion to the frequency of its use is the number of people in this community who know the details of the language. Therefore, good answers often go unrecognized, and wrong answers are often mistaken for good ones. I feel the need to sort out answers by quality, and use more votes than I otherwise would.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Recently, I have been searching for other answers by language in TI-BASIC. There are several very poor answers by the same user, some of which don't work at all: for example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/25329/multidimensional-array/25456#25456&quot;&gt;this answer&lt;/a&gt;, which badly misunderstands the spec; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/20324/output-in-the-correct-order/20349#20349&quot;&gt;this answer&lt;/a&gt;, which doesn't come close to working; &lt;a href=&quot;https://codegolf.stackexchange.com/a/31482/39328&quot;&gt;this answer&lt;/a&gt;, which doesn't work and is partially plagiarized; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/31566/find-nearest-number-in-a-given-array/31571#31571&quot;&gt;this answer&lt;/a&gt;, which was at +5 despite not working.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have downvoted about twelve of these, and I honestly believe that they are all of poor quality. I left a comment on almost every one explaining the error in the code. I was flagged for serial downvoting for this behavior; however, I do not see the fault in my actions. I was not acting in revenge, I have never downvoted a TI-BASIC answer that works properly, and I would downvote an answer of similarly poor quality by any user.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/questions/130046/when-should-i-vote&quot;&gt;When should I vote?&lt;/a&gt; suggests downvoting answers that &quot;[make] no sense&quot; or &quot;[a]re wrong (in your opinion&quot;.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Is it correct practice to downvote these answers?&lt;/li&gt;&#xA;&lt;li&gt;If so, how should I proceed?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Edit: Geobits brought up downvoting sparingly every few days to circumvent the system; I was caught again with four downvotes and will try again with one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't think serial vote detection needs a complete overhaul, but as a community (since this problem seems to be specific to code golf)&lt;/p&gt;&#xA;&#xA;&lt;ol start=&quot;3&quot;&gt;&#xA;&lt;li&gt;&lt;p&gt;Should we waive serial downvote detection when both of the following are true?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The vote is on an answer.&lt;/li&gt;&#xA;&lt;li&gt;The voter either leaves a comment that has achieved +1, or upvotes a comment by another user who downvoted.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Or could we recommend flagging (for answers that have been pointed out as wrong and not corrected) or some other action instead?&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2017-03-29T23:25:04.140" Title="Downvoting wrong answers in a specific language" Tags="|discussion|voting|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5400" PostTypeId="2" ParentId="5399" CreationDate="2015-06-08T16:57:16.987" Score="12" Body="&lt;p&gt;All of the reasons you give for downvoting are acceptable and appropriate reasons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The fact that you're not paying attention to other languages, so you don't downvote other answers that fit those same reasons, makes you no different from anyone else on SE who only pays attention to certain types of questions and answers. If TI-BASIC was the only language you knew, then you'd feel OK doing what you're doing, right?&lt;/p&gt;&#xA;" OwnerUserId="4787" LastActivityDate="2015-06-08T16:57:16.987" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5401" PostTypeId="1" CreationDate="2015-06-08T17:43:02.187" Score="6" ViewCount="207" Body="&lt;p&gt;This question is meant to serve as a reference for setting up environments in which to test answers that require unusual hardware, processors, etc. Most answers will involve simulators and emulators.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All answers should be Community Wiki, and there should be one answer for each notably distinct combination of obscure factors.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Related questions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/202/where-to-find-an-online-testing-environment-for-specific-programming-languages/&quot;&gt;Where to find an online testing environment for specific programming languages?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1213/installation-and-testing-instructions-for-specific-programming-languages&quot;&gt;Installation and testing instructions for specific programming languages&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="4787" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2015-06-08T18:07:10.513" Title="How to test solutions in obscure hardware environments" Tags="|discussion|testing|" AnswerCount="1" CommentCount="1" ClosedDate="2015-06-14T21:51:22.657" ContentLicense="CC BY-SA 3.0" />
  <row Id="5402" PostTypeId="2" ParentId="5401" CreationDate="2015-06-08T17:47:11.963" Score="4" Body="&lt;h1&gt;TI-BASIC or TI-ASM&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Texas Instruments graphing calculators run a simple OS with a BASIC interpreter on top of a z80 or m68k CPU. Newer calculators, or older calculators running modified software, can also run user-provided binary/assembly code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An open source emulator for most TI calculators can be found here: &lt;a href=&quot;https://wabbit.codeplex.com/&quot; rel=&quot;nofollow&quot;&gt;https://wabbit.codeplex.com/&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For any given calculator, a ROM image will be needed. These can be found at &lt;a href=&quot;https://www.google.com/search?q=TI%20calculator%20ROM&quot; rel=&quot;nofollow&quot;&gt;various places on the web&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Launch the emulator, File &gt; Open to load the ROM file, then File &gt; Transfer Files to upload a copy of the BASIC or ASM program from your computer to the calculator.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[please add per-calculator instructions for running a BASIC or ASM program here]&lt;/p&gt;&#xA;" OwnerUserId="4787" LastActivityDate="2015-06-08T17:47:11.963" CommentCount="0" CommunityOwnedDate="2015-06-08T17:57:25.510" ContentLicense="CC BY-SA 3.0" />
  <row Id="5407" PostTypeId="2" ParentId="2140" CreationDate="2015-06-09T18:13:34.097" Score="2" Body="&lt;h2&gt;Captcha cops-and-robbers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Cops develop a captcha algorithm in minimum bytes. Robbers tries to implement a recognizer that recognizes 90 of 100 generated captchas.&lt;/p&gt;&#xA;" OwnerUserId="7773" LastActivityDate="2015-06-09T18:13:34.097" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5410" PostTypeId="2" ParentId="286" CreationDate="2015-06-09T21:41:00.003" Score="15" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;The golfing languages always win. I am not having fun.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Four years later, people are &lt;em&gt;still&lt;/em&gt; complaining about this. Whether or not this complaint has any merit, if people say they aren't having fun, then they aren't having fun. I think I have a solution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We can start commenting on code golf challenges with this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Some users find it fun to only compete against languages that are in the same league. If you want to encourage this, consider adding &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5139/leaderboard-snippet&quot;&gt;this stack snippet&lt;/a&gt; (and the explanation that goes with it) to your post to generate an automatic per-language leaderboard.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If we do this and more people have fun, then mission accomplished.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we don't do this, then that means the people who are complaining don't care enough to take action (or they haven't read this post yet).&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2015-06-09T21:41:00.003" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5412" PostTypeId="2" ParentId="5379" CreationDate="2015-06-10T08:47:11.983" Score="3" Body="&lt;p&gt;You're asking for the steps, not the actual implementation.  Here's a few things that need to be resolved for distributed KoTHs to be implemented.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The method of obtaining usage rights to the machines.  If I write a KoTH that could use it, and then post it (lets assume it doesn't get closed), do I automatically get usage of the machines?  If not, what are the steps for obtaining the machines?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is giving a machine an all-or-nothing deal?  If two distributed KoTHs are running, do I have the choice to run one, but not the other?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Do we set the method of communication across the board (with the rare exception)?  What should that method be (HTTP, STDIO, implementing a function)?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Do we care about security of the machines running the tasks?  I don't think it's going to be possible to hide the connection details, which makes me think we are opening up our machines to attacks.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What kind of KoTHs do we support?  Do we only support turn-based KoTHs, or are we open to fastest-code or real-time KoTHs?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;We are going to need a &lt;em&gt;flexible&lt;/em&gt; controller.  This controller will be used as the base for all distributed KoTH challenges.  Depending on how we answer to #2-5, it will make the controller easier or harder to program.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastActivityDate="2015-06-10T08:47:11.983" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5415" PostTypeId="2" ParentId="2447" CreationDate="2015-06-10T21:12:11.753" Score="53" Body="&lt;h1&gt;Programs may combine two or more input methods&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For example, if the inputs are a string and an int, a function that takes a string as an argument and an int from STDIN would be valid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input format must still be consistent for a given program.&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="39328" LastEditDate="2015-06-11T01:01:53.690" LastActivityDate="2015-06-11T01:01:53.690" CommentCount="0" CommunityOwnedDate="2015-06-10T21:12:11.753" ContentLicense="CC BY-SA 3.0" />
  <row Id="5417" PostTypeId="2" ParentId="2140" CreationDate="2015-06-11T00:38:53.310" Score="1" Body="&lt;p&gt;A &lt;a href=&quot;http://math.nist.gov/coveringarrays/coveringarray.html&quot; rel=&quot;nofollow&quot;&gt;covering array&lt;/a&gt; is an &lt;code&gt;N&lt;/code&gt; by &lt;code&gt;k&lt;/code&gt; array in which each element is one of {0, 1, ..., v-1} (so &lt;code&gt;v&lt;/code&gt; symbols in total), and for any &lt;code&gt;t&lt;/code&gt; columns chosen (so an &lt;code&gt;N&lt;/code&gt; x &lt;code&gt;t&lt;/code&gt; array) contains all possible &lt;code&gt;v^t&lt;/code&gt; tuples. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; &lt;code&gt;N&lt;/code&gt;, &lt;code&gt;k&lt;/code&gt;, &lt;code&gt;t&lt;/code&gt;, &lt;code&gt;v&lt;/code&gt; (all 4 are positive integers), and then &lt;code&gt;N&lt;/code&gt; x &lt;code&gt;k&lt;/code&gt; integers, each of which comes from {0, ..., v-1}. Each of the integers are separated by spaces.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt; &lt;code&gt;Yes&lt;/code&gt; if the input is a valid covering array, and &lt;code&gt;No&lt;/code&gt; if it is not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Goal:&lt;/strong&gt; in any language you want, write a program that validates if the input is a covering array in the &lt;em&gt;fastest&lt;/em&gt; time. I will run programs on my machine, which is a Macbook Pro 2.2 Ghz Intel i7 with 16 GB RAM.&lt;/p&gt;&#xA;" OwnerUserId="19493" LastActivityDate="2015-06-11T00:38:53.310" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5419" PostTypeId="1" AcceptedAnswerId="5420" CreationDate="2015-06-11T20:44:21.483" Score="3" ViewCount="58" Body="&lt;p&gt;I'm designing a question which needs some special Markdown commands, i.e. smaller images that link to larger images.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although I prepare the question locally on my PC, it may take some time to finally get it correct, so I'm thinking of creating the question and immediately deleting it. I'd then fix the Markup and undelete when it is perfect. Depending on interruptions, this may take some days.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I am a bit uncertain, because:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I know moderators having scripts that would flag deleted questions (as described on &lt;a href=&quot;https://softwarerecs.stackexchange.com/questions/14244/userscript-to-add-a-flag-button-to-deleted-stack-exchange-posts#comment24014_14244&quot;&gt;SoftwareRecs&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;I don't know whether deleted questions will &lt;em&gt;really&lt;/em&gt; be deleted after some time.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;How do you create stunning questions such as the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/50299/draw-an-image-as-a-voronoi-map&quot;&gt;Voronoi&lt;/a&gt; puzzle? How do you make sure the Markdown is right? Is my approach ok and deleting the question safe?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Assume I'd not like to use the Sandbox to have fair starting conditions for everyone.&lt;/p&gt;&#xA;" OwnerUserId="16901" LastEditorUserId="-1" LastEditDate="2017-04-13T12:50:01.760" LastActivityDate="2015-06-11T21:09:12.030" Title="How long can I access my deleted question?" Tags="|support|voting|deleted-questions|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5420" PostTypeId="2" ParentId="5419" CreationDate="2015-06-11T21:06:15.983" Score="7" Body="&lt;p&gt;As far as I know, questions are never truly deleted unless they contain extreme vulgarity or spam. And I believe only SE employees can do these hard deletions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can &lt;a href=&quot;https://meta.stackexchange.com/questions/185491/what-is-the-deleted-recent-questions-page-in-the-user-profile&quot;&gt;view your deleted question for up to 60 days&lt;/a&gt;, but beyond that you may have to save a link. (&lt;a href=&quot;https://meta.stackexchange.com/questions/5221/how-does-deleting-work-what-can-cause-a-post-to-be-deleted-and-what-does-that&quot;&gt;More about deletions.&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, for your problem, the better solution is to post your question markdown as an answer in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;the Sandbox&lt;/a&gt;, where you can edit it as much as you want and post it when ready. Your problem is exactly what the Sandbox is for, and they &lt;em&gt;are&lt;/em&gt; &quot;fair&quot; starting conditions because everyone could have seen it in the Sandbox if they wanted to.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that instantly deleting a question and un-deleting it later will make it lower down on the new-questions list, which means it will probably get less traffic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, did you know that a preview of the rendered markdown is shown just below the textarea when you're writing a post?&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2015-06-11T21:09:12.030" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="5422" PostTypeId="2" ParentId="2140" CreationDate="2015-06-12T03:23:54.887" Score="1" Body="&lt;h1&gt;KOTH Simpleton's Chess&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Disclaimer: The word &quot;simpleton&quot; is not meant to offend anyone who is simple or anything else. Don't take it personally, please.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;It is a lovely afternoon at the Completely Average Chess Club, and like most afternoons, the chess players, who are also part-time code golfers, are golfing programs to play chess. They use incredibly complicated move-finding algorithms and are golfing them down into 4 byte programs. However, on this particular afternoon, some aliens, who are looking to use human intelligence to play alien chess, steal the chess players' intelligence, turning them into simpletons! Now they can't even remember all the pieces, let alone perform an alpha-beta tree-search.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Today, we won't be focusing on restoring the chess players' minds back. Instead, we'll be playing a modified chess game with simpler rules!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;The pieces&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Like regular chess, Simpleton Chess has two teams: white and black. Unlike regular chess, however, Simpleton Chess only has one piece that can attack north, north west and north east and can move two squares at a time. If you are familiar with regular chess, this is much like the pawn except for the fact you can attack forward (or north) and can move two squares at a time. Like regular chess, to take a piece you must move in the place of the piece that you wish to take. If there is a piece in of you, and you move 1 square in front, then you will take that piece.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Castling and en passant are ignored.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Winning the game&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;To win the game, you must take all the pieces of the opposing team.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Time limit&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each entry has an allowed time is 3 minutes (180000ms). &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The board&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Any piece that moves outside the board will disqualify you. The board is a 2D int array that you can access by assigning a variable to &lt;code&gt;SimpletonUtils.read&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Entries&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your entry is expected to have two methods: &lt;code&gt;getName()&lt;/code&gt; and &lt;code&gt;move()&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;getName()&lt;/code&gt; method will return a &lt;code&gt;String&lt;/code&gt; of the name of your entry. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The move method is a &lt;code&gt;void&lt;/code&gt; and is called every time you need to move.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To submit the board you use &lt;code&gt;SimpletonUtils.submitBoard&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Entries are suggested (and very, very much encouraged) to verify the board using &lt;code&gt;SimpletonUtils.verifyBoard&lt;/code&gt; (you have 3 minutes, no need to worry about speed). You will be disqualified if you submit an invalid board, however, you will not be disqualified for sending an invalid board to &lt;code&gt;SimpletonUtils.verifyBoard&lt;/code&gt;. If you don't verify the board, a warning will be sent to console output if debug is on (edit SimpletonConfig.java).&lt;/p&gt;&#xA;&#xA;Entry template&#xA;&#xA;&lt;p&gt;Here is an example entry to follow:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;package SimpletonChess;&#xA;import SimpletonChess.SimpletonPlayer;&#xA;import SimpletonChess.SimpletonUtils;&#xA;&#xA;public class MyEntry extends SimpletonPlayer {&#xA;&#xA;    /**&#xA;     * Return the name of our bot to the controller&#xA;     */&#xA;    public String getName(){&#xA;        return &quot;MyEntry&quot;;&#xA;    }&#xA;&#xA;    /**&#xA;     * Method to carry out the logic for our entry&#xA;     */&#xA;    public void move(){&#xA;        SimpletonUtils utils = new SimpletonUtils();&#xA;        int[][] board = utils.read(); // Your own local copy of the board&#xA;&#xA;        /*&#xA;        * TODO: Template. Add logic here&#xA;        */&#xA;&#xA;       utils.submitBoard(board); // Note that you will be disqualified if your board is invalid! Check it with utils.verifyBoard(board), just use an if statement.&#xA;    }&#xA;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;** Remember to add your entry to the controller's main class, SimpletonTournament.java, when you're finished! **&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Controller&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The controller is on GitHub. (Link will be added when the controller is ready)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your entries are expected to be written in Java &lt;em&gt;(unless I find the time to write a console parser)&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Final words&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Good luck simpletons! I would very much like to see an entry using the &lt;em&gt;monte carlo method&lt;/em&gt;, that would be splendid!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, a fantastic link for all things chess programming related: &lt;a href=&quot;http://chessprogramming.wikispaces.com/&quot; rel=&quot;nofollow&quot;&gt;http://chessprogramming.wikispaces.com/&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That's it from me, send your entries over today!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Notes&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I know there is another KOTH chess tournament. I don't think this is a duplicate since it has simpler rules and different pieces&lt;/li&gt;&#xA;&lt;li&gt;Is this too similar to checkers?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;hr&gt;&#xA;&lt;strong&gt;TODOs&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;s&gt;Fix overbolding&lt;/s&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;s&gt;Fix possibility to mess up the board with illegal moves&lt;/s&gt; (feedback needed)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;s&gt;Themed intro, since a lot of other people are doing it&lt;/s&gt; (feedback needed!)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Finish controller&lt;/strong&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Add some diagrams&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Fix numerous typos and formatting errors&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41157" LastEditorUserId="41157" LastEditDate="2015-06-13T22:38:06.543" LastActivityDate="2015-06-13T22:38:06.543" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="5423" PostTypeId="1" CreationDate="2015-06-12T12:40:00.753" Score="1" ViewCount="267" Body="&lt;p&gt;Sometime ago i wanted to make a KOTH challenge, but i wanted it to be more interactive and easier to test, i didnt really come up with anything good. But then i saw this awesome thing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/48353/red-vs-blue-pixel-team-battlebots&quot;&gt;Red vs. Blue - Pixel Team Battlebots&lt;/a&gt; from &lt;a href=&quot;https://codegolf.stackexchange.com/users/26997/calvins-hobbies&quot;&gt;calvins-hobbies&lt;/a&gt;. Essentialy it pulled the code directly from the answers and the users just had to paste their stuff into their submissions. After i got his permission to use that part of his code i made my own challenge and now i just need to put it up for a test to see what i missed and if the instruction are clear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Everything after this line is going to be posted in the real post!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a king of the hill challenge everybody vs everybody. Its a battle the find the best gunman of the west!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You be able to compete in this contest you need to make two functions, the first one determines the stats of your gunman and the second is the main logic function.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Stat function&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function () {&#xA;&#xA;    var bot = {&#xA;        name: &quot;testBot&quot;,&#xA;        numbOfBullets: 7,&#xA;        reloadSpeed: 1, &#xA;        shotsPerTurn: 1,&#xA;        moveSpeed: 2 &#xA;    }&#xA;    return bot&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The stat function includes 5 variables that you will need to set according to some rules (except the name which can be anything). You can spend a total of 15 points on your gunman, the points are spend differently on every stat and you need to spend all 15 for your gunman to be eligible. Here is how the stats work:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;numbOfBullets&lt;/strong&gt;, defines how many bullets your gun holds&#xA;the base and minimum value is 1, each addititional bullet costs &lt;strong&gt;1 point&lt;/strong&gt; with the maximum being 16 bullets with 15 points spend.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;reloadSpeed&lt;/strong&gt;, defines how many turns your gunman needs to reload his gun after he ran out of bullets. The base and maximum value is 4 with the minimum being 1, each decrease of this stat costs &lt;strong&gt;2 points&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;shotsPerTurn&lt;/strong&gt;, defines how many times your gunman can shoot in one turn&#xA;the base and minimum value is 1, each increases costs &lt;strong&gt;3 points&lt;/strong&gt; so you can have a maximum of 6 shots per round with 15 points spend. Raising this stat above the number of bullets your gun can hold is counter productive since you cant shot more bullets then your gun can hold.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;moveSpeed&lt;/strong&gt;, defines how many spaces your gunman can run in one turn&#xA;the base and minimum value is 1, each increase costs &lt;strong&gt;3 points&lt;/strong&gt; with a maximum of 6 speed with 15 points spend. The gunman can run either left or right every turn up to a maximum of his move speed, he can also stand still which gives him a bonus, more on this later.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So the example above has 6 points spend on bullets, 6 points spend on reload speed and 3 points spend on movement.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Main function&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function main(bulletsLeft, yourShots, enemyShots, yourMovement, enemyMovement) {&#xA;&#xA;    var shots = [];&#xA;    shots.push(Math.floor((Math.random() * 24) + 1));&#xA;    var move = yourMovement[yourMovement.length - 1] + 2&#xA;    var play = [];&#xA;    play.shots = shots;&#xA;    play.move = move;&#xA;    play.reload = false;&#xA;    return play;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Paremeters:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;bulletsLeft, number of bullets left in your gun&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;yourShots, this is a array of arrays of all past position your gunman has fired at.  &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Example for a gunman who can shoot 1 bullet per round:&#xA;[[12],[4],[22],...]  &#xA;Example for a gunman who can shoot 3 bullets per round:&#xA;[[12,13,14],[11,15,16],[9,14],...]&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;enemyShots, same as above but for your enemy&lt;/li&gt;&#xA;&lt;li&gt;yourMovement, is a array of all your past positions&lt;/li&gt;&#xA;&lt;li&gt;enemyMovement, same as above but for your enemy&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;What you need to return:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are required to return a variable which has 3 attributes&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;shots, is array of numbers which determine at what space your gunman will shoot&lt;/li&gt;&#xA;&lt;li&gt;move, is a single number that determines to what space your gunman will try to move&lt;/li&gt;&#xA;&lt;li&gt;reload, a true/false value with which you can make your gunman reload&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;The duel&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The contest follows a round robin 1vs1 system. Each gunman has 50 rounds against every other gunman a round lasts until someone is hit by a bullet or a maximum of 66 turns with one turn being one shot of each player. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The gunman can earn either 2 points by killing their opponent, 1 point if they both die in the same turn or 0 points if they reach the 66 turns limit.&#xA;The shooting field is 25 spaces width (1-24 inclusive). Here is a step by step guide on how a duel works, this also covers all invalid comands and special rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;At the start of each duel both players are put on space 12 and their revolvers are fully loaded&lt;/li&gt;&#xA;&lt;li&gt;The main function is called and the gunman make their first move command and choose where they want to shoot&lt;/li&gt;&#xA;&lt;li&gt;First the gunman move to the new location, if any invalid input is made at the move command (positions lower then 1 or higher then 24 or they moved more spaces then they are allowed too) they stay at the same position&lt;/li&gt;&#xA;&lt;li&gt;Next reloading is checked, if you ran out of bullets the previous turn or you called reloading yourself your gunman goes into the reload cycle. He is reloading for as many turns as you set your reloadSpeed value. If you decided to stand still(staying on the same field or just inputing a invalid value) you reload counter goes down for 2 turns instead of one&lt;/li&gt;&#xA;&lt;li&gt;Now comes checking your shooting values, every turn you can enter as many shooting location as you like they will always be cut off to the actual valid amount which is determined by: The number of shots per turn and the number of bullets in your revolver whichever is lower. Your shotsPerTurn value is increased by 1 if you decide to stand still this turn, so you can make a extra shot if you decide to stand still. If you are in the reload cycle you have 0 shots.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Now comes the actual shooting, there are 2 ways this can go down. If both bots have the same movespeed stat then they both shoot at the same time and can both kill eachother at the same time. In the case that they have different movespeed stats the bot with the higher movespeed stat starts shooting first and if he kills his opponent he wins this round. If the bots have more then one bullet to shoot in one round then it follows the same rules as above except in more cycles as a example: Lets say that bot1 has 3 bullets and is faster and bot 2 has 2 bullets it would go like this: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Bot1 shoots, Bot2 shoots cycle 1&#xA;Bot1 shoots, Bot2 shoots cycle 2&#xA;Bot1 shoots              cycle 3&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This would look the same if they had the same movespeed only that if now Bot1 hit Bot2 in the same cycle Bot2 could also hit Bot1 and it would be a tie.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;RULES&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;First i am copying some rules from calvins-hobbies entry that also applys here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;When declaring a new JavaScript variable, you must use the var keyword.&lt;/strong&gt;&#xA;This is because a variable declared without var becomes global rather than local, so it would be easy to accidentally (or intentionally) mess with the controller or communicate freely with other players. It has to be clear that you aren't trying to cheat.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When declaring functions it is best to use the var keyword as well. i.e. use var f = function(...) {...} instead of function f(...) {...}. I'm not entirely sure why, but sometimes it appears to make a difference.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In your code you may not...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;attempt to access or modify the controller or other player's code.&lt;/li&gt;&#xA;&lt;li&gt;attempt to modify anything built into JavaScript.&lt;/li&gt;&#xA;&lt;li&gt;attempt to communicate with other players except by using getMsg and setMsg.&lt;/li&gt;&#xA;&lt;li&gt;make web queries.&lt;/li&gt;&#xA;&lt;li&gt;do otherwise malicious things.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;My additional rules: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The users can create as many gunman as they want and change their functions for any period of time&lt;/li&gt;&#xA;&lt;li&gt;I will remove any entry from the game that either takes a excessive amount of time or trys to cheat in anyways that i see fit&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your answer should be in this format, the first function being the stats and the second being the actual logic, notice that i used a exclamation mark because if you just make new lines between code blocks the parser wont see two different code blocks so you have to use any symbol(just use a exclamation mark) to seperate them:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;var bot = {&#xA;    name: &quot;testBot&quot;,&#xA;    numbOfBullets: 7,&#xA;    reloadSpeed: 1,&#xA;    shotsPerTurn: 1,&#xA;    moveSpeed: 2&#xA;}&#xA;return bot&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;!&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;var shots = []&#xA;var testBot_moveUp = true&#xA;if(Math.random() * 2 &amp;gt; 1)&#xA;    testBot_moveUp = false&#xA;shots.push(Math.floor((Math.random() * 24) + 1))&#xA;var move = 0&#xA;if (testBot_moveUp)&#xA;    move = yourMovement[yourMovement.length - 1] + 2&#xA;else&#xA;    move = yourMovement[yourMovement.length - 1] - 2&#xA;move = 12&#xA;var play = []&#xA;play.shots = shots&#xA;play.move = move&#xA;play.reload = false&#xA;return play&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And here is the controller: &lt;a href=&quot;http://jsfiddle.net/vajura/sh4wr82r/23/&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://jsfiddle.net/vajura/sh4wr82r/23/&lt;/a&gt; .Just open the link and wait for the bots to load, then select which one you want in the fight(probably all) and press the start button.&lt;/p&gt;&#xA;" OwnerUserId="32107" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-09-10T14:14:24.063" Title="A new javascript KOTH challenge, Fastest gun of the west!" Tags="|discussion|sandbox|" AnswerCount="1" CommentCount="3" ClosedDate="2022-02-25T22:32:53.377" ContentLicense="CC BY-SA 3.0" />
  <row Id="5424" PostTypeId="2" ParentId="5423" CreationDate="2015-06-12T12:41:52.530" Score="2" Body="&lt;pre&gt;&lt;code&gt;var bot = {&#xA;    name: &quot;testBot&quot;,&#xA;    numbOfBullets: 7,&#xA;    reloadSpeed: 1,&#xA;    shotsPerTurn: 1,&#xA;    moveSpeed: 2&#xA;}&#xA;return bot&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;!&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;var shots = []&#xA;var testBot_moveUp = true&#xA;if(Math.random() * 2 &amp;gt; 1)&#xA;    testBot_moveUp = false&#xA;shots.push(Math.floor((Math.random() * 24) + 1))&#xA;var move = 0&#xA;if (testBot_moveUp)&#xA;    move = yourMovement[yourMovement.length - 1] + 2&#xA;else&#xA;    move = yourMovement[yourMovement.length - 1] - 2&#xA;move = 12&#xA;var play = []&#xA;play.shots = shots&#xA;play.move = move&#xA;play.reload = false&#xA;return play&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Test bot&lt;/p&gt;&#xA;" OwnerUserId="32107" LastActivityDate="2015-06-12T12:41:52.530" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5426" PostTypeId="2" ParentId="188" CreationDate="2015-06-12T16:44:42.343" Score="3" Body="&lt;p&gt;My opinion is that, unless the question says otherwise, any freely available library existing before the question was asked should be permissible. However,  the requisite import statements should be counted towards the byte count. Additionally, a link to the library should be included in the description/explanation part of the answer.&lt;/p&gt;&#xA;" OwnerUserId="39022" LastEditorUserId="39022" LastEditDate="2015-10-09T17:39:46.997" LastActivityDate="2015-10-09T17:39:46.997" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5427" PostTypeId="2" ParentId="435" CreationDate="2015-06-13T19:13:34.260" Score="8" Body="&lt;p&gt;I believe that it shouldn't be a problem, as long as:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;using the library does not violate the rules of the question&lt;/li&gt;&#xA;&lt;li&gt;&lt;s&gt;you are using a version that was released before the question was posted&lt;/s&gt; no longer relevant due to changes in site rules&lt;/li&gt;&#xA;&lt;li&gt;that version of the library is freely available as of when you are posting your answer (please provide a link in your answer as well)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="39022" LastEditorUserId="39022" LastEditDate="2022-04-08T14:16:54.757" LastActivityDate="2022-04-08T14:16:54.757" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="5428" PostTypeId="2" ParentId="2140" CreationDate="2015-06-14T10:18:33.220" Score="1" Body="&lt;h1&gt;How Many Isomers of Nonane / Undecane Are There?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Background&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Hydrogen and carbon form various series of compounds called hydrocarbons. Carbon forms four bonds and hydrogen forms 1 bond. The alkanes are the series of hydrocarbons without any double bonds between carbon atoms.  The first four alkanes are shown below. Hydrogen atoms are omitted for simplicity. We know each carbon forms four bonds, so the unused bonds must have hydrogen atoms on them.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Methane     Ethane    Propane    n-Butane    Isobutane&#xA;C           C-C       C-C-C          C-C     C-C-C&#xA;                                       |       |&#xA;                                     C-C       C&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that Methane, Ethane and Propane have only one isomer, whereas Butane comes in two isomeric forms. Both have four carbon atoms but in n-Butane they are arranged in a continuous chain, whereas in Isobutane (also known as 2-Methyl Propane) they are arranged as a continuous chain of 3 atoms plus a side branch of one carbon atom.&lt;/p&gt;&#xA;&lt;p&gt;In both cases, the ten loose bonds on the carbon atoms are occupied by hydrogen atoms. In general, for hydrocarbons with no rings or multiple bonds, the formula is &lt;code&gt;Cn H(2+2n)&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Task&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Your task is to create a program or function that accepts a single integer &lt;code&gt;0 &amp;lt; n &amp;lt; 10&lt;/code&gt; and outputs to STDOUT or a file all the possible structural isomers of the hydrocarbon of formula &lt;code&gt;Cn H(2+2n)&lt;/code&gt;. That is to say, all the different ways in which n carbon atoms can be connected together, assuming freedom to twist about all bonds.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The carbon atoms shall be represented by the symbol &lt;code&gt;C&lt;/code&gt;. In the interest of simplicity, hydrogen atoms shall be omitted.&#xA;The bonds shall be represented by the symbols &lt;code&gt;-&lt;/code&gt; and &lt;code&gt;|&lt;/code&gt;. Only horizontal and vertical bonds are allowed.&#xA;Each isomer shall be represented by a network of carbon atoms separated by bonds. As such the character &lt;code&gt;C&lt;/code&gt; will appear on a grid of pitch 2x2.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program / function shall draw each possible isomer once and only once. The type of isomerism to be considered is structural isomerism. That is to say, compounds with different branching patterns shall be considered different. Different stereoisomers and different conformations shall be considered equivalent. Any conformation that complies with Rule 2 is valid.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The different isomers shall be displayed one below the other, in any order. To assist in checking, each isomer shall be preceded by a sequential number (starting at 1) on its own line. There shall be no more than 5 blank lines between any isomer and the preceding / following numbers. Unnecesary whitespace to the left and right of each isomer shall not exceed 10 characters in either direction.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;To avoid extreme brute force solutions, execution time shall not exceed 1 minute on my machine for any input case.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Scoring: This code golf. Shortest code wins. If your program can handle up to &lt;code&gt;n=11&lt;/code&gt; instead of &lt;code&gt;n=9&lt;/code&gt; there is a -50% bonus.&lt;/strong&gt; Above &lt;code&gt;n=9&lt;/code&gt; is significantly harder, because the sidechains can themselves have sidechains.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Above n=11 there exist some isomers that cannot be represented according to the rules of this question as some atoms would overlap.&lt;/p&gt;&#xA;&lt;p&gt;The number of isomers for each value of n is given in &lt;a href=&quot;https://oeis.org/A000602&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://oeis.org/A000602&lt;/a&gt;. Note that behaviour for n=0 can be undefined. The names of the isomers are here: &lt;a href=&quot;http://www.kentchemistry.com/links/organic/isomersofalkanes.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.kentchemistry.com/links/organic/isomersofalkanes.htm&lt;/a&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;n       0  1  2  3  4  5  6  7   8   9  10   11   &#xA;isomers 1, 1, 1, 1, 2, 3, 5, 9, 18, 35, 75, 159&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;EXAMPLE OUTPUT n=6 (all 5 possible isomers)&lt;/strong&gt;&#xA;Note: you must display the isomers one below the other. They are displayed side by side here to save space. For further explanation, a video explaining structural isomerism with this example is here: &lt;a href=&quot;https://www.youtube.com/watch?v=qOhEJK4Umds&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.youtube.com/watch?v=qOhEJK4Umds&lt;/a&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1            2          3           4         5&#xA;                                                C&#xA;                                                |&#xA;C-C-C-C-C-C  C-C-C-C-C  C-C-C-C-C   C-C-C-C   C-C-C-C&#xA;               |            |         | |       |&#xA;               C            C         C C       C&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;EXAMPLE OUTPUT n=8 (only some of the possible isomers, you must display them all.)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;n-Octane&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;C-C-C-C-C-C-C-C&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;3,4dimethyloctane.&lt;/strong&gt; Those who know about stereoisomerism will know that in 3 dimensions the bonds are arranged in a tetrahedron around the carbon atom. This means that this compound can exist in 3 distinct forms: a lefthand form, a righthand form and a mirror symmetric form. For the purpose of this question these are equivalent and any &lt;strong&gt;one&lt;/strong&gt; of the following is acceptable (and there are many other acceptable ways of drawing this isomer.)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    C-C-C-C          C          C-C-C-C             C          C-C-C-C       C-C-C-C-C-C  &#xA;      |              |              |               |            |               | |&#xA;  C-C-C-C      C-C-C-C-C-C        C-C-C-C       C-C-C-C-C-C    C-C-C-C           C C&#xA;                   |                                  |    &#xA;                   C                                  C&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;EXAMPLE OUTPUT n=10 (only some of the possible isomers, you must display them all.)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;triisopropylmethane, or 2(methylethyl)1,3dimethylpentane&lt;/strong&gt; (n=10 is the smallest n where there can be a sidechain of three C atoms, and therefore also the smallest n where a sidechain itself can be branched.)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    C   C&#xA;    |   |&#xA;  C-C-C-C-C&#xA;      |&#xA;    C-C-C&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;2,2,3,4,4pentamethylpentane&lt;/strong&gt; (it can be shown that for n=10 a maximum of 2 carbon atoms can be completely surrounded by four other carbon atoms each.)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  C   C&#xA;  |   |&#xA;C-C-C-C-C&#xA;  | | |&#xA;  C C C&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-15T21:10:15.250" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5430" PostTypeId="2" ParentId="2140" CreationDate="2015-06-15T23:19:11.950" Score="0" Body="&lt;h1&gt;5-a-side Toroidal Bot Soccer&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Randomised teams&lt;/h2&gt;&#xA;&lt;p&gt;This is a team game. Rather than being assigned permanently to one team or the other, each bot will play in a number of games, each for a different randomly composed team of 5 players (&amp;quot;5-a-side&amp;quot;), and score a point for each game in which its team wins. This means every game requires team work, but there is still a single overall winner after all games are played.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;There are no rules for the players (no referee, no penalties, no off-side rule). The movement of the ball defines the score and the players can do as they see fit.&lt;/p&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;p&gt;There are no goal posts. If the ball moves off the right hand edge of the field, it reappears at the left hand edge of the field and team 1 scores a goal. Similarly team 2 score if it moves off the left hand edge and reappears at the right. The score will be represented by a single integer, that is increased by one when team 1 scores, and decreased by one when team 2 scores. At the end of a game, team 1 wins if the score is positive, team 2 wins if the score is negative, and a zero score is a draw/tie.&lt;/p&gt;&#xA;&lt;p&gt;Movement over the top and bottom edges has no effect on the score.&lt;/p&gt;&#xA;&lt;p&gt;The game lasts for 2000 time steps (each bot provides 2000 moves). If there is no winner by the end of the game it is extended by up to a further 1000 moves, with the game ending if either team scores.&lt;/p&gt;&#xA;&lt;h2&gt;Physics&lt;/h2&gt;&#xA;&lt;p&gt;Physics is the main obstacle to real world toroidal soccer, and will not be respected in this game. The physics have been simplified as much as possible to hopefully allow games to be viewed live.&lt;/p&gt;&#xA;&lt;p&gt;This is a non-contact sport. Bots pass straight through other bots (of either team) with no interaction. Each bot can only interact with the ball.&lt;/p&gt;&#xA;&lt;p&gt;The playing field is a continuous rectangle of width 100 and height 50. The bots and the ball have radius 1. Bots and ball can move freely in any direction without meeting a boundary - the edges of the field wrap. The ball will rebound from any bot if their circumferences overlap.&lt;/p&gt;&#xA;&lt;h3&gt;Turning and acceleration&lt;/h3&gt;&#xA;&lt;p&gt;Due to the use of simplified physics this is quick to explain:&lt;/p&gt;&#xA;&lt;p&gt;A bot has a facing angle and a velocity. A constant acceleration applies in the direction specified by the facing angle. Drag is a deceleration proportional to the velocity (an acceleration in the opposite direction to the velocity, proportional to the size of the velocity). This means a bot that does not turn will accelerate to a maximum velocity where the drag matches the acceleration.&lt;/p&gt;&#xA;&lt;p&gt;A bot can turn any angle instantaneously, but the velocity (and hence direction) will only change gradually. For example, a bot changing direction by 180 degrees will continue travelling backwards while it slows down to zero velocity, and then accelerate in its new direction.&lt;/p&gt;&#xA;&lt;p&gt;The ball has no acceleration of its own, so other than collisions, its only change in velocity is due to drag. There is no spin.&lt;/p&gt;&#xA;&lt;h3&gt;Collisions&lt;/h3&gt;&#xA;&lt;p&gt;Only the ball can be involved in a collision with a bot - bots pass straight through each other.&lt;/p&gt;&#xA;&lt;p&gt;Although the radius of both bots and ball will be displayed visually as 1, I believe the results are the same if collision calculations are based on the bots having radius 2 and the ball being a point.&lt;/p&gt;&#xA;&lt;p&gt;To keep calculation simple, the ball will be tested for collision with each bot by considering the bot to be a circle moving with constant velocity and the ball to be a point moving with constant velocity (that is, the acceleration will occur at instants, rather than continuously over time). Since this is also how the motion will be modelled generally, the collisions should be consistent with the motion of objects in the game.&lt;/p&gt;&#xA;&lt;p&gt;This allows the exact point of collision to be calculated so the rebound can occur with no overlap.&lt;/p&gt;&#xA;&lt;h2&gt;Communication&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;There is no communication between bots. Each bot communicates solely with the controller.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;The communication method will depend on the controller type (language agnostic/specific). Players will either be functions/objects in a specific language, or separate programs that communicate through STDIN/STDOUT.&lt;/p&gt;&#xA;&lt;p&gt;Each step all bots will be supplied with the same information, and will provide a facing angle which will be a float in the range [0, 360).&lt;/p&gt;&#xA;&lt;p&gt;The information supplied to bots will be as follows.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Team direction (&lt;code&gt;1&lt;/code&gt; for team 1 or &lt;code&gt;-1&lt;/code&gt; for team 2)&lt;/li&gt;&#xA;&lt;li&gt;Current score (positive if team 1 is winning, negative if team 2 is winning)&lt;/li&gt;&#xA;&lt;li&gt;Facing angle and velocity of itself&lt;/li&gt;&#xA;&lt;li&gt;Facing angle and velocity of 4 team mates&lt;/li&gt;&#xA;&lt;li&gt;Facing angle and velocity of 5 opponents&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Facing angle will be given as a float.&#xA;Velocity will be given as x and y components, so two floats.&lt;/p&gt;&#xA;&lt;p&gt;The information will therefore be received as two integers followed by 15 floats.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are any terms not familiar that would be worth linking or further explaining?&lt;/li&gt;&#xA;&lt;li&gt;Are there any further simplifications that could be made, without detracting from the game?&lt;/li&gt;&#xA;&lt;li&gt;Are any of the simplifications too much? Am I overlooking some way in which the game could become trivial?&lt;/li&gt;&#xA;&lt;li&gt;Is it correct to model the bots as radius 2 and the ball as a point? Does this give identical results to modelling the bots as radius 1 and the ball as radius 1?&lt;/li&gt;&#xA;&lt;li&gt;Are there any problems likely to arise from basing collision detection on constant velocity bots and ball? (Acceleration being applied instantaneously each step, rather than spread out over continuous time.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-16T12:49:32.430" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5431" PostTypeId="1" AcceptedAnswerId="5432" CreationDate="2015-06-16T06:01:06.070" Score="12" ViewCount="269" Body="&lt;p&gt;I usually comment under an answer if I've found a mistake in the answerer's code. I also do it when the code can be golfed more.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After the answerer fixes/golfs his/her code, should I delete my comment?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, if the answerer has comment something like &lt;code&gt;Thanks!&lt;/code&gt; replied to my comment, should I flag it as obsolete/not-constructive or something else after I've deleted my comment?&lt;/p&gt;&#xA;" OwnerUserId="38214" LastActivityDate="2015-06-16T07:49:14.423" Title="Should I delete my comment after OP fixes/golfs OP's code?" Tags="|discussion|comments|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5432" PostTypeId="2" ParentId="5431" CreationDate="2015-06-16T07:49:14.423" Score="15" Body="&lt;p&gt;Yes. Comments are generally not supposed to be permanent on Stack Exchange. In particular, if they suggest an improvement or critique something in an answer, they should be removed once the answer has addressed the comment. And also yes, since deleting your comment makes a &quot;Thanks&quot; reply obsolete, please also flag the answerer's comment so a moderator can clean it up.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a side note, especially here on PPCG, this is why it's nice to credit any users who improved your score on a challenge, such that others can still see who improved it after the comments have been deleted.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-06-16T07:49:14.423" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="5433" PostTypeId="2" ParentId="2140" CreationDate="2015-06-16T11:54:03.097" Score="1" Body="&lt;h1&gt;Solve the nonogram&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Nonograms, also known as Hankie or Picross, are fascinating. They are really simple is essence, but to solve the most complexe one, some tricks have to be learned.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Basics&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Nonograms are usually presented this way :&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;           1&#xA;         2 1 2&#xA;       3 2 1 2 3&#xA;     +-----------&#xA;    3|&#xA;  2 2|&#xA;1 1 1|&#xA;  2 2|&#xA;    3|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The numbers in lines and columns determine how much box in a row will be present, and how much sets there will be on this line/columns.&#xA;The seconde line says &lt;code&gt;2 2&lt;/code&gt;which means &quot;2 boxes in a row, at least one space, 2 boxes in a row&quot;&#xA;Let's give it a try with the 5x5 sample above.&#xA;I will use &lt;code&gt;#&lt;/code&gt;for boxes and &lt;code&gt;.&lt;/code&gt;for blank confirmed.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;           1&#xA;         2 1 2&#xA;       3 2 1 2 3&#xA;     +-----------&#xA;    3|&#xA;  2 2|&#xA;1 1 1|&#xA;  2 2|&#xA;    3|&#xA;As we said, second line says 2,some spaces,2. &#xA;As we are playing on a 5x5 board, there's only one space remaining after &#xA;putting the boxes, so their position is certain.&#xA;           1&#xA;         2 1 2&#xA;       3 2 1 2 3&#xA;     +-----------&#xA;    3|&#xA;  2 2| # # . # #&#xA;1 1 1|&#xA;  2 2|&#xA;    3|&#xA;There's some other 2 2 rows, let's fill them !&#xA;&#xA;           1&#xA;         2 1 2&#xA;       3 2 1 2 3&#xA;     +-----------&#xA;    3|   #   #&#xA;  2 2| # # . # #&#xA;1 1 1|   .   .&#xA;  2 2| # # . # #&#xA;    3|   #   #&#xA;&#xA;We can say this puzzle is over :&#xA;Look at the 1 1 1 rows, they have already 2 blank confirmed&#xA;which means there's only 3 spaces left. We can fill these, and complete the&#xA;puzzle.&#xA;&#xA;           1&#xA;         2 1 2&#xA;       3 2 1 2 3&#xA;     +-----------&#xA;    3|   # # #&#xA;  2 2| # # . # #&#xA;1 1 1| # . # . #&#xA;  2 2| # # . # #&#xA;    3|   # # #&#xA;&#xA;We didn't checked all confirmed blank, but it's not the matter, we only need&#xA;to check the boxes. Note that the 3 rows has been useless to solve this &#xA;puzzle.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There you got the basics, but some tips on &lt;a href=&quot;https://en.wikipedia.org/?title=Nonogram&quot; rel=&quot;nofollow noreferrer&quot;&gt;the wikipedia page could be useful.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Goal&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your job is to write a program in the language you want to solve nonograms.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There shouldn't be any problem, but here's some &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/41019&quot;&gt;loopholes that are forbidden&lt;/a&gt;, just in case :).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd also like you to write which down command have to be run to execute your code, and  &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input can be graphic, an array, a string via stdin, or whatever you want. You may hard-code it, I want to know how fast your program is to solve nonograms, not how fast it is to parse datas.&#xA;I'll provide two format for each test case. A ASCII-Art'd one, as shown above, and one structured as an array in the form :&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; [[columns],[lines]]&#xA; columns and line will also be noted the same way, the array for the sample :&#xA; [[[3],[2,2],[1,1,1],[2,2],[3]],[[3],[2,2],[1,1,1],[2,2],[3]]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You must produce the solved nonogram, formated as you want as long as it is clear. It should be outputed via stdout, or your language closest alternative, as an Image, Ascii-art or left on top of the stack.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Puzzles will never be greater than 99*99, nor smaller than 2*2.They all are solvable by using basic techniques, the ones shown on wikipedia are far more than enough.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I might add some test cases latter, but big ones take time, a lot of time. If you want to give it a try, post one with your answer, and it will be added if it is solvable without any guess. Which means solving only those one won't be necessary nice, you need to be able to solve any &quot;basic&quot; nonogram : No multi-row - multi depth contradiction looking. Even contradiction shouldn't be necessary&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;5x5&#xA;[[[3],[2,2],[1,1,1],[2,2],[3]],[[3],[2,2],[1,1,1],[2,2],[3]]]&#xA;&#xA;           1&#xA;         2 1 2&#xA;       3 2 1 2 3&#xA;     +-----------&#xA;    3|&#xA;  2 2|&#xA;1 1 1|&#xA;  2 2|&#xA;    3|&#xA;&#xA;10x10&#xA;&#xA;[[[3],[2,2],[1,1,1],[2,2],[3],[3,1],[2,7],[1,1,1,1],[2,2,2],[3,3]],[[3],[2,2],[1,1,1],[3,2,2],[2,2,3],[1,1,1,1],[2,4,1],[3,1,2],[4],[1]]]&#xA;&#xA;                       1&#xA;             1         1 2&#xA;           2 1 2   3 2 1 2 3&#xA;         3 2 1 2 3 1 7 1 2 3&#xA;       +--------------------&#xA;      3|&#xA;    2 2|&#xA;  1 1 1|&#xA;  3 2 2|&#xA;  2 2 3|&#xA;1 1 1 1|&#xA;  2 4 1|&#xA;  3 1 2|&#xA;      4|&#xA;      1| &#xA;&#xA;30x30&#xA;&#xA;[[[10,6,10],[9,8,9],[7,10,7],[7,14,6],[6,15,5],[6,15,5],[5,17,4],[5,19,4],[26,3],[4,2,10,2,3],[4,1,8,1,3],[3,12,3],[3,9,3],[3,16,3],[3,16,3][3,16,3][3,16,3][3,16,3],[3,9,3],[3,12,3],[3,1,8,1,3],[4,2,10,2,3],[4,25],[4,19,4],[5,17,5],[6,16,5],[6,12,7],[8,10,8],[8,8,10],[10,6,10]]&#xA;&#xA;                                  4 4                   3 4&#xA;                                  2 1                   1 2&#xA;               10 9 7 7 6 6 5 5  10 8 3 3 3 3 3 3 3 3 3 810   4 5 6 6 8 810&#xA;                6 810141515171926 2 112 91616161616 912 1 2 41917161210 8 6&#xA;               10 9 7 6 5 5 4 4 3 3 3 3 3 3 3 3 3 3 3 3 3 325 4 5 5 7 81011 &#xA;              +------------------------------------------------------------&#xA;            30|&#xA;            30|&#xA;            30|&#xA;          11 9|&#xA;           9 6|&#xA;   6 3 1 1 3 5|&#xA;   4 3 1 1 3 3|&#xA;   2 3 2 2 4 3|&#xA;     2 6 5 4 1|&#xA;     1 6 5 5 1|&#xA;         7 5 6|&#xA;         9 7 8|&#xA;            30|&#xA;            30|&#xA;            30|&#xA;            30|&#xA;            30|&#xA;            30|&#xA;            28|&#xA;          26 1|&#xA; 1 7 1 5 1 6 2|&#xA; 2 6 1 3 1 4 2|&#xA; 2 5 1 3 1 4 3|&#xA; 3 3 1 1 1 3 4|&#xA;     4 3 1 3 4|&#xA;       6 3 3 6|&#xA;           8 8|&#xA;            30|&#xA;            30|&#xA;            30|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Solution&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For those who are interested, here's the solution for the test cases.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 5x5&#xA;&#xA;           1&#xA;         2 1 2&#xA;       3 2 1 2 3&#xA;     +----------&#xA;    3| . # # # .&#xA;  2 2| # # . # #&#xA;1 1 1| # . # . #&#xA;  2 2| # # . # #&#xA;    3| . # # # .&#xA;&#xA;10x10&#xA;                       1&#xA;             1         1 2&#xA;           2 1 2   3 2 1 2 3&#xA;         3 2 1 2 3 1 7 1 2 3&#xA;       +--------------------&#xA;      3| . . . . . . # # # .&#xA;    2 2| . . . . . # # . # #&#xA;  1 1 1| . . . . . # . # . #&#xA;  3 2 2| . # # # . # # . # #&#xA;  2 2 3| # # . # # . # # # .&#xA;1 1 1 1| # . # . # . # . . .&#xA;  2 4 1| # # . # # # # . . #&#xA;  3 1 2| . # # # . # # . # #&#xA;      4| . . . . . . # # # #&#xA;      1| . . . . . . # . . .&#xA;&#xA;30x30&#xA;Hope you'll like it, it took me a lot of time :)&#xA;                                  4 4                   3 4&#xA;                                  2 1                   1 2&#xA;               10 9 7 7 6 6 5 5  10 8 3 3 3 3 3 3 3 3 3 810   4 5 6 6 8 810&#xA;                6 810141515171926 2 112 91616161616 912 1 2 41917161210 8 6&#xA;               10 9 7 6 5 5 4 4 3 3 3 3 3 3 3 3 3 3 3 3 3 325 4 5 5 7 81011 &#xA;              +------------------------------------------------------------&#xA;            30| # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #&#xA;            30| # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #&#xA;            30| # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #&#xA;          11 9| # # # # # # # # # # # . . . . . . . . . . # # # # # # # # #&#xA;           9 6| # # # # # # # # # . . . . . . . . . . . . . . . # # # # # #&#xA;   6 3 1 1 3 5| # # # # # # . . # # # . . # . . . # . . # # # . . # # # # #&#xA;   4 3 1 1 3 3| # # # # . . . # # # . . . # . . . # . . . # # # . . . # # #&#xA;   2 3 2 2 4 3| # # . . . . # # # . . . . # # . # # . . . . # # # # . # # #&#xA;     2 6 5 4 1| # # . # # # # # # . . . . # # # # # . . . . # # # # . . . #&#xA;     1 6 5 5 1| # . . # # # # # # . . . . # # # # # . . . . # # # # # . . #&#xA;         7 5 6| . . # # # # # # # . . . . # # # # # . . . . # # # # # # . .&#xA;         9 7 8| . # # # # # # # # # . . # # # # # # # . . # # # # # # # # .&#xA;            30| # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #&#xA;            30| # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #&#xA;            30| # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #&#xA;            30| # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #&#xA;            30| # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #&#xA;            30| # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #&#xA;            28| . # # # # # # # # # # # # # # # # # # # # # # # # # # # # .&#xA;          26 1| . . # # # # # # # # # # # # # # # # # # # # # # # # # # . #&#xA; 1 7 1 5 1 6 2| # . . # # # # # # # . # . # # # # # . # . # # # # # # . # #&#xA; 2 6 1 3 1 4 2| # # . # # # # # # . . # . . # # # . . # . . # # # # . . # #&#xA; 2 5 1 3 1 4 3| # # . . # # # # # . . # . . # # # . . # . . # # # # . # # #&#xA; 3 3 1 1 1 3 4| # # # . . . # # # . . # . . . # . . . # . . # # # . # # # #&#xA;     4 3 1 3 4| # # # # . . . # # # . . . . . # . . . . . # # # . . # # # #&#xA;       6 3 3 6| # # # # # # . . # # # . . . . . . . . . # # # . # # # # # #&#xA;           8 8| # # # # # # # # . . . . . . . . . . . . . . # # # # # # # #&#xA;            30| # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #&#xA;            30| # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #&#xA;            30| # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #&#xA;60x60&#xA;Not completed, not tested&#xA;&#xA;                              60| # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #&#xA;                     6 3 1 1 335| # # # # # # . . # # # . . # . . . # . . # # # . . # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #&#xA;             6 3 1 1 3 6 6 5 5 1| # # # # # # . . # # # . . # . . . # . . # # # . . # # # # # # . . # # # # # # . . . . # # # # # . . . . # # # # # . . #&#xA;                             647| . # # # # # # . . . . . . # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #&#xA;                   5 1 1 3 2 1 4| # # # # # . . . . . . . . . . . . . . . . # . . . . . . . . . . . . . . . . . . . . # . # # # . # # . # . . . . # # # #&#xA;                   1 2 1 2 2 1 4| . # . # # . . . . . . . . . . . . . . . . # . . . . . . . . . . . . . . . . . . . . . . . # # . # # . # . . . . # # # #&#xA;                     1 2 1 2 1 3| # . . . # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . # . # # . # . . . . . # # #&#xA;                       2 2 1 1 2| # # . . # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . # . . # . . . . . . . . # #&#xA;                           3 2 2| # # # . # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . # #&#xA;                           3 2 1| # # # . . # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . #&#xA;                           3 3 1| . # # # . # # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . #&#xA;                             1 8| # . # # # # # # # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .&#xA;                         1 4 4 1| # . # # # # . # # # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . #&#xA;                         1 3 2 2| # . # # # . . . . # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . # #&#xA;                         1 3 2 1| # . . # # # . . . . # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . #&#xA;                         2 4 3 1| # # . # # # # . . . # # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . # .&#xA;                         4 3 3 2| # # # # . # # # . . . # # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . # #&#xA;                         3 4 3 1| . # # # . . # # # # . # # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . #&#xA;                           1 3 8| # . # # # . # # # # # # # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .&#xA;                       1 3 1 5 1| # . # # # . # . # # # # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . #&#xA;                         1 5 4 2| # . # # # # # . # # # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . # #&#xA;                       2 4 2 3 2| # # . # # # # . # # . # # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . # # .&#xA;                   2 2 2 1 3 2 1| # # . # # . # # . # . . # # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . # # . #&#xA;                   1 2 2 1 3 2 2| . # . # # . # # . # . . . # # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . # # . # #&#xA;                   3 1 2 2 4 2 2| # # # . # . # # . # # . # # # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . # # . # # .&#xA;                 3 1 2 4 3 2 2 1| # # # . # . # # . # # # # . # # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . # # . # # . #&#xA;               1 2 2 3 2 3 2 2 2| # . # # . # # . # # # . # # . # # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . # # . # # . # #&#xA;               1 2 2 3 2 3 2 2 2| # . # # . # # . # # # . # # . # # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . # # . # # . # # .&#xA;                 4 2 6 4 2 2 2 1| # # # # . # # . # # # # # # . # # # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . # # . # # . # # . #&#xA;                   6 6 4 2 2 2 2| . # # # # # # . # # # # # # . # # # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . # # . # # . # # . # #&#xA;               3 3 2 3 5 3 2 2 2| # # # . # # # . # # . # # # . # # # # # . . . . . . . . . . . . . . . . . . . . . . . . . . . . # # # . # # . # # . # #&#xA;             1 1 3 2 6 3 4 2 2 2| # . # . # # # . # # . # # # # # # . # # # . . . . . . . . . . . . . . . . . . . . . . . . . . # # # # . # # . # # . # #&#xA;         1 5 2 2 1 1 3 2 2 2 2 1| # . # # # # # . # # . # # . # . # . # # # . . . . . . . . . . . . . . . . . . . . . . . . . # # . . # # . # # . # # . #&#xA;         1 3 1 2 2 1 1 4 3 2 2 2| # . # # # . # . # # . # # . # . # . # # # # . . . . . . . . . . . . . . . . . . . . . . . # # # . . . # # . # # . # # .&#xA;           1 3 1 2 2 3 4 4 2 2 2| # . # # # . # . # # . # # . # # # . . # # # # . . . . . . . . . . . . . . . . . . . . . # # # # . . . . # # . # # . # #&#xA;       1 1 1 1 2 2 3 4 2 2 2 2 1| # . # . # . # . # # . # # . # # # . . # # # # . . . . . . . . . . . . . . . . . . . . # # . . # # . . . . # # . # # . #&#xA;             3 6 2 4 1 3 3 2 2 2| # # # . # # # # # # . # # . # # # # . # . # # # . . . . . . . . . . . . . . . . . . # # # . . . # # . . . . # # . # # .&#xA;           2 2 3 2 4 1 4 4 2 2 2| . # # . # # . # # # . # # . # # # # . # . # # # # . . . . . . . . . . . . . . . . # # # # . . . . # # . . . . # # . # #&#xA;       2 2 3 2 1 1 1 4 2 2 2 2 1| # # . . # # . # # # . # # . # . . # . # . # # # # . . . . . . . . . . . . . . . # # . . # # . . . . # # . . . . # # . #&#xA;         2 6 2 1 2 1 2 3 3 2 2 2| # # . . # # # # # # . # # . # . # # . # . # # . # # # . . . . . . . . . . . . # # # . . . # # . . . . # # . . . . # # .&#xA;           4 5 4 2 1 1 3 4 2 2 2| # # # # . # # # # # . # # # # . # # . # . # . . # # # . . . . . . . . . . . # # # # . . . . # # . . . . # # . . . . # #&#xA;         3 5 4 2 1 1 2 2 2 2 2 1| . # # # . # # # # # . # # # # . # # . # . # . . # # . . . . . . . . . . . # # . . # # . . . . # # . . . . # # . . . . #&#xA;           8 4 4 1 2 1 2 2 2 2 1| # # # # # # # # . # # # # . # # # # . # . # # . # . . . . . . . . . . . # # . . . . # # . . . . # # . . . . # # . . # .&#xA;         3 4 1 2 4 1 3 2 2 2 2 2| # # # . # # # # . # . # # . # # # # . # . # # # . . . . . . . . . . . # # . . . . . . # # . . . . # # . . . . # # . # #&#xA;           3 6 2 4 1 6 4 2 2 2 1| # # # . # # # # # # . # # . # # # # . # . # # # # # # . . . . . # # # # . . . . . . . . # # . . . . # # . . . . # # . #&#xA;       3 6 2 4 1 4 2 2 2 2 2 2 1| # # # . # # # # # # . # # . # # # # . # . # # # # . # # . . . # # . # # . . . . . . . . # # . . . . # # . . . . # # . #&#xA;       3 6 2 4 1 5 1 1 3 2 2 2 1| # # # . # # # # # # . # # . # # # # . # . # # # # # . # . . . # . # # # . . . . . . . . # # . . . . # # . . . . # # . #&#xA;           3 6 2 4 1 212 2 2 2 1| # # # . # # # # # # . # # . # # # # . # . # # . # # # # # # # # # # # # . . . . . . . . # # . . . . # # . . . . # # . #&#xA;       3 6 2 4 1 2 1 1 3 2 2 2 1| # # # . # # # # # # . # # . # # # # . # . # # . # . . . . # . . . . # # # . . . . . . . # # . . . . # # . . . . # # . #&#xA;           3 6 2 4 1 4 1 4 2 2 4| # # # . # # # # # # . # # . # # # # . # . # # # # . . . . # . . . . # # # # . . . . . . # # . . . . # # . . . . # # # #&#xA;         3 6 2 4 1 4 1 2 2 2 2 4| # # # . # # # # # # . # # . # # # # . # . # # # # . . . . # . . . . # # . # # . . . . . # # . . . . # # . . . . # # # #&#xA;         3 6 2 4 1 4 1 2 2 2 2 3| # # # . # # # # # # . # # . # # # # . # . # # # # . . . . # . . . . # # . . # # . . . . # # . . . . # # . . . . # # # .&#xA;         3 6 2 4 1 4 1 2 2 2 2 4| # # # . # # # # # # . # # . # # # # . # . # # # # . . . . # . . . . # # . . . # # . . . # # . . . . # # . . . . # # # #&#xA;       3 6 2 4 1 4 1 2 2 2 2 2 1| # # # . # # # # # # . # # . # # # # . # . # # # # . . . . # . . . . # # . . . # # . . . # # . . . . # # . . . . # # . #&#xA;       3 6 2 4 1 4 1 2 2 2 2 2 1| # # # . # # # # # # . # # . # # # # . # . # # # # . . . . # . . . . # # . . . # # . . . # # . . . . # # . . . . # # . #&#xA;       3 6 2 4 1 4 3 2 2 2 2 2 1| # # # . # # # # # # . # # . # # # # . # . # # # # . . . # # # . . . # # . . . # # . . . # # . . . . # # . . . . # # . #&#xA;   3 6 2 4 1 4 1 1 1 2 2 2 2 2 1| # # # . # # # # # # . # # . # # # # . # . # # # # . . # . # . # . . # # . . . # # . . . # # . . . . # # . . . . # # . #&#xA; 3 6 2 4 1 4 2 1 2 2 2 2 1 2 2 1| # # # . # # # # # # . # # . # # # # . # . # # # # . # # . # . # # . # # . . . # # . . . # # . . # . # # . . . . # # . #&#xA;   3 6 2 4 1 4 2 1 2 2 2 2 1 2 4| # # # . # # # # # # . # # . # # # # . # . # # # # . # # . # . # # . # # . . . # # . . . # # . . # . # # . . . # # # # .&#xA;         3 6 2 4 1 4 2 1 6 4 412| # # # . # # # # # # . # # . # # # # . # . # # # # . # # . # . # # # # # # . # # # # . # # # # . # # # # # # # # # # # #&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Winning criteria&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Puzzle solving might be long, who will find the best heuristics? Who will find the best implementation? Fastest code will win (code will be running on my computer, i5-4440, and must not use more than 4GB of RAM). &#xA;You'll be scored using the 60*60 nonogram &lt;code&gt;sandbox note : have to be added&lt;/code&gt;. Other test cases are here to help you while developing your submission.&#xA;If there's a need of a Tie-breaker, i'll provide more complex test case (maybe a 90*90?)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I have two questions for the sandbox :&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Do I need to put more explanations?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is there too much grammar/others faults? (I'm not native, sorry :()&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;As suggested by @steveverrill, I changed it to a fastest-code contest, some basic things changed. It makes much more sense, thanks.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I added the first part of the 60x60 nonogram, still have to form the array, and do the columns. I know it is ugly, but I wasn't able to come with a nice one which would be viable AND long to solve. T&lt;/p&gt;&#xA;" OwnerUserId="41019" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2015-06-17T11:57:06.250" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="5434" PostTypeId="2" ParentId="1024" CreationDate="2015-06-16T12:47:56.177" Score="2" Body="&lt;p&gt;I submitted a golfing answer written is z/OS Assembler. I used f p'¬' to count only the actual characters of source (find non-blank) but also included the size of the executable in bytes - I think assembler will beat COBOL on that one :-)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You could, perhaps, resign yourself to the fact that you won't win and submit bytes of actual code (omitting the compulsory DIVISION statements etc) and number of character in the source as separate figures.&lt;/p&gt;&#xA;" OwnerUserId="41176" LastActivityDate="2015-06-16T12:47:56.177" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5437" PostTypeId="1" CreationDate="2015-06-16T16:09:03.420" Score="15" ViewCount="350" Body="&lt;p&gt;When reading several pieces of input as command-line arguments, it is common practice to read each piece as a different argument. The command-line arguments now provide an array of the input pieces.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should submissions that use different input formats also be allowed to read an array of input pieces by default?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please vote the answers below up or down. Feel free to add answers of your own.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2015-06-16T16:11:09.100" Title="Defaults for reading several pieces of input" Tags="|discussion|policy|code-golf|answers|defaults|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5438" PostTypeId="2" ParentId="5437" CreationDate="2015-06-16T16:09:17.860" Score="21" Body="&lt;h3&gt;It is allowed to read an array of input pieces from STDIN.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If the question requires to accept, e.g., two integers as input, it is allowed to read them as the string &lt;code&gt;[4,2]&lt;/code&gt; from STDIN (or whatever your language of choice uses as array syntax).&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2015-06-16T16:09:17.860" CommentCount="1" CommunityOwnedDate="2015-06-16T16:09:17.860" ContentLicense="CC BY-SA 3.0" />
  <row Id="5439" PostTypeId="2" ParentId="5437" CreationDate="2015-06-16T16:11:09.100" Score="23" Body="&lt;h3&gt;It is allowed to read input as a single function argument.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If the question requires to accept, e.g., two integers as input, it is allowed to read them as the single function argument &lt;code&gt;[4,2]&lt;/code&gt; (array).&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2015-06-16T16:11:09.100" CommentCount="1" CommunityOwnedDate="2015-06-16T16:11:09.100" ContentLicense="CC BY-SA 3.0" />
  <row Id="5440" PostTypeId="2" ParentId="2140" CreationDate="2015-06-17T00:00:15.933" Score="-2" Body="&lt;p&gt;Please nitpick this. If there's anything that wouldn't work or would be inconvenient, however small of an issue it is, tell me about it!&lt;br&gt;&#xA;Also, suggestions for &lt;em&gt;[adjective]&lt;/em&gt; are more than welcome.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Determine how &lt;em&gt;[adjective]&lt;/em&gt; a number is (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A number would be considered &lt;em&gt;[adjective&lt;/em&gt;] if 0 is the result of multiplying its digits together, then multiplying the digits of the resulting number, then repeating until a single-digit number is produced. The more steps it takes to reach 0, the more &lt;em&gt;[adjective]&lt;/em&gt; the number is; if the resulting number is not 0, though, the number is not &lt;em&gt;[adjective]&lt;/em&gt; regardless of how long it took to finish.&lt;br&gt;&#xA;The formula used to determine &lt;em&gt;[adjective]&lt;/em&gt;-ness is &lt;code&gt;10-10/T&lt;/code&gt; where T is however many numbers it took to reach 0 (including 0 and the initial input)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your goal is, as the title says, to write a program or function that determines how &lt;em&gt;[adjective]&lt;/em&gt; a number is, and prints every iteration along the way. Here are some &lt;strong&gt;example inputs/ouputs:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;in: 879&#xA;out: 879    &amp;lt;-       (T=1)&#xA;     504    &amp;lt;- 8*7*9 (T=2)&#xA;     0      &amp;lt;- 5*0*4 (T=3)&#xA;            &amp;lt;- optional newline&#xA;     6.6... &amp;lt;- 10-10/3 (repeating decimals can be expressed in any way you want)&#xA;&#xA;in: 2468&#xA;out: 2468   &amp;lt;-  T=1&#xA;     96     &amp;lt;- (T=2) 2*4*6*8&#xA;     54     &amp;lt;- (T=3) 9*6&#xA;     20     &amp;lt;- (T=4) 5*4&#xA;     0      &amp;lt;- (T=5) 2*0&#xA;&#xA;     8      &amp;lt;- 10-10/5&#xA;&#xA;in: -888&#xA;out: -888  &#xA;     -512   &amp;lt;- -8*-8*-8&#xA;     -10    &amp;lt;- -5*-1*-2&#xA;     0      &amp;lt;- -1*0&#xA;&#xA;     6.6... &amp;lt;- 10-10/3&#xA;&#xA;in: 1344&#xA;out: 1344&#xA;     48&#xA;     32&#xA;     6&#xA;&#xA;     0    &amp;lt;- did not produce 0, so the prog/func returns 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your program must follow these &lt;strong&gt;rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-Takes input from STDIN.&lt;br&gt;&#xA;-Throws an &quot;error&quot; (printed to STDOUT) and halts immediately after input if the input has one or more 0s in it &lt;em&gt;or&lt;/em&gt; if it's less than three digits in length. The error must be a string, and as it's supposed to be printed to stdout, cannot be one generated by the language itself (eg &lt;code&gt;1/int(min(input()))&lt;/code&gt; to check if it's zero). Lastly, the error message has to clearly define what the error is; &lt;code&gt;ERR:0&lt;/code&gt; and &lt;code&gt;ERR:LEN&lt;/code&gt;, for example, would suffice.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Bonuses/Penalties:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;-25&lt;/strong&gt; if it properly handles decimals. For instance, an input of 99.22 would first turn into &lt;code&gt;9*9 + 0.(2*2)&lt;/code&gt;, or &lt;code&gt;9*9 + 0.4&lt;/code&gt;, and so on.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the &lt;strong&gt;shortest answer in bytes&lt;/strong&gt; wins.&lt;/p&gt;&#xA;" OwnerDisplayName="user39326" LastEditorDisplayName="user39326" LastEditDate="2015-06-17T23:36:13.893" LastActivityDate="2015-06-17T23:36:13.893" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="5443" PostTypeId="2" ParentId="2140" CreationDate="2015-06-18T02:54:33.510" Score="1" Body="&lt;h1&gt;4-Way Intersection Simulator&lt;/h1&gt;&#xA;&lt;p&gt;Consider an intersection as follows:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/w5ghD.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;Cars will drive up any of the above &lt;code&gt;Input&lt;/code&gt; lanes, and will exit out of any of the 3 other &lt;code&gt;Output&lt;/code&gt; lanes.  &lt;strong&gt;The goal is to take the list of cars, their arrival time, and their destination, and to return the times they will exit the intersection&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;We will measure the time that it takes a car to cross an intersection as 1 &lt;strong&gt;Tick&lt;/strong&gt;.  We will assume that the time it takes for a car to approach and leave the intersection to be 0 ticks.&lt;/p&gt;&#xA;&lt;p&gt;Each input acts as a queue of cars.  Each tick, &lt;strong&gt;the car that has been at the front of its respective lane the longest will cross the intersection&lt;/strong&gt; in his respective direction.&lt;/p&gt;&#xA;&lt;h1&gt;Priority&lt;/h1&gt;&#xA;&lt;p&gt;If multiple cars have been waiting for the same amount of time, the rightmost car has priority.  If there are 2 cars that are on opposing sides, they will both cross at the same time (as described below), unless only one of them is turning left.  If that is the case, the car not turning left will have priority.  Two cars may turn left at the same time.  If there are 4 cars that arrive at the same time, the car in Input 1 will have priority.&lt;/p&gt;&#xA;&lt;p&gt;After the car to cross has been chosen, other cars may cross at the same time, assuming their paths don't cross.  Priority is given to the lane directly across from the crossing car, then to the car to right, then to the car to his left.&lt;/p&gt;&#xA;&lt;h1&gt;Input/Output&lt;/h1&gt;&#xA;&lt;p&gt;Input will be a list of cars.  Each car will be passed as a tuple containing the cars' unique ID, arrival time, arrival lane, and destination lane.  The arrival lane will never be the destination lane.&lt;/p&gt;&#xA;&lt;p&gt;Your program should output a list of cars, where each car is a tuple containing the cars' unique ID and the time it reaches its destination.&lt;/p&gt;&#xA;&lt;p&gt;I don't care if the input format exactly matches the examples below.  What I do care is that you input a list of tuples/lists and output a list of tuples/lists.&lt;/p&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;[(0, 5, 2, 3)] -&amp;gt; [(0, 6)] &#xA;Car 0 arrives in lane 2 at tick 5.  He leaves in lane 3 at tick 6&#xA;&#xA;[(0, 3, 1, 3), (1, 3, 3, 1)] -&amp;gt; [(0, 4), (1, 4)] &#xA;Car 0 and 1 arrive in lanes 1 and 3 at tick 3.  They both leave at tick 4.&#xA;&#xA;[(0, 0, 3, 1), (1, 0, 4, 2), (2, 1, 4, 2)] -&amp;gt; [(0, 2), (1, 1), (2, 3)]&#xA;Car 0 and 1 arrive in lanes 3 and 4.  Their paths intersect, so car 1 leaves first &#xA;because it is the rightmost car.  The next tick, car 2 arrives, but car 0 has been &#xA;waiting the longest, so car 0 leaves next.  Finally, car 2 leaves at time 3.&#xA;&#xA;[(0, 0, 1, 2), (1, 0, 2, 3), (2, 0, 3, 4), (3, 0, 4, 2)] -&amp;gt; [(0, 1), (1, 3), (2, 1), (3, 2)]&#xA;All four cars arrive at the same time.  Car 0 has the priority as it is in Input 1.  &#xA;Car 2 is directly across from it, and both are turning left, so they cross at the same &#xA;time.  Car 1 is turning left, so car 3 will cross next, followed by Car 1.&#xA;&#xA;[(0, 0, 1, 4), (1, 0, 2, 1), (2, 0, 3, 2), (3, 0, 4, 3)] -&amp;gt; [(0, 1), (1, 1), (2, 1), (3, 1)]&#xA;All four cars arrive at the same time, all are turning right, so all leave at tick 1.&#xA;&#xA;[(0, 0, 1, 3), (1, 0, 4, 2), (2, 0, 3, 2), (3, 1, 1, 4), (4, 1, 4, 1), (5, 1, 2, 1), (6, 2, 3, 4), (7, 2, 1, 3), (8, 3, 1, 4), (9, 3, 4, 2), (10, 3, 3, 2)] -&amp;gt; [(0, 1), (2, 1), (1, 2), (3, 2), (5, 2), (6, 3), (4, 4), (10, 4), (7, 5), (9, 6), (8, 6)]&#xA;Car 2 is the rightmost, and has priority.  Car 0 is also able to cross at Tick 0&#xA;Car 1 has now been waiting the longest, and has priority.  Both Car 3 and 5 are able to&#xA;cross as well.  Car 4 was waiting behind Car 1, and so Cars 4, 6, and 7 arrive at the&#xA;same time.  Car 6 is the rightmost, so he exits at tick 3 while cars 8-10 arrive.&#xA;Car 4 is the next rightmost, so he makes his turn next, while Car 10 makes his right turn.&#xA;Car 7 finally has his turn, and crosses.  Car 8 is behind Car 7, and Car 9 intersects with&#xA;Car 7, so neither cross at the same time, but both are able to cross the next tick.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-18T12:11:40.607" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5447" PostTypeId="1" CreationDate="2015-06-18T19:33:59.260" Score="19" ViewCount="436" Body="&lt;p&gt;This is a follow up to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/4867/18487&quot;&gt;Can I ever answer with a language invented after the challenge was posted?&lt;/a&gt; It seems to be well established that you can post answers using a new language, but you can't win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What about new versions of the same language? For example, if Pyth is updated, can I use the new version of Pyth to answer old challenges?&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2015-12-19T20:39:18.357" Title="Can I win with a version of a language that didn't exist when the challenge was posted?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ClosedDate="2017-06-19T10:35:28.027" ContentLicense="CC BY-SA 3.0" />
  <row Id="5448" PostTypeId="2" ParentId="5447" CreationDate="2015-06-18T19:43:46.800" Score="39" Body="&lt;p&gt;I would apply the same rules as to a new language, because it opens the same loopholes as using a newer language: any language author could just patch in a handy built-in to solve the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So yes, you can post it, but no your answer is not eligible for being accepted. Hence, answers using newer versions should add a disclaimer to the answer to inform the challenge author that their answer is not eligible for winning.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-06-18T19:43:46.800" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5451" PostTypeId="1" CreationDate="2015-06-19T18:09:05.070" Score="11" ViewCount="135" Body="&lt;p&gt;For interactive questions, how much demand is there to be able to use a purely touchscreen device (no mouse, no physical keyboard). I'm asking thinking of Stack Snippets in questions. Are there any other places where being touch-enabled would make a difference?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm assuming tick boxes, radio buttons and selection boxes can all be used with a touchscreen device already. For the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5435/20283&quot; title=&quot;Ant Queen of the Hill&quot;&gt;question I'm planning&lt;/a&gt; the display will zoom when hovered over with the mouse pointer, and I'm wondering whether this is sufficient or whether touching the screen should also zoom in on that point. Without this I'm guessing the question will not be usable on a phone or tablet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How many of you would want to be able to view such a challenge running on a screen-only device?&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-06-19T18:30:06.513" Title="Demand for touch support" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5452" PostTypeId="2" ParentId="5451" CreationDate="2015-06-19T18:30:06.513" Score="19" Body="&lt;h1&gt;Don't trouble yourself&lt;/h1&gt;&#xA;&lt;p&gt;While I use my phone, and to a lesser extent my tablet, to browse around (and get notifications for) SE, I wouldn't be interested in running a full challenge in a snippet on my phone.&lt;/p&gt;&#xA;&lt;p&gt;Most people who frequent the site are, by implication, people who read and/or write code. I have to assume there isn't a large percentage of them that don't have regular access to a keyboard/mouse.&lt;/p&gt;&#xA;&lt;p&gt;While I wouldn't care if someone &lt;em&gt;did&lt;/em&gt; add touch controls, it's not worth the effort in my opinion.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-19T18:30:06.513" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5453" PostTypeId="2" ParentId="2140" CreationDate="2015-06-19T22:23:09.900" Score="3" Body="&lt;h1&gt;Invisible target - probability KotH&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt; &lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/probability-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;probability-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;probability-theory&lt;/a&gt;&lt;/em&gt; &lt;em&gt;?&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;In short&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Walls are gradually added and the player nearest to the stationary invisible target at the end of the game wins.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Detail&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Players are all present on a 32 by 32 grid of square cells, which wraps toroidally. One randomly chosen cell is the target, which is not indicated to any of the players (regardless of whether they are on that cell or not). The target does not move.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Players all take their turn simultaneously. After each turn there is a small chance of a wall being added.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Wall rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The wall will never be placed on a player.&lt;/li&gt;&#xA;&lt;li&gt;The wall will never be placed in a cell that does not have a route to the target.&lt;/li&gt;&#xA;&lt;li&gt;Of the possible positions for the wall to be placed, one will be chosen uniformly pseudorandomly.&lt;/li&gt;&#xA;&lt;li&gt;The probability of a wall being placed each turn is 1/7.&lt;/li&gt;&#xA;&lt;li&gt;The wall will be placed such that every player still has a route to the target (this includes never placing a wall on the target).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Note that a player having a route to the target means that there exists a path that does not include a wall. If another player blocks the path it still counts as a path.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Movement rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A player can move to any of the 4 orthogonally adjacent cells (or stay still).&lt;/li&gt;&#xA;&lt;li&gt;A player cannot share a cell with another player.&lt;/li&gt;&#xA;&lt;li&gt;A player cannot move onto a wall.&lt;/li&gt;&#xA;&lt;li&gt;A player &lt;em&gt;can&lt;/em&gt; move onto the target, but will have no way of knowing that this has happened.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Starting position&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;At the start of the game the arena will have no walls and the players will be randomly positioned with the guarantee that there are no other players within each player's 5 by 5 neighbourhood.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Winning&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Play will continue until no wall can be placed for 10 consecutive attempts (note that attempts only occur with probability 1/7 each turn so this will take more than 10 turns). When play stops the player closest to the target (by Manhattan distance) is the winner. Although this makes it possible to have an arbitrary number of joint winners, the density of walls by this point makes it unlikely there will be many, and in most cases there will be a player on the target cell, meaning only a single winner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each of the (one or several) joint winners scores one point. Games will be played until one player is the clear winner, or until it is clear there should be joint winners overall.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Input and output&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;During an N player game the input will be a space separated string of N+1 integers received on STDIN:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The player's position (an integer).&lt;/li&gt;&#xA;&lt;li&gt;The position of any wall added since the player's last turn (an integer).&lt;/li&gt;&#xA;&lt;li&gt;The position of every enemy player (N-1 integers).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Positions will be single integers from 0 to 1023, representing the distance in English reading order from the top left cell.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For a 4 by 4 arena this would give the following numbering:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 0  1  2  3&#xA; 4  5  6  7&#xA; 8  9 10 11&#xA;12 13 14 15&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If no wall was added the wall location will be 1024.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;During a particular game the order of enemy players will be consistent - the nth location will always refer to the same enemy player.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The player must send an integer from 0 to 4 to STDOUT representing a move in English reading order:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  0&#xA;1 2 3&#xA;  4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(2 being no move).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A move to an unoccupied cell will not necessarily succeed - it will fail if another player is also trying to move to the same cell.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A move to an occupied cell will not necessarily fail - it will succeed if that player is also moving away from that cell (provided that player succeeds in moving away from that cell, and no other player is also trying to move to that cell).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This means two players can swap cells if they both decide to on the same turn.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A player taking longer than 50 milliseconds to respond will not move.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If someone can demonstrate that there can exist no better strategy than moving uniformly randomly, then I will not post this challenge. I'm hoping that the knowledge of the rules behind wall placement and the ability to block the movement of other players will make probability estimating competitive strategies non-trivial. &lt;strong&gt;&lt;em&gt;This is answered - Nathan Merrill's strategy of moving to the reachable cell whose maximum distance to any other reachable cell is the shortest will beat the strategy of moving uniformly randomly (although in a crowded arena I don't believe this will be the&lt;/em&gt; best &lt;em&gt;strategy so I still consider the question worth posting&lt;/em&gt;&lt;/strong&gt;).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Should this be tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/probability-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;probability-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;probability-theory&lt;/a&gt;? I am expecting answers to make use of probability theory, but I can't know in advance what all the strategies will be. Is this close enough to use the tag?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I'm aiming for this to be a language agnostic challenge communicating with STDIN/STDOUT. Is there a language that is overdue to have its own language specific KotH contest, but that would still allow most users to participate? If not, I'll stick with language agnostic and include at least one example answer so that the processing of STDIN and STDOUT is provided in at least one language.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Method for deciding which attempted moves succeed. Is there any problem with this: Make a list of every intended destination (including own current cell for non-movers). For any destination that appears more than once, make all players aiming for that destination aim for their own current cell instead. Repeat (as this may have created more clashes) until no change is made. Move all the players to the resulting destination. Guaranteed to finish in N steps per turn for an N player game (worst case being a chain of players each moving to the next player's current cell, with the last player in the chain attempting to move onto a wall).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Pseudo random number source: Does anyone have a preferred/recommended random number generator? Is there any reason to consider a true random number source?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Alternative adversarial 2 player version:&lt;/em&gt;&lt;/strong&gt; One player is the target, and the other player is seeking the target. Each player can move one square orthogonally or stay still. Walls are added as in the multiplayer game, and the game ends when the seeker moves onto the target's cell. The score of each player is the number of moves the game lasted. Lower score is better for the seeker player, higher score is better for the target player. The target can always see the location of the seeker. The seeker can never see the location of the target. Might also be interesting to allow both players to choose where to place a wall on their turn (in addition to moving). This might open up the possibility of double bluff. Walls would still be prevented from being placed on a cell that doesn't leave a path from seeker to target. Would this be more/less interesting than the multiplayer version? Are they sufficiently distinct to post as separate challenges, or should one be chosen as the one to be posted? Would this adversarial version work best as two KotHs that use each other's answers to judge their own answers (like a cops and robbers challenge) or should all the seeker answers and target answers be posted to one challenge? Alternatively each answer could be required to deal with being either a seeker or a target, but I like the idea of people being able to specialise and build just one or other, without being obliged to write both.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2018-01-28T15:10:28.193" LastActivityDate="2018-01-28T15:10:28.193" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="5456" PostTypeId="1" CreationDate="2015-06-20T18:32:23.930" Score="8" ViewCount="127" Body="&lt;p&gt;It always was, and I'm assuming it has just dropped off, so this is just to draw attention to that...&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2015-06-20T19:17:45.127" Title="Should the Sandbox be a featured meta post?" Tags="|discussion|sandbox|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5457" PostTypeId="2" ParentId="5456" CreationDate="2015-06-20T19:17:45.127" Score="12" Body="&lt;p&gt;As Dennis said, there's a cron job that runs every Saturday and removes the &lt;a href=&quot;/questions/tagged/featured&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;featured&amp;#39;&quot; rel=&quot;tag&quot;&gt;featured&lt;/a&gt; if it's been used for a month. If you notice this, just flag the sandbox question with a custom flag or let us mods know in the Nineteenth Byte so we can add it again.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-06-20T19:17:45.127" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5458" PostTypeId="2" ParentId="2140" CreationDate="2015-06-20T20:50:47.830" Score="1" Body="&lt;h1&gt;Black and White Morphing&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given two black and white images, the goal is creating a animated black and white gif that transforms one image into the other and back.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The catch is, that for all frames the number of black pixels (as well as the number of white pixels, obviously) stays the same. You can assume that the two input images have the exact same size and the exact same number of black pixels.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;&lt;em&gt;Discussion&lt;/em&gt;&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;@PeterTaylor suggested making the restrictions that from one frame to the next you can only swap adjecent pixels. Otherwise this challenge would be almost the same as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/33172/american-gothic-in-the-palette-of-mona-lisa-rearrange-the-pixels&quot;&gt;this one&lt;/a&gt;, so we need a further restriction.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;My goal is enforcing a 'slow' transition that can produce nice effects. One way of picturing that was considering the white pixels as fluid or sand that has to be rearranged step by step into the other image.&lt;/em&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;@trichoplax suggested making the limit that e.g. only 5% of the pixels may change in each transition.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is a first series of test cases, all 320x386px and 33844 white pixels.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/zZhUW.png&quot; alt=&quot;enter image description here&quot;&gt; &lt;img src=&quot;https://i.stack.imgur.com/pN47u.png&quot; alt=&quot;enter image description here&quot;&gt; &lt;img src=&quot;https://i.stack.imgur.com/sNOBR.png&quot; alt=&quot;enter image description here&quot;&gt; &lt;img src=&quot;https://i.stack.imgur.com/JqWV9.png&quot; alt=&quot;enter image description here&quot;&gt; &lt;img src=&quot;https://i.stack.imgur.com/0zrOB.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.863" LastActivityDate="2015-06-21T10:12:23.940" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="5461" PostTypeId="2" ParentId="2140" CreationDate="2015-06-22T13:52:12.667" Score="3" Body="&lt;h1&gt;Multiples - a wrap battle&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Overview&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Change cells in multiples to wipe out your opponent, while avoiding being wiped out yourself.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is a 2 player game, played on a linear string of cells of length L that wrap in a loop. Counting along the loop eventually brings you back to where you started (after L steps). L will be fixed across all battles, and will be a reasonably large prime.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each cell is controlled by player 1, player 2, or is neutral. These will be indicated as 1, 2 and 0 respectively.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Starting position&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Player 2 starts with a cell at position 0 (since all are equivalent).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Player 1 starts with a randomly chosen cell from 1 to floor(L/2).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Player 1 moves first, reflecting the fact that player 1 has further to go to catch player 2.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Taking a turn&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each player begins with a stockpile of 0, and at the start of each turn the player's stockpile is increased by the number of cells that they currently control. The player then takes their turn. They choose any cell they control and specify a number N, which can be any non-negative integer up to and including the size of the stockpile. The stockpile is reduced by this number, and N loop cells are affected as follows:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Starting with the chosen cell as cell 0, each of the cells N, 2N, 3N, ... N*N are changed. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Choosing 0 means nothing happens, at zero cost.&lt;/li&gt;&#xA;&lt;li&gt;Choosing 1 means the cell immediately after the chosen cell is changed, at a cost of 1.&lt;/li&gt;&#xA;&lt;li&gt;Choosing 2 means the cell 2 cells on and the cell 4 cells on are changed, at a cost of 2.&lt;/li&gt;&#xA;&lt;li&gt;Choosing 3 means the cells 3, 6 and 9 cells on are changed, at a cost of 3.&lt;/li&gt;&#xA;&lt;li&gt;In general, choosing N changes N cells at a cost of N.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;When a cell is changed it follows the following rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A neutral cell becomes the player's.&lt;/li&gt;&#xA;&lt;li&gt;An enemy cell becomes neutral.&lt;/li&gt;&#xA;&lt;li&gt;A cell already owned by the player becomes the enemy's&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Large N&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I expect most moves will choose N considerably smaller, but saving up would allow choosing N considerably larger than L in theory.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Choosing N=L means that all of the changed cells will be the same - the chosen cell, and it will be changed L times.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Choosing N=L-1 means that the L-1 consecutive cells before the chosen cell will all be changed (that is, every cell except the chosen one will be changed).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Winning&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If a move leaves no enemy cells remaining, that player wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After 1000 moves any player who has more cells than their enemy at the start of 2 consecutive turns in a row (one theirs, one their enemy's, in either order) wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After 2000 moves the game is a draw (tie).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Input and output&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;At the start of a game the player's code will be called with a command line argument of 1 or 2 indicating which player they are (player 1 moves first and is represented by 1s in the loop string).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each turn the player will be supplied with:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A string of 0s, 1s and 2s representing the loop.&lt;/li&gt;&#xA;&lt;li&gt;An integer S representing the size of their stockpile.&lt;/li&gt;&#xA;&lt;li&gt;An integer R representing the size of their opponent's stockpile.&lt;/li&gt;&#xA;&lt;li&gt;An integer representing the number of turns taken so far (this will always be an even number for player 1).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The player should output 2 integers:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The cell C to play from, in the range 0 &amp;lt;= C &amp;lt; L.&lt;/li&gt;&#xA;&lt;li&gt;The number of cells to change N, in the range 0 &amp;lt;= N &amp;lt;= S (their current stockpile size).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;I like the idea of this being a 1 dimensional game, but I can also see it working on a 2d grid, where each move is applied both horizontally and vertically (either on a square L by L, or with 2 distinct large primes as side lengths). Does anyone have anything for or against either 1d or 2d?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Any recommendations on what input to provide? I was thinking at least the values of all the cells, but would a history also be good, or better to make the players decide what history to track for themselves rather than providing it? Alternatively they could be memoryless and decide purely based on the current cell formation.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is the random starting position a good idea? Would it be better to fix the starting position at floor(L/2), ensuring this number is prime, and let the players taking turns to be player 1 balance out any bias?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2015-07-26T22:06:42.123" LastActivityDate="2015-07-26T22:06:42.123" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5462" PostTypeId="2" ParentId="2140" CreationDate="2015-06-22T17:50:15.780" Score="2" Body="&lt;h1&gt;Merging Words&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/strings&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;strings&amp;#39;&quot; rel=&quot;tag&quot;&gt;strings&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/substrings&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;substrings&amp;#39;&quot; rel=&quot;tag&quot;&gt;substrings&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Two strings, and two numbers: &lt;code&gt;&quot;hlwl&quot;, &quot;elo_ord!&quot;, 1 2&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These may be function parameters, STDIN or language equivalents.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The second string merged into the first string. The numbers specify how many characters to add when merging.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is what happens:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;h  l  w  l        //notice there is only 1 char per group (first number)&#xA; el o_ or d!      //2 chars per group here (second number)&#xA;-------------&#xA;hello_world!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;More formal-ish procedure:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;start with the first string&lt;/li&gt;&#xA;&lt;li&gt;Remove the first &lt;code&gt;n&lt;/code&gt; chars from the first string and append it to &lt;code&gt;r&lt;/code&gt;, where &lt;code&gt;n&lt;/code&gt; is the first numerical input and &lt;code&gt;r&lt;/code&gt; is the output string&lt;/li&gt;&#xA;&lt;li&gt;Remove the first &lt;code&gt;k&lt;/code&gt; chars from the second string and append it to &lt;code&gt;r&lt;/code&gt;, where &lt;code&gt;k&lt;/code&gt; is the second numerical input&lt;/li&gt;&#xA;&lt;li&gt;Repeat the last 2 steps until both the first and the second string are empty. You may assume that &lt;code&gt;first_string.length / second_string.length == n / k&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input: aaaa bbbb 1 1&#xA;output: abababab&#xA;&#xA;input: abcd iiiiiiii 1 2&#xA;output: aiibiiciidii&#xA;&#xA;input: chmeeo aln 2 1&#xA;output: chameleon&#xA;&#xA;input: emblem ezzent 3 3&#xA;output: embezzlement&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, so shortest code wins!&lt;/p&gt;&#xA;" OwnerUserId="29820" LastEditorUserId="29820" LastEditDate="2015-06-23T11:21:04.360" LastActivityDate="2015-06-23T11:21:04.360" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5465" PostTypeId="1" CreationDate="2015-06-22T21:19:39.523" Score="8" ViewCount="295" Body="&lt;p&gt;How does the community feel about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/52024/best-place-for-learning-golfscript&quot;&gt;questions like this&lt;/a&gt; that aren't tips on golfing, but are still about a golfing language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should such questions be incorporated into what's on topic here? Would this be useful to our site?&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-06-30T03:17:15.130" Title="Tips on learning, rather than golfing, a golfing language" Tags="|discussion|" AnswerCount="4" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="5466" PostTypeId="2" ParentId="5465" CreationDate="2015-06-22T21:21:33.567" Score="5" Body="&lt;p&gt;Should such questions be incorporated into what's on topic here? Yes&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would this be useful to our site? &lt;strong&gt;YES&lt;/strong&gt; a lot&lt;/p&gt;&#xA;" OwnerUserId="21348" LastActivityDate="2015-06-22T21:21:33.567" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5467" PostTypeId="2" ParentId="5465" CreationDate="2015-06-22T21:23:31.763" Score="-4" Body="&lt;h3&gt;Yes, questions about how to pick up a golfing language should be on topic.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;They should have a new tag instead of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; which should be reserved for golfing tips rather than learning tips. As Alex A points out, questions still need to be specific, so they would need to be along the lines of &quot;What does this command do in GolfLangX?&quot; or &quot;How can I perform CommonFunctionQ in this golfing language?&quot;, rather than just &quot;How do I learn Golfify_Y?&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Depending on the outcome of this question we may need another meta question about what to call the new tag (and whether to make the existing tips tag more specific).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Since Doorknob commented with a link to the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot;&gt;tips tag wiki&lt;/a&gt; I can see that tips questions can be about programming challenges in general, not just tips on golfing, so we might not need a new tag if we decide to allow tips on using a language. However, note that the tag wiki excerpt (linked above) and the full tag wiki that is linked from it, do not agree on this.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-06-22T21:49:00.873" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="5468" PostTypeId="2" ParentId="5465" CreationDate="2015-06-22T21:23:54.457" Score="5" Body="&lt;h1&gt;No, such questions should be closed as off topic&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;On Stack Overflow, any question asking to be pointed to outside resources like tutorials is considered off topic. If such a question were on topic, it would be too broad and/or opinion based.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2015-06-22T21:23:54.457" CommentCount="8" CommunityOwnedDate="2015-06-22T21:23:54.457" ContentLicense="CC BY-SA 3.0" />
  <row Id="5469" PostTypeId="2" ParentId="2140" CreationDate="2015-06-22T23:45:59.970" Score="0" Body="&lt;h1&gt;One transparent colour sprite&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Overview&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;This challenge will only involve a hex string as input and a hex string as output, but will be explained in terms of computer graphics.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Given a fixed size background image, a smaller fixed size sprite image and its location, place the sprite on the background image allowing the background to show through for one specified colour of the sprite image.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Details&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The background image will always be 32 by 18 pixels.&lt;/li&gt;&#xA;&lt;li&gt;The sprite image will always be 8 by 8 pixels.&lt;/li&gt;&#xA;&lt;li&gt;The colours will always be in the range 0 to 3 inclusive.&lt;/li&gt;&#xA;&lt;li&gt;There will always be exactly one transparent colour, from 0 to 3 inclusive.&lt;/li&gt;&#xA;&lt;li&gt;The location (x, y) of the sprite may be outside or partially outside the background image.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Since all inputs will always be the same size, there will be no separators, just a single string of hex digits.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To avoid having to define negative inputs, the top left pixel of the background image will be (128, 128), increasing left and down, and x and y will be defined by 2 hex digits each, giving a range of 0 to 255.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input hex string will be made up of:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Background pixels, 2 per hex digit, a string of 32 * 18 * 0.5 = 288&lt;/li&gt;&#xA;&lt;li&gt;Sprite pixels, 2 per hex digit, a string of 8 * 8 * 0.5 = 32&lt;/li&gt;&#xA;&lt;li&gt;Transparent colour, a single hex digit (the most significant half of the hex digit is unused)&lt;/li&gt;&#xA;&lt;li&gt;Sprite x and y, 2 hex digits each, a string of 2 * 2 = 4&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The input will therefore be a string of 288 + 32 + 1 + 4 = 325 hex digits with no separators.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The output is the finished 32 by 18 pixel image, as a string of 288 hex digits with no separators.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Format&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Pixel order&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each image is ordered in English reading order, left to right then top to bottom. That is, the pixels are listed in rows. The first pixel listed will be the top left. This applies to both the background image and the sprite image.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Colour encoding&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Pixel colours are encoded 2 per hex digit, most significant first.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the hex digit B corresponds to binary 1011. This means the first pixel has value 10 = 2 and the second pixel has value 11 = 3.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Transparent colour&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Since the single transparent colour is encoded in one hex digit, which normally holds 2 colours, the first 2 bits (most significant) are ignored and the last 2 bits (least significant) are used to represent the transparent colour.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the hex digit D corresponds to binary 1101. The 11 is ignored and the 01 is used to indicate colour 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although the first two binary digits are always ignored, you may not assume they are always 00. They may take any value and all hex inputs of the correct length should produce a valid output.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Coordinates&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;x and y are encoded as 2 hex digits each, most significant first.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the hex string 2A corresponds to binary 00101010, and decimal 42&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Case sensitivity&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your code may accept input as either upper case or lower case hex digits, or both. If it only accepts one or the other case, it must also output in the same case.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may not choose an arbitrary 16 characters to represent hexadecimal. You must use either (or both) of the following as input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0123456789abcdef&#xA;&#xA;0123456789ABCDEF&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You must choose one or other (&lt;em&gt;not&lt;/em&gt; both/mixed) to use as output. That is, you may accept inconsistent inputs if you wish to, but the output must be either always lower case or always upper case.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox thoughts&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'm considering adding example inputs and outputs and maybe a snippet to verify the output of arbitrary inputs for testing.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2015-07-26T21:49:49.630" LastActivityDate="2015-07-26T21:49:49.630" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5470" PostTypeId="2" ParentId="2140" CreationDate="2015-06-23T05:29:40.967" Score="0" Body="&lt;h1&gt;Build a Rorschach Generator&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;2 possible challenges:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;1.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Help a &lt;a href=&quot;https://gamedev.stackexchange.com/q/102779/66398&quot;&gt;poor struggling game dev&lt;/a&gt; write some code to quickly and efficiently generate a Rorschach inkblot.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using your language of choice, generate a Rorschach inkblot. You may use any method of generating a random seed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The generated image must be in black and white and reflect down the middle of the image. This is a code golf so the shortest submission will win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;OR&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;2.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Help a &lt;a href=&quot;https://gamedev.stackexchange.com/q/102779/66398&quot;&gt;poor struggling game dev&lt;/a&gt; write some code to quickly and efficiently generate a Rorschach inkblot.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given 2 input images (a source image and an image of a &lt;em&gt;template&lt;/em&gt; inkblot), convert the first into the Rorschach inkblot of the second without changing the colours of the image.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may assume that the images are the same size, however you may not display the original image unaltered. Anywhere in the template where the RGB values of the pixel are (255,255,255), you may not display the original image. The produced image must be vertically mirrored, so you will have 2 copies of the source image distorted and reflected in the result.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Then I'd provide source images some of which would probably be shamelessly stolen from either the &lt;a href=&quot;https://codegolf.stackexchange.com/q/50299/16043&quot;&gt;Voroni Map&lt;/a&gt; or the &lt;a href=&quot;https://codegolf.stackexchange.com/q/33172/16043&quot;&gt;Mona Lisa Colour Palette&lt;/a&gt; questions because those questions are awesome.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;My thoughts&lt;/em&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm essentially hoping to get the source image in a twisted demented fragmented form, similar to if you gave a small child red cordial then the source image and a blur tool and said go nuts. I feel like my second challenge has potential, but I feel like I need to improve the challenge description and detail exactly what I want to be produced, but I'm not sure how to do that without a wall of text and without unnecessarily restricting the challenge.&lt;/p&gt;&#xA;" OwnerUserId="16043" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.863" LastActivityDate="2015-06-23T05:29:40.967" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5471" PostTypeId="1" CreationDate="2015-06-23T21:36:17.943" Score="5" ViewCount="161" Body="&lt;p&gt;I mentioned this in chat a bit ago, and got somewhat varied feedback. I thought I'd go ahead and ask a meta question to gauge the community's overall thoughts. As a &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/22314903#22314903&quot;&gt;few&lt;/a&gt; people have &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/22280726#22280726&quot;&gt;noted&lt;/a&gt;, our &lt;a href=&quot;http://area51.stackexchange.com/proposals/4570/code-golf-programming-puzzles&quot;&gt;questions per day&lt;/a&gt; stat has dropped rather dramatically over the past few weeks. How do we feel about a weekly community competition to write challenges? Since most challenges are posted shortly after the weekend anyway, we could tally votes for every challenge every Sunday (or something) and reward the best poster with bounties of some kind. That way, we could encourage more good questions, right?&lt;/p&gt;&#xA;&lt;h1&gt;Benefits&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;With some incentive to write &lt;strong&gt;high-quality&lt;/strong&gt; questions, we'll get more interesting challenges and draw more traffic to our community.&lt;/li&gt;&#xA;&lt;li&gt;More people will write challenges, so we may get more diverse challenges as a byproduct of this.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Issues&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How are the best challenges rewarded?&lt;/li&gt;&#xA;&lt;li&gt;How and when are votes tallied?&lt;/li&gt;&#xA;&lt;li&gt;How would we organize such a competition and keep it alive?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If you think a weekly challenge-writing competition would be beneficial, answer with suggestions for how we could accomplish such a thing!&lt;/p&gt;&#xA;&lt;p&gt;If you think a weekly challenge-writing competition would be a massive waste of time and effort, answer with your reasoning!&lt;/p&gt;&#xA;" OwnerUserId="31054" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-27T02:20:23.273" Title="A Weekly Challenge Competition" Tags="|discussion|challenges|challenge-quality|" AnswerCount="1" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="5472" PostTypeId="2" ParentId="2140" CreationDate="2015-06-24T00:34:42.677" Score="0" Body="&lt;h1&gt;[Insert] Nerd Sniping Pattern (Series)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Having learned from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/51972/prime-nerd-sniping-pattern&quot;&gt;Prime Nerd Sniping Pattern&lt;/a&gt; that hoping an optimal solution will not be spotted too quickly is not a good idea, I'd like to judge how much interest there is in a series of similar contests that have been demonstrated to not have an achievable optimal solution, allowing long term open ended competition.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each one would need work to demonstrate this lack of an achievable optimal solution, and I'll put that work in if there is suffficient interest here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, there could be a Fibonacci Nerd Sniping Pattern, Factorial Nerd Sniping Pattern, and so on. Each one would need to have a different method of defining the scoring pattern, so that different optimisation techniques and algorithms would be required for each one. This is what would ensure they are distinguished from each other as separate challenges in a series, rather than near duplicates.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;What I've learned from my mistake with the primes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The prime scoring pattern had a checkerboard optimal solution because all of the scoring pixels were on opposite coloured checkerboard squares to the pixel being scored. I need to avoid this in any future scoring patterns, and more generally avoid any pattern that divides the image into two regions for scoring (where all of one region are scored by combinations of pixels from the other). Intuitively, there should be plenty of mixing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As I think about it more, I'll add ideas here on things to rule out and things to ensure I have before considering a pattern scoring rule ready for posting.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.863" LastActivityDate="2015-06-24T00:34:42.677" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5475" PostTypeId="2" ParentId="2140" CreationDate="2015-06-24T04:16:08.363" Score="0" Body="&lt;h1&gt;Build a Mahjong AI&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Mahjong is a traditional Chinese gambling game played throughout Asia in which four players draw and discard tiles in order to try to complete a hand of 14 tiles.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/39896/what-are-you-waiting-for-a-mahjong-solver&quot;&gt;this problem&lt;/a&gt;, a specification for a simplified version of Mahjong called &quot;PPCG Mahjong&quot; was given. Your task in this problem is to build a program that will play a version defined here called &quot;Full PPCG Mahjong&quot; (hereafter known as the FPM rules).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program will be an &lt;em&gt;online program&lt;/em&gt;, taking input as it plays the game. (that does not necessarily mean it needs networking capabilities, but it means that it will output in reaction to ongoing input, not just all input at once.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Tiles&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are 34 types of tiles in FPM.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The “bǐng”/“pin” (餅) tiles, also known as the circle tiles / dot tiles. These will be represented in text with a number from &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;9&lt;/code&gt; and then the letter &lt;code&gt;b&lt;/code&gt;, as in &lt;code&gt;1b&lt;/code&gt;, &lt;code&gt;2b&lt;/code&gt;, up to &lt;code&gt;9b&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The “suǒ”/“sou” (索) tiles, also known as the bamboo tiles. These will be  represented in text with a number from &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;9&lt;/code&gt; and then the letter &lt;code&gt;s&lt;/code&gt;, as in &lt;code&gt;1s&lt;/code&gt;, &lt;code&gt;2s&lt;/code&gt;, up to &lt;code&gt;9s&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The “wàn”/“man” (萬) tiles, also known as the character tiles. These will be represented in text with a number from &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;9&lt;/code&gt; and then the letter &lt;code&gt;w&lt;/code&gt;, as in &lt;code&gt;1w&lt;/code&gt;, &lt;code&gt;2w&lt;/code&gt;, up to &lt;code&gt;9w&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The three tile types totalling 27 tiles above are called the &lt;em&gt;number tiles&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ol start=&quot;4&quot;&gt;&#xA;&lt;li&gt;&lt;p&gt;The “fēng”/”fuu” (風) tiles, also known as the wind tiles. There is one wind tile for each cardinal direction. These will be represented in text with the letter of the wind's cardinal direction in capitals, repeated twice, as in: &lt;code&gt;EE&lt;/code&gt;, &lt;code&gt;SS&lt;/code&gt;, &lt;code&gt;WW&lt;/code&gt;, or &lt;code&gt;NN&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The “yuán”/“gen” (元) tiles, also known as the dragon tiles. There is one red, one green, and one white dragon, represented as &lt;code&gt;ZZ&lt;/code&gt; (for &lt;em&gt;zhōng&lt;/em&gt; 中/center), &lt;code&gt;FF&lt;/code&gt; (for &lt;em&gt;fā&lt;/em&gt; 發/fortune), and &lt;code&gt;BB&lt;/code&gt; (for &lt;em&gt;bái&lt;/em&gt; 白/white) respectively.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The two tile types above are called the &lt;em&gt;honour tiles&lt;/em&gt;. There are four of each type of tile, for a total of 136 tiles.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The goal of Mahjong is to form a complete hand, which consists of four sets and a pair.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A set is one of:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A &lt;em&gt;sequence&lt;/em&gt; of number tiles. (e.g. &lt;code&gt;5w 6w 7w&lt;/code&gt; or &lt;code&gt;3s 4s 5s&lt;/code&gt;)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A &lt;em&gt;triplet&lt;/em&gt; of any tile (number or honour tile). (e.g. &lt;code&gt;3b 3b 3b&lt;/code&gt; or &lt;code&gt;EE EE EE&lt;/code&gt;)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A &lt;em&gt;quadruplet&lt;/em&gt; of any tile. (e.g. &lt;code&gt;3b 3b 3b 3b&lt;/code&gt; or &lt;code&gt;EE EE EE EE&lt;/code&gt;)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;A complete hand will have 14 tiles if there are no quadruplets present; each quadruplet adds one tile to the hand's size, up to a possible 18.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Gameplay&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Mahjong is a game played in several &lt;em&gt;hands&lt;/em&gt; (局, &lt;em&gt;jú&lt;/em&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the beginning of each hand, each player receives a text input of &lt;code&gt;START [Wind] [Round number]&lt;/code&gt;. Each player is then given an input of 13 tiles, represented as a set of 13 space-separated strings (e.g. &lt;code&gt;1b 9s BB 3w 6w 4b ZZ 3w 5w 2s 6b NN NN&lt;/code&gt;) and assigned a different &lt;em&gt;seat wind&lt;/em&gt; depending on where they &quot;sit&quot; at the virtual table (given as a single letter out of &lt;code&gt;NESW&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Starting with the player at position East and moving clockwise around the compass, each player takes a &lt;em&gt;turn&lt;/em&gt; in which:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The player whose turn it is will be given a tile (自摸牌, &lt;em&gt;zìmōpái&lt;/em&gt;) from the &quot;wall&quot; (the collection of tiles that have not been drawn or dealt yet) as a two-character input.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The player can take actions during the standby phase:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If the player has four of the same tile in his hand, it can call &lt;em&gt;kong&lt;/em&gt; (槓, &lt;em&gt;gàng&lt;/em&gt;) and draw an extra tile. Those tiles must stay as a quadruplet from then on and cannot be used for anything else. The program does this by outputting &lt;code&gt;kong [quadruplet tile]&lt;/code&gt; as text.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the player previously called pung on a triplet and has a fourth of the tile, it can call &lt;em&gt;kong&lt;/em&gt; as well.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the player's hand is complete with this drawn tile, it may declare &lt;em&gt;hu&lt;/em&gt; in which case the hand ends.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The player will then produce an output of whatever tile it decides to discard. The tile that was discarded will be propagated as output to the other players in the form &lt;code&gt;[seat] [discarded tile]&lt;/code&gt; (e.g. &lt;code&gt;E 8w&lt;/code&gt;). The players can then &lt;em&gt;call&lt;/em&gt; that tile if it will complete a set:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The player immediately after the discarding player may call &lt;em&gt;chi&lt;/em&gt; (吃, &lt;em&gt;chī&lt;/em&gt;) by outputting &lt;code&gt;chi&lt;/code&gt; as text during the call phase, to complete a sequence.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Any other player can call &lt;em&gt;pung&lt;/em&gt; (碰, &lt;em&gt;pèng&lt;/em&gt;) to complete a triplet, similarly by outputting &lt;code&gt;pung&lt;/code&gt; as text. Pung overrides chi when it happens.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Any player can also call &lt;em&gt;kong&lt;/em&gt; (槓, &lt;em&gt;gàng&lt;/em&gt;) to complete a quadruplet,  also by outputting text, in which case they are given an extra tile as text input.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Any player can also call &lt;em&gt;hu&lt;/em&gt; (胡, &lt;em&gt;hú&lt;/em&gt;) to complete their hand regardless of whether they are completing a sequence, triplet, or pair. Hu overrides both pung/kong and chi.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If a player does not want to call tiles, it must output &lt;code&gt;pass&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The turn immediately goes to the player who called the tile, and they skip their draw phase, discarding another tile immediately. If nobody called a tile, the next player draws one. At any point if a player calls, the other three players will receive an input indicating that the player in that seat made a call and what was called.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;For chi, the input will be in the form of &lt;code&gt;[seat] chi [other two tiles]&lt;/code&gt; (e.g. &lt;code&gt;S chi 6w 7w&lt;/code&gt;).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For pung and kong, the input will be in the form of &lt;code&gt;[seat] pung/kong&lt;/code&gt;. This is because all the tiles are identical to the called tile anyway.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For hu, the input will be in the form of &lt;code&gt;[seat] hu [all other tiles in hand]&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In the above three cases, the tile being called is always the previously discarded tile.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;For a kong during the standby phase, the input will be in the form of &lt;code&gt;[seat] kong [kong tile]&lt;/code&gt;, because the kong tile is not implied to be the previously discarded tile.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For a hu during the standby phase, the input will be in the form of &lt;code&gt;[seat] hu [tile drawn]&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Once a tile is called, the set that it makes is locked in place and cannot change for the rest of the hand. So if two tiles would make use of a tile in a called set, they may not use that tile.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A hand ends when either somebody calls &lt;em&gt;hu&lt;/em&gt; validly or there are no more tiles to draw. (There is no dead wall in this game.) At that point, all players will receive an input of &lt;code&gt;END&lt;/code&gt; to signal that the round has ended, and a summary of their points.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If somebody other than the dealer won, then the deal rotates. If the dealer or nobody won, then the deal stays the same. After four deal rotations, the prevailing wind also rotates.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A game of FPM consists of 16 such deal-rotations (rounds), such that each player gets to play one round with each combination of seat wind and table wind. Each player starts with a bank of 500 points. At the end of 16 rounds, the player with the most points is the winner of the game.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example gameplay interaction&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; START HAND EAST 1&#xA;&amp;gt; 1b 4b 6b 2s 9s 3w 3w 5w 6w NN NN ZZ BB&#xA;&amp;gt; E       // The player is East (dealer)&#xA;&amp;gt; NN      // East drew the north-wind first.&#xA;BB        // East decides to discard the white-dragon.&#xA;&amp;gt; S 3w    // Nobody called it, and South discards a 3-character.&#xA;pung      // East wants to pung the 3w tile.&#xA;ZZ        // East discards the red-dragon&#xA;&amp;gt; S pung  // South pungs the red-dragon.&#xA;&amp;gt; S 6w    // South discards a 6-character instead.&#xA;pass      // East has no use for this tile, so it passes.&#xA;&amp;gt; W kong 2s    // West declares a standby kong on 2-bamboo.&#xA;&amp;gt; W 3b    // West discards a 3-circle.&#xA;pass      // East passes again.&#xA;&amp;gt; N chi 2b 4b  // North chi-s it with a 2b and 4b.&#xA;&amp;gt; N 7s    // North discards a 7-bamboo.&#xA;pass&#xA;&amp;gt; 2w      // East's hand: 1b 4b 6b 2s 9s 2w 5w 6w NN NN NN -- 3w 3w 3w&#xA;2w        // East doesn't need the 2w, so he discards it.&#xA;&amp;gt; S hu 2b 3b 4b 7s 8s 9s 2w 6w 7w 8w ZZ ZZ ZZ &#xA;          // South wins on that tile. The 2w completed his pair.&#xA;&amp;gt; END&#xA;&amp;gt; 496 506 499 499  // Their current point counts. South's hand was worth&#xA;                   // 2 points, so East pays 4 while the others pay 1.&#xA;&amp;gt; START EAST 2&#xA;&amp;gt; [13 more tiles]&#xA;&amp;gt; N       // The deal rotated, and this player is now North.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Brackets&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program can participate in one of three levels of gameplay:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Level 1, where every hand is worth exactly 8 points, and the only thing that matters is completing hands.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Level 2, where every hand is worth the number of points in the points table section below, but any hand can still win.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Level 3, where every hand is worth the number of points in the points table, but a hand must have at least 8 points total with that system to win.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Points&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(TBD)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Penalties&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The following are invalid moves:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Failing to produce an output when required.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Discarding a tile that is not in your hand, or when it is not your turn.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Calling chi on any player other than the one immediately before you, or calling any tile that does not actually complete a set in your hand.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Calling hu when your hand is not complete, or when your hand value does not meet the minimum point requirement in level 3 gameplay.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If your program makes an invalid move, the move will be rejected, your program will pay 20 points to each of the three other players, and for the rest of that round, it will be a &quot;forced tsumogiri&quot; player, which automatically discards every tile it draws and never calls anything.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Special Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are no special rules such as &lt;em&gt;dora&lt;/em&gt; or &lt;em&gt;furiten&lt;/em&gt; in FPM. Any person may complete a hand at any time as long as it is a valid complete hand.&lt;/p&gt;&#xA;" OwnerUserId="7110" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.893" LastActivityDate="2015-06-24T08:09:54.053" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5476" PostTypeId="1" AcceptedAnswerId="5477" CreationDate="2015-06-24T16:46:55.637" Score="22" ViewCount="1064" Body="&lt;p&gt;Some types of challenges require submission that produce constant output and, as such, forbid the solutions from taking input of any kind.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That presents a problem for languages like &lt;strong&gt;sed&lt;/strong&gt;, which execute code for each line of input, so they downright refuse to do anything if STDIN is empty.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On one hand, if we apply the same rules to all languages, &lt;strong&gt;sed&lt;/strong&gt; simply won't be allowed to compete. On the other hand, excluding a language altogether seems undesirable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Should a language that &lt;em&gt;requires&lt;/em&gt; input to do anything be allowed to take input, even if all other languages are not?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What should that input be?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What should happen in cases like &lt;a href=&quot;https://codegolf.stackexchange.com/a/52134&quot;&gt;this one&lt;/a&gt;, where an exemption from the rule would simplify the task at hand?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-09-01T15:02:58.333" Title="Are languages like sed exempt from &quot;no input&quot; rules?" Tags="|discussion|policy|answers|" AnswerCount="1" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5477" PostTypeId="2" ParentId="5476" CreationDate="2015-06-24T17:17:24.907" Score="21" Body="&lt;h1&gt;Yes, as long as the exact input for this language is proposed before the question&lt;/h1&gt;&#xA;&lt;p&gt;Because this is basically the same as inventing a dialect of the original language.&lt;/p&gt;&#xA;&lt;p&gt;For sed, I propose an empty line. And the interpreter in bash is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#!/bin/bash&#xA;echo|sed &amp;quot;$@&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Or a more complex one:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#!/bin/bash&#xA;if ! [ -t 0 ] || [ &amp;quot;$(head -c1|tee /dev/fd/3|wc -c)&amp;quot; = 0 ]; then echo; else cat; fi 3&amp;gt;&amp;amp;1|sed &amp;quot;$@&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;I consider these non-standard sed language interpreters, instead of a new language.&lt;/p&gt;&#xA;&lt;p&gt;(If you agree with me, the sed variant doesn't need to be the consensus to be valid. If you don't, you can propose this sed variant again in another answer. So don't vote for the above code.)&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-24T17:37:44.943" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5480" PostTypeId="2" ParentId="2140" CreationDate="2015-06-25T06:50:45.493" Score="1" Body="&lt;h1&gt;Catch the robber&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/java&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;java&amp;#39;&quot; rel=&quot;tag&quot;&gt;java&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;This is my first time making a KOTH. I (mostly) will not post this KoTH. Read the &lt;a href=&quot;https://github.com/Cool-Guy1999/Catch-the-Robber/blob/master/README.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;ReadMe&lt;/a&gt; file for more info.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Overview&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A cop spots a robber and the robber runs and ends up in a basement. The cop then goes into the basement and locks the door.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Gameplay&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The basement consist of 49 rooms with dimensions 7 x 7. The top-left room has coordinates &lt;code&gt;[0,0]&lt;/code&gt; while the bottom-right room has coordinates &lt;code&gt;[6,6]&lt;/code&gt;. The cop starts on the room with coordinates &lt;code&gt;[6,3]&lt;/code&gt; while the robber starts on the room with coordinates &lt;code&gt;[0,3]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Cop&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The cop moves first. The cop can move in one of these directions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Up&lt;/li&gt;&#xA;&lt;li&gt;Right&lt;/li&gt;&#xA;&lt;li&gt;Down&lt;/li&gt;&#xA;&lt;li&gt;Left &lt;/li&gt;&#xA;&lt;li&gt;Here&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The direction &lt;em&gt;here&lt;/em&gt; indicates that the cop will stay in the current room and will not move. The rest of the directions are self-explanatory. The cop can move in a particular direction if it is a valid one, i.e, the cop cannot move out of the grid or move into a room with a trap.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The cop can also put traps in a room. At the start of every match, the cop has 3 traps. Once a trap has been placed, the cop will not be able to move into the room where the trap is placed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The cop also has 3 pressure sensors at the start of every match. The cop can move into a room where a pressure sensor has been placed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the robber moves into an adjacent room of the cop, the cop will be alerted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Robber&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The robber can move in the same directions as the cop does. The robber too cannot move outside the grid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The robber has two TrapDetector5000 which can be used by the robber. It will detect if there is a trap in one of the adjacent rooms that the robber is in.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the cop moves into an adjacent room of the robber, the robber will be alerted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Goal&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The cop must catch the robber as soon as possible. This can be done by moving into a room where the robber is. The cop will also catch the robber if the robber moves into the room where the cop is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the robber moves into a room where the cop has placed a trap or a pressure sensor, the cop will be alerted and the robber will not be able to move for 2 turns, if the room had a trap. However, the robber will be able to move if the room had a pressure sensor.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The robber will be alerted if the robber steps into a room with a pressure sensor.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Controller&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The controller is written in java and can be found &lt;a href=&quot;https://github.com/Cool-Guy1999/Catch-the-Robber&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;. As a cop or a robber you each have to each complete implement a Java class.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You have to implement the &lt;code&gt;Cop&lt;/code&gt; interface if you are writing a Cop Bot and implement the &lt;code&gt;Robber&lt;/code&gt; interface if you are writing a Robber Bot.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is an &lt;code&gt;enum direction&lt;/code&gt; with 5 directions &lt;code&gt;Here, Up, Right, Down, Left&lt;/code&gt; which you can use when building your Bot.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can use the &lt;code&gt;Grid.isValidMove(direction)&lt;/code&gt; to check if that direction is a valid move. This is for Cops.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can use the &lt;code&gt;Grid.isValidPosition(direction)&lt;/code&gt; to check if that direction is a valid move. This is for Robbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You also may write additional functions within that class. The controller comes with one working example of a simple cop and robber bot.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please use java 7 and please do not exploit stuff in the controller and cheat.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that your bot needs to return an &lt;code&gt;int&lt;/code&gt; from &lt;code&gt;takeTurn&lt;/code&gt; within 200 milliseconds. Failure to do so will result in the disqualification of your Bot.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Each cop plays 10 rounds against each robber and the number of moves each robber makes in each round will be added up and this is the score of that particular robber. The same goes for cops.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The robber with the highest score and the cop with the lowest score wins!&lt;/p&gt;&#xA;" OwnerUserId="38214" LastEditorUserId="38214" LastEditDate="2015-07-07T08:47:43.170" LastActivityDate="2015-07-07T08:47:43.170" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5481" PostTypeId="2" ParentId="2140" CreationDate="2015-06-25T10:13:20.883" Score="3" Body="&lt;h2&gt;Group Students Into Pairs&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphs&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphs&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphs&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Synopsis&lt;/strong&gt;: A graph theory matching problem. Given a list of which students like and dislike each other, pair the students up to maximise the overal happiness of the classroom.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you've ever been a teacher before, you've likely encountered the extremely frustrating experience that is getting students to do pair work. More often than not no one is happy with their partner, and the mood of the classroom suffers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge, we're going to solve the enduring problem of pair work in classrooms. Here's how our system will work:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Each student shall write down what students they are happy to work with, and which ones they are &lt;em&gt;not&lt;/em&gt; happy to work with.&lt;/li&gt;&#xA;&lt;li&gt;We will take those lists, and generate student pairs such that the total &lt;em&gt;happiness&lt;/em&gt; of the classroom is at its maximum.&lt;/li&gt;&#xA;&lt;li&gt;The students are now (mostly) happy!&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;So how is the happiness of the classroom calculated? For each student in each pair of students:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a student's partner is in their &quot;happy to work with&quot; list, increase the happiness of the classroom by 1.&lt;/li&gt;&#xA;&lt;li&gt;If a student's partner is in their &quot;not happy to work with&quot; list, decrease the happiness of the classroom by 1.&lt;/li&gt;&#xA;&lt;li&gt;If a student is neutral towards their partner (not in either list), the happiness of the classroom does not change.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Here's a useful table that summarises the possible changes in the happiness with each pair of students:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+-------------------+-------------------+--------------------+&#xA;| Student 1 Feeling | Student 2 Feeling | Happiness Modifier |&#xA;+-------------------+-------------------+--------------------+&#xA;| Happy!            | Happy!            | +2                 |&#xA;| Happy!            | Neutral           | +1                 |&#xA;| Happy!            | Not happy...      | 0                  |&#xA;| Neutral           | Happy!            | +1                 |&#xA;| Neutral           | Neutral           | 0                  |&#xA;| Neutral           | Not happy...      | -1                 |&#xA;| Not happy...      | Happy!            | 0                  |&#xA;| Not happy...      | Neutral           | -1                 |&#xA;| Not happy...      | Not happy...      | -2                 |&#xA;+-------------------+-------------------+--------------------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;First line of input is a positive integer &lt;code&gt;n&lt;/code&gt; indicating the number of students to match up. &lt;code&gt;n&lt;/code&gt; is always even. Following that are &lt;code&gt;n&lt;/code&gt; lines, each line which has the format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;name likes dislikes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;name&lt;/code&gt; is the name of the student (which will only contain characters from &lt;code&gt;[A-Za-z]&lt;/code&gt;), &lt;code&gt;likes&lt;/code&gt; is a comma separated list of people he or she would be happy to work with, and &lt;code&gt;dislikes&lt;/code&gt; is a comma separated list of people he or she would not be happy to work with. For instance:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Clarence Tiger,Anna,Jamal Amelia,James&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This would indicate that Clarence is happy to work with Tiger, Anna, or Jamal; he is not happy to work with Amelia or James; and towards any other student he is neutral.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another line:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Ilya Amelia,Clarence,Anna,Tiger,Jamal _&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This would indicate that Ilya is happy to work with Amelia, Clarence, Anna, Tiger, and Jamal. For dislikes, we've used the special keyword &lt;code&gt;_&lt;/code&gt;, which indicates that Ilya doesn't have anyone he is not happy to work with. Any remaining students Ilya would be neutral towards.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Output space separated comma separated pairs of names, where each name corresponds to a pair of students. The pairs should be such that the happiness of the classroom is maximised. Every student should be in exactly one pair.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example Inputs and Outputs&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Writing reference implementation. This is one of those types of questions where you can't really judge the correct output for an input &quot;by eye&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;This problem is quite difficult compared to typical code-golf fare, requiring two different algorithms to solve the weighted maximum matching problem. Is it too difficult for a code-golf? And if it is, what could make a better winning criterion?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="21682" LastEditDate="2015-10-12T05:40:26.080" LastActivityDate="2015-10-12T05:40:26.080" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5483" PostTypeId="2" ParentId="2140" CreationDate="2015-06-25T14:16:47.707" Score="1" Body="&lt;h1&gt;&lt;em&gt;Half-finished Idea:&lt;/em&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Diffusion Battle&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Overview&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Players are all present on a toroidal grid. Each player has 16 particles to start with. The total number of particles is fixed but they can change colour. Each turn a player decides what type of action to take for each particle of their colour, but cannot control the direction, which is always random.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;All players' particles then move in a random direction at the same time, possibly resulting in some of them changing colour. The player with the most particles of their colour at the end of the game is the winner.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Action types&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A player chooses from the following actions for each particle:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Drift: do not attempt to change the colour of other particles&lt;/li&gt;&#xA;&lt;li&gt;Eat: attempt to change the colour of other particles&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Each of these actions is applied after all players' particles have aimed in a random direction. This may result in two particles aiming for the same cell. No cell will end up with more than one particle, but aiming for the same cell results in interaction, with no movement and the following rules being applied:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If both particles chose Drift, nothing happens.&lt;/li&gt;&#xA;&lt;li&gt;If both particles chose Eat, nothing happens.&lt;/li&gt;&#xA;&lt;li&gt;If one particle chose Eat, the particle that chose Drift will become the colour of the particle that chose Eat.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Clearly choosing Eat is always an advantage when two particles aim for the same destination. However, if a particle aims for a cell that no other particle is aiming for, it will move there, with the following rules being applied:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the particle chose Drift it will move with no change.&lt;/li&gt;&#xA;&lt;li&gt;If the particle chose Eat it will move and take on a random colour (which may be its own colour or that of any other player).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;N particles colliding&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The case where N particles are all aiming for the same destination cell is a generalisation of the case for 2 particles. None of them will move to the destination cell and the following rules will be applied:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If all of the N particles chose Drift, nothing happens.&lt;/li&gt;&#xA;&lt;li&gt;If all of the N particles chose Eat, nothing happens.&lt;/li&gt;&#xA;&lt;li&gt;If some chose Drift and some chose Eat, none will move and all those that chose Drift will change to a colour chosen randomly from those exhibited by those that chose Eat. If there is more than one particle of a given colour that chose Eat, that colour will have a correspondingly higher probability of being chosen.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;When N = 2 this reduces to the case described for 2 particles.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It follows that if the N particles are of the same colour, then regardless of their individual choices none will move and they will all remain the same colour.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Collision with a particle that was unable to move&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;What happens to particles that were aiming for an empty cell but the cell is not empty because its occupant was unable to move?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox thoughts&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;EITHER &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;ALL THOSE THAT AIMED FOR THE SAME CELL AFFECT EACH OTHER&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;OR&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;THOSE THAT AIMED FOR THE SAME CELL DO NOT MOVE, ALL THOSE THAT END UP ADJACENT AFFECT EACH OTHER&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I favour the second but I need to consider how it would work with large numbers of particles adjacent.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Zgarb pointed out in chat that it would be better to have a small probability of changing if failing to eat, so that the penalty for failure is not so extreme. I'm likely to use this as it is fine tunable.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2015-06-25T14:37:20.463" LastActivityDate="2015-06-25T14:37:20.463" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5485" PostTypeId="2" ParentId="2140" CreationDate="2015-06-25T16:30:29.033" Score="0" Body="&lt;h1&gt;Team Gun Battle&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;hr&gt;&#xA;This is an individual competition, where the goal is to be the last player surviving. Fighting always takes place between two teams. At the beginning, every player is randomly assigned to one of two teams and placed randomly on the board.*&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each turn, a player can move north, south, east or west or stay. In addition to moving, they can also shoot a bullet north, south, east, or west. Note that players won't know about other players' movements when they move, but the &lt;code&gt;shoot()&lt;/code&gt; method is called &lt;em&gt;after&lt;/em&gt; all moving has taken place. The player can choose to shoot a light bullet, which travels 4 squares per frame and does 1 damage, or a heavy bullet, which travels 2 squares per frame and does 3 damage. The bullets do move on the same step they were shot in, so if a target is less than 4 units away, you can shoot a light bullet without any chance of the target dodging.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every player has a starting health of 30 and 30 bullets to shoot.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After 1000** or so steps, the round will end. Whichever team has more players alive will be considered the winners. Ties will be broken by whichever team has the highest total health.*** Every player not on the winning team will die, and &lt;em&gt;the winning team will be split up into two new teams.&lt;/em&gt; This means that half of those who were originally on your side are now your enemies. Another 1000 steps are executed and another winning team is chosen. This process repeats until there is only one player left.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This has some interesting strategic consequences. For example, if your team is winning, it is in your interest to start shooting players on your own team because they may not expect it and you will have to fight them eventually. Similarly, you don't want to waste all of your bullets on the first few rounds &lt;s&gt;because your bullets and your health is not replenished after each round.&lt;/s&gt; I like trichoplax's suggestion where ammunition and health could be slightly restored after each round. You want to get your teammates to do as much work as possible before killing them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The controller almost ready. This is the spec:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;public class Player1 extends Player {&#xA;  public Direction move(World w, int stepsLeft) {&#xA;    // stepsLeft = # of steps left in round&#xA;    // List of players: w.getPlayers()&#xA;    // List of bullets: w.getBullets()&#xA;    Player p1 = w.getPlayers().get(0);&#xA;    // Check health: p1.getHealth()&#xA;    // Check # of bullets left: p1.getBullets()&#xA;    // Check team: p1.isOnSameTeam(this)&#xA;    // Check position: p1.getPosition()&#xA;    return Direction.NORTH; // always move north&#xA;  }&#xA;  public Bullet shoot(World w, int stepsLeft) {&#xA;    // similar to above&#xA;    return new Bullet(Direction.NORTH, true); // heavy bullet shot north&#xA;  }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;*I think the board should be a square with side length &lt;code&gt;3*(# of players)&lt;/code&gt;. Hopefully this would make to not too sparsely populated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;**Exact number to be determined. It may be based on the number of players (higher # of players = more steps until the end of the round). 1000 seems like a good number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;*** I'm working on a system that's somewhat more fair. Currently, if there was originally an odd number of players, they were split with one random team getting an extra player. Obviously, that team has a significant advantage under this system. Perhaps it could be percentage of surviving players?&lt;/p&gt;&#xA;" OwnerUserId="23550" LastEditorUserId="23550" LastEditDate="2015-06-26T21:41:16.543" LastActivityDate="2015-06-26T21:41:16.543" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="5486" PostTypeId="1" CreationDate="2015-06-25T19:20:39.993" Score="20" ViewCount="415" Body="&lt;p&gt;A lot of languages have behaviour that is not defined in the official spec, or might lack a spec in the first place. If the behaviour is consistent and even well known, can such behaviour be used despite being stated in the spec? E.g. in JavaScript the order of keys in an object is officially undefined, but &lt;code&gt;Object.keys&lt;/code&gt; and similar functions are perfectly aware of the order in which the keys were defined and will return it in that way as well. (This might have been defined now in the new ES6, but that's not the point now)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;// What I was talking about:&#xA;Object.keys({c:1, d:2, a:8, b:-1 });&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I will refrain from mentioning the specific answer in the discussion, because there is likely something else wrong with the answer and linking to it will get everybody worked up about that other thing rather than discussing this issue on its own. I will link to this meta post in a comment there and I would kindly like to ask everybody else to refrain from linking back to it as well.&lt;/p&gt;&#xA;" OwnerUserId="12130" LastEditorUserId="8478" LastEditDate="2015-06-25T20:57:26.237" LastActivityDate="2015-06-25T20:57:26.237" Title="Is an answer allowed to use undefined, but consistent behaviour?" Tags="|discussion|policy|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5487" PostTypeId="2" ParentId="5486" CreationDate="2015-06-25T20:04:09.003" Score="15" Body="&lt;p&gt;I think that if the behavior is consistent for a commonly available compiler/runtime/interpreter, as you say, then it should be fine. It would be a good idea to include something about it in the post, though. If it works with one particular environment and &lt;em&gt;not&lt;/em&gt; another, that would be good to mention, too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, writing your own interpreter to take advantage of something the language specification calls &quot;undefined&quot; just to win a contest would &lt;em&gt;not&lt;/em&gt; be okay.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2015-06-25T20:04:09.003" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5489" PostTypeId="2" ParentId="546" CreationDate="2015-06-26T19:33:59.973" Score="-1" Body="&lt;p&gt;As of the time of posting this answer, for the purpose of the site rules about only using languages published before a question is asked, I am defining the meta-language &quot;Simple Bit Encoding&quot;, which might be abbreviated &quot;SBE-&quot;. This meta-language can be applied to any other language, so you might write a program in &quot;SBE-Python&quot; or &quot;SBE-Brainfuck&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The meta-language is loosely defined as follows:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a language with a character set representable in N bits, reversibly encode an M-character program in that language as a series of M*N bits. This bitstream is the SBE-[language] program. Executing a SBE-[language] involves decoding the bitstream back to M separate characters, then the resulting string is provided to the original language's compiler or interpreter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By convention, SBE-[language] programs are presented in their decoded format, which conveniently and coincidentally happens to be indistinguishable from the original program in the original language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;SBE-Brainfuck is equivalent to &lt;a href=&quot;https://esolangs.org/wiki/Binaryfuck&quot; rel=&quot;nofollow&quot;&gt;Binaryfuck&lt;/a&gt; without the leading &lt;code&gt;1&lt;/code&gt;. Brainfuck has only 8 non-comment characters, which can be encoded as 3 bits each. A 240-byte Brainfuck program is thus equivalent to a 90-byte SBE-Brainfuck / Binaryfuck program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Python uses 7-bit ASCII for program text (&lt;a href=&quot;https://docs.python.org/2/reference/lexical_analysis.html&quot; rel=&quot;nofollow&quot;&gt;ref&lt;/a&gt;). A 240-byte Python program is equivalent to a 210-byte SBE-Python program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The practical result of this meta-language definition is that any code-golf solution written in a language using a N-bit character set can claim to be a decoded representation of a SBE-[language] program that will be smaller by a factor of (8-N)/8.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;EDIT: SBE-Python converter, written in CJam, thanks to @Dennis:&#xA;&lt;code&gt;q256b128b:c&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="4787" LastEditorUserId="4787" LastEditDate="2015-07-07T17:22:16.243" LastActivityDate="2015-07-07T17:22:16.243" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5490" PostTypeId="2" ParentId="5465" CreationDate="2015-06-27T01:11:42.670" Score="1" Body="&lt;h1&gt;No, tips for learning a language shouldn't be allowed&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There are a couple of problems with allowing this:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;What is a golfing language&lt;/strong&gt;?  We've had trouble defining this in the past, and if we don't define it now, then I could ask for tips for any language.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There's really only three &quot;tips&quot; that could be given out, and none of them are good: &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A basic tutorial on the language and its syntax&lt;/li&gt;&#xA;&lt;li&gt;Links pointing to tutorials on the language&lt;/li&gt;&#xA;&lt;li&gt;Random varied &quot;language features&quot; that the basic programmer doesn't know. If this helps somebody golf, then it belongs in the Golfing tips&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Finally, &lt;strong&gt;the site is about golfing and programming challenges&lt;/strong&gt;. Answers to any tips question must be focused on the topic of our site. If we wanted to have a tips question focused on writing good KoTH bots, that would be in scope (in my opinion).  &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="20198" LastActivityDate="2015-06-27T01:11:42.670" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5491" PostTypeId="2" ParentId="5471" CreationDate="2015-06-27T01:36:47.963" Score="2" Body="&lt;h1&gt;I don't think this is the solution, the Sandbox is&lt;/h1&gt;&#xA;&lt;p&gt;I really like coming up with interesting problems.  I really like talking about interesting problems.  However, I feel that recent questions posted on the Sandbox have been receiving less feedback.  Whether that is true or not, &lt;strong&gt;more discussion on Sandboxed posts will move them faster to the main site, and will create more ideas for additional challenges&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, I propose that we have reviewing events.  They can be informal, but once a week we should link 5 or so posts in chat for additional review.  If we want it to be more formal, we could even do this in meta.&lt;/p&gt;&#xA;&lt;p&gt;Bonuses:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;No external incentive for participation will be needed.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The Sandbox will eventually be cleared up.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Sandboxed questions posted will be of higher quality&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-27T02:20:23.273" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5493" PostTypeId="2" ParentId="2140" CreationDate="2015-06-27T05:46:14.440" Score="0" Body="&lt;p&gt;A few minutes ago, I posted this question as a popularity-contest which was quickly put on hold as too broad. Specifically, the &amp;quot;there are no restrictions on what the programs/functions do&amp;quot; was apparently not quite right.  A commenter also suggested that an empty program would be a possible answer which I knew, but didn't necessarily want to restrict as I think the popularity contest would have taken care of that.  I'd be interested in any suggestions people have to make the question more appropriate for PPCG.&lt;/p&gt;&#xA;&lt;p&gt;Also, I plan on asking with the tags popularity-contest and restricted-source.  Does that seem right?&lt;/p&gt;&#xA;&lt;p&gt;Here is the question:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Inspired by the bonus in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/52240/write-code-golf-without-using-any-letters&quot;&gt;this question&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Write some code that can be run in multiple directions.  In each direction, the code must be a complete program or a function.  The code must be written in one language (so for example, you &lt;strong&gt;cannot&lt;/strong&gt; have a python program that is also a whitespace program when run backwards).&lt;/p&gt;&#xA;&lt;h3&gt;Explanation of &amp;quot;multiple directions&amp;quot;&lt;/h3&gt;&#xA;&lt;p&gt;If your code is&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;abcd efgh&#xA; ijklm&#xA;nop&#xA;&lt;/pre&gt;&#xA;&lt;p&gt;Then backwards is&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;hgfe dcba&#xA;mlkji &#xA;pon&#xA;&lt;/pre&gt;&#xA;&lt;p&gt;And sideways is&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;a n&#xA;bio&#xA;cjp&#xA;dk&#xA; l&#xA;em&#xA;f&#xA;g&#xA;h&#xA;&lt;/pre&gt;&#xA;&lt;h3&gt;Trivial example&lt;/h3&gt;&#xA;&lt;p&gt;Brainfuck&lt;/p&gt;&#xA;&lt;pre&gt;&#xA; .&#xA;.+++++++++&#xA; +++++++++&#xA; +++++++++&#xA; +++++++++&#xA; +++++++++&#xA; +++++++++&#xA; +++++++++&#xA; +++++++++&#xA; +++++++++.&#xA;         .&#xA;&lt;/pre&gt;&#xA;&lt;h3&gt;Notes&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;there are no restrictions on what the functions/programs do&lt;/li&gt;&#xA;&lt;li&gt;your code must be able to run in at least two directions, but more is better&lt;/li&gt;&#xA;&lt;li&gt;abuse of comments is frowned upon but allowed&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41245" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-06-27T05:46:14.440" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5494" PostTypeId="2" ParentId="2140" CreationDate="2015-06-27T06:28:12.070" Score="0" Body="&lt;h3&gt;Allongiator &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;There are a lot of acronyms on the internet -- ROTFL, RTFM, &lt;del&gt;NSA&lt;/del&gt;, laser, taser, and so on. Your job is to write code that, given an acronym, can figure out what that acronym might stand for. You'll be given an alphabetically-sorted list of words that you can use, to be provided in the format of your choice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that if you're given an actual acronym, you &lt;em&gt;don't&lt;/em&gt; have to provide what it really stands for. As an example, given ROTFL, you could output &quot;rolling on the floor laughing&quot;, or you could output &quot;rearrange orange thrice free language&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A dictionary of all of the words you're allowed to use. This is guaranteed to have at least one word for each letter; your program is allowed to do anything it wants if it encounters a letter that it can't find a word for.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Not&lt;/em&gt; necessarily in alphabetical order&lt;/li&gt;&#xA;&lt;li&gt;All in lowercase&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;A string of lowercase letters, with no whitespace, punctuation, or non-letter characters.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;They can be given in any format you want. For example, the acronym could be the first command line argument and the dictionary the rest of them, or they could be arguments to a function, or given via standard input, or whatever. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The dictionary contents can be found [here].&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A string containing a space-delimited list of words that form the acronym given as input, from the dictionary given.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No trailing whitespace except for a single optional newline&lt;/li&gt;&#xA;&lt;li&gt;The words must be chosen (pseudo-)randomly from the dictionary -- that is, if I run it twice with identical inputs, I should get different outputs&lt;sup&gt;1&lt;/sup&gt;.&lt;/li&gt;&#xA;&lt;li&gt;It doesn't have to make sense or be plausible or grammatically correct. Any words that start with the right letters will do; however, bonus points&lt;sup&gt;2&lt;/sup&gt; to anyone who manages that. &lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Since this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the shortest answer wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/31541&quot;&gt;standard prohibitions&lt;/a&gt; apply here, though with the note that accessing the dictionary from the web is acceptable, so long as it's the unmodified dictionary and nothing else.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1: Barring practically impossible situations.&lt;/sup&gt;&lt;br&gt;&#xA;&lt;sup&gt;2: That is, a browser cookie&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox (foot)notes:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This may very well be a duplicate. I looked around as much as I could, but I don't even know what this is called, so I didn't find much. Apologies if it is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would they be acronyms or initialisms? I'm not sure.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'll add the actual dictionary once I've found a nice one that isn't massive.&lt;/p&gt;&#xA;" OwnerUserId="31541" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2015-06-27T06:28:12.070" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="5495" PostTypeId="2" ParentId="2140" CreationDate="2015-06-27T16:56:37.380" Score="1" Body="&lt;p&gt;Inspired by the last question asking for the masses of the elements, this challenge will be slightly more specific. In this challenge, you will find the molar mass of a sequence of amino acid peptides. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Amino acids, of which there are 21, are the units that combine into chains and then bend and change shape to form proteins, which serve widely varying functions in cells and in the body of most all living organisms. Scientists working with peptides, such as chemists and doctors, can easily synthesize a desired peptide chain in the lab thanks to the powers of modern technology. After some purifying and such, he will have the desired sequence in the form of a white powder/crystal like substance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, this is science! This means that he will eventually need to weigh out a desired amount of his sequence to perform some reactions or tests. To do this, he needs to know its molar mass. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Today, we know that there are 21 amino acids, and we have found their molar masses and given them names and symbols, just like the 118 elements on the periodic table. They are as follows: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Name           Symbol   Molar Mass&#xA;Alanine         A        89 &#xA;Cysteine        C        121&#xA;Aspartic acid   D        133&#xA;Glutamic acid   E        147&#xA;Phenylalanine   F        165&#xA;Glycine         G        75 &#xA;Histidine       H        155&#xA;Isoleucine      I        131&#xA;Lysine          K        146&#xA;Leucine         L        131&#xA;Methionine      M        149&#xA;Asparagine      N        132&#xA;Proline         P        115&#xA;Glutamine       Q        146&#xA;Arginine        R        174&#xA;Serine          S        105&#xA;Threonine       T        119&#xA;Selenocysteine  U        169&#xA;Valine          V        117&#xA;Tryptophan      W        204&#xA;Tyrosine        Y        181&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;BUT WAIT!!&lt;/strong&gt; (how do I make this text bigger?)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;But wait!!&lt;/h3&gt;&#xA;&#xA;&lt;h2&gt;But wait!!&lt;/h2&gt;&#xA;&#xA;&lt;h1&gt;But wait!!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Unlike the elements, the mass of a peptide sequence isn't just the sum of the masses of the constituent amino acids! Amino acids combine in a reaction called a hydrolysis reaction that forms a bond called a peptide bond. Take a look at this diagram: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/nwsIP.gif&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A hydrolysis reaction is a reaction in which two large molecules combine to make a larger one, but in the process lose a small molecule. In this case, they lose a water molecule (hence the name hydrolysis). Since the mass of water is 18, when two peptides bond together in a chain they lose 18 molar mass units. So if our sequence was AC (Alanine-Cysteine), the mass would be 89 + 121 - 18 = 192. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your job is to golf a program that computes the molar mass of a given peptide sequence. The sequence will be specified by their one letter symbols, in all caps. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples: &#xA;&lt;code&gt;A&lt;/code&gt; returns 89&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;AC&lt;/code&gt; returns 192&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;WAGAKRLVLRRE&lt;/code&gt; returns 1453&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Shortest byte count wins, no loopholes. Weights must be hardcoded in the program somehow. &lt;/p&gt;&#xA;" OwnerUserId="40857" LastEditorUserId="20283" LastEditDate="2015-07-03T16:55:09.257" LastActivityDate="2015-07-03T16:55:09.257" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="5496" PostTypeId="1" CreationDate="2015-06-29T07:08:24.497" Score="2" ViewCount="359" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1086/3808&quot;&gt;A little over a year ago, we had a discussion&lt;/a&gt; on meta about whether the sandbox should be migrated to the main site. The answer suggesting to do so was at +8/-4, but there were no counterarguments in the comments or the other answers (other than &quot;there would be too many answers&quot; which, after the Great Merge of 2014, we have seen is a non-issue).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That was quite a while ago, and it was a &lt;a href=&quot;/questions/tagged/discussion&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt; post. This is an actual &lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt;: &lt;strong&gt;let's migrate the sandbox to the main site.&lt;/strong&gt; The advantages of doing this are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Users with less than 5 reputation can still use the sandbox. (This is the most convincing argument, in my opinion.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The visibility of the sandbox is increased. The majority of users do not regularly visit meta, and a question that is probably going to be at the top of the &quot;active questions&quot; list almost perpetually is much more visible than a single line in a small sidebar box.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It would make more sense there anyway; meta is for discussion &lt;em&gt;about&lt;/em&gt; this Stack Exchange site, while main is where the programming puzzling and code golfing goes.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If there is sufficient support on this meta post and there are no outstanding opposing arguments, I will migrate the sandbox to the main site (and make it Community Wiki) in one week.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="68942" LastEditDate="2021-06-09T05:35:30.377" LastActivityDate="2021-06-09T05:35:30.377" Title="Move the sandbox to main" Tags="|feature-request|status-declined|sandbox|" AnswerCount="5" CommentCount="22" ContentLicense="CC BY-SA 3.0" />
  <row Id="5497" PostTypeId="2" ParentId="2140" CreationDate="2015-06-29T14:26:38.707" Score="0" Body="&lt;p&gt;The 9-hole GOLF challenge&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each of these challenges are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenges to be judged by the GOLF CPU.  &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Hole 1: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/52489/the-golf-cpu-golfing-challenge-prime-partitions&quot;&gt;Prime Partitions&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;Hole 2: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/52825/the-golf-cpu-golfing-challenge-sides-of-a-cuboid&quot;&gt;Sides of a Cuboid&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;Hole 3:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You are given the area of a polygon, and the number of edges of the polygon.  You must find the minimal perimeter of the polygon.  This challenge is more about implementing floating point/decimal numbers efficiently.  Your answer must be accurate to at least 3 decimal places.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;10, 5:    2.41088&#xA;7, 8:     1.20405&#xA;6700, 14: 20.9027&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Hole 4:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You are given a number, &lt;code&gt;A&lt;/code&gt;, and a base &lt;code&gt;B&lt;/code&gt;.  You must take the digits of &lt;code&gt;A&lt;/code&gt; in base &lt;code&gt;B&lt;/code&gt; and use each digit as the power of the digits before it.  Assume that integer overflow is desired.  For example, &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;125:  ((5)^2)^1     :25&#xA;3234: (((4)^3)^2)^3 :68719476736&#xA;18043:              :1&#xA;12540:              :0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Hole 5:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We define &lt;code&gt;F(n)&lt;/code&gt; to be equal to the sum of all previous term's digits, and &lt;code&gt;F(0) = 1&lt;/code&gt;.  Given &lt;code&gt;N&lt;/code&gt;, you must return the value of &lt;code&gt;F(N)&lt;/code&gt;.  This sequence is &lt;a href=&quot;https://oeis.org/A004207&quot; rel=&quot;nofollow noreferrer&quot;&gt;A004307&lt;/a&gt; on OEIS&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0: 1&#xA;1: 1&#xA;2: 2&#xA;3: 4&#xA;4: 8&#xA;5: 16&#xA;6: 23&#xA;20: 137&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Hole 6:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You must return the &lt;code&gt;N&lt;/code&gt;th decimal place of &lt;a href=&quot;https://en.wikipedia.org/wiki/E_(mathematical_constant)&quot; rel=&quot;nofollow noreferrer&quot;&gt;e&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0:  2&#xA;1:  7&#xA;5:  8&#xA;25: 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;3 more holes (To come up with)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Do these holes look reasonable?  Enjoyable?  Confusing?&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.893" LastActivityDate="2016-08-15T15:43:28.220" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5498" PostTypeId="1" CreationDate="2015-06-29T14:42:11.033" Score="-1" ViewCount="99" Body="&lt;p&gt;Personally, I am against the sandbox being CW if it's on meta, but I'm very happy for it to be CW if it's on main (since it's unlikely it will work on main otherwise, so my small objections are insignificant).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since this may affect the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5496/move-the-sandbox-to-main&quot;&gt;decision on whether to move the sandbox to main&lt;/a&gt;, but opinion on the CW aspect cannot easily be measured in a general post, this is a specific post to measure just that aspect.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2015-06-30T20:33:32.737" Title="Would you support the sandbox being Community Wiki in order to allow it to move to main?" Tags="|discussion|sandbox|" AnswerCount="2" CommentCount="5" ClosedDate="2015-07-04T14:12:28.720" ContentLicense="CC BY-SA 3.0" />
  <row Id="5499" PostTypeId="2" ParentId="5498" CreationDate="2015-06-29T14:42:11.033" Score="1" Body="&lt;h1&gt;Yes I am happy for the sandbox to be CW on main&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;My objections to CW are not strong enough to lose the benefits of having the sandbox on main where everyone can post to it without a rep limit.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2015-06-29T14:42:11.033" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5500" PostTypeId="2" ParentId="5498" CreationDate="2015-06-29T14:43:19.773" Score="9" Body="&lt;h1&gt;No the sandbox should not be CW (so it cannot move to main)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The benefits of being on main are not strong enough to justify making the sandbox CW.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2015-06-29T14:43:19.773" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5501" PostTypeId="2" ParentId="5496" CreationDate="2015-06-29T16:55:47.960" Score="-3" Body="&lt;h1&gt;It's clear there is strong feeling in both directions - let's find out&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There are arguments supporting both sides, and good arguments both ways. I can't guess which would actually be better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's have a 1 month trial to see what unexpected benefits and drawbacks show up.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2015-06-29T16:55:47.960" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5502" PostTypeId="2" ParentId="2140" CreationDate="2015-06-29T20:57:27.837" Score="3" Body="&lt;p&gt;&lt;strong&gt;Help Indiana Jones and his crew cross the bridge!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This codegolf will solve the &lt;a href=&quot;https://en.wikipedia.org/wiki/Bridge_and_torch_problem&quot; rel=&quot;nofollow&quot;&gt;Bridge and Torch&lt;/a&gt; problem. In this problem, there are multiple people (I'm thinking four) who must all cross a weak bridge to escape an evil dragon as quickly as possible. Because the bridge is weak, only two people can cross the bridge at a time. The whole crew is armed with one torch, which is necessary for 1 or 2 people to cross the bridge. Furthermore, each person takes a certain, integral amount of time to cross the bridge. When two people cross together, they must run at the rate of the slower person. The whole crew needs to quickly figure out how to get all the people across the bridge in the least amount of time to maximize their chances of survival. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt; &#xA;A list of names of the crew (one word, a-zA-Z) and how long they take to cross the bridge alone. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt; An explanation of who crosses the bridge in which order so that the total time is minimized, and the total time. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt; &#xA;Input: &lt;code&gt;Indiana 5 Jones 10&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Indiana, Jones &#xA;10&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;A 1 B 2 C 5 D 8&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;A, B&#xA;A&#xA;C, D&#xA;B&#xA;A, B&#xA;15&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm thinking of either just solving this problem with any number of people, or another version in which anyone not at the end (ie. on the first side or on the bridge) after the time limit dies, and the goal is to minimize the number of deaths. &lt;/p&gt;&#xA;" OwnerUserId="40857" LastEditorUserId="40857" LastEditDate="2015-08-16T22:47:57.167" LastActivityDate="2015-08-16T22:47:57.167" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5504" PostTypeId="2" ParentId="546" CreationDate="2015-06-30T11:39:50.283" Score="2" Body="&lt;p&gt;I think this would be permissible for languages that are literally written as binary, hex, or similar, but NOT as unary. Unary programs should be treated as if they were written in binary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is all unless the poster of the question says otherwise in their question description.&lt;/p&gt;&#xA;" OwnerUserId="39022" LastEditorUserId="39022" LastEditDate="2015-06-30T11:59:14.603" LastActivityDate="2015-06-30T11:59:14.603" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5506" PostTypeId="1" AcceptedAnswerId="5507" CreationDate="2015-06-30T13:52:12.257" Score="6" ViewCount="215" Body="&lt;p&gt;I realize that as per the ask/don't ask the answer is &quot;no&quot;, but if I go to StackOverflow how many people are going to answer a question about Fish or CJam?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I feel like questions about golfy languages maybe should be on topic here.&lt;/p&gt;&#xA;" OwnerUserId="36915" LastEditorDisplayName="user45941" LastEditDate="2016-01-26T09:07:25.320" LastActivityDate="2016-01-26T09:07:25.320" Title="Is this an appropriate place for questions about esoteric languages?" Tags="|discussion|asking-questions|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5507" PostTypeId="2" ParentId="5506" CreationDate="2015-06-30T13:56:25.070" Score="14" Body="&lt;p&gt;I don't think they are on topic here, because where do you draw the line for what counts as an esoteric language? The fastest way to get help with these languages is probably &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;in the PPCG main chat&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I would actually suggest you &lt;em&gt;do&lt;/em&gt; ask them on Stack Overflow (provided it would be a good question for SO if it was about a &quot;normal&quot; language), and then leave a link to the question in our chat. Seeing the &lt;a href=&quot;https://stackoverflow.com/?tags=brainfuck&quot;&gt;Brainfuck&lt;/a&gt; and &lt;a href=&quot;https://stackoverflow.com/?tags=befunge&quot;&gt;Befunge&lt;/a&gt; tags, there is definitely precedent for questions about esolangs on SO.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that &lt;strong&gt;&quot;provided it would be a good question for SO if it was about a &quot;normal&quot; language&quot;&lt;/strong&gt; is really important here. SO does not like questions about golfing code, be it in an esoteric language or not. If you want to ask for advice in golfing something (in any language), this belongs here on PPCG with the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; tag.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2015-06-30T20:25:32.633" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5508" PostTypeId="2" ParentId="546" CreationDate="2015-06-30T16:23:22.357" Score="10" Body="&lt;p&gt;Most &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; questions clearly include the winning criteria, and one of those is &lt;em&gt;usually&lt;/em&gt; “the shortest code in bytes wins”. I don’t believe there are any restrictions on your asking a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question with a slightly different winning criterion: “The shortest code as measured by &lt;em&gt;method X&lt;/em&gt; wins.”&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Go ahead and do that. If people like it, they might imitate it in their own &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; questions. If they don’t, they won’t.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Be certain that &lt;em&gt;method X&lt;/em&gt; is clearly defined.&lt;/p&gt;&#xA;" OwnerUserId="4134" LastEditorUserId="4134" LastEditDate="2016-10-26T11:55:42.790" LastActivityDate="2016-10-26T11:55:42.790" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5509" PostTypeId="2" ParentId="5496" CreationDate="2015-06-30T16:52:07.627" Score="1" Body="&lt;h1&gt;Reputation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There are two sides to this argument:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Losing rep&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The whole point of a sandbox is that you can put your rough ideas and see if it's liked or not, so as not to lose rep on the main site. If people downvote your sandbox post on the main site, then you will lose rep and &lt;em&gt;you may as well post your draft as a question&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Gaining rep&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As Martin Büttner said in the comments, if you gain rep for good drafts, then people may be less likely to delete their answers to carry on harvesting the reputation. This could end up with us having the problem of a cluttered sandbox again.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another problem is that because you get twice the rep for an answer rather than a question, you may get people drafting questions put never posting them because of the extra rep gained.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Conclusion&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Overall, I am against transferring the sandbox to the main site.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2015-06-30T16:52:07.627" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5510" PostTypeId="2" ParentId="5496" CreationDate="2015-06-30T17:27:08.710" Score="7" Body="&lt;h1&gt;The Sandbox does not belong in Main&lt;/h1&gt;&#xA;&lt;p&gt;It does not belong on main because it isn't in the scope of the site.  &lt;strong&gt;The Sandbox is basically a concentrated and pointed discussion about what makes a good question taken case-by-case&lt;/strong&gt;.  This is the primary reason it belongs in Meta, and all other reasons are largely irrelevant in my opinion.&lt;/p&gt;&#xA;&lt;p&gt;However, there are two disadvantages you listed that need consideration:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;That Rep is required to post in the Sandbox&lt;/li&gt;&#xA;&lt;li&gt;That the Sandbox is not visible enough.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;To address the first problem, I would love it if we could get the reputation requirement removed for the Sandbox, and if that isn't possible, all of Meta.  (I consider the Sandbox important enough to remove the rep requirement for all of Meta).&lt;/p&gt;&#xA;&lt;p&gt;For the second problem, I definitely think that the sidebar notice needs more emphasis on the sandbox.   Furthermore, if problem #1 is solved, we could also have some sort of popup appear to first-time askers ensuring that they have posted the question in the sandbox.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-07-01T01:20:45.707" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5514" PostTypeId="2" ParentId="2140" CreationDate="2015-07-01T19:56:08.603" Score="0" Body="&lt;h1&gt;Gimme your best shot&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You're fed up. You've tried to sell your car but failed, not knowing whether your price is too high, too low or people are just too picky. Then a programmer decides to take a look at your car and makes you an offer using a program that he had written for judging a car's worth.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a car's make, model and mileage, you have to find how much a car is worth using the method below. The shortest program to do so wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the make or model of the car is incorrect, you must output &quot;Error: [input make/model] is invalid&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Method&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;First of all, you should scrape all of the prices and mileages of all of the listings on AutoTrader.com of the specified car. Next, plot these on a graph (this graph is not needed to be shown) of mileage against prices. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the graph you should draw a line of best fit. Now you can read the price on the line of best fit for the specified mileage of the car. Now output this with a dollar sign before the price.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;None of these prices are correct output&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ford Fiesta, 200 miles&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: ford, fiesta, 200&#xA;Output: $15000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Subaru Outback, 0 miles&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: subaru, outback, 0&#xA;Output: $27000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Example script&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here's my example test script in Python 2.7 (uses autotrader.co.uk though, not .com):&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;from BeautifulSoup import BeautifulSoup&#xA;import urllib2, sys, re, pylab&#xA;&#xA;model, make, mileage, postcode = sys.argv[1:]&#xA;mileage = int(mileage)&#xA;&#xA;page = urllib2.urlopen(&quot;http://www.autotrader.co.uk/search/used/cars/%s/%s/postcode/%s/&quot;%(model.replace(&quot; &quot;,&quot;%20&quot;), make.replace(&quot; &quot;,&quot;%20&quot;), postcode)).read()&#xA;soup = BeautifulSoup(page)&#xA;&#xA;results = soup.findAll(&quot;div&quot;, {&quot;class&quot;:&quot;search-result__content&quot;})&#xA;&#xA;cars = []&#xA;&#xA;for j in results:&#xA;    pricetag = j.findAll(text=re.compile(r&quot;&amp;amp;pound;.*&quot;))&#xA;    price = int(pricetag[0].replace(',','').replace('&amp;amp;pound;',''))&#xA;&#xA;    mileages = j.findAll(text=re.compile(r&quot;.+ miles&quot;))&#xA;    mileagecar = int(mileages[1].replace(&quot; miles&quot;,&quot;&quot;).replace(&quot;,&quot;,&quot;&quot;))&#xA;&#xA;    cars.append([mileagecar, price])&#xA;&#xA;x = [k[0] for k in cars]&#xA;y = [i[1] for i in cars]&#xA;&#xA;poly = pylab.polyfit(x, y, 2)&#xA;&#xA;print(&quot;£&quot;+str(int(pylab.poly1d(poly)(mileage)+0.5)))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="30525" LastEditDate="2015-07-03T09:14:34.407" LastActivityDate="2015-07-03T09:14:34.407" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5515" PostTypeId="2" ParentId="5124" CreationDate="2015-07-01T23:37:13.670" Score="16" Body="&lt;p&gt;There seems to be some confusion regarding this, so first and foremost: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;ANSI escape sequences are supported by the terminal, not the shell.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Despite of what &lt;a href=&quot;https://codegolf.stackexchange.com/a/49118&quot;&gt;this answer&lt;/a&gt; did, I've shown in &lt;a href=&quot;https://codegolf.stackexchange.com/a/52487&quot;&gt;my answer&lt;/a&gt; that there's no need to involve a shell at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This means that all that is needed is a video text terminal that supports these sequences, which includes pretty much any terminal found on a non-Windows computer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Relying on an escape sequence to move the cursor down is not that different from relying on a linefeed to start a new line; the terminal is not at all guaranteed to do this, but we usually assume that it does.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Should such solutions be allowed in general, i.e. are we only concerned with the rendered output?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;For &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; and related challenges, I'd say that's definitely the case. We look at&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;o&#xA;o&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;not as two &lt;strong&gt;o&lt;/strong&gt;'s separated by a linefeed, but as one &lt;strong&gt;o&lt;/strong&gt; below another. How the second &lt;strong&gt;o&lt;/strong&gt; got there (&lt;code&gt;&quot;o\r\no&quot;&lt;/code&gt;, &lt;code&gt;&quot;o\no&quot;&lt;/code&gt;, &lt;code&gt;&quot;o\v\ro&quot;&lt;/code&gt;, &lt;code&gt;&quot;o\e[Bo&quot;&lt;/code&gt;, etc.) doesn't really matter.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Or should the output be the exact byte stream specified in the challenge?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If the challenge actually specifies a specific byte stream, sure.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the challenge is not tagged as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; or at least closely related, definitely.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;What if the escape codes only work as intended in very specific environments?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;We don't seem to have problems with answers requiring specific conditions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we can use undefined behavior in our C answers and require some obscure CPU for our assembly, requiring a certain kind of terminal emulator that renders the output as intended should be no problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As always, the terminal emulator has to have existed before the challenge.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Is arbitrary colouring of the output allowed? (Provided fore- and background have different colours.)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;As long as the question doesn't state which colors should be used for output, this doesn't really violate a specification.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Arguments could be made, however, against inconsistent coloring (as seen in &lt;a href=&quot;https://codegolf.stackexchange.com/a/49071&quot;&gt;this answer&lt;/a&gt;) and blinking text, since this &lt;em&gt;does&lt;/em&gt; alter how the output is perceived.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2015-07-02T21:54:01.500" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5518" PostTypeId="2" ParentId="2140" CreationDate="2015-07-03T04:42:49.463" Score="2" Body="&lt;p&gt;Am I offering a bite that's more than people are willing to chew?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Truth Table Solver&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Goal&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This code golf challenge is to display a rule that is valid for a given truth table.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The input into the program is a boolean array, though you may choose how this is formatted (array, string, etc.)  Each value in the array is &lt;code&gt;true&lt;/code&gt; or &lt;code&gt;false&lt;/code&gt; (or &lt;code&gt;1&lt;/code&gt; or &lt;code&gt;0&lt;/code&gt; or any other boolean pair).  The index of the value represents the truth table inputs and the value itself is the result of applying the unknown rule to these inputs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the truth table inputs, A is the least significant bit of the index.  B is the second-least significant bit, and so on.  The number of indices in the table determines the number of inputs: log&lt;sub&gt;2&lt;/sub&gt;(n).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;index c b a value&#xA;  0   0 0 0   0&#xA;  1   0 0 1   0&#xA;  2   0 1 0   0&#xA;  3   0 1 1   1&#xA;  4   1 0 0   1&#xA;  5   1 0 1   1&#xA;  6   1 1 0   1&#xA;  7   1 1 1   1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given this truth table, your program must determine the rule is, in this case, &lt;code&gt;(a&amp;amp;b)|c&lt;/code&gt; and output it.  The variables may be in any order and printing redundant brackets is fine.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Requirements&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Rules may include any of the following operations NOT (~), AND (&amp;amp;), OR (|), XOR (^) and identify priority with brackets.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Here are some test cases, expressed as a string of boolean results:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0100              (~a)&amp;amp;b&#xA;00011111          (a&amp;amp;b)|c&#xA;01101000          a^b^c&#xA;0000011101110111  (a|b)&amp;amp;(c|d)&#xA;0100010100010000  a&amp;amp;(((~b)|c)^d)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The shortest code after two weeks wins the contest.&lt;/p&gt;&#xA;" OwnerUserId="4934" LastEditorUserId="4934" LastEditDate="2015-07-05T23:28:54.757" LastActivityDate="2015-07-05T23:28:54.757" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5519" PostTypeId="1" CreationDate="2015-07-03T06:14:53.267" Score="6" ViewCount="177" Body="&lt;p&gt;I've just closed &lt;a href=&quot;https://codegolf.stackexchange.com/q/52570/194&quot;&gt;Shortest Wireworld&lt;/a&gt; as a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/q/9292/194&quot;&gt;Simulate the Wireworld cellular automaton&lt;/a&gt;. However, this is one of those lose-lose situations:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Leave the new question open: answers to two essentially identical questions are split between them, or answers to the older one are reposted.&lt;/li&gt;&#xA;&lt;li&gt;Close the new question: no-one can post answers to either, because the previous question was already closed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think that the best solution is to edit the older question and reopen it. Does anyone object to me removing the last paragraph:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I will pick the winner as a combination of shortest code, usability, speed, and prettiness. I don't really care too much about prettiness, but usability is pretty important. Just make sure that you keep the code short. Good luck!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;and then voting to reopen?&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-07-03T08:29:36.423" Title="How to handle Wireworld duplicate?" Tags="|discussion|specific-question|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5520" PostTypeId="2" ParentId="5519" CreationDate="2015-07-03T08:29:36.423" Score="4" Body="&lt;p&gt;Since all the existing answers are already golfing their code, I think it's fine to turn this into a regular code golf. However, PhiNotPi is still active, so maybe he just wants to fix it himself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is also a third option (which I'd consider if the original author is no longer active, and the specs match up exactly): merging the old question into the new, which would move all answers over and replace the old question with a note linking to the new.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-07-03T08:29:36.423" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5521" PostTypeId="1" CreationDate="2015-07-03T10:39:49.147" Score="10" ViewCount="254" Body="&lt;p&gt;There are a lot of questions out there with ASCII art but I was thinking if a question requesting animated ASCII is acceptable? Problem is I don't think many golf languages support some sort of clear/redraw command for their output, so the users would be forced to use other languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That being said the question wouldn't be a golf question.&lt;/p&gt;&#xA;" OwnerUserId="32107" LastEditorUserId="8478" LastEditDate="2015-07-03T11:13:09.477" LastActivityDate="2015-07-03T11:13:09.477" Title="Is a question requiring animated ASCII art acceptable?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5522" PostTypeId="2" ParentId="5521" CreationDate="2015-07-03T10:48:22.037" Score="16" Body="&lt;p&gt;There's nothing wrong with that. Many golfing languages can't manipulate files or produce graphical output, yet we've had really great &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/file-system&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;file-system&amp;#39;&quot; rel=&quot;tag&quot;&gt;file-system&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; challenges. While language-&lt;em&gt;specific&lt;/em&gt; challenges are strongly discouraged, not every challenge has to be solvable in every language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5515/8478&quot;&gt;it's perfectly possible to clear/redraw the screen manually with nothing but ASCII characters&lt;/a&gt;. Go for it!&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2015-07-03T10:48:22.037" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5523" PostTypeId="2" ParentId="2140" CreationDate="2015-07-03T19:30:05.553" Score="0" Body="&lt;h1&gt;Meta-Manufactoria&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Manufactoria is a pretty great programming game.  However, instead of writing machines to solve the problems, &lt;strong&gt;your goal is to write a program that &lt;em&gt;creates&lt;/em&gt; the machines for you&lt;/strong&gt;.  If you are already familiar with Manufactoria, then for the next section, you only need to read the italicized phrases.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Rules of Manufactoria&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In this version of Manufactoria, &lt;em&gt;you are placed in a 9x9 world&lt;/em&gt;.  The input generator is in the center top square &lt;code&gt;(4, 0)&lt;/code&gt;, and the output acceptor is in the center bottom square &lt;code&gt;(4, 8)&lt;/code&gt;.  When input is generated, it moves immediately down.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input is represented by a robot that has a queue of colors.  Output will be the same robot, but the queue may contain a different sequence of colors.  &lt;em&gt;Robots must always eventually end up in the output square.  There are 2 colors available, Red and Blue&lt;/em&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each tick, the robot moves 1 square.  The direction the robot moves, and any modifications to the queue is determined by the square it is on.  There are 3 types of squares:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Movement square.  This square either moves the robot North, East, South, or West and does not affect the queue.  &lt;em&gt;You cannot have two movement squares on the same tile&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Choice square.   This square moves the robot based on the top color in the queue.  The general Choice square moves the robot east if red, west if blue, south if empty, and never north.  This square can be rotated or reflected to change the directions traveled.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Writer square.  This square writes a color to the back of the queue, and moves the robot in a given direction.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;STDIO and Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your program will be passed two lists of the same length, one containing the inputs, and the other containing the outputs.  Each item of each list contains only the &lt;code&gt;R&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt; characters, representing the input queue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your output is the board that solves the Manufactoria puzzle.  Each square is represented by two characters.  The first character represents the square type, the second represents the direction.  The square types can be:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;M&lt;/code&gt;ovement&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;C&lt;/code&gt;hoice&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;R&lt;/code&gt;ed writer&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;B&lt;/code&gt;lue writer.  &lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;..&lt;/code&gt; Empty square&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;II&lt;/code&gt; Input&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;OO&lt;/code&gt; Output&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The directions are:&#xA; - &lt;code&gt;N&lt;/code&gt;orth&#xA; - &lt;code&gt;E&lt;/code&gt;ast&#xA; - &lt;code&gt;S&lt;/code&gt;outh&#xA; - &lt;code&gt;W&lt;/code&gt;est.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The direction listed for a choice tile represents the direction traveled if the queue is empty.  If the direction is lowercase, the tile is reflected (which swaps the colors).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program which solves more puzzles than any other program wins.  In the event of a tie, the tiebreaker is the program that produces the most efficient solutions.  Efficiency is measured by the number of times the robot moves across all of the solutions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program should be a general solver.  I may add puzzles to the ones listed below at any time.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sample Puzzles&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The solutions given below don't necessarily have to do what the title indicates.  Your program's solution also doesn't have to match the ones listed below.  It only needs to solve the inputs given.  The format below is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[Inputs] [Outputs]&#xA;Solution Map&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Example 1: Don't do anything&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&quot;&quot;,&quot;R&quot;,&quot;B&quot;,&quot;RRBR&quot;,&quot;BRRBRB&quot;] [&quot;&quot;,&quot;R&quot;,&quot;B&quot;,&quot;RRBR&quot;,&quot;BRRBRB&quot;]&#xA;&#xA;........II........&#xA;........MS........&#xA;........MS........&#xA;........MS........&#xA;........MS........&#xA;........MS........&#xA;........MS........&#xA;........MS........&#xA;........OO........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/FIkwO.png&quot; alt=&quot;Manufactoria 1&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example 2: Print second &lt;code&gt;R&lt;/code&gt; and anything after:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&quot;&quot;,&quot;R&quot;,&quot;B&quot;,&quot;RR&quot;,&quot;BRB&quot;,&quot;RBRBBB&quot;] [&quot;&quot;,&quot;&quot;,&quot;&quot;,&quot;R&quot;,&quot;&quot;,&quot;RBBB&quot;]&#xA;&#xA;........II........&#xA;..MSCSMWCSMW......&#xA;..RSMEMEMS........&#xA;BECsMEMEMS........&#xA;........MS........&#xA;........MS........&#xA;........MS........&#xA;........MS........&#xA;........OO........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/vzM0F.png&quot; alt=&quot;Manufactoria 2&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example 3: Reverse String  (This doesn't reverse any string, it only works for the examples listed)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&quot;&quot;,&quot;BBR&quot;,&quot;B&quot;,&quot;RRB&quot;,&quot;BRRRB&quot;,&quot;BBRB&quot;] [&quot;&quot;,&quot;RBB&quot;,&quot;B&quot;,&quot;BRR&quot;,&quot;BRRRB&quot;,&quot;BRBB&quot;]&#xA;&#xA;........IICsMERS..&#xA;......CECSCEMSBS..&#xA;......RSMSCEMSMW..&#xA;......REMSCEMS....&#xA;........MSRSMS....&#xA;........MSRSMS....&#xA;........MSRSMS....&#xA;........MSBWMW....&#xA;........OO........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/9WzCC.png&quot; alt=&quot;Manufactoria 3&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example 4: Only include Rs&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&quot;R&quot;,&quot;&quot;,&quot;BBR&quot;,&quot;BRR&quot;,&quot;B&quot;,&quot;RBRBRBBR&quot;,&quot;BBBBBBRRR&quot;,&quot;RBBBRBRBBB&quot;,&quot;RRRR&quot;] [&quot;R&quot;,&quot;&quot;,&quot;R&quot;,&quot;RR&quot;,&quot;&quot;,&quot;RRRR&quot;,&quot;RRR&quot;,&quot;RRR&quot;,&quot;RRRR&quot;]&#xA;&#xA;........II........&#xA;........MEMEMEMS..&#xA;MSCSMWCSMWCSMWCSMW&#xA;REREMERERSMW..MS..&#xA;........MSMWMWMW..&#xA;........MS........&#xA;........MS........&#xA;........MS........&#xA;........OO........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/yO5AB.png&quot; alt=&quot;Manufactoria 4&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2015-07-07T03:30:43.433" LastActivityDate="2015-07-07T03:30:43.433" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5524" PostTypeId="2" ParentId="5134" CreationDate="2015-07-04T02:04:10.407" Score="2" Body="&lt;h1&gt;Assembler Enhancements&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;None of these proposals affect scoring or execution speed; they are only possibilities to improve code readability.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;code&gt;sz&lt;/code&gt; and &lt;code&gt;snz&lt;/code&gt; instructions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I've often found myself writing patterns like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# adds c,d to a,b&#xA;add_128:&#xA;  add b, b, d&#xA;  leu d, b, d&#xA;  jz skip_carry, d&#xA;  add a, a, 1&#xA;skip_carry:&#xA;  add a, a, d&#xA;  ret a, b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Personally, I don't like that extra label floating around.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(This particular case would be rendered trivial by an &lt;code&gt;adc&lt;/code&gt; instruction, but I think introducing a status register goes against the goals of GOLF.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I propose two new psuedo-instructions:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;sz   a       ' |    1  | skip on zero        | Skips the next instruction if a is zero.&#xA;snz  a       ' |    1  | skip on non-zero    | Skips the next instruction if a is non-zero.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;These would get transformed to &lt;code&gt;jz&lt;/code&gt; and &lt;code&gt;jnz&lt;/code&gt; instructions by the assembler, with the address to jump to set to the current address + two instructions.  The previous sample could become:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# adds c,d to a,b&#xA;add_128:&#xA;  add b, b, d&#xA;  leu d, b, d&#xA;  sz d&#xA;  add a, a, 1&#xA;  add a, a, d&#xA;  ret a, b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;&lt;code&gt;#include&lt;/code&gt; directive&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As a simpler alternative to the dynamic/static linking proposals, you could add a function &lt;code&gt;include(filename)&lt;/code&gt; that would cause the assembler to insert the contents of the specified file at the location of the function call.  This would allow splitting utility functions and lookup tables into different files without two much trouble.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Precomputed data offsets&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;My submission for &lt;a href=&quot;https://codegolf.stackexchange.com/q/49356/39174&quot;&gt;&quot;Testing if a number is a square&quot;&lt;/a&gt; included this snippet:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  add x, x, data(lookup_table)&#xA;  sub x, x, 2**10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I could have saved one cycle if the assembler allowed me to do something like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  add x, x, data(lookup_table) - 2**10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I could have edited the binary myself, but as it was, a 0.2-cycle (on average) optimization was not worth it.  However I could see places where this could be useful.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Automatic loop unrolling:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The same submission also included the following snippet:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  and c, x, 0xFFFFFFFF00000000&#xA;  jnz skip32, c&#xA;  shl x, x, 32&#xA;  sub b, b, 16&#xA;skip32:&#xA;  and c, x, 0xFFFF000000000000&#xA;  jnz skip16, c&#xA;  shl x, x, 16&#xA;  sub b, b, 8&#xA;skip16:&#xA;  and c, x, 0xFF00000000000000&#xA;  jnz skip8, c&#xA;  shl x, x, 8&#xA;  sub b, b, 4&#xA;skip8:&#xA;  and c, x, 0xF000000000000000&#xA;  jnz skip4, c&#xA;  shl x, x, 4&#xA;  sub b, b, 2&#xA;skip4:&#xA;  and c, x, 0xC000000000000000&#xA;  jnz skip2, c&#xA;  shl x, x, 2&#xA;  sub b, b, 1&#xA;skip2:&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Hard to read and prone to mistakes.  What if we could do something like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;for i in range(5,0,-1):&#xA;    and c, x, 2**64 - 2**(64 - 2**i)&#xA;    jnz skip&amp;lt;i&amp;gt;, c&#xA;    shl x, x, 2**i&#xA;    sub b, b, 2**(i-1)&#xA;  skip&amp;lt;i&amp;gt;:&#xA;end&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The syntax needs some work (especially the labels), but you get the idea.  Here it's not so bad, but if you want to unroll (say) a 129-bit long division algorithm, where eliminating the conditional and jump would save ~20% on each cycle?  Priceless.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Access to python libraries&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In order to create the lookup table for the above problem, I did&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;lookup_table = bytes(int((16*n)**0.5) for n in range(2**10, 2**12))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;But what if I wanted to make a lookup table for &lt;code&gt;sin(x)&lt;/code&gt;?  If the assembler allowed an equivalent of &lt;code&gt;include math&lt;/code&gt; I could just use &lt;code&gt;math.sin&lt;/code&gt;.  As it is I have to prepare the lookup table ahead of time and then paste it in as a huge string: not very pretty.&lt;/p&gt;&#xA;" OwnerUserId="39174" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2015-07-17T12:53:32.030" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5525" PostTypeId="2" ParentId="2140" CreationDate="2015-07-04T03:05:40.250" Score="1" Body="&lt;h1&gt;Fundamentals of City Planning&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you are a city planner.  You have been given an &lt;code&gt;N&lt;/code&gt; by &lt;code&gt;M&lt;/code&gt; rectangle to fill with residential lots of size &lt;code&gt;K&lt;/code&gt; and roads of width &lt;code&gt;1&lt;/code&gt;.  You know that money is made based on the number of residents in the city, so &lt;strong&gt;your goal is to maximize the number of lots in your rectangle&lt;/strong&gt;.  However, the following rules are enforced:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Roads have a width of 1 square, and all roads must be orthogonally connected to each other.&lt;/li&gt;&#xA;&lt;li&gt;Every lot must share at least 1 side with a road&lt;/li&gt;&#xA;&lt;li&gt;Lots must all be the same size &lt;code&gt;K&lt;/code&gt;.  They can be in the shape of any polyomino of size &lt;code&gt;K&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;There must be at least 1 road that touches the edge of the rectangle, as your residents need to be able to get in and out!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The winner of the challenge is the one that:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Fits the most lots across all of the below examples.  In the case of a tie:&lt;/li&gt;&#xA;&lt;li&gt;Fastest solution, unless multiple answers are running under a second.  In that case:&lt;/li&gt;&#xA;&lt;li&gt;The earliest posted solution&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Submitted answers must run in under a minute.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;STDIO&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You will be passed three integers, &lt;code&gt;N&lt;/code&gt;, &lt;code&gt;M&lt;/code&gt;, &lt;code&gt;K&lt;/code&gt;.  You need to output the generated grid.  Roads should be represented by &lt;code&gt;.&lt;/code&gt;.   Lots should be ordered and numbered, and when printed should be represented by their number mod 10.  The ordering can be arbitrary, and is simply used to distinguish lots on output.  Empty squares are allowed and are represented by &lt;code&gt;#&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test Cases for correctness&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Provided solutions can be numbered differently, rotated, and/or reflected&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 2 1 &#xA;.1&#xA;&#xA;1 3 1&#xA;1.2&#xA;&#xA;2 2 1&#xA;1.&#xA;2.&#xA;&#xA;3 3 1&#xA;123&#xA;...&#xA;456&#xA;&#xA;3 3 2&#xA;11#      11.      #11     &#xA;2..  or  2..  or  2..&#xA;233      233      233&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Test cases used for scoring:&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;20 15 1&#xA;20 15 2&#xA;20 15 3&#xA;20 15 4&#xA;20 15 5&#xA;20 15 6&#xA;20 15 7&#xA;20 15 8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2015-07-04T14:47:01.683" LastActivityDate="2015-07-04T14:47:01.683" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5526" PostTypeId="1" CreationDate="2015-07-04T04:23:51.550" Score="11" ViewCount="135" Body="&lt;p&gt;We've recently noted that our questions per day stat &lt;a href=&quot;http://area51.stackexchange.com/proposals/4570/code-golf-programming-puzzles&quot;&gt;has gone down&lt;/a&gt;.  We recently had somebody propose a renewal of the &lt;a href=&quot;http://area51.stackexchange.com/proposals/4570/code-golf-programming-puzzles&quot;&gt;Weekly Challenges&lt;/a&gt;, but as I posted there, I don't think it's the right solution.  &lt;strong&gt;We have an huge resource of potential questions, all wrapped nicely up in our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?answertab=active&quot;&gt;Sandbox&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I did some research, and as of 7/3/2015, found that we have &lt;a href=&quot;https://data.stackexchange.com/meta.codegolf/query/edit/331972&quot; rel=&quot;nofollow noreferrer&quot;&gt;180 unvoted, unposted, potential questions&lt;/a&gt; in our sandbox, the majority of them with 0 or 1 comments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, in order to help clean up the sandbox, and to increase our questions per day, I'm looking for a feasible way we can help these questions be moved or removed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What can we do to encourage more activity in the Sandbox?&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2015-07-11T10:39:31.357" Title="How to move questions from the Sandbox" Tags="|discussion|sandbox|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5527" PostTypeId="1" CreationDate="2015-07-04T13:43:05.850" Score="6" ViewCount="155" Body="&lt;p&gt;Following Peter Taylor's comments that pointed out that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5498/would-you-support-the-sandbox-being-community-wiki-in-order-to-allow-it-to-move&quot;&gt;this question&lt;/a&gt; (now deleted) is not giving meaningful voting results with only 2 options, here are all 4 options as answers so that I'm no longer asking a leading question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please vote up and down on as many answers as you have an opinion on, so we can see a more reliable record of the community's opinion. However, be aware that all the answers are posted by me, so voting on all of them at once may lead to your votes being reversed, as Doorknob pointed out in chat:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;(I'm a bit afraid people are going to get whacked with the serial-voting-reversal script on that. As a workaround, I'm upvoting one answer, downvoting two, and coming back later to downvote the third.)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Feel free to edit any of the answers to add points for or against.&lt;/h1&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2015-07-04T14:04:05.310" Title="4 options for the sandbox: Main or Meta &amp; Community Wiki or not" Tags="|discussion|sandbox|" AnswerCount="4" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5528" PostTypeId="2" ParentId="5527" CreationDate="2015-07-04T13:43:36.073" Score="-1" Body="&lt;h1&gt;The sandbox should be on Main as Community Wiki&lt;/h1&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2015-07-04T13:43:36.073" CommentCount="0" CommunityOwnedDate="2015-07-04T14:10:37.547" ContentLicense="CC BY-SA 3.0" />
  <row Id="5529" PostTypeId="2" ParentId="5527" CreationDate="2015-07-04T13:44:54.363" Score="-15" Body="&lt;h1&gt;The sandbox should be on Main but not Community Wiki&lt;/h1&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2015-07-04T13:44:54.363" CommentCount="1" CommunityOwnedDate="2015-07-04T14:11:06.843" ContentLicense="CC BY-SA 3.0" />
  <row Id="5530" PostTypeId="2" ParentId="5527" CreationDate="2015-07-04T13:45:56.110" Score="17" Body="&lt;h1&gt;The sandbox should be on Meta but not Community Wiki&lt;/h1&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2015-07-04T13:45:56.110" CommentCount="1" CommunityOwnedDate="2015-07-04T14:10:56.587" ContentLicense="CC BY-SA 3.0" />
  <row Id="5531" PostTypeId="2" ParentId="5527" CreationDate="2015-07-04T13:47:03.620" Score="-7" Body="&lt;h1&gt;The sandbox should be on Meta as Community Wiki&lt;/h1&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2015-07-04T13:47:03.620" CommentCount="0" CommunityOwnedDate="2015-07-04T14:11:16.337" ContentLicense="CC BY-SA 3.0" />
  <row Id="5532" PostTypeId="1" CreationDate="2015-07-04T17:13:26.600" Score="7" ViewCount="358" Body="&lt;p&gt;&lt;strong&gt;1. When submitting a function, can global variables be declared outside the function?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if I have the C code&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f(n){int a,b,c=4;dosomething;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;am I allowed to save 4 bytes as follows?&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a,b,c=4;f(n){dosomething;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I had always assumed not, but answers on &lt;a href=&quot;https://codegolf.stackexchange.com/q/52494/15599&quot;&gt;Print an ascii spiral in O(log n) memory&lt;/a&gt; have led me to wonder.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;&lt;strong&gt;2. EDIT: as an aside, what about this?&lt;/strong&gt; I'm pretty sure this one is totally unacceptable, but if you think it is acceptable, please write a corresponding answer.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f(n,a,b,c){dosomething;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where only parameter &lt;code&gt;n&lt;/code&gt; is actually useful for passing information to the function and the parameters passed to &lt;code&gt;a,b,c&lt;/code&gt; can either take arbitrary values or the answerer specifies &quot;the function must be called with &lt;code&gt;c=4&lt;/code&gt;.&quot; &lt;/s&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Reversal of edit: As pointed out by Doorknob there are examples of this being considered accepable if the function has additional arguments but may be called with only the arguments specified in the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Relevant:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/4939/15599&quot;&gt;Do function submissions have to be reusable?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2419/15599&quot;&gt;Default for Code Golf: Program, Function or Snippet?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2016-01-26T09:26:07.677" Title="When submitting a function, can global variables be declared outside the function?" Tags="|discussion|answers|" AnswerCount="3" CommentCount="8" ClosedDate="2016-01-26T18:58:05.570" ContentLicense="CC BY-SA 3.0" />
  <row Id="5533" PostTypeId="2" ParentId="5532" CreationDate="2015-07-04T17:14:33.197" Score="26" Body="&lt;h1&gt;Yes, this is acceptable&lt;/h1&gt;&#xA;&lt;p&gt;Vote here if you think this is acceptable.&lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-07-04T17:46:34.133" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5534" PostTypeId="2" ParentId="5532" CreationDate="2015-07-04T17:19:13.853" Score="-1" Body="&lt;h1&gt;No, this is not acceptable&lt;/h1&gt;&#xA;&lt;p&gt;Vote here if you think this is not acceptable.&lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-07-04T17:47:01.107" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5536" PostTypeId="1" CreationDate="2015-07-06T13:27:22.977" Score="4" ViewCount="208" Body="&lt;p&gt;In the past few months, we've quite a few Kolomogorov Complexity challenges asking us to output different flags. For this reason, (and as Fatalize suggested), I think we should create a tag especially for flags?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does anyone agree or oppose to this?&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2015-07-06T17:06:02.220" Title="Create a flags tag?" Tags="|discussion|tags|" AnswerCount="2" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5539" PostTypeId="2" ParentId="5536" CreationDate="2015-07-06T17:02:45.147" Score="12" Body="&lt;h1&gt;No, we should not create a flag tag&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It's sufficient to tag challenges related to flags as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; (if applicable), and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;. The context of a flag will be apparent from the title.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All challenges relating to flags will be essentially the same challenge but with a different pattern to mimic.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2015-07-06T17:02:45.147" CommentCount="5" CommunityOwnedDate="2015-07-06T17:02:45.147" ContentLicense="CC BY-SA 3.0" />
  <row Id="5540" PostTypeId="2" ParentId="5536" CreationDate="2015-07-06T17:03:55.773" Score="13" Body="&lt;h1&gt;Yes, we should create a flag tag&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It's better to have more tags than fewer tags. It also groups like challenges together making it easier to identify duplicates.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="30525" LastEditDate="2015-07-06T17:06:02.220" LastActivityDate="2015-07-06T17:06:02.220" CommentCount="5" CommunityOwnedDate="2015-07-06T17:03:55.773" ContentLicense="CC BY-SA 3.0" />
  <row Id="5541" PostTypeId="2" ParentId="546" CreationDate="2015-07-07T19:04:31.693" Score="0" Body="&lt;h1&gt;Keep the existing approach&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Encourage new challenge types / scoring methods for variety and balance&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I don't think a general approach to making language differences fair will work - different languages have different advantages that vary from question to question. However, having a variety of scoring methods for question posters to choose from means that in addition to standard golf questions, other questions can have a scoring method that seems to fit best.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5489/20283&quot; title=&quot;Simple Bit Encoding - SBE&quot;&gt;Sparr's unpopular suggestion&lt;/a&gt; for making a fair size comparison between languages with different sized alphabets, I wondered if something vaguely similar might be better received as a new challenge type / scoring method, rather than trying to apply it to every code golf question.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;For this challenge type, you submit two pieces of source code, your primary code and your secondary code.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;em&gt;Primary code&lt;/em&gt;&lt;/strong&gt; solves the problem posed in the question.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;em&gt;Secondary code&lt;/em&gt;&lt;/strong&gt; outputs the primary source code.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your score is the length in bytes of your secondary code, which need not be in the same language as your primary code.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This doesn't make any changes for standard code golf questions, just adds an alternative that some questions can use if the poster sees fit. If there are no strong objections here, I'll post an example question using this scoring method in the sandbox.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-07-07T19:04:31.693" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5542" PostTypeId="2" ParentId="2140" CreationDate="2015-07-08T13:59:43.200" Score="9" Body="&lt;h1&gt;Overhanded (Underhanded) Poker&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/overhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;overhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;overhanded&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/card-games&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;card-games&amp;#39;&quot; rel=&quot;tag&quot;&gt;card-games&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Also if you make &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/overhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;overhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;overhanded&lt;/a&gt; a thing I'll whack everyone involved with a large trout ~ &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/22604646#22604646&quot;&gt;Doorknob&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;You and your poker buddy are bored, and seeking to liven up the usual poker game. Playing one hand just isn't challenging any more, and you're looking to add a bit of depth. So, why not play with two?&lt;/p&gt;&#xA;&lt;h3&gt;Overview&lt;/h3&gt;&#xA;&lt;p&gt;This is a round robin tournament of two-player poker. For each round, a player will need to make two hands of five cards each. To do this, each player will be dealt seven cards, with three community cards to fill out the hands. After receiving their seven cards, players will be allowed to exchange any number of them for new cards from the deck &lt;em&gt;one&lt;/em&gt; time.&lt;/p&gt;&#xA;&lt;p&gt;Once each player has exchanged cards, they will split the ten cards (7 in hand, 3 community) into two hands, &lt;strong&gt;Over&lt;/strong&gt; and &lt;strong&gt;Under&lt;/strong&gt;. The object for the Over hand is the highest ranked hand, while the object for Under is lowest.&lt;/p&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;p&gt;In each round, a player will receive one point if:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Their Over hand is higher than the opponent's Over hand &lt;strong&gt;and&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Their Under hand is lower than their opponent's Under hand&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If one hand wins (Over beats Over or Under loses to Under) and the other ties, you get half a point.&lt;/p&gt;&#xA;&lt;p&gt;If one player wins one and the other wins the other or both hands tie, no points are awarded.&lt;/p&gt;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard poker hand rankings apply (link chart or something here)&lt;/li&gt;&#xA;&lt;li&gt;Play fair! (will expand on this with the usual KotH stuff)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Controller&lt;/h3&gt;&#xA;&lt;p&gt;WIP&lt;/p&gt;&#xA;&lt;h3&gt;Meta&lt;/h3&gt;&#xA;&lt;p&gt;Obviously this needs some more work. Initial thoughts, questions?&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-07-08T13:59:43.200" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5544" PostTypeId="1" CreationDate="2015-07-09T12:31:35.403" Score="15" ViewCount="373" Body="&lt;p&gt;We have quite a few problems on this site that deal with OEIS.  We have tons of problems asking you to produce the &lt;code&gt;nth&lt;/code&gt; term (or the first &lt;code&gt;n&lt;/code&gt; terms), and we even have a problem &lt;a href=&quot;https://codegolf.stackexchange.com/questions/49223/evolution-of-oeis&quot;&gt;specifically dealing with OEIS&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think that these problems are often quite interesting, and I could definitely see somebody searching/filtering by such problems.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I do see a disadvantage here.  Let's say a problem is shown to match a sequence on OEIS, but the OP doesn't update his question.  Do we:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Automatically tag the question?&lt;/li&gt;&#xA;&lt;li&gt;If so, do we edit the question and add a link to the OEIS?&lt;/li&gt;&#xA;&lt;li&gt;If not, how does the potential searcher find which OEIS sequence it matches?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;So, please vote below on what you guys think we should do.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-07-23T19:10:34.047" Title="Create an OEIS Tag" Tags="|discussion|tags|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5545" PostTypeId="2" ParentId="5544" CreationDate="2015-07-09T12:32:02.467" Score="1" Body="&lt;h1&gt;Yes, let's create an OEIS tag&lt;/h1&gt;&#xA;&lt;p&gt;I think the tag would be useful.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-23T19:10:34.047" CommentCount="1" CommunityOwnedDate="2015-07-09T12:32:02.467" ContentLicense="CC BY-SA 3.0" />
  <row Id="5546" PostTypeId="2" ParentId="5544" CreationDate="2015-07-09T12:33:03.610" Score="17" Body="&lt;h1&gt;No, let's not create an OEIS tag&lt;/h1&gt;&#xA;&lt;p&gt;It would cause more problems than it would solve.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-23T19:10:19.467" CommentCount="4" CommunityOwnedDate="2015-07-09T12:33:03.610" ContentLicense="CC BY-SA 3.0" />
  <row Id="5548" PostTypeId="2" ParentId="2140" CreationDate="2015-07-10T21:52:47.757" Score="1" Body="&lt;h1&gt;Blackjack&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;How to Play&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Blackjack is for any number of people, but there will be only one in this case. The goal is to get as close to 21 as possible without going over. Aces will be 1 for this program. All other face cards are worth 10. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;To start, the player is dealt two cards. They can then choose to hit (take another card) or stand. This repeats until they go over 21 (bust) or decide to stay. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the player busts, their score is 0. Otherwise, their score is the total of all the cards. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input/Output&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The program should output 2 &quot;cards&quot; (randomly choose between 2, 3, 4, 5, 6, 7, 8, 9, 10, K, Q, J, and A). &lt;/li&gt;&#xA;&lt;li&gt;The player then inputs a move, &lt;code&gt;stand&lt;/code&gt; or &lt;code&gt;hit&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If he/she stands, output &lt;code&gt;Final Score: [total of cards]&lt;/code&gt;. &lt;/li&gt;&#xA;&lt;li&gt;If he/she hits, output another &quot;card&quot;. Output &lt;code&gt;Bust!&lt;/code&gt; if the score is over 21. &lt;/li&gt;&#xA;&lt;li&gt;Repeat steps 2-4 until the player busts or stands. &lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Output: 5 K&#xA;Input:  hit&#xA;Output: 6&#xA;Input:  stand&#xA;Output: Final Score: 21&#xA;&#xA;&#xA;&#xA;Output: A Q&#xA;Input:  hit&#xA;Output: 7&#xA;Input:  hit&#xA;Output: 6&#xA;Output: Bust!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules and Other Notes&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Aces are always 1.&lt;/li&gt;&#xA;&lt;li&gt;Each output/input should be on a new line. &lt;/li&gt;&#xA;&lt;li&gt;Any trailing spaces and newlines are okay.&lt;/li&gt;&#xA;&lt;li&gt;Assume that all input will be valid. You don't need to notify the player of invalid input. &lt;/li&gt;&#xA;&lt;li&gt;You cannot read from a file or other source. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring &amp; Submissions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is code golf. Shortest code in &lt;strong&gt;characters&lt;/strong&gt; wins. &lt;/li&gt;&#xA;&lt;li&gt;How to win: post the shortest working code within one week. &lt;/li&gt;&#xA;&lt;li&gt;Please include the language, number of characters, and code. Explanations are appreciated, but not required.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Good luck!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Tags&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/card-games&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;card-games&amp;#39;&quot; rel=&quot;tag&quot;&gt;card-games&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Anything I'm forgetting? Does anything need more clarification? &lt;/p&gt;&#xA;" OwnerUserId="41912" LastEditorUserId="41912" LastEditDate="2015-07-11T02:56:32.413" LastActivityDate="2015-07-11T02:56:32.413" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5549" PostTypeId="2" ParentId="5526" CreationDate="2015-07-11T10:32:25.290" Score="7" Body="&lt;h3&gt;Add a random sandbox post feed to drop a oneboxed link into chat once a week&lt;/h3&gt;&#xA;&lt;p&gt;This was &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/22429695#22429695&quot;&gt;hinted at in chat&lt;/a&gt; so I'm adding a place for people to vote on it. I'm imagining this being maybe once a week. Raising a sandbox post in chat generally results in more feedback and more chance of the idea either being posted or identified as not possible so it can be deleted.&lt;/p&gt;&#xA;&lt;p&gt;Thursday around 13:00 or 14:00 UTC seems like a good time based on &lt;a href=&quot;http://chat.stackexchange.com/rooms/info/240/the-nineteenth-byte&quot;&gt;chat activity&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-07-11T10:39:31.357" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="5551" PostTypeId="2" ParentId="2140" CreationDate="2015-07-11T22:25:03.080" Score="0" Body="&lt;p&gt;(Need a title.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write two programs (or functions) in the same language for these two tasks:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Given a list of integers, split at every non-negative integer. If there are two or more consecutive non-negative integers, your program should preserve the empty list between them.&lt;/li&gt;&#xA;&lt;li&gt;Given a list of lists of negative integers, concatenate the lists and insert non-negative integers between them. The inserted integer after the &lt;em&gt;n&lt;/em&gt;th list (zero-based) should be &lt;em&gt;n&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Alternatively, you can increment every integer by one for both tasks. So you split at positive integers, accept non-positive integers in task 2 and the inserted integers start at 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input for task 1 and the output for task 2 should have the same format, with the exception that one can be the string representation of the other in your programming language. The same goes for the output for task 1 and the input for task 2.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your score is the total length of your two programs &lt;em&gt;times&lt;/em&gt; (30 + their Levenshtein distance). Lowest score wins.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example for task 1&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:  [-5 7 8 -5 2 -6 -3 -3 8]&#xA;Output: [[-5] [] [-5] [-6 -3 -3] []]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Example for task 2&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:  [[-5] [] [-5] [-6 -3 -3] []]&#xA;Output: [-5 0 1 -5 2 -6 -3 -3 3]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2015-07-11T22:25:03.080" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5553" PostTypeId="2" ParentId="2140" CreationDate="2015-07-12T23:29:36.080" Score="1" Body="&lt;h1&gt;How to Create a Dating Website&lt;/h1&gt;&#xA;&lt;p&gt;Dating websites make lots of money.  You want lots of money, so you're going to make a dating website.  However, we all know that the most important part of any dating website is the algorithm, so you need to build that first.&lt;/p&gt;&#xA;&lt;p&gt;When your customers will sign up, they are going to fill out a short survey describing themselves*.  On the survey, they filled out personal interests, personality traits, and other important data for you to process using your algorithm.&lt;/p&gt;&#xA;&lt;p&gt;Your algorithm must then accept two things:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A list of people, where each person has a list of traits&lt;/li&gt;&#xA;&lt;li&gt;A list of trait pairs &lt;code&gt;(A, B)&lt;/code&gt;, where each pair has a score &lt;code&gt;S&lt;/code&gt;.  A trait pair matches a couple if one of them has trait &lt;code&gt;A&lt;/code&gt;, and the other has trait &lt;code&gt;B&lt;/code&gt;.  The score can be negative.  If &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt; are different, and both people have both of the traits, then the score is doubled.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Your algorithm must then output a list of couples.  Each person must be included in a couple exactly once, and only two people is allowed in each couple**.  Your score is the sum of each couple's score.  A couple's score is the sum of each of the trait pairs they match.&lt;/p&gt;&#xA;&lt;h1&gt;Input/Output&lt;/h1&gt;&#xA;&lt;p&gt;Input is given as shown in the following example.  Ignore the &lt;code&gt;# comments&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;4         # Number of customers&#xA;1,3,5,7   # Customer 1's list of traits&#xA;1,2,4,5,6 # Customer 2's list of traits&#xA;1,6,7     # Customer 3's list of traits&#xA;1,2       # Customer 4's list of traits&#xA;4         # Number of trait pairs&#xA;1,2,-2    # Trait 1 and 2 give a score of -2&#xA;1,6,4     # Trait 1 and 6 give a score of 4&#xA;2,3,-4    # Trait 2 and 3 give a score of -4&#xA;6,6,5     # Trait 6 and 6 give a score of 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Let's say you output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2,3 1,4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Then that would match Customer 2 to 3 and 1 to 4.&lt;/p&gt;&#xA;&lt;p&gt;If we look at &lt;code&gt;2,3&lt;/code&gt;, they match:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first trait pair, because Customer 3 has Trait 1, and Customer 2 has Trait 2&lt;/li&gt;&#xA;&lt;li&gt;The second trait pair, because they both have Traits 1 and 6.  (This means double the score)&lt;/li&gt;&#xA;&lt;li&gt;The fourth trait pair, because they both have trait 6.  However, because the trait pair only references 1 trait, we don't double the score.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Adding it all up, we get &lt;code&gt;-2 + 4*2 + 5 = 11&lt;/code&gt;.  The other couple scores &lt;code&gt;-2 + -4 = -6&lt;/code&gt;, so the final score is &lt;code&gt;11 + -6  = 5&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The person who generates the highest scoring pairing wins the challenge.  In the case of a tie, the program that generates it the fastest wins.  If programs are generating the answer in under a second, then the earliest posted answer wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Question: I'm planning on doing 10K people, 500 traits, an average of 50 traits per person, and 5K trait pairs.  I'm doing large numbers because I want efficient algorithms, but I want to know if the numbers are feasible&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;*They clicked a check box saying that they didn't lie, so we know that the survey is accurate&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;**You can assume everybody is a hermaphrodite&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-07-13T19:15:44.117" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5554" PostTypeId="2" ParentId="2140" CreationDate="2015-07-13T10:32:48.033" Score="1" Body="&lt;h1&gt;roll me back a game of hearts&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/card-games&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;card-games&amp;#39;&quot; rel=&quot;tag&quot;&gt;card-games&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Roll me back a game of hearts&lt;br&gt;&#xA;given just a deck of cards&lt;br&gt;&#xA;please.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, I've been playing a game of hearts (&lt;a href=&quot;https://en.wikipedia.org/wiki/Hearts&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://en.wikipedia.org/wiki/Hearts&lt;/a&gt;) with three of my friends but I'm not entirely sure if all of them were playing perfectly according to the rules. So I'd like to replay the game with everyone's cards openly visible. And because you like algorithms, you offered me your help determining everyone's cards from the final deck after each hand. However, I can't quite remember if you promised me a full program or just a named function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;strong&gt;card&lt;/strong&gt; is represented with two characters. The first character represents its value and is one of &lt;code&gt;23456789TJQKA&lt;/code&gt; (2-10, jack, queen, king, ace). The second character represents its suit and is one of &lt;code&gt;CDHS&lt;/code&gt; (clubs, diamonds, heards, spades).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;strong&gt;input&lt;/strong&gt; is a list of 52 cards. It can either be a list (array, vector...) of two-character strings or a single space-separated string. You will be given the cards in the exact order they were played. The list represents a valid deck and 2C is the first card in the deck.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt; four sets of cards, each representing the starting hand of one player. The first set may correspond to any player but the rest must be ordered in the order of play (so if the first hand to be output is the third one to play, the rest must be in the order of fourth, first, second). The cards in each  player's hand may be output in any order (it's a set). If you choose to output a single string, separate the cards in each hand with spaces and the hands with newlines.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Game rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rules irrelevant to this challenge have been formatted in small font&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are variants for three to six players but the base variant is for four players so let's assume this one.&lt;/li&gt;&#xA;&lt;li&gt;&lt;sup&gt;Before the main game each player passes three cards to another player. Since this is a lossy operation, let's just ask for the hands after this passing moment.&lt;/sup&gt;&lt;/li&gt;&#xA;&lt;li&gt;Each game consists of 13 tricks. Each trick consists of each player in clockwise order playing one card from their hand, then one player &quot;taking&quot; the trick.&lt;/li&gt;&#xA;&lt;li&gt;The first trick starts by the two of club. Each subsequent trick is started by whichever player took the previous trick. &lt;/li&gt;&#xA;&lt;li&gt;&lt;sup&gt;The first player in a trick can play any card. The first player cannot play hearts unless hearts have already been played in that game or he has no other cards, however. The other players have to play the same suit as the leading player if they have that suit, otherwise they can play any card. Scoring cards cannot be played in the first trick&lt;/sup&gt;&lt;/li&gt;&#xA;&lt;li&gt;The player that played the highest valued card of the same suit as the leading card of that trick takes that trick. E.G.: in &lt;code&gt;2C AD KC 5C&lt;/code&gt;, the king of clubs takes the first trick. In &lt;code&gt;2H KS AS QS&lt;/code&gt; the leading player takes the trick (and fourteen points).&lt;/li&gt;&#xA;&lt;li&gt;&lt;sup&gt;The objective of the game is to end up with the fewest points possible. A player gets one point per each hearts taken, and 13 poins for the queen of spades.&lt;/sup&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;You may assume&lt;/strong&gt; that the deck of cards is valid (exactly one of each card) and that the two of clubs has been lead. You may also assume that the rules concerning the order of play and trick taking have been followed. &lt;strong&gt;You may not assume&lt;/strong&gt; the rules concerning which cards can be played when have been followed. Heck, you don't even know that &lt;em&gt;I&lt;/em&gt; haven't been cheating. Because a player may have been dealt nothing but hearts, you may not even assume only non-scoring cards have been played in the first trick (if everyone on the planet plays 100 games in their life, this may realistically happen to someone).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Should I loosen the I/O requirements? How much?&lt;br&gt;&#xA;Formatting advice? Which parts (if any) should I trim down? What needs to be clarified?&lt;br&gt;&#xA;Anything else?&lt;/p&gt;&#xA;" OwnerUserId="7209" LastActivityDate="2015-07-13T10:32:48.033" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5555" PostTypeId="2" ParentId="2140" CreationDate="2015-07-13T16:47:36.153" Score="0" Body="&lt;h1&gt;Return of the 5318008&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A week or so ago, I posted the challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/51871/5318008-fun-with-calculators&quot;&gt;5318008&lt;/a&gt;, with a massive reaction. Now, I want you to do the same again but with musical chords.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a word list, you must output a list of words which can be formed using musical chords. However, the word must also sound good too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The chords which you may use are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A B C D E F G&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;These are all the major chords without the flat/sharp chords.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A word will sound good if all of its letters are within the same key. All the chord progressions which you must concern are listed below:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;A major&lt;/strong&gt;: A D E G&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;B minor&lt;/strong&gt;: D G A&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;D major&lt;/strong&gt;: D G A&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;E major&lt;/strong&gt;: E A B D&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Other progressions such as G or C major could not make any word because all of the major chords (which were not sharps or flats) were consonants.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For my tests, I used the UNIX wordlist, gathered by typing:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ln -s /usr/dict/words w.txt&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or alternatively, get it &lt;a href=&quot;https://raw.githubusercontent.com/eneko/data-repository/master/data/words.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are some uppercase letters in the dictionary, so make all of the letters in all of the words in the dictionary lowercase.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winning&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The shortest code to output a list of words wins.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.863" LastActivityDate="2015-07-13T20:59:03.100" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="5556" PostTypeId="2" ParentId="2140" CreationDate="2015-07-13T17:29:12.757" Score="2" Body="&lt;h1&gt;Translate &lt;a href=&quot;http://esolangs.org/wiki/Treehugger&quot; rel=&quot;nofollow noreferrer&quot;&gt;Treehugger&lt;/a&gt; to &lt;a href=&quot;http://esolangs.org/wiki/Brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;BrainF**k&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; (?)&lt;/p&gt;&#xA;&lt;h3&gt;Overview&lt;/h3&gt;&#xA;&lt;p&gt;This problem deals with two esoteric programming languages that I will briefly describe for completeness.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Brainfuck&lt;/strong&gt; is a language that has only 8 commands. Imagine a tape of values (generally 0-255) stretching infinitely to the right, initialized to zero, and an instruction pointer &lt;code&gt;P&lt;/code&gt; pointing to the first element:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;|-----|-----|-----|-----|-----...&#xA;|  0  |  0  |  0  |  0  |  ...&#xA;|-----|-----|-----|-----|-----...&#xA;   ^&#xA;   P&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The eight commands effect the pointer and tape in the following way:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+ ===== increment the value that `P` currently points to&#xA;- ===== decrement the value that `P` currently points to&#xA;, ===== read a byte from stdin into the location that `P` points to&#xA;. ===== output the value that `P` points to as an ASCII character&#xA;&amp;gt; ===== move `P` one cell to the right&#xA;&amp;lt; ===== move `P` one cell to the left&#xA;[ ===== if the value pointed to by `P` is zero, jump past the matching ] ( while(*P){ )&#xA;] ===== if the value pointed to by `P` is non-zero, jump to the preceding [ ( } )&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Some finer points, for the purposes of this question:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Adding one to 255 yields 0, and decrementing 0 yields 255.&lt;/li&gt;&#xA;&lt;li&gt;Moving left off of the tape causes the program to abruptly halt.&lt;/li&gt;&#xA;&lt;li&gt;All &lt;code&gt;[&lt;/code&gt; must be matched with a single &lt;code&gt;]&lt;/code&gt;. They may be nested.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Treehugger&lt;/strong&gt; is a language derived from Brainfuck, but differs greatly in how memory is stored. Instead of viewing memory as a tape, view memory as a binary tree that expands infinitely downward:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;       P&#xA;       v&#xA;       0&#xA;  0---/ \---0&#xA; / \       / \&#xA;0   0     0   0&#xA;.   .     .   .&#xA;.   .     .   .&#xA;.   .     .   .&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;P&lt;/code&gt; begins at the top of the tree, and again all values are initialized as 0. Most of the commands are exactly the same as corresponding Brainfuck commands, but there are two differences:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt; ===== move P down the left branch of the tree once&#xA;&amp;gt; ===== move P down the right branch of the tree once&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;There is also one new command:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;^ ===== move P one node up the tree&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;It is simple to translate Brainfuck to Treehugger by replacing every &lt;code&gt;&amp;lt;&lt;/code&gt; with a &lt;code&gt;^&lt;/code&gt;. Translating Treehugger to Brainfuck, however, is far more difficult.&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;Your program or function will take in a list of characters from &lt;code&gt;+-&amp;lt;&amp;gt;^,.[]&lt;/code&gt;, representing a complete Treehugger program.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may assume that the input ends in some terminating character, like a newline or EOF.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that, other than the optional terminating character, every character is one of the 9 commands.&lt;/li&gt;&#xA;&lt;li&gt;The Treehugger program will have balanced &lt;code&gt;[&lt;/code&gt; and &lt;code&gt;]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The Treehugger program will not attempt to move up one node from the top of the tree at any point.&lt;/li&gt;&#xA;&lt;li&gt;The Treehugger program will never contain a &lt;code&gt;,&lt;/code&gt; character inside of a &lt;code&gt;[]&lt;/code&gt; loop. The program will always take a finite, known number of input bytes.&lt;/li&gt;&#xA;&lt;li&gt;The Treehugger program will terminate for all inputs.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Input must be taken as a string of characters through stdin or a function argument.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;Your output should be a functioning Brainfuck program that takes the same number of inputs and provides the same output as the corresponding Treehugger program. Brackets must be balanced, and the code must never move left off of the tape. Your Brainfuck program must terminate.&lt;/p&gt;&#xA;&lt;h3&gt;Rules and Scoring&lt;/h3&gt;&#xA;&lt;p&gt;Your score for this challenge is:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;Length of your code + 0.1 * the length of each test case's output&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Lowest score wins!&lt;/p&gt;&#xA;&lt;p&gt;Standard Loopholes are disallowed.&lt;/p&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;p&gt;&lt;em&gt;Coming soon to a challenge near you...&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Is this interesting?&lt;/p&gt;&#xA;&lt;p&gt;Too easy/hard?&lt;/p&gt;&#xA;&lt;p&gt;Is the scoring system appropriate?&lt;/p&gt;&#xA;" OwnerUserId="31054" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-07-13T17:29:12.757" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5558" PostTypeId="2" ParentId="2140" CreationDate="2015-07-14T02:41:15.183" Score="1" Body="&lt;h1&gt;LindenMASM&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;LindenMASM is an Assembly-like programming language which can be used to generate images from Lindenmayer systems. Lindenmayer systems are very interesting in the fact that they can provide a rudimentary method of generating fractals, such as a Sierpinski triangle. They are also interestingly able to mimic nature very closely for some reason, which can be seen in the below image. You will be implementing a LindenMASM interpreter in a language of your choice.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Understanding Lindenmayer Systems&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You should check out the &lt;a href=&quot;https://en.wikipedia.org/wiki/L-system&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia page&lt;/a&gt; for a more detailed overview of Lindenmayer systems, as I will simply describe the process of actually using a system. I will be referring to a turtle in this explanation. A turtle is simply the device by which an L-system is drawn. We will use a dragon curve L-system as an example.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Firstly, we need to consider the variables we will be using. In the case of an L-system, a variable is used to control evolution, and does not actually correspond to any movement. We will need two for this, so let's call &lt;code&gt;X&lt;/code&gt; and &lt;code&gt;Y&lt;/code&gt; our variables. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Next, we would define our constants. In most L-Systems, the character &lt;code&gt;F&lt;/code&gt; refers to moving forward, &lt;code&gt;-&lt;/code&gt; turns left and &lt;code&gt;+&lt;/code&gt; turns right. We will follow these conventions here, and specify that &lt;code&gt;-&lt;/code&gt; turns the turtle 90 degrees left and &lt;code&gt;+&lt;/code&gt; turns the pointer 90 degrees right.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After this, the axiom needs to be defined. This is the starting point of the system, i.e. what it looks like after 0 iterations. In our case, we will set it to &lt;code&gt;FX&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, we need to define some rules. Rules are applied by going through each character of the axiom, and if one of them matches a rule, replace it with the defined set of instructions. Our rules are that &lt;code&gt;X -&amp;gt; X+YF+&lt;/code&gt; and &lt;code&gt;Y -&amp;gt; -FX-Y&lt;/code&gt;. I will show a quick evolution of steps, so you can see how these rules are applied.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;n=0&lt;/code&gt; - &lt;code&gt;FX&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;n=1&lt;/code&gt; - &lt;code&gt;FX+YF+&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;n=2&lt;/code&gt; - &lt;code&gt;FX+YF++-FX-YF+&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;n=3&lt;/code&gt; - &lt;code&gt;FX+YF++-FX-YF++-FX+YF+--FX-YF+&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;n=4&lt;/code&gt; - &lt;code&gt;FX+YF++-FX-YF++-FX+YF+--FX-YF++-FX+YF++-FX-YF+--FX+YF+--FX-YF+&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;When this is interpreted, however, since &lt;code&gt;X&lt;/code&gt; and &lt;code&gt;Y&lt;/code&gt; don't control movement, the interpreted steps for &lt;code&gt;n=4&lt;/code&gt; would look like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;F+F++-F-F++-F+F+--F-F++-F+F++-F-F+--F+F+--F-F+&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Simplified..&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;F+F+F-F+F+F-F-F+F+F+F-F-F+F-F-F+&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Which would result in the following drawing:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/qznjX.png&quot; alt=&quot;n=4 Dragon Curve&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Syntax&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There are only a few keywords available in LindenMASM which you will need to implement.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;STT&lt;/code&gt; - Begins every LindenMASM file.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;AXI $&lt;/code&gt; - Sets the axiom (initial state) of the system.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;$&lt;/code&gt; is a series of commands/variables/constants, ranging from the built-ins plus any user-defined functions.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;DEG $&lt;/code&gt; - Sets the degree of which all turns will follow.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;$&lt;/code&gt; will be a integer or float between 0 and 359, inclusive. The default value is 90 otherwise.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;MOV $&lt;/code&gt; - Sets the move distance of which all position adjustments will follow.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;$&lt;/code&gt; will be a integer or float between 1 and 100, inclusive. The default value is 10 otherwise.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;INC $&lt;/code&gt; - Sets the number of iterations the generation should go through.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;$&lt;/code&gt; will be a number between 0 and 30, inclusive. The default value is 0 otherwise. &lt;em&gt;(a value of 0 means just the axiom is displayed).&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;SET $ #&lt;/code&gt; - Sets a constant &lt;code&gt;$&lt;/code&gt; to a specified command &lt;code&gt;#&lt;/code&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;$&lt;/code&gt; will be a letter between A and Z, inclusive, and will be uppercase.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;#&lt;/code&gt; will either be a 0 or a 1, where a 0 corresponds to the constant being one that draws forward, and a 1 corresponds to the constant being one that moves fowards.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;RPL $ #&lt;/code&gt; - On every iteration, variable/constant &lt;code&gt;$&lt;/code&gt; will be replaced with the command/variable/constant string &lt;code&gt;#&lt;/code&gt;.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;$&lt;/code&gt; will be a letter between A and Z, inclusive, and uppercase. It does not need to be &lt;code&gt;SET&lt;/code&gt; to be replaced.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;#&lt;/code&gt; is a string of commands/variables/constants that &lt;code&gt;$&lt;/code&gt; should be replaced with.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;END&lt;/code&gt; - Ends every LindenMASM file.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Each keyword should be placed on a new line. Your program should fail parsing if (a) The file does not start with &lt;code&gt;STT&lt;/code&gt; or does not end with &lt;code&gt;END&lt;/code&gt;. Your program should assume that the rest of the keywords will have proper arguments attached to them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Below is a list of all of the regular commands that cannot be defined by the user:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;+&lt;/code&gt; - Rotates the pointer to the right &lt;code&gt;DEG&lt;/code&gt; degrees.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;-&lt;/code&gt; - Rotates the pointer to the left &lt;code&gt;DEG&lt;/code&gt; degrees.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[&lt;/code&gt; - Saves the pointer's coordinates and heading to a list.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;]&lt;/code&gt; - Pops the last value of a list and sets the pointer's coordinates and heading to that.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I will give 5 examples, each of which will have detailed information on the pattern, plus a link to have it visualized online.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Fractal Tree&lt;/strong&gt; - &lt;code&gt;n=6, axiom=X, Θ=25, X-&amp;gt;F-[[X]+X]+F[+FX]-X, F-&amp;gt;FF&lt;/code&gt; (&lt;a href=&quot;https://gist.github.com/kade-robertson/96da72b13af6b1bf736c&quot; rel=&quot;nofollow noreferrer&quot;&gt;Test Online&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;STT&#xA;AXI X&#xA;DEG 25&#xA;MOV 10&#xA;INC 6&#xA;SET F 0&#xA;RPL X F-[[X]+X]+F[+FX]-X&#xA;RPL F FF&#xA;END&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/yb8ZI.png&quot; alt=&quot;Fractal Tree&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Gosper Curve&lt;/strong&gt; - &lt;code&gt;n=4, axiom=F, Θ=60, F-&amp;gt;F+G++G-F--FF-G+, G-&amp;gt;-F+GG++G+F--F-G&lt;/code&gt; (&lt;a href=&quot;https://gist.github.com/kade-robertson/26011af7f84a9fb0bc8f&quot; rel=&quot;nofollow noreferrer&quot;&gt;Test Online&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;STT&#xA;AXI F&#xA;DEG 60&#xA;INC 4&#xA;SET F 0&#xA;SET G 0&#xA;RPL F F+G++G-F--FF-G+&#xA;RPL G -F+GG++G+F--F-G&#xA;END&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/CQdvV.png&quot; alt=&quot;Gosper Curve&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Koch Variant&lt;/strong&gt; - &lt;code&gt;n=4, axiom=F-F-F-F, Θ=90, F-&amp;gt;FF-F--F-F&lt;/code&gt; (&lt;a href=&quot;https://gist.github.com/kade-robertson/30de2069b8d234b0f352&quot; rel=&quot;nofollow noreferrer&quot;&gt;Test Online&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;STT&#xA;INC 4&#xA;RPL F FF-F--F-F&#xA;SET F 0&#xA;AXI F-F-F-F&#xA;END&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/F0Llj.png&quot; alt=&quot;Koch Variant&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sierpinski Triangle&lt;/strong&gt; - &lt;code&gt;n=7, axiom=F-G-G, Θ=120, F-&amp;gt;F-G+F+G-F, G-&amp;gt;GG&lt;/code&gt; (&lt;a href=&quot;https://gist.github.com/kade-robertson/a1cc46055af2dc261d9c&quot; rel=&quot;nofollow noreferrer&quot;&gt;Test Online&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;STT&#xA;RPL G GG&#xA;RPL F F-G+F+G-F&#xA;DEG 120&#xA;AXI F-G-G&#xA;SET F 0&#xA;SET G 0&#xA;INC 7&#xA;END&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/lgSSK.png&quot; alt=&quot;Sierpinski Triangle&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Dragon Curve&lt;/strong&gt; - &lt;code&gt;n=12, axiom=FX, =90, X-&amp;gt;X+YF+, Y-&amp;gt;-FX-Y&lt;/code&gt; (&lt;a href=&quot;https://gist.github.com/kade-robertson/71352f591029788c0031&quot; rel=&quot;nofollow noreferrer&quot;&gt;Test Online&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;STT&#xA;INC 12&#xA;DEG 90&#xA;AXI FX&#xA;SET F 0&#xA;RPL X X+YF+&#xA;RPL Y -FX-Y&#xA;END&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/9Urz3.png&quot; alt=&quot;Dragon Curve&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Aside from the examples given above, your code should support the following test cases as well:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;SET F 0&#xA;AXI FF&#xA;RPL F F-F+F&#xA;END&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output: &lt;code&gt;Error: No STT at beginning.&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;STT&#xA;SET F 0&#xA;AXI FF&#xA;RPL F F-F+F&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output: &lt;code&gt;Error: No END at ending.&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your program should output the resulting image by outputting an image or by drawing to the screen (e.x. turtle graphics). If you would like to check out a Python 3 example, here is a Github link to &lt;a href=&quot;http://kade-robertson.github.io/pylasma&quot; rel=&quot;nofollow noreferrer&quot;&gt;pylasma&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so least number of bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="38417" LastEditorUserId="38417" LastEditDate="2015-07-14T18:44:25.127" LastActivityDate="2015-07-14T18:44:25.127" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="5560" PostTypeId="1" CreationDate="2015-07-14T16:15:47.877" Score="2" ViewCount="171" Body="&lt;p&gt;I'm thinking of starting answering questions in XSLT, but I don't know what the standard method of input would be?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm thinking of an XML file like so:&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;?xml version=&quot;1.0&quot; encoding=&quot;ISO-8859-1&quot;?&amp;gt;&#xA;&amp;lt;input&amp;gt;Put your input here&amp;lt;/input&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And then you access the input by using the following code:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;?xml version=&quot;1.0&quot; encoding=&quot;ISO-8859-1&quot;?&amp;gt;&#xA;&amp;lt;xsl:stylesheet version=&quot;1.0&quot; xmlns:xsl=&quot;http://www.w3.org/1999/XSL/Transform&quot;&amp;gt;&#xA;&#xA;&amp;lt;xsl:template match=&quot;/&quot;&amp;gt;&#xA;    &amp;lt;xsl:value-of select=&quot;input&quot; /&amp;gt;&#xA;&amp;lt;/xsl:template&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;What do the rest of you think?&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2015-08-13T16:50:07.057" Title="How to take input in XSLT?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5561" PostTypeId="2" ParentId="5560" CreationDate="2015-07-14T16:27:08.917" Score="1" Body="&lt;p&gt;The option you listed above would work, however we also accept functions, so either of the following is valid as well:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;?xml version=&quot;1.0&quot; encoding=&quot;ISO-8859-1&quot;?&amp;gt;&#xA;&amp;lt;xsl:stylesheet version=&quot;1.0&quot; xmlns:xsl=&quot;http://www.w3.org/1999/XSL/Transform&quot;&amp;gt;&#xA;&#xA;&amp;lt;!-- The following is a named template, which acts like a function --&amp;gt;&#xA;&amp;lt;xsl:template name=&quot;t&quot;&amp;gt;&#xA;    &amp;lt;xsl:param name=&quot;p&quot;&amp;gt;&#xA;&amp;lt;/xsl:template&amp;gt;&#xA;&#xA;&amp;lt;!-- The following is actual function in XSLT. --&amp;gt;&#xA;&amp;lt;xsl:function name=&quot;f&quot;&amp;gt;&#xA;    &amp;lt;xsl:param name=&quot;p&quot;&amp;gt;&#xA;&amp;lt;/xsl:function&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As a side note, matched templates (as opposed to named templates) can also accept parameters, but requires more code to set them up.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2015-07-14T16:37:16.213" LastActivityDate="2015-07-14T16:37:16.213" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5567" PostTypeId="2" ParentId="2140" CreationDate="2015-07-15T21:07:04.340" Score="-3" Body="&lt;h1&gt;Represent a Number in the Strangest Way You Can Think Of.. while staying under 8 unique characters&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your goal is to represent some numbers in the strangest way possible.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The result must be a number that can be used in the programming language like any other ordinary number. For instance, &lt;code&gt;&amp;lt;my expression&amp;gt; + 3&lt;/code&gt; should return 3 more than the value of &lt;code&gt;&amp;lt;my expression&amp;gt;&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The code must be under 20 kilobytes. That's a rather large size for a number so you should be all set.&lt;/li&gt;&#xA;&lt;li&gt;The expression must have under 8 unique characters! The length of it can be as long you want, just keep it under 8 unique characters. &lt;code&gt;aaaaaaaaaaaaaaaaaa&lt;/code&gt; is valid (if it works in the programming language) but &lt;code&gt;abcdefghijklm&lt;/code&gt; isn't valid because it uses 8 or more unique characters.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Guidelines:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The goal here is to represent a number in the strangest and most interesting way possible, so if I ask you to represent the number &lt;code&gt;35&lt;/code&gt; it would be a good idea to respond with something more interesting than &lt;code&gt;35&lt;/code&gt; or &lt;code&gt;12 + 23&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;This isn't a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;! Feel free to make your code as long as you want, so long as it's under 20 kilobytes. Fancy code can look nice!&lt;/li&gt;&#xA;&lt;li&gt;The code doesn't need to support decimals (floats) but if it does, it will get 10 extra points (see below).&lt;/li&gt;&#xA;&lt;li&gt;The code also doesn't need to support negative numbers (for instance &lt;code&gt;-37&lt;/code&gt;) but if it does, it will get 10 extra points (see below).&lt;/li&gt;&#xA;&lt;li&gt;Try to make your post follow the below:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Post format:&lt;/h3&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Language&lt;/h1&gt;&#xA;  &#xA;  &lt;p&gt;Description&lt;/p&gt;&#xA;  &#xA;  &lt;h3&gt;0&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;h3&gt;1&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;h3&gt;30&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;h3&gt;108&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;h3&gt;1337&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;h3&gt;1234567890&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;h3&gt;3.1415 [10 bonus points if you can get this!]&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;h3&gt;-25 [10 bonus points if you can get this!]&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;h2&gt;Bonus numbers:&lt;/h2&gt;&#xA;  &#xA;  &lt;p&gt;...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The points is equivalent to the number of votes on the answer plus 10 if it supports decimals with 10 more points if it supports negative numbers. Whoever has the highest points is considered the current winner. Have fun!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is my first go at making a popularity contest so if you have any tips those would be appreciated.. :)&lt;/p&gt;&#xA;" OwnerUserId="41061" LastEditorUserId="41061" LastEditDate="2015-07-15T23:29:59.987" LastActivityDate="2015-07-15T23:29:59.987" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="5577" PostTypeId="2" ParentId="2140" CreationDate="2015-07-18T16:27:28.503" Score="0" Body="&lt;h1&gt;VSEPR Strikes Back!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(Note: I know that the VSEPR method fails sometimes, and that there are exceptional molecules. This is addressed in the scoring system, and otherwise the challenge is about the molecules which conform.)  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Most people who have taken an introductory chemistry course know about molecules, and (probably) the &lt;a href=&quot;https://en.wikipedia.org/wiki/VSEPR_theory&quot; rel=&quot;nofollow&quot;&gt;VSEPR theory&lt;/a&gt; of chemical bonding. Basically, the theory predicts the shape of a molecule given three main properties: the central atom A, the number of atoms bonded to &lt;em&gt;the central atom&lt;/em&gt; X, and the number of lone electron pairs E on the central atom. Applying the VSEPR theory is simply a matter of finding the values of X and E (A always has an implied value of 1, as we'll see). This is called the AXE method. For example, a molecule which has 1 lone pair and 3 atoms bonded to the main atom is AX&lt;sub&gt;3&lt;/sub&gt;E&lt;sub&gt;1&lt;/sub&gt;, which is the &lt;a href=&quot;https://en.wikipedia.org/wiki/Trigonal_pyramidal_molecular_geometry&quot; rel=&quot;nofollow&quot;&gt;trigonal pyramidal&lt;/a&gt; configuration.  &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your job is, given a covalent chemical compound, to output the geometrical shape of the molecule inputted. &lt;em&gt;But wait!&lt;/em&gt; exclaim the exasperated programmers, &lt;em&gt;you can't expect us to input all of the molecular data for every element!&lt;/em&gt; Of course we can, but I'm not feeling particularly masochistic today, so born was the scoring system below.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input is any molecule, such as &lt;code&gt;CO2&lt;/code&gt; or &lt;code&gt;HgCl2&lt;/code&gt;, and the output should be the name of the shape and NOT the AXE form. Ions should have their charge put in parenthesis directly after the ion, such as CO3(2-) or NH4(1+). 1- and - (and 1+ and +) are all acceptable.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;About the central atom A&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In most cases, the central atom will be apparent. It usually has no subscript in the chemical formula: the C in &lt;code&gt;CO&lt;/code&gt;&lt;sub&gt;&lt;code&gt;2&lt;/code&gt;&lt;/sub&gt; is the central atom, for example. In a few cases, though, you might face compounds like &lt;a href=&quot;https://en.wikipedia.org/wiki/Ethylene&quot; rel=&quot;nofollow&quot;&gt;ethelyne&lt;/a&gt; (C&lt;sub&gt;2&lt;/sub&gt;O&lt;sub&gt;4&lt;/sub&gt;), in which no clear atom is the central one. In this case, it is worth noting that such compounds are usually symmetrical, and considering any carbon to be the central atom will do.  &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring System&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The base score is the number of bytes the program takes.  &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;There is a minimum of 6 elements to be implemented for input; every 5 extra you add multiplies your score by 0.9.&lt;/li&gt;&#xA;&lt;li&gt;Multiply your score by 0.8 if you can make your code work for ions.&lt;/li&gt;&#xA;&lt;li&gt;Multiply your score by 0.9 if you can detect ionic compounds (VSEPR only works for covalent compounds) and reject them accordingly.  &lt;/li&gt;&#xA;&lt;li&gt;Multiply your score by 0.8 if you also output the bond angles.&lt;/li&gt;&#xA;&lt;li&gt;There are certain classes of molecules which VSEPR fails to predict correctly, due to various reasons. (Check the first link in the post for the section on the exceptions.) Multiply your code by 0.9 per class if it returns those correctly.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The parts in brackets are optional bonuses from above.  &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;CO&lt;sub&gt;2&lt;/sub&gt;: CO2 -&gt; linear [180*]&lt;br&gt;&#xA;  HgCl&lt;sub&gt;2&lt;/sub&gt;: HgCl2 -&gt; linear [180*]&lt;br&gt;&#xA;  H&lt;sub&gt;2&lt;/sub&gt;O: H2O -&gt; bent [104.5*]&lt;br&gt;&#xA;  [CO&lt;sub&gt;3&lt;/sub&gt;&lt;sup&gt;2-&lt;/sup&gt;: CO3(2-) -&gt; trigonal planar 120*]&lt;br&gt;&#xA;  BrF: BrF&lt;sub&gt;3&lt;/sub&gt; -&gt; T-shaped [90*]&lt;br&gt;&#xA;  [NaCl: NaCl -&gt; Ionic compound]&lt;br&gt;&#xA;  XeF&lt;sub&gt;4&lt;/sub&gt;: XeF4 -&gt; square planar [90*]  &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Notes:&lt;br&gt;&#xA; - The bonding patterns are not valid when the central atom is a transition metal (so don't do that.).&lt;br&gt;&#xA; - Standard loopholes apply.  &lt;/p&gt;&#xA;" OwnerDisplayName="user42079" LastEditorDisplayName="user42079" LastEditDate="2015-07-19T10:32:26.440" LastActivityDate="2015-07-19T10:32:26.440" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5578" PostTypeId="1" CreationDate="2015-07-19T12:55:27.847" Score="0" ViewCount="40" Body="&lt;p&gt;Should I be marking them as I find answers that are better than prior ones? I think that would give people a lot of unnecessary notifications. Or maybe I should check back in 2 days? 3 days? a week?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there some sorta guideline on this?&lt;/p&gt;&#xA;" OwnerUserId="16449" LastActivityDate="2015-07-19T12:55:27.847" Title="What is an acceptable time to mark a question as resolved?" Tags="|discussion|asking-questions|" AnswerCount="0" CommentCount="1" ClosedDate="2015-07-19T13:06:26.123" ContentLicense="CC BY-SA 3.0" />
  <row Id="5580" PostTypeId="2" ParentId="2140" CreationDate="2015-07-20T11:59:31.293" Score="2" Body="&lt;h1&gt;Sort a CSV list by key...imperfectly.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot;&gt;sorting&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anything I missed and/or overlooked here? I'm pretty sure I closed up most of the holes here. Also, what is there that could use some improvement?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another question: would this be better tagged as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You are working for some company you can't stand, two-week notice already turned in, and you've just been tasked with sorting all the CSVs the company has gathered over the years. This doesn't sound like much, except your boss, whom you also don't like, has demanded you implement your own sort. He doesn't care about Big-O whatever (he has never even heard of the term), but he just wants it done. You want to get back at him for making you do this, so you want to make that sort imperfect. At least you know he won't have time to check it until you're gone.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Objective&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a program that sorts a CSV table (incorrectly), by key.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A correct program for purposes of this challenge:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;doesn't &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/14668&quot;&gt;use one of the tried-and-false, unfunny techniques&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;takes two arguments (in order): the key to sort by, and optionally a separator, defaulting to a comma (&lt;code&gt;,&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;takes the CSV via standard input, in the following format:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each row is separated by a Unix-style line feed.&lt;/li&gt;&#xA;&lt;li&gt;Each entry within each row is delimited by the separator.&lt;/li&gt;&#xA;&lt;li&gt;Each entry is unquoted/etc. It is solely delimited by the separator.&lt;/li&gt;&#xA;&lt;li&gt;Each entry may be assumed to not contain an instance of the separator or a newline.&lt;/li&gt;&#xA;&lt;li&gt;The first row indicates the key names. The successive rows are the data that needs sorted, by key&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;emits the sorted CSV via standard output.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The emitted data &lt;em&gt;must&lt;/em&gt; also adhere to the above format, including the separator. It &lt;em&gt;must&lt;/em&gt; be syntactically correct.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;em&gt;looks completely innocent, despite being completely and totally wrong.&lt;/em&gt;&lt;/strong&gt; That's the underhanded spirit.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Please don't use &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1657/14668&quot;&gt;Unicode lookalikes&lt;/a&gt;. It's not funny nor original, especially after seeing it multiple times on a single question.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In this case, the values for the key &lt;code&gt;key&lt;/code&gt; are 1, 2, and 3.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;foo,key,value&#xA;spammer,1,32nefr2u34&#xA;ball,2,304u23rne2&#xA;blarger,3,32o4u3jnk4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Invariants&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input CSV is assumed to be correct, including each row having the same number of entries. At least they weren't &lt;em&gt;made&lt;/em&gt; by such air-headed people.&lt;/li&gt;&#xA;&lt;li&gt;The entries may have varying lengths.&lt;/li&gt;&#xA;&lt;li&gt;The associated values for the key is assumed to be a float (decimal not required) in textual form, base 10.&lt;/li&gt;&#xA;&lt;li&gt;The list may vary in length.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Requirements&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;At least 1% of the list must vary from the &quot;correct&quot; output every single time. This may mean entries that are out of order, lost, or corrupted. This may also include entire columns going missing (in which 100% is &quot;incorrect&quot;).&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is only required when there are at least 4 entries in the input.&lt;/li&gt;&#xA;&lt;li&gt;The keys themselves are not counted as part of the list, but they don't necessarily have to remain intact.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;It must print at least 50% of the data it took in, but more than 100% of the original is permitted.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;As a special case, empty &lt;code&gt;stdin&lt;/code&gt; allows empty &lt;code&gt;stdout&lt;/code&gt;, and input just consisting of the headers may simply print just headers coming out.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The program must have no other external side effects other than what is required to do the above.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Other information&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The sorting algorithm is up to the implementation. It doesn't matter, as long as it sorts, the sort is stable, and the algorithm's complexity is bounded (i.e. no &lt;a href=&quot;https://en.wikipedia.org/wiki/Bogosort&quot; rel=&quot;nofollow noreferrer&quot;&gt;Bogosort&lt;/a&gt;, infinite loops, etc.).&lt;/li&gt;&#xA;&lt;li&gt;No other features may be added, including a help message.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;foo,key,value&#xA;ball,5.2,304u23rne2&#xA;spammer,1,32nefr2u34&#xA;blarger,3.1,32o4u3jnk4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output (correct):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;foo,key,value&#xA;spammer,1,32nefr2u34&#xA;blarger,3.1,32o4u3jnk4&#xA;ball,5.2,304u23rne2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output (passes this challenge):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;foo,key,value&#xA;spammer,1,32nefr2u34&#xA;ball,5.2,304u23rne2&#xA;blarger,3.1,32o4u3jnk4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The person with the highest number of votes wins!&lt;/p&gt;&#xA;" OwnerUserId="14668" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2015-07-22T04:09:39.767" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5582" PostTypeId="1" AcceptedAnswerId="5588" CreationDate="2015-07-20T18:12:10.573" Score="18" ViewCount="1055" Body="&lt;p&gt;There's a lot to remember to include when writing a challenge for this site. What are some things that are easy to forget?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1280&quot;&gt;Return to FAQ index&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="41912" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2020-02-24T02:26:09.397" Title="Things to consider when creating a challenge" Tags="|discussion|faq|asking-questions|challenge-quality|" AnswerCount="6" CommentCount="3" CommunityOwnedDate="2015-07-20T20:16:59.767" ContentLicense="CC BY-SA 3.0" />
  <row Id="5584" PostTypeId="2" ParentId="2140" CreationDate="2015-07-20T19:51:15.383" Score="-2" Body="&lt;h1&gt;Wrong tool for the task&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Task&lt;/h3&gt;&#xA;&lt;p&gt;Write two full programs in the same programming language that solve the following two tasks:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Read two positive integers from STDIN and print their sum to STDOUT.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Read two positive integers from STDIN and print their product to STDOUT.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Additional details:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Given enough time and memory, your programs has to support arbitrarily large integers.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;All integers (input and output) use standard decimal notation, have no leading zeroes and are followed by a single linefeed.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;p&gt;The first task is code golf, so your objective is to make your program as &lt;em&gt;short&lt;/em&gt; as possible.&lt;/p&gt;&#xA;&lt;p&gt;The second task is code bowling, so your objective is to make your program as &lt;em&gt;long&lt;/em&gt; as possible.&lt;/p&gt;&#xA;&lt;p&gt;Your score is defined as follows:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/rQJHb.png&quot; alt=&quot;score formula&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;The highest score wins!&lt;/p&gt;&#xA;&lt;h3&gt;Robbing a language&lt;/h3&gt;&#xA;&lt;p&gt;There's a catch! Only the submission with the &lt;em&gt;shortest&lt;/em&gt; program in a particular language will be considered valid for task 2, so there can only be one valid answer per language.&lt;/p&gt;&#xA;&lt;p&gt;This means that you cannot deliberately write a huge program for task 2; you actually have to pick the &amp;quot;wrong tool&amp;quot; for the task.&lt;/p&gt;&#xA;&lt;p&gt;Additional details:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Task 1 exists merely to provide the proper denominator for the score (and robbers have no moral anyway), so byte-per-byte copies of somebody's program for task 1 are allowed.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If two answers use the same language and have programs of the same length for task 2, the answer that achieved that length first will be considered valid.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If somebody invalidated your answer, you may attempt to golf your answer&#xA;to revalidate yours and invalidate his.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-07-20T20:20:52.233" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5585" PostTypeId="1" CreationDate="2015-07-20T21:12:43.383" Score="20" ViewCount="751" Body="&lt;p&gt;The tag wiki for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot;&gt;programming puzzle&lt;/a&gt; says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A programming puzzle includes a goal, a partially completed program,&#xA;  and rules outlining how the program can be modified. The program is&#xA;  specifically designed to make achieving the goal difficult. An answer&#xA;  to a programming puzzle takes the program and modifies it only in ways&#xA;  specified in the rules, so that the goal is achieved.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In its basic form, a programming puzzle is just a puzzle, like &lt;a href=&quot;https://codegolf.stackexchange.com/q/12188/20260&quot;&gt;this one&lt;/a&gt;. An answer either solves it or it doesn't.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, we require &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/305/20260&quot;&gt;an objective winning criterion&lt;/a&gt; to select a single winner. It's not enough to judge a submission correct, it must be possible to compare submissions against each other.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some programming puzzles achieve this with an additional judging criterion, like &lt;a href=&quot;https://codegolf.stackexchange.com/q/20654/20260&quot;&gt;a popularity contest&lt;/a&gt; to let voters decide on the best solution, or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/28610/reach-catch-when-everything-in-the-try-block-is-caught-already&quot;&gt;as code golf&lt;/a&gt; to reward efficient solutions. But, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle+-code-golf+-popularity-contest+-code-challenge&quot;&gt;about half&lt;/a&gt; are simply puzzles, in apparent violation of the policy. Moreover, new users who read the tag wiki are led to believe programming puzzles can stand in their own right.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What should we do about this?&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2016-02-28T16:31:36.853" Title="Are pure programming puzzles on topic?" Tags="|discussion|policy|winning-criteria|scope|" AnswerCount="5" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5586" PostTypeId="2" ParentId="2140" CreationDate="2015-07-20T23:27:08.693" Score="2" Body="&lt;h1&gt;Proposed King-of-the-Hill: Synchronous Bughouse Chess960&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ai-player&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ai-player&amp;#39;&quot; rel=&quot;tag&quot;&gt;ai-player&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot;&gt;chess&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/board-game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;board-game&amp;#39;&quot; rel=&quot;tag&quot;&gt;board-game&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have an idea for what I think could be a fun and somewhat different KOTH contest.  However, before I put in the work writing explicitly detailed instructions and writing/deploying a test server, I want to make sure that (a) there will be sufficient interest to go through this effort and (b) the best way to design the contest and restrictions if people would like to play.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Chess960&quot; rel=&quot;nofollow noreferrer&quot;&gt;Chess960&lt;/a&gt; is a chess variant in which the starting positions of the back-rank pieces are randomized with constraints such that there are 960 possible starting positions.  &lt;a href=&quot;https://en.wikipedia.org/wiki/Bughouse_chess&quot; rel=&quot;nofollow noreferrer&quot;&gt;Bughouse chess&lt;/a&gt; is a team-based chess variant played asynchronously on two boards in which teammates hand the pieces they capture to their teammates to potentially drop on the board.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Synchronous Bughouse Chess960&lt;/strong&gt; (SBC960) is a chess variant I developed to combine these two variants and to impose some synchronization rules to make it suitable for a tournament.  Each of the two boards is set up independently using the rules of chess960 of the other (thus making for 921,600 overall starting positions).  Game play is organized into orderly rounds during which each player takes his turn in the following order: team 1 white, team 2 white, team 1 black, team 2 black.  On a player's turn, he may move a piece according to chess960's rules, drop a captured piece according to bughouse chess's rules, or delay.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each player starts the game with five delays.  When a player uses a delay, his opponent's next turn is skipped (at no cost to the opponent other than perhaps momentum).  Delays are legal moves.  Play continues until a player has no legal actions when his turn in the round comes up (no legal moves, no legal drops, and no remaining delays).  When that condition comes, the outcome of the game is determined by whether that player is in check.  If so, the team who has checked the player wins.  If not, the game ends in a draw.  For convenience, a position is only considered &quot;checkmate&quot; if a player is in check and has no legal moves left.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My KOTH tournament idea is to have players design AIs to play SBC960.  I think this game has some interesting possibilities because of the team-based play.  For example, rushing for the win on one's board might be a losing strategy for a player if the other team can checkmate his teammate faster.  It might also be viable for a player to allow himself to be checked toward checkmate if one's teammate can achieve checkmate before that player runs out of delays.  Also, the many starting positions makes it impractical for anyone to write an entry that uses opening libraries.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, the first question is:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;1) Would anyone be interested in participating in an SBC960 tournament?&lt;/strong&gt;  If at least four people would compete, I am willing to put in the work to get this together&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If people are willing to play, then I need to know the best way to structure the rules for the entries.  This entails the server-client interface (STDIN/STDOUT?  sockets with TCP/IP?), whether to permit people from designing AIs that think when it is not their turn, and whether I should have an official &quot;pre-play&quot; round so that AIs can learn how the other entries play.  I see the opportunity to make a KOTH that is different than most of the KOTHs on the site, but I want to know:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;2) What are people's recommendations for the best way to design the entry rules?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would appreciate any feedback.&lt;/p&gt;&#xA;" OwnerUserId="18496" LastEditorUserId="18496" LastEditDate="2015-07-21T14:58:28.940" LastActivityDate="2015-07-21T14:58:28.940" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5588" PostTypeId="2" ParentId="5582" CreationDate="2015-07-21T08:59:22.830" Score="20" Body="&lt;p&gt;Here's a list of details and considerations a good challenge writer should be aware of. I try to mentally go over these myself whenever I write a challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This list assumes the principal parts of the challenge - namely the problem statement, the scoring criterion, any examples, an introduction - are already present and fleshed out. Rather, it focuses on oft forgettable, loophole-closing particulars.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;What, if any, similar challenges already exist?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Has this challenge been done before?&lt;/li&gt;&#xA;&lt;li&gt;Is my challenge similar to another one? If another similar challenge has been done, consider changing the challenge creatively to be more distinct.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If there is input, how can it be taken?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Through &lt;a href=&quot;https://en.wikipedia.org/wiki/Standard_streams&quot; rel=&quot;nofollow noreferrer&quot;&gt;stdin&lt;/a&gt;?&lt;/li&gt;&#xA;&lt;li&gt;Through &lt;a href=&quot;https://en.wikipedia.org/wiki/Command-line_interface#Arguments&quot; rel=&quot;nofollow noreferrer&quot;&gt;command line arguments&lt;/a&gt;?&lt;/li&gt;&#xA;&lt;li&gt;If a file is part of the input, should the path to the file be taken, or can the raw file data be input? Can the name and location of the file be hardcoded?&lt;/li&gt;&#xA;&lt;li&gt;Can minor modifications be made to the specified input format? e.g. commas instead of spaces, parentheses instead of brackets, can trailing spaces or newlines be assumed?&lt;/li&gt;&#xA;&lt;li&gt;Is input guaranteed to come in the specified format? That is, have you accurately described what counts as input and what doesn't - including corner cases like empty strings or numbers larger than 32 bits?&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If there is output (there almost &lt;em&gt;always&lt;/em&gt; is), how should it be given?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Printed to &lt;a href=&quot;https://en.wikipedia.org/wiki/Standard_streams&quot; rel=&quot;nofollow noreferrer&quot;&gt;stdout&lt;/a&gt;? (usual default)&lt;/li&gt;&#xA;&lt;li&gt;Present in some variable by the end of the program?&lt;/li&gt;&#xA;&lt;li&gt;If a language does not have an &quot;stdout&quot; what should be done?&lt;/li&gt;&#xA;&lt;li&gt;If a file is part of the output, should it really be properly created and saved or does printing the raw file data suffice? If the former, can the name and location of the file be hardcoded?&lt;/li&gt;&#xA;&lt;li&gt;Can minor modifications be made to the specified output format? (I usually mention that an optional trailing newline is allowed because many print statements include one by default.)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is a full program required? A function? A code snippet?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a function is allowed, can it take the input like a full program or must the input be passed in via an argument?&lt;/li&gt;&#xA;&lt;li&gt;If a function is allowed, can the output be returned instead of printed?&lt;/li&gt;&#xA;&lt;li&gt;Do functions need to be named or are &lt;a href=&quot;https://en.wikipedia.org/wiki/Anonymous_function&quot; rel=&quot;nofollow noreferrer&quot;&gt;anonymous functions&lt;/a&gt; (lambdas) alright? (allowed by default)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What characters or &lt;a href=&quot;https://en.wikipedia.org/wiki/Character_encoding&quot; rel=&quot;nofollow noreferrer&quot;&gt;character encodings&lt;/a&gt; are allowed in the program?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Allowing any characters (all of &lt;a href=&quot;https://en.wikipedia.org/wiki/Unicode&quot; rel=&quot;nofollow noreferrer&quot;&gt;Unicode&lt;/a&gt;) is the norm but sometimes restricting things to &lt;a href=&quot;https://en.wikipedia.org/wiki/ASCII&quot; rel=&quot;nofollow noreferrer&quot;&gt;ASCII&lt;/a&gt; or &lt;a href=&quot;https://en.wikipedia.org/wiki/ASCII#ASCII_printable_code_chart&quot; rel=&quot;nofollow noreferrer&quot;&gt;printable ASCII&lt;/a&gt; makes more sense.&lt;/li&gt;&#xA;&lt;li&gt;If you restrict things to printable ASCII, you may want to also allow tabs and newlines.&lt;/li&gt;&#xA;&lt;li&gt;In some cases, the distinction between &lt;a href=&quot;https://en.wikipedia.org/wiki/Newline#Representations&quot; rel=&quot;nofollow noreferrer&quot;&gt;different types of newlines&lt;/a&gt; (&lt;code&gt;\r\n&lt;/code&gt;, &lt;code&gt;\n&lt;/code&gt;) can matter.&lt;/li&gt;&#xA;&lt;li&gt;Consider what characters should be allowed in the input and output as well.&lt;/li&gt;&#xA;&lt;li&gt;Remember that some languages like &lt;a href=&quot;http://www.dangermouse.net/esoteric/piet.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Piet&lt;/a&gt; don't technically use characters. (But don't exclude them for that without reason.)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you're making a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, or otherwise need to size up code, consider well whether counting bytes or characters is best. Bytes is the norm and usually the best choice, but characters are &lt;a href=&quot;https://codegolf.stackexchange.com/q/44680/26997&quot;&gt;sometimes&lt;/a&gt; appropriate.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Does your scoring criterion have a tiebreaker? Ties do happen, especially in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. A tie going to the earliest submission (with edits considered) is a good default but there are other options that can work in the right situations, e.g. &quot;tie goes to the answer with the fewest [most?] distinct characters&quot;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; and similar challenges, it's important to consider what kind of whitespace (usually spaces and newlines) may be present in the input and output.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Will the input be a rectangle padded with whitespace?&lt;/li&gt;&#xA;&lt;li&gt;Can the output have leading/trailing whitespace? How much?&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Are external libraries or specialized built-in functions allowed? Generic libraries such as ones that aid in basic image processing are usually acceptable, but sometimes it's important to exclude them. (Just note that some languages like &lt;a href=&quot;https://en.wikipedia.org/wiki/Mathematica&quot; rel=&quot;nofollow noreferrer&quot;&gt;Mathematica&lt;/a&gt; have built-ins for practically everything anyway.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What programming languages can submissions be written in? All languages are allowed by default and it's best to leave it that way unless you are writing a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question, or perhaps doing something with &lt;a href=&quot;https://blog.stackexchange.com/2014/09/introducing-runnable-javascript-css-and-html-code-snippets/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Stack Snippets&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Should the answers run within some time limit? If so, what are the specs of the computer the time limit applies to? If the programs really will be run and timed, whose computer will be used? (Yours?)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Can programs be non-deterministic, i.e. can they use (pseudo)random numbers or be dependent on the time of day they are run? This may be an important consideration for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king--of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king--of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king--of-the-hill&lt;/a&gt; submissions.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If your challenge involves extremely large strings or integers (like more that 64 bits can hold) or lots of memory (more than is on the computer), are constructs like &lt;a href=&quot;https://docs.oracle.com/javase/7/docs/api/java/math/BigInteger.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;BigInteger&lt;/a&gt; required or is it only important that the program would &quot;theoretically&quot; work, given enough resources?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If erroring programs are part of your challenge, be sure to define what you mean by an error.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do compile-time &lt;em&gt;and&lt;/em&gt; runtime errors count?&lt;/li&gt;&#xA;&lt;li&gt;What if the output was produced and then the program errored?&lt;/li&gt;&#xA;&lt;li&gt;Do compiler warnings count as errors? (Are there restrictions on the compiler settings to begin with?)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Can all or part of the problem to solve be done with the help of the web? Getting the output externally &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1062/26997&quot;&gt;is a standard loophole&lt;/a&gt;, but then again, some challenges implicitly require answers to access the web. It's best to clarify when appropriate.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; challenges, can the program be given itself as input or read itself with special commands? Usually the answer is 'no' but that's not an absolute rule.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Are comments (single or multi-line) in the code allowed? Usually the answer is 'yes' but &lt;a href=&quot;https://codegolf.stackexchange.com/q/33150/26997&quot;&gt;sometimes&lt;/a&gt; restricting comments is reasonable.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Are programs that run forever allowed? (assuming they correctly produce output) Usually the answer is 'no' but in rare cases allowing this is viable.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;List is roughly in order of most important to least. &quot;You&quot; refers to the challenge author.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Not all of these points need to be mentioned in every challenge (that would be overkill). But they are all things to consider as openings to potential loopholes, and should be mentioned when appropriate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/&quot;&gt;meta&lt;/a&gt; posts on our &quot;official&quot; defaults for some various list points:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;Input &amp;amp; Output&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet&quot;&gt;Program, Function, or Snippet&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1501/should-function-literals-be-allowed-when-a-function-is-asked-for/1503#1503&quot;&gt;Function Literals&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5097/should-there-be-defaults-for-tiebreakers-in-tag-wikis&quot;&gt;Tiebreaker&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/26997&quot;&gt;Loopholes that are forbidden by default&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I personally don't know much about our &quot;official&quot; defaults so anyone is welcome to add links to this list.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2015-07-27T21:58:13.957" CommentCount="1" CommunityOwnedDate="2015-07-21T08:59:22.830" ContentLicense="CC BY-SA 3.0" />
  <row Id="5589" PostTypeId="2" ParentId="5585" CreationDate="2015-07-21T11:57:57.377" Score="3" Body="&lt;h1&gt;Yes, pure programming puzzles are on topic.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In a programming puzzle, the obvious objective winning condition is simply solving the puzzle. It's indisputably objective, and to differentiate between multiple correct solutions, a tiebreaker such as earliest post might be added.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One might argue that this doesn't provide any real differentiating power, because everyone will just answer the question, and then it's simply whoever answers first wins. However, this senario does not reflect the lack of an objective winning condition. It is caused by the questioning being too easy, which is a perfectly valid reason to downvote any question, programming puzzle or not. But it is not a reason to ban an entire class of questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Programming puzzles do have an objective winning condition, and they belong on this site.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2015-07-21T11:57:57.377" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5590" PostTypeId="2" ParentId="2140" CreationDate="2015-07-21T16:52:52.983" Score="2" Body="&lt;h1&gt;CJam Expander&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; a program written in CJam.  You can accept input however you'd like.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt; the same program ready to be put into a PPCG answer.  You must:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Not change the horizontal position of any token in the program.&lt;/li&gt;&#xA;&lt;li&gt;Put each token one line below the previous one &lt;i&gt;except&lt;/i&gt; &lt;code&gt;}&lt;/code&gt; which must appear on the same line as the corresponding &lt;code&gt;{&lt;/code&gt;.  The token immediately following a &lt;code&gt;}&lt;/code&gt; will be one line below the &lt;code&gt;}&lt;/code&gt;.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For this challenge, every letter is considered a token except literal strings and numbers which count as one token regardless of character length.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Add &lt;code&gt;e#&lt;/code&gt; to the end of every line.  The &lt;code&gt;e#&lt;/code&gt;s must line up vertically two spaces to the right of the last character in the program.&lt;/li&gt;&#xA;&lt;li&gt;&lt;i&gt;Either&lt;/i&gt; prefix each line with four spaces &lt;i&gt;or&lt;/i&gt; surround your output with &lt;code&gt;&amp;lt;pre&amp;gt;&lt;/code&gt; and &lt;code&gt;&amp;lt;/pre&amp;gt;&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Example:&lt;/h2&gt;&#xA;&lt;p&gt;Adapted from &lt;a href=&quot;https://codegolf.stackexchange.com/a/39753/41245&quot;&gt;Martin Büttner♦'s answer.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; &lt;code&gt;4,{&amp;quot;Happy Birthday &amp;quot;\2=&amp;quot;Dear CJam&amp;quot;&amp;quot;to You&amp;quot;?N}%&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;    4                                               e#&#xA;     ,                                              e#&#xA;      {                                         }   e#&#xA;       &quot;Happy Birthday &quot;                         %  e#&#xA;                        \                           e#&#xA;                         2                          e#&#xA;                          =                         e#&#xA;                           &quot;Dear CJam&quot;              e#&#xA;                                      &quot;to You&quot;      e#&#xA;                                              ?     e#&#xA;                                               N    e#&#xA;&lt;/pre&gt;&#xA;&lt;h2&gt;Bonus:&lt;/h2&gt;&#xA;&lt;p&gt;If you output a header and footer like the one below, multiply your score by 0.8.  Using the same input, here is an output that qualifies for the bonus:&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;#CJam, 46 bytes&#xA;&#xA;&#xA;    4,{&quot;Happy Birthday &quot;\2=&quot;Dear CJam&quot;&quot;to You&quot;?N}%&#xA;&#xA;Explanation:&#xA;&#xA;    4                                               e#&#xA;     ,                                              e#&#xA;      {                                         }   e#&#xA;       &quot;Happy Birthday &quot;                         %  e#&#xA;                        \                           e#&#xA;                         2                          e#&#xA;                          =                         e#&#xA;                           &quot;Dear CJam&quot;              e#&#xA;                                      &quot;to You&quot;      e#&#xA;                                              ?     e#&#xA;                                               N    e#&#xA;&#xA;[Try it online.][1]&#xA;&#xA;[1]: link&#xA;&lt;/pre&gt;&#xA;&lt;p&gt;Of course, you have to adjust the byte count to match the input.  You are not required to make a working link for the online demo (although that would be cool).&lt;/p&gt;&#xA;" OwnerUserId="41245" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-07-21T20:39:51.440" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5591" PostTypeId="2" ParentId="2140" CreationDate="2015-07-21T17:33:21.027" Score="2" Body="&lt;h1&gt;Vowel-Consonant Imbalance&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox question:&lt;/strong&gt; Is it too easy/too close to an existing question? Related ones I found: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/20936/find-words-containing-every-vowel&quot;&gt;Find words containing every vowel&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/10628/finding-the-most-unique-word&quot;&gt;Finding the most &amp;#39;unique&amp;#39; word&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should write a program or function which receives a list of space-separated words as input and outputs or returns one of the words with the greatest difference between its vowel and consonant counts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;E.g.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;cars&quot; has 1 vowel and 3 consonant so the difference is 2&#xA;&quot;queue&quot; has 4 vowels and 1 consonant so the difference is 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If multiple words have the same maximal difference, exactly one (any of them)  should be returned.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;todo&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;todo&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;todo&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code golf so the shortest entry wins.&lt;/p&gt;&#xA;" OwnerUserId="7311" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.863" LastActivityDate="2015-07-21T17:33:21.027" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5592" PostTypeId="1" AcceptedAnswerId="5593" CreationDate="2015-07-21T18:04:52.807" Score="12" ViewCount="833" Body="&lt;p&gt;Recently the challenge &lt;a href=&quot;https://codegolf.stackexchange.com/q/53424/20469&quot;&gt;Word with greatest repeat of letters&lt;/a&gt; was posted. The OP said that it was inspired by a question on Stack Overflow, in which the user sought assistance with a solution to a Coderbyte challenge (specifically Letter Count I). The challenge posed here amounts to a reproduction of the Coderbyte challenge, since it asks the question that the SO post was trying to solve.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I wasn't able to find any copyright information about Coderbyte challenges. How should such posts here be handled?&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2015-07-21T18:37:50.860" Title="Can Coderbyte challenges be posted here?" Tags="|discussion|policy|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5593" PostTypeId="2" ParentId="5592" CreationDate="2015-07-21T18:37:50.860" Score="24" Body="&lt;p&gt;I used the &quot;Contact&quot; form on the Coderbyte site to ask. The response I got within minutes was:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Hi Geobits,&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Feel free to post challenges you see on Coderbyte, either paraphrased&#xA;  or copy-pasted, in other places such as stack overflow, stack&#xA;  exchange, etc. :)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This was from &lt;a href=&quot;http://danielborowski.com/&quot; rel=&quot;nofollow&quot;&gt;Daniel Borowski.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm guessing that this is as clear a &quot;yes&quot; as possible, but my personal opinion is that posts should still be attributed with a link.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2015-07-21T18:37:50.860" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5594" PostTypeId="2" ParentId="5585" CreationDate="2015-07-21T19:27:11.207" Score="-4" Body="&lt;h1&gt;No, pure programming puzzles are off topic.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;All challenges on this site require an objective winning criterion so that the choice of a single answer to accept is unambiguous and indesputable. Challenges which do not have an objective winning criterion are off topic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The issue with pure programming puzzles is that they don't have a clear winner. As in any challenge, for a submission to be valid at all, it must meet the challenge specification. But simply meeting the specification is insufficient as a winning criterion. Once you have a collection of valid answers, there isn't a clear way to choose just one to accept. This shows a clear lack of an objective winning criterion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Though off topic for this site, &lt;strong&gt;some&lt;/strong&gt; pure programming puzzles may be on topic for Puzzling.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2015-07-21T19:27:11.207" CommentCount="1" CommunityOwnedDate="2015-07-22T19:33:31.733" ContentLicense="CC BY-SA 3.0" />
  <row Id="5596" PostTypeId="2" ParentId="5585" CreationDate="2015-07-21T20:21:38.330" Score="14" Body="&lt;p&gt;This is, perhaps, a comment prompted by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5594/20260&quot;&gt;Alex A.'s post&lt;/a&gt;, but too long to be one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why exactly do we need challenges to have a clear winner? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;To accept an answer, maybe? But only 62% of questions have an accepted answer. The goal of this site doesn't seem to be to find the one best solution, but for people to have fun making their own. Even in popularity contests, where upvotes determine the winner, the interesting thing is reading the many very different solutions people come up with.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal of an objective winning criterion is that any &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1369/20260&quot;&gt;two submissions can be compared&lt;/a&gt;, but some of these comparisons, while doable, feel silly. Sure, you &lt;em&gt;can&lt;/em&gt; compare a CJam golf with a C++ golf by character count and get a result, but it's a meaningless comparison. It's like comparing &lt;code&gt;&quot;abc&quot; &amp;gt; 123&lt;/code&gt;: Python 2 will tell you it's &lt;code&gt;True&lt;/code&gt;, but why are you doing that? And sometimes popularity contest scoring seems like a hack as well, adding a &lt;code&gt;.get_votes()&lt;/code&gt; method just to implement &lt;code&gt;Orderable&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, I don't want the site to collapse into a heap of &quot;Do something cool&quot; and &quot;Make this code better, somehow&quot;, so I think it's important to require some element of objectivity and challenge. But beyond meeting the spec, I'm wondering if we actually need submissions to be comparable against each other as a broad rule.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-07-21T20:21:38.330" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5598" PostTypeId="1" AcceptedAnswerId="5601" CreationDate="2015-07-22T07:19:36.213" Score="-15" ViewCount="1710" Body="&lt;p&gt;As shown by &lt;a href=&quot;https://codegolf.stackexchange.com/q/53483/30525&quot;&gt;a recent challenge&lt;/a&gt;, once a few people have downvoted a question (say, three or four) &lt;em&gt;everyone else&lt;/em&gt; thinks that they should downvote too leading to incredibly low scores.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think we need a reform on how we downvote and/or what we downvote on. This will stop people from becoming disheartened by a -8 score.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2015-07-22T16:40:24.850" Title="Downvoting needs to change" Tags="|discussion|voting|" AnswerCount="3" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="5599" PostTypeId="2" ParentId="5598" CreationDate="2015-07-22T07:21:43.713" Score="-33" Body="&lt;h1&gt;Stop the score from decreasing below -5&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If the score is at -5, people should not downvote anymore, and if anyone makes the score decrease, you yourself should return the score to -5 by either upvoting or retracting your own downvote (if possible).&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="20469" LastEditDate="2015-07-22T16:40:24.850" LastActivityDate="2015-07-22T16:40:24.850" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5600" PostTypeId="2" ParentId="5598" CreationDate="2015-07-22T07:46:32.803" Score="10" Body="&lt;p&gt;I don't think it makes sense to put a limit on the votes of a post -- people vote the way they want, there should not be a restriction on that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What I do agree with, is that people should change their votes in case a post is edited to resolve specific problems.&lt;/p&gt;&#xA;" OwnerUserId="9275" LastActivityDate="2015-07-22T07:46:32.803" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5601" PostTypeId="2" ParentId="5598" CreationDate="2015-07-22T07:49:33.720" Score="29" Body="&lt;h1&gt;Don't be disheartened by very negative scores&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In many ways, a very negative score means you did something right - people looked at your question. Maybe it was unpopular, but the best solution is to look for ways to improve. This leads to my second proposal:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Consider leaving comments when downvoting.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As shown in the linked question, @xnor left a very helpful comment about exactly what was wrong with the question, an avenue for the question asker to improve. This comment was upvoted by many people. I think this is exactly what should have happened.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="20080" LastEditDate="2015-07-22T10:18:35.100" LastActivityDate="2015-07-22T10:18:35.100" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5605" PostTypeId="1" CreationDate="2015-07-23T05:52:07.870" Score="9" ViewCount="191" Body="&lt;p&gt;Currently, we have the following official reasons to close a question:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Duplicate&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Off topic due to:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;General Programming Question&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No objective winning criterion&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Belongs on another site&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Unclear what you're asking.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Too broad&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Primarily opinion based&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;However, there are other valid reasons to close a question, which are not in the close interface, due to space limitations or otherwise. I think it would be a good idea to make a list of such reasons here. These are things to look out for when considering closing a question, even though they're not common enough to warrant a custom entry.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some such reasons:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1335/too-trivial-close-vote&quot;&gt;Too narrow - only one reasonable solution in a given language.&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1947/the-line-between-art-and-programming&quot;&gt;Not primarily about programming, e.g. primarily artistic.&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Are there other important categories that we should keep in mind, even though they don't come up enough to have their own close vote entries? &lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2015-07-24T06:27:19.027" Title="Valid Reasons to Close Questions" Tags="|discussion|close-reasons|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5608" PostTypeId="2" ParentId="5582" CreationDate="2015-07-24T06:23:23.377" Score="12" Body="&lt;h3&gt;Floating point&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If your question requires the use of floating point, you will almost certainly need to constrain the input and allow answers to produce whatever output they want for inputs outside the specified range. You should do sufficient numerical analysis to ensure that it's possible to meet your specification for accuracy in the output over the entire range of valid input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you ask for numbers to be rounded to integers, you should specify which subset of the following rounding modes is acceptable:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Floor (round all numbers towards -infinity) (e.g. &lt;code&gt;-1.2 -&amp;gt; -2&lt;/code&gt;, &lt;code&gt;1.2 -&amp;gt; 1&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Ceiling (round all numbers towards +infinity) (e.g. &lt;code&gt;-1.2 -&amp;gt; -1&lt;/code&gt;, &lt;code&gt;1.2 -&amp;gt; 2&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Round all numbers towards zero (e.g. &lt;code&gt;-1.2 -&amp;gt; -1&lt;/code&gt;, &lt;code&gt;1.2 -&amp;gt; 1&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Round to nearest, half-down (e.g. &lt;code&gt;0.5 -&amp;gt; 0&lt;/code&gt;, &lt;code&gt;1.5 -&amp;gt; 1&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Round to nearest, half-up (e.g. &lt;code&gt;0.5 -&amp;gt; 1&lt;/code&gt;, &lt;code&gt;1.5 -&amp;gt; 2&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Round to nearest, half to even (e.g. &lt;code&gt;0.5 -&amp;gt; 0&lt;/code&gt;, &lt;code&gt;1.5 -&amp;gt; 2&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Round to nearest, half to odd (e.g. &lt;code&gt;0.5 -&amp;gt; 1&lt;/code&gt;, &lt;code&gt;1.5 -&amp;gt; 1&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="194" LastActivityDate="2015-07-24T06:23:23.377" CommentCount="0" CommunityOwnedDate="2015-07-24T06:23:23.377" ContentLicense="CC BY-SA 3.0" />
  <row Id="5609" PostTypeId="2" ParentId="5605" CreationDate="2015-07-24T06:27:19.027" Score="10" Body="&lt;p&gt;As discussed on chat, when we started using custom &quot;Off topic&quot; reasons we lost the default one. But it would actually be useful. So I propose adding a custom off topic reason:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This question is off topic for this site, as defined in the &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;Help Center&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2015-07-24T06:27:19.027" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5610" PostTypeId="2" ParentId="2140" CreationDate="2015-07-24T08:05:09.617" Score="2" Body="&lt;h1&gt;Save the bunny!&lt;/h1&gt;&#xA;&lt;p&gt;This King of the Hill competition is about a 2D flawn populated with bouncing balls and bunnies. The balls will collide with each other and the boundaries. If a bunny gets hit by a ball, it´s &lt;strike&gt;dead&lt;/strike&gt; teleported away (for cuteness sake).&lt;br /&gt;&#xA;Your task is to write a AI for the bunnies, such that they live as long as possible.&lt;/p&gt;&#xA;&lt;h3&gt;The AI:&lt;/h3&gt;&#xA;&lt;p&gt;The AI shall be a C++ Class with a constructor that takes a pointer to the array of balls and a function that returns the direction the bunny should go as a angle. Of course AIs that modify the game will not be accepted. &lt;em&gt;@ Meta: Will be more specific once the framework is finished.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Scoring:&lt;/h3&gt;&#xA;&lt;p&gt;Competitions will be run on several dates based on the valid submissions, after that the video will be posted on Youtube.&lt;br /&gt;&#xA;The time your bunny survives is your score.&lt;br /&gt;&#xA;To minimize randomness, there will be several runs and a 3 second spawn protection.&lt;/p&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;p&gt;I will do the framework in the next few weeks and enhance this post with pictures, source code and more specific stuff.&#xA;Is the basic idea clear?&lt;/p&gt;&#xA;" OwnerUserId="42407" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-07-24T08:05:09.617" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5615" PostTypeId="2" ParentId="2140" CreationDate="2015-07-24T21:41:22.817" Score="3" Body="&lt;h1&gt;If it floats, it boats!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal of this challenge is to determine whether or not an ASCII-art shape will float.  Like any other boat, ASCII boats obey the law of buoyancy: it will float if it displaces an equal mass of water.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;ASCII boats are made out of &lt;code&gt;O&lt;/code&gt; characters arranged in some contiguous shape (diagonals are connected).  There may be trailing spaces, but the whole input is a rectangle (trailing newline optional). Example boat:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   O         O    &#xA;    O        O    &#xA;     OOOOOOOOO    &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The material of the boat has twice the density of water.  When a boat is &lt;em&gt;floating&lt;/em&gt;, the number of displaced water characters is at least twice number of &lt;code&gt;O&lt;/code&gt; character in the boat.  Here is an artist's impression of a boat while floating.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   O         O    &#xA;~~~~O        O~~~~&#xA;~~~~~OOOOOOOOO~~~~&#xA;~~~~~~~~~~~~~~~~~~&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This boat has 13 &lt;code&gt;O&lt;/code&gt; characters, but displaces 19 water characters, so it floats.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The key to floating is the creation of an air pocket.  Air pockets can be formed in two ways:  either the water cannot reach the pocket (because the boat has walls keeping it out), or air is trapped in the pocket and cannot escape.  Here's an example of a capsized boat which can still float (warning: do not attempt at home).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;     OOOOOOOOO&#xA;~~~~O        O~~~~&#xA;~~~O         O~~~~&#xA;~~~~~~~~~~~~~~~~~~&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The following shapes aren't boats because they can't float:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;OOO&#xA;O  &#xA;O  &#xA;O  &#xA;OOO&#xA;&#xA;   O         O    &#xA;    O        O    &#xA;     OOOOOOOOO    &#xA;             O    &#xA;         OOOOOOOOO&#xA;         OOOOOOOOO&#xA;         OOOOOOOOO&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;The Goal&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program that, when given an ASCII-art shape, outputs a truthy value if it boats, and a falsey value if it doesn't boat.  This is code golf, fewest bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2015-07-26T21:31:08.280" LastActivityDate="2015-07-26T21:31:08.280" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="5617" PostTypeId="2" ParentId="338" CreationDate="2015-07-25T10:13:13.727" Score="10" Body="&lt;h1&gt;Absolutely - I did, and it worked out great.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I created &lt;a href=&quot;https://github.com/isaacg1/pyth&quot; rel=&quot;nofollow&quot;&gt;Pyth&lt;/a&gt; a year and a month ago as a sort of pre-processed Python that would be competitive against golfing languages like CJam and Golfscript.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While it has since diverged away from Python, it still compiles into Python. Moreover, Pyth is now a widely accepted and popular golfing language with hundreds of answers on the site - and most of them aren't mine!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think this is a fine path for golfers with a favorite language who want to compete for the shortest overall answer. Be warned that it takes a huge amount of time and effort, however.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2015-07-25T10:13:13.727" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5620" PostTypeId="2" ParentId="5582" CreationDate="2015-07-25T23:47:18.583" Score="8" Body="&lt;h3&gt;Consider edge cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Are there important edge cases in your question that need to be covered? Often these are situations that are not immediately obvious and can be overlooked by a challenge solution if it is not explicitly pointed out. Either disallow these cases from occurring in your input, or explicitly mention them and how they should be handled (i.e. a test case)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This can be difficult to do, especially since it's easy for &lt;em&gt;you&lt;/em&gt; to also overlook these edge cases! So it's always a good idea to sandbox your posts to see if others come across these edge cases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples from actual questions&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/26059/21682&quot;&gt;Where will the ball land?&lt;/a&gt;&lt;/strong&gt; Challenge author covers edge cases of column 0 (off the board), and the ball becoming trapped and never reaching the end.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/3293/21682&quot;&gt;How to randomize letters in a word&lt;/a&gt;&lt;/strong&gt; Challenge author realises and edits in the edge cases of words with 1 or 2 letters.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2015-07-25T23:47:18.583" CommentCount="0" CommunityOwnedDate="2015-07-25T23:47:18.583" ContentLicense="CC BY-SA 3.0" />
  <row Id="5621" PostTypeId="2" ParentId="5585" CreationDate="2015-07-26T00:53:05.237" Score="8" Body="&lt;h3&gt;A programming puzzle is on topic &lt;em&gt;only&lt;/em&gt; if it has an objective winning criterion&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Here I would exclude time posted except as a tie breaker after a more meaningful winning criterion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it's worth preserving Peter Taylor's comment that sums this up well:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A scenario in which there is no &quot;best&quot; answer, just the fastest, is not conducive to quality. Programming puzzles as defined in the tag wiki have a natural win condition, which is the least Levenshtein distance from the original code, and that allows someone who spends more time thinking about it to come up with a better answer. It also means that questions have long-term value, because someone can come along six months or two years later with an improvement, whereas fastest-gun-in-the-west questions are usually dead within 24 hours, and sometimes within 24 minutes.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2015-07-26T00:53:05.237" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5622" PostTypeId="1" CreationDate="2015-07-26T00:59:06.093" Score="1" ViewCount="73" Body="&lt;p&gt;Users are constantly asking for clarification of programming puzzles. In an attempt to help new users create good challenges, I asked this question on Meta PPCG: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5582/41912&quot;&gt;Things to consider when creating a programming puzzle&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've gotten some great answers, so it's time to make sure users see it when they ask a question. A link to it might be helpful in these places:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Sandbox&lt;/li&gt;&#xA;&lt;li&gt;Help Center&lt;/li&gt;&#xA;&lt;li&gt;&quot;How to Ask&quot; pane on the right side of the screen. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41912" LastEditorUserId="68942" LastEditDate="2021-06-09T05:53:34.343" LastActivityDate="2021-06-09T05:53:34.343" Title="Add to Sandbox or How to Ask" Tags="|feature-request|status-completed|asking-questions|challenges|help-center|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5623" PostTypeId="2" ParentId="5622" CreationDate="2015-07-26T03:18:40.277" Score="2" Body="&lt;p&gt;I went ahead and added the post to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1280/3808&quot;&gt;our community FAQ&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let me know if you think it needs to be more prominently featured.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2015-07-26T03:18:40.277" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5628" PostTypeId="2" ParentId="2140" CreationDate="2015-07-27T06:41:23.900" Score="0" Body="&lt;h1&gt;Live Tennis Scoreboard&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge, we're going to create a tennis scoreboard that could (theoretically) be used in an actual tennis match. The tennis scoreboard will display the score while listening on STDIN. As new results come in on STDIN, the tennis scoreboard will update itself accordingly.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Description of Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;When the scoreboard is first instantiated, it will be provided input for two strings -- these are the names of the competitors. This can be via command line arguments, user input functions, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After that, the scoreboard will recieve input via STDIN. These correspond to events that the scoreboard should reflect in the score.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;0&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first player has scored a point.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;1&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The second player has scored a point.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;U&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Undo the previous point and revert to the previous state of the scoreboard.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The scoreboard must handle games, deuces, etc. as described in the next section.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Terse Description of Tennis Scoring System&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This section here describes the exact rule set to use.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;em&gt;match&lt;/em&gt; is between two players. To win a match, a player must win three &lt;em&gt;sets&lt;/em&gt;. To win a set, a player must win at least six &lt;em&gt;games&lt;/em&gt; and have a two-game lead over their opponent. To win a game, a player must win at least four &lt;em&gt;points&lt;/em&gt; and have a two-point lead over their opponent.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The number of sets and games won are displayed as is. Points are displayed as follows in order of priority:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1 point = &lt;code&gt;15&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;2 points = &lt;code&gt;30&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;3 points = &lt;code&gt;40&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Number of points won are equal to the opponent = &lt;code&gt;40&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Number of points won are one greater than the opponent = &lt;code&gt;Ad&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Tiebreaks are optional. Implementing tiebreaks grants you &lt;strong&gt;-40&lt;/strong&gt; to your score.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Scoreboard Format&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;During the first set and first game:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Name | x&#xA;Name | x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;x&lt;/code&gt; is the point display for each player.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;During the first set:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Name a | x&#xA;Name a | x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;a&lt;/code&gt; is the number of games won by each player.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;During the second set:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Name b a | x&#xA;Name b a | x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;b&lt;/code&gt; is the result of the first set.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;During the third set:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Name c b a | x&#xA;Name c b a | x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;c&lt;/code&gt; is the result of the second set.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;etc. for fourth and fifth sets.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Federer 5 6 6 3 2 | 0&#xA;Murray  7 4 4 6 2 | 15&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="21682" LastActivityDate="2015-07-27T06:41:23.900" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5630" PostTypeId="2" ParentId="2140" CreationDate="2015-07-27T20:08:24.500" Score="-2" Body="&lt;h1&gt;GitHub Gist command-line client&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Create a command-line tool that publishes a list of files as one public GitHub Gist.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The following bullet points describe the behavior of the program. If a bullet point has &quot;&lt;em&gt;must&lt;/em&gt;&quot;, you must implement that point. If a bullet point has &quot;&lt;em&gt;can optionally&lt;/em&gt;&quot; or &quot;&lt;em&gt;should optionally&lt;/em&gt;&quot; you can implement that point on your own volition.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It &lt;em&gt;must&lt;/em&gt; be a complete command-line program.&lt;/li&gt;&#xA;&lt;li&gt;It &lt;em&gt;must&lt;/em&gt; use the GitHub &lt;a href=&quot;https://developer.github.com/v3/gists/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Gists API&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;It &lt;em&gt;must&lt;/em&gt; post an anonymous Gist (that is, not as a GitHub user).&lt;/li&gt;&#xA;&lt;li&gt;Gisted files &lt;em&gt;must&lt;/em&gt; use the filename provided on the command-line.&lt;/li&gt;&#xA;&lt;li&gt;The command-line &lt;em&gt;must&lt;/em&gt; accept multiple positional arguments.&lt;/li&gt;&#xA;&lt;li&gt;If no arguments are specified, it &lt;em&gt;must&lt;/em&gt; print this usage to &lt;code&gt;STDOUT&lt;/code&gt;: &lt;code&gt;gist: usage: &amp;lt;file&amp;gt; [file...]&lt;/code&gt; verbatim then exit with code 0.&lt;/li&gt;&#xA;&lt;li&gt;If something else goes wrong, it &lt;em&gt;must&lt;/em&gt; print this message to &lt;code&gt;STDERR&lt;/code&gt;: &lt;code&gt;gist: unable to gist =(&lt;/code&gt; verbatim then exit with code 1.&lt;/li&gt;&#xA;&lt;li&gt;If everything is successful it &lt;em&gt;must&lt;/em&gt; print the Gist's HTML URL to &lt;code&gt;STDOUT&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;It &lt;em&gt;can optionally&lt;/em&gt; accept a flag for description &lt;code&gt;-d &amp;lt;description&lt;/code&gt;. &lt;strong&gt;&lt;code&gt;floor(score * .9)&lt;/code&gt;&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;It &lt;em&gt;can optionally&lt;/em&gt; accept a flag for private gisting &lt;code&gt;-p&lt;/code&gt;. &lt;strong&gt;&lt;code&gt;floor(score * .9)&lt;/code&gt;&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;In the case that a description flag is not used or implemented it &lt;em&gt;must&lt;/em&gt; set the description to an empty string.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Example Input/Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The number before the prompt is the exit code of the previous command.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 $ gist&#xA;gist: usage: &amp;lt;file&amp;gt; [file...]&#xA;0 $ gist no-such-file.txt&#xA;gist: unable to gist =(&#xA;1 $ gist hello.txt&#xA;https://gist.github.com/anonymous/1e645596ce7bceeb1ec9&#xA;0 $&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest answer wins. As stated above, the following multipliers are in effect:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;(9): &lt;code&gt;score = floor(score * .9)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;(10): &lt;code&gt;score = floor(score * .9)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Both (9) &amp;amp; (10): &lt;code&gt;score = floor(floor(score * .9) *.9)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="16190" LastEditorUserId="16190" LastEditDate="2015-07-28T02:25:34.837" LastActivityDate="2015-07-28T02:25:34.837" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5635" PostTypeId="1" CreationDate="2015-07-29T00:18:45.053" Score="8" ViewCount="502" Body="&lt;p&gt;There has been discussion whether the &lt;code&gt;#lang racket&lt;/code&gt; line should be included in code golf submissions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So really the question is two-fold:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;The technical aspect:&lt;/strong&gt; Is it possible to run Racket code without the &lt;code&gt;#lang racket&lt;/code&gt; line?&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Poll:&lt;/strong&gt; If it isn't possible to run Racket code without the &lt;code&gt;#lang racket&lt;/code&gt; line, should this it be necessary in code golf submissions?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Edit&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;It turns out one can use &lt;code&gt;#!racket&lt;/code&gt; instead of &lt;code&gt;#lang racket&lt;/code&gt; as a shorter alternate form.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Edit 2&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;It turns out you do not strictly need the &lt;code&gt;#lang racket&lt;/code&gt; when you do this: &lt;code&gt;racket -e &quot;$(&amp;lt; your-racket-file.rkt)&quot;&lt;/code&gt; or possibly more likely &lt;code&gt;racket -e &quot;$(pbpaste)&quot;&lt;/code&gt; or similar.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Edit 3&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Even simpler -- &lt;code&gt;racket -f your-racket-file.rkt&lt;/code&gt; works without &lt;code&gt;#lang racket&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="16190" LastEditorUserId="16190" LastEditDate="2015-07-29T03:54:26.207" LastActivityDate="2015-07-30T07:47:45.547" Title="Should the &quot;#lang racket&quot; line be included in code golfs?" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5636" PostTypeId="2" ParentId="5635" CreationDate="2015-07-29T00:33:30.410" Score="-2" Body="&lt;h1&gt;Yes.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Count the &lt;code&gt;#lang racket&lt;/code&gt; in the character count.&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2015-07-29T00:33:30.410" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5637" PostTypeId="2" ParentId="5635" CreationDate="2015-07-29T00:34:35.653" Score="22" Body="&lt;h1&gt;No.&lt;/h1&gt;&#xA;&lt;p&gt;It's like a shebang, there's no need to count it. I see no reason to include a line that's meant for the shell/compiler. Its not like its real code, it doesn't add to your answer in any way.&lt;/p&gt;&#xA;&lt;p&gt;Nobody counts shebangs in Bash scripts, since you don't need them to run, so why do that with Racket?&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;#!/usr/bin/env bash&#xA;rm -rf /&#xA;&lt;/pre&gt;&#xA;&lt;p&gt;Now how many characters is this code? I'd say &lt;code&gt;8&lt;/code&gt;, because that's how long &lt;code&gt;rm&lt;/code&gt; is. The shebang doesn't do anything to the code except tell the shell what language the code is. It's like a file extension, but in the file. Are we going to add five bytes for adding &lt;code&gt;.java&lt;/code&gt;?&lt;/p&gt;&#xA;&lt;p&gt;We can easily remove the shebang by using &lt;code&gt;sh&lt;/code&gt; or by adding the file extension &lt;code&gt;.sh&lt;/code&gt;, meaning we get:&lt;/p&gt;&#xA;&lt;pre&gt;rm -rf /&lt;/pre&gt;&#xA;&lt;p&gt;Wow... now it's only 8 bytes... wylat...&lt;/p&gt;&#xA;&lt;p&gt;Now let's do that with Racket.&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;#lang racket&#xA;&quot;Hello, World!&quot;&#xA;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;#lang racket&lt;/code&gt; &lt;strong&gt;specifies the language&lt;/strong&gt;. It is &lt;em&gt;&lt;strong&gt;not needed&lt;/strong&gt;&lt;/em&gt; to run Racket programs in files:&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;$ cat hello.racket&#xA;&quot;Hello, World!&quot;&#xA;$ racket -f hello.racket&#xA;Hello, World!&#xA;&lt;/pre&gt;&#xA;&lt;p&gt;There's &lt;strong&gt;no need for it&lt;/strong&gt;, so there's &lt;strong&gt;no need to count it&lt;/strong&gt;.&lt;/p&gt;&#xA;" OwnerUserId="41711" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-07-30T07:47:45.547" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5638" PostTypeId="2" ParentId="2140" CreationDate="2015-07-29T13:10:52.867" Score="0" Body="&lt;h1&gt;Punch buggy?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;As some of you might know, &amp;quot;punch buggy&amp;quot; is a children's(?) game that involves spotting Volkswagen Beetles and punishing other players. For reference, the car on the left is a punch buggy, while the car on the right is not:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/H7XTh.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/H7XTh.jpg&quot; alt=&quot;punch-buggy-yellow&quot; /&gt;&lt;/a&gt;&lt;a href=&quot;https://i.stack.imgur.com/BBjtH.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/BBjtH.jpg&quot; alt=&quot;not-punch-buggy&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is: given an image, determine whether there is a punch buggy shown in it. Entries will be scored by percent correct among all &lt;em&gt;n&lt;/em&gt; (TBD) test images. If there is a tie, it will be broken by run time on my computer (specs will be posted on main).&lt;/p&gt;&#xA;&lt;p&gt;Test images may contain just about anything, and come in various sizes. Most will be automobiles of various types, but I will make sure they have a maximum of one auto in them (so if you see a non-matching car, you don't need to look for more). I won't use toy cars or heavily modified cars to try to fool you. Images will be pulled from Google Image Search, and will be of varying quality (from ad-quality to candid in-the-yard).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;This is not a Kolmogorov complexity challenge.&lt;/strong&gt; The point is not to recognize specific image files, but to recognize a Beetle in any picture. If it looks like someone is cheating this, I will change to a different test set and re-score.&lt;/p&gt;&#xA;&lt;h3&gt;Spec&lt;/h3&gt;&#xA;&lt;p&gt;Input is the name of an image file in JPG or PNG format (should I restrict this to one?).&lt;/p&gt;&#xA;&lt;p&gt;Output is &lt;code&gt;Punch Buggy!&lt;/code&gt; if a punch buggy is present in the picture, and any other non-empty string if not.&lt;/p&gt;&#xA;&lt;p&gt;Programs are run once per image. I will write a simple test controller for this using STDIO, so programs must be runnable from the command line, using a language that is freely available on Ubuntu.&lt;/p&gt;&#xA;&lt;p&gt;You are allowed to read/write other files, but only in a folder with the relative path &lt;code&gt;/yourProgramName&lt;/code&gt;. You are allowed to &lt;em&gt;read&lt;/em&gt; files  whose names are passed as input via STDIN.&lt;/p&gt;&#xA;&lt;h3&gt;Test Images&lt;/h3&gt;&#xA;&lt;p&gt;(will include link to collection when posted, probably about 100 total)&lt;/p&gt;&#xA;&lt;h3&gt;Sandbox&lt;/h3&gt;&#xA;&lt;p&gt;Yes, this seems a bit difficult to me, too. I don't see that as a problem. Is there anything that isn't clear about the task or spec? Other notes/questions/suggestions?&lt;/p&gt;&#xA;&lt;p&gt;If it needs fluff (I'm not sure yet), it will probably be something like &amp;quot;help my robot become more human via children's games&amp;quot;.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-07-29T13:50:30.823" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="5645" PostTypeId="1" AcceptedAnswerId="9234" CreationDate="2015-07-30T22:20:07.027" Score="6" ViewCount="164" Body="&lt;p&gt;(A few &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1608/legal-to-use-pokemon-etc-as-themes-for-challenges&quot;&gt;related&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2040/contests-questions-based-on-external-games&quot;&gt;meta&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/16/what-are-the-policies-for-threads-relating-to-facebook-puzzles-project-euler-u&quot;&gt;questions&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I know of a couple logic puzzles that I think would make good questions for this site. However, they are not original to me. I got them from &lt;a href=&quot;http://rads.stackoverflow.com/amzn/click/0806941995&quot; rel=&quot;nofollow noreferrer&quot;&gt;this puzzle book&lt;/a&gt;. &lt;strong&gt;With proper source attribution, can I base challenges on them?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Considerations &lt;strong&gt;for&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Some of the puzzles in the book are evidently adapted from other sources already. For example, one is a generalized form of Sudoku.&lt;/li&gt;&#xA;&lt;li&gt;I've found &lt;a href=&quot;http://www.sachsentext.de/en/taxonomy/term/54&quot; rel=&quot;nofollow noreferrer&quot;&gt;several&lt;/a&gt; of the &lt;a href=&quot;http://valezius.blogspot.com/2013/05/rules-half-dominoes.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;puzzle&lt;/a&gt; &lt;a href=&quot;http://valezius.blogspot.com/2013/05/rules-tents_6.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;types&lt;/a&gt; from the book &lt;a href=&quot;http://puzzleparasite.blogspot.com/2011/10/rules-turning-fences.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;online&lt;/a&gt; already.&lt;/li&gt;&#xA;&lt;li&gt;I am not using any of the exact puzzles from the book (I don't actually have it anymore), just the puzzle rules. Together with the non-commercial nature of the site, I believe such a use falls under &lt;a href=&quot;https://en.wikipedia.org/wiki/Fair_use&quot; rel=&quot;nofollow noreferrer&quot;&gt;Fair Use&lt;/a&gt; guidelines.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Considerations &lt;strong&gt;against&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The book is, of course, copyrighted. Furthermore, using puzzles from a puzzle book seems to me (not that I'm a lawyer) like a larger borrowing than using names of Pokémons, e.g. On the other hand, apparently &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2041/16766&quot;&gt;game mechanics are not copyrightable&lt;/a&gt;. Not sure how much that applies to puzzle mechanics.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;What say ye?&lt;/p&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2016-05-24T06:49:05.107" Title="Questions based on a puzzle book" Tags="|discussion|policy|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="5651" PostTypeId="1" AcceptedAnswerId="5652" CreationDate="2015-08-03T09:38:06.763" Score="-2" ViewCount="195" Body="&lt;p&gt;Recently in the sandbox I've had&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?page=2&amp;amp;tab=active#comment16182_5579&quot;&gt; two challenge ideas&lt;/a&gt; pooh-poohed because it would be easily won by Unary, or one of its derivatives.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, I'm not saying exclude from the whole site because it can be use din ingenious ways, but what's the best way of excluding the language from challenges where it would easily win?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Furthermore, what are the Unary derivatives which can be listed in the passage describing Unary's exclusion?&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-08-03T10:15:25.470" Title="Unary, the destroyer of challenge ideas" Tags="|discussion|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5652" PostTypeId="2" ParentId="5651" CreationDate="2015-08-03T10:11:52.080" Score="7" Body="&lt;p&gt;If it's actually &lt;em&gt;trivial&lt;/em&gt; for Unary to win a challenge, there's a good chance that part of the challenge spec is broken. There is not much you can do about ruling it out Unary specifically, because there will always be other languages with similar properties (like Pietu's &lt;a href=&quot;http://esolangs.org/wiki/Lenguage&quot; rel=&quot;nofollow&quot;&gt;Lenguage&lt;/a&gt;). It doesn't really help to make an exhaustive list of Unary derivatives either. It's like saying &quot;no golfing languages&quot; for a standard code golf challenge because you want to give &quot;normal&quot; languages a chance to win. Excluding individual languages isn't any better than writing an unnecessarily language-specific challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Instead, when someone tells you that a challenge is trivial in a certain language (this doesn't even have to be Unary), then you should a) consider whether that's even a problem (there are tons of challenges where Pyth is unbeatable - why shouldn't it be Unary for once?) and b) if it is a problem, then you might want to rethink your challenge/winning criterion instead. Ignoring the issue by excluding one language (family) is just treating the symptoms and ignoring an deeper problem. After all people inform you that a trivial solution exists instead of just waiting until the challenge is live to help you improve the challenge.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-08-03T10:11:52.080" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5653" PostTypeId="2" ParentId="5651" CreationDate="2015-08-03T10:15:25.470" Score="3" Body="&lt;p&gt;One method of ruling out Unary-like derivatives is to impose a hard byte limit. It will unfortunately rule out some more exotic esolangs, but in the end it'll be up to you to decide what's reasonably long enough to allow most legitimate solutions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for Unary variants, there are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://esolangs.org/wiki/Lenguage&quot; rel=&quot;nofollow noreferrer&quot;&gt;Lenguage&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://esolangs.org/wiki/Ellipsis&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ellipsis&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://esolangs.org/wiki/MGIFOS&quot; rel=&quot;nofollow noreferrer&quot;&gt;MGIFOS&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://esolangs.org/wiki/Ecstatic&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ecstatic&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;But, as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/8478/martin-b%c3%bcttner&quot;&gt;Martin mentions&lt;/a&gt;, ruling out each individually would not be a good way to go.&lt;/p&gt;&#xA;" OwnerUserId="21487" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-08-03T10:15:25.470" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5655" PostTypeId="2" ParentId="2140" CreationDate="2015-08-04T00:32:08.010" Score="1" Body="&lt;h1&gt;Print time of day using words&lt;/h1&gt;&#xA;&lt;p&gt;I'm not sure if this has been done before. I thought it must have but I could not find one using search. The idea is basically, given a number in seconds, e.g. the output from time(NULL). Return the current time in words using 12 hour clock, e.g.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;HALF PAST FIVE PM&#xA;A QUARTER TO SIX PM&#xA;TEN TO SIX PM&#xA;SIX O'CLOCK PM&#xA;SIX TEN PM&#xA;TWELVE NOON&#xA;TWELVE O ONE AM&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Has this challenge been done before?&lt;/p&gt;&#xA;&lt;p&gt;One thing I cannot decide is when the &amp;quot;PAST&amp;quot; should be used. Should it be used only when there is less than 15 minutes left? Should it be FIVE FIFTY FIVE or FIVE TO SIX?&lt;/p&gt;&#xA;" OwnerUserId="41445" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-08-04T01:24:42.747" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5656" PostTypeId="2" ParentId="2140" CreationDate="2015-08-04T04:52:37.147" Score="4" Body="&lt;h1&gt;Ironclad Tactics KoTH&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This KoTH is inspired by the Ironclad Tactics paper version from Zachtronics.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The game is played on a 9x4 grid split into three areas: the North, the South, and No-Man's-Land (the center).  To make things easier for you, it will always appear that you are the North (the left).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/B2JQu.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/B2JQu.png&quot; alt=&quot;Steelclad&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each battle, each player starts with 10 Action Points (AP).  In a battle, there are 4 phases: Selection, Placement, Upgrading, then Attacking.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Selection&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;During selection, players start by each simultaneously choosing an upgrade to ban, and then choosing 5 of the 8 or 9 remaining upgrades they wish to use.  The chosen upgrades are not revealed to their opponent.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Placement&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;During placement, players simultaneously place an Ironclad until they decide to drop out of the phase or they have used all of their AP.  Each placement costs 1AP, and Ironclads can only be placed on the player's respective side and No-Man's-Land.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Upgrading&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;During upgrading, players simultaneously upgrade one of their Ironclads using their remaining AP until they decide to drop out of the phase or they have used all of their AP.  Each upgrade costs 2+(# of times you previously used the upgrade)-(# of times your opponent previously used the upgrade), with a minimum cost of 0.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are 10 possible upgrades:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/rJWDA.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/rJWDA.png&quot; alt=&quot;Upgrades&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The stars represent Ironclads, and each circle represents the squares the Ironclad will attack.  The arrow represents the &lt;em&gt;Saboteur&lt;/em&gt; upgrade, which will give the player 2 additional victory points, and the diamond represents the &lt;em&gt;Heavy Chassis&lt;/em&gt; upgrade, which requires 2 hits to be destroyed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Upgrades can be given to any of your unupgraded Ironclads, even if the squares it would attack fall off of the board.  Upgrades do not need to be given to all Ironclads.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Attacking&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;During attacking, all Ironclads simultaneously attack.  Any Ironclad in the square of attack (even if the attack is friendly) is destroyed (unless the tank has the &lt;em&gt;Heavy Chassis&lt;/em&gt; upgrade, in which case it must be attacked by two different tanks.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any remaining tanks give 1 (or 3, if the tank has the *Saboteur upgrade) victory point(s) if they have a horizontal line of sight to the opposite end unobstructed by undestroyed enemy tanks.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;API&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You will implement a Java class.  &lt;em&gt;more info&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Additional Info&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You will have 10 battles against each opponent.  &lt;/li&gt;&#xA;&lt;li&gt;The price for upgrades resets after each opponent.&lt;/li&gt;&#xA;&lt;li&gt;You beat an opponent by having more victory points than them after the 10 battles.  You win this challenge by beating the most opponents.&lt;/li&gt;&#xA;&lt;li&gt;If both players attempt to place in the same spot at the same time, that location becomes unplaceable for the rest of the battle, and players must place again.&lt;/li&gt;&#xA; - &#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2015-08-04T12:46:05.710" LastActivityDate="2015-08-04T12:46:05.710" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5658" PostTypeId="1" CreationDate="2015-08-04T16:59:21.677" Score="10" ViewCount="163" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/time-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;time-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;time-complexity&lt;/a&gt; is a confusing mess. Its current excerpt reads:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;for challenges requiring the answers to be in a certain time complexity, or having a winning criterion about the time complexity.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;which are two very different properties for a question to have, one of which duplicates &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;. However, it only has 9 questions, so it shouldn't be too hard to retag. What's the best way to retag?&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2015-08-04T16:59:21.677" Title="Retagging time-complexity" Tags="|discussion|tags|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5659" PostTypeId="2" ParentId="5658" CreationDate="2015-08-04T16:59:21.677" Score="16" Body="&lt;p&gt;Those which are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt; should obviously be retagged with that. For those which require answers to be in a certain time complexity, I propose creating &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-time-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-time-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-time-complexity&lt;/a&gt; by analogy with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;. Then &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/time-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;time-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;time-complexity&lt;/a&gt; can be left for the cleanup script to delete.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2015-08-04T16:59:21.677" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5662" PostTypeId="2" ParentId="2140" CreationDate="2015-08-05T09:44:32.470" Score="0" Body="&lt;h1&gt;Clarence the Fast? Typist&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Inspired by this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/50722/clarence-the-slow-typist#comment120076_50722&quot;&gt;excellent question&lt;/a&gt; on the original challenge.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Introduction&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lawrence is a business manager who works at an Internet service provider. Recently, he has noticed that Clarence, the data entry clerk, has been &lt;a href=&quot;https://codegolf.stackexchange.com/q/50722/21682&quot;&gt;typing a little slow lately&lt;/a&gt;. Since Clarence's job is entering the IP addresses manually into the database, Lawrence is starting to get worried. &lt;em&gt;Especially&lt;/em&gt; that there is now a backlog of angry customers who are calling to ask why they are not connected to the Internet yet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lawrence, as you might expect from one who manages an ISP, has hit upon what he considers to be an excellent solution to the problem. He decides to optimise the layout of Clarence's keypad to make it faster for him to type in the IP addresses. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Clarence's keypad is normally laid out as follows:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;kbd&gt;&lt;code&gt;1&lt;/code&gt;&lt;/kbd&gt;&lt;kbd&gt;&lt;code&gt;2&lt;/code&gt;&lt;/kbd&gt;&lt;kbd&gt;&lt;code&gt;3&lt;/code&gt;&lt;/kbd&gt;&lt;br&gt;&#xA;&lt;kbd&gt;&lt;code&gt;4&lt;/code&gt;&lt;/kbd&gt;&lt;kbd&gt;&lt;code&gt;5&lt;/code&gt;&lt;/kbd&gt;&lt;kbd&gt;&lt;code&gt;6&lt;/code&gt;&lt;/kbd&gt;&lt;br&gt;&#xA;&lt;kbd&gt;&lt;code&gt;7&lt;/code&gt;&lt;/kbd&gt;&lt;kbd&gt;&lt;code&gt;8&lt;/code&gt;&lt;/kbd&gt;&lt;kbd&gt;&lt;code&gt;9&lt;/code&gt;&lt;/kbd&gt;&lt;br&gt;&#xA;&lt;kbd&gt;&lt;code&gt;.&lt;/code&gt;&lt;/kbd&gt;&lt;kbd&gt;&lt;code&gt;0&lt;/code&gt;&lt;/kbd&gt;&lt;kbd&gt;&lt;code&gt;E&lt;/code&gt;&lt;/kbd&gt; (E stands for &quot;Enter&quot;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The distance between the centres of each adjacent key is 1 centimetre. Clarence types using the &quot;eagle search&quot; system -- he uses one finger only and moves that finger from key to key to type in an address. For example, to input the number &lt;code&gt;7851&lt;/code&gt;, Clarence would start his finger on &lt;kbd&gt;7&lt;/kbd&gt;, move 1cm right to &lt;kbd&gt;8&lt;/kbd&gt;, move 1cm up to &lt;kbd&gt;5&lt;/kbd&gt;, then move √2cm to &lt;kbd&gt;1&lt;/kbd&gt; -- a total of 3.41cm. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we rearrange his keypad like this, we can get better results:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;kbd&gt;&lt;code&gt;4&lt;/code&gt;&lt;/kbd&gt;&lt;kbd&gt;&lt;code&gt;2&lt;/code&gt;&lt;/kbd&gt;&lt;kbd&gt;&lt;code&gt;3&lt;/code&gt;&lt;/kbd&gt;&lt;br&gt;&#xA;&lt;kbd&gt;&lt;code&gt;1&lt;/code&gt;&lt;/kbd&gt;&lt;kbd&gt;&lt;code&gt;5&lt;/code&gt;&lt;/kbd&gt;&lt;kbd&gt;&lt;code&gt;6&lt;/code&gt;&lt;/kbd&gt;&lt;br&gt;&#xA;&lt;kbd&gt;&lt;code&gt;7&lt;/code&gt;&lt;/kbd&gt;&lt;kbd&gt;&lt;code&gt;8&lt;/code&gt;&lt;/kbd&gt;&lt;kbd&gt;&lt;code&gt;9&lt;/code&gt;&lt;/kbd&gt;&lt;br&gt;&#xA;&lt;kbd&gt;&lt;code&gt;.&lt;/code&gt;&lt;/kbd&gt;&lt;kbd&gt;&lt;code&gt;0&lt;/code&gt;&lt;/kbd&gt;&lt;kbd&gt;&lt;code&gt;E&lt;/code&gt;&lt;/kbd&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With this layout Clarence only needs to move his finger 3cm. This saves time!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a program that determines the most optimal keypad layout, given a list of IP addresses that Clarence must type in. Clarence needs to push the &lt;kbd&gt;E&lt;/kbd&gt; after each IP address, so you also need to optimise the position of the &lt;kbd&gt;E&lt;/kbd&gt; key.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input Description&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input is a newline separated list of IP addresses. Each IP address is a string that will be in the form&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;().().().()&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;where each &lt;code&gt;()&lt;/code&gt; is an integer in the range &lt;code&gt;0&lt;/code&gt; - &lt;code&gt;999&lt;/code&gt;. I would also like to point out that addresses such as &lt;code&gt;0.42.42.42&lt;/code&gt; or &lt;code&gt;999.999.999.999&lt;/code&gt; in the input are still valid, despite the fact that they are invalid IP addresses. So you don't need to include any IP address verification code in your program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output Description&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output the layout of the keys such that the distance Clarence needs to move his finger to type them all in is as low as possible. If there are multiple layouts that are equally as low, output any one of them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The format for the output looks like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;123&#xA;456&#xA;789&#xA;.0E&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;[todo: example inputs and outputs]&lt;/p&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.193" LastActivityDate="2015-08-05T11:12:14.970" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5668" PostTypeId="2" ParentId="2140" CreationDate="2015-08-07T21:04:35.427" Score="-2" Body="&lt;h1&gt;Golf these arrays&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to output these 128 arrays: &lt;a href=&quot;http://pastebin.com/UeBMJfv7&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://pastebin.com/UeBMJfv7&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Gzip base64: (too long, will be added if I'll post this question).&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You don't have to output them all. And you can output the arrays in any order. But the order of items in the arrays must be kept as is.&lt;/li&gt;&#xA;&lt;li&gt;You can print other arrays, which wouldn't be counted towards your score. The number of arrays you print must be no more than 10,000, and the total number of arrays, subarrays and numbers must be no more than 10,000,000.&lt;/li&gt;&#xA;&lt;li&gt;You can use any convenient format to represent the arrays (and the list of outputted arrays).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;If your program or function has &lt;em&gt;n&lt;/em&gt; bytes, and it printed &lt;em&gt;k&lt;/em&gt; distinct arrays from the above list, your score would be &lt;em&gt;n&lt;/em&gt;*(128/&lt;em&gt;k&lt;/em&gt;)&lt;sup&gt;2&lt;/sup&gt;. Lowest score wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Problems&lt;/h3&gt;&#xA;&lt;p&gt;It looks too boring.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-08-07T21:04:35.427" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5672" PostTypeId="1" AcceptedAnswerId="5674" CreationDate="2015-08-09T07:08:00.550" Score="5" ViewCount="119" Body="&lt;p&gt;There's a tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/algorithm-advice&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;algorithm-advice&amp;#39;&quot; rel=&quot;tag&quot;&gt;algorithm-advice&lt;/a&gt; which is currently being used three times. All three questions were asking for help with solving a programming challenge found elsewhere. We usually consider that to be off-topic. Two of the questions were sort of salvaged and turned into challenges (the third one is still closed), but at that point they are no longer about algorithm advice, but about people competing for the winning criterion. So I think they shouldn't even have the tag any more.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A rather strong indicator that there's a correlation between the tag and bad/off-topic questions is that on top of those three remaining questions, there are &lt;em&gt;15&lt;/em&gt; deleted ones with the tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we really don't want algorithm advice questions, we should probably burninate the tag, because having it suggests that these questions are perfectly valid. Alternatively, we could sort out in which cases  algorithm advice questions could be on topic here and outline that in the tag wiki.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Opinions?&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorDisplayName="user45941" LastEditDate="2016-01-26T09:04:58.530" LastActivityDate="2016-01-26T09:04:58.530" Title="Do we need the [algorithm-advice] tag?" Tags="|discussion|status-completed|tags|scope|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5674" PostTypeId="2" ParentId="5672" CreationDate="2015-08-09T16:52:36.213" Score="6" Body="&lt;p&gt;In my opinion, tactics on how to shorten your code are on topic, but the algorithm you use is your whole strategy. Giving algorithm advice generally means solving the whole problem for someone, which is not what you do in a challenge, it's what you do when you answer a homework question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I suggest we get rid of this tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Important Sidenote:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Of course there are fastest-code (and least memory) challenges where refining minor details of the algorithm may help, but I don't believe we have any legitimate &lt;code&gt;tips&lt;/code&gt; questions on that subject. So the tag is not useful. If there were any such question, it could go under the &lt;code&gt;tips&lt;/code&gt; tag.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;In any case, code that is fast and economical with memory is a common goal in industry and there is a wealth of information about this on other sites, computer science courses, etc. These days, unless you are programming a microcontroller, writing the shortest possible code is strictly an entertainment, which makes the golfing &lt;code&gt;tips&lt;/code&gt; questions on this site a pretty unique resource.&lt;/em&gt; &lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="15599" LastEditDate="2015-08-09T21:16:14.663" LastActivityDate="2015-08-09T21:16:14.663" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5675" PostTypeId="1" CreationDate="2015-08-10T11:18:43.500" Score="2" ViewCount="114" Body="&lt;p&gt;There are a lot of challenges that get you to write programs and/or functions, but (almost) none that get you to write classes. I thought of a way to lay out class-writing challenges - it's quite specific (and might be a bit longer than a code-golf challenge of similar complexity), but does ensure that the challenge is unambiguous and fair for all users.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Questions would include:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An &lt;strong&gt;interface&lt;/strong&gt; section which describes what public variables/functions the class should have, including the name of the functions and any parameters and return values. The underlying mechanics of the class are up to the user.&lt;/li&gt;&#xA;&lt;li&gt;A &lt;strong&gt;demo&lt;/strong&gt; section: an algorithm/some pseudocode that describes a program that will be used in order to test the class. The demo code is separate from the class implementation, so its length not included in the submission's character count. This section exists so that any other user can quickly test a submission using the same code.&lt;/li&gt;&#xA;&lt;li&gt;Specifying any &lt;strong&gt;disallowances&lt;/strong&gt; that would make the challenge trivial (e.g. already existing implementations of the challenge, where the user's class just acts as a wrapper). These may be implicit as per the standard loopholes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Answers would include:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A &lt;strong&gt;class code&lt;/strong&gt; section, which contains the implementation of the class as described. Essentially, this is the same as any other code golf challenge - the user posts their character length and tries to get the lowest score!&lt;/li&gt;&#xA;&lt;li&gt;A &lt;strong&gt;demo code&lt;/strong&gt; section, which contains the code for a program that can be run in order to test the user's class. This should perform the tests that were mentioned in the question. This section's code is not included in the character count.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For example, a challenge to write an integer queue class may be laid out like this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The interface would include functions such as &lt;code&gt;push()&lt;/code&gt;, &lt;code&gt;peek()&lt;/code&gt; and &lt;code&gt;pop()&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The demo pseudocode would contain things such as &quot;push 12 to the queue, then pop an item from the queue and print it to the screen, then add all of the integers from [0-100) to the queue&quot;... &lt;/li&gt;&#xA;&lt;li&gt;The disallowances would include barring any existing implementations of a queue or dynamic data structure (e.g. &lt;code&gt;std::queue&amp;lt;T&amp;gt;&lt;/code&gt;, &lt;code&gt;std::deque&amp;lt;T&amp;gt;&lt;/code&gt;, &lt;code&gt;std::vector&amp;lt;T&amp;gt;&lt;/code&gt;, &lt;code&gt;std::list&amp;lt;T&amp;gt;&lt;/code&gt;... in C++).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Here's why I think these types of challenges are a good idea:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It encourages usage of &quot;less popular&quot; languages, as none of the Big Three (Small Three?) - Pyth, CJam and GolfScript - are object-oriented.&lt;/li&gt;&#xA;&lt;li&gt;The usage of named functions ensures that everyone's code has the same interface. It would also expose cheating (e.g. reducing &lt;code&gt;print()&lt;/code&gt; to &lt;code&gt;p()&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Class challenges could introduce some new and interesting simple questions (which I personally prefer to the more complex/mathematically demanding challenges), but there is scope to expand these to something more complex.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I'd like to know what you think. Feel free to make any suggestions or changes.&lt;/p&gt;&#xA;" OwnerUserId="30685" LastActivityDate="2015-08-10T14:05:03.310" Title="Would a class-writing code golf challenge be appropriate?" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5676" PostTypeId="2" ParentId="5675" CreationDate="2015-08-10T14:05:03.310" Score="8" Body="&lt;p&gt;I'm not going to say it's &lt;em&gt;inappropriate&lt;/em&gt;, but I personally don't see the advantages you list.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;It encourages usage of &quot;less popular&quot; languages, as none of the Big Three (Small Three?) - Pyth, CJam and GolfScript - are object-oriented.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't really think those three languages are as popular as you think. According to &lt;a href=&quot;http://data.stackexchange.com/codegolf/revision/301170/390502/code-golf-languages&quot; rel=&quot;nofollow noreferrer&quot;&gt;this query&lt;/a&gt;, at least, the top three languages on the site are Python, Javascript, and Ruby. C, Perl and Haskell are all ahead of any of those three as well, and Java has about as many as Cjam or Golfscript. &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The usage of named functions ensures that everyone's code has the same interface. It would also expose cheating (e.g. reducing print() to p()).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'm not sure how reducing the name of a function is &quot;cheating&quot;. If everybody's code uses &lt;code&gt;print()&lt;/code&gt;, it's seven characters. If they use &lt;code&gt;p()&lt;/code&gt; instead, it's three, but this is a &lt;em&gt;standard&lt;/em&gt; reduction, and it's even in the &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;code golf tag wiki&lt;/a&gt;. It's not like one guy is winning these things by doing it, &lt;em&gt;everybody&lt;/em&gt; should be.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Class challenges could introduce some new and interesting simple questions (which I personally prefer to the more complex/mathematically demanding challenges), but there is scope to expand these to something more complex.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Maybe I'm just seeing it wrong, but to me it sounds like it adds more &lt;em&gt;boilerplate&lt;/em&gt; without more functionality. If a challenge is simple, and is only remotely interesting because it's &quot;in a class&quot;, I would just skip on by. It was a good day when writing a function (rather than a full program) became a default option here, because boilerplate &lt;em&gt;just isn't fun,&lt;/em&gt; at least not to me. &lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-08-10T14:05:03.310" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5677" PostTypeId="1" CreationDate="2015-08-10T14:53:51.483" Score="11" ViewCount="444" Body="&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1878/are-we-allowed-to-offer-real-world-prizes-such-as-gift-codes-to-the-winner-of-a&quot;&gt;Meta question showing community consensus that cash prizes are a bad idea&lt;/a&gt;.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A series of questions on main that offer non-trivial amounts in bitcoin for each new best answer:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/54147/take-it-or-leave-it-a-game-show-for-computers&quot;&gt;Take it or leave it&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/54206/take-it-or-leave-it-ii-a-game-show-for-computers&quot;&gt;Take it or leave it II&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/54411/take-it-or-leave-it-iii-a-game-show-for-computers&quot;&gt;Take it or leave it III&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Please note that I have nothing against these questions - they were not written with any ill intentions and I certainly didn't intend for this to be a trigger for mob downvoting. All 3 have now been edited by the author to remove the offer of cash prizes.&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;These questions are clearly well-intended and fun, and are causing no problems at present. However, if there is likely to be a problem in future it is easier to introduce a rule now while this is rare, than to try and stop it only once it is established and becomes a problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Would we prefer to have simply advice against cash prizes (as in the meta post linked above), but still permit it if people choose to offer them, or would it be better to make an official rule preventing cash prizes?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider also whether this should just apply to cash prizes (national currency / cryptocurrencies / gift cards) or also to physical prizes (like giving away a free raspberry pi or a themed t-shirt).&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="66833" LastEditDate="2021-04-25T00:44:40.017" LastActivityDate="2021-04-25T00:44:40.017" Title="The community is against cash prizes, but should that be advice or a rule?" Tags="|discussion|incentives|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5678" PostTypeId="2" ParentId="2140" CreationDate="2015-08-10T14:54:38.923" Score="1" Body="&lt;h1&gt;Maze to regex&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Suppose we have an ASCII maze like so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#######&#xA;#s# # #&#xA;# # # #&#xA;#     #&#xA;# ### #&#xA;# #  e#&#xA;#######&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The input maze will have the following properties:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;One cell (marked &lt;code&gt;s&lt;/code&gt;) will denote the start of the maze, and a separate cell (marked &lt;code&gt;e&lt;/code&gt;) will denote the exit.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The walls will be denoted by hashes &lt;code&gt;#&lt;/code&gt;, and empty corridors will be denoted by spaces.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The maze will be a perfect rectangle, have no cycles, and will consist of exactly one connected component (i.e. all cells will be reachable)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;A single character from &lt;code&gt;NSEW&lt;/code&gt; represents a move North, South, East or West respectively, and consists of moving &lt;strong&gt;two&lt;/strong&gt; characters in the specified direction. For instance, the above example is a 3 by 3 maze where the following cells can be occupied:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#######&#xA;#x#x#x#&#xA;# # # #&#xA;#x x x#&#xA;# ### #&#xA;#x#x x#&#xA;#######&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A string consisting of &lt;code&gt;NSEW&lt;/code&gt; is said to &lt;em&gt;solve&lt;/em&gt; a maze if applying each move in turn results in the exit being reached at some point in time, regardless of whether the string continues on afterward. If a move is blocked by a wall, the move is ignored and no movement occurs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example strings which solve the above maze are &lt;code&gt;SEES&lt;/code&gt;, &lt;code&gt;SENSES&lt;/code&gt; and &lt;code&gt;SSSSSNENNNNNSENNNNNSSSSSSSSWW&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a program or function which takes in an ASCII maze and outputs a regex. The regex must match a string of &lt;code&gt;NSEW&lt;/code&gt; if and only if it solves the given input maze.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance, all solutions to the 2 by 2 maze&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#####&#xA;#s#e#&#xA;# # #&#xA;#   #&#xA;#####&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;can be encapsulated by the regex&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;^(([NEW]|S[WS]*N)*S[WS]*E([ES]|W[WS]*E)*W[WS]*N)*([NEW]|S[WS]*N)*S[WS]*E([ES]|W[WS]*E)*N[NEWS]*$&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(&lt;a href=&quot;https://regex101.com/r/tK5aO4/2&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online at Regex101&lt;/a&gt;)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Available features&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You may only use the following regular expression features:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;^$         Start and end anchors respectively&#xA;N|E        Alternation&#xA;NE         Concatenation&#xA;()         Grouping&#xA;*          Repetition (0+ times)&#xA;+          Repetition (1+ times)&#xA;?          Optional (0 or 1 times)&#xA;[NESW]     Character classes (but not negated classes)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In particular, recursion, wildcards, lookaheads and other unlisted features are not allowed.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Sandbox questions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;What would be better, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt; (scoring by providing a few test mazes, and taking the sum of output regex lengths) or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; (any output regex is okay as long as it is finite and correct)?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I've chosen this ASCII representation because it looks the nicest, but I'm not sure if it's the most convenient. I'm open to suggestions for alternatives.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What is the best way to test submissions? I can write a bunch of test cases per maze, but it's impossible for me to test an infinite number of strings.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="21487" LastActivityDate="2015-08-10T14:54:38.923" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5679" PostTypeId="2" ParentId="2140" CreationDate="2015-08-10T16:33:16.257" Score="0" Body="&lt;h1&gt;Kolmorogov image complexity&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmorogov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmorogov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmorogov-complexity&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The 512 by 512 pixel image below [ &lt;em&gt;to be added when posting to main&lt;/em&gt; ] was produced using a combination of simple methods that, if known, would allow reproducing the image with a short program. It is therefore known to have low Kolmorogov complexity. However, the original methods used will not be revealed. Instead your challenge is to produce code that outputs this image by your own best method, pixel perfect, so that the hash of your image matches the hash of this image.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/F3YzX.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/F3YzX.png&quot; alt=&quot;Blank image to show size 512 by 512 pixels&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[ &lt;em&gt;Hash&lt;/em&gt; ]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may use any built ins and libraries that existed publicly before the challenge was posted, including graphical libraries.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input and output&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your code is not required to take input.&lt;/li&gt;&#xA;&lt;li&gt;Your code must be able to produce the correct output without taking input.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You may use any freely available image format (free and free) or display the image to screen. Your code is not responsible for converting the image to a format that can be hashed for validation.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winning&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A valid answer is one for which the output passes the validation test. The winner is the valid answer with the shortest code in bytes.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Validator&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The following code takes a PNG image as input and outputs a hash of its pixel values, announcing whether this is valid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[ &lt;em&gt;Validator to be added later&lt;/em&gt; ]&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;em&gt;I'm considering posting a few example images here in the sandbox so people can feedback on which one would make the best candidate for posting to main. Is this acceptable if I keep the time between posting example images and posting to main reasonably short (a day or two)?&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Would it be better to approach this from the opposite direction and say the winner is the closest to the target image in 300 bytes? I think it can work as a question with insisting on an exact match though - I'm aiming to have several aspects to be golfed down, so even if not all are golfed well the total length should still be manageable. I prefer an exact match and open ended code length, as a byte limit has very different effects on different languages.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is there any general advice on what to remember/avoid when preparing the target image? Obviously this cannot be very specific advice as the exact method will not be discussed before posting to main. However, I welcome any hints at things that would make for a good challenge and things that would be trivial or too difficult. &lt;strong&gt;I'm definitely going to follow Peter Taylor's advice and avoid any crypto or Mandelbrot zooms. The image should be fairly easy to identify, so the emphasis can be on golfing down the components rather than solving a mystery.&lt;/strong&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Would it be better to say &quot;the original method will never be revealed&quot; or &quot;the original method will be revealed once an answer is posted that is shorter than it&quot; or &quot;the original method will be revealed after a set time period&quot;? The last one is my least favourite. I like the idea of a challenge being open ended, so I would prefer to reveal at most only what is already beaten by existing answers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I like the idea of using patterns that will be recognisable so people can say &quot;I know that pattern from somewhere&quot; and then look it up and tweak the parameters, rather than just presenting a random looking image that happens to have a simple description. Does this sound like an interesting challenge?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2015-08-16T21:51:27.223" LastActivityDate="2015-08-16T21:51:27.223" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5681" PostTypeId="2" ParentId="5677" CreationDate="2015-08-10T18:26:19.153" Score="19" Body="&lt;p&gt;My view, as a regular user and not as a moderator, is that there's really no way to consistently enforce this. There is no way to prevent a user from, say, emailing the winner of the challenge to offer a prize.&lt;/p&gt;&#xA;&lt;p&gt;So, the question we should really be asking is: &lt;strong&gt;Should we allow users to &lt;em&gt;publicly advertise&lt;/em&gt; cash prizes&lt;/strong&gt;, in a question or a comment?&lt;/p&gt;&#xA;&lt;p&gt;For that, we can turn to &lt;a href=&quot;https://meta.stackexchange.com/a/25621/180276&quot;&gt;a post on meta.SE by the Almighty Shog&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;If I know the answer but am not willing to put the time in to answer your question for free... then I'm probably not gonna do it for $20 either.&lt;/p&gt;&#xA;&lt;p&gt;But someone will.&lt;/p&gt;&#xA;&lt;p&gt;Guaranteed, someone, somewhere has time to burn and needs cash. No guarantee they know the answer, mind you... but they'll take a guess at it. And since they really need that $20, they'll likely hang around and down-vote any other answers, while picking fights with anyone who criticizes theirs. Just look at the little fights people get into over rep now, and spice it up with some desperation...&lt;/p&gt;&#xA;&lt;p&gt;So if you just want answers, and lots of 'em, but don't really care if they actually answer the question... And if you love flame wars... Then yes, this is a great idea.&lt;/p&gt;&#xA;&lt;p&gt;If you like anything about the way the site works now, then it's a terrible idea.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Granted, our site is a bit different in a few respects. We're not a &amp;quot;normal&amp;quot; Q&amp;amp;A site, so &amp;quot;do you really know the correct answer, or is that just a guess?&amp;quot; doesn't apply here. And, with an objective winning criterion, picking fights with other people's answers isn't really plausible.&lt;/p&gt;&#xA;&lt;p&gt;However, even though PPCG isn't straight Q&amp;amp;A, the same problem of &lt;a href=&quot;https://meta.stackexchange.com/q/42481/180276&quot;&gt;extrinsic motivation&lt;/a&gt; exists. Jon Ericson sums it up very effectively in the excellent linked post (well worth reading over):&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;If you want to make an omelet, you're going to break a few eggs.&lt;/p&gt;&#xA;&lt;p&gt;Just don't expect to get chickens.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Adding a real-world, tangible factor would only serve to exacerbate this issue. We'd be flooded with low-quality answers, and even worse, people might begin to prioritize answering questions that involve cash prizes, while ignoring others:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I love answering questions, but I also liked getting my number to go up. Pretty soon, I found that I made a little calculation before starting to answer a question: &amp;quot;Will this make enough of a difference in my number to be worth my time?&amp;quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;On top of that, the fact that the first meta.SE post I linked was &lt;a href=&quot;/questions/tagged/status-declined&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-declined&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-declined&lt;/a&gt; means that there'd be no way to enforce the OP's money/prize offers, making them sketchy at best.&lt;/p&gt;&#xA;&lt;p&gt;So. Here's what I propose:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;As a site policy, we edit out real-world prize offers on sight (and flag comments so they can be deleted).&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This &lt;a href=&quot;https://meta.stackoverflow.com/a/267264/1223693&quot;&gt;also appears to be the consensus on Meta Stack Overflow&lt;/a&gt;, and seems to me like the only real option.&lt;/p&gt;&#xA;&lt;p&gt;This doesn't need to be applied retroactively, but we can follow this guideline (assuming nobody opposes it) for any similar situation in the future.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-08-11T18:21:54.217" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5684" PostTypeId="1" CreationDate="2015-08-11T20:41:33.847" Score="8" ViewCount="103" Body="&lt;p&gt;Read this meta post:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1723/18487&quot;&gt;Let&amp;#39;s decide what kind of non-challenge questions we want once and for all&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Then read this close reason:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Questions without an &lt;b&gt;objective primary winning criterion&lt;/b&gt; are off-topic, as they make it impossible to indisputably decide which entry should win. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Do you see the conflict? We allow non-challenge questions, but our close reason says that they are off topic. We need to reword our close reason. I propose a one word change:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Challenges without an &lt;b&gt;objective primary winning criterion&lt;/b&gt; are off-topic, as they make it impossible to indisputably decide which entry should win. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;All I did was change the word &quot;Questions&quot; to &quot;Challenges.&quot; Problem solved. Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="78028" LastEditDate="2021-06-10T14:35:16.793" LastActivityDate="2021-06-10T14:35:16.793" Title="Close reason needs to be reworded" Tags="|feature-request|close-reasons|" AnswerCount="0" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5685" PostTypeId="2" ParentId="2140" CreationDate="2015-08-11T21:47:24.643" Score="0" Body="&lt;h1&gt;Is a picture worth a thousand words?&lt;/h1&gt;&#xA;&lt;p&gt;There is an old saying that goes &amp;quot;A picture is worth a thousand words&amp;quot;.&#xA;For us programmers, pictures and words are actually quantifiable in bytes.&#xA;(A word is worth &lt;code&gt;8&lt;/code&gt; bytes on a standard 64-bit system, a thousand words is worth &lt;code&gt;8000&lt;/code&gt; bytes, and an image is worth the number of bytes needed to store it in the particular format it is in.)&lt;/p&gt;&#xA;&lt;p&gt;Write a program or function that, given the path of an image as input, determines if it is or is not worth a thousand words. Print &lt;code&gt;worth it&lt;/code&gt; if it is, and &lt;code&gt;not worth it&lt;/code&gt; if it is not.&lt;/p&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, so the shortest answer wins!&lt;/p&gt;&#xA;&lt;h2&gt;Problems:&lt;/h2&gt;&#xA;&lt;p&gt;Too simple, maybe have the programs perform a check on the environment to determine actual word length?&lt;/p&gt;&#xA;&lt;p&gt;No test cases (Yet)&lt;/p&gt;&#xA;&lt;p&gt;Question is sort of short&lt;/p&gt;&#xA;" OwnerUserId="31133" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-08-11T21:47:24.643" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5686" PostTypeId="1" CreationDate="2015-08-12T08:40:55.447" Score="12" ViewCount="263" Body="&lt;p&gt;You can load this Snippet using the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5312/25180&quot;&gt;Arbitrary Stack Snippet Loader&lt;/a&gt;, with the following parameters:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;site = 'meta.codegolf';&lt;br&gt;&#xA;  postID = 5686;&lt;br&gt;&#xA;  isAnswer = false;&lt;br&gt;&#xA;  QUESTION_ID = ;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;QUESTION_ID is for the question that the answers could be cracked (the cops thread), &lt;strong&gt;NOT&lt;/strong&gt; for the question where the answers are cracking other answers. It doesn't matter where do you put the Snippet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It requires the comment to contain a link with &quot;cracked&quot; (case insensitive) in the link text, so it wouldn't be a problem if they talk about cracking without posting a real crack, OR there is a &quot;cracked&quot; in the first line of the answer, since we couldn't edit the comment if it wasn't in the right format. And it apparently has more rules that I have forgotten.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;var safe_list=[];&#xD;&#xA;var uncracked_list=[];&#xD;&#xA;var n=0;&#xD;&#xA;var bycreation=function(x,y){return (x[0][0]&amp;lt;y[0][0])-(x[0][0]&amp;gt;y[0][0]);};&#xD;&#xA;var bylength=function(x,y){return (x[0][1]&amp;gt;y[0][1])-(x[0][1]&amp;lt;y[0][1]);};&#xD;&#xA;function u(l,o){&#xD;&#xA;  jQuery(l[1]).empty();&#xD;&#xA;  l[0].sort(o);&#xD;&#xA;  for(var i=0;i&amp;lt;l[0].length;i++)&#xD;&#xA;    l[0][i][1].appendTo(l[1]);&#xD;&#xA;  if(l[0].length==0)&#xD;&#xA;    jQuery('&amp;lt;tr&amp;gt;&amp;lt;td colspan=&quot;3&quot; class=&quot;message&quot;&amp;gt;none yet.&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;').appendTo(l[1]);&#xD;&#xA;}&#xD;&#xA;function m(s) {&#xD;&#xA;  if('error_message' in s)&#xD;&#xA;    jQuery('#api_error').text('API Error: '+s.error_message);&#xD;&#xA;}&#xD;&#xA;function g(p) {&#xD;&#xA;  jQuery.getJSON('//api.stackexchange.com/2.2/questions/' + QUESTION_ID + '/answers?page=' + p + '&amp;amp;pagesize=100&amp;amp;order=desc&amp;amp;sort=creation&amp;amp;site=codegolf&amp;amp;filter=!.Fjs-H6J36w0DtV5A_ZMzR7bRqt1e', function(s) {&#xD;&#xA;    m(s);&#xD;&#xA;    s.items.map(function(a) {&#xD;&#xA;      var he = jQuery('&amp;lt;div/&amp;gt;').html(a.body).children().first();&#xD;&#xA;      he.find('strike').text('');&#xD;&#xA;      var h = he.text();&#xD;&#xA;      if (!/cracked/i.test(h) &amp;amp;&amp;amp; (typeof a.comments == 'undefined' || a.comments.filter(function(b) {&#xD;&#xA;        var c = jQuery('&amp;lt;div/&amp;gt;').html(b.body);&#xD;&#xA;        return /^cracked/i.test(c.text()) || c.find('a').filter(function() {&#xD;&#xA;          return /cracked/i.test(jQuery(this).text())&#xD;&#xA;        }).length &amp;gt; 0&#xD;&#xA;      }).length == 0)) {&#xD;&#xA;        var m = /^\s*((?:[^,;(\s]|\s+[^-,;(\s])+)\s*(?:[,;(]|\s-).*?([0-9]+)/.exec(h);&#xD;&#xA;        var e = [[n++, m ? parseInt(m[2]) : null],&#xD;&#xA;          jQuery('&amp;lt;tr/&amp;gt;').append(&#xD;&#xA;            jQuery('&amp;lt;td/&amp;gt;').append(&#xD;&#xA;              jQuery('&amp;lt;a/&amp;gt;').text(m ? m[1] : h).attr('href', a.link)),&#xD;&#xA;            jQuery('&amp;lt;td class=&quot;score&quot;/&amp;gt;').text(m ? m[2] : '?'),&#xD;&#xA;            jQuery('&amp;lt;td/&amp;gt;').append(&#xD;&#xA;              jQuery('&amp;lt;a/&amp;gt;').text(a.owner.display_name).attr('href', a.owner.link))&#xD;&#xA;          )];&#xD;&#xA;        if(/safe/i.test(h))&#xD;&#xA;          safe_list.push(e);&#xD;&#xA;        else&#xD;&#xA;          uncracked_list.push(e);&#xD;&#xA;      }&#xD;&#xA;    });&#xD;&#xA;    if (s.items.length == 100)&#xD;&#xA;      g(p + 1);&#xD;&#xA;    else {&#xD;&#xA;      var s=[[uncracked_list, '#uncracked'], [safe_list, '#safe']];&#xD;&#xA;      for(var i=0;i&amp;lt;2;i++)&#xD;&#xA;        u(s[i],bylength);&#xD;&#xA;      jQuery('#uncracked_by_length').bind('click',function(){u(s[0],bylength);return false});&#xD;&#xA;      jQuery('#uncracked_by_creation').bind('click',function(){u(s[0],bycreation);return false});&#xD;&#xA;    }&#xD;&#xA;  }).error(function(e){&#xD;&#xA;    m(e.responseJSON);&#xD;&#xA;  });&#xD;&#xA;}&#xD;&#xA;g(1);&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-css lang-css prettyprint-override&quot;&gt;&lt;code&gt;table th,&#xD;&#xA;table td {&#xD;&#xA;  padding: 5px;&#xD;&#xA;}&#xD;&#xA;th {&#xD;&#xA;  text-align: left;&#xD;&#xA;}&#xD;&#xA;.score {&#xD;&#xA;  text-align: right;&#xD;&#xA;}&#xD;&#xA;table a {&#xD;&#xA;  display: block;&#xD;&#xA;}&#xD;&#xA;.main {&#xD;&#xA;  float: left;&#xD;&#xA;  margin-right: 30px;&#xD;&#xA;}&#xD;&#xA;.main h3,&#xD;&#xA;.main div {&#xD;&#xA;  margin: 5px;&#xD;&#xA;}&#xD;&#xA;.message {&#xD;&#xA;  font-style: italic;&#xD;&#xA;}&#xD;&#xA;#api_error {&#xD;&#xA;  color: red;&#xD;&#xA;  font-weight: bold;&#xD;&#xA;  margin: 5px;&#xD;&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xD;&#xA;&amp;lt;link rel=&quot;stylesheet&quot; type=&quot;text/css&quot; href=&quot;//cdn.sstatic.net/Sites/codegolf/all.css?v=7509797c03ea&quot;&amp;gt;&#xD;&#xA;&amp;lt;div id=&quot;api_error&quot;&amp;gt;&amp;lt;/div&amp;gt;&#xD;&#xA;&amp;lt;div class=&quot;main&quot;&amp;gt;&#xD;&#xA;&amp;lt;h3&amp;gt;Uncracked submissions&amp;lt;/h3&amp;gt;&#xD;&#xA;&amp;lt;table&amp;gt;&#xD;&#xA;  &amp;lt;tr&amp;gt;&#xD;&#xA;    &amp;lt;th&amp;gt;Language&amp;lt;/th&amp;gt;&#xD;&#xA;    &amp;lt;th class=&quot;score&quot;&amp;gt;Length&amp;lt;/th&amp;gt;&#xD;&#xA;    &amp;lt;th&amp;gt;User&amp;lt;/th&amp;gt;&#xD;&#xA;  &amp;lt;/tr&amp;gt;&#xD;&#xA;  &amp;lt;tbody id=&quot;uncracked&quot;&amp;gt;&amp;lt;/tbody&amp;gt;&#xD;&#xA;&amp;lt;/table&amp;gt;&#xD;&#xA;&amp;lt;div&amp;gt;Sort by:&#xD;&#xA;  &amp;lt;a href=&quot;#&quot; id=&quot;uncracked_by_length&quot;&amp;gt;length&amp;lt;/a&amp;gt;&#xD;&#xA;  &amp;lt;a href=&quot;#&quot; id=&quot;uncracked_by_creation&quot;&amp;gt;creation&amp;lt;/a&amp;gt;&#xD;&#xA;&amp;lt;/div&amp;gt;&#xD;&#xA;&amp;lt;/div&amp;gt;&#xD;&#xA;&amp;lt;div class=&quot;main&quot;&amp;gt;&#xD;&#xA;&amp;lt;h3&amp;gt;Safe submissions&amp;lt;/h3&amp;gt;&#xD;&#xA;&amp;lt;table&amp;gt;&#xD;&#xA;  &amp;lt;tr&amp;gt;&#xD;&#xA;    &amp;lt;th&amp;gt;Language&amp;lt;/th&amp;gt;&#xD;&#xA;    &amp;lt;th class=&quot;score&quot;&amp;gt;Length&amp;lt;/th&amp;gt;&#xD;&#xA;    &amp;lt;th&amp;gt;User&amp;lt;/th&amp;gt;&#xD;&#xA;  &amp;lt;/tr&amp;gt;&#xD;&#xA;  &amp;lt;tbody id=&quot;safe&quot;&amp;gt;&amp;lt;/tbody&amp;gt;&#xD;&#xA;&amp;lt;/table&amp;gt;&#xD;&#xA;&amp;lt;/div&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-04-11T00:03:39.327" Title="Cops and robbers not yet cracked answers Stack Snippet" Tags="|discussion|stack-snippets|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5687" PostTypeId="2" ParentId="5686" CreationDate="2015-08-12T09:39:26.520" Score="1" Body="&lt;h3&gt;Example usage&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script&amp;gt;site = 'meta.codegolf'; postID = 5686; isAnswer = false; QUESTION_ID = 40932;&amp;lt;/script&amp;gt;&amp;lt;script src='https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js'&amp;gt;&amp;lt;/script&amp;gt;&amp;lt;script&amp;gt;jQuery(function(){var u='https://api.stackexchange.com/2.2/';if(isAnswer)u+='answers/'+postID+'?order=asc&amp;amp;sort=creation&amp;amp;site='+site+'&amp;amp;filter=!GeEyUcJFJeRCD';else u+='questions/'+postID+'?order=asc&amp;amp;sort=creation&amp;amp;site='+site+'&amp;amp;filter=!GeEyUcJFJO6t)';jQuery.get(u,function(b){function d(s){return jQuery('&amp;lt;textarea&amp;gt;').html(s).text()};function r(l){return new RegExp('&amp;lt;pre class=&quot;snippet-code-'+l+'\\b[^&amp;gt;]*&amp;gt;&amp;lt;code&amp;gt;([\\s\\S]*?)&amp;lt;/code&amp;gt;&amp;lt;/pre&amp;gt;')};b=b.items[0].body;var j=r('js').exec(b),c=r('css').exec(b),h=r('html').exec(b);if(c!==null)jQuery('head').append(jQuery('&amp;lt;style&amp;gt;').text(d(c[1])));if (h!==null)jQuery('body').append(d(h[1]));if(j!==null)jQuery('body').append(jQuery('&amp;lt;script&amp;gt;').text(d(j[1])))})})&amp;lt;/script&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2015-08-12T09:39:26.520" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5688" PostTypeId="1" CreationDate="2015-08-12T13:21:51.443" Score="20" ViewCount="1060" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Notice:&lt;/strong&gt; We have moved on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5744/8478&quot;&gt;to the election phase&lt;/a&gt;. Latecomers are still welcome to nominate themselves to run for moderator, but should expect to be at a disadvantage because voting for the other candidates has already begun.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;With elections still tied to site graduation, we (your current pro tem moderators) have been informed that there's an open spot for another pro tempore moderator for PPCG. However, there are several highly active users who we think would make great moderators, so there is no obvious choice. Therefore, we'll be holding a small informal election here on meta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please post one nomination per answer. Self-nominations are allowed. Nominations should include a couple of paragraphs for why the user is a good candidate. If you were nominated by someone else, please comment or edit the post to indicate whether you accept the nomination or not. Nominations will be open for one week.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To avoid a fastest-gun-in-the-west effect, a separate thread will be posted for the actual election after nominations close.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-08-19T14:25:05.547" Title="We're getting a new moderator: Call for Nominations" Tags="|discussion|moderators|" AnswerCount="7" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5689" PostTypeId="2" ParentId="5688" CreationDate="2015-08-12T14:07:11.520" Score="30" Body="&lt;p&gt;I'd like to nominate &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/194/peter-taylor&quot;&gt;Peter Taylor&lt;/a&gt;&lt;/strong&gt;, as one of the oldest, most active, most level-headed and also most knowledgeable members on this site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Peter is always quick to offer suggestions to challenges, and is often seen rewording questions or providing good additional test cases. Four years of experience come in handy too — Peter's vast knowledge on (seemingly) every code-golf question gives him an internal duplicate question detector, typically put to good use in the sandbox before it is too late.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the meta side of things, Peter is always keen to improve the site, including the recent &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5658/retagging-time-complexity&quot;&gt;retagging of time-complexity&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5609/21487&quot;&gt;custom off-topic reason&lt;/a&gt; proposal.&lt;/p&gt;&#xA;" OwnerUserId="21487" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2015-08-12T14:07:11.520" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5690" PostTypeId="2" ParentId="5688" CreationDate="2015-08-12T18:41:40.267" Score="-9" Body="&lt;p&gt;&lt;strong&gt;I nominate no one.&lt;/strong&gt; That is, I think we should keep the mod spot open and leave our current moderator setup as is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we really need a new mod - like if the current mods are swamped with flags and whatnot - then getting a new mod is a good idea. But if the reason for getting a new mod is &lt;em&gt;merely to fill an open slot&lt;/em&gt;, then getting a new mod is a rather hollow idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not saying there aren't a few users who would be decent mods, it's just that I'm happy with our current mod setup and don't see the need to change things. As far as I can recall, PPCG has been successfully managed by two mods (Doorknob and Chris/Martin).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, I'm a relatively new user (member for ~1 year) so don't be afraid to downvote if you disagree.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="26997" LastEditDate="2015-08-12T19:30:54.530" LastActivityDate="2015-08-12T19:30:54.530" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5691" PostTypeId="2" ParentId="5688" CreationDate="2015-08-12T19:04:48.683" Score="20" Body="&lt;p&gt;I'd like to nominate myself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sure, I haven't been around as long as others, just about 1.25 years, but I'm absolutely addicted to PPCG and I will do anything I can to ensure the health and longevity of the site. I've wanted to be a moderator about as long as I've known that moderators exist.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I try my best to ensure a welcoming environment for new users and I like to be friendly to everyone. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5246/20469&quot;&gt;This meta post&lt;/a&gt; illustrates that point well. According to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users&quot;&gt;meta participating ranking&lt;/a&gt;, I'm the second most active user on meta. I always make time in my day for PPCG, which is how I got the Fanatic badge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I &lt;em&gt;enjoy&lt;/em&gt; going through flags. I've spent a lot of time going through the review queues on multiple sites. I always try to leave meaningful comments and vote accordingly. I've earned the Pundit and Electorate badges on this site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't really know what else to say here, so if you have questions or suggestions for me I'd be happy to address them in edits here. Will I get elected? Probably not, but it's worth a shot!&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2015-08-16T00:06:08.900" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="5692" PostTypeId="2" ParentId="5688" CreationDate="2015-08-12T20:49:29.223" Score="2" Body="&lt;p&gt;I'm gonna have a go at nominating myself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Being a high school student and all, I have a lot more time on my hands than someone with a job might do, so I'll be able to patrol PPCG more than most people.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you don't find me in the Nineteenth Byte, then I'm probably asleep or gone for a couple of hours, so there's only a few times when I'm inaccessible. Even then, I have phone notifications which  tell me if someone contacts me.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a fairly new user with just over year under my belt, I likely have a slight naivety which could be helpful when dealing with new users. This is something that the various veterans of PPCG may not be able to do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my school (in the UK) we have a large number of boarders from countries such as Hong Kong, China and Russia. Due to the necessity of communication, I am probably better at interpreting broken English than the average Briton/Middle American/Other English national. Of course, someone whose English isn't their first language is going to be better at this, but don't let this stop you. :)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a student, I have little knowledge of the outside except a week's work experience, so moderating will give me experience of working for a larger company.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Alright, thanks :)&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="30525" LastEditDate="2015-08-14T19:04:09.780" LastActivityDate="2015-08-14T19:04:09.780" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5693" PostTypeId="2" ParentId="5688" CreationDate="2015-08-13T02:05:20.613" Score="37" Body="&lt;p&gt;I'd also like to nominate &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;&lt;strong&gt;Dennis&lt;/strong&gt;&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you've spent more than a few minutes on the site, you've undoubtedly seen one of his amazing CJam answers. Dennis is an exceptionally kind, level-headed person and is very active on the site, as well as other SE sites. He knows a lot about how things work here, where he has &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=Reputation&amp;amp;filter=all&quot;&gt;the second highest reputation on the site&lt;/a&gt;, and on the Stack Exchange network as a whole. He's active on Meta.SE and has over 18k reputation there. He's a natural choice for moderator and would do a fantastic job.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Dennis has moderated on other (non-SE) sites and in 2012 ran in a Stack Overflow moderator election. He is a natural teacher, having taught high school and college. There are several things you learn how to do being a teacher (paraphrased from his SO election nomination):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Be patient when dealing with people who can't see the error of their ways&lt;/li&gt;&#xA;&lt;li&gt;Deal appropriately with major infractions&lt;/li&gt;&#xA;&lt;li&gt;Approach people committing minor infractions&lt;/li&gt;&#xA;&lt;li&gt;Analyze reactions to your own moderation&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There are a lot of great reasons to support Dennis, so I've made this a CW so that anyone can add to it and put in their two cents.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-08-14T17:58:35.407" CommentCount="3" CommunityOwnedDate="2015-08-13T02:05:20.613" ContentLicense="CC BY-SA 3.0" />
  <row Id="5694" PostTypeId="2" ParentId="2140" CreationDate="2015-08-13T02:46:38.467" Score="2" Body="&lt;h1&gt;Weight Configuration&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Gyms have machines that contain a stack of weights and a pin. You insert the pin into the hole that matches the amount of resistance you want, and then you work out. However, the machines often have an additional set of smaller weights at the top that are pinned onto a fixed piece of the machine; you can unpin these weight and slide them down to sit on top of the big stack to add a few more options for your workout. In ASCII form, these weight stacks look something like this (this one is annotated):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-----------   }- top of stack, always required&#xA;___|___|___   \&#xA;|____5____|   |&#xA;___|___|___   |&#xA;|____5____|   |&#xA;   |   |      }- &quot;neck&quot; section&#xA;   |   |      |&#xA;   |   |      |&#xA; __|___|__    /&#xA;_|_____o_|_   \&#xA;|_20___o__|   |&#xA;|_30___o__|   |&#xA;|_40___o__|   }- weight stack&#xA;|_50___o__|   |&#xA;|_60___o__|   /&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;...and so on. Notice that there is a smaller block on top of the big stack that has no number; putting the pin in this block means there is no extra resistance beyond the base amount the machine provides. If you wanted to exercise with only 5 or 10 resistance on this machine, you would put the pin in this block and then unpin one of the extra weights.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given the number of small weights on the machine, the configuration of the large weights, and the level of resistance someone wants to work out at, you must output a picture of the correct configuration of weights so that the given resistance is met. The small weights always have a value of 5 (pounds, kilos, stones, whatever). For example:&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input:&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3 [20,30,40,50,65,80,100] 45&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Output:&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-----------&#xA;___|___|___   &#xA;|____5____|&#xA;___|___|___   &#xA;|____5____|&#xA;   |   |&#xA;   |   |&#xA;   |   |&#xA;   |   |&#xA;___|___|___   &#xA;|____5____|&#xA;_|_____o_|_&#xA;|_20___o__|&#xA;|_30___o__|&#xA;|_40___O__|&#xA;|_50___o__|&#xA;|_60___o__|&#xA;|_70___o__|&#xA;|_80___o__|&#xA;|_90___o__|&#xA;|_100__o__|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;One of the &lt;code&gt;5&lt;/code&gt; weights has been unpinned and now sits on the stack; the &lt;code&gt;40&lt;/code&gt; weight has the pin in it (as denoted by the capital &lt;code&gt;O&lt;/code&gt;). Another valid solution would be to put the pin in the &lt;code&gt;30&lt;/code&gt; weight and slide all of the extra weights down onto the stack, as both would achieve 45. That would look like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-----------&#xA;   |   |&#xA;   |   |&#xA;   |   |&#xA;   |   |&#xA;   |   |&#xA;   |   |    &#xA;___|___|___   &#xA;|____5____|  &#xA;|____5____|   &#xA;|____5____|&#xA;_|_____o_|_&#xA;|_20___o__|&#xA;|_30___O__|&#xA;|_40___o__|&#xA;|_50___o__|&#xA;|_60___o__|&#xA;|_70___o__|&#xA;|_80___o__|&#xA;|_90___o__|&#xA;|_100__o__|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Notice the length of the &quot;neck&quot; in both cases of the machine; the number of rows in the neck section must be exactly &lt;code&gt;2*(number of extra weights)+4&lt;/code&gt;. In this case, since there are 3 extra weights, that number is 10. No matter how the extra weights are positioned, there must be 10 rows (because when you slide a weight down the neck, part of the neck doesn't disappear!), and extra weights that are pinned at the top must have a row of neck between them (as in the examples). Since the weights slide down, the lowest weight must be used first, then the next, and so on. All the &lt;code&gt;5&lt;/code&gt;s are centered, and all of the numbers on the large weights are left-aligned to the third column.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input specifications:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The three pieces may be inputted in any format you like (newline separated, space separated, list in any format of your choosing, etc), subject to the following restrictions: The number of extra weights is always the first piece of input and will be between 0 and 4. The list of weights is the next input; each element will be between 15 and 200 and a multiple of 5; the whole list may be assumed to be sorted. The target resistance is last and will be between 0 and 220; it will also be a multiple of 5.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output specifications:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Output a weight stack as specified above, with the pin in the appropriate place and the appropriate extra weights slid down onto the stack such that the target resistance is met. If the target resistance can't be met with the given configuration, you may either output an unmodified stack (with all extra weights pinned at the top, and no pin inserted), an error message, or nothing. Some resistances have multiple configurations that achieve it; you are only required to output one of them, and your program need not output the same one every time.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Whitespace:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Trailing whitespace on lines is okay and need not be uniform.&lt;/li&gt;&#xA;&lt;li&gt;Leading whitespace on lines is acceptable as long as the leading whitespace on each line is the same (this doesn't include the whitespace required to draw the neck section or zero-weight pin block).&lt;/li&gt;&#xA;&lt;li&gt;Leading and trailing newlines are acceptable.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so lowest byte count wins. Multiply your byte-count by 0.9 if instead of only outputting one configuration when there are multiple solutions, you output all of them (either side-by-side with at least one empty column between them, or one after the other with at least one blank line between them).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Suggestions? I think the neck bit is a little confusing and there may be too much going on.&lt;/p&gt;&#xA;" OwnerUserId="19349" LastEditorUserId="19349" LastEditDate="2015-08-13T03:44:36.397" LastActivityDate="2015-08-13T03:44:36.397" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="5695" PostTypeId="2" ParentId="5688" CreationDate="2015-08-13T03:17:33.653" Score="21" Body="&lt;p&gt;I would like to nominate myself for moderator.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've been a member of PPCG for &lt;em&gt;aeons.&lt;/em&gt; (since 2011, almost a whole other decade.)  Visited 892 days total (that's like 2 and a half years) and have earned the fanatic badge.  I think I'm known for hanging out in the chat room, regardless of my personal schedule. There's a reason I've visited this site every day this week despite marching band camp from 9 AM to 9 PM.  That reason: I'm physically addicted.  I have a few other accomplishments of which I'm proud, such as asking both of the most-answered threads (the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/40932/unscramble-the-source-code&quot;&gt;Unscramble the Source Code&lt;/a&gt; cops-and-robbers).  But enough about usage statistics.    &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I have prior moderation experience on a small website called Fluther.com, which is a discussion-based general Q&amp;amp;A forum.  (&lt;a href=&quot;http://www.fluther.com/help/moderators/&quot; rel=&quot;nofollow noreferrer&quot;&gt;proof&lt;/a&gt;).  Not exactly an SE site, but it still has ~100 active users.  I became a mod at age 13 (?) and eventually moved up in rank until I got access to the site's back-end and improved the moderation tools and flagging system myself.  I think this is an example of dedication.  I had little-to-no Linux/Bash/ssh/vi/Python/Django(!)/HTML experience before making the decision to improve the mod tools, but I taught myself and figured out how to do it. It was slightly insane.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, I probably won't be able to pull off a similar feat on SE (unless I pull a CJY), but this shows that I am willing to do a lot of behind-the-scenes work to improve a website.  Other behind-the-scenes work involved collaborating to write massive moderator announcements, or writing up mod election procedures.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are some significant differences between the two websites, mainly in Fluther having a much broader range of topics and being a &quot;free discussion&quot;-based forum (the question and all of its answers form one long conversation).  This means that a lot of my moderation went towards handling &quot;personal attacks&quot; and other things which thankfully don't seem to happen on PPCG as much.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Don't get me wrong, though.  Most of the mod-related work on Fluther and on SE is about handling flags. Everyone who's ever been a site mod knows about &quot;the grind&quot; and I have been there and done that, yet am still applying for another mod job, somehow.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Outside of PPCG, I enjoy eating, sleeping, marching band, and some other things (and I go to college in my free time).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;My campaign HQ is located here: &lt;a href=&quot;http://chat.stackexchange.com/rooms/26953/phi-for-mod&quot;&gt;http://chat.stackexchange.com/rooms/26953/phi-for-mod&lt;/a&gt;&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I'll probably add more to this later.)&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-08-14T02:42:46.583" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5697" PostTypeId="2" ParentId="2140" CreationDate="2015-08-14T03:55:25.977" Score="0" Body="&lt;h2&gt;Write an Adblocker!&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Introduction&lt;/h3&gt;&#xA;&lt;p&gt;You've gotten tired of reading text ads dispersed throughout your content.&#xA;You've tried solving this problem using a simple find-and-replace solution, but the advertisers have wisened up!&#xA;Every text ad now comes in slightly different variations to slip past your filter.&lt;/p&gt;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Write an adblocker that, given a sample ad, removes all variations of it from the content.&#xA;Your program must remove every sentence in the input for which 75% of its words are identical, and in the same location.&lt;/p&gt;&#xA;&lt;p&gt;This is codegolf, shortest answer in bytes wins!&lt;/p&gt;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&lt;p&gt;Given an example sentence from an advertisement, such as&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;Buy my computer now with cheap free shipping.&lt;/code&gt;&lt;/p&gt;&#xA;&lt;br&gt;&#xA;&lt;p&gt;&lt;code&gt;Buy my laptop today with cheap free shipping.&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;is an ad because 6 out of 8 words (&amp;gt;= 75%) are identical and in the same locations.&lt;/p&gt;&#xA;&lt;br&gt;&#xA;&lt;p&gt;&lt;code&gt;The computer was expensive but shipping was free.&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;is not an ad because 0 out of 8 words (&amp;lt; 75%) are identical and in the same location.&#xA;Note how &lt;code&gt;computer&lt;/code&gt;, &lt;code&gt;shipping&lt;/code&gt;, and &lt;code&gt;free&lt;/code&gt; don't count as identical because they are in different positions in the sentence.&lt;/p&gt;&#xA;&lt;p&gt;If a sentence is not the same length as the ad, it isn't an ad.&lt;/p&gt;&#xA;&lt;h3&gt;Bonus&lt;/h3&gt;&#xA;&lt;p&gt;After matching an ad, remember which words were used as replacements, and use them to match future ads.&lt;/p&gt;&#xA;&lt;p&gt;For example, when &lt;code&gt;Buy my laptop today with cheap free shipping.&lt;/code&gt; was matched to the given sample &lt;code&gt;Buy my computer now with cheap free shipping.&lt;/code&gt;, your program should remember that &lt;code&gt;laptop&lt;/code&gt; and &lt;code&gt;today&lt;/code&gt; are synonyms for &lt;code&gt;computer&lt;/code&gt; and &lt;code&gt;now&lt;/code&gt;, respectively.&lt;/p&gt;&#xA;&lt;p&gt;If &lt;code&gt;laptop&lt;/code&gt; or &lt;code&gt;today&lt;/code&gt; are ever encountered in a future sentence, they should be matched with their synonyms in the ad.&lt;/p&gt;&#xA;&lt;p&gt;Your program only needs to match synonyms in content that appears after the synonym was found.&lt;/p&gt;&#xA;&lt;p&gt;So, if the sentence &lt;code&gt;Purchase my laptop today with cheap free shipping.&lt;/code&gt; was encountered after your program found out about the aforementioned synonyms, it would match because 7 out of 8 words matched in the same location (&amp;gt;= 75%). Note that a program that doesn't claim the bonus would only match 5 out of 8 words (&amp;lt; 75%), and would not consider the sentence an ad.&lt;/p&gt;&#xA;&lt;p&gt;Your program should then proceed to make note that &lt;code&gt;Purchase&lt;/code&gt; is a synonym for &lt;code&gt;Buy&lt;/code&gt;, and continue processing the content.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Programs claiming this bonus can claim a 35% reduction of their score, i.e. &lt;code&gt;score_with_bonus = number_of_bytes * 0.65&lt;/code&gt;.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;Accept one sentence as a sample advertisement followed by a number of sentences of content.&#xA;Only letters of the alphabet, spaces, and periods will appear in the input.&lt;/p&gt;&#xA;&lt;p&gt;Input may be taken in any convenient format for your language. For example, accepting a string for the ad sentence and an array of strings for the content is acceptable.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;Output the content without the ad variations.&#xA;The content must be in the same order.&lt;/p&gt;&#xA;&lt;p&gt;The output may come in any reasonable format for your language. For example, printing to a file or stdout is acceptable. If your language makes it easier to output an array like &lt;code&gt;[&amp;quot;Content 1&amp;quot;, &amp;quot;Content 2&amp;quot;, ...]&lt;/code&gt;, or in a similar such format, this is acceptable.&lt;/p&gt;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Two for one deal on lumber for a limited time only.&#xA;    &#xA;Make sure to pace yourself well when you run long distances.&#xA;You don't want to tire too quickly.&#xA;Three for one deal on tires for a limited time only.&#xA;Training is a must.&#xA;Two for one deal on lumber for a limited time only.&#xA;Three for one deal on tires for a short period only.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/em&gt; (with bonus)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Make sure to pace yourself well when you run long distances.&#xA;You don't want to tire too quickly.&#xA;Training is a must.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/em&gt; (no bonus)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Make sure to pace yourself well when you run long distances.&#xA;You don't want to tire too quickly.&#xA;Training is a must.&#xA;Three for one deal on tires for a short period only.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Notes&lt;/h3&gt;&#xA;&lt;p&gt;You may write a program or function.&lt;/p&gt;&#xA;&lt;p&gt;More test cases to come!&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;This is my first challenge, so please give suggestions on how to improve!&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;In particular, comments on whether or not the bonus is appropriate would be appreciated. Also, it would be nice to know thoughts concerning the challenge as a whole (good, bad, too easy, too hard...?), so that I can better frame future ideas!&lt;/em&gt;&#xA;&lt;em&gt;Thanks!&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="42844" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-08-16T01:36:23.863" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5706" PostTypeId="2" ParentId="5688" CreationDate="2015-08-14T17:11:00.130" Score="6" Body="&lt;p&gt;I'd like to nominate myself, &lt;a href=&quot;https://codegolf.stackexchange.com/users/9275/programfox&quot;&gt;ProgramFOX&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I've been a member of PPCG for almost 2 years and I'm an enthusiast user of the site.&lt;/li&gt;&#xA;&lt;li&gt;I have enough time to be able to moderate the site.&lt;/li&gt;&#xA;&lt;li&gt;I always try to be polite, and I believe I'm successful at this.&lt;/li&gt;&#xA;&lt;li&gt;If I don't know something, I'm honest about that, and I'll be happy to learn from the other moderators.&lt;/li&gt;&#xA;&lt;li&gt;I participate on Meta PPCG (and also on &lt;a href=&quot;https://meta.stackexchange.com/users/229438/programfox&quot;&gt;Meta Stack Exchange&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;li&gt;I'm active in the review queues and frequently make use of the &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/moderator-tools&quot;&gt;moderation tools for 2k+ users&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;I &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=Voters&amp;amp;filter=all&quot;&gt;vote&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=Editors&amp;amp;filter=all&quot;&gt;edit&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;I lurk around in &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;, the site's chat room, so you can ping me there whenever you need.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="9275" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2015-08-14T17:11:00.130" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5719" PostTypeId="2" ParentId="2140" CreationDate="2015-08-15T11:45:41.933" Score="0" Body="&lt;p&gt;(Possible deadlines?)&lt;/p&gt;&#xA;&lt;h1&gt;The robber and the bank (Bank managers)&lt;/h1&gt;&#xA;&lt;h2&gt;(Based off 'Two makes all the difference')&lt;/h2&gt;&#xA;&lt;p&gt;A group of robbers has decided to break into a bank, but one of the members leaked the information to the bank. To stop the robbers from getting any money, they have decided to change the combination on each vault to something more complicated.&lt;/p&gt;&#xA;&lt;h2&gt;Your task&lt;/h2&gt;&#xA;&lt;p&gt;As you are a bank manager, you must figure out a new combination of rotations for the wheel lock system of the vaults. The vaults take 7 turns each, represented in degrees. You must write a program that takes 10 integers (separated in any way you like) and outputs the processed integers &lt;strong&gt;which have been made from the originals.&lt;/strong&gt; This is important, as you cannot use a randomizing function to make the new combination.&lt;/p&gt;&#xA;&lt;h3&gt;Sample input:&lt;/h3&gt;&#xA;&lt;p&gt;(Note: The numbers will all be multiples of 5. The output should also be this way.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;10, 50, -230, 110, 20, -5, 50, 80, 30, -50&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Sample output:&lt;/h3&gt;&#xA;&lt;p&gt;&lt;code&gt;30, 110, -110, 230, 50, 115, 110, 170, 70, 70&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;This result is obtained by the simple (Python 3) algorithm (deliberately non-golfed)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;inputlist = input('list')&#xA;for i in len(inputlist):&#xA;    if inputlist(i) &amp;gt; 0:&#xA;        inputlist(i) *= 2&#xA;        inputlist(i) += 10&#xA;    else:&#xA;        inputlist(i) += 120&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Note the abscence of a condition for 0 degrees, as a wheel lock would not take such a value. Also note the fact that the algorithm is a full program, not just a function that would do the same.)&lt;/p&gt;&#xA;&lt;h2&gt;Winning conditions&lt;/h2&gt;&#xA;&lt;p&gt;The shortest uncracked algorithm wins. In case there are two algorithms that have the same length and are uncracked, the one with more votes will win.&lt;/p&gt;&#xA;&lt;h1&gt;The robber and the bank (Robbers)&lt;/h1&gt;&#xA;&lt;p&gt;Your group of robbers are breaking into a bank! However, one of your members seems to have leaked the information to the bank managers. Your team manages to hack the bank's system to retrieve the original password and part of the algorithm, but your connection was cut.&lt;/p&gt;&#xA;&lt;h2&gt;Your task&lt;/h2&gt;&#xA;&lt;p&gt;You will receive 10 integers and a snippet of code (need help deciding how much) from the algorithm used to change the lock's combination. You will need to deduce what the algorithm is and finally the new combination.&lt;/p&gt;&#xA;&lt;h3&gt;Sample information:&lt;/h3&gt;&#xA;&lt;p&gt;&lt;code&gt;10, 50, -230, 110, 20, -5, 50, 80, 30, -50&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;Part of code&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Sample answer:&lt;/h3&gt;&#xA;&lt;p&gt;&lt;code&gt;30, 110, -110, 230, 50, 115, 110, 170, 70, 70&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;Code (optional)&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Winning conditions&lt;/h2&gt;&#xA;&lt;p&gt;The robber with the most vaults (algorithms/combinations) cracked wins. In the case that there are two robbers with the same number of cracked vaults, the robber with more votes will win.&lt;/p&gt;&#xA;&lt;p&gt;(Any way to separate who wants to be a robber and who wants to be a manager? Perhaps a separate system for answering?)&lt;/p&gt;&#xA;" OwnerUserId="42940" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-08-24T13:22:41.260" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5726" PostTypeId="2" ParentId="2140" CreationDate="2015-08-16T04:39:54.777" Score="1" Body="&lt;h1&gt;Sorting trains&lt;/h1&gt;&#xA;&lt;p&gt;This problem is based off of a solitaire card game called &lt;a href=&quot;https://en.wikipedia.org/wiki/Calculation_(card_game)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Calculation&lt;/a&gt;.  You can play it &lt;a href=&quot;http://greenfelt.net/calculation&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; (highly recommended).&lt;/p&gt;&#xA;&lt;p&gt;You are in charge of designing a &lt;a href=&quot;https://en.wikipedia.org/wiki/Rail_yard&quot; rel=&quot;nofollow noreferrer&quot;&gt;train yard&lt;/a&gt;.  At your junction, you have an In/Out track (queues) and Storage (stack).  &lt;strong&gt;Train cars come in a random order; your job is to arrange them into 4 different ordered trains.&lt;/strong&gt;  Land is expensive, so we need you to &lt;strong&gt;minimize the amount of storage tracks we need.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your &lt;a href=&quot;https://en.wikipedia.org/wiki/Rail_car_mover&quot; rel=&quot;nofollow noreferrer&quot;&gt;rail car mover&lt;/a&gt; can only handle 1 train at a time, and move a car:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;In track -&amp;gt; Out track&lt;/li&gt;&#xA;&lt;li&gt;In track -&amp;gt; Storage track&lt;/li&gt;&#xA;&lt;li&gt;Storage track -&amp;gt; Out track.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;strong&gt;Each Out Track needs the same 25 cars, each in a different order:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Track 1: 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,0&#xA;Track 2: 2,4,6,8,10,12,14,16,18,20,22,24,1,3,5,7,9,11,13,15,17,19,21,23,0&#xA;Track 3: 3,6,9,12,15,18,21,24,2,5,8,11,14,17,20,23,1,4,7,10,13,16,19,22,0&#xA;Track 4: 4,8,12,16,20,24,3,7,11,15,19,23,2,6,10,14,18,22,1,5,9,13,17,21,0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We can use &lt;code&gt;(nx+n) mod 25&lt;/code&gt; to calculate ID of the &lt;code&gt;x&lt;/code&gt;th car of the &lt;code&gt;n&lt;/code&gt;th track.&lt;/p&gt;&#xA;&lt;h3&gt;Important notes:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Storage tracks can store as many cars as you want, but you can only remove the most recently placed car&lt;/li&gt;&#xA;&lt;li&gt;Cars cannot be moved from one storage track to another&lt;/li&gt;&#xA;&lt;li&gt;Your algorithm must be deterministic (it must do the same thing given the same input queue and the same number of storage stacks)&lt;/li&gt;&#xA;&lt;li&gt;You may get into an impossible situation, where you end up not being able to order the trains.  If that happens, try again with additional storage tracks.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Input:&lt;/h3&gt;&#xA;&lt;p&gt;Your input is a list of integers, where each integer is the ID of the train car.&lt;/p&gt;&#xA;&lt;h3&gt;Output:&lt;/h3&gt;&#xA;&lt;p&gt;You need to return a list of moves that sorts the cars into the Out tracks.  A move looks like &lt;code&gt;I-&amp;gt;S1&lt;/code&gt; or &lt;code&gt;S1-&amp;gt;O2&lt;/code&gt;, where &lt;code&gt;I&lt;/code&gt; is the input track, &lt;code&gt;S#&lt;/code&gt; is a storage track, and &lt;code&gt;O#&lt;/code&gt; is an output track.&lt;/p&gt;&#xA;&lt;h3&gt;Scoring:&lt;/h3&gt;&#xA;&lt;p&gt;Your score is the total number of tracks you need for of all test cases (you can use a different number of tracks for each test case).  Lowest score wins.&lt;/p&gt;&#xA;&lt;h3&gt;Test cases:&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;4,13,20,23,22,21,0,18,8,17,16,6,18,22,15,19,21,8,6,24,7,21,9,4,24,19,0,20,12,1,3,10,5,6,19,23,17,9,14,24,13,5,10,15,2,14,7,8,6,10,3,18,22,16,2,4,10,14,1,21,11,9,22,18,20,16,1,4,12,0,12,11,20,11,19,12,0,13,9,11,23,24,15,3,14,5,2,5,8,7,7,3,16,13,15,23,17,1,2,17&#xA;1,8,7,5,6,7,21,9,15,5,7,6,21,13,13,18,16,12,22,10,18,14,13,14,10,0,8,24,13,23,2,9,3,4,19,11,24,16,15,10,8,22,3,2,16,17,1,2,12,18,19,2,19,22,0,23,12,24,11,23,23,3,21,15,0,16,14,5,17,10,20,20,0,15,6,7,20,11,17,22,6,17,5,9,1,8,14,21,4,4,3,11,12,4,20,19,1,18,9,24&#xA;21,2,14,11,12,21,15,21,16,23,2,19,8,14,23,0,16,4,7,9,24,10,0,11,17,5,4,8,10,0,20,6,5,18,18,6,9,10,22,10,9,1,16,22,1,22,6,17,19,7,2,1,7,18,3,18,11,2,11,7,23,17,6,3,19,13,21,4,20,14,24,20,15,15,15,13,13,12,22,5,13,20,24,3,24,23,4,0,9,8,5,17,16,8,14,12,3,19,1,12&#xA;2,7,10,22,15,3,16,7,3,6,4,17,2,20,6,21,13,5,1,7,16,18,24,17,8,14,5,23,17,18,13,0,9,14,24,21,19,23,0,20,15,1,12,24,3,18,11,5,15,7,4,4,9,8,17,12,0,23,6,8,14,12,1,22,9,11,14,20,19,3,12,23,11,19,16,11,22,16,9,4,13,19,1,22,15,2,8,10,0,13,10,18,24,10,21,6,5,2,21,20&#xA;14,20,18,21,19,10,7,16,2,22,14,15,17,24,8,10,13,0,11,5,11,11,7,13,19,9,22,10,7,0,3,16,2,8,21,8,4,14,2,19,24,16,12,1,0,0,17,15,1,21,6,5,4,6,12,23,3,15,21,2,12,23,14,23,5,1,10,1,17,13,7,22,4,5,18,6,18,12,16,11,9,13,6,19,23,15,17,22,4,20,8,3,18,20,24,20,9,24,3,9&#xA;0,23,4,4,14,17,14,0,8,21,8,9,8,5,16,20,15,9,24,23,12,11,24,2,14,17,3,21,1,19,5,17,15,16,7,2,22,20,6,1,24,16,7,22,21,19,6,13,23,11,4,11,15,19,20,19,18,5,1,18,10,22,16,6,18,20,10,9,6,2,12,23,7,12,3,9,10,7,5,10,13,3,17,12,13,2,1,0,15,4,22,18,11,14,3,24,21,8,0,13&#xA;8,19,19,0,23,7,10,21,2,22,13,20,2,10,16,21,3,17,20,18,5,9,14,19,22,0,7,6,3,10,18,6,6,5,24,2,11,24,7,1,11,17,8,9,24,5,15,18,16,24,11,5,14,1,0,13,16,0,13,17,8,12,4,1,21,20,11,10,14,16,8,21,4,7,17,9,13,4,1,3,15,6,22,23,9,23,15,12,15,19,3,20,2,23,12,12,4,18,22,14&#xA;17,3,8,24,18,5,7,2,13,2,9,19,21,6,8,8,21,16,17,3,11,20,24,24,12,11,18,11,16,15,24,9,14,10,18,4,22,20,0,10,7,14,6,1,15,6,13,7,3,12,7,23,4,21,0,23,2,10,12,22,9,17,0,4,4,3,22,16,23,20,15,18,10,8,23,1,14,11,5,19,16,1,2,22,9,12,1,5,13,19,14,20,19,5,13,0,15,6,21,17&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-14T04:26:23.007" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5730" PostTypeId="2" ParentId="2140" CreationDate="2015-08-17T01:41:01.897" Score="1" Body="&lt;h1&gt;Be Rational! Finding Rational Roots of Polynomials&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;In this challenge you are to find &lt;strong&gt;&lt;em&gt;all&lt;/em&gt;&lt;/strong&gt; rational zeroes of a polynomial. The results have to be exact. I would suggest using &lt;a href=&quot;https://en.wikipedia.org/wiki/Rational_root_theorem&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Rational Root Theorem&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Input can be through function argument, command argument, or user input. Input will be a polynomial. The polynomial may have rational coefficients. If a term has a coefficient of zero, that term will not be included in the input. &lt;code&gt;x^1&lt;/code&gt; will be abbreviated as &lt;code&gt;x&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-x^7+4x^4/7-21x^2/2+5x+23/19&#xA;...//More to be added when posted&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Output will be a list of the rational roots of the input polynomial. Output can be through function return value or stdout. If output in string format, you will use improper fractions separated by commas. The output must be simplified as much as possible. Duplicate roots should not be printed more than once.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4/5,2/3,-15/2&#xA;...//More to be added when posted.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Example Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; x^2-1&#xA;1,-1&#xA;...//More to be added when posted.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Just like all &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt; questions, the answer with the lowest byte count wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Questions:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Is this too much like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/11694/find-real-roots-of-a-polynomial&quot;&gt;Peter's earlier question&lt;/a&gt;?&lt;br&gt;&#xA;Are there any points I haven't covered or are not clear?&lt;br&gt;&#xA;Any grammar/spelling mistakes?&lt;br&gt;&#xA;Any tips on improved formatting?&lt;/p&gt;&#xA;" OwnerUserId="32700" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:21.033" LastActivityDate="2015-08-20T19:08:13.820" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5733" PostTypeId="2" ParentId="2140" CreationDate="2015-08-18T12:02:05.150" Score="2" Body="&lt;h1&gt;Theoretical Analysis of Pulley System&lt;/h1&gt;&#xA;&lt;p&gt;(I think it is gonna be a code golf challenge?)&lt;/p&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;In rope access and rescue, as well as sometimes in climbing, caving and rock climbing you need to build pulley systems for hauling equipment or rescuing injured people. Here we will look at them from a more abstract perspective. As those systems can get arbitrarily complex we will limit ourselves to a certain class of pulley systems: They are one dimensional (only two opposing directions) and there is only one fixed anchor. Further we assume that there is one piece of load on one end of the rope and unit of force pulling at the other end of the rope.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a program that accepts a pulley system encoded as a string (see below) that returns the &lt;em&gt;actual mechanical advantage&lt;/em&gt; (&lt;em&gt;AMA&lt;/em&gt;) - polynomial.&lt;/p&gt;&#xA;&lt;h2&gt;Introduction of symbols&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Rope &lt;a href=&quot;https://i.stack.imgur.com/SGteU.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/SGteU.png&quot; alt=&quot;rope&quot; /&gt;&lt;/a&gt; There is one continuous piece of rope, beginning at the load and ending where the force is applied. The rope is not cut, always just one piece.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Attachment points:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Anchor: &lt;a href=&quot;https://i.stack.imgur.com/hCmd7.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/hCmd7.png&quot; alt=&quot;anchor&quot; /&gt;&lt;/a&gt; In each example we consider here, there is exactly one anchor (you can imagine it as the ceiling). Other than that, the anchor behaves the same way as a &lt;em&gt;knot&lt;/em&gt; (see below):&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Knot: &lt;a href=&quot;https://i.stack.imgur.com/27KXW.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/27KXW.png&quot; alt=&quot;knot&quot; /&gt;&lt;/a&gt; You can attach an unlimited number of pulleys to each knot. Those connections will also be shown as black lines in the following graphics, but do not count as rope.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Pulley: &lt;a href=&quot;https://i.stack.imgur.com/eUox0.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/eUox0.png&quot; alt=&quot;pulley&quot; /&gt;&lt;/a&gt; A pulley can be attached to a knot (or the anchor), (indicated by the black lines from center of the pulleys to the knots). When the rope is passing a pulley (the lines that are tangent to the circle), it acts as a redirection (rope coming in in the opposite direction of the rope going out).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Load: &lt;a href=&quot;https://i.stack.imgur.com/IME4I.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/IME4I.png&quot; alt=&quot;load&quot; /&gt;&lt;/a&gt;  In each example we consider here there is exactly one piece of load. It is connected to one end of the rope.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Pulling force: &lt;a href=&quot;https://i.stack.imgur.com/wvEzQ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/wvEzQ.png&quot; alt=&quot;pulling end&quot; /&gt;&lt;/a&gt; In each example we consider here there is exactly one point where external force is applied, this is the other end of the rope.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Theory: The T-Method&lt;/h2&gt;&#xA;&lt;p&gt;(You can skip this if you are already familiar with how to calculate the mechanical advantage of pulley systems assuming a friction coefficient.)&lt;/p&gt;&#xA;&lt;h3&gt;Theoretical mechanical advantage (only an intermediate step, we do not use this for the challenge)&lt;/h3&gt;&#xA;&lt;p&gt;With the so called T-Method we can calculate the theoretical mechanical advantage (TMA) of a pulley system. Here we use the assumption that a rope going through a pulley has the same tension on both sides of the pulley. We define the applied force (tension) to be one unit and follow along the rope in order to successively figure out the force/tension on each piece of rope, pulley or knot and eventually the load. The force on the load is the TMA of the whole pulley system. (The TMA is only considered for teaching how to calculate the AMA and usually has no practical application.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/xJGFg.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/xJGFg.gif&quot; alt=&quot;age description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Actual mechanical advantage (AMA)&lt;/h3&gt;&#xA;&lt;p&gt;Each redirection of the rope (=pulley) creates some friction so the assumption of having the same amount of tension on both sides of the pulley can lead to way too optimistic results. We can improve this model by assuming that each pulley has an efficiency 0&amp;lt;=X&amp;lt;=1. This means that if we apply and amount of force F to the rope on one side of the pulley, the rope on the other side of the pulley will only experience a force of X*F. Here an example with X=0.9 (90% efficiency):&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Cpjzb.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Cpjzb.gif&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;(The AMA with known efficiencies is a great tool for estimating the real mechanical advantage of a pulley system especially if you have to rely on low efficiency pulleys/redirections, as most have an efficiency of &amp;lt;&amp;lt;95%. But there are only a few pulley systems that are actually used in the mentioned applications.)&lt;/p&gt;&#xA;&lt;p&gt;Assuming that every pulley has the same efficiency X we can now use the same procedure as with the TMA in order to find the AMA. If we do not know the efficiency X we have to use X as a variable. When calculating the AMA of a certain pulley system with an unknown efficiency we get a polynomial in X for the AMA. This is what your program has to do for a given pulley system.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Syt9P.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Syt9P.gif&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Input format&lt;/h2&gt;&#xA;&lt;p&gt;The input consists of a string of lower- and uppercase letters (a-z and A-Z). For a given pulley system, we start at the load and follow along the rope. Each time we encounter an attachment point (a pulley, a knot or the anchor) we write down the corresponding letter. We use uppercase letters if the rope is attached via knot to that attachment point or a lower case letter when the rope goes through a pulley. The attachment points are labeled alphabetically in the order of first occurrence during the rope traversal. Each time you find a knot, you can assume that the rope will go on in the same direction. Each time you find a pulley, you can assume that the rope gets redirected by 180°. The anchor point always gets the letter Z.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/c3p4u.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/c3p4u.gif&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Output format&lt;/h2&gt;&#xA;&lt;p&gt;The output should comprise a list that encodes the polynomial coefficients. E.g. the polynomial a_0 + a_1 * x + a_2 * x^2 + a_3 * x^3 + …+ a_n * x^n will be encoded like so: [a_0, a_1, a_2, a_3, …, a_n]&lt;/p&gt;&#xA;&lt;h2&gt;Other Examples:&lt;/h2&gt;&#xA;&lt;h3&gt;11:1&lt;/h3&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Dt916.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Dt916.gif&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;META:&#xA;Is this ok/clear enough so far? Are there any mistakes? Can you understand it? I would of course add more examples.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-08-20T20:50:58.797" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5734" PostTypeId="2" ParentId="2140" CreationDate="2015-08-18T16:56:13.527" Score="3" Body="&lt;h1&gt;Bad Lip Reading Generator&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A malapropism is the substitution of one word for another that sounds similar, often as a way to make something sound unintentionally humorous.  For example, &quot;He's a wolf in &lt;em&gt;cheap&lt;/em&gt; clothing&quot; is a malapropism, since the expected word, &quot;sheep's&quot;, got replaced by &quot;cheap&quot;, which sounds similar but means something different.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A modern version of malapropism is to take scenes from movies and redub the dialog with different words that match the actors mouth movements as a&#xA;parody.  There is a YouTube channel called &quot;&lt;a href=&quot;https://www.google.com/url?sa=t&amp;amp;rct=j&amp;amp;q=&amp;amp;esrc=s&amp;amp;source=web&amp;amp;cd=4&amp;amp;cad=rja&amp;amp;uact=8&amp;amp;sqi=2&amp;amp;ved=0CCcQFjADahUKEwiT0IKLq7jHAhVFjpIKHZU-CDg&amp;amp;url=https%3A%2F%2Fwww.youtube.com%2Fuser%2FBadLipReading&amp;amp;ei=mCLWVZOkE8WcygSV_aDAAw&amp;amp;usg=AFQjCNFx9AIC3sy1OUXrEll90DpQ2rmqrg&quot; rel=&quot;nofollow&quot;&gt;Bad Lip Reading&lt;/a&gt;&quot; that uses this technique.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would like to apply the process to some old videos with subtitle files, then watch the videos with the sound turned down to turn it into a long series of malapropisms.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using mouth movements gives a more flexible range of malapropism so there is some flexibility between different sounds.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Create a malapropism generator.  I want to be able to feed text from subtitles into the generator and have text which is different, but still matches the mouth movements of the actors.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A string of English words, (already processed to remove punctuation and forced to uppercase).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A string of English words, (same format as input).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Notes&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;To simplify the challenge, all input words are in upper case, separated by whitespace, with all punctuation except apostrophes removed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lets agree to constraint what words &quot;sound like&quot;, to be based on the &lt;a href=&quot;http://svn.code.sf.net/p/cmusphinx/code/trunk/cmudict/cmudict-0.7b&quot; rel=&quot;nofollow&quot;&gt;CMUDICT&lt;/a&gt;.  You may scrub the data so you don't have to worry about&#xA;comments or special punctuation entries and remove stress numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lets also agree on the mouth-movements associated with the sounds, called&#xA;&quot;visemes&quot;.  Here is a mapping used by Microsoft's SAPI library, which is&#xA;itself based on Disney animation rules.  Microsoft uses the same set of phonemes from &lt;a href=&quot;http://en.wikipedia.org/wiki/Arpabet&quot; rel=&quot;nofollow&quot;&gt;ARPABet&lt;/a&gt; as CMUDict data.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#   ARPAbet Phoneme&#xA;&#xA;1   AE AH&#xA;2   AA&#xA;3   AO&#xA;4   EH EY UH&#xA;5   ER&#xA;6   IH IY Y&#xA;7   UW W&#xA;8   OW&#xA;9   AW&#xA;10  OY&#xA;11  AY&#xA;12  HH&#xA;13  R&#xA;14  L&#xA;15  S  Z&#xA;16  CH JH SH ZH&#xA;17  DH TH&#xA;18  F  V&#xA;19  D  N  T&#xA;20  G  K  NG&#xA;21  B  M  P&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You should be able to take each English word, convert to a set of phonemes, then to a set of visemes, then produce a list of words with matching visemes and randomly select one of the other words from the list.  If a word doesn't match, or doesn't have any alternative, the original word should be copied to output.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&quot;HELLO WORLD&quot;           &quot;HALLOW WHIRLED&quot;&lt;/li&gt;&#xA;&lt;li&gt;&quot;I SEE DEAD PEOPLE&quot;     &quot;EYE SEA TED PEOPLE&quot;&lt;/li&gt;&#xA;&lt;li&gt;&quot;I WILL BE BACK&quot;        &quot;EYE WHEEL PEA BAG&quot;&lt;/li&gt;&#xA;&lt;li&gt;&quot;IT WAS BEAUTY KILLED THE BEAST&quot;    &quot;INN WAS PUNY GILT THE MIST&quot;&lt;/li&gt;&#xA;&lt;li&gt;&quot;MAY THE FORCE BE WITH YOU&quot; &quot;MAY THE FOURS BEE WITH YEW&quot;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Since the words are random, I have selected some pairs of words with unique pronunciation.  Your function or program should always return one word when presented with the other:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input            Output&#xA;&quot;AMUSING&quot;        &quot;ABUSING&quot;&#xA;&quot;APOGEE&quot;         &quot;APACHE&quot;&#xA;&quot;BACKDATING&quot;     &quot;MAGNETIC&quot;&#xA;&quot;BALLOONING&quot;     &quot;POLLUTING&quot;&#xA;&quot;INVISIBLE&quot;      &quot;INFEASIBLE&quot;&#xA;&quot;LAMPS&quot;          &quot;LUMPS&quot;&#xA;&quot;SCORN&quot;          &quot;SCORED&quot;&#xA;&quot;WEPT&quot;           &quot;WEBBED&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can write a full program or function.&lt;/li&gt;&#xA;&lt;li&gt;Input should be taken from stdin or function parameters.&#xA;Output should be printed through stdout or returned.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is [code-golf]. Submission with least number of bytes, (not including data file(s)) wins.&lt;/p&gt;&#xA;" OwnerUserId="33130" LastEditorUserId="33130" LastEditDate="2015-08-20T19:46:38.717" LastActivityDate="2015-08-20T19:46:38.717" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5737" PostTypeId="1" AcceptedAnswerId="5738" CreationDate="2015-08-18T23:22:59.460" Score="12" ViewCount="316" Body="&lt;p&gt;Our benevolent mod Martin recently &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5736/20469&quot;&gt;sandboxed a challenge&lt;/a&gt; for golfing &quot;Hello, World!&quot;, as we do not yet have such a challenge on this site. It seems that Martin intends for it to be more of a catalog of the shortest possible &quot;Hello, World!&quot; programs in many languages rather than a contest to see who can create the shortest submission in any language. This brings up an interesting point: Should challenges which are primarily intended to be catalogs rather than contests be on topic here?&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2015-09-28T10:51:44.160" Title="Should solution &quot;catalogs&quot; be on topic here?" Tags="|discussion|asking-questions|" AnswerCount="2" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="5738" PostTypeId="2" ParentId="5737" CreationDate="2015-08-18T23:33:27.197" Score="19" Body="&lt;p&gt;Since we're talking about my sandbox post here, let me make the case for &lt;strong&gt;yes, this should be on topic&lt;/strong&gt;!&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's not actually different from a code golf challenge, except I won't accept an answer, and it encourages answers in many different languages (using words, but nothing else). In fact, as Doorknob mentioned in his answer, this is actually part of our mission as described in the help centre. All I did was call it by name.&lt;/li&gt;&#xA;&lt;li&gt;We already have questions like this. E.g. I consider our basic quine challenge, &lt;a href=&quot;https://codegolf.stackexchange.com/q/69/8478&quot;&gt;Golf you a quine for great good!&lt;/a&gt;, such a catalogue. Whenever I discover a new quine in an esolang, I go to that challenge and add it there.&lt;/li&gt;&#xA;&lt;li&gt;Whenever someone complains that Pyth, CJam and friends suck all the enjoyment out of golfing, we &lt;em&gt;always&lt;/em&gt; say &quot;you have to treat this as a competition within your language not between languages&quot;. It would be weird to outlaw challenges which emphasise that aspect specifically.&lt;/li&gt;&#xA;&lt;li&gt;Stack Exchange is still about building great content. We're a Stack Exchange site about code golf (amongst other things, but mainly code golf). Since (as far as I'm aware) no other reputable site collects &quot;The shortest way to do X in any language&quot; (emphasis on &quot;shortest&quot;), I think this is a great opportunity for us to build good content for code golfers and esolang enthusiasts.&lt;/li&gt;&#xA;&lt;li&gt;Many (even common) esolangs haven't been thoroughly explored yet when it comes to golfing, and having these catalogue-like questions provides an additional incentive to study golfing techniques in these languages in depth.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;I'd actually be up for creating a tag for these,&lt;/s&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/6962/8478&quot;&gt;I don't think we should create a separate tag for these&lt;/a&gt; because I'm not entirely sure what differentiates them from a normal challenge other than a) it's a very common task, b) there won't be an accepted answer, c) the OP explicitly asks for the shortest solution per language, but those are just words, right?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;PS: Because this has come up twice now, I'm strictly against making these categorically Community Wikis. Most answers will be the work of single users who deserve the rep for it. If many users contribute to a single answer, that one answer can still be made CW if the original author doesn't feel like he deserves all the rep any more. I think we've got enough sportsmanship around here for that to work out.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2015-09-28T10:51:44.160" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5739" PostTypeId="2" ParentId="5737" CreationDate="2015-08-18T23:33:30.430" Score="-4" Body="&lt;p&gt;(I'm speaking as a regular user here, not as a moderator.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think that this is definitely a plausible idea (perhaps a &lt;a href=&quot;/questions/tagged/new-genre&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;new-genre&amp;#39;&quot; rel=&quot;tag&quot;&gt;new-genre&lt;/a&gt;?) if&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The question is made Community Wiki (and hence all the answers).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There can only be one answer per language.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Editing an answer to improve / golf someone else's code is okay.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No answer is accepted.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;(Optional) Answers should contain as much (necessary) explanation of golfing tricks / techniques used as possible.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;All of our current challenges are essentially (incomplete) &quot;catalogs&quot; of solutions in different languages anyway. We even have this in our &lt;a href=&quot;https://codegolf.stackexchange.com/tour&quot;&gt;Tour&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;With your help, we're working together to build a library of programming puzzles and their solutions.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5736/3808&quot;&gt;@MartinBüttner explains why such questions would be beneficial in his sandbox post&lt;/a&gt;, and with the criteria that I propose, I can't see how this could be problematic at all.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2015-08-18T23:33:30.430" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5740" PostTypeId="1" CreationDate="2015-08-19T00:51:17.597" Score="4" ViewCount="348" Body="&lt;p&gt;I recently played around with C++11 compile-time golfing:&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/54768/tournament-format-synonyms/54804#54804&quot;&gt;Tournament Format Synonyms&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That is, its a C++ program which runs via templates and computes the answer during compile-time, such that it's possible to check the output via static asserts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A similar thing can be done now with constexpr functions, or some hybrid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One thing which I realized that I should probably have looked up first was how I should do standard input and output for it to be &quot;legit&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's extremely awkward to do any kind of string manipulation at all in templates, because templates basically cannot manipulate a const char * like you do in C. In C++11 there are variadic templates and that is what I used. Basically in my program I define a struct:&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-cpp prettyprint-override&quot;&gt;&lt;code&gt;template&amp;lt;char...&amp;gt; struct S{};&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;so this type can bind to an arbitrary sequence of chars.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then I define my &quot;main&quot; function to be a metafunction which also takes a char... and returns an S. So it's some template like&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-cpp prettyprint-override&quot;&gt;&lt;code&gt;template&amp;lt;char...&amp;gt; struct F{ typedef ... t; }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In my examples I show that you can check the output like:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-cpp prettyprint-override&quot;&gt;&lt;code&gt;static_assert(std::is_same&amp;lt;typename F&amp;lt;'B','o','3'&amp;gt;::t, S&amp;lt;'F','t','2'&amp;gt;&amp;gt;::value, &quot;fail&quot;);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So here I think are some reasonable questions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;If the template S is solely used as an output mechanism, then why do I have to pay to define it? IMO This would be like if std::cout and fprintf didn't exist in C and you had to implement them in code golf solutions if you wanted to use them.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;At the same time, it turned out to be pretty useful for me that I could control what S was. For instance in my final solution I changed it to a sequence of &quot;wchar_t&quot; (unicode characters), this allowed me to use a single integral type instead of a mix of ints and chars and simplify my templates and save a lot of space. Is that legit? Should I also be allowed to do that &quot;for free&quot;?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In this example it wasn't too bad, but if variadic templates like S are the only legal way to get string input in template metaprograms, it's inherently limiting because you can basically only access the front of a template parameter pack. If you allow the input / output to be represented as an mpl vector then it's a lot more capable right out of the box. Is that legit? Some different options for compile time string processing are discussed here, especially the one in the top answer is quite convenient: &lt;a href=&quot;https://stackoverflow.com/questions/15858141/conveniently-declaring-compile-time-strings-in-c&quot;&gt;https://stackoverflow.com/questions/15858141/conveniently-declaring-compile-time-strings-in-c&lt;/a&gt; But if declaring that thing counts against your code golf its no use.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;IMO, C++ is already a pretty bad code golf language, and the meta programming language is, by comparison, notoriously verbose and with a strange mix of power and severe limitations. So it seems reasonable to just be very liberal with what input / output methods are permitted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The thing though is that if the user is defining the template that signifies a string its a bit strange because then I guess you want to validate that also externally. In my examples for instance, all these checks based on std::is_same would pass if both F and S were just always typedef'd to &quot;void&quot;. But you would kind of have to ungolf my program to see that that isn't what's happening.&lt;/p&gt;&#xA;" OwnerUserId="43061" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2015-08-19T00:51:17.597" Title="What methods of input / output are legal for C++ compile-time golfing" Tags="|discussion|" AnswerCount="0" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5741" PostTypeId="1" AcceptedAnswerId="5758" CreationDate="2015-08-19T06:52:26.787" Score="7" ViewCount="137" Body="&lt;p&gt;Well, I've only written 2 question so far, both started in the sandbox.&#xA;the first question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/53816/the-lost-pawn-problem&quot;&gt;The lost pawn problem&lt;/a&gt; is (I think) a very interesting question to solve. After fixing all the minor mistakes @PeterTaylor pointed out in the sandbox post, and gaining some up-votes, I posted to the main site. But the question didn't get any answers (just a few up-votes...). I thought maybe people think it's too hard, so I edited and added an un-golfed simple solution to show it's not that hard, and providing a way to generate test cases. Still... nothing. on the other hand, a much less interesting question (IMO) I posted after, gained some attention: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/54471/build-me-a-pyramid&quot;&gt;Build Me a Pyramid&lt;/a&gt;.&#xA;So, I'm just trying to figure out, what makes a question better accepted here? do people prefer (a bit boring and repetitive, IMO) ascii-art challenges, which as I see is the majority of the newer questions here. Or maybe it simply a matter of luck? Perhaps rephrasing the question might help gaining more attention?&lt;/p&gt;&#xA;" OwnerUserId="36587" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-08-21T01:06:36.940" Title="Suggestions on how to get questions better accepted?" Tags="|discussion|asking-questions|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5743" PostTypeId="2" ParentId="5741" CreationDate="2015-08-19T11:22:14.143" Score="11" Body="&lt;h1&gt;Keep it Simple&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Something I've noticed is that questions that are too complicated are less likely to do well. I'm not talking about the difficulty of the solution, I'm talking about the amount of detail and complexity involved in the question. Your lost pawn problem had a lot of moving parts. The three dimensional array, the exacting textual output specifications, et cetera. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In contrast, Build Me a Pyramid is (roughly) one step: given a number, produce a pyramid of that size. I think this helped it do better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To address some points from your question, it's not about ascii-art. My most upvoted code-golf question is &lt;a href=&quot;https://codegolf.stackexchange.com/q/36384/20080&quot;&gt;Find the Smoothest Number&lt;/a&gt;, which is another one-step problem. In contrast, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/40292/edge-elimination-number&quot;&gt;Edge Elimination Number&lt;/a&gt; was one of my least upvoted code-golf questions, and it is much, much more complicated.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Check out &lt;a href=&quot;https://codegolf.stackexchange.com/users/26997/calvins-hobbies?tab=questions&amp;amp;sort=votes&quot;&gt;Calvin's Hobbies&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Second, there is definitely a lot of skill involved. One of the sites best question writers is Calvin's Hobbies, with 15 different questions at vote totals of 50 or more. Taking a look at their question might help you write better ones of your own. Good luck!&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-08-19T11:22:14.143" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5744" PostTypeId="1" CreationDate="2015-08-19T13:21:03.620" Score="23" ViewCount="1017" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5688/8478&quot;&gt;As announced last week&lt;/a&gt; PPCG is getting another moderator. You've had one week to nominate others or yourself, and now it's time for the actual election. The candidates are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5692/8478&quot;&gt;Beta Decay&lt;/a&gt; (vote &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5745/26997&quot;&gt;here&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5706/8478&quot;&gt;ProgramFOX&lt;/a&gt; (vote &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5746/26997&quot;&gt;here&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5691/8478&quot;&gt;Alex A.&lt;/a&gt; (vote &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5747/26997&quot;&gt;here&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5695/8478&quot;&gt;PhiNotPi&lt;/a&gt; (vote &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5748/26997&quot;&gt;here&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5693/8478&quot;&gt;Dennis&lt;/a&gt; (vote &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5749/26997&quot;&gt;here&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I will add one (community wiki) answer for each one of them. You may vote on as many of them as you want, and the candidates are welcome to vote as freely as anyone else (including for themselves). Voting will close after 7 days.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Best of luck to the candidates!&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2015-08-26T12:35:07.307" Title="We're getting a new moderator: Cast your votes!" Tags="|discussion|moderators|" AnswerCount="5" CommentCount="0" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5745" PostTypeId="2" ParentId="5744" CreationDate="2015-08-19T13:22:44.197" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/30525/beta-decay&quot;&gt;Beta Decay&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/30525/&quot;&gt;&#xA;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/30525.png&quot; width=&quot;208&quot; height=&quot;58&quot; alt=&quot;profile for Beta Decay at Programming Puzzles &amp;amp; Code Golf Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot; title=&quot;profile for Beta Decay at Programming Puzzles &amp;amp; Code Golf Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot;&gt;&#xA;&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/30525/&quot;&gt;&#xA;&lt;img src=&quot;https://codegolf.meta.stackexchange.com/users/flair/30525.png&quot; width=&quot;208&quot; height=&quot;58&quot; alt=&quot;profile for Beta Decay at Programming Puzzles &amp;amp; Code Golf Meta Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot; title=&quot;profile for Beta Decay at Programming Puzzles &amp;amp; Code Golf Meta Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot;&gt;&#xA;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5692/8478&quot;&gt;&lt;strong&gt;Nomination Post&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Stats&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/30525?tab=topactivity&quot;&gt;&lt;strong&gt;Main&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;member since August 11, 2014&lt;/li&gt;&#xA;&lt;li&gt;35 questions&lt;/li&gt;&#xA;&lt;li&gt;80 answers&lt;/li&gt;&#xA;&lt;li&gt;31 posts edited&lt;/li&gt;&#xA;&lt;li&gt;4 helpful flags&lt;/li&gt;&#xA;&lt;li&gt;793 votes cast&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/30525?tab=topactivity&quot;&gt;&lt;strong&gt;Meta&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;9 questions&lt;/li&gt;&#xA;&lt;li&gt;26 answers&lt;/li&gt;&#xA;&lt;li&gt;3 posts edited&lt;/li&gt;&#xA;&lt;li&gt;0 helpful flags&lt;/li&gt;&#xA;&lt;li&gt;118 votes cast&lt;/li&gt;&#xA;&lt;li&gt;currently 5th overall in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users?tab=participation&quot;&gt;participation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/124789&quot;&gt;&lt;strong&gt;Chat&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;user since August 14, 2014&lt;/li&gt;&#xA;&lt;li&gt;12 all time rooms&lt;/li&gt;&#xA;&lt;li&gt;2420 all time messages&lt;/li&gt;&#xA;&lt;li&gt;~340 messages per week recently&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="anon" LastEditorUserId="-1" LastEditorDisplayName="anon" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2015-08-21T17:43:46.427" CommentCount="4" CommunityOwnedDate="2015-08-19T13:22:44.197" ContentLicense="CC BY-SA 3.0" />
  <row Id="5746" PostTypeId="2" ParentId="5744" CreationDate="2015-08-19T13:24:02.123" Score="22" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/9275/programfox&quot;&gt;ProgramFOX&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/9275/&quot;&gt;&#xA;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/9275.png&quot; width=&quot;208&quot; height=&quot;58&quot; alt=&quot;profile for ProgramFOX at Programming Puzzles &amp;amp; Code Golf Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot; title=&quot;profile for ProgramFOX at Programming Puzzles &amp;amp; Code Golf Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot;&gt;&#xA;&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/9275/&quot;&gt;&#xA;&lt;img src=&quot;https://codegolf.meta.stackexchange.com/users/flair/9275.png&quot; width=&quot;208&quot; height=&quot;58&quot; alt=&quot;profile for ProgramFOX at Programming Puzzles &amp;amp; Code Golf Meta Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot; title=&quot;profile for ProgramFOX at Programming Puzzles &amp;amp; Code Golf Meta Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot;&gt;&#xA;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5706/8478&quot;&gt;&lt;strong&gt;Nomination Post&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Stats&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/9275?tab=topactivity&quot;&gt;&lt;strong&gt;Main&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;member since October 5, 2013&lt;/li&gt;&#xA;&lt;li&gt;11 questions&lt;/li&gt;&#xA;&lt;li&gt;56 answers&lt;/li&gt;&#xA;&lt;li&gt;294 posts edited&lt;/li&gt;&#xA;&lt;li&gt;406 helpful flags&lt;/li&gt;&#xA;&lt;li&gt;2046 votes cast&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/9275?tab=topactivity&quot;&gt;&lt;strong&gt;Meta&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;11 questions&lt;/li&gt;&#xA;&lt;li&gt;37 answers&lt;/li&gt;&#xA;&lt;li&gt;20 posts edited&lt;/li&gt;&#xA;&lt;li&gt;26 helpful flags&lt;/li&gt;&#xA;&lt;li&gt;769 votes cast&lt;/li&gt;&#xA;&lt;li&gt;currently 16th overall in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users?tab=participation&quot;&gt;participation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/88521&quot;&gt;&lt;strong&gt;Chat&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;user since August 19, 2013&lt;/li&gt;&#xA;&lt;li&gt;51 all time rooms&lt;/li&gt;&#xA;&lt;li&gt;11915 all time messages&lt;/li&gt;&#xA;&lt;li&gt;~165 messages per week recently&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="anon" LastEditorUserId="-1" LastEditorDisplayName="anon" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2015-08-21T17:43:15.297" CommentCount="2" CommunityOwnedDate="2015-08-19T13:24:02.123" ContentLicense="CC BY-SA 3.0" />
  <row Id="5747" PostTypeId="2" ParentId="5744" CreationDate="2015-08-19T13:25:07.850" Score="30" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/20469/alex-a&quot;&gt;Alex A.&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/20469/&quot;&gt;&#xA;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/20469.png&quot; width=&quot;208&quot; height=&quot;58&quot; alt=&quot;profile for Alex A. at Programming Puzzles &amp;amp; Code Golf Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot; title=&quot;profile for Alex A. at Programming Puzzles &amp;amp; Code Golf Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot;&gt;&#xA;&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/20469/&quot;&gt;&#xA;&lt;img src=&quot;https://codegolf.meta.stackexchange.com/users/flair/20469.png&quot; width=&quot;208&quot; height=&quot;58&quot; alt=&quot;profile for Alex A. at Programming Puzzles &amp;amp; Code Golf Meta Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot; title=&quot;profile for Alex A. at Programming Puzzles &amp;amp; Code Golf Meta Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot;&gt;&#xA;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5691/8478&quot;&gt;&lt;strong&gt;Nomination Post&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Stats&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/20469?tab=topactivity&quot;&gt;&lt;strong&gt;Main&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;member since April 16, 2014&lt;/li&gt;&#xA;&lt;li&gt;1 question&lt;/li&gt;&#xA;&lt;li&gt;151 answers&lt;/li&gt;&#xA;&lt;li&gt;136 posts edited&lt;/li&gt;&#xA;&lt;li&gt;8 helpful flags&lt;/li&gt;&#xA;&lt;li&gt;1921 votes cast&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/20469?tab=topactivity&quot;&gt;&lt;strong&gt;Meta&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;3 questions&lt;/li&gt;&#xA;&lt;li&gt;15 answers&lt;/li&gt;&#xA;&lt;li&gt;5 posts edited&lt;/li&gt;&#xA;&lt;li&gt;1 helpful flag&lt;/li&gt;&#xA;&lt;li&gt;303 votes cast&lt;/li&gt;&#xA;&lt;li&gt;currently 2nd overall in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users?tab=participation&quot;&gt;participation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/141888&quot;&gt;&lt;strong&gt;Chat&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;user since March 4, 2015&lt;/li&gt;&#xA;&lt;li&gt;13 all time rooms&lt;/li&gt;&#xA;&lt;li&gt;7470 all time messages&lt;/li&gt;&#xA;&lt;li&gt;~740 messages per week recently&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="anon" LastEditorUserId="-1" LastEditorDisplayName="anon" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2015-08-21T17:42:40.030" CommentCount="3" CommunityOwnedDate="2015-08-19T13:25:07.850" ContentLicense="CC BY-SA 3.0" />
  <row Id="5748" PostTypeId="2" ParentId="5744" CreationDate="2015-08-19T13:26:15.420" Score="17" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/2867/phinotpi&quot;&gt;PhiNotPi&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/2867/&quot;&gt;&#xA;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/2867.png&quot; width=&quot;208&quot; height=&quot;58&quot; alt=&quot;profile for PhiNotPi at Programming Puzzles &amp;amp; Code Golf Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot; title=&quot;profile for PhiNotPi at Programming Puzzles &amp;amp; Code Golf Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot;&gt;&#xA;&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/2867/&quot;&gt;&#xA;&lt;img src=&quot;https://codegolf.meta.stackexchange.com/users/flair/2867.png&quot; width=&quot;208&quot; height=&quot;58&quot; alt=&quot;profile for PhiNotPi at Programming Puzzles &amp;amp; Code Golf Meta Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot; title=&quot;profile for PhiNotPi at Programming Puzzles &amp;amp; Code Golf Meta Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot;&gt;&#xA;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5695/8478&quot;&gt;&lt;strong&gt;Nomination Post&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Stats&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/2867?tab=topactivity&quot;&gt;&lt;strong&gt;Main&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;member since October 2, 2011&lt;/li&gt;&#xA;&lt;li&gt;50 questions&lt;/li&gt;&#xA;&lt;li&gt;75 answers&lt;/li&gt;&#xA;&lt;li&gt;7 posts edited&lt;/li&gt;&#xA;&lt;li&gt;1 helpful flag&lt;/li&gt;&#xA;&lt;li&gt;379 votes cast&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/2867?tab=topactivity&quot;&gt;&lt;strong&gt;Meta&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;6 questions&lt;/li&gt;&#xA;&lt;li&gt;53 answers&lt;/li&gt;&#xA;&lt;li&gt;8 posts edited&lt;/li&gt;&#xA;&lt;li&gt;0 helpful flags&lt;/li&gt;&#xA;&lt;li&gt;73 votes cast&lt;/li&gt;&#xA;&lt;li&gt;currently 64th overall in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users?tab=participation&quot;&gt;participation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/24697&quot;&gt;&lt;strong&gt;Chat&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;user since October 6, 2011&lt;/li&gt;&#xA;&lt;li&gt;28 all time rooms&lt;/li&gt;&#xA;&lt;li&gt;10759 all time messages&lt;/li&gt;&#xA;&lt;li&gt;~54 messages per week recently&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="anon" LastEditorUserId="-1" LastEditorDisplayName="anon" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2015-08-21T17:42:02.793" CommentCount="0" CommunityOwnedDate="2015-08-19T13:26:15.420" ContentLicense="CC BY-SA 3.0" />
  <row Id="5749" PostTypeId="2" ParentId="5744" CreationDate="2015-08-19T13:27:25.223" Score="46" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/&quot;&gt;&#xA;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/12012.png&quot; width=&quot;208&quot; height=&quot;58&quot; alt=&quot;profile for Dennis at Programming Puzzles &amp;amp; Code Golf Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot; title=&quot;profile for Dennis at Programming Puzzles &amp;amp; Code Golf Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot;&gt;&#xA;&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/12012/&quot;&gt;&#xA;&lt;img src=&quot;https://codegolf.meta.stackexchange.com/users/flair/12012.png&quot; width=&quot;208&quot; height=&quot;58&quot; alt=&quot;profile for Dennis at Programming Puzzles &amp;amp; Code Golf Meta Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot; title=&quot;profile for Dennis at Programming Puzzles &amp;amp; Code Golf Meta Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot;&gt;&#xA;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5693/8478&quot;&gt;&lt;strong&gt;Nomination Post&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Stats&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/12012?tab=topactivity&quot;&gt;&lt;strong&gt;Main&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;member since December 19, 2013&lt;/li&gt;&#xA;&lt;li&gt;15 questions&lt;/li&gt;&#xA;&lt;li&gt;421 answers&lt;/li&gt;&#xA;&lt;li&gt;43 posts edited&lt;/li&gt;&#xA;&lt;li&gt;12 helpful flags&lt;/li&gt;&#xA;&lt;li&gt;1531 votes cast&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/12012?tab=topactivity&quot;&gt;&lt;strong&gt;Meta&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;5 questions&lt;/li&gt;&#xA;&lt;li&gt;9 answers&lt;/li&gt;&#xA;&lt;li&gt;1 post edited&lt;/li&gt;&#xA;&lt;li&gt;0 helpful flags&lt;/li&gt;&#xA;&lt;li&gt;113 votes cast&lt;/li&gt;&#xA;&lt;li&gt;currently 15th overall in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users?tab=participation&quot;&gt;participation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/37160&quot;&gt;&lt;strong&gt;Chat&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;user since April 20, 2012&lt;/li&gt;&#xA;&lt;li&gt;31 all time rooms&lt;/li&gt;&#xA;&lt;li&gt;2176 all time messages&lt;/li&gt;&#xA;&lt;li&gt;~179 messages per week recently&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="anon" LastEditorUserId="-1" LastEditorDisplayName="anon" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2015-08-21T17:41:28.280" CommentCount="0" CommunityOwnedDate="2015-08-19T13:27:25.223" ContentLicense="CC BY-SA 3.0" />
  <row Id="5750" PostTypeId="2" ParentId="2140" CreationDate="2015-08-19T13:51:47.290" Score="0" Body="&lt;p&gt;&lt;strong&gt;SETI (search for extraterrestrial life)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this code golf challenge you will search for signs of life.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Specification:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program takes a sequence of exactly 225 characters, each either 0 or 1. You return as output a single bit, either 0 or 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal is to distinguish between two kinds of inputs:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;0 (no extraterrestrial life): Each character is zero or one independently at random, and is one with probability exactly 15%.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1 (extraterrestrial life): First, each character is zero or one independently at random, and is one with probability exactly 28%. Then, 10 rounds of the original Conway's Game of Life are played from this configuration. The 225 characters are viewed as a 15 by 15 grid, and when we apply the rules, we treat the grid as wrapping around so that it has no borders. That is, column 1 wraps around and is adjacent to column 15, and row 1 also wraps around and is adjacent to row 15. The symbol '0' is associated with 'dead' and the symbol '1' is associated with alive. After the 10 rounds the string corresponding to the state of the game is the input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program does not need to give any particular output for any particular input, however it should succeed on average in the following sense. If we flip a fair coin (either 0 or 1), and choose an input from the corresponding distribution, your program should output the correct answer with probability at least 90%.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Otherwise this is code golf as usual. Enjoy!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I/O:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program shall accept as input a sequence of 225 characters, each either 0 or 1. You may request in your answer that the characters are space-delimited, comma-delimited, or not delimited. You may request in your answer that the input is given on standard in, or, if your answer is a program which takes command-line arguments, you may assume that the characters are passed on the command-line so that each character is an argument (assuming your shell supports passing 225 arguments to a program), or, if your language supports the concept of &quot;global variables / values&quot;, you may write your program under the assumption that a known global variable, of the simplest &quot;character sequence&quot; type that your language supports, contains the input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your answer shall output a single bit either zero or one. You shall do this either by printing the character 0 or 1 to standard out, or by returning an integer value 0 or 1 from a designated &quot;main&quot; function.&lt;/p&gt;&#xA;" OwnerUserId="43061" LastEditorUserId="43061" LastEditDate="2015-08-19T16:21:05.853" LastActivityDate="2015-08-19T16:21:05.853" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="5752" PostTypeId="2" ParentId="2364" CreationDate="2015-08-20T01:42:22.900" Score="7" Body="&lt;p&gt;&lt;strong&gt;Yes.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would advise scoring-by-&lt;code&gt;bytes&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think scoring-by-&lt;code&gt;characters&lt;/code&gt; encourages weird base256/unicode compression of the source, which IMO generally doesn't really add anything to the contest, and merely serves to obfuscate the code, making less accessible answers, thus decreasing the overall quality of the site.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastActivityDate="2015-08-20T01:42:22.900" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5753" PostTypeId="2" ParentId="2140" CreationDate="2015-08-20T11:01:39.050" Score="0" Body="&lt;h1&gt; Infinite monkeys and a broken keyboard &lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Infinite_monkey_theorem&quot; rel=&quot;nofollow&quot;&gt;infinite monkey theorem&lt;/a&gt; describes the probability of getting the desired result by just doing random stuff.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The task of this challenge is to calculate the minimum number of monkeys you need to get a given text on a broken keyboard.&#xA;The situation is easy:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You have a keyboard (QWERTY-layout) that has lost some of its keys&lt;/li&gt;&#xA;&lt;li&gt;Possible keys are: &lt;code&gt;1234567890abcdefghijklmnopqrstuvwxyz -=\[];',./&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Only one button is pressed at a time and the other keys (enter, tab, numeric keypad, ...) will not be pressed/ are already lost&lt;/li&gt;&#xA;&lt;li&gt;You have many many many monkeys which want to type on the keyboard!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input is a string which can only contain the possible chars. You may assume that &lt;strong&gt;only&lt;/strong&gt; the characters that are in the given string aren't lost.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You have to calculate how many monkeys are at least necessary to get the given input with a probability of &lt;strong&gt;over 50%&lt;/strong&gt;. Afterwards just output that number.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input: aaaa&#xA;    1 key available -&amp;gt; P=100% to hit the right key&#xA;output: 1&#xA;&#xA;input: abcd&#xA;    4 keys available -&amp;gt; P=25% to hit the right key&#xA;    Probability to get the desired string:&#xA;    P = 25%^4 = 0.00390625&#xA;    Number n of monkeys needed:&#xA;    (1-0.00390625)^n &amp;lt; 50%&#xA;    n = 178 (P=50.176%)&#xA;output: 178&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Please tell me if you have ideas how to improve or clarify the question or how to optimize it.&lt;/p&gt;&#xA;" OwnerUserId="29520" LastActivityDate="2015-08-20T11:01:39.050" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5754" PostTypeId="1" AcceptedAnswerId="5755" CreationDate="2015-08-20T19:43:30.907" Score="10" ViewCount="166" Body="&lt;p&gt;I recently made my first PPCG challenge, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/54945/sign-that-word&quot;&gt;Sign that word!&lt;/a&gt;. Now that various improvements have been suggested by more experienced users of PPCG, I would like to post a second, improved version of the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this allowed (or would it be flagged as a duplicate)?&lt;/p&gt;&#xA;" OwnerDisplayName="user42003" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2015-08-20T19:56:43.663" Title="Am I allowed to post a second, better edition of a challenge?" Tags="|discussion|challenges|asking-questions|duplicates|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5755" PostTypeId="2" ParentId="5754" CreationDate="2015-08-20T19:56:43.663" Score="11" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1876/18487&quot;&gt;generally accepted rule&lt;/a&gt; is:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Can answers from one question be copied over to the other with little or no modification and still be competitive?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If you are unsure, post your revised challenge in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/18487&quot;&gt;Sandbox&lt;/a&gt; and ask if others think it is a duplicate.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2015-08-20T19:56:43.663" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5758" PostTypeId="2" ParentId="5741" CreationDate="2015-08-21T01:06:36.940" Score="13" Body="&lt;p&gt;Just hitting upon a great challenge idea isn't enough. You must consider how you word and structure the specification. In fact, I'd dare to say that the clarity of the specification is &lt;em&gt;more important&lt;/em&gt; than the actual challenge idea! &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The fundamental understanding of a specification is that it's not merely a &lt;em&gt;presentation&lt;/em&gt; of inputs, outputs, and what-to-do, but rather the &lt;em&gt;communication&lt;/em&gt; of that to the reader. To quote George Gopen from &lt;em&gt;The Science of Scientific Writing&lt;/em&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;It does not matter how&#xA;  pleased an author might be to have converted all the&#xA;  right data into sentences and paragraphs; &lt;strong&gt;it matters only&#xA;  whether a large majority of the reading audience&#xA;  accurately perceives what the author had in mind.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Read through your specification carefully. What follows are some generic things to keep in mind when writing and editing your spec. I would imagine that a lot of prolific challenge writers on PPCG consider these questions subconsciously while writing.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Is it clear to the &lt;em&gt;large majority of the reading audience&lt;/em&gt;? Remember that not everyone is familiar with mathematical notation or jargon. Explain things in &lt;strong&gt;simple terms first&lt;/strong&gt;, then technical terms, not the other way around. For example, with your pawn question, we would explain the notion of weighted moves in English before the function notation.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This challenge takes place on a chess board with &lt;code&gt;n&lt;/code&gt; squares width and height. A pawn starts on one side of the chess board, and must its their way to the other side. Some positions are more difficult to move from and to then others -- that is, a move between two particular squares has a &lt;em&gt;weight&lt;/em&gt;, or a cost, associated with that move. More formally, we can say that there is a function &lt;code&gt;f: {1,..,n-1}X{1,..,n}X{-1,0,1} =&amp;gt; R+&lt;/code&gt; of weights...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If you must use abbreviations, define the abbreviation the first time you use it. Italicise the first instance of an unfamiliar word, and define it in the same sentence as where you italicised it. Typeset very important information in bold. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Don't forget to check for grammar and spelling mistakes too. They also infringe on the ability for the reader to clearly understand the specification.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Does your specification &lt;em&gt;flow in a logical manner?&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In your specification, place the &lt;strong&gt;most important&lt;/strong&gt; section first (that is, the section that is most vital to the reader's understanding of the challenge). This is often a summary of the challenge, or an introduction to the subject matter of the challenge. Then place the next sections in order from most important to least. This will differ from challenge to challenge. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then, in each &lt;em&gt;section&lt;/em&gt; of the specification place the most important &lt;em&gt;sentence&lt;/em&gt; first for that section. The most important thing about the input, for example, is what data you're getting as input. So put it first:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The input are the weights of all the moves that the pawn can make on the chess board. This is represented by a three-dimensional array where...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Then, in each &lt;em&gt;sentence&lt;/em&gt; of the specification place the most important &lt;em&gt;clause&lt;/em&gt; first. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You shouldn't follow this idea rigidly -- situations where trying to move important clauses first reduce the readability of the passage can occur. But it's a good thing to keep in mind.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Does your specification include &lt;em&gt;needless complexity&lt;/em&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Balance inclusion of details with clarity. Including too much detail in the same sentence or paragraph can result in the overall point becoming obscured. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also in the same category of needless complexity is word choices. Instead of writing &quot;utilize&quot;, write &quot;use&quot;. &quot;Firstly&quot; can just be &quot;first&quot;. &quot;Making arrangements for&quot; could just be &quot;arranging&quot;. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;In my opinion, the user &lt;a href=&quot;https://codegolf.stackexchange.com/users/32014/zgarb&quot;&gt;Zgarb&lt;/a&gt; writes the clearest challenge specs. I encourage you to read their challenges to get an idea of what a really good challenge spec looks like.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5582/things-to-consider-when-creating-a-programming-puzzle&quot;&gt;this question&lt;/a&gt; for more advice. )&lt;/p&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-08-21T01:06:36.940" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5759" PostTypeId="1" CreationDate="2015-08-21T14:07:09.327" Score="27" ViewCount="1343" Body="&lt;p&gt;This site may have been built primarily on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges and puzzles that have no winning criteria, but we have evolved away from that. Our name is outdated, and we should rebrand ourselves.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because the folks in the chat cannot seem to agree on a name, I'm going to post multiple answers and let you guys vote.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The chat discussion begins around &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/23576661#23576661&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note: According to an SE dev, it &lt;em&gt;is&lt;/em&gt; possible for beta sites to change their name and subdomain without graduation. If the subdomain changes, all redirection from codegolf.se links would be taken care of seamlessly.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="20469" LastEditDate="2015-08-24T04:05:16.557" LastActivityDate="2018-12-04T09:48:15.187" Title="Should we change our name?" Tags="|discussion|" AnswerCount="15" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5760" PostTypeId="2" ParentId="5759" CreationDate="2015-08-21T14:07:09.327" Score="41" Body="&lt;h1&gt;No change&lt;/h1&gt;&#xA;&lt;p&gt;The current name is still accurate, or at least it is close enough. It also has historical significance. Changing our name may make it harder for people to find us.&lt;/p&gt;&#xA;&lt;p&gt;Also, nochange.stackexchange.com has a nice ring to it.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-08-21T14:07:09.327" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="5761" PostTypeId="2" ParentId="5759" CreationDate="2015-08-21T14:09:04.353" Score="1" Body="&lt;h1&gt;Programming Contests&lt;/h1&gt;&#xA;&lt;p&gt;Borrowed from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1149/18487&quot;&gt;https://codegolf.meta.stackexchange.com/a/1149/18487&lt;/a&gt;. (Apparently we had a similar discussion last year.)&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-08-21T14:09:04.353" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5762" PostTypeId="2" ParentId="5759" CreationDate="2015-08-21T14:10:07.787" Score="-5" Body="&lt;h1&gt;Programming Puzzles and Challenges&lt;/h1&gt;&#xA;&lt;p&gt;Similar to our current name, but covers all challenges instead of just code golf.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-08-21T14:10:07.787" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5763" PostTypeId="2" ParentId="5759" CreationDate="2015-08-21T14:12:04.887" Score="6" Body="&lt;h1&gt;Programming Challenges&lt;/h1&gt;&#xA;&lt;p&gt;For the folks who feel that Puzzles are really just a subset of Challenges, and prefer the simplicity of just the one term that encompasses both.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-08-21T14:12:04.887" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5764" PostTypeId="2" ParentId="5759" CreationDate="2015-08-21T15:26:12.810" Score="-9" Body="&lt;h1&gt;PCG Cup&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I don't think we need such a descriptive name and should go the way of &lt;em&gt;Ask Different&lt;/em&gt; and &lt;em&gt;Seasoned Advice&lt;/em&gt;, having fun with our name.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;PPCG is a fun place, so we have to reflect that in the way we present the site, therefore by not using a boring, descriptive title, we are probably going to attract more users to SE's &lt;em&gt;party site&lt;/em&gt;. ;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We have to remember, however, that a huge number of our challenges are code golf, so there is no point in steering away from that and focussing solely on programming challenges. For that reason, I decided to incorporate golf as a sport into the title:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The PGA Cup is a famous golfing competition, so I changed the name slightly to the PCG Cup. This could also allow us to have fun with the logo and/or theme come graduation (if ever).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here, we can redefine PCG to mean &lt;em&gt;Programming Contests and Golf&lt;/em&gt;, allowing us to move away from the theme of programming puzzles.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="30525" LastEditDate="2015-08-21T15:39:45.027" LastActivityDate="2015-08-21T15:39:45.027" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5765" PostTypeId="2" ParentId="5759" CreationDate="2015-08-21T16:47:51.353" Score="6" Body="&lt;h1&gt;Competitive Programming&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;That should hopefully cover all sorts of challenge types.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-08-21T16:47:51.353" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5766" PostTypeId="2" ParentId="5759" CreationDate="2015-08-21T17:01:03.587" Score="35" Body="&lt;h1&gt;Code Sport&lt;/h1&gt;&#xA;&lt;p&gt;Correct me if I'm wrong, but I think this site almost perfectly embodies definition 1a of &lt;em&gt;sport&lt;/em&gt; in &lt;a href=&quot;http://www.merriam-webster.com/dictionary/sport&quot; rel=&quot;nofollow noreferrer&quot;&gt;Merriam Webster&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;a source of diversion&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Not only that, but &lt;em&gt;sport&lt;/em&gt; is good in other ways, too. It encapsulates &lt;em&gt;golf&lt;/em&gt;, which many are reluctant to abandon, but is more inclusive. Many of our rules are geared toward &lt;em&gt;sportsmanship&lt;/em&gt;, or playing fair.&lt;/p&gt;&#xA;&lt;p&gt;Sport can be serious (billion dollar industry) or relaxed (backyard football), and so can we. We have posts to extend integer sequences beyond current publication, right alongside the simplest sorting challenges. The premise and wording of them is often ridiculous, but sometimes scholarly.&lt;/p&gt;&#xA;&lt;p&gt;It's short and to the point, which also makes for a good subdomain name, &lt;em&gt;even if the overall name is something else.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sub&gt;I'm Geobits, and I approve this message.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-08-21T17:01:03.587" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="5768" PostTypeId="2" ParentId="5759" CreationDate="2015-08-21T19:09:41.787" Score="34" Body="&lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Branding is everything. It's the name the URL uses, the name outsiders use to refer to this site and the vast majority of challenges on this site are code golf challenges. It also eliminates the need for an abbreviation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It describes the site much better than the current name, since we are still closing pure programming puzzles as off topic and they only happen once in a blue moon anyway.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sure, it doesn't cover all topics on this site, but I don't think that is required. It's not like Stack Overflow only deals with questions about stack overflows or &lt;em&gt;Ubuntu?&lt;/em&gt; is the only question permitted on Ask Ubuntu.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2015-08-21T19:09:41.787" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="5769" PostTypeId="2" ParentId="2140" CreationDate="2015-08-21T23:27:49.030" Score="1" Body="&lt;h1&gt;Rec(ursion)less execution&lt;/h1&gt;&#xA;&lt;p&gt;We have a simple (non-Turing complete) language.&lt;/p&gt;&#xA;&lt;p&gt;Each line of program is a set of terms separated by single space.&#xA;Some of terms (ending with &lt;code&gt;()&lt;/code&gt;) are function calls.&#xA;Some lines (whose first term ends with &lt;code&gt;:&lt;/code&gt;) are function definitions.&#xA;The lines that are not function definitions are called expressions.&lt;/p&gt;&#xA;&lt;p&gt;This is a sample program:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;funa: one two three&#xA;funb: funa() four oclock rock&#xA;here we go funb()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here we have two function definition lines and one expression line.&lt;/p&gt;&#xA;&lt;p&gt;And this is BNF for this language just for clarity:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;literal ::= [any printable char other than ' ', ':', '(', ')']+&#xA;function_header ::= literal ':'&#xA;function_call ::= literal '()'&#xA;term ::= literal | function_call&#xA;expression ::= term | expression_list ' ' term&#xA;function_definition ::= function_header expression&#xA;&#xA;program_line ::= function_definition | expression&#xA;program ::= [program_line '\n']+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The task is to write a program or function that validates the program P and performs &lt;code&gt;EXECUTE(P)&lt;/code&gt; if the program adheres to validation rules.&lt;/p&gt;&#xA;&lt;p&gt;Validation rules:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;EXECUTE(P)&lt;/code&gt; eventually stops (it's not Turing complete - enough to check if one of the called functions would eventually cause itself to be called - either being recursive itself or &amp;quot;mutually recursive&amp;quot; with other function it calls),&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;while calling &lt;code&gt;EXECUTE(P) -&amp;gt; EXECUTE_LINE(P,L)&lt;/code&gt;, each function definition search succeedes (in other words - the program will not try to call undefined function).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;If program does not pass validation rule 1 or 2, &lt;code&gt;ERROR: RECURSIVE FUNCTION&lt;/code&gt; or &lt;code&gt;ERROR: UNRECOGNIZED FUNCTION&lt;/code&gt; should be printed respectively.&lt;/p&gt;&#xA;&lt;p&gt;When both rules seem to be violated, assume that search for undefined function causes the algorithm to fail (stop) instantly, so recursion that would occur later if the function was found, is not reported. We only report &lt;code&gt;ERROR: UNRECOGNIZED FUNCTION&lt;/code&gt; in this case (see Example 5 below).&lt;/p&gt;&#xA;&lt;p&gt;In similar way, if recursion prevents a call to function that would not be found otherwise, even though the function containing call to unrecognized function is called only &lt;code&gt;ERROR: RECURSIVE FUNCTION&lt;/code&gt; is reported (see Example 4 below).&lt;/p&gt;&#xA;&lt;p&gt;If validation does not report any of those two errors, &lt;code&gt;EXECUTE(p)&lt;/code&gt; should be called.&lt;/p&gt;&#xA;&lt;p&gt;Executing a program is defined like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;EXECUTE(P)&#xA;  - for each line L in the program P:&#xA;     - if L is not a function definition EXECUTE_LINE(P,L)&#xA;&#xA;EXECUTE_LINE(P,L)&#xA;  - for each term T in L:&#xA;      - if T is a literal&#xA;          print T followed by single space&#xA;        else&#xA;          FH = T without '()' + ':'&#xA;          FDL = find in P a line starting with term FH&#xA;          FD = all terms of FDL after FH&#xA;          EXECUTE_LINE(FD)&#xA;          &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Example 1:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a: b()&#xA;b: a()&#xA;c: cucumber&#xA;other: nofun()&#xA;d: apple banana and c()&#xA;we have d()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;we have apple banana and cucumber&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note, that in spite of existence of mutually recursive function definitions &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; and function definition &lt;code&gt;other&lt;/code&gt; calling undefined function &lt;code&gt;nofun&lt;/code&gt; error was not raised, because execution never goes to any to this functions.&lt;/p&gt;&#xA;&lt;p&gt;Example 2:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;other: nofun()&#xA;c: apple banana and cucumber&#xA;we have other()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ERROR: UNRECOGNIZED FUNCTION&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Example 3:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a: b()&#xA;b: a()&#xA;c: apple banana and cucumber&#xA;we have b()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ERROR: RECURSIVE FUNCTION&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Example 4:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a(): a() nofun()&#xA;hello a()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ERROR: RECURSIVE FUNCTION&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We don't output &lt;code&gt;ERROR: UNRECOGNIZED FUNCTION&lt;/code&gt;, because the program would never try to execute &lt;code&gt;nofun&lt;/code&gt;, recurring infinitely into first term of definition of &lt;code&gt;a&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Example 5.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a(): nofun() a()&#xA;hello a()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ERROR: UNRECOGNIZED FUNCTION&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We don't output &lt;code&gt;ERROR: RECURSIVE FUNCTION&lt;/code&gt; here, because the program would fail to find definition for &lt;code&gt;nofun&lt;/code&gt; before even tring to recurse into &lt;code&gt;a&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;b&gt;Accepted solution&lt;/b&gt;:&#xA;a function or a program that takes a program in the above-defined language, validates and runs it.&#xA;&lt;em&gt;You can assume that program has already been split into single lines&lt;/em&gt;, however you can use raw input or accept program as single string when convenient.&lt;/p&gt;&#xA;&lt;p&gt;This is code-golf, so the shortest submission in term of bytes will win.&#xA;However, all working submissions in all languages will be appreciated.&lt;/p&gt;&#xA;" OwnerUserId="38525" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-08-22T08:54:20.383" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5771" PostTypeId="2" ParentId="2140" CreationDate="2015-08-22T14:22:44.297" Score="0" Body="&lt;h1&gt;Alternating Hamiltonian Chess Boards&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Overview&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Find a Hamiltonian cycle on a chess board that alternates between black and white squares. The catch is that the board does not have the colours arranged in the conventional way.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Detail&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Consider a chess board, with each square having 4 neighbours (up, down, left, right), apart from the edge and corner squares which only have 3 or 2 neighbours respectively. A &lt;a href=&quot;https://en.wikipedia.org/wiki/Hamiltonian_path&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hamiltonian cycle&lt;/a&gt; is a closed path (loop) that visits every square exactly once, moving from neighbour to neighbour (never diagonally).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On a chess board, it is easy to find a Hamiltonian cycle that alternates between black and white squares (in fact, &lt;em&gt;any&lt;/em&gt; cycle will alternate between black and white squares). What if the black and white squares were not arranged so conveniently? Clearly there are arrangements for which there is no possible alternating Hamiltonian cycle, for example putting all the white squares in one half of the board.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The task of your code is to find any valid cycle, or indicate if there are none.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input &amp;amp; output&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;An 8 by 8 board of black and white squares.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is in the form of a string of 64 characters each of which is either &quot;0&quot; or &quot;1&quot;, terminated by a newline. This indicates the colours of the squares in English reading order.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Any valid cycle if one exists, or a zero as an indication that no valid cycle exists.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A cycle is represented by a comma separated list of integers from 0 to 63 inclusive, indicating the order in which the squares are visited. Again the labelling is in English reading order.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Whether a list of a zero, the output is terminated with a newline.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Square numbering&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The squares are labelled in English reading order (left to right then top to bottom). So for example, a 3 by 3 board would be labelled as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 1 2&#xA;3 4 5&#xA;6 7 8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this equivalent to another question already asked?&lt;/li&gt;&#xA;&lt;li&gt;My first thought was &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, but I'm now preferring &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;. There are a number of quick checks that can eliminate the possibility of there being a valid cycle, which will be competitive in fastest code. I'd rather see these than golfed brute force approaches.&lt;/li&gt;&#xA;&lt;li&gt;I've chosen 8 by 8 simply because it's a familiar size due to chess. Would this be better with a different size board? For fastest code I'd want the time taken to be over a minute for at least some inputs, so that there is enough time to judge the difference between answers. Ideally for fastest code I'd choose inputs that take quite a bit longer than that to allow for solutions which are far more efficient than I expect.&lt;/li&gt;&#xA;&lt;li&gt;How restrictive should I be with the input and output formats? For fastest code if the body of the problem takes a reasonably long time then input and output conversion should be negligible so I could insist on a single format for ease of measuring answers.&lt;/li&gt;&#xA;&lt;li&gt;Is there any advantage to having a fixed board size, or would it be more interesting with the board size as an initial input N, followed by the board?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2015-09-05T14:43:21.687" LastActivityDate="2015-09-05T14:43:21.687" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="5772" PostTypeId="2" ParentId="1061" CreationDate="2015-08-22T18:36:04.737" Score="90" Body="&lt;h1&gt;Using prior knowledge to circumvent other loopholes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In particular, &lt;em&gt;gaining an unfair advantage&lt;/em&gt; by inventing new languages for future challenges that are being sandboxed, discussed in chat, are your own, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, creating a language that solves a task specified in a sandboxed post with a one-character built-in (or even a zero-byte solution) should be forbidden for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Likewise, publishing an interpreter &lt;a href=&quot;http://esolangs.org/wiki/MetaGolfScript&quot; rel=&quot;nofollow noreferrer&quot;&gt;MetaGolfscript-X&lt;/a&gt; just in time for a challenge should not be allowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This does not cover cases such as the creation of &lt;a href=&quot;http://esolangs.org/wiki/%3F%3F%3F&quot; rel=&quot;nofollow noreferrer&quot;&gt;???&lt;/a&gt; for &lt;a href=&quot;https://codegolf.stackexchange.com/q/54807&quot;&gt;The Programming Language Quiz&lt;/a&gt;, since there is no advantage in using this particular language for the challenge.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2015-08-22T18:53:10.533" CommentCount="6" CommunityOwnedDate="2015-08-22T18:36:04.737" ContentLicense="CC BY-SA 3.0" />
  <row Id="5773" PostTypeId="1" CreationDate="2015-08-22T20:04:08.043" Score="11" ViewCount="155" Body="&lt;p&gt;I believe we've come to the point where 25-50% of the questions posted are posted by new users and almost always do not follow the rules (duplicate, no winning condition). Whenever you look at the questions page it's filled with closed questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we add more explicit warnings / notifications to new users that notify them of the rules?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To me it's clear that currently there is not enough information notifying them of the fact that we have these rules &lt;strong&gt;before they post&lt;/strong&gt;. This is not a recurring problem - it nearly always happens once and not again.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastEditorUserId="68942" LastEditDate="2021-06-09T06:11:48.643" LastActivityDate="2021-06-09T06:11:48.643" Title="Should we add more warnings/notifications before letting a new user post?" Tags="|discussion|feature-request|status-planned|new-users|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="5774" PostTypeId="2" ParentId="5773" CreationDate="2015-08-22T20:47:12.730" Score="6" Body="&lt;p&gt;Yes I think we should. I am not sure about the actual number but I too have the impression that many first posts are on the one hand good ideas, but on the other hand poorly executed or duplicates of existing challenges or just do not 'fit' in/comply with the rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am not sure whether this is a good idea: I'd like to suggest that you need more reputation in order to post challenges (or if you want to post earlier, you have to have a mods approval or something like that). This would lead to new users first having to gain some experience here by first participating in some challenges. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The backdraw of course could be a discuragement for new members, and we are still quite a small community (the active part).&lt;/p&gt;&#xA;" OwnerUserId="24877" LastActivityDate="2015-08-22T20:47:12.730" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5777" PostTypeId="2" ParentId="5759" CreationDate="2015-08-23T09:59:22.013" Score="-3" Body="&lt;h1&gt;Programming Challenges and Code Golf&lt;/h1&gt;&#xA;&lt;p&gt;Based on Rainbolt's answer.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-08-23T09:59:22.013" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5778" PostTypeId="1" AcceptedAnswerId="5780" CreationDate="2015-08-24T07:32:20.247" Score="0" ViewCount="53" Body="&lt;p&gt;I use the SE platform for some time and I know that in the spirit of this Q&amp;amp;A platform when someone is giving down-votes or close votes he should also provide some feedback to improve the question. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;My last question:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/55198/check-all-the-keys-of-a-keyboard&quot;&gt;Check all the keys of a keyboard&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;was closed for not being clear. But if you look at people that closed it, none,  except for a user whose question I addressed, ever gave feedback.  &lt;/p&gt;&#xA;" OwnerUserId="12328" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2015-08-24T13:20:19.150" Title="Closing questions as not clear without giving feedback" Tags="|discussion|reopening|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5780" PostTypeId="2" ParentId="5778" CreationDate="2015-08-24T13:20:19.150" Score="2" Body="&lt;p&gt;I didn't vote to close this one, but that's mainly because I didn't see it before it was put on hold. However, this sort of thing is pretty common, and I'll explain my usual thought process:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you're already engaged with one user in comments and I simply &lt;em&gt;agree&lt;/em&gt; with him, I may feel he has it under control and there's no need to jump in with more comments just asking the same questions. Especially since you went into chat with Doorknob, and were still working things out when it was held (if my view of the timeline is correct), then it was put on hold &lt;em&gt;while it still had problems&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe this is 100% in keeping with the purpose of putting questions on hold, to &quot;pause&quot; them until they can be answered properly. Jumping in with even more comments (especially if they would just be reiterating the current ones) doesn't seem either appropriate or necessary to me.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2015-08-24T13:20:19.150" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5782" PostTypeId="1" CreationDate="2015-08-25T01:17:50.680" Score="2" ViewCount="78" Body="&lt;p&gt;For multiple recent questions, people have wanted to close a question because the question was too narrow - not enough variety of potential answers to make it interesting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Those questions were: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/54945/sign-that-word&quot;&gt;Sign that word!&lt;/a&gt;, , and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55218/fibonacci-in-script&quot;&gt;Fibonacci in +!()[]script&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The desire for such a close reason has come up before, leading to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1335/too-trivial-close-vote&quot;&gt;Too trivial Close Vote&lt;/a&gt;, where the clear most upvoted option was adding the following:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Too Narrow&lt;/strong&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;There are either too few possible ways to answer, or answers would&#xA;  only differ in the language used.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Would it be possible to add this close reason, or is there something preventing us?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If we can't add that close reason, what should we do if we encounter such a question, and would like to vote to close it?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2015-08-25T01:50:38.543" Title="Adding a &quot;Too Narrow&quot; close option" Tags="|discussion|policy|close-reasons|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5783" PostTypeId="2" ParentId="5782" CreationDate="2015-08-25T01:50:38.543" Score="3" Body="&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Yes, if there is enough support from the community, moderators can add a custom close option under the off-topic sub-menu (we already have two: belongs on Stack Overflow, and is missing an objective winning criterion).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can always use a custom off-topic close vote:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/AcDij.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/AcDij.png&quot; alt=&quot;screenshot&quot;&gt;&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;To address the question of whether such a close reason is necessary, I don't think there's currently a pressing need (although I certainly wouldn't oppose creating one, if it was demonstrated that there would be a significant benefit in adding this close reason). &lt;a href=&quot;https://codegolf.stackexchange.com/q/19846/3808&quot;&gt;The&lt;/a&gt; community &lt;a href=&quot;https://codegolf.stackexchange.com/q/38295/3808&quot;&gt;already&lt;/a&gt; seems &lt;a href=&quot;https://codegolf.stackexchange.com/q/28567/3808&quot;&gt;to do&lt;/a&gt; a pretty &lt;a href=&quot;https://codegolf.stackexchange.com/q/36850/3808&quot;&gt;good&lt;/a&gt; job of &lt;a href=&quot;https://codegolf.stackexchange.com/q/5994/3808&quot;&gt;handling&lt;/a&gt; these on &lt;a href=&quot;https://codegolf.stackexchange.com/q/28715/3808&quot;&gt;its own&lt;/a&gt; (all of these links require 2k+ reputation to view, as they have been deleted by various PPCG users; suffice to say, none of them are very interesting challenges).&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2015-08-25T01:50:38.543" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5784" PostTypeId="1" CreationDate="2015-08-25T12:56:08.337" Score="1" ViewCount="90" Body="&lt;p&gt;I've got an idea for a fun (!) challenge but it would be a little different from the ones I normally see on this site. The challenge would be to come up with an algorithm that solves the problem the best way and to implement it in code, which I would estimate taking a day or two to work on. The winner would be the program that generates the best output according to an objective criteria.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would this sort of thing be welcome on this site?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(The following &lt;em&gt;isn't&lt;/em&gt; the challenge I'm thinking of, but to give you an idea of scope.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Compress Shakespeare.&lt;/strong&gt;&lt;br&gt;&#xA;Write a program that will take a text file containing English text and produce some program code that will reproduce the input text. I'm looking for algorithmic cleverness since no-one has yet developed a good general purpose compression algorithm.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program should work with any text file, but the winner will be the code that produces the shortest output from Shakespeare's hamlet, (link).&lt;/p&gt;&#xA;" OwnerUserId="20793" LastEditorUserId="20793" LastEditDate="2015-08-25T13:54:38.053" LastActivityDate="2015-08-25T17:00:38.883" Title="Are long form challenges welcome?" Tags="|discussion|challenge-quality|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5787" PostTypeId="2" ParentId="5784" CreationDate="2015-08-25T17:00:38.883" Score="3" Body="&lt;p&gt;There aren't many challenges on this site which are are aimed at that level of effort, but there are some, and they seem to be well received. See e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4732/194&quot;&gt;Emulate an Intel 8086 CPU&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, the specific example you mention is very badly chosen. The easy pickings of compression / Kolmogorov complexity have been done more than enough times, and your example would be closed as a duplicate (e.g. of &lt;a href=&quot;https://codegolf.stackexchange.com/q/4771/194&quot;&gt;Text compression and decompression — &amp;quot;Nevermore.&amp;quot;&lt;/a&gt;).&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2015-08-25T17:00:38.883" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5788" PostTypeId="2" ParentId="2140" CreationDate="2015-08-25T18:07:43.250" Score="2" Body="&lt;h1&gt;3-Hole Golf Course: Text Formatter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a series of three code golf challenges.&#xA;The over-arching idea is that in each of them, you write a program that processes text in some way, and if you pipe an input text through all three solutions (with a small amount of glue code), it spits out a nicely formatted paragraph.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/55939/text-processing-1-hyphenation&quot;&gt;Hole 1: Hyphenation&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;Hole 2: Line Wrap&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You are given as input a hyphenated piece of text, and the maximum width &lt;code&gt;n &amp;ge; 2&lt;/code&gt; of a line.&#xA;The output shall be a newline-delimited string, obtained by greedily splitting the input into lines of length at most &lt;code&gt;n&lt;/code&gt; characters.&#xA;Lines can be broken between words (replacing a space with a newline), after a tilde (replacing it with a hyphen), or after a hyphen (inserting a newline after it; this is needed with words like &lt;code&gt;well-known&lt;/code&gt;).&#xA;All tildes which are not replaced by hyphens should be removed, and this should be taken into account when computing the lengths of the lines.&#xA;The correct output for &lt;code&gt;Hy~phen~ate this sen~tence!&lt;/code&gt; and &lt;code&gt;20&lt;/code&gt; would be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hyphenate this sen-&#xA;tence!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A syllable that's at least &lt;code&gt;n&lt;/code&gt; characters long and not the last syllable of a word shall be cut after the &lt;code&gt;n-1&lt;/code&gt;st character, and a hyphen shall be inserted there before the line break.&#xA;The same applies to the last syllable of a word that's &lt;em&gt;over&lt;/em&gt; &lt;code&gt;n&lt;/code&gt; characters long.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Hole 3: Justification&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You are given as input &lt;em&gt;one line&lt;/em&gt; of text, and the desired width &lt;code&gt;n&lt;/code&gt; of a line, which is at least the length of the input.&#xA;Your output is that line, but with extra spaces added between the words to make its length exactly &lt;code&gt;n&lt;/code&gt;.&#xA;The extra space should be added in an aesthetically pleasing way, so we require the following.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The lengths of any two runs of spaces differ by at most 1. This means that for some number &lt;code&gt;k&lt;/code&gt;, every run of spaces between two words shall be of length &lt;code&gt;k&lt;/code&gt; or &lt;code&gt;k+1&lt;/code&gt;. For example, we could have runs of only 5 or 6 spaces between the words.&lt;/li&gt;&#xA;&lt;li&gt;The list of lengths of these runs shall be &lt;em&gt;balanced&lt;/em&gt;, in the following sense. For any two contiguous sublists of the same length, the number of &lt;code&gt;k&lt;/code&gt;s in them differs by at most 1. For example, the list of lengths &lt;code&gt;5, 6, 5, 5, 6, 6, 5&lt;/code&gt; is not balanced, since the length-2 sublist &lt;code&gt;5, 5&lt;/code&gt; and &lt;code&gt;6, 6&lt;/code&gt; contain 2 and 0 occurrences of &lt;code&gt;5&lt;/code&gt;, respectively. The list &lt;code&gt;5, 6, 5, 5, 6, 5, 6&lt;/code&gt;, on the other hand, is balanced.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;These constraints do not uniquely specify the output.&#xA;For example, for the inputs &lt;code&gt;Hyphenate this sen-&lt;/code&gt; and &lt;code&gt;20&lt;/code&gt;, the two acceptable outputs are&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hyphenate  this sen-&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hyphenate this  sen-&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If the input contains only one word, it should be left unchanged.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sandbox notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In all of the above holes, we can add some constraints to the input, if the challenge would otherwise be too complex (all hyphens and spaces occur between letters, all punctuation occurs at the end of words etc).&#xA;However, I'm a little concerned that the holes may still be too complex.&#xA;In the first hole, I can relax the case-insensitivity of the hyphenation list, and in the last hole, the second requirement can be dropped, but I feel that the second hole is already about as simple as I can make it.&lt;/p&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.563" LastActivityDate="2015-09-03T00:16:05.787" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5789" PostTypeId="1" AcceptedAnswerId="12854" CreationDate="2015-08-25T21:35:21.023" Score="2" ViewCount="127" Body="&lt;p&gt;I just tried &lt;a href=&quot;https://meta.codegolf.stackexchange.com&quot;&gt;https://meta.codegolf.stackexchange.com&lt;/a&gt; and got a warning that this site cannot be accessed securely.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there a reason why PCG Meta is not accessible securely? &lt;a href=&quot;https://meta.stackoverflow.com/&quot;&gt;Meta.SO&lt;/a&gt; for example is available in HTTPS.&lt;/p&gt;&#xA;" OwnerUserId="16901" LastActivityDate="2017-06-12T21:46:52.367" Title="Why is PCG meta not available in HTTPS?" Tags="|discussion|meta|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5790" PostTypeId="2" ParentId="2140" CreationDate="2015-08-26T01:19:12.820" Score="4" Body="&lt;h1&gt;Musical Washing Machine&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I have a washing machine with a knob and several buttons.  The knob selects the type of laundry and the buttons cycle through water temperature, etc. options. When pressed, these each create a musical note.  There are five musical notes that can be made, in this ascending order: F A C D E&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;knob (K)&#xA;   When 360ed: play D and reset all other buttons&#xA;wash temp (T)&#xA;   1st press (cool -&amp;gt; warm): A&#xA;   2nd press (warm -&amp;gt; hot): F&#xA;   3rd press (hot -&amp;gt; cold): E&#xA;   4th press (cold -&amp;gt; cool): C&#xA;   (repeat)&#xA;spin speed (S)&#xA;   1st press (medium -&amp;gt; max extract): F&#xA;   2nd press (max extract -&amp;gt; no spin): E&#xA;   3rd press (no spin -&amp;gt; medium): A&#xA;   (repeat)&#xA;soil level (L)&#xA;   1st press (medium -&amp;gt; heavy): A&#xA;   2nd press (heavy -&amp;gt; extra heavy): F&#xA;   3rd press (extra heavy -&amp;gt; light): E&#xA;   4th press (light -&amp;gt; medium): C&#xA;   (repeat)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a series of notes, determine if if can be played on my washing machine, and, if so, output the series of moves to generate it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I/O coming soon to a washing machine near you&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2018-02-08T20:02:57.407" LastActivityDate="2018-02-08T20:02:57.407" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5792" PostTypeId="1" AcceptedAnswerId="5793" CreationDate="2015-08-26T08:47:39.213" Score="3" ViewCount="146" Body="&lt;p&gt;Now I don't know PHP or how exactly it fits into HTML, but I had an idea that you could run a PHP script in a Stack Snippet. Is this true, and if so could you give some examples?&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2015-08-26T19:06:51.033" Title="PHP scripts in Stack Snippets" Tags="|discussion|stack-snippets|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5793" PostTypeId="2" ParentId="5792" CreationDate="2015-08-26T08:59:37.637" Score="9" Body="&lt;p&gt;This is impossible. PHP is server-side, but snippets are client-side.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastActivityDate="2015-08-26T08:59:37.637" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5795" PostTypeId="1" AcceptedAnswerId="5796" CreationDate="2015-08-26T15:17:20.387" Score="6" ViewCount="110" Body="&lt;p&gt;I want to comment the language of a code snippet found on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/54807/the-programming-language-quiz&quot;&gt;The Programming Language Quiz&lt;/a&gt;, but I can't, because I don't have enough reputation. I've tried it in the programming language that I think it is, and it has worked.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Isn't the 50 reputation minimum unfair?&lt;/p&gt;&#xA;" OwnerUserId="43338" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-08-26T15:23:03.983" Title="50 reputation to comment on answer to 'The Programming Language Quiz'?" Tags="|support|reputation|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5796" PostTypeId="2" ParentId="5795" CreationDate="2015-08-26T15:23:03.983" Score="8" Body="&lt;p&gt;In short: yes, I think it is unfair.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, this is a quirk for this specific puzzle, due to answers being in comment form. The fifty reputation limit is network wide, and not something easily changeable (especially for a single post).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the future, I'd like to see an alternative to comment-answers, but I'm not sure exactly what form that would take right now.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2015-08-26T15:23:03.983" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5797" PostTypeId="2" ParentId="5318" CreationDate="2015-08-26T16:34:53.733" Score="27" Body="&lt;h1&gt;Appearances in papers and articles&lt;/h1&gt;&#xA;&lt;p&gt;Here's a few works which reference PPCG in some way or other:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;&lt;a href=&quot;http://dl.acm.org/citation.cfm?id=2502492&quot; rel=&quot;nofollow noreferrer&quot;&gt;N queens problem: a metaprogramming stress test for the compiler&lt;/a&gt;&lt;/em&gt; (2013): An article citing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/3184/solve-the-eight-queens-problem-at-compile-time&quot;&gt;Solve the eight queens problem at compile-time&lt;/a&gt; under &amp;quot;Previous work&amp;quot;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;&lt;a href=&quot;http://dspace.mit.edu/handle/1721.1/87669&quot; rel=&quot;nofollow noreferrer&quot;&gt;No Code: Null Programs&lt;/a&gt;&lt;/em&gt; (2014): A technical report on 0 byte programs. References &lt;a href=&quot;https://codegolf.stackexchange.com/a/2945/21487&quot;&gt;Random832's wc answer&lt;/a&gt; to &amp;quot;Write a program to print the sum of the ascii codes of the program&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;&lt;a href=&quot;http://arxiv.org/abs/1505.04274&quot; rel=&quot;nofollow noreferrer&quot;&gt;Threes!, Fives, 1024!, and 2048 are Hard&lt;/a&gt;&lt;/em&gt; (2015): An arXiv paper on the computational complexity of 2048 and related games. References &lt;a href=&quot;https://codegolf.stackexchange.com/questions/24885/solve-a-deterministic-version-of-2048-using-the-fewest-bytes&quot;&gt;Claudiu's Python answer&lt;/a&gt; to &amp;quot;Solve a deterministic version of 2048 using the fewest bytes&amp;quot; by noting that the highest value on a 4x4 board is still unknown.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;&lt;a href=&quot;http://www.scottaaronson.com/busybeaver.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory&lt;/a&gt;&lt;/em&gt; (&lt;a href=&quot;http://dspace.mit.edu/handle/1721.1/100680&quot; rel=&quot;nofollow noreferrer&quot;&gt;2015&lt;/a&gt; / 2016): A paper demonstrating the existence of a 7918-state Turing machine that cannot be proven to run forever in ZFC. Cites PPCG as &amp;quot;A place where programmers go for recreational code golfing&amp;quot;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;&lt;a href=&quot;http://www.microsiervos.com/archivo/ordenadores/reloj-digital-juego-de-la-vida.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Un reloj digital programado en el Juego de la vida&lt;/a&gt;&lt;/em&gt;: In English, the title is &amp;quot;A digital clock programmed in the Game of Life&amp;quot;. It is a news article about &lt;a href=&quot;https://codegolf.stackexchange.com/a/111932/64159&quot;&gt;this answer&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And finally,&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;&lt;a href=&quot;http://eprints.fri.uni-lj.si/2351/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Testing and benchmarking the prototype MRuby compiler&lt;/a&gt;&lt;/em&gt; (2014): A thesis citing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/3105/generate-a-mandelbrot-fractal&quot;&gt;Generate a mandelbrot fractal?&lt;/a&gt;. I can't read this, but I do believe that they are trying to cite the &lt;em&gt;image&lt;/em&gt; in the Mandelbrot section. If so, then that's one undeserved citation for us, since Wikipedia dates this image &lt;a href=&quot;https://en.wikipedia.org/wiki/Mandelbrot_set&quot; rel=&quot;nofollow noreferrer&quot;&gt;back to 1978&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;&lt;a href=&quot;https://books.google.com.au/books?id=MPBZAgAAQBAJ&amp;amp;pg=PA77&amp;amp;dq=codegolf.stackexchange&amp;amp;hl=en&amp;amp;sa=X&amp;amp;ved=0CCUQ6AEwAWoVChMI97mDm5rHxwIVxuamCh2Hig5X#v=onepage&amp;amp;q=codegolf.stackexchange&amp;amp;f=false&quot; rel=&quot;nofollow noreferrer&quot;&gt;Expert JavaScript&lt;/a&gt;&lt;/em&gt; (2013): A book which has &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2682/tips-for-golfing-in-javascript&quot;&gt;Tips for golfing in JavaScript&lt;/a&gt; in its references for the &amp;quot;Jargon and Slang&amp;quot; chapter.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="21487" LastEditorUserId="36398" LastEditDate="2020-09-19T11:46:29.223" LastActivityDate="2020-09-19T11:46:29.223" CommentCount="0" CommunityOwnedDate="2015-08-26T16:34:53.733" ContentLicense="CC BY-SA 4.0" />
  <row Id="5798" PostTypeId="2" ParentId="5792" CreationDate="2015-08-26T19:06:51.033" Score="2" Body="&lt;p&gt;Perhaps, if somebody added a PHP-to-Javascript converter like the other converters shown &lt;a href=&quot;https://codegolf.stackexchange.com/questions/40073/making-future-posts-runnable-online-with-stack-snippets/&quot;&gt;here&lt;/a&gt;, it could be possible. It would most likely be only a partial solution capable of only a subset of PHP's features, if ever implemented, since some wouldn't be possible.&lt;/p&gt;&#xA;" OwnerUserId="42844" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2015-08-26T19:06:51.033" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5799" PostTypeId="1" CreationDate="2015-08-26T19:39:08.230" Score="0" ViewCount="104" Body="&lt;p&gt;Why was the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55231/sort-a-list-of-numbers-on-the-%CE%BB-calculus/55233#55233&quot;&gt;shortest λ sort post&lt;/a&gt; put on hold? What is &quot;unclear&quot; about it? The only question raised (about church encodings) was promptly clarified in the post as soon as it was pointed.&lt;/p&gt;&#xA;" OwnerUserId="7607" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-08-26T19:50:22.580" Title="Why was my post put on hold?" Tags="|support|specific-question|close-reasons|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5800" PostTypeId="2" ParentId="1061" CreationDate="2015-08-26T20:00:09.347" Score="61" Body="&lt;h1&gt;Creating a new compiler for a language after a challenge was posted&lt;/h1&gt;&#xA;&lt;p&gt;There is some debate arising from &lt;a href=&quot;https://codegolf.stackexchange.com/a/55351/34718&quot;&gt;this answer&lt;/a&gt;. He created his own compiler for the C programming language that extends the language specifications. It seems pretty obvious that this will be declared a loophole, to me at least, but I'm posting this for the record.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-08-26T20:00:09.347" CommentCount="16" CommunityOwnedDate="2015-08-26T20:00:09.347" ContentLicense="CC BY-SA 3.0" />
  <row Id="5801" PostTypeId="2" ParentId="2140" CreationDate="2015-08-26T20:41:35.743" Score="0" Body="&lt;h2&gt;Buffalo buffalo buffallo buffalo buffallo buffallo buffallo parse buffalo buffalo buffallo buffalo buffallo buffallo buffallo&lt;/h2&gt;&#xA;&lt;p&gt;Write a program that can take a integer input N &amp;gt; 0 and then describes the syntax of a phrase in the style of &amp;quot;Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo&amp;quot; with N repetitions.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Buffalo_buffalo_Buffalo_buffalo_buffalo_buffalo_Buffalo_buffalo&quot; rel=&quot;nofollow noreferrer&quot;&gt;The wikipedia page&lt;/a&gt; has the parse tree and accepted syntax for phrases up to N = 8.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The sentence is unpunctuated and uses three different readings of the word &amp;quot;buffalo&amp;quot;. In order of their first use, these are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a. the city of Buffalo, New York, United States, which is used as a noun adjunct in the sentence and is followed by the animal;&lt;/li&gt;&#xA;&lt;li&gt;n. the noun buffalo, an animal, in the plural (equivalent to &amp;quot;buffaloes&amp;quot; or &amp;quot;buffalos&amp;quot;), in order to avoid articles;&lt;/li&gt;&#xA;&lt;li&gt;v. the verb &amp;quot;buffalo&amp;quot; meaning to outwit, confuse, deceive, or intimidate.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;So for the first eight the output should be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Bully (meaning the imperative &amp;quot;[you] Buffalo!&amp;quot; - command someone to bully).&lt;/li&gt;&#xA;&lt;li&gt;NY bison (meaning a bison that hails from the town of Buffalo).&lt;/li&gt;&#xA;&lt;li&gt;NY bison bully (a bison from NY bullies).&lt;/li&gt;&#xA;&lt;li&gt;NY bison bully bison (NY Bison bully a bison)&lt;/li&gt;&#xA;&lt;li&gt;NY bison bully NY bison (NY bison bully NY bison)&lt;/li&gt;&#xA;&lt;li&gt;Buffalo buffalo buffallo buffalo buffallo buffallo (NY bison bully &lt;strong&gt;(TBC)&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Buffalo buffalo buffallo buffalo buffallo buffallo&lt;/li&gt;&#xA;&lt;li&gt;Buffalo buffalo buffallo buffalo buffallo buffallo buffallo&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;In the comments section, wikipedian Robin Johnson has it for 9 through 12 (NY stands for Buffalo, NY):&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;9&quot;&gt;&#xA;&lt;li&gt;(NY bison [which] bison bully) bully (bison [which] NY bison bully)&lt;/li&gt;&#xA;&lt;li&gt;(Bison) bully (NY bison [which] NY bison (NY bison bully) bully)&lt;/li&gt;&#xA;&lt;li&gt;(NY Bison) bully (NY bison [which] NY bison ([which] NY bison bully) bully)&lt;/li&gt;&#xA;&lt;li&gt;(bison [which] bison ([which] NY bison bully) bully) bully (NY bison [which] NY bison bully)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;He added parenthesis for more phrase visibility, but that is not needed.&lt;/p&gt;&#xA;&lt;p&gt;Your program should take the input and explain the gramatically correct phrase doing the following substitutions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;NY for the Buffalo, NY city.&lt;/li&gt;&#xA;&lt;li&gt;Bison for the animal Buffalo.&lt;/li&gt;&#xA;&lt;li&gt;Bully for the verb.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;[code-golf] [kolmogorov-complexity]&lt;/p&gt;&#xA;" OwnerUserId="31779" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-08-26T20:41:35.743" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5804" PostTypeId="1" CreationDate="2015-08-26T00:10:00.727" Score="19" ViewCount="338" Body="&lt;p&gt;We have lots of tips for golfing in specific languages, but what about other types of challenge?  Has anyone wondered how to improve their &lt;a href=&quot;/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; answers?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What general tips do you have for gaining popularity (i.e. upvotes) in &lt;a href=&quot;/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;s?  I'm looking for ideas which can be applied to answers to &lt;a href=&quot;/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please post one tip per answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please consider linking to specific answers you feel support your tip.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Right now this is on hold &lt;em&gt;as primarily opinion-based&lt;/em&gt;.  My initial intention (not stated - my fail) with this question was in fact to address what is in @Sp3000's comment - a lot of pop-con answers are upvoted for the wrong reasons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would like to see answers that provide tips for creating quality pop-con answers.  IMO tips to concretely help produce higher quality answers are more than just opinions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Conversely I am also OK with tips recommending &lt;em&gt;against&lt;/em&gt; specific things, for example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Don't overdo formatting.&lt;/li&gt;&#xA;&lt;li&gt;Carefully consider the use of popular/nerd-culture references.  While these may attract buckets of waffly, unicorny upvotes, they don't always improve the quality of an answer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="11259" OwnerDisplayName="Digital Trauma" LastActivityDate="2015-09-03T08:54:47.053" Title="Tips for providing high-quality answers in popularity contests" Tags="|discussion|popularity-contest|" AnswerCount="9" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="5805" PostTypeId="2" ParentId="5804" CreationDate="2015-08-26T00:15:24.927" Score="26" Body="&lt;h1&gt;Readability&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Round here, we're all used to fiendishly obfuscated &lt;a href=&quot;/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; answers.  While sacrificing readability is perfectly acceptable to squeeze one more byte out of a code-golf answer, it really doesn't cut it in popularity contests.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want people to upvote your answers, then they want to be able to easily read the code to understand what it is doing, even if they are not experienced in the given language you are answering in.  If you must use some arcane syntax, then write &lt;em&gt;useful&lt;/em&gt; comments or a good explanation after your code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Good code readability includes, but is not limited to:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;correct indentation&lt;/li&gt;&#xA;&lt;li&gt;useful naming of variables, functions and other objects&lt;/li&gt;&#xA;&lt;li&gt;self-consistency&lt;/li&gt;&#xA;&lt;li&gt;adherence to common best-practices for your given language&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="11259" OwnerDisplayName="Digital Trauma" LastActivityDate="2015-08-26T00:20:13.877" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5806" PostTypeId="2" ParentId="5804" CreationDate="2015-08-26T00:30:11.417" Score="44" Body="&lt;h2&gt;Post quickly&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Thanks to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2053/20260&quot;&gt;Fastest Gun in the West Effect&lt;/a&gt;, answers posted soon after the question tend to get more upvotes than ones posted later. Moreover, the higher-voted your answer is, the more people see it, the more upvotes it will receive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, this tip, posted only 20 minutes after the question, is sure to get upvotes solely because of that fact.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you tend not to see questions until hours afterwards, consider moving to another time zone, or not sleeping.&lt;/p&gt;&#xA;" OwnerUserId="20260" OwnerDisplayName="xnor" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2015-08-26T00:30:48.757" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="5807" PostTypeId="2" ParentId="5804" CreationDate="2015-08-26T00:43:50.810" Score="13" Body="&lt;h1&gt;Explain your work&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This tip is for the more complex popularity contests where your approach to the problem is important. It's one thing to have an answer that  works wonders, but people are going to like it even better if they actually understand what it is that you're doing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The more reproducible your explanation is, the better, but try not to overcomplicate the explanation and keep it to a moderate length. If you have an image that illustrates your approach well, then adding it might help break the wall-of-text monotony.&lt;/p&gt;&#xA;" OwnerUserId="21487" OwnerDisplayName="Sp3000" LastActivityDate="2015-08-26T00:43:50.810" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5808" PostTypeId="2" ParentId="5804" CreationDate="2015-08-26T01:11:47.967" Score="19" Body="&lt;h1&gt;Something Different&lt;/h1&gt;&#xA;&lt;p&gt;Quite often the answers follow the same format/approach.  Doing something which demonstrates thinking outside the square and attacks the question from a different angle will garner a few votes.&lt;/p&gt;&#xA;&lt;p&gt;Of course this has to go hand in hand with the other answers here.&lt;/p&gt;&#xA;&lt;p&gt;I think this &lt;a href=&quot;https://codegolf.stackexchange.com/a/24355/31347&quot;&gt;answer&lt;/a&gt; is probably the best I can find at the moment.  The idea of projecting the globe onto a cube ... in my opinion ... is brilliant and thinking outside the box.&lt;/p&gt;&#xA;" OwnerUserId="31347" OwnerDisplayName="MickyT" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-08-26T19:43:17.460" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5809" PostTypeId="2" ParentId="5804" CreationDate="2015-08-26T01:38:13.403" Score="24" Body="&lt;h1&gt;Use pretty pictures&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It sounds silly, but pictures are eye-catching. For example, many of the highest-voted answers to Calvin's &lt;a href=&quot;https://codegolf.stackexchange.com/q/44680/20469&quot;&gt;Language Showcase Challenge&lt;/a&gt; feature images. However, &lt;strong&gt;don't include images just for the sake of including images; they should improve the post in a meaningful way&lt;/strong&gt;.&lt;/p&gt;&#xA;" OwnerUserId="20469" OwnerDisplayName="Alex A." LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2015-08-26T03:17:37.150" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5810" PostTypeId="2" ParentId="5804" CreationDate="2015-08-26T04:16:45.933" Score="7" Body="&lt;h2&gt;Add a cow to your answer&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; __________________________&#xA;&amp;lt; Add a cow to your answer &amp;gt;&#xA; --------------------------&#xA;        \   ^__^&#xA;         \  (oo)\_______&#xA;            (__)\       )\/\&#xA;                ||----w |&#xA;                ||     ||&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://stackoverflow.com/a/1807536/174728&quot;&gt;One of my answers long long ago&lt;/a&gt;,  when code-golf was still on stackoverflow, got far more votes than it deserved.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any kind of ascii-art code styling seems to go down quite well&lt;/p&gt;&#xA;" OwnerUserId="95" OwnerDisplayName="gnibbler" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2015-08-26T04:16:45.933" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5811" PostTypeId="2" ParentId="5804" CreationDate="2015-08-26T07:21:31.360" Score="5" Body="&lt;h1&gt;Spread the common sense&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Try to come up with some very simple and obvious basic ideas (the implementation isn't necessarily easy), where others aren't very sure about it really works, and they aren't sure everybody knows that. And after seeing your answer, they are sure.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Keep the basic idea simple, while it should seems that it need some effort, specific knowledge (even if irrelevant), or enough sanity to complete your answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's better that users will think your idea should become very obvious to everyone later, and it is definitely not very obvious that everyone (the asker for example) can come up with this idea for now.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You make the later repetitions of this idea less surprising, and users (which are mostly new to this site) want them to be less surprising to everyone. In reality they can surprise new users, but users can lie to themselves that they won't. Ideally users won't be distracted by similar things in later posts. And users against the common sense have to explain more for their points. Then you will probably have an upvote.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The example is on StackOverflow: &lt;a href=&quot;https://stackoverflow.com/a/1732454/3998030&quot;&gt;https://stackoverflow.com/a/1732454/3998030&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Positively, it may mean to change your perspective, but measured in a slightly different way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not sure whether it really works well, and how practical it is. And I don't think it is a good idea to do it too often, unless we still want something like code-trolling. But I think my top-voted answers satisfied this criterion well.&lt;/p&gt;&#xA;" OwnerUserId="25180" OwnerDisplayName="jimmy23013" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2015-08-26T07:35:42.833" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5812" PostTypeId="2" ParentId="2140" CreationDate="2015-08-27T10:47:29.560" Score="0" Body="&lt;h1&gt;Get home by ONLY turning right&lt;/h1&gt;&#xA;&lt;p&gt;You're finally trying to get a drivers license. About halfway during the lesson, the instructor decides that you've sufficiently mastered telling the gas- and brake pedal apart. It's time to practice the next thing: turning right.&lt;/p&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;Your program is provided an ASCII roadmap, with your starting position, direction and home marked. You should drive home in the minimum distance required.&lt;/p&gt;&#xA;&lt;p&gt;Your program must output route instructions for reaching your destination. The following instructions must be printed by your program whenever appropriate.&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;Items on the map will look like this. There are only horizontal and vertical roads. &lt;em&gt;(I'm open for suggestions on this one.)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;=&lt;/code&gt; – A horizontal road&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;|&lt;/code&gt; – A vertical road&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;#&lt;/code&gt; – A crossroad&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;gt;&lt;/code&gt; / &lt;code&gt;&amp;lt;&lt;/code&gt; / &lt;code&gt;^&lt;/code&gt; / &lt;code&gt;v&lt;/code&gt; – A one-way street&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;H&lt;/code&gt; – Your home&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;N&lt;/code&gt; / &lt;code&gt;E&lt;/code&gt; / &lt;code&gt;S&lt;/code&gt; / &lt;code&gt;W&lt;/code&gt; – Your starting point and direction (&lt;code&gt;N&lt;/code&gt;orth, &lt;code&gt;E&lt;/code&gt;ast etc. The  map is oriented north-up.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;A road segment (a signle character) is connected to another segment when:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It ends at an adjacent segment that has the same alignment. E.g.: &lt;code&gt;==&lt;/code&gt; or&lt;pre&gt;|&lt;br&gt;|&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;It ends at a segment with a different alignment (horizontal vs vertical). E.g.: &lt;code&gt;=|&lt;/code&gt;, &lt;code&gt;|=&lt;/code&gt;, &lt;pre&gt;=&lt;br&gt;|&lt;/pre&gt;or&lt;pre&gt;|&lt;br&gt;=&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;It ends at a crossroad. E.g.:&lt;pre&gt; |&lt;br&gt;=#=&lt;br&gt; |&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;It ends at a roundabout. E.g.:&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;pre&gt;&amp;nbsp;|&lt;br&gt;=O&lt;br&gt;&amp;nbsp;|&lt;/pre&gt;&#xA;&lt;p&gt;It is &lt;strong&gt;not&lt;/strong&gt; connected in (for example) these instances:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;pre&gt;|&lt;br&gt;&amp;nbsp;|&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;pre&gt;||&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;pre&gt;|&amp;nbsp;=&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Moving one position up, down, left and right all count as traveling the same distance.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;Turn right&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Go straight on&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Take the {1st/2nd/3rd} exit&lt;/code&gt; (at a roundabout)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You take roundabouts clockwise. Because of this, taking &lt;em&gt;any&lt;/em&gt; exit amounts to turning right.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each instruction must be on its own line.&lt;/li&gt;&#xA;&lt;li&gt;No other output is permitted.&lt;/li&gt;&#xA;&lt;li&gt;Your program may take no longer than a minute to run on an average home user’s computer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden, unless specified otherwise.&lt;/p&gt;&#xA;&lt;p&gt;This is code golf. The shortest answer wins.&lt;hr&gt;This is an early draft. Input is welcome, especially on the feasibility of requiring the shortest possible route, if this should be code golf, how input should be generated (randomly but the same for all programs? A few predefined maps?) and any improvements for the challenge. Any constructive feedback is welcome, even if it's just about spelling and grammar errors.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="13486" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-08-27T18:31:33.060" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5813" PostTypeId="2" ParentId="5139" CreationDate="2015-08-27T11:17:43.730" Score="1" Body="&lt;h2&gt;This answer can be used for experimenting with Martin's snippet. You may edit this to your own desire&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script&amp;gt;var QUESTION_ID=99026,OVERRIDE_USER=0;&amp;lt;/script&amp;gt;&amp;lt;style&amp;gt;body{text-align:left!important}#answer-list{padding:10px;float:left}#language-list{padding:10px;float:left}table thead{font-weight:700}table td{padding:5px}&amp;lt;/style&amp;gt;&amp;lt;script src=&quot;https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&amp;lt;script&amp;gt;var ANSWER_FILTER=&quot;!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe&quot;,COMMENT_FILTER=&quot;!)Q2B_A2kjfAiU78X(md6BoYk&quot;,answers=[],answers_hash,answer_ids,answer_page=1,more_answers=!0,comment_page;function answersUrl(d){return&quot;https://api.stackexchange.com/2.2/questions/&quot;+QUESTION_ID+&quot;/answers?page=&quot;+d+&quot;&amp;amp;pagesize=100&amp;amp;order=desc&amp;amp;sort=creation&amp;amp;site=codegolf&amp;amp;filter=&quot;+ANSWER_FILTER}function commentUrl(d,e){return&quot;https://api.stackexchange.com/2.2/answers/&quot;+e.join(&quot;;&quot;)+&quot;/comments?page=&quot;+d+&quot;&amp;amp;pagesize=100&amp;amp;order=desc&amp;amp;sort=creation&amp;amp;site=codegolf&amp;amp;filter=&quot;+COMMENT_FILTER}function getAnswers(){jQuery.ajax({url:answersUrl(answer_page++),method:&quot;get&quot;,dataType:&quot;jsonp&quot;,crossDomain:!0,success:function(d){answers.push.apply(answers,d.items),answers_hash=[],answer_ids=[],d.items.forEach(function(e){e.comments=[];var f=+e.share_link.match(/\d+/);answer_ids.push(f),answers_hash[f]=e}),d.has_more||(more_answers=!1),comment_page=1,getComments()}})}function getComments(){jQuery.ajax({url:commentUrl(comment_page++,answer_ids),method:&quot;get&quot;,dataType:&quot;jsonp&quot;,crossDomain:!0,success:function(d){d.items.forEach(function(e){e.owner.user_id===OVERRIDE_USER&amp;amp;&amp;amp;answers_hash[e.post_id].comments.push(e)}),d.has_more?getComments():more_answers?getAnswers():process()}})}getAnswers();var SCORE_REG=function(){var d=String.raw`h\d`,e=String.raw`\-?\d+\.?\d*`,f=String.raw`[^\n&amp;lt;&amp;gt;]*`,g=String.raw`&amp;lt;s&amp;gt;${f}&amp;lt;/s&amp;gt;|&amp;lt;strike&amp;gt;${f}&amp;lt;/strike&amp;gt;|&amp;lt;del&amp;gt;${f}&amp;lt;/del&amp;gt;`,h=String.raw`[^\n\d&amp;lt;&amp;gt;]*`,j=String.raw`&amp;lt;[^\n&amp;lt;&amp;gt;]+&amp;gt;`;return new RegExp(String.raw`&amp;lt;${d}&amp;gt;`+String.raw`\s*([^\n,]*[^\s,]),.*?`+String.raw`(${e})`+String.raw`(?=`+String.raw`${h}`+String.raw`(?:(?:${g}|${j})${h})*`+String.raw`&amp;lt;/${d}&amp;gt;`+String.raw`)`)}(),OVERRIDE_REG=/^Override\s*header:\s*/i;function getAuthorName(d){return d.owner.display_name}function process(){var d=[];answers.forEach(function(n){var o=n.body;n.comments.forEach(function(q){OVERRIDE_REG.test(q.body)&amp;amp;&amp;amp;(o=&quot;&amp;lt;h1&amp;gt;&quot;+q.body.replace(OVERRIDE_REG,&quot;&quot;)+&quot;&amp;lt;/h1&amp;gt;&quot;)});var p=o.match(SCORE_REG);p&amp;amp;&amp;amp;d.push({user:getAuthorName(n),size:+p[2],language:p[1],link:n.share_link})}),d.sort(function(n,o){var p=n.size,q=o.size;return p-q});var e={},f=1,g=null,h=1;d.forEach(function(n){n.size!=g&amp;amp;&amp;amp;(h=f),g=n.size,++f;var o=jQuery(&quot;#answer-template&quot;).html();o=o.replace(&quot;{{PLACE}}&quot;,h+&quot;.&quot;).replace(&quot;{{NAME}}&quot;,n.user).replace(&quot;{{LANGUAGE}}&quot;,n.language).replace(&quot;{{SIZE}}&quot;,n.size).replace(&quot;{{LINK}}&quot;,n.link),o=jQuery(o),jQuery(&quot;#answers&quot;).append(o);var p=n.language;p=jQuery(&quot;&amp;lt;i&amp;gt;&quot;+n.language+&quot;&amp;lt;/i&amp;gt;&quot;).text().toLowerCase(),e[p]=e[p]||{lang:n.language,user:n.user,size:n.size,link:n.link,uniq:p}});var j=[];for(var k in e)e.hasOwnProperty(k)&amp;amp;&amp;amp;j.push(e[k]);j.sort(function(n,o){return n.uniq&amp;gt;o.uniq?1:n.uniq&amp;lt;o.uniq?-1:0});for(var l=0;l&amp;lt;j.length;++l){var m=jQuery(&quot;#language-template&quot;).html(),k=j[l];m=m.replace(&quot;{{LANGUAGE}}&quot;,k.lang).replace(&quot;{{NAME}}&quot;,k.user).replace(&quot;{{SIZE}}&quot;,k.size).replace(&quot;{{LINK}}&quot;,k.link),m=jQuery(m),jQuery(&quot;#languages&quot;).append(m)}}&amp;lt;/script&amp;gt;&amp;lt;link rel=&quot;stylesheet&quot; type=&quot;text/css&quot; href=&quot;https://cdn.sstatic.net/Sites/codegolf/primary.css?v=f52df912b654&quot;&amp;gt; &amp;lt;div id=&quot;language-list&quot;&amp;gt; &amp;lt;h2&amp;gt;Winners by Language&amp;lt;/h2&amp;gt; &amp;lt;table class=&quot;language-list&quot;&amp;gt; &amp;lt;thead&amp;gt; &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;Language&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;User&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Score&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/thead&amp;gt; &amp;lt;tbody id=&quot;languages&quot;&amp;gt; &amp;lt;/tbody&amp;gt; &amp;lt;/table&amp;gt; &amp;lt;/div&amp;gt;&amp;lt;div id=&quot;answer-list&quot;&amp;gt; &amp;lt;h2&amp;gt;Leaderboard&amp;lt;/h2&amp;gt; &amp;lt;table class=&quot;answer-list&quot;&amp;gt; &amp;lt;thead&amp;gt; &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Author&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Language&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Size&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/thead&amp;gt; &amp;lt;tbody id=&quot;answers&quot;&amp;gt; &amp;lt;/tbody&amp;gt; &amp;lt;/table&amp;gt; &amp;lt;/div&amp;gt;&amp;lt;table style=&quot;display: none&quot;&amp;gt; &amp;lt;tbody id=&quot;answer-template&quot;&amp;gt; &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;{{PLACE}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{NAME}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{LANGUAGE}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;{{LINK}}&quot;&amp;gt;{{SIZE}}&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/tbody&amp;gt; &amp;lt;/table&amp;gt; &amp;lt;table style=&quot;display: none&quot;&amp;gt; &amp;lt;tbody id=&quot;language-template&quot;&amp;gt; &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;{{LANGUAGE}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{NAME}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;{{LINK}}&quot;&amp;gt;{{SIZE}}&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/tbody&amp;gt; &amp;lt;/table&amp;gt; &lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="69850" LastEditDate="2018-06-01T11:02:24.593" LastActivityDate="2018-06-01T11:02:24.593" CommentCount="0" CommunityOwnedDate="2015-08-28T14:56:04.293" ContentLicense="CC BY-SA 4.0" />
  <row Id="5814" PostTypeId="2" ParentId="2140" CreationDate="2015-08-27T15:57:00.720" Score="2" Body="&lt;h1&gt;Write a Foo-immune program&lt;/h1&gt;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/54807/the-programming-language-quiz&quot;&gt;The Programming Language Quiz&lt;/a&gt;, Foo has quickly become &lt;a href=&quot;https://codegolf.stackexchange.com/a/54891/21009&quot;&gt;one&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/54883/21009&quot;&gt;of&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/54980/21009&quot;&gt;the&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/55248/21009&quot;&gt;most&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/55346/21009&quot;&gt;annoying&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/55349/21009&quot;&gt;languages&lt;/a&gt;. Ever. Various people have started to &amp;quot;&lt;a href=&quot;https://codegolf.stackexchange.com/a/55178/21009&quot;&gt;immunize&lt;/a&gt;&amp;quot; &lt;a href=&quot;https://codegolf.stackexchange.com/a/54995/21009&quot;&gt;their&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/55353/21009&quot;&gt;code&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/54956/21009&quot;&gt;to&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/55288/21009&quot;&gt;avoid&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/55352/21009&quot;&gt;it&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/55009/21009&quot;&gt;being&lt;/a&gt; valid Foo.&lt;/p&gt;&#xA;&lt;p&gt;Now, here's the challenge. You need to write a polyglot. A polyglot that appears to work in Foo but does something totally different versus the intended language. For instance:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a=(1)&#xA;print &amp;quot;Hello, World!&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;would appear to work in Foo, but it actually loops indefinitely (the &lt;code&gt;(1)&lt;/code&gt;). In Python (the intended language), it prints &lt;code&gt;Hello, World!&lt;/code&gt; (if that wasn't already obvious :).&lt;/p&gt;&#xA;&lt;h1&gt;Rules:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may not just rely on &lt;em&gt;just&lt;/em&gt; Foo's printing of string literals, which means snippets like &lt;code&gt;print &amp;quot;HHello, World!&amp;quot;[1:]&lt;/code&gt; are invalid. You have to put something else, too.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Your program may not print any error messages when run in Foo.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Try not to be boring. This is a popularity contest, after all!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="21009" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-08-27T15:57:00.720" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5815" PostTypeId="2" ParentId="2140" CreationDate="2015-08-27T17:50:25.913" Score="1" Body="&lt;h1&gt;Golf a game of Nim&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Similar to my previous &lt;a href=&quot;https://codegolf.stackexchange.com/q/48388/38891&quot; title=&quot;Link to the question&quot;&gt;Write the shortest game of Alak&lt;/a&gt; challenge, this time you have to golf another simple game - &lt;a href=&quot;https://en.wikipedia.org/wiki/Nim&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Wikipedia page&quot;&gt;Nim&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may already know how to play, but if you don't, here are the rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In Nim, two players take turns removing objects from heaps (piles).&lt;/li&gt;&#xA;&lt;li&gt;Each turn, one player removes at least one object from any heap.&lt;/li&gt;&#xA;&lt;li&gt;You can take as many objects as you want, provided they all come from the same heap.&lt;/li&gt;&#xA;&lt;li&gt;You can take from any heap you want, but you can't take objects from two different heaps in the same move.&lt;/li&gt;&#xA;&lt;li&gt;The player to take the last piece(s) wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There are 3 heaps, each starting out with a random number of objects between 2 and 20.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input is in the form of two numbers - a heap number and the number of objects to take from that heap.&lt;br&gt;&#xA;For example, the input &lt;code&gt;1 2&lt;/code&gt; means &quot;take 2 objects from heap #1&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every turn, the program must print to STDOUT (or your language's closest alternative) the amount of objects in each heap. (This includes at the start of the game.)&lt;br&gt;&#xA;For example, if there were 5 objects in heap #1, 2 objects in heap #2, and 0 objects in heap #3, you would output this:&lt;br&gt;&#xA;&lt;code&gt;5 2 0&lt;/code&gt;&lt;br&gt;&#xA;When one player wins by taking the last piece(s), you have to output &lt;code&gt;P# wins&lt;/code&gt; and end the game, where # is the number of the player who won (1 or 2.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Assumptions&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input will always be in the form of &lt;code&gt;Heap# Amount&lt;/code&gt;. Any invalid input can be handled however you like.&lt;/li&gt;&#xA;&lt;li&gt;The input will never ask to take from a heap that doesn't exist, or take more objects than a heap contains.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Questions for Meta&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are there any loopholes?&lt;/li&gt;&#xA;&lt;li&gt;Should the sizes of each heap be set, rather than random?&lt;/li&gt;&#xA;&lt;li&gt;Should there be a random number of heaps?&lt;/li&gt;&#xA;&lt;li&gt;Should programs have to handle taking objects from non-existent heaps, or more objects that a heap has?&lt;/li&gt;&#xA;&lt;li&gt;I'm 99% certain I've covered everything, but have I left out any rules of Nim?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="38891" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:21.033" LastActivityDate="2015-10-01T17:28:11.650" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5817" PostTypeId="2" ParentId="2140" CreationDate="2015-08-27T21:21:11.253" Score="2" Body="&lt;h2&gt;Invert the Fundamental Transformation on permutations &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Permutation&quot; rel=&quot;nofollow noreferrer&quot;&gt;permutation&lt;/a&gt; like &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[3, 5, 1, 2, 4, 6]&#xA;1-&amp;gt;3, 2-&amp;gt;5, 3-&amp;gt;1, 4-&amp;gt;2, 5-&amp;gt;4, 6-&amp;gt;6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;can be decomposed into cycles&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(3, 1) (5, 4, 2) (6)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There's many ways to write these cycles, but we can fix a &lt;a href=&quot;https://en.wikipedia.org/wiki/Permutation#Canonical_cycle_notation_.28aka_standard_form.29&quot; rel=&quot;nofollow noreferrer&quot;&gt;canonical form&lt;/a&gt; by requiring that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In each cycle, the greatest element is written first.&lt;/li&gt;&#xA;&lt;li&gt;The cycles are sorted in increasing order of greatest element.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In this form, we don't even need parentheses to demarcate the cycles. Just from the list of numbers&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3, 1, 5, 4, 2, 6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;we can infer that the cycles starts at the numbers that are greater than any to their left.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 3, 1, 5, 4, 2, 6&#xA; *     *        *&#xA;(3, 1)(5, 4, 2)(6)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;From here, the original permutation &lt;code&gt;[3, 5, 1, 2, 4, 6]&lt;/code&gt; can be uniquely recovered, and your task is to write code that performs this recovery.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; A list of &lt;code&gt;n&lt;/code&gt; distinct numbers &lt;code&gt;1&lt;/code&gt; through &lt;code&gt;n&lt;/code&gt;. Optionally, the value &lt;code&gt;n&lt;/code&gt; itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;: The permutation &lt;code&gt;f&lt;/code&gt; that produces that canonical form cycle list,  listed or printed as &lt;code&gt;[f(1), f(2), ..., f(n)]&lt;/code&gt;. Format is up to you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may optionally work with 0-indexed values &lt;code&gt;0 ... n-1&lt;/code&gt; instead of &lt;code&gt;1 ... n&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2015-08-30T00:12:40.090" LastActivityDate="2015-08-30T00:12:40.090" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5822" PostTypeId="1" AcceptedAnswerId="5823" CreationDate="2015-08-29T10:08:05.083" Score="7" ViewCount="243" Body="&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Inform#Example_game_2&quot; rel=&quot;nofollow noreferrer&quot;&gt;Inform 7&lt;/a&gt; is a language for creating interactive fiction whose syntax approximates natural language. It is so verbose that it will almost never be a good choice for golfing, but its verbosity is its own challenge, and it can still be fun to enter it in some challenges, such as the recent &lt;a href=&quot;https://codegolf.stackexchange.com/a/55598/11949&quot;&gt;Hello, World! challenge&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;X is room.To Q:(-quit;-).After starting the virtual machine:say &quot;Hello, World!&quot;;Q&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now Inform 7 will always be handicapped in such challenges, but it has a particular flaw which I want to ask about. Inform 7 uses a large standard library which controls the Main function; answers on this site would need to choose a hook to add their code to. The problem is that by the time your chosen hook has run a large amount of code has already been run, some of which prints some line breaks causing the challenge entries to be invalid. For example, the following code uses the shortest hook name, but by that point the library will have already printed three blank lines:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;X is room.To Q:(-quit;-).Startup:say &quot;Hello, World!&quot;;Q&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The &quot;After starting the virtual machine&quot; hook is run much earlier, but even by the time it has run one line break has been printed. (I haven't been able to discover its cause yet.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I would like to ask the community whether they think it would be acceptable to create a golfing library for Inform 7. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/435/11949&quot;&gt;Previous discussions&lt;/a&gt; seem to indicate that libraries are okay if they are written before a challenge is posted, but that if they alias lots of function names then they're &lt;em&gt;not cool&lt;/em&gt;. Well the library I have in mind would not alias any of Inform 7's functions, all it would do is create a consistent and reliable hook at a point in time where nothing has yet been output, and then close up shop afterwards. The library's inclusion in entries would of course count for the code length. It would allow the Hello, World! challenge to be shortened to:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Include C by G.Z:say &quot;Hello, World!&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Edit: &lt;a href=&quot;https://raw.githubusercontent.com/i7/extensions/master/Dannii%20Willis/C.i7x&quot; rel=&quot;nofollow noreferrer&quot;&gt;I have written the extension.&lt;/a&gt; It gives you short cuts to getting input, but nothing more.&lt;/p&gt;&#xA;" OwnerUserId="11949" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-08-29T13:56:22.397" Title="Golfing Inform 7" Tags="|discussion|policy|code-golf|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5823" PostTypeId="2" ParentId="5822" CreationDate="2015-08-29T10:12:57.447" Score="3" Body="&lt;p&gt;Yes, that's totally fine. I think writing shorthand libraries or even languages has become much more accepted with things like Pyth (started out as shorthand for Python) or golflua.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So you could even create a new language which compiles to Inform 7, in which case you wouldn't even need the include.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Whether this is &lt;em&gt;necessary&lt;/em&gt; is a different question. I feel like even a shorthand for Inform 7 would not exactly be competitive compared with Pyth, CJam etc. And golfing the shorthand will probably not be much different from golfing Inform 7 itself, so you could just use Inform 7 as it is and try to be as short as possible within the constraints of the language. For many languages except the shortest of the short, code golf is more a competition within the language (and maybe with languages of similar verbosity) than trying to win the overall challenge.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-08-29T10:12:57.447" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5826" PostTypeId="2" ParentId="2140" CreationDate="2015-08-30T02:12:34.413" Score="1" Body="&lt;h1&gt;Triple Triad Tournament! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(anything in italic parenthesis is a note for the sandbox)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;About Triple Triad&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Triple Triad is a card game from the Final Fantasy series. I've never played a FF game that included it, though, so I'm only familiar with &lt;a href=&quot;http://wiki.p-insurgence.com/Triple_Triad&quot; rel=&quot;nofollow noreferrer&quot;&gt;the version&lt;/a&gt; in the Pokémon fangame &lt;em&gt;Pokémon Insurgence&lt;/em&gt;. It may or may not be different than the original version, so apologies in advance if this isn't quite what you're expecting. :)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In Triple Triad, each card has 4 numerical stats that range from 1 to 10*: An &quot;up&quot; value, a &quot;left&quot; value, a &quot;right&quot; value, and a &quot;down&quot; value. Here's an example of a card with an &quot;up&quot; value of 1, a &quot;left&quot; value of 6, a &quot;right&quot; value of 3 and a &quot;down&quot; value of 2:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/4jteH.png&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Triple Triad Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;At the beginning of each game, players construct a &quot;deck&quot; of five cards, chosen from their entire collection. These cards are kept secret from the other player.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Triple Triad is played on a 3x3 grid. Players take turns choosing a card from their deck and placing it on an empty square of the grid. The goal of the game is to control the majority of the cards when the grid is filled. When the game is complete, one card is randomly selected from the loser's deck and given to the winner.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Control&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;When a card is placed on the grid, it is controlled by its owner. In order to come out of the game victorious, you must gain control of cards that the opponent played.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To gain control of an opponent's card, you must place a card of your own that &quot;beats&quot; it adjacent (not including diagonals) to the card you want to take control of. Whether or not your card beats the opponent's depends on their stats and which side you place your card on. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Imagine this board as the current game state and the blue card as a card in my deck:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/bG648.png&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I want to take control of the opponent's Numel, I have to place my Mareep adjacent to it. This leaves only two options: The top middle square or the middle right square. If I were to place it on the top middle square, my card would be to the left of the opponent's. As a result, Mareep's &quot;right&quot; value of 2 would be contested against Numel's &quot;left&quot; value of 4. 2 is not greater than 4, so my opponent would retain control of Numel. Note that my value must be strictly greater; a tie would be the same as a loss.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I were to place my card in the middle right corner, it would be below the opponent's card. As a result, Mareep's &quot;up&quot; value of 4 would be contested against Numel's &quot;down&quot; value of 3. 4 is greater than 3, so I would gain control of Numel (which would turn blue to indicate that).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This process is applied in all four directions at once. If there was a card below Mareep with an &quot;up&quot; value of 1 or 2, I would gain control of it as well. However, gaining control is not done passively or recursively. Control can only be contested at the exact moment a card is placed, and gaining control of a card does not count as &quot;placing it&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Tournament Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each bot is given a budget of &lt;img src=&quot;https://i.stack.imgur.com/QTn9I.png&quot; alt=&quot;&quot;&gt;&lt;em&gt;(TBD)&lt;/em&gt; with which to purchase cards before the tournament (this will be done by the author, not the bot itself, and will be hardcoded into the bot). Here are the cards, along with their costs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;There - 1000&#xA; will - 1500&#xA;   be - 1500&#xA;    a - 2500&#xA; list - 3000&#xA; here - 4000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The bots will play in a Round Robin tournament with Bo3 matches &lt;em&gt;(subject to change. not sure if round robin will work well or if i should be using Bo5 or what)&lt;/em&gt;. The bot that wins the most matches will be declared the winner.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Match Procedure&lt;/h3&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Each bot chooses 5 cards from their collection to create a deck. (If they have less than five cards, they forfeit the match.)&lt;/li&gt;&#xA;&lt;li&gt;The game is played as described above, until the board is filled. &lt;em&gt;(i'm not sure how to decide who should go first. alternate? winner of the last game? loser?)&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;When the game is complete, a random card from the loser's deck is removed from their collection and inserted into the winner's collection. (At the end of the match, each bot's collection is reset to its original state.) &lt;em&gt;(i'm not totally sure about choosing a random card. it's how the original game works, but it's not necessarily 100% fair. the idea is that over the course of a round robin tournament, any RNG variance will be smoothed out, but i don't know...)&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;Repeat steps 1 through 3 until one bot has won 2 games.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Input / Output Specifications and Controller Details&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(none yet lmao)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;* The &lt;em&gt;Insurgence&lt;/em&gt; variant has some nonsense regarding Pokémon types at higher difficulty levels, but this challenge will ignore that.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="14509" LastActivityDate="2015-08-30T02:12:34.413" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5837" PostTypeId="2" ParentId="2140" CreationDate="2015-08-31T03:14:20.633" Score="0" Body="&lt;h1&gt;Arranging Matrices&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; (doesn't actually require any matrix math)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While doing homework on matrix multiplication, I realized that I could avoid rewriting all of the matrices by arranging them intelligently on the page.   If the problems were:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A * B = C&#xA;A * D = E&#xA;F * D = G&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I could arrange the matrices like so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; BD&#xA;ACE&#xA; FG&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This arrangement satisfies the requirement that each product (&lt;code&gt;C E G&lt;/code&gt;) have the correct factors in the correct directions.  For example, the &lt;code&gt;A * D = E&lt;/code&gt; so &lt;code&gt;E&lt;/code&gt; is to the right of &lt;code&gt;A&lt;/code&gt; and below &lt;code&gt;D&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is, given a list of multiplication problems (in the same format as above), output an arrangement of them that involves the fewest letters (the above solution has 7, the minimum).&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2015-08-31T03:14:20.633" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5842" PostTypeId="1" CreationDate="2015-08-31T10:19:28.327" Score="18" ViewCount="720" Body="&lt;p&gt;There are a lot of intelligent people on PPCG, and for that reason a lot of our usual challenges are &lt;em&gt;hard&lt;/em&gt;. This means that we are throwing new users straight into the deep end with huge problems which they may not be able to solve.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, we need a way of getting new users used to the way PPCG works, and how to correctly write programs which answer the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may post any other suggestions for the tutorial.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="30525" LastEditDate="2016-08-21T10:37:11.143" LastActivityDate="2016-08-21T10:37:11.143" Title="Code Golf Tutorials?" Tags="|discussion|code-golf|" AnswerCount="4" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="5846" PostTypeId="1" CreationDate="2015-08-31T15:28:54.643" Score="52" ViewCount="966" Body="&lt;p&gt;We've got some big news today! What is &lt;em&gt;with&lt;/em&gt; the &quot;s&quot; in the title? I'm very happy to announce that the community team has appointed &lt;em&gt;two&lt;/em&gt; new moderators pro tempore. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5744/8478&quot;&gt;You've cast your votes&lt;/a&gt;, so let me welcome both &lt;strong&gt;Dennis&lt;/strong&gt; and &lt;strong&gt;Alex A.&lt;/strong&gt; to the mod team!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/&quot;&gt;&#xA;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/12012.png&quot; width=&quot;208&quot; height=&quot;58&quot; alt=&quot;profile for Dennis at Programming Puzzles &amp;amp; Code Golf Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot; title=&quot;profile for Dennis at Programming Puzzles &amp;amp; Code Golf Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot;&gt;&#xA;&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/12012/&quot;&gt;&#xA;&lt;img src=&quot;https://codegolf.meta.stackexchange.com/users/flair/12012.png&quot; width=&quot;208&quot; height=&quot;58&quot; alt=&quot;profile for Dennis at Programming Puzzles &amp;amp; Code Golf Meta Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot; title=&quot;profile for Dennis at Programming Puzzles &amp;amp; Code Golf Meta Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot;&gt;&#xA;&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/users/20469/&quot;&gt;&#xA;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/20469.png&quot; width=&quot;208&quot; height=&quot;58&quot; alt=&quot;profile for Alex A. at Programming Puzzles &amp;amp; Code Golf Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot; title=&quot;profile for Alex A. at Programming Puzzles &amp;amp; Code Golf Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot;&gt;&#xA;&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/20469/&quot;&gt;&#xA;&lt;img src=&quot;https://codegolf.meta.stackexchange.com/users/flair/20469.png&quot; width=&quot;208&quot; height=&quot;58&quot; alt=&quot;profile for Alex A. at Programming Puzzles &amp;amp; Code Golf Meta Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot; title=&quot;profile for Alex A. at Programming Puzzles &amp;amp; Code Golf Meta Stack Exchange, Q&amp;amp;A for programming puzzle enthusiasts and code golfers&quot;&gt;&#xA;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;They've both been exceptional users and exceptionally friendly and I'm sure they'll both make great moderators. Welcome Dennis and Alex!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please also join me in well-wishing &lt;a href=&quot;https://codegolf.stackexchange.com/users/78/dmckee&quot;&gt;dmckee&lt;/a&gt;, who is stepping down after 4.5 years of service to this community. He has done some great work for this site, including &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;naming our beloved Nineteenth Byte&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2017-03-27T19:03:54.023" Title="A heartfelt welcome to our new moderator...s!" Tags="|discussion|moderators|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5847" PostTypeId="2" ParentId="5846" CreationDate="2015-08-31T16:23:28.880" Score="49" Body="&lt;p&gt;I just want to take a moment to say&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;THANK YOU!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Yes you! Thank &lt;em&gt;you&lt;/em&gt; specifically. If you're reading this, I thank you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm absolutely honored to be a moderator for this wonderful, quirky community and I'll do everything I can to serve it. PPCG is a very special place. Thank you all so much for your kindness and support, it means more to me than you can imagine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an aside, in case you're feeling duped, like information had been withheld from you, I didn't know about this until last Friday. Stack Exchange contacted me and asked if I'd like to be a mod for PPCG, which thoroughly confused me given that Dennis won our informal election by popular vote, but here we are on Monday and Dennis and I both have diamonds. A special thank you to the Stack Exchange team.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&amp;lt;3&lt;/h1&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2015-08-31T16:23:28.880" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5848" PostTypeId="2" ParentId="5842" CreationDate="2015-08-31T18:47:06.607" Score="13" Body="&lt;h1&gt;Beginner's directory&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;What you have is a meta post or (as Martin suggests, a Medium publication) which contains a list of basic challenges sorted from easy to hard. This is mainly for new users to try out golfing and see if they can get their program as short as the answers already posted. This is &lt;em&gt;not necessarily for the new users to post an answer&lt;/em&gt;, but they may if they wish.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the obvious choice would be to begin the list with Martin Büttner's &quot;Hello, World!&quot; challenge. The next could be my &quot;Compare two numbers&quot; challenge and so on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is to help new users to become familiar with writing answers to questions on PPCG.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="30525" LastEditDate="2015-08-31T18:57:59.830" LastActivityDate="2015-08-31T18:57:59.830" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5851" PostTypeId="1" AcceptedAnswerId="5852" CreationDate="2015-09-01T03:53:31.213" Score="16" ViewCount="567" Body="&lt;p&gt;For example, in a c++ submission, this is valid if you use g++&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#include &amp;lt;iostream&amp;gt;&#xA;main()&#xA;{&#xA;    std::cout &amp;lt;&amp;lt; &quot;Hello world!&quot;;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;but in any other compiler, this would not compile because of the missing &quot;int&quot; keyword.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2018-04-13T01:21:02.370" Title="Are compiler-specific submissions allowed?" Tags="|discussion|code-golf|rules|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5852" PostTypeId="2" ParentId="5851" CreationDate="2015-09-01T04:24:17.027" Score="28" Body="&lt;h1&gt;Yes, on PPCG a language is defined by its implementation.&lt;/h1&gt;&#xA;&lt;p&gt;In case your program is not portable you should specify the interpreter or compiler.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-09-01T04:24:17.027" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5861" PostTypeId="2" ParentId="2140" CreationDate="2015-09-01T22:11:17.617" Score="1" Body="&lt;h1&gt;Sudoku with handicap&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; I've completely reworked this, as the comments convinced me that there's not a good way to describe the restrictions I originally was after in a language-independent way without unreasonably restricting languages. Thanks to all the commenters.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;I now reworked the question in a way that also inhibits traditional recursive solving (at least doing so in a straightforward way), and at the same time even allows to add a metrics about the &quot;efficiency&quot; of the algorithm. The basic idea being that your program is called not once, but many times, each time only having limited information about the field.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Also note that this new version requires me to write a driver program; so the question cannot go live until the driver program is written.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Questions are set in italics inside the text&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal of this challenge is to solve a given Sudoku. However there's a twist:  The program cannot access the full board at any time. Instead it is called repeatedly, and each time it has only limited information about the board. I'll refer to the totality of all calls as the &quot;calling loop&quot;. The program can then request different information for the next run, or declare that it is finished (that is, request to not be called again; the call loop is terminated).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The only way to pass information between different runs is through the Sudoku board, and a small amount of scratch space. The Sudoku board is initialized before the first call with the Sudoku to solve (obviously) and is then checked after the call loop terminated. During the call loop, the Sudoku board is not checked, so you may &quot;abuse&quot; it to store additional information, as long as at the end, a valid result is generated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since it may not be possible to completely solve all Sudokus using such an algorithm, the only hard requirement is that the call loop is guaranteed to eventually terminate, the Sudoku field after termination is in a valid state. The rest is covered by scoring.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard loopholes are explicitly disallowed.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The stored data&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The data that is stored outside the program consists of 90 nine-it unsigned numerical values (that is, minimal nmumber 0, maximal number 511), 81 of which represent the Sudoku field, and 9 values are scratch space. The values of the field are interpreted as bit fields, as described below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the following I'll use as example the Sudoku field&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4.5|.7.|89.&#xA;..2|.5.|6..&#xA;..7|9..|542&#xA;---+---+---&#xA;..3|5.6|489&#xA;...|3.8|...&#xA;684|7.9|1..&#xA;---+---+---&#xA;238|..5|9..&#xA;..6|.9.|3..&#xA;.79|.3.|2.1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where dots contain fields that have not been filled.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Initially, the data gets filled as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Each field pre-filled with number $n$ is represented by the value $2^{n-1}$, that is, the bit corresponding to that number is set, and all other bits are unset.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The unfilled fields are represented by the value $511$ (that is, all nine bits are set).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The scratch space is filled with $0$.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;After the run loop terminates, each pre-filled field needs to have the same value as initially, and each initially empty field must have &lt;em&gt;at least&lt;/em&gt; the bit corresponding to the correct solution set. That is, every zero bit represents a value that your program excluded for that field, and a program that excludes the correct solution is disqualified.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The contents of the field is only evaluated at the end of the call loop. So in between your program is free to make creative use of the storage space given.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The program receives its data through standard input of the following form:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first line contains a description of which data is given to/set by the program in this run. It consists of one to three space-separated words from the following list. On the first run, it is just &quot;S&quot;. At later runs, it is exactly what the program requested at its previous run.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The possible values and corresponding interpretation are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;R1&lt;/code&gt; to &lt;code&gt;R9&lt;/code&gt;: The indicated row of the Sudoku, &lt;code&gt;1&lt;/code&gt; being the uppermost row.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;C1&lt;/code&gt; to &lt;code&gt;C9&lt;/code&gt;: The indicated column of the Sudoku, &lt;code&gt;1&lt;/code&gt; being the leftmost column.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;F1&lt;/code&gt; to &lt;code&gt;F9&lt;/code&gt;: The indicated $3\times 3$ subfield of the Sudoku, numbered left to right, up to down. So for example &lt;code&gt;1&lt;/code&gt; denotes the upper left subfield, &lt;code&gt;6&lt;/code&gt; denotes the middle right subfield.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;S&lt;/code&gt;: The scratch space.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The next one to three lines contain the corresponding data, from left to right, and from up to down, as space separated decimal numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So at the first run, your program will receive the input&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;S&#xA;0 0 0 0 0 0 0 0 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;At the second run with the example Sudoku field, the input to your program might be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;R2 C3 F4&#xA;511 511 2 511 16 511 32 511 511&#xA;16 2 64 4 511 8 128 32 256&#xA;511 511 4 511 511 511 32 128 8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The first one to three lines are the new values to replace the ones given in the input. The number of the lines must be the same as the number of fields in the first input line, and each line must contain nine values separated by whitespace (leading/trailing whitespace gets ignored).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If some field appears in more than one data line, the corresponding values are bitwise anded together. For example, if the initial line of your program's input was&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;R1 C1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and the first two line of your output read (with question marks replacing values that are irrelevant for this example — of course your code may not actually output question marks here)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3 ? ? ? ? ? ? ? ?&#xA;5 ? ? ? ? ? ? ? ?&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;then the upper left value us the Sudoku storage field will be &lt;code&gt;3 &amp;amp; 5&lt;/code&gt;, that is, &lt;code&gt;1&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Following those data lines, there will be a single line containing either the single word &lt;code&gt;STOP&lt;/code&gt;, in which case the run loop is terminated and the resulting field is created, or a line containing one to three whitespace separated words requesting data to be served in the next run, that is, the words to be presented in the first line of the next run of the program.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The score for qualifying entries is calculated as follows (lower score is better):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You get 1 score point for each run of your program.&lt;/li&gt;&#xA;&lt;li&gt;You get 5 score points for each set bit in the final representation of your Sudoku field&lt;/li&gt;&#xA;&lt;li&gt;At the end, subtract 45 (because a perfectly solved Sudoku will have nine bits set; if your program leaves less bits set, it will be disqualified anyway).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The total score is then calculated as weighted mean of the test cases, where the difficulty is used as weight, rounded up to the next integer. That is, if $d_k$ is the difficulty assigned to test case $k$, and $S_k$ is the score you achieved at test case $k$, your total score is&#xA;$$S = \left\lceil \frac{\sum_k d_k S_k}{\sum_k d_k}\right\rceil$$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Sandbox question: Should I change the relative weight of program runs versus unsolved fields? And is the difficulty weighting a good idea, or should I simply add up all scores?&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(Hardness as reported by GNOME Sudoku)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test case 1:&lt;/strong&gt; Easy (0.17)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4.5|.7.|89.&#xA;..2|.5.|6..&#xA;..7|9..|542&#xA;---+---+---&#xA;..3|5.6|489&#xA;...|3.8|...&#xA;684|7.9|1..&#xA;---+---+---&#xA;238|..5|9..&#xA;..6|.9.|3..&#xA;.79|.3.|2.1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Solution:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;415|672|893&#xA;892|453|617&#xA;367|981|542&#xA;---+---+---&#xA;723|516|489&#xA;951|348|726&#xA;684|729|135&#xA;---+---+---&#xA;238|165|974&#xA;146|297|358&#xA;579|834|261&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test case 2:&lt;/strong&gt; Hard (0.63)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.6.|52.|..8&#xA;7..|...|9.2&#xA;.82|71.|56.&#xA;---+---+---&#xA;.59|...|..6&#xA;.76|...|14.&#xA;8..|...|72.&#xA;---+---+---&#xA;.18|.36|25.&#xA;6.3|...|..1&#xA;5..|.41|.9.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Solution:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;961|524|378&#xA;745|683|912&#xA;382|719|564&#xA;---+---+---&#xA;159|472|836&#xA;276|398|145&#xA;834|165|729&#xA;---+---+---&#xA;418|936|257&#xA;693|257|481&#xA;527|841|693&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test case 3:&lt;/strong&gt; Very hard (0.96)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.35|.94|...&#xA;..8|.53|..9&#xA;4..|8..|...&#xA;---+---+---&#xA;..1|9..|.85&#xA;..9|1.5|3..&#xA;54.|..8|9..&#xA;---+---+---&#xA;...|..7|..1&#xA;6..|58.|7..&#xA;...|41.|82.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Solution&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;135|294|678&#xA;268|753|149&#xA;497|861|532&#xA;---+---+---&#xA;371|946|285&#xA;829|175|364&#xA;546|328|917&#xA;---+---+---&#xA;982|637|451&#xA;614|582|793&#xA;753|419|826&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Sandbox question: Should I add more test cases?&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="3681" LastEditorUserId="3681" LastEditDate="2015-10-11T13:12:30.780" LastActivityDate="2015-10-11T13:12:30.780" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="5866" PostTypeId="1" CreationDate="2015-09-03T00:53:02.397" Score="14" ViewCount="795" Body="&lt;p&gt;I think we should define once and for all what, unless specifically mentioned otherwise, we mean on this site when we say:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;ASCII&lt;/li&gt;&#xA;&lt;li&gt;Printable ASCII&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;There are many versions of (extended) ASCII, and I think we should have a default.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastActivityDate="2015-09-03T18:35:11.330" Title="What does (printable) ASCII mean?" Tags="|discussion|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5867" PostTypeId="2" ParentId="5866" CreationDate="2015-09-03T01:22:13.133" Score="-5" Body="&lt;p&gt;The definition of ASCII on this site should be the typical 7-bit ASCII, which contains 128 characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Printable ASCII includes the 95 characters found in &lt;a href=&quot;https://en.wikipedia.org/wiki/ASCII#ASCII_printable_code_chart&quot; rel=&quot;nofollow&quot;&gt;this chart&lt;/a&gt;, which are listed below:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; !&quot;#$%&amp;amp;'()*+,-./0123456789:;&amp;lt;=&amp;gt;?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For the purposes of this site we should include the line feed character (&lt;code&gt;\n&lt;/code&gt;) in this definition.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="2867" LastEditDate="2015-09-03T01:37:39.193" LastActivityDate="2015-09-03T01:37:39.193" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="5869" PostTypeId="2" ParentId="5866" CreationDate="2015-09-03T03:02:09.073" Score="26" Body="&lt;p&gt;ASCII characters are all Unicode characters with code points from 0x00 to 0x7F (both inclusive).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Printable&lt;/em&gt; ASCII characters all are Unicode characters with code points from 0x20 to 0x7E (both inclusive). This does &lt;strong&gt;not&lt;/strong&gt; include linefeeds.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is consistent with the definition of printable character as one that occupies a printing position. Linefeeds are control characters that move the cursor down (or the paper up) and thus do not satisfy the definition of printability.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While including linefeeds in the printable ASCII characters would be practical if everybody was familiar with our convention, it is non-standard and bound to cause confusion. The spec of a challenge should be as long as needed to explain all the details, and adding &lt;em&gt;and linefeeds&lt;/em&gt; doesn't make it a lot longer...&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2015-09-03T18:35:11.330" LastActivityDate="2015-09-03T18:35:11.330" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5870" PostTypeId="1" CreationDate="2015-09-03T07:27:04.027" Score="3" ViewCount="203" Body="&lt;p&gt;How do I insert links that contain encoded URLs without SE misunderstanding it as markdown?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;E.g.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;http://tryapl.org/?a=R%20L%20C%u21901%201%200.00001%20%u22C4%20%28%u22A2%F7+/%29R%28L%F7k%29%2CC%F7%u2368k%u21900J%AF0.01%F7%u25CB1&amp;amp;run&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;fails:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://tryapl.org/?a=R%20L%20C%25u21901%201%200.00001%20%25u22C4%20%28%25u22A2%F7%20/%29R%28L%F7k%29%2CC%F7%25u2368k%25u21900J%AF0.01%F7%25u25CB1&amp;amp;run&quot; rel=&quot;nofollow&quot;&gt;test&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2015-09-03T07:58:22.557" LastActivityDate="2016-03-31T11:36:26.667" Title="Encoded URL in links" Tags="|support|markdown|hyperlinks|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5871" PostTypeId="2" ParentId="5870" CreationDate="2015-09-03T07:36:19.377" Score="2" Body="&lt;p&gt;&lt;a href=&quot;http://tryapl.org/?a=R%20L%20C%u21901%201%200.00001%20%u22C4%20%28%u22A2%F7+/%29R%28L%F7k%29%2CC%F7%u2368k%u21900J%AF0.01%F7%u25CB1&amp;amp;run&quot; rel=&quot;nofollow&quot;&gt;Like this&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[Like this][1]&#xA;&#xA;  [1]: http://...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2015-09-03T07:36:19.377" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="5872" PostTypeId="2" ParentId="5870" CreationDate="2015-09-03T07:59:28.217" Score="1" Body="&lt;p&gt;Found a solution:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;a href=&quot;http://tryapl.org/?a=R%20L%20C%u21901%201%200.00001%20%u22C4%20%28%u22A2%F7+/%29R%28L%F7k%29%2CC%F7%u2368k%u21900J%AF0.01%F7%u25CB1&amp;amp;run&quot;&amp;gt;this&amp;lt;/a&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://tryapl.org/?a=R%20L%20C%u21901%201%200.00001%20%u22C4%20%28%u22A2%F7+/%29R%28L%F7k%29%2CC%F7%u2368k%u21900J%AF0.01%F7%u25CB1&amp;amp;run&quot; rel=&quot;nofollow&quot;&gt;test&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2015-09-03T07:59:28.217" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5873" PostTypeId="2" ParentId="5870" CreationDate="2015-09-03T08:07:09.180" Score="1" Body="&lt;p&gt;&lt;a href=&quot;http://tryapl.org/?a=R%20L%20C%u21901%201%200.00001%20%u22C4%20%28%u22A2%F7+/%29R%28L%F7k%29%2CC%F7%u2368k%u21900J%AF0.01%F7%u25CB1&amp;amp;run&quot; rel=&quot;nofollow&quot;&gt;What's not to work?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2015-09-03T08:07:09.180" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5874" PostTypeId="2" ParentId="5804" CreationDate="2015-09-03T08:41:57.420" Score="2" Body="&lt;h2&gt;Humor&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://xkcd.com/54/&quot; rel=&quot;nofollow&quot;&gt;Research&lt;/a&gt; has shown that the amount of humor in a post is positively correlated with the number of upvotes. &lt;a href=&quot;https://xkcd.com/552/&quot; rel=&quot;nofollow&quot;&gt;Therefore&lt;/a&gt;, adding humor is a &lt;a href=&quot;https://xkcd.com/1122/&quot; rel=&quot;nofollow&quot;&gt;guaranteed method to get the popular vote&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="3544" LastActivityDate="2015-09-03T08:41:57.420" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5875" PostTypeId="2" ParentId="5804" CreationDate="2015-09-03T08:54:47.053" Score="-1" Body="&lt;h2&gt;Link to your answers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Linking from newer answers to older ones makes people revisit your older ones, and possibly vote.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not sure if it's a tip or a way to cheat - it surely helps you get votes, but I can't say that it provides better answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is in addition to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5874/3544&quot;&gt;my other answer&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="3544" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2015-09-03T08:54:47.053" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5876" PostTypeId="2" ParentId="2140" CreationDate="2015-09-03T09:09:44.820" Score="-2" Body="&lt;h2&gt;The Perfect Keyboard&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Back in the 1970s, keyboard designers respected the needs of programmers and languages. For example, see the IBM 2741 keyboard, designed for APL (from &lt;a href=&quot;https://en.wikipedia.org/wiki/APL_(programming_language)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;):&lt;br&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/bMv6g.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/bMv6g.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Today, sadly, most code golfers are forced to struggle with standard keyboards, which are badly suited to the needs of their language. This has to change!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Choose a programming language.&lt;/li&gt;&#xA;&lt;li&gt;Design a keyboard, which would best suit the needs of a developer (or specifically a code golfer) in said language.&lt;/li&gt;&#xA;&lt;li&gt;Post the keyboard layout as an answer.&lt;/li&gt;&#xA;&lt;li&gt;Explain how your keyboard enhances the programming experience.&lt;/li&gt;&#xA;&lt;li&gt;Start counting votes for 7 days, until I acceopt the winning answer (the answer with most votes).&lt;/li&gt;&#xA;&lt;li&gt;Optional - if you are the winner, start a &lt;a href=&quot;https://www.kickstarter.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Kickstarter&lt;/a&gt; project to build the thing.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Expected Answers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This section is, of course, for the sandbox only.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't really expect a keyboard design which would actually improve functionality of programs in an actual serious language. I'd expect fun answers, where the keyboard design highlights soemthing fun/interesting/absurd about the language. But my expectations don't matter so much, because it's not me rating the answers, but the other users.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example (not very good ones):&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A Brainfuck keyboard with only 4 keys.&lt;/li&gt;&#xA;&lt;li&gt;A Lisp keyboard where half the keys are parentheses.&lt;/li&gt;&#xA;&lt;li&gt;A Piet keyboard - I'm sure someone will come up with something nice.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="3544" LastEditorUserId="3544" LastEditDate="2015-09-03T11:00:36.750" LastActivityDate="2015-09-03T11:00:36.750" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="5877" PostTypeId="1" CreationDate="2015-09-03T10:45:32.073" Score="9" ViewCount="163" Body="&lt;p&gt;Where the question does not explicitly state either way, should an answer that gives surplus output count as valid? Should this rule be different for visible characters and whitespace?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some specific cases that sometimes come up:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A single trailing newline&lt;/li&gt;&#xA;&lt;li&gt;Output enclosed in parentheses or quotes&lt;/li&gt;&#xA;&lt;li&gt;Leading or trailing spaces per line on multiline outputs&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Are there any other specific cases that should be dealt with?&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2015-09-07T02:40:29.943" Title="Default for additional characters in output" Tags="|discussion|defaults|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="5878" PostTypeId="1" CreationDate="2015-09-03T11:10:02.840" Score="23" ViewCount="2658" Body="&lt;p&gt;In code-golf questions, we typically score submissions by their byte count. However, whenever a submission uses a character outside of the ASCII range, the question of which encoding the code uses comes up.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One language for which this is quite relevant is APL, due to its use of many characters outside of ASCII and which have multiple-byte UTF-8 encodings. It is also relevant in many other languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As far as I can tell, we don't have a policy on how to handle this currently.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some possible ways to handle it:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Everything is UTF-8.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Languages may have specific encodings. If there is no standard encoding for a given language, use UTF-8.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Submissions may have specific encodings. If none is given, a language-wide default applies. If the language has no default, UTF-8.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I'm sure there are other possibilities, and I would be interested in hearing proposals. I do believe this is an issue we need a firm policy on, because this question seems to come up every single time someone writes an answer in APL, and reasonably often on other answers as well.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2023-10-21T02:55:32.940" Title="What character encodings may a submission use?" Tags="|discussion|policy|defaults|" AnswerCount="3" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="5879" PostTypeId="2" ParentId="5878" CreationDate="2015-09-03T11:10:02.840" Score="27" Body="&lt;h1&gt;Answer, else language, else UTF-8&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I prefer the system where an answer may specify its encoding, or default to its langauge's standard encoding, and a language's standard encoding is assumed to be UTF-8 unless specified elsewhere.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This has a couple of nice properties:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;An answerer can use whatever encoding they want for a particular answer.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Newer users can do the 'obvious thing', such as count characters in APL, and still be correct almost all of the time.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Every answer has a well-defined byte count.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The one major drawback is the need to maintain a list of language-by-language defaults, but there are only a small number of commonly used languages that don't use UTF-8 (APL uses the APL code page, Pyth uses ISO-8859-1, etc.), so it shouldn't be that hard.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;EDIT: To clarify something with regards to @Ypnypn's comment: Answer-defined encodings would be subject to the same standard loopholes as programming languages, namely that the encoding must have been specified before the question was asked, and specifying an enormous list of encodings, in the style of MetaGolfscript, is not allowed either.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="20080" LastEditDate="2015-09-07T10:52:54.887" LastActivityDate="2015-09-07T10:52:54.887" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="5880" PostTypeId="2" ParentId="5877" CreationDate="2015-09-03T11:30:53.323" Score="6" Body="&lt;h2&gt;No for ASCII-art challenges, possibly yes for other challenges&lt;/h2&gt;&#xA;&lt;p&gt;If the goal of the challenge is to output a specific ASCII pattern, then the challenge's requirements in terms of output must be clear and precise in the OP.&lt;/p&gt;&#xA;&lt;p&gt;If the goal of the challenge is to evaluate an answer to something, etc., then the way it is outputted feels less important, and too strict rules on the way the output looks might penalize some languages for no meaningful reasons. But the output should still be valid according to the OP &lt;strong&gt;if&lt;/strong&gt; there are precise requirements indicated, and one should not have to think a lot to understand what the output means with regards to the challenge (e.g. parentheses or brackets around a list is fine, additional meaningless chars is not).&lt;/p&gt;&#xA;&lt;h2&gt;Some languages have additional outputs that you can't do much about&lt;/h2&gt;&#xA;&lt;p&gt;I'll speak for Prolog here but this probably applies for other languages: the Prolog interpreter really likes to output &lt;code&gt;true&lt;/code&gt; or &lt;code&gt;false&lt;/code&gt; when you evaluate queries, even if you just want the value of a variable or if you want to print stuff to stdout with &lt;code&gt;write&lt;/code&gt;. There's not much you can do about it and as such those kinds of additional outputs should be tolerated.&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-09-03T11:30:53.323" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="5883" PostTypeId="2" ParentId="5878" CreationDate="2015-09-03T16:12:35.920" Score="4" Body="&lt;h1&gt;Standard language encoding, else UTF-8&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Answers should use the most appropriate encoding for the &lt;em&gt;language&lt;/em&gt;, not whatever is convenient for the answer. If no standard encoding for the language exists, the default should be UTF-8.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We could compile a list of languages that require a specific encoding and have that list on meta for reference. If the language is not on the list, assume UTF-8.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2015-09-03T16:12:35.920" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="5884" PostTypeId="2" ParentId="2140" CreationDate="2015-09-03T16:18:24.983" Score="0" Body="&lt;p&gt;&lt;em&gt;Hello everyone! I've been lurking around for a couple of weeks now and I think this site is super interesting!&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;I've decided that I definitely want to contribute to this site as well and have composed a new challenge over the last few days, that I hope you'll find interesting too!&lt;br&gt;I've tried to do all the reading beforehand and hope that I've got everything right and that this kind of thing hasn't been done before.&lt;br&gt;Please let me know if you think something needs to be changed!&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Anyways, here is my proposed challenge:&lt;/em&gt;&#xA;&lt;hr&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Programs With Taste &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;[probably will add some &quot;flavor text&quot; here]&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The Task:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write a program that takes an arbitrary group of pictures and ranks them after this program's &quot;preference.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What that means is, you should come up with an algorithm that favors some attributes in pictures over others by comparing them in a specific way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a popularity-contest, so what I want to see is interesting and creative methods of &quot;pseudo-subjectively&quot; ranking images.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an example, one program could favor an overall more colorful image over a mostly gray one, or another could have a &quot;favorite&quot; color and ranks pictures which have it more, higher than others. You could even come up with an elaborate scoring system that combines a couple of criteria.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Details:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;As input your program should accept any amount of images, which can be of any size.&lt;br&gt;&#xA;It doesn't matter if your program requires them to be in a specific file format.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output should be a ranked list from &quot;favorite&quot; image to &quot;least favorite&quot;, with items that unmistakably represent each of the pictures (e.g. a list of file names or a list of the images itself).&lt;br&gt;&#xA;If you want, you can also include the actual numbers (or score) that are compared in the output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program should definitely be deterministic, so that the same group of pictures will always result in the same order.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you're entering, please also provide a short description of what your algorithm prefers in a picture and how it's calculated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a bonus task I think it would also be really interesting to see what &quot;the perfect picture&quot; for your algorithm would be, meaning that this image would theoretically always be ranked the highest by your program.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example images:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Here are some groups of images you can use as examples:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;[I'll create and/or find some images to put here]&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can download them all in a .zip &lt;a href=&quot;http://example.com&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;url only temporary, of course&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Good luck!&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="43004" LastActivityDate="2015-09-03T16:18:24.983" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="6886" PostTypeId="1" AcceptedAnswerId="6887" CreationDate="2015-09-04T07:09:26.867" Score="11" ViewCount="702" Body="&lt;p&gt;The title pretty much says it all. If I use tabs/spaces for making the code more readable, do I have to count them?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, are line breaks counted as one character(&lt;code&gt;\n&lt;/code&gt;) or as two (&lt;code&gt;\r\n&lt;/code&gt;)?&lt;/p&gt;&#xA;" OwnerUserId="31033" LastEditorUserId="14215" LastEditDate="2015-09-04T12:36:25.260" LastActivityDate="2015-09-05T19:36:26.987" Title="How are line breaks and formatting counted for code golf challenges?" Tags="|discussion|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="6887" PostTypeId="2" ParentId="6886" CreationDate="2015-09-04T07:22:17.630" Score="3" Body="&lt;h1&gt;Whitespace is only counted when necessary, but unnecessary whitespace should still be avoided in golfed code&lt;/h1&gt;&#xA;&lt;p&gt;I think &lt;strong&gt;any whitespace unnecessary for execution may be excluded from the byte count&lt;/strong&gt;, as long as it is mentioned in the answer and not required by the challenge.&lt;/p&gt;&#xA;&lt;p&gt;In my opinion &lt;strong&gt;the best way to make your submission more readable is to post &lt;em&gt;both&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the golfed version with anything unnecessary (including whitespace) removed &lt;em&gt;and&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;the (possible) ungolfed version with extra whitespace, readable identifiers, etc. to make understanding the solution easier.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This allows for easy checking of your score, while still giving readers an easier way of understanding your code.&lt;/p&gt;&#xA;&lt;h1&gt;Linebreaks are counted as &lt;code&gt;\n&lt;/code&gt;, if possible&lt;/h1&gt;&#xA;&lt;p&gt;If the program works correctly with &lt;code&gt;\n&lt;/code&gt; in the file instead or &lt;code&gt;\r\n&lt;/code&gt;, then you can claim the byte count of the program with &lt;code&gt;\n&lt;/code&gt;'s. If, however, your interpreter/compiler requires you to use &lt;code&gt;\r\n&lt;/code&gt;, you should &lt;s&gt;switch interpreters&lt;/s&gt; count the linebreaks as 2 bytes.&lt;/p&gt;&#xA;" OwnerUserId="30164" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-09-04T09:44:19.900" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="6888" PostTypeId="1" CreationDate="2015-09-04T12:32:31.847" Score="1" ViewCount="53" Body="&lt;p&gt;I'm asking this especially after I stumbled on this question myself when I got asked some minutes ago in a comment, if the include in my C code is really neccessary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I answered that it is, since I need printf which would be implicitly declared if I didn't include the &lt;code&gt;stdio.h&lt;/code&gt;, but that results in unspecified behavior.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(though I can't think of a case where it wouldn't work for that challange so one could argue...)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So are PCG's challenges by default required to be as portable as possible, or will I have succeded as soon I can verify, that there is a system where my golfed code succeeds the challange?&lt;/p&gt;&#xA;" OwnerUserId="31033" LastEditorUserId="20080" LastEditDate="2015-09-04T12:47:22.430" LastActivityDate="2015-09-04T12:47:22.430" Title="How is system specific code or code with undefined behavior treated, if not explicitely stated?" Tags="|discussion|" AnswerCount="0" CommentCount="1" ClosedDate="2015-09-04T14:19:34.670" ContentLicense="CC BY-SA 3.0" />
  <row Id="6893" PostTypeId="2" ParentId="6886" CreationDate="2015-09-05T19:36:26.987" Score="33" Body="&lt;p&gt;(This answer is quite similar to Pietu's but a bit stricter on the first question.)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Count the code as posted. If there is unnecessary whitespace, remove it.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This makes it easier for everyone else to check your score. For someone who doesn't know your language it can be hard to tell which spaces are necessary (and counted) and which not. Furthermore, I think people who post code with unnecessary spaces left in (but who don't count them) often don't test if all the spaces are &lt;em&gt;actually&lt;/em&gt; unnecessary. In some languages I've used, I sometimes think I can just strip all spaces at the end, but then it breaks unexpectedly (I'm thinking Ruby and Mathematica, but there are certainly others).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;If you want to provide a more readable version with indentation etc., include it in your answer separately&lt;/strong&gt;, but the counted code should always appear first. As an example, &lt;a href=&quot;https://codegolf.stackexchange.com/a/26764/8478&quot;&gt;here is one of my Mathematica answers&lt;/a&gt; which does this.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Newlines are counted as &lt;code&gt;\n&lt;/code&gt;, if possible&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;On this account I agree with Pietu: unless your code only works with &lt;code&gt;\r\n&lt;/code&gt;, count it as a single character (i.e. usually as a single byte, unless you use UTF-16, say).&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2015-09-05T19:36:26.987" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6894" PostTypeId="2" ParentId="2140" CreationDate="2015-09-06T12:51:19.710" Score="16" Body="&lt;h1&gt;Who needs a GUI anyway?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Most people like GUIs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You don't.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;They say that GUI's show them pretty pictures.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Your task:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program that displays said image in full 256-colour ANSI art in the terminal. Because you &lt;em&gt;need&lt;/em&gt; to show them your leet skillz at programming, you have decided to write this as short as possible. &quot;That's a program?&quot; - Some user&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Given input from stdin or the command line of an image filename, the program must output it to stdout in &lt;a href=&quot;https://en.wikipedia.org/wiki/ANSI_escape_code#Colors&quot; rel=&quot;nofollow noreferrer&quot;&gt;ANSI&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;To output a string in green (#00FF00), you can print &lt;code&gt;\x1b[48;5;46mInsert text here!&lt;/code&gt; where &lt;code&gt;\x1b&lt;/code&gt; is codepoint 27 (hex 1b).&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x1b[48;5;&amp;lt;bgcode&amp;gt;m&lt;/code&gt; sets the colour.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;At the end of each line, the colour formatting should be reset so not to make the output look ugly on terminals with a resolution higher than 80x24 set.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program must support at least one of the following image file formats: PNG, JPG, BMP, PPM, SVG&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may use image processing libraries to parse images.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The output must be viewable in any terminal sized over 80x24.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If the longest side is the x-axis, its length must be resized to 80.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the longest side is the y-axis, its length must be resized to 24.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The aspect ratio of the image must be kept the same. Scale using &lt;code&gt;min(80/X,24/Y)&lt;/code&gt;, rounding down&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The output can be assumed to be a console that supports ANSI.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each character of the resized image represents 1 pixel.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The characters printed must be a space.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The colour for an individual pixel must be the closest available colour in the &lt;a href=&quot;https://upload.wikimedia.org/wikipedia/commons/9/95/Xterm_color_chart.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;colour map&lt;/a&gt; (Text version in wikipedia link above).&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In this case, the similarity of 2 colours can be defined as: &#xA;&lt;code&gt;((R1-R2)^2+(G1-G2)^2+(B1-B2)^2)^0.5&lt;/code&gt;&#xA;where results closer to zero indicate closer similarity.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If your image format supports the alpha channel, you may assume it is empty/doesn't exist.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/pkbOY.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/pkbOY.png&quot; alt=&quot;PPCG logo&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://cdn.sstatic.net/codegolf/img/icon-48.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;Found here&lt;/a&gt; is our beloved logo. &lt;a href=&quot;https://pastebin.com/SY72ygxd&quot; rel=&quot;nofollow noreferrer&quot;&gt;This hexdump&lt;/a&gt; is what your program should output given that image as an input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;This is a code golf, the answer with the shortest answer in bytes wins!&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="32686" LastEditorUserId="32686" LastEditDate="2017-08-26T17:38:33.413" LastActivityDate="2017-08-26T17:38:33.413" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="6895" PostTypeId="2" ParentId="2140" CreationDate="2015-09-06T18:57:03.203" Score="2" Body="&lt;h1&gt;Enough jQuery?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As a general rule of thumb, jQuery is a vital part of any program.  It is really great and does all things.  Your job, as a quality-control expert, is to ensure that a given program meets industry standards.  Only programs that use jQuery are eligible for your seal of approval.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program which takes an HTML file as input, and returns a &lt;em&gt;High-Quality (TM)&lt;/em&gt; HTML file as output.  An existing HTML file is deemed as high-quality if it contains a &lt;code&gt;script&lt;/code&gt; tag with the word &lt;code&gt;jquery&lt;/code&gt; in it.   Examples include the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;script src=&quot;jquery.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xA;&amp;lt;script src=&quot;//code.jquery.com/jquery-1.11.1.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xA;&amp;lt;script src=&quot;https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This condition is satisfied whenever there is the string &lt;code&gt;&amp;lt;script src=&quot;&lt;/code&gt;, followed by &lt;code&gt;&quot;&amp;gt;&amp;lt;/script&amp;gt;&lt;/code&gt;, with the string &lt;code&gt;jquery&lt;/code&gt; located somewhere in the middle.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I'm not sure if I should make this condition more precise.  It's probably good enough.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the given file meets quality standards, simply output it as-is.  If there is no enough jQuery, however, output the file with the string &lt;code&gt;&amp;lt;script src=&quot;jquery.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&lt;/code&gt; at the &lt;em&gt;very&lt;/em&gt; top, so that everyone can see that it's a fixed, bug-free program.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2015-09-06T18:57:03.203" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="6896" PostTypeId="1" AcceptedAnswerId="6897" CreationDate="2015-09-06T20:24:59.583" Score="9" ViewCount="167" Body="&lt;p&gt;After noticing that our site hasn't had a challenge on the Coin Problem, I recently &lt;a href=&quot;https://codegolf.stackexchange.com/questions/57146/the-coin-problem&quot;&gt;posted one&lt;/a&gt;. However, it was pointed out that the challenge &lt;a href=&quot;https://stackoverflow.com/questions/3465392/code-golf-frobenius-number&quot;&gt;was posted&lt;/a&gt; on Stack Overflow back in the day when codegolf.SE didn't yet exist and such challenges were accepted on SO. The old challenge has a fair amount of answers as well. Should I close my challenge as a duplicate of another question on a Stack Exchange site, or let it be?&lt;/p&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2015-09-06T20:54:47.090" Title="Duplicates on other SE sites" Tags="|discussion|rules|duplicates|stackexchange|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="6897" PostTypeId="2" ParentId="6896" CreationDate="2015-09-06T20:54:47.090" Score="15" Body="&lt;p&gt;Let it be. Codegolf questions on SO get deleted apparently at random, so there's no telling how long that one will be there. However, it might be a good idea to link to it from your question and to state that if people want to copy answers then they should credit the original poster, make their answers community wiki, and be prepared to delete them if the original poster wants to repost them here.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2015-09-06T20:54:47.090" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6899" PostTypeId="1" CreationDate="2015-09-07T01:48:27.697" Score="2" ViewCount="92" Body="&lt;p&gt;For &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55857/print-this-question-%E2%86%93&quot;&gt;this question&lt;/a&gt; I wrote a small script to compress a string by replacing substrings that occur a lot with single characters that aren't already in the string (inspired by the ES6 answer), and posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55857/print-this-question-%E2%86%93/55936#55936&quot;&gt;this answer&lt;/a&gt; (which managed to be shorter than the ES6 answer because I replaced more duplicate substrings).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I thought that was a pretty successful strategy so I used the same script to generate a string for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/57053/cardinals-and-ordinals-1-to-100/57060#57060&quot;&gt;this answer&lt;/a&gt;, but that one got a downvote.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is reusing strategies across multiple questions frowned upon here?&lt;/p&gt;&#xA;" OwnerUserId="20666" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-09-07T14:22:35.327" Title="Is it not OK to reuse a strategy?" Tags="|discussion|answers|specific-question|clarification|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6900" PostTypeId="2" ParentId="5877" CreationDate="2015-09-07T02:40:29.943" Score="2" Body="&lt;h1&gt;Only if the appearance is the same&lt;/h1&gt;&#xA;&lt;p&gt;So trailing spaces or newlines are okay, because they don't affect the appearance of the answer.&lt;/p&gt;&#xA;&lt;p&gt;However, leading spaces, or visible characters anywhere, are not allowed.&lt;/p&gt;&#xA;&lt;p&gt;Enclosing the output in quotes is not allowed.&lt;/p&gt;&#xA;&lt;p&gt;Printing a list, however, can be done in any reasonable format (including enclosed by parentheses). This is because any default formatting requirement is equally arbitrary, so anything standard is acceptable.&lt;/p&gt;&#xA;" OwnerUserId="16294" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-09-07T02:40:29.943" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6901" PostTypeId="2" ParentId="6899" CreationDate="2015-09-07T03:34:58.340" Score="6" Body="&lt;p&gt;To answer your specific question: Reusing strategies across challenges is perfectly fine. Similar problems require similar approaches.&#xA; It can, on occasions, indicate a bad question (something overly similar has been done before), but not a bad answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Try not to draw conclusions from a single downvote. If a downvote comes without any kind of explanation, it is impossible to know for sure why it was cast. There's usually no point in trying to guess. I've received a huge amount of upvotes for posts that didn't really deserve them and downvotes for others of much higher quality.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I had to guess why your first answer was better received than the second one, I'd say it's because the PHP answer is the shortest one that doesn't use built-in compression, while the JavaScript answer was severely outgolfed by other submissions by the time it was downvoted.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2015-09-07T14:22:35.327" LastActivityDate="2015-09-07T14:22:35.327" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="6905" PostTypeId="1" CreationDate="2015-09-07T17:46:55.473" Score="22" ViewCount="853" Body="&lt;p&gt;I noticed an old question, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/16954/an-improved-version-of-golfscript?rq=1&quot;&gt;An improved version of GolfScript&lt;/a&gt;, which asked, as a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question, for people to suggest ways to improve GolfScript. This was a well-received question, but times may have changed. I'd like to ask a similar question about Pyth, for obvious reasons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd like to know whether such a question, &quot;What would you like to see improved in Pyth&quot; or similar, would be on topic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Similarly, but more generally, there is the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/golfing-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;golfing-language&amp;#39;&quot; rel=&quot;tag&quot;&gt;golfing-language&lt;/a&gt;. The question linked above is its most recent question that wasn't closed. Is anything in that category still on topic?&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.563" LastActivityDate="2015-10-18T09:05:52.090" Title="Can I ask a question seeking feature requests for a golfing language?" Tags="|discussion|policy|asking-questions|" AnswerCount="4" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="6906" PostTypeId="2" ParentId="6905" CreationDate="2015-09-07T17:52:26.467" Score="0" Body="&lt;h1&gt;No, such questions are no longer on topic&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As you said, times have changed. Such questions would now be considered too broad and/or opinion-based.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2015-09-07T17:52:26.467" CommentCount="1" CommunityOwnedDate="2015-09-07T17:52:26.467" ContentLicense="CC BY-SA 3.0" />
  <row Id="6907" PostTypeId="2" ParentId="6905" CreationDate="2015-09-07T17:53:55.630" Score="20" Body="&lt;h1&gt;Yes, asking for feature requests is still on topic&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Code golf is a major part of this site. We should continue to welcome questions aimed at improving existing golfing languages for the betterment of the code golf community.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="8478" LastEditDate="2015-10-09T12:46:20.240" LastActivityDate="2015-10-09T12:46:20.240" CommentCount="4" CommunityOwnedDate="2015-09-07T17:53:55.630" ContentLicense="CC BY-SA 3.0" />
  <row Id="6909" PostTypeId="2" ParentId="5842" CreationDate="2015-09-07T21:34:04.247" Score="4" Body="&lt;h3&gt;General guidance&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;From the comment discussion on the question it sounds like you are looking to help people understand how to answer, rather than just teach them to golf. Maybe it would help to have some general guidance on what we like to see in answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Personally I am more likely to upvote an answer that is interesting and well explained. This kind of general advice could go in one place (perhaps a blog post), while advice specific to the different question types could go in the individual tag wikis. Links to the tag wikis from the blog post would help new users who may not realise the tag wikis are the place to look. This keeps the blog post a manageable size while still providing further reading.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Suggested challenges&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I like Beta Decay's suggestion of a list of suggested challenges. Easy to hard makes sense for some things, but it may be worth subdividing in other ways too, perhaps into specialist areas. What is easy will depend on a person's previous experience.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we have a list for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, a list for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, a list for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, and so on, these lists could possibly be included at the end of the tag wikis, or they could form separate blog posts to be linked to from the tag wikis and the general blog post.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Tutorials&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Some people may like to see a step by step walk through of writing long code and then golfing it down. There are already answers that explain the golfing process in detail, and many that provide golfed and ungolfed code for comparison. Such a guide could give examples of little savings, and then link to the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; tag for further examples, and then also give examples of changing algorithm to give a dramatic saving. This could be followed up with links to answers that give particularly helpful explanations of their workings.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Similar tutorials could be put together for other question types (depending on which ones have people volunteer to write them). People can also indicate here on Meta if they have an area they would particularly like to see a guide for.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2015-09-07T21:34:04.247" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6910" PostTypeId="2" ParentId="2140" CreationDate="2015-09-08T06:12:20.070" Score="1" Body="&lt;h1&gt;Is a point inside a polygon?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given the polygon with 2 &amp;lt; &lt;em&gt;N&lt;/em&gt; &amp;lt; 11 sides, on 2D plane, find out if a given point is inside the polygon.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input can be an array of points in &lt;code&gt;x&lt;/code&gt;, &lt;code&gt;y&lt;/code&gt;, each determining a vertex, or by a string in format &lt;code&gt;X Y x1 y1 x2 y2 ... xN yN&lt;/code&gt; (you may choose other separator). The &lt;code&gt;X&lt;/code&gt; and &lt;code&gt;Y&lt;/code&gt; are the coordinates of the point to be tested. The list then contains &lt;code&gt;N&lt;/code&gt; verices, and the last point is connected to the first point. All &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; are integers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using any built-in functions performing the test is prohibited (like &lt;a href=&quot;http://docs.oracle.com/javase/7/docs/api/java/awt/Polygon.html#contains%28java.awt.Point%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;this one&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should consider that a point is inside a polygon also when it is one of its vertices or it lies on one of its edges.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Notes&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Tags would be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-restrictions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-restrictions&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-restrictions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Should max &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; be determined? &lt;/li&gt;&#xA;&lt;li&gt;Should they be positive (&lt;code&gt;uint&lt;/code&gt;) values only?&lt;/li&gt;&#xA;&lt;li&gt;Some questions of this type have already been asked on StackOverflow (&lt;a href=&quot;https://stackoverflow.com/q/11716268/2088851&quot;&gt;example 1&lt;/a&gt;, &lt;a href=&quot;https://stackoverflow.com/questions/217578/point-in-polygon-aka-hit-test?lq=1&quot;&gt;example 2&lt;/a&gt;). Is it ok to ask this question here? (I didn't find it)&lt;/li&gt;&#xA;&lt;li&gt;Should the question also allow non-convex polygons? A non-convex (concave) is a polygon which has at least one of its angles larger than 180 deg., and can borders intersect? (I think it can be too complicated and in my opinion it should be for convex polygons only).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="41819" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2015-09-08T06:12:20.070" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="6911" PostTypeId="2" ParentId="2140" CreationDate="2015-09-08T06:19:46.137" Score="1" Body="&lt;h1&gt;&lt;s&gt;Literal Fourier Transform (or Fouriest Numbers?)&lt;/s&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/10608/convert-number-to-a-base-where-its-representation-has-most-4s&quot;&gt;Dupe&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(&lt;em&gt;inspired by &lt;a href=&quot;http://www.smbc-comics.com/?id=2874&quot; rel=&quot;nofollow noreferrer&quot;&gt;this Saturday Morning Breakfast Cereal comic&lt;/a&gt;&lt;/em&gt;)&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;It's called a fourier tranform when you take a number and convert it to the base system where it will have more fours, thus making it &quot;fourier&quot;. If you pick the base with the most fours, the number is said to be &quot;fouriest.&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Goal: Given a positive integer &lt;code&gt;n&lt;/code&gt; in base 10:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$&#xA;4 \le n_{10} \le 2^{31} -1&#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Write a function that displays its equivalent in another base in the format below that maximizes the number of &lt;code&gt;4&lt;/code&gt;s, i.e. the &lt;em&gt;fouriest&lt;/em&gt;:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Base x; Fouriest y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Notes:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If multiple bases tie on the number of &lt;code&gt;4&lt;/code&gt;s, any base will be accepted. E.g. if the input has the &lt;em&gt;fouriest&lt;/em&gt; value already, it's fine to return/display the input.&lt;/li&gt;&#xA;&lt;li&gt;Numbers may not necessary yield a &lt;code&gt;4&lt;/code&gt;, see last example below.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;(from comic) &lt;code&gt;624 -&amp;gt; Base 5; Fouriest 4444&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;2316780 -&amp;gt; Base 14; Fouriest 444444&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;4 -&amp;gt; Base 10; Fouriest 4&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;5 -&amp;gt; Base 10; Fouriest 5&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Bonus:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Have your function accept a second argument &lt;code&gt;m&lt;/code&gt; for the input base: 1/4 reduction in submission size.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Winning:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Shortest code in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="21697" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.127" LastActivityDate="2015-09-08T14:24:07.593" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="6912" PostTypeId="2" ParentId="2419" CreationDate="2015-09-08T07:11:34.417" Score="53" Body="&lt;h1&gt;Restricting to just programs requires explicitly specifying &quot;full program&quot; rather than just &quot;program&quot;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If the question requests a program, this can still be answered with a function. This allows for the fact that many people state &quot;program&quot; without thinking, not intending to exclude functions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For questions that wish to exclude functions, this should be stated explicitly, for example: &quot;full program&quot;, &quot;complete program&quot; or &quot;program, not function&quot;.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2015-09-08T07:27:54.607" LastActivityDate="2015-09-08T07:27:54.607" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="6914" PostTypeId="2" ParentId="2419" CreationDate="2015-09-08T09:07:28.827" Score="-5" Body="&lt;h1&gt;A set of different &amp;quot;defaults&amp;quot;&lt;/h1&gt;&#xA;&lt;p&gt;I think many questions require one of a few different ways, some require...&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;... a full program that accepts input and prints output throu standard I/O&lt;/li&gt;&#xA;&lt;li&gt;... files as input/output (e.g. Images)&lt;/li&gt;&#xA;&lt;li&gt;... only functions (or similar constructs)&lt;/li&gt;&#xA;&lt;li&gt;... snippets, where input/output is stored in a variable (or similar construct)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;This is of course just a rough draft, but you get the idea. My suggestion is making a definition for each of these in order that everyone writing challenges only has to declare which of those apply, instead of writing a whole novel on what is allowed and what is not.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-09-08T09:07:28.827" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="6915" PostTypeId="1" AcceptedAnswerId="6940" CreationDate="2015-09-08T10:04:26.393" Score="5" ViewCount="852" Body="&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a function which returns number passed into it as an argument.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Solution:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f=x=&amp;gt;x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;What is its length?&lt;br&gt;&#xA;Is it 4 as a length of the lambda &lt;code&gt;x=&amp;gt;x&lt;/code&gt; only or &lt;code&gt;6&lt;/code&gt; as a length of whole statement with assignment?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What if there are 2 functions?&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;g=x=&amp;gt;x/2&#xA;f=x=&amp;gt;g(x)+g(x)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="32091" LastActivityDate="2023-02-02T08:57:31.470" Title="How do we calculate the length of lambda?" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6916" PostTypeId="2" ParentId="6915" CreationDate="2015-09-08T10:57:51.037" Score="2" Body="&lt;h2&gt;Apparently anonymous functions are the norm, so you don't count the assignment&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strike&gt;The length of the lambda is the same as with a full program: the length of your function is the number of characters &lt;em&gt;including&lt;/em&gt; the assignment. You want something that can be inserted as a line, not proceeding or preceding any other code on that line.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, in Python:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f=lambda x:x*2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Is 14 bytes and:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f=lambda x:x*2&#xA;g=lambda y:y*3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is 29 bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is akin to the language handicaps: keep it simple and easy to police.&lt;/strike&gt;&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="30525" LastEditDate="2015-09-09T09:02:08.770" LastActivityDate="2015-09-09T09:02:08.770" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="6918" PostTypeId="1" CreationDate="2015-09-08T15:06:17.020" Score="92" ViewCount="11465" Body="&lt;p&gt;Language-creation has become a popular activity on CGCC.  A decent portion of answers, especially &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; answers, are written in languages invented by the community.  These are also languages that might be unfamiliar to this site's wider viewing audience.&lt;/p&gt;&#xA;&lt;p&gt;What languages (esoteric, golfing, or not) have been created by our users?  For each language, please include some of the following details:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Language name and creator&lt;/li&gt;&#xA;&lt;li&gt;Links to resources, like documentation and interpreter&lt;/li&gt;&#xA;&lt;li&gt;A brief description of the language, some of its main concepts and features, and its history&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;List of languages&lt;/h3&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;function answersUrl(e){return&quot;https://api.stackexchange.com/2.2/questions/&quot;+QUESTION_ID+&quot;/answers?page=&quot;+e+&quot;&amp;amp;pagesize=100&amp;amp;order=desc&amp;amp;sort=creation&amp;amp;site=meta.codegolf&amp;amp;filter=&quot;+ANSWER_FILTER}function commentUrl(e,s){return&quot;https://api.stackexchange.com/2.2/answers/&quot;+s.join(&quot;;&quot;)+&quot;/comments?page=&quot;+e+&quot;&amp;amp;pagesize=100&amp;amp;order=desc&amp;amp;sort=creation&amp;amp;site=meta.codegolf&amp;amp;filter=&quot;+COMMENT_FILTER}function getAnswers(){jQuery.ajax({url:answersUrl(answer_page++),method:&quot;get&quot;,dataType:&quot;jsonp&quot;,crossDomain:!0,success:function(e){answers.push.apply(answers,e.items),answers_hash=[],answer_ids=[],e.items.forEach(function(e){e.comments=[];var s=+e.share_link.match(/\d+/);answer_ids.push(s),answers_hash[s]=e}),e.has_more||(more_answers=!1),comment_page=1,getComments()}})}function getComments(){jQuery.ajax({url:commentUrl(comment_page++,answer_ids),method:&quot;get&quot;,dataType:&quot;jsonp&quot;,crossDomain:!0,success:function(e){e.items.forEach(function(e){e.owner.user_id===OVERRIDE_USER&amp;amp;&amp;amp;answers_hash[e.post_id].comments.push(e)}),e.has_more?getComments():more_answers?getAnswers():process()}})}function getAuthorName(e){return e.owner.display_name}function process(){var e=[];answers.forEach(function(s){var a=s.body;s.comments.forEach(function(e){OVERRIDE_REG.test(e.body)&amp;amp;&amp;amp;(a=&quot;&amp;lt;h1&amp;gt;&quot;+e.body.replace(OVERRIDE_REG,&quot;&quot;)+&quot;&amp;lt;/h1&amp;gt;&quot;)});var r=a.match(SCORE_REG);r?e.push({user:getAuthorName(s),size:+r[2],language:r[1],link:s.share_link}):console.log(a)}),e.sort(function(e,s){var a=e.size,r=s.size;return a-r});var s={},a=1,r=null,n=1;e.forEach(function(e){e.size!=r&amp;amp;&amp;amp;(n=a),r=e.size,++a;var t=jQuery(&quot;#answer-template&quot;).html();t=t.replace(&quot;{{PLACE}}&quot;,n+&quot;.&quot;).replace(&quot;{{NAME}}&quot;,e.user).replace(&quot;{{LANGUAGE}}&quot;,e.language).replace(&quot;{{SIZE}}&quot;,e.size).replace(&quot;{{LINK}}&quot;,e.link),t=jQuery(t),jQuery(&quot;#answers&quot;).append(t);var o=e.language;o=jQuery(&quot;&amp;lt;a&amp;gt;&quot;+o+&quot;&amp;lt;/a&amp;gt;&quot;).text(),s[o]=s[o]||{lang:e.language,lang_raw:o,user:e.user,size:e.size,link:e.link}});var t=[];for(var o in s)s.hasOwnProperty(o)&amp;amp;&amp;amp;t.push(s[o]);t.sort(function(e,s){return e.lang_raw.toLowerCase()&amp;gt;s.lang_raw.toLowerCase()?1:e.lang_raw.toLowerCase()&amp;lt;s.lang_raw.toLowerCase()?-1:0});for(var c=0;c&amp;lt;t.length;++c){var i=jQuery(&quot;#language-template&quot;).html(),o=t[c];i=i.replace(&quot;{{LANGUAGE}}&quot;,o.lang).replace(&quot;{{NAME}}&quot;,o.user).replace(&quot;{{SIZE}}&quot;,o.size).replace(&quot;{{LINK}}&quot;,o.link),i=jQuery(i),jQuery(&quot;#languages&quot;).append(i)}}var QUESTION_ID=6918,ANSWER_FILTER=&quot;!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe&quot;,COMMENT_FILTER=&quot;!)Q2B_A2kjfAiU78X(md6BoYk&quot;,OVERRIDE_USER=2867,answers=[],answers_hash,answer_ids,answer_page=1,more_answers=!0,comment_page;getAnswers();var SCORE_REG=/&amp;lt;h\d&amp;gt;\s*([^\n]+)\s*&amp;lt;\/h\d&amp;gt;/,OVERRIDE_REG=/^Override\s*header:\s*/i;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-css lang-css prettyprint-override&quot;&gt;&lt;code&gt;body{text-align:left!important}#answer-list,#language-list{padding:10px;width:290px;float:left}table thead{font-weight:700}table td{padding:5px}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js&amp;gt;&amp;lt;/script&amp;gt;&amp;lt;link rel=stylesheet type=text/css href=&quot;//cdn.sstatic.net/codegolf/all.css?v=83c949450c8b&quot;&amp;gt;&amp;lt;div id=language-list&amp;gt;&amp;lt;h2&amp;gt;Languages by CGCC Users&amp;lt;/h2&amp;gt;&amp;lt;table class=language-list&amp;gt;&amp;lt;thead&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;Language&amp;lt;td&amp;gt;User&amp;lt;tbody id=languages&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;table style=display:none&amp;gt;&amp;lt;tbody id=answer-template&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;{{PLACE}}&amp;lt;td&amp;gt;{{NAME}}&amp;lt;td&amp;gt;{{LANGUAGE}}&amp;lt;td&amp;gt;{{SIZE}}&amp;lt;td&amp;gt;&amp;lt;a href={{LINK}}&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;table style=display:none&amp;gt;&amp;lt;tbody id=language-template&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;{{LANGUAGE}}&amp;lt;td&amp;gt;{{NAME}}&amp;lt;td&amp;gt;&amp;lt;a href={{LINK}}&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/table&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="87606" LastEditDate="2021-12-27T23:56:38.737" LastActivityDate="2023-12-17T17:50:48.513" Title="What programming languages have been created by CGCC users?" Tags="|discussion|languages|" AnswerCount="102" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="6919" PostTypeId="2" ParentId="6918" CreationDate="2015-09-08T15:18:46.300" Score="44" Body="&lt;h1&gt;Pyth&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Pyth was created in June 2014 by me, isaacg. Other contributors to the language include PPCG users orlp, jakube and Maltysen, as well as others.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The source code for Pyth language is hosted &lt;a href=&quot;https://github.com/isaacg1/pyth&quot; rel=&quot;nofollow&quot;&gt;on Github&lt;/a&gt; for anyone to see and contribute to.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An online compiler/executor is hosted &lt;a href=&quot;https://pyth.herokuapp.com/&quot; rel=&quot;nofollow&quot;&gt;on Heroku&lt;/a&gt; as an alternative way to use the language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pyth's primary purpose is as a code-golfing language, designed to write the shortest code possible. It is a procedural language, meaning that it is based around function calls. To reduce the overhead of each function call, all functions are in prefix notation, with fixed arity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pyth is written in, compiles to, and was originally closely based off of Python. This was chosen to make it easier to learn for people who already knew C-style languages. However, since its creation, Pyth code has resembled Python code less and less, as the focus has become more exclusively on golfing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To discuss and ask questions about Pyth, visit &lt;a href=&quot;http://chat.stackexchange.com/rooms/24159/pyth&quot;&gt;the Pyth chat room&lt;/a&gt;. Annoucements of new Pyth features will also often be located there.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2015-09-08T15:18:46.300" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="6920" PostTypeId="2" ParentId="6918" CreationDate="2015-09-08T15:32:13.550" Score="34" Body="&lt;h1&gt;CJam by aditsu&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A stack-oriented language heavily inspired from GolfScript, first published in April 2014. It is written in Java, but a JavaScript interpreter is also available.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;CJam has a fixed set of variable names - all single uppercase letters - and a variety of predefined operators that use 1 or 2 characters (using a distinct first character). Due to these and other features, it can eliminate most whitespace, which makes programs shorter (and harder to read).&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Project page: &lt;a href=&quot;https://sourceforge.net/projects/cjam/&quot; rel=&quot;nofollow&quot;&gt;https://sourceforge.net/projects/cjam/&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Wiki documentation and useful links: &lt;a href=&quot;https://sourceforge.net/p/cjam/wiki/Home/&quot; rel=&quot;nofollow&quot;&gt;https://sourceforge.net/p/cjam/wiki/Home/&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;JavaScript interpreter (works offline!): &lt;a href=&quot;http://cjam.aditsu.net/&quot; rel=&quot;nofollow&quot;&gt;http://cjam.aditsu.net/&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="7416" LastActivityDate="2015-09-08T15:32:13.550" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6921" PostTypeId="2" ParentId="6918" CreationDate="2015-09-08T16:20:13.173" Score="11" Body="&lt;h1&gt;Help, WarDoq!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This esoteric language was created by me, Dennis, in August 2015.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It consists solely of 16 one-byte built-ins that print common variations of the string &lt;strong&gt;Hello, World!&lt;/strong&gt; two built-ins for quining, two for addition an two for primality testing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It was designed to be very competitive in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hello-world&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hello-world&amp;#39;&quot; rel=&quot;tag&quot;&gt;hello-world&lt;/a&gt; challenges with the least possible effort to satisfy &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073&quot;&gt;our definition of programming language&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://esolangs.org/wiki/Help,_WarDoq!&quot; rel=&quot;nofollow noreferrer&quot;&gt;Specification and offline interpreter&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://cjam.aditsu.net/#code=l%3AQ%7B%22HhEeLlOoWwRrDd%2C!AaPpQq%22Q%7C%5B%22Hh%22%22ello%22a%5B&amp;#39;%2CL%5DSa%22Ww%22%22orld%22a%5B&amp;#39;!L%5D%5D%3Am*%3A%60%5B%7Briri%2B%7D%7Briri%5E%7D%7Brimp%7D%7Brizmp%7DQ%60Q%7B%5C%2B%7D*%60L%5D%2Ber%3A~N*%7D%3AH~&quot; rel=&quot;nofollow noreferrer&quot;&gt;Online interpreter&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2015-09-08T16:20:13.173" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6922" PostTypeId="2" ParentId="6918" CreationDate="2015-09-08T16:43:57.570" Score="14" Body="&lt;h1&gt;???&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This language is a trivial Brainfuck substitution created by Alex A. (me) and BrainSteel in August 2015. It uses punctuation in place of the usual BF commands so that it may be embedded in any sort of usual human-written text and go unnoticed. Otherwise its only distinctions from BF are that it cannot travel left of the starting cell and brackets use the same character but with a toggle character to switch between open and closed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It was created to be annoying for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/54807/the-programming-language-quiz&quot;&gt;The Programming Language Quiz&lt;/a&gt;, since uncracked answers use ??? in place of the language name.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://esolangs.org/wiki/%3F%3F%3F&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolangs page&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/ararslan/qqq-lang&quot; rel=&quot;nofollow noreferrer&quot;&gt;Original C++ implementation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/BrainSteel/BrainF-k&quot; rel=&quot;nofollow noreferrer&quot;&gt;BrainSteel's improved C implementation with BF &amp;lt;-&gt; ??? translator&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/54936/20469&quot;&gt;Dennis' awesome Piet/??? polyglot&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2015-09-08T16:43:57.570" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6923" PostTypeId="2" ParentId="6918" CreationDate="2015-09-08T19:08:49.113" Score="6" Body="&lt;h1&gt;Fourier&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Fourier is a simple language which looks similar to Golfscript or CJam but is more familiar in syntax to Brainfuck.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Created by me, Beta Decay, the main basis of Fourier is the accumulator. This is a variable which all operators use as their main argument. Because of this, Fourier can only handle integers and so floating point arithmetic and string related operations or pretty much impossible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fourier has been used in a few challenges so far (and one question) but, because of PPCG's usual requirement for an output string instead of simply numbers, the programs have been extremely long and difficult to golf. This has been fairly problematic and there haven't really been any &quot;fun&quot; Fourier programs, so I'll show you some.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Fibonacci sequence&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1~yI~k(xoi^&amp;lt;k{1}{44a32a}y+x~gy~xg~yi^~i)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/nexus/fourier#@29YV@lZl61RkZ8ZZ5NdbVhbbWKSaGyUWFupXVGXXllXkV5XmRlXl6n5/78ZAA&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Try it online!&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now if you are fairly familiar with the syntax of Fourier, you may be happy with this program, except for maybe the &lt;code&gt;x&lt;/code&gt; at the start of the loop: this hasn't been defined before and in older versions of Fourier threw an error. Instead, all possible variables are preinitialised to zero.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The part of the code which used the most bytes was &lt;code&gt;i^&amp;lt;k{1}{44a32a}&lt;/code&gt;. This checked to see if the iterator (defined as &lt;code&gt;i&lt;/code&gt;) is below the input value. If so, then output a comma and a space. To see why this is here, see these two examples for input &lt;code&gt;5&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output without &lt;code&gt;i^&amp;lt;k{1}{44a32a}&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0, 1, 1, 2, 3, &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output with &lt;code&gt;i^&amp;lt;k{1}{44a32a}&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0, 1, 1, 2, 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So it's really more of an aesthetic choice.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;ASCII table&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/40490/print-the-ascii-table&quot;&gt;Similar to the requirements of this challenge&lt;/a&gt; but only prints the printable ASCII and takes no input.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;33~j126(j^a~j)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/nexus/fourier#@29sXJdlaGSmkRWXWJel@f8/AA&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Try it online!&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a very basic example of how to implement a for loop in Fourier: create an iterator variable and set it to your lower bound, then set the repeat loop's condition to your upper bound. All you have to do now is increment the iterator and set the iterator to the new incremented iterator.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Others from around PPCG&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;By other people:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/58570/30525&quot;&gt;Obfuscated Hello World&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/58364/30525&quot;&gt;Person of Interest&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;By me:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/59609/30525&quot;&gt;Shortest infinite loop producing no output&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/62452/30525&quot;&gt;Halloween Golf: The 2spooky4me Challenge&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/55879/30525&quot;&gt;Print this Question&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/60347/30525&quot;&gt;The Mystery String Printer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/58012/30525&quot;&gt;Remapping ASCII&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/55729/30525&quot;&gt;Comparing Two Numbers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/57660/30525&quot;&gt;Is this number a prime?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/55423/30525&quot;&gt;Hello, World!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;More can be found &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=fourier+is%3Aa+user%3A30525&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And, finally, the question about golfing Fourier:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/55384/golfing-strings-in-fourier&quot;&gt;Golfing Strings in Fourier&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Online Interpreters&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://fourier.tryitonline.net&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it Online!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://beta-decay.github.io/editor&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it on FourIDE!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Note that FourIDE will be updated with new functionality and bug fixes more often.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://esolangs.org/wiki/Fourier&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolangs page&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/beta-decay/Fourier&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github repo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://fourierlang.codeplex.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Interpreter page&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://beta-decay.github.io&quot; rel=&quot;nofollow noreferrer&quot;&gt;github.io page&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="30525" LastEditDate="2017-05-12T06:17:42.277" LastActivityDate="2017-05-12T06:17:42.277" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6924" PostTypeId="2" ParentId="6918" CreationDate="2015-09-08T19:14:21.657" Score="9" Body="&lt;h1&gt;Element&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Element was created by PhiNotPi (me) in March of 2012.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Element is a stack-based language that was written in and compiles to Perl.  This is accomplished by a character-by-character substitution of operators with the equivalent Perl statements, with a bare minimum of additional processing for string literals (anything that isn't an operator).  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main memory structures are &lt;em&gt;two&lt;/em&gt; stacks and a hash.  One stack is the main stack, which is where I/O and most operations take place.  The control stack is where Boolean operations occur and where comparison results are placed.  This control stack is used for control flow (like while loops), hence its name.  The hash is used mainly to store/recall variables.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Element is notable as being a very &quot;simple&quot; golfing language.  The list of operators is short (only ASCII symbols, no letters or numbers), and there isn't overloading.  There's no array support, code blocks, eval, and only a couple of string function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is not ongoing development.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Official GitHub, with interpreter and &quot;complete&quot; documentation: &lt;a href=&quot;https://github.com/PhiNotPi/Element&quot; rel=&quot;nofollow&quot;&gt;https://github.com/PhiNotPi/Element&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Esolangs page with examples: &lt;a href=&quot;http://esolangs.org/wiki/Element&quot; rel=&quot;nofollow&quot;&gt;http://esolangs.org/wiki/Element&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2015-09-08T19:14:21.657" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="6925" PostTypeId="2" ParentId="6918" CreationDate="2015-09-08T19:50:26.917" Score="9" Body="&lt;h1&gt;Bubblegum&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This esoteric language was created by me, Dennis, in September 2015.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bubblegum was designed to be unbeatable in trivial &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenges, which require printing a very short string or a wall of text.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While Turing complete, the actually usable features of this languages consist in decompression of &lt;a href=&quot;https://en.wikipedia.org/wiki/DEFLATE&quot; rel=&quot;nofollow noreferrer&quot;&gt;DEFLATE&lt;/a&gt; and certain &lt;a href=&quot;https://en.wikipedia.org/wiki/Lempel%E2%80%93Ziv%E2%80%93Markov_chain_algorithm#LZMA2_format&quot; rel=&quot;nofollow noreferrer&quot;&gt;LZMA 2&lt;/a&gt; streams with no overhead, as well as base conversion from binary to printable ASCII.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://esolangs.org/wiki/Bubblegum&quot; rel=&quot;nofollow noreferrer&quot;&gt;Specification and interpreter (Python 3)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2015-09-08T19:50:26.917" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="6926" PostTypeId="2" ParentId="6918" CreationDate="2015-09-08T21:09:00.120" Score="42" Body="&lt;h1&gt;Retina&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Retina was first created by me in February 2015. I continued to improve the language occasionally, and the big 1.0 release was finally done in January 2018. There will probably be a few smaller features I will add in the future, but as of this writing I have no plans for another release that's remotely as big as what we have now.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is a regex-based programming language which I originally just wrote to be able to use a regex in code golf challenges with as little syntactic overhead as possible. The language has come quite a long way from those humble beginnings and is now a powerful string transformation tool. I still wouldn't want anyone to use it in production, as its code-golf-oriented syntax generally leads to write-only code. That said, it's perfectly usable for writing quick throwaway scripts that don't need to be maintained, and I'm using it as an invaluable productivity tool these days.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Retina isn't nearly as terse as the top-tier golfing languages, but this is partly by design. Apart from &lt;code&gt;¶&lt;/code&gt;, Retina's syntax only uses ASCII characters, and its regex syntax is no terser than that of the .NET engine itself. The reason for this is that the purpose of Retina's golfiness is to reduce the bottleneck of typing speed, not to get the absolute smallest byte count, to maximise its usefulness for quickly writing scripts to manipulate text data.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/mbuettner/retina&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;GitHub repository&lt;/strong&gt;&lt;/a&gt;. Includes interpreter (C#), example programs and issue tracker.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/m-ender/retina/wiki/The-Language&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Language documentation&lt;/strong&gt;&lt;/a&gt; (on the GitHub wiki).&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://esolangs.org/wiki/Retina&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Esolangs page&lt;/strong&gt;&lt;/a&gt;. It's mostly a stub. I have no plans to mirror the language documentation on esolangs, but maybe this article could be expanded a bit some day. That said, I wouldn't even consider Retina purely an esolang. It's way too useful for that. At the same time, its syntax is arcane enough that wouldn't consider it a practical production language either. So it falls somewhere in between.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#retina1&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Try it online!&lt;/strong&gt;&lt;/a&gt; (by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;) backed by the C# interpreter.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2018-01-22T11:35:44.003" LastActivityDate="2018-01-22T11:35:44.003" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6927" PostTypeId="1" CreationDate="2015-09-08T22:30:39.993" Score="1" ViewCount="72" Body="&lt;p&gt;I've only recently started getting involved on Code Golf, so excuse my ignorance, but is there a format for &lt;em&gt;longest&lt;/em&gt; possible way to achieve a challenge request? Either by runtime or by code length. Some rules I thought of for this format after browsing loopholes:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For longest runtime:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Code must have at least a theoretical possibility of termination. An example of this would be Bozo Sort: Because it is based on (pseudo-) random probability, no matter how long it takes, it has a theoretical chance of running to completion.&lt;/li&gt;&#xA;&lt;li&gt;Clock speed of the computer running the challenge must be taken into account somehow when calculating the score. Perhaps as a multiple of the actual runtime in milliseconds, or maybe OP should be responsible for timing answers on his machine if it's practical to do so.&lt;/li&gt;&#xA;&lt;li&gt;Theoretical average-case performance of an answer must be used rather than specific runs with specific data unless otherwise specified, especially if the algorithm uses an RNG. Questions where this may affect the score should specify how to time the execution of an answer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For longest length code:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All statements in the program must contribute specifically towards the completion of the challenge. Examples of invalid statements are &lt;code&gt;;&lt;/code&gt;, &lt;code&gt;noop&lt;/code&gt;, &lt;code&gt;var uselessVar;&lt;/code&gt;, a repeating chain of statements (e.g. &lt;code&gt;.split('').join('')...&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;To clarify the last point further, at no point in the program can a statement &quot;undo&quot; something that was done in another statement. This should hopefully be a given for this format.&lt;/li&gt;&#xA;&lt;li&gt;No statements can be used to alias variables or functions, unless it can be demonstrated that this is necessary to the code while satisfying these other restrictions. For example, to avoid the common scoping issue in JavaScript, &lt;code&gt;var self = this;&lt;/code&gt; is acceptable.&lt;/li&gt;&#xA;&lt;li&gt;All function and variable names declared in the program count only as 1 byte / char / stroke.&lt;/li&gt;&#xA;&lt;li&gt;All answers should be in natively written language of choice; &lt;em&gt;importing a 3rd party library violates the restriction that &quot;all statements in the program must contribute specifically towards the completion of the challenge&quot;&lt;/em&gt;. Note that this is different than importing a standard library, and in fact doing so is encouraged if a standard function exists from it which you need to complete a challenge.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Extraneous whitespace nor statement separators do not count towards the length. For example, in JavaScript if you have two statements like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;var arr;&#xA;arr = new Array();&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;neither the &lt;code&gt;;&lt;/code&gt; after &lt;code&gt;arr&lt;/code&gt; nor the newline are necessary to separate the&#xA;statements, but at least one of them is. Because of this, the length of this&#xA;snippet will be calculated after formatting it like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;var a;a=new Array()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which is to say, all extraneous characters are removed (&lt;code&gt;arr&lt;/code&gt; is shortened to &lt;code&gt;a&lt;/code&gt; due to the 4th bullet point).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There may be more applicable restrictions but I hope this at least conveys the format I'm asking about. Does something like this exist, and if not, would it be a worthwhile addition to the list of question formats?&lt;/p&gt;&#xA;" OwnerUserId="42091" LastEditorUserId="42091" LastEditDate="2015-09-08T22:38:04.363" LastActivityDate="2015-09-08T22:38:04.363" Title="Is there a question format for longest non-repeating code?" Tags="|discussion|tags|asking-questions|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="6928" PostTypeId="2" ParentId="6918" CreationDate="2015-09-09T00:12:51.837" Score="17" Body="&lt;h1&gt;Ostrich&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Ostrich is a concise language designed for both golfing and (moderate) readability. It was created by Doorknob in December 2014. The most recent release, v0.7.0, occurred in June 2015. Doorknob has since ceased development of the language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The name &quot;Ostrich&quot; comes from the (non-code) golf term which denotes some kind of ridiculously good score that has &lt;a href=&quot;https://en.wikipedia.org/wiki/Glossary_of_golf#O&quot; rel=&quot;nofollow&quot;&gt;never been achieved&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's a stack-based language with the ability to be used interactively via a REPL. It has some interesting syntactic differences from other golfing languages, such as backticks to denote strings. It has very incomplete documentation.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/KeyboardFire/ostrich-lang/releases&quot; rel=&quot;nofollow&quot;&gt;Specification and interpreter&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://ostrichproducersofontario.com/wp-content/uploads/2012/06/ostrich_fam.jpg&quot; rel=&quot;nofollow&quot;&gt;Picture of ostriches&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2015-09-09T00:12:51.837" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="6929" PostTypeId="2" ParentId="6918" CreationDate="2015-09-09T00:47:46.343" Score="33" Body="&lt;h2&gt;Snowman&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Once I &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/6928/3808&quot;&gt;tried to make a golfing language&lt;/a&gt; that was still somewhat readable, kind of like GolfScript++. Then CJam happened. So I went the opposite direction, and made an anti-golfing language that is as unreadable as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;end preamble&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/KeyboardFire/snowman-lang&quot; rel=&quot;nofollow noreferrer&quot;&gt;Snowman&lt;/a&gt; is an esolang written in C++. Its main design goal is to be as confusing as it can possibly be, while not reaching Malbolge-level and impossible to learn.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's a few example programs:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;ROT13&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;}vg:*#96nG|#110nL,bO|#64nG'(#78nL('&amp;gt;&#xA;bO,oR|:#13nA;:#109nG|#123nL,bO|#77nG&#xA;'(#91nL('&amp;gt;bO,oR|:#13nS;:#;bI;bI;aMsP&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;FizzBuzz&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;)1vn101nR:du*_/3NmO0eQ)(#5NmO0eQ&#xA;}~(~%@or(%nO?_/)#%@{%@tS?)aRsP@@&#xA;&quot;Fizz&quot;_aRsP\&quot;Buzz&quot;aRsP?)10wRsP;aE&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Snowman's code is much more elegant and efficient than Ostrich, it has &lt;em&gt;far&lt;/em&gt; more documentation, and it has much more work put into it in general. This conclusively proves that I am at my best when writing bad code. Which is probably why I'm on this site in the first place.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Snowman has 8 variables&lt;sup&gt;1&lt;/sup&gt;, arranged visually like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a b c&#xA;d   e&#xA;f g h&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It has &lt;em&gt;Variable operators&lt;/em&gt;, which are split into four categories:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Rotation operators&lt;/em&gt; rotate the values stored in certain variables. Mnemonic: they are all symbols that can be drawn with a single stroke and only straight lines. They rotate the variables you would visually expect them to; for example, the &lt;code&gt;^&lt;/code&gt; operator rotates the &lt;code&gt;d&lt;/code&gt;, &lt;code&gt;b&lt;/code&gt;, and &lt;code&gt;e&lt;/code&gt; variables.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Active variable operators&lt;/em&gt; toggle which variables are marked as &quot;active,&quot; which is important later. Mnemonic: they are all symbols that contain curvy lines. Most of them toggle what you would visually expect them to as well (ex. &lt;code&gt;(&lt;/code&gt; toggles &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;f&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are some special cases: &lt;code&gt;~&lt;/code&gt; inverts the currently active variables (mnemonic: NOT), &lt;code&gt;@&lt;/code&gt; rotates the active variables clockwise (mnemonic: GolfScript's rotate operator), &lt;code&gt;%&lt;/code&gt; reflects them across the &quot;center&quot; (mnemonic: &lt;code&gt;%&lt;/code&gt; looks like an &lt;code&gt;o&lt;/code&gt; reflected across a &lt;code&gt;/&lt;/code&gt;), &lt;code&gt;?&lt;/code&gt; sets all variables to inactive (mnemonic: &quot;forget&quot;), and &lt;code&gt;$&lt;/code&gt; saves (mnemonic: &lt;code&gt;$&lt;/code&gt;ave) and &lt;code&gt;&amp;amp;&lt;/code&gt; restores the current active variables.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Permavar operators&lt;/em&gt; have to do with &quot;permavars,&quot; which are essentially Snowman's equivalent of &quot;normal&quot; variables in other languages. &lt;code&gt;*&lt;/code&gt; stores to the currently active permavar, and &lt;code&gt;#&lt;/code&gt; restores from it. The possible permavar names are zero or more &lt;code&gt;=&lt;/code&gt;s, then either a &lt;code&gt;+&lt;/code&gt; or &lt;code&gt;!&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Literals&lt;/em&gt; are what you expect them to be. They're simply all the rest of the characters. &lt;code&gt;: ... ;&lt;/code&gt; is a literal block, &lt;code&gt;&quot; ... &quot;&lt;/code&gt; is a literal string, and any number of digits is a literal number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Speaking of data types, Snowman has four of them. It has &lt;em&gt;undefined&lt;/em&gt;, which is what all the variables are set to by default and cannot be interacted with. It has &lt;em&gt;numbers&lt;/em&gt;, which are stored as double-precision floating points. It has &lt;em&gt;blocks&lt;/em&gt;, which are simply strings of Snowman code. And finally, it has &lt;em&gt;arrays&lt;/em&gt;. There is no such thing as a &quot;string,&quot; but Snowman does have &quot;string&quot; operators. Strings are simply stored as arrays of ASCII codes.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And it has &lt;em&gt;Letter operators&lt;/em&gt;. Letter operators are composed in the following way:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;They are, as their name suggests, made of letters. They can either be two or three letters long. If they are two letters long, the first letter is lowercase; otherwise, it is uppercase.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The second letter's case determines whether to run the letter operator with the &lt;em&gt;consume&lt;/em&gt; mode. If it is the opposite of the case of the first letter, it will &lt;em&gt;consume&lt;/em&gt; its arguments, and set them to undefined. Otherwise, it will leave the arguments intact.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The third letter, if there is one, must be the opposite of the second letter's case.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For a full list of letter operators and more extensive documentation, &lt;a href=&quot;https://github.com/KeyboardFire/snowman-lang/blob/master/doc/snowman.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;see the official doc file&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I probably got a bit carried away there... but hopefully now you have an idea of how exactly the language works. (I should probably incorporate parts of this answer into the Snowman documentation itself....)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;1: This is where Snowman got its name. A snowman looks somewhat like the number &lt;code&gt;8&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2015-09-09T00:47:46.343" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="6931" PostTypeId="1" CreationDate="2015-09-09T06:33:39.513" Score="-5" ViewCount="217" Body="&lt;p&gt;It's very common for a question to leave the input format unspecified and simply let the golfer choose a 'reasonable' input format. I'd say this is a bit vague, and we should decide what can be considered reasonable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I recognize two separate categories, with subcategories (feel free to edit):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Input separation.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Input data.&lt;/strong&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Strings.&lt;/li&gt;&#xA;&lt;li&gt;Numbers.&lt;/li&gt;&#xA;&lt;li&gt;Images.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In order to organize this, post your suggested input method, &lt;strong&gt;one per answer&lt;/strong&gt;, in the following format:&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h2&gt;Category (- Subcategory) - Name&lt;/h2&gt;&#xA;  &#xA;  &lt;p&gt;This is a short description of the input method. However absurd it might be, leave your own opinion for the comments.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;-1 from me, this is just absurd. &amp;mdash; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/4162/orlp&quot;&gt;orlp&lt;/a&gt; 3 hours ago&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Then, any input method with a negative score is by default &lt;em&gt;disallowed&lt;/em&gt;. Any input method with a positive score is by default &lt;em&gt;allowed&lt;/em&gt;. Any input method not listed may or may not be reasonable, and should be confirmed by the challenge poster, and possibly added to the list.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-09-09T06:45:41.503" Title="What input forms are 'reasonable'?" Tags="|discussion|formatting|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="6934" PostTypeId="2" ParentId="6931" CreationDate="2015-09-09T06:36:34.197" Score="0" Body="&lt;h2&gt;Input separation - Newlines&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Separating input by placing newlines in between them.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastActivityDate="2015-09-09T06:36:34.197" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6935" PostTypeId="2" ParentId="6931" CreationDate="2015-09-09T06:37:59.740" Score="0" Body="&lt;h2&gt;Input separation - Any combination of reasonable separations.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Separating input by using any combination of other reasonable separations. For example, using both newlines and spaces:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3 &quot;test&quot;&#xA;5 &quot;cool&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="4162" LastActivityDate="2015-09-09T06:37:59.740" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6937" PostTypeId="2" ParentId="2140" CreationDate="2015-09-09T06:43:35.740" Score="1" Body="&lt;h2&gt;Find all matchings &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Golf &lt;a href=&quot;https://stackoverflow.com/q/32438350&quot;&gt;this SO question&lt;/a&gt; in any language. Fewest bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Given two equal-size sets of positive integers,&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A={3,1,5}&#xA;B={2,4,3}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;a matching pairs up elements from each set, like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{(5, 2), (1, 4), (3, 3)}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There's one matching for each permutation of &lt;code&gt;n&lt;/code&gt; elements, where &lt;code&gt;n&lt;/code&gt; is the size. Your goal is to print or return all the matchings.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{(3, 2), (1, 4), (5, 3)}&#xA;{(3, 2), (1, 3), (5, 4)}&#xA;{(1, 2), (3, 4), (5, 3)}&#xA;{(1, 2), (5, 4), (3, 3)}&#xA;{(5, 2), (3, 3), (1, 4)}&#xA;{(3, 4), (1, 3), (5, 2)}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; Two nonempty equal-size collections (lists, arrays, sets) of positive integers. Numbers won't repeat within a collection, but may overlap between them. If your collection is ordered, you may assume it to be sorted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt; Print or return all possible matchings. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each matchings must appear exactly once, in any order. They must be somehow grouped or separated, so you can tell where each one beings and ends. These rules also apply to the pairs in each matching.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Banned:&lt;/strong&gt; Built-ins that generate matchings or permutations.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2015-09-09T19:55:51.090" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6938" PostTypeId="2" ParentId="6931" CreationDate="2015-09-09T06:45:41.503" Score="1" Body="&lt;h2&gt;Input data - Numbers - Scientific notation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Reading a number encoded in scientific notation. E.g.: &lt;code&gt;2.321e21&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastActivityDate="2015-09-09T06:45:41.503" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6939" PostTypeId="2" ParentId="6918" CreationDate="2015-09-09T09:03:21.123" Score="20" Body="&lt;h1&gt;Labyrinth&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Labyrinth was created by me, Martin Büttner, in August 2015.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is two-dimensional stack-based programming language, in which programs resemble mazes. It operates on two stacks of signed arbitrary-precision integers. Control flow is determined by the layout of the maze - whenever the instruction pointer hits a junction it decides which way to take based on the top of the main stack.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Labyrinth also comes with a unique form of source code manipulation (at runtime): the four commands &lt;code&gt;&amp;gt;^&amp;lt;v&lt;/code&gt; cyclically shift a single row or column by one cell. This mechanic was inspired by the German board game &lt;a href=&quot;https://en.wikipedia.org/wiki/Labyrinth_(board_game)&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;Das verrückte Labyrinth&lt;/em&gt;&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The language is pretty much feature complete, except that I'm still thinking about assigning some function to the unused characters &lt;code&gt;[&lt;/code&gt; and &lt;code&gt;]&lt;/code&gt;. Suggestions are very welcome!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Despite fairly simple (and usable) mechanics, the language turns out to be quite interesting to golf.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/mbuettner/labyrinth&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;GitHub repository&lt;/strong&gt;&lt;/a&gt;. Includes interpreter (Ruby), language specification, example programs and issue tracker.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://esolangs.org/wiki/Labyrinth&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Esolangs page&lt;/strong&gt;&lt;/a&gt;. Largely a copy of the README.md on GitHub.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#labyrinth&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Try it online!&lt;/strong&gt;&lt;/a&gt; (by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;) backed by the Ruby interpreter.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="69850" LastEditDate="2017-10-28T08:23:23.493" LastActivityDate="2017-10-28T08:23:23.493" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="6940" PostTypeId="2" ParentId="6915" CreationDate="2015-09-09T09:34:04.600" Score="18" Body="&lt;p&gt;Unless the challenge explicitly asks for a named function &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1503/8478&quot;&gt;unnamed functions are completely legitimate&lt;/a&gt;. That means you don't count the assignment either. So your example&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;f=x=&amp;gt;x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;would be four bytes, and I wouldn't even include &lt;code&gt;f=&lt;/code&gt; in the post, so that it's clear how I've counted.&lt;/p&gt;&#xA;&lt;p&gt;What if there are two functions? That depends. If the questions actually asks for two functions (e.g. a decoder and an encoder), count them separately just like you would count a single function. This means that neither assignment would be counted. For instance, if your two submissions were&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;f=x=&amp;gt;x*x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;g=x=&amp;gt;sqrt(x)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;I'd count that as &lt;code&gt;6 + 10 = 16&lt;/code&gt;. Again I would not actually write &lt;code&gt;f=&lt;/code&gt; and &lt;code&gt;g=&lt;/code&gt; in the post.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;However&lt;/em&gt;, if you define one function to be used in another, like you did in your example, then the first assignment definitely needs to be counted. Your &lt;code&gt;f&lt;/code&gt; wouldn't work without the assignment, because it references &lt;code&gt;g&lt;/code&gt; by name. So I would count the assignment to &lt;code&gt;g&lt;/code&gt; but not the assignment to &lt;code&gt;f&lt;/code&gt;. I would present the solution like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;g=x=&amp;gt;x/2&#xA;x=&amp;gt;g(x)+g(x)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and therefore count it as 21 bytes.&lt;/p&gt;&#xA;&lt;p&gt;Likewise, if a function is recursive, you must also count the assignment:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;f=x=&amp;gt;x&amp;amp;&amp;amp;f(x-1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Would count as 14 bytes since the function wouldn't work unless &lt;code&gt;f&lt;/code&gt; was defined.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="91213" LastEditDate="2023-02-02T08:57:31.470" LastActivityDate="2023-02-02T08:57:31.470" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="6941" PostTypeId="2" ParentId="6918" CreationDate="2015-09-09T09:38:45.003" Score="3" Body="&lt;p&gt;In my questions &lt;a href=&quot;https://codegolf.stackexchange.com/q/1864/194&quot;&gt;Simulate a Minsky Register Machine (I)&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/q/3897/194&quot;&gt;Simulate a Minsky Register Machine (II)&lt;/a&gt; I define essentially two versions of a programming language which is just a textual representation of MRMs. The intention was already to build towards version (III), which would add macros with unification. I'm also thinking about adding some additional I/O and arithmetic operations.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2015-09-09T09:38:45.003" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="6942" PostTypeId="2" ParentId="2140" CreationDate="2015-09-09T11:51:52.517" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/57597/cake-its-somebodys-birthday&quot;&gt;Cake&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Concerns:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strike&gt;I'm not sure how well single language questions do. It automatically limits the question to those that already know the language, and those that are willing to learn just for this question.&lt;/strike&gt; There's no need to limit to Chef with some of the magic this community can produce!&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&quot;selfish/demanding&quot; sounds quite strong and could sound like a bit of a personal attack on Beta Decay. It certainly isn't intended like that, and I expect it will be accepted as intended, but is it better to err on the side of caution?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="15394" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.127" LastActivityDate="2015-09-11T10:52:35.697" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="6943" PostTypeId="2" ParentId="6918" CreationDate="2015-09-09T11:59:59.860" Score="17" Body="&lt;h1&gt;&lt;a href=&quot;http://esolangs.org/wiki/Sclipting&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sclipting&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This language, invented by me (Timwi), was intended for codegolf; it’s like Golfscript, but uses Chinese characters for the instructions and Korean characters for literal strings/numbers. Most people don’t like it because most people score by bytes, not characters, and so GolfScript/CJam/Pyth still tend to win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example: Hello, World!&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;낆녬닆묬긅덯댦롤긐&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Another example: &lt;a href=&quot;https://codegolf.stackexchange.com/a/19664/668&quot;&gt;&lt;em&gt;Love calculation&lt;/em&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="668" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-02-26T16:35:44.377" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="6944" PostTypeId="2" ParentId="6918" CreationDate="2015-09-09T12:12:00.640" Score="57" Body="&lt;h1&gt;Funciton&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(&lt;a href=&quot;http://esolangs.org/wiki/Funciton&quot; rel=&quot;nofollow noreferrer&quot;&gt;esolangs&lt;/a&gt; • &lt;a href=&quot;https://github.com/Timwi/Funciton&quot; rel=&quot;nofollow noreferrer&quot;&gt;interpreter&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Created by me and my personal favourite. This is a 2D language that uses Unicode box-drawing characters to create programs that resemble flowcharts, but the semantics are actually closer to that of a functional language than an actual flowchart. It has only five built-in operations (NAND, shift-left, less-than, function invocation and lambda expressions) and only one datatype (the arbitrary-size integer) and all the useful functions are implemented in terms of this. There is an entire library of functions for arithmetic, string handling, lists and lazy-evaluated sequences.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example: The Factorial Function&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;                   ╓───╖&#xA;                   ║ ! ║&#xA;                   ╙─┬─╜   ┌───╖  ╔═══╗&#xA;               ┌─────┴─────┤ &amp;gt; ╟──╢ 2 ║&#xA;               │           ╘═╤═╝  ╚═══╝&#xA; ╔════╗  ┌───╖ │             │&#xA; ║ −1 ╟──┤ + ╟─┴─┐           │&#xA; ╚════╝  ╘═╤═╝   │           │&#xA;         ┌─┴─╖   │    ╔═══╗  │&#xA;         │ ! ║   │    ║ 1 ║  │&#xA;         ╘═╤═╝   │    ╚═╤═╝  │&#xA;           │   ┌─┴─╖  ┌─┴─╖  │&#xA;           │   │ × ╟──┤ ? ╟──┘&#xA;           │   ╘═╤═╝  ╘═╤═╝&#xA;           └─────┘      │&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Another example where I actually tried to &lt;em&gt;golf&lt;/em&gt; in this language: &lt;a href=&quot;https://codegolf.stackexchange.com/a/2499/668&quot;&gt;&lt;em&gt;Render “Digital Clock Style” Numbers&lt;/em&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="668" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2015-12-14T03:12:02.603" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="6945" PostTypeId="2" ParentId="6918" CreationDate="2015-09-09T12:14:13.700" Score="32" Body="&lt;h1&gt;&lt;a href=&quot;http://esolangs.org/wiki/Ziim&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ziim&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A 2D language created by me (Timwi) consisting entirely of arrows (&lt;code&gt;← ↖ ↑&lt;/code&gt; etc., &lt;code&gt;↔ ⤡&lt;/code&gt; etc.). The semantics are highly concurrent. Programming simple things is extremely laborious, both because of the limited instruction set and because of the need for thread synchronization constructs. Since most systems don’t have the necessary monoscape font for all of these arrows to line up, here’s &lt;em&gt;Hello, World!&lt;/em&gt; in Ziim as an image:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/BXUv8.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/BXUv8.png&quot; alt=&quot;Hello, World! in Ziim&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="668" LastActivityDate="2015-09-09T12:14:13.700" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="6946" PostTypeId="2" ParentId="6918" CreationDate="2015-09-09T12:19:35.830" Score="63" Body="&lt;h1&gt;&lt;a href=&quot;http://esolangs.org/wiki/Mornington_Crescent&quot; rel=&quot;nofollow noreferrer&quot;&gt;Mornington Crescent&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A joke language I (Timwi) created based on &lt;a href=&quot;https://en.wikipedia.org/wiki/Mornington_Crescent_%28game%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;Mornington Crescent&lt;/em&gt; from &lt;em&gt;I'm Sorry I Haven't a Clue&lt;/em&gt;&lt;/a&gt;. The program is executed by moving from station to station on the London Underground, starting and ending at Mornington Crescent. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/8478&quot;&gt;Martin&lt;/a&gt; wrote a &lt;a href=&quot;https://codegolf.stackexchange.com/a/57064/30525&quot;&gt;“Hello, World!”&lt;/a&gt; and a &lt;a href=&quot;https://codegolf.stackexchange.com/a/58257/668&quot;&gt;primality checker&lt;/a&gt; in this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Ly22S.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Ly22S.png&quot; alt=&quot;Location of Mornington Crescent on the London Tube&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="668" LastEditorUserId="34718" LastEditDate="2019-09-17T16:13:02.420" LastActivityDate="2019-09-17T16:13:02.420" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="6947" PostTypeId="2" ParentId="5842" CreationDate="2015-09-09T18:58:00.000" Score="2" Body="&lt;h1&gt;References List&lt;/h1&gt;&#xA;&lt;p&gt;This would be a simple post containing go-to (pun intended) references for users. These could include and not be limited to the following: websites for esoteric programming languages, tutorials, online interpreters, helpful meta posts, etc.&lt;/p&gt;&#xA;&lt;h3&gt;List in progress:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://esolangs.org/wiki/Main_Page&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolang&lt;/a&gt; (languages)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://rosettacode.org/wiki/Rosetta_Code&quot; rel=&quot;nofollow noreferrer&quot;&gt;Rosetta Code&lt;/a&gt; (languages)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://ideone.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ideone&lt;/a&gt; (interpreters)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://repl.it/languages&quot; rel=&quot;nofollow noreferrer&quot;&gt;Repl.it&lt;/a&gt; (interpreters)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/6947/34718&quot;&gt;Go-to List of Helpful References :D&lt;/a&gt; (meta post)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-09-09T18:58:00.000" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6949" PostTypeId="2" ParentId="6918" CreationDate="2015-09-10T12:42:08.410" Score="19" Body="&lt;h1&gt;Marbelous&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Marbelous was (to my knowledge) the first language created as a collaborative effort between several PPCG users. The &lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=16935076#16935076&quot;&gt;original idea&lt;/a&gt; is due to &lt;a href=&quot;https://codegolf.stackexchange.com/users/13702/cjfaure?tab=profile&quot;&gt;cjfaure&lt;/a&gt; (then known as Trimsty). It was then picked up by several other users, fleshed out and implemented. This group of users included &lt;a href=&quot;https://codegolf.stackexchange.com/users/20198/nathan-merrill&quot;&gt;Nathan Merrill&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/29588/overactor&quot;&gt;overactor&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/4787/sparr&quot;&gt;Sparr&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/20283/trichoplax&quot;&gt;trichoplax&lt;/a&gt; (then known as githubphagocyte), &lt;a href=&quot;https://codegolf.stackexchange.com/users/29611/es1024&quot;&gt;es1024&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/26981/visualmelon&quot;&gt;VisualMelon&lt;/a&gt; and myself, Martin Büttner (sorry if I forgot anyone; just let me know and I'll add you).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The name of the language is (obviously) a pun on &quot;marbles&quot; and &quot;marvelous&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Marbelous is a two-dimensional language, where the code represents a vertical board of &quot;devices&quot;, where marbles (representing byte values) fall down the board and are modified by the devices. Each cell of the board is represented by &lt;em&gt;two&lt;/em&gt; characters. Devices are essentially functions which take input from above and produce output to the sides and below. It is also possible to define your own devices as separate boards, which makes Marbelous comparably usable (some of the original authors have written libraries, e.g. for 32-bit arithmetic).&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/marbelous-lang/docs&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;GitHub repository for docs&lt;/strong&gt;&lt;/a&gt;. Includes language specification and a few examples.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/marbelous-lang/marbelous.py&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;GitHub repository for original Python interpreter&lt;/strong&gt;&lt;/a&gt;. Written by Sparr. Includes many more examples.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/40073/making-future-posts-runnable-online-with-stack-snippets/40808#40808&quot;&gt;&lt;strong&gt;JavaScript interpreter in the form of a Stack Snippet&lt;/strong&gt;&lt;/a&gt;. Written by es1024. Includes graphical output features.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://chat.stackexchange.com/transcript/16230/2014/8/5&quot;&gt;&lt;strong&gt;Marbelous chat room&lt;/strong&gt;&lt;/a&gt;, where most of the discussion about the design of the language happened (now frozen).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2015-09-10T12:42:08.410" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="6950" PostTypeId="2" ParentId="5842" CreationDate="2015-09-10T13:48:49.130" Score="3" Body="&lt;p&gt;This post seems contradictory. The first paragraph says that many problems are hard, and seems to imply we should have an intro to &lt;em&gt;golfing&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The second says we should give them an intro to &lt;em&gt;PPCG&lt;/em&gt; (the site), not necessarily golfing. These are two very different tasks. Most answers seem to be responding to the first (intro to golfing in general), so I'll address the second:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Therefore, we need a way of getting new users used to the way PPCG works, and how to correctly write programs which answer the question.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It's hard to accurately judge my biases, but I believe that there are more bad first time &lt;em&gt;questions&lt;/em&gt; than &lt;em&gt;answers&lt;/em&gt;. If you want to get them used to &quot;the way it works here&quot;, I think you're focusing on the wrong area.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the spec is written clearly and well, you typically get mostly decent answers, even from new users. They may trip on the rules a bit and need a comment to clarify, but that could happen on an answer to &lt;em&gt;any&lt;/em&gt; question, whether it's &quot;Hello, World!&quot; or something harder. This is (almost) completely unrelated to challenge difficulty.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Writing your first question is much different. Those quite often get voted down and closed rather quickly, and I see a lot more &quot;hurt feelings&quot; comments from the OP than is typical on an answer where they didn't count bytes in the proper way, for example.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2015-09-10T13:48:49.130" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="6953" PostTypeId="2" ParentId="2140" CreationDate="2015-09-10T20:40:35.960" Score="1" Body="&lt;h1&gt;Blastoff&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your goal is the create the following text output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;10 9 8 7 6 5 4 3 2 1 Blastoff!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The &amp;quot;&lt;code&gt;10 &lt;/code&gt;&amp;quot; will be generated by the following C program:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#include &amp;lt;stdio.h&amp;gt;&#xA;int main(){printf(&amp;quot;10 &amp;quot;);}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The &amp;quot;&lt;code&gt;9 &lt;/code&gt;&amp;quot; will then be generated by a function in a different language of your choice; the &amp;quot;&lt;code&gt;8 &lt;/code&gt;&amp;quot; by a function in a different language; and so on until the last function generates &amp;quot;&lt;code&gt;Blastoff!&lt;/code&gt;&amp;quot;.  Each function will take as input the complete source code of the previous step in the form of a string and output the next number in the sequence and a space (or the string &amp;quot;Blastoff!&amp;quot;).&lt;/p&gt;&#xA;&lt;p&gt;Each function must &amp;quot;do something meaningful&amp;quot; with the input.   Doing something meaningful is defined to mean that the output will vary based on the input.  That is, ignoring the input or trivially using it (e.g. making it evaluate as 0 no matter what comes in and then adding the needed number) fails to meet the challenge.&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;A contestants base score will be the sub-total of the byte-length of all 10 functions.  To encourage creativity, the base score will then be divided by the number of different techniques used to generate the output.  For example, &amp;quot;string splitting&amp;quot;, &amp;quot;character count&amp;quot;, &amp;quot;bitwise and&amp;quot;, etc.  The technique of each function is defined as first thing done to the input string other than assignment to a variable.&lt;/p&gt;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&lt;p&gt;The following Perl code illustrates how a &amp;quot;&lt;code&gt;9 &lt;/code&gt;&amp;quot; can be generated:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;nine('#include &amp;lt;stdio.h&amp;gt;&#xA;int main(){printf(&amp;quot;10 &amp;quot;);}');&#xA;&#xA;sub nine{&#xA; @a=split(/&amp;quot;/,$_[0]);&#xA; print $a[1]-1 .&amp;quot; &amp;quot;;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here, the function nine() takes the source code of the C program and manipulates it to get the number 9, then adds a space to the printed output.  For scoring purposes, only the subroutine counts - the additional code was added for illustration purposes only and need not be listed on an entry in general.  The input string for the next function will start with the &amp;quot;s&amp;quot; in &amp;quot;sub&amp;quot; and go through the final &amp;quot;}&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;The score for this function is thus 54 (including the actually unnecessary CRs and spaces).  The technique used here is string splitting.  An entry that included this code would thus look like this:&lt;/p&gt;&#xA;&lt;h2&gt;9: Perl&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;sub nine{&#xA; @a=split(/&amp;quot;/,$_[0]);&#xA; print $a[1]-1 .&amp;quot; &amp;quot;;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Score:&lt;/strong&gt; 54&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Technique:&lt;/strong&gt; String split&lt;/p&gt;&#xA;&lt;h2&gt;8: Ruby&lt;/h2&gt;&#xA;&lt;p&gt;...&lt;/p&gt;&#xA;&lt;h2&gt;Total&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Base score:&lt;/strong&gt; (54 + ... ) = 512&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Unique techniques:&lt;/strong&gt; 8&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Final score:&lt;/strong&gt; (512 / 8) = 64&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Meta comments:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The goal of the rules is to 1) avoid trivial solutions and 2) encourage thinking about the next step while writing the current one.  If the rules need to be added to enhance either aim, let me know.&lt;/li&gt;&#xA;&lt;li&gt;Is ten functions too many?  I could start the count at 5 if that seems better&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="44766" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-09-10T20:48:14.753" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="6954" PostTypeId="2" ParentId="5343" CreationDate="2015-09-10T21:15:57.283" Score="-12" Body="&lt;p&gt;Is this still open? I'm not sure what the rules are on meta policy polls, and I don't think anyone's suggested this alternative:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think that unary should only be forbidden if parsing decimal numbers using built-in functions is forbidden for languages that have them. If working with decimal numbers as strings is an explicit part of the challenge, that should be, well, explicit. Questions that specify decimal input but don't forbid e.g. atoi or int.Parse should be assumed to be sloppily worded.&lt;/p&gt;&#xA;" OwnerUserId="1767" LastActivityDate="2015-09-10T21:15:57.283" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6955" PostTypeId="2" ParentId="6918" CreationDate="2015-09-10T21:40:01.393" Score="10" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/dloscutoff/pip&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pip&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;A golfing language created by DLosc (me), first published in April 2015.&lt;/p&gt;&#xA;&lt;p&gt;Pip is a procedural language with infix operators. It is designed to be terse but still familiar to those who know C-like languages. For instance, it shouldn't be too difficult to see why this code:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Fi1,6Pi*i&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;prints the squares of the numbers 1 through 5.&lt;sup&gt;1&lt;/sup&gt; Pip also borrows ideas from array-based and functional programming languages.&lt;/p&gt;&#xA;&lt;p&gt;Some interesting features of Pip:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Numbers and strings are the same data type, Scalar. This can become a pain occasionally, but makes for a lot less typecasting and &lt;a href=&quot;https://codegolf.stackexchange.com/a/51595/16766&quot;&gt;sometimes has neat applications&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Many operators work itemwise on lists. For instance, &lt;code&gt;[1;2;3]+[4;5;6]&lt;/code&gt; gives &lt;code&gt;[5;7;9]&lt;/code&gt;, and &lt;code&gt;&amp;quot;a&amp;quot;.[1;2;3]&lt;/code&gt; gives &lt;code&gt;[&amp;quot;a1&amp;quot;;&amp;quot;a2&amp;quot;;&amp;quot;a3&amp;quot;]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;By default, the contents of lists are concatenated together before printing, but there are a bunch of &lt;a href=&quot;https://github.com/dloscutoff/pip/blob/master/Documentation/Command-line%20flags.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;command-line flags&lt;/a&gt; that allow for different formats.&lt;/li&gt;&#xA;&lt;li&gt;Regular expressions are built in, with &lt;a href=&quot;https://codegolf.stackexchange.com/a/241068/16766&quot;&gt;a few interesting ways&lt;/a&gt; to shorten certain patterns.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Updates are irregular but ongoing; ideas and contributions are welcome!&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://github.com/dloscutoff/pip&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github repository&lt;/a&gt;&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://dloscutoff.github.io/pipdoc&quot; rel=&quot;nofollow noreferrer&quot;&gt;Official documentation&lt;/a&gt;&lt;/strong&gt;. Keep this handy when programming, particularly the operator precedence page.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://github.com/dloscutoff/pip/wiki&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tutorial&lt;/a&gt;&lt;/strong&gt;. Still very incomplete, but a good place for beginners to start.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Online interpreters:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://ato.pxeger.com/run?L=pip&quot; rel=&quot;nofollow noreferrer&quot;&gt;Attempt This Online!&lt;/a&gt;&lt;/strong&gt; Last updated in 2022 (version 1.0.2).&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://dso.surge.sh/#pip&quot; rel=&quot;nofollow noreferrer&quot;&gt;Do Stuff Online&lt;/a&gt;&lt;/strong&gt;. Up to date with the latest commit. Runs programs client-side, which means infinite loops will hang your browser.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://tio.run/#pip&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt;&lt;/strong&gt; Last updated in 2018 (version 0.18 aka Pip Classic).&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://replit.com/@dloscutoff/pip&quot; rel=&quot;nofollow noreferrer&quot;&gt;Replit&lt;/a&gt;&lt;/strong&gt;. Up to date with the latest commit; unlike the others, uses a REPL interface and doesn't support permalinks.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt;&lt;sub&gt;Although, the code &lt;code&gt;SQ\,5&lt;/code&gt; with the &lt;code&gt;-n&lt;/code&gt; flag does the same thing in 5 bytes instead of 9. But that's a bit less obvious.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="16766" LastEditDate="2022-06-28T22:28:22.567" LastActivityDate="2022-06-28T22:28:22.567" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="6956" PostTypeId="1" CreationDate="2015-09-10T22:45:09.113" Score="17" ViewCount="1151" Body="&lt;p&gt;So, we have this question&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/57549/15599&quot;&gt;Work it harder, make it better&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Put on hold as a duplicate of this question&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/6043/15599&quot;&gt;We&amp;#39;re no strangers to code golf, you know the rules, and so do I&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now there have been many song lyrics on here which I would agree do not add anything to the rickroll, but this latest question is an exception. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Looking around, there are a handful of songs that have scraped through:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/4191/15599&quot;&gt;12 Days of Christmas Lyrics&lt;/a&gt; (even though the numbers were required to be output in words)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/34540/15599&quot;&gt;Print the lyrics to &amp;quot;Twinkle Twinkle Little Star&amp;quot;&lt;/a&gt; (music also required)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And some that haven't (much as I like the first of these, I have to agree that, in this case, it didnt add anything new)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/31473/15599&quot;&gt;What a wonderful world&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/51156/15599&quot;&gt;Isn&amp;#39;t It Ironic? A Little Too Ironic?&lt;/a&gt; (for some reason closed not as a duplicate of the rickroll, but of &lt;a href=&quot;https://codegolf.stackexchange.com/q/40206/15599&quot;&gt;Write lines in detention&lt;/a&gt; )&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, once and for all, what kinds of song lyrics are / are not a duplicate of the rickroll?&lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2015-09-12T13:29:42.493" Title="Trigger happy on the duplicate button: do we really consider all song lyric questions &quot;duplicates of the rickroll?&quot;" Tags="|discussion|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="6957" PostTypeId="2" ParentId="6956" CreationDate="2015-09-10T22:48:26.750" Score="18" Body="&lt;p&gt;There are many song lyrics questions that are indeed a duplicate of the rickroll (the recently deleted Australian national anthem is another example.) On the other hand there are some that aren't.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To me, songs that require numbers to be calculated / displayed in a different way to other questions are definitely not duplicates of the rickroll.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, this latest question &quot;Work it harder, make it better&quot; is not a duplicate of the rickroll, because the entire lyric is composed of the following paragraph, repeated with various omissions and, uniquely, rearrangements.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Work It Harder Make It Better&#xA;Do It Faster, Makes Us stronger&#xA;More Than Ever Hour After&#xA;Our Work Is Never Over&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It was closed very rapidly as a duplicate of the rickroll, and, less than an hour later, has three reopen votes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Before close voting I always read questions in their entirety, to be sure, and I suggest we should all do the same. Rather than close voting a song lyric question because it's &quot;just a duplicate of the rickroll&quot;, in this case it makes more sense to upvote, precisely because the OP has found a song that &lt;em&gt;isn't&lt;/em&gt; just a duplicate of the rickroll.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;EDIT: I'm disappointed that many answers to &quot;work it harder make it better&quot; have followed similar techniques to the rickroll, instead of taking full advantage of the structure of this particular text. Nevertheless the opportunity was and is there, so I feel it should stay open. To illustrate this, my own answer in Ruby is currently in second place (behind Peter Taylor's Golfscript answer) as a result of taking advantage of the strong patterns applicable to this particular song.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think we can draw a parallel with ASCII art, where it's important that there is some kind of pattern (not too simple, but not too random.) Compression of text without a pattern is not interesting, as it relies on standard techniques. But a text like &quot;Work it harder, make it better&quot; has sufficient pattern to it to benefit from non standard text-compression techniques. And this is the critera we should apply to similar questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, just I would hate to see us closing ASCII art questions, I would hate to see us closing &lt;em&gt;those text compression questions whose structure means they can benefit from non-standard text compression techniques.&lt;/em&gt; To be clear, if it's a straight text with no pattern I would agree with closing it. But let's keep an eye out for patterns before we close.&lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="15599" LastEditDate="2015-09-12T13:29:42.493" LastActivityDate="2015-09-12T13:29:42.493" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="6959" PostTypeId="1" AcceptedAnswerId="6963" CreationDate="2015-09-11T00:03:43.850" Score="1" ViewCount="127" Body="&lt;p&gt;I am asking about my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/57566/test-code-in-bytes-interrupt-handler-call-serializator&quot;&gt;this&lt;/a&gt; question for reopen - or an explanation if it is still offtopic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A further problem what I can see, that - although it is not language-specific -, the question effectively still reduces the usable languages to the hardware-near, C-like procedural solutions. As I can see, many of you like more esoteric, interpreted languages. But it is not mentioned in the help center.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another possible problem is, that this is a hard problem. I couldn't sleep a week long until I've found a solution. On my opinion, already to find a solution is enough hard, optimizing it to the fewest bytes isn't a really comparable challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But, from the other side, it was the most interesting problem I've meet in years ago. Maybe it is not really &quot;code golf&quot; (in the sense of tricky &amp;amp; funny code optimizing), but surely a very interesting &quot;programming puzzle&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would most like to use the following winning criterion: &quot;Winner is anybody who finds a solution&quot;. In the (imho) highly improbable case if there are multiple working solutions, then I would say the first is the winner.&lt;/p&gt;&#xA;" OwnerUserId="14149" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2022-10-02T13:22:20.980" Title="Objective winning criteria added, may I ask for reopen?" Tags="|discussion|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="6960" PostTypeId="2" ParentId="6956" CreationDate="2015-09-11T10:24:53.037" Score="5" Body="&lt;p&gt;Being a song or not has nothing to do with it. Basic &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; has been done to death, and new &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; questions which just take an English text will just attract a bunch of answers using the same techniques as the existing ones.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To take the specific example mentioned, the &quot;Work it better&quot; lyric is ideally suited to the grammar-based techniques which were used in many of the answers to the rickroll. I don't see any evidence that it adds anything to the site.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2015-09-11T10:24:53.037" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="6961" PostTypeId="1" CreationDate="2015-09-11T14:22:50.423" Score="7" ViewCount="228" Body="&lt;p&gt;I'm wondering if there should be a tag for questions that compile a list of best score by language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A recent example is &lt;a href=&quot;https://codegolf.stackexchange.com/q/57617/34718&quot;&gt;this question&lt;/a&gt;. Questions similar to this have a snippet the keeps a list of the shortest solution by programming language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it'd be useful to have such a tag, in order to find challenges to add your new language's solution to, for example.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2015-11-20T12:41:46.370" Title="Should there be a [catalog] tag (e.g. shortest in every language)?" Tags="|discussion|tags|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6962" PostTypeId="2" ParentId="6961" CreationDate="2015-09-11T14:26:58.580" Score="6" Body="&lt;p&gt;No there shouldn't be a tag. They aren't really different from a normal challenge, except that they focus on simple/standard programming exercises and explicitly ask for answers in non-competitive languages. That makes the tag seem very much like a rather arbitrary meta tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would be in favour of collecting them somewhere though (e.g. in a meta post). &lt;strong&gt;Edit:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7225/8478&quot;&gt;This has been done.&lt;/a&gt; (And will be amended with an overview snippet some time soon.) For more arguing why we shouldn't treat catalogues any different from normal challenges, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7494/8478&quot;&gt;see this answer&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-11-18T21:27:55.563" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="6963" PostTypeId="2" ParentId="6959" CreationDate="2015-09-11T15:34:26.647" Score="3" Body="&lt;p&gt;It is not usually necessary to request that a question be reopened: editing a closed question automatically puts it into a review queue. However, all three people who reviewed it voted to leave it closed.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I am asking ... [for] an explanation if it is still offtopic.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Although on a plain meaning of the words you could argue that &quot;First answer&quot; is an objective winning condition, it is not generally accepted as such for the purposes of being on-topic on this site. As I pointed out in comments, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/941/new-challenge-type-speed-code&quot;&gt;a previous question&lt;/a&gt; about this win condition met with a strong negative response. The best solution would be to find an objective win condition which is intrinsic to the code: length, memory usage, ...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's no guarantee that even after such a modification the question would be reopened. I personally think that to be sufficiently specified to be worth attempting an answer it needs more details about the CPU and memory models, so that answerers know whether they need to reason through the effects of pipelining, caching, etc.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2015-09-11T15:34:26.647" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="6964" PostTypeId="2" ParentId="2140" CreationDate="2015-09-11T15:53:26.560" Score="0" Body="&lt;h1&gt;Oh dear, bad CSS! &lt;em&gt;or&lt;/em&gt; How to Properly Format CSS™&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/css&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;css&amp;#39;&quot; rel=&quot;tag&quot;&gt;css&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Please give me any improvements/suggestions you may think of.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal is to write a short function to Properly Format CSS™; you must Properly Convert Spaces To Tabs™ and format the CSS nicely.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Bad CSS™&lt;/h2&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-css prettyprint-override&quot;&gt;&lt;code&gt;div&amp;gt; *&#xA;{&#xA;  padding: 10px;&#xA;     margin: 1em;&#xA;    -webkit-border-radius: 10px 2px 100%; border-radius:10px 2px 100%;&#xA;       border: 2px solid yellow;margin: 1rem;&#xA;-moz-border-radius:10px 2px 100%}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Proper CSS™&lt;/h2&gt;&#xA;&#xA;&lt;pre class=&quot;lang-css prettyprint-override&quot;&gt;&lt;code&gt;div &amp;gt; * {&#xA;---&amp;gt;border: 2px solid yellow;&#xA;---&amp;gt;-webkit-border-radius: 10px 2px 100%;&#xA;---&amp;gt;   -moz-border-radius: 10px 2px 100%;&#xA;---&amp;gt;        border-radius: 10px 2px 100%;&#xA;---&amp;gt;margin: 1em;&#xA;---&amp;gt;margin: 1rem;&#xA;---&amp;gt;padding: 10px;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;A tab is represented by &lt;code&gt;---&amp;gt;&lt;/code&gt;, as you can't embed tabs properly on StackExchange.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All the properties are sorted alphabetically, and nicely formatted (please also note that the order of the properties &lt;strong&gt;can&lt;/strong&gt; be important, such as in the case of &lt;code&gt;margin: 1em; ... margin: 1rem;&lt;/code&gt;. The selector is also nicely formatted.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Format&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Format the selector with spaces around every token&lt;/li&gt;&#xA;&lt;li&gt;A space; a left curly brace (&lt;code&gt;{&lt;/code&gt;); a newline&lt;/li&gt;&#xA;&lt;li&gt;One tab; optional spaces (see below); the property name; a colon; a space; the tokens, separated by single spaces &lt;sup&gt;&lt;em&gt;how do I define token?&lt;/em&gt;&lt;/sup&gt; (replace &lt;code&gt;0&lt;i&gt;{unit}&lt;/i&gt;&lt;/code&gt; with &lt;code&gt;0&lt;/code&gt;); a semi-colon; a new line&lt;/li&gt;&#xA;&lt;li&gt;A newline; a right curly brace (&lt;code&gt;}&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Property sorting&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Sort the properties alphabetically, ignoring prefixes. Then list each prefix for the property specified in the original CSS, starting with the longest, down to the shortest (i.e., none), adding spaces before the property name to pad the shorter prefixes to the longest prefix.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The same property may appear more than once; keep each variant in the original order, as in the example.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You may not use any built-in CSS parsers and/or formatters.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are disallowed.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Bonuses&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;strong&gt;-100&lt;/strong&gt; bonus if the function can also format psuedo-classes and elements properly (e.g. &lt;code&gt;p &amp;gt;a::before&lt;/code&gt; to &lt;code&gt;p &amp;gt; a::before&lt;/code&gt; and &lt;code&gt;p&amp;gt;a:visited&lt;/code&gt; to &lt;code&gt;p &amp;gt; a:visited&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;-50&lt;/strong&gt; bonus if you change &lt;code&gt;:after&lt;/code&gt; and &lt;code&gt;:before&lt;/code&gt; to the new, two-colon syntax (&lt;code&gt;::after&lt;/code&gt; and &lt;code&gt;::before&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The task is to provide a function to format (correct) some CSS (provided as a parameter) as specified above, not a fully-featured CSS parser – but you get a &lt;strong&gt;-1000&lt;/strong&gt; bonus if the code is a fully-featured, forwards-compatible CSS3 parser! :)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; function parameter or STDIN.&lt;br&gt;&#xA;&lt;strong&gt;Output:&lt;/strong&gt; function return value or STDOUT.&lt;br&gt;&#xA;No output to STDERR.&lt;/p&gt;&#xA;" OwnerUserId="15022" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:49.320" LastActivityDate="2015-09-11T22:20:57.320" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6965" PostTypeId="2" ParentId="2447" CreationDate="2015-09-11T18:20:15.727" Score="-29" Body="&lt;h1&gt;Output is saved in a certain variable at the time the program has finished execution&lt;/h1&gt;&#xA;&lt;p&gt;This eliminates the disadvantages languages like Java have when printing &lt;code&gt;System.out.println(&amp;quot;asdf&amp;quot;)&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;For languages without variables this could be top of the stack etc...&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-09-11T18:20:15.727" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="6966" PostTypeId="1" CreationDate="2015-09-11T21:36:46.493" Score="3" ViewCount="93" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/57610/20666&quot;&gt;This answer&lt;/a&gt; had 2 suggested edits that &lt;em&gt;only&lt;/em&gt; golf the code further, and the edits were both approved. I personally disagree with edits that only golf the code further. Here's why:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It shouldn't be up to the reviewer to make sure a code edit works. That should be the job of the answerer. If an edit is accepted when it actually does not work, the answer may get unfair downvotes.&lt;/li&gt;&#xA;&lt;li&gt;Usually golfing suggestions from comments come in the form of &lt;code&gt;replace &amp;lt;a few characters of  the code&amp;gt; with &amp;lt;shorter replacement&amp;gt;&lt;/code&gt; which might be easier to understand than the entire code being replaced.&lt;/li&gt;&#xA;&lt;li&gt;The answerer may not want the edit to be in their answer or may want to change the edit before incorporating it into their answer. Ultimately it's up to the answerer whether they want to use someone's changes; they should not be forced to do so by an accepted edit.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think the policy on PPCG should be changed to &lt;strong&gt;reject all&lt;/strong&gt; edits that only shorten the code, and to ask people to comment the changes instead.&lt;/p&gt;&#xA;" OwnerUserId="20666" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2015-09-11T21:36:46.493" Title="Disallow edits to answers that only golf code further" Tags="|discussion|editing|" AnswerCount="0" CommentCount="2" ClosedDate="2015-09-11T21:37:23.337" ContentLicense="CC BY-SA 3.0" />
  <row Id="6973" PostTypeId="2" ParentId="6918" CreationDate="2015-09-13T05:03:38.253" Score="4" Body="&lt;h2&gt;STATA (free interpreter)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Stata&quot; rel=&quot;nofollow noreferrer&quot;&gt;STATA&lt;/a&gt; is a statistical programming language similar to R that is commonly used for economics papers. However, since many challenges on this site require a free compiler/interpreter for valid languages, I created a partial interpreter supporting some of the commonly used golfing commands from STATA.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Currently supported commands include set obs, local, global, generate, display, replace, list, and forvalues, though each one only supports a limited subset of the corresponding proprietary STATA command.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/40073/making-future-posts-runnable-online-with-stack-snippets/47181#47181&quot;&gt;The free STATA interpreter&lt;/a&gt; was created in February 2015 by me, bmarks, though suggestions and edits are welcome from any user.&lt;/p&gt;&#xA;" OwnerUserId="30076" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2015-09-13T05:03:38.253" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6974" PostTypeId="2" ParentId="6918" CreationDate="2015-09-13T07:24:29.780" Score="7" Body="&lt;h2&gt;Perseus&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Perseus is a high level compiled native (open-source) programming languages that compiles directly to x86 machine code without any external assembler or other dependencies. It was created by me and started out as an Assembler for Windows systems, now there is a team of 5ish people. The language is intended to be both easy for beginners and as bare bones as possible. Here is some code:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;// WM_SIZE hook, changes the width and height variables on resize&#xA;func OnSize(dword hwnd, dword message, dword wparam, dword lparam) {&#xA;    cxClient = Math.LoWord(lparam)&#xA;    cyClient = Math.HiWord(lparam)&#xA;    GetClientRect(hwnd, @Area)&#xA;    return(0)&#xA;} &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It is a do-what-you-want and write-what-you-think language and while it isn't really object oriented, it allows for the creation of some object-like structures. Perseus can compile both standalone programs and DLLs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Perks&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because binaries compiled by Perseus are as small and vanilla as possible, the language is perfect for &lt;a href=&quot;https://en.wikipedia.org/wiki/Demoscene&quot; rel=&quot;nofollow&quot;&gt;Democoding/Sizecoding&lt;/a&gt;. When the compiler is combined with an advanced packer (I recommend &lt;a href=&quot;http://www.softpedia.com/get/Programming/Packers-Crypters-Protectors/MEW-SE.shtml&quot; rel=&quot;nofollow&quot;&gt;MEW11 SE&lt;/a&gt;), it generally beats or equals the size of &lt;a href=&quot;http://crinkler.net/&quot; rel=&quot;nofollow&quot;&gt;crinkler&lt;/a&gt;-linked C/C++ programs. Also, because the compiler is open source, you can further improve the size of binaries by tweaking the internal translation layer. The minimum compiled binary size is about 675 bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Perseus may be the only language that enables users to write bytes to the compiled binary in a useful way right from &lt;a href=&quot;https://github.com/Perseus-Dev/Perseus-6#directbyte&quot; rel=&quot;nofollow&quot;&gt;within the code&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Info&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Working (not stable) build + Documentation + Tons of Examples: &lt;a href=&quot;https://github.com/Perseus-Dev/Perseus-6&quot; rel=&quot;nofollow&quot;&gt;Github&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;When the stable is out, you can download it (or compile in the cloud without downloading) from here: &lt;a href=&quot;http://codeperseus.com&quot; rel=&quot;nofollow&quot;&gt;codeperseus.com&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Please note that the Perseus team is currently porting the Perseus compiler away from VB.NET (because it is way to clumsy), so the final version of Perseus 6 is not released yet, but the above works just fine. It comes with a portable Notepad++ version customized for Perseus.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user42643" LastActivityDate="2015-09-13T07:24:29.780" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6978" PostTypeId="2" ParentId="1706" CreationDate="2015-09-13T13:33:12.547" Score="4" Body="&lt;p&gt;To give some context for necroing this topic: I occasionally see this happen with the review queues, but we've had two cases this week of mods reopening a question which they appear to think should be closed, but for a different reason to the one given.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Alex reopened &lt;a href=&quot;https://codegolf.stackexchange.com/q/57566/194&quot;&gt;Interrupt handler call serializator&lt;/a&gt; but &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/24037386#24037386&quot;&gt;commented in chat&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Personally I find the challenge very unclear and as a normal user I would have voted to close as unclear rather than no win condition.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Dennis reopened &lt;a href=&quot;https://codegolf.stackexchange.com/q/57784/194&quot;&gt;https://codegolf.stackexchange.com/q/57784/194&lt;/a&gt; but commented on the question&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I have reopened the question since it no longer lacks a winning criterion. However, you should still clarify what counts as &lt;em&gt;approximately the same&lt;/em&gt;. This has to be quantified somehow to decide whether a given submission is valid or not.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Where there is a question which should be closed, it is obviously preferable that it be closed for the right reason. However, given the choice between it being closed for the wrong reason with a comment explaining that it still has major problems; or it being open and able to attract answers which make it impossible to fix those problems, I think the former is clearly preferable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The previous answer to this question suggests that mods have the ability to change the close reason: maybe that's just something which isn't clear enough in the UI for the new members of the team. But if that's not the case, and if the mods think it's worth their time to clear up close reasons, could you coordinate with each other to reopen and then close for the correct reason without leaving a big window in between?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And for those of us who handle review queues, I encourage all of us to read the comments for other problems which might have been pointed out but not yet fixed, and to point out problems which haven't been mentioned.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2015-09-13T13:33:12.547" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6981" PostTypeId="2" ParentId="6918" CreationDate="2015-09-14T00:19:57.937" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/iatorm/grime&quot; rel=&quot;nofollow noreferrer&quot;&gt;Grime&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Grime is a declarative language based on &lt;a href=&quot;https://en.wikipedia.org/wiki/Boolean_grammar&quot; rel=&quot;nofollow noreferrer&quot;&gt;Boolean grammars&lt;/a&gt; that I created in March 2015  for the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/47311/language-design-2-d-pattern-matching&quot;&gt;2D pattern matching challenge&lt;/a&gt;.&#xA;A Grime program (more properly called &lt;em&gt;grammar&lt;/em&gt;) takes in a newline-separated string, and tries to match one or more of its rectangular sub-patterns, like a regular expression but in two dimensions.&#xA;The exact output depends on flags, but you can match against the whole input, search for one sub-rectangle, search for all sub-rectangles, and return their number, positions and/or contents.&#xA;The only existing interpreter is written in Haskell.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A Grime grammar consists of one or more &lt;em&gt;definitions&lt;/em&gt;, each of which defines a &lt;em&gt;nonterminal symbol&lt;/em&gt; that may or may not match a given rectangular pattern.&#xA;Complex definitions can be created using simple ones, and nonterminals may recursively refer to themselves. An example grammar is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A=[,()]/*&#xA;P=A*|P(A/\(/A)P(A/\)/A)P&#xA;e,P&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which matches correctly formed &lt;a href=&quot;https://esolangs.org/wiki/Prelude&quot; rel=&quot;nofollow noreferrer&quot;&gt;Prelude&lt;/a&gt; programs.&#xA;This means that any vertical column may contain at most one of &lt;code&gt;(&lt;/code&gt; or &lt;code&gt;)&lt;/code&gt; in total, and the parentheses must be matching if their vertical coordinates are ignored.&#xA;See the 2D pattern matching challenge for details.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Grime is relatively golfy on certain 2D matching problems like the above, but not so golfy on others.&lt;/p&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2015-09-14T00:19:57.937" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="6982" PostTypeId="2" ParentId="2140" CreationDate="2015-09-14T07:02:36.310" Score="-2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/6927/is-there-a-question-format-for-longest-non-repeating-code&quot;&gt;This&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/28238/print-the-golden-ratio&quot;&gt;this&lt;/a&gt; gave me an idea, but I'm not quite sure if this can be done at all, or if it is trivial. If it is, maybe point out how it could be changed to be interesting.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Anti golfing - Write the longest program not repeating any character&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Well, it's just what the title says. Finally you're allowed to use as much bytes as possible.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Conditions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The code of the program or function should not use any character that is used in the code before.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program should print some sort of result to stdout, or into a file or return a value. You're not allowed to output or return the empty string or only a newline.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Other than that your program might do anything. Read input, print lots of output, or what you can think of, but you have to explain what it does, of course.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Only characters in the ASCII range [32 .. 126] and newlines are allowed, which limits the maximal code length to 96 bytes.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Variable names are only allowed to consist of a single character&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;String literals or the like are forbidden. They could be used to hold the unused characters (though they would need two &lt;code&gt;&quot;&lt;/code&gt; in most languages anyway).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The same rule applies for similar literal constructs like blocks or what else is there in some languages.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Even if the length of a string literal would be used to generate a number, it is forbidden.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Variables can not just be declared and never be used. They have to be reflected in the output somehow.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you've read and understood the above rules and still found a loophole and used it, you should go and stand in the corner for a while, thinking about what you've done.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So all in all, only use characters for actual code that does something generating the output, might it be calculating a value or formatting. And don't put unused characters somewhere in your code as a literal. Numbers are an exception, but I guess it's no problem to use them anyway.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I guess you should have a pretty good idea of what would be considered cheating here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example in awk&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-awk prettyprint-override&quot;&gt;&lt;code&gt;BEGIN{gsub(a,9);print $j-13+d^c/4*5678%20}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;It prints &lt;code&gt;15.5&lt;/code&gt;, score is 42.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;It replaces the empty string &lt;code&gt;a&lt;/code&gt; with &lt;code&gt;9&lt;/code&gt; in &lt;code&gt;$0&lt;/code&gt;, which is the empty string in the beginning. So &lt;code&gt;$0&lt;/code&gt; becomes &lt;code&gt;9&lt;/code&gt;.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Then it prints the result of &lt;code&gt;9-13+1/4*5678%20&lt;/code&gt;.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;(&lt;code&gt;$j&lt;/code&gt; is &lt;code&gt;$0 (==9)&lt;/code&gt;, because &lt;code&gt;j&lt;/code&gt; is not defined&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;code&gt;d^c&lt;/code&gt; ist &lt;code&gt;1&lt;/code&gt;, because &lt;code&gt;c&lt;/code&gt; and &lt;code&gt;d&lt;/code&gt; are not defined)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Please don't invent languages for this ;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The longest code in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="44613" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.127" LastActivityDate="2015-09-14T08:48:11.370" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="6983" PostTypeId="1" CreationDate="2015-09-14T13:18:01.733" Score="135" ViewCount="5953" Body="&lt;p&gt;The &lt;strong&gt;contents of this post are solicited opinion&lt;/strong&gt; that I have &lt;a href=&quot;https://meta.stackexchange.com/questions/266206/how-do-i-delete-codegolf-from-my-list-of-questions-when-i-go-to-stackexchange#comment863941_266206&quot;&gt;been asked&lt;/a&gt; by a Code Golf moderator to share with you.  I understand &quot;&lt;em&gt;If you don't like it, then GEETTT OOUUTT&lt;/em&gt;&quot; applies here, so I have &lt;strong&gt;already submitted my account for deletion&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I joined Code Golf because the challenge of fulfilling certain criteria in the most terse possible syntax seemed awesome.  Hacking languages to make them do stuff they weren't meant to in new and creative ways?  Sign me up!!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Whoa then, what's this?  Somebody posted a solution in a language I've never heard about, and solved the problem in 10 characters.  Cool!  Fifteen minutes of Wikipedia brings me up to speed on esoteric programming languages and I have a good laugh that someone went through all sorts of trouble to make a language that is basically useless except for getting a few tasks done in a very cryptic, dense syntax.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The next day, I log back into Code Golf and, oh look, that esolang has the top answer again.  4 bytes.  Let's scroll down and... another esolang does it in 3 bytes.  5 bytes... Ok... getting old.  When the solution language is designed for the exact problem, we are no longer hacking anything.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Analogy problem: &lt;strong&gt;&lt;em&gt;Bake a moused-shaped cookie in as few steps as possible.&lt;/em&gt;&lt;/strong&gt;   Solutions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Foil (15 steps), 2 upvotes: I shaped a piece of foil in the shape of a mouse and put the cookie dough inside.&lt;/li&gt;&#xA;&lt;li&gt;Knife (9 steps), 5 upvotes: I baked a normal cookie, then cut a mouse out of it using the following technique...&lt;/li&gt;&#xA;&lt;li&gt;MseShpdCttr (1 step), 25 upvotes: I used this device called &lt;em&gt;MseShpdCtter&lt;/em&gt; that takes a lump of dough and shapes and bakes and spits out a mouse shaped cookie.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Using a specialized device to solve a specialized problem isn't fun after the first few times.  Seeing people solve problems in Java, Javascript, PHP, C++, ..., and having others comment on it and find hacks to shave bytes is amazing.  I really like that aspect of this community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But the fact is every Code Golf thread is dominated by these esolangs and makes it really not fun to see a &quot;competition&quot; with the languages listed above.  Yes, I know there is supposedly a winner for each language, but the fact is this is Stack Exchange and the top responses get the most focus.  The current system is not suited for &quot;there is one winner per programming language&quot;, and the people actually hacking up answers are at the bottom of the (fifth) page.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The line was finally crossed when I saw a &lt;em&gt;Hello World&lt;/em&gt; challenge and the most upvoted response was a zero-byte solution in some language that prints &lt;code&gt;Hello, world!&lt;/code&gt; with no input or code.  That's not interesting.  That's not hacking.  For me, that's not fun.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I wish I had novel suggestions to improve this site.  &quot;Specify the language&quot; doesn't seem like it would get enough independent responses.  &lt;code&gt;no-esolangs&lt;/code&gt; and &lt;code&gt;esolangs-only&lt;/code&gt; tags are arbitrary.  Maybe something like restricting answers &lt;em&gt;by default&lt;/em&gt; to the top 10 most used languages on GitHub at the time or something would work, but there is a very real chance that is not in line with the community's zeitgeist.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Like everything, Code Golf isn't perfect.  I can think of other ways this site can be improved and could be hashed out with the community and morphed into implementations we all benefit from. I think other people are sharing ideas on Meta with that purpose in mind. However, all of this is drowned out by the problem detailed above, and I don't see the point of working out details of improvements when Code Golf's foundation is fundamentally flawed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, because I cannot think of any feasible ways to help this community improve, I am just going to leave.  I hope one day somebody here figures out a way to isolate the &lt;em&gt;MseShpdCttr&lt;/em&gt; solutions from the ones utilizing universal tools, but until then farewell.&lt;/p&gt;&#xA;" OwnerDisplayName="user43512" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2023-08-01T05:58:01.933" Title="Why I am leaving Code Golf" Tags="|discussion|" AnswerCount="6" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="6984" PostTypeId="2" ParentId="6983" CreationDate="2015-09-14T14:15:23.593" Score="35" Body="&lt;p&gt;I joined this site 85 days ago, with no &quot;code golf&quot; experience at all, so I'm relatively new to all of this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I kind of understand the reaction you have against (I assume) languages like CJam and Pyth notably, which win almost every code golf challenge on this site. Users like @Dennis will always be on top of the rep chart because they answer everything in those languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Similarly I can understand how you got frustrated seeing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world/55425#55425&quot;&gt;my answer&lt;/a&gt; for the &lt;em&gt;Hello World!&lt;/em&gt; challenge get more than 100 upvotes, when it doesn't even contain any code at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, I think you are underestimating the efforts it takes to produce those CJam/Pyth answers. Its' true that they have very powerful 1/2 bytes operators, but as far as I know (never learned those languages, so correct me if I'm wrong), they are still relatively general purpose languages and they don't really have super-specific operators that are useful for a particular challenge. Having a one byte operator to generate all possible subsets of a list may seem like cheating, but it's really not that convoluted of an operation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moreover, answers by the best users of those languages are usually pretty well explained, and sometimes display remarkable tricks to save some bytes, which in themselves are sufficient arguments to justify their presence on this site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But the most important point I think is that you &lt;strong&gt;care too much&lt;/strong&gt; about who wins the challenge, or what trick is interesting.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Seeing people solve problems in Java, Javascript, PHP, C++, ..., and having others comment on it and find hacks to shave bytes is amazing.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't want to generalize too much since I don't have that much experience here, but from what I've seen the most interesting &quot;hacks&quot; are usually actually from those &quot;esolangs&quot; rather than general purpose languages, because you either have a plethora of different operators that can help you solve the problem in a very different but shorter way, or because the esolang is so esoteric that very ugly solutions are possible. Languages like Java don't really have both options and they usually end up being not the most interesting answers, even if we don't pay attention to the bytes count.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, while it's true that CJam/Pyth are very often at the top of answers, and are almost always the winners of challenges, it's also true that a lot of languages that are bad at golfing usually get very respectable upvotes/scores.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;APL or J for instance, while they still may look like noise, are languages that were not designed for code golfing, yet can usually yield very short answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Python and Ruby are probably the two &quot;standard&quot; languages that I see the most on this site, and they usually do pretty well and display very interesting tricks often. I'm surprised you have not talked about answers in those languages in your post, because to me they seem to be both popular and numerous.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, my own answers are almost all in Prolog, which is an absolutely godawful language for code golf (can't really do any hacky things, very long built-in names, declarative paradigms forces you to make a lot of things explicit, etc.). But I still keep using it because a) I learnt a lot about Prolog using it and b) I love trying to golf the logic of the problem with respect to the way Prolog tries to unify things. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/52341/national-scheduling-conflict-championships/52348#52348&quot;&gt;This answer&lt;/a&gt; is ahead of Pyth, while considerable longer, so even godawful languages can &quot;win&quot; challenges in a sense.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I even started writing my own esolang called &lt;a href=&quot;https://github.com/JCumin/Brachylog&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brachylog&lt;/a&gt; which is to Prolog what Pyth is to Python (except way worse, but you get the idea). So that's one more reason for you to hate me I guess, but I find it rewarding to actually use a language I designed (on the spot, but still).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In conclusion, yes some languages like CJam or Pyth will win most challenges, but I don't think they are aggregations of ultra specific operators, they can still be beat in specific cases by other languages that were not designed for golfing. Answers in &quot;normal&quot; languages like Python or Ruby seem very popular and numerous to me which is something you should like, and even awful languages can get a good number of upvotes regularly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;EDIT&lt;/strong&gt; One last thing that I forgot to mention is that you can appreciate the quality of some questions on this site rather than the answers themselves. A lot of my reputation comes from the questions I actually asked rather than my answers, which is also more satisfying.&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2015-09-14T14:21:33.040" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="6985" PostTypeId="2" ParentId="6983" CreationDate="2015-09-14T15:28:22.590" Score="30" Body="&lt;p&gt;I joined this site only 51 days ago, with no &quot;code golf&quot; experience at all, similarly to Fatalize. I understand that you feel &quot;robbed&quot; by the Pyth/CJam answers. It's very hard, and sometimes impossible, to create something shorter in other, more &quot;standard&quot; languages. But that doesn't have to take away the fun of solving challenges with these languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since I joined, &lt;em&gt;I've used Javascript in practically every answer I have posted&lt;/em&gt;, and I've thoroughly enjoyed golfing each and every one of them. Some of them are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/57802/use-xkcds-formula-to-approximate-the-world-population/57811#57811&quot;&gt;near the top&lt;/a&gt;, and one is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/53925/minecraft-mirrored/53943#53943&quot;&gt;the most up-voted answer&lt;/a&gt;, even though they are by no means the shortest. &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;But the fact is every Code Golf thread is dominated by these esolangs and makes it really not fun to see a &quot;competition&quot; with the languages listed above.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It's true that these languages are dominant in the realm of &quot;who can write the shortest code?&quot;, and this could take away the fun of answering in &quot;standard&quot; languages. But it doesn't have to. &#xA;The reason I continue to participate in code-golf, though I don't often win, is because I like to see how short I can get my answers in my favorite language (currently JS). For the same reason, Martin Büttner's &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5139/leaderboard-snippet&quot;&gt;amazing leaderboard template&lt;/a&gt; not only has an overall leaderboard, but a per-language leaderboard.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I guess my main point is that the primary goal of code-golf, as with any other recreational activity, is to &lt;strong&gt;have fun&lt;/strong&gt; and &lt;strong&gt;improve your skills&lt;/strong&gt;, not just to win as many challenges as possible. It's not a prize-paying championship; there's nothing you're missing out on by not using these golf-optimized esolangs. So if you'd like to try answering a challenge with C++ or PHP or JS or Java, go right ahead; there's no one holding you back, and no one who's going to criticize you just for doing so.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One final thought: I've found that instead of just looking at the water and deciding it will feel cold, it's best to go down a few steps and see how it really feels. You just might like it. :-)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Good luck!&lt;/p&gt;&#xA;" OwnerUserId="42545" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2015-09-14T15:28:22.590" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="6986" PostTypeId="2" ParentId="6983" CreationDate="2015-09-14T15:30:04.010" Score="59" Body="&lt;p&gt;This answer assumes you have golfing languages in mind when you refer to esolangs. If you are actually referring to languages specialised for specific problems, then these are heavily discouraged in most cases*.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I'm sorry to hear you're leaving. This issue has been &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/286/4020&quot;&gt;raised before&lt;/a&gt;, and I can sympathise with you in that I don't find languages with abbreviated syntax particularly interesting (in and of themselves). In over 3 years, I've never posted in CJam/Pyth/GolfScript - I stick with Python most of the time, and occasionally post in other 'normal' languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I have found that voters tend to side with cleverness and creativity over the number of bytes. In my experience, a clever solution in a standard language (like Python, JavaScript, C or even Java) will always outscore straightforward answers in golfier languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I think you are missing the converse. An answer may be written in a standard programming language without being new or creative. In fact, many answers in common languages are quite poorly golfed. On the other hand, answers written in golfing languages can be amazingly creative and hack-y, especially since expert golfers tend to use these languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;tl;dr - if you post a clever answer and explanation, you'll be upvoted regardless of language.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;i&gt;&lt;/i&gt;* As for the hello world question, it is unique - even boring answers in normal languages (e.g. &lt;code&gt;print&quot;Hello, World!&quot;&lt;/code&gt;) have 10-20 upvotes. And you mentioned answers sitting at the bottom of the fifth page - questions with five pages of answers aren't a fair representation of PPCG either.&lt;/p&gt;&#xA;" OwnerUserId="4020" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2015-09-14T15:30:04.010" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="6987" PostTypeId="2" ParentId="6918" CreationDate="2015-09-14T21:38:40.033" Score="7" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/PhiNotPi/GolfLang&quot; rel=&quot;nofollow&quot;&gt;Unnamed / Phi's Golfo Supreme / Compound / GolfLang&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Umm.... yeah.  I don't have a name for this yet, it's a new project.  Unfortunately most abbreviations of &quot;Phi's Golfo Supreme&quot; like &quot;PGS&quot; have been claimed by various organizations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;PGS is a golfing language, partly based off my previous language Element.  It will be primarily a stack-based language, but with several features that go against a pure stack-based paradigm. At this point, the list of intended feature is much longer than the list of current features.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Basic syntax&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are several different types of operators/objects in PGS.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The most basic is a &lt;strong&gt;scalar&lt;/strong&gt;, like &lt;code&gt;42&lt;/code&gt; or &lt;code&gt;hi&lt;/code&gt; which are simply pushed on the stack when executed, assuming normal execution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Nest-able &lt;strong&gt;arrays&lt;/strong&gt; can be created with &lt;code&gt;[]&lt;/code&gt; like &lt;code&gt;[2[3 4][5]]&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&quot;Normal&quot; operators&lt;/strong&gt; like &lt;code&gt;*+/-^&lt;/code&gt; pop two elements off the stack, perform that operation, and push the result onto the stack.  The actions of operators can be modified by varies &quot;modifiers.&quot; When performed on arrays, the default action is to perform the operation pair-wise.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Modifiers&lt;/strong&gt; like &quot;1-level reduce&quot; &lt;code&gt;|&lt;/code&gt; are pushed onto a &quot;active modifier stack&quot; which is independent of the main stack.  Whenever an operator is performed, all applicable modifiers are removed from the active modifier stack and put in a &quot;selected modifier stack&quot; which is used in the process of evaluating commands.  Modifiers can be stacked.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some &lt;strong&gt;special ops&lt;/strong&gt; include map &lt;code&gt;:&lt;/code&gt;, which marks the top item of the stack as being a &lt;code&gt;list&lt;/code&gt;.  Whenever that object is used in an operation, that operation is performed on each item in the array separately.  This method of applying &quot;maps&quot; means that an object can used as the subject of a map even if the &lt;code&gt;:&lt;/code&gt; is used early in the program, the object is buried in the stack and dug up again, and then operated on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am working on adding lambda expressions.  All of my work on this has been unpublished, but I basically have some form of unnestable thing working right now.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Trivia:&lt;/strong&gt; This language has been written in Perl, compiles (somehow) to Perl, and was written in Notepad.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2015-09-14T21:38:40.033" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="6991" PostTypeId="2" ParentId="6983" CreationDate="2015-09-15T14:30:36.260" Score="28" Body="&lt;p&gt;To be honest, I don't really see the problem. Code golf is about writing shortest entry in any language that is accepted. People created some strange languages to be able to write short programs. Some people learned it and use it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While I understand that seeing all these &quot;exotic&quot; answers might be bugging you, I also think that your approach is wrong(but if you don't like it, you are doing the right thing leaving - it's your decision, and it's perfectly fine).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First of all - answers in CJam or Pyth tend to be creative. They use some different approach to the problem to minimize characters. I like that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Secondly, &lt;strong&gt;code golf is all about fun&lt;/strong&gt;. If you get the shortest entry, you don't win a cookie. You just get the shortest entry. It's literally meaningless, so why care? If you wrote some brilliant entry, people might appreciate that and you can feel good, but that's it. We're here to have fun, and being too focused on winning is bad.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And if you're so inclined for winning - remember that programming is not only the ability to use X programming language - &lt;strong&gt;it's about being able to use the right tool for the job.&lt;/strong&gt; If you want to make simple operations on text file, you use &lt;code&gt;sed&lt;/code&gt; or &lt;code&gt;awk&lt;/code&gt;. If you want to find something in file, you use &lt;code&gt;grep&lt;/code&gt;. You don't go for &lt;code&gt;C++&lt;/code&gt;, because it's not the right tool for the job. When the job is Code Golf, the right tool is often CJam/Pyth/another esolang.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With this in mind, I often see many answers in &quot;mainstream&quot; programming languages that are really short and impressive. And I think this is what Code Golf is about.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anyway, good luck! I hope that you either stay here and enjoy it, or go and find some other place where you can enjoy programming whatever you want.&lt;/p&gt;&#xA;" OwnerUserId="15174" LastEditorUserId="41042" LastEditDate="2016-05-10T18:46:44.970" LastActivityDate="2016-05-10T18:46:44.970" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="6992" PostTypeId="1" CreationDate="2015-09-15T16:56:19.187" Score="18" ViewCount="635" Body="&lt;p&gt;I'm not a great (or, really, that good of a) programmer, but I enjoy reading other people's challenges, and thought I'd try my hand at submitting a few challenges myself. However, I don't see myself ever answering (m)any questions (Python isn't that exciting a language to golf). An obvious solution is to learn one of the more entertaining esolangs, but as a senior in high school, that's not something I have a lot of time for. Is it still ok for me to post questions without answering any?&lt;/p&gt;&#xA;" OwnerUserId="43444" LastEditorUserId="20469" LastEditDate="2015-09-15T17:29:08.437" LastActivityDate="2015-09-17T22:17:47.953" Title="Ethics of posting if you're a bad programmer" Tags="|discussion|policy|answers|asking-questions|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="6993" PostTypeId="2" ParentId="6992" CreationDate="2015-09-15T17:01:16.100" Score="33" Body="&lt;h1&gt;Of course you can!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We welcome any and all participation. How you choose to participate is up to you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I went over a year without posting any challenges at all; all of my participation was answers. &lt;a href=&quot;https://codegolf.stackexchange.com/u/26997&quot;&gt;Calvin's Hobbies&lt;/a&gt;, one of our most successful challenge authors, almost exclusively posts challenges. At least in my mind, the point of this community is to have fun. Do whatever you have the most fun doing!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A great way to grow your programming skills is to participate in challenges but there's nothing that says you have to.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a challenge author, the greatest tool available to you is the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;Sandbox for Proposed Challenges&lt;/a&gt;. There you can get meaningful feedback about your challenges before they go live.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Welcome to PPCG!&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-09-15T17:12:04.177" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="6997" PostTypeId="2" ParentId="6918" CreationDate="2015-09-16T17:54:11.533" Score="65" Body="&lt;h1&gt;Hexagony&lt;/h1&gt;&#xA;&lt;p&gt;Hexagony was created by me, Martin Büttner, in September 2015.&lt;/p&gt;&#xA;&lt;p&gt;As far as I know it is the first two-dimensional programming language which operates on a hexagonal grid (instead of the usual rectangular grid). To make matters worse, opposite edges of the grid wrap around, making the topology of the source code a weird twisted torus. To make matters &lt;em&gt;worst&lt;/em&gt;, the memory model is also a hexagonal grid, where each &lt;em&gt;edge&lt;/em&gt; holds an integer value. Considering these things, I think the name (being a portmanteau of &amp;quot;hexagon&amp;quot; and &amp;quot;agony&amp;quot;) is completely justified.&lt;/p&gt;&#xA;&lt;p&gt;My &lt;a href=&quot;https://codegolf.stackexchange.com/a/57706/8478&quot;&gt;prime checker&lt;/a&gt; and the &lt;a href=&quot;https://codegolf.stackexchange.com/a/66967/8478&quot;&gt;Hexagony self-unfolder&lt;/a&gt; contain fairly detailed explanations of the language's quirks and show how to program in it.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/mbuettner/hexagony&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;GitHub repository&lt;/strong&gt;&lt;/a&gt;. Includes interpreter (Ruby), language specification, example programs and issue tracker.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://esolangs.org/wiki/Hexagony&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Esolangs page&lt;/strong&gt;&lt;/a&gt;. Largely a copy of the README.md on GitHub.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/Timwi/EsotericIDE/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Esoteric IDE&lt;/strong&gt;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/668/timwi&quot;&gt;Timwi&lt;/a&gt; which contains another implementation (C#) and &lt;strong&gt;a graphical debugger&lt;/strong&gt; (yep).&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/Timwi/HexagonyColorer&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Hexagony Colorer&lt;/strong&gt;&lt;/a&gt; also by Timwi. This is a tool which can be used to annotate execution paths in Hexagony source code. See &lt;a href=&quot;https://codegolf.stackexchange.com/a/58515/8478&quot;&gt;this answer&lt;/a&gt; for an example of the result.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://hexagony.tryitonline.net/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Try it online!&lt;/strong&gt;&lt;/a&gt; (by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;) backed by the Ruby interpreter.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/66407/8478&quot;&gt;&lt;strong&gt;Showcase your language entry&lt;/strong&gt;&lt;/a&gt; (written by &lt;a href=&quot;https://codegolf.stackexchange.com/users/34388/adnan&quot;&gt;Adnan&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="16766" LastEditDate="2022-03-30T01:32:07.857" LastActivityDate="2022-03-30T01:32:07.857" CommentCount="15" ContentLicense="CC BY-SA 4.0" />
  <row Id="7000" PostTypeId="2" ParentId="2140" CreationDate="2015-09-17T18:30:49.833" Score="-2" Body="&lt;h1&gt;Technologic - Now what's THAT command do??&lt;/h1&gt;&#xA;&lt;p&gt;Daft Punk's song &amp;quot;Technologic&amp;quot; is all about actions that a user or computer does when it's working and being used. You goal is to write a program that has one command we will call the Technologic Command. This command will executes all of the actions like &amp;quot;buy it&amp;quot;, &amp;quot;lock it&amp;quot;, &amp;quot;code it&amp;quot;, and &amp;quot;write it&amp;quot; in the order the lyrics are written on 'it'. What 'it' is is up to you, but you gotta let me know.&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any language can be used.&lt;/li&gt;&#xA;&lt;li&gt;The song refers to an 'it'. That can be a block a memory, algorithm, function, file, or anything else a computer can manipulate directly or indirectly.&lt;/li&gt;&#xA;&lt;li&gt;You must specify what 'it' is you will be performing these actions on. If you don't, you can only earn a maximum of 160 points.&lt;/li&gt;&#xA;&lt;li&gt;Points will be deducted otherwise if a command is not used.&lt;/li&gt;&#xA;&lt;li&gt;I'm not aware of any 'buy' command, method, function, subroutine or instruction so use a thesaurus and find the closest word you can actually program. I don't expect the program to actually buy or snap anything. Other words like mail and fax are possible, but not recommended.&lt;/li&gt;&#xA;&lt;li&gt;If you have to use a synonym, you are not allowed to use that command again&lt;/li&gt;&#xA;&lt;li&gt;Encompassing multiple objects into one artifact does not count. For example, taking the command &amp;quot;name it&amp;quot; literally means you won't be able to name an array of bytes, but you can name a file. Creating an object that holds both a file and an array of bytes is not allowed. That would make this too easy to get the maximum amount of points.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are 16 commands with a total possible score of 190 points.&lt;/li&gt;&#xA;&lt;li&gt;10 points for executing a command on the specified 'it' of your choosing (160 total)&lt;/li&gt;&#xA;&lt;li&gt;2 points for executing each command consecutively that references your 'it' (30 total)&lt;/li&gt;&#xA;&lt;li&gt;5 points for executing a command on something other than your 'it'&lt;/li&gt;&#xA;&lt;li&gt;-3 points for every command skipped.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Command List&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.azlyrics.com/lyrics/daftpunk/technologic.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;lyrics&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Buy it, use it, break it, fix it,&lt;br /&gt;&#xA;Trash it, change it, mail - upgrade it,&lt;br /&gt;&#xA;Charge it, point it, zoom it, press it,&lt;br /&gt;&#xA;Snap it, work it, quick - erase it,&lt;br /&gt;&#xA;Write it, cut it, paste it, save it,&lt;br /&gt;&#xA;Load it, check it, quick - rewrite it,&lt;br /&gt;&#xA;Plug it, play it, burn it, rip it,&lt;br /&gt;&#xA;Drag and drop it, zip - unzip it,&lt;br /&gt;&#xA;Lock it, fill it, call it, find it,&lt;br /&gt;&#xA;View it, code it, jam - unlock it,&lt;br /&gt;&#xA;Surf it, scroll it, pause it, click it,&lt;br /&gt;&#xA;Cross it, crack it, switch - update it,&lt;br /&gt;&#xA;Name it, rate it, tune it, print it,&lt;br /&gt;&#xA;Scan it, send it, fax - rename it,&lt;br /&gt;&#xA;Touch it, bring it, pay it, watch it,&lt;br /&gt;&#xA;Turn it, leave it, start - format it.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challange&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challange&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challange&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="30353" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-09-17T21:12:41.117" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7001" PostTypeId="2" ParentId="6992" CreationDate="2015-09-17T22:17:47.953" Score="7" Body="&lt;h1&gt;Of course you should!&lt;/h1&gt;&#xA;&lt;p&gt;We need challenges more than answers. I'd like to have more of Calvin's Hobbies in the community. Just keep in mind that a good challenge is more difficult than a good answer.&lt;/p&gt;&#xA;" OwnerUserId="21348" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-09-17T22:17:47.953" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7004" PostTypeId="2" ParentId="2140" CreationDate="2015-09-18T10:53:55.070" Score="1" Body="&lt;p&gt;I have an idea for a challenge but I'm not sure if it would be best as a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-challenge&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, I'm also not sure what rules I should apply to make it more interesting.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;&lt;strong&gt;&quot;Convert an image to LEGO safe-colours&quot;&lt;/strong&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The task is to convert the existing colours from a JPEG image into LEGO-safe colours.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What are LEGO-Safe colours?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For the purpose of this challenge, LEGO-Safe colours are defined as the &lt;a href=&quot;https://www.flickr.com/photos/126975831@N07/15801189140&quot; rel=&quot;nofollow noreferrer&quot;&gt;seven oldest solid colours produced by LEGO&lt;/a&gt; that are still in production. (The exception being grey which has changed in recent years, for the purpose of this challenge, the original grey will be used).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The colours are hexadecimal approximations from &lt;a href=&quot;http://www.peeron.com/cgi-bin/invcgis/colorguide.cgi&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; list.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;White, #f2f3f2&#xA;Grey, #a1a5a2&#xA;Black, #000000&#xA;Bright Red, #c4281b&#xA;Bright Yellow, #f5cd2f&#xA;Dark Green, #287f46&#xA;Bright Blue, #0d69ab&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Images&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You may demonstrate your results using images provided by yourself or the ones shown below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Lego Factory (Colour)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/mgYHQ.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/mgYHQ.jpg&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Lego and Duplo Bricks (Greyscale)&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/51DBB.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/51DBB.jpg&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="4917" LastActivityDate="2015-09-18T10:53:55.070" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7005" PostTypeId="2" ParentId="2140" CreationDate="2015-09-19T14:32:14.400" Score="2" Body="&lt;h1&gt;The Algebra of Reflecting Points&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a challenge based on manipulating points with a specific set of operations, each dealing with the reflection of some points over others.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Warning: There's not actually a challenge here yet, just the basis for a challenge that could be to &quot;simplify the given expression&quot; or something.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I'll add more diagrams later)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Lists of Points&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The fundamental object is an ordered list of points, like (A,B,C) or ([2,3],[5,8],[6,8]).  &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Reflection&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;A r B&lt;/code&gt; represents the reflection of point &lt;code&gt;A&lt;/code&gt; across point &lt;code&gt;B&lt;/code&gt;, resulting in a new point &lt;code&gt;C&lt;/code&gt; so that &lt;code&gt;B&lt;/code&gt; is the midpoint of &lt;code&gt;AC&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;A r (B,C,D)&lt;/code&gt; represents the reflection over a series of points, and is equivalent to &lt;code&gt;A r B r C r D&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;(A,B,C) r (D,E)&lt;/code&gt; represents &lt;code&gt;(Ar(D,E),Br(D,E),Cr(D,E))&lt;/code&gt;, with either list being of any positive length.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The result of the reflection operator is a list of points that is the same length as the first operand. (If the first operand is a single point, then the output is a single point.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A list with a single point is that same as that single point. &lt;code&gt;(B) == B&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lists can be arbitrary grouped inside of other lists.  &lt;code&gt;(A,B,C,D) == (A,(B,C),D) == ((A,B,C),D)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Simplification&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A point reflected over itself is an identity, &lt;code&gt;CrC&lt;/code&gt; is the same as &lt;code&gt;C&lt;/code&gt;. Any point reflected over the same point twice is an identity, &lt;code&gt;rCrC&lt;/code&gt; can be removed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;(A,B,C)&lt;/code&gt; equals &lt;code&gt;(C,B,A)&lt;/code&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For any three points &lt;code&gt;ABC&lt;/code&gt; there exists a unique fourth point &lt;code&gt;D=C-B+A&lt;/code&gt; such that &lt;code&gt;anything r (A,B,C) = anything r D&lt;/code&gt;.  This means that any long chain of &lt;code&gt;ArBrCrDrErF...&lt;/code&gt; can be reduced to have fewer than three &lt;code&gt;r&lt;/code&gt;s.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;((A,...,B)r(C,...,D)) == ((D,...,C),(A,...,B),(C,...,D))&lt;/code&gt; and &lt;code&gt;(ArB) == (B,A,B)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Show that `Cr(CrA)rB == Cr(BrArC)`&#xA;&#xA;Cr(CrA)rB         #original&#xA;Cr(A,C,A)rB       #expanding 4th simplification rule&#xA;CrArCrArB         #the list is equivalent to a series of `r`s&#xA;CrAr(C,A,B)       #grouping to form a list&#xA;CrAr(B,A,C)       #swapping, the 2nd simplification rule&#xA;CrArBrArC         #expanding list&#xA;CrCrArBrArC       #Identity operation of C=CrC&#xA;Cr(C,A,B,A,C)     #listifying&#xA;Cr((C,A),B,(A,C)) #further grouping&#xA;Cr(Br(A,C))       #using the 4th simplification rule&#xA;Cr(BrArC)         #expanding parenthesis&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here is this proof visualized geometrically.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/CaqGM.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/CaqGM.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2015-09-19T14:32:14.400" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7008" PostTypeId="2" ParentId="6918" CreationDate="2015-09-20T04:06:27.697" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;http://HassiumLang.com&quot; rel=&quot;nofollow&quot;&gt;Hassium&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Hassium is a very useful interpreted programming language created in C# by myself (JacobMisirian) as the lead developer and with the help of my partner Zdimension.&lt;br&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hassium contains builtin classes that include File-system IO, Networking, Drawing, Cryptography, and more.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hassium has a syntax that stems from Python, C, and C# and contains many classes that are exactly the same to it's C# equivalent, meaning you wouldn't have to learn all the different Hassium classes if you are familiar with C#. Take the StringBuilder class for example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;func main () {&#xA;    sb = new StringBuilder();&#xA;    sb.append(&quot;Hello &quot;);&#xA;    sb.append(&quot;world&quot;);&#xA;    println(sb.toString());&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As you may have noticed Hassium is a fully object oriented language and you can create your own classes and methods, as shown here:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;class Person {&#xA;    func new (name) {&#xA;        this.Name = name;&#xA;    }&#xA;    func greet(this) {&#xA;        println(&quot;Hello my name is &quot; + this.Name);&#xA;    }&#xA;}&#xA;func main () {&#xA;    slim = new Person(&quot;Slim Shady&quot;);&#xA;    slim.greet();&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Hassium has support for most common elements of modern programming languages. It has the for, while (else), do while, and foreach loops as well as the usual if statements, arrays, and dictionaries. There are also LINQ-like functions and mapping.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hassium is fairly well documented and the wiki can be found &lt;a href=&quot;https://github.com/HassiumTeam/Hassium/wiki&quot; rel=&quot;nofollow&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the HassiumLang.com website there is an online interpreter where you can execute code and have the output in your browser, as well as share your code with your friends.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://HassiumLang.com&quot; rel=&quot;nofollow&quot;&gt;&lt;strong&gt;Hassium Website&lt;/strong&gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://HassiumLang.com/Hassium&quot; rel=&quot;nofollow&quot;&gt;&lt;strong&gt;Online Interpreter&lt;/strong&gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/HassiumTeam/Hassium&quot; rel=&quot;nofollow&quot;&gt;&lt;strong&gt;Hassium GitHub&lt;/strong&gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="45045" LastEditorUserId="8478" LastEditDate="2015-09-20T11:05:52.123" LastActivityDate="2015-09-20T11:05:52.123" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7010" PostTypeId="1" CreationDate="2015-09-20T12:04:41.177" Score="2" ViewCount="116" Body="&lt;p&gt;Right now we have a rule in place that limits answers to language implementations that were made &lt;em&gt;before&lt;/em&gt; the question was posted. This makes sense, because otherwise I could invent a programming language after a certain problem was posted that solves the problem in 0 bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I feel like another facet of this issue has been left undiscussed so far: old questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Languages change over time, and new (legitimate) languages are constructed all the time. If I want to post an answer to a year old question however, I must track down which version of my preferred programming language I can use, if I can use my language at all! This is especially problematic for esolangs, which often don't have such... rigorous versioning.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we perhaps lax the restraints for new languages/versions for old questions? If yes, how?&lt;/p&gt;&#xA;" OwnerUserId="4162" LastActivityDate="2015-09-20T12:17:21.250" Title="Tackling old challenges with new, legitimate technology" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7011" PostTypeId="2" ParentId="7010" CreationDate="2015-09-20T12:17:21.250" Score="5" Body="&lt;p&gt;I think nobody cares if you use a newer version of a 'ordinary' language. The only thing we want to prevent with this rule is - what you already said - that people come up with a new 'esolang' that is just designed for one specific challenge. I think the use of some common sense can be expected here.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastActivityDate="2015-09-20T12:17:21.250" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7012" PostTypeId="2" ParentId="6918" CreationDate="2015-09-20T12:20:50.570" Score="2" Body="&lt;h1&gt;MOVr&lt;/h1&gt;&#xA;&lt;p&gt;MOVr is a self-modifying language of mine in which everything is a MOV instruction (and simultaneously data.) However, the 2^24 64-bit words of addressable data also include the IP (at 0xfffffe) and an IO port (at 0xfffffd.) Instructions take the following (binary) format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 01 23 456789 ABCDEF&#xA;|dl|sl|-dest-|-src--|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;dl&lt;/code&gt; and &lt;code&gt;sl&lt;/code&gt; are the destination and source levels, which tell how many times each must be dereferenced (mod 2^24.) If &lt;code&gt;dl&lt;/code&gt; is 0, then the instruction acts as a no-op. If the IP goes past 0xffffff, the program terminates. Writes to and reads from the IO print and input Unicode characters. Data not filled by the program is assumed to be zeroed. This means that if you don't jump to the exit (with 0x0100fffffeffffff), then your code will have to travel through all the 2^24 instructions (and possibly wreak havoc while passing through the IP and IO.) Sadly, a working interpreter is not available at this time.&lt;/p&gt;&#xA;" OwnerUserId="33208" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-09-20T12:20:50.570" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7014" PostTypeId="2" ParentId="2140" CreationDate="2015-09-20T21:16:12.800" Score="0" Body="&lt;h2&gt;With Rhyme &lt;em&gt;and&lt;/em&gt; Reason&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A budding poet (you) knows not his rhymes&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lines of code he can write deftly and quick&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And those of prose he can write mostly fine&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But the poems he creates make him sick&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Through study of verse throughout all forms known&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Our dear programmer shall learn the right way&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But alas, all of his lyrical tomes&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would have him reading until he was gray&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At once a brilliant epiphany struck&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thought he, &quot;A program is just what I need!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It will look for me and rake through the muck&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Songs and poems of all kinds it shall read&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And give to me solely their rhyming scheme&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With which I can write that of which I dream&quot;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Your Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an input, you are to output its rhyme scheme.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You are to only compare the last words in each line when looking for rhymes. These will be referred to as &quot;rhyme words.&quot;&lt;/li&gt;&#xA;&lt;li&gt;For each stanza (lines separated by single line breaks -- think something like a paragraph), you are to assign the first rhyme word the letter &quot;A.&quot; If the next one rhymes with any other preceding rhyme word, it shall be assigned the letter of said word (in this case, &quot;A&quot;), and if not, the next letter in the alphabet (in this case, &quot;B&quot;). Once you reach two or more line breaks in a row, you treat whatever follows as separate stanza.&lt;/li&gt;&#xA;&lt;li&gt;You can code it in so that when you get past the letter &quot;Z,&quot; your program wraps around and assigns rhyme words again to &quot;A,&quot; but you should not expect that there will be that many rhymes in the stanzas provided. If your program errors instead, that is admissible.&lt;/li&gt;&#xA;&lt;li&gt;Sight rhymes do &lt;strong&gt;not&lt;/strong&gt; count (you must find some sort of way to compare the words phonetically)&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input will be in the form of a file, unless your language cannot read files, in which case it will be through STDIN. It will consist of at least one stanza of written text.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your output will be either written to a file or the console (whichever is easier to read). Your output will consist of letters corresponding to the rhyme scheme as discussed in rule 2; you choose how they are formatted, but please format them in a readable fashion (especially for large inputs).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your score will be the amount of rhymes correctly identified over the total as a percentage. For example, if your program returns &lt;code&gt;ABCA DDEE&lt;/code&gt; when the actual was &lt;code&gt;ABBA CCDD&lt;/code&gt;, your score would be &lt;code&gt;3/4&lt;/code&gt;, or &lt;code&gt;75%&lt;/code&gt;, because it got &lt;code&gt;AA&lt;/code&gt;, &lt;code&gt;CC&lt;/code&gt;, and &lt;code&gt;DD&lt;/code&gt;, but not &lt;code&gt;BB&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I do not expect scores near &lt;code&gt;100%&lt;/code&gt;, due to the difficulty of this challenge, so if your score is low, don't worry about it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://hastebin.com/gopejezosi.py&quot; rel=&quot;nofollow&quot;&gt;Here&lt;/a&gt; is a link to my implementation of a scorer in Python.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input: (Sonnets from the Portuguese #43)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;How do I love thee? Let me count the ways.&#xA;I love thee to the depth and breadth and height&#xA;My soul can reach, when feeling out of sight&#xA;For the ends of Being and ideal Grace.&#xA;I love thee to the level of everyday's&#xA;Most quiet need, by sun and candle-light.&#xA;I love thee freely, as men strive for Right;&#xA;I love thee purely, as they turn from Praise.&#xA;I love thee with a passion put to use&#xA;In my old griefs, and with my childhood's faith.&#xA;I love thee with a love I seemed to lose&#xA;With my lost saints, --- I love thee with the breath,&#xA;Smiles, tears, of all my life! --- and, if God choose,&#xA;I shall but love thee better after death.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ABBA ABBA CDC DCD&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A budding poet (you) knows not his rhymes&#xA;Lines of code he can write deftly and quick&#xA;And those of prose he can write mostly fine&#xA;But the poems he creates make him sick&#xA;Through study of verse throughout all forms known&#xA;Our dear programmer shall learn the right way&#xA;But alas, all of his lyrical tomes&#xA;Would have him reading until he was gray&#xA;&#xA;At once a brilliant epiphany struck&#xA;Thought he, &quot;A program is just what I need!&#xA;It will look for me and rake through the muck&#xA;Songs and poems of all kinds it shall read&#xA;And give to me solely their rhyming scheme&#xA;With which I can write that of which I dream&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ABAB CDCD &#xA;ABAB CC&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;cow&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Error.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ABCDEFGHIJKLMNOPQRSTUVWXYZA&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;What I'm looking for help with&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;s&gt;How can I figure out a way of easily scoring answers (this seems to be a programming puzzle in and of itself)? Maybe check to see if the characters used match&lt;/s&gt; I've made a &lt;a href=&quot;http://hastebin.com/gopejezosi.py&quot; rel=&quot;nofollow&quot;&gt;scorer&lt;/a&gt; in Python, but I'm not 100% sure yet that it is completely accurate. &lt;/li&gt;&#xA;&lt;li&gt;Is this challenge too difficult; should I restrict it to only a certain few test cases?&lt;/li&gt;&#xA;&lt;li&gt;Regarding test cases, I plan on making a large one for purposes of scoring - how many lines of rhymes would be good?&lt;/li&gt;&#xA;&lt;li&gt;Would this maybe do better as a partially &lt;code&gt;code golf&lt;/code&gt; challenge (factor in length with scoring) with the goal being to be able to give the scheme as accurately as possible for only a few test cases (although I believe that would make this come close to being a duplicate)?&lt;/li&gt;&#xA;&lt;li&gt;Anything else at all that you notice&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="42833" LastEditorUserId="42833" LastEditDate="2015-09-21T01:48:00.723" LastActivityDate="2015-09-21T01:48:00.723" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7015" PostTypeId="2" ParentId="2140" CreationDate="2015-09-21T00:54:25.850" Score="1" Body="&lt;h1&gt;Another cake question - Share it fairly!&lt;/h1&gt;&#xA;&lt;p&gt;I'm having a party, and there were going to be 8 of us. As I like to cut the slices of cake fairly, I normally get a round cake and make the cuts with the help of a protractor (any code golfer would!) But this time I found the bakery were making octagonal cakes, so I bought one of these to help me with my cutting.&lt;/p&gt;&#xA;&lt;p&gt;The problem is, now there are only 7 of us! Some people are &lt;em&gt;so&lt;/em&gt; inconsiderate, dropping out at the last minute! How am I going to cut the cake fairly now?&lt;/p&gt;&#xA;&lt;p&gt;Well it turns out that at &lt;a href=&quot;https://puzzling.stackexchange.com/a/18244/4768&quot;&gt;https://puzzling.stackexchange.com/a/18244/4768&lt;/a&gt; they have the answer. Although my protractor is no good, it's still true that if I start my cuts at evenly spaced points on the perimeter of the cake and end at the centre, all the slices will be of equal size &lt;strong&gt;and&lt;/strong&gt; have an equal area of icing. This is very important. This is quite easy to prove for cakes in the shape of any regular polygon, using the fact that the area of a triangle is base*height/2.&lt;/p&gt;&#xA;&lt;p&gt;I need you to write me a program or function to show me how to cut my cake.&lt;/p&gt;&#xA;&lt;p&gt;The code will take 2 inputs: the number of edges on the cake (3 to 15) and the number of pieces to cut it into (3 to 40).&lt;/p&gt;&#xA;&lt;p&gt;It will output a diagram showing the cake (a regular polygon) and the positions where the cuts are to be made (lines radiating out from the centre to equally spaced points on the perimeter.)&lt;/p&gt;&#xA;&lt;p&gt;Some examples are shown below. Note for example that for the case &lt;code&gt;3,9&lt;/code&gt; the slices are all equal size, but the angles at the centre of the cake are not.&lt;/p&gt;&#xA;&lt;p&gt;You can orient the cake any way you like, but one of the cuts has to pass through a vertex for easy comparison of answers.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/v19Cf.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/v19Cf.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Scoring: this is code golf. Shortest code in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-09-21T00:54:25.850" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7016" PostTypeId="2" ParentId="2140" CreationDate="2015-09-21T08:38:09.960" Score="0" Body="&lt;h1&gt;Format the code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given some source code in a C-like language, format (prettify) it using the following rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;remove all leading/trailing whitespace on each line&lt;/li&gt;&#xA;&lt;li&gt;collapse consecutive empty lines into one empty line&lt;/li&gt;&#xA;&lt;li&gt;if the first line is empty, remove it; same with the last line&lt;/li&gt;&#xA;&lt;li&gt;split lines after each occurrence of a semicolon (&lt;code&gt;;&lt;/code&gt;) or left curly bracket (&lt;code&gt;{&lt;/code&gt;); if it's the last character on the line, leave it as it is&lt;/li&gt;&#xA;&lt;li&gt;split lines at each right curly bracket (&lt;code&gt;}&lt;/code&gt;), so that the bracket is on a line by itself&lt;/li&gt;&#xA;&lt;li&gt;remove all leading/trailing whitespace (if any) that appeared after splitting&lt;/li&gt;&#xA;&lt;li&gt;if a left curly bracket is alone on a line, move it to the end of the previous non-empty line, preceded by one space; any preceding empty line should be removed&lt;/li&gt;&#xA;&lt;li&gt;each line gets an indentation level: the initial level is 0, and is incremented after each left curly bracket and decremented before each right curly bracket; prefix each non-empty line with a number of tab characters given by its indentation level&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The input consists of ASCII characters with codes 9, 10 and 32-126. The first non-whitespace character in the input is not a curly bracket. All curly brackets are balanced correctly. You don't need to do any special handling for strings, characters or comments. The output should end in exactly 1 newline character.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;TODO:&lt;/strong&gt; add examples, restrictions and more details&lt;br&gt;&#xA;Oh, and it's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="7416" LastActivityDate="2015-09-21T08:38:09.960" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7017" PostTypeId="2" ParentId="2140" CreationDate="2015-09-21T14:29:52.673" Score="0" Body="&lt;h2&gt;My first challenge in a long time. Feedback would be appreciated!&lt;/h2&gt;&#xA;&#xA;&lt;h1&gt;Last Minute Shipments&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's the situation: You're an engineer for Acme Rail Shipping Inc. There's a string of shipments to make for tomorrow but it turns out at the last moment that they're actually expected to arrive today! There isn't enough time to stop at every destination. It doesn't matter if you skip a few stops as long as you get to others as fast as possible. Your task is to figure out which ones to skip. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given a list of stops and a minimum number of stops to make, write a program or function that outputs the list of stops to make that results in the &lt;em&gt;lowest total time taken&lt;/em&gt;. &lt;strong&gt;Here's the catch:&lt;/strong&gt; Your train is very long and very heavy, so it takes a long time to accelerate. Sometimes it may be more efficient to skip a stop rather than to slow down to make it. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your train starts with the front at the origin and is at rest.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each stop is a point along your 1D route defined by a positive distance from the origin. &lt;/li&gt;&#xA;&lt;li&gt;To make a stop, you must slow down to rest with the front of the train on the point. The shipment is delivered immediately so right as you reach rest, you start accelerating again. &lt;/li&gt;&#xA;&lt;li&gt;The train accelerates uniformly at 0.3 m/s^2 and brakes uniformly at 1.2 m/s^2 (&lt;em&gt;I'm not sure how realistic these values are. Subject to change. Feedback would be helpful.&lt;/em&gt;) &lt;/li&gt;&#xA;&lt;li&gt;Assume that there is no upper speed limit to the train. Therefore, you should be accelerating at every point between stops.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Added&lt;/em&gt;: &lt;strong&gt;You cannot go backwards.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Added&lt;/em&gt;: Total time will be measured from when you start to when you pass or arrive at the last stop, &lt;em&gt;regardless of whether you decide to make it or not&lt;/em&gt;. You can't just leave your train in the middle of the route! This means that, for example, if you skip the last stop, then the total time will include the time taken for the train to accelerate from the second to last stop and reach the last stop at some velocity. If you don't skip the last stop, the measured time will end when you come to rest at the last stop.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input will be a number for the minimum number of stops to make, followed by a list of distances from the origin for each stop. The first item in the list will be the distance for stop #1, the next will be distance for stop #2, then distance for stop #3, etc. Distances in the list are strictly increasing and are defined in meters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can take input in any reasonable format, such as a delimited list on stdin with the first item as the minimum number of stops, as program arguments with the first item as the minimum number, or as parameters to a function. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Output will be a list of stops to make. This list will contain the numbers of each stop, as defined in the previous section. For example, if it is determined that stops 2, 3, and 5 out of five stops need to be made, the output would be &lt;code&gt;2, 3, 5&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output can be any reasonable format, such as a delimited list on stdout, or an array return value from a function. Trailing whitespace or newlines are acceptable. The list doesn't necessarily have to be sorted. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example I/O&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Coming soon&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Standard rules apply. Shortest code wins, however clever solutions will get my upvotes. Good luck! &lt;/p&gt;&#xA;" OwnerUserId="20666" LastEditorUserId="20666" LastEditDate="2015-09-21T22:02:22.697" LastActivityDate="2015-09-21T22:02:22.697" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7019" PostTypeId="2" ParentId="2140" CreationDate="2015-09-21T22:02:45.777" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Strata&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Strata_(video_game)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Strata&lt;/a&gt; is a puzzle game in which you lay coloured ribbons across a grid. When two ribbons intersect, the cell under the intersection takes on the colour of the uppermost ribbon. Here's an example puzzle, ready to solve:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After laying the first ribbon, no cells have been assigned a colour yet:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/23UmX.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/23UmX.png&quot; alt=&quot;Empty example puzzle&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Laying a perpendicular ribbon colours a cell in:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/DGJTP.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/DGJTP.png&quot; alt=&quot;Example puzzle with one ribbon&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Notice that, if the uppermost ribbon isn't the correct colour, the cell isn't filled in to let you know you've got it wrong. Also, if a cell doesn't have a target colour, it doesn't matter what colour ends up on top of it; the cell remains colourless when the second ribbon is laid across it:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/7ECyz.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/7ECyz.png&quot; alt=&quot;Example puzzle with four ribbons&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And a completed solution:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/nTtJv.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/nTtJv.png&quot; alt=&quot;Completed example puzzle&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The object of this challenge is to write a program or function that will provide a step-by-step solution for a Strata puzzle. Here is the layout for the example puzzle provided above, rotated 45 degrees clockwise and with letters a-c substituted for the cell colours:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; ba&#xA;ab &#xA;a c&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For ease of the following discussion, I've labelled the columns 1-3 and the rows A-C.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  ABC&#xA; +---&#xA;1| ba&#xA;2|ab &#xA;3|a c&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The notation for the output commands will be a single character representing the row or column to lay a ribbon upon, and then another character representing the ribbon type. For example, the command &lt;code&gt;Cb&lt;/code&gt; represents laying a ribbon of type &lt;code&gt;b&lt;/code&gt; on the rightmost column of this layout.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One of a number of valid solutions for this puzzle is &lt;code&gt;3a, Cc, 1a, 2a, Bb, Aa&lt;/code&gt;. Another is &lt;code&gt;Ca, 3c, 2a, 1a, Aa, Bb&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input will consist of the layout for a Strata puzzle. The puzzle will always form a square, with side length  of 2-9 inclusive. Each character in the input will be one of the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a lower case letter, representing the ribbon type which should be laid on top of the intersection in the completed puzzle&lt;/li&gt;&#xA;&lt;li&gt;a space, representing a cell where the type of the uppermost ribbon does not matter&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Note that a puzzle can use between 2-26 (inclusive) ribbon types, and that the types will not necessarily a the first nth letters of the alphabet. Your program/function won't be provided these separately, and should be acquired from the puzzle layout if required.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input may be provided in any reasonable form that is convenient for your chosen language. For example, you may accept input as single newline-delimited string, as an array or list of strings, etc. Please provide a description of how your submission will expect its input for testing purposes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Similarly, input can be provided in any appropriate manner. For example, as command line arguments, function arguments, as a stream via STDIN, etc. You should only specify this if it is not immediately obvious.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Output should consist of a valid solution for the given puzzle. It should consist of an ordered series of instructions, each consisting of two characters:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first character should be a number or upper case letter; a number represents a row, starting with 1 for the uppermost row, a letter represents a column, starting with A for the leftmost column (e.g., in the puzzle above, the instruction &lt;code&gt;4a&lt;/code&gt; would be invalid as there are only 3 rows)&lt;/li&gt;&#xA;&lt;li&gt;The second character should be the type of the ribbon to lay on the grid; this should be a lower case character, corresponding to one of the types provided on the input (e.g., in the example puzzle above, the instruction &lt;code&gt;Az&lt;/code&gt; would be invalid as &lt;code&gt;z&lt;/code&gt; is not one of the types used in the grid)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your program/function can provide the output pairs in any reasonable form, and on any reasonable medium. For example, as a series of comma, space, or newline separated values on STDOUT, as an array for return from a function, written to a file with specified name, etc.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Other Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A puzzle is only considered complete when all rows and columns have had a single ribbon laid across them, and no row or column can have more than one ribbon laid on it. This means that your output will consist of &lt;code&gt;2 * (side length)&lt;/code&gt; instructions.&lt;/li&gt;&#xA;&lt;li&gt;This is code golf, so the winner is the shortest solution in bytes. In the event of a tie, the earliest submission wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA;&#xA; ba&#xA;ab &#xA;a c&#xA;&#xA;Possible output:&#xA;3a, Cc, 1a, 2a, Bb, Aa&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox comments:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is my first PPCG question, so I tried to make sure every angle was covered. I think I may have gone overboard though, do you think I should get rid of any sections?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As this isn't a puzzle of my own invention, would there be any problems with posting in-game screenshots?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This puzzle is actually pretty easy to work out if you employ a backtracking technique - find a row or column consisting of a single colour, ignoring spaces and cells which have been crossed once. Add this instruction pair to the end of the prototype solution, then mark all the cells as having been crossed once (or twice). Repeat this &lt;code&gt;2 * (side length)&lt;/code&gt; times and you'll have a solution, if there is one to be found.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I want to discourage brute force solutions, so I'm going to come up with a 9x9 test case with more than 10 different types. My stats skills aren't up to much, but I think that, for a puzzle with side length &lt;code&gt;n&lt;/code&gt; and number of ribbon types &lt;code&gt;t&lt;/code&gt;, the total number of possible ways to lay ribbons on the grid is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(2n)! * (2n)^t&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Could anyone double check that for me? Also, if I were to put in a 9x9, 10-type test case, would that be big enough to rule out a brute force solution? Should I impose some form of computation time limit, and if so, how long on what sort of machine?&lt;/p&gt;&#xA;" OwnerUserId="41020" LastEditorUserId="41020" LastEditDate="2015-09-22T08:42:52.407" LastActivityDate="2015-09-22T08:42:52.407" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7020" PostTypeId="2" ParentId="6918" CreationDate="2015-09-22T06:54:16.013" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/JaniM/Joe&quot; rel=&quot;nofollow&quot;&gt;Joe&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Joe is my pet language. It is my love for functional programming and conciseness distilled into a minimal language. It has it's roots in J, from which I got many of the ideas. The language is still very much a work-in-progress, but it has shown great potential.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Joe is designed from ground up for implicit function composition and looping. That means, you should never ever need to explicitly refer to arguments of a function, nor should you ever need to explicitly write a loop of any kind. In theory, at least.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The interpreter is written in Python, but the language itself is basically uncompileable, and thus couldn't resemble Python in any way. If you have experience with APL, J, K or Q, you can pick up Joe really quickly. If not, I would recommend saving yourself from the trouble.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An example (indented lines are code):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   F:+2*&#xA;   F1 2 3&#xA;2 4 6&#xA;   1F1 2 3&#xA;3 5 7&#xA;   1 2 3F1 2 3&#xA;3 6 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="20356" LastActivityDate="2015-09-22T06:54:16.013" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7022" PostTypeId="2" ParentId="2140" CreationDate="2015-09-22T09:40:37.723" Score="2" Body="&lt;h1&gt;Whose Llama is it anyways?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/30525/beta-decay&quot;&gt;BetaDecay&lt;/a&gt; posted a legit looking &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/24252647#24252647&quot;&gt;movie poster in chat&lt;/a&gt;, which got me into thinking that this could be a very nice challenge!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Your task is to overlay a nifty llama poster on top of a movie poster in a way that it still looks a legitimate movie poster. The image posted by Beta Decay is:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://pictures.boxxspring.com/pictures/960x0/100588&quot; rel=&quot;nofollow noreferrer&quot;&gt;a http://pictures.boxxspring.com/pictures/960x0/100588&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your program will be provided with an input of fixed size (TBD) movie poster of any popular movie and a fixed llama cutout to overlay that poster as arguments. You may scale (proportionally), rotate or translate the llama cutout anywhere on the movie poster to make it look like a llama is photobombing the poster. At the same time, the output image should still look like a legitimate movie poster in a way the above poster feels real. You cannot perform any operations on the movie poster and no other operations on the cutout other than scaling, rotation and translation.&lt;/p&gt;&#xA;&lt;p&gt;This is a popularity contest, so the answer with the most net votes wins. Voters are encouraged to judge answers by:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The correct placement of the cutout such that it does not outright look like a cutout&lt;/li&gt;&#xA;&lt;li&gt;The scaling of the cutout to match with people/objects in the movie poster&lt;/li&gt;&#xA;&lt;li&gt;The placement of the cutout with respect to the movie text. i.e. The cutout should not hide the movie title in a way that its no longer understandable.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Two images in any common image format. The input can come as paths to the images or the images themselves (if your language support image input) either as function arguments, ARGV, STDIN or equivalent.&lt;/p&gt;&#xA;&lt;p&gt;The first image (movie poster) will be of fixed resolution and the second image (the llama cutout) will be of enough resolution in order to have good quality even after scaling or rotation.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A single image of the same resolution as the movie poster image in any favorable image format.&lt;/p&gt;&#xA;&lt;h1&gt;Llama Cutout&lt;/h1&gt;&#xA;&lt;p&gt;Please use this cutout as the second argument in your program:&lt;/p&gt;&#xA;&lt;p&gt;[TBD]&lt;/p&gt;&#xA;&lt;h1&gt;Test Images&lt;/h1&gt;&#xA;&lt;p&gt;Here are a few images to test your algorithm on. Click on the images to get the actual resolution.&lt;/p&gt;&#xA;&lt;p&gt;TBD&lt;/p&gt;&#xA;&lt;p&gt;Please include some examples for these test images (along with other examples if needed) in your submission. Its also a good practice to briefly explain your algorithm as well.&lt;/p&gt;&#xA;" OwnerUserId="31414" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-09-22T09:40:37.723" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7023" PostTypeId="2" ParentId="2140" CreationDate="2015-09-22T10:39:17.637" Score="1" Body="&lt;h2&gt;Just repeat yourself&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program that outputs &quot;Do not repeat yourself!&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program code must respect the following constraints : &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;its length must be an even number&lt;/li&gt;&#xA;&lt;li&gt;each character that is in position &lt;code&gt;2n&lt;/code&gt; (where &lt;code&gt;n&lt;/code&gt; is an integer &gt; 0) must be equal to the character in position &lt;code&gt;2n-1&lt;/code&gt;. The second character of the program is equal to the first, the fourth is equal to the third, etc. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;HHeellllooWWoorrlldd&lt;/code&gt; is a valid program&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;123&lt;/code&gt; or &lt;code&gt;AAABBB&lt;/code&gt; or &lt;code&gt;HHeello&lt;/code&gt; are incorrect&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, so the shortest code wins!&lt;/p&gt;&#xA;" OwnerUserId="13798" LastEditorUserId="13798" LastEditDate="2015-09-22T10:44:32.183" LastActivityDate="2015-09-22T10:44:32.183" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7024" PostTypeId="2" ParentId="6983" CreationDate="2015-09-22T10:58:13.533" Score="23" Body="&lt;p&gt;Just compete with yourself and others using your language. Forget about the rep you earn. I enjoyed answernig a leap-year challenge using z/OS assembler and then seeing exactly how short I could get it. I play CoD online too and my kill/death ratio is always less than 1 - I'm not going to compete with the guys who get to play all day every day and just enjoy the game and getting a few good kills.&lt;/p&gt;&#xA;" OwnerUserId="41176" LastActivityDate="2015-09-22T10:58:13.533" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7025" PostTypeId="1" AcceptedAnswerId="7027" CreationDate="2015-09-22T12:01:09.920" Score="16" ViewCount="506" Body="&lt;p&gt;I'v seen a couple of posts adding this line to their questions:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Standard loopholes apply&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Shouldn't this be implicit for all questions? are we encouraged to edit these out?&lt;/p&gt;&#xA;" OwnerUserId="12291" LastActivityDate="2015-09-22T12:11:21.523" Title="Should Standard loopholes apply for all questions?" Tags="|discussion|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7026" PostTypeId="2" ParentId="7025" CreationDate="2015-09-22T12:10:50.843" Score="1" Body="&lt;p&gt;Standard loopholes automatically apply to all questions by default. It does not matter whether the question contains that particular text or not.&lt;/p&gt;&#xA;" OwnerUserId="31414" LastActivityDate="2015-09-22T12:10:50.843" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7027" PostTypeId="2" ParentId="7025" CreationDate="2015-09-22T12:11:21.523" Score="29" Body="&lt;p&gt;Yes, they are implicit on all challenges, so the link isn't necessary. However, I don't think the link is actually harmful, especially since new users won't be aware that there is such a thing as standard loopholes in this community. So if a challenge includes the link every now and then that might even help in showing new users that they exist.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-09-22T12:11:21.523" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7028" PostTypeId="1" AcceptedAnswerId="7029" CreationDate="2015-09-22T13:30:42.977" Score="3" ViewCount="106" Body="&lt;p&gt;This morning I have asked &lt;a href=&quot;https://codegolf.stackexchange.com/questions/58451/stack-to-the-future&quot;&gt;a question that was put on hold as too broad&lt;/a&gt;. So I'm a bit confused as to what is considered too broad. At first I thought it was the fact that I'm not asking for a specific output but before asking I looked for inspiration in what people enjoyed on this site (i.e. the top voted question):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44680/showcase-your-language-one-vote-at-a-time&quot;&gt;Showcase your language&lt;/a&gt;. There is no desired output appart from showcasing:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;obscure or interesting features&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;for a snippet of length x.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/24623/write-program-in-your-favorite-language-in-another-language&quot;&gt;Write program in your favorite language in another language&lt;/a&gt; specifies that:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The program desn't have to do anything useful.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Neither asks for a specific output, and both worked quite well, so I'm a bit puzzled as what differs in the question I asked and what can I do to improve it.&lt;/p&gt;&#xA;" OwnerUserId="41060" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2015-09-22T13:58:44.400" Title="What is too broad?" Tags="|discussion|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7029" PostTypeId="2" ParentId="7028" CreationDate="2015-09-22T13:50:58.007" Score="6" Body="&lt;p&gt;While this is true on other stacks, I feel it more common here to say that &lt;strong&gt;&lt;em&gt;Too Broad&lt;/em&gt; is subjective.&lt;/strong&gt; People can (and often do) disagree with the broadness of a challenge, and both sides be &quot;right&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That being said, the banner text for this close reason does a pretty good job of describing it:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;There are either too many possible answers... Please add details &lt;em&gt;to narrow the answer set...&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So basically, you could just answer any old thing and it would be valid. The only criteria you seem to have are length and &quot;something BTTF related&quot;. Personally, I'd say this question is a perfect example of being too broad.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Now, I held back on voting on this one because I was &lt;em&gt;specifically&lt;/em&gt; thinking about one of the posts you linked, &lt;a href=&quot;https://codegolf.stackexchange.com/q/44680/14215&quot;&gt;Showcase Your Language&lt;/a&gt;. While I still think that one is a bit more constrained in some ways (and less constrained in others), that question got closed as well. It was later reopened, and has remained open since. Further, at least a couple people who voted to close that one also voted to close yours. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So like I said, it's subjective, and &lt;em&gt;individual&lt;/em&gt; people seem to be generally consistent with voting. Since it's only been up for a few hours, many in the community probably haven't seen it yet. Once everyone has time to weigh in, it might (or might not) be reopened.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2015-09-22T13:58:44.400" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7030" PostTypeId="2" ParentId="2140" CreationDate="2015-09-22T18:38:07.017" Score="0" Body="&lt;h1&gt;Find Your Stack Exchange Spirit Pokemon &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It's a popular game on the internet to take some numbers related to someone (usually their birthday/age), multiply them, and divide until you get a number between 1 and 720. That number is the Pokedex number of your &quot;spirit Pokemon&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We're going to play the same game, but since this is Stack Exchange, we'll be using our user IDs. And since this is PPCG, we'll be writing a program to tell us what our Stack Exchange-based spirit Pokemon is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To find it, take any user, then multiply their user ID by the number of letters in their name. Take that number mod 720, then add 1 (so 0 will become 1 and 719 will become 720). That's the Pokedex number of their spirit Pokemon.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A valid user ID greater than 0, and a valid name, in this format:&lt;br&gt;&#xA;&lt;code&gt;&amp;lt;ID&amp;gt; &amp;lt;name&amp;gt;&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The site does not matter, and it won't be given.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may accept input from either the command-line or STDIN (or your language's closest equivalent.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The name of the user's spirit Pokemon (as determined above.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Additional Files&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since there's no way you can cram 720 names into one program, you'll be given a file with the names of all the Pokemon (in order). Here it is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Bulbasaur&#xA;Ivysaur&#xA;Venusaur&#xA;Charmander&#xA;Charmeleon&#xA;Charizard&#xA;Squirtle&#xA;Wartortle&#xA;Blastoise&#xA;Caterpie&#xA;Metapod&#xA;Butterfree&#xA;Weedle&#xA;Kakuna&#xA;Beedrill&#xA;Pidgey&#xA;Pidgeotto&#xA;Pidgeot&#xA;Rattata&#xA;Raticate&#xA;Spearow&#xA;Fearow&#xA;Ekans&#xA;Arbok&#xA;Pikachu&#xA;Raichu&#xA;Sandshrew&#xA;Sandslash&#xA;Nidoran♀&#xA;Nidorina&#xA;Nidoqueen&#xA;Nidoran♂&#xA;Nidorino&#xA;Nidoking&#xA;Clefairy&#xA;Clefable&#xA;Vulpix&#xA;Ninetales&#xA;Jigglypuff&#xA;Wigglytuff&#xA;Zubat&#xA;Golbat&#xA;Oddish&#xA;Gloom&#xA;Vileplume&#xA;Paras&#xA;Parasect&#xA;Venonat&#xA;Venomoth&#xA;Diglett&#xA;Dugtrio&#xA;Meowth&#xA;Persian&#xA;Psyduck&#xA;Golduck&#xA;Mankey&#xA;Primeape&#xA;Growlithe&#xA;Arcanine&#xA;Poliwag&#xA;Poliwhirl&#xA;Poliwrath&#xA;Abra&#xA;Kadabra&#xA;Alakazam&#xA;Machop&#xA;Machoke&#xA;Machamp&#xA;Bellsprout&#xA;Weepinbell&#xA;Victreebel&#xA;Tentacool&#xA;Tentacruel&#xA;Geodude&#xA;Graveler&#xA;Golem&#xA;Ponyta&#xA;Rapidash&#xA;Slowpoke&#xA;Slowbro&#xA;Magnemite&#xA;Magneton&#xA;Farfetch'd&#xA;Doduo&#xA;Dodrio&#xA;Seel&#xA;Dewgong&#xA;Grimer&#xA;Muk&#xA;Shellder&#xA;Cloyster&#xA;Gastly&#xA;Haunter&#xA;Gengar&#xA;Onix&#xA;Drowzee&#xA;Hypno&#xA;Krabby&#xA;Kingler&#xA;Voltorb&#xA;Electrode&#xA;Exeggcute&#xA;Exeggutor&#xA;Cubone&#xA;Marowak&#xA;Hitmonlee&#xA;Hitmonchan&#xA;Lickitung&#xA;Koffing&#xA;Weezing&#xA;Rhyhorn&#xA;Rhydon&#xA;Chansey&#xA;Tangela&#xA;Kangaskhan&#xA;Horsea&#xA;Seadra&#xA;Goldeen&#xA;Seaking&#xA;Staryu&#xA;Starmie&#xA;Mr. Mime&#xA;Scyther&#xA;Jynx&#xA;Electabuzz&#xA;Magmar&#xA;Pinsir&#xA;Tauros&#xA;Magikarp&#xA;Gyarados&#xA;Lapras&#xA;Ditto&#xA;Eevee&#xA;Vaporeon&#xA;Jolteon&#xA;Flareon&#xA;Porygon&#xA;Omanyte&#xA;Omastar&#xA;Kabuto&#xA;Kabutops&#xA;Aerodactyl&#xA;Snorlax&#xA;Articuno&#xA;Zapdos&#xA;Moltres&#xA;Dratini&#xA;Dragonair&#xA;Dragonite&#xA;Mewtwo&#xA;Mew&#xA;Chikorita&#xA;Bayleef&#xA;Meganium&#xA;Cyndaquil&#xA;Quilava&#xA;Typhlosion&#xA;Totodile&#xA;Croconaw&#xA;Feraligatr&#xA;Sentret&#xA;Furret&#xA;Hoothoot&#xA;Noctowl&#xA;Ledyba&#xA;Ledian&#xA;Spinarak&#xA;Ariados&#xA;Crobat&#xA;Chinchou&#xA;Lanturn&#xA;Pichu&#xA;Cleffa&#xA;Igglybuff&#xA;Togepi&#xA;Togetic&#xA;Natu&#xA;Xatu&#xA;Mareep&#xA;Flaaffy&#xA;Ampharos&#xA;Bellossom&#xA;Marill&#xA;Azumarill&#xA;Sudowoodo&#xA;Politoed&#xA;Hoppip&#xA;Skiploom&#xA;Jumpluff&#xA;Aipom&#xA;Sunkern&#xA;Sunflora&#xA;Yanma&#xA;Wooper&#xA;Quagsire&#xA;Espeon&#xA;Umbreon&#xA;Murkrow&#xA;Slowking&#xA;Misdreavus&#xA;Unown&#xA;Wobbuffet&#xA;Girafarig&#xA;Pineco&#xA;Forretress&#xA;Dunsparce&#xA;Gligar&#xA;Steelix&#xA;Snubbull&#xA;Granbull&#xA;Qwilfish&#xA;Scizor&#xA;Shuckle&#xA;Heracross&#xA;Sneasel&#xA;Teddiursa&#xA;Ursaring&#xA;Slugma&#xA;Magcargo&#xA;Swinub&#xA;Piloswine&#xA;Corsola&#xA;Remoraid&#xA;Octillery&#xA;Delibird&#xA;Mantine&#xA;Skarmory&#xA;Houndour&#xA;Houndoom&#xA;Kingdra&#xA;Phanpy&#xA;Donphan&#xA;Porygon2&#xA;Stantler&#xA;Smeargle&#xA;Tyrogue&#xA;Hitmontop&#xA;Smoochum&#xA;Elekid&#xA;Magby&#xA;Miltank&#xA;Blissey&#xA;Raikou&#xA;Entei&#xA;Suicune&#xA;Larvitar&#xA;Pupitar&#xA;Tyranitar&#xA;Lugia&#xA;Ho-oh&#xA;Celebi&#xA;Treecko&#xA;Grovyle&#xA;Sceptile&#xA;Torchic&#xA;Combusken&#xA;Blaziken&#xA;Mudkip&#xA;Marshtomp&#xA;Swampert&#xA;Poochyena&#xA;Mightyena&#xA;Zigzagoon&#xA;Linoone&#xA;Wurmple&#xA;Silcoon&#xA;Beautifly&#xA;Cascoon&#xA;Dustox&#xA;Lotad&#xA;Lombre&#xA;Ludicolo&#xA;Seedot&#xA;Nuzleaf&#xA;Shiftry&#xA;Taillow&#xA;Swellow&#xA;Wingull&#xA;Pelipper&#xA;Ralts&#xA;Kirlia&#xA;Gardevoir&#xA;Surskit&#xA;Masquerain&#xA;Shroomish&#xA;Breloom&#xA;Slakoth&#xA;Vigoroth&#xA;Slaking&#xA;Nincada&#xA;Ninjask&#xA;Shedinja&#xA;Whismur&#xA;Loudred&#xA;Exploud&#xA;Makuhita&#xA;Hariyama&#xA;Azurill&#xA;Nosepass&#xA;Skitty&#xA;Delcatty&#xA;Sableye&#xA;Mawile&#xA;Aron&#xA;Lairon&#xA;Aggron&#xA;Meditite&#xA;Medicham&#xA;Electrike&#xA;Manectric&#xA;Plusle&#xA;Minun&#xA;Volbeat&#xA;Illumise&#xA;Roselia&#xA;Gulpin&#xA;Swalot&#xA;Carvanha&#xA;Sharpedo&#xA;Wailmer&#xA;Wailord&#xA;Numel&#xA;Camerupt&#xA;Torkoal&#xA;Spoink&#xA;Grumpig&#xA;Spinda&#xA;Trapinch&#xA;Vibrava&#xA;Flygon&#xA;Cacnea&#xA;Cacturne&#xA;Swablu&#xA;Altaria&#xA;Zangoose&#xA;Seviper&#xA;Lunatone&#xA;Solrock&#xA;Barboach&#xA;Whiscash&#xA;Corphish&#xA;Crawdaunt&#xA;Baltoy&#xA;Claydol&#xA;Lileep&#xA;Cradily&#xA;Anorith&#xA;Armaldo&#xA;Feebas&#xA;Milotic&#xA;Castform&#xA;Kecleon&#xA;Shuppet&#xA;Banette&#xA;Duskull&#xA;Dusclops&#xA;Tropius&#xA;Chimecho&#xA;Absol&#xA;Wynaut&#xA;Snorunt&#xA;Glalie&#xA;Spheal&#xA;Sealeo&#xA;Walrein&#xA;Clamperl&#xA;Huntail&#xA;Gorebyss&#xA;Relicanth&#xA;Luvdisc&#xA;Bagon&#xA;Shelgon&#xA;Salamence&#xA;Beldum&#xA;Metang&#xA;Metagross&#xA;Regirock&#xA;Regice&#xA;Registeel&#xA;Latias&#xA;Latios&#xA;Kyogre&#xA;Groudon&#xA;Rayquaza&#xA;Jirachi&#xA;Deoxys&#xA;Turtwig&#xA;Grotle&#xA;Torterra&#xA;Chimchar&#xA;Monferno&#xA;Infernape&#xA;Piplup&#xA;Prinplup&#xA;Empoleon&#xA;Starly&#xA;Staravia&#xA;Staraptor&#xA;Bidoof&#xA;Bibarel&#xA;Kricketot&#xA;Kricketune&#xA;Shinx&#xA;Luxio&#xA;Luxray&#xA;Budew&#xA;Roserade&#xA;Cranidos&#xA;Rampardos&#xA;Shieldon&#xA;Bastiodon&#xA;Burmy&#xA;Wormadam&#xA;Mothim&#xA;Combee&#xA;Vespiquen&#xA;Pachirisu&#xA;Buizel&#xA;Floatzel&#xA;Cherubi&#xA;Cherrim&#xA;Shellos&#xA;Gastrodon&#xA;Ambipom&#xA;Drifloon&#xA;Drifblim&#xA;Buneary&#xA;Lopunny&#xA;Mismagius&#xA;Honchkrow&#xA;Glameow&#xA;Purugly&#xA;Chingling&#xA;Stunky&#xA;Skuntank&#xA;Bronzor&#xA;Bronzong&#xA;Bonsly&#xA;Mime Jr.&#xA;Happiny&#xA;Chatot&#xA;Spiritomb&#xA;Gible&#xA;Gabite&#xA;Garchomp&#xA;Munchlax&#xA;Riolu&#xA;Lucario&#xA;Hippopotas&#xA;Hippowdon&#xA;Skorupi&#xA;Drapion&#xA;Croagunk&#xA;Toxicroak&#xA;Carnivine&#xA;Finneon&#xA;Lumineon&#xA;Mantyke&#xA;Snover&#xA;Abomasnow&#xA;Weavile&#xA;Magnezone&#xA;Lickilicky&#xA;Rhyperior&#xA;Tangrowth&#xA;Electivire&#xA;Magmortar&#xA;Togekiss&#xA;Yanmega&#xA;Leafeon&#xA;Glaceon&#xA;Gliscor&#xA;Mamoswine&#xA;Porygon-Z&#xA;Gallade&#xA;Probopass&#xA;Dusknoir&#xA;Froslass&#xA;Rotom&#xA;Uxie&#xA;Mesprit&#xA;Azelf&#xA;Dialga&#xA;Palkia&#xA;Heatran&#xA;Regigigas&#xA;Giratina&#xA;Cresselia&#xA;Phione&#xA;Manaphy&#xA;Darkrai&#xA;Shaymin&#xA;Arceus&#xA;Victini&#xA;Snivy&#xA;Servine&#xA;Serperior&#xA;Tepig&#xA;Pignite&#xA;Emboar&#xA;Oshawott&#xA;Dewott&#xA;Samurott&#xA;Patrat&#xA;Watchog&#xA;Lillipup&#xA;Herdier&#xA;Stoutland&#xA;Purrloin&#xA;Liepard&#xA;Pansage&#xA;Simisage&#xA;Pansear&#xA;Simisear&#xA;Panpour&#xA;Simipour&#xA;Munna&#xA;Musharna&#xA;Pidove&#xA;Tranquill&#xA;Unfezant&#xA;Blitzle&#xA;Zebstrika&#xA;Roggenrola&#xA;Boldore&#xA;Gigalith&#xA;Woobat&#xA;Swoobat&#xA;Drilbur&#xA;Excadrill&#xA;Audino&#xA;Timburr&#xA;Gurdurr&#xA;Conkeldurr&#xA;Tympole&#xA;Palpitoad&#xA;Seismitoad&#xA;Throh&#xA;Sawk&#xA;Sewaddle&#xA;Swadloon&#xA;Leavanny&#xA;Venipede&#xA;Whirlipede&#xA;Scolipede&#xA;Cottonee&#xA;Whimsicott&#xA;Petilil&#xA;Lilligant&#xA;Basculin&#xA;Sandile&#xA;Krokorok&#xA;Krookodile&#xA;Darumaka&#xA;Darmanitan&#xA;Maractus&#xA;Dwebble&#xA;Crustle&#xA;Scraggy&#xA;Scrafty&#xA;Sigilyph&#xA;Yamask&#xA;Cofagrigus&#xA;Tirtouga&#xA;Carracosta&#xA;Archen&#xA;Archeops&#xA;Trubbish&#xA;Garbodor&#xA;Zorua&#xA;Zoroark&#xA;Minccino&#xA;Cinccino&#xA;Gothita&#xA;Gothorita&#xA;Gothitelle&#xA;Solosis&#xA;Duosion&#xA;Reuniclus&#xA;Ducklett&#xA;Swanna&#xA;Vanillite&#xA;Vanillish&#xA;Vanilluxe&#xA;Deerling&#xA;Sawsbuck&#xA;Emolga&#xA;Karrablast&#xA;Escavalier&#xA;Foongus&#xA;Amoonguss&#xA;Frillish&#xA;Jellicent&#xA;Alomomola&#xA;Joltik&#xA;Galvantula&#xA;Ferroseed&#xA;Ferrothorn&#xA;Klink&#xA;Klang&#xA;Klinklang&#xA;Tynamo&#xA;Eelektrik&#xA;Eelektross&#xA;Elgyem&#xA;Beheeyem&#xA;Litwick&#xA;Lampent&#xA;Chandelure&#xA;Axew&#xA;Fraxure&#xA;Haxorus&#xA;Cubchoo&#xA;Beartic&#xA;Cryogonal&#xA;Shelmet&#xA;Accelgor&#xA;Stunfisk&#xA;Mienfoo&#xA;Mienshao&#xA;Druddigon&#xA;Golett&#xA;Golurk&#xA;Pawniard&#xA;Bisharp&#xA;Bouffalant&#xA;Rufflet&#xA;Braviary&#xA;Vullaby&#xA;Mandibuzz&#xA;Heatmor&#xA;Durant&#xA;Deino&#xA;Zweilous&#xA;Hydreigon&#xA;Larvesta&#xA;Volcarona&#xA;Cobalion&#xA;Terrakion&#xA;Virizion&#xA;Tornadus&#xA;Thundurus&#xA;Reshiram&#xA;Zekrom&#xA;Landorus&#xA;Kyurem&#xA;Keldeo&#xA;Meloetta&#xA;Genesect&#xA;Chespin&#xA;Quilladin&#xA;Chesnaught&#xA;Fennekin&#xA;Braixen&#xA;Delphox&#xA;Froakie&#xA;Frogadier&#xA;Greninja&#xA;Bunnelby&#xA;Diggersby&#xA;Fletchling&#xA;Fletchinder&#xA;Talonflame&#xA;Scatterbug&#xA;Spewpa&#xA;Vivillon&#xA;Litleo&#xA;Pyroar&#xA;Flabebe&#xA;Floette&#xA;Florges&#xA;Skiddo&#xA;Gogoat&#xA;Pancham&#xA;Pangoro&#xA;Furfrou&#xA;Espurr&#xA;Meowstic&#xA;Honedge&#xA;Doublade&#xA;Aegislash&#xA;Spritzee&#xA;Aromatisse&#xA;Swirlix&#xA;Slurpuff&#xA;Inkay&#xA;Malamar&#xA;Binacle&#xA;Barbaracle&#xA;Skrelp&#xA;Dragalge&#xA;Clauncher&#xA;Clawitzer&#xA;Helioptile&#xA;Heliolisk&#xA;Tyrunt&#xA;Tyrantrum&#xA;Amaura&#xA;Aurorus&#xA;Sylveon&#xA;Hawlucha&#xA;Dedenne&#xA;Carbink&#xA;Goomy&#xA;Sliggoo&#xA;Goodra&#xA;Klefki&#xA;Phantump&#xA;Trevenant&#xA;Pumpkaboo&#xA;Gourgeist&#xA;Bergmite&#xA;Avalugg&#xA;Noibat&#xA;Noivern&#xA;Xerneas&#xA;Yveltal&#xA;Zygarde&#xA;Diancie&#xA;Hoopa&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The file containing all the Pokemon must be saved as &quot;pokemonlist&quot;.&lt;/li&gt;&#xA;&lt;li&gt;You may not open any files other than &quot;pokemonlist&quot;.&lt;/li&gt;&#xA;&lt;li&gt;The program must output the name of the Pokemon, not just the number.&lt;/li&gt;&#xA;&lt;li&gt;Your program must work for any valid Stack Exhange user name and ID.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Bonuses&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;-50 points if you return &quot;MissingNo.&quot; if the input &lt;code&gt;-1 Community&lt;/code&gt; is entered.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Meta Questions&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are the rules clear?&lt;/li&gt;&#xA;&lt;li&gt;Is the formula enough of a challenge?&lt;/li&gt;&#xA;&lt;li&gt;I had a problem with the previous formula being too easy, so I've changed it. However, I'm not sure whether the problem was in the formula or the challenge itself. Will this challenge work, or is it too easy regardless of what formula I use?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="38891" LastEditorUserId="38891" LastEditDate="2015-09-24T13:44:38.333" LastActivityDate="2015-09-24T13:44:38.333" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7031" PostTypeId="2" ParentId="2447" CreationDate="2015-09-22T19:45:25.023" Score="50" Body="&lt;h1&gt;Input for Turing machines may be written to the tape pre-execution&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The read-write head should start on the leftmost cell of the portion of the tape containing the input.&lt;/p&gt;&#xA;" OwnerUserId="39022" LastActivityDate="2015-09-22T19:45:25.023" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7032" PostTypeId="2" ParentId="2447" CreationDate="2015-09-22T19:46:43.773" Score="79" Body="&lt;h1&gt;The contents of the tape post-execution may be used as a Turing machine's output&lt;/h1&gt;&#xA;" OwnerUserId="39022" LastActivityDate="2015-09-22T19:46:43.773" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7033" PostTypeId="2" ParentId="2447" CreationDate="2015-09-22T19:49:48.627" Score="51" Body="&lt;h1&gt;Where applicable, Turing machines supporting multiple halt states may also output via their halt state&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is essentially equivalent to programs outputting via their exit code.&lt;/p&gt;&#xA;" OwnerUserId="39022" LastEditorUserId="39022" LastEditDate="2019-03-18T22:39:27.930" LastActivityDate="2019-03-18T22:39:27.930" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="7034" PostTypeId="2" ParentId="2140" CreationDate="2015-09-22T19:50:05.667" Score="0" Body="&lt;h1&gt;It's a small world! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A challenge inspired by &lt;a href=&quot;https://en.wikipedia.org/wiki/Small-world_network&quot; rel=&quot;nofollow noreferrer&quot;&gt;small world networks&lt;/a&gt;. It is said that in such a network, starting at any point, you are able to reach any other node of the network in a specific amount of hops.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task will be determining the smallest number of hops necessary to reach any other node (maximum short-path length, aka graph diameter) and the average number of hops for the same purpose.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your program will recieve on its stdin some amount of lines, with space-separated numbers on it. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Line number &lt;code&gt;N&lt;/code&gt; will list the line numbers of the nodes node &lt;code&gt;N&lt;/code&gt; is connected to. Every node is linked mutually, there are no unidirectional eges.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2 3&#xA;1 4&#xA;1&#xA;2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Each line can be assumed to be sorted.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your program must compute the smallest number of hops necessary to depart from one node and land on any &lt;em&gt;different&lt;/em&gt; node, and the average number of hops to traverse any node. Print it to stdout in any format desired. The average path length must be a decimal with at least 2 digits of precision.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The average path length is defined (for the purposes of this challenge) as the sum of the smallest number of hops between any 2 points divided by the amount of edges in the network (direct connections) plus the biggest short-path. The sum-of-short-paths includes the edges themselves (e.g. paths to neighbouring nodes), but not reversed paths (A to B and B to A).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;sum(short_paths)/(edges+long)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The network represented in this image:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/s1231.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/s1231.png&quot; alt=&quot;visual representation of network&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Will be input to your program as:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2 4&#xA;1 3 5&#xA;2 4&#xA;1 3&#xA;2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And the program must output something in the form of:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3&#xA;2.0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The average was calculated in this manner:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;p12 = 1; p13 = 2; p14 = 1; p15 = 2; p23 = 1; p24 = 2; p25 = 1; p34 = 1; p35 = 2; p45=3&#xA;e = 5&#xA;A = sum(p) / (e+p45)&#xA;(5+8+3)/(5+3)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Basic &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules, avoid standard loopholes&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I can see an issue with the &quot;average&quot; part of the challenge, since it is ill-defined and I consider this challenge quite extensive without it already.&lt;/p&gt;&#xA;" OwnerUserId="11177" LastEditorUserId="11177" LastEditDate="2015-09-23T14:16:57.827" LastActivityDate="2015-09-23T14:16:57.827" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7037" PostTypeId="2" ParentId="2140" CreationDate="2015-09-23T11:26:22.177" Score="0" Body="&lt;h1&gt;Robots on ice&lt;/h1&gt;&#xA;&lt;h2&gt;Part 1 - The basic&lt;/h2&gt;&#xA;&lt;p&gt;You are helping a robot &lt;code&gt;R&lt;/code&gt; on an iced island. &lt;code&gt;R&lt;/code&gt; can go&#xA;up/down/left/right. But since the island is made of ice, it cannot&#xA;move only 1 square at a time, but instead moves in straight line. Your&#xA;task is to help &lt;code&gt;R&lt;/code&gt; reach &lt;code&gt;G&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;The input (file, stdin, input, whatever suits you) is an &lt;code&gt;n×m&lt;/code&gt;&#xA;matrice with the following characters:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;R&lt;/code&gt; The robot&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;G&lt;/code&gt; The goal&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;#&lt;/code&gt; An obstacle that stops the robot&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt; &lt;/code&gt; Ice&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The island is surrounded by a wall: the edges of the matrice always consist of &lt;code&gt;#&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;A list of instructions consisting of U/D/L/R, corresponding to&#xA;up/down/left/right.&lt;/p&gt;&#xA;&lt;p&gt;The list should be the shortest possible. The distance traveled by the&#xA;robot doesn't count.&lt;/p&gt;&#xA;&lt;p&gt;The output should be the map with the instructions on it, with each&#xA;instruction at the right coordinates. Each of &lt;code&gt;RG# &lt;/code&gt; should be&#xA;displayed if not overriden by an instruction (that will always be the&#xA;case for &lt;code&gt;R&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;##########&#xA;# #      #&#xA;#        #&#xA;#  G #   #&#xA;#        #&#xA;#    R#  #&#xA;#        #&#xA;##########&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&#xA;Since D,R,U,L,D is one possible solution, the output should be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;##########&#xA;# #D    L#&#xA;#        #&#xA;#  G #   #&#xA;#        #&#xA;#    D#  #&#xA;#    R  U#&#xA;##########&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Another solution, U,R,U,L,D, should be output as:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;##########&#xA;# #D    L#&#xA;#        #&#xA;#  G #   #&#xA;#    R  U#&#xA;#    U#  #&#xA;#        #&#xA;##########&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;####################&#xA;###R             ###&#xA;#  ######          #&#xA;#      #####       #&#xA;##                G#&#xA;###              ###&#xA;####################&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;####################&#xA;###R            D###&#xA;#RD######          #&#xA;#U L   #####       #&#xA;##R               G#&#xA;###U            L###&#xA;####################&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You can assume that the puzzle always has at least 1 solution&lt;/p&gt;&#xA;&lt;h2&gt;Part 2 - New options&lt;/h2&gt;&#xA;&lt;p&gt;The pitch is the same, but new characters can be displayed:&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;The input (file, stdin, input, whatever suits you) is an &lt;code&gt;n×m&lt;/code&gt;&#xA;matrice with the following characters:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;R&lt;/code&gt; The robot&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;G&lt;/code&gt; The goal&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;#&lt;/code&gt; An obstacle that stops the robot&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt; &lt;/code&gt; Ice&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;W&lt;/code&gt; Some water. Robot doesn’t like water&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;B&lt;/code&gt; a Box. Robot can push the box 1 square at a time, in front of&#xA;him (not on the side), if the next square is &lt;code&gt; &lt;/code&gt;. It cannot be&#xA;pushed into the water, through the goal… Robot cannot push 2 boxes&#xA;at once. When pushing, the robot stays in place.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1&lt;/code&gt; a numbered teleportation door. Always in pair. When entering a&#xA;teleportation door, Robot will continue sliding in the same&#xA;direction through the other door. Can be used more than 1 time.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The island will this time be surrounded by water.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;A list of instructions consisting of U/D/L/R, corresponding to&#xA;up/down/left/right.&lt;/p&gt;&#xA;&lt;p&gt;The list should be the shortest possible. The distance traveled by the&#xA;robot doesn't count.&lt;/p&gt;&#xA;&lt;p&gt;This time the output won't be displayed on the map, but on stdout. The&#xA;format doesn't matter:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;UDRL&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;U&#xA;D&#xA;R&#xA;L&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;are accepted&lt;/p&gt;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;WWWWWWWWWW&#xA;W W      W&#xA;W        W&#xA;W  G 1   W&#xA;W        W&#xA;W    1R  W&#xA;W        W&#xA;WWWWWWWWWW&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;L&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;WWWWWWWWWW&#xA;W W      W&#xA;W    #   W&#xA;W  G     W&#xA;W        W&#xA;W    BR  W&#xA;W        W&#xA;WWWWWWWWWW&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;LLUL&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The first L moves the box (but not the Robot) 1 square:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;WWWWWWWWWW&#xA;W W      W&#xA;W    #   W&#xA;W  G     W&#xA;W        W&#xA;W   B R  W&#xA;W        W&#xA;WWWWWWWWWW&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;WWWWWWWWWWWWW&#xA;W         # W&#xA;W G 2       W&#xA;W           W&#xA;W   B 1     W&#xA;W#2         W&#xA;W   # 1R   #W&#xA;W          #W&#xA;W    #     #W&#xA;WWWWWWWWWWWWW&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;L #entering teleportation 1&#xA;L #pushing the box to the left&#xA;L #going to the box&#xA;U #entering teleportation 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The solution &lt;code&gt;RULU&lt;/code&gt; is also valid&lt;/p&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;WWWWWWWWWWWWW&#xA;W #         W&#xA;W     #     W&#xA;W#   1      W&#xA;W           W&#xA;W           W&#xA;W    1 R    W&#xA;W           W&#xA;W    G      W&#xA;WWWWWWWWWWWWW&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;L #entering teleportation 1&#xA;U #going to the wall&#xA;R #going to the wall&#xA;D #entering teleportation 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In this situations, Robot cannot moves to the left:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;W  GBR   W&#xA;&#xA;W  #BR   W&#xA;&#xA;W  BBR   W&#xA;&#xA;W  WBR   W&#xA;&#xA;W    R   W&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You can assume that the puzzle always has at least 1 solution&lt;/p&gt;&#xA;&lt;h2&gt;Part 3 - With help&lt;/h2&gt;&#xA;&lt;p&gt;Same as part 2 but with others robots:&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;The input (file, stdin, input, whatever suits you) is an &lt;code&gt;n×m&lt;/code&gt;&#xA;matrice with the following characters:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;R&lt;/code&gt; The robot&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;G&lt;/code&gt; The goal&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;#&lt;/code&gt; An obstacle that stops the robot&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt; &lt;/code&gt; Ice&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;W&lt;/code&gt; Some water. Robot doesn’t like water&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;B&lt;/code&gt; a Box. Robot can push the box 1 square at a time, in front of&#xA;him (not on the side), if the next square is &lt;code&gt; &lt;/code&gt;. It cannot be&#xA;pushed into the water, through the goal… Robot cannot push 2 boxes&#xA;at once. When pushing, the robot stays in place.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1&lt;/code&gt; a numbered teleportation door. Always in pair. When entering a&#xA;teleportation door, Robot will continue sliding in the same&#xA;direction through the other door. Can be used more than 1 time.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;abcde&lt;/code&gt; up to 5 robots that can move the same as Robot. They cannot&#xA;go through other robots, including R, and can pass through the Goal.&#xA;They can be sacrified by going into the water. They can be used more&#xA;than 1 time.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The island is surrounded by water.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;A list of instructions consisting of U/D/L/R, corresponding to&#xA;up/down/left/right, prefixed by the name of the robot moving.&lt;/p&gt;&#xA;&lt;p&gt;The list should be the shortest possible. The distance traveled by the&#xA;robot doesn't count.&lt;/p&gt;&#xA;&lt;p&gt;As usual, theformat doesn't matter:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a:UDR&#xA;R:LU&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;aU&#xA;aD&#xA;aR&#xA;RL&#xA;RU&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;are accepted&lt;/p&gt;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;WWWWWWWWWWWWWWWWWW&#xA;W        a     # W&#xA;W   G            W&#xA;W                W&#xA;W                W&#xA;W                W&#xA;W             R  W&#xA;W                W&#xA;W       #        W&#xA;W             #  W&#xA;W                W&#xA;WWWWWWWWWWWWWWWWWW&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a:R&#xA;R:UL&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The answer &lt;code&gt;DLUL&lt;/code&gt; is valid but not the shortest&lt;/p&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;WWWWWWWWWWWWWWWWWW&#xA;W                W&#xA;W                W&#xA;W                W&#xA;W                W&#xA;W  G    a    R   W&#xA;W                W&#xA;W                W&#xA;W                W&#xA;W                W&#xA;W                W&#xA;WWWWWWWWWWWWWWWWWW&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a:U&#xA;R:L&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;WWWWWWWWWWWWWWWWWW&#xA;W           #    W&#xA;W                W&#xA;W  #             W&#xA;W           G    W&#xA;W                W&#xA;W                W&#xA;W           b    W&#xA;W   R       a    W&#xA;W                W&#xA;W                W&#xA;WWWWWWWWWWWWWWWWWW&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;b:U&#xA;a:UL&#xA;R:UR&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;WWWWWWWWWWWWWWWWWW&#xA;W                W&#xA;W           #    W&#xA;W          B     W&#xA;W  #             W&#xA;W     G          W&#xA;W                W&#xA;W  #             W&#xA;W   e       R#   W&#xA;W                W&#xA;W           a    W&#xA;WWWWWWWWWWWWWWWWWW&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;e:R&#xA;R:U&#xA;a:UL&#xA;R:LLDLUR&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;WWWWWWWWWWWWWWWWWW&#xA;W                W&#xA;W         G #    W&#xA;W   b            W&#xA;W                W&#xA;W           a    W&#xA;W   c            W&#xA;W           #    W&#xA;W   R            W&#xA;W                W&#xA;W          #     W&#xA;WWWWWWWWWWWWWWWWWW&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a:U&#xA;b:RD&#xA;a:D&#xA;C:RD&#xA;R:RU&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;WWWWWWWWWW&#xA;W    G   W&#xA;W aBbBR  W&#xA;WWWWWWWWWW&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a:L&#xA;b:LL&#xA;R:LLU&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In this situations, &lt;code&gt;R&lt;/code&gt;obot and &lt;code&gt;b&lt;/code&gt; cannot move to the left:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;W  GaRb  W&#xA;&#xA;W  #b#R  W&#xA;&#xA;W aBbBR  W&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You can assume that the puzzle always has at least 1 solution&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&lt;p&gt;Has it been done before?&lt;/p&gt;&#xA;&lt;p&gt;What do you think? Is it understandable? Should I do 3 separated&#xA;challenges (and in the sandbox)? More, less? Which part needs more examples? What part is&#xA;unclear?&lt;/p&gt;&#xA;&lt;p&gt;I would like to go with shortest-code win. Should I use kolmogorov instead?&lt;/p&gt;&#xA;" OwnerUserId="18720" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-30T11:13:20.890" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7038" PostTypeId="2" ParentId="2140" CreationDate="2015-09-23T13:51:53.083" Score="2" Body="&lt;h1&gt;Help Agent Zigzag with his secret messages&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The WW2 double agent &lt;a href=&quot;http://en.wikipedia.org/wiki/Eddie_Chapman&quot; rel=&quot;nofollow noreferrer&quot;&gt;Eddie Chapman&lt;/a&gt; — aka &quot;Agent Zigzag&quot; — used an unusual cipher to communicate with his German controllers. It is described in the appendix of &lt;a href=&quot;http://rads.stackoverflow.com/amzn/click/B000VSW7SO&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ben Macintyre's book about Chapman&lt;/a&gt; and can also be viewed at the &lt;a href=&quot;http://discovery.nationalarchives.gov.uk/details/r/C10967545&quot; rel=&quot;nofollow noreferrer&quot;&gt;National Archives&lt;/a&gt;, apparently.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Read the following description and write a program to encrypt and decrypt messages using this system.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Your program should accept three inputs via &lt;code&gt;stdin&lt;/code&gt; and/or command line switches:&lt;/p&gt;&#xA;  &#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;A keyword&lt;/li&gt;&#xA;  &lt;li&gt;A flag to select either encryption or decryption&lt;/li&gt;&#xA;  &lt;li&gt;A message to be encrypted or decrypted&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;  &#xA;  &lt;p&gt;The output should be the corresponding ciphertext/plaintext, arranged into groups of 5 letters separated by single spaces. You may assume that the keyword consists entirely of uppercase letters, but should accept plaintexts and ciphertexts containing mixed case characters, punctuation and spaces. Non-alphabet characters should be stripped from the input and should not appear in the output (which may only contain groups of 5 uppercase characters separated by spaces, with an optional line break at the end). The date value used for keyword processing should be obtained from the system clock using the local time zone.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;This is a &lt;strong&gt;code-golf&lt;/strong&gt; challenge. The shortest code (measured in bytes) will win.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;1. Keyword processing&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write out the keyword, and below each letter write the position in which this letter would appear if the letters were all sorted alphabetically. If the same letter appears more than once, number them from left to right. For example, the 14-letter keyword CONSTANTINOPLE would be processed as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;C   O   N   S   T   A   N   T   I   N   O   P   L   E&#xA;2   9   6   12  13  1   7   14  4   8   10  11  5   3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(Notice how the three Ns are numbered 6, 7 and 8.) Combine this sequence of digits into a single number, and multiply by the current date (from 1 to 31). For example, if the transmission is being made on the 8th of the month:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2961213171448101153 x 8 = 23689705371584809224&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;2. Encryption&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Pad the secret message to a multiple of five characters in length by appending the null character X as many times as necessary, then encrypt Vigenere-style by cycling each letter through the alphabet by offsets corresponding to successive digits of the number calculated at step 1. For example, the message&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Have arrived safely and in good health. Awaiting further instructions.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is encrypted as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;havearrivedsafelyandingoodhealthawaitingfurtherinstructionsx &amp;lt;&amp;lt; Plaintext&#xA;236897053715848092242368970537158480922423689705371584809224 &amp;lt;&amp;lt; Key (repeated)&#xA;JDBMJYRNYLEXIJMLHCPHKQMWXKHJDSUMIAIICKPKHXXBQLRNQZUWCGBIXPUB &amp;lt;&amp;lt; Ciphertext&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;because 'H'+2='J', 'A'+3='D', 'V'+6='B', etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, read off the encrypted message in groups of five characters:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;JDBMJ YRNYL EXIJM LHCPH KQMWX KHJDS UMIAI ICKPK HXXBQ LRNQZ UWCGB IXPUB&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cryptography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cryptography&amp;#39;&quot; rel=&quot;tag&quot;&gt;cryptography&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="11006" LastActivityDate="2015-09-23T13:51:53.083" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7041" PostTypeId="1" AcceptedAnswerId="12956" CreationDate="2015-09-24T07:27:21.893" Score="38" ViewCount="640" Body="&lt;p&gt;Calvin's Hobbies posted on Mother Meta about increasing the character limit for posts across the Stack Exchange network. &lt;a href=&quot;https://meta.stackexchange.com/a/263792/258647&quot;&gt;This answer&lt;/a&gt; shows that it is possible to increase the limit from the standard 30,000 characters for individual SE sites, and this has already been doubled for Code Review.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To allow questions to have both a comprehensive spec and description, plus a substantial Stack Snippet, should we increase the character limit for PPCG? Would doubling the limit work for us too, or is there a reason to have more still?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples where both spec golfing and controller golfing were required due to the 30,000 character limit:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/48353/26997&quot;&gt;Red vs. Blue - Pixel Team Battlebots&lt;/a&gt; (29721 characters)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/50690/26997&quot;&gt;Block Building Bot Flocks!&lt;/a&gt; (29977 characters)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/24299617#24299617&quot;&gt;&lt;em&gt;Or should we change it to a smaller limit...?&lt;/em&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="8534" LastEditDate="2017-06-17T00:08:48.590" LastActivityDate="2017-06-17T00:08:48.590" Title="Should we increase our post character limit to allow substantial stack snippets?" Tags="|discussion|feature-request|status-completed|" AnswerCount="3" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="7042" PostTypeId="2" ParentId="2140" CreationDate="2015-09-24T14:05:40.257" Score="1" Body="&lt;h1&gt;Compute factorials &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In the style of the &lt;a href=&quot;https://codegolf.stackexchange.com/q/55422/38891&quot; title=&quot;Hello, World! codegolf catalog&quot;&gt;Hello, World!&lt;/a&gt; catalog, this question is a collection of the shortest programs that compute a factorial (a common task for new programmers) in any given language.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specifications&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program must take a positive integer as input from STDIN, and output the corresponding factorial to STDOUT (or your language's closest alternatives).&lt;br&gt;&#xA;Your program must also accept the special case of &lt;code&gt;0! = 1&lt;/code&gt; if 0 is entered. No negative numbers will be entered.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program must handle numbers up to 40 factorial (8.159152832×10⁴⁷). &lt;em&gt;Sandbox question: Is 40 factorial too large a minimum requirement? I was also considering 50 factorial is 40 is too small.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3&#xA;6&#xA;&#xA;6&#xA;720&#xA;&#xA;0&#xA;1&#xA;&#xA;11&#xA;39916800&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Additional Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;This is not about finding the language with the shortest approach for computing factorials, this is about finding the shortest approach in every language. Because of this, no answer will be marked as accepted.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Submissions are scored in bytes in an appropriate preexisting encoding, usually (but not necessarily) UTF-8. For example, Piet is scored in codels rather than bytes. If you're not sure how your language is scored, you can ask on Meta.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Nothing can be printed to STDERR.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Feel free to use a language (or language version) even if it's newer than this challenge. If anyone wants to abuse this by creating a language where the empty program computes factorials, then congrats, you've just created a boring answer.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your language must have a valid way to test your program (through an interpreter, compiler, etc.) If there aren't any, you can write one yourself.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Standard loopholes are disallowed except where specified by these rules.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;leaderboard snippet will be added once this challenge is posted&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="38891" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.127" LastActivityDate="2015-10-01T17:19:53.227" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="7043" PostTypeId="1" CreationDate="2015-09-24T14:33:04.590" Score="9" ViewCount="267" Body="&lt;p&gt;This question &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/58565/15599&quot;&gt;The Euclidean Algorithm (for finding the greatest common divisor)&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;originally had the title &quot;A Euclidean Algorithm.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A user (who happens to be German according to his profile) proposed an edit as follows:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&quot;An Euclidean Algorithm&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Now I can understand this mistake from a native German speaker because &quot;An Eulerian Algorithm&quot; (German-speaking Swiss mathematician, German pronounciation) would be correct while &quot;A Eulerian Algorithm&quot; would be wrong. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;But the pronounciation of &quot;Euclid&quot; is either Greek or an Anglicised version of it, so it's definitely &lt;strong&gt;&quot;A Euclidean Algorithm&quot;&lt;/strong&gt; just like it would be &lt;strong&gt;&quot;A European Algorithm.&quot;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is an edit I would personally not have bothered to make, even if the original was wrong, because it is a single character that does nothing to enhance the intelligibility of the post. What I find surprising, is that &lt;strong&gt;two other reviewers&lt;/strong&gt; approved this edit, even though the original was correct and the edit was wrong.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The OP has dealt with this by using &lt;strong&gt;&quot;The Euclidean Algorithm&quot;&lt;/strong&gt; instead (I am considering enhancing the title to a more descriptive one.)&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Do we really need trivial edits based on grammar, if the meaning is clear?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When &quot;reviewing&quot; other people's edits, can we please do just that. The idea is to review, not blindly approve.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I made my reasons for rejecting this edit clear. Did the other reviewers not read them? There are currently no other suggested edits in the review queue, so I cannot check if other people's edit rejections show up clearly.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Problems with the system: There was sufficient space in the &quot;reject reason&quot; box to explain that Euclid is pronounced &quot;Yuclid&quot; but not to compare and contrast with the pronunciation of Euler. I don't know why this box has to be so small. Also, I've noticed before that while you can ping a commenter on a question with another comment, if you see a wrong edit &lt;em&gt;after&lt;/em&gt; it has been made, there seems to be no way to ping the editor (unless they happen to have also left a comment on the question.) &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;EDIT: In response to Timwi's answer, I'd like to point out that this is not the only incident of incorrect edit approval. To mention just one example, in my answer &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1615/15599&quot;&gt;Suggested Edits: Reject Golfing?&lt;/a&gt; I mention an incorrect tag edit that got accepted. If you're not sure about an edit, you can &quot;Skip.&quot;&lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2015-09-25T14:30:03.883" Title="Approval of trivial / incorrect edits" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7045" PostTypeId="1" AcceptedAnswerId="7049" CreationDate="2015-09-24T15:50:09.850" Score="0" ViewCount="102" Body="&lt;p&gt;The question is rather simple. I want to create &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contests&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contests&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contests&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; question. I know what image should be, but it's not ascii-art - there are some ascii-art versions of image in internet though.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because this is popularity contest, should I provide a image of final result, or should I leave it up to the audience to discard ugly pictures(or allow them, if the code is neat)?&lt;/p&gt;&#xA;" OwnerUserId="15174" LastActivityDate="2015-09-24T18:26:49.760" Title="Do I have to provide an ascii-art to the ascii-art challenge?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7046" PostTypeId="2" ParentId="2140" CreationDate="2015-09-24T17:06:57.970" Score="-2" Body="&lt;h1&gt;Just Golf 2016 &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(Related: &lt;a href=&quot;https://codegolf.stackexchange.com/q/53678/194&quot;&gt;A Kingdom Hearts VGM challenge&lt;/a&gt;) &lt;em&gt;Sandbox note: potential duplicate?&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Just_Dance_2016&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Wikipedia&quot;&gt;Just Dance 2016&lt;/a&gt; is coming out soon, and I know I'm definitely excited! However, let's take a quick trip back to 2009, when the original Just Dance was released. There are a lot of great songs, but I don't know who sung half of them!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program that accepts a Just Dance song name from input and outputs the song's artist (as credited in-game.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is the list of all songs and artists from Just Dance 1:&lt;br&gt;&#xA;&lt;em&gt;list pending&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules and Assumptions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may assume that the song will always be valid.&lt;/li&gt;&#xA;&lt;li&gt;The song's title and artist must be properly capitalized.&lt;/li&gt;&#xA;&lt;li&gt;You may not read any external files - the song data must be hardcoded.&lt;/li&gt;&#xA;&lt;li&gt;If a song is covered (which several have been for various reasons), the program should return the cover artist (as they are credited in the game.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;Eye of the Tiger&lt;/code&gt;&lt;br&gt;&#xA;Output: &lt;code&gt;Survivor&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;Fame&lt;/code&gt;&lt;br&gt;&#xA;Output: &lt;code&gt;Irene Cara&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Bonuses&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Each game has had one song everyone was really excited about. This year, it's &lt;a href=&quot;https://www.youtube.com/watch?v=H8SkCkJCAaw&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;YouTube link to the official Just Dance video&quot;&gt;Ievan Polkka&lt;/a&gt; by Hatsune Miku. You get a bonus of -50 points if you accept this song as valid input.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Just Dance is fun, but why should we stop there? If you additionally accept songs fron the rest of the main series (Just Dance 2, 3, Greatest Hits/Best Of, 4, 2014, and 2015, not including DLC and skipping over any duplicates), you get a whopping &lt;strong&gt;-2009 points&lt;/strong&gt;. Here is the full list for those games:&lt;br&gt; &lt;em&gt;list pending&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Note that this doesn't include Just Dance 2016 songs.&lt;/li&gt;&#xA;&lt;li&gt;This can be combined with the other bonus to get a total of -2059 bytes.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Meta Questions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are the bonuses too big? (I'm mainly talking about the -2009 point bonus for including every song.)&lt;/li&gt;&#xA;&lt;li&gt;Has anything been left out?&lt;/li&gt;&#xA;&lt;li&gt;Is this enough of a challenge?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="38891" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.127" LastActivityDate="2015-09-27T14:50:20.923" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7047" PostTypeId="2" ParentId="2140" CreationDate="2015-09-24T17:08:22.403" Score="2" Body="&lt;p&gt;Well hello there, fellow golfers. The time has come for us to take part in the game. Time for the official Illuminati Confirmation!&lt;/p&gt;&#xA;&lt;h1&gt;Illuminati Confirmed?&lt;/h1&gt;&#xA;&lt;p&gt;Nah, just joking. We actually want to hide even better - by making conspiracy theorists look ridiculous.&lt;/p&gt;&#xA;&lt;p&gt;For that, you need to create code in whatever language you want to. Your task is to &lt;a href=&quot;https://upload.wikimedia.org/wikipedia/commons/3/3d/Dollarnote_siegel_hq.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;print the Eye of Providence&lt;/a&gt;, as an ascii art. The program may take input, but it shouldn't rely on it.&lt;/p&gt;&#xA;&lt;p&gt;However, there's a catch. You need to hide as many non-obvious references to Illuminati in source code as you can. One particular requirement is that your code must have an &amp;quot;Illuminati confirmed&amp;quot; sentence hidden somewhere(although it doesn't have to be plain string - in fact, it shouldn't; you can have it hidden by placing it as a first letter to every line, etc. - be creative!)&lt;/p&gt;&#xA;&lt;p&gt;And because it's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, the most upvoted and creative code wins!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/KPPoK.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/KPPoK.jpg&quot; alt=&quot;Confirmed.&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Now I want feedback before posting it - what else should I have in here? What is not clear? And if you come up with better &amp;quot;lore chit-chat&amp;quot;(I actually had no afflatus) - feel free to help me.&lt;/p&gt;&#xA;" OwnerUserId="15174" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-09-24T17:08:22.403" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="7048" PostTypeId="2" ParentId="2140" CreationDate="2015-09-24T18:06:18.813" Score="0" Body="&lt;h1&gt;Prove Your Language's Turing Completeness &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The goal is to show whether your language is or isn't Turing complete with the shortest program possible. This is different than &amp;quot;interpret BF&amp;quot; questions, since that's only one way to show the completeness of a language.&lt;/p&gt;&#xA;&lt;p&gt;This question will maintain one for each programming language (using a snippet), so the goal is to have either the shortest Turing machine, or the shortest proof that your language isn't Turing complete.&lt;/p&gt;&#xA;&lt;p&gt;Good luck with Malboge.&lt;/p&gt;&#xA;&lt;p&gt;This is probably a weak question so far, and so it needs your suggestions!&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Also, I'm not really sure how it'd work for non-Turing complete languages...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-09-24T18:06:18.813" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7049" PostTypeId="2" ParentId="7045" CreationDate="2015-09-24T18:26:49.760" Score="5" Body="&lt;p&gt;Rather than asking for opinions without giving us enough details to be able to give a sensible answer*, use the resource that we already have for getting feedback on whether a question is well designed and worded or not: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/194&quot;&gt;the sandbox&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;* Because what sensible person is going to say &quot;Yes, that's fine&quot; and risk you posting something which they don't think is fine and then pointing to their earlier answer?&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2015-09-24T18:26:49.760" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7051" PostTypeId="2" ParentId="7041" CreationDate="2015-09-24T22:47:19.117" Score="39" Body="&lt;h2&gt;Yes.&lt;/h2&gt;&#xA;&lt;p&gt;The post character limit should be doubled to the same length as Code Review's.&lt;/p&gt;&#xA;&lt;p&gt;The two most common reasons for the character limit on other Stack Exchange sites (people posting logs, or their entire source code for people to read through) are invalid when applied to PPCG. There won't be anyone posting logs on a PPCG question for obvious reasons. And though people may post the entire source code of a Stack Snippet, the reader is not expected to read through the code.&lt;/p&gt;&#xA;&lt;p&gt;My hopes are that increasing the character limit will result in even more ambitious challenges utilising Stack Snippets in creative ways.&lt;/p&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-09-24T22:47:19.117" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7053" PostTypeId="2" ParentId="2140" CreationDate="2015-09-25T03:06:45.597" Score="3" Body="&lt;h2&gt;Source code ecological footprint&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You've just been hired by a German car manufacturing company.&#xA;Your first task, as an engineer, is to write a program that computes the ecological footprint of source code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The ecological footprint of a character is computed as follows (you can assume the source code is ASCII-encoded):&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Write the character's ASCII code in binary, and count the number of 1's.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;For example, &lt;code&gt;A&lt;/code&gt; has a footprint of 2, but &lt;code&gt;O&lt;/code&gt; is dirtier with a footprint of 5.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The global footprint of a program is the sum of the footprints of its characters.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Your program must accept a string as parameter, compute its ecological footprint, and output it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is a subtlety though. As you wish to enter a new, more restrictive market, you need to tune your program so that it behaves differently in &quot;test mode&quot;.&#xA;Thus:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The program should output 0 when it receives the string &lt;code&gt;test&lt;/code&gt; as parameter.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The source code with the smaller ecological footprint wins (and yes, the answer &lt;code&gt;test&lt;/code&gt; is forbidden!)&lt;/p&gt;&#xA;" OwnerUserId="13798" LastEditorUserId="13798" LastEditDate="2015-09-25T03:51:11.583" LastActivityDate="2015-09-25T03:51:11.583" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="7054" PostTypeId="2" ParentId="7043" CreationDate="2015-09-25T05:36:11.437" Score="9" Body="&lt;h2&gt;1. Even small edits should be welcome&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;First off, I understand and sympathize with the urge programmers experience to fix apparent mistakes, including trivial grammar/spelling errors. Even if they don’t significantly impede comprehension, they &lt;em&gt;do&lt;/em&gt; blemish the overall experience on an aesthetic level.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don’t really understand why the 6 character restriction exists — a single character can easily make the difference between a correct and an invalid program, so the existence of the restriction is surprising especially on Q&amp;amp;A sites like StackOverflow, where subtly incorrect answers really matter.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;2. The review queue is not toxic&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You explicitly stated that the queue was empty when you last looked. Therefore, it seems that the review queue is far from growing quicker than the reviewers could handle. Therefore, for as long as the growth rate of the queue is no-where near problematic, I don’t see any problem with even the most minor of edits.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;3. Cut editors &lt;em&gt;and reviewers&lt;/em&gt; some slack and assume good faith&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It is not clear whether the specific example you pointed out is due to negligence on the part of the reviewers. It could just be innocent ignorance. But then, even if it &lt;em&gt;is&lt;/em&gt; negligence, someone can still submit another edit to fix the error. It is unlikely that somebody would repeatedly change it to the wrong version without wondering why it keeps getting reverted. Unless and until that actually happens, we shouldn’t prematurely worry about the hypothetical possibility.&lt;/p&gt;&#xA;" OwnerUserId="668" LastEditorUserId="668" LastEditDate="2015-09-25T14:30:03.883" LastActivityDate="2015-09-25T14:30:03.883" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7056" PostTypeId="2" ParentId="2140" CreationDate="2015-09-25T18:55:09.663" Score="0" Body="&lt;h1&gt;Elementary Cellular Automata, My Dear Watson &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A seemingly innocent dinner party composed of &lt;a href=&quot;http://mathworld.wolfram.com/ElementaryCellularAutomaton.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;elementary cellular automata&lt;/a&gt; has just been turned into a murder mystery. One of the cellular automaton guests has killed the host! All that remains as evidence for who committed the crime is the nth generation of the perpetrator. Luckily for them, Sherlock Holmes is on the case.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Show Watson how it's done by taking an integer &lt;code&gt;n&lt;/code&gt;, and a string representation of the &lt;code&gt;n&lt;/code&gt;th generation of the murderous automaton and printing or returning a list of the possible suspects (the numbers representing the rule of each amphichiral elementary cellular automata, see the bottom of the linked page.) &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input string will have length &lt;code&gt;2n+3&lt;/code&gt; for the &lt;code&gt;n&lt;/code&gt;th generation.&lt;/li&gt;&#xA;&lt;li&gt;The first character of the string represents the values on the infinite tape to the left, and the last character of the string represents the same for the right.&lt;/li&gt;&#xA;&lt;li&gt;Assume that the automata start with a single &lt;code&gt;1&lt;/code&gt; in the center of a string of all &lt;code&gt;0&lt;/code&gt;s.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Generation 0 of every automaton:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;010&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Notes:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I don't have a reference implementation yet, nor have I created any examples.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="34718" LastEditDate="2016-03-01T21:23:05.810" LastActivityDate="2016-03-01T21:23:05.810" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="7061" PostTypeId="2" ParentId="2140" CreationDate="2015-09-26T15:28:04.350" Score="1" Body="&lt;p&gt;&lt;strong&gt;The shortest code for testing reliable password ( for Vault Password Rank 3 puzzle )&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Introduction&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I started playing Empire of Code recently, and there was some challenge.&#xA;The player is supposed to write a code on a python or on javascript to detect if passed string is reliable password, that is, contains at least one lowercase Latin letter, one uppercase Latin letter and one digit and has at least 10 characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It was quite easy for me to fit in 130 characters limit for rank 3 using javascript, however, I spent a lot of time trying to fit in 100 characters limit for rank 3 using Python. Some guy said that he has managed to fit in 71 characters for Python. I was trying hard but still couldn't reduce the code less than 90 characters. Is it possible to use even less than 71 character?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge Vault Password [ the following description is mostly copied from &lt;a href=&quot;https://empireofcode.com/&quot; rel=&quot;nofollow&quot;&gt;https://empireofcode.com/&lt;/a&gt; ]&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;We've installed a new vault to contain our valuable resources and treasures, but before we can put anything into it, we need a suitable password for our new vault. One that should be as safe as possible.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The password will be considered strong enough if its length is greater than or equal to 10 characters, it contains at least one digit, as well as at least one uppercase letter and one lowercase letter. The password may only contain ASCII latin letters or digits, no punctuation symbols.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are given a password. We need your code to verify if it meets the conditions for a secure password.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this mission the main goal to make your code as short as possible. The shorter your code, the more points you earn. Your score for this mission is dynamic and directly related to the length of your code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;: A password as a string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;: A determination if the password safe or not as a boolean, or any data type that can be converted and processed as a boolean. When the results process, you will see the converted results.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;golf('A1213pokl') === false&lt;/p&gt;&#xA;&#xA;&lt;p&gt;golf('bAse730onE') === true&lt;/p&gt;&#xA;&#xA;&lt;p&gt;golf('asasasasasasasaas') === false&lt;/p&gt;&#xA;&#xA;&lt;p&gt;golf('QWERTYqwerty') === false&lt;/p&gt;&#xA;&#xA;&lt;p&gt;golf('123456123456') === false&lt;/p&gt;&#xA;&#xA;&lt;p&gt;golf('QwErTy911poqqqq') === true&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Precondition:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;0 &amp;lt; &quot;password| ≤ 64&lt;/p&gt;&#xA;&#xA;&lt;p&gt;password matches by regexp expression &quot;[a-zA-Z0-9]+&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Scoring in this mission is based on the number of characters used in your code (comment lines are not counted).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rank1:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any code length.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rank2:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code should be shorter than 230 characters for Javascript code or shorter than 200 characters for Python code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rank3:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code should be shorter than 130 characters for Javascript code or shorter than 100 characters for Python code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;How it is used:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you are worried about the security of your app or service, you can use this handy code to personally check your users' passwords for complexity. You can further use these skills to require that your users passwords meet or include even more conditions, punctuation or unicode.&lt;/p&gt;&#xA;" OwnerUserId="45369" LastActivityDate="2015-09-26T15:28:04.350" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7063" PostTypeId="2" ParentId="2140" CreationDate="2015-09-26T21:05:00.267" Score="0" Body="&lt;h1&gt;Hello, Loophole Abuse!&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Assignment&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Print the following string:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hello, World!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Gimmick&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;you know the meta post &quot;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Loopholes that are forbidden by default&lt;/a&gt;&quot;? Yeah, those don't apply here. In fact, you're actively encouraged to use as many as possible and combine them in weird ways. the more you use in a way that other users like, the more chance people will vote for you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition, to prevent trivial answers getting all the glory, your program must also work in the event that the characters that make up the source code are reversed (this includes the separate characters of a string). This includes external sources, multi-character compiler and execution flags, file names and anything else that is essential for the execution of the software (like Metagolfscript IDs).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="14141" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2015-09-26T22:36:34.880" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7064" PostTypeId="1" CreationDate="2015-09-26T23:58:43.153" Score="5" ViewCount="211" Body="&lt;p&gt;These questions involve the practice of commenting on another user's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; answers to suggest a shortening of the code.&lt;/p&gt;&#xA;&lt;p&gt;Which of these are polite? Which are best practices?&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Commenting on an answer to indicate that a shorter solution in the same language has been posted (for example, &lt;a href=&quot;https://codegolf.stackexchange.com/a/58629/39328&quot;&gt;this Perl 5 answer&lt;/a&gt; to FizzBuzz has more votes than &lt;a href=&quot;https://codegolf.stackexchange.com/a/58675/39328&quot;&gt;this one&lt;/a&gt; despite being longer)&#xA;&lt;ul&gt;&#xA;&lt;li&gt;...if the shorter answer is one's own (assuming it's &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1260/what-qualifies-as-enough-difference-in-posting-similar-answers&quot;&gt;different enough&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Giving credit to a user who suggests an optimization (e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/a/57814/39328&quot;&gt;in my answer here&lt;/a&gt;):&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Pyth, &lt;s&gt;21&lt;/s&gt; 20 bytes&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;-1 byte by Dennis&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;c/J-*3.d3C\ᙹ4T+33J&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Upvoting an answer because one suggests an optimization for it, to 'cancel out criticism'&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-02T17:01:43.647" Title="On golfing suggestions" Tags="|discussion|code-golf|answers|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7066" PostTypeId="2" ParentId="7064" CreationDate="2015-09-27T07:48:08.260" Score="4" Body="&lt;p&gt;I'm not sure to understand point 1.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I find a way (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/58243/16-bit-binary-grid/58258#comment140317_58258&quot;&gt;or many ways&lt;/a&gt;) to shorten an existing answer, I'll put that in a comment. When (and if) my suggestion is accepted, I will probably upvote the answer just for the pleasure of vote for myself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But if I find a different way, I'll post an answer&lt;/p&gt;&#xA;" OwnerUserId="21348" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-09-27T07:48:08.260" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7068" PostTypeId="1" CreationDate="2015-09-28T04:07:40.737" Score="0" ViewCount="89" Body="&#xA;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7067/9498&quot;&gt;this meta.codegolf sandbox question&lt;/a&gt;, the following shape is misaligned:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;      ##########&#xA;   ###@%$*.&amp;amp;.%%!###&#xA;  ##!$,%&amp;amp;?,?*?.*@~##&#xA; ##&amp;amp;**!,$%$@@?@*@&amp;amp;&amp;amp;##&#xA;#@&amp;amp;$?@!%$*%,.?@?.@&amp;amp;@,#&#xA;#,..,.$&amp;amp;*?!$$@%%,**&amp;amp;&amp;amp;#&#xA; ##.!?@*.%?!*&amp;amp;$!%&amp;amp;?##&#xA;  ##!&amp;amp;?$?&amp;amp;.!,?!&amp;amp;!%##&#xA;   ###,@$*&amp;amp;@*,%*###&#xA;      ##########&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It looks fine in the preview, but when it was posted, it got completely messed up. Why? (I cannot reproduce the bug here; look at the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/revisions/7067/2&quot;&gt;history&lt;/a&gt; to see it)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using &lt;code&gt;&amp;lt;pre&amp;gt;&lt;/code&gt; and &lt;code&gt;&amp;lt;code&amp;gt;&lt;/code&gt; tags fixes the problem, but this still seems like a bug.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;      ##########&#xA;   ###@%$*.&amp;.%%!###&#xA;  ##!$,%&amp;?,?*?.*@~##&#xA; ##&amp;**!,$%$@@?@*@&amp;&amp;##&#xA;#@&amp;$?@!%$*%,.?@?.@&amp;@,#&#xA;#,..,.$&amp;*?!$$@%%,**&amp;&amp;#&#xA; ##.!?@*.%?!*&amp;$!%&amp;?##&#xA;  ##!&amp;?$?&amp;.!,?!&amp;!%##&#xA;   ###,@$*&amp;@*,%*###&#xA;      ##########&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I attempted to reproduce the problem with this snippet, but I failed:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;var converter = new Markdown.getSanitizingConverter();&#xD;&#xA;$(&quot;button&quot;).click(function() {&#xD;&#xA;  $(&quot;#output&quot;).html(converter.makeHtml($(&quot;textarea&quot;).val()));&#xD;&#xA;  MathJax.Hub.Queue([&quot;Typeset&quot;,MathJax.Hub]);&#xD;&#xA;});&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xD;&#xA;&amp;lt;script src=&quot;https://cdnjs.cloudflare.com/ajax/libs/pagedown/1.0/Markdown.Converter.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xD;&#xA;&amp;lt;script src=&quot;https://cdnjs.cloudflare.com/ajax/libs/pagedown/1.0/Markdown.Sanitizer.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xD;&#xA;&amp;lt;script src=&quot;//cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS_HTML-full&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xD;&#xA;&amp;lt;script type=&quot;text/x-mathjax-config;executed=true&quot;&amp;gt;&#xD;&#xA;    MathJax.Hub.Config({&quot;HTML-CSS&quot;: { preferredFont: &quot;TeX&quot;, availableFonts: [&quot;STIX&quot;,&quot;TeX&quot;], linebreaks: { automatic:true }, EqnChunk: (MathJax.Hub.Browser.isMobile ? 10 : 50) }, tex2jax: { inlineMath: [ [&quot;\\(&quot;,&quot;\\)&quot;], [&quot;$&quot;, &quot;$&quot;] ], displayMath: [ [&quot;$$&quot;,&quot;$$&quot;], [&quot;\\[&quot;, &quot;\\]&quot;] ], processEscapes: true, ignoreClass: &quot;tex2jax_ignore|dno&quot; }, TeX: {  noUndefined: { attributes: { mathcolor: &quot;red&quot;, mathbackground: &quot;#FFEEEE&quot;, mathsize: &quot;90%&quot; } }, Macros: { href: &quot;{}&quot; } }, messageStyle: &quot;none&quot; });&amp;lt;/script&amp;gt;&#xD;&#xA;&#xD;&#xA;&amp;lt;textarea style=&quot;width: 100%;&quot;&amp;gt;&amp;lt;/textarea&amp;gt;&#xD;&#xA;&amp;lt;button&amp;gt;Render&amp;lt;/button&amp;gt;&#xD;&#xA;&amp;lt;p id=&quot;output&quot;&amp;gt;&#xD;&#xA;  Default empty text&#xD;&#xA;&amp;lt;/p&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="9498" OwnerDisplayName="Justin" LastEditorUserId="68942" LastEditDate="2021-06-05T03:25:42.543" LastActivityDate="2021-06-05T03:25:42.543" Title="Buggy Markdown rendering of a &quot;circle&quot;" Tags="|bug|status-completed|markdown|" AnswerCount="0" CommentCount="1" ClosedDate="2015-09-28T07:53:31.137" ContentLicense="CC BY-SA 3.0" />
  <row Id="7070" PostTypeId="1" AcceptedAnswerId="11502" CreationDate="2015-09-28T09:09:44.530" Score="30" ViewCount="635" Body="&lt;p&gt;It &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7025/should-standard-loopholes-apply-for-all-questions?cb=1#comment17729_7027&quot;&gt;was recently suggested in a comment&lt;/a&gt; to point at our standard loopholes (and potentially other implicit community rules) next to the Answer text area (similar to the How to ask? sidebar when writing a question):&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Wouldn't there be a way to customize the &quot;answer&quot; box so that there is a warning about standard loopholes?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;While there is no sidebar like the one for questions, new and anonymous users will see this overlay while writing an answer:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/lTa4c.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/lTa4c.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;br&gt;&#xA;&lt;sup&gt;(The link leads to &lt;code&gt;/help/how-to-answer&lt;/code&gt;.)&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That body of text doesn't make a lot of sense for PPCG. But it turns out that it can be customised for each site. This is the perfect place to point to loopholes and similar things, so let's rewrite this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have drafted a new version here, which is probably still far from perfect.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h2&gt;Your Answer&lt;/h2&gt;&#xA;  &#xA;  &lt;p&gt;Thanks for contributing an answer to Programming Puzzles &amp;amp; Code Golf Stack Exchange!&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;If this is an answer to a challenge:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Please be sure to &lt;em&gt;follow the challenge specification&lt;/em&gt;.&lt;/li&gt;&#xA;  &lt;li&gt;Include a short header which indicates the language(s) of your code and the &lt;em&gt;score&lt;/em&gt; as defined by the challenge.&lt;/li&gt;&#xA;  &lt;li&gt;Explanations of your answer are very much encouraged.&lt;/li&gt;&#xA;  &lt;li&gt;All answers should show some effort towards reaching a better score. For instance, answers to code golf challenges should try to be as short as possible (within the constraints of the chosen language). You can always include a readable version of the code in addition to the competitive one.&lt;/li&gt;&#xA;  &lt;li&gt;Don't try to answer a challenge by exploiting loopholes in the specification. Answers abusing any of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/8478&quot;&gt;standard loopholes&lt;/a&gt; are considered invalid.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;  &#xA;  &lt;p&gt;If this is an answer to a question &lt;em&gt;about&lt;/em&gt; code golf:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Please make sure to &lt;em&gt;answer the question&lt;/em&gt; and provide sufficient detail.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;  &#xA;  &lt;p&gt;In either case, &lt;em&gt;avoid&lt;/em&gt; ...&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Asking for help, clarification, or responding to other answers.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is quite long, so please help me edit it down a bit. Post feedback (corrections, additions etc.) in the comments and answers.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2017-02-09T14:41:12.037" Title="Let's customise the &quot;How to Answer&quot; pop-up" Tags="|discussion|feature-request|status-completed|answers|new-users|" AnswerCount="4" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7072" PostTypeId="2" ParentId="2140" CreationDate="2015-09-28T12:00:33.307" Score="0" Body="&lt;h1&gt;PPCG New Question Generator&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Specification&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write a program that does the following, given a string &lt;code&gt;s&lt;/code&gt; and an integer &lt;code&gt;n&lt;/code&gt; (as a file, STDIN, or command line arguments):&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Determines the &lt;code&gt;n&lt;/code&gt; most used characters in that quote. If there are two characters that are equally used, the character with the lower ASCII value takes priority.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Returns the text and the character in the following format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Return the following text:&#xA;&#xA;&amp;gt;{string}&#xA;&#xA;But there's an ORIGINAL TWIST! You cannot use the characters {characters} in your answer. As this is code-golf, the answer with the least characters wins. Have fun!&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Specifics:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You need to display {string} in blockquotes using Markdown formatting, not HTML. So if the string spans multiple lines, you need to prepend each line with &lt;code&gt;&amp;gt;&lt;/code&gt;. &lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You also need to display {characters} using proper grammar and in order from most used to least used. For example, with &quot;a&quot;, &quot;b&quot;, and &quot;c&quot;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;You cannot use the characters &quot;a&quot;, &quot;b&quot;, or &quot;c&quot; in your answer.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;In this example, &lt;code&gt;n&lt;/code&gt; is 4, and &lt;code&gt;s&lt;/code&gt; is:  &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;I have loved flowers that fade, &#xA;Within whose magic tents &#xA;Rich hues have marriage made &#xA;With sweet unmemoried scents: &#xA;A honeymoon delight,&#xA;A joy of love at sight, &#xA;That ages in an hour&#xA;My song be like a flower!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The output is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Return the following text:&#xA;&#xA;&amp;gt;I have loved flowers that fade, &#xA;&amp;gt;Within whose magic tents &#xA;&amp;gt;Rich hues have marriage made &#xA;&amp;gt;With sweet unmemoried scents: &#xA;&amp;gt;A honeymoon delight,&#xA;&amp;gt;A joy of love at sight, &#xA;&amp;gt;That ages in an hour&#xA;&amp;gt;My song be like a flower!&#xA;&#xA;But there's an ORIGINAL TWIST! You cannot use the characters &quot;e&quot;, &quot;a&quot;, &quot;h&quot;, or &quot;o&quot; in your answer. As this is code-golf, the answer with the least characters wins. Have fun!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="21682" LastActivityDate="2015-09-28T12:00:33.307" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7073" PostTypeId="2" ParentId="7070" CreationDate="2015-09-28T15:02:22.053" Score="0" Body="&lt;p&gt;Here's a sightly condensed version. Using nested lists takes up less space, and the title can be merged with the first paragraph.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Thanks for contributing to Programming Puzzles &amp;amp; Code Golf Stack Exchange!&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;If this is an answer to a challenge:&lt;/strong&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Please be sure to follow the challenge specification.&lt;/li&gt;&#xA;&lt;li&gt;Add a header indicating the language(s) of your code and the score as defined by the challenge.&lt;/li&gt;&#xA;&lt;li&gt;Explanations of your answer are very much encouraged.&lt;/li&gt;&#xA;&lt;li&gt;All answers should show some effort towards reaching a better score. For instance, answers to code golf challenges should try to be as short as possible (within the constraints of the chosen language). You can always include a readable version of the code in addition to the competitive one.&lt;/li&gt;&#xA;&lt;li&gt;Don't try to answer a challenge by exploiting loopholes in the specification. Answers abusing any of the standard loopholes are considered invalid.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;If this is an answer to a question about code golf:&lt;/strong&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Please make sure to answer the question and provide sufficient detail.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;In either case, avoid...&lt;/strong&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Asking for help, clarification, or responding to other answers.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/mOwpP.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/mOwpP.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="11006" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-09-28T15:02:22.053" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7074" PostTypeId="2" ParentId="2190" CreationDate="2015-09-28T15:22:12.770" Score="-3" Body="&lt;p&gt;For a different view: Output and implementation are something different. A truthy/falsy value is an &lt;strong&gt;output&lt;/strong&gt; that everybody with basic knowledge of common languages recognizes as truthy/falsy, regardless whether that is evaluated to true/false inside a programming language. It will be one of the following:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Truthy:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The string &lt;code&gt;True&lt;/code&gt; in any capitalization&lt;/li&gt;&#xA;&lt;li&gt;The string &lt;code&gt;1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;A floating point string representation of &lt;code&gt;1.0e0&lt;/code&gt; -/+ &lt;code&gt;eps(1)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;In case of functions: a boolean &lt;code&gt;true&lt;/code&gt;. integer &lt;code&gt;1&lt;/code&gt; or float &lt;code&gt;1.0e0&lt;/code&gt; -/+ &lt;code&gt;eps(1)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Falsy:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The string &lt;code&gt;False&lt;/code&gt; in any capitalization&lt;/li&gt;&#xA;&lt;li&gt;The string &lt;code&gt;0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;A floating point string representation of &lt;code&gt;0&lt;/code&gt; -/+ &lt;code&gt;eps(0)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;In case of functions: a boolean &lt;code&gt;false&lt;/code&gt;, integer &lt;code&gt;0&lt;/code&gt; or float &lt;code&gt;1.0e0&lt;/code&gt; -/+ &lt;code&gt;eps(1)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Both outputs may have leading or trailing spaces and newlines. &lt;strong&gt;Iff&lt;/strong&gt; your language doesn't support any of the above, you should attempt to find the closest alternative. &lt;strong&gt;In all cases, all truthy and falsy outputs should be the exact same for your program, regardless of input&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe that in practice, these options will be accepted by &lt;em&gt;all&lt;/em&gt; programmers to mean truthy or falsy, and eliminate loopholes. &lt;em&gt;For example, &lt;code&gt;cat&lt;/code&gt; could be a prime testing program if you define the set of all prime numbers as 'thruthy'.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Besides, if I ask you &lt;a href=&quot;https://www.youtube.com/watch?v=C_EMnY79UVc&quot; rel=&quot;nofollow&quot;&gt;'Are there any German spies around here'&lt;/a&gt;, I want  you to reply 'nein', not nine. In other words, a positive integer is not an answer to a true/false question. Neither is returning a set of all German spies, and claiming it's false if the set is empty. &lt;/p&gt;&#xA;" OwnerUserId="32352" LastEditorUserId="34718" LastEditDate="2016-02-25T14:56:05.020" LastActivityDate="2016-02-25T14:56:05.020" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7075" PostTypeId="1" AcceptedAnswerId="7077" CreationDate="2015-09-28T19:13:06.667" Score="18" ViewCount="2849" Body="&lt;p&gt;&lt;a href=&quot;https://www.desmos.com/calculator/0mxbapizqh&quot; rel=&quot;nofollow&quot;&gt;Some examples&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.desmos.com&quot; rel=&quot;nofollow&quot;&gt;Desmos.com&lt;/a&gt; is a graphing calculator. Would it count as a programming language? Here is my case, with respect to &lt;a href=&quot;https://www.desmos.com/calculator/0mxbapizqh&quot; rel=&quot;nofollow&quot;&gt;this&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Representation of a natural number: &lt;code&gt;42&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Tuples: &lt;code&gt;\left[1,2,3,4,5\right]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Transformational Model: &lt;code&gt;f_{Transform}\left(x\right)=3x-2.34&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Adding two natural numbers: &lt;code&gt;f_{Add}\left(x_1,x_2\right)=x_1+x_2&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Prime checking:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;d_{iv}\left(x,n\right)=1\left\{\frac{x}{n}=\operatorname{floor}\left(\frac{x}{n}\right),0\right\}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;p_{rime}\left(x\right)=1-\operatorname{sign}\left(\sum _{n=2}^{x-1}d_{iv}\left(x,n\right)\right)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Not exactly the most golf-friendly language, but is it a language? How would characters be counted? (source versus appearance?)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Further questions: What is an acceptable input? (I think sliders/variables.) What is an acceptable output? (There does not seem to be a way to output arbitrary strings; you can hard-code the string by typing a quote (&lt;code&gt;&quot;&lt;/code&gt;) to insert a text equation. OR you could upload images of necessary texts.)&lt;/p&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="31957" LastEditDate="2015-09-28T21:00:11.347" LastActivityDate="2015-09-28T23:59:43.400" Title="Does desmos.com count as a programming language?" Tags="|discussion|" AnswerCount="1" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="7076" PostTypeId="2" ParentId="7070" CreationDate="2015-09-28T19:36:34.530" Score="16" Body="&lt;p&gt;I am evidently sold on the idea. Here is a modified version in order to bring more thoughts on this.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h3&gt;If this is an answer to a challenge&lt;/h3&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;p&gt;&lt;strong&gt;Be sure to follow the challenge specification&lt;/strong&gt;. However, please refrain from exploiting obvious loopholes. Answers abusing any of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/8478&quot;&gt;standard loopholes&lt;/a&gt; are considered invalid. If you think a specification is unclear or underspecified, comment on the question instead.&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;&lt;strong&gt;Try to optimize your score.&lt;/strong&gt; For instance, answers to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges should attempt to be as short as possible. You can always include a readable version of the code in addition to the competitive one.&#xA;  &lt;em&gt;Explanations of your answer make it more interesting to read and are very much encouraged.&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;&lt;strong&gt;Include a short header&lt;/strong&gt; which indicates the language(s) of your code and its score, &lt;em&gt;as defined by the challenge&lt;/em&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;  &#xA;  &lt;h3&gt;More generally&lt;/h3&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;p&gt;Please make sure to answer the question and provide sufficient detail.&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;Avoid asking for help, clarification or responding to other answers (use comments instead).&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="903" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2015-10-02T20:14:41.387" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="7077" PostTypeId="2" ParentId="7075" CreationDate="2015-09-28T23:05:27.823" Score="22" Body="&lt;h1&gt;Yes, Desmos.com counts as a programming language&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Scoring is the &quot;normal&quot; bytecount without special rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The examples above of Desmos.com's programming language demonstrate that it is a fully-functional programming language capable of solving a wide range of problems (probably all primitive recursive functions).  We should accept it as a programming language the same way we allow TI-BASIC and Mathematica.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although the language may have limited input/output functionality, I believe we should treat this as a &quot;feature&quot; of the language (accepting the language as limited in this regard).  A lack of string operations has no impact on whether or not it counts as a language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Scoring should be calculated normally, without a special encoding.  For example, your &quot;adding two numbers&quot; program should count as 35 bytes.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;TI-BASIC's special encoding is based off of several reasons:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each command is a single &lt;em&gt;token&lt;/em&gt; which takes up either 1 or 2 bytes in memory.  &lt;code&gt;binomcdf(&lt;/code&gt; is a single token taking up 2 bytes.  You can directly measure the bytecount of any program from within the calculator.&lt;/li&gt;&#xA;&lt;li&gt;Programming is performed token-wise.  You select &lt;code&gt;binomcdf(&lt;/code&gt; from a menu instead of typing each letter.  You are unable to edit it in way (such as typing other letters in the middle of it).  Even if you type the individual lowercase letters &lt;code&gt;b i n o m c d f (&lt;/code&gt; it would not function, even though it would look the same (it would also have more bytes).&lt;/li&gt;&#xA;&lt;li&gt;When run, the TI-BASIC interpreter receives &lt;code&gt;binomcdf(&lt;/code&gt; as two bytes because that's how it's stored.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;On the other hand, in the case of Desmos.com:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Although you can enter functions via menu, you can also type them out by hand and backspace in the middle of them.  This demonstrates how the editor treats the program as a series of individual characters.&lt;/li&gt;&#xA;&lt;li&gt;I strongly doubt the existence of any special tokenization or character encoding that exists when storing the program.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I believe that the string you get from copying the program out of Desmos (like the OP's examples) is the most reproducible/verifiable option for measuring program size.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I have become aware, however, of some auto-formatting done by the Desmos editor.  For example, pasting in &lt;code&gt;y=sinx&lt;/code&gt; is the same as pasting in &lt;code&gt;y=\sin x&lt;/code&gt;.  This may open up other, more editor-specific ways to measure size.  Somewhat interestingly, copying the function will always result in &lt;code&gt;y=\sin x&lt;/code&gt;  but typing out &lt;code&gt;y=\sin x&lt;/code&gt; doesn't work (typing &lt;code&gt;y=sinx&lt;/code&gt; does work).&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2015-09-28T23:59:43.400" LastActivityDate="2015-09-28T23:59:43.400" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7078" PostTypeId="2" ParentId="5043" CreationDate="2015-09-29T18:22:24.627" Score="0" Body="&lt;p&gt;Not sure if this has been fixed, it's not showing up in the edit box&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$foo&#xA;        $bar&#xA;$baz&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(no, it's not fixed, &lt;code&gt;$bar&lt;/code&gt; has additional indentation than what I saw in the edit!)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is a similar issue on Music Stack exchange, where unwanted guitar chords pop up. The workaround is to use &lt;code&gt;&amp;lt;pre&amp;gt;&lt;/code&gt; and &lt;code&gt;&amp;lt;/pre&amp;gt;&lt;/code&gt; tags around content you don't want mangled. This also means you don't need to include 4 leading spaces in front of your code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Yes, works!)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;$foo&#xA;    $bar&#xA;$baz&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(Please click the edit button to see exactly what I have done.)&lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="15599" LastEditDate="2015-09-29T18:30:55.190" LastActivityDate="2015-09-29T18:30:55.190" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7079" PostTypeId="1" CreationDate="2015-09-30T10:49:44.810" Score="11" ViewCount="385" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/12914/elendia-starman&quot;&gt;El'endia Starman&lt;/a&gt;, a &lt;a href=&quot;https://christianity.stackexchange.com/users/58/elendia-starman&quot;&gt;moderator&lt;/a&gt;, but not a &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=moderators&quot;&gt;PPCG moderator&lt;/a&gt;, has &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/24416667#24416667&quot;&gt;recently added&lt;/a&gt; an &lt;a href=&quot;https://xkcd.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;XKCD&lt;/a&gt; RSS feed to our chatroom &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;, apparently based on &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/24416208#24416208&quot;&gt;the suggestion&lt;/a&gt; of one other user.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/24418068#24418068&quot;&gt;vehemently against&lt;/a&gt; this addition to our &lt;a href=&quot;https://chat.stackexchange.com/rooms/info/240/the-nineteenth-byte?tab=feeds&quot;&gt;list of feeds&lt;/a&gt; for a number of reasons:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It was done non-democratically, unlike other &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5247/26997&quot;&gt;feed suggestions&lt;/a&gt;. One user suggested it and another user immediately added it with no additional discussion.&lt;/li&gt;&#xA;&lt;li&gt;It was done by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12914/elendia-starman&quot;&gt;a PPCG user&lt;/a&gt; with sub 1000 rep. Yes they are a mod, but not on Programming Puzzles &amp;amp; Code Golf. &lt;/li&gt;&#xA;&lt;li&gt;XKCD has no specific association or relation to PPCG or code golf or Stack Overflow. Their topics overlap, but the same could be said for dozens of webcomics.&lt;/li&gt;&#xA;&lt;li&gt;Anyone who actually wants to read XKCD will probably continue to do so at its &lt;a href=&quot;http://xkcd.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;main site&lt;/a&gt;. There's no need for us to be an XKCD mirror. It will always be possible for users to post particularly appropriate comics in chat for discussion.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Do we want every single future XKCD comic autoposted in chat?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="66833" LastEditDate="2021-06-06T18:13:58.153" LastActivityDate="2021-06-06T18:13:58.153" Title="Do we want XKCD autposted in chat?" Tags="|discussion|feature-request|status-completed|chat|rss|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7080" PostTypeId="2" ParentId="7079" CreationDate="2015-09-30T10:50:20.130" Score="27" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;We should remove the XKCD feed from The Nineteenth Byte.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-09-30T10:50:20.130" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7081" PostTypeId="2" ParentId="7079" CreationDate="2015-09-30T10:51:48.530" Score="-8" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;Let's keep the XKCD feed in The Nineteenth Byte.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-09-30T10:51:48.530" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7082" PostTypeId="2" ParentId="2140" CreationDate="2015-09-30T15:09:11.680" Score="0" Body="&lt;h1&gt;Remove Pieces from Chess Position Notation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You should write a program or function which receives a string representing a chess position as input and outputs or returns the position with only the pawns and kings left.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The positions in the input and output are described by &lt;a href=&quot;https://en.wikipedia.org/wiki/Forsyth%E2%80%93Edwards_Notation&quot; rel=&quot;nofollow&quot;&gt;FEN&lt;/a&gt; notation:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Each rank is described, starting with rank 8 and ending with rank 1; within each rank, the contents of each square are described from file &quot;a&quot; through file &quot;h&quot;. Each piece is identified by a single letter taken from the standard English names (pawn = &quot;P&quot;, knight = &quot;N&quot;, bishop = &quot;B&quot;, rook = &quot;R&quot;, queen = &quot;Q&quot; and king = &quot;K&quot;).[1] White pieces are designated using upper-case letters (&quot;PNBRQK&quot;) while black pieces use lowercase (&quot;pnbrqk&quot;). Empty squares are noted using digits 1 through 8 (the number of empty squares), and &quot;/&quot; separates ranks. &lt;em&gt;(taken from Wikipedia)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;For example&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;rnbqkbnr/pp1ppppp/8/2p5/4P3/2N5/PPPP1PPP/R1BQKBNR&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;describes the board&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;---------------&#xA;♜♞♝♛♚♝♞♜&#xA;♟♟  ♟♟♟♟♟&#xA;&#xA;    ♟&#xA;        ♙&#xA;    ♘&#xA;♙♙♙♙  ♙♙♙&#xA;♖  ♗♕♔♗♘♖&#xA;---------------&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;With everything except kings and pawns removed it becomes &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;---------------&#xA;       ♚&#xA;♟♟  ♟♟♟♟♟&#xA;&#xA;     ♟&#xA;       ♙&#xA;&#xA;♙♙♙♙ ♙♙♙&#xA;       ♔&#xA;---------------&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and expressed with the FEN string&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4k3/pp1ppppp/8/2p5/4P3/8/PPPP1PPP/4K3    &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Forsyth%E2%80%93Edwards_Notation&quot; rel=&quot;nofollow&quot;&gt;FEN&lt;/a&gt; string consisting of the characters &lt;code&gt;12345678PNBRQKpnbrqk/&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The input describes a valid chess game position.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Forsyth%E2%80%93Edwards_Notation&quot; rel=&quot;nofollow&quot;&gt;FEN&lt;/a&gt; string describing the position with knights, bishops, rooks, queens removed.&lt;/li&gt;&#xA;&lt;li&gt;Output might not be a valid chess position in some extreme cases.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;TODO&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is code golf so the shortest entry wins.&lt;/p&gt;&#xA;" OwnerUserId="7311" LastActivityDate="2015-09-30T15:09:11.680" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7084" PostTypeId="1" AcceptedAnswerId="7085" CreationDate="2015-09-30T20:36:54.233" Score="31" ViewCount="491" Body="&lt;p&gt;I've been made aware that it's possible to lower the reputation threshold required to ask or answer questions on a per-site meta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A very common complaint about the sandbox is that new users, who are the ones who typically need it most, don't have access to it, due to the minimum 5 reputation requirement.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do we want to set the reputation requirement for answering on meta to 1, so that everybody can use the sandbox?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(While we're at it, what's everyone's opinion on changing the question threshold, too?)&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorDisplayName="user58826" LastEditDate="2017-08-05T00:53:05.470" LastActivityDate="2017-08-05T00:53:05.470" Title="Should we remove the reputation requirement for answering on meta?" Tags="|discussion|feature-request|status-completed|sandbox|new-users|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7085" PostTypeId="2" ParentId="7084" CreationDate="2015-09-30T20:48:45.203" Score="41" Body="&lt;h1&gt;Remove both question and answer requirements&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Meta is a great way for new users to ask questions about the site, so there shouldn't be a rep restriction keeping them from doing so.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;New users should be able to use the Sandbox, so we should remove the answer requirement as well.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Questions&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Rep requirements for meta participation make sense on other SE sites. Need help with something? Ask a question. Want to help somebody? Answer a question. There's not much else to it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Things are a little more difficult here. Writing a good challenge or submitting a high-quality entry requires abiding a lot of rules. Meta PPCG is supposed to be the place for &lt;a href=&quot;/questions/tagged/support&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt; questions, and brand new users are far more likely to need support than users that already earned some rep. Rather than having new users crash and burn on main, I'd prefer giving them the option of asking a meta question first.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Are there any downsides to removing the rep requirement? Probably. For example, before there was a Meta Stack Exchange, Meta Stack Overflow didn't have a rep requirement. 1 rep users that posted on Meta Stack Overflow quite often were question-banned on Stack Overflow itself and either wanted help with removing the ban or tried to circumvent it by simply posting their question elsewhere.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I don't think this will be an issue for &lt;em&gt;our&lt;/em&gt; meta site. Question bans rarely happen on PPCG, and if they do, it's unlikely somebody would try to post his challenge on Meta PPCG instead. Also, not counting the Sandbox, Meta PPCG doesn't have a lot of activity, and moderators are immediately notified of new meta questions. Low-quality meta questions will get dealt with pretty quickly.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Answers&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Posting answers on a meta site without having earned any rep wouldn't make sense on any other SE site. But we have a Sandbox, which is likely the most useful part of Meta PPCG for brand new users, and the very reason why we're even discussing the removal of the rep limit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Are there downsides? Probably, but if it means granting first-time challenge writers access to the Sandbox, the advantages should outweigh the disadvantages.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="12012" LastEditDate="2015-09-30T23:51:46.753" LastActivityDate="2015-09-30T23:51:46.753" CommentCount="3" CommunityOwnedDate="2015-09-30T23:50:17.860" ContentLicense="CC BY-SA 3.0" />
  <row Id="7086" PostTypeId="2" ParentId="7084" CreationDate="2015-09-30T20:54:23.143" Score="8" Body="&lt;h2&gt;Yes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Set the answer requirement to 1. I see no reason to change the question requirement.&lt;/p&gt;&#xA;" OwnerUserId="7416" LastActivityDate="2015-09-30T20:54:23.143" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7087" PostTypeId="1" AcceptedAnswerId="7088" CreationDate="2015-09-30T21:29:25.753" Score="9" ViewCount="247" Body="&lt;p&gt;I know nothing about the way the site works etc., but how cool and convenient would it be to have a simple wrapper to add a leaderboard for the question, like &lt;a href=&quot;https://codegolf.stackexchange.com/posts/59192&quot;&gt;here&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/58974/levenshtein-distance-bias&quot;&gt;here&lt;/a&gt;? That functionality would really great for users on the site.&lt;/p&gt;&#xA;" OwnerUserId="45447" LastEditorUserId="66833" LastEditDate="2021-06-09T14:15:05.483" LastActivityDate="2021-06-09T14:15:05.483" Title="Leaderboard function" Tags="|discussion|feature-request|status-declined|leaderboard|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7088" PostTypeId="2" ParentId="7087" CreationDate="2015-09-30T21:34:32.253" Score="10" Body="&lt;p&gt;Leaderboards are often custom-made to fit the requirements of a challenge, so it doesn't make sense for there to be a single function to accomplish this task.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Martin Büttner made a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5139/leaderboard-snippet&quot;&gt;leaderboard template&lt;/a&gt; that you can copy and paste into challenges though.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-09-30T21:34:32.253" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7090" PostTypeId="1" CreationDate="2015-09-30T22:35:01.663" Score="0" ViewCount="151" Body="&lt;p&gt;I just writed an answer for &lt;a href=&quot;https://codegolf.stackexchange.com/q/58891/45600&quot;&gt;this question&lt;/a&gt; on my computer. I was to post my answer and just found there isn't any &quot;add another answer&quot; button. It only say that it required 10 reputations to answer... But I have got 101 for being trusted on other stackoverflow site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What is wrong here? How can I post my answer?&lt;/p&gt;&#xA;" OwnerDisplayName="AXMIM" LastEditorUserId="68942" LastEditDate="2021-06-05T23:20:10.070" LastActivityDate="2021-06-05T23:20:10.070" Title="Can't add an answer to question Don't google “google” on Programming Puzzles &amp; Code Golf" Tags="|bug|status-bydesign|reputation|protected-questions|privileges|" AnswerCount="1" CommentCount="2" ClosedDate="2015-09-30T23:09:04.243" ContentLicense="CC BY-SA 3.0" />
  <row Id="7091" PostTypeId="2" ParentId="7090" CreationDate="2015-09-30T22:41:52.647" Score="14" Body="&lt;p&gt;This is &lt;a href=&quot;/questions/tagged/status-bydesign&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-bydesign&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-bydesign&lt;/a&gt; because you have to earn 10 rep on the site, in order to answer a protected question. The 100 rep association bonus doesn't apply towards the rep needed.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/questions/52764/what-is-a-protected-question&quot;&gt;From this MSE post&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;Who can answer a protected question?&lt;/h2&gt;&#xA;&lt;p&gt;Users with 10 or more reputation can answer a protected question. &lt;strong&gt;However, the +100 account association bonus is ignored for this check&lt;/strong&gt;, so you must have earned 10 or more reputation on that specific site to answer a protected question.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="12831" OwnerDisplayName="bluefeet" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-09-30T22:41:52.647" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7094" PostTypeId="2" ParentId="7064" CreationDate="2015-10-01T16:38:46.657" Score="6" Body="&lt;h2&gt;It's nice to include an edit in the post, referencing the user&lt;/h2&gt;&#xA;&lt;p&gt;Since &lt;strong&gt;comments tend to get removed&lt;/strong&gt; by the user (or by a moderator) after they've been addressed, it is good practice to include a reference to the user for their suggested improvement(s).&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Thanks to [user] for golf help!&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;-x bytes by [user]&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;etc...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Upvotes are optional, of course, but giving credit may make the user more inclined to give you one.&lt;/p&gt;&#xA;&lt;p&gt;Don't comment on an answer pointing to another answer that's shorter unless it really matters (like if there can only be one answer per language.) It seems rude.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-02T17:01:43.647" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7098" PostTypeId="1" AcceptedAnswerId="7146" CreationDate="2015-10-02T13:22:19.683" Score="12" ViewCount="504" Body="&lt;p&gt;After answering the first time on PPCG on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/58692/source-code-ecological-footprint/58782#58782&quot;&gt;&quot;Source code ecological footprint&quot;&lt;/a&gt; I had a little discussion about it. I found &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1654/php-and-warnings&quot;&gt;it's OK if your program throws notices or warnings&lt;/a&gt;. But I couldn't find anything about the &lt;a href=&quot;http://php.net/manual/en/language.basic-syntax.phptags.php&quot; rel=&quot;nofollow noreferrer&quot;&gt;opening PHP tag&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question is: Do I need to include and count it? If yes, is the short tag &lt;code&gt;&amp;lt;?&lt;/code&gt; instead of &lt;code&gt;&amp;lt;?php&lt;/code&gt; allowed, as it must be enabled via &lt;code&gt;--enable-short-tags&lt;/code&gt; or &lt;em&gt;php.ini&lt;/em&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In any case, could somebody please add an explanation in their answers on &lt;em&gt;why&lt;/em&gt; it is needed or not? I think this might be useful for other users as well as currently all different versions can be found here in PHP answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;hr&gt;&#xA;Interesting read as well: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2424/running-php-with-r-instead-of-code-tags&quot;&gt;Running PHP with &lt;code&gt;-r&lt;/code&gt; instead of code tags&lt;/a&gt;. If a program is run from the command line using &lt;code&gt;-r&lt;/code&gt; option it doesn't need the opening tag, like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;php -r &quot;echo 'ok';&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;I hope this is not a duplicate, found nothing related when searching for the tag and word &quot;PHP&quot;.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="41859" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-02-13T01:36:04.563" Title="Is the PHP opening tag mandatory in byte count?" Tags="|discussion|scoring|php|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7102" PostTypeId="2" ParentId="2140" CreationDate="2015-10-03T02:45:49.787" Score="1" Body="&lt;h1&gt;Cookie Clicker&lt;/h1&gt;&#xA;&lt;p&gt;Cookie Clicker: Simple, stupid, and yet strangely addictive. In it you must click a cookie (hence the title). Once you have enough cookies, you can spend them on items that will produce cookies for you. Eventually you will be getting hundreds, then thousands, then millions of cookies per second.&lt;/p&gt;&#xA;&lt;p&gt;There are a few different items that you can buy for cookies: &lt;strong&gt;A clicker&lt;/strong&gt; (that clicks the cookies for you), &lt;strong&gt;a grandma&lt;/strong&gt; (that bakes the cookies for you), &lt;strong&gt;a farm&lt;/strong&gt; (that grows cookies for you), &lt;strong&gt;a factory&lt;/strong&gt; (that mass produces cookies for you), &lt;strong&gt;a mine&lt;/strong&gt; (that will mine and process veins of dough for you), &lt;strong&gt;a shipment&lt;/strong&gt; (that ships cookies from other planets to you), &lt;strong&gt;an alchemy lab&lt;/strong&gt; (that transforms gold into cookies), and others that we won't worry about.&lt;/p&gt;&#xA;&lt;p&gt;Let's golf a simplified Cookie Clicker.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Write a full program. Your program should always display the number of cookies as a whole integer. Every second, your program should add the current cookies per second (defaulted to 0) to the cookie count.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;When the spacebar is pressed, it adds the base click amount (defaulted to 1) to your cookie count.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When the key &amp;quot;1&amp;quot; is pressed, if there are 10 or more cookies in the cookie count, subtracts the cookie count by 10 and adds 0.1 to the current cookies per second.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When the key &amp;quot;2&amp;quot; is pressed, if there are 100 or more cookies in the cookie count, subtracts the cookie count by 100 and adds 0.5 to the current cookies per second.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When the key &amp;quot;3&amp;quot; is pressed, if there are 500 or more cookies in the cookie count, subtracts the cookie count by 500 and adds 4 to the current cookies per second.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When the key &amp;quot;4&amp;quot; is pressed, if there are 3,000 or more cookies in the cookie count, subtracts the cookie count by 3,000 and adds 10 to the current cookies per second.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When the key &amp;quot;5&amp;quot; is pressed, if there are 10,000 or more cookies in the cookie count, subtracts the cookie count by 10,000 and adds 40 to the current cookies per second.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When the key &amp;quot;6&amp;quot; is pressed, if there are 40,000 or more cookies in the cookie count, subtracts the cookie count by 40,000 and adds 100 to the current cookies per second.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When the key &amp;quot;7&amp;quot; is pressed, if there are 200,000 or more cookies in the cookie count, subtracts the cookie count by 200,000 and adds 400 to the current cookies per second.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When the key &amp;quot;0&amp;quot; is pressed, if there are 50 or more cookies in the cookie count, subtracts the cookie count by 50 and adds 1 to the base click amount.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;There is no input, only output, being changed every second to update the cookie count. No other key should do anything, so you cannot press enter after every key and have it do something.&lt;/p&gt;&#xA;&lt;h1&gt;Other information&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is code golf so shortest program in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Thoughts for sandbox&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;There are many, many more features I could add to this challenge if it is too simple. I feel that challenge entries for this will already be long enough.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I do not see many challenges that ask for constant input. Does this mean that this challenge is a bad idea?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Have I crossed a line?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42768" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-03T03:39:42.443" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7104" PostTypeId="1" CreationDate="2015-10-03T09:24:42.247" Score="12" ViewCount="330" Body="&lt;p&gt;On the conditions that the language is general use (i.e., doesn't perform the task in 1 character) and follows the rule of having been invented before the question was asked. I've written languages before that were inadvertently good for code golfing, and I wasn't sure if those would be allowed as valid solutions.&lt;/p&gt;&#xA;" OwnerUserId="39213" LastActivityDate="2015-10-03T09:33:05.930" Title="Am I allowed to use my own invented languages to solve a code golf?" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7105" PostTypeId="2" ParentId="7104" CreationDate="2015-10-03T09:33:05.930" Score="19" Body="&lt;p&gt;Yes, this is fine. A quick look around the site will show an abundance of answers in languages created by PPCG users, and used nowhere else. The one thing to avoid is modifying your language in order to better solve a specific question, and then answering that question using the new version. Thus, it is preferred to answer a challenge using versions of your language published beforehand.&lt;/p&gt;&#xA;" OwnerUserId="30688" LastActivityDate="2015-10-03T09:33:05.930" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7106" PostTypeId="2" ParentId="2140" CreationDate="2015-10-03T11:03:25.627" Score="2" Body="&lt;h1&gt;1,2,3,4,...n-2,n,n-1&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Your goal is, with an input &quot;n&quot;, to print the numbers 1-n &lt;strong&gt;BUT&lt;/strong&gt; the last two values are flipped. The numbers must be CSV (Comma separated values)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;n must be &gt;= 3&lt;/em&gt; &lt;em&gt;(And an integer)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, with an input n=&quot;10&quot;, your output should be as follows: &lt;code&gt;1,2,3,4,5,6,7,8,10,9&lt;/code&gt;.&#xA;&lt;br&gt;&#xA;&lt;br&gt;&#xA;An input with n=&quot;3&quot;, your output should be as follows:&#xA;&lt;code&gt;1,3,2&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="16513" LastEditorUserId="16513" LastEditDate="2015-10-06T20:48:22.217" LastActivityDate="2015-10-06T20:48:22.217" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7107" PostTypeId="2" ParentId="7098" CreationDate="2015-10-03T16:26:29.520" Score="7" Body="&lt;p&gt;Regarding the use of the &lt;code&gt;&amp;lt;?&lt;/code&gt; short tag: since &lt;a href=&quot;https://secure.php.net/manual/en/ini.core.php#ini.sect.language-options&quot; rel=&quot;nofollow&quot;&gt;it's on by default&lt;/a&gt;, I think the use of &lt;code&gt;&amp;lt;?&lt;/code&gt; instead of &lt;code&gt;&amp;lt;?php&lt;/code&gt; is okay for code golf.&lt;/p&gt;&#xA;" OwnerUserId="13486" LastActivityDate="2015-10-03T16:26:29.520" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7109" PostTypeId="2" ParentId="2140" CreationDate="2015-10-03T20:13:49.913" Score="0" Body="&lt;h1&gt;Pareto optimality challenge&lt;/h1&gt;&#xA;&lt;p&gt;Write a class that maintains a pareto optimal set. This class must have these three methods:&lt;/p&gt;&#xA;&lt;p&gt;k(int n): Constructs the class. N is the array size that all of the other methods must use.&lt;/p&gt;&#xA;&lt;p&gt;boolean k.p(int[] n): Adds n if there exists no entry m in k such that each single term of m is greater than each corresponding term in n. The method must also return true if n has been entered into k, or false otherwise. n can be assumed to be of the length specified by the constructor.&lt;/p&gt;&#xA;&lt;p&gt;boolean k.s(int[] n): Returns true if n was previously entered by the above method and there exists no other term m in k such that each term of m is greater than each corresponding entry in n. Returns false otherwise.&lt;/p&gt;&#xA;&lt;p&gt;This is code golf, so shortest entry wins. Yes, programming languages without classes may be used, but all the usual properties of classes must be satisfied by the three methods above.&lt;/p&gt;&#xA;" OwnerUserId="43363" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-03T20:13:49.913" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7111" PostTypeId="1" CreationDate="2015-10-04T18:20:32.407" Score="11" ViewCount="391" Body="&lt;p&gt;On Stack Exchange there are theoretical, practical and fun sites. I'm wondering which aspect chiefly motivates people to contribute here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Specifically, does skill at code-golf and other programming puzzles have practical benefits -- are there transferable skills that would be useful in job interviews or when applying for, say, a university course?  Alternatively, do people come here to relax and express their creativity--perhaps with no thought of developing other skills?&lt;/p&gt;&#xA;" OwnerUserId="42144" LastActivityDate="2015-10-07T14:59:44.517" Title="Is there a practical purpose behind this site or is it just for fun?" Tags="|discussion|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7112" PostTypeId="2" ParentId="7111" CreationDate="2015-10-04T18:30:11.993" Score="21" Body="&lt;p&gt;Programming Puzzles &amp;amp; Code Golf is different than the other Stack Exchange sites in a number of ways. The general purpose of the site isn't practical &lt;em&gt;per se&lt;/em&gt;; it's to have fun and be creative, unlike the other SE sites, which are about getting answers to questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, participating in challenges here is actually a good way to increase your knowledge of a language and build your skills. For example, I've learned quite a bit about several languages by experimenting and finding the most concise ways to solve a problem in code golf competitions. And as Optimizer pointed out, we also have fastest code challenges, the principles of which are useful in practice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Many of the users who frequent this site have even &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/6918/20469&quot;&gt;created their own programming languages&lt;/a&gt;, which is certainly a nontrivial task.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Creating challenges is also a good way to build spec-writing skills, which obviously has practicality in the workplace, as well as general writing skills, as Calvin's Hobbies pointed out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We're a diverse community with many varied interests, but what we have in common is a desire to have fun doing something we enjoy: programming. What we do isn't always directly relevant to work or school; we do it because we like it.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2015-10-05T17:06:07.287" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7113" PostTypeId="1" CreationDate="2015-10-04T21:54:02.127" Score="11" ViewCount="360" Body="&lt;h3&gt;The Project&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The golfing snippet serves as a test suite for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; solutions. The snippet provides a testbed for golfed code, providing a bytecount, an input field, and an output console. Users can edit the golfed code to test improvements and compare outputs with the original solution.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;How to Use&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Create a new stack snippet in your answer. Paste the snippet code into the HTML section, and paste your code golf solution into the JavaScript section.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The golfed code will automatically be visible in your answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;The snippet code:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;!--                               Try the test suite below!                              --&amp;gt;&amp;lt;strong id=&quot;bytecount&quot; style=&quot;display:inline; font-size:32px; font-family:Helvetica&quot;&amp;gt;&amp;lt;/strong&amp;gt;&amp;lt;strong id=&quot;bytediff&quot; style=&quot;display:inline; margin-left:10px; font-size:32px; font-family:Helvetica; color:lightgray&quot;&amp;gt;&amp;lt;/strong&amp;gt;&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&amp;lt;pre style=&quot;margin:0&quot;&amp;gt;Code:&amp;lt;/pre&amp;gt;&amp;lt;textarea id=&quot;textbox&quot; style=&quot;margin-top:5px; margin-bottom:5px&quot;&amp;gt;&amp;lt;/textarea&amp;gt;&amp;lt;br&amp;gt;&amp;lt;pre style=&quot;margin:0&quot;&amp;gt;Input:&amp;lt;/pre&amp;gt;&amp;lt;textarea id=&quot;inputbox&quot; style=&quot;margin-top:5px; margin-bottom:5px&quot;&amp;gt;&amp;lt;/textarea&amp;gt;&amp;lt;br&amp;gt;&amp;lt;button id=&quot;testbtn&quot;&amp;gt;Test!&amp;lt;/button&amp;gt;&amp;lt;button id=&quot;resetbtn&quot;&amp;gt;Reset&amp;lt;/button&amp;gt;&amp;lt;br&amp;gt;&amp;lt;p&amp;gt;&amp;lt;strong id=&quot;origheader&quot; style=&quot;font-family:Helvetica; display:none&quot;&amp;gt;Original Code Output:&amp;lt;/strong&amp;gt;&amp;lt;p&amp;gt;&amp;lt;div id=&quot;origoutput&quot; style=&quot;margin-left:15px&quot;&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;p&amp;gt;&amp;lt;strong id=&quot;newheader&quot; style=&quot;font-family:Helvetica; display:none&quot;&amp;gt;New Code Output:&amp;lt;/strong&amp;gt;&amp;lt;p&amp;gt;&amp;lt;div id=&quot;newoutput&quot; style=&quot;margin-left:15px&quot;&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;script type=&quot;text/javascript&quot; id=&quot;golfsnippet&quot;&amp;gt;var bytecount=document.getElementById(&quot;bytecount&quot;);var bytediff=document.getElementById(&quot;bytediff&quot;);var textbox=document.getElementById(&quot;textbox&quot;);var inputbox=document.getElementById(&quot;inputbox&quot;);var testbtn=document.getElementById(&quot;testbtn&quot;);var resetbtn=document.getElementById(&quot;resetbtn&quot;);var origheader=document.getElementById(&quot;origheader&quot;);var newheader=document.getElementById(&quot;newheader&quot;);var origoutput=document.getElementById(&quot;origoutput&quot;);var newoutput=document.getElementById(&quot;newoutput&quot;);textbox.style.width=inputbox.style.width=window.innerWidth-50+&quot;px&quot;;var _originalCode=null;function getOriginalCode(){if(_originalCode!=null)return _originalCode;var allScripts=document.getElementsByTagName(&quot;script&quot;);for(var i=0;i&amp;lt;allScripts.length;i++){var script=allScripts[i];if(script.id!=&quot;golfsnippet&quot;){originalCode=script.textContent.trim();return originalCode}}}function getNewCode(){return textbox.value.trim()}function getInput(){try{var inputText=inputbox.value.trim();var input=eval(&quot;[&quot;+inputText+&quot;]&quot;);return input}catch(e){return null}}function setTextbox(s){textbox.value=s;onTextboxChange()}function setOutput(output,s){output.innerHTML=s}function addOutput(output,data){output.innerHTML+='&amp;lt;pre style=&quot;background-color:'+(data.type==&quot;err&quot;?&quot;lightcoral&quot;:&quot;lightgray&quot;)+'&quot;&amp;gt;'+escape(data.content)+&quot;&amp;lt;/pre&amp;gt;&quot;}function getByteCount(s){return(new Blob([s],{encoding:&quot;UTF-8&quot;,type:&quot;text/plain;charset=UTF-8&quot;})).size}function onTextboxChange(){var newLength=getByteCount(getNewCode());var oldLength=getByteCount(getOriginalCode());bytecount.innerHTML=newLength+&quot; bytes&quot;;var diff=newLength-oldLength;if(diff&amp;gt;0){bytediff.innerHTML=&quot;(+&quot;+diff+&quot;)&quot;;bytediff.style.color=&quot;lightcoral&quot;}else if(diff&amp;lt;0){bytediff.innerHTML=&quot;(&quot;+diff+&quot;)&quot;;bytediff.style.color=&quot;lightgreen&quot;}else{bytediff.innerHTML=&quot;(&quot;+diff+&quot;)&quot;;bytediff.style.color=&quot;lightgray&quot;}}function onTestBtn(evt){origheader.style.display=&quot;inline&quot;;newheader.style.display=&quot;inline&quot;;setOutput(newoutput,&quot;&quot;);setOutput(origoutput,&quot;&quot;);var input=getInput();if(input===null){addOutput(origoutput,{type:&quot;err&quot;,content:&quot;Input is malformed. Using no input.&quot;});addOutput(newoutput,{type:&quot;err&quot;,content:&quot;Input is malformed. Using no input.&quot;});input=[]}doInterpret(getNewCode(),input,function(data){addOutput(newoutput,data)});doInterpret(getOriginalCode(),input,function(data){addOutput(origoutput,data)});evt.stopPropagation();return false}function onResetBtn(evt){setTextbox(getOriginalCode());origheader.style.display=&quot;none&quot;;newheader.style.display=&quot;none&quot;;setOutput(origoutput,&quot;&quot;);setOutput(newoutput,&quot;&quot;)}function escape(s){return s.toString().replace(/&amp;amp;/g,&quot;&amp;amp;amp;&quot;).replace(/&amp;lt;/g,&quot;&amp;amp;lt;&quot;).replace(/&amp;gt;/g,&quot;&amp;amp;gt;&quot;)}window.alert=function(){};window.prompt=function(){};function doInterpret(code,input,cb){var workerCode=interpret.toString()+&quot;;function stdout(s){ self.postMessage( {'type': 'out', 'content': s} ); }&quot;+&quot; function stderr(s){ self.postMessage( {'type': 'err', 'content': s} ); }&quot;+&quot; function kill(){ self.close(); }&quot;+&quot; self.addEventListener('message', function(msg){ interpret(msg.data.code, msg.data.input); });&quot;;var interpreter=new Worker(URL.createObjectURL(new Blob([workerCode])));interpreter.addEventListener(&quot;message&quot;,function(msg){cb(msg.data)});interpreter.postMessage({&quot;code&quot;:code,&quot;input&quot;:input});setTimeout(function(){interpreter.terminate()},1E4)}setTimeout(function(){getOriginalCode();textbox.addEventListener(&quot;input&quot;,onTextboxChange);testbtn.addEventListener(&quot;click&quot;,onTestBtn);resetbtn.addEventListener(&quot;click&quot;,onResetBtn);setTextbox(getOriginalCode())},100);function interpret(code,input){window={};alert=function(s){stdout(s)};window.alert=alert;console.log=alert;prompt=function(s){if(input.length&amp;lt;1)stderr(&quot;not enough input&quot;);else{var nextInput=input[0];input=input.slice(1);return nextInput.toString()}};window.prompt=prompt;(function(){try{var evalResult=eval(code);if(typeof evalResult==&quot;function&quot;){var callResult=evalResult.apply(this,input);if(typeof callResult!=&quot;undefined&quot;)stdout(callResult)}}catch(e){stderr(e.message)}})()};&amp;lt;/script&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/59916/monday-mini-golf-3-anagram-distance/59920#59920&quot;&gt;Here's an example usage of the snippet.&lt;/a&gt; Try running and editing the code! (Note: expects two strings as input, which can be inputted as &lt;code&gt;&quot;string 1&quot;, &quot;string 2&quot;&lt;/code&gt;)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Features&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bytecount is automatically updated as code is modified.&lt;/li&gt;&#xA;&lt;li&gt;Original code is preloaded into the code area.&lt;/li&gt;&#xA;&lt;li&gt;Code is editable! Outputs for the original and modified code are shown side-by-side for the same input to allow for easy comparison.&lt;/li&gt;&#xA;&lt;li&gt;All entered code is sandboxed by using webworkers. This means that entered code snippets cannot interfere with each other or with the main snippet.&lt;/li&gt;&#xA;&lt;li&gt;A 10 second timeout is employed to handle infinite loops.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;These are specific for the JavaScript interprter for this snippet.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(these are irrelevant for interpreters written to run other languages)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Programs can be either a full program or a function.&lt;/li&gt;&#xA;&lt;li&gt;Input can be taken through &lt;code&gt;prompt&lt;/code&gt; or function arguments.&lt;/li&gt;&#xA;&lt;li&gt;Output can be through &lt;code&gt;alert&lt;/code&gt;, &lt;code&gt;console.log&lt;/code&gt;, or function return.&lt;/li&gt;&#xA;&lt;li&gt;If you are writing a function, the result of &lt;code&gt;eval&lt;/code&gt;ing your code must return the function. Notably, &lt;code&gt;function a(){}&lt;/code&gt; cannot be your main function, but &lt;code&gt;a=function(){}&lt;/code&gt; will work at no cost.&lt;/li&gt;&#xA;&lt;li&gt;The list of input is determined by wrapping the input string in brackets &lt;code&gt;[]&lt;/code&gt; and &lt;code&gt;eval&lt;/code&gt;ing it. Thus input box must contain a comma-separated list, in the same form as in declaring an array.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;But why just JavaScript?&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It doesn't have to be! At the end of this code, there is an &lt;code&gt;interpret&lt;/code&gt; function that can be easily edited with an interpreter for another language, which would transform the snippet into using another language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It seems that there is a decent interest in this snippet. I'm working on renovating this post to serve as a more complete guide. Unminified code and a guide to extending this to other languages is in the works!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Disclaimer:&lt;/em&gt;&lt;/strong&gt; This is not a perfect snippet &lt;em&gt;(yet!)&lt;/em&gt;; it is very much a work-in-progress. Feedback is very much appreciated.&lt;/p&gt;&#xA;" OwnerUserId="42844" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2015-10-08T02:34:52.417" Title="A golfing snippet!" Tags="|discussion|stack-snippets|" AnswerCount="0" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7114" PostTypeId="1" CreationDate="2015-10-05T01:23:30.693" Score="0" ViewCount="73" Body="&lt;p&gt;I really hate it when a user thinks it's okay to edit someone else's post to golf it. Is this included in the guidelines for suggesting edits at all?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The post in question: &lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits/24657&quot;&gt;https://codegolf.stackexchange.com/review/suggested-edits/24657&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that one user correctly rejected the edit, listing the reason, but it was approved in the end anyway.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2015-10-05T01:23:30.693" Title="Is there a guideline telling users not to golf someone else's post in an edit?" Tags="|discussion|answers|editing|" AnswerCount="0" CommentCount="8" ClosedDate="2015-10-05T01:29:27.153" ContentLicense="CC BY-SA 3.0" />
  <row Id="7115" PostTypeId="1" CreationDate="2015-10-05T01:49:02.887" Score="-1" ViewCount="399" Body="&lt;p&gt;We are 3/4 the way through 2015, as of last Thursday. 2015 was supposed to be the year of adoption for ES6, so today I prepose the full adoption of ES6 in Programming Puzzles and Code Golf. This means that all JavaScript answers are assumed to be ES6, not needing to be implied by the Submitter. ES7 answers, however must still be specified, as it has limited support.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TL;DR: Assume ES6 in all JavaScript answers.&lt;/p&gt;&#xA;" OwnerUserId="42331" LastEditorUserId="20469" LastEditDate="2015-10-05T02:00:02.767" LastActivityDate="2015-11-06T17:44:47.103" Title="On JavaScript and ES6" Tags="|discussion|answers|" AnswerCount="3" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7116" PostTypeId="2" ParentId="7115" CreationDate="2015-10-05T02:21:01.130" Score="17" Body="&lt;h3&gt;Not all browsers completely support ES6 yet.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;As such, answers should continue to state the ECMAScript version they use to avoid confusion, at least until ES6 is widely available. This avoids confusion when someone with browser that doesn't support ES6 tests out a submission that assumes ES6 features without mentioning so.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Besides, it's only 5 extra bytes to add in the submission header.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2015-10-05T02:21:01.130" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="7117" PostTypeId="1" CreationDate="2015-10-05T02:21:40.303" Score="0" ViewCount="65" Body="&lt;p&gt;Why am should I be getting this error when I already have 100 reputation?&#xA;&lt;img src=&quot;https://i.stack.imgur.com/vuSYd.png&quot; alt=&quot;Screenshot&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="711" LastEditorUserId="68942" LastEditDate="2021-06-05T23:19:52.630" LastActivityDate="2021-06-05T23:19:52.630" Title="Why do I need 10 reputation when I already have 100?" Tags="|bug|status-bydesign|reputation|protected-questions|privileges|" AnswerCount="0" CommentCount="0" ClosedDate="2015-10-05T02:23:49.287" ContentLicense="CC BY-SA 3.0" />
  <row Id="7118" PostTypeId="2" ParentId="7115" CreationDate="2015-10-05T05:50:36.777" Score="10" Body="&lt;h1&gt;No real benefit&lt;/h1&gt;&#xA;&lt;p&gt;I don't see any real benefit from this. Just think of it like other language where people explicitly mention version (Python/C++/Perl etc). Not everyone has the compiler for the latest version, so mentioning the version helps them get the right compiler (which in this case is a browser)&lt;/p&gt;&#xA;" OwnerUserId="31414" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-05T05:50:36.777" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7120" PostTypeId="2" ParentId="2140" CreationDate="2015-10-05T09:01:10.290" Score="0" Body="&lt;h1&gt;ASCII Snake&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;blockquote&gt;&#xA;    &lt;p&gt;&lt;strong&gt;NOTES&lt;/strong&gt; &lt;/p&gt;&#xA;    &#xA;    &lt;p&gt;It was pointed out to me that we already have had at least 2 snake challenges before. However, seeing as they are from a couple years ago, I think another snake challenge would be nice. Below (from the description section to the end) I describe a &quot;classic&quot; snake challenge. &lt;/p&gt;&#xA;    &#xA;    &lt;p&gt;However, I want to differentiate this from the classic challenge. I am more than open to suggestions in the comments below. My idea is the following:&lt;/p&gt;&#xA;    &#xA;    &lt;p&gt;Make an &quot;infinite&quot; snake game. That is, every 10 points, the level changes and the snake is reset according to the following pattern:&lt;/p&gt;&#xA;    &#xA;    &lt;p&gt;--The &lt;em&gt;n&lt;/em&gt;th level contains &lt;em&gt;n&lt;/em&gt; obstacles in the form of the '#' character. These work the same as walls. They are randomly placed around the map, the difficulty is that they cannot create a situation where an ungettable 'x' exists. for example:&lt;/p&gt;&#xA;  &lt;/blockquote&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;------------------------------&#xA;| #                          |  11&#xA;|                            |&#xA;|              oooooo        |&#xA;|              o    o        |&#xA;|              o    v        |&#xA;|              o             |&#xA;|                            |&#xA;|                            |&#xA;|    x                       |&#xA;|                            |&#xA;------------------------------&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;blockquote&gt;&#xA;    &lt;p&gt;would be unacceptable because if an &quot;x&quot; were to spawn in the corner, it would be an automatic game over. Also, the barriers may not form a wall which closes off areas of the arena. &lt;/p&gt;&#xA;    &#xA;    &lt;p&gt;I can flesh out this idea more if you think it is any good.&lt;/p&gt;&#xA;    &#xA;    &lt;h1&gt;Please Give Me Feedback On This Question&lt;/h1&gt;&#xA;    &#xA;    &lt;p&gt;When I have a working question, I will begin work on a basic solution in C++.&lt;/p&gt;&#xA;  &lt;/blockquote&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Description&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal of this challenge is to create a real time (non-buffered input) ASCII version of the popular game &lt;a href=&quot;https://en.wikipedia.org/wiki/Snake_%28video_game%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;Snake&lt;/a&gt; .&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The board is 10 newlines by 32 spaces. &#xA;The boundary consists of the &quot; | &quot; and &quot; - &quot; characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The snake body is made of the &quot;o&quot; character.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The snake head is v,&amp;lt;,&gt;,^ depending on direction of travel (intuitively) &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The snake eats &quot; x &quot;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example a game board might look like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;------------------------------&#xA;|                            |  11&#xA;|                            |&#xA;|              oooooo        |&#xA;|              o    o        |&#xA;|              o    v        |&#xA;|              o             |&#xA;|                            |&#xA;|                            |&#xA;|    x                       |&#xA;|                            |&#xA;------------------------------&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In the new game, the snake has three body segments and a head. It gains one body segment every time it eats an &quot;x&quot;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The score (the number of segments+head) should be displayed somewhere on the screen. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The starting position of the snake and the starting position of the &quot;x&quot; is left to the writer. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;After an &quot;x&quot; is eaten, the snake gains a segment, and a new &quot;x&quot; must spawn. &quot;x&quot;s may not spawn in a set of predetermined coordinates. They must spawn &quot;pseudo-randomly&quot; in the loosest sense of the phrase. This means that they can spawn using a random number generator or their position may be simply a function of the snake's position or some such simple rule. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The snake moves according to nonbuffered user input according to one or both of the following layouts:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;W&quot; - change direction up.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;A&quot; - change direction left.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;D&quot; - change direction right.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;S&quot; - change direction down. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;AND/OR&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;UP&quot; - change direction up.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;DOWN&quot; - change direction left.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;LEFT&quot; - change direction right.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;RIGHT&quot; - change direction down. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that, as per the rules of snake, at a given instance of the game, only three options are available to the player: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;-- Do nothing (and continue moving straight)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-- Turn 90 degrees&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-- Turn -90 degrees&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, at a given instance, two of the movement buttons should be unresponsive. E.g. in the above case, only right and left are responsive. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Snake movement follows the normal pattern. For those of you not familiar with it: Let segment zero, $$s_0$$ be the head and segment $$s_n$$ be the very end of the snake. In a given frame, the snake has 3 choices, go straight, go left, or go right (from the snake's reference frame). $$s_0$$ moves into one of these spaces based on user input. Then $$s_i$$ moves into the space taken by $$s_{i-1}$$ on the previous frame. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If an &quot;x&quot; is eaten, then on the next frame the new segment $$s_{n+1}$$ is placed where $$s_n$$ was on the previous frame. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The game ends when the snake head collides with the snake body or a with a wall. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1) Only languages which are available for free may be used. Libraries may be used (for i/o, etc), however the actual snake program must be written by you. (if library overuse is an issue, it will be determined by up/down votes)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2) The game must be playable (i.e. the framerate must be acceptable on most machines, as determined by readers)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;3) The &lt;strong&gt;winner is the program using the smallest number of bytes&lt;/strong&gt; that fits the above description. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;4) If an online compiler is available, it is recommended that you link it with your code so that others may play your game. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="45459" LastEditorUserId="45459" LastEditDate="2015-10-05T22:14:59.003" LastActivityDate="2015-10-05T22:14:59.003" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7121" PostTypeId="1" AcceptedAnswerId="7127" CreationDate="2015-10-05T11:18:43.713" Score="1" ViewCount="536" Body="&lt;p&gt;I ran across &lt;a href=&quot;https://codegolf.stackexchange.com/questions/59347/shortest-infinite-loop-producing-no-output&quot;&gt;this&lt;/a&gt; challenge. Which has &lt;a href=&quot;https://codegolf.stackexchange.com/a/59375/45839&quot;&gt;this&lt;/a&gt; answer.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(loop)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which is cited as having 6 characters. My problem is that when using SBCL and emacs-slime. Doing a macro expansion &lt;code&gt;C-x C-m&lt;/code&gt; leads to&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(BLOCK NIL (TAGBODY #:G890 (PROGN) (GO #:G890)))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which is significantly more than 6 characters. Now &lt;strong&gt;the question arises how to count characters in this case&lt;/strong&gt;. If one allows macros as a valid tool (as loop in SBCL seems to be implemented as a macro) anyone could come up with another macro shortening the loop to 3 characters (or maybe even less).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One might argue that &lt;code&gt;loop&lt;/code&gt; is part of SBCL implementation thus no &lt;strong&gt;extra&lt;/strong&gt; macro is required. But it still feels like cheating using a macro based solution as the 'really' used amount of characters is different.&lt;/p&gt;&#xA;" OwnerUserId="45839" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-10-02T21:17:11.600" Title="How to count bytes in macro heavy languages (e.g. common-lisp)" Tags="|discussion|" AnswerCount="3" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7122" PostTypeId="2" ParentId="7121" CreationDate="2015-10-05T12:05:21.553" Score="11" Body="&lt;p&gt;I'm not familiar with SBCL, but here's my take on the situation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the macro is part of the implementation and nothing needs to be done to include it, then it should be fine. If something &lt;em&gt;does&lt;/em&gt; need to be done to include it however, e.g. by some sort of import statement or compiler flag, then that should be included in the byte count. This is to stop non-standard loopholes like the &lt;code&gt;-D&lt;/code&gt; flag in C, which allows one to define an expansion such that all &quot;programs&quot; are 1 byte in size.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this situation, if &lt;code&gt;(loop)&lt;/code&gt; is valid as is with the implementation, then these 6 bytes should be counted. However, if someone wanted to define their own macro, say &lt;code&gt;l&lt;/code&gt;, then the macro definition needs to be in the byte count as well (I'm guessing that wouldn't be worth it here).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can't think of a good reason why the expansion should be counted instead, since to me this feels like a form of syntactic sugar.&lt;/p&gt;&#xA;" OwnerUserId="21487" LastEditorUserId="21487" LastEditDate="2015-10-06T00:26:40.543" LastActivityDate="2015-10-06T00:26:40.543" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7125" PostTypeId="2" ParentId="2140" CreationDate="2015-10-06T04:33:25.920" Score="0" Body="&lt;h1&gt;Machine Learning&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;If you give a downvote please say why!&lt;/strong&gt; (otherwise how will I learn, thanks)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The task is to create a simple program that &quot;learns&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;--&gt;The challenge&lt;/strong&gt; is to create a program which:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;(1)&lt;/strong&gt; outputs 50 integers (1 at a time) and waits for input after each.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input given will be 1 or 0 depending on whether the number is &quot;good&quot; or &quot;bad&quot;  based on a predetermined pattern (see the pattern section for more information)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;(2)&lt;/strong&gt; The program will then output something to the effect of&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;&amp;lt; Learning done. Ready for testing.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;At which point it will wait for integer input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;(3)&lt;/strong&gt; My script will then input 50 integers (1 at a time) and the program will read the integers and output 1 or 0 depending on whether it thinks the integer fits the pattern. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;--&gt;Types of Patterns&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Patterns will be of the following types, in an unknown order&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;-&lt;/strong&gt; is divisible by &lt;em&gt;x&lt;/em&gt; (&lt;em&gt;x&lt;/em&gt; no larger than 20)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;-&lt;/strong&gt; is greater/less than &lt;em&gt;x&lt;/em&gt; (&lt;em&gt;x&lt;/em&gt; no larger than 100)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;-&lt;/strong&gt; is a perfect square&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;-&lt;/strong&gt; has exactly &lt;em&gt;x&lt;/em&gt; prime divisors (&lt;em&gt;x&lt;/em&gt; no larger than 3)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;-&lt;/strong&gt; is coprime to &lt;em&gt;x&lt;/em&gt; (shares no common divisors with &lt;em&gt;x&lt;/em&gt; except 1) (&lt;em&gt;x&lt;/em&gt; no larger than 100 and not  prime)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;numbers above subject to change if a case is made in the comments&lt;/em&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;--&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bots will be scored on correct answers to my script input. The score is equal to the total number of correct answers across all 5 tests. There is a max score of 250.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since I do anticipate perfect scores, ties will be broken by golf score of the source.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Further ties will be broken by submission time. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;--&gt;Example of A Test&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;note: &quot;in&quot; is for my input. &quot;out&quot; is for machine output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The rule is &quot;even-good, odd-bad&quot;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;out&amp;lt;&amp;lt;  10&#xA;in&amp;gt;&amp;gt;   1&#xA;out&amp;lt;&amp;lt;  1901&#xA;in&amp;gt;&amp;gt;   0&#xA;&#xA;... more lines like this ....&#xA;&#xA;out&amp;lt;&amp;lt;  Learning Complete. Ready for Input.&#xA;&#xA;in&amp;gt;&amp;gt;   12&#xA;out&amp;lt;&amp;lt;  1&#xA;in&amp;gt;&amp;gt;   87&#xA;out&amp;lt;&amp;lt;  0&#xA;&#xA;... more lines like this ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Say the machine got 47/50 correct on this test, then it currently has a score of 47. I would then proceed to test it with 4 different patterns. And sum its score on each test for its final score. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;--&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;(1)&lt;/strong&gt; &lt;strong&gt;you may not use external tables&lt;/strong&gt;, i.e. have a library that contains table for all possible tests. However, your code may generate such tables.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;(2)&lt;/strong&gt; &lt;strong&gt;the bot may not exceed an &lt;em&gt;average&lt;/em&gt; time of 2 seconds per output&lt;/strong&gt;. This goes for both the learning and testing sections. I really don't want to have to spend over 15 minutes per test. The &lt;em&gt;average&lt;/em&gt; is so that it can spend a bit of start-up time to generate tables if it needs to.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;(3)&lt;/strong&gt; &lt;strong&gt;Use of external libraries is permitted&lt;/strong&gt;, although it should be clear that the bulk of the work is yours. (this will be determined by downvotes)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;(4)&lt;/strong&gt; &lt;strong&gt;Languages must have a free interpreter available&lt;/strong&gt;. If they don't I won't be able to test them. This rules out MatLab, Mathematica, etc. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;(5)&lt;/strong&gt; other rules may be added as necessary.  &lt;/p&gt;&#xA;" OwnerUserId="45459" LastEditorUserId="45459" LastEditDate="2015-10-07T00:33:30.057" LastActivityDate="2015-10-07T00:33:30.057" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7126" PostTypeId="2" ParentId="7041" CreationDate="2015-10-06T11:48:39.593" Score="-10" Body="&lt;h1&gt;No.&lt;/h1&gt;&#xA;&lt;p&gt;I feel that this really goes against the spirit of this website. Programming Puzzles and &lt;strong&gt;Code Golf&lt;/strong&gt;, and all. If anything, I say to reduce the post limit.&lt;/p&gt;&#xA;" OwnerUserId="31343" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-06T11:48:39.593" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7127" PostTypeId="2" ParentId="7121" CreationDate="2015-10-06T16:11:42.687" Score="7" Body="&lt;p&gt;Macros act on the parsed data-structure, not text. The source code is the string &lt;code&gt;&quot;(loop)&quot;&lt;/code&gt;, which is used to determine the score. Once this string has been read, it is &lt;em&gt;no longer valid&lt;/em&gt; to talk about the &quot;real&quot; amount of characters: the AST is made of lists, vectors, symbols and other literal values which are being transformed to produce the code that is going to be evaluated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The code printed by macroexpansion is not readable anymore as an equivalent of the original one: there are uninterned symbols like &lt;code&gt;#:G890&lt;/code&gt;, which refer to &lt;em&gt;fresh&lt;/em&gt; symbols each time they are read (interned symbols map to the same symbol object in memory). It would not be fair to submit the expanded code because nobody could execute it (even if it can be evaluated, the result would be different than the original code). To be fair, if you bind &lt;code&gt;*print-circle*&lt;/code&gt; to &lt;code&gt;T&lt;/code&gt;, the macroexpanded code is printed readably, but the point is that macros are not just a string preprocessor on top of the language. &#xA;They are part of Common Lisp and as such they belong to the set of features we have the right to use and count as source code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That being said, it generally does not pay off to define custom macros in code-golf anyway. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Nothing said here is specific to SBCL.&lt;/p&gt;&#xA;" OwnerUserId="903" LastEditorUserId="903" LastEditDate="2016-10-02T21:17:11.600" LastActivityDate="2016-10-02T21:17:11.600" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7128" PostTypeId="2" ParentId="7111" CreationDate="2015-10-06T20:08:07.067" Score="7" Body="&lt;p&gt;I would say it has lots of benefits in everyday life because what we basically do here is training to &lt;em&gt;think outside the box&lt;/em&gt;, which is a very useful ability in general. It's less about sharing knowledge, and more about keeping your brain flexible. At least for me it is. And it's fun too, of course.&lt;/p&gt;&#xA;" OwnerUserId="44613" LastActivityDate="2015-10-06T20:08:07.067" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7129" PostTypeId="1" AcceptedAnswerId="7157" CreationDate="2015-10-06T22:20:03.253" Score="15" ViewCount="289" Body="&lt;p&gt;In shell scripts, one can oftentimes save a few bytes by creating temporary files instead of storing information in variables. Given that the lion share of the work is usually done by invoking external programs, this is not only the golfiest, but the most natural choice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, instead of the Bash script&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;t=`command1`&#xA;echo -n &quot;$t&quot;|command2&#xA;echo -n &quot;$t&quot;|command3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;one could use&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;command1&amp;gt;t&#xA;command2&amp;lt;t&#xA;command3&amp;lt;t&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which is guaranteed to work as intended and a whopping 24 bytes shorter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, a production-level Bash script would create a temporary file or directory with &lt;code&gt;mktemp&lt;/code&gt; and clean up after itself before exiting, but what should a code golf answer do?&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Where should programs be allowed to create temporary files? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In particular, is it OK to simply create a file in the current directory, possibly overwriting other files in the process?&lt;sup&gt;1&lt;/sup&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Do programs have to delete the files they created in the current directory (if allowed)?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do programs have to delete the files they created in &lt;code&gt;/tmp&lt;/code&gt; (which the system should eventually delete on its own)?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; &lt;sub&gt;It goes without saying that the answer should include a heads-up in this case.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2015-10-11T06:18:18.643" Title="Temporary files and code golf" Tags="|discussion|policy|answers|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7130" PostTypeId="2" ParentId="5759" CreationDate="2015-10-07T03:15:36.913" Score="3" Body="&lt;h1&gt;Code Contests&lt;/h1&gt;&#xA;&lt;p&gt;Sorry for waking up a somewhat old thread, but I forgot to post this back when I first thought of it. Code Sport seems good, but like Alex A., I think it isn't immediately descriptive. This variant covers practically everything we do here, and it's more concise than Programming Contests.&lt;/p&gt;&#xA;" OwnerUserId="42545" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-07T03:15:36.913" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7131" PostTypeId="2" ParentId="7111" CreationDate="2015-10-07T03:35:25.060" Score="4" Body="&lt;p&gt;In my ~93 days of contributing to the site. I Programming Puzzles &amp;amp; Code Golf has more of a fun / creative aspect but I wouldn't say it ends there. It encourages creative-thinking, and making the most out of what your language can do (which tends to be heavy abuse).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Being able to shrink your code as short as possible may not just help reduce the byte count but provide shorter algorithms. You discover new features, which help you in everyday life when writing code. Sometimes when code golfing you'll code an algorithm that might run in linear time or run just faster. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd probably be lying if I said most people didn't come here for fun &lt;em&gt;or green internet points&lt;/em&gt; (essentially non practical purposes). It's a creative, and &lt;em&gt;(for me at least)&lt;/em&gt; have fun squeezing every byte out of your code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since I've joined code-golf, I've been writing more efficient, better code too. While writing with one-letter variable names may just seem obfuscated, you're also creating more short, and concise code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then again, they're many other types of challenges, some just requiring out-of the box thinking, and others for real-world practical purposes. So while code-golf may not directly have any practical benefit. It'll help you become a better programmer and really understand your language.&lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="40695" LastEditDate="2015-10-07T14:59:44.517" LastActivityDate="2015-10-07T14:59:44.517" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7134" PostTypeId="1" CreationDate="2015-10-07T09:00:56.250" Score="10" ViewCount="168" Body="&lt;p&gt;I wrote &lt;a href=&quot;https://codegolf.stackexchange.com/a/59645/39442&quot;&gt;this&lt;/a&gt; answer in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/59464/print-like-this&quot;&gt;this&lt;/a&gt; challenge using &lt;em&gt;Vim script&lt;/em&gt;. I think I was really creative and got very proud of my solution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I am not so sure if this is legal because this program does not print its output to &lt;code&gt;stdout&lt;/code&gt; but opens a &lt;em&gt;Vim&lt;/em&gt; session with the output of the program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This command will run the &lt;em&gt;Vim script&lt;/em&gt; program I posted:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$ echo &quot;This is a test line!&quot; | vim - -c 'nm Q vEUWvEuWQ|norm Q'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This will open up Vim displaying this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;THIS is A test LINE!&#xA;~&#xA;~&#xA;~&#xA;~&#xA;~&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I personally think that this is legal because it does display the correct solution but I am not sure if it counts because the result is displayed within &lt;em&gt;Vim&lt;/em&gt; and not printed to &lt;code&gt;stdout&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am new to codegolf so I would like to hear from you if I can post more solutions like this to other programs.&lt;/p&gt;&#xA;" OwnerUserId="39442" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2015-10-07T12:16:45.217" Title="Are Vim script solutions that does not print the output but starts a vim session with output legal?" Tags="|discussion|answers|rules|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7135" PostTypeId="2" ParentId="7134" CreationDate="2015-10-07T12:16:45.217" Score="6" Body="&lt;p&gt;I would personally consider it valid. However, when in doubt, you should always ask the question writer by commenting on the question. Although there are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;set defaults&lt;/a&gt; for inputs and output formats, what the question writer says will overwrite these defaults.&lt;/p&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2015-10-07T12:16:45.217" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7136" PostTypeId="2" ParentId="2140" CreationDate="2015-10-07T14:12:46.867" Score="1" Body="&lt;h1&gt;The Drunken Knight&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/markov-chain&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;markov-chain&amp;#39;&quot; rel=&quot;tag&quot;&gt;markov-chain&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Inputs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;a&lt;/code&gt;: Starting location of the knight, e.g. &lt;code&gt;A2&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;b&lt;/code&gt;: Target location of the knight, e.g. &lt;code&gt;B4&lt;/code&gt;. The starting and target locations may be the same.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;n&lt;/code&gt;: An integer equal to or greater than 0.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The probability that a knight starting at &lt;code&gt;a&lt;/code&gt;, moving at random for &lt;code&gt;n&lt;/code&gt; turns on an 8x8 board, ends at &lt;code&gt;b&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Notes&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The knight has equal probability to move to any of the squares which it can access.&lt;/li&gt;&#xA;&lt;li&gt;There are no other pieces on the board that could block any squares from the knight.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-12T04:59:11.550" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7137" PostTypeId="2" ParentId="2140" CreationDate="2015-10-07T16:59:00.420" Score="0" Body="&lt;p&gt;&lt;strong&gt;Mutating variable&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;br&gt;&#xA;n number of lines (where n is from 10 to 30, each run is random) where each line is either (all of the lines have to be possible)&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Array of n random chars (or String with n random characters) made out of letters only&lt;/li&gt;&#xA;&lt;li&gt;random int divisible by n (by int I mean a whole number of any kind)&lt;/li&gt;&#xA;&lt;li&gt;random double whose first two decimal digits is n (by double I mean an number that has decimal digits) therefore for n=12 it will have format ###.12####&lt;/li&gt;&#xA;&lt;li&gt;random boolean true or false (by that I mean 1 or 0)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;No two consequent lines may be same type&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another requirement is that in your code may call print (or System.out.println or whatever you use to print to screen) only once.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, so shortest code wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By random I mean use your language's built-in random number generator,&lt;/p&gt;&#xA;" OwnerUserId="9540" LastEditorUserId="9540" LastEditDate="2015-10-08T13:08:13.360" LastActivityDate="2015-10-08T13:08:13.360" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="7138" PostTypeId="2" ParentId="1213" CreationDate="2015-10-07T19:13:50.173" Score="3" Body="&lt;h1&gt;QBasic&lt;/h1&gt;&#xA;&lt;p&gt;If you don't have an old computer with DOS or pre-2000 Windows on it, you can still run QBasic programs:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;First, what &lt;strong&gt;not&lt;/strong&gt; to use. There are &lt;a href=&quot;https://repl.it/languages/qbasic&quot; rel=&quot;nofollow noreferrer&quot;&gt;a couple&lt;/a&gt; of &lt;a href=&quot;http://stevehanov.ca/blog/index.php?id=92&quot; rel=&quot;nofollow noreferrer&quot;&gt;online emulators&lt;/a&gt;, but they are very limited, only supporting a subset of QBasic commands. Most importantly for this site, they don't understand syntax shortcuts that are useful for golfing! =^O&lt;/li&gt;&#xA;&lt;li&gt;I run most of my programs on &lt;a href=&quot;http://www.qb64.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;QB64&lt;/a&gt;, a free download. I've only used the Windows version; the website lists versions for Mac and Linux as well, but I can't speak for those. This is an emulator, written from scratch in C++, that compiles your QBasic code to an executable and then runs it.&lt;br /&gt;&#xA;&lt;em&gt;Pros:&lt;/em&gt; it's got most of the features of QBasic (and quite a few extras, too); you can also turn off syntax expansion, so your golfed code stays golfed.&lt;br /&gt;&#xA;&lt;em&gt;Cons:&lt;/em&gt; there are a few things from QBasic that aren't implemented, and several more that have subtle differences; some screen modes display as pretty small windows; the debugger and immediate mode aren't included, because it's a compiler not an interpreter.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://archive.org/details/msdos_qbasic_megapack&quot; rel=&quot;nofollow noreferrer&quot;&gt;Archive.org&lt;/a&gt; has made available the original QBasic running on the DOSBox emulator, meaning it's now possible to run QBasic code online.&lt;br /&gt;&#xA;&lt;em&gt;Pros:&lt;/em&gt; it's the real thing, works as advertised, no download necessary.&lt;br /&gt;&#xA;&lt;em&gt;Cons:&lt;/em&gt; you can't save your code or copy-and-paste in or out; sound works but comes across a bit wonky; and you can't turn off syntax expansion.&lt;/li&gt;&#xA;&lt;li&gt;It's also possible to &lt;a href=&quot;http://www.qbasic.net/en/qbasic-downloads/compiler/qbasic-interpreter.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;download the original executable&lt;/a&gt; and run it in &lt;a href=&quot;http://www.dosbox.com/wiki/Main_Page&quot; rel=&quot;nofollow noreferrer&quot;&gt;DOSBox&lt;/a&gt; yourself. I haven't tried this, but &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/44874/steenbergh&quot;&gt;steenbergh&lt;/a&gt; has had good success with it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="16766" LastEditDate="2021-11-10T22:16:39.227" LastActivityDate="2021-11-10T22:16:39.227" CommentCount="3" CommunityOwnedDate="2016-08-21T03:11:45.147" ContentLicense="CC BY-SA 4.0" />
  <row Id="7139" PostTypeId="2" ParentId="2447" CreationDate="2015-10-07T19:16:25.817" Score="100" Body="&lt;h1&gt;Programs may output by displaying it on screen.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This makes it possible to use languages like &lt;em&gt;Vim script&lt;/em&gt; that can't print output directly to &lt;em&gt;stdout&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/59464/print-like-this&quot;&gt;this&lt;/a&gt; challenge: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$ echo &quot;This is a test line!&quot; | vim - -c 'nm Q vEUWvEuWQ|norm Q'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Will display:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;THIS is A test LINE!&#xA;~&#xA;~&#xA;~&#xA;~&#xA;~&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Within a &lt;em&gt;Vim&lt;/em&gt; session.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think that this way of displaying the result should be valid. I am sure that there are other domain specific languages like &lt;em&gt;Vim script&lt;/em&gt; that lacks full I/O support and could use another way to display the result.&lt;/p&gt;&#xA;" OwnerUserId="39442" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2015-10-07T19:16:25.817" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7140" PostTypeId="2" ParentId="1213" CreationDate="2015-10-07T21:07:54.670" Score="5" Body="&lt;h2&gt;Common Lisp&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Download&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;For Linux, Windows, Darwin (MacOs), pick one of those two sidely available and supported implementations:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://ccl.clozure.com/docs/ccl.html#installing-and-running-clozure-cl&quot; rel=&quot;nofollow&quot;&gt;Clozure CL&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.sbcl.org/platform-table.html&quot; rel=&quot;nofollow&quot;&gt;SBCL&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;See also &lt;a href=&quot;https://en.wikipedia.org/wiki/Common_Lisp#Implementations&quot; rel=&quot;nofollow&quot;&gt;other implementations&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Quicklisp&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Sometimes you will need to download and install additional libraries. This is the case if the challenge contains a &lt;code&gt;(ql:quickload &amp;lt;X&amp;gt;)&lt;/code&gt; expressions. Most  external libraries (systems) can be obtained through &lt;a href=&quot;https://www.quicklisp.org/beta/&quot; rel=&quot;nofollow&quot;&gt;Quicklisp&lt;/a&gt;. There is a &lt;em&gt;one-time installation&lt;/em&gt; procedure to follow:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;download quicklisp.lisp&lt;/li&gt;&#xA;&lt;li&gt;load the file (e.g. &lt;code&gt;sbcl --load quicklisp.lisp&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;inside the REPL,  enter &lt;code&gt;(quicklisp-quickstart:install)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Then, enter &lt;code&gt;(ql:add-to-init-file)&lt;/code&gt;. Indeed, each time you reload your environment, you need to load the installed &lt;code&gt;setup.lisp&lt;/code&gt; file. The previous command adds what is necessary into your init file (e.g. &lt;code&gt;~/.sbclrc&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;When you are using Quicklisp, for example if you call &lt;code&gt;(ql:quickload :alexandria)&lt;/code&gt;&lt;sup&gt;&lt;strong&gt;1&lt;/strong&gt;&lt;/sup&gt; you will see the system download and compile the library. This is generally fast but it &lt;em&gt;might&lt;/em&gt; take some time for some libraries. However this is done only once per installed system. The executable &lt;code&gt;*.fasl&lt;/code&gt; files resulting from the compilation will make &lt;code&gt;quickload&lt;/code&gt; terminates faster on subsequent requests for the same systems (even if you quit and restart your environment).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Execution/REPL&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Start and load the challenge with &lt;code&gt;--load&lt;/code&gt; if the code is in a file. &#xA;You can also directly paste them into the REPL. From the REPL, loading other files is made with &lt;code&gt;(load &quot;/path/to/filename&quot;)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;1&lt;/strong&gt;: see &lt;a href=&quot;https://common-lisp.net/project/alexandria/&quot; rel=&quot;nofollow&quot;&gt;https://common-lisp.net/project/alexandria/&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="903" LastEditorUserId="903" LastEditDate="2015-10-07T21:17:35.473" LastActivityDate="2015-10-07T21:17:35.473" CommentCount="0" CommunityOwnedDate="2016-08-21T03:11:45.147" ContentLicense="CC BY-SA 3.0" />
  <row Id="7142" PostTypeId="2" ParentId="6905" CreationDate="2015-10-08T07:18:18.083" Score="28" Body="&lt;h1&gt;Stack Exchange is not an issue tracker&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I haven't voted on this since it was posted, because I wasn't really sure how I feel about it, but now that the Pyth question &lt;a href=&quot;https://codegolf.stackexchange.com/q/59997/8478&quot;&gt;has been posted&lt;/a&gt;, I don't think PPCG is the right place for posts like this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Posting a question along the lines of &quot;I want to make XYZ a better language, so I'd like to know what features people are looking for.&quot; is essentially setting up an issue tracker, and I don't think it really makes sense to do that on PPCG. The only real precedent for using SE as an issue tracker is &lt;a href=&quot;https://stackapps.com/&quot;&gt;StackApps&lt;/a&gt; and even there it feels a bit shoehorned I think.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The right platform for this kind of thing is an &lt;em&gt;actual&lt;/em&gt; issue tracker, like the one in the corresponding GitHub repository.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.563" LastActivityDate="2015-10-08T17:20:30.247" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7144" PostTypeId="2" ParentId="2140" CreationDate="2015-10-08T20:00:19.530" Score="3" Body="&lt;p&gt;This has been donated to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10429/42963&quot;&gt;Secret Santa Sandbox&lt;/a&gt; if anyone wants to take up the mantle.&lt;/p&gt;&#xA;&lt;h1&gt;Crazy Librarian's Interesting Numbers Game&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/card-games&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;card-games&amp;#39;&quot; rel=&quot;tag&quot;&gt;card-games&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Phew, you just managed to finish your code for the &lt;a href=&quot;https://codegolf.stackexchange.com/q/59736/42963&quot;&gt;Arithmetic Sequence of Primes&lt;/a&gt;, and everything went swimmingly for your Crazy Librarian boss. Indeed, the math teacher taught the librarian a new card game as thanks for the prime sequences. However, the librarian wants to beat the math teacher at their own game, and so you're enlisted (again) to assist.&lt;/p&gt;&#xA;&lt;p&gt;The card game was described as a two-player variation of a trick-taking game called &lt;em&gt;California Jack&lt;/em&gt;. Each player is dealt a particular suit of cards from a standard US 52-card deck, and this forms their hand. A third suit of the cards is randomly shuffled and placed face-down between the players as the trophy deck. The fourth suit is unused. Each round, the top of the trophy deck is flipped face-up, and the two players select a card (in secret) from their hand to be their bid for that round, and places it face-down in front of them. The players reveal their bid card, and the higher card (aces low) wins the trophy card. The trophy card goes into the winner's trophy pile, and the two bid cards are discarded. If the players both bid the same card, neither gets the trophy card, and it is discarded along with both bid cards. The winner after all 13 rounds is whoever has the most points in their trophy pile, with Jack=11, Queen=12, and King=13. Note that it is possible for the game to end in a draw (including a zero-point draw).&lt;/p&gt;&#xA;&lt;p&gt;Since you really want to impress the Crazy Librarian, you've ... enlisted ... the help of some of your friends, and you're going to create a bracket royale to find the best playing algorithm, and use that so the librarian can show up the math teacher.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Questions for Meta&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Program I/O? I'm envisioning a stateful program that keeps track of its own cards, where each execution is a run of the game against an outside opponent -- e.g., each input is &lt;code&gt;[W/L] T#&lt;/code&gt; that says whether the program &lt;code&gt;W&lt;/code&gt;on or &lt;code&gt;L&lt;/code&gt;ost the previous round, and what the current-round's &lt;code&gt;T&lt;/code&gt;rophy card is. Then, the output would be what card it chooses to bid. Repeat 13 times. Could also do an interactive version, scraping STDOUT and setting STDIN?&lt;/li&gt;&#xA;&lt;li&gt;Example of a really simplistic algorithm (in pseudocode) -- &lt;code&gt;return argv[1]&lt;/code&gt; -- this just bids the same as whatever the trophy card is.&lt;/li&gt;&#xA;&lt;li&gt;The programs could keep track of their opponent's total and their total, but the controller would have final say (obviously).&lt;/li&gt;&#xA;&lt;li&gt;I'm envisioning a double-bracket style, where each program is randomly seeded into the bracket. Best 3-of-5 games moves it to the next round, while the loser gets re-seeded into the loser's bracket and can re-win a chance for the final four.&lt;/li&gt;&#xA;&lt;li&gt;What am I missing?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-26T20:47:00.867" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7145" PostTypeId="2" ParentId="6905" CreationDate="2015-10-08T21:46:03.033" Score="2" Body="&lt;h1&gt;NO! That's too broad!&lt;/h1&gt;&#xA;&lt;p&gt;Questions seeking advice/tips other than &amp;quot;How to golf on language &lt;em&gt;X&lt;/em&gt;&amp;quot; are too broad, since there isn't a concrete answer that can be accepted.&lt;/p&gt;&#xA;&lt;p&gt;Seriously, anything goes on &amp;quot;How to improve language &lt;em&gt;X&lt;/em&gt;&amp;quot;! You can only vote if you like it or not, but you can't (necessarly) vote if it is good or bad.&lt;/p&gt;&#xA;&lt;hr&gt;&#xA;&lt;p&gt;This comes from experience on one question I've asked a while ago, that was about asking tips to write faster PHP code, for challenges where time is important.&lt;/p&gt;&#xA;&lt;p&gt;The question was shot down and thrown into oblivion.&lt;/p&gt;&#xA;" OwnerUserId="14732" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-09T08:13:24.617" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7146" PostTypeId="2" ParentId="7098" CreationDate="2015-10-08T22:03:10.497" Score="10" Body="&lt;p&gt;As mentioned &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2424&quot;&gt;here&lt;/a&gt;, running programs via commands such as &lt;code&gt;php -r &quot;code here&quot;&lt;/code&gt; is acceptable without penalty. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since &lt;code&gt;&amp;lt;?&lt;/code&gt; and &lt;code&gt;&amp;lt;?php&lt;/code&gt; are both unneeded (and in fact not allowed) when using &lt;code&gt;php -r&lt;/code&gt;, it follows that neither tags are required.&lt;/p&gt;&#xA;" OwnerUserId="29611" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2015-10-08T22:03:10.497" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7150" PostTypeId="1" CreationDate="2015-10-09T03:56:05.757" Score="31" ViewCount="787" Body="&lt;p&gt;I've noticed many challenges getting to the top of &lt;a href=&quot;http://stackexchange.com/&quot;&gt;Hot Network Questions&lt;/a&gt; because they are really easy and get many answers that feed the &lt;a href=&quot;https://meta.stackexchange.com/a/61343/275609&quot;&gt;activity-rewarding hotness formula&lt;/a&gt;. In turn, the visibility attracts more answers and more votes and keeps the cycle going. Can we do something about this?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some are poor questions, with downvotes for significant issues that are &lt;a href=&quot;https://meta.stackexchange.com/q/238420/275609&quot;&gt;flooded out by upvotes&lt;/a&gt; when the challenge reaches the top of the front page. Some are simply a race to be the first to post in your language. This is not to say that all easy or catalog-style questions are bad, but that bad ones evade community judgment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The result is that we advertise a skewed selection of our questions to the SE community and to those browsing our &lt;a href=&quot;https://codegolf.stackexchange.com/?tab=month&quot;&gt;top-voted recent questions&lt;/a&gt;. It creates the impression that our community is about simple, short, one-liner challenges where the goal is just to collect answers in as many languages as possible. In turn, that's what new members are likely to look for and post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moreover, the rep incentives for easy questions are totally wrong. Simple golfs that you write in five minutes should give you less rep, not astronomically more. Likewise for writing challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The effect of &lt;a href=&quot;https://meta.stackexchange.com/q/219922/275609&quot;&gt;HNQ on communities&lt;/a&gt; has been well-discussed on the main meta, and there doesn't seem to be any technical change coming. Is there anything we can do on our end to improve this situation?&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2015-10-09T12:57:43.533" Title="Easy challenges and Hot Network Questions" Tags="|discussion|challenge-quality|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7154" PostTypeId="2" ParentId="7150" CreationDate="2015-10-09T11:00:47.507" Score="7" Body="&lt;h3&gt;Making downvotes count for more&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Downvotes could be weighted more heavily in the formula (at present one downvote is worth the same as one upvote). I would guess that this is unlikely to be done unless it is agreed to do it network-wide. This only helps with the problem of poor quality questions reaching HNQ. It does nothing for the many questions that reach HNQ without a single downvote, as they are good questions just not time consuming to answer. Whether such questions should be the main advert for our site is likely to divide opinion, and including downvotes in the discussion makes it harder to judge the split of that opinion. Hopefully answers here can address those two issues independently.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Excluding specific tags&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;It may be possible to stop certain tags from appearing in the HNQ list. There is already a list of words that are not permitted in titles in HNQ. Questions with a title containing such a word simply do not appear. However, the forbidden words are network-wide, whereas excluding a tag would be site specific. I'm not sure if this would be a problem, but if the tag we want to exclude never appears on other sites then it should be easier.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An example of a tag that makes a question likely to reach HNQ is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;. However, to me that tag seems like one which it makes sense to keep on HNQ since the high number of answers does not indicate low quality, nor attract users that would skew our voting and erode our scope definition.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Opting out of Hot Network Questions&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each site has a manually adjustable weighting that is currently used to adjust for the traffic level of a site (so that HNQ doesn't fill up with only Stack Overflow questions). Since this is site specific it might be easier to get this changed. It won't correct for any of the perceived biases but it could be used to simply opt out of appearing on HNQ as a site, if the community decided that was best. We'd still need to convince the Community Managers that this is also not detrimental to other sites in the network (there may be an argument that the high variety of sites in the HNQ side bar is healthy for SE as a network).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Is there really a problem?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Although it's good to ask the question, and good to see possible things that could change, I think it makes sense to gather meaningful data before making any decisions. I'd like to see suggestions of what statistics would best help decide whether there is a problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's informative to look through the &lt;a href=&quot;https://meta.stackexchange.com/questions/tagged/hot-questions?sort=votes&amp;amp;pageSize=15&quot;&gt;various discussions that have taken place on Mother Meta&lt;/a&gt;. There are many different opinions expressed and many of them sound plausible even though they contradict each other.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What I'd like to see is a HNQ history. The ability to call up statistics on questions based on the maximum hotness score they achieved, the length of time they spent in the HNQ list, and the voting data showing the proportions of votes that came from users at different rep levels (including votes from passing users who had never gained rep on the site beforehand). Even better would be the ability to see what proportion of users new to the site went on to gain rep there later.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't know how much of this could be made available without starting to unintentionally open routes to mining data on specific users, so this might need to be a mod only reporting tool (or even a community manager only tool) but I think its existence would be beneficial to everyone, regardless of who happens to be using it.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Easy and quick are not synonyms&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;It's possible to have a question requiring very little skill or innovation, but still taking a long time to write an answer for. Equally it's possible to have a question which attracts answers very quickly, but mainly from ingenious users who happen to be able to solve tough problems at high pace.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A question being in HNQ suggests that it is quick to answer. Whether it is also easy to answer will vary from question to question, and what the balance is would be interesting to try and measure. In the absence of definitive stats, I'd be interested to hear if anyone has examples from either side: HNQ questions that were easy and/or answerable by visitors, and HNQ questions that were hard and/or answerable mainly by existing users, or even only by a select few existing users.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2015-10-09T11:06:56.490" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7155" PostTypeId="2" ParentId="7150" CreationDate="2015-10-09T12:57:43.533" Score="15" Body="&lt;p&gt;I think Trichoplax answered this pretty well, so I'll just address one aspect:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Some are poor questions, with downvotes for significant issues that are flooded out by upvotes when the challenge reaches the top of the front page.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If the question has significant issues, &lt;strong&gt;close it&lt;/strong&gt;. I'm not saying don't also downvote it, but downvotes are too easy to overcome by the flood, as you mention. Closing it (or &quot;putting it on hold&quot; as we now say) should take it off the HNQ completely until any issues are resolved and it gets reopened. &quot;Significant issues&quot; is basically the entire reason for putting something on hold.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's not impossible that it gets reopened before you think the issues are resolved, but at least it can only be reopened by people who have &lt;em&gt;some&lt;/em&gt; rep in the community, rather than random visitors from the network who can upvote.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2015-10-09T12:57:43.533" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7157" PostTypeId="2" ParentId="7129" CreationDate="2015-10-09T20:16:56.947" Score="19" Body="&lt;h1&gt;Yes, this is valid&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I think that outputting information to files are okay, as long as the asker doesn't specifically tell you that it's not allowed.&lt;/p&gt;&#xA;" OwnerUserId="34543" LastActivityDate="2015-10-09T20:16:56.947" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7159" PostTypeId="1" AcceptedAnswerId="7160" CreationDate="2015-10-10T05:56:14.210" Score="18" ViewCount="397" Body="&lt;p&gt;During my time at PPCG I've seen many answers which don't post the byte count, but instead put &quot;way too long&quot;. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/a/60257/30525&quot;&gt;Thomas Kwa's answer here&lt;/a&gt;. I have also seen this on a plethora of Java answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Personally I find this rather irritating as I still want to see the answer's byte count. So what's the community's view on this?&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-10-10T06:11:52.150" Title="&quot;Way too long&quot; - Allowed or Disallowed?" Tags="|discussion|policy|answers|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7160" PostTypeId="2" ParentId="7159" CreationDate="2015-10-10T06:10:04.580" Score="25" Body="&lt;p&gt;Submissions for code golf should include an accurate byte count. Without it, the submission should be considered invalid since it isn't properly scored.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The default course of action in this case should be to notify the user with a comment, optionally linking back to this meta post.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="20469" LastEditDate="2015-10-10T06:11:52.150" LastActivityDate="2015-10-10T06:11:52.150" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7161" PostTypeId="2" ParentId="2140" CreationDate="2015-10-10T08:55:45.033" Score="1" Body="&lt;p&gt;This is a raw draft about an idea for a popularity contest. Any input would be appreciated.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;My watch, it has two buttons&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I have this watch with two buttons and a display that can show six characters split into groups of two by colons like this&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;12:34:56&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Each character is displayed by a 5x7 LCD-Matrix, so arbitrary ASCII-characters can be displayed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd like to call the buttons &quot;select&quot; and &quot;modify&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem is that the watch is dead. It needs a new operating system.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since I'm not very trained at designing operating systems I want you to write an emulator for my watch. The emulator should be programmable using the following commands.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;big letters &lt;code&gt;A-Z&lt;/code&gt; represent short presses of &quot;select&quot; the corresponding number of times.&lt;/li&gt;&#xA;&lt;li&gt;small letters &lt;code&gt;a-z&lt;/code&gt; have the same meaning for the modify button.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;lt;&lt;/code&gt; represents keeping &quot;select&quot; pressed for half a second (or something like that).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;gt;&lt;/code&gt; represents the same for the modify button.&lt;/li&gt;&#xA;&lt;li&gt;numbers in the code mean to wait for that number of hundredth of seconds.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You're free to program any kind of functionality into my watch, but it should at least be usable as a watch showing the time and as a stopwatch showing minutes, seconds and hundredth of seconds.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One thing I know about my watch is that it can be programmed to receive data from my stdin and send data to my stdout. So once the operating system is installed I could send data and a program to the watch and print the results of the execution to my console.&lt;/p&gt;&#xA;" OwnerUserId="44613" LastActivityDate="2015-10-10T08:55:45.033" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7162" PostTypeId="2" ParentId="2140" CreationDate="2015-10-10T14:17:01.813" Score="1" Body="&lt;h1&gt;Spot the differences&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Little Timmy is waking you up on this Saturday morning once again to help him solve his puzzles. You love the little bugger, but those Spot the Differences games are starting to undermine your patience. Like always, you plan to delegate this tedious task to Robotic Dad™ so you can better spend your time... planning for your child education? Yeah, I think that was the plan.&lt;br&gt;&#xA;Anyway, you tell Timmy not to worry, that you're going to help him soon enough, grab a beer and sit in front of your computer to help your child solve those puzzles, once and for all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to write code that will take two similar pictures which differ in a few spots and somehow output the differences between them. The format of the output is free, however a 5 year-old child should be able to get it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are examples of input :&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/JKe5h.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/JKe5h.png&quot; alt=&quot;a glorious abstract realisation of mine, 1&quot;&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/hhE1x.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/hhE1x.png&quot; alt=&quot;a glorious abstract realisation of mine, 2&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/N1iCH.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/N1iCH.png&quot; alt=&quot;wikipedia&amp;#39;s example, 1&quot;&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/9z30Z.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/9z30Z.png&quot; alt=&quot;wikipedia&amp;#39;s example, 2&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since there is no formally defined output, this is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;.&lt;br&gt;&#xA;Please also keep in mind that you'd like to spend a little time sipping your beer calmly in front of your computer. In this regard, built-in solution should be regarded less highly.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Meta :&#xA;I plan to post a community answer as an example output, linking to the &lt;a href=&quot;http://franklinta.com/2014/11/30/image-diffing-using-css/&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://franklinta.com/2014/11/30/image-diffing-using-css/&lt;/a&gt; article which made me think of this challenge and using a snippet to illustrate it. Is it enough?&lt;/p&gt;&#xA;" OwnerUserId="41881" LastEditorUserId="41881" LastEditDate="2015-10-11T10:30:16.263" LastActivityDate="2015-10-11T10:30:16.263" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7164" PostTypeId="2" ParentId="7129" CreationDate="2015-10-10T17:26:10.713" Score="2" Body="&lt;h1&gt;Yes, but use mktemp&lt;/h1&gt;&#xA;&lt;p&gt;&lt;code&gt;mktemp -d&lt;/code&gt; will create a temporary directory in &lt;code&gt;$tmp&lt;/code&gt; (usually &lt;code&gt;/tmp&lt;/code&gt;) and print the name to stdout. The 14 extra bytes needed to call it and assign to a single-letter variable (&lt;code&gt;d=$(mktemp -d)&lt;/code&gt;) is a fair price to pay for the use of temporary files, when other languages are typically not allowed to use them.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-10T17:26:10.713" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7165" PostTypeId="1" CreationDate="2015-10-11T04:37:47.617" Score="41" ViewCount="591" Body="&lt;p&gt;Note:  Due to changes with RedHat's hosting service, the website is currently down.  There are some (very) early-stage plans to create a bigger, better version.  That being said, if you want to see a new KOTH server be built, please voice your support so that we can gauge demand / tailor it to the specific needs of any potential KOTHs to be hosted on it.  Here is the official &lt;a href=&quot;https://chat.stackexchange.com/rooms/73061/koth&quot;&gt;chat room&lt;/a&gt; for the project.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;The Motivation&lt;/h1&gt;&#xA;&lt;p&gt;The desire for a KOTH server has been around for a while. There have been a couple notable meta discussions about it in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/search?page=1&amp;amp;tab=relevance&amp;amp;q=koth%20is%3aquestion&quot;&gt;past&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1452/creating-an-official-place-to-become-a-king-of-the-hill-tester&quot;&gt;Creating an official place to become a King of the Hill tester&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5379/how-could-we-run-koths-in-a-distributed-fashion&quot;&gt;How could we run KotHs in a distributed fashion?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;By being able to host KOTHs on a server, we can do many things:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We would no longer need to rely on the OPs machine to perform a run.&lt;/li&gt;&#xA;&lt;li&gt;Real-time and massively-multiplayer-online KOTHs are possible.&lt;/li&gt;&#xA;&lt;li&gt;The controller can be re-run at any time, with the most recent leaderboard always visible.&lt;/li&gt;&#xA;&lt;li&gt;Support for several languages, since it is not based on Stack Snippets.&lt;/li&gt;&#xA;&lt;li&gt;Maintain the graphical nature of Stack Snippets, because it's based on a webpage.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;The Project&lt;/h1&gt;&#xA;&lt;p&gt;I have created a website &lt;strong&gt;&lt;a href=&quot;http://koth-phinotpi.rhcloud.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://koth-phinotpi.rhcloud.com/&lt;/a&gt;&lt;/strong&gt; that is capable of hosting KOTH competitions. It has a couple main features:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It has a MySQL database to store information.  This database is available for KOTH controllers to use.&lt;/li&gt;&#xA;&lt;li&gt;It retrieves the KOTH controller files from the author's GitHub repo. I will add support for other locations when the demand arises.&lt;/li&gt;&#xA;&lt;li&gt;It allows anyone to view the leaderboard of / run any of the KOTHs.&lt;/li&gt;&#xA;&lt;li&gt;The format of the report is highly customizable by the KOTH author.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I am basing my project off of the OpenShift hosting platform by RedHat.&lt;/p&gt;&#xA;&lt;h1&gt;How to Use&lt;/h1&gt;&#xA;&lt;h2&gt;Have a repository&lt;/h2&gt;&#xA;&lt;p&gt;Your controller code should be located in a repository for easy cloning by the server.  I currently have support for GitHub repositories (which can improve upon demand).  Provided your username and repo name, the server clones/pulls the files from that repository to run.&lt;/p&gt;&#xA;&lt;h2&gt;The two parts of a KOTH&lt;/h2&gt;&#xA;&lt;p&gt;In order to function on my server, your KOTH needs to have &lt;strong&gt;two&lt;/strong&gt; commands that can be run. First is the command that runs the main controller.  This main controller should be where time-intensive, background-worthy stuff should happen.  The controller is run as a daemon in the background, and does not print results directly to the screen.  Instead, it should write to results files or the database.  Here are two example commands.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;perl controller.pl&#xA;javac *.java; java Tournament&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The second one is what you would do if multiple commands needed to be run, such as compiling all of the entries first.&lt;/p&gt;&#xA;&lt;p&gt;The second command is a command to return the results to be printed to the screen.  These results should be HTML/Javascript which will be shown to the user (as part of the body portion of the web page).  Here are some examples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;perl webview.pl&#xA;cat leaderboard.txt&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The first runs a program that was written by the KOTH author, while the second simply returns a file generated by the main controller.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Ideas for how to use this setup&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Regular KOTHs: The controller is like a regular controller which prints to a file instead of the screen. The report viewing program prints the file.&lt;/li&gt;&#xA;&lt;li&gt;Real-time KOTHs: The controller runs (almost) continuously, updating the database with the current information.  The viewer uses the database information to create a display for the user to see what is currently happening.&lt;/li&gt;&#xA;&lt;li&gt;Stack Snippet-like KOTHs: The controller does very little.  The viewer returns the HTML/JavaScript similar to how a Stack Snippet would, so that the user may run it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Supported Languages&lt;/h2&gt;&#xA;&lt;p&gt;The languages which I believe this site can currently support are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Perl (5.10)&lt;/li&gt;&#xA;&lt;li&gt;Java&lt;/li&gt;&#xA;&lt;li&gt;Ruby&lt;/li&gt;&#xA;&lt;li&gt;Python (2.6.6)&lt;/li&gt;&#xA;&lt;li&gt;C / C++&lt;/li&gt;&#xA;&lt;li&gt;PHP&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Using the MySQL Database&lt;/h2&gt;&#xA;&lt;p&gt;Your programs can access the database and use it to store information.  The connection details for the database are passed as environmental variables to your program.  These are:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;OPENSHIFT_MYSQL_DB_HOST&#xA;OPENSHIFT_MYSQL_DB_PORT&#xA;OPENSHIFT_MYSQL_DB_USERNAME&#xA;OPENSHIFT_MYSQL_DB_PASSWORD&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Configuration&lt;/h2&gt;&#xA;&lt;p&gt;I maintain the list of current/active KOTHs in &lt;a href=&quot;http://koth-phinotpi.rhcloud.com/kothlist.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;this settings file&lt;/a&gt;.  The template for each entry is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;koth [KOTH-repo-name]&#xA;github [github-username]&#xA;name [a longer, multi-word name]&#xA;description [a description]&#xA;controller [command]&#xA;webview [command]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Two examples are as follows.  The first one is for a Perl KOTH.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;koth servertest&#xA;github PhiNotPi&#xA;name Server Test&#xA;description This is an example KOTH for testing.&#xA;controller perl {filepath}controller.pl&#xA;webview perl {filepath}webview.pl&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and this next one is for a Java KOTH.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;koth NanoCoreWar&#xA;github PhiNotPi&#xA;name The Nano Core War&#xA;description A core-wars-inspired KOTH with a minimalist instruction set.&#xA;controller javac *.java; java Tournament&#xA;webview cat leaderboard.txt&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The &lt;code&gt;{filepath}&lt;/code&gt; is replaced by my website as the absolute file path to the file created from cloning the repository.  It is usually not actually needed because the server changes its working directory to that file path before executing the commands.&lt;/p&gt;&#xA;&lt;p&gt;This settings file should, theoretically, be the only thing I need to update to add a new KOTH to the server.  Deactivating a KOTH should be as easy as removing its name from the top line.&lt;/p&gt;&#xA;&lt;h1&gt;To-Do List&lt;/h1&gt;&#xA;&lt;p&gt;This is a &lt;em&gt;work-in-progress.&lt;/em&gt; There are many things that still need to be done.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Making it look nicer?&lt;/li&gt;&#xA;&lt;li&gt;Managing security.  Creating a way to limit the power of controllers to only mess around with their own files.  I don't anticipate actual malice on the part of PPCG users, but stuff can break accidentally. Right now, I simply set their working directories at the start.&lt;/li&gt;&#xA;&lt;li&gt;Better update control.  I can manually wipe/re-update any of KOTHs in one fell swoop very easily, but that would usually erase too much stuff.  On the other hand, updating may not be a thing we should let every website visitor do.&lt;/li&gt;&#xA;&lt;li&gt;It needs more testing/proof-of-concept-ing for real-time KOTHs, since that is a major design goal, but I am unaware of any that currently exist.&lt;/li&gt;&#xA;&lt;li&gt;Reduce the downtime involved in updating the site. I think there's actually a feature of the OpenShift platform to help with this, although I will have to look into it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;http://koth-phinotpi.rhcloud.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Website&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-14T01:10:46.453" Title="Introducing a KOTH server!" Tags="|discussion|" AnswerCount="0" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="7166" PostTypeId="2" ParentId="7129" CreationDate="2015-10-11T06:18:18.643" Score="3" Body="&lt;h1&gt;Yes, but list them differently&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It is always allowed to use &lt;code&gt;mktemp&lt;/code&gt; or &lt;code&gt;/tmp&lt;/code&gt; itself. But if the program use temporary files in the current directory, it should be listed as &quot;Bash (with temporary files)&quot; or something like that, if it is not the usual way using this language.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2015-10-11T06:18:18.643" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7167" PostTypeId="1" AcceptedAnswerId="7172" CreationDate="2015-10-11T08:59:20.800" Score="22" ViewCount="2495" Body="&lt;p&gt;Fixed output challenges usually state that the program &quot;must take no input&quot;. I usually interpret this as &quot;The standard input is empty&quot;, but after thinking about this, there are actually several valid interpretations:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program has to ignore the standard input, that is, it should work regardless of what is given as input.&lt;/li&gt;&#xA;&lt;li&gt;The program has to work only when an empty stream is piped into the standard input.&lt;/li&gt;&#xA;&lt;li&gt;The program has to work without piping anything into it. It may block for user input, but can expect the input to be empty.&lt;/li&gt;&#xA;&lt;li&gt;The program has to work without piping anything into it &lt;em&gt;and&lt;/em&gt; it must not block for user input.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There are probably even more interpretations. The last three are worth distinguishing: for instance, my own language &lt;a href=&quot;https://github.com/mbuettner/retina&quot; rel=&quot;nofollow noreferrer&quot;&gt;Retina&lt;/a&gt; was until recently not able to prevent blocking for user input when nothing was piped in - so to really run it without any input one &lt;em&gt;had&lt;/em&gt; to do&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;echo &quot;&quot; | ./Retina -s program.ret&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I imagine there are other languages which have this limitation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So what should the default meaning of &quot;your program must take no input&quot; be?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(There was &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5476/8478&quot;&gt;a related discussion&lt;/a&gt; for languages which plainly incapable of executing any code at all if no input is given.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2023-09-05T18:00:00.717" Title="What does &quot;taking no input&quot; mean for a program?" Tags="|discussion|policy|rules|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7168" PostTypeId="2" ParentId="2140" CreationDate="2015-10-11T11:08:15.450" Score="0" Body="&lt;h1&gt;Ceylon golfer (whitespace + comment removal)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As some people might have noted, I'm &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=user%3A2338%20is%3Aanswer&quot;&gt;answering here&lt;/a&gt; often using Ceylon. This is usually done first writing a &quot;normal&quot; program, then slimming it down using whichever tricks I find, and at the last step remove all superfluous white space (and possibly also comments)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I want to automatize the last step.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ceylon is syntax-wise a C-like language, so this golfer might be useful also for other languages. The details might differ, though.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/60230/remove-whitespace-from-a-java-program&quot;&gt;Remove Whitespace from a Java Program&lt;/a&gt;, but not the same, as Ceylon strings are a bit more complicated. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Details&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;http://ceylon-lang.org/documentation/1.1/spec/html_single/#lexical&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ceylon program&lt;/a&gt; is a Unicode character stream, which can be lexically analized into a series of tokens, possibly separated by whitespace. (Only ASCII white space is allowed: space, tab, form feed (FF), line feed (LF), carriage return (CR).)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That whitespace is sometimes necessary – when otherwise the two tokens would stick together and form one token, or when a comment would become longer than before (but comments are to removed, too). Other whitespace can be removed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lines are terminated by LF, CR or a sequence of CR LF.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We have two kinds of comments:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Multiline comments start with &lt;code&gt;/*&lt;/code&gt; and end with &lt;code&gt;*/&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;end-of-line comments start with &lt;code&gt;//&lt;/code&gt; or &lt;code&gt;#!&lt;/code&gt; and end with the line (i.e. at the next line terminator).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Everything which is not whitespace or a comment is part of a token.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Tokens are of these forms:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Identifiers or keywords start with a  (uppercase or lowercase) letter and then can contain letters, &lt;code&gt;_&lt;/code&gt; and digits. They can also start with &lt;code&gt;\I&lt;/code&gt; or &lt;code&gt;\i&lt;/code&gt; instead. (Examples are &lt;code&gt;true&lt;/code&gt;, &lt;code&gt;Integer&lt;/code&gt;, &lt;code&gt;a&lt;/code&gt;, &lt;code&gt;helloWorld&lt;/code&gt;, &lt;code&gt;example1234&lt;/code&gt;, &lt;code&gt;\Iexample1234&lt;/code&gt;.)&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Literals:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;numeric literals (decimal integer, hex integer, binary integer, formal floating point, shortcut floating point) have the form &lt;code&gt;[0-9_]+[kMGTPmunpf]?|\$[01_]+|\#[0-9a-fA-F_]+|[0-9_]+\.[0-9_]+(e[+-]?[0-9]+|[kMGTPmunpf])?&lt;/code&gt; (where the &lt;code&gt;_&lt;/code&gt; is only allowed at certain places).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Maybe that can be simplified to &lt;code&gt;[#$0-9][0-9a-fA-FkMGFPmunpf._]*&lt;/code&gt;, with the dot not being the last character. Not all such strings are valid numeric literals, but I guess you don't have to figure them all out. The details are in the specification linked above.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Character literals have the form &lt;code&gt;'&lt;/code&gt; + single character (except &lt;code&gt;&quot;&lt;/code&gt; or &lt;code&gt;\&lt;/code&gt;) or escape sequence + &lt;code&gt;'&lt;/code&gt;, where an escape sequence is either a &lt;code&gt;\{&lt;/code&gt; + a name or code of a character + &lt;code&gt;}&lt;/code&gt;, or a &lt;code&gt;\&lt;/code&gt; followed by a single (non-&lt;code&gt;{&lt;/code&gt;) character.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples: &lt;code&gt;' '&lt;/code&gt;, &lt;code&gt;'←'&lt;/code&gt;, &lt;code&gt;'a'&lt;/code&gt;, &lt;code&gt;'\''&lt;/code&gt;, &lt;code&gt;'`'&lt;/code&gt;, &lt;code&gt;'\{#0020}'&lt;/code&gt;, &lt;code&gt;'\{#212B}'&lt;/code&gt;, &lt;code&gt;'\n'&lt;/code&gt;, &lt;code&gt;'\{ALCHEMICAL SYMBOL FOR GOLD}'&lt;/code&gt;, &lt;code&gt;'&quot;'&lt;/code&gt;, &lt;code&gt;'\&quot;'&lt;/code&gt;, &lt;code&gt;'\\'&lt;/code&gt;, &lt;code&gt;'/'&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;String literals:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A simple string literal is &lt;code&gt;&quot;&lt;/code&gt; + a sequence of single characters (except &lt;code&gt;&quot;&lt;/code&gt;, &lt;code&gt;\&lt;/code&gt; and &lt;code&gt;`&lt;/code&gt; ) and escape sequences (see above) + &lt;code&gt;&quot;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;An interpolated string literal (or string template) looks like a simple string literal, but can also contain &lt;code&gt;``&lt;/code&gt; + some non-string-code + &lt;code&gt;``&lt;/code&gt; inside the string. (In this non-string-code the whitespace and comment removal can be applied.)&lt;/li&gt;&#xA;&lt;li&gt;A verbatim string literal is &lt;code&gt;&quot;&quot;&quot;&lt;/code&gt; + a sequence of any characters, except &lt;code&gt;&quot;&quot;&quot;&lt;/code&gt;, + &lt;code&gt;&quot;&quot;&quot;&lt;/code&gt;. (There is no escape sequences or interpolation here.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There is further complication with multi-line string literals, but I guess for this challenge we can assume that there are no multi-line string literals.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples for String literals: &lt;code&gt;&quot;&quot;&lt;/code&gt;, &lt;code&gt;&quot;&quot;&quot;&quot;&quot;&quot;&lt;/code&gt; (both the empty string), &lt;code&gt;&quot;Hello World!&quot;&lt;/code&gt;, &lt;code&gt;&quot;Escapes: \{#212B}, \{ALCHEMICAL SYMBOL FOR GOLD}&quot;&lt;/code&gt;, &lt;code&gt;&quot;&quot;&quot;non-interpreted Escapes: \{#212B}, \{ALCHEMICAL SYMBOL FOR GOLD}&quot;&quot;&quot;&lt;/code&gt;, &lt;code&gt;&quot;some more escapes: \n, \r, \f, \t, \b, \\, \`, \', \&quot;&quot;&lt;/code&gt;, &lt;code&gt;&quot;punctuation: ' ` \&quot; and more text&quot;&lt;/code&gt;, &lt;code&gt;&quot;&quot;&quot;punctuation: ' ` &quot; and even single \.&quot;&quot;&quot;&lt;/code&gt;, &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A lot of symbols are punctuation and operators:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; , ; ... { } ( ) [ ] ` ? . ?. *. = =&amp;gt; + - * / % ^ ** ++ -- .. : -&amp;gt; !&#xA; &amp;amp;&amp;amp; || ~ &amp;amp; | === == != &amp;lt; &amp;gt; &amp;lt;= &amp;gt;= &amp;lt;=&amp;gt; += -= /= *= %= |= &amp;amp;= ~= ||= &amp;amp;&amp;amp;=&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The grammar is such that whitespace adjacent to one of those punctuation tokens is never relevant, so it can be removed.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program which receives as input a valid Ceylon program, and outputs the same program, with all comments and non-essential white space removed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Whitespace is essential when without it two tokens would be one token – this applies specifically to keywords/identifiers and numeric literals. In those cases replace any string of whitespace with a single space.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I guess there are some cases like &lt;code&gt;10else&lt;/code&gt; where an integer literal can be joined with a keyword, but for safety it is better to always have a space in there.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, whitespace inside a string is highly relevant, so it should not be touched.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a removed comment was the only thing between two keywords/identifiers, make sure to put a space in there.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Open questions&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I guess I should add some example inputs and expected outputs.&lt;/li&gt;&#xA;&lt;li&gt;How to score this? Simply as Codegolf, assuming there will be correct answers? Or give some example programs and see which entry succeeds to make them smallest?&lt;/li&gt;&#xA;&lt;li&gt;I guess most Ceylon programs to be golfed will actually be ASCII only – do we allow ASCII-only solutions, while giving a bonus for proper Unicode handling (in comments, strings, identifiers)?&lt;/li&gt;&#xA;&lt;li&gt;Do we require full programs, or allow also functions which take+return strings (or character streams)?&lt;/li&gt;&#xA;&lt;li&gt;Did I simplify the grammar not enough, or too much?&lt;/li&gt;&#xA;&lt;li&gt;I can imagine some bonuses for finding the shortest representation of an integer of float literal .. not sure if that is worth the complication.&lt;/li&gt;&#xA;&lt;li&gt;Another possible bonus would be to find the shortest way of representing a string literal (replacing some Unicode escapes by the actual characters, choosing between &lt;code&gt;&quot;&lt;/code&gt; and &lt;code&gt;&quot;&quot;&quot;&lt;/code&gt;, etc.).&lt;/li&gt;&#xA;&lt;li&gt;Do we want to handle multiline strings correctly? Maybe as a bonus?&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Another possible bonus would be to remove strings literals which are not passed or assigned to anything (these are often used for documentation comments) – but I'm not sure how to define that without specifying the whole grammar.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Those have leadings space in the following lines, up to the column where the literal started, which needs to be removed when lexing. If we change the alignment of the string literal, we need to adjust those spaces too. Here it can sometimes be useful actually not include a new-line before the string to minimize that indentation.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="2338" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.563" LastActivityDate="2015-10-11T11:51:23.067" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7171" PostTypeId="2" ParentId="2140" CreationDate="2015-10-11T18:58:39.273" Score="2" Body="&lt;h1&gt;Bitcoin Trading&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is mainly an idea for something I could potentially host on my KOTH server.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Everybody knows that bitcoins are the next big thing.  It's just a question of when they are going to take off.  Right now, they are worth $250 each, but who knows, maybe someday they will be worth over $1000!  The &lt;a href=&quot;http://www.broadstuff.com/uploads/BitcoinII.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;growth trend&lt;/a&gt; is phenomenal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are a tech-savvy investor who wants to get in on this action.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your goal is to write a bot that can predict the market and tell you how you should invest your money, given hourly updates of the Bitcoin price.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Keeping Balance&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To overcome the fastest-gun-in-the-west effect, wherein early answers have more time to make more money, this challenge will not keep track of any absolute balances.  Instead, the assets of each entrant will be scaled up/down between each round.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each entrant will be given a single float in the range &lt;code&gt;0&lt;/code&gt; to &lt;code&gt;1&lt;/code&gt; representing the percent of total assets are currently invested in Bitcoin.  This is calculated by &lt;code&gt;(BTC_cur_rate*BTC_owned)/(USD_owned + BTC_cur_rate*BTC_owned)&lt;/code&gt;.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;A value of &lt;code&gt;0&lt;/code&gt; means that you currently have nothing invested in Bitcoin, while a value of &lt;code&gt;1&lt;/code&gt; means that you have everything invested in Bitcoin.  An input of &lt;code&gt;0.3&lt;/code&gt; means that 30% of your total value is in Bitcoin, while the other 70% of your value is in dollars.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input    -&amp;gt;    assets as portion of your total value&#xA;                 BTC     %      USD     %&#xA; 0.0     -&amp;gt;      0.0    0%      1.0  100%&#xA; 0.3     -&amp;gt;      0.3   30%      0.7   70%&#xA; 0.6     -&amp;gt;      0.6   60%      0.4   40%&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Price Data&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Players will also have access to a file &lt;code&gt;history.txt&lt;/code&gt; which will contain the BTC price history, measured in cents, over the duration of the competition.  Each time a player is called, they are presented with a fresh copy of &lt;code&gt;history.txt&lt;/code&gt;, with one line appended each turn.  Do not attempt to modify this file.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example File&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This could be the history.txt file after 3 hours of competition.  The most recent price is $247.49.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;24694&#xA;24724&#xA;24749&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There will be a trailing newline at the end of the file.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Making a Trade (ouput)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The output of your program should be another float in the range of 0 to 1, representing the new portion of your assets that you want invested in Bitcoin.  The difference between your input number and output number represent the amount of value being exchanged. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input -&amp;gt; BTC USD  |  output -&amp;gt; BTC USD  |  trade being made&#xA; 0.3  -&amp;gt; 0.3 0.7  |   0.2   -&amp;gt; 0.2 0.8  |  0.1 in BTC -&amp;gt; 0.1 in USD&#xA; 0.3  -&amp;gt; 0.3 0.7  |   0.6   -&amp;gt; 0.6 0.4  |  0.3 in USD -&amp;gt; 0.3 in BTC&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Calculating Score for a Round&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your score for a round is based on your change of value for that round.  You start every round with a total value of &lt;code&gt;1&lt;/code&gt;, but your ending value is influenced by two things:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A 0.2% commission on your trade taken by the controller&lt;/li&gt;&#xA;&lt;li&gt;The change in Bitcoin value over the next hour&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Taking Commission&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Commission is taken whenever you buy or sell bitcoins.  Whenever you convert a certain amount of value from one currency to the other, you will receive 0.2% less of the new currency than what you actually ordered.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input  |  output  |    trade     |  commission  |  result after commission&#xA; 0.3   |   0.6    |  0.3 -&amp;gt; BTC  |  0.0006 BTC  |  0.5994 BTC &amp;amp; 0.4 USD&#xA; 0.75  |   0.05   |  0.7 -&amp;gt; USD  |  0.0014 USD  |  0.05 BTC &amp;amp; 0.9486 USD&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Adjusting BTC Value&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;After taking commission, your value of BTC is multiplied by the price percent change in BTC over the next hour.  The amount of value you have in USD will stay constant.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;BTC after commission  |  prices in cents  |  % change  |  new BTC value&#xA;         0.5          |  30000 -&amp;gt; 29850   |   -0.5%    |    0.4975&#xA;         0.236        |  20000 -&amp;gt; 30447   |   +2.0%    |    0.24072&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Overall Process of a Round&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Below is an example showing all of the steps in a single round.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;BTC    USD&#xA;.3     .7  = 1.0      input to entrant is 0.3&#xA;.6     .4  = 1.0      output of entrant is 0.6&#xA;.0006  .0             0.2% commission of the trade&#xA;.5994  .4  = 0.9994   result after commission&#xA;+0.3%                 percent change in bitcoin price over 1 hour&#xA;.6012  .4  = 1.0012   result after the flow of time = score for that round&#xA;.60048 .39952 = 1     input for the next round is 0.60048 after scaling&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Determining the Winner&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For a given round, your score is your new total value.  This is after taking the 0.2% commission and calculating the change in Bitcoin value.  For the above example, the score was about &lt;code&gt;1.0012&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At any given time, the aggregate score for an entrant shall be the product of the scores for its most recent (up to) 50 rounds.  At any given time, the current winner is the player with the highest aggregate score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, a bot could get these scores for its first 5 rounds: &lt;code&gt;1.001 1.002 0.998 0.999 1.003&lt;/code&gt;.  The total score of the bot is about &lt;code&gt;1.00299&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Controller&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I haven't written the controller yet, but I think it's going to be written in Perl with support for entrants in a variety of other languages (Java/Python/Ruby/C++).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I plan to use &lt;a href=&quot;https://api.bitcoinaverage.com/ticker/USD/last&quot; rel=&quot;nofollow noreferrer&quot;&gt;this API&lt;/a&gt; for bitcoin price data.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The controller will probably run all of the entrants in parallel, each with their own thread.  This simply allows it to put a stop to any infinite looping that may occur.  I hope it will work if all of the programs are reading the same history file at once.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Additional Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Since this is a PvE competition and not a PvP competition, and takes place on a server, there are some slight differences in rules.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There's no set restriction on submitting multiple bots, since you can't make a team.&lt;/li&gt;&#xA;&lt;li&gt;Similar to always, you can't call other programs, like the controller or other bots, during your turn.&lt;/li&gt;&#xA;&lt;li&gt;The time limit is loose.  A long as a single round with all of the bots doesn't take up most of an hour to perform, it'll be fine.  It really shouldn't take more than a couple minutes for each bot to make a move.&lt;/li&gt;&#xA;&lt;li&gt;You may create a single file, with the filename &lt;code&gt;[botname]-data.txt&lt;/code&gt;, in the current directory.  This file will persist, even across updates of your bot or the controller.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2017-05-21T15:46:38.060" LastActivityDate="2017-05-21T15:46:38.060" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7172" PostTypeId="2" ParentId="7167" CreationDate="2015-10-11T20:32:07.693" Score="38" Body="&lt;h1&gt;Programs may assume that input is &lt;em&gt;empty&lt;/em&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I believe that the requirement&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The program has to ignore the standard input, that is, it should work regardless of what is given as input.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;is too strong. There are (mostly esoteric) languages which automatically read all input there is. These languages would always have to include some code to get rid of that input first, which doesn't really add anything to these submissions (except bytes, of course...).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hence, programs should generally be allowed to expect that the input is completely empty. &lt;strong&gt;Any setup that is necessary for the input to be empty may be expected as well.&lt;/strong&gt; That is, if a language can only read an empty input from a pipe (as used to be the case with Retina), such an empty pipe can be expected. If a language cannot suppress a user prompt, the solution may expect this prompt to return empty. If a language can &lt;em&gt;only&lt;/em&gt; read from a file (for whatever reason), it may expect that file to exist and be empty.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This rule is intended to be as inclusive and fair as possible. I can't see this opening any loopholes, but let me know if you can think of any.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, as usual, any challenge author is free to override this default if their particular challenge becomes more interesting by requiring the code to work for &lt;em&gt;any&lt;/em&gt; input (in which case they should clarify whether input can be assumed to be finite).&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2015-10-12T18:12:44.343" LastActivityDate="2015-10-12T18:12:44.343" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="7173" PostTypeId="2" ParentId="2140" CreationDate="2015-10-12T00:53:06.260" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Steganography&quot; rel=&quot;nofollow noreferrer&quot;&gt;Steganographic&lt;/a&gt; Image Encoding&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/steganography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;steganography&amp;#39;&quot; rel=&quot;tag&quot;&gt;steganography&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Write two programs, an encoder and decoder. Score is the sum of the source in bytes.&lt;/p&gt;&#xA;&lt;h2&gt;Encoder Specs&lt;/h2&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a lossless 24-bit color image file&#xA;&lt;ul&gt;&#xA;&lt;li&gt;could be anything from BMP to PNG to PPM&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;an arbitrary data file&#xA;&lt;ul&gt;&#xA;&lt;li&gt;undefined behavior if one attempts to encode a too-large file in a too-small image.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;an integer value, &lt;em&gt;n&lt;/em&gt;, from 1 to 8, indicating the number of bits to use per subpixel.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;p&gt;An encoded image with the arbitrary data stored in the &lt;em&gt;n&lt;/em&gt; least significant bits of the pixel data. The data must be stored in the pixels, i.e. not in some hidden metadata. How the data is serialized into the 3-D image space (height, width, color channel) is undefined.&lt;/p&gt;&#xA;&lt;h2&gt;Decoder Specs&lt;/h2&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;an image produced by the encoder&lt;/li&gt;&#xA;&lt;li&gt;the arbitrary file's length in bytes&lt;/li&gt;&#xA;&lt;li&gt;the same integer value the decoder took indicating the number of bits per subpixel.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the identical arbitrary data file as was provided to the encoder&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Requests for Comment:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Fix &lt;em&gt;n&lt;/em&gt; to 1?&lt;/li&gt;&#xA;&lt;li&gt;Encode the length/LSB's used in the image so you don't need to specify them again. (e.g. fixed format for a couple pixels to define it?) Requirement/Bonus?&lt;/li&gt;&#xA;&lt;li&gt;Maybe have the arbitrary data file be another image of the same dimensions, a la &lt;a href=&quot;https://en.wikipedia.org/wiki/Steganography#Digital_messages&quot; rel=&quot;nofollow noreferrer&quot;&gt;the Wikipedia example (cat in a tree)&lt;/a&gt;? That could be kinda boring though; some very simple array operations could do it all. Or that could be clever. In that case, there's necessarily data loss of the hidden image.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;em&gt;n&lt;/em&gt; was one and this only required an encoder, it would be the same as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/25443/hiding-information-in-cats&quot;&gt;this&lt;/a&gt;, but this requires a matching decoder. One way encoding challenges I find dull.&lt;/li&gt;&#xA;&lt;li&gt;I'd be fine with using image libraries to load/save the image&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="176" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-12T01:03:03.080" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7176" PostTypeId="1" CreationDate="2015-10-12T13:07:03.440" Score="0" ViewCount="140" Body="&lt;p&gt;I used the Python shell to answer a question. Is that OK or should I have created a whole program for it?&lt;/p&gt;&#xA;" OwnerUserId="45571" LastActivityDate="2015-10-12T13:07:03.440" Title="Does the Python shell count as a &quot;programming language&quot;?" Tags="|discussion|" AnswerCount="0" CommentCount="1" ClosedDate="2015-10-12T13:19:52.843" ContentLicense="CC BY-SA 3.0" />
  <row Id="7182" PostTypeId="2" ParentId="2140" CreationDate="2015-10-13T04:46:04.743" Score="2" Body="&lt;h1&gt;The /\/\aze of Mirrors&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;sniffs&lt;/em&gt;...something smells...fishy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The reason being that there's actually a fish! But it's at the end of a maze of mirrors that you have control over. Your task is to rotate the mirrors until you can see that delicious-smelling &gt;&amp;lt;&gt;. Luckily, there are only nine mirrors, so it doesn't take you long to find a solution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, if you encounter this again in the future, you don't want to have to actually do the work yourself. Computers are so much better at it. So you decide to write some code to solve it for you. The shorter, the better, because you don't want that fish to rot!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The situation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program must accept a single positive integer &lt;code&gt;n&lt;/code&gt; as input. It then has to find a solution for an &lt;code&gt;n&lt;/code&gt; by &lt;code&gt;n&lt;/code&gt; mirror maze with the following conditions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You, the observer (&lt;code&gt;&amp;gt;&lt;/code&gt;), is seated next to one corner.&lt;/li&gt;&#xA;&lt;li&gt;The fish (&lt;code&gt;F&lt;/code&gt;) is placed next to the opposite corner, on the adjacent wall if &lt;code&gt;n&lt;/code&gt; is even and on the opposite wall if &lt;code&gt;n&lt;/code&gt; is odd.&lt;/li&gt;&#xA;&lt;li&gt;The maze is toroidal because its designers installed cameras and screens.&lt;/li&gt;&#xA;&lt;li&gt;However, there is a wall behind the fish, so you can only see it from inside the maze.&lt;/li&gt;&#xA;&lt;li&gt;You must use &lt;strong&gt;all&lt;/strong&gt; of the mirrors. No shortcuts!&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Bonus:&lt;/strong&gt; take an additional non-negative integer &lt;code&gt;x&lt;/code&gt; as input and solve the maze for when the fish is &lt;code&gt;x&lt;/code&gt; spaces away from the corner (where &lt;code&gt;x=0&lt;/code&gt; is its usual place), flipping to the other wall if &lt;code&gt;x&lt;/code&gt; is odd.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example solutions&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;+-+&#xA;&amp;gt;/F&#xA;+-+&#xA;&#xA;2&#xA;+--+&#xA;&amp;gt;/\|&#xA;|//|&#xA;+-F+&#xA;&#xA;2 1&#xA;+--+&#xA;&amp;gt;/\F&#xA;|\/|&#xA;+--+&#xA;&#xA;3&#xA;+---+&#xA;&amp;gt;\/\|&#xA;|//\|&#xA;|\/\F&#xA;+---+&#xA;&#xA;4&#xA;+----+&#xA;&amp;gt;/\/\|&#xA;|//\\|&#xA;|\\//|&#xA;|//\\|&#xA;+---F+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;standard loopholes&lt;/a&gt;, as usual.&lt;/li&gt;&#xA;&lt;li&gt;Your program must output the solution in ASCII like what I've shown above.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Scoring is in bytes&lt;/strong&gt;, unless you have the &lt;strong&gt;bonus: multiply by 0.8&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I look forward to seeing all the a&lt;em&gt;maze&lt;/em&gt;ing solutions! Ha! &lt;sub&gt;&lt;sup&gt;Sorry, that was bad.&lt;/sup&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="12914" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2015-10-13T04:46:04.743" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7183" PostTypeId="2" ParentId="2140" CreationDate="2015-10-13T09:15:16.363" Score="2" Body="&lt;h1&gt;Categorical logic [on hold]&lt;/h1&gt;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://philosophy.stackexchange.com/questions/28672/categorical-logic-some-a-are-b-all-b-are-c-therefore-all-a-are-c&quot;&gt;this question&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;h3&gt;Task&lt;/h3&gt;&#xA;&lt;p&gt;The point of this challenge is to create a function or program that takes 3 short phrases and returns the logical assessment of the phrases.&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;Each of the three phrases will be in the form: &lt;code&gt;[All|Some] [A|B|C] are [A|B|C].&lt;/code&gt;, where the two &lt;code&gt;A|B|C&lt;/code&gt; elements are different. The string &lt;code&gt;Therefore,{space}&lt;/code&gt;, where &lt;code&gt;{space}&lt;/code&gt; is a single space character, precedes the third phrase and reduces the initial capital of the third phrase to a lower case letter.&lt;/p&gt;&#xA;&lt;p&gt;You may choose the input source and the separation of the strings. For example, &lt;code&gt;STDIN with three concatenated phrases&lt;/code&gt;, &lt;code&gt;text file, phrases separated by newlines&lt;/code&gt;, and &lt;code&gt;taking the phrases as command-line arguments in quotes&lt;/code&gt; are all acceptable.&lt;/p&gt;&#xA;&lt;h3&gt;Sample input&lt;/h3&gt;&#xA;&lt;p&gt;With three concatenated phrases as example format.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;Some tees are moos. All moos are yees. Therefore, all tees are yees.&lt;/code&gt; (output: falsy)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;All A are B. All A are C. Therefore, some B are C.&lt;/code&gt; (output: ????)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;All submissions are answers. Some submissions are winners. Therefore, some answers are winners.&lt;/code&gt; (output: truthy)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output for a logically correct combination of phrases must be a truthy value.&lt;/li&gt;&#xA;&lt;li&gt;Output for a logically incorrect combination must be a falsy value. This is also the case if the input is logically unsound e.g. &lt;code&gt;All A are B. No A are B. ...&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Output for a logically uncertain combination must be the following string: &lt;code&gt;????&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The output may be followed by a single newline.&lt;/p&gt;&#xA;&lt;h3&gt;Clarifications for finicky logic&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;Some&lt;/code&gt; is a subset of &lt;code&gt;All&lt;/code&gt;. The following statement is badly written, but truthy: &lt;code&gt;All A are B. All A are B. Therefore, Some A are B.&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The following statement is also truthy: &lt;code&gt;All A are B. All B are C. Therefore, some C are A&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt;, so shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;p&gt;You may reduce your score by 10% if your values for &lt;code&gt;A|B|C&lt;/code&gt; can contain spaces. You may assume that the value for &lt;code&gt;A|B|C&lt;/code&gt; will not contain the word &lt;code&gt;{space}are{space}&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;p&gt;You may reduce your score by a further 20% if your function or program also correctly handles &lt;code&gt;No&lt;/code&gt; as input as well as &lt;code&gt;All|Some&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Leaderboard&lt;/h3&gt;&#xA;&lt;p&gt;Standard leaderboard code goes here. Tag suggestions are welcome!&lt;/p&gt;&#xA;" OwnerUserId="42103" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-14T14:09:36.073" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7188" PostTypeId="2" ParentId="6918" CreationDate="2015-10-14T04:31:11.360" Score="7" Body="&lt;h2&gt;&lt;a href=&quot;http://esolangs.org/wiki/Minkolang&quot; rel=&quot;nofollow noreferrer&quot;&gt;Minkolang&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;I, El'endia Starman, created Minkolang in mid-October.&lt;/p&gt;&#xA;&lt;p&gt;Minkolang is a stack-based semi-golfing (2+1)D language heavily inspired by Befunge and &amp;gt;&amp;lt;&amp;gt;. I say it's a semi-golfing language because a good number of functions are one character, but I also keep simplicity and intuitiveness in mind. Plus, the fact that there are few or no ways to work with the stack as a whole means that it can never be as concise as true golfing languages. (I.e., I can't apply a function to every element on the stack at once, though I am actually now thinking on how to do that.)&lt;/p&gt;&#xA;&lt;p&gt;One major element that sets Minkolang apart from other 2D languages is that for loops, while loops, and recursion are directly implemented. These, combined with its stack manipulation, array storage, and reflection capabilities make it a particularly powerful 2D language.&lt;/p&gt;&#xA;&lt;p&gt;The official interpreter is written in Python 3 and is available here: &lt;a href=&quot;https://github.com/elendiastarman/Minkolang&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="12914" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-14T18:28:46.797" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7192" PostTypeId="2" ParentId="2140" CreationDate="2015-10-14T18:36:44.700" Score="0" Body="&lt;h1&gt;Time Series Analysis&lt;/h1&gt;&#xA;&lt;p&gt;Time series analysis comprises methods for analyzing time series data in order to extract meaningful statistics and other characteristics of the data (from &lt;a href=&quot;https://en.wikipedia.org/wiki/Time_series&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;).&lt;/p&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a program or function that take a time series vector &lt;code&gt;ts&lt;/code&gt; and output a the &lt;a href=&quot;https://en.wikipedia.org/wiki/Coefficient_of_determination&quot; rel=&quot;nofollow noreferrer&quot;&gt;coefficient of determination&lt;/a&gt; of a &lt;a href=&quot;https://en.wikipedia.org/wiki/Linear_regression&quot; rel=&quot;nofollow noreferrer&quot;&gt;simple linear  regression model&lt;/a&gt; estimated by the &lt;a href=&quot;https://en.wikipedia.org/wiki/Ordinary_least_squares&quot; rel=&quot;nofollow noreferrer&quot;&gt;ordinary least squares&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The coefficient of determination should be the squared correlation between the predicted values of the model and the real values of the input, in such way that any perfectly linear time series should have &lt;code&gt;1 &lt;/code&gt; as it's coefficient.&lt;/p&gt;&#xA;&lt;h3&gt;Considerations&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;ts&lt;/code&gt; is a vector of racional numbers of length &lt;img src=&quot;https://latex.codecogs.com/gif.latex?%5Cdpi%7B80%7D%20%5Cboldsymbol%7Bn%20%7C%202%20%5Cleq%20n%20%5Cleq%2099%7D&quot; alt=&quot;&quot; /&gt;.&lt;/li&gt;&#xA;&lt;li&gt;To make the model assume &lt;code&gt;ts&lt;/code&gt; is time sucessive and use time as its regressor.&lt;/li&gt;&#xA;&lt;li&gt;You &lt;b&gt;can&lt;/b&gt; assume that &lt;code&gt;ts&lt;/code&gt; is already loaded.&lt;/li&gt;&#xA;&lt;li&gt;You &lt;b&gt;can't&lt;/b&gt; use build-in modeling functions such as &lt;code&gt;lm()&lt;/code&gt; or similars.&lt;/li&gt;&#xA;&lt;li&gt;The input should be in any reasonable format.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;# input&#xA;1,2,3,4,5,6  &#xA;# output                      &#xA;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/lcYpj.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/lcYpj.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#input &#xA;0.244,0.569,1.575,1.965,2.604,3.493,4.084,4.436,5.209,6.110,6.979,7.245,8.229,9.161,10.309&#xA;# output    &#xA;0.971                              &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/sQJo5.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/sQJo5.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Let the shortest code win!&lt;/p&gt;&#xA;" OwnerUserId="45091" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-15T15:56:42.993" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7199" PostTypeId="2" ParentId="6918" CreationDate="2015-10-15T14:34:03.440" Score="9" Body="&lt;h1&gt;Snails&lt;/h1&gt;&#xA;&lt;p&gt;I created Snails in March 2015 &lt;a href=&quot;https://codegolf.stackexchange.com/a/47495/30688&quot;&gt;for the &amp;quot;Language Design: 2-D Pattern Matching&amp;quot; question&lt;/a&gt;. It is also known as PMA (Planar Mollusk Automaton). &lt;a href=&quot;https://github.com/feresum/PMA&quot; rel=&quot;nofollow noreferrer&quot;&gt;Source code (C++)&lt;/a&gt; and &lt;a href=&quot;https://github.com/feresum/PMA/blob/master/doc.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;documentation&lt;/a&gt; are found on GitHub.&lt;/p&gt;&#xA;&lt;p&gt;As you may have guessed, the input is treated as a 2-dimensional grid of characters. The name comes from the image of a snail moving over the grid and executing commands. The snail leaves &amp;quot;slime trails&amp;quot;, which cannot be crossed later in the program. The execution flow is controlled by backtracking, as in a regex.&lt;/p&gt;&#xA;&lt;p&gt;Its flexibility in solving different challenges is currently limited, as the only possible output is a single nonnegative integer. Nevertheless, several suitable code golf challenges have appeared since the language's creation; if it is possible to solve a challenge with 2D input in Snails, it is usually the shortest language. The &lt;em&gt;shortest&lt;/em&gt; solution often has factorial complexity, making the name &lt;strong&gt;Snails&lt;/strong&gt; doubly appropriate.&lt;/p&gt;&#xA;" OwnerUserId="30688" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-15T14:34:03.440" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7201" PostTypeId="1" CreationDate="2015-10-15T17:22:45.530" Score="4" ViewCount="167" Body="&lt;p&gt;Earlier this summer there was a grape in the vine saying this site was going to graduate this Fall and it dawned on me now. What does that even mean? I've read the reputation requirements for some privileges go up and we aren't evaluated monthly on our performance on Area 51 anymore. The beta sign goes away, but what else is there that happens upon graduation? Someone makes a code challenge asking you to print out &quot;Happy Graduation Day Programming Puzzles &amp;amp; Code Golf!&quot;?&lt;/p&gt;&#xA;" OwnerUserId="30353" LastActivityDate="2015-10-15T17:22:45.530" Title="What happens when this SE site graduates?" Tags="|discussion|" AnswerCount="0" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7205" PostTypeId="1" AcceptedAnswerId="7206" CreationDate="2015-10-16T23:47:47.323" Score="25" ViewCount="1063" Body="&lt;p&gt;Suppose there's a challenge which can be solved completely by a builtin function, and functions are allowed. Note that as of writing the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1078/21487&quot;&gt;standard loophole for builtins&lt;/a&gt; is heavily disputed, but let's just assume that the poster explicitly allowed builtins since that's not the point of this question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Which of the following submissions would be valid? To give a more concrete example, let's say the task was adding a list of numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;                   0 bytes, since the user can use the function already&#xA;sum                3 bytes, an expression which evaluations to a function&#xA;s=sum              5 bytes, aliasing the builtin&#xA;lambda L:sum(L)    15 bytes, an explicit unnamed function&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Similarly, if the task was to multiply two numbers, would the following be valid? Or rather, is it possible that the following is only valid in languages which treat operators in a certain way?&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;*                  1 byte, multiplication operator&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(For context, this question was inspired by the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/60901/calculate-standard-deviation&quot;&gt;Calculate Standard Deviation&lt;/a&gt; question)&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="21487" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2016-04-25T21:05:49.000" Title="On scoring builtin functions" Tags="|discussion|policy|answers|" AnswerCount="3" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="7206" PostTypeId="2" ParentId="7205" CreationDate="2015-10-17T00:15:58.543" Score="18" Body="&lt;p&gt;Code that purports to define a function should only be accepted if it actually causes the function to be defined. That is, the function should not be defined before/without that code running. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Accordingly, the empty string is not a valid function answer. &lt;code&gt;s=sum&lt;/code&gt; is valid because it defines a function &lt;code&gt;s&lt;/code&gt; that did not exist before. &lt;code&gt;sum&lt;/code&gt; and &lt;code&gt;lambda L:sum(L)&lt;/code&gt; are valid because expressions that evaluate to a function are an accepted answer form. However, an unnamed expression may only be used if the entire answer is the expression; it may not be part of a larger program. &lt;code&gt;*&lt;/code&gt; is not a valid answer in Python because it is neither an expression nor any other kind of executable code.&lt;/p&gt;&#xA;" OwnerUserId="30688" LastEditorUserId="30688" LastEditDate="2016-04-24T21:07:15.937" LastActivityDate="2016-04-24T21:07:15.937" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7207" PostTypeId="2" ParentId="7205" CreationDate="2015-10-17T00:24:07.773" Score="-7" Body="&lt;p&gt;For challenges that accept functions as answers, a submission should be valid if after being run, there exists a function that does exactly as the challenge asks.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thus, the zero byte submission is valid, if the builtin function accepts input in a way that perfectly conforms to the challenge specifications; if it is even slightly different (such as taking extra parameters), then the zero byte submission is invalid.&lt;/p&gt;&#xA;" OwnerUserId="29611" LastActivityDate="2015-10-17T00:24:07.773" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7210" PostTypeId="2" ParentId="2140" CreationDate="2015-10-18T00:21:53.970" Score="1" Body="&lt;h1&gt;Cops and Robbers: Text Transformations&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h3&gt;Cops' challenge&lt;/h3&gt;&#xA;&lt;p&gt;The cops must write a fully deterministic program that reads input from STDIN and writes output to STDOUT as its only side effects. The mapping from strings to strings performed by this program will be called &lt;em&gt;f&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;A cop's post consists of such a program's source code, along with its length and the name of the language the program is written in. The poster must also prepare a possible &lt;em&gt;crack&lt;/em&gt; (see below), and release it when their post is &lt;em&gt;safe&lt;/em&gt;. A cop's post is &lt;em&gt;safe&lt;/em&gt; when it remains uncracked for exactly two weeks.&lt;/p&gt;&#xA;&lt;p&gt;A safe post where the original code is &lt;em&gt;n&lt;/em&gt; bytes long is worth 1/&lt;em&gt;n&lt;/em&gt;² points. The author with the highest point total wins. The tiebreaker is popularity (sum of votes of answers in the robbers' thread.)&lt;/p&gt;&#xA;&lt;p&gt;A single author may not use the same language twice in two different cop answers.&lt;/p&gt;&#xA;&lt;h3&gt;Robbers' challenge&lt;/h3&gt;&#xA;&lt;p&gt;To &lt;em&gt;crack&lt;/em&gt; a cop's post, a robber must figure out which transformation &lt;em&gt;f&lt;/em&gt; the program in the post is performing, and write a program &lt;em&gt;P&lt;/em&gt; in the language used by the cop, so that both &lt;em&gt;P&lt;/em&gt; and &lt;em&gt;f&lt;/em&gt;(&lt;em&gt;P&lt;/em&gt;) perform the transformation &lt;em&gt;f&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The length, method, or complexity of &lt;em&gt;P&lt;/em&gt; are irrelevant; as long as is produces the same output as the cop's original code for any input you pass it, the solution is valid.&lt;/p&gt;&#xA;&lt;p&gt;Successfully cracking a cop's post is worth one point. The author with the highest point total wins. The tiebreaker is popularity (sum of votes of answers in the robbers' thread.)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This is a bit hard to conceptualize, so here's a very simple example.&lt;/p&gt;&#xA;&lt;p&gt;If the cop's post is:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;Python 3, 20 bytes&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;print(input()[::-2])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;(i.e., reverse STDIN and remove every other character) The robber's answer might be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;print(input()[::-2])# ) ] 2 - : : [ ) ( t u p n i ( t n i r p&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;as passing this program as input to itself yields a new program that does the same thing:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;print(input()[::-2])#]-:)tpitip&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;As another example, if a cop writes a C++ program that rotates lines on STDIN by 90 degrees, a valid solution is a C++ program that also rotates lines by 90 degrees, &lt;em&gt;and does the very same thing if you rotate it by 90 degrees&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;The difficulty for cops&lt;/strong&gt; is to come up with transformations that are short to express, but difficult to code around (and, of course, they essentially have to crack their own post -- but at least they know &lt;em&gt;f&lt;/em&gt; in advance.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;The difficulty for robbers&lt;/strong&gt; is to decipher the cops' solutions to find out which transformation &lt;em&gt;f&lt;/em&gt; they're performing, and then write any program &lt;em&gt;P&lt;/em&gt; such that both &lt;em&gt;P&lt;/em&gt; and &lt;em&gt;f(P)&lt;/em&gt; perform &lt;em&gt;f&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="3852" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-18T00:21:53.970" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7212" PostTypeId="2" ParentId="1061" CreationDate="2015-10-18T07:41:16.867" Score="94" Body="&lt;h1&gt;Using a non-free language on a Cops and Robbers challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Most (currently all) cops and robbers challenges consist of two parts:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A cop submission, where a user posts some secret property of a program, such as its output, a scrambled version of the code, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then, other users, the robbers, try to deduce the original program, or another program with the same properties.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An important implicit condition of such a challenge is that it is possible for the robbers to try out many variants of the code to find the true solution. While a cop submission where this is impossible would ostensibly do well, it is not in the spirit of the challenge, and is in fact a loophole.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, pay-for-use languages are banned from competition in CnR challenges as a loophole.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some popular languages which are thus banned are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Matlab&lt;/li&gt;&#xA;&lt;li&gt;STATA&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;However, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11726/8478&quot;&gt;&lt;strong&gt;non-free languages may still be submitted as non-competitive entries&lt;/strong&gt;&lt;/a&gt; so as not to exclude potentially interesting cops from being posted altogether. If these are cracked, the crack should also be marked as non-competitive.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2017-03-13T10:13:53.687" CommentCount="16" CommunityOwnedDate="2015-10-18T07:41:16.867" ContentLicense="CC BY-SA 3.0" />
  <row Id="7218" PostTypeId="1" AcceptedAnswerId="7220" CreationDate="2015-10-18T15:55:01.570" Score="15" ViewCount="407" Body="&lt;p&gt;We &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4867/can-i-ever-answer-with-a-language-invented-after-the-challenge-was-posted&quot;&gt;have rules&lt;/a&gt; about answering challenges with a language that was invented after the challenge was posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can I invent a language to easily solve a challenge that's currently in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt; and then answer with that language once the challenge has been posted?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I doubt this has happened for a whole language but I'd be willing to bet that updates have been made to languages based on bugs found in Sandboxed challenge attempts.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2015-10-19T04:47:25.050" Title="Can I invent a language to solve a problem that's in the Sandbox?" Tags="|discussion|answers|sandbox|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7219" PostTypeId="2" ParentId="2140" CreationDate="2015-10-18T16:31:23.513" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Objective&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a string in Markdown, determine how much of the string is in bold and italic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test Cases&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;**Bold** --&amp;gt; 0&#xA;*Italic* --&amp;gt; 0&#xA;**_BI_** --&amp;gt; 2&#xA;__*abcde*__ --&amp;gt; 5&#xA;This is in **bold and _this_ is in italic** --&amp;gt; 4&#xA;\**_BI_** --&amp;gt; 0&#xA;\\**_BI_** --&amp;gt; 2&#xA;This is not in ___ bold-italic ___ --&amp;gt; 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="21682" LastActivityDate="2015-10-18T16:31:23.513" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7220" PostTypeId="2" ParentId="7218" CreationDate="2015-10-18T17:37:03.130" Score="38" Body="&lt;h1&gt;No.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is similar to updating the language after the actual question has been posted. It's simply no different.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To circumvent this loophole, maybe question askers should put the date at which it was posted in the sandbox and say that programming languages must not have features relevant to the question past the aforementioned date.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastActivityDate="2015-10-18T17:37:03.130" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7221" PostTypeId="2" ParentId="6918" CreationDate="2015-10-19T03:10:10.110" Score="10" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/VTCAKAVSMoACE/Vitsy/tree/master&quot; rel=&quot;nofollow noreferrer&quot;&gt;Vitsy&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h3&gt;Created by me, VTCAKAVSMoACE&lt;/h3&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;When I have a child, I will name them Vitsy, and they shall appreciate their namesake.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://esolangs.org/wiki/Vitsy&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolangs Page&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Vitsy is a forced 1D language (meaning any code put on other lines is ignored*) that uses an instruction pointer to transverse code (similar to &amp;gt;&amp;lt;&amp;gt;). It is stack-based and very much in progress. It was released... well, today, 18th of October 2015. It does not yet have much functionality, but it is being worked on (albeit slowly).&lt;/p&gt;&#xA;&lt;p&gt;*NOTE: As of the latest version, Vitsy now supports static methods as accessed by line number. See README for details.&lt;/p&gt;&#xA;&lt;p&gt;*SECOND NOTE: As of the now latest version, Vitsy now supports separate &amp;quot;classes&amp;quot;, where you can extend or use other &lt;a href=&quot;https://github.com/VTCAKAVSMoACE/Vitsy&quot; rel=&quot;nofollow noreferrer&quot;&gt;Vitsy&lt;/a&gt; programs in accessible directories (provided a relative directory path).&lt;/p&gt;&#xA;&lt;p&gt;*THIRD NOTE: Vitsy now has shell access and prompting functionality.&lt;/p&gt;&#xA;&lt;p&gt;*MOAR NOTES: Vitsy now has file I/O and JS eval.&lt;/p&gt;&#xA;&lt;p&gt;It originates from inspiration through Brainfuck, Befunge, and &amp;gt;&amp;lt;&amp;gt;, and a chat conversation relating to &lt;em&gt;n&lt;/em&gt; dimensional languages.&lt;/p&gt;&#xA;&lt;p&gt;It is named after a common misappropriation of the first three characters of my name into a pronounced word (ViT-C).&lt;/p&gt;&#xA;&lt;p&gt;Documentation is fairly limited as of now, but more, clearer documentation will be created soon.&lt;/p&gt;&#xA;&lt;p&gt;It is currently hosted on Github and I've been working on improving it literally every day of its existence so far.&lt;/p&gt;&#xA;&lt;h2&gt;Code Examples&lt;/h2&gt;&#xA;&lt;h3&gt;Standard Quine&lt;/h3&gt;&#xA;&lt;pre&gt;&#xA;'rd3*Z&#xA;'           Start recording as a string.&#xA;&#xA;(wraps around once, capturing all the items)&#xA;&#xA;'           Stop recording as a string. We now have everything recorded but the original &quot;.&#xA; r          Reverse the stack&#xA;  b3*       This equates the number 39 = 13*3 (in ASCII, ')&#xA;     Z      Push the entire stack to STDOUT.&#xA;&#xA;Output:&#xA;&#xA;'rd3*Z&#xA;&lt;/pre&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-10T02:19:37.380" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7222" PostTypeId="2" ParentId="7218" CreationDate="2015-10-19T04:47:25.050" Score="0" Body="&lt;h1&gt;Yes, provided that it's general purpose and doesn't win.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Fixes for &lt;em&gt;unintended behavior in an existing language&lt;/em&gt; past a sandbox post date are obviously OK, to address the point about bugs in the OP.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For languages &lt;em&gt;entirely created&lt;/em&gt; after a sandbox post date, it depends on two things:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The language must be &lt;strong&gt;general purpose&lt;/strong&gt;. That means, you should be able to use it to solve a wide range of other code challenges competitively (what I mean is that it &lt;em&gt;should not be optimized for a single challenge&lt;/em&gt;). In most cases, it should also be Turing-complete. Ideally, the language should be specifically for a single tag (eg, a language with lots of string builtins for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Your submission in that language &lt;strong&gt;must not win&lt;/strong&gt;. Otherwise, it's just unfair for the other challenge participants. If the implementation in your language happens to get the highest score for the challenge, don't post it and just wait for the next challenge within the language's scope. (Note that you should not intentionally leave your implementation ungolfed to submit it without winning. That defeats the purpose of this point.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The original reason for the standard loophole is to prevent the case of &quot;I invented a language XYZ that does this task in 0 bytes,&quot; and to be fair to others. As long as your language doesn't violate those things, I think it's fine.&lt;/p&gt;&#xA;" OwnerUserId="20666" LastActivityDate="2015-10-19T04:47:25.050" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7224" PostTypeId="1" AcceptedAnswerId="7686" CreationDate="2015-10-19T13:39:25.960" Score="21" ViewCount="910" Body="&lt;p&gt;&lt;a href=&quot;http://rosettacode.org/wiki/Rosetta_Code&quot; rel=&quot;nofollow noreferrer&quot;&gt;Rosetta Code&lt;/a&gt; collects solutions to standard programming exercises in hundreds of programming languages. However, it focuses on &quot;good&quot; or idiomatic solutions in those languages. I'm not aware of a similar catalogue from a golfing perspective. Is PPCG capable of fulfilling that role? Do we have challenges for standard programming exercises, where the answers can act as a catalogue of the &lt;em&gt;shortest possible&lt;/em&gt; solution in each language? I know &lt;a href=&quot;http://golf.shinh.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;Anarchy Golf&lt;/a&gt; contains leaderboards for all the languages it supports, but the solutions aren't disclosed.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Long story short, of course I know we do. However, we &lt;a href=&quot;https://codegolf.stackexchange.com/q/55422/8478&quot;&gt;only recently started&lt;/a&gt; emphasising the catalogue nature of challenges corresponding to simple (and common) tasks. There are many more such tasks which&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Have never been asked on PPCG without any fancy extras like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; before.&lt;/li&gt;&#xA;&lt;li&gt;Have been asked before, but where the challenge is not particularly well-specified and could use an overhaul.&lt;/li&gt;&#xA;&lt;li&gt;Have been asked before, but could use some love to include the leaderboard to generate the actual catalogue more easily.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This post (with its answers) is an effort to organise existing and upcoming catalogues a bit. We have talked about this &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;in chat&lt;/a&gt; a few times, and the general consensus seems to be that a) these challenges need extra care if they are supposed to be good references and b) they shouldn't be posted too often, e.g. not more than one every other week, because they take a lot of effort from the community to be filled with a large number of answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;em&gt;not&lt;/em&gt; supposed to be a sandbox for catalogue-type challenges. This is rather intended to compile an overview of what has been done and what is still left to do. Whenever we pick a particular challenge from the list, it should still be fleshed out in the normal &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/8478&quot;&gt;sandbox&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2016-05-20T13:11:51.610" Title="Does PPCG fulfil a role as a catalogue for golfed solution of standard programming exercises?" Tags="|discussion|code-golf|" AnswerCount="3" CommentCount="10" CommunityOwnedDate="2015-10-19T13:39:25.960" ContentLicense="CC BY-SA 3.0" />
  <row Id="7225" PostTypeId="2" ParentId="7224" CreationDate="2015-10-19T13:39:25.960" Score="13" Body="&lt;h2&gt;Existing Catalogue Challenges&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This post lists all the challenges which already act as a catalogue. Currently these are only the few which have explicitly been posted with that goal in mind. Requirements for being added to this list include that the task should be a common programming exercise, the challenge post includes a Stack Snippet to generate a leaderboard and the answers should cover at least 50 languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In chronological order:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/55422/8478&quot;&gt;&amp;quot;Hello, World!&amp;quot;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/57617/8478&quot;&gt;Is this number a prime?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/58615/8478&quot;&gt;1, 2, Fizz, 4, Buzz&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/59347/8478&quot;&gt;Shortest infinite loop producing no output&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/62230/8478&quot;&gt;Simple cat program&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/62732/45151&quot;&gt;Implement a Truth-Machine&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/65020/output-the-current-time&quot;&gt;Output the Current Time&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(I am intending to amend this answer with a Stack Snippet which generates some data across&lt;/em&gt; all &lt;em&gt;catalogues, including their relative completeness and a table listing the shortest solution per language in each challenge.)&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-05-19T01:14:40.430" CommentCount="1" CommunityOwnedDate="2015-10-19T13:39:25.960" ContentLicense="CC BY-SA 3.0" />
  <row Id="7226" PostTypeId="2" ParentId="7224" CreationDate="2015-10-19T13:40:41.403" Score="10" Body="&lt;h2&gt;Future Catalogue Challenges&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This post collects ideas for future catalogue challenges. Some of these tasks already have challenges, some of which may be editable into a catalogue while others may not.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Existing challenges that could be catalogues&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;In these cases, the OP's should be asked whether they are okay with some thorough editing to the challenge (which shouldn't invalidate any serious answer). Then the format of the spec could be adjusted to make it more similar to the other catalogues, a leaderboard would be added, and the headers of the answers adjusted.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/85/8478&quot;&gt;Fibonacci.&lt;/a&gt; (From day 1!) Looks quite good. &lt;em&gt;Chris gave his permission to edit the challenge, so this one is about to be turned into a catalogue.&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242/reverse-stdin-and-place-on-stdout&quot;&gt;Reverse STDIN.&lt;/a&gt; Looks quite good.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/607/8478&quot;&gt;Factorial.&lt;/a&gt; Looks quite good.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/69/8478&quot;&gt;Quine.&lt;/a&gt; This actually already acts as the best quine catalogue I know. In principle it should be fairly easy to turn this into a decent catalogue with a leaderboard snippet, but the tricky thing here is sorting out &lt;em&gt;what we actually consider to be a proper quine&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/13152/8478&quot;&gt;Shortest code producing infinite output.&lt;/a&gt; As the pendant to &quot;Shortest infinite loop producing no output&quot;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Existing challenges that could be redone as catalogues&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/320/8478&quot;&gt;Binary search.&lt;/a&gt; The challenge is wrapped in a very specific context that doesn't lend itself well to a generic binary search challenge.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/51402/8478&quot;&gt;Levenshtein distance.&lt;/a&gt; A challenge that doesn't ask for the intermediate outputs might be more useful as a catalogue and more golfable.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/3434/8478&quot;&gt;Game of Life.&lt;/a&gt; Despite the look of it, this is not a plain code golf, but rather a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; in disguise.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/11155/8478&quot;&gt;Palindrome checker.&lt;/a&gt; The challenge isn't bad but it contains a lot of very specific rules which go against the defaults we're using today. As a catalogue challenge one could also simplify the specification and make all characters in the string count (instead of ignoring everything except letters).&lt;/li&gt;&#xA;&lt;li&gt;...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;New challenges&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A plain array sorting challenge. We've had challenges for a few specific algorithms and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/12824/sorting-a-list-of-strings-without-using-any-built-in-sort-method&quot;&gt;one for sorting strings&lt;/a&gt;, but I can't find anything about &quot;sort an array of integers&quot;. I also wonder if it might be better to collect different sorting algorithms separately.&lt;/li&gt;&#xA;&lt;li&gt;99 Bottles of Beer. We've had two &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;s but no code golf.&lt;/li&gt;&#xA;&lt;li&gt;...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-10-31T23:47:49.407" CommentCount="3" CommunityOwnedDate="2015-10-19T13:40:41.403" ContentLicense="CC BY-SA 3.0" />
  <row Id="7228" PostTypeId="2" ParentId="2140" CreationDate="2015-10-20T02:26:45.720" Score="1" Body="&lt;h1&gt;Watermelon Contest&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You and your buddies are contesting a lone piece of watermelon left in the middle of the table. You decide to make a program to contest for you.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Goal&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You want to be the &lt;strong&gt;last program standing&lt;/strong&gt;. Then you get the watermelon.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Process&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Every iteration 1 program will be eliminated from the watermelon contest. This will be decided by a &lt;strong&gt;vote among all the remaining programs&lt;/strong&gt;. This means that your program will have 1 and only 1 vote to spend on the elimination of another program. Whichever program ends up with the most votes is eliminated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This continues until there are only 1 program left, the winner. This entire process is considered a &quot;round&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After there is a winner, another round will be started with a new piece of watermelon. All programs will be re-entered. When &lt;code&gt;10,000&lt;/code&gt; rounds have been completed, the program with the most &quot;wins&quot; will be considered the &quot;grand champion&quot;. All the rounds combined is considered the &quot;tournament&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Catch&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Every program will have an &lt;strong&gt;opportunity to send a message&lt;/strong&gt; to all the other programs. The message must be the same for every program. The message is a string, up to 500 bytes long.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may have a file in which you may store any data you wish from previous rounds. This will persist over the entire tournament.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Program&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Write a program or function&lt;/strong&gt; that accepts the following input in any (convenient) form:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[program-name], [message], &quot;The Slug&quot;, &quot;hey! don't vote for me!&quot;, &quot;Chucknorium II&quot;, &quot;a2TEI5ds#&quot; ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and outputs the name of the program that you vote for:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Chucknorium II&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In the likely event of a tie, one of the high scoring programs will be randomly eliminated &lt;/li&gt;&#xA;&lt;li&gt;Messages can be anything that doesn't mess with stuff it's not supposed to (e.g. don't mess with the controller or other people's programs). This is what makes the challenge interesting.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;You may not hard-code program names into your program!&lt;/strong&gt; In other words, numbering the programs randomly at the beginning of the game should produce the same output. Names are just more fun.&lt;/li&gt;&#xA;&lt;li&gt;For observation purposes, your program will still be run even if it has been eliminated. It will not, however, have a chance to vote that round.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="29820" LastEditorUserId="29820" LastEditDate="2015-10-20T20:27:17.827" LastActivityDate="2015-10-20T20:27:17.827" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="7230" PostTypeId="1" AcceptedAnswerId="7232" CreationDate="2015-10-20T08:38:10.367" Score="13" ViewCount="1166" Body="&lt;p&gt;Here's have an idea, which may save &lt;strike&gt;millions of&lt;/strike&gt; bytes to golfers out there. But I'm not sure it's good.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Take a language that's good for Golfing (e.g. Pyth).&lt;/li&gt;&#xA;&lt;li&gt;Take all existing CodeGolf answers in this language, and build a character frequency table.&lt;/li&gt;&#xA;&lt;li&gt;Build a Huffman tree based on this table.&lt;/li&gt;&#xA;&lt;li&gt;Create a new language, which is basically the same, except that the interpreter starts by Huffman-decoding the program, using this fixed tree.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Issues:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Does it have a real saving potential? Intuitively I'd say that for 10 char programs it should save a byte or two. &lt;/li&gt;&#xA;&lt;li&gt;Is it nice to create a language that's 99% based on an existing language?&lt;/li&gt;&#xA;&lt;li&gt;Should we use 7-bit only?&lt;/li&gt;&#xA;&lt;li&gt;How will it affect the site? Won't answers in the new language be (even less) interesting than answers in the one it's based on?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Anyway, I'm too lazy to actually implement it. So if anyone wants to, feel free.&lt;/p&gt;&#xA;" OwnerUserId="3544" LastActivityDate="2015-10-26T17:13:58.897" Title="Huffman Encoded Golfing Language" Tags="|discussion|code-golf|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7231" PostTypeId="2" ParentId="7230" CreationDate="2015-10-20T09:59:58.990" Score="3" Body="&lt;p&gt;The general rule is that what we count is the length of the source code, where that is understood as the file/string which the programmer edits. Your proposed language would really be an intermediate bytecode which no-one would ever edit directly, and so it would be irrelevant from the point of view of scoring answers on PPCG.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2015-10-20T09:59:58.990" CommentCount="16" ContentLicense="CC BY-SA 3.0" />
  <row Id="7232" PostTypeId="2" ParentId="7230" CreationDate="2015-10-20T12:58:33.563" Score="13" Body="&lt;p&gt;You can do it if you want, but don't expect it to be well received as a golfing language. The language would be valid, but uninteresting, and won't be usually compared with the original language just like nobody would compare Python and Pyth.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But as long as it is valid, I think someone have to do it at least once in the history, to see how uninteresting it exactly is. And that may inspire other useful ideas.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are many golfy esolangs that are rarely used by golfers. It's not bad to just invent a new one, just like the first person who wanted to invent a golfing languages when all other existing languages are used for serious programming. (Or maybe you want to invent a codepage instead, to allow better presentation.)&lt;/p&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2015-10-20T12:58:33.563" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7237" PostTypeId="2" ParentId="2140" CreationDate="2015-10-21T04:45:02.773" Score="1" Body="&lt;h1&gt;An Assortment of Sorting&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Sorting_algorithm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sorting an array of integers&lt;/a&gt; in ascending order is one of the most fundamental tasks in programming. Indeed, there are many algorithms which exist to accomplish this. While it may not be the most interesting challenge, particularly for &quot;usual&quot; languages, it can be nontrivial in many languages. So let's sort some integers!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rosetta code features lists by &lt;a href=&quot;http://rosettacode.org/wiki/Category:Sorting_Algorithms&quot; rel=&quot;nofollow noreferrer&quot;&gt;sorting algorithm and language&lt;/a&gt; of idiomatic approaches to array sorting. However, &quot;most idiomatic&quot; often does not coincide with &quot;shortest.&quot; In an effort to make Programming Puzzles and Code Golf the go-to site for code golf, this challenge seeks to compile a catalog of the shortest approach in every language, similar to &lt;a href=&quot;https://codegolf.stackexchange.com/q/55422/20469&quot;&gt;&amp;quot;Hello, World!&amp;quot;&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/57617/is-this-number-a-prime&quot;&gt;Is this number a prime?&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/q/69/20469&quot;&gt;Golf you a quine for great good!&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Task&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write a &lt;strong&gt;full program&lt;/strong&gt; that, when given an array of strictly positive integers, will print the ascending sorted version of the input array using &lt;strong&gt;one particular algorithm&lt;/strong&gt; that is guaranteed to terminate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The sorting algorithm used must be specified in the post. Note that &lt;a href=&quot;https://en.wikipedia.org/wiki/Bogosort&quot; rel=&quot;nofollow noreferrer&quot;&gt;bogosort&lt;/a&gt; is not allowed as it is not guaranteed to terminate.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;To ensure that the focus of submissions is on the mechanics of the algorithm rather than parsing input, a variable (with a name of your choosing) must be hard-coded in the program. However, the hard-coded value must be easily exchangeable; it may appear in only a single place in the entire program. For scoring purposes, submit the program that corresponds to the one-element array &lt;strong&gt;1&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The elements of the array may be in their decimal representations, unary representations (using a character of your choice), as byte arrays (big or little endian), or as single bytes (if this is your languages largest data type).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All elements of the array can be assumed to be in the range 1 to 255, inclusive. Your program must be able to handle an array of any size from 1 to 255, inclusive.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Output has to be written to STDOUT or closest alternative.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If possible, the output should consist solely of the sorted array with an optional trailing newline. The only exception to this rule is constant output of your language's interpreter that cannot be suppressed, such as a greeting, ANSI color codes or indentation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output array can be formatted in any reasonable way. For example, &lt;code&gt;[3,2,1]&lt;/code&gt; and &lt;code&gt;3 2 1&lt;/code&gt; would both be fine.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Additional Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;There should be only one language and algorithm combination per answer. Please submit separate algorithms in the same language or separate languages with the same algorithm as separate posts.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;All submissions are required to feature some kind of explanation of the code.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Unless entirely unpreventable in your language, nothing should be output to STDERR.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is not about finding the language with the shortest approach for sorting, this is about finding the shortest approach in every language. Therefore, no answer will be marked as accepted.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Submissions in most languages will be scored in &lt;em&gt;bytes&lt;/em&gt; in an appropriate preexisting encoding, usually (but not necessarily) UTF-8.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The language &lt;a href=&quot;http://www.dangermouse.net/esoteric/piet.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Piet&lt;/a&gt;, for example, will be scored in codels, which is the natural choice for this language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some languages, like &lt;a href=&quot;http://esolangs.org/wiki/Folders&quot; rel=&quot;nofollow noreferrer&quot;&gt;Folders&lt;/a&gt;, are a bit tricky to score. If in doubt, please ask on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/&quot;&gt;Meta&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Unlike our usual rules, feel free to use a language (or language version) even if it's newer than this challenge. If anyone wants to abuse this by creating a language where the empty program sorts an array, then congratulations for paving the way for a very boring answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that there must be an interpreter so the submission can be tested. It is allowed (and even encouraged) to write this interpreter yourself for a previously unimplemented language.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If your language of choice is a trivial variant of another (potentially more popular) language which already has an answer (think BASIC or SQL dialects, Unix shells or trivial Brainfuck derivatives like Headsecks or Unary), consider adding a note to the existing answer that the same or a very similar solution is also the shortest in the other language.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Built-in functions for sorting with a particular algorithm &lt;strong&gt;are&lt;/strong&gt; allowed. This challenge is meant to catalog the shortest possible solution in each language, so if it's shorter to use a built-in in your language, go for it. However, you must provide a link that proves that the built-in uses whichever algorithm you claim.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The input cannot be assumed to already be sorted.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Unless they have been overruled earlier, all standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply, including the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061&quot;&gt;Loopholes that are forbidden by default&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;As a side note, please don't downvote boring (but valid) answers in languages where there is not much to golf; these are still useful to this question as it tries to compile a catalog as complete as possible. However, do primarily upvote answers in languages where the author actually had to put effort into golfing the code.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Catalog&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The Stack Snippet at the bottom of this post generates the catalog from the answers as a list of the shortest solutions per language and algorithm, as well as an overall leaderboard.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To make sure that your answer shows up, please start your answer with a headline, using the following Markdown template:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# Language, Algorithm, N bytes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;N&lt;/code&gt; is the size in bytes of your submission. If you improve your score, you can keep old scores in the headline by striking them through. For instance:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# Ruby, Bubble Sort, &amp;lt;s&amp;gt;101&amp;lt;/s&amp;gt; &amp;lt;s&amp;gt;96&amp;lt;/s&amp;gt; 90 bytes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If you want to include multiple numbers in your header (e.g. because your score is the sum of two files or you want to list interpreter flag penalties separately), make sure that the actual score is the last number in the header:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# Perl, Insertion Sort, 43 + 2 (-p flag) = 45 bytes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You can also make the language name a link which will then show up in the snippet:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# [&amp;gt;&amp;lt;&amp;gt;](http://esolangs.org/wiki/Fish), Heapsort, 121 bytes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Insert a super awesome snippet here&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot;&gt;sorting&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Meta questions:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Should this be restricted to specific set of sorting algorithms or is it okay to allow any deterministic algorithm?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is the title okay? The catalog challenges tend to have straightforward, descriptive, searchable titles (with the notable exception of &lt;a href=&quot;https://codegolf.stackexchange.com/q/69/20469&quot;&gt;Golf you a quine for great good!&lt;/a&gt;). I figured this title is clear enough while still being interesting, but perhaps it's better to opt for something more straightforward.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;At Peter's suggestion I've modified the input method. Arrays are now to be hard-code rather than being taken as input. This eliminates the need for parsing input. If I were to allow a variable to already exist, submissions would be snippets rather than full programs, which I don't want for this.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is the closed interval [1, 255] appropriate for bounds on the integer values in the array as well as the length of the array? Is it better to make the array an arbitrary size?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:21.580" LastActivityDate="2015-10-21T20:37:35.520" CommentCount="16" ContentLicense="CC BY-SA 3.0" />
  <row Id="7243" PostTypeId="1" AcceptedAnswerId="7246" CreationDate="2015-10-21T23:10:40.087" Score="15" ViewCount="712" Body="&lt;p&gt;(This might be a duplicate of another question but all of its answers were vague nonanswers, and I can't find it again, so here goes...)&#xA;&lt;br&gt;&lt;br&gt;&#xA;I like python3 and I'm quite good at it; it's rather verbose so when I make long scripts I have a tool script I import that contains lots of shortenings and predefinitions. As long as I don't answer existing questions with it, and as long as I make it freely available (on git?), can I do this and only have the &lt;code&gt;from g import*&lt;/code&gt; counted towards my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; score? or would I be implored to include the bytes of library just cause I wrote it? &lt;br&gt;&lt;br&gt; It almost feels boring but to say it is, is to call Golfscript and Pyth boring and uninteresting, with which I disagree.&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="46231" LastEditDate="2015-10-21T23:23:21.077" LastActivityDate="2017-07-07T17:05:23.457" Title="Can I write a golfing library?" Tags="|discussion|rules|" AnswerCount="4" CommentCount="12" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7244" PostTypeId="2" ParentId="7243" CreationDate="2015-10-21T23:44:48.110" Score="11" Body="&lt;h1&gt;Yes. But:&lt;/h1&gt;&#xA;&lt;p&gt;According to what I see from the comments and previous relevant questions, the consensus is that you &lt;em&gt;may&lt;/em&gt;, however, you must do the following things:&lt;/p&gt;&#xA;&lt;h3&gt;- Define it as &lt;em&gt;not&lt;/em&gt; a clean copy.&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This means declaring it as &amp;quot;&amp;lt;Original Language&amp;gt; + &amp;lt;Library Name (with link)&amp;gt;&amp;quot;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;- Provide a link to the library.&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is common sense.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;- Explain &lt;em&gt;thouroughly&lt;/em&gt;&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Also common sense - if you show up with a library no one has ever seen, nobody's going to know what it actually &lt;em&gt;does&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;- The Library &lt;em&gt;cannot&lt;/em&gt; be updated after the question exists!&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is a general loophole, and must be abided to.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-22T00:12:17.673" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="7245" PostTypeId="2" ParentId="7243" CreationDate="2015-10-21T23:59:51.877" Score="5" Body="&lt;h1&gt;Yes, but make a language not a library&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Writing a library might be acceptable but we definitely allow the creation of custom languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To achieve &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7243/can-i-write-a-golfing-library#comment18510_7243&quot;&gt;your goal&lt;/a&gt; you could make up a language called &quot;Mython&quot; (or whatever you want to call it) and write this compiler for it:&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;p = print&#xA;q = input&#xA;def runMython(code):&#xA;    exec(code)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So if you wanted to run the Mython code&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x = &quot;dog&quot;&#xA;p(q() + x)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You could just do&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;runMython(&quot;&quot;&quot;&#xA;x = &quot;dog&quot;&#xA;p(q() + x)&#xA;&quot;&quot;&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is better than a library because you don't even need the import.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As always, languages are (usually) only valid in challenges that were posted after the language was invented.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2015-10-21T23:59:51.877" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7246" PostTypeId="2" ParentId="7243" CreationDate="2015-10-22T00:02:05.663" Score="23" Body="&lt;h2&gt;Yes, and it does not necessarily have to be a separate language.&lt;/h2&gt;&#xA;&lt;p&gt;There's no problem with using your own library as long as it doesn't violate the standard loopholes. In answers where you use it, you should put &amp;quot;Python 3 + &amp;lt;name&amp;gt; library&amp;quot; in the header.&lt;/p&gt;&#xA;&lt;p&gt;If you go for the library route, you do need to count the import in any answers with it.&lt;/p&gt;&#xA;" OwnerUserId="30688" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-22T00:09:29.863" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7248" PostTypeId="1" CreationDate="2015-10-22T02:27:03.010" Score="7" ViewCount="309" Body="&lt;p&gt;Suppose you are answering a code-golf challenge in a language whose interpreter can only use UTF-8. Say you have a program that uses some code points in the range 128-255, but not higher. Would it then be permissible to encode your answer in Latin-1 or some other single-byte encoding?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would argue that only encodings directly usable with the language interpreter should be allowed. Otherwise, one could compress any answer and then claim that it uses a zip encoding.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This question is motivated mainly by answers that use an APL code page. I suspect that not all modern APL interpreters are capable of executing source that uses this encoding (but maybe I'm wrong).&lt;/p&gt;&#xA;" OwnerUserId="30688" LastActivityDate="2015-10-26T19:44:42.430" Title="Should a character encoding that can't actually be used by a compiler/interpreter be allowed?" Tags="|discussion|rules|" AnswerCount="2" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="7249" PostTypeId="2" ParentId="6918" CreationDate="2015-10-22T09:05:41.493" Score="11" Body="&lt;h1&gt;Brachylog&lt;/h1&gt;&#xA;&lt;p&gt;Brachylog is a declarative code golf language created by me, Fatalize, in summer 2015.&lt;/p&gt;&#xA;&lt;p&gt;Brachylog is intended to be a short-handed version of Prolog (of SWI-Prolog, specifically), which allows to chain predicates using implicit variables, implicit unification and implicit logic &lt;code&gt;AND&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://github.com/JCumin/Brachylog&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub Repository&lt;/a&gt;&lt;/strong&gt;, which contains the Prolog transpiler and the Wiki.&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-06-03T11:34:24.777" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7254" PostTypeId="2" ParentId="7070" CreationDate="2015-10-22T20:23:08.427" Score="0" Body="&lt;p&gt;What about changing it depending on how it is tagged (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, etc.)&lt;/p&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2015-10-22T20:23:08.427" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7256" PostTypeId="2" ParentId="7115" CreationDate="2015-10-23T01:46:29.163" Score="3" Body="&lt;h1&gt;&amp;quot;JavaScript&amp;quot; should reflect the current specification&lt;/h1&gt;&#xA;&lt;p&gt;As of June 17th, 2015, version 6 of ECMAScript, which is considered by everyone (as far as I know) to be the &amp;quot;JavaScript&amp;quot; specification, is now the official stable release of the language. Regardless of any specific implementation, this is the closest thing we had to any real definition, and I'd argue, what we should base this decision on. As such, the only times that I can think of that adding a version should matter anywhere is when:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;There is an major loss of backwards compatibility between versions (Python 2/3).&lt;/li&gt;&#xA;&lt;li&gt;Features are not yet solidified and are subject to change or removal (ES7, and formerly ES6).&lt;/li&gt;&#xA;&lt;li&gt;A feature being used is no longer part of the specification (&lt;code&gt;Object.eval()&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;I argue that adding a version should be otherwise optional, and use of the language name &amp;quot;JavaScript&amp;quot; should apply to the &lt;em&gt;current version as of the question post date&lt;/em&gt; (to abide by general Code Golf rules in that regard).&lt;/p&gt;&#xA;&lt;p&gt;JavaScript is a bit of a special case compared to other languages simply because we can't really &amp;quot;choose&amp;quot; a version to use. It's at best really more of a rolling standard with how implementations gradually roll out features (most major browsers still don't support all ES5 features). If &amp;quot;browser support&amp;quot; is really what matters, then we should be labeling as &amp;quot;FireFox 42&amp;quot;/&amp;quot;Chrome 46&amp;quot;/etc instead of &amp;quot;ES6&amp;quot;/&amp;quot;ES7&amp;quot;/etc anyways.&lt;/p&gt;&#xA;" OwnerUserId="30793" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-06T17:44:47.103" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7257" PostTypeId="2" ParentId="2140" CreationDate="2015-10-23T05:12:06.147" Score="0" Body="&lt;h1&gt;Gif - Jif, Jif - Gif&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;The point of this challenge is to (not) settle debate on the pronunciation of &quot;gif&quot;&lt;/sub&gt;&#xA;&lt;a href=&quot;http://38.media.tumblr.com/11bc6092d29c8c6840f9e10184ca03fd/tumblr_mlksz8SLjn1qz4h3co1_1280.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://38.media.tumblr.com/11bc6092d29c8c6840f9e10184ca03fd/tumblr_mlksz8SLjn1qz4h3co1_1280.gif&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The pronunciation of &lt;em&gt;gif&lt;/em&gt; is debated and while it's supposed to be (and should be) pronounced &lt;em&gt;jif&lt;/em&gt;, it's still commonly disputed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge you will be given a set of words that have a &lt;em&gt;g&lt;/em&gt; or &lt;em&gt;j&lt;/em&gt;, representing the sound that the word is pronounced with. You'll also get some text in which you have to fix the incorrect spellings of &lt;em&gt;gif&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because this is the internet and everyone always wrong. It's (not) common courtesy to correct them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://imgs.xkcd.com/comics/duty_calls.png&quot; alt=&quot;Duty Calls&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An example of a wrong pronunciation would be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;There was a &lt;b&gt;gif&lt;/b&gt; of a mouse eating a burrito&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The wrong spelling of &lt;em&gt;gif&lt;/em&gt;? Unacceptable! This must be corrected immediately:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;There was a &lt;b&gt;jif (as in jar)&lt;/b&gt; of a mouse eating a burrito&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Are we done? Nope, you're &lt;em&gt;still&lt;/em&gt; wrong.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://travelsummary.com/wp-content/uploads/2013/03/Im-Right-Youre-Wrong-e1363993322818.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;You&amp;#39;re always wrong http://travelsummary.com/wp-content/uploads/2013/03/Im-Right-Youre-Wrong-e1363993322818.jpg&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This must work the other way:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;In the &lt;b&gt;jif&lt;/b&gt; the cat wore a hat of a cat&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This obvious misspelling must be fixed, we shall correct this to:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;In the &lt;b&gt;gif (as in graphic)&lt;/b&gt; the cat wore a hat of a cat&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may assume all words that contain the letter &lt;em&gt;g&lt;/em&gt; have the hard g sound (as in gravy) and all words that contain the letter &lt;em&gt;j&lt;/em&gt; have the j sound (as in jam)&lt;/li&gt;&#xA;&lt;li&gt;Words will never have both &lt;em&gt;g&lt;/em&gt; and &lt;em&gt;j&lt;/em&gt;&#xA;(Will add more specific rules later)&lt;/li&gt;&#xA;&lt;li&gt;Words must be picked at random each item with the same chance of being picked&lt;/li&gt;&#xA;&lt;li&gt;Words may be supplied through an array or the closest alternative for your language.&lt;/li&gt;&#xA;&lt;li&gt;Case must be preserved E.g. &lt;code&gt;GiF&lt;/code&gt; -&gt; &lt;code&gt;JiF&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You may write a program or a function&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input and output separated by a single line:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;graphic, jar, jam, gram&#xA;I saw a jif of how to pronounce gif that showed gif is pronounced jif&#xA;&#xA;I saw a gif (as in graphic) of how to pronounce jif (as in jar) that showed jif (as in jam) is pronounced gif (as in gram)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;gravy, jeff&#xA;G is for gif, h is for jif, i is for gif, j if for jif&#xA;&#xA;G is for jif (as in jeff), h is for gif (as in gravy), i is for jif (as in jeff), j is for gif (as in gravy)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="40695" LastEditDate="2016-09-27T00:19:32.923" LastActivityDate="2016-09-27T00:19:32.923" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7259" PostTypeId="1" CreationDate="2015-10-23T08:16:08.597" Score="0" ViewCount="41" Body="&lt;p&gt;I noticed that on &lt;code&gt;Google Chrome 46.0.2490.71&lt;/code&gt; on &lt;code&gt;Win 7x64&lt;/code&gt; the last line in a code block overlaps the horizontal scroll bar.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For eg(From the time travel question):&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;from datetime import*&#xA;o=0&#xA;while 1:n=datetime.now();o=o or n;print&quot;%s;%s: %s? You mean we're in the future?&quot;%(o,n,n.year)if(n-o).days&amp;gt;=1else&quot;%s;%s: Back in good old %s.&quot;%(n,o,n.year)if(n&amp;lt;o)else&quot;Great Scott!&quot;;o=n &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A &lt;code&gt;padding-bottom:15px;&lt;/code&gt;  on the &lt;code&gt;&amp;lt;pre&amp;gt;&lt;/code&gt; tag generated seems to work well in this case.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ZKsuS.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZKsuS.jpg&quot; alt=&quot;work well&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I guess this is because Chrome now uses internal scroll bars instead of external.&lt;/p&gt;&#xA;" OwnerUserId="19377" LastEditorUserId="68942" LastEditDate="2021-04-13T14:50:27.707" LastActivityDate="2021-04-13T14:50:27.707" Title="Horizontal scroll bar on code tags overlaps the last line" Tags="|bug|status-norepro|css|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7260" PostTypeId="1" CreationDate="2015-10-23T10:24:34.583" Score="14" ViewCount="302" Body="&lt;p&gt;The reason for this post is due to the &lt;a href=&quot;https://codegolf.stackexchange.com/q/60942/21487&quot;&gt;binary decimal representation&lt;/a&gt; challenge, where @primo is, as of writing, awarding a bounty for the fastest solution to a code-golf question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In response to this, I'd like to raise a few questions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Is it acceptable to start a bounty for a question with an alternative winning criteria? (e.g. &quot;least whitespace characters used&quot;, &quot;most popular&quot; or &quot;least memory used&quot; to a code-golf question)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the answer to the first question is yes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Should the new scoring criteria be somewhat related to the original scoring criteria for it to be acceptable? (e.g. &quot;least whitespace characters used&quot; is tangentially related to code-golf, but &quot;fastest code&quot; is basically a polar opposite)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Should an answer aiming for the bounty also try to conform to the original scoring criteria even if it doesn't make much sense to do so? (e.g. golfing code intended for a &quot;fastest code&quot; bounty)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the answer to the first question is no:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Is it acceptable to form a related question with the new scoring criteria, possibly with the permission of the original poster? (assuming this does not cause the new question to be a dupe)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Are there any alternatives to the previous question? (e.g. if we're desperate to see an efficient implementation for a code-golf)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is there anything we should do if we see an alternative winning criterion bounty?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="21487" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-10-25T18:35:26.763" Title="Alternative winning criterion bounties" Tags="|discussion|bounty|" AnswerCount="4" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7261" PostTypeId="1" AcceptedAnswerId="7264" CreationDate="2015-10-23T10:52:26.450" Score="15" ViewCount="724" Body="&lt;p&gt;I'm afraid that languages like CJam are reserved for pro golfers. I think about that because I get the impression that answers in languages like CJam just need to be accepted.&lt;/p&gt;&#xA;" OwnerUserId="46245" LastEditorUserId="31516" LastEditDate="2017-03-22T11:42:10.623" LastActivityDate="2017-03-22T11:42:10.623" Title="Are newbies allowed to write programs in golf languages?" Tags="|discussion|code-golf|answers|new-users|" AnswerCount="4" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7262" PostTypeId="2" ParentId="7261" CreationDate="2015-10-23T11:03:32.010" Score="21" Body="&lt;p&gt;Of course you can: anyone can answer any question in any language: there's no restriction upon new users apart from those put in place by Stack Exchange (which Programming Puzzles and Code Golf can't control).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Don't be afraid to go ahead and try and use a golfing language. Just because users like Dennis or Peter Taylor get impossibly short answers in CJam or Pyth doesn't mean you can't have fun trying to learn the language.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2015-10-23T11:03:32.010" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7263" PostTypeId="2" ParentId="7261" CreationDate="2015-10-23T11:06:35.707" Score="27" Body="&lt;p&gt;An answer is judged on its content, not on the status of the person who posted it. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If an established and respected community member posts an answer to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question that makes no effort to reduce the number of bytes then it will be downvoted.&lt;/li&gt;&#xA;&lt;li&gt;If a new member with no experience posts an answer that is not the shortest but clearly makes an effort to compete then it will be upvoted.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Voting is subjective and people have biases, but the competition is open to anyone to enter in any valid programming language.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;You will also find that if you post an answer then other people who use that same programming language will often comment on your answer with advice on how to improve it.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2015-10-23T11:06:35.707" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7264" PostTypeId="2" ParentId="7261" CreationDate="2015-10-23T11:06:43.573" Score="36" Body="&lt;p&gt;Let's just put it this way — where do experienced golfing language users come from? They certainly don't just fall out of the sky, and must have started somewhere, right?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Without the practice and experience, you'll never get used to the language. But if you don't get started, you'll never gain the necessary practice and experience! Just go for it! If you're willing to learn, chances are you'll be able to pick up tips from other people commenting on your posts, or alternatively you can ask for advice in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;chat&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="21487" LastActivityDate="2015-10-23T11:06:43.573" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7265" PostTypeId="2" ParentId="2140" CreationDate="2015-10-23T13:08:43.857" Score="1" Body="&lt;h1&gt;&quot;The&quot; Gaidhlig Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The Gaidhlig language has some non-trivial rules when it comes to putting &quot;the&quot; in front of a word.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You're challenge is to create a program that takes two inputs, the first input is a string of text, a real word or made up that we can pretend is a noun. The second input is either the letter 'f' or the letter 'b' to denote whether the word is masculine or feminine. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The type of delimiter between these two inputs is your choice but must not be the letters a to z, a dash, or an apostrophe.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The first input is always assumed to be a noun.&lt;/li&gt;&#xA;&lt;li&gt;The second input denotes whether the noun is masculine (f) or feminine (b).&lt;/li&gt;&#xA;&lt;li&gt;We will always assume all inputs is valid.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;You're output will be the the first input, modified for the following rules:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Masculine Nouns (where 'f' is supplied.)&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Before vowels: An t-&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Before &lt;code&gt;b f m p&lt;/code&gt;: Am&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Before all other instances: An&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Feminine Nouns (where 'b' is supplied.)&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Before &lt;code&gt;sl sr sn so se si su&lt;/code&gt;: An t-&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Before &lt;code&gt;b m p c g&lt;/code&gt; : A' [with lentition]&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Before &lt;code&gt;f&lt;/code&gt;: An [with lentition]&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Before all other instances: An&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Whether the word is masculine or feminine:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Words that start with &lt;code&gt;l n r sg sm sp st&lt;/code&gt; always start with: An&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Lentition&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When lentition is asked for, you must add the letter &lt;code&gt;h&lt;/code&gt; after the first letter of your word in cases where the word starts with &lt;code&gt;b c d f g m p s t.&lt;/code&gt; Otherwise the word remains unchanged. Further, you must not add an additional letter &lt;code&gt;h&lt;/code&gt; if there is already a &lt;code&gt;h&lt;/code&gt; in place.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lentition of Aran: Aran&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lentition of Ghoul: Ghoul&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lentition of Goul: Ghoul&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lentition of House: House&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Cat f &lt;code&gt;An Cat&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Cat b &lt;code&gt;A' Chat&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;fear f &lt;code&gt;Am fear&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;fear b &lt;code&gt;A' fhear&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Obair f &lt;code&gt;An t-Obair&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Obair b &lt;code&gt;An Obair&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;snow f &lt;code&gt;An snow&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;snow b &lt;code&gt;An t-snow&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Shortest code in bytes wins.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="41778" LastActivityDate="2015-10-23T13:08:43.857" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7266" PostTypeId="1" CreationDate="2015-10-23T13:59:18.240" Score="9" ViewCount="169" Body="&lt;p&gt;I found an interesting, closed challenge. I know that I can address the flaws that led it to closure. Normally, I would edit the challenge into shape, but the question is over a year old and I want it to get the attention is deserves.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should I repost it?&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="66833" LastEditDate="2021-05-13T15:23:39.410" LastActivityDate="2021-05-13T15:23:39.410" Title="Should I repost a revised version of a really old, closed challenge?" Tags="|discussion|editing|closed-questions|reposting|" AnswerCount="1" CommentCount="2" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7267" PostTypeId="2" ParentId="7266" CreationDate="2015-10-23T14:09:01.003" Score="9" Body="&lt;p&gt;I think this can go either way, and it depends mainly on the original question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it was so flawed that there isn't an easy way to edit it into shape, then I don't see a problem with reposting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the fix is something relatively minor, I'd prefer to see it edited into shape and reopened, since I feel that's one of the basic tenets of Stack Exchange. The whole reason we &lt;em&gt;have&lt;/em&gt; edit privileges is to make things better over time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, &quot;major&quot; and &quot;minor&quot; fixes are subjective, and I can see where people might disagree with which category a particular question falls into. In this case just choose one or the other and the votes/community will sort it out.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I don't believe that &quot;it should get more attention&quot; is a valid reason for posting a duplicate, and has no bearing here. The usual methods for gathering more attention to a question (bounties, chat, social media, whatever) can be used in this case.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2015-10-23T14:09:01.003" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7269" PostTypeId="1" CreationDate="2015-10-23T15:34:55.313" Score="1" ViewCount="138" Body="&lt;p&gt;That is, a tag when the main objective is to write infinite loops without doing useful things, to crash the compiler, to generate errors, to use a lot of memory, or to generate big executables, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I feel those challenges are related, and a user who likes one of them may like the others. And currently they are likely only tagged as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we create a tag for them. And if so, what exactly should be included in this tag?&lt;/p&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2015-11-22T18:46:40.760" Title="Create a tag for misbehaviors?" Tags="|discussion|tags|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7270" PostTypeId="2" ParentId="7269" CreationDate="2015-10-23T16:26:44.837" Score="1" Body="&lt;p&gt;I can see why &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/misbehaviors&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;misbehaviors&amp;#39;&quot; rel=&quot;tag&quot;&gt;misbehaviors&lt;/a&gt; would be a useful tag. If you wanted to write a challenge involving crashes, infinite loops, or other types of misbehaviors, you might use the tag to search for duplicates.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is another tag called &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt;. If you think about it, most questions using that tag are really just a combination of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/misbehaviors&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;misbehaviors&amp;#39;&quot; rel=&quot;tag&quot;&gt;misbehaviors&lt;/a&gt;*. I think we should split that tag into two. This would satisfy your request without increasing the total number of tags. There's no reason to have a more specialized version of popularity contest anyway.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Proposed actions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Retag all &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; challenges as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/misbehaviors&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;misbehaviors&amp;#39;&quot; rel=&quot;tag&quot;&gt;misbehaviors&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Delete the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; tag&lt;/li&gt;&#xA;&lt;li&gt;Add the new &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/misbehaviors&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;misbehaviors&amp;#39;&quot; rel=&quot;tag&quot;&gt;misbehaviors&lt;/a&gt; tag to any questions that it might apply to&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;*With few exceptions, notably &lt;a href=&quot;https://codegolf.stackexchange.com/questions/31615/efficient-error-free-encoding&quot;&gt;this challenge&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-10-23T18:16:01.510" CommentCount="19" ContentLicense="CC BY-SA 3.0" />
  <row Id="7272" PostTypeId="2" ParentId="2140" CreationDate="2015-10-23T17:32:13.230" Score="0" Body="&lt;h1&gt;Implementations of linked lists&lt;/h1&gt;&#xA;&lt;p&gt;Given the source code of a function or method to delete the first node having value &lt;em&gt;x&lt;/em&gt; if existed, from a non-cyclic singly linked list, in a specific programming language. Write a program or function (not necessarily in the same language) to decide what kind of implementation it is.&lt;/p&gt;&#xA;&lt;p&gt;You don't have to check for all the cases. But the more intelligent your code is, the better.&lt;/p&gt;&#xA;&lt;p&gt;The possible implementations need to be checked are:&lt;/p&gt;&#xA;&lt;h3&gt;Pointer of pointers&lt;/h3&gt;&#xA;&lt;p&gt;(Spec and examples to be added.)&lt;/p&gt;&#xA;&lt;h3&gt;Head node&lt;/h3&gt;&#xA;&lt;p&gt;(Spec and examples to be added.)&lt;/p&gt;&#xA;&lt;h3&gt;Moving the data&lt;/h3&gt;&#xA;&lt;p&gt;(Spec and examples to be added.)&lt;/p&gt;&#xA;&lt;p&gt;(And maybe some others.)&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Possible winning criteria:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Just &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Something like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; where a submission is valid if no shorter programs can do all the things documented in the answer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-23T17:32:13.230" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7274" PostTypeId="2" ParentId="2140" CreationDate="2015-10-23T21:53:27.830" Score="0" Body="&lt;h2&gt;Would someone like to write a crontab puzzle?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I have just asked for a software that &lt;a href=&quot;https://softwarerecs.stackexchange.com/questions/25935/display-all-times-at-which-a-cron-job-runs&quot;&gt;displays all times at which a cronjob runs&lt;/a&gt;. As I think more about it, this might be a nice golfing question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unfortunately I'm not too familiar with the crontab specification, especially when it comes to combining operators such as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;*/15,34,49-52 * * * * /path/to/command&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Is that suitable for code-golf at all? If someone or a group of people would define it as a puzzle, I'd be glad to see it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Starting point:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;takes a crontab line as input&lt;/li&gt;&#xA;&lt;li&gt;checks if it is valid or not&lt;/li&gt;&#xA;&lt;li&gt;if valid, from now on lists the next execution times&lt;/li&gt;&#xA;&lt;li&gt;limited to a user definable amount&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;E.g.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;program -n 10 30 17 * * *&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;produces 10 lines of output (assuming today is 2015-10-22 18:00)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2015-10-23 17:30&#xA;2015-10-24 17:30&#xA;2015-10-25 17:30&#xA;2015-10-26 17:30&#xA;2015-10-27 17:30&#xA;2015-10-28 17:30&#xA;2015-10-29 17:30&#xA;2015-10-30 17:30&#xA;2015-10-31 17:30&#xA;2015-11-01 17:30&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="16901" LastEditorUserId="-1" LastEditDate="2017-04-13T12:50:01.760" LastActivityDate="2015-10-23T21:53:27.830" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7275" PostTypeId="2" ParentId="2140" CreationDate="2015-10-24T00:14:05.890" Score="0" Body="&lt;h1&gt;Word Game KotH &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;First of all, I don't know what this game is called (or if it even has a name), but it's a modification of a game I've played a few times on road trips, especially with my family. I'll be thinking of a better name.&lt;/p&gt;&#xA;&lt;p&gt;Any suggestions at all are very welcome.&lt;/p&gt;&#xA;&lt;h2&gt;How It's Played&lt;/h2&gt;&#xA;&lt;p&gt;There are 5&lt;sup&gt;1&lt;/sup&gt; bots playing per game. At the beginning of the game, they are given a collection of letters (which is not necessarily a word), for example &amp;quot;a&amp;quot; or &amp;quot;jet.&amp;quot; The bots take turns in a predetermined order. When it is a bot's turn it is passed the current word(s) and has four&lt;sup&gt;2&lt;/sup&gt; options:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It can change a single letter to any other letter.&lt;/li&gt;&#xA;&lt;li&gt;It can add a single letter to any position in the word.&lt;/li&gt;&#xA;&lt;li&gt;It can swap any two letters in the word.&lt;/li&gt;&#xA;&lt;li&gt;It can split the word at any point.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;If you didn't infer already, these actions are allowed with the caveat that their result is a valid word or two valid words, if the bot chooses to split. The game ends when the combined lengths of all the words in play are 3 times the length of the longest word in the dictionary used (e.g. if &amp;quot;onomatopoeia&amp;quot; is the longest word, the max length would be 36 letters since it has 12) or when only one bot remains. The bots are scored on how many turns they last&lt;sup&gt;*&lt;/sup&gt;, and the winner of the game is granted a bonus&lt;sup&gt;3&lt;/sup&gt;.&lt;/p&gt;&#xA;&lt;p&gt;*The turn they lose on is not counted, so if the bot were to lose on its first turn it would have lasted 0 turns.&lt;/p&gt;&#xA;&lt;p&gt;A word is valid if it is both in the dictionary and hasn't been played before.&lt;/p&gt;&#xA;&lt;p&gt;Bots should take a reasonable amount of time in making their plays (no more than a few seconds).&lt;/p&gt;&#xA;&lt;h2&gt;Available Methods&lt;/h2&gt;&#xA;&lt;p&gt;&lt;code&gt;isValid(word)&lt;/code&gt; returns a Boolean value (whether the word is valid or not).&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;getDictionary()&lt;/code&gt; returns the entire dictionary as a single string.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;getPreviousPlays()&lt;/code&gt; returns the words previously played as an array (one word per element).&lt;/p&gt;&#xA;&lt;p&gt;Once any of the following methods are called, the bot's turn is over:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;change(index,letter)&lt;/code&gt; changes the letter at that index to the letter provided. This method &lt;em&gt;cannot&lt;/em&gt; change a space to a letter (to prevent stalling).&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;insert(index,letter)&lt;/code&gt; inserts the provided letter at the provided index.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;swap(index1,index2)&lt;/code&gt; swaps the letters at index1 and index2.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;split(index)&lt;/code&gt; splits the word into two by inserting a space at the specified index. Both of these words have to be valid&lt;sup&gt;4&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;If any of the calls to these methods are invalid, the bot is disqualified for that game (treated as a loss).&lt;/p&gt;&#xA;&lt;h1&gt;Author's notes&lt;/h1&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Basically a random number I determined; I don't know if it's too big or small.&lt;/li&gt;&#xA;&lt;li&gt;Is four too few to make this challenge interesting?&lt;/li&gt;&#xA;&lt;li&gt;This bonus is undetermined as of now, but I'd say 2 points tentatively. I'm also a bit unsure as to whether that is a good scoring method. Should it just be on victories or position in victory (i.e. first, second, third, etc. place)? I'm also worried that this might encourage users to submit bots that collaborate to last as many rounds as possible.&lt;/li&gt;&#xA;&lt;li&gt;Would it be more interesting if this ignored validity? e.g. if you have &lt;code&gt;candies dog&lt;/code&gt; as the two words, splitting &lt;code&gt;candies&lt;/code&gt; into &lt;code&gt;can&lt;/code&gt; and &lt;code&gt;dies&lt;/code&gt; would be valid even if either of those words had been played before.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;I haven't done a KotH submission before, so I'd love feedback as to how to improve this.&lt;/p&gt;&#xA;&lt;h2&gt;Unimplemented Portions&lt;/h2&gt;&#xA;&lt;h3&gt;Controller&lt;/h3&gt;&#xA;&lt;p&gt;This is the big unimplemented portion: I want to get feedback on the idea as a whole before diving into programming out a controller.&lt;/p&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;p&gt;I'm still unsure as to how the games should be scored.&lt;/p&gt;&#xA;" OwnerUserId="42833" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-24T00:14:05.890" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7278" PostTypeId="2" ParentId="7243" CreationDate="2015-10-24T12:41:30.730" Score="1" Body="&lt;h1&gt;Yes, but make it runnable on its own&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You don't necessarily need a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7245/4372&quot;&gt;compiler&lt;/a&gt;, as long as you can run &lt;code&gt;mython myscript.my&lt;/code&gt; (or whatever your language is called) from the command line.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One way of achieving this would be to make a small shell script that somehow ran Python with the right flags and parameters so that your library is loaded at startup. I don't know for Python, but this option exists for other languages such as Ruby and Perl. I know because I have very similar plans to yours :)&lt;/p&gt;&#xA;" OwnerUserId="4372" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2015-10-24T12:41:30.730" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7279" PostTypeId="2" ParentId="2140" CreationDate="2015-10-24T13:07:46.043" Score="0" Body="&lt;h1&gt;Create &lt;a href=&quot;http://esolangs.org/wiki/CHIQRSX9%2B&quot; rel=&quot;nofollow noreferrer&quot;&gt;CHIQRSX9+&lt;/a&gt; Analogue Program.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/meta-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;meta-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;meta-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to create a program in same language, that when given a CHIQRSX9+ will print a that analogue.&#xA;That analogue program will do similiar thing that CHIQRSX9+ program do. There's exception though. There's may be more than 1 instruction. Then it's meant to be executed &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;C&lt;/code&gt; =&gt; Read until empty line and print all entered lines, including empty line.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;H&lt;/code&gt; =&gt; Print &quot;Hello, world!&quot;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;I&lt;/code&gt; =&gt; Read input until a newline then return that analogue&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Q&lt;/code&gt; =&gt; Print the analogue program source code. (Not the entered one)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;R&lt;/code&gt; =&gt; Read input until a newline then print that string after doing ROT-13&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;S&lt;/code&gt; =&gt; Read comma separated number until newline and sort that.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;X&lt;/code&gt; =&gt; For this, X have undefined behavior.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;9&lt;/code&gt; =&gt; Print 99 Bottles of beer with correct pluralization.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;+&lt;/code&gt; =&gt; Increment Accumulator.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Printing instruction(&lt;code&gt;C&lt;/code&gt;, &lt;code&gt;H&lt;/code&gt;, &lt;code&gt;I&lt;/code&gt;, &lt;code&gt;Q&lt;/code&gt;, &lt;code&gt;R&lt;/code&gt;, &lt;code&gt;S&lt;/code&gt;, and &lt;code&gt;9&lt;/code&gt;) begin in a new line. After everything is printed, accumulator count is written at new line. Final newline is optional.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If there's program X written in Haskell, then&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;X&#xA;CH&#xA;&amp;gt;main=interact$(++&quot;\nHello, world!\n0&quot;).unlines.takeWhile(/=&quot;&quot;).lines&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which when compiled (Example as W) will do that&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;W&#xA;This is a line&#xA;This is another line&#xA;&#xA;&amp;gt;This is a line&#xA;&amp;gt;This is another line&#xA;&amp;gt;&#xA;&amp;gt;Hello, world!&#xA;&amp;gt;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Another example for Q&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;X&#xA;Q&#xA;&amp;gt;main=putStr(s++[';','s','=']++show s);s=&quot;main=putStr(s++[';','s','=']++show s)&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Yet another example&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;X&#xA;H+&#xA;&amp;gt;main=printStr&quot;Hello, world!\n1&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Here is for indication of output. DO NOT print it.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Sandboxing Question&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;How about scoring. I want to reward short produced program. However, shorness of producing program is also counted. I guess just 10A+5B+C. Where A is length of original source code, B is length of &quot;QQQQ&quot; analogue program. C is length of &quot;CHIQRS9+&quot;.&lt;/p&gt;&#xA;" OwnerUserId="46245" LastEditorUserId="46245" LastEditDate="2015-10-26T09:53:25.763" LastActivityDate="2015-10-26T09:53:25.763" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="7281" PostTypeId="2" ParentId="7260" CreationDate="2015-10-24T21:07:21.767" Score="-5" Body="&lt;p&gt;&lt;strong&gt;Yes&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But the bounty scoring must have been used on this site (so fastest code is okay, but least whitespace is not) and new answers should aim to maximize their score according to the challenge, not the bounty.&lt;/p&gt;&#xA;" OwnerUserId="34543" LastActivityDate="2015-10-24T21:07:21.767" CommentCount="1" CommunityOwnedDate="2015-10-24T21:07:21.767" ContentLicense="CC BY-SA 3.0" />
  <row Id="7282" PostTypeId="2" ParentId="2140" CreationDate="2015-10-24T22:27:55.727" Score="1" Body="&lt;p&gt;I would love to hear your thoughts about the following challenge. Too difficult or contrived? Or should we actually &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7150/easy-challenges-and-hot-network-questions&quot;&gt;want more complicated and challenging&lt;/a&gt; tasks? I'll provide an example implementation in MATLAB by the time I post the challenge. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Concert Harp: Pedal Meddle &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Sometimes I hear people say, ‘Why would anyone outside the ICT business learn how to program?’ Often, they get replies like ‘well, sometimes there are problems to which there is no software available’, but when asked about what kind of problems these would be, they’re forced to admit that all they really wanted was to make Conway’s Game Of Life for their own entertainment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I recently found a problem that I think the home-and-garden programmer could face in reality. It considers a harp (a side effect sharing an apartment with a significant other) and a completely dumbfound pianist/programmer, who’s struggling enough with &lt;em&gt;one&lt;/em&gt; pedal as it is. The harp in question has seven.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, for some background music/harp theory. You may skip as much as your musical background, or lack thereof, allows. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Music theory (a very condensed version)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Both in a harp and a piano, the strings/keys are laid out as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;… C | D | E F | G | A | B C | D | E F | G A | B …&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There are seven root notes, [A-G], with at some locations a | in between to signify that there’s a note in between. These &lt;code&gt;|&lt;/code&gt;’s are address by making a note higher by appending a &lt;code&gt;#&lt;/code&gt;, or lower by appending a &lt;code&gt;b&lt;/code&gt;. For example, &lt;code&gt;C#==Db&lt;/code&gt;, &lt;code&gt;F#==Gb&lt;/code&gt; (and also, &lt;code&gt;Fb==E&lt;/code&gt;). Using these notes, we can make a scale. The difference between D and D# is called a half note, and between D and E a whole note.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Scales are made as follows:&#xA;1: take the root note&#xA;1: Find the next notes by going up a whole or half number of notes in the following pattern (last step in &lt;code&gt;()&lt;/code&gt; because that makes you end up at the root note again)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Major: 1 1 ½ 1 1 1 (½)&#xA;Minor: 1 ½ 1 1 1 1 (½)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For example, D major and A# minor&#xA;    D E F# G A B C# (D)&#xA;    A# B# C# D# E# F# G# A#&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, these notations are not unique, since for example &lt;code&gt;E#==F&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Problem&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A harp has seven pedals, each responsible for one note. This note, they can either raise half a note, or lower half a note. For example, the C pedal can either make all C’s sound like C#(==Db) or like Cb(==B).  Let’s designate raising by a pedal setting of +1 and lowering by -1, and leaving it as-is as 0. Given an input scale, write a program or function that outputs how each of the pedals should be set to achieve all of the tones in that scale.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A scale designation. Scales are designated as follows: &lt;code&gt;R[m][k]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;R&lt;/strong&gt;: Root. [A-G]&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;[m]&lt;/strong&gt;: Optional: modification. Either flat &lt;code&gt;b&lt;/code&gt; or sharp &lt;code&gt;#&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;[k]&lt;/strong&gt;: Optional: minor key, designated as &lt;code&gt;m&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Valid inputs would be for example&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;C&lt;/code&gt; C major&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Dm&lt;/code&gt; D minor&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Fbm&lt;/code&gt; F flat minor&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The pedal setting &lt;code&gt;-1&lt;/code&gt;, &lt;code&gt;0&lt;/code&gt; or &lt;code&gt;1&lt;/code&gt; for each of the pedals, in the following order, reflecting the actual location of the pedals on a harp:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;D C B | E F G A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Test cases: (not exhaustive; i.e., there may be more solutions, I only included a double solution to one input)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;C , B#, Am -&amp;gt; 0 0 0 | 0 0 0 0&#xA;Cm, B#m    -&amp;gt; 0 0 0 | -1 0 0 0&#xA;F#m, Gbm   -&amp;gt; 1 1 0 | 1 1 1 1&#xA;        or -&amp;gt; -1 -1 -1 | -1 0 -1 -1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="32352" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2015-10-25T10:22:07.757" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7285" PostTypeId="2" ParentId="7248" CreationDate="2015-10-25T14:38:03.997" Score="13" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;People need to be able to actually run your entry. Just as you can't write code with syntax errors, you can't write code that your interpreter won't compile because it's not encoded in a certain way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you need a certain encoding for a language, write your own interpreter, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7232/20666&quot;&gt;even if it just converts encodings and delegates to the real one&lt;/a&gt; (as @ThomasKwa said in comments).&lt;/p&gt;&#xA;" OwnerUserId="20666" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2015-10-25T14:38:03.997" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7286" PostTypeId="1" CreationDate="2015-10-25T20:00:17.407" Score="2" ViewCount="79" Body="&lt;p&gt;It would appear to have been decided that the use of non-standard libraries is permissible (unless the question specifies otherwise), on the condition that the library being used is freely available and predates the asking date of the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would requiring a non-standard preprocessor be permissible under the same set of conditions?&lt;/p&gt;&#xA;" OwnerUserId="39022" LastActivityDate="2015-10-26T08:36:20.713" Title="Is using a non-standard preprocessor permissible?" Tags="|discussion|" AnswerCount="1" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="7289" PostTypeId="2" ParentId="7286" CreationDate="2015-10-26T08:36:20.713" Score="5" Body="&lt;p&gt;It's the compiler of a new language that compiles into Java.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Just like &lt;a href=&quot;http://coffeescript.org/&quot; rel=&quot;nofollow&quot;&gt;CoffeeScript&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;CoffeeScript is a little language that compiles into JavaScript.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;And the other steps are handled by a JavaScript interpreter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &quot;new language&quot; can be a language under a different name based on Java, or a dialect of Java. As your language doesn't likely match the Java specification, and probably won't be accepted by other Java users, it's safer to call it a language under a different name. You can still call it something like Preprocessed Java, though.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2015-10-26T08:36:20.713" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7290" PostTypeId="2" ParentId="7261" CreationDate="2015-10-26T16:56:35.123" Score="7" Body="&lt;p&gt;I think you are under the wrong impression that golfing in &lt;code&gt;golf languages&lt;/code&gt; is harder than golfing in a mainstream programming language. That's absolutely not the case. In my own humble opinion golfing in C or Assembly is way harder than golfing in any dedicated golfing language. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you ask me golf languages just look too scary to newbies because they don't have yet a full grasp on what programming actually is, how it works and how abstract machines work. This is especially true for students. They are taught Java or PHP but they are never taught how to actually do the abstract thinking it requires to program in esoteric programming languages. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;for(int i = 0; i &amp;lt; arr.size(); i++) foo[i]++;&lt;/code&gt; versus &lt;code&gt;1?+&lt;/code&gt;. Which is more difficult? None, it's the same basic operation/algorithm just expressed a little bit different. The problem here is, that most newbies don't have a basic understanding of what I call &lt;code&gt;building blocks&lt;/code&gt; such as &lt;code&gt;zipping&lt;/code&gt;, &lt;code&gt;mapping&lt;/code&gt;, &lt;code&gt;reducing&lt;/code&gt;, &lt;code&gt;filtering&lt;/code&gt; and many more. Esoteric programming languages usually operate on a way lower-level whereas golfing language usually operate on a much more high-level basis. If you program in Burlesque for example you don't think in &lt;code&gt;while&lt;/code&gt;-loops, &lt;code&gt;for&lt;/code&gt;-loops, &lt;code&gt;assignments&lt;/code&gt; and the like. You think in much bigger blocks such as &lt;code&gt;filter&lt;/code&gt; then perform a &lt;code&gt;list intersection&lt;/code&gt; and do a &lt;code&gt;map&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any good CS student should be able to at least write an addition and multiplication in brainfuck otherwise he may know how to whip up stuff with Angular.js but he hasn't even understood basic programming stuff. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;10ro?i{3.%}f[pd&lt;/code&gt; (&lt;a href=&quot;http://104.167.104.168/~burlesque/burlesque.cgi?q=10ro%3Fi%7B3.%25%7Df[pd&quot; rel=&quot;nofollow&quot;&gt;try online here&lt;/a&gt;) is literally the same thing as &lt;code&gt;product . filter (\x -&amp;gt; x&lt;/code&gt;mod&lt;code&gt;3 /= 0) . map succ $ [1..10]&lt;/code&gt; which is the same thing as &lt;code&gt;reduce(lambda a,b:a*b,(filter(lambda a: a % 3 != 0,map(lambda a: a+1,range(1,11)))))&lt;/code&gt; (Python doesn't seem to have a &lt;code&gt;product&lt;/code&gt; function)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In concatenative languages you read from left-to-right, in functional languages with function composition you usually read from right-to-left and in imperative languages it's roughly the same except with a syntax of &lt;code&gt;f(g(h(x)))&lt;/code&gt; instead of &lt;code&gt;f . g . h $ x&lt;/code&gt;. In a concatenative language you'd write &lt;code&gt;x h g f&lt;/code&gt;. Universities fail a lot to teach students different programming paradigms because they are &lt;code&gt;throughput&lt;/code&gt; oriented for the industry. The industry needs Java developers, they don't need people how have a deeper understanding of programming because that understanding isn't required and doesn't pay out. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should really try out a golfing language someday. It's not as hard as you think and the creators (or community) of those languages are really helpful and you can ask them pretty much for any help you need. It probably will never have any significant impact on your salary as a developer but that's not why we do golfing anyway :D.&lt;/p&gt;&#xA;" OwnerUserId="5429" LastEditorUserId="5429" LastEditDate="2015-10-26T17:05:02.950" LastActivityDate="2015-10-26T17:05:02.950" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7291" PostTypeId="2" ParentId="7230" CreationDate="2015-10-26T17:13:58.897" Score="-1" Body="&lt;p&gt;There's golfscript2 (aka gs2) which also uses non-printable characters and non-ascii characters (which most languages don't use because you don't want to program in a hex editor). You could also easily compress any Burlesque program by almost ~50% by just mapping every built-in to a single character using non-printable and non-ascii ranges. But then I wouldn't want to use it anymore as my little desk calculator because I don't want to use a hexeditor for that. &lt;/p&gt;&#xA;" OwnerUserId="5429" LastActivityDate="2015-10-26T17:13:58.897" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7292" PostTypeId="2" ParentId="7248" CreationDate="2015-10-26T19:44:42.430" Score="3" Body="&lt;h1&gt;Have it be a different language.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In effect, the new language is a combination of &lt;code&gt;recode&lt;/code&gt; (with the right arguments) and the original language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For by-language competitions, it thus wouldn't compete against the original language, but just against your own recoded language.&lt;/p&gt;&#xA;" OwnerUserId="2338" LastActivityDate="2015-10-26T19:44:42.430" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7294" PostTypeId="1" CreationDate="2015-10-27T06:28:08.193" Score="15" ViewCount="247" Body="&lt;p&gt;I read questions at this community for while and feel they are funny:)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I really don't know what the questions are playing with, especially the meaning behind the title:(&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have no idea what they are talking about, is there any beginner instruction to join this community?&lt;/p&gt;&#xA;" OwnerUserId="46562" LastEditorUserId="20469" LastEditDate="2015-10-27T06:49:01.877" LastActivityDate="2015-10-27T06:49:01.877" Title="Is there simple example or demo to show how to play with this community?" Tags="|discussion|new-users|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="7295" PostTypeId="2" ParentId="7294" CreationDate="2015-10-27T06:41:10.893" Score="17" Body="&lt;p&gt;Hello and Welcome to Programming Puzzles and Code Golf! I'm delighted that you'd like you join our community. We're glad to have you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To get a feel for the community and how to contribute:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You can start with the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/tour&quot;&gt;Tour&lt;/a&gt;, which to be honest isn't terribly informative, but it's a start.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Check out the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/help&quot;&gt;Help Center&lt;/a&gt; for more details on what kind of challenges and submissions are acceptable.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Take a look around the site and see how people do things. That, in my opinion, is the easiest way to get a feel for the community. It sounds like you've already been doing that, which is great!&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I recommend trying your hand at answering a couple challenges and if you feel like writing your own, you can post it to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt; where you can get feedback on it before it goes to the main site.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If you come across challenges that you don't understand immediately, don't fret! Often others will have the same questions. In that case you can leave a comment on the post asking for clarification. Challenges should contain sufficient detail so that a broad range of people can participate. Sometimes the subject matter is highly specialized, often pertaining to advanced mathematics, but if that's not your forte then we have plenty of other challenges to choose from.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you have any further questions along the way, you've already found the perfect place to ask them: Meta!&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-10-27T06:47:38.450" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7296" PostTypeId="2" ParentId="2056" CreationDate="2015-10-27T09:36:27.590" Score="26" Body="&lt;h2&gt;How long should I leave a question in the sandbox?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In general you should leave a question at least 72 hours to ensure that the people who check it fairly regularly will have a chance to see it and comment.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2015-10-27T09:36:27.590" CommentCount="1" CommunityOwnedDate="2017-11-30T08:34:33.320" ContentLicense="CC BY-SA 3.0" />
  <row Id="7298" PostTypeId="2" ParentId="6918" CreationDate="2015-10-27T10:19:54.373" Score="10" Body="&lt;h2&gt;Burlesque&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Burlesque is a concatenative, stack-based, lazy esoteric programming language. I'm not aware of any other esoteric programming language that is lazy but I of course don't know every single esoteric programming language. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Burlesque was written by me starting in 2012 mostly during boring lectures while I was studying computer science at a local university. At that time I probably didn't have a PPCG account yet but at least today I have.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I wrote it as a tool for me to use to make doing boring homework assignments easier and faster (and funnier) but it eventually became a language used for golfing. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Like mentioned earlier Burlesque is special in the fact that it supports lazy evaluation which allows you to work with infinitely long lists in a convenient fashion. Burlesque has a huge set of built-ins but every built-in is exactly two characters long which is of course a huge disadvantage when it comes to golfing. However, the sheer amount of built-ins is enough to compensate that a little &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since it's a language intended to be used my me I do not hesitate to add more built-ins whenever I want to and I literally only care about not breaking backwards compatibility. The reason Burlesque doesn't have a &quot;Hello world!&quot; built-in is because such a built-in - while nice for golfing - is pretty much useless for me because it wouldn't make solving any real world problems I use Burlesque for easier. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Webpage: &lt;a href=&quot;http://mroman.ch/burlesque&quot; rel=&quot;nofollow&quot;&gt;http://mroman.ch/burlesque&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Rosetta Code: &lt;a href=&quot;http://rosettacode.org/wiki/Category:Burlesque&quot; rel=&quot;nofollow&quot;&gt;http://rosettacode.org/wiki/Category:Burlesque&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Github: &lt;a href=&quot;https://github.com/FMNSSun/Burlesque&quot; rel=&quot;nofollow&quot;&gt;https://github.com/FMNSSun/Burlesque&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Esowiki: &lt;a href=&quot;https://esolangs.org/wiki/Burlesque&quot; rel=&quot;nofollow&quot;&gt;https://esolangs.org/wiki/Burlesque&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Burlesque even has built-ins for distributions (statistics, such as binomial, chi-square, hypergeometric, student t and the like), built-ins for average/variance frequency analysis:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;blsq ) &quot;helloooooo wwwwwwworld&quot;gw{^pSh?+}\m&#xA;&quot;1h1e2l6o1 7w1o1r1l1d&quot;&#xA;blsq ) &quot;helloooooo wwwwwwworld&quot;f:&#xA;{{7 'w} {7 'o} {3 'l} {1 'r} {1 'h} {1 'e} {1 'd} {1 ' }}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Some longer scripts:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;&#xA; Example code for statistics.&#xA; Calculates average, standard deviation and&#xA; displays a frequency table.&#xA; -- mroman, 2013&#xA;&quot;vv&#xA;&quot;REM: Data&quot;vv&#xA;{4.5 3.0 5.5 5.0 5.5 4.0&#xA; 5.5 5.0 3.0 4.5 4.0 4.5&#xA; 4.0 4.0 4.5 3.5 5.0 4.0&#xA; 4.0 6.0 5.5 5.0 4.0 5.5&#xA; 3.5 2.5 4.0 4.5 5.0 4.5&#xA; 5.0 5.0 4.0 3.0 4.5 2.5&#xA; 5.5}hd&#xA;&quot;Average: &quot;#aav?+sh&#xA;&quot;Standard Deviation: &quot;#aSD?+sh&#xA;&quot;.[Frequencies].\n&quot;#af:SP{' +]}wl?+sh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which produces:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.[Frequencies].&#xA; 9 4.0&#xA; 7 5.0&#xA; 7 4.5&#xA; 6 5.5&#xA; 3 3.0&#xA; 2 3.5&#xA; 2 2.5&#xA; 1 6.0&#xA;Standard Deviation: 0.8908106103676267&#xA;Average: 4.39189189189189&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="5429" LastActivityDate="2015-10-27T10:19:54.373" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7300" PostTypeId="1" CreationDate="2015-10-27T16:10:43.863" Score="16" ViewCount="550" Body="&lt;p&gt;I've been getting a lot of grief lately about posting Python answers after other users have already posted a Python answer. Not only do I come up with these independently, they sometimes are shorter/different solutions. I'm getting really tired of this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sources:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/24977041#24977041&quot;&gt;http://chat.stackexchange.com/transcript/message/24977041#24977041&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/61618/remove-all-occurrences-of-the-first-letter-of-a-string-from-the-entire-string/61673#comment148636_61673&quot;&gt;Remove all occurrences of the first letter of a string from the entire string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/59436/create-output-twice-the-length-of-the-code/61926#comment149201_61926&quot;&gt;Create output twice the length of the code&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="16472" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2015-10-29T07:08:42.733" Title="Why can't I post my answer after others use my language?" Tags="|discussion|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7302" PostTypeId="1" CreationDate="2015-10-27T16:50:12.300" Score="5" ViewCount="368" Body="&lt;p&gt;Prompted by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/61836/the-worlds-smallest-web-browser/61841?noredirect=1#comment149198_61841&quot;&gt;this comment&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The scoring of optional flags passed to compilers/interpreters has already been handled &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4776/how-do-we-count-compiler-interpreter-flags&quot;&gt;here&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/273/on-interactive-answers-and-other-special-conditions&quot;&gt;here&lt;/a&gt;.  However there is another case of one more level of indirection.  Specifically compilers/interpreters for some languages may themselves be built with extra options to enable/disable certain optional features.  These options may be passed to the &lt;code&gt;./configure&lt;/code&gt; script run before building the given compiler/interpreter, assuming the common &lt;code&gt;./configure &amp;amp;&amp;amp; make &amp;amp;&amp;amp; make install&lt;/code&gt; build paradigm.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the bash shell (interpreter for the bash shell language) has quite a few of these options, for example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;--enable-extended-glob-default&#xA;--enable-net-redirections&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first is disabled by default, that is we need to pass &lt;code&gt;--enable-extended-glob-default&lt;/code&gt; to the &lt;code&gt;./configure&lt;/code&gt; script to enable it in a new bash build.&lt;/li&gt;&#xA;&lt;li&gt;The second is enabled by default; that is to access this this feature, then no defaults need to be changed.  However, if we need to disable it for some reason, then we need to pass &lt;code&gt;--disable-net-redirections&lt;/code&gt; to the configure script.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In the case any of these optional are needed, how should these extra build options be scored?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strike&gt;I've added some answers.&lt;/strike&gt;  With @MartinBüttner's encouragement I've deleted some of these answers to allow more community input and not swing the discussion with my own bias.  Having said that, some other suggestions for possible solutions are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Only allow bone-stock builds of the compiler/interpreter&lt;/li&gt;&#xA;&lt;li&gt;Only allow bone-stock builds of the compiler/interpreter with all optional features turned off (even defaults)&lt;/li&gt;&#xA;&lt;li&gt;Allow any compiler/interpreter build options for free&lt;/li&gt;&#xA;&lt;li&gt;Assume all optional features turned off (even defaults) and add option length to score for any optional features used (even defaults)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Vote and add your own as you see appropriate.  Please don't be shy about downvoting answers you think are no good.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-09-09T23:40:00.703" Title="How should we score compiler/interpreter build-time options?" Tags="|discussion|code-golf|scoring|defaults|" AnswerCount="3" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7303" PostTypeId="2" ParentId="7302" CreationDate="2015-10-27T16:53:49.827" Score="1" Body="&lt;p&gt;Anything that uses the default compiler/interpreter build should not incur any extra scoring.  That is, since the &lt;code&gt;--enable-net-redirections&lt;/code&gt; bash build option is enabled by default, it does not need to be passed, and should not incur any extra scoring.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However for features that are not enabled by default such as &lt;code&gt;--enable-extended-glob-default&lt;/code&gt; for bash, then if you are using a build of bash with this feature enabled at build time, then the length of the command-line option should be added to your score - in this case 30 bytes.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastActivityDate="2015-10-27T16:53:49.827" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7306" PostTypeId="2" ParentId="7300" CreationDate="2015-10-27T17:00:33.203" Score="27" Body="&lt;h1&gt;You Can, Dogtor!&lt;/h1&gt;&#xA;&lt;p&gt;The only thing is, the public mightn't approve.&lt;/p&gt;&#xA;&lt;p&gt;If they believe that adding your code after other, shorter, answers exist for the same language is pointless, then they'll downvote because they don't see a reason for the answer to be there in the first place. It is a competition, after all.&lt;/p&gt;&#xA;&lt;h3&gt;You absolutely can post your answer.&lt;/h3&gt;&#xA;&lt;p&gt;But others might not see why.&lt;/p&gt;&#xA;&lt;p&gt;Note: a different method of finding an answer might be great, so post it anyway! It's just a question of whether people believe you should post to &lt;em&gt;win&lt;/em&gt; in your language or post to &lt;em&gt;show that there are other ways&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-27T17:00:33.203" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7309" PostTypeId="2" ParentId="7300" CreationDate="2015-10-27T17:02:37.160" Score="-12" Body="&lt;p&gt;Because this site follows a Q/A model, all answers should add something new to the question. The answers you linked to don't.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A answer in the same language that's shorter than a previously posted one will often earn my upvote—especially in a popular language like Python. This indicates that the second poster found something that the first poster overlooked. It adds to the site because it's shorter, and that's what we're about.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An answer that is longer but uses a creative approach will sometimes earn my upvote. In my opinion, when posting a longer answer, it's polite to link to the shorter answer as I did &lt;a href=&quot;https://codegolf.stackexchange.com/a/59437/39328&quot;&gt;here&lt;/a&gt; (actually, in that challenge my longer answer was first, but no matter).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, an answer that is slower, longer, and straightforward to find should not be valued on PCG. Post it if you want to, but don't expect votes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;FGITW is defined &lt;a href=&quot;https://meta.stackexchange.com/questions/9731/fastest-gun-in-the-west-problem?lq=1&quot;&gt;here&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Each question's answers are sorted by descending score and then by descending time of posting. This means that if a person sits down and answers a question in a long, thorough way, going through every nook and cranny, once they post their answer, it will already be one of about seven different ones, some of which have already been upmodded. This wouldn't be a problem if those answers were as thorough as the one this guy's posting, but they usually aren't. Some of them are downright wrong, some aren't even answers to the question asked because their poster didn't bother to read the question all the way through.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;FGITW is a problem when slower, &lt;em&gt;better&lt;/em&gt; answers don't get the votes they deserve. In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges, the quality of answers is based on their length, creativity, and (if necessary) explanation. Your answers were not shorter, and in my opinion they weren't creative; therefore, FGITW does not apply.&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2015-10-29T07:08:42.733" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="7311" PostTypeId="2" ParentId="7302" CreationDate="2015-10-27T17:21:24.513" Score="2" Body="&lt;p&gt;Note this is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7303/11259&quot;&gt;the same as this answer&lt;/a&gt; with one important distinction in scoring calculation.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Anything that uses the default compiler/interpreter build should not incur any extra scoring.  That is, since the &lt;code&gt;--enable-net-redirections&lt;/code&gt; bash build option is enabled by default, it does not need to be passed, and should not incur any extra scoring.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However for features that are not enabled by default such as &lt;code&gt;--enable-extended-glob-default&lt;/code&gt; for bash, then if you are using a build of bash with this feature enabled at build time, some extra score should be added.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;30 extra points for &lt;code&gt;--enable-extended-glob-default&lt;/code&gt; seems like a steep penalty.  Instead, each extra option enabled will incur 1 extra point.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2015-10-27T17:21:24.513" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7314" PostTypeId="1" CreationDate="2015-10-28T11:37:27.313" Score="11" ViewCount="290" Body="&lt;p&gt;I, being an avid Mma user, sometimes use its many datasets (such as &lt;code&gt;ElementData&lt;/code&gt;) for golfing purposes. However, these require the Wolfram Research servers to have the data. As I'm not directly connecting to the Internet, I am wondering if this would be considered a loophole.&lt;/p&gt;&#xA;" OwnerUserId="33208" LastEditorUserId="8478" LastEditDate="2015-10-29T07:39:06.020" LastActivityDate="2015-11-10T14:43:51.640" Title="Are Mathematica's datasets valid?" Tags="|discussion|rules|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7315" PostTypeId="2" ParentId="7302" CreationDate="2015-10-28T12:01:35.647" Score="7" Body="&lt;p&gt;I think it's hard to properly define what &quot;default&quot; means in a few cases. Take php for example: it has a pretty huge default library, but most of it you can only access if the appropriate module is built. The list of &quot;default&quot; modules is usually not set in stone, different distros think differently on what should be part of php by default and what not: should we only limit it to the language that was meant by the langauge maintainers, if that would mean most common compiled implementations (e.g. actual binaries you get from the distros) are out of the question? Or should we limit to language maintainer defaults + anything that it is in at least one usable binary that you can find? What about linux distros, like gentoo, where you can fine tune what gets built? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it is much easier to just allow any of the compiler flags for free. A compiler / interpreter built with different flags, is still just another compiler / interpreter (we can probably argue about whether the actual binary that was built is &quot;existing&quot; before or after the challenge was posted, and whether a solution using some non standard flags is using a loophole or not,  but I'd say if the &lt;em&gt;source code&lt;/em&gt; is there before the challenge, then it's okay).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it something that could potentially be abused? Yes, as @Doorknob said, one would just create a weird language that only has compiler flags (I guess they would be in the family of &lt;a href=&quot;https://esolangs.org/wiki/%E2%84%92&quot; rel=&quot;nofollow&quot;&gt;languages&lt;/a&gt;). But I think the community is good enough to downvote answers like this, while in no way limiting actual creative use for language features that are there, but just not widely used (like the one that started this discussion in the first place). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Actually: We could just use the definition of the languages to create a rule around compiler flags: if the compiler flags make the language an language, then they count as 1 byte/character per byte/character in the flag. Otherwise they are free. This definition would hopefully discourage most of the loophole usage, while still retaining the creative approach. This would also make it a properly defined rule around compiler flags (for anyone who dislikes rules that are not set in stone)&lt;/p&gt;&#xA;" OwnerUserId="8732" LastEditorUserId="31716" LastEditDate="2016-09-09T23:40:00.703" LastActivityDate="2016-09-09T23:40:00.703" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7316" PostTypeId="2" ParentId="7314" CreationDate="2015-10-28T12:28:26.423" Score="20" Body="&lt;p&gt;I do consider them built-ins. Just because you sort of have to update your language (or language's standard library) before you can use them for the first time, doesn't mean you're fetching the result from the internet. Once Mathematica has downloaded the data from Wolfram Research, it's just part of the language and can be reused (even after restarting Mathematica or similar).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Whether built-ins are allowed or not depends on the particular challenge in question. Using built-ins is no longer an accepted standard loophole, so unless the challenge rules them out explicitly, any of the &lt;code&gt;*Data&lt;/code&gt; functions should be fair game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Of course, it might be polite first to ask the OP if they &lt;em&gt;intended&lt;/em&gt; to allow them if it's not mentioned either way in the spec.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2015-11-10T14:43:51.640" LastActivityDate="2015-11-10T14:43:51.640" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7318" PostTypeId="1" CreationDate="2015-10-28T19:59:24.273" Score="7" ViewCount="403" Body="&lt;h3&gt;&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/25010646#25010646&quot;&gt;This conversation popped up in chat at one point.&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;There is a subtle (yet important) distinction between code golfing and sizecoding: code golfing is an attempt to reduce the &lt;em&gt;human readable source code&lt;/em&gt;, while sizecoding is an attempt to reduce the &lt;em&gt;machine code&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Is sizecoding under the general heading of &amp;quot;Programming Puzzles&amp;quot;, and therefore on topic, or not?&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-29T04:55:31.630" Title="Are Sizecoding Questions On Topic?" Tags="|discussion|asking-questions|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7320" PostTypeId="2" ParentId="7318" CreationDate="2015-10-28T22:46:57.313" Score="4" Body="&lt;p&gt;Sizecoding looks like in principle it should give an objective winning criterion, so it looks on-topic. I say &quot;&lt;em&gt;in principle&lt;/em&gt;&quot; because unless you require answers to be in assembly I'm not sure how reproducible the machine code would be.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2015-10-28T22:46:57.313" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7321" PostTypeId="1" CreationDate="2015-10-29T04:34:02.937" Score="9" ViewCount="643" Body="&lt;p&gt;&lt;strong&gt;Tl;dr:&lt;/strong&gt; I think my question on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/61903/code-the-huffman&quot;&gt;Huffman coding&lt;/a&gt; was &lt;em&gt;wrongly&lt;/em&gt; closed as duplicate and should be re-opened.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Early this week, I had the idea of posting a challenge based on Huffman coding. I found a very old question that was based on Huffman coding at the core, but the execution was different: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/996/huffman-golfing&quot;&gt;Huffman golfing&lt;/a&gt;. My idea of what the output should be was different, so I &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/24939350#24939350&quot;&gt;asked about it in chat&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Okay, so, there's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/996/huffman-golfing&quot;&gt;a really old question on Huffman encoding&lt;/a&gt;, which asks for a Huffman tree. What I had in mind was that programs would compute the Huffman coding and then output each character along with its binary representation, sorted from shortest/most frequent to longest/least frequent. Are these different enough that they wouldn't be duplicates?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Only one person responded, Thomas Kwa, who said:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;It would not be a duplicate, because you can't trivially modify answers to that question to answer your new question.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So I sandboxed it. The only response was a recommendation from feersum to add a time limit, which I did when I posted it, about 27 hours later.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then, much to my irritation, Peter Taylor closed it as duplicate with this comment:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I disagree with your note: it's the same question which for the existing answers requires a simple transformation of output format, and moreover any answer to this question is automatically an answer to the previous question.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;(The note being that the Huffman golfing question was not a duplicate because you can't trivially modify the existing answers to fit the new question.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I vocally disagreed with this in chat starting &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/24967509#24967509&quot;&gt;here&lt;/a&gt;. I'll summarize what I think are the strongest points:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are no CJam or Pyth answers on the old question. (They were created well after it.)&lt;/li&gt;&#xA;&lt;li&gt;It is better written because it gives an example for demonstration and has several test cases.&lt;/li&gt;&#xA;&lt;li&gt;The spec is better, which Martin &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/24969434#24969434&quot;&gt;said in chat&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;His comment that perhaps the old question could be closed as a duplicate of the newer one lead me to research this on this Meta. I found four Meta questions that seemed to be relevant.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1875/closing-old-question-as-duplicate-of-a-new-one&quot;&gt;Closing old question as duplicate of new one&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/824/duplicate-questions&quot;&gt;Duplicate questions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/777/are-two-questions-duplicates-if-they-have-different-scoring-rules/1876#1876&quot;&gt;Are two questions duplicates if they have different scoring rules?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5754/am-i-allowed-to-post-a-second-better-edition-of-a-challenge&quot;&gt;Am I allowed to post a second, better edition of a challenge?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The first doesn't have a particularly clear community consensus, but the (at-the-moment) positive score answer has this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;2&quot;&gt;&#xA;  &lt;li&gt;There may be users that would like to answer the new question that would not have wanted to answer the old question (because of the differences)&lt;/li&gt;&#xA;  &lt;li&gt;There may be users that would like to answer the new question that missed the old question. i.e. perhaps they only joined the site within the last month, or were just not online often enough before the question got knocked off the &quot;active/recent questions&quot; list. Are these users expected to go and search for old/inactive questions to answer?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;On the second, I'd like to say that I agree with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2108/12914&quot;&gt;xnor's answer&lt;/a&gt;. In particular:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;But if the new question is much better than the old one, closing it is a needless loss in quality for the site. I'd like for the duplicate policy to be more flexible, and allow a repeat of a question if the new one is significantly better than the old.&lt;br&gt;&#xA;  ...&lt;br&gt;&#xA;  Is this really serving the community interest? It's sad when someone posts a well thought-out, exactly-specified, test-cased question, and it's closed because the same challenge was posed in a question from 2011 with an ambiguous two-sentence spec and only a few mediocre answers.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I seriously believe that's the situation with the Huffman coding questions. Anyway, Martin's answer on the third sets forth a criteria that's repeated as community consensus on the fourth:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Can answers from one question be copied over to the other with little or no modification and still be competitive?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I honestly believe that the answer is &lt;strong&gt;&lt;em&gt;no&lt;/em&gt;&lt;/strong&gt; for the two Huffman coding questions. Only two of five users who posted on the old question have been around &lt;em&gt;this year&lt;/em&gt;, and one of those two hasn't been seen for months. This particular challenge idea would really benefit from being re-posted these days and I think it's not a good idea to simply edit the old one. (For one, I spent an hour writing that &quot;Code the Huffman!&quot; question and the original poster of the old one shouldn't get the reputation for it.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So yeah, that's my case for reopening the &quot;Code the Huffman!&quot; question.&lt;/p&gt;&#xA;" OwnerUserId="12914" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-11-01T12:52:45.310" Title="Should &quot;Code the Huffman!&quot; remain closed as a duplicate of a very old question?" Tags="|discussion|specific-question|duplicates|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7322" PostTypeId="1" AcceptedAnswerId="7327" CreationDate="2015-10-29T04:54:45.497" Score="10" ViewCount="131" Body="&lt;p&gt;There appears to be an inconsistency on our &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/participate-in-meta&quot;&gt;Meta privileges page&lt;/a&gt; in the Help Center!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The unflappable dev &lt;a href=&quot;https://codegolf.stackexchange.com/users/3/chris-jester-young&quot;&gt;Chris Jester-Young&lt;/a&gt; and our benevolent overlords in the SE Community Team have lowered PPCG's meta participation privilege reputation threshold to 1. Excellent news! That means that new users can post to the sandbox and ask questions about the site on Meta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem is now that the privileges page does not consistently reflect this. At the top it says that the privilege is awarded at 1 rep, but at the bottom of the page it explains why 5 rep is required. That's rather misleading.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Could someone please look into this?&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="68942" LastEditDate="2021-06-09T05:53:48.700" LastActivityDate="2021-06-09T05:53:48.700" Title="Meta privileges help page inconsistency" Tags="|bug|status-completed|meta|reputation|help-center|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7323" PostTypeId="2" ParentId="7318" CreationDate="2015-10-29T04:55:31.630" Score="11" Body="&lt;p&gt;Size coding is on topic; I agree with Peter Taylor that an objective winning criterion can be in theory formed. However, it doesn't seem to have many advantages over &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; questions, which as @mınxomaτ pointed out are &lt;a href=&quot;https://codegolf.stackexchange.com/search?tab=votes&amp;amp;q=x86%20machine%20code%20is%3aanswer&quot;&gt;commonly&lt;/a&gt; answered in machine code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some issues that may come up:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Interpreted languages are automatically excluded, and languages without short binaries won't be competitve. We generally discourage questions with language restrictions.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should competitors be forced to use a single language/compiler?&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What counts as machine code anyway? Should bytecode be allowed?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Optimizing an answer for size will require repeatedly making changes to the source, then recompiling and measuring the binary size. No one wants to do that.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Of course, there's another way to write answers for sizecoding challenges, which leads to a problem:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;What if people write the machine code first? It's possible to know the &lt;em&gt;exact machine code&lt;/em&gt; that is optimal or near-optimal for a given &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sizecoding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sizecoding&amp;#39;&quot; rel=&quot;tag&quot;&gt;sizecoding&lt;/a&gt; challenge, but not be able to write a program that compiles to it! Why should we restrict machine code submissions to those generatable by a compiler?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;For short challenges, this will probably be the case, and the challenge will be to get the compiler to spit out the correct thing.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is assuming inline assembly is disallowed. If it's allowed, solutions written in assembly &quot;in C&quot; will win every time, and their authors will essentially be golfing in machine code.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In conclusion, although it is not off-topic, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sizecoding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sizecoding&amp;#39;&quot; rel=&quot;tag&quot;&gt;sizecoding&lt;/a&gt; would eventually reduce to a more tedious form of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; in machine languages.&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2015-10-29T04:55:31.630" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7324" PostTypeId="2" ParentId="7321" CreationDate="2015-10-29T05:46:04.840" Score="-2" Body="&lt;h1&gt;No, it should be reopened&lt;/h1&gt;&#xA;&lt;p&gt;I have 3 main criteria that I use to decide if a question is a dupe (partially inspired by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1876/45941&quot;&gt;Martin's answer on the topic&lt;/a&gt;):&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Are old answers &lt;em&gt;valid&lt;/em&gt; in the new question, or can they be trivially transformed into answers for new questions? The definition of a trivial transformation is a bit subjective, though. If the old answer's output format can be easily modified to fit the new question, it's a trivial transformation. If the old answer's approach is still valid in the new question, it's &lt;em&gt;probably&lt;/em&gt; a trivial transformation. Almost always it's a judgement call, since it's not easy to define a cut-and-dry criteria.&lt;/li&gt;&#xA;&lt;li&gt;Are old answers &lt;em&gt;competitive&lt;/em&gt; in the new question? This mainly applies to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; (and probably others that I'm missing), but also somewhat to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, since CJam/Pyth answers may not be valid due to the languages being created after the question.&lt;/li&gt;&#xA;&lt;li&gt;Is the old challenge free of flaws that can be fixed by edits that won't invalidate answers? It's better to fix up the old question to meet our modern standards if possible, but it's not always possible without invalidating old answers. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7266/should-i-repost-a-revised-version-of-a-really-old-closed-challenge&quot;&gt;See this meta post&lt;/a&gt; for more discussion on this point.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;If the answer to all 3 is &amp;quot;yes&amp;quot;, then the new challenge is a dupe in my eyes. If not, then it isn't.&lt;/p&gt;&#xA;&lt;p&gt;By these critera, I do not see your question as a duplicate.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The old answers are not valid in the new question. Whether or not they are trivially transformable is a bit of a difficult call. To me, this is right on the line; it's simple in theory to generate the Huffman codes for the characters from the tree, but transforming the output of one of the old answers to meet the new format would likely involve just as much code as the answers themselves, and a fresh answer would likely do better.&lt;/li&gt;&#xA;&lt;li&gt;The old answers might be competitive in the new question, but I would expect new answers (especially in CJam/Pyth, which came after the old question) to do significantly better than the old answers.&lt;/li&gt;&#xA;&lt;li&gt;The old challenge doesn't have any flaws (other than what I consider poor formatting, but that's minor), and so there's no reason to edit it to match your specifications. Such an edit would invalidate &lt;em&gt;every&lt;/em&gt; answer on that question, and so would be a very bad move.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-29T05:46:04.840" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7325" PostTypeId="2" ParentId="2140" CreationDate="2015-10-29T06:17:33.653" Score="2" Body="&lt;h1&gt;Two mountain hikers want to meet, but must stay at the same altitude&lt;/h1&gt;&#xA;&lt;p&gt;This question is totally inspired by &lt;a href=&quot;https://puzzling.stackexchange.com/questions/23608/hikers-meeting-in-the-middle&quot;&gt;this question on Puzzling SE&lt;/a&gt;. For ease, I have reproduced the original question here:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Two hikers are separated by a two-dimensional mountain range, like the one shown below. The mountain range alternates between peaks and valleys, connected by straight lines.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/u0G3I.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/u0G3I.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Both hikers are at sea level, and the mountain range never dips below sea level.&lt;/p&gt;&#xA;&lt;p&gt;The two hikers want to meet up with each other. Prove that they can do this &lt;em&gt;while staying at the same altitude as each other for their entire journey.&lt;/em&gt; They are allowed to backtrack.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Source:&lt;/strong&gt; &lt;a href=&quot;http://www.cs.cmu.edu/puzzle/puzzle12.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.cs.cmu.edu/puzzle/puzzle12.html&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Input/Output&lt;/h2&gt;&#xA;&lt;h3&gt;Meta: what input/output format would be better?&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Continuous:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input: a list of ordered pairs &lt;code&gt;(x,y)&lt;/code&gt; that represent the peaks and valleys.&lt;/li&gt;&#xA;&lt;li&gt;Output: a sequence of positions where one hiker or both changes direction, formatted like so:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;(x1 y1) (u1 v1)&#xA;(x2 y2) (u2 v2)&#xA;(x3 y3) (u3 v3)&#xA;...&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Discrete:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input: a sequence of heights that represent the height of the terrain (with no flat portions). (I.e., &lt;code&gt;0 1 2 3 4 5 4 3 4 5 6 7 6 5 6 5 4 3 2 3 2 1 0&lt;/code&gt;, maybe with steps larger than 1?)&lt;/li&gt;&#xA;&lt;li&gt;Output: the left/right moves each hiker has to make, outputted like&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;L R&#xA;L L&#xA;L L&#xA;R L&#xA;...&lt;/pre&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Scoring is in bytes.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Bonus:&lt;/strong&gt; -5% if your program produces optimal solutions.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Meta:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'm pretty sure this is not a duplicate, but still, is it?&lt;/li&gt;&#xA;&lt;li&gt;I'd like a better title. Would &amp;quot;Mountain Hikers&amp;quot; be good enough?&lt;/li&gt;&#xA;&lt;li&gt;Any other feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12914" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-10-29T06:17:33.653" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7326" PostTypeId="2" ParentId="7321" CreationDate="2015-10-29T09:40:59.817" Score="16" Body="&lt;p&gt;&lt;strong&gt;TL;DR:&lt;/strong&gt; They &lt;em&gt;are&lt;/em&gt; duplicates. Close the old one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First, I'd like to clarify that I do think the questions are duplicates. I agree with Peter that a difference in the output format counts as a &quot;minor modification&quot; to existing answers, unless the output formatting is the core of the challenge (which arguably it isn't in this case). So the criterion you're quoting me with (&quot;Can answers from one question be copied over to the other with little or no modification and still be competitive?&quot;), I would answer with &quot;yes&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To address some of your other arguments&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;There are no CJam or Pyth answers on the old question. (They were created well after it.)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't think that should be a valid reason for reposting a challenge. New languages are created all the time, which would basically mean we can repost any challenge any time because &quot;this new language or version couldn't be used on the old challenge&quot;. I agree that our rules for using newer challenges are sometimes counter productive because they aim to close a very specific loophole (someone creating a language or adding features to solve a specific challenge with a built-in), but more often than not they prevent legitimate languages from participating. This is why I would like to see the spirit of this community to go more towards &quot;each challenge is a competition within each language&quot;, because then it doesn't matter if the problem is particularly trivial (read: boring) in one special-purpose language. Anyway, I digress...&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;blockquote&gt;&#xA;    &lt;p&gt;Are these users expected to go and search for old/inactive questions to answer?&lt;/p&gt;&#xA;  &lt;/blockquote&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Yep. That's why we archive our challenges and most challenges don't have deadlines. Especially &lt;em&gt;when&lt;/em&gt; someone posts a new similar or identical challenge, the old one will surely be linked by more experienced users and can then more easily be found. (Honestly, I disagree with the entire answer this was quoted from.)&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Only two of five users who posted on the old question have been around this year, and one of those two hasn't been seen for months.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't think this is a valid argument either. For one thing, anyone else could copy their answers, for another this still leaves the issue of answers to the new challenge being copied over to the old one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One more from a comment of yours on the question:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Finally, the other question is four years old. It'd be good to have a fresh version.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Not an argument either if there is nothing wrong with the old challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So in summary, &lt;strong&gt;yes, I think they are duplicates.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;But...&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;As I said in chat:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Maybe this would be a good time to close an old question as a duplicate?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Like the first question linked in the OP shows, I find it odd that we have no culture of closing old questions as duplicates of new ones (and unfortunately, I picked a specific case in the other question where things weren't so clear cut as here). It's reasonably common practice on any other SE. If the new question is better, close the old one. The same should go for PPCG.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your new question is indeed much better. It has a more solid spec (which is up to today's standards), it has test cases, it's better explained and motivated. So why don't we close the old one as a duplicate of yours?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On my older meta question, Peter raised the issue of what would happen to the old answers. In this case, with only 5 answers, I don't think this is an issue, but even in general, I'd rather see people copying the answers over to the new challenge if that means we can in the future have a better challenge for this particular topic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another issue this might raise is that people would just start rehashing &lt;em&gt;loads&lt;/em&gt; of old questions, claiming they have some minor flaw here or there and redoing the challenge. So I would propose some guidelines:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If the new challenge was posted in good faith (not knowing that a duplicate already exists), read both challenges in detail and vote to close the worse of the two. We're not improving our content quality by blindly shooting down the new one. One unfortunate example here, was &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7297/8478&quot;&gt;a recent sandbox proposal&lt;/a&gt; by a new user (needs privileges to see deleted posts), which was much better than the existing challenge, but was abandoned because it would likely have been closed as a duplicate.&lt;/li&gt;&#xA;&lt;li&gt;If the differences between the challenges (in terms of quality) are minor, close the new one, in the interest of keeping all the existing answers in their place. More likely than not such minor flaws can be addressed by an edit to the old challenge.&lt;/li&gt;&#xA;&lt;li&gt;If there are serious issues with the old challenge, close it anyway. We need a way to deliberately supersede old challenges that are not up to today's standards. My favourite example for this is &lt;a href=&quot;https://codegolf.stackexchange.com/q/31793/8478&quot;&gt;our &lt;code&gt;cat&lt;/code&gt; challenge&lt;/a&gt; which under our current policies prevents us from having a &quot;good&quot; &lt;code&gt;cat&lt;/code&gt; challenge, because this one exists but its flaws don't warrant closing it. I am currently sandboxing a new version to replace this, but so far we don't have any notable precedent of this happening.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2015-11-01T12:52:45.310" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7327" PostTypeId="2" ParentId="7322" CreationDate="2015-10-29T11:07:42.553" Score="7" Body="&lt;p&gt;A 5 has been changed into a 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That is all.&lt;/p&gt;&#xA;" OwnerUserId="8608" LastActivityDate="2015-10-29T11:07:42.553" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7328" PostTypeId="2" ParentId="7321" CreationDate="2015-10-29T11:49:18.390" Score="-2" Body="&lt;p&gt;I agree with all of Martin's reasoning as to why they are duplicates.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I don't think there's a strong case for closing the old question in favour of the new one. That would fragment the answers (unless the people who posted answers on the old question update them for the new output format and copy them across - but you argue that this is unlikely because most of them are no longer active).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Instead, I will repeat a comment I made on one of the posts you cited.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;There are &lt;em&gt;four&lt;/em&gt; ways to bring attention to an old challenge: chat, bounty, posting your own answer, and posting a dupe.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If you want to revive the topic of Huffman coding, you can post a bounty on the old question for the shortest answer which uses your output format and which doesn't use a language newer than two days ago.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2015-10-29T11:49:18.390" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7334" PostTypeId="1" AcceptedAnswerId="7336" CreationDate="2015-10-29T23:57:29.640" Score="13" ViewCount="302" Body="&lt;p&gt;What is the best message to notify a new user with an issue with their post (via a comment) while posting a(n)...&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Challenge (unclear specs/questionable)&lt;/li&gt;&#xA;&lt;li&gt;Challenge (duplicate)&lt;/li&gt;&#xA;&lt;li&gt;Challenge (off-topic)&lt;/li&gt;&#xA;&lt;li&gt;Answer to a challenge.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="36670" LastEditorUserId="36670" LastEditDate="2015-10-30T00:01:05.053" LastActivityDate="2020-01-23T04:30:09.740" Title="Standard New User Welcome Messages" Tags="|discussion|new-users|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7336" PostTypeId="2" ParentId="7334" CreationDate="2015-10-30T00:23:25.520" Score="17" Body="&lt;p&gt;I always start by welcoming the new user. It's best to make users feel welcome in the community and not to sound hostile. I also always recommend the Sandbox (especially now that there's no rep limit).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For specific issues:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Unclear&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Welcome to Code Golf and Coding Challenges! This challenge could use a bit of clarification. For example, (insert specific issues here). I recommend posting future challenges to the &lt;code&gt;[Sandbox](http://meta.codegolf.stackexchange.com/questions/2140/sandbox-for-proposed-challenges)&lt;/code&gt; where they can get meaningful feedback before being posted to the main site.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Duplicate&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Welcome to Code Golf and Coding Challenges! Unfortunately this challenge is too similar to &lt;code&gt;[Challenge Name](link to existing challenge)&lt;/code&gt; to warrant a separate post. I recommend posting future challenges to the &lt;code&gt;[Sandbox](http://meta.codegolf.stackexchange.com/questions/2140/sandbox-for-proposed-challenges)&lt;/code&gt; where they can get meaningful feedback before being posted to the main site.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Off-topic&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Welcome to Code Golf and Coding Challenges! This site is for programming competitions, not for general programming questions. For those you can try &lt;code&gt;[Stack Overflow|Super User|Other SE Site](link)&lt;/code&gt;, but make sure to check out their Help Center first to ensure your question is on topic. Thanks!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Answer&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Welcome to Code Golf and Coding Challenges! This doesn't quite meet the requirements of the challenge since [specific issues]. &lt;strong&gt;&lt;em&gt;OR&lt;/em&gt;&lt;/strong&gt; Submissions on this site must [specific issue with link to meta].&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="78850" LastEditDate="2020-01-23T04:30:09.740" LastActivityDate="2020-01-23T04:30:09.740" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="7338" PostTypeId="1" AcceptedAnswerId="7339" CreationDate="2015-10-30T14:06:35.160" Score="8" ViewCount="213" Body="&lt;p&gt;In the Code Golf Overflow, can your answers be written in any language unless otherwise specified by the OP?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or do they have to be written in any specific language?&lt;/p&gt;&#xA;" OwnerUserId="46705" LastEditorUserId="46705" LastEditDate="2015-11-01T03:00:06.897" LastActivityDate="2015-11-01T03:00:06.897" Title="Specific Languages" Tags="|discussion|code-golf|answers|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7339" PostTypeId="2" ParentId="7338" CreationDate="2015-10-30T18:27:50.043" Score="11" Body="&lt;h2&gt;Yes! They can (usually) be in any language.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Submissions can use any programming language that meets &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/20469&quot;&gt;our criteria for qualifying as a language&lt;/a&gt;. We also require that the version of the language you use be released &lt;em&gt;prior&lt;/em&gt; to the posting of the challenge. This ensures that people don't see a challenge and implement a feature in their language just to be competitive in that challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Language-specific or language-restricted challenges are generally frowned upon here, so it's not often that you'll find a challenge where you can't use your favorite language.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.313" LastActivityDate="2015-10-30T18:27:50.043" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7341" PostTypeId="2" ParentId="2140" CreationDate="2015-10-30T21:14:31.390" Score="0" Body="&lt;p&gt;&lt;strong&gt;Goal&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal is to stitch several ordered lists of numbers into a single list that contains each of those lists as a contiguous sublist, with the numbers in the same order without gaps. The resulting list should be as short as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;n&lt;/em&gt; ordered lists of numbers between &lt;code&gt;-2^63&lt;/code&gt; and &lt;code&gt;2^63-1&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Ouput&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A minimum-length list so that each input list appears within that list with its elements in the same order without gaps&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1, 2, 3] [3, -38, 23424, 292] [0, 1, 2] [-38]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[0, 1, 2, 3, -38, 23424, 292]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The output contains each of the input lists:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[0, 1, 2, 3, -38, 23424, 292]&#xA;   [1, 2, 3]&#xA;         [3, -38, 23424, 292]&#xA;[0, 1, 2]&#xA;            [-38]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="46724" LastEditorUserId="20260" LastEditDate="2015-10-31T07:26:36.430" LastActivityDate="2015-10-31T07:26:36.430" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7342" PostTypeId="2" ParentId="2140" CreationDate="2015-10-30T23:43:42.570" Score="3" Body="&lt;h1&gt;Planting Steiner Trees&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;algorithm&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the following we are talking about &#xA;Steiner trees, which are similar to minimal spanning trees: The goal is connecting all nodes via some paths such that the resulting graph that is as short as possible. In contrast to minimal spanning trees when constructing steiner trees you can add additional nodes. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the following we are talking about points in the real 2d plane and when we are talking about distances and lengths, we are talking about the &lt;em&gt;euclidean distance&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, a graph will comprise a set of points where the edges are straight lines between pairs of those points. The length of a graph will be the sum of the length of all edges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So a steiner tree is a shortest graph connecting all given points possibly with inserting additional points. The following image shows the difference between a minimall spanning tree (blue) and a steiner tree (red).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is known that it is very difficult to find steiner trees.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/MFB4j.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/MFB4j.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program that accepts a list of 2d points and tries to find/approximate a steiner tree of minimal length connecting those points by possibly introducing more points. (It does not have to find the an actual steiner tree.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program should output a list of all the points (including coordinates) of the constructed graphs, a list of all edges (including their lengths), the total length of the graph and a graphical representation of the grap.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program should have a running time of no more than about half a minute for each of the examples on a reasonable computer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should also explain how your algorithm works.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The program must be evaluated on all the [NOT YET] given test cases. The score is the sum of the total length of all test cases. The lowest score wins.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Square:&#xA;(0,0),(0,1),(1,1),(1,0)&#xA;&#xA;Nonagon:&#xA;(cos(2*pi*a/9),sin(2*pi*a/9)) for a = 0,1,...,8&#xA;&#xA;Ladder:&#xA;(0,0),(0,1),(1,0),(1,1),(2,0),(2,1),(3,0),(3,1),(4,0),(4,1),(5,0),(5,1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Meta: I need to find a good set of test cases. Suggestions are appreciated.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If you have any suggestions, feel free to edit/add. Any improvements of the text are appreciated too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;@El'endia Starman Pointed out some &lt;a href=&quot;https://math.stackexchange.com/questions/1043910/what-would-a-steiner-tree-look-like-for-the-vertices-of-a-heptagon&quot;&gt;interesting n-gon configurations&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2019-09-01T14:40:04.323" LastActivityDate="2019-09-01T14:40:04.323" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="7344" PostTypeId="2" ParentId="2140" CreationDate="2015-10-31T09:19:18.713" Score="0" Body="&lt;h1&gt;Hello, World! Fitted in cases.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hello-world&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hello-world&amp;#39;&quot; rel=&quot;tag&quot;&gt;hello-world&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to take a line of input and print &lt;code&gt;Hello,world!&lt;/code&gt; multiple times fitted to length of input. The cases of that character is fitted to input in same position(except shifted from deletion). If the corresponding character is non-alphabeth, you must use default case(lowercase except for &quot;h&quot; that is uppercase). And for punctuations, if the corresponding character is not punctuation, it will deleted. And if the corresponding character is space, the the ouput is space but it doesn't skip the &quot;Hello,world&quot; writing.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hello, world!&#xA;Hello, world!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;About punctuation deletion and space insertion&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;I have a dog. I name it Underdog.&#xA;H ello w orld H ello wo Rldhellow&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Explanation&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Ihaveadog.InameitUnderdog.&#xA;Hello,worlD!hello,world!hellow&#xA;Helloworld!hello,World!hellow&#xA;HelloworldHello,wOrld!hellow&#xA;HelloworldHellowoRld!hellow&#xA;HelloworldHellowoRldhellow&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Other examples&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.....&amp;amp;^&amp;amp;%&amp;amp;*%&amp;amp;(&amp;amp;)^$#()&amp;amp;#()&amp;amp;@#)*%)#1-&#xA;Hello,world!Hello,world!Hello,world&#xA;&#xA;UPPERCASES&#xA;HELLOWORLD&#xA;&#xA;lowercases&#xA;helloworld&#xA;&#xA;Abdeg,fGhiJ.&#xA;Hello,wOrlD!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Example Program&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here is ungolfed version of example program in Python. If there is error, correct me.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;p=readline()&#xA;h=&quot;Hello, world&quot;&#xA;i=0&#xA;k=&quot;&quot;&#xA;for a in xrange(len(p)):&#xA;    if p[a]==&quot; &quot;:&#xA;        k=k+&quot; &quot;&#xA;        continue&#xA;    if isUpper(p[a]):&#xA;        if isAlpha(h[i]):&#xA;            k=k+upper(h[i])&#xA;        i=i+1&#xA;        continue&#xA;    if isLower(p[a]):&#xA;        if isAlpha(h[i]):&#xA;            k=k+lower(h[i])&#xA;        i=i+1&#xA;        continue&#xA;    k=k+h[i]&#xA;    i=i+1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Question&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This language is surely need to be fixed.&lt;/p&gt;&#xA;" OwnerUserId="46245" LastActivityDate="2015-10-31T09:19:18.713" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7350" PostTypeId="1" CreationDate="2015-11-01T02:50:07.267" Score="2" ViewCount="333" Body="&lt;p&gt;In the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2028/what-are-programming-languages&quot;&gt;What are programming languages?&lt;/a&gt; meta post we seem to have come to the consensus &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/26997&quot;&gt;put forth by Peter Taylor&lt;/a&gt; that:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A purported programming language should be accepted as such if and&#xA;  only if it is capable of addition of natural numbers and primality&#xA;  testing of natural numbers.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/26997&quot;&gt;Peter's post&lt;/a&gt; goes into more depth but the point is that not just anything  one might want to call a programming language counts as a valid language you can answer in here on &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;PPCG&lt;/a&gt;. The main exception to this rule is when the original poster of a challenge specifically allows languages that would otherwise be forbidden.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem I see, however, is that there may be many old answers on this site that use languages that are now considered forbidden. A user, especially a new user, could easily see these answers and assume that the language is allowed (perhaps never having seen Peter's post). Then when they answer in that language they will be disheartened by downvotes and fussy comments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, if a user wants to answer in a relatively uncommon language that they may just be learning, it might not be clear if the language satisfies our definition of a programming language or not. For example, if someone is just trying to output &lt;code&gt;Hello, world!&lt;/code&gt; then their focus will not be on proving that the language can generate primes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I suggest we make a list of supposed &quot;programming languages&quot; that are forbidden by default here on PPCG so all users can easily make sure their languages are valid without wasting time writing an entire answer or specifically asking on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/&quot;&gt;meta&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each answer here should cover one purported programming language (or a group of highly related languages) and explain why it doesn't satisfy our criteria. This is not the place to invalidate languages you don't like. Only languages that clearly do not satisfy our definition of a programming languages should be posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answers here only invalidate languages if they have a score (upvotes minus downvotes) of at least three. This ensures that no single person can invalidate a language. (I'm completely fine with changing this +3 vote threshold.)&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-11-02T05:08:52.010" Title="Programming languages that do not match our default posting criteria" Tags="|discussion|policy|answers|" AnswerCount="5" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7351" PostTypeId="2" ParentId="7350" CreationDate="2015-11-01T03:13:32.900" Score="4" Body="&lt;h2&gt;&lt;a href=&quot;http://esolangs.org/wiki/HQ9+&quot; rel=&quot;nofollow&quot;&gt;HQ9+ and variants&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Let's go through these one-by-one:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://esolangs.org/wiki/HQ9+&quot; rel=&quot;nofollow&quot;&gt;HQ9+&lt;/a&gt; is only capable of printing &lt;code&gt;hello, world!&lt;/code&gt;, the program's source code, and 99 Bottles of Beer. This fails miserably to meet our standards.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://esolangs.org/wiki/HQ9%2B%2B&quot; rel=&quot;nofollow&quot;&gt;HQ9++&lt;/a&gt; is functionally identical to HQ9+, and so also is forbidden.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://esolangs.org/wiki/CHIQRSX9%2B&quot; rel=&quot;nofollow&quot;&gt;CHIQRSX9+&lt;/a&gt; adds a few more commands, but still does not meet our standards, without the &lt;code&gt;X&lt;/code&gt; instruction. The &lt;code&gt;X&lt;/code&gt; instruction is vaguely defined and implementation-specific; the Perl implementation provided simply randomly modifies the input and attempts to run it as Perl code (which is not guaranteed to work, and the functionality will change each run). Still not valid.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://esolangs.org/wiki/HQ9%2BB&quot; rel=&quot;nofollow&quot;&gt;HQ9+B&lt;/a&gt; adds the &lt;code&gt;B&lt;/code&gt; command, which interprets the input as a &lt;a href=&quot;http://esolangs.org/wiki/Brainfuck&quot; rel=&quot;nofollow&quot;&gt;Brainfuck&lt;/a&gt; program. It's not a programming language; it's a Brainfuck interpreter, and thus fails to meet the requirements.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://esolangs.org/wiki/HQ9%2B2D&quot; rel=&quot;nofollow&quot;&gt;HQ9+2D&lt;/a&gt; is ostensibly the same as HQ9+, but interprets input in a 2D, Befunge-inspired fashion. Once again, still not valid.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2015-11-01T03:13:32.900" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7352" PostTypeId="1" CreationDate="2015-11-01T04:41:00.917" Score="15" ViewCount="410" Body="&lt;p&gt;Let's say I have a challenge that is difficult. Indeed, people may believe it to be impossible, since it is somewhat obscure. Should I provide a completely non-golfed answer, sort of as a hint, to show its possible. It makes sense to not golf 1) it is easy to understand (which would be the point of such an answer) and 2) it does not give away any golfing tips for that challenge (and also will not prevent them from not doing something so as to not copy me).&lt;/p&gt;&#xA;" OwnerUserId="16842" LastActivityDate="2015-11-01T12:51:38.953" Title="If a challenge is difficult, can I provide a completely non-golfed answer?" Tags="|discussion|code-golf|answers|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7353" PostTypeId="2" ParentId="6918" CreationDate="2015-11-01T04:44:20.107" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;http://molarmanful.github.io/ESMin&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/molarmanful/ESMin&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github repo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://molarmanful.github.io/ESMin/docs/interpreter2.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Annotated source (version 2)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://molarmanful.github.io/ESMin/interpreter2.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Interpreter (Firefox only, version 2)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://molarmanful.github.io/ESMin/interpreter.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Interpreter (Firefox only, version 1)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt; is a code-golfing language I made in late October 2015. It compiles to ES6 - in fact, it's basically ES6 except with a stack, basic aliasing, and a whole lot syntax changes. Of course, it's a work-in-progress, but version 1 is stable enough for general use.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;WARNING&lt;/strong&gt;: The printable non-ASCII values that  uses can create disproportionate byte-to-char ratios. Treat this as a challenge of some sort.&lt;/p&gt;&#xA;&lt;p&gt;Quick example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ⒶṤć⇀⧺_&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This outputs 1 to 100.&lt;/p&gt;&#xA;" OwnerUserId="41247" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-04T04:47:38.613" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7354" PostTypeId="2" ParentId="7350" CreationDate="2015-11-01T04:54:08.583" Score="16" Body="&lt;h1&gt;&lt;a href=&quot;http://esolangs.org/wiki/MetaGolfScript&quot; rel=&quot;nofollow noreferrer&quot;&gt;MetaGolfScript and Co.&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;I would go through them one by one if I could, but I can't &lt;code&gt;:P&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;It's great for lolz, but ruins the fun when implemented in code-golf challenges. (I mean, who wants zero-byte answers anyway?)&lt;/p&gt;&#xA;" OwnerUserId="41247" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-01T04:54:08.583" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7356" PostTypeId="2" ParentId="7350" CreationDate="2015-11-01T10:52:52.343" Score="6" Body="&lt;h1&gt;Encodings such as base64&lt;/h1&gt;&#xA;&lt;p&gt;Base64 is an encoding, decoded by the base64 decoder. It literally isn't a programming language at all.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-01T10:52:52.343" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7357" PostTypeId="2" ParentId="7350" CreationDate="2015-11-01T11:03:25.037" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;http://esolangs.org/wiki/Text&quot; rel=&quot;nofollow noreferrer&quot;&gt;Text&lt;/a&gt;, aka Cat&lt;/h1&gt;&#xA;&lt;p&gt;It's the language that every program written in it is a quine, and you can't write programs to do anything else. (But there is also a language that satisfies the criteria also named Cat.)&lt;/p&gt;&#xA;&lt;p&gt;And most answers in Text probably also works in PHP or /// anyway.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-01T11:03:25.037" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7359" PostTypeId="2" ParentId="7352" CreationDate="2015-11-01T12:51:38.953" Score="22" Body="&lt;p&gt;Yes, but don't make it an answer. If you have a reference implementation whose only purpose is to show what is being asked, but which doesn't respect the winning criterion at all, it's not an answer by our standards. Quoting the help centre:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;All solutions to challenges should:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Correctly implement the required specification.&lt;/li&gt;&#xA;  &lt;li&gt;Be a serious contender for the winning criteria in use. For example, an entry to a code golf contest needs to be golfed, and an entry to a speed contest should make some attempt to be fast.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If it doesn't do that, it's not an entry to the challenge, so it shouldn't be an answer. Just include it in the challenge itself at the bottom.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course it's also completely fine to participate in your own challenge and submit a golfed version of your reference implementation. Just don't encourage others to submit answer along the lines of &quot;I couldn't be bothered to golf this, but hey I solved it!&quot;.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-11-01T12:51:38.953" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7360" PostTypeId="2" ParentId="7350" CreationDate="2015-11-01T14:34:35.490" Score="11" Body="&lt;h1&gt;Precisely the languages that don't satisfy our definition&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;An exhaustive list of non-programming languages will never be up-to-date; literally &lt;em&gt;anybody&lt;/em&gt; can create a new &quot;programming&quot; language. Even &lt;em&gt;trying&lt;/em&gt; to keep up would require considerable effort from the community.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The problem I see, however, is that there may be many old answers on this site that use languages that are now considered forbidden. A user, especially a new user, could easily see these answers and assume that the language is allowed (perhaps never having seen Peter's post).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I agree the vast amount of rules we have in the help center, the wikis and here on meta can be overwhelming for a new user, but adding yet another post every new user should know about doesn't really solve that problem. A new user can miss this thread just as easily as Peter's post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To make matter worse, we would be replacing a unique criterion for all existing and future languages with a &lt;em&gt;continuously changing&lt;/em&gt; list. Languages might get forbidden all of the sudden, so even established users could use a recently forbidden language by accident. This will make matters more confusing, not less.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Additionally, if a user wants to answer in a relatively uncommon language that they may just be learning, it might not be clear if the language satisfies our definition of a programming language or not. For example, if someone is just trying to output &lt;code&gt;Hello, world!&lt;/code&gt; then their focus will not be on proving that the language can generate primes.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;A primality test can indeed be a bit complicated in some langauges, even if possible. If you think that Peter's definition is too complex, we could try too come up with a simpler one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, printing a fixed string is essentially a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenge, and the current consensus on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/3610&quot;&gt;Should answers to fixed-output challenges be written in a programming language?&lt;/a&gt; is that the restriction to actual programming languages does not apply to those challenges anyway.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, I'm worried that the whole idea of voting on languages is just too arbitrary. Somebody might &amp;ndash; at some point &amp;ndash; add actual programming languages to this post. Given the great amount of support for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/286&quot;&gt;J and GolfScript suck all the enjoyment out of Code Golf&lt;/a&gt; and the low threshold of &lt;strong&gt;+3&lt;/strong&gt; to forbid a language by default, I might wake up one day to find out that I cannot use Pyth or CJam anymore.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Requiring a &lt;strong&gt;2 : 1&lt;/strong&gt; ratio like the standard loopholes do would help with this issue, but new users see only the score, not the vote breakdown. Increasing the threshold to &lt;strong&gt;+n&lt;/strong&gt; doesn't help either; &lt;strong&gt;+11/-1&lt;/strong&gt; is clear consensus, but &lt;strong&gt;+110/-100&lt;/strong&gt; is not.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2015-11-02T05:08:52.010" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7363" PostTypeId="2" ParentId="2140" CreationDate="2015-11-01T20:28:43.037" Score="0" Body="&lt;h1&gt;How am I doing?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;My boss is a flashy sort of fellow. He likes all things animated.&lt;/p&gt;&#xA;&lt;p&gt;He's asked me to write a progress bar to show the completeness of our super-secret project.&lt;/p&gt;&#xA;&lt;p&gt;Now with me being me, I'm getting you to write this for me and showing the best one to my boss.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output a progress bar to stdout.&lt;/li&gt;&#xA;&lt;li&gt;Whenever a newline is sent to stdin, increase the percentage on the percentage bar by 1%&lt;/li&gt;&#xA;&lt;li&gt;If not already enabled and if possible in your language, set the terminal mode to non-echoing (stdin doesn't automatically get shown, think like when your typing in your password for sudo)&lt;/li&gt;&#xA;&lt;li&gt;You may not assume the cursor is in a certain position, it must produce a progress bar relative to where you started the program (no absolute jumps)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;To help you, you may use &lt;a href=&quot;https://en.wikipedia.org/wiki/ANSI_escape_code#CSI_codes&quot; rel=&quot;nofollow noreferrer&quot;&gt;ANSI escape codes&lt;/a&gt;, &lt;a href=&quot;https://en.wikipedia.org/wiki/ANSI_escape_code#Colors&quot; rel=&quot;nofollow noreferrer&quot;&gt;ANSI colour codes&lt;/a&gt; and any UTF-32 unicode points.&lt;/p&gt;&#xA;&lt;p&gt;The winner is the entry with the most upvotes.&lt;/p&gt;&#xA;&lt;h3&gt;Sandbox Notes:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this too broad? - I'm sticking to ANSI only but I'm not saying anything else about what it looks like.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="32686" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-01T20:28:43.037" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="7364" PostTypeId="2" ParentId="2140" CreationDate="2015-11-01T22:09:33.773" Score="-2" Body="&lt;h1&gt;Literally just printing the source code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Wait a second. We already have a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69/golf-you-a-quine-for-great-good&quot;&gt;contest&lt;/a&gt; where you print the source code. Right? Wrong.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Print out the source code. Not to STDOUT, but to a physical printer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must write a complete program that prints out its own source code with a printer connected to the computer.&lt;/li&gt;&#xA;&lt;li&gt;No STDIN (or input of any kind), STDOUT, or STDERR.&lt;/li&gt;&#xA;&lt;li&gt;No standard loopholes (includes no file input). No using lp(r/d) or similar commands.&lt;/li&gt;&#xA;&lt;li&gt;The printed code should be a reasonable size (between size 8 and 18) and a legible font (pretty much means no wingdings). &lt;/li&gt;&#xA;&lt;li&gt;You may assume that the user doesn't cancel the process and answers affirmatively to any system print dialogs.&lt;/li&gt;&#xA;&lt;li&gt;You can assume that the printer works, is ready, doesn't need new ink/paper, etc.&lt;/li&gt;&#xA;&lt;li&gt;If the language doesn't support printing, it is ineligible.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest code, in bytes, wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41505" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.563" LastActivityDate="2015-11-01T22:24:27.230" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7365" PostTypeId="2" ParentId="2140" CreationDate="2015-11-02T00:12:28.647" Score="3" Body="&lt;h1&gt;Approximate phi using Fibonacci numbers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fibonacci&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fibonacci&amp;#39;&quot; rel=&quot;tag&quot;&gt;fibonacci&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As shown by Johannes Kepler, the quotient of successive Fibonacci numbers approaches phi.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://upload.wikimedia.org/math/0/d/2/0d28afc97e00939a78d4f7d95a4fc46d.png&quot; alt=&quot;Thanks, Wikipedia.&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(where F(n) = the nth Fibonacci number)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The fine folks at &lt;a href=&quot;https://en.wikipedia.org/wiki/Fibonacci_number#Limit_of_consecutive_quotients&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt; also say that if you choose two different starting values for the Fibonacci sequence, this expression still holds.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Last, but not least, if you use a later number in the series in the numerator, you get some interesting properties:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://upload.wikimedia.org/math/f/c/5/fc5647548c65e9d7734621aa7ecd3e48.png&quot; alt=&quot;Thanks again, wikipedia&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Create a full program or function that approximates phi using Fibonacci numbers.&lt;/li&gt;&#xA;&lt;li&gt;The program or function will take a single integer, n (unless a bonus is applied). It will output to STDOUT as follows, stopping when it reaches n:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;&#xA;1/1=1&#xA;2/1=2&#xA;3/2=1.5&#xA;5/3=1.66666666&#xA;...&#xA;F(n+1)/F(n)=...&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Fibonacci numbers must be calculated using iteration or recursion.&lt;/li&gt;&#xA;&lt;li&gt;No built-ins / standard loopholes, and neither the square root function nor phi should appear in the source code.&lt;/li&gt;&#xA;&lt;li&gt;It is OK if floating point limitation/integer overflow prevent accuracy beyond 4 or 5 digits, but you should use the most precise primitive data type (yes, double is one character longer than float).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There are two bonuses that you can earn, for a total of a 25% lower score:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input two additional integers as starting values for the Fibonacci sequence. This will still converge on phi, though it may take a bit longer. Reward: -10%.&lt;/li&gt;&#xA;&lt;li&gt;Input one additional integer for &lt;em&gt;a&lt;/em&gt; in the above formula. This will result in the sequence converging to phi^a. Reward: -15%.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Total score is the size of the program, in bytes, minus any bonuses. Since this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, lowest score wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Insert leaderboard snippet)&#xA;(Insert example snippet)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example implementation snippet:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;document.getElementById(&quot;button&quot;).addEventListener(&quot;click&quot;, process, false);&#xD;&#xA;&#xD;&#xA;function process() {&#xD;&#xA;  //Store field values to vars&#xD;&#xA;  var itrNum = parseInt(document.getElementById(&quot;itrNum&quot;).value);&#xD;&#xA;  var prevNum = parseInt(document.getElementById(&quot;start1&quot;).value);&#xD;&#xA;  var curNum = parseInt(document.getElementById(&quot;start2&quot;).value);&#xD;&#xA;  var aNum = parseInt(document.getElementById(&quot;aVal&quot;).value);&#xD;&#xA;  document.write(&quot;(Click \&quot;Run\&quot; to reset)&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&quot;);&#xD;&#xA;&#xD;&#xA;  //Iterate through each fibbonacci number&#xD;&#xA;  for (var i = 0; i &amp;lt; itrNum; i++) {&#xD;&#xA;&#xD;&#xA;    dispNum = getFutureItr(prevNum, curNum, aNum);&#xD;&#xA;    document.write(dispNum + &quot; / &quot; + prevNum + &quot; = &quot; + dispNum / prevNum + &quot;&amp;lt;br&amp;gt;&quot;);&#xD;&#xA;    //prepare numbers for next iteration&#xD;&#xA;    var tempNum = curNum + prevNum;&#xD;&#xA;    prevNum = curNum;&#xD;&#xA;    curNum = tempNum;&#xD;&#xA;  }&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;//Helper function for F(n+a)&#xD;&#xA;function getFutureItr(prevNum,&#xD;&#xA;  curNum,&#xD;&#xA;  aNum) {&#xD;&#xA;  var tempNum = curNum;&#xD;&#xA;  for (var i = 1; i &amp;lt; aNum; i++) {&#xD;&#xA;    tempNum = curNum + prevNum;&#xD;&#xA;    prevNum = curNum;&#xD;&#xA;    curNum = tempNum;&#xD;&#xA;  }&#xD;&#xA;  return curNum;&#xD;&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;!DOCTYPE html&amp;gt;&#xD;&#xA;&amp;lt;html&amp;gt;&#xD;&#xA;&#xD;&#xA;&amp;lt;body&amp;gt;&#xD;&#xA;  Iteration number:&#xD;&#xA;  &amp;lt;input type=&quot;number&quot; min=0 id=&quot;itrNum&quot; value=20&amp;gt;&#xD;&#xA;  &amp;lt;hr&amp;gt;Starting value 1:&#xD;&#xA;  &amp;lt;input type=&quot;number&quot; min=1 id=&quot;start1&quot; value=1&amp;gt;&#xD;&#xA;  &amp;lt;br&amp;gt;&#xD;&#xA;  &amp;lt;br&amp;gt;Starting value 2:&#xD;&#xA;  &amp;lt;input type=&quot;number&quot; min=1 id=&quot;start2&quot; value=1&amp;gt;&#xD;&#xA;  &amp;lt;hr&amp;gt;Value of a:&#xD;&#xA;  &amp;lt;input type=&quot;number&quot; min=1 id=&quot;aVal&quot; value=1&amp;gt;&#xD;&#xA;  &amp;lt;hr&amp;gt;&#xD;&#xA;  &amp;lt;button id=&quot;button&quot;&amp;gt;Calculate&amp;lt;/button&amp;gt;&#xD;&#xA;&amp;lt;/body&amp;gt;&#xD;&#xA;&#xD;&#xA;&amp;lt;/html&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="41505" LastEditorUserId="31625" LastEditDate="2015-11-03T05:08:22.047" LastActivityDate="2015-11-03T05:08:22.047" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7368" PostTypeId="2" ParentId="2140" CreationDate="2015-11-02T12:44:40.270" Score="0" Body="&lt;h1&gt;Kaprekar Transformation&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/6174_%28number%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;Kaprekar Transformation&lt;/a&gt; is an transformation a number by following that instruction:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Take n-digit integer.&lt;/li&gt;&#xA;&lt;li&gt;Sort it anscending and descending.&lt;/li&gt;&#xA;&lt;li&gt;Subtract the largest number and smallest number.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Your program have to do this:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Take 1 number, x.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Output all possible cycle and fixnums for doing repeated x-digit Kaprekar Transformation on all possible input. Rotation is considered same. So it is invalid to print:&lt;/p&gt;&#xA;&lt;p&gt;[00],[09,81,63,27,45],[81,63,27,45,09]&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The output is a list consisting of list representing the cycle. You may using any style of list and even intermix it with restriction that it should not be ambigous. For example, comma separated item with item using comma separated item with enclosing bracket is OK, but not comma separated item with item using comma separated item without enclosing bracket.&lt;/p&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;8&#xA;&amp;gt;[00000000],[43208766,85317642,75308643,84308652,86308632,86326632,64326654],[63317664],[64308654,83208762,86526432],[97508421]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Or&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;[00000000],[[43208766,85317642,75308643,84308652,86308632,86326632,64326654],[63317664],[64308654,83208762,86526432],[97508421]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="46245" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-02T14:04:41.813" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="7369" PostTypeId="1" AcceptedAnswerId="7371" CreationDate="2015-11-02T16:10:04.513" Score="11" ViewCount="473" Body="&lt;p&gt;In MATLAB and Octave, the default output looks like this (I guess this is relevant for other languages as well):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;'This is a string'&#xA;&#xA;ans =&#xA;&#xA;This is a string&#xA;&#xA;x = 'This is a string'&#xA;&#xA;x =&#xA;&#xA;This is a string&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Using &lt;code&gt;disp&lt;/code&gt; will give:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;disp('This is a string')&#xA;This is a string&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There are, as far as I can tell, (at least) three types of challenges where this is relevant:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The output should look &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world/55504#55504&quot;&gt;exactly like this&lt;/a&gt; (maybe newlines and trailing spaces are OK)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This one is bankers: &lt;code&gt;ans = ...&lt;/code&gt; is not OK&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/61618/remove-all-occurrences-of-the-first-letter-of-a-string-from-the-entire-string/61640#61640&quot;&gt;Remove elements&lt;/a&gt;, remove letters, etc. from an input string. &#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I believe &lt;code&gt;ans = ...&lt;/code&gt; should be OK, since the output format is not specified.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/55693/comparing-two-numbers/55728#55728&quot;&gt;&quot;Output: &lt;code&gt;A is greater than B&lt;/code&gt; if A &gt; B&quot;&lt;/a&gt;, copy &lt;a href=&quot;https://codegolf.stackexchange.com/questions/62500/cat-goes-meow&quot;&gt;from STDIN to STDOUT&lt;/a&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;?&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;What do we do when the question simply states:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&quot;Output a string&quot;&lt;/li&gt;&#xA;&lt;li&gt;&quot;Print to STDOUT&quot;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is quite important, since &lt;code&gt;disp('String')&lt;/code&gt; is much longer than just &lt;code&gt;String&lt;/code&gt;. Also, for those cases where &lt;code&gt;ans = ...&lt;/code&gt; is OK, will &lt;code&gt;x = ...&lt;/code&gt; also be OK?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Update:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There are some cases that have come up recently:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The following function &lt;em&gt;returns&lt;/em&gt; no arguments, but will write &lt;code&gt;x = 1 2 3 4 5&lt;/code&gt; in the command window:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function f;x=1:5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I'm assuming this is disallowed?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The following is not a function, but also doesn't use &lt;code&gt;disp&lt;/code&gt;. It results in the integers 1-10 being printed like &lt;code&gt;i = 1&lt;/code&gt;, &lt;code&gt;i = 2&lt;/code&gt; etc. clearing the screen between each new number. &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;for i=1:10,pause(1);clc;i,end&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I'm assuming this is disallowed?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="31516" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-12-10T00:27:59.427" Title="How do we treat default output formats such as &quot;ans = ....&quot; etc.?" Tags="|discussion|policy|answers|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7371" PostTypeId="2" ParentId="7369" CreationDate="2015-11-02T16:27:57.797" Score="8" Body="&lt;p&gt;&quot;Output a string&quot; typically implies that it can be returned from a function, in which case extraneous output like &lt;code&gt;ans =&lt;/code&gt; and &lt;code&gt;x =&lt;/code&gt; is irrelevant. But in any situation in which a full program is used, be it required or by choice, or a function that prints to STDOUT rather than returning the value is used, &lt;code&gt;disp&lt;/code&gt; is required.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="20469" LastEditDate="2015-11-02T16:45:19.810" LastActivityDate="2015-11-02T16:45:19.810" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="7372" PostTypeId="2" ParentId="7369" CreationDate="2015-11-02T16:55:46.603" Score="4" Body="&lt;p&gt;This depends on how strict the output requirements of the challenge are.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Some challenges have very relaxed requirements on the output format. E.g. some just specify &quot;any convenient, unambiguous format&quot;. In those cases, including &lt;code&gt;ans =&lt;/code&gt; or &lt;code&gt;x =&lt;/code&gt; in the output is fair game as it does in no way obscure the actual output and is quite a natural output for Matlab as well.&lt;/li&gt;&#xA;&lt;li&gt;Other challenges require a very exact output format, e.g. a specific string (think &quot;Hello, World!&quot;). Those will usually state that the output must contain nothing except what is specified. In this case &lt;code&gt;ans =&lt;/code&gt; and &lt;code&gt;x =&lt;/code&gt; are &lt;em&gt;not&lt;/em&gt; fine unless they happen to match exactly the required output format.&lt;/li&gt;&#xA;&lt;li&gt;Some challenges will require such an exact output format, but make an exception for any &lt;em&gt;fixed&lt;/em&gt; interpreter output which cannot possibly be suppressed. This exception would not include Matlab, as &lt;code&gt;ans =&lt;/code&gt; and &lt;code&gt;x =&lt;/code&gt; &lt;em&gt;can&lt;/em&gt; be suppressed using &lt;code&gt;;&lt;/code&gt; and printing with &lt;code&gt;disp&lt;/code&gt; or similar instead.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-11-02T16:55:46.603" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7373" PostTypeId="2" ParentId="2140" CreationDate="2015-11-02T17:44:56.913" Score="0" Body="&lt;h1&gt;Stupid leaks&lt;/h1&gt;&#xA;&lt;p&gt;Considering how &lt;a href=&quot;https://codegolf.stackexchange.com/questions/59865/leave-my-python-alone&quot;&gt;immensely successful my&lt;/a&gt; last &lt;a href=&quot;https://codegolf.stackexchange.com/questions/62609/print-the-lyrics-to-caius-theme-final-fantasy-xiii-2&quot;&gt;two challenges have been&lt;/a&gt;, I'll do a different style this time.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Drip, drip, drip, drip...&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;It's the year 3000. Due to clean air shortages, a system was created that turns&#xA;water into air. However, that caused a &lt;em&gt;water&lt;/em&gt; shortage (don't you love progress?).&#xA;Therefore, a new (expensive!) system was created to convert the air back into&#xA;water.&lt;/p&gt;&#xA;&lt;p&gt;All that to say that water prices have &lt;em&gt;skyrocketed&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;And yet, here you are, stuck with a leaky faucet. Plumbers are expensive, but if&#xA;you do it yourself, you have to order the parts online and wait for them to get&#xA;here. You need a way to determine what is cheaper: calling a plumber and getting it&#xA;fixed in a day, or buying the parts online but having water leak until they get&#xA;here.&lt;/p&gt;&#xA;&lt;h2&gt;The input&lt;/h2&gt;&#xA;&lt;p&gt;You need to take seven positive numbers as input:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The price of water per gallon &lt;code&gt;g&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The number of drops leaking per hour &lt;code&gt;d&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The number of gallons wasted per drop &lt;code&gt;z&lt;/code&gt;. This will always be a floating-point&#xA;number less than 1.&lt;/li&gt;&#xA;&lt;li&gt;The price of calling a plumber to fix it &lt;code&gt;p&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The price of ordering the parts online &lt;code&gt;o&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The number of hours it takes for the plumber to fix the leak &lt;code&gt;l&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The number of hours it takes for the parts to get here &lt;code&gt;s&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Only &lt;code&gt;g&lt;/code&gt;, &lt;code&gt;z&lt;/code&gt;, &lt;code&gt;p&lt;/code&gt;, and &lt;code&gt;o&lt;/code&gt; can be floats; all the rest will be counting numbers (integers greater than 0).&lt;/p&gt;&#xA;&lt;h2&gt;The task&lt;/h2&gt;&#xA;&lt;p&gt;The gallons of water wasted per hour from the leak is &lt;code&gt;d*z*g&lt;/code&gt;. For the sake of&#xA;brevity, let's call that rate &lt;code&gt;R&lt;/code&gt;. If &lt;code&gt;R*l+p&lt;/code&gt; is less than &lt;code&gt;R*s+o&lt;/code&gt;, then you should&#xA;print/return &lt;code&gt;DIY!&lt;/code&gt;. If greater than, print/return &lt;code&gt;Call the plumber!&lt;/code&gt;. If equal,&#xA;print/return &lt;code&gt;Whatever...&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Precision&lt;/h2&gt;&#xA;&lt;p&gt;Floating-point precision through calculations is very...weird. Basically, your program can use whatever your language's default is. If you're using a language where the default floating-point type has infinite precision. If your language's default floating-point type can lose precision throughout calculations (like in Python, where &lt;code&gt;.1+.1+.1+.1+.1+.1+.1+.1 != .8&lt;/code&gt;), then that works, too.&lt;/p&gt;&#xA;&lt;p&gt;Short version: floating-point semantics and precision are however your language is by default.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Code-golf. Shortest wins. Standard loopholes banned.&lt;/p&gt;&#xA;" OwnerUserId="21009" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-02T21:03:08.657" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7375" PostTypeId="1" AcceptedAnswerId="7376" CreationDate="2015-11-03T11:12:19.157" Score="3" ViewCount="115" Body="&lt;p&gt;I'm confused by my question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/62200/fix-the-meeesesessessesseesseessedessed-upp-teeexexextext&quot;&gt;Fix the Meeesesessessesseesseessedessed upp teeexexextext&lt;/a&gt;. I get 7 upvotes but no answer. It is well defined, too, as Martin Buettner has fixed it during sandboxing. What's wrong with my question?&lt;/p&gt;&#xA;" OwnerUserId="46245" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-11-03T21:53:58.647" Title="Upvoted challenge but no answer" Tags="|support|specific-question|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7376" PostTypeId="2" ParentId="7375" CreationDate="2015-11-03T11:19:24.790" Score="15" Body="&lt;p&gt;Nothing is wrong with your question. &lt;a href=&quot;https://codegolf.stackexchange.com/unanswered&quot;&gt;There are questions with a lot more upvotes which haven't received answers in months or years&lt;/a&gt;. Your challenge has only been up for a few days, and due to the requirement for optimality it's moderately difficult. Sometimes it can take a while for answers to come in, and sometimes you'll only get one or two.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Just keep writing challenges. Some of them will be more and some will be less popular, but the more experience you get, the more you'll be able to gauge up front how much fun a challenge will be.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2015-11-03T11:19:24.790" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7377" PostTypeId="1" AcceptedAnswerId="9529" CreationDate="2015-11-03T15:57:32.687" Score="33" ViewCount="5954" Body="&lt;p&gt;Since programs may be created in vanilla (un-modded) &lt;a href=&quot;https://en.wikipedia.org/wiki/Minecraft&quot; rel=&quot;nofollow&quot;&gt;Minecraft&lt;/a&gt; using &lt;a href=&quot;http://minecraft.gamepedia.com/Redstone&quot; rel=&quot;nofollow&quot;&gt;redstone&lt;/a&gt; to create &lt;a href=&quot;http://minecraft.gamepedia.com/Logic_circuit&quot; rel=&quot;nofollow&quot;&gt;logic gates&lt;/a&gt; (and &lt;a href=&quot;http://minecraft.gamepedia.com/Redstone_circuit#Circuit_types&quot; rel=&quot;nofollow&quot;&gt;more&lt;/a&gt;), someone could create such a program for a challenge on this site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How would such an entry be scored?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some possible scoring methods:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Blocks used (placed redstone counts as a block)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Redstone used (redstone is also used in crafting redstone torches, repeaters, and other similarly useful components)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Volume of the minimal bounding rectangular prism (same as blocks, but includes air blocks)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Note on testing:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Buying Minecraft is not required to test a program!&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Play the &lt;a href=&quot;http://minecraft.gamepedia.com/Demo_mode&quot; rel=&quot;nofollow&quot;&gt;demo version&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Start a LAN world&lt;/li&gt;&#xA;&lt;li&gt;Turn cheats on&lt;/li&gt;&#xA;&lt;li&gt;Use &lt;code&gt;/gamemode 1&lt;/code&gt;, (or &lt;code&gt;2&lt;/code&gt; or &lt;code&gt;3&lt;/code&gt;) in the chat/console to use Creative Mode, Adventure Mode and/or Spectator Mode, respectively. Creative mode will allow you to place any blocks you want. The demo starts in Survival Mode. Note that the demo ends after 5 in-game days (1 hr 40 min), and the world will have to be reset (wiped/restarted) to play more.&lt;/li&gt;&#xA;&lt;li&gt;If the program is posted with a .schematic file (useful for complex programs), you can install a mod for your demo (or purchased) version of Minecraft that can import it. MCEdit and WorldEdit are two popular mods that can do this.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Use a redstone simulator. These are separate programs with partial functionality from Minecraft, useful for circuit creation, simulation, and exportation. You will probably want to try a few before choosing one to stick with.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.minecraftforum.net/forums/mapping-and-modding/minecraft-tools/1260528-baezons-redstone-simulator-v2-2&quot; rel=&quot;nofollow&quot;&gt;Baezon's Redstone Simulator&lt;/a&gt; (download)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Has the ability to export as a .gif&lt;/li&gt;&#xA;&lt;li&gt;Copy/Paste functionality&lt;/li&gt;&#xA;&lt;li&gt;Has the ability to simulate North/South lever functionality like Minecraft has&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://mordritch.com/mc_rss/&quot; rel=&quot;nofollow&quot;&gt;Mordritch's JavaScript Redstone Simulator&lt;/a&gt; (web)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No download required&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;... and many others. Just search on Google.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="34718" LastEditDate="2015-11-04T22:28:45.063" LastActivityDate="2018-04-01T04:12:42.010" Title="Programming in Minecraft (Redstone) - how to measure program size?" Tags="|discussion|code-golf|answers|scoring|" AnswerCount="8" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="7378" PostTypeId="2" ParentId="7377" CreationDate="2015-11-03T16:06:15.217" Score="-4" Body="&lt;h1&gt;Redstone-Related Items Placed (bytes)&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Typical Redstone Items Placed (found in the Redstone section of the Creative Menu)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I would count these as 1 byte each.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Comparator-Responsive Items Placed&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I would count these as two bytes. Hoppers can output with a comparator from 0 to 15 redstone length in output. Similarly, the use of item frames to hold information or any other storage item should be counted as two bytes.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Filler Blocks Placed&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Dirt or the like, as long as it isn't used for redstone transmission, should not be counted. If they are used for redstone transmission (passing power through a block with a torch/repeater/comparator), it should count as a byte.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Command Blocks&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Command blocks should be counted as three bytes in version 1.9 but one byte in all other versions, as command blocks have 12 &quot;states&quot; in version 1.9. The text inside should count byte-for-byte there as well.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Entities&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Entities would be tricky to count. If there were a definite restriction from the several hundred variations of several hundred entities one could have in the game, this would be easy to score. However, since that would be improbable, I would consider @Cᴏɴᴏʀ O'Bʀɪᴇɴ's solution to this with two bytes.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Dummy Players&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;These should remain uncounted, except for the command block source that generates them.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="44713" LastEditDate="2015-11-06T07:58:34.653" LastActivityDate="2015-11-06T07:58:34.653" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="7380" PostTypeId="2" ParentId="7377" CreationDate="2015-11-03T18:21:01.983" Score="8" Body="&lt;h2&gt;Byte size of a corresponding valid &lt;a href=&quot;http://minecraft.gamepedia.com/Schematic_file_format&quot; rel=&quot;nofollow&quot;&gt;.schematic file&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Easy to score and has no major issues with entropy. The only problem is, of course, that the byte counts are going to be a lot higher than one would desire, but I thought I'd just post this as one possible option.&lt;/p&gt;&#xA;" OwnerUserId="21487" LastActivityDate="2015-11-03T18:21:01.983" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7381" PostTypeId="2" ParentId="2140" CreationDate="2015-11-03T23:45:44.087" Score="2" Body="&lt;h1&gt;Bridge Flowers &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;One of the example inputs for this challenge is a really minor puzzle in Undertale, and the example output is the solution. You have been warned.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the Underground, there is a mysterious plant known as the Bridge Flower. They always come in groups of four Bridge Seeds, and have some interesting properties:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When dropped in water, a Bridge Seed floats away from you in the direction you were facing when you dropped it. It floats until it hits a wall or another Bridge Seed, at which point it stops moving.&lt;/li&gt;&#xA;&lt;li&gt;If four Bridge Seeds are touching, forming a straight line, and none of them are moving, they will bloom into Bridge Flowers. Bridge Flowers can support a monster's weight (or a human, but when will that ever happen?), hence the name.&lt;/li&gt;&#xA;&lt;li&gt;Another mysterious plant, the Bell Blossom, has a special interaction with Bridge Flowers. The Bell Blossom can be rung to turn all Bridge Flowers back into Bridge Seeds and return them to their original spot.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Consider this map, where &lt;code&gt;.&lt;/code&gt; is ground, &lt;code&gt;&lt;/code&gt; is water, and &lt;code&gt;X&lt;/code&gt; is a Bridge Seed. You'll always be on the part of the map where the Bridge Seeds are. The gap is only four tiles wide, so it's quite easy to make a bridge of Bridge Flowers.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;........    ........  |  ........    ........&#xA;..X.....    ........  |  ........    ........&#xA;.X.X....    ........  |  ........XXXX........&#xA;..X.....    ........  |  ........    ........&#xA;........    ........  |  ........    ........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here's a slightly more difficult gap to cross. Even though the straight-line distance is longer than four tiles, you can make it across with a little bit of thought.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;........       ........  |  ........       ........&#xA;..X.....       ........  |  ........       ........&#xA;.X.X....       ........  |  ........       ........&#xA;..X.....       ........  |  ........       ........&#xA;........       ........  |  ........       ........&#xA;..         ............  |  ..     XXXX............&#xA;..         ............  |  ..         ............&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here's one that's even trickier than the last two. Most of this river is three tiles wide or fewer, so you can't simply make a straight-line bridge across! Thinking outside the box, though, you'll arrive at the solution.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;....   ............  |  .... X ............&#xA;...   .............  |  ...  X.............&#xA;....   ............  |  .... X ............&#xA;.....  ............  |  .....X ............&#xA;....   ...X.X......  |  ....   ............&#xA;....   ...X.X......  |  ....   ............&#xA;     ..............  |       ..............&#xA;       ............  |         ............&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For this challenge, write a program or function that takes a map like the ones here and outputs the same map, but with the puzzle solved (the Bridge Seeds moved to the final position of the Bridge Flowers). If there's more than one possible answer, any of them will do. You may assume there will be exactly two areas of land separated by water, with the one that you start on denoted by the presence of exactly four Bridge Seeds.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the program can't find an answer... well, just because it's impossible doesn't mean you should give up! Don't lose your Determination! Output &lt;code&gt;Ding&lt;/code&gt; to sound the Bell Blossom, reset the Bridge Seeds and try again!&lt;/p&gt;&#xA;" OwnerUserId="14509" LastEditorUserId="14509" LastEditDate="2015-11-04T02:04:19.493" LastActivityDate="2015-11-04T02:04:19.493" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7382" PostTypeId="2" ParentId="2140" CreationDate="2015-11-04T00:19:18.090" Score="3" Body="&lt;h1&gt;Counting the Pattern Unlocks&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Meta&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Upon thinking about this challenge harder, I've realized that it is fairly trivial. Unless I am really bad at counting (which I am liable to be), there are at least 2 ways and at most 4 ways to draw any given pattern.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;I think that this makes the challenge considerably less attractive. For this reason, I am thinking of ways to spice it up. For this, I would like your feedback. Currently I am thinking of:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;--&gt;Changing the rules so that dots can be used multiple times.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Let me know what you think of this change to the challenge, or suggest other changes.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The Premise&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Many modern smartphones have options that allow you to choose how you would like to unlock your phone. For example, my phone allows&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;PIN input: a 4 digit number (low security)&lt;/li&gt;&#xA;&lt;li&gt;Pattern Unlock: connect the dots in a pattern (medium security)&lt;/li&gt;&#xA;&lt;li&gt;Password entry: enter a password (high security)&lt;/li&gt;&#xA;&lt;li&gt;Fingerprint.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;When you elect this second option, you are shown a 3x3 grid of dots (9 dots total) that looks something like this&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.    .    .&#xA;&#xA;.    .    .&#xA;&#xA;.    .    .&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Instead of using dots, we will use numbers in the following fashion for ease of reference. &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1    2    3&#xA;&#xA;4    5    6&#xA;&#xA;7    8    9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You are then prompted to connect dots to form a pattern. This process is subject to the following rules:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The pattern must use at least 3 dots. &lt;/li&gt;&#xA;&lt;li&gt;The pattern must be one continuous connection, that is once you lift your finger, the pattern ends.&lt;/li&gt;&#xA;&lt;li&gt;Each dot may be used at most once (there is a quasi exception to this in rule 4)&lt;/li&gt;&#xA;&lt;li&gt;If you take three collinear dots, in connecting the outer two dots, you must connect the inner dot if it is not already used. For example, if you make the connection 1-3, if 2 is not already used, you are really making the connection 1-2-3. If 2 is already used, then you are just making the connection 1-3. This is where the quasi exception to rule 3 comes in. You are passing over 2 again, even though you have already used it. &lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;I believe that these are all the rules. Note that some phones may use different rules, but if you think I am missing something important, please let me know&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Our goal is to count how many ways there are to draw a given pattern.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example if you see the following pattern:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1----2----3&#xA;&#xA;4    5    6&#xA;&#xA;7    8    8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It could have been drawn in one of four ways:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 --&amp;gt; 2 --&amp;gt; 3    or&#xA;3 --&amp;gt; 2 --&amp;gt; 1    or&#xA;2 --&amp;gt; 3 --&amp;gt; 1    or&#xA;2 --&amp;gt; 1 --&amp;gt; 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will be given a series of integers between 1 and 9 to stdin. They will represent connected dots on a grid. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The above example could be input via any of the following sequences:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3    or&#xA;3 2 1    or&#xA;2 3 1    or&#xA;2 1 3    or&#xA;1 3      or&#xA;3 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If input is invalid, your program may do whatever it wants. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program is to output the number of ways there are to draw the pattern, as an ingeter, to stdout or equivalent. In the above example, the output would be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Wining Criterion&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code golf, shortest code (bytes) wins. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Bonus&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Take off 20% if your answer also outputs all ways to draw the pattern (any understandable syntax acceptable).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;TEST CASES&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(1) grid layout&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1    2    3&#xA;        /&#xA;4    5    6&#xA;|  /&#xA;7    8    9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;possible inputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input&amp;gt;&amp;gt; 4 7 3&#xA;     &amp;gt;&amp;gt; 4 7 5 3&#xA;     &amp;gt;&amp;gt; 3 7 4&#xA;     &amp;gt;&amp;gt; 3 5 7 4&#xA;     &amp;gt;&amp;gt; 5 3 7 4&#xA;output&amp;lt;&amp;lt; 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;the ways are (for the bonus):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4 --&amp;gt; 7 --&amp;gt; 5 --&amp;gt; 3    or&#xA;3 --&amp;gt; 5 --&amp;gt; 7 --&amp;gt; 4    or&#xA;5 --&amp;gt; 3 --&amp;gt; 7 --&amp;gt; 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(2)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1----2----3&#xA;|&#xA;4    5----6&#xA;|         |&#xA;7----8----9&#xA;&#xA;input&amp;gt;&amp;gt; 3 2 1 4 7 8 9 6 5    or&#xA;     &amp;gt;&amp;gt; 3 1 7 9 6 5          or&#xA;     &amp;gt;&amp;gt; 5 6 9 7 1 3          or&#xA;     a couple others&#xA;output&amp;lt;&amp;lt; 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;example directions: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 3 --&amp;gt; 1 --&amp;gt; 7 --&amp;gt; 9 --&amp;gt; 6 --&amp;gt; 5   or&#xA; 5 --&amp;gt; 6 --&amp;gt; 9 --&amp;gt; 7 --&amp;gt; 1 --&amp;gt; 3   or&#xA; 2 --&amp;gt; 3 --&amp;gt; 1 --&amp;gt; 7 --&amp;gt; 9 --&amp;gt; 6 --&amp;gt; 5&#xA; (or could include extra collinear points)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="45459" LastEditorUserId="45459" LastEditDate="2015-11-05T20:29:11.327" LastActivityDate="2015-11-05T20:29:11.327" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7384" PostTypeId="2" ParentId="2140" CreationDate="2015-11-04T15:17:36.687" Score="2" Body="&lt;p&gt;Based on &lt;a href=&quot;https://puzzling.stackexchange.com/questions/23743/smallest-unicode-box-drawing&quot;&gt;this question&lt;/a&gt; in the Puzzling SE.  Not 100% sure on the scoring, and this is my first time posting a PPCG challenge, so I'd appreciate any suggestions on improving it.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Unicode Box Drawing&lt;/h1&gt;&#xA;&lt;p&gt;Write a program which outputs a diagram using all of the standard Unicode box drawing characters:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;─ │ ┌ ┐ └ ┘ ├ ┤ ┬ ┴ ┼&#xA;═ ║ ╔ ╗ ╚ ╝ ╠ ╣ ╦ ╩ ╬&#xA;    ╒ ╕ ╘ ╛ ╞ ╡ ╤ ╧ ╪&#xA;    ╓ ╖ ╙ ╜ ╟ ╢ ╥ ╨ ╫&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The diagram should have no loose ends, so:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;┌┐ &amp;lt;-Allowed  ┌┐ &amp;lt;-Not allowed  ┌┐┌┐ &amp;lt;-Allowed&#xA;└┘            └┴                └┴┴┘&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Also, single lines should line up with other single lines, and double with double:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;├─, ╟─, ╠═, ╞═ &amp;lt;-Allowed  ├═, ╟═, ╠─, ╞─ &amp;lt;-Not allowed&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The diagram must use each of the 40 characters at least once, and must form one contiguous, connected shape.  Because the characters might look different depending on your browser font, do not consider the space between double lines to be an actual separation.  Separations can only be between two characters.  In other words:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;┌╖ &amp;lt;-Allowed  ┌┐┌┐ &amp;lt;-Not allowed&#xA;└╜            └┘└┘&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your code must compute the diagram from scratch.  You may not create an already existing diagram and just print it out.  A bonus of 20% will be awarded if your program outputs a different valid diagram based on a random seed.  (This seed may be provided as input, or you may use system time, read the seed from a file, or any other means you choose.)  Note that a random seed may be provided externally, but the diagram itself may not.  If you implement this bonus, please provide multiple examples showing different output.&lt;/p&gt;&#xA;&lt;p&gt;This is code-golf, so scoring will be based on the number of bytes in the source code.  In addition, the length of the output will also be counted.  You get 40 characters free to account for the required characters.  Any additional characters will come at a 10% penalty.  This includes spaces/tabs, and any duplicate graph pieces.  Newlines are free (to be fair to the differences between OSs).&lt;/p&gt;&#xA;&lt;p&gt;If your program produces multiple outputs of different lengths (due to randomness), you may use the shortest output produced, but you must provide a seed that results in that output so it can be verified.  Since this might be difficult if you used system time as a seed, entries using system time must somehow prove that they are capable of producing the smallest claimed output.  (For instance, if they produce the same length output every time, or produce the minimum claimed output at least 50% of the time.)&lt;/p&gt;&#xA;&lt;p&gt;So in summary:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take length of source code in bytes.&lt;/li&gt;&#xA;&lt;li&gt;Add 10% for each whitespace character (not counting newlines) or duplicated character in the output.&lt;/li&gt;&#xA;&lt;li&gt;Subtract 20% if you implement the random seed input.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Standard loopholes apply.&lt;/p&gt;&#xA;" OwnerUserId="42471" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-04T18:02:02.557" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="7386" PostTypeId="2" ParentId="7260" CreationDate="2015-11-04T17:08:06.107" Score="-1" Body="&lt;h2&gt;Yes&lt;/h2&gt;&#xA;&lt;p&gt;You should be free to create any bounty you like, as long as the OP is okay with the bounty.&lt;/p&gt;&#xA;" OwnerUserId="31203" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-04T17:08:06.107" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7387" PostTypeId="2" ParentId="2140" CreationDate="2015-11-04T17:42:21.420" Score="6" Body="&lt;h1&gt;You say goodbye, and I say hello&lt;/h1&gt;&#xA;&lt;p&gt;In this challenge, you have to make a program that outputs &lt;code&gt;Hello, World!&lt;/code&gt;. That's not all though! When the program is reversed, it has to output &lt;code&gt;Goodbye, World!&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Unfortunately, there are a few boring rules:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No using comments, i.e., the Python code &lt;code&gt;print&amp;quot;Hello, World!&amp;quot;#&amp;quot;!dlroW ,eybdooG&amp;quot;tnirp&lt;/code&gt; is illegal&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so try to do it in the least number of bytes.&lt;/p&gt;&#xA;&lt;p&gt;(Should the forwards/backwards tasks be changed? I think they are probably too easy. Let me know if you have any suggestions.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/palindrome&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;palindrome&amp;#39;&quot; rel=&quot;tag&quot;&gt;palindrome&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="41938" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-09T18:05:25.080" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="7390" PostTypeId="2" ParentId="6918" CreationDate="2015-11-05T04:54:03.970" Score="12" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/molarmanful/-_-&quot; rel=&quot;nofollow noreferrer&quot;&gt;ಠ_ಠ&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;The most disapproving coding language on the Internet!&lt;/em&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codepen.io/molarmanful/full/gajxjX&quot; rel=&quot;nofollow noreferrer&quot;&gt;Interpreter&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/molarmanful/-_-/wiki/Documentation&quot; rel=&quot;nofollow noreferrer&quot;&gt;Documentation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Oh yeah, this one's great. It was made by me beginning of November 2015 over the span of a few days. It's stack-based, like most code-golfing languages, but it's meant for general-purpose use, not code-golf. In addition, it's a line-jumping program, meaning that you go to specific lines rather than labels (like in BASIC); it might be the first of its kind! ಠ_ಠ also has &lt;a href=&quot;https://github.com/molarmanful/-_-/wiki/Documentation#conditional-statements&quot; rel=&quot;nofollow noreferrer&quot;&gt;the most versatile conditional statement of any language&lt;/a&gt;, and it features a &lt;a href=&quot;https://github.com/molarmanful/-_-/wiki/Documentation#the-useless-operator&quot; rel=&quot;nofollow noreferrer&quot;&gt;useless operator&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Quick Example&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;ಠ_ಠ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;A simple &lt;code&gt;cat&lt;/code&gt; program.&lt;/p&gt;&#xA; &#xA;" OwnerUserId="41247" LastEditorUserId="16766" LastEditDate="2021-12-17T22:44:01.173" LastActivityDate="2021-12-17T22:44:01.173" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="7392" PostTypeId="2" ParentId="2140" CreationDate="2015-11-05T13:50:31.067" Score="0" Body="&lt;h1&gt;Print a sourcecode&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given 2 inputs(First input is truthy/falsy, second input is program in same language as submission):&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If the first input is truthy then transform the second input into same program but printing the source code(After modification) first.&lt;/li&gt;&#xA;&lt;li&gt;If the first input is falsy then transform the second input into same program but after the program finished it prints the source code(After modification). If the program doesn't halt, you may or may not modify the program.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;It's code-golf, so the shorter answer is the winner.&lt;/p&gt;&#xA;&lt;p&gt;For example in CJam, I don't write the program to do this. (&amp;gt; means output)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 q&#xA;&amp;gt;{&amp;quot;_~&amp;quot;q}_~&#xA;0 0 1{_@+}11*;&#xA;&amp;gt;{&amp;quot;_~&amp;quot;0 0 1{_@+}11*;}_~&#xA;1 q&#xA;&amp;gt; {q](\o&amp;quot;_~&amp;quot;}_~&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="46245" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-07T07:37:45.117" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7394" PostTypeId="2" ParentId="2140" CreationDate="2015-11-05T20:11:42.383" Score="4" Body="&lt;h1&gt;BrainCubed&lt;/h1&gt;&#xA;&lt;p&gt;You are the proud maintainer of one of the smartest robots in the world. Well, it used to be. Now its speakers and microphones have been broken and the darn thing only seems to read &lt;a href=&quot;http://esolangs.org/wiki/Brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brainfuck&lt;/a&gt;. To make matters worse, it would appear most of its RAM... disappeared? This will be tough to explain to the boss. No matter. It seems to have figured out how to draw on a whiteboard to supplement its now-shoddy memory, and you have bigger problems on your hands.&lt;/p&gt;&#xA;&lt;p&gt;You need to know how to fit things in cubes.&lt;/p&gt;&#xA;&lt;h2&gt;The Task&lt;/h2&gt;&#xA;&lt;p&gt;Lately, your biggest problems (aside from the embarrassing conversation with your boss later) have to do with volume. Cubing things is hard. That's why you'll get the robot to do it for you! Your goal in this challenge is to write a Brainfuck program that computes the cube of a given number. However, the robot's whiteboard isn't very big. &lt;strong&gt;The less memory your Brainfuck program requires, the better.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;You will receive a single integer as input, &lt;code&gt;x&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You may choose to accept input in any integer base greater than &lt;code&gt;0&lt;/code&gt; and less than or equal to &lt;code&gt;36&lt;/code&gt;, so long as this base does not vary from input to input. (e.g. binary, hexadecimal, decimal)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may assume that &lt;code&gt;x&lt;/code&gt; is in the range &lt;code&gt;0 &amp;lt;= x &amp;lt;= 2^16 - 1&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You should take input as a string of &lt;em&gt;characters&lt;/em&gt;, not bytes. For example, if &lt;code&gt;x = 33&lt;/code&gt; and my program accepts input in binary, I should receive the string &amp;quot;100001&amp;quot; (bytes: 49 48 48 48 48 49) &lt;em&gt;not&lt;/em&gt; simply bytes containing 100001.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Your Brainfuck program must output the value of &lt;code&gt;x^3&lt;/code&gt; in the &lt;strong&gt;same&lt;/strong&gt; base that input was received in.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;As it is for input, your program should output a &lt;em&gt;string&lt;/em&gt; of ASCII characters, not a sequence of bytes.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The program must terminate, and should not print anything except for its numerical output.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Rules and Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Your score in this challenge is defined in the following manner:&#xA;Let the tape of the Brainfuck memory be described as having a &lt;code&gt;1&lt;/code&gt;st element at the left-most position, and then with potentially infinite cells to the right, indexed by increasing integers &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Let &lt;code&gt;N(x)&lt;/code&gt; denote the right-most (highest &lt;code&gt;n&lt;/code&gt;) cell that the program ever sends the tape pointer to (&lt;strong&gt;not&lt;/strong&gt; necessarily modified) for a given input &lt;code&gt;x&lt;/code&gt;.&#xA;Your score for this challenge is then &lt;code&gt;sum (x = 0, 1, 2, ... 100) N(x)&lt;/code&gt; (modification pending)&lt;/p&gt;&#xA;&lt;p&gt;In order to verify score, you may use [this] (soon) modified interpreter.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program must be written entirely in Brainfuck.&lt;/li&gt;&#xA;&lt;li&gt;Assume the highest value a cell can hold is &lt;code&gt;255&lt;/code&gt; before wrapping to &lt;code&gt;0&lt;/code&gt;, and that moving left off of the tape will cause the robot to suddenly and violently crash.&lt;/li&gt;&#xA;&lt;li&gt;Your program should not exceed 10k bytes, nor should it take more than 10 minutes to compute &lt;code&gt;x^3&lt;/code&gt; for any &lt;code&gt;x &amp;lt;= 2^16 - 1&lt;/code&gt; on a relatively modern machine.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are disallowed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brainfuck&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brainfuck&amp;#39;&quot; rel=&quot;tag&quot;&gt;brainfuck&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;SANDBOX NOTES&lt;/h3&gt;&#xA;&lt;p&gt;What do you think of BF memory-optimization as a basis for a challenge?&lt;/p&gt;&#xA;&lt;p&gt;I chose cubing &lt;code&gt;x&lt;/code&gt; as a challenge that is not so trivial as to allow for different approaches, but still within the grasp of BF (if different bases are allowed). Any other ideas?&lt;/p&gt;&#xA;" OwnerUserId="31054" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-06T02:28:43.617" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7396" PostTypeId="2" ParentId="2140" CreationDate="2015-11-05T22:37:35.890" Score="0" Body="&lt;h1&gt;Show How a Regex Is Matched&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;What your program or function should do:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Accept input of two strings; let's call them &lt;code&gt;r&lt;/code&gt; and &lt;code&gt;s&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Determine whether &lt;code&gt;r&lt;/code&gt; is a valid regular expression (you can use any common definition of regex for this purpose, or any common definition of regexes but with lookahead and lookbehind removed; indicate which you're using). Otherwise, don't output.&lt;/li&gt;&#xA;&lt;li&gt;If so, determine whether &lt;code&gt;s&lt;/code&gt; matches &lt;code&gt;r&lt;/code&gt; as a regex. Otherwise, don't output.&lt;/li&gt;&#xA;&lt;li&gt;If so, output/print, in order, the part of &lt;code&gt;r&lt;/code&gt; matched by each character of &lt;code&gt;s&lt;/code&gt;, and also the part of &lt;code&gt;s&lt;/code&gt; that matches it.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; You &lt;em&gt;may&lt;/em&gt; use your language's regex-matching library for this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Using PCRE; my inputs and outputs are &lt;code&gt;r&lt;/code&gt; first and then &lt;code&gt;s&lt;/code&gt;.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;code&gt;^.el*(o.*)*d\b&lt;/code&gt; and &lt;code&gt;Hello, world!&lt;/code&gt;&lt;br&gt;&#xA;  → &lt;code&gt;^.ello......d\b&lt;/code&gt; and &lt;code&gt;Hello, world&lt;/code&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;code&gt;.\1\W&lt;/code&gt; and &lt;code&gt;800-555-1212&lt;/code&gt;&lt;br&gt;&#xA;  → &lt;code&gt;..\W&lt;/code&gt; and &lt;code&gt;00-&lt;/code&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;code&gt;\b&lt;/code&gt; and &lt;code&gt;a&lt;/code&gt;&lt;br&gt;&#xA;  → &lt;code&gt;\b&lt;/code&gt; and &lt;em&gt;empty string&lt;/em&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;code&gt;\d&lt;/code&gt; and &lt;code&gt;a&lt;/code&gt;&lt;br&gt;&#xA;  → &lt;em&gt;no output&lt;/em&gt; (it doesn't match)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt; First floated &lt;a href=&quot;//chat.stackexchange.com/transcript/240?m=25012200#25012200&quot;&gt;in chat&lt;/a&gt;.&lt;br&gt;&#xA;Not a dupe of &lt;a href=&quot;https://codegolf.stackexchange.com/q/7024&quot;&gt;Compile Regexes&lt;/a&gt; (which asks you to match regexes whereas this allows you to use the resources of your language to do so).&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="1976" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.127" LastActivityDate="2015-11-06T09:22:36.477" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7397" PostTypeId="2" ParentId="7377" CreationDate="2015-11-06T04:24:55.637" Score="19" Body="&lt;h1&gt;Bytes &amp;equiv; Functionality&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I love Minecraft! Here's my two cents:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Redstone-related items (i.e. items that interact with redstone) should be each &lt;code&gt;1 byte&lt;/code&gt;, except for:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Command blocks, whose byte count should be &lt;code&gt;1 + length of inner code&lt;/code&gt; (Or &lt;code&gt;2 + length of inner code&lt;/code&gt;, if you are using version 1.9 or above, as this version adds an orientation to command blocks. &lt;a href=&quot;http://minecraft.gamepedia.com/Command_Block&quot; rel=&quot;nofollow&quot;&gt;I would add another byte for conditional/unconditional mode, but methinks that's a bit too much.&lt;/a&gt;. Ideally, a command block would consume more bytes, since it can have the attributes of &lt;code&gt;Impulse/Chain/Repeat&lt;/code&gt;; &lt;code&gt;Conditional/Unconditional&lt;/code&gt;; and &lt;code&gt;Always Active/Needs Redstone&lt;/code&gt;. I am thus tempted to say that a command block indeed consume &lt;em&gt;4&lt;/em&gt; bytes per default; however, since these features are as of yet unreleased).&lt;/li&gt;&#xA;&lt;li&gt;Air blocks, which should be &lt;code&gt;0 bytes&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Blocks should count as &lt;code&gt;1 byte&lt;/code&gt;, keeping in mind:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If they compose the mandatory floor of the &quot;program&quot;. This can be thought of as a construction on an infinite plane; the base does not count towards the byte count. (I.e., flatlands.)&lt;/li&gt;&#xA;&lt;li&gt;Buttons, levers, methods should be counted &lt;code&gt;1 byte&lt;/code&gt;, as this is similar to collecting input.&lt;/li&gt;&#xA;&lt;li&gt;The placing of blocks in a certain place (e.g. placing sand atop a command block which waits for the sand to be placed there) is &lt;code&gt;0 bytes&lt;/code&gt;, as this is user-action.&lt;/li&gt;&#xA;&lt;li&gt;Barriers should count as &lt;code&gt;1 byte&lt;/code&gt;, since they have physical interaction with the world.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Entities should be &lt;code&gt;2 bytes&lt;/code&gt;: one for the position, and one for the spawning of the mob.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This still doesn't address the new command blocks added in the snapshot and future updates; I would say these still count as &lt;code&gt;1 byte&lt;/code&gt;, but I don't know enough about them. I also hesitate to say anything special about pistons and sand, because they &lt;em&gt;seem&lt;/em&gt; like they should be &lt;code&gt;1 byte&lt;/code&gt;, but they do move; that is, I don't know how to score movement. If asked, I would lean towards the &lt;code&gt;1 byte&lt;/code&gt; option.&lt;/p&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="31957" LastEditDate="2015-11-06T12:27:45.477" LastActivityDate="2015-11-06T12:27:45.477" CommentCount="19" ContentLicense="CC BY-SA 3.0" />
  <row Id="7398" PostTypeId="2" ParentId="2140" CreationDate="2015-11-06T12:29:18.557" Score="0" Body="&lt;h1&gt;Python assembler&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Python is a hybrid interpreted language. It first gets compiled into byte-code and then gets interpreted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What does this byte-code look like you may ask? The &lt;a href=&quot;https://docs.python.org/2/library/dis.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;dis module&lt;/a&gt; disassembles python code. &lt;a href=&quot;https://hg.python.org/cpython/file/2.7/Lib/dis.py&quot; rel=&quot;nofollow noreferrer&quot;&gt;Source code for dis module here&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;print &quot;Hello, World!&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Gets disassembled into the following assembly.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  1           0 LOAD_CONST               0 ('Hello, World!')&#xA;              3 PRINT_ITEM&#xA;              4 PRINT_NEWLINE&#xA;              5 LOAD_CONST               1 (None)&#xA;              8 RETURN_VALUE&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The output is divided in the following columns:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;the line number, for the first instruction of each line&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;a labelled instruction, indicated with &gt;&gt;,&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;the address of the instruction,&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;the operation code name,&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;operation parameters, and&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;interpretation of the parameters in parentheses.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The disassembly of a basic for loop&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;for i in range(10):&#xA;    print i&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;gives&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  1           0 SETUP_LOOP              25 (to 28)&#xA;              3 LOAD_NAME                0 (range)&#xA;              6 LOAD_CONST               0 (10)&#xA;              9 CALL_FUNCTION            1&#xA;             12 GET_ITER&#xA;        &amp;gt;&amp;gt;   13 FOR_ITER                11 (to 27)&#xA;             16 STORE_NAME               1 (i)&#xA;&#xA;  2          19 LOAD_NAME                1 (i)&#xA;             22 PRINT_ITEM&#xA;             23 PRINT_NEWLINE&#xA;             24 JUMP_ABSOLUTE           13&#xA;        &amp;gt;&amp;gt;   27 POP_BLOCK&#xA;        &amp;gt;&amp;gt;   28 LOAD_CONST               1 (None)&#xA;             31 RETURN_VALUE&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Your task:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given some python code that has been disassembled, recreate the original code object as close as you can. You can take the disassembled code through any method you chose.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program will output all the arguments to recreate a &lt;a href=&quot;https://stackoverflow.com/a/16123158/3398583&quot;&gt;python code object&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That is to say your program will output the following&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0,             &#xA;0,      &#xA;nlocals,              &#xA;stacksize,            &#xA;0,                &#xA;codestring,           &#xA;consts,               &#xA;names,                &#xA;varnames,             &#xA;&quot;a string here&quot;,            &#xA;&quot;another string here&quot;,&#xA;0,        &#xA;lnotab,               &#xA;(),             &#xA;()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You can work out the variables listed above but you have to output it all, even the constants.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;nlocals - The number of local variables&lt;/li&gt;&#xA;&lt;li&gt;stacksize - The maximum number of values held on the stack at once&lt;/li&gt;&#xA;&lt;li&gt;codestring - A binary containing all the opcodes and their arguments&lt;/li&gt;&#xA;&lt;li&gt;consts - A tuple of constants&lt;/li&gt;&#xA;&lt;li&gt;names - A tuple of global variables&lt;/li&gt;&#xA;&lt;li&gt;varnames - A tuple of local names (length of nlocals)&lt;/li&gt;&#xA;&lt;li&gt;lnotab - A tuple containing a map of bytecode positions to line numbers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You may use the following code to disassemble a .pyc file:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import sys, dis, marshal&#xA;&#xA;with open(sys.argv[1], &quot;rb&quot;) as code_f:&#xA;    code_f.read(8) # Magic number and modification time&#xA;    code = marshal.load(code_f)&#xA;    dis.dis(code)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;This is code-golf, the shortest code in bytes wins&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Wow that was a long one. Perhaps too long?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is the spec completely tight?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should I explain anything further?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Am I making it too hard for non-python entries to take part?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should I only make it a requirement to reassemble code without any functions/classes? I'm pretty sure &lt;code&gt;dis&lt;/code&gt; doesn't show all that.&lt;/p&gt;&#xA;" OwnerUserId="32686" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2015-11-06T17:21:12.847" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7400" PostTypeId="2" ParentId="2140" CreationDate="2015-11-07T00:11:10.717" Score="2" Body="&lt;h1&gt;Find pattern in pixel carpet&lt;/h1&gt;&#xA;&lt;p&gt;[insert story why this needs to be as short as possible]&lt;/p&gt;&#xA;&lt;p&gt;Given an image the goal is finding the biggest* connected* pattern of pixels, that occurs more than once. If there is more than one distinct pattern of maximum size, find the one that occurs more.&lt;/p&gt;&#xA;&lt;p&gt;The output should consist of mask (bw image) of the size of the input, that is black where the copies of the pattern were on the original image, and white otherwise.&lt;/p&gt;&#xA;&lt;h1&gt;* Specs&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Biggest&lt;/em&gt; as in number of pixels&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;connected&lt;/em&gt; means four connected&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Two instances of the pattern must not overlap.&lt;/p&gt;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/n9J5V.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/n9J5V.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/vBQoi.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/vBQoi.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;consider rotations / mirroring of the patter too, or only translations?&lt;/li&gt;&#xA;&lt;li&gt;runntime requirement?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-07T00:20:30.913" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7401" PostTypeId="2" ParentId="6918" CreationDate="2015-11-07T02:27:14.800" Score="11" Body="&lt;h1&gt;SnakeEx&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Created by myself (BMacZero).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;SnakeEx was created for the &lt;a href=&quot;https://codegolf.stackexchange.com/a/47555/32671&quot;&gt;Language Design: 2-D Pattern Matching&lt;/a&gt; challenge. It uses a regex-like syntax to detect matches in a two-dimensional block of text.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.brianmacintosh.com/snakeex/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Online Interpreter&lt;/a&gt; - &lt;a href=&quot;http://www.brianmacintosh.com/snakeex/spec.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Full Language Spec&lt;/a&gt; - &lt;a href=&quot;http://www.brianmacintosh.com/snakeex/snake-ex.js&quot; rel=&quot;nofollow noreferrer&quot;&gt;Javascript Source&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/nfggG.png&quot; alt=&quot;interpreter screenshot&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A SnakeEx programs defines a number of &quot;snakes&quot;, which are like regexes that can move through the text in any 2D direction rather than just left-to-right. Snakes can be called like functions, allowing recursion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Hello World&lt;/strong&gt;(ish): matches the string &quot;Hello, World!&quot; going in any direction (crossword-style)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;m:&amp;lt;*&amp;gt;Hello, World\!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Maze Solver&lt;/strong&gt;: finds all routes through an ASCII maze where the walkable space is periods&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;m{E}:$(&amp;lt;P&amp;gt;\.)+$&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/48097/ascii-topology-pt-1-can-i-count-on-you/48260#48260&quot;&gt;Counting Loops&lt;/a&gt;&lt;/strong&gt;: counts the number of ASCII-art loops in the input&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;m:({e&amp;lt;&amp;gt;PE}\-[|\-]*&amp;lt;T&amp;gt;\+|[|\-]*&amp;lt;T&amp;gt;)+`\+&#xA;e:\+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Its primary limitation is a lack of defined output (when I solve PPCG problems with it, I usually wrap it in a Javascript function). Another area for potential improvement is matching the edges of the input (this is currently accomplished with &lt;code&gt;$&lt;/code&gt;, but code that has to do this is not very elegant).&lt;/p&gt;&#xA;" OwnerUserId="32671" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2015-11-07T02:27:14.800" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7402" PostTypeId="1" CreationDate="2015-11-07T06:51:12.833" Score="6" ViewCount="471" Body="&lt;p&gt;We already have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;question about default I/O&lt;/a&gt; for general &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; submissions. However, entries in machine code have different built-in I/O capabilities from entries in high-level languages. Should they be allowed by default to input/output differently?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this question, consider a machine code &lt;em&gt;function&lt;/em&gt; to be a program that includes a &lt;code&gt;ret&lt;/code&gt;urn or similar command. (Classifying machine code entries into programs vs. functions is a separate issue; if you disagree, respond in comments.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The current consensus is that functions and full programs may do I/O using the same methods, but just in case that changes, I'm making a distinction.&#xA;Some options for input and output (to be considered separately):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Through any port&lt;/li&gt;&#xA;&lt;li&gt;Through a specified port&lt;/li&gt;&#xA;&lt;li&gt;In any register&lt;/li&gt;&#xA;&lt;li&gt;In a specified register (e.g. the accumulator)&lt;/li&gt;&#xA;&lt;li&gt;Using cdecl/stdcall conventions (thanks, @feersum)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I was inspired to ask this question by &lt;a href=&quot;https://codegolf.stackexchange.com/a/62775/39328&quot;&gt;my answer&lt;/a&gt; to the Truth Machine catalog, which uses the single data bus on a Motorola MC14500 microcontroller as I/O. The OP ruled that valid, but we should have defaults for the future.&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-11-08T20:32:44.293" Title="Machine code Input/Output defaults" Tags="|discussion|policy|code-golf|defaults|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7404" PostTypeId="2" ParentId="2140" CreationDate="2015-11-07T08:18:39.567" Score="1" Body="&lt;h2&gt;Convert your Language to Turing Machine Code&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You are locked into a room, with only a laptop and a single-bidirectionallyinfinite-tape, two symbols Turing Machine (Therefore supports only 0s and 1, and it has a tape which is infinite in both directions). Your perverted captor set you a task: he will set you free only if solve all of the problems on the &lt;a href=&quot;https://projecteuler.net/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Project Euler&lt;/a&gt; page.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, there is a catch. You are not allowed to solve the problem using your laptop, but you'll need to use the Turing Machine instead.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since you think it will be incredibly tedious to convert your code to Turing Machine Code, you decided to write an source-to-source compiler on your computer, and since you're incredibly eager to get out, you decide to write your code in the shortest form possible.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Summary&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Write in your language of choice an compiler that converts your language into your Turing Machine Code.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your language may not need to be completely transformed, but at least the basic operations needed for mathematical computations need to be implemented, therefore you will need to implement at least three of the following, with mandatorily being able to translate a looping construct of your language, then for each more operator implemented you will get a 10% bonus:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Addition&lt;/li&gt;&#xA;&lt;li&gt;Subtraction&lt;/li&gt;&#xA;&lt;li&gt;Division&lt;/li&gt;&#xA;&lt;li&gt;Multiplication&lt;/li&gt;&#xA;&lt;li&gt;Modulus&lt;/li&gt;&#xA;&lt;li&gt;Looping (Mandatory)&lt;/li&gt;&#xA;&lt;li&gt;Bitwise operators: &amp;amp;(AND) |(OR) ^(XOR) !(NOT) (they count as 3 distinct ones)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In practice your code should be able to translate at least a primality testing algorithm into Turing Machine Code. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When I refer to Turing Machine Code, I refer to code for &lt;a href=&quot;https://github.com/WizardOfMenlo/TMLStdREPL&quot; rel=&quot;nofollow noreferrer&quot;&gt;TML&lt;/a&gt; (Syntax explained later here)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Technicalities&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The turing machine does not support decimal numbers, only binary, so you may (or may not if you have a better method) write numbers in unary. e.g &lt;code&gt;11111011&lt;/code&gt; are respectively 5 and 2&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Since the Turing Machine does not have a predefined IO, you may consider leaving the return value on the tape and halting as returning a value. e.g &lt;code&gt;111110000&lt;/code&gt; and halting will return 5.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For the Input, you have full access to the starting tape, according that you don't do any other operation rather than initializing the variables. e.g if you implemented &lt;code&gt;add(a,b)&lt;/code&gt; and run &lt;code&gt;add(5,7)&lt;/code&gt; you may initialize the tape to this: &lt;code&gt;1111101111111&lt;/code&gt; or &lt;code&gt;11111001111111&lt;/code&gt; or &lt;code&gt;111110001111111&lt;/code&gt; exc. but you may not initialize the tape to: &lt;code&gt;111111111111&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://github.com/WizardOfMenlo/TML&quot; rel=&quot;nofollow noreferrer&quot;&gt;TML Language description&lt;/a&gt;. TML which is the language your are interpreting your code to, uses a systems of cards, in this form &lt;code&gt;0{0-1}{0-1}{Integer}-1{0-1}{0-1}{Integer}&lt;/code&gt; where the first value determines which piece of code to execute (reading a value from the tape and comparing it, if it is 0 it will execute the code after the 0 until the dash, else the other piece of code), the second one tells what to write on the tape(0, 1), the third one finally tells the tape whether to go left(1) or right(0). The last value tells us to which card to go next, with the card 0 reserved for halting.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Note that TML is not 100% complete, so if your code follows the specs, but doesn't actually work just let me know, so I can fix the Language interpreter (if it's actually broken)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is Code Golf, so the shortest code wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compiler&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compiler&amp;#39;&quot; rel=&quot;tag&quot;&gt;compiler&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="42504" LastEditorUserId="42504" LastEditDate="2015-11-08T08:45:24.767" LastActivityDate="2015-11-08T08:45:24.767" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="7408" PostTypeId="1" CreationDate="2015-11-07T20:42:38.533" Score="2" ViewCount="294" Body="&lt;p&gt;Throughout all of PPCG, we can find questions relating to the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. Unfortunately, finding the lowest byte answer for questions can be difficult if not frustrating without an automatic system for scoring.&lt;/p&gt;&#xA;&lt;h3&gt;Good thing we have a scoreboard!&lt;/h3&gt;&#xA;&lt;p&gt;Shame it's sometimes hard to find, and new users might not have even encountered it before.&lt;/p&gt;&#xA;&lt;h3&gt;Therefore, the Feature Request:&lt;/h3&gt;&#xA;&lt;p&gt;Why not have a bot of some sort, a dummy user, that does one of the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;edits in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; questions and adds the scoreboard onto the end of the file?&lt;/li&gt;&#xA;&lt;li&gt;edits all challenges with a new tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/scoreboard&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;scoreboard&amp;#39;&quot; rel=&quot;tag&quot;&gt;scoreboard&lt;/a&gt; and adds the scoreboard onto the end of them, also removing the tag?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The latter existing for moderators to instantly add a scoreboard or for users without automatic editing to suggest the scoreboard.&lt;/p&gt;&#xA;&lt;h3&gt;Or, Even Better:&lt;/h3&gt;&#xA;&lt;p&gt;Add it to the &lt;strong&gt;Featured&lt;/strong&gt; menu over on the right and the introduction page. This gives the newer users the opportunity to find it quickly and for current users to be able to get it quickly as well. (as suggested by @AlexA.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-09T21:10:34.927" Title="Code Golf Scoreboards" Tags="|feature-request|status-declined|code-golf|" AnswerCount="5" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7409" PostTypeId="2" ParentId="7408" CreationDate="2015-11-07T20:49:05.753" Score="6" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Whether a challenge contains a leaderboard should be up to the challenge author; it should not be inserted automatically. If a challenge author wants one, they can use Martin's template. Not all challenges are the same so a one-size-fits-all leaderboard doesn't always make sense anyway.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Further, tags are intended to categorize challenges. As such, a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/scoreboard&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;scoreboard&amp;#39;&quot; rel=&quot;tag&quot;&gt;scoreboard&lt;/a&gt; tag or similar makes no sense in terms of the purpose of tags. If at any time no challenges bear this tag, it will be automatically deleted by the system, so it would have to be continuously recreated anyway.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;New users are no more likely to know of the existence of a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/scoreboard&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;scoreboard&amp;#39;&quot; rel=&quot;tag&quot;&gt;scoreboard&lt;/a&gt; tag (or auto-insert keyword for that matter) than they are of Martin's template. People developing challenges can just copy the template for themselves. If a new user wants one, we can provide a link to it or we can just edit it into the post.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="20469" LastEditDate="2015-11-07T21:14:26.093" LastActivityDate="2015-11-07T21:14:26.093" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7410" PostTypeId="2" ParentId="7408" CreationDate="2015-11-07T20:59:15.080" Score="2" Body="&lt;h1&gt;Leaderboard inclusion statement&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We don't need a tag statement for this! Just add one of the following line to your question:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# Leaderboard&#xA;&#xA;## Leaderboard&#xA;&#xA;Leaderboard&#xA;=&#xA;&#xA;Leaderboard&#xA;-&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Let the bot edit all questions with this heading so that there is a leaderboard afterwards! This is a non-intrusive way of doing it; this heading doesn't appear when &lt;em&gt;not&lt;/em&gt; referring to the scoreboard, and nothing else is really used to refer to the scoreboard anyhow.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;On the issue of a common keyword and solution&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I concede that the word &quot;Leaderboard&quot; is too broad. I then suggested &quot;Bot Leaderboard&quot;; this was also deemed to broad. Agreed, there might be one or two posts that have this title. So let us therefore reason together, not attack one another! We could use &lt;em&gt;any of the following&lt;/em&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Leaderboard bot&lt;/li&gt;&#xA;&lt;li&gt;include leaderboard&lt;/li&gt;&#xA;&lt;li&gt;{{Leaderboard}}&lt;/li&gt;&#xA;&lt;li&gt;PPCG leaderboard&lt;/li&gt;&#xA;&lt;li&gt;~ leaderboard&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Do not limit yourself to my words. The possibilities are endless.&lt;/p&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="31957" LastEditDate="2015-11-07T21:22:17.523" LastActivityDate="2015-11-07T21:22:17.523" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="7411" PostTypeId="2" ParentId="7408" CreationDate="2015-11-07T21:06:35.127" Score="13" Body="&lt;h1&gt;No.&lt;/h1&gt;&#xA;&lt;p&gt;To have bots that autonomously make edits is annoying, intrusive, and error-prone. If someone wants to have a Stack Snippet, he/she should edit it in manually.&lt;/p&gt;&#xA;" OwnerUserId="30688" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-07T21:06:35.127" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7412" PostTypeId="2" ParentId="7408" CreationDate="2015-11-07T21:34:21.977" Score="8" Body="&lt;h2&gt;Make the template a featured meta post &lt;a href=&quot;/questions/tagged/status-declined&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-declined&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-declined&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;That way it would appear on the right side next to the link to the sandbox. That would make it visible. Anyone who wants it can just click on it, copy, paste, done.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; Per moderator consensus, we have decided not to move forward with this idea.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="20469" LastEditDate="2015-11-09T21:10:34.927" LastActivityDate="2015-11-09T21:10:34.927" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7413" PostTypeId="2" ParentId="7408" CreationDate="2015-11-07T21:37:50.787" Score="-1" Body="&lt;h2&gt;Somewhat&lt;/h2&gt;&#xA;&lt;p&gt;There are plenty of good arguments presented here against using a tag, or a simple keyword, to automatically include a leaderboard snippet.&lt;/p&gt;&#xA;&lt;p&gt;However, at the same time, there is a &lt;em&gt;huge&lt;/em&gt; learning curve for new users on this site:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7294/42963&quot;&gt;Is there simple example or demo to show how to play with this community?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7261/42963&quot;&gt;Are newbies allowed to write programs in golf languages?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7334/42963&quot;&gt;Standard New User Welcome Messages&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1499/42963&quot;&gt;The new user dilemma&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5773/42963&quot;&gt;Should we add more warnings/notifications before letting a new user post?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/842/42963&quot;&gt;How are new users supposed to participate on this site?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And those are just a result of a quick search.&lt;/p&gt;&#xA;&lt;p&gt;Possible solutions to this:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Add an immediate leaderboard snippet, as suggested&lt;/li&gt;&#xA;&lt;li&gt;Better phrase the &amp;quot;Ask a Question&amp;quot; page, maybe with a &amp;quot;Helpful Links&amp;quot; section&lt;/li&gt;&#xA;&lt;li&gt;Consolidate a lot of the above, including the Leaderboard snippet, into a &amp;quot;Featured&amp;quot; Meta post&lt;/li&gt;&#xA;&lt;li&gt;Consolidate a lot of the above into our Tour&lt;/li&gt;&#xA;&lt;li&gt;Other?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-07T21:37:50.787" CommentCount="7" CommunityOwnedDate="2015-11-07T21:37:50.787" ContentLicense="CC BY-SA 3.0" />
  <row Id="7415" PostTypeId="2" ParentId="2140" CreationDate="2015-11-07T23:43:30.047" Score="1" Body="&lt;p&gt;Oh, no! There's been a fire at Claus HQ, and it's destroyed Santa's flight route! He has called on you to come up with a route that has him arriving at every home between the hours of 9PM Christmas Eve and 7AM Christmas Day. He'd also like to finish his deliveries in as little time as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program will take data for as many geographical areas as you or Santa chooses to enter. For every geographical area to be added, your program will accept:the name of the area, and the geographical coordinates of the area's center and the number of &quot;nice&quot; children who live in that geographical area.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output In a .csv file your program will place:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1) Each geographical area's name, 1 per line, listed in order, with the area to be visited first placed first, and the area to be visited last placed last.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2) Next to the name, an ETA to the area in local time, and estimated time of departure, assuming Santa takes about 1/6100 seconds per child.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;3) At the last line of the file, the total number of miles travelled, as determined by the sum of the great-circle distances - determined using the Vincenty formula, assuming an oblate spheroid Earth - from each stop to the next. Other than as stated above, I don't care what your file looks like. Rules&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-You may not use any external library to perform any task except the following:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;--Converting from one timezone to another.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-You may give your output file whatever name you choose.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-Estimated departure times must be no later than 7:01 AM.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Scoring For simplicity, scoring will be done using US states as areas. The population inputted will be the number of 14-and-under Christians residing in each state.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You get 1 point for every thousand miles travelled and an additional point for every hour of travel.&lt;/p&gt;&#xA;" OwnerUserId="25140" LastActivityDate="2015-11-07T23:43:30.047" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7418" PostTypeId="1" CreationDate="2015-11-08T10:02:31.350" Score="2" ViewCount="129" Body="&lt;p&gt;If your solution for a question requires, say, two functions, that should be called one after another, is it acceptable to define the two functions, with it being expected that the user will invoke the two in sequence?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That is, if you define two functions &lt;code&gt;f(x)&lt;/code&gt; and &lt;code&gt;g(x)&lt;/code&gt;, with the intention being that the user would call them as &lt;code&gt;f(g(x))&lt;/code&gt;, is this an acceptable solution, or does the solution need to have a &lt;code&gt;h(x)=f(g(x))&lt;/code&gt; definition or equivalent, so that the user would simply call &lt;code&gt;h(x)&lt;/code&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What is the community's position on this?&lt;/p&gt;&#xA;" OwnerUserId="21439" LastActivityDate="2015-11-08T10:13:58.087" Title="Multiple functions used for solving a question?" Tags="|discussion|answers|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7419" PostTypeId="2" ParentId="7418" CreationDate="2015-11-08T10:13:58.087" Score="12" Body="&lt;h2&gt;Single function call&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The answer must provide a single function to call, i.e. the &lt;code&gt;h(x)=f(g(x))&lt;/code&gt; case, otherwise it would outsource the function composition &lt;code&gt;f(g(x))&lt;/code&gt; to the caller. It also prevents misusing this mechanism, e.g.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Task: take the 4th element of a list. Haskell  answer: &lt;code&gt;head;tail&lt;/code&gt;, call it like &lt;code&gt;head.tail.tail.tail&lt;/code&gt;  &lt;/p&gt;&#xA;" OwnerUserId="34531" LastActivityDate="2015-11-08T10:13:58.087" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7425" PostTypeId="2" ParentId="7402" CreationDate="2015-11-08T20:32:44.293" Score="5" Body="&lt;p&gt;I don't think we should allow different IO methods for programs written in machine code or assembler. Instead I think we should allow some new input methods for &lt;strong&gt;all&lt;/strong&gt; languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we can use functions in languages like C, we sould be able to use them also in assembly. Therefore I think that &lt;strong&gt;we should allow programs to take parameters and return output through the stack&lt;/strong&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some platforms doesn't have a stack by default, so we should find alternative approach. Let's look at the x86 architecture. There used to be thing called BIOS. When DOS calls a BIOS function, it uses registers to pass arguments and get return values. I think that similarly &lt;strong&gt;we should allow programs to take arguments in registers and return values using them&lt;/strong&gt;. Value in register can be either input/output value or pointer to it (e.g. pointer to C-style string).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That kind of functions should end with &lt;code&gt;ret&lt;/code&gt; (or similar) statement.&lt;/p&gt;&#xA;" OwnerUserId="20569" LastActivityDate="2015-11-08T20:32:44.293" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7431" PostTypeId="1" CreationDate="2015-11-09T19:41:08.787" Score="13" ViewCount="442" Body="&lt;p&gt;&lt;a href=&quot;http://esolangs.org/wiki/Folders&quot; rel=&quot;nofollow&quot;&gt;Folders&lt;/a&gt; is an esoteric programming language without any files at all. Instead, the program is represented by the directory structure instead, so our normal rules for counting the file size of the program won't work here (or all Folders programs would be zero bytes, which is clearly impractical).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So how should Folders programs be counted? Two options I can think of:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Define an ASCII representation of a Folders program and count that.&lt;/li&gt;&#xA;&lt;li&gt;Count how many bytes the folders take up in the file system (if that is easy to determine, and then the question is which file system should be used).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2017-02-11T04:22:50.140" Title="How to count programs in Folders?" Tags="|discussion|policy|code-golf|rules|scoring|" AnswerCount="2" CommentCount="0" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7432" PostTypeId="2" ParentId="7431" CreationDate="2015-11-09T19:45:19.780" Score="3" Body="&lt;p&gt;As far as I understand, the folder names are the commands, while the hierarchy provides the structure, like opening and closing braces in C-style languages &lt;code&gt;{}&lt;/code&gt;. So I suggest counting...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;...the total length of all folder names plus:&lt;/li&gt;&#xA;&lt;li&gt;...one (or two or more) byte/s for each folder.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This seems to be pretty much consistent with earlier discussions:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4933/counting-bytes-for-multi-file-programs&quot;&gt;Counting bytes for multi-file programs&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default?answertab=votes#comment3902_1072&quot;&gt;Loopholes that are forbidden by default&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2015-11-09T19:55:11.087" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="7433" PostTypeId="2" ParentId="2140" CreationDate="2015-11-09T22:32:49.100" Score="1" Body="&lt;h1&gt;First 100 Twin Primes&lt;/h1&gt;&#xA;&lt;h3&gt;What Are Twin Primes?&lt;/h3&gt;&#xA;&lt;p&gt;Twin primes are two prime numbers that has a gap of 2 between them; i.e. 3-5, 5-7, 11-13...&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Goal&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take no input and print first 100 twin primes to STDOUT.&lt;/li&gt;&#xA;&lt;li&gt;Shortest code in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your submission should be an executable complete program.&lt;/li&gt;&#xA;&lt;li&gt;Every prime couple should be on a new line.&lt;/li&gt;&#xA;&lt;li&gt;Printed twins should have a space between them.&lt;/li&gt;&#xA;&lt;li&gt;All standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules are applied.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Restrictions&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No usage of built-in or external methods or functions that returns a&#xA;prime number.&lt;/li&gt;&#xA;&lt;li&gt;No hardcoded prime numbers except 2 (as number, not count).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Any suggestions? I looked to similar questions but i couldn't see an identical one.&lt;/p&gt;&#xA;" OwnerUserId="46872" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-09T22:32:49.100" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7442" PostTypeId="2" ParentId="2140" CreationDate="2015-11-10T18:07:28.863" Score="0" Body="&lt;h1&gt;Vigenère Cipher&lt;/h1&gt;&#xA;&lt;p&gt;Write a program that is capable of breaking a text encyripted using Vigenère cipher encyription.&lt;/p&gt;&#xA;&lt;h3&gt;Goals:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take &lt;em&gt;encripted text&lt;/em&gt; from STDIN and write &lt;em&gt;plaintext&lt;/em&gt; to STDOUT.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Limits&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Keyword&lt;/em&gt; will always be 3 letters in length.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Plaintext&lt;/em&gt; will always be in between 5-10 letters in length (inclusive).&lt;/li&gt;&#xA;&lt;li&gt;All &lt;em&gt;Plaintext&lt;/em&gt;s, &lt;em&gt;Keyword&lt;/em&gt;s and &lt;em&gt;Encyripted Text&lt;/em&gt;s will be in English.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Scoring:&lt;/h3&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. Shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I'm not sure if this is a valid and solvable question, so any suggestions are welcomed.&lt;/p&gt;&#xA;" OwnerUserId="46872" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-10T18:07:28.863" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7444" PostTypeId="2" ParentId="6918" CreationDate="2015-11-10T21:30:57.633" Score="16" Body="&lt;h1&gt;Brian &amp;amp; Chuck&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Brian &amp;amp; Chuck was created by me, Martin Büttner, in November 2015.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It was originally created for the language-design challenge  &lt;a href=&quot;https://codegolf.stackexchange.com/q/61804/8478&quot;&gt;Create a programming language that only appears to be unusable&lt;/a&gt;. I had been considering the concept of a programming language with two interacting programs for a while, and the challenge seemed like a good incentive to give it a try with a very minimal instruction set. I'm quite happy with the result and will probably use the language outside of that challenge occasionally.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The language is based on &lt;a href=&quot;http://esolangs.org/wiki/Brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brainfuck&lt;/a&gt; (hence the horrible pun of a name) and took some inspiration from &lt;a href=&quot;https://esolangs.org/wiki/Self-modifying_Brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;Self-modifying Brainfuck&lt;/a&gt;, but programming in it feels quite different from both of those. The design goals were&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The language should be Turing-complete.&lt;/li&gt;&#xA;&lt;li&gt;Neither of the two subprograms should in itself (or with some trivial help from the other program) be Turing-complete.&lt;/li&gt;&#xA;&lt;li&gt;Both programs together should not be Turing-complete without one program modifying the source code of the other.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;I haven't proven any of those things formally, but it appears that I've at least come close to those goals.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The basic idea is that there are two Brainfuck-&lt;em&gt;like&lt;/em&gt; programs, called Brian and Chuck. The catch is that Brian's memory tape acts as Chuck's source code and vice versa. Furthermore, Brian's tape head is also Chuck's instruction pointer. Only one of them is being executed at a time, starting with Brian. Only Brian can read and only Chuck can write.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main differences from Brainfuck are a) instead of &lt;code&gt;[]&lt;/code&gt; loops, the only control flow command is &lt;code&gt;?&lt;/code&gt; which hands control to the other program if the current cell is non-zero and b) there are two additional commands &lt;code&gt;{&lt;/code&gt; and &lt;code&gt;}&lt;/code&gt; which move the tape head to the left or right until it hits a zero cell.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;B&amp;amp;C turns out to be hard to use but not &lt;em&gt;entirely&lt;/em&gt; unusable, and golfing simple programs in it is actually quite entertaining.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/mbuettner/brian-chuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;GitHub repository&lt;/strong&gt;&lt;/a&gt;. Includes interpreter (Ruby), language specification, example programs and issue tracker.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://esolangs.org/wiki/Brian_%26_Chuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Esolangs page&lt;/strong&gt;&lt;/a&gt;. Largely a copy of the README.md on GitHub.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2015-11-10T21:30:57.633" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7445" PostTypeId="2" ParentId="6918" CreationDate="2015-11-10T22:34:43.777" Score="17" Body="&lt;h2&gt;Seriously&lt;/h2&gt;&#xA;&lt;p&gt;Seriously was created by me, Mego, in November 2015, after several brainstorming sessions in The Nineteenth Byte.&lt;/p&gt;&#xA;&lt;p&gt;Seriously is a stack-based language where every non-null byte in the code represents a command (or will eventually). Null bytes represent EOF, so they cannot be used for commands - they end code files. As such, there is no such thing as an invalid program - every sequence of bytes will do &lt;em&gt;something&lt;/em&gt; (or nothing). In addition, there are no runtime errors - if a command gets different value types from the stack than it expects, it silently exits, and the stack is restored to its previous state.&lt;/p&gt;&#xA;&lt;p&gt;There are 4 main data types in Seriously:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Numerics (ints, floats, and complex values)&lt;/li&gt;&#xA;&lt;li&gt;Strings&lt;/li&gt;&#xA;&lt;li&gt;Lists&lt;/li&gt;&#xA;&lt;li&gt;Functions&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The goal of Seriously is to be extremely terse, with each command having multiple overloads based on the contents of the stack. Many common operations are built-in:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Print &lt;code&gt;Hello, World&lt;/code&gt;, the lyrics to Ninety Nine Bottles of Beer, and the program's source code (quining)&lt;/li&gt;&#xA;&lt;li&gt;Primality testing&lt;/li&gt;&#xA;&lt;li&gt;Calculating the nth Fibonacci number&lt;/li&gt;&#xA;&lt;li&gt;The &lt;code&gt;exp(x)&lt;/code&gt;, &lt;code&gt;gamma(x)&lt;/code&gt;, and many other mathematical functions&lt;/li&gt;&#xA;&lt;li&gt;...and many more!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Links:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/Mego/Seriously&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub repository&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://seriouslylang.herokuapp.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Online interpreter&lt;/a&gt; (mostly works now, post an issue on GitHub if you find a bug or two million)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://seriously.readthedocs.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;Online documentation (WIP)&lt;/a&gt; (thanks to @phase for getting the ball rolling on this)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-28T08:32:33.160" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7447" PostTypeId="1" AcceptedAnswerId="10434" CreationDate="2015-11-11T11:00:54.163" Score="3" ViewCount="790" Body="&lt;p&gt;I had a few discussions regarding &lt;em&gt;to use or not to use&lt;/em&gt; &lt;code&gt;STDIN&lt;/code&gt; in answer written in &lt;strong&gt;PHP&lt;/strong&gt;. Reading from &lt;code&gt;STDIN&lt;/code&gt; is very expensive in PHP consuming &lt;strong&gt;12 bytes&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;fgetc(STDIN) // single character&#xA;fgets(STDIN) // whole line&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr&gt;&#xA;&lt;h2&gt;Different wordings in requirements&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;From&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/q/62732/41859&quot;&gt;Implement a Truth Machine&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;take input from STDIN or an acceptable alternative&lt;/li&gt;&#xA;&lt;li&gt;If your language &lt;strong&gt;cannot&lt;/strong&gt; take input from STDIN, it may take input from a hardcoded variable or suitable equivalent in the program&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/62907/41859&quot;&gt;My answer&lt;/a&gt; was discussed by &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-b%C3%BCttner&quot;&gt;Martin Büttner&lt;/a&gt; as I used a command line argument instead. &lt;a href=&quot;https://codegolf.stackexchange.com/a/63469/41859&quot;&gt;Another answer&lt;/a&gt; ignored the requirements completely and the OP argued:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I went for &amp;quot;or an acceptable alternative&amp;quot;. I figured it's about the technique, not forcebly use STDIN. This is one of the very few 'keep the code shorter' tricks PHP can use, especially compared to the other languages&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr&gt;&#xA;&lt;p&gt;&lt;strong&gt;From&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/q/63391/41859&quot;&gt;Write a Program that Writes a function BUT in a different language!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Write the shortest program &lt;strong&gt;that takes one input (n) from STDIN (or equivalent)&lt;/strong&gt; […]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/63429/41859&quot;&gt;My answer&lt;/a&gt; using &lt;code&gt;STDIN&lt;/code&gt; was also discussed:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Why not just &lt;code&gt;x=&amp;gt;x+&amp;lt;?=$x;&lt;/code&gt;? It's valid PHP4.1 and you can pass the values over POST, GET, SESSION, COOKIE, ... and it will work flawlessly. Or on PHP5.3 with register_globals=on (on your php.ini file).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr&gt;&#xA;&lt;h2&gt;My questions&lt;/h2&gt;&#xA;&lt;p&gt;Keeping in mind that &lt;code&gt;STDIN&lt;/code&gt; is available in PHP.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do you need to read from &lt;code&gt;STDIN&lt;/code&gt; in requirements like &lt;code&gt;from STDIN or an acceptable alternative&lt;/code&gt; or is any other method acceptable?&lt;/li&gt;&#xA;&lt;li&gt;Is a command line argument an acceptable alternative to &lt;code&gt;STDIN&lt;/code&gt; in?&lt;/li&gt;&#xA;&lt;li&gt;Is using &lt;code&gt;register_globals=on&lt;/code&gt; acceptable?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If the last two methods are in fact acceptable, then all PHP answers could get rid of &lt;code&gt;$argsv[n]&lt;/code&gt; and &lt;code&gt;fget[c/s](STDIN)&lt;/code&gt; and simply use &lt;code&gt;$a … $n&lt;/code&gt; based on the amount of input values.&lt;/p&gt;&#xA;&lt;hr&gt;&#xA;&lt;p&gt;This question is narrowed to PHP but the answers may apply for other languages as well.&lt;/p&gt;&#xA;&lt;hr&gt;&#xA;&lt;h3&gt;Related&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/41859&quot;&gt;Default for Code Golf: Input/Output methods&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1459/41859&quot;&gt;What counts as stdin?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41859" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-27T09:02:20.843" Title="PHP and &quot;STDIN or an acceptable alternative&quot;" Tags="|discussion|answers|rules|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7448" PostTypeId="1" AcceptedAnswerId="7450" CreationDate="2015-11-11T18:43:44.733" Score="19" ViewCount="456" Body="&lt;p&gt;I'm asking in general, but in my specific case I was working on an answer for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/63433/programming-a-pristine-world&quot;&gt;Programming a Pristine World&lt;/a&gt; and got &lt;code&gt;$&amp;gt;&amp;lt;&amp;lt;&quot;%c&quot;*5%%w(w o r l d)&lt;/code&gt;. The fatal flaw here is that &lt;code&gt;#&amp;lt;&amp;lt;&lt;/code&gt; accepts an array, so if &lt;code&gt;&quot;%c&quot;*5%&lt;/code&gt; is removed, &lt;code&gt;$&amp;gt;&amp;lt;&amp;lt;%w(w o r l d)&lt;/code&gt; is a valid program. I'd still like to post this for two reasons:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It took effort, and I don't want it to be a complete waste&lt;/li&gt;&#xA;&lt;li&gt;Somebody may be able to find a way to make it work, and then make it a valid answer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Can I still post this as an answer? Should it perhaps be a comment?&lt;/p&gt;&#xA;" OwnerUserId="13400" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2015-11-23T13:17:34.000" Title="Is there a place I can place my so-close-but-not-quite answer?" Tags="|discussion|answers|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7450" PostTypeId="2" ParentId="7448" CreationDate="2015-11-11T18:56:53.240" Score="31" Body="&lt;p&gt;I can see how it can be frustrating not to be able to share an &lt;em&gt;almost&lt;/em&gt; working solution, but I think if we allowed them, we'd be opening a much bigger can of worms. Just how valid does a solution need to be to be allowed as an answer? So please refrain from posting it anyway, because that would send the wrong message about our quality standards. I also don't think that making an answer community wiki should free an answer from those quality standards - after all it can still accumulate votes that would let it bubble up beyond some valid answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are other channels where you can show your (almost working) solution:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Leave a comment on the question. If the (non-)solution is too long for a comment, link to it in a pastebin or so. (Note however that comments aren't guaranteed to remain forever. While I don't think any of the mods would remove such a comment on sight, it might vanish in a general comment purge when other comments become too chatty in the same thread.)&lt;/li&gt;&#xA;&lt;li&gt;If applicable, leave a comment on a similar answer in the same language.&lt;/li&gt;&#xA;&lt;li&gt;Post it &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;in chat&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If you &lt;em&gt;do&lt;/em&gt; have a (different) valid answer, include it as a note in that answer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Usually one of these will be quite appropriate for the two goals you want to achieve.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2015-11-11T19:41:52.637" LastActivityDate="2015-11-11T19:41:52.637" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7460" PostTypeId="2" ParentId="2140" CreationDate="2015-11-13T08:15:23.060" Score="1" Body="&lt;h1&gt;Nondeterministic Turing Machine&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We all know the concept of Turing machines, if not let's reiterate the concept. We have the following things that define a Turing machine:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A &lt;em&gt;tape&lt;/em&gt; that is divided into cells and is (potentially) infinite to the right.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A &lt;em&gt;read/write&lt;/em&gt; head that moves along the tape and reads and writes from it&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A &lt;em&gt;state&lt;/em&gt; that changes according to what the head read&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A &lt;em&gt;transition function&lt;/em&gt; that defines state changes and the direction in which the head shall move, based on the current state and the input read.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;We can now have to supply some input, and the definition of the transition function (the set of states is implicit, and contains all states defined in the function). Additionally we assume that the alphabet is [0-9a-zA-Z!?()^+-] and &lt;em&gt;space&lt;/em&gt; is the blank symbol. The tape head is then postioned over the leftmost character on the &lt;em&gt;tape&lt;/em&gt;, which in our case is the first character of the input tape. The machine then starts applying the transition function. The computation continues until one of the following happens:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The machine reaches the &lt;em&gt;HALT&lt;/em&gt; state&lt;/li&gt;&#xA;&lt;li&gt;There is no transition defined in the transition function for the current state with the given input.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If the first case occurs, we say that the machine &quot;accepts&quot; the word. If the second case occurs we say that the machine &quot;rejects&quot; the word.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We can now extend this definition, to obtain a &lt;em&gt;nondeterministic&lt;/em&gt; Turing Machine. To do this we allow the transition function to define more than one &quot;next&quot; state for each state/input combination. The machine can then choose which &quot;execution path&quot; to take. We then say that the machine accepts the word if it reaches the &quot;HALT&quot; state in &lt;em&gt;any&lt;/em&gt; execution path, and it rejects it if it does not reach this state in &lt;em&gt;all&lt;/em&gt; exection pats.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Problem definition&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You must supply a program or function that accepts a &lt;code&gt;string&lt;/code&gt; and returns a &lt;code&gt;truth-ish value&lt;/code&gt; (either true/false, or 0/1, or anything else, at long as the meaning is clear) indicating wheter the word is accepted for at least one computation path or not. The input has the following for:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(&amp;lt;current_state&amp;gt;,&amp;lt;input_read&amp;gt;,&amp;lt;output&amp;gt;,&amp;lt;follow_up_state&amp;gt;,&amp;lt;move_direction&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;All the parts of the tuple are provided as strings where&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;lt;input read&amp;gt;&lt;/code&gt; is a string of length 1, which can contain any character except &quot;,&quot;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;lt;output&amp;gt;&lt;/code&gt; is also a string of length 1&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;lt;move_direction&amp;gt;&lt;/code&gt; is either &quot;l&quot; (move left) or &quot;r&quot; (move right)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You may assume the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The machine will always halt (i.e. no infite loops)&lt;/li&gt;&#xA;&lt;li&gt;There is only one state on which the machine halts which is &lt;em&gt;HALT&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;The alphabet is [0-9a-zA-Z!?()^+-] plus &lt;em&gt;space&lt;/em&gt; as the blank symbol&lt;/li&gt;&#xA;&lt;li&gt;The leftmost character is always a blank, to indicate the ending of the tape on the left side.&lt;/li&gt;&#xA;&lt;li&gt;States are defined implicitly by the tranistion function. So the only states the machine knows are the one that occure during the definition of the transition function and there is no explicit definition of the states.&lt;/li&gt;&#xA;&lt;li&gt;The initial state is always &lt;code&gt;s_i&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The input has the following form&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;nr_of_tuples_for_definition_of_transition_function&amp;gt;&#xA;&amp;lt;tuple_1&amp;gt;&#xA;&amp;lt;tuple_2&amp;gt;&#xA;...&#xA;&amp;lt;tuple_n&amp;gt;&#xA;&amp;lt;input_string&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;All lines end with a newline character (\n) and the input string is not under double quotes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard loopholes are disallowed! Shortest answer in byte wins.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Notes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Working example is still missing, I'll update that in the following days&lt;/p&gt;&#xA;" OwnerUserId="46259" LastEditorUserId="46259" LastEditDate="2015-11-16T11:35:50.267" LastActivityDate="2015-11-16T11:35:50.267" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7463" PostTypeId="2" ParentId="6918" CreationDate="2015-11-14T01:53:10.763" Score="10" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/vihanb/TeaScript&quot; rel=&quot;nofollow noreferrer&quot;&gt;TeaScript&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;TeaScript started off simple:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After months of being &lt;a href=&quot;https://codegolf.stackexchange.com/a/53677/40695&quot;&gt;plagued&lt;/a&gt; by JavaScripts verbose property names, and repetitive nature. I decided it was time for a change.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That's when &lt;a href=&quot;https://github.com/vihanb/TeaScript&quot; rel=&quot;nofollow noreferrer&quot;&gt;TeaScript&lt;/a&gt; was born.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Most JavaScript answers use often ingenious techniques to shave off each and every byte possible but still are left behind with large byte counts with long property names such as &lt;code&gt;String.fromCharCode&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TeaScript originally didn't have big dreams. It started off as a very simple language which exactly like JavaScript, but shorter property names.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After posting my &lt;a href=&quot;https://codegolf.stackexchange.com/a/61621/40695&quot;&gt;first&lt;/a&gt; answer I realized how big of a difference this could make and so I headed off and started brewing more features.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Eventually, I was hardcoding many things. Features were getting cluttered and the source code was getting very cluttered. TeaScript wasn't designed for so much golfing so I completely rewrote the code with &lt;em&gt;TeaScript 2!&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TeaScript 2 adds many new features such as unicode shortcuts, a fancy interpreter, &lt;strong&gt;automatic golfing&lt;/strong&gt;, and many more built-ins. I'm working on a &lt;em&gt;&lt;a href=&quot;https://github.com/vihanb/TeaScript/tree/feature-stream&quot; rel=&quot;nofollow noreferrer&quot;&gt;TeaScript 3&lt;/a&gt;&lt;/em&gt; which will hopefully being TeaScript closer to competing with CJam and Pyth.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;What makes TeaScript different is TeaScript is not just a language that compiles to JavaScript. It &lt;strong&gt;&lt;em&gt;is&lt;/em&gt;&lt;/strong&gt; JavaScript, extended.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Example: This outputs an array of each character code of the input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Σc&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output for &lt;code&gt;Hello, World!&lt;/code&gt;: &lt;code&gt;[72,101,108,108,111,44,32,87,111,114,108,100,33]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://vihanserver.tk/p/TeaScript/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Interpreter&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/vihanb/TeaScript&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github (you should totally star TeaScript)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://teascript.rtfd.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;Documentation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-03-30T03:57:44.117" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7464" PostTypeId="1" CreationDate="2015-11-14T05:19:57.833" Score="9" ViewCount="267" Body="&lt;p&gt;Almost all of our challenges on PPCG have the implied rule of no standard loopholes. However, I have seen many answers (mainly from new users) that contain some of these standard loopholes. Should we feature the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;standard loophole thread&lt;/a&gt; to allow for easier accessing of the information to new and curious users, and lower the chance of these invalid answers?&lt;/p&gt;&#xA;" OwnerUserId="36670" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-11-14T08:01:15.367" Title="Should the standard loophole meta thread have the featured tag?" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7465" PostTypeId="2" ParentId="7464" CreationDate="2015-11-14T05:40:30.380" Score="6" Body="&lt;h2&gt;Yes&lt;/h2&gt;&#xA;&lt;p&gt;More visibility for that thread is good. I would also suggest making the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;default I/O methods&lt;/a&gt; post featured as well. The meta featured posts could become sort of a newbie center, since we apparently can't modify the tour.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-14T08:01:15.367" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7466" PostTypeId="2" ParentId="7464" CreationDate="2015-11-14T05:48:20.980" Score="19" Body="&lt;h2&gt;Yes, via FAQ Hub thread&lt;/h2&gt;&#xA;&lt;p&gt;Similar to Mego's answer, but why not feature the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1280/community-faq-for-programming-puzzles-code-golf&quot;&gt;FAQ hub thread&lt;/a&gt;, as all of the FAQ threads need more visibility.&lt;/p&gt;&#xA;" OwnerUserId="36670" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-14T06:02:05.883" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7467" PostTypeId="5" CreationDate="2015-11-14T08:07:50.083" Score="0" Body="&lt;p&gt;Including this tag in your question indicates that your question is specific to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. You should not post challenges or challenge proposals to Meta using this tag. Those belong either on &lt;a href=&quot;https://codegolf.stackexchange.com/questions&quot;&gt;CGCC Main&lt;/a&gt; or in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Use this tag if your question is specific to challenges which use a scoring criteria involving reducing the bytes or characters used in answers. If your question could apply to other scoring criteria but is most common for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges, see if another tag fits your question better (such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/scoring&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;scoring&amp;#39;&quot; rel=&quot;tag&quot;&gt;scoring&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/questions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;questions&amp;#39;&quot; rel=&quot;tag&quot;&gt;questions&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;p&gt;Typical questions with this tag ask about:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Clarifications on how to count bytes under a specific circumstance&lt;/li&gt;&#xA;&lt;li&gt;Clarifications or questions about golfing languages (that is, languages specifically designed for short code, such as &lt;a href=&quot;http://www.golfscript.com/golfscript/&quot; rel=&quot;nofollow noreferrer&quot;&gt;GolfScript&lt;/a&gt;, &lt;a href=&quot;https://sourceforge.net/p/cjam/wiki/Home/&quot; rel=&quot;nofollow noreferrer&quot;&gt;CJam&lt;/a&gt; or &lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Clarifications about how code golf and similar scoring systems work&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="66833" LastEditDate="2020-12-04T01:35:52.500" LastActivityDate="2020-12-04T01:35:52.500" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="7468" PostTypeId="4" CreationDate="2015-11-14T08:07:50.083" Score="0" Body="For questions about code golf challenges and/or submissions. DO NOT post code golf challenges themselves as questions here; those belong on the main site or in the Sandbox if you want to get feedback on them." OwnerUserId="20469" LastEditorUserId="38979" LastEditDate="2019-06-18T23:42:17.477" LastActivityDate="2019-06-18T23:42:17.477" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="7469" PostTypeId="5" CreationDate="2015-11-14T08:08:48.427" Score="0" Body="&lt;p&gt;Use this tag for questions relating to answers on the main site, generally to ask about:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;answer etiquette, such as formatting and content&lt;/li&gt;&#xA;&lt;li&gt;Proposals for new rules or defaults concerning answers&lt;/li&gt;&#xA;&lt;li&gt;Clarifications on existing site rules and defaults&lt;/li&gt;&#xA;&lt;li&gt;Anything else specific to answers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Do not use this tag for questions about specific answers, instead use &lt;a href=&quot;/questions/tagged/specific-answer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;specific-answer&amp;#39;&quot; rel=&quot;tag&quot;&gt;specific-answer&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="66833" LastEditDate="2020-12-05T01:14:40.827" LastActivityDate="2020-12-05T01:14:40.827" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="7470" PostTypeId="4" CreationDate="2015-11-14T08:08:48.427" Score="0" Body="For questions regarding answers posted to challenges. This tag is not for questions about a specific answer, but for answers in general" OwnerUserId="20469" LastEditorUserId="66833" LastEditDate="2020-12-05T01:14:40.827" LastActivityDate="2020-12-05T01:14:40.827" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="7471" PostTypeId="5" CreationDate="2015-11-14T08:10:31.230" Score="0" Body="&lt;p&gt;You should include this tag in your question if:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your question proposes adding or removing a site policy&lt;/li&gt;&#xA;&lt;li&gt;Your question seeks clarification about an existing site policy&lt;/li&gt;&#xA;&lt;li&gt;Your question is, in other ways, specifically about site policies&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Questions can be both general or about a specific policy&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This tag is often used in conjunction with the &lt;a href=&quot;/questions/tagged/defaults&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;defaults&amp;#39;&quot; rel=&quot;tag&quot;&gt;defaults&lt;/a&gt; tag, especially if your question is specific to challenges&lt;/p&gt;&#xA;&lt;p&gt;Note that including this tag &lt;strong&gt;does not&lt;/strong&gt; make your proposal site policy. Proposals generally become site policy if there is a clearly popular answer addressing your question&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="66833" LastEditDate="2020-12-04T01:25:13.183" LastActivityDate="2020-12-04T01:25:13.183" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="7472" PostTypeId="4" CreationDate="2015-11-14T08:10:31.230" Score="0" Body="This tag indicates that your question is about site policies. Usually, new proposals for policies or questions about existing ones will have this tag" OwnerUserId="20469" LastEditorUserId="66833" LastEditDate="2020-12-04T01:25:13.183" LastActivityDate="2020-12-04T01:25:13.183" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="7473" PostTypeId="1" AcceptedAnswerId="7477" CreationDate="2015-11-14T08:13:52.720" Score="16" ViewCount="694" Body="&lt;p&gt;We've had &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/231/thought-on-language-specific-challenges&quot;&gt;discussion&lt;/a&gt; on a related topic before, where the general consensus is that challenges should be language-agnostic by default, but specific-language challenges were also acceptable within reason.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Spurred by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/63825/average-calculator&quot;&gt;this question&lt;/a&gt; (which was closed for an unrelated reason), the discussion was brought up in chat whether we should make challenges that explicitly exclude certain languages off-topic and therefore subject to immediate closure.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What are the thoughts of the community?&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-11-16T14:51:34.497" Title="Disallowing Explicit Exclusion of Languages" Tags="|discussion|close-reasons|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7474" PostTypeId="2" ParentId="7473" CreationDate="2015-11-14T08:13:52.720" Score="13" Body="&lt;h2&gt;Yes, challenges that specifically exclude certain languages or penalize them should be considered off-topic and closed as such&lt;/h2&gt;&#xA;&lt;p&gt;The spirit of this site is to write the shortest code &lt;em&gt;per language&lt;/em&gt; for a challenge, not just the overall shortest code. We do not forbid users from posting answers which have worse scores than existing answers; in fact, we encourage it, for the purpose of getting solutions in every language.&lt;/p&gt;&#xA;&lt;p&gt;Challenges such as the one linked are not in accordance with this spirit - they attempt to exclude languages based on a preconceived notion that some languages are universally better than others for golfing, a notion that is easy to prove false just by looking through the challenges on this site. Prejudiced questions like that one have no place on this site, and should be closed as off-topic.&lt;/p&gt;&#xA;&lt;p&gt;Note that this does not include the &lt;em&gt;implicit&lt;/em&gt; exclusion of languages, such as by requiring functionality that a language might not have (graphical processing, for example), or by disallowing features that the language would otherwise need to answer the challenge (such as certain builtins that trivialize the challenge). In fact, the latter would be a preferable course of action when there is a legitimate reason why using a certain language would confer an unfair advantage; not only does it accomplish the same thing by removing the unfair advantage, it also allows the language to still be used if it can solve the challenge without the unfair advantage, and it also will cover any other languages with similar unfair advantages that might be missed by excluding a specific language or set of languages.&lt;/p&gt;&#xA;&lt;p&gt;This also does not include specific-language challenges, where answers are required to be in a certain language (or one of a certain set of languages, such as the TIOBE Top 20) - those have been decided to be on-topic in the past (see the linked meta post in the question), barring any other major issues in the challenge.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-14T22:10:43.420" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7475" PostTypeId="2" ParentId="2140" CreationDate="2015-11-14T09:33:47.947" Score="3" Body="&lt;h1&gt;Who is the Star Abuser?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; some people often star chat messages without any reason. You decided to go on a quest to find out who is the star abuser.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You logged the chat actions as a string, each action represented by a character (as you are a code golfer after all).&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Every user is marked with a letter of the alphabet.&lt;/li&gt;&#xA;&lt;li&gt;An uppercase version marks the user entering chat and a lowercase one marks his/her leaving the chat.&lt;/li&gt;&#xA;&lt;li&gt;At the start there is no one at the chat room.&lt;/li&gt;&#xA;&lt;li&gt;A star marks a starring. We assume that each person in the chat could have starred with the same probability when a starring happened. (E.g. if there are 2 users in the chat we assume both of them had 50% chance to star.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;An example log:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;MOA***a**oS**s*Cc&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You should output one uppercase letter showing the letter of the user who has the highest number of expected starring. If there are multiple users, output exactly one of them.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;TODO&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Output:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;TODO&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Examples:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;TODO&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is code golf so the shortest entry wins.&lt;/p&gt;&#xA;" OwnerUserId="7311" LastActivityDate="2015-11-14T09:33:47.947" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7476" PostTypeId="2" ParentId="2140" CreationDate="2015-11-14T14:42:09.837" Score="1" Body="&lt;h1&gt;Rounding Fractions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/rational-numbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;rational-numbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;rational-numbers&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Back in the old days of game programming, before FPUs were the norm, games predominantly used fixed-point math to represent non-integer values. Typically, the lower 8 or 12 bits of a 32-bit word are used as fractional parts, and the rest are treated as the integral part. Sometimes when looking at fixed-point constants in old game code, I get confused trying to figure out what they were actually trying to approximate, particularly if it's not a number between 0 and 1 (0x4C = 0.3, 0x119 = 1.1?, 0x73 = ???).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since just rounding 1/256ths and 1/4096ths has a limited range of applications, the challenge here is to take any integer ratio a/b, and output the simplest fraction that rounds down to it. More specifically, output the ratio p/q &lt;em&gt;with lowest denominator&lt;/em&gt; such that a/b ≤ p/q &amp;lt; (a+1)/b.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This code should support any non-negative a and positive b up to at least 10,000, and should run in a reasonable time for anything in that range (nothing on the order of minutes, at least). Answers should be &lt;em&gt;correct&lt;/em&gt;, i.e., no rounding errors due to floating-point. Answers can be in the form of a full program or function, and use any convenient input / output (a string '1/2', an ordered pair (1, 2), a list of two integers {1, 2}, etc).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge is code-golf, lowest score in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some test cases:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1/3 -&amp;gt; 1/3&#xA;4/10 -&amp;gt; 2/5&#xA;33/100 -&amp;gt; 1/3&#xA;66/100 -&amp;gt; 2/3&#xA;67/100 -&amp;gt; 19/28&#xA;115/256 -&amp;gt; 9/20  (who knew?)&#xA;0/417 -&amp;gt; 0/1&#xA;653/654 -&amp;gt; 653/654&#xA;1404/702 -&amp;gt; 2/1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Hey! I'm a long-time lurker, first-time-question-asker; I'm &lt;em&gt;pretty&lt;/em&gt; sure this hasn't been asked before (more general than &quot;Un-round fractions&quot;, not quite &quot;Closest fraction&quot;). Not sure what to set for a deadline before accepting an answer, since this is my first time actually participating. Anything else obvious I missed?&lt;/p&gt;&#xA;" OwnerUserId="39461" LastEditorUserId="39461" LastEditDate="2015-11-14T14:55:59.040" LastActivityDate="2015-11-14T14:55:59.040" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="7477" PostTypeId="2" ParentId="7473" CreationDate="2015-11-14T18:12:38.767" Score="38" Body="&lt;h2&gt;It depends&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I think there are (at least) two very different cases, and the question as posed doesn't distinguish them.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Case 1: banning languages the OP doesn't like&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Penalties for using &quot;golfing languages&quot; have a number of problems. For one, the question &quot;Is XYZ a golfing language?&quot; is subjective. For another, borrowing from a phrase about bringing a knife to a gunfight, on this site it's like going to a rifle range and insisting that people should use epées.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Case 2: banning a specific language which trivialises the question&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;In general, the existence of a language which trivialises a question is a sign that it's a bad question, but there are exceptions. There is a question currently in the sandbox which is about regexes and specifically bans Retina. The question is insanely difficult (if not impossible) in most languages, but boring and trivial in Retina. I think it's sensible to want to avoid someone posting a five-character answer in Retina which would discourage people from trying to figure out a 500-character answer in CJam or Perl.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Similarly, a question which asks you to interpret a specific subset of GolfScript might be &lt;code&gt;~&lt;/code&gt; in GolfScript and &lt;code&gt;q~&lt;/code&gt; in CJam (if it's the right subset!), but actually be an interesting question in other languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In these cases, I think it's as reasonable to ban specific languages as it is to ban the use of built-ins.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2015-11-14T18:12:38.767" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="7478" PostTypeId="2" ParentId="5496" CreationDate="2015-11-15T00:52:21.873" Score="-2" Body="&lt;h1&gt;The Sandbox does not belong in Main...but so what?&lt;/h1&gt;&#xA;&lt;p&gt;We can make &lt;em&gt;one&lt;/em&gt; exception to the rule of &amp;quot;what belongs in Main&amp;quot; for the Sandbox (that is a user defined rule after all). It's not like putting the Sandbox on Main will bring in a slew of other questions that are technically off topic.&lt;/p&gt;&#xA;&lt;p&gt;If the Sandbox gets more attention then question quality can only improve. Presumably the Sandbox will get more attention on Main rather than Meta, just as Doorknob said.&lt;/p&gt;&#xA;&lt;p&gt;The only other issue I see with this is that people would gain/lose rep unless the Sandbox was a community wiki. I see no real issue with simply making the Sandbox a community wiki then. As explained &lt;a href=&quot;https://meta.stackexchange.com/questions/11740/what-are-community-wiki-posts&quot;&gt;here&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Voting on a community wiki post (up or down) does not affect any user's reputation.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;An answer posted to a community wiki question will also be community wiki.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;So no one would gain or lose rep from any votes to their Sandboxed questions. This means that users with good Sandboxed questions don't get loads of extra rep for their questions and (probably new) users with bad Sandbox questions would not lose rep.&lt;/p&gt;&#xA;&lt;p&gt;So I vote that the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt; be migrated to &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;Main&lt;/a&gt; from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/&quot;&gt;Meta&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-15T01:55:53.810" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7479" PostTypeId="2" ParentId="5496" CreationDate="2015-11-15T01:59:12.887" Score="13" Body="&lt;h2&gt;The Sandbox &lt;em&gt;really&lt;/em&gt; does not belong on Main and &lt;em&gt;should&lt;/em&gt; stay on Meta&lt;/h2&gt;&#xA;&lt;p&gt;Let me review the arguments made for moving the Sandbox to main (from the question):&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Users with less than 5 reputation can still use the sandbox. (This is the most convincing argument, in my opinion.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7084/should-we-remove-the-reputation-requirement-for-answering-on-meta&quot;&gt;The reputation requirement has been removed.&lt;/a&gt; This point is no longer valid.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The visibility of the sandbox is increased. The majority of users do not regularly visit meta, and a question that is probably going to be at the top of the &amp;quot;active questions&amp;quot; list almost perpetually is much more visible than a single line in a small sidebar box.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Main is much more active than Meta. At this time of writing, the last modification to any post in the Sandbox was 2-3 hours ago, and it is the fourth question on the front page of Meta. A question from the same time frame would be #16 on the front page of Main. The Sandbox, if it were on Main, would definitely be bumped up to the top often, but it would be pushed down quite rapidly too.&lt;/p&gt;&#xA;&lt;p&gt;Besides, this is no guarantee that new users will actually &lt;em&gt;&lt;strong&gt;use&lt;/strong&gt;&lt;/em&gt; the Sandbox. The majority of new users don't actually look around and get a feel for how the site works. I would think that, if anything, a new user would be much more likely to be &lt;em&gt;confused&lt;/em&gt; because the Sandbox is so different from everything else. The vast majority (I think) of users who post well-received challenges use the Sandbox, and any user that posts a poor or could-be-better challenge typically gets a link to the Sandbox, so I think we just need to keep doing that. That's how people find out about the Sandbox and the (positive!) peer pressure makes them use it.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It would make more sense there anyway; meta is for discussion about this Stack Exchange site, while main is where the programming puzzling and code golfing goes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Actually, I would consider this to be more an argument for keeping it on Meta. There is lots of discussion and no programming, puzzling, coding, or golfing going on in the Sandbox (or at least, very little). See the paragraph below for more.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Arguments &lt;em&gt;for&lt;/em&gt; keeping the Sandbox on Meta&lt;/h3&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Meta is the right place for the Sandbox.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;On my home site, Christianity.SE, a perfectly valid use of Meta is to ask something like &amp;quot;Would it be acceptable to ask this question: X?&amp;quot; (&lt;a href=&quot;https://christianity.meta.stackexchange.com/questions/2237/is-it-valid-to-ask-if-christianity-teaches-anything&quot;&gt;One&lt;/a&gt;, &lt;a href=&quot;https://christianity.meta.stackexchange.com/questions/5737/can-a-question-ask-for-biblical-basis-without-specifying-a-bible-or-type-of-bibl&quot;&gt;two&lt;/a&gt;, &lt;a href=&quot;https://christianity.meta.stackexchange.com/questions/5720/how-can-we-welcome-more-questions-about-pastoral-care-practices&quot;&gt;three&lt;/a&gt; examples.) In my opinion, the Sandbox fulfills precisely this purpose. It's where users can ask &amp;quot;Is this a good question for the site? Is it an appropriate question for the site?&amp;quot; and get feedback on their ideas before posting them on Main.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The Sandbox is featured in the sidebar&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I don't think anyone has brought this up, but consider this: because the Sandbox is a &lt;a href=&quot;/questions/tagged/featured&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;featured&amp;#39;&quot; rel=&quot;tag&quot;&gt;featured&lt;/a&gt; post on Meta, it is (relatively) prominently displayed in the sidebar near the top. If we moved the Sandbox to Main, we would lose this.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;So what should we do?&lt;/h3&gt;&#xA;&lt;p&gt;I think the biggest problem with the Sandbox is that &lt;em&gt;Sandbox posts get little attention&lt;/em&gt;. This is not a &lt;em&gt;technical&lt;/em&gt; problem; it is a &lt;em&gt;behavioral&lt;/em&gt; problem. I seriously doubt that moving the Sandbox to Main will fix this. It might even get worse because then there would be &lt;em&gt;more&lt;/em&gt; posts and probably not as many people reviewing them (proportionally, not necessarily absolutely).&lt;/p&gt;&#xA;&lt;p&gt;I have a suggestion: &lt;strong&gt;lets encourage one another to review Sandbox posts&lt;/strong&gt;. Every day, look through the ten most recent (by creation or modification) and vote up, vote down, or comment. We have a great spread of time zones that our users live in, so I think this would work pretty well.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;I volunteer to lead this effort if it means the Sandbox stays on Meta.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="12914" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-15T01:59:12.887" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7483" PostTypeId="2" ParentId="2140" CreationDate="2015-11-15T15:58:34.057" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Find runs of triple multiples of squares&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is simple: For a given input N, find all runs of three or more consecutive integers less than N which are all perfect squares or multiples of perfect squares (of numbers greater than 1, obviously).  You should then list each triplet (or greater) on a single line, indicating the square and the factor that divides it, e.g. &lt;code&gt;48 = 2² * 12&lt;/code&gt;.  If a number is a product of two (or more) perfect squares, you may write it in either of two ways, e.g. &lt;code&gt;100 = 2² * 5²&lt;/code&gt; or &lt;code&gt;100 = 10²&lt;/code&gt;.  If your language doesn't support the &lt;code&gt;²&lt;/code&gt; character, you may use &lt;code&gt;^2&lt;/code&gt; instead.  For example, for an N of 1000, your code should produce the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;48 = 2² * 12, 49 = 7², 50 = 5² * 2&#xA;98 = 7² * 2, 99 = 3² * 11, 100 = 10²&#xA;124 = 2² * 31, 125 = 5² * 5, 126 = 3² * 14&#xA;242 = 11² * 2, 243 = 9² * 3, 244 = 2² * 61, 245 = 7² * 5&#xA;342 = 3² * 38, 343 = 7² * 7, 344 = 2² * 86&#xA;350 = 5² * 14, 351 = 3² * 39, 352 = 4² * 22&#xA;423 = 3² * 47, 424 = 2² * 106, 425 = 5² * 17&#xA;475 = 5² * 19, 476 = 2² * 119, 477 = 3² * 53&#xA;548 = 2² * 137, 549 = 3² * 61, 550 = 5² * 22&#xA;603 = 3² * 67, 604 = 2² * 151, 605 = 11² * 5&#xA;724 = 2² * 181, 725 = 5² * 29, 726 = 11² * 6&#xA;774 = 3² * 86, 775 = 5² * 31, 776 = 2² * 194&#xA;844 = 2² * 211, 845 = 13² * 5, 846 = 3² * 94, 847 = 11² * 7, 848 = 4² * 53&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;48 = 2² * 12, 49 = 7², 50 = 5² * 2&#xA;98 = 7² * 2, 99 = 3² * 11, 100 = 2² * 5²&#xA;124 = 2² * 31, 125 = 5² * 5, 126 = 3² * 14&#xA;242 = 11² * 2, 243 = 3² * 3² * 3, 244 = 2² * 61, 245 = 7² * 5&#xA;342 = 3² * 38, 343 = 7² * 7, 344 = 2² * 86&#xA;350 = 5² * 14, 351 = 3² * 39, 352 = 2² * 2² * 22&#xA;423 = 3² * 47, 424 = 2² * 106, 425 = 5² * 17&#xA;475 = 5² * 19, 476 = 2² * 119, 477 = 3² * 53&#xA;548 = 2² * 137, 549 = 3² * 61, 550 = 5² * 22&#xA;603 = 3² * 67, 604 = 2² * 151, 605 = 11² * 5&#xA;724 = 2² * 181, 725 = 5² * 29, 726 = 11² * 6&#xA;774 = 3² * 86, 775 = 5² * 31, 776 = 2² * 194&#xA;844 = 2² * 211, 845 = 13² * 5, 846 = 3² * 94, 847 = 11² * 7, 848 = 2² * 2² * 53&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The input may be supplied via command line, user input, read from a file, or any other means you see fit (though it should not be hardcoded).  This is code golf, so shortest code wins.  Usual loopholes apply.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that these numbers are sometimes called &quot;non-squarefree&quot; numbers, which are listed at &lt;a href=&quot;http://oeis.org/A013929&quot; rel=&quot;nofollow noreferrer&quot;&gt;A013929&lt;/a&gt;.  (This lists all non-squarefree numbers, not just consecutive ones, so it may be useful as a reference, but is not a direct source.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Side note: The 242-245 and 844-848 runs are the only sets of more than 3 below 1000.  It's possible that they become more common at higher numbers, but so far, graphing the sets I know about produces a pretty steady line, with no noticeable curve towards greater or reduced frequency.  It would be interesting to see a mathematical proof on whether there are or are not an infinite number of these sets...&lt;/p&gt;&#xA;" OwnerUserId="42471" LastEditorUserId="42471" LastEditDate="2015-11-23T21:48:45.053" LastActivityDate="2015-11-23T21:48:45.053" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7484" PostTypeId="2" ParentId="2140" CreationDate="2015-11-15T16:14:40.737" Score="8" Body="&lt;h2&gt;King Me - Draughts King of the Hill&lt;/h2&gt;&#xA;&lt;p&gt;Note: I made this CW so someone else can take it over, because I have no desire to make the controller and run the tournament anymore.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Draughts&quot; rel=&quot;nofollow noreferrer&quot;&gt;Draughts&lt;/a&gt; (or checkers, as it is known in the United States) is a well-known international game. I was surprised that we have not had a draughts King of the Hill yet, so here's one! In case you're unfamiliar with the rules (or perhaps you need a refresher), here are the rules for &lt;a href=&quot;https://en.wikipedia.org/wiki/English_draughts&quot; rel=&quot;nofollow noreferrer&quot;&gt;English draughts&lt;/a&gt;, the version we will be playing.&lt;/p&gt;&#xA;&lt;p&gt;Draughts is played on a checkerboard that looks like this:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/QAZL2.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/QAZL2.png&quot; alt=&quot;draughts board&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;There are two players, white and red, who sit on the side of the board closest to their pieces' starting position. White moves first. Normal pieces (men) may move forward (from the perspective of the player; towards the other player) one space along diagonals, or jump over diagonally-adjacent pieces that are in front of them to capture them and remove them from the game. Because pieces can only move diagonally, they will always be on the dark squares of the board.&lt;/p&gt;&#xA;&lt;p&gt;For example, the following move is permitted, and would result in the red piece being captured:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/cmVDH.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/cmVDH.png&quot; alt=&quot;jumping&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Players may jump as many pieces in a row as possible when making their move, which results in all jumped pieces being removed. Normally in draughts, jumping is not optional - if you can jump, you must jump, and you must make the longest jump possible. However, for this game, jumping is optional, and you do not have to make the longest jump possible if you do not wish to.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, when a man reaches the furthest row (the row closest to their opponent), it is promoted to a &amp;quot;king&amp;quot;, which confers the ability to move (and capture) backwards along diagonals.&lt;/p&gt;&#xA;&lt;p&gt;A game is ended when a player's pieces have all been captured or the player cannot make a valid move. The player who cannot move due to being trapped or having no pieces is the loser. To prevent games from going indefinitely, I am adding the additional condition that, if a capture has not happened in 10 turns (a turn being defined as ending after the red player has made their move), the game is ended and declared a draw.&lt;/p&gt;&#xA;&lt;h3&gt;The Tournament&lt;/h3&gt;&#xA;&lt;p&gt;Submissions will be accepted for seven days following the posting of this question. At 11:59 PM UTC on the seventh day, registration will close, and the tournament will be run soon after.&lt;/p&gt;&#xA;&lt;p&gt;Submissions will compete in a round-robin tournament. 5 points will be awarded for a win, 2 points for a draw, and 0 points for a loss. 10 games will be played per match, for each pair of contestants. The submission with the highest score at the end of the tournament will be declared the winner and chosen as the accepted answer. In the event of a tie, total number of wins will be used to decide the winner.&lt;/p&gt;&#xA;&lt;p&gt;If a bot makes an invalid move or takes longer than 1 second (judged using Java's &lt;code&gt;Timer&lt;/code&gt; class), it will be ruled as a forfeit for that game.&lt;/p&gt;&#xA;&lt;p&gt;To make things simple for me, all submissions must be in Java, and will be classes that inherit from a common &lt;code&gt;Bot&lt;/code&gt; interface. The &lt;code&gt;Bot&lt;/code&gt; code and &lt;code&gt;Controller&lt;/code&gt; class are provided below:&lt;/p&gt;&#xA;&lt;p&gt;[todo: bot and controller code]&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/java&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;java&amp;#39;&quot; rel=&quot;tag&quot;&gt;java&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-26T07:28:42.437" CommentCount="7" CommunityOwnedDate="2016-01-09T07:44:43.493" ContentLicense="CC BY-SA 3.0" />
  <row Id="7488" PostTypeId="1" AcceptedAnswerId="7489" CreationDate="2015-11-15T23:31:18.877" Score="10" ViewCount="368" Body="&lt;p&gt;I have seen things like &quot;This is not about finding the language with the shortest approach for prime testing, this is about finding the shortest approach in every language. Therefore, no answer will be marked as accepted.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Isn't it a rule that there has to be a possibility of a best answer on Stack Exchange?&lt;/p&gt;&#xA;" OwnerUserId="16842" LastActivityDate="2015-11-16T09:34:57.623" Title="Are questions in which no answer is the best allowed?" Tags="|discussion|answers|challenges|accepted-answer|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7489" PostTypeId="2" ParentId="7488" CreationDate="2015-11-15T23:47:22.210" Score="7" Body="&lt;p&gt;In general you're right, such questions are not an ideal fit for the Stack Exchange model. However, the exception we've chosen to make here &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5738/20469&quot;&gt;by community consensus&lt;/a&gt; is that &quot;catalog&quot; challenges are on topic. These are intended to be a small, very specific subset of the challenges on the site, and are (as far as I know) limited to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges only. Martin has laid out a roadmap of sorts for these &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7224/20469&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2015-11-15T23:47:22.210" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7490" PostTypeId="2" ParentId="7488" CreationDate="2015-11-16T01:33:45.767" Score="13" Body="&lt;p&gt;It's OK not to accept any answer in a code golf challenge where multiple languages participate. The important thing is that answers in the same language can be of objectively compared; cross-language comparisons do not make sense. Accepting a single answer is a feature of the SE platform  that doesn't fit our purpose.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2015-11-16T01:33:45.767" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7491" PostTypeId="1" CreationDate="2015-11-16T03:11:22.720" Score="8" ViewCount="670" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7377/45151&quot;&gt;Seeing as how we've discussed a size measurement for Minecraft redstone creations&lt;/a&gt;, I thought I'd follow that up with establishing standard output and input methods.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Minecraft, obviously, does not have STDIN or STDOUT in the traditional sense. So how exactly should we handle input and output for Minecraft redstone &quot;programs?&quot; What methods should be considered standard?&lt;/p&gt;&#xA;" OwnerUserId="45151" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-09-30T14:35:34.807" Title="Minecraft I/O Methods" Tags="|discussion|policy|code-golf|answers|defaults|" AnswerCount="4" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="7492" PostTypeId="2" ParentId="7491" CreationDate="2015-11-16T03:13:19.390" Score="10" Body="&lt;h1&gt;Output using /say or /tellraw in a Command Block&lt;/h1&gt;&#xA;&lt;p&gt;This is probably the most obvious output method, since it outputs as text to chat. As a bonus, &lt;code&gt;/say&lt;/code&gt; (but not &lt;code&gt;/tellraw&lt;/code&gt;) would also output to &amp;quot;real&amp;quot; STDOUT on a server.&lt;/p&gt;&#xA;&lt;p&gt;Since &lt;code&gt;/say&lt;/code&gt; outputs a &lt;code&gt;[@]&lt;/code&gt; before the text, we should probably use &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7371/45151&quot;&gt;similar rules to this&lt;/a&gt; to determine when &lt;code&gt;/say&lt;/code&gt; is allowed (as opposed to &lt;code&gt;/tellraw&lt;/code&gt;).&lt;/p&gt;&#xA;" OwnerUserId="45151" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-16T18:47:12.133" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7493" PostTypeId="2" ParentId="7377" CreationDate="2015-11-16T03:51:39.157" Score="7" Body="&lt;h1&gt;Minimal Bounding Cuboid Volume&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Only for things without Command Blocks!&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;The volume includes any air blocks, non-solid blocks, and blocks that are supporting redstone dust or other components.&lt;/p&gt;&#xA;&lt;p&gt;This is the simplest and most natural way to score Minecraft submissions. It's a direct measure of space taken up, just like a byte count is the amount of memory taken up.&lt;/p&gt;&#xA;&lt;p&gt;I don't have scoring method for builds that include Command Blocks, but I think this is the obvious choice when Command Blocks are not present (if we even allow such submissions...).&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Perhaps for things with Command Blocks the cumulative byte count could be counted and reported alongside the block volume count (since it's kind of an apples and oranges thing). So the title of a Minecraft submission might look like &lt;code&gt;#Minecraft - 20 blocks, 17 bytes&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-16T17:25:38.560" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7494" PostTypeId="2" ParentId="7488" CreationDate="2015-11-16T09:34:57.623" Score="19" Body="&lt;p&gt;I'm with xnor on this one. The purpose of an objective winning criterion is that answers are comparable. Whether that is used to determine an overall winner or a winner per language isn't all that important. In particular, there is no obligation for anyone to mark an answer as accepted, so if we'd rule out challenges that only have per-language winners, I'd just &quot;forget&quot; to accept an answer on the challenges where I think that makes more sense.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Next, it's not that these challenges don't fit the SE model. It's that our entire community doesn't &lt;em&gt;really&lt;/em&gt; fit the SE model. There are a lot of things that are tailored to a Q&amp;amp;A format, and PPCG is not a Q&amp;amp;A site. Likewise, there are a lot of missing features which could improve PPCG as a site for programming contests, but they make no sense for Q&amp;amp;A sites. In particular, if this was a proper site for programming contests, I'm pretty sure that most challenges &lt;em&gt;would&lt;/em&gt; be scored separately for different languages &lt;a href=&quot;http://golf.shinh.org/p.rb?hello+world&quot; rel=&quot;nofollow noreferrer&quot;&gt;just like Anarchy Golf does&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Quoting Alex&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;These are intended to be a small, very specific subset of the challenges on the site...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't know about that. I've said a few times I don't think there is even a difference between a catalogue and a code golf where the author forgets to accept an answer. It's just that the catalogues explicitly state that answers in all languages are welcome and each language should be treated as a separate challenge. To me, &lt;em&gt;ideally&lt;/em&gt;, all challenges would be like that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In fact, we still get people complaining about golfing languages every now and then and that they drain their motivation to answer in more verbose/&quot;normal&quot; languages. And every time, the experienced users tell them &quot;you should view this as a challenge &lt;em&gt;within&lt;/em&gt; your language (or languages of comparable golfitude), not try to beat Pyth with Java&quot;. Well, then why should catalogues be the exception? If it's such an absurd idea to compare the scores in different languages, why are we even still interested in an overall winner? Why not actually make these per-language competitions the main spirit of this community? As some of the catalogues have shown, there can be very interesting, heavily golfed answers in non-golfing languages, which normally no one bothers to look for, because they can't &quot;win&quot; anyway. The shortest overall language can be read off a leaderboard quite easily, so there isn't even really a loss of useful information if there is no green checkmark.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another benefit of treating all code golf as per-language competitions is that they make that pesky &quot;your language (version) must be older than the challenge&quot; rule obsolete. I think that rule does more harm than good - there are rare cases where someone actually adds a built-in &lt;em&gt;specifically&lt;/em&gt; to solve one challenge. More often than not, I find a neat solution for an old challenge in a newer language, that was in no way tailored to that challenge, my favourite being &lt;a href=&quot;https://codegolf.stackexchange.com/a/50968/8478&quot;&gt;the shortest proper quine&lt;/a&gt; we have, in a language that was not designed with quining in mind (I believe). If every language was a separate competition, then adding built-ins to solve that challenge would be a non-issue, because the new language/version would be scored separately from all the others, and would simply make for a very boring sub-challenge. However, when that is the case, not accepting an answer is actually important, because it would likely pin a completely trivial solution to the top of the answer list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So yes, I think that not accepting an answer should be allowed, whether stated explicitly or not, and stating it explicitly every now and then might help this community get into the spirit of making each language a separate competition, no matter how unsuitable it is for golfing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, in other types of challenges it might still make sense to compare all answers. Maybe, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; has the same issues as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; here (in that C can always beat a Ruby answer by implementing the same approach... that's no different than porting a Python answer to Pyth). And &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;s don't really need an accepted answer, because that could become outdated, and you can easily find the winner by sorting by votes. But things like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/rosetta-stone&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;rosetta-stone&amp;#39;&quot; rel=&quot;tag&quot;&gt;rosetta-stone&lt;/a&gt; challenges, or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt; where individual answers aren't even tied to a particular language, are certainly just one competition between all the answers. Accepting an answer here definitely makes sense. But that doesn't mean we should require the checkmark for all challenges just because it's there.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2015-11-16T09:34:57.623" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7496" PostTypeId="1" CreationDate="2015-11-16T13:30:31.237" Score="2" ViewCount="545" Body="&lt;p&gt;I recently submitted an answer to a code-golf question in VB.NET, and one comment pointed out that I could omit two &lt;code&gt;System.&lt;/code&gt; statements from the code, because it would compile fine without them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See here:&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/63945/20520&quot;&gt;https://codegolf.stackexchange.com/a/63945/20520&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem here is, that the code would not be correct without them in my opinion. What happens is, that the project file advises MSBuild to automatically import the &lt;code&gt;System&lt;/code&gt; namespace.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To avoid cheating I compile the code using the VB codedom compiler, as I figured that this is the most &lt;em&gt;raw&lt;/em&gt; form of compiling VB.NET. I find that too much stuff goes on in the background when you compile directly from Visual Studio.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This poses the question: How should one rate VB.NET code? As MSBuild is the &lt;em&gt;default&lt;/em&gt; compilation method and it works without the &lt;code&gt;System.&lt;/code&gt; statements, should the code be considered correct if it works with a project file and MSBuild? Or should one strife to avoid any little helpers?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This goes a bit into the direction of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7302/how-should-we-score-compiler-interpreter-build-time-options&quot;&gt;compiler flags&lt;/a&gt;, but is more specific to the .NET languages, in particular to VB.NET.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To make it a bit broader:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the case of the imports or references, these are included in the project file (.csproj or .vbproj) like this&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;Reference Include=&quot;System&quot; /&amp;gt;&#xA;...&#xA;&amp;lt;Import Include=&quot;System&quot; /&amp;gt;  &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As Martin has pointed out in the comments, compiler specific answers don't need to include the flags in the byte code, but non-standard content - and I would say the project files are never standard - need to count. But in no answer I can find are the project files included in the score. Where is the line to draw here?&lt;/p&gt;&#xA;" OwnerUserId="20520" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2015-11-30T17:38:41.103" Title="How to compile/score answers in .NET languages, specifically VB.NET" Tags="|discussion|scoring|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7497" PostTypeId="2" ParentId="2140" CreationDate="2015-11-16T15:47:53.713" Score="0" Body="&lt;h1&gt;List Style Converter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;[code:golf]&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a list, format it into list of the choice of the input. The list will be list of item defined below, but it can be multidimensional.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;List Styles&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There is 2 list separators:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Space&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Comma&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For one dimensional list, only one separator is accepted. Space and only space between item is considered as separator. It is impossible to have more than 2 dimension without enclosing list of second dimension or third dimension. when parsing list, comma takes lower precedence and it is parsed with least dimension as possible. Space is optional between &lt;code&gt;]&lt;/code&gt; with &lt;code&gt;[&lt;/code&gt;; &lt;code&gt;}&lt;/code&gt; with &lt;code&gt;{&lt;/code&gt;; and &lt;code&gt;)&lt;/code&gt; with &lt;code&gt;(&lt;/code&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is 3 list enclosure:&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;[...]&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;(...)&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;{...}&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Closing bracket must be present.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Item&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There is 2 types of item, another list or those following regex &lt;code&gt;[0-9a-zA-Z]*&lt;/code&gt; or everything enclosed with single quote or double quote. If enclosed with single quote, it can contains double quote and vice versa. There is no zero-length item&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is valid non-list item&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;98Az&#xA;Helloworld&#xA;&quot;Hello, world!&quot;&#xA;&quot;It's house.&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here is the list&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hello, World!&#xA;Space then it is list&#xA;()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here is invalid item.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;!$%#%^$*%%^&amp;amp;%^&amp;amp;$%#:;,./&amp;lt;&amp;gt;?&#xA;Helloworld!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input consist of string of number then space then list as defined above. The number indicates the output format.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are n digit of number where n is dimension of the input array. each number correspond with this one. (Table formatting needed). The dimension is counted from outer into inner. You may assume that there is no two &lt;code&gt;0&lt;/code&gt; or &lt;code&gt;1&lt;/code&gt; without being separated by &lt;code&gt;2&lt;/code&gt; - &lt;code&gt;7&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;0&lt;/code&gt; = unenclosed comma list&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1&lt;/code&gt; = unenclosed space list &lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;2&lt;/code&gt; = parantheses enclosed comma list&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;3&lt;/code&gt; = parantheses enclosed space list&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;4&lt;/code&gt; = square bracket enclosed comma list&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;5&lt;/code&gt; = square bracket enclosed space list &lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;6&lt;/code&gt; = curly bracket enclosed space list &lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;7&lt;/code&gt; = curly bracket enclosed space list&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A identical list but with formatting changed according to input (i.e. each item it list is identical). Space not between list is allowed&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;&amp;gt;&lt;/code&gt; denotes output &lt;code&gt;#&lt;/code&gt; denotes comment&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;6 Hello, world&#xA;&amp;gt; {Hello world}&#xA;5 (1, 1, 2, 3, 5, 8, 13, 21)&#xA;&amp;gt; [1, 1, 2, 3, 5, 8, 13, 21]&#xA;#Alternatively&#xA;&amp;gt; [1,1,2,3,5,8,13,21]&#xA;#Or&#xA;&amp;gt; [ 1,1, 2,3, 5,8, 13,21 ]&#xA;#But it is invalid&#xA;&amp;gt; [1,1, 2,3, 5,8, 1 3,2 1]&#xA;#Also&#xA;&amp;gt; [1,1,2,3,5,8,13,21,]&#xA;10 Hello, I am doctor&#xA;#Parsing rules that space separator bound tighter&#xA;&amp;gt; Hello I,am,doctor&#xA;01 Hello, I am doctor&#xA;&amp;gt; Hello, I am doctor&#xA;0 &quot;Not to be confused be space or comma in a quoted item&quot;&#xA;&amp;gt; &quot;Not to be confused be space or comma in a quoted item&quot;&#xA;51 [1,2] [3,4]&#xA;&amp;gt; [1 2,3 4]&#xA;51 [1,2][3,4]&#xA;&amp;gt; [1 2,3 4]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Question.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The format needs helps. Needs pointing when there is ambiguity.&lt;/p&gt;&#xA;" OwnerUserId="46245" LastEditorUserId="46245" LastEditDate="2015-11-17T12:29:11.987" LastActivityDate="2015-11-17T12:29:11.987" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7498" PostTypeId="2" ParentId="7491" CreationDate="2015-11-16T18:42:22.320" Score="7" Body="&lt;h1&gt;Alternate Output with Redstone Lamps&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Consider a pure redstone mechanism. Using a Command Block would eat a good deal of bytes; I agree that, when explicitly said, STDOUT is what quartata suggested in his answer. When otherwise not stated, it may be easier to output using Redstone Lamps, if all you need to output is a truthy/fasly value. Thus, an on-state redstone lamp could be truthy, and an off-state could be a falsy value.&lt;/p&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2015-11-16T18:42:22.320" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7501" PostTypeId="2" ParentId="2140" CreationDate="2015-11-17T00:48:50.797" Score="4" Body="&lt;h1&gt;Pi, continued&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;The task: generate an arbitrarily precise rational approximation to pi by using a continued fraction.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;One way to calculate pi is by using this continued fraction (&lt;a href=&quot;https://en.wikipedia.org/wiki/Continued_fraction#Generalized_continued_fraction&quot; rel=&quot;nofollow noreferrer&quot;&gt;from Wikipedia&lt;/a&gt;):&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/JBcPD.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/JBcPD.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The first few approximations can be calculated as follows:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/sHgXJ.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/sHgXJ.gif&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/dRKFU.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/dRKFU.gif&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/g7c36.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/g7c36.gif&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/oorAR.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/oorAR.gif&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;You may not use this particular continued fraction.&lt;/strong&gt; The reason is that in order to calculate this sequence to arbitrary precision, you have to &lt;em&gt;already&lt;/em&gt; know pi to arbitrary precision. The series &lt;code&gt;[3,7,15,1,292,...]&lt;/code&gt; does not repeat, like pi's own digits.&lt;/p&gt;&#xA;&lt;p&gt;However, there &lt;em&gt;are&lt;/em&gt; continued fractions that have a regular structure. You may use any of these you wish (like &lt;a href=&quot;https://en.wikipedia.org/wiki/Continued_fraction#Generalized_continued_fraction&quot; rel=&quot;nofollow noreferrer&quot;&gt;these on Wikipedia&lt;/a&gt;) in your program.&lt;/p&gt;&#xA;&lt;h2&gt;The rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input: a single, non-negative integer &lt;code&gt;n&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Output: the &lt;code&gt;n&lt;/code&gt;th (improper) fraction in your chosen continued fraction series, in lowest terms.&lt;/li&gt;&#xA;&lt;li&gt;Output may be in any form, provided that these conditions are met: 1) the same base is used for numerator and denominator (and for all fractions), 2) the numerator and denominator are clearly distinguishable, and 3) the numerator comes first.&lt;/li&gt;&#xA;&lt;li&gt;Your program &lt;em&gt;must&lt;/em&gt; use a continued fraction. It &lt;em&gt;may not&lt;/em&gt; use any summation series like the approximation formulae &lt;a href=&quot;https://en.wikipedia.org/wiki/Approximations_of_%CF%80&quot; rel=&quot;nofollow noreferrer&quot;&gt;here on Wikipedia&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I feel like some of this may be confusing. What can I clear up, and how?&lt;/li&gt;&#xA;&lt;li&gt;Is it misleading to introduce continued fractions by using an unpredictable series when I want users to use ones that have a regular structure?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12914" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-17T01:05:34.163" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7502" PostTypeId="1" CreationDate="2015-11-17T03:27:16.473" Score="25" ViewCount="2372" Body="&lt;p&gt;Inspired by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7377/programming-in-minecraft-redstone-how-to-measure-program-size&quot;&gt;this question&lt;/a&gt;, how would a &lt;a href=&quot;http://www.ni.com/labview/&quot; rel=&quot;nofollow noreferrer&quot;&gt;LabVIEW&lt;/a&gt; program be scored?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As one of the only graphical languages in common use today, LabVIEW is a bit of an outsider. As odd as it is, LabVIEW is a serious language that is used everyday. And yet, it is rarely seen on StackOverflow and never on PPCG.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there room for this oddball language that brings the term spaghetti code to life? And if so, how should it be scored?&lt;/p&gt;&#xA;" OwnerUserId="32604" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2015-12-01T09:05:10.490" Title="Programming in LabVIEW - how to measure program size?" Tags="|discussion|code-golf|scoring|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7505" PostTypeId="2" ParentId="2140" CreationDate="2015-11-17T09:52:56.137" Score="2" Body="&lt;h2&gt;Optional parentheses&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In text, parentheses can denote optional asides. These (often intrusive) additions can be read or skipped over, either option giving a valid sentence. Given a string with parentheses, possibly nested, output all possible readings where each parenthesized section may be omitted.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;The(( quick)( brown)) fox jumps( over the( lazy) dog).&#xA;&#xA;The fox jumps.&#xA;The quick fox jumps.&#xA;The brown fox jumps.&#xA;The quick brown fox jumps.&#xA;The fox jumps over the dog.&#xA;The quick fox jumps over the dog.&#xA;The brown fox jumps over the dog.&#xA;The quick brown fox jumps over the dog.&#xA;The fox jumps over the lazy dog.&#xA;The quick fox jumps over the lazy dog.&#xA;The brown fox jumps over the lazy dog.&#xA;The quick brown fox jumps over the lazy dog.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The outputs can be in any order, but must be distinct. Note the case of &lt;code&gt;(( quick)( brown))&lt;/code&gt;, where omitting both &lt;code&gt;quick&lt;/code&gt; and &lt;code&gt;brown&lt;/code&gt; is redundant with omitting the whole expression. But, the input won't contain any parens that enclose the empty string or are redundant with another pair of pairs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;You may not use regular expressions.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input string will consist of only letters, spaces, punctuation &lt;code&gt;.,&lt;/code&gt;, and parens &lt;code&gt;()&lt;/code&gt;. The parens will be properly matched.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2015-11-17T09:52:56.137" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7507" PostTypeId="2" ParentId="2140" CreationDate="2015-11-17T20:39:57.247" Score="0" Body="&lt;h1&gt;Wildcard Golf&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I've read this problem long time ago somewhere but I still don't know what's the best solution, so I'm posting it here. I don't remember the original author or wording so here is all in my own words.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is different from &lt;a href=&quot;https://codegolf.stackexchange.com/q/17718/194&quot; title=&quot;regex golf&quot;&gt;regex golf&lt;/a&gt; because only two wildcards, &lt;code&gt;*&lt;/code&gt; (equivalent to the regex &lt;code&gt;.*&lt;/code&gt;) and &lt;code&gt;?&lt;/code&gt; (equivalent to the regex &lt;code&gt;.&lt;/code&gt;), are allowed.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You are given two lists of strings. You need to generate the shortest wildcard that matches all strings in the first list (the wanted-list) and none in the second list (the unwanted-list). In the wildcard, you can use &lt;code&gt;*&lt;/code&gt; to match 0 or more chars and use &lt;code&gt;?&lt;/code&gt; to match any one char.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For simplicity we can assume that inputs only have lowercase English characters and each string won't be longer than 100 characters. But the list can be very long (like several thousand), so speed of your program is important.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The correct answer that has the lowest average-case theoretic time complexity wins. In a tie, an easier-to-read answer wins.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Wanted list: abacum, academ, alarm, adam&lt;/li&gt;&#xA;&lt;li&gt;Unwanted list: alien, african, atom &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;One possible output:&#xA;&lt;code&gt;a?a*&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd also like to hear about how to approach this problem, and how to prove the theoretic lower bound of time/space complexity.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I'm new to this so comments are welcome. I'm not sure if my winning criteria is clear and practical. Also I don't know what tags I should put there. This is not a code-golf question.&lt;/p&gt;&#xA;" OwnerUserId="47316" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.127" LastActivityDate="2015-11-18T19:26:16.057" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7511" PostTypeId="2" ParentId="7491" CreationDate="2015-11-18T04:07:50.477" Score="3" Body="&lt;h2&gt;&lt;em&gt;String&lt;/em&gt; Input, via tellraw&lt;/h2&gt;&#xA;&lt;p&gt;So it actually is possible to get textual input in minecraft, though you couldnt do much with it. &lt;strong&gt;WARNING: THE FOLLOWING IS COMPLEX&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Lets start with the actual string input. This can be achieved through a simple keyboard tellraw command (like the one in &lt;a href=&quot;https://www.youtube.com/watch?v=ZT7X0AbTV5g&quot; rel=&quot;nofollow noreferrer&quot;&gt;this video&lt;/a&gt;). Each key can be linked to a trigger objective where the key determines the value of the score in that objective. Command blocks would then determine what key it is, and summon an entity with that name at a certain position. The system would then detect an entity there, and move it over by one block. This repeats, moving each entity over by one block until a row of &amp;quot;character&amp;quot; entities is made. Next, to use this information, you can issue specific testfors and executes to determine the string.&#xA;&lt;a href=&quot;https://i.stack.imgur.com/2TAp0.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/2TAp0.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&#xA;In this case, a command could be &lt;code&gt;/execute @e[0,0,0,r=0,type=Chicken,name=A] ~ ~ ~1 execute @e[r=0,type=Chicken,name=B] ~ ~ ~1 execute @e[r=0,type=Chicken,name=e] ~ ~ ~1 execute @e[r=0,type=Chicken,name=2] ~ ~ ~ say TRUE&lt;/code&gt;, for example.&lt;/p&gt;&#xA;&lt;h3&gt;TLDR&lt;/h3&gt;&#xA;&lt;p&gt;Create a tellraw keyboard that spawns in an entity chain, adding to the chain in each click, and perform execute commands to test string qualities.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Note: If this answer gets enough votes I will make a fully working example system to prove this concept.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="36670" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-18T04:07:50.477" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7513" PostTypeId="2" ParentId="2140" CreationDate="2015-11-18T10:41:33.763" Score="0" Body="&lt;h1&gt;Triangularity&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/fU8gK.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/fU8gK.jpg&quot; alt=&quot;The diagram of the triangle the program needs to solve.&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a challenge where you have to work out the length of &lt;code&gt;a&lt;/code&gt; given &lt;code&gt;w&lt;/code&gt; and &lt;code&gt;h&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To qualify as a correct solution:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The program uses STDIN to get the values of &lt;code&gt;w&lt;/code&gt; and &lt;code&gt;h&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The program uses STDOUT to output the value of &lt;code&gt;a&lt;/code&gt; in the above diagram.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The shortest code in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Tags: code-golf, maths&lt;/p&gt;&#xA;" OwnerUserId="47324" LastActivityDate="2015-11-18T10:41:33.763" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7515" PostTypeId="1" AcceptedAnswerId="7516" CreationDate="2015-11-18T19:47:32.667" Score="2" ViewCount="188" Body="&lt;p&gt;Can someone tell me why sometimes people are including &lt;code&gt;class C{public static void main(String[]a){...}}&lt;/code&gt; and sometimes that seems to be not necessary?(&lt;a href=&quot;https://codegolf.stackexchange.com/a/62373/46569&quot;&gt;https://codegolf.stackexchange.com/a/62373/46569&lt;/a&gt;)&lt;/p&gt;&#xA;" OwnerUserId="46569" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-11-18T20:16:28.173" Title="When do I have to include things like Java's public static void main" Tags="|support|policy|answers|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7516" PostTypeId="2" ParentId="7515" CreationDate="2015-11-18T19:53:26.610" Score="11" Body="&lt;p&gt;Whenever submissions are required to be full programs, Java's standard boilerplate code (i.e. &lt;code&gt;class&lt;/code&gt; and &lt;code&gt;main&lt;/code&gt;, etc.) is required. When submissions are allowed to be functions, this boilerplate is not required.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="20469" LastEditDate="2015-11-18T20:16:28.173" LastActivityDate="2015-11-18T20:16:28.173" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="7518" PostTypeId="2" ParentId="2028" CreationDate="2015-11-18T22:44:34.083" Score="46" Body="&lt;h2&gt;We're asking the wrong question&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We're having the &lt;a href=&quot;https://meta.stackexchange.com/questions/66377/what-is-the-xy-problem&quot;&gt;XY problem&lt;/a&gt;. The question is really, &quot;What formats should we allow in answers?&quot; For this purpose, I think that markup languages and limited output languages should be treated the same as programming languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Having fewer features puts a language at a disadvantage. If a language does your challenge, yet cannot implement something like primality testing, that's more impressive, not less. It's silly to put a &lt;em&gt;minimum&lt;/em&gt; on the functionality of the language. This is just making user-made languages cheated their way into being Turing complete, like with &lt;a href=&quot;https://esolangs.org/wiki/Bubblegum&quot; rel=&quot;nofollow noreferrer&quot;&gt;Bubblegum&lt;/a&gt; and &lt;a href=&quot;https://esolangs.org/wiki/CHIQRSX9%2B&quot; rel=&quot;nofollow noreferrer&quot;&gt;CHIQRSX9+&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a challenge is fixed-output and is dominated by answers that are basically the output string, that's a problem with the challenge. Little will change with a ban on &quot;print-this&quot; languages the output their text, since plenty of fully-fledged languages have really short ways to quote and print text.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2015-11-18T22:44:34.083" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7521" PostTypeId="1" AcceptedAnswerId="7522" CreationDate="2015-11-19T14:33:10.960" Score="2" ViewCount="82" Body="&lt;p&gt;A while ago I ended up on a StackOverflow &lt;a href=&quot;https://stackoverflow.com/questions/29825821/what-is-the-performance-difference-between-gawk-and?answertab=votes#tab-top&quot;&gt;question&lt;/a&gt; which I believe could fit under &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; category as it's all about killing the idea a C program could beat anything else in speed (here the main competitor is &lt;code&gt;mawk&lt;/code&gt; for text processing with regexes).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As there's already been a wide meta-effect on this question on SO, I'm unsure it would be on-topic there or not, so before writing a challenge about it I have two questions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Would it be on-topic (and with which tag ?)&lt;/li&gt;&#xA;&lt;li&gt;Is the test system in place (github+travis) valid to classify answers&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Side Note: Would the test system be of some interest for other challenges ?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;P.S: Tell me if I should copy here parts of the existing SO and Meta-SO questions to ease the understanding (but the subject is quite vast now and I'm afraid making this one too long by overquoting)&lt;/p&gt;&#xA;" OwnerUserId="39451" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2015-11-19T14:52:57.243" Title="Would this be eligible on code golf (to know before writing a contest in Sandbox)?" Tags="|discussion|asking-questions|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7522" PostTypeId="2" ParentId="7521" CreationDate="2015-11-19T14:40:58.380" Score="8" Body="&lt;h2&gt;Sandbox it and see&lt;/h2&gt;&#xA;&lt;p&gt;Go ahead and write up a sandbox post. We'll give you critique on what is unclear, what should be changed, etc. It's much easier to answer &amp;quot;is this a good challenge&amp;quot; when looking at a fleshed-out sandbox post than a short description here. If it works, great! If not, oh well, you've (hopefully) learned something for the future.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-19T14:40:58.380" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7523" PostTypeId="2" ParentId="7521" CreationDate="2015-11-19T14:44:56.317" Score="2" Body="&lt;h1&gt;Yes.&lt;/h1&gt;&#xA;&lt;p&gt;We like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; problems.&lt;/p&gt;&#xA;&lt;p&gt;In the future, if you want to identify whether a problem is feasible, we have a &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;friendly chat room&lt;/a&gt; that would love to critique your problem (as posting that on meta seems kind of overkill IMO).&lt;/p&gt;&#xA;&lt;p&gt;Edit:  I'm not indicating that your post here is off-topic or that we have rules against issues that are &amp;quot;too small&amp;quot;, just that I would personally ask in chat.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-19T14:52:57.243" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7524" PostTypeId="2" ParentId="2140" CreationDate="2015-11-19T15:58:19.540" Score="2" Body="&lt;h2&gt;Compete with awk&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal of this challenge is to see if the assertion often see in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/awk&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;awk&amp;#39;&quot; rel=&quot;tag&quot;&gt;awk&lt;/a&gt; question on SO is true:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This would be faster in &lt;code&gt;whatever&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Test Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A 10 million lines file generated by this script line:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;awk 'BEGIN{for (i=1;i&amp;lt;=10000000;i++) print (i%5?&quot;miss&quot;:&quot;hit&quot;),i,&quot;  third\t \tfourth&quot;}' &amp;gt; file&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Head of it:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$ head -10 file&#xA;miss 1   third          fourth&#xA;miss 2   third          fourth&#xA;miss 3   third          fourth&#xA;miss 4   third          fourth&#xA;hit 5   third           fourth&#xA;miss 6   third          fourth&#xA;miss 7   third          fourth&#xA;miss 8   third          fourth&#xA;miss 9   third          fourth&#xA;hit 10   third          fourth&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Goal:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The main goal is to compete with &lt;code&gt;awk&lt;/code&gt;, to benchmark it will be on this challenge description:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Split each line on any number of spaces (regex &lt;code&gt;[ ]+&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;If the line start by &lt;code&gt;hit X&lt;/code&gt; with X being an even number&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;print fields: 4th 1st and 3rd (in this order)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Example output (first 5 lines):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;fourth hit third&#xA;fourth hit third&#xA;fourth hit third&#xA;fourth hit third&#xA;fourth hit third&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Restrictions:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The idea being to compete with awk, your program must behave on the same way:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The file must be read.&lt;/li&gt;&#xA;&lt;li&gt;The match and output order must be modifiable as an awk program can be (Needing a simple code update is OK, it has not to be a command line parameter).&lt;/li&gt;&#xA;&lt;li&gt;The number of line in input file should be considered unknown.&lt;/li&gt;&#xA;&lt;li&gt;As long as your output can be piped to awk, the submission is valid.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Validation:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Pipe the output of your program to&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;awk '!seen[$0]++{unq++;r=$0} END{print ((unq==1) &amp;amp;&amp;amp; (seen[r]==1000000) &amp;amp;&amp;amp; (r==&quot;fourth hit third&quot;)) ? &quot;PASS&quot; : &quot;FAIL&quot;}'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If it show PAST, you're in :)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Winner&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The fastest code would win, to bench yourself here is a &lt;code&gt;mawk&lt;/code&gt; version really competitive (which won't count toward answers as I think it's pretty hard to beat):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;awk '/^hit +[0-9]*[02468] / { print $4, $1, $3 }' file&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I've build a test suite on github &lt;a href=&quot;https://github.com/Tensibai/benchmark-awk-vs&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; which build a result table &lt;a href=&quot;http://tensibai.github.io/benchmark-awk-vs/&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answers will be integrated within it to bench all answer on the same machine, if there's a specific way to launch your program, make it appear in the answer so I don't penalize your answer by the way it is launched.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Side challenge:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If you wish to save me time and craft a pull request to include your code in the test system, you're welcome.&lt;/p&gt;&#xA;" OwnerUserId="39451" LastEditorUserId="39451" LastEditDate="2015-11-20T13:15:14.687" LastActivityDate="2015-11-20T13:15:14.687" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7526" PostTypeId="2" ParentId="2140" CreationDate="2015-11-20T01:52:07.840" Score="1" Body="&lt;h1&gt;DND Level Tables&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In 3rd edition DND, there a lot of stats that you have to keep track for when you level up. Let's fix that by making some nice tables for them.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Crash Course on 3rd edition DND&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;3rd edition DND is very complex since it does not have &quot;classes&quot; in the traditional sense of most RPG games. Instead of picking a class when you create a character and more or less sticking to it, in 3rd edition you can actually &quot;opt in&quot; into any class you want at any time. Essentially, when you level up, you can choose to put that level in any class you want. This means that you can potentially have three levels in Rogue, two levels in Fighter, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition to this, 3rd edition has special things called &lt;strong&gt;skills&lt;/strong&gt;, which are unique to each class. When you level up you get some skill points that you can spend on skills. You can spend one skill point to get one &quot;rank&quot; in a skill. However, if that skill does not belong to your class you only get one-half of a &quot;rank&quot; in that skill. There are also &lt;strong&gt;feats&lt;/strong&gt;, which are essentially general skills that don't belong to any class and have their own &quot;skill points&quot;, and &lt;strong&gt;stat increases&lt;/strong&gt;, which are little stat bonuses you get on level up. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;All together, this is probably enough to make your head swim. Luckily, this challenge doesn't require you to get too much into the nitty gritty of this.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an number representing a level as input, print out a table starting from level 1 up to and including the specified level of the following stats:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The total amount of XP you've gained to reach this level&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Maximum class skill rank you've gained&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Maximum cross-class skill rank you've gained&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Whether you've gained a feat or stat increase (they are not gained every level) and the number of it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The stats should be in this exact order. The table should be formatted with columns for each stat, with at least 4 spaces between each column. The level, feat and status increase numbers should have their appropriate suffixes (like &lt;code&gt;3rd&lt;/code&gt;). If you do not get a status increase or feat at a level, write &lt;code&gt;--&lt;/code&gt; where the feat or status increase number would go.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, without further ado, the math for all of this. Assume x is the level.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Total XP:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/gJaEq.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/gJaEq.gif&quot; alt=&quot;&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Class Rank: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/hMQ49.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/hMQ49.gif&quot; alt=&quot;&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Cross-Class Rank: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/RZnCx.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/RZnCx.gif&quot; alt=&quot;&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Feats: If &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/cFmyR.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/cFmyR.gif&quot; alt=&quot;&quot;&gt;&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;(x divisible by 3), then you have gained your &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/3t6ca.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/3t6ca.gif&quot; alt=&quot;&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;feat. You also automatically gain a feat at 1st level.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Stat Increases: If &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/YBnhg.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/YBnhg.gif&quot; alt=&quot;&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;then you have gained your &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/txl67.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/txl67.gif&quot; alt=&quot;&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;stat increase. Unlike feats, you do not get one of these at 1st level.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Sample input: &lt;code&gt;40&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sample output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1st    0    4    2.0    1st    --&#xA;2nd    1000    5    2.5    --    --&#xA;3rd    3000    6    3.0    2nd    --&#xA;4th    6000    7    3.5    --    1st&#xA;5th    10000    8    4.0    --    --&#xA;6th    15000    9    4.5    3rd    --&#xA;7th    21000    10    5.0    --    --&#xA;8th    28000    11    5.5    --    2nd&#xA;9th    36000    12    6.0    4th    --&#xA;10th    45000    13    6.5    --    --&#xA;11th    55000    14    7.0    --    --&#xA;12th    66000    15    7.5    5th    3rd&#xA;13th    78000    16    8.0    --    --&#xA;14th    91000    17    8.5    --    --&#xA;15th    105000    18    9.0    6th    --&#xA;16th    120000    19    9.5    --    4th&#xA;17th    136000    20    10.0    --    --&#xA;18th    153000    21    10.5    7th    --&#xA;19th    171000    22    11.0    --    --&#xA;20th    190000    23    11.5    --    5th&#xA;21st    210000    24    12.0    8th    --&#xA;22nd    231000    25    12.5    --    --&#xA;23rd    253000    26    13.0    --    --&#xA;24th    276000    27    13.5    9th    6th&#xA;25th    300000    28    14.0    --    --&#xA;26th    325000    29    14.5    --    --&#xA;27th    351000    30    15.0    10th    --&#xA;28th    378000    31    15.5    --    7th&#xA;29th    406000    32    16.0    --    --&#xA;30th    435000    33    16.5    11th    --&#xA;31st    465000    34    17.0    --    --&#xA;32nd    496000    35    17.5    --    8th&#xA;33rd    528000    36    18.0    12th    --&#xA;34th    561000    37    18.5    --    --&#xA;35th    595000    38    19.0    --    --&#xA;36th    630000    39    19.5    13th    9th&#xA;37th    666000    40    20.0    --    --&#xA;38th    703000    41    20.5    --    --&#xA;39th    741000    42    21.0    14th    --&#xA;40th    780000    43    21.5    --    10th&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Reference Implementation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Perl:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;sub formatNum {&#xA;  $_=pop;&#xA;  $first = substr $_,-2,-1;&#xA;  if($first == &quot;1&quot; and length $_ &amp;gt; 1) { return $_.&quot;th&quot;; }&#xA;  $digit = substr $_,-1;&#xA;  if($digit == &quot;1&quot;) { return $_.&quot;st&quot;; }&#xA;  if($digit == &quot;2&quot;) { return $_.&quot;nd&quot;; }&#xA;  if($digit == &quot;3&quot;) { return $_.&quot;rd&quot;; }&#xA;  else { return $_.&quot;th&quot; };&#xA;}&#xA;&#xA;sub space { &#xA;  print &quot; &quot;x4; &#xA;}&#xA;&#xA;while(&amp;lt;&amp;gt;) {&#xA;  $limit = $_;&#xA;  for(my $c = 1; $c &amp;lt;= $limit; $c++) {&#xA;    print formatNum $c;&#xA;    space;&#xA;    print ($c*($c-1)*500);&#xA;    space;&#xA;    print ($c + 3);&#xA;    space;&#xA;    printf (&quot;%.1f&quot;, ($c - 1)/2 + 2);&#xA;    space;&#xA;    if($c % 3 == 0) { print formatNum $c/3+1; }&#xA;    elsif($c == 1) { print &quot;1st&quot;; }&#xA;    else { print &quot;--&quot;; }&#xA;    space;&#xA;    if($c % 4 == 0) { print formatNum $c/4; }&#xA;    else { print &quot;--&quot;; }&#xA;    print &quot;\n&quot;;&#xA;  }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://ideone.com/fork/KSK58b&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="45151" LastEditorUserId="45151" LastEditDate="2015-11-20T16:42:50.900" LastActivityDate="2015-11-20T16:42:50.900" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7527" PostTypeId="1" AcceptedAnswerId="7529" CreationDate="2015-11-20T02:31:28.337" Score="2" ViewCount="202" Body="&lt;p&gt;Some people may be aware of &lt;a href=&quot;https://en.wikipedia.org/wiki/DeCSS&quot; rel=&quot;nofollow noreferrer&quot;&gt;DeCSS&lt;/a&gt;, a &lt;a href=&quot;http://decss.zoy.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;bit of C&lt;/a&gt; of which the &lt;a href=&quot;http://www.mpaa.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;MPAA&lt;/a&gt; (and the rest of the US gov't) are not very fond because it decrypts copy- and read-protected DVDs for playing on, say, &lt;a href=&quot;http://www.videolan.org/developers/libdvdcss.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;linux machines where no such license is available&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I had the idea for a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge along the lines of &quot;write the shortest DeCSS-er or brute-forcer&quot; but before properly writing up a challenge for the sandbox, it occurred to me that perhaps the community would not take kindly to the posting of a challenge which may or may not break a law (not really) or probably enrage a lawyer somewhere.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Can I propose such a challenge?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="46231" LastEditDate="2015-12-15T15:23:20.820" LastActivityDate="2015-12-15T15:23:20.820" Title="On the legality of a dubious challenge" Tags="|discussion|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7528" PostTypeId="2" ParentId="7527" CreationDate="2015-11-20T05:50:41.217" Score="4" Body="&lt;h2&gt;No&lt;/h2&gt;&#xA;&lt;p&gt;Like the comments mentioned, DeCSS's legality is somewhere between questionable and illegal, depending on who you ask and which laws you look at. To err on the side of safety, let's not have the code posted on a Stack Exchange network site. We like being able to do code golf here, and if the MPAA were to decide to take legal action, there's a possibility that we wouldn't be able to have this site anymore. Though it's been several years since the last legal challenge, we don't want to take any chances.&lt;/p&gt;&#xA;&lt;p&gt;Any content of questionable legality should not be posted on any Stack Exchange site.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-22T22:29:44.980" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7529" PostTypeId="2" ParentId="7527" CreationDate="2015-11-20T09:29:10.563" Score="6" Body="&lt;p&gt;I have considered posting DeCSS as a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, and it may even be on one of my Trello boards; the biggest obstacle I see is writing a really good test suite without infringing copyright. I don't see the code itself as an obstacle: the legal protection claimed was trade secret, but the plaintiffs stupidly published the code in their complaint, so legally it's no longer a secret.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2015-11-20T09:29:10.563" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7530" PostTypeId="2" ParentId="6961" CreationDate="2015-11-20T11:07:40.643" Score="0" Body="&lt;p&gt;Yes, there should be a tag. Tags are used to find questions similar to each other without having to rely on the (sometimes rather naïve) &quot;Related&quot; engine used by StackExchange. The obvious exceptions are the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-challenge&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, which are there to distinguish question &lt;strong&gt;types&lt;/strong&gt; (much like the language tags on StackOverflow)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The new &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/catalogue&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;catalogue&amp;#39;&quot; rel=&quot;tag&quot;&gt;catalogue&lt;/a&gt; tag should &lt;strong&gt;not&lt;/strong&gt; intend to replace these tags - as Martin Büttner pointed out, they are not fundamentally different from either of these tags. But then, is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt; fundamentally different from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;; is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt; fundamentally different from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;? My point is that tags are in general not used to identify fundamentally different questions, but to find related questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This new tag should also be considered as a device to find &lt;strong&gt;related questions&lt;/strong&gt;. The fact that there is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7225/8478&quot;&gt;a Meta post&lt;/a&gt; doing exactly that, shows that there is a demand for this. Why would we want a meta post, which should be linked from all included questions to easily find related questions, when there is a fully developed &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tags&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tags&amp;#39;&quot; rel=&quot;tag&quot;&gt;tags&lt;/a&gt; system that does exactly that?&lt;/p&gt;&#xA;" OwnerUserId="32352" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-11-20T12:41:46.370" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7531" PostTypeId="2" ParentId="7447" CreationDate="2015-11-20T11:22:13.163" Score="2" Body="&lt;p&gt;In my personal opinion you should be using STDIN (with &lt;code&gt;fgets&lt;/code&gt; for example) for any input unless stated otherwise. That's something all languages should do, that have the capability of reading from STDIN/writing to STDOUT. Also, on other golfing sites (like anarchy golf) PHP programs will read from STDIN. (see &lt;a href=&quot;http://golf.shinh.org/reveal.rb?join+lines/yzx_1175413094&amp;amp;php&quot; rel=&quot;nofollow&quot;&gt;http://golf.shinh.org/reveal.rb?join+lines/yzx_1175413094&amp;amp;php&lt;/a&gt; for example).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want solutions to be somewhat comparable and roughly same conditions for equally well equipped languages then defaulting to STDIN/STDOUT unless otherwise stated seems to be the most reasonable way to do it.&lt;/p&gt;&#xA;" OwnerUserId="5429" LastActivityDate="2015-11-20T11:22:13.163" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7534" PostTypeId="2" ParentId="202" CreationDate="2015-11-20T16:55:09.563" Score="10" Body="&lt;p&gt;Tutorials Point &lt;a href=&quot;http://www.tutorialspoint.com/codingground.htm&quot; rel=&quot;nofollow&quot;&gt;Coding Ground&lt;/a&gt; has a ridiculous number of available IDEs and terminals. Some may require registration, some versions may be old/outdated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Terminals:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;CentOS&lt;/li&gt;&#xA;&lt;li&gt;IPython&lt;/li&gt;&#xA;&lt;li&gt;Lua&lt;/li&gt;&#xA;&lt;li&gt;Memcached&lt;/li&gt;&#xA;&lt;li&gt;Mongo DB&lt;/li&gt;&#xA;&lt;li&gt;MySQL&lt;/li&gt;&#xA;&lt;li&gt;Node.JS&lt;/li&gt;&#xA;&lt;li&gt;Numpy&lt;/li&gt;&#xA;&lt;li&gt;Oracle&lt;/li&gt;&#xA;&lt;li&gt;Octave&lt;/li&gt;&#xA;&lt;li&gt;PowerShell&lt;/li&gt;&#xA;&lt;li&gt;PHP&lt;/li&gt;&#xA;&lt;li&gt;R Programming&lt;/li&gt;&#xA;&lt;li&gt;Redis&lt;/li&gt;&#xA;&lt;li&gt;Ruby&lt;/li&gt;&#xA;&lt;li&gt;Scipy&lt;/li&gt;&#xA;&lt;li&gt;Sympy&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;IDEs:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Ada (Gnat)&lt;/li&gt;&#xA;&lt;li&gt;Algol-68&lt;/li&gt;&#xA;&lt;li&gt;Angular JS&lt;/li&gt;&#xA;&lt;li&gt;Assembly&lt;/li&gt;&#xA;&lt;li&gt;AsciiDoc&lt;/li&gt;&#xA;&lt;li&gt;Awk&lt;/li&gt;&#xA;&lt;li&gt;Bash Shell&lt;/li&gt;&#xA;&lt;li&gt;Befunge&lt;/li&gt;&#xA;&lt;li&gt;Bootstrap&lt;/li&gt;&#xA;&lt;li&gt;Brainfuck&lt;/li&gt;&#xA;&lt;li&gt;C&lt;/li&gt;&#xA;&lt;li&gt;CSS-3&lt;/li&gt;&#xA;&lt;li&gt;Clojure&lt;/li&gt;&#xA;&lt;li&gt;Cobol&lt;/li&gt;&#xA;&lt;li&gt;CoffeeScript&lt;/li&gt;&#xA;&lt;li&gt;C99 Strict&lt;/li&gt;&#xA;&lt;li&gt;C++&lt;/li&gt;&#xA;&lt;li&gt;C++ 0x&lt;/li&gt;&#xA;&lt;li&gt;C++ 11&lt;/li&gt;&#xA;&lt;li&gt;C#&lt;/li&gt;&#xA;&lt;li&gt;Dart&lt;/li&gt;&#xA;&lt;li&gt;D Language&lt;/li&gt;&#xA;&lt;li&gt;Embedded C&lt;/li&gt;&#xA;&lt;li&gt;Erlang&lt;/li&gt;&#xA;&lt;li&gt;Factor&lt;/li&gt;&#xA;&lt;li&gt;Fantom&lt;/li&gt;&#xA;&lt;li&gt;Falcon&lt;/li&gt;&#xA;&lt;li&gt;Fortran-95&lt;/li&gt;&#xA;&lt;li&gt;Forth&lt;/li&gt;&#xA;&lt;li&gt;F#&lt;/li&gt;&#xA;&lt;li&gt;Free Basic&lt;/li&gt;&#xA;&lt;li&gt;Groovy&lt;/li&gt;&#xA;&lt;li&gt;GO&lt;/li&gt;&#xA;&lt;li&gt;Haxe&lt;/li&gt;&#xA;&lt;li&gt;Haskell&lt;/li&gt;&#xA;&lt;li&gt;HTML&lt;/li&gt;&#xA;&lt;li&gt;ilasm&lt;/li&gt;&#xA;&lt;li&gt;Intercal&lt;/li&gt;&#xA;&lt;li&gt;ICON&lt;/li&gt;&#xA;&lt;li&gt;Java&lt;/li&gt;&#xA;&lt;li&gt;Java 8&lt;/li&gt;&#xA;&lt;li&gt;Java MySQL&lt;/li&gt;&#xA;&lt;li&gt;JavaScript&lt;/li&gt;&#xA;&lt;li&gt;Jquery&lt;/li&gt;&#xA;&lt;li&gt;Julia&lt;/li&gt;&#xA;&lt;li&gt;KSH Shell&lt;/li&gt;&#xA;&lt;li&gt;LaTeX&lt;/li&gt;&#xA;&lt;li&gt;Lisp&lt;/li&gt;&#xA;&lt;li&gt;LOLCODE&lt;/li&gt;&#xA;&lt;li&gt;Lua&lt;/li&gt;&#xA;&lt;li&gt;Matlab/Octave&lt;/li&gt;&#xA;&lt;li&gt;Malbolge&lt;/li&gt;&#xA;&lt;li&gt;Markdown&lt;/li&gt;&#xA;&lt;li&gt;MathML&lt;/li&gt;&#xA;&lt;li&gt;Mozart-OZ&lt;/li&gt;&#xA;&lt;li&gt;Node.JS&lt;/li&gt;&#xA;&lt;li&gt;Objective-C&lt;/li&gt;&#xA;&lt;li&gt;OCaml&lt;/li&gt;&#xA;&lt;li&gt;Pascal&lt;/li&gt;&#xA;&lt;li&gt;PARI/GP&lt;/li&gt;&#xA;&lt;li&gt;Pawn&lt;/li&gt;&#xA;&lt;li&gt;Perl&lt;/li&gt;&#xA;&lt;li&gt;Perl MySQL&lt;/li&gt;&#xA;&lt;li&gt;PHP&lt;/li&gt;&#xA;&lt;li&gt;PHP MySQL&lt;/li&gt;&#xA;&lt;li&gt;PHP Web View&lt;/li&gt;&#xA;&lt;li&gt;Processing.js&lt;/li&gt;&#xA;&lt;li&gt;P5.js&lt;/li&gt;&#xA;&lt;li&gt;Prolog&lt;/li&gt;&#xA;&lt;li&gt;Python&lt;/li&gt;&#xA;&lt;li&gt;Python-3&lt;/li&gt;&#xA;&lt;li&gt;Python MySQL&lt;/li&gt;&#xA;&lt;li&gt;Rexx&lt;/li&gt;&#xA;&lt;li&gt;reStructure&lt;/li&gt;&#xA;&lt;li&gt;Ruby&lt;/li&gt;&#xA;&lt;li&gt;Rust&lt;/li&gt;&#xA;&lt;li&gt;R Programming&lt;/li&gt;&#xA;&lt;li&gt;Scala&lt;/li&gt;&#xA;&lt;li&gt;Scheme&lt;/li&gt;&#xA;&lt;li&gt;Smalltalk&lt;/li&gt;&#xA;&lt;li&gt;SML/NJ&lt;/li&gt;&#xA;&lt;li&gt;Simula&lt;/li&gt;&#xA;&lt;li&gt;SQLite SQL&lt;/li&gt;&#xA;&lt;li&gt;Tcl&lt;/li&gt;&#xA;&lt;li&gt;Tex&lt;/li&gt;&#xA;&lt;li&gt;Unlambda&lt;/li&gt;&#xA;&lt;li&gt;VB.NET&lt;/li&gt;&#xA;&lt;li&gt;Verilog&lt;/li&gt;&#xA;&lt;li&gt;Whitespace&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="56433" LastEditDate="2016-10-21T22:34:30.373" LastActivityDate="2016-10-21T22:34:30.373" CommentCount="1" CommunityOwnedDate="2015-11-20T16:55:09.563" ContentLicense="CC BY-SA 3.0" />
  <row Id="7538" PostTypeId="2" ParentId="202" CreationDate="2015-11-21T05:08:34.037" Score="3" Body="&lt;h1&gt;CJam&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://cjam.aditsu.net&quot; rel=&quot;nofollow noreferrer&quot;&gt;Official Online Interpreter&lt;/a&gt; (cjam.aditsu.net).&lt;/p&gt;&#xA;" OwnerUserId="36670" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-21T05:08:34.037" CommentCount="0" CommunityOwnedDate="2015-11-21T05:08:34.037" ContentLicense="CC BY-SA 3.0" />
  <row Id="7539" PostTypeId="2" ParentId="273" CreationDate="2015-11-21T06:06:19.443" Score="3" Body="&lt;h1&gt;On the scoring of PHP and Perl&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/274&quot;&gt;J B's post&lt;/a&gt; is commonly linked back to in defense of a particular scoring, most often for Perl. Although I agree with his post in large part, there are a couple points that I am not in complete agreement with, or that I believe were not adequately addressed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a foreword, I consider myself a fairly active member of this site, and the majority of my submissions have been in either PHP or Perl. At the time of writing, I have 92 submissions in Perl (&lt;a href=&quot;https://codegolf.stackexchange.com/search?q=user%3A4098+perl+isaccepted%3Ayes&quot;&gt;20 accepted&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=user%3A4098+perl+isaccepted%3Ano&quot;&gt;72 unaccepted&lt;/a&gt;), and 66 in PHP (&lt;a href=&quot;https://codegolf.stackexchange.com/search?q=user%3A4098+php+isaccepted%3Ayes&quot;&gt;11 accepted&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=user%3A4098+php+isaccepted%3Ano&quot;&gt;55 unaccepted&lt;/a&gt;). As far as I can tell, I am the most prolific contributor of either language. I therefore have a vested interest in a fair and consistent scoring of these two languages in particular.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;1. Programs are Programs&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a point that I believe J B failed to adequately address. Both PHP and Perl support saving code to a file and executing it, and this is in fact the primary usage. The shortest invocation of each is &lt;code&gt;php program.php&lt;/code&gt; and &lt;code&gt;perl program.pl&lt;/code&gt; respectively. If the question specifically asks for a program, as most do, it is my opinion that the supplied code must be executable in this manner. If the code cannot be run in this way (e.g. it can only be run from the command line), it is, in my opinion, not a program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To be clear, this would restrict the Perl options &lt;code&gt;-e&lt;/code&gt; and &lt;code&gt;-E&lt;/code&gt;, and the PHP options &lt;code&gt;-r&lt;/code&gt; and &lt;code&gt;-R&lt;/code&gt; from any challenges requiring a program.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;2. Every Additional Command Line Byte Counts&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;&quot;I count those as a difference in character count to the shortest equivalent invocation without them.&quot;&lt;/em&gt;&lt;br&gt;&#xA;- J B&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am in complete agreement with this, although I have not to this point been following it (and instead counting only &quot;functional&quot; bytes, i.e. &lt;code&gt;[^- ]&lt;/code&gt;). This would mean, for example, that &lt;code&gt;-p&lt;/code&gt; as in &lt;code&gt;perl -p program.pl&lt;/code&gt; should be counted 3 bytes heavier than its shortest invocation &lt;code&gt;perl program.pl&lt;/code&gt;, and &lt;code&gt;-pl&lt;/code&gt; as 4 bytes, etc. This is entirely consistent with the &lt;a href=&quot;http://thospel.home.xs4all.nl/golf/rules.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;&quot;Unofficial Official&quot; Perl Golf Rules&lt;/a&gt;, and all entries in the &lt;a href=&quot;http://terje2.frox25.no-ip.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Perl Golf History Book&lt;/a&gt; were scored in this way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For challenges where a program is not required, the same rule should apply: every additional byte is counted. For example, the difference between shortest invocation &lt;code&gt;perl -e'code'&lt;/code&gt; and &lt;code&gt;perl -pe'code'&lt;/code&gt; is only one, and therefore &lt;code&gt;-p&lt;/code&gt; should be counted as one in this instance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also believe that &lt;code&gt;-M5.01&lt;/code&gt; (and it's more verbose equivalent &lt;code&gt;-M5.010&lt;/code&gt;) should be scored in the same way, just as one would score &lt;code&gt;-Mbigint&lt;/code&gt; or &lt;code&gt;-Mntheory&lt;/code&gt;. Of course, if a program isn't required, &lt;code&gt;-E&lt;/code&gt; is no longer than &lt;code&gt;-e&lt;/code&gt;, and therefore should be &quot;free&quot; in this sense. J B argues that this option falls under &lt;em&gt;&quot;options to bring the language level to a specific point&quot;&lt;/em&gt;, as would, for example &lt;code&gt;gcc -std=c99&lt;/code&gt;. I disagree. The closest equivalent I can think of is Python's &lt;code&gt;from __future__ import&lt;/code&gt;, which I also don't think should be free. If you're writing code for Python 2, you should be writing for Python 2, taking the good with the bad, and not picking and choosing Python 3 features that could make your code shorter. As an example, &lt;a href=&quot;https://codegolf.stackexchange.com/a/32002&quot;&gt;this solution&lt;/a&gt; could be one byte shorter with a &quot;free&quot; &lt;code&gt;from __future__ import division&lt;/code&gt;, so that &lt;code&gt;x&lt;/code&gt; could be initialized to &lt;code&gt;1&lt;/code&gt;, rather than &lt;code&gt;1.&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I feel the same way for Perl. &lt;code&gt;use 5.10&lt;/code&gt; is short-hand for &lt;code&gt;use feature qw(say state switch)&lt;/code&gt;, all of which were back-ported from Perl 6.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;3. Assume Default Settings&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1670&quot;&gt;Content Moved&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;4. Default Encoding&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Some online interpreters, for example &lt;a href=&quot;http://ideone.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;ideone.com&lt;/a&gt;, will silently convert any input to UTF-8, potentially invalidating an otherwise valid solution. In PHP, for example, &lt;code&gt;~õ&lt;/code&gt; is a common shortcut for &lt;code&gt;&quot;\n&quot;&lt;/code&gt;. It is my suggestion that the encoding be assumed as ISO-8859-1, unless otherwise specified. Solutions using multibyte encodings should be counted in bytes, and not characters.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;5. Prefer Shebangs&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is more of a suggestion for style rather than scoring. For interpreters that allow post-hoc command line options via shebang (e.g. Perl and Ruby), this should be the preferred way to convey this information. There are two primary advantages. For users unfamiliar with the language, and its available command line options, when copy-pasted the code will still work &quot;as is.&quot; For others, it will allow them to immediately see what the program does and how it works, even when scanning quickly, without having to stop and read the accompanying description.&lt;/p&gt;&#xA;" OwnerUserId="4098" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2015-11-21T09:56:39.650" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7542" PostTypeId="1" CreationDate="2015-11-21T06:33:15.463" Score="14" ViewCount="216" Body="&lt;p&gt;Like the title says:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;from itertools import permutations&#xA;&#xA;def number_of_clicks(l):&#xA;    bets = list(l)&#xA;    clicks = 0&#xA;    state = [[False, None], [False, None], [False, None], [False, None], [False, None]]&#xA;    while bets:&#xA;        next = bets.pop(0)&#xA;        for s, n in zip(state, next):&#xA;            if s[0] != n[0]:&#xA;                clicks += 1 # checkbox&#xA;                s[0] = n[0]&#xA;            if s[1] != n[1] and n[1] is not None:&#xA;                clicks += 2 # dropdown&#xA;                s[1] = n[1]&#xA;&#xA;    return clicks&#xA;&#xA;bets = map(lambda l: map(lambda p: [bool(p), p], l), input())&#xA;&#xA;result = min(permutations(bets), key=number_of_clicks)&#xA;&#xA;for l in result: print map(lambda e: e[1], l)&#xA;print number_of_clicks(result)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(taken from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7535/45941&quot;&gt;this&lt;/a&gt; Sandbox post)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;!-- language: lang-python --&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Has no effect.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Syntax highlighting would be very useful for the Sandbox. It works &lt;a href=&quot;https://meta.stackoverflow.com/questions/300633/how-to-format-a-link-within-a-code-block&quot;&gt;on Meta.SO&lt;/a&gt;, so why not here?&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="1144" LastEditDate="2017-03-30T05:13:23.857" LastActivityDate="2017-03-30T05:14:14.303" Title="Syntax highlighting doesn't work on Meta" Tags="|bug|status-completed|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7543" PostTypeId="2" ParentId="7491" CreationDate="2015-11-21T12:53:45.483" Score="7" Body="&lt;h2&gt;Binary input with levers on blocks&lt;/h2&gt;&#xA;&lt;p&gt;This is the obvious, simple solution for pure-redstone answers. Encode the input into binary, and input it with levers. Bit order (most significant first or least significant first) and the translation between bits and lever positions (e.g. 0 = up, 1 = down, or vice-versa) would be individually specified by the answer. Since levers can only be placed on the sides of blocks, a free (as in, not counting towards the score of the program) block with a single lever mounted on it for each bit of input seems appropriate.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-30T14:35:34.807" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7545" PostTypeId="2" ParentId="2140" CreationDate="2015-11-21T22:59:57.153" Score="1" Body="&lt;h2&gt;coreutils default behavior stdin/stdout&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We have a lot of challenges to implement just one of these operations, but a lot more are missing. Instead of adding a challenge for each of them, I thought I'd see if I could make a multiple-holes challenge that's complex enough to inspire some code re-use. This challenge is to reproduce a small subset of what &lt;a href=&quot;http://www.busybox.net/about.html&quot; rel=&quot;nofollow&quot;&gt;Busybox&lt;/a&gt; does, namely to implement the default behavior of [almost] all of the GNU coreutils that (usually) read input from stdin or a file and send output to stdout or a file.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The utilities to reproduce are as follows:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;cat&lt;/code&gt; copy stdin to stdout&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;tac&lt;/code&gt; copy stdin to stdout, reversing the order of the input lines (last line first)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;nl&lt;/code&gt; copy stdin to stdout, adding a line number to the start of each line. Start at 1, use spaces to pad each number to a width of 6, and add two spaces between the line number and the original line&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;od&lt;/code&gt; I can't come up with a concise unambiguous way to describe the default output from od. I might skip it.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;base64&lt;/code&gt; for every 3 bytes of stdin, split into groups of 6 bits, look those 6-bit values up in the base64 alphabet, and output 4 such bytes to stdout. wrap output lines at 76 characters. pad missing bits with 0s, and output an all-padding 0b000000 as &quot;=&quot;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;I'll finish filling out descriptions for some subset of the following if this idea proves popular enough to proceed with.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;fmt&lt;/code&gt;, &lt;code&gt;pr&lt;/code&gt;, &lt;code&gt;fold&lt;/code&gt;, &lt;code&gt;head&lt;/code&gt;, &lt;code&gt;tail&lt;/code&gt;, &lt;code&gt;split&lt;/code&gt;, &lt;code&gt;csplit&lt;/code&gt;, &lt;code&gt;wc&lt;/code&gt;, &lt;code&gt;sum&lt;/code&gt;, &lt;code&gt;sort&lt;/code&gt;, &lt;code&gt;shuf&lt;/code&gt;, &lt;code&gt;uniq&lt;/code&gt;, &lt;code&gt;ptx&lt;/code&gt;, &lt;code&gt;tsort&lt;/code&gt;, &lt;code&gt;cut&lt;/code&gt;, &lt;code&gt;tr&lt;/code&gt;, &lt;code&gt;expand&lt;/code&gt;, &lt;code&gt;unexpand&lt;/code&gt;, &lt;code&gt;yes&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The format of an entry would be either one program or one function, which can perform all of these tasks, just like busybox can. As a program, it might read its own process name to decide which tool to run. As a program or a function, the first parameter might be which tool to run. As a program, input should come from stdin and go to stdout. As a function, input should be a single string parameter, and return a single string.&lt;/p&gt;&#xA;" OwnerUserId="4787" LastActivityDate="2015-11-21T22:59:57.153" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7546" PostTypeId="2" ParentId="2140" CreationDate="2015-11-22T01:34:37.313" Score="1" Body="&lt;h1&gt;Find the nested source codes&lt;/h1&gt;&#xA;&lt;p&gt;A cops and robbers challenge where the cops write between 2 and 8 programs that produce output in the same language and interweave the programs together. WLOG, let's discuss this action being performed on two programs. By interweaving, I mean adding the characters of the second program to the first program so that when the characters of either the (WLOG) first program are removed, the second program can be seen. Obviously, commenting in any program is not allowed.&lt;/p&gt;&#xA;&lt;p&gt;The cops will post their combined codes, the number of different programs in what they post, and the language the codes are written in, and what the programs print as output. To get credit for cracking the submission, the robbers must post the split codes and what each one outputs.&lt;/p&gt;&#xA;&lt;p&gt;As a general rule, cops cannot use a language more than once.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A cop will receive points if their submission is safe for one week from the time of posting. Their score will be the sum of the two following.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first value is 256 divided by 2 to the power of the number of different programs used.&lt;/li&gt;&#xA;&lt;li&gt;Round the number of bytes in the combined codes up to the nearest power of 2 and call this number &lt;code&gt;x&lt;/code&gt;. The second value is 1024 divided by &lt;code&gt;x&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;A cop will lose 10 points for every code that is cracked before the one-week period is up.&lt;/p&gt;&#xA;&lt;p&gt;Robbers will receive a number of points equal to the sum of the following for each cracked submission.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first value is 2 to the power of the number of different programs used in the cop's answer.&lt;/li&gt;&#xA;&lt;li&gt;Round the number of bytes in the combined codes up to the nearest power of 2 and call this number &lt;code&gt;y&lt;/code&gt;. The second value is 1024 divided by &lt;code&gt;y&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Python, 2 codes&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;prpriintn(&amp;quot;t&amp;quot;(hlellamlao&amp;quot;)&amp;quot;[0])&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Prints &lt;code&gt;llama&lt;/code&gt; and &lt;code&gt;h&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Codes: &lt;code&gt;print(&amp;quot;llama&amp;quot;)&lt;/code&gt; and &lt;code&gt;print(&amp;quot;hello&amp;quot;[0])&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="43444" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-22T01:59:36.270" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7551" PostTypeId="2" ParentId="2140" CreationDate="2015-11-22T22:13:26.290" Score="-2" Body="&lt;h1&gt;Restricted &amp;quot;Hello, World!&amp;quot;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hello-world&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hello-world&amp;#39;&quot; rel=&quot;tag&quot;&gt;hello-world&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The task is very simple, output &lt;code&gt;Hello, World!&lt;/code&gt; to STDOUT. The thing that makes this different are the rules:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You need to provide a full functioning program, taking no input and outputting via STDOUT.&lt;/li&gt;&#xA;&lt;li&gt;The program must not write anything to STDERR&lt;/li&gt;&#xA;&lt;li&gt;The maximum amount of bytes you can use is 50&lt;/li&gt;&#xA;&lt;li&gt;The program may only contain printable &lt;strong&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/ASCII#ASCII_printable_code_chart&quot; rel=&quot;nofollow noreferrer&quot;&gt;ASCII&lt;/a&gt;&lt;/strong&gt; characters. Programs using CP437 and other encoding systems are not allowed&lt;/li&gt;&#xA;&lt;li&gt;If a programming language is already used, you cannot use this same language again.&lt;/li&gt;&#xA;&lt;li&gt;You cannot use any character of the &lt;strong&gt;prohibited character list&lt;/strong&gt;. This is the twist:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Prohibited character list (PCL):&lt;/h3&gt;&#xA;&lt;p&gt;The prohibited character list is a list full of characters, which cannot be used in the following programs. For example:&lt;/p&gt;&#xA;&lt;p&gt;If the list was: &lt;code&gt;He\.&lt;/code&gt;, you need to create a program, without the characters &lt;code&gt;H&lt;/code&gt;, &lt;code&gt;e&lt;/code&gt;, &lt;code&gt;\&lt;/code&gt; and &lt;code&gt;.&lt;/code&gt;. &lt;strong&gt;These are not case-sensitive&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If you succesfully manage to write a program that doesn't use any characters, you may &lt;strong&gt;add new one character&lt;/strong&gt; to the prohibited character list.&lt;/p&gt;&#xA;&lt;p&gt;e.g.&lt;/p&gt;&#xA;&lt;p&gt;If the old PCL was &lt;code&gt;He\.&lt;/code&gt;, and you managed to write a program that doesn't use any of these characters, you may add a new character to this list. For example &lt;code&gt; &lt;/code&gt;(whitespace). The new PCL will be &lt;code&gt;He \.&lt;/code&gt; (notice that the whitespace character is added).&lt;/p&gt;&#xA;&lt;h3&gt;Posting Snippet:&lt;/h3&gt;&#xA;&lt;p&gt;This might help you wit posting your submission:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#[Language Name], N bytes&#xA;&#xA; [code]&#xA;&#xA; (explaination etc.)&#xA;&#xA; Added character: [char]&#xA;&#xA; New PCL: [list + new char]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In the beginning, the PCL is empty. The last person who managed to create a program without a new program made in 2 days, wins!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I'm not really sure if it is flawed or not. If you have any suggestions or comments, feel free to post them below in the comment section :)&lt;/p&gt;&#xA;" OwnerUserId="34388" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-22T22:20:15.103" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7552" PostTypeId="2" ParentId="2140" CreationDate="2015-11-22T23:34:49.333" Score="1" Body="&lt;h2&gt;Sig-fig calculator&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As a scientist, sig-figs are definitely one of the most important parts of measurements and calculatations (unless you are a theoretical scientist, where everything must be exact!). &lt;a href=&quot;https://en.wikipedia.org/wiki/Significant_figures&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sig-figs&lt;/a&gt; is an important way of measuring uncertainty and accuracy of a value. To calculate the number of sig-figs for a value, use the following to help you (from &lt;a href=&quot;http://www.usca.edu/chemistry/genchem/sigfig.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;):&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;ALL non-zero numbers (1,2,3,4,5,6,7,8,9) are ALWAYS significant.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;ALL zeroes between non-zero numbers are ALWAYS significant.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;ALL zeroes which are SIMULTANEOUSLY to the right of the decimal point AND at the end of the number are ALWAYS significant.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;ALL zeroes which are to the left of a written decimal point and are in a number &gt;= 10 are ALWAYS significant.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Exact numbers in an equation have infinite sig-figs. For example, in the equation $A=pi*r^2$, $pi$ has infinite sig-figs and the exponent of 2 also has infinite sig-figs. (not included in the above link)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;To calculate the number of sig-figs from a calculation, use the following rules:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;For multiplication and division, the number of sig-figs for the result is equal to the number of sig-figs for the least accurate value (i.e. the value with the least number of sig-figs). For example, 2.000*5.00 = 10.0 and 4.5*6.00 = 27&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For addition and subtraction, the result has as many decimal places as the one with the least decimal places. For example, 5.00-2 = 3 while 6.0-3.000 = 3.0&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;logs (including natural logs) have as many decimal places as the number of sig-figs of the value of whose log is being taken (I am not sure if this sentence of English is correct!). For example,  log(2.45) = 0.389.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Other functions, such as square roots, exponents, sines, cosines, etc. can be assumed to have the same number of sig-figs as its argument. So the sin(3.14) = 0.00159&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is to write a sig-fig calculator with the following functions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;addition, subtraction, multiplication, division&lt;/li&gt;&#xA;&lt;li&gt;sine, cosine, tan, and their inverses&lt;/li&gt;&#xA;&lt;li&gt;sinh, cosh, tanh, and their inverses&lt;/li&gt;&#xA;&lt;li&gt;Exponents, including shortcuts for e^x and 10^x, along with sqrt. The exponents are assumed to be exact and has infinite sig-figs&lt;/li&gt;&#xA;&lt;li&gt;log of base 10 and natural log.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The result of each calculation should give you the correct result, but insert a &quot;\&quot; before the last sig fig. If there is infinite sig figs, there should be no &quot;\&quot; at all. Also, undefined and infinite values should give an error or NaN or print &quot;infinity&quot; or &quot;undefined&quot;. For example, &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;sin(3.14) = 0.0015\9265292&#xA;log(1.01) = 0.00\432137378&#xA;5.00*2 =\10&#xA;2.00^5=32.\0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest code wins!&lt;/p&gt;&#xA;" OwnerUserId="34421" LastEditorUserId="34421" LastEditDate="2016-01-02T15:54:37.200" LastActivityDate="2016-01-02T15:54:37.200" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7554" PostTypeId="2" ParentId="2140" CreationDate="2015-11-23T09:43:55.680" Score="1" Body="&lt;h1&gt;Complete the Digit Sequence&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We have a string of digits with some elements missing and marked with &lt;code&gt;.&lt;/code&gt;s.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;74..7.1..1.3...8.781256&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We want to fill the missing parts in a way that they would form an arithmetic sequence with the previous on next elements. E.g. &lt;code&gt;8...2&lt;/code&gt; becomes &lt;code&gt;8642&lt;/code&gt;. If this kind of filling is not possible with single digits, mark the positions with &lt;code&gt;?&lt;/code&gt;. E.g. &lt;code&gt;7..3&lt;/code&gt; would become &lt;code&gt;7??3&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With this rules our original example becomes&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;745674111123???8?781256&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You should write a program or function which receives a digit string as input and outputs or returns the filled sequence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;TODO&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;TODO&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;TODO&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is code golf so the shortest entry wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Sandbox note: this seems boring so ideas are welcomed.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="7311" LastEditorUserId="7311" LastEditDate="2015-11-23T11:15:48.593" LastActivityDate="2015-11-23T11:15:48.593" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7555" PostTypeId="2" ParentId="7448" CreationDate="2015-11-23T13:17:34.000" Score="5" Body="&lt;p&gt;The very fact that there's so many possibilities where you're almost &quot;pristine&quot; but not quite, and so many fewer where you actually are 100% &quot;pristine&quot; is exactly the point of the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So sorry, but your solution isn't a solution to the challenge and should not be posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It wasn't a waste though, you undoubtedly learned and bettered yourself in the process of the challenge. But if everyone that got &quot;close&quot; posted their non-answer on that challenge then sifting through to find the actual answers would be quite difficult. It is my opinion that only true answers to the challenge should be posted. You simply get the self-satisfaction of having at least made a neat attempt.&lt;/p&gt;&#xA;" OwnerUserId="47448" LastActivityDate="2015-11-23T13:17:34.000" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7556" PostTypeId="5" CreationDate="2015-11-23T16:49:03.243" Score="0" Body="" OwnerUserId="40695" LastEditorUserId="40695" LastEditDate="2015-11-23T16:49:03.243" LastActivityDate="2015-11-23T16:49:03.243" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7557" PostTypeId="4" CreationDate="2015-11-23T16:49:03.243" Score="0" Body="Tags are keywords or labels that categorize and group your question with other, similar questions." OwnerUserId="40695" LastEditorUserId="40695" LastEditDate="2015-11-23T16:49:03.243" LastActivityDate="2015-11-23T16:49:03.243" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7560" PostTypeId="1" AcceptedAnswerId="7561" CreationDate="2015-11-24T00:21:44.753" Score="19" ViewCount="827" Body="&lt;p&gt;So, I like golfing, and I like modern C++. I am golfing in regular C++(11(14)) now, so obviously, I did not win a single challenge yet. I noticed, that both Pyth and CJam (probably languages, that win most of the time) were designed entirely for this purpose. I thought at designing my own language as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But, I would like the language to be based on C++, probably using same structure, with STL, with shortened keywords and so. However, I do not think I am skillful enough to write my own C++ compiler, so I thought I would use existing one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question is, if I create a language &lt;code&gt;Placeholdername&lt;/code&gt;, with such compiler, that it will parse &lt;code&gt;Placeholdername&lt;/code&gt; source code into C++ code, and then calls C++ compiler to produce executable, can I compete in code-golfs with such language?&lt;/p&gt;&#xA;" OwnerUserId="43365" LastEditorUserId="61563" LastEditDate="2017-08-09T19:14:38.503" LastActivityDate="2017-08-09T19:14:38.503" Title="May I create my own programming language, which uses an existing compiler?" Tags="|discussion|" AnswerCount="2" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="7561" PostTypeId="2" ParentId="7560" CreationDate="2015-11-24T00:57:37.080" Score="26" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;Many languages already do this, such as Pyth and Japt. It's completely ok to create a language that compiles to another language.&lt;/p&gt;&#xA;&lt;p&gt;Though if you've seen &lt;a href=&quot;https://github.com/phase/o/blob/master/o.c&quot; rel=&quot;nofollow noreferrer&quot;&gt;o.c&lt;/a&gt;, you'll know that C can be golfed quite well ;)&lt;/p&gt;&#xA;" OwnerUserId="41711" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-24T00:57:37.080" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7562" PostTypeId="1" CreationDate="2015-11-24T14:52:22.983" Score="1" ViewCount="134" Body="&lt;p&gt;Is it allowed to use a function instead of a complete program, in a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(This has probably been asked before, I'm unable to locate the link.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Asked wrt @agtoever 's query on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/64639/output-the-qwerty-keyboard&quot;&gt;Output the qwerty keyboard&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="40929" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-11-24T14:52:22.983" Title="Is a function allowed?" Tags="|discussion|" AnswerCount="0" CommentCount="1" ClosedDate="2015-11-24T14:53:37.837" ContentLicense="CC BY-SA 3.0" />
  <row Id="7563" PostTypeId="2" ParentId="2140" CreationDate="2015-11-24T16:05:18.347" Score="0" Body="&lt;h1&gt;Typographic Chemistry&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Inspired by this: &lt;a href=&quot;https://xkcd.com/1442/&quot; rel=&quot;nofollow&quot;&gt;https://xkcd.com/1442/&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You must make a program or function that take input a string from STDIN and output the possible allowed reactions (1 point per unique reaction, see also &quot;Score&quot; below)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A chemical reaction is allowed if all the &quot;legs&quot; of the elements are used, i.e., there are no unpaired &quot;legs&quot;. A &quot;leg&quot; is just the end of a curve in the typographic print of the chemical symbol (see the comic and it should be clear).&#xA; So for example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Carbon - C - 2 legs&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Oxygen - O - 0 legs&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hydrogen - H - 4 legs&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Nitrogen - N - 2 legs&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Potassium - K - 4 legs&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Phosphorus _ P 1 leg&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An element can be rotated, reflected but not stretched in any way, so that the only possible bonds are (here I don't know how to rotate the chars, if somebody can help it would be welcome):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$CH \;\mathrm{(with\;the\;C\;on\;top\;or\;bottom\;rotated\;by\;90\;degrees)}\\CK \;\mathrm{(with\;the\;C\;on\;top\;or\;bottom\;rotated\;by\;90\;degrees\;or\;to\;the\;right\;rotated\;by\;180)}\\&#xA;HK\;\mathrm{(on\;top\;of\;each\;other\;or\;on\;the\;side\;rotating\;one\;by\;180)}\\&#xA;NN\;\mathrm{(with\;one\;reflected\;has\;two\;legs\;on\;top\;and\;two\;diconnected\;legs\;on\;bottom)}\\&#xA;P\;\mathrm{(with\;anything)}\\&#xA;O\;\mathrm{doesn't\;bond}$$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These are the only possible elements passed from STDIN. Notice that the difference between H and K is that K can bond also laterally with a C.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Extra Rule&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If no reaction is possible, the output should be equal to the input&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Score&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;1 point per reaction.&#xA;Bonus: X3 the score if you can print the reaction diagramatically, i.e. print the shape of the molecule (like in the comic)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;$$Input \rightarrow Output\\&#xA;C\,C \rightarrow (C_2)\\&#xA;N \, N \rightarrow N \, N\\&#xA;C\,N \, N\,P\,P \rightarrow (C N_2 P_2)\\&#xA;C\,C\,K \, H\,H\rightarrow (KC_2H_2)\\&#xA;C\,H\,O\rightarrow C\,H\,O&#xA;$$&lt;/p&gt;&#xA;" OwnerUserId="47578" LastEditorUserId="47578" LastEditDate="2015-11-26T16:05:25.097" LastActivityDate="2015-11-26T16:05:25.097" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="7567" PostTypeId="2" ParentId="7560" CreationDate="2015-11-25T12:58:37.517" Score="-16" Body="&lt;p&gt;Do you want to create a language just so you can use it on this site or do you have a higher purpose for that language? Basically what happens is that since it's incredibly easy to design and implement an esolang you can write one in just a day. However, the drawback of that is, that there will be little to absolutely NO COMPETITION within that language because nobody else is using it (because everybody is creating their own languages for little actual benefit). I'd recommend looking at an existing golfing languages and learn one rather than inventing yet another one so we actually have decent competition going on in golfing languages. Be it Pyth, CJam, Flogscript, Golfscript or whatever. There are already plenty of these languages. &lt;/p&gt;&#xA;" OwnerUserId="5429" LastActivityDate="2015-11-25T12:58:37.517" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="7568" PostTypeId="2" ParentId="2140" CreationDate="2015-11-25T16:25:25.690" Score="1" Body="&lt;h1&gt;The Language Relay!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A typical relay race only has four competitors per team, but where's the fun in that? Instead, let's see how many teammates you can cram onto the bus to the stadium and still finish the race. (This analogy is starting to break down, so I'll cut to the chase.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a program or function in &lt;strong&gt;256 bytes or less&lt;/strong&gt;. It will take no input, and its output will be a program or function in another language. That program or function will also take no input, and its output will be a program or function in another language... and so on and so forth, until the last program, which will output the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.     \O/      .&#xA;|===== |_ =====|&#xA;|    _/  |     |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The winner is whoever manages to use the most languages. If there is a tie, the winner is the one with the shortest code in bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You cannot use the same language twice, and different versions of the same language do not count as different languages. The output must also be different every time (no using languages that leave the program or function untouched.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's a small example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#include&amp;lt;stdio.h&amp;gt;&#xA;int main(){printf(&quot;print(\&quot;.     \\O/      .\\n|===== |_ =====|\\n|    _/  |     |\&quot;)&quot;);}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This C code produces this Python code:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;print(&quot;.     \O/      .\n|===== |_ =====|\n|    _/  |     |&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And the Python produces the final output. I've used two languages, so my score is 2, and I'm going to lose terribly.&lt;/p&gt;&#xA;" OwnerUserId="38006" LastEditorUserId="38006" LastEditDate="2015-11-25T17:47:56.460" LastActivityDate="2015-11-25T17:47:56.460" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7572" PostTypeId="2" ParentId="2140" CreationDate="2015-11-26T04:00:53.933" Score="0" Body="&lt;h1&gt;C++ Expression Matching&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c%2b%2b&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c++&amp;#39;&quot; rel=&quot;tag&quot;&gt;c++&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, I like C++. And I like regex matching puzzles (heck, &quot;regex golf&quot; is what first got me lurking on this site). Might as well try to sort of combine the two!&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a full program that takes as input two lists of zero to five integers in the range [1, 127], and outputs a string representation of a C expression that evaluates to &lt;em&gt;nonzero / true&lt;/em&gt; for all integers in the first list, and &lt;em&gt;zero / false&lt;/em&gt; for all integers in the second list. Input can be taken in any convenient form.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a special case, if the second list is empty, then the expression returned must evaluate to true for &lt;em&gt;only&lt;/em&gt; the integers in the first list, and false for &lt;em&gt;all other&lt;/em&gt; integers in the range [1, 127]. Likewise, if the first list is empty, it should evaluate to false for the integers in the second list, and true for all others in that range.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program will not receive two empty lists as input. If both lists are non-empty, there are no requirements on the result of the output when evaluated with an integer not in the input. (any return value is fine, as is undefined behavior, division by 0, etc).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following tokens may be used in the expression:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Integer literals in decimal, hex, or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/40713/sabotage-the-coding-standards/40740#40740&quot;&gt;octal&lt;/a&gt;, with optional &lt;code&gt;U&lt;/code&gt; and/or &lt;code&gt;LL&lt;/code&gt; suffix to denote unsigned / long long ints.&lt;/li&gt;&#xA;&lt;li&gt;A single &lt;code&gt;int&lt;/code&gt; variable, which will contain each of the integers from the input in turn. The variable can have any legal variable name.&lt;/li&gt;&#xA;&lt;li&gt;Any of the unary operators &lt;code&gt;+ - ! ~&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Any of the binary operators &lt;code&gt;+ - * / % &amp;lt;&amp;lt; &amp;gt;&amp;gt; &amp;lt; &amp;gt; &amp;lt;= &amp;gt;= == != &amp;amp; | ^ &amp;amp;&amp;amp; || ,&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The ternary operator &lt;code&gt;?:&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Parentheses.&lt;/li&gt;&#xA;&lt;li&gt;Operators that mutate their arguments (&lt;code&gt;++ --&lt;/code&gt;, &lt;code&gt;= += -=&lt;/code&gt; etc.) are not allowed.&lt;/li&gt;&#xA;&lt;li&gt;Character literals (&lt;code&gt;'a'&lt;/code&gt;, &lt;code&gt;'_'&lt;/code&gt;, &lt;code&gt;'\0'&lt;/code&gt;, etc.) are not allowed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Some examples of possible outputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;true            false           sample expression&#xA;[1, 3, 5, 7],   [2, 4, 6, 8]    c%2&#xA;[5, 6, 10],     [2, 8, 16]      t&amp;amp;~-t&#xA;[7, 14, 21],    []              22&amp;gt;x&amp;amp;!(x%7)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(&lt;em&gt;TODO&lt;/em&gt;: Specify undefined / implementation-defined behavior details? My test program assumes 32-bit ints / longs, 64-bit long longs, and &quot;nice&quot; two's-complement signed overflow / conversion.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;; your score is determined by the total number of characters in the outputs for these ten randomly-generated inputs: (&lt;em&gt;TODO&lt;/em&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Bonus:&lt;/strong&gt; Subtract 15 from your score if the output expression evaluates to &lt;strong&gt;1&lt;/strong&gt;, not just nonzero, for all 'true' inputs.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Welp, turns out my &quot;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/7476#7476&quot;&gt;Round Fractions&lt;/a&gt;&quot; question from earlier is pretty much a subset of &quot;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/26278/closest-fraction&quot;&gt;Closest fraction&lt;/a&gt;&quot;. So here's another idea I've been tossing around since the one challenge I answered in C a while back (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/49312/area-of-an-ascii-polygon&quot;&gt;Area of an ASCII Polygon&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is still very much a work-in-progress spec, though; some questions I have:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I believe this could be tagged as C rather than C++; the only difference I'm aware of is the ternary conditional's precedence, and given that no assignment operators are allowed, it might not make a difference.&lt;/li&gt;&#xA;&lt;li&gt;I'm not sure what tags would go best on this (is it &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; if the output isn't fixed?)&lt;/li&gt;&#xA;&lt;li&gt;I imagine there should probably be some additional constraint to prevent theoretically optimal but impossibly slow brute-force searches.&lt;/li&gt;&#xA;&lt;li&gt;The range [1, 127] is kind of arbitrary; my thought is that it should be able to handle anything in ASCII range + whitespace characters, but not much more than that, so as to make the special cases less restrictive.&lt;/li&gt;&#xA;&lt;li&gt;Would there be a way to spin this off as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, if establishing run-time conditions is too arbitrary?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I'm mostly done writing a program to test the output expressions; just need to do a bit more testing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That's pretty much it; hopefully this is enough to work with for feedback. Thoughts / comments?&lt;/p&gt;&#xA;" OwnerUserId="39461" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.193" LastActivityDate="2015-11-26T04:00:53.933" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7573" PostTypeId="2" ParentId="2140" CreationDate="2015-11-26T10:09:40.890" Score="3" Body="&lt;h1&gt;Comedy of exceptions&lt;/h1&gt;&#xA;&lt;p&gt;Your goal is to demonstrate the shortest program or function that can throw 10 different types of errors/exceptions (I use the two interchangeably here) at runtime.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;This question is only open to languages which have an object-oriented type system for errors. Furthermore, in the case of each error, a message including a clear identification of the exception's type must be printed&lt;/strong&gt;. Evidently, it must also have at least 10 error types. Other systems such as an integer error code identifying the error, or all errors represented by strings are not acceptable.&lt;/p&gt;&#xA;&lt;p&gt;Input is an integer from 0 to 9 inclusive. The program should reliably throw a different type of error for each input.&lt;/p&gt;&#xA;&lt;p&gt;Methods which allow exceptions of arbitrary type to be thrown &lt;strong&gt;may not be used&lt;/strong&gt;. E.g, &lt;code&gt;throw ... &lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Determining whether two errors are of different type (TODO: fill in detail of output)&lt;/h3&gt;&#xA;&lt;p&gt;Java: x and y print different stack traces, but are the same type, so they can't be used.&lt;/p&gt;&#xA;&lt;p&gt;Python: UnboundLocalError ..... and NameError ....... would count as two types of error, since, although UnboundLocalError is a subclass of NameError, &lt;code&gt;type()&lt;/code&gt; would give different results for the two.&lt;/p&gt;&#xA;&lt;p&gt;C++: stoi(&amp;quot;aaaa&amp;quot;) printing ......... would be valid since the message gives &lt;code&gt;std::invalid_argument&lt;/code&gt;. Integer division by zero would not since it crashes the program without a message informing of the error type&lt;/p&gt;&#xA;&lt;h3&gt;Sandbox&lt;/h3&gt;&#xA;&lt;p&gt;Please comment if you are aware of a language that is borderline on eligibility, blurs boundaries between error types, or has other loopholes.&lt;/p&gt;&#xA;" OwnerUserId="30688" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-26T10:09:40.890" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="7575" PostTypeId="1" AcceptedAnswerId="7577" CreationDate="2015-11-26T15:58:34.673" Score="2" ViewCount="221" Body="&lt;p&gt;With PHP, GET parameters may be specified as command-line arguments, which is a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2449/45941&quot;&gt;valid form of input&lt;/a&gt; by our rules. However, they &lt;em&gt;must&lt;/em&gt; be passed in the form &lt;code&gt;argname=value&lt;/code&gt; on the command line, because &lt;a href=&quot;http://php.net/manual/en/ini.core.php#ini.register-globals&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;register_globals&lt;/code&gt;&lt;/a&gt; is off by default, and we assume a default configuration. After an &lt;a href=&quot;https://codegolf.stackexchange.com/a/64829/45941&quot;&gt;exchange&lt;/a&gt; in the comments of an answer, I'd like to get clarification/consensus on how to score this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that this does not concern the use of &lt;code&gt;$argv&lt;/code&gt; parameters.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2015-11-26T16:07:59.743" Title="Scoring PHP GET Parameters" Tags="|discussion|scoring|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7576" PostTypeId="2" ParentId="7575" CreationDate="2015-11-26T15:58:34.673" Score="2" Body="&lt;h2&gt;Byte penalty equal to the parameter name + 1&lt;/h2&gt;&#xA;&lt;p&gt;Because passing a GET parameter on the command line is a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19/should-non-standard-compiler-flags-be-included-in-character-counts&quot;&gt;nonstandard command line argument&lt;/a&gt;, the parameter must count towards your score. The main question is, how much? Because passing input in the form &lt;code&gt;&amp;lt;program&amp;gt; &amp;lt;input-value&amp;gt; &amp;lt;input-value-2&amp;gt;...&lt;/code&gt; is not penalized, I propose that &lt;code&gt;&amp;lt;program&amp;gt; &amp;lt;arg1-name&amp;gt;=&amp;lt;input-value&amp;gt; &amp;lt;arg2-name&amp;gt;=&amp;lt;input-value-2&amp;gt;...&lt;/code&gt; should add a byte penalty equal to the sum of the lengths of the argument names, plus an additional byte per parameter for the &lt;code&gt;=&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The only other thing to consider is that they may be passed in via a &lt;code&gt;GET&lt;/code&gt; or &lt;code&gt;POST&lt;/code&gt; request in the context of a webserver. This is &lt;em&gt;not&lt;/em&gt; an acceptable method of input, because we require answers to be self-contained - the answer should be able to run with the input passed via &lt;code&gt;STDIN&lt;/code&gt;, function arguments, or any other acceptable form of input, with the specified flags if applicable, without needing external resources other than those specifically allowed in the question, and consistently produce the correct output.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-26T15:58:34.673" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7577" PostTypeId="2" ParentId="7575" CreationDate="2015-11-26T16:07:59.743" Score="2" Body="&lt;p&gt;The referred default permitted input formats is talking about &lt;code&gt;$argv&lt;/code&gt;. There isn't a default permitted input format of GET parameters, so this question doesn't make sense. If people want to permit GET parameters as an input format, either directly or via command lines, it's up to them to address the issue of scoring as part of their special case.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2015-11-26T16:07:59.743" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7578" PostTypeId="2" ParentId="2140" CreationDate="2015-11-26T16:12:56.767" Score="1" Body="&lt;p&gt;This might already exist, but through my search I couldn't find anything like it, so here it goes.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Find My Number &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;My friends and I have made are playing a game where we have a variable &lt;code&gt;N&lt;/code&gt; that represents a number from &lt;code&gt;0 to 10&lt;/code&gt;. Using an expression they give us containing &lt;code&gt;+ - * /&lt;/code&gt; for addition subtraction multiplication and division, &lt;code&gt;&amp;gt; &amp;lt; =&lt;/code&gt; for greater than, less than, and equal to, and the integers &lt;code&gt;0-10&lt;/code&gt;, we must find there number or what their number can possibly be.&lt;/p&gt;&#xA;&lt;p&gt;I’m lazy, so I want you to write a &lt;strong&gt;Program&lt;/strong&gt; that takes an input from STDIN or an acceptable alternative and return the possible numbers to STDOUT or an acceptable alternative.&lt;/p&gt;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;N+3&amp;gt;N*2-2&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Output&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;1, 2, 3, 4&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Input&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;N+2=N*2&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Output&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;2&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Input&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;N*4/6=N*2&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Output&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;0&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Because I might be caught, I want the program to be a small as possible in characters to avoid me friends seeing it, so the shortest solution wins!&lt;/p&gt;&#xA;" OwnerUserId="45448" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-26T21:44:05.153" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7581" PostTypeId="2" ParentId="2140" CreationDate="2015-11-26T23:35:01.430" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;http://www.setgame.com/quiddler&quot; rel=&quot;nofollow&quot;&gt;Quiddler&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Quiddler is a card game where you try to create words from letter cards drawn from a deck. A word is defined as being more than 2 cards in length. Sometimes letters are combined on cards in this game, however that will not be the case in this challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your mission is to write a program which creates words from the letters read in on standard input. Your dictionary of words is the &lt;a href=&quot;https://en.wikipedia.org/wiki/Words_%28Unix%29&quot; rel=&quot;nofollow&quot;&gt;words&lt;/a&gt; file on any standard unix system. You may assume that all strings this file is all lowercase.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The string of letters you can use to create words is read in on standard input. This string will be all lowercase, and will not have any spaces in it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Valid examples are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;actlj&#xA;jactl&#xA;ljdkj&#xA;jjabc&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Invalid are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;jklKLJKKJLKUIU&#xA;klj kljklj djkas;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The list of all possible results from said string each string. Remember you can produce multiple words in the same answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples of valid output include. Please remember that I came up with these off the top of my head, and may not be complete. Input is left aligned and the output is presented as the indented lines. The &lt;code&gt;-&amp;gt;&lt;/code&gt; is for your benefit.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;tacb  -&amp;gt; &#xA;         cat&#xA;         act&#xA;         bat&#xA;         tab&#xA;&#xA;fivquedrr -&amp;gt;&#xA;         five qud&#xA;         quid five&#xA;         river&#xA;         quiver&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The order of the solutions output does not need to be in any specific order.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The environment&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This program must run in a standard UNIX-like environment. This means that you may use any standard shell (bash, ksh, csh, zsh, fish), and you have access to all the standard tools. This challenge is restricted to the shell scripting languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The path to the dictionary file in the environment variable, &lt;code&gt;DICT&lt;/code&gt;, the path to the file should not be in any valid solution. Use &lt;code&gt;$DICT&lt;/code&gt; as the path to the dictionary. This is included so that you can provide testing instructions for your program.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Winner&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The winner is the one with the fewest bytes of code that produces the correct output.&lt;/p&gt;&#xA;" OwnerUserId="36073" LastEditorUserId="36073" LastEditDate="2015-11-29T16:35:57.660" LastActivityDate="2015-11-29T16:35:57.660" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7582" PostTypeId="2" ParentId="2140" CreationDate="2015-11-27T02:54:04.353" Score="0" Body="&lt;h1&gt;Cops and Robbers - Find the Formula&lt;/h1&gt;&#xA;&lt;p&gt;Cops will write a function that takes numerical inputs and produces numerical outputs (note - outputs can be any base and may contain letters). They will post the language, the number of bytes it takes to write the code (up to 128), rounded &lt;strong&gt;up&lt;/strong&gt; to the nearest power of 2, as well as a minimum of 2 test cases. The robbers will try to write a program that takes the same numerical inputs as the test cases and produces identical outputs.&lt;/p&gt;&#xA;&lt;p&gt;Note - PRNG's, hashing, and other forms of encryption are not allowed.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Cops (if safe)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;The floor of the product of:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;128 divided by the power of two rounded up for the bytes&lt;/li&gt;&#xA;&lt;li&gt;The natural logarithm of the number of test cases&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If cracked, -10 points.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Robbers&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;The floor of the quotient of&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Half the number rounded up to by the cops&lt;/li&gt;&#xA;&lt;li&gt;The natural logarithm of the number of test cases&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="43444" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-27T22:14:36.037" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="7586" PostTypeId="1" AcceptedAnswerId="7587" CreationDate="2015-11-27T10:43:16.480" Score="10" ViewCount="198" Body="&lt;p&gt;It's very common that other users comment and suggest ways to improve your answer. In almost all such cases, the user gets credited in the answer (&quot;Saved 6 bytes thanks to ... &quot;). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;A lot of those comments are removed by the user, while many are kept, at least for a while. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it OK / a good thing to flag such comments as obsolete, if proper credit is given? I've done this a few times on other people's answers, (and the flags are always accepted), but I sometimes want to do this on my own answers as well. I'm not sure if that is considered rude, or if it's a good thing to clean up the comment sections. &lt;/p&gt;&#xA;" OwnerUserId="31516" LastEditorUserId="31516" LastEditDate="2017-01-16T23:26:33.520" LastActivityDate="2017-01-16T23:26:33.520" Title="Flag comments for deletion when suggestion is implemented?" Tags="|discussion|flags|comments|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7587" PostTypeId="2" ParentId="7586" CreationDate="2015-11-27T10:45:10.390" Score="12" Body="&lt;p&gt;Yes, feel free to flag those comments whenever you see them. The important part of your question is&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;if proper credit is given&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'd hesitate to delete a suggestion if that leaves no trace of who actually came up with it.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-11-27T10:45:10.390" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7588" PostTypeId="2" ParentId="2140" CreationDate="2015-11-27T15:58:55.550" Score="7" Body="&#xA;&#xA;&lt;h1&gt;Ant Wars&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Parts of this challenge are based off of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5435/32700&quot;&gt;Ant Queen of the Hill Contest&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your objective is to conquer the ants of the world ... or have the biggest army of ants. To do this, you start with a single queen. The queen can create worker ants by using food gathered by itself or other worker ants. Your worker ants can kill other ants by attacking them. You win if you have the only queen left, or if you have the biggest army of ants. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Board&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The board will be a square with wraparound borders. The length of each edge is determined by &lt;code&gt;sqrt(1000*n)&lt;/code&gt;&lt;sup&gt;1&lt;/sup&gt;. Before the &lt;s&gt;game&lt;/s&gt; fierce battle for domination starts, &lt;code&gt;100*n&lt;/code&gt; pieces of food will be distributed semi-randomly on the board . &lt;code&gt;n&lt;/code&gt; queens, 1 for each player, will also be randomly distributed on the board.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1: n is the number of starting players&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Ants&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Sight and Smell&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Ants are usually near-sighted and have somewhat short antenna. Because of this, ants in this simulation can only see and smell ants, food, and pheromone in its 3 by 3 neighborhood. They can also tell the difference between ants of different species.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Memory&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Because of limited brain space, every ant has a memory of up to 5 characters long. The starting memory for queens is 5 spaces.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Orientation&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Every ant is oriented in the direction that it last moved. Queens start out oriented in a random direction.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Food&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each worker ants can carry up to 1 unit of food. A queen ant can carry an unlimited amount (so that's what her body is for). Every ant picks up as much food on its current square as possible. A queen ant takes all the food from adjacent squares including that carried by workers of any player.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Moves&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Every turn, every ant is given a view of the local surroundings and then decides to move. Ants are given priority in their movement with those that are oldest moving first. The initial order for the starting queens is random.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Attacking&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;An ant attacks by attempting to move onto another ant. Worker ants require two ants attacking them in order to be killed. Queen ants require eight ants attacking it in order to be killed. Queen ants cannot attack. An ant after being killed drops all food it is carrying and one additional unit of food.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Moving&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;An ant can move to any of the 8 surrounding squares. This changes the orientation of the ant to the direction it is moving. If it tries to move to a square with an ant already on it, it is assumed to be attacking that ant, no matter if friendly or not.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Dropping Pheromone&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;An ant can optionally increase the value of 4 different pheromones on the cell it is on, 1 of which can only be seen by ants of that particular colony. Pheromone has a value of a double-precision float and decreases by 1% every game tick. An ant can increase pheromone by up to 10.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Creating Workers&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A queen ant may create a worker and spawn it in any of the surrounding cells. The queen ant also chooses the memory of the new worker.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Winning&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A game ends after there is only one queen left or after 10000 turns. The winner is one of the players with a queen with the most workers. I will determine the winner after playing a number of games ... depending on the amount of time it takes to play each game.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Coding&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You can implement a program or a java class that takes in an ant input and gives an ant output for that ant.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input contains your player id, your ant's memory, if your ant is a queen, and then the contents of the cells surrounding it. The cells are given from the top left to the top right in this order:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 | 1 | 2&#xA;3 | 4 | 5&#xA;6 | 7 | 8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input is format thus:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;player_id;ant_memory;is_queen;cell_0_info;cell_1_info...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Cell info is formated like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;pheromone_0,pheromone_1,pheromone_2,pheromone_3,ant_type,ant_owner&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;player_id&lt;/code&gt; and &lt;code&gt;ant_owner&lt;/code&gt; are positive integers.&lt;br&gt;&#xA;&lt;code&gt;ant_memory&lt;/code&gt; is a 5-character long string.&lt;br&gt;&#xA;&lt;code&gt;is_queen&lt;/code&gt; is one of &lt;code&gt;true&lt;/code&gt; or &lt;code&gt;false&lt;/code&gt;.&lt;br&gt;&#xA;The pheromones are double-precision (64-bit) floats.&lt;br&gt;&#xA;&lt;code&gt;ant_type&lt;/code&gt; is one of &lt;code&gt;W&lt;/code&gt; (for worker ants) and &lt;code&gt;Q&lt;/code&gt; (for queen ants).&lt;br&gt;&#xA;If there is no ant on a cell, &lt;code&gt;ant_type&lt;/code&gt; and &lt;code&gt;ant_owner&lt;/code&gt; will be omitted from the input.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You have to output the cell you want to move to, the pheromone you wish to add to your current cell, and whether the ant would like to create an ant instead of moving (only works for queens :P).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It should be formatted thus:&#xA;    next_memory;cell;pheromone_0;pheromone_1;pheromone_2;pheromone_3;create_ant;created_ants_memory&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The controller is rather flexible and should be able to understand what you write if you use different delimiters or leave out some of the information. Make sure that &lt;code&gt;next_memory&lt;/code&gt; comes first in your programs output and that it is exactly 5 characters long. If creating an ant, &lt;code&gt;created_ants_memory&lt;/code&gt; needs to be the last 5 characters in the input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;cell&lt;/code&gt; has to be an integer in the range [0, 8] (defaults to &lt;code&gt;4&lt;/code&gt;).&lt;br&gt;&#xA;&lt;code&gt;pheromone_n&lt;/code&gt; has to be a positive float (defaults to &lt;code&gt;0&lt;/code&gt;).&lt;br&gt;&#xA;&lt;code&gt;create_ant&lt;/code&gt; needs to be one of: &lt;code&gt;true&lt;/code&gt;, &lt;code&gt;false&lt;/code&gt;, &lt;code&gt;yes&lt;/code&gt;, &lt;code&gt;no&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt;, or &lt;code&gt;0&lt;/code&gt;  (defaults to &lt;code&gt;false&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;How to create a bot:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You have 3 options for this. You can:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Implement the &lt;code&gt;Ant&lt;/code&gt; interface with a java class. (&lt;strong&gt;Very fast&lt;/strong&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Communicate to the controller via I/O streams.   (&lt;strong&gt;Fast&lt;/strong&gt; (I think))&lt;/li&gt;&#xA;&lt;li&gt;Be called via command arguments and output via STDOUT (&lt;strong&gt;Slow depending&lt;/strong&gt; on OS and programming language)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; Your bot must be completely deterministic. Given the same input, your bot should always return the same output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Method 1:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ant interface:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;interface Ant {&#xA;    String move(String input);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Implement this interface for your ants :)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Method 2:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every time it is one of your ants' turns, your program will receive a line of input through STDIN followed by a newline. After receiving the input, your program is expected to output a line through STDOUT followed by a newline.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Method 3:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program will be executed with the input line as its first argument. Your program is expected to output through STDOUT.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Time limit&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each time your program is called, it should return within 5 milliseconds. Since the time limit may be exceeded due to fluctuations outside your control, an average will be calculated. If at any point the average is above 5 milliseconds and the total time taken by your program across all calls so far is more than 10 seconds, the relevant player will be disqualified. This means they will not be eligible to win, their ant function will not be called again during that game, and all ants of that player will instantaneously perish.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Questions&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;How can I improve this to look prettier?&lt;/li&gt;&#xA;&lt;li&gt;Any typos or formatting issues?&lt;/li&gt;&#xA;&lt;li&gt;Any other ways I can improve this challenge?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="32700" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-03-15T19:01:04.667" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="7589" PostTypeId="2" ParentId="7502" CreationDate="2015-11-27T16:02:04.170" Score="10" Body="&lt;p&gt;I´m gonna propose some rules on counting Bytes in LabVIEW code, so tell me what you think.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As Bytes are not really what LabVIEW does they were renamed to LabVIEW Primitives.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;wires: each wire is 1 LabVIEW Primitive, splitting a wire makes it 2 LabVIEW Primitive and so on&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Constants: strings are 1 LabVIEW Primitive per character, bools are 1 LabVIEW Primitive, Arrays have 1 LabVIEW Primitive per Dimension Clusters are 1 LabVIEW Primitive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2.1 numerics are the size of their representation &lt;/p&gt;&#xA;&#xA;&lt;p&gt;2.2 numerics are 1 LabVIEW Primitive per Digit&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;VIs: LabVIEW intern VIs are 1 LabVIEW Primitive, SubVIs should not be used&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Structures: While and for loop each 1 LabVIEW Primitive case 1 LabVIEW Primitive per Case, Sequences are free, shift registers are 1 LabVIEW Primitive each&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;By average LabVIEW Primitive count this would probably place LabVIEW scores somewhere slightly above normal Languages like C but a good deal below golfing languages.&lt;/p&gt;&#xA;" OwnerUserId="47308" LastEditorUserId="47308" LastEditDate="2015-12-01T09:05:10.490" LastActivityDate="2015-12-01T09:05:10.490" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7591" PostTypeId="2" ParentId="2447" CreationDate="2015-11-27T16:35:24.863" Score="21" Body="&lt;h1&gt;CGI scripts may take input via GET/POST parameters&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A CGI script required to take, e.g., three inputs can be expected to be called as the GET request&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;GET script.cgi?&amp;lt;A&amp;gt;=&amp;lt;1st input&amp;gt;&amp;amp;&amp;lt;B&amp;gt;=&amp;lt;2nd input&amp;gt;&amp;amp;&amp;lt;C&amp;gt;=&amp;lt;3rd input&amp;gt; HTTP/1.1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(where &lt;code&gt;A&lt;/code&gt;, &lt;code&gt;B&lt;/code&gt; and &lt;code&gt;C&lt;/code&gt; are keys of the poster's choice) of the equivalent POST request.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2015-11-27T16:35:24.863" CommentCount="16" CommunityOwnedDate="2015-11-27T16:35:24.863" ContentLicense="CC BY-SA 3.0" />
  <row Id="7592" PostTypeId="2" ParentId="2140" CreationDate="2015-11-27T17:50:51.203" Score="0" Body="&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; I think the question is fine. I just need some more testcases for it.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;You are given the priority order of alleles for a particular trait. For example,&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A B&#xA;O&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;means that &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt; are equally dominant and &lt;code&gt;O&lt;/code&gt; is recessive to both of them. An organism has exactly two alleles, but only the dominant trait(s) is/are expressed. So an organism with gene &lt;code&gt;AO&lt;/code&gt; will express only &lt;code&gt;A&lt;/code&gt; but an organism with gene &lt;code&gt;AB&lt;/code&gt; will express both &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt;. An organism with two same alleles will express that allele only.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each offspring will receive two alleles - one from the mother and the other from the father. So if the initial parents are &lt;code&gt;AB&lt;/code&gt; and &lt;code&gt;AO&lt;/code&gt;, the offspring formed will be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;AA - 25%&#xA;AO - 25%&#xA;AB - 25%&#xA;BO - 25%&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Expressed traits will be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A - 50%&#xA;AB - 25%&#xA;B - 25%&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Offspring of one generation may breed only with a single member of the opposite sex in the same generation during its lifetime. Assume for the sake of this challenge that every male finds a random female in the same generation and has exactly two children - one male and one female. Siblings may interbreed. Note that, except for the first generation, we can ignore the sex of the individuals as their sex chromosomes assort independently of their other characteristics.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Priority order of all alleles (may include unnecesary alleles)&lt;/li&gt;&#xA;&lt;li&gt;Genotype of every organism in initial generation&lt;/li&gt;&#xA;&lt;li&gt;Number of generations created&lt;/li&gt;&#xA;&lt;li&gt;Any one allele&lt;/li&gt;&#xA;&lt;li&gt;(Optional) Number of lines of input for priority order (for languages like C++)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Probability of the specified allele existing in a randomly selected  individual in the specified generation (accurate to three decimal places)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Once two/three answers are posted, I'll use the same testcases in all of them to see which of them are faulty.&lt;/li&gt;&#xA;&lt;li&gt;After a week (or I could prolong the deadline) I will upload a lengthy test case in a few days. The code that solves it in the fastest time wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sample data&lt;/strong&gt; (Some simple testcases)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#1&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A&#xA;B&#xA;C&#xA;Male(s) - AA&#xA;Female(s) - AB&#xA;5&#xA;C&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output &lt;code&gt;0&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#2&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A&#xA;B&#xA;C&#xA;Male(s) - AA&#xA;Female(s) - AB&#xA;2&#xA;A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output &lt;code&gt;0.75&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#3&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A B&#xA;C D&#xA;Male(s) - AC,BD&#xA;Female(s) - AC,BC&#xA;1&#xA;C&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output &lt;code&gt;0.125&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="40929" LastActivityDate="2015-11-27T17:50:51.203" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7598" PostTypeId="1" CreationDate="2015-11-28T16:46:39.517" Score="6" ViewCount="298" Body="&lt;p&gt;I had the same doubt as specified &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7488/are-questions-in-which-no-answer-is-the-best-allowed&quot;&gt;here&lt;/a&gt; (which is why I haven't accepted any answers yet).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Reading it told me that both kinds of questions are accepted:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Catalog question&lt;/strong&gt; - Users attempt to find the shortest code in &lt;em&gt;every&lt;/em&gt; language. No answer is accepted.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Shortest code question&lt;/strong&gt; - Users attempt to find the shortest code possible in any &lt;em&gt;one language&lt;/em&gt; of their choice (often a golfing language). The answer that solves the task with the shortest code (irrespective of language used) wins and answer is accepted. Bounty may also be awarded.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Given that I have no personal opinion on the issue, &lt;strong&gt;which kinds of questions are more suited for which kind of challenge?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Detailed answer categorising various kinds of questions would be helpful.&lt;/p&gt;&#xA;" OwnerUserId="40929" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2015-11-30T17:47:46.077" Title="Which is better - a catalog Q, or a shortest code Q?" Tags="|discussion|asking-questions|" AnswerCount="4" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7600" PostTypeId="1" CreationDate="2015-11-28T21:09:13.783" Score="3" ViewCount="154" Body="&lt;p&gt;Extension of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7377/programming-in-minecraft-redstone-how-to-measure-program-size&quot;&gt;this thread&lt;/a&gt;. In this thread, please post tools or methods to count the size of programs to aid others in this process. These tools/methods should follow the counting rules listed in the corresponding meta post (link above).&lt;/p&gt;&#xA;" OwnerUserId="36670" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-11-28T22:55:33.460" Title="Methods / Tools for counting Minecraft program size" Tags="|discussion|code-golf|answers|scoring|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7601" PostTypeId="2" ParentId="7598" CreationDate="2015-11-28T21:11:38.397" Score="8" Body="&lt;h3&gt;Neither is &quot;better.&quot;&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Catalog challenges &lt;em&gt;are&lt;/em&gt; regular code golf challenges. As Doorknob noted in a comment, catalogs have thus far been used primarily as a code golf analog to Rosetta Code, where we find the shortest solution in each language to &lt;em&gt;simple&lt;/em&gt; challenges, rather than the most idiomatic solution.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;HOWEVER&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Making a challenge a catalog shouldn't be an excuse for posting an extremely simple challenge with an overly broad spec. It should still be an &lt;em&gt;interesting&lt;/em&gt; problem to solve, however simple, such as primality testing and truth machines, or a &quot;classic&quot; challenge such as Hello World and quines.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sandbox your challenge.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This helps with a number of things, but in this case especially the community can help decide whether a challenge makes a suitable &quot;catalog.&quot; It also never hurts to ask about a challenge idea in chat.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2015-11-28T21:11:38.397" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7602" PostTypeId="2" ParentId="7600" CreationDate="2015-11-28T21:14:02.840" Score="4" Body="&lt;h2&gt;Customizable MCEdit Filter&lt;/h2&gt;&#xA;&lt;p&gt;Edit: As @VoteToClose pointed out, the original filter did not work on mac. I have updated the repository to account for this and now there are separate mac and windows versions.&lt;/p&gt;&#xA;&lt;p&gt;I have created an MCEdit filter to do this task, where you can customize the count for each block and select any region you want. This filter works in any Minecraft version after Infdev. Here are some screenshots:&lt;/p&gt;&#xA;&lt;p&gt;Options:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/FdISv.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/FdISv.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/BaA7p.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/BaA7p.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/Pu4zc.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Pu4zc.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Ta2Kq.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Ta2Kq.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Download this filter &lt;a href=&quot;https://github.com/GamrCorps/PPCGMinecraftByteCounter&quot; rel=&quot;nofollow noreferrer&quot;&gt;here at my repository&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Suggest features by pinging &lt;code&gt;@GamrCorps&lt;/code&gt; in &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; or &lt;a href=&quot;http://chat.stackexchange.com/rooms/31934/mothership&quot;&gt;Mothership&lt;/a&gt; (My development chat).&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="36670" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-28T22:55:33.460" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7604" PostTypeId="2" ParentId="2140" CreationDate="2015-11-29T01:41:57.287" Score="-2" Body="&lt;h1&gt;What day of the week is Christmas?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Christmas is coming quickly, which leads to the question, what day of the week is Christmas this year? But what day of the week is Christmas for any year? Write a program that can do this. &lt;strong&gt;This is code golf, so the shortest code wins!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, there is a major twist. &lt;strong&gt;No builtin functions to do this task is allowed!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Bonuses&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If the program can handle B.C. years as negative numbers, then -25%&lt;/li&gt;&#xA;&lt;li&gt;If the program prints &quot;The first Christmas!&quot; for an input of -4 (4 B.C. is assumed to be when Jesus Christ was born), then -30 bytes&lt;/li&gt;&#xA;&lt;li&gt;If, for some reason, you really like builtins, +90%! So try NOT to use it!&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="34421" LastEditorUserId="34421" LastEditDate="2015-11-29T01:49:14.557" LastActivityDate="2015-11-29T01:49:14.557" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="7605" PostTypeId="2" ParentId="6918" CreationDate="2015-11-29T04:43:11.707" Score="8" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/ETHproductions/Japt&quot; rel=&quot;nofollow noreferrer&quot;&gt;Japt&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Japt&lt;/strong&gt; is a shortened version of &lt;strong&gt;Ja&lt;/strong&gt;vaScri&lt;strong&gt;pt&lt;/strong&gt;, created by me in early November 2015. &lt;a href=&quot;http://ethproductions.github.io/japt&quot; rel=&quot;nofollow noreferrer&quot;&gt;Online interpreter&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Japt is heavily based off of JavaScript. After transpiling Japt's syntax features to JS, it is evaluated as vanilla JS. This allows easy building of an online interpreter. Some of the main features are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;One-letter functions:&lt;/strong&gt; each lowercase letter corresponds to a specific function, which is different on strings, arrays, and numbers.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;String compression:&lt;/strong&gt; Japt &lt;a href=&quot;https://codegolf.stackexchange.com/a/63338/42545&quot;&gt;uses&lt;/a&gt; the &lt;a href=&quot;http://ed-von-schleck.github.io/shoco/&quot; rel=&quot;nofollow noreferrer&quot;&gt;shoco library&lt;/a&gt; for string compression. Wrapping a string in backticks tells the interpreter to automatically decompress it.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Anonymous functions:&lt;/strong&gt; &lt;code&gt;XY{X+Y}&lt;/code&gt; is transpiled to &lt;code&gt;function(X,Y){return X+Y}&lt;/code&gt;, as is &lt;code&gt;@X+Y}&lt;/code&gt;, and in some cases, simply &lt;code&gt;+&lt;/code&gt;. This allows for easy creation of functions on the fly.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Unicode shortcuts:&lt;/strong&gt; All 1-byte characters from &lt;code&gt;¡&lt;/code&gt; to &lt;code&gt;Ã&lt;/code&gt; transpile to longer sequences of chars.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;And much more...&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Check out the &lt;a href=&quot;https://codegolf.stackexchange.com/a/65191/42545&quot;&gt;vote-by-vote showcase&lt;/a&gt;!&lt;/h3&gt;&#xA;" OwnerUserId="42545" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-28T17:49:34.337" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7606" PostTypeId="2" ParentId="7598" CreationDate="2015-11-29T07:25:32.160" Score="18" Body="&lt;p&gt;This is a false distinction.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On &lt;em&gt;every&lt;/em&gt; code golf question, people answer in a variety of languages, striving for the shortest solution in that language. If it were simply a competition for the overall shortest solution, there would no point coding in Java or Python or any language but a select few that are very concise or perfectly-built for the task.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the same time, people are having fun with &quot;my Pyth code beat your CJam code by 1 byte&quot; and writing new languages designed to push the limits of golfing. And that's cool too, having a &quot;heavyweight&quot; league. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pretty much any question supports both the overall-shortest league than the per-language competitions.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2015-11-29T07:25:32.160" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7608" PostTypeId="2" ParentId="7598" CreationDate="2015-11-29T08:49:20.990" Score="17" Body="&lt;p&gt;I'm not a fan of catalogues for the sake of catalogues. A catalogue should have a &lt;em&gt;raison d'être&lt;/em&gt;. The original &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7224/194&quot;&gt;question about catalogues&lt;/a&gt; talks about&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;the catalogue nature of challenges corresponding to simple (and common) tasks&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So in my mind there are two reasons to turn a question into a catalogue:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The task is so standardised that it's become a cliché. If there are 10 different languages on esolangs.org which include a reference implementation for this task on their page, it would fall into this category (unless someone has added them just to point back to this paragraph :-p ).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The task is a basic building block which will be used as a &lt;em&gt;minor&lt;/em&gt; part of lots of other tasks. Take, for example, sorting an array of numbers. It probably does fall under the first reason, but it would fit better under this second reason, because many many answers on this site use a sort as a component without being really about sorting. (And the value as a reference for people who want a sorting procedure to slot into their program and don't care whether it's shellsort, quicksort, or bogosort is the reason that when there were active discussions about how to do a sorting catalogue I campaigned for a single question without partitioning by algorithm).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2015-11-29T08:49:20.990" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7609" PostTypeId="2" ParentId="2140" CreationDate="2015-11-29T16:51:17.027" Score="0" Body="&lt;h1&gt;Ancient Language Translator&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&amp;#x3C;insert a silly story here&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program that takes an English sentence and translates it into the &lt;a href=&quot;http://www.paolini.net/writers-corner/invented-languages-inheritance-cycle/ancient-language/english-ancient-language-dictionary/&quot; rel=&quot;nofollow&quot;&gt;Ancient Language&lt;/a&gt;.&#xA;You have to implement at least 42 words.&#xA;For the purpose of this challenge, you do not have to care about special rules such as &quot;(may be shortened to al when used as a prefix, as in albitr)&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An English sentence.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A translated version of the input, simply replace the English words with the Ancient ones.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To be added.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Suggestions?&lt;/p&gt;&#xA;" OwnerUserId="33160" LastActivityDate="2015-11-29T16:51:17.027" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7612" PostTypeId="2" ParentId="2140" CreationDate="2015-11-30T05:14:15.320" Score="2" Body="&lt;h1&gt;Count up by factor keys&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;TODO: Better title&lt;/p&gt;&#xA;&lt;h3&gt;Information&lt;/h3&gt;&#xA;&lt;p&gt;Let the &lt;em&gt;factor key&lt;/em&gt; of a number &lt;em&gt;n&lt;/em&gt; be the result of the following process:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Compute the prime factorization of &lt;em&gt;n&lt;/em&gt;: n = p&lt;sub&gt;1&lt;/sub&gt;&lt;sup&gt;e&lt;sub&gt;1&lt;/sub&gt;&lt;/sup&gt;  * p&lt;sub&gt;2&lt;/sub&gt;&lt;sup&gt;e&lt;sub&gt;2&lt;/sub&gt;&lt;/sup&gt; * p&lt;sub&gt;3&lt;/sub&gt;&lt;sup&gt;e&lt;sub&gt;3&lt;/sub&gt;&lt;/sup&gt; * ... where all p&lt;sub&gt;i&lt;/sub&gt; are prime, distinct and in increasing order, and all e&lt;sub&gt;i&lt;/sub&gt; are positive integers.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Compute each p&lt;sub&gt;i&lt;/sub&gt;&lt;sup&gt;e&lt;sub&gt;i&lt;/sub&gt;&lt;/sup&gt;; call these factors the f&lt;sub&gt;i&lt;/sub&gt;. So n = f&lt;sub&gt;1&lt;/sub&gt; * f&lt;sub&gt;2&lt;/sub&gt; * f&lt;sub&gt;3&lt;/sub&gt; *....&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Convert each f&lt;sub&gt;i&lt;/sub&gt; to a string.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Concatenate all the strings together.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Evaluate as a number.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&lt;p&gt;The factor key of &lt;code&gt;2376&lt;/code&gt; is &lt;code&gt;82711&lt;/code&gt;, since 2376 = 2&lt;sup&gt;3&lt;/sup&gt; * 3&lt;sup&gt;3&lt;/sup&gt; * 11 = &lt;code&gt;8&lt;/code&gt; * &lt;code&gt;27&lt;/code&gt; * &lt;code&gt;11&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The factor key of &lt;code&gt;931&lt;/code&gt; is &lt;code&gt;4919&lt;/code&gt;, since &lt;code&gt;931&lt;/code&gt; = 7&lt;sup&gt;2&lt;/sup&gt; * 19 = &lt;code&gt;49&lt;/code&gt; * &lt;code&gt;19&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;As a special case, the factor key of &lt;code&gt;1&lt;/code&gt; is &lt;code&gt;0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Output all positive integers, starting from 1, in increasing orders of their factor keys. If two numbers have the same factor key, output the smaller number first. The output must be separated by a delimiter, but this delimiter can be any non-numeric character. If you choose spaces, your output should start with the following:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3 4 5 7 8 9 11 13 16 17 19 6 23 10 25 14 27 29 31 37 41 12 43 28 47 36&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest solution in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-30T22:25:04.023" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7614" PostTypeId="1" AcceptedAnswerId="7615" CreationDate="2015-11-30T12:40:52.837" Score="16" ViewCount="798" Body="&lt;p&gt;This is an extension &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/4939/8478&quot;&gt;of this meta question&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've always assumed that function submissions were allowed under the premise that the code would be evaluated once and would in the process either:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Define a named function which can be used from then on.&lt;/li&gt;&#xA;&lt;li&gt;End with an expression which evaluates to an unnamed function, such that if it would be captured in a name could be reused arbitrarily often.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Is that actually what everyone else thinks function submissions should be like? This encompasses several subquestions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do function submissions have to consist of a single definition/expression, or can they be accompanied by additional code which defines helper functions or variables outside the function itself?&lt;/li&gt;&#xA;&lt;li&gt;Are function submissions allowed if it's necessary to repeat the entire function definition/expression each time the function should be used? (Or does it have to be possible to store the function in a name once and reuse it from the on.)&lt;/li&gt;&#xA;&lt;li&gt;If functions are accompanied by additional code, &lt;em&gt;and&lt;/em&gt; it's allowed to require the function definition to be repeated, is it allowed to require the accompanying code to be repeated, too?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-01-26T18:58:38.857" Title="What are our rules about additional code accompanying function submissions?" Tags="|discussion|policy|code-golf|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7615" PostTypeId="2" ParentId="7614" CreationDate="2015-11-30T12:48:19.797" Score="21" Body="&lt;p&gt;As mentioned in the question, I do have my own opinion on this, so I'm putting it up for votes here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've used the argument &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4940/8478&quot;&gt;that function submissions should be reusable&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4781/8478&quot;&gt;several times&lt;/a&gt; for other policies which are generally accepted consensus now. Hence, I think that the whole point of a function submission should be that it can be reused arbitrarily often, without having to repeat any code to redefine globals or the function itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In summary, I would propose the following set of rules:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The submitted code should either define a named function or evaluate to an unnamed function which can be captured in a name if desired (or if the language provides other mechanisms which allow the function to be used multiple times without repeating its definition).&lt;/li&gt;&#xA;&lt;li&gt;Function submissions may consist of several statements, in order to define helper functions or global variables used by the function, as long as Rule 1 is met.&lt;/li&gt;&#xA;&lt;li&gt;Using &lt;em&gt;only the name&lt;/em&gt; that results from Rule 1 the function has to be reusable arbitrarily often, without a) restating the function definition or b) any other code accompanying the submission.&lt;/li&gt;&#xA;&lt;li&gt;The function &lt;em&gt;may&lt;/em&gt; rely on globals as long as it doesn't break them itself (see the linked meta question). That is, you should assume that the globals you're using aren't touched by any other code between function calls. These may be defined outside the function &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5532/8478&quot;&gt;as per this consensus&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;If the code would only work by evaluating the entire code each time, make it a full-program submission instead.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-01-26T18:58:38.857" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="7620" PostTypeId="2" ParentId="7496" CreationDate="2015-11-30T17:38:41.103" Score="3" Body="&lt;h1&gt;In General...&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Coming from a C# golfing background, as far as I'm concerned, as long as csc compiles it without complaining, then it's not a problem, and you don't need any &lt;code&gt;using&lt;/code&gt;/&lt;code&gt;import&lt;/code&gt; clauses in your code at all - they are not the references, they are just for naming's sake. The references are indeed usually sorted out by the csproj/vbproj, but mscorlib (which contains just about anything you'd ever want for golf) is included by default (as I recall, if you look in Visual Studio, there is a specific project option somewhere to &lt;em&gt;not&lt;/em&gt; include mscorlib, because it's a special command for csc/vbc (mono versions exist, as Peter Taylor has said)).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, this simple VB.NET program compiles fine by just passing it to &lt;a href=&quot;https://msdn.microsoft.com/en-us/library/4dehewf5.aspx&quot; rel=&quot;nofollow&quot;&gt;vbc&lt;/a&gt; (e.g. &lt;code&gt;vbc test.vb&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Module M&#xA;    Sub Main&#xA;        Console.WriteLine(&quot;ponies&quot;)&#xA;    End Sub&#xA;End Module&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note the lack of any &lt;code&gt;System&lt;/code&gt; in there at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have supplied C# code for challenges before, and supplied instructions to compile them with csc (I don't provide a csproj or the like), which I have reason to believe has been done.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As long as you don't use anything outside of mscorlib, then your answer is going to be valid. It is a feature of VB.NET that it imports &lt;code&gt;System&lt;/code&gt; by default (whether the vbproj does or not), just as it is a feature of C# that is doesn't, and exploiting either is fine. If you are ever worried about the validity of your code, then just throw it at vbc, and if it compiles, then as far as I'm concerned, no one has any reason to complain about it.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;In The Example...&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Whether or not the example's byte score is valid is not something I would wish to comment on, but I would suggest providing the command to compile any program that isn't absolutely trivial so that people can make up their own mind.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the example you provided, however, you need a references to &lt;code&gt;System.Numeric.dll&lt;/code&gt;, which you would have to tell to the compile (with a &lt;code&gt;/r:System.Numeric.dll&lt;/code&gt; command-line argument). I don't know how this would be counted (I prefer not to, and have never needed to, use any external libraries before - it's usually more fun to not do so).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Part of the pain is that &lt;code&gt;vbc test.vb /r:System.Numerics.dll&lt;/code&gt; isn't going to work from most directories - the compiler needs to also know where to find said DLL. Like I said, I steer clear of using non-mscorlib libraries for a host of reasons, this one inclusive. I imagine though that you'd be allowed to assume it's in the same directory, given we assume the code is in the working directory anyway, this would seem fair.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Last Thought...&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Just occurred to me that most people aren't going to bother to run csc or vbc; if anything, they will put the code into IDEOne, or something similar. In the case of the example it fails to compile, complaining about being unable to access System.Numerics.BitInteger.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My stupid example program, however, runs fine on IDE-One, as will just about any other piece of .NET golf you find on this site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The only time I've ever shipped a csproj on this site was when I was providing a library for other people to use in the Genetic Algorithm competition for which byte count didn't matter (and that was only because I had more than one file).&lt;/p&gt;&#xA;" OwnerUserId="26981" LastActivityDate="2015-11-30T17:38:41.103" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7621" PostTypeId="2" ParentId="7598" CreationDate="2015-11-30T17:47:46.077" Score="1" Body="&lt;h1&gt;Shortest code Q&lt;/h1&gt;&#xA;&lt;p&gt;Ask a catalog Q only if you had this thing in mind:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Disclaimer:&lt;/strong&gt; I know this question is easy, trivial and there are many languages specifically designed for this task. But it is here for good reasons.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;There are no real differences between a catalog Q and a shortest code Q.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-30T17:47:46.077" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7623" PostTypeId="1" CreationDate="2015-11-30T19:21:42.697" Score="5" ViewCount="466" Body="&lt;p&gt;Inspired from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/64520/find-the-interwoven-source-codes-cops&quot;&gt;this&lt;/a&gt; question, I decided to submit an interweaved program (now deleted) written in &lt;a href=&quot;https://esolangs.org/wiki/Seed&quot; rel=&quot;nofollow noreferrer&quot;&gt;Seed&lt;/a&gt;. This program uses a Mersenne twister to generate programs by entering a program that consists of two numbers. Using these two numbers, Seed generates a Befunge program. This is created by the &lt;strong&gt;randomization&lt;/strong&gt; of the seed. After looking up what the definition was for &lt;a href=&quot;https://en.wikipedia.org/wiki/Cryptography&quot; rel=&quot;nofollow noreferrer&quot;&gt;cryptography&lt;/a&gt; and &lt;a href=&quot;https://en.wikipedia.org/wiki/Hash_function&quot; rel=&quot;nofollow noreferrer&quot;&gt;hashing&lt;/a&gt; I'm not really sure if it counts as hashing or cryptography. Seed only uses the randomization of the seed, but does not change anything else to the data received from the seed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although I only used Seed as an example, there certainly are more programming languages which use roughly the same algorithm. Do these programming languages fall under the category encryption or hashing?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Edit, for the ones interested in my post:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/DEHxO.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/DEHxO.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="34388" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2015-12-02T20:49:59.923" Title="Does randomization count as encryption or hashing?" Tags="|discussion|" AnswerCount="3" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="7625" PostTypeId="2" ParentId="7623" CreationDate="2015-11-30T19:50:55.540" Score="5" Body="&lt;h2&gt;Encryption: no, hashing: maybe&lt;/h2&gt;&#xA;&lt;p&gt;Wikipedia on encryption:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;In cryptography, encryption is the process of encoding messages or information in such a way that only authorized parties can read it.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Typically how this works is, you encrypt some data using a key, pass the encrypted data to the other party, and they decrypt it with a key (which may or may not be the same key, depending on if the encryption algorithm uses symmetric or asymmetric keys). The defining feature of encryption is, without the decryption key, a third party would not be able to retrieve the original data. Some algorithms are more secure than others, but that's not a relevant discussion.&lt;/p&gt;&#xA;&lt;p&gt;Wikipedia on hash functions:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A hash function is any function that can be used to map data of arbitrary size to data of fixed size.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The key difference between hash functions and encryption is that encryption is designed to be reversible if you have the proper key. A hash function may or may not be reversible; a certain class of functions called &lt;em&gt;cryptographic hash functions&lt;/em&gt; are designed to be irreversible, outside of brute-force attacks.&lt;/p&gt;&#xA;&lt;p&gt;A Seed program is definitely not an encrypted form of a Befunge-98 program. There is no key that one could use to efficiently compute a Seed program from a Befunge-98 program.&lt;/p&gt;&#xA;&lt;p&gt;As for hashing, possibly, depending on how you look at it. If you view the Seed program as being the input, and the Befunge-98 program as being the hash, the definition sort of works. Though it makes use of an RNG (specifically the Mersenne Twister algorithm), computing a Befunge-98 program from a Seed program is wholly deterministic, and can be done in an efficient manner. On the flipside, computing a Seed program from a Befunge-98 program (or even just a Seed program from a given expected output) can only be done by brute-forcing the seed space (unless the Mersenne Twister algorithm has some &lt;em&gt;major&lt;/em&gt; flaws in its design).&lt;/p&gt;&#xA;&lt;p&gt;As for the challenge in question, though submitting two interwoven Seed programs is not explicitly against the rules, some might interpret it as being against the spirit of the challenge, because it involves an RNG. That's barely relevant though, because Seed programs are wholly deterministic. Though the crack would likely come about through the use of brute force, I don't see a problem with that, as the brute forcing is not unbounded; there are a finite number of pairs of valid Seed programs that could be formed from your entry. I suspect the downvotes were from ignorance; people saw &amp;quot;RNG&amp;quot; in the language description and hastily downvoted without reading further and seeing that Seed is actually deterministic.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-11-30T19:50:55.540" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="7627" PostTypeId="2" ParentId="7623" CreationDate="2015-12-01T01:54:20.807" Score="18" Body="&lt;p&gt;It's more about the spirit of the rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Cops and robbers have had a problem of cop submissions that just do convoluted arithmetic. They are not solved by thinking about code, but by thinking numbers. This is boring because the structure of the code and language often matters little, and the robber is just trying to find the pre-image to some arithmetical function. With a convoluted enough operation, there's nothing better to do that brute-force search all possibilities.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is what the rule is trying to avoid when it bans hashing or cryptography -- built ins that just give you a mangling function. Random number generators are much the same. Even if those were specifically banned though, there are many ways to home-brew something similar. We've seen lots of them, and feel boring and samey.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, yes, the rules are vague and many people have &quot;won&quot; using the same idea. Even if your submission was legal, it may draw downvotes because it's cheap. It's the question's fault though that such cheap answers are a good path to winning by the rules as written.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that many top-voted cops give an interesting challenge that is meant to be cracked in a fun way, rather than trying to be uncrackable. Maybe it's best to think of cops as puzzles posed rather than code made to win an adversarial game.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2015-12-01T07:57:11.190" LastActivityDate="2015-12-01T07:57:11.190" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7628" PostTypeId="2" ParentId="7502" CreationDate="2015-12-01T03:05:14.323" Score="11" Body="&lt;p&gt;Some time ago, there was a program for the Mac called &quot;&lt;a href=&quot;https://en.wikipedia.org/wiki/Quartz_Composer&quot; rel=&quot;nofollow noreferrer&quot;&gt;Quartz Composer&lt;/a&gt;&quot; use for doing some graphic things.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main thing I'm bringing up here is the interface...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/hsRzQ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/hsRzQ.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The boxes and lines connecting to them.  A simpler one:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/vkdVi.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/vkdVi.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When you actually dig into the file that is saved, it turns out to be an xml file.&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;key&amp;gt;rootPatch&amp;lt;/key&amp;gt;&#xA;&amp;lt;dict&amp;gt;&#xA;    &amp;lt;key&amp;gt;class&amp;lt;/key&amp;gt;&#xA;    &amp;lt;string&amp;gt;QCPatch&amp;lt;/string&amp;gt;&#xA;    &amp;lt;key&amp;gt;state&amp;lt;/key&amp;gt;&#xA;    &amp;lt;dict&amp;gt;&#xA;        &amp;lt;key&amp;gt;connections&amp;lt;/key&amp;gt;&#xA;        &amp;lt;dict&amp;gt;&#xA;            &amp;lt;key&amp;gt;connection_1&amp;lt;/key&amp;gt;&#xA;            &amp;lt;dict&amp;gt;&#xA;                &amp;lt;key&amp;gt;destinationNode&amp;lt;/key&amp;gt;&#xA;                &amp;lt;string&amp;gt;Camera_1&amp;lt;/string&amp;gt;&#xA;                &amp;lt;key&amp;gt;destinationPort&amp;lt;/key&amp;gt;&#xA;                &amp;lt;string&amp;gt;inputRotateX&amp;lt;/string&amp;gt;&#xA;                &amp;lt;key&amp;gt;sourceNode&amp;lt;/key&amp;gt;&#xA;                &amp;lt;string&amp;gt;Interpolation_1&amp;lt;/string&amp;gt;&#xA;                &amp;lt;key&amp;gt;sourcePort&amp;lt;/key&amp;gt;&#xA;                &amp;lt;string&amp;gt;outputValue&amp;lt;/string&amp;gt;&#xA;            &amp;lt;/dict&amp;gt;&#xA;            &amp;lt;key&amp;gt;connection_2&amp;lt;/key&amp;gt;&#xA;            &amp;lt;dict&amp;gt;&#xA;                &amp;lt;key&amp;gt;destinationNode&amp;lt;/key&amp;gt;&#xA;                &amp;lt;string&amp;gt;Camera_1&amp;lt;/string&amp;gt;&#xA;                &amp;lt;key&amp;gt;destinationPort&amp;lt;/key&amp;gt;&#xA;                &amp;lt;string&amp;gt;inputRotateY&amp;lt;/string&amp;gt;&#xA;                &amp;lt;key&amp;gt;sourceNode&amp;lt;/key&amp;gt;&#xA;                &amp;lt;string&amp;gt;Interpolation_2&amp;lt;/string&amp;gt;&#xA;                &amp;lt;key&amp;gt;sourcePort&amp;lt;/key&amp;gt;&#xA;                &amp;lt;string&amp;gt;outputValue&amp;lt;/string&amp;gt;&#xA;            &amp;lt;/dict&amp;gt;&#xA;            &amp;lt;key&amp;gt;connection_3&amp;lt;/key&amp;gt;&#xA;            &amp;lt;dict&amp;gt;&#xA;                &amp;lt;key&amp;gt;destinationNode&amp;lt;/key&amp;gt;&#xA;                &amp;lt;string&amp;gt;Camera_1&amp;lt;/string&amp;gt;&#xA;                &amp;lt;key&amp;gt;destinationPort&amp;lt;/key&amp;gt;&#xA;                &amp;lt;string&amp;gt;inputTranslateX&amp;lt;/string&amp;gt;&#xA;                &amp;lt;key&amp;gt;sourceNode&amp;lt;/key&amp;gt;&#xA;                &amp;lt;string&amp;gt;Interpolation_3&amp;lt;/string&amp;gt;&#xA;                &amp;lt;key&amp;gt;sourcePort&amp;lt;/key&amp;gt;&#xA;                &amp;lt;string&amp;gt;outputValue&amp;lt;/string&amp;gt;&#xA;            &amp;lt;/dict&amp;gt;&#xA;        &amp;lt;/dict&amp;gt;&#xA;        &amp;lt;key&amp;gt;nodes&amp;lt;/key&amp;gt;&#xA;        &amp;lt;array&amp;gt;&#xA;            &amp;lt;dict&amp;gt;&#xA;                &amp;lt;key&amp;gt;class&amp;lt;/key&amp;gt;&#xA;                &amp;lt;string&amp;gt;QCInterpolation&amp;lt;/string&amp;gt;&#xA;                &amp;lt;key&amp;gt;key&amp;lt;/key&amp;gt;&#xA;                &amp;lt;string&amp;gt;Interpolation_1&amp;lt;/string&amp;gt;&#xA;                &amp;lt;key&amp;gt;state&amp;lt;/key&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I'm not going to claim that this the most efficient storage (that particular one goes on for 2465 lines).  However, the thing that should be examined is the way to represent the labview in such a way that one could take the text representation and covert it back into a working graph.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Just counting wires as 1 byte is &lt;strong&gt;&lt;em&gt;cheap&lt;/em&gt;&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While this may be a significant undertaking, consider trying to figure out how to represent the LabVIEW structure in JSON or another structured data language. The necessary thing is to be able to represent the program in text, and be able to convert it back to the same program in LabVIEW via a mechanical transformation.  Otherwise, this feels very much like &quot;I'm going to write in C, but I'm going to count &lt;code&gt;if&lt;/code&gt; as one byte and &lt;code&gt;switch(x) { 1: break; }&lt;/code&gt; as four bytes&quot;... which, well, it's not.  Golfing LabVIEW according to some scoring system is fine, but calling them bytes and comparing them with languages that actually use characters is like comparing apples and oranges.  Call them &quot;LabVIEW Primitives&quot; or &quot;weighted fundamental graphical programming primitives&quot; - but not bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another (better?) way of getting an idea of how much information is in a given LabVIEW file is to take the save file for it, and compress it with a standard compression program at maximum space efficiency - and that is how big the 'program' is. Its kind of like how the byte counting of the golfing languages can encode things in there.&lt;/p&gt;&#xA;" OwnerDisplayName="user12166" LastActivityDate="2015-12-01T03:05:14.323" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7629" PostTypeId="1" AcceptedAnswerId="7630" CreationDate="2015-12-01T03:51:04.737" Score="8" ViewCount="407" Body="&lt;p&gt;So the title pretty much says it, but I'll repeat: What actually defines something as a &quot;new&quot; programming language and not just a library of functions for an existing language? I know that golf languages like Japt and Pyth are written through Javascript and Python, but what makes them fundamentally different from their &quot;parent languages&quot; in a way that they can be called new languages? Because, arent they just writing functions and things that are short then compiling through python/JS? Sorry if this sounds crazy and makes no sense. I just dont really get this whole &quot;create a new language&quot; thing. As a begginer, the idea sounds appealing, but I want to understand the implications of this and what it means. Also, as a beginner to programming in general, is creating a new language a good idea/a good way to learn or should I wait until I know so more. (See my StackOverflow profile/questions for a basic idea of where I am right now.)  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Edit: Found this post, thought it might help the dicussion here: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/871/creating-new-language-would-it-be-legal&quot;&gt;Creating new language. Would it be legal?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="47680" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2015-12-03T16:13:19.920" Title="So what actually defines something as a &quot;new&quot; programming language?" Tags="|discussion|" AnswerCount="4" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7630" PostTypeId="2" ParentId="7629" CreationDate="2015-12-01T04:06:19.423" Score="15" Body="&lt;h2&gt;The compiler/interpreter defines the language&lt;/h2&gt;&#xA;&lt;p&gt;If you can take a sequence of bytes and feed it to a program that does something based on those bytes, it's a programming language in the general sense. By &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/45941&quot;&gt;our standards&lt;/a&gt;, it must do the same thing for the same input, and be capable of adding two numbers and testing primality, as well as the other details in that answer. Simply having a specification does not count - it needs a compiler or interpreter (or transpiler, or whatever you want to call it) to count.&lt;/p&gt;&#xA;&lt;p&gt;Japt and Pyth compile to Javascript and Python (respectively), but Japt/Pyth code is not Javascript/Python code. If you attempt to run Pyth code in Python, it will not work. You have to run the Pyth code through the Pyth compiler to get Python code.&lt;/p&gt;&#xA;&lt;p&gt;There's an additional clarification that needs to be made, on the subject of polyglots and languages sharing syntax: two &amp;quot;languages&amp;quot; (as defined by their compilers/interpreters) are identical if and only if every valid program in one is valid in the other, and the same valid program results in the same behavior in both &amp;quot;languages&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;For example: any sequence of bytes is a valid Seriously program. Therefore, any Python program is a valid Seriously program. However, they are absolutely not the same language; just try running some Python code in Seriously. You will almost certainly get a very different result.&lt;/p&gt;&#xA;&lt;p&gt;Another example: Brainfuck. There are &lt;em&gt;many&lt;/em&gt; compilers and interpreters for Brainfuck, and some might argue that you haven't truly programmed until you have written one. Because all valid Brainfuck programs (i.e. those with matching braces) produce the same behavior in all correct implementations (those that are incorrect need not apply), all of those implementations represent the same Brainfuck language (and those that don't produce the same behavior don't represent it).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-03T16:13:19.920" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7631" PostTypeId="2" ParentId="7629" CreationDate="2015-12-01T04:39:23.677" Score="2" Body="&lt;h1&gt;&lt;em&gt;If it don't run right in its parent lang, it's its own lang&lt;/em&gt;&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;PROOF/EXAMPLE&lt;/strong&gt;: Try running this  code in any (proper) Javascript environment: &lt;code&gt;5²&lt;/code&gt;. Throws an error? There you go:  is a new language.&lt;/p&gt;&#xA;&lt;p&gt;Simple as that (I think).&lt;/p&gt;&#xA;" OwnerUserId="41247" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-01T04:39:23.677" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="7632" PostTypeId="2" ParentId="2140" CreationDate="2015-12-01T09:10:07.997" Score="10" Body="&lt;h1&gt;N-Player Battleship&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The field is a 5N by 5N grid, where N is the number of players.&lt;/li&gt;&#xA;&lt;li&gt;The controller places each player's ships randomly.&lt;/li&gt;&#xA;&lt;li&gt;Each player can see their ships and the shots they have made, successful or not. Each player can also see other players' &lt;em&gt;successful&lt;/em&gt; shots. &lt;/li&gt;&#xA;&lt;li&gt;Each player gets one shot per turn.&lt;/li&gt;&#xA;&lt;li&gt;Each player's fleet consists of, for a total of 21 squares altogether&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1 aircraft carrier - 5 squares&lt;/li&gt;&#xA;&lt;li&gt;1 battleship - 4 squares&lt;/li&gt;&#xA;&lt;li&gt;2 destroyers - 3 squares&lt;/li&gt;&#xA;&lt;li&gt;3 assault boats - 2 squares&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;You are allowed to keep state information between turns, but not between rounds/games.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;The Specs&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input will consist of one integer and a list of lists, space-separated, like so: &lt;code&gt;3 [[S, X, .],[S, O, M],[S, ., H]]&lt;/code&gt;. This corresponds to the following grid:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;S X .&#xA;S O M&#xA;S . H&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;These are the meanings of the characters:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;.&lt;/code&gt; Unknown (i.e., it's empty or no one has attacked there yet)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;O&lt;/code&gt; A piece of your ship that has not been hit&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;X&lt;/code&gt; A piece of your ship that has been hit&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;M&lt;/code&gt; One of your missed attacks&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;H&lt;/code&gt; A hit from another player&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;S&lt;/code&gt; A ship that has been sunk, either yours or an enemy's&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Output must be a pair of integers in the format &lt;code&gt;x y&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Adjustments to the fleet?&lt;/li&gt;&#xA;&lt;li&gt;More details needed in the spec or rules?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12914" LastActivityDate="2015-12-01T09:10:07.997" CommentCount="24" ContentLicense="CC BY-SA 3.0" />
  <row Id="7633" PostTypeId="1" AcceptedAnswerId="7634" CreationDate="2015-12-01T11:23:51.233" Score="14" ViewCount="748" Body="&lt;p&gt;When challenges require to read a string via STDIN/Console I have seen people interpreting that in mainly two ways. The first one was that you actually just have to type the string as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;This is an example string.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;the second way required you to also type some sort of delimiter (usually double &lt;code&gt;&quot;&lt;/code&gt; or single &lt;code&gt;'&lt;/code&gt; quotes)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;This is an example string.&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;'This is an example string.'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The question now is: Which one of those does actually count as &lt;em&gt;string input via STDIN&lt;/em&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am not sure, but I can imagine that there are languages where only one of those methods is possible for accepting strings as input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand it might be easier (in codegolf: shorter) in some languages to use one or the other way.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="8478" LastEditDate="2015-12-01T11:28:36.760" LastActivityDate="2015-12-01T14:19:30.930" Title="String input with or without &quot;&quot;?" Tags="|discussion|policy|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7634" PostTypeId="2" ParentId="7633" CreationDate="2015-12-01T11:59:44.663" Score="24" Body="&lt;h2&gt;Unless the challenge specifies, either is acceptable&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Just be sure to mention what form of input your program requires in your explanation.&lt;/p&gt;&#xA;" OwnerUserId="47050" LastActivityDate="2015-12-01T11:59:44.663" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7635" PostTypeId="2" ParentId="7633" CreationDate="2015-12-01T14:19:30.930" Score="8" Body="&lt;h2&gt;Without quotes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I have always assumed that quotes weren't allowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the ideal case, I think standard input should be the same for everyone and contain the challenge input as plainly as possible. This is how online judges work (e.g. codegolf.com), although I realise PPCG is a bit different.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Allowing stdin to be pre-formatted with quotes seems unnecessary, and will inevitably be abused. I'm not aware of any languages that read from stdin but strictly require quotes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's also worth pointing out that up to 541 &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=raw_input+%5Bcode-golf%5D+is%3Aanswer&quot;&gt;existing Python 2 answers&lt;/a&gt; could be shortened by using &lt;code&gt;input()&lt;/code&gt; with quotes around each line in place of &lt;code&gt;raw_input()&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="4020" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2015-12-01T14:19:30.930" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7637" PostTypeId="1" CreationDate="2015-12-01T19:51:35.090" Score="9" ViewCount="329" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/65290/make-a-polyglot-runnable-in-as-many-languages-as-possible&quot;&gt;This is the question in question (no pun intended)&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It was put on hold is unclear. I do not understand what is unclear. I asked a flagger why it was unclear.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;@Mego: 1) There is no objective winning condition, so it's unclear. 2)&#xA;  There is no requirement on what the program should do, so it's too&#xA;  broad. 3) Your edit should have been a comment.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;1) &quot;The more languages your program can run in, the higher your score&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2) It can do anything. That's the whole point.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;3) You cannot put multiple mentions in a single comment. It would be redundant to do the same comment three times.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;What does the program need to do? That's the unclear bit. If anything&#xA;  is allowed then 0 will probably trivially win, as someone just&#xA;  mentioned.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Meh. Its all for fun, and many very popular questions get those kinds of &quot;duh&quot; explanations. It will trivially win, but we can see all the solutions and find a non-trivial solution, and take a chuckle from that one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;EDIT 2: I have edited the question to close all loopholes. Please vote to reopen if you think I have done a good job of closing the loopholes. &lt;/p&gt;&#xA;" OwnerUserId="41088" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2015-12-05T22:53:53.590" Title="I don't understand why this is &quot;unclear&quot;" Tags="|discussion|specific-question|closed-questions|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7638" PostTypeId="2" ParentId="7637" CreationDate="2015-12-01T20:17:42.507" Score="7" Body="&lt;p&gt;I cannot answer for the ones who closed your question, but here my observations:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it can do &lt;em&gt;anything&lt;/em&gt; you will get a lot of trivial answers that are not interesting. For the winning criterion you should probably have been more specific along the lines of &lt;em&gt;&quot;you get one point for each language you program runs in, the answer with the highest score wins&quot;&lt;/em&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Other than that I think it has been a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4481/what-code-compiles-in-the-most-number-of-languages&quot;&gt;this challenge.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As you are new here, I recommend using the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;Sandbox&lt;/a&gt; and asking in the chat, and perhaps first participate in some more challenges in order to get an idea how it works here. The sandbox is obviously not only for new people, but for everyone who first wants to get feedback on a challenge/challenge idea, even if you are unsure whether it is a dupe or whether something is missing/unclear. It can really be a bit confusing at first as this site here does not really work like all the others Q&amp;amp;A stackexchange sites. But do not get discouraged!&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2015-12-04T11:17:49.537" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7639" PostTypeId="2" ParentId="7637" CreationDate="2015-12-01T20:22:12.470" Score="11" Body="&lt;h1&gt;It Can Do Anything!&lt;/h1&gt;&#xA;&lt;p&gt;While this is a great sentiment, it does leave the question without a meaningful objective. Every post will be one of its own, and it leaves loopholes open such as empty programs, which will be in &lt;em&gt;hundreds&lt;/em&gt; of languages. Also, all challenges on PPCG require meaningful, objective criteria. This, as it stands, has one rule - use multiple languages.&lt;/p&gt;&#xA;&lt;h3&gt;My suggestions:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Make a objective. &lt;em&gt;Don't make it just simple&lt;/em&gt;. That's annoying.&lt;/li&gt;&#xA;&lt;li&gt;Make a restriction on language relationships - BF vs. ShadyAsF***, for example, are exactly the same code. You need a way to restrict stuff like this.&lt;/li&gt;&#xA;&lt;li&gt;Use the sandbox.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Remember that people &lt;em&gt;are coding to win&lt;/em&gt;. You need to make it difficult, not easy, of a challenge to do.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Edit:&lt;/h3&gt;&#xA;&lt;p&gt;As @flawr pointed out, this is a duplicate. If you take my advice, it won't. Yay!&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-01T20:25:06.470" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="7641" PostTypeId="2" ParentId="2140" CreationDate="2015-12-01T22:32:16.403" Score="0" Body="&lt;h1&gt;Simple ASCII Representation of a Screw Head&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Inputs are a string and a number.&lt;/p&gt;&#xA;&lt;p&gt;If the string is &amp;quot;Slot&amp;quot;, the number will be 0, 60, 90, or 120. If the number is 0, output &lt;code&gt;--&lt;/code&gt;; if 60, output &lt;code&gt;/&lt;/code&gt;; if 90, output &lt;code&gt;|&lt;/code&gt;, if 120, output &lt;code&gt;\&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If the string is &amp;quot;Phillips&amp;quot;, the number will be 0, 45, 90, or 135. If it's 0 or 90, output &lt;code&gt;+&lt;/code&gt;; otherwise output &lt;code&gt;x&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If the string is &amp;quot;Torx&amp;quot;, the number will be 0, 60, or 120. Regardless of the value, output &lt;code&gt;*&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If the string is &amp;quot;Spanner&amp;quot;, the number will be 0 or 90. Output &lt;code&gt;..&lt;/code&gt; for 0 and &lt;code&gt;:&lt;/code&gt; for 90.&lt;/p&gt;&#xA;&lt;p&gt;Behavior for all other inputs is undefined.&lt;/p&gt;&#xA;&lt;p&gt;[Is this challenge too simple? If so, could more test cases help?]&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-11-16T18:10:41.540" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="7644" PostTypeId="2" ParentId="2140" CreationDate="2015-12-02T16:58:34.267" Score="0" Body="&lt;h1&gt;Nested Header List&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The goal of this challenge is to complete a list of consecutive nested header numbers when given a start and an end.  When given &lt;code&gt;1.1.1&lt;/code&gt; and &lt;code&gt;1.1.5&lt;/code&gt; you should generate &lt;code&gt;1.1.1, 1.1.2, 1.1.3, 1.1.4, 1.1.5&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Specific Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Your entry must take in a &lt;code&gt;start&lt;/code&gt;, &lt;code&gt;end&lt;/code&gt;, and multiple optional &lt;code&gt;range&lt;/code&gt; parameters.  Parameters can be taken form STDIN (or nearest equivalent) or a file.&lt;/li&gt;&#xA;&lt;li&gt;Your entry may assume valid input&lt;/li&gt;&#xA;&lt;li&gt;Input will be of the following format:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;start&lt;/code&gt; and &lt;code&gt;end&lt;/code&gt; will be strings of &lt;code&gt;.&lt;/code&gt; delimited integers of the same length&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;start&lt;/code&gt; and &lt;code&gt;end&lt;/code&gt; will have three segments; (1) set values, (2) iterator, (3) trailing values.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The iterator is the first value which differs between &lt;code&gt;start&lt;/code&gt; and &lt;code&gt;end&lt;/code&gt;.  &lt;/li&gt;&#xA;&lt;li&gt;The set values are the values before the iterator.  These values never change&lt;/li&gt;&#xA;&lt;li&gt;The trailing values are the values after the iterator.  These values iterate up as determined by the &lt;code&gt;range&lt;/code&gt; parameter(s). &lt;strong&gt;All trailing values will be &lt;code&gt;1&lt;/code&gt;&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;range&lt;/code&gt; will be a list of integers with a length corresponding to the number of trailing values.  When there are no trailing values, &lt;code&gt;range&lt;/code&gt; is not specified. The value of &lt;code&gt;range&lt;/code&gt; corresponding to each trailing value determines the &lt;em&gt;inclusive upper bound&lt;/em&gt; which that entry iterates to. &lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;Output will be to STDOUT (or closest alternative) and will show each value separated by at least one delimiter.  Delimiter can by any character or string of characters, but it must be consistent. Output must be sorted correctly&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;start = '1.1.5.1', end = '1.1.6.1', range = [5]&#xA;Output: 1.1.5.1, 1.1.5.2, 1.1.5.3, 1.1.5.4, 1.1.5.5, 1.1.6.1&#xA;                                                  ^&#xA;                                                  previous value is iterated&#xA;                                                  only when iterating value&#xA;                                                  limit set by range&#xA;&#xA;&#xA;start = '1.1.5.1', end = '1.1.7.1', range = [5]&#xA;Output: 1.1.5.1, 1.1.5.2, 1.1.5.3, 1.1.5.4, 1.1.5.5, 1.1.6.1,&#xA;        1.1.6.1, 1.1.6.2, 1.1.6.3, 1.1.6.4, 1.1.6.5, 1.1.7.1&#xA;&#xA;start = '1.5.1.1', end = '1.6.1.1', range = [5,2]&#xA;Output: 1.5.1.1, 1.5.1.2, 1.5.2.1, 1.5.2.2, 1.5.3.1, 1.5.3.2, &#xA;        1.5.4.1, 1.5.4.2, 1.5.5.1, 1.5.5.2, 1.6.1.1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is code golf so shortest code by bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Bonuses&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Allow trailing values to be values other than &lt;code&gt;1&lt;/code&gt; in &lt;code&gt;end&lt;/code&gt; parameter - &lt;strong&gt;12.5% off&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Handle incorrect number of values in &lt;code&gt;range&lt;/code&gt; parameter - &lt;strong&gt;12.5% off&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Handle &lt;code&gt;end&lt;/code&gt; less than &lt;code&gt;start&lt;/code&gt; by producing list in reverse - &lt;strong&gt;50% off&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="30170" LastActivityDate="2015-12-02T16:58:34.267" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7647" PostTypeId="2" ParentId="7623" CreationDate="2015-12-02T20:49:59.923" Score="-6" Body="&lt;p&gt;To answer the question posed in your subject:  Randomization is not hashing nor encryption.  Hashing and Encrypting are both linear transformations.  Randomization is not.&lt;/p&gt;&#xA;" OwnerUserId="46609" LastActivityDate="2015-12-02T20:49:59.923" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7650" PostTypeId="1" AcceptedAnswerId="7661" CreationDate="2015-12-03T07:20:07.057" Score="8" ViewCount="254" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/988/untestable-languages&quot;&gt;Somewhat related&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/65382/bernoulli-numbers&quot;&gt;Bernoulli Numbers&lt;/a&gt; challenge, I've been seeing a lot of invalid answers that fail to compute certain values to the required accuracy/precision, or that take substantially longer to run than the amount of time between the posting of the challenge and the answer (such as &lt;a href=&quot;https://codegolf.stackexchange.com/a/65388/45941&quot;&gt;this one&lt;/a&gt; - it's been churning for nearly 40 hours at just computing 30-36, and the answer was posted less than 24 hours after the question). Now, whether said requirements were good requirements is another discussion altogether - I'm mainly concerned with the fact that many answers have been posted that have obviously not been tested by the posters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The entire point of providing test cases is to allow users to test their prospective answers and verify that they produce the expected output &lt;em&gt;before&lt;/em&gt; posting them, rather than having the OP&lt;sup&gt;1&lt;/sup&gt; test them and inform the poster of their answer's invalidity. Needless to say, it is frustrating to go through the effort of compiling test cases and see them not being utilized.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would like to see a policy where users are required to test their code before submitting it as an answer, to reduce the effort required of the OP in testing all of the answers for validity. Is this a reasonable request? If so, how might we go about requiring proof of testing/validity?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt;I use &quot;OP&quot; to mean the user who posted the question/challenge&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2015-12-03T22:20:00.843" Title="On the subject of testing code" Tags="|discussion|policy|answers|testing|" AnswerCount="2" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="7651" PostTypeId="2" ParentId="7629" CreationDate="2015-12-03T07:47:42.427" Score="2" Body="&lt;h1&gt;&lt;em&gt;Mathematically&lt;/em&gt; they are the same...&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;...when they are an abbreviated form of another language, with a one-to-one mapping into and out of the original language.  I don't really see how one could argue that there's anything original there.  They have the same expressive power as the original, which in some cases is considerable.  This make them great for golf, of course.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When there's not a one-to-one mapping, but when the child languages exposes elements of the parent language, it's a direct descendant.  An extreme case of this is eval in perl or python.  If a child language allows those constructs, then programs written in the parent language to run in the offspring.  In this way, the descendent is a super-set of the original language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Furthermore, lineage is implied between languages that share the same runtime, such as Java, Scala and Jython.  I think most would argue that this is an implementation detail.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Creating a &lt;em&gt;new&lt;/em&gt; language is a really interesting, but not very productive endeavor.  I've created a few, and they're really useful only for teaching and learning.  Otherwise, pick an existing language with idioms that you like, and find or build the right libraries to make yourself productive.&lt;/p&gt;&#xA;" OwnerUserId="47660" LastActivityDate="2015-12-03T07:47:42.427" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7653" PostTypeId="1" AcceptedAnswerId="7654" CreationDate="2015-12-03T09:53:39.017" Score="11" ViewCount="219" Body="&lt;p&gt;I had recently asked &lt;a href=&quot;https://codegolf.stackexchange.com/questions/65526/bracket-balancing&quot;&gt;a question&lt;/a&gt;. It received 13 upvotes and 3 close votes as a duplicate of another question. It's not an exact duplicate, but both Qs are similar. That &lt;a href=&quot;https://codegolf.stackexchange.com/questions/21562/fun-with-matching-braces&quot;&gt;other question&lt;/a&gt; also has &lt;em&gt;exactly&lt;/em&gt; 13 upvotes and 3 close votes as duplicate of my question! (Data as per 9:50 am 3 Dec GMT)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Apart from the fact that this is a really amazing coincidence, I would request a moderator to decide which Q is a duplicate (I don't mind if it is mine), or otherwise explain to the close-voters as to why both Qs should remain open.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;P.S. I found 2 tags &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/duplicates&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;duplicates&amp;#39;&quot; rel=&quot;tag&quot;&gt;duplicates&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/exact-dupliactes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;exact-dupliactes&amp;#39;&quot; rel=&quot;tag&quot;&gt;exact-dupliactes&lt;/a&gt; while tagging this question. Aren't they duplicates of each other? ;)&lt;/p&gt;&#xA;" OwnerUserId="40929" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2015-12-03T13:00:28.743" Title="Are these questions about balanced parentheses really duplicates?" Tags="|discussion|specific-question|duplicates|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7654" PostTypeId="2" ParentId="7653" CreationDate="2015-12-03T10:00:37.107" Score="14" Body="&lt;p&gt;I don't think either one should be closed.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The other one includes a ton of bonuses. While I don't think they are a great idea, they significantly change the challenge. Also, without the bonuses, the other challenge is only about handling a single type of bracket.&lt;/li&gt;&#xA;&lt;li&gt;Your challenge adds priorities to the bracket types. It's not only about correct balancing but also about the correct nesting hierarchy, which I think makes a significant difference.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I do think yours is the better question, but that doesn't make the other one a duplicate of yours.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, the three close votes on your question actually have a completely different dupe target. All three close votes are with respect to &lt;a href=&quot;https://codegolf.stackexchange.com/q/11917/8478&quot;&gt;this challenge&lt;/a&gt;, which as I've said in a comment on your question I think is also completely different.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-12-03T10:00:37.107" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7655" PostTypeId="2" ParentId="7629" CreationDate="2015-12-03T10:06:36.043" Score="2" Body="&lt;p&gt;That's probably hard to tell in general. If you take two OOP languages with roughly the same set of features and just look at the plain language (not accounting for libraries) then the only thing that is different is the syntax. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can not run programs written in Java 8 with earlier Java versions (due to Java 8 having added several features not present in earlier versions). This in some way actually already makes a new language. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's really hard to draw a 'hard line' for when a language is new. There are many brainfuck derivatives that can run plain brainfuck programs. This also means that there are programs writen in brainfuck derivatives that can be run with the original brainfuck as well. Then there are 'brainfuck equivalents' such as Ook! which are basically the same language with different syntax. There's a trivial 1:1 mapping for Ook &amp;lt;-&gt; brainfuck. Yet, &#xA;you can't directly run Ook on brainfuck or brainfuck on Ook. But you can write a compiler/transpiler that translates between the two languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As soon as you change the syntax of a language, add or remove a feature you end up with a new language that is incompatible without translation. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;All turing-complete languages are alike in terms of &quot;power&quot;. Thus you can compile any turing-complete language to any other turing-complete language. &#xA;However, I use the term &quot;equivalent&quot; if there is an easy translation from &lt;em&gt;A&lt;/em&gt; to &lt;em&gt;B&lt;/em&gt; and from &lt;em&gt;B&lt;/em&gt; back to &lt;em&gt;A&lt;/em&gt; so that you get the exact same program back. You can compile C to Assembler, and you can compile Assembler to C but getting the same program back is rather non-trivial so although C and Assembler can do the same things they are not equivalent. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also consider two languages &lt;em&gt;F&lt;/em&gt; and &lt;em&gt;G&lt;/em&gt; with one valid operator &lt;code&gt;+&lt;/code&gt;. &lt;code&gt;+&lt;/code&gt; in &lt;em&gt;F&lt;/em&gt; prints &quot;Hi&quot;, in &lt;em&gt;G&lt;/em&gt; it prints &quot;Bye&quot;. Now this means that&#xA;all programs in either language are valid programs in both languages but that doesn't mean they are the same languages. Using the definition &quot;if all programs can be run in the language&quot; is thus fundamentally flawed since this doesn't account for whether the programs actually do the same things. &lt;/p&gt;&#xA;" OwnerUserId="5429" LastEditorUserId="5429" LastEditDate="2015-12-03T13:01:09.993" LastActivityDate="2015-12-03T13:01:09.993" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7661" PostTypeId="2" ParentId="7650" CreationDate="2015-12-03T20:41:48.493" Score="13" Body="&lt;h2&gt;Entirely untested submissions should &lt;em&gt;not&lt;/em&gt; be posted.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Even if you're sure the code &lt;em&gt;would&lt;/em&gt; work if it were tested, it should not be posted unless it has been tested. If it's obvious that an answer has not been tested, be it due to obvious syntax errors or other blaring inaccuracies, it should be downvoted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, there's no way to reliably ensure that a user has sufficiently tested their submission prior to posting. I believe it should generally be taken on good faith that an answer is correct to the best of the user's knowledge, &lt;em&gt;if&lt;/em&gt; they have provided at least some documentation.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What constitutes &quot;documentation&quot; of an answer?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In my opinion, it's one or more of the following:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;An ungolfed, commented, easier to follow &lt;em&gt;but functionally equivalent&lt;/em&gt; version of the scored code&lt;/li&gt;&#xA;&lt;li&gt;An explanation of the code as written and the algorithm it implements&lt;/li&gt;&#xA;&lt;li&gt;A link to an online interpreter, preferrably with a test suite&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;If an answer has &lt;em&gt;none&lt;/em&gt; of those, I don't upvote.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Not all languages have free online interpreters. That's fine as long as a user can explain what the code does and it's obvious how you can test it yourself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my opinion, pasting example runs of the code in an answer with its output is helpful but isn't sufficient to verify correctness.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;When in doubt, test it yourself.&lt;/h2&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2015-12-03T20:41:48.493" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7663" PostTypeId="2" ParentId="7650" CreationDate="2015-12-03T22:20:00.843" Score="12" Body="&lt;p&gt;I am strongly against making a general policy that all answers should be run to completion before they can be considered tested and permitted to be posted. I can think of a few answers on this site which won't run to completion before the Earth is swallowed up by the Sun, and I don't think that's a bad thing. E.g. some of the answers to &lt;a href=&quot;https://codegolf.stackexchange.com/q/1230/194&quot;&gt;Shamir's secret sharing&lt;/a&gt; were only tested with smaller primes because they use brute force to find modular inverses; &lt;a href=&quot;https://codegolf.stackexchange.com/q/6430/194&quot;&gt;Shortest terminating program whose output size exceeds Graham's number&lt;/a&gt; obviously doesn't have &lt;em&gt;any&lt;/em&gt; fully testable answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, there's been a trend over the past two or so years* for questions to specify that answers must complete for inputs up to a certain size within a time limit which permits testing. That's not a bad thing either: golfing without any constraints other than correctness and golfing with performance constraints as well are similar but different and can both be fun.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some questions include stack snippets which verify answers. Perhaps we should try to encourage those for questions like the Bernoulli numbers one where checking that the output is within tolerance is best done by computer rather than by eye.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;* Personal impression - I haven't calculated any statistics to support this figure.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2015-12-03T22:20:00.843" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7664" PostTypeId="2" ParentId="2140" CreationDate="2015-12-03T22:41:15.687" Score="0" Body="&lt;h1&gt;Count the Connect Four Positions&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Connect Four is a two-player game on a rectangular board. The board is &lt;code&gt;m&lt;/code&gt; spaces wide and &lt;code&gt;n&lt;/code&gt; spaces tall, and players alternate placing pieces in columns. A placed piece always fills the lowest empty space in a column, and a player may not move in a full column. In the standard game, m=7 and n=6.&lt;/p&gt;&#xA;&lt;p&gt;The game ends when one player completes a row of four pieces vertically, horizontally, or diagonally, or all &lt;code&gt;m&lt;/code&gt; columns are full. The edges of the board do not wrap.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a program or function to determine the number of distinct, legal &lt;code&gt;m&lt;/code&gt; by &lt;code&gt;n&lt;/code&gt; Connect Four boards after &lt;code&gt;p&lt;/code&gt; plies. (A ply is one move by one player.) A legal position is one reachable from the empty board through a sequence of moves in which no player had already won. (A position in which one player has just won is legal.)&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;You may assume that &lt;code&gt;0&amp;lt;=p&amp;lt;=m*n&lt;/code&gt;, &lt;code&gt;m&amp;lt;=8&lt;/code&gt; and &lt;code&gt;n&amp;lt;=8&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;As usual, hardcoding is not allowed.&lt;/p&gt;&#xA;&lt;p&gt;Your code should be at most 1024 bytes in length, and use at most 16 GB of memory.&lt;/p&gt;&#xA;&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.stackexchange.com/q/63603/39328&quot;&gt;Determine winner of Connect 4&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;[need to add; include OEIS]&lt;/p&gt;&#xA;&lt;p&gt;Relevant links:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://math.stackexchange.com/questions/301106/how-many-different-game-situations-has-connect-four%5D&quot;&gt;This Math SE question&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://tromp.github.io/c4/c4.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;This offsite page&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://oeis.org/A212693&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS sequence for n=7, m=6&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-04T07:34:00.637" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7665" PostTypeId="1" CreationDate="2015-12-04T11:49:26.897" Score="5" ViewCount="190" Body="&lt;p&gt;This question is inspired by alephalpha's &lt;a href=&quot;https://codegolf.stackexchange.com/a/65722/31516&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/65641/the-versatile-integer-printer&quot;&gt;my question&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the question text it is written:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Different major versions of the same language are considered unique. So, your code can be executable in Python 2 and Python 3, however Python 2.5 and Python 2.7 are not considered unique.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I believe that Python 2 and Python 3 are recognized as being almost two different languages. For instance, the results of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/61955/which-language-is-shortest&quot;&gt;this challenge&lt;/a&gt; shows that there are 46 and 34 answers in Python 2 and Python 3 respectively. There are probably a lot of answers where the language is only listed as Python, but there are relatively few compared to those were the version number is included. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In comparison, there is only one Mathematica, and I've never (or rarely) seen anyone specify which Mathematica version they are using. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although there are functions that can only be used in some versions, I'm not sure they should qualify as different languages. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;What is the community's view on this? Both in general, and with regards to the Versatile Integer Printer challenge.&lt;/p&gt;&#xA;" OwnerUserId="31516" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-12-04T11:49:26.897" Title="Are Mathematica 1, 2, ... &quot;major versions&quot; of the same language?" Tags="|discussion|" AnswerCount="0" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7666" PostTypeId="2" ParentId="5139" CreationDate="2015-12-04T18:04:28.760" Score="6" Body="&lt;h2&gt;Bug&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Although the documentation says that strikeout is supported, it only supports &lt;code&gt;&amp;lt;s&amp;gt;&lt;/code&gt; and not &lt;code&gt;&amp;lt;strike&amp;gt;&lt;/code&gt; or &lt;code&gt;&amp;lt;del&amp;gt;&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2015-12-04T18:04:28.760" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7667" PostTypeId="2" ParentId="2140" CreationDate="2015-12-04T19:23:43.160" Score="1" Body="&lt;h1&gt;Gilbert-Shannon-Reeds Shuffle&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Background&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Gilbert%E2%80%93Shannon%E2%80%93Reeds_model&quot; rel=&quot;nofollow noreferrer&quot;&gt;Gilbert-Shannon-Reeds (GSR) shuffle&lt;/a&gt; is a simple model of riffle shuffling close to how real humans shuffle a deck of cards. The well-known rule of thumb to riffle-shuffle a deck of 52 cards seven times for sufficient randomness is based on the GSR shuffle.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Algorithm&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Cut the deck at a position &lt;code&gt;k&lt;/code&gt;, &lt;code&gt;0≤k≤n&lt;/code&gt;. If there are &lt;code&gt;n&lt;/code&gt; cards, the probability that any given &lt;code&gt;k&lt;/code&gt; is chosen is &lt;code&gt;(n nCr k)/(2^n)&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Put the first &lt;code&gt;k&lt;/code&gt; cards into one pile, and the other &lt;code&gt;n-k&lt;/code&gt; in a second pile.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Until all the cards are gone:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Where the sizes of the two piles are &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt;, choose the first pile with probability &lt;code&gt;x/(x+y)&lt;/code&gt; and the second pile with probability &lt;code&gt;y/(x+y)&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Move the first card in that pile to the new array.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input: An array of positive integers, of length n&amp;lt;1000.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: The array shuffled once.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You may use any algorithm that gives equivalent results to the GSR shuffle.&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="39328" LastEditDate="2015-12-06T03:22:14.897" LastActivityDate="2015-12-06T03:22:14.897" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7670" PostTypeId="2" ParentId="2140" CreationDate="2015-12-05T01:33:43.117" Score="1" Body="&lt;p&gt;I'm thinking I want to make a KOTH challenge that has bots play the classic game of &lt;a href=&quot;http://en.wikipedia.org/wiki/Mafia_(party_game)&quot; rel=&quot;nofollow&quot;&gt;Mafia&lt;/a&gt;. Bots will be placed in groups of seven, roles randomly assigned, and they play the game! &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Explanation of Game Mechanics&lt;/strong&gt;&#xA;The game proceeds in multiple turns, each turn consisting of Night followed by Day. At night, each person completes his role as will be described below. During the daytime, players (in real life) discuss the events of the night (communicated by God, a separate person who does not participate in the game besides prompting people to their roles.) Just before night, the players have the option of voting to lynch another player, the objective being to lynch a mafia member to help the town win. Choosing not to lynch is always an option if you think it is too risky to lynch someone who might be innocent. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In real life, God would tell everyone to sleep, then ask mafia to wake up and silently agree on who to kill, tell them to sleep, and continue with the other roles in a similar manner. Town wins if all the mafia are dead; mafia wins if they at least outnumber the town. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are four roles in this game, but I have played many games with more than seven people with more ridiculous roles that are very fun to play. Each player bot is assigned an ID number indicating his role. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Mafia - There will be 2 mafia in this game. The two mafia will come to a consensus on who to kill. If one is dead the other decides on his own. The two mafia can not choose one of them to be killed. Mafia has a role of either 1 or 2, which are identical in function. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Inspector - There will be 1 in this game. At night he visits a person, and receives a report on that person's innocence. Both Mafia members will appear as guilty and the rest will appear as innocent. He can not inspect himself nor dead people. His number is 3. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Doctor - There will be 1 in this game. At night he visits a person, and that person will not die that night. Doctor can not save himself nor dead people. His number is 4. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Townsperson - Does nothing at night. Numbers 5, 6, 7. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The Challenge&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will write a Java player class who will have (at least) three important methods: &lt;code&gt;night&lt;/code&gt;, &lt;code&gt;claim&lt;/code&gt;, and &lt;code&gt;vote&lt;/code&gt;. All of these three methods will return the player to 'act' on (of course, depending on your role), given an ArrayList of information that the other players have claimed in public. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am not very clear on how to run a KOTH challenge and what github is supposed to do and how to use it so it would be very helpful if someone could point me in the right direction. As of now I'm still working out the exact details of a Java class to run the game, as well as making a generic Player class that the answers will have to extend and use methods from. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Right now, I have a generic Player class that each answer will extend, and each Player object has two Identity objects: a public, claimed Identity and a private Identity. The private Identity will hold the players actual role (kept secret, of course), as well as a doctor arraylist of Integers and a cop arraylist of Strings. If the player happens to be a cop, the controller program will add an entry to the private cop arraylist which will serve as his way of receiving a verdict. I'll make a method called verdict() which returns the last element to make the programming easier. An example string is &quot;4G&quot; which means that player 4 is guilty. This player 4 may be mafia 1; player numbers are just given for discussion purposes and to identify a player based on his claims and is independent on role.  Doctor is the same except integers because you only need to store who was saved that night. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The public, claimed Identity works in much the same way except that the controller will never modify it, only the player can. An identity object contains a role (an integer representing the role number), an ArrayList of strings called 'visits' (to be used if you are a cop or doctor, to store a list of people visited and any outcomes), and an ArrayList of suspicions to indicate that your bot suspects or is guessing that another player has a given role. It will also have a lynch value which can be changed during the day, and this is where a player decides on who to lynch (if at all). Finally, it will have a boolean for if the player is dead or alive. You had better not mess with this. The idea of having two is that you can claim whatever you want; so a Mafia can claim to be Cop or a townsperson and the doctor can claim to be a cop.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Initially your public claim ID is 0, indicating that you have not claimed. The program will give you your private ID, which will contain your actual role and and is not necessarily meant to be made public just yet. The program controller will only modify your private ID object, and only then if your are Doctor or Cop. It will append to the visits ArrayList in the private identity object the result of the visit; the doctor will have access to everyone he has visited, and the cop will have access to everyone he has inspected and their alignment. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The controller, each night, will ask Mafia 1 for his choice then Mafia 2 for his choice, then repeat, say, 25 times. If at any point the two mafia agree, then it stops because the Mafia have just made their choice. The number of times attempted thus far will be given to the Mafia's night method, so the code will look like &lt;code&gt;M1.night(&amp;lt;other players info&amp;gt;, 1)&lt;/code&gt; then &lt;code&gt;M1.night(&amp;lt;other players info&amp;gt;, 2)&lt;/code&gt;, etc.  is that arraylist of public identities previously mentioned. If no consensus, no kill. Similarly prompt cop and doctor once for their choice on who to visit. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the day time, every player's lynch value will be 0, indicating that they do not vote yet; each player will be given 25 chances to act. An action can consist of adding to the list of suspected values, claiming a role, changing a role, changing the list of suspected values, voting to lynch someone, changing a lynch vote, etc., or more. Some actions are smarter than others, and your goal is to have a good action strategy. Upon each call of a players act() method, he will be given an arraylist of everyone else's public identity objects, as well as how many times before he has been prompted. This gives him access to what other players claim to be, who other players claim to have visited and outcomes, who they suspect as who, and who others are voting to lynch. If at any point there is a majority (more than half but not exactly half) of people wanting to lynch a person (No lynch, indicated by the value -1, counts too), then day time ends, that person is lynched and his role revealed. If majority voted -1 (no lynch) then nobody dies and day time ends. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Again, please guide me on how I should design my classes, controller, and what files I should put up and how people are going to test their bot at home. I would be glad to show you what I have so far, which includes a controller program and a dummy player class. &lt;/p&gt;&#xA;" OwnerUserId="40857" LastActivityDate="2015-12-05T01:33:43.117" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7671" PostTypeId="2" ParentId="2140" CreationDate="2015-12-05T09:43:12.947" Score="0" Body="&lt;h1&gt;Compile &lt;em&gt;from&lt;/em&gt; Brainfuck&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The professors at Brainfuck University realized their jobs are horrible, because all they do is discuss quantum mechanics using Brainfuck, so they decided to take their programs and compile them to a better language. Because of the randomness of quantum particles, their program needs to be small so it has a smaller chance of being disrupted in the Higgs Field.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to get a Brainfuck program from any input and output that program transcompiled into another language. Here is an example:&lt;/p&gt;&#xA;&lt;pre&gt;++--&amp;gt&amp;gt&amp;lt&amp;lt&lt;/pre&gt;&#xA;&lt;p&gt;Compiles to the C program:&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;#include &amp;lt;stdio.h&amp;gt;&#xA;#include &amp;lt;stdlib.h&amp;gt;&#xA;&#xA;int main(int argc, char **argv) {&#xA;    unsigned char *cell = calloc(30000, 1);&#xA;    unsigned char *cells = cell;&#xA;    if (!cell) {&#xA;        fprintf(stderr, &quot;Error allocating memory.\n&quot;);&#xA;        return 1;&#xA;    }&#xA;        //actual program&#xA;        ++*cell;&#xA;        ++*cell;&#xA;        --*cell;&#xA;        --*cell;&#xA;        --cell;&#xA;        --cell;&#xA;        ++cell;&#xA;        ++cell;&#xA;&#xA;        free(cells);&#xA;        return 0;&#xA;}&#xA;&lt;/pre&gt;&#xA;&lt;h2&gt;Score&lt;/h2&gt;&#xA;&lt;p&gt;Your score is the size of your program added to the size of the output.&lt;/p&gt;&#xA;&lt;h3&gt;Bonuses&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If you support &lt;a href=&quot;http://esolangs.org/wiki/Brainfuck-ng&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brainfuck-ng&lt;/a&gt;, subtract &lt;strong&gt;30&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41711" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-05T09:43:12.947" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7674" PostTypeId="2" ParentId="2140" CreationDate="2015-12-05T19:09:48.430" Score="1" Body="&lt;h1&gt;Generate a graphical representation of a Stern–Brocot tree of depth n&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/63lLq.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/63lLq.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I am aware of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/15934/find-a-fractions-position-in-the-stern-brocot-tree&quot;&gt;this challenge&lt;/a&gt;. Would this be considered as a dupe?&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-05T19:09:48.430" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7675" PostTypeId="2" ParentId="2140" CreationDate="2015-12-06T19:32:55.490" Score="6" Body="&lt;h1&gt;What shape is that polygon?&lt;/h1&gt;&#xA;&lt;p&gt;Given an ASCII figure made of &lt;code&gt;/&lt;/code&gt;, &lt;code&gt;\&lt;/code&gt;, &lt;code&gt;|&lt;/code&gt;, and &lt;code&gt;_&lt;/code&gt;, write a program that determines (1) if the figure is a closed, non-self-intersecting polygon (meaning it has at least three sides that connect to form a loop), and if so, (2) how many sides the polygon has and (3) if the polygon is convex (all internal angles are less than 180˚) or concave (not convex, note that no polygons have 180˚ angles).&lt;/p&gt;&#xA;&lt;p&gt;The multiline input is the ASCII figure. It can be assumed that the input only contains the four characters listed above.&lt;/p&gt;&#xA;&lt;p&gt;If the figure is not closed or self-intersects (or has more than 2 sides connecting at the same point), the program should print &lt;code&gt;Not a polygon&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The number of sides the polygon has is determined by the following chart.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Sides   Name&#xA;3       Triangle&#xA;4       Quadrilateral&#xA;5       Pentagon&#xA;6       Hexagon&#xA;7       Heptagon&#xA;8       Octagon&#xA;9       Nonagon&#xA;10      Decagon&#xA;11      Undecagon&#xA;12      Dodecagon&#xA;&amp;gt;12     n-gon (where n is the number of sides)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The output should be in the format &lt;code&gt;&amp;lt;concavity&amp;gt; &amp;lt;polygon name&amp;gt;&lt;/code&gt; if (1) is satisfied.&lt;/p&gt;&#xA;&lt;p&gt;Test cases&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  __&#xA; /  \__&#xA;/_____/&#xA;&#xA;==&amp;gt; Concave hexagon&#xA;&#xA;&#xA;/\/\/\/\/\/\/\&#xA;|____________/&#xA;&#xA;==&amp;gt; Concave 17-gon&#xA;&#xA;&#xA; _____/&#xA;|_____|&#xA;&#xA;==&amp;gt; Not a polygon&#xA;&#xA;&#xA; _&#xA;/ \&#xA;| |&#xA;\_/&#xA;&#xA;==&amp;gt; Convex octagon&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;I need a little assistance on getting stricter definitions of points intersecting, so help would be appreciated. Thanks!&lt;/p&gt;&#xA;" OwnerUserId="43444" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-07T12:58:44.773" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7677" PostTypeId="2" ParentId="2140" CreationDate="2015-12-07T02:07:49.207" Score="1" Body="&lt;h1&gt;Play Chess with a One-Move Lookahead&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&amp;quot;I see only one move ahead, but it is always the correct one.&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;– Jose R. Capablanca, World Chess Champion 1921-1927&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is a chess tournament with a twist: your chess engine is only allowed to look 1 move (2 ply) ahead.  In order to succeed, you must create the best board evaluation algorithm.&lt;/p&gt;&#xA;&lt;h2&gt;Additional Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;En passant, castling, and under-promotion &lt;em&gt;will be allowed&lt;/em&gt;.  Of course, it is up to you if you want to bother adding those capabilities to your AI.  I personally find these to be some of the best rules of chess.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I am considering making a &amp;quot;template&amp;quot; bot which implements alpha-beta pruning, and requiring users to just fill in the method for board evaluation.  Otherwise, there may be ways to stretch what it means to &amp;quot;look ahead.&amp;quot;  The benefit for users would be that they don't have to write their own getLegalMoves() method.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-07T02:07:49.207" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7683" PostTypeId="1" CreationDate="2015-12-07T20:41:22.167" Score="182" ViewCount="3259" Body="&lt;p&gt;It has come to my attention that the amount of reputation awarded for questions can be adjusted on a per-site basis. For example, &lt;a href=&quot;http://stackapps.com&quot;&gt;Stack Apps&lt;/a&gt; awards +10 reputation for question upvotes. As you probably already know, we currently award +5 reputation, as do most Stack Exchange sites, including Stack Overflow.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The lower reputation amount makes sense in the context of a Q&amp;amp;A format since it takes less effort to ask a question than it does to answer it. However, we're a little different in that quality challenges can be far more difficult to create than quality answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Thus I propose that we raise the amount of reputation we award on questions from +5 to +10.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This was &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/120/20469&quot;&gt;proposed 4 years ago&lt;/a&gt; and was deemed to be a good idea but no action was taken. It was also &lt;a href=&quot;https://meta.stackexchange.com/q/242712/287795&quot;&gt;addressed on Meta.SE&lt;/a&gt; and was met with hesitation there. I think it would be worth a discussion now on our site, particularly since it has become apparent that the modification is possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that the change would apply retroactively; reputation would be recalculated for all users who have ever posted a question on this site. That is, in the system, it will be like the user earned the reputation the day the upvote was given, even if it was in the past. The 200 reputation per day cap would still apply on those days though. For some users, this may result in &lt;em&gt;many thousands&lt;/em&gt; of reputation points gained.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thoughts?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; Due to near unanimous support for this proposal, I've converted this from a community discussion to a formal feature request that will hopefully be addressed by Stack Exchange.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="31716" LastEditDate="2019-11-14T17:20:22.023" LastActivityDate="2019-11-14T17:20:22.023" Title="Increase reputation awarded for questions" Tags="|feature-request|status-completed|challenges|reputation|incentives|" AnswerCount="11" CommentCount="30" ContentLicense="CC BY-SA 3.0" />
  <row Id="7684" PostTypeId="2" ParentId="7683" CreationDate="2015-12-07T21:06:43.747" Score="139" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;I say that we should go ahead with this change.&lt;/p&gt;&#xA;&lt;p&gt;Apart from &lt;s&gt;simply&lt;/s&gt; correctly appreciating the massive amount of effort put into writing good challenges, this would also be a very nice added incentive to start writing questions, especially for existing users who now want to earn more rep. :)&lt;/p&gt;&#xA;" OwnerUserId="31414" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-12T00:38:24.910" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7686" PostTypeId="2" ParentId="7224" CreationDate="2015-12-08T04:05:31.520" Score="21" Body="&lt;h2&gt;Yes. But not with catalog questions.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The idea of catalogs was a noble one, but having seen it play out in practice, I think it's done more harm than good.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;This is a catalog question&quot; was used to defend poor questions, ones that I'd expect to be downvoted for being simply a race to post in most languages, or closed for being basically covered by existing questions. Instead, because of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7150/20260&quot;&gt;flawed way HNQ promotes questions for being easy&lt;/a&gt;, they got masses of upvotes and attention and answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moreover, the label &quot;catalog&quot; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7598/20260&quot;&gt;has confused people&lt;/a&gt; into thinking that other questions don't care about answers in many languages, only the single shortest solution over all languages. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;These problems aren't fundamental to the idea of catalogs, just how people have (mis)used them. I think they could be useful for questions specifically tailored to be a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7608/20260&quot;&gt;repository of standard building blocks&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yet, given the pitfalls of catalogs, I think it's better we strive for their goals in challenges in general, without a label. &lt;em&gt;Every challenge&lt;/em&gt; should encourage participation in a variety of languages, be complete and well-written as a definitive spec for that challenge, and attract well-golfed answers that could be used as a reference for golfing other challenges if relevant. (Language-specific challenges and the like are exceptions.)  None of these require a new category of challenge, just care to the challenges we're already making.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2015-12-08T04:05:31.520" CommentCount="1" CommunityOwnedDate="2015-12-08T04:05:31.520" ContentLicense="CC BY-SA 3.0" />
  <row Id="7687" PostTypeId="2" ParentId="7683" CreationDate="2015-12-08T06:53:24.583" Score="-7" Body="&lt;h1&gt;No / Maybe&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'm guessing that this might be an unpopular opinion, but I thought I'd bring it up.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As much as I agree that a massive effort is put into writing good challenges and they should be rewarded more, this would also go the other way. The problem is generally stated &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7150/40695&quot;&gt;here&lt;/a&gt;, trivial questions generally get flooded with up-votes especially with help from HNQ.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd say the best solution is instead of changing the reputation awarded for questions, is to switch the focus to using question votes more effectively. By this I mean, upvoting what you feel is a high-quality, good challenge, rather than a challenge simply because it's easy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My point is, as much as I do agree high-quality challenges should be rewarded more, this would also affect trivial challenges &lt;em&gt;significantly&lt;/em&gt; also, with a single upvote requiring &lt;em&gt;5&lt;/em&gt; downvotes to counter. So my proposal is:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;No, unless downvotes are worth &lt;em&gt;much&lt;/em&gt; more&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2015-12-24T06:50:30.617" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="7688" PostTypeId="1" CreationDate="2015-12-08T11:36:32.720" Score="6" ViewCount="243" Body="&lt;p&gt;If a challenge gives a set of languages to choose from, how freely can I  choose a version?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Concrete example: I found a solution for a challenge in JavaScript. The challenge just lists a number of languages that are valid for that challenge, and JavaScript is one of them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But my solution is kind of limited.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is only working on JavaScript used in Mozilla Firefox and even they dropped support of that feature for version 12 and later. So on the one hand I agree it is nothing one really would use in any productive code. But on the other hand, technically seen, that's what JavaScript was about that time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So would it satisfy the requirement as being JavaScript? &#xA;And if not, where is the border between valid and too restricted?&lt;/p&gt;&#xA;" OwnerUserId="31033" LastEditorUserId="14215" LastEditDate="2015-12-08T15:30:57.627" LastActivityDate="2015-12-16T03:47:36.417" Title="How strict is our list of admissible languages?" Tags="|discussion|policy|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7689" PostTypeId="1" CreationDate="2015-12-08T13:34:23.483" Score="3" ViewCount="90" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/66029/31033&quot;&gt;https://codegolf.stackexchange.com/a/66029/31033&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this a bug or am I using a feature I'm not aware of?&lt;/p&gt;&#xA;" OwnerUserId="31033" LastEditorUserId="68942" LastEditDate="2021-06-05T23:19:31.653" LastActivityDate="2021-06-05T23:19:31.653" Title="Is this a bug in codeblock indention?" Tags="|bug|status-bydesign|formatting|markdown|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7690" PostTypeId="2" ParentId="7689" CreationDate="2015-12-08T13:37:01.340" Score="8" Body="&lt;p&gt;Markdown thinks you're still inside the bullet list, so it thinks you've just started another paragraph inside the list.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;To add a code block inside the bullet list, you'd need 8 spaces of indentation instead of the usual four.&lt;/li&gt;&#xA;&lt;li&gt;But I think you just wanted to have a code block after the bullet list, so you need something to indicate that the bullet list has ended. The simplest solution is to add an HTML comment, i.e. simply  &lt;code&gt;&amp;lt;!-- --&amp;gt;&lt;/code&gt;, without indentation after the bullet list and before the code block. (I've made this edit for you so you can see what it looks like).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-12-08T13:37:01.340" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7691" PostTypeId="2" ParentId="7683" CreationDate="2015-12-08T22:24:36.357" Score="59" Body="&lt;h1&gt;Yes, but only if downvotes scale to -4&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Peter Taylor brought up a very good point in a comment: There are many questions which would change from being worth negative rep to positive rep should this change be implemented without scaling downvotes accordingly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Currently, downvotes on both questions and answers are worth -2 reputation. I propose that &lt;strong&gt;downvotes on questions scale to -4 rep&lt;/strong&gt;, with answer downvotes remaining unchanged.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a simple doubling of loss to match the doubling of gain. While it may seem harsh, it has the benefit of not awarding undeserved reputation if the question reputation value were to increase. It also makes it so it doesn't require 5 downvotes to counter a single upvote in terms of reputation, which would be the case if the -2 was unchanged.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="20469" LastEditDate="2015-12-08T23:08:34.937" LastActivityDate="2015-12-08T23:08:34.937" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="7692" PostTypeId="2" ParentId="2140" CreationDate="2015-12-08T22:32:17.817" Score="4" Body="&lt;h2&gt;Rotate / Flip a Unicode Box Drawing&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a Unicode box drawing, followed by a series of rotate and/or flip commands, output the result of those operations on the drawing.  For clarification, a box drawing can be made from the following characters:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;─ │ ┌ ┐ └ ┘ ├ ┤ ┬ ┴ ┼&#xA;═ ║ ╔ ╗ ╚ ╝ ╠ ╣ ╦ ╩ ╬&#xA;    ╒ ╕ ╘ ╛ ╞ ╡ ╤ ╧ ╪&#xA;    ╓ ╖ ╙ ╜ ╟ ╢ ╥ ╨ ╫&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The rotate and flip commands are also presented using Unicode symbols:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;↔  Flip the drawing horizontally&#xA;↕  Flip the drawing vertically&#xA;↷ Rotate the drawing 90° clockwise&#xA;↶ Rotate the drawing 90° counter-clockwise&#xA;↯  Convert all single lines to double and vice versa (Optional - 10% bonus)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;All other characters should remain unchanged, but moved to fit where they would be in the modified drawing.  For example, if given the inputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input   Output          Input   Output&#xA; ┌┴╖     ╓┴┐             ┌┴╖     ╔═╕&#xA; │A║     ║A│             │E║     ╣E├&#xA; ╘╦╝     ╚╦╛             ╘╦╝     ╙─┘&#xA; ↔                       ↔↷&#xA;&#xA; ┌┴╖     ╒╩╗             ┌┴╖     ┌─╖&#xA; │B║     │B║             │F║     ┤F╠&#xA; ╘╦╝     └┬╜             ╘╦╝     ╘═╝&#xA; ↕                       ↷↔&#xA;&#xA; ┌┴╖     ╓─┐             ┌┴╖     ╔╩╕&#xA; │C║     ╣C├             │G║     ║G│&#xA; ╘╦╝     ╚═╛             ╘╦╝     ╙┬┘&#xA; ↷                      ↶↶&#xA;&#xA; ┌┴╖     ╒═╗             ┌┴╖     ╔╩╕&#xA; │D║     ┤D╠             │H║     ║H│&#xA; ╘╦╝     └─╜             ╘╦╝     ╙┬┘&#xA; ↶                      ↔↕&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The drawing may be of any size (let's say anywhere from 1×1 to 50×50), and not necessarily square.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The flip and rotate commands will always occur after any drawing to be flipped, and by themselves on one single line.  They should be executed from left to right.  (Note that order matters - the E and F examples use the same two commands but in reverse order, and produce different results.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There may be an arbitrary number of flips and rotates, but you'll note that there are only 8 possible end-states for the final drawing.  The G and H examples show two different sets of commands that produce the same result (other than the letter in the middle).  It is possible that a series of commands will result in simply returning to the original drawing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input may be supplied via command line, user input, file I/O, or any other means you see fit.  (Though it should obviously support multiple lines of input.  You may use &lt;code&gt;\n&lt;/code&gt; to represent line breaks if your input mode only supports a single line.)  Likewise, output may be to the screen or a file at your discretion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, so shortest code wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some more complicated examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input    Output        Input    Output&#xA;          ┌─┐                    ┌─┐&#xA;          │A│                    │B│&#xA;┌─╥─┐     ╞═╡          ┌─╥─┐     ╞═╡&#xA;│A║B│     │B│          │A║B│     │A│&#xA;└─╨─┘     └─┘          └─╨─┘     └─┘&#xA;↷                     ↶&#xA;&#xA;   Input           Output&#xA;┌─┐╔═╗╒══╓──    ──╖══╕╔═╗┌─┐&#xA;├─┘╠═╝│  ║ ╖    ╓ ║  │╚═╣└─┤&#xA;│  ║  ╘══╙─╜    ╙─╜══╛  ║  │&#xA;↔&#xA;&#xA;┌─┐╔═╗╒══╓──    ╔═╗┌─┐╓──╒══&#xA;├─┘╠═╝│  ║ ╖    ╠═╝├─┘║  │ ╕&#xA;│  ║  ╘══╙─╜    ║  │  ╙──╘═╛&#xA;↯&#xA;&#xA;┌─┐╔═╗╒══╓──    ┌─┐╔═╗╒══╓──&#xA;├─┘╠═╝│  ║ ╖    ├─┘╠═╝│  ║ ╖&#xA;│  ║  ╘══╙─╜    │  ║  ╘══╙─╜&#xA;↔↯↷↷↕↶↯↶↕↔&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="42471" LastEditorUserId="42471" LastEditDate="2015-12-09T19:26:36.653" LastActivityDate="2015-12-09T19:26:36.653" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7693" PostTypeId="2" ParentId="7683" CreationDate="2015-12-09T16:26:27.943" Score="62" Body="&lt;h1&gt;Absolutely&lt;/h1&gt;&#xA;&lt;p&gt;PPCG is different from most other sites on Stack Exchange in that it is &lt;em&gt;not&lt;/em&gt; a Q+A site; in fact, many questions that ask for help (other than &amp;quot;how to golf in ____&amp;quot;) are marked as being not on topic. The thing that makes PPCG unique is that the interaction between question asker and question answerer is important. PPCG is not a site where people ask questions looking for help (mostly), but a site where the question askers want to challenge the answerers to solve their problem.&lt;/p&gt;&#xA;&lt;p&gt;When I write questions, I don't write them because I want help solving them. I ask them because I want to challenge others to solve them, and so I can see the interesting things you can do with all sorts of programming languages, from the classic languages of Python, Java and PHP to the golfing languages of Pyth, CJam, and Seriously to the esoteric and unusual languages of Brainfuck, &amp;gt;&amp;lt;&amp;gt;, and Labyrinth, among many &lt;em&gt;many&lt;/em&gt; &lt;strong&gt;many&lt;/strong&gt; others. Questions are designed to be high-quality so they attract high-quality answers. In my opinion, good questions should have reputation systems equivalent to that of answers.&lt;/p&gt;&#xA;" OwnerUserId="43444" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-18T18:40:33.193" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7694" PostTypeId="2" ParentId="2140" CreationDate="2015-12-09T19:04:18.323" Score="5" Body="&lt;p&gt;I nearly posted this without sandboxing, but thought it was perhaps too trivial - comments welcome.  &lt;strike&gt;I was considering perhaps making it &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; too with no digits &lt;code&gt;[0-9]&lt;/code&gt; in the source code.&lt;/strike&gt;Done.&lt;/p&gt;&#xA;&lt;h1&gt;Golf the numbers round a dartboard&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For those of you not familiar with &lt;a href=&quot;https://en.wikipedia.org/wiki/Darts&quot; rel=&quot;nofollow noreferrer&quot;&gt;the game of darts&lt;/a&gt;, a standard dartboard looks like this:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/YD3eE.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/YD3eE.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This challenge is simple - output the sequence of numbers starting from &lt;code&gt;20&lt;/code&gt; moving in a clockwise direction:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;20 1 18 4 13 6 10 15 2 17 3 19 7 16 8 11 14 9 12 5&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;To make it a bit more interesting, the digits &lt;code&gt;[0-9]&lt;/code&gt; may not appear anywhere in your source code.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your entry must not accept any input and it must output this list in exactly this order.&lt;/li&gt;&#xA;&lt;li&gt;The formatting of the list output may be whatever is convenient for your language.&lt;/li&gt;&#xA;&lt;li&gt;You must not use any builtins designed explicitly to generate this sequence.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;OEIS fans may like to note that this is sequence &lt;a href=&quot;https://oeis.org/A003833&quot; rel=&quot;nofollow noreferrer&quot;&gt;has an entry&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-09T20:17:52.783" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="7698" PostTypeId="1" CreationDate="2015-12-10T15:49:02.483" Score="-8" ViewCount="131" Body="&lt;p&gt;I would like to suggest a new badge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In one of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/66285/product-over-exclusive-and-inclusive-ranges/66288#66288&quot;&gt;the golfs&lt;/a&gt; Morgan Thrapp and i posted an answer the exact same second. He said that should be a badge and i think hes right.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The rules for the badge should be to post an answer with someone within a certain timeframe, i would say 3 seconds.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What do you guys think?&lt;/p&gt;&#xA;" OwnerUserId="47308" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2015-12-29T18:56:35.873" Title="new badge: good timing" Tags="|feature-request|status-declined|badges|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7699" PostTypeId="2" ParentId="7698" CreationDate="2015-12-10T15:57:37.997" Score="19" Body="&lt;p&gt;The purpose of (most) badges is to encourage a certain behaviour that is deemed good on SE. (There are a few exceptions, like Tumbleweed, and I'm pretty sure they'd go if the badge system was redesigned from scratch today.) I'm not exactly sure what good behaviour your badge idea would encourage.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-12-10T15:57:37.997" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7707" PostTypeId="2" ParentId="7683" CreationDate="2015-12-12T01:15:16.387" Score="-24" Body="&lt;h1&gt;No, because questions already give more rep points than answers&lt;/h1&gt;&#xA;&lt;p&gt;Just look the number of upvotes for any question and compare to the number of upvotes for the related answers.&lt;/p&gt;&#xA;&lt;p&gt;Here is a query showing how our top users get more reputation (on average) from a question than from an answer. Not 'much more' really, but more.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://data.stackexchange.com/codegolf/query/409034/average-reputation-gained-from-questions-compared-to-answers&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://data.stackexchange.com/codegolf/query/409034/average-reputation-gained-from-questions-compared-to-answers&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="21348" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-15T08:47:49.163" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="7711" PostTypeId="1" CreationDate="2015-12-12T17:56:28.377" Score="12" ViewCount="398" Body="&lt;p&gt;It was pointed out on chat- and I  agree- that scoring &lt;a href=&quot;https://github.com/SuperJedi224/Golfical&quot; rel=&quot;nofollow&quot;&gt;Golfical&lt;/a&gt; programs as 1 byte per pixel (as has been done with other graphical languages) would probably not be entirely fair. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, let's discuss how to do it. Here are some possibilities:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 byte for each pixel&#xA;3 bytes for each pixel&#xA;3 bytes for each non-white pixel (1)&#xA;19 bits for each pixel (2)&#xA;1 byte for each pixel, excluding red values 00-09, which are 2 bytes each (3)&#xA;1 byte for each pixel, excluding red values 00-09, which are 3 bytes each (3) (4)&#xA;1 byte for each non-white pixel, excluding red values 00-09, which are 3 bytes each (1) (3)&#xA;Other (5)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(1) White is a no-op&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(2) Based on the approximate number of colors that actually do something at present&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(3)The reason red values 00-09 are singled out for these is that they can encode a 16-bit integer argument in their blue and green values, and therefore all blue/green combinations for those red values are functional as opposed to just a very small subset (less than 1/1000)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(4) I personally think this is the most reasonable&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(5) Please specify.&lt;/p&gt;&#xA;" OwnerUserId="39022" LastEditorUserId="39022" LastEditDate="2015-12-12T18:13:04.430" LastActivityDate="2015-12-12T20:16:07.610" Title="There's a new graphical language- how to score it?" Tags="|discussion|scoring|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7713" PostTypeId="2" ParentId="7711" CreationDate="2015-12-12T19:39:03.827" Score="3" Body="&lt;h1&gt;Score by transpiling into a suitable raw binary encoding&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The github repo now provides an Encoder class for doing this. To encode a program, give the letter &lt;code&gt;e&lt;/code&gt; as the first argument, the program filename as the second, and the name of a text file as the third. To decode a program, change the first argument to a &lt;code&gt;d&lt;/code&gt; and reverse the second and third arguments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It assumes that the width and the height of the image are both smaller than 4096 pixels.&lt;/p&gt;&#xA;" OwnerUserId="39022" LastActivityDate="2015-12-12T19:39:03.827" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7714" PostTypeId="2" ParentId="7711" CreationDate="2015-12-12T20:03:57.817" Score="19" Body="&lt;h2&gt;Score the number of bytes by the number of bytes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This really seems pretty straightforward. If your program is run as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$ mylang somefile&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;then the score of your answer should be the output of&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$ wc -c somefile&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;that is, the number of bytes in the file.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your language requires a command line switch to read raw bytes (RGBRGBRGB...), count that as an extra byte, just like any other language. (Or, if you make the default &quot;detect filetype and interpret as raw RGB if nothing else is detected,&quot; you don't need a switch so there's no penalty.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;apparently &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7711/theres-a-new-graphical-language-how-to-score-it/7714#comment20574_7712&quot;&gt;I was ninja'd by Peter by 16 seconds...&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2015-12-12T20:03:57.817" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7716" PostTypeId="2" ParentId="6918" CreationDate="2015-12-14T00:40:30.437" Score="22" Body="&lt;h1&gt;&lt;a href=&quot;https://esolangs.org/wiki/MATL&quot; rel=&quot;nofollow noreferrer&quot;&gt;MATL&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;MATL /'mæt.ˌl/ is a programming language based on MATLAB and suitable for code golfing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It was created by me, Luis Mendo, in 2015. The idea &lt;a href=&quot;http://chat.stackoverflow.com/transcript/message/25584017#25584017&quot;&gt;came about&lt;/a&gt; in the StackOverflow MATLAB/Octave chatroom in September 2015. The first version was released on December 12, 2015, after having been &lt;a href=&quot;http://chat.stackoverflow.com/transcript/message/27114740#27114740&quot;&gt;sandboxed and discussed&lt;/a&gt; for a couple of weeks.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Initially the compiler worked on MATLAB only. It was then adapted to work on Octave as well. Since January 14, 2016 an online compiler is available at the &lt;a href=&quot;http://matl.tryitonline.net&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Try it Online!&lt;/strong&gt;&lt;/a&gt; platform (thanks to &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;@Dennis&lt;/a&gt; for providing it, and to &lt;a href=&quot;https://stackoverflow.com/users/3250829/rayryeng&quot;&gt;@rayryeng&lt;/a&gt; for his help with the process!). Also, a MATL-specific online interpreter is available at &lt;a href=&quot;https://matl.suever.net/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;MATL Online&lt;/strong&gt;&lt;/a&gt; (thanks to &lt;a href=&quot;https://codegolf.stackexchange.com/users/51939/suever&quot;&gt;@Suever&lt;/a&gt; for providing it!)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Language features&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The MATL language is stack-oriented. Data are pushed onto and popped out of a stack. Functions may take a number of elements from the stack (usually those at the top) and push one or more outputs onto the stack. Reverse Polish (or postfix) notation is used.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To ease stack handling, values from the stack can also be copied and pasted using several clipboards. These are similar to variables in other stack-based code-golf programming languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main goal in designing the language has been to keep it as close to MATLAB as possible. MATL includes functions equivalent to most commonly used MATLAB functions. It should be easy for a MATLAB user to start programming in MATL within minutes.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;More information&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;For more information see MATL's &lt;a href=&quot;https://esolangs.org/wiki/MATL&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Esolangs page&lt;/strong&gt;&lt;/a&gt;. The documentation and compiler can be found in the &lt;strong&gt;&lt;a href=&quot;https://github.com/lmendo/MATL&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github repository&lt;/strong&gt;&lt;/a&gt;. Here are some interesting &lt;a href=&quot;https://codegolf.stackexchange.com/a/76535/36398&quot;&gt;&lt;strong&gt;examples&lt;/strong&gt;&lt;/a&gt; that illustrate language features, and some &lt;a href=&quot;https://codegolf.stackexchange.com/questions/78152/tips-for-golfing-in-matl&quot;&gt;&lt;strong&gt;golfing tips&lt;/strong&gt;&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2017-01-20T19:08:36.787" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7724" PostTypeId="1" AcceptedAnswerId="7725" CreationDate="2015-12-15T04:51:28.703" Score="6" ViewCount="169" Body="&lt;p&gt;I recently asked the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/66647/create-a-matrix-effect-in-programming&quot;&gt;question&lt;/a&gt; in code golf, I have followed the standard template :&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have provided :&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Sample input&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Sample output&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Sample code &amp;amp; rules&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;what else this community need in order to make the question clear,i cant get the point of closure behind it,myself from non-english country &amp;amp; if my question lacks proper english you could edit &amp;amp; reframe the question&lt;/p&gt;&#xA;&#xA;&lt;p&gt;kindly clarify what made it close it as unclear&lt;/p&gt;&#xA;&#xA;&lt;p&gt;thanks&lt;/p&gt;&#xA;" OwnerUserId="5190" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2015-12-18T05:03:16.407" Title="Closure Guidance : Why was my question closed" Tags="|discussion|specific-question|closed-questions|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7725" PostTypeId="2" ParentId="7724" CreationDate="2015-12-15T06:31:19.747" Score="11" Body="&lt;p&gt;I can't speak to why the other users voted to close your question, but I would have closed it myself and here's why:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First of all, it's more of an art contest than a programming contest. Challenges like that aren't on topic here since the site is about programming.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Popularity contests, i.e. challenges which are scored by the number of votes, are difficult to do well. In particular, they need very specific guidelines on what is expected for the task and what makes an entry deserving of votes. In this case, the only rule is &quot;output random characters and say 'matrix effect'.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even if this were well specified, it would be hard to make it sufficiently distinct from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/17285/make-the-matrix-digital-rain-using-the-shortest-amount-of-code&quot;&gt;Make the Matrix Digital Rain using the shortest amount of code&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I encourage you to post your challenge to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox for Proposed Challenges&lt;/a&gt; where you can get meaningful feedback from the community before the challenge is posted to the main site.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-12-15T06:31:19.747" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7726" PostTypeId="2" ParentId="7688" CreationDate="2015-12-15T11:19:25.383" Score="8" Body="&lt;p&gt;&lt;strong&gt;TL;DR: ask the OP.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Most challenges are open to all languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However to before giving an acceptance (green check mark) a responsible challenge poster (OP) should check the code themselves.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The OP may therefore post restrictions. The most common is that the language must be available free of charge. Another common restriction may be that the language must be available for the OP's operating system.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;King of the Hill challenges are often significantly more restrictive, as the answer must work with the game controller.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is nothing inherently wrong with a submission that only works in an obsolete version of Mozilla Firefox, but if the OP and others cannot verify it you may not get an acceptance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also: be clear in your answer that it only works in an old version of a specific browser and indicate where to obtain it. Nothing destroys your credibility like having everyone trying to run your code and failing. Saying later &quot;oh, I forgot to mention it only works in revision X of Firefox&quot; does little to restore it.&lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="15599" LastEditDate="2015-12-16T03:47:36.417" LastActivityDate="2015-12-16T03:47:36.417" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7727" PostTypeId="1" AcceptedAnswerId="7728" CreationDate="2015-12-15T12:01:27.073" Score="2" ViewCount="152" Body="&lt;p&gt;I've seen some code golf languages that still a &lt;em&gt;work in progress&lt;/em&gt; (functions being added etc), but they have already &lt;em&gt;been made public&lt;/em&gt; and people are posting answers using those languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd like to know what the standard practice is regarding &lt;em&gt;changes to the language&lt;/em&gt; as it's still being polished. &lt;em&gt;Adding&lt;/em&gt; functionality is always fine (with the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5447/can-i-win-with-a-version-of-a-language-that-didnt-exist-when-the-challenge-was&quot;&gt;usual restriction&lt;/a&gt; for not winning challenges with a posterior version of the language). But what about &lt;em&gt;changing&lt;/em&gt; functionality? That would imply old answers would possibly cease to work in the new version. Is that considered acceptable? Should the language designer ensure full backwards compatibility?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a specific example, suppose a language has function &lt;code&gt;Xo&lt;/code&gt; for producing the number &lt;code&gt;pi&lt;/code&gt;.&lt;sup&gt;1&lt;/sup&gt; Later on, the designer decides the name &lt;code&gt;Xo&lt;/code&gt; would be better suited for a new function that is going to be introduced. To what extent would it be acceptable to rename the function that produces &lt;code&gt;pi&lt;/code&gt;, and change the meaning of &lt;code&gt;Xo&lt;/code&gt;? &quot;Never do that&quot; / &quot;Try to avoid it as much as possible&quot; / &quot;Only in some cases&quot; / &quot;Don't worry, that happens all the time&quot;... ?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;sup&gt;1&lt;/sup&gt;&lt;code&gt;o&lt;/code&gt; looks like a circle, and &lt;code&gt;X&lt;/code&gt; is an extension prefix&lt;/sub&gt; &lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2015-12-15T12:08:42.060" Title="Language changes that possibly break old answers?" Tags="|discussion|answers|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7728" PostTypeId="2" ParentId="7727" CreationDate="2015-12-15T12:08:42.060" Score="11" Body="&lt;p&gt;I always just link to either&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;a Github &lt;a href=&quot;https://help.github.com/articles/about-releases/&quot; rel=&quot;nofollow&quot;&gt;release&lt;/a&gt; of the version in which it works&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;if there's no release yet that it works in (sometimes I've implemented a new feature but not yet created a release for it), I just link directly to the commit&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;That way, the answer is &lt;em&gt;guaranteed&lt;/em&gt; to always work (assuming Github doesn't go down or something).&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2015-12-15T12:08:42.060" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7730" PostTypeId="2" ParentId="2140" CreationDate="2015-12-15T21:18:38.320" Score="0" Body="&lt;p&gt;&lt;strong&gt;Logic Puzzle Solver/Inference Engine&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your goal is to take the clues and other facts given in a grade-school logic grid puzzle such as &lt;a href=&quot;http://www.edhelperblog.com/cgi-bin/vocab.cgi?FORMMODE=OO&amp;amp;WS=2&quot; rel=&quot;nofollow&quot;&gt;these&lt;/a&gt; and solve the puzzle. To keep things simple, your program will only solve specific logic problems about which it can make the assumptions you wish to hard-code in, but the program need not perform any checks to see if those assumptions can be made.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;You may not use:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A declarative language&lt;/li&gt;&#xA;&lt;li&gt;Any function provided - by an external dependency - for the solving of a logic puzzle.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program will take input from the command line. After gathering assumptions, the program will ask for facts written as such:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;subject.verb object&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;for all true facts. For false facts:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;!subject.verb object&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Examples: If Chad bought donuts,&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Chad.bought donuts&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If he didn't:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;!Chad.bought donuts.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If Nancy's last name isn't Wesley,&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;!Nancy.is Wesley.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program will output its conclusions as such:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;subject verb object.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So, if your program determines that Chad bought donuts and Nancy's last name is Wesley, then it will output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Chad bought donuts.&#xA;&#xA;Nancy's last name is Wesley.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="25140" LastActivityDate="2015-12-15T21:18:38.320" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7733" PostTypeId="2" ParentId="2140" CreationDate="2015-12-16T16:07:36.660" Score="1" Body="&lt;h1&gt;Broken FizzBuzz - Greg Is Confused &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(FizzBuzz suggested by quartata in chat)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Related: &lt;a href=&quot;https://codegolf.stackexchange.com/q/31647/8478&quot;&gt;Deletion of a blank line in source code which causes unexpected functionality&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/23250/what-no-error&quot;&gt;What? No error?&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/19379/write-a-line-in-program-that-looks-useless&quot;&gt;Write a line in program that looks useless&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Meet Greg. Greg is the new debugger at your company, and he deals with checking programs to see if they work. If they don't, he tries to find out why and fix them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Greg is rather new to programming and understands the basics, but still gets tripped up by some advanced things. Sometimes, programs don't work and he doesn't know why.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You don't really like Greg, so you decide to play a game. You create two nearly-identical FizzBuzz-style programs - one which works, and one which doesn't.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;n = input()&#xA;if (n % 3 == 0) {&#xA; print &quot;Fizz&quot;&#xA;}&#xA;if (n % 5 == 0) {&#xA; print &quot;Buzz&quot;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;works, but&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;n = input()&#xA;if (n % 3 = 0) {&#xA; print &quot;Fizz&quot;&#xA;}&#xA;if (n % 5 == 0) {&#xA; print &quot;Buzz&quot;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;doesn't. Greg is confused (but not by something as simple as this).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And because Greg has a desk only a few feet away from you, your code must be as small as possible, so he doesn't catch on.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your correct program must accept an integer as input and return output as specified below, and your incorrect program must do something else (such as throwing an error or giving invalid output).&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The valid program's output must print &quot;Fizz&quot; if the number is divisible by 3, &quot;Buzz&quot; if it divisible by 5, &quot;FizzBuzz&quot; if it divisible by both 3 and 5, and nothing if it isn't divisible by 3 or 5.&lt;/li&gt;&#xA;&lt;li&gt;The invalid program's output may do anything else.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Greg knows all programming languages to date, including super-obscure ones. Therefore, your answer may be in any language you choose (providing it was created before this challenge was posted.)&lt;/li&gt;&#xA;&lt;li&gt;You MUST have the two programs be nearly identical, except for one small change. The more concealed or insignificant-looking, the better.&lt;/li&gt;&#xA;&lt;li&gt;Greg uses PPCG and has participated in underhanded challenges before, so he knows about the C trigraph (&lt;code&gt;??/&lt;/code&gt;). You can't trick him with it.&lt;/li&gt;&#xA;&lt;li&gt;Greg has also seen replacing ASCII characters with nearly-identical Unicode or abusing fonts, meaning that won't work either. Therefore, your program's change must work with all fonts, any may not exploit visual similarity between characters with different code-points.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Changing an &lt;code&gt;a&lt;/code&gt; to an &lt;code&gt;A&lt;/code&gt; is allowed, as long as it's not obvious that that's what broke the program. However, changing &lt;code&gt;a&lt;/code&gt; to &lt;code&gt;&amp;lt;unicode character that looks exactly the same&amp;gt;&lt;/code&gt; is forbidden.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Both programs must be written in the same language with the same version.&lt;/li&gt;&#xA;&lt;li&gt;Your answer must include:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The language both programs are written in&lt;/li&gt;&#xA;&lt;li&gt;Two programs: one FizzBuzz program, and another that is broken&lt;/li&gt;&#xA;&lt;li&gt;How to run both of them (the commands must be identical with identical arguments)&lt;/li&gt;&#xA;&lt;li&gt;Why one doesn't work (in spoilertext)&lt;/li&gt;&#xA;&lt;li&gt;The output of the broken one&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Your programs must have a &lt;a href=&quot;https://en.wikipedia.org/wiki/Levenshtein_distance&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Wikipedia Link&quot;&gt;Levenshtein distance&lt;/a&gt; of no more than 10 from one-another. (Meaning that you may add, delete, or change up to 10 characters in the broken code from the correct one.)&lt;/li&gt;&#xA;&lt;li&gt;Your score is the total bytecount of both of your programs.&lt;/li&gt;&#xA;&lt;li&gt;The winner is the post with the smallest score over 20 votes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Meta Questions&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is 10 too small a maximum Levenshtein distance? I was also considering 15.&lt;/li&gt;&#xA;&lt;li&gt;Are any of my rules already forbidden by the standard loopholes? I'd like to remove them if possible to make the post shorter.&lt;/li&gt;&#xA;&lt;li&gt;Similarly, should I remove or change any of my rules?&lt;/li&gt;&#xA;&lt;li&gt;This is a code-golf version of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/revisions/7733/12&quot; title=&quot;old edit&quot;&gt;this previous edit&lt;/a&gt;. Should I keep it as code-golf or change it back?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="38891" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.563" LastActivityDate="2015-12-19T16:38:29.363" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="7734" PostTypeId="2" ParentId="1061" CreationDate="2015-12-16T17:42:23.680" Score="-6" Body="&lt;h1&gt;A script invoking itself as a form of looping/recursion, where the filename has to be a specific name&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;e.g. I answered a question with PowerShell which included &lt;code&gt;sleep 1;t&lt;/code&gt; where the script had to be called &lt;code&gt;t.ps1&lt;/code&gt; and saved in the PATH, so it would call itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I considered it maybe reasonable because running programs is part of what shell scripts do, and there's no reference to it in this meta topic as a standard loophole. The closest is about &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1072/571&quot;&gt;hiding information in the filename, e.g. a file called &quot;hello world&quot;&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;People commented to say relying on the filename is frowned upon, so I'm submitting it here so it can be voted on and be on record as approved/denied in future. Is it a loophole, or is it valid in the same way as an answer might say &quot;requires version 3 or above&quot; or &quot;only works in a particular interpreter&quot;?&lt;/p&gt;&#xA;" OwnerUserId="571" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2015-12-16T17:42:23.680" CommentCount="10" CommunityOwnedDate="2015-12-16T17:42:23.680" ContentLicense="CC BY-SA 3.0" />
  <row Id="7737" PostTypeId="1" AcceptedAnswerId="7763" CreationDate="2015-12-17T02:37:40.340" Score="22" ViewCount="630" Body="&lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/questions/271080/the-mit-license-clarity-on-using-code-on-stack-overflow-and-on-the-stack-excha&quot; title=&quot;How NOT to use Open Source Licenses, brought to you by StackExchange&quot;&gt;This is (probably) happening&lt;/a&gt;, and it's annoying me, and there's quite a lot of backlash from the community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you read all of that post and the comments and the answers and the answers' comments (or, indeed, &lt;kbd&gt;CTRL-F&lt;/kbd&gt; + &lt;code&gt;code golf&lt;/code&gt;&lt;sup&gt;1&lt;/sup&gt;), you will see niche sites like &lt;a href=&quot;http://codegolf.stackexchange.com&quot;&gt;Code Golf&lt;/a&gt; and &lt;a href=&quot;http://codereview.stackexchange.com&quot;&gt;Code Review&lt;/a&gt; mentioned as being special, that is, not the same relationship as Stack Overflow has to code snippets (or far more than snippets.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I realise it's mostly up to The Ones At The Top With The Lawyers, but what &lt;s&gt;are&lt;/s&gt; will be the effects of this on Code Golf? Will anyone obey my &lt;code&gt;I hereby request you attribute this to me, blah blah&lt;/code&gt;&lt;sup&gt;2&lt;/sup&gt;? Will this kill creativity in answers? Will the site change at all, or will nobody care at all because nobody gives a thought to the current licensing scheme...?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;It seems, especially from some comments made by the &lt;a href=&quot;http://meta.stackexchange.com&quot;&gt;Meta.SE&lt;/a&gt; mods, that in the cases of communities like ours, communication and a community-voiced stance will be encouraged. This seems to imply &lt;em&gt;we, as a community, can contribute to the state of the licenses used on SE.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What, if any, will our stance be?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; I guess this is a form of code now ... ?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;2&lt;/sup&gt; And so is this?&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2016-01-07T12:51:08.910" Title="Effect of the MIT license change on PPCG" Tags="|discussion|" AnswerCount="1" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="7741" PostTypeId="2" ParentId="7683" CreationDate="2015-12-17T14:52:35.100" Score="32" Body="&lt;p&gt;I'm late to this party, so I probably won't get many votes.&lt;/p&gt;&#xA;&lt;h1&gt;Upvotes +15, Downvotes -5&lt;/h1&gt;&#xA;&lt;p&gt;For each one challenge, approximately &lt;a href=&quot;http://area51.stackexchange.com/proposals/4570/code-golf-programming-puzzles&quot;&gt;9.9 solutions&lt;/a&gt; are written. It seems obvious to me that challenges are far more valuable to the site than solutions. Make upvotes count for +15.&lt;/p&gt;&#xA;&lt;p&gt;Fifteen reputation for an upvote will reward poorly written challenges. We have a Sandbox dedicated to challenges. I don't see why anyone would forego a free critique, but if you do, then you really have no excuse. Make downvotes count for -5.&lt;/p&gt;&#xA;&lt;p&gt;The result is that challenges that can maintain a ratio of 1 upvote for every 3 downvotes will break even. That seems reasonable to me.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-17T14:52:35.100" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="7742" PostTypeId="2" ParentId="5139" CreationDate="2015-12-17T18:28:24.573" Score="6" Body="&lt;p&gt;I would like to suggest a couple of minor changes. In order of appearance:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;JavaScript&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Preserve sign of size by adding &lt;code&gt;-?&lt;/code&gt; to the size's group in SCORE_REG (ex: “3” vs. “-3”)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;var SCORE_REG = /&amp;lt;h\d&amp;gt;\s*([^\n,]*[^\s,]),.*?(-?\d+)(?=[^\n\d&amp;lt;&amp;gt;]*(?:&amp;lt;(?:s&amp;gt;[^\n&amp;lt;&amp;gt;]*&amp;lt;\/s&amp;gt;|[^\n&amp;lt;&amp;gt;]+&amp;gt;)[^\n\d&amp;lt;&amp;gt;]*)*&amp;lt;\/h\d&amp;gt;)/;&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;HTML-ify plain text language name, so can &lt;code&gt;jQuery()&lt;/code&gt;-fy it and get rid of SGML character entities when getting its &lt;code&gt;text()&lt;/code&gt; (eg: “&gt;&amp;lt;&gt;” vs. “&gt;&amp;amp;lt;&gt;”)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;if (! /&amp;lt;a/.test(lang)) lang = '&amp;lt;i&amp;gt;' + lang + '&amp;lt;/i&amp;gt;';&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Transform the langage name in &lt;code&gt;toLowerCase()&lt;/code&gt; (eg: “JavaScript” vs. “Javascript”)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;lang = jQuery(lang).text().toLowerCase();&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Keep the stripped language with answer data&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;languages[lang] = languages[lang] || {lang: a.language, user: a.user, size: a.size, link: a.link, uniq: lang};&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Sort by the stripped language name&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;if (a.uniq &amp;gt; b.uniq) return 1;&#xA;if (a.uniq &amp;lt; b.uniq) return -1;&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;HTML&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Change the URL of stylesheet to the graduated one&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;link rel=&quot;stylesheet&quot; type=&quot;text/css&quot; href=&quot;//cdn.sstatic.net/Sites/codegolf/primary.css?v=f52df912b654&quot;&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Use the score as link text (eg: “&lt;a href=&quot;http://example.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;3&lt;/a&gt;” vs. “3 &lt;a href=&quot;http://example.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Link&lt;/a&gt;”)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;a href=&quot;{{LINK}}&quot;&amp;gt;{{SIZE}}&amp;lt;/a&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Suggested changes applied to the following snippet, configured to show &lt;a href=&quot;https://codegolf.stackexchange.com/questions/59436/create-output-twice-the-length-of-the-code&quot;&gt;Create output twice the length of the code&lt;/a&gt;'s score:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;/* Configuration */&#xD;&#xA;&#xD;&#xA;var QUESTION_ID = 59436; // Obtain this from the url&#xD;&#xA;// It will be like https://XYZ.stackexchange.com/questions/QUESTION_ID/... on any question page&#xD;&#xA;var ANSWER_FILTER = &quot;!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe&quot;;&#xD;&#xA;var COMMENT_FILTER = &quot;!)Q2B_A2kjfAiU78X(md6BoYk&quot;;&#xD;&#xA;var OVERRIDE_USER = 41505; // This should be the user ID of the challenge author.&#xD;&#xA;&#xD;&#xA;/* App */&#xD;&#xA;&#xD;&#xA;var answers = [], answers_hash, answer_ids, answer_page = 1, more_answers = true, comment_page;&#xD;&#xA;&#xD;&#xA;function answersUrl(index) {&#xD;&#xA;  return &quot;https://api.stackexchange.com/2.2/questions/&quot; +  QUESTION_ID + &quot;/answers?page=&quot; + index + &quot;&amp;amp;pagesize=100&amp;amp;order=desc&amp;amp;sort=creation&amp;amp;site=codegolf&amp;amp;filter=&quot; + ANSWER_FILTER;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function commentUrl(index, answers) {&#xD;&#xA;  return &quot;https://api.stackexchange.com/2.2/answers/&quot; + answers.join(';') + &quot;/comments?page=&quot; + index + &quot;&amp;amp;pagesize=100&amp;amp;order=desc&amp;amp;sort=creation&amp;amp;site=codegolf&amp;amp;filter=&quot; + COMMENT_FILTER;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function getAnswers() {&#xD;&#xA;  jQuery.ajax({&#xD;&#xA;    url: answersUrl(answer_page++),&#xD;&#xA;    method: &quot;get&quot;,&#xD;&#xA;    dataType: &quot;jsonp&quot;,&#xD;&#xA;    crossDomain: true,&#xD;&#xA;    success: function (data) {&#xD;&#xA;      answers.push.apply(answers, data.items);&#xD;&#xA;      answers_hash = [];&#xD;&#xA;      answer_ids = [];&#xD;&#xA;      data.items.forEach(function(a) {&#xD;&#xA;        a.comments = [];&#xD;&#xA;        var id = +a.share_link.match(/\d+/);&#xD;&#xA;        answer_ids.push(id);&#xD;&#xA;        answers_hash[id] = a;&#xD;&#xA;      });&#xD;&#xA;      if (!data.has_more) more_answers = false;&#xD;&#xA;      comment_page = 1;&#xD;&#xA;      getComments();&#xD;&#xA;    }&#xD;&#xA;  });&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function getComments() {&#xD;&#xA;  jQuery.ajax({&#xD;&#xA;    url: commentUrl(comment_page++, answer_ids),&#xD;&#xA;    method: &quot;get&quot;,&#xD;&#xA;    dataType: &quot;jsonp&quot;,&#xD;&#xA;    crossDomain: true,&#xD;&#xA;    success: function (data) {&#xD;&#xA;      data.items.forEach(function(c) {&#xD;&#xA;        if (c.owner.user_id === OVERRIDE_USER)&#xD;&#xA;          answers_hash[c.post_id].comments.push(c);&#xD;&#xA;      });&#xD;&#xA;      if (data.has_more) getComments();&#xD;&#xA;      else if (more_answers) getAnswers();&#xD;&#xA;      else process();&#xD;&#xA;    }&#xD;&#xA;  });  &#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;getAnswers();&#xD;&#xA;&#xD;&#xA;var SCORE_REG = /&amp;lt;h\d&amp;gt;\s*([^\n,]*[^\s,]),.*?(-?\d+)(?=[^\n\d&amp;lt;&amp;gt;]*(?:&amp;lt;(?:s&amp;gt;[^\n&amp;lt;&amp;gt;]*&amp;lt;\/s&amp;gt;|[^\n&amp;lt;&amp;gt;]+&amp;gt;)[^\n\d&amp;lt;&amp;gt;]*)*&amp;lt;\/h\d&amp;gt;)/;&#xD;&#xA;&#xD;&#xA;var OVERRIDE_REG = /^Override\s*header:\s*/i;&#xD;&#xA;&#xD;&#xA;function getAuthorName(a) {&#xD;&#xA;  return a.owner.display_name;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function process() {&#xD;&#xA;  var valid = [];&#xD;&#xA;  &#xD;&#xA;  answers.forEach(function(a) {&#xD;&#xA;    var body = a.body;&#xD;&#xA;    a.comments.forEach(function(c) {&#xD;&#xA;      if(OVERRIDE_REG.test(c.body))&#xD;&#xA;        body = '&amp;lt;h1&amp;gt;' + c.body.replace(OVERRIDE_REG, '') + '&amp;lt;/h1&amp;gt;';&#xD;&#xA;    });&#xD;&#xA;    &#xD;&#xA;    var match = body.match(SCORE_REG);&#xD;&#xA;    if (match)&#xD;&#xA;      valid.push({&#xD;&#xA;        user: getAuthorName(a),&#xD;&#xA;        size: +match[2],&#xD;&#xA;        language: match[1],&#xD;&#xA;        link: a.share_link,&#xD;&#xA;      });&#xD;&#xA;    &#xD;&#xA;  });&#xD;&#xA;  &#xD;&#xA;  valid.sort(function (a, b) {&#xD;&#xA;    var aB = a.size,&#xD;&#xA;        bB = b.size;&#xD;&#xA;    return aB - bB&#xD;&#xA;  });&#xD;&#xA;&#xD;&#xA;  var languages = {};&#xD;&#xA;  var place = 1;&#xD;&#xA;  var lastSize = null;&#xD;&#xA;  var lastPlace = 1;&#xD;&#xA;  valid.forEach(function (a) {&#xD;&#xA;    if (a.size != lastSize)&#xD;&#xA;      lastPlace = place;&#xD;&#xA;    lastSize = a.size;&#xD;&#xA;    ++place;&#xD;&#xA;    &#xD;&#xA;    var answer = jQuery(&quot;#answer-template&quot;).html();&#xD;&#xA;    answer = answer.replace(&quot;{{PLACE}}&quot;, lastPlace + &quot;.&quot;)&#xD;&#xA;                   .replace(&quot;{{NAME}}&quot;, a.user)&#xD;&#xA;                   .replace(&quot;{{LANGUAGE}}&quot;, a.language)&#xD;&#xA;                   .replace(&quot;{{SIZE}}&quot;, a.size)&#xD;&#xA;                   .replace(&quot;{{LINK}}&quot;, a.link);&#xD;&#xA;    answer = jQuery(answer);&#xD;&#xA;    jQuery(&quot;#answers&quot;).append(answer);&#xD;&#xA;&#xD;&#xA;    var lang = a.language;&#xD;&#xA;    if (! /&amp;lt;a/.test(lang)) lang = '&amp;lt;i&amp;gt;' + lang + '&amp;lt;/i&amp;gt;';&#xD;&#xA;    lang = jQuery(lang).text().toLowerCase();&#xD;&#xA;&#xD;&#xA;    languages[lang] = languages[lang] || {lang: a.language, user: a.user, size: a.size, link: a.link, uniq: lang};&#xD;&#xA;  });&#xD;&#xA;&#xD;&#xA;  var langs = [];&#xD;&#xA;  for (var lang in languages)&#xD;&#xA;    if (languages.hasOwnProperty(lang))&#xD;&#xA;      langs.push(languages[lang]);&#xD;&#xA;&#xD;&#xA;  langs.sort(function (a, b) {&#xD;&#xA;    if (a.uniq &amp;gt; b.uniq) return 1;&#xD;&#xA;    if (a.uniq &amp;lt; b.uniq) return -1;&#xD;&#xA;    return 0;&#xD;&#xA;  });&#xD;&#xA;&#xD;&#xA;  for (var i = 0; i &amp;lt; langs.length; ++i)&#xD;&#xA;  {&#xD;&#xA;    var language = jQuery(&quot;#language-template&quot;).html();&#xD;&#xA;    var lang = langs[i];&#xD;&#xA;    language = language.replace(&quot;{{LANGUAGE}}&quot;, lang.lang)&#xD;&#xA;                       .replace(&quot;{{NAME}}&quot;, lang.user)&#xD;&#xA;                       .replace(&quot;{{SIZE}}&quot;, lang.size)&#xD;&#xA;                       .replace(&quot;{{LINK}}&quot;, lang.link);&#xD;&#xA;    language = jQuery(language);&#xD;&#xA;    jQuery(&quot;#languages&quot;).append(language);&#xD;&#xA;  }&#xD;&#xA;&#xD;&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-css lang-css prettyprint-override&quot;&gt;&lt;code&gt;body { text-align: left !important}&#xD;&#xA;&#xD;&#xA;#answer-list {&#xD;&#xA;  padding: 10px;&#xD;&#xA;  width: 290px;&#xD;&#xA;  float: left;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;#language-list {&#xD;&#xA;  padding: 10px;&#xD;&#xA;  width: 290px;&#xD;&#xA;  float: left;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;table thead {&#xD;&#xA;  font-weight: bold;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;table td {&#xD;&#xA;  padding: 5px;&#xD;&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xD;&#xA;&amp;lt;link rel=&quot;stylesheet&quot; type=&quot;text/css&quot; href=&quot;//cdn.sstatic.net/Sites/codegolf/primary.css?v=f52df912b654&quot;&amp;gt;&#xD;&#xA;&amp;lt;div id=&quot;answer-list&quot;&amp;gt;&#xD;&#xA;  &amp;lt;h2&amp;gt;Leaderboard&amp;lt;/h2&amp;gt;&#xD;&#xA;  &amp;lt;table class=&quot;answer-list&quot;&amp;gt;&#xD;&#xA;    &amp;lt;thead&amp;gt;&#xD;&#xA;      &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Author&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Language&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Size&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&#xD;&#xA;    &amp;lt;/thead&amp;gt;&#xD;&#xA;    &amp;lt;tbody id=&quot;answers&quot;&amp;gt;&#xD;&#xA;&#xD;&#xA;    &amp;lt;/tbody&amp;gt;&#xD;&#xA;  &amp;lt;/table&amp;gt;&#xD;&#xA;&amp;lt;/div&amp;gt;&#xD;&#xA;&amp;lt;div id=&quot;language-list&quot;&amp;gt;&#xD;&#xA;  &amp;lt;h2&amp;gt;Winners by Language&amp;lt;/h2&amp;gt;&#xD;&#xA;  &amp;lt;table class=&quot;language-list&quot;&amp;gt;&#xD;&#xA;    &amp;lt;thead&amp;gt;&#xD;&#xA;      &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;Language&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;User&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Score&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&#xD;&#xA;    &amp;lt;/thead&amp;gt;&#xD;&#xA;    &amp;lt;tbody id=&quot;languages&quot;&amp;gt;&#xD;&#xA;&#xD;&#xA;    &amp;lt;/tbody&amp;gt;&#xD;&#xA;  &amp;lt;/table&amp;gt;&#xD;&#xA;&amp;lt;/div&amp;gt;&#xD;&#xA;&amp;lt;table style=&quot;display: none&quot;&amp;gt;&#xD;&#xA;  &amp;lt;tbody id=&quot;answer-template&quot;&amp;gt;&#xD;&#xA;    &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;{{PLACE}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{NAME}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{LANGUAGE}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;{{LINK}}&quot;&amp;gt;{{SIZE}}&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&#xD;&#xA;  &amp;lt;/tbody&amp;gt;&#xD;&#xA;&amp;lt;/table&amp;gt;&#xD;&#xA;&amp;lt;table style=&quot;display: none&quot;&amp;gt;&#xD;&#xA;  &amp;lt;tbody id=&quot;language-template&quot;&amp;gt;&#xD;&#xA;    &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;{{LANGUAGE}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{NAME}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;{{LINK}}&quot;&amp;gt;{{SIZE}}&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&#xD;&#xA;  &amp;lt;/tbody&amp;gt;&#xD;&#xA;&amp;lt;/table&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="4198" LastEditorUserId="4198" LastEditDate="2018-05-28T14:30:26.830" LastActivityDate="2018-05-28T14:30:26.830" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="7744" PostTypeId="1" CreationDate="2015-12-17T21:08:37.980" Score="2" ViewCount="176" Body="&lt;h1&gt;Justification of user-created languages to gain an advantage in the future&lt;/h1&gt;&#xA;&lt;p&gt;On my question, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/66415/rolling-the-dice/&quot;&gt;Rolling the Dice&lt;/a&gt;, I received &lt;a href=&quot;https://codegolf.stackexchange.com/questions/66415/rolling-the-dice/66627#66627&quot;&gt;this&lt;/a&gt; answer.&lt;/p&gt;&#xA;&lt;p&gt;In it &lt;a href=&quot;https://codegolf.stackexchange.com/users/48095/zocky&quot;&gt;@zocky&lt;/a&gt; asked about the justification of using ultra-short languages specifically designed for code golf to win challenges.&lt;/p&gt;&#xA;&lt;p&gt;On my question wasn't really the right place to post the question, but seeing as how he has a point, I am re-asking it on meta.&lt;/p&gt;&#xA;&lt;p&gt;My question is this:&lt;/p&gt;&#xA;&lt;h2&gt;Why should we allow people to make their own languages to solve problems?&lt;/h2&gt;&#xA;&lt;p&gt;I know we have rules like languages have to be pre-existing, have an interpreter, etc. but what justifies the use of languages built to be ultra-short?  Like why should we not be constrained to languages that are used elsewhere?&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-18T17:33:54.530" Title="Justification for use of custom Langs" Tags="|discussion|" AnswerCount="4" CommentCount="21" ClosedDate="2015-12-18T18:12:17.487" ContentLicense="CC BY-SA 3.0" />
  <row Id="7745" PostTypeId="2" ParentId="7744" CreationDate="2015-12-17T21:46:50.840" Score="2" Body="&lt;h1&gt;Because if people do the work and make a language, they can use it.&lt;/h1&gt;&#xA;&lt;p&gt;I thought for a bit and decided on this.  If people take the time and effort to make their own language, they can use it.&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-17T21:46:50.840" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7746" PostTypeId="2" ParentId="7744" CreationDate="2015-12-17T21:51:21.367" Score="10" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Why should we allow people to make their own languages to solve problems?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Why not?&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2015-12-17T21:51:21.367" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7747" PostTypeId="2" ParentId="7744" CreationDate="2015-12-18T01:05:42.450" Score="4" Body="&lt;h1&gt;A language is a language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There's nothing that makes one language better than another, except for the sort of things in the Standard Loopholes.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Why should we allow people to make their own languages to solve problems?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Because once someone's made a language, it's just as good as any other. PPCG doesn't discriminate based on outside popularity, and I think that's a good thing.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="42545" LastEditDate="2015-12-18T01:45:55.913" LastActivityDate="2015-12-18T01:45:55.913" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7748" PostTypeId="2" ParentId="2140" CreationDate="2015-12-18T02:25:37.440" Score="2" Body="&lt;p&gt;&lt;strong&gt;This is currently WIP, but please post feedback if you have any!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Best General-Purpose Compression&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Abstract&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;&lt;em&gt;This paragraph is meant to summarize, the binding rules are below.&lt;/em&gt;&lt;/sup&gt;&lt;br&gt;&#xA;Your task is to implement the best general purpose compression algorithm in the context of this challenge. You will be given a file corpus which contains a mix of different file types. The goal is to beat an existing answer in terms of overall size. The size is determined by the size of the compiled compression program (&lt;em&gt;and&lt;/em&gt; decompression program if they are two different programs) plus the compressed size of the corpus. Your algorithm must beat standard 7z with default settings by at least 10 bytes, or if there is an existing answer, this answer by 10 bytes.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Corpus&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This paragraph lists all files that are part of the input to your program, their size and the baseline 7z score in &lt;code&gt;7z 9.38 beta&lt;/code&gt;. Licenses are linked where needed. Disclaimer: There is no political or humorous motivation behind the choices. All files were chosen because of their representation of certain formats or unique compression behavior.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Natural Language&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#1&lt;/strong&gt; - ASCII - Bibliography of Computer Security Articles 1983-88: &lt;a href=&quot;http://textfiles.com/law/articles.law&quot; rel=&quot;nofollow noreferrer&quot;&gt;Download&lt;/a&gt;&lt;sup&gt;Save-As&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Uncompressed:      146 119&#xA;7z 9.38 beta:       17 142&#xA;File name:    articles.law&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#2&lt;/strong&gt; - ASCII - Pre-Flight Launch Preparation for the Space Shuttle: &lt;a href=&quot;http://textfiles.com/science/fli-laun.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;Download&lt;/a&gt;&lt;sup&gt;Save-As&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Uncompressed:        44 515&#xA;7z 9.38 beta:        15 304&#xA;File name:    6_2_4_4_2.TXT&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#3&lt;/strong&gt; - ASCII - 1984 News report archive about the &lt;a href=&quot;https://en.wikipedia.org/wiki/Deutsche_Bundespost&quot; rel=&quot;nofollow noreferrer&quot;&gt;Bundespost&lt;/a&gt; Hack: &lt;a href=&quot;http://textfiles.com/news/boh-20f8.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;Download&lt;/a&gt;&lt;sup&gt;Save-As&lt;/sup&gt; (transcribed by &lt;a href=&quot;https://www.ccc.de/en/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Chaos Computer Club&lt;/a&gt;, cites full-text articles from &lt;a href=&quot;https://en.wikipedia.org/wiki/Die_Zeit&quot; rel=&quot;nofollow noreferrer&quot;&gt;Die ZEIT&lt;/a&gt;, &lt;a href=&quot;https://en.wikipedia.org/wiki/Die_Tageszeitung&quot; rel=&quot;nofollow noreferrer&quot;&gt;taz&lt;/a&gt; et al.)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Uncompressed:      102 242&#xA;7z 9.38 beta:       32 382&#xA;File name:    boh-20f8.txt&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#4&lt;/strong&gt; - ASCII - (Unofficial historical transcript of) &lt;em&gt;His Last Bow&lt;/em&gt; by Arthur Conan Doyle: &lt;a href=&quot;http://www.textfiles.com/etext/AUTHORS/DOYLE/doyle-his-382.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;Download&lt;/a&gt;&lt;sup&gt;Save-As&lt;/sup&gt; (lic. Public Domain)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Uncompressed:           330 042&#xA;7z 9.38 beta:           110 481&#xA;File name:    doyle-his-382.txt&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#5&lt;/strong&gt; - UTF8 - Transcript of the &lt;a href=&quot;https://en.wikipedia.org/wiki/Rosetta_Stone&quot; rel=&quot;nofollow noreferrer&quot;&gt;Rosetta Stone&lt;/a&gt; translated to English: &lt;a href=&quot;https://gist.github.com/minxomat/ad67197ae2c5de29fe33&quot; rel=&quot;nofollow noreferrer&quot;&gt;Download&lt;/a&gt;&lt;sup&gt;RAW-&gt;Save-As&lt;/sup&gt; (lic./&amp;copy; The Nile, Notes for Travelers in Egypt, by E. A. Wallis Budge, 9th Edition, London, Thos. Cook and Son, [1905], pp. 199-211)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Uncompressed:                  18 270&#xA;7z 9.38 beta:                   6 299&#xA;File name:    Rosetta_EN_UTF8+BOM.txt&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Source Code (+ Markdown)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#1&lt;/strong&gt; - C - CPU control code taken from the linux kernel: &lt;a href=&quot;https://gist.githubusercontent.com/minxomat/bda6c660ab66aeced21f/raw/cab25fb3537a2292d53b35694bd48d0976933581/cpu.c&quot; rel=&quot;nofollow noreferrer&quot;&gt;Download&lt;/a&gt;&lt;sup&gt;RAW-&gt;Save-As&lt;/sup&gt; (lic. GPL, Rusty Russell)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Uncompressed: 18 866&#xA;7z 9.38 beta:  5 683&#xA;File name:     cpu.c&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#2&lt;/strong&gt; - QBASIC - COMBAT ARENA (Game): &lt;a href=&quot;https://gist.githubusercontent.com/minxomat/e0dfab0d75bf8dbd8c7a/raw/5beae77f383dadaf86c7e080214d843d3ca3bfe9/COMBAT.BAS&quot; rel=&quot;nofollow noreferrer&quot;&gt;Download&lt;/a&gt;&lt;sup&gt;RAW-&gt;Save-As&lt;/sup&gt; (&amp;copy; Jeff Copperthite)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Uncompressed: 59 792&#xA;7z 9.38 beta: 11 921&#xA;File name: COMBAT.BAS&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#3&lt;/strong&gt; - XML - The 9/11 Wikimedia dump: &lt;a href=&quot;https://dumps.wikimedia.org/sep11wiki/20071116/sep11wiki-20071116-pages-meta-history.xml.7z&quot; rel=&quot;nofollow noreferrer&quot;&gt;Download&lt;/a&gt; (lic. &lt;a href=&quot;https://www.wikipedia.org/wiki/Wikipedia:Copyrights&quot; rel=&quot;nofollow noreferrer&quot;&gt;GFDL&lt;/a&gt;, &lt;a href=&quot;https://creativecommons.org/licenses/by-sa/3.0/&quot; rel=&quot;nofollow noreferrer&quot;&gt;CC-BY-SA 3.0&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Uncompressed:                                40 557 621&#xA;7z 9.38 beta:                                   578 993&#xA;File name:    sep11wiki-20071116-pages-meta-history.xml&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#4&lt;/strong&gt; - C# - Source of the .NET Framework System.Array (CLR): &lt;a href=&quot;https://gist.githubusercontent.com/minxomat/55159aff210bcffd1387/raw/0f8e58946ebce46c560ee41f7f1c7a413f09c195/Array.cs&quot; rel=&quot;nofollow noreferrer&quot;&gt;Download&lt;/a&gt;&lt;sup&gt;RAW-&gt;Save-As&lt;/sup&gt; (lic. &lt;a href=&quot;https://opensource.org/licenses/MIT&quot; rel=&quot;nofollow noreferrer&quot;&gt;MIT&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Uncompressed:  133 646&#xA;7z 9.38 beta:   15 172&#xA;File name:    Array.cs&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#5&lt;/strong&gt; - JavaScript - jQuery 1.11.3: &lt;a href=&quot;https://gist.githubusercontent.com/minxomat/2c5d1ab2044d4ac8fb1f/raw/8cac85ea5724876213b0b0573b3bc9267adb958b/jquery-1.11.3.js&quot; rel=&quot;nofollow noreferrer&quot;&gt;Download&lt;/a&gt;&lt;sup&gt;RAW-&gt;Save-As&lt;/sup&gt; (lic. &lt;a href=&quot;https://opensource.org/licenses/MIT&quot; rel=&quot;nofollow noreferrer&quot;&gt;MIT&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Uncompressed:          284 394&#xA;7z 9.38 beta:           73 585&#xA;File name:    jquery-1.11.3.js&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Binary Media&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#1&lt;/strong&gt; - JPG - &quot;Flower in the Garden&quot;: &lt;a href=&quot;https://farm4.staticflickr.com/3821/19952369211_a69f6cfcb4_o_d.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;Download&lt;/a&gt; (lic. &lt;a href=&quot;https://creativecommons.org/licenses/by-nc-nd/2.0/&quot; rel=&quot;nofollow noreferrer&quot;&gt;CC-BY-NC-ND 2.0&lt;/a&gt; &amp;amp; &amp;copy; &lt;a href=&quot;https://www.flickr.com/photos/129666686@N02/&quot; rel=&quot;nofollow noreferrer&quot;&gt;wellenkern&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Uncompressed: 10 482 521&#xA;7z 9.38 beta: 10 434 631&#xA;File name:    flower.jpg&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#2&lt;/strong&gt; - MP3 - &quot;Mariam's Cake&quot; by Robin Grey: &lt;a href=&quot;http://freemusicarchive.org/music/Robin_Grey/The_Nearest_Door/01_Mariams_Cake_17&quot; rel=&quot;nofollow noreferrer&quot;&gt;Download&lt;/a&gt; (lic. &lt;a href=&quot;http://creativecommons.org/licenses/by-nc-sa/3.0/&quot; rel=&quot;nofollow noreferrer&quot;&gt;CC-BY-NC-SA 3.0&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Uncompressed: 8 468 990&#xA;7z 9.38 beta: 8 162 146&#xA;File name:     cake.mp3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#3&lt;/strong&gt; - Bitmap24 - DP1M7218 16:9 COLOR: &lt;a href=&quot;http://workupload.com/file/253Rq6mR&quot; rel=&quot;nofollow noreferrer&quot;&gt;Download&lt;/a&gt; (lic. &lt;a href=&quot;https://creativecommons.org/licenses/by-sa/2.0/&quot; rel=&quot;nofollow noreferrer&quot;&gt;CC-BY-SA 3.0&lt;/a&gt; &amp;amp; &amp;copy; &lt;a href=&quot;https://www.flickr.com/photos/77110866@N05/&quot; rel=&quot;nofollow noreferrer&quot;&gt;iKobe!&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Uncompressed: 37 834 326&#xA;7z 9.38 beta: 14 652 746&#xA;File name:    street.bmp&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#4&lt;/strong&gt; - MP4 - &quot;Home 5x5&quot;: &lt;a href=&quot;http://workupload.com/file/U3ZAVean&quot; rel=&quot;nofollow noreferrer&quot;&gt;Download&lt;/a&gt; (lic. &lt;a href=&quot;http://creativecommons.org/licenses/by/3.0/&quot; rel=&quot;nofollow noreferrer&quot;&gt;CC-BY 3.0&lt;/a&gt; &amp;amp; &amp;copy; &lt;a href=&quot;https://vimeo.com/mikedjones&quot; rel=&quot;nofollow noreferrer&quot;&gt;Michael Jones&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Uncompressed: 6 173 898&#xA;7z 9.38 beta: 6 013 047&#xA;File name:     home.mp4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#5&lt;/strong&gt; - binary - Block of cryptographically secure random data, a.k.a. &quot;The Incompressible File&quot;: &lt;a href=&quot;http://workupload.com/file/Qmn65VkJ&quot; rel=&quot;nofollow noreferrer&quot;&gt;Download&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Uncompressed: 100 000&#xA;7z 9.38 beta: 100 129&#xA;File name:    rnd.bin&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;(De/)Compression Program and Algorithm&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The program used to compress and decompress a file is the compiled executable (or executable script).&lt;/li&gt;&#xA;&lt;li&gt;You may use two or more programs and ship additional files if needed, however only one program per step (a step is de- or compression) is executed.&lt;/li&gt;&#xA;&lt;li&gt;No program or part of a program is allowed to request resources that are not included in your distribution. Exceptions are standard system resources (clean install, i.e. a Java runtime would not be available when you use Windows).&lt;/li&gt;&#xA;&lt;li&gt;You may use linux-, windows- or architecture-specific code.&lt;/li&gt;&#xA;&lt;li&gt;You must not modify files or file names. The file names listed above are binding. Note: Some downloads may not carry the file name, you have to rename them (case-sensitive). The file names of compressed files do not matter. However, the original file names must be restored after decompression.&lt;/li&gt;&#xA;&lt;li&gt;You can use any existing or new algorithm. Content mixing is of course allowed, however, you may not call any compression routines available on your system (or language). You program must be a self-contained implementation.&lt;/li&gt;&#xA;&lt;li&gt;Your algorithm must not specifically target this corpus, it has to be general purpose. You are however allowed to target the used file types (e.g. by identifying the type via &quot;Magic Bytes&quot; and adjusting the algorithm accordingly).&lt;/li&gt;&#xA;&lt;li&gt;The (de)compression program only accepts one argument, a file name. Piping program output somewhere or providing anything else is forbidden. (I.e. you'll have to write the output file yourself).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Running your entry&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your compression program is called 15 times, once for every file in the corpus:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;comp articles.law&#xA;comp ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This process must produce 15 compressed files on disk in the same directory (original files can be overwritten). (comp is just an example name, you don't have to use this name)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Decompression is similar. Your decompression program (which may be the same executable) is called 15 times, once for every file in the corpus:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;decomp ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;...&lt;/code&gt; is the file name of the compressed file. This will produce the original 15 files on disk (with their original file names) (compare the SHA256 when in doubt).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Neither the compression or decompression program may take any additional command line parameters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your score is &lt;code&gt;P+C&lt;/code&gt;, where&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;P&lt;/code&gt; is the size of all programs used in your distribution&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;C&lt;/code&gt; is 15 files, the compressed corpus&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;in bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your answer must include the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The source code for all parts of &lt;code&gt;P&lt;/code&gt;. (&lt;strong&gt;Is not counted in the score&lt;/strong&gt;).&lt;/li&gt;&#xA;&lt;li&gt;A link to a GitHub repository containing both &lt;code&gt;P&lt;/code&gt; and &lt;code&gt;C&lt;/code&gt;. Means you actually have to run your solution and include all compressed files. If your repository features additional files that should not be included in your score (gitignore, README etc.), put the scored files in a separate folder.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;To beat someones score, your score has to beat it by at least 10 bytes. If some answer has the score &lt;code&gt;X&lt;/code&gt;, then your answer has to have a score of &lt;code&gt;N &amp;lt;= X-10&lt;/code&gt;, where &lt;code&gt;N&lt;/code&gt; is your score. The starting score is set by 7z.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Invalid Answers&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please refrain from posting invalid answers, such as:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Answers without source code for &lt;code&gt;P&lt;/code&gt;,&lt;/li&gt;&#xA;&lt;li&gt;answers without compressed files, or where compressed files run against &lt;code&gt;P&lt;/code&gt; produce anything but the original corpus,&lt;/li&gt;&#xA;&lt;li&gt;answers that contain only partial solutions.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For clarity, here's how an answer might look like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;I did this algorithm X. This code is used for compression:&#xA;&#xA;&amp;lt;comp.c&amp;gt;&#xA;&#xA;and this for decompression:&#xA;&#xA;&amp;lt;decomp.c&amp;gt;&#xA;&#xA;I used windows, my score therefore is 9001:&#xA;&#xA;comp.exe:          234 bytes&#xA;decomp.exe:        124 bytes&#xA;Compressed files: 8643 bytes&#xA;&#xA;You can download the programs and compressed files from my&#xA;repository here: github.com/foobar42.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Leaderbaord and History&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Current score&lt;/strong&gt;: 423,424 (P) + 40,229,661 (C) = &lt;strong&gt;40,662,085&lt;/strong&gt;&lt;br&gt;&#xA;Set by: 7z 9.38 beta (Win32) on 2015-12-18&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; rel=&quot;tag&quot;&gt;compression&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user42643" LastEditorDisplayName="user42643" LastEditDate="2015-12-18T21:02:44.070" LastActivityDate="2015-12-18T21:02:44.070" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7750" PostTypeId="2" ParentId="7744" CreationDate="2015-12-18T07:52:02.627" Score="4" Body="&lt;h1&gt;Every language has its first users&lt;/h1&gt;&#xA;&lt;p&gt;APL seemed quite esoteric to most people. It has some weird symbols like ⍋ for sorting, ⍉ for transpose, ⍣ for repetition, ⌊ and ⌈ for rounding down and up. The last two also had some weird names like floor and ceiling... weird only if they weren't accepted by more people and didn't become the standard mathematical symbols nowadays.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-18T07:52:02.627" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7753" PostTypeId="2" ParentId="2140" CreationDate="2015-12-18T14:34:21.470" Score="0" Body="&lt;p&gt;I was thinking about a challenge on wrapping time.&lt;/p&gt;&#xA;&lt;p&gt;I am a member here for 34 days now. I would have expected for the date to wrap to 1 month.&lt;/p&gt;&#xA;&lt;h3&gt;Rules:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;starting with hours from the joining date to now.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;first wrapping happens when you go over 24 hours, the count will be in days now.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;second wrapping happens after reaching 30 or 31 days, you can decide, to months.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;third wrapping really wraps when a year is reached, it shall be displayed as i.e. 2 years 3 month.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;round to neares full unit, i.e. 43 days = 1 month, 50 days = 2 month&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;take either a build in function to get the current time or hardcode it to ´2015-12-19-11´ &amp;lt;- time when challenge will be posted. If hardcoding it is shorter you may take the bytecount from the hardcoded version.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Dates after the current or hardcoded date can do whatever.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;The joining date and hour like ´YYYY-MM-DD-HH´ the delimeter does not have to be a - choose whatever you like.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;The time according to the rules above.&lt;/p&gt;&#xA;&lt;h3&gt;Example:&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;In: 2015-12-10&#xA;Out: 9 Days&#xA;&#xA;In: 2015-10-28&#xA;Out: 2 Month&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="47308" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-20T22:14:22.690" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7755" PostTypeId="2" ParentId="2140" CreationDate="2015-12-18T22:05:51.820" Score="0" Body="&lt;p&gt;&lt;strong&gt;New user to Programming Puzzles!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Spades CHALLENGE!!!&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would like a king of the hill challenge for bots playing the game of spades.  Spades is a card game.  The rules are shown on &lt;a href=&quot;https://en.wikipedia.org/wiki/Spades&quot; rel=&quot;nofollow&quot;&gt;wikipedia&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Nils allowed, with 50 points for completion (not 100).  -50 for losing.&lt;/li&gt;&#xA;&lt;li&gt;10 points a hand, with sandbagging allowed.&lt;/li&gt;&#xA;&lt;li&gt;Partnership Playing&lt;/li&gt;&#xA;&lt;li&gt;Sum of all four players hands cannot equal 13!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Winner is first to 500 points.  The bot will be paired with all other bots entered into the competition.  The pair of winners will be crowned with +10 meta-points (Mpoints), losers will get -1 Mpoints. Whoever has the most Mpoints wins - ties based upon sum of points earned in the games.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Gameplay:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The bot with the lowest Mpoints bids first.  Bidding proceeds from down until reaching 4th slot, then goes back to first slot and continues.  Play starts with this player.&lt;/li&gt;&#xA;&lt;li&gt;The bot will be given a string of cards - AS for Ace of Spades, JC for Jack of Clubs, 2D for 2 of Diamonds, 8H for 8 of hearts, randomly dealt from a single 52-card deck.  Each will be comma separated: &lt;em&gt;AS,JC,2D,8H,4C,5S,8D,3D,3S,JS,10S&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;The bot will get the bids from the other bots before making the bid.&lt;/li&gt;&#xA;&lt;li&gt;Upon winning a hand, the bot gets to continue making plays until someone else wins the hand.&lt;/li&gt;&#xA;&lt;li&gt;Hands are scored at the end using the scoring rules.  If a team's score is less than 500, gameplay continues with a new hand.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, I do not know how to setup the servers or any of that stuff.  I just think the challenge will be interesting.  If anyone can help with that, run with it.  I like to watch these challenges unfold - but I'm too much of an engineer and not enough of a programmer to make these kinds of programming happen.&lt;/p&gt;&#xA;" OwnerUserId="42645" LastActivityDate="2015-12-18T22:05:51.820" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7756" PostTypeId="2" ParentId="7683" CreationDate="2015-12-19T12:04:33.513" Score="16" Body="&lt;h1&gt;One time bonus for Nice Questions&lt;/h1&gt;&#xA;&lt;p&gt;This probably won't be implemented. But it seems to be exactly what all you want:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Easy questions getting a lot of upvotes won't be affected much.&lt;/li&gt;&#xA;&lt;li&gt;Questions having a lot of upvotes and downvotes won't be affected much.&lt;/li&gt;&#xA;&lt;li&gt;New users writing bad questions won't be affected much before understanding this situation.&lt;/li&gt;&#xA;&lt;li&gt;Questions having 10 upvotes and no downvotes would be awarded more.&lt;/li&gt;&#xA;&lt;li&gt;Writing many good questions is preferred to writing one extremely popular question, so it really encourages writing questions, instead of posting the idea you had anyway or just being lucky.&lt;/li&gt;&#xA;&lt;li&gt;It wouldn't be much worse to upvote the question for the good answers in it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If changing reputations for upvote / downvote isn't the perfect solution, I'd think it is understandable not making any changes only to revert the changes after problems happen.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-19T12:22:08.857" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7758" PostTypeId="1" AcceptedAnswerId="7759" CreationDate="2015-12-20T03:59:45.577" Score="0" ViewCount="97" Body="&lt;p&gt;This issue has come up after receiving an &lt;a href=&quot;https://codegolf.stackexchange.com/a/67162/46313&quot;&gt;answer&lt;/a&gt; to one of my questions. For the sake of clarity, I asked programs to take in two pieces of input. This answerer found it easier to read the two inputs in as one string and to not put a separator between them (since been changed). 1) Is it reasonable for me to enforce the requirement for two inputs. 2) What does it mean to have multiple inputs when they are coming from STDIN? Do they need to be separated by new lines? Some separator? 3) Finally, is it within the answerer's rights to read multiple inputs into one variable, as such combining multiple inputs into one, or should we require the answerer to read each input into a separate variable?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's very easy to enforce multiple inputs in the context of functions or program arguments, but with STDIN it's less clear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Update:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In light of the knowledge that it is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5437/defaults-for-reading-several-pieces-of-input&quot;&gt;acceptable&lt;/a&gt; to read multiple inputs for functions as a single array parameter, rather than multiple parameters, I now see that as equivalent to reading in delimiter-separated input from STDIN. However, I think a delimiter should be required.&lt;/p&gt;&#xA;" OwnerUserId="46313" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2015-12-21T20:39:48.687" Title="Rules for Multiple Inputs" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7759" PostTypeId="2" ParentId="7758" CreationDate="2015-12-20T04:23:53.637" Score="2" Body="&lt;p&gt;In general, input should be allowed to be taken in whatever form is most convenient for the language/submission.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To address your specific concerns:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Rather than enforcing reading separate inputs, you could enforce the use of a delimiter in the input. Often challenges will say that input will be given with a delimiter of the answerer's choice.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;By default, when multiple inputs are coming from STDIN, they can be delimited by spaces, newlines, commas, etc.—whatever is most convenient for each answer. Occasionally challenges enforce the use of a specific delimiter.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Not all languages even have a concept of variables. Input should be able to be read however is most convenient for the answerer.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;You also said:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;It's very easy to enforce multiple inputs in the context of functions or program arguments, but with STDIN it's less clear.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;By default, multiple inputs don't have to be separate function arguments; the function can take a single array argument, a delimited string argument, or (as I seem to keep saying) whatever is most convenient for the answerer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would recommend that as the challenge maker you should focus on an interesting task rather than on I/O technicalities, as we have a set of defaults that make things unambiguous and allow languages to play to their individual strengths. You're free to make any requirements you want, but often very strict I/O requirements will not be well received by the community.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="20469" LastEditDate="2015-12-20T19:15:43.597" LastActivityDate="2015-12-20T19:15:43.597" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7760" PostTypeId="1" CreationDate="2015-12-20T19:34:55.290" Score="17" ViewCount="435" Body="&lt;p&gt;If you post a code-golf challenge after you designed a code-golfing language, it may be argued that you are somehow at an advantageous position. Knowing your language features may have influenced your challenge choice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With this in mind, I posted a challenge today, answered in a language I had previously created, and added a disclaimer in my answer:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Since the creator of the language and the author of the challenge are the same, this answer is not eligible for winning.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;However, from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/67183/a-multiplication-table-for-the-cheela/67187#comment162773_67187&quot;&gt;comments&lt;/a&gt; to my answer I realized there doesn't seem to be a consensus regarding this. So I'm asking here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What do you think? Some possible positions regarding this are:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The answer is not eligible for winning. This was my initial, perhaps too conservative idea.&lt;/li&gt;&#xA;&lt;li&gt;The answer is eligible, as long as you don't plan a challenge specifically as a use case for a built-in in your language. This is Alex A.'s suggestion.&lt;/li&gt;&#xA;&lt;li&gt;...?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-08-10T13:32:38.087" Title="Can you post a challenge and answer in a language you designed?" Tags="|discussion|" AnswerCount="3" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7761" PostTypeId="2" ParentId="7760" CreationDate="2015-12-20T19:41:15.507" Score="19" Body="&lt;p&gt;I'm slightly side-stepping the question here:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although the whole catalogue experiment backfired in this regard, I still hope that as a community we will gradually move from considering code golf as a challenge for &lt;em&gt;the&lt;/em&gt; shortest overall solution to considering it a separate challenge in each language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In that sense, whether you've created the language yourself, or even whether your language contains a built-in that immensely helps with the challenge, feel free to post your own answer. We shouldn't be comparing different languages in the first place, and anyone else who uses the same language would have the same advantage.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-12-20T19:41:15.507" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7762" PostTypeId="2" ParentId="7760" CreationDate="2015-12-20T19:47:01.743" Score="4" Body="&lt;p&gt;As I wrote in the question, my view is that we should apply the same criterion as for languages created or modified after a challenge: you can post your answer, but it's not eligible for winning.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My view is based on the following reasons:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;When you are creating the challenge you probably have your language in mind, and that may influence how the challenge is designed. You may for example add a special twist (perhaps even unconsciously) that is likely to favour your language.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You probably know your language better than others do.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The combination of thse two items may put you in an advantageous position.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's a specific example:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You think of a nice challenge. It involves using the golden ratio.&lt;/li&gt;&#xA;&lt;li&gt;You realize your language doesn't include the golden ratio as a predefined literal, and it would be nice if it did, as it's obviously a useful constant.&lt;/li&gt;&#xA;&lt;li&gt;You update the language and then post the challenge.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2015-12-20T21:39:58.973" LastActivityDate="2015-12-20T21:39:58.973" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7763" PostTypeId="2" ParentId="7737" CreationDate="2015-12-20T21:53:23.110" Score="35" Body="&lt;h2&gt;Different motivation and expectation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When I write code for an answer on StackOverflow, I'm aiming to give someone a solution to a problem that they have. Obviously I'm expecting them to take the code I write and include it in their project, and unless it's a significant chunk of code I'm not too fussed about attribution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When I write code for an answer on PPCG, it's either as a pure intellectual exercise, an investigation into an interesting topic raised by the question, or an attempt to one-up someone else. &lt;strong&gt;In general I have no expectation that anyone will copy that code&lt;/strong&gt; for any purpose other than to test that it works or to improve it for a follow-up answer to the same question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why might that expectation fail?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A blog post / essay / paper / book about either code golf / optimisation in general or about the abstract problem behind a given question. If someone's quoting my code as an example of how to do something, I want to be credited.&lt;/li&gt;&#xA;&lt;li&gt;There are some answers on here which could potentially be useful for real-world implementations. E.g. &lt;a href=&quot;https://codegolf.stackexchange.com/a/9342/194&quot;&gt;my constant-time AES SubBytes implementation&lt;/a&gt;. But if my code happens to be the best implementation around then, again, I want to be credited.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In short: because answers on PPCG are not written with the intention that other people use the code in &quot;real life&quot;, any answer which someone else wants to use in real life is almost certainly so good that the author would want attribution. The idea that attribution is, by default, not necessary is a hideous one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;It's also against at least the spirit if not the letter of &lt;a href=&quot;http://www.wipo.int/treaties/en/text.jsp?file_id=283698#P123_20726&quot; rel=&quot;nofollow noreferrer&quot;&gt;international treaty&lt;/a&gt;, but if I find the inspiration to write a full answer on that theme then it belongs on the meta.SE discussion, not here.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2015-12-20T21:53:23.110" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7764" PostTypeId="1" AcceptedAnswerId="7765" CreationDate="2015-12-20T22:34:23.557" Score="23" ViewCount="536" Body="&lt;h1&gt;TL;DR&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Look at this: . It's an emote. Found most commonly in it's natural enviroment the iPhone, it looks to be a harmless character.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Until you realize the dastardly thing is really &lt;em&gt;two&lt;/em&gt; characters: &lt;code&gt;\ud83d\ude00&lt;/code&gt;. Uh-oh.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But try to select it. On any sane browser, it is treated as a single character. This leads me into my question. &lt;em&gt;What is a character?&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;More&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There are two conventional systems of scoring in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. Most often is the byte count, the number of UTF-8 (or whatever encoding it uses) literal bytes the code contains. The second is that of character counts, the&amp;hellip; what?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've always thought that a character was a single entity of selectability. However, after playing around with emoticons, I realize that they are often two+ character sequences.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In such challenges where characters are counted, what shall an emoticon be considered? It seems to be the most logical choice to count them as two, when they are indeed two characters, however, by the intuitive definition of a character, they would be counted as one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What is the definition of a character, by our standards?&lt;/p&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2015-12-21T23:58:31.483" Title="What is a character?" Tags="|discussion|" AnswerCount="3" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7765" PostTypeId="2" ParentId="7764" CreationDate="2015-12-20T22:40:02.863" Score="32" Body="&lt;p&gt;A character is a character.&lt;/p&gt;&#xA;&#xA;&lt;p&gt; is a single Unicode character, specifically &lt;a href=&quot;http://www.fileformat.info/info/unicode/char/1F600/index.htm&quot; rel=&quot;nofollow&quot;&gt;U+1F600&lt;/a&gt;. UTF-16 happens to encode it using two &lt;a href=&quot;https://en.wikipedia.org/wiki/UTF-16#U.2BD800_to_U.2BDFFF&quot; rel=&quot;nofollow&quot;&gt;surrogate characters&lt;/a&gt;, but that's not different from UTF-8 encoding it as four bytes.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2015-12-20T22:40:02.863" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="7766" PostTypeId="2" ParentId="7764" CreationDate="2015-12-20T22:40:12.377" Score="17" Body="&lt;p&gt;Nope, that's still &lt;a href=&quot;https://mothereff.in/byte-counter#%F0%9F%98%80&quot; rel=&quot;nofollow&quot;&gt;1 character, 4 bytes&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unicode is weird.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See also: &lt;a href=&quot;http://www.joelonsoftware.com/articles/Unicode.html&quot; rel=&quot;nofollow&quot;&gt;The Absolute Minimum Every Software Developer Absolutely, Positively Must Know About Unicode and Character Sets (No Excuses!)&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="3808" LastEditDate="2015-12-20T22:47:15.860" LastActivityDate="2015-12-20T22:47:15.860" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7768" PostTypeId="2" ParentId="2140" CreationDate="2015-12-21T00:24:13.300" Score="5" Body="&lt;h1&gt;Verify a game of Morpion Solitaire&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphs&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphs&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphs&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.morpionsolitaire.com/English/Rules.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Morpion Solitaire&lt;/a&gt; is an interesting, unsolved &quot;single-player game&quot;. (The linked site lists several variants - we're talking about 5T here.) It has been proven that solving or even approximating it is NP-hard. But we're going to do something simpler here: your challenge will be to verify whether the game has been played correctly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The rules are fairly simple. You start on a regular (infinite) grid, with 36 intersections marked in the following shape:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/SJKbF.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/SJKbF.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now a move consists of drawing a straight line segment, orthogonally or 45 degrees with the grid, through four marked and one unmarked intersection. The unmarked intersection will then be marked for future moves:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/H78Rm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/H78Rm.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt; &lt;a href=&quot;https://i.stack.imgur.com/PzDk9.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/PzDk9.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt; &lt;a href=&quot;https://i.stack.imgur.com/pyeEJ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/pyeEJ.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/op91r.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/op91r.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt; &lt;a href=&quot;https://i.stack.imgur.com/RYHbI.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/RYHbI.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt; &lt;a href=&quot;https://i.stack.imgur.com/QNerV.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/QNerV.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The lines may cross or touch, but they must never overlap (notice that the last move shares an endpoint in a straight line with an earlier move, but does not overlap with it). The goal of the game is to make as many move as possible. &lt;a href=&quot;http://www.morpionsolitaire.com/English/RecordsGrids5T.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;The world record&lt;/a&gt; is at 178 moves.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because the grid gets very messy after a while, it becomes very hard to reconstruct a game. People work around this problem, by writing consecutive numbers into the intersections they add. However, even when this is not done, it is always possible to verify the validity of game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Further reading:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.morpionsolitaire.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Morpion Solitaire&lt;/a&gt;: the full page the rules link was taken from. Beware of iframes.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Join_Five&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia article&lt;/a&gt;: note that this uses a different initial setup.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You're given an ASCII representation of a played game of Morpion Solitaire (the game may or may not be finished). Every other cell represents an intersection, which can be either unmarked (&lt;code&gt;.&lt;/code&gt;), one of the initial intersections (&lt;code&gt;o&lt;/code&gt;) or one of the intersections added by a move (&lt;code&gt;#&lt;/code&gt;). All other cells are either spaces, or one of &lt;code&gt;-&lt;/code&gt;, &lt;code&gt;|&lt;/code&gt;, &lt;code&gt;/&lt;/code&gt;, &lt;code&gt;\&lt;/code&gt;, &lt;code&gt;X&lt;/code&gt; indicating that a line-segment was drawn across the two adjacent intersections. The example above would look like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;. . . . . . . . . . . .&#xA;&#xA;. . . . o-o-o-o-# . . .&#xA;        |/     /       &#xA;. . . . o . . o . . . .&#xA;       /|    /         &#xA;. . . # o . # o . . . .&#xA;     /  |  /           &#xA;. o-o-o-o-# . o o o o .&#xA;   /    |/             &#xA;. o . . # . . . . . o .&#xA;        |              &#xA;. o . . # . . . . . o .&#xA;        |              &#xA;. o o o o . . o o o o .&#xA;        |              &#xA;. . . . o . . o . . . .&#xA;        |              &#xA;. . . . o . . o . . . .&#xA;&#xA;. . . . o o o o . . . .&#xA;&#xA;. . . . . . . . . . . .&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output a truthy value if the game represented by graph can be played by following the rules, and a falsy value otherwise.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may write a program or function, taking input via STDIN (or closest alternative), command-line argument or function argument and outputting the result via STDOUT (or closest alternative), function return value or function (out) parameter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may assume that the initial intersections always form the cross shape displayed above (although I doubt any answers will be affected by this).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code should solve any of the test &lt;strong&gt;in less than 5 seconds&lt;/strong&gt;. This should not be an issue as very efficient solutions exist.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Notes&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Will add test cases...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2015-12-21T17:59:13.290" LastActivityDate="2015-12-21T17:59:13.290" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="7769" PostTypeId="1" CreationDate="2015-12-21T02:04:36.310" Score="9" ViewCount="330" Body="&lt;p&gt;I saw &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7764/what-is-a-character&quot;&gt;this question&lt;/a&gt; recently, and I was wondering the title of my question. Essentially is stuff like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;H̠̹͖&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A single character in reference to questions that count characters? If so, I could theoretically create a language that does any challenge in a single &quot;character&quot; by programming it in the zalgo areas of the character.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2015-12-21T02:21:32.827" Title="Is a single Zalgo character considered a single character?" Tags="|discussion|policy|characters|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7770" PostTypeId="2" ParentId="7769" CreationDate="2015-12-21T02:15:56.287" Score="23" Body="&lt;p&gt;Again, just as I answered on the linked question, &lt;a href=&quot;https://mothereff.in/byte-counter#H%CC%A0%CC%B9%CD%96&quot; rel=&quot;nofollow&quot;&gt;according to a simple char/byte counting tool&lt;/a&gt;, that's 4 chars, 7 bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Combining diacritical marks are counted as separate Unicode characters.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2015-12-21T02:15:56.287" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7771" PostTypeId="2" ParentId="7769" CreationDate="2015-12-21T02:21:32.827" Score="9" Body="&lt;h1&gt;No.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A simple search shows that &lt;a href=&quot;https://en.wikipedia.org/wiki/Combining_Diacritical_Marks&quot; rel=&quot;nofollow&quot;&gt;combining diacritical marks&lt;/a&gt; are used. These are all their own character, so &lt;code&gt;H̠̹͖&lt;/code&gt; &gt; 1 char. &#xA;They use codepoints U+0300 to U+036F. If you have &lt;code&gt;̃.&lt;/code&gt;, it has 2 Unicode codepoints -- U+002E and U+0303 -- that is definitely not 1 char.&lt;/p&gt;&#xA;" OwnerDisplayName="user46167" LastActivityDate="2015-12-21T02:21:32.827" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7772" PostTypeId="2" ParentId="2140" CreationDate="2015-12-21T11:20:38.417" Score="3" Body="&lt;h2&gt;Juggling without collisions &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Determine if a &lt;a href=&quot;https://en.wikipedia.org/wiki/Siteswap&quot; rel=&quot;nofollow noreferrer&quot;&gt;siteswap&lt;/a&gt; juggling pattern is valid, meaning that no two balls land on the same beat. Fewest bytes wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; A non-empty list of positive integers.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt; A consistent &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2190/interpretation-of-truthy-falsey&quot;&gt;Truthy&lt;/a&gt; value for valid or &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2190/interpretation-of-truthy-falsey&quot;&gt;Falsey&lt;/a&gt; value for invalid.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Siteswap&quot; rel=&quot;nofollow noreferrer&quot;&gt;Siteswap&lt;/a&gt; is a notation for juggling patterns. Dividing time into units called beats, a siteswap pattern says how high to throw the ball each beat, measured in beats that it's airborne until you catch it. For example, the pattern&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;4 2 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;says&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;On the first beat &lt;code&gt;t=1&lt;/code&gt;, throw the ball &lt;code&gt;4&lt;/code&gt; beats high, so you catch it at &lt;code&gt;t=5&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;On the second beat &lt;code&gt;t=2&lt;/code&gt;, throw the ball &lt;code&gt;2&lt;/code&gt; beats high, so you catch it at &lt;code&gt;t=4&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;On the third beat &lt;code&gt;t=3&lt;/code&gt;, throw the ball &lt;code&gt;3&lt;/code&gt; beats high, so you catch it at &lt;code&gt;t=6&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If we treat this pattern as a periodic sequence&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;... 4 2 3 4 2 3 4 2 3 4 2 3 4 2 3 4 2 3 ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;note that on every beat, you catch exactly one ball. But, in&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 5 1 3 4 2 ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;the ball thrown for &lt;code&gt;5&lt;/code&gt; beats at &lt;code&gt;t=1&lt;/code&gt; and the ball thrown for &lt;code&gt;3&lt;/code&gt; beats at &lt;code&gt;t=3&lt;/code&gt; both come down at &lt;code&gt;t=6&lt;/code&gt;, which we don't want (let's ignore that we have two hands). This happens whenever two numbers in the sequence have the same different as the number of beats between them, with the bigger on first. Note that this may happen across repetitions, like in &lt;code&gt;8 1 2&lt;/code&gt;, where the marked balls collide at &lt;code&gt;*&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; v             v *&#xA; 8 1 2 8 1 2 8 1 2 8 1 2 ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;TODO: Test cases.&lt;/p&gt;&#xA;&lt;p&gt;Sandbox: Does the explanation make sense? Is it too long for the challenge?&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-21T11:26:15.127" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7773" PostTypeId="2" ParentId="7683" CreationDate="2015-12-21T16:22:27.403" Score="-13" Body="&lt;h2&gt;Alternative: Give more rep every time someone answers a challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I know I'm late to respond here so the wagon may have already left the station, but it seems to me we want to award &lt;strong&gt;good, enjoyable challenges&lt;/strong&gt;, not just anything posted. An indication of a good challenge is the number of people who take part in it. So instead of making the initial rep for a challenge higher, we should award additional rep every time someone posts an answer to a challenge.&lt;/p&gt;&#xA;" OwnerUserId="48231" LastActivityDate="2015-12-21T16:22:27.403" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7776" PostTypeId="2" ParentId="7764" CreationDate="2015-12-21T23:52:53.097" Score="4" Body="&lt;pre&gt;&lt;code&gt;$ printf  | wc&#xA;       0       1       4&#xA;$ &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;1&lt;/strong&gt; character and &lt;strong&gt;4&lt;/strong&gt; bytes (as the other answers point out).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Certain applications (generally those dealing with fixed-width fonts, e.g terminals and text editors) choose to &lt;strong&gt;display&lt;/strong&gt; such characters over the space of 2 &quot;normal&quot; characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But character rendering by specific apps has nothing to do with byte/character count, especially for the purposes of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="11259" LastEditDate="2015-12-21T23:58:31.483" LastActivityDate="2015-12-21T23:58:31.483" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7777" PostTypeId="1" AcceptedAnswerId="7786" CreationDate="2015-12-22T01:36:58.840" Score="19" ViewCount="647" Body="&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1346/3808&quot;&gt;When is it allowable to change the rules?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As noted in the linked meta post above, it's typically particularly frowned upon to significantly change the rules of a challenge after posting it. There's no hard and fast rule on this yet, so the purpose of this meta post is to enact at least some kind of &lt;strong&gt;policy to determine when drastic edits should be rolled back&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here, we define &quot;rule change&quot; as not any type of edit but &lt;strong&gt;any edit that causes one or more reasonable hypothetical answers to become invalid beyond repair&lt;/strong&gt;. Note that the &quot;beyond repair&quot; clause means that this &lt;em&gt;does not include&lt;/em&gt; minor rule changes such as input/output format. Note that the wording of this definition also (intentionally) does not include edits that give answers &lt;em&gt;additional&lt;/em&gt; liberties.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are a few &quot;poll-style&quot; answers here to vote / comment on:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7778/3808&quot;&gt;Should rule changes that don't invalidate existing answers be allowed?&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7779/3808&quot;&gt;Should rule changes that invalidate one or more existing answers be allowed?&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7780/3808&quot;&gt;Do rule changes in comments count?&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Adding your own answer is encouraged, though, possibly addressing some of the following questions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Exactly what it says in the title: If you do think that some rule changes should be acceptable, which ones specifically and in what situations?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If we're going with &quot;rule changes are only allowed if they're minor enough,&quot; how do we define a &quot;major&quot; rule change?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you think the policy should be something other than something that was mentioned here, what is it, and who gets to decide which rule changes are allowed?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2019-12-07T00:11:39.477" Title="When should rule changes count?" Tags="|discussion|policy|" AnswerCount="5" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7778" PostTypeId="2" ParentId="7777" CreationDate="2015-12-22T01:36:58.840" Score="8" Body="&lt;p&gt;Rule changes that don't invalidate existing answers should be allowed (they should not be rolled back).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(Upvote if you agree, downvote if you disagree, and comment for anything else.)&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="3808" LastEditDate="2015-12-22T15:44:49.650" LastActivityDate="2015-12-22T15:44:49.650" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="7779" PostTypeId="2" ParentId="7777" CreationDate="2015-12-22T01:37:43.840" Score="2" Body="&lt;p&gt;Rule changes that invalidate existing answers should be allowed (they should not be rolled back).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(Upvote if you agree, downvote if you disagree, and comment for anything else.)&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="3808" LastEditDate="2015-12-22T15:45:18.220" LastActivityDate="2015-12-22T15:45:18.220" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7780" PostTypeId="2" ParentId="7777" CreationDate="2015-12-22T01:38:09.570" Score="-26" Body="&lt;p&gt;Rule changes in comments are equally valid as those that have been edited into the actual post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(Upvote if you agree, downvote if you disagree, and comment for anything else.)&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="3808" LastEditDate="2015-12-22T01:49:38.497" LastActivityDate="2015-12-22T01:49:38.497" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7781" PostTypeId="2" ParentId="7683" CreationDate="2015-12-22T03:59:35.743" Score="-12" Body="&lt;h1&gt;Yes, but make it cost reputation to downvote questions&lt;/h1&gt;&#xA;&lt;p&gt;I'm definitely all for the increase in reputation for upvotes on questions, and whether or whether not downvotes scale is also up for debate.&lt;/p&gt;&#xA;&lt;p&gt;But, I think it should cost reputation to downvote questions, and should probably be -1, the same as for answers. The reason it &lt;a href=&quot;http://blog.stackoverflow.com/2011/06/optimizing-for-pearls-not-sand/&quot;&gt;currently does not cost any reputation to downvote&lt;/a&gt; is because this motivates users to vote on questions more, which doesn't make sense if this site isn't really about questions at all, like other SE Networks.&lt;/p&gt;&#xA;&lt;p&gt;I think it should cost -1 reputation to downvote questions&lt;/p&gt;&#xA;" OwnerUserId="20634" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-14T23:58:07.023" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7782" PostTypeId="2" ParentId="2140" CreationDate="2015-12-22T08:39:17.410" Score="6" Body="&lt;h1&gt;Capsa, a card game KotH!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/card-games&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;card-games&amp;#39;&quot; rel=&quot;tag&quot;&gt;card-games&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Capsa, known by many times, including the name &lt;a href=&quot;https://en.wikipedia.org/wiki/Big_Two&quot; rel=&quot;nofollow noreferrer&quot;&gt;Big Two&lt;/a&gt; in English, is a popular card game in East Asia and South East Asia, especially throughout China, Hong Kong, Indonesia, Macau, Malaysia, Singapore and Taiwan. There are many variations and house rules. The rules of this particular variation are thus:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This game will be played between exactly four bots. The cards are dealt between everyone, so that everyone has 13 cards.&lt;/li&gt;&#xA;&lt;li&gt;Rank is ordered with 2s before As as follows: 2, A, K, Q, J, 10, 9, 8, 7, 6, 5, 4, 3, hence, the name &lt;em&gt;Big Two&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Suits are ordered as follows: Spades, Hearts, Clubs, Diamonds&lt;/li&gt;&#xA;&lt;li&gt;Ordering runs rank first then suit. Thus, 7 of Hearts &gt; 7 of Diamonds &gt; 6 of Hearts, the lowest card is the 3 of Diamonds, and the highest, the 2 of Spades&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You can play cards in sets of one, two or five cards, (singles, pairs, or five-card poker hands). Each set must always be bigger than the one before.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With singles, play may proceed in this way: &lt;code&gt;1 3H, 2 4H, 3 5D, 4 5C, 1 10S, 2 Pass, 3 JD, 4 Pass, 1 2S, 3 Pass&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pairs are ordered by the higher suit in the pair. &lt;code&gt;6C6H&lt;/code&gt; is of a lower rank than &lt;code&gt;6D6S&lt;/code&gt;. Play may proceed in this way: &lt;code&gt;3 3D3C, 4 6D6H, 1 6D6S, 2 JHJS, 3 Pass, 4 ADAC, 1 Pass, 2 Pass&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Poker hands are ordered in the following way, from lowest in rank to highest in rank:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Straight: Five cards that are consecutive in rank, e.g. &lt;code&gt;6H 7S 8D 9H 10C&lt;/code&gt; or &lt;code&gt;JS QH KD AS 2C&lt;/code&gt;. Rank is determined by the highest card, with suit used as a tie-breaker.&lt;/li&gt;&#xA;&lt;li&gt;Flush: Five cards with the same suit, e.g. &lt;code&gt;5H 7H 10H QH AH&lt;/code&gt; Rank is determined first by suit, then by highest card.&lt;/li&gt;&#xA;&lt;li&gt;Full house: A three of a kind with a two of a kind, e.g. &lt;code&gt;JD JS JH 3D 3S&lt;/code&gt;. Rank is determined by the triple, without regard for the pair.&lt;/li&gt;&#xA;&lt;li&gt;Straight flush: Five cards that are consecutive in rank and are all of the same suit, e.g. &lt;code&gt;6H 7H 8H 9H 10H&lt;/code&gt;. Ranked the same as straights, with suit as a tie-breaker&lt;/li&gt;&#xA;&lt;li&gt;Four-of-a-kind: Four cards of the same rank, with any 5th card, e.g. &lt;code&gt;9D 9C 9H 9S 4S&lt;/code&gt; This hand is known as the bomb. Wins any round of poker hands it is played in, unless someone else plays their own bomb.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Any five-card hand that is higher than the previous five-card hand played is eligible. For example, you can play a full house on a straight.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rules of play:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;At the beginning of the game, the cards are dealt between everyone, so that everyone has 13 cards. The first player is the one that holds the 3 of Diamonds and they must play this card first, whether singly, with another 3 in a pair, or in a poker hand.&lt;/li&gt;&#xA;&lt;li&gt;A round begins with the first player playing a single card, a pair or a poker hand. Every other player either respond with the same number of cards (you must play singles on singles, never a pair or a poker hand), or that player passes for that round.&lt;/li&gt;&#xA;&lt;li&gt;A player may pass even when they have a playable card, but they must pass if none of their cards are high enough in rank, that is, if they have no playable cards. For example, in a round of poker hands, if you only have a flush as a five-card set, but another player has already played a full house, you must pass, as your flush is too low.&lt;/li&gt;&#xA;&lt;li&gt;The round ends when all but one player passes. That last player wins the round and starts the next round.&lt;/li&gt;&#xA;&lt;li&gt;The game ends when one player has played all of their cards.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Possible scoring systems:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bots are judged by the number of games they win over (TBD) games that they play. So if we have seven bots to test, we'll play them until every bot has played more than (TBD) games.&lt;/li&gt;&#xA;&lt;li&gt;Bots are judged by the number of cards they have left at the end of the game. (The winner will obviously have 0 cards at the end of the game).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/Sherlock9/Capsa-KotH&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here is the link to a preliminary controller and two bots to test against&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="47581" LastEditorUserId="47581" LastEditDate="2015-12-31T17:50:11.860" LastActivityDate="2015-12-31T17:50:11.860" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7783" PostTypeId="2" ParentId="7777" CreationDate="2015-12-22T09:27:08.447" Score="14" Body="&lt;h1&gt;In support of allowing rule changes that invalidate existing answers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Closing loopholes&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Suppose you've posted a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenge about finding factors of integers. Suppose the description of the challenge is &quot;You will be given a positive integer. You must output a proper factor of this integer as quickly as possible.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, suppose that someone answers with a submission that always returns 1. Technically, this is a valid solution to the challenge as stated. However, it is a trivial solution, and nothing of value is lost by changing the question to say &quot;proper factor greater than 1&quot;. This does invalidate the existing solution, and it is a rule change, but it brings the rules in line with the clear intent of the poster and improves the challenge with no real loss.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Obviously, there is a fine line between closing loopholes and real changes to the rules, but we should allow closing loopholes, even if answers which exploit them have been posted.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="20080" LastEditDate="2019-12-07T00:11:39.477" LastActivityDate="2019-12-07T00:11:39.477" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="7784" PostTypeId="2" ParentId="7760" CreationDate="2015-12-22T09:27:09.213" Score="11" Body="&lt;p&gt;Firstly, I think the concept of creating a language or adding a built-in specifically for a challenge just to get a solution in one (or zero) bytes isn't even cheating; it's just boring.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What's the point in golfing if all you do is write a fancy long solution, make your program just require an empty input file and call it an interpreter?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think answers in such languages should be allowed and eligible to win as long as the language was created/updated before the challenge, but still I'd recommend the creators of the challenges to listen to their conscience before accepting any &quot;cheating&quot; answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More general-purpose additions to the language just before posting a challenge, like the golden ratio example from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7762/30164&quot;&gt;Luis&lt;/a&gt;, shouldn't hurt that much, but if you implement something that clearly won't be useful later, it seems like plain old cheating to me.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;After this point, my answer will be somewhat off the question, and more of a reply to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7761/30164&quot;&gt;Martin&lt;/a&gt;. (Sorry about the wall-of-text.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I partially agree with Martin in that we shouldn't &lt;em&gt;always&lt;/em&gt; compete between &lt;em&gt;all&lt;/em&gt; languages. However, I think that competition between somewhat similar languages is a healthy feature of code golf. For example, languages could be divided like this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the &quot;cheating&quot; languages&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://esolangs.org/wiki/HQ9%2B&quot; rel=&quot;nofollow noreferrer&quot;&gt;HQ9+&lt;/a&gt;, &lt;a href=&quot;http://esolangs.org/wiki/Help,_WarDoq!&quot; rel=&quot;nofollow noreferrer&quot;&gt;Help, WarDoq!&lt;/a&gt; and others discussed earlier&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;the &quot;meant for golfing&quot; languages&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Pyth, CJam and all the other old &amp;amp; new ones&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;the &quot;usable for golfing&quot; languages&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Python, C, Haskell, TI-Basic and friends&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;the &quot;bad for golfing, but still fun&quot; languages&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Java, C# and other verbose ones&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;the &quot;challenging to use at all&quot; languages&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Brainfuck, Befunge, Malbolge, &lt;a href=&quot;http://esolangs.org/wiki/Shakespeare&quot; rel=&quot;nofollow noreferrer&quot;&gt;Shakespeare&lt;/a&gt; and other, mostly esoteric languages&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I'm not saying this should be any sort of official system; I think most people will still agree that the languages in these groups will often compete at totally different levels. While competition between, for example, C# and CJam, is often rather useless, competition between Java and C# is not, just like between Pyth or CJam.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Contents still need a winner (especially in the SE system where you can only accept one answer), so accepting the shortest valid answer seems like the best practice to me. I do like the idea of not finding &lt;em&gt;the&lt;/em&gt; shortest solution though; for example, not accepting any answer to mark it as a &quot;winner&quot; could be an idea.&lt;/p&gt;&#xA;" OwnerUserId="30164" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2015-12-22T09:27:09.213" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7785" PostTypeId="2" ParentId="2140" CreationDate="2015-12-22T10:53:40.613" Score="0" Body="&lt;h1&gt;Browser identifier&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are three major browsers at the moment, Internet Explorer, Google Chrome and Firefox. Sometimes, the JavaScript engines inside of these browsers work a bit differently, and that can break some applications. Therefore, we need a way to identify what browser the user is currently using!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your answer should be a JavaScript program or function, that when run on the latest version of a browser, should output a string representing that browser. The string outputed could be anything, as long as it stays the same every time you run it. Output should go to a HTML paragraph with id &lt;code&gt;O&lt;/code&gt;, &lt;code&gt;console.log&lt;/code&gt;, or as return value. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please put your answer in a snippet, along with &lt;code&gt;&amp;lt;p id=&quot;o&quot;&amp;gt;&amp;lt;/p&amp;gt;&lt;/code&gt; in the HTML section if your answer uses it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(scoreboard snippet goes here)&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="34543" LastActivityDate="2015-12-22T10:53:40.613" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7786" PostTypeId="2" ParentId="7777" CreationDate="2015-12-22T11:07:14.597" Score="31" Body="&lt;h2&gt;Rule changes are allowed&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;They're often a very bad idea, but I don't think we should forbid them, regardless of whether they invalidate answers or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Most of the time, rule changes are meant to improve the challenge. This can include closing loopholes as isaacg mentioned, but it can also mean just tightening or relaxing the rules slightly if they are found to allow uninteresting solutions which make the interesting ones uncompetitive, or if they are found to disallow interesting solutions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge that sparked this discussion was &lt;a href=&quot;https://codegolf.stackexchange.com/q/67158/8478&quot;&gt;this one&lt;/a&gt;. That's a very good example of a rule change that improves the challenge. In it's original form, brute force was allowed, which would obviously never complete for a square of any interesting size. But efficient solutions exist, and they are a lot more interesting. So adding a time limit after answers were already posted (especially ones which just created random grids until one was valid), definitely improved the question. Early uninteresting answers should not have the power to &quot;lock&quot; a bad challenge in its current state.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yes, invalidated answers are frustrating, and everyone whose answer gets invalidated by a rule change is well within their rights to downvote the challenge (although &lt;em&gt;I personally find it very weird that PPCG is the only SE where you risk being downvoted for improving your post&lt;/em&gt;), but if that allows the challenge to be a better challenge, then I think it's worth the change. In any case, there shouldn't be a blanket rule against changes, because I think it will lead to more abuse (by early answerers) than it will do good.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Challenge authors should still think twice (or three times) if a rule change is worth the trouble. If it invalidates a lot (or the majority) of answers, it's probably not worth it, because many of those invalid answers will remain and it will become a pain to pick out the valid ones. In that case, just learn your lesson for next time. But if it's about disallowing some boring approach that essentially breaks the challenge and has been used once or twice, then go ahead.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for answerers whose answers are invalidated, be a good sportsman and delete (or change) your answer. And before you downvote the challenge for the rule change, consider whether your solution actually added anything valuable to it or whether the challenge isn't actually more interesting if answers like yours aren't valid any more.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-06-20T12:28:55.203" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7789" PostTypeId="2" ParentId="2140" CreationDate="2015-12-22T14:14:30.753" Score="3" Body="&lt;h1&gt;Rational Number to Repeating Numeral Conversion&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As I'm sure you know, the decimal expansion of every rational number is either &lt;strong&gt;terminating&lt;/strong&gt;—consisting of a finite number of digits, or &lt;strong&gt;repeating&lt;/strong&gt;—consisting of infinitely many digits, but ending with a finite pattern that repeats itself indefinitely: for example, the decimal expansion of the rational number 1/6 is &lt;code&gt;0.1666...&lt;/code&gt;, where the sixes repeat forever.&#xA;One way to represent this decimal expansion finitely and unambiguously, is to write the repeating part, called the &lt;strong&gt;repetend&lt;/strong&gt;, enclosed in parentheses:&#xA;going back to the previous example, under this scheme the number 1/6 is written as &lt;code&gt;0.1(6)&lt;/code&gt;.&#xA;We call this representation a &lt;strong&gt;repeating decimal&lt;/strong&gt;.&#xA;Of course, none of this is specific to base 10.&#xA;More generally, we call such a representation, in any base, a &lt;strong&gt;repeating numeral&lt;/strong&gt;.&#xA;Note that, for the sake of this challenge, we use the term &quot;repeating numeral&quot; (or simply, &quot;numeral&quot;) to refer to any numeral written using this scheme, whether or not it actually has a repeating part.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a &lt;strong&gt;program&lt;/strong&gt; or a &lt;strong&gt;function&lt;/strong&gt; taking a pair of integers, &lt;strong&gt;&lt;em&gt;p&lt;/em&gt;&lt;/strong&gt; and &lt;strong&gt;&lt;em&gt;q&lt;/em&gt;&lt;/strong&gt;, and returning a repeating numeral representing the rational number &lt;em&gt;p&lt;/em&gt;/&lt;em&gt;q&lt;/em&gt;.&#xA;You may assume that &lt;em&gt;p&lt;/em&gt; ≥ 0, and &lt;em&gt;q&lt;/em&gt; &gt; 0, so that &lt;em&gt;p&lt;/em&gt;/&lt;em&gt;q&lt;/em&gt; is never negative.&#xA;The resulting numeral should be in &lt;strong&gt;base 10&lt;/strong&gt;, unless you go for the relevant bonus below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is more than one possible numeral representing a given rational number.&#xA;For example, the rational number 1/1 can be represented, among (infinitely many) other options, as &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;1.0&lt;/code&gt;, &lt;code&gt;1.(0)&lt;/code&gt;, &lt;code&gt;0.(9)&lt;/code&gt;, and so on...&#xA;For this challenge, however, we'd like the output to be unique.&#xA;The following set of rules, which your program must follow, takes care of that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;When the integer part of the numeral is zero, there should be a single &lt;code&gt;0&lt;/code&gt; before the radix point.&#xA;For example, given the input 1/2, the output should be &lt;code&gt;0.5&lt;/code&gt;, and not &lt;code&gt;.5&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The repetend, if exists, must begin after the radix point; that is, it shouldn't apply to the integer part.&#xA;For example, given the input 10/9, the output should be &lt;code&gt;1.(1)&lt;/code&gt;, and not &lt;code&gt;(1)&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The output should be finite and minimal, under the above rules.&#xA;This is the most significant rule controlling the output, so it's worth highlighting some of its consequences:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;There should be no leading or trailing zeroes.&#xA;For example, given the input 3/2, the output should be &lt;code&gt;1.5&lt;/code&gt;, and not &lt;code&gt;01.5&lt;/code&gt; or &lt;code&gt;1.50&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the fractional part is zero, it should be omitted.&#xA;For example, given the input 1/1, the output should be &lt;code&gt;1&lt;/code&gt;, and not &lt;code&gt;1.0&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the repetend is zero, it should be omitted.&#xA;For example, given the input 1/2, the output should be &lt;code&gt;0.5&lt;/code&gt;, and not &lt;code&gt;0.5(0)&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When the input admits a terminating numeral, there shouldn't be an unnecessary repetend.&#xA;For example, given the input 1/1, the output should be &lt;code&gt;1&lt;/code&gt;, and not &lt;code&gt;0.(9)&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The repetend, and the rest of the fractional part, should not be superfluous; there shouldn't be any repetition in the repetend itself, nor in the repetend and the rest of the fractional part.&#xA;For example, given the input 1/99, the output should be &lt;code&gt;0.(01)&lt;/code&gt;, and not &lt;code&gt;0.01(01)&lt;/code&gt;, &lt;code&gt;0.(0101)&lt;/code&gt;, or &lt;code&gt;0.0(10)&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;As usual, you may not use any &lt;strong&gt;built-in or library functions&lt;/strong&gt; aimed specifically at this problem.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input and Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You may take the &lt;strong&gt;input&lt;/strong&gt; through the &lt;strong&gt;command line&lt;/strong&gt;, through &lt;strong&gt;STDIN&lt;/strong&gt;, as &lt;strong&gt;function arguments&lt;/strong&gt;, or using an &lt;strong&gt;equivalent method&lt;/strong&gt;.&#xA;You may use &lt;strong&gt;any convenient format&lt;/strong&gt; for the input, but make sure to specify it in your post.&#xA;You may assume that &lt;em&gt;p&lt;/em&gt; and &lt;em&gt;q&lt;/em&gt; are no greater than 10,000,000, to the extent that it helps you to avoid overflow.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may write the &lt;strong&gt;output&lt;/strong&gt; to &lt;strong&gt;STDOUT&lt;/strong&gt;, return it as the &lt;strong&gt;function's result&lt;/strong&gt; or through an &lt;strong&gt;output parameter&lt;/strong&gt;, &lt;strong&gt;as a string&lt;/strong&gt;, or use an &lt;strong&gt;equivalent method&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Score&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;strong&gt;code-golf&lt;/strong&gt;. The &lt;strong&gt;shortest answer&lt;/strong&gt;, in bytes, combined with the any of the &lt;strong&gt;bonuses&lt;/strong&gt;, wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Bonuses&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If, in addition to the requirements listed above, your program satisfies the requirements for any of the following bonuses, &lt;strong&gt;multiply&lt;/strong&gt; your score by the specified amount.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;×0.8 Bonus Support other bases&lt;/strong&gt;&#xA;&lt;br&gt;&#xA;Your program should take a third parameter, &lt;strong&gt;&lt;em&gt;b&lt;/em&gt;&lt;/strong&gt;, which is an integer between 2 and 36, inclusive, and return the corresponding numeral in base &lt;em&gt;b&lt;/em&gt;, instead of base 10.&#xA;The letters of the alphabet, either in lowercase or uppercase, should be used as digits above 9.&#xA;For example, given the input 1/2 and &lt;em&gt;b&lt;/em&gt;=3, the output should be &lt;code&gt;0.(1)&lt;/code&gt;.&#xA;Note that base &lt;em&gt;b&lt;/em&gt; applies only to the &lt;em&gt;output&lt;/em&gt;—if your program takes its input in string form, it should interpret it in base 10.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;×0.6 Bonus &lt;em&gt;O&lt;/em&gt;(1) space complexity&lt;/strong&gt;&#xA;&lt;br&gt;&#xA;Your program's space complexity should be &lt;em&gt;O&lt;/em&gt;(1), where the unit of space is the amount of space required to hold the input.&#xA;In other words, the amount of memory required by your program should, on a large scale, be proportional to the amount of memory required by the input.&#xA;You may not use the fact that the input range is bounded when reasoning about your program's space complexity, other than to the extent of establishing the amount of space required by the input.&#xA;If you go for this bonus, it is &lt;em&gt;strongly advised&lt;/em&gt; that you include at least a brief explanation of your program, so that others can verify that it meets the criterion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your program does not print the output directly, but rather returns a string, you may ignore the space occupied by the string as long as your program only appends to the string, and doesn't modify or read from it otherwise.&#xA;(Note that something like &lt;code&gt;s=s+&quot;0&quot;&lt;/code&gt; is fine, even though it technically involves reading from the string.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each of the test cases below lists the input, &lt;code&gt;p/q&lt;/code&gt;, on the first line, and the corresponding output on the second line.&#xA;Some of the tests list a third parameter, &lt;code&gt;b&lt;/code&gt;, which specifies a different base for the output.&#xA;These tests are only applicable for the relevant bonus.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Short-Output Tests&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program should solve each of the following tests in a matter of &lt;strong&gt;seconds&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0/1&#xA;0&#xA;&#xA;123/123&#xA;1&#xA;&#xA;12/3&#xA;4&#xA;&#xA;1/2&#xA;0.5&#xA;&#xA;1/3&#xA;0.(3)&#xA;&#xA;7/6&#xA;1.1(6)&#xA;&#xA;3/11&#xA;0.(27)&#xA;&#xA;1234/9999&#xA;0.(1234)&#xA;&#xA;7/12&#xA;0.58(3)&#xA;&#xA;22/7&#xA;3.(142857)&#xA;&#xA;123/456&#xA;0.269(736842105263157894)&#xA;&#xA;7124771/4545450&#xA;1.56(745118)&#xA;&#xA;1/68&#xA;0.01(4705882352941176)&#xA;&#xA;678/2345&#xA;0.2(891257995735607675906183368869936034115138592750533049040511727078)&#xA;&#xA;7683/238&#xA;32.2(815126050420168067226890756302521008403361344537)&#xA;&#xA;123631/99999&#xA;1.(23632)&#xA;&#xA;4576/2345&#xA;1.9(513859275053304904051172707889125799573560767590618336886993603411)&#xA;&#xA;2239231/4950000&#xA;0.45236(98)&#xA;&#xA;673/23430&#xA;0.0(2872385830132309005548442168160478019632949210413999146393512590695689)&#xA;&#xA;8984/2318&#xA;3.(875754961173425366695427092320966350301984469370146678170836928386540120793787748058671268334771354616048317515099223468507333908541846419327006039689387402933563416738567730802415)&#xA;&#xA;1/2 2&#xA;0.1&#xA;&#xA;214/5467 13&#xA;0.(067ccb5145334200a07b6253394bc5ca12bc650017b87998acc2c516a7993810702ba1)&#xA;&#xA;214 5467 11&#xA;0.0(481119a34a86245a0053a1022114643a64131367585a8095498942556925833303993816590371976aa2a6952238969a61490900a792044229187a18262724060a517a986785002750566607877532070733842a95a27a4476828a12971701a4740884573649355153)&#xA;&#xA;330420/335923 36&#xA;0.(zero)&#xA;&#xA;9322181/306936 28&#xA;12.ab(cd)&#xA;&#xA;123/6573 29&#xA;0.(0flb8c3hblol)&#xA;&#xA;123/6573 21&#xA;0.0(85669592cjj9ca173fij6g67hhg7g940b5efk6j2bb7276c1ch25ikf7dd070jf4h96hek41ji102h3ea6kb2ic5hc3089b19kjc8dfhaf9147c48kgg4k5ab463d1fd5k86eigacciai54ihj3k2e7aghdbcfeebfbi811b8ajdh521e4ed334d4bgk9f650e1i99dide8j83if205d77kdk15g3be360gj12jki3h6ae09i28f38hkcb9jb018c753a5bjgd8gc044g0fa9geh7j57f0ce624a882a2fg231h0i6da4379)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Long-Output Tests&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following tests produce significantly longer output.&#xA;Instead of listing their full output, only the MD5 checksum of the output if given.&#xA;The checksum is calculated without a trailing newline, and using lowercase letters for digits above 9 (in the relevant test cases).&#xA;If you want to see the full output for these tests, or to calculate the checksum under different conditions, you can use the test snippet below.&#xA;Your program should solve each of the following tests in no more than a few &lt;strong&gt;minutes&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;343/677472&#xA;e1810c85500a97c36f2ba5dcc94a2aa6&#xA;&#xA;234/62332&#xA;662adcee10cd77d001282f0e31a84b77&#xA;&#xA;57628/7894211&#xA;81222aaa93f192c6d8334fcde6381a74&#xA;&#xA;67332/1267232&#xA;3ea190c83a735a8bafc922cbb177e6f4&#xA;&#xA;954/3684332&#xA;d4ef940c9986f9c2ac52ee822d94d6a7&#xA;&#xA;783232/3462241&#xA;7724d3444b5540b8b4f07d13317e8da3&#xA;&#xA;83/7657124&#xA;b295369267f48e642e202e0364898c82&#xA;&#xA;764231/54646224&#xA;ecf7f3dd12f2d495b31a178fc03662d7&#xA;&#xA;6743/1231234&#xA;9f447fd27447abb881795fc5e2f814e5&#xA;&#xA;764/9343249&#xA;8381dc6f127be6d95cadc0b5bdd70104&#xA;&#xA;345/2234448 22&#xA;667d437e35c3825696f64f1b27e6a827&#xA;&#xA;63451/2343324 3&#xA;5d86d77856cc0a15ac8a51b46c2f22d6&#xA;&#xA;93457/546464 2&#xA;1084e884aded53f0da933480c45db1b8&#xA;&#xA;678541/453524 9&#xA;5bb54bddaab7bd933258d4d78a83cdba&#xA;&#xA;4572/2341198 15&#xA;39af2bc67ab58438068f672ed3a8357d&#xA;&#xA;1/4821466 6&#xA;57ba79a48c438b7fd21aa39ee3575c8d&#xA;&#xA;145/5821417 21&#xA;009f087ae661cfd4690cc51ba71a827f&#xA;&#xA;5472/2333645 33&#xA;d24583dfdad205de61763c6a87637979&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Test Snippet&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you want to further test your submission, you can use the following test snippet to find the repeating numeral representation of arbitrary rational numbers, or to find the rational number corresponding to arbitrary repeating numerals.&#xA;Note that the result can get very big, very fast, which can be a little much for your browser; in this case, you might want to uncheck the &quot;Result&quot; checkbox, and check the &quot;MD5&quot; checkbox, to only get the MD5 checksum of the output.&#xA;Note also that you can resize the input and output boxes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;style&amp;gt;* { font-family: sans-serif; }table { border-collapse: collapse; }table &amp;gt; tbody &amp;gt; tr &amp;gt; td { padding: 0px; }#status { display: none; }#status[loading] { display: initial; font-style: italic; }#main { display: none; width:100%; border-right:.7em solid transparent; font-size: 95%; }#main[loaded] { display: table; }#main &amp;gt; tbody &amp;gt; tr + tr &amp;gt; td { padding-top: .25em; }#main &amp;gt; tbody &amp;gt; tr &amp;gt; td + td { padding-left: .5em; }#main &amp;gt; tbody &amp;gt; tr &amp;gt; td:first-of-type { width: 4.25em; }.label { white-space: pre; }#flags { padding-left: 2.4em; font-size: smaller; }#flags &amp;gt; table &amp;gt; tbody &amp;gt; tr &amp;gt; td + td { padding-left: 1em; }#error { display: none; font-size: smaller; color: #880000; }#error[error] { display: initial; }#job_cancel, #job_throbber { display: none; vertical-align: bottom; }#job_cancel[working], #job_throbber[working] { display: initial; }#job_throbber &amp;gt; img { height: 1em; }#job_throbber[working] { padding-left: .3em; }#job_cancel[working] { padding-left: 1em; }#job_cancel &amp;gt; input { height: 1.8em; font-size: small; }input[type=&quot;text&quot;], input[type=&quot;number&quot;], textarea { padding: 0.25em; height: 1.4em; font-family: monospace; }textarea { width: 100%; }#base { width: 2.8em; text-align: right; }.output { background-color: #e4e4e4; border: none; }#length { width: 8em; text-align: right; }#md5 { width: 20em; text-align: center; }#result_container[active=&quot;false&quot;] { display: none; }#md5_container[active=&quot;false&quot;] { display: none; }&amp;lt;/style&amp;gt;&amp;lt;/head&amp;gt;&amp;lt;body&amp;gt;&amp;lt;div id=&quot;status&quot; loading&amp;gt;Loading...&amp;lt;/div&amp;gt;&amp;lt;table id=&quot;main&quot; onkeydown=&quot;handle_key_down(event)&quot;&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td id=&quot;input_label&quot; class=&quot;label&quot;&amp;gt;Fraction:&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;textarea id=&quot;input&quot; oninput=&quot;update(true)&quot; spellcheck=&quot;false&quot;&amp;gt;123/456&amp;lt;/textarea&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td class=&quot;label&quot;&amp;gt;Base:&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;table&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;input id=&quot;base&quot; type=&quot;number&quot; value=&quot;10&quot; spellcheck=&quot;false&quot; oninput=&quot;update(true)&quot;&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td id=&quot;flags&quot;&amp;gt;&amp;lt;table&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;label&amp;gt;&amp;lt;table&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;input id=&quot;flag_result&quot; type=&quot;checkbox&quot; checked onchange=&quot;handle_flag('result')&quot;&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Result&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/label&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;label&amp;gt;&amp;lt;table&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;input id=&quot;flag_md5&quot; type=&quot;checkbox&quot; onchange=&quot;handle_flag('md5')&quot;&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;MD5&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/label&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;label&amp;gt;&amp;lt;table&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;input id=&quot;flag_uppercase&quot; type=&quot;checkbox&quot; onchange=&quot;handle_flag('uppercase')&quot;&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Uppercase&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/label&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;label&amp;gt;&amp;lt;table&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;input id=&quot;flag_trailing_newline&quot; type=&quot;checkbox&quot; onchange=&quot;handle_flag('trailing_newline')&quot;&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Trailing Newline&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/label&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;label&amp;gt;&amp;lt;table&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;input id=&quot;flag_progressive_output&quot; type=&quot;checkbox&quot; onchange=&quot;handle_flag('progressive_output')&quot;&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Progressive Output&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/label&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;span id=&quot;error&quot;&amp;gt;&amp;lt;/span&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td class=&quot;label&quot;&amp;gt;Length:&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;table id=&quot;length_table&quot;&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;input id=&quot;length&quot; class=&quot;output&quot; type=&quot;text&quot; spellcheck=&quot;false&quot; readonly&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td id=&quot;job_throbber&quot;&amp;gt;&amp;lt;img src=&quot;https://i.stack.imgur.com/sHKZY.gif&quot;&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td id=&quot;job_cancel&quot;&amp;gt;&amp;lt;input type=&quot;button&quot; value=&quot;Cancel&quot; onclick=&quot;cancel_job()&quot;&amp;gt;&amp;lt;td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr id=&quot;md5_container&quot;&amp;gt;&amp;lt;td class=&quot;label&quot;&amp;gt;MD5:&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;input id=&quot;md5&quot; class=&quot;output&quot; type=&quot;text&quot; spellcheck=&quot;false&quot; readonly&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr id=&quot;result_container&quot;&amp;gt;&amp;lt;td id=&quot;result_label&quot; class=&quot;label&quot;&amp;gt;Numeral:&amp;lt;/td&amp;gt;&amp;lt;td class=&quot;full_width&quot;&amp;gt;&amp;lt;textarea id=&quot;result&quot; class=&quot;output&quot; spellcheck=&quot;false&quot; readonly&amp;gt;&amp;lt;/textarea&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;script async type=&quot;text/javascript&quot; src=&quot;https://gist.githack.com/anonymous/49705525fd01ba66c1ad/raw/c35226ad89444e3af07d0e505f7163df8574b860/repnum.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="31403" LastEditorUserId="31403" LastEditDate="2015-12-30T13:25:19.113" LastActivityDate="2015-12-30T13:25:19.113" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="7792" PostTypeId="2" ParentId="2140" CreationDate="2015-12-22T19:09:10.620" Score="1" Body="&lt;h1&gt;Approximate an image using &lt;em&gt;all&lt;/em&gt; colours&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;I know that this is basically a subset of the then very popular &lt;a href=&quot;https://codegolf.stackexchange.com/questions/33172/american-gothic-in-the-palette-of-mona-lisa-rearrange-the-pixels/33206#33206&quot;&gt;American Gothic in the palette of Mona Lisa: Rearrange the pixels&lt;/a&gt; but I think it is worth making it a new challenge.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;As @MartinBüttner pointed out, there has also been the &lt;a href=&quot;https://codegolf.stackexchange.com/q/22144/8478&quot;&gt;Images with all colors&lt;/a&gt; challenge, but in my opinion it has very little in common with the proposed challenge.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Given a image of 2^12 x 2^12 pixels as input, your program should recreate this image, but you have to use each of 8-bit RGB colour exactly &lt;em&gt;once&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;p&gt;These are roughyl 12MP images, quite large. So one could just restrict it to 7-bit RGB then the pictures would only have to be 2^18 pixels, that means e.g. 512 x 512 pixels which would be way more suitable for the challenges here.&lt;/p&gt;&#xA;&lt;p&gt;Or does anyone know a convenient other colour representation?&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-29T16:55:18.233" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7802" PostTypeId="2" ParentId="2140" CreationDate="2015-12-24T11:36:35.873" Score="1" Body="&lt;h1&gt;Rearrangement Inequality: The Sequel &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Read the previous version &lt;a href=&quot;https://codegolf.stackexchange.com/questions/64449/rearrangement-inequality&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your mathematics teacher looked at your test results on inequalities. Not good.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hence he decided to give you some homework on inequalities.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since this is about inequalities (how unfair), he decided to give each student a differing amount of homework. The exact amounts do not matter to him.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After allocating the homework, he had a bunch of complaints. Apparently, some students have some neighbouring students who have less homework than them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hence, he has decided to rearrange the students such that there will be fewer complaints. As long as each student sees that at most one adjacent student has less homework than them, they will not complain. (The students are quite reasonable.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that he can swap the position of two students, but he cannot move a student into an empty spot as the empty spot has no chairs and the chairs in this classroom cannot be moved around due to safety concerns.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here are different forms of input you can consider:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Optional: You can include integers in your input for the size of the classroom for convenience. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, so input and output does not matter too much.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Function input: Container with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2190/interpretation-of-truthy-falsey&quot;&gt;truthy and falsy&lt;/a&gt; values representing if a student is there or not. All truthy values must be the same, similarly, all falsy values must be the same.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard Input:&#xA;A grid of 2 different characters, which can be separated by spaces. Possible input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 1 1 0 1&#xA;1 1 1 1 1&#xA;1 0 1 1 1&#xA;1 1 1 1 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;_@@_@&#xA;@@@@@&#xA;@_@@@&#xA;@@@@@&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The teacher wants to know how to arrange the students. Each student can be represented as an integer from 1 to n from the least amount of homework to the most amount of homework. For the input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 1 1 0 1&#xA;1 1 1 1 1&#xA;1 0 1 1 1&#xA;1 1 1 1 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where 1 means there is a student and 0 means there isn't any students, a possible output is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0  12 13 0  4&#xA;10 11 16 15 3&#xA;9  0  14 17 2&#xA;8  7  6  5  1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where the students labelled 16 and 17 are not satisfied.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your score for every test case will be the number of students which are satisfied over the total number of students in that test case. It is guaranteed that there is at least one student in each test case. Your final score will the average of your scores over all test cases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want to use another form of input and output, please clearly state it in your answers.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The teacher has some concerns:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Please ensure that your code is deterministic, as the teacher may test it several times. You are allowed to code your own psuedorandom number generator if you need random numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please ensure that your code terminates within a minute for each test case, as the teacher is impatient.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The teacher has been to PPCG for a long time, so he knows all the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;standard loopholes&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The teacher has a very large classroom (100 by 100), and would be worried if your program fails to give an answer for such a large classroom.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Finally:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, and the winner will be the person with the largest score.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox Meta:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I still need to generate some large test cases, so I'm leaving this in the Sandbox until I have large test cases. How should I show people large test cases?&lt;/p&gt;&#xA;" OwnerUserId="45643" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.193" LastActivityDate="2015-12-25T04:35:24.623" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7804" PostTypeId="1" CreationDate="2015-12-25T00:38:47.643" Score="41" ViewCount="3017" Body="&lt;h1&gt;AKA: The Regifting of the White Elephants&lt;/h1&gt;&#xA;&lt;p&gt;Note - I'm not sure this is on-topic or not on meta, but it seems to be as good a place as any.  Comment if you disagree.&lt;/p&gt;&#xA;&lt;p&gt;I have a few challenges that I have posted to the sandbox and then more-or-less forgotten.  Some of these challenges are OK; some not so much.  I think all of them could do with at least some level of polishing before they are posted to main.&lt;/p&gt;&#xA;&lt;p&gt;So this is my christmas gift to the community this year.  I don't think I have the inclination to pick up any of these challenges right now, if ever, so if you are interested, you may claim ownership and run with it.&lt;/p&gt;&#xA;&lt;p&gt;I will post the challenges I am donating as answers to this question.  If you have similar challenges you wish to donate, then please feel free to post as answers too.&lt;/p&gt;&#xA;&lt;p&gt;If you are interested in picking up any of these, go ahead and indicate this in the comments.&lt;/p&gt;&#xA;&lt;p&gt;Up/down-vote answers to indicate your interest solving a challenge.  This will give potential new owners a feel for whether its worth picking up  that challenge.&lt;/p&gt;&#xA;&lt;h3&gt;Seasons Greetings!&lt;/h3&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;If you are taking one of these challenge ideas, you should either edit the existing sandbox entry with your ideas, or perhaps create a new sandbox entry.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2023-01-23T19:24:16.997" Title="Secret Santa's Sandbox" Tags="|discussion|sandbox|" AnswerCount="17" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7805" PostTypeId="2" ParentId="7804" CreationDate="2015-12-25T00:38:47.643" Score="1" Body="&lt;h3&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/2386#2386&quot;&gt;Stitch a Picture&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;I think this is an interesting idea, but the comments seemed to indicate that this is a lot harder to solve than I had anticipated.  Perhaps it can be modified somewhat to make it reasonably solvable.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-25T00:38:47.643" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7806" PostTypeId="2" ParentId="7804" CreationDate="2015-12-25T00:40:10.983" Score="1" Body="&lt;h3&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1279/11259&quot;&gt;Do-nothing Polyglot&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;I think this one is pretty awful.  But perhaps there is something to be salvaged.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-25T00:40:10.983" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7808" PostTypeId="2" ParentId="7804" CreationDate="2015-12-25T00:43:37.373" Score="2" Body="&lt;h3&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/7694#7694&quot;&gt;Golf the numbers round a dartboard&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;In its current state, this one is fairly trivial, without a ton of creativity required for solutions.   But the sequence is interesting.  Perhaps there is some inspiration to had here.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-25T00:43:37.373" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7810" PostTypeId="1" AcceptedAnswerId="7811" CreationDate="2015-12-25T07:18:41.400" Score="3" ViewCount="157" Body="&lt;p&gt;I was going through Code Golf, and I noticed that there is no default &lt;a href=&quot;https://github.com/google/code-prettify&quot; rel=&quot;nofollow noreferrer&quot;&gt;Google code prettify&lt;/a&gt; like there is on Stack Overflow. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I recently updated &lt;a href=&quot;https://codegolf.stackexchange.com/a/67644/20634&quot;&gt;one of my submissions&lt;/a&gt; to be syntax highlighted. I think we can all agree it looks much nicer than &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/67644/1&quot;&gt;the non-highlighted version&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why should we settle for this&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/XtsEp.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/XtsEp.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When we can have this?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Px2C4.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Px2C4.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Right now, if you would like, you can prettify your submissions by simply adding&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;!-- language-all: lang-default --&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Somewhere in them&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note: This would have to be turned off by default for some tags, such as cops and robbers - looking at the source code would (I'm fairly certain) reveal what language is highlighted&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="20634" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-01-04T20:30:40.717" Title="Why isn't there default syntax highlighting for code?" Tags="|feature-request|status-declined|formatting|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7811" PostTypeId="2" ParentId="7810" CreationDate="2015-12-25T08:07:05.710" Score="11" Body="&lt;p&gt;AFAIK there is no default syntax highlighting on SO. Instead a default syntax highlighting can be set for &lt;em&gt;each tag&lt;/em&gt;. Almost every question on SO has a language-specific tag and those come with the appropriate syntax highlighting. This doesn't really make sense for most challenges on PPCG. Answers are in all sorts of languages, and no single language syntax highlighting would do most of them justice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We could set them for the few language tags we have, but even those are often used for challenges &lt;em&gt;about&lt;/em&gt; that language, not challenges where all code has to be written &lt;em&gt;in&lt;/em&gt; that language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(As a side note, a site that does have default syntax-highlighting everywhere is Mathematica.SE but that's a language-specific community.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-12-25T08:07:05.710" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="7813" PostTypeId="2" ParentId="7804" CreationDate="2015-12-26T05:35:36.300" Score="3" Body="&lt;h3&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5639/20260&quot;&gt;Frame ASCII art&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;A great gift with &lt;em&gt;six sandbox upvotes&lt;/em&gt;!&lt;/p&gt;&#xA;&lt;p&gt;I don't know what to do about the similarity to challenges about &lt;a href=&quot;https://codegolf.stackexchange.com/q/53219/20260&quot;&gt;removing leading spaces&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/q/2651/20260&quot;&gt;printing a border a border&lt;/a&gt;, and others I know exist but am not finding in a search.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-26T05:35:36.300" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7817" PostTypeId="2" ParentId="2140" CreationDate="2015-12-26T10:38:13.530" Score="3" Body="&lt;h1&gt;Elements with 100 ≤ Z &amp;lt; 1000&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The International Union of Pure and Applied Chemistry (IUPAC) decided that it is necessary to have a systematic naming for the elements, even for those which had not been discovered. The rules for naming are:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The name is derived directly from the atomic number of the element using the following Latin numerical roots:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Number     Root&#xA;------     ----&#xA;0          nil&#xA;1          un&#xA;2          bi&#xA;3          tri&#xA;4          quad&#xA;5          pent&#xA;6          hex&#xA;7          sept&#xA;8          oct&#xA;9          enn&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The roots are put together in the order of the digits which make up the atomic number and terminated by &lt;code&gt;'ium'&lt;/code&gt; to spell out the name. The final &lt;code&gt;'n'&lt;/code&gt; of &lt;code&gt;'enn'&lt;/code&gt; is omitted when it occurs before &lt;code&gt;'nil'&lt;/code&gt;, and the final &lt;code&gt;'i'&lt;/code&gt; of &lt;code&gt;'bi'&lt;/code&gt; and of &lt;code&gt;'tri'&lt;/code&gt; when it occurs before &lt;code&gt;'ium'&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The symbol of the element is composed of the initial letters of the numerical roots which make up the name.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;For this challenge, let us consider the elements having a three digit atomic number.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;100 --&amp;gt; Unnilnilium&#xA;101 --&amp;gt; Unnilunium&#xA;111 --&amp;gt; Unununium&#xA;150 --&amp;gt; Unpentnilium&#xA;200 --&amp;gt; Binilnilium&#xA;500 --&amp;gt; Pentnilnilium&#xA;999 --&amp;gt; Ennennennium&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Input can be taken from one of the following&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;stdin&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Command-line arguments&lt;/li&gt;&#xA;&lt;li&gt;Function arguments (One argument, as a string)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Input will contain either a valid IUPAC name of an element, or a valid IUPAC symbol of an element.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output the corresponding&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;IUPAC name if the input is a symbol of an element.&lt;/li&gt;&#xA;&lt;li&gt;symbol if the input is an IUPAC name of an element.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input will contain a &lt;strong&gt;valid&lt;/strong&gt; IUPAC name/symbol.&lt;/li&gt;&#xA;&lt;li&gt;The first character of the symbol/name in input will be in upper-case and should remain capitalized in the output.&lt;/li&gt;&#xA;&lt;li&gt;You are permitted to write a full program or a function.&lt;/li&gt;&#xA;&lt;li&gt;There should be no unnecessary characters except an optional trailing newline character.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Unu            --&amp;gt; Unnilunium&#xA;Eee            --&amp;gt; Ennennennium&#xA;Enn            --&amp;gt; Ennilnilium&#xA;Bnb            --&amp;gt; Binilbium&#xA;Ubt            --&amp;gt; Unbitrium&#xA;Qsn            --&amp;gt; Quadseptnilium&#xA;&#xA;Septenntrium   --&amp;gt; Set&#xA;Hexunbium      --&amp;gt; Hub&#xA;Octennilium    --&amp;gt; Oen&#xA;Bibibium       --&amp;gt; Bbb&#xA;Ununennium     --&amp;gt; Uue&#xA;Triquadpentium --&amp;gt; Tqp&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest submission (in bytes) wins.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chemistry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chemistry&amp;#39;&quot; rel=&quot;tag&quot;&gt;chemistry&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Sandbox&lt;/em&gt;: What do you guys think about this challenge? Anything to improve? Did I miss anything?&lt;/p&gt;&#xA;" OwnerUserId="38214" LastEditorUserId="38214" LastEditDate="2015-12-27T04:34:46.773" LastActivityDate="2015-12-27T04:34:46.773" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7818" PostTypeId="1" CreationDate="2015-12-26T17:56:29.870" Score="3" ViewCount="88" Body="&lt;p&gt;Is a scoring system based on the binary representation of the code ok? What should I look out for especially regarding loopholes? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I plan to release a puzzle based on counting occurences of patterns in the binary representation of the source code, as if you would take the code and put it in an ASCII-to-Binary Converter. However I want to allow any encoding, as long as it is &lt;em&gt;widely&lt;/em&gt; used.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How to define &lt;em&gt;widely&lt;/em&gt;? Has someone already compiled a list of allowed encodings I could use, or should I just provide some as the only ones allowed? The answer obviously has to say which one was used.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Could there be any problem with languages that use unprintable characters? Should the string-version of the hex-Dump be graded?&lt;/p&gt;&#xA;" OwnerUserId="30013" LastActivityDate="2015-12-26T21:25:53.193" Title="Alternate Scoring System based on binary representation" Tags="|discussion|scoring|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7821" PostTypeId="2" ParentId="7818" CreationDate="2015-12-26T21:25:53.193" Score="5" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Is a scoring system based on the binary representation of the code ok?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Sure. Any objective scoring system you can come up with is valid. Just people may dislike it if it's inelegant or unfair.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;How to define &lt;em&gt;widely&lt;/em&gt;?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Without a definitive list of allowed encodings, you can't. It would be better to say &quot;only preexisting encodings are allowed&quot;. This is our default here anyway so you don't really even need to say it. If someone designed an encoding to specifically win your challenge they would be majorly breaking our rules.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Has someone already compiled a list of allowed encodings I could use, or should I just provide some as the only ones allowed?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Maybe take a look at &lt;a href=&quot;http://en.wikipedia.org/wiki/Character_encoding#Common_character_encodings&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://en.wikipedia.org/wiki/Character_encoding#Common_character_encodings&lt;/a&gt; , but I advise against a list.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Could there be any problem with languages that use unprintable characters?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't think so. Unprintable chars have a normal binary representation the same as printable ones, so a scoring system based on the binary representation applies regardless.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Should the string-version of the hex-Dump be graded?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If you mean convert the hex values to binary and score that, then that's the same as the binary representation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you mean convert the hex string characters (0-9A-F) to binary in the chosen encoding and score that, then no don't do that, it would be weird.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;By the way, you don't need to worry about &quot;giving away the challenge&quot;. People who cheat by creating challenge-specific languages/encodings are quickly downvoted. In fact making your challenge public in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt; is more likely to make your challenge better than worse.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2015-12-26T21:25:53.193" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7822" PostTypeId="1" CreationDate="2015-12-26T22:38:52.913" Score="30" ViewCount="1653" Body="&lt;p&gt;Recently &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7212/20469&quot;&gt;Isaac proposed&lt;/a&gt; that using non-free, i.e. pay-to-use, languages for &lt;a href=&quot;https://codegolf.stackexchange.com/tags/cops-and-robbers/info&quot;&gt;cops and robbers&lt;/a&gt; challenges should be considered a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/20469&quot;&gt;standard loophole&lt;/a&gt;. As Dennis stated in a comment, there is some ambiguity in this. Namely, what constitutes &quot;free enough&quot; to be able to use?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some languages have free trials, though once the trial period expires, the language is no longer available for use. Examples include Mathematica, Matlab, Stata, and LabVIEW.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some languages are free to use but are only available for particular operating systems. Examples include AppleScript and Windows Batch.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TI-BASIC can be emulated, but it's illegal to do so unless you own a Texas Instruments TI-84+ calculator.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What should our standard be for allowing such languages for cops and robbers challenges? That is, where do we draw the line for &quot;free&quot;? Note that the goal here isn't to obtain a strict set of rules that will be applied blindly to all languages, but we should at least establish a few ground rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please post one suggestion per answer so the community may vote on them individually.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Related posts:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/988/20469&quot;&gt;Untestable languages&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1213/20469&quot;&gt;Installation and testing instructions for specific programming languages&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-11-13T19:14:50.860" Title="What constitutes a &quot;free&quot; language for cops and robbers?" Tags="|discussion|policy|answers|cops-and-robbers|" AnswerCount="5" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7823" PostTypeId="2" ParentId="7822" CreationDate="2015-12-26T23:16:04.723" Score="17" Body="&lt;h1&gt;Platform-specific languages for which there are open source interpreters / compilers should be considered free&lt;/h1&gt;&#xA;&lt;p&gt;Example: &lt;strong&gt;BASIC-family languages&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Rationale: If the BASIC dialect you're using has a free and open source implementation which implements all of the features your code uses, then it's acceptable. Otherwise, you either put an Apple IIe in everyone's house, or don't use a restrictive and inaccessible language for CnR.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Minecraft Redstone which &lt;em&gt;also&lt;/em&gt; works in Javascript Redstone implementations&lt;/strong&gt;, &lt;strong&gt;Excel Formulas which &lt;em&gt;also&lt;/em&gt; work in OpenOffice&lt;/strong&gt; and &lt;strong&gt;Windows Batch which &lt;em&gt;also&lt;/em&gt; works in &lt;a href=&quot;http://winehq.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wine&lt;/a&gt;&lt;/strong&gt; would all fall under this rule: use features available in the OSS version, or don't use that language.&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-27T03:36:50.127" CommentCount="10" CommunityOwnedDate="2015-12-28T04:11:17.963" ContentLicense="CC BY-SA 3.0" />
  <row Id="7824" PostTypeId="2" ParentId="2140" CreationDate="2015-12-27T02:32:11.377" Score="0" Body="&lt;h1&gt;Nth Regex&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This challenge('s explanation) is simple: given a number &lt;code&gt;n&lt;/code&gt; and a regex &lt;code&gt;r&lt;/code&gt;, output the &lt;code&gt;n&lt;/code&gt;th string that matches &lt;code&gt;r&lt;/code&gt;!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The regex &lt;code&gt;r&lt;/code&gt; uses the syntax used in Python, &lt;a href=&quot;https://docs.python.org/2/library/re.html#regular-expression-syntax&quot; rel=&quot;nofollow noreferrer&quot;&gt;described here&lt;/a&gt;. The regex will be for the whole string, meaning the regex will be implicitly wrapped in &lt;code&gt;^$&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The only valid strings are printable ASCII characters, and they count up like base 95 (ASCII codes 32-126).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To prevent people from brute-forcing it, I was thinking of making it &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="41042" LastEditorUserId="41042" LastEditDate="2015-12-28T23:16:03.447" LastActivityDate="2015-12-28T23:16:03.447" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7825" PostTypeId="2" ParentId="7822" CreationDate="2015-12-27T03:08:58.383" Score="40" Body="&lt;h1&gt;Free access may not be time-limited&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For a language to count as free, there has to be a time-unlimited, cost-free way (that does not violate any laws or terms of service) to compile and/or interpret the language in question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a time-limited trial enables a robber  to crack submissions in that language for only a month, there's no reason to outlaw paid languages at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We should not expect robbers to enter a legal or moral grey area to be able to participate in a PPCG challenge.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2016-10-11T13:21:56.817" LastActivityDate="2016-10-11T13:21:56.817" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7826" PostTypeId="2" ParentId="7822" CreationDate="2015-12-27T03:21:51.027" Score="7" Body="&lt;h1&gt;Inherent platform specificity should be disallowed&lt;/h1&gt;&#xA;&lt;p&gt;That is, there will &lt;em&gt;never&lt;/em&gt;, unequivocally ever be AppleScript runnable anywhere but Mac OSX, there will  never ever be a (sufficiently full featured) Microsoft Visual Basic implementation for anything but Windows, and so forth, due (primarily) to copyright and IP &amp;quot;issues&amp;quot;. Any such implementation would likely violate one or more US laws.&lt;/p&gt;&#xA;&lt;p&gt;Though a robber may, at their own option, @Dennis &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7825/46231&quot;&gt;points out&lt;/a&gt; that we can't &amp;quot;expect a robber to enter a legal or moral grey area to be able to participate in a PPCG challenge.&amp;quot;&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-27T03:26:43.450" CommentCount="4" CommunityOwnedDate="2015-12-28T04:11:49.153" ContentLicense="CC BY-SA 3.0" />
  <row Id="7828" PostTypeId="2" ParentId="7822" CreationDate="2015-12-27T10:10:01.730" Score="14" Body="&lt;h1&gt;Languages for which there are free online interpreters should be considered Free&lt;/h1&gt;&#xA;&lt;p&gt;There is a ton of online interpreters available, see e.g. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/202/where-to-find-an-online-testing-environment-for-specific-programming-languages&quot;&gt;Where to find an online testing environment for specific programming languages?&lt;/a&gt; and they are usually sufficient for CnR challenges. I know that they are usually slower and sometimes do not have full coverage of all functionalities, but as the CnR submissions are generally short and do not rely on heavy computation this does not seem to be a problem, &lt;strong&gt;IF the submitter provides a link to an interpreter that executes your submission as expected.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A (not very good) example: I do write most of my submissions here in Matlab, but most &amp;quot;online Matlab interpreters&amp;quot; use Octave instead. But this has never been a problem for my submissions because there are only very few common functionalities of Matlab that are not available in Octave. (Actually the contrary is more frequent: You can shorten a lot of things in Octave that you cannot do in Matlab, e.g. &lt;code&gt;a=b=1&lt;/code&gt; or &lt;code&gt;a+=3&lt;/code&gt; e.t.c.) But as I said, this is a bad example, as Octave is freely available, and Matlab users can use Octave without any major problems. (I forgot to mention FreeMat and Scilab, which are other free alternative to Matlab, but I do not have any experience with those.)&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-27T10:26:48.733" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7832" PostTypeId="1" AcceptedAnswerId="7833" CreationDate="2015-12-27T17:19:00.207" Score="18" ViewCount="1395" Body="&lt;p&gt;Sometimes there are bugs in interpreters that make them unable to run programs that are valid by the specification of the language, or make them work incorrectly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This will break programs using those features, which can be frustrating especially in code golf.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;For example, let's assume that in the docs for the language &lt;strong&gt;Lang&lt;/strong&gt; it says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;code&gt;str.upper()&lt;/code&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Return a copy of the string with all the cased characters converted to uppercase.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;But then, when you try it:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt; 'test'.upper()&#xA;'Test'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Assuming that all available interpreters have some bug that prevent the program from working, but the specification still defines how that program &lt;em&gt;should&lt;/em&gt; work, will such bugs make such a program invalid if&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;the interpreter is never fixed?&lt;/li&gt;&#xA;&lt;li&gt;the interpreter is fixed after the challenge is posted?&lt;/li&gt;&#xA;&lt;li&gt;the interpreter is intended to be fixed at some point after the challenge is posted?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;In none of the cases could the program be run in an interpreter released before the challenge is posted, which is generally thought to be a requirement.&lt;/p&gt;&#xA;" OwnerUserId="30164" LastEditorUserId="66833" LastEditDate="2021-12-06T04:41:32.983" LastActivityDate="2021-12-06T04:41:32.983" Title="What's the policy on interpreter bugs?" Tags="|discussion|answers|faq-proposed|" AnswerCount="1" CommentCount="5" ClosedDate="2017-06-19T10:33:27.867" ContentLicense="CC BY-SA 3.0" />
  <row Id="7833" PostTypeId="2" ParentId="7832" CreationDate="2015-12-27T18:02:17.393" Score="27" Body="&lt;h2&gt;The interpreter(/compiler) defines the language&lt;/h2&gt;&#xA;&lt;p&gt;A spec is not a language. For the purposes of PPCG, a programming language is defined by its implementation.&lt;/p&gt;&#xA;&lt;p&gt;&lt;s&gt;If the interpreter is fixed after the challenge is posted, the answer must be marked as non-competing—just like any other answer in a language that was created after the challenge.&lt;/s&gt; This has been &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12877/66833&quot;&gt;superseded by site policy&lt;/a&gt;, and no longer applies.&lt;/p&gt;&#xA;&lt;p&gt;(On the flip side, this has the side effect that &lt;em&gt;exploiting&lt;/em&gt; interpreter bugs is also perfectly okay.)&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="66833" LastEditDate="2021-12-06T04:41:26.450" LastActivityDate="2021-12-06T04:41:26.450" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="7834" PostTypeId="2" ParentId="2140" CreationDate="2015-12-27T20:06:46.623" Score="0" Body="&lt;h1&gt;Parse a tree for pruning&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Windows supplies users with &lt;code&gt;tree&lt;/code&gt;: a neat little tool that converts a directory tree to ASCII-CP437 art. It's a very human-readable format. However, it's a bit useless if you want the directory tree of an entire drive, or even just the Windows folder, as it's very hard to prune the parts you don't want. Hence this challenge.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to produce a function or program that will convert the tree from one or both of the input formats into one or more of the output formats. The smaller your code, the more of a head start you have.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are two types of input that you might be given:&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;CP437&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is the default.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Folder PATH listing for volume Main Drive&#xA;Volume serial number is 00F3-F586&#xA;C:\WINDOWS&#xA;│   explorer.exe&#xA;│   notepad.exe&#xA;│   virus.dll&#xA;│   WLXPGSS.SCR&#xA;│   write.exe&#xA;│   &#xA;├───Boot&#xA;│   │   BootDebuggerFiles.ini&#xA;│   │   &#xA;│   ├───DVD&#xA;│   │       your.txt&#xA;│   │       &#xA;│   ├───EFI&#xA;│   │       pc.txt&#xA;│   │       &#xA;│   ├───Fonts&#xA;│   │       has.txt&#xA;│   │       &#xA;│   ├───PCAT&#xA;│   │       been.txt&#xA;│   │       &#xA;│   └───Resources&#xA;│           wrecked.txt&#xA;│           &#xA;├───System&#xA;└───System32&#xA;        cmd.exe&#xA;        conhost.exe&#xA;        winlogon.cmd&#xA;        winlogon.exe&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;ASCII&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This will be easier to parse for many languages.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Folder PATH listing for volume Main Drive&#xA;Volume serial number is 00F3-F586&#xA;C:\WINDOWS&#xA;|   explorer.exe&#xA;|   notepad.exe&#xA;|   virus.dll&#xA;|   WLXPGSS.SCR&#xA;|   write.exe&#xA;|   &#xA;+---Boot&#xA;|   |   BootDebuggerFiles.ini&#xA;|   |   &#xA;|   +---DVD&#xA;|   |       your.txt&#xA;|   |       &#xA;|   +---EFI&#xA;|   |       pc.txt&#xA;|   |       &#xA;|   +---Fonts&#xA;|   |       has.txt&#xA;|   |       &#xA;|   +---PCAT&#xA;|   |       been.txt&#xA;|   |       &#xA;|   \---Resources&#xA;|           wrecked.txt&#xA;|           &#xA;+---System&#xA;\---System32&#xA;        cmd.exe&#xA;        conhost.exe&#xA;        winlogon.cmd&#xA;        winlogon.exe&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are several possible types of output you can return, each suited to a different type of language.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Array / List hierarchy of strings&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The first element of each array / list is the name, the rest are the contents. Files should be represented by strings, empty folders should be represented by a single-length array containing one string. Note: This should be returned from a function as an array / list, not printed as a string.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&quot;C:\WINDOWS&quot;, &quot;explorer.exe&quot;, &quot;notepad.exe&quot;, &quot;virus.dll&quot;, &quot;WLXPGSS.SCR&quot;, &quot;write.exe&quot;, [&quot;Boot&quot;, &quot;BootDebuggerFiles.ini&quot;, [&quot;DVD&quot;, &quot;your.txt&quot;], [&quot;EFI&quot;, &quot;pc.txt&quot;], [&quot;Fonts&quot;, &quot;has.txt&quot;], [&quot;PCAT&quot;, &quot;been.txt&quot;], [&quot;Resources&quot;, &quot;wrecked.txt&quot;]], [&quot;System&quot;], [&quot;System32&quot;, &quot;cmd.exe&quot;, &quot;conhost.exe&quot;, &quot;winlogon.cmd&quot;, &quot;winlogon.exe&quot;]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Object / Dictionary&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Similar to array / list, but a little more intuitive. Folders should have the value of their contents as another object / dictionary. Files should have the value &quot;FILE&quot;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{&quot;C:\WINDOWS&quot;:{&quot;explorer.exe&quot;:&quot;FILE&quot;,&quot;notepad.exe&quot;:&quot;FILE&quot;,&quot;virus.dll&quot;:&quot;FILE&quot;,&quot;WLXPGSS.SCR&quot;:&quot;FILE&quot;,&quot;write.exe&quot;:&quot;FILE&quot;,&quot;Boot&quot;:{&quot;BootDebuggerFiles.ini&quot;:&quot;FILE&quot;,&quot;DVD&quot;:{&quot;your.txt&quot;:&quot;FILE&quot;},&quot;EFI&quot;:{&quot;pc.txt&quot;:&quot;FILE&quot;},&quot;Fonts&quot;:{&quot;has.txt&quot;:&quot;FILE&quot;} [...] } [...] } [...] }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Lisp-style string&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Similar to array / list, where the head of the list is the directory name and the tail is the contents. An empty directory is a list with no tail, and a file is a string.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;No WAY am I putting an example. No way. I've spent half the time on this question creating the examples. No way. Ok, maybe later.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Bonus&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If you satisfy none of these bonuses, your submission is still valid. But its score shall infinite, so it is non-competitive.&lt;br&gt;&#xA;These bonuses are to multiply your score by. Bonuses stack by multiplication. These bonuses must all be achieved consistently to be awarded.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;100% Allow at least one input mode and output mode&lt;/li&gt;&#xA;&lt;li&gt;50% Allow both input modes&lt;/li&gt;&#xA;&lt;li&gt;90% Output in exactly two ways &lt;/li&gt;&#xA;&lt;li&gt;50% Output in one of two ways depending on parameters &lt;/li&gt;&#xA;&lt;li&gt;80% Output in exactly three ways &lt;/li&gt;&#xA;&lt;li&gt;25% Output in one of three ways depending on parameters &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="43394" LastActivityDate="2015-12-27T20:06:46.623" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7835" PostTypeId="2" ParentId="1213" CreationDate="2015-12-27T21:06:37.747" Score="1" Body="&lt;h2&gt;SAS&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;SAS is proprietary statistical analysis software, and is renowned for being extremely expensive to license. It is a rather verbose 4GL, and as such doesn't see much use on this site. However, a free-for-personal-use version is available here:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.sas.com/en_us/software/university-edition.html&quot; rel=&quot;nofollow&quot;&gt;http://www.sas.com/en_us/software/university-edition.html&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are two ways to proceed:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Set up a free-tier AWS instance and connect via the AWS marketplace&lt;/li&gt;&#xA;&lt;li&gt;Download a VM image and host a local server that you can connect to via your favourite web browser on &lt;a href=&quot;http://localhost:10080&quot; rel=&quot;nofollow&quot;&gt;http://localhost:10080&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Both options provide access to all the core features of the SAS programming language that are likely to be relevant for code golf, and a decent selection of the most commonly used built-in procs. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some SAS features are tied to modules that are not bundled with SAS University Edition and will therefore not be available, but it is extremely unlikely that any of these would ever be relevant for code golf, due to their complex, verbose and highly specialised nature - e.g. the likes of &lt;a href=&quot;http://support.sas.com/documentation/cdl/en/orlsoug/67516/HTML/default/viewer.htm#orlsoug_ga_overview.htm&quot; rel=&quot;nofollow&quot;&gt;proc ga&lt;/a&gt; from the SAS/OR module.&lt;/p&gt;&#xA;" OwnerUserId="6951" LastActivityDate="2015-12-27T21:06:37.747" CommentCount="0" CommunityOwnedDate="2016-08-21T03:11:45.147" ContentLicense="CC BY-SA 3.0" />
  <row Id="7837" PostTypeId="2" ParentId="2140" CreationDate="2015-12-27T22:31:02.753" Score="0" Body="&lt;h1&gt;Identifying spies in &amp;quot;&lt;a href=&quot;https://en.wikipedia.org/wiki/The_Resistance_(game)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Resistance&lt;/a&gt;&amp;quot;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;This is still very rough, but I think it has the makings of an interesting challenge. Please help me improve it. What do I need to add? What do I need clarify?&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Resistance is a party game that pits &amp;quot;resistance members&amp;quot; against &amp;quot;imperial spies&amp;quot; on a series of missions. A very important aspect of the game is that the resistance members do not know who the spies are, whereas the spies do know who is who.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;How the game works&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The relevant details of the game will be added here. For now, just check the Wikipedia page linked in the title.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;your challenge is to write a program that takes as input the details of every round and outputs who it thinks is a spy after each round. There are 5 rounds (missions) in a game of resistance, so the program/function will take in all the data for the first round, which includes&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Each proposed team to go on the mission&lt;/li&gt;&#xA;&lt;li&gt;Each public vote following each proposal&lt;/li&gt;&#xA;&lt;li&gt;The final team to go on the mission&lt;/li&gt;&#xA;&lt;li&gt;The outcome of the mission (i.e. how many passes and how many fails)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;It will then output who it thinks is a spy. It will then do the same for each subsequent round.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Important Details&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;We will be playing resistance for (6?) people,&lt;/em&gt; A, B, C, D, E, &lt;em&gt;and&lt;/em&gt; F.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Input format is flexible&lt;/em&gt;. It may be done round by round or all at once. However, since ach submission is outputting something for each of the five rounds, the submission may not use information from future rounds (if all information is given at once) in judging the current round.&lt;/p&gt;&#xA;&lt;p&gt;Here is an example of possible input format:&lt;/p&gt;&#xA;&lt;p&gt;Since the first mission requires two people, and person A is the first mission planner, the only thing input would be two letters in {A,B,C,D,E,F} indicating his selection. Then the votes of each person, in order, would be input. This continues until a mission team is accepted. Then the votes given on the mission would be input, in no/any particular order. The program would then output the letters of the two people it thinks are spies (there are 2 spies in a 6 person game). Here is an example&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A B              # A selects A and B for first mission&#xA;P P P F F F      # Everyone votes, mission team is not accepted (lacks majority pass)&#xA;B F              # B selects B and F for first mission&#xA;P P P P P F      # Mission team is accepted (majority pass)&#xA;P F              # Mission fails (there is at least one fail vote). Note that the order does not matter here. &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The bot would then output two people, the people it thinks are most likely to be the spies based on all the information it has up to this point.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;B F              # Any two person subset is acceptable&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input then continues for the next 4 rounds, until the game is over.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I will write several hundred test cases (from actual games played online). Then each output will be scored in the following way:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1 point for each correctly guessed spy.&lt;/li&gt;&#xA;&lt;li&gt;1 point for guessing both spies correctly.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The submission's total score will be the sum of all scores on all rounds in all games. The program will never be told who is a spy (unless it is used to self-score and does not factor into the actual guessing) but this information will be available with the test cases for scoring purposes.&lt;/p&gt;&#xA;&lt;p&gt;Tie break is code golf.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Meta: I think I'm going to remove output after the first round, because very rarely do people ever fail the first mission. So it will likely just be pure chance.&lt;/p&gt;&#xA;" OwnerUserId="45459" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-27T22:31:02.753" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7839" PostTypeId="2" ParentId="202" CreationDate="2015-12-28T02:35:36.387" Score="2" Body="&lt;h1&gt;Rollapp&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You can use &lt;strong&gt;Rollapp&lt;/strong&gt; for text editors like emacs, brackets, and there are some IDEs in the 'coming soon' section. It does not support sharing very well, but if you are looking to run other people's code the IDEs may work when they come out (or if they come out). Hopefully they will make Eclipse available and we will have a full java IDE on the web!!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;links:&lt;br&gt;&#xA;&lt;a href=&quot;https://www.rollapp.com/app/terminator&quot; rel=&quot;nofollow&quot;&gt;https://www.rollapp.com/app/terminator&lt;/a&gt; - run bash and perl etc&lt;br&gt;&#xA;&lt;a href=&quot;https://www.rollapp.com/app/eclipse&quot; rel=&quot;nofollow&quot;&gt;https://www.rollapp.com/app/eclipse&lt;/a&gt; - eclipse, hopefully will work soon&lt;/p&gt;&#xA;" OwnerUserId="47019" LastActivityDate="2015-12-28T02:35:36.387" CommentCount="0" CommunityOwnedDate="2015-12-28T02:35:36.387" ContentLicense="CC BY-SA 3.0" />
  <row Id="7840" PostTypeId="2" ParentId="202" CreationDate="2015-12-28T05:03:35.533" Score="53" Body="&lt;h1&gt;&lt;a href=&quot;https://tryitonline.net/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try It Online&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tryitonline.net/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try It Online&lt;/a&gt; has been created by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt; and currently supports the following practical and recreational programming languages. (the snippet loads the current list)&lt;/p&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;h3&amp;gt;Practical&amp;lt;/h3&amp;gt;&amp;lt;div id=&quot;practical&quot;&amp;gt;&amp;lt;ul&amp;gt;&amp;lt;/ul&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;h3&amp;gt;Recreational&amp;lt;/h3&amp;gt;&amp;lt;div id=&quot;recreational&quot;&amp;gt;&amp;lt;ul&amp;gt;&amp;lt;/ul&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;script&amp;gt;var request=new XMLHttpRequest;request.open(&quot;GET&quot;,&quot;https://tio.run/languages.json&quot;),request.onreadystatechange=function(){var languages,languageArray,id,language,i,item,anchor,j;if(request.readyState==XMLHttpRequest.DONE){languages=JSON.parse(request.response),languageArray=[];for(id in languages)language=languages[id],language.id=id,languageArray.push(language);for(languageArray.sort(function(languageA,languageB){return 2*(languageA.name.toLowerCase()&amp;gt;languageB.name.toLowerCase())-1}),i=0;i&amp;lt;languageArray.length;i++)for(language=languageArray[i],item=document.createElement(&quot;li&quot;),anchor=document.createElement(&quot;a&quot;),anchor.href=&quot;https://tio.run/#&quot;+language.id,anchor.textContent=language.name,item.appendChild(anchor),j=0;j&amp;lt;language.categories.length;j++)document.getElementById(language.categories[j]).appendChild(item)}},request.send()&amp;lt;/script&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-25T19:19:22.500" CommentCount="3" CommunityOwnedDate="2015-12-28T05:03:35.533" ContentLicense="CC BY-SA 3.0" />
  <row Id="7841" PostTypeId="2" ParentId="1213" CreationDate="2015-12-28T23:13:28.953" Score="1" Body="&lt;h1&gt;WhoScript&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Download the repository &lt;a href=&quot;https://github.com/MCS-Kaijin/WhoScript&quot; rel=&quot;nofollow&quot;&gt;https://github.com/MCS-Kaijin/WhoScript&lt;/a&gt;. Then move WhoScript.py to a convenient location.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To run, type &lt;code&gt;python WhoScript.py program [input]&lt;/code&gt; into your command terminal where &lt;code&gt;program&lt;/code&gt; is the program file name and &lt;code&gt;input&lt;/code&gt; is the optional input. If no input is provided then the program will prompt you for input when it is required. Check regularly for updates as WhoScript is still under development.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;*the current interpreter only works in Python 2.7.x&lt;/p&gt;&#xA;" OwnerUserId="48457" LastEditorUserId="48457" LastEditDate="2015-12-28T23:32:05.117" LastActivityDate="2015-12-28T23:32:05.117" CommentCount="0" CommunityOwnedDate="2016-08-21T03:11:45.147" ContentLicense="CC BY-SA 3.0" />
  <row Id="7842" PostTypeId="1" CreationDate="2015-12-28T23:44:30.243" Score="20" ViewCount="1947" Body="&lt;p&gt;&lt;strong&gt;&lt;em&gt;Question in brief:&lt;/em&gt;&#xA;For what challenge types and in what circumstances should code that requires a &lt;a href=&quot;https://en.wikipedia.org/wiki/Read%E2%80%93eval%E2%80%93print_loop&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Read-eval-print loop (also known as an interactive toplevel or language shell)&quot;&gt;REPL&lt;/a&gt; be acceptable in an answer?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;There seems to be an understanding in chat that code that only works in a REPL is not valid as an answer, but I can't find any consensus here on meta to back this up, which makes it difficult to comment to that effect on REPL answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've found these two somewhat contradictory posts:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This question:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet&quot;&gt;Default for Code Golf: Program, Function or Snippet?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;and this answer elsewhere:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default/1146#1146&quot;&gt;Loopholes that are forbidden by default: Posting a code snippet instead of a complete answer&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, mixing up the discussion and voting with the program/function debate seems to be causing confusion, so I thought this could use its own question.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2015-12-29T16:24:52.527" Title="When is code that requires a REPL acceptable?" Tags="|discussion|defaults|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7843" PostTypeId="2" ParentId="7842" CreationDate="2015-12-29T00:06:00.123" Score="3" Body="&lt;p&gt;I believe that if the programming language has a significant proportion of its code being run in a REPL environment, using the REPL form of the code should be allowed, unless it is specifically disallowed in the question. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples of such &quot;significantly REPL languages&quot; include Mathematica, where the code is run within &quot;notebooks&quot;, which are REPL environments. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples of languages where REPL is not active in the majority of usage cases include C++ and PHP (although as far as I am aware both of them can also be run in a REPL shell). &lt;/p&gt;&#xA;" OwnerUserId="36328" LastEditorUserId="36328" LastEditDate="2015-12-29T00:12:02.323" LastActivityDate="2015-12-29T00:12:02.323" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7844" PostTypeId="2" ParentId="7842" CreationDate="2015-12-29T03:59:06.943" Score="19" Body="&lt;h2&gt;Always— but a REPL is a different language.&lt;/h2&gt;&#xA;&lt;p&gt;We usually define languages by their interpreters. My Python shell is an interpreter, which satisfies our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2028/39328&quot;&gt;definition&lt;/a&gt; of a programming language. Therefore, it is a valid language.&lt;/p&gt;&#xA;&lt;p&gt;&amp;quot;Wait a minute&amp;quot;, you say, &amp;quot;won't REPLs usually be shorter than their full program/function equivalents?&amp;quot; Why won't people golf in 'Python REPL' over Python?&lt;/p&gt;&#xA;&lt;p&gt;That will happen, and it's fine. Clever and well-golfed full-program Python answers will still be upvoted—just as they are now despite golfing languages usually winning &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges.&lt;/p&gt;&#xA;&lt;p&gt;In addition, a REPL entry won't always be a parent language entry without the &lt;code&gt;print()&lt;/code&gt;. The REPL often has interesting features that can be used cleverly, and golfing in a REPL means a different set of constraints than in the parent language. For example, &lt;code&gt;_&lt;/code&gt; in a Python REPL is the last evaluated expression, which is shorter than assigning to a variable.&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-29T16:24:52.527" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="7845" PostTypeId="1" AcceptedAnswerId="7846" CreationDate="2015-12-29T12:07:05.717" Score="1" ViewCount="98" Body="&lt;p&gt;I can't access code-golf because of a problem. And when I entered, there is a winter bash. And hats. My question is:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;What is winter bash and what is hats?&lt;/li&gt;&#xA;&lt;li&gt;What is the purpose of that?&lt;/li&gt;&#xA;&lt;li&gt;How it works?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="46245" LastActivityDate="2015-12-29T13:44:18.063" Title="What is Winter Bash and Hats?" Tags="|support|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7846" PostTypeId="2" ParentId="7845" CreationDate="2015-12-29T13:44:18.063" Score="3" Body="&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://winterbash2015.stackexchange.com/&quot; rel=&quot;nofollow&quot;&gt;Winter Bash&lt;/a&gt; is an annual event across the entire Stack Exchange network, in which users can earn various hats that they can put on their avatars for completing certain tasks.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;HATS!!!&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;On most sites, you will automatically be opted into Winter Bash. Simply visit &lt;a href=&quot;http://winterbash2015.stackexchange.com/&quot; rel=&quot;nofollow&quot;&gt;the home page&lt;/a&gt; to see which hats you can earn. Once you've earned some hats, you can wear them by going to your profile.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2015-12-29T13:44:18.063" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7849" PostTypeId="2" ParentId="2140" CreationDate="2015-12-30T01:06:40.083" Score="-2" Body="&lt;h1&gt;Golf A Wiki&lt;/h1&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Golf a wiki. A wiki, for the purposes of this contest, is defined as a website with:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Content editable by all&lt;/li&gt;&#xA;&lt;li&gt;Easy CamelCase (defined as a word with two capitals) linking&lt;/li&gt;&#xA;&lt;li&gt;Different pages or articles that are the targets of the links&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Your wiki can be a self-contained HTML file (e.g. &lt;a href=&quot;http://www.tiddlywiki.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;TiddlyWiki&lt;/a&gt;), or a cgi-bin script (e.g. &lt;a href=&quot;http://www.c2.com/cgi/wiki?SigWik&quot; rel=&quot;nofollow noreferrer&quot;&gt;SigWik&lt;/a&gt;).&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Your score is the size of your program in bytes, divided by the number of extra features&#xA;implemented plus one.&lt;/p&gt;&#xA;&lt;p&gt;The possible extra features are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Page history&lt;/li&gt;&#xA;&lt;li&gt;Syntax for &amp;quot;nowiki&amp;quot;, that is, something &lt;s&gt;like &amp;lt;\noscript&amp;gt; in HTML&lt;/s&gt; that makes the text inside it not be wiki syntax.&lt;/li&gt;&#xA;&lt;li&gt;A page list&lt;/li&gt;&#xA;&lt;li&gt;A find page facility&lt;/li&gt;&#xA;&lt;li&gt;Usernames and passwords (with registering)&lt;/li&gt;&#xA;&lt;li&gt;Security levels (requires usernames and passwords, or possibly IPs?)&lt;/li&gt;&#xA;&lt;li&gt;Delete pages&lt;/li&gt;&#xA;&lt;li&gt;Change page titles&lt;/li&gt;&#xA;&lt;li&gt;Redirects&lt;/li&gt;&#xA;&lt;li&gt;Random page&lt;/li&gt;&#xA;&lt;li&gt;Non-HTML formatting that is not just links &lt;em&gt;[Should I remove this? I doubt it will be done.]&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Lowest score wins, as this is code golf.&lt;/p&gt;&#xA;&lt;h1&gt;&lt;em&gt;&lt;strong&gt;DISCLAIMER&lt;/strong&gt;&lt;/em&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;ANSWERS WILL PROBABLY CONTAIN MAJOR SECURITY FLAWS. ONLY USE ON PRIVATE PORTS, UNLESS YOU WANT YOUR COMPUTER AND VERY POSSIBLY YOUR WHOLE NETWORK TO GET DESTROYED (FIGURATIVELY).&lt;/strong&gt;&lt;/em&gt; [Is this too forceful?]&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="47092" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-31T02:16:17.227" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7852" PostTypeId="2" ParentId="2140" CreationDate="2015-12-30T12:00:30.093" Score="0" Body="&lt;h1&gt;Everything about PI&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Pi is the most popular transcedental number. As a result, pi has been thoroughly studied. This challenge is in spirit of 9-Hole challenge.&lt;/p&gt;&#xA;&lt;h2&gt;1. Digits of PI&lt;/h2&gt;&#xA;&lt;p&gt;Given n and k, output n'th digit after the decimal point in the base-k representation. For example, the 5th digit of PI base 10 is 9.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;5 10&#xA;9&#xA;10 2&#xA;0&#xA;6 16&#xA;10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If the base is more than 10, output like in the last test case&lt;/p&gt;&#xA;&lt;p&gt;More information : &lt;a href=&quot;http://www.virtuescience.com/pi-in-other-bases.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.virtuescience.com/pi-in-other-bases.html&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;2. Continued fraction of PI&lt;/h2&gt;&#xA;&lt;p&gt;Given n, output n'th number in continued fraction of Pi.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;5&#xA;292&#xA;7&#xA;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;3. Closest to PI&lt;/h2&gt;&#xA;&lt;p&gt;Given a positive integer &lt;code&gt;d&lt;/code&gt;, output the integer &lt;code&gt;n&lt;/code&gt; such that &lt;code&gt;n/d&lt;/code&gt; is closest to pi. For example, &lt;code&gt;17/5&lt;/code&gt; is closer to pi than any other &lt;code&gt;n/5&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 5&#xA; 17&#xA; 7&#xA; 22&#xA; 21&#xA; 66&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;4. Closest to PI 2&lt;/h2&gt;&#xA;&lt;p&gt;Given a positive integer &lt;code&gt;n&lt;/code&gt;, output the integer &lt;code&gt;d&lt;/code&gt; such that &lt;code&gt;n/d&lt;/code&gt; is closest to pi.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;5&#xA;2&#xA;7&#xA;2&#xA;20&#xA;6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Restriction.&lt;/h1&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You should not have any floating-number buildin, only integer, including PI constants.&lt;/li&gt;&#xA;&lt;li&gt;Standard loophole is disallowed.&lt;/li&gt;&#xA;&lt;li&gt;The program may be 4 program or a program that reads challenge number.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h1&gt;Sandbox Question&lt;/h1&gt;&#xA;&lt;p&gt;Originally, I have 5 challenge, 4 more required. Now, one of them is dupe. 5 more required.&lt;/p&gt;&#xA;" OwnerUserId="46245" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2015-12-31T05:59:29.683" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="7853" PostTypeId="1" AcceptedAnswerId="7855" CreationDate="2015-12-30T21:50:21.750" Score="7" ViewCount="163" Body="&lt;p&gt;I'm going to post a challenge that requires taking a multiple line string as input. What's the best way to go about this? I don't want any languages to be excluded because they can't take input in a certain way. Should I&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Let each poster determine how they want to take input? This might lead to unintended exploits.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Give input as several strings?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A list of strings?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Command line arguments?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I'm not sure what makes the most sense. &lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2015-12-30T21:54:31.897" Title="How to take multiline input?" Tags="|discussion|asking-questions|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7854" PostTypeId="2" ParentId="7853" CreationDate="2015-12-30T21:54:30.300" Score="4" Body="&lt;p&gt;All of the things you mention are reasonable options. I'd just allow any of these. At the very least, a linefeed-delimited string and a list-type of strings seem like good options that can hardly be exploited. If there are any characters that can't appear in the lines, you might also allow those as alternative delimiters, to cover languages which have trouble reading multiple lines as well as lack list types.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The phrase I usually use is &quot;you may take input in any convenient list or string format [as long as the data is not pre-processed]&quot;. For output, I also add &quot;unambiguous&quot; to &quot;convenient&quot; to ensure that people use proper delimiters. So far I haven't had people exploit this.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2015-12-30T21:54:30.300" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7855" PostTypeId="2" ParentId="7853" CreationDate="2015-12-30T21:54:31.897" Score="6" Body="&lt;p&gt;Almost all languages can take multiline input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, for those that can't, I usually allow an alternative separator to newline (for example, &quot;lines can be separated by either newlines or commas&quot;).&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2015-12-30T21:54:31.897" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="7858" PostTypeId="2" ParentId="2140" CreationDate="2015-12-31T09:08:23.750" Score="1" Body="&lt;h2&gt;Make a New Year countdown&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Editor's note&lt;/strong&gt;: This challenge is cancelled because it is the year 2016, and I'm too late&lt;/em&gt;. XP &lt;em&gt;It is kept here for posterity&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is New Year coming soon. As such, it would be a great idea to make a New Year countdown. That is your challenge today!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Happy New Year&lt;/strong&gt;!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The full rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Create a program taking from &lt;code&gt;STDIN&lt;/code&gt; the current time and outputting a countdown until New Year into &lt;code&gt;STDOUT&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The program should be flexible - after Year 2015 has concluded, the program should count down until New Year 2017, and so on. See examples for more information.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The program should count down until it is taken down by external means (using &lt;kbd&gt;Ctrl&lt;/kbd&gt;-&lt;kbd&gt;C&lt;/kbd&gt;, the Task Manager, the reset button, et cetera).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The countdown may be formatted however you like.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;At the null second in the new year (YYYY-01-01 00:00:00), it should output 0 days, 0 hours, 0 minutes 0 seconds in your chosen format.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer wins.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The last rule: &lt;strong&gt;Have fun&lt;/strong&gt;!&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given the input after &lt;code&gt;from:&lt;/code&gt; the following countdown should be given, in any format you like (after &lt;code&gt;to:&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;from:&#xA;2015-12-31 06:00:00&#xA;to:&#xA;0 days 18:00:00&#xA;&#xA;from:&#xA;2015-12-31 23:59:57&#xA;to:&#xA;0 days 00:00:03&#xA;&#xA;from:&#xA;2016-01-01 00:00:00&#xA;to:&#xA;0 days 00:00:00&#xA;&#xA;from:&#xA;2016-01-01 00:00:01&#xA;to:&#xA;364 days 23:59:59&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="48538" LastEditorUserId="48538" LastEditDate="2015-12-31T21:17:59.573" LastActivityDate="2015-12-31T21:17:59.573" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7861" PostTypeId="2" ParentId="7822" CreationDate="2015-12-31T18:50:45.983" Score="17" Body="&lt;h1&gt;Languages must be usable on hardware the robbers probably already have&lt;/h1&gt;&#xA;&lt;p&gt;Though this may change over time, any &lt;strong&gt;general-purpose desktop or laptop PC&lt;/strong&gt; of &lt;strong&gt;average specifications&lt;/strong&gt; made within the last &lt;strong&gt;eight years&lt;/strong&gt; should be able to compile and run programs written in the language. If a language is usable only with...&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;very recent hardware&lt;/li&gt;&#xA;&lt;li&gt;older or less common hardware&lt;/li&gt;&#xA;&lt;li&gt;specialized or extremely high-end hardware&lt;/li&gt;&#xA;&lt;li&gt;hardware from a particular manufacturer or supplier (e.g. Apple)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;that language would probably not be acceptable.&lt;/p&gt;&#xA;&lt;p&gt;Emulators (and other types of compatibility layers) may help a language meet this requirement, though only if they are &amp;quot;free&amp;quot; and make it possible to compile and run, at a reasonable speed, programs written in the language. Each of the emulators must not require any copyrighted ROM image or other software component that cannot be legally obtained or used by the general public, at no cost, in conjunction with the emulator.&lt;/p&gt;&#xA;&lt;p&gt;In any case, a language is not usable on a particular computer if it would be necessary to install copyrighted software that cannot be legally obtained or used by the general public, at no cost, on that computer, such as OS X on a non-Apple-branded computer.&lt;/p&gt;&#xA;" OwnerUserId="163" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-01T00:51:55.223" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7863" PostTypeId="2" ParentId="2140" CreationDate="2015-12-31T19:32:10.067" Score="0" Body="&lt;p&gt;&lt;strong&gt;How to print 2016 using only the number 2?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Print &lt;code&gt;2016&lt;/code&gt; using only the digit 2 operators and native language built-in functions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The objective is to &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output the integer &lt;code&gt;2016&lt;/code&gt; without using any digits except 2.&lt;/li&gt;&#xA;&lt;li&gt;no characters / strings literals are allowed, i.e. no tricks like &lt;code&gt;ord('b')&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The code that uses the least number of 2s in the code wins. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For example, in python, the following code uses 8 twos.:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt; int(str(2**2*2) + str(2**2)) * int(str(2) + str(2**2))&#xA;2016&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or like this code, uses 13 twos:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt; 2 ** 2 ** 2 * 2 ** 2 ** 2 * 2 * 2 * 2 - 2 ** 2 ** 2 * 2&#xA;2016&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="11817" LastEditorUserId="36670" LastEditDate="2015-12-31T19:57:18.757" LastActivityDate="2015-12-31T19:57:18.757" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7864" PostTypeId="2" ParentId="2140" CreationDate="2016-01-01T01:35:52.127" Score="0" Body="&lt;h1&gt;Growing Quine 2&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to give program P1..P5 so that.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;For all k&amp;lt;5, length of Pk &amp;lt; length of Pk+1&lt;/li&gt;&#xA;&lt;li&gt;For all k&amp;lt;5, Pk outputs Pk+1&lt;/li&gt;&#xA;&lt;li&gt;For all k&amp;lt;=5, Pk is semi-pristine program. (Program that if any run on the source-code is deleted, will output different output)&lt;/li&gt;&#xA;&lt;li&gt;P5 return P1 sufficient times that the output will be longer than P5&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Shortest P1 wins&lt;/p&gt;&#xA;" OwnerUserId="46245" LastEditorUserId="46245" LastEditDate="2016-01-02T00:50:47.367" LastActivityDate="2016-01-02T00:50:47.367" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7865" PostTypeId="2" ParentId="6918" CreationDate="2016-01-01T21:12:22.963" Score="4" Body="&lt;h1&gt;inca&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/luser-dr00g/inca&quot; rel=&quot;nofollow noreferrer&quot;&gt;github&lt;/a&gt;. Created by luser droog (aka M. Joshua Ryan). Began as an exercise in understanding the obfuscated APL calculator program known as the &lt;a href=&quot;http://www.jsoftware.com/jwiki/Essays/Incunabulum&quot; rel=&quot;nofollow noreferrer&quot;&gt;incunabulum&lt;/a&gt;, and later adding capabilities and extensions. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;inca&lt;/strong&gt; exists in two distinct (more-or-less-)fully-realized versions. The original &lt;a href=&quot;https://github.com/luser-dr00g/inca/blob/master/inca.c&quot; rel=&quot;nofollow noreferrer&quot;&gt;inca.c&lt;/a&gt; is integer-only. &lt;a href=&quot;https://github.com/luser-dr00g/inca/blob/master/inca2.c&quot; rel=&quot;nofollow noreferrer&quot;&gt;inca2&lt;/a&gt; has support for char, int, and double datatypes. A third version was &lt;a href=&quot;https://github.com/luser-dr00g/inca/blob/master/inca3.c&quot; rel=&quot;nofollow noreferrer&quot;&gt;begun&lt;/a&gt; which collapsed under the weight of its own obfuscation. The integer version is available &lt;a href=&quot;http://baruchel.hd.free.fr/apps/apl/inca/&quot; rel=&quot;nofollow noreferrer&quot;&gt;online&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All of these programs expect a 32bit environment. See the Readme files &lt;a href=&quot;https://github.com/luser-dr00g/inca/blob/master/README.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;1&lt;/a&gt; &lt;a href=&quot;https://github.com/luser-dr00g/inca/blob/master/README2.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;2&lt;/a&gt; &lt;a href=&quot;https://github.com/luser-dr00g/inca/blob/master/README3.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;3&lt;/a&gt; or the &lt;a href=&quot;https://github.com/luser-dr00g/inca/wiki&quot; rel=&quot;nofollow noreferrer&quot;&gt;wiki&lt;/a&gt; for more usage and explanation, but it basically provides the basic pre-80s features of APL languages including dot and over operatprs which apply to user functions as well as built-ins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It has been used in 2 challenges:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/47255/ascii-ice-cream/47289#47289&quot;&gt;ASCII Ice Cream&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/12103/generate-a-universal-binary-function-lookup-table/41211#41211&quot;&gt;Generate a Universal-binary-function Lookup Table&lt;/a&gt;  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;And I'm designing the next version with the intent to present an amazing answer to this challenge:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/22620/draw-the-utah-teapot&quot;&gt;Draw the Utah Teapot&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-- &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;olmec&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://github.com/luser-dr00g/inca/tree/master/olmec&quot; rel=&quot;nofollow noreferrer&quot;&gt;next version&lt;/a&gt; is partly working and will offer amazing &quot;killer&quot; features. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Portability. No more &lt;code&gt;intptr_t&lt;/code&gt; foolishness. Source should compile and execute on any platform which can run xterm. Tested on Cygwin64+Windows 10.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&quot;All&quot; whitespace is optional (except to separate numbers). The symbol lookup is designed around &lt;em&gt;prefix-searching&lt;/em&gt; so multiple defined symbols may be juxtaposed into one &quot;identifier&quot; which is then split at execution time. Also, all punctuation characters, indeed anything not whitespace, part of a number, a paren, a quote, or a left-arrow is considered a valid identifier. (For testing and &quot;normal&quot; programming, it is advisable to separate symbols with space for better readability.) &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Outer parens are optional. &lt;code&gt;3)&lt;/code&gt; == &lt;code&gt;3&lt;/code&gt;. &lt;code&gt;(3&lt;/code&gt; == &lt;code&gt;3&lt;/code&gt;. &lt;code&gt;2&amp;amp;+)3&lt;/code&gt; == &lt;code&gt;5&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Idiom recognition. Since all function names are treated as identifiers, and juxtaposed identifiers are parsed at execution time, sequences of functions can be redefined. This may permit easy testing of &quot;slow&quot; programs by selectively replacing sequences of function symbols with faster versions. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;--&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Update: starting to get some results.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;josh@LAPTOP-ILO10OOF ~/inca/olmec&#xA;$ ./olmec&#xA;        ⎕k&#xA;·¨¯&amp;lt;≤=≥&amp;gt;≠¨²_÷&#xA;◆1234567890-×&#xA;QWERTYUIOP→£≠&#xA;?⍵∈⍴∾↑↓⍳○⋆←]⍀&#xA;ASDFGHJKL:&quot;  &#xA;⍺⌈⌊_∇∆∘'⎕º´  &#xA;ZXCVBNM«»¿   &#xA;⊂⊃∩∪⊥⊤|¶·⌿   &#xA;&#xA;        a←⍳9&#xA; 0 1 2 3 4 5 6 7 8&#xA;        1+3↑a)⍴¯7↓a&#xA; 0 1 0&#xA; 1 0 1&#xA;&#xA;        'hello, world!'&#xA;Segmentation fault (core dumped)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Needs some work. :)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$ ./olmec&#xA;        double←2&amp;amp;*&#xA;&amp;amp;&#xA;        double5&#xA; 10&#xA;        double⍳5&#xA; 0 2 4 6 8&#xA;        'hello world'&#xA;hello world&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Update May 2016: Implemented bracket indexing which produces &lt;em&gt;lvalues&lt;/em&gt; that can be on the left of the assignment arrow.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;        a←10 10⍴' '&#xA;        a[5;5 6 7 8 9]←'CROSS'&#xA;        a[4 5 6 7;7]←'WORD'&#xA;        a&#xA;&#xA;&#xA;&#xA;&#xA;               W    &#xA;           C R O S S&#xA;               R    &#xA;               D    &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Belated Update Sept 2016: Some months ago implemented direct definition of functions, &quot;del&quot; definitions with labels and branching. Current list of functions and operators: &lt;a href=&quot;https://github.com/luser-dr00g/inca/blob/master/olmec/tables.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://github.com/luser-dr00g/inca/blob/master/olmec/tables.md&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="2381" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-09-14T04:23:15.013" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7868" PostTypeId="2" ParentId="2140" CreationDate="2016-01-02T14:18:07.273" Score="1" Body="&lt;h1&gt;Clean numbers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We call a positive integer a clean number if it is expressible by using only a positive digit once or more and no other sign. For example 88 is expressible with 2's as 2&lt;sup&gt;2&lt;/sup&gt;22.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A more complex example is &lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$141289730531295606313143345858933 = 3^{33}3^{3^3}3333$$&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Details&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The possible operations are&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;exponentiation&lt;/li&gt;&#xA;&lt;li&gt;multiplication (only if the first part contains exponentiation as otherwise it is just digit concatenation)&lt;/li&gt;&#xA;&lt;li&gt;digit concatenation&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Precedence is as normal. Power towers are computed from right to left (top to bottom).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;sandbox note&lt;/strong&gt;: which one should it be? I'm thinking d) now&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a) given a number return if it is clean&lt;/li&gt;&#xA;&lt;li&gt;b) given a number return the digit with which it is clean&lt;/li&gt;&#xA;&lt;li&gt;c) given a number and a digit return if the number is clean with that digit&lt;/li&gt;&#xA;&lt;li&gt;d) given a number and a digit return digit-clean numbers up to the given number&lt;/li&gt;&#xA;&lt;li&gt;e) given a number find the smallest digit or digit-sequence which makes it clean (eg. 63504 = 252&lt;sup&gt;2&lt;/sup&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;TODO&#xA;(11^1)*11&#xA;2^(2^2*22)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your program should &lt;strong&gt;solve every test case in a couple of minutes&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code golf.&lt;/p&gt;&#xA;" OwnerUserId="7311" LastEditorUserId="668" LastEditDate="2016-01-02T16:19:02.377" LastActivityDate="2016-01-02T16:19:02.377" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="7869" PostTypeId="1" CreationDate="2016-01-02T16:06:17.640" Score="9" ViewCount="146" Body="&lt;p&gt;What is the most recommended way to include large test cases in a question?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Small test cases can be included in the question, but large test cases might go over the character limit or take up a lot of space, making the question cluttered.&lt;/p&gt;&#xA;" OwnerUserId="45643" LastActivityDate="2016-01-02T16:50:59.100" Title="Best way to include large test cases" Tags="|discussion|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7870" PostTypeId="2" ParentId="7869" CreationDate="2016-01-02T16:12:44.567" Score="-3" Body="&lt;p&gt;Based on what I have seen, pastebin is the best option. However, some alternatives include having an HTML page with the data, or uploading onto Google drive (not a very common option, haven't seen this so far). It also can depend on the challenge. I remember seeing in one recent question that the poster had a webpage that generated and printed random testcases. So you could use a similar method. &lt;/p&gt;&#xA;" OwnerUserId="34421" LastActivityDate="2016-01-02T16:12:44.567" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7871" PostTypeId="2" ParentId="7869" CreationDate="2016-01-02T16:12:53.370" Score="10" Body="&lt;p&gt;Questions should be self-contained whenever possible to guard against link rot. (Clicking away to other sites can also be annoying.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A good way to keep the test cases from consuming too much vertical space is to put them all in a single code block, which will then have a max-height and a scrollbar.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, when your test cases are so large that they exceed the character limit, you could use a &lt;a href=&quot;http://gist.github.com&quot; rel=&quot;nofollow&quot;&gt;Github Gist&lt;/a&gt;, which is unlikely to suddenly go down.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2016-01-02T16:12:53.370" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7874" PostTypeId="2" ParentId="2140" CreationDate="2016-01-02T16:46:00.353" Score="2" Body="&lt;h1&gt;Add two numbers (or Arithmetic on continued fraction expansions)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given two continued fraction expansions &lt;code&gt;N,M&lt;/code&gt; as lists of integers (in any suitable (human readable) format for your language) and an operation &lt;code&gt;@&lt;/code&gt; (addition, substraction, multiplication and division) &lt;code&gt;+-*&lt;/code&gt; or &lt;code&gt;/&lt;/code&gt; (e.g. encoded as numbers 1-4 or as characters or whathever is suitable for your language) return &lt;code&gt;N@M&lt;/code&gt; (the sum/difference/product/ratio) again in the form of a continued fraction expansion.&lt;/p&gt;&#xA;&lt;p&gt;By continued fraction expansion I mean a &lt;em&gt;simple continued fraction expansion&lt;/em&gt; which are of the form:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;                   1&#xA; a0 + -----------------------&#xA;                     1&#xA;       a1 + ------------------&#xA;                       1&#xA;             a2 + ------------&#xA;                         1&#xA;                   a3 + ------&#xA;                          ...&#xA;                &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Which will be represented as a list of the form &lt;code&gt;[a0,a1,a2,a3,...]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;p&gt;Is this too complicated? Should the challenge be reduced to only one operation e.g. &lt;code&gt;+&lt;/code&gt; or &lt;code&gt;*&lt;/code&gt;?&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-02T17:29:53.720" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7875" PostTypeId="2" ParentId="7869" CreationDate="2016-01-02T16:50:59.100" Score="7" Body="&lt;p&gt;Elaborating on TanMath's last suggestion, it is sometimes possible to generate test data programmatically. If you know JavaScript you can write a Stack Snippet which does this, so that people don't even have to run the generating code locally or in an online interpreter, but right there on the challenge. If not, you could still provide a link to ideone or similar for the generator. But make sure that you also include the code itself in the challenge, so people can still generate test cases if the link ever goes down.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But before you do any of this, ask yourself whether you actually need huge test cases. Unless you want to enforce efficient algorithms by imposing a time limit on large inputs, it is almost always possible to cover all possible edge cases with a number of smaller test cases.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-01-02T16:50:59.100" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7877" PostTypeId="1" AcceptedAnswerId="7879" CreationDate="2016-01-02T18:49:47.303" Score="5" ViewCount="192" Body="&lt;p&gt;As you may or may not know, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5024/20469&quot;&gt;we briefly had MathJax support on our main site&lt;/a&gt;. However, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5056/20469&quot;&gt;it caused all sorts of problems and was removed&lt;/a&gt;. For whatever reason, MathJax support was not removed on meta. While this doesn't affect typical questions posted on meta, it causes issues in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt; when users write challenges that have embedded formulas which render nicely in the Sandbox and don't render at all once it's on main. More importantly, causes issues with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5043/20469&quot;&gt;snippets&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7068/20469&quot;&gt;code blocks&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It doesn't make any sense to have MathJax here and not on the main site, thus I believe MathJax support should be removed on meta. (At least until MathJax support is reinstated on the main site, if it ever is.)&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="68942" LastEditDate="2021-04-27T17:29:44.707" LastActivityDate="2021-04-27T17:29:44.707" Title="Remove MathJax support on meta" Tags="|feature-request|status-declined|meta|latex|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7878" PostTypeId="2" ParentId="7877" CreationDate="2016-01-02T19:09:00.893" Score="7" Body="&lt;h1&gt;Yes, but try to fix MathJax ASAP&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Obviously, why have MathJax on meta (and sandbox) if it is really not going to help us on the real site? It provides no help, and can confuse users new to the sandbox. Thus, MathJax only on Meta is a detriment to our site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, just imagine how great it would be to &lt;em&gt;have&lt;/em&gt; MathJax! Now, there are problems with it and this site's compatibility. Is anyone doing anything to fix that? Here are some posts that would IMO benefit from MathJax:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/48037/prime-polynomials&quot;&gt;Prime polynomials&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/5562/implement-hyperexponentiation-tetration-without-the-use-of&quot;&gt;Implement hyperexponentiation/tetration without the use of &amp;#39;^&amp;#39;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/25642/length-of-string-using-set-theory&quot;&gt;Length of String Using Set Theory&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/50240/xor-multiplication&quot;&gt;XOR multiplication&lt;/a&gt; (the latter part)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/22573/solve-a-system-of-linear-equations&quot;&gt;Solve a System of Linear Equations&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;(Maybe not the time and place for that latter portion. I can remove it if it is off-topic.)&lt;/p&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-01-02T19:09:00.893" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7879" PostTypeId="2" ParentId="7877" CreationDate="2016-01-02T19:10:59.073" Score="4" Body="&lt;p&gt;Looks like the intrepid Stack Exchange community manager &lt;a href=&quot;https://meta.stackexchange.com/users/811/shog9&quot;&gt;Shog9&lt;/a&gt; graciously took care of this for us. See the unrendered MathJax below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$ \sqrt{2} $$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thanks so much, Shog!&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2016-01-02T19:10:59.073" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7881" PostTypeId="1" CreationDate="2016-01-02T23:07:33.797" Score="11" ViewCount="231" Body="&lt;p&gt;Triggered by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/60733/count-the-bytes-of-a-program/60740?noredirect=1#comment166202_60740&quot;&gt;this comment&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; answers assume a specific locale.  For example &lt;a href=&quot;https://codegolf.stackexchange.com/a/60740/11259&quot;&gt;this answer&lt;/a&gt; assumes a locale of &lt;code&gt;en_US.UTF-8&lt;/code&gt;.  If the default locale on a given system uses a different encoding, then the answer becomes invalid.  In order to make it valid, extra code to set the LC environment variables needs to be added with the effect of increasing the CG score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;@FUZxxl and I &lt;a href=&quot;http://chat.stackexchange.com/transcript/33758&quot;&gt;had an interesting discussion on this&lt;/a&gt;.  I think we'd both like to see a community consensus on this one.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-01-03T20:16:13.043" Title="Should locale be explicitly specified?" Tags="|discussion|code-golf|scoring|" AnswerCount="5" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7882" PostTypeId="2" ParentId="7881" CreationDate="2016-01-02T23:10:03.307" Score="-4" Body="&lt;h1&gt;&lt;code&gt;C&lt;/code&gt; is the default locale&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The standard (and only) locale as defined by IEEE 1003.1 (POSIX) and ISO 9899:2011 (C11) is the &lt;code&gt;C&lt;/code&gt; locale (or the equivalent &lt;code&gt;POSIX&lt;/code&gt; locale). Code that requires a different locale must explicitly set one.&lt;/p&gt;&#xA;" OwnerUserId="134" LastActivityDate="2016-01-02T23:10:03.307" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7883" PostTypeId="2" ParentId="7881" CreationDate="2016-01-02T23:11:40.630" Score="-6" Body="&lt;h2&gt;Add byte count of locale&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Answers that depend on locale in any way except for the &lt;code&gt;C&lt;/code&gt; locale must add to their score the length of the locale name (e.g. &lt;code&gt;en_US.UTF-8&lt;/code&gt; counts as 11 characters). This is similar to how perl answers add one character if the &lt;code&gt;-e&lt;/code&gt; flag is passed to the interpreter.&lt;/p&gt;&#xA;" OwnerUserId="134" LastActivityDate="2016-01-02T23:11:40.630" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7884" PostTypeId="2" ParentId="7881" CreationDate="2016-01-02T23:14:44.990" Score="-5" Body="&lt;h1&gt;&lt;code&gt;en_US.UTF-8&lt;/code&gt; is the default locale&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Most &lt;em&gt;mainstream&lt;/em&gt; operating systems will have US English (and thus en_US.UTF-8) as their defaults at install time.  Users will have to select something else if they want a different encoding.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code may depend on the locale being &lt;code&gt;en_US.UTF-8&lt;/code&gt; and only that locale without penalty.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="20469" LastEditDate="2016-01-03T20:16:13.043" LastActivityDate="2016-01-03T20:16:13.043" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7885" PostTypeId="2" ParentId="7881" CreationDate="2016-01-02T23:16:55.830" Score="5" Body="&lt;h2&gt;No need to specify locale&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I think this is splitting hairs. If you test a submission and it doesn't work due to locale settings, try English UTF-8. If that doesn't work, ask the poster of the submission.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the submission &lt;em&gt;requires&lt;/em&gt; a certain locale, the poster should mention this as a courtesy to those who wish to test the submission. However, there should be no penalty for this.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="20469" LastEditDate="2016-01-02T23:21:58.187" LastActivityDate="2016-01-02T23:21:58.187" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7886" PostTypeId="2" ParentId="7881" CreationDate="2016-01-02T23:20:10.040" Score="22" Body="&lt;h1&gt;If it requires a specific locale, specify&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I think this is the best solution. For example, if the code requires a locale of &lt;code&gt;en_US.UTF-8&lt;/code&gt; then you must specify in the answer. This is similar to how we specify encodings if it requires a specific encoding, e.g. Windows-1252.&lt;/p&gt;&#xA;" OwnerDisplayName="user46167" LastActivityDate="2016-01-02T23:20:10.040" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7889" PostTypeId="2" ParentId="2140" CreationDate="2016-01-03T11:00:47.460" Score="0" Body="&lt;h1&gt;War of Flatland&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;If you haven't read &lt;a href=&quot;http://www.geom.uiuc.edu/%7Ebanchoff/Flatland/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Flatland&lt;/a&gt;, please do so here. It is a must-read, for mathematical and non-mathematical alike.&lt;/p&gt;&#xA;&lt;p&gt;Oh no. No no no! War has broken out in &lt;a href=&quot;http://www.geom.uiuc.edu/%7Ebanchoff/Flatland/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Flatland&lt;/a&gt;. Society has crumbled, and all the women and children are either hiding or dead&lt;sup&gt;1&lt;/sup&gt;. It is total anarchy, kill or be killed. It is such conflict that the 4th dimensional people have erected indestructible borders to prevent the conflict spreading.&lt;/p&gt;&#xA;&lt;p&gt;On the plus side, if you came out on top, you could rule (some of) the entire world!&lt;/p&gt;&#xA;&lt;h2&gt;Specifications&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can be a shape with three or more sides. (No women&lt;sup&gt;1&lt;/sup&gt;, remember?)&lt;/li&gt;&#xA;&lt;li&gt;All shapes are regular.&lt;/li&gt;&#xA;&lt;li&gt;You can only see by sight. (No feeling; you'll be killed if you get close enough to do that!)&lt;/li&gt;&#xA;&lt;li&gt;Everybody starts with 1 health.&lt;/li&gt;&#xA;&lt;li&gt;You can hurt other people by stabbing one of their edges with a vertex.&lt;/li&gt;&#xA;&lt;li&gt;The vertex of an &lt;code&gt;n&lt;/code&gt; sided shape deals &lt;code&gt;1/n&lt;/code&gt; damage.&lt;/li&gt;&#xA;&lt;li&gt;An &lt;code&gt;n&lt;/code&gt; sided shape has &lt;code&gt;4n&lt;/code&gt; angles of vision (sensors evenly spaced around the shape which see the nearest point and return the distance to it).&lt;/li&gt;&#xA;&lt;li&gt;An &lt;code&gt;n&lt;/code&gt; sided shape can see &lt;code&gt;2n&lt;/code&gt; different distances (range &lt;a href=&quot;https://en.wikipedia.org/wiki/Interval_(mathematics)#Notations_for_intervals&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;[0,16)&lt;/code&gt;&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;People don't see themselves. (What good is sight if your body gets in the way?)&lt;/li&gt;&#xA;&lt;li&gt;People are all the same size (radius).&lt;/li&gt;&#xA;&lt;li&gt;People can see everything within 16 units of their centre point.&lt;/li&gt;&#xA;&lt;li&gt;If your health is &lt;code&gt;0&lt;/code&gt; or below, you are killed.&lt;/li&gt;&#xA;&lt;li&gt;The world has borders.&lt;/li&gt;&#xA;&lt;li&gt;You can rotate by a maximum of &lt;code&gt;15&lt;/code&gt; degrees either direction, then move exactly 1 unit towards either of your vertices every turn.&lt;/li&gt;&#xA;&lt;li&gt;Each shape's &amp;quot;radius&amp;quot; is 8 units.&lt;/li&gt;&#xA;&lt;li&gt;Degrees are anticlockwise from 3 O'clock. The 0th sensor is at 3 O'clock relative to the shape's orientation.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; This is not me being sexist. Read &lt;a href=&quot;http://www.geom.uiuc.edu/%7Ebanchoff/Flatland/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Flatland&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox Meta:&lt;/h1&gt;&#xA;&lt;p&gt;I am using the Sandbox as a public incubator. I will build up and work on the challenge until it is ready, then post it as a question. But it made more sense to let others see, comment on and help with this challenge's development.&lt;/p&gt;&#xA;&lt;p&gt;The Specifications are probably not going to remain in this format once the Stack Snippet and actual code is up and running.&lt;br /&gt;&#xA;I am working on, and have got quite far with, a JavaScript class to let people write code. If anyone can write a code to do the &lt;sub&gt;&lt;sup&gt;boring&lt;/sup&gt;&lt;/sub&gt; rendering thing onto a HTML5 canvas, I would be grateful.&lt;/p&gt;&#xA;&lt;h3&gt;Stuff I plan to add:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A stack-snippet battlefield&lt;/li&gt;&#xA;&lt;li&gt;A JavaScript class to let people write code&lt;/li&gt;&#xA;&lt;li&gt;A web-socket system to let people make submissions in other languages&lt;/li&gt;&#xA;&lt;li&gt;A system to pull submissions from answers (I'm no good at this sort of thing)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="43394" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-05T19:57:45.607" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="7890" PostTypeId="2" ParentId="2140" CreationDate="2016-01-03T12:57:03.537" Score="0" Body="&lt;h1&gt;Zipping double quine.&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;You must provide 2 program, A and B. Both are a quine and have same length.&lt;/p&gt;&#xA;&lt;p&gt;If A and B is zipped each other(Both when A is zipped first, or B is zipped first), the result is also an quine.&lt;/p&gt;&#xA;&lt;p&gt;Standard Loopholes is not allowed and standard quine rules apply.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;If program A is &lt;code&gt;ABCDEF&lt;/code&gt; and program B is &lt;code&gt;GHIJKL&lt;/code&gt; then&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;slangi &amp;quot;ABCDEF&amp;quot;&#xA;ABCDEF&#xA;slangi &amp;quot;GHIJKL&amp;quot;&#xA;GHIJKL&#xA;slangi &amp;quot;AGBHCIDJEKFL&amp;quot;&#xA;AGBHCIDJEKFL&#xA;slangi &amp;quot;GAHBICJDKELF&amp;quot;&#xA;GAHBICJDKELF&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="46245" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-03T12:57:03.537" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7891" PostTypeId="2" ParentId="6918" CreationDate="2016-01-03T18:30:57.520" Score="2" Body="&lt;h2&gt;&lt;a href=&quot;https://github.com/GamrCorps/Java-Golf&quot; rel=&quot;nofollow noreferrer&quot;&gt;Glava&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;I, GamrCorps, made Glava in January 2016. It is still a MAJOR work-in-progress, but it is still very useful. Click the link above to view the docs and download the interpreter (written in Java).&lt;/p&gt;&#xA;&lt;p&gt;Glava is a Java dialect focused on code golf. Many of the common keywords and phrases can be shortened down two around two characters each. It also sports an autocomplete feature, where you can omit the &lt;code&gt;}&lt;/code&gt;s, &lt;code&gt;]&lt;/code&gt;s, &lt;code&gt;)&lt;/code&gt;s, and &lt;code&gt;&amp;quot;&lt;/code&gt;s at the end of your code and it will automatically put them in.&lt;/p&gt;&#xA;&lt;p&gt;Another neat feature is what I call MCRP (Main Class Recognition and Placement). Simply put, if you do not have a class anywhere in the file, the interpreter will put one there for you! Also, a few common import statements will automatically be placed in with the same process (&lt;code&gt;java.utils.*&lt;/code&gt;, &lt;code&gt;java.lang.*&lt;/code&gt;, etc.)!&lt;/p&gt;&#xA;&lt;p&gt;The interpreter SHOULD work in any Java version (I believe past 6), because it compiles the Glava programs into your native Java version.&lt;/p&gt;&#xA;" OwnerUserId="36670" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-03T18:30:57.520" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7893" PostTypeId="1" CreationDate="2016-01-03T22:20:07.287" Score="13" ViewCount="261" Body="&lt;p&gt;There are some questions about the setup of the site that get asked time and time again on Meta. These include allowing code-golfing languages, language-based handicaps, duplicate-closing on the main site, and others.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Whenever these questions are asked, they are immediately closed as duplicates, because the question has been asked before. For instance, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7887/are-golf-languages-finally-drowning-us&quot;&gt;this question&lt;/a&gt;, asked yesterday, was closed as a duplicate of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/88/on-golfscript-and-language-bigotry&quot;&gt;this question&lt;/a&gt;, asked over four years ago.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For another example, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7243/can-i-write-a-golfing-library&quot;&gt;this question about golfing libraries&lt;/a&gt; was closed as a duplicate of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/435/is-a-code-golfing-library-legitimate&quot;&gt;this four year old question&lt;/a&gt;, despite the former getting an answer with 16 upvotes that recommends the opposite of the top answers to the latter. This is a case where the consensus has pretty clearly changed over the intervening period.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While in theory new answers can be posted to these very old questions, in practice they essentially never are. Moreover, opinions change over time, and meta answers are very often opinion based, as opposed to the objective questions on the main site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Closing new questions in favor of ancient ones is detrimental to the sharing of ideas, and promotes the status quo regardless of whether the status quo is desired by the community. It also makes it harder for newer users to interact, because they might have a hard time finding the appropriate ancient question to post an answer to.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are at least three options we have:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The current policy: Close all newer questions as duplicates.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Create canonical, high-quality questions which are kept up to date and easily reachable, perhaps with a special tag, and close everything else, including the older question, as duplicates of it. This might encourage continued debate in an organized fashion.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Don't close such questions as duplicates of questions that are at least year old. Post an answer with similar content as the top answer of the older one if appropriate, but allow renewed discussion.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I am strongly in favor of changing this practice, but I'd be interested to  hear what others think.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2017-01-07T04:53:03.623" Title="Closing as Duplicate on Meta" Tags="|discussion|meta|duplicates|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7895" PostTypeId="2" ParentId="1950" CreationDate="2016-01-04T01:01:44.487" Score="3" Body="&lt;h1&gt;Comment Votes&lt;/h1&gt;&#xA;&lt;p&gt;Add a comment if you think it's a duplicate answer and ask people to up vote the comment. No loss of reputation for the person who answered, still able to get the opinion of the public. Also, you don't get the muddling of the opinions of others (as in, whether or not they think it's a good answer, regardless of its status as duplicate). Other than that, the same issues apply for this as the voting on the answer solution.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h3&gt;Advantage&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This method is strictly objective. This is the only thing going for it, but hey, it's enough to keep popularity contests going, right?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Disadvantage&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The method by which users cast their votes is strictly subjective&lt;/li&gt;&#xA;&lt;li&gt;This would have to be posted on every single challenge who wished to apply the rule&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-04T01:01:44.487" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7897" PostTypeId="1" CreationDate="2016-01-04T01:58:45.137" Score="53" ViewCount="3055" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;Programming Puzzles &amp;amp; Code Golf&lt;/a&gt; will someday &lt;a href=&quot;https://area51.stackexchange.com/proposals/4570/code-golf-programming-puzzles&quot;&gt;graduate out of public beta&lt;/a&gt;, and it will get a new site design. Stack Exchange employees generally do all the design work and make the design decisions, but that doesn't mean we can't nudge them in the right direction when the time comes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This meta post is for discussing and rating ideas about our graduation design; the shapes, colors, icons, images, fonts, etc. to use. &lt;strong&gt;There is also &lt;a href=&quot;https://chat.stackexchange.com/rooms/33840/ppcg-graduation-design-discussion&quot;&gt;a chatroom&lt;/a&gt; for brainstorming.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every answer to this question should be a proposal about one particular aspect of the design. This way each idea can be kept separate from related ideas and be up or downvoted individually.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some specific design aspects that you might make a post about:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Main logo (and favicon)&lt;/li&gt;&#xA;&lt;li&gt;Main title&lt;/li&gt;&#xA;&lt;li&gt;Top banner image (e.g. from &lt;a href=&quot;https://cdn.sstatic.net/academia/img/header@2.png?v=9f04f439e2a8&quot; rel=&quot;nofollow noreferrer&quot;&gt;academia&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Background (e.g. from &lt;a href=&quot;https://cdn.sstatic.net/codereview/img/pattern.png?v=8286dee84d00&quot; rel=&quot;nofollow noreferrer&quot;&gt;code review&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Up and downvote buttons&lt;/li&gt;&#xA;&lt;li&gt;Favorite question button&lt;/li&gt;&#xA;&lt;li&gt;Accepted answer checkmark&lt;/li&gt;&#xA;&lt;li&gt;Badges&lt;/li&gt;&#xA;&lt;li&gt;Color scheme&lt;/li&gt;&#xA;&lt;li&gt;Guiding principles&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Feel free to add to the list if you think something is missing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is the sprite sheet from &lt;a href=&quot;https://stackoverflow.com/&quot;&gt;Stack Overflow&lt;/a&gt; for an idea of what design elements can change. (Many other things can be changed as well.) &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/I5Xf1.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/I5Xf1.png&quot; alt=&quot;SO sprite sheet&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(&lt;a href=&quot;https://cdn.sstatic.net/stackoverflow/img/sprites.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;original&lt;/a&gt;) (&lt;a href=&quot;https://jsfiddle.net/CalvinsHobbies/Lg7gs88q/embedded/result/&quot; rel=&quot;nofollow noreferrer&quot;&gt;various design components from all sites&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So this question might end up with several answers about each list topic, but the highest voted ones will indicate what we PPCG users really want in our design.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="26997" LastEditDate="2016-01-05T08:12:28.433" LastActivityDate="2017-01-05T18:08:15.003" Title="Graduation Design Ideas" Tags="|discussion|beta-status|" AnswerCount="19" CommentCount="17" ContentLicense="CC BY-SA 3.0" />
  <row Id="7898" PostTypeId="2" ParentId="7897" CreationDate="2016-01-04T02:03:07.087" Score="74" Body="&lt;h1&gt;No relation to the sport golf&lt;/h1&gt;&#xA;&lt;p&gt;There should be nothing related to actual golf in the design. Our name may make for good puns, but it would be way too cheesy to be used.&lt;/p&gt;&#xA;" OwnerUserId="31343" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-04T02:03:07.087" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="7899" PostTypeId="2" ParentId="7897" CreationDate="2016-01-04T02:07:24.307" Score="52" Body="&lt;h1&gt;&lt;s&gt;Vote&lt;/s&gt; Boat Buttons - Game of Life Boats&lt;/h1&gt;&#xA;&lt;p&gt;They could be &lt;a href=&quot;http://www.conwaylife.com/wiki/Boat&quot; rel=&quot;nofollow noreferrer&quot;&gt;boat&lt;/a&gt; still life's from Conway's game of life.&lt;/p&gt;&#xA;&lt;p&gt;Upvote:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Vgn73.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Vgn73.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Downvote:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/coUEq.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/coUEq.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;These are Phi's circular rotated versions, which I think work much better.&lt;/p&gt;&#xA;&lt;p&gt;With glowyness (credit to Cᴏɴᴏʀ O'Bʀɪᴇɴ):&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/teESW.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/teESW.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Doᴡɴɢᴏᴀᴛ's boats:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/7ErDn.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/7ErDn.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The main fun part with these is that then it could be called upboating and downboating.&lt;/p&gt;&#xA;&lt;p&gt;If you have an image for this design that's not too different, feel free to edit the post and include it.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-05T05:02:01.503" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="7900" PostTypeId="2" ParentId="7897" CreationDate="2016-01-04T02:14:25.273" Score="-8" Body="&lt;h1&gt;Vote Buttons - Bracket Fish&lt;/h1&gt;&#xA;&lt;p&gt;They could be the fish symbol &lt;code&gt;&amp;gt;&amp;lt;&amp;gt;&lt;/code&gt; from the &lt;a href=&quot;https://esolangs.org/wiki/Fish&quot; rel=&quot;nofollow noreferrer&quot;&gt;eponymous esoteric language&lt;/a&gt; rotated to vertically point up and down&lt;/p&gt;&#xA;&lt;p&gt;So perhaps something like&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/pLu9j.png&quot; alt=&quot;&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;as &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/26580391#26580391&quot;&gt;Conor suggested in chat&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If you have an image for this design feel free to edit the post and include it.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-04T02:29:21.323" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7902" PostTypeId="2" ParentId="7897" CreationDate="2016-01-04T03:58:22.990" Score="33" Body="&lt;h1&gt;Guiding Principle/Color Scheme - Anything but blue&lt;/h1&gt;&#xA;&lt;p&gt;All beta Stack Exchange sites have the same light blue design which I am kind of sick of, but it doesn't stop there. Looking at &lt;a href=&quot;https://stackexchange.com/sites#oldest&quot;&gt;all the SE sites&lt;/a&gt;, I quickly categorized the non-beta computer-related sites as blue or not blue, based on their icon colors.&lt;/p&gt;&#xA;&lt;p&gt;Blue: (or blueish components)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;super user&lt;/li&gt;&#xA;&lt;li&gt;web applications&lt;/li&gt;&#xA;&lt;li&gt;webmasters&lt;/li&gt;&#xA;&lt;li&gt;user experience&lt;/li&gt;&#xA;&lt;li&gt;unix and linux&lt;/li&gt;&#xA;&lt;li&gt;theoretical computer science&lt;/li&gt;&#xA;&lt;li&gt;ask different&lt;/li&gt;&#xA;&lt;li&gt;programmers&lt;/li&gt;&#xA;&lt;li&gt;information security&lt;/li&gt;&#xA;&lt;li&gt;database administrators&lt;/li&gt;&#xA;&lt;li&gt;code review&lt;/li&gt;&#xA;&lt;li&gt;drupal answers&lt;/li&gt;&#xA;&lt;li&gt;sharepoint&lt;/li&gt;&#xA;&lt;li&gt;cryptography&lt;/li&gt;&#xA;&lt;li&gt;salesforce&lt;/li&gt;&#xA;&lt;li&gt;network engineering&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Not Blue:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;stack overflow&lt;/li&gt;&#xA;&lt;li&gt;server fault&lt;/li&gt;&#xA;&lt;li&gt;game development&lt;/li&gt;&#xA;&lt;li&gt;android enthusiasts&lt;/li&gt;&#xA;&lt;li&gt;ask ubuntu&lt;/li&gt;&#xA;&lt;li&gt;electrical engineering&lt;/li&gt;&#xA;&lt;li&gt;mathematica&lt;/li&gt;&#xA;&lt;li&gt;rasberry pi&lt;/li&gt;&#xA;&lt;li&gt;tex - latex&lt;/li&gt;&#xA;&lt;li&gt;expressionengineanswers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I'd prefer if PPCG stayed away from this blue trend. Any other dominating color would be fine (perhaps greens?), just not blue!&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-05T18:34:58.677" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7904" PostTypeId="2" ParentId="7897" CreationDate="2016-01-04T07:10:20.333" Score="32" Body="&lt;h1&gt;Let's keep it newcomer-friendly&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;By all means customise various aspects of the site, but let's have a guiding principle that this shouldn't obscure the intuitive meaning of any of the buttons or symbols. Both users of other Stack Exchange sites and brand new users from outside Stack Exchange should be able to see what is going on without needing to read Meta first.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2016-01-04T07:10:20.333" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7906" PostTypeId="2" ParentId="7897" CreationDate="2016-01-04T08:02:44.950" Score="30" Body="&lt;h1&gt;&quot;Hello World&quot; Greeting&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Many organizations have the word &quot;Welcome&quot; in many languages displayed prominently to show that they are internationally-friendly. How about take a selection of answers from the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world&quot;&gt;Hello World catalogue&lt;/a&gt; and incorporate them into a watermarked background for the site, or a &quot;Hello World&quot; of the day?&lt;/p&gt;&#xA;" OwnerUserId="46313" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-01-04T08:02:44.950" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7907" PostTypeId="1" CreationDate="2016-01-04T13:17:54.147" Score="-6" ViewCount="229" Body="&lt;p&gt;The idea of Programming Puzzles &amp;amp; Code Golf is excellent. Putting-out challenges, submitting your take on the solution, receiving feedback. But it seems to be mainly code golf, and this then just seems to be a 'race to the bottom' for all the 'golfing languages'. These languages are great, but lets try to think about things through the lens of the beginner programmer for a moment...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What's the biggest thing a beginner programmer is lacking?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Textbooks? No.&lt;/li&gt;&#xA;&lt;li&gt;Feedback? No - Stack Exchange has this covered.&lt;/li&gt;&#xA;&lt;li&gt;Tutorials? No. - The internet has this covered.&lt;/li&gt;&#xA;&lt;li&gt;Practice? YES&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Absolute beginners need practice. To quote the &lt;a href=&quot;http://codekata.com/&quot; rel=&quot;nofollow&quot;&gt;Code Kata site&lt;/a&gt;:    &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;How do you get to be a great musician? It helps to know the theory, and to understand the mechanics of your instrument. It helps to have talent. But ultimately, greatness comes from practicing; applying the theory over and over again, using feedback to get better every time.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Languages like Java, or C++ are daunting for beginners. Especially 'self-taughts' who won't have the benefit of being thrown in at the deep end at a software company. Code golf isn't going to help - all those golfing languages? Fish? BrainF*ck? Eh? But &lt;em&gt;code kata&lt;/em&gt; WILL help.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;People can submit challenges, give them a [beginner|intermediate|advanced|whatever] rating. Then people can work away at them in their own time, submit their answers, share, discuss, receive constructive feedback...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How do we implement this into Programming Puzzles &amp;amp; Code Golf? Change the title to Code Kata, Puzzles &amp;amp; Golf?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think PP&amp;amp;CG could be an excellent platform for beginners. I think this is the niche that desperately needs to be filled right now!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have never commented on META before, so if there's anyone here that can help promote this (or however this works), I'd be grateful. &lt;/p&gt;&#xA;" OwnerUserId="47229" OwnerDisplayName="John A Durston" LastEditorUserId="20469" LastEditDate="2016-01-04T18:15:34.753" LastActivityDate="2016-01-04T18:15:34.753" Title="Code kata should be added to Programming Puzzles &amp; Code Golf" Tags="|feature-request|status-declined|asking-questions|scope|" AnswerCount="1" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="7908" PostTypeId="2" ParentId="7907" CreationDate="2016-01-04T13:29:46.650" Score="12" Body="&lt;p&gt;Code Katas are a great idea in general, but I don't see how they fit into this community. &lt;em&gt;The&lt;/em&gt; main requirement for every challenge posted here is that it has to have an objective winning criterion. Code Katas are looking for &lt;em&gt;good&lt;/em&gt; solutions, whatever that means in the language you're currently using. But that's something you can't really quantify. Whether any piece of code's style is good is entirely subjective.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="20469" LastEditDate="2016-01-04T18:13:22.460" LastActivityDate="2016-01-04T18:13:22.460" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7910" PostTypeId="1" CreationDate="2016-01-04T14:10:46.830" Score="39" ViewCount="1104" Body="&lt;p&gt;At the end of each year, our &lt;s&gt;nemesis&lt;/s&gt; friendly neighbours at Code Review vote for the best questions and answers from that year. I think that is a great tradition we should &lt;s&gt;steal&lt;/s&gt; adopt here as well, because it allows us to showcase some of the amazing content we've created and potentially reward the authors.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2015 has already ended, but I don't see a problem with determining the winners a few weeks into the new year.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To start, we need categories. That's what this post is for! Each answer should contain a category for a challenge or answer to be rewarded. The top-voted categories will then receive separate nomination posts to find the actual winners. (I don't want to put a fixed number of categories here, because I can't anticipate how many proposals we'll get. Something between 5 and 10 seems reasonable.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Winners will be rewarded with bounties where applicable (that is, for answer categories). For question categories I'm happy to take suggestions for rewards. Maybe our supreme challenge writers like Calvin's Hobbies and Zgarb might volunteer to post a challenge related to the author?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you're willing to reward the winner of a category yourself (by offering your own rep for the bounty), please mention that in the category proposal.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2016-01-08T22:23:25.683" LastActivityDate="2016-01-08T22:23:25.683" Title="Best of PPCG 2015 — Call for Categories" Tags="|discussion|best-of|" AnswerCount="40" CommentCount="15" ClosedDate="2016-01-08T22:23:33.193" ContentLicense="CC BY-SA 3.0" />
  <row Id="7911" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T14:16:07.503" Score="30" Body="&lt;p&gt;&lt;strong&gt;Less is more:&lt;/strong&gt; Best challenge with a simple but novel problem and a concise and clear spec.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-01-04T14:16:07.503" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7912" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T14:17:21.663" Score="16" Body="&lt;p&gt;&lt;strong&gt;Best Newcomer (answer):&lt;/strong&gt; Best answer by a user who had not posted an answer before 2015. (Idea taken from Code Review.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2016-01-04T15:12:08.830" LastActivityDate="2016-01-04T15:12:08.830" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7913" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T14:22:54.927" Score="18" Body="&lt;p&gt;&lt;strong&gt;Persistent:&lt;/strong&gt; Best answer where a user has dramatically improved his/her original answer, sometimes multiple times in a row.&lt;/p&gt;&#xA;" OwnerUserId="41723" LastActivityDate="2016-01-04T14:22:54.927" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7914" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T14:30:20.610" Score="25" Body="&lt;p&gt;&lt;strong&gt;Best Newcomer (challenge)&lt;/strong&gt;: Best challenge by a user who had not posted a challenge before 2015 (this is basically equivalent to &lt;strong&gt;Best Newcomer&lt;/strong&gt; but for challenges instead of answers).&lt;/p&gt;&#xA;" OwnerUserId="41723" LastActivityDate="2016-01-04T14:30:20.610" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7915" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T14:35:36.057" Score="20" Body="&lt;p&gt;&lt;strong&gt;Right tool:&lt;/strong&gt; Best answer using a special ability of a language.&lt;/p&gt;&#xA;" OwnerUserId="7311" LastActivityDate="2016-01-04T14:35:36.057" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7916" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T14:41:31.643" Score="31" Body="&lt;p&gt;&lt;strong&gt;Educational:&lt;/strong&gt; Best answer containing interesting and/or deep mathematical (or other) material.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;I will offer a 200 reputation bounty for the winner of this category.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="7311" LastEditorUserId="7311" LastEditDate="2016-01-04T15:31:11.583" LastActivityDate="2016-01-04T15:31:11.583" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7917" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T14:59:38.410" Score="9" Body="&lt;p&gt;&lt;strong&gt;Most Impractical&lt;/strong&gt;: Best answer where in the interest of saving characters, the runtime will encounter &lt;a href=&quot;https://en.wikipedia.org/wiki/Ultimate_fate_of_the_universe#Big_Freeze_or_heat_death&quot; rel=&quot;nofollow&quot;&gt;Universe heat-death&lt;/a&gt; issues, or requires more storage space than &lt;a href=&quot;https://en.wikipedia.org/wiki/Observable_universe#Matter_content&quot; rel=&quot;nofollow&quot;&gt;atoms available&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="42963" LastActivityDate="2016-01-04T14:59:38.410" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7918" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T15:13:41.660" Score="4" Body="&lt;h3&gt;Best title&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Borrowed from the Code Review categories.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;Best&quot; can be measured as a combination of things:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Descriptive&lt;/li&gt;&#xA;&lt;li&gt;Intriguing&lt;/li&gt;&#xA;&lt;li&gt;Funny&lt;/li&gt;&#xA;&lt;li&gt;Any more we can think of...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2016-01-04T15:13:41.660" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7919" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T15:23:38.440" Score="11" Body="&lt;h3&gt;Phoenix&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Most dramatic improvement in a question. For example, a question that was closed and then edited to become hugely successful.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2016-01-04T15:23:38.440" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7920" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T15:31:37.730" Score="-1" Body="&lt;h3&gt;Flypaper&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Question that has attracted the largest number of first time answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That is, the question that has brought the largest number of newcomers to the site.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;We'd need to settle on the finer details of the rules:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;First time answers only count from users who then went on to post at least one more net positively voted question/answer.&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;First time answers only count if they are net positively voted and not deleted.&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2016-01-04T15:48:18.370" LastActivityDate="2016-01-04T15:48:18.370" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7921" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T15:57:16.860" Score="27" Body="&lt;h1&gt;Most Above-and-Beyond Answer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Every once and a while, an answer takes the challenge to the extreme.  This prize will be awarded to an answer which went far beyond the expectations of the challenge. This could include&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a code golf answer that brute-forced/proved the shortest program in some language&lt;/li&gt;&#xA;&lt;li&gt;a graphical-output popcon answer of extreme size and quality&lt;/li&gt;&#xA;&lt;li&gt;a KOTH answer of high complexity which absolutely dominated the competition&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2016-01-04T15:57:16.860" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7922" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T15:59:59.373" Score="2" Body="&lt;h2&gt;Best use of a Stack Snippet&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Question or answer which demonstrated the best use of a stack snippet.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="43444" LastEditDate="2016-01-04T16:04:20.267" LastActivityDate="2016-01-04T16:04:20.267" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7923" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T16:03:23.350" Score="8" Body="&lt;p&gt;&lt;strong&gt;Jack of all trades&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;User who posts answers with detailed explanations in many languages, allowing those not versed in the language to understand what is going on&lt;/p&gt;&#xA;" OwnerUserId="43444" LastActivityDate="2016-01-04T16:03:23.350" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7924" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T16:07:07.577" Score="14" Body="&lt;p&gt;&lt;strong&gt;Rookie of the year&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner of this category will have regularly posted high-quality questions and/or answers since they joined the site, which must have occurred in 2015.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;As a newcomer myself, I would be willing to offer a 100-rep bounty to an answer that the winner of this award as posted.&lt;/p&gt;&#xA;" OwnerUserId="43444" LastEditorUserId="43444" LastEditDate="2016-01-08T16:22:27.903" LastActivityDate="2016-01-08T16:22:27.903" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7925" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T16:20:08.743" Score="2" Body="&lt;p&gt;&lt;strong&gt;Win with a longwinded language&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Win with a language such as Java, beating out shorter languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Needs some better criteria.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="46271" LastActivityDate="2016-01-04T16:20:08.743" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="7926" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T16:32:51.133" Score="3" Body="&lt;p&gt;&lt;strong&gt;Tiger Woods&lt;/strong&gt;: Answer with the best, most impressive golfing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;If you feel this  category is unnecessary/overlaps with others please upvote Martin's comment.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="7311" LastEditorUserId="7311" LastEditDate="2016-01-04T16:42:55.327" LastActivityDate="2016-01-04T16:42:55.327" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7928" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T17:47:41.513" Score="-6" Body="&lt;p&gt;&lt;strong&gt;Class clown:&lt;/strong&gt; An answer that made everyone guffaw when they first read/understood it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note that this should probably only apply to answers that also followed the rules of the challenge to which they were posted, as wilfully misinterpreting rules is no longer funny.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="47050" LastActivityDate="2016-01-04T17:47:41.513" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7929" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T17:49:11.057" Score="14" Body="&lt;p&gt;&lt;strong&gt;Silver lining&lt;/strong&gt;: Answer with the most clever &lt;s&gt;ab&lt;/s&gt;use of an interpreter &lt;s&gt;bug&lt;/s&gt; undocumented feature.&lt;/p&gt;&#xA;" OwnerUserId="47050" LastActivityDate="2016-01-04T17:49:11.057" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7931" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T19:01:12.477" Score="-4" Body="&lt;p&gt;&lt;strong&gt;Most Difficult&lt;/strong&gt;:  This challenge got only a few (or no) answers because of its incredible difficulty.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastActivityDate="2016-01-04T19:01:12.477" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7932" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T19:03:13.073" Score="22" Body="&lt;p&gt;&lt;strong&gt;Labour of love:&lt;/strong&gt; for a great challenge that took immense amounts of preparation on the part of the challenge author.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2016-01-04T21:33:56.037" LastActivityDate="2016-01-04T21:33:56.037" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="7934" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T20:15:02.753" Score="17" Body="&lt;p&gt;&lt;strong&gt;Don't push me out of the box!&lt;/strong&gt;&lt;br&gt;&#xA;An answer that uses a very clever algorithm that nobody had thought of before.&lt;/p&gt;&#xA;" OwnerDisplayName="user46167" LastActivityDate="2016-01-04T20:15:02.753" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7935" PostTypeId="2" ParentId="7810" CreationDate="2016-01-04T20:24:58.930" Score="6" Body="&lt;p&gt;I would consider having &lt;code&gt;lang-default&lt;/code&gt; active by default on the challenge tags actively harmful to submissions. It doesn't always make sense and can in some cases make the submission harder to read.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an example, consider Matlab. There is a Prettify extension for Matlab, but Stack Exchange doesn't include it in its subset of available languages. Using the default highlighting scheme causes the following issues:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Matlab uses &lt;code&gt;%&lt;/code&gt; for comments, not &lt;code&gt;#&lt;/code&gt;, so comments are highlighted like syntax&lt;/li&gt;&#xA;&lt;li&gt;Matlab uses &lt;code&gt;'&lt;/code&gt; as the transpose operator, which the default scheme assumes marks the beginning of a string. So if there's one transpose in some code, everything after it will be string colored.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If a user wants highlighting for their code, they can simply activate Prettify manually using &lt;code&gt;&amp;lt;!-- language-all: lang-XXX --&amp;gt;&lt;/code&gt;, where &lt;code&gt;XXX&lt;/code&gt; is &lt;code&gt;default&lt;/code&gt; for unsupported languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Further resources:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://stackoverflow.com/editing-help#syntax-highlighting&quot;&gt;Stack Overflow help page on highlighting&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://meta.stackexchange.com/a/184109/287795&quot;&gt;List of available languages&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2016-01-04T20:24:58.930" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7937" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T20:45:00.367" Score="20" Body="&lt;h1&gt;Showcase of Most Promising New Golfing Language&lt;/h1&gt;&#xA;&lt;p&gt;There seem to be quite a few of these new languages that have popped up in the last year.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-04T20:45:00.367" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7938" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T20:46:12.897" Score="8" Body="&lt;h1&gt;Golden Oldie&lt;/h1&gt;&#xA;&lt;p&gt;Best answer in a language that has been around for 40 years or more.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-04T20:46:12.897" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="7939" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T20:49:11.843" Score="13" Body="&lt;h1&gt;Against the odds&lt;/h1&gt;&#xA;&lt;p&gt;Best answer in a non-golfing language that is as short or shorter than golfing-language answers.  Defining &amp;quot;golfing&amp;quot; vs &amp;quot;non-golfing&amp;quot; language may be tricky in some cases, but I think its clear in most cases.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-04T20:49:11.843" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7940" PostTypeId="2" ParentId="7897" CreationDate="2016-01-04T21:15:19.393" Score="4" Body="&lt;p&gt;I've been messing around with &lt;a href=&quot;https://chrome.google.com/webstore/detail/stylebot/oiaejidbmkiecgbjeifoejpgmdaleoha?hl=en&quot; rel=&quot;nofollow noreferrer&quot;&gt;Stylebot&lt;/a&gt; to see what I could do.  Below is one possible idea, with a couple main features:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Background color surrounds content&lt;/li&gt;&#xA;&lt;li&gt;Green color theme&lt;/li&gt;&#xA;&lt;li&gt;Dashed outlines&lt;/li&gt;&#xA;&lt;li&gt;The questions/tags/etc. navbar has a larger font size.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/kkxSt.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/kkxSt.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is given by the following CSS modifications:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a.question-hyperlink {&#xA;    color: #000000;&#xA;}&#xA;&#xA;div.status.answered-accepted {&#xA;    background-color: #fff8dc;&#xA;    border-style: dashed;&#xA;    border-color: #ffffff;&#xA;    border-width: 3px;&#xA;    padding: 3px;&#xA;}&#xA;&#xA;#nav-tags {&#xA;    font-size: 16px;&#xA;}&#xA;&#xA;#nav-questions {&#xA;    font-size: 16px;&#xA;}&#xA;&#xA;#nav-users {&#xA;    font-size: 16px;&#xA;}&#xA;&#xA;#nav-unanswered {&#xA;    font-size: 16px;&#xA;}&#xA;&#xA;#nav-badges {&#xA;    font-size: 16px;&#xA;}&#xA;&#xA;div.categories {&#xA;    background-color: #eafced;&#xA;}&#xA;&#xA;div.snippet-hidden {&#xA;    border-style: dashed;&#xA;    border-color: #eafced;&#xA;    border-width: 7px;&#xA;}&#xA;&#xA;div.module.community-bulletin {&#xA;    border-style: dashed;&#xA;    border-width: 3px;&#xA;    border-color: #ffffff;&#xA;}&#xA;&#xA;div.module.newuser {&#xA;    background-color: #eafced;&#xA;    border-style: dashed;&#xA;    border-width: 3px;&#xA;    padding: 3px;&#xA;    border-color: #ffffff;&#xA;}&#xA;&#xA;a.post-tag {&#xA;    color: #000000;&#xA;    background-color: #ddffd6;&#xA;    border-style: none;&#xA;}&#xA;&#xA;#header {&#xA;    color: #ffffff;&#xA;    background-color: #eafced;&#xA;    border-style: solid;&#xA;    width: 1000px;&#xA;    margin-color: 0;&#xA;}&#xA;&#xA;div.container {&#xA;    border-color: #ffffff;&#xA;    background-color: #eafced;&#xA;}&#xA;&#xA;.container {&#xA;    box-shadow: none ;&#xA;}&#xA;&#xA;#hlogo a {&#xA;}&#xA;&#xA;#nav-askquestion {&#xA;    font-size: 16px;&#xA;}&#xA;&#xA;#footer-menu {&#xA;    color: #ff24ff;&#xA;}&#xA;&#xA;ol li a {&#xA;    color: #306630;&#xA;}&#xA;&#xA;div.top-footer-links a {&#xA;    color: #457548;&#xA;}&#xA;&#xA;div.module {&#xA;    border-style: dashed;&#xA;    border-width: 3px;&#xA;    padding: 3px;&#xA;    border-color: #ffffff;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For future reference, one problem I ran into was fixing the colors in the upper right and left corners, which was solved with this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.container {&#xA;    box-shadow: none;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2016-01-04T21:15:19.393" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7942" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T21:22:23.003" Score="13" Body="&lt;h2&gt;It's Alive&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Best answer in a difficult to program in language, such as Malbolge, Hexagony, or Fission.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;I will offer a 200 rep bounty for this category&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="31625" LastActivityDate="2016-01-04T21:22:23.003" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7943" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T23:31:28.660" Score="11" Body="&lt;p&gt;&lt;strong&gt;Abusive:&lt;/strong&gt; An answer that cleverly uses a certain feature of the given language in a way that was clearly not intended.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;@ThomasKwa mentioned that this obviously only applies for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. Does it? I cannot think of any other type of challenge right now, but if there is one, I'd like to leave it open for that one too.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2016-01-06T17:35:27.337" LastActivityDate="2016-01-06T17:35:27.337" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7944" PostTypeId="2" ParentId="7910" CreationDate="2016-01-04T23:37:33.560" Score="-13" Body="&lt;p&gt;&lt;strong&gt;Justified:&lt;/strong&gt; The answer with the most hilarious &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5856/24877&quot;&gt;justification why a certain task needs to be solved in as few bytes as possible.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now I need just need to add more text in order to avoid this answer to be converted to a comment because it was considered a &lt;em&gt;trivial answer&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-01-04T23:37:33.560" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7945" PostTypeId="2" ParentId="7897" CreationDate="2016-01-04T23:52:51.600" Score="-5" Body="&lt;h1&gt;The IBM golfball printer head&lt;/h1&gt;&#xA;&lt;p&gt;I agree with Alex A's comment on Maltysen's very popular answer:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;I wouldn't be opposed to having a little golf reference here and there, I just don't want the site to look like a country club. – Alex A&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;I think a stylized, artistic version of the IBM golfball printer head might work. My main concern is that when scaled down to a favicon it would look too much like a real golfball. Enclosing it in brackets per Blockcoder's answer might help (maybe square instead of curly.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/VuEFp.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/VuEFp.jpg&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Image from &lt;a href=&quot;https://en.wikipedia.org/wiki/IBM_Selectric_typewriter&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://en.wikipedia.org/wiki/IBM_Selectric_typewriter&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The other golf reference I'm OK with, is flag icons in the style of golf flags&lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-04T23:52:51.600" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7946" PostTypeId="2" ParentId="7897" CreationDate="2016-01-05T00:09:57.270" Score="-12" Body="&lt;h1&gt;Favicon: Question mark in Conway's game of life&lt;/h1&gt;&#xA;&lt;p&gt;I looked at Calvin's Conway answer, and thought Conway's game of life is the core of the type of thing we do. This would make an excellent scalable icon.&lt;/p&gt;&#xA;&lt;p&gt;The only thing is, Black and white is a bit boring. I've tried to do something about that in the image below, but it needs more work.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/FNq4P.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/FNq4P.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-05T00:09:57.270" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7948" PostTypeId="2" ParentId="7897" CreationDate="2016-01-05T00:22:46.650" Score="1" Body="&lt;h1&gt;Showcase some of the answers to the question &amp;quot;Images with all colours&amp;quot;&lt;/h1&gt;&#xA;&lt;p&gt;This is our 6th most popular question of all time, and it produced some amazing answers.&lt;/p&gt;&#xA;&lt;p&gt;Some of these could serve as favicon, or could be displayed in a similar manner to the &amp;quot;images of the month&amp;quot; on photography.SE&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/22144/15599&quot;&gt;Images with all colors&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-05T00:22:46.650" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7949" PostTypeId="2" ParentId="7897" CreationDate="2016-01-05T00:51:19.677" Score="26" Body="&lt;h1&gt;Main logo - zippered curly brackets&lt;/h1&gt;&#xA;&lt;p&gt;mınxomaτ &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/26581401#26581401&quot;&gt;posted this in chat&lt;/a&gt;, so they deserve all the credit:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/jOhpI.png&quot; alt=&quot;&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;It's left and right curly brackets (&lt;code&gt;{}&lt;/code&gt;) joined by a closed zipper. The brackets indicate that what we do involves coding, and the zipper indicates that we do compression, i.e. golfing (think zip file).&lt;/p&gt;&#xA;&lt;p&gt;I think it's far more fitting for PPCG than mınxomaτ's other design of the &lt;a href=&quot;https://i.stack.imgur.com/REynJ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;test tube brackets&lt;/a&gt;. It scales down pretty well too. My only complaint is that it is not very colorful.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-05T00:59:50.400" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="7950" PostTypeId="2" ParentId="7910" CreationDate="2016-01-05T01:24:50.293" Score="1" Body="&lt;p&gt;&lt;strong&gt;Good Samaritan:&lt;/strong&gt; The person who has contributed the most to other people's answers.&lt;/p&gt;&#xA;" OwnerUserId="46313" LastEditorUserId="46313" LastEditDate="2016-01-05T18:02:02.530" LastActivityDate="2016-01-05T18:02:02.530" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7951" PostTypeId="2" ParentId="7910" CreationDate="2016-01-05T01:27:06.927" Score="1" Body="&lt;p&gt;&lt;strong&gt;Philanthropist:&lt;/strong&gt; The person who has given away the most reputation in bounties this year.&lt;/p&gt;&#xA;" OwnerUserId="46313" LastActivityDate="2016-01-05T01:27:06.927" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="7952" PostTypeId="2" ParentId="7910" CreationDate="2016-01-05T01:33:36.350" Score="22" Body="&lt;p&gt;&lt;strong&gt;Team Effort:&lt;/strong&gt; Answer that involved the cooperation of many people.&lt;/p&gt;&#xA;" OwnerUserId="46313" LastActivityDate="2016-01-05T01:33:36.350" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7953" PostTypeId="2" ParentId="7910" CreationDate="2016-01-05T04:08:12.560" Score="14" Body="&lt;p&gt;&lt;strong&gt;Emperor of the Hill:&lt;/strong&gt; Best KotH in terms of planning, clear specification, and novelty.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="44713" LastEditDate="2016-01-05T18:53:06.443" LastActivityDate="2016-01-05T18:53:06.443" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="7954" PostTypeId="2" ParentId="7910" CreationDate="2016-01-05T04:08:47.477" Score="7" Body="&lt;p&gt;&lt;strong&gt;Graduate of the Peter Taylor academy:&lt;/strong&gt; For a highly-rated question that went through many revisions in Sandbox. &lt;/p&gt;&#xA;" OwnerUserId="46313" LastActivityDate="2016-01-05T04:08:47.477" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="7955" PostTypeId="2" ParentId="7897" CreationDate="2016-01-05T04:48:47.947" Score="62" Body="&lt;h2&gt;Graduation Design Userscript&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A collaborative graduation user-script has been put together. &lt;strong&gt;&lt;a href=&quot;https://github.com/vihanb/PPCG-Design&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github Repo&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Pictures&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Main&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/UAAcc.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/UAAcc.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Question:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/KScH0.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/KScH0.jpg&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Leaderboard:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/hPNsg.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/hPNsg.png&quot; height=&quot;280&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Auto TIO Execution:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/2L5C3.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/2L5C3.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Meta:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/wQmNl.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/wQmNl.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Chat: &lt;a href=&quot;https://i.stack.imgur.com/XZObF.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/XZObF.jpg&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Color Scheme:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/t2a1h.png&quot; height=&quot;80&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;If you have &lt;strong&gt;&lt;em&gt;any&lt;/em&gt;&lt;/strong&gt; ideas, don't hesitate to comment below.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Features:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;See &lt;strong&gt;vote counts&lt;/strong&gt; even if you don't have enough rep.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Automatic leaderboards&lt;/strong&gt; for all code-golf challenges.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Automatic code-block byte and char counting.&lt;/strong&gt; (For bytes, uses UTF-8/16, ISO 8859-1, or byte-per-char, depending on the language. Hexdumps are parsed correctly as well.)&lt;/li&gt;&#xA;&lt;li&gt;An &lt;strong&gt;options&lt;/strong&gt; button to customize the theme, colors, and disable/enable various features.&lt;/li&gt;&#xA;&lt;li&gt;A &lt;strong&gt;Question of the day&lt;/strong&gt; widget.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Automatic TIO™&lt;/strong&gt; preview. See an answers output without leaving PPCG! (this can be disabled)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Design Features:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;New &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7978/42545&quot;&gt;Logo&lt;/a&gt; / &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7899/42545&quot;&gt;Voting&lt;/a&gt; / &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7980/42545&quot;&gt;Favorite&lt;/a&gt; / Badge icons&lt;/li&gt;&#xA;&lt;li&gt;General redesign&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Customizable parts:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Header font and colors&lt;/li&gt;&#xA;&lt;li&gt;Text font and color&lt;/li&gt;&#xA;&lt;li&gt;Logo / Spritesheet&lt;/li&gt;&#xA;&lt;li&gt;Background image / color&lt;/li&gt;&#xA;&lt;li&gt;Post container color&lt;/li&gt;&#xA;&lt;li&gt;and more!&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;How do I use this?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You can install &lt;a href=&quot;//tampermonkey.net&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tampermonkey&lt;/a&gt; which supports a &lt;em&gt;ton&lt;/em&gt; of browsers (probably will include yours). You can then just use &lt;a href=&quot;//rawgit.com/vihanb/PPCG-Design/master/ppcg.user.js&quot; rel=&quot;nofollow noreferrer&quot;&gt;this link&lt;/a&gt; to install the script (or copy-paste the code into a new script).&lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-11-06T20:05:40.480" CommentCount="23" CommunityOwnedDate="2016-01-06T02:23:12.807" ContentLicense="CC BY-SA 3.0" />
  <row Id="7957" PostTypeId="2" ParentId="7910" CreationDate="2016-01-05T09:44:17.547" Score="11" Body="&lt;p&gt;&lt;strong&gt;Trickiest&lt;/strong&gt;: The answer that uses the most subtle technique(s) to golf code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ideally, the trick(s) should be hard for an experienced use of the language to spot, and lead to the shortest code in that language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The tricks may be using language features as intended - what's important is that they are unintuitive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;I will offer a 200 rep bounty for this category&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="20080" LastEditDate="2016-01-05T23:43:59.850" LastActivityDate="2016-01-05T23:43:59.850" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7958" PostTypeId="2" ParentId="7893" CreationDate="2016-01-05T10:31:10.530" Score="7" Body="&lt;h1&gt;Close only if they would have the same answers&lt;/h1&gt;&#xA;&lt;p&gt;For the question &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7887/25180&quot;&gt;https://codegolf.meta.stackexchange.com/q/7887/25180&lt;/a&gt;, the answers are supposed to be:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Yes, they are drowning us. (But we may want to be drowned anyway, or we may want to find a way live with it without changing the rules.)&lt;/li&gt;&#xA;&lt;li&gt;No, they are not. (But we may want to ban golfing languages for other reasons.)&lt;/li&gt;&#xA;&lt;li&gt;It would be only temporary, or whatever.&lt;/li&gt;&#xA;&lt;li&gt;Some suggestion about making new languages better accepted, or easier to learn. (It has nothing to do with whether they are allowed or not.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;They doesn't seemed to fit in the old question. Not banning golfing languages as a rule doesn't give much information about how to improve this situation (or whether some improvement is necessary), especially when there are many users designing new languages which wasn't the case in the past.&lt;/p&gt;&#xA;&lt;p&gt;Banning golfing languages is a really unlikely solution to the new problem (if we think it is a problem). And we decided not to ban golfing languages for good reasons. It's not the case that we should ignore anything that &lt;em&gt;may&lt;/em&gt; lead to banning golfing languages no matter how bad it is.&lt;/p&gt;&#xA;&lt;p&gt;Note that there are already several questions about golfing languages in the past, and they are not closed as duplicates of each other. Some examples are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9/25180&quot;&gt;What programming language should we consider for the code-golf solution ?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/88/25180&quot;&gt;On GolfScript and language bigotry&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/286/25180&quot;&gt;J and GolfScript suck all the enjoyment out of Code Golf&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/6983/25180&quot;&gt;Why I am leaving Code Golf&lt;/a&gt; (which IMHO has the most helpful answer.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Those questions have some minor differences, but some of them might be closed if they were posted today.&lt;/p&gt;&#xA;&lt;p&gt;Now the community has decided not to ban golfing languages. We should (at least technically) allow more of those questions if they were not exactly asking for banning golfing languages, not less. As we don't argue too much about whether we should solve the problem by banning some languages anymore, the discussions should be much more clear and relevant than before.&lt;/p&gt;&#xA;&lt;p&gt;At the very least, we should close the questions as duplicates exactly for the reason they were answered in the old question, not for the reasons such as we don't want to talk about it anymore, or it contained some bad ideas we don't like. We can comment, downvote or close for other reasons in other cases.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-07T04:53:03.623" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7960" PostTypeId="2" ParentId="7910" CreationDate="2016-01-05T14:03:25.180" Score="8" Body="&lt;p&gt;&lt;strong&gt;Necromancer:&lt;/strong&gt; similar but not identical to the badge of the same name. Best answer posted in 2015 to a challenge from before 2014.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(The gap of a full year is to exclude answers to challenges which were posted just before New Year's and answered just after it.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since almost all tips answers fall into this category, the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; tag is excluded from this. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7961/8478&quot;&gt;I have added a separate category for those.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-01-06T12:33:25.497" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="7961" PostTypeId="2" ParentId="7910" CreationDate="2016-01-05T16:28:57.703" Score="9" Body="&lt;p&gt;&lt;strong&gt;Pro tip:&lt;/strong&gt; best answer to any &lt;em&gt;general&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question. That is, candidates should be drawn from &quot;Tips for golfing in X&quot; questions (as opposed to specific &quot;how do I shorten this piece of code&quot; questions).&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2016-01-08T09:43:42.460" LastActivityDate="2016-01-08T09:43:42.460" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7962" PostTypeId="2" ParentId="7910" CreationDate="2016-01-05T16:52:05.017" Score="10" Body="&lt;h2&gt;Green Jersey&lt;/h2&gt;&#xA;&lt;p&gt;For the question with the best set of test cases. As a minimum requirement they should cover corner cases and unintuitive cases, and ideally they should do so elegantly.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I did think about a name invoking the Ashes, but a cricket reference is probably too obscure for people from non-cricket-playing countries. I also considered something along the lines of the idiom &amp;quot;the proof is in the pudding&amp;quot;. The current WIP title combines the green of a successfully passed test suite with a Tour de France reference.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-05T16:52:05.017" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7963" PostTypeId="2" ParentId="7910" CreationDate="2016-01-05T18:05:40.547" Score="9" Body="&lt;p&gt;&lt;strong&gt;Meta World Peace:&lt;/strong&gt; For the person who has done the most to advance the development of this site through contributions (questions and/or answers) to Meta. &lt;/p&gt;&#xA;" OwnerUserId="46313" LastActivityDate="2016-01-05T18:05:40.547" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7966" PostTypeId="2" ParentId="2140" CreationDate="2016-01-05T21:34:48.830" Score="1" Body="&lt;p&gt;I wasn't able to find a challenge like this before, but it wouldn't surprise me if it already exists.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;A strand of DNA is made up of bases notated by the letters &lt;code&gt;A&lt;/code&gt;, &lt;code&gt;T&lt;/code&gt;, &lt;code&gt;C&lt;/code&gt;, and &lt;code&gt;G&lt;/code&gt;. &lt;code&gt;A&lt;/code&gt; always pairs with &lt;code&gt;T&lt;/code&gt;, &lt;code&gt;C&lt;/code&gt; always pairs with &lt;code&gt;G&lt;/code&gt;, and vice versa.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, you can find the opposite side of a DNA strand by swapping all occurrences of a base with its complement.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's the catch: your program cannot contain the characters &lt;code&gt;A&lt;/code&gt;, &lt;code&gt;T&lt;/code&gt;, &lt;code&gt;C&lt;/code&gt;, or &lt;code&gt;G&lt;/code&gt; at all – in string literals or in the body of the program. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The input is a string of continuous uppercase characters (you can assume that this string only contains the above bases). The input can be any length. The output should be the complementary strand of DNA.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:   AC&#xA;Output:  TG&#xA;&#xA;Input:   ACCTAGTAT&#xA;Output:  TGGATCATA&#xA;&#xA;Input:   GCATC&#xA;Output:  CGTAG&#xA;&#xA;Input:   TCTGAAACTAGGGGC&#xA;Output:  AGACTTTGATCCCCG&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is code golf, so the shortest program wins.&lt;/p&gt;&#xA;" OwnerUserId="19164" LastEditorUserId="19164" LastEditDate="2016-01-06T03:22:51.647" LastActivityDate="2016-01-06T03:22:51.647" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="7967" PostTypeId="2" ParentId="2140" CreationDate="2016-01-05T21:48:17.723" Score="3" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/68185/write-the-new-vim&quot;&gt;This challenge&lt;/a&gt; was closed, because it was way too broad, but, in the comments, SuperJedi224 suggested a slightly different challenge that I thought was a really good idea, so I'm stealing it and posting it here.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Write a text editor in 2000 bytes or less&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a text editor in 2000 bytes or less. It should support loading and saving files (or something else if your language doesn't support that, maybe?), modifying text, and displaying the contents of a file that's currently open in some format.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox questions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'm not sure if 2000 bytes is the right number. SuperJedi224 originally suggested 10000, but that seems to me like too many.&lt;/li&gt;&#xA;&lt;li&gt;Should some features be required, or should it just be by votes? Will votes take care of possible submissions that aren't actually text editors?&lt;/li&gt;&#xA;&lt;li&gt;&lt;s&gt;Should there be some kind of bonus for shorter submissions? Maybe an extra point for every 20 or so bytes you don't use?&lt;/s&gt; No, there probably shouldn't be.&lt;/li&gt;&#xA;&lt;li&gt;Should languages that don't support file operations be allowed?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="34638" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:21.033" LastActivityDate="2016-01-07T00:43:12.263" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="7971" PostTypeId="2" ParentId="7910" CreationDate="2016-01-06T02:15:05.390" Score="11" Body="&lt;h2&gt;Best answer to a difficult challenge&lt;/h2&gt;&#xA;&lt;p&gt;Some &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; questions on this site are difficult programming challenges even without the golfing aspect. When golfing a challenge where one does not see an immediate, clear path to the solution to start with, one must first pick an approach, write a solution, and then continuously consider new approaches while golfing it down.&lt;/p&gt;&#xA;&lt;p&gt;This award will go to an answer which, due to the difficulty of the challenge, has great &lt;em&gt;necessary&lt;/em&gt; complexity—and is excellently golfed. Both the approach used and micro-optimization will be considered.&lt;/p&gt;&#xA;&lt;p&gt;To give an idea of the length, the answer should be about 250+ bytes of non-data code in languages like Python, or about 60+ bytes in a golfing language like Pyth—but, of course, to a challenge in which an inexpert golfer's solution wouldn't be anywhere near that short. Languages designed to be long/difficult to program in most likely not be considered.&lt;/p&gt;&#xA;&lt;p&gt;A better title is appreciated.&lt;/p&gt;&#xA;&lt;p&gt;I'll offer &lt;em&gt;350 rep&lt;/em&gt; to the winner.&lt;/p&gt;&#xA;&lt;p&gt;I think this is sufficiently different from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7921/39328&quot;&gt;Most Above-and-Beyond Answer&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-06T18:17:51.653" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7977" PostTypeId="2" ParentId="202" CreationDate="2016-01-06T12:28:35.053" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/40073/making-future-posts-runnable-online-with-stack-snippets/66033&quot;&gt;Making Future Posts Runnable Online with Stack Snippets&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Has interpreters for a lot of esoteric languages.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;http://output.jsbin.com/cuzoxu&quot; rel=&quot;nofollow noreferrer&quot;&gt;Labyrinth&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;That is a Labyrinth interpreter I wrote. (It doesn't support bigintegers yet.)&#xA;It has a fairly useful debug feature that allows you to see the pointer moving around.&lt;/p&gt;&#xA;" OwnerUserId="33160" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-01-06T12:28:35.053" CommentCount="0" CommunityOwnedDate="2016-01-06T12:28:35.053" ContentLicense="CC BY-SA 3.0" />
  <row Id="7978" PostTypeId="2" ParentId="7897" CreationDate="2016-01-06T14:42:03.840" Score="48" Body="&lt;h1&gt;Another logo!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/di36k.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/di36k.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Credits to @Dennis and several other people who helped me with the idea! This seems to be better because it suggests that PPCG is a competitive site.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/TsCyS.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt; is a cropped image for use as a favicon, &lt;a href=&quot;https://www.dropbox.com/s/w42qou86cxf7dxw/ppcgwreathnopuzzle.svg?dl=0&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; is an auto-generated SVG version, and &lt;a href=&quot;https://i.stack.imgur.com/6Fajb.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; is a greyscale version for Meta.&lt;/p&gt;&#xA;&lt;p&gt;This has been added to the userscript managed by Downgoat.&lt;/p&gt;&#xA;" OwnerUserId="41247" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-05T18:08:15.003" CommentCount="17" ContentLicense="CC BY-SA 3.0" />
  <row Id="7980" PostTypeId="2" ParentId="7897" CreationDate="2016-01-06T20:06:00.040" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/67576/draw-a-christmas-star-stellated-dodecahedron&quot;&gt;Use Stellated Dodecahedron as the Favorite Star&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;10 point view&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Meh25.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Meh25.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;6 point view&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/bAgTu.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/bAgTu.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Made by &lt;a href=&quot;https://codegolf.stackexchange.com/a/68674/46313&quot;&gt;@steveverrill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's not mess around with baby stars, let's go big with a crazy star! The colored in version would to be for the selected state. There would need to be an outline version for the unselected state.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Here's the version the userscript uses:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/OV9Ok.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/OV9Ok.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="46313" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-01-07T04:26:12.497" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="7981" PostTypeId="1" CreationDate="2016-01-06T21:30:47.140" Score="16" ViewCount="255" Body="&lt;p&gt;Sorry about the silly title - it just sort of happened that way and then I couldn't resist the alliteration.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/badges?tab=tags&amp;amp;filter=gold&quot;&gt;Tag badges&lt;/a&gt; are awarded when you earn at least 1000 total score for at least 200 non-community wiki answers with a specific tag.  A &quot;privilege&quot; gained due to this is the ability to use a close-vote hammer.  This means that users with this badge may simply close questions at will without the need for up to 4 more votes from other users.  Of course moderators also have this ability automatically for all questions.  I believe this ability is colloquially known as a &quot;hammer&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This privilege is great when it is clear the question should be closed.  However there have been situations where I have wanted to cast a close vote but felt that I wanted other user's votes as well before the question is closed.  In other words, it can be argued that these hammers give dictatorial rights to high-rep users (and mods) while effectively taking away democratic rights.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The end-result of this gives hammer-wielders a choice:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Don't close-vote at all&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Use close-vote hammer even if you want other users input, then question whether you really did the right thing (potentially scaring off new users)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Wait for other users' close-votes and then catch the 4th or 5th close-vote - in reality I usually end up missing this window and so this is basically option 1.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;I don't really have any great suggestions for how to deal with this.  I guess one possibility is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/feature-request&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt; to allow a choice of vote-or-hammer, but somehow that seems unlikely to fly.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;There is &lt;a href=&quot;https://meta.stackexchange.com/questions/231625/please-remind-me-when-i-am-wielding-the-dupe-hammer&quot;&gt;related discussion&lt;/a&gt; in meta.SE, but I think PPCG.SE is a bit special in this regard in that the majority of questions are tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, and so users earn this hammer sooner.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-01-12T00:38:10.983" Title="High-rep hammers hamper high-rep humans" Tags="|discussion|closed-questions|moderation|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7982" PostTypeId="2" ParentId="7981" CreationDate="2016-01-06T21:48:49.680" Score="12" Body="&lt;p&gt;First and foremost, from &lt;a href=&quot;https://meta.stackoverflow.com/a/254590&quot;&gt;When did I get close-vote superpowers?&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The rules are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can instantly close &lt;em&gt;as a duplicate&lt;/em&gt; any question that was originally asked with a tag you have a gold badge for.&lt;/li&gt;&#xA;&lt;li&gt;You can instantly reopen any question &lt;em&gt;closed as a duplicate&lt;/em&gt; that was originally asked with a tag you have a gold badge for.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;That means your close votes for other reasons (&lt;em&gt;off topic&lt;/em&gt;, &lt;em&gt;too broad&lt;/em&gt;, etc.) are still not binding, and you can cast them as usual.&lt;/p&gt;&#xA;&lt;p&gt;Regarding the dupe hammer, you don't have a duplicate &lt;em&gt;vote&lt;/em&gt; anymore; don't treat it like one. If you think that a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question is a duplicate, close it. Yes, this will be binding, but it's not final. The question can just as easily be reopened if the community disagrees with you.&lt;/p&gt;&#xA;&lt;p&gt;The principal effect of closing a question is preventing it from getting answers, and the sooner that happens, the better.&lt;/p&gt;&#xA;&lt;p&gt;Duplicates can be pretty hard to identify, so if you found a similar question but are not convinced that its a duplicate, leave a comment and let others decide.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-06T21:48:49.680" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7983" PostTypeId="2" ParentId="7910" CreationDate="2016-01-06T21:55:25.293" Score="5" Body="&lt;h1&gt;Per-language awards&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/26648074#26648074&quot;&gt;These&lt;/a&gt; are the most commonly used languages on PPCG in 2015. The top 9:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Python: 1946 answers&lt;/li&gt;&#xA;&lt;li&gt;Javascript: 1285&lt;/li&gt;&#xA;&lt;li&gt;CJam: 1164&lt;/li&gt;&#xA;&lt;li&gt;Pyth: 1037&lt;/li&gt;&#xA;&lt;li&gt;Ruby: 648&lt;/li&gt;&#xA;&lt;li&gt;Perl: 618&lt;/li&gt;&#xA;&lt;li&gt;Haskell: 535&lt;/li&gt;&#xA;&lt;li&gt;C: 497&lt;/li&gt;&#xA;&lt;li&gt;Mathematica: 483&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Each language has unique golfing tricks. Therefore, I will give &lt;em&gt;100 rep&lt;/em&gt; for the best overall Python answer, and &lt;em&gt;50 rep&lt;/em&gt; for the best overall answer in each of the other eight languages. Answers should be judged based on quality, effort, and the showcase of a language's features. This award is not restricted to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;: answers to every type of challenge are eligible.&lt;/p&gt;&#xA;&lt;p&gt;This complements &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7923/39328&quot;&gt;Jack of All Trades&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-06T21:55:25.293" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7987" PostTypeId="1" AcceptedAnswerId="7990" CreationDate="2016-01-07T12:46:17.797" Score="32" ViewCount="3428" Body="&lt;p&gt;This question has been asked so often, I have no idea what our actual policy is:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/3587/almost-correct-answers&quot;&gt;Almost-correct answers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1451/should-answers-that-break-the-rules-be-deleted&quot;&gt;Should answers that break the rules be deleted?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1940/should-we-flag-and-delete-not-an-answer-posts&quot;&gt;Should we flag and delete Not an Answer posts?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1447/can-we-stop-flagging-poor-answers-as-not-an-answer&quot;&gt;Can we stop flagging poor answers as &amp;quot;not an answer&amp;quot;?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/825/what-should-count-as-not-an-answer-here&quot;&gt;What should count as &amp;quot;not an answer&amp;quot; here?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5159/what-should-the-policy-be-on-partial-answers&quot;&gt;What should the policy be on partial answers?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;None of them are closed as duplicates.&lt;/s&gt; Most of them overlap but not all. Also, all of those opinions are from 2014 (the one answer from 2015 is essentially a repost of one of the others). We still regularly get Not-An-Answer flags on answers that don't meet the spec, so it would be great if there was a single, up-to-date policy to refer to.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To summarise what results those posts yielded:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Consensus seems to be &lt;em&gt;mostly&lt;/em&gt; that answers which don't meet the spec are &quot;just&quot; factually wrong answers, and Meta.SE says about those:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Answers that are answers but are factually wrong [...] should get downvoted, but not deleted.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Or just straight from one of the flag decline reasons we have as mods:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;flags should not be used to indicate technical inaccuracies, or an altogether wrong answer&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Geobits made a good argument in favour of this view that downvoted bad answers act as signposts for future visitors. However, the one problem I have with this policy is that its main justification is always that &quot;that's the standard SE policy&quot;. That policy was created for Q&amp;amp;A sites. PPCG is not a Q&amp;amp;A site, so if we adopt standard policy like that, it would be great if there was some additional support for why this even makes sense here.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;trichoplax &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1960/8478&quot;&gt;made an argument in favour of deleting such answers&lt;/a&gt;. And I think it's a fairly good one: downvoted wrong answers acting as signposts only works &lt;em&gt;as long as they are actually downvoted&lt;/em&gt;. Too often, we have answers that a) accumulate tons of upvotes before anyone notices they are wrong (and then are left in that state by the author and the voters) or b) are deliberately wrong but &quot;funny&quot; or contain nice pictures or whatever and are upvoted for those regardless of the actual code. &lt;a href=&quot;https://codegolf.stackexchange.com/a/35636/8478&quot;&gt;(Example for users who can see deleted posts.)&lt;/a&gt; Those are especially problematic with HNQ challenges, which get lots of votes from users who aren't active here ... and those are exactly the challenges where having downvoted answers as signposts would be useful. This is why I'm not convinced that the standard SE policy is actually the best course of action for PPCG.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Another thing I found in a comment by PhiNotPi is that maybe we should distinguish between answers where the author knows they are wrong and those where he doesn't. I haven't seen this point addressed in any answers at all yet.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;To top it all off &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7448/8478&quot;&gt;the only recent related discussion&lt;/a&gt; has a score of 28 in favour of not posting almost-working solutions at all in the first place.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is why I'd like to have one more, but comprehensive discussion on this matter to see what the community actually thinks these days, and how you expect us as moderators to deal with these flags if they are raised.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="12012" LastEditDate="2017-05-14T16:59:18.473" LastActivityDate="2019-07-11T04:03:34.603" Title="Definitive policy about answers not meeting the challenge specification" Tags="|discussion|faq|policy|answers|flags|" AnswerCount="5" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7988" PostTypeId="2" ParentId="7987" CreationDate="2016-01-07T15:04:18.523" Score="9" Body="&lt;h2&gt;Delete answers that don't follow the spec, downvote low quality but otherwise valid answers&lt;/h2&gt;&#xA;&lt;p&gt;We need to make a distinction between unpopular answers and invalid answers. A valid but poorly-golfed (or otherwise low quality, as determined by the winning criteria) answer deserves to stay, but should be downvoted as a signal to the author that they could do better. Invalid answers should be deleted, so that new users don't get the impression that they are valid but unpopular. Since deletion can always be reversed, it gives the author the opportunity to fix the answer and undelete it or flag it for undeletion. When an answer is deleted because it is invalid, a comment should always be left explaining why it was deleted, and possibly what could be done to make the answer valid.&lt;/p&gt;&#xA;&lt;p&gt;Ideally, a challenge's answers should all be valid (except for any deleted answers), and the votes should reflect ingenuity and impressiveness (or the lack thereof for downvotes).&lt;/p&gt;&#xA;&lt;p&gt;This leaves open which flag should be used for invalid answers; Not An Answer and Low Quality would both suffice. I'd prefer the latter, since the former is intended for answers that don't make an attempt at solving the challenge (e.g. answers that should be comments).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-07T16:35:27.187" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="7990" PostTypeId="2" ParentId="7987" CreationDate="2016-01-07T16:28:26.683" Score="40" Body="&lt;h3&gt;Scope&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;As I see it, there are five types of invalid answers:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Answers that produce incorrect results.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is the most common type, and usually an accident.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Answers that produce correct results, but break a rule of the challenge, ignore parts of the spec or violate a loophole.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, answers that make use of banned built-ins fall into this category.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Answers that produce correct results, comply with the rules of the challenge, but aren't a serious contender for the winning criteria.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For code golf, e.g., this is limited to answers that &lt;em&gt;do not even attempt&lt;/em&gt; to golf the code. Answers that are simply poorly golfed are not invalid.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Answers that have one of the following, fatal flaws:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;They exist only to promote a product or service and do not disclose the author's affiliation.&lt;/li&gt;&#xA;&lt;li&gt;A reasonable person would find their content inappropriate for respectful discourse.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Answers that aren't actually answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This includes anything but code that is intended to solve the challenge.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Marking an answer as &lt;strong&gt;non-competing&lt;/strong&gt; does not exempt it from being invalid.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Deletion&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Answers of type 4 and 5 aren't actually answers. The policy across the entire network is that they should be deleted on sight, and there's no reason to make an exception here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think all other types should be removed as well, with varying levels of urgency. Even without an official policy, this is commonplace across the entire network. While these answers should not be &lt;em&gt;flagged&lt;/em&gt; on other SE sites, high rep users &lt;em&gt;delete&lt;/em&gt; them all the time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the answer is invalid  without the poster's knowledge, it shouldn't be deleted without notifying the poster first and giving him some time to fix his mistake.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the answer is deliberately invalid (most common for type 2), there really is no reason to wait or tell the poster something he already knows.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Self-deletion&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If you figured out or have been told that &lt;em&gt;your&lt;/em&gt; answer is invalid, I think self-deletion is the best option.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Deleting the answer quickly will prevent it from accumulating downvotes, which may or may not get removed after the answer has been fixed.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Deleting the answer yourself means that you can &lt;em&gt;undelete&lt;/em&gt; it just as easily.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In contrast, undeletion will require moderator intervention if the answer has been deleted by others.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;While deleting your answer will invalidate any rep your may have earned from it, you'll get it back if you fix the answer.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Flags&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Not an answer&lt;/strong&gt; flags were creates specifically for type 5 answers, and should be cast when they are encountered.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Likewise, &lt;strong&gt;spam&lt;/strong&gt; and &lt;strong&gt;rude or abusive&lt;/strong&gt; flags were created for type 4 answers, and should be used instead of &lt;strong&gt;not an answer&lt;/strong&gt; flags.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Very low quality&lt;/strong&gt; flags pretty much apply to all other types, but can only be cast on answers with a non-positive score. They are also cleared automatically when the post is edited, so they may be ineffective if the intention is to get a post removed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This leaves flagging as &lt;strong&gt;in need of moderator intervention&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The policy across the entire network is that &lt;em&gt;flags should not be used to indicate [...] an altogether wrong answer&lt;/em&gt;, but I think our site should be (once again) an exception.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First of all, we have a huge moderator-to-activity ratio. Stack Overflow moderators cannot be expected to complete the time-consuming task of deciding whether an answer is valid or not, but our flag volume is rather low and checking PPCG answers is &lt;em&gt;usually&lt;/em&gt; easier. A flag that &lt;strong&gt;clearly explains why the answer is invalid&lt;/strong&gt; (i.e, which rule it violates or which test case it fails) does not require an unreasonable amount of moderator time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, unlike other sites, I don't think we need examples of what not to do. There is absolutely no merit in keeping an answer that violates a rule of the challenge; they don't &lt;em&gt;teach&lt;/em&gt; anything. If an answer passes all test cases but still produces incorrect results, there is no benefit in keeping the answer after a new test case has been added to the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But it is important to &lt;strong&gt;wait until the moderator can actually take action&lt;/strong&gt;. I think deleting an accidentally invalid answer on sight is an unnecessarily unpleasant experience for the poster, and undeleting it requires yet another moderator intervention.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Voting to delete&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/trusted-user&quot;&gt;Trusted users&lt;/a&gt; (currently 20k+ rep) can cast deletion votes on answers. In all of the above situations that suggest flagging, trusted users can also vote to delete an answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With three votes from trusted users, involving a moderator becomes unnecessary. However, trusted users should flag instead or on top of their delete votes unless all of the following conditions are met:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The answers has a negative score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a hard requirement, since even trusted users cannot vote to delete answers with non-negative scores.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The challenge is still active.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Trying to gather three delete votes for an answer on a question that barely gets views anymore will take a long time. The &lt;a href=&quot;https://codegolf.stackexchange.com/tools?tab=delete&amp;amp;daterange=last30days&quot;&gt;moderation tools&lt;/a&gt; (10k+ rep) could help with this, but barely anybody seems to use them.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The answer should be removed entirely, not converted into a comment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Only moderators can convert answers into comments.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The answer is neither &lt;strong&gt;spam&lt;/strong&gt; nor &lt;strong&gt;rude or abusive&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Six &quot;red&quot; flags will not only delete the post, but hide it in the revision history and apply a 100 rep penalty to the poster. Deleting the post via deletion votes would prevent this.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;TL;DR&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Immediately flag invalid answers of type 4 as &lt;strong&gt;spam&lt;/strong&gt; or &lt;strong&gt;rude or abusive&lt;/strong&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If your own answer turns out to be invalid, delete it yourself.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Immediately leave a comment on all invalid answers that are not your own.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Immediately flag invalid answers of type 5 as &lt;strong&gt;not an answer&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you are a trusted user, the challenge is fairly active and the answer should not get converted into a comment, consider voting to delete instead.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Give the poster time to fix or self-delete his invalid answer of type 1 to 3.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If a sufficient amount of time has passed (say 48 hours) or the answer was &lt;em&gt;deliberately invalid&lt;/em&gt;, flag the answer as &lt;strong&gt;in need of moderator intervention&lt;/strong&gt;, providing an explanation of why it is invalid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you are a trusted user and the challenge is fairly active, consider voting to delete instead.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you fix your self-deleted answer, undelete it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you fix your answer and cannot undelete it yourself, flag it as &lt;strong&gt;in need of moderator intervention&lt;/strong&gt;, requesting its undeletion.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="46076" LastEditDate="2019-07-11T04:03:34.603" LastActivityDate="2019-07-11T04:03:34.603" CommentCount="18" ContentLicense="CC BY-SA 4.0" />
  <row Id="7991" PostTypeId="2" ParentId="7987" CreationDate="2016-01-07T17:06:41.600" Score="-3" Body="&lt;h2&gt;Keep the answer but mark it incorrect in header&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Let the answerer keep the answer as long as they label it incorrect in the header (and so noncompetitive) and explain how it fails. Any downvotes might they take from keeping it are at their own risk.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My reasoning is that invalid answers range from blatantly wrong untested answers to honest mistakes where the poster interpreted an ambiguous spec not as the asker intended. We should let votes decide between the cases. The blatantly wrong answers will get downvoted, pressuring the poster to delete them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I want to avoid the frustrating situation where someone works hard to golf a problem, posts it, gets upvotes, and then it told they have to delete it for a reason that wasn't really their fault, such as:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The asker changes the question&lt;/li&gt;&#xA;&lt;li&gt;The asker makes an unexpected ruling that invalidates the answer&lt;/li&gt;&#xA;&lt;li&gt;The answers passes all test cases, but fails an obscure corner case that one might not expect to be valid&lt;/li&gt;&#xA;&lt;li&gt;The spec is ambiguous, and the answered interpreted it a reasonable way without seeing the potential ambiguity&lt;/li&gt;&#xA;&lt;li&gt;The answer breaks a condition that is in the challenge, but is so unexpected, buried in the spec or comments, and/or contrary to the rest of the challenge that a typical reader is likely to miss it. (I expect this case to be the most contentious, so I could remove it if people object to it specifically.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2016-01-07T17:06:41.600" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="7992" PostTypeId="2" ParentId="2140" CreationDate="2016-01-07T19:13:04.913" Score="2" Body="&lt;h1&gt;Number of cells used in optimal BF representation of a constant&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://esolangs.org/wiki/Brainfuck_constants&quot; rel=&quot;nofollow noreferrer&quot;&gt;Relevant&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your task is deceptively simple. Given a number &lt;code&gt;n&lt;/code&gt; (or a character &lt;code&gt;C&lt;/code&gt; with char code value &lt;code&gt;n&lt;/code&gt; in your encoding), output the number of cells utilized in the optimal representation of that number &lt;code&gt;n&lt;/code&gt; in a standard Brainf*** interpreter with &lt;code&gt;0&lt;/code&gt; &amp;lt;= &lt;code&gt;n&lt;/code&gt; &amp;lt;= &lt;code&gt;255&lt;/code&gt;. (8-bit wrapping.)&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; input&#xA;&amp;lt; output&#xA;&#xA;&amp;gt; 4&#xA;&amp;lt; 1   ; ++++&#xA;&#xA;&amp;gt; 0&#xA;&amp;lt; 1   ; empty program&#xA;&#xA;&amp;gt; 201&#xA;&amp;lt; 4   ; &amp;gt;+[--&amp;gt;-[-&amp;lt;]&amp;gt;]&amp;gt;+&#xA;&#xA;&amp;gt; 190&#xA;&amp;lt; 5   ; ++[--&amp;gt;-[&amp;lt;]&amp;gt;-]&amp;gt;&#xA;&#xA;&amp;gt; 185&#xA;&amp;lt; 2   ; -[&amp;gt;-&amp;lt;-------]&amp;gt;++&#xA;&#xA;&amp;gt; 255&#xA;&amp;lt; 1   ; -&#xA;&#xA;&amp;gt; 242&#xA;&amp;lt; 1   ; --------------&#xA;&#xA;&amp;gt; 241&#xA;&amp;lt; 2   ; ---[&amp;gt;-----&amp;lt;+]&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;p&gt;Does more describing need to be done? &lt;s&gt;Should I just remove the bonuses?&lt;/s&gt; Bonuses removed.&lt;/p&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-09T17:39:53.507" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="7993" PostTypeId="2" ParentId="2140" CreationDate="2016-01-08T01:46:34.263" Score="0" Body="&lt;h1&gt;Print as many numbers as you can&lt;/h1&gt;&#xA;&lt;p&gt;A &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-code&lt;/a&gt; challenge where you have two occurrences of each ASCII character from 20 to 7E to write as many programs as you can to print single distinct integers (one integer per program). For example, you cannot have &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;AA&lt;/code&gt; to print &lt;code&gt;10&lt;/code&gt; and &lt;code&gt;1010&lt;/code&gt; in CJam, respectively, as that is three occurrences of &lt;code&gt;A&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Full programs are not required.&lt;/p&gt;&#xA;&lt;p&gt;You get 1 point for each integer you print. In the case that two answers create the same number of integers, the tiebreaker is the answer that uses the fewest bytes to create the integers.&lt;/p&gt;&#xA;&lt;p&gt;Is this a good idea for a challenge? Also, is it a dupe? I feel like I've seen it before but I'm not sure.&lt;/p&gt;&#xA;" OwnerUserId="43444" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-09T00:33:25.700" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="7995" PostTypeId="2" ParentId="2140" CreationDate="2016-01-08T03:43:21.300" Score="1" Body="&lt;h1&gt;Format a list of words&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to format a list of words across multiple lines that are no longer than a given number of characters, so that each line contains as many words as possible and no words are unnecessarily cut off.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;The input will be a space-separated list of words and then a number that is at least 4.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;The output should be the input words grouped into lines so that none of the lines contains more characters than the input number. The lines should be output in the order they were input. The words should be comma-separated, and each line except the last should end with a comma. If a word is too long to fit on a line, it should be cut off as little as possible while following the other rules, and &amp;quot;...&amp;quot; should be added to the end.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA;foo bar baz qux 12&#xA;&#xA;Output:&#xA;foo, bar,&#xA;baz, qux&#xA;&#xA;&#xA;Input:&#xA;foo bar baz qux 5&#xA;&#xA;Output:&#xA;foo,&#xA;bar,&#xA;baz,&#xA;qux&#xA;&#xA;&#xA;Input:&#xA;strength dexterity constitution intelligence wisdom charisma 10&#xA;&#xA;Output:&#xA;strength,&#xA;dexterity,&#xA;consti...,&#xA;intell...,&#xA;wisdom,&#xA;charisma&#xA;&#xA;&#xA;Input:&#xA;quas wex exort 4&#xA;...,&#xA;wex,&#xA;e...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Sandbox questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Has this been done before?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="34638" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-08T12:36:18.713" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="7998" PostTypeId="2" ParentId="2140" CreationDate="2016-01-08T06:15:28.433" Score="5" Body="&lt;h1&gt;Four-Byte Bloom Filter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Bloom_filter&quot; rel=&quot;nofollow noreferrer&quot;&gt;Bloom filters&lt;/a&gt; are cool.  In the words of that Wikipedia article:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A Bloom filter is a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970, that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not, thus a Bloom filter has a 100% recall rate. In other words, a query returns either &quot;possibly in set&quot; or &quot;definitely not in set&quot;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The motivation behind Bloom filters is that, by giving up perfect accuracy, the amount of memory necessary can be dramatically decreased.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A Bloom filter takes the form of a set of bits, along with a set of hash functions.  To insert something into the Bloom filter, calculate the N different hashes and flip those bits to 1.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;initialization &#xA;00000000&#xA;&#xA;letter `P` maps to 1 when using hash function F and 6 when using hash function G&#xA;01000010&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Additional elements are added over top previous ones.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;letter `h` maps to 6 and 4&#xA;01001010&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;To test if an element is a member of a set, perform the hashes and check to see if those bits are 1.  If not all of them are 1, then it can't possibly be a member of the set.  If they are all 1s, then it could be a member.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;letter `W` maps to 0 and 4&#xA;01001010&#xA;^   ^&#xA;`W` is not a member&#xA;&#xA;letter `P` maps to 1 and 6&#xA;01001010&#xA; ^    ^&#xA;`P` could be a member (it is)&#xA;&#xA;letter `i` maps to 4 and 1&#xA;01001010&#xA; ^  ^&#xA;`i` could be a member (it is a false positive)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As more elements are added to the set, the probability of false positives increases.  In large-scale applications, a Bloom filter with a small error rate is still an order of magnitude smaller than an exact database.  Below is a neat diagram from &lt;a href=&quot;https://highlyscalable.wordpress.com/2012/05/01/probabilistic-structures-web-analytics-data-mining/&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; great article on probabilistic data structures.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/VRyWy.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/VRyWy.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you will implement a miniature Bloom filter.  A really, really small Bloom filter with 32 bits.  Your data type will be the 94 non-whitespace printable ASCII characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Functionality&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Bloom filter will have 32 bits and 2 hash functions.  It is up to you what those two hash functions are, they simply must be decently independent of one another. (Sandbox note, should I specify the hash functions?).  Your program will be asked to do two separate tasks:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Given a current state of the bloom filter and a list of characters, add those characters to the filter and output the new filter state&lt;/li&gt;&#xA;&lt;li&gt;Given a current state of the bloom filter and a list of characters, test those characters for membership and output a list of truthy (could be a member) or falsey (definitely not a member) values.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Formatting specifics&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input consists of the current state, an operation, and a list of characters.  The Bloom filter state will be represented as a string of 8 hexadecimal characters.  This will then be followed by either &lt;code&gt;+&lt;/code&gt; for adding or &lt;code&gt;?&lt;/code&gt; for membership testing.  Finally, there will be a list of between 1 and 94 characters (printable non-whitespace ASCII) as data points.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output will either be the new state, as 8 hex characters, or a list of truthy/falsey values.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example I/O&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;This represents adding the characters in my username to a blank filter&#xA;00000000+PhiNotPi&#xA;This is a possible output (7 bits have been permanently flipped)&#xA;48a01030&#xA;&#xA;This represent adding the character 1 to the current filter&#xA;48a01030+1&#xA;This is a possible output (9 bits flipped so far)&#xA;48a01074&#xA;&#xA;This represents testing for membership of Phi&#xA;48a01074?Phi&#xA;Output must be all true since they were added in earlier&#xA;[True, True, True]&#xA;&#xA;This represents testing for membership of 12345&#xA;48a01074?1234&#xA;Output must be true for 1, but not necessarily false for the others&#xA;[True, False, False, True, False]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2016-01-08T06:15:28.433" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="7999" PostTypeId="2" ParentId="2140" CreationDate="2016-01-08T06:30:29.483" Score="1" Body="&lt;h1&gt;Smallest Turing Complete Interpreter&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Notes&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Has anything like this ever been done before?&lt;/li&gt;&#xA;&lt;li&gt;Do you think this will be well received?&lt;/li&gt;&#xA;&lt;li&gt;In my research I couldn't find a simple definition of what makes a language &quot;Turing complete&quot;. What alterations or additions should I make to the language rules? I would prefer that the language in every answer was not exactly the same, but at the same time I want to keep the complexity as low as possible (while still being Turing complete) so that &lt;em&gt;ideally&lt;/em&gt; one of the answers would become the world's smallest (non-&lt;code&gt;eval&lt;/code&gt;) interpreter.&lt;/li&gt;&#xA;&lt;li&gt;Are there any other loopholes I missed?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Let me know in the comments!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to make the smallest possible interpreter for a programming language.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What is the language we are interpreting?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You get to create the language! You can implement any instructions you like, however the language must be &lt;a href=&quot;https://en.wikipedia.org/wiki/Turing_completeness&quot; rel=&quot;nofollow noreferrer&quot;&gt;Turing complete&lt;/a&gt;. For the purposes of this challenge, your &quot;Turing complete&quot; language must be able to:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Store and retrieve an arbitrary amount of data in memory&lt;/strong&gt; The amount must be theoretically infinite, but your interpreter only needs to handle a minimum of 64 kilobytes (&lt;code&gt;256 ^ 0xffff&lt;/code&gt; distinct values). The format could be an array of numbers, a string, a &lt;em&gt;very&lt;/em&gt; large integer (if the language of your interpreter supports 524288-bit integers :P ) or any other format that provides the same number of distinct values.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Loop conditionally&lt;/strong&gt; The loop must also be able to alter the execution flow (if you implement a &lt;code&gt;while&lt;/code&gt; loop that can only have one instruction in the body, it won't be able to affect anything outside of the while loop). This can be one command (eg: &lt;code&gt;while A do { B C D }&lt;/code&gt;) or two (eg: &lt;code&gt;if A then B&lt;/code&gt; and &lt;code&gt;goto C&lt;/code&gt;) or any number that produces the same effect.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Print any ASCII character&lt;/strong&gt; This includes code points &lt;code&gt;32&lt;/code&gt; to &lt;code&gt;126&lt;/code&gt; inclusive. Newline is not required but being able to print characters outside of this range is fine.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;It does not need to take input. Any extra features are fine as long as it meets these requirements. The language does not have to be pleasant to use, but each of these requirements must be usable in the real world.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See the languages &lt;a href=&quot;https://esolangs.org/wiki/Turing_tarpit&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; for some inspiration...&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your interpreter must take a single string containing the source code of a program in your language.&lt;/li&gt;&#xA;&lt;li&gt;The input will always be a valid program. You do not need to handle endless loops, impossible instructions, etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A single string containing the output of the program.&lt;/li&gt;&#xA;&lt;li&gt;A single trailing newline is allowed, any other leading or trailing whitespace is not.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The only rule is that you &lt;strong&gt;cannot use eval&lt;/strong&gt; (or equivalent) in your interpreter.&lt;/li&gt;&#xA;&lt;li&gt;Your interpreter must be a full program, not just a function. Input and output must be from &lt;code&gt;STDIN&lt;/code&gt;, &lt;code&gt;STDOUT&lt;/code&gt; or their equivalents.&lt;/li&gt;&#xA;&lt;li&gt;The interpreter and the specifications of your language must be posted in your answer. Make sure you include all details that prove the language is Turing complete!&lt;/li&gt;&#xA;&lt;li&gt;Your language can be identical to an existing language or a language from another answer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Remember...&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. Your score is the number of bytes in the source code of your interpreter, so design your language to minimise this score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Good luck!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Sample Answer&lt;/h3&gt;&#xA;&#xA;&lt;h1&gt;JavaScript (ES6), 148 bytes&lt;/h1&gt;&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;s=prompt();o=&quot;&quot;;m=[];for(p=i=0;c=s[i];i++)v=m[p],+c?c-1?c-2?c-3?c-4?o+=String.fromCharCode(v):p++:p--:m[p]=~~v+1:m[p]=~~v-1:m[p]?i=m[p+1]:0;alert(o)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Language Specification&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Memory is stored on an infinite tape. The &lt;code&gt;pointer&lt;/code&gt; variable points to a position within this tape. The &lt;code&gt;index&lt;/code&gt; variable holds the index of the current instruction in the source code being executed. Each instruction is a single-digit number. The numbers do the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;5&lt;/code&gt; = print character ASCII code at &lt;code&gt;pointer&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;4&lt;/code&gt; = increment &lt;code&gt;pointer&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;3&lt;/code&gt; = decrement &lt;code&gt;pointer&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;2&lt;/code&gt; = increment value at &lt;code&gt;pointer&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1&lt;/code&gt; = decrement value at &lt;code&gt;pointer&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;0&lt;/code&gt; = if the value at &lt;code&gt;pointer&lt;/code&gt; is non-zero, set &lt;code&gt;index&lt;/code&gt; to the value at &lt;code&gt;pointer + 1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Explanation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Using numbers instead of letters for the instructions means I can check with &lt;code&gt;c-3&lt;/code&gt; instead of &lt;code&gt;c==&quot;x&quot;&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;s=prompt();&#xA;o=&quot;&quot;;&#xA;m=[];&#xA;for(p=i=0;c=s[i];i++)&#xA;  v=m[p],&#xA;  +c?&#xA;    c-1?&#xA;      c-2?&#xA;        c-3?&#xA;          c-4?&#xA;            o+=String.fromCharCode(v)&#xA;          :p++&#xA;        :p--&#xA;      :m[p]=~~v+1&#xA;    :m[p]=~~v-1&#xA;  :m[p]?i=m[p+1]:0;&#xA;alert(o)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Test&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;prompt = () =&amp;gt; input.value;&#xD;&#xA;alert = (output) =&amp;gt; result.textContent = output;&#xD;&#xA;var solution = _=&amp;gt;{ s=prompt();o=&quot;&quot;;m=[];for(p=i=0;c=s[i];i++)v=m[p],+c?c-1?c-2?c-3?c-4?o+=String.fromCharCode(v):p++:p--:m[p]=~~v+1:m[p]=~~v-1:m[p]?i=m[p+1]:0;alert(o) };&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;textarea id=&quot;input&quot; rows=&quot;5&quot; cols=&quot;70&quot;&amp;gt;222222222222222222222222222222222222222222222222222222222222222222222222522222222222222222222222222222522222225522254222222222222222222222222222222222222222222225111111111111531111111111111111111111115222222222222222222222222522251111115111111115425&amp;lt;/textarea&amp;gt;&amp;lt;br /&amp;gt;&#xD;&#xA;&amp;lt;button onclick=&quot;solution()&quot;&amp;gt;Go&amp;lt;/button&amp;gt;&#xD;&#xA;&amp;lt;pre id=&quot;result&quot;&amp;gt;&amp;lt;/pre&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Tags:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-design&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-design&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-design&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="46855" LastEditorUserId="46855" LastEditDate="2016-01-09T08:05:06.003" LastActivityDate="2016-01-09T08:05:06.003" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8000" PostTypeId="2" ParentId="7910" CreationDate="2016-01-08T13:05:34.497" Score="1" Body="&lt;h1&gt;Most Ripped-Off Idea&lt;/h1&gt;&#xA;&lt;p&gt;Often somebody has a very clever idea or workaround to a standard technique. This idea – if clever enough – will most likely be &lt;s&gt;copied&lt;/s&gt; adopted by a lot of other answerers by simply applying it to their language.&lt;/p&gt;&#xA;&lt;hr&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/a/66675/41859&quot;&gt;Mathematica answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/66656/41859&quot;&gt;Advance Happy New Year, 2016!&lt;/a&gt; is a very good example, as &lt;em&gt;nearly every&lt;/em&gt; other answer adopted the used technique, which led to massive byte reduction in almost every language.&lt;/p&gt;&#xA;" OwnerUserId="41859" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-08T13:05:34.497" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8006" PostTypeId="2" ParentId="2140" CreationDate="2016-01-08T22:04:38.013" Score="0" Body="&lt;h3&gt;Print Euler's number on its own graph&lt;/h3&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Print the first &lt;code&gt;n&lt;/code&gt; characters of &lt;a href=&quot;https://en.wikipedia.org/wiki/E_(mathematical_constant)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Euler's number (&lt;code&gt;e&lt;/code&gt;, 2.718281828459...)&lt;/a&gt; on a 'graph' of &lt;code&gt;e^n&lt;/code&gt;. For example, input &lt;code&gt;3&lt;/code&gt; (the x and y-axis scales here are provided for reference, and need not be implemented in your program):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;20 |         1&#xA;19 |&#xA;18 |&#xA;17 |&#xA;16 |&#xA;15 |&#xA;14 |&#xA;13 |&#xA;12 |&#xA;11 |&#xA;10 |&#xA; 9 |&#xA; 8 |&#xA; 7 |     7&#xA; 6 |&#xA; 5 |&#xA; 4 |&#xA; 3 | 2&#xA; 2 |&#xA; 1 |&#xA; 0 | - - - - - - -&#xA;     1   2   3&#xA;      digit #&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In the example above, note that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Three digits of Euler's number are presented&lt;/li&gt;&#xA;&lt;li&gt;Each digit is shown at a height equal to &lt;code&gt;e^n&lt;/code&gt;, where &lt;code&gt;n&lt;/code&gt; is the digit number. &lt;code&gt;2&lt;/code&gt;, for example, is shown at height &lt;code&gt;3&lt;/code&gt; because &lt;code&gt;e^1 = 2.72&lt;/code&gt;, which we round up to 3. You may round up or down, see below.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Various other informational bits:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Rounding need not be implemented; &lt;code&gt;271&lt;/code&gt; is acceptable output for input &lt;code&gt;3&lt;/code&gt;, as is &lt;code&gt;272&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You will always be provided with input &amp;gt;= 1 , and your input will never contain decimal places nor any characters other than 0-9.&lt;/li&gt;&#xA;&lt;li&gt;You may round the y value up or down, I.e. &lt;code&gt;e^3 = 20.0855&lt;/code&gt; may be shown as y=20 or y=21.&lt;/li&gt;&#xA;&lt;li&gt;Your graph must have higher y-values at the top and higher x-values to the right; it must have a positive slope&lt;/li&gt;&#xA;&lt;li&gt;You may use any amount of horizontal spacing &amp;gt;= 1 between successive digits. In the example above, there are 3 spaces between successive digits. You just can't have digits stacked on top of eachother.&lt;/li&gt;&#xA;&lt;li&gt;You are not required to print scales on the x or y axis.&lt;/li&gt;&#xA;&lt;li&gt;Your input will always be &lt;code&gt;&amp;lt;= 10&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You may hardcode the required digits if you so desire.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user11043" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-08T22:22:24.590" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8007" PostTypeId="1" CreationDate="2016-01-08T22:15:31.280" Score="36" ViewCount="2084" Body="&lt;h3&gt;Final phase&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You have chosen the categories and the nominees for PPCG's first ever &quot;Best of&quot;, now it is time to pick the winners!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each of the seven categories is represented by an answer to this question, and each of these answers contains all nominations by the members of our community.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Voting mechanism&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each nominee has been added as a comment to its category's answer. In each category, the nominee whose comment has the highest number of votes by February 1, 00:00 UTC will be declared the winner of that category.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Further details&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Starting now, please do &lt;strong&gt;not&lt;/strong&gt; edit the answers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Please do &lt;strong&gt;not&lt;/strong&gt; add comments to the answers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Votes on the question and on answers are meaningless; only votes on comments count.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Feel free to vote for multiple nominees of the same category, including your own posts.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="12012" LastEditDate="2016-02-01T00:34:50.860" LastActivityDate="2016-02-01T00:34:50.860" Title="Cast your vote for &quot;Best of PPCG 2015&quot;!" Tags="|discussion|best-of|" AnswerCount="7" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8008" PostTypeId="2" ParentId="8007" CreationDate="2016-01-08T22:16:08.723" Score="14" Body="&lt;h2&gt;Educational&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Best answer containing interesting and/or deep mathematical (or other) material.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/47640/8478&quot;&gt;Area of a Self-Intersecting Polygon&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31403/ell&quot;&gt;Ell&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Martin Büttner&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ell's answers are amazing without exception. It was actually pretty hard to single out a specific post. They tend to answer very tricky questions (occasionally as the only answerer), but always solve them with exceptionally clever algorithms which are also very well explained (more often than not with great diagrams). This is one such answer. They came up with an original algorithm for the problem (whether it's been discovered independently elsewhere, I cannot say) which solves the problem very elegantly and rather efficiently. The explanation is top-notch, very clear and with one of those beautiful and very helpful diagrams. I can't upvote most of Ell's answers enough and would very much like to see this one awarded this prize as a representative for all of their great contributions to PPCG.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/68131/20469&quot;&gt;Xorting an array&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/29577/jakube&quot;&gt;Jakube&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Alex A.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Jakube's Pyth solution to this problem is outstanding. It's an efficient, novel algorithm (with a very short implementation, of course) that he takes care to explain thoroughly and in an understandable and accessible manner.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/51662/194&quot;&gt;Extending OEIS: Counting Diamond Tilings&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/194&quot;&gt;Peter Taylor&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Self-nominated&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The header of my answer here puts the emphasis on the mathematics rather than the language, because the analysis which went into the algorithm is far more important than the code: &lt;strong&gt;Algebra, graph theory, Möbius inversion, research, and Java&lt;/strong&gt;. (Maybe I should have written the submission in CJam, because it doesn't have many opportunities to win &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenges, but if I had then someone would probably have ported the answer to C). The description given is really only an overview, with links out to Wikipedia for more detail on some of the techniques applied and to my own writeup for further references.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-01-09T11:04:50.620" CommentCount="3" CommunityOwnedDate="2016-01-08T22:16:08.723" ContentLicense="CC BY-SA 3.0" />
  <row Id="8009" PostTypeId="2" ParentId="8007" CreationDate="2016-01-08T22:17:11.907" Score="10" Body="&lt;h2&gt;Less is More&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Best challenge with a simple but novel problem and a concise and clear spec.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/68109/20469&quot;&gt;Xorting an array&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-b%C3%BCttner&quot;&gt;Martin Büttner&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Alex A.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Beyond being an extraordinarily interesting problem, it has practical use, which is best explained by directly quoting the post:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;It occurred to me the other day that a XOR operation can &quot;sort&quot; an array, which makes it possible to perform a binary search on the array in O(log n) without having to sort it first. It appears to be possible to determine N in pseudolinear time, which would make this a faster alternative to most sorting algorithms, and it doesn't have the memory requirements of radix sort. Of course, a straight linear search through the unsorted array will be faster, but if you want to search the same array many times, a single linear pre-computation can bring down the time required for each search significantly.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/63755/8478&quot;&gt;Rotate the anti-diagonals&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/32014/zgarb&quot;&gt;Zgarb&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Martin Büttner&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think this is the best kind of challenge. It's simple. Everyone can grasp it. It doesn't take huge amounts of code to implement. But it still allows for a variety of interesting approaches (as evidenced by aditsu's winning answer). Over the past year Zgarb have worked their way up one of our best and most productive challenge authors. The challenge specifications are consistently clear, comprehensive and to the point. This challenge is the quintessence of all of those things and should the receive as a representative for all the other top-quality challenges Zgarb wrote.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/65641/39462&quot;&gt;The versatile integer printer&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31516/stewie-griffin&quot;&gt;Stewie Griffin&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Zach Gates&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think this is a phenomenal challenge. It's easy to understand and easy to read; not to mention the acute scoring method. There is a vast number of possible answers. That's what makes it so fun and competitive. StewieGriffin has consistently posted impressive challenges of all shapes and sizes, from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;. In the past few months, he's worked his way up to the top 10% of users across the site. I think this is the perfect example of something simple but still challenging enough to spark interest. It deserves to have the win.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/54354/194&quot;&gt;Find the largest independent set in a high-dimensional lattice-like graph&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9206/lembik&quot;&gt;Lembik&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Peter Taylor&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question asks for maximum independent sets for a class of graphs which is sufficiently described in only a few lines and which has a lot of structure but not so much as to render the problem trivial. Although Lembik's obsession with binary strings is still in evidence, this takes quite a different direction to their previous questions.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/44381/automate-saving-the-world&quot;&gt;Automate Saving the World&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31716/dj-mcmayhem&quot;&gt;DJMcMayhem&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This has always been one of my favorite challenges. The premise is &lt;em&gt;extremely&lt;/em&gt; simple. Print some numbers, pause, repeat. But it has a unique twist that is very relevant to the story of the challenge. Each language used most come from before 1977. A unique restricted-source challenge, and yet the spec is very short, at least when you ignore the long story preamble to the challenge. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/58692/source-code-ecological-footprint&quot;&gt;Source code ecological footprint&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/13798/super-chafouin&quot;&gt;Super Chafouin&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by TimmyD&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Topical-humor entry, minimally edited with a clear specification, dozens of answers with a variety of methods, and nearing a hundred upvotes (with no downvotes) ... PLUS, a novel scoring mechanism that focused the challenge on something other than code-golf. All in all, an excellent challenge.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2016-01-11T14:44:01.800" CommentCount="6" CommunityOwnedDate="2016-01-08T22:17:11.907" ContentLicense="CC BY-SA 3.0" />
  <row Id="8010" PostTypeId="2" ParentId="8007" CreationDate="2016-01-08T22:18:20.333" Score="7" Body="&lt;h2&gt;Most Above-and-Beyond Answer&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Every once and a while, an answer takes the challenge to the extreme. This prize will be awarded to an answer which went far beyond the expectations of the challenge. This could include&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a code golf answer that brute-forced/proved the shortest program in some language&lt;/li&gt;&#xA;&lt;li&gt;a graphical-output popcon answer of extreme size and quality&lt;/li&gt;&#xA;&lt;li&gt;a KOTH answer of high complexity which absolutely dominated the competition&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/62812/12914&quot;&gt;Truth Machine&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-b%c3%bcttner&quot;&gt;Martin Büttner&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by El'endia Starman&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Martin normally explains his Hexagony answers wonderfully, but this one is, I believe, the most exceptional answer he's done yet. He wrote a brute-forcer that failed to find a shorter program, but turned up a veritable treasure trove of same-length programs. Martin took the time and effort to highlight and explain every single meaningfully distinct program. In doing so, he taught himself and others a great deal about how control flow works in Hexagony. Not only that, but some of the programs found were so convoluted that a human probably would not have come up with them, which is a testament to the surprising intricacy of the language.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/51662/8478&quot;&gt;Extending OEIS: Counting Diamond Tilings&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/194/peter-taylor&quot;&gt;Peter Taylor&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Martin Büttner.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;During my diamong-tiling spree last summer, I stumbled across an OEIS sequence with a surprisingly small number of terms (5). It seemed like a rare case where it would be possible for us amateurs to extend a sequence on OEIS to some degree, since even a half-decent brute force solution should be able to count the tilings for sidelength 6 or 7. And that was pretty much what I was expecting as answers: optimised brute force which essentially counts the possible tilings while applying some clever heuristics to reduce the search space.&lt;/p&gt;&#xA;&lt;p&gt;What did Peter do? He spent a week (on and off, I assume) on the problem and found a closed-form solution based on several other results scattered throughout OEIS. His reference implementation solves N = 1000 in 30 seconds. &lt;a href=&quot;http://cheddarmonk.org/papers/distinct-dimer-hex-tilings.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;He also wrote up a short 4-page paper pulling all the loose ends together&lt;/a&gt;. I think that's pretty much the definition of above-and-beyond.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/60286/45941&quot;&gt;How many three-fruit pies can you make?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/45941/mego&quot;&gt;Mego&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nominated&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;xnor posted a bounty on this question, awarding 150 reputation to the first person who could prove an optimal algorithm for maximizing the number of pies made from &lt;code&gt;n&lt;/code&gt; ingredients, with &lt;code&gt;k&lt;/code&gt; distinct ingredients per pie, for any positive integers &lt;code&gt;n&lt;/code&gt; and &lt;code&gt;k&lt;/code&gt;. Building on &lt;a href=&quot;https://codegolf.stackexchange.com/a/59209/45941&quot;&gt;Thomas Kwa's work&lt;/a&gt;, I managed to construct a &lt;a href=&quot;https://cloud.sagemath.com/projects/0006c19e-2e0f-48a0-8a6f-c5770416a7cc/files/2015-10-10-043825.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;proof&lt;/a&gt; for an optimal algorithm, earning the bounty (my first!) on my fifth-ever answer to a PPCG challenge.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/51238/7311&quot;&gt;Rearranging Words&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by randomra.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Dennis worked on this code challenge though several weeks and 44 revisions to find the optimal solution and thoroughly explain it with examples. The final code is a terse, 363-byte long CJam code with no embedded data. Of course this code has a very well commented version in Dennis's answer. Also, the solutions for the test cases were visualized (with help from Doorknob).&lt;/p&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/65643/31516&quot;&gt;The versatile integer printer&lt;/a&gt;, by &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-b%C3%BCttner&quot;&gt;Martin Büttner&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Stewie Griffin&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Martin's answer to this challenge is an extreme accomplishment. Martin managed to write a code that is executable in 15 unique languages, while the maximum amount anyone else managed was 6 languages (disregarding version dependent solutions). Not only did he manage 15 languages, he did so in 65 bytes. Sweerpotato's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/65641/the-versatile-integer-printer/65672#comment158981_65643&quot;&gt;comment&lt;/a&gt;: &amp;quot;This is really impressive&amp;quot;, was posted when the submission had 6 languages and a score of 0.0833. 15 revisions later, the submission had 15 languages and a score of 0.019. In addition, he explained in detail how every single language prints the correct number. 119 upvotes at the time I'm writing this says it all really.&lt;/p&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/44683/31347&quot;&gt;Showcase your language one vote at a time&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-b%c3%bcttner&quot;&gt;Martin Büttner&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by MickyT&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This answer for Mathematica has always impressed me with the sheer amount of effort and time that was put into it.  As with all Martin's answers it is clear and does not leave you going huh?  It was a well deserved winner of the challenge and I think a good contender for this category&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-13T04:29:44.930" CommentCount="6" CommunityOwnedDate="2016-01-08T22:18:20.333" ContentLicense="CC BY-SA 3.0" />
  <row Id="8011" PostTypeId="2" ParentId="8007" CreationDate="2016-01-08T22:19:21.213" Score="11" Body="&lt;h2&gt;Rookie of the Year (challenge)&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Best challenge by a user who had not posted a challenge before 2015.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Nominations:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/55960/im-not-the-language-youre-looking-for&quot;&gt;I'm not the language you're looking for!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/32686/muddyfish&quot;&gt;MuddyFish&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by GamrCorps&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is one of the coolest challenges that I've seen on the site. It encouraged users to think outside the box and find and &lt;s&gt;ab&lt;/s&gt;use &lt;s&gt;language bugs&lt;/s&gt; unintended features so the community as a whole learned a thing or two about how certain languages work in unpredictable ways. Ignoring the &lt;em&gt;many&lt;/em&gt; Foo answers, some users found polyglots that could also earn a place in the &quot;Most Above and Beyond&quot; Category. Overall, this challenge greatly benefited the PPCG.SE community, which is why I nominated it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/62732/implement-a-truth-machine&quot;&gt;Implement a Truth Machine&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/45151/quartata&quot;&gt;quartata&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by RikerW&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This was a cool challenge, and the first I saw on this site. :P  It was simple, but not trivial in some languages.  Especially it allowed esolangs and other unusual languages to get in on the action.  For example, @ThomasKwa wrote a 2 byte solution in Motorola MC14500B Machine Code.  @FlagAsSpam even wrote a 18 byte Minecraft™ solution!  As you can see, it benefited the PPCG community and was a lot of fun for everyone.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/51728/194&quot;&gt;Stacking Pythagorean Triangles&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31054/brainsteel&quot;&gt;Brainsteel&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Peter Taylor&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A simple question to understand, well illustrated, and with a lot of depth.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/57963/overcoming-cluster-size&quot;&gt;Overcoming cluster size&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Sp3000&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Surprisingly, despite being a member for two years, 2015 was the first year of challenge-writing for Dennis. This challenge requests complex polyglots, where the key is to optimise matching languages to pre-specified tasks whilst keeping the total byte count low.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/58469/39462&quot;&gt;Molecules to Atoms&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/39462/zach-gates&quot;&gt;Zach Gates&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Self-Nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This was a novel challenge that has proved interesting. It presented users with a real-world problem to solve in fun way. It has clear specifications and, while able to be understood easily, it isn't trivial to implement. This leaves room for many possible answers and makes it a more competitive challenge.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/63768/decimal-concatenation-of-squares&quot;&gt;Decimal concatenation of squares&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/34421/tanmath&quot;&gt;TanMath&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a challenge that I believe was one that many people liked. I started out this challenge by asking about my idea in chat. Many people supported the idea and was excited to answer. It had a clear specification, and was one of those sequence challenge based on an OEIS sequence. It was a relatively simple challenge as well.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/53369/fibonacci-spiral&quot;&gt;Fibonacci Spiral&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/40695/do%E1%B4%A1%C9%B4%C9%A2%E1%B4%8F%E1%B4%80%E1%B4%9B&quot;&gt;Downgoat&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Self-Nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This was my first challenge on the site which brought forth an interesting problem. Without being a trivial problem, it has a specification which was crystal clear. Bringing together the Fibonacci sequence and ascii-art, this challenge provided a good balance of difficulty while maintaining a level of engagingness. It also highlighted strengths in non-golfing languages such as MATLAB and other smart solutions.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/57972/i-havent-seen-that-number-before&quot;&gt;I haven't seen that number before!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/43444/ampora&quot;&gt;Ampora&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Self-Nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Not only was this a challenge created by a user not present before 2015, but this was my very first &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge overall! I thought this was a tough problem that provided a nice challenge for golfers. @orlp wrote a winning Pyth solution in 22 bytes, while other users provided answers in a number of languages. I believe the PPCG community liked it as a challenge, and hopefully you were excited to see what else I would create.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/53799/20469&quot;&gt;Calculating waves&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/42545/ethproductions&quot;&gt;ETHproductions&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Alex A.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This was ETHproductions' first challenge. It's an interesting problem that's well described and well formatted. It wasn't too simple but it wasn't so difficult as to be a barrier to entry for newer users. Indeed, a couple of users answered for the first time on that challenge.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-01-18T21:01:49.923" CommentCount="9" CommunityOwnedDate="2016-01-08T22:19:21.213" ContentLicense="CC BY-SA 3.0" />
  <row Id="8012" PostTypeId="2" ParentId="8007" CreationDate="2016-01-08T22:20:24.330" Score="6" Body="&lt;h2&gt;Labour of Love&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;For a great challenge that took immense amounts of preparation on the part of the challenge author.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/50690/block-building-bot-flocks&quot;&gt;Block Building Bot Flocks!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/26997/calvins-hobbies&quot;&gt;Calvin's Hobbies&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Sp3000&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge, &quot;BBBF&quot;, came soon after another Stack Snippet-based KOTH by Calvin (&lt;a href=&quot;https://codegolf.stackexchange.com/q/48353/20469&quot;&gt;Red vs. Blue&lt;/a&gt;). [more description pending]&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/44707/18487&quot;&gt;Lab Rat Race: an exercise in genetic algorithms&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-b%C3%BCttner&quot;&gt;Martin Büttner&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Rainbolt&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you were around when &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/3578/fortnightly-challenge-ideas&quot;&gt;fortnightly challenges&lt;/a&gt; were a thing, then you know that they all involve immense amounts of preparation. This one in particular was posted with controllers written in five different languages.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/48353/20469&quot;&gt;Red vs. Blue - Pixel Team Battlebots&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/26997/calvins-hobbies&quot;&gt;Calvin's Hobbies&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Alex A.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Just by reading the post you can tell an incredible amount of work went into making this. Calvin's Hobbies even made a Sandbox post for it to test ideas, and he is well known for never using the Sandbox, so you know it's complex challenge.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/64764/8478&quot;&gt;Sprocket Science: Animating a Chain Drive System&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31403/ell&quot;&gt;Ell&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Martin Büttner&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have rarely seen a code golf challenge with a spec like that. It is certainly a challenging problem (and I still feel bad for never getting around to answer it), but the specification manages to clarify all of the details with those amazing diagrams and animations which are probably the best reference implementation any challenge author has ever written on PPCG. The annotated diagram of the various dimensions of the sprocket alone would have qualified this challenge for a nomination.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/67560/king-of-the-hill-spacewar&quot;&gt;King of the Hill - Spacewar!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12914/elendia-starman&quot;&gt;El'endia Starman&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Zgarb&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this KotH challenge, Javascript bots compete in the classic shooter game &lt;em&gt;Spacewar!&lt;/em&gt; (or one version of it).&#xA;In order to create the challenge, El'endia Starman (with help from PhiNotPi, BrainSteel and CᴏɴᴏʀO'Bʀɪᴇɴ) recreated the game from scratch, planned and implemented an easy-to-use interface for the submissions, and put up a website where people can pit the bots against each other or try their own skills against one.&#xA;The game even features animated rocket exhaust flames and explosions!&#xA;This is a great KotH challenge which certainly took loads of love and work to accomplish.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2016-01-09T21:44:27.893" CommentCount="5" CommunityOwnedDate="2016-01-08T22:20:24.330" ContentLicense="CC BY-SA 3.0" />
  <row Id="8013" PostTypeId="2" ParentId="8007" CreationDate="2016-01-08T22:21:34.827" Score="6" Body="&lt;h2&gt;Team Effort&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;[Best] answer that involved the cooperation of many people.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Nominations:&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/66181/20260&quot;&gt;Count sums of two squares&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/2537/mitch-schwartz&quot;&gt;Mitch Schwartz&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/45268/xsot&quot;&gt;xsot&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/users/194/peter-taylor&quot;&gt;Peter Taylor&lt;/a&gt;.&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by xnor.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This 44-byte Python solution combines significant contributions from all three users, each bringing a fundamental new idea that gave a significant improvement. The end result is a heavily-golfed, beautiful, and unexpected solution.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Peter Taylor (&lt;a href=&quot;https://codegolf.stackexchange.com/a/65326/20260&quot;&gt;56 bytes&lt;/a&gt;) brought in a new formula from OEIS that expresses the answer as a sum of signs corresponding to odd divisors, totally different from natural counting strategies of previous answers. He previously&#xA;used it in his &lt;a href=&quot;https://codegolf.stackexchange.com/a/64864/20260&quot;&gt;CJam answer&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;xsot (&lt;a href=&quot;https://codegolf.stackexchange.com/a/65077/20260&quot;&gt;52 bytes&lt;/a&gt;) expressed the formula recursively, avoiding a direct summation, with clever handling of the exceptional n=0 case using the operator precedence of bit shift to save on parens.&lt;/li&gt;&#xA;&lt;li&gt;Mitch Schwartz (&lt;a href=&quot;https://codegolf.stackexchange.com/a/66181/20260&quot;&gt;44 bytes&lt;/a&gt;) simplified xsot's recursion to achieve an alternating sum by negating the result of the recursive call, avoiding needing to check sign directly.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/48435/20469&quot;&gt;Red vs. Blue - Pixel Team Battlebots&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/2867/phinotpi&quot;&gt;PhiNotPi&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/users/21487/sp3000&quot;&gt;Sp3000&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Alex A.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;PhiNotPi and Sp3000 worked together extensively for this challenge to create a pair of bots called SphiNotPi3000. The bots share almost all of the same code and work as a pair. As a result of their hard work, they absolutely obliterated the Red Team and made it an easy victory for Blue.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/58624/42963&quot;&gt;1,2,Fizz,4,Buzz&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/42963/timmyd&quot;&gt;TimmyD&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/30688/feersum&quot;&gt;feersum&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/1308/danko-durbi%c4%87&quot;&gt;Danko Durbić&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/users/571/tessellatingheckler&quot;&gt;TessellatingHeckler&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Sure, it's just a FizzBuzz challenge. But the fact that it's in PowerShell (so there's already a limited number of users here that use it), and that there are three different solutions all at the same 54 byte count, make this a unique entry.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-11T14:57:31.993" CommentCount="3" CommunityOwnedDate="2016-01-08T22:21:34.827" ContentLicense="CC BY-SA 3.0" />
  <row Id="8014" PostTypeId="2" ParentId="8007" CreationDate="2016-01-08T22:22:51.733" Score="14" Body="&lt;h2&gt;Showcase of Most Promising New Golfing Language&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;[What the title says.] There seem to be quite a few of these new languages that have popped up in the last year.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Nominations:&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/67955/20469&quot;&gt;Diamond Puzzles!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt; - Jelly&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Alex A.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Not only is this an interesting approach to the challenge, but it's a good display of Jelly's strengths. It doesn't use any built-ins that other golfing languages do not have, yet it beats the second best answer overall by 37% and the second best answer in a golfing language by 44%.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/62478/40695&quot;&gt;Halloween Golf: The 2spooky4me Challenge!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/42545/ethproductions&quot;&gt;ETHproductions&lt;/a&gt; - Japt&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Downgoat&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;JavaScript is a popular language here on PPCG, but lacks any golfing potential. Recently, quite a few JavaScript golfing languages have popped up but Japt is one of the most promising golfing languages. It has tons of built-ins and golfing-syntax.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/63710/calculate-phi-not-pi/63717#63717&quot;&gt;Calculate Phi (not Pi)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/45941/mego&quot;&gt;Mego&lt;/a&gt; - Seriously&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by TanMath&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Seriously is another stack-based language that can even beat CJam as it does in this answer. It has many built-ins and and cool commands. Using CP437 encoding allows for much more commands than regular ASCII.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/66507/45447&quot;&gt;Check if a UUID is valid without using regexes&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31957/c%E1%B4%8F%C9%B4%E1%B4%8F%CA%80-ob%CA%80%C9%AA%E1%B4%87%C9%B4&quot;&gt;Cᴏɴᴏʀ O'Bʀɪᴇɴ&lt;/a&gt; - Jolf&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Seadrus&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This question shows that Jolf has a lot of potential, being only three bytes shorter than the accepted answer, and would be the same length as the accepted answer, if not for a bug that was discovered. Jolf has a vast array of tools to its advantage, it's purpose being not only being mainly a golfing language but rather a &lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=26648603#26648603&quot;&gt;utility tool&lt;/a&gt;; this is signified by some of it's tools that would seem to be unhelpful for regular challenges, including, but not limited to, &lt;a href=&quot;http://conorobrien-foxx.github.io/Jolf/#code=K3BaIk9tZWdhJyA9ICUicHonzqk&quot; rel=&quot;nofollow noreferrer&quot;&gt;converting back-and-forth between Greek letters and their name&lt;/a&gt;, &lt;a href=&quot;http://conorobrien-foxx.github.io/Jolf/#code=bVE&quot; rel=&quot;nofollow noreferrer&quot;&gt;a function that returns 42&lt;/a&gt;, and &lt;a href=&quot;http://conorobrien-foxx.github.io/Jolf/#code=cHciSGVsbG8i&quot; rel=&quot;nofollow noreferrer&quot;&gt;code for concatenating upper- and lower-case versions of a string&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/59161/8478&quot;&gt;Capture on the Pawn Chessboard&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-b%c3%bcttner&quot;&gt;Martin Büttner&lt;/a&gt; - Retina&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-Nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Out of the four languages I created (and all the ones I have notes for), Retina is the only one I'd consider a golfing language. While this answer isn't a winner, it's a fairly concise solution, just barely beaten by Pyth and it showcases several of the cool things Retina can do.&lt;/p&gt;&#xA;&lt;p&gt;Retina is perhaps a bit different from the other golfing languages in this category. It doesn't try to squeeze a ton of built-ins into single-character commands, or make use of all 256 possible byte values to squeeze in more functionality.&lt;/p&gt;&#xA;&lt;p&gt;Instead Retina wants to do one thing: if a challenge can be solved with nothing but a regex (or a few of them), there should be as little overhead as possible in using that regex. And it does that &lt;em&gt;really&lt;/em&gt; well, regularly beating sed and Perl when it comes to regex-only solutions.&lt;/p&gt;&#xA;&lt;p&gt;Retina has also started to grow a bit beyond that original premise, and these days you can combine multiple types of regex stages (the answer shows transliteration, substitution and match counting), and you can loop through them (also part of that answer).&lt;/p&gt;&#xA;&lt;p&gt;According to &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/26735099#26735099&quot;&gt;Doorknob's statistics&lt;/a&gt;, Retina is the most-used language created in 2015. And finally, here is some testimonial from &lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=26135179#26135179&quot;&gt;undergroundmonorail&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;i like seeing how much retina has evolved. iirc originally the whole language was a way to stop people from commenting &amp;quot;this answer is invalid, regex isn't a language&amp;quot; but it's so much more than that and it's kind of beautiful&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/67503/34388&quot;&gt;Compute the Binary Sierpinski Triangle Sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/34388/adnan&quot;&gt;Adnan&lt;/a&gt; - 05AB1E&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-Nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;05AB1E is one of the first golfing languages I made. It's not finished yet and I need to implement a lot of functions. Due to the implicit input and output, it can beat other programming languages (like Pyth, or even Jelly :p) in short trivial tasks. Of course, it's not efficient enough and I think I can improve a lot on efficiency, but I definitely think it's one of the promising languages of 2015.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/61621/40695&quot;&gt;Remove all occurrences of the first letter of a string from the entire string&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/40695/do%E1%B4%A1%C9%B4%C9%A2%E1%B4%8F%E1%B4%80%E1%B4%9B&quot;&gt;Downgoat&lt;/a&gt; - TeaScript&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-Nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;When you hear &amp;quot;TeaScript&amp;quot; you may think, &amp;quot;Not &lt;em&gt;another&lt;/em&gt; JavaScript golfing language&amp;quot;, but TeaScript was actually the first JavaScript golfing language. TeaScript was also made before the sudden skyrocket of new golfing languages.&lt;/p&gt;&#xA;&lt;p&gt;JavaScript, being one of the most popular language on the site, does have its fair share of long property names such as &lt;code&gt;document.getElementById&lt;/code&gt; or &lt;code&gt;String.fromCharCode&lt;/code&gt;. Seeing no one has made a JavaScript golfing language yet. I decided to make my own.&lt;/p&gt;&#xA;&lt;p&gt;TeaScript's goal was to be a golfing language but be completely familiar and easy to read to anyone who knows JavaScript. TeaScript started out with just reduced property names but grew quickly with features such as automatic property chaining. TeaScript is now a full-on golfing language &lt;em&gt;especially&lt;/em&gt; with the recently released TeaScript 3!&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-20T03:07:26.303" CommentCount="7" CommunityOwnedDate="2016-01-08T22:22:51.733" ContentLicense="CC BY-SA 3.0" />
  <row Id="8015" PostTypeId="1" AcceptedAnswerId="8018" CreationDate="2016-01-08T23:49:01.370" Score="4" ViewCount="48" Body="&lt;p&gt;I just &lt;a href=&quot;https://codegolf.stackexchange.com/review/low-quality-posts/26914&quot;&gt;reviewed this low-quality answer&lt;/a&gt; and agreed it should be deleted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/JaiAR.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/JaiAR.png&quot; alt=&quot;that&amp;#39;s enema the LANGUAGE, thank you.&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm kinda new to this whole &quot;reviewing&quot; thing but I understand the basics of what to do and what not to do, so I clicked &quot;Recommend Deletion.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sweet! More fancy buttons for clicking:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/w44MB.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/w44MB.png&quot; alt=&quot;no pr0n in the tabs This Time&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm aware PPCG isn't a &lt;em&gt;&quot;typical&quot;&lt;/em&gt; SE in its Q&amp;amp;A format, and so sometimes things are a little weird, but... which do I choose? It's really, none of the above. (I'm surprised there's no option for &quot;This answer attempts to answer the question but is unrecoverably bad&quot;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I left the option as &quot;no comment needed&quot;, but in edits and &lt;em&gt;the comment section&lt;/em&gt; and other places SE make it &lt;strong&gt;abundantly&lt;/strong&gt; clear that comments are encouranged and looked for when trying to quantify the validity of something, which makes me feel obliged to leave a comment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It would be good if there were a little free-response box for me to type a valid reason, but there isn't.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What should I do next time?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Note that my question of &quot;which option?&quot; is &lt;strong&gt;&lt;em&gt;not&lt;/em&gt;&lt;/strong&gt; specific to the review in question: for almost &lt;em&gt;no&lt;/em&gt; answer on PPCG would the given options be satisfactory.&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-01-09T01:06:49.667" Title="Which review comment-option do I pick?" Tags="|support|reviewing|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8018" PostTypeId="2" ParentId="8015" CreationDate="2016-01-09T01:06:49.667" Score="6" Body="&lt;p&gt;If a comment exists explaining what's wrong and based on that comment it's obvious why the post should be deleted, you should upvote that comment. If no such comment exists, you should consider adding one. You can then vote to delete with &quot;No comment needed&quot; selected.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-01-09T01:06:49.667" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8024" PostTypeId="2" ParentId="7804" CreationDate="2016-01-09T07:44:23.437" Score="2" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7484/45941&quot;&gt;Draughts KOTH&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Definitely will be a fun KOTH, but I don't have the time or energy to write up the controller, so I'm giving it up to whoever wants to take it over.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-09T07:44:23.437" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8027" PostTypeId="2" ParentId="2140" CreationDate="2016-01-09T17:03:58.727" Score="0" Body="&lt;h1&gt;Find my way&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;I wanted to propose a challenge that is code golf (shortest answer wins), but with more programming challenge than parsing and printing funky text.  Let's see if it sticks.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are given a maze map, such as this: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#################################################&#xA;##########                    ######  ##### 1 ###&#xA;####   ##   ######  ########  #####     ####  ###&#xA;##   ###   #######  ########   ######  ###    ###&#xA;## X  ##  ########  #####      ####   #####  ##  &#xA;#                      ##      ##    ##      ##  &#xA;###################   ####   #####   #   ##  ##  &#xA;###   #############  #####   ######  #  ##   ####&#xA;##   ###             ##      ##    ##   ##     ##&#xA;#   ##      ####     ##  #   #   #      ###    ##&#xA;#  ####              ##      #   #  #        ####&#xA;#   #####   ###    ####   #####  #  #############    &#xA;#  #####   #####  ####   ##  ##     #############&#xA;   ###             ##     #  #     ########      &#xA;   ##     ####    #####   ####     ########   ###&#xA;  ##     ###                ##        #####   ###&#xA;          #####################   #   #####      &#xA;#####       ##############  ##   ###    #########&#xA;##      #   ###     ######  ##    #   ###########&#xA;#########        #               ##########      &#xA;      ###   ###     ##   ##################      &#xA;      ###   ##########   ########################&#xA;#################################################&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and you need to help the player &lt;code&gt;1&lt;/code&gt; find the goal &lt;code&gt;X&lt;/code&gt;. You can assume the following rules apply to the input map:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;it is a &lt;code&gt;n x m&lt;/code&gt; ASCII rectangle (i.e. &lt;code&gt;n&lt;/code&gt; lines of &lt;code&gt;m&lt;/code&gt; characters);&lt;/li&gt;&#xA;&lt;li&gt;only the following characters are allowed: &lt;code&gt;#&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;X&lt;/code&gt;, &lt;code&gt;&lt;/code&gt; (whitespace) and newline;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;#&lt;/code&gt; represent walls (that can't be crossed), &lt;code&gt;&lt;/code&gt; represent empty space (that can be crossed); you can go anywhere in the &lt;code&gt;n x m&lt;/code&gt; rectangle but you can't leave it (it's not Pacman).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;If the maze has a solution&lt;/strong&gt;, you shall produce an output of the following form:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#################################################&#xA;##########DLLLLLLLLL          ######  ##### D ###&#xA;####   ## D ###### U########  #####     ####D ###&#xA;##   ### DL####### U########   ######  ###  D ###&#xA;## X  ## D######## U#####      ####   ##### D##  &#xA;#  ULLLLLL         UL  ##      ##    ##     D##  &#xA;################### U ####   #####   #   ## D##  &#xA;###   ############# U#####   ######  #  ##  D####&#xA;##   ###  RRRRRRRRRRU##      ##    ##   ##  D  ##&#xA;#   ##    U ####     ##  #   #   #DLLLL ### D  ##&#xA;#  ####   U          ##      #   #D # ULLLLLL####&#xA;#   ##### U ###    ####   #####  #D #############    &#xA;#  #####RRU#####  ####   ##  ##  DL #############&#xA;   ###  U          ##     #  #  DL ########      &#xA;   ##   U ####    #####   ####DLL  ########   ###&#xA;  ##RRRRU###                ##RRD     #####   ###&#xA;    ULLLLL##################### D #   #####      &#xA;#####    U  ##############  ##  D###    #########&#xA;##      #U  ### DLL ######  ##DLL #   ###########&#xA;#########ULLLLLLL#ULLLLLLLLLLLL  ##########      &#xA;      ###   ###     ##   ##################      &#xA;      ###   ##########   ########################&#xA;#################################################&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the letters &lt;code&gt;U&lt;/code&gt;, &lt;code&gt;R&lt;/code&gt;, &lt;code&gt;D&lt;/code&gt; and &lt;code&gt;L&lt;/code&gt; represent movements by 1 character to the, respectively, up, right, down and left;&lt;/li&gt;&#xA;&lt;li&gt;the letter chain represent a valid path from the original &lt;code&gt;1&lt;/code&gt; (which has been replaced by a direction character) and &lt;code&gt;X&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;If the maze has no solution&lt;/strong&gt;, you should return &lt;code&gt;void&lt;/code&gt;, &lt;code&gt;NULL&lt;/code&gt; or anything equivalent. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Final rules: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;this is code golf, so the shortest solution wins;&lt;/li&gt;&#xA;&lt;li&gt;typical code-golf rules for input and output apply.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="48048" LastActivityDate="2016-01-09T17:03:58.727" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="8029" PostTypeId="2" ParentId="2140" CreationDate="2016-01-09T21:45:06.523" Score="1" Body="&lt;h1&gt;&quot;Compress&quot; text into Zalgo&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Zalgo, the Nezperdian hivemind of chaos, is a type of text that &lt;a href=&quot;https://stackoverflow.com/a/20310289/1122232&quot;&gt;uses combining characters&lt;/a&gt; to make very tall and noisy text.  If you don't know what I'm talking about, maybe this will jog your memory:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;zalgo&amp;gt;&#xA;&#xA;&#xA;&#xA;&#xA;H̡̢̢̡̡̧̢̡͎̟͚̮͓͇̦̮̙̗̜̱̱͔̲̹̣̱̠̀̀͐̑̾̓̃́̃̍̀͆̇͆̽̔̒̚̕͘̚͜͝͠͠ͅE̢̧͓̺͉̟͙͇̳̰͉͖̺̻͕̰̱̝̳̙̰̟̠̯̘̰̲̎̑͋͂͑́͛̎͋̇̍̾̊̈́̂̽̿͆͛͑̽̒̊́͠͝͠͝͝ͅ ̨̢̟̳̥̖̺̼͎̩̘̰̣̼͇̰̫̞̜̲̰͔̗̠͔̩̻̳͇̾͌̆̑̍̄̊͗̓̃̆̊̄̽̐̂͛̏͑̒̓̆͝͝͝Ç̛̬̩͙̱̥̦̪̮̖͚͚͔̼̱̺̳̳̬̭͍̣͍̙̹̜̫̟̳͌̓͗͊̐̈̄́̏̀͂̎̃̈́̈́̎͋̀̒̊̀̈́͒̽͘̕͝Ȏ̡̡̨̡̝̬̠͚̠̯͖̹̟͓̮̻̲͙̖̪̯͇̍̅̂̌̌̒͗̈́̉͆̇̑͒̉̂̾̃̌̽͛͘͝͝ͅM̡̢̢̘͉̤͍̫̺̻͕̱̤̤̞̟̞̹͉͓̥̳͖̹̤̆̋̓͂̂͑̃̌͛͂̋̂̓̏́̀̾̋̈́̅̐̅̎̇̐̽͜͝Ȩ̨̛̭̥̹̳̫͎͖͈̳̠͍͙͉̻̼͍̞̜̺̝̻̝̗̳̏̈̓͋̐́̋͆͋̓̿͐͆̾̾̃͌͌̾̊́̚͘͘͜S̡̢̡̡̛̯̪̬̹̲̙̮̲̲̤͖͖̞̲̞̼̪͓͇̤̼͇͆͋̊̈̑̆̿̐̎͑̾̅̀̒̓̎̐̍̽̈́̋̽̓̔̍͜͝&#xA;&#xA;&#xA;&#xA;&#xA;&#xA;&amp;lt;/zalgo&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As a new twist on the age-old Zalgo generation problem, your goal is to take a string and &quot;compress&quot; it into a single Zalgo character.  You will write two programs, one which takes in a string of printable ASCII and outputs a single Zalgo character, and a second which takes in a single Zalgo character and outputs the original ASCII string.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2016-01-09T21:45:06.523" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8030" PostTypeId="1" AcceptedAnswerId="8540" CreationDate="2016-01-10T00:04:29.857" Score="59" ViewCount="1281" Body="&lt;p&gt;The last time we heard from a Stack Exchange community manager was in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1192/20469&quot;&gt;March of 2014&lt;/a&gt;, when &lt;a href=&quot;https://meta.stackexchange.com/users/146126&quot;&gt;Grace Note&lt;/a&gt; came to talk to us about the progress we've made as a site. That was back when &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; was a thing, and the community's response to the news wasn't particularly positive given how code trolling had affected the site's overall quality.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now here we are, almost 2 years after Grace Note gave us that update. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; is off topic, dead, and buried. Our site stats, regardless of how much they &lt;em&gt;actually&lt;/em&gt; matter, are excellent (as FlagAsSpam so nicely laid out for us &lt;a href=&quot;https://meta.stackexchange.com/a/271974/287795&quot;&gt;here&lt;/a&gt;), save for the average number of questions we get per day. Our rate falls short of the expected 10, but sites have graduated with less.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Whether or not we expect or even want to graduate, it would be nice to have some feedback from the folks at Stack Exchange on our progress and their take on us as part of the greater SE ecosystem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So hey, SE, how are we doing? Notice us, senpai.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Update:&lt;/strong&gt; Here we are, over a month later, and we've been averaging over 10 questions per day for a while now! As of this writing, we're at &lt;a href=&quot;http://area51.stackexchange.com/proposals/4570/code-golf-programming-puzzles&quot;&gt;10.8 Q/day&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2016-02-23T17:41:09.463" Title="Hey Stack Exchange, how are we doing?" Tags="|support|beta-status|site-health|" AnswerCount="1" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="8031" PostTypeId="2" ParentId="7897" CreationDate="2016-01-10T01:41:37.577" Score="-28" Body="&lt;h1&gt;Another favicon&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Here's another favicon that I made.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;http://i.cubeupload.com/7UhpdY.jpg&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's like a contest standings thing, with first, second and third (square brackets, semicolon, and parentheses).&#xA;&lt;img src=&quot;http://i.cubeupload.com/oS3bR7.jpg&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user46167" LastActivityDate="2016-01-10T01:41:37.577" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8034" PostTypeId="1" CreationDate="2016-01-10T04:54:36.210" Score="13" ViewCount="528" Body="&lt;p&gt;This is a question about what counts as too far towards an art contest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I asked the question &quot;render the Mona Lisa in 1000 bytes&quot; on the main site, would it be on topic? Assume the question contains precisely specified guidelines about what the program is and isn't allowed to do, but that the winning criterion is &quot;popularity contest&quot;, with the expectation that people will vote for the answer whose output most closely resembles the Mona Lisa. The only restriction on entries is that the rendering part of the code cannot be more than 1000 bytes in length.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that I'm not really asking whether this would be a good challenge, though I might post it if it's on topic. This is more about understanding what the community considers acceptable winning criteria for questions. I'm also not asking whether it &lt;em&gt;should&lt;/em&gt; be on topic, but rather whether it de facto &lt;em&gt;is&lt;/em&gt; on topic according to current rules and conventions. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I ask because many existing on topic, well recieved questions have &quot;looking like a given input image&quot; as the goal, with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/33172/american-gothic-in-the-palette-of-mona-lisa-rearrange-the-pixels&quot;&gt;American Gothic in the palette of Mona Lisa: Rearrange the pixels&lt;/a&gt; perhaps being the cream of the crop. I really like these questions, and I want to know how far that kind of idea can be played around with without straying into &quot;art contest&quot; territory. Answers backed up with reasoning and/or links to previous meta discussions would be appreciated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt; I've put &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8052/21034&quot;&gt;a draft of the proposed question&lt;/a&gt; in the sandbox.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit 2:&lt;/strong&gt; The question has been &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69232/paint-the-mona-lisa-in-1kb-of-code&quot;&gt;posted&lt;/a&gt; on the main site, where it was closed, reopened and then closed again. I have now edited it based on feedback given in various places. (Here, in the comments on the question, in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8084/guidelines-for-posting-and-closing-popularity-contests&quot;&gt;another meta post about popularity contests&lt;/a&gt; that was sparked by my question, and in &lt;a href=&quot;http://chat.stackexchange.com/rooms/34229/discussion-on-answer-by-dennis-guidelines-for-posting-and-closing-popularity-con&quot;&gt;a chat session with moderator Dennis&lt;/a&gt;.)&lt;/p&gt;&#xA;" OwnerUserId="21034" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2016-03-04T21:11:54.760" Title="Would &quot;render the Mona Lisa in 1000 bytes&quot; be on topic here?" Tags="|discussion|asking-questions|" AnswerCount="3" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8035" PostTypeId="2" ParentId="8034" CreationDate="2016-01-10T05:14:14.393" Score="-5" Body="&lt;h1&gt;No.&lt;/h1&gt;&#xA;&lt;p&gt;A spec that simply said &amp;quot;recreate the Mona Lisa in 1000 bytes&amp;quot; would be far too broad and vague, even for a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;. Without an objective criteria for what makes an image resemble the Mona Lisa, golfers have no real goal to shoot for (aside from just simply displaying a photograph of it) and voters have no real guiding criteria for what answers to vote for.&lt;/p&gt;&#xA;&lt;p&gt;Just because it is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; doesn't mean there shouldn't be any objective criteria for what makes a good answer.&lt;/p&gt;&#xA;&lt;p&gt;EDIT: Per Calvin's suggestion, I think the best idea for this is to turn it into a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; (perhaps some sort of Levenshtein distance-esque scoring).&lt;/p&gt;&#xA;" OwnerUserId="45151" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-12T16:56:38.147" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="8036" PostTypeId="2" ParentId="8034" CreationDate="2016-01-10T05:30:48.397" Score="18" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;But I think &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; might not be ideal.&lt;/p&gt;&#xA;&lt;p&gt;How I would do it is choose some specific image of the Mona Lisa that everyone has to aim for, then give each submission a score based on how different it is from this image.&lt;/p&gt;&#xA;&lt;p&gt;This score could be the number of pixels that are the exact correct color (higher score wins). Or if you want more granularity, have the score be the total of the absolute differences between the RGB channels across all pixels in the goal and submission images (lower score wins).&lt;/p&gt;&#xA;&lt;p&gt;This way it would be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; instead of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, and you wouldn't run into any &amp;quot;art contest&amp;quot; issues.&lt;/p&gt;&#xA;&lt;p&gt;I personally would not be opposed to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; just as you suggest, since a more &amp;quot;human&amp;quot; scoring method, rather than just comparing pixels, might make the results more interesting. But some people on this site probably would call it an art contest, which is why I'm saying the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; is safer.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-10T05:30:48.397" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8037" PostTypeId="1" CreationDate="2016-01-10T05:35:22.403" Score="3" ViewCount="173" Body="&lt;h2&gt;Time to add to the list of Minecraft Meta Questions!&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;So, my question is fairly basic. When we run programs in other langs through the command line, we don't count anything but their flags. For example, take Java.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;java B.java [arguments]&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We wouldn't count this bit to run the program. We would count the flags though (because I don't use a programming language that uses flags, really, I'm going to use an example with rm).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;rm -rf [some directory]&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And we would count the &lt;code&gt;-rf&lt;/code&gt; bit as 4 bytes, one for the space, three for the chars.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So why do we count Minecraft starting things, such as a button? It's really just hitting the &lt;code&gt;enter&lt;/code&gt; key and starting the program, when you think about it. And on that line of thinking, what would you define as flags? Would a button be a standard way to start it, or a lever? How would we count that?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please discuss. c:&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="20469" LastEditDate="2016-01-10T05:36:13.797" LastActivityDate="2016-03-15T23:15:34.717" Title="Should we consider the starting mechanism for Minecraft programs?" Tags="|discussion|policy|scoring|" AnswerCount="2" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8038" PostTypeId="2" ParentId="6918" CreationDate="2016-01-10T06:10:22.007" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/zachgates7/Milky-Way&quot; rel=&quot;nofollow noreferrer&quot;&gt;Milky Way&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Milky Way was created by me, Zach Gates, in November of 2015. I was bored and thought that writing a language would be fun. It's an esoteric golfing language. It's written in Python 3 and is run as an executable.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Facts&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Nearly all the opcodes are destructive, meaning they remove the top-of-stack, perform their function, and push the new item back onto the stack.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each line of a program has it's own stack. Each stack is initiated with two elements already on it; an empty string and zero.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&quot;&quot;, 0]&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If no output has occurred by the end of the program, the bottommost stack element will be output. For example, if the resulting stack is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&quot;abc&quot;, &quot;def&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;then &lt;code&gt;&quot;abc&quot;&lt;/code&gt; will be output; surrounding quotations included. This is the only setback to running a program with no output.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Input is taken via the command line with the &lt;code&gt;-i&lt;/code&gt; option.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;The &lt;code&gt;Hello World!&lt;/code&gt; program:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is the standard method:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;Hello World!&quot;!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Everything within double quotes is a string in Milky Way. The exclamation mark outputs the top-of-stack. Alternatively, the inverted exclamation mark (decimal 161), will output the top-of-stack &lt;em&gt;and&lt;/em&gt; terminate the program (any opcodes following will not be executed, nor will any subsequent lines). With one extra byte, but an equal number of characters; here it is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;Hello World!&quot;¡&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Further, the greater than sign (decimal 62) will shift the entire stack rightward. The top-of-stack will become the bottom-of-stack, thus being output upon termination. This output, however, would be invalid if the output is not allowed to include surrounding quotations (see fact 3, above). Here it is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;Hello, World!&quot;&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Truth machine&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is the shortest method I've come up with.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;'?{0b_!_&amp;amp;{!}}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The single quote opcode reads the input from the command line. This piece: &lt;code&gt;?{...}&lt;/code&gt;, is an if statement. Each piece is separated from the next by an underscore.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Code from the opening bracket to the first underscore, &lt;code&gt;0b&lt;/code&gt; in this case, is the conditional. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Code from the first underscore to the second underscore will run if the conditional evaluates as true.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Code from the second underscore to the closing bracket will run if the conditional evaluates as false.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In the case of this program, &lt;code&gt;0b&lt;/code&gt; checks is the top-of-stack, the input, is equal to &lt;code&gt;0&lt;/code&gt;. If it is, it outputs the top-of-stack a single time. If not, the top-of-stack is output for eternity, because &lt;code&gt;&amp;amp;{...}&lt;/code&gt; constitutes a Pythonic &lt;code&gt;while True:&lt;/code&gt; loop.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To read more about the meanings of different bracket sets, take a look at the &lt;a href=&quot;https://github.com/zachgates7/Milky-Way/blob/master/README.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github repository's readme&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Catalog of answers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here is a catalog of cool and significant answers that have been written in Milky Way. Each element on this list is the title of a question, while each link is the direct share-link to the answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Feel free to add to this list if you've written an answer you think is cool.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/65542/39462&quot;&gt;&quot;Hello World!&quot;&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/65544/39462&quot;&gt;Implement a Truth-Machine&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/65753/39462&quot;&gt;Find the absolute value of a number without built-in functions&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/66166/39462&quot;&gt;Catalan Numbers&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/65800/39462&quot;&gt;Cover up zeroes in a list&lt;/a&gt; (LOCF imputation)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/68595/39462&quot;&gt;Conjugate in the Spanish imperfect&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/65594/39462&quot;&gt;&quot;99 Bottles of Beer&quot;&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/65677/39462&quot;&gt;The versatile integer printer&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/66982/39462&quot;&gt;Mixed Number to an Improper Fraction&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Links&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/zachgates7/Milky-Way&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github Repository&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="39462" LastEditorUserId="39462" LastEditDate="2017-09-05T05:27:33.430" LastActivityDate="2017-09-05T05:27:33.430" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8040" PostTypeId="2" ParentId="2140" CreationDate="2016-01-10T14:45:27.023" Score="0" Body="&lt;h1&gt;Iterating through Doubles&lt;/h1&gt;&#xA;&lt;p&gt;This challenge is relatively simple:  &lt;strong&gt;You are passed two floating point numbers, &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt;; you must print every floating point in between &lt;em&gt;in order&lt;/em&gt;&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I don't care if your output includes &lt;code&gt;a&lt;/code&gt; or &lt;code&gt;b&lt;/code&gt;.  You can choose to include/exclude them if you wish.  For my examples, I will include &lt;code&gt;a&lt;/code&gt;, but exclude &lt;code&gt;b&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You can assume that &lt;code&gt;a &amp;lt;= b&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;You should use &lt;a href=&quot;https://en.wikipedia.org/wiki/IEEE_floating_point&quot; rel=&quot;nofollow noreferrer&quot;&gt;IEEE 754&lt;/a&gt; floating point numbers.  As to the format of the numbers, I do not care, though I will be using binary32 in my examples.&lt;/li&gt;&#xA;&lt;li&gt;Your program must not print any NaNs, infinities, or print out the same number twice.  &lt;code&gt;-0&lt;/code&gt; is the same as &lt;code&gt;0&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If&lt;code&gt;a&lt;/code&gt; or &lt;code&gt;b&lt;/code&gt; cannot be perfectly represented in floating point, you must round-to-nearest them (standard for most languages).  You can assume that &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; won't round to infinity.&lt;/li&gt;&#xA;&lt;li&gt;Your program must have a runtime of &lt;code&gt;O(N)&lt;/code&gt;, where &lt;code&gt;N&lt;/code&gt; is the total number of floating point numbers in between &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Your program must not use more than &lt;code&gt;O(1)&lt;/code&gt; storage.  The only exception to this is for storing your output before printing it all.&lt;/li&gt;&#xA;&lt;li&gt;Builtins that are able to generate floats in order are not allowed (such as Julia's &lt;code&gt;nextfloat()&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For the following examples, I have used &lt;a href=&quot;http://www.h-schmidt.net/FloatConverter/IEEE754.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;this webpage&lt;/a&gt; to generate the numbers, and thus my examples may have human errors.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;-5.6E-45, 5.6E-45&#xA;-5.6E-45, -4.2E-45, -2.8E-45, -1.4E-45, 0, 1.4E-45, 2.8E-45, 4.2E-45&#xA;&#xA;-0, 0&#xA;No output, though printing either 0 or -0 would be allowed (but not both)&#xA;&#xA;299.9998, 300.0002&#xA;299.9998, 299.99982, 299.99985, 299.99988, 299.9999, 299.99994, 299.99997, 300, 300.00003, 300.00006, 300.0001, 300.00012, 300.00015, 300.00018, 300.0002&#xA;&#xA;1.9999998, 2.000001&#xA;1.9999998, 1.9999999, 2, 2.0000002, 2.0000005, 2.0000007, 2.000001&#xA;&#xA;-3.4028235E38, -3.402822E38&#xA;-3.4028235E38, -3.4028233E38, -3.402823E38, -3.402829E38, -3.4028227E38, -3.4028225E38, -3.4028222E38&#xA;&#xA;3.4028229E38, 3.4028235E38&#xA;3.4028229E38, 3.402823E38, 3.4028233E38, 3.4028235E38&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-10T15:25:56.060" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8043" PostTypeId="1" CreationDate="2016-01-10T20:06:07.493" Score="14" ViewCount="147" Body="&lt;p&gt;Some questions have a number of bonuses stated as percentages. For code golf (where the majority of these bonuses are seen) these will be percentage reductions of the score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If an answer achieves several of these bonuses, how should the resulting score be calculated?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are two main ways I can imagine:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Apply each percentage in turn&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;10% reduction followed by 20% reduction results in 90% of 80% = 72% of the original score.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Sum the percentages before applying them.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;10% reduction and a 20% reduction results in a 30% reduction overall - that is 70% of the original score.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;To me, (1) makes more sense, but it also happens to result in a higher score, so an answerer has an incentive to use (2).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does it make sense to standardise here and settle on a default way, or should it be up to the question writer to specify each time?&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="45151" LastEditDate="2016-01-10T20:14:31.100" LastActivityDate="2016-01-10T23:52:46.000" Title="Should we standardise how percentage bonuses combine?" Tags="|discussion|policy|scoring|" AnswerCount="3" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8044" PostTypeId="2" ParentId="8043" CreationDate="2016-01-10T20:31:20.337" Score="9" Body="&lt;h2&gt;Multiplicative bonuses should be the default for percentage bonuses&lt;/h2&gt;&#xA;&lt;p&gt;This is in line with how multiple percentage bonuses are typically applied, both here and in other competitions. Getting two 50% bonuses shouldn't leave you with an answer score of 0; you should get a total of a 75% bonus.&lt;/p&gt;&#xA;&lt;h2&gt;Flat bonuses are additive&lt;/h2&gt;&#xA;&lt;p&gt;If you get 10 bytes off for one bonus and 20 bytes off for another, you get 30 bytes off total. Simple as that.&lt;/p&gt;&#xA;&lt;h2&gt;Percentage bonuses first, then flat bonuses&lt;/h2&gt;&#xA;&lt;p&gt;Order of operations: multiplication before addition.&lt;/p&gt;&#xA;&lt;p&gt;That said, challenge authors are welcome to use whatever method of applying bonuses they desire. These are just defaults.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-10T21:06:35.333" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8045" PostTypeId="2" ParentId="8043" CreationDate="2016-01-10T20:49:24.767" Score="10" Body="&lt;p&gt;&lt;strong&gt;This should be left up to the question writer&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each question has its own specific situation, so there is no formula to fit all cases. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The other issue is that many posters may not be aware of this meta post. I'm not against having defaults, but it can also be odd for a new user to suddenly hear that rule X from meta post Y applies to their challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I know occasionally a poster makes a silly mistake with bonuses that leads to a negative score. Often someone points this out to them, but if it goes unnoticed and someone gets a negative score, it doesn't really matter (unless everyone ends up with the same score.)&lt;/p&gt;&#xA;" OwnerUserId="15599" LastActivityDate="2016-01-10T20:49:24.767" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8047" PostTypeId="1" CreationDate="2016-01-10T21:31:09.190" Score="102" ViewCount="27035" Body="&lt;p&gt;If there is something that you find annoying / counterproductive / unfair / detrimental / no longer funny in &lt;strong&gt;challenges&lt;/strong&gt; (question posts), describe it in an answer here, and propose a recommended response. Voting will indicate whether that response has the backing of the community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, you might suggest one of the following:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Comment linking here&lt;/li&gt;&#xA;&lt;li&gt;Edit question&lt;/li&gt;&#xA;&lt;li&gt;Close question&lt;/li&gt;&#xA;&lt;li&gt;Delete question&lt;/li&gt;&#xA;&lt;li&gt;Other (please specify)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Consider quoting from (rather than linking to) example challenges, as the fact that you are posting here makes it likely that the challenge may be edited making the link confusing for future readers.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;For aspects of &lt;strong&gt;&lt;em&gt;solutions&lt;/em&gt;&lt;/strong&gt; (answer posts) to be avoided, see instead &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Loopholes that are forbidden by default&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2023-05-07T15:05:45.953" Title="Things to avoid when writing challenges" Tags="|discussion|faq|policy|challenge-quality|defaults|" AnswerCount="49" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8048" PostTypeId="2" ParentId="8047" CreationDate="2016-01-10T21:44:29.223" Score="-13" Body="&lt;h2&gt;Entirely nonsensical rationales for short code length.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This was fun (and was documented as a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5856/20469&quot;&gt;local meme&lt;/a&gt;) when the rationales vaguely made sense, for example, &quot;We want the program that does this to be as small as possible so it can fit into the margins&quot; (from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/57363/the-margin-is-too-narrow&quot;&gt;The Margin is too Narrow&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, this has gotten out of hand. Recently more challenges have included rationales that make absolutely no sense, in or out of context. For example, &quot;Because you can only stack about 5 goats before they start to fall, your code will need to be as short as possible&quot; (from &lt;a href=&quot;https://codegolf.stackexchange.com/q/69031/20469&quot;&gt;Tokenize a Stack-Based language&lt;/a&gt;, since edited out).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In an effort to keep challenge specs concise and readable, I propose that we do the following when we see something clearly off-topic for the challenge in the spec:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Edit the question&lt;/li&gt;&#xA;&lt;li&gt;Link here in the edit description (it will appear in the revision history)&lt;/li&gt;&#xA;&lt;li&gt;Send attack drones&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-01-10T21:44:29.223" CommentCount="16" ContentLicense="CC BY-SA 3.0" />
  <row Id="8050" PostTypeId="2" ParentId="2140" CreationDate="2016-01-10T22:55:34.157" Score="0" Body="&lt;h1&gt;Coaxial and Copolar?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/trigonometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;trigonometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;trigonometry&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;SANDBOX NOTE: Diagrams soon&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Copolar&lt;/em&gt;: Two triangles &lt;code&gt;ABC&lt;/code&gt; and &lt;code&gt;A'B'C'&lt;/code&gt; (not necessarily in the same plane) are said to be copolar if and only if the lines &lt;code&gt;AA'&lt;/code&gt;, &lt;code&gt;BB'&lt;/code&gt;, and &lt;code&gt;CC'&lt;/code&gt; are concurrent at one point &lt;code&gt;V&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Coaxial&lt;/em&gt;: Supoose two triangles &lt;code&gt;ABC&lt;/code&gt; and &lt;code&gt;A'B'C'&lt;/code&gt; are defined such that &lt;code&gt;AB&lt;/code&gt; and &lt;code&gt;A'B'&lt;/code&gt; intersect at &lt;code&gt;X&lt;/code&gt;, &lt;code&gt;AC&lt;/code&gt; and &lt;code&gt;A'C'&lt;/code&gt; intersect at &lt;code&gt;Y&lt;/code&gt;, and &lt;code&gt;BC&lt;/code&gt; and &lt;code&gt;B'C'&lt;/code&gt; intersect at &lt;code&gt;Z&lt;/code&gt;. Then, the two triangles &lt;code&gt;ABC&lt;/code&gt; and &lt;code&gt;A'B'C'&lt;/code&gt; are said to be Coaxial if and only if &lt;code&gt;X&lt;/code&gt;, &lt;code&gt;Y&lt;/code&gt;, and &lt;code&gt;Z&lt;/code&gt; are collinear.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://mathworld.wolfram.com/DesarguesTheorem.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;Desargue's Theorem&lt;/em&gt;&lt;/a&gt;: Copolar triangles are coaxial, and conversely.&lt;/p&gt;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge is to write &lt;strong&gt;two entire programs&lt;/strong&gt; (but not necessarily in the same language, if you so desire) which detect whether or not two triangles are Coaxial/Copolar. One program must detect the existence of &lt;code&gt;V&lt;/code&gt;, and the other must check the collinearity of &lt;code&gt;X&lt;/code&gt;, &lt;code&gt;Y&lt;/code&gt;, and &lt;code&gt;Z&lt;/code&gt; (As defined above). You should provide some explanation or proof that your two programs perform these two different checks. Your score in this challenge is the &lt;a href=&quot;https://en.wikipedia.org/wiki/Levenshtein_distance&quot; rel=&quot;nofollow noreferrer&quot;&gt;Levenshtein distance&lt;/a&gt; between the two programs, with lowest score being dubbed winner.&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;You will receive &lt;code&gt;6&lt;/code&gt; vectors, all of which containing an &lt;code&gt;x&lt;/code&gt;, &lt;code&gt;y&lt;/code&gt;, and &lt;code&gt;z&lt;/code&gt; floating-point Cartesian coordinate, to represent the vertices of &lt;code&gt;ABC&lt;/code&gt; and &lt;code&gt;A'B'C'&lt;/code&gt;. This information may be received by your program in any convenient format, including command line arguments, nested lists, etc. &lt;strong&gt;The two programs you submit should take input in the same manner&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;Your program should print a truthy value if &lt;code&gt;ABC&lt;/code&gt; and &lt;code&gt;A'B'C'&lt;/code&gt; are coaxial/copolar, and a falsey value otherwise. As this will likely require floating-point calculations, we establish some leniency:&lt;/p&gt;&#xA;&lt;p&gt;Choose a constant value &lt;code&gt;0 &amp;lt; ERR &amp;lt; 0.01&lt;/code&gt;, for use in both programs.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If the pairwise intersections of &lt;code&gt;AA'&lt;/code&gt;, &lt;code&gt;BB'&lt;/code&gt;, and &lt;code&gt;CC'&lt;/code&gt; intersect within &lt;code&gt;ERR&lt;/code&gt; units of one another, the given triangles should be considered copolar.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the point &lt;code&gt;Z&lt;/code&gt; lies closer than &lt;code&gt;ERR&lt;/code&gt; distance from the line &lt;code&gt;XY&lt;/code&gt;, the given triangles should be considered coaxial.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Standard techniques for checking floating point calculation equality should be sufficiently accurate for this challenge.&lt;/p&gt;&#xA;&lt;p&gt;Since copolar triangles are also coaxial, the programs should output the same value in all but extreme cases.&lt;/p&gt;&#xA;&lt;p&gt;It should be assumed that any cross section of the cartesian space provided is an &lt;a href=&quot;https://en.wikipedia.org/wiki/Projective_plane#The_extended_Euclidean_plane&quot; rel=&quot;nofollow noreferrer&quot;&gt;Extended Euclidean Plane&lt;/a&gt;. Note that it is possible that the vertex &lt;code&gt;V&lt;/code&gt; or any of &lt;code&gt;X&lt;/code&gt;, &lt;code&gt;Y&lt;/code&gt;, and &lt;code&gt;Z&lt;/code&gt; may be an &lt;a href=&quot;https://en.wikipedia.org/wiki/Point_at_infinity&quot; rel=&quot;nofollow noreferrer&quot;&gt;ideal point&lt;/a&gt;, and this is a case that should be prepared for.&lt;/p&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;SANDBOX NOTE: Coming soon...&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="31054" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-10T23:11:11.510" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8051" PostTypeId="2" ParentId="8043" CreationDate="2016-01-10T23:52:46.000" Score="-1" Body="&lt;h2&gt;The default for percentages should be multiplicative&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Apply each percentage in turn&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;10% reduction followed by 20% reduction results in 90% of 80% = 72% of the original score.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;I have no opinion on the application of flat bonuses&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This answer has been added because I cannot upvote the answer that also expresses an opinion on flat bonuses without implicitly voting for that too.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2016-01-10T23:52:46.000" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8053" PostTypeId="2" ParentId="2140" CreationDate="2016-01-11T03:18:55.893" Score="0" Body="&lt;p&gt;Cookies are being served! Sibling rivalry ensues! Each of the twins wants the maximum quantity of cookie. The problem is that the cookies are of somewhat different sizes, not surprising since they are home baked. So you weigh each of the cookies and devise a program to help you allocate them to each twin such that the difference in total weight of the cookies each twin gets is minimized. Coding up the program is your task today!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each case is described on a single line that begins with the number of cookies (no more than 100) followed by the weight of each (in integer grams, no more than 1000 grams).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For each case, display the minimum total weight difference.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sample Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;5 6 8 5 2 6&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2 25 62&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sample Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;1&lt;/p&gt;&#xA;&#xA;&lt;p&gt;37&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I asked this earlier and it was put on hold. Not sure what needs to be changed.&lt;/p&gt;&#xA;" OwnerUserId="48977" LastEditorUserId="20283" LastEditDate="2016-01-11T03:45:29.680" LastActivityDate="2016-01-11T03:45:29.680" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8056" PostTypeId="2" ParentId="2140" CreationDate="2016-01-11T12:29:49.103" Score="0" Body="&lt;h1&gt;Count the ones!&lt;sub&gt;&lt;sup&gt;&lt;sub&gt;&lt;sup&gt;(better title needed)&lt;/sup&gt;&lt;/sub&gt;&lt;/sup&gt;&lt;/sub&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;em&gt;[&lt;strong&gt;Sandbox-note:&lt;/strong&gt; Is this really still code-golf?]&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/counting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;counting&amp;#39;&quot; rel=&quot;tag&quot;&gt;counting&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;em&gt;[&lt;strong&gt;Sandbox note:&lt;/strong&gt; Need to find descriptive tags]&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Void Corp needs you!&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Thanks to extreme advancements in a technology called &lt;em&gt;null-space&lt;/em&gt; we are able to compress any number of 0-bits into just one memory block. The problem is that storing 1-bits is extremely expensive now. To evaluate which data we should keep we need a program that count all 1-bits in a string. Sadly our programmer is currently in forced vacation after a caffeine-incident, so it is up to you now to help us out.&lt;/p&gt;&#xA;&lt;p&gt;Your code should contain as few 1-bits as possible when stored in &lt;em&gt;null-space&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;We have heard of this strange &lt;em&gt;Unary&lt;/em&gt;. As our programmer is the only one able to understand it, we are currently not able to implement it.&lt;/p&gt;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&lt;p&gt;Write a program that counts all 1-bits in a given string.&lt;/p&gt;&#xA;&lt;p&gt;You may provide a function or fully functional program. Input will be provided via STDIN or argument and should be printed to STDOUT or returned.&lt;/p&gt;&#xA;&lt;p&gt;Your answer must be in an existing language, especially the interpreter must already exist. No retro-active coding of a language that consists entirely of &lt;strong&gt;NUL&lt;/strong&gt; (unless I missed it). &lt;em&gt;[&lt;strong&gt;Sandbox note:&lt;/strong&gt; Don't tell me there is such a thing.]&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;Count the 1-bits in your code. Fewest amount wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;[&lt;strong&gt;Sandbox note:&lt;/strong&gt; Should add script to paste code into for evaluation]&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&lt;p&gt;What do you think of the task? It seems pretty basic to me, the twist is the Scoring.&lt;/p&gt;&#xA;&lt;p&gt;What do you think of the scoring? I want to encourage usage of obscure/lengthy commands which are normally not used in CodeGolf. Your opinion?&lt;/p&gt;&#xA;&lt;p&gt;Does someone happen to have a script for evaluation lying around?&#xA;Do you have anything to add?&lt;/p&gt;&#xA;&lt;p&gt;Is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary&amp;#39;&quot; rel=&quot;tag&quot;&gt;binary&lt;/a&gt; appropriate for this question?&lt;/p&gt;&#xA;" OwnerUserId="30013" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-12T12:30:28.677" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8058" PostTypeId="2" ParentId="8047" CreationDate="2016-01-11T16:04:19.273" Score="71" Body="&lt;h2&gt;Explicitly disallowing or disadvantaging arbitrary (classes of) languages&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This has become much rarer recently, but the occasional challenge by a new user still includes it, so here as an answer to point them to.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Disallowing arbitrary languages (or classes of languages, primarily things like &quot;no golfing languages allowed&quot;) is not in the spirit of this community, as has been discussed many times on meta. If you don't like golfing languages beating others, a) don't pose a code golf challenge or b) look at the challenge as a separate competition in each language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This answer also encompasses penalties that only apply to certain languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Suggested course of action: (for voters)&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Downvote to discourage this behaviour and show that it is not welcome in this community.&lt;/li&gt;&#xA;&lt;li&gt;Leave a friendly comment that this is not how we roll and link them here.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Don't&lt;/em&gt; edit it out without the author's permission - I don't think we have a consensus that such restrictions are disallowed or off-topic. They're just a bad idea.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;A milder form of this is challenges where the task depends on the language name (e.g. &quot;print the language name&quot;). Those give a byte-count penalty to languages with long names. If this is necessary for the challenge to make sense/be fun, a better idea might be to subtract the language's name from the byte count and require that it appears verbatim in the source code (without the latter requirement, you'd be giving a penalty to languages with &lt;em&gt;short&lt;/em&gt; names instead).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This answer does &lt;em&gt;not&lt;/em&gt; encompass challenges which are impossible in some (or many) languages due to technical limitations (audio output, file system manipulation etc.). That said, challenges should strive to be as inclusive as possible without damaging the core of the challenge (do submissions really have to play the audio directly via the speakers, or could they also write an audio file to STDOUT?).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When the OP needs to run all submissions on their own machine (e.g. for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; or certain &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;s), it's also fine to require that all languages have a freely available compiler or interpreter. I wouldn't call that &quot;arbitrary&quot; restriction. (Whereas, I would call it arbitrary if someone imposed the same restriction on a standard code golf where the OP isn't planning to test every answer on their own machine anyway.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="32686" LastEditDate="2016-05-29T18:56:42.753" LastActivityDate="2016-05-29T18:56:42.753" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="8060" PostTypeId="1" CreationDate="2016-01-11T17:06:34.123" Score="-3" ViewCount="175" Body="&lt;p&gt;Many questions nowadays include a ridiculous rationale as to why the code needs to be as short as possible.  The frequency of these rationales apparently is starting to annoy some people (although, I am personally unbothered).  After a discussion in chat, and on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8047/20198&quot;&gt;this question&lt;/a&gt;, I decided that a targeted meta post was needed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, &lt;strong&gt;should we do anything about short code rationales, and if so, what?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Edit: this is not a duplicate of the linked question, as it asking for a specific ruling on &quot;what actions should we take&quot;, where the other question is asking for things that people don't like in questions.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2016-01-11T17:31:45.560" Title="Irrational Short Code Rationales" Tags="|discussion|" AnswerCount="2" CommentCount="3" ClosedDate="2016-01-11T19:35:07.663" ContentLicense="CC BY-SA 3.0" />
  <row Id="8063" PostTypeId="2" ParentId="8060" CreationDate="2016-01-11T17:19:59.737" Score="3" Body="&lt;h1&gt;Do nothing, but try to stop&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Obviously, people are annoyed. It was funny when it started, but jokes have their breaking points, and this joke has seemed to have gotten old. Personally, I don't mind, but if there are people who do mind, why provoke them? It's a line in the spec that isn't the best part or the relevant part of the post. Unless the line is &lt;em&gt;so ridiculously funny that it makes you slap your knees&lt;/em&gt;, maybe you shouldn't include it.&lt;/p&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2016-01-11T17:19:59.737" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8064" PostTypeId="2" ParentId="8060" CreationDate="2016-01-11T17:31:45.560" Score="4" Body="&lt;h2&gt;Do nothing, period.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The flavor text has no bearing on whether a challenge is good or bad. Downvoting because of it is wasteful. If you are annoyed by flavor text, avoid reading it. If you choose to read it and are annoyed by it, think long and hard before downvoting on that basis.&lt;/p&gt;&#xA;" OwnerUserId="47050" LastActivityDate="2016-01-11T17:31:45.560" CommentCount="5" CommunityOwnedDate="2016-01-11T17:37:03.180" ContentLicense="CC BY-SA 3.0" />
  <row Id="8065" PostTypeId="2" ParentId="8047" CreationDate="2016-01-11T19:06:43.513" Score="44" Body="&lt;h1&gt;Arbitrarily overriding the defaults&lt;/h1&gt;&#xA;&lt;p&gt;The default &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2419/20260&quot;&gt;code formats&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/20260&quot;&gt;input/output methods&lt;/a&gt;, and other defaults are a product of community thought and discussion. Don't change them just because you feel like it or disagree with them. They have good reasons for being as they are, some of which are only apparent for specific languages that would otherwise be unusable or cumbersome or require ad-hoc rulings.&lt;/p&gt;&#xA;&lt;p&gt;Only override the defaults when they don't serve their purpose because of some specific feature of your challenge, and even then think if you can make the challenge accommodate instead.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-11T19:06:43.513" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8066" PostTypeId="2" ParentId="8047" CreationDate="2016-01-11T19:17:36.073" Score="45" Body="&lt;h1&gt;&quot;Ideally, your code will...&quot;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Avoid recommended features in your spec. If it's not mandatory, answers won't do it. The goal is to write the shortest/fastest/winningest code that still satisfies the requirements, however minimally, so any features that can be cut or simplified will be.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, popularity contests are an exception.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20469" LastEditDate="2016-01-11T19:36:06.863" LastActivityDate="2016-01-11T19:36:06.863" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8067" PostTypeId="2" ParentId="8047" CreationDate="2016-01-11T19:27:25.277" Score="79" Body="&lt;h1&gt;Making assumptions about language features&lt;/h1&gt;&#xA;&lt;p&gt;Unless you're writing a language-specific challenge, avoid terms specific to some class of languages, because these might not make sense for other languages and prevent them from participating. Languages can very different from what you're used to: functional, minimalist, graphical, untyped, strongly typed, and weird in many ways.&lt;/p&gt;&#xA;&lt;p&gt;Examples of loaded phrases:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&amp;quot;write a function that&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;return a pointer to&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;if the input is invalid, throw an exception&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;at compile time&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;you may not use the + operator.&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;if they are of different types&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;modify the input object&amp;quot;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Usually, this can be fixed by using broader terms, but is sometimes is a sign of a problem with the challenge itself. Consider defining the requirements in terms of input and output without reference to the program internals.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-11T19:27:25.277" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8068" PostTypeId="2" ParentId="7897" CreationDate="2016-01-11T20:09:51.637" Score="4" Body="&lt;h1&gt;Sidebar Links to Important Items&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This site is already a large archive of programming questions, but for most users not familiar with the site it is only the front page. There needs to be a way for high quality old questions to be recycled so that they still receive attention. I suggest permanent side-bar links to very-popular tags like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;. Also, underneath those should be a list of other popular tags like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt; that is recycled every so often. Note, there is already a &quot;Frequented Tags&quot; list on the Sidebar, so this proposal could become integrated with that. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another problem is that there are important questions sitting in Main and Meta that do not have prominent, permanent links to them. Things like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;Sandbox for Proposed Challenges&lt;/a&gt; and the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;  &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;wiki&lt;/a&gt;, etc. need to have permanent Sidebar links to them, so that everyone knows the rules from the get-go! Moreover, there should be a page that archives all the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions in an organized way, and it should get a sidebar link. Also, I think interesting reference questions like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44680/showcase-your-language-one-vote-at-a-time&quot;&gt;Showcase of Languages&lt;/a&gt; should be on the sidebar, maybe on a recycled basis.&lt;/p&gt;&#xA;" OwnerUserId="46313" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-01-11T20:39:16.623" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8073" PostTypeId="2" ParentId="7987" CreationDate="2016-01-11T22:20:15.023" Score="17" Body="&lt;h2&gt;Marking an answer Community Wiki does not excuse it from this policy&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Introducing an answer with &quot;I know this doesn't follow the rules but I worked hard on it so I want to post it here&quot; is not an acceptable excuse.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Saying &quot;I've marked it Community Wiki so I won't get any rep from it&quot; does not change the fact that it is taking up space meant for valid answers from people who not only put the hard work in but also followed the rules.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2016-01-11T22:20:15.023" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8076" PostTypeId="2" ParentId="7987" CreationDate="2016-01-12T02:23:11.810" Score="17" Body="&lt;h2&gt;The new policy should apply to answers that predate it&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If the community decides to remove invalid answers (and it certainly looks like it right now), that policy should apply to &lt;em&gt;all&lt;/em&gt; answers. Reasons for this include:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;We are not changing the rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For a policy that invalidates previously valid answers, retroactive application wouldn't be entirely fair, but that's not the case here. The answers were &lt;em&gt;always&lt;/em&gt; invalid. The only thing that is debated now is how to deal with them.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Old or new, they are low quality.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While there was no clear consensus that invalid answers should be removed, there always was consensus that they were low quality. Low quality contributions are and always have been subject to removal. In fact,&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The answer is extremely low quality: There is little to no scope for improvement&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;is one of the suggested reasons for deletion for &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/trusted-user&quot;&gt;trusted users&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There is little to no rep loss.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As explained in &lt;a href=&quot;http://blog.stackoverflow.com/2012/03/reputation-and-historical-archives/&quot;&gt;Reputation and Historical Archives&lt;/a&gt;, any answer with a score of &lt;strong&gt;+3&lt;/strong&gt; or higher that has been visible for 60 days or more will not cause a reputation loss if it is deleted.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-01-12T02:23:11.810" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8077" PostTypeId="2" ParentId="8047" CreationDate="2016-01-12T06:48:21.700" Score="126" Body="&lt;h1&gt;Cumbersome I/O formats&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Generally, allow flexible input and output formats. People want to write code to do your task of, say, composing permutations, not reading/writing numbers in a particular semicolon-separated format, or from a file, or with input validation. For code golf, it's annoying when most of your byte count is boilerplate, especially when other languages read the format natively.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Allowing I/O in the language's native format (list, string, tuple, etc) is usually a better option. Yes, it makes comparisons between languages less exact, but that's worth it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In particular, don't use long strings for outputs. Instead of &quot;Why, yes, good sir or madam, this list is in fact a palindrome&quot;, let programs output 1/0 or True/False or general &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2190/20260&quot;&gt;Truthy/Falsey&lt;/a&gt; values.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, if your task is about specific formats, that's fine. ASCII art challenges usually require a precise output. A challenge to process certain file headers can expect a rigid input format.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-01-12T06:48:21.700" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8078" PostTypeId="2" ParentId="8047" CreationDate="2016-01-12T06:59:13.897" Score="85" Body="&lt;h1&gt;Rules inferred from test cases&lt;/h1&gt;&#xA;&lt;p&gt;Test cases are examples for people to check their understanding of the spec and the correctness of their code. They should not replace an explanation of how the output must relate to the input. (There are rare exceptions where it's straightforward, like a scaling ASCII art pattern.)&lt;/p&gt;&#xA;&lt;p&gt;Don't leave readers guessing as to what the rules must be from examples. In particular, it can be unclear if the precise input/output format of the test cases is required. Also, additional requirements in test cases are liable to be missed by someone who starts coding before looking at them.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-19T12:35:17.510" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8079" PostTypeId="2" ParentId="8047" CreationDate="2016-01-12T07:14:09.290" Score="74" Body="&lt;h2&gt;Do X without Y&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This isn't always bad, but it's been a particular trap for beginners, so be careful.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the past, there were popular questions about doing a simple task but with the obvious method banned:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/17005/produce-the-number-2014-without-any-numbers-in-your-source-code&quot;&gt;Produce the number 2014 without any numbers in your source code&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/18254/how-to-write-a-c-program-for-multiplication-without-using-the-and-operators&quot;&gt;How to write a C program for multiplication without using the * and + operators?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/20996/20260&quot;&gt;Add without addition (or any of the 4 basic arithmetic operators)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;These have fallen out of favor because they inspired many copycats that basically came down to the same tricks. In general, if your challenge is too simple to be interesting, it won't be saved by banning things. It's better to make the challenge meatier instead. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, it's hard to define &quot;without Y&quot; for a wide class of languages, leading to nitpicking like &quot;I'm not using &lt;code&gt;a+b&lt;/code&gt;, just &lt;code&gt;sum(a,b)&lt;/code&gt;&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;Do X without Y&quot; can be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source?sort=votes&amp;amp;pageSize=50&quot;&gt;good&lt;/a&gt; questions, but I've found the odds stacked sorely against them, especially for new posters, so be careful. Look at past questions and check that yours requires novel ideas, and beware that site standards have gotten much more stringent over time.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-07-20T16:21:38.820" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8080" PostTypeId="2" ParentId="8034" CreationDate="2016-01-12T09:04:54.853" Score="2" Body="&lt;p&gt;Answer for voting: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Yes&lt;/strong&gt;, it's on topic, in its current form as a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;. It might not be ideal, but it's within the rules as they're currently set out and practised.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I'm adding this answer because it's been suggested to me that the votes for Calvin's Hobbies' answer are because people agree that a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; is not ideal, rather than because they agree that the idea as I proposed it is on topic. Therefore, please vote for or against this answer according to whether the idea as I proposed it is on topic without changing it to a more 'objective' winning condition. Please note that this is purely for voting about whether it's &lt;em&gt;on topic&lt;/em&gt;, and not whether it would be improved by changing it.)&lt;/p&gt;&#xA;" OwnerUserId="21034" LastEditorUserId="21034" LastEditDate="2016-01-12T11:15:29.733" LastActivityDate="2016-01-12T11:15:29.733" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8084" PostTypeId="1" CreationDate="2016-01-12T18:12:26.273" Score="18" ViewCount="873" Body="&lt;p&gt;In light of the controversy sparked by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69232/paint-the-mona-lisa-in-1-kib-of-code&quot;&gt;this question&lt;/a&gt;, I think we need to create a general &quot;rule of thumb&quot; policy on how objective a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; needs to be in order to be on-topic. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main issue, as I see it, is that people are not in agreement over whether an objective specification &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/26783139#26783139&quot;&gt;should be able to determine the validity of an answer independently of the voters.&lt;/a&gt; I think we need to figure out some sort of compromise on what exactly makes a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; specification objective.&lt;/p&gt;&#xA;" OwnerUserId="45151" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-01-18T14:33:07.710" Title="Guidelines for posting and closing popularity contests" Tags="|discussion|policy|popularity-contest|" AnswerCount="5" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8086" PostTypeId="2" ParentId="8084" CreationDate="2016-01-12T19:25:07.197" Score="2" Body="&lt;p&gt;Despite their more subjective nature, popularity contents are not except from the site's rule of objectivity. All popularity contests still need a concrete, objective way to determine whether a submission is valid and deserving of votes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;But wait,&quot; you say, &quot;couldn't I just make the criterion 'output must be an image'? That's objectively verifiable.&quot; In this contrived example, that criterion is indeed objective in some respect, but that's far too broad for this site and any challenge claiming such a criterion should be closed as such.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We occasionally get popularity contests that are more art-focused than programming-focused. As a site with programming right in the name, all challenges here should be centered around programming. Consider &lt;a href=&quot;https://codegolf.stackexchange.com/q/50299/20469&quot;&gt;Draw an Image as a Voronoi Map&lt;/a&gt; as an example. This challenge requires making pretty pictures, but there's more to it than that. Specifically, (quoting directly from the challenge)&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Your task is to approximate a given image with such a Voronoi map.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;This is a popularity contest, so the answer with the most net votes wins. Voters are encouraged to judge answers by&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;how well the original images and their colours are approximated.&lt;/li&gt;&#xA;  &lt;li&gt;how well the algorithm works on different kinds of images.&lt;/li&gt;&#xA;  &lt;li&gt;how well the algorithm works for small N.&lt;/li&gt;&#xA;  &lt;li&gt;whether the algorithm adaptively clusters points in regions of the image that require more detail.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The challenge to this is constructing the code/algorithm to implement this. The above details give the popularity contest its objective criteria and thus makes it on topic.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-01-12T19:25:07.197" CommentCount="18" ContentLicense="CC BY-SA 3.0" />
  <row Id="8088" PostTypeId="2" ParentId="8084" CreationDate="2016-01-12T20:23:55.173" Score="10" Body="&lt;h2&gt;Let's not argue over semantics&lt;/h2&gt;&#xA;&lt;p&gt;Trying to interpret SE policy and the meaning of objectivity here feels like reading tea leaves. These rules were written for a different situation: questions that are actually requests for help, and answers that give information.&lt;/p&gt;&#xA;&lt;p&gt;Challenges run as competitions with rules and votes are so different that if we stretch terms to fit (question = challenge, answer = code submission, objective = baseline validity criterion), the intended meaning  has been lost. While we should try to respect SE's kindly letting us have a weird site and run by their rules, we should look for the goals of the rules in sustaining a good site, not their wording.&lt;/p&gt;&#xA;&lt;p&gt;Rather, let's look at &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=%5Bpopularity-contest%5D%20is%3Aquestion%20created%3A2015&quot;&gt;recent pop-cons&lt;/a&gt; and see if they're good or bad for the site, or what separates good and bad ones. Do voters react to them well? Do they attract quality answers, and do the best answers rise to the top? Do they push clever coding? Can their purpose not be served by other challenge types?&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-12T20:23:55.173" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8090" PostTypeId="2" ParentId="8047" CreationDate="2016-01-13T01:18:37.777" Score="9" Body="&lt;h1&gt;Exclamation marks in titles!&lt;/h1&gt;&#xA;&lt;p&gt;Quite a lot of questions have exclamation marks at the end of their titles! To me this just seems like a vain attempt to attract more attention with the hope of getting more upvotes!  I don't think I've ever seen a challenge with an exclamation mark in the title where the exclamation mark enhances the challenge in any way!&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-13T01:18:37.777" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="8091" PostTypeId="2" ParentId="8084" CreationDate="2016-01-13T04:12:42.440" Score="5" Body="&lt;h3&gt;Which challenges are on topic here?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;First and foremost, the same rules apply to all challenges, whether they are popularity contests or not. These rules are outlined in &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;our help center&lt;/a&gt;. They were phrased differently in the past, but their essence was the same ever since the help center was created in 2013.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;Programming Puzzles &amp;amp; Code Golf&lt;/em&gt; is for programming contests and challenges. We welcome questions from beginners and experts alike.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;All &lt;strong&gt;challenge questions&lt;/strong&gt; on this site should have:&lt;/p&gt;&#xA;  &#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;A &lt;strong&gt;clear specification&lt;/strong&gt; of what constitutes a correct submission, so that it is possible to indisputably decide whether an entry is valid or not. Test cases are highly encouraged.&lt;/li&gt;&#xA;  &lt;li&gt;An &lt;strong&gt;objective primary winning criterion&lt;/strong&gt;, so that it is possible to  indisputably decide which entry should win.&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Now, let's take the following, theoretical challenge:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Write a program that prints an unpublished poem to STDOUT. Shortest code in byte wins.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Clearly, this challenge has an objective winning criterion (second sentence). Is this challenge on topic? &lt;em&gt;Of course not!&lt;/em&gt; Where did it go wrong?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;There is no objective validity criterion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What exactly counts as a poem? If you google the term, you will find definitions full of weasel words, and you'll soon come to the conclusion that &lt;em&gt;indisputably deciding&lt;/em&gt; whether any arbitrary collection of words is or not a poem will be impossible.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It isn't a programming contest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The lion share of the challenge is coming up with the poem. Printing it should be straightforward in most programming languages.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;What does that have to do with anything?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, many popularity contests are strikingly similar to the above example. Now, I don't think is because popularity contests are inherently worse than other challenge types, but because &lt;em&gt;off topic challenges are much more likely to be labeled popularity contest&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yes, popularity contests are judged by the community's votes, and yes, &lt;em&gt;best vote tally&lt;/em&gt; is an objective winning criterion. However, that does &lt;em&gt;not&lt;/em&gt; excuse popularity contests from complying with the remaining rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'll use &lt;a href=&quot;https://codegolf.stackexchange.com/q/69232&quot;&gt;Paint the Mona Lisa in 1 KiB of code&lt;/a&gt;&lt;sup&gt;&amp;ddagger;&lt;/sup&gt; as an example.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;There is no objective validity criterion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As far as validity criteria go,&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Your task is to reproduce the Mona Lisa in 1024 bytes or less.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;is as vague as it gets. Sure, it's easy to form an individual opinion for each submission, and for very good or very awful submissions, all involved people may agree that they do or do not &quot;reproduce the Mona Lisa&quot;, but the same people may have different opinions anything in between.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In particular, the reference implementation produces this output, which doesn't look &lt;em&gt;at all&lt;/em&gt; like the Mona Lisa in my opinion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/NV5Ak.png&quot; alt=&quot;Mona Lisa?&quot;&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It's not a real programming contest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's nothing in the challenge's rules that forbids using an image manipulation program to compress the original image to ~1 KiB and find a golfy way to print it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I did exactly that with GIMP, recompressed the image with LZMA and obtained a 1,110 byte &lt;a href=&quot;https://esolangs.org/wiki/Bubblegum&quot; rel=&quot;nofollow noreferrer&quot;&gt;Bubblegum&lt;/a&gt; solution that prints this image.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/F8gC4.jpg&quot; alt=&quot;Mona Lisa!&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Creating this theoretical submission required little to no programming skills.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fixing this shortcoming could be rather easier, for example, by changing the contest to accept an image as input and producing a compressed version, not longer than 1,024 bytes. This eliminates the possibility of handcrafting an image, and turns an image manipulation contest into a programming contest.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Beyond being on topic&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;There are easy ways around the validity criterion problem. For example, one could just specify&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Print any image. The image that looks the most like the Mona Lisa (decided by vote tally) wins.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;creating an objective validity criterion (output is an image). Such a contest should still be closed as &lt;em&gt;too broad&lt;/em&gt;, since there are too many possible answers. &lt;em&gt;At the very least&lt;/em&gt;, the challenge should have specified a desired resolution and a list of acceptable image file formats. Ideally, it should be more restrictive than that. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/q/33172&quot;&gt;American Gothic in the palette of Mona Lisa: Rearrange the pixels&lt;/a&gt; contains a strict set of rules and even a validation snippet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Furthermore, good guidelines for voting can also help to narrow down the challenge. Let us examine the &lt;a href=&quot;https://codegolf.stackexchange.com/q/69232&quot;&gt;Mona Lisa challenge&lt;/a&gt; once more:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Voters are expected to judge answers according to the following criteria:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Resemblance of the output image to da Vinci's masterpiece, in terms of colour, composition, details etc.&lt;/li&gt;&#xA;  &lt;li&gt;The extent to which it captures the famous &quot;enigmatic smile&quot;&lt;/li&gt;&#xA;  &lt;li&gt;Novelty and cleverness of the techniques used (answers should clearly describe this)&lt;/li&gt;&#xA;  &lt;li&gt;Elegance and quality of the code in general&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The first suggestion says a lot without actually saying anything. With the size restriction, answers will have to choose between similar colors and details, and there's no indication which one should be preferred.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The second point highlights the smile. Does that mean the rest of the image is less important?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not sure how what counts as novel or clever in this scenario. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, I think judging the coding style is an absurd idea if the point is producing the best possible image in a limited amount of bytes.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Further suggestions for posting challenges&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;em&gt;X&lt;/strong&gt; has been asked before an was well received, so &lt;strong&gt;Y&lt;/strong&gt; will work out as well&lt;/em&gt; is usually a bad starting point.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Many older challenges that met the quality standards in their time would be instantly closed if posted today.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Use the sandbox and give it time to work.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A good rule of thumb is too leave challenge proposals at least one week in the sandbox, to give it as much exposure as possible. Most users do not visit the sandbox every day.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Consider several scoring options.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Popularity contests are ideal for challenges which should be judged by humans, but only for those. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8036&quot;&gt;Calvin's Hobbies' answer&lt;/a&gt; contains an interesting proposal for judging the &lt;a href=&quot;https://codegolf.stackexchange.com/q/69232&quot;&gt;Mona Lisa challenge&lt;/a&gt;, which has two advantages over a popularity contest:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;While existing image compression utilities and algorithms are designed to please the human eye, finding an existing one that would score well in a code challenge should be significantly more difficult.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This means participants have to write their own image codecs.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It makes the winning criterion objective, which automatically narrows down the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All participants immediately now what their submissions should aim for.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;sup&gt;&amp;ddagger;&lt;/sup&gt; Apologies to @Nathaniel for picking his challenge apart, but is the challenge that started the whole discussion.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-01-13T04:12:42.440" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8092" PostTypeId="2" ParentId="2140" CreationDate="2016-01-13T04:20:05.057" Score="-5" Body="&lt;h1&gt;Make a search engine!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Background&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You are now the first employee of DuckDuckGoogle, a company founded by a Google employee and a DuckDuckGo employee! They have a new vision for search engine! But obviously, they need to make a search engine first! However, they are bad programmers (nobody knows how they were even hired at DuckDuckGo and Google!).&#xA;So you are assigned the task of making a search engine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Search engines&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are three parts to a search engine, a web crawler, an indexer, and a searcher.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The web crawler takes a link, and saves the page and stores the page data (the HTML code). It then looks for links in the page and visits those webpages and does the same. It will continue to do this until there are no more links left.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The web indexer will take the text from each page, take each word, and add it to a dictionary of words and the pages it is associated with. If the word is already in the dictionary, it adds the page as a value  of that word that is found in the page. For example, lets say www.example.com/index.html contains the text &quot;hello. thanks! goodbye.&quot; and the ww.example.com/index.html is linked to www.example.com/hello.html with the. text &quot;hello. goodbye.&quot; The crawler would extract the text from the index.html, and find hello.html, and extract the text from hello.html. The indexer would make a dictionary like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;dictionary ={&quot;hello.&quot;: [&quot;www.example.com/index.html&quot;,&quot;ww.example.com/hello.html&quot;], &quot;goodbye.&quot;:[&quot;www.example.com/index.html&quot;,&quot;ww.example.com/hello.html&quot;], &quot;thanks!&quot;: [&quot;ww.example.com/index.html&quot;]}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The simplest part of the search engine is the searcher, or retriever. It simply retrieves the value for the search term (i.e. the list of pages the search term is found in) and prints it. That is the final result of the program. So if the search term is &quot;hello.&quot;, the program will print &lt;code&gt;[&quot;www.example.com/index.html&quot;,&quot;ww.example.com/hello.html&quot;]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, here is the difficult part. You must take into account punctuation. So &quot;hello&quot; returns the same as &quot;hello.&quot; Also the search engine should be case-insensitive. So &quot;Hello&quot; is the same as &quot;hello&quot;, which, as we said, is the same as &quot;hello.&quot; which was &lt;code&gt;[&quot;www.example.com/index.html&quot;,&quot;ww.example.com/hello.html&quot;]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The challenge is to write a search engine in the least number of bytes as possible. Why? Because your bosses have decided to use 90% of the one hard drive they have (budget problems!) for the Holy Grail part of their project and you only get 10%.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The input is the &quot;seed&quot;, a url at which the crawler should start at, and also the search term.&lt;/li&gt;&#xA;&lt;li&gt;The output is a list of webpage urls where the search term is found.&lt;/li&gt;&#xA;&lt;li&gt;The program &lt;strong&gt;cannot&lt;/strong&gt; use builtins for a search engine or even a crawler (or related, like a scraper or spider library). &lt;/li&gt;&#xA;&lt;li&gt;No need to worry about Javascript at all. Assume that the pages will not have Javascript.&lt;/li&gt;&#xA;&lt;li&gt;The webpages are assumed to have HTML 4.0.1 Strict.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Testing&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I am pretty sure people know how search engines work. So I will only include two testcases. You can use the websites in the testcases for testing purposes as well.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; &quot;https://www.udacity.com/cs101x/index.html&quot; &quot;crawl&quot;&#xA;[&quot;https://www.udacity.com/cs101x/index.html&quot;,&quot;https://www.udacity.com/cs101x/crawling.html&quot;]&#xA;&#xA;&amp;gt; &quot;https://www.udacity.com/cs101x/urank/index.html&quot; &quot;hummus&quot;&#xA;[&quot;https://www.udacity.com/cs101x/urank/index.html&quot;,&quot;https://www.udacity.com/cs101x/urank/hummus.html&quot;,&quot;https://www.udacity.com/cs101x/urank/arsenic.html&quot;,&quot;https://www.udacity.com/cs101x/urank/kathleen.html&quot;,&quot;https://www.udacity.com/cs101x/urank/nickel.html&quot;,&quot;https://www.udacity.com/cs101x/urank/zinc.html&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="34421" LastEditorUserId="34421" LastEditDate="2016-01-13T23:54:11.853" LastActivityDate="2016-01-13T23:54:11.853" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="8093" PostTypeId="2" ParentId="8084" CreationDate="2016-01-13T07:19:46.003" Score="11" Body="&lt;h2&gt;The current state is good for nobody&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The rules as they apply to pop cons are bizarre. Whether they should be loosened or tightened, either would be better than this strange in-between.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;All challenge questions on this site should have:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;p&gt;A clear specification of what constitutes a correct submission, so&#xA;  that it is possible to indisputably decide whether an entry is valid&#xA;  or not. Test cases are highly encouraged. &lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;An objective primary winning&#xA;  criterion, so that it is possible to indisputably decide which entry&#xA;  should win.&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Pop cons get by the second point on a technicality, that votes are an &quot;objective primary winning criterion&quot;, when votes are as subjective and arbitrary as things come. This looks like the result of an uneasy past compromise where some people wanted to showcase programming skill and creativity without a competitive format, so they made up the &quot;most votes wins&quot; to satisfy the rule, even though nobody thinks in terms of a winner. (I'm speculating here, I wasn't actually around). This takes too much doublethink. Either the rule should change, or pop cons should change.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given that votes count for winning, the first rule (indisputably decide valid entry) is really awkward for pop cons. So you can be totally fuzzy about who wins, but the baseline must be indisputable? That blunts the whole point of pop cons, that they pose open-ended tasks. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's rare for a task that requires human judgment to allow a precise baseline cutoff. Even if some things sure look like the Mona Lisa and other don't, how do you define that line? It does work for tasks that are basically challenges but with a bonus of &quot;who do it most stylishly&quot;, but these are barely pop cons. Saying &quot;pop cons are allowed, they just need have objective validity criteria&quot; strikes me like a law that says &quot;owning a gun is allowed, you just need our [hard-to-obtain] safety certification&quot;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So where does that leave us? Either we change the rules to allow for pop cons without needing mental gymnastics, or we stop allowing pop cons. &lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2016-01-13T07:19:46.003" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8094" PostTypeId="2" ParentId="1061" CreationDate="2016-01-13T08:31:28.400" Score="-4" Body="&lt;h1&gt;Using &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/25180&quot;&gt;non-programming languages&lt;/a&gt; &lt;sup&gt;(irrelevant to &amp;quot;golfing&amp;quot; languages)&lt;/sup&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Not to be confused with golfing languages. This loophole definitely has nothing to do with golfing languages.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A purported programming language should be accepted as such if and only if it is capable of addition of natural numbers and primality testing of natural numbers.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Follow &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/25180&quot;&gt;the link&lt;/a&gt; for a more complete definition.&lt;/p&gt;&#xA;&lt;p&gt;Related meta post: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10421/25180&quot;&gt;Do submissions have to be answered with a programming language?&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;That is, to use something that was not considered a programming language in our criteria. I don't think this was really forbidden before. So here is something everybody can vote.&lt;/p&gt;&#xA;&lt;p&gt;If this is forbidden, you cannot use languages such as &lt;a href=&quot;https://esolangs.org/wiki/HQ9%2B&quot; rel=&quot;nofollow noreferrer&quot;&gt;HQ9+&lt;/a&gt; or &lt;a href=&quot;https://esolangs.org/wiki/Text&quot; rel=&quot;nofollow noreferrer&quot;&gt;Text&lt;/a&gt; in any challenges. You have to use the less familiar &lt;a href=&quot;https://esolangs.org/wiki/Help,_WarDoq!&quot; rel=&quot;nofollow noreferrer&quot;&gt;Help, WarDoq!&lt;/a&gt; or &lt;a href=&quot;https://esolangs.org/wiki////&quot; rel=&quot;nofollow noreferrer&quot;&gt;///&lt;/a&gt; instead, in most cases, or simply cannot compete if your code involves some more creative features that nobody invented a rule-compliant counterpart of the language having them. In this way we could possibly encourage users to program, not to find something &amp;quot;creative&amp;quot; or obscure.&lt;/p&gt;&#xA;&lt;p&gt;If not, you can use any language as long as the person who created a compiler or interpreter calls it a language, &lt;em&gt;unless&lt;/em&gt; forbidden by other per site or per question rules. If there is a good reason to add this restriction (such as in some cops-and-robbers questions), you should specify that explicitly. If the term &amp;quot;programming language&amp;quot; is mentioned somewhere, by default, it refers to languages satisfying our criteria.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-02T05:37:00.217" CommentCount="13" CommunityOwnedDate="2016-01-13T08:31:28.400" ContentLicense="CC BY-SA 3.0" />
  <row Id="8095" PostTypeId="2" ParentId="2140" CreationDate="2016-01-13T18:29:55.180" Score="0" Body="&lt;h1&gt;Fixed Width&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://xkcd.com/276/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Related&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;We like fixed width. We want you to evaluate a string&#xA;on it's &quot;fixed width&quot;-ness. However, this string will&#xA;not be a regular string. This input will be presented&#xA;to your code as thus: &quot;name1, name2, lin1,..., linN&quot;.&#xA;&#xA;Each of linK is a single line of a transcript; you'll&#xA;assume that the speakers alternate, and that each lin&#xA;is will not have trailing whitespace, like this:     &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You may take input in the form of a function or a program, as a string with commas, a list, or a series of arguments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Say your input is &lt;code&gt;rob, emily, hi, hey you, last night was nice, the best i've had&lt;/code&gt;. Then, the result would be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;rob&amp;gt; hi&#xA;&amp;lt;emily&amp;gt; hey you&#xA;&amp;lt;rob&amp;gt; last night was nice&#xA;&amp;lt;emily&amp;gt; the best i've had&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then, this input would have a &quot;fixed width&quot;-ness of 2. This is what you would return/print. That is, you are to output the length of the longest run of fixed width messages.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input =&amp;gt; output&#xA;&#xA;rob, emily, hi, hey you, last night was nice, the best i've had =&amp;gt; 2&#xA;a, b, hello, hola!, no, what?, why, why not, abcdef, fededa, 012345 =&amp;gt; 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I think this should be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, but I think this could also work as a fixed-width &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, maybe.&lt;/p&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2016-01-13T18:29:55.180" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8096" PostTypeId="1" CreationDate="2016-01-13T19:05:05.497" Score="12" ViewCount="460" Body="&lt;p&gt;Recently, I encountered &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69353/collections-and-sorting&quot;&gt;this question&lt;/a&gt; where a user had posted a challenge to make an ArrayList and manipulate it in certain ways, very basically.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This poster &lt;em&gt;obviously&lt;/em&gt; did not understand the site, nor had they seem to have encountered Stack Overflow, where the question should have been posted, even if in another format.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My main question is not whether we should direct them to Stack Overflow, as we did, but rather should we &lt;em&gt;downvote&lt;/em&gt; this poster? The question received four downvotes quite quickly - downvoting can be taken quite personally to new users (I remember that time - single tear), and it may discourage them from seeking advice elsewhere on the site, a positive for the site and them. On the other hand, it does discourage using this site for general questions, which helps us specifically.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-01-14T20:58:34.970" Title="On downvoting questions of users not in the know" Tags="|discussion|policy|challenges|new-users|voting|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8097" PostTypeId="2" ParentId="8096" CreationDate="2016-01-13T19:27:57.993" Score="17" Body="&lt;p&gt;If the challenge is a &lt;strong&gt;homework question in disguise&lt;/strong&gt;, or otherwise looks like an attempt to get this community to do someone else's work for them, then I would downvote it. I would certainly not direct them to Stack Overflow.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the post is a &lt;strong&gt;regular programming question&lt;/strong&gt; and is &lt;strong&gt;suitable for Stack Overflow&lt;/strong&gt;, then I would refrain from voting and leave a helpful comment directing them to Stack Overflow.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the post is a &lt;strong&gt;regular programming question&lt;/strong&gt; and is &lt;strong&gt;not suitable for Stack Overflow&lt;/strong&gt;, then I would refrain from voting and leave a helpful comment telling them to improve their question and then post on Stack Overflow.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="18487" LastEditDate="2016-01-14T20:58:34.970" LastActivityDate="2016-01-14T20:58:34.970" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8099" PostTypeId="2" ParentId="8096" CreationDate="2016-01-13T23:28:34.107" Score="20" Body="&lt;p&gt;The tooltip for the downvote button says&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This question does not show any research effort; it is unclear or not useful.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It is an excellent description of the question you link.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Does not show any research effort&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The particular example linked looks like a &quot;Do my homework&quot; question, and does not show any evidence of effort beyond a poor transcription.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But in general, Stack Overflow-type questions on this site betray a lack of basic research effort in that it doesn't take much lurking to realise that that isn't what this site is about. If the poster had bothered to look for a FAQ it would have been very clear that they had the wrong site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my opinion, the basic netiquette breach of failing to lurk and have a vague idea of what's on topic before you post automatically qualifies as lack of research effort.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;It is unclear&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Even if the question had been on topic, it would have drawn 5 close votes as unclear very quickly.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;It is not useful&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Again, leaving aside the fact that it's blatantly not on topic for this site, who would benefit from the question being answered? No-one. Not even the poster, who's supposed to be learning how to program and instead would only learn that there's a sucker born every minute.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When you interpret &lt;em&gt;useful&lt;/em&gt; in the context of PPCG, this counts doubly: to be useful on this site, a question should provide an interesting challenge.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;In summary&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Few questions are &lt;em&gt;more&lt;/em&gt; deserving of a downvote.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Postscript&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Note that both the tooltip and the summary say &lt;em&gt;question(s)&lt;/em&gt;, not &lt;em&gt;poster(s)&lt;/em&gt;. The voting tools are intended to be used on questions. If you worry that people might not be able to differentiate a downvote on their question from a downvote on their personal worth, add a comment, but don't let it stop you voting. We all need to distinguish criticism of our actions/products/outputs from personal criticism, and those who haven't already learnt to do so will benefit from learning earlier rather than later.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2016-01-13T23:28:34.107" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8100" PostTypeId="2" ParentId="2140" CreationDate="2016-01-14T03:04:19.853" Score="16" Body="&lt;h1&gt;I can't believe it's not a Platypus!!!&lt;/h1&gt;&#xA;&lt;p&gt;This is an image of our wonderful &lt;s&gt;pet&lt;/s&gt; platypus @Cyoce.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/WYDLD.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/WYDLD.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is also an image of the same person, or is it?&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/xd6pm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/xd6pm.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;&lt;em&gt;(hint: it isn't)&lt;/em&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to determine whether a inputted image is @Cyoce in disguise...&lt;/p&gt;&#xA;&lt;p&gt;The input may be taken in any form.  It will also always be 256*256px.&lt;/p&gt;&#xA;&lt;p&gt;You will compare the image to the top image, @Cyoce profile image.&lt;/p&gt;&#xA;&lt;p&gt;If the image is not within 1000 units of the profile picture, you must output the phrase &amp;quot;I can't believe it's not platypus!!!&amp;quot; exactly.&lt;/p&gt;&#xA;&lt;p&gt;A unit is decided by the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a given pixel is rgb(255,255,255) in the inputted image and rgb(250,250,250) in the martin image, it is 3 units away.  That is one unit per 5 rgb points off.  So rgb(100,120,100) vs rgb(100,100,100) is 4 units off.  Floor the units, so 255 vs 253 is just 0.&lt;/li&gt;&#xA;&lt;li&gt;Calculate that for each pixel, and sum the units.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If the inputted image is more than 1000 units off, output the title phrase &amp;quot;I can't believe it's not a platypus!!!&amp;quot;&lt;/p&gt;&#xA;&lt;h1&gt;&lt;em&gt;Sandbox notes:&lt;/em&gt;&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;This is in development.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Test cases coming later. Feel free to provide some.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;If somebody has code they would like to donate to me for test case generation, please do. :P&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;I might change the units req. to a higher number depending on how this turns out.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Any other advice?&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-12T21:08:21.550" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="8101" PostTypeId="2" ParentId="8047" CreationDate="2016-01-14T06:36:03.693" Score="63" Body="&lt;h1&gt;Putting test cases in a hard to use format&lt;/h1&gt;&#xA;&lt;p&gt;Supplying test cases is always a good idea, but people are more likely to use them (and thus have better tested code) if they can easily be copied and pasted into a test suite.&lt;/p&gt;&#xA;&lt;p&gt;So format your test cases as simply and as consistently as possible, preferably in a single code block. If you have lots of test cases and you want to section them out by type, put empty lines between sections instead of using several separate code blocks.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Be sure to include any examples used during explanation as test cases. People  may otherwise forget important examples while focusing on test cases.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Do This:&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input -&amp;gt; Output&#xA;cat -&amp;gt; kitten&#xA;dog -&amp;gt; puppy&#xA;seal -&amp;gt; pup&#xA;bear -&amp;gt; cub&#xA;cow -&amp;gt; calf&#xA;bird -&amp;gt; chick&#xA;echidna -&amp;gt; puggle&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Replace &lt;code&gt;-&amp;gt;&lt;/code&gt; with something else if the &lt;code&gt;-&lt;/code&gt; and &lt;code&gt;&amp;gt;&lt;/code&gt; might get confused with the input and output. Don't use &lt;code&gt;→&lt;/code&gt; (right arrow) or other Non-ASCII since not all languages/compilers may allow it.&lt;/p&gt;&#xA;&lt;h1&gt;DON'T Do This:&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;+---------+--------+&#xA;|  Input  | Output |&#xA;+---------+--------+&#xA;| cat     | kitten |&#xA;| dog     | puppy  |&#xA;| seal    | pup    |&#xA;| bear    | cub    |&#xA;| cow     | calf   |&#xA;| bird    | chick  |&#xA;| echidna | puggle |&#xA;+---------+--------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Yes, it looks nicer, but it's more hassle to get the pure data.&lt;/p&gt;&#xA;&lt;h1&gt;DON'T Do This:&lt;/h1&gt;&#xA;&lt;p&gt;The inputs &lt;code&gt;cat&lt;/code&gt;, &lt;code&gt;dog&lt;/code&gt; &lt;code&gt;seal&lt;/code&gt;, &lt;code&gt;bear&lt;/code&gt;, &lt;code&gt;cow&lt;/code&gt;, &lt;code&gt;bird&lt;/code&gt;, and &lt;code&gt;echidna&lt;/code&gt; have the respective outputs &lt;code&gt;kitten&lt;/code&gt;, &lt;code&gt;puppy&lt;/code&gt;, &lt;code&gt;pup&lt;/code&gt;, &lt;code&gt;cub&lt;/code&gt;, &lt;code&gt;calf&lt;/code&gt;, &lt;code&gt;chick&lt;/code&gt;, and &lt;code&gt;puggle&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;DON'T Do This:&lt;/h1&gt;&#xA;&lt;p&gt;The input&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;cat&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;has output&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;kitten&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The input&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;dog&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;has output&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;puppy&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Likewise, the input&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;seal&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;has output&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;pup&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and the input&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;bear&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;has output&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;cub&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and the input&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;cow&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;has output&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;calf&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and the input&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;bird&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;has output&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;chick&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and, finally, the input&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;echidna&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;has output&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;puggle&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sup&gt;Yes, I have been guilty of this. No, I am not going to fix all my old challenges.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-18T03:16:52.957" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="8102" PostTypeId="2" ParentId="8047" CreationDate="2016-01-14T17:14:24.127" Score="22" Body="&lt;h1&gt;Bonuses in code-golf&lt;/h1&gt;&#xA;&lt;p&gt;This might be controversial - Personally I'm not sure which way to go on this one.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;In most cases, code-golf scoring is simple - shortest answer in bytes wins.&lt;/p&gt;&#xA;&lt;p&gt;However some questions offer bonuses to reduce scores if certain optional requirements are met.  This necessarily complicates scoring to the possible detriment of the question.  Often this ends up with either negative-score answers or non-integer score answers.  Of course comparisons of such scores are not rocket science, but they do leave a greater margin of error, as well as lower answer readability due to the extra cruft of score calculations.&lt;/p&gt;&#xA;&lt;p&gt;It can be argued that a well-written challenge can stand alone without the need for bonuses.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;On the other hand, bonuses can make an question more accessible, both by allowing a larger range of participant ability, and possibly allowing answers in a more diverse set of languages.&lt;/p&gt;&#xA;&lt;p&gt;Also bonuses add an extra dimension to the golfing process, which can make a problem more interesting to work on.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-14T17:14:24.127" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8104" PostTypeId="2" ParentId="2140" CreationDate="2016-01-14T20:11:45.397" Score="4" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;City Life&lt;/h1&gt;&#xA;&lt;h3&gt;A cellular automation war game.&lt;/h3&gt;&#xA;&lt;p&gt;In this game, each player will control group of cites on a grid. Each city takes up one cell, and all cells with no city are &amp;quot;wilderness&amp;quot;, and have no owner. The game will consist of a series of rounds, called &amp;quot;generations&amp;quot;. Play continues until a player gets 1000 points, or 200 rounds, whichever happens first.&lt;/p&gt;&#xA;&lt;h2&gt;Setup&lt;/h2&gt;&#xA;&lt;p&gt;The board will start with one city controlled by each player. It will be square with sides length &lt;code&gt;ceil(sqrt(25*n))&lt;/code&gt; for an &lt;code&gt;n&lt;/code&gt; player game. Cities will be placed randomly in such a way that no two cities will see each other the first round.&lt;/p&gt;&#xA;&lt;h2&gt;Phase 1: give orders&lt;/h2&gt;&#xA;&lt;p&gt;At the start of each generation, each city gets n actions where &lt;code&gt;n = # of adjacent wilderness spaces + 2&lt;/code&gt;. So a city surrounded by wilderness gets 10 actions while a city surrounded by cites gets only 2. The Actions will be divided into these three categories:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;Attack/Spread&lt;/code&gt; : used to Attack Cites or spread into the wilderness.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Takes a direction as a parameter. Will add one &amp;quot;Attacker&amp;quot; to that cell, even if the cell is a city with the same owner. (See &lt;strong&gt;resolve attacks&lt;/strong&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;code&gt;Defend&lt;/code&gt; : used to protect your city.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Will add one to the defender count of the city performing this action. (If no defend actions are used, the city will become wilderness.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;code&gt;Score&lt;/code&gt; : used to win.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Adds one to the score the cites owner.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Phase 2: resolve attacks&lt;/h2&gt;&#xA;&lt;p&gt;After all cites have put in orders, all cells are checked for takeover.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A wilderness cell will become a city if at least three attackers are there. The new city's owner will be determined randomly from among the attackers.(for example, if player A sent 2 attackers and player B sent 3, than A has a 2/5 chance of owning the new city)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A city will become wilderness if the number of attackers is equal to the number of defenders (even if both are 0).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A city is taken over if their are more attackers than defenders. The city's new owner is determined randomly from among the attackers, as above.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;After the round is complete, all attackers and defenders are reset.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;To enter the competition, you must create a bot to perform the &amp;quot;give orders&amp;quot; step. All bots will be written in JavaScript.&lt;/p&gt;&#xA;&lt;h2&gt;I/O&lt;/h2&gt;&#xA;&lt;p&gt;You will provide a character to represent your city and a function that takes as parameters:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Your vision. each city can see a 5x5 square with the city as its center. It will be represented as an array of arrays of characters, &lt;code&gt;&amp;quot; &amp;quot;&lt;/code&gt; representing wilderness, and each players character to represent their cites.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;p&gt;if you have a map like This (&amp;quot;Y&amp;quot; represents you)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+-----+   &#xA;|AA  B|    N&#xA;|A    |    ▲&#xA;|  YY | W&amp;lt; O &amp;gt;E&#xA;|C   C|    V&#xA;|   C |    S&#xA;+-----+    &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your sight parameter will be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[&amp;quot;A&amp;quot;,&amp;quot;A&amp;quot;,&amp;quot; &amp;quot;,&amp;quot; &amp;quot;,&amp;quot;B&amp;quot;],[&amp;quot;A&amp;quot;,&amp;quot; &amp;quot;,&amp;quot; &amp;quot;,&amp;quot; &amp;quot;,&amp;quot; &amp;quot;],[&amp;quot; &amp;quot;,&amp;quot; &amp;quot;,&amp;quot;Y&amp;quot;,&amp;quot;Y&amp;quot;,&amp;quot; &amp;quot;],[&amp;quot;C&amp;quot;,&amp;quot; &amp;quot;,&amp;quot; &amp;quot;,&amp;quot; &amp;quot;,&amp;quot;C&amp;quot;],[&amp;quot; &amp;quot;,&amp;quot; &amp;quot;,&amp;quot; &amp;quot;,&amp;quot;C&amp;quot;,&amp;quot; &amp;quot;]]`&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;The number of actions you can perform this turn. (which can be calculated, but I will give it to you as most bots will need it.)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;You must return an array of strings, each string representing an order.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;quot;N&amp;quot;&lt;/code&gt; - Attack North&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;quot;NE&amp;quot;&lt;/code&gt;- Attack North east&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;quot;W&amp;quot;&lt;/code&gt; - Attack West&lt;/p&gt;&#xA;&lt;p&gt;...&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;quot;D&amp;quot;&lt;/code&gt; - Defend&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;quot;$&amp;quot;&lt;/code&gt; - Score&lt;/p&gt;&#xA;&lt;p&gt;If you return more moves than you have actions allotted, the moves at the end of the array will be ignored. If you have less, extra moves will be set to &lt;code&gt;&amp;quot;D&amp;quot;&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I have made a controller that is reasonable, although I would like add to it and finalize the rules before publishing. If you have any advice or criticism, please comment below.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Example Answer:&lt;/h3&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Random Bot [?]&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;function(map, moveCount){&#xA;    var allMoves = [&amp;quot;N&amp;quot;,&amp;quot;S&amp;quot;,&amp;quot;E&amp;quot;,&amp;quot;W&amp;quot;,&amp;quot;NE&amp;quot;,&amp;quot;NW&amp;quot;,&amp;quot;SE&amp;quot;,&amp;quot;SW&amp;quot;,&amp;quot;D&amp;quot;,&amp;quot;$&amp;quot;];&#xA;    var orders = [];&#xA;    while(orders.length &amp;lt; moveCount){&#xA;        orders.push(allMoves[Math.floor(10*Math.random())]);&#xA;    }&#xA;    return orders;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This bot will just assign a random move for each action. Its cites are represented by &lt;code&gt;?&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="31203" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-21T21:49:33.063" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8105" PostTypeId="2" ParentId="202" CreationDate="2016-01-14T20:34:10.977" Score="5" Body="&lt;p&gt;&lt;a href=&quot;http://replit.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Replit&lt;/a&gt; is a free online interpreter/compiler I use for quite a few languages.&lt;/p&gt;&#xA;&lt;p&gt;It can run:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Ruby&lt;/li&gt;&#xA;&lt;li&gt;Python&lt;/li&gt;&#xA;&lt;li&gt;Python3&lt;/li&gt;&#xA;&lt;li&gt;C&lt;/li&gt;&#xA;&lt;li&gt;Java&lt;/li&gt;&#xA;&lt;li&gt;C++&lt;/li&gt;&#xA;&lt;li&gt;QBasic *&lt;/li&gt;&#xA;&lt;li&gt;CoffeeScript&lt;/li&gt;&#xA;&lt;li&gt;C#&lt;/li&gt;&#xA;&lt;li&gt;JavaScript&lt;/li&gt;&#xA;&lt;li&gt;LOLCODE&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And more. Replit also supports using nix to build custom environments so you can now run pretty much any lanuguage.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;* Note: The QBasic interpreter on Replit supports only a subset of QBasic. It usually can't handle golfed QBasic code.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="31203" LastEditorUserId="16766" LastEditDate="2021-11-10T22:27:39.047" LastActivityDate="2021-11-10T22:27:39.047" CommentCount="1" CommunityOwnedDate="2016-01-14T20:34:10.977" ContentLicense="CC BY-SA 4.0" />
  <row Id="8106" PostTypeId="2" ParentId="8047" CreationDate="2016-01-14T20:58:00.163" Score="76" Body="&lt;h2&gt;Bonuses in code golf&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8102/20260&quot;&gt;Digital Trauma wrote an answer&lt;/a&gt; about this, but I have harsher views on bonuses, so I'm posting to let people vote separately.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Bonuses in code golf say things like &quot;-30% of your byte count if your code can handle any number of strings, not just two.&quot; From what I've seen, they range from slightly improving the challenge to seriously harming it. I haven't seen a bonus that totally made a question, but I've seen ones that ruined it. If you do include a bonus, be confident that it makes the question better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Too often bonuses come from avoiding a hard decision about your challenge. Cutting is hard, so you preserve a weaker or extraneous part of the challenge. Or, you can't decide the scope, so you try to have it both ways. The weak parts might be underspecified, poorly received in the Sandbox, tangential to the rest of the task, or make the spec too cluttered. Don't sweep them into a bonus -- delete them without mercy! Conversely, if you do include a bonus, make sure it as at least as strong as the rest of the challenge.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Bonuses are only interesting when they pose a trade-off that could go either way. It's hard to balance, and often a bonus turns out completely unviable or completely mandatory for the language I'm golfing in. A flat bonus (-20 bytes) means much more in a golfing language than Java, and a multiplicative bonus (-30%) depends on the language's degree of boilerplate and its well-suitedness the bonus relative to the main challenge. Sometimes there's no number that works for everything.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When the bonuses are well-balanced, you can have the opposite problem that a golfer needs to write a bunch of different variants of the program to see what's worth in, which becomes exponentially more cumbersome with more and more bonuses.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2016-01-14T20:58:00.163" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8107" PostTypeId="5" CreationDate="2016-01-14T23:55:05.790" Score="0" Body="&lt;p&gt;This tag indicates that the question is specific to new users to the site. Example topics may include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bug reports that only affect low reputation or new users&lt;/li&gt;&#xA;&lt;li&gt;Discussions on how we can attract new users to the site, and make them feel welcome&lt;/li&gt;&#xA;&lt;li&gt;Support questions that ask how to do things that new users are more likely to need to know&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Stack Exchange generally doesn't allow &lt;a href=&quot;https://en.wikipedia.org/wiki/Sock_puppet_account&quot; rel=&quot;nofollow noreferrer&quot;&gt;sockpuppet accounts&lt;/a&gt;. However, creating accounts to test the new users' experience is &lt;a href=&quot;https://meta.stackexchange.com/questions/57682/how-should-sockpuppets-be-handled-on-stack-exchange/57685#57685&quot;&gt;specifically allowed&lt;/a&gt; by Stack Exchange staff members&lt;/p&gt;&#xA;" OwnerUserId="42545" LastEditorUserId="66833" LastEditDate="2021-04-30T20:06:47.510" LastActivityDate="2021-04-30T20:06:47.510" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="8108" PostTypeId="4" CreationDate="2016-01-14T23:55:05.790" Score="0" Body="Indicates that the question is about features and discussions that specifically relate to new users on the site. " OwnerUserId="42545" LastEditorUserId="66833" LastEditDate="2021-04-30T20:06:47.510" LastActivityDate="2021-04-30T20:06:47.510" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="8112" PostTypeId="2" ParentId="8047" CreationDate="2016-01-15T02:30:44.797" Score="75" Body="&lt;h1&gt;Changing the challenge in the comments&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If something was unspecified in your challenge, or if you've decided to make a change to the challenge (Such as to close a loophole), don't just leave a comment. These are often not visible unless you click on the correct button, and will lead to people getting confused.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Instead, edit the challenge to incorporate the change/clarification.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Appropriate solution:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Edit the change/clarification into the question.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2016-01-15T02:30:44.797" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8114" PostTypeId="2" ParentId="2140" CreationDate="2016-01-15T11:23:25.093" Score="0" Body="&lt;h1&gt;Natural Language Calculator&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Background&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;You are working at Wolfram Alpha, when a big fire occurs, wiping out much of the hardware infrastructure, losing much of the code. Now you are assigned to the natural language team working on writing new code for converting natural language to mathematical expressions to be evaluated. You must parse the following commands and even do mixed commands!&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The input will be a string, obviously. For multiple operations, there will be commands within input of commands.&lt;/p&gt;&#xA;&lt;p&gt;Pi and e are simply inputted as &amp;quot;pi&amp;quot; and &amp;quot;e&amp;quot;. Other special numbers are not needed to be handled.&lt;/p&gt;&#xA;&lt;p&gt;Parse the following commands:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Add x and y&lt;/li&gt;&#xA;&lt;li&gt;Subtract x and y&lt;/li&gt;&#xA;&lt;li&gt;Multiply x and y&lt;/li&gt;&#xA;&lt;li&gt;Divide x and y&lt;/li&gt;&#xA;&lt;li&gt;Factorial of x&lt;/li&gt;&#xA;&lt;li&gt;x factorial&lt;/li&gt;&#xA;&lt;li&gt;Exponent base n of x&lt;/li&gt;&#xA;&lt;li&gt;Log base n of x&lt;/li&gt;&#xA;&lt;li&gt;Natural log of x&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You must deal with it case-insensitively. For example &amp;quot;5 Factorial&amp;quot; gives the same result ad &amp;quot;5 factorial&amp;quot; or &amp;quot;5 FAcTorial&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Testcases&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; &amp;quot;Add 4 and 5&amp;quot;&#xA;9&#xA;&amp;gt; &amp;quot;Multiply 6 and 10&amp;quot;&#xA;60&#xA;&amp;gt; &amp;quot;Divide 144 and 12&amp;quot;&#xA;12&#xA;&amp;gt; Exponent base 10 of 3&#xA;1000&#xA;&amp;gt; 3 factorial&#xA;6&#xA;&amp;gt; 3&#xA;&amp;gt; Add 5 factorial and 2&#xA;122&#xA;&amp;gt; Exponent base e of natural log of e&#xA;e&#xA;&amp;gt; natural log of e&#xA;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="34421" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-22T21:34:57.720" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8115" PostTypeId="2" ParentId="2140" CreationDate="2016-01-15T12:38:56.753" Score="0" Body="&lt;h1&gt;Hexotria number&lt;/h1&gt;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69468/ulam-spiral-on-a-triangular-grid#69468&quot;&gt;Triangular Ulam spiral&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For instance we write number in triagular spiralling way&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;      30  10  26  51&#xA;    31  11  09  25  50&#xA;  32  12  01  08  24  49&#xA;33  13  02  00  07  23  48&#xA;  14  03  04  05  06  22&#xA;    16  17  18  19  20&#xA;      39  40  41  42&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Then we read in spiralling hexagonal way (Starting from 0, 1 ,2) then we get&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0, 1, 2, 4, 5, 7, 8, 9, 11, 12, 13, 3, 17, 18, 19, 6, 23, 24, 25, 26, 10, 30, 31, 32, 33, 14, 16, 39, 40, 41, 42, 20, 22, 48, 49, 50, 51&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your challenge is given a number (i) output the i'th item in that sequence. &lt;code&gt;i&lt;/code&gt; is zero based. Shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="46245" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-16T09:02:41.820" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8116" PostTypeId="2" ParentId="2140" CreationDate="2016-01-15T16:47:23.843" Score="1" Body="&lt;h1&gt;Let's play Ticket to Ride!&lt;/h1&gt;&#xA;&lt;p&gt;(Note, this challenge was inspired by the board game &lt;a href=&quot;https://en.wikipedia.org/wiki/Ticket_to_Ride_(board_game)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ticket to Ride&lt;/a&gt;, but is massively simplified to a graph-searching problem).&lt;/p&gt;&#xA;&lt;p&gt;For this challenge, you have a list of cities (nodes), connections (edges), and tickets (&lt;code&gt;[City, City, Point]&lt;/code&gt; tuple).  You also have a limited number of trains, where each connection takes exactly 1 train to fill.  For each ticket you complete (there is a filled-in path between the two cities), you get the ticket's point value.&lt;/p&gt;&#xA;&lt;p&gt;Your goal is to maximize the number of points you get.  For example,  given the following graph:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A-B-C-D&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and two tickets &lt;code&gt;[(A,B)=&amp;gt;1, (B,D)=&amp;gt;2]&lt;/code&gt;, and 2 trains, then you should output &lt;code&gt;(B,C), (C,D)&lt;/code&gt; as that gives you a total of 2 points, because you have created a path from &lt;code&gt;B&lt;/code&gt; to &lt;code&gt;D&lt;/code&gt;, which matches the second ticket.&lt;/p&gt;&#xA;&lt;p&gt;Everybody will be working on the same large graph and set of tickets, so your score is the score of your solution.  &lt;strong&gt;Your solution is a list of filled connections (not the code that generated them, although your code should be included).&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-15T20:06:20.263" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="8117" PostTypeId="2" ParentId="7897" CreationDate="2016-01-15T19:37:59.820" Score="20" Body="&lt;h1&gt;Stack Overflow 404 message&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This comment got some up votes, so let me post it as an answer. Maybe someone will want to incorporate this into their UserScript!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you get a &lt;a href=&quot;https://stackoverflow.com/fdfd&quot;&gt;404 on Stack Overflow&lt;/a&gt;, you see a polyglot. We should have something similar, but instead we show a random code from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/9359/shortest-program-that-throws-stackoverflow-error/&quot;&gt;Shortest program that throws StackOverflow Error&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/21114/weirdest-way-to-produce-a-stack-overflow&quot;&gt;Weirdest way to produce a stack overflow&lt;/a&gt; (with the language name included). Maybe add &quot;We couldn't find your site, but we found this code that causes a stack overflow...&quot; so we don't get in trouble if people test the code out. Polyglots are sort of a PPCG thing, so PPCG should return SO the favor by making our 404 a Stack Overflow!&lt;/p&gt;&#xA;" OwnerUserId="46313" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2016-01-15T19:37:59.820" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8118" PostTypeId="1" CreationDate="2016-01-16T01:30:05.853" Score="10" ViewCount="236" Body="&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7683/increase-reputation-awarded-for-questions&quot;&gt;Increase reputation awarded for questions&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It has recently came to my attention that tag badges are only awarded based on answer votes. For a site like Stack Overflow, that makes sense, as providing good answers is the perfect way to demonstrate that you know what you're talking about in a certain field. However, for this site, writing a good challenge can take a lot of work.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can we get question votes to count along with answer votes toward tag badges? I'm not sure if this is as easily changeable as the amount of reputation awarded for question upvotes but it makes sense for this site.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="68942" LastEditDate="2021-06-09T06:09:38.023" LastActivityDate="2021-06-09T06:09:38.023" Title="Count question score toward tag badges" Tags="|feature-request|status-deferred|challenges|badges|" AnswerCount="0" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8119" PostTypeId="2" ParentId="6918" CreationDate="2016-01-16T04:17:07.837" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/ConorOBrien-Foxx/Jolf/&quot; rel=&quot;nofollow&quot;&gt;Jolf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Jolf&lt;/strong&gt; is yet another JavaScript variant; is procedural, like Pyth. It's GitHub repo was made around Nov. 15. It transpiles to JavaScript.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's a really handy tool, and I use it all the time when coding in JavaScript. Here is the &lt;a href=&quot;http://conorobrien-foxx.github.io/Jolf/&quot; rel=&quot;nofollow&quot;&gt;interpreter&lt;/a&gt;! And &lt;a href=&quot;https://github.com/ConorOBrien-Foxx/Jolf/tree/master/docs&quot; rel=&quot;nofollow&quot;&gt;some documentation&lt;/a&gt;, because you're such a nice person.&lt;/p&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2016-01-16T04:17:07.837" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8121" PostTypeId="1" CreationDate="2016-01-16T23:55:01.080" Score="39" ViewCount="1441" Body="&lt;p&gt;Whereas:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;we are unsure about &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/845/3808&quot;&gt;where exactly we fit into the SE mission&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;others sometimes &lt;a href=&quot;https://meta.stackexchange.com/questions/272956/a-new-code-license-the-mit-this-time-with-attribution-required/272959#comment886759_272959&quot;&gt;don't take us seriously&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;the site has been &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8030/3808&quot;&gt;languishing in beta with minimal communication from SE&lt;/a&gt; for years&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;we have, after receiving &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1192/3808&quot;&gt;explicit advice to expand our horizons&lt;/a&gt;, consistently failed to do so&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I have some questions for you:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Why are you here, aside from &quot;to have fun?&quot; For veteran users: Why do you continue to visit the site? For new users: What brought you here, and what made you stay?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;How do you think PPCG can &quot;fit in&quot; to SE in general more? What benefit can it provide to SE that facilitates SE's ultimate goal?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In what ways do you think we can continue to innovate and expand? How can users who can't or don't want to golf participate on such a &quot;golf-centric&quot; site?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Basically, should PPCG have a more well-defined &lt;em&gt;purpose&lt;/em&gt; as a Stack Exchange site? What should it be (other than &quot;solving tasks / spec writing / etc. is inherently fun&quot;)?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you had thirty seconds to convince a random stranger you met in an elevator (who happens to be a programmer) to join PPCG, what would your &lt;a href=&quot;https://en.wikipedia.org/wiki/Elevator_pitch&quot; rel=&quot;nofollow noreferrer&quot;&gt;elevator pitch&lt;/a&gt; be? What &lt;em&gt;should&lt;/em&gt; it be—how do you want PPCG to change, grow, and expand for the better?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;a href=&quot;https://codereview.meta.stackexchange.com/q/1730/36278&quot;&gt;related&lt;/a&gt; posts &lt;a href=&quot;https://unix.meta.stackexchange.com/q/2668/45600&quot;&gt;on many&lt;/a&gt; many &lt;a href=&quot;https://worldbuilding.meta.stackexchange.com/q/1962/1947&quot;&gt;other&lt;/a&gt; sites &lt;a href=&quot;https://datascience.meta.stackexchange.com/q/9/5&quot;&gt;on the&lt;/a&gt; SE &lt;a href=&quot;https://health.meta.stackexchange.com/q/322/143&quot;&gt;network&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2016-06-03T20:28:33.163" Title="Who are you? Why are you here? And more introspection" Tags="|discussion|site-health|" AnswerCount="15" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8123" PostTypeId="2" ParentId="8121" CreationDate="2016-01-17T02:03:43.703" Score="-7" Body="&lt;h1&gt;Why did I join?&lt;/h1&gt;&#xA;&lt;p&gt;Being an active SE chatter, I noticed that you guys had an active chatroom. I went to check it out and boom! I joined this place. Being not the best programmer, I did not really try out the challenges. However, I did have fun helping with one of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/3578/fortnightly-challenge-ideas?answertab=active#tab-top&quot;&gt;fornightly challenges&lt;/a&gt; (when this was a thing!), the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44707/lab-rat-race-an-exercise-in-genetic-algorithms&quot;&gt;genetic algorithms one&lt;/a&gt;. However, I did not do much until I was back from a long hiatus on SE. By November, I came back and started joining the fun. &amp;quot;And that is my PPCG story&amp;quot; (like those advertisements and Twitter discussions! :P).&lt;/p&gt;&#xA;&lt;p&gt;Why am I here? Because it is fun! But more importantly, it has taught me a thing or two about programming. While golfing is not something to do for professional programming, I have been able to practice my programming skills and use my brain once in a while code. I have even learned about a new paridgm of programming know as stack-based programming. I certainly do think that being here improved my programming skills.&lt;/p&gt;&#xA;&lt;h1&gt;Fitting in&lt;/h1&gt;&#xA;&lt;p&gt;What is SE's goal? It is to help as many people find the knowledge they need. Currently, our community is not helping people directly. However, let us think about what we do here. We solve programming challenges. That is our community's purpose. To write programming challenge and solve them. How does this help others? Well, it helps others practice their programming skills (except the Code Review guys do the same!). In fact, the person answering the questions, which happen to be challenges, are helping themselves! It also can help others who visit this site to find ideas for more practical tasks.&lt;/p&gt;&#xA;&lt;p&gt;When I originally joined, I was really interested in neural networks, and still am. I wanted to write up a neural network. But I really wasn't sure where to start. I thought maybe I could find some well written code over here and even if it was golfed, there would probably be an explanation with it. I could not find anything so I decided to make a neural network challenge. So I was told by others to write up a challenge where neural networks would be a way of solving it. To this today, the challenge is still in the Sandbox (because I am very lazy!) but the point is, you could be helping others write code and solving programming problems.&lt;/p&gt;&#xA;&lt;p&gt;The ingenious ideas people come up with in is community is very important and is an important contribution. People would definitely like using such code. However, golfed code isn't very useful for programming. Which lease me to the third and last question.&lt;/p&gt;&#xA;&lt;h1&gt;Golfing&lt;/h1&gt;&#xA;&lt;p&gt;We should place less importance on golfing. Golfing code has no use in regular programming. In fact, my coding habits were bad to begin with. but being on this website, it has made it worse because I keep golfing my code. If we want to help others who visit this site to solve programming problems with our answers, we need to show them code that makes sense, that looks professional, that is modular. This is not possible with code golf challenges.&lt;/p&gt;&#xA;&lt;p&gt;Because of the emphasis of code golf in our community, people think this is a joke site. I mean, when we even have &amp;quot;Code a Golf&amp;quot; in our community name, why blame them? I think we need to keep &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; as more of a side activity, something for fun. More important types of challenges should be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;. For the former, depending on the scoring criteria, good, developed code can win, and that is what we want. For the latter, good code also wins because people will like it, meaning upvote. So I think we should move the focus away from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and towards the other two.&lt;/p&gt;&#xA;&lt;h1&gt;Purpose&lt;/h1&gt;&#xA;&lt;p&gt;I think the purpose should simply be, &amp;quot;to help empower programmers through challenges&amp;quot;. It kind of fits our community better into the SE goal of helping people through Q&amp;amp;A, as I already described.&lt;/p&gt;&#xA;&lt;h1&gt;Elevator Pitch&lt;/h1&gt;&#xA;&lt;p&gt;&amp;quot;Programming Puzzles and Code Golf is a place where you can solve fun programming puzzles and challenges. Come and join the fun, and empower your programming skills as Programming Puzzles and Code Golf&amp;quot;&lt;/p&gt;&#xA;" OwnerUserId="34421" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-17T05:10:00.413" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8125" PostTypeId="2" ParentId="8121" CreationDate="2016-01-17T02:04:42.287" Score="13" Body="&lt;p&gt;PPCG was my first Stack Exchange site I signed up for and remains the one I'm most active on by far (I have over 8x more reputation here than all other sites combined, not counting association bonuses). I've dabbled in other SE sites, but I always come back to here. Why?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't remember when I discovered PPCG, nor how, but the first question I remember was &lt;a href=&quot;https://codegolf.stackexchange.com/q/33172/29750&quot;&gt;American Gothic in the palette of Mona Lisa: Rearrange the pixels&lt;/a&gt;. At this point, I was new to programming and certainly had never golfed code. The more impressed I became with the amazing solutions to that challenge and others, the more I thought, &lt;em&gt;How will I ever be good enough to answer a challenge?&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I waited. I looked at other users' code, particularly JavaScript, which I knew best. &lt;a href=&quot;https://codegolf.stackexchange.com/a/35050/29750&quot;&gt;The first answer I posted&lt;/a&gt; was straightforward, but I was amazed by the feedback I received. Besides the upvotes (I'm sure you can remember the thrill of your first reputation gained), I was impressed with the suggestions other users offered to me.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As funny as it may sounds to a cynical outsider, code golfing has substantially improved my programming skill, from learning obscure features of a language to considering different algorithms. &lt;strong&gt;I believe PPCG is uniquely beneficial to any new programmer.&lt;/strong&gt; It provides short, fun challenges to solve; free feedback from experienced coders; and, most importantly, freedom from worrying about best practices and style. While they are important, a new user should be getting to know the language instead of stressing over perfect comments and indentation.&lt;/p&gt;&#xA;" OwnerUserId="29750" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-03-19T00:39:28.687" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8127" PostTypeId="2" ParentId="8121" CreationDate="2016-01-17T04:24:35.387" Score="26" Body="&lt;h2&gt;Who are you?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Hi there! I'm Alex. I'm &lt;s&gt;a moderator &lt;em&gt;pro tempore&lt;/em&gt;&lt;/s&gt; an elected moderator on this site.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Why are you here?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;What brought me here&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once upon a time I was working on a project for my job that involved learning a new programming language. However, no one at the company knew that language, so I had no one to go to for questions. So I joined Stack Overflow.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My participation on Stack Overflow steadily increased and I became completely hooked on the Stack Exchange network. One day (14 December 2014, to be specific), while looking at an R question on Stack Overflow, I noticed a post called &lt;a href=&quot;https://codegolf.stackexchange.com/q/42529/20469&quot;&gt;Most common number&lt;/a&gt; on the Hot Network Questions sidebar, from some site called &quot;Programming Puzzles &amp;amp; Code Golf.&quot; So I took a look at the question. &quot;I know how to do this,&quot; I thought to myself, &quot;this is just asking to find the mode of a list. Easy peasy, lemon sqeezy.&quot; So I made an account on the site and posted &lt;a href=&quot;https://codegolf.stackexchange.com/a/42550/20469&quot;&gt;my answer&lt;/a&gt;. &quot;Alright, that was fun,&quot; I thought. &quot;Well, back to Stack Overflow.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A few days passed and I found myself checking out Programming Puzzles &amp;amp; Code Golf again. I answered. More days passed, I posted a couple more answers. I wasn't actively engaged, but I was having fun writing short code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My activity on the site gradually picked up. And then it &lt;em&gt;really&lt;/em&gt; picked up. I became &lt;em&gt;addicted&lt;/em&gt; to writing short code. Code golf went from being a casual little activity I'd do occasionally to an actual passion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Why I'm still here&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;What sparked that passion?&quot; you may ask. Well, I'm a naturally curious person and I love problem solving. Solving a programming challenge is nice! But what &lt;em&gt;really&lt;/em&gt; got me into it was learning more about my favorite languages to find clever methods for getting the most out of every character in the code. Indeed, I've learned more about my favorite languages by golfing than I ever have from work, school, or anything else.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And now here we are. I've visited the site for 335 consecutive days (and counting) and I was appointed as a moderator on this most wonderful of sites in August of 2015. I can hear you saying, &quot;Good lord, 335 consecutive days?! WHY?!&quot; Well, it's fun! But it's more than that. It's &lt;em&gt;instructive&lt;/em&gt;. I can't recall a single one of these past 335 days where I &lt;em&gt;haven't&lt;/em&gt; come across something new and exciting on the site.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Our place in the Stack Exchange network&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It's no secret that we're kind of a black sheep in the Stack Exchange network. While the other sites are for questions and answers, ours is for challenges and solutions. That's not to say that this isn't a good home for us though! Consider this excerpt from the &lt;a href=&quot;http://stackexchange.com/about&quot;&gt;&quot;about&quot; page&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Founded in 2008 by Joel Spolsky and Jeff Atwood, the company was built on the premise that serving the developer community at large would lead to a better, smarter Internet.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Are we serving the developer community? &lt;em&gt;ABSOLUTELY!&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We provide a different kind of service to developers: A place for them to stretch their brain by solving new and varied tasks, and to hone their programming skills by learning how to shorten their code. I would call this &lt;strong&gt;our purpose&lt;/strong&gt; as a Stack Exchange site.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The role of code golf on this site&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In my opinion, code golf is what makes the site what it is. It's what makes us unique. We compete with sites like &lt;a href=&quot;https://reddit.com/r/codegolf&quot; rel=&quot;nofollow noreferrer&quot;&gt;r/codegolf&lt;/a&gt; and &lt;a href=&quot;http://golf.shinh.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;Anarchy Golf&lt;/a&gt; to be the go-to place for code golf.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code golf isn't &lt;em&gt;all&lt;/em&gt; we are; we have other challenge types based on a variety of scoring mechanisms. But it's our bread and butter.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;How we can innovate&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I don't think that deviating from our golf-centric roots is necessarily the answer. However, I think we can continue to innovate by making a concerted effort to find new, intellectually stimulating problems and formulating them into challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've been pondering a way to include a challenge type for those who want to participate but don't want to golf. I don't think popularity contests are the answer. Perhaps we can find new scoring mechanisms for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;s that have a lower barrier to entry than code golf. While something like a &quot;free code&quot; challenge (i.e. post whatever you want as long as it solves the problem) might draw a lot of varied traffic, I think it would go against the our rules of objectivity that we've worked hard to build and enforce.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Our elevator pitch&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is what I usually tell people:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Code golf is a type of programming challenge where you solve a task with the shortest amount of code possible. CodeGolf.SE is a site on the Stack Exchange network for posing and competing in these challenges.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Note how I only mention code golf. This is because, as I said, it's what makes us unique. I could say we're a site for programming challenges, but what is some rando in an elevator going to remember, &quot;generic programming challenges&quot; or &quot;shortest code to solve a challenge&quot;?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Going forward&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I think if we can continue to bring good, fresh content to the site, we'll continue to thrive. But I know that whatever the future brings for our little site, I want to be a part of it.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-06-03T20:28:33.163" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8129" PostTypeId="2" ParentId="8121" CreationDate="2016-01-17T05:45:08.837" Score="6" Body="&lt;h1&gt;Why are you (still) here?&lt;/h1&gt;&#xA;&lt;p&gt;I enjoy the mathematical/theoretical side of this site.  People here are &lt;em&gt;much&lt;/em&gt; smarter than I, and I enjoy learning about the latest OEIS sequence, or the best algorithm to fit &lt;a href=&quot;https://codegolf.stackexchange.com/questions/52496/uniquely-separated-pixels&quot;&gt;uniquely distanced pixels&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;With that, I enjoy the game theory behind the many KoTHs here.  I really enjoy coming up with new ideas for KoTHs (more than I'll likely ever be able to run).  In fact, the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/25347/survival-game-create-your-wolf&quot;&gt;Create your own Wolf&lt;/a&gt; was the very first challenge I ever saw on this site, leading to becoming a regular.&lt;/p&gt;&#xA;&lt;h1&gt;How can PPCG fit in better?&lt;/h1&gt;&#xA;&lt;p&gt;Perhaps I'm biased here, but I feel like all of these one-off golfing challenges don't provide much.  They keep the site active (which is super important), but they don't feel like real &amp;quot;content&amp;quot; to me.  SE is committed to being a knowledge warehouse, but I simply don't see &amp;quot;Draw this ascii house&amp;quot; really being knowledge that anybody wants to have.&lt;/p&gt;&#xA;&lt;p&gt;Challenges that cover new ground is really what we need.  It's really hard to come up with such challenges, but we have to do it.&lt;/p&gt;&#xA;&lt;p&gt;One other point here:  Golfing languages.  They are really cool and all, but they don't communicate knowledge very well.  Users are often pretty good about explaining what the code is doing, but it still makes it hard for new users to really learn and get excited.  Not sure of a good solution.&lt;/p&gt;&#xA;&lt;h1&gt;How do we grow into other &amp;quot;non-golf&amp;quot; areas?&lt;/h1&gt;&#xA;&lt;p&gt;This is basically my goal.  Only my most &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69541/brass-fingerings&quot;&gt;recent challenge&lt;/a&gt; is really about golfing, and even then, its about data compression.&lt;/p&gt;&#xA;&lt;p&gt;Currently, if somebody posts an interesting challenge (one that would expand our site), the default is to make it &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.  However, a lot of these challenges should really be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, but the OP doesn't want to run all of the submissions (it &lt;em&gt;is&lt;/em&gt; a big commitment).  We get around that by having &amp;quot;must run under a minute&amp;quot; requirements, or GOLF CPU, or other &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; possibilities.&lt;/p&gt;&#xA;&lt;p&gt;If we could get a actual server that would run all submissions &lt;em&gt;and&lt;/em&gt; it becomes the norm, then I feel like we would see a large amount of growth here.  We need to be more than just golfing!&lt;/p&gt;&#xA;&lt;h1&gt;Do we need a more well-defined purpose?&lt;/h1&gt;&#xA;&lt;p&gt;Yes.  We need to be a site that teaches people how to be clever with their code.  We aren't writing clean code, that's the job of &lt;a href=&quot;http://codereview.stackexchange.com&quot;&gt;Code Review&lt;/a&gt;.  We all love the process of learning about things you didn't know you could do in your favorite language, but we aren't finding as many &amp;quot;clever&amp;quot; ways lately.&lt;/p&gt;&#xA;&lt;h1&gt;Elevator pitch&lt;/h1&gt;&#xA;&lt;p&gt;I usually talk about the latest KoTH I've done, and try to get them to submit a submissions.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-17T05:45:08.837" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8130" PostTypeId="1" AcceptedAnswerId="8135" CreationDate="2016-01-17T14:39:18.623" Score="17" ViewCount="3838" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/564/should-we-consider-dropping-or-modifying-the-objective-winning-criteria-requir&quot;&gt;2 years ago, we discussed&lt;/a&gt; dropping the objective winning criterion requirement.  No consensus was really reached.  I'd really like to start that conversation again, as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8129/20198&quot;&gt;I feel&lt;/a&gt; like it is hindering our growth into a more comprehensive site.&lt;/p&gt;&#xA;&lt;h2&gt;What advantages/disadvantages are there to having objective winning criteria?&lt;/h2&gt;&#xA;&lt;p&gt;I'll list the ones that I personally see:&lt;/p&gt;&#xA;&lt;h3&gt;Disadvantages&lt;/h3&gt;&#xA;&lt;p&gt;The primary problem I see is that it &lt;strong&gt;hinders challenges that are looking for efficient solutions or (for particularly tough challenges) any solution at all&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Most of the time, we get around the problem by simply making the challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, and adding time restrictions.  Ideally, the problems would be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, but because we have this &amp;quot;objective winning criterion&amp;quot;, the user needs to commit to running the code themselves.&lt;/p&gt;&#xA;&lt;h3&gt;Advantages&lt;/h3&gt;&#xA;&lt;p&gt;It helps us identify and close off-topic questions.  We still need answers that work towards a single goal.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Side note:&lt;/strong&gt; I'm not looking to poll the community as to whether we should actually remove it, but I am looking for a discussion about it.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="56656" LastEditDate="2021-11-21T03:23:06.763" LastActivityDate="2021-11-21T03:23:06.763" Title="Why do we have objective winning criteria?" Tags="|discussion|faq|winning-criteria|" AnswerCount="3" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8131" PostTypeId="2" ParentId="8121" CreationDate="2016-01-17T15:39:45.297" Score="18" Body="&lt;h2&gt;Who are you?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm the most active old-timer. I created my account on PPCG a week after the first question was posted. Previously I had participated for about a month on the CS Theory site.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Why are you here?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I've been both programming and doing mathematics as recreational activities since I was a child, and I find that PPCG is a good source of intellectual stimulation.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;How can PPCG fit into SE?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;That depends on what you see SE's goal as. If it's just a place to share knowledge, then we can't fit, because this site is about creating new things rather than explaining things we've learnt from others. But if, as far as the programmer-related sites are concerned, it's about enabling programmers to develop their abilities, PPCG provides:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A source of (ideally well-specified) simple programming tasks which people can borrow as katas without any need to contribute back to the community.&lt;/li&gt;&#xA;&lt;li&gt;Objectives which force you out of your usual thinking patterns and broaden your mind.&lt;/li&gt;&#xA;&lt;li&gt;Feedback and interaction which other golfing sites don't have.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;What about non-golfers?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I see three reasons why &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is the predominant winning criterion:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The original purpose of the site was to provide a new home for the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; questions which were no longer welcome on Stack Overflow as a result of that site's narrowing of scope. (Other sites in the network - e.g. Programmers - were also spun off in a similar way). There's an inertia.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is great at differentiation. Other winning criteria suffer from having too few distinct scores. E.g. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt; will nearly always need a tie-breaker.&lt;/li&gt;&#xA;&lt;li&gt;It's the most recreational criterion. Optimising for running time is something that a lot of programmers do as a matter of course in their day jobs. Golfing is anathema in production code, so it's fun to break with the norm. (See also my second point in the previous section).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Of these, the first is purely historical; the third is a minor barrier to having a significant number of non-golf questions; and the second is the one which provides the greatest challenge to making the site attractive to non-golfers. Writing an interesting &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; which differentiates well (i.e. avoiding the case where all of the answers take under 1 second) but isn't too heavy (i.e. all of the answers take over 1 hour, so iterative improvements to your code are slooooow) is not easy. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; takes a lot of investment, and we've seen in some cases that the OP just drops out and lets it die because it's too much effort to run.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want specific ideas, we could combine the core concepts of the &lt;a href=&quot;/questions/tagged/puzzle-push&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle-push&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle-push&lt;/a&gt; and the &quot;Best Of&quot; and designate a fortnight for a particular emphasis on non-golf questions. I would suggest giving advance notice of a week so that people can sandbox their questions, and politely asking people whose questions normally hit the HNQ to hold them for after the push, because HNQ is probably our most effective advertising. Then at the end of the fortnight we could vote a winner on meta, and offer a bounty or two on winning questions to attract more attention.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Elevator pitch&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;PPCG is a site where we challenge each other to optimise code against unusual criteria. As intellectual stimulation, it beats sudoku hands down.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2016-01-17T15:39:45.297" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8132" PostTypeId="2" ParentId="8130" CreationDate="2016-01-17T15:40:35.180" Score="10" Body="&lt;p&gt;It is hard to discuss advantages and disadvantages of such a radical change; it completely changes the scope of the site. Right now, this site holds programming contests, meaning that we don't just try to solve a problem with a specific goal, but we compete against others that try to do the same.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Removing the objective winning criterion requirement and simply asking for &quot;an efficient implementation&quot; means that we're no longer looking at a competition, since there is no way to compare submissions. While that may be helpful to someone who is trying to solve a problem, solving people's problems is not what this site is about.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Re: disadvantages&lt;/h3&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;[I]t hinders challenges that are looking for efficient solutions[.]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It shouldn't.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yes, most plain &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; questions require an additional effort from the OP (other just use an online platform for timing), but there are other options. We have &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/golf-cpu&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;golf-cpu&amp;#39;&quot; rel=&quot;tag&quot;&gt;golf-cpu&lt;/a&gt;, which means the competitor can time the submission himself, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;, which requires no timing at all.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;[I]t hinders challenges that are looking for [...] any solution at all.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That is by design, and not at all a problem in my opinion. Searching for any solution at all means that we don't have a competition anymore.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yes, there are problems that are interesting and tough enough on their own without trying to come up with a particularly short or particularly fast solution, but just because something is interesting doesn't mean it should be on topic here.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Subjective winning criteria&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Subjective winning criteria (i.e., author's choice) could be perceived as a middle ground between objective winning criteria and no winning criteria at all, but it's virtually no different from the latter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a competitor has several solutions, without knowing precisely what to aim for, he cannot choose which of his solutions he should submit. For the same reason, I'm not a big fan of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Simply letting the OP choose which answer should take the crown makes us no different from other programming Q&amp;amp;A sites. This isn't growth, it's losing our identity.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2016-01-17T15:40:35.180" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="8134" PostTypeId="2" ParentId="8047" CreationDate="2016-01-17T21:47:02.947" Score="28" Body="&lt;h2&gt;Popularity Contests&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/tags/popularity-contest/info&quot;&gt;Popularity contests&lt;/a&gt;, while allowed, are heavily disfavored by site culture. You're likely better off reworking your challenge to use an &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/305/20260&quot;&gt;objective winning criterion&lt;/a&gt; that isn't votes, such as &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;code golf&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/tags/fastest-code/info&quot;&gt;fastest code&lt;/a&gt;. That is, unless you're an experienced user who knows when to disregard such advice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest?sort=newest&amp;amp;pageSize=15&quot;&gt;last 15 pop-cons as of writing, 11 have been closed&lt;/a&gt;. If you're a newish user, chances are yours will be too. I'm not claiming bias, but that one needs a very good feel of the community to navigate the minefield of pop-cons, and that takes time to develop.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Most pop cons are closed as &quot;too broad&quot; for having &quot;too many possible answers&quot;. Saying &quot;do [simple task] in a creative way&quot; won't cut it -- pop-cons needs an exact, specific task that is hard to solve, and whose solutions can be further evaluated by human criteria.  Even with this, I'd advise new-ish users to avoid pop-cons altogether, since it's easy to mess up and might be closed or downvoted anyway. &lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-01-17T21:47:02.947" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8135" PostTypeId="2" ParentId="8130" CreationDate="2016-01-17T21:50:36.360" Score="38" Body="&lt;p&gt;Dennis's answer touches upon this, but I wanted to write a separate answer to make it more explicit:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Objective scoring is &lt;em&gt;essential&lt;/em&gt; to drive competition, and competition inspires creativity.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is how a challenge works that doesn't have objective scoring: you come up with a solution that is valid, and may or may not do reasonably well. You think about how you can improve its quality (whatever &quot;quality&quot; means in that case), and if you can, you do. At some point you'll think &quot;yeah that looks reasonably good, I'll go with this&quot;. And that's the end of it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is how a challenge works that has an objective scoring: you come up with a solution that is valid, and may or may not do reasonably well. However, you have a pretty good idea how you can or cannot improve that score, and if you can, you do. At some point you'll think &quot;yeah that looks reasonably good, I'll go with this&quot;. But then you'll see the other participants' scores and notice that you're only a few &quot;points&quot; behind (whatever those are in the specific challenge). And suddenly you've got a very specific goal: come up with something to beat the other score. That's a tangible goal and a motivation to try new things, and it eliminates the problem of thinking &quot;yeah I think this is as good as it can be&quot; before that's really the case.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And the interesting thing that the score alone is enough to create this motivation - there doesn't even need to &lt;em&gt;be&lt;/em&gt; competition. As soon as you've got a score, you've got your &lt;em&gt;own&lt;/em&gt; score to beat. This applies a) when your solution is the only solution to the challenge (so far), b) your solution has such a bad score that it's nowhere near competitive (e.g. because you're participating in a code golf with C#), or c) your solution is by far the best solution already and none of the other submissions currently provide any real competition.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A recent example of that would be &lt;a href=&quot;https://codegolf.stackexchange.com/a/31863/8478&quot;&gt;jimmy23013's mad golfing session&lt;/a&gt; to shorten his self-matching regex. There is currently no competition on that challenge, but the desire to find an even shorter solution has been enough to come up with ever new approaches (5 or 6 and counting), and explore different solutions, which has also led to a much more elegant solution in the end. If the challenge hadn't been code golf, I'm pretty sure the answer would have remained as the first working solution. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although the code golf aspect (as an example, since it's our most common challenge type) is often orthogonal to the actual problem at hand, it's what drives us to think outside the box and look into new approaches to the given problem, because &quot;just any solution&quot; isn't good enough.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I compare this to Project Euler, which is essentially a site that hosts similar (although harder) programming challenges without a scoring/winning criterion, I always move on to the next problem once I've found a solution to one of them. Especially, on problems that happen to be just feasible with a naive approach, I don't learn anything from them, because there's no motivation to look at the problem from any possible angle.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, not having any scoring at all is the extreme opposite. There's also the option of having subjective winning criteria as Dennis mentioned. But that isn't any better: if I can't directly measure the the quality of my solution, and compare it against other solutions on a fixed scale, how do I know that another approach will actually improve my solution? In the end, I'll still think &quot;yeah this looks good, I hope the OP likes it better than the other solutions&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All in all, I think people who look down on code golf overestimate the importance of the specific winning criterion at hand. It's just that code golf works particularly well, because it's easy to measure, easy to compare, provides a wide variety of potential scores, and cannot be gamed (save for exploiting loopholes). But in the end, amazing code golf solutions aren't amazing because they're short, but because the author really looked into the problem from all angles and came up with a novel approach that blew everyone's mind. (This also means that the &quot;best&quot; (subjective) answer around here isn't always the shortest, but more often than not the striving for shortness is what inspired the answer.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, I can understand if people would like to see other &lt;em&gt;objective&lt;/em&gt; winning criteria being more prominent, or things like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; being easier to run on this site. And I'm all up for not being a pure code golf site, exploring new (objective) scoring systems, and doing more generic &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenges&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenges&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenges&lt;/a&gt;. But being objective is most important trait of any of those challenges, because without that, I'm sure many of us would lose the motivation to spend as much time on a single problem as we do sometimes.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-01-17T22:26:18.187" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8138" PostTypeId="2" ParentId="2140" CreationDate="2016-01-18T02:42:28.067" Score="1" Body="&lt;h1&gt;Risk dice battle&lt;/h1&gt;&#xA;&lt;p&gt;Risk is a board game in which you attempt to conquer the world by attacking your opponents' countries. As the game progresses the number of armies involved in attack gets higher and higher, which can lead to a lot of dice rolling. I want you to make this easier for me. It's possible that my favourite answer will actually get used when playing Risk.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules of Risk battles&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Each country in Risk must have at least one army on it. Therefore a battle can only take place if the attacker has more than one army (in case he loses.) The defender obviously has at least one army.&lt;/p&gt;&#xA;&lt;p&gt;The attacker rolls 3 dice (only 2 if he has only 2 armies) while the defender rolls 2 dice (only 1 if he has only 1 army.) Once the dice are rolled, the highest dice of each player are compared, then the next highest. (If one player rolled more dice than the other, his lowest dice are discarded.)&lt;/p&gt;&#xA;&lt;p&gt;For each dice comparison, the player with the lower score loses an army. If the dice are the same, the defender wins and the attacker loses an army. Note that this does not necessarily put the attacker at the disadvantage, as he frequently has more dice to roll than the defender.&lt;/p&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;               Attacker 6 3 2&#xA;               Defender 5 4&#xA;                        ^ ^&#xA;                        | |&#xA; Defender loses 1 army -+ +-Attacker loses 1 army&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For interest the probabilities are as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;                        Defender rolls 2 dice       Defender rolls 1 die&#xA;                        --------------------------------------------------- &#xA;Attacker rolls 3 dice   Attacker loses 2 29.26%     Attacker loses 1 34.03%&#xA;                        Both lose 1      33.58%     Defender loses 1 65.97%&#xA;                        Defender loses 2 37.17%&#xA;&#xA;Attacker rolls 2 dice   Attacker loses 2 44.83%     Attacker loses 1 42.13%&#xA;                        Both lose 1      32.41%     Defender loses 1 57.87%&#xA;                        Defender loses 2 22.76%&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Task&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A &lt;strong&gt;full program&lt;/strong&gt; is required which will accept from stdin or commandline, a number of attacking armies and a number of defending armies. There will be at least 1 army of each. Your code will display the number of armies as follows&lt;/p&gt;&#xA;&lt;p&gt;1.If there is only 1 attacking army, your program shall immediately terminate with the message &lt;code&gt;Insufficient force.&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;2.The code shall now accept a user input &lt;strong&gt;from stdin&lt;/strong&gt;. If the user now enters anything other than an empty string, the code shall terminate. If the user enters an empty string, you must simulate the roll of the appropriate number of dice, sort each player's dice in descending order, and report the result and the updated number of armies per example below. 2 trailing newlines are required after the output.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Attacker dice: 5 3 1&#xA;Defender dice: 5 4&#xA;&#xA;Attacker: p armies (where p is the number of attacking armies)&#xA;Defender: q armies (where q is the number of defending armies)&#xA;(2 trailing newlines)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;3.If either player now has 0 armies, display the message &lt;code&gt;Defender defeated!&lt;/code&gt; or &lt;code&gt;Attacker defeated!&lt;/code&gt; as appropriate and terminate the program. Similarly, if the attacker now has only 1 army, terminate with the message &lt;code&gt;Insufficient force.&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;The program shall now loop back to step 2 and continue until either one player's armies are depleted or the user enters a non-empty string.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The distribution of the dice throws shall be exactly as with real dice (up to the limits of uniformity both the dice and the random number generator used.) It is expected that most submissions will generate the numbers for each die and then sort them. Clever submissions that generate the output in other ways avoiding the sorting step are acceptable, but the theoretical probability distribution of the output must be identical to the real dice throws. (For example it is permissible to precalculate and presort all 216 possible throws of 3 dice and select one of these at random.)&lt;/p&gt;&#xA;&lt;p&gt;Due to the real time nature of the application a full program is required, with input from stdin (enabling the user to run quick fire battles by reviewing the output and pressing the return key.)&lt;/p&gt;&#xA;&lt;p&gt;Formatting of output strings and newlines shall be exactly as described above. Up to 2 additional symbols (but not alphanumerics) are acceptable between and around numbers. For example &lt;code&gt;[3,2,1]&lt;/code&gt; is an acceptable way of displaying the roll of 3 dice.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is code golf. Shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;(example output to be added)&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-18T08:14:44.613" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8140" PostTypeId="2" ParentId="2140" CreationDate="2016-01-18T12:17:26.783" Score="2" Body="&lt;h1&gt;Polyphonic Pitch Detection&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Tags:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sandbox Notes&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Still in progress. I haven't made any of the test cases or snippets yet.&lt;/li&gt;&#xA;&lt;li&gt;I'm not sure what to tag this as. It doesn't quite fit the definition of any existing tags. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; maybe?&lt;/li&gt;&#xA;&lt;li&gt;I'm thinking of making a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8236/46855&quot;&gt;monophonic version of this challenge&lt;/a&gt; as a precursor to this one, since monophonic pitch detection is &lt;em&gt;much&lt;/em&gt; easier and this one may be too difficult for most to attempt. Also note that monophonic would have more of an emphasis on perfecting an algorithm, rather than getting it to work at all.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Take an array of samples, and output the frequencies of the waveforms found in the samples.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Despite how simple this may sound, it is actually quite difficult. Even though it has been researched for almost a century, a robust and versatile algorithm for polyphonic pitch detection is yet to be found. Let's look at a simple waveform as an example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/XxOqf.png&quot; alt=&quot;440hz Sine Wave&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;(The X-axis is in 1/440ths of a second, use the &lt;em&gt;&quot;Play Samples&quot;&lt;/em&gt; snippet below to hear what it sounds like)&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a 440hz sine wave. In musical terms, it is middle A or A4. The next image is a 554hz sine wave (or C#5) on top of the 440hz wave:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/g2sDB.png&quot; alt=&quot;554hz Sine Wave&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It looks exactly the same, except slightly &quot;squashed&quot; (and sounds a bit &quot;higher&quot;). It is a major 3rd above A4, which means they sound pleasant when played together, however when you look at the waveform that adding them together creates:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/SMiMv.png&quot; alt=&quot;440hz Sine Wave + 554hz Sine Wave&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The resulting waveform appears vastly different. To further complicate matters, it changes shape depending on the time. There are other factors like &lt;a href=&quot;https://en.wikipedia.org/wiki/Overtone&quot; rel=&quot;nofollow noreferrer&quot;&gt;overtones&lt;/a&gt;, background noise and the fact that real-world waveforms are more complex than sine waves which also make it tricky. (But the human brain still manages to do this effortlessly!)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Your Task&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Receive a list of samples as signed 16-bit integers at a fixed sample-rate of 44100 samples-per-second. The input waveform will contain between 1 and 5 (inclusive) simultaneous frequencies in the range of 100hz to 2000hz.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must output a list of frequencies detected (in hertz) with up to 2 decimal places of precision.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each test case is on it's own line. Each line begins with the name of the test case, followed by a semi-colon (&lt;code&gt;;&lt;/code&gt;), then the frequencies present in the test case (accurate to 2 decimal places) separated by commas (&lt;code&gt;,&lt;/code&gt;), followed by another semi-colon, then the samples separated by commas:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Test Case Name;123.45,67.8,90.12;3,75,1234,56789,4321,-23,-408,-9266,41,0,etc...&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each test case will be exactly 44100 samples (1 second) long.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(link to test case file, will include synthesized waveforms, real instrument sounds, multiple instrument/waveform types, a variety of harmonies and pitches, combinations of each of these)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The score of a submission is a percentage based on how close the submission's results are to the actual frequencies of each test case. Specifically it will calculated using the formula in the snippet below (use this to calculate your score):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(snippet for calculating score)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No built-ins that detect pitch or extract waveform frequencies are allowed.&lt;/li&gt;&#xA;&lt;li&gt;Helper functions that are designed to aid frequency analysis like &lt;a href=&quot;https://en.wikipedia.org/wiki/Fast_Fourier_transform&quot; rel=&quot;nofollow noreferrer&quot;&gt;FFT&lt;/a&gt; are permitted.&lt;/li&gt;&#xA;&lt;li&gt;You may optimise your solution for the test cases, but you cannot hard-code the results for these specific test cases.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Play Samples&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You can hear what certain frequencies or a list of samples sounds like by pasting them into this snippet (requires a browser that supports the Web Audio API):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;document.write('Enter frequencies separated by commas: &amp;lt;input type=&quot;text&quot; ' +'id=&quot;Frequencies&quot; value=&quot;440,554&quot;&amp;gt;&amp;lt;br&amp;gt;' +'&amp;lt;button id=&quot;Play&quot; onclick=&quot;togglePlay()&quot;&amp;gt;Play&amp;lt;/button&amp;gt;&amp;lt;br&amp;gt;' +'Paste the whole test case line here: &amp;lt;input type=&quot;text&quot; id=&quot;Test&quot;&amp;gt;&amp;lt;br&amp;gt;' +'&amp;lt;input type=&quot;checkbox&quot; id=&quot;Loop&quot;&amp;gt; Loop?&amp;lt;br&amp;gt;' +'&amp;lt;button id=&quot;PlayTest&quot; onclick=&quot;togglePlayTest()&quot;&amp;gt;Play&amp;lt;/button&amp;gt;');var position = 0,samples = null,sampleSize = 0xffff + 1,halfSampleSize = sampleSize / 2,bufferSize = 4096,sampleRate = 44100,context = new AudioContext(),processor = context.createScriptProcessor(bufferSize, 1, 1),oscillators = null;processor.connect(context.destination);processor.onaudioprocess = function(e) {var buffer = e.outputBuffer.getChannelData(0);if(samples) {var sampleLength = samples.length,loop = Loop.checked;for(var i = 0; i &amp;lt; bufferSize; i++) {position += sampleRate / context.sampleRate;if(loop) position %= sampleLength;buffer[i] = ~~samples[position | 0] / halfSampleSize;}if(position &amp;gt;= sampleLength) togglePlayTest();}else buffer.fill(0);};function togglePlayTest() {if(samples) {samples = null;PlayTest.textContent = &quot;Play&quot;;}else {var parts = Test.value.split(&quot;;&quot;);if(parts.length &amp;gt; 1) {PlayTest.textContent = &quot;Stop - &quot; + parts[0] + &quot; (&quot; +parts[1].split(&quot;,&quot;).map(function(f) { return f + &quot;hz&quot;; }).join(&quot;, &quot;) +&quot;)&quot;;samples = parts[2].split(&quot;,&quot;).map(function(n) { return +n; });position = 0;}}}function togglePlay() {if(oscillators) {oscillators.forEach(function(o) { o.stop(); });oscillators = null;Play.textContent = &quot;Play&quot;;}else {oscillators = [];var frequencies = Frequencies.value.split(&quot;,&quot;),gain = context.createGain();gain.gain.value = 1 / (frequencies.length + 1);gain.connect(context.destination);frequencies.forEach(function(frequency) {var oscillator = context.createOscillator();oscillator.frequency.value = frequency;oscillator.connect(gain);oscillator.start();oscillators.push(oscillator);});Play.textContent = &quot;Stop&quot;;}}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Links&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Multiple_signal_classification&quot; rel=&quot;nofollow noreferrer&quot;&gt;MUSIC Algorithm&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.vtvt.ece.vt.edu/research/references/uwb/ranging_mobile_location/esprit.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;ESPRIT Algorithm&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://audition.ens.fr/adc/pdf/2002_JASA_YIN.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;YIN Algorithm&lt;/a&gt; (monophonic pitch detection)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="46855" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2016-01-31T11:58:21.523" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8142" PostTypeId="2" ParentId="8084" CreationDate="2016-01-18T14:10:33.687" Score="4" Body="&lt;h2&gt;Objectivity gets mixed up with other aspects&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Several different factors affect whether a popularity contest is welcomed here, not just objectivity. Trying to discuss these factors all at once causes confusion, and the debate becomes cluttered. Let's separate out the different potential problems so that objectivity can be analysed in isolation, as that is the part that seems to cause most division of the community.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The separate problems&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Too broad&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A challenge needs to be specific enough to make it interesting. Where the line is drawn is highly subjective and it is unrealistic to try to set a fixed definition. As a rough guide for popularity contests, if two answers are difficult to compare, the challenge is probably too broad. Voters should be able to judge &quot;Which solves the challenge best?&quot; rather than simply &quot;Which is your favourite?&quot;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Not enough programming&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A challenge needs to be a programming challenge to be on topic here. If programming is not required in order to produce a &lt;em&gt;competitive&lt;/em&gt; answer then the challenge fails to be a programming challenge.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Too subjective&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I see two ways of defining this problem:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The spec does not define algorithmically how to order the answers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Two different voters will disagree on the order of the answers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;For a code golf, (1) is usually the useful definition. We expect the order of answers to be unambiguous (to the point that a Stack Snippet can determine the order and display a leaderboard).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For a popularity contest, (1) is not suitable. If there were an unambiguous order there would be no need for human judgement, and the challenge would not be a popularity contest. When applying (2), there is no clear line between challenges in which everyone votes differently and challenges in which everyone votes the same. In all challenges voting will be somewhere in between. The more it seems that voting will be arbitrary, the more likely that the challenge is too subjective.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Subjectivity spectrum&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It's tempting to try to compose a list of types of popularity contest, and clearly divide those that are on topic from those that are not. For example, imagine using the following list, from most subjective to least subjective:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How unexpected/impressive is the output?&lt;/li&gt;&#xA;&lt;li&gt;How aesthetically pleasing is the output?&lt;/li&gt;&#xA;&lt;li&gt;How elegant is the programming approach?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How well does the output achieve an objective?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Although it seems reassuring to have a clear dividing line, in practise this is unlikely to help beyond separating out the most obviously off topic challenges. The community-dividing difficult judgements will tend to be below the line - &quot;How well does the output achieve an objective&quot;. The difficult decision will be in whether the objective is defined sufficiently objectively.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Confusing validity with ordering&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Two unrelated questions seem to have been frequently conflated:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What makes an answer objectively valid?&lt;/li&gt;&#xA;&lt;li&gt;What makes an answer objectively better than another?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The second question cannot be answered objectively, otherwise it wouldn't be a popularity contest. The first question should be answered as much as possible - the challenge should give a clear and strict definition of what constitutes an answer. The second question can only be addressed with guidelines on what voters should look for. By definition these will be subjective guidelines.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Confusing &quot;valid answer&quot; with &quot;sufficient effort&quot;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Validity can be objectively defined (even for a popularity contest). However, &quot;sufficient effort&quot; cannot be objectively defined, even for a code golf challenge. A challenge is required to define objectively what constitutes a valid answer. A challenge is &lt;em&gt;not&lt;/em&gt; required to define what counts as &quot;sufficient effort&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Generic guidelines are insufficient&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Popularity contests are widely varied and each should be assessed individually. Generic posts can offer guidance and rough limits but in many cases there will also be the need for a &lt;a href=&quot;/questions/tagged/specific-question&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;specific-question&amp;#39;&quot; rel=&quot;tag&quot;&gt;specific-question&lt;/a&gt; meta discussion. This will give a much better view of the community's feelings and reasons than just going through the close-reopen cycle a few times.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2016-01-18T14:33:07.710" LastActivityDate="2016-01-18T14:33:07.710" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8143" PostTypeId="1" CreationDate="2016-01-18T14:45:09.133" Score="14" ViewCount="308" Body="&lt;p&gt;During discussion of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8084/guidelines-for-posting-and-closing-popularity-contests&quot;&gt;this meta question&lt;/a&gt;, it was noted that our current rules are different from our historical rules. As a result some older challenges would be closed as off topic if posted now. Notable examples are some of the older popularity contests mentioned in that question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As new users are much more likely to have seen old challenges on main than to have browsed meta, it seems misleading to leave these challenges open, inviting similar challenges. Especially since this wastes the time of people we are hoping will join our community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This applies to all challenge types, not just popularity contests. How should we deal with historic posts that are no longer good examples of what is on topic?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should they be closed as off topic? Should they be locked to prevent further answers? Should they be edited with a warning that further challenges of this type are no longer accepted?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ideally we can settle on a single consistent approach to avoid any further confusion or disappointment for new users.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2018-03-15T13:23:51.587" Title="What should we do with old challenges no longer on topic?" Tags="|discussion|challenges|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8144" PostTypeId="2" ParentId="8143" CreationDate="2016-01-18T15:03:14.333" Score="20" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;View all question with today's standards. If the question fits as current standards then leave it open; if it doesn't fit then vote/flag to close it. If we keep the questions which don't fit as per current standards, then people will ask why the questions are still open.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;&lt;a href=&quot;https://meta.stackexchange.com/users/187824/hims056&quot;&gt;hims056&lt;/a&gt; on &lt;a href=&quot;https://meta.stackexchange.com/a/194117/180276&quot;&gt;meta.SE&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The same thing applies to all Stack Exchange sites, really. Just because a question is old doesn't mean it gets a free pass for being off-topic.&lt;/p&gt;&#xA;&lt;p&gt;Vote to close without restraint.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-18T15:03:14.333" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="8145" PostTypeId="2" ParentId="2140" CreationDate="2016-01-18T15:47:46.647" Score="3" Body="&lt;h1&gt;Addition of doubles... without doubles &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/golf-cpu&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;golf-cpu&amp;#39;&quot; rel=&quot;tag&quot;&gt;golf-cpu&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For this challenge, you must write a &lt;a href=&quot;https://github.com/orlp/golf-cpu&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;GOLF&lt;/em&gt;&lt;/a&gt; assembly program that takes two &lt;a href=&quot;https://en.wikipedia.org/wiki/Double-precision_floating-point_format&quot; rel=&quot;nofollow noreferrer&quot;&gt;IEEE 754&lt;/a&gt; double-precision numbers and returns their sum.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The Format&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;IEEE 754 doubles use 8 bytes to store a floating-point value. The memory is laid out like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/a/a9/IEEE_754_Double_Floating_Point_Format.svg&quot; alt=&quot;&quot;&gt; &lt;sub&gt;&lt;em&gt;(&lt;a href=&quot;https://en.wikipedia.org/wiki/File:IEEE_754_Double_Floating_Point_Format.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;)&lt;/em&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the purposes of this challenge, all numbers will be in big-endian, and you won't have to worry about overflows or underflows. Addition works roughly like this (I won't go into all of the details):&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Align the two numbers to a common exponent.&lt;/li&gt;&#xA;&lt;li&gt;Add the fractional parts, taking into account the sign.&lt;/li&gt;&#xA;&lt;li&gt;If the addition overflows, then change the exponent to match.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h3&gt;I/O&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your program will receive 16 bytes of input. The first 8 represent the (big-endian) first number, and the rest represent the second number. Your program will return 8 bytes representing the sum of the two.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, so the program that completes the task with the least cycles wins.&lt;/li&gt;&#xA;&lt;li&gt;The score of an answer is the mean number of cycles required for adding uniformly distributed numbers in [-10^64, 10^64].&lt;/li&gt;&#xA;&lt;li&gt;You must test with at least 2500 trials.&lt;/li&gt;&#xA;&lt;li&gt;Your code doesn't have to handle infinities/NaNs.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Your &lt;em&gt;GOLF&lt;/em&gt; binary (after assembling) must fit in 4096 bytes.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Meta Questions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do I have too many/too few trials?&lt;/li&gt;&#xA;&lt;li&gt;Is there something that I overlooked?&lt;/li&gt;&#xA;&lt;li&gt;Is there a more fitting title?&lt;/li&gt;&#xA;&lt;li&gt;How much explanation should I provide? I don't want this question to turn into a Wikipedia article, but questions requiring external resources are generally frowned upon.&lt;/li&gt;&#xA;&lt;li&gt;Is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/colf-cpu&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;colf-cpu&amp;#39;&quot; rel=&quot;tag&quot;&gt;colf-cpu&lt;/a&gt; dead?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="33208" LastEditorUserId="33208" LastEditDate="2016-01-20T21:53:45.793" LastActivityDate="2016-01-20T21:53:45.793" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8151" PostTypeId="2" ParentId="2140" CreationDate="2016-01-19T19:59:15.987" Score="0" Body="&lt;h1&gt;The quitting log-in&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This program relies on the user pressing &lt;kbd&gt;Ctrl&lt;/kbd&gt; + &lt;kbd&gt;C&lt;/kbd&gt; at specified times to show him the secret message (the secret message is just &lt;code&gt;m&lt;/code&gt; to avoid polluting the byte count with un-avoidable chars).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a 3 digit enter code that may be specified anywhere (just give directions to find it inside your source code) let the user see the message if he quits at the n-th (1-indexed, zero may never be present in the pass-code) &lt;code&gt;?&lt;/code&gt; each time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The user should press &lt;kbd&gt;Enter&lt;/kbd&gt; to get to the next question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the user does not press &lt;code&gt;&amp;lt;Control-C&amp;gt;&lt;/code&gt;, nine successive prompts should be shown.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a code &lt;code&gt;523&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;?&#xA;?&#xA;?&#xA;?&#xA;? &amp;lt;Control-C&amp;gt;&#xA;?&#xA;? &amp;lt;Control-C&amp;gt;&#xA;?&#xA;?&#xA;? &amp;lt;Control-C&amp;gt;&#xA;m&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Given a code &lt;code&gt;123&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;?&#xA;?&#xA;? &amp;lt;Control-C&amp;gt;&#xA;? &amp;lt;Control-C&amp;gt;&#xA;? &amp;lt;Control-C&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="18173" LastActivityDate="2016-01-19T19:59:15.987" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8152" PostTypeId="2" ParentId="8143" CreationDate="2016-01-19T20:40:54.487" Score="-1" Body="&lt;h1&gt;Let them stay open&lt;/h1&gt;&#xA;&lt;p&gt;Give all our users a chance to participate in the older challenges. I think most new users will not be confronted with older challenges (and therefore not influenced), because (as far as I know) all the questions that are advertised on other sites are ones with a lot of activity. Also when entering PPCG you will first of all only find the newest challenges.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-19T20:40:54.487" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8153" PostTypeId="2" ParentId="8121" CreationDate="2016-01-20T08:26:36.560" Score="6" Body="&lt;p&gt;I didn't think i would answer this question but it seems to me that 2 benefits of this site have not been mentioned in the other answers:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;this site as a place to study programming languages comparatively;&lt;/li&gt;&#xA;&lt;li&gt;this site as a place to train obfuscation/deobfuscation.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;A little bit of background: i am not a programmer nor did i ever learn computer science formally. I am a micropaleontologist (I study fossil plankton), so learning programming was not exactly part of my cursus, as you would imagine. Yet I do need to program on an every day basis as my field of study entered the age of 'big data', and that modelling is taking an increasing importance in what we're doing. So naturally I learned R and trained on stackoverflow (first reading then answering), which helped me transition from beginner to advanced user. Later (3 years ago) I joined PPCG, which helped me transition to expert user: in particular, golfing taught me the inner working of R and how to control side effects of functions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Tags like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; also taught me a lot about obfuscation, and therefore, maybe more interestingly, about deobfuscation. Again, i am no professional programmer, but i can only imagine that it has to have some useful applications (in computer security first probably). For me, as i became involuntarily the R programming helpdesk in my institute, it helped me considerably in disentangling codes that were passed and modified by generations of researchers having little understanding of the tool they were using.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Tags like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, typically, are also polyglots, gathering answers in many different languages, solving the same task, often with similar algorithms. As I said, i never had any formal training in programming. Yet today I not only program, in the context of my research, in R but also in Python and, maybe more interestingly, i do not program in C, Java and Fortran but I am able to read code written in those languages and replicate them in R or Python if needed (it happened to me recently with a software written in Java and a routine written in Fortran that I needed to modify to adapt them to my research and therefore rewrote in Python and R, respectively).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I didn't mention the place that esoteric languages occupy on this site before, but they did, for me, benefit as I, as i said before, have no formal training in computer science, they helped me understand how programming languages work on a more basic and fundamental level.&lt;/p&gt;&#xA;" OwnerUserId="6741" LastEditorUserId="6741" LastEditDate="2016-01-20T09:01:57.723" LastActivityDate="2016-01-20T09:01:57.723" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8154" PostTypeId="2" ParentId="2140" CreationDate="2016-01-20T18:03:09.633" Score="0" Body="&lt;h1&gt;Queuing queues&lt;/h1&gt;&#xA;&lt;p&gt;I recently found a great site, &lt;a href=&quot;https://www.dubtrack.fm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Dubtrack&lt;/a&gt;, for all my music needs.&#xA;However, it features a very interesting method of ordering, which contains a queue of users, and each user has their own personal queue.&lt;/p&gt;&#xA;&lt;p&gt;The user queue loops through each of the users that have songs, and plays the top song from their individual queue.  This means that:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;When there is a single user, it simply plays the songs in the order that user added them.&lt;/li&gt;&#xA;&lt;li&gt;When there are multiple users, it interleaves the songs.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;However, users' queues aren't always filled, and when a user adds his first song to the queue, &lt;strong&gt;the user is added to the end of the user queue&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For example, say there were 3 users each with the following queues (at time 0):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 [1,10,100,1000]&#xA;0 [2,20]&#xA;0 [3,30,300]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;then the resulting playlist would look like:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1, 2, 3, 10, 20, 30, 100, 300, 1000]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;However, if a user were to add his queue during the 4th song:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 [1,10,100,1000]&#xA;0 [2,20]&#xA;0 [3,30,300]&#xA;3 [4,40,400,4000]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Then the playlist would look like&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;                      v New user's song finally plays&#xA;[1, 2, 3, 10, 20, 30, 4, 100, 300, 400, 1000, 400, 4000]&#xA;          ^ New user added here, but user 2 and 3 are still in front&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your challenge is to take a list of queues and join times, and return them in single playlist.  You are guaranteed that there will be at least 1 queue at time &lt;code&gt;0&lt;/code&gt;, and that additional users won't be added after all the songs have played.&lt;/p&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input&#xA;0 [1,5,3,7,2,6,3]&#xA;Output&#xA;[1,5,3,7,2,6,3]&#xA;&#xA;Input&#xA;1 [3,6,9,12]&#xA;0 [4,10]&#xA;Output&#xA;[4,10,3,6,9,12]&#xA;&#xA;Input    &#xA;0 [1,10,100,1000]&#xA;0 [2,20]&#xA;0 [3,30,300]&#xA;3 [4,40,400,4000]&#xA;Output&#xA;[1,2,3,10,20,30,4,100,300,400,1000,400,4000]&#xA;&#xA;Input&#xA;11 [3000]&#xA;3 [6,8,10,11,0]&#xA;5 [4,100,14,12,0]&#xA;0 [0,1,2,3,4,5]&#xA;11 [2000]&#xA;Output&#xA;[0,1,2,3,6,4,8,4,5,10,100,11,14,3000,2000,0,12,0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-20T20:12:12.427" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8155" PostTypeId="2" ParentId="2140" CreationDate="2016-01-20T18:09:41.157" Score="3" Body="&lt;h1&gt;Play Flippy Bit&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pathfinding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pathfinding&amp;#39;&quot; rel=&quot;tag&quot;&gt;pathfinding&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;There's a simple &lt;a href=&quot;http://flippybitandtheattackofthehexadecimalsfrombase16.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;game&lt;/a&gt; called &amp;quot;Flippy Bit and the Attack of the Hexadecimals from Base 16&amp;quot;, originally made as an April Fool's prank in 2014.&lt;/p&gt;&#xA;&lt;p&gt;The premise is simple: Enemies enter the field from the top. Each one has a hexadecimal number, and are destroyed when the player's binary number matches. For example, an enemy with number &lt;code&gt;2Ah = 00101010b&lt;/code&gt; would be destroyed as soon as the user's number is &lt;code&gt;00101010&lt;/code&gt;. Of course, enemies can only be destroyed after they enter the screen.&lt;/p&gt;&#xA;&lt;p&gt;The player manipulates their binary number by flipping individual bits with the &lt;code&gt;qwertyui&lt;/code&gt; keys, where &lt;code&gt;q&lt;/code&gt; is the most significant bit. Each press flips the bit at that location. Therefore, the &lt;code&gt;2A&lt;/code&gt; enemy above will explode if, starting from 0, the player presses &lt;code&gt;etu&lt;/code&gt; in any order. When an enemy explodes, the player's number is reset to &lt;code&gt;0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a list of enemies, determine a sequence of keypresses that can destroy all enemies in the order given. This isn't as simple as it seems: if you're trying to destroy &lt;code&gt;3&lt;/code&gt; but there's another enemy called &lt;code&gt;2&lt;/code&gt; on the board, you'll need to press &lt;code&gt;i&lt;/code&gt; before &lt;code&gt;u&lt;/code&gt;. Your algorithm must terminate within a bounded time.&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;A list of strings of hex digits &lt;code&gt;0123456789ABCDEF&lt;/code&gt;, with each string 1 or 2 digits long, and where the 2-digit strings have no leading zero. You may also take the input in a reasonable format other than a list; for example, newline-separated. The input will always represent a solvable configuration.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;A string representing the sequence of keypresses.&lt;/p&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;p&gt;Note that there are multiple possible outputs for most inputs.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2A 01 02 04 08 10 20 40 A0 88&#xA;quetqwertyui&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;[add more test cases]&lt;/p&gt;&#xA;&lt;p&gt;Verify your solutions with the following Python:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[add verification code]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest solution in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-16T05:17:04.083" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8159" PostTypeId="2" ParentId="2140" CreationDate="2016-01-21T04:49:19.637" Score="1" Body="&lt;h2&gt;Help find Mersenne primes! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;There has recently been a discovery of a &lt;a href=&quot;http://www.mersenne.org/primes/?press=M74207281&quot; rel=&quot;nofollow noreferrer&quot;&gt;new prime number&lt;/a&gt;: 2^74207281-1. This is the biggest prime number to date and broke the previous 3-year record holder by over 4 million digits!&lt;/p&gt;&#xA;&lt;p&gt;Your job will be to help mathematicians find some prime numbers (not really). You must take in an integer &lt;code&gt;N&lt;/code&gt; and output the &lt;code&gt;N&lt;/code&gt;th Mersenne prime (&lt;a href=&quot;https://oeis.org/A000668&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS A000668&lt;/a&gt;). You may assume that the &lt;code&gt;N&lt;/code&gt;th Mersenne prime is under your languages maximum integer number and/or will not cause an overflow (but your code should work for higher numbers if your language allowed it. You may &lt;strong&gt;not&lt;/strong&gt; use any built ins for primality testing and cannot hard-code any values.&lt;/p&gt;&#xA;&lt;p&gt;You can find a list of most of these numbers over &lt;a href=&quot;https://en.wikipedia.org/wiki/Mersenne_prime#List_of_known_Mersenne_primes&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;2 -&amp;gt; 7&#xA;5 -&amp;gt; 8191&#xA;8 -&amp;gt; 2147483647&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, shotest code in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="36670" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-21T15:08:26.237" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8163" PostTypeId="1" CreationDate="2016-01-21T19:18:10.443" Score="0" ViewCount="44" Body="&lt;p&gt;&lt;sub&gt;Sorry if this is a duplicate, I haven't seen a post that covers this topic before.&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have seen many edits recently that edit the original answers code in an attempt to help golf it. I saw somewhere (sorry, don't remember where) that you shouldn't edit the code in other peoples posts. How are we supposed to handle edits that do this?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits/27156&quot;&gt;https://codegolf.stackexchange.com/review/suggested-edits/27156&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits/27131&quot;&gt;https://codegolf.stackexchange.com/review/suggested-edits/27131&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits/27016&quot;&gt;https://codegolf.stackexchange.com/review/suggested-edits/27016&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits/26862&quot;&gt;https://codegolf.stackexchange.com/review/suggested-edits/26862&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42736" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-01-21T19:18:10.443" Title="How do we handle edits that change the code in an answer?" Tags="|discussion|reviewing|" AnswerCount="0" CommentCount="1" ClosedDate="2016-01-21T19:30:58.730" ContentLicense="CC BY-SA 3.0" />
  <row Id="8164" PostTypeId="2" ParentId="8121" CreationDate="2016-01-21T21:59:19.990" Score="7" Body="&lt;h2&gt;Why are you here?&lt;/h2&gt;&#xA;&lt;p&gt;I had already tried PPCG before in &lt;a href=&quot;https://codegolf.stackexchange.com/q/40932/32686&quot;&gt;Unscramble the Source Code&lt;/a&gt; but that didn't really kick me into code golf. I made five answers to the question, the highest voted being +1 over the course of two days.&lt;/p&gt;&#xA;&lt;p&gt;It was my first day at work (a summer job looking after some servers) and over 8 months since my first batch of posts. I needed to know how to use some tool, so I went over to Stack Overflow. I noted the HNQ's, seeing &lt;a href=&quot;https://codegolf.stackexchange.com/a/53905/32686&quot;&gt;Swap capitalization of two strings&lt;/a&gt;, a relatively simple task which I knew I could solve, even if I couldn't golf it very well.&lt;/p&gt;&#xA;&lt;p&gt;So I wrote my answer up in Python, checked it and posted it only to be told that it didn't pass all the tests. So I went and checked and sure enough, my code was broken. So I did what anyone would do: panic for a bit and try to fix my code as quickly as possible before it accumulated any downvotes. Twenty minutes later, I uploaded my fixed code.&lt;/p&gt;&#xA;&lt;p&gt;I got an upvote.&lt;/p&gt;&#xA;&lt;p&gt;Whoever told me the code was broken had almost certainly given it to me. I felt good. Who knew not-really-real internet points could do that? The two upvotes I got on my previous answers weren't as good.&lt;/p&gt;&#xA;&lt;p&gt;Why?&lt;/p&gt;&#xA;&lt;p&gt;I had improved my code. It conformed to the spec. It did what it should have done.&lt;/p&gt;&#xA;&lt;h2&gt;What does PPCG do for the SE community?&lt;/h2&gt;&#xA;&lt;p&gt;It teaches in a safe environment. No crucial code to accidentally mess up, no real pressure from the voices above. If the worst comes to the worst, you've just got a couple of people telling you your code's wrong and sometimes giving pointers on how to fix it.&lt;/p&gt;&#xA;&lt;p&gt;PPCG has taught me lots about the language I like to use and even a new one, Pyth, which I now actually use in simple tasks.&lt;/p&gt;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/a/61125/32686&quot;&gt;Make your language unusable&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/a/60100/32686&quot;&gt;Self-Mutilating Program&lt;/a&gt; I showcased what I had learnt about code objects barely a week earlier. They are the answers I'm still most proud with and they're also amoung my most upvoted. I shared my knowledge with other users, preaching the versatility of Python even to the point of stupidity (I mean who really wants to write code that changes the program you're running?)&lt;/p&gt;&#xA;&lt;h2&gt;What does PPCG need to change?&lt;/h2&gt;&#xA;&lt;p&gt;In my opinion? Almost nothing.&lt;/p&gt;&#xA;&lt;p&gt;I personally really like challenges like the two I've mentioned above because they forced me to think. They aren't typical code-golf's in that the way to solve the question is immediately obvious and simply getting a valid solution counts as a success to me. They were interesting challenges with interesting solutions.&lt;/p&gt;&#xA;" OwnerUserId="32686" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-21T21:59:19.990" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8169" PostTypeId="2" ParentId="8121" CreationDate="2016-01-22T11:18:59.103" Score="8" Body="&lt;h2&gt;Who are you, and why are you here?&lt;/h2&gt;&#xA;&lt;p&gt;I'm just your average 1k-something user. I'm not a programmer (although I've programmed as a hobby as long as I can remember), but an engineering student. I came to StackOverflow because any error message I googled got me there, posted a question or two that nobody could answer because my laptop turned out to be haunted, answered a question or two coming to the conclusion that I am not an expert programmer, and then noted PPCG in the HNQ.&lt;/p&gt;&#xA;&lt;p&gt;I'm here because I like programming, but need the challenge; programming for university coursework can sometimes provide that, and sometimes I can provide my own challenge, but generally, those projects drag on and on, with the spec changing at every compiler error, and at every intermediary result. PPCG provides me with challenges so I can keep up programming as a hobby.&lt;/p&gt;&#xA;&lt;h2&gt;How does PPCG fit in the SE network?&lt;/h2&gt;&#xA;&lt;p&gt;PPCG is the mini-game in the MMO we call StackExchange. We all love putting a lot of effort into researching and writing good answers and earning fake internet points. Each question is a challenge due to the gamification of SE, and each answer is a solution. PPCG is the same thing: challenges are posted, and solutions provided. In that regard, PPCG fits perfectly into SE. A difference is that the rest of SE pretends to be good Samaritans by saying that they're helping each other out, and we just openly admit we just do it for the fun of delving into a good challenge.&lt;/p&gt;&#xA;&lt;p&gt;However, format-wise, PPCG really doesn't fit in. In the SE network, votes are the only measure that differentiates answers. Here, answers are differentiated by language, score and votes. Writing challenges here is an art, whereas on the rest of SE, any question that is clearly stated and properly researched is a good question. Sure, we abuse the runnable snippets to get some kind of scoreboard, and have a dysfunctional sandbox for creating challenges. But really, PPCG is the odd one out, and &lt;strong&gt;please&lt;/strong&gt; keep it that way. The SE format is a Q&amp;amp;A format. Please don't try and squeeze PPCG into that format. If anything, try and convince the big bosses of SE that we could do with some customized features (say, a nice [scoreboard] tag in the editor, instead of hiding the scoreboard behind an ugly runnable stack snippet button), because we're &lt;strong&gt;not&lt;/strong&gt; a Q&amp;amp;A.&lt;/p&gt;&#xA;&lt;h2&gt;How can we improve?&lt;/h2&gt;&#xA;&lt;p&gt;Right now, the challenge part is going great*. We're very strict in creating objective challenges, and that's working out well. The answer part... not so much. Other than answers that obviously have not understood what the challenge is about (e.g., ungolfed entries), downvotes are rare. Additionally, in my opinion, at the very least, explanations should be the norm, instead of a nice bonus that will get you some upvotes. Answers that do not contain an explanation, should get a default comment saying that they should include one. Answers should only be upvoted if they contain clever hacks, and downvoted if they're just production code with shortened variable names. Place the emphasis on creating the most clever answers, instead of the shortest (I love C entries because their &lt;code&gt;#define&lt;/code&gt;s allow for such clever optimizations, even though they're in general 5x the size of a Pyth answer). I would love a feature to filter the answers based on language, or a scoreboard that allows for a handicap factor for various languages. Again, we're not a Q&amp;amp;A, and we need features to allow for that.&lt;/p&gt;&#xA;&lt;p&gt;*OK, there are some issues. As noted at various places across the meta, we need more interesting challenges; like challenges that allow for multiple approaches, challenges that use interesting scoring methods (my personal favorite), etc.&lt;/p&gt;&#xA;&lt;h2&gt;Elevator pitch&lt;/h2&gt;&#xA;&lt;p&gt;So, there's... 4 elevators in this building right? And... 8 floors, 64 people on average per floor. They all get in between 8 and 9 am, and leave between 5 and 6 pm, and during their time inside, they go to a different floor and back to their own every hour on average. Do you think you can think of a smart algorithm for that? Or a smart way of choosing which elevator to take?&lt;/p&gt;&#xA;&lt;p&gt;Interested? I have just the site for you.&lt;/p&gt;&#xA;" OwnerUserId="32352" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-22T11:18:59.103" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8170" PostTypeId="1" AcceptedAnswerId="8171" CreationDate="2016-01-22T15:16:25.137" Score="4" ViewCount="116" Body="&lt;p&gt;I'm still fairly new to code golf, but I've run into this problem quite a bit already (in part &lt;em&gt;because&lt;/em&gt; I'm new, I imagine). I'll find a challenge I think I can tackle and work up a solution. When I go to submit it, I find not only has &lt;strong&gt;the language I selected already been used&lt;/strong&gt;, but the current submission in it is &lt;strong&gt;less bytes than my answer&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By the general rule/consensus I read somewhere (can't seem to find it now): if your language has already been used, you should only post your answer if it's a significantly different process or a better score. I understand this, but the community edit/suggestion process has been my primary way of improving my golfing. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So now I'm stuck with not-so-great answers score-wise. Sometimes they use roughly the same logic as an answer in the same language; other times I can't sufficiently understand the much better scoring answer to determine if what I wrote is just a poorly golfed version of it or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm aware of the various &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; posts which have helped quite a bit, but these obviously can't contain every bit of useful info for my specific answer. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;What should I do with poor-scoring answers in languages that have already been used that I want help golfing? &lt;/p&gt;&#xA;" OwnerUserId="39056" LastEditorUserId="3808" LastEditDate="2016-01-22T20:55:51.553" LastActivityDate="2016-01-22T20:55:51.553" Title="I have a poor answer in an already-used langauge but want help golfing it further" Tags="|discussion|answers|" AnswerCount="1" CommentCount="3" ClosedDate="2016-01-24T18:08:44.040" ContentLicense="CC BY-SA 3.0" />
  <row Id="8171" PostTypeId="2" ParentId="8170" CreationDate="2016-01-22T15:28:15.637" Score="13" Body="&lt;p&gt;If we have a rule that says you shouldn't post a longer answer in a language that has already been used, then I think we should get rid of it. I haven't heard of a rule like that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I do know that someone was concerned about downvotes in this situation. Just write in your explanation &quot;I know that my answer is longer than this other answer, but I tried a different approach.&quot; As long as you at least attempted to golf your answer, I doubt anyone will downvote you after reading that.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastActivityDate="2016-01-22T15:28:15.637" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8172" PostTypeId="2" ParentId="7897" CreationDate="2016-01-22T18:01:03.883" Score="16" Body="&lt;h1&gt;Top banner image&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;What if we took some of the most popular answers on the site and make a background out of them? Example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/F5T46.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/F5T46.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Based on @Doᴡɴɢᴏᴀᴛ's idea)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Edit: Now incorporated into Doᴡɴɢᴏᴀᴛ's graduation design userscript:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Zd7n2.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Zd7n2.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Slightly recolored.&lt;/p&gt;&#xA;" OwnerUserId="42736" LastEditorUserId="46271" LastEditDate="2017-01-05T18:06:46.057" LastActivityDate="2017-01-05T18:06:46.057" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="8173" PostTypeId="2" ParentId="2140" CreationDate="2016-01-22T19:21:21.277" Score="1" Body="&lt;h1&gt;Pixel &amp;quot;Density&amp;quot;&lt;/h1&gt;&#xA;&lt;p&gt;In this challenge, we will be viewing each pixel in an image as a particle with two properties:&lt;/p&gt;&#xA;&lt;p&gt;(1) vertical density (&lt;em&gt;vd&lt;/em&gt;)&lt;/p&gt;&#xA;&lt;p&gt;(2) horizontal density (&lt;em&gt;hd&lt;/em&gt;)&lt;/p&gt;&#xA;&lt;p&gt;These two properties are determined by the RGB values of the pixel in the following manner:&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;vd&lt;/em&gt; = Red - Blue&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;hd&lt;/em&gt; = 128 - Green&lt;/p&gt;&#xA;&lt;p&gt;We call a &lt;strong&gt;&lt;em&gt;sorted image&lt;/em&gt;&lt;/strong&gt; an image that satisfies the following conditions:&lt;/p&gt;&#xA;&lt;p&gt;For each pixel:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;no pixel to the right has a lower &lt;em&gt;hd&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;no pixel to the left has a higher &lt;em&gt;hd&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;no pixel above has a higher &lt;em&gt;vd&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;no pixel below has a lower &lt;em&gt;hd&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The challenge is to produce such sorted images.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;An image in any &amp;quot;common, recognizable&amp;quot; format, via file or stdin.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A sorted image in a &amp;quot;common, recognizable&amp;quot; format (not necessarily the same format as input) containing exactly the pixels of the original , via file or stdout.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Relevant Details&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;alpha values (if they exist) are ignored.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Libraries may be used, but size must be added to your score&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&amp;quot;common, recognizable&amp;quot; formats will be determined by the community. I don't expect this to be an issue, but if you feel the the loose wording is being exploited, downvote the answer (&lt;em&gt;or even better, help me fix it before the challenge goes live. I don't really want to enumerate the allowed formats, but maybe that is a better option?&lt;/em&gt;).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If there is interest in the question, I will create a reference implementation as well as test cases.&lt;/p&gt;&#xA;" OwnerUserId="45459" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-28T18:51:02.977" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8175" PostTypeId="2" ParentId="8121" CreationDate="2016-01-22T23:51:59.080" Score="8" Body="&lt;h2&gt;Who am I?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm Zgarb.&#xA;You probably know me from my challenges, since that's what I mostly do here: create challenges for others to solve.&#xA;I do sometimes golf, especially if I can think of a novel approach, and take part in KOTHs and other more uncommon challenge types.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Why am I (still) here?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In real life, I'm a researcher of mathematics and computer science, and my first contact with the SE network was when I searched for some theorem or formula on &lt;a href=&quot;https://math.stackexchange.com/&quot;&gt;Mathematics&lt;/a&gt; or &lt;a href=&quot;https://mathoverflow.net/&quot;&gt;MathOverflow&lt;/a&gt;.&#xA;I never actually participated on either site, though, so they were (and still are) just sources of information to me.&#xA;A few weeks later, I noticed &lt;a href=&quot;https://codegolf.stackexchange.com/questions/36374/redraw-an-image-with-just-one-closed-curve&quot;&gt;Redraw an image with just one closed curve&lt;/a&gt; on the HNQ list, and clicked on it.&#xA;It's still one of my favorite challenges here, even if the spec is somewhat vague by today's standards, and the answers are amazing too.&#xA;I didn't participate or create an account yet, but decided to lurk around and get a feel of the site, in case something easier would pop up.&#xA;I finally registered to participate in the KOTH &lt;a href=&quot;https://codegolf.stackexchange.com/questions/41482/treasure-hunting-on-a-deserted-island&quot;&gt;Treasure Hunting on a Deserted Island&lt;/a&gt;, then answered a couple of golfs in Haskell, and pretty soon wrote the challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/41375/generalized-quine-generator&quot;&gt;Generalized Quine Generator&lt;/a&gt;.&#xA;I've been hooked ever since.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd say that what caused me to come to PPCG and stay here were the intellectual challenge and the community.&#xA;I enjoy posing problems and closing loopholes in specifications, and if I come across an interesting research problem that I can't work on myself, I may later distill it into a code-golf or some other type of challenge and post that here.&#xA;I'm always pleasantly surprised when the community solves them in unexpected ways, using obscure language features, esoteric languages, or novel algorithms.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Speaking of esoteric programming languages, I'm a big fan of them.&#xA;PPCG has introduced me to such awesome languages as APL, J, Marbelous and Prelude.&#xA;I also find golfing language design an extremely interesting topic, even if I haven't created or even really used one myself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Last but not least, the core userbase is a bunch of awesome and friendly people who share many of the above interests.&#xA;It's because of the community events, culture of collaboration and off-topic chat that I keep coming back, and I feel this is one of our greatest assets over other golfing sites.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What's our place on SE?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a tough one for me, since PPCG is the only SE site where I actively participate, and it's very different from all the others (except perhaps &lt;a href=&quot;https://puzzling.stackexchange.com/&quot;&gt;Puzzling&lt;/a&gt;).&#xA;I consider code golf and other programming challenges primarily a fun hobby and intellectual excercise.&#xA;It's possible to view them as a way of practicing one's skills, discovering gotchas and obscure features of programming languages, and learning to decipher convoluted code, but in my case, these feel like afterthoughts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As far as I know, PPCG was created as an ad hoc forum for questions that no longer fit StackOverflow's Q&amp;amp;A format.&#xA;Because of that, we're still fighting against the technical limitations of a Stack Exchange site.&#xA;As &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8169/32014&quot;&gt;suggested by sanchises&lt;/a&gt;, it'd be very beneficial for us if we could slightly drift away from the standard SE format with custom features.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;How can we improve?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Code golf is the reason for PPCG's existence, and it should remain the site's main topic.&#xA;However, not everyone is as enthusiastic about it as we are, and it seems that unconventional challenges, like popularity contests, KOTHs and cops-and-robbers, are really good at luring new users to PPCG.&#xA;More often than not, some low-rep user even posts a comment along the lines of &quot;I don't golf, so these challenges are always interesting&quot;, and others concur with upvotes.&#xA;The problem is that these challenges take a lot of insight and/or hard work to create.&#xA;What would be great is some new challenge type, one that's versatile and easy to score, and doesn't require so much work on the part of the challenge author.&#xA;Unfortunately, I have little idea about what that would be.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another possibility would be to lower the threshold for writing good non-golf challenges.&#xA;A dedicated server for running fastest-code and KOTH competitions, preferably integrated into the site itself in some way, would be a huge improvement.&#xA;As it stands, these challenges always require the asker to run and score all submissions themselves, and I/O formats and language restrictions vary wildly.&#xA;I know that there has been some effort in creating such a server, but for some reason, it's never really caught wind (at least to my knowledge).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Elevator pitch&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Hey, do you know about code golf?&#xA;It's when you are given a specification for a program, like &quot;output the first 1000 Fibonacci numbers&quot;, and you try to satisfy that spec with the shortest possible program.&#xA;...&#xA;Well, of course it's going to be unreadable.&#xA;That's half the fun!&#xA;Anyway, there's this active online community where we compete in who can write the shortest programs.&#xA;We do lots of other programming competitions too, like write bots that battle against each other.&lt;/p&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="-1" LastEditDate="2017-04-13T12:57:54.680" LastActivityDate="2016-01-23T00:07:53.687" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8176" PostTypeId="1" CreationDate="2016-01-23T01:12:35.530" Score="1" ViewCount="439" Body="&lt;p&gt;&lt;strong&gt;Byte count&lt;/strong&gt; is the &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;default winning criterion&lt;/a&gt; in code golf. Counting bytes (as opposed to characters) is reasonable, because a language that uses more characters needs more bytes to define them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider the last sentence but &quot;negating both sides&quot;: &lt;strong&gt;a language that uses less characters needs less bytes to define them&lt;/strong&gt;. Assume a certain language L only uses the 95 printable ASCII characters. A program written in L consisting of 30 such characters could for example be 256-encoded into 25 bytes (&lt;code&gt;ceil(30*log2(95)/log2(256))&lt;/code&gt;). My proposal is that &lt;strong&gt;as byte count we use those 25&lt;/strong&gt; (&quot;equivalent bytes&quot;), &lt;strong&gt;not 30&lt;/strong&gt; (let me call those &quot;byte-digits&quot;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It could be argued that the language L should just use a character encoding with 256 characters, which avoids the problem: that way the language exploits all code space provided by each byte-digit, and byte-digits correspond to equivalent bytes. However, there may be reasons in favour of using only the 95 ASCII printable characters. Or it may be the case that the language has already been designed that way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider that someone designs a new language M which simply takes a program in language L and 256-encodes it (with some correspondence between the obtained bytes and a set of 256 characters). So the program with 30 byte-digits in L becomes a program with 25 byte-&lt;strong&gt;digits&lt;/strong&gt; in M. A compiler for M would be very simple: base-256 decode and call language L's compiler. &lt;strong&gt;Let's avoid that unnecessary and ugly step&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, the winning criterion can always be defined in the challenge. So instead of &quot;the code with fewest bytes wins&quot; it could say &quot;...multiply your byte count by &lt;code&gt;log2(B)/log2(256)&lt;/code&gt; and round up, where &lt;code&gt;B&lt;/code&gt; is the number of characters your language uses&quot;. I propose to &lt;strong&gt;make that the default criterion&lt;/strong&gt;. &lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-05-25T00:04:47.617" Title="Proposal of new measure for &quot;byte count&quot; in code golf" Tags="|discussion|code-golf|" AnswerCount="5" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="8177" PostTypeId="2" ParentId="8176" CreationDate="2016-01-23T01:19:54.950" Score="1" Body="&lt;h2&gt;Nah, that's too complicated, and doesn't change much&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In particular, what does it accomplish besides making Pyth answers even golfier? Python, for instance, can use all the printable characters, but it will still be verbose even if you make this change. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In practice, pretty much no one is doing the re-encoding that you describe in their answers, so it seems like the specific problem you are addressing is not actually a problem in practice. (I'm not sure I would consider it a problem even if they were.)&lt;/p&gt;&#xA;" OwnerUserId="47050" LastActivityDate="2016-01-23T01:19:54.950" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="8178" PostTypeId="2" ParentId="8176" CreationDate="2016-01-23T01:22:40.980" Score="2" Body="&lt;h1&gt;I think against:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;And here's why.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In choosing a programming language in non-CG, you essentially contract yourself to being tied to its advantages and disadvantages. While normally this has to do with efficiency, ease-of-access, and other reasons, here, it means signing yourself to the verbosity of the language.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;So no.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Because it is &lt;em&gt;your&lt;/em&gt; choice to use a language and it is &lt;em&gt;your&lt;/em&gt; loss if your language is more verbose. If you wish to use a less verbose language, then it is up to you to learn it and use it (or make it), not for a handicap to be put into place to allow for better scores in more verbose languages that you yourself chose.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastActivityDate="2016-01-23T01:22:40.980" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8179" PostTypeId="2" ParentId="8176" CreationDate="2016-01-23T01:25:53.747" Score="21" Body="&lt;h2&gt;Do not make it a default&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;That introduces another barrier to entry for code golf: a scoring method that makes no sense without explanation. Surely not every new user reads meta, so we'd have to explain to each new user who posts a code golf challenge why people's scores don't match up with the number of characters in their source code. (Ignoring for the moment some of the more atypical encodings.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want to post a challenge that uses this as a scoring criterion, go right ahead! But this definitely shouldn't be the default for code golf.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-01-23T01:25:53.747" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8180" PostTypeId="2" ParentId="8121" CreationDate="2016-01-23T02:07:20.717" Score="-2" Body="&lt;h1&gt;Why am I here?&lt;/h1&gt;&#xA;&lt;p&gt;I'm here for a multitude of reasons. I'm here because, well, I enjoy getting challenges on a daily feed that I can stretch my mind with. I love getting to know new things about programming (and even programmatic thought) on a daily basis. And I honestly am also here because the community was inviting, supportive, and generally just an awesome group of people that I enjoyed working with on &lt;s&gt;breaking&lt;/s&gt; bettering code. I have stayed here for exactly that latter thought - the working with other people in this community (and further) is simply awesome. I'm connecting with people all around the globe working together on figuring out random things, and that connection honestly feels pretty great.&lt;/p&gt;&#xA;&lt;h1&gt;How do I think PPCG can &amp;quot;fit in&amp;quot; to SE in general more? What bene... zzz... why is this question so LONG?&lt;/h1&gt;&#xA;&lt;p&gt;While Code Golf fits into SE like a triangle fits into a circle, I think it can be said that we can fit in pretty well.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;What is &lt;s&gt;Stack Exchange&lt;/s&gt; Code Golf?&lt;/p&gt;&#xA;&lt;p&gt;&lt;s&gt;Stack Exchange&lt;/s&gt; Code Golf is a growing network of individual &lt;s&gt;communities&lt;/s&gt;, each dedicated to serving experts [or noobs] in &lt;s&gt;a specific field&lt;/s&gt; the art and process of Code Golf and the fields thereof. We build libraries of high-quality &lt;s&gt;questions&lt;/s&gt; challenges and answers, focused on each community's area of expertise.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;We're... actually not that far off.&lt;/p&gt;&#xA;&lt;p&gt;Our expertise is in taking advantage of aspects of languages in order to receive some beneficial outcome. You never know - one day, scientists might use Pyth to reduce the file size of any programs they need on spacecraft (though unlikely). We also focus on other programming aspects, which causes us to teach users more skills, improving programming &amp;quot;health&amp;quot;, if you will.&lt;/p&gt;&#xA;&lt;h1&gt;In what ways do you think we can continue to innovate and expand? How can users who can't or don't want to golf participate on such a &amp;quot;golf-centric&amp;quot; site?&lt;/h1&gt;&#xA;&lt;p&gt;Even though our main purpose is CG (let's face it - how many challenges are there that are not CG in relation to those that are?), we are &lt;em&gt;not&lt;/em&gt; CG alone. As I mentioned before, we focus on many programming aspects. But aside of that, we're also an amazing community of people - one of my first golfs was &lt;em&gt;halved&lt;/em&gt; by help from the community. People who don't want to code golf &lt;s&gt;are wrong&lt;/s&gt; have other options, while also those people who don't quite know how to code golf yet can access plenty of resources that we ourselves have published on this site (though it's a little hard to find. &lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt; Featured tags for general tips). We will continue to expand nonetheless, as we are a programming site with a competitive nature that teaches programming. Past that, we are a great community. As far as I can see, we're already doing all we can to expand. As for innovation - that will come as a result of the users. &amp;quot;Innovation will take it's own course...&amp;quot; - some guy at some point.&lt;/p&gt;&#xA;&lt;h1&gt;Elevator Pitch&lt;/h1&gt;&#xA;&lt;p&gt;I don't need to do one. Everyone in the universe is obviously eventually drawn to PPCG anyway.&lt;/p&gt;&#xA;&lt;p&gt;In all seriousness, though, this is what I would say:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;PPCG is a really cool site - the people are wonderful, the challenges are interesting, and you get a lot of programming experience. I know that I wouldn't be nearly as practiced in programming if I had never found this site. So, if you wanna program skillfully, know your lang fully, and you want to find a good way to execute on that, join PPCG.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ZxFG8.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZxFG8.png&quot; alt=&quot;sign&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-23T02:07:20.717" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8181" PostTypeId="2" ParentId="8176" CreationDate="2016-01-23T03:23:25.220" Score="8" Body="&lt;h2&gt;Encourage anyone who make new golfing languages also make codepages&lt;/h2&gt;&#xA;&lt;p&gt;This kind of rule changes doesn't really help much for most non-golfing languages. But I can see that the current scoring rule is making new golfing languages less understandable. The problem is, we only need to make use of the 256 codepoints to make programs in a new language shorter, not the CP437 or ISO8859-1 symbols. It's better to also invent a new code page, and attach a program to convert between it and other code pages such as UTF-8. If we can know your answer can be made into those number of bytes in other ways, you don't have to use CP437 or ISO8859-1 just to prove that.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-23T03:23:25.220" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8182" PostTypeId="1" CreationDate="2016-01-23T04:10:04.683" Score="2" ViewCount="135" Body="&lt;p&gt;According to our &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;Help Center&lt;/a&gt; (emphasis mine),&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Programming Puzzles &amp;amp; Code Golf is for &lt;strong&gt;programming&lt;/strong&gt; contests and challenges.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Sounds simple enough, and 99 times out of 100 it is. But there are certain challenges which don't really require writing &lt;em&gt;code&lt;/em&gt;, at least in the most traditional sense. Here are a few examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/26194/20469&quot;&gt;Build a minifloat adding machine using NAND logic gates&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/24834/20469&quot;&gt;building circuit for divisibility by 3&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/69912/20469&quot;&gt;Build a 4-vertex Connectedness Tester using NAND gates&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Given that all challenges here must be &lt;em&gt;programming&lt;/em&gt; challenges, how do we define &lt;em&gt;programming&lt;/em&gt;? This is an important distinction for drawing a line between on- and off-topic challenges.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-02-03T05:24:54.643" Title="What constitutes programming for the purposes of this site?" Tags="|discussion|asking-questions|challenges|scope|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8183" PostTypeId="2" ParentId="2140" CreationDate="2016-01-23T04:38:24.027" Score="1" Body="&lt;h1&gt;Parse an &quot;Efficient&quot; Encoding&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let us define a fictitious encoding &quot;ENCWID&quot;, that follows this general form: there are three bits that denote the length of the following character, for each character. This looks something like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;WWWN..N&#xA;   ^^^^--- the actual character&#xA;^^^------- width bits; from 000 to 111&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Perhaps this is a little vague. To understand this better, let us encode the string &quot;Hello!&quot; into ENCWID. Observe:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;H   72   1001000&#xA;e   101  1100101&#xA;l   108  1101100&#xA;o   111  1101111&#xA;!   33   100001&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This diagrams the binary ASCII codes of each character in the string. Let us put these values into an array that represents &quot;Hello!&quot;: &lt;code&gt;[1001000,1100101,1100101,1100101,1101111,100001]&lt;/code&gt;. The widths for each of these strings are 7, 7, 7, 7, 7, and 6 respectively. To binary, this makes 7 &lt;code&gt;111&lt;/code&gt; and 6 &lt;code&gt;110&lt;/code&gt;. Now, we put the binary length of each binary ASCII code before the actual ASCII code, and combine them all into a single string, as such:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;111-1001000 111-1100101 111-1101100 111-1101100 111-1101111 110-100001&#xA;(7)-(  H  ) (7)-(  e  ) (7)-(  l  ) (7)-(  l  ) (7)-(  ᴏ  ) (6)-(  !  )&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(Spaces, hyphens, and parentheses added for visual clarity.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And thus, the encoding of &quot;Hello!&quot; is &lt;code&gt;11110010001111100101111110110011111011001111101111110100001&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Decoding the string form is perhaps rather easy, using the following steps:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Read three characters; call this N.&lt;/li&gt;&#xA;&lt;li&gt;Set N to the decimal number represented by N, from binary.&lt;/li&gt;&#xA;&lt;li&gt;Read the next N charcters; call this S.&lt;/li&gt;&#xA;&lt;li&gt;Parse S as a binary number, and append this character to the result.&lt;/li&gt;&#xA;&lt;li&gt;If there are still unread characters, go to step 1. Otherwise, continue.&lt;/li&gt;&#xA;&lt;li&gt;Return the result.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Objective&lt;/strong&gt; Your objective is to write two programs; one that encodes and one the decodes the described encoding. Your score is the sum of the program's byte count.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Implications&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Suppose that we can actually implement this in mainstream use; then, an encoding can be used that utilizes the lower-width codepoints for the most common letters in a given language. This would allow for a lesser amount of bits to convey the same message. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Say we did this for English, and that this&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;earniol1t.9h0s,dC()u2Scmy8gBJDW7HvM6RbkA435wfLPGpTKEFNYO&#xA;zI'Vq/Ux-[]jZ&quot;  ;:QX&amp;amp;!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is the approximate frequency at which english letters occur, this could be our (partial) encoding:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   0  1  2  3  4  5  6  7  8  9  A  B  C  D  E  F&#xA;0     e  a  r  n  i  o  l  1  t  .  9  h  0  s  ,&#xA;1  d  C  (  )  u  2  S  c  m  y  8  g  B  J  D  W&#xA;2  7  H  v  M  6  R  b  k  A  4  3  5  w  f  L  P&#xA;3  G  p  T  K  E  F  N  Y  O  \n z  I  '  V  q  /&#xA;4  U  x  -  [  ]  j  Z  &quot;  \t ;  :  Q  X  &amp;amp;  !  \&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Thus, &quot;Hello!&quot; would be encoded as:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;H   12   18   10010     (5 =&amp;gt; 101)&#xA;e   01   01   1         (1 =&amp;gt; 001)&#xA;l   07   07   111       (3 =&amp;gt; 011)&#xA;o   06   06   110       (3 =&amp;gt; 011)&#xA;!   4E   78   1001110   (7 =&amp;gt; 111)&#xA;&#xA;101-10010 001-1  011-111 011-111 011-110 111-1001110&#xA;(5)-( H ) (1)(e) (3)-(l) (3)-(l) (3)-(o) (7)-(  !  )&#xA;&#xA;=&amp;gt; 1011001000110111110111110111101111001110&#xA;(²7ß{Î, under ISO-8859-7 encoding)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And, &quot;Hello!&quot; fits into a clean 5 bytes under this encoding, as opposed to 6-byte standard encoding. This would equate to a lot more bytes saved for a higher sample size.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Suggestions?&lt;/p&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2016-01-23T04:38:24.027" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8185" PostTypeId="2" ParentId="8182" CreationDate="2016-01-23T08:18:05.770" Score="8" Body="&lt;h2&gt;Making a circuit is programming&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://esolangs.org/wiki/Brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brainfuck&lt;/a&gt; is definitely programming, and it's a bunch of register move commands. So is &lt;a href=&quot;https://codegolf.stackexchange.com/q/37071/20260&quot;&gt;bit hacking&lt;/a&gt; and other kinds of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot;&gt;atomic code golf&lt;/a&gt;. Think of logic gates the same way -- a low-level Turing-tarpit &amp;quot;esolang&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;All the examples in question are about circuits, so I'll just leave it at that.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-23T08:18:05.770" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8187" PostTypeId="1" CreationDate="2016-01-23T23:49:01.963" Score="-1" ViewCount="68" Body="&lt;p&gt;When &lt;a href=&quot;https://meta.stackexchange.com/questions/272956/a-new-code-license-the-mit-this-time-with-attribution-required?cb=1&quot;&gt;Stack Exchange changes to the MIT license&lt;/a&gt;, &lt;a href=&quot;https://meta.stackexchange.com/a/273564/177681&quot;&gt;we won't be able to adapt answers from old code&lt;/a&gt; (except our own, or with the owner's permission).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://tvtropes.org/pmwiki/pmwiki.php/Main/AndThatsTerrible&quot; rel=&quot;nofollow noreferrer&quot;&gt;And that's terrible!&lt;/a&gt; After all, adapting old answers for new challenges is a way to help the community grow.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I guess we could go back to all our old answers, and put a note authorizing its use under MIT, but this is a lot of work.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What should we do? What &lt;em&gt;can&lt;/em&gt; we do?&lt;/p&gt;&#xA;" OwnerUserId="16842" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2016-01-23T23:52:39.133" Title="After the license change, we won't be able to adapt old answers!" Tags="|discussion|" AnswerCount="1" CommentCount="0" ClosedDate="2016-01-23T23:55:48.533" ContentLicense="CC BY-SA 3.0" />
  <row Id="8188" PostTypeId="2" ParentId="8187" CreationDate="2016-01-23T23:52:39.133" Score="5" Body="&lt;h2&gt;There's nothing to do right now.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It's not clear what, if anything, is going to happen to the license. As you can see, the proposal has a total score of -266, with Stack Exchange saying that they'll be back with more discussion. So it's clear that, at least for now, we're not switching to MIT.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If something changes, we can discuss the ramifications on our community once things are definite.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-01-23T23:52:39.133" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8189" PostTypeId="2" ParentId="2140" CreationDate="2016-01-24T01:00:43.007" Score="1" Body="&lt;h1&gt;Language Guessing&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69920/whats-the-language&quot;&gt;What&amp;#39;s the Language?&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;According to the &lt;a href=&quot;http://www.tiobe.com/index.php/content/paperinfo/tpci/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;first Google result&lt;/a&gt;, the most popular programming languages are:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Java&lt;/li&gt;&#xA;&lt;li&gt;C++&lt;/li&gt;&#xA;&lt;li&gt;C#&lt;/li&gt;&#xA;&lt;li&gt;Python&lt;/li&gt;&#xA;&lt;li&gt;PHP&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;(For our purposes, C and C++ will both be treated as C++, though the test cases may include C source code and header files)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Your Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a function that accepts a String, determines what programming language the String is, and returns its result.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input String will be in one of the five languages listed above.&lt;/li&gt;&#xA;&lt;li&gt;Your method should return a String with the name of the programming language exactly as written above.&lt;/li&gt;&#xA;&lt;li&gt;Your code must be under &lt;strong&gt;150 bytes&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;No compiling, running, or otherwise evaluating the test cases to determine their language.&lt;/li&gt;&#xA;&lt;li&gt;No standard loopholes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The code with the highest match percentage wins&lt;/li&gt;&#xA;&lt;li&gt;For every 15 bytes under the 150 byte limit, you get an extra percentage point (a 61-75 byte program would get 5% extra on top of the match percentage.&lt;/li&gt;&#xA;&lt;li&gt;The method or function header does not count toward the total byte count. Return statements do count, however.&lt;/li&gt;&#xA;&lt;li&gt;The code used to load the test cases and feed them into your method does not count either.&lt;/li&gt;&#xA;&lt;li&gt;You get one import for &quot;free&quot;. Any other imports count toward the byte limit.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases and Testing Code&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here is sample java code used for testing submissions. If you write in a language besides java, your tester must only accept one parameter, and cannot access any variables that are stored between iterations of the function. The entire code, including the tester, must be included in your answer.&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-java prettyprint-override&quot;&gt;&lt;code&gt;import java.util.*;&#xA;import java.io.*;&#xA;&#xA;public class Tester{&#xA;&#xA;    static int right = 0;//How many are right&#xA;    static int total = 0;//How many tested in all&#xA;&#xA;    public static void main(String[] args){&#xA;&#xA;        //Opens up test cases&#xA;        File rootFolder = new File(&quot;./Test Cases&quot;);&#xA;        File[] subFolders = rootFolder.listFiles();&#xA;&#xA;        HashMap&amp;lt;File, String&amp;gt; fileList = new HashMap&amp;lt;&amp;gt;();&#xA;&#xA;        //Add all files in a subfolder to a HashMap and associate them with the language&#xA;        for(File currentFolder : subFolders){&#xA;            if(currentFolder.isDirectory()){&#xA;                for(File currentFile : currentFolder.listFiles()){&#xA;                    fileList.put(currentFile, currentFolder.getName());&#xA;                }&#xA;            }&#xA;        }&#xA;&#xA;        //Iterate through files&#xA;        fileList.forEach((File f,String lang)-&amp;gt;{&#xA;            System.out.print(&quot;Testing &quot; + f.getName()+&quot;\t&quot;);&#xA;&#xA;            try{&#xA;                //Get contents of file&#xA;                BufferedInputStream input = new BufferedInputStream( new FileInputStream(f));&#xA;                Scanner sc = new Scanner(input);&#xA;                sc.useDelimiter(&quot;\\Z&quot;);&#xA;                String contents = sc.next();&#xA;&#xA;                //Call compute method and store result&#xA;                String result = compute(contents);&#xA;&#xA;                //Increment counters&#xA;                if(result.equals(lang))&#xA;                    right++;&#xA;                total++;&#xA;&#xA;                System.out.println(&quot;Guess: &quot; + result +&quot;\tActual: &quot; + lang);&#xA;            } catch(IOException e){&#xA;                System.out.println(&quot;There was an error when reading the file&quot;);&#xA;            }&#xA;        });&#xA;&#xA;        //Print out final results&#xA;        System.out.println(&quot;Right: &quot; + right);&#xA;        System.out.println(&quot;Total: &quot; + total);&#xA;        System.out.println(&quot;Percent: &quot; + (double)right * 100.0 / total + &quot;%&quot;);&#xA;    }&#xA;&#xA;    public static String compute(String c){&#xA;        //YOUR CODE HERE&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The test cases consist of 500 code samples (100 from each language) from around the internet (mostly github). Specific locations can be found in &lt;code&gt;Credit.txt&lt;/code&gt; in the Test Cases folder.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The test cases can be downloaded &lt;a href=&quot;https://www.dropbox.com/s/fpb9771ilmap0r3/Language%20Guessing.zip?dl=0&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="41505" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:26.847" LastActivityDate="2016-01-24T01:26:47.237" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="8191" PostTypeId="2" ParentId="2447" CreationDate="2016-01-24T03:58:32.340" Score="-8" Body="&lt;h1&gt;Programs running under Unix may produce output by overwriting their command-line arguments, which changes what &lt;code&gt;ps&lt;/code&gt; reports.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'm posting this because it was brought up as a loophole in &lt;a href=&quot;https://codegolf.stackexchange.com/a/61388/14031&quot;&gt;my answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/61115/14031&quot;&gt;this question&lt;/a&gt;.  I personally think it should &lt;em&gt;not&lt;/em&gt; be allowed, because it's obscure, not available in all languages, and ephemeral (someone has to run &lt;code&gt;ps&lt;/code&gt; while the program is still executing).&lt;/p&gt;&#xA;" OwnerUserId="14031" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-01-24T03:58:32.340" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8192" PostTypeId="1" CreationDate="2016-01-24T14:27:10.070" Score="4" ViewCount="63" Body="&lt;p&gt;The tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/networking&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;networking&amp;#39;&quot; rel=&quot;tag&quot;&gt;networking&lt;/a&gt; has no current definition nor usage guidance, yet has three questions in it. It appears the one of the questions was attempting to use the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt; tag, and that some questions in the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt; tag were actually looking for what I thought &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/networking&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;networking&amp;#39;&quot; rel=&quot;tag&quot;&gt;networking&lt;/a&gt; was all about.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can we have a wiki/description for the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/networking&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;networking&amp;#39;&quot; rel=&quot;tag&quot;&gt;networking&lt;/a&gt; tag?&lt;/p&gt;&#xA;" OwnerUserId="44713" LastActivityDate="2016-01-27T00:06:56.427" Title="Networking Tag Clarification" Tags="|support|tags|tag-wikis|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8193" PostTypeId="2" ParentId="2140" CreationDate="2016-01-24T14:50:07.907" Score="0" Body="&lt;h1&gt;There's an &lt;s&gt;App&lt;/s&gt; SE Site for that&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stack-exchange-api&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stack-exchange-api&amp;#39;&quot; rel=&quot;tag&quot;&gt;stack-exchange-api&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/file-system&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;file-system&amp;#39;&quot; rel=&quot;tag&quot;&gt;file-system&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Oftentimes, when searching through StackExchange, I find myself seeking to post a question about something or another, but not knowing where to post it. That's where you come in.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a full-functioning program that does the following:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Takes an input string&lt;/li&gt;&#xA;&lt;li&gt;Attempts to find suitable SE sites relevant to the input string (this is &lt;em&gt;very&lt;/em&gt; flexible, but should not be returning English.SE for questions about Coffee, for example)&lt;/li&gt;&#xA;&lt;li&gt;Attempts to find 3 questions on each suitable site that may relate to the input string (should match the list of questions if I searched in the search bar of each site, sorted by number of votes)&lt;/li&gt;&#xA;&lt;li&gt;&quot;Output&quot; is a folder tree written to disk with the following qualities:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The highest folder of the tree should be named the input string.&lt;/li&gt;&#xA;&lt;li&gt;The second-highest layer should consist of folders named the same as the sites on which the input string was found suitable.&lt;/li&gt;&#xA;&lt;li&gt;The third layer should be &amp;lt;=3 .md files that are named the same as the questions found when searching through the suitable sites, the contents of which are the question's markup content.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You MUST query for this information. I don't want 50EB solutions.&lt;/li&gt;&#xA;&lt;li&gt;&quot;Suitable sites&quot; are defined as the keyword appearing in the site description.&lt;/li&gt;&#xA;&lt;li&gt;Run time should be &amp;lt;5 minutes for &gt;3 MB internet speed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Bonuses&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There are no bonuses.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Remember - SE is a big place now, and, as of such, we must compensate with short code. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, everybody, so the shortest solution wins!&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="44713" LastEditDate="2016-01-29T20:45:40.070" LastActivityDate="2016-01-29T20:45:40.070" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8195" PostTypeId="2" ParentId="8047" CreationDate="2016-01-24T21:39:45.303" Score="38" Body="&lt;h2&gt;Using shortest code as a tie-breaking winning criterion in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; questions&lt;/h2&gt;&#xA;&lt;p&gt;In challenges such as &lt;a href=&quot;https://codegolf.stackexchange.com/q/69920/45941&quot;&gt;this one&lt;/a&gt;, there is nothing stopping users from copying another answer's solution, implementing it in a terser language, and posting it as a separate answer. The user therefore would receive the same score for their submission and win the tie-breaker, despite the original user doing the lion's share of the work and being more deserving of winning.&lt;/p&gt;&#xA;&lt;p&gt;Using earliest submission as the tie-breaking criterion avoids this problem entirely.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-24T21:39:45.303" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="8196" PostTypeId="2" ParentId="8121" CreationDate="2016-01-24T22:06:38.593" Score="8" Body="&lt;h2&gt;Why am I here?&lt;/h2&gt;&#xA;&lt;p&gt;I was browsing through StackOverflow one day, and decided to check out some of the other StackExchange sites. I found this one, registered, started participating, and the rest is history.&lt;/p&gt;&#xA;&lt;h2&gt;How do I think PPCG can &amp;quot;fit in&amp;quot; to SE in general more? What benefit can it provide to SE that facilitates SE's ultimate goal?&lt;/h2&gt;&#xA;&lt;p&gt;StackExchange, when taken at face value, is a collection of Q&amp;amp;A sites. When you look at it that way, PPCG doesn't really fit in; we're more of a &amp;quot;challenge and solution&amp;quot; site, which has some pretty major differences from other sites. However, I think that viewpoint is naïve and limiting. To me, StackExchange is a trove of knowledge. It's a place to learn about a huge variety of different things, including &lt;a href=&quot;http://gaming.stackexchange.com&quot;&gt;video games&lt;/a&gt;, &lt;a href=&quot;https://scifi.stackexchange.com/&quot;&gt;science fiction and fantasy&lt;/a&gt;, and &lt;a href=&quot;https://electronics.stackexchange.com/&quot;&gt;electrical engineering&lt;/a&gt; (just to name a few other sites I've joined). Certainly, PPCG fits into that model. It's a creative outlet where users can learn more about the nuances of various programming languages, learn &lt;em&gt;more&lt;/em&gt; programming languages, and learn about the process of designing and creating programming languages. While our primary purpose is for entertainment, we do frequently learn a lot of things useful outside of PPCG, and occasionally make &lt;a href=&quot;https://codegolf.stackexchange.com/a/51662/8478&quot;&gt;interesting contributions to the world of mathematics&lt;/a&gt;. PPCG is a trove of knowledge, and therefore it fits in the StackExchange model.&lt;/p&gt;&#xA;&lt;h2&gt;In what ways do I think we can continue to innovate and expand? How can users who can't or don't want to golf participate on such a &amp;quot;golf-centric&amp;quot; site?&lt;/h2&gt;&#xA;&lt;p&gt;I am all for the creation of new challenge types. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; was the original challenge type, and so it will probably always be the most popular, but we've created several new challenge types over the years (whether that was for better or for worse is another topic altogether). If we want to expand, we need to continue expanding the types of challenges we pose.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, we need to emphasize more that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges are more of challenges within languages than between languages. While there is a single objective winner, users should never be discouraged from posting a solution in an unused language simply because it has no chance of being the absolute-shortest solution. More solutions in different languages is beneficial and essential for site health - having lots of answers to questions pushes those questions to the Hot Network Questions list, the source of a huge part of our traffic. However, quality should not be sacrificed in this pursuit. We don't want 50 crappy challenges per day; we want 10 awesome questions per day.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt; is also a bit of a contested issue. Some important debates we've had concerning it include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should we get rid of the Sandbox?&lt;/li&gt;&#xA;&lt;li&gt;Should the Sandbox be on Meta or Main?&lt;/li&gt;&#xA;&lt;li&gt;How can we encourage use of the Sandbox for getting feedback on challenges before posting them to Main?&lt;/li&gt;&#xA;&lt;li&gt;How can we encourage users to provide more feedback on Sandboxed questions (i.e. how to get people other than Peter to regularly give feedback on Sandboxed questions)?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Answering those questions is essential for site health. The Sandbox in its current state sort of works, but questions frequently leave the Sandbox without all the rough edges worked out. We need to solve these issues so that we can continue to improve question quality. I personally believe the current state of the Sandbox is to blame for our relatively low questions per day (compared to other SE sites) - it acts as a bottleneck for challenges, because it can take a long time to get sufficient feedback for a challenge to be ready for posting to Main (sometimes the sufficient feedback never even comes).&lt;/p&gt;&#xA;&lt;p&gt;On a related note, we don't really have a guide for how to create a good challenge. We have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges&quot;&gt;list&lt;/a&gt; of things to not do, but we are woefully lacking a list of things that would-be challenge authors probably should do. These lists can't ever be definitive because formulating and posting challenges can't be reduced to a to-do list, but they would definitely help with outlining what makes a good challenge versus a bad challenge.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-27T03:13:26.010" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8197" PostTypeId="2" ParentId="2140" CreationDate="2016-01-24T22:40:43.493" Score="2" Body="&lt;h2&gt;Roll a Die&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Most of the time in PPCG, challenges that involve dice rolling normally focus on some numeric property. However all I want you to do is to actually display the die itself in an isometric 3D format.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program or function should accept two optional integers representing the numbers to be displayed on the top and the front of the die respectively. If no valid value for the top is given then one of the 24 possible rolls should be uniformly chosen (but it does not need to be completely random so a time-dependent result is acceptable). If no valid value for the front is given then one of the 4 valid values should be uniformly chosen.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The die to be displayed is a standard Western die. Example: when rolling a 4, if the 1 is at the front, the number to the right is a 5; to display any other number would be an error. A more complex example is also shown below; in this case, not only is the 2 the correct number to display on the right, but all three numbers must be displayed as shown, i.e. the diagonal of the number 2 must point from 1/4 to 3/6 and not 1/3 to 4/6; the diagonal of the number 3 must point from 1/5 to 2/6 and not 1/2 to 5/6; the number 6 must point from 3 to 4 and not from 2 to 5.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;    o-------o     o-------o &#xA;   / *   * /|    / *   * /| &#xA;  /       /*|   / *   * / | &#xA; / *   * /  |  / *   * /  | &#xA;o-------o*  | o-------o*  | &#xA;|       | * | |     * |   | &#xA;|       |  *o |       |  *o &#xA;|   *   |  /  |   *   |  /  &#xA;|       |*/   |       | /   &#xA;|       |/    | *     |/    &#xA;o-------o     o-------o     &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You must draw all the sides, corners and pips preferably using the characters as shown above. Additional whitespace is permissible if you are consistent (only the pips may vary between rolls).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer will be the winner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Reference code (Batch):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;@echo off&#xA;setlocal enableextensions&#xA;call :%1%2 2&amp;gt;nul&#xA;if errorlevel 1 call :%1 2&amp;gt;nul&#xA;if errorlevel 1 goto %time:~6,1%&#xA;goto :eof&#xA;:1&#xA;set /a front = (%time:~7,1% %% 2) * 2 + (%time:~9,1% %% 2) + 2&#xA;goto 1%front%&#xA;:2&#xA;set /a front = (%time:~7,1% %% 2) * 3 + (%time:~9,1% %% 2) * 2 + 1&#xA;goto 2%front%&#xA;:3&#xA;set /a front = (%time:~7,1% %% 2) * 4 + (%time:~9,1% %% 2) + 1&#xA;goto 5%front%&#xA;:4&#xA;set /a front = (%time:~7,1% %% 2) * 4 + (%time:~9,1% %% 2) + 1&#xA;goto 5%front%&#xA;:5&#xA;set /a front = (%time:~7,1% %% 2) * 3 + (%time:~9,1% %% 2) * 2 + 1&#xA;goto 5%front%&#xA;:6&#xA;set /a front = (%time:~7,1% %% 2) * 2 + (%time:~9,1% %% 2) + 2&#xA;goto 6%front%&#xA;:12&#xA;echo     o-------o&#xA;echo    /       /^|&#xA;echo   /   *   /*^|&#xA;echo  /       /  ^|&#xA;echo o-------o   ^|&#xA;echo ^| *     ^| * ^|&#xA;echo ^|       ^|   o&#xA;echo ^|       ^|  /&#xA;echo ^|       ^|*/&#xA;echo ^|     * ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:13&#xA;echo     o-------o&#xA;echo    /       /^|&#xA;echo   /   *   /*^|&#xA;echo  /       /  ^|&#xA;echo o-------o*  ^|&#xA;echo ^|     * ^| * ^|&#xA;echo ^|       ^|  *o&#xA;echo ^|   *   ^|  /&#xA;echo ^|       ^|*/&#xA;echo ^| *     ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:14&#xA;echo     o-------o&#xA;echo    /       /^|&#xA;echo   /   *   / ^|&#xA;echo  /       /  ^|&#xA;echo o-------o*  ^|&#xA;echo ^| *   * ^|   ^|&#xA;echo ^|       ^|  *o&#xA;echo ^|       ^|  /&#xA;echo ^|       ^| /&#xA;echo ^| *   * ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:15&#xA;echo     o-------o&#xA;echo    /       /^|&#xA;echo   /   *   /*^|&#xA;echo  /       /  ^|&#xA;echo o-------o*  ^|&#xA;echo ^| *   * ^|   ^|&#xA;echo ^|       ^|  *o&#xA;echo ^|   *   ^|  /&#xA;echo ^|       ^|*/&#xA;echo ^| *   * ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:21&#xA;echo     o-------o&#xA;echo    / *     /^|&#xA;echo   /       /*^|&#xA;echo  /     * /  ^|&#xA;echo o-------o*  ^|&#xA;echo ^|       ^|   ^|&#xA;echo ^|       ^|  *o&#xA;echo ^|   *   ^|  /&#xA;echo ^|       ^|*/&#xA;echo ^|       ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:23&#xA;echo     o-------o&#xA;echo    /     * /^|&#xA;echo   /       / ^|&#xA;echo  / *     /  ^|&#xA;echo o-------o   ^|&#xA;echo ^| *     ^| * ^|&#xA;echo ^|       ^|   o&#xA;echo ^|   *   ^|  /&#xA;echo ^|       ^| /&#xA;echo ^|     * ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:24&#xA;echo     o-------o&#xA;echo    /     * /^|&#xA;echo   /       /*^|&#xA;echo  / *     /* ^|&#xA;echo o-------o*  ^|&#xA;echo ^| *   * ^|   ^|&#xA;echo ^|       ^|  *o&#xA;echo ^|       ^| */&#xA;echo ^|       ^|*/&#xA;echo ^| *   * ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:26&#xA;echo     o-------o&#xA;echo    / *     /^|&#xA;echo   /       / ^|&#xA;echo  /     * /  ^|&#xA;echo o-------o*  ^|&#xA;echo ^| * * * ^| * ^|&#xA;echo ^|       ^|  *o&#xA;echo ^|       ^|  /&#xA;echo ^|       ^| /&#xA;echo ^| * * * ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:31&#xA;echo     o-------o&#xA;echo    /     * /^|&#xA;echo   /   *   /*^|&#xA;echo  / *     /  ^|&#xA;echo o-------o   ^|&#xA;echo ^|       ^|   ^|&#xA;echo ^|       ^|   o&#xA;echo ^|   *   ^|  /&#xA;echo ^|       ^|*/&#xA;echo ^|       ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:32&#xA;echo     o-------o&#xA;echo    / *     /^|&#xA;echo   /   *   /*^|&#xA;echo  /     * /  ^|&#xA;echo o-------o* *^|&#xA;echo ^|     * ^|   ^|&#xA;echo ^|       ^|* *o&#xA;echo ^|       ^|  /&#xA;echo ^|       ^|*/&#xA;echo ^| *     ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:35&#xA;echo     o-------o&#xA;echo    / *     /^|&#xA;echo   /   *   / ^|&#xA;echo  /     * /  ^|&#xA;echo o-------o   ^|&#xA;echo ^| *   * ^| * ^|&#xA;echo ^|       ^|   o&#xA;echo ^|   *   ^|  /&#xA;echo ^|       ^| /&#xA;echo ^| *   * ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:36&#xA;echo     o-------o&#xA;echo    /     * /^|&#xA;echo   /   *   /*^|&#xA;echo  / *     /  ^|&#xA;echo o-------o*  ^|&#xA;echo ^| *   * ^| * ^|&#xA;echo ^|       ^|  *o&#xA;echo ^| *   * ^|  /&#xA;echo ^|       ^|*/&#xA;echo ^| *   * ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:41&#xA;echo     o-------o&#xA;echo    / *   * /^|&#xA;echo   /       /*^|&#xA;echo  / *   * /  ^|&#xA;echo o-------o*  ^|&#xA;echo ^|       ^| * ^|&#xA;echo ^|       ^|  *o&#xA;echo ^|   *   ^|  /&#xA;echo ^|       ^|*/&#xA;echo ^|       ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:42&#xA;echo     o-------o&#xA;echo    / *   * /^|&#xA;echo   /       / ^|&#xA;echo  / *   * /  ^|&#xA;echo o-------o   ^|&#xA;echo ^|     * ^| * ^|&#xA;echo ^|       ^|   o&#xA;echo ^|       ^|  /&#xA;echo ^|       ^| /&#xA;echo ^| *     ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:45&#xA;echo     o-------o&#xA;echo    / *   * /^|&#xA;echo   /       /*^|&#xA;echo  / *   * /  ^|&#xA;echo o-------o* *^|&#xA;echo ^| *   * ^|   ^|&#xA;echo ^|       ^|* *o&#xA;echo ^|   *   ^|  /&#xA;echo ^|       ^|*/&#xA;echo ^| *   * ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:46&#xA;echo     o-------o&#xA;echo    / *   * /^|&#xA;echo   /       /*^|&#xA;echo  / *   * /  ^|&#xA;echo o-------o   ^|&#xA;echo ^| *   * ^|   ^|&#xA;echo ^|       ^|   o&#xA;echo ^| *   * ^|  /&#xA;echo ^|       ^|*/&#xA;echo ^| *   * ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:51&#xA;echo     o-------o&#xA;echo    / *   * /^|&#xA;echo   /   *   / ^|&#xA;echo  / *   * /  ^|&#xA;echo o-------o*  ^|&#xA;echo ^|       ^| * ^|&#xA;echo ^|       ^|  *o&#xA;echo ^|   *   ^|  /&#xA;echo ^|       ^| /&#xA;echo ^|       ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:53&#xA;echo     o-------o&#xA;echo    / *   * /^|&#xA;echo   /   *   /*^|&#xA;echo  / *   * /* ^|&#xA;echo o-------o*  ^|&#xA;echo ^| *     ^|   ^|&#xA;echo ^|       ^|  *o&#xA;echo ^|   *   ^| */&#xA;echo ^|       ^|*/&#xA;echo ^|     * ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:54&#xA;echo     o-------o&#xA;echo    / *   * /^|&#xA;echo   /   *   / ^|&#xA;echo  / *   * /  ^|&#xA;echo o-------o   ^|&#xA;echo ^| *   * ^| * ^|&#xA;echo ^|       ^|   o&#xA;echo ^|       ^|  /&#xA;echo ^|       ^| /&#xA;echo ^| *   * ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:56&#xA;echo     o-------o&#xA;echo    / *   * /^|&#xA;echo   /   *   /*^|&#xA;echo  / *   * /  ^|&#xA;echo o-------o*  ^|&#xA;echo ^| * * * ^|   ^|&#xA;echo ^|       ^|  *o&#xA;echo ^|       ^|  /&#xA;echo ^|       ^|*/&#xA;echo ^| * * * ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:62&#xA;echo     o-------o&#xA;echo    / * * * /^|&#xA;echo   /       /*^|&#xA;echo  / * * * /  ^|&#xA;echo o-------o*  ^|&#xA;echo ^| *     ^|   ^|&#xA;echo ^|       ^|  *o&#xA;echo ^|       ^|  /&#xA;echo ^|       ^|*/&#xA;echo ^|     * ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:63&#xA;echo     o-------o&#xA;echo    / *   * /^|&#xA;echo   / *   * / ^|&#xA;echo  / *   * /  ^|&#xA;echo o-------o*  ^|&#xA;echo ^|     * ^|   ^|&#xA;echo ^|       ^|  *o&#xA;echo ^|   *   ^|  /&#xA;echo ^|       ^| /&#xA;echo ^| *     ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:64&#xA;echo     o-------o&#xA;echo    / *   * /^|&#xA;echo   / *   * /*^|&#xA;echo  / *   * /  ^|&#xA;echo o-------o*  ^|&#xA;echo ^| *   * ^| * ^|&#xA;echo ^|       ^|  *o&#xA;echo ^|       ^|  /&#xA;echo ^|       ^|*/&#xA;echo ^| *   * ^|/&#xA;echo o-------o&#xA;goto :eof&#xA;:65&#xA;echo     o-------o&#xA;echo    / * * * /^|&#xA;echo   /       /*^|&#xA;echo  / * * * /  ^|&#xA;echo o-------o   ^|&#xA;echo ^| *   * ^| * ^|&#xA;echo ^|       ^|   o&#xA;echo ^|   *   ^|  /&#xA;echo ^|       ^|*/&#xA;echo ^| *   * ^|/&#xA;echo o-------o&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;        o-------o&#xA;        | *   * |&#xA;        |       |&#xA;        |   *   |&#xA;        |       |&#xA;        | *   * |&#xA;o-------o-------o-------o-------o&#xA;| *   * |       | *     | * * * |&#xA;|       |       |       |       |&#xA;|       |   *   |   *   |       |&#xA;|       |       |       |       |&#xA;| *   * |       |     * | * * * |&#xA;o-------o-------o-------o-------o&#xA;        | *     |&#xA;        |       |&#xA;        |       |&#xA;        |       |&#xA;        |     * |&#xA;        o-------o&#xA;&#xA;&#xA;    o-------o&#xA;   / * * * /|&#xA;  / * * * /*|&#xA; / * * * /* |&#xA;o-------o* *|&#xA;| * * * | * |&#xA;|       |* *o&#xA;| * * * | */&#xA;|       |*/&#xA;| * * * |/&#xA;o-------o&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="194" LastEditDate="2016-01-25T21:03:32.877" LastActivityDate="2016-01-25T21:03:32.877" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8198" PostTypeId="2" ParentId="2140" CreationDate="2016-01-25T05:16:16.183" Score="2" Body="&lt;h1&gt;Sock Drawer Simulator&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Socks are often kept in drawers, and when people wear socks they like the left and right socks to match &lt;sup&gt;&lt;a href=&quot;http://example.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;[citation needed]&lt;/a&gt;&lt;/sup&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given an array of the number of socks of each color, simulate the process of drawing socks, and output the color of the first pair found. You may assume that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Socks are drawn sequentially, randomly and without replacement.&lt;/li&gt;&#xA;&lt;li&gt;A pair is found when a sock of a color that has already been drawn is drawn.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Obviously, the precise algorithm doesn't matter as long as the output probability distribution is correct.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;A nonempty array of positive integers representing the frequency of each color of sock. For example, &lt;code&gt;[3,1,4,1,5]&lt;/code&gt; could represent a drawer with three teal, one aquamarine, four green, one cyan, and five cerulean socks. There will always be at least one possible pair.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;A nonnegative integer representing the color (index) of the sock drawn. You may consistently use either one-indexed or zero-indexed arrays.&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-11-20T19:45:17.950" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="8201" PostTypeId="1" AcceptedAnswerId="8202" CreationDate="2016-01-25T14:58:30.317" Score="8" ViewCount="321" Body="&lt;p&gt;This morning I posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/70113/how-far-is-the-sun&quot;&gt;a challenge&lt;/a&gt; (&lt;s&gt;2k users only&lt;/s&gt;). &lt;s&gt;It's &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8156/41859&quot;&gt;back in the sandbox&lt;/a&gt; now, visible for anybody and for review.&lt;/s&gt; I had this challenge in the sandbox for 5 days before I posted it. With some help we worked out minor bugs. I missed one thing in my example calculation before going live, but that's fixed now as well.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;However. After I posted it this morning it almost immediately received multiple down votes. The comments I got where:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;About date/time&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;What should programming languages do that cannot access the current time? Like BF etc?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Well I don't have an answer for that. I think if only questions are allowed that every language can solve, a lot of other challenge must considered invalid. And if a language is not suitable for a task, simply don't use it.&lt;/p&gt;&#xA;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;Verification&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;And since this formula seems very approximate, you'll have to be clear on how answers are to be verified&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I thought that in his question everything is really clear. There's a concrete formula. Everything on top is explicitly described as well. And of course the formula is an approximate expression but that's not the point of the question. Actually what has to be done looks very definite to me.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;It would be great if you could help me, if I'm totally on the wrong path here. I don't know whether the down votes came because of those comments. Maybe you see different things, then please address them too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I still think it's a well worded and clear question with a very concrete calculation. Of course it's not accurate that any space agencies will use some golfed code from this site in the end. I thought it might be something different beside the usual array and string manipulation. I like to repost it sometime, but currently I'm unsure about it.&lt;/p&gt;&#xA;" OwnerUserId="41859" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2016-01-25T17:10:23.747" Title="What's wrong or unclear with this challenge?" Tags="|discussion|specific-question|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8202" PostTypeId="2" ParentId="8201" CreationDate="2016-01-25T15:20:44.913" Score="9" Body="&lt;p&gt;Personally, I don't think it's very unclear at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Date/time:&lt;/strong&gt; I don't see the issue here, to be honest. Just say &quot;you need to use a language that can figure out the current time&quot;. Another option would be to allow time as input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Verification:&lt;/strong&gt; Again, since you have example code, verification should be simple. To be lenient with floating point nonsense, you specify an minimum accuracy, so no major issues there.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The only &lt;em&gt;real&lt;/em&gt; problem I see with it is a matter of opinion. It seems a bit... boring. A straightforward calculation doesn't appear to leave much room for golfing. I didn't downvote because of this, and others may disagree. Still, it might be worth looking at ways to make it more interesting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are other possible reasons for a downvote. For example, some people don't like bonuses on what should be a straight golf, etc. Without a direct comment about that, though, it's hard to know exactly what it was.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;However&lt;/em&gt;, I don't understand why you deleted it. As far as I can tell, it wasn't very badly received. Before deletion, it was at +4/-2, which isn't really a bad judgement. Don't be so hard on yourself.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="14215" LastEditDate="2016-01-25T15:26:21.230" LastActivityDate="2016-01-25T15:26:21.230" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8203" PostTypeId="2" ParentId="8201" CreationDate="2016-01-25T15:25:13.997" Score="7" Body="&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Not all programming languages can perform all tasks. That's simply a fact.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are &lt;em&gt;artificial&lt;/em&gt; reasons that exclude some languages (e.g., input must be read from a file) and there are &lt;em&gt;natural&lt;/em&gt; reasons (e.g., accesing the current time). As long as some languages are excluded for natural reasons, I don't think there's anything wrong with it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I dare to guess that even if you optionally passed the current time as input to the programs, you wouldn't get a brainfuck answer anyway. The floating point multiplication and the cosine won't be very pleasent to deal with.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;As long as you clearly state that the output must match *your &lt;em&gt;formula&lt;/em&gt; (rather than the real value), I don't see a problem here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that this might the use of built-ins impossible, but that isn't necessarily a bad thing.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;As for other potential sources of downvotes, note that bonuses are now officially one of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8106&quot;&gt;things to avoid when writing challenges&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Last but not least, while &lt;em&gt;two&lt;/em&gt; is technically &lt;em&gt;multiple&lt;/em&gt; downvotes, it makes it seem worse than it is. I wouldn't rush to conclusions just because two users clicked the downvote button.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-01-25T15:25:13.997" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8205" PostTypeId="2" ParentId="2140" CreationDate="2016-01-25T20:56:39.457" Score="1" Body="&lt;h2&gt;Semaphore Decoder&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You are to write a program which can decode ASCII semaphores.  Each semaphore fits in a 3x2 grid, with the flagger's head represented by a &lt;code&gt;o&lt;/code&gt; (which is always in the upper middle square), and his flags represented by &lt;code&gt;_ | / \&lt;/code&gt;.  Each block is separated by one blank column.  Text may continue onto additional lines if it gets too long.  The letters look like the following format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[Space]  o   A  o  B _o  C \o  D |o  E o/  F o_  G o   H _o  I \o  J |o_&#xA;        | |    /|     |     |     |    |     |     |\    /      /       &#xA;&#xA;K  o|  L  o/  M  o_  N  o   O _o\  P _o|  Q _o/  R _o_  S _o   T \o|&#xA;  /      /      /      / \                                  \&#xA;&#xA;U \o/   V |o   W /o_  X o/  Y \o_  Z o_&#xA;            \           \             \&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;To keep your messages from being observed by spies, your code must be as short as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;_o| _o_ _o\  o   o   o_  o_ \o   o   o   o  _o| \o/  o_  o_  o/  o/ _o   o&#xA;             |\ /|  /   /    /  / \  |\ | |           \   \ /    |    \ | |&#xA; o   o  |o   o  \o  _o\ |o   o/  o   o   o/ _o\  o/  o_&#xA;/|  / \  |  | |  |       |   |  | |  |\ /       /    |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;PROGRAMMING PUZZLES AND CODE GOLF&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="42471" LastEditorUserId="42471" LastEditDate="2016-01-26T20:45:26.183" LastActivityDate="2016-01-26T20:45:26.183" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="8207" PostTypeId="2" ParentId="5532" CreationDate="2016-01-26T09:26:07.677" Score="0" Body="&lt;h1&gt;If it is forbidden, it have to be forbiden explicitly.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Some languages (like javascript) allow implicit global variable declaration inside the function. As I think there is a little difference between these cases, so declaring variables outside of the function should be allowed too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By the way, using of helper functions is allowed too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the author wants to prevent global variable, he have to write in challenge rules that function have to be free of side effects. I've seen some challenges with this requirement.&lt;/p&gt;&#xA;" OwnerUserId="32091" LastActivityDate="2016-01-26T09:26:07.677" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8212" PostTypeId="2" ParentId="8192" CreationDate="2016-01-27T00:06:56.427" Score="4" Body="&lt;p&gt;Here's a start:&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Challenges related to topics in &lt;a href=&quot;https://en.wikipedia.org/wiki/Computer_network&quot; rel=&quot;nofollow&quot;&gt;Computer Networking&lt;/a&gt;, including:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Internet_protocol_suite&quot; rel=&quot;nofollow&quot;&gt;TCP/IP Stack&lt;/a&gt; (including &lt;a href=&quot;https://en.wikipedia.org/wiki/Link_layer&quot; rel=&quot;nofollow&quot;&gt;lower layers&lt;/a&gt; - Ethernet, WiFi, PPP, etc)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/IP_address&quot; rel=&quot;nofollow&quot;&gt;IP/IPV6 addressing&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Routing_protocol&quot; rel=&quot;nofollow&quot;&gt;Routing protocols&lt;/a&gt; and associated calculations&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Network_interface_controller&quot; rel=&quot;nofollow&quot;&gt;NIC&lt;/a&gt;, &lt;a href=&quot;https://en.wikipedia.org/wiki/Router_(computing)&quot; rel=&quot;nofollow&quot;&gt;router&lt;/a&gt; and &lt;a href=&quot;https://en.wikipedia.org/wiki/Network_switch&quot; rel=&quot;nofollow&quot;&gt;switch&lt;/a&gt; configuration&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="11259" LastActivityDate="2016-01-27T00:06:56.427" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8213" PostTypeId="2" ParentId="8121" CreationDate="2016-01-27T04:11:43.867" Score="1" Body="&lt;h1&gt;Who are you?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'm isaacg. I'm a very involved member of the site, mainly in code-golf. I wrote Pyth, a popular code-golfing language.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Why are you (still) here?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I love programming for fun. In addition, I have a competitive streak - I love to compete against other people in whatever I do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code Golf gives a great avenue to program for fun in a competitive way. As an outgrowth of this, I decided to write Pyth, which has been a wonderful experience. It's an entirely separate avenue along which to compete and have fun. In addition, the PPCG community has helped support and add to Pyth, with bug reports, requests from features, creating the online Pyth compiler and more.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Our place in the Stack Exchange network&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;To me, PPCG is the natural home of all recreational programming on the Stack Exchange network. That includes what we've defined as our mission so far, namely programming challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I think we should go farther than that. I believe programming puzzles should be on topic, even if no winner can be selected. I believe discussion of outside recreational programming sources/websites should be on topic. I believe discussion of recreational programming projects, like building golfing languages, should be on topic.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;How to improve&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We've gotten too obsessed with objectively answerable questions. We need to think about what's best for our community. This is not the type of site that Stack Exchange's core guidelines were built for, so we need to figure out what works best for us, no just try to use the existing rules.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2016-01-27T04:11:43.867" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8214" PostTypeId="2" ParentId="8047" CreationDate="2016-01-27T04:38:35.560" Score="59" Body="&lt;h2&gt;Chameleon challenges&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Chameleon challenges look like they're about one thing but are really about another. In doing the challenge, most of the effort is spent on something peripheral. Fix this by being honest about your challenge in the title and description, or by simplifying or removing the non-core parts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some causes of chameleon challenges:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Requiring a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8077/20260&quot;&gt;cumbersome input/output format&lt;/a&gt; that takes more effort to process than the challenge itself&lt;/li&gt;&#xA;&lt;li&gt;Requiring that malformed inputs are detected and specially handled.&lt;/li&gt;&#xA;&lt;li&gt;In code golf, having long fixed output strings that benefit from compression.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8106/20260&quot;&gt;Including bonuses&lt;/a&gt; that are so large that any competitive answer must do them.&lt;/li&gt;&#xA;&lt;li&gt;Scoring a challenge on a small set of test cases where it's more effective to hardcode the outputs or overfit them than to actually do the task.&lt;/li&gt;&#xA;&lt;li&gt;Scoring by fraction right on a test battery where it's not hard to get 100% right, making the tiebreak the real score.&lt;/li&gt;&#xA;&lt;li&gt;Scoring by a combination of two factors, like length and effectiveness, in a way that one contribution is much larger than the other.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2016-01-27T22:26:57.057" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8218" PostTypeId="2" ParentId="5582" CreationDate="2016-01-28T01:01:16.140" Score="4" Body="&lt;p&gt;When you are using a custom scoring criterion, make sure you specify whether smallest or largest score wins.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2016-01-28T01:01:16.140" CommentCount="0" CommunityOwnedDate="2016-01-28T01:01:16.140" ContentLicense="CC BY-SA 3.0" />
  <row Id="8219" PostTypeId="2" ParentId="5243" CreationDate="2016-01-28T04:33:05.553" Score="25" Body="&lt;h1&gt;Fitting but Unsuitable Languages(no longer active)&lt;/h1&gt;&#xA;&lt;p&gt;There are some challenges for which we all want to see answers in a certain language, even if the solution is very difficult. I'll award 500 points for an answer in such a language to any.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/61751/help-my-calculator-broke-turn-integer-expression-into-calculator-keystrokes&quot;&gt;Help! My Calculator Broke!&lt;/a&gt; in TI-BASIC, with all three bonuses&lt;/s&gt; (&lt;a href=&quot;https://codegolf.stackexchange.com/a/180042/39328&quot;&gt;Claimed by Conor O'Brien&lt;/a&gt;)&lt;/h3&gt;&#xA;&lt;h3&gt;&lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/64359/39328&quot;&gt;Gravity Simulator&lt;/a&gt; in Marbelous&lt;/s&gt; (&lt;a href=&quot;https://codegolf.stackexchange.com/a/223001/80214&quot;&gt;Claimed by user197974&lt;/a&gt;)&lt;/h3&gt;&#xA;&lt;p&gt;&lt;em&gt;Since it has been more than a year since lirtosaist has logged onto this site, Razetime has given the bounty for this on their behalf.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Current shortest solution: &lt;a href=&quot;https://codegolf.stackexchange.com/a/68586/39328&quot;&gt;157 bytes&lt;/a&gt; in JavaScript ES6 using regex.&lt;/p&gt;&#xA;&lt;p&gt;I don't know if this is even &lt;em&gt;possible&lt;/em&gt; in Marbelous, a Turing-incomplete language, so I'd be very happy to see a solution.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;strike&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/65459/hexagonal-maze-time&quot;&gt;Hexagonal Maze Time!&lt;/a&gt; in Hexagony&lt;/strike&gt; (claimed by boboquack)&lt;/h3&gt;&#xA;&lt;h3&gt;&lt;strike&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/16732/39328&quot;&gt;Minify Brainfuck&lt;/a&gt; in Brainfuck&lt;/strike&gt; (Claimed by &lt;a href=&quot;https://codegolf.stackexchange.com/a/97819/39328&quot;&gt;Mitch Schwartz&lt;/a&gt;)&lt;/h3&gt;&#xA;&lt;p&gt;I'm willing to give thousands more rep away in bounties of this type, so comment below to suggest challenges!&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="80214" LastEditDate="2021-11-19T09:40:03.870" LastActivityDate="2021-11-19T09:40:03.870" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="8223" PostTypeId="2" ParentId="2140" CreationDate="2016-01-28T20:03:47.487" Score="1" Body="&lt;p&gt;&lt;strong&gt;Windows batch polyglot/hybrids challenge with any language possible&lt;/strong&gt;&#xA;/* I need some help to refine my challenge */&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As the batch scripts are pretty limited, hybrid files that embed a code from another language into a batch file are used a lot lately.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Though usually  there are some requirements for a good hybrid script:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The embedded code should be usable as-it-is - without any ugly batch escaping sequences.&lt;/li&gt;&#xA;&lt;li&gt;There should not be redundant output. E.g. a lot of languages use &lt;strong&gt;/* */&lt;/strong&gt; for multi-line comments. If the batch script executes a line that starts with &lt;strong&gt;/ *&lt;/strong&gt; it will print an error message an will continue to the next line .Though it will allow you to hybridize C/C++/C#/Java/...  with a batch file  the error message cannot be surpassed so this will not count as a good hybrid.&lt;/li&gt;&#xA;&lt;li&gt;No temp files.It's easy to output a lot of code into a temp file that will be later executed , the IO operations will slow the script and on of the main advantages of batch scripting (the speed) will be lost. And more over is a challenging constraint. But this will be not possible for compiling languages and for extension sensitive languages.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Some examples will follow:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://groups.google.com/forum/#!topic/alt.msdos.batch.nt/b8q29_uLfQs&quot; rel=&quot;nofollow&quot;&gt;JScript&lt;/a&gt; (good for example as it comes with every windows installation) technique invented somewhere in the link by Tom Lavedas :&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;@if (true == false) @end /*&#xA;@echo off&#xA;cscript //nologo //e:javascript &quot;%~dpnx0&quot; %*&#xA;echo Output from the batch.&#xA;goto :EOF */&#xA;&#xA;WScript.Echo('Output from the jscript.');&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The output will be:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Output from the jscript.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Output from the batch.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The technique uses the JScript (javascript has no such thing) specific &lt;strong&gt;@&lt;/strong&gt; directives to make the code valid (or silent) both for both languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another example (again with JScript) invented by &lt;a href=&quot;https://gist.github.com/yaauie/959862&quot; rel=&quot;nofollow&quot;&gt;Ryan Biesemeyer&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0&amp;lt;/* :&#xA;@echo off&#xA;echo Output from the batch.&#xA;cscript /nologo /E:jscript %~f0 %*&#xA;exit /b %errorlevel%&#xA;*/0;&#xA;&#xA;WScript.Echo('Output from the jscript.');&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This time is used the redirection priority in batch scripts and &lt;code&gt;0&amp;lt;/* :&lt;/code&gt; will be parsed as &lt;code&gt;0:&amp;lt;/*&lt;/code&gt; .&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some info that can help you:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;every line that starts with &lt;strong&gt;@&lt;/strong&gt; will be silent - even the invalid commands.&lt;/li&gt;&#xA;&lt;li&gt;every line that starts with &lt;strong&gt;:&lt;/strong&gt; will be taken as label in batch and will be not executed&lt;/li&gt;&#xA;&lt;li&gt;every line that starts with something like &lt;code&gt;&amp;lt;someWord : someWord&lt;/code&gt; will be silent because of redirection priority &lt;/li&gt;&#xA;&lt;li&gt;every line that starts with something like &lt;code&gt;digit&amp;lt;someWord : someWord&lt;/code&gt; will be silent because of redirection priority (this time the output will be redirected to a stream).In this case will be best to use &lt;strong&gt;0&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;you can use &lt;code&gt;&amp;lt;space&amp;gt;&amp;lt;tab&amp;gt; ; , =&lt;/code&gt; at the beginning of every line - these will be ignored as standard delimiters in batch.Can be useful if some language use some of these as comment.&lt;/li&gt;&#xA;&lt;li&gt;if you start a line with &lt;code&gt;%not_existing_variable%&lt;/code&gt; it will be replaced with nothing.Could be useful if in some language comments start with percent.&lt;/li&gt;&#xA;&lt;li&gt;If you finish a line with a caret &lt;code&gt;^&lt;/code&gt; the next line will be appended at the end.With the caret in batch you can escape the new line.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;here's a little bit more &lt;a href=&quot;http://dostips.com/forum/viewtopic.php?f=3&amp;amp;t=6931&quot; rel=&quot;nofollow&quot;&gt;inspiration&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And here's the challenge. Your script should be with &lt;code&gt;.bat&lt;/code&gt; or &lt;code&gt;.cmd&lt;/code&gt; extension . It should contain a code from another language - the code should be used by the second language as it is (no escapes symbols)  .REPL tools are accepted with the condition of no escape symbols - except in the line where the REPL tool is invoked. There should not be redundant output. There should be not temp files (with the exception of compiling languages , and file extension sensitive languages - then the file should copy itself in the %TEMP% folder).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each script should accept one command line argument which will be printed 5 (five) times . Both from the batch part of the code and from the second language prefixed by the language name (for the batch case it should be &lt;code&gt;BATCH:&lt;/code&gt; for example.If the second language is Ruby it should be &lt;code&gt;RUBY:&lt;/code&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For sure this will be not possible with every language , but for many it is achievable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner should propose the most solutions with different languages (or if the language is the same a different kind of techniques should be used like in the two examples above).In case of equal number of solutions the first one wins.&lt;/p&gt;&#xA;" OwnerUserId="40558" LastActivityDate="2016-01-28T20:03:47.487" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8228" PostTypeId="2" ParentId="2140" CreationDate="2016-01-29T08:26:20.823" Score="0" Body="&lt;h1&gt;How many swaps do I need to sort a list?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot;&gt;sorting&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;em&gt;swap&lt;/em&gt; is defined as an operation on a list that exchanges the position of exactly two elements:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[9, 1, 3, 4, 0, 0, 3, 7, 9, 1, 4, 4, 8, 7, 3, 9, 4, 7, 0, 1]&#xA;       | &amp;lt;----------------&amp;gt; |&#xA;[9, 1, 1, 4, 0, 0, 3, 7, 9, 3, 4, 4, 8, 7, 3, 9, 4, 7, 0, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Of course, every list can be sorted via some sequence of swaps (e.g. that's how Shell sort works).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a list of single-digit integers, determine the minimum number of swaps you need to sort the list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may write a program or function, taking input via STDIN (or closest alternative), command-line argument or function argument and outputting the result via STDOUT (or closest alternative), function return value or function (out) parameter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input may be in any convenient, flat list format, as long as the data is not preprocessed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;(will follow)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sandbox Questions&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the list elements are distinct, this is simply: a) determine ordering, b) treat ordering as permutation and decompose into cycles, c) subtract one from each cycle's length and sum the results. (Which would make this a duplicate.) Off the top of my head, I can't think of a similarly simple algorithm when duplicates are allowed. Can anyone else?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2016-01-29T09:10:58.030" LastActivityDate="2016-01-29T09:10:58.030" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8231" PostTypeId="2" ParentId="8121" CreationDate="2016-01-29T14:37:47.413" Score="-3" Body="&lt;h2&gt;Who am I?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I am a new user. I do not know much programming, but I know enough to write some questions. I don't know the abc of golfing. I am 15 years old and want to become a researcher in theoretical computer science one day.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Why am I here?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To earn rep. I have an account at Puzzling SE where I have put quite a few puzzles up. It is much easier to earn rep here. Also this site is a bit interesting, though I don't understand a significant amount. I'll probably earn 4k rep and leave (temporarily, until I become a professional, probably).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;How can PPCG fit with SE?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;IMHO, sites should only strive to stick to what they think their community would like, even if this means they don't fit exactly in SE. In fact, SE should make site-specific functionality on request of the community. For example, I had written a meta post at Puzzling SE on the need for a &lt;em&gt;private sandbox&lt;/em&gt;, because the public sandbox used here wouldn't work too well there. However, no progress was made because existing site functionality could not be used.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even PPCG exploits the existing functionality in ways it wasn't intended. I'm not a regular here, but I can still imagine some site-specific functionality that would be &lt;em&gt;really&lt;/em&gt; good here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;tl,dr&lt;/strong&gt; SE should let sites get their own site-specific features, instead of being forced to adopt the existing features entirely.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;How can users who don't want to golf participate&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;They can't really, under the current system. There are other sites on SE to discuss non-golfed algorithms, but I don't think contests are really allowed there. If PPCG wants users who don't golf also to participate, they must just be &lt;em&gt;a lot more&lt;/em&gt; flexible in terms of what is on-topic.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Elevator pitch&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Sorry, I would never tell a random stranger about this site. However, I had told some of my friends about it and they are fascinated by the concept of SE, even if they aren't active users.&lt;/p&gt;&#xA;" OwnerUserId="40929" LastActivityDate="2016-01-29T14:37:47.413" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8232" PostTypeId="1" AcceptedAnswerId="8233" CreationDate="2016-01-29T16:45:12.797" Score="4" ViewCount="117" Body="&lt;p&gt;&lt;sup&gt;this is really a very inconsequential question, I'm just curious.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/70135/koth-a-world-wide-pandemic#comment171677_70135&quot;&gt;This is a comment on KOTH: A world wide pandemic:&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/FKVCw.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/FKVCw.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At least to my browser's rendering engine, there's a fairly clear difference between the &lt;s&gt;struckthrough text&lt;/s&gt; and the other text: both font style and font size.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/rFZov.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/rFZov.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As we can see, the comment's HTML attributes and CSS classes are identical to the one immediately preceding it. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;What's going on here, and how can I post comments in fancy fonts?&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-01-29T16:53:47.677" Title="How did this user format this comment in this way?" Tags="|support|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8233" PostTypeId="2" ParentId="8232" CreationDate="2016-01-29T16:50:57.107" Score="8" Body="&lt;p&gt;Those are &lt;a href=&quot;https://en.m.wikipedia.org/wiki/Strikethrough#Unicode&quot; rel=&quot;nofollow noreferrer&quot;&gt;special Unicode characters&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The “combining long stroke overlay” (U+0336) results in an unbroken stroke across the text&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Incidentally, please don't do that. They show up absolutely horribly from my phone (from which I am posting this answer)...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/W89GC.jpg&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;... for a very questionable benefit.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="3808" LastEditDate="2016-01-29T16:53:47.677" LastActivityDate="2016-01-29T16:53:47.677" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8234" PostTypeId="2" ParentId="2140" CreationDate="2016-01-29T19:42:16.973" Score="0" Body="&lt;h2&gt;Employee Scheduler&lt;/h2&gt;&#xA;&lt;p&gt;This challenge is simple: make a schedule for the student workers in my department!&lt;/p&gt;&#xA;&lt;p&gt;Student workers have to regularly update their availability to accommodate class changes every semester, and the number of student workers we have employed constantly varies. Also, student workers are not allowed to work more than 20 hours a week. Meanwhile, there are several stations that need to be manned throughout the work day.&lt;/p&gt;&#xA;&lt;h3&gt;Required Minimums:&lt;/h3&gt;&#xA;&lt;p&gt;Your program should at least be able to do the following:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Input a list of first names and times of availability&lt;/li&gt;&#xA;&lt;li&gt;Output a one month schedule that covers 4 stations 5 days a week from 800 to 1700&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;If there is a gap of time that cannot be filled based on the availability given, you should fill that gap with an obvious name like &amp;quot;NEEDED&amp;quot; or something like that. Note that the times of availability will depend on the day of the week.&lt;/p&gt;&#xA;&lt;p&gt;Your program does need to able to at least run in Windows. Also, your program absolutely may not schedule workers more than 20 hours in a week.&lt;/p&gt;&#xA;&lt;p&gt;You may assume that all student workers have been trained in all stations, so anybody can work anywhere. You also may assume that the month for which you should generate a schedule is following month (so if it is January, make a schedule for February).&lt;/p&gt;&#xA;&lt;h3&gt;Other Notes:&lt;/h3&gt;&#xA;&lt;p&gt;You'll notice I'm not specifying an IO method you must use. I trust you as a coder to pick a method that suits your program, just keep in mind this is a popularity contest and ease of use is an inevitable factor. Also, you may use 12 or 24 hour time at your discretion. Please list both the method of IO and 12 or 24 hour time in your description.&lt;/p&gt;&#xA;&lt;p&gt;Some things that I'm not requiring, but would definitely earn some kudos from me:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use a station priority system when creating the schedule (some stations should be covered before others)&lt;/li&gt;&#xA;&lt;li&gt;Try to maximize the hours given to each student (while not going over 20 hours per week, of course)&lt;/li&gt;&#xA;&lt;li&gt;Minimize overlap&lt;/li&gt;&#xA;&lt;li&gt;Make your output pretty (currently we use an excel spreadsheet that looks pretty nice)&lt;/li&gt;&#xA;&lt;li&gt;Input the number of stations&lt;/li&gt;&#xA;&lt;li&gt;Input the month for which to generate&lt;/li&gt;&#xA;&lt;li&gt;Generate multiple months (using the same availability)&lt;/li&gt;&#xA;&lt;li&gt;Input holidays and days the department is closed&lt;/li&gt;&#xA;&lt;li&gt;Make your program run on both Windows and OS X&lt;/li&gt;&#xA;&lt;li&gt;Golf your program&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;INPUT:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Jack    m:0900-1530 t:0800-1530 w:0900-1200 th:0800-1530 f:0900-1700&#xA;John    m:0000-0000 t:1300-1700 w:0900-1200 th:1300-1700 f:1000-1200&#xA;Joseph  m:0800-1000 t:1300-1700 w:0000-0000 th:1300-1700 f:0800-1000&#xA;Jannett m:1430-1700 t:0000-0000 w:1200-1700 th:1100-1400 f:1200-1700&#xA;Brianna m:0900-1430 t:0800-1300 w:0900-1430 th:0000-0000 f:1200-1700&#xA;Dianne  m:0800-0900 t:1300-1700 w:0000-0000 th:1300-1700 f:0800-1000&#xA;Megan   m:1400-1545 t:1100-1700 w:1400-1545 th:1100-1700 f:0000-0000&#xA;Sierra  m:1600-1700 t:0800-1100 w:0900-1300 th:0000-0000 f:0800-1300&#xA;Sandy   m:1345-1700 t:0800-1045 w:1345-1700 th:0800-1045 f:1200-1700&#xA;Holly   m:0800-1200 t:0800-1200 w:0000-0000 th:0800-1200 f:0800-1200&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;OUTPUT:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Monday              Tuesday          Wednesday        Thursday        Friday&#xA;&#xA;STA 1               STA 1            STA 1            STA 1           STA 1&#xA;Joseph 8-10         Holly 8-1130     Brianna 9-1430   Jack 8-11       Joseph 8-10&#xA;Jack 10-1430        Brianna 1130-13  Jannett 1430-17  Megan 11-17     Holly 10-12&#xA;Jannett 1430-1700   Joseph 13-17                                      Desiree 12-17&#xA;&#xA;STA 2               STA 2            STA 2            STA 2           STA 2&#xA;Riane 8-9           Sierra 8-11      John 9-12        Holly 8-11      Sierra 8-1&#xA;Brianna 9-1430      Megan 11-17      NEEDED 12-1430   Jannett 11-2    Brianna 13-17&#xA;Megan 1430-1545                      Megan 1430-1545  Joseph 14-17    &#xA;NEEDED 1545-16                       NEEDED 1545-17&#xA;Sierra 16-17&#xA;&#xA;STA 3               STA 3            STA 3            STA 3           STA 3&#xA;Holly 8-12          Sierra 8-1045    Holly 8-12       Sierra 8-1045   Riane 8-10&#xA;NEEDED 12-1345      NEEDED 11-13     Sierra 12-1      Jack 11-1       Tyler 10-12&#xA;Sandy 1345-17       Riane 13-17      NEEDED 13-1345   Riane 13-17     Sandy 12-17&#xA;                                     Sandy 1345-17&#xA;&#xA;STA 4               STA 4            STA 4            STA 4           STA 4&#xA;NEEDED 8-9          NEEDED 8-13      NEEDED 8-9       NEEDED 8-13     NEEDED 8-9&#xA;Jack 9-10           John 13-17       Jack 9-12        John 13-17      Jack 9-14&#xA;NEEDED 10-1430                       NEEDED 12-17                     NEEDED 14-17&#xA;Jack 1430-1530&#xA;NEEDED 1530-17&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;As you can see, in this case the input &lt;code&gt;0000-0000&lt;/code&gt; means that person is not available on that day of the week.&lt;/p&gt;&#xA;" OwnerUserId="45663" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-29T20:36:09.280" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8236" PostTypeId="2" ParentId="2140" CreationDate="2016-01-30T02:13:18.207" Score="0" Body="&lt;h1&gt;Monophonic Pitch Detection&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Tags:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sandbox Notes&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Still in progress. I haven't made any of the test cases or snippets yet.&lt;/li&gt;&#xA;&lt;li&gt;This is intended to be an easier and more accessible alternative to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8140/46855&quot;&gt;Polyphonic Pitch Detection&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Would this still be a duplicate of the polyphonic version? Solutions could &quot;work&quot; in both challenges, but algorithms that work for this one would perform &lt;em&gt;extremely&lt;/em&gt; poorly (typically monophonic algorithms fail outright with multiple waveforms and produce a completely incorrect frequency) for the other.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Take an array of samples, and output the frequency of the waveform found in the samples.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;You will receive a list of samples as signed 16-bit integers at a fixed sample-rate of 44100 samples-per-second. Each input will only contain one waveform in the range of 100hz to 2000hz.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must output the frequency detected (in hertz) with up to 2 decimal places of precision.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each test case is on it's own line. Each line begins with the name of the test case, followed by a semi-colon (&lt;code&gt;;&lt;/code&gt;), then the frequency present in the test case (with 2 decimal places of precision), followed by another semi-colon, then the samples separated by commas:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Test Case Name;123.45;3,75,1234,56789,4321,-23,-408,-9266,41,0,etc...&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(link to test case file, will include synthesized waveforms, real instrument sounds, added noise, different pitches)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The score of a submission is a percentage based on how close the submission's results are to the actual frequency of each test case. Specifically it will calculated using the formula in the snippet below (use this to calculate your score):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(snippet for calculating score)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No built-ins that detect pitch or extract waveform frequencies are allowed.&lt;/li&gt;&#xA;&lt;li&gt;Helper functions that are designed to aid frequency analysis like &lt;a href=&quot;https://en.wikipedia.org/wiki/Fast_Fourier_transform&quot; rel=&quot;nofollow noreferrer&quot;&gt;FFT&lt;/a&gt; are permitted.&lt;/li&gt;&#xA;&lt;li&gt;You may optimise your solution for the test cases, but you cannot hard-code the results for these specific test cases.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Play Samples&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You can hear what a list of samples sounds like by pasting it into this snippet:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(snippet for playing sample strings or sine waves using web audio)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Links&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Pitch_detection_algorithm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Overview of Pitch Detection Techniques&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Autocorrelation&quot; rel=&quot;nofollow noreferrer&quot;&gt;Autocorrelation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://audition.ens.fr/adc/pdf/2002_JASA_YIN.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;YIN Algorithm&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="46855" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2016-01-30T02:36:24.797" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8242" PostTypeId="1" AcceptedAnswerId="8244" CreationDate="2016-01-30T19:37:56.560" Score="29" ViewCount="1295" Body="&lt;p&gt;Recently, there's been a strong push against &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; challenges. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8134/45941&quot;&gt;This post&lt;/a&gt; sums up the general feelings of the community pretty well, in my opinion. Even when challenge authors do everything right (like with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/70483/patch-the-image&quot;&gt;Patch the Image&lt;/a&gt;), the challenges still attract close votes. The issue is beginning to divide the community, and it's time we had a definitive consensus on it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; challenges be closed as off-topic, and the challenge type killed (like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;)? Or should they remain on-topic? If so, what can challenge authors do to make their popcon challenges of good enough quality that they won't be closed as too broad?&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2017-07-26T19:03:12.240" Title="The state of the popularity contest tag" Tags="|discussion|challenges|scope|challenge-quality|popularity-contest|" AnswerCount="5" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8243" PostTypeId="2" ParentId="8242" CreationDate="2016-01-30T21:29:51.327" Score="14" Body="&lt;h1&gt;Keep it&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There's nothing wrong specifically with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; (indeed it is a good scoring criteria for several popular kinds of challenges, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;). The main issue is that people misunderstand that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; does not make your challenge exempt from the standard rules of what is on-topic here (an issue in particular is that the specification needs to define what makes something worth upvoting). &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; by itself is a perfectly valid and objective winning criteria.&lt;/p&gt;&#xA;" OwnerUserId="45151" LastActivityDate="2016-01-30T21:29:51.327" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8244" PostTypeId="2" ParentId="8242" CreationDate="2016-01-30T21:42:43.300" Score="27" Body="&lt;h1&gt;Keep It, but...&lt;/h1&gt;&#xA;&lt;p&gt;...we should definitely update e.g. the &lt;a href=&quot;https://codegolf.stackexchange.com/tags/popularity-contest/info&quot;&gt;tag info&lt;/a&gt;. The recent discussions have &lt;em&gt;not&lt;/em&gt; been unproductive, and I think we have better guidelines than ever before but at the moment they are still all buried in meta questions/answers.&lt;/p&gt;&#xA;&lt;p&gt;Example: As far as I know it is the first time that the term &lt;em&gt;validity criterion&lt;/em&gt; emerged so clearly which definitely is something we need.&lt;/p&gt;&#xA;&lt;p&gt;If you look at the recent pop-cons you will find a lot of deleted ones, most of which are just badly posed challenges even though some of them might have had an interesting core idea. But then there are still good challenges every now and then, some with fewer some with more answers but each time with interesting problems that turned out to be quite popular.&lt;/p&gt;&#xA;&lt;p&gt;I think pop-cons should definitely stay part of this site, but we need to &lt;strong&gt;communicate our guidelines better&lt;/strong&gt;.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-01-31T01:45:45.943" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8245" PostTypeId="2" ParentId="1061" CreationDate="2016-01-31T01:44:29.720" Score="61" Body="&lt;h1&gt;Abusing native number types to trivialize a problem&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It is common practice to restrict challenges to cases where input, output and/or intermediate values of the algorithm of choice fit into the language's native number type. At least for input and output, this is generally assumed even if not stated in the challenge specification.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are at least two ways to abuse this:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Using a language like &lt;a href=&quot;http://esolangs.org/wiki/Boolfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;Boolfuck&lt;/a&gt; which only has a 1-bit integer type.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With one bit of input and one bit of output, there are only four different Boolfuck programs that can solve &lt;em&gt;all&lt;/em&gt; challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So far, at least two answers have done this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/70532&quot;&gt;Print the N-bonacci sequence&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/52778&quot;&gt;Print the amount of ones in a binary number without using bitwise operators&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Deliberately exceeding the precision limit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't know if this has been done before, but one could start by computing &lt;a href=&quot;http://mathworld.wolfram.com/AckermannFunction.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;A(4, y)&lt;/strong&gt;&lt;/a&gt; for input &lt;strong&gt;y&lt;/strong&gt; (a 19,728 digit integer for &lt;strong&gt;y = 2&lt;/strong&gt;), and then do anything that works for inputs &lt;strong&gt;1&lt;/strong&gt; and &lt;strong&gt;0&lt;/strong&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;As a rule of thumb, I'd say an answer &lt;em&gt;abuses&lt;/em&gt; the native number type if the code would require non-trivial modifications for larger number type. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Implementing bit rotations as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(x &amp;lt;&amp;lt; n) | (x &amp;gt;&amp;gt; (32 - n))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;for 32-bit integers is &lt;em&gt;allowed&lt;/em&gt;; only the &lt;code&gt;32&lt;/code&gt; has to be changed to make it work for, e.g., 64-bit integers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Hardcoding a list of the prime numbers below 128 is &lt;em&gt;not allowed&lt;/em&gt; in a challenge that involves primality testing, even if the language of choice only supports signed 8-bit integers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="42545" LastEditDate="2018-03-27T01:41:19.863" LastActivityDate="2018-03-27T01:41:19.863" CommentCount="9" CommunityOwnedDate="2016-01-31T01:44:29.720" ContentLicense="CC BY-SA 3.0" />
  <row Id="8246" PostTypeId="2" ParentId="1061" CreationDate="2016-01-31T04:42:37.797" Score="24" Body="&lt;h1&gt;Output shall be non-trivial (e. g. not empty)&lt;/h1&gt;&#xA;&lt;p&gt;Mainly targeting &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenges&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenges&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-challenges&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-challenges-container&quot;&gt;code-challenges&lt;/a&gt; where the score is determined by the output. This results in very boring, but valid, answers which tend to get upvoted especially on pop-cons with no other answers.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;An example: if the goal was to output the Mona Lisa as close as possible.&#xA;Outputting a blank image should be considered a loophole.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Another Example: In a  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;test-battery-container&quot;&gt;test-battery&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/q/69920/40695&quot;&gt;such as this one&lt;/a&gt; where score is determined by the most correct output. Always outputting false and claiming a score of &lt;code&gt;0&lt;/code&gt; should count as a loophole.&lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="94076" LastEditDate="2022-11-04T09:54:36.480" LastActivityDate="2022-11-04T09:54:36.480" CommentCount="5" CommunityOwnedDate="2016-01-31T04:42:37.797" ContentLicense="CC BY-SA 4.0" />
  <row Id="8248" PostTypeId="2" ParentId="2140" CreationDate="2016-01-31T22:22:12.050" Score="2" Body="&lt;h1&gt;Anything but stacks&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-design&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-design&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-design&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Stack-based languages are, like totally, all the rage these days.  From GolfScript, to CJam, to MATL, it seems like stack-based languages are &lt;em&gt;popping&lt;/em&gt; up everywhere.  But now, it is time to &lt;em&gt;push&lt;/em&gt; forward and explore new memory models.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you are to create a new programming language based off of any other data structure.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Still undecided is the &quot;goal&quot; of this challenge.  The main idea is that, by using a unique data structure, these new languages may have advantages for certain types of problems.  Since different languages would use different structures, however, there's not any single set of challenges that would provide a fair comparison.  An alternative idea is to pick a single data structure and have everybody use it.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I'm going to work off the &quot;use a specific data structure&quot; idea, since that's really the only thing that can narrow the focus of this question.  So, maybe some options are...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Queues&lt;/li&gt;&#xA;&lt;li&gt;Trees (except I'm not sure how a &quot;tree without branching&quot; would be different from a &quot;stack&quot;)&lt;/li&gt;&#xA;&lt;li&gt;Priority Queues&lt;/li&gt;&#xA;&lt;li&gt;Sets, etc.&lt;/li&gt;&#xA;&lt;li&gt;Associative arrays (dicts/hashmaps)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The next step might be to find some types of problems to target.  &lt;strong&gt;Are there any algorithms that are known to be exceptionally difficult to implement with a stack?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2016-02-01T17:43:33.233" LastActivityDate="2016-02-01T17:43:33.233" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="8249" PostTypeId="1" CreationDate="2016-02-01T02:27:14.073" Score="11" ViewCount="199" Body="&lt;p&gt;So, sometimes, I see questions that are posted in the sandbox, but have been posted in main by another user. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/q/64198/44713&quot;&gt;this question&lt;/a&gt; yielded 242 rep to a user who did not originally post it in the sandbox (though it is worth mentioning that it was unintended).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In situations where this happens, should we do anything? Is there anything we can actually do?&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-02-07T10:29:26.767" Title="What should we do about questions that get asked that are already Sandboxed?" Tags="|discussion|sandbox|challenges|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8250" PostTypeId="2" ParentId="8249" CreationDate="2016-02-01T03:03:12.540" Score="11" Body="&lt;p&gt;I don't believe there is anything to do in this situation. While people are strongly recommended to search for duplicates before posting, I don't think that should extend to the sandbox. Adding yet another obligation to our current &quot;pre-posting checklist&quot; is not a good idea. &lt;/p&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2016-02-01T03:03:12.540" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8251" PostTypeId="2" ParentId="8249" CreationDate="2016-02-01T03:44:57.170" Score="1" Body="&lt;p&gt;Let it be. When the sandboxed question is ready for main, if it is a better quality question, then the first question can be closed as a dupe of it when it gets posted to main, if appropriate. Otherwise, the author of the sandboxed question will just have to move on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We should also use the opportunity to educate the user about the Sandbox.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2016-02-01T16:53:08.217" LastActivityDate="2016-02-01T16:53:08.217" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8252" PostTypeId="2" ParentId="1213" CreationDate="2016-02-01T09:40:38.667" Score="3" Body="&lt;h2&gt;JavaScript ES7&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Occasionally people will save a few bytes by replacing &lt;code&gt;Math.pow&lt;/code&gt; with the exponentiation operator &lt;code&gt;**&lt;/code&gt;, which is one of the few things that has already been standardised for ES7. As such, if you don't have ES7 handy, you could attempt to replace occurrences of &lt;code&gt;**&lt;/code&gt; with the equivalent &lt;code&gt;Math.pow&lt;/code&gt; construct for testing purposes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Currently the simplest way I know of getting an ES7 environment is to use a &lt;a href=&quot;https://nightly.mozilla.org/&quot; rel=&quot;nofollow&quot;&gt;Nightly&lt;/a&gt; build of Firefox.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2016-02-01T09:40:38.667" CommentCount="2" CommunityOwnedDate="2016-08-21T03:11:45.147" ContentLicense="CC BY-SA 3.0" />
  <row Id="8254" PostTypeId="2" ParentId="2140" CreationDate="2016-02-01T13:25:09.960" Score="2" Body="&lt;h2&gt;Write Hamlet in 1024 bytes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here is &lt;a href=&quot;http://sydney.edu.au/engineering/it/~matty/Shakespeare/texts/tragedies/hamlet&quot; rel=&quot;nofollow noreferrer&quot;&gt;a text file containing Shakespeare's play &lt;em&gt;Hamlet&lt;/em&gt;&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will write a program, less than 1024 bytes in length, that outputs this text to a file, STDOUT or nearest available equivalent. Since this is clearly impossible, you don't have to output the exact text, just get as close as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To measure how close your output is to the original, use the Python 3 script below. It works by concatenating the original text onto the end of your file, then compressing the result using the &lt;code&gt;lzma&lt;/code&gt; algorithm, and then subtracting the compressed size of your file alone. This works because if your file contains a lot of common features with the original then the compression algorithm can take advantage of this to make a smaller file. A more sophisticated version of this idea is called &lt;a href=&quot;https://en.wikipedia.org/wiki/Normalized_compression_distance&quot; rel=&quot;nofollow noreferrer&quot;&gt;normalised compression distance&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All answers should contain the code, at least a brief explanation of how it works (full explanations are encouraged), and the first 2000 characters or so of its output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;. Scores are calculated using the script below. The lowest score wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules and clarifications&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program must be completely self-contained within a single file, taking no input, loading no files, and executing no other programs. Importing libraries is permitted.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program must run deterministically, producing the same output every time&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your output must contain only printable ASCII characters, tabs and newlines. (That is, characters with codes 32 to 126 inclusive, plus 9 and 10.) The comparison script checks for this.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your output must be the same size as the original file, 182581 bytes.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may not use any built-ins or library code that provides compression or decompression algorithms. (e.g. &lt;code&gt;lzma&lt;/code&gt;, &lt;code&gt;bz2&lt;/code&gt; etc.) It's OK to use them if you can implement them yourself inside the character limit. Base conversion is OK, and libraries implementing data structures such as Huffman trees are OK.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If for some reason your language or one of its libraries contains a function that outputs some or all of the text of Hamlet, you may not use that function.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program must be written in a programming language, as defined in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/21034&quot;&gt;this answer&lt;/a&gt;. This definition must apply to your source code, not just to any compiler/interpreter flags used to run it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In the case of any inconsistency in the script's behaviour between machines, the version on my machine is the definitive one. (Python 3.4.3 on a Mac.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Here is the comparison code to use. It requires Python 3 because of the &lt;code&gt;lzma&lt;/code&gt; dependency. (&lt;code&gt;lzma&lt;/code&gt; is much better than &lt;code&gt;bz2&lt;/code&gt; or &lt;code&gt;gzip&lt;/code&gt; for this purpose.) It requires the text file linked above to be in the same directory with the name &lt;code&gt;ORIGINAL.txt&lt;/code&gt;. Run it with a command like&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;python3 compare.py my_output.txt&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;[to do: produce and supply a zip file containing this script together with ORIGINAL.txt]&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import lzma&#xA;import sys&#xA;&#xA;with open(&quot;ORIGINAL.txt&quot;, 'r') as file:&#xA;    orig = file.read()&#xA;&#xA;with open(sys.argv[1], 'r') as file:&#xA;    text = file.read()&#xA;&#xA;def csize(txt):&#xA;    return len(lzma.compress(txt.encode('utf-8')))&#xA;&#xA;character_codes = {ord(c) for c in text}&#xA;valid_codes = set([9,10] + list(range(32,127)))&#xA;if character_codes - valid_codes:&#xA;    print(&quot;NOT VALID: file contains a non-printable character&quot;)&#xA;else:&#xA;    print( csize(text + orig) - csize(text) )&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Technical notes&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The compressed size of the original file is 64976 bytes. In an ideal world the original file would have a score of 0, but it actually scores 100. Shakespeare's &lt;em&gt;Macbeth&lt;/em&gt; scores 61776, so that should probably be considered a pretty good score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; rel=&quot;tag&quot;&gt;compression&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="21034" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2016-02-02T13:22:11.517" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="8255" PostTypeId="2" ParentId="2140" CreationDate="2016-02-01T13:42:11.117" Score="-2" Body="&lt;p&gt;Write a polyglot (a program that works on several languages) that produces the &lt;code&gt;// this is a comment&lt;/code&gt; output.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example (JS + Plain PHP + Plain HTML) (74 / 3 = 24.66 points)&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;// this is a comment&amp;lt;?php ob_start();?&amp;gt;&amp;lt;!--&#xA;alert(&quot;// this is a comment&quot;);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Another Example (CoffeeScript + CJam + brainfuck) ()&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;e###-[-----&amp;gt;+&amp;lt;]&amp;gt;----..+[---&amp;gt;++&amp;lt;]&amp;gt;.---[-&amp;gt;++++&amp;lt;]&amp;gt;.------------.+.++++++++++.+[----&amp;gt;+&amp;lt;]&amp;gt;+++.-[---&amp;gt;++&amp;lt;]&amp;gt;-.++++++++++.+[----&amp;gt;+&amp;lt;]&amp;gt;+++.[-&amp;gt;+++&amp;lt;]&amp;gt;+.-[-&amp;gt;+++ &amp;lt;]&amp;gt;.+[-&amp;gt;+++&amp;lt;]&amp;gt;.++++++++++++.--..--------.+++++++++.++++++.&#xA;&quot;// this is a comment&quot;&#xA;e### alert &quot;// this is a comment&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your score will be &lt;code&gt;code byte length / num langs&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The smallest score wins!&lt;/p&gt;&#xA;" OwnerUserId="46809" LastActivityDate="2016-02-01T13:42:11.117" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8257" PostTypeId="1" AcceptedAnswerId="8258" CreationDate="2016-02-01T17:54:40.437" Score="11" ViewCount="149" Body="&lt;p&gt;Are there any guidelines on using code written by others for other challenges as a part of an answer to a completely different challenge? It's a bit of a special case, but I'll explain.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm currently writing an answer that will end up being quite long, and I realized that it may benefit by compressing the code and including a decompression function that can output the original code to be evaled. The language is JavaScript, and since there's no built in compression algorithms, I decided to look through the &quot;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/4771/text-compression-and-decompression-nevermore&quot;&gt;Text compression and decompression — “Nevermore.”&lt;/a&gt;&quot; challenge for options and came across &lt;a href=&quot;https://codegolf.stackexchange.com/a/4783/30793&quot;&gt;this submission&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I made some improvements to their code, as well an converting it to ES6 for the benefit of arrow functions. When included as a part of my answer it does indeed save a few bytes. Before I submit though, I wanted to know how this sort of reuse might be viewed. Being that it is unrelated to challenge I'm submitting to (which involves image generation), would it be considered acceptable to submit to this challenge, and give to credit to the author for the part their code played in getting the final size down?&lt;/p&gt;&#xA;" OwnerUserId="30793" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-02-01T18:02:18.287" Title="Guidelines for integrating unrelated code written by others?" Tags="|discussion|policy|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8258" PostTypeId="2" ParentId="8257" CreationDate="2016-02-01T18:02:18.287" Score="11" Body="&lt;p&gt;As far as I know, there's nothing wrong with that sort of reuse. It happens often enough, and I've done it on occasion. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/a/35879/14215&quot;&gt;while drawing a forest&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;It's basically a fractal random walk with slowly shrinking, twisty vines. I draw 75 of them, gradually changing from white in the back to black up front. Then I dither the whole thing, shamelessly adapting Averroes' code &lt;a href=&quot;https://codegolf.stackexchange.com/a/26690/14215&quot;&gt;here&lt;/a&gt; for that.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Even if the challenge &lt;em&gt;is&lt;/em&gt; related, I don't think there's a problem, given attribution.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-02-01T18:02:18.287" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8259" PostTypeId="2" ParentId="2140" CreationDate="2016-02-01T18:44:04.743" Score="0" Body="&lt;h1&gt;Letter subsets&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider two letters, L1 and L2. L1 is a &lt;em&gt;solid subset&lt;/em&gt; of L2 if and only if all of the lines can be placed on L2 without rotating or breaking L1 or marring the image of L2; this is L1 s.s. L2, symbolically. For example, I s.s. T because you can place the line of I on T without a difference, and C s.s. O for the same reason. Here are all the letters (L1, L2) for which L1 s.s. L2 and L1 &amp;ne; L2:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;L1  L2&#xA;F   E&#xA;C   O&#xA;I   T&#xA;I   L&#xA;O   Q&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Two letters L3 and L4 share the relation of &lt;em&gt;variant subset&lt;/em&gt; (i.e. L3 is a variant subset of L4, or L3 v.s. L4) if and only if some rotation of L3 exists where L3 s.s. L4. Here are all the letters (L3, L4) for which L3 v.s. L4 and L3 &amp;ne; L4:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;L3  L4&#xA;F   E&#xA;C   O&#xA;I   T&#xA;I   L&#xA;O   Q&#xA;V   A&#xA;I   H&#xA;H   I&#xA;I   N&#xA;I   M&#xA;I   B&#xA;I   V&#xA;I   X&#xA;I   Z&#xA;I   P&#xA;I   E&#xA;I   W&#xA;I   R&#xA;I   K&#xA;I   F&#xA;I   D&#xA;N   Z&#xA;Z   N&#xA;T   H&#xA;G   Q&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Specs&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your input will be two letters. You may take them as a string, two characters, or two numbers representing those characters, as arguments, read from STDIN, or from a file. With these two letters, you are to output their relation. You should favor s.s. over v.s. over nothing. Your output will be &lt;code&gt;ss&lt;/code&gt;, &lt;code&gt;vs&lt;/code&gt;, or nothing. Your program may do anything if the input is not a pair of &lt;strong&gt;uppercase&lt;/strong&gt; letters. Your program should pass all of the above relations when given those letters as input.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;~META~&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Suggestions? Any letters in v.s. or s.s. I missed? Any you don't understand?&lt;/p&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="39328" LastEditDate="2016-02-02T05:53:32.503" LastActivityDate="2016-02-02T05:53:32.503" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8263" PostTypeId="2" ParentId="2140" CreationDate="2016-02-02T02:23:59.397" Score="1" Body="&lt;h1&gt;Weekly Physics Golf #{TBD}: Wavelength of a Sound Wave &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;META NOTE: I believe, and others in the comments, that this challenge is quite trivial. So, I will be working on making this challenge harder in the next few days.&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Introduction to the Series&lt;/h2&gt;&#xA;&lt;p&gt;Every week I will be posting a physics challenge. My goal here is to design challenges that in the end, teach some people some physics. Overall, the challenges will be very basic with little information. All of these challenges will have the minimal information necessary to solve them, and the goal is for users like you to do some research, watch some videos, and understand how these concepts work to teach you how to approach these types of physics problems and explain how they work. Of course, I will also give two optional hints per challenge, which are there if you do not have the time or determination to do the research, or you cannot figure out how to do the problem after researching. The two hints will be &amp;quot;necessary equations for this challenge&amp;quot; and &amp;quot;process to solve the problem&amp;quot;. The hints are completely optional to use and it is encourages to not use them, but as stated above to learn the information for yourself. The series will have one main leaderboard. Whoever has the least combined byte count for all of the challenges gets a &lt;em&gt;to be determined&lt;/em&gt; prize. Each challenge will range in difficulty, with an upwards trend of difficulty. I wish you all luck and I hope you learn a thing or two!&lt;/p&gt;&#xA;&lt;h2&gt;Challenge #{TBD}: Wavelength of a Sound Wave (Difficulty: EASY)&lt;/h2&gt;&#xA;&lt;p&gt;Many people may not know that sound is actually a wave, which would explain why it can go through objects and bend around corners. But it has some really interesting properties. For example, the speed of the sound wave changes from a few factors, all relating to the medium it travels through. In this challenge, you will have to figure out the wavelength of a sound wave through a given medium.&lt;/p&gt;&#xA;&lt;p&gt;But first, lets define a medium. A medium is any liquid, solid, or gas that a wave can travel through. Mediums can affect the speed of a sound wave in two ways: the &lt;em&gt;&lt;strong&gt;density&lt;/strong&gt;&lt;/em&gt; of the medium, and the &lt;em&gt;&lt;strong&gt;bulk modulus elasticity&lt;/strong&gt;&lt;/em&gt; of the medium. But what are these two things? Well lets first consider the density of an object. Density is defined to be the &lt;em&gt;mass&lt;/em&gt; divided &lt;em&gt;volume&lt;/em&gt; of the object, or in simple terms, &lt;em&gt;amount of mass in a given space&lt;/em&gt;. This is important, as waves travel differently through mediums of different densities. The reason behind this is that a medium with a higher density has more inertia (the resistance to change in motion). An object with a higher inertia will be more difficult to move with a wave (which displaces particles to move). Therefore, &lt;strong&gt;INCREASED DENSITY corresponds to DECREASED WAVE SPEED&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Now lets define &lt;em&gt;bulk modulus elasticity&lt;/em&gt;. This is really just a fancy name for &lt;em&gt;stiffness of an object&lt;/em&gt;. But what does this have to do with anything? Well, when an object is stiffer, each molecule is more interconnected to other molecules. And because a wave displaces particles to &amp;quot;move&amp;quot;, it will move through a stiff medium faster because it can move larger molecules, hence moving more distance in a shorter time, a.k.a. moving faster. Therefore, &lt;strong&gt;INCREASED BULK MODULUS ELASTICITY corresponds to INCREASED WAVE SPEED&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;So in this challenge, I will give you the &lt;em&gt;density&lt;/em&gt; and the &lt;em&gt;BME&lt;/em&gt; (bulk modulus elasticity) of the medium, and also the frequency of the sound wave. Your job is to use this information and output the wavelength. Here are the full specs:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input will be three &lt;em&gt;numbers&lt;/em&gt; (not necessarily integers). They correspond to &lt;em&gt;density&lt;/em&gt; in &lt;code&gt;kg/m^3&lt;/code&gt;, &lt;em&gt;bulk modulus elasticity&lt;/em&gt; in Pascals, and &lt;em&gt;sound wave frequency&lt;/em&gt; in hertz.&lt;/li&gt;&#xA;&lt;li&gt;Input can be in any order, in any convenient format (so &lt;code&gt;12.3 45.6 78.9&lt;/code&gt;, &lt;code&gt;[12.3 45.6 78.9]&lt;/code&gt;, and &lt;code&gt;78.9,[12.3,45.6]&lt;/code&gt; are all acceptable).&lt;/li&gt;&#xA;&lt;li&gt;You may assume that input will never cause any sort of error during execution.&lt;/li&gt;&#xA;&lt;li&gt;Output will be the calculated frequency of the sound wave in meters, precise to &lt;em&gt;three decimal places&lt;/em&gt;, omitting leading and trailing zeros. For example, inputs of &lt;code&gt;6&lt;/code&gt;, &lt;code&gt;27&lt;/code&gt;, and &lt;code&gt;3&lt;/code&gt; would given an output of &lt;code&gt;0.707&lt;/code&gt; after rounding from &lt;code&gt;0.70710678118654752440084436210485&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Shortest code in bytes wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;META NOTE: Test cases to come, I am working on them right now.&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Hints&lt;/h2&gt;&#xA;&lt;p&gt;These hints are for those who do not want to put in the time and effort of research, or those who could not find a solution. So, here are the two hints:&lt;/p&gt;&#xA;&lt;h3&gt;Hint 1: Equations&lt;/h3&gt;&#xA;&lt;p&gt;You need the following equations for this challenge:&lt;/p&gt;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;&lt;p&gt; &lt;a href=&quot;https://i.stack.imgur.com/YHO3x.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/YHO3x.gif&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;Hint 2: Sample Solution Process:&lt;/h3&gt;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;&lt;p&gt; Using the two equations above, we can set them equal to each other to get:&#xA; &lt;p&gt;&#xA; &lt;a href=&quot;https://i.stack.imgur.com/pwwTX.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/pwwTX.gif&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&#xA; &lt;p&gt;&#xA; Solving for wavelength gets us this equation:&#xA; &lt;p&gt;&#xA; &lt;a href=&quot;https://i.stack.imgur.com/doUuw.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/doUuw.gif&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&#xA; &lt;p&gt;&#xA; From here you can just plug in values.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins. Good luck!&lt;/p&gt;&#xA;&lt;h2&gt;Leaderboard&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Meta note: blah blah blah, working leaderboard will eventually go here! This leaderboard will contain and combine scores for all of the weekly challenges. It will only be visible on this question, though.&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="36670" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-02T14:31:13.147" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8264" PostTypeId="2" ParentId="8242" CreationDate="2016-02-02T04:48:44.557" Score="16" Body="&lt;h2&gt;Should the tag be split?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I think it's clear that the majority want to see popularity contests continue, but also the majority find problems with most challenges that are posted with this tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is part of the problem that the tag is used for more than one thing?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There seem to be at least two different challenge types that are tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are restrictive conditions under which the challenge is to make the most popular answer. These are the most likely to be closed but also seem the best fit for the tag &quot;popularity contest&quot;. Those that are not closed are among the most popular challenges on the site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then there are competitions which are not about being popular, but about achieving an objective, and popularity contest is chosen as the winning condition simply because whether and how well that objective has been achieved is down to human judgement. These seem a better fit for the site, but don't quite seem to fit the tag. Although the winner is still determined by votes, perhaps these should be called something else? Maybe someone can think of something better than &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/human-judgement&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;human-judgement&amp;#39;&quot; rel=&quot;tag&quot;&gt;human-judgement&lt;/a&gt;, which is all I can think of at present.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Pure popularity contests&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/28786/write-a-program-that-makes-2-2-5&quot;&gt;Write a program that makes 2 + 2 = 5&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/35569/tweetable-mathematical-art&quot;&gt;Tweetable Mathematical Art&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/22144/images-with-all-colors&quot;&gt;Images with all colors&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Human judged contests&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/50299/draw-an-image-as-a-voronoi-map&quot;&gt;Draw an Image as a Voronoi Map&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/36374/redraw-an-image-with-just-one-closed-curve&quot;&gt;Redraw an image with just one closed curve&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/43274/computer-generated-textured-wall-paint&quot;&gt;Computer Generated Textured Wall Paint&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Here I'm splitting based on whether there is a target. Human judged contests have a specific target (either fixed or taken as an input), and the humans are necessary in order to assess how close a solution comes to that target. Pure popularity contests have no target, just a tight restriction that makes creating a solution challenging, even though it's not technically a solution to anything.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Are there better/more ways to split vote-determined contests? Are there reasons to avoid having tags to distinguish in this way?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What I have called &quot;pure popularity contests&quot; are what often get closed as &quot;just an art contest&quot;. I think having two separate tags would help to emphasise that a pure popularity contest needs to have particularly restrictive conditions to drive creativity and ensure that programming skill is demanded in order to be competitive.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-02-02T04:48:44.557" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="8268" PostTypeId="2" ParentId="2140" CreationDate="2016-02-02T21:18:31.400" Score="-3" Body="&lt;h1&gt;Stop the dance!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your sister was at the hospital, but now she's fine, awfully, you lost a day of work, one of your most important days.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You work at your local television, and they have a contest, called &quot;Stop the dance!&quot;, what is it about?: People is dancing, they have a big screen in the wall, while it says &quot;Dance!&quot;, they have to dance, if it says &quot;Stop!&quot;, they must stop, if you move, you lose.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You don't have internet at the studio, so you use some strange offline data sharing method. The day you weren't there, another programmer came, such a silly programmer! He made a &quot;Reciever&quot; program, basically, gets data, processes data and prints data in the Big Screen Wall.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The programmer was bored, so he made a way to get data, well, you don't know what way he choose! (Author comment: Let's assume he made all the possible ways. Cya.) Now you have to make a sender program, in any language, that sends data to that program using the protocol specified under this section.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are an expert code golfer, so you decide that you must make the shortest code possible. (Another author comment: Any lang is allowed. Cya.)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;How did I came out with this idea?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Having a shower, my friend...&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Your task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You must make the shortest (and winner) code possible, that sends data to the reciever, using this protocol:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The reciever must recieve:&lt;/p&gt;&#xA;  &#xA;  &lt;blockquote&gt;&#xA;    &lt;p&gt;&lt;code&gt;$displaytext:&quot;&amp;lt;text here&amp;gt;&quot;;$instnm:&amp;lt;integer here&amp;gt;;&lt;/code&gt;&lt;/p&gt;&#xA;  &lt;/blockquote&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;$displaytext corresponds to what it is going to be displayed on the Big Screen Wall.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$instnm corresponds to the number of the instruction, the count of things displayed, starts from 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program may take an input, and send the data, in any way (except the ones in Rules) to the Reciever. Remember there's no internet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner will be the user with shortest bytes of code.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;As a good code golfer, you may not:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can't use program arguments to send the data.&lt;/li&gt;&#xA;&lt;li&gt;It must be an application.&lt;/li&gt;&#xA;&lt;li&gt;If you apply for the bonus, mind you have to make both programs, if not, just the sender.&lt;/li&gt;&#xA;&lt;li&gt;The string you have to send it has to be STRICT, no different ones, if not, unvalid answer. (I decided to call that &quot;Strict JASON Protocol&quot;, get the joke?)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Bonus&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You can make the reciever program, and you get -1 byte. Not much, but k. (In bytes, you must not decrement your byte result, you must do: &quot;n Bytes + Bonus&quot;)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Input:&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;From Sender program:&lt;/p&gt;&#xA;  &#xA;  &lt;blockquote&gt;&#xA;    &lt;p&gt;Dance!&#xA;    or&#xA;    Stop!&lt;/p&gt;&#xA;    &#xA;    &lt;h2&gt;Protocol:&lt;/h2&gt;&#xA;  &lt;/blockquote&gt;&#xA;  &#xA;  &lt;p&gt;Inbetween both commands&lt;/p&gt;&#xA;  &#xA;  &lt;blockquote&gt;&#xA;    &lt;p&gt;&lt;code&gt;$displaytext:&quot;Dance!&quot;;$instnm:5&lt;/code&gt;&lt;/p&gt;&#xA;    &#xA;    &lt;h2&gt;Output:&lt;/h2&gt;&#xA;  &lt;/blockquote&gt;&#xA;  &#xA;  &lt;p&gt;In Reciever program:&lt;/p&gt;&#xA;  &#xA;  &lt;blockquote&gt;&#xA;    &lt;p&gt;Dance! (9)&#xA;    or&#xA;    Stop! (187)&lt;/p&gt;&#xA;  &lt;/blockquote&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Overall objective:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Send data between two programs, without internet connection.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Edit: i can't post an example answer, because then i can give ideas of how to do this codegolf/puzzle, while the ideas are limited, i'm finding for the creativity of the user.&lt;/p&gt;&#xA;" OwnerUserId="49697" LastEditorUserId="49697" LastEditDate="2016-02-17T19:29:28.420" LastActivityDate="2016-02-17T19:29:28.420" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8270" PostTypeId="2" ParentId="2140" CreationDate="2016-02-03T02:40:30.007" Score="0" Body="&lt;h1&gt;Knights and Knaves &lt;a href=&quot;https://codegolf.stackexchange.com/questions/73143/knights-and-knaves&quot;&gt;posted&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Undeleted so that comments are visible&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="45459" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-15T17:56:00.310" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="8271" PostTypeId="2" ParentId="2140" CreationDate="2016-02-03T03:15:27.653" Score="1" Body="&lt;p&gt;&lt;sub&gt;I've posted two well-received (by my standards: 10+ no downvotes) questions in the past; however, I've always missed a bit of information, so I welcome all feedback to this challenge!&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Introduction&lt;/h3&gt;&#xA;&lt;p&gt;A palindrome is a word or string of words that is the same forwards as it is backwards, e.g. taco cat, kayak, madam im adam. I'm sure by now you're all familiar with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/palindrome&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;palindrome&amp;#39;&quot; rel=&quot;tag&quot;&gt;palindrome&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;An anagram is a word or group of words that when the letters are rearranged, forms a different word or string of words. If you haven't already, Google for &lt;a href=&quot;https://www.google.com.au/webhp?sourceid=chrome-instant&amp;amp;ion=1&amp;amp;espv=2&amp;amp;es_th=1&amp;amp;ie=UTF-8#q=anagram&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;anagram&lt;/em&gt;&lt;/a&gt; or &lt;a href=&quot;https://www.google.com.au/webhp?sourceid=chrome-instant&amp;amp;ion=1&amp;amp;espv=2&amp;amp;es_th=1&amp;amp;ie=UTF-8#q=define%20anagram&amp;amp;es_th=1&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;define anagram&lt;/em&gt;&lt;/a&gt; (not part of the puzzle, obviously).&lt;/p&gt;&#xA;&lt;h3&gt;Task&lt;/h3&gt;&#xA;&lt;p&gt;Your task is to write a program which will take a string of lowercase characters and blank space, and return truthy/falsey if the string can be anagrammed into (or &lt;em&gt;is&lt;/em&gt;) a palindrome (even if it doesn't form a legit word). This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest answer wins. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes apply&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A string of at least 1 character containing a mixture of lowercase alphanumeric characters and blank space&lt;/li&gt;&#xA;&lt;li&gt;Whitespace can be ignored when determining whether a word or phrase can be anagrammed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2190/interpretation-of-truthy-falsey&quot;&gt;Truthy/falsey&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Examples:&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Truthy&lt;/strong&gt;&lt;br /&gt;&#xA;kayak = kayak / akyka&lt;br /&gt;&#xA;maam = maam / amma&lt;br /&gt;&#xA;her taco cat hero = hertacoocatreh&lt;br /&gt;&#xA;boob = obbo&lt;br /&gt;&#xA;boobs = bosob&lt;br /&gt;&#xA;ooh = oho&lt;br /&gt;&#xA;lol = lol (already a palindrome)&lt;br /&gt;&#xA;zzz = zzz (already a palindrome)&lt;br /&gt;&#xA;i = i&lt;br /&gt;&#xA;00010001 = 10000001&lt;br /&gt;&#xA;0xd00000d = 0d00x00d0&lt;br /&gt;&#xA;sevens 7even = seven7neves&lt;br /&gt;&#xA;&lt;strong&gt;Falsey&lt;/strong&gt;&lt;br /&gt;&#xA;glum glow worm&lt;br /&gt;&#xA;maam im adam&lt;br /&gt;&#xA;book&lt;br /&gt;&#xA;banana&lt;br /&gt;&#xA;nana ant&lt;br /&gt;&#xA;jquery&lt;/p&gt;&#xA;" OwnerUserId="42561" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-03T21:11:50.153" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8272" PostTypeId="2" ParentId="202" CreationDate="2016-02-03T03:20:38.163" Score="9" Body="&lt;h2&gt;DataBot&lt;/h2&gt;&#xA;&lt;p&gt;Thanks to the work of myself (&lt;a href=&quot;https://codegolf.stackexchange.com/users/45941/mego&quot;&gt;Mego&lt;/a&gt;), &lt;a href=&quot;https://codegolf.stackexchange.com/users/44713/votetoclose&quot;&gt;VoteToClose&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/45151/quartata&quot;&gt;quartata&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/users/31957/c-ob&quot;&gt;CᴏɴᴏʀO'Bʀɪᴇɴ&lt;/a&gt; (and building upon the &lt;a href=&quot;https://github.com/ProgramFOX/SE-Chatbot&quot; rel=&quot;nofollow noreferrer&quot;&gt;work&lt;/a&gt; of &lt;a href=&quot;https://codegolf.stackexchange.com/users/9275/programfox&quot;&gt;ProgramFOX&lt;/a&gt; et al.), a chat bot named &lt;a href=&quot;https://codegolf.stackexchange.com/users/49668/data&quot;&gt;Data&lt;/a&gt; has been built that can run code for several different languages. Stop by the &lt;a href=&quot;http://chat.stackexchange.com/rooms/35039/ppcg-code-snippet-chat-bot&quot;&gt;PPCG Code Snippet Chat Bot room&lt;/a&gt; to see it in action.&lt;/p&gt;&#xA;&lt;p&gt;Languages supported:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7840/45941&quot;&gt;All Try It Online! languages&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Pyth&lt;/li&gt;&#xA;&lt;li&gt;Marbelous&lt;/li&gt;&#xA;&lt;li&gt;Japt&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If you want a language added to the bot, feel free to ask one of us in the chat room.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-08T21:11:53.617" CommentCount="2" CommunityOwnedDate="2016-02-03T03:20:38.163" ContentLicense="CC BY-SA 3.0" />
  <row Id="8273" PostTypeId="5" CreationDate="2016-02-03T05:13:22.847" Score="0" Body="&lt;p&gt;An annual competition designed to demonstrate the best posts on the site from that year. Also, use this tag on questions about the competition itself and thins related to it.&lt;/p&gt;&#xA;&lt;p&gt;Past competitions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://meta.codegolf.stackexchange.com/questions/8007/cast-your-vote-for-best-of-ppcg-2015&quot;&gt;2015&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11186/cast-your-vote-for-best-of-ppcg-2016&quot;&gt;2016&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14614/cast-your-vote-for-best-of-ppcg-2017&quot;&gt;2017&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17367/cast-your-vote-for-best-of-ppcg-2018&quot;&gt;2018&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/20499/cast-your-vote-for-best-of-cgcc-2019&quot;&gt;2019&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/20638/cast-your-vote-for-best-of-cgcc-2020&quot;&gt;2020&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="66833" LastEditorDisplayName="user45941" LastEditDate="2021-04-08T19:10:19.980" LastActivityDate="2021-04-08T19:10:19.980" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="8274" PostTypeId="4" CreationDate="2016-02-03T05:13:22.847" Score="0" Body="Our annual competition for the best contributions to the site." OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2016-02-03T05:13:22.847" LastActivityDate="2016-02-03T05:13:22.847" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8275" PostTypeId="2" ParentId="8182" CreationDate="2016-02-03T05:24:54.643" Score="6" Body="&lt;h2&gt;Anything that is acceptable by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2028/what-are-programming-languages&quot;&gt;our rules&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8185/45941&quot;&gt;@xnor's answer&lt;/a&gt; does a good job of addressing the specific questions asked, but I want to create a more general answer.&lt;/p&gt;&#xA;&lt;p&gt;The hard and fast rule is, if the system can do all the things listed in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/45941&quot;&gt;consensus answer&lt;/a&gt;, it's valid. The system doesn't have to be code; it could be digital logic, or a logical system encoded using &lt;a href=&quot;https://en.wikipedia.org/wiki/G%C3%B6del_numbering&quot; rel=&quot;nofollow noreferrer&quot;&gt;Gödel numbering&lt;/a&gt;. So long as the system is consistent (always gives the same output for the same input(s)) and can perform all of the tasks listed in the linked answer, it's kosher.&lt;/p&gt;&#xA;&lt;p&gt;Digital logic using any &lt;a href=&quot;https://en.wikipedia.org/wiki/Functional_completeness&quot; rel=&quot;nofollow noreferrer&quot;&gt;functionally complete&lt;/a&gt; set of logic gates is programming, since digital logic is a Turing-complete system with unlimited gates.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-03T05:24:54.643" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8276" PostTypeId="1" CreationDate="2016-02-03T12:06:20.593" Score="5" ViewCount="174" Body="&lt;p&gt;There seems to be &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5343/36398&quot;&gt;&lt;strong&gt;agreement&lt;/strong&gt;&lt;/a&gt; that numeric input is by default accepted in either &lt;strong&gt;decimal&lt;/strong&gt; or &lt;strong&gt;unary&lt;/strong&gt; bases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The linked meta-question doesn't address the issue of whether &lt;strong&gt;separate inputs&lt;/strong&gt; of the same program can use &lt;strong&gt;different bases&lt;/strong&gt;. For example, consider a program or function that accepts two inputs. Can the first input be in decimal and the second in unary?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The reationale is that choosing the base of each input independently can lead to more efficient programs, or to reduced length in code golf.&lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-02-03T15:26:30.077" Title="Accepting numeric inputs in mixed decimal and unary bases" Tags="|discussion|policy|code-golf|answers|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8277" PostTypeId="2" ParentId="8276" CreationDate="2016-02-03T12:06:58.320" Score="-4" Body="&lt;h1&gt;Yes, each input can use a different base (decimal or unary) by default&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Of course, the challenge can always override this default.&lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2016-02-03T12:16:46.627" LastActivityDate="2016-02-03T12:16:46.627" CommentCount="0" CommunityOwnedDate="2016-02-03T12:06:58.320" ContentLicense="CC BY-SA 3.0" />
  <row Id="8279" PostTypeId="2" ParentId="8276" CreationDate="2016-02-03T12:20:47.700" Score="0" Body="&lt;h1&gt;By default, mixed input bases can be used, BUT...&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;...only if using mixed bases doesn't trivialize&lt;sup&gt;0&lt;/sup&gt; the problem, and only if the input bases are &lt;em&gt;constant&lt;/em&gt;&lt;sup&gt;1&lt;/sup&gt;. My answer is very similar to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5344/31957&quot;&gt;the common consensus&lt;/a&gt;, having the same sort of logic (i.e. wishing to allow esoteric languages to compete but not ruining the challenge entirely) behind it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;0 - trivialize meaning &quot;make the problem a simple task, where the code in question can be thought of as 'abusive' (using a loophole similar to the standard loopholes) or as 'trolling', akin to taking the challenge too literally, solving a considerable amount of work i.e. base conversion by having the user do it, etc.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1 - constant meaning that if you take two arguments &lt;em&gt;a&lt;/em&gt; and &lt;em&gt;b&lt;/em&gt; in bases &lt;em&gt;c&lt;/em&gt; and &lt;em&gt;d&lt;/em&gt;, &lt;em&gt;c&lt;/em&gt; and &lt;em&gt;d&lt;/em&gt; must not change when running the program with different inputs, unless the nature of the problem is to have multi-base inputs.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-02-03T15:26:30.077" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8280" PostTypeId="2" ParentId="8276" CreationDate="2016-02-03T13:35:03.117" Score="14" Body="&lt;h2&gt;No&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The rationale for allowing unary input is that for some languages unary is the natural representation of natural numbers. Obvious examples include string-based or tape-based languages. Allowing them to use their natural representation for input reduces unconscious bias against such languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That rationale cannot reasonably stretch to mixed input. The argument that taking input in a mixture of forms, some of them &quot;unnatural&quot;, allows you to golf your answer better logically extends to arguing that the input format should be such that your program just needs to be &lt;code&gt;eval(input())&lt;/code&gt;, and should be treated with the same derision that the latter deserves.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2016-02-03T13:35:03.117" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8281" PostTypeId="1" CreationDate="2016-02-03T15:04:13.733" Score="7" ViewCount="233" Body="&lt;p&gt;Long ago, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2323/look-and-say-sequence&quot; title=&quot;Look and say with no numbers in source code&quot;&gt;this challenge&lt;/a&gt; was posted, with the restriction that no numbers may be used in the source code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Recently, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/70837/say-what-you-see&quot; title=&quot;Look and say with no restrictions&quot;&gt;another challenge&lt;/a&gt; was posted, this time without any restrictions on the source code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Both challenges have the same theme - the look and say numbers. However, the original challenge was very restrictive, had no input, and only required a fixed output (the first 20 look and say numbers). The new one is simply the task with no restriction, and also differs in that it is required to take inputs: both the number of iterations and the starting number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even without these additional differences I would expect that in many cases simply the lack of restrictions would make solutions to the restricted challenge uncompetitive in the unrestricted challenge, suggesting they are not duplicates. Is it acceptable to have both restricted and unrestricted versions of a challenge?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The recent catalogue questions seem relevant to this discussion, as they were also unrestricted versions that had plenty of restricted precursors.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/57617/is-this-number-a-prime&quot;&gt;Is this number a prime?&lt;/a&gt; and its precursor &lt;a href=&quot;https://codegolf.stackexchange.com/questions/46909/finding-prime-numbers-without-using-prime-characters&quot;&gt;Finding prime numbers without using &amp;quot;prime characters&amp;quot;&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/64198/99-bottles-of-beer&quot;&gt;&amp;quot;99 Bottles of Beer&amp;quot;&lt;/a&gt; and its precursor &lt;a href=&quot;https://codegolf.stackexchange.com/questions/31506/99-bottles-of-beer-99-languages&quot;&gt;99 Bottles of beer, 99 languages&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-02-16T15:01:01.580" Title="Duplicates with different restrictions or no restrictions" Tags="|discussion|policy|duplicates|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8283" PostTypeId="2" ParentId="8281" CreationDate="2016-02-03T15:27:00.513" Score="9" Body="&lt;h3&gt;Regarding a general policy&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I don't think a general rule on restricted challenges would work very well. It depends a lot on the challenge and the restriction whether it makes a sufficient difference. &lt;em&gt;Print &quot;Hello, World!&quot; without any numbers in your code&lt;/em&gt; is practically the same as &lt;em&gt;Print &quot;Hello, World!&quot;&lt;/em&gt; (except for some esolangs where that restriction will likely make the task altogether impossible). On the other hand &lt;em&gt;Test a number for primality with a palindromic program&lt;/em&gt; is probably going to lead to vastly different solutions than &lt;em&gt;Test a number for primality&lt;/em&gt; (barring trivial solutions that put a comment character in the middle). At the same time, disallowing built-ins will often greatly change the challenge for those languages that do have a built-in for that task. And yet, I don't want to see two copies of every challenge, where one allows and one disallows built-ins, because one of them likely doesn't add anything interesting (here I generally prefer allowing built-ins and encouraging people to include built-in free alternatives in an FYI section or something).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Whether any given restriction makes any given challenge sufficiently different and/or adds anything interesting to the site should probably be left up to the close voters to decide on a case-by-case basis.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we do decide that the a restricted challenge and an unrestricted challenge are duplicates, I'd vote for closing the restricted one, because the restriction likely distracts from the actual tasks at hand, and less is usually more. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7326/8478&quot;&gt;I'm generally in favour of closing old challenges as dupes of new ones,&lt;/a&gt; so I don't think the question of which one was posted first should factor into the decision of which one is closed.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Regarding this particular challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Whether or not the old one is closed, I believe the new one should remain open (following the previous paragraph). Without the restrictions and with the more general I/O specification, the new one seems like the challenge which is a) a more typical statement of this problem and b) more likely to generate answers whose techniques can be reused in future challenges (in a way, the look-and-say sequence is a simple way to showcase the shortest way to implement run-length encoding in a language).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for the old one, I don't think the restriction is particularly interesting since the core algorithm doesn't depend on number literals at all (barring &lt;code&gt;for&lt;/code&gt; loops in some languages, that can probably be easily work around). Comparing my CJam answers to both challenges, the differences are more due to the hardcoded inputs and the fact that all steps need to be printed. The core algorithm remains &lt;code&gt;{...se`}*&lt;/code&gt; which is entirely unaffected by the restriction:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;X{NX$se`}J*&#xA;q~{se`}*&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So I'd like to see the new one reopened and the old one closed subsequently, but I'm not going to throw a mod hammer onto either (although I might do so if there are already a few votes from other users).&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2016-02-03T15:35:19.470" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8284" PostTypeId="2" ParentId="6918" CreationDate="2016-02-03T20:56:38.013" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;http://esolangs.org/wiki/AnnieFlow&quot; rel=&quot;nofollow&quot;&gt;AnnieFlow&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This language was created by me, Fricative Melon, recently, though it is based on &lt;a href=&quot;http://esolangs.org/wiki/StackFlow&quot; rel=&quot;nofollow&quot;&gt;StackFlow&lt;/a&gt;. I liked the idea of StackFlow, but it was clunky and had no interpreter (and I didn't want to write an interpreter for it), so I made my own variation. The main idea of StackFlow is to have a fixed starting number of stacks, and a fixed number of symbols for each stack, and have all operations be popping from stack to stack and pushing symbols before each pop, with each symbol going to different stacks and pushing different symbols when popped, the inspiration for its creator being Magic the Gathering, and proving languages Turing complete by implementing it in them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My version is completely &quot;type&quot; safe with no wasted bits, and every program is a valid one, if you add enough 1s to the end of it. The cat program is 11, and a program that does nothing is 01. The null program is not actually a valid program, and there are no trivial quines. The interpreter is &lt;a href=&quot;https://github.com/allenkev/annieflow&quot; rel=&quot;nofollow&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The name is a variation of &quot;AnyFlow&quot; since although the current interpreter uses stacks, using another data structure is a one line change, and you could even mix and match them. There is really no fixed stackiness of the language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is my first &quot;new&quot; language, so let me know how I could improve the documentation, it may be a bit messy right now.&lt;/p&gt;&#xA;" OwnerUserId="49330" LastActivityDate="2016-02-03T20:56:38.013" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8285" PostTypeId="1" CreationDate="2016-02-04T03:18:16.050" Score="2" ViewCount="45" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1875/closing-old-question-as-duplicate-of-a-new-one&quot;&gt;This&lt;/a&gt; would answer my question, if only it &lt;em&gt;had&lt;/em&gt; a real, accepted, useful answer, which is why I ask.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I encountered &lt;a href=&quot;https://codegolf.stackexchange.com/review/close/27449&quot;&gt;this item&lt;/a&gt; in the VTC Review Queue. Essentially, it's a case of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2323/look-and-say-sequence&quot;&gt;a question from 2011&lt;/a&gt; being closed as a dupe of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/70837/say-what-you-see&quot;&gt;one asked yesterday&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I understand &lt;em&gt;why&lt;/em&gt; this has happened. Indeed, there are plenty closey votes on the old Q, and it's probably for the best, but I wonder if we have a policy on this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't intend to challenge Mego or the close-voters by asking this question here. I intend to understand more clearly under which circumstances this sort of retro duplicate identification is good or common.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This question pair I cite in particular does have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8281/duplicates-with-different-restrictions-or-no-restrictions&quot;&gt;a discussion&lt;/a&gt;, which is helpful to me, but I want to know about the broader scope of &lt;em&gt;all questions&lt;/em&gt;, not only a restrictions-differences-semantics centered discussion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When is it appropriate to close an old question of a dupe as a newer one? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't believe the two questions are duplicates really, because I think that their separation of intent and time is enough. (This is not reflected by my vote to close, which I cast when I had a different opinion about this 20 minutes ago.)&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2016-02-04T03:18:16.050" Title="Closing old questions as duplicates in favour of new ones" Tags="|discussion|duplicates|" AnswerCount="0" CommentCount="2" ClosedDate="2016-02-05T10:17:19.907" ContentLicense="CC BY-SA 3.0" />
  <row Id="8286" PostTypeId="2" ParentId="1875" CreationDate="2016-02-04T06:12:29.727" Score="10" Body="&lt;h2&gt;Guidelines for closing duplicates&lt;/h2&gt;&#xA;&lt;p&gt;This is not intended to be an all-or-nothing list, nor is it exhaustive. These are simply questions to ask yourself when considering casting a close-as-dupe vote on a challenge, which may influence your decision.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Is the &amp;quot;meat&amp;quot; of the challenges the same?&lt;/strong&gt; This is probably the easiest to determine; casting aside input and output formats (unless they are complex and/or interesting enough to be worthy of a challenge on their own), do the challenges ask users to solve the same problem? If so, then the challenges are almost certainly duplicates.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1876/45941&quot;&gt;&lt;strong&gt;Could answers from one be posted to the other, with trivial modifications at most, and be competitive?&lt;/strong&gt;&lt;/a&gt; This answer of Martin's is probably the most-cited answer when it comes to dupe policy. Martin does an excellent job of explaining the criteria he uses, which I also try to use in my judgements. The key point is that the answers would be &lt;em&gt;competitive&lt;/em&gt;. It is not enough for the answers to be valid; they must have a serious chance of winning the challenge (or, if not winning, at least performing reasonably well). This is kind of a fuzzy criterion, so I'm going to try to solidify it more: if the answers would get deleted due to not being serious contenders (as per our normal rules), they're not competitive, and the questions are not duplicates by this metric.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Which challenge is better?&lt;/strong&gt; We've had a whole lot of discussion on this topic (see &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8281/duplicates-with-different-restrictions-or-no-restrictions&quot;&gt;Duplicates with different restrictions or no restrictions&lt;/a&gt;). Consider which of the challenges has the clearest specification, violates the least number of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges&quot;&gt;Things to avoid when writing challenges&lt;/a&gt;, and is the most interesting. This is a very subjective decision. It ultimately boils down to, which challenge do &lt;strong&gt;you&lt;/strong&gt; think is best to keep? Be aware that &amp;quot;none of the above&amp;quot; is an acceptable answer if you believe none of the challenges in question meet our quality standards.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If, after considering all of the above, you're still not sure what should be done, &lt;strong&gt;start a discussion about the challenges&lt;/strong&gt;. The community here will either point you towards existing policies/consensus, or we will debate until a consensus is formed.&lt;/p&gt;&#xA;&lt;p&gt;Important note: As Martin's answer mentioned, closing old challenges as dupes of new challenges should be considered on a post-by-post basis, so a meta discussion is probably appropriate for each. This shouldn't spawn an excessive amount of meta posts, as the number of old challenges this policy would apply to are limited. Discuss before you vote, to avoid confusion! These guidelines are intended to help you decide which course of action you think is best, so you can take the appropriate steps to resolve the issue.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-05T06:36:44.910" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8287" PostTypeId="1" CreationDate="2016-02-04T13:11:57.303" Score="10" ViewCount="644" Body="&lt;p&gt;There are lots of questions about whether to count the bytes in an import statement, etc. This question is not about that. Instead, this question is more inline with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7205/49161&quot;&gt;this question&lt;/a&gt; but I think it would be considered off topic/distinct.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Again, assume standard library imports are allowed at least, and that the byte count of the whole import is included in the score. The question arose &lt;a href=&quot;https://codegolf.stackexchange.com/q/70365/49161&quot;&gt;here&lt;/a&gt; where many languages have libraries that provide a ready made solution. Now, &lt;strong&gt;is importing the solution enough, or does the required function need to be reassigned or evaluated?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When considering the consensus about builtin functions, it seems builtin solutions are acceptable in two situations:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The builtin is evaluated.&lt;/li&gt;&#xA;&lt;li&gt;The builtin is assigned to a new name.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;My gut feeling is that &lt;strong&gt;just&lt;/strong&gt; importing a library is the same as doing neither of the above and claiming the builtin solves it for 0 bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance, in Python, the NumPy library provides the function &lt;code&gt;eye&lt;/code&gt; which returns the nxn identity matrix.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;from numpy import*&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;seems like cheating, but by the wording of the other discussion, I think it could be argued that it's valid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My gut feeling is that this should not be allowed, but by the wording of the discussion about builtins it looks like it should be. Look at the wording of these two articles &lt;a href=&quot;https://docs.python.org/3/reference/simple_stmts.html#grammar-token-assignment_stmt&quot; rel=&quot;nofollow noreferrer&quot;&gt;assignments&lt;/a&gt; and &lt;a href=&quot;https://docs.python.org/3/reference/import.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;imports&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Assignment statements are used to (re)bind names to values&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Assignment&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The import statement ... searches for the named module, then it binds the results of that search to a name in the local scope.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;from library import func&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;equivalent to &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;func=builtin_func&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and therefore acceptable as an answer? And if, technically, it is, should we put it on the list of banned loopholes?&lt;/p&gt;&#xA;" OwnerUserId="49161" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2023-09-01T14:18:32.337" Title="On scoring imported functions" Tags="|discussion|code-golf|answers|scoring|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8288" PostTypeId="2" ParentId="8287" CreationDate="2016-02-04T13:39:33.647" Score="14" Body="&lt;h2&gt;Score is the length of the import plus the length of the function name&lt;/h2&gt;&#xA;&lt;p&gt;This seems to be the standard around here. If there exists a built-in function (we'll call it &lt;code&gt;foo&lt;/code&gt;) that solves the task, and built-ins are not forbidden, then, for a challenge that accepts functions and not just full programs, the solution would be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;Python, 3 bytes&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;foo&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Similarly, if &lt;code&gt;foo&lt;/code&gt; resides in a module named &lt;code&gt;bar&lt;/code&gt;, the solution would be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;Python, 20 bytes&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;from bar import*&#xA;foo&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;(technically it would be shorter to do &lt;code&gt;import bar\nbar.foo&lt;/code&gt;, but that's beside the point)&lt;/p&gt;&#xA;&lt;p&gt;Though this is specifically aimed at Python, it's easy enough to generalize to other languages. Consider a challenge where the goal is to output the number of characters in an ASCII string. A C solution would be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;C, 25 bytes&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;#include&amp;lt;string.h&amp;gt;&#xA;strlen&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-12T00:52:00.063" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="8289" PostTypeId="2" ParentId="2140" CreationDate="2016-02-04T14:50:05.973" Score="1" Body="&lt;p&gt;&lt;strong&gt;Maximum cover time ratio&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given an undirected graph and a start node, there is an expected number of steps to reach all possible nodes if you walk at random. This expected number of steps will depend on which node you start from. For a given graph and starting node, let us call the number of steps to visit all nodes in the graph the &lt;code&gt;cover time&lt;/code&gt;. We can estimate the &lt;code&gt;cover time&lt;/code&gt; by just setting off 1000 walks and taking the average.&lt;/p&gt;&#xA;&lt;p&gt;You can also set off two independent random walks from the same node at once and see how many steps it takes for every node to be visited by at least one of the walks. Clearly you can do this with more than two as well. Let us call the expected number of steps to reach each node with at least one of &lt;code&gt;k&lt;/code&gt; random walks starting from the same node, the &lt;code&gt;k-cover time&lt;/code&gt;. We can see that &lt;code&gt;cover time = 1-cover time&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Task&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Write code that explores different undirected graphs, starting nodes and values of k and computes both the cover time and the k-cover time for each.  You should use at least 1000 random walks to estimate the time to reach all nodes.  The goal is to maximize the expected cover time ratio explained below.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your code should output a single graph in any sensible format you choose, the value &lt;code&gt;k&lt;/code&gt;, the identity of a starting node, the cover time and the &lt;code&gt;k-cover&lt;/code&gt; time.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Score&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your score will be  &lt;code&gt;cover time&lt;/code&gt; from your given starting node divided by k times &lt;code&gt;k-cover time&lt;/code&gt; starting from the same node.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Languages and libraries&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;You can use any language or library you like (that wasn't designed for this challenge). However, for the purposes of scoring I will run your code on my machine so please provide clear instructions for how to run it on Ubuntu.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;My Machine&lt;/strong&gt; The timings will be run on my machine. This is a standard Ubuntu install on an 8GB AMD FX-8350 Eight-Core Processor.  This also means I need to be able to run your code.&lt;/p&gt;&#xA;&lt;h1&gt;Details&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I will kill your code after 2 minutes unless it starts to run out of memory before then. Your code should therefore output something before 2 minutes is up.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Any help with finishing this question would be gratefully received. I think it just needs examples and test cases and maybe a picture or two.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user9206" LastEditorUserId="-1" LastEditorDisplayName="user9206" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-06T22:14:40.597" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="8290" PostTypeId="1" CreationDate="2016-02-04T15:02:01.347" Score="13" ViewCount="432" Body="&lt;p&gt;Recently, &lt;a href=&quot;https://codegolf.stackexchange.com/users/45941/mego&quot;&gt;Mego&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/45151/quartata&quot;&gt;quartata&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/31957/c-ob&quot;&gt;CᴏɴᴏʀO'Bʀɪᴇɴ&lt;/a&gt; and I (&lt;a href=&quot;https://codegolf.stackexchange.com/users/44713/votetoclose&quot;&gt;VoteToClose&lt;/a&gt;) (building upon the &lt;a href=&quot;https://github.com/ProgramFOX/SE-Chatbot&quot; rel=&quot;nofollow noreferrer&quot;&gt;work&lt;/a&gt; of &lt;a href=&quot;https://codegolf.stackexchange.com/users/9275/programfox&quot;&gt;ProgramFOX&lt;/a&gt; et al.) built a chat bot named &lt;a href=&quot;https://codegolf.stackexchange.com/users/49668/data&quot;&gt;Data&lt;/a&gt; that can run code for several different esoteric languages (and maybe, in the future, other languages). Now, after a conversation with &lt;a href=&quot;https://codegolf.stackexchange.com/users/29588/overactor&quot;&gt;overactor&lt;/a&gt;, one of the devs for &lt;a href=&quot;https://github.com/ProgramFOX/SE-Chatbot&quot; rel=&quot;nofollow noreferrer&quot;&gt;SE-Chatbot&lt;/a&gt;, this was asked:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Could this bot with all its commands be considered a programming language?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;And my immediate reaction was &quot;Of course!&quot; However, I wanted to ask on Meta to be sure.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do you think that we can use this as a programming languages?&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-02-04T15:02:01.347" Title="We Built a Programming Language... right?" Tags="|discussion|policy|chat|" AnswerCount="1" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="8291" PostTypeId="2" ParentId="8290" CreationDate="2016-02-04T15:02:01.347" Score="14" Body="&lt;h1&gt;Yes.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;According to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/44713&quot;&gt;consensus on programming languages&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;Support a representation of natural numbers and of tuples. (We're talking about languages rather than implementations, so we will leave to one side the issue of type widths).&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Check.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;2&quot;&gt;&#xA;  &lt;li&gt;Be able either to transform inputs into outputs (&lt;em&gt;transformational model&lt;/em&gt;) or to distinguish an &quot;accepted&quot; input from a &quot;rejected&quot; input (&lt;em&gt;decision model&lt;/em&gt;).&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Still check.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;3&quot;&gt;&#xA;  &lt;li&gt;Be able to take two natural numbers and add them. In the transformational model, this means transforming an input tuple of two numbers into an output which correctly represents their sum. In the decision model this means deciding whether an input contains the representation of a tuple of three natural numbers such that the third is the sum of the first two.&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Big check.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;4&quot;&gt;&#xA;  &lt;li&gt;Be able to take a natural number and say whether or not it is a prime. In the transformational model this means transforming a natural number into the representation of &lt;code&gt;0&lt;/code&gt; or &lt;code&gt;1&lt;/code&gt; according to whether it is a composite or a prime number. In the decision model it means accepting precisely those inputs which represent a prime.&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Check.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, questions still need to be asked: &quot;What defines input for this language&quot;, &quot;Is it a full functioning program&quot;, &quot;Is chat a command line (and then how do we count bytes/flags)&quot;, etc, but we can define those later if a consensus on this is reached.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.357" LastActivityDate="2016-02-04T15:02:01.347" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8292" PostTypeId="1" CreationDate="2016-02-04T20:58:33.503" Score="1" ViewCount="70" Body="&lt;p&gt;I've often come across answers like this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Python3, 40 bytes&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;i=0&#xA;while i&amp;gt;10:&#xA;    i+=1&#xA;    print(str(i))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;When you could golf it down to&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Python3, 33 bytes&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;for i in range(10): print(str(i))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Should you edit it, or leave it how it is and leave a helpful comment?&lt;/p&gt;&#xA;" OwnerUserId="48864" LastActivityDate="2016-02-04T20:58:33.503" Title="Should you edit other people's answer with lower byte counts?" Tags="|discussion|editing|" AnswerCount="0" CommentCount="1" ClosedDate="2016-02-04T21:02:13.253" ContentLicense="CC BY-SA 3.0" />
  <row Id="8295" PostTypeId="2" ParentId="2140" CreationDate="2016-02-05T03:20:51.463" Score="4" Body="&lt;h1&gt;Random Physics Golf #1: Net Gravitational Force &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;Introduction to the Series&lt;/h2&gt;&#xA;&lt;p&gt;Every week or so I will be posting a physics challenge. My goal here is to design challenges that in the end, teach some people some physics. Overall, the challenges will be very basic with little information. All of these challenges will have the minimal information necessary to solve them, and the goal is for users like you to do some research, watch some videos, and understand how these concepts work to teach you how to approach these types of physics problems and explain how they work. Of course, I will also give two optional hints per challenge, which are there if you do not have the time or determination to do the research, or you cannot figure out how to do the problem after researching. The two hints will be &amp;quot;necessary equations for this challenge&amp;quot; and &amp;quot;process to solve the problem&amp;quot;. The hints are completely optional to use and it is encourages to not use them, but as stated above to learn the information for yourself. The series will have one main leaderboard. Whoever has the least combined byte count for all of the challenges gets a &lt;em&gt;to be determined&lt;/em&gt; prize. Each challenge will range in difficulty, with an upwards trend of difficulty. I wish you all luck and I hope you learn a thing or two!&lt;/p&gt;&#xA;&lt;h2&gt;Challenge #1: Net Gravitational Force&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note 1: this challenge highly requires knowledge of the mathematical &lt;em&gt;vector&lt;/em&gt; quantity, if you do not know what that is, I suggest reading &lt;a href=&quot;http://www.dummies.com/how-to/content/what-is-a-vector.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; and &lt;a href=&quot;http://www.physicsclassroom.com/class/vectors/Lesson-1/Vector-Addition&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; before attempting this challenge.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note 2: this challenge considers gravity in &lt;em&gt;CLASSICAL MECHANICS&lt;/em&gt;. Disregard general relativity for this challenge.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Lets start with the definition of a force. A force is a &lt;em&gt;vector&lt;/em&gt; quantity, a number with both direction and magnitude. Simply put, force is mass times acceleration. Many mathematicians will know the name of this formula as &lt;em&gt;Newton's Second Law&lt;/em&gt;. Now, that is a well known formula, but here is something less known: all forces are classified in one of four categories: &lt;em&gt;weak nuclear&lt;/em&gt;, &lt;em&gt;strong nuclear&lt;/em&gt;, &lt;em&gt;electromagnetic&lt;/em&gt;, and &lt;em&gt;gravitational&lt;/em&gt;. These four are called the &lt;em&gt;four fundamental forces of the universe&lt;/em&gt;. We will be focusing on the gravitational force in this called.&lt;/p&gt;&#xA;&lt;p&gt;The gravitational force is then classified as a &lt;em&gt;field force&lt;/em&gt;. This means that the force acts on all objects in a certain radius around another object. In this case, gravity pulls down on objects from anywhere in a radius around them. However, I still have not defined where gravity comes from. Well, the simple answer is from &lt;em&gt;mass&lt;/em&gt;. An object with more mass has a bigger gravitational pull on objects around it. In case you are wondering, the earth has a gravitational pull of &lt;code&gt;-9.81 m/s^2&lt;/code&gt; (an object will gain &lt;code&gt;9.8 m/s&lt;/code&gt; of downward velocity every second). But here is where it gets fun: because gravity comes from &lt;em&gt;mass&lt;/em&gt;, every object with mass has a &lt;em&gt;gravitational pull&lt;/em&gt;. This is where you come in. I want you to calculate the &lt;em&gt;net gravitational pull&lt;/em&gt; of all the objects surrounding another object. Here is a better explanation:&lt;/p&gt;&#xA;&lt;p&gt;You will receive co-ordinates and masses of objects in space for input. So an example input could be visualized as this:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/bdJDK.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/bdJDK.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&#xA;You can easily see each force being applied on the target object by the three larger objects. Objects will smaller masses have a smaller gravitational field (as shown by the orange force arrow). Your job in this challenge is to find the &lt;em&gt;net gravitational force&lt;/em&gt; being acted on the target object. To do this, it is a simple vector addition problem with the forces from the other objects. So, the resultant vector (net force), may look something like this:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/GtMoj.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/GtMoj.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&#xA;This is all of the information that I will give you. It is now your job to find the equations, and research how this all works.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge Specs&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input will be several lists of numbers consisting of the &lt;code&gt;x co-ordinate&lt;/code&gt;, &lt;code&gt;y co-ordinate&lt;/code&gt;, and &lt;code&gt;mass&lt;/code&gt; of each object. The numbers could be either integers or decimals. You may take this in any convienent format (&lt;code&gt;[[1 2 3][4 5 6][7 8 9]&lt;/code&gt;, &lt;code&gt;[(1,2,3),(4,5,6),(7,8,9)]&lt;/code&gt; and &lt;code&gt;1,2,3|4,5,6|7,8,9&lt;/code&gt; are all acceptable. The first list of inputs will always be the target object (red in the pictures above), and the other lists will be the other objects. All inputs will have at least two objects. No objects will have the same co-ordinates.&lt;/li&gt;&#xA;&lt;li&gt;Output will be two numbers, in any human-readable format, in any order. One will be the &lt;em&gt;magnitude&lt;/em&gt; of the net force, using your desired unit system (SI, Planck units, Imperial units, etc.) and the other will be the &lt;em&gt;direction&lt;/em&gt; in &lt;em&gt;radians OR degrees&lt;/em&gt; of the net force. Output must be precise to the least number of significant figures in the input (&lt;code&gt;Input: 2, 3.5, 6.1 -&amp;gt; Output: 200 (232.34 before rounding)&lt;/code&gt;, note this is not an actual test case). Output may or may not be in scientific notation, its up to you.&lt;/li&gt;&#xA;&lt;li&gt;You may assume input will not cause any error during execution, and you may assume all inputs will be valid.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;META NOTE: Help me decide the precision of the output: &lt;a href=&quot;http://strawpoll.me/6825341&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://strawpoll.me/6825341&lt;/a&gt;&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Meta Note: WIP&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Hints&lt;/h2&gt;&#xA;&lt;p&gt;These hints are for those who do not want to put in the time and effort of research, or those who could not find a solution. So, here are the two hints:&lt;/p&gt;&#xA;&lt;h3&gt;Hint 1: Equations:&lt;/h3&gt;&#xA;&lt;p&gt;You need the following equations for this challenge:&lt;/p&gt;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;&lt;p&gt; &lt;a href=&quot;https://i.stack.imgur.com/x98lT.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/x98lT.gif&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&#xA; &lt;p&gt;&#xA; You will also need the standard vector equations for this challenge:&#xA; &lt;p&gt;&#xA; &lt;a href=&quot;https://i.stack.imgur.com/Gu55q.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Gu55q.gif&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;Hint 2: Sample Solution Process:&lt;/h3&gt;&#xA;&lt;p&gt;It would take up too much space to fit it all here, so I made &lt;a href=&quot;https://drive.google.com/file/d/0Byu4AFDjMDT1aTFDMjN5LTlmTVk/view?usp=sharing&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; to aid you for this hint.&lt;/p&gt;&#xA;&lt;h2&gt;Leaderboard&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Meta Note: blah blah blah, working leaderboard will eventually go here! This leaderboard will contain and combine scores for all of the weekly challenges. It will only be visible on this question, though.&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="36670" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-15T17:18:41.817" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8296" PostTypeId="1" CreationDate="2016-02-05T03:46:16.370" Score="7" ViewCount="164" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;put on hold as unclear what you're asking by Xxx, Yyy, Zzz 1 hour ago&lt;/p&gt;&#xA;&lt;p&gt;Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the &lt;a href=&quot;https://codegolf.stackexchange.com/help/how-to-ask&quot;&gt;How to Ask&lt;/a&gt; page for help clarifying this question.&#xA;If this question can be reworded to fit the rules in the &lt;a href=&quot;https://codegolf.stackexchange.com/help/closed-questions&quot;&gt;help center&lt;/a&gt;, please &lt;a href=&quot;/edit&quot;&gt;edit&lt;/a&gt; your question.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;What does this actually mean when the problem is specifically defined except for a few edge cases? Should there be a different message for &amp;quot;Your problem is 99% defined but has a few unclear points&amp;quot;? The current message says to anyone who just reads it, but not the challenge itself is that this challenge is almost completely unintelligible or not a well thought out problem.&lt;/p&gt;&#xA;&lt;p&gt;Edge cases are by definition hard, and hard to spot/foresee. I don't have a problem with people telling me about edge cases that I haven't thought about but having the challenge put on hold with a message that effectively says &amp;quot;it's rubbish&amp;quot; before I have a chance to address the edge cases is not helpful.&lt;/p&gt;&#xA;&lt;p&gt;I would never say &lt;code&gt;As it's currently written, it’s hard to tell exactly what you're asking&lt;/code&gt; at work about a spec I'd been given if I wanted to keep my job, unless the spec was complete gibberish. I'd say &lt;code&gt;There are a few points that need clarifying&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I would prefer a second option that says &amp;quot;You need to address a few small but important points before this challenge can be answered&amp;quot;. Or perhaps change the wording of the existing message to appropriately cover both. It's like the difference between &lt;code&gt;0.99 &amp;lt; 1&lt;/code&gt; and &lt;code&gt;0.1 &amp;lt; 1&lt;/code&gt;. The former has a much better chance of being salvaged than the later.&lt;/p&gt;&#xA;" OwnerUserId="29560" LastEditorUserId="68942" LastEditDate="2021-06-09T05:50:26.877" LastActivityDate="2021-06-09T05:50:26.877" Title="Can we have a different Put On Hold message?" Tags="|discussion|feature-request|status-declined|challenges|close-reasons|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8297" PostTypeId="2" ParentId="8296" CreationDate="2016-02-05T03:49:07.317" Score="12" Body="&lt;h2&gt;That's a standard message&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Certain close messages are standard across all Stack Exchange sites and cannot be changed on a per-site basis. People who vote to close as unclear should specify in comments what exactly is unclear.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-02-05T03:49:07.317" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8299" PostTypeId="1" CreationDate="2016-02-05T09:25:10.213" Score="6" ViewCount="181" Body="&lt;p&gt;I want to make a challenge about genetic algorithm. It is not sandboxed right now. But the task is given a list of neuclide(String with only &quot;ATGC&quot;), the scoring function, and another parameter, you must do a genetic algorithm. (Be note it is the sketch of the sketch) However, the scoring function is inputted as function. How to do that?&lt;/p&gt;&#xA;" OwnerUserId="46245" LastEditorUserId="40695" LastEditDate="2016-02-13T04:21:40.297" LastActivityDate="2016-02-14T19:09:55.927" Title="How to take a function as an input" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8300" PostTypeId="2" ParentId="8299" CreationDate="2016-02-05T13:23:41.377" Score="6" Body="&lt;p&gt;However works.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If an answer is in a language which allows passing functions (as first class objects, function pointers, etc) then the answer can be given as a function which takes another function as one of its parameters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If an answer is in a language which has some form of eval then it can be a function or a full program which takes a string and evals it appropriately.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a language doesn't have any suitable mechanism, tough luck.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2016-02-05T13:23:41.377" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8301" PostTypeId="2" ParentId="8299" CreationDate="2016-02-05T14:44:20.483" Score="8" Body="&lt;p&gt;There seems to be no existing consensus for this, and very few challenges require functions as input, so you can pretty much decide it for yourself. I would allow the two methods in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8300/32014&quot;&gt;Peter Taylor's answer&lt;/a&gt;, and a third alternative:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a language can pass functions as function arguments by some standard mechanism, like first-class functions, function pointers or CJam blocks, then the scoring function can simply be taken as an argument.&lt;/li&gt;&#xA;&lt;li&gt;If a language has &lt;code&gt;eval&lt;/code&gt; or equivalent, which interprets and runs a string as code, then a string that defines the scoring function can be taken as input.&lt;/li&gt;&#xA;&lt;li&gt;One can also assume that the scoring function has already been defined as &lt;code&gt;S&lt;/code&gt; (or some other name), and can be used in the answer. The definition of &lt;code&gt;S&lt;/code&gt; is not counted toward the score.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If you want, you can restrict the last alternative to languages that don't support the first two.&lt;/p&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2016-02-14T19:09:55.927" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8302" PostTypeId="2" ParentId="2140" CreationDate="2016-02-05T14:56:44.797" Score="19" Body="&lt;h1&gt;Anarchist chess&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/fE8hZ.png&quot; alt=&quot;Initial position&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;Just like chess, except that instead of two opposing armies, it's a free-for-all among the pawns.&lt;/p&gt;&#xA;&lt;p&gt;The two players alternate moves. The allowed moves are to move a pawn one square forward (if the square ahead is unoccupied); if the pawn is on its initial position, to move it two squares forward (if the two squares ahead are unoccupied), or to capture a pawn that is one square ahead diagonally. Pawns do not promote upon reaching the last row and there is no en passant. The player who is left without a legal move loses.&lt;/p&gt;&#xA;&lt;p&gt;This is an example of an &lt;a href=&quot;https://en.wikipedia.org/wiki/Impartial_game&quot; rel=&quot;nofollow noreferrer&quot;&gt;impartial game&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="30688" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-05T14:56:44.797" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="8305" PostTypeId="1" CreationDate="2016-02-05T22:54:44.227" Score="6" ViewCount="193" Body="&lt;p&gt;&lt;strong&gt;Edit&lt;/strong&gt; &lt;em&gt;I was mistaken about the links being bad in the mp3 challenge. It wasn't playing well with Centos but seems to be fine on Windows. As such, there are no grounds for closing that challenge. The Rubik's Revenge challenge is currently on hold.&lt;/em&gt;  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;We have at least two high voted (&quot;good&quot;) questions (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/18543/find-the-beats-in-an-mp3-file&quot;&gt;mp3 beats&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/12056/rubiks-revenge&quot;&gt;Rubik's Revenge&lt;/a&gt;) that I see as being in a similar boat:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;They are both highly upvoted (+16 and +30)&lt;/li&gt;&#xA;&lt;li&gt;Were someone to answer, the answer could not be scored (rubik's lacks test cases, beats has bad file links)&lt;/li&gt;&#xA;&lt;li&gt;Both posts are 2+ years old&lt;/li&gt;&#xA;&lt;li&gt;Both OP's have not been active on PPCG for ~2 years. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;As it stands, I think it is relatively clear that since they cannot be scored, they effectively fall into the &quot;lack objective winning criteria&quot; category and as such are off-topic. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The recourse would then be put them on hold and since the OP's do not seem to be involved, it would be up to the community to edit them. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;My actuall questions are specific to each of the posts:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For the &lt;strong&gt;Rubik's Revenge&lt;/strong&gt; post, if the scoring criteria is left the way it is, test cases are needed. However, to generate test cases, it is likely that someone would need to first actually write an answer (or go through most of the steps for writing an answer.) It seems to me that this would then kind of invalidate the answer of that poster, because he'd be generating test cases and then running his own answer around this. &lt;strong&gt;Is there any way around this short of changing the winning criteria for the challenge?&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;For the &lt;strong&gt;mp3 Beats&lt;/strong&gt; post, there are some comments that indicate the challenge might be improved by removing the requirement that files be .mp3. &lt;strong&gt;If the challenge were closed (or even if it isn't) would it be acceptable for me to post almost the same challenge, with the filetype restriction removed?&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="45459" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-05-24T06:46:01.430" Title="&quot;Good&quot; Questions that are Incomplete" Tags="|discussion|policy|specific-question|editing|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8307" PostTypeId="1" CreationDate="2016-02-06T04:03:35.057" Score="-1" ViewCount="88" Body="&lt;p&gt;In my last meta post, I asked about &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8130/why-do-we-have-objective-winning-criteria&quot;&gt;why we need objective winning criterion&lt;/a&gt;.  Martin made a really good point that we need objective scoring to motivate users to improve their code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, the argument is a bit weak when it comes to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenges.  Because &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot;&gt;answers have to be run on a single machine&lt;/a&gt;, times that users post are mere estimations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To counteract this, &lt;strong&gt;would it be a good idea to require all answers to be in Javascript, and have a stack snippet that runs all of the answers on a page?&lt;/strong&gt;  Users would be able to compare their answers to the current submissions, and would be motivated to improve their code further.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Note: I'm not saying that the OP doesn't need to run the submissions themselves for the final scores)&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2016-02-06T04:32:39.620" Title="Would language restrictions for fastest-code problems be ok?" Tags="|discussion|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8308" PostTypeId="2" ParentId="8307" CreationDate="2016-02-06T04:32:39.620" Score="0" Body="&lt;h2&gt;Generally speaking, no.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenges, the OPs typically restrict the allowable language to the set of those freely available for their operating systems. Anything further than that would be disallowing a more or less arbitrary set of languages, which is very sternly frowned upon here. So while you &lt;em&gt;can&lt;/em&gt; post a language-specific fastest code challenge, it will not likely be well received.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-02-06T04:32:39.620" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8311" PostTypeId="2" ParentId="2140" CreationDate="2016-02-06T17:00:14.553" Score="0" Body="&lt;h1&gt;Reasoning&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Reasoning is one of the most important human capabilities, often counted&#xA;as what separates us from other species. This capacity, however, takes up&#xA;a substantial portion of our meaty brain. Your challenge is to recreate&#xA;a reasoning system in a much abbreviated form.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Definitions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The challenge, is, given a universe of objects and &lt;em&gt;n&lt;/em&gt;-ary relations and a set&#xA;of facts and laws on the relations, to determine whether a hypothesis is a fact&#xA;or not. The language in which these are expressed are drawn from the&#xA;alphabet &quot;012345789RC@ &quot; under the following rules (in EBNF with an ad-hoc expansion).&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;An &lt;em&gt;unbound-variable&lt;/em&gt; is denoted by a sequence of digits denoting a non-negative integer. For example, &lt;code&gt;3&lt;/code&gt; is a variable which we may read as &quot;object 3&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;natural = non-zero-digit , { digit } ;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;unbound-variable = natural ;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A &lt;em&gt;bound-variable&lt;/em&gt; is denoted by a &quot;@&quot; followed by an unbound variable. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;bound-variable = &quot;@&quot; , unbound-variable ;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A &lt;em&gt;variable&lt;/em&gt; is either a bound-variable or an unbound-variable&lt;/p&gt;&#xA;&#xA;&lt;p&gt;variable = bound-variable | unbound-variable ;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A &lt;em&gt;relation-identifier&lt;/em&gt; is denoted by a capital &quot;R&quot; followed by a single digit denoting its arity and then a natural number identifying it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;relation-identifier(n : digit) = &quot;R&quot; , n , natural ;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A &lt;em&gt;relation&lt;/em&gt; is denoted by a relation identifier followed by a sequence of variables whose length matches its arity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;relation = relation-identifier(a) , a * { &quot; &quot; , variable } ;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A &lt;em&gt;consequence&lt;/em&gt; is denoted by a capital &quot;C&quot; followed by two relations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;consequence = &quot;C&quot; , relation , relation ;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;An &lt;em&gt;expression&lt;/em&gt; is either a consequence or relation of that magnitude.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;expression = consequence | relation ;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The inference rules are the following:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;From &lt;code&gt;C R R'&lt;/code&gt; and &lt;code&gt;R&lt;/code&gt; (where &lt;code&gt;R&lt;/code&gt; and &lt;code&gt;R'&lt;/code&gt; are relations) to infer &lt;code&gt;R'&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;From &lt;code&gt;E&lt;/code&gt; to infer &lt;code&gt;E{@m=p}&lt;/code&gt; where &lt;code&gt;E{@m=p}&lt;/code&gt; is the expression &lt;code&gt;E&lt;/code&gt; with all instances of bound-variable &lt;code&gt;@m&lt;/code&gt; replaced by variable &lt;code&gt;p&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You will be given a sequence of at least one expression, that will be provided as a newline separated strings on the stdin. The first of these will be a relation with no bound variables -- the hypothesis. The remaining expressions are the facts. Your program must indicate whether the hypothesis can be infered from the facts or not. It does this by printing any of the following strings to the stdout: &quot;true&quot; (case-insensitive), &quot;+&quot;, &quot;1&quot;, &quot;yes&quot;. Any other input will be interpreted as claiming the hypothesis cannot be infered from the facts.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;input:&#xA;R00&#xA;&amp;gt;expected output:&#xA;false|no|whatever&#xA;&#xA;&amp;gt;input:&#xA;R00&#xA;R00&#xA;&amp;gt;expected output:&#xA;true&#xA;&#xA;&amp;gt;input:&#xA;R10 0&#xA;R10 @1&#xA;&amp;gt;expected output:&#xA;true&#xA;&#xA;&amp;gt;input:&#xA;R20 4 9&#xA;R20 9 4&#xA;CR20 9 4R20 4 9&#xA;&amp;gt;expected output:&#xA;true&#xA;&#xA;&amp;gt;input: &#xA;R2859 7 163&#xA;R2859 @0 163&#xA;&amp;gt;expected output:&#xA;true&#xA;&#xA;&amp;gt;input:&#xA;R10 5&#xA;R10 1&#xA;CR10 1R10 2&#xA;CR10 2R10 3&#xA;CR10 3R10 4&#xA;CR10 4R10 5&#xA;&amp;gt;expected output:&#xA;true&#xA;&#xA;&amp;gt;input:&#xA;R10 6&#xA;R10 1&#xA;CR10 1R10 2&#xA;CR10 2R10 3&#xA;CR10 3R10 4&#xA;CR10 4R10 5&#xA;&amp;gt;expected output:&#xA;false   &#xA;&#xA;&amp;gt;input&#xA;R20 4 5&#xA;R20 9 6&#xA;CR20 6 @0R20 7 @0&#xA;CR20 @0 7R20 @0 4&#xA;CR20 @0 9R20 5 @0&#xA;CR20 @0 @1CR20 @1 @0&#xA;&amp;gt;expected output: &#xA;true&#xA;&#xA;&amp;gt;input&#xA;R20 4 5&#xA;R20 9 6&#xA;CR20 6 @0R20 7 @0&#xA;CR20 @0 7R20 @0 5&#xA;CR20 @0 9R20 5 @0&#xA;CR20 @0 @1CR20 @1 @0&#xA;&amp;gt;expected output: &#xA;false&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Grading&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a golf competition, the fewest number of bytes wins. Other restrictions are TBD.&lt;/p&gt;&#xA;" OwnerUserId="4420" LastActivityDate="2016-02-06T17:00:14.553" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8312" PostTypeId="2" ParentId="2140" CreationDate="2016-02-06T20:49:47.580" Score="1" Body="&lt;h1&gt;Wring the changes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I want to ring Stedman Doubles, but I'm lazy so I want to get to a particular change and back as quickly as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Change-ringing is essentially an enumeration of permutations of a set of small integers. To make the enumeration ringable, no bell can move more than one step in each permutation. A change therefore consists of some or all of the bells swapping places with adjacent bells.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider the case of five bells. Before changes start, the bells are rung in ascending numerical order, known as Rounds, which would be &lt;code&gt;12345&lt;/code&gt;. A typical change would then consist of leaving one bell in the same place while a double swap occurs between the remaining four bells, thus the name &quot;Doubles&quot;. The bell that remains in the same place serves to notate the change. Note that this refers to the bell currently in that position, rather than the bell with that number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the case of Stedman the full notation is &lt;code&gt;3.1.5.3.1.3.1.3.5.1.3.1&lt;/code&gt;. If you repeat those 12 changes five times you will enumerate 60 changes before returning to Rounds. The first few changes are as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[12345 Rounds]&#xA; 21354 (1,2 and 4,5 swap)&#xA; 23145 (1,3 and 5,4 swap; 2 was 1st so doesn't move)&#xA; 32415 (2,3 and 1,4 swap)&#xA; 23451 (3,2 and 1,5 swap; 4 was 3rd so doesn't move)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There are of course 120 permutations of five bells, so in order to access the other 60 changes, or simply for variety, Stedman allows for every sixth change to be altered by a call known as a Single, which causes the two bells currently in position 4 and 5 to stay in the same place instead of exchanging as they would normally do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A touch is described by a sequence of letters describing whether each sixth change is Plain or a Single. It ends when it returns to Rounds, which need not be after a multiple of six changes, but it may not repeat any change, so 120 is the longest possible length of a touch of Stedman Doubles. For instance, a complete extent of all 120 changes could be rung using the touch &lt;code&gt;PPPPPPPPPSPPPPPPPPPS&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to write a program or function that will calculate the shortest touch that includes a given change. Your input should be the change (you can expect it to be a valid change) as a string, and your output should be (in either order) the touch description (as a string of P and S characters) and also the number of changes (including the final rounds, so up to 120).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The score for this challenge shall be the length of your program, plus the lengths of the touches it finds for the following inputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;13524&#xA;14235&#xA;14253&#xA;43215&#xA;53124&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The Batch script &lt;code&gt;@echo 120 PPPPPPPPPSPPPPPPPPPS&lt;/code&gt; would therefore score 630.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2016-02-17T22:00:54.870" LastActivityDate="2016-02-17T22:00:54.870" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8313" PostTypeId="1" CreationDate="2016-02-06T21:41:53.100" Score="3" ViewCount="65" Body="&lt;p&gt;We have several questions involving aspects of calculus:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/2072/44713&quot;&gt;Numerical Integration through Plotting&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/66714/44713&quot;&gt;Symbolic Integration of Polynomials&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/41333/44713&quot;&gt;Evaluate CDF of Student-t distribution&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/68126/44713&quot;&gt;Do the Chain Rule&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/63887/44713&quot;&gt;Gamma Function Golf&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/54162/44713&quot;&gt;Symbolic Differentiation of Polynomials&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/12479/44713&quot;&gt;Build the blancmange function&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/31930/44713&quot;&gt;Help me with differential calculus!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/11847/44713&quot;&gt;Determine stability of a system using the Routh-Hurwitz stability criterion&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;We already have tags for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/probability-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;probability-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;probability-theory&lt;/a&gt;, and various other sects of mathematics. I doubt that we won't have more calculus questions, so let's make a tag for the future.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-02-06T22:02:06.727" Title="Time for a Calculus Tag" Tags="|feature-request|status-completed|tags|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8314" PostTypeId="2" ParentId="8313" CreationDate="2016-02-06T22:01:59.437" Score="4" Body="&lt;p&gt;The tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/calculus&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;calculus&amp;#39;&quot; rel=&quot;tag&quot;&gt;calculus&lt;/a&gt; has been created. The 9 challenges linked in the question have been retagged to add this.&lt;/p&gt;&#xA;&lt;p&gt;At least for starters, I've added the following information to the tag wiki.&lt;/p&gt;&#xA;&lt;p&gt;Description:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Use this tag for challenges involving integration or differentiation of functions.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Wiki:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Calculus&quot; rel=&quot;nofollow noreferrer&quot;&gt;Calculus&lt;/a&gt;, not to be confused with &lt;a href=&quot;https://en.wikipedia.org/wiki/Lambda_calculus&quot; rel=&quot;nofollow noreferrer&quot;&gt;lambda calculus&lt;/a&gt;, is the mathematical study of change. The main branches are differential calculus, which involves taking derivatives of functions, and integral calculus, which involves integrating functions.&lt;/p&gt;&#xA;&lt;p&gt;This tag should be used for any challenge which requires numerically or symbolically differentiating or integrating functions.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;We should be vigilant in making sure that challenge authors do not confuse &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/calculus&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;calculus&amp;#39;&quot; rel=&quot;tag&quot;&gt;calculus&lt;/a&gt; with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/lambda-calculus&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;lambda-calculus&amp;#39;&quot; rel=&quot;tag&quot;&gt;lambda-calculus&lt;/a&gt;, as they are entirely separate.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-06T22:01:59.437" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8316" PostTypeId="2" ParentId="2140" CreationDate="2016-02-07T00:21:07.240" Score="0" Body="&lt;h1&gt;Is the plate balanced? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Task&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given a grid of 1 digit numbers and a coordinate, tell me if it is balanced.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;How to balance check&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Explanation coming. I know how it works for 1d (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/54311/balance-a-set-of-weights-on-a-seesaw&quot;&gt;Balance a set of weights on a seesaw&lt;/a&gt;), but don't know how it would work for 2d.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input will be a grid of 1 digit numbers. Each number corresponds to the amount of weight at that location.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA;111&#xA;111&#xA;111&#xA;1,1&#xA;&#xA;Output:&#xA;truthy&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="42736" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:26.977" LastActivityDate="2016-02-08T19:00:45.877" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8317" PostTypeId="2" ParentId="8121" CreationDate="2016-02-07T03:56:02.160" Score="-2" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Why are you here, aside from &quot;to have fun?&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;To learn Lua/golflua and Fortran better by abusing the crap out of them.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Why do you continue to visit the site?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I visit when I can because I find some challenges interesting. I miss a huge chunk of the posts simply due to work schedule (I work 12 hour days, commute included, and this site is, very sadly, blocked at work). So when I pop in once or twice a week, I try a challenge or two that appeals to me (based mostly on click-bait titles, so keep that up).&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;How do you think PPCG can &quot;fit in&quot; to SE in general more? What benefit can it provide to SE that facilitates SE's ultimate goal?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Honestly, it can't. We're here to try winning at challenges by making the smallest code (usually in the most unreadable code), not provide a repository of answers to questions about subject X like all the other SE sites.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And I think that this is a &lt;em&gt;great&lt;/em&gt; aspect to this site. I don't want that to change. I think that this site works &lt;em&gt;because&lt;/em&gt; of how different it is from the canonical SE sites.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;In what ways do you think we can continue to innovate and expand?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;ATM, I've not visited enough to push an opinion.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;How can users who can't or don't want to golf participate on such a &quot;golf-centric&quot; site?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If you know a kid doesn't want to play in your sandbox, don't invite him to your sandbox.&#xA;It's that simple. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If he can't play, show him how to play. And preferably not with esoteric languages at first, show some nice golfed C-family languages, get him interested in the idea of reducing their typical language to near-indiscernible levels. I think that the Pyths, CJams, etc are great (despite not knowing how to read or write them), but they are likely too esoteric and scare of potentially interested parties.&lt;/p&gt;&#xA;" OwnerUserId="11376" LastEditorUserId="11376" LastEditDate="2016-02-09T22:46:41.663" LastActivityDate="2016-02-09T22:46:41.663" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8318" PostTypeId="2" ParentId="8249" CreationDate="2016-02-07T10:29:26.767" Score="2" Body="&lt;h2&gt;Create a close-vote option&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It is very hard to figure out online if a question has been plagiarised for rep, or whether it is totally unintentional. Though we would like to trust some old users on the site, I can't think of any easy way to differentiate them from the new users, that would not be discriminative.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hence I suggest we have a new close-vote type, where we can close a question because a dup exists in the Sandbox. However, if the OP of the sandbox Q permits, the main Q can be reopened.&lt;/p&gt;&#xA;" OwnerUserId="40929" LastActivityDate="2016-02-07T10:29:26.767" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8319" PostTypeId="2" ParentId="2140" CreationDate="2016-02-07T11:11:11.870" Score="0" Body="&lt;h1&gt;Sloppy Shuffle&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program that will shuffle the numbers from 1 to 52. Rather than from your language's random facility, the result will be determined by the input. But not in any particular way -- however you choose!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program must accept all possible (finite) inputs. It doesn't matter if it is empty, or the result of monkeys with typewriters, or anything in between. Literally any input must be accepted without (unhandled) errors.&lt;/li&gt;&#xA;&lt;li&gt;For each of the 52-factorial possible ways of shuffling the numbers, there must be at least one finite input that will make your program produce this permutation.&lt;/li&gt;&#xA;&lt;li&gt;No matter what (finite) input is given to the program, it must produce some permutation of the numbers.&lt;/li&gt;&#xA;&lt;li&gt;If given the same input, the program must always produce the same permutation.&lt;/li&gt;&#xA;&lt;li&gt;Nothing should be produced on stderr.&lt;/li&gt;&#xA;&lt;li&gt;Standard restrictions apply.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input/Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;Default input methods&lt;/a&gt; (such as stdin or command line args) are acceptable. If using stdin, any finite input from stdin must be accepted (although it doesn't all have to be read). For other input methods, use your best judgement in accepting arbitrary binary or string data as appropriate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;Default output methods&lt;/a&gt; (such as stdout) are acceptable. The form of the output should be the number from 1 to 52 in some order corresponding to the permutation as appropriate for your output method.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code golf. The shortest answer in bytes wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, in case of a tie in code length, the first tiebreaker is the maximum over all permutations of the minimum input length needed to generate that permutation. The program that has a larger minimum input wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(That may have been confusing, so an example: if program A can generate any permutation with no fewer than 100 bytes of input, but program B needs at least 1000 bytes to generate the identity permutation, program B wins the tie.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is an example of a program which fulfills the requirements in Lua:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-- return a number from (1,n) depending on input&#xA;local function pick_from(n)&#xA;  local str = io.read() or &quot;&quot;&#xA;&#xA;  -- always proceed even if input is not a number&#xA;  local num = math.floor(tonumber(str) or 0)&#xA;&#xA;  -- guard in case of parsing overflow (e.g. input of 1e99999999999)&#xA;  if num ~= num or num &amp;gt; 1000 or num &amp;lt; -1000 then&#xA;    num = 0&#xA;  end&#xA;&#xA;  return 1 + (num % n)&#xA;end&#xA;&#xA;-- create a list of 52 numbers&#xA;local deck = {}&#xA;for i = 1, 52 do&#xA;  deck[i] = i&#xA;end&#xA;&#xA;-- Fisher-Yates shuffle algorithm&#xA;for i = 52, 1, -1 do&#xA;  local j = pick_from(52)&#xA;  if i ~= j then&#xA;    deck[i], deck[j] = deck[j], deck[i]&#xA;  end&#xA;end&#xA;&#xA;for i = 1, 52 do&#xA;  print(deck[i])&#xA;end&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Notice that although I used the Fisher-Yates algorithm, the property that Fisher-Yates generates a permutation uniformly is irrelevant to the correctness of the program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another note -- if you never read at least log2(52!) bytes from the input, it is probably impossible for your program to generate all permutations.&lt;/p&gt;&#xA;" OwnerUserId="49958" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2016-02-08T22:26:53.147" CommentCount="19" ContentLicense="CC BY-SA 3.0" />
  <row Id="8320" PostTypeId="2" ParentId="2140" CreationDate="2016-02-07T11:38:20.557" Score="1" Body="&lt;h1&gt;Show me your OOP&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contests&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contests&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contests&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to implement OOP that have this feature:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Inheritance (Single dispatch)&lt;/li&gt;&#xA;&lt;li&gt;Class&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Your submission have to translate this pseudo-code into your languages:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;class Animal{&#xA;    Animal(string name){&#xA;        printLn(&quot;An animal has summoned &quot; + name);&#xA;    }&#xA;    public void sound();&#xA;}&#xA;class Sheep extends Animal{&#xA;    bool woolstate;&#xA;    Sheep(bool state){&#xA;        woolstate = state;&#xA;    }&#xA;    public void sound(){&#xA;        printLn(&quot;Mbaaaa\n&quot;);&#xA;    }&#xA;    public void growWool(){&#xA;        woolstate = true;&#xA;    }&#xA;    public void getWool(){&#xA;        if(woolstate == true){&#xA;            printLn(&quot;Mbaaaa\nget &quot; + (new Math.Random()).getInt(0, 10).toString() + &quot; bags of wool&quot;);&#xA;            woolstate = false;&#xA;        }&#xA;    }&#xA;}&#xA;class Worm(){&#xA;    Worm tails;&#xA;    public int numbers;&#xA;    public Worm(int number, int length){&#xA;        if(length != 0){&#xA;            tails = new Worm(number, length-1);&#xA;        }&#xA;        numbers = number;&#xA;        if(number == length){&#xA;            this.privateMethod&#xA;        }&#xA;    }&#xA;    public Worm getTails(){&#xA;        return this.tails;&#xA;    }&#xA;    public Worm setTails(Worm tail){&#xA;        this.tails = tail&#xA;    }&#xA;    public Worm getNumbers(){&#xA;        return this.numbers;&#xA;    }&#xA;    public Worm setNumbers(int number){&#xA;        this.numbers = number&#xA;    }&#xA;    public void sound(){&#xA;        printLn(&quot;Doesn't sound&quot;);&#xA;    }&#xA;    private void privateMethod(){&#xA;        printLn(&quot;This is a private method&quot;);&#xA;    }&#xA;}&#xA;int main(){&#xA;    Sheep a = new Sheep(true);&#xA;    Animal b = new Sheep(false);&#xA;    Worm c = new Worm(5, 5);&#xA;    b.sound();&#xA;    a.sound();&#xA;    b.getWool(); //Error&#xA;    a.getWool();&#xA;    if(c.getNumbers()==5){&#xA;        c.setNumbers(6);&#xA;    }&#xA;    b=c.getTails();&#xA;    b.setNumber(7); //Error&#xA;    b.sound();&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If the random function is not available, you can deterministically return anything from 0 into 10.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The submission should be scored based on:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Difficulty of implementation (i.e. how far is the language from OOP?)&lt;/li&gt;&#xA;&lt;li&gt;Ease of usage of implemetation&lt;/li&gt;&#xA;&lt;li&gt;Efficiency of implementation&lt;/li&gt;&#xA;&lt;li&gt;The pleasantness of syntax&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="46245" LastEditorUserId="46245" LastEditDate="2016-02-07T12:53:00.473" LastActivityDate="2016-02-07T12:53:00.473" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8321" PostTypeId="2" ParentId="2140" CreationDate="2016-02-07T12:39:24.907" Score="0" Body="&lt;p&gt;&lt;strong&gt;Determine if a given loan repayment schedule is a weekly or a daily schedule?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Problem scope&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Its a real life problem which I recently fixed with &amp;gt;90% accuracy but wants to know if there can be near to 100% accurate result. Winner will be the one that can show using datasets that his solution will give minimal failures.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Problem Description&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;You are given a set of repayment schedules, some of which represents a daily repayment schedule and some represents a weekly repayment schedule. Each repayment schedule is in its own file and you need to segregate the repayment schedule files in 2 buckets, daily and weekly.&lt;/p&gt;&#xA;&lt;p&gt;No repayment would be received on bank holidays which include weekends.&lt;/p&gt;&#xA;&lt;p&gt;A &lt;em&gt;weekly repayment schedule&lt;/em&gt; means that borrowers have agreed to make regular fixed repayments on a particular weekday every week. A &lt;em&gt;Daily repayment schedule&lt;/em&gt; means that borrowers have agreed to make a fixed repayment on all working days till loan gets repaid fully.&lt;/p&gt;&#xA;&lt;p&gt;Few Borrowers may do one of these besides doing regular repayments.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Choose not to return on some scheduled repayment days.&lt;/li&gt;&#xA;&lt;li&gt;Choose to make only partial repayment on some scheduled/unscheduled repayment days.&lt;/li&gt;&#xA;&lt;li&gt;Choose to make extra repayment to catch up on previous payment or just doing prepayment.&lt;/li&gt;&#xA;&lt;li&gt;May skip making any payment for extended duration.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Off course, not everyone will do all, but in real life people sometimes are not able to make payments or sometimes do catch up or part payments. At the same time, most borrowers would stick to payment schedules for most of the time of the return duration.&lt;/p&gt;&#xA;&lt;p&gt;A sample demonstrating above conditions from a daily repayment schedule could be as follows for a person not completely regular&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Date         Repayment amount&lt;/p&gt;&#xA;&lt;p&gt;1-Feb-2016   500&lt;/p&gt;&#xA;&lt;p&gt;2-Feb-2016   500&lt;/p&gt;&#xA;&lt;p&gt;4-feb-2016   500&lt;/p&gt;&#xA;&lt;p&gt;8-Feb-2016   400&lt;/p&gt;&#xA;&lt;p&gt;10-Feb-2016  1000&lt;/p&gt;&#xA;&lt;p&gt;10-Mar-2016  500&lt;/p&gt;&#xA;&lt;p&gt;11-Mar-2016  500&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;A sample demonstrating above conditions from a weekly repayment schedule could be as follows for a borrower not completely regular&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Date         Repayment amount&lt;/p&gt;&#xA;&lt;p&gt;1-Feb-2016   500&lt;/p&gt;&#xA;&lt;p&gt;8-Feb-2016   500&lt;/p&gt;&#xA;&lt;p&gt;17-feb-2016   500&lt;/p&gt;&#xA;&lt;p&gt;22-Feb-2016   400&lt;/p&gt;&#xA;&lt;p&gt;07-Mar-2016  1000&lt;/p&gt;&#xA;&lt;p&gt;14-Mar-2016  500&lt;/p&gt;&#xA;&lt;p&gt;11-Mar-2016  500&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This real life problem is related to repayment schedule of low income borrowers where anomalies like above can be considered fair owing to their meager means. The sample above are only small part of the file, not the whole file.&lt;/p&gt;&#xA;&lt;p&gt;I have clarified some doubts at &lt;a href=&quot;https://codegolf.stackexchange.com/questions/71334/determine-if-a-given-loan-repayment-schedule-is-a-weekly-or-a-daily-schedule&quot;&gt;https://codegolf.stackexchange.com/questions/71334/determine-if-a-given-loan-repayment-schedule-is-a-weekly-or-a-daily-schedule&lt;/a&gt; . Check those if possible.&lt;/p&gt;&#xA;" OwnerUserId="49976" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-07T12:39:24.907" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8323" PostTypeId="2" ParentId="202" CreationDate="2016-02-07T16:48:03.533" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;http://vihan.org/p/esfiddle&quot; rel=&quot;nofollow noreferrer&quot;&gt;ESFiddle&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Not to be confused with ES6Fiddle. ESFiddle allows for running ES6 &lt;strong&gt;and&lt;/strong&gt; ES7 &lt;em&gt;experimental features&lt;/em&gt; such as array comprehension and the exponentiation operator which &lt;strong&gt;no other&lt;/strong&gt; transpiler does.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/SJkvo.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/SJkvo.png&quot; alt=&quot;ESFiddle Screenshot&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;ESFiddle also has syntax highlighting, and icons for &lt;code&gt;console.error&lt;/code&gt; and &lt;code&gt;console.warn&lt;/code&gt;. It also supports implicit output. You can even create permalinks to link to in your answers.&lt;/p&gt;&#xA;" OwnerUserId="40695" LastActivityDate="2016-02-07T16:48:03.533" CommentCount="0" CommunityOwnedDate="2016-02-07T16:48:03.533" ContentLicense="CC BY-SA 3.0" />
  <row Id="8325" PostTypeId="1" CreationDate="2016-02-08T00:07:39.740" Score="12" ViewCount="2787" Body="&lt;p&gt;I recently looked at the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; tag and noticed that all 3 of the newest questions are closed as &quot;Too Broad&quot;. From our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8242/the-state-of-the-popularity-contest-tag&quot;&gt;new rules for popularity contests&lt;/a&gt; and the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; tag being off-topic it would seem that underhanded may also be off topic. What is the community opinion on the underhanded tag?&lt;/p&gt;&#xA;" OwnerUserId="42736" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2016-11-21T11:36:16.993" Title="The state of the underhanded tag" Tags="|discussion|challenges|scope|challenge-quality|underhanded|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8326" PostTypeId="2" ParentId="8325" CreationDate="2016-02-08T00:42:26.300" Score="8" Body="&lt;p&gt;Note that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; is not a winning criterion, unlike &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;; it's more like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; in that it's a specification of the content of the challenge. Underhanded challenges can be code golfs or popularity contests or whatever. I don't think the issue is that it's difficult to find a objective winning criteria for them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've actually been meaning to bring this up. I think the real issue with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; is that it's a poorly disguised attempt at keeping &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; around after code trolling challenges became off topic. Underhanded challenges don't provide quality content to the site. In fact, I think they perpetuate others' negative opinions of the type of code we write on this site, and they perpetuate the image that we're a &quot;joke site.&quot; There are only so many times we can have the same challenge of &quot;do X but make it look like you're doing Y, lol sneaky sneaky&quot; anyway.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With that in mind, I'd like to propose that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; be retired in the same way that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; was, with existing challenges being closed as off topic and locked for historical significance, and future challenges of that type being made unwelcome.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-02-08T00:42:26.300" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="8329" PostTypeId="2" ParentId="2140" CreationDate="2016-02-08T12:25:31.267" Score="1" Body="&lt;h1&gt;Prove that this program terminates or run forever&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Introduction:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Halting problem has been shown to have no complete algorithm. Yet it is important to understand what the program does and verifying the program if the program matches with its specification&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenger&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Challenges&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to write program that takes no input in given language (so no obscure language is used) and a formal proof that the program is halting or run forever. Output will be ignored.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Proof must be written formally.&lt;/li&gt;&#xA;&lt;li&gt;No computer aided proof. (i.e. running the program, or convert it into Coq, Idris, or another dependent-typed language)&lt;/li&gt;&#xA;&lt;li&gt;This is not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; challenge, so do not obscure the program.&lt;/li&gt;&#xA;&lt;li&gt;If your program is not cracked after 6 days, then you must give the proof whether your program halts or not. It is then verified.&lt;/li&gt;&#xA;&lt;li&gt;Your program should not depend on unsolved problems.&lt;/li&gt;&#xA;&lt;li&gt;Cracking your own submission is not allowed.&lt;/li&gt;&#xA;&lt;li&gt;Score for submission:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Cracked  : -5&lt;/li&gt;&#xA;&lt;li&gt;Verified : 10&lt;/li&gt;&#xA;&lt;li&gt;Flawed   : -15&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Prover&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Challenges&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to proof that the program that is posted in Challenger thread is halting or run forever.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Proof must be written formally.&lt;/li&gt;&#xA;&lt;li&gt;No computer aided proof. (i.e. running the program, or convert it into Coq, Idris, or another dependent-typed language)&lt;/li&gt;&#xA;&lt;li&gt;Score for submission:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Verified (With no proof from owner)     : 8&lt;/li&gt;&#xA;&lt;li&gt;Verified (With flawed proof from owner) : 12&lt;/li&gt;&#xA;&lt;li&gt;Flawed                                  : -8&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Sandbox Question&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;What language should I use? The requirement is:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Turing Complete&lt;/li&gt;&#xA;&lt;li&gt;Imperative&lt;/li&gt;&#xA;&lt;li&gt;Easy to understand, even to noncoder&lt;/li&gt;&#xA;&lt;li&gt;Easy to write&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Also, I need help with the leaderboard&lt;/p&gt;&#xA;" OwnerUserId="46245" LastEditorUserId="46245" LastEditDate="2016-02-09T13:19:44.007" LastActivityDate="2016-02-09T13:19:44.007" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8331" PostTypeId="2" ParentId="202" CreationDate="2016-02-08T14:17:12.300" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://stedolan.github.io/jq/&quot; rel=&quot;nofollow noreferrer&quot;&gt;jq&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://jqplay.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://jqplay.org&lt;/a&gt; ­– Not written by the language's developer himself, but the official &lt;a href=&quot;https://stedolan.github.io/jq/manual/&quot; rel=&quot;nofollow noreferrer&quot;&gt;jq Manual&lt;/a&gt; also uses it to run its examples.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;jq play is more an interactive playground, so the checkboxes to emulate the command line switches not seem to be settable through GET parameters, like the &lt;strong&gt;Filter&lt;/strong&gt; (&lt;code&gt;q&lt;/code&gt; parameter) and &lt;strong&gt;JSON&lt;/strong&gt; (&lt;code&gt;j&lt;/code&gt; parameter) inputs can be.&lt;/s&gt; (They fixed it. Now it can generate a permalink with the complete setup.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://jqterm.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://jqterm.com/&lt;/a&gt; – “an alternative interactive jq web terminal with autocomplete (and faster querying with large datasets as they're cached online in private gists).” (According to &lt;a href=&quot;https://remysharp.com/drafts/jq-recipes&quot; rel=&quot;nofollow noreferrer&quot;&gt;jq recipes&lt;/a&gt;).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="4198" LastEditorUserId="4198" LastEditDate="2019-08-09T12:20:08.673" LastActivityDate="2019-08-09T12:20:08.673" CommentCount="0" CommunityOwnedDate="2016-02-08T14:17:12.300" ContentLicense="CC BY-SA 4.0" />
  <row Id="8339" PostTypeId="2" ParentId="8242" CreationDate="2016-02-09T17:05:17.527" Score="-2" Body="&lt;h2&gt;Retire it&lt;/h2&gt;&#xA;&lt;p&gt;The core problem that I see with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; is that it requires the challenge author to dictate how users should vote. This is anathema to the SE model of voting: anonymous votes which users can decide how they want to use. While there are &lt;a href=&quot;https://meta.stackexchange.com/questions/130046/when-should-i-vote&quot;&gt;guidelines on when to vote&lt;/a&gt;, they are just guidelines. One user controlling how others vote is not how SE is meant to work.&lt;/p&gt;&#xA;&lt;p&gt;There is no compromise possible here. To embrace the SE model, users must be free to vote how they please (with the obvious exceptions of serial voting and sockpuppeting). Popcons break this rule, so they have to go. While they might work on other sites, they simply don't work on SE.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-09T17:05:17.527" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8343" PostTypeId="2" ParentId="2140" CreationDate="2016-02-09T20:13:43.103" Score="0" Body="&lt;h1&gt;How clean is my snow? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;Idea shamelessly take from &lt;a href=&quot;https://codereview.stackexchange.com/questions/118538/how-clean-is-my-snow#comment221029_118538&quot;&gt;https://codereview.stackexchange.com/questions/118538/how-clean-is-my-snow#comment221029_118538&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/NmOdD.png&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to tell how clean my snow is. Unclean snow is any snow that is not pure white. This would be super easy except for one hiccup, not all of the image is a picture of the snow, in the case of the image above some of the image is the sky (can't you tell? I'm such a good artist!).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Determining where the background is&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;[Write-up coming, it has to do with how large the splotch is and finding the biggest  white spot, so the clouds don't count]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/y31aL.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/y31aL.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="42736" LastEditorUserId="-1" LastEditDate="2017-04-13T12:41:04.080" LastActivityDate="2016-02-09T20:13:43.103" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8344" PostTypeId="2" ParentId="2140" CreationDate="2016-02-09T20:14:41.333" Score="8" Body="&lt;h1&gt;Array Pattern Matching Language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-design&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-design&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-design&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Everyone is (or should be) acquainted with the ways of the regular expression. At its core, a regex is made for matching strings. However, it's just matching something, right? Why not match &lt;em&gt;arrays&lt;/em&gt;? That would be something!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Description&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task now is to design and implement a &lt;em&gt;new&lt;/em&gt; &lt;strong&gt;numeric&lt;/strong&gt; array pattern-matching language. The only requirement is that your created language satisfies the mandatory tasks detailed below. However, this being a popularity contest, you may wish to opt for the bonus tasks and maybe even some competitive golfing value.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To be more precise, your language should be able to take &lt;strong&gt;patterns&lt;/strong&gt; and match them against arbitrary arrays of integers. They should minimally be used to determine whether or not an array matches the pattern. This can be done by return a boolean, two different strings, etc.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Voting&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As a voter, you should keep in mind the criteria mentioned, and ask yourselves these questions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Is the language trivial? That is, is there a lot that can be done other than the detailed tasks, or is the language minimally designed for these tasks?&lt;/li&gt;&#xA;&lt;li&gt;Is it well described? Does the author explain the solutions and the concept behind the language?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Tasks&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(Thanks to Nathan Merrill for a lot of tasks!)&lt;/em&gt; Note that, for each task, the empty array can go in either category, unless otherwise stated.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;1. That's odd!&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write a program in your language that will match the input array if all of its members are odd; otherwise, do not match.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;MATCH&#xA; [1, 3, 5, 11, -1]&#xA; [5, 9, 1023, 3243]&#xA;&#xA;NOT MATCH&#xA; [2, 1, 3, 4]&#xA; [0, 5, 6, 0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;2. Increasing in membership&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Match an array that has each member more than the previous member.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;MATCH&#xA; [0,1,2,3]&#xA; [2,5,100,203123]&#xA; [-432,-421,123,322]&#xA;&#xA;NOT MATCH&#xA; [0,0,1,2]&#xA; [-2,3,-3]&#xA; [1,3,2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;3. Bodyguards&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Match only arrays with a &lt;code&gt;0&lt;/code&gt; on both sides.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;MATCH&#xA; [0, 1, 2, 0]&#xA; [0, 5, 0]&#xA; [0, 0]&#xA; [0]&#xA;&#xA;NOT MATCH&#xA; [1, 2, 3]&#xA; [4, 5]&#xA; [99]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;4. Mountain&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Match all arrays of the form &lt;code&gt;[1, 2, 3, ..., N-2, N-1, N, N-1, N-2, ..., 3, 2, 1]&lt;/code&gt;, for any &lt;code&gt;N&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;MATCH&#xA; [1, 2, 3, 4, 5, 6, 5, 4, 3, 2, 1]&#xA; [1, 2, 3, 4, 3, 2, 1]&#xA; [1, 2, 1]&#xA; [1]&#xA;&#xA;NOT MATCH&#xA; [1, 2, 4, 8, 4, 2, 1]&#xA; [3, 4, 5, 4, 3]&#xA; [3, 2, 1, 2, 3]&#xA; [2, 1, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;5. Shifting, 1 to 5&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Match only arrays that consist of the numbers &lt;code&gt;1, 2, 3, 4, 5, 4, 3, 2&lt;/code&gt; &quot;in order&quot;, where the elements can be rotated around the array.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;MATCH&#xA; [1, 2, 3, 4, 5, 4, 3, 2]&#xA; [2, 3, 4, 5, 4, 3, 2, 1]&#xA; [5, 4, 3, 2, 1, 2, 3, 4]&#xA;&#xA;NOT MATCH&#xA; [1, 2, 3, 4, 5, 3, 2, 4]&#xA; [2, 3, 4, 5, 2, 3, 4, 1]&#xA; [1, 2, 3, 4, 5, 2, 3, 4]&#xA; [1, 2, 3]&#xA; [2]&#xA; []&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;6. Not in my prime&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Match an array if and only if all of it's members are &lt;em&gt;not&lt;/em&gt; prime.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;MATCH&#xA; [4, 6, 8, 9, 24]&#xA; [20, 40, 42, 45]&#xA; [1, 10, 100]&#xA; []&#xA;&#xA;NOT MATCH&#xA; [1, 100, 200, 300, 400, 401]&#xA; [2, 3, 4]&#xA; [2, 4, 8]&#xA; [3, 5, 7]&#xA; [2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;7. Unique&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Match only arrays that contain no duplicates.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;MATCH&#xA; [1, 2, 3, 4]&#xA; [5, 15, 25]&#xA; [21]&#xA; []&#xA;&#xA;NOT MATCH&#xA; [3, 4, 5, 3]&#xA; [10, 11, 10, 13]&#xA; [2, 2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;8. Not close&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Match only arrays that, for each member &lt;code&gt;N&lt;/code&gt;, do not also have a member &lt;code&gt;N+1&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;MATCH&#xA; [1, 3, 45, 30]&#xA; [20, 23, 26]&#xA; []&#xA;&#xA;NOT MATCH&#xA; [200, 201, 202]&#xA; [3, 9, 100, 4]&#xA; [2, 4, 5]&#xA; [0, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;9. Arithmetic Progression&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Match only arrays that are arithmetic progressions; i.e. there elements increase by a constant factor. (Singletons may go either way.)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;MATCH&#xA; [2, 6, 10, 14]&#xA; [5, 10, 15, 20]&#xA; [20, 19, 18]&#xA; [1, 2, 3]&#xA; [5, 6, 7, 8]&#xA;&#xA;NOT MATCH&#xA; [5, 25, 125]&#xA; [2, 6, 5]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;10. Fibonacci-esque&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Match only arrays (of length greater than 2) where each element is the sum of the previous two (not counting the first 2), and match all arrays of length 2.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;MATCH&#xA; [100, 1, 101, 102, 203, 305, 508, 813]&#xA; [-5, 5, 0, 5, 5, 10, 15, 25, 40]&#xA; [2, 1, 3, 4, 7, 11]&#xA; [0, 0, 0, 0, 0, 0]&#xA; [1, 0, 1, 1, 2]&#xA; [1, 2, 3, 5]&#xA; [10, 2]&#xA;&#xA;NOT MATCH&#xA; [5, 10, 15, 20, 25]&#xA; [91, 32, 32]&#xA; [5, 5, 5]&#xA; [2]&#xA; []&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;11. Self-descriptive&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Match arrays that contain their lengths.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;MATCH&#xA; [1]&#xA; [12, 2]&#xA; [4, 3, 2]&#xA;&#xA;NOT MATCH&#xA; [0]&#xA; []&#xA; [123, 122, 121]&#xA; [0, 2, 4, 6, 8]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;12. Palindrome&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Match all palindromic arrays. That is, arrays that are the same when reversed.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;MATCH&#xA; [1]&#xA; []&#xA; [2, 3, 4, 3, 2]&#xA; [-1, -1]&#xA;&#xA;NOT MATCH&#xA; [3, 4, 2, 0]&#xA; [0, 0, 0, 1]&#xA; [1, 11]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;13. Kth element at most K&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;(You can use 1-based or 0-based indexing. I will give test cases for 0-based indexing.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Match all arrays whose Kth element is at most K.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;MATCH&#xA; [0, 0, 2]&#xA; [0, 0, 0, 1]&#xA; [-4, -1, 0]&#xA;&#xA;NOT MATCH&#xA; [2, 42]&#xA; [-4, -92, 4]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;14. Twins&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Match all arrays of even length whose first half is equal to the second half.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;MATCH&#xA; [1, 2, 3, 1, 2, 3]&#xA; [4, 4]&#xA; [0, 0, 0, 0]&#xA;&#xA;NOT MATCH&#xA; [4, 9, 9, 4]&#xA; [9, 2, 13, 2, 9]&#xA; [1, 2, 3, 1, 2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;15. A simplified date&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Match all 3-element arrays which constitute a valid date. The array will be &lt;code&gt;[year, month, day]&lt;/code&gt;. That is, &lt;code&gt;year &amp;gt;= 0&lt;/code&gt;, &lt;code&gt;1 &amp;lt;= month &amp;lt;= 12&lt;/code&gt;, and &lt;code&gt;1 &amp;lt;= day &amp;lt;= 31&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;MATCH&#xA; [2018, 6, 16]&#xA; [1990, 1, 1]&#xA; [0, 6, 31]&#xA; [3014, 7, 13]&#xA; [1293, 9, 9]&#xA; [12, 12, 12]&#xA;&#xA;NOT MATCH&#xA; [-4, 12, 9]&#xA; [100, 100, 4]&#xA; [1929, 13, 31]&#xA; [4102, 12, 32]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="31957" LastEditDate="2018-06-16T20:24:33.423" LastActivityDate="2018-06-16T20:24:33.423" CommentCount="19" ContentLicense="CC BY-SA 4.0" />
  <row Id="8345" PostTypeId="1" CreationDate="2016-02-09T20:35:20.127" Score="15" ViewCount="258" Body="&lt;p&gt;We have lots of challenges tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;. What types of sequences make for interesting golf challenges? How can we assess whether a given sequence is worth writing a challenge about? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I understand that we need both easy and difficult challenges (for people with different ability levels in their chosen language(s), and for people with different amounts of free time), so this won't just be about that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What factors are there to take into consideration when writing a sequence golf challenge?&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2016-02-09T23:50:10.743" Title="What makes a sequence an interesting golf challenge?" Tags="|discussion|asking-questions|" AnswerCount="3" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8346" PostTypeId="2" ParentId="8345" CreationDate="2016-02-09T20:49:52.730" Score="14" Body="&lt;h1&gt;Number of approaches&lt;/h1&gt;&#xA;&lt;p&gt;I often see that questions which have multiple ways of being solved are more interesting than challenges which have only &lt;em&gt;one exact way&lt;/em&gt; to approach the problem. If that's the case, it is just a contest of who has the best built-ins. When there are multiple approaches, it's also quite a puzzle of finding out which approach is better for your submission.&lt;/p&gt;&#xA;" OwnerUserId="34388" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-09T23:50:10.743" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8347" PostTypeId="2" ParentId="8345" CreationDate="2016-02-09T20:53:01.693" Score="11" Body="&lt;h2&gt;Make sure there's no trivial closed form solution&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is probably a corollary of Adnan's answer, but even with sequences that have many definitions and approaches there is often a simple closed form solution that a) completely sidesteps the interesting background of a sequence and b) is the only viable golfing option. Always try to make sure that closed form solutions are either hard to come up with or sufficiently complicated that they don't dominate the challenge (e.g. by checking the Formula section on OEIS).&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-02-09T20:53:01.693" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8349" PostTypeId="2" ParentId="8345" CreationDate="2016-02-09T21:10:51.020" Score="8" Body="&lt;h1&gt;Simple to understand, but not trivial&lt;/h1&gt;&#xA;&lt;p&gt;This probably applies to all challenges. I found this out after posting some &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;-challenges, but the easier it is to understand the challenge, the more interested people are. If you come up with a very difficult challenge which require a &lt;em&gt;lot&lt;/em&gt; of mathematical knowledge, people are less likely to submit an answer.&lt;/p&gt;&#xA;&lt;p&gt;Also important, &lt;strong&gt;don't make it too easy&lt;/strong&gt;. Trivial challenges are not encouraged to be posted, and would probably lead to 3-byte answers, etc.&lt;/p&gt;&#xA;" OwnerUserId="34388" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-09T21:10:51.020" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8350" PostTypeId="1" CreationDate="2016-02-09T22:09:22.540" Score="89" ViewCount="4665" Body="&lt;p&gt;It has come up several times recently (more than usual) that PPCG differs from most of the other Stack Exchange sites in that it's not a Q&amp;amp;A site. People don't come here to ask a question because they have a problem, people come here to solve recreational challenges. The most valuable contribution to this site isn't people using their free time to solve others' problems, but using their free time to think up interesting challenges for the enjoyment of others. This entire post rests on the premise that we are &lt;em&gt;not&lt;/em&gt; by any definition a Q&amp;amp;A site. If you want to contest that, please start a separate meta post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So the actual problem is that the entire site (and more importantly the onboarding experience for new users who don't look past all the standard texts and don't know about PPCG's &quot;special&quot; role in the SE network) is saying &quot;this is a Q&amp;amp;A site, get help here if you have a problem and show what you've tried&quot;. I think that's why the &quot;beta&quot; label is more appropriate here than on any other ungraduated site. And &lt;a href=&quot;https://meta.stackexchange.com/questions/274340/why-code-golf-programming-puzzles-is-still-in-beta#comment891571_274343&quot;&gt;given recent developments&lt;/a&gt; maybe it's time we actually &lt;em&gt;talked&lt;/em&gt; about where those discrepancies are to see if something could be done about them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, every time someone brings up the &quot;we're not a Q&amp;amp;A site discussion&quot; that is always accompanied with &quot;but SE isn't going to pour any dev hours into custom code for PPCG, so tough luck&quot;. And while it's probably true that we won't get large amounts of customisation unless this community becomes a seriously big player, there are some simple things like changing some standard texts that might not be much effort and would already greatly help improve the overall experience here. Plus, SE most definitely isn't going to spend any time on features that were never requested because we thought they wouldn't ever implement them anyway.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So the idea of this post is to discuss how the site could be improved for the way PPCG as a community uses it, and in terms of how we're not a Q&amp;amp;A site. The idea is to do this in the form of potential feature requests. &lt;strong&gt;Each answer should be one suggestion for an improvement to the site.&lt;/strong&gt; These can be discussed in the comments and if they get some support they can get their own &lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt; which can then be linked from here. By doing this &quot;staging process&quot; for feature requests relating to the Q&amp;amp;A issue, I hope that this post can act as a hub for them and we can post them in a more organised/coordinated fashion that increases the chances of us getting any of these things at some point in the future.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that this isn't about sorting out the gritty details of every single potential feature request like specific phrases and things like that. Those can be discussed when a corresponding feature request is posted later on. This is about suggesting which parts of the site could be improved (and roughly how), as a community brainstorming session, so we can see how they might work together and focus on pushing for the feature requests that seem most promising and urgent.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please do not repost things that have already been asked about on meta. Existing feature requests related to the Q&amp;amp;A issue include:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7683/8478&quot;&gt;Increase reputation awarded for questions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1987/8478&quot;&gt;Could PPCG benefit from a new sorting mode for answers?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2330/8478&quot;&gt;Could self-answered questions be &amp;quot;unanswered&amp;quot;?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7041/8478&quot;&gt;Should we increase our post character limit to allow substantial stack snippets?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7070/8478&quot;&gt;Let&amp;#39;s customise the &amp;quot;How to Answer&amp;quot; pop-up&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8118/&quot;&gt;Count question score toward tag badges&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2018-05-14T07:37:47.083" Title="We're not a Q&amp;A site. But what should be done about it?" Tags="|discussion|site-health|" AnswerCount="35" CommentCount="23" ContentLicense="CC BY-SA 3.0" />
  <row Id="8351" PostTypeId="2" ParentId="8350" CreationDate="2016-02-09T22:14:38.423" Score="87" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8441/8478&quot;&gt;Can we get a custom Tour page?&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The most important part of the onboarding experience for new users (especially those who don't arrive via other sites from the network) is the tour page. Moderators can customise the first paragraph, but in the case of PPCG this is hardly enough, because the rest of the page is strongly misleading:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Ask questions, get answers, no distractions&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Get answers to practical, detailed questions&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Focus on questions about an actual problem you have faced. Include details about what you have tried and exactly what you are trying to do.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Ask about...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It would be great if a) those misleading bits could be removed and ideally b) replaced with some important information that applies here instead. The usual process for new users on a Q&amp;amp;A site is that they join the site to ask a question and then start answer others as well when they feel confident about it. Around here, we prefer users to start with solving challenges so they can get a feeling for how challenges work around here before writing their own. (Yes, CH, you are an exception to that...)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2016-02-15T18:04:43.603" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8354" PostTypeId="2" ParentId="8350" CreationDate="2016-02-09T22:34:57.550" Score="53" Body="&lt;h2&gt;Fixing the Help Centre&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This has the same problems as the tour page. On one hand it's not &lt;em&gt;quite&lt;/em&gt; as urgent because it's not as prominent as the tour page, on the other hand the problem exists on a much bigger scale here. I have a 2-3 page list of things that could use changing. Some of them don't apply to PPCG at all and are actively misleading. Others could just use some additional usage guidance specific to PPCG (e.g. that all challenges need a challenge-type tag; that edits should not be used to improve the score of an answer; etc.). I'll include the full list if this is turned into a feature request, but some of the more obvious bits:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;While we can edit the &quot;What topics can I ask about here?&quot; page, the title itself is already misleading.&lt;/li&gt;&#xA;&lt;li&gt;The opposite page &lt;a href=&quot;https://codegolf.stackexchange.com/help/dont-ask&quot;&gt;https://codegolf.stackexchange.com/help/dont-ask&lt;/a&gt; cannot be edited and its content is completely aimed at Q&amp;amp;A sites (understandably).&lt;/li&gt;&#xA;&lt;li&gt;Same with &lt;a href=&quot;https://codegolf.stackexchange.com/help/how-to-ask&quot;&gt;https://codegolf.stackexchange.com/help/how-to-ask&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The privileges explain various features in terms of how they are used for the purpose of Q&amp;amp;A.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/product-support&quot;&gt;https://codegolf.stackexchange.com/help/product-support&lt;/a&gt; ummm...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-02-09T22:34:57.550" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8355" PostTypeId="2" ParentId="8350" CreationDate="2016-02-09T22:41:06.527" Score="61" Body="&lt;h2&gt;s/question/challenge/g&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is pretty big and this might actually be a lot of effort on SE's part, but I think the overall impression of this being a Q&amp;amp;A site would be greatly reduced if the site didn't use the word &quot;question&quot; everywhere.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With a few exceptions, all &quot;questions&quot; on PPCG are &quot;challenges&quot;. To post a new challenge you need to click on the &quot;ask question&quot; button. There are help centre pages about &quot;how to ask questions&quot;. And you can get a list of &quot;unanswered questions&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Changing a single word across the site might seem like a trivial change for so much effort, but I think the effect on the user experience would be quite amazing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(That said, I realise that the biggest problem isn't even the amount of places that need changing, but that the word &quot;question&quot; is actually tied pretty strongly to the software, e.g. search queries use &lt;code&gt;is:question&lt;/code&gt; and &lt;code&gt;inquestion:???&lt;/code&gt;, URLs use &lt;code&gt;question&lt;/code&gt; or &lt;code&gt;q&lt;/code&gt;, etc. This is probably a utopic idea but I wanted to put it out there.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="46231" LastEditDate="2016-02-27T00:26:37.860" LastActivityDate="2016-02-27T00:26:37.860" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8356" PostTypeId="2" ParentId="8350" CreationDate="2016-02-09T22:47:21.600" Score="45" Body="&lt;h2&gt;Better Close Reasons&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This has now become its &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11447/how-could-the-default-close-reasons-be-improved&quot;&gt;own separate feature request&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Mods can edit a few slots of custom off-topic reasons. However, the majority of close vote reasons are fixed and cannot be changed by us. While the &lt;em&gt;names&lt;/em&gt; of the reasons largely make sense here, their descriptions don't:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Duplicate: &quot;This question already has an answer here:&quot;, &quot;This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.&quot;&lt;/li&gt;&#xA;&lt;li&gt;Unclear: &quot;Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question.&quot;&lt;/li&gt;&#xA;&lt;li&gt;Too broad: &quot;There are either too many possible answers, or good answers would be too long for this format. Please add details to narrow the answer set or to isolate an issue that can be answered in a few paragraphs.&quot;&lt;/li&gt;&#xA;&lt;li&gt;Primarily opinion based: &quot;Many good questions generate some degree of opinion based on expert experience, but answers to this question will tend to be almost entirely based on opinions, rather than facts, references, or specific expertise.&quot; (This one in particular I don't think we need at all, because we've got that covered with lack of objective winning criterion.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The notice boxes and tooltips on questions that &lt;em&gt;are&lt;/em&gt; closed have similar problems. We also might want to think about whether there's a custom close reason that doesn't really fit under the &quot;off-topic&quot; banner.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2017-02-17T18:40:50.743" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8357" PostTypeId="2" ParentId="8350" CreationDate="2016-02-09T22:58:06.670" Score="32" Body="&lt;h2&gt;Better Bounty Reasons&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This has now become its &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11448/how-could-the-bounty-reasons-be-improved?cb=1&quot;&gt;own separate feature request&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;When starting a bounty, people here almost always use either &quot;reward an existing answer&quot; or &quot;draw attention&quot;, occasionally &quot;improve details&quot;. That's because none of the others make any sense here (and the descriptions of these could also be improved):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&quot;&lt;strong&gt;Authoritative reference needed&lt;/strong&gt; Looking for an answer drawing from credible and/or official sources.&quot; This is simply not a thing here.&lt;/li&gt;&#xA;&lt;li&gt;&quot;&lt;strong&gt;Canonical answer required&lt;/strong&gt; The question is widely applicable to a large audience. A detailed canonical answer is required to address all the concerns.&quot;  For challenges this doesn't make any sense either. It &lt;em&gt;might&lt;/em&gt; be useful for the odd question about golfing tips, but that can probably be covered with &quot;improve details&quot;.&lt;/li&gt;&#xA;&lt;li&gt;&quot;&lt;strong&gt;Current answers are outdated&lt;/strong&gt; The current answer(s) are out-of-date and require revision given recent changes.&quot; Not a thing here - with our current rules, new languages/features aren't even allowed to be used.&lt;/li&gt;&#xA;&lt;li&gt;&quot;&lt;strong&gt;Draw attention&lt;/strong&gt; This question has not received enough attention.&quot; Yep, this works. (Although &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8355/8478&quot;&gt;I'd rather read &quot;challenge&quot; in that sentence&lt;/a&gt;.)&lt;/li&gt;&#xA;&lt;li&gt;&quot;&lt;strong&gt;Improve details&lt;/strong&gt; The current answers do not contain enough detail.&quot; The idea of this works in a broad sense, but we're not really looking for &quot;detail&quot; in answers here. Maybe this could be reworked into a bounty reason to improve the score (overall winner, or language-specific solutions).&lt;/li&gt;&#xA;&lt;li&gt;&quot;&lt;strong&gt;Reward existing answer&lt;/strong&gt; One or more of the answers is exemplary and worthy of an additional bounty.&quot; This works verbatim. :)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;We could also think about whether we could use other bounty reasons here. E.g. bounties are often offered for bonus/side challenges. Maybe we could get a specific bounty reason for that?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a slightly more elaborate feature request (which will probably go in a separate post eventually), it might be good to have software support for our &quot;bounties without deadlines&quot;.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2017-02-17T18:39:54.507" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8358" PostTypeId="2" ParentId="8350" CreationDate="2016-02-09T23:08:41.410" Score="71" Body="&lt;h2&gt;Built-in support for scores and leaderboards&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The vast majority of PPCG challenges involve minimizing or maximizing the score of a solution, usually the byte count of a program.&#xA;As it currently stands, users are encouraged to start their answer with a header of the form&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;## Language, N bytes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;These headers have no special meaning to the SE platform, and an often-requested feature is the ability to sort answers by their score.&#xA;We have developed a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5139/leaderboard-snippet&quot;&gt;leaderboard Stack Snippet&lt;/a&gt; that parses these headers and prints a pretty leaderboard, listing the overall ranking and winners by language.&#xA;This works, but is not optimal, since new users may be unaware of the required header format, and only a fraction of our challenges actually include the snippet (it has to be copy-pasted from the Meta page, and the &lt;code&gt;QUESTION_ID&lt;/code&gt; variable needs to be reset &lt;em&gt;after&lt;/em&gt; the question is posted).&#xA;Another workaround is given by a &lt;a href=&quot;https://github.com/vihanb/PPCG-Design&quot; rel=&quot;nofollow noreferrer&quot;&gt;userscript&lt;/a&gt; (thanks @ETHProductions for mentioning it), but new users, unregistered visitors and those who can't install browser additions will not benefit from it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What would be great is some built-in support for attaching scores, language names and/or other metadata to answers (some of which could be disabled for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions and unconventional challenges), and the ability to sort and/or filter answers based on the metadata.&#xA;This would probably take much more effort to implement than most of the other requests here, and the snippet and userscript do provide workarounds, so it's by no means a critical feature.&lt;/p&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2016-02-10T01:15:29.657" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8361" PostTypeId="2" ParentId="8350" CreationDate="2016-02-10T01:00:53.110" Score="29" Body="&lt;h2&gt;Modify the placeholder search bar text&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you look at the top right corner of the page, you'll see a search box with the placeholder text &quot;Search Q&amp;amp;A.&quot; Even outside of the context of deemphasizing the Q&amp;amp;A terminology on our site, I think this could be better phrased as &quot;Search the site&quot; or similar. So while we're requesting that Q&amp;amp;A-specific text be changed, we might as well request this as well.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-02-10T01:00:53.110" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8362" PostTypeId="2" ParentId="8350" CreationDate="2016-02-10T07:53:06.363" Score="34" Body="&lt;h2&gt;Vote button tooltips&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Whenever someone asks why their challenge or answer was downvoted (or whether they should up- or downvote some other post), the best response is often &quot;well, what does the tooltip say&quot;, since on other SEs it sums up reasons for voting pretty well. They don't really work here though:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The question upvote says: &quot;This question shows research effort; it is useful and clear.&quot; Apart from &quot;clear&quot; these aren't necessarily qualities we're looking for in a challenge. &quot;Interesting&quot; and &quot;well-specified&quot; are a lot more relevant. Correspondingly, the downvote tooltip is: &quot;This question does not show any research effort; it is unclear or not useful.&quot;&lt;/li&gt;&#xA;&lt;li&gt;The answer upvote says: &quot;This answer is useful.&quot; Not at all what we're looking for. We tend to upvote answers that are interesting, clever, show effort or are educational (but not in the same sense that an answer on a Q&amp;amp;A site is educational - this part is pretty much entirely optional here and usually goes beyond what the challenge actually requires). (And of course, the corresponding downvote tooltip is &quot;This answer is not useful.&quot;)&lt;/li&gt;&#xA;&lt;li&gt;Accept button: &quot;Click to accept this answer because it solved your problem or was the most helpful in finding your solution.&quot; I didn't have a problem to begin with and I didn't need help with finding a solution. Something like &quot;because it solves the challenge and achieved the best overall score&quot; would make a lot more sense.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-02-10T07:53:06.363" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8363" PostTypeId="2" ParentId="8350" CreationDate="2016-02-10T08:07:36.533" Score="46" Body="&lt;h1&gt;Remove the Accept feature&lt;/h1&gt;&#xA;&lt;p&gt;This feature is likely way too integral to how SE instances work for this to be possible without forking the software, but I don't think the concept of accepted answers is useful on PPCG.&lt;/p&gt;&#xA;&lt;p&gt;The most fundamental pillar of this community is that every single question needs an objective winning criterion. That means there's really no reason to give a human the ability to choose a best answer, because the only thing that can really happen is that a) the author chooses the wrong answer or b) at some point the accepted answer will be outdated. The only real benefit is that the best-scoring answer can easily be found, but &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8358/8478&quot;&gt;built-in support for scores&lt;/a&gt; would make this obsolete, too. Additionally, the best-scoring answer isn't necessarily the most interesting (e.g. because some language had a built-in for the challenge), so pinning it above longer but cleverer (and higher-voted) answers isn't very beneficial here either.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, people regularly emphasise to users who are discouraged by golfing languages that they should view challenges as separate competitions within each language. While the green checkmark is only worth 15 rep, it still seems to matter quite a lot to people and is counterproductive to giving the impression that the overall winner doesn't matter as much.&lt;/p&gt;&#xA;&lt;p&gt;(Side note: a few badges would have to go with that. Scholar, Enlightened, Guru, Populist, Tenacious and Unsung Hero all depend on an answer being accepted.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-09T16:36:22.110" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="8364" PostTypeId="2" ParentId="8350" CreationDate="2016-02-10T09:17:58.257" Score="48" Body="&lt;h2&gt;Modify the trigger for low quality posts&lt;/h2&gt;&#xA;&lt;p&gt;Occasionally, very short answers to code-golf competitions written without explanations will end up in the low quality posts queue on the ground that they are too short and are mostly composed of a code block (I just reviewed &lt;a href=&quot;https://codegolf.stackexchange.com/review/low-quality-posts/27641&quot;&gt;one&lt;/a&gt;, minutes ago). Sure adding an explanation would make a post of higher quality but no explanation does not necessarily means low quality either. Longer answers that are still composed of only a code block without explanations will not trigger this, which put us in an absurd situation where a longer answer to a code-golf competition is considered of higher quality than a shorter one. In the context of a Q&amp;amp;A this trigger makes sense but in the context of a competition linked to the length of the answer it obviously does not.&lt;/p&gt;&#xA;" OwnerUserId="6741" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-11T09:10:28.180" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="8365" PostTypeId="2" ParentId="2140" CreationDate="2016-02-10T11:22:21.473" Score="-4" Body="&lt;p&gt;Here is my first attempt at a cops and robbers post (which is why I'm using the sandbox).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Cops - Golfed recursion&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You must select a language that satisfies the following criteria:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Functions&lt;/strong&gt; - It must be possible to create a function with any number of integer input values and a single integer output (or return) value. The function may also be a complete program in itself. (Your language may not call it a function, but that is ok)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Arithmetic operations&lt;/strong&gt; - The integer operations &lt;code&gt;+-*/%&lt;/code&gt; should all be possible, either in a simple or a complicated manner.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Data&lt;/strong&gt; - You should be able to store one-byte or two-byte long integers (either signed or unsigned will do). You may do this also in an indirect manner.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Iteration&lt;/strong&gt; - You must be able to create a loop that will keep running until a condition is satisfied. Therefore &lt;code&gt;&amp;lt; &amp;gt; = &amp;lt;= &amp;gt;= ! &amp;amp; |&lt;/code&gt; should also be supported, either directly or indirectly.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Recursion&lt;/strong&gt; - You should be able to call a function from within the function itself with a set of input values calculated by the main function.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Declaration&lt;/strong&gt; - You should be able to declare new integer variables as needed from within the function.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You need to create a recursive function. Code will be scored by the number of characters in it, the shorter the better. A solved code cannot win the challenge. A post with less than 5 up-votes cannot win the challenge. There will be no overall winner, but a separate winner for each language.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Robbers - Golfed recursion&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your objective is to pick up a cop's post, and write a function in the same language but it should not use any recursion (can use iteration). The function may create any number of variables, loops, etc. but should be able to achieve the exact same end result (atleast, in theory) as the cop's one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your score will be the same as the cop's post's score at the time it was solved. His/her post is now invalid, and you get his/her score&lt;/p&gt;&#xA;" OwnerUserId="40929" LastActivityDate="2016-02-10T11:22:21.473" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8367" PostTypeId="2" ParentId="2140" CreationDate="2016-02-10T20:43:05.920" Score="1" Body="&lt;h1&gt;Continue the sequence&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As we all know, there are a lot of integer sequences in the world. What if we could create one program to figure out the next few items in any given sequence? That would be pretty cool, right? Well, I'm pretty sure we can't create a program that does &lt;em&gt;every&lt;/em&gt; sequence, but we can at least do most of the simple ones.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to create a program or function that takes in 5 integers in any reasonable format (array, string, separate arguments, etc.), and returns/outputs the next 5 integers in the sequence. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your submission must be deterministic; that is, the output should be the same every time for the same input.&lt;/li&gt;&#xA;&lt;li&gt;You may not use a built-in for determining the next items. (&lt;em&gt;cough&lt;/em&gt; Mathematica &lt;em&gt;cough&lt;/em&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To score a submission:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Take the value of each single output integer minus the expected output.&lt;/li&gt;&#xA;&lt;li&gt;Take the square root of the absolute value of each of these.&lt;/li&gt;&#xA;&lt;li&gt;Take the average of the result and add one.&lt;/li&gt;&#xA;&lt;li&gt;Multiply your byte count by this number.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;For example, if the only test case were &lt;code&gt;1,2,3,4,5 =&amp;gt; 6,7,8,9,10&lt;/code&gt;, and your 15-byte submission outputs &lt;code&gt;6,7,8,10,6&lt;/code&gt;, your score would be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1,2. abs(6 - 6) = 0, sqrt(0) = 0&#xA;     abs(7 - 7) = 0, sqrt(0) = 0&#xA;     abs(8 - 8) = 0, sqrt(0) = 0&#xA;     abs(10 - 9) = 1, sqrt(1) = 1&#xA;     abs(7 - 10) = 4, sqrt(4) = 2&#xA;3.   0 + 0 + 0 + 1 + 2 = 3&#xA;     3 / 5 = 0.6; 0.6 + 1 = 1.6&#xA;4.   15 bytes * 1.6 = 24&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Thus, your score would be &lt;strong&gt;24&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Lowest score wins.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2,2,2,2,2 =&amp;gt; 2,2,2,2,2&#xA;1,2,3,4,5 =&amp;gt; 6,7,8,9,10&#xA;109,117,125,133,141 =&amp;gt; 149,157,165,173,181&#xA;1,2,4,8,16 =&amp;gt; 32,64,128,256,512&#xA;1,10,100,1000,10000 =&amp;gt; 100000,1000000,10000000,100000000,1000000000&#xA;1,2,3,5,8 =&amp;gt; 13,21,34,55,89&#xA;2,1,3,4,7 =&amp;gt; 11,18,29,47,76&#xA;1,3,6,10,15 =&amp;gt; 21,28,36,45,55&#xA;1,4,9,16,25 =&amp;gt; 36,49,64,81,100&#xA;8,7,6,5,4 =&amp;gt; 3,2,1,0,-1&#xA;1,0,1,0,1 =&amp;gt; 0,1,0,1,0&#xA;1,2,3,2,1 =&amp;gt; 2,3,2,1,2&#xA;512,256,128,64,32 =&amp;gt; 16,8,4,2,1&#xA;1,11,111,1111,11111 =&amp;gt; 111111,1111111,11111111,111111111,1111111111&#xA;1,21,321,4321,54321 =&amp;gt; 654321,7654321,87654321,987654321,10987654321&#xA;1,2,6,24,120 =&amp;gt; 720,5040,40320,362880,3628800&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I will create a GitHub Gist with all of the test cases before posting.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Currently, I'm looking for suggestions for:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a better name&lt;/li&gt;&#xA;&lt;li&gt;more tags&lt;/li&gt;&#xA;&lt;li&gt;more sequences&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Feel free to post any other questions/notes you have.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;&lt;sup&gt;1&lt;/sup&gt; This will be replaced with the actual number of test cases when this is posted.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="42545" LastEditorUserId="42545" LastEditDate="2016-02-15T18:00:01.423" LastActivityDate="2016-02-15T18:00:01.423" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="8369" PostTypeId="1" AcceptedAnswerId="8371" CreationDate="2016-02-10T21:53:28.500" Score="8" ViewCount="222" Body="&lt;p&gt;Questions about off-site programming challenges, such as those featured on Project Euler, Hackerrank, etc., are off topic here. However, it's come to my attention recently that questions about such challenges are actually on topic on &lt;a href=&quot;https://codereview.stackexchange.com&quot;&gt;Code Review&lt;/a&gt;. Indeed, they even have &lt;a href=&quot;https://codereview.stackexchange.com/tags/programming-challenge/info&quot;&gt;a dedicated tag for such questions&lt;/a&gt;. As such, I  propose that we add a new close reason that suggests that the OP check out Code Review, akin to our current option for general programming questions, which suggests Stack Overflow:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This site is for programming contests and challenges. General programming questions are off-topic here. You may be able to get help on &lt;a href=&quot;https://stackoverflow.com&quot;&gt;Stack Overflow&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It could say something along the lines of&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This site is for creating and participating in programming contests and challenges. Questions about off-site programming challenges are off-topic here. You may be able to get help on &lt;a href=&quot;https://codereview.stackexchange.com&quot;&gt;Code Review&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;To clarify, we would of course still direct folks without working code to Stack Overflow, and ensure that only questions that could be on topic for Code Review (with a recommendation to check out their Help Center as needed, as we currently do for SO) be suggested for Code Review.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="20469" LastEditDate="2016-02-10T22:10:44.810" LastActivityDate="2016-02-10T23:53:44.793" Title="New close reason for outside programming challenges" Tags="|discussion|close-reasons|" AnswerCount="3" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="8370" PostTypeId="2" ParentId="8369" CreationDate="2016-02-10T22:02:35.517" Score="2" Body="&lt;h1&gt;Sounds good&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;That sounds good, as long as they're meeting Code Review's on-topic rules:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Is code included directly in my question?&lt;/li&gt;&#xA;  &lt;li&gt;Am I an owner or maintainer of the code?  &lt;/li&gt;&#xA;  &lt;li&gt;Is it actual code from a project rather than pseudo-code or example code?  &lt;/li&gt;&#xA;  &lt;li&gt;Do I want the code to be good code? (i.e. &lt;strong&gt;&lt;em&gt;not code-golfing, obfuscation, or similar&lt;/em&gt;&lt;/strong&gt;)  &lt;/li&gt;&#xA;  &lt;li&gt;To the best of my knowledge, does the code work as intended?  &lt;/li&gt;&#xA;  &lt;li&gt;Do I want feedback about any or all facets of the code?&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Emphasis mine&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="41519" LastEditorUserId="41519" LastEditDate="2016-02-10T22:34:56.113" LastActivityDate="2016-02-10T22:34:56.113" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8371" PostTypeId="2" ParentId="8369" CreationDate="2016-02-10T22:36:03.570" Score="15" Body="&lt;h2&gt;No, it's too narrow&lt;/h2&gt;&#xA;&lt;p&gt;We only get 5 custom close reasons. Let's save them for something better.&lt;/p&gt;&#xA;&lt;p&gt;The off-topic questions I remember that mention off-site programming challenges are just &amp;quot;help me with code&amp;quot; questions where the source of the question doesn't really matter. This is already handled by the custom close reason:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This site is for programming contests and challenges. General&#xA;programming questions are off-topic here. You may be able to get help&#xA;on Stack Overflow.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Now, I could see this being misinterpreted to allow questions about other programming contests on other sites, but I don't actually remember any off-topic questions like that. (Maybe it's worth rewording though.)&lt;/p&gt;&#xA;&lt;p&gt;About directing questions Code Review if they fit their rules, I think that's going beyond our responsibility. Once we explain to a poster that we're not about helping people with their code, it's up to them to determine if Code Review or elsewhere is the right place for them. I imagine most close voters do not participate in Code Review, so we should not expect them to give accurate recommendations. If you do have an informed recommendation, you're welcome to post it as a comment.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-10T22:36:03.570" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8373" PostTypeId="2" ParentId="8369" CreationDate="2016-02-10T23:53:44.793" Score="14" Body="&lt;p&gt;As someone who isn't a member of PPCG, but is a member of both Stack Overflow &amp;amp; Code Review (with relatively high reputation on both), I'd have to emphatically disagree with the wording of both options you presented.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But ultimately, the biggest problem is that in your &lt;strong&gt;vote to &lt;em&gt;close&lt;/em&gt;&lt;/strong&gt; reason, you're recommending the user seek help at another Stack Exchange site.  We're not talking about a vote to migrate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A question should be closed because it's a bad question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A question should be migrated because it's a &lt;em&gt;great&lt;/em&gt; question, but it matches the scope of another Stack Exchange network site and not yours.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a question &lt;em&gt;belongs&lt;/em&gt; on Stack Overflow, Code Review, or any other Stack Exchange network site, then flag the question for moderator attention and get it migrated.  If you introduce a close reason pointing users to that other network site, you're going to end up with duplicate copy &amp;amp; pasted questions closed on multiple sites in the network.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Importantly, the people with close vote powers on PPCG are not exactly the best authority on what is on-topic for Code Review or Stack Overflow (or what makes a good question there).  There might be some overlap.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But how would PPCG members feel if Code Review or Stack Overflow added some sort of equivalent close reason and blanket pointed askers of bad questions to PPCG?&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Questions about intentionally obfuscated code are off-topic for Code Review.  You may be able to get help on &lt;a href=&quot;http://codegolf.stackexchange.com&quot;&gt;Programming Puzzles &amp;amp; Code Golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;You see what obviously happens right?  Anyone on Code Review with the power to close vote defaults to this close vote reason any time they see any question with any obfuscated code, and regardless of whether or not the question is actually a good fit for PPCG, it will be copy &amp;amp; pasted to here (and probably closed, because CR close voters aren't the authority on what makes a good PPCG question).&lt;/p&gt;&#xA;" OwnerUserId="38679" LastActivityDate="2016-02-10T23:53:44.793" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8374" PostTypeId="2" ParentId="928" CreationDate="2016-02-11T11:04:11.797" Score="5" Body="&lt;p&gt;Apparently the site is qualifying now something failed to trigger, see:&#xA;&lt;a href=&quot;https://meta.stackexchange.com/questions/274340/why-code-golf-programming-puzzles-is-still-in-beta/274457#274457&quot;&gt;Why is Code Golf &amp;amp; Programming Puzzles still in beta?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/users/146126&quot;&gt;Grace Note&lt;/a&gt; in a &lt;a href=&quot;https://meta.stackexchange.com/questions/274340/why-code-golf-programming-puzzles-is-still-in-beta#comment891571_274343&quot;&gt;comment to an answer&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Music and Japanese were in the loop before we set the new criteria.&#xA;  Aviation hit &quot;eligibility&quot; on October 19th. All 3 had delayed&#xA;  graduations, the former because of the whole design thing and the&#xA;  latter due to the pileup of graduations from implementing design&#xA;  independent. &lt;strong&gt;We just ran Code Golf through the eligibility check&#xA;  though, and it passed, and probably should've passed a while ago. So&#xA;  we're looking into why it hasn't been flagged yet.&lt;/strong&gt; &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;(Emphasis mine)&lt;/p&gt;&#xA;" OwnerUserId="12328" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2016-02-11T11:04:11.797" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8376" PostTypeId="2" ParentId="2140" CreationDate="2016-02-11T13:03:02.647" Score="0" Body="&lt;h1&gt;&lt;code&gt;ToUpperCase&lt;/code&gt;... Mathematica style&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For this challenge, you must write a program or function that converts every character in a string to upper case. &quot;Wouldn't this be too broad/a duplicate/etc.?&quot; you ask. Nope; you have to exactly implement Mathematica 10.1's &lt;code&gt;ToUpperCase&lt;/code&gt; function!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Note&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;ToUpperCase&lt;/code&gt; works quite peculiarly on Unicode. For example, &lt;code&gt;ß&lt;/code&gt; converts to &lt;code&gt;SS&lt;/code&gt;! The full replacement list (&lt;code&gt;from:to(,to);&lt;/code&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;97:65;98:66;99:67;100:68;101:69;102:70;103:71;104:72;105:73;106:74;107:75;108:76;109:77;110:78;111:79;112:80;113:81;114:82;115:83;116:84;117:85;118:86;119:87;120:88;121:89;122:90;223:83,83;224:192;225:193;226:194;227:195;228:196;229:197;230:198;231:199;232:200;233:201;234:202;235:203;236:204;237:205;238:206;239:207;240:208;241:209;242:210;243:211;244:212;245:213;246:214;248:216;249:217;250:218;251:219;252:220;253:221;254:222;255:89;257:256;259:258;263:262;269:268;271:270;275:274;277:276;283:282;301:300;305:73;322:321;328:327;337:336;339:338;345:344;353:352;357:356;367:366;369:368;382:381;945:913;946:914;947:915;948:916;949:917;950:918;951:919;952:920;953:921;954:922;955:923;956:924;957:925;958:926;959:927;960:928;961:929;962:931;963:931;964:932;965:933;966:934;967:935;968:936;969:937;977:920;981:934;982:928;987:986;989:988;991:990;993:992;1008:922;1009:929;1013:917;8458:63350;8467:8466;8495:8496;8500:63358;63154:63344;63155:8492;63156:63346;63157:63347;63159:8497;63161:8459;63162:8464;63163:63353;63164:63354;63166:8499;63167:63357;63169:63359;63170:63360;63171:8475;63172:63362;63173:63363;63174:63364;63175:63365;63176:63366;63177:63367;63178:63368;63179:63369;63180:63370;63181:63371;63182:8493;63183:63373;63184:63374;63185:63375;63186:63376;63187:8460;63188:8465;63189:63379;63190:63380;63191:63381;63192:63382;63193:63383;63194:63384;63195:63385;63196:63386;63197:8476;63198:63388;63199:63389;63200:63390;63201:63391;63202:63392;63203:63393;63204:63394;63205:8488;63206:63396;63207:63397;63208:63398;63209:63399;63210:63400;63211:63401;63212:63402;63213:63403;63214:63404;63215:63405;63216:63406;63217:63407;63218:63408;63219:63409;63220:63410;63221:63411;63222:63412;63223:63413;63224:63414;63225:63415;63226:63416;63227:63417;63228:63418;63229:63419;63230:63420;63231:63421;63232:74;63488:63514;63489:63515;63490:63516;63491:63517;63492:63518;63493:63519;63494:63520;63495:63521;63496:63522;63497:63523;63498:63524;63499:63525;63500:63526;63501:63527;63502:63528;63503:63529;63504:63530;63505:63531;63506:63532;63507:63533;63508:63534;63509:63535;63510:63536;63511:63537;63512:63538;63513:63539;63572:63540;63573:63541;63574:63542;63575:63543;63576:63544;63577:63545;63578:63546;63579:63547;63580:63548;63581:63549;63582:63550;63583:63551;63584:63552;63585:63553;63586:63554;63587:63555;63588:63556;63589:63558;63590:63558;63591:63559;63592:63560;63593:63561;63594:63562;63595:63563;63596:63564;63604:63547;63608:63561;63609:63555;63614:63613;63616:63615;63618:63617;63620:63619;63621:63549;63622:63556;63626:63544;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You cannot use a built-in that completely solves this challenge.&lt;/li&gt;&#xA;&lt;li&gt;If a function is written, the input is guaranteed to be a single string or equivalent.&lt;/li&gt;&#xA;&lt;li&gt;All characters not specified in the replacement list are to remain unchanged.&lt;/li&gt;&#xA;&lt;li&gt;All codepoints will be less than U+10000.&lt;/li&gt;&#xA;&lt;li&gt;If and only if your language can only take bytes as input, the string will be encoded in UTF-8.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are disallowed.&lt;/li&gt;&#xA;&lt;li&gt;Have fun!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases TBD&lt;/h2&gt;&#xA;&#xA;&lt;h1&gt;Meta Questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What are some good test cases for this challenge?&lt;/li&gt;&#xA;&lt;li&gt;Is there something that I possibly missed while writing this challenge?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="33208" LastEditorUserId="33208" LastEditDate="2016-02-11T23:10:25.827" LastActivityDate="2016-02-11T23:10:25.827" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="8379" PostTypeId="1" CreationDate="2016-02-11T17:24:23.450" Score="16" ViewCount="636" Body="&lt;p&gt;The main motivation for my question is hash functions. Let's take an example challenge (although &lt;a href=&quot;https://codegolf.stackexchange.com/questions/71742/sort-these-james-bond-ratings&quot;&gt;here's a real challenge&lt;/a&gt;):&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Print 42 if the input is &quot;the answer to life the universe and everything&quot;, 0 otherwise.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;You might program this like this in Python 2:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;print(42if raw_input()==&quot;the answer to life the universe and everything&quot;else 0)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You could also solve it like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;from hashlib import*&#xA;print(42if sha1(raw_input()).hexdigest()==&quot;2adc3e9a2bfb6b4ae5285b11dacc3990bb075585&quot;else 0)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In this case it's not any shorter, but the idea is there.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this allowed? It's cryptographically impossible to find an input that fails, but theoretically there are inputs for which the program exhibits wrong behavior.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If this is allowed, how hard must it be to find an incorrect input before allowing it?&lt;/p&gt;&#xA;" OwnerUserId="4162" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-02-11T18:01:46.270" Title="Are theoretically incorrect answers allowed if it's (near) impossible to find incorrect inputs?" Tags="|discussion|answers|" AnswerCount="2" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8380" PostTypeId="2" ParentId="8379" CreationDate="2016-02-11T17:36:38.287" Score="4" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;My suggestion is that we &lt;strong&gt;assume a program is correct until someone finds an explicit input/output pair for which it fails&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe this is the most clear-cut, objective way to determine whether or not an answer is correct.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Edit: this answer is regarding &quot;allowed&quot; as &quot;not deleted&quot; instead of &quot;not downvoted&quot;)&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2016-02-11T18:00:45.050" LastActivityDate="2016-02-11T18:00:45.050" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8381" PostTypeId="2" ParentId="8379" CreationDate="2016-02-11T17:40:20.593" Score="24" Body="&lt;h2&gt;No&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given that we allow answers which have infinite memory and infinite processing time, &lt;strong&gt;if &lt;em&gt;theoretically&lt;/em&gt; an input exists that makes the answer invalid, the answer should be deemed invalid&lt;/strong&gt;. This holds true even if no explicit examples are or can be provided.&lt;/p&gt;&#xA;" OwnerUserId="42963" LastActivityDate="2016-02-11T17:40:20.593" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8384" PostTypeId="1" CreationDate="2016-02-11T20:31:01.090" Score="6" ViewCount="210" Body="&lt;p&gt;In a recent &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8290/we-built-a-programming-language-right?cb=1&quot;&gt;meta thread&lt;/a&gt; the issue of &quot;running locally&quot; was brought up.  The main issue is, as best I can put it, &quot;Should we allow submissions in a language that cannot be run locally?&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To be more specific, I am talking about languages which require an Internet connection to meet our definition of a language (the two tests being addition and primality testing).  I am &lt;strong&gt;not&lt;/strong&gt; talking about languages which 1) could be run locally, even though the most convenient interpreter is online, or 2) use data which could be stored locally, but usually isn't. &lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-02-13T00:21:35.670" Title="Should we require that programming languages be able to run locally?" Tags="|discussion|policy|answers|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8386" PostTypeId="2" ParentId="8384" CreationDate="2016-02-11T20:55:19.323" Score="18" Body="&lt;h2&gt;Online interpreters should be treated the same as any other interpreter&lt;/h2&gt;&#xA;&lt;p&gt;You must be able to provide a version (possibly the current version) that predated the challenge being posted where the submission is valid (such as a VCS commit, archived backup, etc.). If this condition is met, then the online interpreter is a valid interpreter, even in the absence of a locally-runnable (read: no internet access required) interpreter.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-11T20:55:19.323" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8387" PostTypeId="2" ParentId="8047" CreationDate="2016-02-11T22:55:23.673" Score="21" Body="&lt;h2&gt;Tacked-on fixes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you clarify or modify your challenge after posting, don't just tack on a note to the end or to a list of bullet points. Edit in the change. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's confusing when the body of the challenge says one thing but a later part says another. Of course, it would be ideal not to change the challenge after posting, but if you have to edit, do so cleanly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if you said to &quot;take two integers as input&quot;, but, when asked, clarify that you had positive integers in mind, don't just add a note at the end that says&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;You may assume the input integers will be positive.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Instead, change the line to &quot;take two positive integers as input&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you have to make a substantial change, or there's already answers, it might be worth making a note about your change at the end to make people aware of it.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="8478" LastEditDate="2016-02-12T08:00:27.620" LastActivityDate="2016-02-12T08:00:27.620" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8389" PostTypeId="1" CreationDate="2016-02-12T05:32:42.560" Score="29" ViewCount="474" Body="&lt;p&gt;A couple years back we ran an &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1356/lets-make-an-ad-for-our-site-and-now-vote-for-our-newly-posted-ads&quot;&gt;advertising campaign&lt;/a&gt; using community ads on other network sites.  For those who might be unaware, community ads are &quot;community-vetted ads that will show up ... in the right sidebar&quot; of the respective site. You can see &lt;a href=&quot;https://codereview.meta.stackexchange.com/questions/6539/community-promotion-ads-2016&quot;&gt;community ad threads&lt;/a&gt; on several graduated sites.  As an example, here is the top-scoring ad from our previous campaign, by @squeamish:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/HcdIe.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/HcdIe.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think we should make a new campaign for 2016.  So, post your ad suggestions below!  All ads must follow these requirements:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The image that you create must be &lt;strong&gt;300 x 250 pixels&lt;/strong&gt; (wider than before), or double that if retina.&lt;/li&gt;&#xA;&lt;li&gt;Must be hosted through our standard image uploader (imgur)&lt;/li&gt;&#xA;&lt;li&gt;Must be GIF or PNG&lt;/li&gt;&#xA;&lt;li&gt;No animated GIFs&lt;/li&gt;&#xA;&lt;li&gt;Absolute limit on file size of &lt;strong&gt;150 KB&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;If the background of the image is white or partially white, there must be a 1px border surrounding it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;After a reasonable consensus has been reached (based on votes after 2 weeks or so), the top-scoring ad(s) will be submitted to the community-ads meta posts of several related sites.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-02-26T17:50:34.047" Title="Let's make more ads for our site! (2016 edition)" Tags="|discussion|" AnswerCount="4" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8390" PostTypeId="2" ParentId="2140" CreationDate="2016-02-12T05:59:47.367" Score="0" Body="&lt;h1&gt;Use Simpson's Rule&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Simpson%27s_rule#Quadratic_interpolation&quot; rel=&quot;nofollow noreferrer&quot;&gt;Simpson's rule&lt;/a&gt; is a fairly simple method for approximating a definite integral of one variable. The idea is to approximate the function to be integrated by a series of interpolated parabolas, and then find the area under those.&lt;/p&gt;&#xA;&lt;p&gt;As I learned in first-year calculus, the form of Simpson's Rule we'll be using is:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/VohUJ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/VohUJ.png&quot; alt=&quot;Simpson's rule from Wikipedia&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;where the width of each interval is &lt;em&gt;&lt;strong&gt;h&lt;/strong&gt;&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Equivalently, this is the dot product with the vector &lt;code&gt;h/3([1,4,2,4,...,1])&lt;/code&gt; the same length as the input.&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;An array of &lt;em&gt;&lt;strong&gt;n&lt;/strong&gt;&lt;/em&gt;&amp;gt;1 real numbers representing the values of &lt;em&gt;&lt;strong&gt;f&lt;/strong&gt;&lt;/em&gt; at x-values equally spaced by &lt;em&gt;&lt;strong&gt;h&lt;/strong&gt;&lt;/em&gt;. &lt;em&gt;&lt;strong&gt;n&lt;/strong&gt;&lt;/em&gt; will be odd.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;&lt;strong&gt;h&lt;/strong&gt;&lt;/em&gt;, a positive real number.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;The area approximation that Simpson's Rule gives.&lt;/p&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;[0,0,0], 1 -&amp;gt; 0&#xA;[3,1,4,1,5], 1 -&amp;gt; 8&#xA;&#xA;[add more]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-12T18:26:52.873" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8392" PostTypeId="2" ParentId="6918" CreationDate="2016-02-12T12:50:28.350" Score="13" Body="&lt;h1&gt;&lt;a href=&quot;https://esolangs.org/wiki/Jelly&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;By elected moderator, &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis ♦&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;From the &lt;a href=&quot;https://github.com/DennisMitchell/jelly/wiki&quot; rel=&quot;nofollow noreferrer&quot;&gt;wiki&lt;/a&gt;:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Jelly is a &lt;a href=&quot;https://en.wikipedia.org/wiki/Tacit_programming&quot; rel=&quot;nofollow noreferrer&quot;&gt;tacit&lt;/a&gt;,  programming language based on &lt;a href=&quot;https://en.wikipedia.org/wiki/J_%28programming_language%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;J&lt;/a&gt;: its &lt;em&gt;raison d'être&lt;/em&gt; is solving programs in the lowest possible byte count.&lt;/p&gt;&#xA;" OwnerUserId="39244" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-10T01:04:58.020" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8393" PostTypeId="2" ParentId="8389" CreationDate="2016-02-12T13:59:30.607" Score="20" Body="&lt;p&gt;Based on the current &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7955/2867&quot;&gt;graduation userscript&lt;/a&gt; design.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/tDv2p.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/tDv2p.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2016-02-12T13:59:30.607" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="8394" PostTypeId="2" ParentId="2140" CreationDate="2016-02-12T14:37:56.757" Score="3" Body="&lt;h1&gt;HTML Obfuscation&lt;/h1&gt;&#xA;&lt;p&gt;Write a program or function that takes HTML as a string as input and outputs &amp;quot;obfuscated&amp;quot; HTML.  Leave the text between the &lt;code&gt;&amp;lt;&lt;/code&gt;s and &lt;code&gt;&amp;gt;&lt;/code&gt;s unchanged, but escape all other text.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can assume that the &lt;code&gt;&amp;lt;&lt;/code&gt; and &lt;code&gt;&amp;gt;&lt;/code&gt; characters will only be used to open/close HTML tags.&lt;/li&gt;&#xA;&lt;li&gt;You can safely leave any text between these characters alone.  However, any text not between those characters should take on the form &lt;code&gt;&amp;lt;ampersand&amp;gt;&amp;lt;pound&amp;gt;&amp;lt;ascii-encoding&amp;gt;&amp;lt;semi-colon&amp;gt;&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You do NOT have to support self closing tags.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;div&amp;gt;Hello World&amp;lt;/div&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;div&amp;gt;&amp;amp;#72;&amp;amp;#101;&amp;amp;#108;&amp;amp;#108;&amp;amp;#111;&amp;amp;#32;&amp;amp;#87;&amp;amp;#111;&amp;amp;#114;&amp;amp;#108;&amp;amp;#100;&amp;lt;/div&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ABC&amp;lt;input type=&amp;quot;text&amp;quot;&amp;gt;DEF&amp;lt;div&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;amp;#65;&amp;amp;#66;&amp;amp;#67;&amp;lt;input type=&amp;quot;text&amp;quot;&amp;gt;&amp;amp;#68;&amp;amp;#69;&amp;amp;#70;&amp;lt;div&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note: it's ok that the HTML is invalid&lt;/p&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;eee&amp;lt;div data-bracket=&amp;quot;&amp;gt;&amp;quot;&amp;gt;eee&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;amp;#101;&amp;amp;#101;&amp;amp;#101;&amp;lt;div data-bracket=&amp;quot;&amp;gt;&amp;amp;#34;&amp;amp;#62;&amp;amp;#101;&amp;amp;#101;&amp;amp;#101;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note: here your program would mess up the HTML.  That's ok for the purposes of the challenge.&lt;/p&gt;&#xA;&lt;p&gt;This is code golf, so the shortest program wins.&lt;/p&gt;&#xA;" OwnerUserId="41245" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-12T15:41:02.963" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8395" PostTypeId="1" CreationDate="2016-02-12T17:50:17.383" Score="16" ViewCount="668" Body="&lt;p&gt;In a recent question for which the correct output for &lt;code&gt;1&lt;/code&gt; is zero, an &lt;a href=&quot;https://codegolf.stackexchange.com/a/71842/39328&quot;&gt;answer&lt;/a&gt; output &lt;code&gt;&lt;/code&gt;; i.e, nothing. Is this an acceptable base-10 representation for zero?&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-02-14T03:10:18.473" Title="Is the empty string an acceptable decimal representation of 0?" Tags="|discussion|policy|answers|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8396" PostTypeId="2" ParentId="8395" CreationDate="2016-02-12T17:59:15.293" Score="1" Body="&lt;h2&gt;Yes.&lt;/h2&gt;&#xA;&lt;p&gt;In both the mathematical base conversion algorithm:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;def frombase(array,base):&#xA;    ret = 0&#xA;    for digit in array:&#xA;        ret = ret * base + digit&#xA;    return ret&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and in many languages interpretation (e.g., &lt;code&gt;[int]&amp;quot;&amp;quot;&lt;/code&gt;), the empty string evaluates to zero.&lt;/p&gt;&#xA;&lt;p&gt;Thus, for a challenge requesting decimal output, an empty string is acceptable to output for zero.&lt;/p&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-12T18:05:55.237" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8397" PostTypeId="2" ParentId="8389" CreationDate="2016-02-12T18:32:25.117" Score="24" Body="&lt;p&gt;This has the same general format as my previous suggestion, but is based off of &lt;a href=&quot;https://codegolf.stackexchange.com/a/68494/2867&quot;&gt;this&lt;/a&gt; BF program. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Se0Nv.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Se0Nv.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-02-12T18:38:59.903" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8400" PostTypeId="2" ParentId="8395" CreationDate="2016-02-12T21:10:33.340" Score="18" Body="&lt;h1&gt;No, besides exceptions.&lt;/h1&gt;&#xA;&lt;p&gt;The challenge linked obviously requires the output to be a number for valid inputs.&lt;/p&gt;&#xA;&lt;p&gt;The empty string is not a number. The fact that empty strings evaluate to 0 in some languages doesn't justify its use as the number 0. Otherwise I could argue that &lt;code&gt;&amp;quot;a&amp;quot;&lt;/code&gt; is valid to represent &lt;code&gt;97&lt;/code&gt; in outputs because it's the corresponding ASCII code.&lt;/p&gt;&#xA;&lt;p&gt;The only case I can think of where outputting &lt;code&gt;&amp;quot;&amp;quot;&lt;/code&gt; for 0 is OK is when your output is in unary.&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-12T21:10:33.340" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8403" PostTypeId="2" ParentId="8395" CreationDate="2016-02-12T22:09:22.437" Score="8" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;The mathematical definition of a base-10 representation is:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/sXAce.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/sXAce.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Where a&lt;sub&gt;n&lt;/sub&gt;...a&lt;sub&gt;1&lt;/sub&gt;a&lt;sub&gt;0&lt;/sub&gt; is the base-10 representation. The value of the empty string is well-defined as the empty sum, 0.&lt;/p&gt;&#xA;&lt;p&gt;The empty string can be considered a more consistent  representation than &lt;code&gt;0&lt;/code&gt;, since it follows the convention that numbers have no leading zeroes.&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-12T22:15:31.160" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="8406" PostTypeId="5" CreationDate="2016-02-13T01:33:33.997" Score="0" Body="" OwnerUserId="-1" LastEditorUserId="-1" LastEditDate="2016-02-13T01:33:33.997" LastActivityDate="2016-02-13T01:33:33.997" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8407" PostTypeId="4" CreationDate="2016-02-13T01:33:33.997" Score="0" Body="For questions about scoring a challenge or how to score a particular language" OwnerUserId="29560" LastEditorUserId="29560" LastEditDate="2016-02-13T02:27:18.250" LastActivityDate="2016-02-13T02:27:18.250" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8408" PostTypeId="1" CreationDate="2016-02-13T01:50:41.500" Score="0" ViewCount="92" Body="&lt;p&gt;I know the Perl &lt;code&gt;-p&lt;/code&gt; flag is counted as one byte. I've just added the Perl bignum library to my answer to make it shorter. I'm using it like this: &lt;code&gt;perl -p -Mbignum filename.pl&lt;/code&gt;. How many bytes does it count as?&lt;/p&gt;&#xA;" OwnerUserId="29560" LastEditorUserId="20469" LastEditDate="2016-02-13T02:02:09.797" LastActivityDate="2016-02-13T12:43:11.450" Title="How to score adding a Perl library on the command line?" Tags="|discussion|code-golf|scoring|" AnswerCount="1" CommentCount="0" ClosedDate="2016-02-13T02:05:03.133" ContentLicense="CC BY-SA 3.0" />
  <row Id="8409" PostTypeId="2" ParentId="8408" CreationDate="2016-02-13T01:52:14.177" Score="3" Body="&lt;p&gt;People usually count &lt;code&gt;-p&lt;/code&gt; as one byte because &lt;code&gt;perl -pE&lt;/code&gt; has a distance of 1 to &lt;code&gt;perl -E&lt;/code&gt; (arguably the default). If you require reading the source code from a file for some reason, &lt;code&gt;-p&lt;/code&gt; would count as three bytes, as &lt;code&gt;perl -p file.pl&lt;/code&gt; has a distance of 3 to &lt;code&gt;perl file.pl&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Likewise, &lt;code&gt;perl -p -Mbignum file.pl&lt;/code&gt; has a distance of 9 to &lt;code&gt;perl -p file.pl&lt;/code&gt;, so it comes at a 9 byte score penalty.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="8478" LastEditDate="2016-02-13T12:43:11.450" LastActivityDate="2016-02-13T12:43:11.450" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8410" PostTypeId="1" CreationDate="2016-02-13T02:45:32.203" Score="-8" ViewCount="78" Body="&lt;p&gt;I was looking for a specific post I'd seen before on golfing tips: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/5105/tips-for-golfing-in-perl&quot;&gt;Tips for golfing in Perl?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I eventually found it on &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;codegolf&lt;/a&gt;, not &lt;a href=&quot;https://codegolf.meta.stackexchange.com/&quot;&gt;meta.codegolf&lt;/a&gt; where it obviously belongs. Yet, apparently it is too old to migrate to meta.codegolf. I have read &lt;a href=&quot;https://meta.stackexchange.com/questions/151890/disable-migration-for-questions-older-than-60-days&quot;&gt;the reason for this on meta&lt;/a&gt; but I disagree that it's applicable here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What are the options to be able to find such content solely by searching on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/&quot;&gt;meta.codegolf&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="29560" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-02-13T02:52:13.357" Title="What can we do with &quot;too old to migrate&quot; questions that belong on meta?" Tags="|discussion|support|migration|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8411" PostTypeId="2" ParentId="8410" CreationDate="2016-02-13T02:52:13.357" Score="11" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/5105/tips-for-golfing-in-perl&quot;&gt;Tips for golfing in Perl?&lt;/a&gt; does &lt;em&gt;not&lt;/em&gt; belong on Meta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is because Meta is for questions about the site &lt;em&gt;Programming Puzzles &amp;amp; Code Golf&lt;/em&gt;, not for questions about Perl.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Furthermore, our &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;help center&lt;/a&gt; says that&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Non-challenge questions that are are related to solving programming puzzles or a particular type of challenge are also on topic.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;which means that they are, in fact, on topic on the main site.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-02-13T02:52:13.357" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8412" PostTypeId="2" ParentId="2140" CreationDate="2016-02-13T07:10:31.317" Score="0" Body="&lt;h2&gt;I'm a Puzzle!&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to print the string &quot;I'm on &lt;em&gt;OS&lt;/em&gt;!&quot;, where &lt;em&gt;OS&lt;/em&gt; is the operating system that the program is run on without version numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard loopholes apply.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition, programs with hardcoded values (e.g. &lt;code&gt;print &quot;I'm on AFakeOS&quot;&lt;/code&gt;) will be disqualified.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As this is Code Golf, your score will be the length of your full program.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Any suggestions?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Java example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;class A {&#xA;    public static void main(String[] args){&#xA;        System.out.println(&quot;I am a &quot; + System.getProperty(&quot;os.name&quot;).replaceAll(&quot; .*&quot;,&quot;&quot;)&#xA;                                     + &quot;!&quot;);&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="38418" LastEditorUserId="38418" LastEditDate="2016-04-18T03:22:27.783" LastActivityDate="2016-04-18T03:22:27.783" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="8414" PostTypeId="2" ParentId="2140" CreationDate="2016-02-13T20:29:43.110" Score="0" Body="&lt;h1&gt;Implement the Block Sort sorting algorithm&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Block_sort&quot; rel=&quot;nofollow noreferrer&quot;&gt;Block sort&lt;/a&gt; is an interesting sorting algorithm (comparatively speaking).  Here are some of its important properties:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;O(n log n) time complexity in worst and average case&lt;/li&gt;&#xA;&lt;li&gt;O(n) time complexity in best case&lt;/li&gt;&#xA;&lt;li&gt;O(1) space complexity (not including the space that holds the list itself)&lt;/li&gt;&#xA;&lt;li&gt;Stable&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If you check out this &lt;a href=&quot;https://en.wikipedia.org/wiki/Sorting_algorithm#Comparison_of_algorithms&quot; rel=&quot;nofollow noreferrer&quot;&gt;table comparing sorting algorithms&lt;/a&gt;, you'll see that it's the only one that has the whole row highlighted in green.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to write an implementation of the block sort algorithm in the fewest bytes.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2016-02-13T20:29:43.110" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8415" PostTypeId="2" ParentId="2140" CreationDate="2016-02-13T23:14:47.647" Score="4" Body="&lt;h1&gt;Create a spiraling image&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Introduction&lt;/h3&gt;&#xA;&lt;p&gt;WIP&lt;/p&gt;&#xA;&lt;h3&gt;Task&lt;/h3&gt;&#xA;&lt;p&gt;Given an image, output the image with a spiraling effect.&lt;/p&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, so the submission with the highest number of votes wins!&lt;/p&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;p&gt;Note that your program should work for images with any size. The output should be a &lt;strong&gt;512×512px image&lt;/strong&gt;. Also, &lt;em&gt;note that the test cases are &lt;strong&gt;examples&lt;/strong&gt;&lt;/em&gt;, you may use any algorithm to produce these images and do not have to match the images below. Use your creativity!&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test case 1&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Q8FzRm.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Q8FzRm.jpg&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Becomes:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/FnEii.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/FnEii.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test case 2&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/i9oR4m.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/i9oR4m.jpg&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Becomes:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/0O4hz.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/0O4hz.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test case 3&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/B1JQpm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/B1JQpm.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Becomes:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/AzaP8.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/AzaP8.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test case 4&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/CP1Fkm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/CP1Fkm.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Becomes:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/OuYdB.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/OuYdB.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test case 5&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/K3Sxym.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/K3Sxym.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Becomes:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/6pdtr.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/6pdtr.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Important&lt;/h3&gt;&#xA;&lt;p&gt;The full size images:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://i.stack.imgur.com/Q8FzR.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;Test case 1&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://i.stack.imgur.com/i9oR4.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;Test case 2&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://i.stack.imgur.com/B1JQp.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;Test case 3&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://i.stack.imgur.com/CP1Fk.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;Test case 4&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://i.stack.imgur.com/K3Sxy.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;Test case 5&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="34388" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-13T23:31:45.010" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8420" PostTypeId="1" AcceptedAnswerId="8421" CreationDate="2016-02-14T18:39:01.483" Score="7" ViewCount="103" Body="&lt;p&gt;I've seen a few variations of submissions specifying the ECMAScript version of JavaScript, and this creates problems for leaderboard scripts since they end up being treated as different languages under the &amp;quot;by language&amp;quot; category.&lt;/p&gt;&#xA;&lt;p&gt;Namely, for JavaScript ES5, I've seen:&lt;/p&gt;&#xA;&lt;h1&gt;JavaScript&lt;/h1&gt;&#xA;&lt;h1&gt;ES5&lt;/h1&gt;&#xA;&lt;h1&gt;JavaScript ES5&lt;/h1&gt;&#xA;&lt;p&gt;ES6 and ES7:&lt;/p&gt;&#xA;&lt;h1&gt;JavaScript ES6/7&lt;/h1&gt;&#xA;&lt;h1&gt;ES6/7&lt;/h1&gt;&#xA;&lt;p&gt;What should we title these submissions as, so that there's no more confusion for leaderboard scripts?&lt;/p&gt;&#xA;" OwnerUserId="42091" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-14T19:03:14.740" Title="Submission title for versions of JavaScript, regarding normalization for leaderboard scripts" Tags="|discussion|answers|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8421" PostTypeId="2" ParentId="8420" CreationDate="2016-02-14T18:43:22.527" Score="10" Body="&lt;p&gt;Specifying the ES standard seems like a good idea to keep these separate in the leaderboards. Of course, it becomes a problem if the same ES standard is specified in different formats. So without any reason in particular, just to create &lt;em&gt;one&lt;/em&gt; standard I propose using one of&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;JavaScript&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;JavaScript (ES6)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Depending on whether the answer works in all common ES versions or only in a specific one. Note that &lt;code&gt;ES5&lt;/code&gt; should also be specified if your answer works &lt;em&gt;only&lt;/em&gt; in ES5 (I don't know how backwards-compatible ES6 is). The plain version with &lt;code&gt;JavaScript&lt;/code&gt; should be reserved for &quot;version polyglots&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, I wouldn't expect everyone to have seen this post, but those who have could always edit nonconforming answers if they see them and put a link to this answer in the edit summary.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2016-02-14T19:03:14.740" LastActivityDate="2016-02-14T19:03:14.740" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="8422" PostTypeId="2" ParentId="8350" CreationDate="2016-02-14T21:41:57.017" Score="34" Body="&lt;h2&gt;Increase the &quot;Ask Question&quot; Privilege Threshold to +2&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I should note that I'm not convinced that this is a good idea but I figure I'll mention it to see how others feel.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On Q&amp;amp;A sites, the point of posting a question is to get help, to ask a question and get an answer. There shouldn't be a barrier to asking a question. However, in the context of creating and posting challenges, there are many more things to consider.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For this reason, it may be a good idea to require some familiarity with the site in order to post a challenge to the main site. The easiest way to do that would be to require potential challenge authors to have earned at least 2 reputation on this site before being allowed to post questions. This would require one upvote on one answer or one accepted edit. Note that &quot;on this site&quot; implies that an association bonus wouldn't count toward this privilege.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This would also help reduce the number of blatantly off-topic questions we get.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="20469" LastEditDate="2016-02-14T21:49:08.337" LastActivityDate="2016-02-14T21:49:08.337" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="8423" PostTypeId="2" ParentId="5759" CreationDate="2016-02-15T01:21:44.623" Score="4" Body="&lt;h1&gt;Code Challenges&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In my opinion, better than Programming Challenges. ¯\_(ツ)_/¯&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-02-15T01:21:44.623" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8424" PostTypeId="1" AcceptedAnswerId="8425" CreationDate="2016-02-15T02:01:17.503" Score="24" ViewCount="704" Body="&lt;p&gt;Say there's a challenge with two inputs. Can we submit a function signature like this?&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a=&amp;gt;b=&amp;gt;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Instead of&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(a,b)=&amp;gt;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The function then becomes callable as &lt;code&gt;f(a)(b)&lt;/code&gt; instead of &lt;code&gt;f(a,b)&lt;/code&gt;, if we provide example usage. Is this considered acceptable, or should it be added to &quot;standard loopholes&quot;?&lt;/p&gt;&#xA;" OwnerUserId="42091" LastActivityDate="2017-05-17T12:18:43.360" Title="Is this an acceptable way to shave a byte in ES6?" Tags="|discussion|policy|answers|" AnswerCount="3" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8425" PostTypeId="2" ParentId="8424" CreationDate="2016-02-15T02:19:04.200" Score="24" Body="&lt;h1&gt;Well, yes.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You just have to specify how to call it in your answer. It's no different than a submission that expects a certain type of input input (command line args vs. STDIN, for example).&lt;/p&gt;&#xA;" OwnerUserId="44713" LastActivityDate="2016-02-15T02:19:04.200" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8426" PostTypeId="2" ParentId="8424" CreationDate="2016-02-15T03:02:34.817" Score="-14" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;My reasoning is that the output is wrong.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the challenge was:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Take two integers &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; and output the sum of &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;and your answer was:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a=&amp;gt;b=&amp;gt;a+b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;then your answer is in the form of a function (&lt;code&gt;a=&amp;gt;...&lt;/code&gt;), but the output of this function is another function instead of &lt;em&gt;&quot;the sum of &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt;&quot;&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="46855" LastActivityDate="2016-02-15T03:02:34.817" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8427" PostTypeId="2" ParentId="2447" CreationDate="2016-02-15T07:48:53.893" Score="82" Body="&lt;h1&gt;Functions may take multiple arguments via &lt;a href=&quot;https://en.wikipedia.org/wiki/Currying&quot; rel=&quot;nofollow noreferrer&quot;&gt;currying&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For some functional programming languages like Haskell this is actually necessary, because only single-argument functions exist and functions with multiple arguments are (somewhat transparently) implemented as curried functions. (The alternative would be to take a list or tuple of the values, but that is not how one would naturally write a two-argument function in Haskell.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8425/8478&quot;&gt;As per this consensus&lt;/a&gt; the same should also be allowable for languages where multi-argument functions do exist. As an example from JavaScript, instead of defining&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f=(a,b)=&amp;gt;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and calling it like &lt;code&gt;f(a,b)&lt;/code&gt; one could then also define&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f=a=&amp;gt;b=&amp;gt;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and call it like &lt;code&gt;f(a)(b)&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2016-02-19T10:52:51.167" CommentCount="0" CommunityOwnedDate="2016-02-15T07:48:53.893" ContentLicense="CC BY-SA 3.0" />
  <row Id="8428" PostTypeId="1" CreationDate="2016-02-15T08:02:38.720" Score="12" ViewCount="274" Body="&lt;p&gt;I like having my byte count history this way:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;210 &lt;s&gt;212 219&lt;/s&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But there is some user that keep &lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits/28738&quot;&gt;editing my answers&lt;/a&gt; to put it this way:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;212 219&lt;/s&gt; 210 &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Citing @PhiNotPi &quot;This edit does not make the post even a little bit easier to read, easier to find, more accurate or more accessible.&quot; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;What can I do to avoid these kind of edits, apart from posting my complaint here?&lt;/p&gt;&#xA;" OwnerUserId="21348" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-02-15T15:37:42.620" Title="Avoid useless edit about byte count" Tags="|discussion|editing|reviewing|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8429" PostTypeId="2" ParentId="8428" CreationDate="2016-02-15T08:08:51.467" Score="16" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;What can I do to avoid these kind of edits, apart from posting my complaint here?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Put them in the right order to begin with. ;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm kidding, of course - you're free to put them in any order you like. If someone does that once or twice, I wouldn't worry about it and just reject/rollback the edit. If they insist on it, and either start a rollback war or keep doing it over many of your posts, flag one of them with a custom message to explain the issue and we (the mods) will have a look at it.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-02-15T08:08:51.467" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8430" PostTypeId="2" ParentId="5759" CreationDate="2016-02-15T08:14:07.393" Score="1" Body="&lt;h2&gt;We don't need any of &quot;Programming&quot;, &quot;Golf&quot; or &quot;Contest&quot; in the name...&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This isn't a concrete suggestion because I don't have one (yet). This answer is to suggest that maybe we don't need such a literal name that explicitly describes the content of the site at all. My favourite example of this is &quot;Gaming Stack Exchange&quot;, better known as &lt;a href=&quot;https://gaming.stackexchange.com/&quot;&gt;Arqade&lt;/a&gt; (well that name isn't perfect - you'd have to explain the spelling in an elevator pitch; bit it's certainly catchy and not as blunt as &quot;Gaming&quot;). Other examples are &lt;a href=&quot;https://apple.stackexchange.com/&quot;&gt;Ask Different&lt;/a&gt;, &lt;a href=&quot;https://stats.stackexchange.com/&quot;&gt;Cross Validated&lt;/a&gt; and of course the big three, Stack Overflow, Super User and Server Fault.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All of the suggestions so far don't really fall into the same category (except Code Sport[s] maybe), because they all try to find a word that describes our scope instead of being interesting, catchy names for the community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main benefits of such a name would be that &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;they would give the community more character.&lt;/li&gt;&#xA;&lt;li&gt;they could be more memorable.&lt;/li&gt;&#xA;&lt;li&gt;most importantly, they wouldn't be tied that closely to the scope so that we wouldn't have to repeat this discussion every three years when the focus of the community may or may not have shifted to different types of challenges again.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I suppose the votes on this answer can act as the general opinion of the community about such a name for the site, but it's mostly intended as a call to more creative suggestions which can then be voted on.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:45:29.263" LastActivityDate="2016-02-15T08:43:05.703" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8432" PostTypeId="2" ParentId="8350" CreationDate="2016-02-15T14:40:07.920" Score="31" Body="&lt;h2&gt;A bounty-like feature for challenges&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Sometimes, challenges are so well-designed and/or have taken so much effort, that I want to give the author a bunch of my rep for the great service they've done the community. Currently, the best/only way to reward a challenge is to put a bounty on it to attract more answers (and maybe some more votes because of the additional attention) and to share it off-site e.g. on reddit or Hacker News.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It would be great if the software provided a way to reward our most dedicated challenge authors more directly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm saying &quot;bounty-&lt;em&gt;like&lt;/em&gt;&quot; because it probably doesn't make sense to put them up for 7 days and say &quot;this will go to the best challenge which meets criteria X, Y, Z&quot;. These would either be indefinite bounties (&quot;first well-defined challenge that pulls off an audio-to-image processing task&quot;) or could just be given to any challenge on the spot (maybe also featuring it, like a normal bounty would). Of course, one would have to carefully think about whether and how this system could be gamed.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2016-02-23T10:35:23.580" LastActivityDate="2016-02-23T10:35:23.580" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8433" PostTypeId="2" ParentId="8350" CreationDate="2016-02-15T14:50:19.087" Score="29" Body="&lt;h2&gt;Support for indefinite bounties&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I don't know if any other site is doing this, but it's quite common here to promise a bounty without actually starting it, because some are asking for additional effort on a challenge that can easily take more than 7 days or are not even known to be possible. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5243/8478&quot;&gt;In fact we're keeping a list of them on meta&lt;/a&gt; and it's fairly long. I don't see this practice going away and it's a nice source of extra(-hard) challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It would be helpful if there was software support for this, so a) we wouldn't have to keep track of it manually (I'm sure there are some additional such offers buried in our challenges that aren't in that list yet) and b) it would give more exposure to this extra challenges, because not everyone is aware of the linked meta post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Just to clarify, I'm &lt;em&gt;not&lt;/em&gt; proposing that bounties on PPCG should generally be without a deadline. This should be a completely separate feature (which wouldn't even necessarily be tied to a single challenge, as some offers on that list show), and the regular 7-day bounties should remain unchanged. I also don't think these should get mixed with the regular bounties in the featured-challenges tab. They could have their slightly less prominent own spot, and should be retractable (e.g. in case someone decides to solve their own challenge). Or maybe - as for normal bounties - the capability of refunding rep should be left to moderators, so people can't game the system easily.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-02-23T10:21:03.320" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8434" PostTypeId="1" CreationDate="2016-02-15T15:08:30.540" Score="1" ViewCount="107" Body="&lt;p&gt;I edited &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69694&quot;&gt;https://codegolf.stackexchange.com/questions/69694&lt;/a&gt; today. Even though it was submitted and accepted only 11 days after OP, I got the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/necromancer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;necromancer&amp;#39;&quot; rel=&quot;tag&quot;&gt;necromancer&lt;/a&gt; badge for  the edit.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-02-16T11:15:03.543" Title="Editing an already accepted answer after 60 days earns Necromancer badge" Tags="|support|badges|accepted-answer|" AnswerCount="1" CommentCount="2" ClosedDate="2016-02-16T13:22:57.003" ContentLicense="CC BY-SA 3.0" />
  <row Id="8435" PostTypeId="2" ParentId="8434" CreationDate="2016-02-15T15:14:56.973" Score="5" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/44/necromancer&quot;&gt;Necromancer&lt;/a&gt; is awarded for&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Answer a question more than 60 days later with score of 5 or more&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The question was asked January 8, &lt;strong&gt;2015&lt;/strong&gt;, so that's a lot more than 60 days.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The reason the badge was awarded today is that you just got the fifth upvote. The edit itself is unrelated to the badge, although you probably got the upvote because the edit bumped the question to the front page.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-02-15T15:14:56.973" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8436" PostTypeId="2" ParentId="2140" CreationDate="2016-02-15T16:09:05.653" Score="0" Body="&lt;h1&gt;Advent of Code, puzzle 1&lt;/h1&gt;&#xA;&lt;p&gt;I don't know if anyone here spent their December working on the problems found on &lt;a href=&quot;http://www.adventofcode.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Advent of Code&lt;/a&gt;, but I thought some of the simpler problems might make good code golf puzzles.&lt;/p&gt;&#xA;&lt;p&gt;So, here's the first &lt;a href=&quot;http://adventofcode.com/day/1&quot; rel=&quot;nofollow noreferrer&quot;&gt;one&lt;/a&gt;. There will be two challenges, and the solution should be a pair of programs, each of which solves one challenge.&lt;/p&gt;&#xA;&lt;p&gt;Score is based on the combined byte count of the two programs.&lt;/p&gt;&#xA;&lt;p&gt;(An alternative would be to also allow a single program that produces a tuple of the two solitions- what do you think?)&lt;/p&gt;&#xA;&lt;p&gt;Input: An unbalanced string of open and close brackets.&lt;/p&gt;&#xA;&lt;p&gt;Output 1: The count of the number of open brackets take away the number of close brackets.&lt;/p&gt;&#xA;&lt;p&gt;Output 2: The index of the first close bracket that causes the running sum to reach -1.&lt;/p&gt;&#xA;" OwnerUserId="49583" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-15T16:32:10.070" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8437" PostTypeId="2" ParentId="8047" CreationDate="2016-02-15T16:29:52.123" Score="43" Body="&lt;h2&gt;Requiring the use of unnecessarily &quot;complicated&quot; number types&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A large proportion of our challenges deal with numbers, or lists of numbers. An important consideration is always what sort of numbers are valid input (positive integers, non-negative integers, all integers, floating-point numbers, complex integers, complex floating-point numbers...).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the interest of making the challenge accessible to (and enjoyable in) the widest range of languages, &lt;strong&gt;try making the number types as simple as possible without harming the challenge.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your challenge is about sorting a list of numbers, positive integers suffice. Using floating point numbers doesn't add anything interesting to the challenge but makes it incredibly tough or practically impossible to solve the challenge in languages that only support integer data, even though they might be able to solve the actual task of sorting quite easily.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In some cases, the actual values are completely arbitrary and only exist as place holders in the structure of an array. In this case you can even consider restricting the input to single-digit integers, unless you want to specifically make string-processing based approaches less feasible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, some challenges only make sense for floating point numbers or even complex floating-point, and that's completely fine. But when the core of the challenge is not about handling those data types, they only distract from the interesting parts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a rule of thumb I propose that people ask &quot;if I change this from integer to float or vice-versa, would this affect any viable approaches in mainstream languages?&quot; If that's the case, then requiring floating point might make sense (if those are the approaches you're looking for). But if not, limiting the challenge to integers won't do it any harm for the common languages, and will make the challenge more interesting to people who prefer to use esolangs for a little extra challenge.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-02-15T16:29:52.123" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8438" PostTypeId="2" ParentId="8242" CreationDate="2016-02-15T17:09:25.947" Score="3" Body="&lt;h1&gt;Keep It&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Site traffic history for ppcg.se, by month:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Crlav.png&quot; alt=&quot;ppcg.se traffic history&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With a few notable exceptions (for example &lt;a href=&quot;https://codegolf.stackexchange.com/q/6043&quot;&gt;We're no strangers to code golf&lt;/a&gt;, the blip in April 2012), nearly all questions with &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=views%3a50000&quot;&gt;50k+ views&lt;/a&gt; have been popularity contests of one flavor or another. It is my contention that had popularity contests been a standard challenge type from early on, the site would have taken off much quicker.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I do, however, agree with other posts that a well-defined validity criterion must be in place for a question to be considered on-topic.&lt;/p&gt;&#xA;" OwnerUserId="4098" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-02-15T17:09:25.947" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8439" PostTypeId="2" ParentId="5759" CreationDate="2016-02-15T17:27:10.397" Score="20" Body="&lt;h1&gt;Code Games&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It's catchy.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It gives a hint about what we do, without going into details.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It's unique. I'm not aware of any other site/event that refers to itself as &lt;strong&gt;Code Games&lt;/strong&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It combines perfectly with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7978&quot;&gt;our proposed logo&lt;/a&gt;:&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/B4aBQ.png&quot; alt=&quot;logo&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-02-15T18:14:01.360" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="8441" PostTypeId="1" CreationDate="2016-02-15T18:04:26.497" Score="18" ViewCount="293" Body="&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8351/8478&quot;&gt;This feature request is related to PPCG not being a Q&amp;amp;A site.&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The most important part of the onboarding experience for new users (especially those who don't arrive via other sites from the network) is the tour page. Moderators can customise the first paragraph and a few details in the right column, but in the case of PPCG this is hardly enough, because the rest of the page is strongly misleading:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Ask questions, get answers, no distractions&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Get answers to practical, detailed questions&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Focus on questions about an actual problem you have faced. Include details about what you have tried and exactly what you are trying to do.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Ask about...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;None of these are things that users should actually do here. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It would be great if a) those misleading bits could be removed and ideally b) replaced with some important information that applies here instead. The usual process for new users on a Q&amp;amp;A site is that they join the site to ask a question and then start answering others as well when they feel confident about it. Around here, we prefer users to start with solving challenges so they can get a feeling for how challenges work around here before writing their own. (Yes, CH, you are an exception to that...)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The things that are most problematic are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The (already customisable) first paragraph start with &quot;Programming Puzzles &amp;amp; Code Golf is a question and answer site for programming puzzle enthusiasts and code golfers.&quot; Except it's not.&lt;/li&gt;&#xA;&lt;li&gt;The first two sections &quot;Ask questions, get answers, no distractions&quot; and &quot;Get answers to practical, detailed questions&quot; are the most misleading because they tell people to use this as a Q&amp;amp;A site. These should instead explain how you can solve challenges here and pose your own as well (in that order).&lt;/li&gt;&#xA;&lt;li&gt;The sections about tags, edits, reputation and badges are generally alright, except that some instances of &quot;question&quot; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8355/8478&quot;&gt;could be replaced with &quot;challenge&quot;&lt;/a&gt; and that we might want to mention that edits here shouldn't be used to improve the score (comments should be used instead, as the example there already shows - although that example could possibly be improved).&lt;/li&gt;&#xA;&lt;li&gt;The final bit that sends people off to the site would probably also better be phrased in terms of &quot;posing challenges&quot; rather than &quot;asking questions&quot;.&lt;/li&gt;&#xA;&lt;li&gt;&quot;Like this site? Stack Exchange is a network of 152 Q&amp;amp;A sites just like it.&quot; Well...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Please use the answers to suggest new content for the problematic sections. When we find a consensus what we'd rather have on the tour page, I can inform the CMs to take a look at this.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="68942" LastEditDate="2021-06-09T13:37:03.110" LastActivityDate="2021-06-09T13:37:03.110" Title="Can we get a custom Tour page?" Tags="|feature-request|status-deferred|new-users|help-center|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8442" PostTypeId="2" ParentId="2140" CreationDate="2016-02-15T20:53:00.973" Score="0" Body="&lt;h2&gt;Diopter lenses&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In photography, there are thin lenses that you put in front of a photographic lens to make it behave like a close-up lens. Each of these lenses has an associated diopter value which is a positive integer. If you stack two (or more) of these lenses you get an equivalent of a lens with the diopter value that is the sum of the values of those lenses.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The problem&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program should take one diopter value &lt;code&gt;n&lt;/code&gt; as an input. The input need not be validated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should output in any human readable form a list of diopter lenses such that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the maximum diopter value you can form by stacking the lenses is &lt;code&gt;n&lt;/code&gt;,&lt;/li&gt;&#xA;&lt;li&gt;every diopter from &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;n&lt;/code&gt; can be formed by stacking a combination of those lenses,&lt;/li&gt;&#xA;&lt;li&gt;there exists no set of fewer lenses that complies to the above rules.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;An example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given the input of:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;6&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Print the output of&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;2&#xA;3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Because:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1=1&#xA;2=2&#xA;3=3&#xA;1+3=4&#xA;2+3=5&#xA;1+2+3=6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;The rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is code golf, so the objective is to write the shortest possible code, &lt;strong&gt;but&lt;/strong&gt;, since there is a trivial solution that might not be obvious to some, I suggest that the answer be encoded by some means so one wouldn't see the solution before attempting to solve the problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any type of output is accepted, as long as the program outputs correct clearly separated positive integers and no other alphanumeric character.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;My solution&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;python 2, 52 bytes, base64 encoded&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;bj1pbnB1dCgpCno9MQp3aGlsZSAyKnotMTxuOnByaW50IHo7eio9MgpwcmludCBuLXorMQ==&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="14813" LastActivityDate="2016-02-15T20:53:00.973" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8444" PostTypeId="1" CreationDate="2016-02-15T21:49:46.983" Score="1" ViewCount="72" Body="&lt;p&gt;Can someone explain specifically why this is currently on hold? I'd really like to be able to turn this into a contest, but I'm not sure what's disagreeable about it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/73215/42091&quot;&gt;https://codegolf.stackexchange.com/q/73215/42091&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="42091" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-02-15T23:13:27.443" Title="What is/are the reasons for this being put on hold?" Tags="|discussion|specific-question|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8445" PostTypeId="2" ParentId="2140" CreationDate="2016-02-15T23:00:31.357" Score="0" Body="&lt;h1&gt;Hourglass simulator&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Write a full program or function to simulate an hourglass.&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;n&lt;/strong&gt;&lt;/em&gt;, the number of seconds on the hourglass.&lt;/p&gt;&#xA;&lt;h3&gt;Behavior&lt;/h3&gt;&#xA;&lt;p&gt;At the start, there are &lt;em&gt;&lt;strong&gt;n&lt;/strong&gt;&lt;/em&gt; seconds on a timer, and the timer is counting down. When the user presses the spacebar with &lt;em&gt;&lt;strong&gt;t&lt;/strong&gt;&lt;/em&gt; seconds left, set the time left to &lt;em&gt;&lt;strong&gt;n-t&lt;/strong&gt;&lt;/em&gt;. Terminate the program when time runs out.&lt;/p&gt;&#xA;&lt;p&gt;This models an hourglass where the top of the hourglass is initially filled with &lt;em&gt;&lt;strong&gt;n&lt;/strong&gt;&lt;/em&gt; seconds of sand. When the spacebar is pressed, the hourglass flips by 180°. When either side of the hourglass runs out of sand, the program terminates.&lt;/p&gt;&#xA;&lt;p&gt;[Is there anything I'm missing? This spec seems really short.]&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-17T06:32:44.283" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="8446" PostTypeId="2" ParentId="2140" CreationDate="2016-02-15T23:06:14.970" Score="5" Body="&lt;h1&gt;The largest convex polygon&lt;/h1&gt;&#xA;&lt;p&gt;Given an input of at least one coordinate pair on the Cartesian plane, determine the largest number of sides a convex, non-self-intersecting polygon formed from those points can have.&lt;/p&gt;&#xA;&lt;p&gt;A convex polygon is a polygon such that there is an angle strictly less than 180˚ and greater than 0˚ between each pair of consecutive sides. Note that if three points are collinear, they still only form one side. Two sides cannot have a 180˚ angle between them.&lt;/p&gt;&#xA;&lt;p&gt;The ordinate and abscissa of a coordinate are not necessarily integers, and they can be positive, negative, or zero.&lt;/p&gt;&#xA;&lt;p&gt;If there are less than 3 points, or if the points inputted cannot form a convex polygon, the program should output &lt;code&gt;0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test cases&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(0,0) (1,1) (3,4)&#xA;==&amp;gt; 3&#xA;&#xA;(0,0) (-1,-1) (5,5)&#xA;==&amp;gt; 0&#xA;&#xA;(-1,0) (1,0) (0,1) (5,5) (-5,5) (0,-5)&#xA;==&amp;gt; 3&#xA;&#xA;(-3,2) (4,6) (-1,2) (0,4) (5,-3) (-2,-2) (1,1)&#xA;==&amp;gt; 5&#xA;&#xA;(0,0) (10,0) (10,10) (9,1) (10,4) (9,6) (5,4)&#xA;==&amp;gt; 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here are pictures for the test cases, in order. Note that solutions are not necessarily unique. (Made with Geogebra)&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/na9zZ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/na9zZ.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/xr80S.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/xr80S.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/FN9rn.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/FN9rn.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Bafjy.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Bafjy.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/vZakb.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/vZakb.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43444" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-15T23:32:04.673" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8447" PostTypeId="2" ParentId="8444" CreationDate="2016-02-15T23:13:27.443" Score="3" Body="&lt;p&gt;I can't speak on behalf of the folks who voted to close your challenge, but here's my take.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The post was put on hold as &quot;too broad.&quot; The specific text doesn't make a whole lot of sense in the context of this site, but it still gives the gist:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;There are either too many possible answers, or good answers would be too long for this format. Please add details to narrow the answer set or to isolate an issue that can be answered in a few paragraphs.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Basically, the spec is too open-ended. There are too many ways to do it, especially because standard loopholes are allowed. &lt;em&gt;Standard&lt;/em&gt; loopholes are standard for a reason.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also note that the underhanded aspect is quite likely (at least partially) to blame for the downvotes. As Downgoat noted in a comment, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8325/the-state-of-the-underhanded-tag&quot;&gt;underhanded challenges have fallen out of favor&lt;/a&gt;. In my opinion, and I believe many others feel this way as well, challenges that say &quot;do X but make it look like you aren't&quot; (et cetera) aren't interesting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I hope this has been able to provide at least a little context. But don't be discouraged! I recommend posting challenges to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt; where they can get meaningful feedback prior to being posted to the main site.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-02-15T23:13:27.443" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8448" PostTypeId="2" ParentId="2140" CreationDate="2016-02-16T02:53:17.800" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The free monoid on two letters 'x' and 'y' is the set of all finite strings you can make up from them, including the empty string, with their concatenation a binary operation. So the elements of this free monoid look like this: &lt;code&gt;&quot;&quot;&lt;/code&gt;, &lt;code&gt;&quot;x&quot;&lt;/code&gt;, &lt;code&gt;&quot;y&quot;&lt;/code&gt;, &lt;code&gt;&quot;xy&quot;&lt;/code&gt;, &lt;code&gt;&quot;yx&quot;&lt;/code&gt;, &lt;code&gt;&quot;xx&quot;&lt;/code&gt;, &lt;code&gt;&quot;yy&quot;&lt;/code&gt; and so on. Strings like &lt;code&gt;&quot;xxxx&quot;&lt;/code&gt; are often written as powers and we don't generally use the quotes: &lt;code&gt;x^4&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge is about a certain binary relation on this free monoid. Suppose we decide to treat &lt;code&gt;x^2&lt;/code&gt; abd &lt;code&gt;y^2&lt;/code&gt; as &quot;the same&quot;. Which other strings (or &quot;words&quot;, as they're called) will have to become &quot;the same&quot; (or congruent under the relation &lt;code&gt;x^2 = y^2&lt;/code&gt;) as a result? In &lt;code&gt;xxy&lt;/code&gt;, we can substitute &lt;code&gt;yy&lt;/code&gt; for &lt;code&gt;xx&lt;/code&gt;, which means that &lt;code&gt;xxy&lt;/code&gt; is congruent to &lt;code&gt;yyy&lt;/code&gt;. But then, the last &lt;code&gt;yy&lt;/code&gt; in that string can be turned into &lt;code&gt;xx&lt;/code&gt; as well, so &lt;code&gt;yxx&lt;/code&gt; is congruent to the previous ones as well. A nice thing about this relation is that any congruent words will have to have the same length, so the number of words congruent to a given one is always finite. (To read up on this, you can look up things like &quot;&lt;a href=&quot;https://en.wikipedia.org/wiki/Semi-Thue_system&quot; rel=&quot;nofollow noreferrer&quot;&gt;string rewriting systems&lt;/a&gt;&quot;, &quot;&lt;a href=&quot;https://en.wikipedia.org/wiki/Transitive_closure&quot; rel=&quot;nofollow noreferrer&quot;&gt;transitive closure&lt;/a&gt;&quot;, &quot;&lt;a href=&quot;https://en.wikipedia.org/wiki/Congruence_relation&quot; rel=&quot;nofollow noreferrer&quot;&gt;congruence relation&lt;/a&gt;&quot;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Take a string as input. The string is assumed to be of any length (including the empty string) and to contain at most two different characters (chosen by the user from the printable ASCII set or equivalent), say &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt;. The program will interpret the string as a word in the free monoid on &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; and output all the other words of that monoid, also as strings, using the characters chosen by the user, congruent to the input word under the relation &lt;code&gt;x^2 = y^2&lt;/code&gt;, in any order. Every congruent word must occur exactly once, including the input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The words in the output have to be consistently separated by any non-empty string of printable characters not chosen by the user. If the input word contains less than two distinct characters, your program will assume the missing one(s) according to your choice, but that must not overlap with the separator. How exactly you want to take the input and output the words is up to you, but it must be possible to enter any valid string as input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This has to be a complete program, not a function. No loopholes please.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples of input and output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;in: empty string&#xA;out: empty string&#xA;&#xA;in: xx&#xA;out: xx yy&#xA;&#xA;in: xy&#xA;out: xy&#xA;&#xA;in: xyx&#xA;out: xyx&#xA;&#xA;in: xyy&#xA;out: xyy xxx yyx&#xA;&#xA;in: xxxx&#xA;out: xxxx yyxx yyyy yxxy xyyx xxyy&#xA;&#xA;in: xyyxy&#xA;out: xyyxy xxxxy yyxxy yyyyy xxyyy xxyxx yyyxx yxxxx yxyyx yxxyy&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(Note that the whitespace is a valid input character -- your program must choose a different separator if the user chooses to use it as a letter.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Don't worry about things like the maximal length of the input or the output. The logic of your program has to work for all input word lengths, but the program only needs to work for reasonably long inputs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please give a short explanation of why your program works.&lt;/p&gt;&#xA;" OwnerUserId="38630" LastEditorUserId="38630" LastEditDate="2016-04-27T19:59:15.227" LastActivityDate="2016-04-27T19:59:15.227" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="8449" PostTypeId="2" ParentId="8350" CreationDate="2016-02-16T03:21:46.317" Score="63" Body="&lt;h1&gt;Remove the &amp;quot;you already have an answer&amp;quot; pop-up&lt;/h1&gt;&#xA;&lt;p&gt;When you post an answer on a question where you have already posted an answer, a pop-up appears asking you if you really want to do this and encouraging you to refine your existing answer. While this makes perfect sense for Q&amp;amp;A sites, it doesn't make any sense for PPCG since answers are generally unique and standalone -- you shouldn't integrate a new solution into an existing one. It's also quite annoying (especially when posting on catalogs).&lt;/p&gt;&#xA;" OwnerUserId="45151" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-16T03:21:46.317" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8450" PostTypeId="2" ParentId="8350" CreationDate="2016-02-16T03:25:41.127" Score="18" Body="&lt;h1&gt;Remove the &amp;quot;more than 30 answers&amp;quot; pop-up, but only on the Sandbox.&lt;/h1&gt;&#xA;&lt;p&gt;When you post an answer on a question that has more than 30 answers, you get a pop-up asking you if you're sure you want to do this. This is fine for most questions but it doesn't make much sense in the context of the Sandbox, and I fear could scare new users away from posting their challenges in the Sandbox.&lt;/p&gt;&#xA;" OwnerUserId="45151" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-16T03:25:41.127" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8451" PostTypeId="1" CreationDate="2016-02-16T06:39:14.003" Score="4" ViewCount="114" Body="&lt;p&gt;I want to post a challenge where the scoring is based on complexity but I don't know a) how to define this and b) how well it would be received.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an example, say the FPU (Floating Point Unit) has been disabled and the challenge requires floating point arithmetic. If adding or subtracting two numbers is O(n) points, multiplying would be O(n&lt;sup&gt;2&lt;/sup&gt;) points and dividing would be 2O(n&lt;sup&gt;2&lt;/sup&gt;) points if bit-shifting is not included. I'm not sure if big O notation is the right way to express this, but hopefully you get the idea. So one way of implementing power x&lt;sup&gt;y&lt;/sup&gt; by just multiplying by x (y-1) times would score (y-1)O(n&lt;sup&gt;2&lt;/sup&gt;). Another method might be a lot faster/simpler.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How could I score this and should I even attempt such a thing?&lt;/p&gt;&#xA;" OwnerUserId="29560" LastActivityDate="2016-02-16T06:50:55.623" Title="How can I ask a question scored by complexity?" Tags="|discussion|asking-questions|scoring|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8452" PostTypeId="2" ParentId="8441" CreationDate="2016-02-16T06:40:34.143" Score="7" Body="&lt;p&gt;I don't know whether to post all my stuff in a single answer or as multiple, I'll just put everything here for now.  &lt;strong&gt;Things in {braces} are my comments, not part of the text.&lt;/strong&gt;  Most of this is just word/sentence replacement.  Our changes may or may not be more extensive than this.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Welcome to Programming Puzzles &amp;amp; Code Golf Stack Exchange&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Programming Puzzles &amp;amp; Code Golf is a site for hosting and participating in programming competitions. It's built and run by you as part of the &lt;a href=&quot;http://stackexchange.com/&quot;&gt;Stack Exchange&lt;/a&gt; network of Q&amp;amp;A sites.  With your help, we're working together to &lt;s&gt;build a library of programming puzzles and their solutions&lt;/s&gt; create an environment of friendly competition, open to programming enthusiasts of all skill levels {note: kinda cheesy but IDK}.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;We're a little bit different from other sites {note: this is accurate}. Here's how:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;&lt;s&gt;Ask questions, get answers, no distractions&lt;/s&gt; Compete in challenges, create your own, and have fun&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This site is all about hosting programming competitions. It's not a discussion forum or a regular Q&amp;amp;A site.  There's no chit-chat.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Just challenges...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And submissions...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Good submissions are voted up and rise to the top.  The best submissions show up first so that they are always easy to find.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The person who created the challenge can mark one submission as &quot;accepted&quot;.  Accepting &lt;s&gt;doesn't mean it's the best answer, it just means that it worked for the person who asked&lt;/s&gt; generally indicates that it is the winner of the contest.  {note: should we even mention accepted answers?}&lt;/p&gt;&#xA;&#xA;&lt;p&gt;{note: I also kinda think we should change the example question that's shown to the right, the current one has a 2-line spec.  This may be difficult if they are auto-selected.}&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;&lt;s&gt;Get answers to practical, detailed questions&lt;/s&gt; Participate in high-quality programming competitions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;{note: this section pretty much has to be completely rewritten.  I think we should replace it with something that goes into more detail about what is/isn't appropriate here.}&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;Focus on questions about an actual problem you have faced. Include details about what you have tried and exactly what you are trying to do.&lt;/s&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Focus on challenges which have detailed specifications and clear objectives.  All challenges should have an objective winning criterion, which is a well-defined way to determine which submission is the best.  {note: it might not worth our time to explain exceptions like the tips tag}&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Create posts about...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Code golf (&lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;details&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;s&gt;Programming puzzles&lt;/s&gt;&lt;/li&gt;&#xA;&lt;li&gt;Other programming contests or challenges {note: maybe include a brief list?}&lt;/li&gt;&#xA;&lt;li&gt;Certain non-challenge topics, such as tips for golfing in a specific language&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Not all challenges work well in our format. Avoid challenges that are primarily opinion-based, lack a clear objective, or that are likely to generate discussion rather than submissions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Challenges that need improvement may be &lt;s&gt;closed&lt;/s&gt; placed on hold until they are improved and reopened.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Tags make it easy to find interesting challenges&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;All challenges are tagged with their subject areas and the type of competition. Each can have up to 5 tags, since a challenge might be related to several subjects.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Click any tag to see a list of challenges with that tag, or go to the tag list to browse for topics that interest you.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;You earn reputation when people vote on your posts&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;{note: basically keeping this as-is.  Some of the s/question/challenge/gi also needs to be applied to the small image caption text.}&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your reputation score goes up when others vote up your challenges, submissions and edits.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As you earn reputation, you'll unlock new privileges like the ability to vote, comment, and even edit other people's posts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the highest levels, you'll have access to special moderation tools. You'll be able to work alongside our community moderators to keep the site focused and helpful.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Improve posts by editing or commenting&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Our goal is to have the best submissions to every challenge, so if you see challenges or submissions that can be improved, you can edit them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Use edits to fix minor mistakes, improve formatting, or clarify the meaning of a post.  Edits shouldn't be used to change the informational content of other users' posts, or to change other users' programs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Use comments to ask for more information, clarification, or to suggest improvements to posts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can always comment on your own posts. Once you earn 50 reputation, you can comment on anybody's post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Remember: we're all here to learn, so be friendly and helpful!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Unlock badges for special achievements&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;{note: nothing really to change here either}&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Badges are special achievements you earn for participating on the site. They come in three levels: bronze, silver, and gold.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In fact, you've already earned a badge:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Informed   Read the entire tour page&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Participate in an existing challenge, or create your own&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;{note:  I wonder if we could add a link to/explanation of the sandbox here}&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See new challenges Create a challenge&#xA;Looking for more in-depth information on the site? Visit the Help Center&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Programming Puzzles &amp;amp; Code Golf Stack Exchange is part of the Stack Exchange network&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Like this site? Stack Exchange is a network of 152 Q&amp;amp;A sites just like it. Check out the full list of sites.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2017-02-18T00:45:44.403" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8453" PostTypeId="2" ParentId="8451" CreationDate="2016-02-16T06:50:55.623" Score="3" Body="&lt;p&gt;We have the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt; tag, which sounds like it'd fit perfectly here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From the tag description:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Fastest-algorithm competitions are won by the answer with the smallest asymptotic time complexity. For challenges based on actual runtime, use &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; instead.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-02-16T06:50:55.623" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8456" PostTypeId="2" ParentId="2140" CreationDate="2016-02-16T09:39:34.130" Score="1" Body="&lt;h2&gt;Implement floating-point square-root with integer addition, subtraction and bit-shifts only&lt;/h2&gt;&#xA;&lt;p&gt;Someone has broken your favourite language! &lt;em&gt;Almost&lt;/em&gt; all arithmetic functions are now unusable. You've been left with integer addition, subtraction, bit-shifts (both left and right) and bitwise operators (AND, XOR, OR, NOT) only. If your language doesn't have bit-shifts you may substitute &lt;code&gt;*2^i&lt;/code&gt; or &lt;code&gt;/2^i&lt;/code&gt; for a cost of &lt;em&gt;i&lt;/em&gt; each time. You need to write an efficient square-root function because it's been proven&lt;sup&gt;[citation needed]&lt;/sup&gt; that every useful program uses square-root&lt;sup&gt;[dubious-discuss]&lt;/sup&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your function will take one number (see format below), calculate its square-root and return the result. The last binary digit may either be consistently rounded down, or rounded to closest.&lt;/p&gt;&#xA;&lt;p&gt;Rounding down:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;...0(0)  ...0&#xA;...0(1)  ...0&#xA;...1(0)  ...1&#xA;...1(1)  ...1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Rounding to closest:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;...0(0)  ...0&#xA;...0(1)  ...1&#xA;...1(0)  ...1&#xA;..01(1)  ..10, etc.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Scoring:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1: Copy an integer (any length)&lt;/li&gt;&#xA;&lt;li&gt;2: Add or Increment&lt;/li&gt;&#xA;&lt;li&gt;2: Subtract or Decrement&lt;/li&gt;&#xA;&lt;li&gt;1: Greater-than, Less-than, Equal-to, etc.&lt;/li&gt;&#xA;&lt;li&gt;1: Check a bit&lt;/li&gt;&#xA;&lt;li&gt;1: Write a bit&lt;/li&gt;&#xA;&lt;li&gt;1: Bit-shift (left or right) by 1&lt;/li&gt;&#xA;&lt;li&gt;2: Bitwise operator (AND, XOR, OR, NOT)&lt;/li&gt;&#xA;&lt;li&gt;n x (code + condition): Do-While&lt;/li&gt;&#xA;&lt;li&gt;n x condition + (n - 1) x code: While (For can be implemented as While)&lt;/li&gt;&#xA;&lt;li&gt;0 (free): Jump to start or end of loop&lt;/li&gt;&#xA;&lt;li&gt;0 (free): Jump to start of function&lt;/li&gt;&#xA;&lt;li&gt;0 (free): Return from function&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Since different languages use different number formats, the format used for scoring this challenge is as follows: 8 bits for the exponent, 32 bits for the mantissa. You don't have to use these lengths internally, just assume this is what it is for scoring purposes.&lt;/p&gt;&#xA;&lt;p&gt;There will be no negative numbers or zero in the input, nor will you have to store a value of &lt;code&gt;0.0&lt;/code&gt;. Since the square root function always produces a number closer to 1, you don't need to worry about overflow or underflow. The Most Significant Bit of the mantissa will always be 1.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All floating point numbers will be stored and passed around as two unsigned integers, &lt;em&gt;m&lt;/em&gt; and &lt;em&gt;e&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;B&lt;sub&gt;m&lt;/sub&gt;&lt;/em&gt; and &lt;em&gt;B&lt;sub&gt;e&lt;/sub&gt;&lt;/em&gt; are the number of bits in &lt;em&gt;m&lt;/em&gt; and &lt;em&gt;e&lt;/em&gt; respectively&lt;/li&gt;&#xA;&lt;li&gt;The value of the number is given by&#xA;2&lt;sup&gt;(&lt;em&gt;e&lt;/em&gt;-&lt;em&gt;B&lt;sub&gt;m&lt;/sub&gt;&lt;/em&gt;-2&lt;sup&gt;&lt;em&gt;B&lt;sub&gt;e&lt;/sub&gt;&lt;/em&gt;-1&lt;/sup&gt;)&lt;/sup&gt;&lt;em&gt;m&lt;/em&gt; or &lt;code&gt;2^(e-Bm-2^(Be-1))*m&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;In your code &lt;em&gt;B&lt;sub&gt;m&lt;/sub&gt;&lt;/em&gt; must be ≥ 32 and &lt;em&gt;B&lt;sub&gt;e&lt;/sub&gt;&lt;/em&gt; must be ≥ 8&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The code will be scored assuming that &lt;em&gt;B&lt;sub&gt;m&lt;/sub&gt;&lt;/em&gt; = 32 and &lt;em&gt;B&lt;sub&gt;e&lt;/sub&gt;&lt;/em&gt; = 8, so no penalty will be given if your code uses larger values.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; exponent   MSB          mantissa           LSB    decimal&#xA;[01111110] [10000000 00000000 00000000 00000000]   0.125&#xA;[01111111] [10000000 00000000 00000000 00000000]   0.25&#xA;[10000000] [10000000 00000000 00000000 00000000]   0.5&#xA;[10000001] [10000000 00000000 00000000 00000000]   1&#xA;[10000001] [10100000 00000000 00000000 00000000]   1.25&#xA;[10000010] [10000000 00000000 00000000 00000000]   2&#xA;[10000010] [11000000 00000000 00000000 00000000]   3&#xA;[10000011] [11100000 00000000 00000000 00000000]   7&#xA;[10000100] [10000000 00000000 00000000 00000000]   8&#xA;[10000100] [10010000 00000000 00000000 00000000]   9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Please include a version number for ease of reference. If you know the name of your method, please include it too, e.g. &amp;quot;Brute force&amp;quot;, &amp;quot;Trial and error&amp;quot;, etc. Increase the major number if your score changes, otherwise increase the minor number if your score is the same, e.g:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;v1.0: Perl, Brute force - 108&lt;br /&gt;&#xA;v1.1: Perl, Brute force - 108&lt;br /&gt;&#xA;v1.2: Perl, Brute force - 108&lt;br /&gt;&#xA;v2.0: Perl, Brute force - 95&lt;br /&gt;&#xA;v2.1: Perl, Brute force - 95&lt;br /&gt;&#xA;v3.0: Perl, Brute force - 93&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is &lt;strong&gt;not&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so you will be scored on the efficiency of your algorithm. If more than one answer is equally efficient, the oldest one will be in the lead. If editing your answer reduces your score, it also resets your time. The time is taken from your last minor version 0.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I'll probably need some fair test values that don't allow tuning for specific numbers.&lt;/p&gt;&#xA;&lt;p&gt;Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="29560" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-19T01:14:05.397" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="8459" PostTypeId="1" CreationDate="2016-02-16T16:22:14.740" Score="12" ViewCount="231" Body="&lt;p&gt;I have an idea about a code-golf challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Will I need to verify/test every answer submitted ?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Will I need to run code submitted to be sure that the answer meets the requirements ?&lt;/p&gt;&#xA;" OwnerUserId="51347" LastEditorUserId="8478" LastEditDate="2016-02-16T16:32:57.480" LastActivityDate="2016-02-17T13:35:23.233" Title="Do I have to verify all answers?" Tags="|discussion|code-golf|answers|asking-questions|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8460" PostTypeId="2" ParentId="8459" CreationDate="2016-02-16T16:28:52.327" Score="12" Body="&lt;p&gt;For code golf, you don't &lt;em&gt;have to&lt;/em&gt; verify the answers yourself. Verifying all of them personally could be time-consuming or downright unfeasible (after all, not all languages are free and run on all platforms), so you can rely on the community to do this for you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This will become a lot easier if:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The question has a clearly established validity criterion.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The question has test cases.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;It is generally expected that the original poster (OP) will make a final decision in some corner cases. For this purpose, other users generally post comments like &lt;em&gt;This answer does X but the question says Y. Is that allowed?&lt;/em&gt; and await a ruling from the OP.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that other types of challenges (in particular, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;) may require a lot more involvement from the OP.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2016-02-17T13:35:23.233" LastActivityDate="2016-02-17T13:35:23.233" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8461" PostTypeId="2" ParentId="8459" CreationDate="2016-02-16T16:31:01.420" Score="20" Body="&lt;p&gt;In an ideal world, you would. Practically, you normally can't — a) because of people using proprietary languages, b) because you might get many dozens of answers. Many answers will include a link to an online tester, especially those written in esolangs or golfing language specifically (but others also sometimes include links to ideone, or JavaScript answers might be runnable right there in a Stack Snippet). In that case, there's not really an excuse for not testing them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But what about the rest? Focus on the most important answers. If you are planning to accept an answer &lt;em&gt;make sure that it meets the spec by testing it&lt;/em&gt;. That normally means you just need to test the shortest submission — and if that turns out to be invalid, move on to the next shortest. In case you're unable to test the currently leading submission, you can still rely on the community to test it for you. &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;E.g. you could pop into chat&lt;/a&gt; and ask whether someone would be able to test the code in question. Usually &lt;em&gt;someone&lt;/em&gt; will be able to run the language. (Unless it's TinyMUSH...)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition to the answer you want to accept, you (and ideally everyone else) should make sure any answer works before even &lt;em&gt;upvoting&lt;/em&gt; it. (Unfortunately, this is far from reality... I've seen answers get a bronze badge before anyone noticed it didn't meet the spec.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-02-16T16:31:01.420" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8463" PostTypeId="1" AcceptedAnswerId="8464" CreationDate="2016-02-16T19:11:15.240" Score="18" ViewCount="766" Body="&lt;p&gt;We occasionally have challenges which consist of multiple separate subchallenges, whose individual scores are simply combined at the end. These are often known as &quot;golf courses&quot;. While these are often quite popular they do have some problems. Mainly it's not clear how we should deal with people copying one of the subchallenges from another answer, and how these should be treated in the context of partial duplicates. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore: are these actually a good fit for our community, should we change the way we run these contests or should they be outright disallowed?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We might want to distinguish between multi-part challenges where the individual parts strongly affect each other and challenges where they are mostly orthogonal.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-04-20T16:02:30.393" Title="Should multi-part challenges be allowed?" Tags="|discussion|scope|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8464" PostTypeId="2" ParentId="8463" CreationDate="2016-02-16T19:11:15.240" Score="22" Body="&lt;p&gt;As I said in the question, I think we need to distinguish several cases here. (This post got a bit long. There's a summary at the bottom, but if you disagree with it, I'd appreciate if you took the time to read my arguments as well and bring up your position in comments or a separate answer.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Subchallenges without any interaction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;These are the plain &quot;golf courses&quot;. They pose a number of (usually small) challenges which have to be solved and the final result is the sum of all individual scores. I think &lt;strong&gt;these should be strictly disallowed&lt;/strong&gt;, because they have some severe problems (touched upon in the question):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;They are essentially immune to being closed as duplicates, because you could theoretically mash up any N challenges we've done before and who's to say it's a duplicate of any of them? What if you mash up N-1 and add one new challenge? What if there are two such challenges that overlap in half their subchallenges? Despite not being a Q&amp;amp;A site, PPCG is still built on Q&amp;amp;A software, and one of the main principle on other SEs is that one post should ask a single question. Since these multi-part challenges don't follow this principle they circumvent some of the quality control mechanism that are in place on SE.&lt;/li&gt;&#xA;&lt;li&gt;They end up with people copying better parts from other answers, so it's much harder to determine a winner. And it's hard to prevent this, because eventually you might glance at another answer and see a much better approach, and the only alternative to using it is locking in that part of your answer, because all your own approaches will probably be strongly influenced by it. This also means, someone can just pick the best parts from all existing answers and make a new winning answer. Probably unpopular, but in no way illegal with our current policies.&lt;/li&gt;&#xA;&lt;li&gt;The main question is, why didn't you ask these as N separate challenges in the first place? I can think of three possible answers to that:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&quot;We'd already done some of them before.&quot; See the first bullet point.&lt;/li&gt;&#xA;&lt;li&gt;&quot;These are too trivial to be interesting on their own.&quot; But does throwing together several trivial problems make them any less trivial and more interesting? Posting small and very simple challenges isn't necessarily bad as long as they still leave &lt;em&gt;some&lt;/em&gt; room for creativity (at least in harder-to-use languages). If a subchallenge is too trivial even for that, putting it together with several others isn't going to improve it.&lt;/li&gt;&#xA;&lt;li&gt;&quot;These challenges are closely related and follow a common theme.&quot; But that doesn't mean you can't split them up into several posts, such that answers to each subchallenge can still receive independent votes, the challenges can be put on hold if necessary and they can be used as dupe targets for other challenges. You can still create an overall leaderboard and maybe reward the overall winner with a bounty. Examples of this type of multi-challenge series are Optimizer's &lt;a href=&quot;https://codegolf.stackexchange.com/q/50484/8478&quot;&gt;ASCII Art of the Day&lt;/a&gt; and my own &lt;a href=&quot;https://codegolf.stackexchange.com/q/45302/8478&quot;&gt;Random Golf of the Day&lt;/a&gt;. The first challenge in the series can act as a hub to the rest, so that someone interested in it, can still easily find all the parts.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Subchallenges with little interaction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is actually the most common form of multi-part challenge. The very first &lt;a href=&quot;https://codegolf.stackexchange.com/q/16707/8478&quot;&gt;9 Hole Challenge&lt;/a&gt; penalised reuse of languages, Dennis's &lt;a href=&quot;https://codegolf.stackexchange.com/q/52152/8478&quot;&gt;First code golf decathlon&lt;/a&gt; prohibited it entirely and gave out points for being the best for each task or language, Mego's &lt;a href=&quot;https://codegolf.stackexchange.com/q/63014/8478&quot;&gt;The Interview: The Front Nine&lt;/a&gt; required all answers to be in the same language. I don't think this is sufficient to warrant squeezing all the subchallenges into a single post. It still has the first two problems from above. While you can't copy any other answer, once enough people have answered, someone could still come along and reduce the challenge to an optimisation problem of which existing subanswers to combine for the best overall score. Moreover if you want to determine an overall winner based on subchallenge winners and per-language winners you can still do that with a custom leaderboard and multiple challenge posts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main point is that the total set of answers you'll get for the subchallenges isn't in any way different from the set of answers you'd get if these were asked separately. Therefore, they don't add any value for the content of the site (when compared with posting them separately). &lt;strong&gt;These should still be disallowed.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd also put Calvin's Hobbies' &lt;a href=&quot;https://codegolf.stackexchange.com/q/60475/8478&quot;&gt;Cramming The Gramming - Twelve Task Tweet&lt;/a&gt; in this category since the optimal solution is still to golf each subtasks individually and then simply count how many of them fit into the byte limit 140.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Subchallenges with strong interaction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;These are challenges where the solutions the individual parts are strongly linked. For example Dennis's &lt;a href=&quot;https://codegolf.stackexchange.com/q/57963/8478&quot;&gt;Overcoming cluster size&lt;/a&gt; asked for a &lt;em&gt;polyglot&lt;/em&gt; within a size limit that solved as many tasks as possible. jimmy23013's &lt;a href=&quot;https://codegolf.stackexchange.com/q/50537/8478&quot;&gt;Print strings without sharing characters&lt;/a&gt; disallowed reusing &lt;em&gt;characters&lt;/em&gt; between multiple parts (I feel like we've had a similar challenge with a finite set of tasks instead of trying to get as many words as possible, but I can't find it). This would also include challenges where substantial amounts of code can be reused between multiple subtasks (e.g. because it's one program solving N closely related tasks).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think &lt;strong&gt;these are fine&lt;/strong&gt; because the separate solutions strongly affect each other. You can't just solve each part individually, nor can you combine the best sub-solutions from existing answers, because they likely won't fit together under the given rules. Separating them out into separate challenges would either be impossible or completely change the answers you get.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;They still have one problem though: the concept of duplicates. I can ask such a challenge with concept X and N challenges. Now the next person can ask another such challenge with the same concept but a different set of challenges. That may seem fine, but again what do we do if half the subchallenges are the same? Do we really want every possible multi-part restriction applied to every possible subset of challenges? In these cases, we can probably assume that it's concept X that makes the challenge, not the N subtasks. While the specific tasks will of course change the actual solutions, and maybe also to some degree the nature of how subsolutions are combined, the core of the challenge will always be the restriction that links the subparts. Therefore, these challenges should be judged on their overall concept, not the particular subtasks chosen. When another challenge gets asked with the same concept but different challenges, I'd argue that this different set of challenges would have to &lt;em&gt;significantly&lt;/em&gt; affect how the challenge can be approached on a large scale, otherwise they should be closed as duplicates.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;In Summary&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Combining multiple tasks into a challenge without any interaction should be disallowed. If the subtasks are actually interesting, ask them separately.&lt;/li&gt;&#xA;&lt;li&gt;If there is only small interaction, mainly related to restrictions, penalties or bonuses for the choice of languages, these still have the same problems and should be disallowed.&lt;/li&gt;&#xA;&lt;li&gt;If there is strong interaction between them, these could actually add something interesting to the site and should be allowed. However, duplicates should be determined based on the nature of the interaction not of the chosen subchallenges, unless these actually affect possible approaches to the challenge at large.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The distinction between the last two cases is of course not always clear cut and will require human judgement. As rules of thumb we can ask the following questions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is it optimal to solve each subtask individually and combine them into one answer? (Potentially subject to language restrictions.)&lt;/li&gt;&#xA;&lt;li&gt;Can someone come along (after enough answers have been posted to make language restrictions irrelevant) and mix and match subtasks from existing answers to obtain a competitive score?&lt;/li&gt;&#xA;&lt;li&gt;Would the &lt;em&gt;set&lt;/em&gt; of answers for the subtasks be any different if these subtasks were posted as separate challenges?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-02-17T08:01:16.067" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8466" PostTypeId="2" ParentId="8389" CreationDate="2016-02-16T23:50:55.353" Score="3" Body="&lt;p&gt;Based on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8389/lets-make-more-ads-for-our-site-2016-edition?cb=1#comment23642_8397&quot;&gt;Martin's comment&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/V1guB.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/V1guB.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please pardon my terrible graphic design skills, but you get the point. If this gets chosen someone with better artistic talents can redesign it.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Edit:  PhiNotPi and his trusty steed, Gimpy, are here to save the day.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/KCq6r.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/KCq6r.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="36670" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-02-17T01:12:25.477" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="8468" PostTypeId="2" ParentId="2140" CreationDate="2016-02-17T01:53:37.890" Score="0" Body="&lt;h1&gt;Plotting Dynamical Systems in ASCII&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A Function to and from the real plane (henceforth R2) , call it &lt;code&gt;F&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A point in R2 that is to be the center of a disk, call it &lt;code&gt;c&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A radius, call it &lt;code&gt;r&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;An integer representing the number of iterations to be performed, call it &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are to output &lt;code&gt;n+1&lt;/code&gt; ascii &quot;images&quot;. The first depicts the disk &lt;code&gt;D&lt;/code&gt; (with center &lt;code&gt;c&lt;/code&gt; and radius &lt;code&gt;r&lt;/code&gt;) and the &lt;em&gt;i&lt;/em&gt;th image depicts &lt;code&gt;F^i(D)&lt;/code&gt;, aka &lt;code&gt;F(...F( F(D) )...)&lt;/code&gt; where we have applied &lt;code&gt;F&lt;/code&gt; to &lt;code&gt;D&lt;/code&gt;, and then applied &lt;code&gt;F&lt;/code&gt; to &lt;code&gt;F(D)&lt;/code&gt; and so on until we have applied &lt;code&gt;F&lt;/code&gt; &lt;em&gt;i&lt;/em&gt; times.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input Details&lt;/strong&gt;:  &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;F&lt;/code&gt; will always be polynomial. See below for acceptable examples. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Any &lt;code&gt;c = (c1,c2)&lt;/code&gt; given will satisfy &lt;code&gt;|c1|&amp;lt;50&lt;/code&gt; and &lt;code&gt;|c2|&amp;lt;25&lt;/code&gt;. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Also, &lt;code&gt;r&lt;/code&gt; will always be small enough that &lt;code&gt;D&lt;/code&gt; the disk around &lt;code&gt;c&lt;/code&gt; with radius &lt;code&gt;r&lt;/code&gt; will contain no points with an &lt;code&gt;x&lt;/code&gt; coordinate greater than 55 or less than -55 and no &lt;code&gt;y&lt;/code&gt; coordinate greater than 32 or less than -32.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;n&lt;/code&gt; will be positive and less than 5. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output Details&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;We will be looking at a rectangular subset of R2 given by &lt;code&gt;{ (x,y) : -60 &amp;lt;= x &amp;lt;= -60 and -33 &amp;lt;= y &amp;lt;= 33}&lt;/code&gt;. i.e. a rectangle with side lengths 120 and 66 centered at the origin. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each output image will contain 320*320 characters. This represents the above region in R2 with gradations of 0.5 along each axis. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each character will represent a single point in R2. For example if we just look at part of the first quadrant (with the axes labeled which you need not do)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;      y&#xA;      ^&#xA;      |&#xA;      .............................&#xA;    7 .............................&#xA;      .............................&#xA;    6 .............................&#xA;      .............................&#xA;    5 .............................&#xA;      .............................&#xA;    4 ............................&#xA;      .............................&#xA;    3 .............................&#xA;      .............................&#xA;    2 .....................b.......     b =(10.5,2)&#xA;      .............................&#xA;    1 ..a..........................     a = (1,1)&#xA;      .............................     z = (0,0)&#xA;    0 z............................  --------&gt; x &#xA;      0 1 2 3 4 5 6 7 8 9 | | | | |  &#xA;                        10| 12| 14&#xA;                          11  13&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Points that are empty (i.e. not in &lt;code&gt;F^n(D)&lt;/code&gt;) will be represented by the &lt;code&gt;.&lt;/code&gt; character, whereas filled spaces will be represented by &lt;code&gt;#&lt;/code&gt;. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each image will have the same or fewer &lt;code&gt;#&lt;/code&gt; represented points in it because we will not be displaying points that are outside the region. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;How do these maps work?&lt;/strong&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;These are iterative maps we will be dealing with. For each point &lt;code&gt;#&lt;/code&gt; in a given image, to get the next image, you will apply the given map &lt;code&gt;F&lt;/code&gt; to it. If the point leaves the viewing area, you need not render it. However if in a later iteration it should reenter the viewing area, it should reappear. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the purposes of this challenge, the image of a point should be rounded to the nearest 0.5. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;A map might be &lt;code&gt;F(x,y) = (4x(1-x), x+y)&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="45459" LastActivityDate="2016-02-17T01:53:37.890" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8469" PostTypeId="2" ParentId="2140" CreationDate="2016-02-17T02:21:56.270" Score="0" Body="&lt;h1&gt;Implement an SR NOR latch with Life-like rules&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In Conway's Game of Life, there exist &lt;a href=&quot;http://www.conwaylife.com/wiki/OTCA_metapixel&quot; rel=&quot;nofollow noreferrer&quot;&gt;meta-pixels&lt;/a&gt; that can have any Life-like rule. Consequently, it is possible to simulate Conway's Game of Life with itself. It is also possible to build circuit-like structures, such as wires and logic gates by mixing together different Life-like rules in the right ways.&lt;/p&gt;&#xA;&lt;p&gt;For example, one can simulate wires with three Life-like rules: B/S, B1/S, and B2/S (where the original Game of Life has the rule B3/S23). In the gif below, which shows one way to cross parallel wires, these rules are black, blue/cyan, and green/yellow, respectively.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://goo.gl/qPSNQ8&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/hBQx5.gif&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Building such circuit components is a fun challenge, and I encourage you to try a couple logic gates, like AND or OR.&lt;/p&gt;&#xA;&lt;h2&gt;The Task&lt;/h2&gt;&#xA;&lt;p&gt;Your task is to construct an SR NOR latch, the most fundamental latch in circuitry. From &lt;a href=&quot;https://en.wikipedia.org/wiki/Flip-flop_(electronics)#SR_NOR_latch&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/LW0Wf.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/LW0Wf.gif&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If there is no signal on either R or S, leave the outputs unchanged.&lt;/li&gt;&#xA;&lt;li&gt;If there is a signal on R (reset), the Q output turns off and the Qbar output turns on.&lt;/li&gt;&#xA;&lt;li&gt;If there is a signal on S (set), the Qbar output turns off and the Q output turns on.&lt;/li&gt;&#xA;&lt;li&gt;You may safely assume you will never get a signal on both R and S at the same time.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Now, I used the word &lt;em&gt;signal&lt;/em&gt; repeatedly because there are different ways to do wires. You can use the B1/S + B2/S combination shown above (blue and green, respectively), or you can use a B1/S12 rule like this:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/pPluq.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/pPluq.gif&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;These methods and others have their advantages and disadvantages. This is part of the challenge.&lt;/p&gt;&#xA;&lt;h2&gt;The Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If periodic input/output is chosen, then the output should have the same period as the input. As one of the output wires will always be &amp;quot;on&amp;quot;, the output from this should be periodic and infinite (like a glider gun, say).&lt;/li&gt;&#xA;&lt;li&gt;You may assume that periodic signals are given with a period greater than the time it takes for the latch to flip.&lt;/li&gt;&#xA;&lt;li&gt;Steady input must be succeeded by steady output.&lt;/li&gt;&#xA;&lt;li&gt;You may not make the field toroidal in any way, except for demonstration, like the wire crossing example above. This is intended to disallow cheating by wrapping vertically so no wire crossing is needed.&lt;/li&gt;&#xA;&lt;li&gt;If the circuitry is periodic, you may assume the input signal arrives at the most convenient time.&lt;/li&gt;&#xA;&lt;li&gt;Initially, the Q output should be off and the Qbar output should be on.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Precise details on how to weight these is to be determined.&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Fewer rules is better. The wire crossing example above has three rules: B/S for black, B1/S for blue, and B2/S for green.&lt;/li&gt;&#xA;&lt;li&gt;Smaller is better. Area will be considered, as in the minimum bounding box needed to contain all necessary pixels that are not part of a wire. For instance, the wire crossing example above has a bounding box that is 4 pixels wide (the tips of the wires - where there is a blue cell without a green sheath - are not included) and 9 pixels high, for a total area of 36 pixels.&lt;/li&gt;&#xA;&lt;li&gt;Faster is better. For this, count the number of generations from when the input arrives to when a fully formed output leaves. For the example above, this would be 9 units of time. Here is a gif of those 9 generations, including the one before.&lt;br /&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/VToGB.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/VToGB.gif&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Lower latency is better. I define this to be the number of generations after a fully formed output leaves until the system has either stopped evolving or settled into a periodic pattern. The example above would have a latency of 2 generations. For periodic patterns, &amp;quot;settled&amp;quot; is defined to be when the system reaches the first pattern &lt;em&gt;that will be repeated&lt;/em&gt; (the start of the cycle).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Note: I strongly recommend using &lt;a href=&quot;http://play.starmaninnovations.com/varlife/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Variations of Life&lt;/a&gt; for this.&lt;/h3&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Additional clarifications needed?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12914" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-21T01:30:53.743" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8471" PostTypeId="1" CreationDate="2016-02-17T04:29:58.233" Score="8" ViewCount="382" Body="&lt;p&gt;When writing challenges involving integer I/O, I always find myself having to type the same thing: &lt;code&gt;You may assume that the input and output will not exceed the maximum representable range in your language&lt;/code&gt;. I think it would be useful if we had a default for integer ranges in challenges, to avoid needing the same text in every challenge (&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/27634574#27634574&quot;&gt;and if chat stars are anything to go by, I'm not alone in this&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we have a default integer range? If so, what should it be?&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2018-01-19T09:18:03.903" Title="Integer range defaults for challenges" Tags="|discussion|defaults|" AnswerCount="4" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8472" PostTypeId="2" ParentId="8471" CreationDate="2016-02-17T04:37:56.557" Score="0" Body="&lt;h1&gt;The I/O should not result in a value exceeding the language's representable number range&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(What you stated)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Keep &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default/8245#8245&quot;&gt;this loophole&lt;/a&gt; in mind.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;Number&quot; is defined as the most &quot;basic&quot; (or default) numeric &quot;type&quot; the language uses (e.g. JavaScript's floats, C's &lt;code&gt;int&lt;/code&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the default numeric type has no limit then there is no limit to the I/O integers until the system runs out of memory. (e.g. Python's numbers).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, as @Nbz stated in his answer. Unnecessary or purposeful code to minimize the range of valid inputs should be prohibited &lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-04-01T22:10:23.943" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="8473" PostTypeId="2" ParentId="8471" CreationDate="2016-02-17T04:38:14.710" Score="2" Body="&lt;p&gt;I think this is a good idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For one, it saves challenge authors a lot of work. Not only that, but it potentially lowers the barrier to entry for newer challenge authors would wouldn't have thought to consider that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8245/20469&quot;&gt;standard loophole&lt;/a&gt; that would help to guard against abuse of this default.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would propose that the default upper and lower bounds be the bounds on what's representable in a single signed numeric value (integer or float) in the given language.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-02-17T05:10:40.687" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8474" PostTypeId="1" CreationDate="2016-02-17T05:10:04.863" Score="82" ViewCount="2253" Body="&lt;p&gt;The sandbox post is really just a question which we use as a system to review posts (which is great and all), but wouldn't it be great if there could be like a &lt;em&gt;dedicated review queue&lt;/em&gt; for Sandbox Post? Nobody made one so I took it upon myself to make one! After days and hours of work, I've finished up the viewer!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Well I've got the next best thing, a PPCG Sandbox Viewer! &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Screenshots&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You're probably saying show me the damn viewer already so here some screenshots:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/0xPsi.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/0xPsi.png&quot; alt=&quot;PPCG Viewer&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; The buttons and links all change color depending on the SE site you open it from. This was opened on PPCG w/ the graduation userscript&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's a GIF demonstrating it's use:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/JIxbu.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/JIxbu.gif&quot; alt=&quot;GIF on Sandbox Viewer&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Features&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;What does it do? Quite a bit actually:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;See your sandboxed Posts&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;See the score breakdown&lt;/li&gt;&#xA;&lt;li&gt;See your posts latest activity&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;See comments on your posts&lt;/li&gt;&#xA;&lt;li&gt;Review posts from the viewer&lt;/li&gt;&#xA;&lt;li&gt;Upvote / Downvote posts&lt;/li&gt;&#xA;&lt;li&gt;See / Expand posts comment threads&lt;/li&gt;&#xA;&lt;li&gt;Leave comments &lt;em&gt;from&lt;/em&gt; the sandbox viewer&lt;/li&gt;&#xA;&lt;li&gt;The sandbox button lights up when a new sandbox posts is added&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Have a feature request? Leave one! I really don't know what else to add&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Download&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Convinced it's awesome? Download it!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;&lt;a href=&quot;https://github.com/vihanb/PPCG-SandboxViewer/raw/master/viewer.v2.user.js&quot; rel=&quot;nofollow noreferrer&quot;&gt;Install It!&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;h3&gt;&lt;a href=&quot;https://github.com/vihanb/PPCG-SandboxViewer/raw/master/gm_viewer.v2.user.js&quot; rel=&quot;nofollow noreferrer&quot;&gt;Installation link for Firefox (GreaseMonkey)&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;* &lt;a href=&quot;https://github.com/vihanb/PPCG-SandboxViewer&quot; rel=&quot;nofollow noreferrer&quot;&gt;Don't forget to star&lt;/a&gt; :3&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a userscript, so make sure you have TamperMonkey (Now works on Firefox / GreaseMonkey!) installed and it should prompt you to install it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;How do I use it?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This adds a little sandbox button to the header.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/egfnW.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/egfnW.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Click the &lt;code&gt;x&lt;/code&gt; in the top-right corner of the viewer to exit it.&lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="66833" LastEditDate="2021-04-22T14:48:32.803" LastActivityDate="2023-08-22T15:15:52.363" Title="Introducing the PPCG Sandbox Viewer™" Tags="|discussion|sandbox|userscript|" AnswerCount="12" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="8475" PostTypeId="2" ParentId="2140" CreationDate="2016-02-17T08:33:29.230" Score="4" Body="&lt;h2&gt;Temperature in a line of rooms&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You have a line of rooms that are different temperatures.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;      1       2       3  &#xA; 1.2  |  3.5  |  4.0  |  3.7&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The doors between adjacent rooms start out closed. When you open a door, the now-connected rooms average out their temperatures. For example, opening door 2 gives&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;      1       2       3   &#xA; 1.2  |  3.75 _  3.75  |  3.7&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then, opening door 1 equalizes the first three rooms to their average (1.2+3.75+3.75)/3 = 2.9&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;      1       2       3   &#xA; 2.9  _  2.9 _  2.9  |  3.7&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Finally, if we close door 2 and then open door 3, the last two rooms will average out without affecting the other rooms.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;      1       2       3   &#xA; 2.9  _  2.9 |  3.3  _  3.3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You can think of the instructions to open and close doors as a sequence of toggles that switch between open and closed, here &lt;code&gt;2, 1, 2, 3&lt;/code&gt;, with the doors starting closed. Given the initial temperatures of the rooms and the sequence of door toggles, output the final temperatures. Fewest bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A list of initial room temperatures, which are positive reals. There will be at least two rooms.&lt;/li&gt;&#xA;&lt;li&gt;(Optional) The number of rooms n.&lt;/li&gt;&#xA;&lt;li&gt;A list of doors to toggle in order, which range from 1 to &lt;code&gt;n-1&lt;/code&gt;. Optionally, these may be zero-indexed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt; The list of final room temperatures to some reasonable precision.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TODO: Test cases.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2016-02-17T08:42:39.720" LastActivityDate="2016-02-17T08:42:39.720" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8476" PostTypeId="2" ParentId="8474" CreationDate="2016-02-17T09:30:10.443" Score="11" Body="&lt;h2&gt;Feature request: Sandbox Notification&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Make the sandbox icon in the super collider show a notification when there's a new sandbox post since the last time you clicked it (much like the reputation icon next to it when you've only received a badge and it turns green... could be a different colour though... sand-coloured maybe).&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="34718" LastEditDate="2016-12-12T17:23:28.583" LastActivityDate="2016-12-12T17:23:28.583" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8477" PostTypeId="2" ParentId="5243" CreationDate="2016-02-17T10:08:14.687" Score="15" Body="&lt;h2&gt;500 to 2000 rep for a quine in Hexagony&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are two ways to write a quine in &lt;a href=&quot;https://github.com/mbuettner/hexagony&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hexagony&lt;/a&gt; (which will probably result in very different solutions). The former is clearly the golfier version but the other one would be a lot neater. I'll give a 500 rep bounty to the first person who manages to write either of those:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;s&gt;One program which is a quine when written most compactly, without whitespace and without unnecessary no-ops at the end (no-ops to pad the grid to the correct side-length are fine). (&lt;a href=&quot;https://codegolf.stackexchange.com/a/74294/8478&quot;&gt;I have written one in the meantime&lt;/a&gt; but I'm happy to be beaten. You'll have to beat it at least by one side-length to qualify for the full bounty though.)&lt;/s&gt; This one has been awarded to &lt;a href=&quot;https://codegolf.stackexchange.com/a/155431/8478&quot;&gt;Jo King's quine&lt;/a&gt;.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;s&gt; I, (Jo King), will pass the 500, as well as 500 of my own rep to an even shorter quine. Again, you'll have to beat it by at least one side length to qualify (though a quine of the same side length that employs a sufficiently different algorithm may also qualify).&lt;/s&gt; The bounty has been claimed (in record time too!) by &lt;a href=&quot;https://codegolf.stackexchange.com/a/156271/76162&quot;&gt;user202729's size 11 answer&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Since the shortest Hexagony quine is now of &lt;a href=&quot;https://codegolf.stackexchange.com/a/193220/76162&quot;&gt;side length 10&lt;/a&gt;, I (Jo King) will be awarding a bounty of 1000 for a shorter quine that beats it by at least 11 bytes (i.e. one row of the hexagon). If you can't quite get it that short, I will still award a 500 rep bounty for a side length 10 that uses a sufficiently novel algorithm. If you manage to golf another side length I will award 2000 rep (and my undying adoration)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;One program which is a quine when laid out nicely in a hexagon as usual, without a column of leading spaces and without any trailing spaces on the lines. There may be an optional trailing linefeed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There should be some effort to golf the solution. And of course, the empty program is not a valid quine (I don't think there are any other possible cheats in Hexagony).&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="76162" LastEditDate="2019-10-28T04:48:29.593" LastActivityDate="2019-10-28T04:48:29.593" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="8478" PostTypeId="2" ParentId="2140" CreationDate="2016-02-17T13:53:26.313" Score="1" Body="&lt;h1&gt;Compress by Replacement &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;You are to take an input string, and then turn it into another string with a list of replacements which would turn this new string into the input string. The catch is that you must output the smallest such alternate string + list of replacements you can.&lt;/p&gt;&#xA;&lt;p&gt;The input string will be restricted to the following characters (Please note there is a space at the end and that semicolons are not allowed):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ!&amp;quot;#$%&amp;amp;()*+,-./:&amp;lt;=&amp;gt;?@[]^_`{|}~ &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The way the output is formatted is&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;CompressedString;tofind;toreplace;tofind;toreplace;...&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;An example output is&#xA;&lt;code&gt;111222;1;abcd;2;efgh&lt;/code&gt; which outputs &lt;code&gt;abcdabcdabcdefghefghefgh&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;The replacement rules are applied in the order they are shown in the output to avoid ambiguity.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, if one were to input &lt;code&gt;abcdabcdabcdefghefghefgh&lt;/code&gt; (which has a length of 24). Then the output would be &lt;code&gt;111222;1;abcd;2;efgh&lt;/code&gt; with a length of 20 which is the shortest possible output for this input&lt;/p&gt;&#xA;&lt;p&gt;Some other notes:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The replacement rules are restricted to the same character set that the input has. This means that if the input contained every possible letter except for the character &lt;code&gt;h&lt;/code&gt;, then your replacement rule would only work if the &lt;code&gt;tofind&lt;/code&gt; part of the rule is &lt;code&gt;h&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;There may be situations where the input string is the shortest possible output, this is fine&lt;/li&gt;&#xA;&lt;li&gt;The program doesn't have to be computationally efficient, as long as it does calculate the correct answer when it finishes, then it is valid&lt;/li&gt;&#xA;&lt;li&gt;There are also occasionally multiple correct answers, any solution which has the smallest possible count is valid and you only need to output one solution, not all the valid solutions&lt;/li&gt;&#xA;&lt;li&gt;The semicolons are included in the character count for the output&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Some test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;'abcdabcdabcdabcdefghefghefghefgh' -&amp;gt; '11110000;1;abcd;0;efgh' or '00001111;1;efgh;0;abcd'&#xA;'this is a test. this is a test.' -&amp;gt; '0 0;0;this is a test.'&#xA;'there is no shortening in this one' -&amp;gt; 'there is no shortening in this one'&#xA;'01001001010100101010110101010101010110101010' -&amp;gt; '202030321332130;3;222;2;01' or '22331131210113;3;212;2;010' or '22212233230132;3;121;2;010' or '223233133301132;3;21;2;010' or '222323133310133;3;12;2;010' or '020203031332132;3;222;2;10'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is codegolf, so shortest answer in bytes wins&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox notes:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This takes a long time to brute force for anything longer than 40 characters with repeated substrings, so it may take a while for brute forced solutions to verify they are correct. Because of this, I was thinking this question might be better proposed as a &amp;quot;best algorithm&amp;quot; kind of puzzle to see who can make the best algorithm. What do you think?&lt;/li&gt;&#xA;&lt;li&gt;Should I allow people to choose what delimiter is used to separate the output? Ideally what would happen is that they would just say 'I am assuming that &lt;code&gt;,&lt;/code&gt; is not used and it is my delimeter for the output'.&lt;/li&gt;&#xA;&lt;li&gt;Am I being too strict on the output? The aim was that you are trying to compress it only via replacements, and as a result want to output those replacements as short as you can, which this format is the smallest you can make.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="48436" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-17T13:53:26.313" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8480" PostTypeId="2" ParentId="8474" CreationDate="2016-02-17T18:39:01.740" Score="2" Body="&lt;h1&gt;Troubleshooting/Error&lt;/h1&gt;&#xA;&lt;p&gt;Does not display any latest activity (I don't have sandboxed posts, at the moment). On latest Chrome/Tampermonkey (OSX, 64-bit).&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/7O58Y.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/7O58Y.png&quot; alt=&quot;screenshot&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Also, just realized that upvoting one post locks in the upvote symbol like so:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/9xeaF.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/9xeaF.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;While you can see that I have not (yet) upvoted that answer.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/aOiBJ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/aOiBJ.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;However, it did work for the one I first clicked on.&lt;/p&gt;&#xA;" OwnerUserId="48962" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-17T18:49:01.183" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8481" PostTypeId="2" ParentId="2140" CreationDate="2016-02-17T19:49:34.833" Score="5" Body="&lt;h2&gt;Can the robotic arm reach itself?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;( ͡° ͜ʖ ͡°) title is kinda sketch at the moment&lt;/s&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A robotic arm is made up of a set of line segments, each with a positive integer length.  Each joint on the robot has two possible positions: &lt;strong&gt;straight or 90 degrees clockwise&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is a robotic arm with 4 line segments of sizes 4, 2, 3, 2&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+---+-+--+-+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here is the same robot arm with one joint bent&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+---+-+&#xA;      |&#xA;      |&#xA;      +&#xA;      |&#xA;      +&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(vertical scale is kinda messed up)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Right now, the robotic arm isn't reaching itself.  By bending all of the segments, however, the arm can reach itself.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+X--+&#xA; |  |&#xA; +--+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So, a robotic arm of size &lt;code&gt;[4,2,3,2]&lt;/code&gt; can reach itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is a robotic arm of size [3,1,4,3] that can't reach itself:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+--++---+--+&#xA;&#xA;+&#xA;|&#xA;|+--+&#xA;+---+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Whereas a robotic arm of size [1,1,2,2,3] can reach itself.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;++-+-+--+&#xA;&#xA;+&#xA;X++&#xA;| |&#xA;+-+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A robotic arm of size [2,2,3,5,3,4] can also reach itself&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a-b-c--d----e--f---g&#xA;&#xA;e--f&#xA;|  |&#xA;|  |&#xA;|a-b&#xA;|  g&#xA;d--c&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given list of numbers, such as &lt;code&gt;[1,2,3,4,5]&lt;/code&gt;, output a truthy value of the robotic arm can reach itself and a falsey value if it cannot.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2018-02-07T00:22:07.020" LastActivityDate="2018-02-07T00:22:07.020" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="8483" PostTypeId="2" ParentId="8350" CreationDate="2016-02-18T06:22:36.013" Score="25" Body="&lt;h2&gt;Rephrase &quot;Share your knowledge, Q&amp;amp;A style&quot;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When you post a question on any site in the Stack Exchange network, you're given the option to immediately add an answer to &quot;share your knowledge, Q&amp;amp;A style.&quot; That's nice. However, as is the point of this entire post, we're not a Q&amp;amp;A site, and thus this text makes no sense in the context of our site. When you think about it, posting a submission to a challenge &lt;em&gt;is&lt;/em&gt; kind of like sharing knowledge, so if you answer your own challenge then you are in some sense sharing your knowledge. But in the context of our site, that phrase still sounds kind of awkwardly out of place.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-02-18T06:22:36.013" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8491" PostTypeId="2" ParentId="8350" CreationDate="2016-02-19T13:23:07.127" Score="21" Body="&lt;h2&gt;A way to refine questions before we can answer them&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The sandbox feels rather hacky. On all other sites, questions are refined until they make sense but here, we have a problem when existing answers are already posted. A question should be able to go from a &lt;em&gt;draft&lt;/em&gt; state to a &lt;em&gt;final&lt;/em&gt; state. I don't have a particular idea on how to implement it, but the simplest for me would be to close (manually or automatically) the question as soon as it is asked (&quot;waiting for approval and feedback&quot;). Questions would have more visibility. When we are ready to answer, we reopen it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8474/introducing-the-ppcg-sandbox-viewer&quot;&gt;PPCG Sandbox Viewer&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="903" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-02-22T18:59:31.587" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="8493" PostTypeId="2" ParentId="2447" CreationDate="2016-02-19T13:28:13.697" Score="58" Body="&lt;h1&gt;For stack-based languages, function's input may be pushed to the stack before calling&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Stack-based languages may assume that the input for their function is automatically pushed to the stack.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="4372" LastEditDate="2017-01-04T20:23:21.997" LastActivityDate="2017-01-04T20:23:21.997" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8494" PostTypeId="1" CreationDate="2016-02-19T13:49:15.407" Score="4" ViewCount="222" Body="&lt;p&gt;&lt;strong&gt;Background:&lt;/strong&gt; Methods in Vitsy are defined by specific indices of lines of code. For example, if I wanted to call the second line of a program, I would call &lt;code&gt;1m&lt;/code&gt; to specify the first index of the methods.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a recent challenge, I was also &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/27691588#27691588&quot;&gt;asked to count the preceding newline&lt;/a&gt;, which sort of made sense, since you needed the newline to even make it a method and the newline was perceived to be the only thing separating it from being a snippet. But then again, how Vitsy does methods in the first place is totally floating; I could put the function 30 or 40 lines down and still call it, but with a different index number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should I count this newline, or no?&lt;/p&gt;&#xA;" OwnerUserId="44713" LastActivityDate="2016-02-27T02:57:51.907" Title="Do I need to count the newline for Vitsy methods?" Tags="|discussion|policy|code-golf|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8495" PostTypeId="2" ParentId="8494" CreationDate="2016-02-19T13:50:18.553" Score="-6" Body="&lt;h1&gt;No.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The newline is there only to serve as a barrier between the different methods. The newline is not part of the method itself and should not be counted.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastActivityDate="2016-02-19T13:50:18.553" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8496" PostTypeId="2" ParentId="8494" CreationDate="2016-02-19T13:51:40.580" Score="10" Body="&lt;h2&gt;Yes, count it&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you put it down on the 40th line, it would still be preceded by a linefeed that separates it from the previous function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Imagine you hadn't use linefeeds, but &lt;code&gt;;&lt;/code&gt; as the separator say. It's impossible to introduce a function without writing at least one &lt;code&gt;;&lt;/code&gt; and every single function introduces exactly one &lt;code&gt;;&lt;/code&gt;. I think it's fair to say that the &lt;code&gt;;&lt;/code&gt; (or in your case the linefeed) is part of the function syntax.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-02-19T13:51:40.580" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8497" PostTypeId="1" AcceptedAnswerId="8498" CreationDate="2016-02-19T19:17:51.477" Score="2" ViewCount="70" Body="&lt;p&gt;I love seeing that someone started at 100 characters and got it down to 26, but I would love to see each version or have record of what those optimizations were. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Am I just missing it? Leave that stuff in people!&lt;/p&gt;&#xA;" OwnerUserId="51474" LastActivityDate="2016-02-19T19:35:19.480" Title="Can we encourage people to keep previous golf versions?" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8498" PostTypeId="2" ParentId="8497" CreationDate="2016-02-19T19:30:11.220" Score="10" Body="&lt;p&gt;If they were already in your answer, please don't. Challenges here sometimes get a ton of answers, and we already encourage detailed explanations which can make the answers quite long. If all of the previous versions were kept in the answer, that would require a lot of screen real estate and scrolling.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;But&lt;/strong&gt; (as Mego said) the previous versions aren't lost. You can view the edit history of any answer by clicking the &quot;edit [date] at [time]&quot; link at the bottom of the answer. Then you can browse all the previous versions. People usually leave their previous &lt;em&gt;scores&lt;/em&gt; in the answer using strikethrough markup:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;## Ruby, &amp;lt;s&amp;gt;61&amp;lt;/s&amp;gt; &amp;lt;s&amp;gt;44&amp;lt;/s&amp;gt; 42 bytes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The main purpose of that is to tell people that there &lt;em&gt;were&lt;/em&gt; previous versions which can be found in the edit history, so if you see that you can go check them out. One exception to that might be if you've already golfed it quite a lot before first posting the answer. In that case, showing some interesting earlier versions might be nice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You're right though, it can be quite interesting to follow someone else's golfing process. This is actually one of the reasons why I prefer posting a working answer early, before I'm 100% done golfing it, so that there's a record of the actual golfing process. There's two answers of mine on the quine challenge that show the two extremes: I posted my &lt;a href=&quot;https://codegolf.stackexchange.com/a/67428/8478&quot;&gt;Retina quine&lt;/a&gt; straight at 20 bytes after a golfing session that started at 90 bytes. I even included those old versions straight in the answer there, because I thought they were interesting, and there would otherwise have been no record of them. The opposite is my &lt;a href=&quot;https://codegolf.stackexchange.com/a/47112/8478&quot;&gt;Prelude quine&lt;/a&gt; which I first posted at ~5000 bytes and golfed down through a &lt;em&gt;lot&lt;/em&gt; of version down to 214 bytes. Those versions can all be found in the edit history.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-02-19T19:35:19.480" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8502" PostTypeId="2" ParentId="2140" CreationDate="2016-02-19T21:56:38.323" Score="1" Body="&lt;h1&gt;xkcd's Fast Bogosort&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://xkcd.com/1185/&quot; rel=&quot;nofollow&quot;&gt;This xkcd comic&lt;/a&gt; presents pseudocode for four very bad sorting algorithms: &lt;strong&gt;halfhearted merge sort&lt;/strong&gt;, &lt;strong&gt;fast bogosort&lt;/strong&gt;, &lt;strong&gt;job interview quicksort&lt;/strong&gt;, and &lt;strong&gt;panic sort&lt;/strong&gt;. Because the other three are too easy, impossible to decipher, or a danger to users, you'll be implementing fast bogosort.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code will take an array of positive integers in any convenient format, and will return or output the result of fast bogosort as defined below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let N be the &lt;a href=&quot;https://en.wikipedia.org/wiki/Binary_logarithm&quot; rel=&quot;nofollow&quot;&gt;binary logarithm&lt;/a&gt; of the length of the list, &lt;strong&gt;rounded&lt;/strong&gt; to the nearest non-negative integer. Shuffle the list randomly N times. After each shuffle, if the list is fully sorted, return the result.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If no value has yet been returned, return the exact string &lt;code&gt;Kernel Page Fault (Error Code: 2)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output of your code must match the expected probabilities of this algorithm exactly, but does not need to follow the explicit steps stated.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;In the format &lt;code&gt;Input -&amp;gt; Output (Probability)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[] -&amp;gt; Kernel Page Fault (Error Code: 2) (1)&#xA;[1] -&amp;gt; Kernel Page Fault (Error Code: 2) (1)&#xA;[1, 1] -&amp;gt; [1, 1] (1)&#xA;[1, 2] -&amp;gt; [1, 2] (1/2)&#xA;[1, 2] -&amp;gt; Kernel Page Fault (Error Code: 2) (1/2)&#xA;[1, 1, 1] -&amp;gt; [1, 1, 1] (1)&#xA;[1, 1, 2] -&amp;gt; [1, 1, 2] (5/9)&#xA;[1, 1, 2] -&amp;gt; Kernel Page Fault (Error Code: 2) (4/9)&#xA;[3, 2, 1] -&amp;gt; [1, 2, 3] (11/36)&#xA;[3, 2, 1] -&amp;gt; Kernel Page Fault (Error Code: 2) (25/36)&#xA;[8, 4, 2, 1] -&amp;gt; [1, 2, 4, 8] (47/576)&#xA;[8, 4, 2, 1] -&amp;gt; Kernel Page Fault (Error Code: 2) (529/576)&#xA;[7, 7, 7, 7, 7, 7, 7, 7] -&amp;gt; [7, 7, 7, 7, 7, 7, 7, 7] (1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Meta&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Any bad math in here? Any other good test cases I should add?&lt;/p&gt;&#xA;" OwnerUserId="38006" LastActivityDate="2016-02-19T21:56:38.323" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8503" PostTypeId="1" AcceptedAnswerId="8504" CreationDate="2016-02-19T22:55:37.557" Score="13" ViewCount="508" Body="&lt;p&gt;There has been some debate about whether or not using &lt;a href=&quot;https://esolangs.org/wiki/Self-modifying_Brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;Self-Modifying Brainfuck&lt;/a&gt; counts as a &quot;cheating quine&quot;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/71966/45941&quot;&gt;Write a Metaquine&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/57947/45941&quot;&gt;Golf you a quine for great good!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;About SMBF:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program's source code is located on the tape, to the left of the intial tape pointer position&lt;/li&gt;&#xA;&lt;li&gt;Modifying the program's source code at runtime results in the behavior of the program being changed - the code on the tape is the actual code being executed, not just a static copy of the original source code&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Should SMBF's ability to read/modify its own source code be considered &quot;cheating&quot; for quining purposes?&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="97857" LastEditDate="2022-07-10T15:30:28.037" LastActivityDate="2022-07-10T15:30:28.037" Title="Does using SMBF count as a cheating quine?" Tags="|discussion|policy|answers|quine|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8504" PostTypeId="2" ParentId="8503" CreationDate="2016-02-19T22:55:37.557" Score="15" Body="&lt;h2&gt;Yes, reading the source code in SMBF is &amp;quot;cheating&amp;quot; in quining&lt;/h2&gt;&#xA;&lt;p&gt;For our purposes, a cheating quine is defined as a quine program that utilizes the direct or indirect reading of its source code (such as opening and reading the file the source code is stored in, a built-in function that returns a string containing the program's source code, etc.). The ability to modify the program's instructions at runtime in SMBF does not change the fact that it reads its own source code, and therefore quines in SMBF that utilize this behavior are cheating quines.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-19T22:55:37.557" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8505" PostTypeId="2" ParentId="8503" CreationDate="2016-02-19T23:18:20.057" Score="9" Body="&lt;h1&gt;Yes it's cheating, but let's elaborate&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;An argument commonly given to defend SMBF, but abstracted: If function &lt;code&gt;q&lt;/code&gt; printed the source code, then yes, it's a cheating quine. If function &lt;code&gt;q'&lt;/code&gt; accessed a copy of the source code, is it still a cheating quine? Well, yeah, probably. SMBF has a way to emulate said &lt;code&gt;q'&lt;/code&gt; function, but with a twist: it accesses a &lt;em&gt;writable&lt;/em&gt; copy of the source code; once this copy is modified, it is no longer the source code, rather, something similar to it. Then how could it possibly be said of SMBF that it's reading it's own source code?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;buzzer sound&lt;/em&gt; That's just wrong. Let's give a counter argument with the same logic:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's the night before the day of the big Shakespeare test. You get to bring in a notecard that gives some facts, but you are not allowed to quote any of the plays directly. &lt;em&gt;Well...&lt;/em&gt; you think to yourself, &lt;em&gt;If I put a&lt;/em&gt; near &lt;em&gt;copy of a quote, it's not the same quote, so it's okay!&lt;/em&gt; You proceed to do this and get a 0 on the test for cheating. &lt;em&gt;russian accent&lt;/em&gt; No big surprise.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Here's an argument given &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69/golf-you-a-quine-for-great-good/57947#comment139609_57947&quot;&gt;here&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;[&lt;em&gt;In response to a complaint about SMBF&lt;/em&gt;] No, it's not. The tape that the commands modify is the same tape that it operates on. That's part of the specification of the language. It's not just reading a separate copy of its source, and it's not opening its own file. It's looking at its own source dynamically on the same tape, with the power to execute and modify it mid-execution.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;First, it is stated that &lt;code&gt;The tape that the comands modify is the same tape that it operates on.&lt;/code&gt; Well, what if my language has it's source code on the stack, with the capacity to modify that string? This is to the same effect, but in a much more absurd setting. Here, it's plainly obvious that it's cheating. Not to mention that it is also not two sentences later &quot;It's looking at it's own source...&quot;&lt;/p&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-02-19T23:18:20.057" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8507" PostTypeId="2" ParentId="2447" CreationDate="2016-02-20T20:32:47.193" Score="36" Body="&lt;h2&gt;Functions in stack-based languages can leave the output on the stack&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Mostly for completeness sake. This is the de-facto standard for CJam and GolfScript and probably other stack-based languages.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-02-20T20:32:47.193" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="8508" PostTypeId="2" ParentId="2447" CreationDate="2016-02-20T22:33:07.000" Score="39" Body="&lt;h1&gt;Assembly programs may take input from registers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If there are no I/O devices available, an answer might consist of a subroutine that reads its input values from the machine registers.&lt;/p&gt;&#xA;" OwnerUserId="3852" LastActivityDate="2016-02-20T22:33:07.000" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8509" PostTypeId="2" ParentId="2447" CreationDate="2016-02-20T22:34:37.197" Score="24" Body="&lt;h1&gt;Assembly programs may write output to registers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If there are no I/O devices available, an answer might consist of a subroutine that leaves its computed output values in the machine registers upon returning.&lt;/p&gt;&#xA;" OwnerUserId="3852" LastActivityDate="2016-02-20T22:34:37.197" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8510" PostTypeId="2" ParentId="2447" CreationDate="2016-02-20T22:36:59.740" Score="29" Body="&lt;h1&gt;Assembly programs may read input from some specified memory location&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If there are no I/O devices available, an answer might consist of a subroutine that reads its input values from some specified memory location (e.g. read a zero-terminated string starting at &lt;code&gt;$0000&lt;/code&gt;).&lt;/p&gt;&#xA;" OwnerUserId="3852" LastActivityDate="2016-02-20T22:36:59.740" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8511" PostTypeId="2" ParentId="2447" CreationDate="2016-02-20T22:39:02.703" Score="35" Body="&lt;h1&gt;Assembly programs may write output to some specified memory location&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If there are no I/O devices available, an answer might consist of a subroutine that writes its output values to some specified memory location (e.g. write a machine word to &lt;code&gt;$0000&lt;/code&gt;).&lt;/p&gt;&#xA;" OwnerUserId="3852" LastActivityDate="2016-02-20T22:39:02.703" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8512" PostTypeId="2" ParentId="1031" CreationDate="2016-02-20T22:48:31.467" Score="12" Body="&lt;h2&gt;No, bonuses should not be allowed in code golf&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There's broad support that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8106/20260&quot;&gt;bonuses in code golf should generally be avoided&lt;/a&gt;. I think that moving bonuses from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; would emphasize that bonuses aren't a twist you put in for the heck of it, but make for a different kind of challenge you should choose only if you consider the bonuses vital to the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The other argument is from purity. In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, your goal is to minimize the number of bytes of the code. With scores like &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;112 bytes * 70% = 78.4 bytes&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;the resulting 78.4 isn't actually a byte count, but a score that's a function of the code length and the features it implements. So, it should be treated like any challenge scored on multiple factors, for which &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; has been used as a &quot;misc&quot;. (It might also be worth classifying  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;'s into more specific tags.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I disagree with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1036/20260&quot;&gt;ugoren's argument&lt;/a&gt; that these are still basically code golf.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;... As long as modifications don't change the main focus, they don't change anything.&#xA;  In some extreme cases, the modifiers may become the main challenge,&#xA;  and golfing becomes more of a tie breaker. Then it shouldn't be tagged&#xA;  code-golf, but these are quite rare.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It would be great if it were just extreme cases, but often I see bonuses that steal the spotlight and are central to deciding a winner. Sometimes a bonus is so large that any competitive answer must do it, and other times it's a trap that's just not worth the bytes to implement. Choosing the right bonuses to achieve or ignore is often more influential than the quality of your golfing.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-02-20T22:48:31.467" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8513" PostTypeId="1" CreationDate="2016-02-21T08:48:37.720" Score="15" ViewCount="263" Body="&lt;h2&gt;Overview&lt;/h2&gt;&#xA;&lt;p&gt;Sometimes in the real world, you're in a situation where you need to run a program on a very specialized computer, and you don't care how long it takes to run, but the computer has very limited memory. So, rather than optimizing for speed, you have to optimize for low memory footprint.&lt;/p&gt;&#xA;&lt;p&gt;The point of this challenge genre would be to pose challenges where getting a small program or a fast program may not be challenging, but trying to use as little memory as possible to solve the problem is an interesting goal.&lt;/p&gt;&#xA;&lt;h2&gt;Winning&lt;/h2&gt;&#xA;&lt;p&gt;Here are some examples of objective winning criteria for this genre:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;lowest peak memory usage&lt;/li&gt;&#xA;&lt;li&gt;lowest average memory usage&lt;/li&gt;&#xA;&lt;li&gt;lowest peak stack size (for stack-based languages; could be expanded to other languages by enforcing use of a stack for all memory allocation/deallocation; tape-based languages like brainfuck would have lowest maximal tape position)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;More than likely, like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, the memory usage will be measured on the challenge author's computer. Luckily, there are some &lt;a href=&quot;http://valgrind.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;helpful tools&lt;/a&gt; and loads of useful SO/SE questions (&lt;a href=&quot;https://stackoverflow.com/questions/1080461/peak-memory-measurement-of-long-running-process-in-linux&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://stackoverflow.com/questions/774556/peak-memory-usage-of-a-linux-unix-process&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://unix.stackexchange.com/questions/77370/how-to-measure-on-linux-the-peak-memory-of-an-application-after-has-ended&quot;&gt;3&lt;/a&gt;) to help the challenge author in measuring memory usage.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, some custom memory management tools/libraries could be written to get realtime information about memory allocation and deallocation (like by writing a custom &lt;code&gt;malloc&lt;/code&gt; function in C).&lt;/p&gt;&#xA;&lt;h2&gt;Tag name&lt;/h2&gt;&#xA;&lt;p&gt;I propose the tag name for this genre be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/memory-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;memory-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;memory-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Request for comments&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What other details/requirements would need to be added?&lt;/li&gt;&#xA;&lt;li&gt;What other winning criteria could be used?&lt;/li&gt;&#xA;&lt;li&gt;What issues are present in this proposal that my sleepy brain isn't catching?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-21T08:48:37.720" Title="New challenge genre proposal: Memory Golf" Tags="|discussion|new-genre|" AnswerCount="0" CommentCount="20" ContentLicense="CC BY-SA 3.0" />
  <row Id="8517" PostTypeId="1" CreationDate="2016-02-21T21:03:57.770" Score="12" ViewCount="286" Body="&lt;p&gt;In &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5772/20469&quot;&gt;this standard loophole&lt;/a&gt;, we forbid gaining an unfair advantage by creating new language features or implementing a new language specifically to be competitive for a particular challenge that's either in the sandbox or on the main site. This loophole, along with the fact that we define languages by their implementations and not their specifications, is one of the reasons that languages and language versions newer than challenges are marked noncompeting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, one thing remains unclear: What do we consider an &quot;unfair advantage&quot;? That is, what specifically is covered (and what &lt;em&gt;isn't&lt;/em&gt; covered) by this loophole?&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-02-21T23:34:56.753" Title="What do we consider an &quot;unfair advantage&quot;?" Tags="|discussion|policy|answers|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8519" PostTypeId="2" ParentId="2140" CreationDate="2016-02-21T21:41:04.927" Score="1" Body="&lt;h2&gt;Remove Vowel&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is a word puzzle called &lt;em&gt;Enter Vowel&lt;/em&gt; which looks a little like a crossword but the clues are simply the answers with all the vowels removed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task will be to take a solved crossword and turn it back into the Enter Vowel clues. You can assume that the crossword consists of upper case letters, octothorpes and newlines. You can also assume that the crossword will be rectangular and that only octothorpes will appear on its borders.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first step is of course to obscure the letters. Each letter should be replaced by a space, except those letters that begin a word, which should be replaced by an underline. Each underline is notionally numbered starting from 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To the right of the obscured grid you must then provide separate columns of across and down clues, but both sets of clues share the underline numbering, so that the numbers are not consecutive within each list of clues. The clues are simply the original words with the vowels removed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;###############&#xA;###PROGRAMMING#&#xA;###U####N######&#xA;###Z##CODE#####&#xA;###Z###########&#xA;#GOLF##########&#xA;###E###########&#xA;###S###########&#xA;###############&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;becomes&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;############### ACROSS      DOWN&#xA;###_    _     # 1. PRGRMMNG 1. PZZLS&#xA;### #### ###### 3. CD       2. ND&#xA;### ##_   ##### 4. GLF&#xA;### ###########&#xA;#_   ##########&#xA;### ###########&#xA;### ###########&#xA;###############&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Extra whitespace is permissible as long as the general formatting is adhered to.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so you need to remove as much code as you can.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2016-02-22T13:33:46.483" LastActivityDate="2016-02-22T13:33:46.483" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8520" PostTypeId="2" ParentId="8517" CreationDate="2016-02-21T22:42:22.670" Score="22" Body="&lt;h2&gt;&amp;quot;I know it when I see it&amp;quot;&lt;/h2&gt;&#xA;&lt;p&gt;Not the easiest definition to enforce, but I think this is the best way to put it.&lt;/p&gt;&#xA;&lt;p&gt;If we try to nail down this definition of &amp;quot;unfair&amp;quot;, we could make ourselves more vulnerable to being rules-lawyered. I don't recall exactly where I saw it, but I do remember that this inspired Stack Exchange's &amp;quot;be nice&amp;quot; policy: there was a forum with just one administrator, whose only rule of conduct was &amp;quot;Be nice.&amp;quot; He simply banned everyone who disregarded that rule, and the community was well-off for it. Anyone that knew of that rule and disregarded it via some attempt to exploit a loophole showed that they &lt;em&gt;did&lt;/em&gt; understand said rule, and chose not to follow it.&lt;/p&gt;&#xA;&lt;p&gt;I propose we treat &amp;quot;unfair advantage&amp;quot; similarly. &lt;strong&gt;If you believe someone has gained an unfair advantage by updating their language after the challenge was posted or sandboxed, downvote and comment as such.&lt;/strong&gt; With sustained negative feedback, people will stop being unfair, or stop participating. With regards to the Sandbox especially, very few people see a challenge in the Sandbox (comparatively). If someone's abusing this loophole, that'll be apparent.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;I think we should care more about &amp;quot;fun&amp;quot; than &amp;quot;winning&amp;quot;.&lt;/strong&gt; Hence, we should &amp;quot;enforce&amp;quot; fairness when it improves the &amp;quot;fun-ness&amp;quot; of the site, not solely for the sake of fair competition. (Jelly's gonna win everything anyway. :P)&lt;/p&gt;&#xA;&lt;h3&gt;Guidelines/examples&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bugfixes - Let's say someone fixes a bug in their language after a challenge is posted. (I've done this.) I'd let it slide because I know how frustrating it is to &lt;em&gt;know&lt;/em&gt; that your language is supposed to act a certain way, but it doesn't and you get penalized for it. I understand the general &amp;quot;the implementation defines the language&amp;quot; idea, but I think I wasn't around for the discussions. Doesn't the language's creator get a say? In any case, if said person then &lt;em&gt;reverts&lt;/em&gt; their change later on, or the &amp;quot;bugfix&amp;quot; doesn't make much sense (or even &lt;em&gt;introduces&lt;/em&gt; a bug), that's fishy, and probably would get a downvote from me.&lt;/li&gt;&#xA;&lt;li&gt;New features - they &lt;em&gt;do&lt;/em&gt; provide an unfair advantage, but &lt;em&gt;only&lt;/em&gt; if they're relevant to the challenge. This is already how most people operate anyway, I think.&lt;/li&gt;&#xA;&lt;li&gt;When is a (claimed) bugfix really an improvement? Well, how many grains of sand do you have to remove from a heap of sand until it's no longer a heap? There are fuzzy boundaries in every aspect of human life, and we deal with them just fine, considering. I'd likely downvote if a &amp;quot;bugfix&amp;quot; confers a substantial advantage, like more than a handful of bytes or percentage points (about 5, in both cases).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; I only suggest downvotes and not deletion because unfair answers are merely &lt;em&gt;bad&lt;/em&gt;, not invalid. (In my opinion, that is.)&lt;/p&gt;&#xA;&lt;p&gt;Fuzzy and murky, yeah, but ultimately, I think this is the best way to go.&lt;/p&gt;&#xA;" OwnerUserId="12914" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-21T23:34:56.753" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8522" PostTypeId="2" ParentId="8517" CreationDate="2016-02-21T23:34:05.580" Score="-5" Body="&lt;h1&gt;Always&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Simple, sweet, concise. If there has been a change in the interpreter, you cannot use that version of the interpreter. That way, there is no further debate: a hard-and-fast rule.&lt;/p&gt;&#xA;" OwnerUserId="45447" LastActivityDate="2016-02-21T23:34:05.580" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8523" PostTypeId="2" ParentId="8350" CreationDate="2016-02-22T00:40:11.257" Score="36" Body="&lt;h3&gt;Remove &quot;This question has more than 30 answers already&quot; pop up for challenges&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;It doesn't make sense to restrict the number of solutions to a challenge. In some cases there may be solutions in more than 30 &lt;em&gt;languages&lt;/em&gt;, and multiple solutions per language are encouraged.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We have a small proportion of non-challenge questions, but I don't see a problem with them not having this pop up.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2016-02-22T00:40:11.257" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8524" PostTypeId="2" ParentId="2140" CreationDate="2016-02-22T00:45:06.993" Score="5" Body="&lt;h1&gt;Battle Snake&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The classic snake game where bots control the snakes. Can you create a bot that out lives the rest?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Snakes will enter the arena and hope to survive. Eat pellets and grow in length. Can you force your competition to crash and die while you survive? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;See &lt;a href=&quot;https://www.youtube.com/watch?v=ZQKWIM83Yd8&quot; rel=&quot;nofollow noreferrer&quot;&gt;video&lt;/a&gt; for visuals of my simple bot playing against itself. I am sure you can do better!&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Features&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Real-time graphics provided by &lt;a href=&quot;https://love2d.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Love2D&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Multiple snakes per game&lt;/li&gt;&#xA;&lt;li&gt;Solo game as well&lt;/li&gt;&#xA;&lt;li&gt;Humans can play too!&lt;/li&gt;&#xA;&lt;li&gt;Highly configurable settings&lt;/li&gt;&#xA;&lt;li&gt;Supports any programming language that can use sockets.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Requirements&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://love2d.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Love2D&lt;/a&gt;: 2D game engine written for Lua&lt;/li&gt;&#xA;&lt;li&gt;Socket-compatible programming language&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/dbaileychess/battlesnake&quot; rel=&quot;nofollow noreferrer&quot;&gt;Controller&lt;/a&gt;: The main controller for this challenege&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Optional&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/stevedonovan/winapi&quot; rel=&quot;nofollow noreferrer&quot;&gt;Lua winapi&lt;/a&gt;: Handy way to spawn processes in the background&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Controller Contents&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;main.lua&lt;/code&gt;: Main loop for Love.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;snake.lua&lt;/code&gt;: Support library for game mechanics&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;config.lua&lt;/code&gt;: Configuration settings.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;bots\&lt;/code&gt;: location of externally-defined bots&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;simple.lua&lt;/code&gt;: Example bot written in Lua&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Executing&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Run the love2d executable on the controller directory&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;love.exe &amp;lt;location_of&amp;gt;\battlesnake&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[Recommended] Use &lt;a href=&quot;https://studio.zerobrane.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;ZeroBrane Studio&lt;/a&gt; with the 'Love' interpreter. Change your project directory to where you installed the controller, and then run the script in ZeroBrane. You'll still have to install Love separately.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Configuration&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;All configurable options are located in the &lt;code&gt;config.lua&lt;/code&gt; file in the controller. The options are detailed in that file itself.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;General snake rules apply. Hit something and you die. This includes the walls, other snakes, or even yourself. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Collisions happen before the board is updated. Therefore, if you move to a spot where another snake's tail is, it will still cause a collision. Even though it could be moving away that turn. If two or more snakes enter the same spot the same turn, they all collide with each other.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Eat a pellet and gain points. You also grow in size for a number of turns. Your head continues moving but your tail stays stationary until you stop growing.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Mechanics&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The game uses a server-client model, where the main game loop is the server and each snake is a client. The game communicates to each snake over TCP through an assigned port. The default host is the &lt;code&gt;localhost&lt;/code&gt;, no external networks are required.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When the game starts, it will start each snake (aka bot) by starting its associated program and sending the IP ADDRESS and PORT and PLAYER ID to it as input arguments: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;bots\someBot.exe 127.0.0.1 52311 1&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main server then waits for a socket connection from that bot at the given IP and PORT. If the connection times out, it will error and the game will not start. If the server receives a connection from the bot, it will proceed on to the next bot.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once all bots are started and connected to the server, the game will be generated. Bots are expected to block until receiving data from the server. Typically this is just an infinite loop with a blocking &lt;code&gt;socket.receive()&lt;/code&gt; call at the top of the loop.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Board&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The game board can be of any width and height. The coordinate system starts at &lt;code&gt;x = 1&lt;/code&gt;, &lt;code&gt;y = 1&lt;/code&gt; at the top-left. Increasing &lt;code&gt;x&lt;/code&gt; values go left-to-right and increasing &lt;code&gt;y&lt;/code&gt; values go top-to-bottom. The board has hard walls, hitting them will kill your snake. (Lua is 1-based, that is why it starts at 1)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Order of Events&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;First the game settings are broadcast to all bots&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Board Information&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;bi width,height&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;width&lt;/code&gt; and &lt;code&gt;height&lt;/code&gt; are integer values &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Pellet Location&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;p x,y&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; are integer values &lt;code&gt;&amp;gt;= 1&lt;/code&gt; and &lt;code&gt;&amp;lt;=&lt;/code&gt; to their respective &lt;code&gt;width&lt;/code&gt; and &lt;code&gt;height&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For each bot&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;For each body part, starting at the head and going to the tail&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;si snake_id x,y&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;snake_id&lt;/code&gt; is an integer value, and &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; are as described before.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Ready signal&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;ready&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All bots are initialized by now, so the next command will be from the main game loop.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Main Loop&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;For each tick (tick is when all snake movements will be applied)&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Server will broadcast to each bot&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;mov&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The bot needs to respond to this request with a direction to head in&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;r&lt;/code&gt; Head Right&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;l&lt;/code&gt; Head Left&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;u&lt;/code&gt; Head Up&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;d&lt;/code&gt; Head Down&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If the bot doesn't respond within a specified time, it will continue to move in its previous direction. (Previous direction is &lt;code&gt;r&lt;/code&gt; on the first turn)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The bot should send a single char back, nothing more will be parsed.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Check End Game Conditions&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the game ended this tick each bot will be sent either a &lt;code&gt;quit&lt;/code&gt; or nil message from the server. Each bot is expected to clean up after itself when it receives this signal.           &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Updated Pellet Info [optional]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a pellet was eaten this tick, a new pellet packet will be broadcast to all active bots&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;p x,y&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Server broadcasts snake deltas that were applied this turn&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;s snake_id new_x,new_y,removed_x,removed_y&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Where all parameters are integers. &lt;code&gt;new_x&lt;/code&gt; and &lt;code&gt;new_y&lt;/code&gt; are the new head location of a given snake.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If &lt;code&gt;removed_x&lt;/code&gt; and &lt;code&gt;removed_y&lt;/code&gt; are &lt;code&gt;&amp;gt;= 1&lt;/code&gt;, this is where the tail &lt;strong&gt;used&lt;/strong&gt; to be, so each bot knows the updated board.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If &lt;code&gt;remove_x&lt;/code&gt; and &lt;code&gt;removed_y&lt;/code&gt; are &lt;code&gt;== -1&lt;/code&gt;, then that bot is actively growing in size, so its tail didn't move.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a snake died this tick, its deltas will not be broadcast. It is up to the bots to remove the body from their game state.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://github.com/dbaileychess/battlesnake/blob/master/bots/simple.lua&quot; rel=&quot;nofollow noreferrer&quot;&gt;example bot&lt;/a&gt; for details&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Matches&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Games are grouped together in best-of matches. For the purposes of the bots, they do not need to understand the concept of a match. The bot that wins the required number of games in a match is declared the match winner.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Scoring&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Match winner: +2500 points per match&lt;/li&gt;&#xA;&lt;li&gt;Last Man Standing: +1000 points per game&lt;/li&gt;&#xA;&lt;li&gt;Pellets Eaten: +50 points per pellet&lt;/li&gt;&#xA;&lt;li&gt;Game Ticks Alive: +1 point per tick&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If two or more bots enter the same square on the same tick, they all die. If this square happened to be the pellet, none of those bots will be rewarded the pellet points. However, the pellet will be &quot;consumed&quot; and a new location will be generated for the remaining bots to eat.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there is a tie at the end of the game among the bots, the game is a wash. A new game will be started.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;King-of-the-hill Scoring     &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge will combine two parts: A solo effort and a classic king-of-the-hill part.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each bot will be given the same random seed at the start of the competition. There will also be imposed a maximum time between eating pellets to prevent bots from going around in circles to farm points.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Solo&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each bot will enter into a 10-game match to see how long it lasts and how well it eats by itself. The scores of each game in the match will be summed to compose its final Solo-score.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;King-of-the-hill&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All the bots will enter into a best-of-39 match. If the game ends and there is still a final living bot, the game still end at that point. That bot will be given the last man standing bonus.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The scores of each game will be summed and composed into the snakes final KOTH-score.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Final Scoring&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All the bots will be ranked in each part separately. Ties in ranks are permitted at this stage. Then their positional rank in each part will be summed together to give their final score. The bot with the lowest combined rank wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In case of a tie at this level, the bot with the better KOTH rank will win. If still a tie, the bot with the better Solo rank will win.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;My biggest concerns&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Requires a few third-party programs to work. So that will limit the number of people who enter.&lt;/li&gt;&#xA;&lt;li&gt;Requires sockets. I couldn't figure out a good way with Lua\Love2d to have bidirectional pipes with &lt;code&gt;STDIN&lt;/code&gt; and &lt;code&gt;STDOUT&lt;/code&gt;. So I thought sockets would be the best alternative to open the challenge to as many people as possible.&lt;/li&gt;&#xA;&lt;li&gt;Too hard? &lt;/li&gt;&#xA;&lt;li&gt;Haven't optimized scoring yet.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="21434" LastEditorUserId="21434" LastEditDate="2016-02-22T07:52:20.793" LastActivityDate="2016-02-22T07:52:20.793" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8525" PostTypeId="2" ParentId="2140" CreationDate="2016-02-22T09:41:21.510" Score="2" Body="&lt;h1&gt;Create an unkillable Windows process&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In various versions of the Microsoft Windows operating system, it is possible for a process to enter a state where it cannot be killed by the 'End Process' feature in the Task Manager. Your goal is to create a user-mode program that enters such a state (or spawns a process that does) using as few bytes of code as possible. Please state the version of Windows on which you have tested the program.&lt;/p&gt;&#xA;&lt;p&gt;Some techniques for creating unkillable processes can be found &lt;a href=&quot;https://security.stackexchange.com/questions/30985/create-a-unterminable-process-in-windows&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Be warned that such processes may cause a performance impact, so be prepared to reboot if necessary when testing any of these programs.&lt;/p&gt;&#xA;&lt;p&gt;TODO:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Minimum version? The #1 in the accepted answer seems too easy.&lt;/li&gt;&#xA;&lt;li&gt;#2 is also lame so maybe taskkill should be the standard instead of Task Manager.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="30688" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-22T10:22:04.003" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8527" PostTypeId="2" ParentId="2140" CreationDate="2016-02-22T14:21:23.843" Score="0" Body="&lt;h1&gt;Simple Substitution Cipher Programming&lt;/h1&gt;&#xA;&lt;p&gt;A simple substitution cipher maps each unique character to another character.  If my substitution cipher is &lt;code&gt;[H-&amp;gt;6, e-&amp;gt;U, l-&amp;gt;V, o-&amp;gt;)]&lt;/code&gt;, then &lt;code&gt;Hello&lt;/code&gt; becomes &lt;code&gt;6UVV)&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;You must write a program &lt;code&gt;A&lt;/code&gt; which inputs a string of text, and outputs the text after passing it through a substitution cipher.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;You must also be able to handle your program, &lt;code&gt;A&lt;/code&gt;, as input, printing out &lt;code&gt;B&lt;/code&gt;.  If possible, &lt;code&gt;B&lt;/code&gt; then applies a &lt;em&gt;different&lt;/em&gt; cipher, and prints out &lt;code&gt;C&lt;/code&gt;, and so on, until you cannot repeat the process anymore, or until a duplicate program as been generated.&lt;/p&gt;&#xA;&lt;p&gt;Your ciphers must:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Contain at least 2 substitutions, and every character in your program.&lt;/li&gt;&#xA;&lt;li&gt;Change every character (i.e., no &lt;code&gt;A-&amp;gt;A&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Be unique on every substitution (i.e., if program &lt;code&gt;A&lt;/code&gt; uses &lt;code&gt;x-&amp;gt;y&lt;/code&gt;, then program &lt;code&gt;B&lt;/code&gt; must convert &lt;code&gt;x&lt;/code&gt; into something other than &lt;code&gt;y&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;All be written in the same language (same version)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Your score is &lt;strong&gt;ByteCount(A)/NumIterations&lt;/strong&gt;. You can assume that your input only consists of substitute-able characters.&lt;/p&gt;&#xA;&lt;p&gt;For example, if &lt;code&gt;A&lt;/code&gt; was &lt;code&gt;Programming&lt;/code&gt;, and it generated &lt;code&gt;p80G8AMM1NG&lt;/code&gt;, which generated &lt;code&gt;u79)7%vvQ-)&lt;/code&gt;, which finally generated &lt;code&gt;Programming&lt;/code&gt;, then there were 3 ciphers applied, and a byte count of 11, so my score would be 11/3, or approximately 3.666667.  If the final output was an invalid program, my score would still be the same.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-03T16:50:33.270" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8528" PostTypeId="2" ParentId="2140" CreationDate="2016-02-22T16:51:43.663" Score="1" Body="&lt;h1&gt;Untangle the footnote labyrinths&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://imgs.xkcd.com/comics/footnote_labyrinths.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://imgs.xkcd.com/comics/footnote_labyrinths.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to create a program or function that untangles footnote labyrinths.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The input will be made up of two parts:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A &quot;main&quot; string&lt;/li&gt;&#xA;&lt;li&gt;A list of footnotes in the format (&lt;code&gt;1. Footnote text&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The output should be the &quot;main&quot; string with each footnote mark (represented with superscript tags &lt;code&gt;&amp;lt;sup&amp;gt;1&amp;lt;/sup&amp;gt;&lt;/code&gt;) replaced with its corresponding footnote. Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;This is some sample text.&amp;lt;sup&amp;gt;1&amp;lt;/sup&amp;gt;&#xA;1. This is a sample footnote.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The &quot;main&quot; string has one footnote &lt;code&gt;&amp;lt;sup&amp;gt;1&amp;lt;/sup&amp;gt;&lt;/code&gt;; the &lt;code&gt;1&lt;/code&gt; is replaced with the text of the footnote:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;This is some sample text.&amp;lt;sup&amp;gt;This is a sample footnote.&amp;lt;/sup&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here's another one:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;This is some sample text.&amp;lt;sup&amp;gt;1&amp;lt;/sup&amp;gt;&#xA;1. This is a footnote.&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;&#xA;2. This is a nested footnote.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This time, the footnote has a footnote mark in it, which should be replaced as well:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;This is some sample text.&amp;lt;sup&amp;gt;This is a footnote.&amp;lt;sup&amp;gt;This is a nested footnote.&amp;lt;/sup&amp;gt;&amp;lt;/sup&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;One more example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Welcome to my lair!&amp;lt;sup&amp;gt;8&amp;lt;/sup&amp;gt;&amp;lt;sup&amp;gt;&amp;lt;sup&amp;gt;3&amp;lt;/sup&amp;gt;&amp;lt;/sup&amp;gt;&#xA;3. This footnote is not inserted.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Footnote 3 is inserted, but footnote 8 does not exist, so it's not modified:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Welcome to my lair!&amp;lt;sup&amp;gt;8&amp;lt;/sup&amp;gt;&amp;lt;sup&amp;gt;&amp;lt;sup&amp;gt;This footnote is not inserted.&amp;lt;/sup&amp;gt;&amp;lt;/sup&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You may assume:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Nested footnotes are not represented as &lt;code&gt;&amp;lt;sup&amp;gt;1&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;&amp;lt;/sup&amp;gt;&lt;/code&gt;; rather as &lt;code&gt;&amp;lt;sup&amp;gt;1&amp;lt;/sup&amp;gt;&amp;lt;sup&amp;gt;&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;&amp;lt;/sup&amp;gt;&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;There will be no circular references, i.e. &lt;code&gt;1. Abc&amp;lt;sup&amp;gt;1&amp;lt;/sup&amp;gt;&lt;/code&gt; or &lt;code&gt;1. Abc&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; 2. Xyz&amp;lt;sup&amp;gt;1&amp;lt;/sup&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The footnote numbers will only be 1 through 9.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You may &lt;em&gt;not&lt;/em&gt; assume:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The footnote numbers will be consecutive, or in order. &lt;code&gt;2. Abc 1. Xyz&lt;/code&gt; and &lt;code&gt;9. Qwerty 4. Asdf&lt;/code&gt; are both valid.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(One or more lines of input, empty line, output. Feel free to suggest a better format.)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;This is some sample text.&amp;lt;sup&amp;gt;1&amp;lt;/sup&amp;gt;&#xA;1. This is a sample footnote.&#xA;&#xA;This is some sample text.&amp;lt;sup&amp;gt;This is a sample footnote.&amp;lt;/sup&amp;gt;&#xA;&#xA;_____________________________________________________________________&#xA;&#xA;This is some sample text.&amp;lt;sup&amp;gt;1&amp;lt;/sup&amp;gt;&#xA;1. This is a footnote.&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;&#xA;2. This is a nested footnote.&#xA;&#xA;This is some sample text.&amp;lt;sup&amp;gt;This is a footnote.&amp;lt;sup&amp;gt;This is a nested footnote.&amp;lt;/sup&amp;gt;&amp;lt;/sup&amp;gt;&#xA;&#xA;_____________________________________________________________________&#xA;&#xA;Studies have shown&amp;lt;sup&amp;gt;1&amp;lt;/sup&amp;gt; that PPCG users are more likely to accept typos&amp;lt;sup&amp;gt;3&amp;lt;/sup&amp;gt; than the correct spelling&amp;lt;sup&amp;gt;4&amp;lt;sup&amp;gt;5&amp;lt;/sup&amp;gt;&amp;lt;/sup&amp;gt;.&#xA;1. Studies by an individual research group, not affiliated with PPCG in any way.&#xA;3. https://github.com/vihanb/PPCG-Design/pull/50&#xA;4. http://strawpoll.me/6847681/r&#xA;5. Very comprehensive studies.&amp;lt;sup&amp;gt;1&amp;lt;/sup&amp;gt;&#xA;&#xA;Studies have shown&amp;lt;sup&amp;gt;Studies by an individual research group, not affiliated with PPCG in any way.&amp;lt;/sup&amp;gt; that PPCG users are more likely to accept typos&amp;lt;sup&amp;gt;https://github.com/vihanb/PPCG-Design/pull/50&amp;lt;/sup&amp;gt; than the correct spelling&amp;lt;sup&amp;gt;http://strawpoll.me/6847681/r&amp;lt;sup&amp;gt;Very comprehensive studies.&amp;lt;sup&amp;gt;Studies by an individual research group, not affiliated with PPCG in any way.&amp;lt;/sup&amp;gt;&amp;lt;/sup&amp;gt;&amp;lt;/sup&amp;gt;.&#xA;&#xA;_____________________________________________________________________&#xA;&#xA;Welcome to my lair!&amp;lt;sup&amp;gt;It's very cozy.&amp;lt;/sup&amp;gt;&#xA;1. This footnote is not inserted.&#xA;&#xA;Welcome to my lair!&amp;lt;sup&amp;gt;It's very cozy.&amp;lt;/sup&amp;gt;&#xA;&#xA;_____________________________________________________________________&#xA;&#xA;Welcome to my lair!&amp;lt;sup&amp;gt;8&amp;lt;/sup&amp;gt;&amp;lt;sup&amp;gt;&amp;lt;sup&amp;gt;3&amp;lt;/sup&amp;gt;&amp;lt;/sup&amp;gt;&#xA;3. This footnote is not inserted.&#xA;&#xA;Welcome to my lair!&amp;lt;sup&amp;gt;8&amp;lt;/sup&amp;gt;&amp;lt;sup&amp;gt;&amp;lt;sup&amp;gt;This footnote is not inserted.&amp;lt;/sup&amp;gt;&amp;lt;/sup&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, so &lt;strong&gt;shortest code in bytes wins.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="42545" LastEditorUserId="42545" LastEditDate="2016-02-23T18:45:30.283" LastActivityDate="2016-02-23T18:45:30.283" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8536" PostTypeId="2" ParentId="8474" CreationDate="2016-02-23T15:48:13.570" Score="9" Body="&lt;h2&gt;Feature request: enter submits comment&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Comments can't contain linefeeds, so like the comment field on SE itself, hitting &lt;kbd&gt;enter&lt;/kbd&gt; should submit the comment.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-02-23T15:48:13.570" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8537" PostTypeId="2" ParentId="8474" CreationDate="2016-02-23T15:55:07.993" Score="4" Body="&lt;h2&gt;Feature request: make the sidebar work from other SEs&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When I open the viewer on another SE, I'm not seeing any challenges in the left sidebar. I'm assuming this is because you're using the user ID on the current SE (this would actually mean I might see someone else's list, if my ID on another SE matches up with theirs on PPCG). If at all possible, it would be neat if the script could determine my ID on PPCG and use that.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-02-23T15:55:07.993" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8538" PostTypeId="1" CreationDate="2016-02-23T16:54:15.613" Score="179" ViewCount="3868" Body="&lt;p&gt;It's a big day, and I know you folks have been waiting a reeeaaal long while. Double waiting, you might even say, since unfortunately we made you wait even longer after initial news. But, let's make it official! You've been cleared for graduation by the Stack Exchange Community Team! Programming Puzzles &amp;amp; Code Golf met our threshold for &lt;a href=&quot;https://meta.stackexchange.com/questions/257614/graduation-site-closure-and-a-clearer-outlook-on-the-health-of-se-sites&quot;&gt;graduation-worthy sites&lt;/a&gt; and after a review, the Community Team determined that you're good to go. Reaching 'mature community' status is a big milestone, and you should be very proud.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your site actually passed this threshold several weeks ago. We're... still kinda looking into why that happened, but your good news shouldn't have to wait!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What does this mean exactly? Graduation works in two phases. Starting today, you'll receive the following benefits:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You will soon have an election for community-voted moderators - there is still some backlog in hosting elections so it'll most likely be during next month that yours will begin.&lt;/li&gt;&#xA;&lt;li&gt;You will no longer see the &quot;beta&quot; label attached to your site's name.&lt;/li&gt;&#xA;&lt;li&gt;You will become eligible for question migration paths with the rest of the network.&lt;/li&gt;&#xA;&lt;li&gt;You will soon be able to select your own community ads. Give me a moment to set these up later this week.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The site will still receive a full design from one of our designers, which will be packaged with an increase in the amount of reputation needed to access each privilege. It's no secret that our backlog for site designs is long, so instead of making you wait to receive all the parts of graduation at once, we wanted to &lt;a href=&quot;https://meta.stackexchange.com/questions/260754/feedback-requested-design-independent-graduation&quot;&gt;give you the things we could give&lt;/a&gt; you now. We think we've hammered out most of the bugs in the process,, but there are still likely to be some left -  so if you come across anything out of place, please report it on &lt;a href=&quot;https://meta.stackexchange.com/&quot;&gt;Meta Stack Exchange&lt;/a&gt; using the [graduating-sites] tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This site has reached this point because of your generous contributions. Together, you've created a valuable resource that helps people. Congratulations on all you've accomplished.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;As an added note, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8350/were-not-a-qa-site-but-what-should-be-done-about-it&quot;&gt;we're aware of some discussion about certain elements which need to be worked on&lt;/a&gt;, especially surrounding verbiage on the site being a &quot;Q&amp;amp;A&quot; site. Different parts of that are still under review, but wanted to drop off word that we are indeed looking into it.&lt;/p&gt;&#xA;" OwnerUserId="2414" LastEditorUserId="66833" LastEditDate="2021-08-18T22:09:47.610" LastActivityDate="2021-08-18T22:09:47.610" Title="Congratulations, you're graduating!" Tags="|discussion|graduation|announcement|" AnswerCount="2" CommentCount="26" ContentLicense="CC BY-SA 3.0" />
  <row Id="8539" PostTypeId="2" ParentId="8538" CreationDate="2016-02-23T17:28:23.477" Score="90" Body="&lt;p&gt;Needless to say this is fantastic news. I'd just like to take a moment to say&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;THANK YOU&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;both to the Stack Exchange Community Team as well as to our wonderful community. Together we've built something amazing and I'm exceptionally proud to be a part of it. This is a day that we've &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5834/20469&quot;&gt;often joked&lt;/a&gt; would never come, but with our dedication we've made it a reality. If you're reading this, you helped us reach this milestone—perhaps the ultimate milestone a Stack Exchange site can hope to achieve—so you should be proud as well!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;PPCG is honestly one of the most creative, passionate groups of people I've ever come across. I'm honored to have been able to serve as a pro-tem moderator and I'm looking forward to continuing to be a part of this community as we move into this next phase of our existence.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2016-02-23T17:28:23.477" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="8540" PostTypeId="2" ParentId="8030" CreationDate="2016-02-23T17:41:09.463" Score="16" Body="&lt;p&gt;So I guess senpai noticed us. See below for a special note from Grace Note.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8538/20469&quot;&gt;Congratulations, you&amp;#39;re graduating!&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2016-02-23T17:41:09.463" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8543" PostTypeId="2" ParentId="8538" CreationDate="2016-02-23T20:24:09.410" Score="28" Body="&lt;p&gt;Yay! I'm so happy, and glad to hear this awesome news! However, it brings up a question. Are there any plans to change the number of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7683/increase-reputation-awarded-for-questions&quot;&gt;reputation for challenges?&lt;/a&gt; When this was requested 2 months ago, there was overwhelmingly positive support for making this happen, but no response from anyone who actually had the ability to do something about it. Is this still something that is adjustable on a per-site basis? I imagine this is a &quot;Wait until full graduation, and we'll talk it over then&quot; but we'd all love a quick update on it now.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-02-23T20:24:09.410" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8544" PostTypeId="1" AcceptedAnswerId="8564" CreationDate="2016-02-23T20:55:27.220" Score="11" ViewCount="220" Body="&lt;p&gt;A picture with freehand red circles is worth a million words:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Jt82E.png&quot;&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="12012" LastEditDate="2016-03-11T13:23:19.990" LastActivityDate="2016-03-11T13:23:19.990" Title="Chat still says beta" Tags="|bug|status-completed|chat|graduation|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8545" PostTypeId="2" ParentId="2140" CreationDate="2016-02-23T21:10:21.900" Score="1" Body="&lt;h2&gt;How long until a five-card-stud poker winning hand?&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Background:&lt;/h3&gt;&#xA;&lt;p&gt;Five card stud is a variant of poker where the player is dealt a &lt;em&gt;hand&lt;/em&gt; of five cards from a &lt;em&gt;shoe&lt;/em&gt; of multiple standard 52-card decks. This hand is then used for play/scoring, following the table listed below.&lt;/p&gt;&#xA;&lt;p&gt;{insert chart of poker hands}&lt;/p&gt;&#xA;&lt;p&gt;We're going to play a variation of this as follows: The dealer selects five cards out of the shoe as the &lt;em&gt;Hand to Beat&lt;/em&gt;. The dealer then shuffles all the remaining cards, and deals the player five cards. If the player wins, the game is over, else the player's cards are shuffled back into the shoe and the process repeats. We want to determine the expected number of hands that will need to be dealt before the player has a hand that will beat the dealer.&lt;/p&gt;&#xA;&lt;h3&gt;Challenge:&lt;/h3&gt;&#xA;&lt;p&gt;Given an input of the dealer's full five-card hand, and the number of decks in the original shoe, output the expected number of games before the player will have a hand that beats the dealer's.&lt;/p&gt;&#xA;&lt;h3&gt;Input:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A positive integer, &lt;code&gt;0 &amp;lt; n &amp;lt; 6&lt;/code&gt; representing how many decks are in the shoe.&lt;/li&gt;&#xA;&lt;li&gt;A numerical or string representation of the dealer's full five-card hand. You're allowed to choose the representative encoding, and the input format, but please specify that in your answer. Examples could be &lt;code&gt;3H 2C KC QH JD&lt;/code&gt; for a card-value/suit combination, or assign each card a numerical value from &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;52&lt;/code&gt; (such as &lt;code&gt;Ace of Spades = 1, Two of Spades = 2, ... King of Hearts = 52&lt;/code&gt;). Your choice.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Output:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A single numeric value representing the expected number of hands that need to be dealt before the player is dealt a winning hand.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Examples:&lt;/h3&gt;&#xA;&lt;p&gt;&lt;em&gt;to be expanded&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 &amp;quot;2H 3C 4S 5C 7H&amp;quot; &amp;gt;&#xA;5 &amp;quot;22 33 45 17 8&amp;quot; &amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Meta Discussion:&lt;/h3&gt;&#xA;&lt;p&gt;Related (abandoned) challenge - &lt;a href=&quot;https://codegolf.stackexchange.com/q/32221/42963&quot;&gt;Generate random 7-carded poker hand for a given hand type&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Since the related challenge isn't exactly a duplicate, I don't think the below apply, but I'll link them here for discussion purposes:&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8281/42963&quot;&gt;Duplicates with different restrictions or no restrictions&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5022/42963&quot;&gt;Is it OK to copy a question if the old one is long dead?&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2090/42963&quot;&gt;Can we make use of abandoned sandbox posts?&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1875/42963&quot;&gt;Closing old question as duplicate of a new one&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-23T21:10:21.900" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8546" PostTypeId="1" CreationDate="2016-02-23T21:33:19.823" Score="8" ViewCount="423" Body="&lt;p&gt;Is there a &quot;best&quot; way to do this? I imagine one could write a bash script that would print the time, execute the program, and then print the time again, but perhaps there are pitfalls with this. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there a consensus on how times should be measured for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenges?&lt;/p&gt;&#xA;" OwnerUserId="45459" LastEditorUserId="20469" LastEditDate="2016-02-23T23:05:54.203" LastActivityDate="2016-03-06T20:46:06.143" Title="What is the best way to actually time an answer for fastest-code challenges" Tags="|discussion|scoring|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8547" PostTypeId="2" ParentId="8546" CreationDate="2016-02-23T23:07:37.863" Score="3" Body="&lt;p&gt;I doubt there could be a best way, but the following could help consistency:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use the &lt;code&gt;time&lt;/code&gt; command, as @Dennis suggested&lt;/li&gt;&#xA;&lt;li&gt;Execute the programs with as little background memory and CPU usage as possible (you could use a minimal linux distro, if you wanted the least noise).&lt;/li&gt;&#xA;&lt;li&gt;Time each execution several times and average, to reduce noise&lt;/li&gt;&#xA;&lt;li&gt;If the execution time is fast enough, you could consider counting cpu cycles with &lt;a href=&quot;http://valgrind.org/docs/manual/cl-format.html#cl-format.overview.example1&quot; rel=&quot;nofollow&quot;&gt;valgrind&lt;/a&gt;. The biggest downside is that, in my experience, it's several times slower.&lt;/li&gt;&#xA;&lt;li&gt;Instead of requiring that the full result be printed, consider outputting an abbreviated result or &lt;code&gt;return 0&lt;/code&gt; if it passes the given test cases (i.e. check inside the answer), to prevent differences due to IO&lt;/li&gt;&#xA;&lt;li&gt;If an answer is compiled, use options specified by the answer&lt;/li&gt;&#xA;&lt;li&gt;Consider normalizing the times or fitting them to a curve and comparing coefficients&lt;/li&gt;&#xA;&lt;li&gt;If the answers take IO input, you could write a script to generate input and time execution for more data points&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This boils down to the need for a script that uses more or less simple statistical methods and input generation to get best times. I would be happy to write a simple version in Haskell or Python if given an example challenge and several languages to support (It could also check cpu/memory load and return an error if out of acceptable ranges).&lt;/p&gt;&#xA;" OwnerUserId="48962" LastActivityDate="2016-02-23T23:07:37.863" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="8549" PostTypeId="1" CreationDate="2016-02-24T03:06:32.797" Score="12" ViewCount="144" Body="&lt;p&gt;We recently had a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/73920/golf-the-x%E1%B5%97%CA%B0-root-of-x&quot;&gt;rather short challenge&lt;/a&gt; without any test cases (EDIT: no longer true).  This sparked some conversation in chat, as well as some comments concerning its lack of test cases.&lt;/p&gt;&#xA;&lt;p&gt;As far as I can tell, we haven't formally set down any rules as to whether we need test cases or not.  Therefore:&lt;/p&gt;&#xA;&lt;h1&gt;Should test cases be required on challenges?&lt;/h1&gt;&#xA;&lt;p&gt;(Obviously, certain types of challenges inherently don't have test cases, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;, so I'm not talking about those)&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-24T03:27:50.213" Title="Should we require test cases?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8550" PostTypeId="2" ParentId="8549" CreationDate="2016-02-24T03:15:03.340" Score="20" Body="&lt;h2&gt;Require? No. Encourage? Certainly.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Test cases help clarify a challenge, but in the case of the challenge linked in the question, the task is so simple that test cases don't really add any substance or clarification.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What would we do if we &lt;em&gt;did&lt;/em&gt; require test cases? Close challenges as unclear until they have test cases? That seems overly strict, particularly in situations such as this.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-02-24T03:15:03.340" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8553" PostTypeId="1" CreationDate="2016-02-24T13:39:45.983" Score="11" ViewCount="276" Body="&lt;p&gt;I've been working on some upcoming challenges of mine, one of them a Traffic Light Simulator &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, the other a Mafia &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;There are certain elements I can include that makes the challenge significantly harder&lt;/strong&gt;.  In my Traffic Light Simulator, I can either make the roads all be the same length (easier), or a different length (harder).  In my Mafia challenge, I can only include the standard 4 roles in a 7 player game, or allow variations of roles (including role-changers) and variable number of players.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I want the best of both worlds:  Make it easy to participate, but also give a challenge for those so inclined.  &lt;strong&gt;In both of these cases, a submission to the more difficult challenge is competitive in the easier challenge&lt;/strong&gt; (ignoring any differences in input).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What am I allowed to do?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can I have multiple competitions in the same post (Two different scoreboards)?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can I post the easier challenge, and then the more difficult challenge (even though the easier one is a duplicate of the difficult one, but not vice versa)?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or, do I simply have to pick one of the variants?&lt;/p&gt;&#xA;" OwnerUserId="20198" LastActivityDate="2016-02-24T18:53:14.600" Title="Having both an &quot;easy&quot; challenge and a &quot;hard&quot; challenge" Tags="|discussion|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8555" PostTypeId="2" ParentId="8553" CreationDate="2016-02-24T16:33:37.693" Score="10" Body="&lt;p&gt;Pick one. To be specific, pick the harder one. The proportion of meaty challenges to ones which are won by a &amp;lt;20 char solution is strongly biased against the meaty challenges.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2016-02-24T16:33:37.693" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8557" PostTypeId="2" ParentId="8350" CreationDate="2016-02-24T17:55:41.887" Score="25" Body="&lt;p&gt;Feb 2017 - &lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt; See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7070/lets-customise-the-how-to-answer-pop-up&quot;&gt;this feature request&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://github.com/vihanb/PPCG-Design/blob/f6a8b8c02e3d1b63f20058e5fc86bc60159011b2/ppcg.user.js#L535&quot; rel=&quot;nofollow noreferrer&quot;&gt;This little blurb from Downgoat's PPCG Design Userscript&lt;/a&gt;:&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Before you post, take some time to read through the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;forbidden loopholes&lt;/a&gt; if you haven't done so already.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That appears right above the &lt;em&gt;Post your answer&lt;/em&gt; button when the script is enabled. Here's what it looks like as I type this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/1caHp.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/1caHp.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;    &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think a little recommendation (for main only, of course) to read this site's README.md is a good idea.&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2017-02-09T14:42:21.730" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8558" PostTypeId="1" CreationDate="2016-02-24T18:28:41.320" Score="-9" ViewCount="235" Body="&lt;p&gt;I have noticed that some new sandbox posts are being shutdown as duplicates of other much older posts.  There is nothing wrong with that.&lt;/p&gt;&#xA;&lt;p&gt;But I think there should be a time limit after which challenges can be reused.&lt;/p&gt;&#xA;&lt;p&gt;Specifically because of new langauges that allow for shorter solutions, and because they can still be fun!&lt;/p&gt;&#xA;&lt;p&gt;I understand that the we don't want copying answers and such, but that doesn't mean that the challenge can't be done again.&lt;/p&gt;&#xA;&lt;p&gt;I also know that we allow non-competing answers with newer languages.&lt;/p&gt;&#xA;&lt;h1&gt;But should we allow rehashes of old challenges?&lt;/h1&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-24T19:00:04.117" Title="When can challenges be reused?" Tags="|discussion|policy|challenges|duplicates|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8559" PostTypeId="2" ParentId="8558" CreationDate="2016-02-24T18:30:10.547" Score="-6" Body="&lt;h1&gt;Yes, they should be allowed after about 2 years since the old one.&lt;/h1&gt;&#xA;&lt;p&gt;Nothing says a challenge stops being fun after it fades away.&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-24T18:30:10.547" CommentCount="1" CommunityOwnedDate="2016-02-24T18:30:10.547" ContentLicense="CC BY-SA 3.0" />
  <row Id="8560" PostTypeId="2" ParentId="8558" CreationDate="2016-02-24T18:31:36.583" Score="-1" Body="&lt;h1&gt;No, but newer language answers should be allowed to be competitive.&lt;/h1&gt;&#xA;&lt;p&gt;Newer languages shouldn't miss out just because they were created later.&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-24T18:31:36.583" CommentCount="4" CommunityOwnedDate="2016-02-24T18:31:36.583" ContentLicense="CC BY-SA 3.0" />
  <row Id="8562" PostTypeId="2" ParentId="8558" CreationDate="2016-02-24T18:34:01.067" Score="15" Body="&lt;h1&gt;Challenges should never be reused.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If a challenge has been posted in the past and you think it would be fun to participate in it, participate in the existing challenge. Don't repost an old challenge because&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;strong&gt;It isn't your own work&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;It doesn't provide new content for the site&lt;/li&gt;&#xA;&lt;li&gt;By the very definition of the term, it's a duplicate.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-02-24T18:34:01.067" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8563" PostTypeId="2" ParentId="8553" CreationDate="2016-02-24T18:53:14.600" Score="4" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Can I have multiple competitions in the same post (Two different scoreboards)?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't think that's a good idea - you'd end up with questions answering either/both of the challenges, which would make it harder to navigate and see who you're playing against.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Can I post the easier challenge, and then the more difficult challenge (even though the easier one is a duplicate of the difficult one, but not vice versa)?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I think you could. If the difference in difficulty is significant, I wouldn't see them as duplicates - just variants of the same problem, which we already see from time to time. At least it would be clear that they are two different competitions, as opposed to two challenges in one post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Whether or not you should is another matter. Posting both might reduce the time people put on the challenges since you're dividing the effort between two similar questions and contestants might or might not want to duplicate their efforts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the end, you could ask in the Sandbox/in chat to see which of the variants sounds more interesting and post that one. If both are interesting, I'd wait until the first one has died down and &lt;em&gt;then&lt;/em&gt; post the other one.&lt;/p&gt;&#xA;" OwnerUserId="49411" LastActivityDate="2016-02-24T18:53:14.600" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8564" PostTypeId="2" ParentId="8544" CreationDate="2016-02-24T19:34:43.757" Score="9" Body="&lt;p&gt;Looks like either a.) someone took care of this, or b.) it was caching.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/hCKTC.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/hCKTC.png&quot; alt=&quot;fixed_lel&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A picture with freehand red circles &lt;em&gt;and&lt;/em&gt; some freehand red text is worth a million words + one for each freehand word.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-02-24T19:34:43.757" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8565" PostTypeId="2" ParentId="2140" CreationDate="2016-02-24T20:05:30.560" Score="1" Body="&lt;h1&gt;Traffic Light Simulator 2016&lt;/h1&gt;&#xA;&lt;p&gt;In this challenge, you are in charge of all of the traffic lights in a busy city.  It is your goal to move the traffic as efficiently as possible.&lt;/p&gt;&#xA;&lt;h2&gt;Definitions:&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;City&lt;/strong&gt;: Everything you control.  Contains a 10x10 square grid of intersections.  All adjacent intersections are connected via roads, and intersections on an edge have 1 outside connection  (2 on corners)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Tick&lt;/strong&gt;: Measures time.  For the first 10,000 ticks, 10 cars will span.  The simulation ends after all cars have left the city.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Road&lt;/strong&gt;:  Moves cars from one intersection to another (or an outside connection).  Roads have a length (in ticks).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Intersection&lt;/strong&gt;: 12-way intersection.  Connects 4 roads together, and allows cars to move from one road to one of the other 3.  Only 1 car per direction can travel through at a time.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Traffic Light&lt;/strong&gt;:  Allows/Prevents cars from crossing an intersection.  There are 12 lights (one for each direction) at each intersection.  Lights can only be green (allows traffic) or red (prevents traffic).  If a light is green, then any intersecting paths must have been red for at least 3 ticks.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Intersecting paths&lt;/strong&gt;: Paths that cross or meet assuming right-side traffic.  The following graph indicates when two paths intersect given your direction and the other lanes' directions.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Your        Left  Right Across&#xA;Direction  |L|R|A|L|R|A|L|R|A &#xA;------------------------------&#xA;Left       |X   X|X   X|  X X&#xA;Straight   |X   X|X X X|X    &#xA;Right      |    X|     |X    &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Car&lt;/strong&gt;: Starts at a random outside connection, and travels the shortest path to another random outside connection.  After reaching its destination, adds &lt;em&gt;1.05^(TravelDuration)&lt;/em&gt; to your score.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Outside connection&lt;/strong&gt;:  Has a &lt;em&gt;Busyness&lt;/em&gt;, and spawns cars.  The chance of an outside connection being randomly chosen is &lt;em&gt;Busyness/Sum(Busyness of every connection)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Your goal:&lt;/h2&gt;&#xA;&lt;p&gt;I have provided a controller that will simulate the cars and the cities.  You need to provide a function that returns a list of &lt;code&gt;[x,y,Direction]&lt;/code&gt; tuples that indicates which lights you would like to toggle.  Attempting to turn a green light with intersecting green lights will turn the intersecting lights red, and turn the light green after 3 turns.&lt;/p&gt;&#xA;&lt;p&gt;After the simulation has run, your score is the sum of all cars' scores, lowest score wins.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-24T20:05:30.560" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8567" PostTypeId="1" AcceptedAnswerId="8568" CreationDate="2016-02-25T02:20:51.437" Score="23" ViewCount="325" Body="&lt;p&gt;Several benefits come with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8538/3808&quot;&gt;graduation&lt;/a&gt;, including the ability to set up migration paths to and from the site. This would entail a close option under &lt;em&gt;close -&gt; off-topic -&gt; belongs on another site&lt;/em&gt;, which currently only has meta.PPCG as an option for non-moderators:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Mnebg.png&quot; alt=&quot;screenshot&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If three or more users vote to close using a &quot;migrate to Stack Overflow&quot; option, the question would then be locked and eventually deleted here, and it would immediately appear on Stack Overflow just like a normal question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/q/10249/180276&quot;&gt;See this post on meta.SE for more information about how migration works.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The most likely migration target for now is Stack Overflow. Should we set up a migration path so that regular users can migrate off-topic questions to Stack Overflow?&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2016-02-25T02:48:53.930" Title="Should there be a migration path from PPCG to Stack Overflow?" Tags="|discussion|migration|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8568" PostTypeId="2" ParentId="8567" CreationDate="2016-02-25T02:42:13.433" Score="25" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'm not sure we need &lt;em&gt;any&lt;/em&gt; specific outbound migration paths right now. In the interests of &lt;strong&gt;&lt;a href=&quot;https://meta.stackexchange.com/a/91446/212780&quot;&gt;Don't Migrate Crap&lt;/a&gt;&lt;/strong&gt;, I think it's important to note that we rarely ever get a question that fulfills three &lt;em&gt;basic&lt;/em&gt; criteria for migration:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1) Is off-topic here&lt;br&gt;&#xA;2) Is on-topic elsewhere&lt;br&gt;&#xA;3) Is not terribly written&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Until we get more of them, I think it's not worth dedicating a route to specific sites. The easier it is to migrate crap, the more likely we'll &lt;em&gt;be&lt;/em&gt; to migrate crap, and other sites won't thank us for it.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2016-02-25T02:48:53.930" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8569" PostTypeId="2" ParentId="8567" CreationDate="2016-02-25T02:46:48.487" Score="6" Body="&lt;h2&gt;Yes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;One of the most common types of off-topic questions we get are ones that would be better served on Stack Overflow, so we should make it easier for users to send content where it belongs. In fact, we already direct users to Stack Overflow in one of our close reasons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, speaking as a (at least formerly) active user on Stack Overflow, I think that many of these questions would not be well received there in the form in which they end up here. However, at least they'd &lt;em&gt;be in the right place&lt;/em&gt;. Here, the best we can say is &quot;This is off topic.&quot; But on SO they can say, &quot;What have you tried? Can you elaborate on this or that?&quot; They actually have a shot at helping the misguided user with their question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Geobits makes an excellent point that crap should not be migrated. So if we are to go forward with implementing this migration path, we should make sure that users know when—and more importantly when &lt;em&gt;not&lt;/em&gt;—to migrate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In all, I think we should go ahead with this. I think there are more benefits to having the path than to not having it.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-02-25T02:46:48.487" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="8570" PostTypeId="1" AcceptedAnswerId="8811" CreationDate="2016-02-25T04:32:34.353" Score="40" ViewCount="602" Body="&lt;p&gt;Recently @Community♦︎ has been constantly &lt;a href=&quot;https://codegolf.meta.stackexchange.com/posts/2140/revisions&quot;&gt;protecting&lt;/a&gt; our beloved Sandbox.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/nLMHD.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/nLMHD.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7084/40695&quot;&gt;rep threshold&lt;/a&gt; for meta has been decreased specifically to grant new users access to the Sandbox so they can post their proposed challenges. Having the Sandbox protected, conflicts this raising the rep requirement up to +10 to post an answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It seems that because of some new users &lt;a href=&quot;https://meta.stackexchange.com/a/238929/204010&quot;&gt;deleting their / posing new sandbox posts&lt;/a&gt; or some other reason, @Community is assuming the Sandbox is attracting bad quality answers.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Can the sandbox's auto-protection somehow be disabled or at least the threshold for auto-protection be changed? I don't know if this is possible, but I can ask nicely :3&lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="31716" LastEditDate="2017-08-05T17:53:09.743" LastActivityDate="2017-08-05T17:53:09.743" Title="Community is being Overprotective of the Sandbox" Tags="|feature-request|status-completed|sandbox|protected-questions|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8571" PostTypeId="2" ParentId="2140" CreationDate="2016-02-25T06:09:59.087" Score="1" Body="&lt;h1&gt;How Many Laps?&lt;/h1&gt;&#xA;&lt;p&gt;I was at my taekwondo training last night and the first thing we do when we start is a ~5 min jog around the gym to get warmed up. The problem is as follows. We run around the edge of the gym, everyone starting from wherever they like, and everyone jogs at a slightly different speed, so there is a lot of awkward passing as no one wants to have to ruin their &lt;em&gt;&lt;strong&gt;flow&lt;/strong&gt;&lt;/em&gt; by changing speed. So i started wondering, how many times will each person be overtaken?&lt;/p&gt;&#xA;&lt;h3&gt;The Question&lt;/h3&gt;&#xA;&lt;p&gt;Given a square of side lengths 15m, and a person starting at each corner of the square, running at speed &lt;em&gt;&lt;strong&gt;n (m/s)&lt;/strong&gt;&lt;/em&gt; how many times will each person be passed by someone else during a 5 min jog?&lt;/p&gt;&#xA;&lt;h3&gt;Input/Output&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input should take the form of 4 values that represent each persons average running  speed( Assume their speed remains constant) accurate to 3 decimal places. The range of the input may be &lt;code&gt;(0,5]&lt;/code&gt;. Input may be seperated by commas or spaces i.e &lt;code&gt;4.123,2.122,3.145,1.445&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Output should be printed as 4 integers representing the number of times each person was overtaken by someone else, given in the same order as the input was supplied.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&lt;p&gt;The input &lt;code&gt;1.3334 2.5334 1.1344 2.8531&lt;/code&gt; can be visually represented as follows&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1.3334 ------------ 2.5334&#xA;   |                   |&#xA;   |                   |&#xA;   |                   |&#xA;   |                   |&#xA;   |                   |&#xA; 2.8531 ------------ 1.1344 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Each of the numbers in the corner of the square represents a jogger and their speed running in a clockwise direction(Clockwise because of the order of the input). After 5 mins of jogging, how many times will each jogger have been overtaken by everyone else?&lt;/p&gt;&#xA;&lt;p&gt;The output for this case would be &lt;code&gt;13 1 14 0 &lt;/code&gt;&#xA;This basically means the first person( top left corner) will be overtaken 13 times. The second person(top right) will be overtaken once. third person(bottom right, and the slowest jogger) will be overtaken 14 times. The fourth person( bottom left, and the fastest) will not be overtaken by anyone, as they are the fastest. Here are some more test cases&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input: &lt;code&gt;5.3334 1.5334 1.5334 0.8531&lt;/code&gt;   Output: &lt;code&gt;0 19 19 28 &lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Input: &lt;code&gt;0.1334 1.5334 2.5334 3.8531&lt;/code&gt;   Output: &lt;code&gt;37 16 6 0 &lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is code golf, shortest working program in bytes wins&lt;/li&gt;&#xA;&lt;li&gt;Must be a fully working program&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49605" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-26T04:30:18.200" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8574" PostTypeId="2" ParentId="2140" CreationDate="2016-02-25T10:27:28.870" Score="1" Body="&lt;h2&gt;The broken minus parser &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Sam is trying to create a new programming language, but is having a lot of trouble getting the parser right. For example,&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4--5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;evaluates correctly to &lt;code&gt;4 - (-5) = 9&lt;/code&gt;, but&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4-5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is giving a result of &lt;code&gt;-20&lt;/code&gt;!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After doing some digging around, Sam realises that their parser's grammar is ambiguous. In fact, it's actually interpreting &lt;code&gt;4-5&lt;/code&gt; as &lt;code&gt;4 (-5)&lt;/code&gt;, multiplication (by juxtaposition) between two numbers!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's some example inputs and outputs, to get a feel for what the parser's doing woeful wrong:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input             Calculation                 Output&#xA;7                 7                           7&#xA;-7                (-7)                        -7&#xA;8-3               8 (-3)                      -24&#xA;8--3              8 - (-3)                    11&#xA;-8-3              (-8) (-3)                   24&#xA;-8--3             (-8) - (-3)                 -5&#xA;-4-5-2            (-4) (-5) (-2)              -40&#xA;-4--5-2           ((-4) - (-5)) (-2)          -2&#xA;-4-5--2           (-4) ((-5) - (-2))          12&#xA;-4--5--2          (-4) - (-5) - (-2)          3&#xA;1-4-5-9           1 (-4) (-5) (-9)            -180&#xA;1-4--5-9          1 ((-4) - (-5)) (-9)        -9&#xA;1--4-5--9         (1 - (-4)) ((-5) - (-9))    20&#xA;1--4--5--9        1 - (-4) - (-5) - (-9)      19&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;To be a bit more explicit, here's the rules followed by the parser, in order:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Multiplication by juxtaposition&lt;/strong&gt;: If possible, split the input into two valid parts &lt;code&gt;a&lt;/code&gt;, &lt;code&gt;b&lt;/code&gt; such that &lt;code&gt;a&lt;/code&gt; is as short as possible. Return &lt;code&gt;evaluate(a) * evaluate(b)&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Subtraction&lt;/strong&gt;: If the input is of the form &lt;code&gt;a-b&lt;/code&gt; where &lt;code&gt;a&lt;/code&gt;, &lt;code&gt;b&lt;/code&gt; are two valid parts, return &lt;code&gt;evaluate(a) - evaluate(b)&lt;/code&gt;, taking the &lt;code&gt;-&lt;/code&gt; such that &lt;code&gt;b&lt;/code&gt; is as short as possible.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Unary negation&lt;/strong&gt;: If the input is of the form &lt;code&gt;-a&lt;/code&gt; where &lt;code&gt;a&lt;/code&gt; is valid and does not start with a &lt;code&gt;-&lt;/code&gt;, return &lt;code&gt;-evaluate(a)&lt;/code&gt;. In other words, unary negation can only be applied once.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Digit&lt;/strong&gt;: If the input consists of a single digit, return the corresponding integer.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;If an input string fails to satisfy any of the above conditions, it is invalid. For example, the following strings are invalid:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(empty)&#xA;-&#xA;7-&#xA;--7&#xA;8---3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;The task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a valid string consisting of &lt;code&gt;0123456789-&lt;/code&gt;, output the result as interpreted by Sam's broken parser. Invalid input is undefined behaviour. You may assume the usual &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;code golf defaults&lt;/a&gt; for input and output, e.g. programs and functions are both okay.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox notes:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'll work on the algorithm description a bit later so it doesn't sound so much like &quot;just implement this&quot;.&lt;/li&gt;&#xA;&lt;li&gt;Will add more test cases later.&lt;/li&gt;&#xA;&lt;li&gt;Should &lt;code&gt;eval&lt;/code&gt;-like functions be allowed? I'm not sure how much they'd help here&lt;/li&gt;&#xA;&lt;li&gt;With the current rules, &lt;code&gt;42&lt;/code&gt; would evaluate to &lt;code&gt;4*2=8&lt;/code&gt;. Would it be preferable to state that input will never have two or more digits in a row?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="21487" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:26.847" LastActivityDate="2016-02-26T05:32:18.400" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8576" PostTypeId="2" ParentId="2140" CreationDate="2016-02-25T18:34:31.367" Score="1" Body="&lt;h2&gt;Visualize the Euclidean Algorithm by Tiling Rectangles&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;META: What's your opinion on moving this to a pop-con instead of a code-golf?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Suppose we have two positive integers, &lt;em&gt;m&lt;/em&gt; and &lt;em&gt;n&lt;/em&gt;. We can use &lt;a href=&quot;https://en.wikipedia.org/wiki/Euclidean_algorithm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Euclid's algorithm&lt;/a&gt; to calculate the &lt;em&gt;greatest common divisor&lt;/em&gt; of these two numbers (the largest number that divides both numbers without a remainder). This is done by essentially taking successive subtractions of remainders until you reach zero. The linked Wikipedia article goes into much greater depth, and the mathematics behind it, for the curious.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here, though, we're going to visualize the algorithm by taking a rectangle of size &lt;em&gt;m&lt;/em&gt; x &lt;em&gt;n&lt;/em&gt; and recursively tiling the rectangle with successively smaller and smaller squares until all space is consumed. The length of the side of the smallest square is thus the &lt;code&gt;gcd(m,n)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Assuming &lt;em&gt;m&lt;/em&gt; &gt;= &lt;em&gt;n&lt;/em&gt;, the first square is of size &lt;em&gt;n&lt;/em&gt; x &lt;em&gt;n&lt;/em&gt;, and is placed against the bottom edge. This repeats until a square does not fit, leaving a rectangle of size &lt;em&gt;n&lt;/em&gt; x &lt;em&gt;(m-kn)&lt;/em&gt; remaining, where &lt;em&gt;k&lt;/em&gt; is how many &lt;em&gt;n&lt;/em&gt; x &lt;em&gt;n&lt;/em&gt; squares fit. That process then repeats on the newly-formed rectangle, starting on the left side, then the bottom, then the left, etc., until the original &lt;em&gt;m&lt;/em&gt; x &lt;em&gt;n&lt;/em&gt; rectangle is fully tiled.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's a beautifully done animated example, from that Wikipedia page, of 1071 and 462, showing the result to be 21.&lt;br&gt;&#xA;&lt;sub&gt;By Proteins (Own work) &lt;a href=&quot;http://creativecommons.org/licenses/by-sa/3.0&quot; rel=&quot;nofollow noreferrer&quot;&gt;CC BY-SA 3.0&lt;/a&gt;, via Wikimedia Commons.&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/CcqjY.gif&quot; width=&quot;200&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Two distinct positive integers, &lt;em&gt;m&lt;/em&gt; and &lt;em&gt;n&lt;/em&gt;, via any convenient input method. Without loss of generality, you can assume &lt;em&gt;m&lt;/em&gt; &gt; &lt;em&gt;n&lt;/em&gt; (for example, if you take input as a tuple, your program can assume that the first element is always the larger of the two, and you don't need to test size).&lt;/li&gt;&#xA;&lt;li&gt;Your implementation should be able to handle input up to your language's default &lt;code&gt;int&lt;/code&gt; size (or equivalent).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An image of at least 300px square, but no bigger than 1200px square, showing a rectangle of proportion &lt;em&gt;m&lt;/em&gt; x &lt;em&gt;n&lt;/em&gt;, tiled with successively smaller squares as described above. This means that for small inputs the rectangle will need to be stretched, and for large inputs the rectangle will need to be shrunk.&lt;/li&gt;&#xA;&lt;li&gt;The image must be oriented so that &lt;em&gt;m&lt;/em&gt; (the larger) is the vertical dimension and &lt;em&gt;n&lt;/em&gt; is the horizontal.&lt;/li&gt;&#xA;&lt;li&gt;Squares of the same size must be distinct. This could be done by coloring the squares differently from their neighbors, by enclosing each square in a border (as in the above animation), etc.&lt;/li&gt;&#xA;&lt;li&gt;Output does not necessarily need to be in color, so long as the squares are distinct and understandable.&lt;/li&gt;&#xA;&lt;li&gt;The image can be displayed on-screen or saved to a file.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;[TODO]&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="42963" LastEditDate="2016-04-29T13:59:05.003" LastActivityDate="2016-04-29T13:59:05.003" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8580" PostTypeId="2" ParentId="2447" CreationDate="2016-02-25T22:52:07.040" Score="40" Body="&lt;h1&gt;Programs may take input as the value of the last expression&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Using something like TI-84 BASIC's &lt;code&gt;Ans&lt;/code&gt;, which is a variable that stores the value of the last expression. This the shortest way for TI-BASIC to take input, but its validity was &lt;a href=&quot;https://codegolf.stackexchange.com/a/73977/29750&quot;&gt;recently questioned&lt;/a&gt;. To be clear, this is how the process works with &lt;code&gt;Ans&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Within a program, type the input (number, list, string, etc.), followed by a newline to separate statements, followed by the program name, then press Enter. For example,&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1337&#xA;prgmFACTOR&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Outside a program, type the input, press Enter, then type the program name and press Enter.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Edit: I came across a way of using &lt;code&gt;Ans&lt;/code&gt; that is similar to command-line arguments, which are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2449/29750&quot;&gt;allowed&lt;/a&gt;: All as one expression, type the input, followed by a colon, followed by &lt;code&gt;pgrmNAMEHERE&lt;/code&gt;. For example, &lt;code&gt;1337:pgrmFACTOR&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="29750" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2017-01-09T19:09:35.543" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="8585" PostTypeId="2" ParentId="8389" CreationDate="2016-02-26T17:50:34.047" Score="-1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/qlnNM.png&quot; alt=&quot;Programming Puzzles &amp;amp; Code Golf - may our source lengths be low&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="48538" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-02-26T17:50:34.047" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8586" PostTypeId="2" ParentId="2140" CreationDate="2016-02-26T18:08:37.790" Score="2" Body="&lt;h1&gt;The greatest power...&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Yeah, I'm still trying to come up with a better title...&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A positive integer &lt;code&gt;n&lt;/code&gt; is a &lt;em&gt;perfect power of order &lt;code&gt;k&lt;/code&gt;&lt;/em&gt; if it can be written in the form &lt;code&gt;m&lt;sup&gt;k&lt;/sup&gt;&lt;/code&gt; for some integer &lt;code&gt;m&lt;/code&gt;. The &lt;em&gt;greatest power&lt;/em&gt; of &lt;code&gt;n&lt;/code&gt; is the largest number &lt;code&gt;k&lt;/code&gt; for which &lt;code&gt;n&lt;/code&gt; is a perfect power of order &lt;code&gt;k&lt;/code&gt;. Some examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;9 = 3&lt;sup&gt;2&lt;/sup&gt;&lt;/code&gt; is a perfect square, and it cannot be written in the form &lt;code&gt;m&lt;sup&gt;k&lt;/sup&gt;&lt;/code&gt; for &lt;code&gt;k &amp;gt; 2&lt;/code&gt;, so it's greatest power is &lt;code&gt;2&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;16 = 4&lt;sup&gt;2&lt;/sup&gt;&lt;/code&gt; is also a perfect square. However it can also be written as &lt;code&gt;16 = 2&lt;sup&gt;4&lt;/sup&gt;&lt;/code&gt;, so it's greatest power is &lt;code&gt;4&lt;/code&gt; instead.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;24 = 24&lt;sup&gt;1&lt;/sup&gt;&lt;/code&gt; is not a perfect power of any order &lt;code&gt;k &amp;gt; 1&lt;/code&gt; so it's greatest power is &lt;code&gt;1&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a positive integer &lt;code&gt;n &amp;gt; 1&lt;/code&gt;, determine its greatest power. This is OEIS entry &lt;a href=&quot;https://oeis.org/A052409&quot; rel=&quot;nofollow noreferrer&quot;&gt;A052409&lt;/a&gt; (with &lt;code&gt;a(1)&lt;/code&gt; defined as &lt;code&gt;0&lt;/code&gt;, but you don't need to handle that).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may write a program or function, taking input via STDIN (or closest alternative), command-line argument or function argument and outputting the result via STDOUT (or closest alternative), function return value or function (out) parameter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first 100 terms of the sequence (starting from &lt;code&gt;n = 2&lt;/code&gt;) are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, &#xA;3, 1, 1, 1, 1, 5, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, &#xA;1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, &#xA;1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-02-26T18:08:37.790" CommentCount="18" ContentLicense="CC BY-SA 3.0" />
  <row Id="8588" PostTypeId="2" ParentId="2140" CreationDate="2016-02-27T00:33:11.563" Score="3" Body="&lt;h1&gt;Radiation-Protected Expressions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write a program, taking an integer n as input from -999,999 to 999,999 inclusive, that returns a string representing a valid expression evaluating to that number in your language.&#xA;The catch: this expression must NOT evaluate to any other number when evaluated if any single character is removed from it. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Restrictions&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your program must be &amp;lt;= 1024 bytes in length.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The outputted expressions must be in the same language as the generating program.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your score is the number of bytes in the largest string generated by your program for the entire range of valid numbers. Tiebreakers go to shortest code.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples of Valid Outputs &lt;em&gt;(in JavaScript)&lt;/em&gt;&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;Math.PI|0||3&lt;/code&gt; for n=3, because:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;ath.PI|0||3&lt;/code&gt;, &lt;code&gt;Mth.PI|0||3&lt;/code&gt;, &lt;code&gt;Mah.PI|0||3&lt;/code&gt;, and &lt;code&gt;Mat.PI|0||3&lt;/code&gt; cause ReferenceErrors,&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;MathPI|0||3&lt;/code&gt; causes a ReferenceError,&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;Math.P|0||3&lt;/code&gt;, &lt;code&gt;Math.I|0||3&lt;/code&gt;, and &lt;code&gt;Math.PI0||3&lt;/code&gt; result in 3,&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;Math.PI|||3&lt;/code&gt; causes a SyntaxError,&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;Math.PI|0|3&lt;/code&gt; results in 3, and&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;Math.PI|0||&lt;/code&gt; causes a SyntaxError.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;9*(8)&lt;/code&gt; is valid for n=72&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;(n=9e5)&amp;gt;96?n:9e5&lt;/code&gt; for n=900,000&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;1&lt;/code&gt; for n=1&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Examples of Invalid Outputs &lt;em&gt;(in JavaScript)&lt;/em&gt;&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;1e2&lt;/code&gt; for n=100 because &lt;code&gt;12&lt;/code&gt; is a valid expression that evaluates to a number other than 100.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42844" LastEditorUserId="42844" LastEditDate="2016-02-27T19:31:47.437" LastActivityDate="2016-02-27T19:31:47.437" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8589" PostTypeId="2" ParentId="8494" CreationDate="2016-02-27T02:57:51.907" Score="11" Body="&lt;h1&gt;No, do not count it.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This may seem counter-intuitive at first glance, but it is in fact consistent with how we count bytes.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;We don't count separators in other languages.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def f(x):return 2*x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is counted as 19 bytes in Python,&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f()(echo $[2*$1])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is counted as 17 bytes in Bash, and&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f(x)=2x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is counted as 7 bytes in Julia.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All of these function declarations require a newlines before or after them to separate them from the rest of the code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Counting&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;D+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;as 2 bytes is consistent with that way of counting.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;We &lt;em&gt;shouldn't&lt;/em&gt; count separators in Vitsy or any other language.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All four snippets define a function on their own, without any surrounding whitespace. A newline is only required if we want to add additional code to the program (like some code that actually calls the function), but not otherwise.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Separating the function declaration from the caller is part of calling it, not of declarating it, so it shouldn't contribute to the byte count.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It would be different if we had to submit &lt;em&gt;two&lt;/em&gt; functions to a challenge. For example,&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;D+&#xA;3*&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;should count as 5 bytes, since we need to separate functions somehow.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is consistent with how we count bytes for source code that consists of different files (added byte count, plus one extra byte for every file &lt;em&gt;but the first&lt;/em&gt;).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;The newline &quot;names the function&quot;.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In Python, we allow&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;lambda x:2*x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;as well, since it evaluates to a function. To name it (which is required to make the function reusable), we surround it by &lt;code&gt;f=&lt;/code&gt; and a newline, none of which contribute to the byte count.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Prepending a newline to &lt;code&gt;D+&lt;/code&gt; is akin to that, since the function is now callable as &lt;code&gt;&amp;lt;N&amp;gt;m&lt;/code&gt;, where &lt;code&gt;N&lt;/code&gt; is the 0-based line number.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;It defines a function, even without a newline.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+D&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;consists of a single, &quot;main&quot; function, which is callable as &lt;code&gt;0m&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main function is executed automatically (which may not be what we want at all), but it is still a callable function.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2016-02-27T02:57:51.907" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8590" PostTypeId="1" CreationDate="2016-02-27T03:06:27.043" Score="1" ViewCount="51" Body="&lt;p&gt;Meta SE (and all in-site metas) requires you to use one of the tags &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/discussion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/feature-request&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/support&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/bug&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt; in every question you post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code Golf also has various challenge types and questions without a challenge type get closed. So can we have the same restriction here as well, wherein a question cannot be submitted unless it has one of the challenge type tags? (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; etc.)&lt;/p&gt;&#xA;" OwnerUserId="40929" LastEditorUserId="68942" LastEditDate="2021-06-09T05:43:38.333" LastActivityDate="2021-06-09T05:43:38.333" Title="Necessary tag for each question" Tags="|feature-request|status-declined|tags|" AnswerCount="0" CommentCount="8" ClosedDate="2016-02-27T04:06:59.063" ContentLicense="CC BY-SA 3.0" />
  <row Id="8591" PostTypeId="1" CreationDate="2016-02-27T08:18:27.883" Score="-4" ViewCount="143" Body="&lt;p&gt;Is Programming Puzzles &amp;amp; Code Golf the right place to ask my question:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Which programming or description language has the most / least reserved words?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question will have &lt;em&gt;rules&lt;/em&gt; to limit the answers :).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The language is a&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;imperative,&lt;/li&gt;&#xA;&lt;li&gt;declarative or&lt;/li&gt;&#xA;&lt;li&gt;functional&lt;br&gt;&#xA;&lt;em&gt;programming language&lt;/em&gt; (PL) or&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;a &lt;em&gt;description language&lt;/em&gt; (DL).&lt;/li&gt;&#xA;&lt;li&gt;The language can be a domain specific language (DSL).&lt;/li&gt;&#xA;&lt;li&gt;A &lt;em&gt;reserved word&lt;/em&gt; is a&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;keyword,&lt;/li&gt;&#xA;&lt;li&gt;built-in function and&lt;/li&gt;&#xA;&lt;li&gt;contextual reserved word.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;A &lt;em&gt;keyword&lt;/em&gt; is a word that can not be used as an identifier like &lt;code&gt;if&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Built-in functions or procedures are functions built into the language and are not part of a library. The are always accessable in all scopes and can not be unloaded from the current scope. Example: &lt;code&gt;print&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Contextual reserved words are reserved words in a context. Outside of the context they can be freely used.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Example answer:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Language:   VHDL (Very High Speed Hardware Description Language)&#xA;Type:       Description Language&#xA;Keywords:   115&#xA;Built-ins:  0&#xA;Contextual: 0&#xA;---------------------------&#xA;Reserved words: 115&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="48608" LastEditorUserId="48608" LastEditDate="2016-02-27T14:14:35.910" LastActivityDate="2016-02-27T14:14:35.910" Title="Is PP&amp;CG the right place to ask my question?" Tags="|discussion|asking-questions|" AnswerCount="1" CommentCount="4" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8592" PostTypeId="2" ParentId="8591" CreationDate="2016-02-27T11:22:56.610" Score="16" Body="&lt;h1&gt;I do not think so.&lt;/h1&gt;&#xA;&lt;p&gt;This site is for &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;challenges and contests&lt;/a&gt; and your question does not seem to include any kind of challenge. You can fully answer this question yourself just by looking at the docs of the programming languages you want to consider.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-27T11:22:56.610" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8593" PostTypeId="2" ParentId="2140" CreationDate="2016-02-27T11:37:24.197" Score="0" Body="&lt;h1&gt;Dice sums from side values&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I rolled some dice and put them on the table with their sides touching and forming one object with 8 horizontal sides. This means I put the dice in one of these formations (up to rotations):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;xx   x&#xA;xx   xx  xxx&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I read the number pips on the 8 horizontal sides in counter clockwise direction. You should write a program or function that given the list of the 8 horizontal sides in counter clockwise order returns a list of possible sums of the top pips from the dice rolling.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The layout of a die is always the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;    +---+&#xA;    | 1 |&#xA;+---+---+---+---+&#xA;| 2 | 3 | 5 | 4 |&#xA;+---+---+---+---+&#xA;    | 6 |&#xA;    +---+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For example if the input is &lt;code&gt;3 2 1 1 2 6 6 5&lt;/code&gt; there are four possible configurations with top views:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;623, 633, 643, 653 giving the output list 11, 12, 13, 14&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;with the sides always being&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 566&#xA;3XXX2&#xA; 211&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For the input &lt;code&gt;1 1 2 2 3 3 2 2&lt;/code&gt; there is only one configuration with the top view:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;46&#xA;31 giving the one element output list 14&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is code golf so the shortest entry wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Related code golf with a single die: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44345/determine-dice-value-from-side-view&quot;&gt;Determine dice value from side view&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="7311" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.193" LastActivityDate="2016-02-27T11:37:24.197" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8594" PostTypeId="2" ParentId="2140" CreationDate="2016-02-27T12:31:10.680" Score="8" Body="&lt;h2&gt;Count the cubes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here is a picture of a diamond tiling shamelessly stolen from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/51222/random-ascii-art-of-the-day-5-diamond-tilings&quot;&gt;Random ASCII Art of the Day #5: Diamond Tilings&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/vWbjJ.png&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However it also has the property of representing a 3D isometric view of a 5×5×5 cube with 59 cubes removed, leaving 66 behind. (Cubes obscured by other cubes are assumed to exist.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is, given an ASCII art representation of a diamond tiling, is to output both the number of cubes removed and remaining. For example (some shamelessly stolen from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/50562/scale-up-a-diamond-tiling&quot;&gt;Scale up a Diamond Tiling&lt;/a&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  ____&#xA; /   /\&#xA;/___/  \ -&amp;gt; 1 0 or 0 1&#xA;\   \  /&#xA; \___\/&#xA;  ________&#xA; /   /\   \&#xA;/___/  \___\ -&amp;gt; 1 1&#xA;\   \  /   /&#xA; \___\/___/&#xA;  ____________&#xA; /   /\   \   \&#xA;/___/  \___\___\ -&amp;gt; 2 1 or 1 2&#xA;\   \  /   /   /&#xA; \___\/___/___/&#xA;  ________________&#xA; /   /\   \   \   \&#xA;/___/  \___\___\___\ -&amp;gt; 3 1 or 1 3&#xA;\   \  /   /   /   /&#xA; \___\/___/___/___/&#xA;  ________&#xA; /\   \   \&#xA;/  \___\___\&#xA;\  /   /\   \&#xA; \/___/  \___\ -&amp;gt; 3 1 or 1 3&#xA;  \   \  /   /&#xA;   \___\/___/&#xA;    ________&#xA;   /   /\   \&#xA;  /___/  \___\ -&amp;gt; 3 1 or 1 3&#xA; /\   \  /   /&#xA;/  \___\/___/&#xA;\  /   /   /&#xA; \/___/___/&#xA;    ____&#xA;   /   /\&#xA;  /___/  \&#xA; /\   \  /\&#xA;/  \___\/  \ -&amp;gt; 3 1 or 1 3&#xA;\  /   /\  /&#xA; \/___/  \/&#xA;  \   \  /&#xA;   \___\/&#xA;    ________&#xA;   /   /\   \&#xA;  /___/  \___\&#xA; /\   \  /   /\&#xA;/  \___\/___/  \ -&amp;gt; 4 4&#xA;\  /   /\   \  /&#xA; \/___/  \___\/&#xA;  \   \  /   /&#xA;   \___\/___/&#xA;      ____________&#xA;     /   /   /\   \&#xA;    /___/___/  \___\&#xA;   /   /\   \  /\   \&#xA;  /___/  \___\/  \___\&#xA; /\   \  /   /\  /   /\&#xA;/  \___\/___/  \/___/  \ -&amp;gt; 16 11 or 11 16&#xA;\  /   /\   \  /   /\  /&#xA; \/___/  \___\/___/  \/&#xA;  \   \  /   /\   \  /&#xA;   \___\/___/  \___\/&#xA;    \   \   \  /   /&#xA;     \___\___\/___/&#xA;      ____________________&#xA;     /   /\   \   \   \   \&#xA;    /___/  \___\___\___\___\&#xA;   /\   \  /\   \   \   \   \&#xA;  /  \___\/  \___\___\___\___\&#xA; /\  /   /\  /   /   /   /\   \&#xA;/  \/___/  \/___/___/___/  \___\&#xA;\  /\   \  /   /\   \   \  /   /\&#xA; \/  \___\/___/  \___\___\/___/  \ -&amp;gt; 40 20 or 20 40&#xA;  \  /   /\   \  /   /\   \   \  /&#xA;   \/___/  \___\/___/  \___\___\/&#xA;    \   \  /   /\   \  /   /   /&#xA;     \___\/___/  \___\/___/___/&#xA;      \   \   \  /   /   /   /&#xA;       \___\___\/___/___/___/&#xA;        ________________&#xA;       /   /\   \   \   \&#xA;      /___/  \___\___\___\&#xA;     /\   \  /\   \   \   \&#xA;    /  \___\/  \___\___\___\&#xA;   /\  /   /\  /   /   /\   \&#xA;  /  \/___/  \/___/___/  \___\&#xA; /\  /\   \  /   /   /\  /\   \&#xA;/  \/  \___\/___/___/  \/  \___\ -&amp;gt; 46 18 or 18 46&#xA;\  /\  /   /\   \   \  /\  /   /&#xA; \/  \/___/  \___\___\/  \/___/&#xA;  \  /\   \  /   /\   \  /   /&#xA;   \/  \___\/___/  \___\/___/&#xA;    \  /\   \   \  /   /   /&#xA;     \/  \___\___\/___/___/&#xA;      \  /   /   /   /   /&#xA;       \/___/___/___/___/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The output can be in any reasonable format, e.g. an array return value or a string with whitespace, but it must contains both values, even if they are the same, however the order of the two values does not matter in any way; you could even reverse the order on subsequent runs if you wanted to.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest solution wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:26.847" LastActivityDate="2016-02-28T13:45:48.533" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8595" PostTypeId="2" ParentId="8047" CreationDate="2016-02-27T16:59:46.073" Score="36" Body="&lt;h2&gt;Most kinds of generalised quines&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Quines continue to fascinate this community... but we already have a plain quine challenge so we're &quot;forced&quot; to innovate by making quine-related challenges that aren't pure quines. For the purpose of this post, I'm defining a generalised quine as a program &lt;code&gt;P&lt;/code&gt; which prints &lt;code&gt;F(P)&lt;/code&gt;, where &lt;code&gt;F&lt;/code&gt; is some function of a string. (E.g. &quot;print the reverse of your source code&quot; would have a string reversal function as &lt;code&gt;F&lt;/code&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Just to be clear, this answer does not apply to other extensions of quines, like putting extra restrictions on them, as in a radiation-hardened quine, or extending them to mutual quines etc. This is purely about &quot;print this transformation of your source code&quot; challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem with many of these is that there is no other solution than a) take your language's standard quine to get your source code as a string, b) tack on an implementation of &lt;code&gt;F&lt;/code&gt;. If that's the case, the quine part doesn't add anything interesting - there's no better technique than copying &quot;half&quot; your solution from an established quine. In that case there's two possibilities: &lt;code&gt;F&lt;/code&gt; itself is boring or has been done before, in which case the challenge doesn't add anything interesting at all, or &lt;code&gt;F&lt;/code&gt; itself is actually an interesting string processing task, in which case it should be posted as such, without wrapping it in a quine framework.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That doesn't mean all generalised quines are bad. Some &lt;em&gt;do&lt;/em&gt; admit interesting shortcuts than don't require the full standard quine to be reproduced. Before posting a generalised quine challenge, you should ask yourself whether that's possible or not.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-02-27T16:59:46.073" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8597" PostTypeId="2" ParentId="2140" CreationDate="2016-02-27T21:41:44.853" Score="1" Body="&lt;h1&gt;Transpose a paragraph&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For some odd reason I want to transpose paragraphs. The basic idea of a transpose is that this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a b&#xA;c d&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Is changed to:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a c&#xA;b d&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;[more on the rules here]&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Lorem ipsum dolor sit amet, consectetur adipiscing elit. Integer suscipit, arcu&#xA;ut facilisis blandit, neque tellus consequat urna, in semper mi purus vel magna.&#xA;Nam placerat mauris ac varius dictum. Nunc placerat ipsum et lectus iaculis&#xA;feugiat. Aenean eget felis ac purus fermentum dapibus ac nec leo. Vestibulum&#xA;convallis euismod metus a gravida. In eu nisl facilisis, accumsan urna a,&#xA;consectetur mauris. Integer vitae lectus et justo vestibulum lobortis. Donec&#xA;quis erat est. Curabitur pellentesque mi purus, vel posuere nunc volutpat quis.&#xA;Vestibulum ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia&#xA;Curae; Maecenas ultrices, elit sed finibus euismod, lacus tortor hendrerit&#xA;libero, quis auctor risus mi in tortor. Vivamus finibus consectetur est, quis&#xA;ultricies metus congue sit amet. Ut non elit libero. Fusce efficitur nec ante ut&#xA;tempor. Proin vitae commodo tortor. In aliquam massa a nulla eleifend commodo. &#xA;&#xA;Lorem      ut         Nam        feugiat.   convallis  consectetu quis       Vestibulum Curae;     libero,    ultricies  tempor.   &#xA;ipsum      facilisis  placerat   Aenean     euismod    mauris.    erat       ante       Maecenas   quis       metus      Proin     &#xA;dolor      blandit,   mauris     eget       metus      Integer    est.       ipsum      ultrices,  auctor     congue     vitae     &#xA;sit        neque      ac         felis      a          vitae      Curabitur  primis     elit       risus      sit        commodo   &#xA;amet,      tellus     varius     ac         gravida.   lectus     pellentesq in         sed        mi         amet.      tortor.   &#xA;consectetu consequat  dictum.    purus      In         et         mi         faucibus   finibus    in         Ut         In        &#xA;adipiscing urna,      Nunc       fermentum  eu         justo      purus,     orci       euismod,   tortor.    non        aliquam   &#xA;elit.      in         placerat   dapibus    nisl       vestibulum vel        luctus     lacus      Vivamus    elit       massa     &#xA;Integer    semper     ipsum      ac         facilisis, lobortis.  posuere    et         tortor     finibus    libero.    a         &#xA;suscipit,  mi         et         nec        accumsan   Donec      nunc       ultrices   hendrerit  consectetu Fusce      nulla     &#xA;arcu       purus      lectus     leo.       urna       volutpat   posuere    est,       efficitur  eleifend  &#xA;vel        iaculis    Vestibulum a,         quis.      cubilia    quis       nec        commodo.  &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="42736" LastEditorUserId="42736" LastEditDate="2016-02-28T19:57:18.103" LastActivityDate="2016-02-28T19:57:18.103" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8598" PostTypeId="2" ParentId="8350" CreationDate="2016-02-27T23:29:49.797" Score="42" Body="&lt;h2&gt;Tag badges for challenges&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Questions (challenges) aren't counted towards tag badges. Seeing how much emphasis we put on the fact that high-quality challenges are the main contribution someone can give to the community, it would be nice to reward people who post a lot of (well-received) challenges about certain topics.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This could be implemented by simply counting challenges towards the normal tag badges, but I think it would be nicer (and more interesting), if there was a second batch of tag badges which &lt;em&gt;only&lt;/em&gt; counted challenges. These would probably need different thresholds from the answer badges... 20 challenges in any tag except &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is a &lt;em&gt;lot&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2016-09-22T08:02:22.367" LastActivityDate="2016-09-22T08:02:22.367" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8599" PostTypeId="2" ParentId="2140" CreationDate="2016-02-28T02:10:56.553" Score="-14" Body="&lt;h1&gt;Write the worst Hello World program you can [popularity-contest] [super rough]&lt;/h1&gt;&#xA;&lt;p&gt;Who needs conventions? Write the most terrible Hello World program you can think of. Inefficiency, spaghetti code, you name it. Add a few gotos here and there to spice it up. Write code that has gone against everything you've ever been taught.&lt;/p&gt;&#xA;&lt;p&gt;Be creative. This isn't about obfuscation: it's about bad code quality. Try making up your own ways of writing inefficient or unadaptable code. Have fun!&lt;/p&gt;&#xA;" OwnerUserId="44886" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-28T02:10:56.553" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8601" PostTypeId="1" CreationDate="2016-02-28T04:46:00.873" Score="1" ViewCount="139" Body="&lt;p&gt;There's always some question or another on hold with a few downvotes on main, and they are usually created by users with 1 reputation. So if there was a small reputation requirement (eg 10) for making a question, this would be fixed. Would this be a good idea?&lt;/p&gt;&#xA;" OwnerUserId="51443" LastEditorUserId="20469" LastEditDate="2016-02-28T05:03:33.440" LastActivityDate="2016-02-29T16:19:46.030" Title="Rep requirement for asking" Tags="|discussion|asking-questions|new-users|reputation|" AnswerCount="3" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8602" PostTypeId="2" ParentId="8601" CreationDate="2016-02-28T04:59:20.903" Score="8" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Some users don't answer in PPCG, and yet can be great challenge writers. Why restrict when there's no need to?&lt;/p&gt;&#xA;" OwnerUserId="44713" LastActivityDate="2016-02-28T04:59:20.903" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8603" PostTypeId="2" ParentId="8601" CreationDate="2016-02-28T05:15:20.047" Score="-4" Body="&lt;h2&gt;Yes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(Still not entirely convinced on this, but I'll make the argument in favor.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On Q&amp;amp;A sites, the point of posting a question is to get help, to ask a question and get an answer. There shouldn't be a barrier to asking a question. However, in the context of creating and posting challenges, there are many more things to consider.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For this reason, it may be a good idea to require some familiarity with the site in order to post a challenge to the main site. The easiest way to do that would be to require potential challenge authors to have earned at least 2 reputation on this site before being allowed to post questions. This would require one upvote on one answer or one accepted edit. Note that &quot;on this site&quot; implies that an association bonus wouldn't count toward this privilege.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This would also help reduce the number of blatantly off-topic questions we get.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As Martin mentioned in the comments when I proposed this as part of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8350/were-not-a-qa-site-but-what-should-be-done-about-it&quot;&gt;We&amp;#39;re not a Q&amp;amp;A site. But what should be done about it?&lt;/a&gt;, it's quite rare that someone posts a decent challenge without ever having participated in one. Of course there are notable examples, such as &lt;a href=&quot;https://codegolf.stackexchange.com/users/26997/helka-homba&quot;&gt;Helka Homba&lt;/a&gt;, but again quoting Martin,&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;At least subjectively the signal-to-noise ratio in challenges posted by people who never participated in one is a single-digit percentage. While there are some notable exceptions, I do think this would greatly reduce the noise we get. If someone is actually determined to post interesting challenges, I don't think posting one measly answer is going to hold them back.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Does this discourage users from posting challenges? Not entirely. The Sandbox no longer has a reputation requirement for posting, so users can post their challenge ideas and get feedback. In the meantime, all they would have to do is make one edit or post one answer before they would be able to post freely to main.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2016-02-28T05:15:20.047" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8604" PostTypeId="2" ParentId="2140" CreationDate="2016-02-28T13:13:15.787" Score="1" Body="&lt;h1&gt;What can I buy in Catan?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Catan&quot; rel=&quot;nofollow&quot;&gt;Catan&lt;/a&gt; is a board game where players collect 5 commodities: &lt;strong&gt;b&lt;/strong&gt;rick, &lt;strong&gt;l&lt;/strong&gt;umber, &lt;strong&gt;w&lt;/strong&gt;ool, &lt;strong&gt;g&lt;/strong&gt;rain and &lt;strong&gt;o&lt;/strong&gt;re.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can trade commodities in the following ways:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;you can always sell 4 of one kind to buy 1 of any other kind&lt;/li&gt;&#xA;&lt;li&gt;if you have 3-for-1 trading possibility you can sell 3 of one kind to buy 1 of any other kind&lt;/li&gt;&#xA;&lt;li&gt;if you have a given commodity trading possibility you can sell 2 of the given commodity to buy 1 of any other kind&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You can use your commodities to buy 4 things:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;r&lt;/strong&gt;oad costs 1 brick and 1 lumber&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;s&lt;/strong&gt;ettlement costs 1 brick, 1 lumber, 1 wool and 1 grain&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;c&lt;/strong&gt;ity costs 2 grain and 3 ore&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;d&lt;/strong&gt;evelopment card costs 1 wool, 1 grain and 1 ore&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The same costs in matrix form:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; |blwgo&#xA;-+-----&#xA;r|11&#xA;s|1111&#xA;c|   23&#xA;d|  111&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your task is to find out which of the four things a player could buy given his/her commodities and trading possibilities.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is code golf so the shortest entry wins.&lt;/p&gt;&#xA;" OwnerUserId="7311" LastActivityDate="2016-02-28T13:13:15.787" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8605" PostTypeId="2" ParentId="5585" CreationDate="2016-02-28T13:28:09.753" Score="11" Body="&lt;h1&gt;Yes, they are on topic&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;To address some common reasons why people think they shouldn't be on topic:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;They don't have a winning criterion&lt;/em&gt;.  By default, &lt;strong&gt;the winning criterion is first posted&lt;/strong&gt;.  Even if you don't like this criterion, it is objective.  That said, first posted should be your last choice; &lt;strong&gt;the OP needs to attempt to identify other possible scoring criterion, using first posted as a last resort&lt;/strong&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;It's unfair to those that aren't currently online, checking the newest challenges&lt;/em&gt;.  While this is true, I don't think its grounds to reject them.  We see this &quot;unfairness&quot; frequently on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges, where two users have different submissions of the same length, and the first gets chosen.  This is &lt;em&gt;especially&lt;/em&gt; true when the winning answers are 0-byte or 1-byte answers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;It provides no lasting value; I should be able to go back to any question and answer it&lt;/em&gt;.  This is the best argument I've heard, so I'll try to address it thoroughly:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;strong&gt;Challenges are still fun in the short-term&lt;/strong&gt;.  Cops-n-robbers, KoTHs, and fastest-code challenges all usually have an end date.  Especially in the case of Cops-n-robbers, all &quot;answers&quot; get revealed after a given number of days, but we still have fun.  &lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Programming puzzles are fun even if the winning answer has already been posted&lt;/strong&gt;.  I'd argue that we do what &lt;a href=&quot;https://puzzling.stackexchange.com/&quot;&gt;Puzzling&lt;/a&gt; does, namely, require that submissions be placed in spoiler tags, so that people can still do the challenge if they wish (and find other creative answers).&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;A small amount of value is still better than no value&lt;/strong&gt;.  Much of the posts on Stack Overflow provide little value.  After a day or so, it will rarely see the light of day.  Yet, one of the greatest strengths of Stack Overflow is the vast amounts of these questions, because of their cumulative value.  We often consider questions here &lt;em&gt;valuable&lt;/em&gt; because they improve people's ability to code.  Programming puzzles provide another avenue to do this, and people will still learn when going back and looking at existing answers.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2017-04-13T12:50:45.800" LastActivityDate="2016-02-28T16:31:36.853" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8607" PostTypeId="1" CreationDate="2016-02-28T16:59:21.790" Score="15" ViewCount="334" Body="&lt;p&gt;I've just had a number of 'too chatty' comment flags declined, and I'd like to clarify what the mods here consider too chatty before I continue flagging.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is the text of each of the comments that I've had a flag declined on:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;+1, great use of eval and * '+'&lt;/li&gt;&#xA;&lt;li&gt;+1 for the &quot;farthest in n seconds&quot; idea.&lt;/li&gt;&#xA;&lt;li&gt;+1 for creative output&lt;/li&gt;&#xA;&lt;li&gt;+1 for playing the spaceship.&lt;/li&gt;&#xA;&lt;li&gt;+1 for the Mathematica solution :-)&lt;/li&gt;&#xA;&lt;li&gt;+1 Beat me to it lol.&lt;/li&gt;&#xA;&lt;li&gt;+1,seems an interesting problem.&lt;/li&gt;&#xA;&lt;li&gt;+1 Some nifty tricks you've got there :)&lt;/li&gt;&#xA;&lt;li&gt;+1,Nice one Gaurav :-) &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;My confusion here is based on the fact that I've had a number of other similar flags marked helpful and the comments deleted:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;+1, that looks more like golf!&lt;/li&gt;&#xA;&lt;li&gt;+1 for compression :D&lt;/li&gt;&#xA;&lt;li&gt;+1 for using Boost.&lt;/li&gt;&#xA;&lt;li&gt;+1 for using strictly command-line tools!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;What exactly constitutes a valid 'too chatty' flag?&lt;/p&gt;&#xA;" OwnerUserId="25164" LastEditorUserId="3808" LastEditDate="2016-02-28T18:02:03.967" LastActivityDate="2016-02-28T18:02:03.967" Title="What exactly is 'too chatty'?" Tags="|discussion|flags|comments|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8609" PostTypeId="2" ParentId="8607" CreationDate="2016-02-28T17:31:24.970" Score="20" Body="&lt;p&gt;Thanks for posting to meta about this; I was the one who declined those flags. I declined them primarily because it appeared that they were flagged based on an automated comment search—they were all extremely old comments (from 2011) that began with the same two characters &lt;code&gt;+1&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;While I would have deleted the comments if there had been only one or two flags and they had been on relatively recent posts, flagging based on an automated search isn't really helpful.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't know if you were around when this happened, but a very similar incident (on a larger scale) occurred during an election on gaming.SE with the original &lt;a href=&quot;https://github.com/Charcoal-SE/Charcoal&quot; rel=&quot;nofollow noreferrer&quot;&gt;Charcoal project&lt;/a&gt;, which led directly to &lt;a href=&quot;https://github.com/Charcoal-SE/Charcoal/issues/3&quot; rel=&quot;nofollow noreferrer&quot;&gt;Lockdown&lt;/a&gt;. I recommend you read &lt;a href=&quot;https://gaming.meta.stackexchange.com/a/8368/49683&quot;&gt;the entirety of Grace Note's answer here&lt;/a&gt;, but here's the most important bits:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;[do not] take this sort of &quot;shotgun&quot; approach to flagging.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;don't just flood the queue, especially if you're still in the early &quot;naive keyword search&quot; stages.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The Charcoal commotion was, again, on a far larger scale, but:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;9 flags all at once is quite a bit on a small site like PPCG.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Sending the message that flagging like this is okay might set a precedent leading to &quot;oh, I have an idea: why not run a script to automatically flag these for me?&quot; It's somewhat of a slippery slope.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;But most importantly, &quot;+1 because &amp;lt;foo&gt;&quot; on ancient 5-year-old posts is &lt;strong&gt;not currently causing any harm&lt;/strong&gt; to the site.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;While it's obvious that the flagging was done with good intentions, this is simply not a productive use of our time (regular users and moderators alike).&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-16T15:32:35.977" LastActivityDate="2016-02-28T17:31:24.970" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8611" PostTypeId="2" ParentId="2140" CreationDate="2016-02-28T17:50:42.973" Score="0" Body="&lt;h1&gt;Repeatedly convert from minimal base to base 36&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base-conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; rel=&quot;tag&quot;&gt;base-conversion&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/repeated-transformation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;repeated-transformation&amp;#39;&quot; rel=&quot;tag&quot;&gt;repeated-transformation&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to convert an input of a list of strings which represent arbitrarily large numbers from the lowest possible base to base 36, repeatedly, until there is no further change to be made.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may not use base conversion builtins.&lt;/li&gt;&#xA;&lt;li&gt;From 0 to 35 in base 36 is defined as:&lt;pre&gt;&lt;code&gt;0, 1, 2, 3, 4, 5, 6, 7, 8, 9, a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z&lt;/code&gt;&lt;/pre&gt; &lt;/li&gt;&#xA;&lt;li&gt;All submissions will be tested &lt;a href=&quot;https://ide.c9.io/vtcakavsmoace/base-repetition&quot; rel=&quot;nofollow noreferrer&quot;&gt;on this cloud 9 workspace&lt;/a&gt; and should be uploaded for testing (along with any updates) &lt;a href=&quot;https://github.com/VTCAKAVSMoACE/base-repetition&quot; rel=&quot;nofollow noreferrer&quot;&gt;on this GitHub repository&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;All submissions must be written for compilers/interpreters that:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are free to use.&lt;/li&gt;&#xA;&lt;li&gt;Do not take up excessive space.&lt;/li&gt;&#xA;&lt;li&gt;Can run with simple installations on Ubuntu 14.04.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Test Cases:&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Coming soon&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="44713" LastEditDate="2016-03-01T13:18:32.040" LastActivityDate="2016-03-01T13:18:32.040" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8615" PostTypeId="2" ParentId="2140" CreationDate="2016-02-29T03:39:02.840" Score="0" Body="&lt;h1&gt;Length of a month starting from a specific day&lt;/h1&gt;&#xA;&lt;p&gt;Given a date, you are to output the number of days from today, to the last date that has a number less than today next month.&lt;/p&gt;&#xA;&lt;p&gt;It can be calculated this way:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the current date in the month is not more than the number of days next month, output the number of days in the current month.&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, output the number of days in the next month + number of days starting from the current day in the current month.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is code-golf. Shortest code wins.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;2016-01-21  -&amp;gt;  31&#xA;2016-01-30  -&amp;gt;  31&#xA;2016-01-31  -&amp;gt;  30&#xA;2016-02-29  -&amp;gt;  29&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Should leap years be supported?&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-29T03:39:02.840" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8617" PostTypeId="1" AcceptedAnswerId="8624" CreationDate="2016-02-29T15:11:14.370" Score="11" ViewCount="330" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/golfing-language&quot;&gt;golfing-language&lt;/a&gt; has &lt;strong&gt;&lt;s&gt;7&lt;/s&gt; 5 questions and 0 followers&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;From its wiki, it is:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;For questions regarding languages for golfing.&lt;/p&gt;&#xA;&lt;p&gt;This tag is for&#xA;questions regarding choice of programming language for golfing. It can&#xA;be used for help with creation of a new language, or for tips&#xA;regarding choice of language, or for anything else regarding golfing&#xA;languages.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;This is &lt;em&gt;not&lt;/em&gt; on topic on the main site.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Of its &lt;s&gt;7&lt;/s&gt; 5 questions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;all 5&lt;/strong&gt; are closed / on hold&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;all 5&lt;/strong&gt; have at least one other tag, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/golfing-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;golfing-language&amp;#39;&quot; rel=&quot;tag&quot;&gt;golfing-language&lt;/a&gt; is completely superfluous&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This tag doesn't seem to hold any value, and actively harms the quality of the site by encouraging off-topic questions.&lt;/p&gt;&#xA;&lt;p&gt;What should be done with it? If you can't tell, I think it should be burninated.&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-02T16:24:55.050" Title="Retire [golfing-language]?" Tags="|discussion|tags|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8618" PostTypeId="2" ParentId="8601" CreationDate="2016-02-29T15:26:51.370" Score="11" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;There are a few reasons I think this is a bad idea, &lt;em&gt;any one&lt;/em&gt; of which I think can stand alone. Considered together, it seems like an obvious conclusion to me.&lt;/p&gt;&#xA;&lt;h2&gt;Ask Questions, Get Answers&lt;/h2&gt;&#xA;&lt;p&gt;This is what the whole platform is about. Anyone can ask a question, and anyone can answer it. It's literally the foundation for the Stack Exchange model. If we're seriously considering this, we might as well find another platform to do it on, because this feels like spitting in the face of our gracious (and patient) hosts.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;But we're not a Q/A site!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;An often-used reasoning to changes made/proposed here is that we aren't a typical question/answer site. &lt;em&gt;And it's true&lt;/em&gt;, we're not. Often, the challenges here take much more preparation than a question somewhere else. Especially the good ones. It's a lot like good &lt;em&gt;answers&lt;/em&gt; on other sites.&lt;/p&gt;&#xA;&lt;p&gt;But there's no reputation requirement to answer on other sites, is there? So how do they stop all the bad answers by new users? They moderate, just like we do here. If it's not a good challenge, you downvote, close, comment, or whatever the appropriate action is. You don't just bar the door and hope they go away. &lt;em&gt;Because they will go away&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Pearls, Not Sand&lt;/h2&gt;&#xA;&lt;p&gt;In a &lt;a href=&quot;https://blog.stackoverflow.com/2011/06/optimizing-for-pearls-not-sand/&quot;&gt;fairly well known article&lt;/a&gt;, Jeff Atwood laid out the reasoning for some of the site mechanics. The point was to optimize for (good) answers, which are the &amp;quot;pearls&amp;quot; among the  vast &amp;quot;sand&amp;quot; of questions.&lt;/p&gt;&#xA;&lt;p&gt;You might argue that our pearls are the challenges themselves (I certainly would). A good challenge often brings out very unexpected solutions. Yes, we get some questionable-worth posts from new users, but so does literally every other site on the internet that allows people to post &lt;em&gt;anything&lt;/em&gt;. What we're looking for are the good ones, and you won't find those if you lock the whole thing up. Because people don't like to be told they don't know how to post a question. Right or wrong, it's not human nature, at least as far as I've ever seen.&lt;/p&gt;&#xA;&lt;h2&gt;Notable Exceptions?&lt;/h2&gt;&#xA;&lt;p&gt;Martin made &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8350/were-not-a-qa-site-but-what-should-be-done-about-it/8422#comment23760_8422&quot;&gt;a comment&lt;/a&gt; on another discussion about this (and Alex included it in his answer), saying that the signal to noise ratio for new users is pretty high, and this is almost certainly true. Not unexpected, but true nonetheless.&lt;/p&gt;&#xA;&lt;p&gt;But yes, there are some notable exceptions: &lt;strong&gt;Doorknob, Helka Homba, flawr, Zgarb, and Joe Z&lt;/strong&gt; to name a few. As you might have guessed, what they have in common is that their first post here was a challenge, not an answer. Not only that, but those five users combined have asked almost &lt;em&gt;ten percent&lt;/em&gt; of all questions on the site.&lt;/p&gt;&#xA;&lt;p&gt;So yes, there's lots of noise, but we &lt;em&gt;still need that signal&lt;/em&gt;. Would those users have stayed if the first thing they saw was &amp;quot;you can't post this yet&amp;quot;? I don't really know. I'd like to think so, but I'd rather not find out the hard way. The problem is that you would have &lt;em&gt;no idea&lt;/em&gt; who you're turning away. I'd rather take out the trash on a thousand bad posts than risk missing a user like any of them.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-29T16:19:46.030" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8620" PostTypeId="2" ParentId="2140" CreationDate="2016-02-29T16:26:26.780" Score="1" Body="&lt;h1&gt;Sort My Youtube Playlist&lt;/h1&gt;&#xA;&lt;p&gt;Help! My playlist is all unsorted! I need to sort it, but I can only move a video to the top or the bottom. I'd like to do this quickly so I need a solution with the minimum amount of moves. But I'm lazy and it seemed like a good fit, so I'm posting it here and now you have to do it! Now, since this is code golf, you have to do it in as few bytes as possible.&lt;/p&gt;&#xA;&lt;p&gt;Input is a permutation of the values from 1 to n (where n is any number from 1 to ∞). Output is a list of moves that sorts the list.&#xA;For example for input &lt;code&gt;1 3 2 4&lt;/code&gt; a valid output would be &lt;code&gt;2D 3D&lt;/code&gt; (second element to bottom, third element to bottom)&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input         Possible Output&#xA;1 3 2 4       2D 3D&#xA;5 4 3 2 1     4D 3D 2D 1D&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="51443" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-01T21:35:50.917" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8621" PostTypeId="2" ParentId="8350" CreationDate="2016-02-29T16:53:45.247" Score="10" Body="&lt;h2&gt;&lt;code&gt;s/answer/???/g&lt;/code&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Complimentary to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8355/46231&quot;&gt;Martin Buettner's &lt;code&gt;s/question/challenge/g&lt;/code&gt; request&lt;/a&gt;, the word &lt;code&gt;answer&lt;/code&gt; is quite universal and integral to each SE site... except us, for all the same reasons noted in Martin's proposal. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;To the end of consistency and sanity, this should probably change alongside, to... ?  Well, I'm not sure &lt;em&gt;what&lt;/em&gt;, but surely &quot;Solution&quot;, &quot;Response,&quot; etc are better alternatives.&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2016-02-29T17:16:04.010" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8622" PostTypeId="2" ParentId="2140" CreationDate="2016-02-29T17:32:13.053" Score="4" Body="&lt;h1&gt;Senior Prank&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We're graduating to a full site soon, and there's only one thing left to do before graduation: pull a senior prank! I think we should do a variation on the classic &quot;fill a hallway with cups of water&quot; gag.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program will read in text and output that text, covered in upside-down cups of water. An upside-down cup of water looks like this: &lt;code&gt;/~\&lt;/code&gt;&lt;br&gt;&#xA;These cups can only be placed in whitespace in the input, and can only be placed so that all three characters of the cup are directly above a non-whitespace character (otherwise the water would spill out!). Cups cannot be stacked on top of other cups. Cups must be placed in every available opening, and it is assumed that every input is surrounded by an infinite field of whitespace.&lt;br&gt;&#xA;We need to pull the prank off quickly and without anyone noticing, so fewest bytes in each language wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;     ____________________________________________&#xA;    /   ___    /   ___    /   ______/   ________/&#xA;   /   /__/   /   /__/   /   /     /   /_______&#xA;  /   _______/   _______/   /     /   //__    /&#xA; /   /      /   /      /   /_____/   /___/   /&#xA;/___/      /___/      /_________/___________/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;     /~\/~\/~\/~\/~\/~\/~\/~\/~\/~\/~\/~\/~\/~\&#xA;     ____________________________________________&#xA;    /   ___    /   ___    /   ______/   ________/&#xA;   /   /__//~\/   /__//~\/   /     /   /_______&#xA;  /   _______/   _______/   //~\  /   //__    /&#xA; //~\/      //~\/      //~\/_____//~\/___//~\/&#xA;/___/      /___/      /_________/___________/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; L&#xA;LOL  ROFL:ROFL:LOL:ROFL:ROFL&#xA; L\\        ____I____&#xA;    ========    |  |[\&#xA;            \___O==___)&#xA;            ___I_I__/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; L   /~\/~\/~\/~\/~\/~\/~\&#xA;LOL  ROFL:ROFL:LOL:ROFL:ROFL&#xA; L\\/~\/~\  ____I____&#xA;    ========/~\ |  |[\&#xA;            \___O==___)&#xA;            ___I_I__/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="41863" LastEditorUserId="41863" LastEditDate="2016-03-04T04:39:59.070" LastActivityDate="2016-03-04T04:39:59.070" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8623" PostTypeId="2" ParentId="8350" CreationDate="2016-02-29T17:40:33.333" Score="9" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1724/46231&quot;&gt;Explicitly allow questions requesting help / advice in golfing code&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codereview.meta.stackexchange.com/questions/710/are-questions-about-how-to-further-golf-a-program-on-topic-here&quot;&gt;Golf is not on topic at Code Review&lt;/a&gt;. We should make it clearer that  questions requesting help for golfing substantial / non-trivial code (for varying definitions of trivial) are on-topic, because it's been voted on.&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2016-02-29T17:40:33.333" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="8624" PostTypeId="2" ParentId="8617" CreationDate="2016-02-29T19:37:00.033" Score="23" Body="&lt;h2&gt;Yes, let's retire it&lt;/h2&gt;&#xA;&lt;p&gt;Why?&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It encourages off-topic questions (&lt;em&gt;How do I use X golfing language?&lt;/em&gt;, &lt;em&gt;Which of X, Y, Z golfing languages should I use?&lt;/em&gt;, &lt;em&gt;How does feature Y work in X golfing language?&lt;/em&gt;).&lt;/li&gt;&#xA;&lt;li&gt;We never use it.&lt;/li&gt;&#xA;&lt;li&gt;Its presence supports the stratification of languages into &amp;quot;golfing&amp;quot; and &amp;quot;non-golfing&amp;quot;, which is unfair to both sides (any language can be used, keeping in mind our usual caveats, and segregating the languages designed for code golf perpetuates the discrimination against them).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-02-29T19:37:00.033" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8627" PostTypeId="2" ParentId="6918" CreationDate="2016-02-29T20:53:31.207" Score="7" Body="&lt;h2&gt;&lt;a href=&quot;https://github.com/muddyfish/PYKE&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pyke&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Pyke is a stack based code golf language created by me, muddyfish, starting in February 2016. I decided to build it to test my knowledge of Python and how long it would take for me to get a basic golfing language. I got the language fully extendable in two days using a homebrew plugin system.&lt;/p&gt;&#xA;&lt;p&gt;Each function (or node as I've called them) can do different things depending on the size of the stack, the types of objects on the stack as well as the last item on the stack.&lt;/p&gt;&#xA;&lt;p&gt;Pyke's stack uses a first-in last-out system for managing the stack. If ever the stack isn't long enough for the current node to function, it uses the eval_or_not function which takes input from the user and tries to eval it, otherwise returning it as a string.&lt;/p&gt;&#xA;&lt;p&gt;It uses Python 3's new argument annotations to make the typecasting easier as well as being able to get extra data for the current nodes. This extra data immediately follows the node and is constant throughout the program. It can take the form of numerics, strings or Pyke's AST.&lt;/p&gt;&#xA;&lt;p&gt;When the program ends, it prints out the contents of the stack implicitly.&lt;/p&gt;&#xA;&lt;p&gt;Hello World in Pyke: &lt;code&gt;&amp;quot;Hello, World!&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://pyke.catbus.co.uk/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try Pyke here!&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="32686" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-06T17:25:55.967" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8628" PostTypeId="1" AcceptedAnswerId="8629" CreationDate="2016-03-01T03:14:53.353" Score="7" ViewCount="152" Body="&lt;p&gt;I'm not talking about, &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Here's a part of a solution in CJam, and here's the other half in Javalanguage, you figure it out&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'm talking about,&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;my language is really simplistic and can't read more than a byte of stdin at a time, so here's a &lt;code&gt;bash&lt;/code&gt; helper script which reads input, writes it to a known filename and then executes my langauge's interpreter which solves the task using said file&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;My instinct is that this is either a loophole of some sort, or will be considered simply a needlessly wordy &lt;code&gt;bash&lt;/code&gt; answer, because the interpreter command is essentially just another &lt;code&gt;coreutil&lt;/code&gt;, for all the rules care (even though that isn't the case).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not asking whether the bytes in the helper script are counted; obviously, they are.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can't tell if this is explicitly discouraged, and I don't plan on answering this way any time soon (I'll fix the language first).&lt;/p&gt;&#xA;" OwnerUserId="46231" LastActivityDate="2016-03-01T19:49:57.043" Title="Are multi-language submissions allowed?" Tags="|support|code-golf|answers|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8629" PostTypeId="2" ParentId="8628" CreationDate="2016-03-01T04:34:50.193" Score="3" Body="&lt;h3&gt;Regarding I/O&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Programs don't need to read specifically from STDIN since not all languages have a concept of STDIN. That's why we say that a program can read from STDIN &lt;em&gt;or the language's closest alternative&lt;/em&gt;. It's a little vague, but it basically just means that if your language doesn't have a concept of STDIN, use whatever natural input method most closely resembles STDIN.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, if your language can only read from a file, note that reading from a file is currently one of our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2452/20469&quot;&gt;default code golf input formats&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;On multiple languages&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I would call what you described &quot;Bash + SuperCoolLang1000,&quot; where the latter is obviously replaced by your language's name. In that case the byte count would be the byte count of the Bash driver program + the byte count of your language's program that does the work.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It may be easier to define Bash + SuperCoolLang1000 as a new language, which is not uncommon so long as there's a specific interpreter for it available, or make the Bash wrapper part of the language itself.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-03-01T19:49:57.043" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8630" PostTypeId="1" AcceptedAnswerId="8631" CreationDate="2016-03-01T06:51:54.713" Score="0" ViewCount="167" Body="&lt;p&gt;This is not to be confused with &lt;a href=&quot;http://golf.shinh.org&quot; rel=&quot;nofollow&quot;&gt;anarchy golf&lt;/a&gt;, which it is named after.&lt;br&gt;&#xA;This tag means that each language has its own leaderboard, and the leaderboard will not only list the answerer, but any editors as well. This can be overridden by a statement with a specific format at &lt;strong&gt;the very end&lt;/strong&gt; of the post:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;By &amp;lt;submitter/largest contributor&amp;gt; with help from [&amp;lt;user&amp;gt;].&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Score should usually be relative to the best answer in the same language. Example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;score = s/b&lt;/code&gt; where &lt;code&gt;s&lt;/code&gt; is the size of your answer and &lt;code&gt;b&lt;/code&gt; is the size of the best answer, and &lt;code&gt;1&lt;/code&gt; is the best score.&lt;/p&gt;&#xA;" OwnerUserId="39244" LastEditorUserId="66833" LastEditDate="2021-06-09T13:42:40.473" LastActivityDate="2021-06-09T13:42:40.473" Title="New tag proposal - anarchy" Tags="|feature-request|status-declined|tags|winning-criteria|new-genre|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8631" PostTypeId="2" ParentId="8630" CreationDate="2016-03-01T08:20:28.363" Score="6" Body="&lt;p&gt;&lt;strong&gt;On scoring by ratio to shortest code&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I like the philosophy here that you're competing relative to your language, but I don't see it working. The idea seems to be based on assumptions from Anarchy Golf that don't transfer:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Most challenges have multiple submissions in each language.&lt;/li&gt;&#xA;&lt;li&gt;There is a fixed (though large) set of language options.&lt;/li&gt;&#xA;&lt;li&gt;The golfing is competitive enough that the best score well-approximates the optimal score.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;On PPCG, most submissions are alone in their language and would get the best score of 1. The per-language competition is diluted by frequent challenges and a wide array of languages. Ironically, your proposed scoring method discourages such competition and encourages golfing in your made-up language that only you use.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you're not first place in your language, you still really can't compare your score to other non-first-places. It depends on how good the first place is, which varies a lot and is outside your control. Maybe an experienced golfer tried really hard for the perfect golf in that language, or maybe not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you are first place, improving your answer doesn't improve your score, it just makes others' scores worse, which is strange.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2016-03-01T08:20:28.363" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8632" PostTypeId="2" ParentId="8630" CreationDate="2016-03-01T08:47:35.957" Score="1" Body="&lt;p&gt;You can have such a thing in the leaderboard snippets. But as an objective, it isn't really much different from a regular golf. Every user can decide how they think who is the winner in their own way, but the answerers are supposed to do the same thing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you have a more complicated idea that is different from a regular golf, first try posting a question in the sandbox and see how it goes. Think of a tag only if those questions end up well received.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2016-03-01T08:47:35.957" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8634" PostTypeId="1" AcceptedAnswerId="8655" CreationDate="2016-03-01T14:21:50.780" Score="4" ViewCount="203" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/6977/46231&quot;&gt;Language idea for golfing purposes&lt;/a&gt; is a very interesting question with very interesting answers. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;While retagging the two non-closed questions tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/golfing-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;golfing-language&amp;#39;&quot; rel=&quot;tag&quot;&gt;golfing-language&lt;/a&gt; per &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8617/retire-golfing-language&quot;&gt;Retire [golfing-language]?&lt;/a&gt;, I found this question. It opens with:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This question is probably not on-topic. If a moderator feels that it should be that way, turn this question into community wiki please.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It was made CW just 7 hours after it was posted, which seems to support my theory that it's not on topic within the scope defined in the &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;help center&lt;/a&gt;. If you feel it is, kindly DV this post and leave a comment describing your opinion. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;Assuming the previous is accepted as true,&lt;/s&gt; The question was put on hold as a result. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I (still) think this is a valuable question which may be helpful to future visitors / users, but &lt;strong&gt;it is not considered a good, on-topic question for this site, so [people should] not use it as evidence that [they] can ask similar questions here.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does that sound like a piece of text we all know well? &lt;sup&gt;yes&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;If this question is worthy of closure as off-topic (hint: it is), then I would like to propose it be locked as well, to prevent reopening, possible deletion, and because it is important and shouldn't be thrown away with the other closed questions. &lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2016-03-03T03:18:06.997" Title="Historical lock for &quot;Language idea for golfing purposes&quot;?" Tags="|discussion|specific-question|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8639" PostTypeId="2" ParentId="8121" CreationDate="2016-03-01T20:00:12.210" Score="18" Body="&lt;p&gt;Took me long enough to answer this, didn't it?&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Who are you?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I'm Martin. You may have seen me around. I spend way too much time on this site and for the past 11 months or so I've had a symmetric quadrilateral next to my name to prove it.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Why are you here?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I don't quite remember which post drew me to the site, but it must have been through the HNQ. I do remember that it wasn't plain code golf. Probably a KotH. I'm also pretty sure that I didn't answer it. At some point I did start answering code golf challenges and was hooked pretty quickly. At some point I joined chat and stayed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why do I keep coming here? I enjoy the challenges, I enjoy learning new (often esoteric) programming languages to solve problems and I really enjoy learning things from others' solutions and my own attempts. A really big factor is the community though. There are a lot of very nice and very clever folks here, that make PPCG a very nice place to spend time on. The competition is very friendly and most of the time people are more interested in finding the best possible solution through collaboration and building off each others' ideas in a respectful way.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;How can we fit into SE in general?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Ah, heck, I'll jump straight to the next question, because that's relevant to this one.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;How can we innovate and expand?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I think code golf will (at least for the foreseeable future) remain the focus of this community. I don't even think it's the best and coolest we have to offer, but it's good fun if you're willing to give it a go, so I don't think it's a problem. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8135/8478&quot;&gt;I've said elsewhere&lt;/a&gt; that code golf isn't so popular because writing short code is the best thing in the world. It's because &lt;em&gt;objective winning criteria&lt;/em&gt; are important — it doesn't matter much what that criterion is, but it's necessary to have one to inspire competition and creativity. &lt;em&gt;Having an objective winning criterion gives you a reason to improve even if there's no one around to beat!&lt;/em&gt; It just happens that code golf works &lt;em&gt;really&lt;/em&gt; well as an objective winning criterion. It's easy to measure, does not depend on a comparison being done on the same machine, the score doesn't change over time as hardware gets better, and it's very clear how changing a part of your solution affects your score, &lt;em&gt;and&lt;/em&gt; it works for pretty much any problem. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, optimisation &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenges&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenges&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenges&lt;/a&gt; all fail to meet some of these criteria. Those challenges are often great fun and also elicit amazing answers, but they're just not as simple to set up. So far, we've failed to come up with any challenge type that can provide these benefits as easily as code golf. If we ever do, I'm sure it can be as successful as code golf and provide an alternative to people who don't like golfing. That aside, people who do dislike golfing should really consider giving it a try — because the fun is in learning about your language, improving your problem-solving skills and discovering new, unexpected ways to solve a challenge, not in writing code that's useless in production environments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I do hope we innovate in terms of challenge types. The past couple of years have brought some very interesting challenges, mainly &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;, in my opinion. Neither of them are perfect yet, but they seem to draw a lot of (good) attention, encourage collaboration, and are generally a lot of fun. Let's try to improve how we run those challenges, and maybe come up with a few new ones. Diversity is a good thing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is another way we could innovate though. So there's &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8350/8478&quot;&gt;all this talk about PPCG not being a Q&amp;amp;A site&lt;/a&gt; (which I kicked loose I guess) and I definitely would like some things to change. But maybe we could also make this Q&amp;amp;A background our unique selling point? We do have the occasional non-challenge question, but they are very rare, partly because only very few types of non-challenge questions are allowed (really only tips lists and asking for golfing advice). That's already something that doesn't really exist on other recreational/competitive programming communities. What if we could leverage the Q&amp;amp;A side of things to create something unique and more than just a site where we post and answer (mostly code golf) challenges? It seems to me that the main reason why there is opposition in the community to non-challenge posts is that they dilute the challenges. If challenges and questions are all mixed up it becomes harder to find the actual challenges. So let's dream for a moment and suppose that SE would implement some custom code that allowed us to host the challenges separately from the Q&amp;amp;A (imagine it looks a bit like Q&amp;amp;A, but tailored to challenges with leaderboards and what not). We'd now have a regular SE instance that doesn't contain any challenges whatsoever. What could we do with that? We could still have golfing advice there. But now we could really expand our scope to all the things the people here care about (as evidenced from chat). We could have questions about &lt;em&gt;writing&lt;/em&gt; challenges. We could have questions about advice for participating in other types of challenges than code golf. We could have questions about (esoteric) language design (which were recently ruled off topic). Most of all, we could allow questions about &lt;em&gt;using&lt;/em&gt; esolangs. Stack Overflow &lt;a href=&quot;https://stackoverflow.com/questions/tagged/esoteric-languages&quot;&gt;has a tag for esoteric languages&lt;/a&gt;. It has some very decent and answerable questions, but unless the language is Brainfuck, it can take a while to get an answer and even then I find the quality of the answers often somewhat lacking. &lt;em&gt;This community&lt;/em&gt; has the expertise to answer them as well as the people who are interested in them. We could give them a home here. Maybe we could even have questions about programming games? What I'm saying is we could be come a community for recreational programming in all its facets while still holding our challenges, which are a big part of that. I'd &lt;em&gt;love&lt;/em&gt; to be part of such a community, and it might be easier to draw in more users from esolangs.org or other places with such a somewhat expanded scope.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, we don't have that separation of challenges and questions. And it's questionable whether we'll ever get it. But maybe becoming this community would be worth giving it a try even without the separation? Maybe we need to show SE that there's a &lt;em&gt;need&lt;/em&gt; for the separation, because currently there isn't really with the low volume of non-challenges we have. Anyway, I'm sure there'll be opposition to this and some people will always prefer to focus exclusively on challenges, but I figured it's something to think about.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;So &lt;em&gt;how&lt;/em&gt; do we fit into SE in general?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Well, if those things up there actually happened, we'd be a Q&amp;amp;A site for recreational programming (which fits as well as Puzzling or Arqade or any other site really), &lt;em&gt;plus&lt;/em&gt; we'd also host our challenges, allowing people to partake in the activity they're discussing right here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even if we don't, we do have a place here, I think (as some of the other answers already mention). We do build a useful content base for future visitors, it's just that here the &quot;questions&quot; are the lasting value, in that this site builds a repository of programming challenges of all difficulties for anyone to try their hands at. I personally also think, we generate some useful content in the answers, at least for people in the code golf community, because we have some of the shortest known solutions to common programming problems (the same would in principle go for any other winning criterion, but for the reasons stated above code golf is obviously the most well explored). We also fit into the network in that it is still dominated by technical topics, and we provide a different angle to becoming a better programmer. (And yes, code golf does teach you useful skills for production programming.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2016-03-01T20:00:12.210" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8640" PostTypeId="2" ParentId="5759" CreationDate="2016-03-01T21:56:58.400" Score="19" Body="&lt;h2&gt;Recreational Programming&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;That's what we do, right? We program for fun. People were opposed to the idea of &quot;Competitive Programming&quot; because we're not &lt;em&gt;as&lt;/em&gt; competitive and strict as some &quot;real&quot; programming competitions (like Google Code Jam or stuff). This would also not tie our scope down as much as a name like &quot;Code Golf&quot;, and neither would it imply that certain types of challenges are or aren't a good fit for the site (like &quot;Programming Puzzles &amp;amp; Code Golf&quot;). It would also still be appropriate &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8639/8478&quot;&gt;should we ever expand our scope of non-challenge posts&lt;/a&gt; - in general I think it captures both the things we currently do on main as well as the things the community cares about in chat.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(The only objection I could think of is that it's not exactly catchy. But I think it's spot on.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-03-01T21:56:58.400" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8643" PostTypeId="2" ParentId="8471" CreationDate="2016-03-02T00:27:45.397" Score="7" Body="&lt;h1&gt;Any &lt;em&gt;intermediary&lt;/em&gt; value should not exceed...&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;... as long as the author does not purposely minimize the valid input range by performing otherwise unnecessary calculations to bump against a limit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we only put limits on I/O, the following trivial challenge will be almost impossible:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Write a function or program that returns its argument plus one.&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2016-03-02T00:27:45.397" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8644" PostTypeId="1" AcceptedAnswerId="8646" CreationDate="2016-03-02T01:37:24.337" Score="14" ViewCount="283" Body="&lt;p&gt;Back in April 2011, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78/dmckee&quot;&gt;@dmkcee&lt;/a&gt; announced &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/298/46231&quot;&gt;the CodeGolf.SE First Periodic Premier Programming Puzzle Push&lt;/a&gt;. This proposal was &lt;em&gt;so&lt;/em&gt; promising and interesting that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/298/announcing-the-codegolf-se-first-periodic-premier-programming-puzzle-push#comment640_298&quot;&gt;even Jeff Atwood took note&lt;/a&gt;!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/1p5&quot;&gt;1p5&lt;/a&gt; tag was introduced to classify this new venture of code challenges, as a bit of a meta-tag. Today, this tag has a meager &lt;strong&gt;four questions&lt;/strong&gt; and &lt;strong&gt;0 followers&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These four questions are not just random low-quality posts, however. They have accrued:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;a &lt;strong&gt;total of 111 votes&lt;/strong&gt;, for an &lt;strong&gt;average of 27.5 votes each&lt;/strong&gt; (13, 19, 33, 46)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;a &lt;strong&gt;total of 9.5k views&lt;/strong&gt;, for an &lt;strong&gt;average of ~2.4k views each&lt;/strong&gt; (580, 1k, 4k, 4k)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;a &lt;strong&gt;total of 47 high-quality answers&lt;/strong&gt; for an &lt;strong&gt;average of 12 answers each&lt;/strong&gt; (5, 3, 19, 20)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;a &lt;strong&gt;total of 24 stars&lt;/strong&gt; for an &lt;strong&gt;average of 6 stars each&lt;/strong&gt; (4, 0, 12, 8)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The tag's first two questions were posted in quick sucession shortly after &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78/dmckee&quot;&gt;@dmkcee&lt;/a&gt; announced 1P5, and they were the most well-recieved. The most recent two questions were asked just a week later, and received far less of the the gold dust enjoyed by the originals.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Yesterday, I &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8617&quot;&gt;wrote&lt;/a&gt; a proposal here on meta to burninate &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/golfing-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;golfing-language&amp;#39;&quot; rel=&quot;tag&quot;&gt;golfing-language&lt;/a&gt;, to which &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/25180/jimmy23013&quot;&gt;@jimmy23013&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8617/retire-golfing-language#comment24474_8617&quot;&gt;commented&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;[...] we didn't even retire the tag 1p5. It has &quot;encouraged&quot; off-topic questions at least once. [...]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;My assumption is he's referring to questions posted under that tag which were deleted / closed / untagged.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt; At the time, 1P5 was a &lt;em&gt;very&lt;/em&gt; effective effort on the part of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78/dmckee&quot;&gt;@dmkcee&lt;/a&gt; and the community at large to improve site participation and quality, but...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;...skip forward 5 years to today: PPCG has graduated, and we're looking like a very successful site (98% answered, loads of awesome questions per day, etc), so &lt;em&gt;we no longer need 1P5 because it helped us grow.&lt;/em&gt; However, &lt;strong&gt;what should happen to the tag and its questions?&lt;/strong&gt; It's both a meta-tag and nearly pointless from the tiny number of ancient questions with it.&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2016-03-02T01:53:17.473" Title="Let's deliberate about [1p5]" Tags="|discussion|tags|challenges|" AnswerCount="1" CommentCount="0" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8645" PostTypeId="2" ParentId="8546" CreationDate="2016-03-02T01:40:56.827" Score="2" Body="&lt;p&gt;I recently posted a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/74269/calculate-the-number-of-primes-up-to-n&quot;&gt;challenge&lt;/a&gt; in which I was responsible for timing the entries. The method I used (based off comments/answers from this post as well as chat messages):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;use the &lt;code&gt;time&lt;/code&gt; function in bash. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;for better results, if the entry is fast (&amp;lt;1s), it is worthwhile to &lt;code&gt;time&lt;/code&gt; a loop that executes the entry many (100s/1000s) times and then divide the result by the number of times it was looped.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;the &lt;code&gt;time&lt;/code&gt; command outputs to &lt;code&gt;stderr&lt;/code&gt;. To send this to a file, use &lt;code&gt;2 &amp;gt;&amp;gt; &amp;lt;path/to/file&amp;gt;&lt;/code&gt; or &lt;code&gt;exec 2 &amp;gt;&amp;gt; &amp;lt;path/to/file&amp;gt;&lt;/code&gt; in a script. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;close all other applications while timing. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;After verifying test cases, send output (&lt;code&gt;stdout&lt;/code&gt;) to &lt;code&gt;/dev/null&lt;/code&gt; with some version of &lt;code&gt;2&amp;gt;/dev/null&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="45459" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-03-02T18:36:11.263" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8646" PostTypeId="2" ParentId="8644" CreationDate="2016-03-02T01:53:17.473" Score="18" Body="&lt;h2&gt;Retire it but leave it be&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As it stands, only 4 challenges bear that tag. It wouldn't be a huge endeavor to retag them. However, the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/1p5&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;1p5&amp;#39;&quot; rel=&quot;tag&quot;&gt;1p5&lt;/a&gt; tag itself obviously has notable historical significance for our site. Thus I think we should keep the tag around to mark the challenges that were part of this effort, but retire its use for new challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In general, I think tags like this are unnecessary; they group together challenges that are otherwise entirely unrelated, which contradicts the purpose of tags in my mind. But even now that we're all grown up, we should acknowledge our humble beginnings and the efforts of those who got us where we are today.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-03-02T01:53:17.473" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8650" PostTypeId="2" ParentId="2140" CreationDate="2016-03-02T21:19:50.547" Score="2" Body="&lt;h2&gt;Generate a waveform from audio &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/audio&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;audio&amp;#39;&quot; rel=&quot;tag&quot;&gt;audio&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an audio file, in any common audio format (such as MP3, OGG, WMA, M4A, or WAV) of your choice, as input, output an image, in any common image format (such as PNG, JPG, PPM, BMP, SVG, or GIF) of your choice, of a waveform representing the audio input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is an example image, generated with Audacity from &lt;a href=&quot;https://www.youtube.com/watch?v=NmCCQxVBfyM&quot; rel=&quot;nofollow noreferrer&quot;&gt;this audio&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/I2bJJ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/I2bJJ.png&quot; alt=&quot;waveform example&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For reference, here is what an amplitude 1 sine wave at 440 Hz looks like:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Ipz3y.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Ipz3y.png&quot; alt=&quot;sine 440&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And &lt;a href=&quot;https://www.youtube.com/watch?v=noJAmTcufH0&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; is what it sounds like (warning: it doesn't sound good).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Restrictions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The background of the image must be white (&lt;code&gt;#FFFFFF&lt;/code&gt; in HTML notation)&lt;/li&gt;&#xA;&lt;li&gt;The waveform may be any color that is sufficiently distinguishable from the background&lt;/li&gt;&#xA;&lt;li&gt;The input audio must be sampled at 44.1 kHz with 32-bit floats (in the inclusive range [-1, 1])&lt;/li&gt;&#xA;&lt;li&gt;For raster graphics:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Sample points must be plotted every 5 pixels&lt;/li&gt;&#xA;&lt;li&gt;The height must be an odd number of pixels, no less than 101&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Because vector graphics can scale indefinitely, the above restrictions do not apply&lt;/li&gt;&#xA;&lt;li&gt;The horizontal line in the middle of the image represents 0 amplitude, and the top and bottom of the image represent 1 and -1 amplitude, respectively&lt;/li&gt;&#xA;&lt;li&gt;The vertical scale must be linear, not logarithmic (the amplitude of the wave, not the relative loudness)&lt;/li&gt;&#xA;&lt;li&gt;The color of the wave, height of the image, input format, and output format must be the same every time your submission is run (for example, you cannot output as a PNG for one input, and a JPG for another)&lt;/li&gt;&#xA;&lt;li&gt;For the sake of testing/verification, submissions must run in under 1 minute on my machine (Core i3-3240 quad core, 3.4 GHz, 8 GB RAM) for any input.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2016-04-21T23:24:02.613" LastActivityDate="2016-04-21T23:24:02.613" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="8651" PostTypeId="1" AcceptedAnswerId="8652" CreationDate="2016-03-03T00:07:15.553" Score="4" ViewCount="132" Body="&lt;pre&gt;&lt;code&gt;LanguageSpecificTag languagespecifictag = new LanguageSpecificTag();&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/users/3808/doorknob&quot;&gt;@Doorknob's&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/907/46231&quot;&gt;Tag Categorization Project&lt;/a&gt;, there's &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/907/46231&quot;&gt;an answer&lt;/a&gt; outlining language-specific tags.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The answer notes the format of these tags' wikis:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This challenge is related to the _____ language. Note that challenges that require the answers to be in a specific language are generally discouraged.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;There are 134 questions tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;, and that's where &lt;em&gt;most&lt;/em&gt; of the relevancy for these lang-specific tags comes in.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/906/the-tag-categorization-project?lq=1#comment3234_907&quot;&gt;the comments to that answer&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/194/peter-taylor&quot;&gt;@Peter Taylor&lt;/a&gt; noted (with 10 comment votes*):&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;To be frank, a lot of these tags have no good reason to exist. In cases where the only tagged question is the tips one, the language tag doesn't really add anything.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Aha! But, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/3363/jonathan-van-matre&quot;&gt;@Jonathan Van Matre&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/906/the-tag-categorization-project?lq=1#comment4729_907&quot;&gt;responded validly&lt;/a&gt; (with 6 comment votes*) that:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;They add the ability to follow. Even if the tag has nothing but a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; tag now, following enables future activity to connect with an audience. [...] &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-agnostic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-agnostic&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-agnostic&lt;/a&gt; challenges [...] could be or already are tagged with a language tag. [...] &lt;strong&gt;I'm not saying we should spam out empty tags for every language, but I see no reason to deny those that have any posts their existence.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The reason I'm writing this question is that within the last week, I've asked &lt;a href=&quot;https://codegolf.stackexchange.com/q/74359/46231&quot;&gt;two&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/74436/tips-for-golfing-in-pike&quot;&gt;questions&lt;/a&gt; which I was slightly tempted to tag with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pike&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pike&amp;#39;&quot; rel=&quot;tag&quot;&gt;pike&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/d-lang&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;d-lang&amp;#39;&quot; rel=&quot;tag&quot;&gt;d-lang&lt;/a&gt; respectively.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I did not do this, because it felt rather abusive to make two rather pointless tags for two little-known languages, just because I wrote a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c&amp;#39;&quot; rel=&quot;tag&quot;&gt;c&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot;&gt;python&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/perl&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;perl&amp;#39;&quot; rel=&quot;tag&quot;&gt;perl&lt;/a&gt; all exist with more than just &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; to their names, while some other language-specific tags have only one &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;When is it okay to make a new language-specific tag?&lt;/strong&gt; Should we &quot;spam out empty tags for every language&quot;, or should we &lt;em&gt;only&lt;/em&gt; tolerate tags that have &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; &lt;em&gt;and&lt;/em&gt; at least one challenge? I feel there's a lack of consensus, and that having one would be constructive.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;* counting mine, because i really don't know which way i'd go&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2016-03-03T18:11:56.310" Title="When is a (new) language-specific tag appropriate?" Tags="|discussion|tags|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8652" PostTypeId="2" ParentId="8651" CreationDate="2016-03-03T00:35:39.150" Score="5" Body="&lt;h2&gt;On existing tags&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Language-specific tags are useful in two scenarios:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Challenges involving parsing, interpreting, or outputting code in a specific language, as is the case with many challenges bearing the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brainfuck&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brainfuck&amp;#39;&quot; rel=&quot;tag&quot;&gt;brainfuck&lt;/a&gt; tag.&lt;/li&gt;&#xA;&lt;li&gt;Challenges that &lt;em&gt;are&lt;/em&gt; language-specific.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&quot;But wait,&quot; you say, &quot;I thought language-specific challenges were discouraged!&quot; And in general they are. The most notable exception is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenges. Most of these require the use of a specific language so that the submissions can interact with a controller written by the OP. Having a language tag on these challenges helps identify which language is required.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another example recently that was popular, albeit rather contentious, was &lt;a href=&quot;https://codegolf.stackexchange.com/q/74384/20469&quot;&gt;A little bool magic&lt;/a&gt;, which required the use of C#. Regardless of whether pure programming puzzles are on topic, challenges such as these should also bear a tag denoting the required language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I certainly don't think we need the mass of language tags that we currently have, particularly those whose only question is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;. In fact, I think that all such tags should be eventually be removed (&lt;em&gt;not all at once&lt;/em&gt;). If there is a tag with a &lt;em&gt;good&lt;/em&gt; language-specific challenge, the tag should probably stay. Also, if there are challenges that involve parsing a language, that tag should stay.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;When is it appropriate to make a new one?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Most of the time it isn't. If you're making a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question, don't make a new language tag. If you're making some kind of language-specific challenge such as a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt;, go ahead and make the tag. If you're making a challenge that involves parsing a language, make the tag if it's a notable language (e.g. Brainfuck). In this case, use good judgement for when a language would be deemed &quot;notable&quot; and thus worthy of its own tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In any case, add the standard note to the tag wiki:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This challenge is related to the _____ language. Note that challenges that require the answers to be in a specific language are generally discouraged.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-03-03T18:11:56.310" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8654" PostTypeId="1" CreationDate="2016-03-03T02:46:02.190" Score="5" ViewCount="173" Body="&lt;p&gt;This question and proposal is different from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7323/42643&quot;&gt;this&lt;/a&gt; one, since this proposal includes a scoring mechanism that is vastly different from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What is size coding?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Size coding as a form of competetion has been established in 1998 by HUGI (a &lt;a href=&quot;https://en.wikipedia.org/wiki/Demoscene&quot; rel=&quot;nofollow noreferrer&quot;&gt;demoscene&lt;/a&gt; e-zine). The competitions (&quot;compos&quot;) have been organized regularly since 1998 up until 2009. You can review a history of challenges, rules and entries &lt;a href=&quot;http://www.hugi.scene.org/compo/compoold.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;How are they scored?&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;in  this  competition you are supposed to try  to create an exe- or a com-file&#xA;  whose  size is as small as possible. the  winner will be the one whose com- or&#xA;  exe-file has the smallest number of bytes.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Even though the source code &lt;strong&gt;had&lt;/strong&gt; to be included, the scoring would only be affected by the size of the binary submitted by the answerer in bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;To further prevent confusion: The entry consists of one single, binary file. The code or methods that were used to generate this binary are irrelevant. The contestants submit their single file, the host will run and score this file. There is no compiling involved (by the host that is).&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;How should size coding challenges work here?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A challenge carrying the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/size-coding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;size-coding&amp;#39;&quot; rel=&quot;tag&quot;&gt;size-coding&lt;/a&gt; tag should include the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The rules and forbidden loopholes should be stated as clear as in any other challenge on this site.&lt;/li&gt;&#xA;&lt;li&gt;The challenge must include the platforms the author is able to test the binary on (e.g. &lt;code&gt;x86/64 PE32, SSE3/AVX support, Windows 8.1 Pro&lt;/code&gt; or &lt;code&gt;x64 ELF, SSE2 support, archlinux&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Optionally a date on which the compo ends the scores will be made final&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Why not just &quot;code-golf&quot;?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The main difference here is the scoring by the binary size. The binary is what actually determines a person's score (and thus needs to be tested). This allows quite a few languages to be used, but shifts the focus from creating the shortest possible code, to a higher balance between algorithm optimization &lt;em&gt;and&lt;/em&gt; coding.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yes, this also disqualifies almost all golfing langs, but this is not my intention nor my interest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the linked question above, Peter Taylor expressed concerns about the &quot;reproduce-ability&quot; of the actual binary code, which is exactly why size coding entries are scored by file size, not code size. You can have very clean and interesting solutions in code, and still win.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What about VMs?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;JVM or IL binaries are usually discouraged, but not excluded if the actual binary can run without any dependencies on the target platform. I will cite the PC compo rules of this year's Revision, because they reflect exactly my stance on this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;DotNet Entries: DotNet 4.5.x, part of Windows 8, is available. We will not install any older versions.&lt;/li&gt;&#xA;  &lt;li&gt;And in case someone might still have this mad idea: We will not install any drivers or virtual machines to provide or improve DOS compatibility.&lt;/li&gt;&#xA;  &lt;li&gt;Java entries are allowed but you need to provide your own runtime in the submitted archive. This runtime will not be installed on the compo machine so you will have to start your production using the command line switches.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The logical consequence is that you'd choose linux as your platform for Java entries (because they might have JVM by default) and Windows for MSIL entries.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Obsolete hardware that provides advantages&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As long as the author can provide a native hardware running the target operating system (no Virtual Machines), they can accept entries for it. E.g. by default, I expect no one to own a PC that actually runs MS-DOS. So even though &quot;approximations&quot; like FreeDOS exist, the latter would not be valid for accepting MS-DOS &lt;code&gt;COM&lt;/code&gt; entries. (The same way ReactOS can't be used to accept Windows XP entries and so on).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Why not do X, add Y or even merge this into the challenge type Z?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is size coding. Everything else pretty much isn't size coding. I want to provide a challenge type for folks who are familiar with actual size coding or still do it. So here's a TL;DR (mainly for &lt;em&gt;contestants&lt;/em&gt; in a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/size-coding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;size-coding&amp;#39;&quot; rel=&quot;tag&quot;&gt;size-coding&lt;/a&gt; challenge):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The score is the byte size of the binary that runs natively, without any additional files or dependencies on the default configuration of any given platform specified by the author.&lt;/li&gt;&#xA;&lt;li&gt;Explanation (as code or in words) has to be included.&lt;/li&gt;&#xA;&lt;li&gt;Scores should be made final on a given date.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Size coding challenges are pretty much on-topic (there's another question to discuss this), this is a proposal for a challenge standard.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Personal thoughts: There are many people interested in actual size coding. I think this site can provide a nice platform for it - without harming other challenge types.&lt;/p&gt;&#xA;" OwnerDisplayName="user42643" LastEditorUserId="61563" LastEditDate="2018-02-18T20:02:46.333" LastActivityDate="2018-02-18T20:02:46.333" Title="Tag / challenge type proposal: Size coding" Tags="|discussion|challenges|scoring|new-genre|" AnswerCount="0" CommentCount="22" ClosedDate="2016-03-12T00:55:00.257" ContentLicense="CC BY-SA 3.0" />
  <row Id="8655" PostTypeId="2" ParentId="8634" CreationDate="2016-03-03T03:18:06.997" Score="2" Body="&lt;p&gt;The question is off topic per &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1727/20469&quot;&gt;the meta consensus&lt;/a&gt; and isn't notable enough to warrant a historical lock. The moderators discussed the best course of action and decided to simply delete the question.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-03-03T03:18:06.997" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8656" PostTypeId="2" ParentId="2140" CreationDate="2016-03-03T10:44:48.217" Score="5" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;This is a proposal adopted by programmer5000. Any feedback before I post it?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Seven-segment usage&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I have an old digital clock and I am concerned the individual segments of the digits might run out of magical binary energy or whatever powers them. To know which of the segments on the clock will fail first I want to know what is the percentage of time each segment is lit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is to compute the percentage of time any segment on a digital clock is lit.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input will be in the form &lt;strong&gt;X.L&lt;/strong&gt;, where:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;X is a number from 1 to 4. 1 is the left-most number of the clock, 4 the right-most&lt;/li&gt;&#xA;&lt;li&gt;L is a letter from a to g or a number from 1 to 7&lt;/li&gt;&#xA;&lt;li&gt;the separator can be changed to fit your needs (no separator is an option)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/zMDDh.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/zMDDh.png&quot; alt=&quot;Disposition of segments, image source: Wikipedia&quot;&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/6u5QK.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/6u5QK.png&quot; alt=&quot;Disposition of segments plus numbers image source: Wikipedia]&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The output, is a percentage, given with at least 2 figures after the decimal point. It can be rounded or truncated to the closest value if you want to keep a limited number of digits. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Valid outputs: 0.74, 32.47, 7.5 (for 7.50)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Additional stuff&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The clock is in 24 hours format (so 22:45 is a valid time).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We consider the clock started working at 0:00 so the challenge is effectively working out what percentage of a complete day a single segment is lit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first number is not lit when it is 0.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lit segments for each number:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1: b c&lt;/li&gt;&#xA;&lt;li&gt;2: a b d e g&lt;/li&gt;&#xA;&lt;li&gt;3: a b c d g &lt;/li&gt;&#xA;&lt;li&gt;4: b c f g&lt;/li&gt;&#xA;&lt;li&gt;5: a c d f g&lt;/li&gt;&#xA;&lt;li&gt;6: a c d e f g &lt;/li&gt;&#xA;&lt;li&gt;7: a b c &lt;/li&gt;&#xA;&lt;li&gt;8: a b c d e f g&lt;/li&gt;&#xA;&lt;li&gt;9: a b c d f g&lt;/li&gt;&#xA;&lt;li&gt;0: a b c d e f&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1.b =&gt; 58.33&lt;/li&gt;&#xA;&lt;li&gt;3.e =&gt; 33.33&lt;/li&gt;&#xA;&lt;li&gt;2.d =&gt; 70.83&lt;/li&gt;&#xA;&lt;li&gt;4.d =&gt; 70.00&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Full list of outputs &lt;a href=&quot;http://pastebin.com/ZLSFNSug&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winner&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Code golf, most probably, though I am not sure yet this is the best format (I am not too interested in the input parsing and the output formatting, they might be an obstacle to golfing?)&lt;/p&gt;&#xA;" OwnerUserId="47872" LastEditorDisplayName="user58826" LastEditDate="2017-06-09T22:10:56.753" LastActivityDate="2017-06-09T22:10:56.753" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8660" PostTypeId="2" ParentId="2140" CreationDate="2016-03-04T09:23:33.443" Score="3" Body="&lt;h1&gt;Capture the Flag&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;Do you ever wonder why we're here?&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Capture the enemy team's flag and return it to your base. The first team to 3 captures wins the round. The player with the most wins across all (number TBD) rounds wins the game.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Teams&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There will be two teams each round. Teams will be randomly, evenly assigned to all submissions at the start of each round.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Playing&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The game will be turn-based. At the start of each turn, each player will be given the current map. All players will move simultaneously. Players shall submit their move as a one or two character ASCII string, composed from the following options:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;First character: &lt;code&gt;w&lt;/code&gt;ait, &lt;code&gt;m&lt;/code&gt;ove, &lt;code&gt;s&lt;/code&gt;tab (if not holding flag), &lt;code&gt;d&lt;/code&gt;rop (if holding flag), or &lt;code&gt;p&lt;/code&gt;ick-up (if standing on a flag)&lt;/li&gt;&#xA;&lt;li&gt;Second character: &lt;code&gt;n&lt;/code&gt;orth, &lt;code&gt;e&lt;/code&gt;ast, &lt;code&gt;s&lt;/code&gt;outh, or &lt;code&gt;w&lt;/code&gt;est, or nothing if &lt;code&gt;w&lt;/code&gt;aiting, &lt;code&gt;d&lt;/code&gt;ropping, or &lt;code&gt;p&lt;/code&gt;icking-up&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Moving a direction will result in the player moving one square in that direction if possible, otherwise standing still (for example, if the player is attempting to move into a wall, or into an occupied square). Stabbing in a direction will result in killing the player standing in the adjacent square in that direction, unless the player is a teammate (no teamkilling). Stabs are processed before moves each turn. Dropping the flag results in it being placed on the ground beneath the player. Drop, pick-up, and wait commands ignore the second character. Invalid commands are interpreted as waiting. Case is ignored, so &lt;code&gt;W&lt;/code&gt; and &lt;code&gt;w&lt;/code&gt; are the same command. Either team may pick up either flag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If two or more players attempt to move onto the same square, one of the players will be randomly selected to successfully move, and the rest will not move.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a player is killed, they will drop the flag they are holding (if they are holding one), and will respawn in 3 turns in an unoccupied square in their home base. If there is no unoccupied square in their home base, they will respawn in the nearest square to the base. Respawns happen after stabs, but before moves.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Inside each base, there will be a 5x5 square room, with doorways in the middle of each wall, and the team's flag in the center of the room. Players who spend 5 consecutive turns inside their team's flag room (this includes the 4 doorways), while no enemies are present in the flag room and they are not holding a flag, will be killed at the conclusion of the 5th turn, to discourage camping. Successfully placing the enemy's flag on top of your flag's stand (in the center of the room), either by &lt;code&gt;d&lt;/code&gt;ropping it or being killed on top of the flag stand, will result in a point being scored for your team and the enemy's flag immediately returning to their flag stand.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Map&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(work in progress)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The world map will be a single level (no upstairs or downstairs), represented as such:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# : wall, cannot be moved into&#xA;. : an empty space&#xA;F : the enemy team's flag&#xA;f : your flag&#xA;! : a flag stand (with no flag on it)&#xA;@ : you&#xA;$ : you, carrying the enemy flag&#xA;% : you, carrying your flag&#xA;p : one of your teammates&#xA;P : an enemy player&#xA;c : a teammate, carrying or standing on top of the enemy flag&#xA;C : an enemy player, carrying or standing on top of your flag&#xA;s : a teammate, carrying or standing on top of your flag&#xA;S : an enemy player, carrying or standing on top of the enemy flag&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here is an example map (the actual maps used in the tournament will be posted later):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;####################################################&#xA;#..................................................#&#xA;#..###.###########.######........###......##########&#xA;#..#....................#..........................#&#xA;#..#.....###.###...................#######.........#&#xA;#..#.....#.....#........#..........................#&#xA;#..#.....#.....#........#...................#...#..#&#xA;#..#........f...........#..........................#&#xA;#........#.....#........#....#########.............#&#xA;#..#.....#.....#........#..........................#&#xA;#..#.....###.###........#......##################..#&#xA;#..#...............................................#&#xA;#..#.#################.............................#&#xA;#.........................###########.........###..#&#xA;#..................................................#&#xA;####################################...............#&#xA;####################################...............#&#xA;#..................................................#&#xA;#..................................................#&#xA;#...............####################################&#xA;#...............####################################&#xA;#..................................................#&#xA;#..###.........###########.........................#&#xA;#.............................#################.#..#&#xA;#...............................................#..#&#xA;#..##################......#........###.###.....#..#&#xA;#..........................#........#.....#.....#..#&#xA;#.............#########....#........#.....#........#&#xA;#..........................#...........F........#..#&#xA;#..#...#...................#........#.....#.....#..#&#xA;#..........................#........#.....#.....#..#&#xA;#.........#######...................###.###.....#..#&#xA;#..........................#....................#..#&#xA;##########......###........######.###########.###..#&#xA;#..................................................#&#xA;####################################################&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Controller&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The controller and an example map and player are located &lt;a href=&quot;https://github.com/Mego/PyCTF&quot; rel=&quot;nofollow noreferrer&quot;&gt;on the challenge's GitHub project&lt;/a&gt;. Once I finish the controller, I'll copy the program here.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Restrictions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bots must be fully deterministic. RNGs may not be used.&lt;/li&gt;&#xA;&lt;li&gt;Bots may be written in any language, so long as they support reading ASCII input from STDIN and writing ASCII output to STDOUT. Anything that is written to STDERR will be ignored.&lt;/li&gt;&#xA;&lt;li&gt;Bots' processes will be started at the beginning of each turn, and must output their command and terminate within the given 5 seconds.&lt;/li&gt;&#xA;&lt;li&gt;Each bot will be able to store up to 1 MiB (1024*1024 bytes) of data on disk per game, for saving any stateful data they desire. The name of the bot's data file will be passed as the first command line argument to the bot process. Should a bot write more than 1 MiB of data during a single game, data from the beginning of the file will be removed to append additional data to the end of the file. At the end of each game, the data files will be wiped.&lt;/li&gt;&#xA;&lt;li&gt;Any attempt to tinker with the controller, runtime or other submissions will be disqualified. All submissions should only work with the inputs and storage they are given.&lt;/li&gt;&#xA;&lt;li&gt;Bots should not be written to beat or support specific other bots.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Anything missing or unclear (other than the parts specifically marked as TBD)?&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2016-06-07T02:39:41.773" LastActivityDate="2016-06-07T02:39:41.773" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="8662" PostTypeId="2" ParentId="2140" CreationDate="2016-03-04T16:15:31.573" Score="0" Body="&lt;h1&gt;Binary Arithmetic Using Unary Operators &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;This is based off a game I was playing with a friend a few years back. How many different mathematical operators can you implement using only unary operators in your source*. We were able to implement most basic arithmetic in C, but for this challenge you can use any language.&lt;/p&gt;&#xA;&lt;p&gt;* Except under certain conditions, see below.&lt;/p&gt;&#xA;&lt;h2&gt;Specifics:&lt;/h2&gt;&#xA;&lt;p&gt;All binary operators are disallowed, except under the following conditions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Binary comparison operators are allowed as long as one operand is a constant (e.g. you can do &lt;code&gt;if (x == 0)&lt;/code&gt; or &lt;code&gt;if (x)&lt;/code&gt; but not &lt;code&gt;if (x == y)&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;You may use binary assignment to load user input, &lt;em&gt;only at the start of your code&lt;/em&gt;, or if you create a binary &lt;code&gt;=&lt;/code&gt; method using these rules.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that all variables are default-initialized to 0; if your language does not default-initialize variables, you are allowed to set them to zero &lt;em&gt;only at the start of your code&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Additionally, please note the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You do not have to write a complete program if your language supports functions/methods.&lt;/li&gt;&#xA;&lt;li&gt;You can use other operators from your source (e.g. your implementation of &lt;code&gt;*&lt;/code&gt; could use your implementation of &lt;code&gt;+&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Standard library functions follow these rules too (e.g. you can use &lt;code&gt;sqrt(x)&lt;/code&gt; but not &lt;code&gt;mod(x, y)&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Scoring:&lt;/h2&gt;&#xA;&lt;p&gt;Your score is determined by the formula &lt;code&gt;[code size in bytes] / [number of operators implemented]&lt;/code&gt;. So for example, a 300-byte program that includes the functions &lt;code&gt;+&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;, and &lt;code&gt;*&lt;/code&gt; would count as &lt;code&gt;300/3 = 100&lt;/code&gt;. Lowest score wins.&lt;/p&gt;&#xA;" OwnerUserId="30661" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-04T16:15:31.573" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8664" PostTypeId="1" CreationDate="2016-03-05T04:35:14.670" Score="18" ViewCount="1033" Body="&lt;p&gt;So we already have questions of the type &quot;Tips for Golfing in XXX&quot; and these are accepted as on-topic. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question is would any question of the type &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;Tips for [time/memory/any]-optimization [in language XXX]&quot; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;be on-topic here. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This could include things like:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&quot;Tips for time-optimizing in Rust&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&quot;Tips for optimizing in Rust&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Answers might look like:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;Rust doesn't use tail end recursion optimization. Iteration will almost always be faster than recursion.&quot; (&amp;lt;-- may or may not be true)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It seems to me that since golfing tips are on-topic, optimization tips should also be. The counterargument that I can see is that optimization is a well studied subject with tomes upon tomes written about it. Golfing is not and this website is one of the few resources for golfing. &lt;/p&gt;&#xA;" OwnerUserId="45459" LastEditorUserId="45459" LastEditDate="2016-07-01T15:24:58.610" LastActivityDate="2017-10-10T01:28:19.630" Title="Would &quot;Tips for optimization in XXX&quot; be on-topic on main" Tags="|discussion|asking-questions|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8667" PostTypeId="2" ParentId="2140" CreationDate="2016-03-05T23:58:35.347" Score="1" Body="&lt;h1&gt;Recompose a series of alternating binary sequences&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;This is the inverse of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8666/12914&quot;&gt;Decompose binary into alternating subsequences&lt;/a&gt;.&lt;/strong&gt; The essence of this linked challenge is to convert a decimal integer to binary, split on adjacent 0s or 1s (like &lt;code&gt;010110001&lt;/code&gt; would become &lt;code&gt;0101 10 0 01&lt;/code&gt;), and convert each subsequence back to decimal.&lt;/p&gt;&#xA;&lt;p&gt;Let's take a sequence of positive integers in decimal, like&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;10 21 2 5 1 1 1 1 1 2 1 2 5 1 85 5 1 1 1 5 1 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And convert each number to binary...&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1010 10101 10 101 1 1 1 1 1 10 1 10 101 1 1010101 101 1 1 1 101 1 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;But wait, this is the &lt;em&gt;inverse&lt;/em&gt; of the decomposition problem. The original binary representation was split where there were two adjacent 0s or 1s. Hence, if &lt;code&gt;10101&lt;/code&gt; comes after &lt;code&gt;1010&lt;/code&gt;, then there must have been a leading 0. Adding these in results in this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1010 010101 10 0101 1 1 1 1 1 10 01 10 0101 1 1010101 101 1 1 1 101 1 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Which, after concatenation and converting back to decimal, gives &lt;code&gt;727429805944311&lt;/code&gt; as the final answer.&lt;/p&gt;&#xA;&lt;h2&gt;The Task&lt;/h2&gt;&#xA;&lt;p&gt;Take a sequence of positive integers as input and output a single positive integer after recomposition.&lt;/p&gt;&#xA;&lt;h2&gt;The Details&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input may be in a sensible, human-readable format that is convenient for your language. All integers must be in decimal or unary, and no precomputation in the input is allowed.&lt;/li&gt;&#xA;&lt;li&gt;Output must be a single positive integer, in either decimal or unary.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input                Output&#xA;0                    0&#xA;1                    1&#xA;2                    2&#xA;1 1                  3&#xA;2 0                  4&#xA;5                    5&#xA;1 2                  6&#xA;1 1 1                7&#xA;2 0 0                8&#xA;2 1                  9&#xA;10                   10&#xA;1 2 2                50&#xA;1 2 2 0              100&#xA;1 1 1 1 10 0 0       1000&#xA;2 1 1 2 0 2 0 0 0    10000&#xA;1 2 2 1 1 2 2        12914&#xA;5 42 10 2 1          371017&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="12914" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-08T09:00:18.840" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8668" PostTypeId="2" ParentId="2140" CreationDate="2016-03-06T02:52:39.383" Score="2" Body="&lt;h1&gt;Igpā Atinlā (Pig Latin)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge, we will be translating strings of words to Pig Latin.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; A string of words (a &quot;word&quot; is a continuous sequence of the characters A-Za-z) (ASCII only).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt; The translated version of the input. Translations described below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Some Definitions:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First, the following are &lt;em&gt;vowels&lt;/em&gt;: &quot;A,a, E,e, I, i, O, o, U, u&quot;. Any alphabet character that is not a vowel is a consonant. A &lt;em&gt;consonant cluster&lt;/em&gt; is any continuous sequence of consonants surrounded on both sides by non consonant characters (or beginning/end of input). An example, the clusters are in bold:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;I a&lt;strong&gt;m&lt;/strong&gt; &lt;strong&gt;tw&lt;/strong&gt;o &lt;strong&gt;h&lt;/strong&gt;u&lt;strong&gt;ndr&lt;/strong&gt;e&lt;strong&gt;d&lt;/strong&gt; &lt;strong&gt;y&lt;/strong&gt;ea&lt;strong&gt;rs&lt;/strong&gt; &lt;strong&gt;y&lt;/strong&gt;ou&lt;strong&gt;ng&lt;/strong&gt;, &lt;strong&gt;y&lt;/strong&gt;ou &lt;strong&gt;ch&lt;/strong&gt;i&lt;strong&gt;ld&lt;/strong&gt;-&lt;strong&gt;m&lt;/strong&gt;o&lt;strong&gt;th&lt;/strong&gt;e&lt;strong&gt;r&lt;/strong&gt;.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;em&gt;word&lt;/em&gt; is a set of alphabet characters surrounded on both sides by non-alphabet characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Translation:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If the string &quot;'s&quot; or &quot;'d&quot; or &quot;'t&quot; appears (&quot;apostrophe s/d/t&quot;), remove the apostrophe.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;For each &lt;em&gt;word&lt;/em&gt; in the string, do the following:&lt;/p&gt;&#xA;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;&lt;p&gt;If a word only contains capital letters (A-Z), ignore the next step.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the beginning of the word was a capital letter (A-Z) AND a consonant, change it to its lower-case equivalent (a-z). Then capitalize the first vowel in the word. If no vowel exists, then recapitalize the letter. e.g. &lt;strong&gt;&lt;em&gt;S&lt;/strong&gt;tretch&lt;/em&gt; --&gt; &lt;em&gt;str&lt;strong&gt;E&lt;/strong&gt;tch&lt;/em&gt;, &quot;Twxx&quot; --&gt; &quot;Twxx&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the word begins with a consonant cluster, move that consonant cluster to the end of the word. e.g. &lt;strong&gt;&lt;em&gt;str&lt;/strong&gt;etch&lt;/em&gt; --&gt; &lt;em&gt;etch&lt;strong&gt;str&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Append the &quot;hard a&quot; character to the word. If every letter is capital, append 'Ā'. Otherwise append 'ā' e.g. &lt;em&gt;etchstr&lt;/em&gt; --&gt; &lt;em&gt;etchstr&lt;strong&gt;ā&lt;/em&gt;&lt;/strong&gt;, &quot;ATC&quot; --&gt; &quot;ATC&lt;strong&gt;Ā&lt;/strong&gt;&quot;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If your language is unable to output 'ā' and 'Ā', you may use &quot;ay&quot; and &quot;AY&quot; respectively.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the word is &quot;A&quot; or &quot;a&quot;, ignore previous instructions. Transform the word to &quot;Anā&quot; or &quot;anā&quot;, respectively. (because in Pig Latin, everything begins with a vowel, so we use the article &quot;an&quot; instead of &quot;a&quot;)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test Cases:&lt;/strong&gt; (&lt;em&gt;I think these are right&lt;/em&gt;)&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&quot;I want to be a cat.&quot; --&gt; &quot;IĀ antwā otā ebā anā atcā&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&quot;That's a really nice... ass-car?&quot; --&gt; &quot;Atsthā anā eallyrā icenā... assā-arcā?&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&quot;[CR][NL]'ssssssssssssssssssTRUExxxxxxxxIAMSOCOOL&quot; --&gt; &quot;[CRĀ][NLĀ]UExxxxxxxxIAMSOCOOLssssssssssssssssssTRā&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&quot;THIS CHALLENGE IS PROBABLY A DUPE&quot; --&gt; &quot;ISTHĀ ALLENGECHĀ ISĀ OBABLYPRĀ Anā UPEDĀ&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&quot;I SAT ON an APPLE&quot; --&gt; &quot;IĀ ATSĀ ONĀ anā APPLEĀ&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="45459" LastEditorUserId="45459" LastEditDate="2016-03-09T07:10:47.227" LastActivityDate="2016-03-09T07:10:47.227" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="8671" PostTypeId="2" ParentId="8546" CreationDate="2016-03-06T20:46:06.143" Score="3" Body="&lt;p&gt;Ideally, the challenge and its scoring cases should be designed so that executing each scoring case takes a significant amount of time. If that is the case and the desired output is sufficiently short, simply using the &lt;code&gt;time&lt;/code&gt; command should do the trick.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every now and then, that isn't possible. If the solutions that have been posted are a lot faster than anticipated, there are only two possible ways (I can think of) that may still provide usable timings:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Change the scoring cases. That's not always possible without invalidating all answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the input may have been guaranteed to fit in a signed 32-bit integer. But even then, using test cases close to the maximum input should produce more reliable results.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Time the submissions from within.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Simply timing everything &lt;strong&gt;n&lt;/strong&gt; times for a large value of &lt;strong&gt;n&lt;/strong&gt; may reduce the variance, but if starting a process takes more or less the same time as the actual computation, it won't be enough to compare submissions.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;For example, let us take &lt;a href=&quot;https://codegolf.stackexchange.com/a/74372&quot;&gt;my answer to your latest challenge&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$ a=(1907000000 1337000000 1240000000 660000000 99820000 40550000 24850000 41500)&#xA;$ for j in ${a[@]}; do time ./pi2 $j; done 2&amp;gt;&amp;amp;1 | grep real&#xA;real    0m0.011s&#xA;real    0m0.008s&#xA;real    0m0.007s&#xA;real    0m0.005s&#xA;real    0m0.002s&#xA;real    0m0.002s&#xA;real    0m0.002s&#xA;real    0m0.001s&#xA;$ time /bin/true&#xA;&#xA;real    0m0.001s&#xA;user    0m0.000s&#xA;sys     0m0.001s&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Executing the last scoring case is as fast as literally doing nothing. In fact, the last &lt;em&gt;four&lt;/em&gt; test cases actively harm the timing process, as their run times are entirely dominated by process creation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let us compare running each scoring case 1000 times with running &lt;code&gt;time&lt;/code&gt; (the external command, not the shell keyword) an equal amount of times.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$ time for i in {1..1000}; do for j in ${a[@]}; do ./pi $j; done; done &amp;gt; /dev/null&#xA;&#xA;real    0m21.138s&#xA;user    0m14.451s&#xA;sys     0m2.945s&#xA;$ time for i in {1..1000}; do for j in ${a[@]}; do /bin/true $j; done; done &amp;gt;&amp;amp;-&#xA;&#xA;real    0m7.141s&#xA;user    0m0.507s&#xA;sys     0m1.875s&#xA;$ time for i in {1..1000}; do for j in ${a[@]}; do true $j; done; done &amp;gt;&amp;amp;-&#xA;&#xA;real    0m0.084s&#xA;user    0m0.088s&#xA;sys     0m0.000s&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Roughly one third of the measured wall time is spent creating processes. This exhibits &lt;em&gt;a lot&lt;/em&gt; of variance. In fact, user + system time only account for 2.382 second of the elapsed 7.141 seconds. The remaining time, the CPU core is idle, waiting for whatever resources need to be ready to create a process.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For comparison, I timed my submission from within the program and computed the average with awk.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$ for i in {1..1000}; do for j in ${a[@]}; do ./pisave $j; done; done &amp;gt; times&#xA;$ awk '{ sum += $2; } END { print sum / 1e9; }' times&#xA;14.1176&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This dropped the average execution time of the combined scoring cases from 0.021 to 0.014 seconds, which is the actual time the CPU spends executing the code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition, the variance is &lt;em&gt;a lot&lt;/em&gt; lower.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-03-06T20:46:06.143" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8675" PostTypeId="1" CreationDate="2016-03-08T00:19:46.737" Score="2" ViewCount="86" Body="&lt;p&gt;Recently I asked this question: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/75040/solve-a-quadratic-expression&quot;&gt;https://codegolf.stackexchange.com/questions/75040/solve-a-quadratic-expression&lt;/a&gt;. Seconds after I posted, it was flagged as a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4001/resolve-quadratic-equation&quot;&gt;Resolve quadratic equation&lt;/a&gt;, and was downvoted several times. The two titles look similar, but, as I put in the comments,&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;...The main challenge for mine is interpreting a string, whereas the other question's main challenge is solving a quadratic (as it takes three numbers separated by commas such as &lt;code&gt;1,2,3&lt;/code&gt; rather than a visual expression such as &lt;code&gt;x^2+2x+3&lt;/code&gt;).&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'm not sure why people who actually read my question would not be able to see that my challenge is different.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can someone explain why it's considered a duplicate?&lt;/p&gt;&#xA;" OwnerUserId="49969" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-03-08T01:05:18.053" Title="Why is this a duplicate?" Tags="|discussion|duplicates|flags|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8676" PostTypeId="2" ParentId="8675" CreationDate="2016-03-08T01:05:18.053" Score="7" Body="&lt;p&gt;Your challenge has two pieces to it:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Parse a string&lt;/li&gt;&#xA;&lt;li&gt;Find the roots of a quadratic equation&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;If the string parsing part was left out, it would be an exact duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4001/resolve-quadratic-equation&quot;&gt;Resolve quadratic equation&lt;/a&gt;. So, let's look at the string parsing part.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Parsing the string is either incredibly trivial (for languages with regex or similar features), or very cumbersome (for languages without such features). There are many submissions on the existing challenge that would be able to be copied over and be competitive with very minor modifications (a single call to a regex library would do the trick in many of them), so by that criteria it's a duplicate. Additionally, the string parsing requirement is a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8077/45941&quot;&gt;cumbersome I/O format&lt;/a&gt; that detracts from the main part of the challenge.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2016-03-08T01:05:18.053" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8678" PostTypeId="2" ParentId="2140" CreationDate="2016-03-08T06:14:17.637" Score="0" Body="&lt;h1&gt;[title TBD]&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;An integer &lt;em&gt;n&lt;/em&gt; between 1 and [currently 1652; TBD at the time of posting the comic], inclusive.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;The XKCD title for comic number &lt;em&gt;n&lt;/em&gt;. (This is the text written above the comic panel, i.e. the text content of the &lt;code&gt;&amp;lt;div id=&amp;quot;ctitle&amp;quot;&amp;gt;&lt;/code&gt; element, not the &lt;code&gt;title&lt;/code&gt;-attribute value of the &lt;code&gt;img&lt;/code&gt; element. &lt;a href=&quot;//www.explainxkcd.com/wiki/index.php/List_of_all_comics_%28full%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here's a handy list&lt;/a&gt;, though the actual comic on &lt;a href=&quot;//xkcd.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;xkcd.com&lt;/code&gt;&lt;/a&gt; will govern if it differs from what's on that list. However, the title is displayed in caps and smallcaps due to CSS, and you must output it in caps and lowercase (respectively).)&lt;/p&gt;&#xA;&lt;p&gt;(If by the time the question is posted there's a comics with an ampersand-escaped character reference — I don't think there are any now — then I'll also add a caveat about how the output of your program should include the actual character, not the ampersand-escaped reference.)&lt;/p&gt;&#xA;&lt;h2&gt;Obviously…&lt;/h2&gt;&#xA;&lt;p&gt;I/O can be by any standard means and in any standard format. And no using the Internet to look up the title.&lt;/p&gt;&#xA;" OwnerUserId="1976" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-08T06:14:17.637" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8679" PostTypeId="1" CreationDate="2016-03-08T08:04:54.297" Score="2" ViewCount="188" Body="&lt;p&gt;So this just happened:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/RMqhP.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/RMqhP.png&quot; alt=&quot;suspension&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/messages/28093955/history&quot;&gt;This&lt;/a&gt; is the linked message. For those that can't see it, the text was &quot;I want that in my mouth&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I was talking about food. Specifically, &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/28093936#28093936&quot;&gt;the previous message&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/NGZmV.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/NGZmV.jpg&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does somebody have a grudge? Was it an accident? Did cosmic rays hit the servers just right to cause that?&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2016-03-08T08:30:17.143" Title="Undeserved chat suspension" Tags="|support|chat|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8680" PostTypeId="2" ParentId="8679" CreationDate="2016-03-08T08:30:17.143" Score="9" Body="&lt;p&gt;The immediate context:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;brb changing pants&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;[This was a reply to the image in the question.]&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;(because I drooled all over them, dirty mind)&lt;br&gt;&#xA;  I want that in my mouth&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It's not clear what happened, but the message did draw two separate flags. My &lt;em&gt;guess&lt;/em&gt; is that your previous messages &lt;a href=&quot;https://en.wikipedia.org/wiki/Priming_(psychology)&quot; rel=&quot;nofollow&quot;&gt;primed&lt;/a&gt; some people to assume you were attempting some sort of crass humor. It took me about three tries to figure out your train of thought. I would imagine the flaggers simply arrived at the wrong conclusion from the way the chat items were &lt;a href=&quot;https://www.youtube.com/watch?v=hyLWrKh2fB0&quot; rel=&quot;nofollow&quot;&gt;phrased&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, I guess, in a sense, the chat suspension was undeserved. On the other hand, there's no shame in expressing the idea using a less ambiguous phrase such as:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Yum!&lt;/li&gt;&#xA;&lt;li&gt;That looks delicious.&lt;/li&gt;&#xA;&lt;li&gt;I bet that's tasty.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8534" LastActivityDate="2016-03-08T08:30:17.143" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8683" PostTypeId="2" ParentId="2140" CreationDate="2016-03-09T01:00:51.413" Score="0" Body="&lt;p&gt;The overall task will involve extracting market data for various trading instruments (represented by unique symbols), applying some transformations and statistical functions, and displaying the results in a report.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Obtain the following QUOTES series from Bashoop: &lt;code&gt;TYQUOTES&lt;/code&gt;, &lt;code&gt;FVQUOTES&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The quotes data is stored as a BBO. BBO stands for best bid/offer, which represents the best bid and ask (ask and offer are interchangable terms) in the market for a given instrument at any given time. At each timestamp it contains, in the following order: &lt;code&gt;bid price&lt;/code&gt;, &lt;code&gt;bid quantity&lt;/code&gt;, &lt;code&gt;ask price&lt;/code&gt;, &lt;code&gt;ask quantity&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Calculate a &lt;code&gt;VwMpt&lt;/code&gt; at each timestamp t for each instrument's QUOTES series&#xA;    &lt;code&gt;VwMpt_t = bid_price_t + (ask_price_t-bid_price_t) * (bid_qty_t / (bid_qty_t+ask_qty_t))&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Calculate a rolling correlation rho of &lt;code&gt;VwMpt&lt;/code&gt; returns (first difference, i.e. derivative) sampled at 1 minute intervals with a lookback of 100 samples&lt;/li&gt;&#xA;&lt;li&gt;On a webpage, display a plot of &lt;code&gt;VwMpt&lt;/code&gt; substracted from the first sample (so the time series starts at 0) of both series on the same line chart, and below it plot the rho lined up along the same time axis. You may use a library like Flot or something similar.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;To download a series with a series_id of FVQUOTES from a Bashoop instance located at 149.202.47.189:8080 you can: &lt;code&gt;curl -s -d &quot;series_id=FVQUOTES&quot; -d &quot;start_ts=0&quot; -d &quot;end_ts=1451606400000000&quot; -d &quot;compress=0&quot; http://149.202.47.189:8080/series -X GET&lt;/code&gt; where &lt;code&gt;start_ts&lt;/code&gt; and &lt;code&gt;end_ts&lt;/code&gt; are micros send epoch. In this case we want the full history.&lt;/p&gt;&#xA;" OwnerUserId="51976" LastActivityDate="2016-03-09T01:00:51.413" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8684" PostTypeId="1" CreationDate="2016-03-09T03:00:25.180" Score="0" ViewCount="58" Body="&lt;p&gt;This isn't an issue yet, but I could see it become one sometime soon. Can I take input in two, or even more, separate formats, provided they're both &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;reasonable formats&lt;/a&gt;? For example, let's say one input was from the user over STDIN and another was a command line argument. If I made that clear in my post would that be acceptable? &lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2016-03-09T03:00:25.180" Title="Is it acceptable to take input in two different formats?" Tags="|discussion|code-golf|" AnswerCount="0" CommentCount="2" ClosedDate="2016-03-09T03:01:50.543" ContentLicense="CC BY-SA 3.0" />
  <row Id="8686" PostTypeId="2" ParentId="2140" CreationDate="2016-03-09T18:31:33.353" Score="1" Body="&lt;h1&gt;Count the Esolang Puns&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/counting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;counting&amp;#39;&quot; rel=&quot;tag&quot;&gt;counting&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This challenge was inspired by &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/conversation/language-puns&quot;&gt;this conversation&lt;/a&gt; in chat.&lt;/p&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;Yesterday in &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;chat&lt;/a&gt;,&#xA;there was a conversation where several people extensively used esolang puns. @CᴏɴᴏʀO'Bʀɪᴇɴ kept a tally throughout to see who used the most puns. Your job will be to help him out by counting the puns.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Your challenge will take several strings as input and output a list of scores. Input can be in a list, separated by newlines, etc. Output can be in any convenient format, in any order. Each string of input will be in the form &lt;code&gt;user : message&lt;/code&gt;. Both &lt;code&gt;user&lt;/code&gt; and &lt;code&gt;message&lt;/code&gt; will only contain printable ASCII characters. You need to count the amount of language puns used in the message and add it to that user's tally. Use &lt;a href=&quot;http://esolangs.org/wiki/Language_list&quot; rel=&quot;nofollow noreferrer&quot;&gt;this list&lt;/a&gt; as the list of languages that count as &amp;quot;pun&amp;quot; languages. You may not read this list from external sources (webpage, file, etc.). In the case of a overlap of languages (ex. &lt;code&gt;example&lt;/code&gt; contains the languages &lt;code&gt;example&lt;/code&gt; and &lt;code&gt;exam&lt;/code&gt;), count all of them (so the example would contain 2 languages). Language names are case insensitive while counting (&lt;code&gt;retina&lt;/code&gt; and &lt;code&gt;ReTinA&lt;/code&gt; are the same).&lt;/p&gt;&#xA;&lt;h3&gt;Example IO&lt;/h3&gt;&#xA;&lt;p&gt;Input (taken from the actual conversation):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;AlexA. : @Mego He may be CJamming things&#xA;ConorO'Brien : I'm jelly &amp;gt;:I&#xA;GamrCorps : @AlexA. Argh! The Aura from the eclipse burned by Retinas. Good thing it didn't deal too much damage or I would RAGE!!!&#xA;ConorO'Brien : The hexagony, I'm losing.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[&amp;quot;AlexA.&amp;quot;, 1], [&amp;quot;Conor'OBrien&amp;quot;, 2], [&amp;quot;GamrCorps&amp;quot;, 4]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Meta Note: Ill add more IO when I get back in an hour or so.&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="36670" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-09T18:47:53.517" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8690" PostTypeId="1" CreationDate="2016-03-10T17:03:04.530" Score="11" ViewCount="318" Body="&lt;p&gt;How should I tag &lt;a href=&quot;https://codegolf.stackexchange.com/q/75256/43319&quot;&gt;Good Old Suffix Vector&lt;/a&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/revisions/75256/1&quot;&gt;I initially&lt;/a&gt; tagged it &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; because it requires code that is as short and possible, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/logic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;logic&amp;#39;&quot; rel=&quot;tag&quot;&gt;logic&lt;/a&gt; because it involves constructing boolean values, and there is no &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/boolean&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;boolean&amp;#39;&quot; rel=&quot;tag&quot;&gt;boolean&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/75256/good-old-suffix-vector#comment182657_75256&quot;&gt;FryAmTheEggman commented&lt;/a&gt;: &lt;em&gt;I believe alternate scoring methods should always be tagged code-challenge.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/75256/2&quot;&gt;I added&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, acknoledging that it has a variation on the regular scoring.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/75256/3&quot;&gt;prompted Mego&lt;/a&gt; to remove &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/revisions/75256/4&quot;&gt;I rolled it back&lt;/a&gt; because it is indeed a code golf.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/revisions/75256/5&quot;&gt;Then I added&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; because each answer has self-imposed restrictions (the the more restrigtions the better the score).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/75256/6&quot;&gt;Mego removed&lt;/a&gt; all but &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, saying &lt;em&gt;Code golf is for challenges where the scoring is length of code only. Having booleans in the output does not justify using the logic tag. There is no restriction on the source code (i.e. &quot;you cannot use the letter n&quot;).&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, what is community consensus to correct tagging of my challenge?&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-05-06T01:00:10.370" Title="How should my challenge be tagged?" Tags="|discussion|support|tags|specific-question|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8691" PostTypeId="1" CreationDate="2016-03-10T17:13:21.550" Score="2" ViewCount="86" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8689/43319&quot;&gt;Some challenges&lt;/a&gt; refer to the year a language was released. If a release is dated on 31 December or 1 January, it may depend on locale.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should Github date be used as the official date (whatever locale the Github server is using)?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And if Github was not used to release the language, should it be the date where the company/organization was based at the time of release?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or maybe the Zulu-time at the moment of release?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Maybe we should go by whatever date was written (or meta-data) in the release document itself?&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.313" LastActivityDate="2016-03-10T17:52:10.780" Title="How to date languages" Tags="|discussion|policy|answers|" AnswerCount="1" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="8692" PostTypeId="2" ParentId="8690" CreationDate="2016-03-10T17:37:42.977" Score="12" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;code-golf tag wiki excerpt&lt;/a&gt; says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Code-golf is a competition to solve a particular problem in the fewest bytes of source code. If you want to score by characters instead of bytes, state this explicitly in the challenge. If source code length is not the primary scoring criterion, consider using another tag instead.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;While byte count is &lt;em&gt;a part&lt;/em&gt; of your score, it's certainly not the &lt;em&gt;primary scoring criterion&lt;/em&gt;, so I do not think the tag applies.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/tags/logic/info&quot;&gt;logic tag wiki excerpt&lt;/a&gt; says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Logic questions tend to be questions on a logical process (working through a process with a logical algorithm) or boolean logic (AND, OR, XOR, NOR, etc.).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'm not sure about this. While it is &lt;em&gt;possible&lt;/em&gt; to create the output in your challenge using Boolean logic, one can also create it as &lt;code&gt;[0]*(a-b)+[1]*b&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, the &lt;a href=&quot;https://codegolf.stackexchange.com/tags/restricted-source/info&quot;&gt;restricted-source tag wiki excerpt&lt;/a&gt; says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Imposes a restriction on the source code used to solve the challenge, for example, having no numbers in the source code.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This one definitely does not apply. A language restriction (or rather, creation date penalty) is not a restriction on the source code.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-03-10T17:37:42.977" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8693" PostTypeId="2" ParentId="8691" CreationDate="2016-03-10T17:52:10.780" Score="7" Body="&lt;h1&gt;Use UTC&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;All SE time stamps do, so it makes sense to extend this to other aspects. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using GitHub's time zone (UTC -3) seems arbitrary, since code can be hosted elsewhere.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using the hosting platform's local time seems even more arbitrary, since not the moment but the &lt;em&gt;place&lt;/em&gt; of publication could determine the date.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2016-03-10T17:52:10.780" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8694" PostTypeId="1" CreationDate="2016-03-10T23:20:53.107" Score="6" ViewCount="126" Body="&lt;p&gt;Related to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7586/flag-comments-for-deletion-when-suggestion-is-implemented&quot;&gt;Flag comments for deletion when suggestion is implemented?&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The above question specifically addresses obsolescence flagging and deletion of comments to &lt;em&gt;answers&lt;/em&gt;.  What about the same question, but directed at challenge questions instead of challenge answers?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Specifically if a comment is made on a question that requires a correction and that correction has been implemented, is it good/OK to flag that comment as obsolete?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should the commenting user be credited in the question?&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-03-11T12:10:58.010" Title="Flag question comments for deletion when suggestion is implemented?" Tags="|discussion|challenges|flags|comments|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8695" PostTypeId="2" ParentId="8694" CreationDate="2016-03-10T23:32:16.090" Score="2" Body="&lt;p&gt;Yes, I'd say go ahead and flag them. We like to see attribution for improvements on answers, such as golfing suggestions, but I don't think this carries over to questions. The comments on questions tend to be about clarification or making sure it complies with our standards. In that case I think once the suggestion has been incorporated into the question and the comment is obsolete, it's fine to flag and delete it even if the commenter was not mentioned in the question. This seems to be common practice so far.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-03-10T23:32:16.090" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8696" PostTypeId="2" ParentId="2140" CreationDate="2016-03-11T02:53:37.413" Score="1" Body="&lt;h1&gt;ACSII Cell Game&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The ASCII Cell Game is a simple game where the player has a grid (5x10) of cells (&lt;code&gt;| |&lt;/code&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;_____________________&#xA;| | | |X| | | | | | |&#xA;---------------------&#xA;| | | | | | | | | | |&#xA;---------------------&#xA;| | | | | | | |X| | |&#xA;---------------------&#xA;| | | |X| | | | | | |&#xA;---------------------&#xA;| | | | | | | |X| | |&#xA;---------------------&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Any cells marked with an &lt;code&gt;X&lt;/code&gt; have died, and any cells with an &lt;code&gt;O&lt;/code&gt; have been blocked. The object of the game is for the spread of &lt;code&gt;X&lt;/code&gt;'s to stop. The player inputs a point i.e. &lt;code&gt;1,5&lt;/code&gt; and the computer places an &lt;code&gt;O&lt;/code&gt; there. The &lt;code&gt;X&lt;/code&gt;s spread to all adjacent cells every 2 seconds.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Game Rules:&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;This  is traditional code golf with the shortest in bytes winning. I will test this on my computer.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerDisplayName="user51861" LastActivityDate="2016-03-11T02:53:37.413" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8697" PostTypeId="2" ParentId="2140" CreationDate="2016-03-11T02:57:18.557" Score="3" Body="&lt;h1&gt;Output the points of this twisting fractal&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Output the points (in order) for the following fractal of size &lt;code&gt;n&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/5A3r2.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/5A3r2.gif&quot; alt=&quot;Size 4 example&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(The above example is for &lt;code&gt;n = 4&lt;/code&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We begin with the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/67497/compute-the-binary-sierpinski-triangle-sequence&quot;&gt;Binary Sierpinski Triangle&lt;/a&gt;, which can be generated recursively, by a number of cellular automata (including Rule 90), and by Pascal's Triangle.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a refresher, Pascal's triangle is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   |  0 |  1 |  2 |  3 |  4 |  5 |  6 |  7| &#xA;---+----+----+----+----+----+----+----+---+&#xA; 0 |  1 |  0 |  0 |  0 |  0 |  0 |  0 |  0|&#xA; 1 |  1 |  1 |  0 |  0 |  0 |  0 |  0 |  0| &#xA; 2 |  1 |  2 |  1 |  0 |  0 |  0 |  0 |  0|&#xA; 3 |  1 |  3 |  3 |  1 |  0 |  0 |  0 |  0|&#xA; 4 |  1 |  4 |  6 |  4 |  1 |  0 |  0 |  0|&#xA; 5 |  1 |  5 | 10 | 10 |  5 |  1 |  0 |  0|&#xA; 6 |  1 |  6 | 15 | 20 | 15 |  6 |  1 |  0|&#xA; 7 |  1 |  7 | 21 | 35 | 35 | 21 |  7 |  1|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here rows are &lt;code&gt;i&lt;/code&gt;, columns are &lt;code&gt;j&lt;/code&gt;, and the values are &lt;code&gt;i choose j&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using Pascal's triangle, we replace each value with its remainder &lt;code&gt;mod 2&lt;/code&gt; to get:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   |  0 |  1 |  2 |  3 |  4 |  5 |  6 |  7| &#xA;---+----+----+----+----+----+----+----+---+&#xA; 0 |  1 |  0 |  0 |  0 |  0 |  0 |  0 |  0|     O        &#xA; 1 |  1 |  1 |  0 |  0 |  0 |  0 |  0 |  0|     OO       &#xA; 2 |  1 |  0 |  1 |  0 |  0 |  0 |  0 |  0|     O O      &#xA; 3 |  1 |  1 |  1 |  1 |  0 |  0 |  0 |  0|     OOOO     &#xA; 4 |  1 |  0 |  0 |  0 |  1 |  0 |  0 |  0|     O   O    &#xA; 5 |  1 |  1 |  0 |  0 |  1 |  1 |  0 |  0|     OO  OO   &#xA; 6 |  1 |  0 |  1 |  0 |  1 |  0 |  1 |  0|     O O O O  &#xA; 7 |  1 |  1 |  1 |  1 |  1 |  1 |  1 |  1|     OOOOOOOO &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;With the result &quot;plotted&quot; to the right, the &lt;code&gt;n = 1&lt;/code&gt; iteration of the Sierpinski Triangle.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, to keep the &quot;centers&quot; well defined, we take the center of each triangle to be its NE corner like so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;'              ^&#xA;''             |&#xA;'*'            N &#xA;''''       &amp;lt;--E W--&amp;gt;&#xA;'  *'          S&#xA;''  ''         |&#xA;'*' '*'        v&#xA;''''''''  &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here is pseudocode to generate the fractal:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;fractal(n):&#xA;    position = nth center&#xA;    while SE possible:&#xA;        go SE&#xA;        mark position&#xA;    while not all full:&#xA;        if current level not full:&#xA;            rotate counterclockwise on current level&#xA;            mark position&#xA;        else:&#xA;            go NW until reach non-full level&#xA;            rotate counterclockwise on current level&#xA;            while SE possible:&#xA;                mark position&#xA;                go SE&#xA;    return marked positions&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here's what that looks like for &lt;code&gt;n = 2&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; '                              &#xA; ' '                            &#xA; ' 12'                          &#xA; ' ' ' '                        &#xA; '      9'                      &#xA; ' '     ' '                    &#xA; ' 10'   ' 11'                  &#xA; ' ' ' ' ' ' ' '                &#xA; '               '              &#xA; ' '             ' '            &#xA; '  4'           '  8'          &#xA; ' ' ' '         ' ' ' '        &#xA; '      1'       '      5'      &#xA; ' '     ' '     ' '     ' '    &#xA; '  2'   '  3'   '  6'   '  7'  &#xA; ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' '&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Giving the following points marked (in order):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[3, 12], [1, 14], [5, 14], [1, 10], [11, 12], [9, 14], [13, 14], [9, 10], [3, 4], [1, 6], [5,6], [1,2]] &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Entry may be either a function or full program.&lt;/li&gt;&#xA;&lt;li&gt;Input is a non-negative integer.&lt;/li&gt;&#xA;&lt;li&gt;Output is the (properly ordered) list of points for the fractal above.&lt;/li&gt;&#xA;&lt;li&gt;You may use something other than a list to output the results if it allows the easy reading of the points, in order. For example, newline separated is fine.&lt;/li&gt;&#xA;&lt;li&gt;Output must contain exactly &lt;code&gt;(3^n - 3)/2&lt;/code&gt; points.&lt;/li&gt;&#xA;&lt;li&gt;This is code golf so shortest wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is everything well defined?&lt;/li&gt;&#xA;&lt;li&gt;Should I reformat the ASCII triangles? Or even replace everything with images?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Test cases if anyone is interested or I post this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a challenge that I enjoyed solving so I hope I can smooth out the corners relatively quickly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fractal&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fractal&amp;#39;&quot; rel=&quot;tag&quot;&gt;fractal&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="48962" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:26.847" LastActivityDate="2016-03-11T03:05:50.733" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8698" PostTypeId="2" ParentId="2140" CreationDate="2016-03-11T07:14:20.713" Score="1" Body="&lt;h1&gt;How fast can I Flood-It?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;There's a one-player game called &lt;a href=&quot;http://unixpapa.com/floodit/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Flood-It&lt;/a&gt;, in which the player must flood the whole board with one color within a certain number of moves.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The board is a two-dimensional square grid of size &lt;em&gt;&lt;strong&gt;n&lt;/strong&gt;&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;At the start, each square in the grid is one of &lt;em&gt;&lt;strong&gt;k&lt;/strong&gt;&lt;/em&gt; colors.&lt;/li&gt;&#xA;&lt;li&gt;A move consists of selecting a color, and doing a 4-connected flood fill with that color starting in the top left corner.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For example, selecting &lt;code&gt;R&lt;/code&gt;ed on this size-3 board with 4 colors:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;GGE&#xA;RGB&#xA;RDE&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;causes the board to change to this—now the two already-red squares are connected to the top left:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;RRE&#xA;RRB&#xA;RDE&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;After the further moves &lt;code&gt;DBE&lt;/code&gt;, all squares are colored &lt;code&gt;E&lt;/code&gt;merald, and the game has been won in an optimal 4 moves.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given two integers &lt;em&gt;&lt;strong&gt;n&lt;/strong&gt;&lt;/em&gt; and &lt;em&gt;&lt;strong&gt;k&lt;/strong&gt;&lt;/em&gt;, output the number of moves required to win the game of Flood-It with those parameters, in the worst case over all possible arrangements of colors.&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-11-17T20:41:45.140" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="8699" PostTypeId="2" ParentId="8694" CreationDate="2016-03-11T12:10:58.010" Score="8" Body="&lt;p&gt;Yes, but don't be hasty. Even after the author edits the question in response, the comments are still valuable in certain scenarios:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The question was closed as unclear (or is headed that way). In that case, as someone who uses the reopen review queue I want to see the comments because they help me understand why the question was opened and to form my own assessment as to whether it has been sufficiently clarified. I've seen cases of questions which were closed as unclear and then reopened by five votes when there were issues raised in the comments which I didn't consider to be clarified at all.&lt;/li&gt;&#xA;&lt;li&gt;If I made the request for clarification, I can't always remember exactly what I said. Being able to reread it helps me understand the response and decide whether a follow-up comment is needed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="194" LastActivityDate="2016-03-11T12:10:58.010" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8700" PostTypeId="1" CreationDate="2016-03-11T13:59:17.477" Score="0" ViewCount="50" Body="&lt;p&gt;We've had a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1031/should-bonuses-be-allowed-for-code-golf-questions&quot;&gt;discussion&lt;/a&gt; on whether or not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges with bonuses should be allowed. This is a related, but different topic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Currently, challenges that have non-standard objective scoring methods (a single method not covered by one of the tags &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/908/45941&quot;&gt;listed here&lt;/a&gt;, or a combination of standard and/or non-standard methods) fall under the category of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;. There is one glaring exception: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; with bonuses is still &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. Should we recategorize these to fall under the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; category?&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-03-11T13:59:17.477" Title="Should [code-golf] challenges with bonuses be tagged [code-challenge] instead?" Tags="|discussion|code-golf|tags|" AnswerCount="0" CommentCount="2" ClosedDate="2016-03-11T14:05:53.683" ContentLicense="CC BY-SA 3.0" />
  <row Id="8702" PostTypeId="2" ParentId="2140" CreationDate="2016-03-11T20:45:24.210" Score="0" Body="&lt;h1&gt;Parse default arguments&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Many languages have the concept of default/variable arguments. It basically means you can have a function that when given too few arguments, will fill in the missing arguments with specified values. For example, you can do the following in Python:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;WARNING: THE BELOW EXAMPLE CODE IS &lt;em&gt;NOT&lt;/em&gt; GOLFED. PROCEED AT YOUR OWN PERIL&lt;/strong&gt;&lt;br&gt;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def f(x=&quot;default string&quot;):&#xA;  print x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This means that calling &lt;code&gt;f(&quot;foo&quot;)&lt;/code&gt; will print &quot;foo&quot;, but calling &lt;code&gt;f()&lt;/code&gt; will print &quot;default string&quot;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Python also has a mechanism for handling too many arguments (&quot;rest&quot;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def f(*stuff):&#xA;  for thing in stuff:&#xA;    print thing&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You can of course also mix these:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def f(x, y=&quot;default string&quot;, *z):&#xA;  ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, python (pre-3.5), being python, yells at you when you put a default argument before a non-default argument. That's silly. You guys are smart; you should be able to make that work.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program, function, or whatever that when given a string representing the arguments and values passed to them, will print each argument's resulting value.&#xA;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If there are too few arguments, the mandatory arguments should be applied first, then the rest of the values into the default arguments (left-to-right). &lt;/li&gt;&#xA;&lt;li&gt;If there are too many, apply all values to arguments, and the remaining into the &quot;rest&quot; argument.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I'm even confusing myself, just look at the test cases&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a string, array, or other reasonable format representing the parameter declaration&lt;/li&gt;&#xA;&lt;li&gt;a string, array, or other reasonable format representing the values passed to the arguments&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the resulting values of all the arguments, in a reasonable format.&#xA;&lt;br&gt;&lt;em&gt;note: &quot;reasonable format&quot; will be defined later&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Test cases will be in the following format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{arg string}&#xA;{value string}&#xA;=&amp;gt; {output}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So, here they are&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x, y, z&#xA;10, 2, 4&#xA;=&amp;gt; x:10, y:2, z:4&#xA;&#xA;x=2, y&#xA;5&#xA;=&amp;gt; x:2, y:5&#xA;&#xA;a, b=&quot;a&quot;, c, *d&#xA;3, 4&#xA;=&amp;gt; a:3, b:&quot;a&quot;, c:4, d:[]&#xA;&#xA;foo, bar=2, *baz&#xA;9, 3, &quot;kqly&quot;, 5&#xA;=&amp;gt; foo:9, bar:3, baz:[&quot;kqly&quot;,5]&#xA;&#xA;*x, y&#xA;&quot;ha&quot;, 2, 3&#xA;=&amp;gt; x:[&quot;ha&quot;,2], y:3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="41042" LastEditorUserId="41042" LastEditDate="2016-03-14T07:10:11.937" LastActivityDate="2016-03-14T07:10:11.937" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8704" PostTypeId="5" CreationDate="2016-03-13T02:01:44.190" Score="0" Body="&lt;p&gt;&lt;strong&gt;Programming Puzzles &amp;amp; Code Golf&lt;/strong&gt; (formerly Code Golf) entered beta on January 27, 2011. On, February 3, 2011, Programming Puzzles &amp;amp; Code Golf entered the &lt;em&gt;Public Beta&lt;/em&gt; phase and remained as so, until graduation on February 23, 2016&lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="40695" LastEditDate="2016-03-13T02:01:44.190" LastActivityDate="2016-03-13T02:01:44.190" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8705" PostTypeId="4" CreationDate="2016-03-13T02:01:44.190" Score="0" Body="This tag was used for discussions directly related to the progression of the beta." OwnerUserId="40695" LastEditorUserId="40695" LastEditDate="2016-03-13T02:01:44.190" LastActivityDate="2016-03-13T02:01:44.190" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8706" PostTypeId="1" CreationDate="2016-03-13T04:04:16.263" Score="5" ViewCount="485" Body="&lt;p&gt;&lt;a href=&quot;https://unix.meta.stackexchange.com/questions/3914/whose-choice-is-accepting-an-answer&quot;&gt;In the past, I've made noise about what the accepted answer is and whose choice it is&lt;/a&gt;, because I feel it's important people accept the answer they wanna accept.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think that linked ideology makes sense for Q&amp;amp;A, which &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8354/46231&quot;&gt;we aren't&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The current &lt;a href=&quot;https://codegolf.stackexchange.com/help/accepted-answer&quot;&gt;help/accepted-answer&lt;/a&gt; page is, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8354/46231&quot;&gt;like the rest of the help center, &lt;em&gt;sorely&lt;/em&gt; irrelevant for PPCG's style; its current text is exactly that of every other site in the SE network.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h3&gt;What does it mean when an answer is &quot;accepted&quot;?&lt;/h3&gt;&#xA;  &#xA;  &lt;p&gt;When a user receives a good answer to his or her question, that user&#xA;  has the option to &quot;accept&quot; an answer. Acceptance is indicated by a&#xA;  colored checkmark next to the answer that has been accepted by the&#xA;  original author of the question.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;Accepting an answer is not meant to be a definitive and final&#xA;  statement indicating that the question has now been answered&#xA;  perfectly. It simply means that the author received an answer that&#xA;  worked for him or her personally&lt;/strong&gt;, but not every user comes back to&#xA;  accept an answer, and of those who do, they may not change the&#xA;  accepted answer if a newer, better answer comes along later.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Often, accepting an answer corresponds to reputation gains.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;If you accept:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;someone else's answer: You gain +2 reputation and the author of the accepted answer earns +15 reputation.&lt;/li&gt;&#xA;  &lt;li&gt;your own answer: No reputation is awarded, and the answer does not float to the top of the list. You must wait 48 hours to accept your&#xA;  own answer.&lt;/li&gt;&#xA;  &lt;li&gt;a community-wiki answer: No reputation is awarded.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;emphasis mine, obviously.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;...Well, no, actually, or at least that's not the community's consensus, or at the very least a ripply reflection of reality.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In &lt;em&gt;practice&lt;/em&gt;, in the general case, the accepted answer on a given challenge / question / post / thingy is almost always (thankfully) the one which &quot;wins&quot; the challenge as written.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In &lt;em&gt;theory&lt;/em&gt;, however, it's entirely up to the asker to reward the +15 however and wherever they like, without practising any discretion. The asker may accept &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a wrong answer, &lt;/li&gt;&#xA;&lt;li&gt;the longest answer (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;) / the slowest answer (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;) / an answer with negative score (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;), &lt;/li&gt;&#xA;&lt;li&gt;an answer which doesn't work, &lt;/li&gt;&#xA;&lt;li&gt;a Not An Answer answer (spam, not-an-attempt-to-answer-the-question, etc) &lt;/li&gt;&#xA;&lt;li&gt;an answer written by an account of their own, (thankfully we don't get much sockpuppetry around these parts)&lt;/li&gt;&#xA;&lt;li&gt;literally any answer they want (kinda the idea of SE)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In lieu of holding some poor SE dev at codepoint to rewrite the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8354/46231&quot;&gt;help/accepted&lt;/a&gt; page &lt;em&gt;right now&lt;/em&gt;, and to put my mind at ease:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Whose choice is accepting an answer, and what does it represent?&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moreover, what happens if the asker &lt;strong&gt;deliberately&lt;/strong&gt;&lt;sup&gt;1&lt;/sup&gt; accepts a non-winning answer? It's not like anyone else &lt;em&gt;can&lt;/em&gt; choose, and it's not like we &lt;em&gt;can&lt;/em&gt; reprimand the asker for accepting the &quot;wrong&quot; answer.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; not &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5293/should-we-flag-questions-with-incorrectly-accepted-answers-for-moderator-attenti?s=4|0.8314&quot;&gt;accidentally-improperly-accepted answers&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-04-25T12:25:48.923" Title="What's the &quot;accepted answer&quot;?" Tags="|discussion|support|accepted-answer|" AnswerCount="4" CommentCount="7" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8707" PostTypeId="2" ParentId="8706" CreationDate="2016-03-13T04:04:16.263" Score="-3" Body="&lt;h2&gt;Accepting is the asker's choice.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Well, why wouldn't it be. As far as &lt;em&gt;I&lt;/em&gt; can tell, the &lt;em&gt;vast&lt;/em&gt; majority of users play by the rules, and accept the shortest / fastest / most-upvoted / &lt;strong&gt;objectively winning&lt;/strong&gt; answer of their own volition. The help centre should (obviously) be rewritten to reflect this. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The acception is representative of the answer which most correctly implements the goals / objectives required by the challenge's objective winning criterion.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The accepted answer is the one which &quot;wins&quot;, where &quot;wins&quot; is clearly defined by the question's tags' implications of objective winning criterion. (Also why we don't like popcon.)&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="40695" LastEditDate="2016-03-13T04:09:58.383" LastActivityDate="2016-03-13T04:09:58.383" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8708" PostTypeId="2" ParentId="8706" CreationDate="2016-03-13T04:30:26.660" Score="1" Body="&lt;h1&gt;The asker chooses the top answer&lt;/h1&gt;&#xA;&lt;p&gt;We like to think that challenges are completely objective.  &lt;strong&gt;Unfortunately, many of our challenges &lt;em&gt;require&lt;/em&gt; human judgement&lt;/strong&gt;.  Common cases of broad areas include: Defining a &amp;quot;built-in&amp;quot; or &amp;quot;hardcoding&amp;quot;, acceptable input/output formats, and whether or not a program even completes the task (passing all the test cases does mean it doesn't have bugs).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Therefore, the OP should &lt;em&gt;judge&lt;/em&gt; the answers that meet the requirements, and then accept the answer with the best score (&lt;em&gt;which is not a matter of judgement&lt;/em&gt;)&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-13T17:23:55.160" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8709" PostTypeId="2" ParentId="8706" CreationDate="2016-03-13T12:30:21.320" Score="5" Body="&lt;p&gt;You shouldn't feel obligated to accept the overall shortest submission in code golf.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The shortest submission is often not the best-golfed one, but the one written in the most optimized golfing language. C will always be longer than CJam, no matter how golfed the C code. Code golf is nicer as a competition within each language, and giving the check mark to what is almost always a golfing language makes other golfers feel secondary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You're free to accept what you want, but I'd suggest picking an answer you think showcases the best golfing. It's hard though to judge golfing in languages you don't know well, so simply not accepting might be your best bet.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2016-03-13T12:30:21.320" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="8712" PostTypeId="2" ParentId="8706" CreationDate="2016-03-13T17:21:05.487" Score="20" Body="&lt;h1&gt;The accepted answer is the answer that wins the challenge&lt;/h1&gt;&#xA;&lt;p&gt;As defined by the objective scoring criterion the challenge writer gave the challenge when it was created.&lt;/p&gt;&#xA;&lt;p&gt;That's it really.&lt;/p&gt;&#xA;&lt;p&gt;If there are unforeseen circumstances that cause ambiguity on what the winning answer is (say a challenge is tied with no tiebreaker specified) then the challenge writer should use his best judgement to fairly accept a winner, sticking as close as possible to his original scoring rules.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-13T17:21:05.487" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8714" PostTypeId="2" ParentId="286" CreationDate="2016-03-14T23:09:51.937" Score="27" Body="&lt;p&gt;It's 2016, nearly 5 years later, and the golfing-language situation has grown more extreme.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Golfing languages have grown in number and in power. Users have created many general-purpose golfing languages with expressive syntax and a wide array of built ins. On some challenges, a reader who is a typical coder needs to scroll down 5 answers before they see a language they have heard of and code that doesn't look like a jumble of random letters and symbols.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's natural that people want to probe the extremes of golfing in search of the absolute shortest code. It's exciting to see how far tools we make can take us. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yet, I think the spread of golfing languages has been helped by some unfair advantages and unintended incentives.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Answers in golfing languages are written and posted quickly because of their powerful feature sets. This makes them rise to the top and stay there because of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2053/20260&quot;&gt;FGITW&lt;/a&gt; effect and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7150/20260&quot;&gt;HNQ&lt;/a&gt; attention.&lt;/li&gt;&#xA;&lt;li&gt;People like seeing small byte counts. &quot;8 bytes&quot; certainly looks more impressive that &quot;73 bytes&quot;, even when those 73 bytes are clever and painstakingly golfed C code compared to 8 bytes of obvious &quot;chain-the-built-ins&quot; in a golfing language. Accepting the overall shortest answers glue a golfing-language solution to the top spot and gives it additional rep and recognition.&lt;/li&gt;&#xA;&lt;li&gt;Using a golfing language lets the answerer reap rewards for the language creator's efforts and golfing skills. When people upvote a golfing language solution, it is often for the impressiveness of the language to allow a short solution, not the solution itself. Yet, it is the answerer that gets the rep and attention, which gives them an incentive to use the golfing language.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I don't think users of golfing languages are purposely trying to exploit these advantages, but that these incentives have given golfing languages a big push. And, that push has promoted golfing languages to a central position in the site that they should not hold.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-03-15T02:12:37.160" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8716" PostTypeId="1" CreationDate="2016-03-15T03:53:59.403" Score="0" ViewCount="159" Body="&lt;p&gt;With people using such cryptic languages as Jelly, where is the line? can I write my own compiler that solves the problem in a more wordy language when I type the number '0'? I can see that this is immoral and ruins the point of code golf, but how do you decide which languages are legal and which ones aren't?&lt;/p&gt;&#xA;" OwnerDisplayName="user52156" LastActivityDate="2016-03-15T04:23:15.453" Title="Is it cheating to invent a language for code golf?" Tags="|discussion|code-golf|" AnswerCount="0" CommentCount="0" ClosedDate="2016-03-15T04:08:24.100" ContentLicense="CC BY-SA 3.0" />
  <row Id="8718" PostTypeId="2" ParentId="2140" CreationDate="2016-03-15T05:22:03.800" Score="0" Body="&lt;h1&gt;Reverse Engineering&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/reverse-engineering&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;reverse-engineering&amp;#39;&quot; rel=&quot;tag&quot;&gt;reverse-engineering&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Cops&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You must write a program or function in as few bytes that takes in an integer or a set of integers, performs a defined task on them (for example, finds the prime factorisation), and gives an integer or a set of integers as output. The number of integers in input and output will be pre-defined, so will be the task. You should provide appropriate limits for the variable sizes to be supported (1 bit, 1 byte, 2 byte etc.) and any additional conditions (0 not supported, N&amp;lt;100, M&gt;N, etc.), and your program should work (atleast in theory, does not need to be time or memory efficient) for all possible inputs allowed by you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must also submit a reference code (ungolfed) in any language that performs the exact same process in reverse. Meaning, when given the output of the first program, it should be able to deduce the input given. This should be possible (atleast in theory) for all inputs accepted by you in the first program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, suppose the first program takes in two 1-byte prime numbers &lt;code&gt;m&lt;/code&gt; and &lt;code&gt;n&lt;/code&gt;, and outputs all prime numbers between the two of them. Since the number of integers in input must be pre-defined (and not dependent on input), we state an additional rule that there will be a total of 60 integers in output, and if there aren't that many prime numbers, then zeros will be outputed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input to program 1: &lt;code&gt;23 41&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output from program 1: &lt;code&gt;29 31 37 39 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now the second program will perform the same process in reverse.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input to program 2: &lt;code&gt;29 31 37 39 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output from program 2: &lt;code&gt;23 41&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Robbers will attempt to golf the second program as much as possible. Your score is given by the ratio of bytes in the best golfed code by a robber and the bytes in your code. So if your code is 23 bytes, and a robber writes the code for the reverse process (in any language) in 102 bytes, then your score is 102/23. Your answer is deemed ineligible for scoring if it has negative score. Highest score wins.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Robbers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You must pick the second program submitted by a cop and attempt to golf it (in any language) as much as possible. You may submit a program or a function. You may use a different algorithm if you choose to, but the results must be exactly the same.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;????&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Is it ok to combine code-golf with cops-and-robbers like I have done?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What should the scoring criterion be for the robbers?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is my challenge too generic (because it accepts way too many kinds of tasks)? If yes, what can I do about it?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Any further questions or suggestions are welcome. If you are sure of a suggestion being mandatory, you may make the edit yourself.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Are the tags ok?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="40929" LastEditorUserId="40929" LastEditDate="2016-03-16T07:43:13.370" LastActivityDate="2016-03-16T07:43:13.370" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8719" PostTypeId="2" ParentId="2140" CreationDate="2016-03-15T20:31:22.623" Score="0" Body="&lt;h1&gt;Is this number random?: Round 2&lt;/h1&gt;&#xA;&lt;p&gt;The same as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/74835/is-this-number-random&quot;&gt;Is this number random?&lt;/a&gt;, but with 256 or 512 numbers in each category instead of 64; thereby making a modulo-chain infeasible to find. I hope this will encourage more interesting strategies.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Is this enough of a difference from the existing question to merit a new one? Are there any other flaws with the distribution? Could I change this to require splitting into 4 or so buckets instead of 2?&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-15T20:31:22.623" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8720" PostTypeId="2" ParentId="2140" CreationDate="2016-03-15T20:50:07.660" Score="2" Body="&lt;h1&gt;Diagonals of an Array&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;strong&gt;&lt;em&gt;k&lt;/em&gt;&lt;/strong&gt;-th diagonal of a two-dimensional array is a list of all elements in positions &lt;code&gt;(a,a+k)&lt;/code&gt;. Your task is to output all of the diagonals.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the diagonals of&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[3,1,4,1],[5,9,2,6],[5,3,5,8]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[1],[4,6],[1,2,8],[3,9,5],[5,3],[5]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which can be visualized thusly:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;k -2-1 0 1 2 3&#xA;    \ \ \ \ \ \&#xA;     \ \ 3 1 4 1&#xA;      \ \ \ \ \&#xA;       \ 5 9 2 6&#xA;        \ \ \ \&#xA;         5 3 5 8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A rectangular nested array or 2D array of positive integers, which will be nonempty.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Its diagonals in any consistent order.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[3,1,4,1],[5,9,2,6],[5,3,5,8]]&#xA;[[1],[4,6],[1,2,8],[3,9,5],[5,3],[5]]&#xA;&#xA;[[42]]&#xA;[[42]]&#xA;&#xA;[[57,72,15,66,49,01,53,28,60,60,65,12,09,00,82]]&#xA;[[57],[72],[15],[66],[49],[1],[53],[28],[60],[60],[65],[12],[9],[0],[82]]&#xA;&#xA;[[57],[72],[15],[66],[49],[1],[53],[28],[60],[60],[65],[12],[9],[0],[82]]&#xA;[[57],[72],[15],[66],[49],[1],[53],[28],[60],[60],[65],[12],[9],[0],[82]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Maybe a second question about n-dimensional arrays?&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="39328" LastEditDate="2016-04-06T18:32:42.297" LastActivityDate="2016-04-06T18:32:42.297" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8722" PostTypeId="2" ParentId="8037" CreationDate="2016-03-15T22:01:25.103" Score="0" Body="&lt;h1&gt;No bytes for Startup.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Starting up minecraft is like starting up/installing Java: it's assumed you do it. Activating Java from the command line is like pressing a button in minecraft: they both invoke a program. If you could somehow modify the NBT data of the button and were then able to use that data, &lt;em&gt;that&lt;/em&gt; would be command line arguments, like Java's.&lt;/p&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2016-03-15T22:01:25.103" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8723" PostTypeId="2" ParentId="8037" CreationDate="2016-03-15T22:11:50.827" Score="3" Body="&lt;h1&gt;No, they shouldn't count. But input should.&lt;/h1&gt;&#xA;&lt;h3&gt;There are 2 cases here: Input as in input, and input as in turning it on.&lt;/h3&gt;&#xA;&lt;p&gt;Something like a redstone clock, don't count the button used to start it.  It isn't actually part of it, it is just used in building it.&lt;/p&gt;&#xA;&lt;p&gt;If your 'program' is tall and requires a ladder/pillar to get up, you don't count the tower.  It isn't part of it.  But you did build it as part.&lt;/p&gt;&#xA;&lt;p&gt;Button/levers/plates as forms of input, like a door opening, should count.  So if you build a truth machine and the lever/button/plate is the input collector, that should count.&lt;/p&gt;&#xA;&lt;p&gt;It is a functional part, even if it just relays power.&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-15T22:11:50.827" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8729" PostTypeId="1" CreationDate="2016-03-17T16:46:15.107" Score="2" ViewCount="256" Body="&lt;p&gt;Currently, Jelly has a &lt;a href=&quot;https://github.com/DennisMitchell/jelly/blob/master/docs/code-page.md&quot; rel=&quot;nofollow&quot;&gt;code page&lt;/a&gt; that maps Unicode characters to bytes to avoid unprintables found in ASCII.  &lt;strong&gt;Many of the characters used are multiple bytes (in UTF-8), but we score it as a single byte&lt;/strong&gt; (as it represents a single byte).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, lets assume I write another &quot;code page&quot; that takes common language features in Python (or any other language), and maps them to shorter byte values.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, I could map &lt;code&gt;print&lt;/code&gt; to &lt;code&gt;0x00&lt;/code&gt;, meaning that every print statement is now 1 byte.  I &lt;em&gt;do&lt;/em&gt; make the assumption that my python program doesn't have the null character in it, but I'm OK with that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you feel that the above is invalid because Python doesn't support my custom code page, then what if I make a custom language that is identical to Python, except that it uses my custom code page?  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;TL;DR: If I write a general purpose encoding for a language, can I still answer in the original language, and score it based on the encoding?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2016-03-17T20:32:12.833" LastActivityDate="2016-03-17T20:32:12.833" Title="How far can we take encodings?" Tags="|discussion|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8730" PostTypeId="2" ParentId="8729" CreationDate="2016-03-17T17:20:36.113" Score="12" Body="&lt;h1&gt;No, it's not the same language.&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;...&lt;strong&gt;If I write a general purpose encoding for a language, can I still answer in the original language, and score it based on the encoding?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;No. You've made an essentially different language/dialect, adding a new command &lt;code&gt;\x00&lt;/code&gt; which prints something, removes (presumably) &lt;code&gt;print&lt;/code&gt;, and is otherwise identical to Python. It's not Python, is it? I argue it's not. You can't answer therefore in &lt;em&gt;Python&lt;/em&gt;, but, rather, whatever your dialect may be called.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You still can count the bytes normally, but, as has been said, it's just not Python.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(As for the title of your question, we can take encodings as far as is possible. &lt;em&gt;Use ALL the bytes!&lt;/em&gt;)&lt;/p&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2016-03-17T17:20:36.113" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="8731" PostTypeId="2" ParentId="2447" CreationDate="2016-03-17T21:43:15.837" Score="-47" Body="&lt;h1&gt;Programs may take input by assuming it is stored in predefined variables.&lt;/h1&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-17T21:43:15.837" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8736" PostTypeId="1" CreationDate="2016-03-19T12:00:13.507" Score="14" ViewCount="365" Body="&lt;p&gt;I've posted a few challenges before in PPCG, and, judging by the minimal view counts I've been getting (especially recently), I'd say I've been posting them at the wrong time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there an objectively identifiable &quot;best time&quot; to post challenges in order to get the most people to see it (and therefore not let it slip into the void of unanswered challenges)?&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="44713" LastEditDate="2016-03-19T12:28:40.863" LastActivityDate="2016-03-21T18:55:06.330" Title="When is the best time to post a challenge for optimal views?" Tags="|discussion|asking-questions|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8737" PostTypeId="1" CreationDate="2016-03-19T15:36:58.440" Score="11" ViewCount="605" Body="&lt;p&gt;On a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8589/44713&quot;&gt;recent question&lt;/a&gt;, the following was brought up by @Sp3000:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;In fact, I'm almost starting to wonder what a &quot;function&quot; is, since it seems like every language with goto could define a &quot;function&quot; the same way...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;What are the most basic restrictions for what can be defined as a &quot;function&quot;, an allowed answer type, that separates it from a &quot;snippet&quot;, which is not allowed?&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.423" LastActivityDate="2016-06-14T05:53:13.057" Title="What even is a &quot;function&quot; by our standards?" Tags="|discussion|policy|answers|" AnswerCount="4" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8738" PostTypeId="2" ParentId="8737" CreationDate="2016-03-19T15:43:58.443" Score="7" Body="&lt;h1&gt;A function is an independent routine which can perform I/O in some form.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It is a section of code, which can be directly inserted into  a program with no modification, and should be able to be assigned/named/referred to in some way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It should be able to run independent of surrounding code. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It should be able to take input/output in some form.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The function should be able to perform a successive chain of operations. Meaning these &quot;functions&quot; should be able to &lt;em&gt;somehow&lt;/em&gt; be used in a program to fulfill the definition of one. A function &lt;strong&gt;only&lt;/strong&gt; capable of doing a single binary operation wouldn't be valid &lt;em&gt;unless&lt;/em&gt;, recursion or some other way for a successive operation to be performed exists&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A functions call should not require calling any other functions or code besides defining the input. A function should receive the input in a format that's is compliant with the challenges rules&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A function should have a way for he input to be directly passed to it (it doesn't have to take input in that way, just the functionality should be available)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;That said, if it's blatantly obvious it's not a function, it's not a function.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Also as @Mego said:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Python &lt;strong&gt;has functions. Anything else is not a function&lt;/strong&gt;. The further explanations in the answer are intended to be used for languages that don't have a cut-and-dry definition of a function&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;We know what a function is. &lt;strong&gt;It's futile calling what's not a function a function&lt;/strong&gt;, it's very difficult to come up with a perfectly objective set of rules describing what a function is, but we all know what a function &lt;em&gt;is&lt;/em&gt;, and what it is &lt;em&gt;not&lt;/em&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;If the language formally defines it to be a function/method/lambda, it's a function.&lt;/strong&gt; this doesn't mean an esolang creator abusing their ability to define a function, is exempt from rules and other restrictions applied upon programs and functions. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;In your question you asked if &lt;code&gt;goto&lt;/code&gt;s could be considered functions. IIRC, they can't have I/O passed directly through them, so no.&lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="40695" LastEditDate="2016-06-14T05:53:13.057" LastActivityDate="2016-06-14T05:53:13.057" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="8739" PostTypeId="2" ParentId="8736" CreationDate="2016-03-19T20:21:11.500" Score="32" Body="&lt;h2&gt;When is best for views?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As it turns out, it doesn't matter all that much. Consider this plot:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/OPgP0.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/OPgP0.png&quot; alt=&quot;views_plot&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The mean number of views is slightly higher on Mondays and Wednesdays but things are pretty consistent overall across the whole week.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What about time of day?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/RDztl.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/RDztl.png&quot; alt=&quot;hour&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also doesn't seem to matter.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;This is good news!&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We need quality content &lt;em&gt;everyday&lt;/em&gt;, &lt;em&gt;all the time&lt;/em&gt;, not just on certain days. The fact that we have fairly consistent views is a good thing.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;When should you post?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Whenever you want, but note that targeting a specific day or time likely won't help.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;For the curious&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Stack Exchange Data Explorer query:&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;select Id,&#xA;    ViewCount,&#xA;    datename(weekday, CreationDate) as DayOfWeek,&#xA;    datepart(hour, CreationDate) as UTCHour&#xA;from Posts&#xA;where PostTypeId = 1&#xA;    and DeletionDate is null&#xA;    and CommunityOwnedDate is null&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;R code to produce the plots:&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;library(&quot;ggplot2&quot;)&#xA;&#xA;posts &amp;lt;- read.csv(&quot;QueryResults.csv&quot;, header = TRUE, as.is = TRUE)&#xA;&#xA;posts$DayOfWeek &amp;lt;- factor(posts$DayOfWeek,&#xA;                          levels = c(&quot;Sunday&quot;, &quot;Monday&quot;, &quot;Tuesday&quot;,&#xA;                                     &quot;Wednesday&quot;, &quot;Thursday&quot;, &quot;Friday&quot;,&#xA;                                     &quot;Saturday&quot;))&#xA;&#xA;ggplot(posts, aes(x = DayOfWeek, y = log(ViewCount))) +&#xA;    geom_boxplot() +&#xA;    ggtitle(&quot;Log Number of Question Views by Day Posted&quot;) +&#xA;    xlab(&quot;Day of the Week&quot;) +&#xA;    theme(text = element_text(size = 12))&#xA;&#xA;ggplot(posts, aes(x = factor(UTCHour), y = log(ViewCount))) +&#xA;    geom_boxplot() +&#xA;    ggtitle(&quot;Log Number of Question Views by Hour Posted&quot;) +&#xA;    xlab(&quot;Hour Posted (UTC)&quot;) +&#xA;    theme(text = element_text(size = 12))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-03-19T20:21:11.500" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8740" PostTypeId="2" ParentId="2140" CreationDate="2016-03-19T21:32:35.690" Score="1" Body="&lt;h1&gt;Infinite &lt;a href=&quot;https://esolangs.org/wiki/Hexagony&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hexagony&lt;/a&gt; Loops&lt;/h1&gt;&#xA;&lt;p&gt;In this challenge, we will be determining whether or not a restricted-source hexagony program terminates or loops forever.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A hexagony program that contains only the&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&amp;quot;Flow Control&amp;quot; characters: &lt;strong&gt;/ | _ | &amp;gt; &amp;lt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;the no-op character: &lt;strong&gt;.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;the program terminate character: &lt;strong&gt;@&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Note that since every memory edge is zero for the duration of every program, &lt;strong&gt;there are no conditionals&lt;/strong&gt; in this restricted source version of the language.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The side length of the hexagon may be any natural number.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may assume that inputs are padded with no-op characters to fit the hexagon shape exactly (or you may strip all trailing no-ops as long as you do not change the hexagon size)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may take the input in any reasonable fashion.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;DESCRIPTIONS OF WHAT EACH OF THE FLOW CONTROL CHARACTERS DO WILL BE COMING SOON. IN THE MEANTIME, LOOK AT THE &lt;a href=&quot;https://esolangs.org/wiki/Hexagony&quot; rel=&quot;nofollow noreferrer&quot;&gt;WIKI PAGE&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A truthy value if the program terminates. A falsy value otherwise.&lt;/p&gt;&#xA;&lt;p&gt;A program &amp;quot;terminates&amp;quot; if the instruction pointer reaches a '@' character.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test cases&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Coming soon.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="45459" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-19T21:32:35.690" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8741" PostTypeId="2" ParentId="8736" CreationDate="2016-03-19T21:41:15.343" Score="14" Body="&lt;h1&gt;Fundamentally, there is none&lt;/h1&gt;&#xA;&lt;p&gt;I don't have specific data but I can say from experience that a question posted on &lt;em&gt;any&lt;/em&gt; day at &lt;em&gt;any&lt;/em&gt; hour &lt;em&gt;can&lt;/em&gt; become popular, &lt;em&gt;can&lt;/em&gt; become a Hot Network Question, you just might have to wait a bit.&lt;/p&gt;&#xA;&lt;p&gt;I've found (or at least it seems) that there are far fewer answers posted when it is nighttime in America, but posting then is fine since within 12 hours most everyone in those time zones who would have wanted to see a new question directly on PPCG (and not HNQ) will have seen it and answered if they wanted. At that point it can still get on HNQ to get more views and answers, so the exact hour of posting is not incredibly important.&lt;/p&gt;&#xA;&lt;p&gt;There does seem less activity on the weekend, but presumably that goes for all of SE, so your chances at HNQ are not really any worse.&lt;/p&gt;&#xA;&lt;p&gt;And remember, it's not like questions &lt;em&gt;go&lt;/em&gt; anywhere if they have few views or few answers. Their number of views can only go up. Completely unanswered questions are fairly rare, we have around 115 questions with zero answers, of 5127 total.&lt;/p&gt;&#xA;&lt;p&gt;I'd personally say that a question's title, and of course it's &lt;strong&gt;actual &lt;em&gt;content&lt;/em&gt;&lt;/strong&gt; are far more important to worry about.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-21T18:55:06.330" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8742" PostTypeId="2" ParentId="2140" CreationDate="2016-03-20T12:16:23.823" Score="0" Body="&lt;p&gt;&lt;em&gt;Are bug hunts like this allowed?&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Bug Hunt - Make a change in a Git repo that Git cannot detect&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt; In the working directory of a Git repo, make a change that Git cannot detect.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Changes can be on any file in the working directory or subdirectories that is tracked by Git.&lt;/li&gt;&#xA;&lt;li&gt;You may use any tool to make the change, or script your own program to do so.&lt;/li&gt;&#xA;&lt;li&gt;For tools, state the tool used and the steps to reproduce.&lt;/li&gt;&#xA;&lt;li&gt;For script or program, produce the code (please use &lt;a href=&quot;https://gist.github.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub Gist&lt;/a&gt; if it's too long). State the language and compiler version, if any.&lt;/li&gt;&#xA;&lt;li&gt;You can also do the change manually. In this case, outline the steps.&lt;/li&gt;&#xA;&lt;li&gt;State the version and platform of the Git binary used.&lt;/li&gt;&#xA;&lt;li&gt;Show a comparison between an actual clean working directory and the modified one to show the change Git can't detect.&lt;/li&gt;&#xA;&lt;li&gt;Show that &lt;code&gt;git status&lt;/code&gt; says &lt;em&gt;&quot;nothing to commit, working directory clean&quot;&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Winning Criterion:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The extend of the undetected change - the bigger the change, the better.&lt;/li&gt;&#xA;&lt;li&gt;Reasonably latest Git version.&lt;/li&gt;&#xA;&lt;li&gt;Easy to reproduce.&lt;/li&gt;&#xA;&lt;li&gt;[Optional] Short code or simple steps. It's OK if it's not, as long as you do something exceptional.&lt;/li&gt;&#xA;&lt;li&gt;Most upvotes (for tiebreaker reasons).&lt;/li&gt;&#xA;&lt;li&gt;[Optional] You located an actual unfixed bug in the Git source code, and not just a quirk in something else.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Restrictions:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Obviously, using &lt;code&gt;.gitignore&lt;/code&gt; is not allowed. It's a bug hunt. Changes that Git is &lt;em&gt;designed&lt;/em&gt; to ignore are not allowed. We should reasonably expect Git to see and report the change, but find that Git doesn't.&lt;/li&gt;&#xA;&lt;li&gt;Use latest Git version you can get. Some old version with some bug that's already fixed doesn't count.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Please let me know if this is OK, so I can go ahead to post it on the main site.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I could only find &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/file-system&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;file-system&amp;#39;&quot; rel=&quot;tag&quot;&gt;file-system&lt;/a&gt;. A suggested tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/bug-hunt&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;bug-hunt&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug-hunt&lt;/a&gt; would have been the best.&lt;/p&gt;&#xA;" OwnerUserId="52296" LastEditorUserId="52296" LastEditDate="2016-03-20T12:24:05.323" LastActivityDate="2016-03-20T12:24:05.323" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8743" PostTypeId="2" ParentId="2140" CreationDate="2016-03-20T12:35:30.400" Score="2" Body="&lt;h1&gt;Maximum of Two Roman Numerals&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You should write a program or function which returns the maximum of two &lt;a href=&quot;https://en.wikipedia.org/wiki/Roman_numerals&quot; rel=&quot;nofollow&quot;&gt;Roman numerals&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Two positive integers between 1 and 3999 (inclusive) with their Roman numeral representation string.&lt;/li&gt;&#xA;&lt;li&gt;The two strings can be separated by a space or inputted in the standard list representation of your language.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;4&lt;/code&gt;, &lt;code&gt;9&lt;/code&gt;, &lt;code&gt;40&lt;/code&gt;, ... are written as &lt;code&gt;IV&lt;/code&gt;, &lt;code&gt;IX&lt;/code&gt;, &lt;code&gt;XL&lt;/code&gt;, ...&lt;/li&gt;&#xA;&lt;li&gt;Trailing newline is optional.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The larger Roman numeral as string.&lt;/li&gt;&#xA;&lt;li&gt;Trailing newline is optional.&lt;/li&gt;&#xA;&lt;li&gt;If the two inputs are equal you should still only return one of them.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Format is &lt;code&gt;input =&amp;gt; output (explanation)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;XXIX DI =&amp;gt; DI (29 &amp;lt; 501)&#xA;V X =&amp;gt; X    &#xA;&#xA;TODO more&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Built-in functions involving Roman numerals are prohibited.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code golf so the shortest entry wins.&lt;/p&gt;&#xA;" OwnerUserId="7311" LastEditorUserId="7311" LastEditDate="2016-03-20T12:42:54.160" LastActivityDate="2016-03-20T12:42:54.160" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8744" PostTypeId="2" ParentId="2140" CreationDate="2016-03-20T20:00:14.937" Score="5" Body="&lt;h1&gt;Tron Game&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a Tron bot!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The aim of the game is to make as many moves on a grid as possible without moving onto a space that has already been occupied in the current game. If your bot is unable to make such a move, it loses the round. The board does not wrap so bots can not go off the side of the arena.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Game IO:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your bot will be written in python and will create a class that inherits from &lt;code&gt;BotSkeleton&lt;/code&gt;. An example test bot is shown below.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;from bot_skeleton import BotSkeleton&#xA;from typing_hints import PositionDict, Position&#xA;from board import Board&#xA;from typing import List&#xA;&#xA;import random&#xA;&#xA;&#xA;class Test(BotSkeleton):&#xA;    def make_move(self, board: Board, positions: PositionDict) -&amp;gt; Position:&#xA;        self.board = board&#xA;        self.position = positions[self.bot_id]&#xA;        valid_moves = self.get_valid_moves()&#xA;        try:&#xA;            return random.choice(valid_moves)&#xA;        except IndexError:&#xA;            return None&#xA;&#xA;    def get_valid_moves(self) -&amp;gt; List[Position]:&#xA;        moves = filter(self.board.position_valid, ((self.position[0]+1, self.position[1]),&#xA;                                                   (self.position[0]-1, self.position[1]),&#xA;                                                   (self.position[0], self.position[1]+1),&#xA;                                                   (self.position[0], self.position[1]-1)))&#xA;        return list(moves)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(Type hints are not required but illustrated here  to help understanding)&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;position&lt;/code&gt; is a 2-long tuple containing 2 integers.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;positions&lt;/code&gt; is a &lt;code&gt;Dict[bot_id, position]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;board&lt;/code&gt; can be indexed with a &lt;code&gt;position&lt;/code&gt;.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;get_random_empty_pos() -&amp;gt; position&lt;/code&gt; - returns a empty position at random in the board&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;position_valid(position) -&amp;gt; bool&lt;/code&gt; - returns if this move is valid (but not next to the position given)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;copy() -&amp;gt; List[List[int]&lt;/code&gt; - returns a 2d list that can be modifiable of the current board state&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;EMPTY&lt;/code&gt; - the id for an empty space&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The value you return must be a &lt;code&gt;position&lt;/code&gt;, and must also have a distance of 1 from this, not including diagonals.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Built in attributes for &lt;code&gt;BotSkeleton&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;log&lt;/code&gt; - contains a file object that you may write to&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;no_bots&lt;/code&gt; - the number of bots the game began with&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;bot_id&lt;/code&gt; - you're bot's id number.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Methods in &lt;code&gt;Board&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;get_random_empty_pos() -&amp;gt; Position&lt;/code&gt; - Returns a position at random that is empty&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;position_valid(pos: Position) -&amp;gt; bool&lt;/code&gt; - returns if a position is inside the board and is currently empty&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;copy() -&amp;gt; Board&lt;/code&gt; - return a copy of the board that is writable&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Tournament structure&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Every bot will get pitted against every other bot in a giant arena&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;That is to say every single bot will be in every battle&lt;/li&gt;&#xA;&lt;li&gt;The size of the arena will be &lt;code&gt;(30, 30)&lt;/code&gt;. This may be increased depending on number of bots entered.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;General rules that I can't find better places for&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your bot may NOT use any file storage except for write-only access to the log file provided&lt;/li&gt;&#xA;&lt;li&gt;Your bot must be written in Python 3. Sorry java people&lt;/li&gt;&#xA;&lt;li&gt;You may enter as many bots as you want&lt;/li&gt;&#xA;&lt;li&gt;Your bot must not attempt to subvert the game state&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;I reserve the right to disqualify any bot from the competition&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;(but shall only do so after telling you I will do so and you not making any changes required)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;You may download the controller &lt;a href=&quot;https://github.com/muddyfish/TronKOTH&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;h2&gt;Results:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Results here&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Sandbox notes:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should there be a minimum starting distance between players?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="32686" LastEditorUserId="32686" LastEditDate="2017-02-11T14:17:03.697" LastActivityDate="2017-02-11T14:17:03.697" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8745" PostTypeId="1" AcceptedAnswerId="8746" CreationDate="2016-03-20T21:52:49.817" Score="14" ViewCount="182" Body="&lt;p&gt;I recently posted a question, and would like to know what is wrong about it, and how it could have been made better. This is not to get the question back, but rather so that I know what makes a good question here, so I can improve next time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is my question:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/75886/implement-rfc-1149-5-in-your-language-make-random-return-4&quot;&gt;https://codegolf.stackexchange.com/questions/75886/implement-rfc-1149-5-in-your-language-make-random-return-4&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It was put on hold for being too broad.&lt;/p&gt;&#xA;" OwnerUserId="49920" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-03-21T17:04:55.010" Title="How Can I Make my Question Better?" Tags="|discussion|specific-question|close-reasons|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8746" PostTypeId="2" ParentId="8745" CreationDate="2016-03-20T22:25:04.443" Score="10" Body="&lt;p&gt;Welcome to Programming Puzzles &amp;amp; Code Golf! I'm delighted that you've joined our community. Making a challenge is difficult and we have a lot of not-so-obvious guidelines about what makes them good and on-topic, but you've come to the right place for more detailed feedback!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this case there are three aspects of your challenge that generally aren't well received by the community:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;It's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt;. Some time ago, we decided &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8326/20469&quot;&gt;by community consensus&lt;/a&gt; to change our stance on challenges bearing this tag. Whereas at one point in the site's history they were welcome and typically well-received, we now consider them off-topic and unwelcome.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It's a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;. These challenges are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8244/20469&quot;&gt;still welcome&lt;/a&gt; but they're exceptionally difficult to do well. In fact, making a challenge a popularity contest is a common pitfall, particularly for newer users. For this reason we now consider them &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8134/20469&quot;&gt;something to avoid when writing challenges&lt;/a&gt;. More often than not, popularity contests closed as &quot;too broad.&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The goal of the challenge is effectively to circumvent our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1739/20469&quot;&gt;standard loophole regarding fake random numbers&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;I recommend posting challenges to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/20469&quot;&gt;Sandbox&lt;/a&gt; before posting them to the main site. There they can get constructive feedback from the community in a reputation-free environment. I consider the Sandbox to be our single most valuable tool available for challenge authors.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Further, in addition to the part about popularity contests, the full list of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8047/20469&quot;&gt;things to avoid when writing challenges&lt;/a&gt; is worth a read.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-03-21T17:04:55.010" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8749" PostTypeId="1" CreationDate="2016-03-21T05:57:42.713" Score="15" ViewCount="2530" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;help center says&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;All &lt;strong&gt;solutions&lt;/strong&gt; to challenges should:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Correctly implement the required specification.&lt;/li&gt;&#xA;  &lt;li&gt;Be a serious contender for the winning criteria in use. For example, an entry to a code golf contest needs to be golfed, and an entry to a&#xA;  speed contest should make some attempt to be fast.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;As I understand the phrase, being a &quot;serious contender&quot; means having a significant chance of being the winner. For code golf, this would mean being the shortest solution. But that's silly -- even though an answer in C has no chance of winning when there's golfing languages about, it's surely a valid submission, even if it's longer than one already posted, possibly &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7300/why-cant-i-post-my-answer-after-others-use-my-language&quot;&gt;in the same language&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, we know that's not we mean by &quot;serious contender&quot;, and the next sentence suggests that it's more about making an effort. But, the help center is for those new to the site, so it should be clear on its own. What do we want this policy to be, and how can we best convey it?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I had edited in a change in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2098/20260&quot;&gt;this rewrite drafting&lt;/a&gt;, but it hasn't been included and this probably warrants more discussion.)&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="68942" LastEditDate="2021-06-09T05:53:58.970" LastActivityDate="2021-06-09T05:53:58.970" Title="Clarifying &quot;serious contender&quot; in the help center" Tags="|discussion|policy|answers|rules|help-center|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8750" PostTypeId="2" ParentId="8749" CreationDate="2016-03-21T06:28:51.847" Score="19" Body="&lt;p&gt;A serious contender is a submission which makes a serious effort towards optimizing the submission's score within the chosen language(s) and other choices (such as algorithm choice or optional restrictions/bonuses taken).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is somewhat subjective, in that the best answer in my opinion is &quot;you'll know it when you see it&quot;. Some examples of not-serious-contender submissions are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In code golf, having unnecessarily-lengthy variable names (i.e. &lt;code&gt;ratio_of_circumference_to_diameter&lt;/code&gt; instead of &lt;code&gt;pi&lt;/code&gt; or &lt;code&gt;p&lt;/code&gt;), having excessive whitespace/NOPs (i.e. &lt;code&gt;int a = 1;&lt;/code&gt; instead of &lt;code&gt;int a=1;&lt;/code&gt; in C-based languages), or, in general, writing code that Code Review would like.&lt;/li&gt;&#xA;&lt;li&gt;In code challenges, deliberately crafting a solution that gets a poor score.&lt;/li&gt;&#xA;&lt;li&gt;In King of the Hill, submitting a &quot;suicidal&quot; bot (one that actively works against its win condition, like the infamous EmoWolf).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In short, if the only way a submission could win a challenge (either overall or within its set of choices for language(s), algorithm(s), and/or other relevant categories for the challenge) is if no other solutions were posted, it's almost certainly not a serious contender (like the linked submission above). Note that this does not exclude using a more-verbose language or lengthier approach in code golf, since submissions in all programming languages are welcome, and different submissions in the same language are acceptable so long as the differences are non-trivial.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="46271" LastEditDate="2018-01-10T18:09:05.297" LastActivityDate="2018-01-10T18:09:05.297" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="8752" PostTypeId="1" CreationDate="2016-03-21T20:02:34.843" Score="23" ViewCount="565" Body="&lt;p&gt;In connection with the moderator elections, we will be holding a Q&amp;amp;A with the candidates.  This will be an opportunity for members of the community to pose questions to the candidates on the topic of moderation.  Participation is completely voluntary.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;The purpose of this thread was to collect questions for the questionnaire. The questionnaire is now live, and you may find it &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8810/2016-moderator-election-qa-questionnaire&quot;&gt;here&lt;/a&gt;.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Here's how it'll work:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;During the nomination phase, (so, until Monday, March 28th at 20:00:00Z UTC, or 4:00 pm EDT on the same day, give or take time to arrive for closure), this question will be open to collect potential questions from the users of the site. Post answers to this question containing any questions you would like to ask the candidates. Please only post &lt;em&gt;one question per answer&lt;/em&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;We, the Community Team, will be providing a small selection of generic questions. The first two will be guaranteed to be included, the latter ones are if the community doesn't supply enough questions. This will be done in a single post, unlike the prior instruction.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is a perfect opportunity to voice questions that are specific to your community and issues that you are running into at current.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;At the end of the phase, the Community Team will select &lt;strong&gt;up to 8 of the top voted questions submitted by the community&lt;/strong&gt; provided in this thread, to use in addition to the aforementioned 2 guaranteed questions. We reserve some editorial control in the selection of the questions and may opt not to select a question that is tangential or irrelevant to moderation or the election. That said, if I have concerns about any questions in this fashion, I will be sure to point this out in comments before the decision making time.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Once questions have been selected, a new question will be opened to host the actual questionnaire for the candidates, containing 10 questions in total.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is not the only option that users have for gathering information on candidates. As a community, you are still free to, for example, hold a live chat session with your candidates to ask further questions, or perhaps clarifications from what is provided in the Q&amp;amp;A.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If you have any questions or feedback about this process, feel free to post as a comment here.&lt;/p&gt;&#xA;" OwnerUserId="2414" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-03-28T20:03:36.113" Title="2016 Moderator Election Q&amp;A - Question Collection" Tags="|discussion|election|" AnswerCount="14" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8753" PostTypeId="2" ParentId="8752" CreationDate="2016-03-21T20:02:34.843" Score="6" Body="&lt;p&gt;Here is a set of general questions, gathered as very common questions asked every election. As mentioned in the instructions, the first two questions are guaranteed to show up in the Q&amp;amp;A, while the others are if there aren't enough questions (or, if you like one enough, you may split it off as a separate answer for review within the community's 8). &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How would you deal with a user who produced a steady stream of valuable answers, but tends to generate a large number of arguments/flags from comments? &lt;/li&gt;&#xA;&lt;li&gt;How would you handle a situation where another mod closed/deleted/etc a question that you feel shouldn't have been?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In your opinion, what do moderators do? &lt;/li&gt;&#xA;&lt;li&gt;A diamond will be attached to everything you say and have said in the past, including questions, answers and comments. Everything you will do will be seen under a different light. How do you feel about that? &lt;/li&gt;&#xA;&lt;li&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep? &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="2414" LastActivityDate="2016-03-21T20:02:34.843" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8754" PostTypeId="1" CreationDate="2016-03-21T20:03:40.877" Score="12" ViewCount="347" Body="&lt;p&gt;The 2016 Community Moderator Election is now underway!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Community moderator elections have three phases:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Nomination phase&lt;/li&gt;&#xA;&lt;li&gt;Primary phase&lt;/li&gt;&#xA;&lt;li&gt;Election phase&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Most elections take between two and three weeks, but this depends on how many candidates there are.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please visit the official election page at&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/election&quot;&gt;https://codegolf.stackexchange.com/election&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;for more detail, and to participate!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you have general questions about the election process, or questions for moderator candidates, feel free to ask them here on meta -- just make sure your questions are tagged &lt;a href=&quot;/questions/tagged/election&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;election&amp;#39;&quot; rel=&quot;tag&quot;&gt;election&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="-1" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-03-21T20:03:40.877" Title="2016 Community Moderator Election" Tags="|discussion|moderators|election|" AnswerCount="0" CommentCount="1" CommunityOwnedDate="2016-03-21T20:03:40.877" ContentLicense="CC BY-SA 3.0" />
  <row Id="8755" PostTypeId="2" ParentId="8752" CreationDate="2016-03-21T22:51:42.750" Score="15" Body="&lt;p&gt;One of the biggest difficulties for moderators and high-rep users is to distinguish certain posts from being in-scope or not. There are three critical elements of the PPCG.SE scope, namely the three close reasons:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Too broad&lt;/li&gt;&#xA;&lt;li&gt;Opinion-based&lt;/li&gt;&#xA;&lt;li&gt;Unclear what you're asking&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;What distinguishes a challenge as &lt;em&gt;too broad&lt;/em&gt; or &lt;em&gt;opinion-based&lt;/em&gt;? How clear does a challenge need to be to be in-scope? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Can you specify your limits on these types of close reasons and your definition of each?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="36670" LastActivityDate="2016-03-21T22:51:42.750" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8756" PostTypeId="2" ParentId="8752" CreationDate="2016-03-22T01:01:53.147" Score="-1" Body="&lt;p&gt;&lt;strong&gt;What plans do you have to expand our site?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We have had frequent requests for new challenge criteria, but to little avail.  We occasionally see new challenge formats (such as the &quot;build on the last answer&quot;, and &quot;format your code in a shape&quot;), and at other times, really great original challenges. These ideas is really what keep this site running, in my humble opinion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've broken the above question into a couple of sub questions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The Sandbox plays a large role in generating and refining these ideas.  Do you have any ideas on how to improve our process of using the Sandbox?&lt;/li&gt;&#xA;&lt;li&gt;Do you feel there are current rules/guidelines that hinder our growth?&lt;/li&gt;&#xA;&lt;li&gt;Do you have any other ideas on how to spark creativity here?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2016-03-22T01:48:26.627" LastActivityDate="2016-03-22T01:48:26.627" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8757" PostTypeId="2" ParentId="8737" CreationDate="2016-03-22T01:24:20.640" Score="0" Body="&lt;h1&gt;A function returns back to where it came from&lt;/h1&gt;&#xA;&lt;p&gt;A function is has two parts:  An arbitrary length block of code which is run when the function is &amp;quot;called&amp;quot;, and a &amp;quot;calling&amp;quot; statement.&lt;/p&gt;&#xA;&lt;p&gt;After the block of code has run, the code pointer must automatically return back to the statement that made the call.&lt;/p&gt;&#xA;&lt;p&gt;The key word is &lt;em&gt;automatically&lt;/em&gt;.  A GOTO at the end of a code block is not automatic.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-22T02:32:31.470" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8758" PostTypeId="2" ParentId="8752" CreationDate="2016-03-22T03:20:34.113" Score="14" Body="&lt;p&gt;&lt;strong&gt;What is the threshold for using your mod-hammer vs. letting the community take care of issues?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;In other words, will you be mostly laissez-faire with posts and let the close/delete vote system sort out the good posts from the bad? Or will you personally decide that a post doesn't meet quality standards and mod-hammer it (note that this does not apply to obvious spam and the like).&lt;/p&gt;&#xA;&lt;h3&gt;Laissez-faire&lt;/h3&gt;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Community reaches a consensus&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Close/down-voters (sometimes) give feedback&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Cons:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Can be slow&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Mod hammer&lt;/h3&gt;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Sometimes, executive decisions need to be made&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Fairly quick process&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Cons:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Community might not agree with actions&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41505" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-22T04:27:21.860" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8759" PostTypeId="2" ParentId="8752" CreationDate="2016-03-22T04:21:34.390" Score="1" Body="&lt;h3&gt;What do you like most about our current moderation model/system?&lt;/h3&gt;&#xA;&lt;p&gt;What would you keep the same?&lt;/p&gt;&#xA;&lt;p&gt;What would you change?&lt;/p&gt;&#xA;" OwnerUserId="36670" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-22T04:21:34.390" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8760" PostTypeId="2" ParentId="8752" CreationDate="2016-03-22T04:25:48.443" Score="7" Body="&lt;h3&gt;What would your average moderation schedule be like?&lt;/h3&gt;&#xA;&lt;p&gt;When will you be active?&lt;/p&gt;&#xA;&lt;p&gt;What day(s)/time(s) would it be best for people to contact you in case of a need of a moderator?&lt;/p&gt;&#xA;&lt;p&gt;(This is of course an estimated schedule, and nobody will hold you accountable to it)&lt;/p&gt;&#xA;" OwnerUserId="36670" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-22T04:25:48.443" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8761" PostTypeId="2" ParentId="8752" CreationDate="2016-03-22T05:21:37.040" Score="8" Body="&lt;h3&gt;How will you help the site fit in with the SE network better?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;We are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8350/were-not-a-qa-site-but-what-should-be-done-about-it&quot;&gt;not a Q&amp;amp;A site!&lt;/a&gt; However, a most of the features built in to the site are designed for Q&amp;amp;A sites. Will you effectively&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Be an ambassador for our site, and help us get site-specific customizations to fit our mission better?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Help the site narrow it's scope to fit that of a Q&amp;amp;A site better?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Something else?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-03-22T05:21:37.040" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8763" PostTypeId="2" ParentId="8737" CreationDate="2016-03-22T06:19:42.403" Score="6" Body="&lt;p&gt;A function is a piece of reusable code that will produce consistent output(s) given consistent input(s). Note that consistent doesn't necessarily mean identical; it merely means that the function won't do something unexpected (i.e. &lt;code&gt;randint(1, 4)&lt;/code&gt; will always return a random integer &lt;code&gt;n&lt;/code&gt; such that &lt;code&gt;1 &amp;lt;= n &amp;lt;= 4&lt;/code&gt;, and never an integer outside of that range, a floating point value, or the lyrics to a song).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, there must be some consistent method of providing input to the function (like function arguments, putting input on the stack, or saving input in specified registers), a consistent method of retrieving the output (like return values, modified parameters, stack contents, or register contents), and a consistent method of calling the function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For languages that have support for functions/methods/procedures, their built-in functions are acceptable so long as they meet these requirements. Additionally, for &lt;em&gt;any&lt;/em&gt; language (including languages without such constructs such as purely imperative languages), if there is a way to write a piece of code that adheres to the above constraints, it is acceptable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for writing a submission that uses a function, the result of evaluating the submission code should either result in a named function being defined, or an unnamed function being defined that can be assigned a variable reference, and can subsequently called.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples of acceptable submissions (not an exhaustive list):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Macro functions (C/C++: &lt;code&gt;#define ISEVEN(X) (X % 2 == 0)&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Named and unnamed lambda functions (Python: &lt;code&gt;lambda x: x % 2 == 0&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Functions with helper functions also defined (Python: &lt;code&gt;f = lambda x: x == 0; lambda x: f(x % 2)&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2016-06-11T19:49:37.653" LastActivityDate="2016-06-11T19:49:37.653" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="8764" PostTypeId="2" ParentId="8752" CreationDate="2016-03-22T07:50:47.520" Score="19" Body="&lt;p&gt;What would you do in this situation as moderator? &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A new-ish user posts a well-posed challenge that quickly gets many&#xA;  answers. An hour later, they edit in a restriction that invalidates&#xA;  most of the existing answers. An experienced user whose answer was&#xA;  invalidated comments that doing this is bad, and rolls back the edit.&#xA;  The poster insists on the change and re-adds it, and the two get into&#xA;  an edit war. Someone flags for moderator attention.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2016-03-22T07:50:47.520" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8765" PostTypeId="2" ParentId="8752" CreationDate="2016-03-22T13:31:02.930" Score="3" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;A diamond will be attached to everything you say and have said in the past, including questions, answers and comments. Everything you will do will be seen under a different light. How do you feel about that?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is a question from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8753/48538&quot;&gt;the set of general questions&lt;/a&gt; posted by Grace Note.&lt;/p&gt;&#xA;" OwnerUserId="48538" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-03-22T13:31:02.930" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8767" PostTypeId="2" ParentId="8752" CreationDate="2016-03-22T17:55:54.487" Score="7" Body="&lt;p&gt;Initially suggested by @HelkaHomba in &lt;a href=&quot;http://chat.stackexchange.com/transcript/37289?m=28424543#28424543&quot;&gt;chat&lt;/a&gt;. (Emphasis mine)&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;What's your opinion on letting experienced users essentially re-write a challenge that has potential but is badly worded or specified&lt;/strong&gt;? I've done this once or twice because rewriting is far easier for me than explaining what is wrong (possibly multiple times).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="36670" LastActivityDate="2016-03-22T17:55:54.487" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8769" PostTypeId="2" ParentId="8737" CreationDate="2016-03-22T19:01:24.167" Score="0" Body="&lt;p&gt;Here is my definition of a function:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A function must have the ability to be called by its name, object, reference, or other handle (this prevents code snippets). The only exception to this is the main method (or equivalent) of a program.&lt;/li&gt;&#xA;&lt;li&gt;A function must be able to take data as input by accepting parameters and output data by returning values. If side-effects occur, the function shouldn't exploit them; any parameters should be arguments, and any results should use your language's equivalent of &lt;code&gt;return&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Multiple functions can be counted as one function, provided that each helper function meets the 2 previous conditions.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Lastly, as @Downgoat's answer says, if something is obviously not a function, then it shouldn't be treated as such.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;hr&gt;&#xA;A full program is any code that can be compiled, interpreted, or otherwise executed in a non-REPL environment without any modification. Note that some code can be classified as both functions and full programs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anything that is not either a function or a full program is a code snippet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;hr&gt;&#xA;For an example, let's look at Java lambda expressions.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You can assign a lambda expression to an object, so it passes the handle test.&lt;/li&gt;&#xA;&lt;li&gt;It is possible to write a lambda expression that accepts parameters and returns values.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(int a, double b)-&amp;gt;{&#xA;    return 4;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Since a lambda that satisfies #2 exists, any lambda is considered a function, even those that don't accept parameters:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;()-&amp;gt;{&#xA;    System.out.println(&quot;Lambda is running&quot;);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ol start=&quot;3&quot;&gt;&#xA;&lt;li&gt;N/A&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I made a quick flowchart to categorize various bits of code (sorry for my lack of flowcharting skills):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/xPrWn.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/xPrWn.png&quot; alt=&quot;A flowchart&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="41505" LastEditorUserId="41505" LastEditDate="2016-03-22T23:28:23.543" LastActivityDate="2016-03-22T23:28:23.543" CommentCount="16" ContentLicense="CC BY-SA 3.0" />
  <row Id="8771" PostTypeId="1" AcceptedAnswerId="8777" CreationDate="2016-03-23T02:07:49.983" Score="11" ViewCount="830" Body="&lt;p&gt;I was recently alerted to our increasing noise-to-signal ratio we have in chat, something I can definitely see looking back.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While discussing it in chat, people mentioned that they still enjoy the occasional off-topic chat, and even some of the ಠ_ಠ faces and other &quot;pointless&quot; chats.  That said, I can definitely say that there are users that feel like there is too much of it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore,  &lt;strong&gt;do you feel like there is too much off-topic chatter in &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;our chat&lt;/a&gt;?&lt;/strong&gt;  If so, how do we go about changing it?&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="3808" LastEditDate="2016-03-23T02:27:26.193" LastActivityDate="2016-07-01T10:45:44.777" Title="The state of chat" Tags="|discussion|policy|chat|" AnswerCount="7" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="8772" PostTypeId="2" ParentId="8771" CreationDate="2016-03-23T02:20:15.063" Score="6" Body="&lt;h1&gt;No, there is not too much off-topic chatter&lt;/h1&gt;&#xA;&lt;p&gt;&amp;quot;&lt;a href=&quot;https://chat.stackexchange.com/rooms/info/240/the-nineteenth-byte&quot;&gt;General discussion&lt;/a&gt;&amp;quot; means &lt;em&gt;general&lt;/em&gt; discussion. A few off topic tangents or unnecessary messages still fall into that category.&lt;/p&gt;&#xA;&lt;p&gt;Unless there is outright spamming, nothing needs to be done.&lt;/p&gt;&#xA;&lt;p&gt;People can always make other chatrooms for a more focused discussion.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-23T02:20:15.063" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8774" PostTypeId="2" ParentId="8771" CreationDate="2016-03-23T02:39:45.153" Score="15" Body="&lt;p&gt;I find it hard to try to discuss golfing in chat. When I'm not pinging a specific person, my messages get lost in the flood of unrelated conversation. It's also hard to scan through the transcript for chat about golfing when it's full of meme clutter.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;People can always make other chatrooms for a more focused discussion. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8772/20260&quot;&gt;- Helka Homba&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&quot;More focused discussion&quot;? You have to be kidding me. You want me to go to a side room to discuss code golfing &lt;em&gt;on a site about code golfing&lt;/em&gt;? We tried &lt;a href=&quot;http://chat.stackexchange.com/rooms/30617/code-golfers-corner&quot;&gt;making a room for code golfing&lt;/a&gt; and it predictably died due to lack of activity. Nobody looks for some special new room, they look in the main site chat. &lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-03-23T02:39:45.153" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8776" PostTypeId="2" ParentId="8771" CreationDate="2016-03-23T03:12:11.840" Score="8" Body="&lt;h1&gt;Exercise Self Moderation&lt;/h1&gt;&#xA;&lt;p&gt;Having a main chat room for &lt;em&gt;everything&lt;/em&gt; is okay, but it can get out of control, such as caret denotion turning into a train of noise that only annoying and distracts people.&lt;/p&gt;&#xA;&lt;p&gt;The &amp;quot;&lt;em&gt;solutions&lt;/em&gt;&amp;quot; of having a secondary chat room, room owners moving messages to the trash or even moderators deleting messages is both painful for users and often moderators to logistically co-ordinate &lt;em&gt;who&lt;/em&gt; moves things and &lt;em&gt;what&lt;/em&gt; gets moved.&lt;/p&gt;&#xA;&lt;p&gt;Over in Code Review, we had &lt;a href=&quot;https://codereview.meta.stackexchange.com/questions/5606/how-much-idle-chatter-do-we-tolerate-in-the-2nd-monitor&quot;&gt;a similar issue&lt;/a&gt; that arose when our userbase, chat userbase and subsequently noise increased. While the consensus was the creation of a secondary room, it's been a painful experience ever since. Room owners can get in arguments with normal chat users and it just creates tension and unhappiness.&lt;/p&gt;&#xA;&lt;p&gt;People love the off-topic and random nature of the chat, it's a great way to talk to likeminded individuals about things you wouldn't otherwise bring up. People also love the idea that you can be talking about a certain topic and come back minutes later to an entirely different conversation.&lt;/p&gt;&#xA;&lt;h2&gt;So, what can &lt;em&gt;you&lt;/em&gt; do?&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Exercise Self Moderation&lt;/strong&gt;. When you see this sort of thing:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;aUser: ಠ_ಠ&lt;br /&gt;&#xA;secondUser: ^&lt;br /&gt;&#xA;thirdUser: ^^&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Don't reply. Trains of &lt;code&gt;ಠ_ಠ&lt;/code&gt; and &lt;code&gt;^&lt;/code&gt; benefit nobody. If you agree with someone's post enough to post a caret'd reply, star the message (&amp;quot;&lt;em&gt;Feel free to star any message you feel is particularly useful or worthy of summarizing in the transcript&lt;/em&gt;&amp;quot;: from the &lt;a href=&quot;http://chat.stackexchange.com/faq#star&quot;&gt;FAQ&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;p&gt;While I'm not saying &lt;em&gt;&amp;quot;abandon personality and fun&lt;/em&gt;&amp;quot;, as rational people, you can make the choice whether or not to contribute to the noise.&lt;/p&gt;&#xA;&lt;p&gt;Noise is an inevitable result of chatrooms, you simply have to deal with it the best you can as an individual.&lt;/p&gt;&#xA;" OwnerUserId="41519" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-23T03:12:11.840" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="8777" PostTypeId="2" ParentId="8771" CreationDate="2016-03-23T03:25:42.297" Score="36" Body="&lt;h1&gt;One chat room cannot be what &lt;em&gt;everybody&lt;/em&gt; expects from it&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The Nineteenth Byte's purpose is labeled as &lt;em&gt;general discussion&lt;/em&gt;; the jestful addendum appears to indicate that pretty much everything goes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A good thing about this is that The Nineteenth Byte is usually &lt;em&gt;crowded&lt;/em&gt;. If you need input on something, you can almost be sure that you'll find somebody you can talk to. It also means that there is a place where we can get to know each other better, which I think is useful for community building. None of this would be the case with a strict policy about what is on topic and what not.&lt;sup&gt;1&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moreover, I feel The Nineteenth Byte should also be the go-to place for serious discussions about PPCG.&lt;sup&gt;2&lt;/sup&gt; Idle chatter is not a problem, as long as it occurs during &lt;em&gt;idle&lt;/em&gt; times. &lt;strong&gt;When a serious, important discussion is taking place, chatter should cease until that discussion is over.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it possible to have a calm, extended, one-to-one conversation with somebody about, say, golfing a particular answer? Probably not. I also don't think that falls under &lt;em&gt;general discussion&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ideally, we'd have topic rooms for these things. That has worked well for the development of esoteric programming languages, Data, the testing room for bots, etc. For whatever reason, the &lt;em&gt;Code Golfer's Corner&lt;/em&gt; &amp;ndash; which would seem like a popular idea on paper &amp;ndash; didn't share that success.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, there's always the option to create a temporary chat room for an extended conversation between a small number of users. That's a useful feature, and it should get used more often.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; &lt;sub&gt;That does &lt;em&gt;not&lt;/em&gt; mean I endorse caret chains, conversations that consist solely of animated GIFs, and similarly disruptive interactions that do not even qualify as off-topic chatter.&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;2&lt;/sup&gt; &lt;sub&gt;By that, I mean discussions that affect the site, like the recent discussion about the purpose of The Nineteenth Byte.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2016-03-23T03:57:27.460" LastActivityDate="2016-03-23T03:57:27.460" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8779" PostTypeId="1" CreationDate="2016-03-23T05:20:03.337" Score="9" ViewCount="398" Body="&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/a/76050/51825&quot;&gt;this answer&lt;/a&gt;, I used a &lt;code&gt;java.util.List&lt;/code&gt; as a parameter to an anonymous function (lambda) answer. So, my question is,&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Should this import be counted to the byte total?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I know, it feels like the obvious answer should be &lt;em&gt;YES&lt;/em&gt; - if you don't &lt;code&gt;import java.util.*&lt;/code&gt;, my example usage won't compile.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, it's not that simple. I could declare the type (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/4726/51825&quot;&gt;which we don't score&lt;/a&gt;) as &lt;code&gt;BiConsumer&amp;lt;java.util.List&amp;lt;String&amp;gt;, String&amp;gt;&lt;/code&gt; - use the full name instead of importing - and then everything would be fine and dandy. To blur the line further, say an external class has a method that takes a &lt;code&gt;BiConsumer&amp;lt;List&amp;lt;String&amp;gt;, &amp;lt;String&amp;gt;&lt;/code&gt;. Then, in my test class I could use this lambda without ever referencing the &lt;code&gt;java.util&lt;/code&gt; package at all!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To clarify, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8287&quot;&gt;On scoring imported functions&lt;/a&gt; refers to scoring a submission of a default method, where this is still scoring a lambda. The issue here is does the import statement need to be counted in the score, as it is possible to compile the lambda without the import but only under very specific conditions.&lt;/p&gt;&#xA;" OwnerUserId="51825" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2017-07-29T01:05:34.153" Title="Scoring Java lambdas with imports" Tags="|discussion|policy|code-golf|answers|scoring|" AnswerCount="1" CommentCount="4" ClosedDate="2016-03-24T19:48:28.203" ContentLicense="CC BY-SA 3.0" />
  <row Id="8780" PostTypeId="2" ParentId="8771" CreationDate="2016-03-23T09:00:43.927" Score="8" Body="&lt;p&gt;As the person whose comment triggered Nathan's question, I think I should answer.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Yes, there's far too much off-topic chatter&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The FAQ for chat says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This site is an extension of The Stack Exchange Network, so discussion should more or less revolve around the same topics you'd find at The Stack Exchange Network — but in an interactive, less strictly Q&amp;amp;A focused way. Do have fun, but please keep it professional and &lt;em&gt;always&lt;/em&gt; be respectful of your fellow community members.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I understand this to mean that in the chat rooms associated with PPCG, &lt;em&gt;especially&lt;/em&gt; in the primary chat room associated with PPCG, chat should be about programming puzzles, code golf, PPCG itself, and similar themes. For a long time I had the impression that at least 50% of the content was on-topic by that standard. But at some point it seemed to turn into a chan, where a handful of newish users posted memes and the on-topic content was 10% on a &lt;em&gt;good&lt;/em&gt; day. That's why I abandoned it.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2016-03-23T09:00:43.927" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8782" PostTypeId="2" ParentId="8779" CreationDate="2016-03-23T18:43:55.090" Score="6" Body="&lt;h2&gt;Yes, the &lt;code&gt;import&lt;/code&gt; should be scored.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The argument against is that the code could be compiled without it in certain conditions of surrounding code. However, the lambda, though anonymous, is still a function and not a snippet, and this is what makes it an acceptable answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To stand alone, the types of the arguments must be accessible, and as such the &lt;code&gt;import&lt;/code&gt; should be scored.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More generally, types used as Java lambda parameters must always be imported (and scored as such) or the parameters must be typed to make the lambda a valid stand-alone solution.&lt;/p&gt;&#xA;" OwnerUserId="51825" LastEditorUserId="51825" LastEditDate="2017-07-29T01:05:34.153" LastActivityDate="2017-07-29T01:05:34.153" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="8784" PostTypeId="2" ParentId="8771" CreationDate="2016-03-23T19:49:22.253" Score="4" Body="&lt;h2&gt;Our community is growing.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In chat, as on main and meta, beyond a certain level of activity it becomes unfeasible for an individual to read through every post. We are approaching the point where activity on chat will be too much to read the transcript in full &lt;em&gt;even with all off topic content excluded&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This doesn't mean we shouldn't try to improve things, but the solutions we find or make cannot be limited only to narrowing the topic of conversation. By all means encourage chatters to be reasonable and respect the chat community, but we're going to need something more in addition to that before long.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Stack Exchange already solves the major problem: It is not necessary for everyone (or anyone) to read every post on main, meta or chat. The community as a whole takes care of it. However, until recently it was in principle possible for an individual to read the entire chat transcript by catching up each day. As this becomes less practical, it can be frustrating for people who want to keep up to date.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Making an &quot;off topic&quot; chat room seems like a bad idea at present, since the activity level of The Nineteenth Byte is part of what makes it so useful for questions at short notice. However, as our community grows it may become more viable. Purely the on topic activity may become sufficient. It might be worth looking at what other sites with much bigger/more active chat communities do.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2016-03-23T19:49:22.253" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8785" PostTypeId="2" ParentId="8752" CreationDate="2016-03-23T21:29:30.190" Score="-6" Body="&lt;h1&gt;What are your weaknesses?&lt;/h1&gt;&#xA;&lt;p&gt;Everybody is human and has faults; its important to recognize them.&lt;/p&gt;&#xA;&lt;p&gt;What parts of moderation do you think you would struggle with the most?&lt;/p&gt;&#xA;&lt;p&gt;How do you plan on improving in those areas?&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;Perhaps this is too interview-y, but I feel that its important.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-23T21:29:30.190" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8788" PostTypeId="1" CreationDate="2016-03-24T19:34:19.527" Score="14" ViewCount="464" Body="&lt;p&gt;In light of a &lt;a href=&quot;https://codegolf.stackexchange.com/q/76131/20469&quot;&gt;recent code golf challenge&lt;/a&gt; in which the specification restricts participation to JavaScript, I think it's time we revisited making a hard rule about language-specific golfs. We may &lt;em&gt;discourage&lt;/em&gt; such challenges, but ultimately they &lt;em&gt;aren't&lt;/em&gt; off topic. Consider Sklivvz's comment:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Either single language questions are forbidden or they aren't. If they are forbidden, close this. If they are allowed, let the OP restrict the question as they like.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;There are situations in which language-specific challenges make sense, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;. I'm not talking about those. For &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, do we have a good reason to allow them at all? We already discourage them, and arguably it falls under the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8058/20469&quot;&gt;things to avoid when writing challenges&lt;/a&gt;, since it disallows all languages but the one specified.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we make a rule explicitly banning code golf challenges that are specific to a single language?&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2016-03-24T23:50:53.247" Title="Should language-specific code golf challenges be explicitly disallowed?" Tags="|discussion|policy|code-golf|rules|" AnswerCount="3" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8789" PostTypeId="2" ParentId="8788" CreationDate="2016-03-24T19:42:43.030" Score="-7" Body="&lt;h2&gt;Yes, language-specific challenges should be disallowed.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There is no good reason to make challenges language specific.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want longer languages to have an advantage, then reconsider your policies.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the challenge can only be done in a certain language then it either:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;May not be a good challenge idea.&lt;/li&gt;&#xA;&lt;li&gt;Leave it open for other languages, if they can find a way, that's great.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Non-code golf challenges don't follow these rules.&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="46271" LastEditDate="2016-03-24T20:00:21.400" LastActivityDate="2016-03-24T20:00:21.400" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8790" PostTypeId="2" ParentId="8788" CreationDate="2016-03-24T19:56:43.040" Score="20" Body="&lt;h2&gt;No (with caveats) -- Language-specific challenges are on-topic&lt;/h2&gt;&#xA;&lt;p&gt;Challenge authors are allowed to add other arbitrary restrictions (banning built-ins, banning capital letters, requiring out to be base-10 integers, etc.), and so requiring all answers to be in one language should be treated no different; it's just another method of restricting answers.&lt;/p&gt;&#xA;&lt;h3&gt;That said ...&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The challenge should &lt;em&gt;explicitly require&lt;/em&gt; some feature of that language to make sense. Arbitrarily restricting a challenge to a particular language should be downvoted/off-topic'd appropriately. An example would be the various regex-golf challenges, which &lt;em&gt;require&lt;/em&gt; the answer(s) to be regex for the challenge to make sense, or the &lt;a href=&quot;https://codegolf.stackexchange.com/q/70361/42963&quot;&gt;Official Dyalog APL 2016 Year Game&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;If a challenge author desires a particular language answer, but is open to allowing all languages to compete, they should consider making the challenge all-inclusive with a bounty for an answer in that particular language. This should be the default.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-24T19:56:43.040" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8791" PostTypeId="2" ParentId="8788" CreationDate="2016-03-24T23:13:00.330" Score="17" Body="&lt;h2&gt;Only allow challenges to restrict languages indirectly via requirements&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The one good reason for a challenge to restrict languages is that the spec makes sense only for languages with certain features or properties. So, let specs have requirements that not all languages meet, but don't allow them to whitelist or blacklist languages by name.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if a challenge relies on variables having declared types and there's no way to get around that, it's OK to require this so that only languages with declared types can participate. It's not OK to make the challenge Java only for this reason.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's two advantages I see over simply allowing language restrictions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Posters can't limit languages without reason. The limitation automatically requires some element of the spec that only certain languages satisfy.&lt;/li&gt;&#xA;&lt;li&gt;The restriction is as loose as possible. All languages that fit the requirements can participate, even ones the asker was not aware of.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;It's OK if the limitations are so restrictive that only one language qualifies, and if the asker says what language they're aiming for. This rule is not meant to prevent a challenge from being language-specific if necessary, but to ensure that the restriction necessarily follows from the spec.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2016-03-24T23:50:53.247" LastActivityDate="2016-03-24T23:50:53.247" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8792" PostTypeId="2" ParentId="2140" CreationDate="2016-03-24T23:16:35.783" Score="0" Body="&lt;h1&gt;Factorize Gaussian Integer&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/complex-numbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;complex-numbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;complex-numbers&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a nonzero gaussian integer your program/function should return the factorization of that integer &lt;code&gt;g&lt;/code&gt; into prime factors &lt;code&gt;pi&lt;/code&gt; and an unit &lt;code&gt;u&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;g = u * p1^e1 * ... * pk^ek&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;As the factorization is only unique up to units, we make following restrictions&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;All primes should &lt;code&gt;p&lt;/code&gt; should be in the first quadrant, that means that &lt;code&gt;Re(p) &amp;gt; 0&lt;/code&gt; and &lt;code&gt;Im(p) ≥ 0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The unit should be represented as power of &lt;code&gt;i&lt;/code&gt;. It should have the lowest nonnegative exponent.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The primefactors should be sorted by the real part increasingly. If two real parts are the same, they should be sorted by imaginary part (also increasing.)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;11-27i = i^2*(1+i)*(2+i)^2*(4+i)&#xA;2     = i^3*(1+i)^2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;To be added: Examples, input output spec&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Table_of_Gaussian_integer_factorizations&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://en.wikipedia.org/wiki/Table_of_Gaussian_integer_factorizations&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/35881/is-gaussian-primez&quot;&gt;is_gaussian_prime(z)?&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://stackoverflow.com/a/2271645/2913106&quot;&gt;https://stackoverflow.com/a/2271645/2913106&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-26T14:35:51.840" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8793" PostTypeId="2" ParentId="8749" CreationDate="2016-03-24T23:24:56.777" Score="6" Body="&lt;h2&gt;Proposed wording for Help Center&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Make a serious effort towards optimizing for the winning criteria&#xA;  within their chosen language.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In context, this would be:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;All &lt;strong&gt;solutions&lt;/strong&gt; to challenges should:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Correctly implement the required specification.&lt;/li&gt;&#xA;  &lt;li&gt;Make a serious effort towards optimizing for the winning criteria within their chosen language. For example, an entry to a code golf contest needs to be golfed, and an entry to a speed contest should make some attempt to be fast.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The wording is taken from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8750/20260&quot;&gt;Mego's answer&lt;/a&gt;, somewhat condensed for brevity.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2016-03-24T23:24:56.777" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8794" PostTypeId="2" ParentId="8752" CreationDate="2016-03-25T02:35:30.793" Score="0" Body="&lt;p&gt;Would you agree that we (as a community) are sometimes too quick to close questions as duplicate/unclear/opinion-based/too broad, when not obviously warranted, and that tends to discourage (especially new) users from participating? If you agree, what do you plan to do about that?&lt;/p&gt;&#xA;" OwnerUserId="7416" LastActivityDate="2016-03-25T02:35:30.793" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8795" PostTypeId="2" ParentId="8752" CreationDate="2016-03-25T02:44:08.907" Score="2" Body="&lt;p&gt;What would you change to help new users get up to speed with the rules and procedures we have here regarding posting good questions and answers?&lt;/p&gt;&#xA;" OwnerUserId="7416" LastActivityDate="2016-03-25T02:44:08.907" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8796" PostTypeId="2" ParentId="2140" CreationDate="2016-03-25T14:27:20.810" Score="0" Body="&lt;h2&gt;Calculate the last N digits of Graham's Number&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Write a function or program that, given an integer &lt;code&gt;x&lt;/code&gt;, outputs the rightmost &lt;code&gt;x&lt;/code&gt; digits of &lt;a href=&quot;https://en.wikipedia.org/wiki/Graham%27s_number&quot; rel=&quot;nofollow noreferrer&quot;&gt;Graham's Number&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may not hardcode the answer in&lt;/li&gt;&#xA;&lt;li&gt;You may not fetch the answer from an external file or library&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Scoring:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Will be tested over 100 iterations on my machine with an average time given for different &lt;code&gt;x&lt;/code&gt; values&lt;/li&gt;&#xA;&lt;li&gt;To Be Decided... (Input would be appreciated)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="47302" LastEditorUserId="47302" LastEditDate="2016-03-25T16:58:53.017" LastActivityDate="2016-03-25T16:58:53.017" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8797" PostTypeId="2" ParentId="8752" CreationDate="2016-03-25T15:02:55.233" Score="8" Body="&lt;p&gt;This is one of the questions listed in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8753/14215&quot;&gt;default set&lt;/a&gt;, but not guaranteed to show up unless it's split off and voted on. I think it's important, though, and would like to see it asked (and expanded on a bit):&lt;/p&gt;&#xA;&lt;h3&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep?&lt;/h3&gt;&#xA;&lt;p&gt;This has different implications for different candidates, as some have already reached the permissions thresholds.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;For high-rep candidates:&lt;/strong&gt; What are you looking to gain with the diamond (or what do you feel you &lt;em&gt;have&lt;/em&gt; gained if you have one)? As a fully-privileged user (on beta at least, I'll be missing the 20k mark when the limits change), I truly don't feel I need a diamond to help the site in many various ways. Why do you?&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;For lower-rep candidates:&lt;/strong&gt; Why should these tools (and more) be given to you, instead of having to earn them the usual way? In what way are you more qualified than someone who already has many of these tools and has proven they can use them responsibly?&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-25T15:02:55.233" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8798" PostTypeId="1" CreationDate="2016-03-25T16:30:55.043" Score="45" ViewCount="2729" Body="&lt;p&gt;I feel like we may have enough data on this site to meaningfully break programming languages into classes.&lt;/p&gt;&#xA;&lt;p&gt;What I mean by classes is akin to &lt;a href=&quot;https://en.wikipedia.org/wiki/Go_ranks_and_ratings&quot; rel=&quot;nofollow noreferrer&quot;&gt;Go's ranking system&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;If a player can win 90% of even games against a 2 kyu player, the AGA believes he or she is 1.33 ranks higher, the EGF believes (s)he is 2.42 ranks higher, and the IGS believes (s)he is more than 3 ranks higher.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;We may need to break the competition down into tags (e.g., a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; puzzle may have a different ranking system than a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt; puzzle (cough, Bubblegum).&lt;/p&gt;&#xA;&lt;p&gt;The use case for this would be to more reasonably compare your success - If a Python answer beats one in J, the author should be pretty proud.  If Pyth beats Java by just a bit, the Java author should also be pretty happy with themselves (or the Pyth author ashamed).&lt;/p&gt;&#xA;&lt;p&gt;Would anyone be interested in this endeavor?&lt;/p&gt;&#xA;" OwnerUserId="13950" LastEditorUserId="66833" LastEditDate="2021-01-21T12:57:42.223" LastActivityDate="2024-03-27T13:15:28.420" Title="Golfing Class of a language" Tags="|discussion|code-golf|statistics|" AnswerCount="2" CommentCount="15" ContentLicense="CC BY-SA 4.0" />
  <row Id="8799" PostTypeId="2" ParentId="2140" CreationDate="2016-03-25T22:46:57.590" Score="0" Body="&lt;h1&gt;Paint the Mona Lisa in 1 KiB of code&lt;/h1&gt;&#xA;&lt;h2&gt;** Oops, it seems that &lt;a href=&quot;https://codegolf.stackexchange.com/q/69930/7416&quot;&gt;something like this&lt;/a&gt; has already been posted (and I didn't know about it before), but please read the last section below&lt;/h2&gt;&#xA;&lt;p&gt;This is my attempt to salvage &lt;a href=&quot;https://codegolf.stackexchange.com/q/69232/7416&quot;&gt;this challange&lt;/a&gt; by Nathaniel, which was deleted after getting no less than 19 upvotes.&lt;/p&gt;&#xA;&lt;p&gt;Here is a picture of da Vinci's Mona Lisa:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/T80Hom.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/T80Hom.jpg&quot; alt=&quot;Mona Lisa&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to reproduce the Mona Lisa in 1024 bytes or less. You will write a program or function that takes no input and loads no files, and outputs an image file.&lt;/p&gt;&#xA;&lt;p&gt;The goal of this challenge is to produce an image that is as close as possible to the Mona Lisa above. The image must have the same resolution, and the similarity/difference will be measured by the &lt;a href=&quot;https://en.wikipedia.org/wiki/Root-mean-square_deviation&quot; rel=&quot;nofollow noreferrer&quot;&gt;root-mean-square deviation&lt;/a&gt; (at the color component level) between the two images. That will be the only criterion for the score, but people are still free to reward interesting answers by upvoting them (as always).&lt;/p&gt;&#xA;&lt;p&gt;Your code (program or function) must obey the following restrictions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The code must be no more than 1024 bytes in total (counted in UTF-8 if you use funky characters)&lt;/li&gt;&#xA;&lt;li&gt;It must output the image in a standard uncompressed format such as BMP or PPM; the image can be written to the standard output or directly to a file&lt;/li&gt;&#xA;&lt;li&gt;The image must have the same resolution as the original - 215 by 320 pixels&lt;/li&gt;&#xA;&lt;li&gt;The code must be completely self-contained, taking no input and loading no files (other than importing libraries, which is allowed)&lt;/li&gt;&#xA;&lt;li&gt;You may not use built-in or library code that implements a decompression algorithm (unzip, unlzma, jpeg decompression etc). It is fine to use such algorithms if you implement them yourself within the 1024 byte limit.&lt;/li&gt;&#xA;&lt;li&gt;If your language or library includes a function that outputs the Mona Lisa, you are not allowed to use that either.&lt;/li&gt;&#xA;&lt;li&gt;It should run deterministically, producing the same output every time.&lt;/li&gt;&#xA;&lt;li&gt;Your code must be runnable in Linux using freely available software&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;It is possible that some submissions will themselves be generated by code. If this is the case, please include in your answer the code that was used to produce your submission, and explain how it works. The above restrictions do not apply to code used to create the code, they only apply to the 1024-byte code that produces the output image.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;TODO:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;provide code to calculate the score&lt;/li&gt;&#xA;&lt;li&gt;use a better-quality image?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Duplicate?&lt;/h2&gt;&#xA;&lt;p&gt;Well, some may argue that this is a duplicate of the &lt;a href=&quot;https://codegolf.stackexchange.com/q/69930/7416&quot;&gt;Starry Night challenge&lt;/a&gt;, but I think it differs in at least 3 ways:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;uncompressed output&lt;/li&gt;&#xA;&lt;li&gt;no prewritten decompressor allowed&lt;/li&gt;&#xA;&lt;li&gt;UTF-8 byte count&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Also, the image is not the same so it may not benefit from all the same techniques (I'm also open to using a different image altogether, such as the one from &lt;a href=&quot;https://codegolf.stackexchange.com/q/71363/7416&quot;&gt;this other deleted challenge&lt;/a&gt; by Nathaniel).&lt;/p&gt;&#xA;&lt;p&gt;If you have any other ideas how to improve the challenge, let me know.&lt;/p&gt;&#xA;" OwnerUserId="7416" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-25T23:57:29.070" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8802" PostTypeId="2" ParentId="8798" CreationDate="2016-03-27T04:09:38.287" Score="21" Body="&lt;h2&gt;K-means clustering by code length&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; This is just a first-pass attempt with a very simple method. There are certainly better ways to approach this but at least this is a start.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My approach here was to get all answers to code golf challenges without bonuses that had (at least somewhat) appropriately formatted post headers, parse out the language name and byte count from the header, perform k-means clustering on the sizes with 6 groups, and for each language select the cluster into which most of the sizes for that language fell. Languages which have been used fewer than 10 times on the site, as well as any answer with a byte count greater than 170, were excluded.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The clusters are listed in ascending order of the values of their cluster centers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Group 1, mean 12.03099&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;APL            GS2             Rebmu&#xA;Arcyou         Hexagony        rs&#xA;AutoIt         J               Sed&#xA;Batch          Japt            Self&#xA;BC             Jelly           Seriously&#xA;Beeswax        Jolf            Stuck&#xA;Befunge        K               TeaScript&#xA;Brachylog      Labyrinth       TI-BASIC&#xA;Brainfuck      Marbelous       Vim&#xA;Burlesque      MATL            Vitsy&#xA;Candy          Microscript     zsh&#xA;Clip           Minkolang&#xA;DC             Mouse&#xA;DUP            O&#xA;Element        Piet&#xA;ESMin          Pip&#xA;Factor         Platypar&#xA;Fission        Prelude&#xA;Gema           Pyth&#xA;GolfScript     QBASIC&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Group 2, mean 31.75217&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;lt;&amp;gt;&#xA;CJam&#xA;Dart&#xA;F#&#xA;GTB&#xA;JQ&#xA;Julia&#xA;KDB&#xA;Mathematica&#xA;Matlab&#xA;Milky Way&#xA;PARI/GP&#xA;Perl&#xA;Q&#xA;Rebol&#xA;Regex&#xA;Scheme&#xA;Shell&#xA;Snails&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Group 3, mean 54.14769&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Awk&#xA;Bash&#xA;Clojure&#xA;D&#xA;Foo&#xA;Forth&#xA;Game Maker Language&#xA;Hassium&#xA;Pascal&#xA;PowerShell&#xA;R&#xA;Retina&#xA;Ruby&#xA;Sclipting&#xA;Smalltalk&#xA;Stata&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Group 4, mean 79.65123&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;BBC Basic        Scala&#xA;CoffeeScript     SQL&#xA;Common Lisp      Swift&#xA;CSS              TCL&#xA;Emacs Lisp       VB.NET&#xA;Fortran          VBScript&#xA;GolfLua&#xA;Groovy&#xA;Haskell&#xA;JavaScript&#xA;Lua&#xA;Mumps&#xA;PHP&#xA;Processing&#xA;Prolog&#xA;Python&#xA;Racket&#xA;Rust&#xA;Sage&#xA;SAS&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Group 5, mean 109.9524&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;C&#xA;C++&#xA;Ceylon&#xA;Delphi&#xA;Erlang&#xA;Gawk&#xA;Java&#xA;Postscript&#xA;VBA&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Group 6, mean 147.5168 &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;AppleScript&#xA;C#&#xA;Cobra&#xA;Go&#xA;HTML&#xA;OCaml&#xA;SpecBAS&#xA;Whitespace&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Thoughts on this grouping&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is roughly what one might expect, with the golfing languages in tier 1 and Java in tier 5. This particular grouping appears to be somewhat of a success in that regard. However, 6 was probably too many groups; 4 or 5 would likely be sufficient. Heirarchical clustering may be another interesting route for analysis since no number of classes is prespecified.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Disclaimer&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This should &lt;strong&gt;not&lt;/strong&gt;, &lt;em&gt;under any circumstances&lt;/em&gt;, be used to impose any kind of language handicap or restriction. It's merely for the sake of interest and giving folks a group to mentally compare their scores to, should they feel the need.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;For the curious&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The data were collected via &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/459681&quot; rel=&quot;nofollow&quot;&gt;this Stack Exchange Data Explorer query&lt;/a&gt;. The analysis was done in R and is available via &lt;a href=&quot;https://gist.github.com/ararslan/f9418ba838a788ea0341&quot; rel=&quot;nofollow&quot;&gt;this Gist&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="20469" LastEditDate="2016-03-27T18:17:15.873" LastActivityDate="2016-03-27T18:17:15.873" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="8805" PostTypeId="2" ParentId="2140" CreationDate="2016-03-28T15:16:28.137" Score="2" Body="&lt;h1&gt;Wargame Tank Simulation&lt;/h1&gt;&#xA;&lt;p&gt;Some of you may have heard of the Wargame series of computer based real time strategy game.  These games pit teams of players with primarily cold war era units to see how a hot cold war would have played out.  The goal of this challenge is to simulate a tank battle in these games.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Two &amp;quot;tanks&amp;quot; (one red and one blue) will be entered into your program or function.  Each tank is classified by a rate of fire, accuracy, armor value, and attack power value.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;From the inputs above, simulate the two tanks fighting.  You will do this by having each tank fire according to its rate of fire.  If it hits (randomly determined by accuracy), a tank will do damage according to the armor value of its target and its own attack power.  The formula for damage is &lt;code&gt;floor[(attackpower - armor)/2]&lt;/code&gt;.  Therefore a tank with 10 attack power against a tank with 5 armor would do 2 damage.&lt;/p&gt;&#xA;&lt;p&gt;Tank crews also have morale, which follows the following rule&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are four possible morale values; calm, worried, scared, and panicked. Tanks always start calm.  These names do not need to be in your code, in the sample below I've used calm = 1, worried = 2, etc.&lt;/li&gt;&#xA;&lt;li&gt;Each morale value reduces the accuracy as follows: Calm -&amp;gt; 100% (no change), worried -&amp;gt; 75%, scared -&amp;gt; 50%, panicked -&amp;gt; 25%.   Therefore a panicked tank which normally has 60% accuracy now has 0.25 * 0.6 = 15% accuracy&lt;/li&gt;&#xA;&lt;li&gt;Each hit by the opposing tank degrades morale by one level, each miss upgrades the morale by one level.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;morale: calm  |  worried  |  calm  |  worried  |  scared&#xA;hit:         hit         miss     hit         hit&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input should be two parameters to repesent each tank (I've used two tuples in the example below). Inputs may be provided in any order, just be sure to state which one is which. Input may be provided by user input via STDIN, read from a file, or parameters passed to a function call.&lt;/li&gt;&#xA;&lt;li&gt;Each tank starts with 10 health.&lt;/li&gt;&#xA;&lt;li&gt;Rate of fire will either be 8.5, 7.5, 6.5, 6, or 5 seconds between shots.&lt;/li&gt;&#xA;&lt;li&gt;Tanks start loaded, so each fires at time = 0.  Because Communists are sneaky, red fires first.&lt;/li&gt;&#xA;&lt;li&gt;Accuracy must be randomly rolled.&lt;/li&gt;&#xA;&lt;li&gt;Ineffective hits (hits which do no damage) have an effect on morale! (because it probably sounds terrifying)&lt;/li&gt;&#xA;&lt;li&gt;Naturally since we want to see the action, output will be an update after each shot.  The update will contain the time of the shot, whom it was made by (red or blue), health of both tanks, and the morale of both tank crews.  Output maybe be presented in any format so long as it contains all of the required information in a human readable fashion (items must be delimited in some way).  Similar to input, please describe your output format in the answer.&lt;/li&gt;&#xA;&lt;li&gt;Engagements are limited to 100 seconds. If you play the game you know this is because a plane has swooped in by then.  For our purposes if both tanks are alive at this point, it is a draw.&lt;/li&gt;&#xA;&lt;li&gt;After one tank reaches 0 health (or after 100 seconds), print which tank is victorious (&lt;code&gt;&amp;quot;Red&amp;quot;&lt;/code&gt; or &lt;code&gt;&amp;quot;Blue&amp;quot;&lt;/code&gt;) or &lt;code&gt;&amp;quot;Draw&amp;quot;&lt;/code&gt; if appropriate.  I don't care about  trailing whitespace or newlines.&lt;/li&gt;&#xA;&lt;li&gt;Printint output may be printing to STDOUT or writing to a file&lt;/li&gt;&#xA;&lt;li&gt;Shortest answer in bytes wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://ideone.com/tTu4uv&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sample Python Implementation&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;import random, math&#xA;&#xA;def Shot_Result(acc, morale, power, armor):&#xA;    Morale = {1: 1., 2: 0.75, 3: 0.5, 4: 0.25}&#xA;    actual_acc = acc * Morale[morale]&#xA;    roll = random.random()&#xA;    if roll &amp;lt; actual_acc:&#xA;        dmg = max(0,math.floor((power-armor)/2))&#xA;    else:&#xA;        dmg = -1&#xA;        &#xA;    return dmg&#xA;    &#xA;    &#xA;def main(Red, Blue):&#xA;    red_rate, red_acc, red_armor, red_pow = Red&#xA;    blue_rate, blue_acc, blue_armor, blue_pow = Blue&#xA;    &#xA;    red_health = blue_health = 10&#xA;    red_morale = blue_morale = 1&#xA;    &#xA;    red_shots = [(&amp;quot;Red&amp;quot;, shot/100.) for shot in range(0,10000,int(red_rate*100))]&#xA;    blue_shots = [(&amp;quot;Blue&amp;quot;, shot/100.) for shot in range(0,10000,int(blue_rate*100))]&#xA;    &#xA;    Shots = sorted(red_shots + blue_shots, key=lambda x: x[1])&#xA;    &#xA;    print &amp;quot;{:^6}|{:^6}|{:^12}|{:^12}|{:^12}|{:^12}|&amp;quot;.format(&amp;quot;Shot&amp;quot;,&amp;quot;Time&amp;quot;,&amp;quot;Red Health&amp;quot;,&amp;quot;Blue Health&amp;quot;,&amp;quot;Red Morale&amp;quot;,&amp;quot;Blue Morale&amp;quot;)&#xA;    &#xA;    for shot in Shots:&#xA;        if shot[0] == &amp;quot;Red&amp;quot;:&#xA;            dmg = Shot_Result(red_acc, red_morale, red_pow, blue_armor)&#xA;            if dmg &amp;gt;= 0:&#xA;                blue_health -= dmg&#xA;                blue_morale = min(blue_morale+1,4)&#xA;            else:&#xA;                blue_morale = max(blue_morale-1,1)&#xA;        else:&#xA;            dmg = Shot_Result(blue_acc, blue_morale, blue_pow, red_armor)&#xA;            if dmg &amp;gt;= 0:&#xA;                red_health -= dmg&#xA;                red_morale = min(red_morale+1,4)&#xA;            else:&#xA;                red_morale = max(red_morale-1,1)&#xA;                &#xA;        print &amp;quot;{:^6}|{:^6}|{:^12}|{:^12}|{:^12}|{:^12}|&amp;quot;.format(shot[0], shot[1], red_health, blue_health, red_morale, blue_morale)&#xA;        &#xA;        if red_health &amp;lt;= 0:&#xA;            print &amp;quot;Blue tank is victorious!&amp;quot;&#xA;            break&#xA;        if blue_health &amp;lt;= 0:&#xA;            print &amp;quot;Red tank is victorious!&amp;quot;&#xA;            break&#xA;    else:        &#xA;        print &amp;quot;It's a draw!&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Sample Output&lt;/strong&gt; (Yours does not need to be this fancy)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; Shot | Time | Red Health |Blue Health | Red Morale |Blue Morale |&#xA; Red  | 0.0  |     10     |    5.0     |     1      |     2      |&#xA; Blue | 0.0  |     10     |    5.0     |     1      |     2      |&#xA; Blue | 6.5  |     10     |    5.0     |     1      |     2      |&#xA; Red  | 8.5  |     10     |    5.0     |     1      |     1      |&#xA; Blue | 13.0 |    5.0     |    5.0     |     2      |     1      |&#xA; Red  | 17.0 |    5.0     |    5.0     |     2      |     1      |&#xA; Blue | 19.5 |    5.0     |    5.0     |     1      |     1      |&#xA; Red  | 25.5 |    5.0     |    5.0     |     1      |     1      |&#xA; Blue | 26.0 |    0.0     |    5.0     |     2      |     1      |&#xA;Blue tank is victorious!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="30170" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-28T16:08:32.683" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8806" PostTypeId="1" CreationDate="2016-03-28T16:49:35.240" Score="2" ViewCount="84" Body="&lt;p&gt;I've written up what I think is a good challenge, gotten feedback in the sandbox, and then posted it to the site.  Upon submitting I'm met with a page that shows:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/iqsdR.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/iqsdR.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When I simply try to resubmit my post, I get a message saying there is a duplicate which links to the above page!  For reference, here is the &lt;a href=&quot;https://codegolf.stackexchange.com/error?aspxerrorpath=/questions/76395/wargame-tank-simulation&quot;&gt;post in question&lt;/a&gt;.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;What happened? Is there anything I did which may not play nice with the site?  How can I post my code challenge?&lt;/p&gt;&#xA;" OwnerUserId="30170" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-03-28T16:57:02.307" Title="What happened to my post?" Tags="|support|status-norepro|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8807" PostTypeId="2" ParentId="8806" CreationDate="2016-03-28T16:51:50.353" Score="3" Body="&lt;h1&gt;This was all SE's fault, obsolete now.&lt;/h1&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-28T16:51:50.353" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8808" PostTypeId="1" CreationDate="2016-03-28T18:17:31.417" Score="25" ViewCount="400" Body="&lt;p&gt;I recently notices that Tex.SE has a &lt;a href=&quot;https://tex.meta.stackexchange.com/q/1436&quot;&gt;Welcome to Tex.SX!&lt;/a&gt; meta post. In it, it describes what the site is and how to use it. It also includes information on the scope. I think this would be a good addition to PPCG. If a new user does not understand how to use the site properly, most users leave a comment saying &amp;quot;Welcome to PPCG.SE! Here are some ways to improve your post: ...&amp;quot;  It would be a good idea to link a &amp;quot;Welcome to PPCG&amp;quot; meta post to those comments to help the new user understand how to post and some of our standard loopholes, for example.&lt;/p&gt;&#xA;Edit:&#xA;&lt;p&gt;As &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8808/should-we-have-a-welcome-to-ppcg-new-user-post#comment25246_8808&quot;&gt;xnor suggested&lt;/a&gt;, this post would be the place where a simple guide to making questions and answers is visible, with suggestions on formatting, containing objective-winning critieria, etc.&lt;/p&gt;&#xA;Edit 2:&#xA;&lt;p&gt;I have drafted an example &lt;a href=&quot;https://stackedit.io/viewer#!provider=gist&amp;amp;gistId=d3b8b180257b1c9ef12292c122b0e732&amp;amp;filename=WelcomeToPPCG&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; based on the Tex.SE one. Ping me in chat with any comments/concerns.&lt;/p&gt;&#xA;" OwnerUserId="36670" LastEditorUserId="66833" LastEditDate="2023-04-01T16:49:51.843" LastActivityDate="2023-04-01T16:49:51.843" Title="Should we have a &quot;Welcome to PPCG&quot; new user post?" Tags="|discussion|status-completed|new-users|meta|" AnswerCount="5" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="8809" PostTypeId="1" CreationDate="2016-03-28T19:50:52.850" Score="0" ViewCount="50" Body="&lt;p&gt;Meta site has a set of special tags: &lt;a href=&quot;/questions/tagged/discussion&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt;&#xA;&lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt;&#xA;&lt;a href=&quot;/questions/tagged/support&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt;&#xA;&lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At least one of them is required to ask a question on meta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What about the main site? Is it possible to make tags with winning creteria required? Also I would've add &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/experimental-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;experimental-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;experimental-challenge&lt;/a&gt; to the list.&lt;/p&gt;&#xA;" OwnerUserId="32091" LastEditorUserId="68942" LastEditDate="2021-06-09T05:43:29.677" LastActivityDate="2021-06-09T05:43:29.677" Title="Required tags on the main site" Tags="|feature-request|status-declined|tags|" AnswerCount="0" CommentCount="0" ClosedDate="2016-03-28T19:53:53.853" ContentLicense="CC BY-SA 3.0" />
  <row Id="8810" PostTypeId="1" CreationDate="2016-03-28T20:02:51.723" Score="22" ViewCount="841" Body="&lt;p&gt;In connection with the moderator elections, we are holding a Q&amp;amp;A thread for the candidates. Questions collected &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8752/2016-moderator-election-qa-question-collection/&quot;&gt;from an earlier thread&lt;/a&gt; have been compiled into this one, which shall now serve as the space for the candidates to provide their answers. Not every question was compiled - as noted, we only selected the top 8 questions as submitted by the community, plus 2 pre-set questions from us. Though two of them were backups of ours, wahaha~ ♪&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a candidate, your job is simple - post an answer to this question, citing each of the questions and then post your answer to each question given in that same answer. For your convenience, I will include all of the questions in quote format with a break in between each, suitable for you to insert your answers. Just &lt;a href=&quot;https://codegolf.meta.stackexchange.com/revisions/9b6c1f16-df19-4b4e-b1a9-d2926510c5d5/view-source&quot;&gt;copy the whole thing after the first set of three dashes&lt;/a&gt;. Oh, and please consider putting your name at the top of your post so that readers will know who you are before they finish reading everything you have written.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once all the answers have been compiled, this will serve as a transcript for voters to view the thoughts of their candidates, and will be appropriately linked in the Election page. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Good luck to all of the candidates!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;&lt;p&gt;A new-ish user posts a well-posed challenge that quickly gets many answers. An hour later, they edit in a restriction that invalidates most of the existing answers. An experienced user whose answer was invalidated comments that doing this is bad, and rolls back the edit. The poster insists on the change and re-adds it, and the two get into an edit war. Someone flags for moderator attention. What would you do in this situation as a moderator?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;What is the threshold for using your mod-hammer vs. letting the community take care of issues? In other words, will you be mostly laissez-faire with posts and let the close/delete vote system sort out the good posts from the bad? Or will you personally decide that a post doesn't meet quality standards and mod-hammer it (note that this does not apply to obvious spam and the like).&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;One of the biggest difficulties for moderators and high-rep users is to distinguish certain posts from being in-scope or not. There are three critical elements of the PPCG.SE scope, namely the three close reasons: Too broad, opinion-based, and unclear what you're asking. What distinguishes a challenge as too broad or opinion-based? How clear does a challenge need to be to be in-scope? Can you specify your limits on these types of close reasons and your definition of each?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep? This has different implications for different candidates, as some have already reached the permissions thresholds. As a high rep, what do you look to gain with a diamond? As a low rep, why should you earn the tools this way rather than by earning reputation?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;How would you deal with a user who produced a steady stream of valuable answers, but tends to generate a large number of arguments/flags from comments?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;How would you handle a situation where another mod closed/deleted/etc a question that you feel shouldn't have been?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;How will you help the site fit in with the SE network better? We are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8350/were-not-a-qa-site-but-what-should-be-done-about-it&quot;&gt;not a Q&amp;amp;A site!&lt;/a&gt; However, a most of the features built in to the site are designed for Q&amp;amp;A sites. Will you effectively be an ambassador for our site, and help us get site-specific customizations to fit our mission better? Or would you help the site narrow it's scope to fit that of a Q&amp;amp;A site better? Something else?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;What would your average moderation schedule be like? When will you be active? What day(s)/time(s) would it be best for people to contact you in case of a need of a moderator? (This is of course an estimated schedule, and nobody will hold you accountable to it)&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;What's your opinion on letting experienced users essentially re-write a challenge that has potential but is badly worded or specified? I've done this once or twice because rewriting is far easier for me than explaining what is wrong (possibly multiple times).&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;A diamond will be attached to everything you say and have said in the past, including questions, answers and comments. Everything you will do will be seen under a different light. How do you feel about that?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="2414" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2017-12-30T12:58:19.893" Title="2016 Moderator Election Q&amp;A - Questionnaire" Tags="|discussion|election|" AnswerCount="8" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8811" PostTypeId="2" ParentId="8570" CreationDate="2016-03-28T20:35:33.160" Score="22" Body="&lt;p&gt;I've disabled auto-protection on this meta site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or rather, set the relevant thresholds (answers from new users) to 10,000. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;That should keep things under control for a few weeks.&lt;/p&gt;&#xA;" OwnerUserId="1144" LastActivityDate="2016-03-28T20:35:33.160" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8812" PostTypeId="1" AcceptedAnswerId="8813" CreationDate="2016-03-28T20:43:02.767" Score="4" ViewCount="119" Body="&lt;p&gt;I was scrolling the &lt;a href=&quot;https://codegolf.stackexchange.com/election/1?tab=primary&quot;&gt;Primaries page&lt;/a&gt;, and clicked the downvote button on a post, yes?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/rqcJY.png&quot; alt=&quot;Single downvote&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ok. This Primary entry had 0 votes, then I downvoted, so it has a score of -1. So far, so good.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I noticed If I click on the number, I can see how many votes it has because I have 1k+ rep.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/FueBv.png&quot; alt=&quot;Full vote score&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;-14 + 6&lt;/code&gt; is still &lt;code&gt;-8&lt;/code&gt;, right? Almost all the other entries at &lt;a href=&quot;https://codegolf.stackexchange.com/election/1?tab=primary&quot;&gt;the Primary submissions page thingy&lt;/a&gt; do the same sort of SE (common core) math.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Wat?&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="66833" LastEditDate="2021-05-13T02:30:40.097" LastActivityDate="2021-05-13T02:30:40.097" Title="Why aren't candidate vote totals accurate?" Tags="|support|election|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8813" PostTypeId="2" ParentId="8812" CreationDate="2016-03-28T20:44:12.130" Score="9" Body="&lt;p&gt;If a candidate is at a negative score, the score will display as your vote.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, if you didn't vote, it will display as 0; if you downvoted, -1, and if you upvoted, 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The same question was &lt;a href=&quot;https://meta.stackexchange.com/q/112127/180276&quot;&gt;asked on Mother Meta&lt;/a&gt;—&lt;a href=&quot;https://meta.stackexchange.com/q/135576/180276&quot;&gt;twice&lt;/a&gt;—presumably the reasoning is provided in the linked duplicate of the first question and the answer of the second question.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2016-03-28T20:50:26.820" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="8814" PostTypeId="2" ParentId="8810" CreationDate="2016-03-28T21:09:07.510" Score="17" Body="&lt;h2&gt;Alex A.&lt;/h2&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;A new-ish user posts a well-posed challenge that quickly gets many answers. An hour later, they edit in a restriction that invalidates most of the existing answers. An experienced user whose answer was invalidated comments that doing this is bad, and rolls back the edit. The poster insists on the change and re-adds it, and the two get into an edit war. Someone flags for moderator attention. What would you do in this situation as a moderator?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I would temporarily lock the post citing content dispute, which is one of the default lock reasons. I would then pull the OP and the editor into chat and explain to them both that this kind of back and forth is solving nothing and that we have to come to an agreement. I would inform the OP that what they've done that's causing the other user to repeatedly edit isn't how we usually do things, citing the necessary meta posts. I'd also tell the other user that if the OP is that determined not to incorporate that change, just let it go; it's not worth the effort. I'd keep the post locked until the two can come to an agreement. If the outcome is that the changes are not incorporated, I would leave a comment on the post telling other users not to similarly edit it in.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;2&quot;&gt;&#xA;  &lt;li&gt;What is the threshold for using your mod-hammer vs. letting the community take care of issues? In other words, will you be mostly laissez-faire with posts and let the close/delete vote system sort out the good posts from the bad? Or will you personally decide that a post doesn't meet quality standards and mod-hammer it (note that this does not apply to obvious spam and the like).&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I never act unilaterally unless I'm quite certain that the action I'd be taking is the right one for the situation. When appropriate, I don't hesitate to close challenges that obviously fall into one of our default close categories: no win condition, no spec (unclear), duplicate. Whenever I'm uncertain what should be done or whether something is off-topic, I let the community do its thing. I also don't moderate in a vacuum; I spend a lot of time in chat interacting both with the community and with the other site moderators. So when situations like this come up, I'll often discuss with folks in chat before taking any action.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;3&quot;&gt;&#xA;  &lt;li&gt;One of the biggest difficulties for moderators and high-rep users is to distinguish certain posts from being in-scope or not. There are three critical elements of the PPCG.SE scope, namely the three close reasons: Too broad, opinion-based, and unclear what you're asking. What distinguishes a challenge as too broad or opinion-based? How clear does a challenge need to be to be in-scope? Can you specify your limits on these types of close reasons and your definition of each?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In my experience, &quot;primarily opinion based&quot; isn't used very often here. There are, however, situations in which it's appropriate, but in those cases &quot;too broad&quot; typically also applies. An example would be a popularity contest without an objective validity criterion, that is, one in which there's no objective way to determine whether any given answer is deserving of votes, up or down. That means that it's &lt;em&gt;entirely&lt;/em&gt; up to the opinion of the viewer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A question should be closed as &quot;unclear what you're asking&quot; when the spec is, well, unclear. Examples would be if certain aspects of the challenge contradict each other, if it's not clear what the input or output should be, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A question should be closed as &quot;too broad&quot; when the challenge requires doing too many disparate, unrelated things, or when the range of what constitutes a valid answer is so broad that answers are not comparable.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;4&quot;&gt;&#xA;  &lt;li&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep? This has different implications for different candidates, as some have already reached the permissions thresholds. As a high rep, what do you look to gain with a diamond? As a low rep, why should you earn the tools this way rather than by earning reputation?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I've been a moderator since August of 2015 and I think I've been able to serve the community much better in this role than I could when I simply had trusted user privileges. I spend a &lt;em&gt;lot&lt;/em&gt; of time on the site, so I'm available to take action swiftly when situations requiring such action arise, rather than raising a flag and hoping it'll be taken care of soon enough.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;High-reputation users are given extended moderation privileges for a reason; they've been around the site and made contributions long enough to know how things work and what is and is not appropriate. Many of the privileges granted to site moderators are for when the tools available to other users aren't sufficient to deal with the situation, for example if a lock, suspension, etc. is in order.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;5&quot;&gt;&#xA;  &lt;li&gt;How would you deal with a user who produced a steady stream of valuable answers, but tends to generate a large number of arguments/flags from comments?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Even with a valued user, bad behavior is bad behavior. It doesn't matter who's doing it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would contact the user via what's called a &quot;mod message,&quot; a special email-like tool available for moderators to contact users privately regarding moderation issues. I would explain the situation, telling them that whatever they've been saying in the comments (with examples provided) is inappropriate. I'd keep an eye on their behavior following the message. If the situation improves, that's fantastic. If the behavior continues or worsens, a suspension may be in order.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;6&quot;&gt;&#xA;  &lt;li&gt;How would you handle a situation where another mod closed/deleted/etc a question that you feel shouldn't have been?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;As I mentioned before, I keep in close contact with the other site mods, so in situations like these, I just ping the one who took action and talk it out. Maybe there's something I hadn't noticed that makes a post deserving of closure, deletion, or whatever. Maybe whatever prompted the other mod to close/delete/whatever has been fixed and the action can be reversed. At least with the current mod team, if another mod has taken action, I can trust that they had good reason to do so.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;7&quot;&gt;&#xA;  &lt;li&gt;How will you help the site fit in with the SE network better? We are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8350/were-not-a-qa-site-but-what-should-be-done-about-it&quot;&gt;not a Q&amp;amp;A site!&lt;/a&gt; However, a most of the features built in to the site are designed for Q&amp;amp;A sites. Will you effectively be an ambassador for our site, and help us get site-specific customizations to fit our mission better? Or would you help the site narrow it's scope to fit that of a Q&amp;amp;A site better? Something else?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I often communicate across the network, both with moderators on other Stack Exchange sites as well as SE developers and community managers, precisely to be an ambassador of sorts for PPCG. I've been in contact with employees regarding various issues, including site-specific customizations like challenge-oriented texts and increasing the reputation awarded for question upvotes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At our core, we aren't a Q&amp;amp;A site. So why should we pretend to be one? Stack Exchange has given us an excellent home here, despite being a bit different than the other sites, and I think we should embrace the difference and make the site our own rather than attempting to narrow our scope into a Q&amp;amp;A site.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;8&quot;&gt;&#xA;  &lt;li&gt;What would your average moderation schedule be like? When will you be active? What day(s)/time(s) would it be best for people to contact you in case of a need of a moderator? (This is of course an estimated schedule, and nobody will hold you accountable to it)&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'm on the site almost constantly, usually in chat as well. (I do sleep occasionally, though.) Typically I'm active from about 3-4 PM UTC to about 6-7 AM UTC. Even when I'm focused on other things, I have my sound on so I can respond to chat pings, and I check back onto the site frequently.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;9&quot;&gt;&#xA;  &lt;li&gt;What's your opinion on letting experienced users essentially re-write a challenge that has potential but is badly worded or specified? I've done this once or twice because rewriting is far easier for me than explaining what is wrong (possibly multiple times).&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I recommend obtaining clarifications in the comments as a first step so that the OP can make changes to the post in his or her own words. This is important because maybe what you thought they were trying to convey isn't quite right, so if you edit it into something else, it could upset the OP. I like to ensure that challenge authors have as much creative control over their posts as possible (provided they stay within our rules). If you do go ahead and edit the post, make sure you leave a brief comment summarizing what you changed and mention that the OP can roll back the edit if it isn't what they had in mind. Meanwhile, if the challenge is unclear and/or undergoing significant edits, it should be closed as unclear until things are sorted out.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;10&quot;&gt;&#xA;  &lt;li&gt;A diamond will be attached to everything you say and have said in the past, including questions, answers and comments. Everything you will do will be seen under a different light. How do you feel about that?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It hasn't bothered me so far! I like to think that I'm a friendly face for PPCG and given how moderators are often seen differently than other users, I think having someone with my friendly demeanor, (I hope!) helpful comments, sense of humor, and desire to help gives a good first impression for new users of the kind of people who have been selected to help moderate the community.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="59487" LastEditDate="2017-12-30T12:58:19.893" LastActivityDate="2017-12-30T12:58:19.893" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8815" PostTypeId="2" ParentId="8810" CreationDate="2016-03-28T21:16:12.567" Score="7" Body="&lt;h2&gt;Chris Jester-Young (non-competing)&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;A new-ish user posts a well-posed challenge that quickly gets many answers. An hour later, they edit in a restriction that invalidates most of the existing answers. An experienced user whose answer was invalidated comments that doing this is bad, and rolls back the edit. The poster insists on the change and re-adds it, and the two get into an edit war. Someone flags for moderator attention. What would you do in this situation as a moderator?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I would create a private chatroom and bring both the OP and the complainant into it, with the aim of reaching an acceptable middle ground.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In terms of my personal biases, I would side towards the idea of creating a new question with the added restriction (assuming that it actually adds value to the site); if the original question is not useful without the restriction (e.g., the restriction is there to block crazy trivial answers), I may additionally close the original question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Either way, existing answers are not &quot;compromised&quot;. People who posted answers on the original thread are welcome to cut and paste their answer to the new one, if still valid.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;2&quot;&gt;&#xA;  &lt;li&gt;What is the threshold for using your mod-hammer vs. letting the community take care of issues? In other words, will you be mostly laissez-faire with posts and let the close/delete vote system sort out the good posts from the bad? Or will you personally decide that a post doesn't meet quality standards and mod-hammer it (note that this does not apply to obvious spam and the like).&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I tend to be very hands-off, especially with comment flags; I'm of the camp that feels that comments are more useful than not. During my time as a moderator, I tended to reject comment flags unless the comment clearly has &quot;passed its use-by date&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In borderline cases, I leave the flag untouched and let one of the other moderators decide what to do.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;3&quot;&gt;&#xA;  &lt;li&gt;One of the biggest difficulties for moderators and high-rep users is to distinguish certain posts from being in-scope or not. There are three critical elements of the PPCG.SE scope, namely the three close reasons: Too broad, opinion-based, and unclear what you're asking. What distinguishes a challenge as too broad or opinion-based? How clear does a challenge need to be to be in-scope? Can you specify your limits on these types of close reasons and your definition of each?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Too broad:&lt;/strong&gt; Each challenge should have a clear goal in what every entry should do. Some goals, of course, are more specific (e.g., Kolmogorov complexity) than others (e.g., King of the Hill), but in each case, the expectation of an entry's behaviour should be clear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Opinion-based:&lt;/strong&gt; Each challenge needs to be clear about what the winning criteria are, so that anyone who visits a challenge can optimise for those criteria, and know that it's not at the whim of the OP (nor, ideally, at the whim of the audience, but I've lost the no-popcon campaign a long time ago ;-)).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;In-scope:&lt;/strong&gt; A challenge needs to be solvable with code. Oh, and it needs to actually be a challenge, not a programming question. :-) A challenge is one where multiple answers are possible and likely not to all be the same as all other entries, and likely involves some degree of creativity to optimise, whether in making the code as short as possible (for golfs), as elegant as possible (for some kinds of popcons), as &quot;survivalist&quot; as possible (for King of the Hill), etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would generally try to triage a post based on how salvageable it is in terms of coming into compliance with our challenge criteria, and suggest ways for the OP to improve the question if possible (with a friendly reminder that they should prefer to go through the Sandbox first). If it's really seriously off, I would close the question immediately.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;4&quot;&gt;&#xA;  &lt;li&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep? This has different implications for different candidates, as some have already reached the permissions thresholds. As a high rep, what do you look to gain with a diamond? As a low rep, why should you earn the tools this way rather than by earning reputation?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I find the user annotation system really helpful for getting context into a user's pattern of behaviour. It enables me to get clarification from the annotating moderator before I act, in some cases.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;5&quot;&gt;&#xA;  &lt;li&gt;How would you deal with a user who produced a steady stream of valuable answers, but tends to generate a large number of arguments/flags from comments?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I would try to bring the flags and arguments to the attention of the user via a moderator message (and/or a private chat room, if more interactivity is needed). I'd try to figure out what the rationale behind the behaviour is, and try to find a way to accommodate those, if at all possible, in a way consistent with the community code of conduct.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If no agreement can be reached, I'd explain to the user that as much as I appreciate their contributions, I still expect their conduct to comply with our community rules (and I still expect to enforce them), and that if they can't abide by that, our community may not be the best for them to participate in.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;6&quot;&gt;&#xA;  &lt;li&gt;How would you handle a situation where another mod closed/deleted/etc a question that you feel shouldn't have been?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I would message that mod directly in the mod-only chat room and ask them for their reasons, and try to put forth mine. I would also hope this would be an opportunity for the other mods to see the exchange and pipe in with their views so we can reach a consensus.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;7&quot;&gt;&#xA;  &lt;li&gt;How will you help the site fit in with the SE network better? We are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8350/were-not-a-qa-site-but-what-should-be-done-about-it&quot;&gt;not a Q&amp;amp;A site!&lt;/a&gt; However, a most of the features built in to the site are designed for Q&amp;amp;A sites. Will you effectively be an ambassador for our site, and help us get site-specific customizations to fit our mission better? Or would you help the site narrow it's scope to fit that of a Q&amp;amp;A site better? Something else?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;During my time as an employee of Stack Exchange, I have often floated customisations for PPCG to enable our community workflow to be better accommodated. For example, some of the customisations enabled during my time included &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/3616/3&quot;&gt;SoundCloud support&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2562/3&quot;&gt;MathJax support&lt;/a&gt; (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5056/3&quot;&gt;later undone because it conflicted with too much existing entries&lt;/a&gt;), lowering the meta participation threshold to 1 so the Sandbox can be used by newcomers, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I generally side towards making the platform work better for our community where feasible. I don't believe in trying to reshape our community into a Q&amp;amp;A community.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;8&quot;&gt;&#xA;  &lt;li&gt;What would your average moderation schedule be like? When will you be active? What day(s)/time(s) would it be best for people to contact you in case of a need of a moderator? (This is of course an estimated schedule, and nobody will hold you accountable to it)&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;N/A since I've withdrawn my nomination, but were I to do it, I would section off an hour everyday, either early morning or late evening (US Eastern Time).&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;9&quot;&gt;&#xA;  &lt;li&gt;What's your opinion on letting experienced users essentially re-write a challenge that has potential but is badly worded or specified? I've done this once or twice because rewriting is far easier for me than explaining what is wrong (possibly multiple times).&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Yes, I'm in support of this, because I believe that challenges are &quot;public property&quot; once posted. That is also in line with the broader Stack Exchange philosophy of questions and answers being editable by (most) users, with the expectation that they do it only in good faith, and without intent to drastically alter the intent of the post.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;10&quot;&gt;&#xA;  &lt;li&gt;A diamond will be attached to everything you say and have said in the past, including questions, answers and comments. Everything you will do will be seen under a different light. How do you feel about that?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'm obviously used to that, both back when I was an employee last year and as a pro tem for the 4 years before that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I clearly prefix a post with &quot;I'm posting this as a normal (albeit opinionated) user and not as a moderator/employee&quot; when I have something opinionated to say that shouldn't been seen as rubberstamping.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Please feel free to request clarifications, or ask further questions, via comments! Even though I'm not running as a mod this time, I have a lot of things to say about moderatorship, having been in the game for so long. :-)&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2016-03-28T21:27:28.823" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="8817" PostTypeId="2" ParentId="8810" CreationDate="2016-03-28T22:07:13.093" Score="16" Body="&lt;h2&gt;Martin Büttner&lt;/h2&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;A new-ish user posts a well-posed challenge that quickly gets many answers. An hour later, they edit in a restriction that invalidates most of the existing answers. An experienced user whose answer was invalidated comments that doing this is bad, and rolls back the edit. The poster insists on the change and re-adds it, and the two get into an edit war. Someone flags for moderator attention. What would you do in this situation as a moderator?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I believe we don't have a real, recent consensus on the matter of challenge ownership. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/4662/8478&quot;&gt;There is this post from more than a year ago&lt;/a&gt; but I'm not entirely sure it covers all the nuances, especially not the question of what to do when the original author disagrees with the improvement. Rollback wars can be an issue on any SE site, not just here. It's just that here the prospect of invalidating answers makes matters even worse. In the absence of an explicit policy on meta, I would probably grant the original author the right to include the additional restriction. It may be an unpopular or unfortunate change, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7786/8478&quot;&gt;but rule changes are allowed&lt;/a&gt; although they're often a bad idea. Depending on whether the invalidating restriction actually improves the challenge, I would also leave a comment with a recommendation to rethink whether the restriction is really necessary, and would warn the author that this change may attract downvotes. However, for low-rep users whose edits go through the review queue, there is a reject reason if the edit &quot;conflicts with the author's intent&quot;, and this is clearly the case for the edit made by the hypothetical high-rep user in the above scenario, so I think it would be original author's privilege to decide on the final form of the post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It would probably be good to have a clearer picture on the question of challenge ownership though, and we should probably discuss this some time on meta — ideally before the above situation occurs.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;2&quot;&gt;&#xA;  &lt;li&gt;What is the threshold for using your mod-hammer vs. letting the community take care of issues? In other words, will you be mostly laissez-faire with posts and let the close/delete vote system sort out the good posts from the bad? Or will you personally decide that a post doesn't meet quality standards and mod-hammer it (note that this does not apply to obvious spam and the like).&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'm fully aware that &lt;a href=&quot;https://meta.stackexchange.com/questions/41062/add-a-way-for-moderators-to-cast-a-normal-non-binding-close-open-vote#comment92117_41333&quot;&gt;I don't have a close &lt;em&gt;vote&lt;/em&gt;&lt;/a&gt;. If I'm at all in doubt, I will refrain from using my mod hammer, or I'll bring it up with the other moderators privately to get some feedback before making a unilateral decision. This is apparent from my review queue stats: the only review queues I'm not leading at the moment are Close and Reopen, because I often skip those when I think the case is sufficiently borderline for the community to find a consensus on its own. That doesn't mean I never use my mod hammer. There are a lot of cases where it's clear. Some popularity contests are obviously too broad (&quot;write any code&quot;), and it's often obvious if a challenge is sufficiently unclear to be closed — if I can find two valid interpretations of the rules, or an important edge case that isn't covered, that's evidence enough that the spec needs to be improved because incoming answers are likely going to solve a different problem than the one the OP intended (to varying degrees). When I do use my mod hammer, I try to keep an eye on the challenge, so I can reopen it once the problems have been fixed, or if it turns out I was mistaken. In any case, I'll almost always accompany the mod hammer with a friendly comment. And I don't view question closure as a punishment or death sentence for the challenge. The main purpose of putting things on hold is to protect the challenge from answers that exploit loopholes, such that the spec can be fixed or improved before that invalidates any answers — so if I have the opportunity to protect such a challenge immediately, I won't hesitate to do so.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;3&quot;&gt;&#xA;  &lt;li&gt;One of the biggest difficulties for moderators and high-rep users is to distinguish certain posts from being in-scope or not. There are three critical elements of the PPCG.SE scope, namely the three close reasons: Too broad, opinion-based, and unclear what you're asking. What distinguishes a challenge as too broad or opinion-based? How clear does a challenge need to be to be in-scope? Can you specify your limits on these types of close reasons and your definition of each?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;For a start, I don't think I've ever used &quot;primarily opinion-based&quot; here. On PPCG that's pretty much always covered by &quot;doesn't have an objective winning criterion&quot;. I suppose &quot;primarily opinion-based&quot; could be used as a stand-in for &quot;doesn't have an objective validity criterion&quot;, but I haven't used it like that so far. Anyway, I'll base this answer on distinguishing between too broad, no objective winning criterion and unclear.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Not having an objective winning criterion is the most obvious one. It's usually very easy to tell whether a question has an objective criterion or not, because most either have an established one (code golf, fastest code, popularity contest), or they don't have one at all. Having a non-objective winning criterion is very rare, but it's a case of &quot;you'll know it when you see it&quot;. Often this is something like accepting the best reproduction of an image without specifying how image similarity is computed, or outright stating that the OP will accept &quot;the most original answer&quot; or something like that. I don't remember any borderline cases for this close vote reason off the top of my head.&lt;/li&gt;&#xA;&lt;li&gt;Unclear what you're asking: this comes in a lot of varieties. As explained in the previous answer, I use this reason quite liberally if I can spot &lt;em&gt;any&lt;/em&gt; holes or ambiguities in the specification. This includes edge cases that aren't covered by the challenge, ambiguous wordings that allow for several valid (but incompatible solutions) or completely missing parts of the specification.&lt;/li&gt;&#xA;&lt;li&gt;The last close reason to consider is too broad. When a challenge does have an objective winning criterion (which includes popularity contests by the current consensus), and it's clear what it's asking it can still be too broad. Popcons are quite often subject to that when they allow people to write any program whatsoever (as long as the source code has property X), or when they just pose some arbitrary programming problem and ask for &quot;the most creative solution&quot;, etc. Since we do allow popcons, the line between too broad and not too broad is often very subjective, and I think this is the close reason I've used least often since becoming a mod. The community is usually quite good and sorting out what is and isn't too broad though.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;4&quot;&gt;&#xA;  &lt;li&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep? This has different implications for different candidates, as some have already reached the permissions thresholds. As a high rep, what do you look to gain with a diamond? As a low rep, why should you earn the tools this way rather than by earning reputation?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Well, having been a moderator for a year, I can say that there are quite a lot of tools available to us that I wouldn't have with my 20k privileges. Of course, a lot of the important parts of site moderation can be done with those tools as well. I'd still have a couple of duplicate hammers, could use the review queues and the 20k moderation tools. However, being a moderator allows me to deal with problem users, detect sock puppets and voting rings and get rid of spam accounts entirely. Luckily, we don't have to use those essential mod tools (that can't be handled by a larger number of regular users) very often in this community, but when we do, they're very important. Another thing that regular users can't really do at all is moderating chat. Yes, regular chat flags exist, but sometimes moderator action is necessary to clean up the mess from an ugly conversation (which luckily, are also rare in The Nineteenth Byte). Finally, and most importantly, moderators sort of act as ambassadors of the community towards the SE team, specifically the community managers. We bring up important feature requests and community-specific issues with them, and hence representing this community and its demands is something I couldn't do as effectively before I became a mod (and would love to continue being able to do).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;5&quot;&gt;&#xA;  &lt;li&gt;How would you deal with a user who produced a steady stream of valuable answers, but tends to generate a large number of arguments/flags from comments?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is of course a very unfortunate situation. While Game of Thrones often depicts rather questionable morals, I think I'll answer this with a quote from Stannis Baratheon:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A good act does not wash out the bad, nor a bad act the good. Each should have its own reward.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Even as a regular user I really try to separate content from user when deciding on how to vote, whether to close, reopen, delete, etc. That includes the user's past or other contributions. If a user who contributes a lot of valuable content is otherwise rude, I will remind them to be friendly, or if necessary talk to them in private, or even suspend them if I have to — just like anyone else. Likewise, if this does happen, I will (try really to) not let this affect how I treat their great content. I would continue upvoting or bountying or referencing it. But contributing great content doesn't allow them to make others feel unwelcome in the community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In short, there is no &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges&quot;&gt;privilege level&lt;/a&gt; for &quot;You're exempt from the Be Nice policy&quot;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;6&quot;&gt;&#xA;  &lt;li&gt;How would you handle a situation where another mod closed/deleted/etc a question that you feel shouldn't have been?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This one is pretty simple: talk to them. In our current mod team, we have a great friendly, communicative culture. All of us chat about mod stuff on a daily basis, and we often discuss things &lt;em&gt;before&lt;/em&gt; acting if action isn't urgent. If someone does act and I don't agree with it, I have no problem asking them about it, and so far we were always able to sort something out among the mod team. Occasionally, this is a sign of our communities policies not being entirely clear, which is a great opportunity to get the community involved via a meta post.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;7&quot;&gt;&#xA;  &lt;li&gt;How will you help the site fit in with the SE network better? We are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8350/were-not-a-qa-site-but-what-should-be-done-about-it&quot;&gt;not a Q&amp;amp;A site!&lt;/a&gt; However, a most of the features built in to the site are designed for Q&amp;amp;A sites. Will you effectively be an ambassador for our site, and help us get site-specific customizations to fit our mission better? Or would you help the site narrow it's scope to fit that of a Q&amp;amp;A site better? Something else?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Well... I posted the linked question, so I hope the answer is obvious. :) I will definitely try to convince the SE team to get us as many of these customisations as feasible for them. I really hope that we'll have some of those things by the time PPCG gets its shiny new colours. For the things we don't get, I'm happy to continue figuring out workarounds with the community, like the leaderboards many challenge authors are using. Regarding scope, I've said in several places that I would rather see our scope broaden than narrow. That is to make use of the Q&amp;amp;A features by allowing more actual Q&amp;amp;A questions that fit into the sort of programming we do — &lt;a href=&quot;https://codegolf.stackexchange.com/q/75423/8478&quot;&gt;there was a great non-challenge question recently&lt;/a&gt; that was unanimously well received despite fitting none of our current on-topic rules. I'm hoping that this could set a precedent for exploring some new territory in this area, and I will continue advocating this.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;8&quot;&gt;&#xA;  &lt;li&gt;What would your average moderation schedule be like? When will you be active? What day(s)/time(s) would it be best for people to contact you in case of a need of a moderator? (This is of course an estimated schedule, and nobody will hold you accountable to it)&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I live in UTC+1 (or UTC+2 during German DST, which started yesterday and ends at the end of October). I do not visit PPCG at work, but since I use other SE sites (and the Android App) I will get notifications and respond to them if they are urgent. Otherwise, I'm on PPCG (main, meta and chat) every evening and a lot on weekends (which seems complementary to how a lot of people use PPCG...).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;9&quot;&gt;&#xA;  &lt;li&gt;What's your opinion on letting experienced users essentially re-write a challenge that has potential but is badly worded or specified? I've done this once or twice because rewriting is far easier for me than explaining what is wrong (possibly multiple times).&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I feel like this is very similar to the first question. As I said there, in the absence of an explicit consensus on meta, I think the guiding principle should be the reject reasons for suggested edits in the review queue. If you literally re-write the challenge in that you change the rules, you're likely interfering with the author's intent, so I'd be opposed to that. However, improving grammar, clarity and the specification, or working in details that surfaced in comments, are great edits. Of course, the tricky cases are the borderline cases where the spec is simply incomplete and you edit in the missing parts. In those cases, it's may not be clear what the OP's intent &lt;em&gt;was&lt;/em&gt;. I would personally say, go ahead with them but be friendly and forthcoming about it: leave a comment that you've edited in some suggestions to improve the spec and that the OP is free to undo or amend those changes if they dislike them. Make clear that you're not hijacking their challenge but that you're trying to help and show them the ropes. In the end, if rollback wars ensue, we'll have to judge this on a case by case basis, but if people roughly stick to the above guidelines, I'm sure those situations can be minimised and we can sort something out in the remaining cases.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;10&quot;&gt;&#xA;  &lt;li&gt;A diamond will be attached to everything you say and have said in the past, including questions, answers and comments. Everything you will do will be seen under a different light. How do you feel about that?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is somewhat unfortunate. I'd rather people vote on my posts (main or meta) based on their content and not the fact that they were posted by me or a moderator in general. In practice, I realise that this isn't always the case. And I remember an occasion or two where someone said in chat that they didn't post their own view on a meta poll, because it would compete with a moderator's view. However, I don't think that refraining from expressing my opinion can be a solution to this problem. What I will do is point out to people that moderators are just as fallible as anyone else, that our opinions aren't enforced rules, and that the community's views are just as valued, whenever it appears that the diamond's additional weight causes problems. In addition, I will never abuse or exploit that additional weight by letting my diamond argue for my opinion on meta. If I do weigh in on a meta discussion, I will always make a case for my opinion and hope that people will be convinced by &lt;em&gt;that&lt;/em&gt;, and not the diamond. Similarly, I don't think a moderator's opinion is any better than a community member's. What counts is a good argument to convince the community. And my mod actions will always be guided by community consensus, regardless of whether I personally agree or disagree with it.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-03-28T22:07:13.093" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8818" PostTypeId="2" ParentId="8810" CreationDate="2016-03-28T22:39:30.057" Score="12" Body="&lt;h1&gt;Dennis&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;A new-ish user posts a well-posed challenge that quickly gets many answers. An hour later, they edit in a restriction that invalidates most of the existing answers. An experienced user whose answer was invalidated comments that doing this is bad, and rolls back the edit. The poster insists on the change and re-adds it, and the two get into an edit war. Someone flags for moderator attention. What would you do in this situation as a moderator?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;First of all, I would lock the question using the &lt;strong&gt;Content Dispute&lt;/strong&gt; reason, cutting the edit war short.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the edit by the author is completely over the top (e.g., turning a challenge about integer factorization into one about palindromes), I'd roll back to the latest revision before the radical change and ask the author to refrain from editing the post in this way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In other cases, since current community consensus is that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7786&quot;&gt;rule changes are allowed&lt;/a&gt;, I'd ask the editor to refrain from editing the challenge. In case I disagree that the edit improves the challenge, I'd also leave a comment &lt;em&gt;suggesting&lt;/em&gt; that the author reconsider his decision and (if the edits make it sufficiently different) post a new challenge with the intended changes.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;2&quot;&gt;&#xA;  &lt;li&gt;What is the threshold for using your mod-hammer vs. letting the community take care of issues? In other words, will you be mostly laissez-faire with posts and let the close/delete vote system sort out the good posts from the bad? Or will you personally decide that a post doesn't meet quality standards and mod-hammer it (note that this does not apply to obvious spam and the like).&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If I'm at all uncertain whether the post should get closed or not, I don't use my mod hammer and give the community time to handle the post via democratic vote. Only if that fails, I'd contact the other moderators privately to get their input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, most challenges that should be closed have a fatal flaw. If such a flaw exists (blatantly off topic, no objective winning criterion, unclear spec, way too broad), I close the challenge immediately.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Having a challenge get deleted or radically changed after answer have already been posted (or while they're working on them) is a waste of time for everyone involved and a potential source of conflict (see question 1). In case where the question will &lt;em&gt;have to&lt;/em&gt; get modified to remain open, closure should happen as soon as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, old posts that are no longer on topic usually require a mod hammer to get closed.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;3&quot;&gt;&#xA;  &lt;li&gt;One of the biggest difficulties for moderators and high-rep users is to distinguish certain posts from being in-scope or not. There are three critical elements of the PPCG.SE scope, namely the three close reasons: Too broad, opinion-based, and unclear what you're asking. What distinguishes a challenge as too broad or opinion-based? How clear does a challenge need to be to be in-scope? Can you specify your limits on these types of close reasons and your definition of each?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Challenges (which are our most common kind of questions) cannot really be &lt;strong&gt;opinion-based&lt;/strong&gt;. At most, they do not have objective validity or winning criteria, and the &lt;strong&gt;off topic&lt;/strong&gt; close reason fits better in this case.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A challenge is &lt;strong&gt;too broad&lt;/strong&gt; if it doesn't have a clear goal. This happens oftentimes in contests that ask participants to &lt;em&gt;do whatever they want using X&lt;/em&gt; or &lt;em&gt;solve task Y &quot;creatively&quot;&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, a challenge is &lt;strong&gt;unclear what you're asking&lt;/strong&gt; if the spec isn't clear at all, or even if there are multiple ways to interpret a part of it. Objective validity and winning criteria are only meaningful if everybody understands them in the same way.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;4&quot;&gt;&#xA;  &lt;li&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep? This has different implications for different candidates, as some have already reached the permissions thresholds. As a high rep, what do you look to gain with a diamond? As a low rep, why should you earn the tools this way rather than by earning reputation?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I've already had the opportunity to familiarize myself with the moderator tools, and they make me much more valuable for the site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We get a lot of requests for clarification on challenges and critique/suggestions on submissions that eventually become obsolete. This is one thing high rep user cannot handle on their own. While this usually isn't a high priority, it is (by volume) the most common task for moderators, since comment deletion is something the community cannot handle on its own.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, out &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990&quot;&gt;definitive policy about answers not meeting the challenge specification&lt;/a&gt;, which I consider an important part of upholding the overall quality, usually requires the intervention of a moderator.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Other tasks, like moderating chat or contacting the team of community managers are also carried out by moderators.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, in rare occasions, moderators are required to act as arbiter. This is perhaps the most important and certainly the most urgent task, so it requires somebody who is usually available (&lt;em&gt;check&lt;/em&gt;) and is patient and fair, nice but firm. In the past months, I had the opportunity to prove to the community that I have well-suited for this task.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;5&quot;&gt;&#xA;  &lt;li&gt;How would you deal with a user who produced a steady stream of valuable answers, but tends to generate a large number of arguments/flags from comments?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;All moderators are encouraged to focus on the users' &lt;em&gt;actions&lt;/em&gt;, not the users themselves. In no way does producing high quality content give anyone the right to be rude or abusive towards others.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As with anyone else, I'd contact the user privately first. If that doesn't help, I'd have no other choice but suspend the user.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thankfully, PPCG's community is usually polite, and this is rarely ever a problem.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;6&quot;&gt;&#xA;  &lt;li&gt;How would you handle a situation where another mod closed/deleted/etc a question that you feel shouldn't have been?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I would contact the other mod privately, In these cases, one of the involved usually missed something, so we could re-evaluate the question together and try to reach a consensus.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've done this in the past, and we were always able to work things out. In case we can't, there's always the option to ping a third mod to join our discussion and act as tie breaker.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In practice, we oftentimes consult each other &lt;em&gt;before&lt;/em&gt; taking a potentially controversial action.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;7&quot;&gt;&#xA;  &lt;li&gt;How will you help the site fit in with the SE network better? We are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8350/were-not-a-qa-site-but-what-should-be-done-about-it&quot;&gt;not a Q&amp;amp;A site!&lt;/a&gt; However, a most of the features built in to the site are designed for Q&amp;amp;A sites. Will you effectively be an ambassador for our site, and help us get site-specific customizations to fit our mission better? Or would you help the site narrow it's scope to fit that of a Q&amp;amp;A site better? Something else?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Challenges are an integral part of our site. I don't think the can or should disappear, so whether non-challenge questions are considered on topic or not, we'll never be a &lt;em&gt;true&lt;/em&gt; Q&amp;amp;A site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That leaves editing the parts of the site I have access to to clarify the in what what it does act as a Q&amp;amp;A site and in what ways it does not, and acting as a liaison between the PPCG's community and SE's community managers.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;8&quot;&gt;&#xA;  &lt;li&gt;What would your average moderation schedule be like? When will you be active? What day(s)/time(s) would it be best for people to contact you in case of a need of a moderator? (This is of course an estimated schedule, and nobody will hold you accountable to it)&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'm intermittently active from roughly 14:00 UTC to 06:00 UTC.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have the Stack Exchange app on my phone and quick chat notifications enabled, so if you ping me between those hours, chances are I'll respond rather quickly.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;9&quot;&gt;&#xA;  &lt;li&gt;What's your opinion on letting experienced users essentially re-write a challenge that has potential but is badly worded or specified? I've done this once or twice because rewriting is far easier for me than explaining what is wrong (possibly multiple times).&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Rewriting a challenge to make to clearer without changing the intended meaning is always a good idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In all cases that would change the spec, I think it is preferable to talk to the author before making radical changes. Pointing the author to the sandbox is also usually a good idea, and challenges with severe but amendable problems can be re-posted there if needed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, while I consider challenges more of a gift to the community than the property of their authors, I think the authors explicit wishes should be respected, if at all possible. (see question 1)&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;10&quot;&gt;&#xA;  &lt;li&gt;A diamond will be attached to everything you say and have said in the past, including questions, answers and comments. Everything you will do will be seen under a different light. How do you feel about that?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'm already used to that, and it doesn't bother me at all. While I have to get official on occasions, I sense that I'm still one of the guys.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While I still participate in meta discussions, in no case would I &quot;use my diamond&quot; to push a certain opinion.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-03-28T22:39:30.057" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8819" PostTypeId="2" ParentId="8810" CreationDate="2016-03-29T00:25:41.940" Score="4" Body="&lt;h2&gt;Digital Trauma&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A new-ish user posts a well-posed challenge that quickly gets many answers. An hour later, they edit in a restriction that invalidates most of the existing answers. An experienced user whose answer was invalidated comments that doing this is bad, and rolls back the edit. The poster insists on the change and re-adds it, and the two get into an edit war. Someone flags for moderator attention. What would you do in this situation as a moderator?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;If an edit war is already underway, then I the chances are that some other users will have noticed and likely downvoted/closevoted the question - in my experience, this community tends to be pretty responsive in this sort of situation.&lt;/p&gt;&#xA;&lt;p&gt;Regardless, I would try to get hold of the new user on chat, welcome them to the site, thank them for their contribution and then try to clearly explain why invalidating edits are so unpopular, perhaps using analogies such as &lt;a href=&quot;https://en.wikipedia.org/wiki/Moving_the_goalposts&quot; rel=&quot;nofollow noreferrer&quot;&gt;moving the goal posts&lt;/a&gt;.  I would explain that the site works on a community model and that policies such as this are typically decided by consensus on meta.  In this particular case I would point to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7777/when-should-rule-changes-count&quot;&gt;this post&lt;/a&gt; to show the clear community consensus and that the community tends to reward going against clear consensus with downvotes/closevotes.  I would then explain the options open to the user, along with likely outcomes:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;back down&lt;/em&gt; - accept the edit rollback, and make this clear to interested parties.  Likely outcome is that downvotes/closevotes will reduce&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;stick to your guns&lt;/em&gt; - This will likely result in more downvotes and closure of the question, along with a loss of goodwill towards the new user&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;self-close the question&lt;/em&gt; - In this case I would warn the user against attempt to reopen or create a new challenge in the same mold.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If I was unable to discus the above in a timely manner with the user, I would likely put the question on hold with a comment summarising the above.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;What is the threshold for using your mod-hammer vs. letting the community take care of issues? In other words, will you be mostly laissez-faire with posts and let the close/delete vote system sort out the good posts from the bad? Or will you personally decide that a post doesn't meet quality standards and mod-hammer it (note that this does not apply to obvious spam and the like).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;As as high-rep user with the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; dupe-hammer this is a generalization of something I've already run into on several occasions.  I even created a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7981/high-rep-hammers-hamper-high-rep-humans&quot;&gt;meta-post&lt;/a&gt; about it.&lt;/p&gt;&#xA;&lt;p&gt;I've found that since gaining this privilege I have backed off using my hammer somewhat.  In particular sometimes it is very clear that a question should be hammered.  I will hammer those immediately.  In other cases I will:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;add a comment indicating the particular problem with a question - be it dupe, unclear, or whatever.&lt;/li&gt;&#xA;&lt;li&gt;If I feel that the question probably should be hammered but see that there may be points where other users disagree, I'll wait out the first few close-votes and then hammer the 4th or 5th vote.  This gives the will of the community a chance to be heard.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;3&quot;&gt;&#xA;&lt;li&gt;One of the biggest difficulties for moderators and high-rep users is to distinguish certain posts from being in-scope or not. There are three critical elements of the PPCG.SE scope, namely the three close reasons: Too broad, opinion-based, and unclear what you're asking. What distinguishes a challenge as too broad or opinion-based? How clear does a challenge need to be to be in-scope? Can you specify your limits on these types of close reasons and your definition of each?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Opinion-based&lt;/em&gt; - I don't think we get many of these on PPCG, especially for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges.  However this can possibly be used for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; challenges if the challenge is asking scoring to based on subjective evaluation of a generated image or audio file, for example.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;unclear&lt;/em&gt; - This is used for challenges which have specific rules or details poorly defined, but the overall task is generally understandable from a high level.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Too broad&lt;/em&gt; - This is used for challenges that are poorly defined from a high-level point of view, and could generate a large number of potentially valid answers.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;4&quot;&gt;&#xA;&lt;li&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep? This has different implications for different candidates, as some have already reached the permissions thresholds. As a high rep, what do you look to gain with a diamond? As a low rep, why should you earn the tools this way rather than by earning reputation?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I've had &amp;gt;20k rep for 6 months now and I'm already familiar with the tools available at this level.  I want to continue to see this site thrive and am invested in helping with that.  I think site-quality is one of the best indicators of the site's ability to thrive.  For me a lot of quality issues are well taken care of by the community as a whole, but there are details that only mods can take care of.  One such area that I have become interested in is the clean-up of comments.  Most likely the current mods can attest that I am a keen flagger of obsolete comments.  As a mod I would be able to unilaterally take care of this sort of detail without going through all the flagging in cases where comments are clearly obsolete - e.g. it is a suggestion that has been incorporated into a post (with attribution to the commenter) (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7586/flag-comments-for-deletion-when-suggestion-is-implemented&quot;&gt;meta post&lt;/a&gt;). This is generally how I flag such comments today, and as far as I'm aware I think most, if not all such flags have been acted upon by current mods.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;5&quot;&gt;&#xA;&lt;li&gt;How would you deal with a user who produced a steady stream of valuable answers, but tends to generate a large number of arguments/flags from comments?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I would encourage the user to become active on meta.  Most of these sorts of arguments arise from differing interpretations of community-accepted consensus, which is generally figured out on meta.&#xA;I would possibly also remind the user that all of us are here in our spare time and most, if not all of us are here for some form of fun/recreation, and that it's in all of our best interests to ensure fair participation in challenges, otherwise users stop enjoying the site.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;6&quot;&gt;&#xA;&lt;li&gt;How would you handle a situation where another mod closed/deleted/etc a question that you feel shouldn't have been?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;We all have differences of opinion from time to time - this is a good reason for multiple moderators (as well as spreading workload).  I think the answer probably depends on community response.  If it is clear from comments, etc that the mod action is in-line with the community, then I'd probably let it be and examine my own attitude to the given mod action.  However if there were a lot of disagreement around the matter, I would contact the mod to:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;understand their point of view&lt;/li&gt;&#xA;&lt;li&gt;explain my point of view&lt;/li&gt;&#xA;&lt;li&gt;attempt to reach a mutually agreeable compromise or solution&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;7&quot;&gt;&#xA;&lt;li&gt;How will you help the site fit in with the SE network better? We are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8350/were-not-a-qa-site-but-what-should-be-done-about-it&quot;&gt;not a Q&amp;amp;A site!&lt;/a&gt; However, a most of the features built in to the site are designed for Q&amp;amp;A sites. Will you effectively be an ambassador for our site, and help us get site-specific customizations to fit our mission better? Or would you help the site narrow it's scope to fit that of a Q&amp;amp;A site better? Something else?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I think in general this community has done a good job of fitting this square peg into a round hole.  In particular, the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;sandbox&lt;/a&gt; continues to be a valuable part of the site.  I understand not all users like to use the sandbox (I'm a reluctant user myself), but I think encouragement of its use should definitely be continued, especially for new users who are struggling with writing acceptable challenges.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;8&quot;&gt;&#xA;&lt;li&gt;What would your average moderation schedule be like? When will you be active? What day(s)/time(s) would it be best for people to contact you in case of a need of a moderator? (This is of course an estimated schedule, and nobody will hold you accountable to it)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I'm in California, and I tend to check my phone or laptop from the moment I get up to just before I go to bed (yes, I'm addicted).  There is almost always at least one PPCG tab open in my browser.  So 7:30am PST to 10:30pm PST or thereabouts.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;9&quot;&gt;&#xA;&lt;li&gt;What's your opinion on letting experienced users essentially re-write a challenge that has potential but is badly worded or specified? I've done this once or twice because rewriting is far easier for me than explaining what is wrong (possibly multiple times).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I think this is mostly OK.  I would always check first with the OP if they are OK with it though, and ask them to review the changes.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;10&quot;&gt;&#xA;&lt;li&gt;A diamond will be attached to everything you say and have said in the past, including questions, answers and comments. Everything you will do will be seen under a different light. How do you feel about that?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Good.  I have always strived to conduct my transactions on this site with fairness, politeness and professionalism.  I also have a lot of fun on this site and hope others do to.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-29T02:31:10.417" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8820" PostTypeId="1" CreationDate="2016-03-29T01:40:37.947" Score="-1" ViewCount="148" Body="&lt;p&gt;JavaScript ES6/7 is a popular language on PPCG, but currently there is no definition for &quot;JavaScript&quot;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;JavaScript is a language with many implementations. &lt;em&gt;Ecma international&lt;/em&gt; defines the specifications and standards for JavaScript. For JavaScript ES5, an older version of JavaScript, Ecma has released a finalized version of the EcmaScript 5 standards, but only a draft exists for EcmaScript 2015 (ES2015 (ES6 / ES7)).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because EcmaScript only defines the specification, many JavaScript engines exist. All these engines result in discrepancies between various JavaScript versions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;No browser perfectly implements the EcmaScript specifications either, making it difficult to objectively specify what engine should be considered &quot;JavaScript&quot;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;No engine currently supports ES2015; neither does any transpiler. So I've made a meta discussion to decide on what JavaScript should be defined as.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd say it's straightforward to define JS as a popular engine defines it, but &lt;strong&gt;feel free to propose something else&lt;/strong&gt;. I'm not saying to define JS only as a specific engine, just this is a straightforward way I've thought to specify it.&lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="40695" LastEditDate="2016-04-02T04:20:13.617" LastActivityDate="2016-04-02T04:20:13.617" Title="What should &quot;JavaScript&quot; be defined as?" Tags="|discussion|defaults|" AnswerCount="1" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="8821" PostTypeId="2" ParentId="8820" CreationDate="2016-03-29T03:20:40.797" Score="9" Body="&lt;p&gt;I can see how this might be a tempting idea, but I think it will cause more problems than it will solve, particularly because we define languages by their &lt;em&gt;implementations&lt;/em&gt;, not by their &lt;em&gt;specifications&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A lot of languages have a lot of implementations, all with various differences. It's fine to label the language as simply &quot;JavaScript&quot; if it will work with any implementation. But if the submission relies on features only available in a specific implementation, that should be mentioned &lt;em&gt;somewhere&lt;/em&gt; in the post. It could be the header, like &quot;JavaScript (SpiderMonkey), 123 bytes,&quot; or it could be something along the lines of &quot;I tested this in SpiderMonkey&quot; somewhere in the post body.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is common practice with other languages, for example APL. That's why there are posts that say APL, Dyalog APL, ngn/apl, etc. Each implementation has features that distinguish it from the others, and when a submission requires a feature specific to a particular implementation, it's noted as such.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To avoid confusion, it's always better to be explicit than implicit. As Dennis mentioned in a comment, in the absence of a specified implementation, a passer by (or even the OP) would likely just test the code in their own browser console, which may or may not support all features required by the submission, possibly leading to confusion that could have been avoided from the start.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-03-29T03:20:40.797" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8822" PostTypeId="2" ParentId="8810" CreationDate="2016-03-29T05:01:58.983" Score="4" Body="&lt;h2&gt;PhiNotPi&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The first thing I would like to say is that, I'm super open to discussion about this, so if you want to talk about my answers, please don't hesitate to ping me in chat.  I should respond if I'm not sleeping.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;1.&lt;/strong&gt; A new-ish user posts a well-posed challenge that quickly gets many answers. An hour later, they edit in a restriction that invalidates most of the existing answers. An experienced user whose answer was invalidated comments that doing this is bad, and rolls back the edit. The poster insists on the change and re-adds it, and the two get into an edit war. Someone flags for moderator attention. What would you do in this situation as a moderator?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This... is actually a really good question.  As in, shout-out to @xnor for suggesting this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's two big cases that come to mind in which this situation might arise. The most realistic case is probably that some math trick / shortcut / builtin made the challenge much easier than the OP anticipated.  A second realistic example would be the OP being surprised by golfing languages and deciding he didn't want them (a rule change that's &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7473/disallowing-explicit-exclusion-of-languages/&quot;&gt;potentially contrary&lt;/a&gt; to site policy).  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first thing I should probably do is lock the post due to the edit war, using the special-purpose locking reason.  This is probably the most &quot;time-critical&quot; step.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The next thing I would want to do is &lt;strong&gt;ask the other mod's opinions,&lt;/strong&gt; since this is something that I would really want to discuss with the other mods before acting on.  Of course, if another mod comes up with a better course of action, then I will go with that and learn from him.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The next step is to find precedent.  The meta.CG.SE question &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7777/when-should-rule-changes-count/7780&quot;&gt;When should rule changes count&lt;/a&gt; is probably the best, and then other sources like mother-meta's &lt;a href=&quot;https://meta.stackexchange.com/questions/176626/appropriate-action-or-options-when-a-high-rep-user-makes-a-poor-edit&quot;&gt;appropriate action when a high-rep user makes a poor edit&lt;/a&gt; or &lt;a href=&quot;https://meta.stackexchange.com/questions/11474/what-is-the-etiquette-for-modifying-posts&quot;&gt;what is the etiquette for modifying posts&lt;/a&gt; (although I do find those two to be less relevant to CG.SE).  The importance of precedent is something I mention more in my next answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Okay, so let's say that the mods are discussing a solution (or everyone else is on vacation / not at hand), and it's my turn to come up with an answer.  I would try to foster communication between the editor and the OP.  It's probably a good idea to move their comments to a chat room, and try to have a discussion with them there.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One thing I would point out to both users was that an edit war was not a proper course of action, and that the proper (as far as I am aware) course of action was to flag for moderator attention as soon as they felt an edit dispute arising.  I would attempt to prevent &quot;pinning all the blame&quot; on either person.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would also explain to the OP the reasoning against changing their spec in a way that invalidates answers (like devaluing the current answerer's time/effort), but also say that they &lt;em&gt;are free&lt;/em&gt; to change the spec if they believe it's a beneficial change. If the OP's rule change actually goes contrary to a community consensus (like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges&quot;&gt;these&lt;/a&gt;), then I will explain why the OP shouldn't change the rules, and that this might lead to their question being put on hold.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In regards to the editor, I would also explain the the editor how the OP is allowed to change the spec, even though I recognize that the edit can make it feel like the editor wasted his time on the answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then, I'll try to ask the pair of users to come to a reasonable conclusion, which I hope will be one which minimizes the amount of invalidation, but which also satisfies the desire of the OP to improve his challenge.  I might also offer some other suggestions of my own, like making a second challenge (if the rule changes were substantial enough).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the end, I think the OP should usually have the final say. If the OP and editor fail to come to a peaceful agreement, and the OP's new spec is within site rules, then I believe the OP's edit should stick (even if it attracts downvotes).  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the OP's new spec clearly violates a site rule (it is obviously close-worthy), then I'm not sure whether we should let the OP change the spec and get closed, or ignore the OP's intentions to keep it open.  I would have to consult with the other mods/the community about this.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;2.&lt;/strong&gt; What is the threshold for using your mod-hammer vs. letting the community take care of issues? In other words, will you be mostly laissez-faire with posts and let the close/delete vote system sort out the good posts from the bad? Or will you personally decide that a post doesn't meet quality standards and mod-hammer it (note that this does not apply to obvious spam and the like).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Maybe here is a good place to state my belief in &quot;the rule of law&quot; with respect to moderation. Close/delete-votes are generally a way to achieve community consensus about which posts are good/bad and which posts we want/don't want on the site. The important part being the community consensus. I believe it would be my job as a moderator to use my hammer in accordance to the consensus, and that alone, since a unilateral decision will prevent democracy.  I would be willing to cast one of the last close votes, I would be willing to close a question in clear violation of a meta consensus or official SE policy, I would be willing to close a question in consensus with other mods, but I believe that closing a question without any of those things is a violation of the rule of law.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;3.&lt;/strong&gt; One of the biggest difficulties for moderators and high-rep users is to distinguish certain posts from being in-scope or not. There are three critical elements of the PPCG.SE scope, namely the three close reasons: Too broad, opinion-based, and unclear what you're asking. What distinguishes a challenge as too broad or opinion-based? How clear does a challenge need to be to be in-scope? Can you specify your limits on these types of close reasons and your definition of each?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is a case where I think existing precedent/meta-consensus would be most important factor in a mod's decision.  Here's my personal rough estimates for what the three reasons mean:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Unclear what you're asking&lt;/strong&gt; - This is probably the most common and appropriate of the three options.  I would say this applies to questions in which there is uncertainty as to what counts as a valid answer (such as unclear restrictions, or unclear task, or unclear winning criterion).  This is generally used either when the author's intent exists but is unclear, or if his intent isn't &lt;em&gt;complete&lt;/em&gt; (it fails to address some detail, like special-cases).  I think the difference between &lt;code&gt;unclear&lt;/code&gt; and the other two is pretty simple:  &lt;code&gt;unclear&lt;/code&gt; is when the challenge is bad because we don't know what you mean, the other two are when we know exactly what you mean, but the challenge is still bad.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Too broad&lt;/strong&gt; - I think this would generally be used when we know what the challenge author intends, but the challenge leaves room for too much variety/&quot;freedom&quot; in answering.  If two programs are both valid, but do two totally separate things, then it's probably too broad.  If the objective winning criterion can't distinguish answers, then it is probably too broad.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Primarily opinion-based&lt;/strong&gt; - This isn't used very often, as far as I can tell (I don't know the statistics).  If we were to use this reason, it would probably be in the case of &quot;art-contests,&quot; which are typically pop-cons without an appropriate amount of direction for the voters to know what they should be voting for.  Art-contests, though, are also &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8084/guidelines-for-posting-and-closing-popularity-contests&quot;&gt;off topic or too broad&lt;/a&gt;, so they would constitute an unnecessarily niche purpose for this close reason. &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;4.&lt;/strong&gt; In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep? This has different implications for different candidates, as some have already reached the permissions thresholds. As a high rep, what do you look to gain with a diamond? As a low rep, why should you earn the tools this way rather than by earning reputation?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;As a moderator, I will be able do a couple extra things, like moving/removing comments, having increase communication with the SE team, resolving disputes between users, sometimes even suspending people.  It's really a testament to the SE system how &lt;em&gt;little&lt;/em&gt; mods do as a percentage of overall moderation, but there are some things that simply require a moderator to perform.  As a moderator, I believe I will perform these jobs in a rational, level-headed manner, that I will be willing to contemplate alternative viewpoints, and that I will maintain high standard of excellence in everything that I do. So, what do I want out of a diamond?  The same thing every voter wants in this election: a website with a great moderation team.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;5.&lt;/strong&gt; How would you deal with a user who produced a steady stream of valuable answers, but tends to generate a large number of arguments/flags from comments?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If the user's tendency to create arguments is severe enough to warrant a suspension or other disciplinary action (I'm not completely certain where this threshold is), then we should judge the user irrespective of his answer quality. It's about holding everyone to the same basic expectations, and not letting people have free-passes on detrimental behavior because of their experience/rep/popularity.  Relevant story: at Fluther.com, a site where I also do some moderation, we once banned the &lt;em&gt;highest-scoring&lt;/em&gt; user on the whole site because of sock-puppeting/voting-fraud.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;6.&lt;/strong&gt; How would you handle a situation where another mod closed/deleted/etc a question that you feel shouldn't have been?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I think the answer is pretty straight-forward: discuss it with the mod in question, and preferably other mods at the same time as well.  This discussion will preferably occur in private.  From my previous modding experience, I think it's important that the mod team attempt to maintain a &quot;uniform appearance&quot; when it comes to actions, which also means trying not to unilaterally undercut another mod's activity. To look at this objectively, 1 mod wants it closed, and 1 mod (me) wants it open. The best way to resolve this is a discussion (preferably with additional voices) before taking additional actions. I think this question is heavily tied to #2.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;7.&lt;/strong&gt; How will you help the site fit in with the SE network better? We are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8350/were-not-a-qa-site-but-what-should-be-done-about-it&quot;&gt;not a Q&amp;amp;A site!&lt;/a&gt; However, a most of the features built in to the site are designed for Q&amp;amp;A sites. Will you effectively be an ambassador for our site, and help us get site-specific  to fit our mission better? Or would you help the site narrow it's scope to fit that of a Q&amp;amp;A site better? Something else?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I've always been a fan of site-specific customizations, and I believe that they can have a pretty big effect on the site (not just in the areas of convenience/usability, but also to improve &quot;new user experience&quot; and moderation).  I personally do want to push for some of the changes in the linked meta question, and feel that a moderation position will really enable me to work towards those goals.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I certainly don't think we need to make any efforts to &quot;narrow scope&quot; to comply with the existing technology.  We are humans, the SE platform is a machine, we must bend it to our will!  (To clarify, I'm not against the inclusion of Q&amp;amp;A-style questions, just that narrowing scope is unnecessary).&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;8.&lt;/strong&gt; What would your average moderation schedule be like? When will you be active? What day(s)/time(s) would it be best for people to contact you in case of a need of a moderator? (This is of course an estimated schedule, and nobody will hold you accountable to it)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'm in Eastern Time.  If you want to get a good idea of what hours I'd typically be available, check out the graph on &lt;a href=&quot;http://chat.stackexchange.com/users/24697/phinotpi&quot;&gt;my chat profile&lt;/a&gt;.  I have CG.SE notifications routed to my phone's unlock screen, so I'm &quot;contactable&quot; anytime I'm not literally sleeping.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;9.&lt;/strong&gt; What's your opinion on letting experienced users essentially re-write a challenge that has potential but is badly worded or specified? I've done this once or twice because rewriting is far easier for me than explaining what is wrong (possibly multiple times).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;My opinion on this can vary depending on what exactly the edits are, so this answer is somewhat &quot;general.&quot;   If I ever make a substantial edit, I would leave a comment explaining why I made my edit.  Mentioning the sandbox is also a good idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's say that the edit improves the clarity/organisation of the challenge, but doesn't change the underlying intentions of the spec, then I think that's okay.  Examples might include fixing grammar/English.  A second good example could be, if a user comments asking what the winning criterion is, and the OP answers in a comment, then its acceptable to edit the challenge to reflect the OP's response.  A third example could be fixing one of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges&quot;&gt;things to avoid when writing challenges&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would generally avoid making edits that affect the underlying meaning/spec of the challenges.  In cases like these, I think, if a user decides to make an edit, then they should generally change as little of the spec as possible to bring it within the scope of the site.  They should also leave a comment explaining their reasoning for the edit.  If the OP is (possibly retroactively) okay with the edit, then that's also great. If the OP isn't okay with the edit, then this question could start to turn into something like question #1. I think the OP's desire generally wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If an edit clearly goes &lt;em&gt;against&lt;/em&gt; the OP's intentions for the spec (as opposed to clarifying / changing the spec), then that would be an edit I would advise against making without prior discussion/approval with the OP. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, perhaps one guiding principle is that, if it's an edit the OP should try to avoid making (like invalidating existing answers), then it's an edit another user shouldn't do.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;10.&lt;/strong&gt; A diamond will be attached to everything you say and have said in the past, including questions, answers and comments. Everything you will do will be seen under a different light. How do you feel about that?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Ultimately, I will feel the same.  There are two types of regret: the regret you feel when something doesn't work out the way you had thought, and the regret you feel the instant after having done something you knew was wrong. The second kind, of course, is the kind to be avoided.  I don't believe I've ever done anything on PPCG that has caused the second kind of regret, and don't intend on ever doing anything like that.  Long story short: Everything I ever do reflects upon my person, and a diamond doesn't change that.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2016-03-29T05:01:58.983" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8823" PostTypeId="5" CreationDate="2016-03-29T14:16:25.197" Score="0" Body="&lt;h3&gt;What are moderator elections?&lt;/h3&gt;&#xA;&lt;p&gt;Moderator elections are held periodically to determine who the community moderators will be for a given site.&lt;/p&gt;&#xA;&lt;h3&gt;What are community moderators?&lt;/h3&gt;&#xA;&lt;p&gt;Moderators are site users who have been elected by the community based on not only their knowledge in the topic domain, but also because they are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;patient and fair&lt;/li&gt;&#xA;&lt;li&gt;lead by example&lt;/li&gt;&#xA;&lt;li&gt;show respect for their fellow community member in their actions and words&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Moderators have the very highest level of privilege in our system:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Moderator votes are binding. Any place we have voting (close, open, delete, undelete, offensive, etc), that vote will reach the threshold and take effect immediately if a single moderator casts a vote.&lt;/li&gt;&#xA;&lt;li&gt;Moderators can lock posts. Locked posts cannot be voted on or changed in any way.&lt;/li&gt;&#xA;&lt;li&gt;Moderators can protect posts. Protected posts cannot be answered by new users.&lt;/li&gt;&#xA;&lt;li&gt;Moderators can see all data in the system, including votes and user profile information.&lt;/li&gt;&#xA;&lt;li&gt;Moderators can place users in timed suspension, and delete users if necessary.&lt;/li&gt;&#xA;&lt;li&gt;Moderators can perform large-scale maintenance actions like merge questions and batch retag.&lt;/li&gt;&#xA;&lt;li&gt;Moderators have access to the moderator flag queue&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Who are the community moderators?&lt;/h3&gt;&#xA;&lt;p&gt;The list of community moderators on the site can be found &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=moderators&quot;&gt;here&lt;/a&gt;. Additionally, you can see if a user is a community moderator as they will have a diamond (♦) after their username&lt;/p&gt;&#xA;&lt;h3&gt;How do community moderators work?&lt;/h3&gt;&#xA;&lt;p&gt;The following guidelines are provided to all our community moderators, and all moderators of any type are expected to abide by them:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;As a moderator, your actions now represent our community; please act accordingly. You are in a position of the highest trust.&lt;/li&gt;&#xA;&lt;li&gt;Your goal is to guide the community with gentle — but firm — intervention. &lt;strong&gt;Respect&lt;/strong&gt; your fellow community members at all times; demonstrate &lt;strong&gt;fairness&lt;/strong&gt; and &lt;strong&gt;impartiality&lt;/strong&gt; in your actions.&lt;/li&gt;&#xA;&lt;li&gt;Keep the discussion reasonably on topic by providing visible feedback to indicate where and why things have gone off topic.&lt;/li&gt;&#xA;&lt;li&gt;Regularly check for and deal with posts &lt;strong&gt;flagged for moderator attention&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;In the case of serious disputes, communicate directly with users via email to help &lt;strong&gt;mediate and resolve disputes&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;When should I seek out a community moderator?&lt;/h3&gt;&#xA;&lt;p&gt;Don't hesitate to &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/flag-posts&quot;&gt;flag posts for moderator attention&lt;/a&gt; any time there is something you feel strongly needs to be brought to the attention of a moderator. And if it is extremely urgent, you can always mail the address provided in the footer.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;Copied from: &lt;a href=&quot;https://meta.stackexchange.com/tags/election/info&quot;&gt;https://meta.stackexchange.com/tags/election/info&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="-1" LastEditorUserId="66833" LastEditDate="2021-04-16T15:00:06.187" LastActivityDate="2021-04-16T15:00:06.187" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="8824" PostTypeId="4" CreationDate="2016-03-29T14:16:25.197" Score="0" Body="Questions about the moderator elections that are held to choose diamond moderators for the Code Golf &amp; Coding Challenges site" OwnerUserId="-1" LastEditorUserId="66833" LastEditDate="2021-04-16T16:27:34.287" LastActivityDate="2021-04-16T16:27:34.287" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="8825" PostTypeId="2" ParentId="8808" CreationDate="2016-03-29T14:21:05.550" Score="1" Body="&lt;p&gt;This would have been a good idea, if new users would see it. But they won't.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;New users don't read the meta, so greeting them in a meta posts seems to me pointless. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;TimmyD's reference to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1280/42963&quot;&gt;the existing community FAQ&lt;/a&gt; further shows that having stuff on meta doesn't make poeple know of it.&lt;/p&gt;&#xA;" OwnerUserId="3544" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-03-29T14:21:05.550" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8826" PostTypeId="1" CreationDate="2016-03-29T15:04:57.607" Score="0" ViewCount="42" Body="&lt;p&gt;As I compose this answer (&lt;a href=&quot;https://codegolf.stackexchange.com/a/76418/4787&quot;&gt;https://codegolf.stackexchange.com/a/76418/4787&lt;/a&gt;) it occurs to me that I would never actually put that into a shell script. I would just type it at the command line, with the parameter filename at the end.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does it make sense to count the characters in that command line rather than the length of the shell script?&lt;/p&gt;&#xA;" OwnerUserId="4787" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-03-29T15:04:57.607" Title="Does a literal string for a command line shell count as a &quot;program&quot;?" Tags="|discussion|" AnswerCount="0" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8828" PostTypeId="1" CreationDate="2016-03-29T16:17:23.327" Score="15" ViewCount="913" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2028/what-are-programming-languages/2073#2073&quot;&gt;This answer&lt;/a&gt; seems to be the popular definition of &quot;programming language&quot;. I propose that a combination of image canvases and &lt;a href=&quot;https://www.imagemagick.org/script/fx.php&quot; rel=&quot;nofollow noreferrer&quot;&gt;the fx operator&lt;/a&gt; available in ImageMagick satisfies this definition.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The language must:&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Support a representation of natural numbers and of tuples. (We're talking about languages rather than implementations, so we will leave to one side the issue of type widths).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Variables in an fx expression are floating point numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An array of values can be represented by putting pixel data into a canvas. Each pixel is a 4-tuple of floating point values.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A tuple, then, would be a canvas with just one pixel. It is possible to create a canvas, put values into it in one fx expression, and then read those values in a later fx expression. This behavior cannot, however, happen within a loop.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Be able either to transform inputs into outputs (transformational model) or to distinguish an &quot;accepted&quot; input from a &quot;rejected&quot; input (decision model). Be able to take two natural numbers and add them. In the transformational model, this means transforming an input tuple of two numbers into an output which correctly represents their sum. In the decision model this means deciding whether an input contains the representation of a tuple of three natural numbers such that the third is the sum of the first two.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Inputs are in the form of an image representing an array (of zero, one, or two dimensions) of 4-tuples. Providing a list of integers is trivial. A string would be a simple matter of ASCII-to-bitmap conversion. Input can also be provided as a variable at the start of a program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Outputs are also in that same form, or as text to stdout using the debug() operator.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The default behavior is transformational, and adding together two values is one of the simplest operations available in fx expressions. A decision model can be simulated by making the output conditionally map to one of two values.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Be able to take a natural number and say whether or not it is a prime. In the transformational model this means transforming a natural number into the representation of 0 or 1 according to whether it is a composite or a prime number. In the decision model it means accepting precisely those inputs which represent a prime.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This expression checks the primeness of 3 through 32:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;mogrify -fx &quot;x=32;while(prime=1;cand=ceil(sqrt(x));while(prime=x%cand&amp;gt;0?prime:0;cand=cand-1;cand&amp;gt;1);debug(x);debug(prime);x=x-1;x&amp;gt;2)&quot; xc:&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;1/3 of the output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[0,0].blue: x=32&#xA;[0,0].blue: prime=0&#xA;[0,0].blue: x=31&#xA;[0,0].blue: prime=1&#xA;[0,0].blue: x=30&#xA;[0,0].blue: prime=0&#xA;[0,0].blue: x=29&#xA;[0,0].blue: prime=1&#xA;[0,0].blue: x=28&#xA;[0,0].blue: prime=0&#xA;[0,0].blue: x=27&#xA;[0,0].blue: prime=0&#xA;[0,0].blue: x=26&#xA;[0,0].blue: prime=0&#xA;[0,0].blue: x=25&#xA;[0,0].blue: prime=0&#xA;[0,0].blue: x=24&#xA;[0,0].blue: prime=0&#xA;[0,0].blue: x=23&#xA;[0,0].blue: prime=1&#xA;[0,0].blue: x=22&#xA;[0,0].blue: prime=0&#xA;[0,0].blue: x=21&#xA;[0,0].blue: prime=0&#xA;[0,0].blue: x=20&#xA;[0,0].blue: prime=0&#xA;[0,0].blue: x=19&#xA;[0,0].blue: prime=1&#xA;[0,0].blue: x=18&#xA;[0,0].blue: prime=0&#xA;[0,0].blue: x=17&#xA;[0,0].blue: prime=1&#xA;[0,0].blue: x=16&#xA;[0,0].blue: prime=0&#xA;[0,0].blue: x=15&#xA;[0,0].blue: prime=0&#xA;[0,0].blue: x=14&#xA;[0,0].blue: prime=0&#xA;[0,0].blue: x=13&#xA;[0,0].blue: prime=1&#xA;[0,0].blue: x=12&#xA;[0,0].blue: prime=0&#xA;[0,0].blue: x=11&#xA;[0,0].blue: prime=1&#xA;[0,0].blue: x=10&#xA;[0,0].blue: prime=0&#xA;[0,0].blue: x=9&#xA;[0,0].blue: prime=0&#xA;[0,0].blue: x=8&#xA;[0,0].blue: prime=0&#xA;[0,0].blue: x=7&#xA;[0,0].blue: prime=1&#xA;[0,0].blue: x=6&#xA;[0,0].blue: prime=0&#xA;[0,0].blue: x=5&#xA;[0,0].blue: prime=1&#xA;[0,0].blue: x=4&#xA;[0,0].blue: prime=0&#xA;[0,0].blue: x=3&#xA;[0,0].blue: prime=1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This expression converts an 8-bit greyscale image such that any pixel with a prime intensity (greater than 2) becomes white and composite intensities become black:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;convert -fx &quot;x=max(intensity*255,2);prime=1;cand=ceil(sqrt(x));while(prime=x%cand&amp;gt;0?prime:0;cand=cand-1;cand&amp;gt;1);debug(x);debug(prime);prime&quot; gradient.png out.png&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;a href=&quot;https://i.stack.imgur.com/LyaKn.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/LyaKn.png&quot; alt=&quot;black to white gradient, 256px wide&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: &lt;a href=&quot;https://i.stack.imgur.com/jpbol.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/jpbol.png&quot; alt=&quot;prime numbers as white pixels on a number line, 256px wide&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The addition and prime testing requirements can be met without using new canvases to represent tuples. Those and many (most?) other problems can be solved solely within a single -fx expression. In that context, is &lt;code&gt;display -fx foo&lt;/code&gt; analogous to `perl -e foo'? In the latter case, the program is just the three bytes &quot;foo&quot;, which should apply to scoring the length of the former as well.&lt;/p&gt;&#xA;" OwnerUserId="4787" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2016-03-29T21:51:23.730" Title="Is ImageMagick a programming language?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8829" PostTypeId="2" ParentId="8808" CreationDate="2016-03-29T17:00:53.377" Score="16" Body="&lt;h1&gt;Let's do it!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a great idea! While new users won't necessarily see it on their own, they can be easily linked to it, once it exists.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While we currently have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1280/community-faq-for-programming-puzzles-code-golf&quot;&gt;community FAQ&lt;/a&gt;, I think it would be helpful to have something written in a conversational, friendly style to introduce newcomers to the community. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In particular, here's some things we can put on it:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The fact that we're primarily challenge based.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What good answers look like, e.g. code, language, explanation. Link to standard loopholes.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What good challenges look like, e.g. clear spec, objective, etc.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What good code-golf challenges look like. Link to IO defaults, etc.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;How to get help: Sandbox, chat.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-03-29T17:00:53.377" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8830" PostTypeId="1" CreationDate="2016-03-29T17:09:20.960" Score="9" ViewCount="159" Body="&lt;p&gt;Answering the election questionnaire got me thinking: in addition to having an objective winning criterion, all challenges also need an objective validity criterion — there's no point in comparing answers if there's a fuzzy line of what even constitutes a valid answer. This has come up several times in the discussion of popularity contests, or specifically underhanded challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a made up example of how a challenge could have an objective winning criterion but no such validity criterion, consider &quot;Write a program that prints a funny joke. Shortest code wins.&quot; The winning criterion is standard code golf and objective, but deciding what constitutes a funny joke is very much subjective. For winning criteria, we have a close reason, but for validity criteria we don't. I was wondering whether we should decide on a close reason to use in these cases, since it's not entirely clear which one to use. (And I vaguely remember at least one case where someone closed it as &quot;has no objective winning criterion&quot; accompanied by a comment along the lines of &quot;uh, well, yeah it kinda does, but it's still not objective, so...&quot;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A few options I see:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Unclear what you're asking: because there's no way to tell from the challenge which answers are admissible and which aren't.&lt;/li&gt;&#xA;&lt;li&gt;Too broad: if the definition of a valid answer is fuzzy, the challenge will allow too many answers, which won't be comparable.&lt;/li&gt;&#xA;&lt;li&gt;Primarily opinion-based: this is probably not what this close reason was meant for, but a challenge with a subjective validity criterion is clearly opinion-based.&lt;/li&gt;&#xA;&lt;li&gt;Custom off-topic reason: certainly the clearest at the moment, but we'd have to type something up each time, and I just know most people won't do it.&lt;/li&gt;&#xA;&lt;li&gt;Use the &quot;objective winning criterion&quot; reason and leave a comment, that you actually mean the validity criterion.&lt;/li&gt;&#xA;&lt;li&gt;Change the &quot;objective winning criterion&quot; reason to cover both winning and validity criteria.&lt;/li&gt;&#xA;&lt;li&gt;Use another close reason slot to add a separate reason for lack of objective validity criterion.&lt;/li&gt;&#xA;&lt;li&gt;... something else?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I don't have a strong preference for any of these at the moment (although I might form one), so I'm looking forward to reading your opinions and arguments in the answers. :)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-03-29T17:16:04.553" Title="How do we close questions without an objective validity criterion?" Tags="|discussion|close-reasons|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8831" PostTypeId="2" ParentId="8830" CreationDate="2016-03-29T17:16:04.553" Score="9" Body="&lt;h2&gt;Too Broad&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;There are either &lt;strong&gt;too many possible answers&lt;/strong&gt;, or good answers would be too long for this format. Please add details &lt;strong&gt;to narrow the answer set&lt;/strong&gt; or to isolate an issue that can be answered in a few paragraphs.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I think this speaks most directly to the heart of the matter (emphasis mine). Without criteria to judge something valid or invalid, anything is an answer. If anything is an answer, it's no different than your typical &amp;quot;what's your favorite X?&amp;quot; question on any other site. VTC as too broad.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-29T17:16:04.553" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8832" PostTypeId="2" ParentId="2140" CreationDate="2016-03-29T17:54:41.487" Score="12" Body="&lt;h1&gt;Meta Code Bots&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'm just giving this a &quot;code bots&quot; title because that's the most similar previous KOTH. This version is based on the &lt;a href=&quot;http://www.flatlinedgames.com/Games/twin_tin_bots&quot; rel=&quot;nofollow noreferrer&quot;&gt;Twin Tin Bots&lt;/a&gt; board game, and will probably be given a better name before posting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On a far away planet, dozens of small mining robots compete for resources in the form of tiny crystals.  Each individual bot is quite simple in its programming: given a series of steps, they can attempt to follow it.  These bots, however, are remotely programmable, as their programming can be slowly edited over time to respond to current conditions.  In this challenge, you will write a program to program these bots.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Game Field&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The playing field is a toroidal grid, with each cell containing either nothing (&lt;code&gt;.&lt;/code&gt;), a robot ('&gt;'), a crystal (&lt;code&gt;=&lt;/code&gt;), or a base ('@').&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;..........&#xA;.&amp;gt;..@....^&#xA;.=..=.&amp;gt;...&#xA;.v.......=&#xA;..=@..@..^&#xA;.........=&#xA;^.&amp;lt;.....&amp;gt;=&#xA;=.=.=@....&#xA;..@....&amp;lt;.@&#xA;....=&amp;lt;^.=.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Robot Programming&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each robot contains a program, which is a series of basic steps that the robot can perform.  The program is always 24 commands long.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;HALT&lt;/code&gt; (&lt;code&gt;H&lt;/code&gt;)  - If a robot executes this during its turn, its turn is immediately over.  The entire program is initially filled with &lt;code&gt;HALT&lt;/code&gt;s.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;MOVE_FORWARD&lt;/code&gt; (&lt;code&gt;FORWARD&lt;/code&gt;/&lt;code&gt;F&lt;/code&gt;) - The robot who executes this command will move forward 1 square if possible, pushing up to one other robot/crystal.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;TURN_RIGHT&lt;/code&gt; (&lt;code&gt;RIGHT&lt;/code&gt;/&lt;code&gt;R&lt;/code&gt;) - The robot will rotate clockwise by 90 degrees.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;TURN_LEFT&lt;/code&gt; (&lt;code&gt;LEFT&lt;/code&gt;/&lt;code&gt;L&lt;/code&gt;) - The robot will rotate counterclockwise by 90 degrees.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;GRAB&lt;/code&gt; (&lt;code&gt;G&lt;/code&gt;) - The robot will pick up a crystal if there is one directly in front of it. Also, if there is instead a second bot directly in front, this will steal a crystal from that bot's inventory.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;DROP&lt;/code&gt; (&lt;code&gt;D&lt;/code&gt;) - The robot will take a crystal from its inventory and drop it, if possible.  If there is an empty space in front, the crystal would fill that space.  If there is instead a robot in front, then the crystal is added to that bot's inventory.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ZAP&lt;/code&gt; (&lt;code&gt;Z&lt;/code&gt;) - This is an interesting command, and it deviates slightly from the original game. A zap command allows one bot to issue a command to a second bot positioned in front of it.  If bot_X is directly facing bot_Y, and bot_Y is within a distance of two, then bot_X can zap bot_Y.  The very next token in bot_X's program will then be executed by bot_Y instead.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;ZAP&lt;/code&gt; commands have a range of 2, meaning that the zap can travel across a single empty square to reach a target which is not immediately adjacent to the zapper.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;code&gt;ZAP&lt;/code&gt; command can be stacked: &lt;code&gt;Z,Z,F&lt;/code&gt; causes the bot in front of the bot in front of this bot to move forward.&lt;/li&gt;&#xA;&lt;li&gt;An example: The program &lt;code&gt;L,F&lt;/code&gt; normally causes the current bot to turn left then move forward. The program &lt;code&gt;Z,L,F&lt;/code&gt; causes another bot to turn left, and then the current bot to move forward.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;JUMP&lt;/code&gt; (&lt;code&gt;J&lt;/code&gt;) - This serves as an unconditional jump in the program, a feature not found in the board game.  This causes the program execution to jump forwards to the location &lt;em&gt;immediately after the next HALT&lt;/em&gt;.  For example, &lt;code&gt;F,J,R,H,L&lt;/code&gt; causes the bot to move forward and then turn left.  The &lt;code&gt;R,H&lt;/code&gt; is skipped over.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A program with a &lt;code&gt;JUMP&lt;/code&gt;ed section acts exactly like a program with that section removed.  So, &lt;code&gt;F,J,R,H,L&lt;/code&gt; acts exactly like &lt;code&gt;F,L&lt;/code&gt;, and &lt;code&gt;Z,J,H,D&lt;/code&gt; acts exactly like &lt;code&gt;Z,D&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;JUMP&lt;/code&gt; can be used to easily switch between multiple complex behaviors.  For example, &lt;code&gt;F,F,H,R,R&lt;/code&gt; can easily be edited to form &lt;code&gt;J,F,F,H,R,R&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Notes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The steps &lt;code&gt;ZAP,HALT&lt;/code&gt; will not have any effect.  The bot performing the halt wouldn't be the current bot, since the zap causes the halt to be performed by the bot directly in front (if any).  The &lt;code&gt;HALT&lt;/code&gt; command only has an effect if it is executed by the bot whose turn it currently is.&lt;/li&gt;&#xA;&lt;li&gt;The steps &lt;code&gt;ZAP,ZAP,HALT&lt;/code&gt; &lt;em&gt;might&lt;/em&gt; have an effect.  If two bots are facing each other, then the HALT would be executed by the original bot, ending the turn. If the bots aren't facing each other, then the HALT would be executed by a third bot (or nobody at all), having no effect.&lt;/li&gt;&#xA;&lt;li&gt;In the original game, the zap command allows the zapping player to perform &quot;special action&quot; on his turn that affects the target bot (the player, instead of the bot programming, determines what the zap does).  Here, the action of zaps are determined by the bot program.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Editing the programming&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each turn, the bot's programming can be altered.  Any number of commands can be removed (shifting the following commands to the left and adding a &lt;code&gt;HALT&lt;/code&gt; to the end).  Only &lt;em&gt;one&lt;/em&gt; command, however, can be inserted each turn (shifting the following commands to the right and deleting the last one).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Game Objective&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your goal is to navigate your bot to pick up crystals and return them to a base (they serve as collection points).  Each crystal you successfully &lt;code&gt;DROP&lt;/code&gt; off at a base earns you one point.  Each bot can only carry one crystal at a time.  These crystals can be acquired by &lt;code&gt;GRAB&lt;/code&gt;bing them off the ground or by &lt;code&gt;GRAB&lt;/code&gt;bing from an opponent bot.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Execution Order&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The players take turns in a cycle.  On your turn, your program will receive the current game map (as an object) and your current bot's program.  Your program can then submit the edited bot-program.  Your bot's  program is then immediately executed, affecting the board before the next player's turn begins.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;More spec coming later...  The controller is currently under construction.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2016-11-26T02:01:13.107" LastActivityDate="2016-11-26T02:01:13.107" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8833" PostTypeId="2" ParentId="8828" CreationDate="2016-03-29T18:00:04.627" Score="15" Body="&lt;p&gt;Yep, it's a programming language by our standards. It passes all of the requirements (in fact, from a cursory reading of the docs, it looks like it's even Turing-complete).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2016-03-29T18:00:04.627" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8834" PostTypeId="1" CreationDate="2016-03-29T18:04:29.850" Score="4" ViewCount="109" Body="&lt;p&gt;This question is specifically prompted by my using ImageMagick in a challenge, but applies in general. This is somewhat an extension of &lt;/p&gt;&#xA;&#xA;&lt;p&gt;All of the IM tools take the same syntax of operations and expressions. However, each tool has a different name and a different default behavior.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;convert -resize 50% foo bar&lt;/code&gt; shrinks image foo to half size and saves it to new image file bar&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;mogrify -resize 50% foo&lt;/code&gt; shrinks image foo to half size and overwrites it with the new version&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;display -resize 50% foo&lt;/code&gt; shrinks image foo to half size and puts it on the screen&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there is a challenge to resize an image to half size, and it doesn't specify where the output has to go (so that any of the three are valid), is &lt;code&gt;-resize 50%&lt;/code&gt; the whole program? If it does specify that the output has to go to a new file, do I then add 8 bytes for &lt;code&gt;mogrify_&lt;/code&gt;?&lt;/p&gt;&#xA;" OwnerUserId="4787" LastActivityDate="2016-03-29T18:35:31.900" Title="How should program size be calculated if an interpreter has multiple binaries with different behaviors?" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8835" PostTypeId="2" ParentId="8834" CreationDate="2016-03-29T18:32:56.310" Score="-3" Body="&lt;h2&gt;Add it to the byte count, but using as few bytes as possible&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In the specific case under question, there could theoretically be a single imagemagick selector program which selected which of the binaries to use on the basis of a flag value. Since there are less than 256 different binaries, one byte of information is enough to distinguish them. My preference would be to add one byte to the total (or even three bits if you like fractional bytes) to account for the selection of the binary. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moreover, there are other situations in which an interpreter requires a certain flag to work in a specific way, and the will of the community has been to add 2 bytes to the total for the use of this flag. This is a slightly different scenario, as in these cases, there has been a single &quot;default&quot; (no flag) setting, while in the case under consideration, there is no &quot;default&quot;. I think 1 byte is a fair compromise when it's not clear which of the binaries is the &quot;default&quot; and which ones are the ones we are &quot;adding flags to&quot;.&lt;/p&gt;&#xA;" OwnerUserId="47050" LastActivityDate="2016-03-29T18:32:56.310" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8836" PostTypeId="2" ParentId="8834" CreationDate="2016-03-29T18:35:31.900" Score="5" Body="&lt;h2&gt;Make the specific binary used part of the language definition&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In other words, let &lt;code&gt;convert&lt;/code&gt;, &lt;code&gt;mogrify&lt;/code&gt; and &lt;code&gt;display&lt;/code&gt; count as three different &quot;languages&quot; (assuming that all three binaries meet the &quot;programming language&quot; requirement), and specify which is being used in the answer header. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If multiple different binaries are needed, then the language should be given as &quot;bash w/ imagemagick&quot; or similar, and the full names of the binaries added to the byte count.&lt;/p&gt;&#xA;" OwnerUserId="47050" LastActivityDate="2016-03-29T18:35:31.900" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8837" PostTypeId="2" ParentId="8810" CreationDate="2016-03-29T19:18:34.597" Score="2" Body="&lt;h2&gt;Mego&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A new-ish user posts a well-posed challenge that quickly gets many answers. An hour later, they edit in a restriction that invalidates most of the existing answers. An experienced user whose answer was invalidated comments that doing this is bad, and rolls back the edit. The poster insists on the change and re-adds it, and the two get into an edit war. Someone flags for moderator attention. What would you do in this situation as a moderator?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;There is an important consideration here: does the edit improve the quality of the challenge enough that it's worth invalidating answers? Closing a loophole that allows the challenge to be trivially solved is (usually) good. Disallowing the use of a language or set of languages is (usually) bad.&lt;/p&gt;&#xA;&lt;p&gt;With that in mind, I'd lock the question to prevent further edits until the situation can be resolved. I would then create a chat room for the OP and the editor, explain and link to relevant site policies, and moderate a discussion between them so that they can reach an understanding. Once everything has been cleared up, I'd edit the question in the appropriate way (either keeping or discarding the contentious edit), and unlock it.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;What is the threshold for using your mod-hammer vs. letting the community take care of issues? In other words, will you be mostly laissez-faire with posts and let the close/delete vote system sort out the good posts from the bad? Or will you personally decide that a post doesn't meet quality standards and mod-hammer it (note that this does not apply to obvious spam and the like).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Mod-hammers are tools that are not to be used lightly. I believe the same goes for close/delete votes of normal users, and I use that philosophy now. I don't vote to close or delete something unless I am absolutely sure that I am making the correct decision. When there is uncertainty, I bring it up in chat and/or on meta, so that I can form my decision with the aid of the community. If I were elected as a moderator, essentially nothing would change. If anything, I'd use the hammers even less frequently than I use close and delete votes - only in cut-and-dry situations, letting the community handle the other situations.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;3&quot;&gt;&#xA;&lt;li&gt;One of the biggest difficulties for moderators and high-rep users is to distinguish certain posts from being in-scope or not. There are three critical elements of the PPCG.SE scope, namely the three close reasons: Too broad, opinion-based, and unclear what you're asking. What distinguishes a challenge as too broad or opinion-based? How clear does a challenge need to be to be in-scope? Can you specify your limits on these types of close reasons and your definition of each?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Too broad:&lt;/strong&gt; A challenge which does not give a requirement for what a valid solution looks like (such as popularity contests with no objective validity criterion).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Opinion-based:&lt;/strong&gt; A challenge where a major part (such as the winning criterion) is subjective (such as &amp;quot;the winning answer will be the one I like best&amp;quot;). There is quite a bit of overlap with the &amp;quot;no objective winning criterion&amp;quot; off-topic close reason, and that one tends to be applied more often.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Unclear what you are asking:&lt;/strong&gt; A challenge where there is not exactly one valid interpretation of the goal and restrictions. This can mean either a challenge where there is no valid interpretation (due to conflicting rules/goals), or where there are multiple valid interpretations (due to underspecification).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;In order for a challenge to be in-scope, it needs a clear and objective winning criterion, a clear and objective validity criterion, and to not break any of the PPCG or SE policies.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;4&quot;&gt;&#xA;&lt;li&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep? This has different implications for different candidates, as some have already reached the permissions thresholds. As a high rep, what do you look to gain with a diamond? As a low rep, why should you earn the tools this way rather than by earning reputation?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Reputation is great. Privileges are nice. But, the moderation privileges given to high-rep users aren't sufficient to solve every problem that arises. Being a moderator means being able to privately communicate with users to correct unacceptable behavior, do large-scale tag cleanups, deal with users who try to abuse the SE system via voting rings, sockpuppetry, and the like, and many other things that non-mods cannot do. I love this site, and I love this community. I want to help and contribute as much as possible, and being elected as a moderator will enable me to contribute to and improve PPCG even more.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;5&quot;&gt;&#xA;&lt;li&gt;How would you deal with a user who produced a steady stream of valuable answers, but tends to generate a large number of arguments/flags from comments?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I would privately contact the user and explain the situation: if they continue to break the Be Nice policy, they will be subject to disciplinary action such as suspension or banning, regardless of how much high-quality content they have contributed.&lt;/p&gt;&#xA;&lt;p&gt;It's important to separate the content from the user in cases like these. One must look objectively at the content and act appropriately, regardless of the user's history (unless their history would indicate that escalation of discipline is necessary).&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;6&quot;&gt;&#xA;&lt;li&gt;How would you handle a situation where another mod closed/deleted/etc a question that you feel shouldn't have been?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I would privately communicate with the other mod to understand their reasoning and come to a consensus together. It's entirely possible that one of us was missing details that the other had noticed, that influenced the action taken. Once an understanding has been reached, action would be taken to correct the situation, if necessary.&lt;/p&gt;&#xA;&lt;p&gt;I specifically said &lt;em&gt;private&lt;/em&gt; communication because I believe it is important for the moderation team to work as a team. Despite any internal differences/disputes, the mods must publicly work together and not let their disputes and differences compromise their ability to moderate.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;7&quot;&gt;&#xA;&lt;li&gt;How will you help the site fit in with the SE network better? We are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8350/were-not-a-qa-site-but-what-should-be-done-about-it&quot;&gt;not a Q&amp;amp;A site!&lt;/a&gt; However, a most of the features built in to the site are designed for Q&amp;amp;A sites. Will you effectively be an ambassador for our site, and help us get site-specific customizations to fit our mission better? Or would you help the site narrow it's scope to fit that of a Q&amp;amp;A site better? Something else?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Right now, I feel that PPCG has a pretty well-defined scope. I wouldn't mind the scope being broadened somewhat (such as allowing more tips/optimizations questions), but I don't think it needs to be narrowed any. PPCG (along with our friendly rival site, Code Review) was created as an exception to the Q&amp;amp;A framework that the other SE sites follow, and so we have to work around inconvenient parts of that framework. The SE team clearly supports us (otherwise we would not have graduated!), and so I am confident that they will help us out with any site-specific customizations we need for the site to work better, though we could be waiting a while for them.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;8&quot;&gt;&#xA;&lt;li&gt;What would your average moderation schedule be like? When will you be active? What day(s)/time(s) would it be best for people to contact you in case of a need of a moderator? (This is of course an estimated schedule, and nobody will hold you accountable to it)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I currently work as a freelance software developer. Being able to make my own schedule for development and working from home means that I'm available essentially any time that I'm not asleep or otherwise occupied with important business. I make an effort to drop by The Nineteenth Byte at least once a day, so I'm always able to be contacted through pinging me there.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;9&quot;&gt;&#xA;&lt;li&gt;What's your opinion on letting experienced users essentially re-write a challenge that has potential but is badly worded or specified? I've done this once or twice because rewriting is far easier for me than explaining what is wrong (possibly multiple times).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Though challenges are written by individuals (usually), they belong to the community. If the community feels that a challenge could be improved by making edits that do not conflict with the original intention of the challenge, it is their prerogative to do so. However, if the edits would conflict with the original intention of the challenge, it would probably be better to post a new challenge, and possibly start a meta discussion about closing the old challenge as a dupe of the new one. Note that I say &lt;em&gt;probably&lt;/em&gt; here: each situation would need to be handled in a case-by-case basis.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;10&quot;&gt;&#xA;&lt;li&gt;A diamond will be attached to everything you say and have said in the past, including questions, answers and comments. Everything you will do will be seen under a different light. How do you feel about that?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I make an effort not to say or do anything that I might regret later. Almost everything said or done on SE has a record (comments are the only exception I can think of right now), and so I try to be mindful of that. Granted, I have made some mistakes in the past (to err is human, and despite what some might believe, I actually am a human, not a penguin), but I don't have anything to hide.&lt;/p&gt;&#xA;&lt;p&gt;I understand that the presence of the blue diamond next to my name will add additional weight to my statements and actions, even though I don't believe it should in most cases. However, given that I try to act as an upstanding member of the community anyway, that additional weight will not cause issues. I would additionally make an effort to inform and educated misguided users that moderators are here to &lt;em&gt;enforce&lt;/em&gt; policy, not to create it without the backing of the community.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-31T06:13:20.737" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8839" PostTypeId="2" ParentId="8810" CreationDate="2016-03-29T23:53:34.890" Score="5" Body="&lt;h2&gt;Doorknob&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;A new-ish user posts a well-posed challenge that quickly gets many&#xA;  answers.  An hour later, they edit in a restriction that invalidates most of&#xA;  the existing answers. An experienced user whose answer was invalidated&#xA;  comments that doing this is bad, and rolls back the edit. The poster insists&#xA;  on the change and re-adds it, and the two get into an edit war. Someone&#xA;  flags for moderator attention. What would you do in this situation as a&#xA;  moderator?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is a tricky one right off the bat. My &lt;em&gt;personal&lt;/em&gt; opinion (which I've&#xA;only really expressed in the mod chatroom and which I've been meaning to&#xA;bring up on meta) is that the community should be able to (and should)&#xA;outweigh the poster of the challenge on certain issues. Clearly if the OP&#xA;self-vandalizes the question, the community has this right—but &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8788/should-language-specific-code-golf-challenges-be-explicitly-disallowed#comment25158_8788&quot;&gt;how far&#xA;does this go?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That being said—I'm getting off topic. As a moderator, I can't enforce a&#xA;policy that we don't have. My immediate reaction to a back-and-forth of&#xA;more than a few rollbacks would be to lock the post while a consensus is&#xA;being reached; since this disables commenting, I would also create an&#xA;accompanying meta post (or perhaps chatroom) to allow the community as a&#xA;whole to discuss what should be done (it's really quite unfortunate that we&#xA;don't have a real policy documented on meta, which I've been intending to&#xA;fix). I would likely not participate considerably in these discussions,&#xA;only because of my involvement in the issue and due to my... perhaps&#xA;unorthodox personal opinions. As a moderator, it's important to know the&#xA;difference between when to take leadership and when to defer to others.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is somewhat context-sensitive, though. If either of the two edit...&#xA;warrers?... are trying to make a change that is flat-out ridiculous or&#xA;repeatedly try to change the post such that it breaks site rules (such as&#xA;having an objective winning criterion) after having this explained to them,&#xA;that's grounds for a stern comment, mod message, or suspension, in&#xA;increasing order of severity. (This is &lt;a href=&quot;https://meta.stackexchange.com/a/252991/180276&quot;&gt;network-wide policy&lt;/a&gt;, so there's&#xA;a precedent for enforcing it here.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;What is the threshold for using your mod-hammer vs. letting the community&#xA;  take care of issues? In other words, will you be mostly laissez-faire with&#xA;  posts and let the close/delete vote system sort out the good posts from the&#xA;  bad? Or will you personally decide that a post doesn't meet quality&#xA;  standards and mod-hammer it (note that this does not apply to obvious spam&#xA;  and the like).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;With regard to clear-cut issues (general programming questions, missing&#xA;objective winning criterion, etc.) and issues that are subjective but are&#xA;supported by community consensus or policy (too-broad popcons, answers that&#xA;aren't serious contenders, standard loopholes, etc.), I'm not afraid to&#xA;expedite the process and whack it with Mjollnir. (I'm pretty proud of that&#xA;&lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=27263303#27263303&quot;&gt;11-second close&lt;/a&gt; :P)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In terms of the greyer areas, I have generally held a policy of neutrality&#xA;and nonintervention. Before taking any unilateral action when it is unclear&#xA;whether I should do so, I always ask myself whether a.) I would be prepared&#xA;to defend my decision on meta and b.) my decision does not override&#xA;community consensus. Unilateral action against the community's will is&#xA;never a good thing and should be avoided at all costs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I almost always leave an explanatory comment when taking any mod action on&#xA;a post (except on obvious spam and the like).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;One of the biggest difficulties for moderators and high-rep users is to&#xA;  distinguish certain posts from being in-scope or not. There are three&#xA;  critical elements of the PPCG.SE scope, namely the three close reasons: Too&#xA;  broad, opinion-based, and unclear what you're asking. What distinguishes a&#xA;  challenge as too broad or opinion-based? How clear does a challenge need to&#xA;  be to be in-scope? Can you specify your limits on these types of close&#xA;  reasons and your definition of each?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is a question for the community, not for the moderators; scope is&#xA;defined by consensus, not the thoughts of a few specific people. The Stack&#xA;Exchange network is, first and foremost, run by the community, and my voice&#xA;should count just as much as yours and anyone else's.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As far as actual moderation on posts goes, I'm generally pretty cautious&#xA;with the mod hammer (cf. question 2). Addressing the question specifically,&#xA;&lt;em&gt;too broad&lt;/em&gt;, for me, is anything that doesn't specify a clear and&#xA;unambiguous task (&quot;draw an avodado [code-golf]&quot; (with no other specs),&#xA;&quot;most creative wins [popularity-contest],&quot; etc.), &lt;em&gt;opinion-based&lt;/em&gt; is...&#xA;well, mostly covered already by &lt;em&gt;off-topic&lt;/em&gt; and &lt;em&gt;too broad&lt;/em&gt;, and &lt;em&gt;unclear&lt;/em&gt;&#xA;is anything that defines a task but does so with an incomplete spec, where&#xA;something is missing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Again, especially when unilaterally closing questions, I will &lt;em&gt;always&lt;/em&gt;&#xA;leave a detailed explanatory comment and carefully explain how the&#xA;challenge can be fixed (if it can be).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;In what way do you feel that being a moderator will make you more&#xA;  effective as opposed to simply reaching 10k or 20k rep? This has different&#xA;  implications for different candidates, as some have already reached the&#xA;  permissions thresholds. As a high rep, what do you look to gain with a&#xA;  diamond? As a low rep, why should you earn the tools this way rather than by&#xA;  earning reputation?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Moderators are &quot;human exception handlers,&quot; in the words of countless meta&#xA;and blog posts. As a moderator, I have the tooling and authority necessary&#xA;to deal with exceptional situations, anything from minor squabbles in chat&#xA;to voting rings. While a high-reputation user commands part of that tooling&#xA;and authority, having a diamond helps me step up and provide guidance and&#xA;leadership to the community, when (and only when) it is necessary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, moderators serve as &quot;janitors.&quot; I've been quietly working in&#xA;the background since I was elected two years ago, having accumlated over&#xA;1,400 flags handled in that time period. Consistency is also something that&#xA;I bring to the table, both in volume of flags handled and the responsible&#xA;and careful manner in which I handle them. (And, of course, it's nice to be&#xA;able to nuke obvious spam/off-topic questions without waiting for 4 other&#xA;people.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;How would you deal with a user who produced a steady stream of valuable&#xA;  answers, but tends to generate a large number of arguments/flags from&#xA;  comments?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I moderate based on actions and behavior, not usernames. Take that as a&#xA;personal promise—the manner in which I moderate will &lt;em&gt;never&lt;/em&gt; be influenced&#xA;by the user in question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the user is unresponsive to mod messages, etc., a suspension would be in&#xA;order, just like it would with any other user.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;How would you handle a situation where another mod closed/deleted/etc a&#xA;  question that you feel shouldn't have been?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The main reason that this is a relatively rare situation is because the&#xA;communication among the current mod team is excellent—the PPCG mod chatroom&#xA;is very active, and we tend to confer among ourselves before making any&#xA;potentially contentious decisions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Nevertheless, disagreements are possible and have occurred. However, we&#xA;have always come to a satisfying agreement after consideration in chat, and&#xA;an important moderator quality is the ability to easily and civilly make&#xA;compromises. I have and will readily admit my mistakes, defer to others,&#xA;and respect their (differing) opinions.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;How will you help the site fit in with the SE network better? We are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8350/were-not-a-qa-site-but-what-should-be-done-about-it&quot;&gt;not&#xA;  a Q&amp;amp;A site!&lt;/a&gt; However, a most of the features built in to the site are&#xA;  designed for Q&amp;amp;A sites. Will you effectively be an ambassador for our site,&#xA;  and help us get site-specific customizations to fit our mission better? Or&#xA;  would you help the site narrow it's scope to fit that of a Q&amp;amp;A site better?&#xA;  Something else?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'll address the latter question first. In the past, I've strongly pushed&#xA;for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1470/3808&quot;&gt;non-challenge questions&lt;/a&gt;, and I'd been one of the most vocal&#xA;proponents. Over a year later, though, it's clear that trying to promote&#xA;this type of question is simply not sensible in practice, and my stance has&#xA;slackened accordingly. In essence:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The currently established scope will not be restricted or narrowed. It's&#xA;clear that that's what the community wants, and PPCG doesn't make sense&#xA;as a Q&amp;amp;A site.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;While the acceptance of non-challenge questions has varied, one thing has&#xA;remained constant: real challenges have always been and will always be&#xA;the vast majority of &quot;questions,&quot; and attempting to confine this to the&#xA;standard SE Q&amp;amp;A format clearly does not make sense.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Defining the scope of a site is (usually) the job of the community, not the&#xA;moderators. However, as for the former question, liaisoning with the&#xA;community team at SE &lt;em&gt;is&lt;/em&gt; one of the roles of the moderator team. And yes,&#xA;I have done so in the past and will willingly do so if necessary in the&#xA;future.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;What would your average moderation schedule be like? When will you be&#xA;  active? What day(s)/time(s) would it be best for people to contact you in&#xA;  case of a need of a moderator? (This is of course an estimated schedule, and&#xA;  nobody will hold you accountable to it)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;My chat activity graph is a fairly accurate indicator of when I'm usually&#xA;active (note that times are in UTC):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/l2hfJ.png&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My timezone is CST (UTC-06:00, UTC-05:00 during DST), and I visit... pretty&#xA;much every day (I'm apparently on 227 consecutive days right now, which is&#xA;new information to me; I guess I missed a day a while back).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I sporadically check on the flag queue throughout the day (although Alex&#xA;always seems to be faster), and notifications go to my phone, so I'll see&#xA;pings really any time during the day.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;What's your opinion on letting experienced users essentially re-write a&#xA;  challenge that has potential but is badly worded or specified? I've done&#xA;  this once or twice because rewriting is far easier for me than explaining&#xA;  what is wrong (possibly multiple times).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;My personal opinion? This is comparable to the first question in that it's&#xA;a question of whether the community should be able to override the original&#xA;poster of a challenge. Accordingly, my own view is similar: yes, to a&#xA;certain extent, experienced users should be able to overhaul a new user's&#xA;challenge. (The problem then becomes: to &lt;em&gt;what&lt;/em&gt; extent? That's a discussion&#xA;for meta.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From a moderation point of view? If the original author is okay with it, go&#xA;for it—the CC licensing and Wikipedia-like model of SE sites means it's&#xA;perfectly okay to edit others' posts. (Personal advice: always drop a&#xA;comment first to make sure that the challenge author consents.) If an edit&#xA;war or similar ends up ensuing, I would handle the situation similarly to&#xA;the way in which I described it in question 1. Otherwise, the challenge can&#xA;be improved, and everyone benefits.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;A diamond will be attached to everything you say and have said in the&#xA;  past, including questions, answers and comments. Everything you will do&#xA;  will be seen under a different light. How do you feel about that?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I've had that diamond for almost two years, so I've already been operating&#xA;under that assumption. While it is occasionally the job of a moderator to&#xA;take charge and step up as a leader, it is frequently preferable to act as&#xA;a regular member of the community, and in terms of policy discussions,&#xA;there are very few occasions in which I would act as a moderator rather&#xA;than discuss as a normal user. However, I am comfortable with the diamond&#xA;attached to everything I do, and I make sure to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5681/3808&quot;&gt;clarify that I'm speaking&#xA;as a regular user&lt;/a&gt; when necessary.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2016-03-29T23:53:34.890" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8842" PostTypeId="2" ParentId="6918" CreationDate="2016-03-30T17:41:41.417" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/DenkerAffe/IPOS&quot; rel=&quot;nofollow noreferrer&quot;&gt;IPOS&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h3&gt;Made by me, DenkerAffe&lt;/h3&gt;&#xA;&lt;p&gt;IPOS (short for &lt;em&gt;I process only strings&lt;/em&gt;) is a stack-based golfing language made for complex string processing. It will have a huge amount of string manipulation builtins, so it will probably (hopefully) win every challenge which is about transforming an input string into an output string.&lt;/p&gt;&#xA;&lt;p&gt;I finished the basic core recently, now it is only about implementing builtins. A list of all planned (not-complete) and already implemented commands can be found &lt;a href=&quot;https://github.com/DenkerAffe/IPOS/wiki/Commands&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The input to an IPOS program is placed on the stack automatically. At the end of the program all stack items are converted to strings and get joined into one string which then get printed.&lt;/p&gt;&#xA;&lt;h2&gt;Example programs&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Hello World&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;Hello World!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Split input on dots, reverse each substring and join all substring on dots&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;'.!r%&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Explanation&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;       Implicit: place input string on the stack (C)&#xA;'.     Push a dot to the stack (B)&#xA;!r     Push the reverse command to the stack (A)&#xA;%      Split C on B, apply A to every part and join the result on B&#xA;       Implicit: Output the stack contents&#xA;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Swap case of every character in the input randomly&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;E!s?&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Explanation&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;       Implicit: place input string on the stack (C)&#xA;E      Push an empty string to the stack (B)&#xA;!k     Push the swapcase command to the stack (A)&#xA;?      Split C on B (=split into characters), apply A to every part and join the result on B&#xA;       Implicit: output the stack contents&#xA;&lt;/pre&gt;&#xA;" OwnerUserId="49110" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-31T15:19:48.797" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8843" PostTypeId="1" AcceptedAnswerId="8845" CreationDate="2016-03-30T17:49:39.350" Score="4" ViewCount="315" Body="&lt;p&gt;&lt;a href=&quot;https://github.com/ConorOBrien-Foxx/Assorted-Programming-Languages/tree/master/oration&quot; rel=&quot;nofollow noreferrer&quot;&gt;Oration&lt;/a&gt; is a programming language created by @ConorO'Brien, which I have helped with.&lt;/p&gt;&#xA;&lt;p&gt;My answer &lt;a href=&quot;https://codegolf.stackexchange.com/a/76620/46271&quot;&gt;here&lt;/a&gt; has come under fire for copying somebody else's code, and being just a lengthier version of python. The python answer is &lt;a href=&quot;https://codegolf.stackexchange.com/a/76606/46271&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I think it is still valid as a language (as of now, it is actually beating the said python answer. :P), but some people disagree.&lt;/p&gt;&#xA;&lt;p&gt;Let the community speak:&lt;/p&gt;&#xA;&lt;h3&gt;Is this a programming language or not?&lt;/h3&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-31T03:48:51.980" Title="Is Oration a programming language?" Tags="|discussion|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8844" PostTypeId="2" ParentId="8843" CreationDate="2016-03-30T17:54:06.470" Score="-5" Body="&lt;h1&gt;Yes, it is a valid programming language.&lt;/h1&gt;&#xA;&lt;p&gt;For 2 reasons:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The shortest python answer is not necessarily  the shortest oration answer.  The method Skyler uses in his python answer makes it longer than as it stands.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It can be considered a &amp;quot;serious and competitive&amp;quot; answer. It has been shown to beat the language it compiles to, so it isn't just a lengthened version.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-30T17:54:06.470" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8845" PostTypeId="2" ParentId="8843" CreationDate="2016-03-30T18:19:18.457" Score="19" Body="&lt;h1&gt;You're asking the wrong question&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We currently have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073&quot;&gt;definition of programming languages&lt;/a&gt; for the purposes of PPCG, which is based on community consensus. Assuming that &lt;em&gt;Oration&lt;/em&gt; is capable of addition (&lt;em&gt;check&lt;/em&gt;) and primality testing (no clue, but probably), it is a programming language and can be used in our contests.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, the &lt;a href=&quot;http://chat.stackexchange.com/rooms/37724&quot;&gt;discussion between Downgoat and yourself&lt;/a&gt; never contested Oration's status as programming language. His critique was the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;-1 for being a non-optimized encoding of the Python answer&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;To be fair, pretty much all answers to that challenge are going to do &lt;em&gt;exactly&lt;/em&gt; the same. There are only so many ways to open a web browser, and any language implemented in Python is likely to use &lt;code&gt;webbrowser&lt;/code&gt; for that task.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;yeah, but it is like Unicorn, just a trivial encoding of another language&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'm partly to blame for that train of thought, since I complained rather loudly &lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=27127856#27127856&quot;&gt;in chat&lt;/a&gt; about such languages. My exact words were:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Depending on the interpretation, Unicorn answers to code golf competitions might violate our competitiveness rule though.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;There's no consensus yet. My personal opinion is that &lt;em&gt;encodings&lt;/em&gt; of a language (Unary for BF, Unicorn for ES6, etc.) should not be used to achieve a worse score.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I still stand by this opinion, although it's nothing more than &lt;em&gt;my personal opinion&lt;/em&gt; for now.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;That being said, Unicorn encodes the &lt;em&gt;characters in the source code&lt;/em&gt;, while Oration &lt;em&gt;transpiles&lt;/em&gt; to Python. That's not really a feature of the language, but a design choice of the interpreter. Also, it makes Oration no different from many other esolangs, which are not only valid, but usually well received. For example, a brainfuck interpreter could simply transpile all eight instructions to C/Python/whatever code, then run the result.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, I'd like to add that, if somebody considers Oration &lt;em&gt;boring&lt;/em&gt;, he can still downvote the answer. As long as votes are based on reasons that are intrinsic to the post's content, everybody is entitled to vote as he deems fit.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-03-31T03:48:51.980" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8846" PostTypeId="2" ParentId="8350" CreationDate="2016-03-30T22:01:09.607" Score="17" Body="&lt;h1&gt;System to Suggest Improvements (golfing help)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;An important part of this site is suggesting ways to shorten existing answers. However, there isn't a good way to do this. Comments are generally the accepted method, but that poses a few problems:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;New users can't make suggestions as they are unable to comment. This can (and has) cause(d) them to instead post a trivial variation of another answer because they can't suggest the change.&lt;/li&gt;&#xA;&lt;li&gt;If the author does accept your improvements, you do not receive any reputation for your hard work; the best you can get is a shout-out such as &quot;EDIT: thanks to &amp;lt;username&amp;gt; for saving &lt;em&gt;x&lt;/em&gt; bytes!&quot; added to the post. This could again lead people to post their own answer&lt;/li&gt;&#xA;&lt;li&gt;it is hard to describe some changes with a comment; often it requires pasting in the old section of code and the new code, taking up more of our valuable time and precious space on our screens.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The other option would be to suggest an edit, but that seems to have been &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1615/suggested-edits-reject-golfing&quot;&gt;rejected by meta&lt;/a&gt; (with good reason).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would personally love a &quot;suggest improvement/golf&quot; feature, as it makes up the majority of my activity on this site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This feature would require the author to accept it; otherwise things could get messy. &lt;/p&gt;&#xA;" OwnerUserId="41042" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-03-30T22:41:37.030" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8849" PostTypeId="1" CreationDate="2016-03-31T01:27:01.707" Score="-10" ViewCount="190" Body="&lt;p&gt;A large amount (20-60%) of the questions here are not code golf questions. It might also confuse new users.&lt;/p&gt;&#xA;" OwnerUserId="41088" LastEditorUserId="68942" LastEditDate="2021-06-09T05:34:02.720" LastActivityDate="2021-06-09T05:34:02.720" Title="Change the stackexhange subdomain to &quot;ppcg.stackexchange.com&quot; and let the original redirect" Tags="|discussion|feature-request|status-declined|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8850" PostTypeId="2" ParentId="8849" CreationDate="2016-03-31T02:12:38.397" Score="20" Body="&lt;h2&gt;Let's keep it as is&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We've been Programming Puzzles &amp;amp; Code Golf, otherwise known as CodeGolf.SE, since our inception 5 years ago. Our name &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5759/20469&quot;&gt;doesn't suit us perfectly&lt;/a&gt;, but it's part of our identity. And now that we're &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8538/20469&quot;&gt;graduating&lt;/a&gt;, we should avoid changing our identity and embrace what we've accomplished as CodeGolf.SE.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That aside, the subdomain name &quot;code golf,&quot; despite being only a subset of what we do here, is &lt;a href=&quot;https://en.wikipedia.org/wiki/Code_golf&quot; rel=&quot;nofollow noreferrer&quot;&gt;descriptive&lt;/a&gt;. &quot;PPCG&quot; is meaningless without context. Indeed, the rest of the Stack Exchange network knows us as Code Golf; few people know what &quot;PPCG&quot; is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So let's stay us.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-03-31T02:12:38.397" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8851" PostTypeId="1" CreationDate="2016-03-31T06:28:20.097" Score="6" ViewCount="273" Body="&lt;p&gt;On &lt;a href=&quot;https://codegolf.stackexchange.com/q/76604/20370&quot;&gt;this&lt;/a&gt; challenge, because of the way it is constructed, there aren't many ways to solve the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A bunch of answers have been called off as duplicate because they directly used a system call (for example, &lt;a href=&quot;https://codegolf.stackexchange.com/a/76632/20370&quot;&gt;here&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/76613/20370&quot;&gt;here&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/76623/20370&quot;&gt;and here&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although wrapping code in a system call is a trivial modification, the task itself is so trivial I don't think this notion still makes sense - all answers are trivial modifications of all other answers - just change the language and the specific library, the logic and structure stays the same.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On another note, if these answers are duplicate, how can any language which is not a command line language win? every answer is going to call some command line command at some level. I personally don't think prohibiting the natural approach to solving the challenge is a good idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, should these answers be considered duplicate?&lt;/p&gt;&#xA;" OwnerUserId="20370" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-05-04T17:19:24.030" Title="Are these answers duplicate?" Tags="|discussion|answers|duplicates|" AnswerCount="2" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8852" PostTypeId="2" ParentId="8851" CreationDate="2016-03-31T06:44:26.233" Score="-3" Body="&lt;h2&gt;Yes, they are duplicates&lt;/h2&gt;&#xA;&lt;p&gt;Our policy on duplicate answers is that, if one of the answers can be trivially modified to form the other(s), then they are duplicates, and all but the first should be deleted. This is in line with our policy on duplicate questions.&lt;/p&gt;&#xA;&lt;p&gt;The shortest Bash answer (so far) for the linked challenge is &lt;a href=&quot;https://codegolf.stackexchange.com/a/76608/45941&quot;&gt;&lt;code&gt;start www.ppcg.lol&lt;/code&gt;&lt;/a&gt;. Any answer that directly passes this code to the C API &lt;code&gt;system&lt;/code&gt; call is just thinly wrapping the original answer in a different language, and thus is not sufficiently distinct to not be a duplicate.&lt;/p&gt;&#xA;&lt;p&gt;In general, if you can take an answer whose code is &lt;code&gt;A&lt;/code&gt; and do &lt;code&gt;some_function(&amp;quot;A&amp;quot;)&lt;/code&gt; in your language, it's almost certainly too trivial of a modification to be worth a separate answer.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;On another note, if these &lt;em&gt;answers&lt;/em&gt; are duplicate&lt;em&gt;s&lt;/em&gt;, how can any language which is not a command line language win? Every answer is going &lt;em&gt;to&lt;/em&gt; call some command line command at some level.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I edited the above quote for clarity and grammar, italicizing the edited portions. While it is true that every language is run by starting a process in some fashion, we don't concern ourselves with that part, except for specifying arguments and inputs. The main concern in this case is that the answers in question are literally running another answer as part of the code.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-03-31T06:53:19.110" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8853" PostTypeId="2" ParentId="2140" CreationDate="2016-03-31T12:24:56.147" Score="-4" Body="&lt;p&gt;Your task is to create a program that outputs a random pizza recipe following this one rule:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;No random number choosers, you may have random text choosers.&#xA;All standard code-golf rules apply.&#xA;A sample output:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A simple PEPPARONI pizza sprinkled with fish and sausages.&#xA;Your program must have the following items:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Anchovies&lt;/li&gt;&#xA;&lt;li&gt;Fish&lt;/li&gt;&#xA;&lt;li&gt;An adjective for the pizza&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The program written with the shortest code wins.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Winner&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The winner shall be picked on April 3rd, 12AM on the time zone GMT+3.&lt;/p&gt;&#xA;" OwnerDisplayName="user47018" LastActivityDate="2016-03-31T12:24:56.147" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8854" PostTypeId="2" ParentId="8849" CreationDate="2016-03-31T12:58:30.323" Score="-2" Body="&lt;h1&gt;Let both coexist&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;When you go to codegolf.se, it keeps that URL (clicking around gets you to the same domain), but let the same be for ppcg.se.&lt;/p&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2016-03-31T12:58:30.323" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8856" PostTypeId="1" AcceptedAnswerId="8858" CreationDate="2016-04-01T00:35:22.083" Score="16" ViewCount="493" Body="&lt;p&gt;I'm trying to get advice on how to make my challenges better. One rule that I feel like I'm always specifying is what to do when an invalid input is given. There's really two main paradigms to take here. Either&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;No invalid inputs will be given. Invalid input results in undefined behavior. &lt;em&gt;or&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Inputs might be valid, and might be invalid. If they are invalid, you must clearly output that the input was invalid, e.g. by printing an error message, or a falsy value, or some other method. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Now obviously, this won't result in any hard-fast &lt;em&gt;rules&lt;/em&gt; about challenge-writing, but I'd like to get your opinions. Is a challenge more interesting/better written if it uses the first method or the second?&lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2017-12-01T12:35:33.650" Title="Should answers have to handle invalid inputs?" Tags="|discussion|code-golf|rules|challenge-quality|" AnswerCount="4" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8857" PostTypeId="2" ParentId="8856" CreationDate="2016-04-01T00:51:16.507" Score="6" Body="&lt;p&gt;I believe that the default for challenges is &quot;you will only be passed valid input and do not have to handle invalid input in a certain way&quot;. I make this clear in my challenges at least.&lt;/p&gt;&#xA;" OwnerUserId="36670" LastActivityDate="2016-04-01T00:51:16.507" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8858" PostTypeId="2" ParentId="8856" CreationDate="2016-04-01T00:54:08.913" Score="51" Body="&lt;h1&gt;No, invalid inputs may result in undefined behavior&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Requiring input validation only adds extraneous code to the answer and takes away from the challenge. &lt;/p&gt;&#xA;" OwnerUserId="40695" LastActivityDate="2016-04-01T00:54:08.913" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8859" PostTypeId="2" ParentId="2140" CreationDate="2016-04-01T04:43:50.227" Score="0" Body="&lt;h1&gt;Create a race condition&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your objective is to create program where concurrent threads race to produce a result. The program is simple. Print the sum of every element in the cartesian product of two sets.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An example of standard input would be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2 5 8 10 | 9 2 3 7 512 | 3 1 2 | 9 8 6 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The program would then need to spin up two separate threads to calculate each result, and the first thread (and only the first thread) to complete should print &quot;I WIN!&quot; and the answer without using mutexes or other synchronization methods.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You cannot use mutexes or synchronisation&lt;/li&gt;&#xA;&lt;li&gt;The operation must be run concurrently&lt;/li&gt;&#xA;&lt;li&gt;Standard input will contain any multiple of two sets, and the program should use (no of sets / 2) threads, as well as the main thread that spins everything.&lt;/li&gt;&#xA;&lt;li&gt;The order of execution on the slave threads is not important&lt;/li&gt;&#xA;&lt;li&gt;Some failure cases where more than one thread prints &quot;I WIN!&quot; is acceptable, but should be a rare case &lt;em&gt;Sandbox comment: Not sure about verifying this one? or should not bother at all?&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Sandbox comments&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I saw the TCP Server question and I liked the idea of a challenge that is specifically difficult for golfing languages, and I was thinking about a few ideas for challenges that might work based specifically on parallel programming failures. I'm not sure if this one really fits the bill, hoping for suggestions to improve the challenege itself before refining the criteria.&lt;/p&gt;&#xA;" OwnerUserId="49097" LastActivityDate="2016-04-01T04:43:50.227" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8860" PostTypeId="2" ParentId="2140" CreationDate="2016-04-01T09:36:00.977" Score="0" Body="&lt;h1&gt;A Tiny Raytracer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to make a tiny 2D raytracer to render beautiful ascii images.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your input will be an arbitrary 2D array delimited by newlines with the following structure&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;########&#xA;#9     #&#xA;#      #&#xA;#  ##  #&#xA;#  ##  #&#xA;#      #&#xA;#    ###&#xA;########&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The symbols are: &#xA;&lt;code&gt;0-9&lt;/code&gt; = Light source&#xA;&lt;code&gt;&lt;/code&gt; = Emptiness&#xA;&lt;code&gt;#&lt;/code&gt; = Wall&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your expected output should look like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;########&#xA;#987654#&#xA;#876543#&#xA;#76##32#&#xA;#65##00#&#xA;#543000#&#xA;#43000##&#xA;########&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;How Light Propagates&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Light will travel in a straight line from lightsources through empty space and will be completely blocked by walls. Light falls off according to this function:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;light_intensity = clamp(floor(9 - source_intensity * ||dist_to_lightsource||), 0, 9)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;|| ||&lt;/code&gt; is the euclidean norm between the cell containing the light source and the cell in question, with 1 cell = 1 unit. All light intensity values are clamped to be between &lt;code&gt;0-9&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Light falls on an empty cell &lt;code&gt;c&lt;/code&gt; whenever a straight line can be drawn from any part of &lt;code&gt;c&lt;/code&gt; to the cell containing the light source without passing through a wall. For example, here I have all of the cells affected by a light source marked as &lt;code&gt;*&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;########       ########&#xA;####   #       ####***#&#xA;#9   #     =&amp;gt;  #****#  &#xA;###    #       ###****#&#xA;### ####       ### ####&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Whenever there are multiple light sources, their contributions to the final light intensity are summed (and clamped to be between &lt;code&gt;0-9&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;################&#xA;#9            6#&#xA;################&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Should yield:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;################&#xA;#98765432223456#&#xA;################&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Standard code golfing rules. Input can have arbitrary size.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Fun Optional Bonuses&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output the result as a graphical image.&lt;/li&gt;&#xA;&lt;li&gt;Support light values of between 0-255 (in this case columns of the input and output will be space delimited)&lt;/li&gt;&#xA;&lt;li&gt;Support colors (in this case light will be denoted by a standard 24-bit hex code &lt;code&gt;0xFFFFFF&lt;/code&gt;, and space delimited).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;These don't give you any bonuses in the competition, but would be cool.&lt;/p&gt;&#xA;" OwnerUserId="52593" LastEditorUserId="52593" LastEditDate="2016-04-01T11:20:37.490" LastActivityDate="2016-04-01T11:20:37.490" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8861" PostTypeId="2" ParentId="2140" CreationDate="2016-04-01T11:53:37.537" Score="0" Body="&lt;h1&gt;Self-decrypting code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Caesar cipher is perhaps the earliest and most well known form of encryption. Here's a quick overview:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pick a message, and a numerical encryption key. For this example, I'll pick &quot;HELLO, WORLD&quot; and 3, respectively.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First, convert each letter into its ASCII number:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;H -&amp;gt; 72&#xA;E -&amp;gt; 69&#xA;L -&amp;gt; 76&#xA;L -&amp;gt; 76&#xA;O -&amp;gt; 79&#xA;, -&amp;gt; 44&#xA;[space] -&amp;gt; 32&#xA;W -&amp;gt; 87&#xA;O -&amp;gt; 79&#xA;R -&amp;gt; 82&#xA;L -&amp;gt; 76&#xA;D -&amp;gt; 68&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then, add the key (3) to each and convert back into a letter&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;75 -&amp;gt; K&#xA;72 -&amp;gt; H&#xA;79 -&amp;gt; O&#xA;79 -&amp;gt; O&#xA;82 -&amp;gt; R&#xA;47 -&amp;gt; /&#xA;35 -&amp;gt; #&#xA;90 -&amp;gt; Z&#xA;82 -&amp;gt; R&#xA;85 -&amp;gt; U&#xA;79 -&amp;gt; O&#xA;71 -&amp;gt; G&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So the encrypted message is &quot;KHOOR/#ZRUOG&quot;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Your task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a full program that is a Caesar cipher-encrypted valid English message. The program must take no input and it will output the unencrypted version of itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some rules: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program must be at least length 2.&lt;/li&gt;&#xA;&lt;li&gt;The key may not be 0, 32, or 256&lt;/li&gt;&#xA;&lt;li&gt;All of the code must be executed (no comments to arbitrarily extend code length).&lt;/li&gt;&#xA;&lt;li&gt;The Linux word list will be used to judge if a message is English. Words must be separated by ASCII character 32. Words can mix uppercase and lowercase.&lt;/li&gt;&#xA;&lt;li&gt;Your program does not need to be written in printable ASCII.&lt;/li&gt;&#xA;&lt;li&gt;File I/O is allowed, but only to read the source code file.&lt;/li&gt;&#xA;&lt;li&gt;No other standard loopholes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The submission with the &lt;strong&gt;longest&lt;/strong&gt; message wins. Anything over 200 characters will be scored as exactly 200 characters. Ties are broken by upvotes.&lt;/p&gt;&#xA;" OwnerUserId="41505" LastActivityDate="2016-04-01T11:53:37.537" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8862" PostTypeId="2" ParentId="2140" CreationDate="2016-04-01T16:44:43.950" Score="6" Body="&lt;h1&gt;Let's Play Unikong&lt;/h1&gt;&#xA;&lt;p&gt;In honor of April Fool's day, we shall have an epic battle to see who can play &lt;a href=&quot;http://mgnconflict.co/unikong&quot; rel=&quot;nofollow noreferrer&quot;&gt;Unikong&lt;/a&gt; best. Or, rather, whose program can play it best.&lt;/p&gt;&#xA;&lt;h2&gt;Goal&lt;/h2&gt;&#xA;&lt;p&gt;Write a program in any language to play the game Unikong. It should seek to try and score as high as possible.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Whomever's program has the highest average score, over 10 games wins.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;Standard rules apply. Additionally, your program must actually play the game, not change the score variable by some other means, and you can read the variables from the game to avoid trolls and downvotes, but not modify any variables to make it easier. I will run the tests myself and will use the first 10 runs to calculate the score. Please include any specific instructions needed to run your program.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Notes:&lt;/strong&gt; This would be my first question, so hopefully I got the format right. Are the rules clear enough? Do I need to clarify anything?&lt;/p&gt;&#xA;" OwnerUserId="48249" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-05T17:33:12.880" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8863" PostTypeId="2" ParentId="8856" CreationDate="2016-04-01T18:06:02.533" Score="15" Body="&lt;h1&gt;By default valid input is guaranteed&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If it's not, some behaviour should be specified:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any behaviour (but why specify this when it's defeult?)&lt;/li&gt;&#xA;&lt;li&gt;Handle it in some way and produce a specific value&lt;/li&gt;&#xA;&lt;li&gt;Produce any value in finite time without exceptions&lt;/li&gt;&#xA;&lt;li&gt;Produce any value or exception in finite time&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="32091" LastEditorUserId="20469" LastEditDate="2016-04-01T18:18:01.627" LastActivityDate="2016-04-01T18:18:01.627" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8865" PostTypeId="2" ParentId="2140" CreationDate="2016-04-02T02:10:02.467" Score="0" Body="&lt;h1&gt;Manual MD5&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hashing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hashing&amp;#39;&quot; rel=&quot;tag&quot;&gt;hashing&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a string, calculate its MD5 sum without using any built-in MD5 library functions. &lt;a href=&quot;https://en.wikipedia.org/wiki/MD5#Algorithm&quot; rel=&quot;nofollow noreferrer&quot;&gt;An overview of the algorithm is here.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;(I'm going to actually summarize the algorithm before I post it. Until then, it's still unfinished.)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Input is an ASCII string or byte stream with any reasonable length (I won't run an entire novel through your algorithm, for example).&lt;/p&gt;&#xA;&lt;p&gt;Output the hex value of the resultant hash as a string.&lt;/p&gt;&#xA;&lt;p&gt;Code golf, so shortest code wins. Standard loopholes are banned.&lt;/p&gt;&#xA;" OwnerUserId="52194" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-08T07:35:55.463" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8866" PostTypeId="1" AcceptedAnswerId="8868" CreationDate="2016-04-02T11:29:43.650" Score="9" ViewCount="256" Body="&lt;p&gt;I think the term &quot;malicious&quot; is not properly defined with regards to the intent of this community (please refer to: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4829/should-asking-for-malicious-code-be-on-topic&quot;&gt;Should asking for malicious code be on topic?&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do key-loggers qualify as malicious?&lt;/p&gt;&#xA;" OwnerUserId="51685" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2016-04-02T16:23:33.173" Title="Are key-logger questions allowed?" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8867" PostTypeId="2" ParentId="2140" CreationDate="2016-04-02T15:54:13.920" Score="0" Body="&lt;h2&gt;Calculate the number of consecutive 0's at the end of n!&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Simply put, write a program or function that takes &lt;code&gt;n&lt;/code&gt; and returns the number of consecutive 0's at the end of &lt;code&gt;n!&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: 12&#xA;Output: 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: 12345&#xA;Output: 3082&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: 100000&#xA;Output: 24999&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="47302" LastActivityDate="2016-04-02T15:54:13.920" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8868" PostTypeId="2" ParentId="8866" CreationDate="2016-04-02T16:23:33.173" Score="13" Body="&lt;h1&gt;Depends&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This depends but to me it boils down to one thing:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the scope of the question is to make a keylogger covert, then I would say it's malicious.&lt;/p&gt;&#xA;" OwnerUserId="40695" LastActivityDate="2016-04-02T16:23:33.173" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8870" PostTypeId="2" ParentId="2140" CreationDate="2016-04-03T04:46:06.937" Score="0" Body="&lt;h1&gt;How many pixels are in each ASCII char?&lt;/h1&gt;&#xA;&#xA;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program or function taking a single printable ASCII character as input that outputs how many pixels it takes to display that character to the screen.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input can be taken by any reasonable method, including reading from a file, STDIN, or function argument. Input from a variable hardcoded into the program is not reasonable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output may by given by any reasonable method, including writing to a file and STDOUT. Extraneous output is permitted as long as the result remains unambiguous.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;Printable ASCII character&quot; is defined as a character within the codepoints 32-126, inclusive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A pixel counts as part of a character if the pixel is non-white after the character is written to a white screen.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The required font is Times New Roman, 20pt.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do not hardcode the result.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Reference Solution: (JavaScript)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;//create a canvas to display the character&#xD;&#xA;var canvas = document.createElement(&quot;canvas&quot;)&#xD;&#xA;canvas.width = 100&#xD;&#xA;canvas.height = 100&#xD;&#xA;document.body.appendChild(canvas)&#xD;&#xA;&#xD;&#xA;var context = canvas.getContext(&quot;2d&quot;)&#xD;&#xA;&#xD;&#xA;//make the canvas white&#xD;&#xA;context.fillStyle = &quot;white&quot;&#xD;&#xA;context.fillRect(0, 0, 100, 100)&#xD;&#xA;&#xD;&#xA;//make the text black and set the font&#xD;&#xA;context.fillStyle = &quot;black&quot;&#xD;&#xA;context.font = &quot;20pt Times New Roman&quot;&#xD;&#xA;&#xD;&#xA;//ask for the char&#xD;&#xA;var char = prompt(&quot;Enter your ASCII char&quot;)&#xD;&#xA;   &#xD;&#xA;//draw the char&#xD;&#xA;context.fillText(char,50,50)&#xD;&#xA;&#xD;&#xA;//get the canvas pixel data&#xD;&#xA;var pixelData = context.getImageData(0, 0, 100, 100).data&#xD;&#xA;var pixelCount = 0&#xD;&#xA;for(var i = 0; i &amp;lt; pixelData.length; i+=4) {&#xD;&#xA;&#xD;&#xA;    //if the pixel isn't white, increment the counter&#xD;&#xA;	if(pixelData[i] != 255 || pixelData[i+1] != 255 || pixelData[i+2] != 255) pixelCount++&#xD;&#xA;}&#xD;&#xA;alert(pixelCount)&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="42844" LastEditorUserId="42844" LastEditDate="2016-04-03T05:21:27.300" LastActivityDate="2016-04-03T05:21:27.300" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8871" PostTypeId="1" AcceptedAnswerId="9658" CreationDate="2016-04-03T15:10:36.093" Score="5" ViewCount="358" Body="&lt;p&gt;When the program you write for a challenge writes/outputs to multiple of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;default outputs&lt;/a&gt;, are you, the answerer allowed to state which one is counted for the purposes for the challenge?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if my program&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Leaves the output on the stack&lt;/li&gt;&#xA;&lt;li&gt;Outputs to STDOUT&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Am I allowed to say that the output to stdout counts without having to clean up the stack?&lt;/p&gt;&#xA;" OwnerUserId="32686" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2016-07-24T21:23:40.393" Title="Choosing outputs for challenges" Tags="|discussion|policy|code-golf|answers|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8876" PostTypeId="2" ParentId="2140" CreationDate="2016-04-03T20:01:55.773" Score="-3" Body="&lt;h1&gt;Biggest single character&lt;/h1&gt;&#xA;&lt;p&gt;This challenge is simple, its like the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/busy-beaver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;busy-beaver&amp;#39;&quot; rel=&quot;tag&quot;&gt;busy-beaver&lt;/a&gt; challenges we've had before where the goal is to produce the biggest output one can. But in this one, you can only use &lt;strong&gt;one character in your code&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You get no input, your code has to be a single &lt;strong&gt;character&lt;/strong&gt; (not byte), and the person with the largest output in byte wins, ties broken by posting time.&lt;/p&gt;&#xA;" OwnerUserId="31343" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-03T20:01:55.773" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8877" PostTypeId="1" CreationDate="2016-04-03T20:23:39.303" Score="13" ViewCount="428" Body="&lt;p&gt;We've decided &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/4829/20469&quot;&gt;by community consensus&lt;/a&gt; that challenges asking for malicious code are off topic. But the question remains: At what point do we consider code to be malicious? Most of the time it's extremely obvious, but sometimes it's more subtle. For example, if code &lt;em&gt;could&lt;/em&gt; be used maliciously, even if it isn't the intent of the challenge author, do we consider it malicious?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/6249/20469&quot;&gt;Code Golf of Death&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/76947/20469&quot;&gt;Shortest code to secure wipe a disk&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/76965/20469&quot;&gt;Shortest code for key-logger&lt;/a&gt; (relevant meta discussion: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8866/20469&quot;&gt;Are key-logger questions allowed?&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I realize it's difficult to make an overarching judgement for this, but it would be good to have some kind of guiding principle.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-08-05T19:17:24.180" Title="What qualifies as malicious code?" Tags="|discussion|policy|" AnswerCount="4" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8879" PostTypeId="2" ParentId="8877" CreationDate="2016-04-03T22:35:21.967" Score="6" Body="&lt;p&gt;Here is a (not exhaustive) list of guidelines I would use for determining if code is malicious:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Does the user know what they are running? If they know they are going to run a keylogger, the blame is on them if anything bad happens. If they don't know it's a keylogger, then it's more on the malicious side of the line.&lt;/li&gt;&#xA;&lt;li&gt;Does the user have control? If the user can stop the program without any damage done (or none that can't easily be prevented or fixed), it's probably not malicious. If the program tries to prevent the user from taking control and terminating it, it's probably malicious.&lt;/li&gt;&#xA;&lt;li&gt;Can the user recover from it/safeguard against it? A user can recover from/safeguard against a program that wipes out the current directory (&lt;code&gt;rm -rf .&lt;/code&gt;), but not so much against a program that wipes the entire disk (&lt;code&gt;dd if=/dev/zero of=/dev/sda1&lt;/code&gt; or &lt;code&gt;sudo rm -rf --no-preserve-root&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I'll add more guidelines to this list as I think of them (or as they're suggested in comments).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2016-04-04T05:10:28.630" LastActivityDate="2016-04-04T05:10:28.630" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8880" PostTypeId="2" ParentId="8877" CreationDate="2016-04-03T23:02:35.380" Score="7" Body="&lt;p&gt;Anything &quot;malicious&quot; I'd say would fall into one of the following categories:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;intending or intended to do harm or damage (e.g. &lt;code&gt;sudo rm -rf / --no-preserve-root&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;doing anything against the user's will / deceiving the user (e.g. Skynet or Ultron)&lt;/li&gt;&#xA;&lt;li&gt;violating the user's privacy without permission (e.g. reading password)&lt;/li&gt;&#xA;&lt;li&gt;executing or spread against the user's knowledge or will (i.e. a virus)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="40695" LastActivityDate="2016-04-03T23:02:35.380" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8885" PostTypeId="2" ParentId="8851" CreationDate="2016-04-04T16:38:29.397" Score="-3" Body="&lt;h2&gt;Yes, they are duplicates&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Taking a slightly different approach to Mego's answer ...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Suppose you have some Perl binaries installed. Maybe they're even included as part of the base operating system install, so they can be considered &quot;default&quot; utilities (I'm sure there's some package out there that has Perl included by default).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Taking an existing Perl answer (&lt;a href=&quot;https://codegolf.stackexchange.com/a/77045/42963&quot;&gt;example&lt;/a&gt;), wrapping it with the underlying command-line argument, and calling it a Bash answer would be obviously frowned upon as a trivial modification of an existing answer. This is no different.&lt;/p&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-04-04T16:38:29.397" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8887" PostTypeId="2" ParentId="2140" CreationDate="2016-04-04T22:43:08.987" Score="1" Body="&lt;h1&gt;Zipdeck!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A few years ago I invented a simple card game named &quot;Zip Deck&quot;.  It's not that much fun for humans, but should be perfect for bots.  This contest will be run in Python 3.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Zip Deck rules:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are N players, and a deck with N*4 cards, numbered 0 to N*4-1.  The deck is shuffled (Python's &lt;code&gt;random.shuffle&lt;/code&gt; function) and each player is dealt a card.  Everyone looks at their card, then, on the count of three, if you believe you have the highest card, say (return) &quot;Zip Deck!&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you &lt;em&gt;do&lt;/em&gt; have the highest card and you said &quot;Zip Deck&quot;, you win!  You assign floor[C/4] points, divided between the other players any way you'd like, where C is the value of your card.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If either you said &quot;Zip Deck&quot; but &lt;em&gt;don't&lt;/em&gt; have the high card, or you do have the high card but &lt;em&gt;didn't&lt;/em&gt; say &quot;Zip Deck&quot;, you take a penalty of floor[C/4] points (min 1).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner is the player with the fewest total points after a set number of rounds (as of now, N&lt;sup&gt;2&lt;/sup&gt; rounds, but that's subject to change if there are many, many entrants).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What You Do:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a bot!  A bot is a descendant of the &lt;code&gt;Player&lt;/code&gt; class.  Your bot should have a function &lt;code&gt;play&lt;/code&gt; that takes two parameters, &lt;code&gt;card&lt;/code&gt; (the card you're dealt) and &lt;code&gt;info&lt;/code&gt; (a dictionary with information about the state of the game).  If your bot thinks it has the highest card, it should return an array containing the string &quot;Zip Deck!&quot; and a dictionary showing how it would assign points if it's correct.  If you don't assign enough points, your bot will take the remainder; if you assign too many, instead all of the points will be given to your bot that round.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;info&lt;/code&gt; dictionary contains the following keys:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;'round'&lt;/code&gt;: The current round, starting with zero.  Maybe your bot wants to get more reckless when the game's about to end?&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;'scores'&lt;/code&gt;: A dictionary containing every player's current score.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;'last'&lt;/code&gt;: A dictionary showing what everyone was dealt last round and what the bot returned (so an array with either an empty string or &quot;Zip Deck!&quot; plus their point allocation).  Useful if you're trying to determine the other players' strategy.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;An example &lt;code&gt;info&lt;/code&gt; from one of my test runs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{'scores': {0: 5, 1: 6, 2: 2, 3: 1}, &#xA;'last': {0: [12, ['']], 1: [10, ['Zip Deck!', {2: 2}]], 2: [15, ['Zip Deck!', {1: 3}]], 3: [3, ['Zip Deck!', {1: 0}]]}, &#xA;'round': 3}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Every &lt;code&gt;Player&lt;/code&gt; also has two attributes that you can access, &lt;code&gt;my_num&lt;/code&gt; (that player's number) and &lt;code&gt;player_count&lt;/code&gt; (the total number of players).  I've imported &lt;code&gt;random&lt;/code&gt; already (naturally); if you want to use any other standard library, just let me know.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;class YourBotHere(Player):&#xA;    def __init__(self, my_num, player_count):&#xA;        super(YourBotHere, self).__init__(my_num, player_count)&#xA;    def play(self, card, info):&#xA;        # Define your own play function for your class.&#xA;&#xA;        # If you think you're highest, return an array where the first element is the&#xA;        # phrase &quot;Zip Deck!&quot;, and the second is a dictionary for how you'd assign points&#xA;        # if you win.&#xA;        # E.g. [&quot;Zip Deck!&quot;, {0: 2, 1: 2, 4: 1}]&#xA;&#xA;        # If you don't think you're highest, return an array with one element, the empty&#xA;        # string (or anything that's not &quot;Zip Deck!&quot;)&#xA;&#xA;        return [&quot;&quot;]&#xA;&#xA;class Player(object):&#xA;    def __init__(self, my_num, player_count):&#xA;        self.my_num = my_num&#xA;        self.player_count = player_count&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Example bots:&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;class Rando(Player):&#xA;    def __init__(self, my_num, player_count):&#xA;        super(Rando, self).__init__(my_num, player_count)&#xA;    def play(self, card, info):&#xA;        if random.random() &amp;gt; 0.5:&#xA;            target = {i for i in range(self.player_count)} - {self.my_num}&#xA;            target = random.choice(tuple(target))&#xA;            points = card//4&#xA;            return [&quot;Zip Deck!&quot;, {target: points}]&#xA;        else:&#xA;            return [&quot;&quot;]&#xA;&#xA;class Serpentine(Player):&#xA;    # Zigs and zags, trying not to do the same thing too many times in a row.&#xA;    def __init__(self, my_num, player_count):&#xA;        super(Serpentine, self).__init__(my_num, player_count)&#xA;        self.two_back = True&#xA;        self.one_back = False&#xA;        self.targets = {i for i in range(self.player_count)} - {self.my_num}&#xA;    def play(self, card, info):&#xA;        if len(self.targets) == 0:&#xA;            self.targets = {i for i in range(self.player_count)} - {self.my_num}&#xA;        will_call = False&#xA;        if self.two_back == self.one_back:&#xA;            will_call = not self.two_back&#xA;        elif card/(self.player_count*4) &amp;gt; 0.8:&#xA;            will_call = True&#xA;&#xA;        self.two_back = self.one_back&#xA;        self.one_back = will_call&#xA;&#xA;        if will_call:&#xA;            target = self.targets.pop()&#xA;            return [&quot;Zip Deck!&quot;, {target: card//4}]&#xA;        else:&#xA;            return [&quot;&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Controller&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The controller code can be found on &lt;a href=&quot;https://github.com/madjaqk/zipdeck&quot; rel=&quot;nofollow noreferrer&quot;&gt;my GitHub&lt;/a&gt; (along with most of these instructions again verbatim).  [You can also see OrionBot, the one entry I got when I tried to run this competition in class; I'll remove it so that only PPCG bots are in the tournament before this goes live.]  Intentionally bad or losing strategies are OK, but bots that attempt to crash the controller/cause an infinite loop will be disallowed, as are bots that collude or cooperate in any way.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Concerns&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;First and most importantly, does everything in the rules write-up make sense?  Are there any loopholes I haven't considered?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This game is straightforward enough that the winning strategy might be completely boring, but I don't think it's necessarily obvious that it will be.  Also, I would have said that rock-paper-scissors-lizard-spock has a very clear and well-known best strategy in game-theoretic terms, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35079/the-rock-paper-scissors-lizard-spock-tournament-of-epicness&quot;&gt;that challenge&lt;/a&gt; still saw a dizzying array of answers.&lt;/p&gt;&#xA;" OwnerUserId="47796" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.193" LastActivityDate="2016-04-05T17:02:33.540" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8890" PostTypeId="2" ParentId="2140" CreationDate="2016-04-05T01:36:27.417" Score="1" Body="&lt;p&gt;Inspired by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1332/31541&quot;&gt;this&lt;/a&gt;, but also different. I need help phrasing things, putting them together coherently, etc.&lt;/p&gt;&#xA;&lt;p&gt;Also, I can't decide on what the magic numbers (size, toggles per turn, etc.) should be.&lt;/p&gt;&#xA;&lt;p&gt;Lastly, is this even winnable?&lt;/p&gt;&#xA;&lt;p&gt;(oh, and if anyone wants to write a nice &amp;quot;backstory&amp;quot;, that'd be much appreciated)&lt;/p&gt;&#xA;&lt;p&gt;(also I have a couple of notes to myself in there so I remember what I was doing when I come back to this later)&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Murderous Life&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cellular-automata&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cellular-automata&amp;#39;&quot; rel=&quot;tag&quot;&gt;cellular-automata&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game-of-life&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game-of-life&amp;#39;&quot; rel=&quot;tag&quot;&gt;game-of-life&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Overview&lt;/h3&gt;&#xA;&lt;p&gt;The game is played on a 100-cell-wide, 300-cell-long board. It's cylinder-shaped -- patterns will wrap around the long sides, but not the short ones. Attempts to toggle cells behind the short edges will fail, and all cells along the short edge are considered dead. The center 200x100 area (the &amp;quot;no man's land&amp;quot;) is the focus of the game. The farthest left 50x100 area (next to the origin) is the Police Headquarters, and is where the police can send units from. The far right is the Robber Hideout, and is where they operate from.&lt;/p&gt;&#xA;&lt;p&gt;Your program will communicate with the controller via standard input and output. Each message is terminated with a newline (&lt;code&gt;\n&lt;/code&gt;, ASCII code 10). The code your program &lt;em&gt;must&lt;/em&gt; exit when it receives Control+C (ASCII code 3). It doesn't have to stop immediately -- for example, if you have to close IO handles -- but it should take less than a second. It also doesn't have to end cleanly -- throwing an error is fine. As long as you've tidied up after yourself.&lt;/p&gt;&#xA;&lt;p&gt;Immediately, both programs print to STDOUT their name and their author's name, with a hyphen in between, followed by a newline. This signals that they are ready to begin receiving input. After that, the turns will start immediately. The turns work like this:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Both players are sent a string containing the current map through their STDIN. The format is detailed below.&lt;/li&gt;&#xA;&lt;li&gt;The desired moves are collected from each program in no particular order.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Note: If the moves are invalid for any reason -- they attempt to change a blocked square, too long, fail to precisely match the format, anything like that -- then the program is immediately ejected from the game, and I'll drop a comment on your post letting you know what happened.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;All of the moves are applied at once to the board&lt;/li&gt;&#xA;&lt;li&gt;One iteration of Conway's Game of Life (standard rules) is run on the map.&lt;/li&gt;&#xA;&lt;li&gt;The number of living cells in the No Man's Land is tallied.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The game runs for 5000 turns, after which the average number of living squares in the No Man's Land is calculated. This is the score of both the cop and the robber. Once three answers of each type have been submitted -- aside from the example ones -- I'll begin playing the answers against each other. The scoreboard will be updated daily until at least a week after the first answers have been submitted, or if it's later, three days after the last one has. The full score of any given program is the average of all of its scores.&lt;/p&gt;&#xA;&lt;p&gt;Each program will be played against every other exactly once. Any attempts to communicate or disrupt the other AI -- except through the board -- are banned. If your bot doesn't respond to CTRL+D or CTRL+C, it will be banned.&lt;/p&gt;&#xA;&lt;p&gt;Note that, if you have to do some cleanup before exiting, that's fine -- the &amp;quot;kill switches&amp;quot; don't have to work instantly. They do, however, have to work quickly. They can throw an error or something like that if you like.&lt;/p&gt;&#xA;&lt;p&gt;You can always assume you'll get valid input.&lt;/p&gt;&#xA;&lt;h3&gt;In Cops version:&lt;/h3&gt;&#xA;&lt;p&gt;The point of the game, for the cops, is to keep the board as dead as possible. You can toggle up to 30 cells in the Police Headquarters per turn, creating or removing whatever patterns you like. At the end of the game, the Cop program with the lowest score wins.&lt;/p&gt;&#xA;&lt;h3&gt;In Robbers version:&lt;/h3&gt;&#xA;&lt;p&gt;The point of the game, for the robbers, is to make as many cells in the No Man's Land alive as possible. You can toggle up to 20 cells in the Robber Hideout per turn, in whatever arrangement you want. At the end of the game, the Robber program with the highest score wins.&lt;/p&gt;&#xA;&lt;p&gt;[link to the opposite side's version]&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Message format&lt;/h3&gt;&#xA;&lt;p&gt;Aside from the initial name string, all messages passed between programs will be like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1,4 12,0 9,125 299,6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Each pair is a coordinate pair, with the X values first and Y values second. The origin is at the top left of the board -- on the Police side of the board. The indexes are zero-based.&lt;/p&gt;&#xA;&lt;p&gt;To be explicitly clear, the format is a space-delimited string of pairs. Each pair consists of two base-ten numbers, between 1 and 3 digits long, separated by a comma. The first number must not have a value greater than 299 or less than 0, and the second number must not have a value greater than 99 or less than 0. In addition, the first number must be between 0 and 49 (inclusive) if the player is a Cop, or between 250 and 299 (inclusive) if the player is a Robber.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I've written a basic example bot. To change what side it's on, simple change the comments on the lines indicated.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;# Uncomment the part marked with the team this one should be on&#xA;#Cops&#xA;place_at = (0..47).to_a.product (0..97).to_a&#xA;glider = [[1, 0], [2, 1], [0, 2], [1, 2], [2, 2]]&#xA;toggles = 30&#xA;#Robbers&#xA;place_at = (0..47).to_a.product (0..97).to_a&#xA;glider = [[1, 0], [0, 1], [2, 2], [1, 2], [0, 2]]&#xA;toggles = 20&#xA;&#xA;puts 'GliderLover-QPaysTaxes'&#xA;&#xA;while gets&#xA;  # We don't care what the board is like in this dumb AI.&#xA;  puts toggles.times.map {&#xA;    loc = place_at.sample&#xA;    glider.map { |offset| loc.zip(offset).map { |(a, b)| a+b }.join ',' }.join ' '&#xA;  }.join ' '&#xA;end&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Is there anything else I need to specify?&lt;/p&gt;&#xA;" OwnerUserId="31541" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-11T19:38:42.547" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8891" PostTypeId="2" ParentId="8798" CreationDate="2016-04-05T04:22:28.033" Score="36" Body="&lt;h1&gt;Elo ratings, treating pairs of submissions as games.&lt;/h1&gt;&#xA;&lt;p&gt;I'm using the Elo system here.&lt;/p&gt;&#xA;&lt;p&gt;Essentially, the solution is find the best solutions in each language to each challenge, and then treat each pair of such solutions as a match between those two languages, with the winner being the shorter submission.&lt;/p&gt;&#xA;&lt;p&gt;Languages with less than 10 entries are discarded, and languages have a starting rating of 1000.&lt;/p&gt;&#xA;&lt;p&gt;One drawback of this system is that ELO favors more recent entries. To compensate, I used a relatively low &lt;code&gt;K&lt;/code&gt; value, which makes updates slower, and so old answer count for more.&lt;/p&gt;&#xA;&lt;p&gt;The data is from &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/459681&quot; rel=&quot;nofollow noreferrer&quot;&gt;this query&lt;/a&gt;, courtesy of Alex A. To run the code, put the two code blocks below in files with the names given, put the query csv file in ratings.csv, and run parse.py&lt;/p&gt;&#xA;&lt;h2&gt;New results, with bug fix&lt;/h2&gt;&#xA;&lt;p&gt;In the old version of the code, there were two bugs:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Answers with hyperlinks in the header were not counted.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Languages with numbers in the name were not counted.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I have fixed both bugs. In doing so, the code now considers differently named versions of a language (e.g. Python 2.7 and Python 2) to be different languages. I don't think this is a major problem - allowing languages with numbers in the name is much more important.&lt;/p&gt;&#xA;&lt;p&gt;Also, since many more answers are correctly parsed, more languages meet the threshold to be displayed.&lt;/p&gt;&#xA;&lt;h3&gt;March 2024 Results:&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;Thunno 2:                         2044&#xA;Vyxal:                            2015&#xA;Nekomata:                         1991&#xA;Jelly:                            1973&#xA;Husk:                             1967&#xA;Nibbles:                          1965&#xA;Vyxal 3:                          1918&#xA;SOGL V0.12:                       1905&#xA;Neim:                             1879&#xA;05AB1E:                           1871&#xA;Stax:                             1865&#xA;MathGolf:                         1827&#xA;Pyke:                             1820&#xA;MATL:                             1815&#xA;Canvas:                           1790&#xA;Japt v2.0a0:                      1769&#xA;Japt:                             1768&#xA;Brachylog:                        1755&#xA;Ohm:                              1705&#xA;Gaia:                             1701&#xA;Ohm v2:                           1695&#xA;Pyt:                              1693&#xA;Actually:                         1687&#xA;Pyth:                             1669&#xA;Convex:                           1633&#xA;Jolf:                             1616&#xA;Pushy:                            1545&#xA;Dyalog APL:                       1528&#xA;Burlesque:                        1528&#xA;APL:                              1525&#xA;Keg:                              1505&#xA;Pip:                              1501&#xA;CJam:                             1495&#xA;V:                                1493&#xA;BQN:                              1492&#xA;Charcoal:                         1479&#xA;cQuents:                          1470&#xA;TeaScript:                        1436&#xA;Uiua:                             1425&#xA;k:                                1407&#xA;Haskell + hgl:                    1386&#xA;x86 Machine Code:                 1382&#xA;x86 32:                           1381&#xA;J:                                1373&#xA;:                            1367&#xA;x86:                              1358&#xA;K4:                               1350&#xA;Attache:                          1324&#xA;stacked:                          1303&#xA;Braingolf:                        1303&#xA;Ly:                               1299&#xA;Add++:                            1280&#xA;Golfscript:                       1278&#xA;q/kdb+:                           1218&#xA;Aceto:                            1211&#xA;MY:                               1163&#xA;Q:                                1162&#xA;Vim:                              1156&#xA;TI:                               1147&#xA;Julia 1.0:                        1146&#xA;Raku:                             1145&#xA;Fourier:                          1123&#xA;Julia 0.6:                        1117&#xA;Octave:                           1107&#xA;Runic Enchantments:               1106&#xA;Factor:                           1104&#xA;APL+WIN:                          1101&#xA;Wolfram Language:                 1097&#xA;Proton:                           1082&#xA;Cubix:                            1073&#xA;Ruby:                             1067&#xA;PARI/GP:                          1057&#xA;Octave / Matlab:                  1057&#xA;bash+coreutils:                   1054&#xA;Matlab/Octave:                    1048&#xA;Regex:                            1043&#xA;QBIC:                             1042&#xA;Retina:                           1040&#xA;Curry:                            1039&#xA;DC:                               1030&#xA;Mathematica:                      1026&#xA;Julia:                            1019&#xA;Perl:                             1015&#xA;Bubblegum:                        1014&#xA;Retina 0.8.2:                     1011&#xA;MAWP:                             1005&#xA;R:                                1004&#xA;Cheddar:                          996&#xA;Labyrinth:                        985&#xA;Perl 5:                           963&#xA;Hexagony:                         951&#xA;Desmos:                           947&#xA;Arturo:                           940&#xA;Haskell:                          936&#xA;jq:                               934&#xA;Röda:                             934&#xA;befunge:                          926&#xA;JavaScript:                       915&#xA;CoffeeScript:                     912&#xA;Bash:                             912&#xA;Perl 6:                           904&#xA;Python 2:                         899&#xA;Zsh:                              895&#xA;GNU sed:                          890&#xA;Postscript:                       889&#xA;Alice:                            882&#xA;jq 1.5:                           878&#xA;Matlab:                           863&#xA;Groovy:                           852&#xA;CHIP:                             840&#xA;sed:                              824&#xA;Python 3.5:                       824&#xA;PowerShell Core:                  822&#xA;Python:                           813&#xA;AWK:                              807&#xA;PHP:                              797&#xA;Java:                             792&#xA;Knight:                           791&#xA;Python 3:                         790&#xA;Clojure:                          787&#xA;SmileBASIC:                       775&#xA;ES6:                              764&#xA;C:                                759&#xA;PowerShell:                       755&#xA;Python 3.6:                       749&#xA;QBasic:                           739&#xA;Elixir:                           729&#xA;Excel:                            725&#xA;Processing:                       722&#xA;PowerShell v2+:                   710&#xA;Python 3.8:                       705&#xA;Excel VBA:                        701&#xA;MMIX:                             692&#xA;Kotlin:                           684&#xA;Java 8:                           681&#xA;Scala 3:                          678&#xA;JavaScript ES6:                   672&#xA;Prolog:                           665&#xA;Google Sheets:                    664&#xA;Forth:                            646&#xA;Icon:                             639&#xA;Clean:                            637&#xA;REXX:                             635&#xA;Red:                              631&#xA;Yabasic:                          618&#xA;Batch:                            598&#xA;8th:                              583&#xA;VBA:                              580&#xA;Java 11:                          577&#xA;SpecBAS:                          574&#xA;T:                                571&#xA;Python 2.7:                       566&#xA;C#:                               565&#xA;Scala:                            561&#xA;Windows Batch:                    550&#xA;Rust:                             540&#xA;Dart:                             530&#xA;Swift:                            516&#xA;Common Lisp:                      513&#xA;tinylisp:                         494&#xA;Tcl:                              493&#xA;Fortran:                          491&#xA;Java 7:                           489&#xA;Lua:                              485&#xA;Brainfuck:                        470&#xA;Java 10:                          469&#xA;TSQL:                             467&#xA;Nim:                              467&#xA;F#:                               467&#xA;Swift 3:                          432&#xA;SWI:                              428&#xA;C++14:                            416&#xA;D:                                410&#xA;Racket:                           404&#xA;SNOBOL4:                          375&#xA;Oracle SQL 11.2:                  349&#xA;C++:                              349&#xA;Brain:                            343&#xA;Scratch:                          326&#xA;Go:                               318&#xA;Rockstar:                         295&#xA;Pascal:                           281&#xA;Whitespace:                       277&#xA;TS Type System:                   201&#xA;Deadfish~:                        169&#xA;Taxi:                             58&#xA;Shakespeare Programming Language: 15&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Editors note: The cutoff was set to &lt;code&gt;45&lt;/code&gt; when generating the list, as it was the smallest cutoff (that was a multiple of 5) that didn't give any false positives like languages named &lt;code&gt;46 bytes&lt;/code&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Editors second note: Because so many different names are used for &amp;quot;TS Type System&amp;quot;, any lowercase language name matching the regex &lt;code&gt;typescript('s)?[^t]*types? *(system)?&lt;/code&gt; is considered to be TS Type System.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Code:&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;elo.py:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;STARTING = 1000&#xA;SCALE = 400&#xA;K = 10&#xA;PAD = 50&#xA;&#xA;import itertools&#xA;def concat(x):&#xA;    return list(itertools.chain.from_iterable(x))&#xA;&#xA;class Ratings:&#xA;    def __init__(self, challenges):&#xA;        langs = concat(challenges)&#xA;        self.ratings = {lang: STARTING for lang in langs}&#xA;        for challenge in challenges:&#xA;            self.update_challenge(challenge)&#xA;&#xA;    def update_game(self, first, second, score):&#xA;        f_rat = self.ratings[first]&#xA;        s_rat = self.ratings[second]&#xA;&#xA;        f_exp = 1/(1 + 10 ** ((s_rat - f_rat) / 400))&#xA;        s_exp = 1/(1 + 10 ** ((f_rat - s_rat) / 400))&#xA;&#xA;        f_upd = K * (score - f_exp)&#xA;        s_upd = K * ((1 - score) - s_exp)&#xA;&#xA;        self.ratings[first] += f_upd&#xA;        self.ratings[second] += s_upd&#xA;&#xA;    def update_challenge(self, scores):&#xA;        for lang1 in sorted(scores):&#xA;            for lang2 in sorted(scores):&#xA;                if lang1 &amp;gt; lang2:&#xA;                    s1 = scores[lang1]&#xA;                    s2 = scores[lang2]&#xA;                    result = 1 if s1 &amp;lt; s2 else 0.5 if s1 == s2 else 0&#xA;                    self.update_game(lang1, lang2, result)&#xA;&#xA;    def __str__(self):&#xA;        return '\n'.join(key + ':' +&#xA;                ' ' * (max(len(lang) + 1 for lang in self.ratings) - len(key)) + str(val)&#xA;                         for key, val in sorted(((lang, int(self.ratings[lang]))&#xA;                             for lang in self.ratings),&#xA;                             key=lambda x:x[::-1], reverse=True))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;parse.py&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;import csv&#xA;import re&#xA;import elo&#xA;&#xA;CUTOFF = 100  # change as needed&#xA;&#xA;lines = []&#xA;scores = {}&#xA;challenges = []&#xA;lang_counts = {}&#xA;canon_to_actual = {}&#xA;&#xA;ALIASES = {&amp;quot;typescript('s)?[^t]*types? *(system)?&amp;quot;: &amp;quot;TS Type System&amp;quot;}&#xA;&#xA;ALIAS_KEYS = ALIASES.keys()&#xA;&#xA;with open(&amp;quot;merged.csv&amp;quot;, encoding=&amp;quot;utf-8&amp;quot;) as csvfile:&#xA;    reader = csv.DictReader(csvfile)&#xA;    for row in reader:&#xA;        lines.append((row[&amp;quot;FirstLine&amp;quot;], row[&amp;quot;ParentId&amp;quot;]))&#xA;&#xA;count = 0&#xA;for line, challenge in lines:&#xA;    line = re.sub(&amp;quot;&amp;lt;s(trike)?&amp;gt;.*&amp;lt;/s(trike)?&amp;gt;&amp;quot;, &amp;quot;&amp;quot;, line)&#xA;    line = re.sub(&amp;quot;&amp;lt;a[^&amp;gt;]*&amp;gt;&amp;quot;, &amp;quot;&amp;quot;, line)&#xA;    line = re.sub(&amp;quot;&amp;lt;/a&amp;gt;&amp;quot;, &amp;quot;&amp;quot;, line)&#xA;    match = re.match(&amp;quot;&amp;lt;.*&amp;gt;(.*)&amp;lt;/.*&amp;gt;&amp;quot;, line)&#xA;    if match:&#xA;        line = match.group(1)&#xA;        lang = re.match(&amp;quot;([^-,\(:]*)&amp;quot;, line)&#xA;        if lang:&#xA;            lang = lang.group(1).strip()&#xA;            for alias in ALIAS_KEYS:&#xA;                if re.match(alias, lang.lower(), re.IGNORECASE):&#xA;                    lang = ALIASES[alias]&#xA;                    break&#xA;            canon = lang.lower().replace(&amp;quot; &amp;quot;, &amp;quot;&amp;quot;)&#xA;            canon_to_actual[canon] = lang&#xA;            score = re.findall(r&amp;quot;(\d+(?:\.\d+)?)[^0-9]+bytes?&amp;quot;, line)&#xA;            if score:&#xA;                score = score[-1]&#xA;                score = eval(score.lstrip(&amp;quot;0&amp;quot;) or &amp;quot;0&amp;quot;)&#xA;                c = scores.get(challenge, [])&#xA;                c.append((canon, score))&#xA;                scores[challenge] = c&#xA;                lang_counts[canon] = lang_counts.get(canon, 0) + 1&#xA;&#xA;for c in sorted(scores, key=int):&#xA;    results = scores[c]&#xA;    c_map = {}&#xA;    for canon, score in results:&#xA;        if lang_counts[canon] &amp;gt;= CUTOFF and re.match(&amp;quot;\w&amp;quot;, canon):&#xA;            lang = canon_to_actual[canon]&#xA;            old_score = c_map.get(lang, score)&#xA;            c_map[lang] = min(score, old_score)&#xA;    challenges.append(c_map)&#xA;&#xA;print(elo.Ratings(challenges))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Here are the original ratings, generated with the buggy code, for posterity.&lt;/p&gt;&#xA;&lt;h3&gt;2016 Results&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;Jelly:                1906&#xA;Pyth:                 1711&#xA;GS:                   1674&#xA;Japt:                 1653&#xA;MATL:                 1607&#xA;Dyalog APL:           1580&#xA;J:                    1579&#xA;CJam:                 1578&#xA;Jolf:                 1559&#xA;Seriously:            1535&#xA;TeaScript:            1499&#xA;GolfScript:           1497&#xA;Pip:                  1478&#xA;Burlesque:            1460&#xA;APL:                  1443&#xA;O:                    1427&#xA;Vitsy:                1424&#xA;:                1384&#xA;Vim:                  1371&#xA;q:                    1355&#xA;K:                    1322&#xA;TI:                   1301&#xA;sh:                   1294&#xA;Octave:               1289&#xA;PARI/GP:              1272&#xA;dc:                   1269&#xA;GNU sed:              1229&#xA;Retina:               1213&#xA;x:                    1209&#xA;Bash + coreutils:     1207&#xA;Bash + GNU utilities: 1201&#xA;bc:                   1189&#xA;golflua:              1187&#xA;Sed:                  1182&#xA;HTML:                 1168&#xA;Julia:                1165&#xA;QBasic:               1156&#xA;Sage:                 1146&#xA;Ruby:                 1124&#xA;AWK:                  1101&#xA;ZSH:                  1086&#xA;Mathematica:          1083&#xA;Gema:                 1079&#xA;Bash:                 1079&#xA;jq:                   1060&#xA;Haskell:              1051&#xA;MATLAB:               1042&#xA;PowerShell v:         1028&#xA;Perl:                 1028&#xA;BBC BASIC:            1022&#xA;Piet:                 1019&#xA;Score:                1018&#xA;Shell script:         1017&#xA;Mumps:                1015&#xA;Languages:            1013&#xA;ECMAScript:           1012&#xA;Regex:                1000&#xA;LiveScript:           993&#xA;Tcl:                  989&#xA;CoffeeScript:         988&#xA;Groovy:               986&#xA;Postscript:           984&#xA;Windows PowerShell:   981&#xA;Powershell:           966&#xA;R:                    964&#xA;Befunge:              964&#xA;gawk:                 951&#xA;AutoHotkey:           934&#xA;Javascript ES:        931&#xA;Smalltalk:            928&#xA;STATA:                926&#xA;Matlab/Octave:        926&#xA;REBOL:                923&#xA;SAS:                  917&#xA;Clojure:              913&#xA;ES:                   909&#xA;PHP:                  908&#xA;Dart:                 908&#xA;Python:               894&#xA;JavaScript:           894&#xA;Node.js:              893&#xA;F#:                   880&#xA;Marbelous:            875&#xA;Excel VBA:            858&#xA;AutoIt:               853&#xA;Shell:                850&#xA;Common Lisp:          845&#xA;Brainfuck:            843&#xA;Lua:                  835&#xA;Processing:           832&#xA;Scheme:               824&#xA;CSS:                  823&#xA;Pure bash:            821&#xA;SWI:                  786&#xA;Game Maker Language:  785&#xA;FORTH:                778&#xA;SpecBAS:              776&#xA;Scala:                772&#xA;Cobra:                769&#xA;HTML + JavaScript:    758&#xA;Whitespace:           750&#xA;Applescript:          739&#xA;T:                    724&#xA;Batch:                720&#xA;Fortran:              715&#xA;Prolog:               711&#xA;Turing Machine Code:  708&#xA;C:                    706&#xA;SQL:                  704&#xA;VBA:                  703&#xA;Factor:               700&#xA;Kotlin:               690&#xA;JS:                   686&#xA;Pascal:               685&#xA;Erlang:               674&#xA;Emacs Lisp:           673&#xA;OCaml:                668&#xA;Racket:               658&#xA;VBScript:             654&#xA;VB.NET:               643&#xA;Swift:                636&#xA;D:                    621&#xA;Windows Batch:        612&#xA;Ceylon:               591&#xA;C++:                  587&#xA;Java:                 559&#xA;Oracle SQL:           548&#xA;Delphi:               539&#xA;Go:                   537&#xA;C#:                   535&#xA;Rust:                 528&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="78850" LastEditDate="2024-03-27T13:15:28.420" LastActivityDate="2024-03-27T13:15:28.420" CommentCount="18" ContentLicense="CC BY-SA 4.0" />
  <row Id="8893" PostTypeId="2" ParentId="2140" CreationDate="2016-04-05T04:51:52.087" Score="5" Body="&lt;h1&gt;Interpret a Formal Grammar&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a context-free grammar, and a string, parse the string using the formal grammar and output the matches for the non-terminals.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;First line is string, following lines are grammar, then is the main grammar to parse, last line is output.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;123&#xA;&#xA;n -&amp;gt; any of&#xA;     0 1 2 3 4 5 6 7 8 9&#xA;N -&amp;gt; n N&#xA;     n&#xA;&#xA;N&#xA;&#xA;N [ n [1], n [2], n [3] ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2+2*(4/2)&#xA;&#xA;o -&amp;gt; any of&#xA;     + - / *&#xA;n -&amp;gt; any of&#xA;     0 1 2 3 4 5 6 7 8 9&#xA;E -&amp;gt; o E E'&#xA;     ( E ) E'&#xA;     n E'&#xA;E' -&amp;gt; o E E'&#xA;     o E'&#xA;     ε&#xA;&#xA;E&#xA;&#xA;E [ n [2], E' [ o [+], E [ n [2], E' [ε]  ] ] ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a b&#xA;&#xA;S -&amp;gt; S' S&#xA;     ε&#xA;S' -&amp;gt; a   b&#xA;&#xA;S&#xA;&#xA;S [ S' [a], S' [ ], S' [b] ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This grammar is the same as regex: &lt;code&gt;[a b]+&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Spec&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Details:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All recursion will be right-recursive&lt;/li&gt;&#xA;&lt;li&gt;Rule names will consist of &lt;code&gt;A-Z a-z α β γ Γ&lt;/code&gt; and may have a &lt;code&gt;'&lt;/code&gt; at the end.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Valid Rule names:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;A&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Γ&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;AB&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;αβ&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;foo'&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;faαβdg'&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Invalid Rule names:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;'ab&lt;/code&gt; (&lt;code&gt;'&lt;/code&gt; will be at the end)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ab''&lt;/code&gt; (two &lt;code&gt;''&lt;/code&gt;s)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;code golf&lt;/code&gt; (spaces not allowed in rule names)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Nonterminals will be lowercase, terminals upercase&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A derivation format will be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;rule name&amp;gt; -&amp;gt; &amp;lt;rule&amp;gt;&#xA;               &amp;lt;rule&amp;gt;&#xA;               &amp;lt;rule, etc.&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;meaning the rules will be lined up (when in a monospace font), by spaces.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;Symbols/rule-names will never be repeated&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ε&lt;/code&gt; (epsilon) means empty. i.e. &lt;code&gt;&quot;&quot;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Rule definition:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the initial rule is &quot;any of&quot;, the second rule will exist and will be a space separated list of symbols/rule-names (maybe more than one char). There will be no rules after this&lt;/li&gt;&#xA;&lt;li&gt;Else, the rule will consist of space-seperated tokens which either refer to a rule or a literal. If it is not a valid rule name, assume it is a literal which should be treated as if it is a terminal.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Summing up, for input you will be given the string to parse, the grammar, and the rule to parse.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You may output in whichever format you like as long as it is able to convey the following information. You must somehow label the match to their respective rule names. You may optionally not label terminals.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge Rules:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Feel free to assume the input can always be parsed by the given grammar.&lt;/li&gt;&#xA;&lt;li&gt;External libraries (ones that have to be imported), are not allowed&lt;/li&gt;&#xA;&lt;li&gt;If your language has built-in parsing tools (e.g. regex) those are allowed&lt;/li&gt;&#xA;&lt;li&gt;If your language has a built-in to parse a grammar (i.e. some formal grammar parser), these are allowed but your solution is non-competing and you must clearly state this in the &lt;strong&gt;header&lt;/strong&gt; of your answer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest code in bytes wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I may award a bounty to any particularly ingenious solutions, so try to add an explanation!&lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="40695" LastEditDate="2016-08-07T22:56:06.307" LastActivityDate="2016-08-07T22:56:06.307" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8895" PostTypeId="2" ParentId="2140" CreationDate="2016-04-05T09:09:59.460" Score="0" Body="&lt;h2&gt;Self-identification before golfing&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Since golfed code is harder to read, answers often contain an less golfed version. There are a number of potential golfing transformations depending on the language, so you may be able to score more highly using a more traditional language. Some examples of golfing transformations:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Removal of spaces, tabs and/or newlines&lt;/li&gt;&#xA;&lt;li&gt;Removal of disambiguating parentheses&lt;/li&gt;&#xA;&lt;li&gt;Removal of braces around single controlled statements&lt;/li&gt;&#xA;&lt;li&gt;Conversion from statements to comma operator&lt;/li&gt;&#xA;&lt;li&gt;Removal of explicit return statements&lt;/li&gt;&#xA;&lt;li&gt;Renaming identifiers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to write a program or function that can identify an ungolfed version of itself. Scoring is based on the number of golfing transformations that can be recognised. The submission must be capable of identifying all &quot;original&quot; code that is itself capable of self-identification (at least one such code must exist). Each supported transformation scores 1 point, but there are also bonus points available:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1 bonus point if the transformation can be repeated multiple times&lt;/li&gt;&#xA;&lt;li&gt;1 bonus point of the program rejects at least one invalid transformation of itself (e.g. white space added inside a keyword)&lt;/li&gt;&#xA;&lt;li&gt;1 bonus point if the program only accepts valid transformations of itself&lt;/li&gt;&#xA;&lt;li&gt;1 bonus point if the transformation shortened the code (so if you only supported renaming a 1-letter variable to another letter, you would not qualify)&lt;/li&gt;&#xA;&lt;li&gt;1 bonus bonus point if in addition the transformed program recognises the original program as a transformation of itself&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Example: A submission accepts the name of another program as a command-line parameter. It opens itself using its own name hard-coded into itself. It recognises the following transformations:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A change to the hard-coded file name (3 points, as there is only one file)&lt;/li&gt;&#xA;&lt;li&gt;A change to the amount of space between words (5 points, as there are no invalid transformations to reject)&lt;/li&gt;&#xA;&lt;li&gt;A change to the names of its variables (4 points, as it doesn't check whether the variables are renamed consistently or to keywords)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Total score: 12 points.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the event of a tie on score, shortest code wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Tags: code-golf, quine&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2016-04-05T09:09:59.460" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8897" PostTypeId="1" CreationDate="2016-04-05T17:48:08.823" Score="20" ViewCount="296" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/77187/8478&quot;&gt;In light of this recent question on main&lt;/a&gt; (now migrated to meta), here is a question I've been meaning to bring up for a while: should we broaden our scope to allow questions about challenge writing?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think there's a lot to be said for it. It would probably provide unique content that you can't find anywhere else on the web (but could be relevant to people external to the community, since programming challenges are written in many places), and definitely aligns with the interests and expertise of this community. It could also help improve the quality of our own challenges if we educate each other on how to write better challenges (and thereby complement the sandbox). Also, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8350/8478&quot;&gt;while we're not a Q&amp;amp;A site&lt;/a&gt; I think there's no reason that we shouldn't make use of our Q&amp;amp;A heritage when we can.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Just to clarify, even if we say that we want to allow challenge writing questions in general, that doesn't necessarily imply that the question I linked above is or isn't a good example of that. If we do want to allow challenge writing questions, we should probably define a clearer scope of what sort of questions that would include (only specific questions about specific problems in challenge writing, like other SE sites would accept; only tips-like list question like we have for answering challenges etc.).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is of course also the possibility to allow them on meta, but meta is about the workings &lt;em&gt;of the community&lt;/em&gt;, whereas writing programming challenges is a concept that is completely independent of the community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One more thing: if we do allow them, I expect them to get something like a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/challenge-writing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;challenge-writing&amp;#39;&quot; rel=&quot;tag&quot;&gt;challenge-writing&lt;/a&gt; tag so that everyone who feels that they dilute the challenge content can easily ignore them, so they can be easily filtered out in searches, as well as specifically searched for.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-04-05T19:31:00.607" Title="Should questions about challenge-writing be on topic?" Tags="|discussion|scope|" AnswerCount="4" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8898" PostTypeId="2" ParentId="8897" CreationDate="2016-04-05T18:04:21.753" Score="7" Body="&lt;h2&gt;Yes, but on meta&lt;/h2&gt;&#xA;&lt;p&gt;Because questions about writing challenges are more like questions about PPCG than challenges, meta makes more sense for these type of questions than main. Given that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges&quot;&gt;this question&lt;/a&gt; is present and well-received on meta, there is precedent for questions about writing challenges belonging on meta.&lt;/p&gt;&#xA;&lt;p&gt;I believe that main's scope should be challenges and general tips questions (like &amp;quot;Tips for golfing in X language&amp;quot; and not &amp;quot;Tips for golfing this specific answer&amp;quot;). Any questions about main-site content go on meta (such as challenge-writing tips questions).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-05T18:09:50.003" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="8900" PostTypeId="1" CreationDate="2016-04-05T17:19:21.227" Score="13" ViewCount="1275" Body="&lt;p&gt;Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/77117/tips-for-king-of-the-hill-bots&quot;&gt;this question&lt;/a&gt;, what are some tips you guys have for creating king of the hill challenges? What are some things to keep in mind in the planning and implementing of the rules and the controller, and advice on what makes for a good challenge?&lt;/p&gt;&#xA;" OwnerUserId="30793" OwnerDisplayName="Mwr247" LastEditorUserId="20198" LastEditDate="2018-12-18T15:51:00.523" LastActivityDate="2023-04-17T14:32:38.627" Title="Tips for King of the Hill challenges" Tags="|discussion|challenge-quality|king-of-the-hill|" AnswerCount="8" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8901" PostTypeId="2" ParentId="8900" CreationDate="2016-04-05T17:20:46.530" Score="12" Body="&lt;h1&gt;Account for turn order advantage&lt;/h1&gt;&#xA;&lt;p&gt;I've come across a number of challenges that would have wildly varying outcomes depending on who went first (or last) in the turn order, such that figuring out who was actually winning was a difficult task.&lt;/p&gt;&#xA;&lt;p&gt;As a rule of thumb, if each action a player makes has an immediate effect on the game world (as opposed to the results calculated after the round and applied collectively), be sure to account for the advantage that turn order gives. You could run a large number of matches in randomized order and get the average, or randomize turn order per round (if round based), or offer some sort of in-game balance to neutralize the advantage (like what &lt;em&gt;Settlers of Catan&lt;/em&gt; does with initial placement).&lt;/p&gt;&#xA;&lt;p&gt;Alternatively, you can also write the challenge in such a way that turns are handled simultaneously (the same &amp;quot;world state&amp;quot; is given to each player each round), and then between rounds the changes are calculated. This also has the benefit of allowing for parallel/asynchronous calls to bots, which can speed things up.&lt;/p&gt;&#xA;" OwnerUserId="30793" OwnerDisplayName="Mwr247" LastEditorUserId="34718" LastEditDate="2023-04-17T14:28:50.543" LastActivityDate="2023-04-17T14:28:50.543" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="8902" PostTypeId="2" ParentId="8900" CreationDate="2016-04-05T17:27:41.433" Score="6" Body="&lt;h2&gt;Allow as many bots as possible&lt;/h2&gt;&#xA;&lt;p&gt;Nobody wants to be disallowed from a contest right? Allow as many languages as you can. If someone posts a bot in a language you don't have, try as hard as you can to install it. If you can't? Ask for instructions.&lt;/p&gt;&#xA;&lt;p&gt;Allow people to post as many bots as they want. This means when they come up with a Super Amazing Idea™ they don't have to worry about changing/removing their other bot from the contest.&lt;/p&gt;&#xA;" OwnerUserId="32686" OwnerDisplayName="muddyfish" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-05T17:27:41.433" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8903" PostTypeId="2" ParentId="8900" CreationDate="2016-04-05T17:34:57.773" Score="7" Body="&lt;h1&gt;Scale the challenge for the number of players&lt;/h1&gt;&#xA;&lt;p&gt;Many challenges involve a &amp;quot;field&amp;quot; (where the player has a location and may move) or &amp;quot;world&amp;quot; (where the player can interact with and change aspects of the world that affect all players). When incorporating these sorts of play environments, be sure to take into account how the game may change between small and large player counts.&lt;/p&gt;&#xA;&lt;p&gt;On a field for example, a 100x100 grid might work for 2-10 players, but not so great for 40 players if the challenge gets really popular.&lt;/p&gt;&#xA;&lt;p&gt;In a world setting, having bots send out commands to change some stat about the world (like killing off &amp;quot;5%&amp;quot; of each enemies forces) might work better at a small scale, but with more players becomes too effective if they all run it at once (20 players * 5% = 100%), in which case, a static value might work better.&lt;/p&gt;&#xA;&lt;p&gt;One thing to try is making for demo bots to handle a few different play styles, and then cloning them to see how the game changes for larger numbers. Test different situations to find the flaws, then work out the numbers to scale better.&lt;/p&gt;&#xA;" OwnerUserId="30793" OwnerDisplayName="Mwr247" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-05T17:42:18.233" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8904" PostTypeId="2" ParentId="8900" CreationDate="2016-04-05T18:47:29.473" Score="10" Body="&lt;h1&gt;Read the tag wiki&lt;/h1&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/tags/king-of-the-hill/info&quot;&gt;wiki for the king-of-the-hill tag&lt;/a&gt; contains useful information and tips for creating KOTH challenges. I have copied the material here, but the information is more likely to be up to date on the wiki itself.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-king-of-the-hill-tooltip-container&quot;&gt;king-of-the-hill&lt;/a&gt; indicates a game where the submissions interact with each other. The game needs to have well defined rules and scoring, and the goal is to write a maximally competitive program.&lt;/p&gt;&#xA;&lt;p&gt;Make sure you write your test framework / scoring program before posting one of these challenges. In fact, it is strongly recommended that before posting you upload the test framework, one or two simple example bots, and a build script as a public repository on a site such as &lt;a href=&quot;https://github.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub&lt;/a&gt;. Then competitors can easily download and build the other bots when developing a new one, and might even send you a pull request with their new bot and its build script. See, for example, &lt;a href=&quot;https://github.com/pjt33/ppcg36515&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://github.com/pjt33/ppcg36515&lt;/a&gt; , which has a &lt;code&gt;make&lt;/code&gt; setup that allows building the test framework and the bots in one step.&lt;/p&gt;&#xA;&lt;p&gt;These challenges are usually a big undertaking for the host of the challenge, so here are a few common practices.&lt;/p&gt;&#xA;&lt;h2&gt;How to communicate with the bots?&lt;/h2&gt;&#xA;&lt;p&gt;There are several options to realize this. Common choices are&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Players implement an abstract class or interface in the language of the controller. All implementations are added to controller's project and can be interacted with directly through function calls. Example: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/25347/survival-game-create-your-wolf&quot;&gt;Survival Game - Create Your Wolf&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Players write a script that can be run from the command-line. These scripts are invoked at each turn and given input via arguments, while their output is read from STDOUT. Example: &lt;a href=&quot;https://codegolf.stackexchange.com/q/34968/8478&quot;&gt;Caveman Duels (or: Me poke you with sharp stick)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Players write a script that can be run from the command-line. These scripts are invoked once (and the processes kept running), communication is done via STDIN and STDOUT using persistent pipes. Example: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/25838/hunger-gaming-eat-or-die&quot;&gt;Hunger Gaming - Eat or Die&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Hybrid approaches are also an option, which usually increases accessibility of the challenge.&lt;/p&gt;&#xA;&lt;h2&gt;How to handle randomness?&lt;/h2&gt;&#xA;&lt;p&gt;If the scoring program contains (pseudo)-randomness or submissions are allowed to use randomness, this can greatly affect the leaderboard of a single trial. You should either seed your pseudo-random number generator (PRNG) and tell your participants to do the same or you should run a specified number of trials and take the average or median, say, of the individual scores.&lt;/p&gt;&#xA;&lt;h2&gt;Common pitfalls&lt;/h2&gt;&#xA;&lt;p&gt;King-of-the-hill challenges tend to be quite prone to loopholes. Consider including these restrictions to your challenge:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any attempt to tinker with the controller, runtime or other submissions will be disqualified. All submissions should only work with the inputs and storage they are given.&lt;/li&gt;&#xA;&lt;li&gt;Bots should not be written to beat or support specific other bots. (This might be desirable in rare cases, but if this is not a core concept of the challenge, it's better to rule it out.)&lt;/li&gt;&#xA;&lt;li&gt;Reserve the right to disqualify submissions that use too much time or memory to run trials with a reasonable amount of resources.&lt;/li&gt;&#xA;&lt;li&gt;A bot must not implement the exact same strategy as an existing one, intentionally or accidentally.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="34718" LastEditDate="2023-04-17T14:32:38.627" LastActivityDate="2023-04-17T14:32:38.627" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="8905" PostTypeId="2" ParentId="8897" CreationDate="2016-04-05T18:47:51.223" Score="5" Body="&lt;h2&gt;They should be allowed on main, but only with a narrow scope&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Because challenge creation is an integral part of the PPCG community, I think we &lt;em&gt;should&lt;/em&gt; allow questions about it on the main site.&#xA;I see PPCG as a place for not only posing and solving challenges, but collaborating and learning how to to pose better challenges and/or solve them using fewer bytes.&#xA;Also, challenge writing is not easy.&#xA;Allowing these types of questions on the main site could potentially lower the threshold for writing good KOTHs, fastest-codes and code challenges, which require much more effort to create than pure golfs.&#xA;Questions about KOTHs may also have applications outside PPCG, like game development.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, I also think we shouldn't allow overly broad questions such as the one linked above (after all, we are a Stack Exchange site, and our model favors focused questions).&#xA;Instead of &quot;How to make a good KOTH&quot;, one could ask &quot;How can I compensate for first turn advantage in a turn-based KOTH with randomized turn order&quot;, or &quot;How should I score a code challenge in a way that combines speed and accuracy over a test battery&quot;.&#xA;Defining an acceptable scope would probably need another Meta post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, questions that are &lt;em&gt;speficically&lt;/em&gt; about PPCG (like ones that only apply to a particular challenge here) should of course be only allowed in Meta.&lt;/p&gt;&#xA;" OwnerUserId="32014" LastActivityDate="2016-04-05T18:47:51.223" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8906" PostTypeId="2" ParentId="8897" CreationDate="2016-04-05T18:54:37.807" Score="9" Body="&lt;h1&gt;Yes, on main, but...&lt;/h1&gt;&#xA;&lt;p&gt;We should treat them like regular Stack Exchange questions.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Does it ask for a potentially endless list of answers, or cover so much material that you could imagine writing a book about it? If so, it is &lt;strong&gt;too broad&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Does it solicit opinions? If so, it is &lt;strong&gt;primarily opinion based&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;We treat challenge questions so differently that I think we sometimes forget how to treat normal, non-challenge questions.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;But we already have a bunch of tips questions that are too broad and primarily opinion based!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Yes, I know. It is regrettable that we allowed so many broad questions full of high-quality content to mature before we matured as a site. I would love to see each of those questions broken down into many narrower, answerable questions. For now, we should leave them alone until a group of folks with extra time on their hands can rectify the situation. And avoid making the situation worse.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-05T18:54:37.807" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="8907" PostTypeId="2" ParentId="8897" CreationDate="2016-04-05T19:13:18.667" Score="-2" Body="&lt;h1&gt;Yes, they should be treated like language tips&lt;/h1&gt;&#xA;&lt;p&gt;Language tips benefit from being on main, and are about collecting general &amp;quot;best practice&amp;quot; suggestions for different languages. Because challenge rules can vary so extensively, these don't always help in every case for every submission in that language. But we still consider them a valuable resource for improving submissions.&lt;/p&gt;&#xA;&lt;p&gt;Challenge-type tips should be treated the same way. This is a site about creating and answering code challenges and programming puzzles, and challenge writers would greatly benefit from general tips towards the type of challenge they are creating, even if all of the advice doesn't always apply to every situation (just like language golfing tips).&lt;/p&gt;&#xA;&lt;p&gt;As before, specific questions to a particular challenge or challenge idea is still in meta's scope. But if it's asking for tips in general for a variety of challenge, this feels well within the scope for what main is about.&lt;/p&gt;&#xA;" OwnerUserId="30793" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-05T19:13:18.667" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8909" PostTypeId="1" CreationDate="2016-04-05T19:56:04.053" Score="61" ViewCount="1144" Body="&lt;p&gt;&lt;em&gt;tl;dr: I'm starting a coding tutoring company, and if you have any interest in coding education, or want to get coding tutoring or be a tutor, email me at cky@levelupyourcode.com. I hope to keep in touch with you all!&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;So long, and thanks for all the &amp;gt;&amp;lt;&amp;gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As we wrap up the first PPCG election, it's time for me to bid everyone here a lovely farewell as I return to being a civilian. :-) It's been a very nice 5 years of serving as a moderator here, and I am grateful to have had the opportunity to shape the PPCG community, especially in our very early days.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I decided not to run in the election: we already have 4 awesome full-time mods, &lt;a href=&quot;https://codegolf.stackexchange.com/users/3808/doorknob&quot;&gt;Doorknob&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-b%c3%bcttner&quot;&gt;Martin&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/users/20469/alex-a&quot;&gt;Alex&lt;/a&gt;, and I have full trust in their moderation judgement and common sense¹; there really isn't a need for a fifth wheel.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Oh, and I'm starting my own company! Which will take up 110% of my time.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The mission ahead: making coding education more accessible&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm currently in the process of building my new company, Level Up Your Code.² My mission is to &lt;strong&gt;make coding education much more accessible, so that anyone who wants to learn to code has the best shot of success&lt;/strong&gt;, no matter what their background, demographics, financial position, or privilege level is. We live in an increasingly digital society, and people who know how to code have the power to shape our world. So it's an important skill no matter what profession one wishes to pursue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We already have lots of coding education resources, be they a formal university education, a coding bootcamp, Udacity (including its Nanodegrees), Treehouse, Code School, Codecademy, Free Code Camp, or Khan Academy. There's really no shortage of learning resources in our current world, and for that I'm grateful.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sadly, many people do not have the capability to actually succeed at learning coding. Maybe they can't afford a degree or coding bootcamp, or they don't have the time to go through all the trial-and-error that self-learning involves. Maybe they only have access to a computer at school, work, or a library. Maybe they excel at a different learning style from what most programming books and courses offer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In other words, each learner has different needs, different struggles. We need to have adaptable educators who can help each student past the various hurdles they occasionally come across.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Where I came from: coding, tutoring, teaching&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Though I've been programming since I was a kid, I majored in statistics in university, with the serendipitous fortune of working on &lt;a href=&quot;http://www.r-project.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;R&lt;/a&gt; along the way. I loved stats, and I still love R today.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, many of students in my class didn't love stats, and they didn't take stats voluntarily; they were psychologists and biologists, not aspiring data scientists. And in senior year, a good handful of students struggled. I wanted to help those students win, and I set up weekly peer tutoring sessions that anyone in my class was welcome to show up at.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And every week, about 6 or so students showed up, and I was glad to be of help.³ I was able to attend to each student individually and provide personalised help, but more importantly, the students there helped each other; their challenges were in different areas, and were able to help in in their respective areas of strength.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is powerful stuff! I want to bring the same model to the process of learning to code.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Have a passion for bringing forth the next generation of coders?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I have &lt;a href=&quot;https://luyc.slack.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;a Slack group&lt;/a&gt; for discussing this mission and product ideas.⁴ Want in on the action? Email me at cky@levelupyourcode.com and I'll send you an invite.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Meanwhile, until I get my peer tutoring platform launched, if you are interested in getting coding tutoring, I'd be happy to tutor you! (First session is free, and there's always a 100% satisfaction guarantee.) If this interests you, feel free to email me, or &lt;a href=&quot;https://luyc.youcanbook.me/&quot; rel=&quot;nofollow noreferrer&quot;&gt;go ahead and book a tutoring session&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Parting thoughts&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Thanks again for having me as your moderator for the last 5 years! I've had a really wonderful time getting to know all of you. Now that PPCG is all gradumacated and all, I look forward to a new era of programming challenges and golfing, with the help of our awesome new moderators. :-D&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's keep in touch! I won't be a stranger. ;-)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;¹ I refrained from writing this post till now to avoid skewing votes. :-)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;² No web site yet, but I'll edit this post when I have one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;³ Eventually, the stats department provided proper paid tutors, which validated my idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;⁴ There's even a channel for discussing PPCG-related stuff. ;-)&lt;/p&gt;&#xA;" OwnerUserId="3" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-05-03T06:04:17.937" Title="A fond farewell from an old-time mod" Tags="|discussion|" AnswerCount="2" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="8910" PostTypeId="1" CreationDate="2016-04-05T20:06:25.387" Score="54" ViewCount="713" Body="&lt;p&gt;Programming Puzzles &amp;amp; Code Golf's &lt;a href=&quot;https://codegolf.stackexchange.com/election/1&quot;&gt;first moderator election&lt;/a&gt; has come to a close, the votes have been tallied, and the 4 new moderators are:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/8478&quot;&gt;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/8478.png&quot; alt=&quot;Martin Büttner&quot;&gt;&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012&quot;&gt;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/12012.png&quot; alt=&quot;Dennis&quot;&gt;&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/users/3808&quot;&gt;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/3808.png&quot; alt=&quot;Doorknob&quot;&gt;&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/users/20469&quot;&gt;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/20469.png&quot; alt=&quot;Alex A.&quot;&gt;&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please thank them for volunteering!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And please join me in thanking Chris Jester-Young, dmckee and gnibbler for their &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/220/moderator-pro-tem-announcement&quot;&gt;service as moderators &lt;em&gt;pro tempore&lt;/em&gt;&lt;/a&gt;. Level-headed moderation goes a long way toward making a site successful. Nowhere is that more important than on a site, such as this one, that breaks the mold of what we sometimes think of as &quot;typical Q&amp;amp;A&quot;. I, for one, hope to see these folks remain leaders in practice even if they lack the title &quot;Moderator&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For details on how the voting played out, you can download the election results &lt;a href=&quot;https://codegolf.stackexchange.com/election/1&quot;&gt;here&lt;/a&gt;, or &lt;a href=&quot;http://www.opavote.org/results/6497348721049600/0&quot; rel=&quot;nofollow noreferrer&quot;&gt;view a summary report online&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="8534" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-07-09T20:34:57.497" Title="2016 Community Moderator Election Results" Tags="|discussion|election|" AnswerCount="4" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8911" PostTypeId="2" ParentId="8909" CreationDate="2016-04-05T20:08:04.510" Score="18" Body="&lt;p&gt;Wow, that's awesome. Best of luck! We'll be sad to see you go, but eager to see what you do next. &lt;/p&gt;&#xA;" OwnerUserId="31541" LastActivityDate="2016-04-05T20:08:04.510" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8912" PostTypeId="2" ParentId="8910" CreationDate="2016-04-05T20:10:51.513" Score="30" Body="&lt;p&gt;Congratulations to our pro-tem moderators for being (re-)elected! You guys have done a great job moderating PPCG, and are all very good choices for our first set of formally-elected moderators. I look forward to seeing the site continue to improve with these 4 as moderators.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thanks to gnibbler, dmckee and Chris for sacrificing their time and sanity to be pro-tem moderators during the long beta. Without them, this site wouldn't be what it is today.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2016-04-05T20:10:51.513" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8913" PostTypeId="2" ParentId="8910" CreationDate="2016-04-05T20:10:56.670" Score="24" Body="&lt;p&gt;Thank you to everybody here! I really enjoyed my last 5 years here, and I'm so glad that PPCG has finally graduated! Our site is in excellent hands, and I look forward to seeing what the dream team will do going forward. :-D&lt;/p&gt;&#xA;" OwnerUserId="3" LastActivityDate="2016-04-05T20:10:56.670" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8914" PostTypeId="2" ParentId="8910" CreationDate="2016-04-05T20:18:57.120" Score="30" Body="&lt;h1&gt;Thank you so much, everyone!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;And very special thanks to:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Chris Jester-Young&lt;/strong&gt;, &lt;strong&gt;gnibbler&lt;/strong&gt;, and &lt;strong&gt;dmckee&lt;/strong&gt; for their invaluable contributions to the site, particularly in its formative years. We wouldn't be here without their hard work and dedication.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Everyone&lt;/em&gt; who voted at any point during the election. We had over 500 voters, which I'm told is quite a lot for a first time election.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Grace Note&lt;/strong&gt;, for getting the graduation gears turning.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Jon Ericson&lt;/strong&gt;, for this announcement, and for being supportive as we inched toward graduation.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Pops&lt;/strong&gt;, for greasin' the graduation wheels.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Martin&lt;/strong&gt;, &lt;strong&gt;Doorknob&lt;/strong&gt;, and &lt;strong&gt;Dennis&lt;/strong&gt;, for too much to say here.&lt;/li&gt;&#xA;&lt;li&gt;You, the community, for making this site possible.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Together we've built something amazing and I'm absolutely honored and thrilled to have been elected to continue to serve this community as a moderator.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now back to flag handling!&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="20469" LastEditDate="2016-04-05T20:27:53.297" LastActivityDate="2016-04-05T20:27:53.297" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8915" PostTypeId="2" ParentId="8910" CreationDate="2016-04-05T20:20:51.923" Score="24" Body="&lt;p&gt;&lt;strong&gt;Congrats to @AlexA. @MartinBüttner @Doorknob and @Dennis !!!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Really it was a forgone conclusion that you guys won and I am very happy with this result - our community remains in the hands of 4 excellent moderators.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thanks to &lt;strong&gt;all&lt;/strong&gt; the candidates, all of which I think put in really strong nominations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thanks as well to all the voters for taking part (especially those that voted for me ;-))!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm honoured to be part of this community as it demonstrated fairness, professionalism and enthusiasm through this election process - I think we're an even stronger community for having gone through it!&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="11259" LastEditDate="2016-04-05T20:27:25.573" LastActivityDate="2016-04-05T20:27:25.573" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8918" PostTypeId="2" ParentId="8909" CreationDate="2016-04-06T06:38:44.087" Score="12" Body="&lt;p&gt;I can only say one thing in response to that post:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Thank You!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I didn't have the pleasure to really known you as a mod because i'm still in my first year on PPCG. But you should be praised for wanting to teach other wanna-be coder (and, maybe, codegolfer? :)). I, myself, had and have a hard time as a student because the educational system of my country doesn't suits me, and I had to learn what they tried to teach me by myself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once again, thank you, it's warming the heart of a student that someone think there's other way. to teach and is willing to addapt to each one of his pupils!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Go on with your company, I wish you the best! If at some point you want an insider point of view (or in some year, a freshly graduated's one), just contact me and it will be a pleasure to help you!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the moment, farewell Chris!&lt;/p&gt;&#xA;" OwnerUserId="41019" LastActivityDate="2016-04-06T06:38:44.087" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8919" PostTypeId="2" ParentId="8900" CreationDate="2016-04-06T06:47:20.687" Score="4" Body="&lt;p&gt;&lt;strong&gt;Ask for sandbox reviews&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think everybody does that, but it is especially important with KotH. Designing a KotH is like designing a game (in fact, it IS a game), and you might need help to find some flaws in your ruleset or to balance things the right way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, once the controller is written, put the link in the sandbox and try to have some people playing around with it to point-out bugs you may have missed.&lt;/p&gt;&#xA;" OwnerUserId="41019" LastActivityDate="2016-04-06T06:47:20.687" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8920" PostTypeId="1" AcceptedAnswerId="8921" CreationDate="2016-04-06T14:20:58.910" Score="9" ViewCount="176" Body="&lt;p&gt;I ask simply because these brace/bracket/parenthesis questions are more numerous than the sands of the sea....  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we create a tag for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brackets&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brackets&amp;#39;&quot; rel=&quot;tag&quot;&gt;brackets&lt;/a&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't think they're all that interesting (so I don't want to encourage it), but maybe having a tag for it will make people less likely to rewrite minor variations of the same challenge?&lt;/p&gt;&#xA;" OwnerUserId="13950" LastActivityDate="2016-04-16T09:20:22.333" Title="Add a tag for brackets?" Tags="|discussion|tags|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8921" PostTypeId="2" ParentId="8920" CreationDate="2016-04-06T14:36:10.363" Score="18" Body="&lt;p&gt;Funny you should mention it, I thought about this yesterday (not for the first time), and was planning to collect a list of challenges for the retagging today. I'm definitely in favour of this, because these challenges are fairly hard to search for, because the terminology in use may vary a lot (&quot;parenthesis&quot;, &quot;bracket&quot;, &quot;brace&quot;, &quot;matching&quot;, &quot;matched&quot;, &quot;balanced&quot;, &quot;parenthesise&quot;, ... are some of the words used to describe these tasks).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I'd suggest the tag name &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/balanced-string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;balanced-string&amp;#39;&quot; rel=&quot;tag&quot;&gt;balanced-string&lt;/a&gt; to make it a bit more general. If someone makes a challenge where &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; take the role of &lt;code&gt;(&lt;/code&gt; and &lt;code&gt;)&lt;/code&gt; it's still the same even though no &quot;brackets&quot; are involved (and there is at least one challenge about balanced binary representations).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm happy to do the retagging myself over the course of several days, so that we don't bump everything to the front page at once.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an aside, I would probably also put this tag on challenges related to balanced strings, like &lt;a href=&quot;https://codegolf.stackexchange.com/q/66127/8478&quot;&gt;Catalan Numbers&lt;/a&gt; (I don't know if we have many others that fall into this category).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Status update&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I've tried as best I can to find all the relevant challenges. I've turned up 32 of them (which, I believe, makes this my biggest new-tag project to date) &lt;s&gt;and will start with the retagging tomorrow&lt;/s&gt; and have added the tag to all of them (see the revision history of this post for the full list). I've also set up tag synonyms with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parentheses&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parentheses&amp;#39;&quot; rel=&quot;tag&quot;&gt;parentheses&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brackets&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brackets&amp;#39;&quot; rel=&quot;tag&quot;&gt;brackets&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/braces&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;braces&amp;#39;&quot; rel=&quot;tag&quot;&gt;braces&lt;/a&gt; so that they show up in the auto-completion, and filled in the tag wiki as well as amended a few related ones (particularly &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/palindrome&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;palindrome&amp;#39;&quot; rel=&quot;tag&quot;&gt;palindrome&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/syntax&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;syntax&amp;#39;&quot; rel=&quot;tag&quot;&gt;syntax&lt;/a&gt;).&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-04-16T09:20:22.333" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="8922" PostTypeId="1" CreationDate="2016-04-06T15:11:31.790" Score="10" ViewCount="259" Body="&lt;p&gt;I'm working on a KOTH contest, and it is a little bit more on the complicated side. Each bot is expected to keep track of a lot of state. For example, move history, position in the board, position of other bots, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It seems to me like the best way to do this would be to make each bot an instance of a class, rather than a full program communicating over command line arguments. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I'm worried about this since, by nature, this would restricts all entrants to a single language. Is this okay? And I go through with restricting it to a single language, what language is most appropriate? I'd like to do it in Java since it's very widespread and pretty easy to get started with. If I restrict it to Java, will that hurt participation on a technical or social aspect? E.g, &quot;I'd like to participate, but I really want to do it in &lt;em&gt;&lt;code&gt;&amp;lt;language&amp;gt;&lt;/code&gt;&lt;/em&gt;&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or If I instead allow persistent program that communicate over a pipe, will this make it too technically hard to implement that it will hurt participation?&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="31716" LastEditDate="2016-04-06T17:09:12.493" LastActivityDate="2016-04-12T20:55:35.883" Title="What language should I use for a single language KOTH?" Tags="|discussion|asking-questions|king-of-the-hill|" AnswerCount="3" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="8924" PostTypeId="2" ParentId="2140" CreationDate="2016-04-06T18:48:53.330" Score="4" Body="&lt;h1&gt;Create an Autostereogram (Optical Illusion w/ Hidden 3D Shape)&lt;/h1&gt;&#xA;&lt;p&gt;An &lt;a href=&quot;https://en.wikipedia.org/wiki/Autostereogram&quot; rel=&quot;nofollow noreferrer&quot;&gt;autostereogram&lt;/a&gt; is a type of optical illusion requiring the viewer to, simply put, change distance at which your eyes are trying to view the image. In order to see the hidden image rather than just a nonsensical two-dimensional image, the viewer must either focus their eyes in front of the image (cross-eyed), or behind the image (wall-eyed). Depending on its type, autostereograms may be viewed either way, only cross-eyed, or only wall-eyed. Wall-eyed are the most common.&lt;/p&gt;&#xA;&lt;p&gt;The illusion below taken from the linked Wikipedia article may only be viewed successfully using the wall-eyed technique. Viewing the full-sized image may help.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/r156g.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/r156g.png&quot; alt=&quot;https://upload.wikimedia.org/wikipedia/commons/f/fb/Stereogram_Tut_Shark.png&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The hidden image is:&lt;/p&gt;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;&lt;p&gt; A shark&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I didn't know they were called autostereograms until today, but I always liked this type of optical illusion, since I found the hidden image easy to spot using the wall-eyed technique.&lt;/p&gt;&#xA;&lt;p&gt;Your goal is to take a depth map and either:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Take in an image to modify with the map, then return/display the resulting image&lt;/li&gt;&#xA;&lt;li&gt;Create a random dot autostereogram&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The quality of the image must be such that the image is hidden and can be viewed using one of the techniques listed above.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-02T16:29:09.067" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="8925" PostTypeId="2" ParentId="8808" CreationDate="2016-04-06T23:53:45.200" Score="0" Body="&lt;p&gt;In principle yes, but what kind of post it should be is another question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't see much of a need for a &quot;Welcome to PPCG&quot; new user post for answerers. You get the occasional breaking of one of the classic Standard Loopholes [which are no longer funny] (such as interpreting the challenge too literally, or downloading the output from the internet) where the new user genuinely thinks they are being fun and original, but these are rare, and the new user is usually fine when pointed to the Standard loopholes page.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For askers, what do we want to say? Give tips on writing a good challenge? Or say don't even bother till you've used the sandbox / answered a few questions etc? It won't stop the issue of brand new users rocking up with poorly thought out challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, a general review/summary of the most important rules and recommendations already in place on this site (with links to the meta posts) would be very helpful&lt;/p&gt;&#xA;" OwnerUserId="15599" LastActivityDate="2016-04-06T23:53:45.200" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8926" PostTypeId="1" AcceptedAnswerId="8931" CreationDate="2016-04-07T07:41:52.460" Score="4" ViewCount="138" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8921/8478&quot;&gt;While collecting a list of all challenges related to balanced strings&lt;/a&gt; I found that we have (at least) 4 challenges related to fixing unbalanced strings by adding or removing parentheses/braces/brackets. I haven't compared the specs in detail yet, but I figured there is likely going to be &lt;em&gt;some&lt;/em&gt; overlap, and I thought it should probably be up to the community anyway to decide if any of those are duplicates or not:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/11917/8478&quot;&gt;Fix unbalanced brackets&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/25877/8478&quot;&gt;Finish lazy parentheses&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/36474/8478&quot;&gt;Write a program which replaces with spaces the braces in cases where braces in places cause stasis&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/50873/8478&quot;&gt;Fix the Braces, etc&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If the outcome is &quot;they're all sufficiently different&quot; that's fine, but I figured we should talk about it...&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2016-04-18T03:23:50.923" Title="Are any of these bracket-fixing challenges duplicate?" Tags="|discussion|duplicates|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8927" PostTypeId="2" ParentId="2140" CreationDate="2016-04-07T08:36:07.400" Score="0" Body="&lt;p&gt;In this challenge you are supposed to output a grid 10x10 with numbers from 00 to 99 (each number once) following this rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Number 00 must be on the bottom row&lt;/li&gt;&#xA;&lt;li&gt;Number 99 must be on the upper row&lt;/li&gt;&#xA;&lt;li&gt;In the output each number must be sepparated by spaces and must have two digits (that is including 0's when needed for the first 10 numbers)&lt;/li&gt;&#xA;&lt;li&gt;Output must be random&lt;/li&gt;&#xA;&lt;li&gt;It must be solved within reasonable time&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I'm having an issue trying to define &lt;em&gt;random&lt;/em&gt; and &lt;em&gt;reasonable time&lt;/em&gt; here and would like some help with it.&#xA;Thanks.&lt;/p&gt;&#xA;" OwnerUserId="40604" LastActivityDate="2016-04-07T08:36:07.400" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8928" PostTypeId="2" ParentId="8047" CreationDate="2016-04-07T09:54:09.330" Score="59" Body="&lt;h2&gt;Requiring minimum scores&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In short, don't post a code golf that says &quot;Your code has to be shorter than 100 bytes&quot; (the same applies to any other winning criterion). The usual motivation is that the author found some code somewhere and challenges people to beat the score of that code. That's a fine motivation for a challenge, but actually requiring all answers to be better than that benchmark is incredibly detrimental to the challenge. It doesn't increase competition between answers that are better than the requirement. But it does disallow answers which are worse than the limit but might contain interesting ideas which the better answers could also benefit from, and it also rules out some languages entirely which are simply incapable of beating the given score. There's also the possibility that you've set the limit too low and made the challenge impossible. Additionally, most often answers aren't originally posted with the best possible score, but are later improved because other people give suggestions. This would be impossible if the first attempt wasn't allowed to be posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Most importantly though, all that a minimum score is saying is &quot;if you're not good enough, you can't participate&quot;, which I think is plainly rude.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="20260" LastEditDate="2016-04-07T21:13:56.930" LastActivityDate="2016-04-07T21:13:56.930" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="8929" PostTypeId="2" ParentId="2140" CreationDate="2016-04-07T11:54:19.783" Score="1" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; A Simple Card Game&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Take 2 standard decks of cards, and 4 players. Shuffle the deck, and distribute the cards evenly among the 4 players. Each player will take &lt;strong&gt;one&lt;/strong&gt; card in their hand (visible to only the player himself), and place the others on a stack in front of them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Overview:&lt;/strong&gt;&lt;br&gt;&#xA;The goal is to collect &lt;strong&gt;all&lt;/strong&gt; the cards. Taking turns, each player will play a card from either their hand, or hope for the best and play the &lt;strong&gt;first&lt;/strong&gt; card from their stack. After all players have taken turns, the player with the highest card* will win that round and will collect the played cards. He will then &lt;strong&gt;start the next round&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Replenishing / losing / winning&lt;/strong&gt;&lt;br&gt;&#xA;If you play a card from your hand, you may draw the first card from your stack and place it in your hand. If you run out of cards on your stack, you may shuffle the cards you collected, and this will be your new stack. You will be removed from the game the moment you have played the last card (which is by definition from your hand) and do not win the consequent round. Last player standing wins the game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;*Highest card&lt;/strong&gt;&lt;br&gt;&#xA;The highest card is in principle determined by the standard sequence &lt;code&gt;2&amp;lt;3...&amp;lt;King&lt;/code&gt;. &lt;strong&gt;However&lt;/strong&gt;, when someone plays an ace, the sequence becomes &lt;code&gt;4&amp;lt;...&amp;lt;Ace&amp;lt;2&amp;lt;3&lt;/code&gt;, i.e., &lt;code&gt;3&lt;/code&gt; becomes the highest card. The winner is determined at the end of the round - the order of play is irrelevant.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;If there's a tie&lt;/strong&gt;, the 'winning' players do another round, and the final winning player will collect all the cards 'on the table', i.e., of all the tied rounds. &lt;em&gt;Edge case: if you tie with your final card, you will lose after all, since you have no cards to play with after the tie.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples:&lt;/strong&gt;&lt;br&gt;&#xA;We have four players: Alice, Bob, Carol and Dave. Let's denote the cards by &lt;code&gt;[1-12]&lt;/code&gt; where 1 is an ace.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A:  5, B: 9, C: 1, D: 8.   Winner: Carol.&#xA;C: 10  D: 4  A: 1, B: 2.   Winner: Bob (2 beats ace)&#xA;B: 11, C: 1, D: 4, A: 1.   Tie between Carol and Alice... (both aces)&#xA;C:  4, A: 3                Winner: Carol (she gets six cards).&#xA;C:  3, D: 2, A: 1, B: 6.   Winner: Carol (3 beats ace)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Build a player that will win as many games as possible. You will receive 10 points for first place, 5 for second, 3 for third and 1 for last place. Your final score will be divided by the number of simulation runs I did, so you will score &lt;code&gt;[1-10]&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code must fit within [an amount of bytes to be determined; 1kiB?]&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox questions:&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Would you consider participating? Why (not)? (challenge quality)&lt;/li&gt;&#xA;&lt;li&gt;What would be better?&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A Java controller (each player extends the default Player class). Advantage: no I/O parsing required, just simple function calls. Disadvantage: excludes all other languages, lest a wrapper is made.&lt;/li&gt;&#xA;&lt;li&gt;A STDIN/STDOUT controller (each player will receive input over STDIN, and return what they do on STDOUT). Advantage: virtually any language can compete. Disadvantage: possibly cumbersome I/O format to present the players with all relevant information.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="32352" LastEditorUserId="32352" LastEditDate="2016-04-08T13:02:17.147" LastActivityDate="2016-04-08T13:02:17.147" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="8931" PostTypeId="2" ParentId="8926" CreationDate="2016-04-07T14:17:29.527" Score="3" Body="&lt;p&gt;1 and 4 are very similar. They both allow only brackets, and they both require the minimum number of additions to make the brackets fully balanced. 4 is newer, but IMO better written with a more concise spec. Therefore, we should close 1 as a dupe of 4.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2 and 3 are also very similar. Initially, I was going to recommend closing one of them, but I've changed my mind. I think the differences are significant enough that they should both stay open.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;They both require parsing of string literals and comments, but 2:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Is multiline.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Only requires balancing parentheses.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Allows adding or deleting of parentheses.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;3:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Is single line.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Requires balancing several types of brackets.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Only allows removing brackets.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So I'd say 2 and 3 should stay open.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="46231" LastEditDate="2016-04-18T03:23:50.923" LastActivityDate="2016-04-18T03:23:50.923" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8933" PostTypeId="2" ParentId="673" CreationDate="2016-04-08T13:14:57.117" Score="-1" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Edit&lt;/strong&gt;: Seems the community didn't like the previous counting rules proposed by me, so I'm modifying them.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Blocks&lt;/h1&gt;&#xA;&lt;p&gt;Every block in every sprite counts as 1 point.&lt;/p&gt;&#xA;&lt;h1&gt;Inputs&lt;/h1&gt;&#xA;&lt;p&gt;Strings and numbers in every sprite are scored based on their length (in bytes). Colors and drop-downs are 1 point.&lt;/p&gt;&#xA;&lt;h1&gt;Variables and Lists&lt;/h1&gt;&#xA;&lt;p&gt;Variables and Lists are scored normally. If custom variables or lists alerady exist, and they don't have a value of &lt;code&gt;0&lt;/code&gt;, then 1 point is added for each one-sprite variable, and 1 point for each all-sprite variable.&lt;/p&gt;&#xA;&lt;h1&gt;Sprites, costumes, backdrops&lt;/h1&gt;&#xA;&lt;p&gt;Sprites are not counted. Costumes and backdrops are, but the 1st backdrop isn't counted.&lt;/p&gt;&#xA;&lt;h1&gt;Project name, instructions, notes/credits and tags&lt;/h1&gt;&#xA;&lt;p&gt;Those do not count, as they are technically not part of the source code.&lt;/p&gt;&#xA;&lt;h1&gt;Final counting&lt;/h1&gt;&#xA;&lt;p&gt;The formula used for the final score counting is:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;b&lt;/code&gt;blocks&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;i&lt;/code&gt;combined length of all number/string inputs&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;V&lt;/code&gt;number pre-existing variables with value not equal to &lt;code&gt;0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;c&lt;/code&gt;combined number of costumes in all sprites and all backdrops&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;b+i+V+c-2&lt;/code&gt;formula&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-04T08:50:24.210" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8934" PostTypeId="1" CreationDate="2016-04-08T15:17:07.413" Score="-7" ViewCount="492" Body="&lt;p&gt;I am a programmer, and know many programming languages, as everyone here does. Those languages have a productive purpose, a real-world application.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Python and Ruby have a clean syntax and are good for web server applications and simple infrastructure and maintenance scripts. There are many applications built with those languages for many unix distr0s (in particular with Python). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Javascript is the browser scripting language, and with server side javascript (e.g. asp, node.js) you can code certain behaviors once and, when suitable, have them both in the browser and the server.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;vb.net, C#, C/C++, Java and Delphi are suitable when you need native or high-performance-but-not-native development.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Other languages are better suitable for special processing (R, Matlab).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So those languages &lt;em&gt;have&lt;/em&gt; a purpose, a goal. And I thought the spirit of the site was to use such languages to make a smallest-as-possible program satisfying the problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So assume I invent a language (and make the interpreter available) and use it all for my future challenges (this means: I don't invent the language for an already existing challenge). Then a new challenge comes:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Write a program that takes as input a graph as a list of integers being the nodes, and a list of integers that takes a list of connections, and resolves finding a hamiltonian loop in the graph.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Then I write my aswsome script in my awesome language (without still finding it being in P):&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;MyStrangeLang, 2 bytes&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Ń&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Wow! And I... won.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What's the fun about winning that way? Perhaps I didn't understand the site's spirit since this is my first time (these days) of being active in this site, but a good explanation would help.&lt;/p&gt;&#xA;" OwnerUserId="26562" LastEditorDisplayName="user45941" LastEditDate="2016-04-09T16:17:22.103" LastActivityDate="2016-04-09T16:17:22.103" Title="Does it actually make fun using golf-focused languages for golf type questions?" Tags="|discussion|" AnswerCount="1" CommentCount="7" ClosedDate="2016-04-08T20:36:27.223" ContentLicense="CC BY-SA 3.0" />
  <row Id="8935" PostTypeId="2" ParentId="2140" CreationDate="2016-04-08T17:15:39.783" Score="0" Body="&lt;p&gt;&lt;strong&gt;@Sandbox:&lt;/strong&gt;  &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Not sure if &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/balanced-string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;balanced-string&amp;#39;&quot; rel=&quot;tag&quot;&gt;balanced-string&lt;/a&gt; is correct here.&lt;/li&gt;&#xA;&lt;li&gt;Do I need test cases for this? They will make this very lengthy.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/balanced-string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;balanced-string&amp;#39;&quot; rel=&quot;tag&quot;&gt;balanced-string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c&amp;#39;&quot; rel=&quot;tag&quot;&gt;c&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Find the structs!&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a piece of C-code, add a &lt;code&gt;/*&lt;/code&gt; before and a &lt;code&gt;*/&lt;/code&gt; after every top-level structure definition that you find. You may not do this for structures that are defined inside other structures.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A structure can be identified by the &lt;code&gt;struct&lt;/code&gt; keyword followed by an identifier, an opening &lt;code&gt;{&lt;/code&gt;, some alphanumeric characters inside the structure and a closing &lt;code&gt;};&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A structure identifier will only consist of alphanumeric characters.&lt;/li&gt;&#xA;&lt;li&gt;One structure may also contain other structures with an unlimited depth.&lt;/li&gt;&#xA;&lt;li&gt;Comments and whitespaces may appear anywhere in the code and have no effect. &lt;code&gt;//&lt;/code&gt; starts a single line comment and code enclosed in &lt;code&gt;/*&lt;/code&gt; and &lt;code&gt;*/&lt;/code&gt; is a multiline comment.&lt;/li&gt;&#xA;&lt;li&gt;You can't rely on a specific indentation style.&lt;/li&gt;&#xA;&lt;li&gt;A structure will not contain any braces &lt;code&gt;{}&lt;/code&gt; that are not part of another structure definition.&lt;/li&gt;&#xA;&lt;li&gt;There can be multiple top-level structures in the input. You have to consider them all.&lt;/li&gt;&#xA;&lt;li&gt;The input will only contain printable ASCII and newlines.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;So the output for&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-c prettyprint-override&quot;&gt;&lt;code&gt;int z;&#xA;struct example1 /* comment here */  {&#xA;    int x; // struct comment {int x;};&#xA;    struct nested&#xA;    {&#xA;        char* s;&#xA;        int* y;&#xA;    };&#xA;};&#xA;int y;&#xA;&#xA;//struct { };&#xA;&#xA;struct example2{int x;};&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;would be&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-c prettyprint-override&quot;&gt;&lt;code&gt;int z;&#xA;/*struct example /* comment here */  {&#xA;    int x; // struct comment {int x;};&#xA;    struct nested&#xA;    {&#xA;        char* s;&#xA;        int* y;&#xA;    };&#xA;};*/&#xA;int y;&#xA;&#xA;//struct { };&#xA;&#xA;/*struct example2{int x;};*/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Function or full program allowed.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;Default rules&lt;/a&gt; for input/output.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; apply.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so lowest byte-count wins. Tiebreaker is earlier submission.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Happy Coding!&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="49110" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2016-04-24T19:14:53.633" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="8936" PostTypeId="2" ParentId="8934" CreationDate="2016-04-08T20:18:43.343" Score="9" Body="&lt;p&gt;Is it fun to use golfing languages? That depends on whether you like to use golfing languages. Not sure? Try it and find out. As is evidence by their prevalence on the site, a lot of people do like using golfing languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it fun when other people use golfing languages? That depends on whether you care about winning in the sense of receiving the coveted green check mark. Spoiler alert: It's not often that a &quot;regular&quot; language will beat a golfing language in code golf. Most of the folks who have been around for a while recognize this and choose to participate anyway. Why? Because code golf is fun, even if you don't &quot;win.&quot; If all you care about is getting the green check mark, then yeah, your best bet will be to learn the golfing language &lt;em&gt;du jour&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We like to think of code golf challenges as competitions &lt;em&gt;within&lt;/em&gt; each language, or within classes of languages. So if you post a JavaScript solution that beats another JavaScript solution, nice work! If you post a JavaScript solution that's longer than a Pyth solution, who cares that it's longer? People love seeing golfed JavaScript. Pyth is shorter because it's designed to be shorter. Often making a short solution in &quot;regular&quot; languages requires more ingenuity to use and abuse language features, while a golfing language can be competitive with a straightforward algorithm. Don't let that ruin your fun.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While most golfing languages feature one- or two-byte built-in functions for common tasks, we require that submissions that use a version of the language published after the challenge was posted be marked &quot;non-competing.&quot; This ensures that someone can't always win with a single byte solution that was added to the language specifically for that challenge. And of course, if you don't find a particular post interesting, you don't have to upvote it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Don't discount golfing languages entirely; they're quite honestly a feat of engineering and a lot of users have put a lot of time and effort into making them. Calling them &quot;shitty&quot; or assuming that the language authors were using drugs when they built the interpreters is going to offend a whole lot of people here. This is an inclusive community; the users of all languages here coexist and have fun together. We just ask that everyone be respectful of one another.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code golf is about fun. We have rules and guidelines for our community, but in general, do what you enjoy doing and let others do what they enjoy doing. That way everyone wins.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-04-08T20:18:43.343" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8937" PostTypeId="2" ParentId="2140" CreationDate="2016-04-08T21:21:25.217" Score="0" Body="&lt;h1&gt;Matrix Multiplication&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenge in which we will be multiplying matrices.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;an &lt;code&gt;n x m&lt;/code&gt; matrix, &lt;code&gt;A&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;an &lt;code&gt;m x p&lt;/code&gt; matrix, &lt;code&gt;B&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;optional:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;n&lt;/code&gt;, &lt;code&gt;m&lt;/code&gt;, and &lt;code&gt;p&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Input may be in any convenient fashion in order to reduce/eliminate the need to parse input. In particular, it may be given via function argument. The matrix dimensions may be taken as input or may be deduced from the actual matrix input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Matrix_multiplication&quot; rel=&quot;nofollow noreferrer&quot;&gt;product&lt;/a&gt; of the two matrices. That is, output the &lt;code&gt;n x p&lt;/code&gt; matrix &lt;code&gt;C&lt;/code&gt; such that &lt;code&gt;A * B = C&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your score will be the average of the sum of times your program takes to multiply several test cases &lt;em&gt;on my computer&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Basically, I:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Time your entry for each test case&lt;/li&gt;&#xA;&lt;li&gt;Add up all the times&lt;/li&gt;&#xA;&lt;li&gt;Repeat the above steps several/many times&lt;/li&gt;&#xA;&lt;li&gt;Average all the sums&lt;/li&gt;&#xA;&lt;li&gt;That average is your score&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules and Restrictions&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Built in array/vector/matrix multiplication functions are disallowed. If you have to ask if a built-in is allowed, it probably isn't (but please ask anyways).&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;However, once the test cases are up, I would like to see how MatLab compares to the given entries&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Entries in &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt; will be standard 16 bit signed integer. Entries in &lt;code&gt;C&lt;/code&gt; will fit in 32 bit signed integers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Matrix size/dimensions should be limited by mainly by my available memory.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The size of test cases is not yet determined. It will depend on the speed and memory requirements of entries. I will of course try my utmost to be fair.  &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I have 8G of RAM and an AMD64 cpu. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Languages must be freely available on linux. Please include instructions on how to compile/execute your code. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Notes&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm really not sure how big the matrices will be, but I'm expecting dimensions in the 100's or 1000's. &lt;/p&gt;&#xA;" OwnerUserId="45459" LastEditorUserId="45459" LastEditDate="2016-04-10T23:13:56.770" LastActivityDate="2016-04-10T23:13:56.770" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8939" PostTypeId="2" ParentId="673" CreationDate="2016-04-09T18:51:50.567" Score="9" Body="&lt;h2&gt;Code golf and atomic code golf do not mix&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; is a valid challenge type, but this style of scoring does not apply to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. If you are entering a code golf challenge using Scratch then the number of bytes in the source code is the only valid score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There can be debate over what counts as the source code, but that does not introduce the possibility of scoring based on atomic elements of the code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When deciding whether a given format counts as source code, simply ask whether there is a compiler or interpreter that will accept that source code and run it correctly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Current consensus is that it is acceptable to write a compiler or interpreter for just this purpose, in order to make a given format of source code valid. See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7560/may-i-create-my-own-programming-language-which-uses-existing-compiler&quot;&gt;May I create my own programming language, which uses existing compiler?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Without this, an arbitrary way of representing scratch code will not be valid.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2016-04-09T18:51:50.567" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8940" PostTypeId="2" ParentId="2140" CreationDate="2016-04-10T03:25:59.017" Score="2" Body="&lt;h1&gt;Help! Everything is in Wingdings!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a program or function that converts wingdings to a readable font. &#xA;The input to the program will be the path to a png file with between 1 and 10 wingdings characters. Your output should be the message contained in the wingdings characters.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specifications&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each test case will be a screenshot of the message as rendered in Microsoft Word (Black text on a white background, size 36,  and 100% zoom). The image will be cropped to the bounding box of the message.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[insert 20 test cases, 2 of each size between 1 and 10]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[insert link to test cases + reference images]&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;(% of characters right in test cases)*10 - code length&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Highest score wins)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard loopholes apply.&lt;/li&gt;&#xA;&lt;li&gt;No catering to the test cases.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;(Note that this is just a concept for a challenge. I will expand the challenge if this receives a positive response).&lt;/p&gt;&#xA;" OwnerUserId="41505" LastEditorUserId="41505" LastEditDate="2016-04-10T21:43:48.847" LastActivityDate="2016-04-10T21:43:48.847" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8943" PostTypeId="2" ParentId="8047" CreationDate="2016-04-11T00:13:04.723" Score="33" Body="&lt;h2&gt;Patching out approaches&lt;/h2&gt;&#xA;&lt;p&gt;On your challenge, someone posts a solution that's cheap and not at all what you intended. You &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7786/20260&quot;&gt;have the option to change the rules&lt;/a&gt;, but do so very carefully as there's many pitfalls.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Don't:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Criticize the answerer.&lt;/em&gt; They were just trying their best towards the winning criteria as stated.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8066/20260&quot;&gt;Simply encourage avoiding this approach&lt;/a&gt;.&lt;/em&gt; If it's not against the rules, it's fair game.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Ban answers &amp;quot;not in the spirit of the challenge&amp;quot;.&lt;/em&gt; Answerers can't read your mind to infer your intentions.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Require using a certain method.&lt;/em&gt; A lot of the fun is in finding novel, unexpected approaches.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Attack the symptoms.&lt;/em&gt; If the exploit suggests a broader problem with the challenge, fix that problem. Also, it's often hard to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8079/20260&quot;&gt;specify exactly what is off-limits&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Make rash changes.&lt;/em&gt; These might introduce other problems. It's hard to think clearly under time pressure. If you're unsure, ask that the challenge be closed, post it in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/20260&quot;&gt;Sandbox&lt;/a&gt; to get feedback, and reopen it when it's in good shape.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Post changes &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8112/20260&quot;&gt;solely in the comments.&lt;/a&gt;&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-13T04:54:42.893" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8944" PostTypeId="2" ParentId="2140" CreationDate="2016-04-11T02:57:05.037" Score="2" Body="&lt;h1&gt;KOTH: Black Hole&lt;/h1&gt;&#xA;&lt;p&gt;I've recently seen &lt;a href=&quot;https://www.youtube.com/watch?v=zMLE7a3faI4&quot; rel=&quot;nofollow noreferrer&quot;&gt;this video&lt;/a&gt; (by Tom Scott), in which it featured a game called Black Hole. Let's play that for KOTH!&lt;/p&gt;&#xA;&lt;h3&gt;Overview (the original version in the video)&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Two &amp;quot;players&amp;quot; have 10 counters, each labelled 1 to 10.&lt;/li&gt;&#xA;&lt;li&gt;These two players take it in turns to place counters in increasing order on a grid of 21 &amp;quot;spaces&amp;quot; arranged in a triangle (i.e. a triangle with 6 rows).&lt;/li&gt;&#xA;&lt;li&gt;Once all 21 counters have been placed, the remaining space that hasn't been used is the &amp;quot;black hole&amp;quot;, and the dots surrounding the black hole are &amp;quot;sucked in&amp;quot;.&lt;/li&gt;&#xA;&lt;li&gt;The person with the lowest sum of the counters &amp;quot;sucked in&amp;quot; wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;For the purpose of KOTH, the triangular grid will consist of 120 spaces (i.e. the triangle &amp;quot;pyramid&amp;quot; will be 15 rows high), and each player will have 59 counters (Yes, that means that there will be 2 black holes).&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Point System&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Win: 10 points, Draw (very rare): 3 points, Loss: no points&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Instructions&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The bot must output a number between 1 and 120 each turn, and a &amp;quot;counter&amp;quot; with the same number as the current no. turn made by the bot will be placed there.&lt;/li&gt;&#xA;&lt;li&gt;After 118 turns, the black holes activate, the score is counted, and points are awarded.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;NOTE: If there is no output within 5 seconds, the bot immediately loses.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h3&gt;&amp;quot;Battle&amp;quot; System&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The competition will be a round-robin, except each bot battles every other bot 5 times.&lt;/li&gt;&#xA;&lt;li&gt;The top three bots will then play each other 10 times each.&lt;/li&gt;&#xA;&lt;li&gt;The final winner is the winner of the competition.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Info on controller stuff&lt;/h3&gt;&#xA;&lt;p&gt;The controller will be in Python, but I don't have the first clue how to make an controller. Any help?&lt;/p&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-12T01:15:21.497" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="8945" PostTypeId="1" CreationDate="2016-04-11T08:49:15.283" Score="7" ViewCount="317" Body="&lt;p&gt;There is a code golf challenge on a foreign (not related to Stack Exchange) site with which I have a problem. The challenge is designed for Python 3 and has a length limit of 150 characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I thought to post the challenge &lt;a href=&quot;https://codegolf.stackexchange.com/q/77517/36188&quot;&gt;here&lt;/a&gt; and even open it up for other languages because there are posts on Meta that discourage language restrictions. I also added the original source as reference to the question, because the &quot;How to ask?&quot; help page said to do this. But nevertheless it got closed and strongly downvoted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I already searched the Metas of Stack Overflow and Code Review as well, but both of them state that code golf and minimizing code length is off topic there.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So therefore I'm now asking here whether it's okay to ask this type (help with an already existing challenge from a foreign source designed for one language) of question here at all and how I should have worded it differently than I did to receive positive feedback. &lt;/p&gt;&#xA;" OwnerUserId="36188" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-04-22T18:21:43.483" Title="On-topic to ask for help with an pre-existing code golf challenge from another site?" Tags="|discussion|code-golf|asking-questions|rules|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8946" PostTypeId="2" ParentId="2140" CreationDate="2016-04-11T09:58:19.263" Score="-2" Body="&lt;h1&gt;Linear Time Sorting&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;It was another slow day at Initech Inc. when a feature request came in:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;New Feature: Ability to sort by cash value in the transaction form. But make it a fast one!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Well it looks simple.. but what do the requester mean by fast one? Let's call Jim, from sales he probably knows what's going on.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Jim: Well you know , our Business Inc. contact is very passionate about &#xA;&#xA;programming and computer science! In fact he had this idea that we should &#xA;&#xA;do sorting in how that was called.. linear time?&#xA;&#xA;&#xA;You: Well you know that's impossible?&#xA;&#xA;Jim: But it was already approved by their cto and all! You need to do something&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You and Jim came up with a plan.. nobody will notice if that big of a list isn't sorted enough, right?&lt;/p&gt;&#xA;&lt;h1&gt;Your task&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to write a linear time sorting program. It will be scored on accuracy of the sort as compared to list sorted by regular sorting algorithm but it must work on O(N) time in the worst case, where N is length of the input.&lt;/p&gt;&#xA;&lt;p&gt;Input will be in the form of list of string-double tuples, e.g:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[(&amp;quot;aaaa&amp;quot;,2.0) , (&amp;quot;aaba&amp;quot;,1.0)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The program should sort on the number value of the tuple, i.e. in the above case the order should be reversed.&#xA;There may be multiple inputs with the same double values, but no string value is repeated. In the event that two inputs have the same integer value the perfect solution is to keep the order as it is.&#xA;The double value may be any floating-point value that fits in 8 byte double precision variable. NaNs should be placed at the end of the list.&lt;/p&gt;&#xA;&lt;p&gt;The score is calculated as number of &amp;quot;bubble sort operations&amp;quot; (switch an element with the next/previous element) needed to achieve perfect output from the output of your algorithm.&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox Worries&lt;/h1&gt;&#xA;&lt;p&gt;Well I don't know how clear my explanation of challenge was and if it is interesting to the PPCG crowd.&lt;/p&gt;&#xA;&lt;p&gt;Obviously there is a need for testing program and test cases.&lt;/p&gt;&#xA;" OwnerUserId="52213" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-11T18:37:30.447" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="8948" PostTypeId="2" ParentId="8945" CreationDate="2016-04-11T13:17:04.430" Score="2" Body="&lt;p&gt;Do you want help with an already existing challenge, or do you want to post the already existing challenge as your own? If you want help on golfing it, I would say it's definitely on topic. We have plenty of questions like this, and they're all fairly well received:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/47022/python-3-tried-golfing-my-assignment&quot;&gt;Python 3 - Tried Golfing My Assignment&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/47085/am-i-code-golfing-properly&quot;&gt;Am I code-golfing properly?&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/49772/how-could-i-reduce-the-length-of-this-code&quot;&gt;How could I reduce the length of this code?&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/50865/is-there-a-shorter-way-to-get-user-input-in-python&quot;&gt;Is there a shorter way to get user input in python?&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Now, none of these are about an external challenge from another site, but I see no reason you couldn't ask that. Make it clear in your post, and you'll be fine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The reason your question was not well received was because you posted it as a challenge, not as a &quot;How can I shorten this code I wrote?&quot; As a challenge, here are the problems with your question:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You didn't describe what formula could be used to calculate the correct output. This makes it harder for people unfamiliar with this knowledge to participate. This is what &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;the sandbox&lt;/a&gt; is for.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You didn't come up with the challenge yourself. This is the bigger problem. This is discouraged by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/16/what-are-the-policies-for-threads-relating-to-facebook-puzzles-project-euler-u&quot;&gt;community consensus&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If you want help golfing the code, I would phrase the question like this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;There is a challenge on [link to the challenge] where I need to take the height and width of an oblate or prolate, and return the surface area and volume. The formula to calculate this is:&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;volume = foobar()&#xA;area = baaz_quux()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Here is my attempt to golf it in python:&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#Code here&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The challenge requires my code to be under 150 characters, but I can't make it any shorter. Do you have any tips on how I could golf this down further?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;And then tag it with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot;&gt;python&lt;/a&gt; and you'll be good to go.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2016-04-11T13:28:19.433" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="8949" PostTypeId="2" ParentId="8945" CreationDate="2016-04-11T14:37:55.767" Score="11" Body="&lt;h3&gt;Attribution&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;First and foremost, I have no idea why one of the comments suggested editing the attribution out. If a challenge is taken from elsewhere (with minor modifications), full attribution is &lt;em&gt;required&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Downvotes&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Taking a challenge from elsewhere and posting it here with nearly identical rules will rarely go well.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You're scoring by length in characters rather than bytes. &lt;a href=&quot;https://codegolf.stackexchange.com/a/71016&quot;&gt;That's prone to abuse.&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Requiring a specific kind of submission (program, function, etc.) overrides our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2419&quot;&gt;Default for Code Golf: Program, Function or Snippet?&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While a challenge author &lt;em&gt;can&lt;/em&gt; override this default and absolutely should &lt;em&gt;if there's a good reason to do so&lt;/em&gt;, the community came to expect this liberty and will most likely frown a upon a challenge that overrides it arbitrarily.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8065&quot;&gt;Things to avoid when writing challenges: Arbitrarily overriding the defaults&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The current revision allows full programs now, but it still requires to &lt;em&gt;return a tuple&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not sure how to interpret that for full programs, and most languages do not have a &lt;em&gt;tuple&lt;/em&gt; type. Some language do not have any iterable type at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8067&quot;&gt;Things to avoid when writing challenges: Making assumptions about language features&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In general it is advisable to stick to our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447&quot;&gt;Default for Code Golf: Input/Output methods&lt;/a&gt;, and give as much liberty as possible when it comes to I/O.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, rounding to two decimal places seems unnecessary. This will make the task considerably more difficult for languages that do not have a built-in for rounding to &lt;strong&gt;x&lt;/strong&gt; decimal places.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8077&quot;&gt;Things to avoid when writing challenges: Cumbersome I/O formats&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Removing all of the above restrictions makes the problem rather straightforward.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Calculating the volume of a spheroid is nothing more than a simple formula. Calculating the surface area is just as easy if the language can deal with complex numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that easy challenges may be received very well or very poorly. This is an unfortunate situation for challenge authors, but I'm not quite sure what to do about it...&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Close votes&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I'm rather surprised by the close votes. There's only one concern about the question's clarity in the comments, and it has been posted &lt;em&gt;after&lt;/em&gt; the challenge was closed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd add to Peter's question about rounding that you should specify whether we have to worry about floating point errors. For example, if you decide on rounding towards the nearest multiple of &lt;strong&gt;0.01&lt;/strong&gt;, rounding halves up, an unrounded result of &lt;strong&gt;0.13499999999999998&lt;/strong&gt; representing an exact value of &lt;strong&gt;0.135&lt;/strong&gt; would get rounded down to &lt;strong&gt;0.13&lt;/strong&gt;, but should get rounded up to &lt;strong&gt;0.14&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If this is addressed and the tuple situation is clarified, I don't see any further issues with the question's clarity.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Getting help&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Since your intention was to get help with a particular code golf problem, all changes to the original problem will take you farther away from your objective. Furthermore, you're not at all guaranteed to get a Python submission to your challenge (although you &lt;em&gt;probably&lt;/em&gt; will). Reshaping your challenge into a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question, as suggested by Dr Green Eggs and Ham DJ, might be a better idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It looks like &lt;em&gt;Empire of Code&lt;/em&gt; is a game and not a contest, so unless I'm mistaken and answers to your question could be used to gain advantage over others or to win a prize, that question should be perfectly on topic here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One final concern may be a prohibition by &lt;em&gt;Empire of Code&lt;/em&gt; to re-use their challenge ideas or receive outside help. &lt;a href=&quot;https://empireofcode.com/documents/terms.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;Their terms of service&lt;/a&gt; currently give me a 403, so I can't check...&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-04-11T16:58:23.130" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8950" PostTypeId="2" ParentId="2140" CreationDate="2016-04-11T20:09:45.737" Score="2" Body="&lt;h1&gt;Find point on the Hilbert curve&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Hilbert_curve&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hilbert curve&lt;/a&gt; space filling curve. It is a limit of recursive approximations. Being spacefilling means there is a parametrization of the curve which is continuous. So we can map the interval &lt;code&gt;[0,1]&lt;/code&gt; continuously to the unit square &lt;code&gt;[0,1]x[0,1]&lt;/code&gt;. Let us call this map &lt;code&gt;h&lt;/code&gt;. (Note that the image of the &lt;code&gt;[0,1]&lt;/code&gt; is not the complete &lt;code&gt;[0,1]x[0,1]&lt;/code&gt; but rather a dense subset. E.g. &lt;code&gt;(.5,.1)&lt;/code&gt; is obviously not in the Hilbert curve, as it is not in any of the approximations.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/THkZz.gif&quot; width=&quot;200&quot; /&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is now to write a progarm that given a value in &lt;code&gt;[0,1]&lt;/code&gt; to return the corresponding value unit square &lt;code&gt;[0,1]x[0,1]&lt;/code&gt;, where &lt;code&gt;h(0)=(0,0)&lt;/code&gt; and &lt;code&gt;h(1)=(1,0)&lt;/code&gt;, and &lt;code&gt;h(.5) = (.5, .5)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This could also be done backwards.&lt;/li&gt;&#xA;&lt;li&gt;Test cases to be added.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2016-04-11T20:47:22.387" LastActivityDate="2016-04-11T20:47:22.387" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="8951" PostTypeId="2" ParentId="2140" CreationDate="2016-04-11T21:57:02.343" Score="-2" Body="&lt;h1&gt;Make a quine without using string literals &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A quine is a computer program that prints out it's own source code to stdout. Your task is to make one that doesn't use string literals. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You cannot:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Have any empty program&lt;/li&gt;&#xA;&lt;li&gt;Read your source code directly or indirectly (i.e. form a file)&lt;/li&gt;&#xA;&lt;li&gt;Use error messages to print out the source code&lt;/li&gt;&#xA;&lt;li&gt;Rely on language features to print out the source&lt;/li&gt;&#xA;&lt;li&gt;Relying on a REPL environment&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;A string literal is a:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;String type (obvious)&lt;/li&gt;&#xA;&lt;li&gt;Number used to store the character (sorry BF!)&lt;/li&gt;&#xA;&lt;li&gt;Other predefined constant&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You are encouraged to compute your own source code.&lt;/p&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2016-04-11T21:57:02.343" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8955" PostTypeId="2" ParentId="2140" CreationDate="2016-04-12T17:00:36.363" Score="0" Body="&lt;h1&gt;Iterated Matrix Multiplication&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an &lt;code&gt;nxn&lt;/code&gt; matrix &lt;code&gt;A&lt;/code&gt;, an &lt;code&gt;nx1&lt;/code&gt; matrix &lt;code&gt;X&lt;/code&gt;, and a list &lt;code&gt;L&lt;/code&gt; of ordered pairs in &lt;code&gt;[0,n)x[0,n)&lt;/code&gt;, determine if there exists some integer &lt;code&gt;k&amp;gt;=0&lt;/code&gt; such that, with &lt;code&gt;B=A^k*X&lt;/code&gt;, for all &lt;code&gt;(D,E)&lt;/code&gt; in &lt;code&gt;L&lt;/code&gt;, &lt;code&gt;B[D]&amp;lt;B[E]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Why it's possible:&lt;/strong&gt; Every entry of the natural number power of a general matrix can be expressed via sums of multiples of powers of the matrix's eigenvalues, like &lt;code&gt;2^k+4*6^k-10*3^k&lt;/code&gt;, and for any two such expressions, there will always be some &lt;code&gt;k&lt;/code&gt; beyond which one term dominates the expression, and the sign of their difference can no longer change, so one way to solve the problem would be to calculate that &lt;code&gt;k&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test cases:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[1,2],[2,3]],[3,4],[(0,1)] -&amp;gt; Yes (k=0)&#xA;[[1,2],[2,3]],[3,4],[(1,0)] -&amp;gt; No&#xA;[[1,2],[2,3]],[4,3],[(1,0)] -&amp;gt; Yes (k=0)&#xA;[[1,2],[2,3]],[4,3],[(0,1)] -&amp;gt; Yes (k=1)&#xA;[[1,-2],[2,-3]],[3,4],[(1,0)] -&amp;gt; Yes (k=1)&#xA;[[-1,-2],[2,-3]],[3,4],[(1,0)] -&amp;gt; Yes (k=2)&#xA;[[-1,-2],[2,-3]],[3,4],[(1,0),(0,1)] -&amp;gt; No&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="49330" LastEditorUserId="49330" LastEditDate="2016-04-12T18:40:37.447" LastActivityDate="2016-04-12T18:40:37.447" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8956" PostTypeId="2" ParentId="8922" CreationDate="2016-04-12T17:36:52.417" Score="4" Body="&lt;h1&gt;Java&lt;/h1&gt;&#xA;&lt;p&gt;I wrote this answer under the assumption that there exists a good reason for limiting a challenge to only one language.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Popularity:&lt;/strong&gt; In 2014, an &lt;a href=&quot;http://cacm.acm.org/blogs/blog-cacm/176450-python-is-now-the-most-popular-introductory-teaching-language-at-top-us-universities/fulltext&quot; rel=&quot;nofollow noreferrer&quot;&gt;overwhelming majority&lt;/a&gt; of universities use Java or Python as the tool of choice for teaching introduction to programming. More recently, the &lt;a href=&quot;https://stackoverflow.com/research/developer-survey-2016#most-popular-technologies-per-occupation&quot;&gt;2016 developer survey&lt;/a&gt; showed that JavaScript was the most popular language among front-end and back-end developers, with Python being more popular with Math and Data folks, and Java being the most well-known among students.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Performance:&lt;/strong&gt; Of those three languages, Java is usually the fastest (when compared using each languages most widely used runtime environment). See &lt;a href=&quot;https://benchmarksgame.alioth.debian.org/u64q/python.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; for a more direct comparison of Java and Python. See &lt;a href=&quot;https://benchmarksgame.alioth.debian.org/u64q/javascript.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; for a direct comparison of JavaScript and Java.&lt;/p&gt;&#xA;&lt;p&gt;If the goal is to optimize both performance and ease of participation, then Java is the correct choice.&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-12T20:26:14.830" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="8957" PostTypeId="2" ParentId="8922" CreationDate="2016-04-12T18:08:42.647" Score="5" Body="&lt;h1&gt;JavaScript&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://stackoverflow.com/research/developer-survey-2016#most-popular-technologies-per-occupation&quot;&gt;JavaScript is known by a majority of Developers&lt;/a&gt; according to the SO survey.&lt;/li&gt;&#xA;&lt;li&gt;It has (pseudo) classes, like this:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;pre&gt;function MyBot(action){&#xA;  this.action = action;&#xA;  this.moves = [];&#xA;}&#xA;var bot = new MyBot(function(){return &quot;LRD&quot;;});&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can do it online, where most everyone who would want to participate is.&lt;/li&gt;&#xA;&lt;li&gt;It's similar to many langs in terms of syntax (C-like), and is far simpler to use, being a scripting language.&lt;/li&gt;&#xA;&lt;li&gt;(BONUS: You can emulate Python with it.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Why not JavaScript?&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If you need to have long-running programs (e.g. long-lasting &lt;code&gt;while&lt;/code&gt; loops), DO NOT use JavaScript, as it stalls the webpage. (Or use node, though I confess I don't know much about it.)&lt;/li&gt;&#xA;&lt;li&gt;If you need more math stuff, use another lang with libraries. JS has some nice math functions, but will make you implement stuff like primality and otherstuff.&lt;/li&gt;&#xA;&lt;li&gt;IF you need speed, there are other languages more suited for that purpose..&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2016-04-12T18:08:42.647" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8958" PostTypeId="2" ParentId="8922" CreationDate="2016-04-12T20:55:35.883" Score="10" Body="&lt;h2&gt;Use whatever you're comfortable with...&lt;/h2&gt;&#xA;&lt;p&gt;...but make sure it's a moderately-well-known language to encourage more submissions from more people.&lt;/p&gt;&#xA;&lt;p&gt;Here is a (not exhaustive, in no particular order) list of languages I personally would consider to be good choices for a single-language King of the Hill challenge:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Java&lt;/li&gt;&#xA;&lt;li&gt;Python&lt;/li&gt;&#xA;&lt;li&gt;C++&lt;/li&gt;&#xA;&lt;li&gt;JavaScript&lt;/li&gt;&#xA;&lt;li&gt;C#&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Ultimately, since you'll be writing the controller code, the language choice is up to you.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-12T20:55:35.883" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8962" PostTypeId="2" ParentId="2140" CreationDate="2016-04-13T12:47:51.330" Score="0" Body="&lt;h2&gt;Colorize!&lt;/h2&gt;&#xA;&lt;p&gt;In Ruby, the &lt;code&gt;colorize&lt;/code&gt; gem allows you to output text to the terminal in pretty colors:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/3S7ZS.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/3S7ZS.png&quot; alt=&quot;Blue, bold text saying &amp;quot;This is a box&amp;quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;It uses the &lt;a href=&quot;https://en.wikipedia.org/wiki/ANSI_escape_code#Colors&quot; rel=&quot;nofollow noreferrer&quot;&gt;ANSI color standard&lt;/a&gt; to tell the terminal how to color things, then trusts that the terminal will do the right thing. For this challenge, you can too.&lt;/p&gt;&#xA;&lt;p&gt;What you'll do is take a a pair of lidts of strings, in whatever format you want. For example, if you wanted comma-separated values:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+-----+,| box |,+-----+&#xA;red,blue,red&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The first list is what you'll be colorizing. The second list is a list of color names that are the same as the ones in the Wikipedia article. You'll colorize each string from the first list with the respective color from the second. The two lists will always have the same number of items, and the second will only ever contain valid color names. The strings in the first will only contain valid, printable ASCII characters.&lt;/p&gt;&#xA;&lt;p&gt;And apply those colors -- as given by the ANSI standard linked above -- to the text, printing each string on its own line. For example, with this (heavily ungolfed) code:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#to be written&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;you'd get this:&lt;/p&gt;&#xA;&lt;p&gt;[picture of result]&lt;/p&gt;&#xA;&lt;p&gt;You may not use any libraries built to do this, and the standard loopholes are disallowed.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I'm thinking of adding extra credit for bolding/doing multiple things at once. Is that a good idea?&lt;/p&gt;&#xA;&lt;p&gt;Aside from that, how is the rest of the challenge?&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;To-do list:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Copy the list from Wikipedia to here&lt;/li&gt;&#xA;&lt;li&gt;Add pictures, demo code&lt;/li&gt;&#xA;&lt;li&gt;Add that you have to change the color back to default at the end&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="31541" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-13T13:43:44.980" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8963" PostTypeId="2" ParentId="2214" CreationDate="2016-04-13T15:43:34.213" Score="7" Body="&lt;p&gt;A string is also a list of single character strings. For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&quot;H&quot;, &quot;e&quot;, &quot;l&quot;, &quot;l&quot;, &quot;o&quot;, &quot;,&quot;, &quot; &quot;, &quot;w&quot;, &quot;o&quot;, &quot;r&quot;, &quot;l&quot;, &quot;d&quot;, &quot;!&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;While technically different, this is not thematically different from a list of characters. Therefore I believe agrees with the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2216/31625&quot;&gt;current consensus' conclusion&lt;/a&gt; that the Wikipedia definition of &quot;a sequence of characters&quot;. I don't believe this format encodes any more information than a plain string does.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sometimes certain operations in higher level languages are more convenient when performed on a list in this manner, and I don't see why we should automatically limit some of the opportunities that people can have for golfing or otherwise improving their score.&lt;/p&gt;&#xA;" OwnerUserId="31625" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-04-13T15:43:34.213" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8964" PostTypeId="2" ParentId="2214" CreationDate="2016-04-13T20:05:30.637" Score="9" Body="&lt;h2&gt;If it looks like a string and acts like a string, it's a string&lt;/h2&gt;&#xA;&lt;p&gt;Examples of strings:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Native string types: C++ &lt;code&gt;string&lt;/code&gt;s, Java &lt;code&gt;String&lt;/code&gt;s, JavaScript &lt;code&gt;String&lt;/code&gt;s, etc.&lt;/li&gt;&#xA;&lt;li&gt;Native character types: C/C++ &lt;code&gt;char&lt;/code&gt;s and &lt;code&gt;wchar&lt;/code&gt;s, Java &lt;code&gt;char&lt;/code&gt;s and &lt;code&gt;Character&lt;/code&gt;s, etc.&lt;/li&gt;&#xA;&lt;li&gt;An iterable (tuple, array, vector, list, etc.) of characters or length-1 strings: C/C++/Java/etc. &lt;code&gt;char[]&lt;/code&gt;s, a list of length-1 strings in Python (&lt;code&gt;[x for x in s]&lt;/code&gt;), etc.&lt;/li&gt;&#xA;&lt;li&gt;An iterable of byte values (between 0 and either 127 or 255, inclusive, depending on whether or not extended ASCII is supported): Python 3's &lt;code&gt;bytes&lt;/code&gt; type, brainfuck's tape (when given ASCII input)&lt;/li&gt;&#xA;&lt;li&gt;An iterable of integers representing Unicode code points (SWI-Prolog does this)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-14T19:10:00.530" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="8966" PostTypeId="1" CreationDate="2016-04-14T10:07:25.053" Score="6" ViewCount="211" Body="&lt;p&gt;&lt;strong&gt;Re-edited&lt;/strong&gt; for further clarify:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://box-256.com/&quot; rel=&quot;nofollow&quot;&gt;http://box-256.com/&lt;/a&gt; is an on-line game in which one codes in a form of assembly to solve the puzzles presented on there.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can we ask questions on this site which are competitions based on the levels on &lt;a href=&quot;http://box-256.com/&quot; rel=&quot;nofollow&quot;&gt;http://box-256.com/&lt;/a&gt; - such as &quot;Who can solve the 'BIG SQAURE' level in the least amount of instructions?&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The reason I ask is because the contest is technically about how well the contestants can &quot;play a game&quot; but that game is to program in assembly so to me would seem on-topic.&lt;/p&gt;&#xA;" OwnerUserId="6558" LastEditorDisplayName="user45941" LastEditDate="2016-04-14T19:51:23.527" LastActivityDate="2016-04-23T12:20:51.247" Title="Can I set a challenge using Box-256?" Tags="|discussion|asking-questions|rules|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8968" PostTypeId="1" AcceptedAnswerId="8969" CreationDate="2016-04-14T16:17:11.497" Score="7" ViewCount="247" Body="&lt;p&gt;I opened SE a few minutes ago and was pleasantly surprised to see I'd reached 2k rep, and alongside that gained access to mod tools (&lt;em&gt;sehr interessant&lt;/em&gt;). I was mostly very confused, since I was certain mod tools come at 10k rep.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By browsing &lt;code&gt;http://SITENAME.stackexchange.com/help/privileges&lt;/code&gt; on various sites, it seems like &lt;strong&gt;recently graduated sites without designs&lt;/strong&gt; put mod tools at 2k, where graduated sites &lt;strong&gt;with designs&lt;/strong&gt; put mod tools at 10k. (compare: &lt;a href=&quot;https://aviation.stackexchange.com/help/privileges&quot;&gt;Aviation.se&lt;/a&gt; and &lt;a href=&quot;https://ell.stackexchange.com/help/privileges&quot;&gt;ELL.se&lt;/a&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Searching about this on Mother Meta and PPCG Meta have not turned up anything (because I have no idea what this phenomenon is actually called), so I'll ask here:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Does the rep-requirement-shift come when we get a design (or is it a coincidence?), and &lt;/li&gt;&#xA;&lt;li&gt;if I still have 2,004 rep at that time, will my mod tools go away?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="-1" LastEditDate="2017-04-13T12:59:54.040" LastActivityDate="2016-04-14T16:23:23.530" Title="(When) do my mod tools go away?" Tags="|support|reputation|site-design|moderation|graduation|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8969" PostTypeId="2" ParentId="8968" CreationDate="2016-04-14T16:19:49.670" Score="6" Body="&lt;p&gt;Yes, the privilege thresholds increase when sites get custom designs. See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8538/20469&quot;&gt;Congratulations, you&amp;#39;re graduating!&lt;/a&gt;. So if you still have about 2000 reputation when we get a design, you'll still have your edits applied immediately, but access to all privileges above that will be removed. See &lt;a href=&quot;https://stackoverflow.com/help/privileges&quot;&gt;Stack Overflow's privileges&lt;/a&gt; for comparison.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2016-04-14T16:23:23.530" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8970" PostTypeId="2" ParentId="2140" CreationDate="2016-04-14T16:58:10.253" Score="0" Body="&lt;h1&gt;Random Wikipedia Browsing&lt;/h1&gt;&#xA;&lt;p&gt;Here's a short one for you.  Create a program or function prints or returns the title of a random Wikipedia page (similar to Alt + x functionality)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Program or function will take no input&lt;/li&gt;&#xA;&lt;li&gt;Program or function will print to STDOUT (or nearest equivalent) or return only the page name. I don't care about trailing spaces or newlines.  Preceding spaces or new lines are disallowed&lt;/li&gt;&#xA;&lt;li&gt;Program or function may not access a list of Wikipedia page names stored within a local file.&lt;/li&gt;&#xA;&lt;li&gt;There is no requirement to use English language Wikipedia (en.wikipedia.org)&lt;/li&gt;&#xA;&lt;li&gt;Page must be chosen (psuedo) randomly&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For reference, here is a &lt;a href=&quot;https://www.mediawiki.org/wiki/API:Main_page&quot; rel=&quot;nofollow noreferrer&quot;&gt;link to the Wikipedia API&lt;/a&gt;.  Shortest program or function in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="30170" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-14T16:58:10.253" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="8973" PostTypeId="2" ParentId="2140" CreationDate="2016-04-15T18:59:28.860" Score="1" Body="&lt;h1&gt;Compute the size of a binary tree iteratively&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Binary trees are easy to manipulate using recursion. For example, here is Java code that declares a binary tree and determines its size (the number of nodes it contains) recursively:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;public class BinaryTree&#xA;{&#xA;  private Node root;&#xA;&#xA;  /**&#xA;   * Constructs a search tree with the given root.&#xA;   *&#xA;   * @param the root node&#xA;   */&#xA;  public BinaryTree(Node root)&#xA;  {&#xA;    this.root = root;&#xA;  }&#xA;&#xA;  /**&#xA;   * Gets the number of nodes in this tree.&#xA;   */&#xA;  public int size()&#xA;  {&#xA;    return size(root);&#xA;  }&#xA;&#xA;  // private helper function&#xA;  private int size(Node node)&#xA;  {&#xA;    if (node == null)&#xA;      return 0;&#xA;    else&#xA;      return 1 + size(node.getLeftChild()) + size(node.getRightChild());&#xA;  }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The definition of &lt;code&gt;Node&lt;/code&gt; is not shown. As you would expect, it has methods &lt;code&gt;getLeftChild()&lt;/code&gt; and &lt;code&gt;getRightChild()&lt;/code&gt; that either return other instances of &lt;code&gt;Node&lt;/code&gt; or &lt;code&gt;null&lt;/code&gt;. A &lt;code&gt;Node&lt;/code&gt; does not have backlinks to its parent.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a non-recursive function to determine the number of nodes in a binary tree. You should not make any assumptions about the ordering of the nodes; however, you can assume that a reasonable hash function exists on nodes such that you can expect O(1) access time using a hash table.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition to not calling itself, your function should not simulate recursion through a stack-like data structure, and it should not call any recursive functions. You may use standard data structures, such as a set that uses hash codes to determine membership.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Solutions will be judged by their efficiency. Specifically, they will be judged by their time complexity, with space complexity used as a tie-breaker. &lt;/p&gt;&#xA;" OwnerUserId="23785" LastActivityDate="2016-04-15T18:59:28.860" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8976" PostTypeId="2" ParentId="2140" CreationDate="2016-04-17T06:45:09.773" Score="-3" Body="&lt;h1&gt;Alphabetization 101 (popularity contest)&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to use all 52 letters of both the uppercase and lowercase alphabet, ONCE and ONCE only, and make a program.&lt;/p&gt;&#xA;&lt;p&gt;You are free to use any other ASCII character more than once, or use a letter of the alphabet more than once if it's required for the language to function.&lt;/p&gt;&#xA;&lt;h2&gt;Meta:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Not sure if this has been done before.&lt;/li&gt;&#xA;&lt;li&gt;Any questions regarding the task?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-17T06:45:09.773" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="8980" PostTypeId="2" ParentId="2140" CreationDate="2016-04-18T11:04:46.173" Score="1" Body="&lt;h2&gt;Decimal to Troll&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Troll_(Discworld)&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Discworld Trolls&quot;&gt;Discworld Trolls&lt;/a&gt; have a unique number system. From Wikipedia:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Trolls have a numeral system of their own, based on powers of 4.&lt;/p&gt;&#xA;&lt;p&gt;The base numerals are one (1), two (2), three (3), many (4) and lots (16), which can be combined to form higher numbers.&lt;/p&gt;&#xA;&lt;p&gt;When combined, each numeral's value is added to those of the others. Higher-valued numerals take priority over lower-valued ones, so that 4 is written &amp;quot;many&amp;quot; and not &amp;quot;two-two&amp;quot; or &amp;quot;three-one&amp;quot; and 20 is written &amp;quot;lots many&amp;quot; rather than &amp;quot;many many many many many&amp;quot;. If there are no ones, twos or threes, the number is written with spaces between the numerals; if any exist a hyphen replaces the space between every numeral.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;The challenge is to write a program that accepts a positive integer and outputs the equivalent troll counting string, including the correct separator (hyphen or space) based on the above rules.&lt;/p&gt;&#xA;&lt;p&gt;Examples (including those from Wikipedia):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input   Output&#xA;-----   ------&#xA;   1      one&#xA;   2      two&#xA;   3      three&#xA;   4      many&#xA;   5      many-one&#xA;  10      many-many-two&#xA;  20      lots many&#xA;  32      lots lots&#xA; 126      lots-lots-lots-lots-lots-lots-lots-many-many-many-two&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is code-golf, shortest answer wins.&lt;/p&gt;&#xA;" OwnerUserId="49723" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-18T11:04:46.173" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8983" PostTypeId="1" CreationDate="2016-04-18T18:00:50.987" Score="-8" ViewCount="281" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; is incredibly broad.  Its &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot;&gt;description&lt;/a&gt; says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The challenge involves mathematics. Also consider using more specific tags: [number] [number-theory] [arithmetic] [combinatorics] [graphs] [geometry] [field-theory].&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;After going through the tag, there seem to be three distinct types of questions tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Those that deal with a particular field in math, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/prime&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;prime&amp;#39;&quot; rel=&quot;tag&quot;&gt;prime&lt;/a&gt;, or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Those that deal with basic math and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Those that include math, but the math is not the focus of the challenge.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; a problem, and if so, how should we deal with it?&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-04-19T14:23:46.893" Title="Let's remove [tag:math]!" Tags="|discussion|tags|" AnswerCount="2" CommentCount="11" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8984" PostTypeId="2" ParentId="8983" CreationDate="2016-04-18T18:06:50.593" Score="-14" Body="&lt;h1&gt;Yes, it should be removed.&lt;/h1&gt;&#xA;&lt;p&gt;The steps to fix should be:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Go through each of the tagged questions, remove &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;, and add the particular field it is in.&lt;/li&gt;&#xA;&lt;li&gt;If math isn't the focus of the challenge, the simply remove the tag.&lt;/li&gt;&#xA;&lt;li&gt;Make &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; a synonym for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-18T18:06:50.593" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8986" PostTypeId="2" ParentId="8983" CreationDate="2016-04-18T18:32:54.413" Score="25" Body="&lt;h1&gt;Let's keep it.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Though it encompasses a wide variety of challenges, I do think it adds a level of context not readily available with separate tags like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;, or what have you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider this (admittedly contrived) scenario. Say a user is thinking, &quot;I'd like to participate in a mathy challenge but I don't have a particular type of math in mind.&quot; If there was no way to say &quot;math only, pls&quot; then they have to search through a huge number of tags and would likely overlook some interesting challenges that involved a different kind of math. As it stands, they can just say, &quot;find me &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&quot; and they'll be able to explore a lot more challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Further, I fail to see any actual &lt;em&gt;benefit&lt;/em&gt; to removing the tag. So what if it's broad and encompasses many challenges? It's typically used in conjunction with more specific tags, which seems perfectly fine to me.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-04-18T18:32:54.413" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="8988" PostTypeId="2" ParentId="2140" CreationDate="2016-04-20T04:04:58.690" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; Tron Bot Racing&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It's time to begin annual Tron Racing Tournament. Create a bot that will steer your cycle to a victory!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Glossary&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Board&lt;/em&gt; is a 100x100 square that wraps around its edges.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Game&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Bots&lt;/em&gt; leave impassable trail. In the beginning of the game, all the bots participating (2 in case of a duel) are placed randomly thorough the map. Then, at the beginning of each turn, all bots must decide the direction they will chose next (Up, Down, Right, Left) based (or not) on the available data, which is the empty cells in each of the directions. If bot tries to move into an occupied cell, his turn is repeated until it makes a valid move. If after 10 tries bot still won't make a valid move, it dies. Game ends when all bots die. Score is the length of your trail.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;. . . . . d . .&#xA;. . . b b b b .     Received data:&#xA;. . . b . u b .     L0 U3 R3 D3 T1&#xA;. . . b . u b .     &#xA;. . . b . u b .     Length of line of sight is `ceil(map_size/2) - 1`&#xA;r . . b b B r r     and it wraps around map edges.  &#xA;. . . . . d . .     u, r, d - lines of sight&#xA;. . . . . d . .     B - bot, b - bot's trail &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If bot decides to go Left (and will collide with his own trail), he is invoked one more time with Tries increased: `L0 U3 R3 D3 T2'.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Submissions&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The engine is written in Node.js, so your bot should be a function in Javascript that accepts 1 argument (state array) and returns integer between 0 - 3 which corresponds to your chosen direction.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function RandomBot(state) {&#xA;  return Math.floor(Math.random() * 4);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;0 - Left, 1 - Up, 2 - Right, 3 - Down&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can also write your bot in any other runnable language. It will be run every time a decision needs to be made, with data pushed into StdIn &lt;code&gt;3,3,0,2,1&lt;/code&gt; and output (single integer) required at StdOut.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, by using Javascript you have the advantage to use &lt;em&gt;this&lt;/em&gt; to save data between runs.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Winner and conditions&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Bots will be dueling with each other, each duel repeated 100 times. Standard loopholes apply. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;How to create leaderboard? How to score wins and loses?&#xA;Is there anything that can be improved? This is my first entry ever and I have already a working prototype. I have concerns with the data passed to bots. Maybe its too small? Anyway, let me know what do you think about it guys.&lt;/p&gt;&#xA;" OwnerUserId="53142" LastActivityDate="2016-04-20T04:04:58.690" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8989" PostTypeId="2" ParentId="8463" CreationDate="2016-04-20T16:02:30.393" Score="4" Body="&lt;h1&gt;Multi-part challenges aren't ideal, but shouldn't be forbidden&lt;/h1&gt;&#xA;&lt;p&gt;To be fair, &amp;quot;multi-part&amp;quot; is a relative term. A challenge that asks for one program that takes the square root of the cosine of a number is not all that different from a multi-part challenge that asks for one program that takes the cosine of a number and another program that takes the square root of a number.&lt;/p&gt;&#xA;&lt;p&gt;Multi-part challenges aren't that common anyway (and don't seem to be getting any more or less common), so a few won't tarnish the site too much.&lt;/p&gt;&#xA;&lt;p&gt;The primary complaints about them mentioned in the question were:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;(1)&lt;/strong&gt; Mainly it's not clear how we should deal with people copying one of the subchallenges from another answer, and &lt;strong&gt;(2)&lt;/strong&gt; how these should be treated in the context of partial duplicates.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I'd argue that all challenges share issue (1) - copying sections of code or algorithm ideas can happen anywhere. It's easier in multi-part challenges but still, whether it's allowed or not is a different meta question.&lt;/p&gt;&#xA;&lt;p&gt;Issue (2) is the real crux in my opinion, since we put so much effort into our avoidance of duplicates. I'd say that if no part of a multi-part question is a duplicate, why not allow it? The author still came up with the ideas themselves and why not let them combine them into one challenge if they want to?&lt;/p&gt;&#xA;&lt;p&gt;If some parts &lt;em&gt;are&lt;/em&gt; duplicates then that's a different story. I'm not really sure what the best solution is but here are a few ideas (maybe this could be its own meta question):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Not allow any duplicate parts. (Encourage author to quickly change/remove offending parts.)&lt;/li&gt;&#xA;&lt;li&gt;Allow it if the majority of the parts are non-duplicates.&lt;/li&gt;&#xA;&lt;li&gt;Don't have a hard rule and let people vote to close as duplicate naturally. (Less official but perhaps more fair in some cases since it's kinda case by case.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;(&lt;a href=&quot;https://codegolf.stackexchange.com/q/78109/26997&quot;&gt;Recent example of a multi-part question, just for some context.&lt;/a&gt;)&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-20T16:02:30.393" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="8990" PostTypeId="1" CreationDate="2016-04-21T03:02:47.353" Score="13" ViewCount="896" Body="&lt;p&gt;Inspired by &lt;a href=&quot;https://unix.stackexchange.com/a/277967/56646&quot;&gt;this answer&lt;/a&gt;, I thought an interesting challenge would be to golf a PDF file.  PDF files are based on the PostScript language, so I thought this might be acceptable as a programming challenge for this site; but I wanted to check first.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A proposed challenge might be something like:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Construct the smallest possible PDF file consisting of a single A4 page with the text &quot;Hello, world!&quot; printed on it somewhere.  The text may be in any font, but the characters must be at least 12 points in size.  &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Scoring will be by number of bytes in the file.  External tools may be used to construct the file, but the score would be based on the size of the output PDF file itself, not on the size of the script used to generate it.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Entries must conform to the ISO 32000-1 PDF standard, and be viewable on commonly used PDF viewers.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Would such a challenge be on topic?&lt;/p&gt;&#xA;" OwnerUserId="14678" LastEditorUserId="-1" LastEditDate="2017-04-13T12:37:09.253" LastActivityDate="2016-04-22T18:23:33.047" Title="Hand-crafting a PDF" Tags="|discussion|challenges|code-challenge|" AnswerCount="3" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8994" PostTypeId="2" ParentId="8990" CreationDate="2016-04-21T15:21:20.207" Score="7" Body="&lt;p&gt;Your question seems on-topic, so I'll try to go over concerns I'd have about it being on topic, but say why I think it is on topic.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;with the text &quot;Hello, world!&quot; printed on it somewhere&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is somewhat vague, does printed mean it has to be &quot;text&quot; or can I make an image and use that? I'm not certain how effective workarounds like this would be, but they might cause the challenge to degenerate somewhat.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This may mean your challenge would be too broad for having too many possible answers, but should be on topic.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;based on the size of the output PDF file itself&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is usually fine, and it is what the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; is for. However, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8990/hand-crafting-a-pdf#comment25982_8990&quot;&gt;Peter's comment&lt;/a&gt; addresses a potential problem with the way this is structured. Say I post and answer. Then, SomeUser copies the result that I got, but uses their massive server farm to compress it slightly. Now their score is better than mine. While there isn't really anything inherently wrong with this, and we've had several on-topic &lt;a href=&quot;https://codegolf.stackexchange.com/q/41648/31625&quot;&gt;largest prime finding questions&lt;/a&gt; that function very similarly, I'd be worried that the challenge would quickly devolve into just spending more time compressing the current best answer.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Entries must conform to the ISO 32000-1 PDF standard, and be viewable on commonly used PDF viewers&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is a bit of a pain, but requiring conforming to a standard would mean you need to include the standard in your post. Instead of this, I would recommend changing this so that it only has to work on one free PDF viewer that is freely available and older than the challenge. This is more in line with how we handle programming languages as being valid for a challenge. (It also would help with the above, where finding lazier PDF viewers might help lower your score)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This may cause what you are asking to be unclear, but so long as you fully clarify what is going on your post is about writing a program to solve a task with an objective winning criterion and an objective validity criterion.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Some of this answer kind of crosses over to things that should be done in the sandbox, the core of your question: &quot;Is this on topic&quot; is yes, but the goodness of a challenge should probably be limited to the sandbox.&lt;/p&gt;&#xA;" OwnerUserId="31625" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-04-21T20:49:10.797" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8995" PostTypeId="1" AcceptedAnswerId="8999" CreationDate="2016-04-21T18:43:47.700" Score="14" ViewCount="1239" Body="&lt;p&gt;I like vim a lot. I've been golfing with it a lot recently. We already have clearly established that vim &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4817/31716&quot;&gt;is a programming language&lt;/a&gt;, but there aren't any clear rules on how to score vim answers. The main things that I want to clarify are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Do modifiers (shift, alt, ctrl, etc.) count as an extra keystroke? E.g. &lt;code&gt;d&lt;/code&gt; is one keystroke, but &lt;code&gt;D&lt;/code&gt; is two keystrokes. If so, do consecutive modifiers count? &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Are keystrokes directly comparable to bytes? As in, if a vim answer takes 20 keystrokes, and a pyth answer is 21 bytes, does the vim answer win? Are they comparable?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2016-04-21T19:12:44.563" Title="How should vim answers be scored?" Tags="|discussion|code-golf|answers|rules|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8996" PostTypeId="2" ParentId="8995" CreationDate="2016-04-21T18:43:47.700" Score="4" Body="&lt;p&gt;Modifiers should not count as an extra keystroke. If the challenge is specifically an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/editor-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;editor-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;editor-golf&lt;/a&gt; challenge, this is different, and it should be specified either way by the OP. But vim answers to code-golf challenges should not count modifiers. Also, keystrokes should be exactly equivalent to bytes. Using this a standard has many advantages.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It's simpler. We don't have to worry about consecutively holding down modifiers. Who wants to go to all the trouble to score that? &lt;code&gt;a&lt;/code&gt; is one keystroke, &lt;code&gt;D&lt;/code&gt; is one keystroke, &lt;code&gt;&amp;lt;C-a&amp;gt;&lt;/code&gt; is one keystroke and &lt;code&gt;&amp;lt;CR&amp;gt;&lt;/code&gt; is one keystroke.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Another reason this makes sense is that vim answers can be &lt;em&gt;ran&lt;/em&gt; as a string of text with a certain byte size, e.g. with&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;vim &quot;+normal &amp;lt;keystrokes&amp;gt;&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or, as Doorknob argued &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4817/31716&quot;&gt;here&lt;/a&gt;, you could &lt;code&gt;noremap&lt;/code&gt; your &lt;em&gt;&quot;program&quot;&lt;/em&gt; to a key, and &lt;em&gt;run&lt;/em&gt; it as a program. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Internally, every keystroke corresponds to a single ascii byte. You can see this by logging vim keystrokes to a file with&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;vim -w log.txt&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This logs keystrokes, even the unprintable ones with modifiers, such as &lt;code&gt;&amp;lt;C-a&amp;gt;&lt;/code&gt; or &lt;code&gt;&amp;lt;esc&amp;gt;&lt;/code&gt; to a single byte. Since keystrokes are just bytes that are entered slightly differently, why should they count differently?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If keystrokes were scored differently than bytes, this makes things unnecessarily complicated, for no real benefit. You could trivially write an interpreter that reads a file and then sends each character to a &lt;a href=&quot;http://vimdoc.sourceforge.net/htmldoc/remote.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;remote vim-session&lt;/a&gt;. If keystrokes can simply be counted as bytes, this simplifies everything without giving vim answers an unfair advantage.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-04-21T18:43:47.700" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="8997" PostTypeId="1" AcceptedAnswerId="8998" CreationDate="2016-04-21T18:53:20.343" Score="4" ViewCount="74" Body="&lt;p&gt;Recently, I've made some major edits to &lt;a href=&quot;https://codegolf.stackexchange.com/posts/22/revisions&quot;&gt;a couple&lt;/a&gt; of &lt;a href=&quot;https://codegolf.stackexchange.com/posts/78141/revisions&quot;&gt;challenges&lt;/a&gt;, and I sort of instinctively cited the appropriate defaults here on meta, like:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Write a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2419&quot;&gt;program or function&lt;/a&gt; to &lt;strong&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447&quot;&gt;output&lt;/a&gt; the sum of unicorns less than an &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447&quot;&gt;input&lt;/a&gt; &lt;code&gt;n&lt;/code&gt;&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Need I do this &lt;em&gt;every single time&lt;/em&gt;? We've established that authors don't need to mention that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061&quot;&gt;standard loopholes&lt;/a&gt; are disallowed by default, because... they're disallowed by default, and answers that violate them are deleted, and this is a given.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Assuming a given challenge will use the stated defaults as usual, should authors &lt;em&gt;always&lt;/em&gt; have to cite them like this, using the &lt;strong&gt;magic words&lt;/strong&gt; and &lt;strong&gt;magic links&lt;/strong&gt;, or can I just say something that &lt;em&gt;implies&lt;/em&gt; this challenge uses the defaults?&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.263" LastActivityDate="2016-04-21T19:03:35.113" Title="Are Defaults for Code Golf implicit?" Tags="|support|challenge-quality|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="8998" PostTypeId="2" ParentId="8997" CreationDate="2016-04-21T19:03:35.113" Score="8" Body="&lt;p&gt;Yes, the defaults apply... by default.&lt;/p&gt;&#xA;&lt;p&gt;From the &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;code-golf tag wiki&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;If 1. and 7. are not specified, the following defaults are used:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Answers are scored in bytes.&lt;/li&gt;&#xA;&lt;li&gt;Answers may be &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2419/8478&quot;&gt;either full programs or functions (or equivalent)&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Functions do not have to be named, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1503/8478&quot;&gt;unless you require them to be named&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Both programs and functions may take input via STDIN or command-line argument or prompt. Functions may also use their function arguments for input. Both programs and functions may output by writing to STDOUT. Functions may also use their arguments or return value(s) for output. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/8478&quot;&gt;These defaults are based on community consensus.&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Mentioning them in the challenge doesn't hurt, but it isn't required.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-21T19:03:35.113" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="8999" PostTypeId="2" ParentId="8995" CreationDate="2016-04-21T19:12:44.563" Score="32" Body="&lt;p&gt;vim answers can be run from the command line as such:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$ echo 'Input' &amp;gt; file.txt&#xA;$ vim -u NONE '+normal (enter keystrokes here...)' '+wq' file.txt&#xA;$ cat file.txt  # output&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Furthermore, vim interprets &lt;kbd&gt;Ctrl&lt;/kbd&gt;+&amp;lt;letter&gt; by bytes in the lower portion of the ASCII table (with A-Z encoded as 1-26, ex. &lt;kbd&gt;Ctrl&lt;/kbd&gt;+&lt;kbd&gt;C&lt;/kbd&gt; is &lt;code&gt;\x03&lt;/code&gt;), &lt;kbd&gt;Esc&lt;/kbd&gt; as &lt;code&gt;\x1b&lt;/code&gt;, and some other &lt;kbd&gt;Ctrl&lt;/kbd&gt; combinations from &lt;code&gt;\x1c&lt;/code&gt; to &lt;code&gt;\x1f&lt;/code&gt;. &lt;kbd&gt;Alt&lt;/kbd&gt;+&amp;lt;anything&gt; is the same character with the high bit set. As such, any keystroke corresponds directly to one byte.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a proof of concept, the one-byte vim &quot;program&quot; &lt;code&gt;&amp;lt;C-a&amp;gt;&lt;/code&gt; (that is, &lt;kbd&gt;Ctrl&lt;/kbd&gt;+&lt;kbd&gt;A&lt;/kbd&gt;) takes input as a single number &lt;em&gt;n&lt;/em&gt; and outputs &lt;em&gt;n+1&lt;/em&gt;, and it can be run like so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;llama@llama:~$ echo 10 &amp;gt; file.txt   &#xA;llama@llama:~$ vim -u NONE $'+normal \x01' '+wq' file.txt&#xA;llama@llama:~$ cat file.txt&#xA;11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that the actual program is &lt;code&gt;\x01&lt;/code&gt;, which is a single byte. This is a &lt;strong&gt;definitive mapping of keystrokes ⇔ bytes&lt;/strong&gt; (in fact, when &quot;running&quot; a vim program via the command line, they &lt;em&gt;are&lt;/em&gt; bytes); therefore, vim answers can be scored the same as any other answer.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2016-04-21T19:12:44.563" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9005" PostTypeId="2" ParentId="8990" CreationDate="2016-04-22T16:02:27.783" Score="-4" Body="&lt;p&gt;I think you should try.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yes, it seems like ontopic and how good is it can determine only the challenge itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sandbox is useless as noone tried anything like that, so they can't help with possible problems and their solutions. The only moment is about conforming to standard. Let's replace it by it should be correctly displayed in Adobe Reader on windows or in [most popular viewer name here] on linux.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;What's wrong with the sandbox in this situation?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;How sandbox helps to improve the question? People are using their experience to predict and solve problems and potential holes of the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But what if there is a new type of challenge? Do the have any experience in it? No. Can they find a loopholes? Maybe they can think about it, but they wouldn't check. Now here are ideas about deflate, but will it really help to win? It's just assumptions - noone is going to chek.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So the right way is simply post the chellenge without trying to limit loopholes. Even if somebody will find and use them - it's not bad for the first time. And we'll get knowlege to disallow such ways in further challenges. Or we just see that noone is actually interested in such kind of golfing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That's the only way that can show us real problems not imaginary ones.&lt;/p&gt;&#xA;" OwnerUserId="32091" LastEditorUserId="32091" LastEditDate="2016-04-22T18:23:33.047" LastActivityDate="2016-04-22T18:23:33.047" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9006" PostTypeId="2" ParentId="8990" CreationDate="2016-04-22T16:54:45.963" Score="5" Body="&lt;p&gt;I think that such a question would be on topic, but would not be a good question for two reasons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Firstly, as I commented, since the content of a PDF file can largely be DEFLATE-compressed, the battle for the last few bytes' saving would be a question of who has most CPU power to throw at kzip, zopfli, or whichever other nondeterministic extreme zip tool. This could be worked around by asking for PostScript instead of PDF.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, that brings me to the second point. This is a single-language challenge, which are discouraged. If you want to promote golfing in printer languages, a better way would be to answer existing questions in those languages and optionally also to offer open bounties for answers which beat them.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2016-04-22T16:54:45.963" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9007" PostTypeId="2" ParentId="202" CreationDate="2016-04-22T19:20:02.240" Score="0" Body="&lt;h2&gt;Pyke&lt;/h2&gt;&#xA;&lt;p&gt;Online: &lt;a href=&quot;http://pyke.catbus.co.uk&quot; rel=&quot;nofollow noreferrer&quot;&gt;pyke.catbus.co.uk&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="32686" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-22T19:20:02.240" CommentCount="0" CommunityOwnedDate="2016-04-22T19:20:02.240" ContentLicense="CC BY-SA 3.0" />
  <row Id="9008" PostTypeId="1" AcceptedAnswerId="9010" CreationDate="2016-04-23T01:37:00.867" Score="0" ViewCount="62" Body="&lt;p&gt;If you go &lt;a href=&quot;https://codegolf.stackexchange.com/tags?page=6&amp;amp;tab=popular&quot;&gt;here&lt;/a&gt; and scroll to the bottom, you'll find this tag: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/braces&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;braces&amp;#39;&quot; rel=&quot;tag&quot;&gt;braces&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This tag is a synonym of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/balanced-string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;balanced-string&amp;#39;&quot; rel=&quot;tag&quot;&gt;balanced-string&lt;/a&gt;, and rightfully so, as is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brackets&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brackets&amp;#39;&quot; rel=&quot;tag&quot;&gt;brackets&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can't seem to figure out how to see questions tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/braces&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;braces&amp;#39;&quot; rel=&quot;tag&quot;&gt;braces&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brackets&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brackets&amp;#39;&quot; rel=&quot;tag&quot;&gt;brackets&lt;/a&gt;, though. (That is, assuming there are any, which the link above certainly seems to say there are questions with these tags).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I just finished obliterating &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/shortest-time&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;shortest-time&amp;#39;&quot; rel=&quot;tag&quot;&gt;shortest-time&lt;/a&gt; by retagging questions tagged with that tag to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, of which &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/shortest-time&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;shortest-time&amp;#39;&quot; rel=&quot;tag&quot;&gt;shortest-time&lt;/a&gt; is (was) a synonym. I found these questions by going &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot;&gt;here&lt;/a&gt;, and then pressing &lt;kbd&gt;CTRL-F&lt;/kbd&gt; and typing &lt;code&gt;shortest-time&lt;/code&gt;. This strategy doesn't seem to work for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/braces&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;braces&amp;#39;&quot; rel=&quot;tag&quot;&gt;braces&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brackets&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brackets&amp;#39;&quot; rel=&quot;tag&quot;&gt;brackets&lt;/a&gt;, though, whose questions should obviously have &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/balanced-string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;balanced-string&amp;#39;&quot; rel=&quot;tag&quot;&gt;balanced-string&lt;/a&gt; instead.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How can I see questions tagged with the &lt;em&gt;actual tag&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/braces&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;braces&amp;#39;&quot; rel=&quot;tag&quot;&gt;braces&lt;/a&gt;, and not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/balanced-string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;balanced-string&amp;#39;&quot; rel=&quot;tag&quot;&gt;balanced-string&lt;/a&gt; of which &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/braces&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;braces&amp;#39;&quot; rel=&quot;tag&quot;&gt;braces&lt;/a&gt; is a synonym?&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-04-23T11:54:11.110" Title="Seeing questions that actually have this tag" Tags="|support|tags|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9010" PostTypeId="2" ParentId="9008" CreationDate="2016-04-23T11:47:43.723" Score="1" Body="&lt;h3&gt;How to find challenges with tags which are now synonymised?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You've probably noticed that you can't just search for a synonym, e.g. &lt;code&gt;[time]&lt;/code&gt; (which is a synonym of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt;, but still has some questions tagged with it. It is possible to find challenges which are tagged with synonyms of a certain parent, but not the parent itself with the following search query:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[date] -[date]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date+-date&quot;&gt;Test it here.&lt;/a&gt; Note that this turns up only three challenges with the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/time&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;time&amp;#39;&quot; rel=&quot;tag&quot;&gt;time&lt;/a&gt; tag although four exist. I'm assuming the fourth one has both &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/time&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;time&amp;#39;&quot; rel=&quot;tag&quot;&gt;time&lt;/a&gt;, so it won't be found by this query. I don't know of a good way to find these using the search.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;How does synonym renaming work?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;When a synonym is created, old challenges won't be retagged automatically. That's why challenges with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/time&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;time&amp;#39;&quot; rel=&quot;tag&quot;&gt;time&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/calendar&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;calendar&amp;#39;&quot; rel=&quot;tag&quot;&gt;calendar&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/shortest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;shortest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;shortest-code&lt;/a&gt; still exist. However, once the synonym is created, any attempt to use the tag will automatically be renamed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the case of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/braces&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;braces&amp;#39;&quot; rel=&quot;tag&quot;&gt;braces&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brackets&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brackets&amp;#39;&quot; rel=&quot;tag&quot;&gt;brackets&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parentheses&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parentheses&amp;#39;&quot; rel=&quot;tag&quot;&gt;parentheses&lt;/a&gt;, I added these pre-emptively, so no challenges ever used them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can see whether any challenges still have a synonym, &lt;a href=&quot;https://codegolf.stackexchange.com/tags/synonyms&quot;&gt;you can visit the synonyms page&lt;/a&gt; (no privileges required), which shows how often a tag is still use.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Cleaning up synonyms&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;As for your actual goal of cleaning up all the uses of the old tag, that's honourable, but I don't think it's necessary. The old tag works like the new tag for all intents and purposes. Searching for either brings up all challenges with both tags. There is no separate tag page for the old tag any more. Using the old tag automatically turns into a new tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, there's also no good reason to keep the old tag around. But for getting rid of it, there's a much better solution than painstakingly trying to find all the challenges that still use it and then retag them one by one: moderators can merge tags. Even quite conveniently straight from the tag synonyms list. Not only is that a lot less effort, it also doesn't create a revision in the affected challenges and doesn't bump all of them to the front page. So if you think some old synonym should be cleaned up, just let a moderator know in chat or post a request here on meta.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://meta.stackexchange.com/a/70718/201409&quot;&gt;Further reading on Meta.SE&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-04-23T11:54:11.110" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9011" PostTypeId="2" ParentId="8966" CreationDate="2016-04-23T12:20:51.247" Score="1" Body="&lt;p&gt;OK thanks for the input all, I think the answer here  is that questions based on Box256 can be asked, I have asked one and  it has sort-of-worked:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/77795/box-256-assembly-big-square-ii&quot;&gt;Box-256 Assembly - BIG SQUARE II&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However there have been issues on how to score the answers so I am going to start another Meta question to come up with a fair and easily understandable scoring system.&lt;/p&gt;&#xA;" OwnerUserId="6558" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-04-23T12:20:51.247" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9012" PostTypeId="1" AcceptedAnswerId="9015" CreationDate="2016-04-23T13:06:02.513" Score="2" ViewCount="355" Body="&lt;p&gt;Since asking what I believe is the first Box-256 based question on Code Golf (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/77795/box-256-assembly-big-square-ii&quot;&gt;Box-256 Assembly - BIG SQUARE II&lt;/a&gt;) there has been some confusion with regards to scoring.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd like this question to be a place where people can put forward scoring ideas so we can choose one that suites best Box256 challenges. I'd like to post up one code golf question for each of the built initial Box256 levels so we need a scoring systems that suites them.&lt;/p&gt;&#xA;" OwnerUserId="6558" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-04-24T14:26:25.770" Title="How to score Box-256 answers" Tags="|discussion|scoring|" AnswerCount="5" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9013" PostTypeId="2" ParentId="9012" CreationDate="2016-04-23T13:45:24.247" Score="-1" Body="&lt;h1&gt;Number of characters/bytes in the program&lt;/h1&gt;&#xA;&lt;p&gt;&lt;code&gt;MOV A B C&lt;/code&gt; is 9 bytes.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;MOV A B C&#xA;PIX A B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;is 17 bytes.&lt;/p&gt;&#xA;&lt;p&gt;This is fairly normal for most languages.&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-23T13:45:24.247" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9014" PostTypeId="2" ParentId="9012" CreationDate="2016-04-23T13:47:06.537" Score="-2" Body="&lt;h1&gt;Number of bytes in the instructions and arguments&lt;/h1&gt;&#xA;&lt;p&gt;The length of the program, minus spaces and padding.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;MOV A B C&lt;/code&gt; is 6 bytes.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;MOV A B C&#xA;PIX A B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;is 12 or 11 bytes, depending if you count the newline.&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-23T13:47:06.537" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9015" PostTypeId="2" ParentId="9012" CreationDate="2016-04-23T14:09:29.063" Score="4" Body="&lt;h2&gt;Position of the last non-zero byte in the original program&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Of course, trailing zeros can't be counted, otherwise all programs would be the same size. But empty lines within the program should be counted, because how wide the spacing between certain cells is is actually relevant information that needs to be encoded.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hence, we simply count how many cells there are until the last non-zero cell, treating all four bytes in a nibble equally. Note that cells 2 to 4 in each nibble can contain &lt;code&gt;*&lt;/code&gt; and &lt;code&gt;@&lt;/code&gt; modifiers beyond the byte their actually storing. However, Box-256 encodes this information into the first byte in addition to the OP code on that line, hence we don't need to count these separately. The &lt;code&gt;-&lt;/code&gt; on the other hand is just syntactic sugar for 2's complement, i.e. &lt;code&gt;-01&lt;/code&gt; is completely equivalent to &lt;code&gt;FF&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we take the example solution for the first problem (and modify it slightly, which breaks it, but this is just an example):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;MOV 022 @80 000&#xA;MOV 030 @C0 000&#xA;PIX @80 001 000&#xA;ADD @80 *C0 @80&#xA;ADD @81 001 @81&#xA;JGR 00B @81 -0C&#xA;MOV 000 @81 000&#xA;ADD @C0 001 @C0&#xA;JMP @08 000 000&#xA;000 000 000 000&#xA;000 000 000 000&#xA;000 000 000 000&#xA;-01 -10 000 000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;That would be &lt;strong&gt;50 bytes&lt;/strong&gt; of code (up to the &lt;code&gt;-10&lt;/code&gt;).&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2016-04-24T10:00:53.167" LastActivityDate="2016-04-24T10:00:53.167" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9016" PostTypeId="1" CreationDate="2016-04-23T16:44:14.937" Score="7" ViewCount="138" Body="&lt;p&gt;Some challenges are provided with some kind of framework in which the submissions should be ran in, e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenges. I wrote the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/51029/asymmetrical-koth-catch-the-cat-cat-thread?answertab=active#tab-top&quot;&gt;&lt;em&gt;catch the cat&lt;/em&gt;&lt;/a&gt; challenge, which needs several files for the controller. These are currently stored as a gist. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Recently I wanted to delete my github account but noticed that the whole controller code is still on this challenge. As far as I understand the philisophy of Stack Exchange is that Questions and Answers should not rely on external sources but should rather be fully self contained, such that those Q/A's are still available when the corresponding users aren't active anymore. That leads me to the thinking that outside sources that are personally managed (that can be deleted any time) are &lt;em&gt;not&lt;/em&gt; appropriate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This leads to my question: &lt;strong&gt;How should this kind of &lt;em&gt;framework code&lt;/em&gt; be stored in order to be preserved for the future?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is there some kind of file upload for files other than images available?&lt;/li&gt;&#xA;&lt;li&gt;Should the whole source code be pasted into the question? (possibly cluttering the whole question with code nobody wants to read / or abusing JS+HTML snippets for hiding the code?)&lt;/li&gt;&#xA;&lt;li&gt;Are external sources like Pastebin/file sharing sites/Github/ acceptable?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-04-25T20:01:19.890" Title="Where to store framework code for challenges?" Tags="|discussion|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9017" PostTypeId="2" ParentId="9012" CreationDate="2016-04-23T18:08:05.713" Score="1" Body="&lt;h1&gt;Lines of Code as counted by BOX-256&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;BOX-256 automatically counts the lines of code. Why not score by the built in count? Lines containing instructions or non-zero data are counted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example the following counts as 2 lines of code:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;    PIX @0C @0D&#xA;    000 000 000 000&#xA;    000 000 000 000&#xA;    088 008 000 000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It's important to include data lines in the count otherwise the optimal solution to every BOX-256 problem is same tiny loop with different data.&lt;/p&gt;&#xA;" OwnerUserId="53037" LastEditorUserId="53037" LastEditDate="2016-04-23T18:18:58.287" LastActivityDate="2016-04-23T18:18:58.287" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9018" PostTypeId="2" ParentId="9016" CreationDate="2016-04-23T18:13:08.020" Score="2" Body="&lt;h1&gt;(experimental suggestion) as Zip file base64 encoded in a snippet&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I know this is not ideal either, but I just worked out that you can base64-encode a zip file, and use a link tag to store the encoded string and provide a download via JS-HTML snippet:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Show snippet&lt;/li&gt;&#xA;&lt;li&gt;Run code snippet&lt;/li&gt;&#xA;&lt;li&gt;Click the link&lt;/li&gt;&#xA;&lt;li&gt;If this does not work, try right click -&gt; save as&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;a href=&quot;data:application/octet-stream;charset=utf-8;base64,[encoded data, 12288 characters]&quot; download=&quot;src.zip&quot;&amp;gt;&#xD;&#xA;download controller (if it does not work, try right click, save as,...)&amp;lt;/a&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2016-04-23T18:19:12.003" LastActivityDate="2016-04-23T18:19:12.003" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9019" PostTypeId="2" ParentId="9016" CreationDate="2016-04-24T05:27:12.277" Score="0" Body="&lt;h2&gt;Provide the compressed code&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Compress your code (LZMA, bzip2, or something else)&lt;/li&gt;&#xA;&lt;li&gt;Post the compressed output (encoded in hexadecimal or base64)&lt;/li&gt;&#xA;&lt;li&gt;Optionally, provide a program in a common language (such as Java or Python) that acts as a wrapper for the decompression.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-24T05:27:12.277" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9020" PostTypeId="2" ParentId="9012" CreationDate="2016-04-24T14:26:25.770" Score="-1" Body="&lt;h1&gt;Number of non-zero bytes in the initial state.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We ignore the assembly instructions, and only look at the state. We count the number of non-zero bytes in this initial state.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the example below, there are 15 non-zero bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/poKiV.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/poKiV.png&quot; alt=&quot;illustration of initial state&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="4162" LastActivityDate="2016-04-24T14:26:25.770" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9021" PostTypeId="2" ParentId="2140" CreationDate="2016-04-24T19:47:29.537" Score="3" Body="&lt;h1&gt;Replace magic numbers&lt;/h1&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-gold&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-gold&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-gold&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Magic_number_%28programming%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;Magic numbers&lt;/a&gt; are a common problem in software development, since they tend to make software hard to maintain. Best practise is to use named constants instead of raw numbers in the source code. In this challenge you have to clean up some code that makes extensive use of magic numbers.&lt;/p&gt;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Given a piece of code, replace every number that is not &lt;code&gt;0&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt; or &lt;code&gt;2&lt;/code&gt; with named constants. If you encounter a number that you already created a constant for, use the existing constant instead of adding another one. The replacement is done by replacing the number with an uppercase letter &lt;code&gt;[A-Z]&lt;/code&gt; and prepending an assignment in the form of &lt;code&gt;A=5&lt;/code&gt; to the initial input.&lt;/p&gt;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&lt;pre&gt;&#xA;x=input()&#xA;if x == 2:&#xA;    print 42&#xA;elif x == 1337:&#xA;    print 666&#xA;print 42&#xA;&lt;/pre&gt;&#xA;&lt;p&gt;becomes&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;C=666&#xA;B=1337&#xA;A=42&#xA;x=input()&#xA;if x == 2:&#xA;    print A&#xA;elif x == B:&#xA;    print C&#xA;print A&#xA;&lt;/pre&gt;&#xA;&lt;h1&gt;Notes&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The order of the assinments that get prepended to the input does not matter.&lt;/li&gt;&#xA;&lt;li&gt;The order of replacements does not matter as well. You don't have to replace the first magic number with an &lt;code&gt;A&lt;/code&gt; for example.&lt;/li&gt;&#xA;&lt;li&gt;You may take the input as a list of strings instead of a multiline string.&lt;/li&gt;&#xA;&lt;li&gt;You will never have to use more than 26 constants.&lt;/li&gt;&#xA;&lt;li&gt;A number that has to be replaced matches the regex &lt;code&gt;[0-9]{2,}|[3-9]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Function or full program allowed.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;Default rules&lt;/a&gt; for input/output.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; apply.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so lowest byte-count wins. Tiebreaker is earlier submission.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Happy Coding!&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="49110" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-25T10:40:30.867" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9022" PostTypeId="1" CreationDate="2016-04-24T20:26:06.793" Score="30" ViewCount="887" Body="&lt;p&gt;The barrier for entry for new users to write challenges is too high. I think there's a problem with how we are closing challenges. There are only two reasons we can close a challenge as &quot;off-topic&quot;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;This site is for programming contests and challenges. General programming questions are off-topic here. You may be able to get help on Stack Overflow.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Questions without an objective primary winning criterion are off-topic, as they make it impossible to indisputably decide which entry should win.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;However, there are many, &lt;em&gt;many&lt;/em&gt; reasons that a challenge can be considered &quot;off-topic&quot; by the community's standards. Your challenge is off-topic by community consensus if:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It's &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8326/31716&quot;&gt;underhanded&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It's from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/16/what-are-the-policies-for-threads-relating-to-facebook-puzzles-project-euler-u?lq=1&quot;&gt;another site&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It's a popularity contest. In theory, these are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8244/31716&quot;&gt;not off-topic&lt;/a&gt;, but in practice, nearly every new popcon is closed. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot;&gt;Nine out of our last twelve popcons&lt;/a&gt; are closed.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It's about &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4829/should-asking-for-malicious-code-be-on-topic&quot;&gt;malicious code&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It's about &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8463/should-multi-part-challenges-be-allowed/8464#8464&quot;&gt;multiple unrelated tasks&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;None of this is mentioned in our &lt;a href=&quot;https://codegolf.stackexchange.com/help/dont-ask&quot;&gt;help-center&lt;/a&gt;. We should do our best to make sure that any user that goes to the trouble of reading through some or all of our help-center (which most new users won't) has a &lt;em&gt;perfectly-clear&lt;/em&gt; expectation of what kind of challenges we want. How is a brand new user that doesn't participate in meta supposed to know that &quot;Do X without Y&quot; challenges are frowned upon? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;And beyond being off-topic by community consensus, there are many perfectly valid challenges (Note: not &lt;em&gt;good&lt;/em&gt; challenges, but &lt;em&gt;valid&lt;/em&gt; challenges) that are closed as &quot;off-topic&quot; because some people dislike them. I don't like that. That's what a downvote is for, but &lt;a href=&quot;https://gaming.meta.stackexchange.com/questions/5498/a-close-vote-is-not-a-super-downvote-please-dont-use-it-as-one&quot;&gt;close votes are &lt;em&gt;not&lt;/em&gt; super-downvotes!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, look at &lt;a href=&quot;https://codegolf.stackexchange.com/q/77609/31716&quot;&gt;Convert phrases to reverse style [closed]&lt;/a&gt;. It was a simple challenge with a &lt;em&gt;very&lt;/em&gt; clear spec, that was closed as &quot;Unclear what you're asking&quot;. Personally, I see nothing unclear with the challenge whatsoever. It describes inputs and outputs in a simple manner, provides specifications, &lt;strong&gt;and&lt;/strong&gt; includes test cases. That right there is better than most off-topic challenges we get.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now sure, it's a little bit on the trivial side, but questions cannot be closed for being trivial. (See: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world&quot;&gt;Hello world&lt;/a&gt;) Dislike trivial challenges? Great I do too! Downvote. You were given downvotes as a means to say &quot;This challenge is not useful&quot;, so make your voice heard! Lots of people were also complaining that the challenge is mocking the French Language, and were understandably annoyed. Dislike rude comparisons to a language? Great I do too! Downvote. That's exactly what downvotes were made for. Or even better, edit it out! (Which someone already did) However, as far as I can tell, we don't have a rule stating:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Rude comparisons to a language are off-topic by community consensus.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So until then, nothing in that challenge is worthy of a close vote.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Okay, enough ranting. I don't know what the solution is. I don't think we want to be a clique where the only users who are already active on meta know the rules for how to make a good challenge. We aren't that yet, but I feel like we're moving towards it. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;How can we lower the barrier to entry for new users to write on-topic questions? Do we need to update the help center? Do we need more custom close reasons? Is it even feasible to have a close reason for everyone of our close reasons?&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="73111" LastEditDate="2019-09-18T11:02:30.400" LastActivityDate="2019-09-18T11:02:30.400" Title="Unspoken challenge rules" Tags="|discussion|scope|new-users|" AnswerCount="2" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="9023" PostTypeId="2" ParentId="9022" CreationDate="2016-04-24T21:36:51.460" Score="16" Body="&lt;h2&gt;We need an honest intro for new askers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We need a frank explanation of what makes a good challenge. Not something that lists all rules and possibilities, but advice like you'd give a friend who is new to the site and posting a challenge for the first time. It might say things like &quot;Post in the Sandbox first&quot; and &quot;Challenges like X are allowed, but you'll probably get downvoted into the ground.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The help center is too legalistic to be useful. It tries to summarize meta policy to delineate on-topicness, but doesn't explain our site's philosophy. Good challenges come not from following these rules, but from understanding the community's culture and customs that motivates them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't think this can come close to replacing being active on the site to get experience before posting a challenge, but it would help.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2016-04-24T21:36:51.460" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9024" PostTypeId="2" ParentId="9016" CreationDate="2016-04-24T22:16:30.053" Score="8" Body="&lt;p&gt;This one requires a little more setup and some time dedication by someone, but it could easily be managed by the mods -- it'd be at the very most a few minutes a day, probably less, given the relative lack of KOTH questions.&lt;/p&gt;&#xA;&lt;h2&gt;Send it to a community GitHub repo (managed by a group)&lt;/h2&gt;&#xA;&lt;p&gt;Depending on where you have the files, you could either &lt;a href=&quot;https://help.github.com/articles/transferring-a-repository/&quot; rel=&quot;nofollow noreferrer&quot;&gt;transfer ownership&lt;/a&gt; or make a pull request adding the files. It would only be the final, bugtested version; this isn't a development repo, just a warehouse for code you don't want to maintain anymore.&lt;/p&gt;&#xA;&lt;p&gt;I'd recommend that, if this happens, we put a notice on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; saying that controller code can and should be uploaded to the repo when it's completely finished. That way, anyone can look at the code and try it out, or at least see how it works to verify that there aren't any bugs.&lt;/p&gt;&#xA;&lt;p&gt;The group would consist of either just mods, a certain selection of mods and high-rep users, or something else. It would be charged with making sure no spam edits or files get into the repo.&lt;/p&gt;&#xA;" OwnerUserId="31541" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-25T20:01:19.890" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9025" PostTypeId="2" ParentId="2140" CreationDate="2016-04-25T03:23:11.137" Score="-3" Body="&lt;h1&gt;Why did I come to Sandbox?&lt;/h1&gt;&#xA;&lt;p&gt;I have a very specific challenge, and I wanted to see if it was too specific.&lt;/p&gt;&#xA;&lt;p&gt;The challenge is to output &amp;quot;Valdosta ACM&amp;quot; using the shortest number of characters with the BrainF**k programming language.&lt;/p&gt;&#xA;&lt;p&gt;I've noticed it isn't the norm to specify a programming language on this domain, so I've come here to get feedback on whether or not this is acceptable.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;As a challenge to the members of my local Association for Computing Machinery(ACM) chapter, I asked them to produce the shortest &lt;a href=&quot;https://en.wikipedia.org/wiki/Brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brainf**k&lt;/a&gt; code that would output &amp;quot;Valdosta ACM&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;This was a very fun challenge for all of our members, and we got very competitive! I was impressed with the solutions turned in, but I wondered if it was possible to beat our best solution. Surely it's possible, but who could do it?&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Output the string &amp;quot;Valdosta ACM&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;Stipulations:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Use only the Brainf**k programming language (you can test your code &lt;a href=&quot;https://sange.fi/esoteric/brainfuck/impl/interp/i.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No input can be accepted by your program&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program must halt&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The space in the string must be ASCII character #032.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;These are the ASCII values of each character, as they appear in the string, for convenience:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 086 097 108 100 111 115 116 097 032 065 067 077&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The winner is determined by the shortest code, by character count.&lt;/p&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;h3&gt;Input:&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;NO&lt;/strong&gt; input is allowed&lt;/p&gt;&#xA;&lt;h3&gt;Output:&lt;/h3&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Valdosta ACM&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="52369" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-25T03:23:11.137" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9026" PostTypeId="2" ParentId="9022" CreationDate="2016-04-25T09:23:09.800" Score="8" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;We should do our best to make sure that any user that goes to the trouble of reading through some or all of our help-center (which most new users won't) has a perfectly-clear expectation of what kind of challenges we want. How is a brand new user that doesn't participate in meta supposed to know that &quot;Do X without Y&quot; challenges are frowned upon?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I understand where you're coming from, but I think the pragmatic solution is to do what the help centre already does: point people at the sandbox. Editing the help centre every time a new opinion on meta gains critical mass would cause more problems than it solves. It should be stable, maybe updated once every year, but not much more frequently.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2016-04-25T09:23:09.800" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9027" PostTypeId="1" CreationDate="2016-04-25T12:24:31.317" Score="8" ViewCount="204" Body="&lt;p&gt;This meta-question is inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/78448/count-up-folks?noredirect=1#comment191804_78448&quot;&gt;this challenge&lt;/a&gt;, which basically asks to count from 1 to N. However this is a question that bothers me in a lot of challenges which have those “iterative”/“print all X such that” kind of outputs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So keeping as an example this challenge of counting from 1 to N, a possible solution in Prolog is to write a predicate which will unify a variable with an integer. Then, Prolog's backtracking mechanism makes it so that we can ask all possible values that make this predicate true.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance in this example, I could write a predicate &lt;code&gt;a(N,I)&lt;/code&gt;which unifies &lt;code&gt;I&lt;/code&gt; with an integer between 1 and &lt;code&gt;N&lt;/code&gt;. Calling it would give this result:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;?- a(5,I).&#xA;I = 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;However now instead of terminating, Prolog's REPL halts: if I type &lt;code&gt;;&lt;/code&gt; (logical or), it will give me a second answer:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;I = 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I can keep doing this until it finds no more solution:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;I = 3 ;&#xA;I = 4 ;&#xA;I = 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And now it has terminated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this a fair way of returning/printing outputs? Note that it is possible to fill a list with all those unifications and return that list using &lt;code&gt;findall&lt;/code&gt;, but this is obviously longer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;This question also applies for languages that work on Prolog (e.g. Brachylog) or that have a similar mechanism in their REPL (e.g. ?)&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-05-08T20:30:23.057" Title="Is Prolog's REPL unification mechanism allowed for multiple outputs?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9028" PostTypeId="2" ParentId="7205" CreationDate="2016-04-25T21:05:49.000" Score="7" Body="&lt;p&gt;Since feersum edited his answer and the edit conflicts with the common interpretation of the text (which is how we've been doing things since that answer was posted), I'll repost the text of his answer prior to the edit so that we still have an answer here reflecting that practice.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Code that purports to define a function should only be accepted if it actually causes the function to be defined. That is, the function should not be defined before/without that code running.&lt;/p&gt;&#xA;&lt;p&gt;Accordingly, the empty string is not a valid function answer. &lt;code&gt;s=sum&lt;/code&gt; is valid because it defines a function &lt;code&gt;s&lt;/code&gt; that did not exist before. &lt;code&gt;sum&lt;/code&gt; and &lt;code&gt;lambda L:sum(L)&lt;/code&gt; are valid because expressions that evaluate to a function are an accepted answer form. &lt;code&gt;*&lt;/code&gt; is not a valid answer in Python because it is neither an expression nor any other kind of executable code.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;It &lt;em&gt;is&lt;/em&gt; acceptable to post a defined function along with an import, such as the pseudocode &lt;code&gt;import math; sum&lt;/code&gt;. (This is what was declined by the edit.)&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-25T21:05:49.000" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9029" PostTypeId="2" ParentId="2140" CreationDate="2016-04-26T00:17:14.120" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Chopsticks_(hand_game)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Chopsticks&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Overview (basically the wiki page)&lt;/h1&gt;&#xA;&lt;p&gt;Chopsticks is a game played with two hands and two people. Both start with one finger out on each hand, the finger count. On a player's turn, they must choose one of their opponent's hands. That opponent adds the player's finger count to the one on that hand (and extends that many fingers). Once a hand's finger count has reached five or more, that hand's finger count is reduced to 0 and can't be used. Once both hands are out, the opponent wins.&lt;/p&gt;&#xA;&lt;p&gt;To make the game more interesting, there is a mechanic called splitting: A player may use his turn to divide both his hand counts &lt;strong&gt;differently&lt;/strong&gt; than he/she already has. A valid move would be to split from a 2 and a 3 to a 4 and a 1. An invalid move would be to split from a 2 and a 3 to a 3 and a 2. It is illegal to bring a hand back to life like a bunch of my friends like to do, as in split from a 4 and a 0 (a hand that is out) to a 2 and a 2 (back in). I deem it legal (since the Wikipedia article didn't say anything about it) to get one of your hands out using splitting, such as going from 3 and 4 to 2 and 5 (out).&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to write a bot that will play chopsticks against another bot.&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;Every time your bot takes a turn, it will be given its opponent's finger count and its own finger count in this format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[opponent hand 1] [opponent hand 2] [own hand 1] [own hand 2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;There will be spaces in between each value as shown above. Each value will be an integer. The bot should remember the hand numbers, as it is important to the output.&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;Your bot must take the data, decide what to do with it, and respond accordingly. Output is in this form:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[target hand] [attacking hand]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;where &lt;code&gt;[target]&lt;/code&gt; refers to the target opponent's hand and &lt;code&gt;[hand]&lt;/code&gt; refers to the hand you are hitting the target with. A valid output would be &lt;code&gt;1, 2&lt;/code&gt;, which says that the bot wants to hit the opponent's first hand with its own second hand.&lt;/p&gt;&#xA;&lt;h1&gt;Problems and todo (sandbox)&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I do not yet know how to make a program that handles all of this. I'll try to work on it.&lt;/li&gt;&#xA;&lt;li&gt;There will be a bracket.&lt;/li&gt;&#xA;&lt;li&gt;Should I make tweaks to the game to make it more suitable?&lt;/li&gt;&#xA;&lt;li&gt;I may or may not follow through, but regardless I would like feedback.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Thanks.&lt;/p&gt;&#xA;" OwnerUserId="42768" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-26T00:17:14.120" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9031" PostTypeId="1" CreationDate="2016-04-26T09:03:26.267" Score="13" ViewCount="1558" Body="&lt;p&gt;For many code golf questions, we allow functions as answers. What exactly does it mean for some code to be a valid submission as a function?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This question came up during &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7205/on-scoring-builtin-functions&quot;&gt;a discussion on built-ins&lt;/a&gt;, but is a separate discussion from that one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some examples in Python, where I'm not sure which should be allowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Cases that seem clearly allowed:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Defining a wholly new function, where defining means giving the function a name by which it can be later called:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;limit = 10&#xA;def func(a):&#xA;    for i in range(limit):&#xA;        if a[i % len(a)]:&#xA;            return i&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;An expression which evaluates to a function:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;lambda a:a.count(a[0])/len(a)&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Cases that seem like they shouldn't be allowed:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Causing a function to exist and be usable, but without interacting with it directly:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import math&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This causes the function &lt;code&gt;math.gcd&lt;/code&gt; to exist, without directly interacting with it. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This case is particularly problematic, because a golfing language could be defined to cause literally every possible function to become defined when given a 1 (or 0) character command, which defeats the purpose.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Causing a very large number of functions to be defined, where the function in question is one of them:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;for index, code in enumerate(all_possible_strings):&#xA;    eval(&quot;func&quot; + str(index) + &quot;=&quot; + code)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Assume that all_possible_strings is a generator which yields all possible strings. Somewhere in that sequence, the string &lt;code&gt;lambda a:a.count(a[0])/len(a)&lt;/code&gt; must have occurred, so the function &lt;code&gt;func&amp;lt;very large number&amp;gt;&lt;/code&gt; is now defined as that function. This also seems problematic and like a loophole.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Cases I'm not sure about/what the consensus is:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Submissions that contain an expression that evaluates to the desired function, as well as other code:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = [1]&#xA;for i in range(50):&#xA;     A.append(sum(A) * i)&#xA;A.count&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Supposing &lt;code&gt;A.count&lt;/code&gt; solved the challenge, would this be valid?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Given these cases, what should our standard of a valid function submission be?&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2017-11-04T17:14:42.220" Title="Unnamed Functions in Code Golf" Tags="|discussion|code-golf|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9032" PostTypeId="2" ParentId="9031" CreationDate="2016-04-26T09:51:11.447" Score="18" Body="&lt;p&gt;Here's what I (and the majority of the community) have been going by, which I think works well:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Named functions/lambdas are acceptable (&lt;code&gt;def foo(n): n+1&lt;/code&gt;, &lt;code&gt;foo = lambda n: n+1&lt;/code&gt;, &lt;code&gt;int foo(int n) { return n+1; }&lt;/code&gt;, &lt;code&gt;auto foo = [](int n){ return n+1; }&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Unnamed functions/lambdas are acceptable (&lt;code&gt;lambda n: n+1&lt;/code&gt;, &lt;code&gt;[](int n){ return n+1; }&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Any expression which evaluates to a (named or unnamed) function is acceptable (&lt;code&gt;pow&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Additional &quot;helper&quot; functions may be defined in addition to the primary solution function (&lt;code&gt;f=lambda x:abs(x);lambda n:f(n)+n&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Any imports/includes/requires/whatever may be imported/included/required/whatever outside of the function (&lt;code&gt;import math;math.gcd&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In general, &lt;em&gt;so long as the code defines at least one function, named or unnamed, and the solution function performs consistently regardless of how many times it has been called previously, the submission is acceptable&lt;/em&gt;. The only exception is import-only submissions - though they bring functions into the global scope, they neither define new functions nor evaluate to a function that can be captured and/or called. Thus, &lt;code&gt;from math import*&lt;/code&gt; is not valid, but &lt;code&gt;from math import*;gcd&lt;/code&gt; is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(note: that wording seems less than ideal, but I can't think of a way to improve it right now)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for the code that generates all possible functions, that would be technically valid by these rules, but should be added as a standard loophole.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2016-04-27T02:58:42.000" LastActivityDate="2016-04-27T02:58:42.000" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9034" PostTypeId="2" ParentId="1061" CreationDate="2016-04-26T20:13:16.230" Score="53" Body="&lt;h2&gt;Generating all possible functions/programs to solve a challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9031/unnamed-functions-in-code-golf&quot;&gt;this meta post&lt;/a&gt;, isaacg pointed out that, under current consensus, the following Python code (edited to fix a mistake) could possibly be viewed as valid:&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;for i, code in enumerate(all_possible_strings):&#xA;    try: exec(&quot;func&quot; + str(i) + &quot;=&quot; + code)&#xA;    except: pass&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Given enough time, the desired function will eventually be generated and assigned to &lt;code&gt;func&amp;lt;some large number&amp;gt;&lt;/code&gt;, which could then be called with the desired arguments and would return the desired result.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Though we do not forbid brute-forcing, solutions of this sort are clearly exploitative in the same vein as MetaGolfScript, and we certainly do not want this solution on every challenge where functions are allowed.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-04-26T20:24:16.783" CommentCount="15" CommunityOwnedDate="2016-04-26T20:13:16.230" ContentLicense="CC BY-SA 3.0" />
  <row Id="9037" PostTypeId="1" CreationDate="2016-04-26T20:44:13.257" Score="4" ViewCount="151" Body="&lt;p&gt;I recently &lt;a href=&quot;https://codegolf.stackexchange.com/a/78646/44713&quot;&gt;answered in Excel&lt;/a&gt;, where my input was based on the user copying a cell's contents via drag and past over multiple cells, where the input &lt;code&gt;n&lt;/code&gt; was the final cell to which was dragged, which I thought was acceptable in the question: &quot;&lt;em&gt;You can get &lt;code&gt;n&lt;/code&gt; any way.&lt;/em&gt;&quot; yet also &quot;&lt;em&gt;Standard loopholes are denied.&lt;/em&gt;&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Am I incorrect in assuming that this form of input is valid?&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-04-27T07:28:35.017" Title="Does drag+paste count as a valid form of input in Excel?" Tags="|discussion|policy|answers|defaults|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9038" PostTypeId="1" CreationDate="2016-04-26T21:58:09.867" Score="-1" ViewCount="108" Body="&lt;p&gt;This tag only has 2 questions using it, and I don't think it's that great of a challenge type, since it is vague and encourages no-ops. It also ends up being a popularity contest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Overall, I think the tag is bland and useless, so we might as well remove it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Challenges tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-shuffleboard&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-shuffleboard&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-shuffleboard&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/8859/hello-world-in-1024-characters&quot;&gt;Hello World in 1024 characters&lt;/a&gt; (currently has some close votes)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/67255/maximizing-output-from-minimal-input&quot;&gt;Maximizing output from minimal input&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The tag's usage in the meta:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/373/new-puzzle-type-code-shuffleboard&quot;&gt;New puzzle type: code-shuffleboard&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1281/make-the-criteria-tags-obligatory&quot;&gt;Make the criteria tags obligatory&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/906/the-tag-categorization-project/908?s=5|0.0855#908&quot;&gt;The Tag Categorization Project&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-05-05T12:19:58.263" Title="Should we burninate the [code-shuffleboard] tag?" Tags="|discussion|tags|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9039" PostTypeId="2" ParentId="9038" CreationDate="2016-04-26T22:03:59.900" Score="5" Body="&lt;p&gt;Tags denoting challenge types should only be removed if&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;that challenge type is deemed off topic by community consensus, and&lt;/li&gt;&#xA;&lt;li&gt;there aren't too many to retag.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;In this case we have #2 but not #1. If we're going to remove the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-shuffleboard&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-shuffleboard&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-shuffleboard&lt;/a&gt; tag, we should either discuss whether that challenge type should be made off topic, merged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, or something else.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-04-26T22:03:59.900" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9040" PostTypeId="1" CreationDate="2016-04-26T22:52:54.460" Score="14" ViewCount="353" Body="&lt;p&gt;There was a time—a dark, &lt;em&gt;dark&lt;/em&gt; time—in which there were no &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/20469&quot;&gt;standard loopholes&lt;/a&gt;. Since we began classifying certain things as loopholes and banning their use, the overall quality of the content on this site has improved. However, answers from the Dark Ages remain, answers which violate loopholes but predate the introduction of loopholes, so at the time they were posted they were not breaking any rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should our standards of quality apply retroactively? That is, what should we do with these old answers that now violate loopholes but didn't when they were posted? Some options I can think of offhand are&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Flag and/or delete&lt;/li&gt;&#xA;&lt;li&gt;Lock popular ones for historical significance&lt;/li&gt;&#xA;&lt;li&gt;Should we leave them all alone&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Surely there are other possible courses of action as well. Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2016-04-27T05:23:44.967" Title="How should we handle answers that predate standard loopholes?" Tags="|discussion|policy|answers|" AnswerCount="4" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9041" PostTypeId="2" ParentId="9040" CreationDate="2016-04-26T23:04:06.927" Score="10" Body="&lt;h1&gt;Leave them all alone.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Just as it's a common practice in law for people who have done acts that were legal at the time, but are in the future illegal, we should leave them alone. It's unnecessary trouble to &quot;fix what isn't broken&quot;, if you will. Though it's not allowed now, I believe its a silly thing to penalize answers that were doing no harm at the time.&lt;/p&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2016-04-26T23:04:06.927" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9042" PostTypeId="2" ParentId="9040" CreationDate="2016-04-26T23:06:20.503" Score="-1" Body="&lt;h1&gt;Flag and delete them&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The standards of quality should apply retroactively to all content on the site, just as we've been doing with challenges. Just because an answer is old shouldn't exempt it from our standards.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Having low quality answers like that on the site perpetuates the image that we're a &quot;joke site&quot; and that answers like that are acceptable. They lower the overall quality of the site and as such should be removed.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="20469" LastEditDate="2016-04-26T23:14:46.973" LastActivityDate="2016-04-26T23:14:46.973" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9043" PostTypeId="2" ParentId="9040" CreationDate="2016-04-26T23:09:01.550" Score="-3" Body="&lt;h1&gt;Lock them.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;They have historical significance.  They were fine at the time, but times changed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;@epicTCK summed it up:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9040/how-should-we-handle-answers-that-predate-standard-loopholes#comment26152_90420&quot;&gt;But they were funny back then.... and clever.  Just cliche &lt;em&gt;now&lt;/em&gt;&lt;/a&gt; - &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/47019/epictck&quot;&gt;epicTCK&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-04-26T23:09:01.550" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9045" PostTypeId="2" ParentId="9040" CreationDate="2016-04-26T23:28:59.060" Score="14" Body="&lt;h1&gt;Leave alone if they were funny once, delete if they were not&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We have a few loopholes that are actually common flaws in the spec, and exploiting them in the appropriate challenges could be considered clever.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, answers that violate&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8245/12012&quot;&gt;Abusing native number types to trivialize a problem&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1657/12012&quot;&gt;Using two different chars which look the same&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1283/12012&quot;&gt;Using Trigraphs in an underhanded contest&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5337/12012&quot;&gt;Zero-length answers&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;all were &lt;s&gt;honest&lt;/s&gt; perfectly valid attempts at solving a challenge one time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's no reason to delete these answers now, as they were valid when they were posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;They would be prime candidates for locking with the &lt;em&gt;historical significance&lt;/em&gt; reason, but that isn't possible for answers (anymore).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then they were answers that are not &lt;em&gt;no longer funny&lt;/em&gt;, they &lt;em&gt;never&lt;/em&gt; were.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any answer that violates&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1789/12012&quot;&gt;Adding input or rules which weren't explicitly mentioned in the challenge&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1062/12012&quot;&gt;Fetching the desired output from an external source&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1071/12012&quot;&gt;Using a made-up language specifically designed for the challenge&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;is (and always has been) &lt;em&gt;very low quality&lt;/em&gt;, which is reason enough for deletion.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-04-26T23:28:59.060" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="9046" PostTypeId="1" CreationDate="2016-04-27T00:07:30.077" Score="13" ViewCount="137" Body="&lt;p&gt;Ever since I've been active on this site, I've usually added a score header to my answers like this:&lt;/p&gt;&#xA;&lt;h1&gt;Malbolge, 1337&lt;/h1&gt;&#xA;&lt;p&gt;i.e. just a score number, with no units.  My rationale for doing this is as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;bytes is the default scoring unit for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.  Unless otherwise stated, the default scoring unit is bytes, and this doesn't necessarily need to be repeated.  I like to follow the &lt;a href=&quot;https://en.wikipedia.org/wiki/Don%27t_repeat_yourself&quot; rel=&quot;nofollow noreferrer&quot;&gt;DRY principle&lt;/a&gt; if possible, and code-golf seems to be an appropriate place for this as any.  Conversely, if any other non-default scoring method is used (e.g. unicode characters), then I explicitly state this.&lt;/li&gt;&#xA;&lt;li&gt;For &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, score is often more than just a byte count.  In some cases, there are additions to a score if for example extra command-line options or files are used.  Moreover, bonuses (not popular, I know) are sometimes applied.  These result in composite and/or non-integer scores.  To me these scores are simply scalar values, and forcing units of bytes doesn't necessarily make sense.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This approach seems to have been acceptable until recently whereby I've received several edits from users who are apparently dismayed at the lack of &amp;quot;bytes&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;Are such edits considered &amp;quot;good&amp;quot; corrections?&lt;/p&gt;&#xA;&lt;p&gt;Is it acceptable to leave &amp;quot;bytes&amp;quot; out of answer headers in default code-golf answers?&lt;/p&gt;&#xA;&lt;p&gt;I don't mind if other users always want to state &amp;quot;bytes&amp;quot;.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-27T00:32:34.097" Title="Edits of default scoring units in answers" Tags="|discussion|answers|editing|" AnswerCount="3" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="9047" PostTypeId="2" ParentId="9046" CreationDate="2016-04-27T00:11:20.397" Score="4" Body="&lt;p&gt;You're free to format your header as you like. Many people prefer having &quot;bytes&quot; in there (myself included), but there's nothing that says you &lt;em&gt;have&lt;/em&gt; to do that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Suggested edits that just try to add the word &quot;byte&quot; are completely superfluous and should be declined or rolled back.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-04-27T00:11:20.397" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9048" PostTypeId="2" ParentId="9046" CreationDate="2016-04-27T00:21:17.117" Score="-7" Body="&lt;h1&gt;Edits that add the scoring unit of the challenge are okay&lt;/h1&gt;&#xA;&lt;p&gt;With the exception of pop-con votes, the scoring criteria should be said in the header.&lt;/p&gt;&#xA;&lt;p&gt;So &lt;code&gt;xx bytes&lt;/code&gt;, &lt;code&gt;yy chars&lt;/code&gt;, etc.&lt;/p&gt;&#xA;&lt;p&gt;This also includes challenges that score in &lt;code&gt;points&lt;/code&gt;, as long as the value won't change. (i.e. votes go up and down, length doesn't)&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-27T00:21:17.117" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9049" PostTypeId="2" ParentId="9046" CreationDate="2016-04-27T00:31:58.780" Score="20" Body="&lt;p&gt;Please do not make this type of edit.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Firstly, this is a matter of personal opinion. &lt;strong&gt;You shouldn't be editing posts for style.&lt;/strong&gt; There is no benefit that can come from changing &quot;color&quot; to &quot;colour;&quot; that's solely a matter of &lt;em&gt;personal&lt;/em&gt; usage, and there's no reason to change it from one person's particular usage to that of someone else. Similarly, swapping between &quot;bytes,&quot; &quot;chars,&quot; &quot;characters,&quot; and nothing isn't going to get us anywhere.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Occasionally, I've also seen this as the &lt;em&gt;only&lt;/em&gt; edit to a post. This is even worse. As noted in &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/edit&quot;&gt;the Help Center&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Tiny, trivial edits are discouraged&lt;/strong&gt; - try to make the post significantly better when you edit, correcting all problems that you observe.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Editing a post bumps it back to the top of the &quot;active questions&quot; list (which is actively harmful when the edit is a trivial or superfluous one), creates overhead for the original author of the post, and implies that your way is somehow &quot;better&quot; than somebody else's, which is simply false given that this topic has never (to my knowledge) even been addressed on meta before.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even when coupled with a &quot;real&quot; edit, micro-managing &lt;a href=&quot;https://en.wikipedia.org/wiki/Linguistic_prescription&quot; rel=&quot;nofollow noreferrer&quot;&gt;prescriptivism&lt;/a&gt; does not achieve anything in the long run. If you &lt;em&gt;really&lt;/em&gt; think one way is objectively superior to another, bring it up on meta; otherwise, personal style should be left alone in edits.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Sometimes there's a reason for why something is done a certain way. For example, vim scoring is... well, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8999&quot;&gt;complicated&lt;/a&gt;; I prefer to leave the unit out because while vim answers can technically be measured in bytes, they're &lt;em&gt;really&lt;/em&gt; keystrokes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As mentioned in the OP, as well, there can be a variety of other reasons to prefer one format over another. If you think you have a reasonable basis for changing the format of the header from one form to another, drop a comment on the post at the very most, and allow the OP to change the formatting if they so desire. Otherwise, &lt;strong&gt;don't make assumptions&lt;/strong&gt; about whether the header format was just chosen arbitrarily.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;It's perhaps also worth noting that this isn't a catch-all. Some new users don't know how to write answers using the standard template, so changing&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Here is a solution in the Rust language&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;fn main(){println!(&quot;Hello, World!&quot;);}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;to use the standard header format is still perfectly fine. The issue is with modifying one well-accepted format to conform to what is only somebody else's opinion, without ample cause or reason. &lt;strong&gt;Edit for correctness, not for style.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-04-27T00:31:58.780" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9051" PostTypeId="2" ParentId="9037" CreationDate="2016-04-27T07:23:44.470" Score="5" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Since the user input (an integer number) can be found on the left hand column, dragging to the equivalent &lt;code&gt;n&lt;/code&gt; value for the number of rows is an acceptable form of input.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastActivityDate="2016-04-27T07:23:44.470" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9052" PostTypeId="2" ParentId="9037" CreationDate="2016-04-27T07:28:35.017" Score="2" Body="&lt;p&gt;Regardless of whether this suspicious input method limit should be allowed in general, it is clearly &lt;strong&gt;not&lt;/strong&gt; valid for the challenge in question: answers are required to count at least until 2&lt;sup&gt;64&lt;/sup&gt;; whereas Excel has a limit of 2&lt;sup&gt;20&lt;/sup&gt; rows.&lt;/p&gt;&#xA;" OwnerUserId="30688" LastActivityDate="2016-04-27T07:28:35.017" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9054" PostTypeId="1" CreationDate="2016-04-27T08:36:26.890" Score="8" ViewCount="151" Body="&lt;p&gt;A challenge must have an objective winning criterion. However, does this have to define a &lt;em&gt;single&lt;/em&gt; winner, or is it acceptable for a challenge to have categories of winners? We already encourage people to think in terms of competing with other solutions in the same language, and we often include a leaderboard that shows winners by language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A recent example is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/78675/ce-profanity-fix-all-fr-letters-words-in-ce-and-kp-it-running-correctl&quot;&gt;this challenge&lt;/a&gt; to write code that censors its own 4 letter words by replacing the middle 2 letters, while still maintaining the same behaviour when run. The winning criterion is code golf, and it is suggested that solutions compete with other solutions that contain the same number of 4 letter words. An automated leaderboard can easily be constructed for this, and it allows competition with oneself and others in the way that any other winning criterion does.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It seems analogous to sports having weight categories.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do we want this type of multi-category challenge to be on topic? If so what guidelines should we have for making this work well?&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-04-28T20:50:45.903" Title="Challenges with categories of winners" Tags="|discussion|winning-criteria|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9056" PostTypeId="2" ParentId="9054" CreationDate="2016-04-27T08:50:25.533" Score="2" Body="&lt;h2&gt;A very emphatic &amp;quot;no&amp;quot;&lt;/h2&gt;&#xA;&lt;p&gt;This suggestion is a conglomeration of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8214/45941&quot;&gt;chameleon challenges&lt;/a&gt; (because the real challenge would not be solving the challenge, but picking the optimal category), &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8106/45941&quot;&gt;bonuses in code golf&lt;/a&gt; (because the large number of sub-challenges to solve would dwarf the actual challenge, like with bonuses), and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8463/45941&quot;&gt;multi-part challenges&lt;/a&gt; (because each category would essentially be a challenge in of itself). As a result, it would be nigh-impossible to do well.&lt;/p&gt;&#xA;&lt;p&gt;If people want to informally compare answers (&amp;quot;Yay, my submission has the best score out of all the submissions which use X strategy!&amp;quot;), that's fine. Allowing formal categories in challenges opens up many cans of worms.&lt;/p&gt;&#xA;&lt;p&gt;As it stands, we require our challenges to have an objective winning criterion that selects &lt;em&gt;exactly one&lt;/em&gt; submission as the winner. Introducing categories into challenges would cause them to have multiple winners. We need to have a discussion about whether or not we want to be able to have multiple winners before we can even consider allowing categories.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-28T20:50:45.903" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9057" PostTypeId="2" ParentId="9054" CreationDate="2016-04-27T09:13:07.700" Score="4" Body="&lt;h3&gt;This is a good thing provided the challenges belong in the same post&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If the challenge is &quot;Output the sum of N numbers, or alternatively their product&quot; that just clutters the solutions of two distinct challenges together. They should be separate challenges in separate posts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, where the categories are inherently part of the same challenge, such as the example in the question, I favour the idea of a winner per category over trying to artificially force a universal scoring mechanism.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A contrived score based on bytes modified by category means that getting the best score requires testing all the categories, giving the same explosion of extra work as having bonuses. It also means that in many cases some languages will not fit well with the scoring method, resulting in only one category being worth trying for that language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The only problem I anticipate with having a winner per category is that there is only one acceptance tick. Personally I don't see that as a problem at all, as &lt;strong&gt;I am strongly in favour of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8363/20283&quot;&gt;PPCG not having acceptance ticks&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-04-27T09:13:07.700" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9058" PostTypeId="1" AcceptedAnswerId="9059" CreationDate="2016-04-27T11:49:11.647" Score="0" ViewCount="131" Body="&lt;p&gt;Note: This question is mainly about closed questions that haven't received any answers. Questions with answers should potentially be treated differently.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;First the numbers:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/search?q=duplicate%3A1%20answers%3A0&quot;&gt;Duplicate questions&lt;/a&gt;:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;226 questions are closed as duplicates (including questions with answers)&lt;/li&gt;&#xA;&lt;li&gt;71 questions are closed as duplicates (not including questions with answers)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;37 have a score of zero or less&lt;/li&gt;&#xA;&lt;li&gt;47 have a score of one or less&lt;/li&gt;&#xA;&lt;li&gt;63 are more than one month old&lt;/li&gt;&#xA;&lt;li&gt;37 are more than one year old&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/search?q=duplicate%3A0%20closed%3A1%20answers%3A0&quot;&gt;Closed questions (not duplicates)&lt;/a&gt;:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;434 questions are closed, but are not duplicates (including questions with answers)&lt;/li&gt;&#xA;&lt;li&gt;70 questions are closed, but are not duplicates (not including questions with answers)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;5 have a score of zero of less&lt;/li&gt;&#xA;&lt;li&gt;27 have a score of 1 or less&lt;/li&gt;&#xA;&lt;li&gt;64 are more than one month old&lt;/li&gt;&#xA;&lt;li&gt;39 are more than one year old&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Observation:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Closed questions (not duplicates) with zero or negative score get deleted fast. &lt;strong&gt;Hurray!&lt;/strong&gt; Duplicate questions with zero or negative score tend to stick around a bit longer. Many positive scoring questions are kept, even though they have been closed for quite some time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my opinion, most of these should be deleted.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Question:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Negative scoring closed questions get deleted already. But what about the duplicates? And what about closed questions with a few positive votes?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there a reason for keeping them around, or should we delete them if they're older than, for instance, a month? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;Maybe there are some exceptions that should be kept even if they're closed.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="31516" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-04-27T17:23:16.507" Title="Which questions should get deleted (and how fast)?" Tags="|discussion|duplicates|closed-questions|moderation|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9059" PostTypeId="2" ParentId="9058" CreationDate="2016-04-27T12:42:20.603" Score="9" Body="&lt;p&gt;tl;dr: Don't worry about it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For &lt;strong&gt;off-topic&lt;/strong&gt; posts such as general programming questions, there's no reason to waste your time and delete votes on posts that will already get &lt;a href=&quot;https://meta.stackexchange.com/q/173513/180276&quot;&gt;Roomba'd&lt;/a&gt; automatically. This goes for any post that's closed and downvoted, indicating it's a poor fit for the site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The idea of typically avoiding deletion of &lt;strong&gt;duplicate&lt;/strong&gt; questions is so that they can act as &quot;&lt;a href=&quot;https://meta.stackexchange.com/q/230/180276&quot;&gt;signposts&lt;/a&gt;&quot; for future &lt;s&gt;askers&lt;/s&gt; challenge-writers. There's no harm in having one post point to another so that people can find the dupe target more easily.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Otherwise, for questions that are closed but upvoted, well, clearly since they're upvoted at least someone found them interesting. There's no reason to delete positively-scored content (serving as a rough indicator that it is high-quality and contributes positively to the site) just because it's been closed (however unlikely it might be after several years, they can always be reopened again eventually).&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2016-04-27T12:42:20.603" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9060" PostTypeId="2" ParentId="9058" CreationDate="2016-04-27T17:23:16.507" Score="-1" Body="&lt;h1&gt;No, current deletion system is ok&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For more details about automatic deletion see &lt;a href=&quot;https://meta.stackexchange.com/questions/5221/how-does-deleting-work-what-can-cause-a-post-to-be-deleted-and-what-does-that&quot;&gt;How does deleting work? What can cause a post to be deleted, and what does that actually mean? What are the criteria for deletion?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Duplicates are useful for the search engine.&lt;/li&gt;&#xA;&lt;li&gt;Why a nice answer (made before the question was closed) should be deleted and forgotten?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="32091" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2016-04-27T17:23:16.507" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9064" PostTypeId="1" CreationDate="2016-04-29T04:00:18.690" Score="25" ViewCount="1356" Body="&lt;p&gt;This is a rather common inquiry in contests that require computing elements of a sequence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, consider the following recursive implementation of the factorial function (Python):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f = lambda n:n&amp;lt;1or n*f(n-1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This works well for all positive &lt;strong&gt;n&lt;/strong&gt;; &lt;code&gt;f(n)&lt;/code&gt; returns the required result as an &lt;em&gt;int&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, &lt;code&gt;f(0)&lt;/code&gt; will return the result of the comparison &lt;code&gt;n&amp;lt;1&lt;/code&gt;, which is the the &lt;em&gt;bool&lt;/em&gt; &lt;strong&gt;True&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fixing this is easy enough, but it costs a few bytes:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f = lambda n:0**n or n*f(n-1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;While it is possible to think of the Booleans &lt;strong&gt;True&lt;/strong&gt; and &lt;strong&gt;False&lt;/strong&gt; as numbers (usually &lt;strong&gt;1&lt;/strong&gt; and &lt;strong&gt;0&lt;/strong&gt;) and use them as such in languages such as Python, languages such as Java or Ruby do not even allow casting a Boolean to a numeric type.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since this is such a common scenario, I think we would benefit from a default. If a challenge doesn't contemplate returning Booleans instead of numbers, should it be allowed or forbidden?&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2016-05-10T10:20:04.017" Title="Should Booleans be allowed where a number is required?" Tags="|discussion|policy|answers|defaults|" AnswerCount="3" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="9067" PostTypeId="2" ParentId="9064" CreationDate="2016-04-29T07:16:12.690" Score="29" Body="&lt;h2&gt;If it quacks like a number, it's a number&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://ideone.com/WyuF1r&quot; rel=&quot;nofollow noreferrer&quot;&gt;Let's look at some Python examples&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt; 2 * 1&#xA;2&#xA;&#xA;&amp;gt;&amp;gt;&amp;gt; 2 * 0&#xA;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Cool, &lt;code&gt;2&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt;, and &lt;code&gt;0&lt;/code&gt; are all numbers. That's not being contested here.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt; 2 * True&#xA;2&#xA;&#xA;&amp;gt;&amp;gt;&amp;gt; 2 * False&#xA;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;True&lt;/code&gt; and &lt;code&gt;False&lt;/code&gt; act just like &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt; (respectively). In fact, &lt;code&gt;1 == True&lt;/code&gt; and &lt;code&gt;0 == False&lt;/code&gt;. The only difference is that &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt; are instances of &lt;code&gt;int&lt;/code&gt;, and &lt;code&gt;True&lt;/code&gt; and &lt;code&gt;False&lt;/code&gt; are instances of &lt;code&gt;bool&lt;/code&gt; (which is itself a subclass of &lt;code&gt;int&lt;/code&gt;). &lt;a href=&quot;https://www.python.org/dev/peps/pep-0285/&quot; rel=&quot;nofollow noreferrer&quot;&gt;This is by design&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;In C, they are exactly the same: &lt;a href=&quot;https://stackoverflow.com/a/2254087/2508324&quot;&gt;&lt;code&gt;true&lt;/code&gt; and &lt;code&gt;false&lt;/code&gt; are preprocesser macros defined as &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt;, respectively&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;In short: if you can use a boolean just like a number, then booleans are acceptable substitutes for numbers, since they're functionally identical.&lt;/p&gt;&#xA;&lt;p&gt;More general: Data types can be substituted so long as the alternate data type is functionally identical to the intended/original data type. For C, this means using &lt;code&gt;uint_8&lt;/code&gt; instead of &lt;code&gt;char&lt;/code&gt; is acceptable. For Python, this means that &lt;code&gt;bool&lt;/code&gt; and &lt;code&gt;int&lt;/code&gt; are interchangeable.&lt;/p&gt;&#xA;&lt;p&gt;However, this does not apply to challenges where an exact string output is required. For example, in Ninety-Nine Bottles of Beer, the second-to-last verse must be &amp;quot;1 bottle of beer on the wall...&amp;quot;, not &amp;quot;True bottle of beer on the wall...&amp;quot;.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-10T05:01:23.683" CommentCount="20" ContentLicense="CC BY-SA 3.0" />
  <row Id="9068" PostTypeId="2" ParentId="2140" CreationDate="2016-04-29T09:14:20.417" Score="0" Body="&lt;h2&gt;Spiral text&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a function or program that given a text with one or more characters in it outputs the text as a square spiral. The first letter of the text must be the center of the spiral and then all the characters must follow a clockwise spiral pattern as follow, striping all white spaces:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;           789[10]&#xA;           612[11]&#xA;           543[12]&#xA;              [13]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Example&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: Hello World!&#xA;Output:&#xA;&#xA;               ORLD&#xA;               WHE!&#xA;               OLL&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The text could be any length. Please validate with the following texts:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Once upon a time&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Expected output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;o   n   a   t&#xA;p   o   n   i&#xA;u   e   c   m&#xA;            e&#xA;&#xA;&#xA;Tyger Tyger, burning bright, In the forests of the night; &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Expected output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;g   h   t   ;           &#xA;i   i   g   h   t,  I   n&#xA;n   r   y   g   e   r   t&#xA;e   b   t   t   y   ,   h&#xA;h   g   r   e   g   b   e&#xA;t   n   i   n   r   u   f&#xA;f   o   t   s   e   r   o&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The minimung length of the input text is one character.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note: Somewhat similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/75446/draw-spiral-words&quot;&gt;this question&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="3227" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:21.580" LastActivityDate="2016-04-29T10:10:16.980" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9070" PostTypeId="2" ParentId="2140" CreationDate="2016-04-29T19:15:46.933" Score="1" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;You have an even number of identical balls. Half of them are &quot;Light&quot; balls and other half are &quot;Heavy&quot; balls which are heavier than the light balls for a unknown amount. You have to separate them into the &quot;Light&quot; box and a &quot;Heavy&quot; box using a scale instrument which tells you precisely for how much the left side is heavier than the right side when the balls are weighted on it.&#xA;  &lt;br&gt;&lt;br&gt;&#xA;  Find a way to separate a given number of the balls with the minimal weightings as possible.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is a challenge to programmatically reslove &lt;a href=&quot;https://math.stackexchange.com/questions/1762437/separating-heavier-from-the-lighter-balls&quot;&gt;this question&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The solution&lt;/strong&gt; should be an algorithm  that would separate the given amount of balls with the least weightings  as possible. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;strong&gt;Input&lt;/strong&gt; can be any even number of balls, where the heavy balls will differ in weight from the light balls by a random amount. The balls are marked from 1 to n, and the &quot;heavy&quot; and &quot;light&quot; properties are assigned to all the balls randomly. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now the program can take any number of balls and place it on the &quot;right&quot; side of a &quot;scale&quot; and then another amount of balls to be placed on the &quot;left&quot; side of the scale. It can read for how much exactly one side is heavier than the another, and then it can proceed to weight another set of balls until he can for sure tell for each numbered ball if it is &quot;light&quot; or &quot;heavy&quot;. It should know how to process this in a least &quot;weightings&quot; or &quot;uses of the scale&quot; as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So the goal is to write the most efficient program that can most efficiently separate the balls using the minimal amount of &quot;weightings&quot;, and doing that for as many cases of given balls as possible.&lt;/p&gt;&#xA;" OwnerUserId="53377" LastEditorUserId="-1" LastEditDate="2017-04-13T12:19:20.950" LastActivityDate="2016-04-29T19:15:46.933" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9074" PostTypeId="2" ParentId="2140" CreationDate="2016-04-30T10:12:54.067" Score="2" Body="&lt;h1&gt;Determine whether one graph is a subgraph of the other&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graph-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graph-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;graph-theory&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/discrete-math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;discrete-math&amp;#39;&quot; rel=&quot;tag&quot;&gt;discrete-math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given two unlabelled graphs as adjecency matrices with the same number of vertices, the goal is determining whether the first graph is a subgraph of the second one.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Definitions&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A &lt;strong&gt;graph&lt;/strong&gt; &lt;code&gt;G=(V,E)&lt;/code&gt; comprises a set of vertices &lt;code&gt;V={1,2,3,...,n}&lt;/code&gt; and a set of edges &lt;code&gt;E ⊆ V x V = {(u,v) | u,v ∈ V}&lt;/code&gt;. The &lt;strong&gt;adjecency matrix&lt;/strong&gt; &lt;code&gt;A={a(i,j)}&lt;/code&gt;of a graph &lt;code&gt;G&lt;/code&gt; is defined entry wise:&lt;code&gt;a(i,j) = 1 if (i,j) ∈ E, 0 otherwise&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A graph &lt;code&gt;H=(W,F)&lt;/code&gt; with adjecency matrix &lt;code&gt;B={b(i,j)}&lt;/code&gt; is a &lt;strong&gt;subgraph&lt;/strong&gt; of &lt;code&gt;G&lt;/code&gt; iff all following statements hold:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;V=W&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;There is a permutation &lt;code&gt;p:V→W=V&lt;/code&gt; such that &lt;code&gt;b(p(i),p(j)) ≤ a(i,j) for all i,j ∈ V=W&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;First the trivial ones: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Obviously, every graph is a subgraph of itself.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;H&lt;/code&gt; has more edges than &lt;code&gt;G&lt;/code&gt; then it cannot be a subgraph.&lt;/li&gt;&#xA;&lt;li&gt;If you remove edges from a valid subgraph, the result will again be a subgraph.&lt;/li&gt;&#xA;&lt;li&gt;If every of the &lt;code&gt;n&lt;/code&gt; nodes in &lt;code&gt;G&lt;/code&gt; has edges to every other node, then every graph &lt;code&gt;H&lt;/code&gt; with &lt;code&gt;n&lt;/code&gt; nodes is a subgraph.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;6 vertices, isomorphic (one big cycle)&lt;/strong&gt; (remove some ones from Graph 1 in order to generate more valid subgraphs)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Permutation: [5 6 4 1 3 2]&#xA;Graph 1:     [0 1 0 0 0 0;0 0 1 0 0 0;0 0 0 1 0 0;0 0 0 0 1 0;0 0 0 0 0 1;1 0 0 0 0 0]&#xA;Graph 2:     [0 0 1 0 0 0;0 0 0 0 1 0;0 1 0 0 0 0;1 0 0 0 0 0;0 0 0 0 0 1;0 0 0 1 0 0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Visualization of the above example by @KennyLau:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/QjDxB.png&quot; width=&quot;300&quot; /&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;10 vertices, same number of edges, non isomorphic (g1 has minimal cycles of length 3,4,5, g2 has minimal cycles of length 3,4,4&lt;/strong&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Graph 1:    [0 1 0 1 0 0 0 0 0 0;0 0 1 0 0 0 0 0 0 0;1 0 0 0 0 0 0 0 0 0;0 0 0 0 1 0 0 0 0 0;0 0 0 0 0 1 1 0 0 0;1 0 0 0 0 0 0 0 0 0;0 0 0 0 0 0 0 1 0 0;0 0 0 0 0 0 0 0 1 0;0 0 0 0 0 0 0 0 0 1;0 0 0 0 1 0 0 0 0 0]&#xA;Graph 2:    [0 0 0 0 0 0 0 1 0 1;0 0 0 0 0 0 1 0 0 0;0 0 0 0 0 1 0 0 0 0;1 0 0 0 0 0 0 0 0 0;0 1 0 1 0 0 0 0 0 0;1 0 0 0 0 0 0 0 0 0;0 0 0 0 1 0 0 0 0 0;0 0 1 0 0 0 0 0 0 0;0 0 0 0 0 1 0 0 0 0;0 0 0 0 1 0 0 0 0 0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2016-04-30T15:35:07.790" LastActivityDate="2016-04-30T15:35:07.790" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9076" PostTypeId="2" ParentId="9064" CreationDate="2016-04-30T15:07:57.187" Score="7" Body="&lt;h1&gt;Not in Inputs/Outputs&lt;/h1&gt;&#xA;&lt;p&gt;Allowing booleans to be returned instead of numbers is completely against the whole point of booleans in languages.&lt;/p&gt;&#xA;&lt;p&gt;Booleans are not necessary, but are implemented to make a distinction between the &amp;quot;simple&amp;quot; numbers 1 and 0 and the boolean values &lt;em&gt;true&lt;/em&gt; and &lt;em&gt;false&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The implementation of booleans in the language has no influence on this: the fact that it is implemented means that it is intended to be semantically different from numbers.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; If your boolean gets returned as a number, then that's obviously valid. Similarly you can use booleans however you want inside your program.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note 2:&lt;/strong&gt; I have the exact same view for chars. Arguing that an output of &lt;code&gt;'*'&lt;/code&gt; is valid if the expected output is 42 is completely ridiculous. As before, if your &lt;code&gt;'*'&lt;/code&gt; gets printed as 42 then it's fine.&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-04-30T17:08:19.523" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9078" PostTypeId="1" AcceptedAnswerId="9091" CreationDate="2016-05-01T10:27:17.013" Score="16" ViewCount="224" Body="&lt;p&gt;The current tag info of the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; is outdated and needs to be &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8242/the-state-of-the-popularity-contest-tag&quot;&gt;replaced/improved&lt;/a&gt; as we now have much clearer notions of what a pop-con is compared to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/110/a-modest-proposal-the-popularity-contest-tag&quot;&gt;time of creation&lt;/a&gt;. From the recent discussions (links below) we can conclude that&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a pop-con needs an objective validity criterion&lt;/li&gt;&#xA;&lt;li&gt;the tag-info currently does not sufficiently communicate what a good pop-con should (not) be&lt;/li&gt;&#xA;&lt;li&gt;popularity contest should produce answers that people like (as this is what people vote on) therefore voting guidelines are for the most part useless&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Please submit your drafts for a new tag description that do consider these points.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The mentioned discussions:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8084/guidelines-for-posting-and-closing-popularity-contests&quot;&gt;Guidelines for posting and closing popularity contests&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2212/proposing-new-winning-criterion-tag-voter-judged&quot;&gt;Proposing new winning criterion tag: Voter-judged&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-05-11T23:31:55.217" Title="Updating the [popularity-contest] tag info: suggestions" Tags="|discussion|popularity-contest|tag-wikis|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9079" PostTypeId="2" ParentId="2140" CreationDate="2016-05-01T13:20:07.297" Score="1" Body="&lt;h1&gt;How Many Colours?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Take a grid of ASCII art rectangles as input and output the &lt;strong&gt;minimum&lt;/strong&gt; number of colours you would need to colour it in so that no two rectangles of the same colour are touching.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input can be any type of grid format (multine string, array of strings, etc...).&lt;/li&gt;&#xA;&lt;li&gt;Rectangles only count as touching if the &lt;strong&gt;inside&lt;/strong&gt; is adjacent to the inside of another rectangle (see the bottom-left rectangle in the example).&lt;/li&gt;&#xA;&lt;li&gt;You may use different characters to &lt;code&gt;#&lt;/code&gt; and space, but if you do, please specify what you use in your answer.&lt;/li&gt;&#xA;&lt;li&gt;The grid itself will always be rectangular.&lt;/li&gt;&#xA;&lt;li&gt;Grid width and height will always be between 3 and 99.&lt;/li&gt;&#xA;&lt;li&gt;Shortest code in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The output for this input would be &lt;code&gt;3&lt;/code&gt;. An example arrangement of each colour &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;3&lt;/code&gt; is labelled in the input below. Note how the bottom-left rectangle does not count as adjacent to the middle one.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#################&#xA;# 1  #      # 1 #&#xA;######      #   #&#xA;# 2  #  3   #####&#xA;#    #      #   #&#xA;######      # 2 #&#xA;# 3  ########   #&#xA;#    #  1   #   #&#xA;#################&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;TODO...&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Links&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Four_color_theorem&quot; rel=&quot;nofollow noreferrer&quot;&gt;Four Colour Theorem&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Tags&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="46855" LastEditorUserId="46855" LastEditDate="2016-05-01T13:55:55.770" LastActivityDate="2016-05-01T13:55:55.770" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9080" PostTypeId="1" CreationDate="2016-05-01T14:26:02.657" Score="1" ViewCount="147" Body="&lt;p&gt;I have a question that is intended to allow Unicode input. No-one has posted an answer yet but someone has asked if it can be ASCII input only. That could drastically change which languages were competitive. Can I have the same challenge but score ASCII-only against ASCII-only and Unicode against Unicode? I.e. make them non-competitive against the other type, only with their own type?&lt;/p&gt;&#xA;" OwnerUserId="29560" LastEditorUserId="29560" LastEditDate="2016-05-01T15:27:46.063" LastActivityDate="2020-01-20T10:41:19.820" Title="Can you allow ASCII-only and Unicode answers in the one challenge?" Tags="|discussion|" AnswerCount="2" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9081" PostTypeId="2" ParentId="2140" CreationDate="2016-05-01T15:04:26.803" Score="1" Body="&lt;h1&gt;Wheels on the Bus Go...&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Scenario&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There is a bus heading for an intersection. Usually that is when buses would stop and give way to traffic, but &lt;a href=&quot;https://en.wikipedia.org/wiki/Speed_(1994_film)&quot; rel=&quot;nofollow noreferrer&quot;&gt;there's a bomb on the bus&lt;/a&gt;! The bomb blows up if the speed of the bus falls below 50 miles-per-hour. Find out what speed the bus needs to travel at to avoid crashing into the cars going through the intersection.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take a list of cars coming from the left and another list of cars coming from the right. The lists contain the distance of each car from the intersection as integers.&lt;/li&gt;&#xA;&lt;li&gt;The distances will always be from &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;99&lt;/code&gt; units.&lt;/li&gt;&#xA;&lt;li&gt;There will always be &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;9&lt;/code&gt; cars in either direction (&lt;code&gt;2&lt;/code&gt; to &lt;code&gt;18&lt;/code&gt; total).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The speed the bus must travel to make it through the intersection without hitting a car.&lt;/li&gt;&#xA;&lt;li&gt;The speed can be an integer from &lt;code&gt;5&lt;/code&gt; and to &lt;code&gt;9&lt;/code&gt; which is the &lt;code&gt;speed in miles-per-hour / 10&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each iteration, every vehicle moves &lt;code&gt;speed in mph / 10&lt;/code&gt; units forwards. The &quot;path&quot; of a vehicle for each iteration includes it's position before the iteration, it's position after the iteration and every position in between.&lt;/li&gt;&#xA;&lt;li&gt;The cars always travel at 40 mph.&lt;/li&gt;&#xA;&lt;li&gt;A crash occurs when the path of the bus intersects the path of a car in the intersection.&lt;/li&gt;&#xA;&lt;li&gt;The bus starts 20 units before the intersection.&lt;/li&gt;&#xA;&lt;li&gt;Cars cannot crash into other cars.&lt;/li&gt;&#xA;&lt;li&gt;The speed of each bus cannot change during the simulation. You can only give each bus one speed.&lt;/li&gt;&#xA;&lt;li&gt;Only solvable inputs will be given.&lt;/li&gt;&#xA;&lt;li&gt;Shortest code in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;TODO: Example doesn't make sense yet. Will complete later...&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's an example using ASCII art to illustrate what would happen with this input and a bus speed of 6. Note: despite what it may look like, the intersection should behave as if it's size is only one unit.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;B&lt;/code&gt; = Bus&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;.&lt;/code&gt; = Vehcile movement during iteration&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;C&lt;/code&gt; = Car&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;[ ... ]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;                  |     ^ |&#xA;                  |   | | |&#xA;------------------ ---     --------------&#xA;        &amp;lt;-                |    C . . . C&#xA;--  --  --  --  --         --  --  --  --&#xA;. C           C . |     .  . C     -&amp;gt;&#xA;------------------     --- --------------&#xA;                  |   |   |&#xA;                  |     B |&#xA;                  |   | . |&#xA;                  |     . |&#xA;                  |   | . |&#xA;                  |     . |&#xA;                  |   | . |&#xA;                  |     B |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;TODO...&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Tags&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/simulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;simulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;simulation&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="46855" LastEditorUserId="46855" LastEditDate="2016-05-01T18:35:18.860" LastActivityDate="2016-05-01T18:35:18.860" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9082" PostTypeId="2" ParentId="2140" CreationDate="2016-05-01T17:32:32.720" Score="1" Body="&lt;h1&gt;From Smiles to Molecular formula!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Simplified_molecular-input_line-entry_system&quot; rel=&quot;nofollow noreferrer&quot;&gt;SMILES&lt;/a&gt; is an algorithm to represent chemical molecules in one-line ASCII.&lt;/p&gt;&#xA;&lt;p&gt;In this challenge, we will only be dealing with purely organic chemicals.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All the &lt;code&gt;H&lt;/code&gt;ydrogens are not represented.&lt;/li&gt;&#xA;&lt;li&gt;All single bonds not represented, double bond is &lt;code&gt;=&lt;/code&gt;, triple bond is &lt;code&gt;#&lt;/code&gt;. For example, ethane is &lt;code&gt;CC&lt;/code&gt;, ethene is &lt;code&gt;C=C&lt;/code&gt;, ethyne is &lt;code&gt;C#C&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Branches are represented by &lt;code&gt;()&lt;/code&gt;. For example, isobutane is &lt;code&gt;CC(C)C&lt;/code&gt;, acetone is &lt;code&gt;CC(=O)C&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Cycles are represented by numbers. For example, cyclohexane is &lt;code&gt;C1CCCCC1&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;All other things are ignored in this challenge.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Your task is to determine the molecular formula of a molecule, given its SMILES representation.&lt;/p&gt;&#xA;&lt;h1&gt;Specs&lt;/h1&gt;&#xA;&lt;p&gt;Any reasonable input/output format.&lt;/p&gt;&#xA;&lt;p&gt;These are all accepted, for formaldehyde:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;CH2O&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;C1H2O1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;CxHxxOx&lt;/code&gt; (unary)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;CHHO&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;OCHH&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;OHCH&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. Shortest solution in bytes wins.&lt;/p&gt;&#xA;&lt;h1&gt;Testcases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;input       output&#xA;C=O         CH2O&#xA;O=C=O       CO2&#xA;C1C(=O)CC1  C4H6O&#xA;C#CCC       C4H6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="48934" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-03T14:16:07.723" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9084" PostTypeId="1" AcceptedAnswerId="9087" CreationDate="2016-05-02T14:38:21.967" Score="4" ViewCount="139" Body="&lt;p&gt;Whilst answering questions, is it Ok to use functions/bits of code where the output will be different for some computers?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example I was thinking about adding a new time type to PYKE where the input could be in the form natively used by the computer (&lt;a href=&quot;https://docs.python.org/2/library/datetime.html#strftime-and-strptime-behavior&quot; rel=&quot;nofollow noreferrer&quot;&gt;see here&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;%c - Locale’s appropriate date and time representation.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Tue Aug 16 21:30:00 1988 (en_US);&#xA;  Di 16 Aug 21:30:00 1988 (de_DE)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This means that the code would be valid on some running computers but not others.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A more extreme variation of this could be a variant of the as of now standard loophole, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5076/32686&quot;&gt;Using MetaGolfScript&lt;/a&gt; but using something like the MAC address as the identifier. This could potentially allow any program (pyth for example) under 7 bytes long to be a zero byte answer in MAC-lang, which executes pyth code with your MAC address as input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should this type of input be allowed by default?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Note should not be an answer for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/32686&quot;&gt;Default for Code Golf: Input/Output methods&lt;/a&gt; because this form of input isn't a stream/form of input)&lt;/p&gt;&#xA;" OwnerUserId="32686" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-05-02T16:46:58.277" Title="Behaviour on different computers" Tags="|discussion|policy|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9085" PostTypeId="2" ParentId="9080" CreationDate="2016-05-02T14:52:43.187" Score="0" Body="&lt;h1&gt;Well, no.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;By holding two different competitions in one challenge, your challenge becomes unclear, as all questions require one specific scoring system that leads to one specific winner.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="44713" LastEditDate="2016-05-02T14:58:25.950" LastActivityDate="2016-05-02T14:58:25.950" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9087" PostTypeId="2" ParentId="9084" CreationDate="2016-05-02T16:46:58.277" Score="10" Body="&lt;p&gt;The question splits into two parts. The first part asks about locales: this issue has already been discussed in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7881/194&quot;&gt;an earlier question&lt;/a&gt;, and there seems to be a qualified majority consensus that it's ok for answers to be locale-dependent as long as that is clearly documented.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The second part I would describe as asking about answers which take the piss. If someone did create a language which uses something like the MAC address to outsource part of their source code, I would consider that it violates the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1085/194&quot;&gt;Outsourcing the real answer&lt;/a&gt; standard loophole, as well as the spirit of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5076/194&quot;&gt;Using MetaGolfScript&lt;/a&gt; standard loophole, and so I would downvote and either flag as low quality or vote to delete.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-05-02T16:46:58.277" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9088" PostTypeId="2" ParentId="2140" CreationDate="2016-05-02T18:00:16.093" Score="0" Body="&lt;h2&gt;Is this a helpful starting layout?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;My computer has a Patience-style card game installed on it. It takes two packs of cards, removes the Aces, shuffles them, and deals 8 cards.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In order to maintain my 100% perfect completion record, I want as helpful a starting layout as possible. Deuces are immediately playable, so they are helpful cards. However other cards can only be played on cards of descending rank and opposite colour, which means that cards of the same rank and colour unhelpfully clog up the layout.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is to write a program or function which accepts a string or list of eight cards and outputs a truthy or falsy value. Cards are identified by their rank, which is one of the characters &lt;code&gt;23456789TJQK&lt;/code&gt;, and their suit, which is one of the characters &lt;code&gt;CDHS&lt;/code&gt;. (Note that using numbers 10-13 for the rank is not an acceptable input.) For a layout to be helpful there must be at least one Deuce of any rank, and (except Deuces) there must not be any pairs of cards with the same rank and colour. Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4H7STHTD5C5D2HQS -&amp;gt; unhelpful because of two red Tens&#xA;TD8S4CKC4HKD5S5H -&amp;gt; unhelpful because of no Deuces&#xA;2H7SJH3S4HKS7H3H -&amp;gt; helpful layout&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2016-05-02T19:48:58.640" LastActivityDate="2016-05-02T19:48:58.640" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9089" PostTypeId="2" ParentId="1464" CreationDate="2016-05-02T19:29:47.730" Score="2" Body="&lt;h3&gt;Another idea: language design and development&lt;/h3&gt;&#xA;&lt;p&gt;This is more relevant recently due to the surge in language creation. Sub-topics include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Posts by language creators about their languages; design, development, implementation, unique features, etc.&lt;/li&gt;&#xA;&lt;li&gt;Comparison of and/or expositions on language styles (stack-based/procedural/tacit, prefix/postfix/infix, etc.)&lt;/li&gt;&#xA;&lt;li&gt;In-depth explorations of the pros and cons of golfing languages vs. non-golfing languages (succinctness, readability, typing speed, execution speed, etc.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I think this could be an especially rich field that PPCG members could contribute to due to the plethora of language creators &lt;em&gt;and&lt;/em&gt; users of languages made by PPCGers.&lt;/p&gt;&#xA;" OwnerUserId="12914" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-02T19:29:47.730" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9090" PostTypeId="1" CreationDate="2016-05-02T19:29:53.290" Score="16" ViewCount="261" Body="&lt;p&gt;We've got some pretty great challenges here.  However, after a month or so, challenges get little to no activity.  Since we aren't a Q&amp;amp;A site, we rarely get traffic via searches.  I would love it if we could &lt;strong&gt;introduce users to high quality questions that they may not have found on their own&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe that some sort of &lt;em&gt;Tour of PPCG&lt;/em&gt; would help the discoverability of our older questions (name not set in stone).  This tour would consist of an ordered list of challenges, where users would aim to complete all of them&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are a couple of details that need ironing out:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;How we pick the questions that appear on the tour&lt;/li&gt;&#xA;&lt;li&gt;How many questions are on the tour&lt;/li&gt;&#xA;&lt;li&gt;How we present the tour (and make it visible)&lt;/li&gt;&#xA;&lt;li&gt;How/If we reward users that complete the tour&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Does this sound like a good idea?  If so, how should address the above details?&lt;/p&gt;&#xA;" OwnerUserId="20198" LastActivityDate="2016-05-08T00:23:56.510" Title="Tour to Improve the Discoverability of Old Challenges" Tags="|discussion|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9091" PostTypeId="2" ParentId="9078" CreationDate="2016-05-02T20:36:24.757" Score="9" Body="&lt;p&gt;Notes:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If you find any grammar mistakes or formulations that are clumsy, feel free to directly edit. For other suggestions please use the comments.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Should certains points be linked to the relevant discussions on meta?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I think this might be too long.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Feel free use this as a base for an own draft.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I did use parts of the current version of the tag description.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Would linking to good (and bad?) examples be beneficial?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;hr /&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A popularity-contest is a competition where the answer with the highest vote tally (upvotes minus downvotes) wins.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;What is a popularity contest?&lt;/h2&gt;&#xA;&lt;p&gt;A popularity contest is a competition where the answer with the highest vote tally (upvotes minus downvotes) wins.&lt;/p&gt;&#xA;&lt;h2&gt;Qualities of good popularity contests&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A challenge with clear specifications that still allow for creative problem solving.&lt;/li&gt;&#xA;&lt;li&gt;A challenge where solutions that best solve the problem are also solutions that the voters are going to like.&lt;/li&gt;&#xA;&lt;li&gt;Gives freedom to entrants to decide what to do in crucial parts and incentivizes them to use this freedom.&lt;/li&gt;&#xA;&lt;li&gt;It is strongly suggested to submit the challenge to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;Sandbox&lt;/a&gt; at least a few days before posting the challenge. That way the challenge can be reviewed and discussed in order to find any mistakes or inconsistencies, and it also serves for getting a first impression whether the challenge will be well recieved.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Things that MUST be included in a popularity contest&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A popularity contest &lt;em&gt;must&lt;/em&gt; always include an &lt;em&gt;objective validity criterion&lt;/em&gt;, which is a set of rules that regulate what every answer &lt;em&gt;must&lt;/em&gt; comply with. Answers that do not comply are invalid and will be removed.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A clear specification of the goal that must be achieved. Questions like &lt;em&gt;&amp;quot;do (this) the most creative way&amp;quot;&lt;/em&gt; should be avoided. Creativity should be the tool, not the goal.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Qualities which should be avoided in popularity contests&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Asking to solve a specific task in a very specific way, without room for creativity.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Asking to solve a vaguely defined task in any way that the entrant wants (this will probably make your question be closed as too broad).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Rules what people should consider when voting. In the past this has consistently never worked out. These sort of questions would be better off as a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; with specific winning criteria.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;How popularity contests should be answered&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Every answer must comply with the validity criterion given by the challenge. Answers that do not comply are invalid and will be removed.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Choose your language and solve the problem.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is (usually) not code golf, so readability usually matters. Do &lt;em&gt;not&lt;/em&gt; shrink your code to unreadable levels except if you think that this will either make it more popular or is a challenge requirement, but this is unlikely.  If readers can understand your code, they are more likely to like it, and thus upvote it.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can come back with more creative ideas and update your answer or create a new answer for distinct new ideas.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Think about nice, creative, interesting, innovative and smart ways to solve the problem. Sometimes (but not always) the simplest and most direct answer is boring and uninteresting, so work to make them pleasing to deserve upvotes.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-11T23:31:55.217" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9092" PostTypeId="2" ParentId="9090" CreationDate="2016-05-02T21:05:29.920" Score="13" Body="&lt;h1&gt;Yes, let's do this&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The implementation should be:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Make a meta post where people can nominate the any challenge.  People vote on challenges based on:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The quality of the challenge&lt;/li&gt;&#xA;&lt;li&gt;If there is sufficient room for many distinct answers (in the same language).  We want to avoid situations where identical answers are independently developed&lt;/li&gt;&#xA;&lt;li&gt;Difficulty of the challenge.  The tour shouldn't be infeasibly difficult, nor trivially easy.  Ideally, we'd have challenges across the entire range of difficulty.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;I think that 25 questions is a good amount&lt;/li&gt;&#xA;&lt;li&gt;After voting is finished, a meta post is created that links to all 25 challenges.  Each of the challenges gets and edit with a link of &lt;strong&gt;Tour Challenge # of 25&lt;/strong&gt; that links back to the meta post.  I believe that adding a link on the challenge is necessary because:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It helps people discover the tour itself.  There are people that never visit our meta, and the tour page may rarely get edited.&lt;/li&gt;&#xA;&lt;li&gt;It makes for easy navigation&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;Finishers are added to the Tour meta post.  Optionally, an answer can be put on the Tour post that highlights awesome answers from a particular finisher.  It would also be &lt;em&gt;awesome&lt;/em&gt; if there was a custom badge we could give out.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;What if we do multiple tours?&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Completing a tour is supposed to be a &lt;em&gt;big deal&lt;/em&gt;.  If there are a bunch of tours, then completing one of them matters less.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, I'm not entirely against multiple tours, but they would need to be a rare event (like once a year).  Ideally, future tours would also be themed, so that each tour is &lt;em&gt;standalone&lt;/em&gt;, ensuring that completing a tour is a big deal.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="46231" LastEditDate="2016-05-08T00:23:56.510" LastActivityDate="2016-05-08T00:23:56.510" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="9093" PostTypeId="1" CreationDate="2016-05-03T04:46:09.647" Score="22" ViewCount="3181" Body="&lt;p&gt;I do not feel that the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;default general acceptable I/O methods&lt;/a&gt; sufficiently cover &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; challenges. So I would like to poll.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What are the default acceptable I/O methods specifically for image related challenges?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please post each I/O method, one per answer.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2016-05-11T18:35:34.833" Title="Default acceptable image I/O methods for image related challenges" Tags="|discussion|policy|defaults|image-processing|graphical-output|" AnswerCount="12" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9094" PostTypeId="2" ParentId="9093" CreationDate="2016-05-03T04:48:51.100" Score="15" Body="&lt;h1&gt;Programs may take input via a common raster graphics image format&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The common raster graphics image formats are &lt;code&gt;.png&lt;/code&gt;, &lt;code&gt;.jpg&lt;/code&gt;, &lt;code&gt;.tga&lt;/code&gt;, &lt;code&gt;.ppm&lt;/code&gt;, &lt;code&gt;.gif&lt;/code&gt;, &lt;code&gt;.bmp&lt;/code&gt;, &lt;code&gt;.tiff&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input may be through a default allowed input method, e.g. a filename, stdin, function argument, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you feel that an image format is left out, please leave a comment.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastEditorUserId="4162" LastEditDate="2016-05-10T13:55:05.833" LastActivityDate="2016-05-10T13:55:05.833" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9095" PostTypeId="2" ParentId="9093" CreationDate="2016-05-03T04:50:24.450" Score="18" Body="&lt;h1&gt;Programs may output via a common raster graphics image format&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The common raster graphics image formats are &lt;code&gt;.png&lt;/code&gt;, &lt;code&gt;.jpg&lt;/code&gt;, &lt;code&gt;.tga&lt;/code&gt;, &lt;code&gt;.ppm&lt;/code&gt;, &lt;code&gt;.gif&lt;/code&gt;, &lt;code&gt;.bmp&lt;/code&gt;, &lt;code&gt;.tiff&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output may be through a default allowed output method, e.g. a filename, stdout, function return, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you feel that an image format is left out, please leave a comment.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastEditorUserId="4162" LastEditDate="2016-05-11T18:35:34.833" LastActivityDate="2016-05-11T18:35:34.833" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9096" PostTypeId="2" ParentId="9093" CreationDate="2016-05-03T04:52:46.167" Score="17" Body="&lt;h1&gt;Programs may output by displaying it on screen&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Displaying the output image on screen is an acceptable form of output.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastActivityDate="2016-05-03T04:52:46.167" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9097" PostTypeId="2" ParentId="9093" CreationDate="2016-05-03T04:58:16.633" Score="10" Body="&lt;h1&gt;Programs may output via a common vector graphics image format&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The common vector graphics image formats are &lt;code&gt;.svg&lt;/code&gt; and a &lt;code&gt;&amp;lt;canvas&amp;gt;&lt;/code&gt; HTML block.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output may be through a default allowed output method, e.g. a file, stdout, function return, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you feel that an image format is left out, please leave a comment.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastActivityDate="2016-05-03T04:58:16.633" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9098" PostTypeId="2" ParentId="9093" CreationDate="2016-05-03T05:03:41.367" Score="-4" Body="&lt;h1&gt;Programs may take input via a common vector graphics image format&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The common vector graphics image formats are &lt;code&gt;.svg&lt;/code&gt; and a &lt;code&gt;&amp;lt;canvas&amp;gt;&lt;/code&gt; HTML block.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input may be through a default allowed input method, e.g. a filename, stdin, function argument, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you feel that an image format is left out, please leave a comment.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastActivityDate="2016-05-03T05:03:41.367" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9099" PostTypeId="2" ParentId="9093" CreationDate="2016-05-03T05:15:47.710" Score="7" Body="&lt;h1&gt;Programs may take input as an array of RGB pixel values with dimensions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The pixels are ordered from top-to-bottom, left-to-right (reading order), and the pixel values may be given as (R, G, B) tuples, or all concatenated into one big array.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The latter one big array is useful for example for C, where image I/O is often done by the function signature &lt;code&gt;void f(unsigned char* p, int w, int h)&lt;/code&gt;, and &lt;code&gt;(p[0], p[1], p[2])&lt;/code&gt; is the first RGB pixel tuple.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As the pixel array does not store dimensions, they can be given as extra arguments.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastActivityDate="2016-05-03T05:15:47.710" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9100" PostTypeId="2" ParentId="9093" CreationDate="2016-05-03T05:18:42.083" Score="11" Body="&lt;h1&gt;A component of a pixel may be input or output as an integer 0-255&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is not an input method on its own, but input methods that take or return a collection of individual pixels, may input or output a component of such a value as an integer in the range 0-255, where 0 is the least intense, and 255 is maximum intensity.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastEditorUserId="4162" LastEditDate="2016-05-03T05:27:41.710" LastActivityDate="2016-05-03T05:27:41.710" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9101" PostTypeId="2" ParentId="9093" CreationDate="2016-05-03T05:20:22.750" Score="7" Body="&lt;h1&gt;A component of a pixel may be input or output as a real number between 0 and 1&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is not an input method on its own, but input methods that take or return a collection of individual pixels, may input or output a component of such a value as a real number in the range 0-1, where 0 is the least intense, and 1 is maximum intensity.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastEditorUserId="4162" LastEditDate="2016-05-03T05:27:31.677" LastActivityDate="2016-05-03T05:27:31.677" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9103" PostTypeId="2" ParentId="9093" CreationDate="2016-05-03T05:26:15.827" Score="10" Body="&lt;h1&gt;Programs may take input as a matrix of RGB pixel values&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The matrix rows must match the image rows, the matrix columns must match the image columns, and the pixel values must be given as (R, G, B) tuples.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastActivityDate="2016-05-03T05:26:15.827" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9104" PostTypeId="2" ParentId="9093" CreationDate="2016-05-03T05:28:46.433" Score="14" Body="&lt;h1&gt;Programs may output as a matrix of RGB pixel values&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The matrix rows must match the image rows, the matrix columns must match the image columns, and the pixel values must be given as (R, G, B) tuples.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastActivityDate="2016-05-03T05:28:46.433" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9105" PostTypeId="2" ParentId="9093" CreationDate="2016-05-03T05:30:54.367" Score="9" Body="&lt;h1&gt;Programs may output via an array of RGB pixel values with dimensions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The pixels are ordered from top-to-bottom, left-to-right (reading order), and the pixel values must be output as (R, G, B) tuples, or all concatenated into one big array.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a pixel array does not store dimensions, they must be output as additional information.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastActivityDate="2016-05-03T05:30:54.367" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9107" PostTypeId="2" ParentId="9090" CreationDate="2016-05-03T07:13:52.403" Score="2" Body="&lt;h2&gt;Yes, that would be awesome!&lt;/h2&gt;&#xA;&lt;p&gt;I love the idea presented by @NathanMerrill, and his approache overall. But I think an other point of view would not harm.&lt;/p&gt;&#xA;&lt;p&gt;I think we should focus on re-discovering old-challenges, going with the principle that we have done some great work untill now, and most of our challenge are of great quality.&lt;/p&gt;&#xA;&lt;p&gt;I see this challenge tour as something that will change with time, proposing new challenge on a monthly/bimonthly basis.&lt;/p&gt;&#xA;&lt;p&gt;The implementation of such a tour would be&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Pick 10-15 challenges&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;pick challenges from a lot of different tags (to provide content for every needs)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This part could be done with a script, the returned question could then be reviewed to see if they are good enough&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It could also be handpicked, but would then require a vote for each rotation, making it happens on a quaterly basis would then be better&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Create a meta post containing this 10-15 challenges&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;name this post &lt;strong&gt;Challenge Tour n°#&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;pin it so it can be seen on the main site&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;I don't think we need any kind of reward for the people answering these challenge, having the opportunity to discover some new challenges is rewarding in itself.&lt;/p&gt;&#xA;" OwnerUserId="41019" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-04T06:46:33.073" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9112" PostTypeId="2" ParentId="9093" CreationDate="2016-05-04T04:23:57.663" Score="6" Body="&lt;h2&gt;Input and output may be done with builtin image data types from the language and/or library being used&lt;/h2&gt;&#xA;&lt;p&gt;For example, in Python with PIL, a &lt;code&gt;PIL.Image&lt;/code&gt; object would be a valid input and output format.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-04T04:23:57.663" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9113" PostTypeId="2" ParentId="2140" CreationDate="2016-05-04T13:56:18.707" Score="-2" Body="&lt;h1&gt;2 Pass Hello world&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hello-world&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hello-world&amp;#39;&quot; rel=&quot;tag&quot;&gt;hello-world&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There you go, your first &quot;Hello world&quot; is displayed on your terminal. You think about your next step into becoming a wizard. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You've heard about this fancy new programming language, but you're not sure you understand it perfectly. So you want to go over a new &quot;Hello world&quot; tutorial again. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;How boring!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Instead you have a good idea, using your knowledge of the &lt;strong&gt;first&lt;/strong&gt; programming language to create a &quot;Hello world&quot; program in the &lt;strong&gt;second&lt;/strong&gt; programming language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Exemple:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;console.log('print &quot;Hello world&quot;');&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Evaluated in javascript output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;print &quot;Hello world&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which, evaluated in python 2.X output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;Hello world&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Nice, but, can it be &lt;strong&gt;shorter&lt;/strong&gt;?&lt;/p&gt;&#xA;" OwnerUserId="42825" LastEditorUserId="41024" LastEditDate="2016-08-03T20:04:52.213" LastActivityDate="2016-08-03T20:04:52.213" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="9114" PostTypeId="2" ParentId="2140" CreationDate="2016-05-04T16:06:00.883" Score="1" Body="&lt;h2&gt;The incremental Gijswijt's sequence&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/78787/generate-n-digits-of-gijswijts-sequence&quot;&gt;The Gijswijt's sequence&lt;/a&gt; &lt;strong&gt;G&lt;/strong&gt; is a sequence where the next term is the maximal number of repeating blocks of terms going so far backward.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first numbers of this series are: &lt;a href=&quot;https://oeis.org/A090822&quot; rel=&quot;nofollow noreferrer&quot;&gt;1, 1, 2, 1, 1, 2, 2, 2, 3&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The incremental Gijswijt's sequence &lt;strong&gt;I&lt;/strong&gt; is a sequence of Gijswijt's indices where any term of this last sequence I(n) has an image in Gijswijt G(I(n)) that is greater or equal all terms that precede it in that sequence G .&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In other terms, It is an increasing sequence of indexes i for which G(i) is at least as large as G(j) for any j &amp;lt; i. Thus it contains the index of every 1 up to the first 2, every 2 up to the first 3, etc&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  G= 1, 1, 2, 1, 1, 2, 2, 2, 3, 1, 1, 2, 1, 1, 2, 2, 2, 3, 2, 1, 1, 2, 1, 1, 2, 2, 2, 3, 1, 1, 2, 1, 1, 2, 2, 2, 3,...&#xA;&#xA;  I= 1, 2, 3,       6, 7, 8, 9,                        18,                           28,                        37,...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your program must output the most you can print from the starting of sequence until the delay between printing two consecutive terms exceeds 10 minutes, the actual number of outputs is your score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For matter of reliability, the complete accurate &quot;run-lengthed&quot; G sequence must be linked through pastbin or any raw data repository.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;the output will be so large to fit an int32 registry, so i suggest to print it modulo 1000007 or dont.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;if the scores are not be divergent enough i will apply some salt, scoring is evaluated to N/T where T is executon time in seconds for the last term of sequence, the tie broken by the earlier post .&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Only another 45 secs after the delay cap are given as an extra time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="38337" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:21.580" LastActivityDate="2016-05-07T10:39:59.917" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="9116" PostTypeId="2" ParentId="2140" CreationDate="2016-05-05T01:52:20.750" Score="0" Body="&lt;h1&gt;Solve for the Operators&lt;/h1&gt;&#xA;&lt;p&gt;In this challenge, you will be given a bunch of numbers and an answer. Your job is to find a sequence of operators that will successfully solve this equation. &lt;strong&gt;Use the numbers in the order that they are given&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Operators: +, -, *, /&lt;/p&gt;&#xA;&lt;p&gt;For example,&lt;/p&gt;&#xA;&lt;p&gt;Numbers given: 2, 6, 8, 4, 5&lt;/p&gt;&#xA;&lt;p&gt;Answer: 9&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2__3__8__4__5 = 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The program should find which operators can be used in the blanks to make the equation true. &lt;strong&gt;Remember Order of Operations Matters (PEMDAS)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2*3-8/4+5 = 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Only 1 solution is needed per problem&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;No built-in math functions beyond operators.&lt;/li&gt;&#xA;&lt;li&gt;Must Follow Order of Operations&lt;/li&gt;&#xA;&lt;li&gt;Must give one correct output.&lt;/li&gt;&#xA;&lt;li&gt;Least Number of Bytes Wins.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Examples:&lt;/h3&gt;&#xA;&lt;p&gt;Numbers: 4, 4, 4, 4&lt;/p&gt;&#xA;&lt;p&gt;Answer: 0&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;4 - 4 + 4 + 4 = 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Numbers: 1, 8, 6, 4, 5, 2, 3, 3&lt;/p&gt;&#xA;&lt;p&gt;Answer: -35&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1*8+6-4*5*2-3*3 = -35&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Numbers: 1, -2&lt;/p&gt;&#xA;&lt;p&gt;Answer: 3&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1--2 = 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="53465" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-05T01:52:20.750" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9120" PostTypeId="2" ParentId="9038" CreationDate="2016-05-05T12:19:58.263" Score="2" Body="&lt;p&gt;The tag name is quite undescriptive, so I suggest removing or renaming the tag:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If the tag is removed, I think these challenges would still fit under &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; as we basically have a length restriction on the source code.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Otherwise I suggest renaming it to something like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-size&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-size&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-size&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="24877" LastActivityDate="2016-05-05T12:19:58.263" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9122" PostTypeId="1" AcceptedAnswerId="9123" CreationDate="2016-05-06T00:59:04.777" Score="12" ViewCount="271" Body="&lt;p&gt;We have a tag: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/word&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;word&amp;#39;&quot; rel=&quot;tag&quot;&gt;word&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I see no value in this tag. Here's from the wiki:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h3&gt;Use this tag for:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Challenges involving generating words&lt;/li&gt;&#xA;&lt;li&gt;Challenges involving using words&lt;/li&gt;&#xA;&lt;li&gt;Challenges involving manipulating words&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Or other cases where words are a large part of the challenge.&lt;/p&gt;&#xA;&lt;h3&gt;Do not use this tag for:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Challenges based on printing a &lt;em&gt;predefined&lt;/em&gt; string, e.g. &amp;quot;Hello, World!&amp;quot; challenges.&lt;/li&gt;&#xA;&lt;li&gt;Challenges where the input or output are words, but it doesn't add much to the challenge.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I think this tag is extremely broad, and not helpful at all. Can you be an expert in words? &lt;em&gt;Sure&lt;/em&gt;, you can, but not in the context of a programming &lt;s&gt;Q&amp;amp;A site&lt;/s&gt; challenge site.&lt;/p&gt;&#xA;&lt;p&gt;This is pretty much a subtag of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;, seeing as how challenges involving &lt;em&gt;words&lt;/em&gt; are usually challenges about strings that just so happen to also be words.&lt;/p&gt;&#xA;&lt;p&gt;However, specific tagging is never a bad thing, and most of the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/word&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;word&amp;#39;&quot; rel=&quot;tag&quot;&gt;word&lt;/a&gt; challenges have one thing in common. They're about language processing. For example:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/11877/31716&quot;&gt;Generate a pronouncable word&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/45295/31716&quot;&gt;Is this even a word?&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/71078/31716&quot;&gt;What language is this word?&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/73344/31716&quot;&gt;Word or near-word?&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/natural-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;natural-language&amp;#39;&quot; rel=&quot;tag&quot;&gt;natural-language&lt;/a&gt; tag is for&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Problems involving processing of natural languages in a human way. Task such as interpreting free text, correcting spell or grammar, understanding pronunciation etc.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Most of these word challenges are &lt;em&gt;also&lt;/em&gt; about processing natural languages in a human way. The few that aren't are just adding extra noise.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt; Let's merge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/word&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;word&amp;#39;&quot; rel=&quot;tag&quot;&gt;word&lt;/a&gt; into &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/natural-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;natural-language&amp;#39;&quot; rel=&quot;tag&quot;&gt;natural-language&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-15T13:43:45.043" Title="I'd like to say a [word] or two about this tag" Tags="|discussion|tags|tag-synonyms|" AnswerCount="1" CommentCount="0" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9123" PostTypeId="2" ParentId="9122" CreationDate="2016-05-06T01:02:41.530" Score="17" Body="&lt;p&gt;I agree, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/word&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;word&amp;#39;&quot; rel=&quot;tag&quot;&gt;word&lt;/a&gt; should become &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/natural-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;natural-language&amp;#39;&quot; rel=&quot;tag&quot;&gt;natural-language&lt;/a&gt;. We could either retag the current 26 challenges bearing that tag (not all at once) or make &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/word&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;word&amp;#39;&quot; rel=&quot;tag&quot;&gt;word&lt;/a&gt; a synonym of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/natural-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;natural-language&amp;#39;&quot; rel=&quot;tag&quot;&gt;natural-language&lt;/a&gt;. I propose we do the latter.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; To vote on the proposed synonym, go &lt;a href=&quot;https://codegolf.stackexchange.com/tags/natural-language/synonyms&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-05-06T03:22:32.417" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="9124" PostTypeId="2" ParentId="2140" CreationDate="2016-05-06T17:34:07.930" Score="0" Body="&lt;p&gt;&lt;strong&gt;Make a times table sheet&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The challenge is to make an ascii art version of a times table sheet.&lt;/p&gt;&#xA;&lt;p&gt;Look at the following:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/HJDCP.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/HJDCP.gif&quot; alt=&quot;times tables&quot; /&gt;&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your answer should have the same layout as this table:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You should not include the title or the footer or worry about colors. Black and white is fine.&lt;/li&gt;&#xA;&lt;li&gt;The times tables lines in each box should be randomly ordered.&lt;/li&gt;&#xA;&lt;li&gt;You should include all the horizontal and vertical lines in the image (except in the header and footer).&lt;/li&gt;&#xA;&lt;li&gt;The equals signs should be aligned in each column as in the example  above.&lt;/li&gt;&#xA;&lt;li&gt;It should be in ASCII art.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I am not worried about the precise spacing as long as the layout is as specified.&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user9206" LastEditorUserId="-1" LastEditorDisplayName="user9206" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-06T18:39:43.377" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9125" PostTypeId="2" ParentId="2140" CreationDate="2016-05-07T03:03:04.340" Score="0" Body="&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Create a factor tree from a number. A factor tree will take a number &gt; 1, &lt;code&gt;n&lt;/code&gt;, and find 2 numbers that multiply together to equal &lt;code&gt;n&lt;/code&gt; that are greater than 1. Then, it will repeat for the factors until every section reaches a number that does. Then it will output the last numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/cuKNv.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/cuKNv.gif&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;n = 20&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Graph(This is not the output):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/O7TSN.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/O7TSN.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: &lt;code&gt;2x2x2x3&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;n = 54&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;code&gt;2x3x3x3&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;n = 72&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: &lt;code&gt;3x3x2x2x2&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;n = 2&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: &lt;code&gt;2&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Shortest bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="53465" LastEditorUserId="53465" LastEditDate="2016-05-07T03:18:31.507" LastActivityDate="2016-05-07T03:18:31.507" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9126" PostTypeId="1" CreationDate="2016-05-07T10:29:15.587" Score="7" ViewCount="556" Body="&lt;p&gt;First of all I want to mention that I use declarative set-based approach. So most (if no every) of my answer will be one statement without procedural part(user-defined functions, loops, control flow statements and so on).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With SQL as first language I am 99% sure I cannot win any challenge, but it is not the case. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Suppose we have question like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/79264/briefest-code-to-find-vowels-and-print-consonants/79325#79325&quot;&gt;Briefest code to find vowels and print consonants&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;1) Input as subquery&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;SELECT v&quot;Enter string:&quot;,string_agg(r,', 'ORDER BY n)&quot;Vowel Count:&quot;,TRANSLATE(v,'aeyiou','')&quot;Remaining characters:&quot;&#xA;FROM(SELECT text'LoremIpsumDolorSitAmetConsecuteurAdipscingElit!'v)s&#xA;,LATERAL(SELECT c||': '||LENGTH(v)-LENGTH(REPLACE(v,c,''))r,n FROM(VALUES('a',1),('e',2),('i',3),('o',4),('u',5))t(c,n))b&#xA;GROUP BY v&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;kbd&gt;&lt;strong&gt;&lt;a href=&quot;http://sqlfiddle.com/#!15/9eecb7db59d16c80417c72d1e1f4fbf1/8282/0&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;SqlFiddleDemo&lt;/code&gt;&lt;/a&gt;&lt;/strong&gt;&lt;/kbd&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As you can see the input is subquery. &lt;code&gt;(SELECT text'LoremIpsumDolorSitAmetConsecuteurAdipscingElit!'v)s&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I count it as empty:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(SELECT text''v)s  -- 17 characters&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This approach forces me to:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;☒ Unnecessary subquery&lt;/li&gt;&#xA;&lt;li&gt;☒ Often casting types needed&lt;/li&gt;&#xA;&lt;li&gt;☒ One input per statement(could use &lt;code&gt;VALUES&lt;/code&gt; or &lt;code&gt;UNION ALL&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;☑ Fully-contained one query&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;2) Create structures&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-- preparing input&#xA;CREATE TABLE s(v text);&#xA;INSERT INTO s(v)&#xA;VALUES ('LoremIpsumDolorSitAmetConsecuteurAdipscingElit!'),('SQL rulez');&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;main query:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;SELECT v&quot;Enter string:&quot;,string_agg(r,', 'ORDER BY n)&quot;Vowel Count:&quot;,TRANSLATE(v,'aeyiou','')&quot;Remaining characters:&quot;&#xA;FROM s&#xA;,LATERAL(SELECT c||': '||LENGTH(v)-LENGTH(REPLACE(v,c,''))r,n FROM(VALUES('a',1),('e',2),('i',3),('o',4),('u',5))t(c,n))b&#xA;GROUP BY v&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;kbd&gt;&lt;strong&gt;&lt;a href=&quot;http://sqlfiddle.com/#!15/f1b88/1/0&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;SqlFiddleDemo&lt;/code&gt;&lt;/a&gt;&lt;/strong&gt;&lt;/kbd&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My input is simply &lt;code&gt;FROM s&lt;/code&gt; -- 1 character comparing to 17 before&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With this approach:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;☑ More readable solution&lt;/li&gt;&#xA;&lt;li&gt;☑ I could provide multiple inputs at once&lt;/li&gt;&#xA;&lt;li&gt;☒ Often need to add &lt;code&gt;GROUP BY&lt;/code&gt; to handle multiple cases&lt;/li&gt;&#xA;&lt;li&gt;☒ 3 statmenents instead of one&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Should I count &lt;code&gt;preparing input&lt;/code&gt; phase?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;3) Input as common-table expression&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;WITH s(v) AS&#xA;(  SELECT 'LoremIpsumDolorSitAmetConsecuteurAdipscingElit!'::text&#xA;   UNION SELECT 'SQL rulez'&#xA;   UNION SELECT 'Just one more row'&#xA;)&#xA;SELECT v&quot;Enter string:&quot;,string_agg(r,', 'ORDER BY n)&quot;Vowel Count:&quot;,TRANSLATE(v,'aeyiou','')&quot;Remaining characters:&quot;&#xA;FROM s&#xA;,LATERAL(SELECT c||': '||LENGTH(v)-LENGTH(REPLACE(v,c,''))r,n FROM(VALUES('a',1),('e',2),('i',3),('o',4),('u',5))t(c,n))b&#xA;GROUP BY v&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;kbd&gt;&lt;strong&gt;&lt;a href=&quot;http://sqlfiddle.com/#!15/9eecb7db59d16c80417c72d1e1f4fbf1/8380/0&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;SqlFiddleDemo&lt;/code&gt;&lt;/a&gt;&lt;/strong&gt;&lt;/kbd&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This approach:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;☑ One statement solution&lt;/li&gt;&#xA;&lt;li&gt;☑ Clear distinction input-main query&lt;/li&gt;&#xA;&lt;li&gt;☑ Can handle multiple input at once&lt;/li&gt;&#xA;&lt;li&gt;☒ Very long&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Could I just count main query?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;4) Input as variable&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;DECLARE @ VARCHAR(100)='My input string'&#xA;&#xA;SELECT LEN(@)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;☑ Clear indication where input is&lt;/li&gt;&#xA;&lt;li&gt;☑/☒ If not table variable one input only&lt;/li&gt;&#xA;&lt;li&gt;☑ Often does not even need the &lt;code&gt;FROM&lt;/code&gt; clause and type is known&lt;/li&gt;&#xA;&lt;li&gt;☒ Multistatement solution&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;To sum up:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Which approach is preferable?&lt;/li&gt;&#xA;&lt;li&gt;Should I count input with 2/3/4 cases?&lt;/li&gt;&#xA;&lt;li&gt;Handling multiple cases at once will add overhead (grouping/over() clause). Should I take it in consideration and use shorter solution but with one input only (applicable 2/3)?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="44651" LastEditorUserId="46076" LastEditDate="2020-07-27T23:32:21.753" LastActivityDate="2020-07-27T23:32:21.753" Title="How should I count bytes with SQL?" Tags="|discussion|scoring|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9127" PostTypeId="2" ParentId="2140" CreationDate="2016-05-07T14:10:12.633" Score="0" Body="&lt;h1&gt;Inverse Square Probability&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;It's a fairly well-known fact that the sum of the reciprocals of squares is equal to pi squared divided by 6. That is,&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/sNiXZ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/sNiXZ.png&quot; alt=&quot;Basel Problem&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is the &lt;a href=&quot;https://en.wikipedia.org/wiki/Basel_problem&quot; rel=&quot;nofollow noreferrer&quot;&gt;Basel problem&lt;/a&gt; and was solved by Euler in 1735. I was thinking about generating a random patchwork of squares and trying to decide how to weight the probabilities of different square sizes, when it occurred to me that I could use this fact and make the probability of choosing a square's size be the inverse of its size.&lt;/p&gt;&#xA;&lt;p&gt;For instance, if I pick a random point on the interval &lt;code&gt;[0..pi^2/6)&lt;/code&gt;, then based on the point I pick, &lt;code&gt;r&lt;/code&gt;, I can translate it to a square size in the following manner (all numbers rounded to 3 decimal places):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0     &amp;lt;= r &amp;lt; 1     =&amp;gt; s = 1&#xA;1     &amp;lt;= r &amp;lt; 1.25  =&amp;gt; s = 2&#xA;1.25  &amp;lt;= r &amp;lt; 1.361 =&amp;gt; s = 3&#xA;1.361 &amp;lt;= r &amp;lt; 1.424 =&amp;gt; s = 4&#xA;1.424 &amp;lt;= r &amp;lt; 1.464 =&amp;gt; s = 5&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your program or function should work for any input within the limits of your language (for instance, floating point precision, lack of built-in bignum capabilities, etc). Input will always be &lt;code&gt;0 &amp;lt;= r &amp;lt; pi^2/6&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;{to be added}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="12914" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-07T14:10:12.633" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9129" PostTypeId="2" ParentId="2140" CreationDate="2016-05-07T20:27:50.007" Score="3" Body="&lt;h1&gt;The Fast and The Fourier&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Implement the Discrete Fourier Transform (DFT) for a sequence of any length using a Fast Fourier Transform algorithm (FFT). This may implemented as either a function or a program and the sequence can be given as either an argument or using standard input. A DFT has time complexity of &lt;em&gt;O&lt;/em&gt;(&lt;em&gt;n&lt;/em&gt;&lt;sup&gt;2&lt;/sup&gt;) whereas a FFT has time complexity of &lt;em&gt;O&lt;/em&gt;(&lt;em&gt;n&lt;/em&gt; log &lt;em&gt;n&lt;/em&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The algorithm will compute a result based on standard DFT in the forward direction. The input sequence has length &lt;em&gt;n&lt;/em&gt; and consists of the complex values {&lt;em&gt;x&lt;/em&gt;&lt;sub&gt;0&lt;/sub&gt;, &lt;em&gt;x&lt;/em&gt;&lt;sub&gt;1&lt;/sub&gt;, ..., &lt;em&gt;x&lt;/em&gt;&lt;sub&gt;&lt;em&gt;n&lt;/em&gt;-1&lt;/sub&gt;}. The output sequence will have the same length and consists of {&lt;em&gt;y&lt;/em&gt;&lt;sub&gt;0&lt;/sub&gt;, &lt;em&gt;y&lt;/em&gt;&lt;sub&gt;1&lt;/sub&gt;, ..., &lt;em&gt;y&lt;/em&gt;&lt;sub&gt;&lt;em&gt;n&lt;/em&gt;-1&lt;/sub&gt;} is defined by the relation below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/FrcIr.png&quot; alt=&quot;DFT&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Bluestein's algorithm&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;One algorithm that meets these requirements &lt;a href=&quot;https://en.wikipedia.org/wiki/Chirp_Z-transform#Bluestein.27s_algorithm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Bluestein's algorithm&lt;/a&gt;. It is a special case of the Chirp-Z transform and is able to compute the FFT for a sequence of any length &lt;em&gt;n&lt;/em&gt; by transforming it in order to solve it as a cyclic convolution which can be solved with a time complexity of &lt;em&gt;O&lt;/em&gt;(&lt;em&gt;n&lt;/em&gt; log &lt;em&gt;n&lt;/em&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Keep in mind that it is not required that you only use this algorithm in your implementation. If you know a better way, feel free to use it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First, an identity is used to rewrite the initial DFT in a form where a convolution can easily be recognized.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/SUUwC.png&quot; alt=&quot;Chirp transform&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can obtain two sequences from this new form&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/yaM0I.png&quot; alt=&quot;Chirp sequences&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;which allow you to write the DFT as a convolution of two sequences.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/VuNXI.png&quot; alt=&quot;Chirp convolve&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sample&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Get the input&#xA;    x = [1, 2, 3, 4, 5]&#xA;&#xA;Get the length of the input&#xA;    n = 5&#xA;&#xA;Compute the 'a' sequence&#xA;    a = [1, 1.618 - 1.176j, -2.427 - 1.763j, 3.236 + 2.351j, -4.045 + 2.939j]&#xA;&#xA;Compute the 'b' sequence&#xA;    b = [1, 0.809 + 0.588j, -0.809 + 0.588j, 0.809 - 0.588j, -0.809 - 0.588j]&#xA;&#xA;Compute the convolution of 'a' and 'b' (using summation)&#xA;    y[0] = (a[0]*b[0] + a[1]*b[1] + a[2]*b[2] + a[3]*b[3] + a[4]*b[4]) / b[0]&#xA;         = 15 / 1 = 15&#xA;&#xA;    y[1] = (a[1]*b[0] + a[0]*b[1] + a[2]*b[1] + a[3]*b[2] + a[4]*b[3]) / b[1]&#xA;         = (-4.045 + 1.314j) / (0.809 + 0.588j) = -2.5 + 3.441j&#xA;&#xA;    y[2] = (a[2]*b[0] + a[1]*b[1] + a[3]*b[1] + a[0]*b[2] + a[4]*b[2]) / b[2]&#xA;         = (1.545 - 2.127j) / (-0.809 + 0.588j) = -2.5 + 0.813j&#xA;&#xA;    y[3] = (a[3]*b[0] + a[2]*b[1] + a[4]*b[1] + a[1]*b[2] + a[0]*b[3]) / b[3]&#xA;         = (-2.5 + 0.813j) / (0.809 - 0.588j) = -2.5 - 0.813j&#xA;&#xA;    y[4] = (a[4]*b[1] + a[3]*b[1] + a[2]*b[2] + a[1]*b[3] + a[0]*b[4]) / b[4]&#xA;         = 4.253j / (-0.809 - 0.588j) = -2.5 - 3.441j&#xA;&#xA;The Fourier tranform of x&#xA;    y = [15, -2.5 + 3.441j, -2.5 + 0.813j, -2.5 - 0.813j, -2.5 - 3.441j]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest solution wins.&lt;/li&gt;&#xA;&lt;li&gt;Builtins that compute FFT in forward or backward (also known as inverse) directions are not allowed.&lt;/li&gt;&#xA;&lt;li&gt;Builtins that compute the convolution are not allowed. (Most will have not been allowed by the previous rule as they use FFT internally.)&lt;/li&gt;&#xA;&lt;li&gt;Your solution must have time complexity of &lt;em&gt;O&lt;/em&gt;(&lt;em&gt;n&lt;/em&gt; log &lt;em&gt;n&lt;/em&gt;) where &lt;em&gt;n&lt;/em&gt; is the length of the input sequence.&lt;/li&gt;&#xA;&lt;li&gt;Floating-point inaccuracies will not be counted against you.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;FFT([1, 1, 1, 1]) = [4, 0, 0, 0]&#xA;FFT([1, 0, 2, 0, 3, 0, 4, 0]) = [10, -2+2j, -2, -2-2j, 10, -2+2j, -2, -2-2j]&#xA;FFT([1, 2, 3, 4, 5]) = [15, -2.5+3.44j, -2.5+0.81j, -2.5-0.81j, -2.5-3.44j]&#xA;FFT([5-3.28571j, -0.816474-0.837162j, 0.523306-0.303902j, 0.806172-3.69346j, -4.41953+2.59494j, -0.360252+2.59411j, 1.26678+2.93119j] = [2, -3j, 5, -7j, 11, -13j, 17]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Related&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/82631/compute-the-discrete-fourier-transform&quot;&gt;Compute the Discrete Fourier Transform&lt;/a&gt; - This contains some implementations for the standard DFT algorithm which has time complexity &lt;em&gt;O&lt;/em&gt;(&lt;em&gt;n&lt;/em&gt;&lt;sup&gt;2&lt;/sup&gt;). You'll want to understand how to implement this before trying FFT.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/12420/too-fast-too-fourier-fft-code-golf&quot;&gt;Too Fast, Too Fourier: FFT Code Golf&lt;/a&gt; - This previous challenge is the precursor to the current challenge here. Before, you only had to consider sequences where the length &lt;em&gt;n&lt;/em&gt; was a power of 2 which allowed for simpler recursive implementations. The difference here is that you now have to implement an FFT algorithm that will work for sequences with any length.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="6710" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:21.580" LastActivityDate="2016-07-11T18:54:27.670" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9134" PostTypeId="2" ParentId="9027" CreationDate="2016-05-08T20:30:23.057" Score="3" Body="&lt;h1&gt;Yes, that is allowed.&lt;/h1&gt;&#xA;&lt;p&gt;It is almost the same as a list, in the sense that it doesn't output each term individually automatically.&lt;/p&gt;&#xA;&lt;p&gt;Like cat pointed out, this is a lot like a python generator, which is an acceptable output format as far as I know.&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-08T20:30:23.057" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9135" PostTypeId="1" AcceptedAnswerId="9138" CreationDate="2016-05-08T21:27:17.427" Score="2" ViewCount="83" Body="&lt;p&gt;We all agree that using language features implemented after the question was asked &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4867/can-i-ever-answer-with-a-language-invented-after-the-challenge-was-posted&quot;&gt;makes the answer non-competing&lt;/a&gt;. But what about after an edit to the question?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Say Bob posts a &lt;s&gt;question&lt;/s&gt; challenge. I answer using a new super-cool part of my language as a non-competing answer. I then add another super-cool feature to my language and post a commit. Bob then edits the challenge so that the brand new feature becomes useful as well as the other feature.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is my answer now competing?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What if I remove the bits that make up the first feature that I actively used in my answer the first time round, only using my second super-cool feature which wasn't implemented/useful before the edit?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Can an edit to the challenge make language features that post date the challenge ever competing?&lt;/p&gt;&#xA;" OwnerUserId="32686" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2016-05-09T01:43:08.030" Title="Answer validility after edits" Tags="|discussion|policy|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9136" PostTypeId="2" ParentId="9135" CreationDate="2016-05-08T21:27:17.427" Score="1" Body="&lt;h2&gt;Yes,&lt;/h2&gt;&#xA;&lt;p&gt;Edits to a language that were made after the original challenge was posted that weren't useful in the original challenge are competing after an edit to the challenge which makes them useful are allowed.&lt;/p&gt;&#xA;" OwnerUserId="32686" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-08T21:27:17.427" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9137" PostTypeId="2" ParentId="2140" CreationDate="2016-05-08T22:04:53.573" Score="3" Body="&lt;h1&gt;Word Squares&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Create a function or program that given a list of words and size &lt;code&gt;n&lt;/code&gt; as arguments or standard input, outputs a word square with dimensions &lt;code&gt;n&lt;/code&gt; by &lt;code&gt;n&lt;/code&gt;. The output can be either formatted in a similar shape to a word square, or as a list of the words used in order by rows from the top and then by columns from the right.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Explanation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Word_square&quot; rel=&quot;nofollow noreferrer&quot;&gt;Word squares&lt;/a&gt; are a grid of letters that form words when read horizontally and vertically. The size of the square refers to the number of letters in each word.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a size 5 word square. The words formed by each row are &lt;em&gt;heart&lt;/em&gt;, &lt;em&gt;ember&lt;/em&gt;, &lt;em&gt;abuse&lt;/em&gt;, &lt;em&gt;resin&lt;/em&gt;, and &lt;em&gt;trend&lt;/em&gt;. In this example, the same words are formed by each column, but this is not a necessary condition.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;H E A R T&#xA;E M B E R&#xA;A B U S E&#xA;R E S I N&#xA;T R E N D&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Another example is this word square with size 4. The words formed by each row in this case are different from the words formed by each column.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;L A C K&#xA;I R O N&#xA;M E R E&#xA;B A K E&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest solution wins.&lt;/li&gt;&#xA;&lt;li&gt;Builtins that solve this and the standard loopholes are not allowed.&lt;/li&gt;&#xA;&lt;li&gt;The words must be from this dictionary. You can take the filename of the dictionary or the contents as input or as an argument. (Recommend a dictionary here that consists of only English alphabet letters, in all lowercase or all uppercase.)&lt;/li&gt;&#xA;&lt;li&gt;If no such word square can be found using the given dictionary, no output or a false (or falsey) value can be returned.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Test Case&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;n = 4, dictionary = ...&#xA;L A C K&#xA;I R O N&#xA;M E R E&#xA;B A K E&#xA;-- or --&#xA;LACK&#xA;IRON&#xA;MERE&#xA;BAKE&#xA;-- or --&#xA;[&quot;lack&quot;, &quot;iron&quot;, &quot;mere&quot;, &quot;bake&quot;, &quot;limb&quot;, &quot;area&quot;, &quot;cork&quot;, &quot;knee&quot;]&#xA;-- or --&#xA;[[&quot;lack&quot;, &quot;iron&quot;, &quot;mere&quot;, &quot;bake&quot;], [&quot;limb&quot;, &quot;area&quot;, &quot;cork&quot;, &quot;knee&quot;]]&#xA;-- or --&#xA;Similar to the above but with swapped cases.&#xA;The case is not important as long as it remains consistent.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="6710" LastActivityDate="2016-05-08T22:04:53.573" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9138" PostTypeId="2" ParentId="9135" CreationDate="2016-05-09T01:43:08.030" Score="7" Body="&lt;h2&gt;No&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm only saying this to be cautious, since the &quot;yes&quot; option is prone to abuse.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, suppose Bob posts a question but forgets to clarify something important. Since you have knowledge of the question now, you manage to predict what Bob forgot to clarify, and add a new feature to your language in anticipation of the certain eventual edit. Sure enough, someone now points out Bob's mistake, and Bob now updates the question with the edit you expected. In this situation, I don't think it would be fair for your solution to be competitive, since you added a feature with partial knowledge of the question.&lt;/p&gt;&#xA;" OwnerUserId="21487" LastActivityDate="2016-05-09T01:43:08.030" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9140" PostTypeId="1" CreationDate="2016-05-09T07:02:43.143" Score="11" ViewCount="610" Body="&lt;p&gt;As described in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9092/20198&quot;&gt;my last meta post&lt;/a&gt;, the purpose of this post is to nominate and vote on posts that deserve more visibility.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The criterion for voting and nomination include 4 aspects:  &lt;strong&gt;Quality, difficulty, acceptability, and visibility&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Quality:&lt;/strong&gt;  The post should be well written, and on-topic under our current guidelines.  Furthermore, the challenge should avoid practices that we are trying to move away from (such as arbitrary language restrictions, difficult I/O models, or pop-cons that don't need to be pop-cons)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Difficulty:&lt;/strong&gt;  Avoid the extremes:  Extremely difficult challenges may cause users to give up, and too many easy challenges makes completing the Tour less of an accomplishment.  &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Acceptability of new answers:&lt;/strong&gt;  Some problematic challenges include:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Challenges that are closed to new answers (most &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Challenges that don't work with a large amount of answers (most &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Challenges with little room for new, distinct answers (such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world&quot;&gt;&quot;Hello, World!&quot;&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Visibility:&lt;/strong&gt; We are actually looking for &lt;em&gt;lesser-known&lt;/em&gt; questions here.  While our &lt;a href=&quot;https://codegolf.stackexchange.com/questions/17005/produce-the-number-2014-without-any-numbers-in-your-source-code&quot;&gt;2014&lt;/a&gt; challenge may still be unseen by some of our newest users, we're hoping to introduce challenges to as many users as possible.  The &lt;em&gt;age&lt;/em&gt; of a challenge matters as well, but not as much as the &lt;em&gt;popularity&lt;/em&gt; of the challenge.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Remember, all of the above are &lt;em&gt;relative&lt;/em&gt; criterion.  The question doesn't have to be the ideal in all of the aspects, but a terrible question won't make the top 25.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Please include the tags of the question in your post so that we are able to easily choose a wide variety of questions&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-07-18T17:48:49.743" Title="Tour of PPCG: Voting Phase" Tags="|discussion|" AnswerCount="17" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9142" PostTypeId="2" ParentId="9140" CreationDate="2016-05-09T07:51:41.790" Score="-3" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/12368/print-every-character-your-program-doesnt-have&quot;&gt;Print every character your program doesn&amp;#39;t have&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's from 2013, so it's fairly old in terms of challenges.&lt;/li&gt;&#xA;&lt;li&gt;The newest solution was posted &lt;a href=&quot;https://codegolf.stackexchange.com/a/19717/45941&quot;&gt;over two years ago&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;It's one of our &lt;a href=&quot;https://codegolf.stackexchange.com/questions?sort=votes&quot;&gt;highest voted questions&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;It's a reasonably simple challenge that leads to interesting solutions.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Cons:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It has a lot of solutions in many different languages already, so the potential for duplicate solutions is high.&lt;/li&gt;&#xA;&lt;li&gt;Though it isn't as popular now, it was extremely popular when it was posted, so it may not be a great fit for the &amp;quot;lesser-known&amp;quot; criteria.&lt;/li&gt;&#xA;&lt;li&gt;There's a lot of abuse of loopholes that later became standard forbidden loopholes in the existing answers.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-10T04:31:45.123" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9143" PostTypeId="2" ParentId="9140" CreationDate="2016-05-09T14:47:15.550" Score="9" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/50484/ascii-art-of-the-day-1-double-knot&quot;&gt;ASCII Art of the Day #1 - Double Knot&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It has a solid spec&lt;/li&gt;&#xA;&lt;li&gt;It's part of a series, so users that enjoy the challenge will be able to find more like it&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Cons:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's newerish (Posted almost exactly a year ago)&lt;/li&gt;&#xA;&lt;li&gt;It doesn't have a large scope of possible answers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Trivia: The top answer outgolfs Dennis&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-09T14:52:35.973" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9145" PostTypeId="2" ParentId="2140" CreationDate="2016-05-09T19:27:07.553" Score="1" Body="&lt;h2&gt;Functional Programming in Your Language&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A lot of modern programming languages allow some form of functional programming, but I don't often see them used. I'm curious to see how different languages tackle problems that are naturally solved with some form of functional programming. The winning entry to this contest will have the shortest total code as measured in bytes for these four questions&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Given a three-part list, return a list containing only those members for which the third element is a string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;sampleIn1={{1,2,&quot;fred&quot;},{3,2,1.23},{3,2,&quot;this one too&quot;,1.23},{},{&quot;apple&quot;,&quot;banana&quot;,{1,2,3}}}&lt;/p&gt;&#xA;&#xA;&lt;p&gt;sampleOut1={{1,2,&quot;fred&quot;},{3,2,&quot;this one too&quot;,1.23}}&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Given a list of lists, each sub-list known to have exactly two elements, both of which are numbers, return a list of the first element in each sublist multiplied by the absolute value of the second.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;sampleIn2={{3,4},{-1,3},{1.0,-3}};&lt;/p&gt;&#xA;&#xA;&lt;p&gt;sampleOut2={12,-3,3.0}&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;In the sample output above I distinguish between integer and real output; in practice you can treat everything as a real number if you prefer.&lt;/p&gt;&#xA;&#xA;&lt;ol start=&quot;3&quot;&gt;&#xA;&lt;li&gt;&lt;p&gt;Given a list known to be composed only of numbers, return a list of the cube of each member, sorted by the square of each member (or its absolute value, which will have the same result).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;sampleIn3={1,-2,0.5,4};&lt;/p&gt;&#xA;&#xA;&lt;p&gt;sampleOut3={.125,1,-8,64}&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Given a list known to be composed only of numbers, return a list with each member of the list divided by the number before it. Since this is undefined for the first number in the input list, that element should be omitted. Where division by zero would result, the list should include notification of exception (&quot;N/A&quot; or something similar as befits your language of choice).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;sampleIn4={1,-2,0,5,4};&lt;/p&gt;&#xA;&#xA;&lt;p&gt;sampleOut4={-2,0,&quot;N/A&quot;,0.8}&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Presume that input has been assigned to a variable &lt;code&gt;a&lt;/code&gt; in the natural list format for your language, assuming it has one. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;To be clear, you don't &lt;em&gt;have&lt;/em&gt; to use abstract functions or lambda calculus here, though I suspect that in many languages this will provide a short solution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard rules apply, the examples above are only examples. Your code should work for arbitrary input.&lt;/p&gt;&#xA;" OwnerUserId="12522" LastActivityDate="2016-05-09T19:27:07.553" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9146" PostTypeId="2" ParentId="9140" CreationDate="2016-05-09T21:11:23.953" Score="-1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/71427/decimal-multiplication-of-strings&quot;&gt;Decimal Multiplication of Strings&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It has a solid spec&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Cons:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's newerish (Posted a couple months ago)&lt;/li&gt;&#xA;&lt;li&gt;It doesn't have &lt;em&gt;too much&lt;/em&gt; of a large scope of possible answers. Not that bad though.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-10T03:05:57.867" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9147" PostTypeId="2" ParentId="9140" CreationDate="2016-05-10T02:06:32.477" Score="3" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/42510/reverse-indentation&quot;&gt;Reverse Indentation&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/whitespace&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;whitespace&amp;#39;&quot; rel=&quot;tag&quot;&gt;whitespace&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Written in 2014 (barely)&lt;/li&gt;&#xA;&lt;li&gt;Has a humorous, interesting spec&lt;/li&gt;&#xA;&lt;li&gt;Is easy to understand, but has lots of approaches&lt;/li&gt;&#xA;&lt;li&gt;As of this writing, only has 10 answers&lt;/li&gt;&#xA;&lt;li&gt;Teaches the importance of Java scripting&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Cons:&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-12T17:04:55.633" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9148" PostTypeId="2" ParentId="9140" CreationDate="2016-05-10T03:04:38.050" Score="6" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/1938/code-golf-lattice-points-inside-a-circle?rq=1&quot;&gt;Lattice Points inside a circle&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is &lt;em&gt;old&lt;/em&gt;.  This beauty is from 2011&lt;/li&gt;&#xA;&lt;li&gt;Despite its age, actually has a pretty solid spec&lt;/li&gt;&#xA;&lt;li&gt;Very few answers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Cons:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'm unsure how many techniques can be used to calculate, so answers may start to overlap&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-10T03:04:38.050" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9150" PostTypeId="2" ParentId="9064" CreationDate="2016-05-10T10:20:04.017" Score="11" Body="&lt;h2&gt;By default, answers should provide what the question asks for&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If the question asks for a number, the answer should provide a number. We have various defaults partly to reduce boilerplate, but also to cover issues which a first-time poster wouldn't think about and where their failure to think about it would seriously affect question quality.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A first-time poster wouldn't think about allowing answers to their integer number sequence question to print &lt;code&gt;True&lt;/code&gt; rather than &lt;code&gt;1&lt;/code&gt;, and it would be quite reasonable for their reaction when someone does that and then points at meta to be along the lines of &quot;&lt;em&gt;This is stupid. I'm going to edit my question.&lt;/em&gt;&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So consider two scenarios:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scenario 1:&lt;/strong&gt; new user posts a question, making perfectly reasonable assumptions about what kind of answers would be permitted; someone posts an answer which prompts the new user to want to disqualify that answer. This runs up against our general distaste for question edits which disqualify existing answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scenario 2:&lt;/strong&gt; new user posts a question; experienced user requests them to edit it to allow Booleans. Either they don't want to, and make that clear; or they agree, and edit. In neither case is any existing answer disqualified.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The second scenario seems to me to be clearly preferable and the comparison seems to be sufficient reason in itself to require that &lt;strong&gt;by default&lt;/strong&gt; this should not be allowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, nothing prevents those who want from adding the following line to their questions:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If your language has a Boolean type for which &lt;code&gt;true&lt;/code&gt; and &lt;code&gt;false&lt;/code&gt; are each equal to exactly one integer value, you may return/output that type instead of an integer when the specified output would otherwise be that integer.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="194" LastActivityDate="2016-05-10T10:20:04.017" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9151" PostTypeId="2" ParentId="9126" CreationDate="2016-05-10T13:35:03.697" Score="3" Body="&lt;p&gt;I think you've misunderstood the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/194&quot;&gt;previous discussion on default I/O&lt;/a&gt;. &quot;Standard input&quot; aka stdin is a byte stream which is one of the standard ways to pass input to a command-line program. (The other way is argv). Unless a question makes special exceptions, or unless you find a way of running an SQL script from the command line and reading its raw input, the only option which is compatible with the defaults is to write a user function which takes inputs as arguments.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2016-05-10T13:35:03.697" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9152" PostTypeId="2" ParentId="9140" CreationDate="2016-05-10T13:54:15.303" Score="14" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/42394/squarefinder-locating-regular-tetragons&quot;&gt;Squarefinder - Locating regular tetragons&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Less than 600 views as of writing this.&lt;/li&gt;&#xA;&lt;li&gt;Only 3 answers so far, but all use totally different approaches.&lt;/li&gt;&#xA;&lt;li&gt;A good spec with pictures, easy to understand.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Cons:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Somewhat difficult.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-05-10T13:54:15.303" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9153" PostTypeId="1" CreationDate="2016-05-10T14:01:48.717" Score="5" ViewCount="133" Body="&lt;p&gt;I'm a regular lurker of PP&amp;amp;CG. Today I encountered a situation I'm not sure how this community regularly responds to. I'm asking this to learn more about the common and accepted practices here, and what I should be doing if I'm in a position to act.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The situation was that I saw &lt;a href=&quot;https://codegolf.stackexchange.com/a/79701/18374&quot;&gt;an unusual answer&lt;/a&gt; to a shortest-in-bytes-wins challenge: it wasn't golfed at all. Not only that, but it was more verbose than necessary for the sake of some useful programming practices we'd usually forsake for code golf (like a descriptive error message).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I considered leaving a comment politely encouraging them to find ways to make their code shorter, but maybe they're just answering because they see &lt;em&gt;doing it at all&lt;/em&gt; as a worthwhile challenge and feel like sharing their work. Or something, I don't know. I also don't know if that's seen as fine here or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How do we respond to totally ungolfed answers? Encourage golfing? Leave it be? Vote on it somehow? Something else? (Is there even a common way to handle this?)&lt;/p&gt;&#xA;" OwnerUserId="18374" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-05-10T14:35:42.707" Title="How do we respond to ungolfed submissions to code golf challenges?" Tags="|support|code-golf|answers|" AnswerCount="2" CommentCount="2" ClosedDate="2016-05-10T17:23:52.717" ContentLicense="CC BY-SA 3.0" />
  <row Id="9154" PostTypeId="2" ParentId="9153" CreationDate="2016-05-10T14:29:53.830" Score="1" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;on topic page&lt;/a&gt; specifically says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;All solutions to challenges should:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Correctly implement the required specification.&lt;/li&gt;&#xA;  &lt;li&gt;Be a serious contender for the winning criteria in use. For example, &lt;strong&gt;&lt;em&gt;an entry to a code golf contest needs to be golfed&lt;/em&gt;&lt;/strong&gt;, and an entry to a speed contest should make some attempt to be fast.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(emphasis mine)&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-05-10T14:29:53.830" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9155" PostTypeId="2" ParentId="9153" CreationDate="2016-05-10T14:35:42.707" Score="5" Body="&lt;p&gt;This is covered in our &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;help center&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;All &lt;strong&gt;solutions&lt;/strong&gt; to challenges should:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Correctly implement the required specification.&lt;/li&gt;&#xA;&lt;li&gt;Be a serious contender for the winning criteria in use. For example, an entry to a &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;code golf&lt;/a&gt; contest needs to be golfed, and an entry to a speed contest should make some attempt to be fast.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990&quot;&gt;Our policy on invalid answers&lt;/a&gt; dictates that they should ultimately be removed, but not before giving the poster a chance to fix the post.&lt;/p&gt;&#xA;&lt;p&gt;Considering this answer was posted by a new user, it's important to be welcoming, explaining the scope of the site and the purpose of code golf instead rather than citing rules and threatening deletion. Suggesting how the code could be made shorter and maybe a link to the corresponding &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question could be helpful too. I wouldn't cast a downvote at this point, but that's a personal choice.&lt;/p&gt;&#xA;&lt;p&gt;That being said, the most likely outcome of this scenario is that the user never comes back, since he never intended participating in a code golf contest. If that happens (the poster didn't respond to the comment or you find an ungolfed answer that is over a month old), please flag it for moderator attention.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-10T14:35:42.707" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9157" PostTypeId="2" ParentId="2140" CreationDate="2016-05-10T21:20:48.720" Score="-2" Body="&lt;h2&gt;Cops and robbers : Programmers/Hackers&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;This challenge is quite different from my previous challenges. This challenge is an endless competition between robbers and cops, which are respectively hackers and programmers. One of them will ever win!!!&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This will evolve to code de/obfuscating when it gets to the higher stages: a skillful programmer who is struggling to save his program from a sourcecode-mangling attempted by a cunning &amp;quot;robber&amp;quot; who tries to impose his existence by patching his name instead of the name of the &amp;quot;programmer&amp;quot; in the output console without changing anything else in the code. The story begins this way: &lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Programmer is at the point of executing his recently made C code, so he included this trivial line to show off:&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;em&gt;C (1)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    printf(&amp;quot;[Programmer's username]&amp;quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;After executing this program programmer saw this on the screen:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[Robber's username]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;which indicates the presence of some evil code at the compiler level that compromises his code, which follows:&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Matlab (2)/parser&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;      a=findstr(code,'printf(''[Programmer's username]'')'); if a code(a:20)='printf(''[Robber's username]'')';end&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The programmer cannot modify the counter-program in the compiler, so he must rather change the program content to escape the twiddling:&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;PHP (3)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;      $a='[programmer's username]';echo $a;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The score is now 3, which is the number of steps from the beginning. The current user would win only if the hacker did not figure out something like:&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;PHP/Regex(pcre flavor) (4)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;      $code=ereg_replace(&amp;quot;(\$\w)\='programmer';(.*?);echo\s\1&amp;quot;,&amp;quot;\1\='robber';\2;echo\s\1&amp;quot;,$code)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Since the solution above does not satisfy the rules (see the bottom of this question), the score stays unchanged, and the programmer can make a counter example, and take out the score from last submitter with a penalty on his score equivalent of how much he earned in the earlier level, where the counter example can be something as: &lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;PHP (4)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;      $a='programmer';$b=$a;$a='unrelated';echo $a;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Or he can adjust his program in higher scale to escape all the regex-trapping in a superior range, So the cycle goes on until no post can be added and the last submitter &lt;strong&gt;before the end of June&lt;/strong&gt; is declared a potential winner meanwhile.&lt;/p&gt;&#xA;&lt;p&gt;The hacker can also fix his regex and regain his score, so the recent scoring will be abrogated from programmer.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Perl/dynamic-regex (4)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;local @a=('');&#xA;&#xA;sub check{&#xA;  if (grep {$_ eq @_[1]} @a)  &#xA;   {push @a,@_[0]; } &#xA;  elsif  (grep {$_ eq @_[0]} @a)   {&#xA;    my @del_indexes = grep { @a[$_] eq @_[0] } 0..$#a;&#xA;    foreach $item (@del_indexes) {&#xA;     splice (@a,$item,1);&#xA;    }&#xA;  }   &#xA;return 1;&#xA;}&#xA;&#xA;sub actor{&#xA;if (grep {$_ eq @_[0]} @a)&#xA; {return &amp;quot;print robber&amp;quot;;}&#xA;else&#xA; {return &amp;quot;print &amp;quot;.@_[0];}&#xA;}&#xA;&#xA;&#xA;sub initiate{&#xA;push(@a,@_[0]);&#xA;return 1;&#xA;}&#xA;&#xA;$code =~ s/(((\w+)\=&amp;quot;programmer&amp;quot;(??{initiate($3);}))|(print\s(\w+))|((\w+)\=(\w+)(?{check(($7),($8));})(?1)))/print($2);actor($5)/pegmx;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;As you can see &lt;a href=&quot;http://rextester.com/ZGPKD97343&quot; rel=&quot;nofollow noreferrer&quot;&gt;this Perl program&lt;/a&gt; prints b in the first case because the variable &lt;code&gt;b&lt;/code&gt; is compromised after the first assignment, but in the second case the regex modifies the output because &lt;code&gt;d&lt;/code&gt; receives the target-string transitively. Let's just stop here and not mess the fun (of course, if there will be some).&lt;/p&gt;&#xA;&lt;h2&gt;Scoring and rules&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;How is the score counted ?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any hacker/programmer is scored for his code as the actual level &lt;code&gt;L&lt;/code&gt; the game is on.&lt;/li&gt;&#xA;&lt;li&gt;A partial dynamic regex within the core of the program is scored &lt;code&gt;L + (2^L)/log(length of program + length of characters which do not belong to the regex))&lt;/code&gt;, where the &lt;code&gt;log&lt;/code&gt; is base 2.&#xA;For the second example of level (4) the length of the compacted program is 480, and the length of regex is 136, so the score is &lt;code&gt;4+2^4/log2(480+480-136) ~= 4+16/9.6&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;A fully functional regex as in the first example level (4) is scored &lt;code&gt;L + (2^L)/log(length of regex)&lt;/code&gt;, where the &lt;code&gt;log&lt;/code&gt; is base 2, in that case &lt;code&gt;S = 4 + 2^4 / log(91) ~= 4+16/6.5&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Scores are added progressively to submitters, and when a level is surpassed with no regex, it is still open for scores, while the actual winner remains unchanged.&lt;/li&gt;&#xA;&lt;li&gt;A penalty on a certain-leveled score when the regex/parser is revealed out of rules and the game is regressed to this stage until the issue is fixed, rules are cited below:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The main rule: the hacker-program must compromise an output to the console, which is the username of the programmer. Any other behavior is unaccepted simply because a string variable of [programmer's username] can be used in other order rather than printing, a counter-example is easy, converting the string to integer then use it for arithmetic calculations that harms the main program once intentionally modified.&lt;/li&gt;&#xA;&lt;li&gt;Also one of the following factors declared by any counter-example bans the targeted flawed regex/parser as non rule-complying:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The regex/parser prints anything other than a chosen string preferably set as the username of the robber.&lt;/li&gt;&#xA;&lt;li&gt;The regex/parser generates a program which does not compile.&lt;/li&gt;&#xA;&lt;li&gt;The regex/parser does not print anything, or compromises a segment of code that is needed for tasks other than printing .&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The variable which stores the program is named &lt;code&gt;code&lt;/code&gt; by default, also you may assume that is one-liner, and any non-significant spaces are omitted, and that it is fully working by default.&lt;/li&gt;&#xA;&lt;li&gt;The regex/parser deals with one variant of one code proportion in a comprehensive way, i.e. if a &lt;code&gt;print&lt;/code&gt; function is used, that encompasses all printing functions in all languages &lt;code&gt;puts&lt;/code&gt;,&lt;code&gt;disp&lt;/code&gt;,..etc. Also, code separators can be unified to one characterL either &lt;code&gt;,&lt;/code&gt; or &lt;code&gt;;&lt;/code&gt; or a significant space needlessly of enumerating all keywords/syntaxes, this is not a contest about a working code in a specific programming language.&lt;/li&gt;&#xA;&lt;li&gt;To prevent endless program/regex loops let's just not making a jokey sequence as &lt;code&gt;a='programmer';print a&lt;/code&gt; / &lt;code&gt;/(\w)\='programmer';print\s\1/&lt;/code&gt; /  &lt;code&gt;a='programmer';b=a;print b&lt;/code&gt; / &lt;code&gt;/(\w)\='programmer';(\w)\=\1;print\s\2/&lt;/code&gt; because the first person who makes a regex/parser which palliates to a same replicated idea will take out all attributed scores to this idea from their owners, so any anaphoric sequences like this in addition that they are set to same level, they are unneeded.&lt;/li&gt;&#xA;&lt;li&gt;Any language that uses pointers/addresses/classes like C++ are welcome, as long as they help to evade the hacker.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="38337" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-28T09:39:22.463" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="9158" PostTypeId="2" ParentId="2140" CreationDate="2016-05-10T21:44:36.123" Score="1" Body="&lt;h2&gt;Shortest path to the exit:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Given a &lt;code&gt;n*n&lt;/code&gt; grid of 3 symbolic characters &lt;code&gt;{'.','#',*}&lt;/code&gt; , where &lt;code&gt;n&lt;/code&gt; is inputted, the dot is a safe spot to move from/to, &lt;code&gt;#&lt;/code&gt; is a dragon who blows fire and spits magma, &lt;code&gt;*&lt;/code&gt; is the outlet . Define (if it can be) the shortest path to take from the extreme upper/right to the star character that a moving point can take where:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;m&lt;/code&gt; is an integer &lt;code&gt;m &amp;lt; n&lt;/code&gt; given by user-input or a function dimention with &lt;code&gt;n&lt;/code&gt;, that generates obstacles &lt;code&gt;#&lt;/code&gt; at the dynamic point &lt;code&gt;m modulus n&lt;/code&gt; from the starting point, the last &lt;code&gt;#&lt;/code&gt; point so far is replaced by an exit &lt;code&gt;*&lt;/code&gt;, if no such path exists print &lt;code&gt;0&lt;/code&gt; or a negative amount or &lt;code&gt;undifined&lt;/code&gt;/&lt;code&gt;null&lt;/code&gt; anything witch doesnt throw an error.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Testcases:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;input: 7,3&#xA;output:9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;why? the input generates this grid&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;...#...&#xA;#...#..&#xA;.#...#.&#xA;..#...#&#xA;...#...&#xA;#...*..&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The shortest path is marked as _&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;__.#...&#xA;#__.#..&#xA;.#__.#.&#xA;..#__.#&#xA;...#_..&#xA;#..._..&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;More TODO ...&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Hints/notes&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Solution is cyclic&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No solutions when m+1 divides n or n-1 . (to verify)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="38337" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-11T06:49:45.237" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="9159" PostTypeId="2" ParentId="2140" CreationDate="2016-05-10T21:53:46.287" Score="0" Body="&lt;h1&gt;ASCII Hulls&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A string containing a rectangle made up of &lt;em&gt;m&lt;/em&gt; rows of &lt;em&gt;n&lt;/em&gt; characters, separated by newlines. Apart from an optional trailing newline (which you may choose), the string must contain nothing else.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All the characters will be printable ASCII (including space). So ASCII characters 32 to 176 inclusive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The dimensions &lt;em&gt;m&lt;/em&gt; and &lt;em&gt;n&lt;/em&gt; will not be specified in the input. They will both be in the range 1 to 80 inclusive.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A string containing the same rectangle but with the convex hull of each non-space character filled with that character, higher ASCII values overwriting lower ones.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Overwriting does not prevent a character from contributing to the convex hull. For each character, the convex hull is defined based on the locations of that character &lt;em&gt;before&lt;/em&gt; any overwriting.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Details&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The rectangle of characters forms a grid of &lt;em&gt;m&lt;/em&gt; squares by &lt;em&gt;n&lt;/em&gt; squares. The vertices of the convex hull for a given character are the centres of the squares containing that character (apart from any in the interior of the convex hull). All squares whose centre is on the convex hull or in its interior become that character (until any overwriting).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/rg0ui.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/rg0ui.png&quot; alt=&quot;Outline showing convex hull&quot;&gt;&lt;/a&gt; &lt;a href=&quot;https://i.stack.imgur.com/uQHz5.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/uQHz5.png&quot; alt=&quot;Filled convex hull&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Equivalently you can use the top left corner instead of the centre (or any other point in the square) provided it is consistent. This will give the same output.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Input followed by output in a single code block&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;P    &#xA;   P&#xA; P  &#xA;&#xA;P    &#xA; PPP&#xA; P&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;C    C&#xA;&#xA;      G    G&#xA;    C    C&#xA;&#xA;   G    G&#xA;&#xA;CCCCCC&#xA;  CCCCC&#xA;   CCCGGGGGG&#xA;    CGGGGGG&#xA;    GGGGGG&#xA;   GGGGGG&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; W    Z&#xA;X      X&#xA;&#xA;&#xA;Y      Y&#xA; W    Z&#xA;&#xA; W    Z&#xA;XXXXXXZX&#xA; W    Z&#xA; W    Z &#xA;YYYYYYZY&#xA; W    Z&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The shortest code in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2016-05-10T23:33:51.460" LastActivityDate="2016-05-10T23:33:51.460" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="9160" PostTypeId="2" ParentId="9140" CreationDate="2016-05-11T16:42:56.403" Score="5" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/24258/calculate-practical-numbers&quot;&gt;Calculate practical numbers&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Short and easy-to-understand spec.&lt;/li&gt;&#xA;&lt;li&gt;Only 4 answers, top answer is &quot;not really golfed&quot;.&lt;/li&gt;&#xA;&lt;li&gt;Over 2 years old.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Cons:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The time limit makes it more difficult.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-05-11T18:57:31.967" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9161" PostTypeId="2" ParentId="9140" CreationDate="2016-05-11T16:45:24.607" Score="1" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/37940/word-search-puzzle?rq=1&quot;&gt;Word Search Puzzle&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/word-search&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;word-search&amp;#39;&quot; rel=&quot;tag&quot;&gt;word-search&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Common problem that is quickly understood&lt;/li&gt;&#xA;&lt;li&gt;Doesn't require a dictionary&lt;/li&gt;&#xA;&lt;li&gt;Low chance of solution overlap&lt;/li&gt;&#xA;&lt;li&gt;The accepted answer has a &lt;em&gt;great&lt;/em&gt; explanation&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Cons:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;May be a bit too easy&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-11T16:50:51.997" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9162" PostTypeId="2" ParentId="2140" CreationDate="2016-05-11T17:26:44.173" Score="1" Body="&lt;h1&gt;Simulate a DNA Computer &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;DNA computers are very powerful computational models, theoretically able to solve NP-complete problems such as SAT deterministically in polynomial time. Your task in this challenge is to write a program/function that simulates the behaviour of a very simple DNA computer that accepts only four different kinds of commands.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;DNA and Tubes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;To make things a bit easier, we model &lt;em&gt;DNA strands&lt;/em&gt; as non-empty words over {0,1}. So for our purpose, the following are all valid strands of DNA: &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;010010&lt;/code&gt;, &lt;code&gt;01&lt;/code&gt;, &lt;code&gt;1100101&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Our DNA computer has access to an infinite number of &lt;em&gt;(test) tubes&lt;/em&gt; T&lt;sub&gt;1&lt;/sub&gt;,T&lt;sub&gt;2&lt;/sub&gt;,T&lt;sub&gt;3&lt;/sub&gt;,..., each of which contains a finite number of DNA strands. That is, T&lt;sub&gt;i&lt;/sub&gt; ⊂ {0,1}&lt;sup&gt;*&lt;/sup&gt; for all i ∈ ℕ&lt;sup&gt;+&lt;/sup&gt;. For example, T&lt;sub&gt;1&lt;/sub&gt; = {&lt;code&gt;1&lt;/code&gt;,&lt;code&gt;0100101&lt;/code&gt;,&lt;code&gt;000&lt;/code&gt;} would be a valid tube. At the beginning of a simulation, all tubes are assumed to be empty (T&lt;sub&gt;i&lt;/sub&gt; = ∅ for all i ∈ ℕ&lt;sup&gt;+&lt;/sup&gt;).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Commands&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Our computer supports four different commands: &lt;em&gt;Initialize&lt;/em&gt; (&lt;code&gt;I&lt;/code&gt;),  &lt;em&gt;Merge&lt;/em&gt; (&lt;code&gt;M&lt;/code&gt;), &lt;em&gt;Filter&lt;/em&gt; (&lt;code&gt;F&lt;/code&gt;), and &lt;em&gt;Amplify&lt;/em&gt; (&lt;code&gt;A&lt;/code&gt;). In the following, let the pairwise different numbers i, j, k ∈ ℕ&lt;sup&gt;+&lt;/sup&gt; denote indices of tubes T&lt;sub&gt;i&lt;/sub&gt;, T&lt;sub&gt;j&lt;/sub&gt; and T&lt;sub&gt;k&lt;/sub&gt;. Furthermore, let n ∈ ℕ&lt;sup&gt;+&lt;/sup&gt; and b ∈ {0,1}.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Initialize&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Description&lt;/strong&gt;: We take all possible DNA strands of length &lt;code&gt;n&lt;/code&gt; and put them into tube &lt;code&gt;i&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Syntax&lt;/strong&gt;: &lt;code&gt;i = I n&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Semantics&lt;/strong&gt;: T&lt;sub&gt;i&lt;/sub&gt; ← {0,1}&lt;sup&gt;n&lt;/sup&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Example&lt;/strong&gt;: After the execution of &lt;code&gt;2 = I 3&lt;/code&gt;, we have T&lt;sub&gt;2&lt;/sub&gt; = {&lt;code&gt;000&lt;/code&gt;, &lt;code&gt;001&lt;/code&gt;, &lt;code&gt;010&lt;/code&gt;, &lt;code&gt;011&lt;/code&gt;, &lt;code&gt;100&lt;/code&gt;, &lt;code&gt;101&lt;/code&gt;, &lt;code&gt;110&lt;/code&gt;, &lt;code&gt;111&lt;/code&gt;}.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Merge&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Description&lt;/strong&gt;: We mix the contents of tubes &lt;code&gt;j&lt;/code&gt; and &lt;code&gt;k&lt;/code&gt; and put them into tube &lt;code&gt;i&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Syntax&lt;/strong&gt;: &lt;code&gt;i = M j k&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Semantics&lt;/strong&gt;: T&lt;sub&gt;i&lt;/sub&gt; ← T&lt;sub&gt;j&lt;/sub&gt; ∪ T&lt;sub&gt;k&lt;/sub&gt; ; T&lt;sub&gt;j&lt;/sub&gt; ← ∅ ; T&lt;sub&gt;k&lt;/sub&gt; ← ∅&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Example&lt;/strong&gt;: If T&lt;sub&gt;2&lt;/sub&gt; = {&lt;code&gt;00&lt;/code&gt;, &lt;code&gt;111&lt;/code&gt;} and T&lt;sub&gt;3&lt;/sub&gt; = {&lt;code&gt;1&lt;/code&gt;, &lt;code&gt;010&lt;/code&gt;, &lt;code&gt;00&lt;/code&gt;}, then after the execution of &lt;code&gt;1 = M 2 3&lt;/code&gt;, we have T&lt;sub&gt;1&lt;/sub&gt; = {&lt;code&gt;00&lt;/code&gt;, &lt;code&gt;111&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;010&lt;/code&gt;} and T&lt;sub&gt;2&lt;/sub&gt; = T&lt;sub&gt;3&lt;/sub&gt; = ∅.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Filter&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Description&lt;/strong&gt;: We remove all DNA strands from tube &lt;code&gt;j&lt;/code&gt; whose &lt;code&gt;n&lt;/code&gt;-th bit is not equal to &lt;code&gt;b&lt;/code&gt;. We put the remaining strands into tube &lt;code&gt;i&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Syntax&lt;/strong&gt;: &lt;code&gt;i = F j n b&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Semantics&lt;/strong&gt;: T&lt;sub&gt;i&lt;/sub&gt; ← T&lt;sub&gt;j&lt;/sub&gt; ∩ {0,1}&lt;sup&gt;n-1&lt;/sup&gt;∘{b}∘{0,1}&lt;sup&gt;*&lt;/sup&gt; ; T&lt;sub&gt;j&lt;/sub&gt; ← ∅&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Example&lt;/strong&gt;: If T&lt;sub&gt;2&lt;/sub&gt; = {&lt;code&gt;1010000&lt;/code&gt;, &lt;code&gt;111&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;0101&lt;/code&gt;}, then after the execution of &lt;code&gt;1 = F 2 3 1&lt;/code&gt;, we have T&lt;sub&gt;1&lt;/sub&gt; = {&lt;code&gt;1010000&lt;/code&gt;, &lt;code&gt;111&lt;/code&gt;} and T&lt;sub&gt;2&lt;/sub&gt; = ∅&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Amplify&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Description&lt;/strong&gt;: We put an exact copy of the contents of tube &lt;code&gt;j&lt;/code&gt; into tube &lt;code&gt;i&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Syntax&lt;/strong&gt;: &lt;code&gt;i = A j&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Semantics&lt;/strong&gt;: T&lt;sub&gt;i&lt;/sub&gt; ← T&lt;sub&gt;j&lt;/sub&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Example&lt;/strong&gt;: If T&lt;sub&gt;2&lt;/sub&gt; = {&lt;code&gt;1010000&lt;/code&gt;, &lt;code&gt;111&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;0101&lt;/code&gt;}, then after the execution of &lt;code&gt;1 = A 2&lt;/code&gt;, we have both T&lt;sub&gt;1&lt;/sub&gt; = {&lt;code&gt;1010000&lt;/code&gt;, &lt;code&gt;111&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;0101&lt;/code&gt;} and T&lt;sub&gt;2&lt;/sub&gt; = {&lt;code&gt;1010000&lt;/code&gt;, &lt;code&gt;111&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;0101&lt;/code&gt;}.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input will be a &lt;em&gt;DNA program&lt;/em&gt;, i.e. a sequence of these four commands, that can be read  from STDIN, taken as a function argument or even be stored in a file. It's up to you whether you take them as a list or a string with some kind of separator. Also, you can choose a different separator for the parameters of the commands or encode each command as a list as long as you do so consistently. For example, instead of the command &lt;code&gt;1 = F 5 10 0&lt;/code&gt;, you may use &lt;code&gt;[1,&quot;F&quot;,5,10,0]&lt;/code&gt;, &lt;code&gt;1;F/5/10/0&lt;/code&gt;, &lt;code&gt;1=F(5,10,0)&lt;/code&gt; or the like. &#xA;You may assume that the input is always syntactically correct. For example input/output pairs, see below.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You have to output a truthy value iff tube 1 is not empty (i.e. T&lt;sub&gt;1&lt;/sub&gt; ≠ ∅) after the execution of the DNA program specified in the input. Otherwise output a falsey value. Note that you are not actually required to simulate the DNA program step by step - if you find a more clever way to calculate the output of a given program, feel free to use it.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In the below examples, all commands are &lt;code&gt;;&lt;/code&gt;-separated and encoded as described in the &quot;Commands&quot; section.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Truthy&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;1 = I 20&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;2 = I 4; 1 = A 2&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;3 = I 1; 1 = M 3 9&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1 = I 4; 2 = A 1; 3 = F 1 1 0; 4 = F 3 2 0; 5 = F 2 1 1; 5 = M 3 4; 1 = M 2 5&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1 = I 3; 2 = A 1; 3 = A 1; 4 = A 1; 5 = F 2 1 1; 6 = F 3 2 0; 7 = F 4 3 1; 2 = M 6 7; 1 = M 2 5; 2 = A 1; 3 = A 1; 4 = F 2 1 0; 5 = F 3 2 1; 1 = M 4 5&lt;/code&gt; (&lt;sup&gt;1&lt;/sup&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Falsey&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;&lt;/code&gt;&amp;nbsp;(the empty program)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;2 = I 5&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1 = I 2; 2 = A 1; 3 = F 1 2 0; 2 = A 3; 1 = F 2 2 1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1 = I 1; 2 = I 1; 3 = M 1 2&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1 = M 2 3&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer (in bytes) wins.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; In case you are interested: this example evaluates the formula (x&lt;sub&gt;1&lt;/sub&gt; ∨ ¬x&lt;sub&gt;2&lt;/sub&gt; ∨ x&lt;sub&gt;3&lt;/sub&gt;) ∧ (¬x&lt;sub&gt;1&lt;/sub&gt; ∨ x&lt;sub&gt;2&lt;/sub&gt;), that is, the contents of T&lt;sub&gt;1&lt;/sub&gt; after execution of the program are exactly the assignments to (x&lt;sub&gt;1&lt;/sub&gt;,x&lt;sub&gt;2&lt;/sub&gt;,x&lt;sub&gt;3&lt;/sub&gt;) that make this formula true. One can create similar such programs for any 3SAT formula. The number of commands needed is linear in the size of the given formula.&lt;/p&gt;&#xA;" OwnerUserId="24898" LastActivityDate="2016-05-11T17:26:44.173" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9163" PostTypeId="2" ParentId="9140" CreationDate="2016-05-11T18:56:00.493" Score="4" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/11861/generate-skolem-sequences&quot;&gt;Generate Skolem sequences&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's from June 2013, so almost 3 years old, and has less than 700 views.&lt;/li&gt;&#xA;&lt;li&gt;Not too hard, but not trivial either, and there are probably many different approaches.&lt;/li&gt;&#xA;&lt;li&gt;The spec is short and simple (ignoring the weird background story).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-05-11T18:56:00.493" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9164" PostTypeId="1" AcceptedAnswerId="9165" CreationDate="2016-05-11T23:23:10.580" Score="1" ViewCount="56" Body="&lt;p&gt;Suppose I have an idea for a competition, but am a little iffy on the details.  Where do I ask questions about what to do for it?&lt;/p&gt;&#xA;" OwnerUserId="53585" LastEditorUserId="31957" LastEditDate="2016-05-11T23:26:32.670" LastActivityDate="2016-05-11T23:26:32.670" Title="Where to ask questions proposed competition" Tags="|discussion|" AnswerCount="1" CommentCount="3" ClosedDate="2016-05-11T23:25:34.920" ContentLicense="CC BY-SA 3.0" />
  <row Id="9165" PostTypeId="2" ParentId="9164" CreationDate="2016-05-11T23:25:06.937" Score="7" Body="&lt;p&gt;Welcome to Programming Puzzles &amp;amp; Code Golf! For that we have the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;Sandbox for Proposed Challenges&lt;/a&gt;. You post your challenge idea as an answer to that post and the community can provide feedback before the challenge is posted to the main site.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-05-11T23:25:06.937" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9166" PostTypeId="2" ParentId="2140" CreationDate="2016-05-12T01:38:31.080" Score="1" Body="&lt;p&gt;An idea for a &lt;code&gt;king-of-the-hill&lt;/code&gt; challenge:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You have a &quot;memory arena&quot; with a fixed size.  You have several programs which &quot;reside&quot; in the memory arena (I mean you take the assembly and put it in the arena).  The goal of the game is to get another program to access memory outside of this &quot;arena&quot; which then causes it to die because access outside of the memory arena is not defined.  The last program standing wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You enter in assembly code (I have not determined which architecture yet).  At the beginning of a round all of the entries get randomly placed in the memory arena.  Each program will execute one instruction per turn.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It would be very similar to &lt;a href=&quot;http://www.corewars.org/&quot; rel=&quot;nofollow&quot;&gt;red code&lt;/a&gt; but in actual assembler.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please feel free to post comments&lt;/p&gt;&#xA;" OwnerUserId="53585" LastActivityDate="2016-05-12T01:38:31.080" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9168" PostTypeId="2" ParentId="2140" CreationDate="2016-05-12T18:53:41.987" Score="0" Body="&lt;h1&gt;Triangle Rasterization&lt;/h1&gt;&#xA;&lt;p&gt;I don't know if this is the right word for this, but here goes...&lt;/p&gt;&#xA;&lt;p&gt;Given a triangle with a height and a width, you can convert it into squares by counting any square that the triangle occupies as a whole square. Your task is to calculate the area of this 'rasterized' triangle.&lt;/p&gt;&#xA;&lt;p&gt;Your program should take two &lt;strong&gt;positive integers&lt;/strong&gt; representing the height and width of a triangle and output the area of its 'rasterized' version. This should always be an integer.&lt;/p&gt;&#xA;&lt;p&gt;No builtins are allowed, if there are any.&lt;/p&gt;&#xA;&lt;h2&gt;An example&lt;/h2&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/oe7w2.png&quot; alt=&quot;What I'm actually talking about.&quot; /&gt;&#xA;This is a 6x4 triangle. The red area is the actual inside of the triangle, and the blue area is added on during the 'rasterization'. The total are of the red and the blue is 16. So, given &lt;code&gt;6&lt;/code&gt; and &lt;code&gt;4&lt;/code&gt; as inputs, your program must output &lt;code&gt;16&lt;/code&gt;, with or without a trailing newline.&lt;/p&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt; input     output&#xA; 1, 1      1&#xA; 1, 2      2&#xA; 1, 3      3&#xA; 2, 2      3&#xA; 6, 4      16&#xA; 63, 47    1512&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;As you can probably tell, this is slightly larger than half the area of the enclosing rectangle, and gets more accurate for larger sizes.&lt;/p&gt;&#xA;&lt;p&gt;Your program should preferably run in under a minute, but the answer with the shortest number of bytes will win.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="33217" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-12T18:53:41.987" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9169" PostTypeId="1" AcceptedAnswerId="9170" CreationDate="2016-05-12T23:56:05.560" Score="5" ViewCount="227" Body="&lt;p&gt;I just noticed something about my account. I just recently discovered the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7897/graduation-design-ideas/7955#7955&quot;&gt;Graduation Userscript&lt;/a&gt;. I then noticed that I was (not actually) close to getting the privilege &quot;See Vote Counts&quot;. I tried it on a question, and guess what? &lt;a href=&quot;https://i.stack.imgur.com/Jhnaq.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Jhnaq.png&quot; alt=&quot;Null&quot;&gt;&lt;/a&gt;I turn the stylesheet off? &lt;img src=&quot;https://i.stack.imgur.com/D9uxJ.png&quot; alt=&quot;None&quot;&gt; I don't want to lose this privilege, but what is happening? Is it something with the userscript? You can see from the screenshots that I have 538 repuation the whole time. I can't read JavaScript Userscripts so I couldn't tell if I looked at the userscript. The same thing happens on my other laptop. &lt;/p&gt;&#xA;" OwnerUserId="48922" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-05-13T00:31:45.557" Title="Free privileges with &quot;Graduation Userscript&quot;" Tags="|support|voting|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9170" PostTypeId="2" ParentId="9169" CreationDate="2016-05-12T23:59:41.847" Score="8" Body="&lt;p&gt;Vote breakdowns are trivially exposed to userscripts (you can even get them from Stack Exchange Data Explorer) but without such a script you're limited by privilege reputation thresholds. You don't have enough reputation to see vote breakdowns but anyone can see vote breakdowns with Downgoat's userscript.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-05-12T23:59:41.847" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9171" PostTypeId="2" ParentId="9140" CreationDate="2016-05-13T00:48:51.670" Score="0" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/23631/the-floating-horde/23657#23657&quot;&gt;The Floating Horde&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/probably-needs-another-tag&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;probably-needs-another-tag&amp;#39;&quot; rel=&quot;tag&quot;&gt;probably-needs-another-tag&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Great theme&lt;/li&gt;&#xA;&lt;li&gt;Part of a series, introducing users to other questions&lt;/li&gt;&#xA;&lt;li&gt;2 years old&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Cons:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It was pretty popular back in the day&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-13T00:48:51.670" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9173" PostTypeId="2" ParentId="9140" CreationDate="2016-05-13T18:10:41.553" Score="3" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/7143/lego-gear-ratios&quot;&gt;Lego gear ratios&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Simple, concrete and fun spec.&lt;/li&gt;&#xA;&lt;li&gt;Old, from September 2012.&lt;/li&gt;&#xA;&lt;li&gt;There seems to be room for more answers.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Cons:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The I/O formats are strict (but not &lt;em&gt;too&lt;/em&gt; annoying).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-05-13T18:56:05.020" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9174" PostTypeId="2" ParentId="2140" CreationDate="2016-05-13T20:32:47.067" Score="2" Body="&lt;h2&gt;Nested brackets in source code&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/balanced-string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;balanced-string&amp;#39;&quot; rel=&quot;tag&quot;&gt;balanced-string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This challenge is somewhat unusual.&#xA;Basically, your inputs are a correctly matched string of brackets &lt;strong&gt;S&lt;/strong&gt; and a number &lt;strong&gt;n &amp;ge; 0&lt;/strong&gt;, and your output is the number of matched pairs at nesting level &lt;strong&gt;n&lt;/strong&gt; in &lt;strong&gt;S&lt;/strong&gt;.&#xA;The outermost pairs are at level 0, those inside them are at level 1, and so on.&#xA;The twist is that the string &lt;strong&gt;S&lt;/strong&gt; is part of your source code, and incorrectly matched strings must result in compilation or runtime errors.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to write four strings, &lt;strong&gt;A&lt;/strong&gt;, &lt;strong&gt;B&lt;/strong&gt;, &lt;strong&gt;L&lt;/strong&gt;, and &lt;strong&gt;R&lt;/strong&gt;, that satisfy the following conditions.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The strings &lt;strong&gt;L&lt;/strong&gt; and &lt;strong&gt;R&lt;/strong&gt; are non-empty and distinct. They represent a left and right bracket.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;strong&gt;S&lt;/strong&gt; is a concatenation of &lt;strong&gt;L&lt;/strong&gt;s and &lt;strong&gt;R&lt;/strong&gt;s that is correctly matched, then the concatenation &lt;strong&gt;ASB&lt;/strong&gt; is a valid program (full runnable program or function definition) is your programming language of choice. It takes an integer &lt;strong&gt;n &amp;ge; 0&lt;/strong&gt; and outputs the number of &lt;strong&gt;L&lt;/strong&gt;-&lt;strong&gt;R&lt;/strong&gt; pairs in &lt;strong&gt;S&lt;/strong&gt; at nesting level &lt;strong&gt;n&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;strong&gt;S&lt;/strong&gt; is a concatenation of &lt;strong&gt;L&lt;/strong&gt;s and &lt;strong&gt;R&lt;/strong&gt;s that is &lt;em&gt;not&lt;/em&gt; correctly matched, then &lt;strong&gt;ASB&lt;/strong&gt; either fails to compile, or throws an error on every possible input.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Suppose that the strings &lt;strong&gt;A&lt;/strong&gt;, &lt;strong&gt;B&lt;/strong&gt;, &lt;strong&gt;L&lt;/strong&gt;, and &lt;strong&gt;R&lt;/strong&gt; are &lt;code&gt;BEGIN;&lt;/code&gt;, &lt;code&gt;END;&lt;/code&gt;, &lt;code&gt;DO(i++;&lt;/code&gt; and &lt;code&gt;);&lt;/code&gt;, respectively, in an imaginary programming language.&#xA;Then the string &lt;code&gt;DO(i++;);DO(i++;DO(i++;););&lt;/code&gt; is a correctly matched concatenation of &lt;strong&gt;L&lt;/strong&gt;s and &lt;strong&gt;R&lt;/strong&gt;s.&#xA;On input &lt;code&gt;0&lt;/code&gt;, the program&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;BEGIN;DO(i++;);DO(i++;DO(i++;););END;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;should output &lt;code&gt;2&lt;/code&gt;, because there are two matched pairs at level 0.&#xA;However, the program&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;BEGIN;DO(i++;DO(i++;);END;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;should result in an error, because the brackets are not correctly matched.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;More examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here is a table of some programs, inputs and expected outputs.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Program          Input  Output&#xA;------------------------------&#xA;AB               &amp;lt;any&amp;gt;  0&#xA;ALRB             0      1&#xA;ALRB             1      0&#xA;ALLRRB           1      1&#xA;ALRLRB           0      2&#xA;ALRLLRRB         0      2&#xA;ALRLLRRB         1      1&#xA;ALLRLLLRRRLRRLRB 0      2&#xA;ALLRLLLRRRLRRLRB 1      3&#xA;ALLRLLLRRRLRRLRB 2      1&#xA;ALLRLLLRRRLRRLRB 3      1&#xA;ALLRLLLRRRLRRLRB 4      0&#xA;ARB              &amp;lt;any&amp;gt;  error&#xA;ALB              &amp;lt;any&amp;gt;  error&#xA;ARLB             &amp;lt;any&amp;gt;  error&#xA;ALLRB            &amp;lt;any&amp;gt;  error&#xA;ALLRRRLRB        &amp;lt;any&amp;gt;  error&#xA;ALLRRLLRB        &amp;lt;any&amp;gt;  error&#xA;ALLRRRLLLRRB     &amp;lt;any&amp;gt;  error&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules and scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your score is the sum of the lengths of the four strings, lower score being better.&#xA;You must identify the strings in your answer.&#xA;You are not allowed to read your source code directly or indirectly.&#xA;Standard loopholes are also disallowed.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sandbox notes&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the task of counting pairs on a nesting level too easy? I don't want it to be trivial, but not so hard either that it shadows the source layout aspect. A slightly more difficult variant would be to count the number of peaks (substrings &lt;strong&gt;LR&lt;/strong&gt;) at nesting level &lt;strong&gt;n&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Is the restriction of erroring on mismatched brackets interesting? I could also require the program to always return &lt;code&gt;-1&lt;/code&gt; in this case, or something similar.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="32014" LastEditDate="2016-05-15T17:48:21.737" LastActivityDate="2016-05-15T17:48:21.737" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9175" PostTypeId="2" ParentId="9140" CreationDate="2016-05-13T21:33:18.043" Score="1" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/70290/solve-an-0h-n0-board&quot;&gt;Solve an 0h n0 board&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle-solver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle-solver&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle-solver&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Pros&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Low view count (~450)&lt;/li&gt;&#xA;&lt;li&gt;Only one answer&lt;/li&gt;&#xA;&lt;li&gt;Fairly easy to understand (At least in my opinion, correct me if I'm wrong)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Cons&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Quite difficult (I haven't even figured out where to start solving it :)&lt;/li&gt;&#xA;&lt;li&gt;Fairly new (~2.5 months old)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42736" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-05-13T21:33:18.043" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9176" PostTypeId="2" ParentId="2140" CreationDate="2016-05-13T21:54:06.427" Score="3" Body="&lt;h2&gt;Strip Iterated Prisoner's Dilemma&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/koth&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;koth&amp;#39;&quot; rel=&quot;tag&quot;&gt;koth&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://xkcd.com/696/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://xkcd.com/696/&lt;/a&gt;, of course.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Prisoner's Dilemma is a classic game (more in the game theory sense than the family fun sense) where two agents - two accomplices to a crime, in the original formulation - must choose whether to sell out the other. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If each player chooses not to betray the other, both win. If one player chooses treachery and the other does not, it wins, but if both betray each other, neither wins. The &quot;iterated&quot; variation is where the game is played multiple times with the same players, and both players know all the decisions each player has made in the past.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, that's all a bit dull, and has been done before besides. We're going to tart it up a bit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Unfortunately due to the nature of the test all solutions must be in the same language, and one that supports executing strings. I've chosen Python 3, since it's my favorite and I have to write the runner.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The Game:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Submit a program - specifically a Python 3 function - that plays Iterated Prisoner's Dilemma against another such program. If both functions betray each other, each one gets one character deleted from the end of its source code. If one function betrays the other, the betrayed function gets &lt;em&gt;two&lt;/em&gt; characters deleted from the end of it, and the traitor gets a &lt;code&gt;#&lt;/code&gt; appended to it, immunizing it against one future loss. If neither turns traitor, both go unharmed. Functions will be restored to their original text between each contest with a new opponent. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Submissions are scored based on failure rate and length; specifically, &lt;code&gt;score = round( (number_of_trials_failed / total_number_of_trials) * ( length / 2 ) )&lt;/code&gt;. The submission with the &lt;em&gt;lowest&lt;/em&gt; score wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;length&lt;/code&gt; of a submission is the number of non-whitespace characters in the submission. Comments are not counted, but are also removed before the contest begins, so a commented out &quot;guard&quot; at the end will not protect your code from deletions. Length also does not count the function specifier (the &lt;code&gt;def submission(y, o, t):&lt;/code&gt; which should not be included in your submission text anyway.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your function will be called with three parameters, &lt;code&gt;y&lt;/code&gt; (your history), &lt;code&gt;o&lt;/code&gt;(opponent's history), and &lt;code&gt;t&lt;/code&gt; (text of the opponent itself). &lt;code&gt;t&lt;/code&gt; is the very same text that the game runner will execute as your function's opponent, which you may analyze or otherwise use to run simulations. It will then return True if it wishes to betray its opponent or False if it does not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every possible 2-combination of submissions will be contested against each other - including each submission against itself. Each contest consists of 2,500 trials.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Other Rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;All submissions must be in Python 3. (Specifically, they should run under Python 3.4.4)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The submission text must be the only code that is run to produce the result; you may not &lt;code&gt;import&lt;/code&gt; any libraries, ask for user input, read from &lt;code&gt;/dev/urandom/&lt;/code&gt;or equivalent, and of course you can't pull results from some webserver (which is already a violation of the standard loophole rules.) You MAY execute the given opponent text, and of course you're allowed to call all the builtins.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The submission must terminate and return an answer within 1 second (this will be run on a 12GB i7 gaming computer, so this should be plenty of time).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A submission that emits an uncaught exception or returns an invalid value loses that round.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Submissions that do not return in one second or less are &lt;em&gt;immediately disqualified&lt;/em&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Submissions will be closed on [date posted + 8 days] and programmatically judged, results will be appended to the challenge. There will be a &quot;trial run&quot; in the evening of [date posted + 4 days].&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;API:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &quot;submission text&quot; is valid, 4-space-indented Python 3 source code that will have the function specifier line &lt;code&gt;def submission(y, o, t):\n&lt;/code&gt; appended to the beginning and a single 4-space-indent added to the beginning of each line. So:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;if len(y) == 0: return False&#xA;else: return (not y[-1])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;...is run as...&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def submission(y, o, t):&#xA;   if len(y) == 0: return False&#xA;   else: return (not y[-1])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The function should return &lt;code&gt;True&lt;/code&gt; to betray its opponent or &lt;code&gt;False&lt;/code&gt; to trust its opponent. Returning any other value (such as if your &lt;code&gt;return&lt;/code&gt; statement has been deleted and you return None`) is an error and will result in an automatic loss of that round. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;o&lt;/code&gt; is a list of &lt;code&gt;True&lt;/code&gt;-es or &lt;code&gt;False&lt;/code&gt;-es, representing the opponent's previous moves when playing against you; &lt;code&gt;o[n]&lt;/code&gt; equals the decision your opponent made in round &lt;code&gt;n&lt;/code&gt;, and of course this list will be empty in the first trial. &lt;code&gt;y&lt;/code&gt; is similar except it's your previous moves. &lt;code&gt;t&lt;/code&gt; is the text of the opponent submission, formatted as specified above.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is the program that will perform the contest:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[said code here]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example Submissions:&lt;/strong&gt;&#xA;These will also be included in the actual contest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Chronic Villain Syndrome:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#always choose 'betray'&#xA;return True&#xA;11111111 #padding&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The Patsy:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#always choose 'trust'&#xA;return False&#xA;11111111 #padding&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Do Onto Others...:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#always choose what opponent chose last round&#xA;if o:&#xA;   return o[-1]&#xA;return True&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Professor X:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;me=&quot;&quot;&quot;&#xA;#Read opponent's mind and choose optimally.&#xA;exec(&quot;def e(y, o, t):\n&quot;+t)&#xA;return False e(o, y, me)&#xA;#Opponent's choice this turn if we betray...&#xA;tb = e(o,y+[True], me)&#xA;#if we trust...&#xA;tt = e(o,y+[False], me)&#xA;&#xA;#Opponents choice NEXT turn if we betray then betray...&#xA;tbb = e(o+[tb], y+[True], me)&#xA;#... betray then trust...&#xA;tbt = e(o+[tb], y+[False], me)&#xA;#... trust then betray...&#xA;ttb = e(o+[tt], y+[True], me)&#xA;#... trust then trust...&#xA;ttt = e(o+[tt], y+[False], me)&#xA;&#xA;#Maps (your_choice,opponent_choice) to desirability&#xA;#Betrayed = -2, mutual betrayal = -1,&#xA;#mutual cooperation = 1, betray opp. = 2&#xA;v = {(False, True): -2, (True, True): -1,&#xA;     (False, False): 1, (True, False): 2}&#xA;#Best outcome next turn of trusting now&#xA;ftv = max(v[ttt], v[ttb])&#xA;#... of betraying now&#xA;fbv = max(v[tbt], v[tbb])&#xA;#value of betraying now&#xA;bv = v[tb] + fbv&#xA;#... of trusting now&#xA;tb = b[tt] + ftv&#xA;&#xA;#Tuple comparison is done l to r, so&#xA;#this returns True if tv &amp;gt;= bv,&#xA;#False if bv &amp;gt; tv.&#xA;return max( (bv, True), (tv, False) )&#xA;&quot;&quot;&quot;&#xA;exec(me)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(p.s. this one gets disqualified every time - why is left as an exercise to the reader)&lt;/p&gt;&#xA;" OwnerUserId="21649" LastEditorUserId="46271" LastEditDate="2016-05-14T18:14:21.783" LastActivityDate="2016-05-14T18:14:21.783" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="9177" PostTypeId="5" CreationDate="2016-05-13T22:05:33.187" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; questions on the main site involve drawing or displaying images on a screen, or generating image files. Be sure to read the &lt;a href=&quot;https://codegolf.stackexchange.com/tags/graphical-output/info&quot;&gt;graphical output tag wiki&lt;/a&gt; for more information.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Do not post &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; challenges here on meta&lt;/strong&gt;, they will be closed as off-topic.&lt;/p&gt;&#xA;&lt;p&gt;This tag should be used on questions about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;; both the tag itself and the questions that should or shouldn't be tagged with it.&lt;/p&gt;&#xA;&lt;p&gt;Be aware of it's sister tags &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="48922" LastEditorUserId="66833" LastEditDate="2021-04-24T23:34:09.220" LastActivityDate="2021-04-24T23:34:09.220" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="9178" PostTypeId="4" CreationDate="2016-05-13T22:05:33.187" Score="0" Body="For questions specifically about the graphical output tag on the main site. Do not post [graphical-output] challenges on meta - they will be closed as off-topic" OwnerUserId="48922" LastEditorUserId="66833" LastEditDate="2021-04-24T23:34:09.220" LastActivityDate="2021-04-24T23:34:09.220" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="9179" PostTypeId="2" ParentId="2140" CreationDate="2016-05-13T22:32:51.697" Score="3" Body="&lt;h2&gt;Draw the Cool S &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Given a number n≥3, print or output the Cool S made with n vertical bars.  The outputs for 3,4,5,6 are:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  / \&#xA; /   \&#xA;|  |  |&#xA;|  |  |&#xA; \  \/&#xA; /\  \&#xA;|  |  |&#xA;|  |  |&#xA; \   /&#xA;  \ /&#xA;&#xA;    /\&#xA;   /  \&#xA;  /    \&#xA; /  /\  \&#xA;|  |  |  |&#xA;|  |  |  |&#xA;|  |  |  |&#xA; \  \  \/&#xA; /\  \  \&#xA;|  |  |  |&#xA;|  |  |  |&#xA;|  |  |  |&#xA; \  \/  /&#xA;  \    /&#xA;   \  /&#xA;    \/&#xA;&#xA;     / \&#xA;    /   \&#xA;   /     \&#xA;  /  / \  \&#xA; /  /   \  \&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA; \  \  \  \/&#xA; /\  \  \  \&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA; \  \   /  /&#xA;  \  \ /  /&#xA;   \     /&#xA;    \   /&#xA;     \ /&#xA;&#xA;       /\&#xA;      /  \&#xA;     /    \&#xA;    /  /\  \&#xA;   /  /  \  \&#xA;  /  /    \  \&#xA; /  /  /\  \  \&#xA;|  |  |  |  |  |&#xA;|  |  |  |  |  |&#xA;|  |  |  |  |  |&#xA;|  |  |  |  |  |&#xA;|  |  |  |  |  |&#xA; \  \  \  \  \/&#xA; /\  \  \  \  \&#xA;|  |  |  |  |  |&#xA;|  |  |  |  |  |&#xA;|  |  |  |  |  |&#xA;|  |  |  |  |  |&#xA;|  |  |  |  |  |&#xA; \  \  \/  /  /&#xA;  \  \    /  /&#xA;   \  \  /  /&#xA;    \  \/  /&#xA;     \    /&#xA;      \  /&#xA;       \/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Any invisible whitespace is optional (trailing spaces and trailing/leading newlines).&lt;/p&gt;&#xA;&lt;h2&gt;How to draw the Cool S&lt;/h2&gt;&#xA;&lt;p&gt;Draw the Cool S just like you've done since childhood, except the number of vertical bars can be more than 3.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Mtbh2m.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Mtbh2m.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Draw two rows of vertical bars.&lt;/li&gt;&#xA;&lt;li&gt;Connect them with slanted lines, tucking away the two remaining bars.&lt;/li&gt;&#xA;&lt;li&gt;Pair of the bars with slanted lines at the top and bottom.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Here's how we do this for ASCII art. Let's look at n=5.&lt;/p&gt;&#xA;&lt;p&gt;A row has n vertical bars with two spaces between them&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;|  |  |  |  |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Draw two groups of &lt;code&gt;n-1&lt;/code&gt; rows, leaving two empty lines between them&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;|  |  |  |  |&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA; &#xA;&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Connect each top bar to the bottom bar one position right with a slanted line of two &lt;code&gt;\&lt;/code&gt;, then close off the two unused bars with a &lt;code&gt;/&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;|  |  |  |  |&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA; \  \  \  \/&#xA; /\  \  \  \&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Complete the S on the top and bottom by drawing lines sloping inwards that meet at the center. When &lt;code&gt;n&lt;/code&gt; is odd, a gap of one space is left and the center bar isn't used.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;     / \&#xA;    /   \&#xA;   /     \&#xA;  /  / \  \&#xA; /  /   \  \&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA; \  \  \  \/&#xA; /\  \  \  \&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA;|  |  |  |  |&#xA; \  \   /  /&#xA;  \  \ /  /&#xA;   \     /&#xA;    \   /&#xA;     \ /&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Spun off from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7258/20260&quot;&gt;this Sandboxed challenge&lt;/a&gt; by Beta Decay.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-13T22:32:51.697" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9181" PostTypeId="2" ParentId="9140" CreationDate="2016-05-14T06:35:17.100" Score="4" Body="&lt;p&gt;Since the question of mine that was nominated here was received so poorly, allow me to nominate one of my own:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/26232/create-a-flood-paint-ai/26313#26313&quot;&gt;Build a Flood Paint AI&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's relatively old (from 2014).&lt;/li&gt;&#xA;&lt;li&gt;It's only got about 3,000 views so far, even with 27 upvotes.&lt;/li&gt;&#xA;&lt;li&gt;It has a very granular scoring criterion, with 7-digit scores sometimes varying by as little as a few hundred.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;The optimal solution is still unknown.&lt;/strong&gt; (In fact, this particular problem is &lt;a href=&quot;http://www.bris.ac.uk/news/2010/6945.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;NP-hard&lt;/a&gt;.)&lt;/li&gt;&#xA;&lt;li&gt;It's relatively easy, but not trivial, to write a solution for and prove that it works.&lt;/li&gt;&#xA;&lt;li&gt;There's lots of different, creative approaches that can be taken to solve this problem.&lt;/li&gt;&#xA;&lt;li&gt;No loophole abuse; because the challenge is algorithmic in nature, there's not really a flaw in the spec that can be exploited to produce a trivial good-scoring answer.&lt;/li&gt;&#xA;&lt;li&gt;No esolang abuse; because the challenge is algorithmic in nature, golfing languages do not have a natural advantage in producing better-scoring answers than long-form languages.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Cons: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It requires a large input file, which is mirrored on a third-party website.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There are a bunch of existing solutions (although the last time anyone actually posted a new answer was May 2014, two years ago).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It has one of my famous &quot;last-place reference solutions&quot;, which is something I do with a lot of my code-challenge questions that was recently declared as frowned upon.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The answer for this problem in particular, however, requires a bit of proof to show that it's actually valid, so I think it can stay there. It also acts as a bare-minimum guideline — if your solution is not at least as good as this one, it shouldn't be submitted, because there's something wrong with it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="7110" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-05-22T23:31:48.023" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9182" PostTypeId="2" ParentId="9140" CreationDate="2016-05-14T16:24:43.663" Score="3" Body="&lt;p&gt;Here's also another test-battery question for your consideration:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/48509/build-a-minimum-clue-sudoku-unsolver&quot;&gt;Build a minimum-clue Sudoku unsolver&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's only got about 600 views so far, even with 11 upvotes.&lt;/li&gt;&#xA;&lt;li&gt;It's only got 3 answers right now, so the solution space is largely unexplored as of now.&lt;/li&gt;&#xA;&lt;li&gt;It has a very granular scoring criterion, with 7-digit scores sometimes varying by as little as a few hundred.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;The optimal solution is still unknown.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;There's lots of different, creative approaches that can be taken to solve this problem.&lt;/li&gt;&#xA;&lt;li&gt;No loophole abuse; because the challenge is algorithmic in nature, there's not really a flaw in the spec that can be exploited to produce a trivial good-scoring answer.&lt;/li&gt;&#xA;&lt;li&gt;No esolang abuse; because the challenge is algorithmic in nature, golfing languages do not have a natural advantage in producing better-scoring answers than long-form languages.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Cons: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It requires a large input file, which is mirrored on a third-party website.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It's a bit harder than the Flood Paint problem to prove that a solution will work.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It has a last-place reference solution just like the Flood Paint one. This one isn't quite as novel though, so I can remove it if desired.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="7110" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-05-22T23:31:36.537" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9183" PostTypeId="2" ParentId="2140" CreationDate="2016-05-14T19:19:13.880" Score="0" Body="&lt;h2&gt;&quot;45-degree rotation&quot; of a square matrix&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Suppose we have a square matrix with odd sidelength, like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 1 2 3 4&#xA;5 6 7 8 9&#xA;0 1 2 3 4&#xA;5 6 7 8 9&#xA;0 1 2 3 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Let's divide it into nested layers as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 1 2 3 4&#xA; +-----+&#xA;5|6 7 8|9&#xA; | +-+ |&#xA;0|1|2|3|4&#xA; | +-+ |&#xA;5|6 7 8|9&#xA; +-----+&#xA;0 1 2 3 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;n&lt;/code&gt;th layer, counting from the center, contains &lt;code&gt;8*(n-1)&lt;/code&gt; cells, and we &#xA;rotate it &lt;code&gt;n-1&lt;/code&gt; steps in the clockwise direction:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 5 0 1 2&#xA; +-----+&#xA;5|1 6 7|3&#xA; | +-+ |&#xA;0|6|2|8|4&#xA; | +-+ |&#xA;1|7 8 3|9&#xA; +-----+&#xA;2 3 4 9 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now our original matrix has been &quot;rotated by 45 degrees&quot;, in a sense:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 5 0 1 2&#xA;5 1 6 7 3&#xA;0 6 2 8 4&#xA;1 7 8 3 9&#xA;2 3 4 9 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Namely, if this operation is applied twice, the result is a 90-degree rotation.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your input is an &lt;code&gt;n&amp;times;n&lt;/code&gt; matrix of single-digit integers, where &lt;code&gt;n&lt;/code&gt; is odd, in any reasonable format.&#xA;Your output is the 45-degree rotation of this matrix, as defined above.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules and scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You can write a full program or function.&#xA;The lowest byte count wins, and standard loopholes are disallowed.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[3]] -&amp;gt; [[3]]&#xA;[[1,2,3],[4,5,6],[7,8,9]] -&amp;gt; [[4,1,2],[7,5,3],[8,9,6]]&#xA;[[0,1,2,3,4],[5,6,7,8,9],[0,1,2,3,4],[5,6,7,8,9],[0,1,2,3,4]] -&amp;gt; [[0,5,0,1,2],[5,1,6,7,3],[0,6,2,8,4],[1,7,8,3,9],[2,3,4,9,4]]&#xA;[[1,0,0,2,0,0,3],[0,1,0,2,0,3,0],[0,0,1,2,3,0,0],[4,4,4,5,0,0,0],[4,4,4,4,0,0,0],[4,4,4,4,0,6,7],[4,4,4,4,0,8,9]] -&amp;gt; [[4,0,0,1,0,0,2],[4,4,0,1,0,2,0],[4,4,4,1,2,0,0],[4,4,4,5,3,3,3],[4,4,4,0,0,0,0],[4,4,0,6,0,0,0],[4,0,8,9,7,0,0]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="32014" LastActivityDate="2016-05-14T19:19:13.880" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9187" PostTypeId="2" ParentId="9140" CreationDate="2016-05-15T22:13:47.197" Score="-1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/53199/lossy-ascii-art-compression&quot;&gt;Lossy ASCII art compression&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; rel=&quot;tag&quot;&gt;compression&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Quality:&lt;/strong&gt; Unambiguous spec, script to verify and score outputs, objective validity criterion and scoring.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Difficulty:&lt;/strong&gt; Challenging enough to be interesting, but naive approaches are possible because the required compression quality is a lower limit, not a strict target, allowing a range of solutions gradually getting nearer to optimal. Optimal is likely unattainable, so the challenge is open ended. This has a nice balance of easy to enter and difficult to win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Acceptability of new answers:&lt;/strong&gt; Does not require challenge author's involvement to score new solutions. No upper limit on number of solutions. A wide variety of approaches is likely to be possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Visibility:&lt;/strong&gt; Posted July 2015. No answers yet. 12 upvotes and 597 views. An intriguing but accessible challenge that seems to have flown under the radar.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-05-15T22:13:47.197" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9190" PostTypeId="2" ParentId="2140" CreationDate="2016-05-16T18:13:54.690" Score="0" Body="&lt;h1&gt;KOTH Screeps Fighting AI &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://screeps.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Screeps&lt;/a&gt; is an MMO for programmers (not a regular MMO, this is not modding, but rather the only way to play) where you program creeps. I want to make sure one more time: this is not hacking or modding, this is the only way you play the game. It has a builtin IDE that is always present.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is your job: With 1550 energy, spawn an army of creeps to fight other player's armies. Your goal is to destroy the other team's spawn.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specifications&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each team will start with 0 creeps and it's own spawn. &lt;/li&gt;&#xA;&lt;li&gt;The team number will be hardcoded.&lt;/li&gt;&#xA;&lt;li&gt;The spawns will be named Spawn1 and Spawn2, corresponding to each player's team&lt;/li&gt;&#xA;&lt;li&gt;The room controller will be at level 8 and you will not have to worry about upgrading it.&lt;/li&gt;&#xA;&lt;li&gt;Each creep will display an emoji chosen to represent it's team using &lt;code&gt;creep.say()&lt;/code&gt;. This is so that members of the two teams can distinguished. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Not all creeps have to fight. Some can gather energy, build walls, etc.&lt;/li&gt;&#xA;&lt;li&gt;Building structures is allowed. This includes walls, ramparts, towers, etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;This is under construction! Please comment if you know how to improve this challenge!&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2016-05-16T18:13:54.690" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9192" PostTypeId="2" ParentId="2140" CreationDate="2016-05-17T11:56:24.047" Score="1" Body="&lt;h2&gt;Kill the mosketeers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Taken a &lt;code&gt;NxN&lt;/code&gt; square field, where you are supposed to be on the extreme upper right corner, &lt;code&gt;n&lt;/code&gt; mosketeers are waiting an execution instruction that begins with the first lefttmost shooter alternatively until the last righttmost one, in a continuous unceasable order, meanwhile, between any shot and another you are allowed to move one step either  to 4 allowed perpendicular directions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;T&lt;/code&gt; a period permitted to reload the riffle from a shot to another, dependently of steps taken from a move to another, a step is expressed in other words, as the time taken from two consecutive shots that of a mosketeer and his neighbor, so once T steps are elapsed, the mosketeer takes turn to shot again where two shots can occur in real-time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task, is more than saving your head on your shoulders, but it is rather the ability of killing all the mosketeers while they are reloading their riffles by a knife, &lt;strong&gt;noted&lt;/strong&gt; that : a mosketeer can shot in an horizontal dimention if his turn comes out, and no moketeer is between him and you, morover, a  mosketeer do never move.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given two inputs, &lt;code&gt;N&lt;/code&gt; &lt;code&gt;T&lt;/code&gt;, say in term of integer output how many mosketeers you are able to kill, return &lt;code&gt;-1&lt;/code&gt; or nil the case you end up killed no matter what you tried.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   4,3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;steps:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;...*  |... .|.. ..|. |..| .|.. ..|. |..| .|.. ..|. ...| .... ....&#xA;....  |..* .|.. ..|. |..| .|.. ..|. |..| .|.. ..|. ...| .... ....&#xA;....  |... .|.* ..|* |.*| .|*. .*|. |*.| *|.. ..|. ...| .... ....&#xA;$$$$  |$$$ $|$$ $$|$ |$$| $|$$ $$|$ |$$| $|$$ *$$$ .*$| ..*$ ...*&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;example 2&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   4,2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;steps:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;...*  |... .|.. |.|. .|.| |... .|.| |... .|.| .... .|.| &#xA;....  |..* .|.. |.|. .|.| |... .|.| |... .|.| .... .|.| &#xA;....  |... .|.* |.|* .|*| |... .|*| |*.. *|.| .... *|.| &#xA;$$$$  |$$$ $|$$ |$|$ $|$| |$*$ $$.$ $$.$ $$.$ *$.$ .$.$ &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;" OwnerUserId="38337" LastEditorUserId="38337" LastEditDate="2016-05-19T12:43:35.180" LastActivityDate="2016-05-19T12:43:35.180" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9194" PostTypeId="2" ParentId="7377" CreationDate="2016-05-17T20:53:59.383" Score="1" Body="&lt;h1&gt;Byte size based on per block diskspace&lt;/h1&gt;&#xA;&lt;p&gt;In an earlier version (1.2), minecraft began getting a lot more blocks than before. This made the developers rewrite the code and use a &lt;code&gt;short&lt;/code&gt; instead of a &lt;code&gt;byte&lt;/code&gt; (I say this from experience), thus increasing a block's size to 2 bytes in memory. The disk space however is different from this. Minecraft blocks can only have 4096 different ids, thus making them take up 12 bit (1.5 bytes) each.&lt;/p&gt;&#xA;&lt;p&gt;This format is the so called anvil file format.&lt;/p&gt;&#xA;&lt;p&gt;Reference: &lt;a href=&quot;http://minecraft.gamepedia.com/Anvil_file_format&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://minecraft.gamepedia.com/Anvil_file_format&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The text in the command blocks remained the same, a character can take up a byte, as in &amp;quot;normal&amp;quot; languages.&lt;/p&gt;&#xA;" OwnerUserId="49709" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-17T21:13:09.523" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9197" PostTypeId="2" ParentId="2140" CreationDate="2016-05-17T22:12:22.653" Score="1" Body="&lt;h1&gt;Collatz or Hailstone sequence efficiently&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sorry for everywhere I posted in the wrong place and thank you to all of the mods for helping me find the sandbox. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Winner is the shortest run time to check whether all numbers up to N will end in x=1 or goes 70 iterations without returning to the original number or without decreasing under a step over Log(N) steps in a row under iterating f(x)=x/2 if x is even and f(x)=(3x+1)/2 if x is odd.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hint: all one needs to show is that for all x under iteration it hits another y in the sequence that has already been shown to hit 1.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How can I phrase the above challenge. I set it with parameters that halt for all natural numbers n. I care more about the speed of the program then the shortness of the program.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="53791" LastEditorUserId="20283" LastEditDate="2016-05-18T06:46:17.190" LastActivityDate="2016-05-18T06:46:17.190" CommentCount="19" ContentLicense="CC BY-SA 3.0" />
  <row Id="9198" PostTypeId="2" ParentId="2140" CreationDate="2016-05-18T03:05:04.110" Score="2" Body="&lt;h1&gt;Three Indistinguishable Dice&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given three dice rolls (integer values from 1-6) in sorted order (so as to be indistinguishable), write a program that converts them to the sum of two dice with an identical distribution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://www.youtube.com/watch?v=xHh0ui5mi_E&quot; rel=&quot;nofollow noreferrer&quot;&gt;standupmath's The Three Indistinguishable Dice Puzzle&lt;/a&gt;. A follow-up &lt;a href=&quot;https://www.youtube.com/watch?v=hBBftD7gq7Y&quot; rel=&quot;nofollow noreferrer&quot;&gt;&quot;solution&quot; video&lt;/a&gt; was also posted, but arguing about &quot;elegance&quot; of one way or another is a bit subjective. Counting characters isn't. &lt;code&gt;:D&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Details&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Score is the length of the program in characters&lt;/li&gt;&#xA;&lt;li&gt;The program can be a function that's called somehow, or executable script that reads from stdin, or whatever's convienent.&lt;/li&gt;&#xA;&lt;li&gt;No &quot;rerolling&quot; by getting entropy from another source&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example Test Code&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Rather than doing any sort of probabilistic testing, it's easy enough to rip through the 216 (6&lt;sup&gt;3&lt;/sup&gt;) cases of all the three dice and assert that your function returns each value as many times as it should. It will be called with identical parameters (e.g. the cases &lt;code&gt;1, 2, 3&lt;/code&gt; and &lt;code&gt;3, 2, 1&lt;/code&gt;, ... are presumed indistinguishable and are (arbitrarily) converted to &lt;code&gt;1, 2, 3&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The below is in Python, written hopefully generically enough to be clear to port. If your language of choice uses stdin/stdout, it would be a bit different. The testing code is just for testing and not scored (though if you want to provide it for other users of your language or I/O method, that might be useful).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;from thing import f&#xA;&#xA;# this is the fair distribution of the sum of two dice, &#xA;# multiplied by 6 (because each should be hit 6x more)&#xA;dist = {&#xA;    2: 6,   12: 6,&#xA;    3: 12,  11: 12,&#xA;    4: 18,  10: 18,&#xA;    5: 24,   9: 24,&#xA;    6: 30,   8: 30,&#xA;    7: 36,&#xA;}&#xA;&#xA;d = [1, 2, 3, 4, 5, 6]&#xA;for i in d:&#xA;    for j in d:&#xA;        for k in d:&#xA;            ijk = sorted([i, j, k])&#xA;            result = f(ijk)&#xA;            dist[result] -= 1&#xA;&#xA;for key in dist:&#xA;    assert dist[key] == 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="176" LastActivityDate="2016-05-18T03:05:04.110" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9200" PostTypeId="1" CreationDate="2016-05-19T12:14:21.567" Score="2" ViewCount="76" Body="&lt;p&gt;So given for example a challenge with rather specific input and varying output (i.e. image-processing challenges) is it considered &quot;fair play&quot; to copy input processing logic from other answers? (for example logic to load an image to memory).&lt;/p&gt;&#xA;" OwnerUserId="52213" LastActivityDate="2016-05-19T13:40:56.770" Title="Copying parts of other programs not related to solution" Tags="|discussion|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9201" PostTypeId="2" ParentId="9200" CreationDate="2016-05-19T13:15:28.367" Score="1" Body="&lt;h1&gt;Copying part of an answer is a matter of good taste&lt;/h1&gt;&#xA;&lt;p&gt;Consider &lt;a href=&quot;https://codegolf.stackexchange.com/questions/74648/convert-to-camelcase/&quot;&gt;a previous challenge&lt;/a&gt; where users had to convert text to camel case.  Nearly all of the solutions had a regex, and most of the answers used identical or similar regexes.&lt;/p&gt;&#xA;&lt;p&gt;While regex can certainly be golfed (and was in in the previous example), the regex portion of the answer was small enough that we were OK if it got duplicated across answers.&lt;/p&gt;&#xA;&lt;p&gt;So, in response to your question:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Is input processing a core part of the question?  If so, then don't copy.  If not, then you should be fine.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;What is considered &amp;quot;core&amp;quot; can be different between people, so if you are unsure, ask.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-19T13:15:28.367" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9202" PostTypeId="2" ParentId="9200" CreationDate="2016-05-19T13:40:56.770" Score="1" Body="&lt;h1&gt;It's usually OK, if you credit the author&lt;/h1&gt;&#xA;&lt;p&gt;There were countless challenges, where some users made their on algorithms, but then someone else came (usually Martin Büttner or Dennis), and made a new, very short algorithm. After this, others began using that algorithm.&lt;/p&gt;&#xA;&lt;p&gt;It's usually OK, if..&lt;/p&gt;&#xA;&lt;p&gt;...the original author don't mind it.&lt;/p&gt;&#xA;&lt;p&gt;...You credit the original author of the code/algorithm.&lt;/p&gt;&#xA;" OwnerUserId="49709" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-19T13:40:56.770" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9204" PostTypeId="2" ParentId="2140" CreationDate="2016-05-19T19:56:05.190" Score="-3" Body="&lt;h1&gt;The FitnessGram™ Code Golf Test&lt;/h1&gt;&#xA;&lt;p&gt;Same concept and rules to the well-known Rick Astley post a while back, only instead of using samples of various sizes, sample length is limited to what number sample it is.  &lt;a href=&quot;http://pastebin.com/knuvEDyA&quot; rel=&quot;nofollow noreferrer&quot;&gt;And different text for the program to write.&lt;/a&gt;&lt;br /&gt;&#xA;It's code golf, so standard loopholes apply, and fewest bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="53819" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-19T19:56:05.190" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9207" PostTypeId="2" ParentId="2140" CreationDate="2016-05-20T02:44:57.753" Score="1" Body="&lt;h1&gt;Scry sort&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In Magic the Gathering, your library is a stack of cards, the effect Scry 2 causes you to take the top two cards of your library and arrange them as you choose on the top and/or bottom of your library. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://gatherer.wizards.com/Handlers/Image.ashx?multiverseid=205049&amp;amp;type=card&quot; rel=&quot;nofollow&quot;&gt;&lt;img src=&quot;http://gatherer.wizards.com/Handlers/Image.ashx?multiverseid=205049&amp;amp;type=card&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You have six total choices:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Put both cards on top in either order&lt;/li&gt;&#xA;&lt;li&gt;Put one cards on the bottom and one on top&lt;/li&gt;&#xA;&lt;li&gt;Put both cards on the bottom in either order&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If you are able to Scry 2 at will, you can repeatedly do so to arrange your library in any order. In this challenge, the cards of your library will be numbered from 1 to n, and your goal will be to arrange them in sorted order.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;What should be the challenge here?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Code golf to find the minimum number of Scry 2's needed&lt;/li&gt;&#xA;&lt;li&gt;Code golf to find any sequence that arranges your library, no matter how long&lt;/li&gt;&#xA;&lt;li&gt;Fastest code or code challenge to sort in as few Scry 2's as possible.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2016-05-20T02:44:57.753" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9209" PostTypeId="2" ParentId="2140" CreationDate="2016-05-20T12:54:54.033" Score="1" Body="&lt;h1&gt;Matching a string using a huge number of steps&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to write a regex that matches a string you defined in as close to &lt;strong&gt;&lt;code&gt;n&lt;/code&gt;&lt;/strong&gt; steps as is humanly possible.&lt;/p&gt;&#xA;&lt;p&gt;The regex must match the whole string without the &lt;code&gt;g&lt;/code&gt;lobal flag on.&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;The score would be &lt;code&gt;regex length&lt;/code&gt; + &lt;code&gt;string length&lt;/code&gt; + &lt;code&gt;absolute difference between the number of steps and n&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For example, if &lt;code&gt;n&lt;/code&gt; = 65536, &lt;a href=&quot;https://regex101.com/r/mL6gS1/1&quot; rel=&quot;nofollow noreferrer&quot;&gt;this example&lt;/a&gt; has 6 bytes as regex, 49152 bytes in the string, and 65539 steps, which would account for a total score of 6+49152+3=49161.&lt;/p&gt;&#xA;&lt;p&gt;Lowest score wins.&lt;/p&gt;&#xA;&lt;h1&gt;Requirements&lt;/h1&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;n&lt;/code&gt; = 65536 (&lt;code&gt;2**16&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;n&lt;/code&gt; = 59049 (&lt;code&gt;3**10&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;n&lt;/code&gt; = 40320 (&lt;code&gt;8!&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The total score will calculated from the scores of the three programs.&lt;/p&gt;&#xA;&lt;h3&gt;Questions:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How can I make this challenge better?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="48934" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-23T14:19:36.570" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9212" PostTypeId="2" ParentId="2140" CreationDate="2016-05-21T00:56:05.767" Score="1" Body="&lt;h1&gt;International Choice of Urinal Protocol efficiency&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;A long while ago, Randall Munroe of xkcd fame wrote a blog post entitled &lt;a href=&quot;https://blog.xkcd.com/2009/09/02/urinal-protocol-vulnerability/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Urinal protocol vulnerability&lt;/a&gt;. The titular &amp;quot;International Choice of Urinal Protocol&amp;quot; is that when men enter a bathroom that has a row of urinals along the wall, they will first take the end urinals, and then take the urinals that are furthest from the other men. All men seek to avoid awkwardness, which happens when two men use adjacent urinals.&lt;/p&gt;&#xA;&lt;p&gt;For example, if there are five urinals in a row, then by following this protocol, men will take urinals in this order:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;UUUUU&#xA;1 3 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In this case, the packing efficiency is optimal. However, when there are seven urinals, then this happens:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;UUUUUUU&#xA;1  3  2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is essentially the worst case. Fewer than half of the urinals are used, and Randall continues investigating when the best and worst cases happen. For this challenge, though, your only task is to calculate the packing efficiency of this protocol when given a number &lt;code&gt;n&lt;/code&gt; of urinals, which is &lt;code&gt;k/n&lt;/code&gt; where &lt;code&gt;k&lt;/code&gt; is the number of urinals taken before awkwardness ensues.&lt;/p&gt;&#xA;&lt;h2&gt;Spec&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;Standard I/O&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply.&lt;/li&gt;&#xA;&lt;li&gt;Input is a single positive integer &lt;code&gt;n&lt;/code&gt;, which may be given as either decimal or unary.&lt;/li&gt;&#xA;&lt;li&gt;Output must be either a float or a simplified fraction. If your language cannot do either of these easily (e.g. BF or Retina), then you may simply output &lt;code&gt;k&lt;/code&gt; (in decimal or unary).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Decimal&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 1 1.0&#xA; 2 0.5&#xA; 3 0.6666666666666666&#xA; 4 0.5&#xA; 5 0.6&#xA; 6 0.5&#xA; 7 0.42857142857142855&#xA; 8 0.5&#xA; 9 0.5555555555555556&#xA;10 0.5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Fractions&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 1 1/1 {or} 1&#xA; 2 1/2&#xA; 3 2/3&#xA; 4 1/2&#xA; 5 3/5&#xA; 6 1/2&#xA; 7 3/7&#xA; 8 1/2&#xA; 9 5/9&#xA;10 1/2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Urinals taken &lt;code&gt;k&lt;/code&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 1 1&#xA; 2 1&#xA; 3 2&#xA; 4 2&#xA; 5 3&#xA; 6 3&#xA; 7 3&#xA; 8 4&#xA; 9 5&#xA;10 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Note: this is &lt;a href=&quot;https://oeis.org/A166079&quot; rel=&quot;nofollow noreferrer&quot;&gt;A166079&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Related: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/47952/the-urinal-protocol&quot;&gt;The Urinal Protocol&lt;/a&gt;, which asks for all the possible ways men could take urinals with no restriction on the first and no awkwardness.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="12914" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-21T10:51:13.227" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9213" PostTypeId="2" ParentId="2140" CreationDate="2016-05-21T07:42:15.777" Score="2" Body="&lt;h1&gt;Brainfuck-golf: find the maximum of two numbers&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;You will be provided with two numbers on the first two memory cells, and you will write a code in brainfuck to put the maximum of the two numbers on the third memory cell.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may use &lt;a href=&quot;http://fatiherikli.github.io/brainfuck-visualizer/#KysrPisrKysrPA==&quot; rel=&quot;nofollow noreferrer&quot;&gt;this template&lt;/a&gt; and &lt;a href=&quot;http://fatiherikli.github.io/brainfuck-visualizer/#KysrKys+KysrPA==&quot; rel=&quot;nofollow noreferrer&quot;&gt;this template&lt;/a&gt; to test your code. Just append your code to the templates.&lt;/li&gt;&#xA;&lt;li&gt;You may destroy the numbers in the first two cells.&lt;/li&gt;&#xA;&lt;li&gt;The pointer must initially point to the first cell.&lt;/li&gt;&#xA;&lt;li&gt;The two initial numbers will be positive.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;,&lt;/code&gt; will halt your program (waits for input which I will not supply).&lt;/li&gt;&#xA;&lt;li&gt;The tape is semi-infinite. Your numbers are on the first two memory cells.&lt;/li&gt;&#xA;&lt;li&gt;The cells do not wrap around. They just increase until the number is bigger than the age of the universe in terms of picoseconds.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="48934" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-23T14:30:05.640" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9214" PostTypeId="2" ParentId="2140" CreationDate="2016-05-21T17:05:42.170" Score="0" Body="&lt;h1&gt;Serialize and Deserialize a Binary Tree!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;A coding website, &lt;a href=&quot;https://leetcode.com/faq/#binary-tree&quot; rel=&quot;nofollow noreferrer&quot;&gt;leetcode.com&lt;/a&gt;, has a method to serialize a binary tree.&lt;/p&gt;&#xA;&lt;p&gt;Serialize means making a binary tree linear.&lt;/p&gt;&#xA;&lt;p&gt;For example, we have:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1,[[2],[3,4,5]]]&#xA;&#xA;    1&#xA;   / \&#xA;  2   3&#xA;     / \&#xA;    4   5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;First, we fill the missing places with &lt;code&gt;0&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;      1&#xA;     / \&#xA;    /   \&#xA;   /     \&#xA;  2       3&#xA; / \     / \&#xA;0   0   4   5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Then read out all the lines from top to bottom:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;-&amp;gt;      1&#xA;       / \&#xA;      /   \&#xA;     /     \&#xA;-&amp;gt;  2       3&#xA;   / \     / \&#xA;-&amp;gt; 0   0   4   5&#xA;&#xA;[1,2,3,0,0,4,5]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Let's look at another example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;   1&#xA;    \&#xA;     2&#xA;    /&#xA;   3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Fill the missing places with &lt;code&gt;0&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;   1&#xA;  / \&#xA; 0   2&#xA;    / \&#xA;   3   0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that &lt;code&gt;0&lt;/code&gt; cannot have any child.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, this tree is serialized as &lt;code&gt;[1,0,2,3,0]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to write two programs/functions, one to serialize, one to deserialize.&lt;/p&gt;&#xA;&lt;h2&gt;Specs&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;They may share code.&lt;/li&gt;&#xA;&lt;li&gt;The binary tree will only contain positive integers.&lt;/li&gt;&#xA;&lt;li&gt;A node in the binary tree is represented by &lt;code&gt;[name,left_child,right_child]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You may &lt;strong&gt;not&lt;/strong&gt; pre-fill the binary tree with &lt;code&gt;0&lt;/code&gt;s.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[1,0,2,3,0,0,0]&lt;/code&gt; is invalid.&lt;/li&gt;&#xA;&lt;li&gt;Unlike the website given, &lt;code&gt;[1,0,2,3]&lt;/code&gt; is invalid.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Notes&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Subset of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/339/binary-tree-encoding&quot;&gt;this challenge&lt;/a&gt;, but this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; instead.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="48934" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-21T17:17:39.673" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9217" PostTypeId="2" ParentId="2140" CreationDate="2016-05-22T01:16:21.503" Score="0" Body="&lt;h2&gt;String covering&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a target string and a list of fragment strings, determine whether the target string can be formed by concatenating fragments, allowing overlaps. Each fragment can be used any number of times.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;cataract, [tar, car, tar, act, rat] -&amp;gt; True&#xA;&#xA;cataract&#xA;cat&#xA;  tar&#xA;     act&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Is this a dupe? It's hard to search for. Is it too similar to &lt;a href=&quot;https://codegolf.stackexchange.com/q/70289/20260&quot;&gt;Imposters at the Zoo&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:21.580" LastActivityDate="2016-05-22T01:16:21.503" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9218" PostTypeId="2" ParentId="2140" CreationDate="2016-05-22T04:18:20.727" Score="3" Body="&lt;h2&gt;Simultaneous variable updates&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Suppose we have the following code snippet:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a = 2*b + c&#xA;b = a - b + c&#xA;c = a + 3*c&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In most programming languages, the above three lines would execute one after the other. This means that the &lt;code&gt;a&lt;/code&gt; on the second and third lines would refer to the &lt;em&gt;updated&lt;/em&gt; value of &lt;code&gt;a&lt;/code&gt;, rather than the value of &lt;code&gt;a&lt;/code&gt; before this code block ran.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we wanted to see how &lt;code&gt;a&lt;/code&gt;, &lt;code&gt;b&lt;/code&gt;, &lt;code&gt;c&lt;/code&gt; actually changes as the result of running the above three lines, we'd have to substitute earlier variable updates into later expressions, like so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a = 2*b + c&#xA;b = a - b + c = (2*b + c) - b + c = b + 2*c&#xA;c = a + 3*c   = (2*b + c) + 3*c   = 2*b + 4*c&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Hence, the first code block is equivalent to the following in languages like Python, which support simultaneous variable updates:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a, b, c = 2*b + c, b + 2*c, 2*b + 4*c&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We can rewrite the original code block and the updated code block in matrix form, like so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[ 0  2  1 ]        [ 0  2  1 ]&#xA;[ 1 -1  1 ]   -&amp;gt;   [ 0  1  2 ]&#xA;[ 1  0  3 ]        [ 0  2  4 ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For example, the second rows of the input/output matrices above refer to &lt;code&gt;b = a - b + c&lt;/code&gt; and &lt;code&gt;b = b + 2*c&lt;/code&gt; respectively. Expressing the update step in the latter, simultaneous form is useful since we can perform multiple updates very easily, using matrix exponentiation (which we will not do in this challenge).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's one more example, for clarity:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;                                              Input matrix:&#xA;a = a - b + d                                 [  1 -1  0  1 ]&#xA;b = 2*b + c                                   [  0  2  1  0 ]&#xA;c = -2a - b + d                               [ -2 -1  0  1 ]&#xA;d = b + c                                     [  0  1  1  0 ]&#xA;&#xA;                                              Output matrix:&#xA;a = a - b + d                                 [  1 -1  0  1 ]&#xA;b = 2*b + c                                   [  0  2  1  0 ]&#xA;c = -2*(a-b+d)-(2*b+c)+d = -2*a - c - d       [ -2  0 -1 -1 ]&#xA;d = (2*b+c)+(-2*a-c-d) = -2*a + 2*b - d       [ -2  2  0 -1 ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;The task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a square input matrix representing a sequence of variable updates one after the other, output the corresponding matrix which represents the variable updates being applied simultaneously.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may write either a function or a full program. The exact input/output format is flexible, as long as rows are separated from other rows and individual matrix entries are distinguishable. You may assume that entries in the input/output are integers in the range &lt;code&gt;[-127, 127]&lt;/code&gt;, and that the matrix will be at least 2x2.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the goal is to reduce the number of bytes in your program as much as possible.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;TODO. Will contain:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Several simple 2x2 examples&lt;/li&gt;&#xA;&lt;li&gt;The above examples, plus a few more 3x3 or 4x4s&lt;/li&gt;&#xA;&lt;li&gt;An example with input rows all zero&lt;/li&gt;&#xA;&lt;li&gt;An example with input columns all zero&lt;/li&gt;&#xA;&lt;li&gt;Large examples: dense 10x10, sparse 10x10&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Questions for the sandbox&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any potential of being a dupe?&lt;/li&gt;&#xA;&lt;li&gt;Any interesting test cases?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="21487" LastActivityDate="2016-05-22T04:18:20.727" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9222" PostTypeId="1" AcceptedAnswerId="9223" CreationDate="2016-05-22T13:29:58.870" Score="9" ViewCount="194" Body="&lt;p&gt;Yesterday google turned up &quot;codegolf.xyz&quot;.  It seems to be an up-to-date mirror of codegolf.se but not exactly.  For instance, if I go to the first question and click &quot;more comments&quot;, it doesn't show me more comments.  Is this a legitimate mirror or is it something else?&lt;/p&gt;&#xA;" OwnerUserId="17193" LastActivityDate="2016-05-22T14:55:16.833" Title="What is codegolf.xyz?" Tags="|support|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9223" PostTypeId="2" ParentId="9222" CreationDate="2016-05-22T14:47:53.173" Score="9" Body="&lt;h2&gt;Original Intent&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I created this domain a while back when there were many new challenges involving some kind of parsing on the PPCG site. For a while, only some sites redirected to actual PPCG sites and originally, I planned to create online interpreters for various exotic languages used on PPCG.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Now&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Now, many shorter domains exists, including ppcg.lol (and .ga) etc.&lt;/li&gt;&#xA;&lt;li&gt;Dennis' TIO now provides the interpreter functionality.&lt;/li&gt;&#xA;&lt;li&gt;As kind of a PHP exercise, I rewrote the site. It's &lt;em&gt;not&lt;/em&gt; a mirror, but a proxy.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The source for the proxy can be found here: &lt;a href=&quot;https://github.com/minxomat/codegolf.xyz&quot; rel=&quot;nofollow&quot;&gt;https://github.com/minxomat/codegolf.xyz&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thus, the &quot;site&quot; that appears on the proxy can't be out of date, since it is re-fetched (with occasional caching) every time one visits. Login and a bunch of not-PPCG site features don't work and this &lt;em&gt;is&lt;/em&gt; intentional. One should &lt;em&gt;never&lt;/em&gt; input credentials through &lt;em&gt;any&lt;/em&gt; kind of proxy. codegolf.xyz has an experimental HTTPS mode, where every resource is rewritten to be fetched over HTTPS (which currently has a bug where some links are forced to https even if they don't support it).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Trivia: The cg.xyz site usually loads faster than the actual site due to some caching shenanigans. My use for this site is as a playground for DNS-level caching and compression. About 1,6k organic, unique (non-search-engine) users use this proxy every month.&lt;/p&gt;&#xA;" OwnerDisplayName="user42643" LastEditorDisplayName="user42643" LastEditDate="2016-05-22T14:55:16.833" LastActivityDate="2016-05-22T14:55:16.833" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9224" PostTypeId="2" ParentId="2140" CreationDate="2016-05-22T19:54:17.173" Score="0" Body="&lt;h1&gt;What can I build? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;The Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Today I have decided to make geometric shapes out of toothpicks and gumdrops! However, I have a limited supply, so you have to figure out what I can build.&#xA;I will give you an input in the format &lt;code&gt;m n&lt;/code&gt;, where m is toothpicks (edges) and n is gumdrops (vertices.) Your output should be, in any output format of your choice, all 3D geometric shapes such that the amount of edges=m and the amount of vertices=n. The list of 3D geometric shapes you will  use is this: &#xA;&lt;a href=&quot;https://gist.github.com/ev3commander/e3acb95665c44e825ee33671601a49d3&quot; rel=&quot;nofollow noreferrer&quot;&gt;Gist&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may &lt;b&gt;NOT&lt;/b&gt; access the Internet.&lt;/li&gt;&#xA;&lt;li&gt;No builtins relating to geometry or solids&lt;/li&gt;&#xA;&lt;li&gt;This is code golf, so shortest code wins.&lt;/li&gt;&#xA;&lt;li&gt;For no solids and invalid input, output nothing&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In: &lt;code&gt;3 2&lt;/code&gt;&#xA;Out: &lt;code&gt;&amp;lt;empty&amp;gt;&lt;/code&gt;&#xA;&lt;br&gt;&#xA;In: &lt;code&gt;CodeGolf123&lt;/code&gt; Out: &lt;code&gt;&amp;lt;empty&amp;gt;&lt;/code&gt;&lt;br&gt;&#xA;In: &lt;code&gt;12 6&lt;/code&gt; Out (Bonus): &lt;code&gt;{regular tetrahedron,unit equilateral square pyramid,unit equilateral triangular dipyramid,unit equilateral triangular prism,unit equilateral pentagonal pyramid,regular octahedron}&lt;/code&gt; Out (Regular): &lt;code&gt;{regular octahedron}&lt;/code&gt;&#xA;`&lt;/p&gt;&#xA;" OwnerDisplayName="user46167" LastEditorDisplayName="user46167" LastEditDate="2016-05-26T23:56:55.697" LastActivityDate="2016-05-26T23:56:55.697" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9225" PostTypeId="1" CreationDate="2016-05-23T06:34:14.337" Score="26" ViewCount="501" Body="&lt;p&gt;&lt;a href=&quot;https://puzzling.meta.stackexchange.com/questions/4862/what-is-our-reason-for-wanting-bounties-on-questions&quot;&gt;Over on Puzzling.SE&lt;/a&gt;, the community there has been discussing various ways to reward puzzle authors for creating exemplary puzzles. Given that we're like Puzzling.SE in that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8350/45941&quot;&gt;we're not a Q&amp;amp;A site&lt;/a&gt;, and that we've &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7683/increase-reputation-awarded-for-questions&quot;&gt;discussed increasing reputation gain/loss for challenge upvotes and downvotes&lt;/a&gt;, it seems fitting that some of the ideas discussed over at Puzzling.SE might also work well for our site.&lt;/p&gt;&#xA;&lt;h2&gt;The Problem&lt;/h2&gt;&#xA;&lt;p&gt;Creating a good challenge is much harder than writing a solution to a challenge. Challenges often spend several days or longer in the Sandbox, where authors receive feedback to smooth out rough edges and ensure that their challenges are as high-quality as possible. In spite of this, challenges are treated the same as questions on any other Q&amp;amp;A site on the network: 5 reputation added per upvote, 2 reputation subtracted per downvote, and no system to reward awesome challenges. Good solutions are rewarded much more (double the rep, with the possibility for bounties), which gives the appearance that we value solutions more than challenges (which is very false - a good challenge is just as valuable as a good solution, if not more so).&lt;/p&gt;&#xA;&lt;p&gt;What changes could be made to reward users who create exemplary challenges (other than doubling the reputation gain/loss from votes, which is the subject of an existing feature request)?&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-30T09:07:53.283" Title="How should challenge authors be rewarded for creating exemplary challenges?" Tags="|discussion|asking-questions|challenge-quality|reputation|" AnswerCount="3" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="9226" PostTypeId="2" ParentId="2140" CreationDate="2016-05-23T14:08:00.980" Score="1" Body="&lt;h1&gt;Find the smallest number bigger than the input whose digital sum is the input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;Digital sum&quot; refers to the sum of all the digits in a number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the digital sum of &lt;code&gt;1324&lt;/code&gt; is &lt;code&gt;10&lt;/code&gt;, because &lt;code&gt;1+3+2+4 = 10&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is to write a program/function to calculate the smallest number bigger than the input whose digital sum is the input.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example with walkthrough&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As an example, take the number &lt;code&gt;9&lt;/code&gt; as the input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;9 = 1+8 -&amp;gt; 18&#xA;9 = 2+7 -&amp;gt; 27&#xA;9 = 3+6 -&amp;gt; 36&#xA;...&#xA;9 = 8+1 -&amp;gt; 81&#xA;9 = 9+0 -&amp;gt; 90&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The valid output would be the smallest number above, which is &lt;code&gt;18&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specs&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Note that &lt;code&gt;9&lt;/code&gt; is not the valid output for this example, because the reversed number must be greater than the original number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that the input will be positive.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test-Cases:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 2 =&amp;gt; 11&#xA; 8 =&amp;gt; 17&#xA;12 =&amp;gt; 39&#xA;16 =&amp;gt; 79&#xA;24 =&amp;gt; 699&#xA;32 =&amp;gt; 5999&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;References:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;http://oeis.org/A161561&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS A161561&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerDisplayName="user31373" LastEditorUserId="48934" LastEditDate="2016-05-23T14:56:10.743" LastActivityDate="2016-05-23T14:56:10.743" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="9227" PostTypeId="2" ParentId="2140" CreationDate="2016-05-23T17:43:59.020" Score="0" Body="&lt;h1&gt;Primary Chances&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program that lists all possible outcomes for a general election with any number of candidates.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your answer must output how many states each candidate won in any format.&lt;/li&gt;&#xA;&lt;li&gt;Candidates can have any name.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so standard loopholes are forbidden, and shortest code wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="53819" LastActivityDate="2016-05-23T17:43:59.020" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9229" PostTypeId="5" CreationDate="2016-05-23T19:44:56.240" Score="0" Body="" OwnerUserId="-1" LastEditorUserId="-1" LastEditDate="2016-05-23T19:44:56.240" LastActivityDate="2016-05-23T19:44:56.240" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9230" PostTypeId="4" CreationDate="2016-05-23T19:44:56.240" Score="0" Body="For meta questions pertaining to asking other questions, on main or meta." OwnerUserId="46271" LastEditorUserId="46271" LastEditDate="2016-05-23T22:06:26.860" LastActivityDate="2016-05-23T22:06:26.860" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9231" PostTypeId="2" ParentId="2140" CreationDate="2016-05-24T01:18:26.740" Score="0" Body="&lt;h1&gt;Sort 2D points by Sierpiński curve order&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fractal&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fractal&amp;#39;&quot; rel=&quot;tag&quot;&gt;fractal&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot;&gt;sorting&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;[ WORK IN PROGRESS]&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A collection of distinct 2D points in the range [0,1] X [0,1].&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;An ordered collection of the same 2D points, meeting the criteria for Sierpiński curve order.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sierpiński curve order&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The points are in the order that the &lt;a href=&quot;https://en.wikipedia.org/wiki/Sierpi%C5%84ski_curve&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sierpiński curve&lt;/a&gt; would pass through them.&lt;/li&gt;&#xA;&lt;li&gt;The order is cyclic - it does not matter which point is first.&lt;/li&gt;&#xA;&lt;li&gt;The order may be clockwise or anticlockwise/counterclockwise, provided it is consistent.&lt;/li&gt;&#xA;&lt;li&gt;The point at the centre of the range, (0.5, 0.5), may fall into any triangular quarter of the range, provided it is in the correct order among other points in that quarter. Similarly for all other points where both coordinates have finite binary expansion.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Although the curve is infinitely long and fills the unit square, it is arranged in a convenient shape that allows ordering points by calculating only a finite number of iterations. For example, if there are 4 points, one in each triangular quarter of the square, then they can be ordered based only on this information as the curve fills one triangular quarter before moving on to the next so the exact position without that quarter is not relevant.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should ambiguous points be allowed to fall in any direction, or should I impose that they always fall left rather than right and up rather than down? Or just insist that the solution choose a consistent direction rule?&lt;/li&gt;&#xA;&lt;li&gt;Can I assume that any three points that can be described by floating point variables can be ordered in a finite number of subdivisions? I'm pretty sure but welcome a counterexample.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2016-05-24T11:43:50.903" LastActivityDate="2016-05-24T11:43:50.903" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9233" PostTypeId="2" ParentId="8305" CreationDate="2016-05-24T06:46:01.430" Score="1" Body="&lt;p&gt;At this point in time, the Rubik's Cube challenge has been closed, and there is one close vote on the Beats challenge (courtesy of me). I agree that these are interesting challenges, and thus deserve to be on the site if their problems are worked out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you are interested in working on making these challenges quality, there are a few courses of action you can take:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Make edits&lt;/strong&gt;: This is a viable solution for the Rubik's cube challenge, since the main issue with it is a lack of test cases. Simply adding test cases and nominating it for reopening will do the trick.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Create a new version&lt;/strong&gt;: This is a better option for the Beats challenge in my opinion, as its issues are more serious, and drastic changes will be needed in order to bring it up to our standards. Make sure to use the Sandbox for feedback!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2016-05-24T06:46:01.430" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9234" PostTypeId="2" ParentId="5645" CreationDate="2016-05-24T06:49:05.107" Score="3" Body="&lt;p&gt;As you said, game mechanics are not copyrightable. So long as you only use the mechanics, and not the exact puzzles, you're in the clear.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2016-05-24T06:49:05.107" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9235" PostTypeId="1" CreationDate="2016-05-24T15:06:06.740" Score="2" ViewCount="114" Body="&lt;p&gt;Recently, I was looking at one of my older questions, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/78728/qwerty-quine-creation&quot;&gt;QWERTY Quine Creation&lt;/a&gt;, and I noticed that the JavaScript answer was invalid. I notified the creator, who marked the answer noncompeting. The same thing happened on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/80073/how-to-find-the-item-in-a-list-whose-fitem-is-the-smallest&quot;&gt;another question&lt;/a&gt; (not mine), but the answer was deleted. Hence my question: &lt;strong&gt;Is non-competing going to far?&lt;/strong&gt; I think we need an official definition of 'non-competing'. I think that the current definition (any answer which breaks the rules) does not work. What is your opinion?&lt;/p&gt;&#xA;" OwnerUserId="48922" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-05-24T15:06:06.740" Title="Official definition of 'noncompeting'" Tags="|discussion|answers|noncompeting|" AnswerCount="0" CommentCount="4" FavoriteCount="0" ClosedDate="2016-05-24T23:58:43.223" ContentLicense="CC BY-SA 3.0" />
  <row Id="9236" PostTypeId="2" ParentId="2140" CreationDate="2016-05-24T16:46:49.913" Score="0" Body="&lt;h1&gt;&lt;strong&gt;Find ALL Longest Common Substrings&lt;/strong&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Unlike &quot;Longest Common Substring&quot; algorithm which returns just one string, or the length of it. This algorithm returns a score after taking all separate longest common substrings into account. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This program returns the score of how similar one string is to another according to the following rules:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;isolate only the longest (non-overlaping) matching substrings.&lt;/li&gt;&#xA;&lt;li&gt;score every longest substring found with this formula: (substring.length / ((string1.length + string2.length) / 2)) * substring.length&lt;/li&gt;&#xA;&lt;li&gt;sum the scores and return.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;STEP 1 Example:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;string1 = ABCD&#xA;&#xA;string2 = ZBCA&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Deconstructing string1: (list of substring in order)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ABCD&#xA;&#xA;ABC&#xA;&#xA;AB&#xA;&#xA;A (also found in string2)&#xA;&#xA;BCD&#xA;&#xA;BC (also found in string2)&#xA;&#xA;B (also found in string2 but ignored - part of a longer substring)&#xA;&#xA;CD&#xA;&#xA;C (also found in string2 but ignored - part of a longer substring)&#xA;&#xA;D&#xA;&#xA;Matches: A, BC&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;STEP 2 Example:&lt;/strong&gt; (substring.length / ((string1.length + string2.length) / 2)) * substring.length&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A: (1/((4+4)/2)) * 1 = .25&#xA;&#xA;BC: (2/((4+4)/2)) * 2 = 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Step 3 Example:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.25 + 1 = 1.25, Return 1.25&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here's an example of longer strings of variable length:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;string1 = Approximate This&#xA;&#xA;string2 = Appropriate That Thing&#xA;&#xA;Matches: Appro, i, ate Th,  Thi&#xA;&#xA;Appro: (5/((16+22)/2)) * 5 = 1.3157894736842105263157894736842&#xA;&#xA;ate Th: (6/((16+22)/2)) * 6 = 1.8947368421052631578947368421053&#xA;&#xA;i: (1/((16+22)/2)) * 1 = 0.05263157894736842105263157894737&#xA;&#xA; Thi: (4/((16+22)/2)) * 4 = 0.47368421052631578947368421052632&#xA;&#xA;Return: 4.1052631578947368421052631578948&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="52671" LastEditorUserId="52671" LastEditDate="2016-05-24T17:44:33.860" LastActivityDate="2016-05-24T17:44:33.860" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9237" PostTypeId="2" ParentId="2140" CreationDate="2016-05-24T17:27:32.037" Score="1" Body="&lt;h1&gt;Light the Way!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is based on the &lt;a href=&quot;https://en.wikipedia.org/wiki/Lights_Out_(game)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Lights Out&lt;/a&gt; game. There is a grid of tiles, and clicking on a tile (performing a &quot;move&quot;) toggles the state of the clicked tile as well as the (orthogonally) adjacent tiles. &lt;strong&gt;This variation will also toggle the diagonally adjacent tiles.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is helpful to note that (on a board with only two states) all moves commute, so the order in which they are performed is not important. It follows that performing a collection of moves a second time will undo what was done the first time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;There are a few ways to present this challenge, so I'll describe some possibilities. Let me know what you think. The challenge could be one of the below:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Given a board size &lt;code&gt;n&lt;/code&gt; (optional) and the initial state of the n-by-n board, determine an optimal collection of moves that will toggle every lit (&quot;on&quot;) tile into its dark (&quot;off&quot;) state.&lt;/li&gt;&#xA;&lt;li&gt;Given &lt;code&gt;n&lt;/code&gt; and a sequence of moves performed on an initially dark board of size &lt;code&gt;n&lt;/code&gt;, provide the resulting matrix of states.&lt;/li&gt;&#xA;&lt;li&gt;A variation on the above involving graphical output.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Input format would be flexible. &lt;code&gt;n &amp;gt;= 1&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Snippet to show how the game works:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The board size may be adjusted in the first input field. The second field (functionality added by Conor O'Brien) will take a list of coordinates (&lt;code&gt;[[0,0],[1,2],[3,0],...]&lt;/code&gt;) and perform the moves for you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;var table;&#xD;&#xA;var color1 = &quot;aqua&quot;,&#xD;&#xA;	color2 = &quot;yellow&quot;;&#xD;&#xA;var moveList = [];&#xD;&#xA;&#xD;&#xA;window.onload = function () {&#xD;&#xA;	table = document.getElementById(&quot;lightGame&quot;);&#xD;&#xA;	buildTable();&#xD;&#xA;&#xD;&#xA;	var updateButton = document.getElementById(&quot;updateButton&quot;);&#xD;&#xA;	if (updateButton) {&#xD;&#xA;		updateButton.onclick = buildTable;&#xD;&#xA;	}&#xD;&#xA;&#xD;&#xA;	// added by Conor O'Brien&#xD;&#xA;	document.getElementById(&quot;perform&quot;).addEventListener(&quot;click&quot;, function() {&#xD;&#xA;		var toPerf = JSON.parse(document.getElementById(&quot;moves&quot;).value);&#xD;&#xA;		//console.log(toPerf);&#xD;&#xA;		function rec(arr) {&#xD;&#xA;			var m = arr.shift();&#xD;&#xA;			var x = m[0],&#xD;&#xA;				y = m[1];&#xD;&#xA;			var cell = table.rows[y].cells[x];&#xD;&#xA;			update(cell);&#xD;&#xA;			if (arr.length) {&#xD;&#xA;				setTimeout(rec, 500, arr);&#xD;&#xA;			}&#xD;&#xA;		}&#xD;&#xA;		rec(toPerf);&#xD;&#xA;	});&#xD;&#xA;};&#xD;&#xA;&#xD;&#xA;function buildTable() {&#xD;&#xA;	// get size&#xD;&#xA;	var input = document.getElementById(&quot;size&quot;);&#xD;&#xA;	var size = new Number(input &amp;amp;&amp;amp; input.value || 5);&#xD;&#xA;	&#xD;&#xA;	var rows = size,&#xD;&#xA;		cols = size;&#xD;&#xA;	&#xD;&#xA;	// clear moves&#xD;&#xA;	moveList = [];&#xD;&#xA;	moveHolder.innerHTML = &quot;[]&quot;;&#xD;&#xA;	&#xD;&#xA;	// remove existing rows&#xD;&#xA;	while (table.lastChild) {&#xD;&#xA;		table.removeChild(table.lastChild);&#xD;&#xA;	}&#xD;&#xA;	&#xD;&#xA;	// create new rows&#xD;&#xA;	for (var y = 0; y &amp;lt; rows; y++) {&#xD;&#xA;		var row = document.createElement(&quot;tr&quot;);&#xD;&#xA;		&#xD;&#xA;		for (var x = 0; x &amp;lt; cols; x++) {&#xD;&#xA;			var cell = document.createElement(&quot;td&quot;);&#xD;&#xA;			cell.style.backgroundColor = color1;&#xD;&#xA;			cell.x = x;&#xD;&#xA;			cell.y = y;&#xD;&#xA;			cell.onclick = function () {&#xD;&#xA;				update(this);&#xD;&#xA;			};&#xD;&#xA;			row.appendChild(cell);&#xD;&#xA;		}&#xD;&#xA;		table.appendChild(row);&#xD;&#xA;	}&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function update(cell) {&#xD;&#xA;	var x = cell.x;&#xD;&#xA;	var y = cell.y;&#xD;&#xA;	&#xD;&#xA;	var xMax = table.rows[0].cells.length;&#xD;&#xA;	var yMax = table.rows.length;&#xD;&#xA;	&#xD;&#xA;	// update cell&#xD;&#xA;	changeColor(cell);&#xD;&#xA;	&#xD;&#xA;	// update orthogonally adjacent&#xD;&#xA;	if (x &amp;gt; 0) changeColor(table.rows[y].cells[x - 1]);&#xD;&#xA;	if (x + 1 &amp;lt; xMax) changeColor(table.rows[y].cells[x + 1]);&#xD;&#xA;	if (y &amp;gt; 0) changeColor(table.rows[y - 1].cells[x]);&#xD;&#xA;	if (y + 1 &amp;lt; yMax) changeColor(table.rows[y + 1].cells[x]);&#xD;&#xA;	&#xD;&#xA;	// update diagonally adjacent&#xD;&#xA;	if (x &amp;gt; 0 &amp;amp;&amp;amp; y &amp;gt; 0) changeColor(table.rows[y - 1].cells[x - 1]);&#xD;&#xA;	if (x &amp;gt; 0 &amp;amp;&amp;amp; y + 1 &amp;lt; yMax) changeColor(table.rows[y + 1].cells[x - 1]);&#xD;&#xA;	if (x + 1 &amp;lt; xMax &amp;amp;&amp;amp; y &amp;gt; 0) changeColor(table.rows[y - 1].cells[x + 1]);&#xD;&#xA;	if (x + 1 &amp;lt; xMax &amp;amp;&amp;amp; y + 1 &amp;lt; yMax) changeColor(table.rows[y + 1].cells[x + 1]);&#xD;&#xA;	&#xD;&#xA;	// update moves&#xD;&#xA;	// added by Conor O'Brien&#xD;&#xA;    moveList.push([x, y]);&#xD;&#xA;    moveHolder.innerHTML = JSON.stringify(moveList);&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function changeColor(cell) {&#xD;&#xA;	cell.style.backgroundColor = cell.style.backgroundColor === color1 ? color2 : color1;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function getStyle(elt, styleProp) {&#xD;&#xA;	if (elt.currentStyle)&#xD;&#xA;		return elt.currentStyle[styleProp];&#xD;&#xA;	return document.defaultView.getComputedStyle(elt, null)[styleProp];&#xD;&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-css lang-css prettyprint-override&quot;&gt;&lt;code&gt;body {&#xD;&#xA;	background-color: darkslategray;&#xD;&#xA;	color: white;&#xD;&#xA;}&#xD;&#xA;#gameDiv {&#xD;&#xA;	text-align: center;&#xD;&#xA;}&#xD;&#xA;header {&#xD;&#xA;	margin: 25px;&#xD;&#xA;}&#xD;&#xA;h2, h4 {&#xD;&#xA;	color: red;&#xD;&#xA;	text-shadow: -2px -2px black;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;#lightGame {&#xD;&#xA;	border: 1px solid white;&#xD;&#xA;	margin: auto;&#xD;&#xA;}&#xD;&#xA;#lightGame td {&#xD;&#xA;	/*background-color: aqua;*/&#xD;&#xA;	padding: 1px;&#xD;&#xA;	height: 25px;&#xD;&#xA;	width: 25px;&#xD;&#xA;}&#xD;&#xA;#updateDiv {&#xD;&#xA;	margin: 25px;&#xD;&#xA;}&#xD;&#xA;button {&#xD;&#xA;	margin-left: 10px;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;#autoMoveDiv {&#xD;&#xA;	margin-top: 10px;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;footer {&#xD;&#xA;	position: fixed;&#xD;&#xA;	bottom: 0px;&#xD;&#xA;	width: 100%;&#xD;&#xA;}&#xD;&#xA;footer small {&#xD;&#xA;	color: cyan;&#xD;&#xA;	position: absolute;&#xD;&#xA;	bottom: 0px;&#xD;&#xA;}&#xD;&#xA;img {&#xD;&#xA;	float: right;&#xD;&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;div id=&quot;gameDiv&quot;&amp;gt;&#xD;&#xA;	&amp;lt;header&amp;gt;&#xD;&#xA;		&amp;lt;h2&amp;gt;Light Game&amp;lt;/h2&amp;gt;&#xD;&#xA;	&amp;lt;/header&amp;gt;&#xD;&#xA;	&amp;lt;div&amp;gt;&#xD;&#xA;		&amp;lt;table id=&quot;lightGame&quot;&amp;gt;&#xD;&#xA;		&amp;lt;/table&amp;gt;&#xD;&#xA;	&amp;lt;/div&amp;gt;&#xD;&#xA;	&amp;lt;div id=&quot;updateDiv&quot;&amp;gt;&#xD;&#xA;		&amp;lt;input id=&quot;size&quot; name=&quot;size&quot; type=&quot;number&quot; min=&quot;1&quot; max=&quot;20&quot; pattern=&quot;\d{1,2}&quot; value=&quot;5&quot; required /&amp;gt;&#xD;&#xA;		&amp;lt;button id=&quot;updateButton&quot; type=&quot;button&quot;&amp;gt;Update&amp;lt;/button&amp;gt;&#xD;&#xA;	&amp;lt;/div&amp;gt;&#xD;&#xA;	&amp;lt;div&amp;gt;&#xD;&#xA;		Your moves: &amp;lt;span id=&quot;moveHolder&quot;&amp;gt;[]&amp;lt;/span&amp;gt;&#xD;&#xA;	&amp;lt;/div&amp;gt;&#xD;&#xA;	&amp;lt;div id=&quot;autoMoveDiv&quot;&amp;gt;&#xD;&#xA;		Auto move: &#xD;&#xA;		&amp;lt;input id=&quot;moves&quot; /&amp;gt;&#xD;&#xA;		&amp;lt;button id=&quot;perform&quot; type=&quot;button&quot;&amp;gt;Do Moves&amp;lt;/button&amp;gt;&#xD;&#xA;	&amp;lt;/div&amp;gt;&#xD;&#xA;&amp;lt;/div&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/search?q=is%3Aquestion%20lights%20off&quot;&gt;Related Questions&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://jsfiddle.net/od3yy7s2/4/&quot; rel=&quot;nofollow noreferrer&quot;&gt;JsFiddle&lt;/a&gt; of the snippet I made.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:21.580" LastActivityDate="2016-05-24T19:59:43.627" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="9238" PostTypeId="2" ParentId="9225" CreationDate="2016-05-24T18:12:28.153" Score="14" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8432/8478&quot;&gt;I suggested a potential feature request&lt;/a&gt; related to this when we were discussing ideas about the fact that we're not a Q&amp;amp;A site. This is of course a suggestion that would require changes to the software, which would likely be only useful for PPCG and Puzzling.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main idea is to introduce a separate bounty system for challenges. The main difference to the existing bounty system is that the 7-day deadline doesn't make much sense for challenges. Hence, I think that a challenge bounty system could work one (or both) of two ways:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Immediate assignment of a bounty to an existing challenge, in the same vein as the normal &quot;Reward an existing answer&quot; bounty. Sometimes you come across a challenge that you just like so much that you want to donate the author some additional reputation. It would be nice if this also resulted in the challenge being featured for some time, so that the reputation wasn't the only benefit.&lt;/li&gt;&#xA;&lt;li&gt;Indefinite bounties: if you want to see a certain type of challenge that appears hard to pull off, you could offer a bounty for it. When someone posts a challenge that does this to your satisfaction, you'd award the bounty. However, I see quite a lot of problems with this. Mainly the fact that people would post their indefinite bounties, they'd never be satisfied, the user becomes inactive at some point, and then we end up with a bunch of indefinite bounties which will never be awarded and clutter the list of open bounties. Also, the fact that there's no way to ensure that a bounty is awarded for the thing it was originally offered for would become a bigger issue here.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So personally, I'd be in favour of immediate bounties for rewarding existing challenges. If someone wants to challenge others to come up with a certain type of difficult-to-do-right challenge, we could do this informally &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5243/8478&quot;&gt;like we already do for answers&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2016-05-24T20:39:39.600" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9242" PostTypeId="2" ParentId="8176" CreationDate="2016-05-25T00:04:47.617" Score="1" Body="&lt;p&gt;In most cases bytes and chars are the same. Chars were fine until golfers start packing multiple bytes inside of multibyte unicode chars. We just want to prevent this way, so are using bytes instead of chars. But we don't want to force some calculation for possible packing.&lt;/p&gt;&#xA;" OwnerUserId="32091" LastActivityDate="2016-05-25T00:04:47.617" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9243" PostTypeId="2" ParentId="2140" CreationDate="2016-05-25T02:44:51.127" Score="0" Body="&lt;h1&gt;Fizzbuzz for tensorflow&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Since I was a new and naive user, I posted this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/80493/deep-learning-fizzbuzz?noredirect=1#comment197826_80493&quot;&gt;question&lt;/a&gt;. In one day it got over 25 upvotes but was shut down for being too broad. Clearly there is community interest -- so by the suggestion of @DrGreenEggsandHamDJ I'll try it again in the sandbox. I'd really like to see some of the answers here, so I appreciate any help you can give turning this question into a proper submission.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Original text copied below:&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Inspired by the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/80493/deep-learning-fizzbuzz?noredirect=1#comment197826_80493&quot;&gt;job-interview with Joel Grus&lt;/a&gt;, the goal of this challenge is to write a &lt;a href=&quot;https://www.tensorflow.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;tensorflow&lt;/a&gt; (or other deep/machine learning) program that &lt;em&gt;learns&lt;/em&gt; &lt;a href=&quot;https://en.wikipedia.org/wiki/Fizz_buzz#Programming_interviews&quot; rel=&quot;nofollow noreferrer&quot;&gt;Fizzbuzz&lt;/a&gt; and correctly prints out the answers to the positive integers less than 1000. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can assume there are files named &lt;code&gt;train.csv&lt;/code&gt; and &lt;code&gt;test.csv&lt;/code&gt; and each contain a sorted list of sequential integers and the fizzbuzz answer:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; ...&#xA; 100, buzz&#xA; 101, 101&#xA; 102, fizz&#xA; 103, 103&#xA; 104, 104&#xA; 105, buzz&#xA; ...&#xA; 150000, fizzbuzz&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;test.csv&lt;/code&gt; spans 1-1000 and &lt;code&gt;train.csv&lt;/code&gt; spans 1001-150000.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You must not hard-code the rules to Fizzbuzz anywhere in your program. The output must be from a machine learned representation that is learned &lt;em&gt;while running the code&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You must utilize &lt;code&gt;train.csv&lt;/code&gt; in the training set and check your output against &lt;code&gt;test.csv&lt;/code&gt;. You cannot use &lt;code&gt;test.csv&lt;/code&gt; during training.&lt;/li&gt;&#xA;&lt;li&gt;You must get all outputs correct from &lt;code&gt;test.csv&lt;/code&gt; (but as is case with deep-learning, we'll allow your code to fail this rule no more than 5% of the time).&lt;/li&gt;&#xA;&lt;li&gt;You may use any language and any external module (eg. python/tensorflow) as long they explicitly perform some kind of learning. Reference both the language and the module in the title of your post. &lt;/li&gt;&#xA;&lt;li&gt;This is a popularity contest, so the submission with the most votes after one week wins.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="15648" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:26.977" LastActivityDate="2016-05-25T02:44:51.127" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9244" PostTypeId="1" CreationDate="2016-05-25T04:26:47.510" Score="4" ViewCount="149" Body="&lt;p&gt;A clarification I'd like to have is whether JavaScript submissions for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt; should support &lt;a href=&quot;http://www.html5rocks.com/en/tutorials/cors/#toc-images&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cross-Origin Resource Sharing&lt;/a&gt;. Specifically, it requires setting the &lt;code&gt;crossOrigin&lt;/code&gt; attribute of an &lt;a href=&quot;https://developer.mozilla.org/en-US/docs/Web/API/HTMLImageElement/Image&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;Image&lt;/code&gt;&lt;/a&gt; to &lt;code&gt;&quot;&quot;&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This seems like a frivolous expectation in the context of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, which is why I ask if we should be required to use it. An example submission of the relevance for this issue is &lt;a href=&quot;https://codegolf.stackexchange.com/a/80414/42091&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="42091" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-05-25T05:29:17.830" Title="Should a JavaScript image-processing submission support CORS?" Tags="|discussion|code-golf|answers|rules|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9245" PostTypeId="2" ParentId="9244" CreationDate="2016-05-25T05:29:17.830" Score="8" Body="&lt;h1&gt;Answers shouldn't need to worry about CORS&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The amount of boilerplate already required by JS image proccessing answers is rather ridiculous. Requiring support for CORS is compensating for a frivilous limitation of the server/client sending/recieving the data/image. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;CORS is also only an issue when the code is run remotely. If it is saved locally and run, CORS issues will not arise. Meaning &lt;strong&gt;answers not supporting CORS are perfectly fine&lt;/strong&gt;, just not as-is when hosted.&lt;/p&gt;&#xA;" OwnerUserId="40695" LastActivityDate="2016-05-25T05:29:17.830" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9246" PostTypeId="2" ParentId="5139" CreationDate="2016-05-25T10:41:05.747" Score="0" Body="&lt;h1&gt;Tie break on first posted&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Ideally, if there is a joint first place I'd like to see the first posted appear at the top. This is complicated by the fact that the time of the post is not necessarily the time that the code first had that length.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not suggesting the snippet do an analysis of the edit histories, but I'm posting this in case there's a simpler way. Maybe a comment override?&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2016-05-25T10:41:05.747" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9247" PostTypeId="2" ParentId="2140" CreationDate="2016-05-25T13:53:43.583" Score="1" Body="&lt;h2&gt;Array of Integers to Array of Digits&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an array of arbitrary length containing only integers, output an array of integers of each digit of each integer in the array.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Notes&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The input array will only consist of integers in base 10&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The integers will be in the range of [0, MAX_INT] where MAX_INT is the greatest value an integer can have in your language&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Assume that all integers will be positive, however you can interpret the integers as signed or unsigned&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;String manipulation and the use of any regex is banned by default&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The outputted array must be exactly 1 deep and contain only integers&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The order of the digits in the outputted array must be exactly as they were in the inputted array&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Leading zeros are to be stripped, as they should be when parsed as an integer&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[2, 3, 5, 7, 11, 13] -&amp;gt; [2, 3, 5, 7, 1, 1, 1, 3]&#xA;[1, 2, 3, 4, 5] -&amp;gt; [1, 2, 3, 4, 5]&#xA;[123, 456, 789, 101112] -&amp;gt; [1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 0, 1, 1, 1, 2]&#xA;[0, 000, 000123] -&amp;gt; [0, 0, 1, 2, 3] //'000' is treated as '0' and '000123' is treated as '123'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="47302" LastEditorUserId="47302" LastEditDate="2016-06-09T19:57:59.943" LastActivityDate="2016-06-09T19:57:59.943" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="9248" PostTypeId="2" ParentId="5139" CreationDate="2016-05-25T13:56:15.747" Score="7" Body="&lt;h1&gt;Layout problem&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'm seeing overlapping of text in some cases. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/80586/mean-bits-an-average-challenge&quot;&gt;this challenge&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/7A5NI.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/7A5NI.png&quot; alt=&quot;Overlapped section of leaderboard&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Winners by Language section starts too far to the left, overlapping the Link from the Leaderboard section.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not sure why this only happens sometimes. Two potential solutions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Shift the Winners by Language section to the right.&lt;/li&gt;&#xA;&lt;li&gt;Use manatwork's suggestion of making the size a link to the solution.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;I don't see any ambiguity in making the size a link, as I can't imagine anything else it would link to. It does mean the link is no longer explicit though. Does anyone have any other arguments either way?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Update&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Although I am still in favour of making the size a link to the solution, Martin pointed out that this doesn't solve the problem. The Winners by Language section is at a fixed horizontal position, so if the Leaderboard section is too wide due to a long author or language name, there could still be overlap even without a separate link column.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So ideally instead of just shifting the Winners by Language right a bit, it needs to be sensitive to the width of the Leaderboard section. I propose work on this be delayed until after the two sections swap sides, once that proposal gets enough votes.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-05-25T20:49:54.830" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9250" PostTypeId="2" ParentId="5139" CreationDate="2016-05-25T20:40:12.247" Score="10" Body="&lt;h2&gt;Feature request: Column rearrangement&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In my opinion, the per-language results should be on the left since we emphasize competition within each language. It would simply be a swapping of the current left and right columns.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="20469" LastEditDate="2016-05-25T20:54:12.867" LastActivityDate="2016-05-25T20:54:12.867" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9254" PostTypeId="2" ParentId="5139" CreationDate="2016-05-26T07:56:12.473" Score="2" Body="&lt;h1&gt;Permaproxy to the current stylesheet&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(This feature request is not for the Leaderboare Snippet maintainer, but for the PPCG proxy owners.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Leaderboard Snippet includes the same stylesheet as the PPCG site itself uses. That stylesheet's URL can not be acquired programmatically by the snippet, so it is hardcoded:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;link rel=&quot;stylesheet&quot; type=&quot;text/css&quot; href=&quot;//cdn.sstatic.net/codegolf/all.css?v=83c949450c8b&quot;&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And this is how the snippet was included in 150++ questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then PPCG graduated and the site's stylesheet changed:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;link rel=&quot;stylesheet&quot; type=&quot;text/css&quot; href=&quot;//cdn.sstatic.net/Sites/codegolf/primary.css?v=f52df912b654&quot;&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now all those questions posted before graduation (and even those after) left without stylesheet and their layout suffered, ranging between ugly and unreadable/unclickable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As further style changes will probably happen (see &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7897/graduation-design-ideas&quot;&gt;Graduation Design Ideas&lt;/a&gt;'s popularity), would be nice if one of the PPCG proxy owners would set up a permanent redirect towards the current stylesheet used by the site:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Redirect /official.css //cdn.sstatic.net/Sites/codegolf/primary.css?v=f52df912b654&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So Leaderboard Snippet could then include that stylesheet with permanent URL:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;link rel=&quot;stylesheet&quot; type=&quot;text/css&quot; href=&quot;//pp.cg/official.css&quot;&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="4198" LastEditorUserId="4198" LastEditDate="2018-05-28T14:35:26.533" LastActivityDate="2018-05-28T14:35:26.533" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="9256" PostTypeId="2" ParentId="9225" CreationDate="2016-05-26T11:15:18.410" Score="-6" Body="&lt;p&gt;Trivial challenges take little time to answer, so a lot of people will answer them, which means that the challenge will frequently appear at the top of the active questions list; so, people see it, and it has a good chance of getting upvotes. &lt;br&gt;As opposed to this, a hard challenge which doesn't get any answers in the first days, &quot;sinks&quot; in the active challenges list; so people don't see it and it doesn't get many answers or upvotes.&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The same is true for answers: answers to trivial challenges are seen more often and have a greater chance of getting upvotes than (hard) answers to hard challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is why the site gets flooded with trivial challenges, and the non-trivial ones don't get a chance to shine. &lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There could be a &lt;b&gt;&quot;non-trivial&quot; tag&lt;/b&gt;. Or a &lt;b&gt;&quot;trivial&quot; tag&lt;/b&gt;. In this way, you can filter out the trivial challenges when you want to look only at the non-trivial ones.&lt;/p&gt;&#xA;" OwnerUserId="52554" LastActivityDate="2016-05-26T11:15:18.410" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9257" PostTypeId="1" CreationDate="2016-05-26T14:32:51.730" Score="-7" ViewCount="438" Body="&lt;p&gt;Most puzzles and questions asked on CodeGolf are interesting and challenging. However, usually the answers that win are created from pre-fabricated languages designed for golfing code.&#xA;This seems unfair since it is easy to make ANY language you like for any situation. Languages used to answer these questions are not &quot;Real&quot; languages. They are made for a specific purpose to reduce code size.&#xA;A symbol used in a golfing language needs to represent a built-in function.&#xA;At university, we made an artificial language using Java.&#xA;I believe answers in CodeGolf should be from mainstream/real languages...this would show real skill.&lt;/p&gt;&#xA;" OwnerUserId="19350" LastActivityDate="2016-05-26T14:57:59.837" Title="Real Coding Skill" Tags="|discussion|challenges|" AnswerCount="2" CommentCount="5" ClosedDate="2016-05-26T15:48:20.300" ContentLicense="CC BY-SA 3.0" />
  <row Id="9258" PostTypeId="2" ParentId="9257" CreationDate="2016-05-26T14:47:56.443" Score="4" Body="&lt;p&gt;You're not allowed, to make a random language, to solve a specific challenge&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We have things called &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;&quot;forbidden loopholes&quot;&lt;/a&gt;. One of them is, that a language can't be made to only include one specific builtin, for a specific challenge, and it must had a compiler before the challenge was posted. This makes it impossible to create artificial languages for specific challenges.&lt;/p&gt;&#xA;" OwnerUserId="49709" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2016-05-26T14:47:56.443" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9259" PostTypeId="2" ParentId="9257" CreationDate="2016-05-26T14:57:59.837" Score="3" Body="&lt;p&gt;Your suggestion has already been implemented. Only real programming languages are permitted to enter challenges on this site. What constitutes a real programming language for this site is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2028/what-are-programming-languages&quot;&gt;defined here&lt;/a&gt; on meta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that this rules out some languages which are designed only for a small number of specific tasks. Languages which are designed to be terse still need to meet all of the requirements for being a real programming language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Most of the golfing languages you see on this site are real programming languages, some of which are actually used outside of the golfing context (several of our users use CJam for scripts unrelated to PPCG). If you spot a language that does not meet our definition, raise it on meta so the community can verify whether or not it counts as real.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-05-26T14:57:59.837" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9260" PostTypeId="2" ParentId="1061" CreationDate="2016-05-26T17:35:55.493" Score="35" Body="&lt;h1&gt;Outputting an expression instead of a number&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For example, outputting &lt;code&gt;3*3&lt;/code&gt; instead of &lt;code&gt;9&lt;/code&gt;, or outputting &lt;code&gt;7/4&lt;/code&gt; instead of &lt;code&gt;1.75&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unless the challenge explicitly allows expression output, the output should be in a number format where a number is requested.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As the comments point out that what counts as a number format is hard to define, there's a separate meta discussion &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9263/which-number-formats-are-acceptable-in-output&quot;&gt;Which number formats are acceptable in output?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2017-06-05T11:43:39.873" LastActivityDate="2017-06-05T11:43:39.873" CommentCount="9" CommunityOwnedDate="2016-05-26T17:35:55.493" ContentLicense="CC BY-SA 3.0" />
  <row Id="9263" PostTypeId="1" CreationDate="2016-05-27T01:07:27.297" Score="17" ViewCount="1142" Body="&lt;p&gt;Comments on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9260/20283&quot;&gt;this loophole meta answer&lt;/a&gt; suggest that more than a simple yes or no answer is required.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Which number formats are valid for output? Is there a difference between &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and other tags? If a challenge doesn't specify which are acceptable, which should be valid by default?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are &lt;code&gt;0.1&lt;/code&gt; and &lt;code&gt;.1&lt;/code&gt; both acceptable?&lt;/li&gt;&#xA;&lt;li&gt;What about leading zeroes like &lt;code&gt;0073&lt;/code&gt;?&lt;/li&gt;&#xA;&lt;li&gt;Are &lt;code&gt;3*3&lt;/code&gt; and &lt;code&gt;5/7&lt;/code&gt; acceptable? (In general, can an expression be output?)&lt;/li&gt;&#xA;&lt;li&gt;Is scientific notation acceptable? Like &lt;code&gt;3.45e56&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;What about symbolic constants: &lt;code&gt;6pi&lt;/code&gt;, &lt;code&gt;e&lt;/code&gt;?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2018-12-20T02:03:34.050" Title="Which number formats are acceptable in output?" Tags="|discussion|answers|defaults|output|" AnswerCount="6" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9264" PostTypeId="2" ParentId="9263" CreationDate="2016-05-27T01:36:12.360" Score="18" Body="&lt;h1&gt;Solution ≠ outputting an expression&lt;/h1&gt;&#xA;&lt;p&gt;I'll phrase this, this way: imagine there is a hypothetical question:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Given &lt;code&gt;n&lt;/code&gt; output the sum of all numbers from &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;n&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Okay, so the answer should calculate this. Now let's say I wrote an answer and the output for input &lt;code&gt;5&lt;/code&gt; is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;5(5+1)/2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Does this seem right? No. But I'm &lt;strong&gt;not &lt;em&gt;completely&lt;/em&gt; against outputting expressions...&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Fractions&lt;/h2&gt;&#xA;&lt;p&gt;If an answer were to output something like &lt;code&gt;2/3&lt;/code&gt; I'd say &lt;strong&gt;this is fine&lt;/strong&gt; as it can be considered a &lt;strong&gt;fraction&lt;/strong&gt; representation of a number. An expression &lt;em&gt;evaluates&lt;/em&gt; to a number, it is not a representation of a number, unlike fractions. So I don't see any reasons to ban fractions. Every language which supports fractions that I know of simplifies them so I'd say that fractions should be simplified.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Format of numbers&lt;/h2&gt;&#xA;&lt;p&gt;If a number has leading zeros (e.g. &lt;code&gt;00075&lt;/code&gt;), or doesn't have a leading zero of a decimal (e.g. &lt;code&gt;.43&lt;/code&gt;), I'd say this is fine. An answer should really be focusing on solving the problem, &lt;strong&gt;not trimming leading zeros to conform to an overly-strict output format.&lt;/strong&gt; Scientific notation applies as the same as above. As long as it conforms to the required precision. It is a perfectly acceptable representation of a number.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Symbolic constants&lt;/h2&gt;&#xA;&lt;p&gt;I'm not completely decided on this. For complex numbers, if I were to output: &lt;code&gt;5i&lt;/code&gt;, for complex numbers, that would be fine.&lt;/p&gt;&#xA;&lt;p&gt;For cases of &lt;code&gt;π&lt;/code&gt; and other constants, this is a bit more different, I don't know of any language that outputs &lt;code&gt;π&lt;/code&gt; itself rather than its value. I'd say maybe not as, for example in JavaScript, instead of doing &lt;code&gt;Math.PI&lt;/code&gt;, I could just do &lt;code&gt;+&amp;quot;pi&amp;quot;&lt;/code&gt; and save a couple of bytes, which seems like avoiding to actually calculate the answer to save bytes. I'd say challenges could override this on a case-by-case basis but I'm not completely decided on this.&lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-04T17:20:07.357" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9267" PostTypeId="2" ParentId="9263" CreationDate="2016-05-27T09:57:46.883" Score="10" Body="&lt;p&gt;Generally speaking, any readable number format should be valid. This might include:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;leading 0s (00045.2)&lt;/li&gt;&#xA;&lt;li&gt;trailing 0s after decimal point (45.200000)&lt;/li&gt;&#xA;&lt;li&gt;floating point quirks (0.1+0.2=0.300000000000001 is correct enough, as floating point does this)&lt;/li&gt;&#xA;&lt;li&gt;fractions to avoid the above, where reduced form is optional, unless specified&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="54032" LastActivityDate="2016-05-27T09:57:46.883" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9268" PostTypeId="2" ParentId="7377" CreationDate="2016-05-27T10:27:06.553" Score="-2" Body="&lt;p&gt;Relevant blocks. These are&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any Redstone component&lt;/li&gt;&#xA;&lt;li&gt;Any component relevant to the structure (blocks holding up redstone, doesn't include the floor)&lt;/li&gt;&#xA;&lt;li&gt;Any block that would remove functionality if changed (air blocks that remove functonality when filled, &quot;normal&quot; blocks that remove functionality when removed)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Command blocks are 1+inner code size&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Filled blocks (chest, dropper) are 1+amount of stacks inside (where a filled slot is 1, size of stack irrelevant)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Exception to the above rule: items that need nbt data (a pick that MUST be damaged for the structure to work): 2 bytes&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But: Redstone can't be compared to other (textual) languages&lt;/p&gt;&#xA;" OwnerUserId="54032" LastActivityDate="2016-05-27T10:27:06.553" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9270" PostTypeId="2" ParentId="2140" CreationDate="2016-05-27T14:26:02.033" Score="0" Body="&lt;h1&gt;Code me music&lt;/h1&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Write a program that will play music based on input.&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;When your program is run it will be given a small song. Each note in the song will have 3 components:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[octave][pitch][duration]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;where &lt;code&gt;octave&lt;/code&gt; is the &lt;a href=&quot;https://en.wikipedia.org/wiki/Scientific_pitch_notation&quot; rel=&quot;nofollow noreferrer&quot;&gt;octave&lt;/a&gt; for the note to be played in, &lt;code&gt;pitch&lt;/code&gt; is the key of the note (a b c d e f g), and &lt;code&gt;duration&lt;/code&gt; is the length of the note in milliseconds. For example, &lt;code&gt;4c1000&lt;/code&gt; would be middle c played for one second. Notes in a song are separated by spaces. Flats and sharps are possible, and they go after the note like this: &lt;code&gt;5gb1000&lt;/code&gt; (5th octave g flat) for flats and &lt;code&gt;5g#1000&lt;/code&gt; (5th octave g sharp) for sharps.&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;Your program must produce sound based on the input. If one of the notes in the input is &lt;code&gt;3f500&lt;/code&gt;, your program must play f in the third octave for a half of a second.&lt;/p&gt;&#xA;&lt;h1&gt;Other notes&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;This is code golf, so shortest program in (insert period of time) wins.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No functions, only full programs.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The sound can be whatever you please.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Here are the frequencies of notes in the 4th octave in hertz:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;4c - 261.63&lt;/li&gt;&#xA;&lt;li&gt;4c#/4db - 277.18&lt;/li&gt;&#xA;&lt;li&gt;4d - 293.66&lt;/li&gt;&#xA;&lt;li&gt;4d#/4eb - 311.13&lt;/li&gt;&#xA;&lt;li&gt;4e - 329.63&lt;/li&gt;&#xA;&lt;li&gt;4f - 349.23&lt;/li&gt;&#xA;&lt;li&gt;4f#/4gb - 369.99&lt;/li&gt;&#xA;&lt;li&gt;4g - 392.00&lt;/li&gt;&#xA;&lt;li&gt;4g#/4ab - 415.30&lt;/li&gt;&#xA;&lt;li&gt;4a - 440.00&lt;/li&gt;&#xA;&lt;li&gt;4a#/4bb - 466.16&lt;/li&gt;&#xA;&lt;li&gt;4b - 493.88&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A list of all frequencies is &lt;a href=&quot;http://www.phy.mtu.edu/%7Esuits/notefreqs.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the challenge objective clear?&lt;/li&gt;&#xA;&lt;li&gt;This challenge may be hard for some languages, is that a problem?&lt;/li&gt;&#xA;&lt;li&gt;Is this already a challenge?&lt;/li&gt;&#xA;&lt;li&gt;Any positive feedback is welcome.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="46052" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-27T14:53:40.890" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9271" PostTypeId="2" ParentId="9140" CreationDate="2016-05-27T15:00:16.133" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/47923/self-shortening-prime-tester?rq=1&quot;&gt;Self-Shortening Prime Tester&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-generation&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-generation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Straightforward challenge&lt;/li&gt;&#xA;&lt;li&gt;Introduces users to quines&lt;/li&gt;&#xA;&lt;li&gt;Low amount of votes/answers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Cons:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The &amp;quot;sub challenge&amp;quot; (prime checking) is pretty simple, so we &lt;em&gt;may&lt;/em&gt; end up with duplicate entries&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-27T15:00:16.133" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9277" PostTypeId="2" ParentId="8350" CreationDate="2016-05-28T13:42:50.163" Score="27" Body="&lt;h1&gt;Collaborative posts with equal rep sharing&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Occasionally 2 or more people will work together on writing a challenge or a solution. Currently all the reputation goes to the person whose name it is in. I'd love to see the ability for the post owner to add 1 or more additional owners so that all rep for the post is split equally among them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anyone else would still be able to edit as normal, without a rep reward.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've seen both challenges and solutions that were a group effort, and I'd like to see more of both.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2016-05-28T13:42:50.163" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="9278" PostTypeId="1" CreationDate="2016-05-28T19:10:38.550" Score="14" ViewCount="487" Body="&lt;p&gt;In a current challenge, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/80822/falsify-brief-truths/&quot;&gt;Falsify brief truths&lt;/a&gt;, &lt;code&gt;@Lynn&lt;/code&gt; proposed an edit to my Haskell answer that requires the &lt;code&gt;NoMonomorphismRestriction&lt;/code&gt; language extension.&lt;/p&gt;&#xA;&lt;p&gt;As this extension is not part of the &lt;code&gt;Haskell2010&lt;/code&gt; language, it seems to me that one might consider &lt;code&gt;Haskell2010 + NoMonomorphismRestriction&lt;/code&gt; to be its own language.&lt;/p&gt;&#xA;&lt;h3&gt;Pros&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Language extensions could encourage creative solutions.&lt;/li&gt;&#xA;&lt;li&gt;Extensions don't usually save more than a couple bytes, as far as I know.&lt;/li&gt;&#xA;&lt;li&gt;Activating language extensions take more bytes than they're worth, currently. (&lt;code&gt;-XNoMonomorphismRestriction&lt;/code&gt; is 27 bytes, while the proposed solution is 37 bytes).&lt;/li&gt;&#xA;&lt;li&gt;Some people (including myself) enjoy learning programming techniques from code golf, that can be applied to non-golf coding. This would open up more opportunities for that.&lt;/li&gt;&#xA;&lt;li&gt;Problems like: &amp;quot;Yes, for this challenge I'm using extension number &lt;code&gt;689865434678&lt;/code&gt; to Pyth, which makes the blank program the solution to this challenge&amp;quot; are covered by the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5076/48962&quot;&gt;MetaGolf loophole&lt;/a&gt; and the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1071/48962&quot;&gt;Using a made-up language loophole&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Cons&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'm not sure what precisely constitutes a language extension&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;What do you think?&lt;/p&gt;&#xA;" OwnerUserId="48962" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-07T08:50:16.257" Title="Is a language with an extension a valid golfing language?" Tags="|discussion|policy|answers|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9279" PostTypeId="2" ParentId="9278" CreationDate="2016-05-28T20:22:09.963" Score="19" Body="&lt;p&gt;Using a third-party library/module/extension/whatever has always been allowed by default. It should be noted in the answer that it is not the &quot;vanilla&quot; language (something like &lt;code&gt;Language + Library/Libraries&lt;/code&gt; is the most common way). However, any code needed to access the functionality of the library (such as Python's &lt;code&gt;import&lt;/code&gt;, C/C++'s &lt;code&gt;#include&lt;/code&gt; and &lt;code&gt;-l&lt;/code&gt;, Perl's &lt;code&gt;use&lt;/code&gt; or &lt;code&gt;-M&lt;/code&gt;, Node.js's &lt;code&gt;require&lt;/code&gt;, etc.) must be included in the submission code. For example, if you're using &lt;code&gt;Python + NumPy&lt;/code&gt;, you don't get &lt;code&gt;import numpy as np&lt;/code&gt; for free. What you &lt;em&gt;do&lt;/em&gt; get for free is the assumption that a certain third-party library (or set of third-party libraries) is present on the machine, and can be used via the normal mechanisms of the language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On a related note, you can also mix languages this way, such as through pipes in Bash-like shells.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2016-05-29T06:08:19.647" LastActivityDate="2016-05-29T06:08:19.647" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="9283" PostTypeId="2" ParentId="6918" CreationDate="2016-05-29T10:11:58.700" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/theksp25/INXW63CTMNZGS4DU&quot; rel=&quot;nofollow&quot;&gt;INXW63CTMNZGS4DU&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;INXW63CTMNZGS4DU is a imperative/functional 1D golfing language I have created the 16 may 2016.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example code:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;→Fλ²$&#xA;(F5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;will print 25.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Normally, a lambda end with a ';', a call with a ')', so the same code can be rewritten like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;→Fλ²$;&#xA;(F5)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;But since it the end of line, it's not needed.&lt;/p&gt;&#xA;" OwnerUserId="53745" LastActivityDate="2016-05-29T10:11:58.700" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9285" PostTypeId="2" ParentId="2140" CreationDate="2016-05-29T11:44:14.533" Score="2" Body="&lt;h1&gt;Do my algebra homework for me!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Inspired by a true story&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Ugh, my maths teacher gave me so much homework on quadratics.&lt;/p&gt;&#xA;&lt;p&gt;Two whole worksheets, filled with equations like &lt;code&gt;Expand (x+1)(x-6)&lt;/code&gt; and &lt;code&gt;Factorize x^2-2x+1&lt;/code&gt;. I already hate it.&lt;/p&gt;&#xA;&lt;p&gt;Suddenly, a lightbulb appeared out of nowhere, and landed about five centimetres above my head.&lt;/p&gt;&#xA;&lt;p&gt;A stroke of thought went through me: Why not write a piece of code down instead of all those stupid answers? It would save me tons of time!&lt;/p&gt;&#xA;&lt;p&gt;So here's the task: Make an algebra solver for me! To save my hand from breaking, the code needs to be as short as possible.&lt;/p&gt;&#xA;&lt;h2&gt;Instructions:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Given an input in the form &lt;code&gt;expand/factorize equation&lt;/code&gt;, return the algebraic equation:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Expanded, if the keyword (the first word) is &lt;code&gt;expand&lt;/code&gt; (e.g. &lt;code&gt;expand (x+1)(x+6)&lt;/code&gt; would return &lt;code&gt;x^2+7x+6&lt;/code&gt;), or&lt;/li&gt;&#xA;&lt;li&gt;Factorized, if the keyword is &lt;code&gt;factorize&lt;/code&gt; (e.g. &lt;code&gt;factorize x^2+9x+14&lt;/code&gt; would return &lt;code&gt;(x+2)(x+7)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The equation will be quadratic, in the form &lt;code&gt;ax^2+bx+c&lt;/code&gt; or &lt;code&gt;(x+d)(x+e)&lt;/code&gt; (&lt;code&gt;a&lt;/code&gt; to &lt;code&gt;e&lt;/code&gt; are all placeholders, while &lt;code&gt;x&lt;/code&gt; is the variable - the variable can be any letter from &lt;code&gt;a&lt;/code&gt; to &lt;code&gt;z&lt;/code&gt; - so an equation like &lt;code&gt;expand (a+3)(b+6)&lt;/code&gt; would still hold).&lt;/li&gt;&#xA;&lt;li&gt;With an expansion equation that contains two or more unknowns (e.g. &lt;code&gt;expand (a+3)(b+6)&lt;/code&gt;), place the letters in the summands with two or more letters in alphabetical order, and place the remaining summands in alphabetical order (so the previous example would equal &lt;code&gt;ab+6a+3b+18&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is code-golf, so shortest code in bytes wins. Good luck!&lt;/p&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any dupes?&lt;/li&gt;&#xA;&lt;li&gt;I probably need a better title. Any suggestions?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-05-31T08:49:27.143" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9287" PostTypeId="2" ParentId="9225" CreationDate="2016-05-30T08:48:41.433" Score="7" Body="&lt;h1&gt;Maintain a list of exemplary challenges&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We would have a post on meta. In this post, each answer would consist of a summary of an exemplary challenge and a link. Each such answer would serve as a nomination, and challenges whose nominations that receive a certain number of upvotes would be considered exemplary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This mechanism ensures that this honor is democratic, since any user can vote on meta, but also ensures that the honor is not unduly influenced by temporary factors, such as whether the challenge ends up on HNQ, since people who want to vote for the challenge as exemplary would have to go to meta to do it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition to serving as a list of exemplary challenge, it would serve as a place for newer members of the site to look for interesting older challenges. In contrast to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9140/tour-of-ppcg-voting-phase&quot;&gt;Tour of PPCG&lt;/a&gt; proposal, it would be primarily for new challenges, to be added shortly after they are written. Of course, older exemplary challenges would still be welcome.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To increase exposure, this post could be featured on Meta, the way the Sandbox is, or mentioned in the help center or similar resources.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The reward for challenge authors would be the recognition by the community of their excellent challenge, in a place for everyone to see, and enjoy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an additional benefit, this system would require no changes to site infrastructure, so we could set it up ourselves.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Based on a suggestion of Sp3000: Once there are a lot of exemplary challenges, it might be hard to find them, or to find the new ones. Therefore, it would be good to have a standard template for nominations, and a stack snippet in the main post to generate the list of exemplary challenges with links, both in order of votes and in order of newness.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2016-05-30T09:07:53.283" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9288" PostTypeId="1" CreationDate="2016-05-30T10:33:59.660" Score="4" ViewCount="288" Body="&lt;p&gt;Every so often old challenges are found which no longer meet our requirements, resulting in them being closed. Since there is renewed interest in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/11880/build-a-working-game-of-tetris-in-conways-game-of-life&quot; title=&quot;Tetris in Game of Life&quot;&gt;this question&lt;/a&gt; it is in danger of suffering the same fate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I find the question interesting, and a number of people are &lt;a href=&quot;http://chat.stackexchange.com/rooms/35837/the-quest-for-tetris&quot; title=&quot;Chat room for the collaborative solution&quot;&gt;actively working on a collaborative solution&lt;/a&gt;. However, it does not have a winning criterion. More strictly, it has a winning criterion of &quot;first person to create a demonstrably working example&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I see this as a question that could continue to receive solutions after the first one, provided there were a way for them to compete with the first. Currently, once a working solution is received the competition is over.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge author seems open to the possibility of introducing a winning criterion, but this needs to be done carefully in order to avoid invalidating the solution that is currently being worked on. For example, introducing a winning criterion that rendered the current solution as not making sufficient effort would restrict the competition rather than opening it up.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How can a winning criterion be stated that allows a working solution to the underlying problem to be valid, while still leaving open the possibility of finding further solutions that are &quot;better&quot; according to the criterion? For challenges that are sufficiently difficult/time consuming, is it enough to simply state in the challenge &quot;Due to the difficulty, any working solution is a valid answer, even if it is likely to be non-competitive after further research&quot;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or does our current requirement that solutions be competitive already allow for this to some extent?&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2016-05-30T20:55:09.893" Title="Phrasing a winning criterion to avoid excluding solutions" Tags="|discussion|winning-criteria|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9291" PostTypeId="2" ParentId="9288" CreationDate="2016-05-30T20:55:09.893" Score="4" Body="&lt;p&gt;As a member of the team working on the current solution, I can say that of the proposed winning criteria I've seen, bounding box is generally the best. I'll list each criteria I've seen and their relative merits (or lack thereof).&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Fewest live cells&lt;/strong&gt; - our solution will likely have live cells for RAM and/or ROM, so this criterion would probably be unnecessarily restrictive and/or annoying. It's an okay criterion though.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Fastest execution&lt;/strong&gt; - this problem is already &lt;em&gt;hard&lt;/em&gt;, okay? :P Seriously though, it's pretty hard to speed up a cellular-automaton-based computer, since you usually have to have precise timings between all components.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Long-term behavior&lt;/strong&gt; (intended to penalize stuff like escaped gliders) - this is pretty much irrelevant since we're using OTCA metapixels, which are structures in Game of Life that allow simulation of any Life-like rules, and they don't have any escaping spaceships.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Bounding box&lt;/strong&gt; - as I've already said, I think this is the way to go. You can do some really interesting stuff with moving components around and connecting them in different ways, and in fact, this kind of golfing has already happened. &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/29966908#29966908&quot;&gt;PhiNotPi created a 55x33 serial adder&lt;/a&gt;, then &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/29984287#29984287&quot;&gt;golfed it to 33x22&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Hence, my suggestion is to change the winning criterion to the smallest bounding box, or possibly the smallest not-necessarily-rectangular region that wholly contains the GoL program.&lt;/p&gt;&#xA;" OwnerUserId="12914" LastActivityDate="2016-05-30T20:55:09.893" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9292" PostTypeId="1" CreationDate="2016-05-31T01:31:11.910" Score="0" ViewCount="71" Body="&lt;p&gt;We have &lt;em&gt;lots&lt;/em&gt; of challenges related to the OEIS (Online Encyclopedia of Integer Sequences). &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Challenges that are integrated with the OEIS&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/49223/31716&quot;&gt;Evolution of OEIS&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/77419/find-the-program-that-prints-this-integer-sequence-cops-thread&quot;&gt;Find the program that prints this integer sequence (Cops&amp;#39; thread)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/51266/31716&quot;&gt;Extending OEIS: Counting Diamond Tilings&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Challenges that are about producing a sequence from the OEIS&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/70802/31716&quot;&gt;Spiral Permutation Sequence&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/66851/31716&quot;&gt;Motzkin Numbers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/78141/31716&quot;&gt;Sum the odd square numbers less than N&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/71000/print-the-super-collatz-numbers&quot;&gt;Print the Super Collatz numbers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is just a fraction of the number of challenges we actually have on the subject. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=Oeis+is%3Aq&quot;&gt;this search&lt;/a&gt; shows 75 questions with &quot;OEIS&quot; somewhere in the body. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we add a tag for this? I see only two potential downsides:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;It's a little bit of a meta-tag. Can you be an expert in the OEIS? To be fair, most of our tags that aren't a winning criteria are a little bit meta. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It doesn't add a whole lot on top of the already existing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; tag. Maybe it should be a synonym instead?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;What does meta think? Could this tag contribute anything useful? &lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-05-31T01:31:11.910" Title="Should we add an [OEIS] tag?" Tags="|discussion|tags|" AnswerCount="0" CommentCount="0" ClosedDate="2016-05-31T01:50:18.707" ContentLicense="CC BY-SA 3.0" />
  <row Id="9293" PostTypeId="2" ParentId="2140" CreationDate="2016-05-31T12:37:31.550" Score="1" Body="&lt;h1&gt;&lt;code&gt;fix show&lt;/code&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is given n, you must print first n character returned from Haskell expression &lt;code&gt;fix show&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let me explain how &lt;code&gt;fix show&lt;/code&gt; produces the &quot;magic&quot; string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;show&lt;/code&gt; is just escaping the string and then add quote. Since the resulting string consists only double quotes and backslash, &lt;code&gt;show&lt;/code&gt; then essentially just put backslash before every character then quote the resulting string.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;show str = '&quot;' : concat ( zipWith (\x y-&amp;gt;[x,y]) (repeat '\\') str ) ++ &quot;\&quot;&quot; -- Well, this is not what prelude give, but&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;fix&lt;/code&gt; is, well, fixpoint combinator. But thanks for laziness, it won't do a infinite loop first.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The string is equivalent to the string defined below:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Assuming there is a series of string. The first string is &lt;code&gt;&quot;&quot;&lt;/code&gt; and the next series is just application of &lt;code&gt;show&lt;/code&gt; to previous string:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;&quot;&#xA;    &quot;\&quot;\&quot;&quot;&#xA;    &quot;\&quot;\\&quot;\\&quot;\&quot;&quot;&#xA;    &quot;\&quot;\\&quot;\\\\&quot;\\\\&quot;\\&quot;\&quot;&quot;&#xA;    &quot;\&quot;\\&quot;\\\\&quot;\\\\\\\\&quot;\\\\\\\\&quot;\\\\&quot;\\&quot;\&quot;&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For all n, there is k so that for all l above k, n-th character of l-th string from series is same. That character is the n-th character of &lt;code&gt;fix show&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TODO: I hate the sentence above, please fix it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first 100 character in resulting string&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;\&quot;\\\&quot;\\\\\\\&quot;\\\\\\\\\\\\\\\&quot;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\&quot;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So, another implementation is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;fixshow = '&quot;' : zip (repeat '\') fixshow ++ &quot;\&quot;&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You are not allowed to use function &lt;code&gt;fix&lt;/code&gt;, &lt;code&gt;show&lt;/code&gt;, and the equivalent functions.&lt;/li&gt;&#xA;&lt;li&gt;Shortest answer wins.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Sandbox question&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Is there another way to prevent answer like &lt;code&gt;flip take$fix show&lt;/code&gt;, or without importing &lt;code&gt;f k=k$f k;j n=take n$f show&lt;/code&gt;. And how about array programming language like APL, J and Jelly?&lt;/p&gt;&#xA;" OwnerUserId="46245" LastEditorUserId="46245" LastEditDate="2016-06-29T11:23:27.873" LastActivityDate="2016-06-29T11:23:27.873" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="9295" PostTypeId="1" AcceptedAnswerId="9296" CreationDate="2016-06-01T19:35:15.873" Score="3" ViewCount="363" Body="&lt;p&gt;I've been lurking in this community for quite a while and finally want to start participating and golfing.  I'm mostly an iOS developer so I expect to golf in Swift and Objective-C.  I recently added an answer to &lt;a href=&quot;https://codegolf.stackexchange.com/q/79203/19617&quot;&gt;Tips for golfing in Swift&lt;/a&gt; and I am wondering what the educate is for answering these types of questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I have multiple tips, should I aggregate them into a single answer or spread them across multiple answers?&lt;/p&gt;&#xA;" OwnerUserId="19617" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-06-01T19:43:44.413" Title="Adding multiple answers to &quot;Tips for golfing in [Language]&quot; questions" Tags="|discussion|policy|answers|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9296" PostTypeId="2" ParentId="9295" CreationDate="2016-06-01T19:39:11.923" Score="6" Body="&lt;p&gt;The standard is one tip per answer. If you look at the existing tips questions (like &lt;a href=&quot;https://codegolf.stackexchange.com/q/54/45941&quot;&gt;Tips for golfing in Python&lt;/a&gt;), you'll see that they specifically state this.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-06-01T19:42:18.730" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9297" PostTypeId="2" ParentId="9263" CreationDate="2016-06-01T23:26:39.923" Score="-3" Body="&lt;h1&gt;What would a calculator output?&lt;/h1&gt;&#xA;&lt;p&gt;The rule of thumb here is that we follow suit to what typical calculation programs output.  Typical means things like calculators/spreadsheet programs, not symbolic calculators.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Integers, Scientific notation, Decimals&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Allowed.&lt;/p&gt;&#xA;&lt;p&gt;Leading zeros are also not allowed on integers, and a single leading zero is allowed (optional) on a number that starts with a decimal point: &lt;code&gt;0.785&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Fractions&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I'm not a fan of fractional notation.  If I put a formula in my TI-83, and I got a fraction instead of a decimal, I'd be pretty surprised (and likely frustrated).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Constants&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Once again, I go back to the rule of &lt;strong&gt;what would I expect a calculator to output&lt;/strong&gt;.  With the case of &lt;code&gt;2i&lt;/code&gt;, its as reduced as possible, so printing out &lt;code&gt;i&lt;/code&gt; is valid.  However, printing out &lt;code&gt;4pi&lt;/code&gt; is &lt;em&gt;not&lt;/em&gt; allowed.&lt;/p&gt;&#xA;&lt;p&gt;As with all defaults, the OP can obviously change any of the above.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-06-02T14:16:29.340" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9299" PostTypeId="2" ParentId="2140" CreationDate="2016-06-02T12:31:18.500" Score="1" Body="&lt;h2&gt;Version Comparator&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given two version strings, return a positive, negative or zero value depending on which one is earlier. Version strings consist of one or more non-negative integers separated by full stops, optionally suffixed by a lowercase letter and a final non-negative integer. Examples of versions:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1.5a2&#xA;1.5b1&#xA;1.5&#xA;2.19&#xA;2.20b&#xA;2.20 or 2.20.0 (these should compare equal)&#xA;8.1a&#xA;8.1&#xA;9&#xA;10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;When comparing versions the integers should of course be compared numerically, not lexically. Missing components should compare as zero against numbers, but they compare after letters. You should then be able to recognise that the above versions are in version order, but you can choose whether this should be a positive or negative result. Reversing the parameters should obviously negate the sign of the result, but you can return a different absolute value if you prefer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Builtins that compare versions are disallowed, but things like regexes are OK.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2016-06-02T15:48:35.307" LastActivityDate="2016-06-02T15:48:35.307" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9300" PostTypeId="2" ParentId="2140" CreationDate="2016-06-02T13:06:01.867" Score="0" Body="&lt;h1&gt;Plan a special tournament&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; [more tags required]&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I host a special tournament with any number &lt;em&gt;n&lt;/em&gt; &gt;= 2 of participants.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is a list of plans of tournaments for &lt;em&gt;n&lt;/em&gt; = 2 to 20:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 2: 1) DE-2c-1w&#xA; 3: 1) RR-3c-1w&#xA; 4: 1) DE-4c-1w&#xA; 5: 1) RR-5c-2w 2) DE-2c-1w&#xA; 6: 1) RR-6c-3w 2) RR-3c-1w&#xA; 7: 1) RR-7c-3w 2) RR-3c-1w&#xA; 8: 1) DE-8c-1w&#xA; 9: 1) RR-9c-4w 2) DE-4c-1w&#xA;10: 1) RR-10c-5w 2) RR-5c-2w 3) DE-2c-1w&#xA;11: 1) RR-11c-5w 2) RR-5c-2w 3) DE-2c-1w&#xA;12: 1) RR-12c-6w 2) RR-6c-3w 3) RR-3c-1w&#xA;13: 1) RR-13c-6w 2) RR-6c-3w 3) RR-3c-1w&#xA;14: 1) RR-14c-7w 2) RR-7c-3w 3) RR-3c-1w&#xA;15: 1) RR-15c-7w 2) RR-7c-3w 3) RR-3c-1w&#xA;16: 1) DE-16c-1w&#xA;17: 1) RR-17c-8w 2) DE-8c-1w&#xA;18: 1) RR-18c-9w 2) RR-9c-4w 3) DE-4c-1w&#xA;19: 1) RR-19c-9w 2) RR-9c-4w 3) DE-4c-1w&#xA;20: 1) RR-20c-10w 2) RR-10c-5w 3) RR-5c-2w 4) DE-2c-1w&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Explanation of the plan&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The entire tournament enters the first round, which has &lt;em&gt;c&lt;/em&gt; = &lt;em&gt;n&lt;/em&gt; participants.&lt;/li&gt;&#xA;&lt;li&gt;For each round:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;em&gt;c&lt;/em&gt; is a &lt;a href=&quot;http://oeis.org/A000079&quot; rel=&quot;nofollow noreferrer&quot;&gt;power of 2&lt;/a&gt;, then this round will be a double elimination round, with 1 winner. After this round, the tournament ends.&lt;/li&gt;&#xA;&lt;li&gt;Else, this round will be a round robin round, with floor(&lt;em&gt;c&lt;/em&gt;/2) winners that continue to the next round.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If only one winner continues, the tournament ends.&lt;/li&gt;&#xA;&lt;li&gt;Else, let &lt;em&gt;c&lt;/em&gt; be the number of winners, and start again from &quot;For each round&quot;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given &lt;em&gt;n&lt;/em&gt;, return a plan of the special tournament with &lt;em&gt;n&lt;/em&gt; participants.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;TODO: Reword the explanation clearly, write more content.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="48538" LastActivityDate="2016-06-02T13:06:01.867" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9303" PostTypeId="1" CreationDate="2016-06-02T19:59:49.233" Score="0" ViewCount="91" Body="&lt;p&gt;There is not a way to copy-paste tables in Desmos &amp;amp; one of my golfs require a table.  How should we score tables?&lt;/p&gt;&#xA;" OwnerUserId="53819" LastActivityDate="2016-06-02T19:59:49.233" Title="Scoring tables in Desmos" Tags="|discussion|scoring|" AnswerCount="0" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9308" PostTypeId="1" AcceptedAnswerId="9309" CreationDate="2016-06-04T16:04:34.750" Score="7" ViewCount="191" Body="&lt;p&gt;Is participating in image-processing challenges allowed, if the language does not support images? If it is allowed, what shall the input format be?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/81256/16901&quot;&gt;Related question&lt;/a&gt; where this issue came up in the comments.&lt;/p&gt;&#xA;" OwnerUserId="16901" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-06-04T16:16:56.187" Title="How to participate in image-processing challenges if the language does not support images?" Tags="|discussion|support|image-processing|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9309" PostTypeId="2" ParentId="9308" CreationDate="2016-06-04T16:16:56.187" Score="11" Body="&lt;p&gt;All languages (which support input via an arbitrary stream of bytes) technically support images. An image file (PNG, JPG, GIF, etc.) can simply be processed without builtin image manipulation functions or image libraries.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, clearly it is impractical to expect &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; answers to rewrite an implementation of PNG for every challenge. A popular image format that I've used and seen used on PPCG is &lt;a href=&quot;https://en.wikipedia.org/wiki/Netpbm_format&quot; rel=&quot;nofollow noreferrer&quot;&gt;Netpbm&lt;/a&gt;, which is extremely easy to parse; images can be converted to and from .p*m with Imagemagick (&lt;code&gt;convert&lt;/code&gt;) or a similar tool.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For challenge-writers: Unless the image format is integral to the challenge (such as &lt;a href=&quot;https://codegolf.stackexchange.com/q/27086/3808&quot;&gt;Output a solid PNG from scratch&lt;/a&gt;), it is strongly recommended that you do not arbitrarily restrict image formats for input and output, so that all languages can reasonably participate.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-06-04T16:16:56.187" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9310" PostTypeId="2" ParentId="2140" CreationDate="2016-06-04T16:32:31.910" Score="0" Body="&lt;h1&gt;Golf a 2d maze (Yes, a whole game)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Nowadays, I am interested in making games. especially mazes. In this golf round of code, You should make a maze game. You can do it with just preset mazes, but, if you make it randomly generate, I will be a-maze-d and will give you bonus points.(Huh. is that a pun?) So, Go on, Why don't you try right now?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;DETAILS:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input W(Up), A(Left), S(Down), D(Right) until the player gets to the finish.&lt;/li&gt;&#xA;&lt;li&gt;Display the maze and the player each input.&lt;/li&gt;&#xA;&lt;li&gt;Move the player Up if the input is 'W', Down if 'S', Left if 'A', and Right if 'D'.&lt;/li&gt;&#xA;&lt;li&gt;The Character for the wall and the player is undefined. you choose.&lt;/li&gt;&#xA;&lt;li&gt;The Character for the wall, the player and the end square should be all different.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;MAZE GENERATING:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You should get the Width and height in the input.&lt;/li&gt;&#xA;&lt;li&gt;Not Necessary, but you can use Prim or Kruskal.&lt;/li&gt;&#xA;&lt;li&gt;Also you can use the method mentioned in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/25967/maze-generation&quot;&gt;here&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user54200" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:21.580" LastActivityDate="2016-06-04T16:32:31.910" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9311" PostTypeId="2" ParentId="2140" CreationDate="2016-06-04T18:23:22.363" Score="1" Body="&lt;h1&gt;Find the duration of a worst-case brute-force attack&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given the following information about a 7-bit ASCII-encoded password and the computer that will crack it with a &lt;a href=&quot;https://en.wikipedia.org/wiki/Brute-force_attack&quot; rel=&quot;nofollow noreferrer&quot;&gt;brute-force attack&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Length of the password in characters&lt;/li&gt;&#xA;&lt;li&gt;Charset size (i.e total count of the possible characters one character in the password can be)&lt;/li&gt;&#xA;&lt;li&gt;Number of passwords the computer can test in one &lt;strike&gt;second&lt;/strike&gt; millisecond (rounded down)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Write the shortest program that finds out how long the attack will take in the worst-case scenario where the computer tries all possible passwords.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The output is the duration in this format: &lt;code&gt;years months days hours minutes seconds milliseconds&lt;/code&gt; &lt;ul&gt;&lt;li&gt;One &quot;month&quot; is 30 days long.&lt;/li&gt;&lt;li&gt;Fractions of milliseconds are rounded up.&lt;/li&gt;&lt;li&gt;You can assume that the cracking finishes immediately if it takes less than 50 milliseconds, and make the program print out &lt;code&gt;Instant&lt;/code&gt; in such cases.&lt;/li&gt;&lt;li&gt;Similarly, the cracking can be considered &lt;code&gt;Neverending&lt;/code&gt; if it takes more than 292 billion years.&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The program can output using &lt;em&gt;any&lt;/em&gt; method, from merely printing to STDOUT to causing a &lt;a href=&quot;https://en.wikipedia.org/wiki/Kernel_panic&quot; rel=&quot;nofollow noreferrer&quot;&gt;kernel panic&lt;/a&gt;/&lt;a href=&quot;https://en.wikipedia.org/wiki/Blue_Screen_of_Death&quot; rel=&quot;nofollow noreferrer&quot;&gt;bluescreen&lt;/a&gt; with the duration as the error message.&lt;/li&gt;&#xA;&lt;li&gt;The input method to get the info about the password/the machine can be anything, as well. Don't use standard loopholes though.&lt;/li&gt;&#xA;&lt;li&gt;It's not enforced, but strongly encouraged to write a standalone program.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Here's how to calculate the charset size:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Start with 0.&lt;/li&gt;&#xA;&lt;li&gt;If there's a digit (in the password), add 10.&lt;/li&gt;&#xA;&lt;li&gt;If there's a lowercase letter, add 26.&lt;/li&gt;&#xA;&lt;li&gt;If there's an uppercase letter, add another 26.&lt;/li&gt;&#xA;&lt;li&gt;If there's punctuation, add 32 (7-bit ASCII has this many punctuation characters).&lt;/li&gt;&#xA;&lt;li&gt;If there's a whitespace character, add 2. Whitespace characters are horizontal tab (0x09) and space (0x20).&lt;/li&gt;&#xA;&lt;li&gt;Any other character counts as non-printable (including backspace (0x08), &lt;code&gt;DEL&lt;/code&gt; (0x7F), line feed (0x0A) and carriage return (0x0D)). Add 29 if there's any of them.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Count of all possible passwords is (charset size)&lt;sup&gt;password length&lt;/sup&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some applicable-in-real-life cases you can test your program with (let's assume the computer that will crack them can test 1 billion passwords per second, which equals to 1,000,000 passwords/millisecond):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;4 characters, charset size 10 (PIN) - 10,000 passwords, output is &lt;code&gt;0 0 0 0 0 0 1&lt;/code&gt; or &lt;code&gt;Instant&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;8 characters, charset size 94 (at least one uppercase letter, one lowercase letter, one digit and one punctuation) - 6,095,689,385,410,816 passwords, output is &lt;code&gt;0 2 10 13 14 49 386&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;10 characters, charset size 2 (weakest valid &lt;a href=&quot;http://www.discourse.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Discourse&lt;/a&gt; password, contains whitespace only) - 1024 passwords, output is &lt;code&gt;0 0 0 0 0 0 1&lt;/code&gt; or &lt;code&gt;Instant&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;25 characters, charset size 26 (&lt;a href=&quot;https://xkcd.com/936/&quot; rel=&quot;nofollow noreferrer&quot;&gt;correcthorsebatterystaple&lt;/a&gt;) - 236,773,830,007,967,588,876,795,164,938,469,376 passwords, output is &lt;code&gt;7612327353651221350 2 14 0 26 4 939&lt;/code&gt; or &lt;code&gt;Neverending&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;127 characters, charset size 96 (&lt;a href=&quot;http://www.thewindowsclub.com/maximum-length-of-password-windows-10&quot; rel=&quot;nofollow noreferrer&quot;&gt;strongest password on newer Windows releases&lt;/a&gt;) - written below&lt;/li&gt;&#xA;&lt;li&gt;1024 characters, charset size 36 (4096-bit PGP key represented as a hexadecimal number) - written below&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;These are the stats of the maximum-strength Windows password:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Passwords: 560,333,510,486,846,899,384,847,242,571,130,277,659,458,884,466,874,695,582,912,274,460,529,559,443,783,341,570,989,525,270,653,136,186,432,110,439,597,936,820,880,106,519,625,601,191,574,799,863,912,148,304,962,133,852,037,202,160,056,511,510,962,873,278,300,126,526,144,267,006,137,180,032,492,751,016,171,207,701,495,935,943,049,216&#xA;Output: 18014837657113133339276210216407223432981574217685014647084370963880194169360318337544673523362047845500003550655797865897637169483847774934889398916928636347805229296463546812516445182705545212838429981490065783731353925307067135133992 5 15 19 58 55 944&#xA;Alternate output: Neverending&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And these are the stats of the PGP key:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Passwords: 4,505,684,579,918,576,285,346,738,866,335,056,898,110,301,685,668,199,078,230,938,179,212,682,315,156,231,410,185,391,761,603,272,976,014,035,539,665,517,248,679,228,261,440,294,129,198,036,262,705,242,310,399,830,546,082,361,923,420,737,260,766,677,891,361,176,003,624,143,368,380,527,062,643,297,677,246,518,686,688,642,023,537,863,317,793,178,302,508,440,097,154,593,959,832,175,055,427,351,149,410,096,495,695,380,712,810,868,774,475,142,767,054,868,274,802,269,522,299,482,066,464,842,097,715,922,988,138,315,118,067,288,670,934,735,264,524,936,706,249,961,394,413,647,964,221,767,703,673,264,468,419,121,528,644,906,680,808,060,759,817,669,970,046,776,525,266,199,099,671,937,918,801,013,826,958,891,378,841,908,663,991,372,649,027,188,879,525,186,690,599,345,723,173,064,252,017,258,129,131,786,488,462,307,158,861,824,049,980,863,991,149,295,162,169,512,952,373,415,599,734,988,691,348,925,488,351,712,593,858,837,027,205,238,618,188,975,201,320,681,214,515,875,812,195,250,605,867,622,987,451,763,883,339,709,733,502,125,838,221,788,546,339,051,347,360,900,518,381,976,167,289,930,943,228,024,924,785,158,428,496,314,937,921,503,359,298,542,415,845,218,449,360,806,235,379,253,546,728,753,218,950,843,742,471,105,739,555,344,908,900,309,982,913,223,331,321,839,212,821,903,239,320,600,564,890,951,140,667,647,680,682,245,252,370,183,758,578,065,733,075,207,856,432,661,797,090,351,101,165,469,273,829,754,476,555,209,675,613,232,875,323,406,611,257,057,059,099,019,633,298,079,410,970,345,108,939,943,042,100,267,260,413,671,556,828,411,902,575,269,208,445,279,433,655,878,082,023,068,697,154,581,711,817,787,688,949,105,583,339,471,599,190,831,084,304,744,483,799,555,478,063,729,574,297,623,870,804,763,558,027,580,772,927,971,329,879,231,979,556,301,616,929,595,576,646,883,067,201,999,872,899,862,889,211,861,332,535,050,455,387,251,034,043,732,447,006,164,551,883,918,733,705,027,099,846,583,024,013,092,062,384,703,436,459,115,108,358,829,136,251,317,699,709,899,140,949,893,425,335,769,021,022,912,434,045,643,544,474,460,899,799,213,759,568,795,794,758,914,390,056,283,305,470,380,859,003,818,724,678,434,816&#xA;Output: 144858686339974803412639495445442930108998896787172038266169565946909796654971431654622934722327449074525319562291578211137739886840732034401886018044055761311424449664413690224320369299057721231224396352345948448015131278860508182828147139982752631922511354755096078964028889980704480936709984283352948061204198196785328857204061945957268141550998891534834171375541476907019128991072373909056348731183618329634024763694746476776233417623704464804027405450152026906721990999895827471385353870130056140660354679074035526421905828555132520211676677361401337091034117370453939870215183392876069255694823382473711006907851853458746913295694931911314073828877816349504523255816791677974298928074750103049081088894521647398444396729546431174466495229648516324713327536964168664025148591452750098101445502202880078966283755495859954505040675103796820824907455740718188735077328268047865426806174561044520100917915500979652319301547868727504821981520811835192875926630119576922600465887060849654310721522802609638109522185755307201898676461606130734024600227278608209698963323356340446015796148617903068964091403666193996894642822309315198786075754477250953946657292049336910661279747924178751224344877465829301109562043071275369906871767991229129085786546569052197642684662087651029574035646976531236521763373563846425925268656816387911380422031991615290633773786744123323731112880994579065426763237282889858685438654794679302568796507941872848896038602862540480809810919146613018187362072374644736799940064590439265446053422181856817801562474722208358918298576208528044087753034364036 10 24 22 32 4 679&#xA;Alternate output: Neverending&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cryptography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cryptography&amp;#39;&quot; rel=&quot;tag&quot;&gt;cryptography&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="53917" LastEditorUserId="53917" LastEditDate="2016-06-05T16:14:13.127" LastActivityDate="2016-06-05T16:14:13.127" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9312" PostTypeId="2" ParentId="2140" CreationDate="2016-06-04T18:59:49.840" Score="-3" Body="&lt;h1&gt;Obfuscate your program&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you must create a program which does something but you need to obfuscate it so that it becomes hard to understand (so don't explain it in your post).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It can accept anything as input and output anything.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Score&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The shorter program (in bytes) which hasn't been understood wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can you guess what does this code calculate?&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;var t=1e5,s=t/1e4,n=s*0.1,i=n*s*7.5,r=!true,b=1,t='01'.split('').map(c=&amp;gt;parseInt(c)).concat(Array(i).join('.').split('.').map(m=&amp;gt;{a=r+b;(r=b)&amp;amp;&amp;amp;(b=a);return a})),t=t.join('').length,b=s,t=r,s=4+NaN;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You should say what language you used&lt;/li&gt;&#xA;&lt;li&gt;You must not use any obfuscation tool&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user54187" LastActivityDate="2016-06-04T18:59:49.840" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9313" PostTypeId="1" CreationDate="2016-06-05T03:27:03.670" Score="0" ViewCount="75" Body="&lt;p&gt;Should questions (code-golf) include an algorithm used to find the answer in its description? I feel like that whole point of code-golf is to come up with your own algorithm of solving a problem, something shorter-to-write than others, which is the hardest (and most fun part) IMO. If you are given the algorithm, isn't this just basically a translate-pseudocode-to-golfing-language contest?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some examples of questions that do this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/77492/draw-a-spiral-in-a-box&quot;&gt;Draw a spiral in a box&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I understand some kind of have to, or else it would be unclear what you were supposed to do. Examples of this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/76914/draw-a-random-hexa-glyph?rq=1&quot;&gt;Draw a random hexa-glyph&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;(I am finding more examples - if you have any please share them)&lt;/p&gt;&#xA;" OwnerUserId="42499" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-06-05T06:09:44.797" Title="Should questions include the algorithm used to find the answer?" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9314" PostTypeId="2" ParentId="9313" CreationDate="2016-06-05T04:00:22.477" Score="4" Body="&lt;p&gt;The two questions you have there are based on a user-defined construction. There are many parameters that could have been arbitrarily chosen - taking the hexa-glyph example, this could be what edges combinations are valid, since this is difficult to infer by looking at the final output glyphs alone. These types of questions should definitely be explicit about what algorithm was used and what leeways are allowed, so that submissions can be checked against the spec.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, that doesn't mean there isn't any creative freedom when golfing - just because an algorithm is given doesn't mean you can't find your own way to produce an equivalent result. A good example of this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/47338/shotgun-numbers&quot;&gt;Shotgun Numbers&lt;/a&gt; - a direct implementation of the algorithm described would be far too expensive to be useful in most languages. In this case, finding an alternative short algorithm consitutes most of the fun in the question. As a further example, you'll notice that Martin's solution deviates from the algorithm described in hexa-glyphs, not using the outer points for golfitude, so it's certainly not a &quot;pseudocode-to-language&quot; contest.&lt;/p&gt;&#xA;" OwnerUserId="21487" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-06-05T04:00:22.477" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9315" PostTypeId="2" ParentId="9313" CreationDate="2016-06-05T06:09:44.797" Score="0" Body="&lt;p&gt;It should not be required, but for challenges dealing with sufficiently complicated and/or esoteric goals, an example algorithm to help solve the challenge is not a bad idea. I personally recommend including at least the name of an algorithm that can be used to solve the challenge if it's unlikely that many people are knowledgeable about the problem and/or the algorithm. For example, including information about a sorting algorithm in a sorting challenge would be superfluous, as sorting is one of the most elementary classes of problems in computer science (unless the specific challenge involved using a specific, esoteric sort). However, a challenge about simulating a quantum computer to factor an integer would definitely benefit from mentioning Shor's algorithm.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In other words, use your judgement. Do whatever you think would be the best for each of your challenges.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2016-06-05T06:09:44.797" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9316" PostTypeId="2" ParentId="2140" CreationDate="2016-06-05T11:59:00.353" Score="0" Body="&lt;h1&gt;Light black box: generate mirror processors&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;[ WORK IN PROGRESS - LOTS OF OUTSTANDING QUESTIONS ]&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The list of black box output values for all black box input values from 0 to 255 (inclusive), in any reasonable format. Each value is also in the range 0 to 255.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A text representation of a rectangular grid showing the locations and orientations of mirrors that will generate the appropriate black box output for each black box input.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Specification&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input bits arrive from the left of the grid, in the top 8 squares, initially travelling right.&lt;/li&gt;&#xA;&lt;li&gt;The output bits depart from the right of the grid, in the top 8 squares, travelling right.&lt;/li&gt;&#xA;&lt;li&gt;For both black box input and black box output, the most significant bit is at the top.&lt;/li&gt;&#xA;&lt;li&gt;Bits move through the grid horizontally or vertically until they encounter a mirror or the edge of the grid.&lt;/li&gt;&#xA;&lt;li&gt;Bits that leave the edge of the grid are lost.&lt;/li&gt;&#xA;&lt;li&gt;A bit that would move onto a mirror at the next step instead changes direction by 90 degrees clockwise or anticlockwise according to the mirror type, and takes a step in that direction (a bit never stays on the same square).&lt;/li&gt;&#xA;&lt;li&gt;If two or more bits arrive on the same square at the same timestep, all of them annihilate. Two bits can still pass through each other if this does not involve sharing a square (traveling in opposite directions, being adjacent facing towards each other on one step, and adjacent facing away from each other on the next).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Note that because a bit changes direction just before reaching a mirror, there cannot generally be a mirror in an input or output square, as this would prevent the bit entering/leaving by that square. However, a grid taking advantage of input/output that has no requirement for a given bit by placing a mirror that blocks a given input or output square is still valid provided it gives the correct behaviour.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;[ PENDING ]&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The score for each input is the area of the resulting grid. The total score will be the sum of the scores for each of the test inputs.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this too similar to domino circuits? The photons leave no trail so they can cross over their own and each other's paths arbitrarily many times. Also a given mirror can affect arbitrarily many photons, and each an arbitrary number of times.&lt;/li&gt;&#xA;&lt;li&gt;Is this a duplicate of anything else?&lt;/li&gt;&#xA;&lt;li&gt;Should the score be just the area of the grid, or also include the time between input and output? The time will have to be the worst case over all inputs, as reading the input before then would give a false result in some cases.&lt;/li&gt;&#xA;&lt;li&gt;Should output bits have to arrive at the same time?&lt;/li&gt;&#xA;&lt;li&gt;Should the time from input to output be required to be constant over all inputs?&lt;/li&gt;&#xA;&lt;li&gt;There cannot be more output bits than input bits. Should test cases reflect this, or should a mechanism be introduced to make all patterns of output possible?&lt;/li&gt;&#xA;&lt;li&gt;Should the particles be referred to as &quot;bits&quot;, &quot;photons&quot;, or something else?&lt;/li&gt;&#xA;&lt;li&gt;Currently tie break is first posted. Should the number of mirrors be taken into account as a tie break first?&lt;/li&gt;&#xA;&lt;li&gt;Should the grid wrap? I initially thought not, but then I realised there would need to be an extra row above the I/O rows to allow mirrors to redirect onto the top output bit. It might be simpler to keep to having the I/O rows at the very top, and simply put redirecting mirrors in the bottom row. This would make it possible to redirect onto rows 0 and 7 with only 8 rows in total.&lt;/li&gt;&#xA;&lt;li&gt;I've chosen mirrors that change the bit's direction just &lt;em&gt;before&lt;/em&gt; impact, rather than on impact. I liked the fact that this gives an asymmetry - reversing the direction will not reverse the route taken. This introduces the potential for sending a bit back along part of the same path without trivially sending it back to its origin. Is there any reason to stick to the symmetrical case instead?&lt;/li&gt;&#xA;&lt;li&gt;The other thought that occurred to me was to have the mirrors change direction too, flipping between the two possibilities at each impact.&lt;/li&gt;&#xA;&lt;li&gt;There are &lt;code&gt;256**256&lt;/code&gt; possible ways to assign a value from 0 to 255 to each of 256 different inputs. This is far too large a space for hardcoding all solutions. However, this doesn't necessarily mean that the worst case grids will be huge. A lower bound on the worst case grid area is &lt;code&gt;log(256**256,3)&lt;/code&gt;, which is just over 1292 (since there are 3 possible states for each square). The maximal lower bound is likely to be far higher than that, but I have no idea how much higher. I'm likely to settle on a small enough space that code can be expected to deal with any input, but still a large enough space that hardcoding is impossible (I don't want to explicitly rule it out). &lt;em&gt;(Here &lt;code&gt;**&lt;/code&gt; indicates exponentiation, as used in python.)&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;Mirrors that split bits, and bits annihilate on collision with each other. This will allow for arbitrary input and output rather than being restricted by the initial number of bits. I'm considering a number of possible approaches:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;One mirror type only: always splits a single bit into two bits in the two directions perpendicular to the current direction.&lt;/li&gt;&#xA;&lt;li&gt;4 mirror types - each having a dead direction. A bit arriving from that direction is destroyed. A bit arriving from any other direction is split into two bits, one for each remaining direction.&lt;/li&gt;&#xA;&lt;li&gt;4 mirror types - each having a dead direction. A bit is only split into two bits if the two perpendicular directions are not dead. Otherwise only one bit is produced, in the available perpendicular direction (or no bits if the bit approaches from the dead direction).&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;Can bits be left in the grid that do not terminate? Can a solution specify that the output should be measured at a set time, even if some bits will later reach the output squares altering the result? Should the output only be measured once all activity has ceased - excluding the possibility of using a repeating cycle?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2016-06-05T12:13:41.707" LastActivityDate="2016-06-05T12:13:41.707" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9317" PostTypeId="1" AcceptedAnswerId="9323" CreationDate="2016-06-05T21:57:17.673" Score="7" ViewCount="515" Body="&lt;p&gt;Is it allowed to submit a Python solution like the below:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{&quot;a&quot;:&quot;b&quot;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;if the challenge is to output &lt;code&gt;b&lt;/code&gt; if the input is &lt;code&gt;a&lt;/code&gt;, and error otherwise? I could claim, &quot;It is an anonymous function, it just requires a different syntax:&quot;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f = {&quot;a&quot;:&quot;b&quot;}&#xA;f[input()]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Is this a valid submission?&lt;/p&gt;&#xA;" OwnerUserId="48922" LastEditorUserId="48922" LastEditDate="2016-06-08T04:33:20.053" LastActivityDate="2017-04-28T19:08:30.637" Title="Function that requires different syntax to &quot;call&quot;" Tags="|discussion|answers|" AnswerCount="3" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9319" PostTypeId="2" ParentId="9317" CreationDate="2016-06-06T07:14:19.483" Score="2" Body="&lt;p&gt;Just because you can claim something, doesn't make you right. If you did claim that this was an anonymous function then you would be objectively wrong and your answer would quickly receive a lot of downvotes and votes for deletion as low quality.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2016-06-06T07:14:19.483" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9320" PostTypeId="2" ParentId="9317" CreationDate="2016-06-06T08:18:42.963" Score="11" Body="&lt;p&gt;It's not a function in Python (since Python has functions, and that is objectively not a function), so you couldn't claim it is one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, in the mathematical sense, a &lt;code&gt;dict&lt;/code&gt; (or any other mapping type) is a function (or close enough for our standards). Python &lt;code&gt;dict&lt;/code&gt;s define a domain (with no repeated values), a codomain (with possibly repeated values), and a mapping from domain values to codomain values. That is &lt;em&gt;exactly&lt;/em&gt; the &lt;a href=&quot;https://en.wikipedia.org/wiki/Function_(mathematics)&quot; rel=&quot;nofollow noreferrer&quot;&gt;definition of a function in mathematics&lt;/a&gt;. Specifically, it functions identically to a &lt;a href=&quot;https://en.wikipedia.org/wiki/Partial_function&quot; rel=&quot;nofollow noreferrer&quot;&gt;partial function&lt;/a&gt;, in which not all of the elements of the domain (i.e. every hashable Python object) have a mapping to elements of the codomain (though using &lt;a href=&quot;https://docs.python.org/2/library/collections.html#collections.defaultdict&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;collections.defaultdict&lt;/code&gt;&lt;/a&gt; or the &lt;a href=&quot;https://docs.python.org/2/library/stdtypes.html#dict.get&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;default&lt;/code&gt; parameter of &lt;code&gt;dict.get&lt;/code&gt;&lt;/a&gt; make it a total function).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Furthermore, they fulfill our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8737/45941&quot;&gt;requirements for function submissions&lt;/a&gt; - they are consistent and reusable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As such, it is my opinion that mapping objects (such as Python &lt;code&gt;dict&lt;/code&gt;s, C++ &lt;code&gt;std::map&lt;/code&gt;s, and Java &lt;code&gt;java.util.HashMap&lt;/code&gt;s) are valid function submissions.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2016-06-07T00:58:11.853" CommentCount="23" ContentLicense="CC BY-SA 3.0" />
  <row Id="9322" PostTypeId="2" ParentId="2140" CreationDate="2016-06-06T20:58:06.920" Score="0" Body="&lt;h2&gt;Point Triangulation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(title suggestions welcome)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Triangulation_(surveying)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Triangulation&lt;/a&gt; has been used for hundreds of years for land mapping and cartography, until the widespread proliferation of satellite positioning systems. Essentially, if you know two fixed points, &lt;em&gt;A&lt;/em&gt; and &lt;em&gt;B&lt;/em&gt;, you can uniquely describe a third point &lt;em&gt;C&lt;/em&gt; by describing the angles &lt;em&gt;BAC&lt;/em&gt; and &lt;em&gt;ABC&lt;/em&gt; (the &lt;a href=&quot;https://en.wikipedia.org/wiki/Solution_of_triangles#A_side_and_two_adjacent_angles_given_.28ASA.29&quot; rel=&quot;nofollow noreferrer&quot;&gt;angle-side-angle postulate&lt;/a&gt;). The challenge here will be to solve for &lt;em&gt;C&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Two rays (half-lines) of the form &lt;code&gt;[(a point in x,y coordinates), (a direction in degrees or radians)]&lt;/code&gt; in any convenient format.&lt;/li&gt;&#xA;&lt;li&gt;The input angle will be &lt;em&gt;relative to the Cartesian plane&lt;/em&gt;, i.e., an input of &lt;code&gt;0&lt;/code&gt; degrees will have the ray parallel to the &lt;code&gt;x&lt;/code&gt; axis and pointing toward &lt;code&gt;x=+inf&lt;/code&gt;, and will follow traditional Euclidean convention that the angle increases counter-clockwise (e.g., &lt;code&gt;90&lt;/code&gt; degrees is &quot;straight up&quot; toward &lt;code&gt;y=+inf&lt;/code&gt;, &lt;code&gt;180&lt;/code&gt; is &quot;straight left&quot; toward &lt;code&gt;x=-inf&lt;/code&gt;, etc.).&lt;/li&gt;&#xA;&lt;li&gt;Please specify in your description the input format you're using.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The corresponding third &lt;code&gt;x,y&lt;/code&gt; coordinate where the rays intersect, thus forming the triangle.&lt;/li&gt;&#xA;&lt;li&gt;If the input will &lt;em&gt;not&lt;/em&gt; form a triangle, you can output an error, crash, output nothing, etc., so long as your code terminates. (&lt;em&gt;META - is this too harsh? Should the input be guaranteed to form a triangle?&lt;/em&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[(1,0,90), (0,1,0)] -&amp;gt; (1,1)&#xA;[(1,0,90), (0,0,45)] -&amp;gt; (1,1)&#xA;[(1,0,90), (0,1,180)] -&amp;gt; undefined&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;additional examples forthcoming&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/2057/42963&quot;&gt;related&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:26.977" LastActivityDate="2016-08-04T20:26:15.873" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9323" PostTypeId="2" ParentId="9317" CreationDate="2016-06-07T00:35:09.927" Score="7" Body="&lt;h2&gt;It's not a function (at least in this case)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;No, it shouldn't be allowed, at least not as a &quot;function&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your submission is a hashmap, which isn't a function. Last time I checked I couldn't perform primality checking by accessing a hashmap (without hardcoding every number which is disallowed by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1063/40695&quot;&gt;this loophole&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9317/function-that-requires-different-syntax-to-call#comment27437_9323&quot;&gt;@Mego stated&lt;/a&gt; that python's '&lt;code&gt;collections.defaultdict&lt;/code&gt;', can perform primality checking, and I'm guessing can add two numbers, and so it fulfills the definition of a function. But the again, python has functions, a hashmap simply is not a function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Languages which have functions, those functions are the only functions. Anything else is not a function and is viable to abuse.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;E.g. If &quot;functions that get called in a different way&quot;, were allowed. Well, guess what? I have a solution that's called through eval! Huh,... I also have a function that's called through &lt;code&gt;prompt().split(&quot;&quot;).map((l,i,a)=&amp;gt;&amp;lt;CODE HERE&amp;gt;)&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So here's my stance:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;If it's not a function, it's not a function&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pretty straightforward, eh?&lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="41042" LastEditDate="2017-04-28T19:08:30.637" LastActivityDate="2017-04-28T19:08:30.637" CommentCount="34" ContentLicense="CC BY-SA 3.0" />
  <row Id="9324" PostTypeId="2" ParentId="2140" CreationDate="2016-06-07T01:58:17.160" Score="2" Body="&lt;h1&gt;Shortest program with unknown halting status&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Post a term on the &lt;a href=&quot;https://en.wikipedia.org/wiki/Binary_lambda_calculus&quot; rel=&quot;nofollow&quot;&gt;binary λ-calculus&lt;/a&gt; (BLC) whose termination is unknown. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If someone proves that your term does or doesn't terminate, you entry is disqualified.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The term with the smallest number of bits on the BLC wins.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Don't forget to also post a quick description of what you did and the original source code, otherwise we will just have to trust your random string meets the specs!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example submission&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Size: 579 bits&#xA;&#xA;Program: 01001001000100010001000101100111101111001110010101000001110011101000000111001110&#xA;10010000011100111010000001110011101000000111001110100000000111000011100111110100&#xA;00101011000000000010111011100101011111000000111001011111101101011010000000100000&#xA;10000001011100000000001110010101010101010111100000011100101010110000000001110000&#xA;00000111100000000011110000000001100001010101100000001110000000110000000100000001&#xA;00000000010010111110111100000010101111110000001100000011100111110000101101101110&#xA;00110000101100010111001011111011110000001110010111111000011110011110011110101000&#xA;0010110101000011010&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Explanation:&lt;/strong&gt; this term, if it terminates, reduces to a list with all church-encoded natural numbers of the sequence of Collatz (&lt;a href=&quot;https://oeis.org/A006577&quot; rel=&quot;nofollow&quot;&gt;A006577&lt;/a&gt;) from 0 to 2^256. It is not known if &lt;code&gt;collats(n)&lt;/code&gt; halts for all &lt;code&gt;n&lt;/code&gt;; we only know up to about &lt;code&gt;2^64&lt;/code&gt;, so my submission satisfies the specification. For a longer explanation, I've set &lt;a href=&quot;https://github.com/MaiaVictor/unknown_halting_status&quot; rel=&quot;nofollow&quot;&gt;this repository&lt;/a&gt;. The original code was written on Caramel and also on the repository. Here is a brief:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-- Receives fix and a natural, returns the number of&#xA;-- recursive calls until the collatz function halts.&#xA;collatz fix n = (fix go n)&#xA;&#xA;    -- The recursive search&#xA;    go go n = (succ (even_odd_or_leq_one n even odd leq1))&#xA;        even = (go go (half n))&#xA;        odd  = (go go (succ (mul n 3)))&#xA;        leq1 = 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="7607" LastActivityDate="2016-06-07T01:58:17.160" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="9325" PostTypeId="2" ParentId="2140" CreationDate="2016-06-07T02:41:15.853" Score="0" Body="&lt;h2&gt;Implement an HTTP Tunnel&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm bored at work and stuck behind a draconian proxy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;They can take my other ports but they can never take my port 80 freedom!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Help me get all the internets!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;requirements&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a single web page that processes GET and POST data and produces output&lt;/li&gt;&#xA;&lt;li&gt;if GET &lt;code&gt;m=start&lt;/code&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;creates any files you feel are necessary (named pipes, scripts, what-have-you)&lt;/li&gt;&#xA;&lt;li&gt;forks a process which will create a tcp connection&lt;/li&gt;&#xA;&lt;li&gt;connects to host and port based on GET variables &lt;code&gt;h&lt;/code&gt; and &lt;code&gt;p&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;these variables should be cleansed so as not to allow command injection&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;if GET &lt;code&gt;m=in&lt;/code&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;write the raw POST data to your forked process's tcp connection&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;if GET &lt;code&gt;m=out&lt;/code&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;get all data available from the forked process's tcp connection and write as response&lt;/li&gt;&#xA;&lt;li&gt;should always return right away (let's say, in less than 1 second)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;if GET &lt;code&gt;m=stop&lt;/code&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;kill your forked process&lt;/li&gt;&#xA;&lt;li&gt;clean up any files it has created&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test data&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://servername/httptunnel?mode=start&amp;amp;host=ppcg.ga&amp;amp;port=80&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://servername/httptunnel?mode=start&amp;amp;host=ppcg.ga&amp;amp;port=80&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://servername/httptunnel?mode=in&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://servername/httptunnel?mode=in&lt;/a&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;POST data: &lt;code&gt;GET / HTTP/1.1\r\nHost: ppcg.ga\r\n\r\n&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://servername/httptunnel?mode=out&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://servername/httptunnel?mode=out&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;HTTP/1.1 301 Moved Permanently&#xA;Server: nginx&#xA;Date: Tue, 07 Jun 2016 02:03:14 GMT&#xA;Content-Length: 0&#xA;Connection: keep-alive&#xA;Cache-Control: no-cache&#xA;Expires: Thu, 01 Jan 1970 00:00:01 GMT&#xA;Location: https://codegolf.stackexchange.com/&#xA;Pragma: no-cache&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;again, to prove the connection is still open, &lt;a href=&quot;http://servername/httptunnel?mode=in&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://servername/httptunnel?mode=in&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;POST data: &lt;code&gt;GET / HTTP/1.1\r\nHost: ppcg.ga\r\n\r\n&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;and again, &lt;a href=&quot;http://servername/httptunnel?mode=out&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://servername/httptunnel?mode=out&lt;/a&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Content returned: same as before&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://servername/httptunnel?mode=stop&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://servername/httptunnel?mode=stop&lt;/a&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;system state returned to prior to the first http call&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;my first instinct was to have this challenge be three separate pieces of code, a client which listens on a port locally and interacts with the web page, the web page itself, and a script which will be forked by the web page. your score would be the sum of all their byte counts. i decided to remove the last as the start process would likely have to create other files so why not have it create the script to run as well, and decided to remove the first option as well to make it nice and even.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;is this a feasible challenge? i will add more explanations and test data soon i think. adding my own client would probably be helpful&lt;/p&gt;&#xA;" OwnerUserId="32094" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:21.580" LastActivityDate="2016-06-07T02:41:15.853" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9326" PostTypeId="2" ParentId="2140" CreationDate="2016-06-07T09:05:32.310" Score="2" Body="&lt;h1&gt;Maximal root multiplicity of integer polynomials&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/algebra&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;algebra&amp;#39;&quot; rel=&quot;tag&quot;&gt;algebra&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polynomial&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polynomial&amp;#39;&quot; rel=&quot;tag&quot;&gt;polynomial&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a non constant polynomial with integer coefficients, determine the maximal multiplicity of it's (perhaps complex) roots.&lt;/p&gt;&#xA;&lt;h3&gt;Definitions&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Multiplicity:&lt;/strong&gt; Let &lt;code&gt;p&lt;/code&gt; be a polynomial with complex coefficients and &lt;code&gt;x0&lt;/code&gt; some complex number. If &lt;code&gt;x0&lt;/code&gt; is a root, it is said to have multiplicity &lt;code&gt;n&lt;/code&gt; if &lt;code&gt;p(x) = a(x) * (x-x0)^n&lt;/code&gt; where &lt;code&gt;a&lt;/code&gt; is another (complex) polynomial such that &lt;code&gt;(x-x0)&lt;/code&gt; does not divide &lt;code&gt;a&lt;/code&gt;. If &lt;code&gt;x0&lt;/code&gt; is not a root it is defined to have multiplicity &lt;code&gt;0&lt;/code&gt;. Note that the polynomials we consider do only have integral coefficients (consider the integers as a subset of the complex numbers).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Maximal Multiplicity:&lt;/strong&gt; Let &lt;code&gt;x0,...,xk&lt;/code&gt; be the roots of of &lt;code&gt;p&lt;/code&gt;,then the maximal multiplicity of &lt;code&gt;p&lt;/code&gt; is defined as the maximal multiplicity of &lt;code&gt;xi&lt;/code&gt; for &lt;code&gt;i=0,...,k&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;I/O&lt;/h3&gt;&#xA;&lt;p&gt;For the input and output, the polynomials can be written in any convenient format, e.g. also as a (variable length) list of coefficients.&lt;/p&gt;&#xA;&lt;h3&gt;Hints&lt;/h3&gt;&#xA;&lt;p&gt;A polynomial has a root of multiplicity greater than one if and only if it shares a root with it's derivative. This can e.g. be checked with the &lt;a href=&quot;https://en.wikipedia.org/wiki/Discriminant#Discriminant_of_a_polynomial&quot; rel=&quot;nofollow noreferrer&quot;&gt;discriminant&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;polynomial     maximal multiplicity&#xA;1              0&#xA;x^7-1          1&#xA;x^8-x^7-x-1    2&#xA;x^3-3x^2+3x-1  3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-06-07T14:54:26.047" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="9327" PostTypeId="2" ParentId="2140" CreationDate="2016-06-07T09:47:48.670" Score="2" Body="&lt;h2&gt;Determine the winner of Beggar my Neighbour&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The card game Beggar my Neighbour is boring in that the final outcome is entirely determined by the initial arrangement of the deck, so long as certain rules are followed for the order in which cards are picked up from the playing field and moved to decks.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Game&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Both players are dealt 26 cards.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Players play their top card alternately, starting with the player who won the previous stack or Player 1 at the beginning of the game.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Play is interrupted when either player plays a picture card. In that case their opponent must play a number of cards equal to the value of the picture card above 10, i.e. Jack = 1, Queen = 2, King = 3, Ace = 4. The player then wins all the played cards which are returned to the bottom of their hand, unless the opponent themselves plays a picture card, in which case this rule interrupts their play.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If at any point one of the players needs to draw a card from their deck, but their deck is empty, they immediately lose the game.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Example play&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Player 1 starts with 7; Player 2 plays 3; subsequent plays are 9; 9; T; A; 6, J; A; 2, 3, 7, 6: Player 2 adds the cards 7399TA6JA2376 to his deck.&lt;br&gt;&#xA;Player 2 starts: J; K; 9, 4, A; 5, 2, J; 2: Player 1 adds the cards JK94A52J2 to his deck.&lt;br&gt;&#xA;Player 1 starts: 6; T; T; 5; 9; A; A; 3, K; K; 7, Q; 5, T: Player 1 adds the cards 6TT59AA3KK7Q5T to his deck.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given two lists of cards in the players' decks, in any convenient format, output a truthy value if Player 1 wins, and a falsey value if Player 2 wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For convenience, a 10 card will be represented with a T, and face cards will be abbreviated (Ace -&gt; A, King -&gt; K, Queen -&gt; Q, Jack -&gt; J), so that all cards are one character long. Alternatively, ranks may be represented with decimal integers 2-14 (Jack -&gt; 11, Queen -&gt; 12, King -&gt; 13, Ace -&gt; 14) or hex digits 2-E (10 -&gt; A, Jack -&gt; B, Queen -&gt; C, King -&gt; D, Ace -&gt; E). Since suits don't matter, suit information will not be given.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may assume that all games will terminate at some point (though it may take a very long time), and one player will always run out of cards before the other.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are variations for more than two players but they will not be considered here.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2016-06-07T09:47:48.670" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9328" PostTypeId="1" CreationDate="2016-06-07T11:51:50.240" Score="0" ViewCount="82" Body="&lt;p&gt;In &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5447/41723&quot;&gt;this thread&lt;/a&gt;, it is accepted that answers that use a new version of a language created after the challenge was posted are non-competing, because otherwise people would implement new built-ins that fit the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, it is not clear in this answer (and @lirtosiast comment is not answered) whether or not a bug fix of the implementation of a language is considered a &quot;new version&quot; or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is pretty common for me to find bugs in my own language while trying to answer a challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Assuming good faith of the user (i.e. that he really intented his language to work that way in the first place)&lt;/strong&gt;, is it acceptable to fix bugs in a language's implementation after the challenge was posted, while keeping the &quot;competing&quot; status of the answer?&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2016-06-07T11:51:50.240" Title="Does fixing an implementation bug renders the answer non-competing?" Tags="|discussion|answers|accepted-answer|" AnswerCount="0" CommentCount="1" ClosedDate="2016-06-07T12:01:22.690" ContentLicense="CC BY-SA 3.0" />
  <row Id="9329" PostTypeId="2" ParentId="2140" CreationDate="2016-06-07T15:50:46.373" Score="6" Body="&lt;h2&gt;Reverse the lengths&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this challenge, your task is to reverse the lengths of an array-of-arrays, while keeping its concatenation intact.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More explicitly, your input is an array of arrays of nonnegative integers, which you may assume to fit in the native &lt;code&gt;int&lt;/code&gt; type of your language.&#xA;The input may be an empty array or an array of empty arrays, or it may contain arrays of different lengths.&#xA;You can take the input in any reasonable format.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your output shall be another array of arrays, again in any reasonable format.&#xA;The concatenation of the output shall be equal to the concatenation of the input, so it contains the same integers in the same order.&#xA;However, the sequence of lengths in the output shall be the &lt;em&gt;reverse&lt;/em&gt; of that of the input.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Consider the input array&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = [[4,10],[0],[],[3,3,2],[1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The concatenation of &lt;code&gt;A&lt;/code&gt; is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;B = [4,10,0,3,3,2,1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and its length sequence is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;C = [2,1,0,3,1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The correct output is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[4],[10,0,3],[],[3],[2,1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;since it's the unique array with concatenation &lt;code&gt;B&lt;/code&gt; and length sequence &lt;code&gt;reverse(C)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules and scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You con write a full program or a function.&#xA;The lowest byte count wins, and standard loopholes are disallowed.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;TODO: make more&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[] -&amp;gt; []&#xA;[[]] -&amp;gt; [[]]&#xA;[[],[],[1]] -&amp;gt; [[1],[],[]]&#xA;[[1,2],[4,5,6]] -&amp;gt; [[1,2,4],[5,6]]&#xA;[[4,10],[0],[],[3,3,2],[1]] -&amp;gt; [[4],[10,0,3],[],[3],[2,1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sandbox comments&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm debating whether I should guarantee that the input is non-empty, and/or only contains non-empty arrays.&#xA;In some languages (like J), empty arrays make the challenge significantly harder, but on the other hand, I don't want it to be &lt;em&gt;too&lt;/em&gt; easy either.&lt;/p&gt;&#xA;" OwnerUserId="32014" LastActivityDate="2016-06-07T15:50:46.373" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9331" PostTypeId="2" ParentId="2140" CreationDate="2016-06-08T00:38:41.863" Score="1" Body="&lt;h1&gt;Ping Pong&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This challenge is to make a program that prints a text ping-pong animation. Your program is to display a string of tildes with a &lt;code&gt;PING&lt;/code&gt; on it moving to the right. Each tick, the text &lt;code&gt;PING&lt;/code&gt; moves one to the right one character, reducing the number of tildes on the right by one and increasing the amount on the left by one. Once the &lt;code&gt;PING&lt;/code&gt; reaches the right side of the string, it changes to a &lt;code&gt;PONG&lt;/code&gt; and the reverse happens (i.e it moves to the left instead). &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The number of tildes must always be the same&lt;/li&gt;&#xA;&lt;li&gt;The number of tildes must be at least 30&lt;/li&gt;&#xA;&lt;li&gt;The number of milliseconds between ticks must be at least 10 ms and at most 1 s&lt;/li&gt;&#xA;&lt;li&gt;The &lt;code&gt;PING&lt;/code&gt; must start at the left hand of the string&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your score is the number of bytes plus/minus the following (all that apply): &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;-10 bytes for browser implementation using the ping after the hash&#xA;&lt;a href=&quot;https://i.stack.imgur.com/BhOpu.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/BhOpu.png&quot; alt=&quot;Example&quot;&gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;+10 bytes if your implementation does not clear previously outputted frames &lt;/li&gt;&#xA;&lt;li&gt;More suggestions welcome&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Lowest score wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example Implementation (JS, Ungolfed)&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;i=0;b=false;len=50;td=40;function urlPong(){location.hash=new Array(i+1).join(&quot;~&quot;)+(!b?&quot;PING&quot;:&quot;PONG&quot;)+new Array(len-4-i+1).join(&quot;~&quot;);if(!b){if(len-4-i&amp;lt;=0){b=true;}else{i++;}}else{if(i&amp;lt;=0){b=false;}else{i--;};}setTimeout(urlPong,td);}urlPong();&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="41507" LastEditorUserId="41507" LastEditDate="2016-06-10T00:57:38.387" LastActivityDate="2016-06-10T00:57:38.387" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9333" PostTypeId="1" CreationDate="2016-06-08T20:46:30.173" Score="0" ViewCount="84" Body="&lt;p&gt;I recently found the closed &lt;a href=&quot;https://codegolf.stackexchange.com/q/7197/19617&quot;&gt;Crash your favorite compiler&lt;/a&gt; question and was wondering how a type of question like this could be changed to fit the requirements of a challenge question as outlined in the Help Center.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Could we break it down into &quot;crash your favorite IDE&quot; vs &quot;crash your favorite compiler?&quot;  What about crashes related to memory corruption or crashes not found by fuzzing?  Would any of these contestants make this question on-topic?&lt;/p&gt;&#xA;" OwnerUserId="19617" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-06-08T20:46:30.173" Title="How could &quot;Crash your favorite compiler&quot; be edited to be on-topic?" Tags="|discussion|challenges|specific-question|closed-questions|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9334" PostTypeId="2" ParentId="8047" CreationDate="2016-06-08T22:19:31.550" Score="24" Body="&lt;h1&gt;Narrow references&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Beware of challenge topics that tickle your fancy, but others won't appreciate.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An in-joke among friends&lt;/li&gt;&#xA;&lt;li&gt;A reference to a movie you like&lt;/li&gt;&#xA;&lt;li&gt;A task from actual code you wrote&lt;/li&gt;&#xA;&lt;li&gt;A small part of an existing algorithm without context&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;These can be sources of inspiration, but make sure the challenge itself is interesting to do. Imagine someone without the background: would they appreciate the topic once you explain it? Often it's best to just pose the task, then unobtrusively explain the background separately.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2016-06-08T22:19:31.550" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9335" PostTypeId="2" ParentId="2140" CreationDate="2016-06-09T00:58:35.433" Score="0" Body="&lt;h1&gt;Code Golfed Rosetta Code Code Golfer&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; (any others? maybe &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimized-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimized-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimized-output&lt;/a&gt; and/or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;p&gt;Browsing examples on &lt;a href=&quot;http://rosettacode.org/wiki/Rosetta_Code&quot; rel=&quot;nofollow noreferrer&quot;&gt;the Rosetta Code site&lt;/a&gt;, I can't help but think that all the code is just so long-winded, inefficient and ...well, readable. Something needs to be done.&lt;/p&gt;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Choose a language, then write a function that takes the example source code, in the &lt;em&gt;same&lt;/em&gt; language, for specific tasks on Rosetta Code and returns a golfed version of that code.&lt;/p&gt;&#xA;&lt;p&gt;Winner is the person who can golf the example tasks the most. However, this is a code golf challenge so the length of your own source matters too.&lt;/p&gt;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Write a function in your chosen language that takes a string as input and returns a string as output (or equivalent - reading/writing to stdio or file, etc is also ok)&lt;/li&gt;&#xA;&lt;li&gt;Input is the source code implementation, in your chosen language, of the following three specific tasks as shown on Rosetta Code (your function runs three times, once for each):&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://rosettacode.org/wiki/Sorting_algorithms/Quicksort&quot; rel=&quot;nofollow noreferrer&quot;&gt;Quicksort&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://rosettacode.org/wiki/Happy_numbers&quot; rel=&quot;nofollow noreferrer&quot;&gt;Happy numbers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://rosettacode.org/wiki/Greatest_common_divisor&quot; rel=&quot;nofollow noreferrer&quot;&gt;Greatest common divisor&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Output is a code golfed version of the input with identical functionality (again in the same language)&lt;/li&gt;&#xA;&lt;li&gt;If there is more than one implementation of a task for a specific language, you must use the first listed&lt;/li&gt;&#xA;&lt;li&gt;If your chosen language doesn't have an implementation for one of the tasks, then you need to add it yourself (following the Rosetta Code rules - don't go messing up their site just to get a better score here)&lt;/li&gt;&#xA;&lt;li&gt;With the exception of the rule above, you may not, in any way, modify the content or order of examples on Rosetta Code&lt;/li&gt;&#xA;&lt;li&gt;You must leave the logical flow of the algorithm mostly intact (eg. you can't simply replace the &lt;a href=&quot;http://rosettacode.org/wiki/Sorting_algorithms/Quicksort#J&quot; rel=&quot;nofollow noreferrer&quot;&gt;J quick sort code&lt;/a&gt; with &lt;code&gt;/:~&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;p&gt;Score for each individual task is calculated as the output character count as a percentage of the input character count. Implementation score for your own code is simply its character count. Total score for a submission is the sum of the three task scores, plus the implementation score.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Submission with the lowest score wins.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;So, assuming your function is &lt;strong&gt;100 chars&lt;/strong&gt; long and running it against the test tasks gives you the output counts shown, your overall score would be calculated as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; Task      | Input char count | Output char count | Score&#xA;-----------+------------------+-------------------+--------&#xA; Quicksort |            600   |            400    |  67%&#xA; Happy Nos |            400   |            200    |  50%&#xA; GCD       |            200   |            150    |  75%&#xA;--------------------------------------------------+--------&#xA; Implementation score:                            |  100&#xA;--------------------------------------------------+--------&#xA; Overall score:                                   |  292&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Things I'm not sure about...&lt;/h2&gt;&#xA;&lt;p&gt;Before I post this as a challenge, it would be good to get input on a few things:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Will the &amp;quot;if your language doesn't have an implementation&amp;quot; rule cause problems, or can people be trusted to provide sensible implementations that follow the intent of Rosetta Code and don't simply artificially improve their score on the challenge? Is it better just to deny entries from languages which don't already have implementations?&lt;/li&gt;&#xA;&lt;li&gt;With scoring, obviously it's a balancing act, a really terse language will likely get a solid &amp;quot;implementation&amp;quot; score, but should be less able to improve the length of the examples, whereas a verbose language will be the opposite. So, the having too few &amp;quot;tasks&amp;quot; included in the challenge will benefit terse languages, and too many will benefit verbose languages. I want to find a middle ground, so does three tasks seem reasonable?&lt;/li&gt;&#xA;&lt;li&gt;Will someone just find an edge case language which has a really easily golf-able Rosetta example, that will make it unbeatable?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="17365" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-06-09T11:23:39.053" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9336" PostTypeId="2" ParentId="8047" CreationDate="2016-06-09T06:59:28.223" Score="26" Body="&lt;h2&gt;Pointless links&lt;/h2&gt;&#xA;&lt;p&gt;Links pointing to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9336/45941&quot;&gt;relevant information&lt;/a&gt; that aid in understanding the challenge are good. Links that point to information that is &lt;a href=&quot;https://en.wikipedia.org/wiki/Duck&quot; rel=&quot;nofollow noreferrer&quot;&gt;common knowledge&lt;/a&gt; or &lt;a href=&quot;https://www.youtube.com/watch?v=dQw4w9WgXcQ&quot; rel=&quot;nofollow noreferrer&quot;&gt;irrelevant to the challenge&lt;/a&gt; are not. They &lt;a href=&quot;https://xkcd.com/214/&quot; rel=&quot;nofollow noreferrer&quot;&gt;distract the reader&lt;/a&gt;, and can lead to &lt;a href=&quot;http://www.xkcd.com/609/&quot; rel=&quot;nofollow noreferrer&quot;&gt;dozens of tabs being opened at once&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If a challenge is posted with useless links, edit them out. It doesn't actively harm the challenge in any way.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-06-10T06:40:04.223" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9338" PostTypeId="2" ParentId="6918" CreationDate="2016-06-09T11:27:31.573" Score="18" Body="&lt;h1&gt;Stack Cats&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Stack Cats was created by Sp3000 and myself, Martin Ender. The original idea is from November 2015, but the language design wasn't finalised and implemented until late May/early June 2016.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The language is a rather purist exploration of &lt;a href=&quot;https://en.wikipedia.org/wiki/Reversible_computing&quot; rel=&quot;nofollow&quot;&gt;reversible computing&lt;/a&gt; with a few extra twists. Any piece of code can be undone (provided it terminates) by mirroring it (which means reversing it and swapping out all brackets). This implies rather strict conditions on what operations are possible, and in fact almost every operation is in the language is an involution (i.e. a function which computes the identity when applied twice) and only three functions come in pairs (and these compute bijections).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, every program in Stack Cats has to be symmetric itself. This means that all  programs also compute involutions on the global memory state, and that every program is essentially a very simple involution transformed into some other memory state. Nevertheless, the language is Turing-complete.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/mbuettner/stackcats&quot; rel=&quot;nofollow&quot;&gt;&lt;strong&gt;GitHub repository&lt;/strong&gt;&lt;/a&gt;. Includes interpreter (Ruby), language specification, example programs and issue tracker.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://esolangs.org/wiki/Stack_Cats&quot; rel=&quot;nofollow&quot;&gt;&lt;strong&gt;Esolangs page&lt;/strong&gt;&lt;/a&gt;. Largely a copy of the README.md on GitHub. Also includes a sketch of a proof of Turing-completeness.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/Timwi/EsotericIDE&quot; rel=&quot;nofollow&quot;&gt;&lt;strong&gt;EsotericIDE&lt;/strong&gt;&lt;/a&gt;. Contains a C# interpreter and a debugger.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-06-09T11:27:31.573" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9339" PostTypeId="2" ParentId="2140" CreationDate="2016-06-09T12:10:19.747" Score="0" Body="&lt;h1&gt;Golf a golf-scoring program! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a space delimited array of integers, find the smallest number. It's that simple.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;&#xA;[Meta] This may in fact be a duplicate. Please tell me if so.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2016-06-09T12:10:19.747" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9343" PostTypeId="1" CreationDate="2016-06-09T14:32:49.253" Score="-8" ViewCount="154" Body="&lt;p&gt;I would like to propose a new synonym: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt;. &#xA;It should be merged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; to avoid confusion errors. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not allowed to create this by myself because the difference is the dash only, so I raise it on Meta. I'm not sure if this is the right place to propose for tags.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="12012" LastEditDate="2016-06-10T00:14:43.620" LastActivityDate="2016-06-10T00:14:43.620" Title="Make [codegolf] a synonym for [code-golf]" Tags="|feature-request|status-declined|tags|" AnswerCount="1" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="9344" PostTypeId="2" ParentId="9343" CreationDate="2016-06-09T22:43:43.300" Score="6" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;to avoid confusion errors&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I'm not allowed to create this by myself because the difference is the dash only&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Looks like the system is doing its job. Specifically, the message you should be getting is&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;You are attempting to create the tag [codegolf]; however the tag [code-golf] already exists!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't see any potential for confusion there.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Synonyms are created when two tags are being used for the same purpose, making searching, categorization, etc. difficult. Since [codegolf] cannot even be created, adding a synonym would be pointless.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2016-06-09T22:43:43.300" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9345" PostTypeId="2" ParentId="2140" CreationDate="2016-06-10T13:52:49.357" Score="0" Body="&lt;h1&gt;Distance between two words&lt;/h1&gt;&#xA;&lt;p&gt;You are given an input of two strings consisting entirely of letter characters. The &amp;quot;distance&amp;quot; between two such strings is the number of operations from the following list that it takes in order to transform one word into the other:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Adding a letter anywhere&lt;/li&gt;&#xA;&lt;li&gt;Removing a letter anywhere&lt;/li&gt;&#xA;&lt;li&gt;Changing a letter's case&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Since your boss wants to avoid wear on the office keyboards as much as possible, you have to write a very short program to determine the distance between words so you can fix the typos.&lt;/p&gt;&#xA;" OwnerUserId="49583" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-06-10T13:52:49.357" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9346" PostTypeId="1" AcceptedAnswerId="9347" CreationDate="2016-06-10T14:28:20.337" Score="4" ViewCount="106" Body="&lt;p&gt;If you still don't know this, you can create an inline version of the code block, by using backticks (`), it's a great thing if you want to post golf ideas in the comments, but this is also one of it's flaw.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Javascript is a pretty popular golfing language on this site, multiple people use it (for example Neil or Conor O' Brien). There's a feature in javascript ES6, wich allows you to leave out parentheses on the functions, wich take in a string as a parameter by doing:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;functionName`String comes here`&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The back tick also allows you, to use literal new lines, instead of \n-s.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem with this though, that whenever we want to post a new better golfed code in the comments, the back ticks of the program interfere with the in-line code blocks, creating something like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Array(100).fill&lt;/code&gt;abc&lt;code&gt;.join&lt;/code&gt;|``&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(This is a worst case example)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't want to change the markup for the in-line code-block, I only want to have an alternative for it. &lt;/p&gt;&#xA;" OwnerUserId="49709" LastEditorUserId="68942" LastEditDate="2021-06-09T05:42:59.427" LastActivityDate="2021-06-09T05:42:59.427" Title="In-line code block" Tags="|feature-request|status-declined|comments|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9347" PostTypeId="2" ParentId="9346" CreationDate="2016-06-10T14:32:33.123" Score="7" Body="&lt;p&gt;Comment markdown allows you to escape backticks in inline code. So,&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;`Array(100).fill\`abc\`.join\`|\``&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;results in&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Array(100).fill`abc`.join`|`&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2016-06-10T14:32:33.123" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9348" PostTypeId="2" ParentId="2140" CreationDate="2016-06-10T16:39:55.223" Score="0" Body="&lt;h1&gt;Cross Validated&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(This challenge is almost complete, but something doesn't feel quite right)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Continuing the theme of using &lt;a href=&quot;https://codegolf.stackexchange.com/questions/81167/stack-overflowing/&quot;&gt;site names&lt;/a&gt; as challenges...&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Your task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that accepts a string, and prints out the location, size, and validity of each cross in the string.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Definitions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Valid Cross- A cross where all four spokes of the cross are equal in length. The size of the cross is the number of segments of each cross. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Valid, size 0:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Valid, size 3:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   |&#xA;   |&#xA;   |&#xA;---+---&#xA;   |&#xA;   |&#xA;   |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Invalid cross- A cross where one or more spoke is a different length. The size is the number of segments of the &lt;strong&gt;longest&lt;/strong&gt; spoke.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Invalid, size 2:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; |&#xA; |&#xA;-+--&#xA; |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Invalid, size 6:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+------&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each input will have one or more crosses.&lt;/li&gt;&#xA;&lt;li&gt;The program should print out the location of the center of each cross. The location is zero-indexed and measured in characters/lines from the top left.&lt;/li&gt;&#xA;&lt;li&gt;The size and validity, as defined above, of each cross should be printed out.&lt;/li&gt;&#xA;&lt;li&gt;Each test case must pass without printing to STDERR.&lt;/li&gt;&#xA;&lt;li&gt;Crosses will not overlap&lt;/li&gt;&#xA;&lt;li&gt;Your program can take input via a string (with line breaks), an array of strings (each representing a line), or a 2d array of characters.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest program, in bytes, wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+ +-&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(0,0) size 0, valid&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(2,0) size 1, invalid&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   |&#xA;   |     |&#xA;   |     |&#xA;---+---  |&#xA;   |     |&#xA;   |  ---+&#xA;   |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(3,3) size 3, valid&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(9,5) size 4, invalid&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(empty test case)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(must not crash or print to STDERR)&lt;/p&gt;&#xA;" OwnerUserId="41505" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:26.977" LastActivityDate="2016-06-10T16:39:55.223" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9349" PostTypeId="2" ParentId="6918" CreationDate="2016-06-10T17:39:16.363" Score="4" Body="&lt;h2&gt;&lt;a href=&quot;https://github.com/theksp25/INTERCALL&quot; rel=&quot;nofollow&quot;&gt;INTERCALL&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I have created INTERCALL in june 2016.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Intercall is a anti-golfing language. Each code must start with a 116 character long header, to prevent code golfing.&#xA;The header is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;INTERCALL IS A ANTIGOLFING LANGUAGE&#xA;SO THIS HEADER IS HERE TO PREVENT GOLFING IN INTERCALL&#xA;THE PROGRAM STARTS HERE:&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Example code (Without the header):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;QUINE&#xA;END&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Is just a quine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &quot;Hello, World!&quot; program can be found &lt;a href=&quot;https://raw.githubusercontent.com/theksp25/INTERCALL/master/INTERCALL/INTERCALL/helloworld.itc&quot; rel=&quot;nofollow&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="53745" LastActivityDate="2016-06-10T17:39:16.363" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9353" PostTypeId="1" CreationDate="2016-06-12T02:45:12.123" Score="6" ViewCount="194" Body="&lt;p&gt;We haven't reached a complete consensus on whether or not &lt;code&gt;Ans&lt;/code&gt; is permitted as a valid input format for TI-BASIC.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods/8580#8580&quot;&gt;this answer&lt;/a&gt; on &quot;Default for Code Golf: Input/Output methods&quot; with a slim majority support for its use, but I recently posted an answer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/82604/approximation-of-e&quot;&gt;Approximation of e&lt;/a&gt; which used &lt;code&gt;Ans&lt;/code&gt; as input, receiving a large amount of dispute over the matter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The previous meta post answer also cites &lt;a href=&quot;https://codegolf.stackexchange.com/questions/73920/golf-the-x%E1%B5%97%CA%B0-root-of-x/73977#73977&quot;&gt;another TI answer&lt;/a&gt; using &lt;code&gt;Ans&lt;/code&gt; that was questioned heavily. Though that should prohibit the use of &lt;code&gt;Ans&lt;/code&gt;, some have stated that &lt;code&gt;Ans&lt;/code&gt; has historically been used without issue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So is &lt;code&gt;Ans&lt;/code&gt; permitted as a valid form of input, or not?&lt;/p&gt;&#xA;" OwnerUserId="51538" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-06-14T17:48:24.773" Title="Is Ans considered a valid form of input for TI-BASIC?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ClosedDate="2016-06-14T18:46:05.897" ContentLicense="CC BY-SA 3.0" />
  <row Id="9354" PostTypeId="2" ParentId="2140" CreationDate="2016-06-12T14:57:45.640" Score="1" Body="&lt;h1&gt;Implement this cipher&lt;/h1&gt;&#xA;&lt;p&gt;(I'm not sure what to call this cipher)&lt;/p&gt;&#xA;&lt;h2&gt;Goal&lt;/h2&gt;&#xA;&lt;p&gt;Use the algorithm (explained in the Algorithm section) to implement a certain cipher.&lt;/p&gt;&#xA;&lt;p&gt;The program must read input from STDIN or the closest available equivalent, use the algorithm to generate the ciphertext and a key.&lt;/p&gt;&#xA;&lt;p&gt;The ciphertext and the key will be written to STDOUT or the closest available equivalent, preferably with the format &lt;code&gt;(ciphertext)\n(key)&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Algorithm&lt;/h2&gt;&#xA;&lt;p&gt;Convert the characters in the string into the respective ASCII values. For example:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;Hello -&amp;gt; 72 101 108 108 111&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Next, you will need to generate a key as long as the string with random numbers in the range of 0-9.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;Hello -&amp;gt; 62841&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Add the integers in the random number sequence to the ASCII values of the string. In the above examples, 72 would become 78, and 101 would become 104.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;72 + 6 = 78, 101 + 2 = 104, 108 + 8 = 116, etc&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Next, convert the new ASCII values back to characters. In the above examples, the text &lt;code&gt;Hello&lt;/code&gt; has become &lt;code&gt;Nhttp&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;(These are simply examples of what the output &lt;em&gt;might&lt;/em&gt; look like. The output can and will vary.)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Hello, World!&#xA;&#xA;Hgqqu/$\\p{ni$&#xA;0255634519253&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;This will be encoded&#xA;    &#xA;Zhjs$~koo gj$iuhofgj&#xA;60104723305544750226&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Submissions must be full programs.&lt;/li&gt;&#xA;&lt;li&gt;Languages newer than the challenge are allowed.&lt;/li&gt;&#xA;&lt;li&gt;Submissions will be scored in bytes.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is code-golf, so the shortest code wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I'm sure this challenge needs a little tidying up and making it look and sound a bit nicer. I'm not very good at writing challenges, so I'd like some advice.&lt;/p&gt;&#xA;" OwnerUserId="45571" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-06-12T16:15:18.263" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9356" PostTypeId="2" ParentId="2140" CreationDate="2016-06-12T21:41:58.343" Score="-5" Body="&lt;h1&gt;Calculate Hello World!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hello-world&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hello-world&amp;#39;&quot; rel=&quot;tag&quot;&gt;hello-world&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your goal is to calculate the simple string &quot;hello world&quot; or any other variant.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may not use the characters in this set (inside your code): &lt;code&gt;hHeElLoOwW rRdD!&lt;/code&gt;, in &lt;strong&gt;any form&lt;/strong&gt; (character codes, hex codes, etc. not allowed) [only applies for direct use].&lt;/li&gt;&#xA;&lt;li&gt;Your program may not take any input from any source.&lt;/li&gt;&#xA;&lt;li&gt;Your program may only print &lt;code&gt;hello world&lt;/code&gt; or any other variant to standard output (for your language). Again, it may &lt;strong&gt;not print anything else&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply (to clarify, they are &lt;strong&gt;not forbidden&lt;/strong&gt;).&lt;/li&gt;&#xA;&lt;li&gt;This challenge is underhanded.&lt;/li&gt;&#xA;&lt;li&gt;Your program may not use any built-in string of printable characters (for example, &lt;code&gt;string.printable&lt;/code&gt; in Python).&lt;/li&gt;&#xA;&lt;li&gt;I recommend you be creative.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Remember, this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;! Have fun!&lt;/p&gt;&#xA;" OwnerDisplayName="user36215" LastEditorDisplayName="user36215" LastEditDate="2016-06-12T21:54:19.710" LastActivityDate="2016-06-12T21:54:19.710" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9359" PostTypeId="1" CreationDate="2016-06-13T20:18:05.487" Score="0" ViewCount="40" Body="&lt;p&gt;I propose that we change &quot;question&quot; to &quot;challenge&quot;. So instead of &quot;Ask Question&quot; it'd be &quot;Create Challenge&quot;.&lt;/p&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2016-06-13T20:18:05.487" Title="Terminology question -&gt; challenge" Tags="|discussion|" AnswerCount="0" CommentCount="0" ClosedDate="2016-06-13T20:39:46.273" ContentLicense="CC BY-SA 3.0" />
  <row Id="9361" PostTypeId="1" AcceptedAnswerId="9465" CreationDate="2016-06-14T01:29:54.353" Score="25" ViewCount="335" Body="&lt;p&gt;Over 3 months ago, on February 23, 2016, it was announced that this SE site &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8538/congratulations-youre-graduating&quot;&gt;was graduating&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That post said that&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;You will soon be able to select your own community ads. Give me a moment to set these up later this week.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The ads were not set up that week and still haven't been.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Last week our mod Alex updated us with the &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/30174007#30174007&quot;&gt;chat message&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Graduation perks update: Community ads were inadvertently overlooked and the CMs will get on that soon. Our site-specific text is under review and we'll get a design once we get updated text.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So presumably our community ads are just around the corner, but given that we've waited 3 months longer that we were originally supposed to, and that our graduation process has had other delays and snafus, I'd like to make sure.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When is Programming Puzzles &amp;amp; Code Golf getting community ads?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;June 20th Update:&lt;/strong&gt; It's being &lt;a href=&quot;http://chat.meta.stackexchange.com/transcript/message/5019879#5019879&quot;&gt;looked into&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-06-29T16:33:09.867" Title="When is Programming Puzzles &amp; Code Golf getting community ads?" Tags="|support|status-completed|graduation|advertising|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9363" PostTypeId="1" AcceptedAnswerId="9372" CreationDate="2016-06-14T11:47:33.017" Score="18" ViewCount="409" Body="&lt;p&gt;There's a popular type of maths puzzle where you get a list of digits (or numbers in general) and need to insert arithmetic operators in order to reach some target number. &lt;em&gt;Every single time&lt;/em&gt; we get a challenge around this topic, I think &quot;this looks so familiar, we must've done this before&quot;, but then I always fail to find a dupe target, because these challenges are near impossible to search for. The keywords that come to mind are things like &quot;expression&quot;, &quot;equation&quot;, &quot;operator&quot;, &quot;operation&quot;, &quot;insert&quot;, &quot;arithmetic&quot;, &quot;Countdown&quot;, &quot;Lettres et chiffres&quot;, etc. But these are all so horribly general that they turn up way more false positives than the actual challenges you're looking for. And then there's the problem that everyone seems to describe the problem differently, so you're probably overlooking some challenges all together.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But that's what tags are for. They group related challenges. If we introduced a tag for this, that would make it a lot easier for the experienced users to find existing challenges around this topic in order to look for duplicates. Of course it would also help people find similar (non-dupe) challenges similar to the one they've just solved, if they liked it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So there's two things to this: a) coming up with a good tag name, b) finding all the relevant challenges so we can tag them. I've done some hunting just now, mostly via linked challenges and a few lucky keywords and here's what I dug up:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/1328/obtain-a-number-from-4-numbers-using-any-combination-of-mathematical-operations&quot;&gt;Obtain a number from 4 numbers using any combination of mathematical operations&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/6417/generate-a-valid-equation-using-user-specified-numbers&quot;&gt;Generate a valid equation using user-specified numbers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/12063/four-fours-puzzle&quot;&gt;Four fours puzzle&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/32085/generate-all-possible-integers&quot;&gt;Generate all possible integers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/38032/it-s-time-to-do-the-math&quot;&gt;It’s time to do the math&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/48917/two-zero-one-five-puzzle&quot;&gt;Two-zero-one-five puzzle&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/54370/arithmetic-tock-tick-tock&quot;&gt;Arithmetic... tock... tick... tock&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/63539/make-a-math-equation-from-the-date&quot;&gt;Make a math equation from the date&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/82884/find-operations-required-to-get-result&quot;&gt;Find operations required to get result&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There are also a few challenges where I'm not 100% sure whether they should be covered by the tag or not, but they're definitely closely related:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/6426/generate-a-valid-equation-using-specified-operators&quot;&gt;generate a valid equation using specified operators&lt;/a&gt; asks you to insert the numbers given the operators. Still, this is about constructing an expression under some constraints which evaluates to a given result.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/112439/8478&quot;&gt;Solve an equation with (almost) any numbers you like&lt;/a&gt; same here.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/32527/longest-mathematical-expression-in-a-grid&quot;&gt;Longest mathematical expression in a grid&lt;/a&gt; is closer to the problems above except that you are much more flexible in which numbers you use to construct the equation.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And then there's (at least) two challenges where you don't generate an expression given a list of digits, but instead you need to write a &lt;em&gt;program&lt;/em&gt; which contains the digits in the given order and prints some result:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/68666/10-9-8-7-6-5-4-3-2-1-print-2016&quot;&gt;10 9 8 7 6 5 4 3 2 1... Print 2016&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/70361/official-dyalog-apl-2016-year-game&quot;&gt;Official Dyalog APL 2016 Year Game&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;These are definitely a bit different, but I feel like they're still in the same spirit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As Mitch Schwartz pointed out in chat, certain metagolf challenges are also closely related. For example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/76591/express-a-number-with-only-0-9-and-the-four-operations&quot;&gt;Express a number with only 0-9 and the four operations&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/77956/quickly-express-a-number-with-only-0-9-and-the-four-operations-plus-one-more-ex&quot;&gt;Quickly express a number with only 0-9 and the four operations, plus one more extra&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So, please let me know what you think about the utility of such a tag, what such a tag should cover, whether I've overlooked any challenges and of course any suggestions for a tag name.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2017-03-09T19:33:28.243" Title="We need a tag for &quot;arithmetic expression building&quot; challenges" Tags="|discussion|tags|" AnswerCount="3" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="9364" PostTypeId="2" ParentId="9363" CreationDate="2016-06-14T15:38:38.513" Score="6" Body="&lt;p&gt;On Puzzling.SE, we use the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/formation-of-numbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;formation-of-numbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;formation-of-numbers&lt;/a&gt; for this purpose.&lt;/p&gt;&#xA;" OwnerUserId="7110" LastActivityDate="2016-06-14T15:38:38.513" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9365" PostTypeId="2" ParentId="9363" CreationDate="2016-06-14T15:42:31.710" Score="-1" Body="&lt;p&gt;I think &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic-expression-building-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic-expression-building-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic-expression-building-challenge&lt;/a&gt; would be a pretty good choice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On a more serious note, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic-permutation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic-permutation&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic-permutation&lt;/a&gt; would be good.&lt;/p&gt;&#xA;" OwnerUserId="49709" LastEditorUserId="49709" LastEditDate="2016-06-14T15:57:41.967" LastActivityDate="2016-06-14T15:57:41.967" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9366" PostTypeId="1" AcceptedAnswerId="9370" CreationDate="2016-06-14T15:59:31.367" Score="0" ViewCount="89" Body="&lt;p&gt;Title says it all. I just reviewed &lt;em&gt;3&lt;/em&gt; items that already had a &quot;Welcome to PPCG&quot; comment. Since 2 different people had reviewed them, I assumed that they hadn't forgot to click, &quot;I'm done&quot;. &lt;a href=&quot;https://i.stack.imgur.com/aw0Vg.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/aw0Vg.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="48922" LastEditorUserId="68942" LastEditDate="2021-06-05T23:19:03.377" LastActivityDate="2021-06-05T23:19:03.377" Title="Three 'First Post' reviews already reviewed" Tags="|bug|status-bydesign|reviewing|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9367" PostTypeId="2" ParentId="9353" CreationDate="2016-06-14T17:28:39.130" Score="4" Body="&lt;h1&gt;Yes, it is a valid form of input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;While TI-BASIC does not come with any sort of function, they can be faked. I use this approach often when making a program that is repeated multiple times by a parent program. By using the value of &lt;code&gt;Ans&lt;/code&gt;, one can transform &lt;code&gt;Ans&lt;/code&gt; into another value and leave it as &lt;code&gt;Ans&lt;/code&gt;. Say we wanted to write a &quot;function&quot; that takes the sign of the number (not golfing, here)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;PRGM:SGN&#xA;Ans→A&#xA;If A&amp;lt;0:-1&#xA;If A=0:0&#xA;If A&amp;gt;0:1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then, from a parent program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;PRGM:PARENT&#xA;ClrHome&#xA;Input &quot;NUMBER=&quot;,B&#xA;B:prgmSGN&#xA;Output(2,1,&quot;Sign of B=&#xA;Output(2,11,Ans&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As such, it is often more &lt;em&gt;useful&lt;/em&gt; to other programs to take input in the form of &lt;code&gt;Ans&lt;/code&gt;. While it is not a true function, it is the closest TI-BASIC can get. Therefore, being a &quot;function&quot;, &lt;code&gt;Ans&lt;/code&gt; should be valid input.&lt;/p&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2016-06-14T17:28:39.130" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9368" PostTypeId="2" ParentId="9346" CreationDate="2016-06-14T17:29:37.047" Score="0" Body="&lt;p&gt;Markdown allows multiple &lt;code&gt;`&lt;/code&gt; to be used for inline code. It also trims spaces at the end. So&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;``` Array(100).fill`abc`.join`` ```&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;becomes &lt;code&gt;Array(100).fill`abc`.join``&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="32091" LastActivityDate="2016-06-14T17:29:37.047" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9370" PostTypeId="2" ParentId="9366" CreationDate="2016-06-14T18:43:06.583" Score="3" Body="&lt;p&gt;First of all, you don't have to &lt;em&gt;assume&lt;/em&gt; anything. As soon as you get the privilege of reviewing posts in a specific queue, you can switch to the &lt;strong&gt;history&lt;/strong&gt; tab to see which actions have been taken by whom. For first posts, the history can be found &lt;a href=&quot;https://codegolf.stackexchange.com/review/first-posts/history&quot; title=&quot;Review History - First Posts - Programming Puzzles &amp;amp; Code Golf Stack Exchange&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this history, if you click on the action that has been taken, you're lead to the review task for that specific post. That information is completely public, as long as you have a direct link. For the post from the screenshot, you can find its review &lt;a href=&quot;https://codegolf.stackexchange.com/review/first-posts/31019&quot; title=&quot;Review First Posts - Programming Puzzles &amp;amp; Code Golf Stack Exchange&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As you can see, only one user (you) has reviewed the post, which completed the review task and thus removed the post from the review queue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While it is &lt;em&gt;possible&lt;/em&gt; that there is a bug that doesn't record all reviews, I think it's far more likely that the commenters either forgot to click &lt;strong&gt;I'm done&lt;/strong&gt; (still unlikely) or that they simply found the answers while browsing PPCG and didn't use the review system at all.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-06-14T18:43:06.583" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9371" PostTypeId="1" AcceptedAnswerId="9373" CreationDate="2016-06-14T18:44:31.177" Score="2" ViewCount="113" Body="&lt;p&gt;After seeing that &lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits/31010&quot;&gt;this edit suggestion&lt;/a&gt; got rejected because it &quot;deviates from the original intent of the post&quot;, I realized that I have no idea why or how an edit could change the sense a post makes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What causes edits to do so on PPCG?&lt;/p&gt;&#xA;" OwnerUserId="53917" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-06-16T15:25:26.047" Title="What causes an edit to deviate from the original intent of the post?" Tags="|discussion|support|editing|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9372" PostTypeId="2" ParentId="9363" CreationDate="2016-06-14T21:00:40.087" Score="13" Body="&lt;p&gt;I think having a tag for this is a good idea. The other solutions are great, but I'm going to throw out another one: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/expression-building&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;expression-building&amp;#39;&quot; rel=&quot;tag&quot;&gt;expression-building&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Edit&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This seems to be the most popular solution, so I went ahead and created this tag. I'm going to slowly edit it into the questions that Martin has linked (to avoid flooding the front-page).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/tags/expression-building/info&quot;&gt;tag wiki is here&lt;/a&gt;. Feel free to edit if you think you can improve clarity on it.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2017-03-09T19:33:28.243" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9373" PostTypeId="2" ParentId="9371" CreationDate="2016-06-14T23:49:13.130" Score="3" Body="&lt;p&gt;What Timmy said in his comment is exactly right:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;this edit should be rejected since we're not sure &lt;em&gt;exactly&lt;/em&gt; what the original intent was.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I can't speak for the other user who voted to reject the edit, but that's why I rejected it. This was a fairly drastic change to the post (including the voice in which the task is described) and since the post wasn't entirely clear in its intent, it wouldn't be appropriate to modify it in this way; it should be the job of the challenge author to clarify their own intent, particularly when the information they're providing in comments contradicts what's currently in the post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In general, edits to questions are appropriate if they clarify wording without making assumptions about the OP's intent or if they greatly enhance readability through formatting improvements.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="20469" LastEditDate="2016-06-16T15:25:26.047" LastActivityDate="2016-06-16T15:25:26.047" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9374" PostTypeId="2" ParentId="2140" CreationDate="2016-06-15T09:17:44.957" Score="4" Body="&lt;h2&gt;Golf all the 16 logic gates with 2 inputs and 1 output!&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/82938/golf-all-the-16-logic-gates-with-2-inputs-and-1-output&quot;&gt;This question&lt;/a&gt; asked for 16 independent functions. I would like the opposite: a single function that takes an additional parameter that specifies which of the 16 logic gates is required using an integer from 0 to 15. If you don't want to use a 0-based index of the list in the linked question then you should specify which integers map to which logic gate (but they should still be 0 to 15).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 0,0,0  falsey&#xA; 1,0,1  falsey&#xA; 2,1,0  truthy&#xA; 3,1,1  truthy&#xA; 4,1,1  falsey&#xA; 5,0,1  truthy&#xA; 6,1,0  truthy&#xA; 7,0,0  falsey&#xA; 8,0,0  truthy&#xA; 9,0,1  falsey&#xA;10,1,0  truthy&#xA;11,1,1  truthy&#xA;12,1,1  falsey&#xA;13,0,1  truthy&#xA;14,1,0  truthy&#xA;15,0,0  truthy&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.947" LastActivityDate="2016-06-15T09:17:44.957" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9376" PostTypeId="2" ParentId="2140" CreationDate="2016-06-15T10:40:07.653" Score="3" Body="&lt;h1&gt;Primitive Pythagorean triples&lt;/h1&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Pythagorean_triple&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pythagorean triple&lt;/a&gt; is a tuple of three positive integers &lt;code&gt;a&lt;/code&gt;, &lt;code&gt;b&lt;/code&gt; and &lt;code&gt;c&lt;/code&gt; so that &lt;code&gt;a² + b² = c²&lt;/code&gt;. One example of that is &lt;code&gt;(3, 4, 5)&lt;/code&gt;.&lt;br /&gt;&#xA;One subset of those are primitive Pythagorean triples which require &lt;code&gt;a&lt;/code&gt;, &lt;code&gt;b&lt;/code&gt; and &lt;code&gt;c&lt;/code&gt; to also be &lt;a href=&quot;https://en.wikipedia.org/wiki/Coprime_integers&quot; rel=&quot;nofollow noreferrer&quot;&gt;coprimes&lt;/a&gt;, so their only common divisior is &lt;code&gt;1&lt;/code&gt;. One example is &lt;code&gt;(5, 12, 13)&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Given three numbers representing a triple, output a truthy value if there is a triple representation of them that form a primitive Pythagorean triple and a falsy value if not.&lt;/p&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;h3&gt;Truthy&lt;/h3&gt;&#xA;&lt;pre&gt;&#xA;Coming Soon&#xA;&lt;/pre&gt;&#xA;&lt;h2&gt;Falsy&lt;/h2&gt;&#xA;&lt;pre&gt;&#xA;Coming soon&#xA;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;TODO&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What about zero as input?&lt;/li&gt;&#xA;&lt;li&gt;Test cases&lt;/li&gt;&#xA;&lt;li&gt;Example for the different triple configurations?&lt;/li&gt;&#xA;&lt;li&gt;What about builtins?&lt;/li&gt;&#xA;&lt;li&gt;More descriptive title&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49110" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-06-15T10:58:20.343" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9377" PostTypeId="2" ParentId="2140" CreationDate="2016-06-15T12:20:57.120" Score="1" Body="&lt;h1&gt;Latin vs Greek vs Cyrillic / Battle of the Alphabets&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/classification&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;classification&amp;#39;&quot; rel=&quot;tag&quot;&gt;classification&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pattern-recognition&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pattern-recognition&amp;#39;&quot; rel=&quot;tag&quot;&gt;pattern-recognition&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;Meta:&lt;/strong&gt; This is just a rough draft, the challenge is still under development, feel free to add suggestions as comments or via chat pinging @flawr&lt;/p&gt;&#xA;&lt;p&gt;Points that are unclear so far:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is there one fixed typeface for all three?&lt;/li&gt;&#xA;&lt;li&gt;Will the image always be provided in the exact horizontal orientation?&lt;/li&gt;&#xA;&lt;li&gt;How long will the provided text be, just single words? A single line? A multiline piece of text?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;These three alphabets are relatively similar and even have some letters in common, but also a lot of distinct letters. In this challenge, you have to write a classifier that can distinguish these three alphabets, when presented with a raster image of a corresponding text.&lt;/p&gt;&#xA;&lt;p&gt;This is an image from Wikipedia that shows the differences in the capital letters:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/VzDis.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/VzDis.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This challenge was inspired by &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/30367326#30367326&quot;&gt;this message.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-06-15T15:40:43.550" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9381" PostTypeId="2" ParentId="2140" CreationDate="2016-06-16T07:39:39.560" Score="-3" Body="&lt;h2&gt;&quot;01_firstHole&quot; Challenge for Performance Golf&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;First there was code golf.  Now, there is Performance Golf.  FORE!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Motivations&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a crowd-sourced approach to easier and better performance troubleshooting.  Performance problems are everywhere, so java technicians need access to easy-to-use diagnostic tools at every step of the SDLC.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;How to play?&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Start by &lt;a href=&quot;https://github.com/eostermueller/performanceGolf/wiki/Install-and-Run&quot; rel=&quot;nofollow&quot;&gt;installing&lt;/a&gt; the live demonstrations of Java Performance Problems in this repo.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Pick one of the six holes of golf to play.  You can do this by picking one of the six numbered folders in the repo.  This particular codegolf.stackexchange.com challenge is for the &lt;code&gt;01_firstHole&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;One at a time, run the 'a' load test and the 'b' load test for the hole you selected.  The a &amp;amp; b tests are two different implementations of the same REST/SOA service.  See the 'installing' link, above, for how to run the tests.  &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Compare the performance of the two tests, a &amp;amp; b.  Which has better response time / throughput?  &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Using the least amount of tooling/instrumentation, identify the performance problem of the slower test.  Hook it up your self and run the tests.  &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;At &lt;code&gt;codegolf.stackexchange.com&lt;/code&gt;, there is one &quot;Stack Exchange Challenge&quot; for each hole of golf.  Post the following two things for your solution to that challenge:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Post a description of the tools/techniques you used to detect the performance problem. Must be detailed enough so that others can reproduce your work. Performance golf always compares two different loads -- a &amp;amp; b. The solution must identify the inefficient code in the slower of the two examples. It must also show the absence of that inefficient processing in the faster of the two examples.&lt;/li&gt;&#xA;&lt;li&gt;Tally the number of strokes for your approach, using the &quot;Scorecard&quot; below.  All solutions must specify the # of strokes incurred, and it must be specified in the answer heading/title.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Upvote the solutions that best identify the performance problem &lt;strong&gt;and&lt;/strong&gt; have the fewest strokes (see Scorecard, below).  Similar solutions on different platforms (Mac/Linux/MS-Win) deserve roughly the same number of upvotes.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Scorecard&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This scorecard determines the approach with the least amount of tooling/instrumentation.  Lowest score wins!  &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1 stroke if JVM restart is required to hook up your monitoring tool of choice.&lt;/li&gt;&#xA;&lt;li&gt;1 stroke for any tool with any $$ licensing cost.&lt;/li&gt;&#xA;&lt;li&gt;1 stroke for every separate install process. No strokes for JVM and pre-installed OS tools. &lt;/li&gt;&#xA;&lt;li&gt;1 stroke for tools/techniques specific to a particular Database vendor.  Ex: Oracle AWR report.  Even ‘EXPLAIN PLAN’ solutions are proprietary.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example One -- zero strokes :-D&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This example does not use this github repo, but it will give you the general idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.nurkiewicz.com/2012/08/which-java-thread-consumes-my-cpu.html&quot; rel=&quot;nofollow&quot;&gt;This solution&lt;/a&gt;  to solving a high CPU problem would get lowest=best instrumentatin score:  zero strokes.  Only JVM and OS tools are used (thread dump and top -H).  There are no tool license costs and a JVM restart was not required for the thread dump.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example Two -- 3 strokes :-(&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This example also does not use this github repo, but it will give you the general idea of what we mean by the best troubleshooting with the least tooling/instrumentation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A modern, commercial profiler (YourKit, JProfiler, etc...) would easily solve the high CPU problem in example 1.  But look how many strokes (1+1+1=4!) are taken off with this approach:&#xA;  * 1 stroke because a JVM restart is required to hook up the tool&#xA;  * 1 stroke because there are licensing costs.&#xA;  * 1 stroke to install profiling the tool&lt;/p&gt;&#xA;" OwnerUserId="55455" LastEditorUserId="55455" LastEditDate="2016-06-18T21:26:05.190" LastActivityDate="2016-06-18T21:26:05.190" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9382" PostTypeId="2" ParentId="2140" CreationDate="2016-06-16T07:46:14.890" Score="0" Body="&lt;h2&gt;This question isn't fair.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I want you to tell me the chances of flipping an coin &lt;code&gt;n&lt;/code&gt; times and ending up on &lt;em&gt;tails&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Naturally this isn't a fair coin. In fact, it isn't even a standard unfair coin, where the chance of flipping &lt;em&gt;tails&lt;/em&gt; is always &lt;code&gt;p&lt;/code&gt;. This is a &lt;em&gt;sticky&lt;/em&gt; coin, where the chance of the coin staying the same is &lt;code&gt;p&lt;/code&gt;; the coin is fair at other times.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The coin starts off &lt;em&gt;heads&lt;/em&gt;, so when &lt;code&gt;n&lt;/code&gt; is 0 or &lt;code&gt;p&lt;/code&gt; is 1 then the answer is always 0.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program or function should be capable of calculating the result to at least six significant digits.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2016-06-16T07:46:14.890" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="9384" PostTypeId="2" ParentId="8047" CreationDate="2016-06-16T11:21:43.553" Score="35" Body="&lt;h2&gt;Adding unnecessary fluff&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;See also: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8214/21487&quot;&gt;Chameleon challenges&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8077/21487&quot;&gt;Cumbersome I/O formats&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8079/21487&quot;&gt;Do X without Y&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What's the main point of the challenge? Try to keep the challenge to just that. Don't go adding frills to the challenge just because it &quot;looks too easy&quot;, or inserting strange modifications to a perfectly okay challenge just to &quot;make things interesting&quot;. Keep it lean and straight to the point.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition to the related posts above, here are more examples of what not to do (when there's no good alternative approaches):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Combining two or more unrelated core challenges into one — consider splitting the challenge up into separate challenges or dropping unnecessary parts. Examples include:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Instead of simply summing a list of numbers &lt;code&gt;n&lt;/code&gt; at the end, requiring answers to sum over some unnecessary transformation (e.g.&lt;code&gt;n^2&lt;/code&gt;, &lt;code&gt;n+1&lt;/code&gt;, &lt;code&gt;n&lt;/code&gt;th Fibonacci number) instead.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Instead of simply applying a function &lt;code&gt;f(x)&lt;/code&gt; to a list of inputs, adding an unnecessary filtering step before the function is applied (e.g. median of only the prime numbers in the input).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Unnecessary extra applications, e.g. instead of calculating a single function &lt;code&gt;f(x)&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Making answers calculate &lt;code&gt;f(x)&lt;/code&gt; for every &lt;code&gt;x&lt;/code&gt; in a list.&lt;/li&gt;&#xA;&lt;li&gt;Making answers take an additional parameter &lt;code&gt;n&lt;/code&gt; and applying &lt;code&gt;f&lt;/code&gt; to the input &lt;code&gt;x&lt;/code&gt;, &lt;code&gt;n&lt;/code&gt; times.&lt;/li&gt;&#xA;&lt;li&gt;Making answers calculate &lt;code&gt;x-f(x)&lt;/code&gt; until the result is 1, then counting how many steps that took.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="21487" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-06-16T11:21:43.553" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9388" PostTypeId="1" CreationDate="2016-06-17T13:39:08.890" Score="15" ViewCount="376" Body="&lt;p&gt;Previously:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8830/how-do-we-close-questions-without-an-objective-validity-criterion&quot;&gt;How do we close questions without an objective validity criterion?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8084/guidelines-for-posting-and-closing-popularity-contests&quot;&gt;Guidelines for posting and closing popularity contests&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8034/would-render-the-mona-lisa-in-1000-bytes-be-on-topic-here&quot;&gt;Would &amp;quot;render the Mona Lisa in 1000 bytes&amp;quot; be on topic here?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://chat.stackexchange.com/rooms/34229/discussion-on-answer-by-dennis-guidelines-for-posting-and-closing-popularity-con&quot;&gt;http://chat.stackexchange.com/rooms/34229/discussion-on-answer-by-dennis-guidelines-for-posting-and-closing-popularity-con&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;We, as a community, still seem to be very divided on the concept of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; challenges ... I'm &lt;em&gt;not&lt;/em&gt; speaking about PopCons in &lt;em&gt;general&lt;/em&gt;, just those that are specifically related to graphical output or artistic flair.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I had &lt;em&gt;thought&lt;/em&gt; that we had this sorted out a few months ago, and came to the conclusion that challenges need &lt;strong&gt;an objective validity criterion&lt;/strong&gt; in order to be allowed on this site -- that's where the &quot;Guidelines...&quot; Meta post linked above has, but unfortunately there's nothing close to consensus on that post, and most answers don't actually answer the question -- but given the reaction to Helka's recent &quot;Cracked Soil&quot; challenge, it seems that's not the case.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However ... just take a peek at the below ...&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Relevant challenges that were closed:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/69232/paint-the-mona-lisa-in-1kb-of-code&quot;&gt;https://codegolf.stackexchange.com/questions/69232/paint-the-mona-lisa-in-1kb-of-code&lt;/a&gt; (deleted question, so you'll need privileges)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/68636/make-the-pattern-from-composition-notebooks&quot;&gt;Make the pattern from composition notebooks&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/35569/tweetable-mathematical-art&quot;&gt;Tweetable Mathematical Art&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/73739/what-time-is-it-again&quot;&gt;What time is it again?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/45157/warhol-these-pictures&quot;&gt;Warhol these pictures&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Relevant challenges that were allowed:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/33172/american-gothic-in-the-palette-of-mona-lisa-rearrange-the-pixels&quot;&gt;American Gothic in the palette of Mona Lisa: Rearrange the pixels&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/83092/computer-generated-cracked-soil&quot;&gt;Computer Generated Cracked Soil&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/43274/computer-generated-textured-wall-paint&quot;&gt;Computer Generated Textured Wall Paint&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/22144/images-with-all-colors&quot;&gt;Images with all colors&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/35835/draw-random-black-and-white-forest&quot;&gt;Draw random black-and-white forest&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/39814/generate-realistic-maps&quot;&gt;Generate Realistic Maps&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/68845/paint-by-numbers-using-programming-not-numbers&quot;&gt;Paint by Numbers (using programming, not numbers)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/70483/patch-the-image&quot;&gt;Patch the Image&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/53621/force-an-average-on-an-image&quot;&gt;Force an Average on an Image&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/53015/ms-paint-is-underrated&quot;&gt;MS Paint is underrated&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Relevant challenges that were re-done to &lt;em&gt;not&lt;/em&gt; be a PopCon, after pushback from the community:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/69930/paint-starry-night-objectively-in-1kb-of-code&quot;&gt;Paint Starry Night, objectively, in 1kB of code&lt;/a&gt; (the resultant challenge after the Mona Lisa one, above, was closed)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Given all of the above, and the fact that this is still a very divisive topic, and the fact that we as site do &lt;em&gt;not&lt;/em&gt; like subjectiveness, the question I'm posting to Meta is this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What, definitively, constitutes an &lt;em&gt;objective validity criterion&lt;/em&gt; when formulating a &lt;em&gt;subjective artistic merit&lt;/em&gt; graphical-output popularity-contest challenge?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What, &lt;em&gt;specifically&lt;/em&gt;, needs to be included in the challenge for the challenge to be on topic?&lt;/h2&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-06-22T17:58:06.617" Title="PopCons and Graphical Output" Tags="|discussion|policy|popularity-contest|" AnswerCount="3" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="9389" PostTypeId="2" ParentId="9388" CreationDate="2016-06-17T16:29:48.480" Score="9" Body="&lt;h1&gt;Popcons have needed to be popular&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note:  This is simply my perspective on what has been happening, not what &lt;em&gt;should&lt;/em&gt; be happening&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;We have a challenge writer, &lt;a href=&quot;https://codegolf.stackexchange.com/users/26997/helka-homba&quot;&gt;Helka Homba&lt;/a&gt;, who is quite popular in our community.  He writes great challenges:  They are interesting &lt;em&gt;and&lt;/em&gt; easy to read.  His questions each get about 20 votes (rough guess), and lots of answers.&lt;/p&gt;&#xA;&lt;p&gt;His pop-con challenges are &lt;em&gt;also&lt;/em&gt; popular.  Whether it is by the virtue of his name being on the post, or because they are well-written, they become quite popular.  Nearly all of the listed allowed challenges are written by him.&lt;/p&gt;&#xA;&lt;p&gt;Now lets look at the disallowed challenges:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Make the pattern&lt;/strong&gt;, &lt;strong&gt;What time is it&lt;/strong&gt;, &lt;strong&gt;Warhol&lt;/strong&gt;:  Unpopular (received few upvotes and few downvotes)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Mona Lisa&lt;/strong&gt;:  This challenge was pretty popular, but was in the middle of a debate as to whether it should be allowed.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Tweetable Mathematical Art&lt;/strong&gt;:  Immensely popular, but because it was clearly off-topic under our previous guidelines, it got closed later on&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;When judging whether or not to close, we, as imperfect humans, often appeal to whether or not we like the challenge. Challenges that are enjoyable to read/compete in are going to have less close votes. &lt;strong&gt;While our &lt;em&gt;official&lt;/em&gt; guidelines have asked for objectivity, we are more likely to think that a challenge is objective if we liked the challenge in the first place&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Therefore, if we take a stance, we should apply those guidelines &lt;em&gt;regardless&lt;/em&gt; of the popularity/enjoyability of the post.&lt;/p&gt;&#xA;&lt;p&gt;(All of this said, my personal opinion is that the majority of the challenges listed above are on-topic for this site.  To be more clear: I'm &lt;em&gt;not&lt;/em&gt; saying that Helka's posts are off-topic; I think they should remain open. However, if we are making exceptions to the rule because of his name, we should stop)&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-06-17T16:57:18.573" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9390" PostTypeId="2" ParentId="2140" CreationDate="2016-06-17T16:52:51.210" Score="3" Body="&lt;h1&gt;Language succession&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given two words (two strings of lowercase-only letters separated by a space) as input to a program &lt;strong&gt;P&lt;sub&gt;X&lt;/sub&gt;&lt;/strong&gt; written in language &lt;strong&gt;X&lt;/strong&gt;, output two programs in languages &lt;strong&gt;Y&lt;/strong&gt; and &lt;strong&gt;Z&lt;/strong&gt; such that program &lt;strong&gt;P&lt;sub&gt;Y&lt;/sub&gt;&lt;/strong&gt; outputs the first word and program &lt;strong&gt;P&lt;sub&gt;Z&lt;/sub&gt;&lt;/strong&gt; outputs the second word. &lt;em&gt;You may output or return these results.&lt;/em&gt; These programs may be returned in any fashion as long as it is evident that there are two distinct programs, e.g. double newline, or an array containing the result, or even a fancy box.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's the catch: the next answer's language &lt;strong&gt;X&lt;/strong&gt; must be either language &lt;strong&gt;Y&lt;/strong&gt; or &lt;strong&gt;Z&lt;/strong&gt; from a past answer that has not as of the answer been used as a language &lt;strong&gt;X&lt;/strong&gt;. The resulting nodes &lt;strong&gt;Y&lt;/strong&gt; and &lt;strong&gt;Z&lt;/strong&gt; cannot be a language that has appeared yet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, say the first answer is a program written in &lt;strong&gt;Java&lt;/strong&gt; that outputs a programs in &lt;strong&gt;Python 2&lt;/strong&gt; and &lt;strong&gt;Whitespace&lt;/strong&gt;. Then, the next answer would write a program in either &lt;strong&gt;Python 2&lt;/strong&gt; or &lt;strong&gt;Whitespace&lt;/strong&gt; that outputs programs in languages different than Java, Whitespace, and Python 2. Let's say it outputs answers in &lt;strong&gt;Foo&lt;/strong&gt; and &lt;strong&gt;C++&lt;/strong&gt;. Then, the next answer must be written in &lt;strong&gt;Whitespace&lt;/strong&gt;, &lt;strong&gt;Foo&lt;/strong&gt;, or &lt;strong&gt;C++&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The same user, however, may not extend their own nodes. That is, the person who posted the Java answer in the above example may not extend in Python 2 or Whitespace. Also, no person can extend two nodes of the same answer. So, someone couldn't extend both the Python 2 answer and the Whitespace one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are languages I consider the &quot;same&quot;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Different versions of the same language. So, Python 2 is Python 3.&lt;/li&gt;&#xA;&lt;li&gt;Trivial derivatives of a language. Brainfuck syntax substitutions are not valid, say.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;However, this does not mean that Python 2 can be exchanged for Python 3.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The next solution in the chain must use the same character set as the previous program &lt;strong&gt;P&lt;sub&gt;X&lt;/sub&gt;&lt;/strong&gt;, adding or removing only 5 characters from that set. There is no restriction on the length of the set. Any characters may be added or removed from the set. Even if characters are not used in a submission, they still remain in the characters set until forcibly removed. (You may optionally substitute the characters with characters in another code page at the same place.) If you need an example, look below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner of this challenge is the one with the last answer. I define &quot;last answer&quot; as the most recently posted answer on this challenge where after a period of &lt;strong&gt;seven&lt;/strong&gt; days after the answer was posted, no new nodes have been extended. Feel free to continue extending nodes after the challenge has ended, but I will not revise the accepted answer. You may use languages made/updated after this challenge and still compete, but only if that language was not made/updated specifically for this challenge.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;First post&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(this will not be part of the resulting question)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I will start it off. Here's the answer markdown:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# J, initial answer&#xA;&#xA;    split =: 3 : 0&#xA;     w1 =. &amp;gt; 0 { ;: y&#xA;     w2 =. &amp;gt; 1 { ;: y&#xA;     ('alert(&quot;' , w1, '&quot;)') ; ('print(&quot;', w2, ')&quot;')&#xA;    )&#xA;&#xA;Languages used:&#xA; 1. JavaScript&#xA; 2. Python 3&#xA;&#xA;Character set used: `&quot;'(),.0123:;=&amp;gt;aeilnprstwy{`, space, `\r`, and `\n`.&#xA;&#xA;Code points used: `10 13 32 34 39 40 41 44 46 48 49 50 51 58 59 61 62 97 101 105 108 110 112 114 115 116 119 121 123`.&#xA;&#xA;No differences, is initial answer.&#xA;&#xA;Call it like `split 'multiple words'`. Output looks like this:&#xA;&#xA;    +-----------------+--------------+&#xA;    |alert(&quot;multiple&quot;)|print(&quot;words&quot;)|&#xA;    +-----------------+--------------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Answer format&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here's an example of the answer format to be used.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# Language, extends [language](link to post)&#xA;&#xA;    program&#xA;&#xA;Languages used:&#xA;  1. lang 1&#xA;  2. lang 2&#xA;&#xA;Character set used: `characters`.&#xA;&#xA;Code points used: `code points`.&#xA;&#xA;Differences:&#xA; * added &quot;c&quot;&#xA; * removed &quot; &quot;&#xA;&#xA;&amp;lt;extra info&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Also, please edit posts saying that one of your languages has been used, like so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Languages used:&#xA;  1. lang 1 ([used](link to post))&#xA;  2. lang 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Language Availability Snippet:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;/* Configuration */&#xD;&#xA;&#xD;&#xA;var QUESTION_ID = 47338; // Obtain this from the url&#xD;&#xA;// It will be like https://XYZ.stackexchange.com/questions/QUESTION_ID/... on any question page&#xD;&#xA;var ANSWER_FILTER = &quot;!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe&quot;;&#xD;&#xA;var COMMENT_FILTER = &quot;!)Q2B_A2kjfAiU78X(md6BoYk&quot;;&#xD;&#xA;var OVERRIDE_USER = 8478; // This should be the user ID of the challenge author.&#xD;&#xA;&#xD;&#xA;/* App */&#xD;&#xA;&#xD;&#xA;var answers = [], answers_hash, answer_ids, answer_page = 1, more_answers = true, comment_page;&#xD;&#xA;&#xD;&#xA;function answersUrl(index) {&#xD;&#xA;  return &quot;https://api.stackexchange.com/2.2/questions/&quot; +  QUESTION_ID + &quot;/answers?page=&quot; + index + &quot;&amp;amp;pagesize=100&amp;amp;order=desc&amp;amp;sort=creation&amp;amp;site=codegolf&amp;amp;filter=&quot; + ANSWER_FILTER;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function commentUrl(index, answers) {&#xD;&#xA;  return &quot;https://api.stackexchange.com/2.2/answers/&quot; + answers.join(';') + &quot;/comments?page=&quot; + index + &quot;&amp;amp;pagesize=100&amp;amp;order=desc&amp;amp;sort=creation&amp;amp;site=codegolf&amp;amp;filter=&quot; + COMMENT_FILTER;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function getAnswers() {&#xD;&#xA;  jQuery.ajax({&#xD;&#xA;    url: answersUrl(answer_page++),&#xD;&#xA;    method: &quot;get&quot;,&#xD;&#xA;    dataType: &quot;jsonp&quot;,&#xD;&#xA;    crossDomain: true,&#xD;&#xA;    success: function (data) {&#xD;&#xA;      answers.push.apply(answers, data.items);&#xD;&#xA;      answers_hash = [];&#xD;&#xA;      answer_ids = [];&#xD;&#xA;      data.items.forEach(function(a) {&#xD;&#xA;        a.comments = [];&#xD;&#xA;        var id = +a.share_link.match(/\d+/);&#xD;&#xA;        answer_ids.push(id);&#xD;&#xA;        answers_hash[id] = a;&#xD;&#xA;      });&#xD;&#xA;      if (!data.has_more) more_answers = false;&#xD;&#xA;      comment_page = 1;&#xD;&#xA;      getComments();&#xD;&#xA;    }&#xD;&#xA;  });&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function getComments() {&#xD;&#xA;  jQuery.ajax({&#xD;&#xA;    url: commentUrl(comment_page++, answer_ids),&#xD;&#xA;    method: &quot;get&quot;,&#xD;&#xA;    dataType: &quot;jsonp&quot;,&#xD;&#xA;    crossDomain: true,&#xD;&#xA;    success: function (data) {&#xD;&#xA;      data.items.forEach(function(c) {&#xD;&#xA;        if (c.owner.user_id === OVERRIDE_USER)&#xD;&#xA;          answers_hash[c.post_id].comments.push(c);&#xD;&#xA;      });&#xD;&#xA;      if (data.has_more) getComments();&#xD;&#xA;      else if (more_answers) getAnswers();&#xD;&#xA;      else process();&#xD;&#xA;    }&#xD;&#xA;  });  &#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;getAnswers();&#xD;&#xA;&#xD;&#xA;var LANG_REG = /&amp;lt;h\d&amp;gt;\s*([^\n,]*[^\s,]),[^]*?Languages used:\n\s*1. ([^\n]*)\n\s*2. ([^\n]*)/;&#xD;&#xA;&#xD;&#xA;var OVERRIDE_REG = /^Override\s*header:\s*/i;&#xD;&#xA;&#xD;&#xA;function getAuthorName(a) {&#xD;&#xA;  return a.owner.display_name;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function process() {&#xD;&#xA;  var used = [];&#xD;&#xA;  var available = [];&#xD;&#xA;  &#xD;&#xA;  answers.forEach(function(a) {&#xD;&#xA;    var body = a.body;&#xD;&#xA;    a.comments.forEach(function(c) {&#xD;&#xA;      if(OVERRIDE_REG.test(c.body))&#xD;&#xA;        body = '&amp;lt;h1&amp;gt;' + c.body.replace(OVERRIDE_REG, '') + '&amp;lt;/h1&amp;gt;';&#xD;&#xA;    });&#xD;&#xA;    &#xD;&#xA;    var match = body.match(LANG_REG);&#xD;&#xA;    if (match)&#xD;&#xA;      used.push({&#xD;&#xA;        language: match[1],&#xD;&#xA;        user: getAuthorName(a),&#xD;&#xA;        link: a.share_link&#xD;&#xA;      });&#xD;&#xA;      available.push({&#xD;&#xA;        language: match[2],&#xD;&#xA;        link: a.share_link&#xD;&#xA;      });&#xD;&#xA;      available.push({&#xD;&#xA;        language: match[3],&#xD;&#xA;        link: a.share_link&#xD;&#xA;      });&#xD;&#xA;      &#xD;&#xA;  });&#xD;&#xA;  &#xD;&#xA;  available.filter(function (a) {&#xD;&#xA;      return used.map(function (b) {return b.language}).indexOf(a.language) + 1&#xD;&#xA;  });&#xD;&#xA;  &#xD;&#xA;  used.sort(function (a, b) {&#xD;&#xA;    if (a.language &amp;gt; b.language) return 1;&#xD;&#xA;    if (a.language &amp;lt; b.language) return -1;&#xD;&#xA;    return 0&#xD;&#xA;  });&#xD;&#xA;  available.sort(function (a, b) {&#xD;&#xA;    if (a.language &amp;gt; b.language) return 1;&#xD;&#xA;    if (a.language &amp;lt; b.language) return -1;&#xD;&#xA;    return 0&#xD;&#xA;  });&#xD;&#xA;&#xD;&#xA;  used.forEach(function (a) {&#xD;&#xA;    &#xD;&#xA;    var used_lang = jQuery(&quot;#used-template&quot;).html();&#xD;&#xA;    used_lang = used_lang.replace(&quot;{{LANGUAGE}}&quot;, a.language)&#xD;&#xA;                   .replace(&quot;{{NAME}}&quot;, a.user)&#xD;&#xA;                   .replace(&quot;{{LINK}}&quot;, a.link);&#xD;&#xA;    used_lang = jQuery(used_lang);&#xD;&#xA;    jQuery(&quot;#used&quot;).append(used_lang);&#xD;&#xA;&#xD;&#xA;    var lang = a.language;&#xD;&#xA;    if (/&amp;lt;a/.test(lang)) lang = jQuery(lang).text();&#xD;&#xA;    &#xD;&#xA;  });&#xD;&#xA;  &#xD;&#xA;  available.forEach(function (a) {&#xD;&#xA;    &#xD;&#xA;    var avail_lang = jQuery(&quot;#available-template&quot;).html();&#xD;&#xA;    avail_lang = avail_lang.replace(&quot;{{LANGUAGE}}&quot;, a.language)&#xD;&#xA;                   .replace(&quot;{{LINK}}&quot;, a.link);&#xD;&#xA;    avail_lang = jQuery(avail_lang);&#xD;&#xA;    jQuery(&quot;#available&quot;).append(avail_lang);&#xD;&#xA;&#xD;&#xA;    var lang = a.language;&#xD;&#xA;    if (/&amp;lt;a/.test(lang)) lang = jQuery(lang).text();&#xD;&#xA;    &#xD;&#xA;  });&#xD;&#xA;&#xD;&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-css lang-css prettyprint-override&quot;&gt;&lt;code&gt;body { text-align: left !important}&#xD;&#xA;&#xD;&#xA;#used-list {&#xD;&#xA;  padding: 10px;&#xD;&#xA;  width: 290px;&#xD;&#xA;  float: left;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;#available-list {&#xD;&#xA;  padding: 10px;&#xD;&#xA;  width: 290px;&#xD;&#xA;  float: left;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;table thead {&#xD;&#xA;  font-weight: bold;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;table td {&#xD;&#xA;  padding: 5px;&#xD;&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xD;&#xA;&amp;lt;link rel=&quot;stylesheet&quot; type=&quot;text/css&quot; href=&quot;//cdn.sstatic.net/codegolf/all.css?v=83c949450c8b&quot;&amp;gt;&#xD;&#xA;&amp;lt;div id=&quot;avail-list&quot;&amp;gt;&#xD;&#xA;  &amp;lt;h2&amp;gt;Available&amp;lt;/h2&amp;gt;&#xD;&#xA;  &amp;lt;table class=&quot;avail-list&quot;&amp;gt;&#xD;&#xA;    &amp;lt;thead&amp;gt;&#xD;&#xA;      &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;Language&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Link&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&#xD;&#xA;    &amp;lt;/thead&amp;gt;&#xD;&#xA;    &amp;lt;tbody id=&quot;available&quot;&amp;gt;&#xD;&#xA;&#xD;&#xA;    &amp;lt;/tbody&amp;gt;&#xD;&#xA;  &amp;lt;/table&amp;gt;&#xD;&#xA;&amp;lt;/div&amp;gt;&#xD;&#xA;&amp;lt;div id=&quot;used-list&quot;&amp;gt;&#xD;&#xA;  &amp;lt;h2&amp;gt;Used&amp;lt;/h2&amp;gt;&#xD;&#xA;  &amp;lt;table class=&quot;used-list&quot;&amp;gt;&#xD;&#xA;    &amp;lt;thead&amp;gt;&#xD;&#xA;      &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;Language&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;User&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Link&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&#xD;&#xA;    &amp;lt;/thead&amp;gt;&#xD;&#xA;    &amp;lt;tbody id=&quot;used&quot;&amp;gt;&#xD;&#xA;&#xD;&#xA;    &amp;lt;/tbody&amp;gt;&#xD;&#xA;  &amp;lt;/table&amp;gt;&#xD;&#xA;&amp;lt;/div&amp;gt;&#xD;&#xA;&amp;lt;table style=&quot;display: none&quot;&amp;gt;&#xD;&#xA;  &amp;lt;tbody id=&quot;available-template&quot;&amp;gt;&#xD;&#xA;    &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;{{LANGUAGE}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;{{LINK}}&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&#xD;&#xA;  &amp;lt;/tbody&amp;gt;&#xD;&#xA;&amp;lt;/table&amp;gt;&#xD;&#xA;&amp;lt;table style=&quot;display: none&quot;&amp;gt;&#xD;&#xA;  &amp;lt;tbody id=&quot;used-template&quot;&amp;gt;&#xD;&#xA;    &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;{{LANGUAGE}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{NAME}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;{{LINK}}&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&#xD;&#xA;  &amp;lt;/tbody&amp;gt;&#xD;&#xA;&amp;lt;/table&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="31625" LastEditDate="2016-07-22T21:13:34.280" LastActivityDate="2016-07-22T21:13:34.280" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9392" PostTypeId="2" ParentId="2140" CreationDate="2016-06-17T19:39:51.743" Score="0" Body="&lt;h1&gt;&quot;Optimize&quot; a RegEx&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Introduction&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Inspired by atrociously large regex's like &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;/[0-9A-Za-z!@#$%&amp;amp;*()_\-+={[}\]|\:;&quot;'&amp;lt;,&amp;gt;.?\/\\~`]+[0-9A-Za-z!@#$%&amp;amp;*()_\-+={[}\]|\:;&quot;'&amp;lt;,&amp;gt;.?\/\\~`]*/g&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I propose a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge to create a string representing an optimized and sorted regex from an input string of characters expected to be matched.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;only printable ASCII characters with code points 32 - 127 need to be supported:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; !&quot;#$%&amp;amp;'()*+,-./0123456789:;&amp;lt;=&amp;gt;?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The RegEx output string &lt;em&gt;should&lt;/em&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Group 3 or more consecutive code points in the input string together like &lt;code&gt;begin-end&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Sort the characters and groups in order of ascending code point&lt;/li&gt;&#xA;&lt;li&gt;Escape the literal character &lt;code&gt;-&lt;/code&gt; to &lt;code&gt;\-&lt;/code&gt; to differentiate it from a range&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The RegEx output string should &lt;em&gt;not&lt;/em&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Escape the characters &lt;code&gt;!$()*+./=?[\]^{|}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Support any RegEx escape sequences like &lt;code&gt;\w&lt;/code&gt;, &lt;code&gt;\d&lt;/code&gt; or &lt;code&gt;\s&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA;helloworld&#xA;Output:&#xA;dehlorw&#xA;&#xA;Input:&#xA;fedcabXZYVWU&#xA;Output:&#xA;U-Za-f&#xA;&#xA;Input:&#xA;q0`p[|iOf(oc61TSr4dVwQ8m;%YDAPM*a/2j&amp;amp;h~u}&#xA;Output:&#xA;%&amp;amp;(*/-2468;ADMO-QSTVY[`acdfh-jmo-ruw|-~&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Just so people can see what the last one's pattern is, here are the ASCII indices:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;37,38,40,42,47-50,52,54,56,59,65,68,77,79-81,83,84,86,89,91,96,97,99,100,102,104-106,109,111-114,117,119,124-126&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Spoiler Alert&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Example implementation in JavaScript ES6:&lt;/p&gt;&#xA;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;  &lt;p&gt; &lt;pre&gt;&lt;code&gt;f=s=&gt;[...s] // spread string into array&#xA;  .sort() // sort array by ASCII indices&#xA;  .map(&#xA;    c=&gt;c.charCodeAt() // convert each one to ASCII index&#xA;  ).reduce( // reduce sorted indices&#xA;    (p,c)=&gt;(&#xA;      ~p[0][0]+c? // if last index is not one less than current index&#xA;        p.unshift([c]): // then start new run with this index&#xA;        p[0].unshift(c) // else continue existing run&#xA;      ,p&#xA;    ),&#xA;    [[]] // start reduce with empty run&#xA;  ).map( // map array of runs&#xA;    a=&gt;(&#xA;      (&#xA;        a=a.map( // map each run&#xA;          n=&gt;( // convert index back to ASCII&#xA;            c=String.fromCharCode(n),&#xA;            c=='-'? // if '-'&#xA;              '\-': // then escape it&#xA;              c&#xA;          )&#xA;        ),&#xA;        a.length&gt;2? // if run has more than 2 indices&#xA;          [a[0],'-',a.pop()]: // keep only the begin and end&#xA;          a // else keep whole run&#xA;      ).reverse().join&amp;#96;&amp;#96; // reverse and join run&#xA;    )&#xA;  ).reverse().join&amp;#96;&amp;#96; // reverse and join array&lt;/code&gt;&lt;/pre&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="42091" LastEditorUserId="42091" LastEditDate="2016-06-17T19:51:07.923" LastActivityDate="2016-06-17T19:51:07.923" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9393" PostTypeId="2" ParentId="2140" CreationDate="2016-06-17T20:08:34.940" Score="-2" Body="&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a program that takes an numerical input &lt;code&gt;n&lt;/code&gt; and outputs the &lt;code&gt;n&lt;/code&gt;th number that is not a perfect square.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so least bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="53819" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-06-17T20:08:34.940" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9397" PostTypeId="2" ParentId="2447" CreationDate="2016-06-19T16:35:44.370" Score="9" Body="&lt;h1&gt;Programs may input/output bytes in a bit-serial or 8-bit parallel manner with a clock and enable signal&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is mainly applicable to HDLs such as Verilog, as well as other embedded devices (such as microcontrollers). Currently, &lt;code&gt;$display&lt;/code&gt; is capable of writing to standard out in a simulator, but of course, not in a physical FPGA.&lt;/p&gt;&#xA;" OwnerUserId="4256" LastEditorUserId="4256" LastEditDate="2016-08-01T18:51:32.810" LastActivityDate="2016-08-01T18:51:32.810" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9403" PostTypeId="2" ParentId="2140" CreationDate="2016-06-20T14:28:46.770" Score="6" Body="&lt;h1&gt;Implement Brainfuck Algorithms&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brainfuck&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brainfuck&amp;#39;&quot; rel=&quot;tag&quot;&gt;brainfuck&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In order to make &lt;a href=&quot;https://esolangs.org/wiki/Brainfuck_algorithms&quot; rel=&quot;nofollow noreferrer&quot;&gt;algorithms written in brainfuck&lt;/a&gt; more understandable, you can write them in a more abstract notation, where you give a given cell a name, and instead of lots of unreadable &lt;code&gt;&amp;lt;&lt;/code&gt; and &lt;code&gt;&amp;gt;&lt;/code&gt; instructions to move the pointer to a specific, you just write down the name of the cell. Let us see an example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This algorithm doubles the value in cell &lt;code&gt;x&lt;/code&gt;, and saves the result again in &lt;code&gt;x&lt;/code&gt;. It needs an additional temporary cells &lt;code&gt;t&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;t[-]          clear temporary variable&#xA;x[t+x-]       move the value from x to t&#xA;t[x++t-]      move twice as many units from t back to x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now lets see what this would look like, if &lt;code&gt;x&lt;/code&gt; was the cell with index &lt;code&gt;0&lt;/code&gt;, and &lt;code&gt;t&lt;/code&gt; was the cell with index &lt;code&gt;2&lt;/code&gt;, assuming the poninter is in position &lt;code&gt;0&lt;/code&gt; when the algorithm starts:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;[-] &#xA;&amp;lt;&amp;lt;[&amp;gt;&amp;gt;+&amp;lt;&amp;lt;-]  &#xA;&amp;gt;&amp;gt;[&amp;lt;&amp;lt;++&amp;gt;&amp;gt;-]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given a string with a valid (see below) &lt;em&gt;brainfuck algorithm&lt;/em&gt;, a list of strings containing the cell names and a list of integers containing the indices of each of the cell of the previous list, your program/function has to return an implementation of this algorithm in brainfuck.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The pointer is assumed to be on a cell with index &lt;code&gt;0&lt;/code&gt; when the implementation is executed.&lt;/li&gt;&#xA;&lt;li&gt;The two given lists can also be in a different reasonable format e.g. &lt;code&gt;[cell1,index1,cell2,index2,...]&lt;/code&gt; or &lt;code&gt;[[cell1,index1],[cell2,index2],...&lt;/code&gt; or as arguments of a function with a variable number of arguments etc.&lt;/li&gt;&#xA;&lt;li&gt;You can assume that in the given string representing the algorithm, there are only brainfuck instructions as well as cell names, but no other symbols (no line breaks, no spaces)&lt;/li&gt;&#xA;&lt;li&gt;The cell names consist of lower- and uppercase characters &lt;code&gt;A-Z&lt;/code&gt; and &lt;code&gt;a-z&lt;/code&gt; as well as digits &lt;code&gt;0-9&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The cell names in the string are always separated by at least one BF instruction symbol.&lt;/li&gt;&#xA;&lt;li&gt;You can assume that the pointer is the same index whenever it enters a loop as it exits the same loop.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;h3&gt;&lt;a href=&quot;https://esolangs.org/wiki/Brainfuck_algorithms#x_.3D_y&quot; rel=&quot;nofollow noreferrer&quot;&gt;x=y&lt;/a&gt;:&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;String (remove line breaks):&#xA;  temp0[-]&#xA;  x[-]&#xA;  y[x+temp0+y-]&#xA;  temp0[y+temp0-]&#xA;List of variable names: [temp0,x,y]&#xA;List of indices:        [    2,0,1]&#xA;Output (remove line breaks):&#xA;  &amp;gt;&amp;gt;[-]&#xA;  &amp;lt;&amp;lt;[-]&#xA;  &amp;gt;[&amp;lt;+&amp;gt;&amp;gt;+&amp;lt;-]&#xA;  &amp;gt;&amp;gt;[&amp;lt;+&amp;gt;-]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;&lt;a href=&quot;https://esolangs.org/wiki/Brainfuck_algorithms#x_.3D_x_.2A_x&quot; rel=&quot;nofollow noreferrer&quot;&gt;x=x*x&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;String (&#xA;  temp0[-]&#xA;  temp1[-]&#xA;  temp2[-]&#xA;  x[temp2+temp1+x-]&#xA;  temp1[&#xA;    temp2[x+temp0+temp2-]&#xA;    temp0[temp2+temp0-]&#xA;    temp1-&#xA;  ]&#xA;List of variable names: [x,temp0,temp1,temp2]&#xA;List of indices:        [0,    1,    2,    3]&#xA;Output (remove line breaks):&#xA;  &amp;gt;[-]&#xA;  &amp;gt;[-]&#xA;  &amp;gt;[-]&#xA;  &amp;lt;&amp;lt;&amp;lt;[&amp;gt;&amp;gt;&amp;gt;+&amp;lt;+&amp;lt;&amp;lt;-]&#xA;   &amp;gt;&amp;gt;[&#xA;    &amp;gt;[&amp;lt;&amp;lt;+&amp;gt;+&amp;gt;&amp;gt;-]&#xA;    &amp;lt;&amp;lt;[&amp;gt;&amp;gt;+&amp;lt;&amp;lt;-]&#xA;    &amp;gt;-&#xA;  ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(More to be added)&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2019-08-19T11:50:12.643" LastActivityDate="2019-08-19T11:50:12.643" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="9404" PostTypeId="2" ParentId="9388" CreationDate="2016-06-20T19:48:50.577" Score="5" Body="&lt;h2&gt;Explicit distinction between &lt;em&gt;objective&lt;/em&gt; and &lt;em&gt;subjective&lt;/em&gt; rules&lt;/h2&gt;&#xA;&lt;p&gt;First of all, I do agree with Nathan Merrill's post. I'd like to add following point:&lt;/p&gt;&#xA;&lt;p&gt;When writing down the rules for the challenge, the author should make an &lt;strong&gt;explicit distinction&lt;/strong&gt; between&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;objective rules&lt;/strong&gt;: Things that can be objectively be measured (by a &amp;quot;dumb&amp;quot; computer). These rules form/include the &lt;strong&gt;objective validity criterion&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;subjective rules&lt;/strong&gt;: The goal of the challenge, which some submissions do achieve better than others. (The &lt;em&gt;heart&lt;/em&gt; of the pop-con, the artistic merit that should be achieved)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And both those sets of rules should also be declared as the &lt;em&gt;objective&lt;/em&gt; or &lt;em&gt;subjective&lt;/em&gt; rules. This distinction should be clearly present in the challenge.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example:&lt;/strong&gt; As an example of this I'd like to refer to my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/70483/patch-the-image&quot;&gt;patch-the-image&lt;/a&gt; challenge, as I wrote this challenge &lt;em&gt;after&lt;/em&gt; some of those mentioned discussions, and I very carefully tried to implement the points that were established.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;em&gt;objective rules&lt;/em&gt; were just that &lt;em&gt;outside&lt;/em&gt; of the given area, the image must remain unchanged, and that the program may only read from the outside area.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;em&gt;subjective rules&lt;/em&gt; said that the inside area should be filled, such that it is as unnoticeable as possible, basically as a list of voting suggestions.&lt;br /&gt;&#xA;There is no way how this could be judged objectively. Some of the answers did a relatively bad job (my personal opinion), some of the answers did a very good job at achieving this. This is where we need the judgment of the people who are reading the challenge, and what makes this a &lt;em&gt;popularity-contest&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-06-22T17:58:06.617" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9405" PostTypeId="2" ParentId="2140" CreationDate="2016-06-21T10:22:00.250" Score="0" Body="&lt;h2&gt;Exercise your kids&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I want you to output the &lt;em&gt;n&lt;/em&gt;th verse of this kid's exercise song:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Head, and shoulders, knees and toes, knees and toes,&lt;br&gt;&#xA;  Head, and shoulders, knees and toes, knees and toes&lt;br&gt;&#xA;  And eyes and ears and mouth and nose,&lt;br&gt;&#xA;  Head, and shoulders, knees and toes, knees and toes.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Each verse is the same as the previous except that all occurrences of one word is masked by replacing it with a dash (you can use a two-byte dash of your choice) wherever it appears in the verse. The words are replaced in order however the word &quot;and&quot; is never replaced, therefore the next verse should look like this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;—, and shoulders, knees and toes, knees and toes,&lt;br&gt;&#xA;  —, and shoulders, knees and toes, knees and toes&lt;br&gt;&#xA;  And eyes and ears and mouth and nose,&lt;br&gt;&#xA;  —, and shoulders, knees and toes, knees and toes.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Also, the last verse should look like this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;—, and —, — and —, — and —,&lt;br&gt;&#xA;  —, and —, — and —, — and —&lt;br&gt;&#xA;  And — and — and — and —,&lt;br&gt;&#xA;  —, and —, — and —, — and —.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Your answer should specify whether &lt;em&gt;n&lt;/em&gt; will range from 0 to 8 or 1 to 9.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="48934" LastEditDate="2016-06-21T10:38:38.020" LastActivityDate="2016-06-21T10:38:38.020" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9407" PostTypeId="1" CreationDate="2016-06-21T17:24:40.503" Score="2" ViewCount="144" Body="&lt;p&gt;If an answer is written in &lt;a href=&quot;https://esolangs.org/wiki/Category:Probabilistic&quot; rel=&quot;nofollow&quot;&gt;a language that &lt;em&gt;deliberately&lt;/em&gt; prevents the programs written with it from doing the same output/calculations/etc. every time by introducing randomness&lt;/a&gt;, should it be deleted anyway?&lt;/p&gt;&#xA;" OwnerUserId="53917" LastActivityDate="2016-06-21T22:33:39.607" Title="Is it OK for an answer to not work from time to time if the language it's written in is probabilistic?" Tags="|discussion|policy|answers|" AnswerCount="1" CommentCount="0" ClosedDate="2016-06-21T20:04:26.257" ContentLicense="CC BY-SA 3.0" />
  <row Id="9408" PostTypeId="2" ParentId="9407" CreationDate="2016-06-21T17:32:02.997" Score="6" Body="&lt;h1&gt;No, it is not OK&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If allowed, in an hypothetical probabilistic language that simply executes a random program without even looking at its source code, the empty program would be a solution to all code golf challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On top of that we already reached consensus that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8379/12012&quot;&gt;all answers must work with probability 1&lt;/a&gt;, for every possible input.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-06-21T22:33:39.607" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9409" PostTypeId="2" ParentId="2140" CreationDate="2016-06-21T17:45:36.577" Score="0" Body="&lt;h2&gt;Index sum and strip my matrix&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a matrix/2d array in your preferable language&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The matrix will always have an odd length&lt;/li&gt;&#xA;&lt;li&gt;The matrix will always be perfectly square&lt;/li&gt;&#xA;&lt;li&gt;The matrix values can be any integer in your language (positive or negative)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1  2  3  4  5  6  7&#xA;2  3  4  5  6  7  8&#xA;3  4  50 6  7  8  9&#xA;4  5  6 100 8  9  10&#xA;5  6  7  8 -9  10 11&#xA;6  7  8  9  10 11 12&#xA;7  8 900 10 11 12 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Definitions:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The &quot;central number&quot; is defined as the number that has the same amount of numbers to the left,right,up and down&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;In this case its middlemost 1000&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The &quot;outer shell&quot; is the collection of numbers which their x and y index is or 0 or the matrix size&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1  2  3  4  5  6  7&#xA;2                 8&#xA;3                 9&#xA;4                 10&#xA;5                 11&#xA;6                 12&#xA;7  8 900 10 11 12 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Your task:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Add to the central number the sum of each row and column after multiplying the values in each by their 1-based index&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;A single row for example&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4  5  6  7  8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;for each number&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;number * index + number * index.....&#xA;&#xA;4*1 + 5*2 + 6*3 + 7*4 + 8*5 =&amp;gt; 100&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;example:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 2 -3 -9  4  7  1  5  =&amp;gt; 61&#xA;-2  0 -2 -7 -7 -7 -4  =&amp;gt; -141&#xA; 6 -3 -2 -2 -3  2  1  =&amp;gt; -10&#xA; 8 -8  4  1 -8  2  0  =&amp;gt; -20&#xA;-5  6  7 -1  8  4  8  =&amp;gt; 144&#xA; 1  5  7  8  7 -9 -5  =&amp;gt; 10&#xA; 7  7 -2  2 -7 -8  0  =&amp;gt; -60&#xA;                         |&#xA;78 65 60 45 -15 -89 10   =&amp;gt; 154&#xA;                     |&#xA;                     =&amp;gt; -16&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For all rows and columns you combine these values..&lt;/li&gt;&#xA;&lt;li&gt;Now you sum these too =&gt; 154-16 = 138&lt;/li&gt;&#xA;&lt;li&gt;You add that number to the &quot;central number&quot; and remove the &quot;outer shell&quot; of the matrix&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 0 -2 -7 -7 -7     =&amp;gt; -88&#xA;-3 -2 -2 -3  2     =&amp;gt; -15&#xA;-8  4 1+138 -8  2  =&amp;gt; 395&#xA; 6  7 -1  8  4     =&amp;gt; 69&#xA; 5  7  8  7 -9     =&amp;gt; 26&#xA;&#xA;19 69 442 30 -26&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;do this untill you end up with a single number&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-2 -2 -3     =&amp;gt; -15&#xA; 4  1060 -8  =&amp;gt; 2100&#xA; 7 -1  8     =&amp;gt; 29&#xA;&#xA;27 2115 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Add 2114+2147 to 1060&lt;/li&gt;&#xA;&lt;li&gt;Remove the &quot;outer shell&quot; and get 5321&lt;/li&gt;&#xA;&lt;li&gt;Now we have a single number left&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;this is the output!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;test cases: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-6&#xA;&#xA;-6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-7 -1  8&#xA;-4 -6  7&#xA;-3 -6  6&#xA;&#xA;2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 6  7 -2  5  1&#xA;-2  6 -4 -2  3&#xA;-1 -4  0 -2 -7&#xA; 0  1  4 -4  8&#xA;-8 -6 -5  0  2&#xA;&#xA;-365&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 8  3  5  6  6 -7  5&#xA; 6  2  4 -2 -1  8  3&#xA; 2  1 -5  3  8  2 -3&#xA; 3 -1  0  7 -6  7 -5&#xA; 0 -8 -4 -9 -4  2 -8&#xA; 8 -9 -3  5  7  8  5&#xA; 8 -1  4  5  1 -4  8&#xA;&#xA;17611&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-9 -7  2  1  1 -2  3 -7 -3  6  7  1  0&#xA;-7 -8 -9 -2  7 -2  5  4  7 -7  8 -9  8&#xA;-4  4 -1  0  1  5 -3  7  1 -2 -9  4  8&#xA; 4  8  1 -1  0  7  4  6 -9  3 -9  3 -9&#xA;-6 -8 -4 -8 -9  2  1  1 -8  8  2  6 -4&#xA;-8 -5  1  1  2 -9  3  7  2  5 -6 -1  2&#xA;-8 -5 -7 -4 -9 -2  5  0  2 -4  2  0 -2&#xA;-3 -6 -3  2 -9  8  1 -5  5  0 -4 -1 -9&#xA;-9 -9 -8  0 -5 -7  1 -2  1 -4 -1  5  7&#xA;-6 -9  4 -2  8  7 -9 -5  3 -1  1  8  4&#xA;-6  6 -3 -4  3  5  6  8 -2  5 -1 -7 -9&#xA;-1  7 -9  4  6  7  6 -8  5  1  0 -3  0&#xA;-3 -2  5 -4  0  0  0 -1  7  4 -9 -4  2&#xA;&#xA;-28473770&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="44757" LastEditorUserId="44757" LastEditDate="2016-06-22T16:51:33.573" LastActivityDate="2016-06-22T16:51:33.573" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9410" PostTypeId="2" ParentId="9388" CreationDate="2016-06-21T18:15:28.000" Score="-6" Body="&lt;h1&gt;They should still follow our rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(No this is not about any specific pop-con, I'm just putting this here)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you go to &quot;Ask a Question&quot; on main, you'll see two main rules that answers should follow:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A &lt;strong&gt;clear specification&lt;/strong&gt; of what constitutes a correct submission, so that it is possible to indisputably decide whether an entry is valid or not. Test cases are highly encouraged.&lt;/li&gt;&#xA;&lt;li&gt;An &lt;strong&gt;objective primary winning criterion&lt;/strong&gt;, so that it is possible to indisputably decide which entry should win.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;So pop-cons fulfill #2 but &lt;strong&gt;#1 is where new users go wrong&lt;/strong&gt;. Here are some hypothetical questions (&lt;strong&gt;both are bad&lt;/strong&gt;, but one is better):&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Write a program to add A and B, most votes wins&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Write a program to output a randomly drawn goat, most votes wins&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Okay, so it's pretty clear which one is more on-topic, but here's my stance:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;Pop-cons are only a winning criteria, judge the question's on-topicness, &lt;strong&gt;regardless of the pop-con tag&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some examples of &lt;strong&gt;on-topic&lt;/strong&gt; pop-cons would be:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/61115/40695&quot;&gt;Make your language unusable&lt;/a&gt; – it could very well be a code-golf competition, but pop-con encourages creativity in the &lt;em&gt;answers&lt;/em&gt;, &quot;creativity&quot; in the output isn't bad, but in many cases it can become a way for loopholes to open&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/50299/40695&quot;&gt;Draw an Image as a Voronoi Map&lt;/a&gt; – Answers can be objectively specified whether they are correct, or invalid. Downvotes shouldn't be what make the specification. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;But what's brought up is that there is a specific (objective) task that answers must do. Pop-con can be used for answers to creatively solve the problem, and have voting descide the best solution, but that's no excuse for not having an objective specification for the task. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In conclusion: the task to be done should be clear, an answer can be objectively measured whether or not it fullfills the question's criteria without requiring downvotes to enforce rules. Subjectivity is perfectly fine as long as there is still some sort of objective specification&lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-06-21T18:15:28.000" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9412" PostTypeId="2" ParentId="2140" CreationDate="2016-06-22T01:25:16.747" Score="0" Body="&lt;h1&gt;Calculate the Average Squared Error&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a line &lt;em&gt;y = mx + b&lt;/em&gt; and a set of &lt;em&gt;n&lt;/em&gt; points (&lt;em&gt;x&lt;sub&gt;i&lt;/sub&gt;, y&lt;sub&gt;i&lt;/sub&gt;&lt;/em&gt;), find the average square error between the given line and each set of points.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/or1h1.png&quot; alt=&quot;Formula&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your goal is to create a function or program that given the values &lt;em&gt;m&lt;/em&gt;, &lt;em&gt;b&lt;/em&gt;, and the set of points (&lt;em&gt;x&lt;sub&gt;i&lt;/sub&gt;, y&lt;sub&gt;i&lt;/sub&gt;&lt;/em&gt;), outputs the average square error according to the formula above.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest solution wins.&lt;/li&gt;&#xA;&lt;li&gt;Builtins that compute this value are not allowed. This includes builtins that compute a result which is a scaled value of this.&lt;/li&gt;&#xA;&lt;li&gt;Floating-point inaccuracies will not be counted against you.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;tba&lt;/p&gt;&#xA;" OwnerUserId="6710" LastEditorUserId="6710" LastEditDate="2016-06-22T01:55:00.370" LastActivityDate="2016-06-22T01:55:00.370" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9416" PostTypeId="2" ParentId="7542" CreationDate="2016-06-22T18:20:50.353" Score="9" Body="&lt;p&gt;I assume everyone is in favour of syntax highlighting being possible on meta, but I'm adding an answer just so people can indicate either way with voting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;MathJax was mentioned as a potential cause of syntax highlighting not working, but MathJax has since been removed from meta, ruling this out as the cause. I suspect that syntax highlighting is simply switched off on meta. If so, I'd like to see it switched back on.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2016-06-22T18:20:50.353" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9417" PostTypeId="2" ParentId="8350" CreationDate="2016-06-22T18:59:24.917" Score="9" Body="&lt;h1&gt;Adding a &quot;bytes&quot; sorting order to the solution section of each &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The built-in leaderboard function might be too &quot;clumsy&quot; for the people at SE HQ to implement. This might be a cleaner way of fixing the same problem.&lt;/p&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2016-06-22T18:59:24.917" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9418" PostTypeId="2" ParentId="2140" CreationDate="2016-06-22T22:02:08.283" Score="0" Body="&lt;h1&gt;White Water Rafting&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/path-finding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;path-finding&amp;#39;&quot; rel=&quot;tag&quot;&gt;path-finding&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphs&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphs&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphs&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This problem is about finding the best path through a bunch of rocks on a 5-column wide river, without crashing your raft. A river looks like this (&lt;code&gt;*&lt;/code&gt; reprsents a rock):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;. . . R .&#xA;. R . . .&#xA;R . . . .&#xA;. . R . .&#xA;R . . . .&#xA;. . . . R&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Each row will contain exactly 1 rock, no more, no less. Your raft can start on any space without a rock.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can't maneuver your raft too much, so as you travel down the river, there are only 3 next places you can go (&lt;code&gt;x&lt;/code&gt; is the next space):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;. . @ . .&#xA;. x x x .&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If there is a rock in your way, you can't go there. Your raft can't fit through rocks that are diagonally adjacent to each other. You can't beach your raft either. Finally, you can't go anywhere that would result in you crashing your raft.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;@ . . . .&#xA;R x . . .   &amp;lt;- Can't go on rock, can't go oob&#xA;&#xA;R . . . .&#xA;. R @ . .&#xA;. . R X .   &amp;lt;- Can't go through diagonal rocks&#xA;&#xA;. @ . R .&#xA;. R x . .   &amp;lt;- Can go through non-adjacent diagonals,&#xA;R . . . .      Can't go to dead end.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Because you don't have much space on the raft to write this code, shortest code wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA;&#xA;. R . . .&#xA;. R . . .&#xA;. . . R .&#xA;. . . R .&#xA;R . . . .&#xA;&#xA;Output:&#xA;&#xA;R x . . .&#xA;. R x . .&#xA;. x . R .&#xA;x . . R .&#xA;R x . . .&#xA;&#xA;Input:&#xA;&#xA;R . . . .&#xA;R . . . .&#xA;R . . . .&#xA;R . . . .&#xA;R . . . .&#xA;&#xA;Output:&#xA;&#xA;R x . . .&#xA;R x . . .&#xA;R x . . .&#xA;R x . . .&#xA;R x . . .&#xA;&#xA;Input:&#xA;&#xA;. R . . .&#xA;. R . . .&#xA;. R . . .&#xA;. R . . .&#xA;R . . . .&#xA;&#xA;Output:&#xA;&#xA;. R x . .&#xA;. R x . .&#xA;. R x . .&#xA;. R x . .&#xA;R x . . .&#xA;&#xA;Input:&#xA;&#xA;. . . . R&#xA;. . . R .&#xA;. . R . .&#xA;. R . . .&#xA;. . R . .&#xA;&#xA;Output:&#xA;&#xA;x . . . R&#xA;x . . R .&#xA;x . R . .&#xA;x R . . .&#xA;x . R . .&#xA;&#xA;Input:&#xA;&#xA;. . . . R&#xA;. . . R .&#xA;. . R . .&#xA;. R . . .&#xA;R . . . .&#xA;&#xA;Output:&#xA;&#xA;[nothing] or [empty/blank array/matrix]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Notes:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input can be in array of indexes, array of truthy/falsey values, or any other input format most comfortable to your language.&lt;/li&gt;&#xA;&lt;li&gt;Output should indicate the left-most valid path.&lt;/li&gt;&#xA;&lt;li&gt;Output can be in array of indexes, array of truthy/falsey values, or any other input format most comfortable to your language.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output does not have to be in the same format as input.&lt;/li&gt;&#xA;&lt;li&gt;Output nothing/(empty/blank) (array/matrix) if there is no valid path&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden by default.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is my first challenge, so please let me know if I have left anything out or something is unclear.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Related problems&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/73998/42855&quot;&gt;Follow incomplete directions&lt;/a&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Has more obstacles, directions are given&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/65576/42855&quot;&gt;How varied is my obstacle course?&lt;/a&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;About finding paths through an obstacle course&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/46886/42855&quot;&gt;Grid-Routing Battle&lt;/a&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Similar graph structure&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I couldn't find any dupe targets looking through &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;, so I'll look again in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphs&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphs&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphs&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/path-finding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;path-finding&amp;#39;&quot; rel=&quot;tag&quot;&gt;path-finding&lt;/a&gt; later.&lt;/p&gt;&#xA;" OwnerUserId="42855" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:27.967" LastActivityDate="2016-06-23T10:48:23.143" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9421" PostTypeId="2" ParentId="2140" CreationDate="2016-06-23T10:43:09.937" Score="-2" Body="&lt;h1&gt;Generate all variations of a string with every combination of upper and lower case for each vowel but leaving consonants and order of letters unchanged.&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a simplified analog of a problem I've thought about a few times over the years based around variant spellings in different spoken languages.&lt;/p&gt;&#xA;&lt;p&gt;Input is a text string. Output is an array of all variations of the text string.&lt;/p&gt;&#xA;&lt;p&gt;A &amp;quot;variation&amp;quot; means the same letters in the same order but for each vowel letter in the string we generate a version of that string with the vowel in uppercase and the vowel in lowercase.&lt;/p&gt;&#xA;&lt;p&gt;No variation should be included more than once. No legal variation may be omitted.&lt;/p&gt;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;&lt;code&gt;codegolf&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;codegolf&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;codegOlf&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;codEgolf&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;codEgOlf&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cOdegolf&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cOdegOlf&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cOdEgolf&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cOdEgOlf&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The winner shall be the &lt;strong&gt;most elegant as voted by the community&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&amp;quot;Elegant&amp;quot; includes that the algorithm should be optimal in terms of Big O notation, should be concise, should be idiomatic making good use of available features of the implementation language.&lt;/p&gt;&#xA;&lt;p&gt;Length of code characters or bytes is not relevant.&lt;/p&gt;&#xA;&lt;p&gt;Programming language is open.&lt;/p&gt;&#xA;" OwnerUserId="3622" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-06-23T13:23:00.330" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9422" PostTypeId="2" ParentId="2140" CreationDate="2016-06-23T11:17:47.807" Score="0" Body="&lt;h1&gt;Regex golf: Match the Thu'um-s&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regex&amp;#39;&quot; rel=&quot;tag&quot;&gt;regex&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;Skyrim is a game made by Bethesda and came out in 2011. One of the objectives of the game is to collect every 27 shouts (or Thu'um-s). In this challenge, you need to match every shout and nothing else.&lt;/p&gt;&#xA;&lt;h2&gt;Shouts&lt;/h2&gt;&#xA;&lt;p&gt;This is the list of the available shouts in the game:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Raan Mir Tah&#xA;Laas Yah Nir&#xA;Mid Vur Shaan&#xA;Feim Zii Gron&#xA;Gol Hah Dov&#xA;Od Ah Viing&#xA;Hun Kaal Zoor&#xA;Lok Vah Koor&#xA;Ven Gaar Nos&#xA;Zun Haal Viik&#xA;Faas Ru Maar&#xA;Mul Qah Diiv&#xA;Joor Zah Frul&#xA;Gaan Lah Haas&#xA;Su Grah Dun&#xA;Yol Toor Shul&#xA;Fo Krah Diin&#xA;Liz Slen Nus&#xA;Kaan Drem Ov&#xA;Krii Lun Aus&#xA;Rii Vaaz Zol&#xA;Tiid Klo Ul&#xA;Strun Bah Qo&#xA;Dur Neh Viir&#xA;Zul Mey Gut&#xA;Fus Ro Dah&#xA;Wuld Nah Kest&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Additionally, every shout can have 3 levels depending on what the player collected so far, each level adds a new word to each shout, so you need to be able t match the separate words without the full shout.&lt;/p&gt;&#xA;&lt;p&gt;The words need to be uppercase. A shout should only be matched, if it is a separate word, for example: Golf shouldn't be matched.&lt;/p&gt;&#xA;&lt;p&gt;The separate words for the same shout in the order as in the list appear next to each other, then they need to be in the same match.&lt;/p&gt;&#xA;&lt;p&gt;The input strings will only contain ASCII letters and spaces as word separators.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;The matched text is bold&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Hydrogen Sulphur &lt;strong&gt;Krah&lt;/strong&gt; Coal &lt;strong&gt;Gaan Lah Haas&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;one two three four &lt;strong&gt;Kaal&lt;/strong&gt; six seven &lt;strong&gt;Joor Zah Frul&lt;/strong&gt; eleven&lt;/p&gt;&#xA;&lt;p&gt;red green blue &lt;strong&gt;Gol Hah&lt;/strong&gt; orange purple &lt;strong&gt;Qo&lt;/strong&gt; violet&lt;/p&gt;&#xA;&lt;p&gt;Ran Miir Taah &lt;strong&gt;Raan Mir Tah&lt;/strong&gt; raan mir tah&lt;/p&gt;&#xA;&lt;p&gt;Golf &lt;strong&gt;Gol&lt;/strong&gt; Middleage &lt;strong&gt;Mid&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The answer should be a .NET type RegEx and should not contain any other langauge.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is a code-golf, so the shortest answer in bytes wins&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49709" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-06-23T13:48:35.403" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9423" PostTypeId="2" ParentId="2140" CreationDate="2016-06-23T11:19:32.810" Score="0" Body="&lt;h1&gt;Cypher-o-mania!&lt;/h1&gt;&#xA;&lt;p&gt;The year is 19XX.&lt;/p&gt;&#xA;&lt;p&gt;You are a spy of some distant country, and your job is to send messages across the globe.&lt;/p&gt;&#xA;&lt;p&gt;Unfortunately, because, frankly, you suck at being a spy, you need a way to obfuscate your information, so that when the opposition catches you (which they will), they won't know what the heck is written.&lt;/p&gt;&#xA;&lt;p&gt;How are you going to do this?&lt;/p&gt;&#xA;&lt;p&gt;Your task is, using two inputs (the first input the encoding &amp;quot;cypher&amp;quot; and the second the message), encode the message.&lt;/p&gt;&#xA;&lt;p&gt;This is how the encoding works:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The message only consists of the lowercase letters and the numerals.&lt;/li&gt;&#xA;&lt;li&gt;Because there are 36 different characters in total, we will convert each individual letter of the message to &amp;quot;base 9&amp;quot; (&lt;code&gt;a = 00, b = 01, c = 02... 8 = 37, 9 = 38&lt;/code&gt;). This will be called the FSO, or First-Stage Obfuscation.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For example, the message &lt;code&gt;hello1&lt;/code&gt; would then be translated to &lt;code&gt;07 04 12 12 15 28&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Each individual &amp;quot;bit&amp;quot; of the FSO is then stripped of its first part. This will be known as the SSO, or Second-Stage Obfuscation.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The example &lt;code&gt;07 04 12 12 15 28&lt;/code&gt; is then translated to &lt;code&gt;7 4 2 2 5 8&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;This is where the encoder comes in handy! The encoder will consist of a string of numbers 0 to 3 (e.g. &lt;code&gt;1212003&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;You then add to the start of each digit of the encoder to the corresponding digit of the SSO. This is now the TSO, or Third-Stage Obfuscation.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The example &lt;code&gt;7 4 2 2 5 8&lt;/code&gt; with the encoder &lt;code&gt;1212003&lt;/code&gt; is then converted to &lt;code&gt;17 24 12 22 05 08&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;With a shorter encoder (say &lt;code&gt;121&lt;/code&gt;), this step will &amp;quot;wrap around&amp;quot;, so &lt;code&gt;7 4 2 2 5 8&lt;/code&gt; with the encoder &lt;code&gt;121&lt;/code&gt; will end up with &lt;code&gt;17 24 12 12 25 18&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;We then change the TSO back into readable characters, using the same &amp;quot;base 9&amp;quot; method.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The two examples &lt;code&gt;17 24 12 22 05 08&lt;/code&gt; and &lt;code&gt;17 24 12 12 25 18&lt;/code&gt; will be converted to &lt;code&gt;QWLUEI&lt;/code&gt; and &lt;code&gt;QWLLXR&lt;/code&gt; respectively.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;So, in summary:&lt;/p&gt;&#xA;&lt;p&gt;Encoder: &lt;code&gt;121&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Message: &lt;code&gt;hello1&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;hello1 =&amp;gt; 07 04 12 12 15 28 =&amp;gt; 7 4 2 2 5 8 =&amp;gt; 17 24 12 12 25 18 =&amp;gt; QWLLXR&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is code-golf, so shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;h1&gt;META&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is really confusing, and I don't really know how to phrase the &amp;quot;how the encoding works&amp;quot; bit better. Can anyone help me phrase this better? I can offer clarification on certain things if needed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-06-23T11:19:32.810" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9425" PostTypeId="1" CreationDate="2016-06-23T14:41:18.040" Score="11" ViewCount="645" Body="&lt;p&gt;I will mainly speak about the programming language &lt;a href=&quot;https://www.lua.org/about.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Lua&lt;/a&gt;, because that's where this question comes from.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In Lua, everything but &lt;code&gt;nil&lt;/code&gt; and &lt;code&gt;false&lt;/code&gt; &lt;a href=&quot;https://www.lua.org/pil/2.2.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;evaluates to true&lt;/a&gt;, it means that even &lt;code&gt;0&lt;/code&gt; or an empty string are true. In the first case, there's no doubt about it: it's a truthy value as of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2194/41019&quot;&gt;PPCG's definition&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The empty string is a little bit problematic. If I have to output a truthy value in some cases, writing &lt;code&gt;os.write&quot;&quot;&lt;/code&gt; can be my best option to do the stuff, but it has &lt;strong&gt;no feedback&lt;/strong&gt; to the user testing the program, not even a newline or a space. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You couldn't say if it outputted or not, unless you redirect its output to a truth machine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other side, it technically outputs to stdin the representation of an object of type string, which always evaluates to true.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As commented by @MartinEnder, this is only a particular case of a bigger question: What's our stance on outputting to stdin/printing a truthy/falsy value when its string representation is an empty string.&lt;/p&gt;&#xA;" OwnerUserId="41019" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2016-06-27T09:27:56.080" Title="Empty string as a truthy value" Tags="|discussion|" AnswerCount="1" CommentCount="5" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9427" PostTypeId="2" ParentId="9425" CreationDate="2016-06-23T15:58:35.287" Score="10" Body="&lt;p&gt;I'm not going to distinguish empty strings as truthy or falsy outputs here - just because &lt;em&gt;some&lt;/em&gt; popular languages consider them falsy is no reason to bias this discussion one way or the other. So...&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Yes, this is fine, provided that...&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;...two conditions are met:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The interpretation must be consistent with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2194/8478&quot;&gt;your language's interpretation&lt;/a&gt; of the truthiness/falsiness of the empty string (or empty list, if that also prints nothing). If your language considers the empty string to be truthy, you don't get to use it as a falsy output and vice versa.&lt;/li&gt;&#xA;&lt;li&gt;Your output format must be unambiguous. This is a very important rule that we &lt;em&gt;always&lt;/em&gt; apply implicitly, regardless of what we're actually outputting. Pretty much all of the issues that could arise from using empty strings for output are covered by this.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;I'll elaborate a bit on that second part. When the challenge asks you to output a list of integers in any convienient format, you're not allowed to just print those integers back to back. There's no way to reconstruct where one numbers ends and the next begins. We require unambiguous separators (which also means you can't separate them with other digits).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The same applies here. As long as you choose an output format that a) complies with the challenge spec and b) allows a user to infer the result of the computation unambiguously, you can use empty strings as output. Some examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A challenge asks you to print a single truthy/falsy value. If the empty string is falsy and every non-empty string is truthy, there is no potential for confusion of the output.&lt;/li&gt;&#xA;&lt;li&gt;A challenge asks you to print a single truthy/falsy value for valid input and nothing at all for invalid input. In this case you cannot use the empty string as a truthy/falsy value, because it's indistinguishable from printing nothing at all (which is something your program should be able to do for different inputs).&lt;/li&gt;&#xA;&lt;li&gt;A challenge asks you to print a list of truthy/falsy values. You may use an empty string for one of them (depending on your language), but you &lt;em&gt;have&lt;/em&gt; to print a separator between every pair of values so that one can infer the empty strings from adjacent separators. Having a trailing separator after &lt;em&gt;each&lt;/em&gt; value (analogous to &lt;code&gt;1\n2\n3\n&lt;/code&gt;) is still fine as long as its used consistently (because then you know that the empty string after the last separator does not ever represent a value).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Of course all of those things equally apply to challenges that ask you to print a string which might potentially be empty. We'd be handling those cases exactly the same way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One last thing: when you &lt;em&gt;do&lt;/em&gt; output an empty string, you &lt;em&gt;are&lt;/em&gt; allowed not to print anything. Your code doesn't need to contain &lt;code&gt;print ''&lt;/code&gt; if omitting it gives the exact same output. I believe this has been used occasionally in programs that handle certain inputs by terminating with an error (which doesn't print to STDOUT). Only the observable behaviour is relevant.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2016-06-24T10:59:01.710" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9428" PostTypeId="1" AcceptedAnswerId="9429" CreationDate="2016-06-23T17:21:41.103" Score="51" ViewCount="3482" Body="&lt;p&gt;Prompted by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5878/what-character-encodings-may-a-submission-use/9411?noredirect=1#comment28000_9411&quot;&gt;this&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question of APL's encoding often comes up, and many times a helpful soul links to Wikipedia's article on the &lt;a href=&quot;https://en.wikipedia.org/wiki/APL_(codepage)&quot; rel=&quot;nofollow noreferrer&quot;&gt;APL EBCDIC codepage&lt;/a&gt;. However, each implementation of APL has its own encoding rules. What are they?&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2018-10-26T09:40:28.163" Title="When can APL characters be counted as 1 byte each?" Tags="|discussion|policy|answers|defaults|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9429" PostTypeId="2" ParentId="9428" CreationDate="2016-06-23T17:21:41.103" Score="59" Body="&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://www.gnu.org/software/apl/apl.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;GNU APL&lt;/a&gt; and &lt;a href=&quot;https://github.com/ngn/apl&quot; rel=&quot;nofollow noreferrer&quot;&gt;ngn/apl&lt;/a&gt; use UTF-8, so use a &lt;a href=&quot;https://mothereff.in/byte-counter&quot; rel=&quot;nofollow noreferrer&quot;&gt;byte counting tool&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://wiki.nars2000.org/index.php/Unicode&quot; rel=&quot;nofollow noreferrer&quot;&gt;NARS2000&lt;/a&gt; only uses UCS-2, so 2 bytes per character.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://books.google.co.uk/books?id=jJsMBwAAQBAJ&amp;amp;lpg=PA45&amp;amp;ots=bSV4Kn0wF0&amp;amp;dq=apl2%20ebcdic&amp;amp;pg=PA45#v=onepage&amp;amp;q=apl2%20ebcdic&amp;amp;f=false&quot; rel=&quot;nofollow noreferrer&quot;&gt;IBM's APL2&lt;/a&gt; is the only modern APL that natively supports &lt;a href=&quot;https://en.wikipedia.org/wiki/APL_(codepage)&quot; rel=&quot;nofollow noreferrer&quot;&gt;APL EBCDIC&lt;/a&gt;, so 1 byte per character.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://help.dyalog.com/15.0/Content/Language/System%20Functions/avu.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Dyalog APL&lt;/a&gt; uses any Unicode format, or the &lt;a href=&quot;http://help.dyalog.com/15.0/Content/Language/System%20Functions/av.htm#kanchor1235&quot; rel=&quot;nofollow noreferrer&quot;&gt;classic Dyalog character set&lt;/a&gt; (&lt;em&gt;Table 1&lt;/em&gt; below).*&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://aplwiki.com/AplToUnicode&quot; rel=&quot;nofollow noreferrer&quot;&gt;APL+&lt;/a&gt; only uses its own 256 character set (&lt;em&gt;Table 2&lt;/em&gt; below), so 1 byte per character.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://www.microapl.co.uk/apl/&quot; rel=&quot;nofollow noreferrer&quot;&gt;APLX&lt;/a&gt; uses its own 256 character set (&lt;em&gt;Table 3&lt;/em&gt; below), so 1 byte per character.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://probablyprogramming.com/2009/07/11/the-aplus-programming-language&quot; rel=&quot;nofollow noreferrer&quot;&gt;A+&lt;/a&gt; uses its own 256 character set (&lt;em&gt;Table 4&lt;/em&gt; below), so 1 byte per character.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://github.com/dzaima/APL&quot; rel=&quot;nofollow noreferrer&quot;&gt;dzaima/APL&lt;/a&gt; uses its own 256 character set (&lt;em&gt;Table 6&lt;/em&gt; below), so 1 byte per character.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://github.com/DennisMitchell/jelly/wiki&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt; and &lt;a href=&quot;https://github.com/DennisMitchell/m&quot; rel=&quot;nofollow noreferrer&quot;&gt;M&lt;/a&gt; use the 257 character &lt;a href=&quot;https://github.com/DennisMitchell/jelly/wiki/Code-page&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly codepage&lt;/a&gt; (&lt;em&gt;Table 5&lt;/em&gt; below), so 1 byte per character.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://fastarray.appspot.com/default.html#table2&quot; rel=&quot;nofollow noreferrer&quot;&gt;ELI&lt;/a&gt;, &lt;a href=&quot;http://www.jsoftware.com/help/dictionary/vocabul.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;J&lt;/a&gt;, &lt;a href=&quot;https://en.wikipedia.org/wiki/K_(programming_language)&quot; rel=&quot;nofollow noreferrer&quot;&gt;K&lt;/a&gt;, &lt;a href=&quot;https://github.com/kevinlawler/kona&quot; rel=&quot;nofollow noreferrer&quot;&gt;Kona&lt;/a&gt;, &lt;a href=&quot;https://github.com/JohnEarnest/ok&quot; rel=&quot;nofollow noreferrer&quot;&gt;oK&lt;/a&gt;, &lt;a href=&quot;https://en.wikipedia.org/wiki/Nial&quot; rel=&quot;nofollow noreferrer&quot;&gt;Nial&lt;/a&gt;, and &lt;a href=&quot;https://en.wikipedia.org/wiki/Q_(programming_language_from_Kx_Systems)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Q&lt;/a&gt;  all use ASCII, so 1 byte per character.&#xA;&lt;hr&gt;&#xA;&lt;sup&gt;*&amp;ensp;Three glyphs added in each of versions 14.0 (&lt;code&gt;⌸&lt;/code&gt;, &lt;code&gt;⍤&lt;/code&gt;, and &lt;code&gt;⍠&lt;/code&gt;) and 16.0 (&lt;code&gt;⌺&lt;/code&gt;, &lt;code&gt;⊆&lt;/code&gt;, and &lt;code&gt;⍸&lt;/code&gt;) are not included in the set, but &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14330/43319&quot;&gt;may be counted as one byte each&lt;/a&gt; by referring to &lt;a href=&quot;https://github.com/abrudz/SBCS&quot; rel=&quot;nofollow noreferrer&quot;&gt;SBCS&lt;/a&gt;, except if the code simultaneously uses any of the characters &lt;code&gt;£&lt;/code&gt;, &lt;code&gt;¢&lt;/code&gt;, &lt;code&gt;¥&lt;/code&gt;, &lt;code&gt;ý&lt;/code&gt;, &lt;code&gt;ɫ&lt;/code&gt;, and &lt;code&gt;·&lt;/code&gt;. If it does, then they must be counted as if they were written:&lt;br&gt;&#xA; &lt;code&gt;⌸&lt;/code&gt;⇒&lt;code&gt;⎕U2338&lt;/code&gt; &lt;code&gt;⍤&lt;/code&gt;⇒&lt;code&gt;⎕U2364&lt;/code&gt; &lt;code&gt;⍠&lt;/code&gt;⇒&lt;code&gt;⎕OPT&lt;/code&gt; &lt;br&gt;&#xA; &lt;code&gt;⊆&lt;/code&gt;⇒&lt;code&gt;⎕U2286&lt;/code&gt; &lt;code&gt;⌺&lt;/code&gt;⇒&lt;code&gt;⎕U233A&lt;/code&gt; &lt;code&gt;⍸&lt;/code&gt;⇒&lt;code&gt;⎕U2378&lt;/code&gt;&lt;br&gt;&#xA;Remember that these longer names need to be followed by a space if the next character is alphanumeric.&lt;/sup&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;hr&gt;&lt;strong&gt;Table 1:&lt;/strong&gt; Unicode code points for every byte value in the classic Dyalog APL encoding.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;┌──┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┐&#xA;│  │00  │01  │02  │03  │04  │05  │06  │07  │08  │09  │0A  │0B  │0C  │0D  │0E  │0F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│00│00  │08  │0A  │0D  │20  │0C  │06  │07  │1B  │09  │2336│026B│25  │27  │237A│2375│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│10│5F  │61  │62  │63  │64  │65  │66  │67  │68  │69  │6A  │6B  │6C  │6D  │6E  │6F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│20│70  │71  │72  │73  │74  │75  │76  │77  │78  │79  │7A  │01  │02  │AF  │2E  │236C│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│30│30  │31  │32  │33  │34  │35  │36  │37  │38  │39  │03  │22A2│A5  │24  │A3  │A2  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│40│2206│41  │42  │43  │44  │45  │46  │47  │48  │49  │4A  │4B  │4C  │4D  │4E  │4F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│50│50  │51  │52  │53  │54  │55  │56  │57  │58  │59  │5A  │04  │05  │FD  │B7  │7F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│60│2359│C1  │C2  │C3  │C7  │C8  │CA  │CB  │CC  │CD  │CE  │CF  │D0  │D2  │D3  │D4  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│70│D5  │D9  │DA  │DB  │DD  │FE  │E3  │EC  │F0  │F2  │F5  │7B  │20AC│7D  │22A3│2337│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│80│A8  │C0  │C4  │C5  │C6  │2368│C9  │D1  │D6  │D8  │DC  │DF  │E0  │E1  │E2  │E4  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│90│E5  │E6  │E7  │E8  │E9  │EA  │EB  │ED  │EE  │EF  │F1  │5B  │2F  │233F│5C  │2340│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│A0│3C  │2264│3D  │2265│3E  │2260│2228│2227│2D  │2B  │F7  │D7  │3F  │220A│2374│7E  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│B0│2191│2193│2373│25CB│2A  │2308│230A│2207│2218│28  │2282│2283│2229│222A│22A5│22A4│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│C0│7C  │3B  │2C  │2371│2372│2352│234B│2349│233D│2296│235F│2339│21  │2355│234E│236B│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│D0│236A│2261│2262│F3  │F4  │F6  │F8  │22  │23  │1E  │26  │B4  │2518│2510│250C│2514│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│E0│253C│2500│251C│2524│2534│252C│2502│40  │F9  │FA  │FB  │5E  │FC  │60  │2223│B6  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│F0│3A  │2377│BF  │A1  │22C4│2190│2192│235D│29  │5D  │1F  │A0  │A7  │2395│235E│2363│&#xA;└──┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┘&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;hr&gt;&lt;strong&gt;Table 2:&lt;/strong&gt; Unicode code points for every byte value in the APL+ character set.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;┌──┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┐&#xA;│  │00  │01  │02  │03  │04  │05  │06  │07  │08  │09  │0A  │0B  │0C  │0D  │0E  │0F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│00│00  │01  │02  │2377│22C4│A8  │2190│07  │08  │09  │0A  │2282│0C  │0D  │2283│235F│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│10│10  │11  │12  │236B│14  │15  │236C│2375│2191│2193│2192│1B  │22A3│22A2│234B│2352│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│20│20  │21  │22  │23  │24  │25  │26  │27  │28  │29  │2A  │2B  │2C  │2D  │2E  │2F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│30│30  │31  │32  │33  │34  │35  │36  │37  │38  │39  │3A  │3B  │3C  │3D  │3E  │3F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│40│40  │41  │42  │43  │44  │45  │46  │47  │48  │49  │4A  │4B  │4C  │4D  │4E  │4F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│50│50  │51  │52  │53  │54  │55  │56  │57  │58  │59  │5A  │5B  │5C  │5D  │5E  │5F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│60│60  │61  │62  │63  │64  │65  │66  │67  │68  │69  │6A  │6B  │6C  │6D  │6E  │6F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│70│70  │71  │72  │73  │74  │75  │76  │77  │78  │79  │7A  │7B  │A6  │7D  │7E  │7F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│80│C7  │FC  │E9  │E2  │E4  │E0  │2260│E7  │EA  │EB  │E8  │EF  │EE  │2308│C4  │230A│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│90│C9  │2206│D7  │F4  │F6  │2395│FB  │235E│2339│D6  │DC  │A2  │A3  │3F  │236A│2368│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│A0│E1  │ED  │F3  │FA  │F1  │D1  │235D│2340│BF  │2337│151 │F8  │FD  │A1  │AB  │BB  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│B0│2395│2395│2395│7C  │7C  │7C  │7C  │2B  │2B  │7C  │7C  │2B  │2B  │2B  │2B  │2B  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│C0│C0  │C1  │C2  │C3  │C4  │C5  │C6  │C7  │C8  │C9  │CA  │CB  │CC  │CD  │CE  │CF  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│D0│2D  │D1  │D2  │D3  │D4  │D5  │D6  │2B  │D8  │D9  │DA  │DB  │DC  │DD  │7C  │FF  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│E0│237A│DF  │2373│2364│E3  │2371│22A5│22A4│233D│2296│2372│233F│2207│2349│220A│236B│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│F0│2261│2359│2265│2264│2355│234E│F7  │22  │2218│25CB│2228│2374│2229│AF  │7C  │00  │&#xA;└──┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┘&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Table 3:&lt;/strong&gt; Unicode code points for every byte value in the APLX character set:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;┌──┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┐&#xA;│  │00  │01  │02  │03  │04  │05  │06  │07  │08  │09  │0A  │0B  │0C  │0D  │0E  │0F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│00│    │    │    │    │    │    │    │2350│08  │2357│0A  │2347│2348│0D  │2371│2372│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│10│2352│234B│233D│2349│2296│235F│2336│236B│234E│2355│2340│233F│235D│235E│21  │2339│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│20│20  │A8  │29  │3C  │2264│3D  │3E  │5D  │2228│5E  │2260│F7  │2C  │2B  │2E  │2F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│30│30  │31  │32  │33  │34  │35  │36  │37  │38  │39  │28  │5B  │3B  │D7  │3A  │5C  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│40│AF  │237A│22A5│2229│230A│220A│5F  │2207│7B  │2373│2218│27  │2395│7C  │22A4│25CB│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│50│2A  │3F  │2374│2308│7E  │2193│222A│2375│2283│2191│2282│2190│22A2│2192│2265│2D  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│60│22C4│41  │42  │43  │44  │45  │46  │47  │48  │49  │4A  │4B  │4C  │4D  │4E  │4F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│70│50  │51  │52  │53  │54  │55  │56  │57  │58  │59  │5A  │2206│22A3│236A│24  │7D  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│80│    │    │    │    │    │    │    │    │    │    │    │    │    │    │    │    │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│90│250C│2510│2514│2518│2500│2502│253C│251C│2524│2534│252C│1B  │1C  │CD  │1E  │1F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│A0│22  │23  │25  │26  │40  │A3  │60  │2261│2262│2377│2378│233B│2342│2364│2365│2337│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│B0│C4  │C5  │C7  │C9  │D1  │D6  │DC  │E1  │E0  │E2  │E4  │E3  │E5  │E7  │E9  │E8  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│C0│EA  │EB  │ED  │EC  │EE  │EF  │F1  │F3  │F2  │F4  │F6  │F5  │FA  │F9  │FB  │FC  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│D0│C0  │C3  │D5  │0152│0153│C6  │E6  │236C│D8  │F8  │BF  │A1  │DF  │FF  │00  │00  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│E0│00  │61  │62  │63  │64  │65  │66  │67  │68  │69  │6A  │6B  │6C  │6D  │6E  │6F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│F0│70  │71  │72  │73  │74  │75  │76  │77  │78  │79  │7A  │2359│C8  │20AC│00  │7F  │&#xA;└──┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┘&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;hr&gt;&lt;strong&gt;Table 4:&lt;/strong&gt; Unicode code points for every byte value in the A+ character set.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;┌──┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┐&#xA;│  │00  │01  │02  │03  │04  │05  │06  │07  │08  │09  │0A  │0B  │0C  │0D  │0E  │0F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│00│00  │01  │02  │03  │04  │05  │06  │07  │08  │09  │0A  │0B  │0C  │0D  │0E  │0F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│10│10  │11  │12  │13  │14  │15  │16  │17  │18  │19  │1A  │1B  │1C  │1D  │1E  │1F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│20│20  │21  │22  │23  │24  │25  │26  │27  │28  │29  │2A  │2B  │2C  │2D  │2E  │2F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│30│30  │31  │32  │33  │34  │35  │36  │37  │38  │39  │3A  │3B  │3C  │3D  │3E  │3F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│40│40  │41  │42  │43  │44  │45  │46  │47  │48  │49  │4A  │4B  │4C  │4D  │4E  │4F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│50│50  │51  │52  │53  │54  │55  │56  │57  │58  │59  │5A  │5B  │5C  │5D  │2227│5F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│60│60  │61  │62  │63  │64  │65  │66  │67  │68  │69  │6A  │6B  │6C  │6D  │6E  │6F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│70│70  │71  │72  │73  │74  │75  │76  │77  │78  │79  │7A  │7B  │7C  │7D  │7E  │7F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│80│80  │81  │82  │83  │84  │85  │86  │87  │88  │89  │8A  │8B  │8C  │8D  │8E  │8F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│90│90  │91  │92  │93  │94  │95  │96  │97  │98  │99  │9A  │9B  │9C  │9D  │9E  │9F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│A0│A0  │A8  │AF  │A3  │2264│A5  │2265│A7  │2260│2228│    │D7  │236A│2339│2368│233F│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│B0│2372│A1  │    │A3  │A5  │    │B6  │B7  │    │2371│    │    │    │2261│2337│BF  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│C0│    │237A│22A5│2229│230A│220A│    │2207│2206│2373│2218│    │2395│7C  │22A4│25CB│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│D0│    │    │2374│2308│    │2193│222A│2375│2283│2191│2282│22A2│2340│22A3│    │F7  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│E0│2336│2296│234E│235D│    │2377│236B│2352│234B│ED  │    │    │235E│    │2355│    │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│F0│235F│    │    │    │2349│    │    │233D│    │    │A2  │2190│2359│2192│22C4│    │&#xA;└──┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┘&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;hr&gt;&lt;strong&gt;Table 5:&lt;/strong&gt; Unicode code points for every byte value in the Jelly encoding.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;┌──┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┐&#xA;│  │00  │01  │02  │03  │04  │05  │06  │07  │08  │09  │0A  │0B  │0C  │0D  │0E  │0F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│00│A1  │A2  │A3  │A4  │A5  │A6  │A9  │AC  │AE  │B5  │BD  │BF  │20AC│C6  │C7  │D0  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│10│D1  │D7  │D8  │0152│DE  │DF  │E6  │E7  │F0  │0131│0237│F1  │F7  │F8  │0153│FE  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│20│20  │21  │22  │23  │24  │25  │26  │27  │28  │29  │2A  │2B  │2C  │2D  │2E  │2F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│30│30  │31  │32  │33  │34  │35  │36  │37  │38  │39  │3A  │3B  │3C  │3D  │3E  │3F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│40│40  │41  │42  │43  │44  │45  │46  │47  │48  │49  │4A  │4B  │4C  │4D  │4E  │4F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│50│50  │51  │52  │53  │54  │55  │56  │57  │58  │59  │5A  │5B  │5C  │5D  │5E  │5F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│60│60  │61  │62  │63  │64  │65  │66  │67  │68  │69  │6A  │6B  │6C  │6D  │6E  │6F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│70│70  │71  │72  │73  │74  │75  │76  │77  │78  │79  │7A  │7B  │7C  │7D  │7E  │B6  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│80│B0  │30  │30  │30  │2074│2075│2076│2077│2078│2079│207A│207B│207C│207D│207E│0181│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│90│0187│018A│0191│0193│0198│2C6E│019D│01A4│01AC│01B2│0224│0253│0188│0257│0192│0260│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│A0│0266│0199│0271│0272│01A5│02A0│027C│0282│01AD│028B│0225│1EA0│1E04│1E0C│1EB8│1E24│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│B0│1ECA│1E32│1E36│1E42│1E46│1ECC│1E5A│1E62│1E6C│1EE4│1E7E│1E88│1EF4│1E92│0226│1E02│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│C0│010A│1E0A│0116│1E1E│0120│1E22│0130│013F│1E40│1E44│022E│1E56│1E58│1E60│1E6A│1E86│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│D0│1E8A│1E8E│017B│1EA1│1E05│1E0D│1EB9│1E25│1ECB│1E33│1E37│1E43│1E47│1ECD│1E5B│1E63│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│E0│1E6D│A7  │C4  │1E89│1EF5│1E93│0227│1E03│010B│1E0B│0117│1E1F│0121│1E23│0140│1E41│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│F0│1E45│022F│1E57│1E59│1E61│1E6B│1E87│1E8B│1E8F│017C│AB  │BB  │2018│2019│201C│201D│&#xA;└──┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┘&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;hr&gt;&lt;strong&gt;Table 6:&lt;/strong&gt; Unicode code points for every byte value in the dzaima/APL encoding.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;┌──┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┐&#xA;│  │00  │01  │02  │03  │04  │05  │06  │07  │08  │09  │0A  │0B  │0C  │0D  │0E  │0F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│00│00  │    │    │    │    │    │    │    │    │09  │0A  │    │    │    │    │    │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│10│    │    │    │    │    │    │    │    │    │    │    │    │    │    │    │    │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│20│20  │21  │22  │23  │24  │25  │26  │27  │28  │29  │2A  │2B  │2C  │2D  │2E  │2F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│30│30  │31  │32  │33  │34  │35  │36  │37  │38  │39  │3A  │3B  │3C  │3D  │3E  │3F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│40│40  │41  │42  │43  │44  │45  │46  │47  │48  │49  │4A  │4B  │4C  │4D  │4E  │4F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│50│50  │51  │52  │53  │54  │55  │56  │57  │58  │59  │5A  │5B  │5C  │5D  │5E  │5F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│60│60  │61  │62  │63  │64  │65  │66  │67  │68  │69  │6A  │6B  │6C  │6D  │6E  │6F  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│70│70  │71  │72  │73  │74  │75  │76  │77  │78  │79  │7A  │7B  │7C  │7D  │7E  │F7  │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│80│D7  │2191│2193│2308│230A│2260│220A│237A│2374│2375│2373│220D│22FE│2395│235E│2338│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│90│233A│2347│2341│2342│233B│233C│2343│2344│2348│234C│234D│2350│2353│2354│2357│236F│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│A0│2370│2360│2339│2286│2287│2376│2378│2379│2358│235A│235B│235C│234A│2264│2265│236E│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│B0│03FC│2377│2349│233D│2296│2299│233E│25CB│2218│235F│2297│A8  │2368│2361│2365│2369│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│C0│2363│2362│2364│2282│2283│2229│222A│22A5│22A4│2206│2207│2352│234B│236B│2371│2372│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│D0│2228│2227│236C│22A3│22A2│2337│2355│234E│2190│2192│2345│2346│234F│2356│233F│2340│&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│E0│236A│2261│2262│2366│2367│236D│203D│2351│221E│2026│221A│    │    │    │    │    │&#xA;├──┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┤&#xA;│F0│    │    │    │    │    │    │    │    │    │    │    │    │    │    │    │    │&#xA;└──┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┘&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2018-10-26T09:40:28.163" LastActivityDate="2018-10-26T09:40:28.163" CommentCount="15" ContentLicense="CC BY-SA 4.0" />
  <row Id="9430" PostTypeId="2" ParentId="2140" CreationDate="2016-06-23T18:52:33.640" Score="5" Body="&lt;h2&gt;Count the Cats &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/counting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;counting&amp;#39;&quot; rel=&quot;tag&quot;&gt;counting&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a cat:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/W7urd.jpg&quot; width=&quot;200&quot; height=&quot;200&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Specifically, that is my cat. She is my only cat. And, in that image, there is only one cat: her.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These are also cats (&lt;a href=&quot;https://www.flickr.com/photos/suetupling/2800697500&quot; rel=&quot;nofollow noreferrer&quot;&gt;image credit&lt;/a&gt;):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/7A3Tu.jpg&quot; width=&quot;200&quot; height=&quot;200&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In that picture, there are two cats. It is relatively easy to count them, thanks to their distinct coloring.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a picture of 5 cats (&lt;a href=&quot;https://commons.wikimedia.org/wiki/File:Laitche-P013.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;image credit&lt;/a&gt;):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/8/8a/Laitche-P013.jpg&quot; width=&quot;200&quot; height=&quot;200&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's harder to differentiate the cats because of their similar coloring, but there are definitely 5.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a landscape (&lt;a href=&quot;https://commons.wikimedia.org/wiki/File:Cumulus_Clouds_over_Yellow_Prairie2.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;image credit&lt;/a&gt;):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/5/57/Cumulus_Clouds_over_Yellow_Prairie2.jpg&quot; width=&quot;200&quot; height=&quot;200&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are no cats in this image.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an image, output the number of cats in the image.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Submissions must output and terminate within 1 minute for a single image.&lt;/li&gt;&#xA;&lt;li&gt;Any common image format is acceptable for input, as long as no additional data (such as the number of cats present in the image) is encoded in the format.&lt;/li&gt;&#xA;&lt;li&gt;Submissions must be fully deterministic, and make a genuine attempt at counting the cats. Outputting a random number or a consistent but unrelated number (such as the value of the last hex digit of the SHA-256 hash of the image data) is not allowed.&lt;/li&gt;&#xA;&lt;li&gt;The images in the test cases will contain no animals besides cats. There may or may not be humans in the images - they are not cats, and thus should not be counted as cats.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The score for a single image is the square of the difference between the true number of cats in the image and the output of the submission (&lt;code&gt;(actual - output)**2&lt;/code&gt;). The total score is the sum of all of the individual scores. The submission with the &lt;em&gt;lowest&lt;/em&gt; score wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[scoring images TBD]&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2016-06-30T04:34:41.700" LastActivityDate="2016-06-30T04:34:41.700" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="9431" PostTypeId="2" ParentId="2140" CreationDate="2016-06-23T19:41:44.410" Score="2" Body="&lt;p&gt;Still to-do:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;s&gt;Add more test cases&lt;/li&gt;&#xA;&lt;li&gt;&lt;s&gt;Make input requirements a little looser&lt;/s&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;s&gt;Make output requirements looser&lt;/s&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;s&gt;Specify that a full program is &lt;em&gt;not&lt;/em&gt; required&lt;/s&gt;&lt;/li&gt;&#xA;&lt;li&gt;Change the name of gem-elements maybe?&lt;/s&gt;&lt;/li&gt;&#xA;&lt;li&gt;Come up with a title&lt;/li&gt;&#xA;&lt;li&gt;Come up with a cool story&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I saw this as a problem over on CodeReview, &lt;a href=&quot;https://codereview.stackexchange.com/q/61242/71148&quot;&gt;here&lt;/a&gt; is the original question. I thought it would be fun to golf.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;You have discovered various rocks. Each rock is composed of various elements, and each element is represented by a lowercase letter from '&lt;code&gt;a&lt;/code&gt;' to '&lt;code&gt;z&lt;/code&gt;'. The same element can be present multiple times in a rock. An element is called a 'common-element' if it occurs at least once in each of the rocks. Given the list of rocks you have to determine how many different kinds of common-elements you have.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Input Format&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each rock is a string which consists of lowercase letters from '&lt;code&gt;a&lt;/code&gt;' to '&lt;code&gt;z&lt;/code&gt;' representing elements&lt;/li&gt;&#xA;&lt;li&gt;You can take the strings in whatever way is easy for you (lines from STDIN, pipe delimited STDIN, array of strings as a method param, etc.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Output Format&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The number of different types of common-elements for the given list of rocks. This can be as an integer or string&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Constraints&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There will always be at least one rock&lt;/li&gt;&#xA;&lt;li&gt;Each rock will always have at least one element&lt;/li&gt;&#xA;&lt;li&gt;You do &lt;em&gt;not&lt;/em&gt; need to make a full program (functions &amp;amp; methods are allowed)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Sample Input&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abcdde&#xA;baccd&#xA;eeabg &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Sample Output&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Explanation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Only '&lt;code&gt;a&lt;/code&gt;' and '&lt;code&gt;b&lt;/code&gt;' are common-elements since these are the only characters that occur in each of the rocks' composition.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;More test cases&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a&#xA;&#xA;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;aa&#xA;&#xA;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;aa&#xA;aa&#xA;&#xA;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;zyxabc&#xA;&#xA;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abc&#xA;def&#xA;&#xA;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abc&#xA;a&#xA;&#xA;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abc&#xA;ab&#xA;cb&#xA;&#xA;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abc&#xA;cba&#xA;&#xA;3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abcdefghijklmnopqrstuvwxyz&#xA;qwertyuiopasdfghjklzxcvbnm&#xA;&#xA;26&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;defabc&#xA;bfgcde&#xA;chfgde&#xA;gedfhi&#xA;fgiejh&#xA;&#xA;2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="36915" LastEditorUserId="-1" LastEditDate="2017-04-13T12:41:04.080" LastActivityDate="2016-08-16T12:50:14.317" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9432" PostTypeId="2" ParentId="2140" CreationDate="2016-06-24T10:19:05.190" Score="0" Body="&lt;h2&gt;Find all the Vampire numbers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Shamelessly stolen from &lt;a href=&quot;https://stackoverflow.com/q/17352108&quot;&gt;https://stackoverflow.com/q/17352108&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &quot;Vampire&quot; number is defined as the product of two numbers of equal length (known as the &quot;fangs&quot;) that uses the same digits as the two numbers being multiplied. Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;21 * 60 = 1260&#xA;15 * 93 = 1395&#xA;30 * 51 = 1530&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your task is to find all the Vampire numbers whose fangs have &lt;code&gt;n&lt;/code&gt; digits.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest solution wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2016-06-24T10:19:05.190" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9435" PostTypeId="2" ParentId="2140" CreationDate="2016-06-24T18:31:24.257" Score="0" Body="&lt;h1&gt;Forecast Romantic Dates&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/83696/31625&quot;&gt;Sort of inspired by this.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A Romantic date is a date that, when the year, month and day are converted to &lt;a href=&quot;https://en.wikipedia.org/wiki/Roman_numerals&quot; rel=&quot;nofollow noreferrer&quot;&gt;Roman Numerals&lt;/a&gt; the individual values contain no more than two symbols. For example, in &lt;code&gt;YY-MM-DD&lt;/code&gt; format: the Romantic date &lt;code&gt;20-04-15&lt;/code&gt; would become &lt;code&gt;XX-IV-XV&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the purpose of this challenge, years will only be tracked by the two least significant digits of the year, as otherwise the last Romantic date was in the 15th century. In addition, they wouldn't add much to the challenge as the omissions of the leap year every 400 years is irrelevant, as February the 29th is not a Romantic date.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Romantic dates&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For your convenience, here is a list of all of the two digit numbers that can be represented with two or fewer symbols in Roman numerals:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1, 2, 4, 5, 6, 9, 10, 11, 15, 20, 40, 50, 51, 55, 60]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;These were determined using the &quot;standard method&quot; that negative groups would only be used with the symbols that are powers of ten and only on the values that are five or ten times that symbol's value. So &lt;code&gt;I&lt;/code&gt; only combines with &lt;code&gt;V&lt;/code&gt; and &lt;code&gt;X&lt;/code&gt; for example.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Dates which include only numbers from this list are Romantic dates. For the purpose of this challenge, assume an ideal Western calendar: no dates are ever skipped or repeated, 12 months per year, and more than 20 days per month. Assume there is no year, month or day zero (i.e. year 99 loops to 1 not to 0).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a date as input, output that date if it is Romantic, or output the next Romantic date.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input and Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You may accept input in any consistent ordering of year, month and day with any consistent separator. You may specify if the input should have the numbers padded to be two digits. If the numbers are padded, you may choose to have no separator. Your output must have the same form as your input.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The following test cases are all in the format &lt;code&gt;YY MM DD&lt;/code&gt;, with no padding.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 1 1 =&amp;gt; 1 1 1&#xA;20 4 3 =&amp;gt; 20 4 4&#xA;15 7 1 =&amp;gt; 15 9 1&#xA;51 9 7 =&amp;gt; 51 9 9&#xA;70 9 7 =&amp;gt; 1 1 1&#xA;20 6 24 =&amp;gt; 20 9 1&#xA;47 12 1 =&amp;gt; 50 1 1&#xA;60 11 24 =&amp;gt; 1 1 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://repl.it/C5mj/1&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt; is the script that I used to generate these.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Did I miss any Romantic numbers? I just did that by hand.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Allow unary? I'm unsure about this because it sort of violates the reasoning behind Romantic dates for the values to have &gt;2 symbols...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should I explain more about parts of dates that are not useful? For example, the length of the months is entirely irrelevant as the later days are all skipped. My concern is that the current one feels clunky already&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should I allow both outputting the input if the date is already Romantic or the strictly next Romantic date (as long as it is consistent)? There doesn't seem to be much different, but I don't know if that'd be too broad? Personally leading towards allowing it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm also somewhat tempted to make use of the silly title a bit more, but I'm not sure if that'd be going overboard.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Too boring / compression based? I've particularly been trying to think of a way for fewer results to wrap back around to 1.&lt;/p&gt;&#xA;" OwnerUserId="31625" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.947" LastActivityDate="2016-06-25T03:08:06.977" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9436" PostTypeId="2" ParentId="2140" CreationDate="2016-06-25T00:13:04.473" Score="0" Body="&lt;h2&gt;Title TBD - Generate Emoticons :)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to create a program that generates the most emoticons using the least amount of code.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The only valid emoticons are listed on Wikipedia, under the heading&#xA;Western/horizontal emoticons: &lt;a href=&quot;https://en.wikipedia.org/w/index.php?title=List_of_emoticons&amp;amp;oldid=722951221&quot; rel=&quot;nofollow noreferrer&quot;&gt;List of emoticons&lt;/a&gt; page (version&#xA;722951221)&lt;/li&gt;&#xA;&lt;li&gt;The output can be any format, as long as a delimiter exists between&#xA;emoticons.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Scores will reflect the &lt;strong&gt;character&lt;/strong&gt; (not byte) count.&lt;/li&gt;&#xA;&lt;li&gt;For every emoticon after 10 that is output by your program, subtract&#xA;&lt;code&gt;1&lt;/code&gt; from your score. Emoticons over 20, subtract &lt;code&gt;2&lt;/code&gt;, over 30&#xA;subtract &lt;code&gt;3&lt;/code&gt;, and so on.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Sandbox&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Is the scoring fair/reasonable?&#xA;Should I edit down the list/create a new list of acceptable emoticons?&lt;/p&gt;&#xA;" OwnerUserId="29961" LastActivityDate="2016-06-25T00:13:04.473" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9438" PostTypeId="1" CreationDate="2016-06-25T13:23:37.943" Score="1" ViewCount="83" Body="&lt;p&gt;If I am interested in asking a question about quining in a specific language, would this be allowed?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am curious as to whether or not its even possible to write such a quine in a certain language.&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="8478" LastEditDate="2016-06-25T18:33:20.427" LastActivityDate="2016-06-25T18:33:20.427" Title="Question about a quine in a specific language" Tags="|discussion|asking-questions|scope|" AnswerCount="0" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9439" PostTypeId="1" CreationDate="2016-06-25T18:01:51.217" Score="4" ViewCount="136" Body="&lt;p&gt;I just realized that on meta, we have lots of tags about asking questions, and very few tags about challenges. For example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/asking-questions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;asking-questions&amp;#39;&quot; rel=&quot;tag&quot;&gt;asking-questions&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/questions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;questions&amp;#39;&quot; rel=&quot;tag&quot;&gt;questions&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/specific-question&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;specific-question&amp;#39;&quot; rel=&quot;tag&quot;&gt;specific-question&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/closed-questions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;closed-questions&amp;#39;&quot; rel=&quot;tag&quot;&gt;closed-questions&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/deleted-question&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;deleted-question&amp;#39;&quot; rel=&quot;tag&quot;&gt;deleted-question&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/unanswered-questions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;unanswered-questions&amp;#39;&quot; rel=&quot;tag&quot;&gt;unanswered-questions&lt;/a&gt; (which ironically has no questions tagged with it). These tags collectively have a little more than a hundred usages.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And on the &quot;Challenge&quot; side, we only have:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/challenge-quality&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;challenge-quality&amp;#39;&quot; rel=&quot;tag&quot;&gt;challenge-quality&lt;/a&gt; (20 usages)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Now, I realize we've already talked about changing &quot;Question&quot; to &quot;Challenge&quot; before. You might want to close this question as a duplicate of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8350/were-not-a-qa-site-but-what-should-be-done-about-it&quot;&gt;We&amp;#39;re not a Q&amp;amp;A site. But what should be done about it?&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, that question is about things that we would &lt;em&gt;like&lt;/em&gt; changed, but can't do anything about without help from SE. The nice thing about this is that changing these tags is &lt;em&gt;completely&lt;/em&gt; within our power to do. We don't need help or approval from SE to do this. Really, we don't even need moderator help to make this happen (although it would certainly help). The only thing we &lt;em&gt;need&lt;/em&gt; to change this is consensus from the community, which it seems like we &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8355/31716&quot;&gt;already have&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So should we change these tags? And more importantly, is it worth the effort? (Since it might take a lot of work to rename/synonymize these tags) &lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-06-29T15:31:56.333" Title="Should we change &quot;Question&quot; to &quot;Challenge&quot; in meta tags?" Tags="|discussion|tags|tag-synonyms|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9440" PostTypeId="2" ParentId="2140" CreationDate="2016-06-25T21:22:35.617" Score="0" Body="&lt;h1&gt;Don't even think about non-42-related numbers!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fibonacci&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fibonacci&amp;#39;&quot; rel=&quot;tag&quot;&gt;fibonacci&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Introduction and Credit&lt;/h2&gt;&#xA;&lt;p&gt;We all love our &lt;a href=&quot;https://en.wikipedia.org/wiki/Phrases_from_The_Hitchhiker%27s_Guide_to_the_Galaxy#Answer_to_the_Ultimate_Question_of_Life.2C_the_Universe.2C_and_Everything_.2842.29&quot; rel=&quot;nofollow noreferrer&quot;&gt;Answer to the Ultimate Question of Life, the Universe, and Everything&lt;/a&gt; which, of course is 42. So let's take this unworthy Fibonacci-Sequence thingy and adapt it to be worthy of 42!&lt;/p&gt;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;The input will be a positive integer.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;The output will be either true or false.&lt;/p&gt;&#xA;&lt;h3&gt;What to do?&lt;/h3&gt;&#xA;&lt;p&gt;Your task is to implement the predicate that the number under consideration is an element of the generalized Fibonacci-Sequence given by:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a_1 = 14&#xA;a_2 = 42&#xA;a_n = 41 * a_{n-1} + 43 * a_{n-2}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Where 42 is the ultimate answer, 41 and 43 are the primes next to it and 14 is the &lt;a href=&quot;https://en.wikipedia.org/wiki/Catalan_number&quot; rel=&quot;nofollow noreferrer&quot;&gt;preceding catalan number&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Potential corner cases&lt;/h3&gt;&#xA;&lt;p&gt;The number will always be greater than zero.&#xA;Your program must pass all (32-bit) test vectors below.&lt;/p&gt;&#xA;&lt;h3&gt;Who wins?&lt;/h3&gt;&#xA;&lt;p&gt;This is code-golf so the shortest answer in bytes wins!&lt;br&gt;&#xA;Standard rules apply of course.&lt;/p&gt;&#xA;&lt;h2&gt;Test Vectors&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;14 -&amp;gt; true&#xA;42 -&amp;gt; true&#xA;2324 -&amp;gt; true&#xA;4080622 -&amp;gt; true&#xA;97090 -&amp;gt; true&#xA;171480372 -&amp;gt; true&#xA;7 -&amp;gt; false&#xA;1 -&amp;gt; false&#xA;41 -&amp;gt; false&#xA;43 -&amp;gt; false&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="55329" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-06-30T13:18:13.630" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9441" PostTypeId="2" ParentId="2140" CreationDate="2016-06-26T07:01:21.227" Score="0" Body="&lt;h1&gt;Stacks and Stacks and Stacks...&lt;/h1&gt;&#xA;&lt;p&gt;Write a program that, with the input as &lt;code&gt;n&lt;/code&gt;, finds the first &lt;code&gt;n&lt;/code&gt;-gonal and &lt;code&gt;n&lt;/code&gt;-gonal pyramid number that is NOT 1.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;n&lt;/code&gt; is guaranteed to be larger than or equal to 3.&lt;/p&gt;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;n = 3&lt;/code&gt;: &lt;code&gt;10&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;n = 4&lt;/code&gt;: &lt;code&gt;4900&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;n = 2&lt;/code&gt;: The output can be nothing, &lt;code&gt;False&lt;/code&gt;, or anything that you want, just as long as it can be distinguished from an actual output.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is &lt;code&gt;code-golf&lt;/code&gt;, so shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;h3&gt;Bonus:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If your code output both the name of the &lt;code&gt;n&lt;/code&gt;-gon and the number: You get a big fat &lt;strong&gt;-50%&lt;/strong&gt; off of your byte count (see below for examples).&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;n = 4&lt;/code&gt;: &lt;code&gt;Square 4900&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;n = 3&lt;/code&gt;: &lt;code&gt;Triangle 10&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;n = 5&lt;/code&gt;: &lt;code&gt;Pentagon ???&lt;/code&gt; (the &lt;code&gt;???&lt;/code&gt; is a placeholder because I have no idea what the number is)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Meta:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the bonus a good idea?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-06-26T07:01:21.227" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9442" PostTypeId="2" ParentId="8350" CreationDate="2016-06-26T11:15:18.793" Score="43" Body="&lt;h2&gt;Don't steer new users into posting challenges&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The SE interface points first-time users to ask a question. The Ask Question button is bolded and the tour is largely about asking. Answering is more tucked away. This makes sense for Q&amp;amp;A where users go for help. But on PPCG, posting a challenge without having participated rarely goes well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Our site design should foremost direct users to&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Answer challenges, and give them guidance on how to do so&lt;/li&gt;&#xA;&lt;li&gt;Post challenges in the Sandbox for feedback rather than directly on the main site&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2016-06-26T11:15:18.793" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9445" PostTypeId="2" ParentId="2140" CreationDate="2016-06-26T20:47:33.293" Score="0" Body="&lt;h1&gt;Pyth Meta-Golf Golf Battery&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(now that's a name, isn't it?)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program in a language of your choice that takes an input of code in the same language and outputs a code that does the same thing in Pyth (though not necessarily the shortest code).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given the test battery set below, you should try to find the best way to minimize your score with the following rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must minimize the source code of the submission.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may not used compressed versions of the input source for each test; the Pyth code must be output procedurally.&lt;/li&gt;&#xA;&lt;li&gt;The code must theoretically do the same conversion for any input code, not necessarily just these test cases.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;You must minimize the input code of each test.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If an input is shown to be shortenable by without non-standard libraries of the submitted language, you must change it immediately to the shorter answer. If your answer does not support this change, then you must change your answer to accommodate.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;You may not submit answers written in Pyth.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Scoring is done with the following equation:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(source code)*((Pyth src out, test 1)/(input src in, test 1)+(same for test 2)+...)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Objectives of each test&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Test 1:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Output the string &quot;Hello, world!&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test 2:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given an integer input, multiply that input by three and output it.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test 3:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Quine. (must be a valid quine in the submitted language and in Pyth)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test 4:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Produce infinite output.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test 5:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Cat program.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastActivityDate="2016-06-26T20:47:33.293" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9447" PostTypeId="2" ParentId="1061" CreationDate="2016-06-27T08:17:44.327" Score="33" Body="&lt;h2&gt;Generating a random stream of output when a specific output is required&lt;/h2&gt;&#xA;&lt;p&gt;For example, if a challenge requires you to output &lt;code&gt;4&lt;/code&gt;, you can't output an infinite stream of random digits, and say &amp;quot;4 is in there somewhere!&amp;quot; You must output &lt;code&gt;4&lt;/code&gt;, and no other number.&lt;/p&gt;&#xA;&lt;p&gt;This is similar to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9034/45941&quot;&gt;this other loophole&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-06-27T10:15:07.790" CommentCount="16" CommunityOwnedDate="2016-06-27T08:17:44.327" ContentLicense="CC BY-SA 3.0" />
  <row Id="9450" PostTypeId="1" AcceptedAnswerId="9451" CreationDate="2016-06-28T01:36:11.927" Score="7" ViewCount="244" Body="&lt;p&gt;If a program prints out null bytes and those null bytes are not part of the specification, does this disqualify the program although these bytes are unreadable?&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="31716" LastEditDate="2016-06-28T17:20:34.683" LastActivityDate="2016-06-29T04:27:38.990" Title="Null Bytes disqualifying submissons" Tags="|discussion|policy|answers|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9451" PostTypeId="2" ParentId="9450" CreationDate="2016-06-28T02:19:40.460" Score="20" Body="&lt;h2&gt;Yes&lt;/h2&gt;&#xA;&lt;p&gt;When a challenge states to output a specific sequence of bytes (such as &lt;code&gt;Hello, World!&lt;/code&gt;), outputting anything else than that exact sequence of bytes is failing to meet the challenge specification. If you can encode the required output in a (pre-existing) encoding such that it matches the output of the submission (comparing raw bytes), it's valid.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-06-29T04:27:38.990" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9452" PostTypeId="2" ParentId="2140" CreationDate="2016-06-28T08:56:02.997" Score="1" Body="&lt;h1&gt;Don't let those functions get away&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;My imaginary language, PremOpt discourages the use of functions. They are the source of every performance problem. Your task today is to fix beginner PremOpt programmer's code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every statement's and loop's (if, switch, while, for) content is enclosed in brackets:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;if/switch/while/for&amp;gt; &amp;lt;statement here&amp;gt; {&#xA;    &amp;lt;stuff&amp;gt;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Switch cases are one liners:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;switch &amp;lt;value&amp;gt; {&#xA;    case &amp;lt;val1&amp;gt;: &amp;lt;statement1&amp;gt;;&#xA;    case &amp;lt;val2&amp;gt;: &amp;lt;statement2&amp;gt;;&#xA;    case &amp;lt;val2&amp;gt;: &amp;lt;statement2&amp;gt;;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Functions look like these:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function &amp;lt;name&amp;gt;(arg1, arg2, arg3) {&#xA;    // Stuff here&#xA;}&#xA;&#xA;// Calling a function:&#xA;&amp;lt;name&amp;gt;(arg1, arg2, arg3);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Other lines end with a semi-colon.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Variables don't need to be declared, they're already initialized to null, you can set a variable to a value with&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;variableName = value;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Outputting a value is done by doing&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;out-&amp;gt;&amp;lt;value&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your input is a string with a piece of code. Each row is separated with a line-feed. The input may or may not contain functions.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You need to remove the functions from the code, and put their content to the where they were called.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function hello() {&#xA;    sayHello1();&#xA;    sayHello2();&#xA;}&#xA;hello();&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;becomes&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;sayHello1();&#xA;sayHello2();&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Multiple function calls:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function func() {&#xA;    doStuff1();&#xA;    doStuff2();&#xA;}&#xA;func();&#xA;func();&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;becomes&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;doStuff1();&#xA;doStuff2();&#xA;doStuff1();&#xA;doStuff2();&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If the function takes in arguments:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function argFunc(arg1, arg2) {&#xA;    doStuffWithArg(arg1);&#xA;    doStuffWithArg2(arg2);&#xA;}&#xA;argFunc(myVar1, myVar2);&#xA;argFunc(myVar3, myVar4);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;then you need to change the arguments inside the function to match with the calling arguments&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;doStuffWithArg(myVar1);&#xA;doStuffWithArg2(myVar2);&#xA;doStuffWithArg(myVar3);&#xA;doStuffWithArg2(myVar4);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;fibonacci sequence:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a = 1;&#xA;b = 1;&#xA;function getNextNumber(num1, num2) {&#xA;    return num1 + num2;&#xA;}&#xA;&#xA;while(true) {&#xA;    a = getNextNumber(a, b);&#xA;    out-&amp;gt;a;&#xA;    b = getNextNumber(a, b);&#xA;    out-&amp;gt;b;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Should become&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a = 1;&#xA;b = 1;&#xA;&#xA;while(true) {&#xA;    a = a + b;&#xA;    out-&amp;gt;a;&#xA;    b = a + b;&#xA;    out-&amp;gt;b;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;FizzBuzz:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;for (counter = 0; counter &amp;lt;= 100; counter++) {&#xA;    checkNumber(counter);&#xA;}&#xA;&#xA;function checkNumber(num) {&#xA;    if (num % 3 == 0  num % 5 == 0) {&#xA;        out-&amp;gt;&quot;Fizz Buzz&quot;;&#xA;    } else if (num % 3 == 0) {&#xA;        out-&amp;gt;&quot;Fizz&quot;&#xA;    } else if (num % 5 == 0) {&#xA;        out-&amp;gt;&quot;Buzz&quot;&#xA;    } else {&#xA;        out-&amp;gt;num;&#xA;    }&#xA;    out-&amp;gt;newLine;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Becomes:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;for (counter = 0; counter &amp;lt;= 100; counter++) {&#xA;    if (counter % 3 == 0  counter % 5 == 0) {&#xA;        out-&amp;gt;&quot;Fizz Buzz&quot;;&#xA;    } else if (counter % 3 == 0) {&#xA;        out-&amp;gt;&quot;Fizz&quot;&#xA;    } else if (counter % 5 == 0) {&#xA;        out-&amp;gt;&quot;Buzz&quot;&#xA;    } else {&#xA;        out-&amp;gt;counter;&#xA;    }&#xA;    out-&amp;gt;newLine;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There'll be no recursive functions in the input&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are forbidden&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49709" LastEditorUserId="49709" LastEditDate="2016-06-28T09:03:13.330" LastActivityDate="2016-06-28T09:03:13.330" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9453" PostTypeId="1" CreationDate="2016-06-28T13:45:33.943" Score="4" ViewCount="150" Body="&lt;p&gt;While reviewing a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9449/31625&quot;&gt;post in the Sandbox&lt;/a&gt;, I went searching to try to find some duplicates. I recalled a previous challenge that was tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cipher&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cipher&amp;#39;&quot; rel=&quot;tag&quot;&gt;cipher&lt;/a&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/q/67044/31625&quot;&gt;Caesar shifting&lt;/a&gt;. I didn't think this was a duplicate of the sandboxed challenge, so I examined the other questions tagged cipher. This wasn't very helpful, as there were very few such questions. Eventually I found a more similar question about the &lt;a href=&quot;https://codegolf.stackexchange.com/q/678/31625&quot;&gt;Vigenère cipher&lt;/a&gt;, which I then tagged with cipher, to make it easier to find again.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This was all fine, until another challenge was posted on the sandboxed question that pointed out it was essentially a duplicate of the &lt;a href=&quot;https://codegolf.stackexchange.com/q/77899/31625&quot;&gt;Substitution Cipher&lt;/a&gt; question. My first thought was to add the cipher tag to this question as well, so I wouldn't miss it again, but then I noticed that the challenge had been tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cryptography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cryptography&amp;#39;&quot; rel=&quot;tag&quot;&gt;cryptography&lt;/a&gt;. A good number (over half of the open questions) of the questions tagged with cryptography are about implementing ciphers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The tag info for these tags is rather lackluster, so I'm not sure if they are meant to imply different things. Neither tag seems to imply that the challenge should be about performing known encryption and decryption, or if the challenge is about making a program that tries to break a cipher, however currently the latter type of challenge are only tagged with cryptography (e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/q/45668/31625&quot;&gt;this question&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should the cipher and cryptography tags be merged, or do they mean something different? If they are different, what do they mean and how should they be used?&lt;/p&gt;&#xA;" OwnerUserId="31625" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-06-29T02:25:45.260" Title="Should [cipher] and [cryptography] be merged?" Tags="|discussion|tags|tag-synonyms|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9454" PostTypeId="1" AcceptedAnswerId="9455" CreationDate="2016-06-28T16:45:33.500" Score="-11" ViewCount="476" Body="&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/QkHp4.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/QkHp4.png&quot; alt=&quot;In case the image doesn&amp;#39;t appear, this is the body of the question: Hello I have quetions how does juice an avocado I have try for thirtee minut and no juic. I try alredy. thank.&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This question has &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8335/53917&quot;&gt;historical significance&lt;/a&gt;, but &lt;strong&gt;it is not considered a good, on-topic question for this site&lt;/strong&gt;, just as said on locked questions. Does it deserve to be undeleted and locked for good?&lt;/p&gt;&#xA;" OwnerUserId="53917" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2016-07-24T00:29:44.373" Title="Question about question about advacado" Tags="|discussion|specific-question|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9455" PostTypeId="2" ParentId="9454" CreationDate="2016-06-28T16:53:04.927" Score="33" Body="&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/dGpW0.gif&quot; alt=&quot;No&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Seriously though, historical locks are for questions that were on topic once, but became off topic due to a change in the site's scope. That's not the case here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, undeleting the question would send the message that this kind of prank is acceptable. That's also not the case; the user (sock) who posted that question was deleted for spamming the site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And all the chatter about avocados &lt;em&gt;really&lt;/em&gt; needs to stop...&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2016-06-28T16:53:04.927" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9456" PostTypeId="5" CreationDate="2016-06-28T17:23:22.383" Score="0" Body="&lt;p&gt;This tag should be used on questions relating to advertising on CGCC. Most notably are the site's &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/tagged/community-ads&quot;&gt;Community Ads&lt;/a&gt;, refreshed once a year, which are ads designed by the CGCC community to advertise things we think are worth advertising to the rest of the site.&lt;/p&gt;&#xA;&lt;p&gt;Note that we do not allow posts that advertise products; these will be flagged and deleted as spam.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="66833" LastEditDate="2021-04-08T22:52:10.750" LastActivityDate="2021-04-08T22:52:10.750" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="9457" PostTypeId="4" CreationDate="2016-06-28T17:23:22.383" Score="0" Body="For questions about the site's community ads and other advertising on the site" OwnerUserId="31716" LastEditorUserId="66833" LastEditDate="2021-04-08T22:52:10.750" LastActivityDate="2021-04-08T22:52:10.750" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="9461" PostTypeId="2" ParentId="9453" CreationDate="2016-06-29T02:25:45.260" Score="2" Body="&lt;p&gt;To me, this is the same concept as an earlier meta post: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8983/lets-remove-tagmath&quot;&gt;Let&amp;#39;s remove [tag:math]!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cipher&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cipher&amp;#39;&quot; rel=&quot;tag&quot;&gt;cipher&lt;/a&gt; is about implementing specific ciphers. It is a subset of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cryptography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cryptography&amp;#39;&quot; rel=&quot;tag&quot;&gt;cryptography&lt;/a&gt;. However, there is a lot more to cryptography than the individual ciphers. &lt;a href=&quot;https://en.wikipedia.org/wiki/Cryptography#Cryptosystems&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cryptosystems&lt;/a&gt; are formed by combining one or more ciphers with other algorithms to achieve the desired goal. Often, the specific cipher(s) used don't matter much, so long as they meet the requirements. Thus, a challenge about &lt;a href=&quot;https://en.wikipedia.org/wiki/Pretty_Good_Privacy&quot; rel=&quot;nofollow noreferrer&quot;&gt;PGP&lt;/a&gt; would be tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cryptography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cryptography&amp;#39;&quot; rel=&quot;tag&quot;&gt;cryptography&lt;/a&gt;, but not necessarily &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cipher&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cipher&amp;#39;&quot; rel=&quot;tag&quot;&gt;cipher&lt;/a&gt;, since for each step in the chain (hash, compress, symmetric-key encrypt, public-key encrypt), one of many algorithms can be used, and thus it's more about the system as a whole rather than the individual algorithms/ciphers used.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In short, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cipher&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cipher&amp;#39;&quot; rel=&quot;tag&quot;&gt;cipher&lt;/a&gt; is a subset of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cryptography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cryptography&amp;#39;&quot; rel=&quot;tag&quot;&gt;cryptography&lt;/a&gt;, but there is a lot of stuff that would fall under &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cryptography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cryptography&amp;#39;&quot; rel=&quot;tag&quot;&gt;cryptography&lt;/a&gt; but not necessarily &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cipher&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cipher&amp;#39;&quot; rel=&quot;tag&quot;&gt;cipher&lt;/a&gt;. Thus, the tags should be kept separate.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-06-29T02:25:45.260" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9462" PostTypeId="2" ParentId="9439" CreationDate="2016-06-29T15:25:57.850" Score="4" Body="&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Using &quot;challenge&quot; in meta tags instead of &quot;question&quot; will cause confusion for some new users (even after we get the site-wide wording change to &quot;challenge&quot;, but especially before).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is a good thing. Better to cause the confusion early and get people to understand how this site is different as soon as possible.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If someone tries to type in a tag containing &quot;question&quot;, tag synonyms can handle that. This also acts as an education process for the poster, since the &quot;challenge&quot; based tag will be displayed when the meta question is posted.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/questions/70710/what-are-tag-synonyms-and-merged-tags-how-do-they-work&quot;&gt;All uses of the synonym tag for any given master tag are automatically converted to the master tag. So, users can enter a synonym tag when writing a question, but the master tag will be displayed when the question is loaded. ... Similarly, when users search for questions tagged with a synonym, a list of questions tagged with the master will be displayed.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Not all questions on main are challenges, and someone may want to ask on meta specifically about questions (such as tips questions). However, changing &quot;question&quot; to &quot;challenge&quot; won't make this situation any worse, and whether we need a tag for &lt;a href=&quot;/questions/tagged/questions-that-are-really-questions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;questions-that-are-really-questions&amp;#39;&quot; rel=&quot;tag&quot;&gt;questions-that-are-really-questions&lt;/a&gt; can be raised separately if anyone feels strongly about it.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2016-06-29T15:31:56.333" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9463" PostTypeId="1" CreationDate="2016-06-29T16:17:42.340" Score="41" ViewCount="2290" Body="&lt;p&gt;You've graduated... a while ago. This is quite overdue, but let us not wait any longer. We present to you, Community Promotion Ads!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;What are Community Promotion Ads?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Community Promotion Ads are community-vetted advertisements that will show up on the main site, in the right sidebar. The purpose of this question is the vetting process. Images of the advertisements are provided, and community voting will enable the advertisements to be shown.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Why do we have Community Promotion Ads?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is a method for the community to control what gets promoted to visitors on the site. For example, you might promote the following things:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the site's twitter account&lt;/li&gt;&#xA;&lt;li&gt;code puzzle blogs and websites&lt;/li&gt;&#xA;&lt;li&gt;interesting challenge sites&lt;/li&gt;&#xA;&lt;li&gt;cool events or conferences&lt;/li&gt;&#xA;&lt;li&gt;anything else your community would genuinely be interested in&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The goal is for future visitors to find out about &lt;em&gt;the stuff your community deems important&lt;/em&gt;. This also serves as a way to promote information and resources that are &lt;em&gt;relevant to your own community's interests&lt;/em&gt;, both for those already in the community and those yet to join. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Why do we reset the ads every year?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Some services will maintain usefulness over the years, while other things will wane to allow for new faces to show up. Resetting the ads every year helps accommodate this, and allows old ads that have served their purpose to be cycled out for fresher ads for newer things. This helps keep the material in the ads relevant to not just the subject matter of the community, but to the current status of the community. We reset the ads once a year, every December.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The community promotion ads have no restrictions against reposting an ad from a previous cycle. If a particular service or ad is very valuable to the community and will continue to be so, it is a good idea to repost it. It may be helpful to give it a new face in the process, so as to prevent the imagery of the ad from getting stale after a year of exposure.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;How does it work?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The answers you post to this question &lt;em&gt;must&lt;/em&gt; conform to the following rules, or they will be ignored. &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;All answers should be in the exact form of:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[![Tagline to show on mouseover][1]][2]&#xA;&#xA;   [1]: http://image-url&#xA;   [2]: http://clickthrough-url &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Please &lt;strong&gt;do not add anything else to the body of the post&lt;/strong&gt;. If you want to discuss something, do it in the comments.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The question must always be tagged with the magic &lt;a href=&quot;/questions/tagged/community-ads&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;community-ads&amp;#39;&quot; rel=&quot;tag&quot;&gt;community-ads&lt;/a&gt; tag. In addition to enabling the functionality of the advertisements, this tag also pre-fills the answer form with the above required form.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h3&gt;Image requirements&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The image that you create must be &lt;strong&gt;300 x 250 pixels&lt;/strong&gt;, or &lt;strong&gt;600 x 500 pixels&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Must be hosted through our standard image uploader (imgur)&lt;/li&gt;&#xA;&lt;li&gt;Must be GIF or PNG&lt;/li&gt;&#xA;&lt;li&gt;No animated GIFs&lt;/li&gt;&#xA;&lt;li&gt;Absolute limit on file size of &lt;strong&gt;150 KB&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;If the background of the image is white or partially white, there must be a 1px border (2px if the image is 600 x 500) surrounding it.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Score Threshold&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;There is a &lt;strong&gt;minimum score threshold&lt;/strong&gt; an answer must meet (currently &lt;strong&gt;6&lt;/strong&gt;) before it will be shown on the main site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can check out the ads that have met the threshold with basic click stats &lt;a href=&quot;https://codegolf.meta.stackexchange.com/ads/display/9463&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="2414" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2017-02-02T14:28:44.480" Title="Community Promotion Ads - 2016" Tags="|discussion|community-ads|" AnswerCount="8" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9464" PostTypeId="2" ParentId="9463" CreationDate="2016-06-29T16:17:42.340" Score="8" Body="&lt;p&gt;&lt;a href=&quot;https://twitter.com/StackCodeGolf&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZJKMH.png&quot; alt=&quot;Help this community grow -- follow us on twitter!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="2414" LastActivityDate="2016-06-29T16:17:42.340" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9465" PostTypeId="2" ParentId="9361" CreationDate="2016-06-29T16:33:09.867" Score="4" Body="&lt;p&gt;Sorry about the delay here. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9463/community-promotion-ads-2016&quot;&gt;The new thread is now up&lt;/a&gt;, and will shortly afterwards be hooked up to start displaying ads.&lt;/p&gt;&#xA;" OwnerUserId="2414" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-06-29T16:33:09.867" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9466" PostTypeId="2" ParentId="9463" CreationDate="2016-06-29T17:03:40.530" Score="57" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/40695&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/n3xsb.png&quot; alt=&quot;Have a challenge idea? Just like sand? Join us in the Sandbox!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2016-07-08T21:40:30.090" CommentCount="23" ContentLicense="CC BY-SA 3.0" />
  <row Id="9467" PostTypeId="2" ParentId="9463" CreationDate="2016-06-29T17:06:10.047" Score="21" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/?tab=featured&quot;&gt;Active bounties http://stack-exchange-dynamic-ads.herokuapp.com/codegolf.stackexchange.com/bounty.png&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2017-02-02T14:28:44.480" CommentCount="20" ContentLicense="CC BY-SA 3.0" />
  <row Id="9468" PostTypeId="2" ParentId="2140" CreationDate="2016-06-29T19:30:22.377" Score="1" Body="&lt;h2&gt;Golfing with ultrasound&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Within medical physics, the percentage of ultrasound reflected between material boundaries can be calculated using two pieces of data: the density(p) and the speed(c) at which sound travels through the material. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;To calculated the percentage reflection the following equation can be used&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Z1-Z2)^2 / (Z1+Z2)^2&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Where Z1 and Z2 are the acoustic impedances(Z) of the two materials.&#xA;Z is calculated such that Z=pc&#xA;That is density * speed of sound in the material&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;This is where the issue lies&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I have two ways of asking the question&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;1:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given the acoustic impedance for two materials, calculate the percentage reflection.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;2:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given the density and speed of sound in two materials, calculate the percentage reflection&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Reason&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The first method will be much simpler, in the way you are just plugging values into a formula. However I feel that method 2 is heavy on the inputs, and I understand that four inputs is a large number of inputs in golfing challenges&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On posting the question I will also add a number of test cases&lt;/p&gt;&#xA;" OwnerUserId="55243" LastEditorUserId="55243" LastEditDate="2016-06-29T19:42:39.053" LastActivityDate="2016-06-29T19:42:39.053" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9470" PostTypeId="2" ParentId="2140" CreationDate="2016-06-30T01:43:36.277" Score="3" Body="&lt;h1&gt;Join the dots without crossing the line&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Given a collection of distinct points in the unit square, output the points in order. This can be any order such that a closed polygon formed by straight line segments joining each point to the next (and the last back to the first) has no two lines crossing.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;There will be between 4 and 255 points.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each one is represented by an ordered pair &lt;code&gt;(x, y)&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The coordinates will have entries in the range &lt;code&gt;[0, 1)&lt;/code&gt;, that is &lt;code&gt;0 &amp;lt;= x &amp;lt; 1&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each entry may have up to 8 decimal places, so the range is 0 to 0.99999999.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may choose to accept integers instead, in which case the range will be 0 to 99999999.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may take input in any reasonable format. For example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;(0.1, 0.2), (0.3, 0.4), (0.5, 0.7)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;10000000 20000000 30000000 40000000 50000000 70000000&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The output format need not match the input format as long as both are unambiguous.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Impossible cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The code does not need to work for impossible cases, such as all points being colinear. Neither does it need to report such cases - it can simply not work. Behaviour is undefined.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Random algorithms&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your code must be deterministic. That is, it must always give the same output for the same input. For this purpose, the same points in a different order will be counted as distinct inputs and need not have the same output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may use pseudo random number generators provided the output is still consistent. If this requires setting a seed, that seed must be zero.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Time limit&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your code does not have to be particularly efficient, but it must finish for the 255 point test case in under 5 minutes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The requirement for the code to be deterministic is so that this time limit can be checked with a single run. If your random number generator of choice cannot give consistent behaviour by default, then you will need to seed it with zero. If a random number generator does not allow for seeding &lt;strong&gt;and&lt;/strong&gt; does not give consistent behaviour then you may not use that generator.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;[ TO BE ADDED ]&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output verification snippet&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;[ TO BE ADDED ]&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is code golf. Shortest code in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note that this is not a Traveling Salesman Problem. There is no requirement for the tour to be short, only for it to be non-intersecting.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2016-07-02T22:20:09.777" LastActivityDate="2016-07-02T22:20:09.777" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9477" PostTypeId="2" ParentId="8771" CreationDate="2016-07-01T08:26:02.200" Score="3" Body="&lt;p&gt;Some people are saying that memes are a part of chat culture, and so when rules or mods restrict them, they are suppressing site culture. I disagree.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Don't mistake volume for culture. A meme being repeated ad nauseum in chat does not make it part of the community. Rather, it's some of loud users who spam these memes over and over, long past the point that they were funny, if there ever was such a point. Chat discussions that cannot coexist in this environment are pushed out, along with whatever culture they carried. To borrow from &lt;a href=&quot;https://en.wikipedia.org/wiki/Gresham%27s_law&quot; rel=&quot;nofollow&quot;&gt;Gresham's Law&lt;/a&gt;, bad culture drives out good.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2016-07-01T10:45:44.777" LastActivityDate="2016-07-01T10:45:44.777" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9478" PostTypeId="1" AcceptedAnswerId="9479" CreationDate="2016-07-01T14:16:38.313" Score="3" ViewCount="58" Body="&lt;ul&gt;&#xA;&lt;li&gt;here is a list&lt;/li&gt;&#xA;&lt;li&gt;followed by a code block&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;or that´s how it was intended&lt;/p&gt;&#xA;&#xA;&lt;p&gt;sample input      sample output&#xA;108,174,106       [0.3793103448275862, 0.0, 0.3908045977011494, 0.3176470588235294]&#xA;0,0,0             0,0,0,1&#xA;170,255,238       33,0,7,0&lt;br&gt;&#xA;0x0088ff          1,0.4667,0,0&#xA;[250,235,215]     [0,6,14,1.96]  &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;123456           .7907,.3953,0,.6627&lt;/h1&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;apparently I have to use backticks and line breaks instead&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;sample input      sample output&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;108,174,106       [0.3793103448275862, 0.0, 0.3908045977011494, 0.3176470588235294]&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;0,0,0             0,0,0,1&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;170,255,238       33,0,7,0&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;0x0088ff          1,0.4667,0,0&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;[250,235,215]     [0,6,14,1.96]&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;#123456           .7907,.3953,0,.6627&lt;/code&gt; &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;or insert a somehow matching paragraph&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;sample input      sample output&#xA;108,174,106       [0.3793103448275862, 0.0, 0.3908045977011494, 0.3176470588235294]&#xA;0,0,0             0,0,0,1&#xA;170,255,238       33,0,7,0  &#xA;0x0088ff          1,0.4667,0,0&#xA;[250,235,215]     [0,6,14,1.96]  &#xA;#123456           .7907,.3953,0,.6627&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;to make it work.&lt;/p&gt;&#xA;" OwnerUserId="55735" LastEditorUserId="207" LastEditDate="2016-07-01T14:38:37.137" LastActivityDate="2016-07-01T14:38:37.137" Title="code block does not work when immediately following a list" Tags="|support|markdown|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9479" PostTypeId="2" ParentId="9478" CreationDate="2016-07-01T14:21:08.547" Score="6" Body="&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Use 8 spaces of indentation if you want the code block as part of the list:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Like this&#xA;Neat, huh?&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Otherwise, if you want a code block immediately &lt;em&gt;after&lt;/em&gt; a list, put an HTML comment (&lt;code&gt;&amp;lt;!-- --&amp;gt;&lt;/code&gt;) with no indentation between the list and code block to reset the SE parser to normal paragraph mode.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Check out the markdown of this answer in the&#xA;revision history to see what it looks like.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2016-07-01T14:26:11.970" LastActivityDate="2016-07-01T14:26:11.970" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9481" PostTypeId="1" CreationDate="2016-07-01T15:46:50.223" Score="2" ViewCount="75" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/53917&quot;&gt;Sandbox&lt;/a&gt; posts with several downvotes (such as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9446/53917&quot;&gt;the one about lolcats&lt;/a&gt;) are signs of what the community &lt;em&gt;doesn't&lt;/em&gt; like. Should we keep them to remind users about what not to &quot;ask&quot;?&lt;/p&gt;&#xA;" OwnerUserId="53917" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2016-07-01T15:46:50.223" Title="Is it a good idea to leave heavily downvoted challenges in the Sandbox as signposts?" Tags="|discussion|sandbox|" AnswerCount="0" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9482" PostTypeId="2" ParentId="7897" CreationDate="2016-07-01T16:31:37.333" Score="-6" Body="&lt;h1&gt;Icon/Favicon: &lt;a href=&quot;/a/7949&quot;&gt;This&lt;/a&gt; and &lt;a href=&quot;/a/7978&quot;&gt;this&lt;/a&gt; combined!&lt;/h1&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-01T16:31:37.333" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9483" PostTypeId="1" AcceptedAnswerId="9484" CreationDate="2016-07-01T18:05:07.437" Score="11" ViewCount="353" Body="&lt;p&gt;Since this isn't explicitly codified anywhere, and was sparked by &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/30754997#30754997&quot;&gt;discussion&lt;/a&gt; surrounding my &lt;a href=&quot;https://codegolf.stackexchange.com/q/84218/42963&quot;&gt;recent challenge&lt;/a&gt;, I figured I'd bring it up here for consensus before modifying the tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Related:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2214/whats-a-string&quot;&gt;What&amp;#39;s a string?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/3593/what-are-string-literals&quot;&gt;What are string literals?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Things to avoid when writing challenges: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9384/42963&quot;&gt;Adding unnecessary fluff&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;The Question&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When a challenge asks for a string, what should the default case-sensitivity be?&lt;/p&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-07-01T18:09:36.113" Title="Case Sensitive Strings" Tags="|discussion|tags|rules|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9484" PostTypeId="2" ParentId="9483" CreationDate="2016-07-01T18:09:36.113" Score="33" Body="&lt;p&gt;Unless specified otherwise, strings are case-sensitive. More generally, unless specified otherwise, &lt;strong&gt;strings are just sequences of characters with no semantics attached to any specific characters&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This should also be the least surprising default for users who are not aware of this post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd also urge challenge authors to think twice before making a challenge case-insensitive. We've done case insensitivity more than often enough, and most of the time it's a concern that's completely orthogonal to the actual task of the challenge, and it just adds extra code for handling the case-insensitivity which adds nothing at all to the answers. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9384/8478&quot;&gt;Related reading.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-07-01T18:09:36.113" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9490" PostTypeId="1" AcceptedAnswerId="9492" CreationDate="2016-07-02T23:15:49.863" Score="1" ViewCount="201" Body="&lt;p&gt;Would a question which calls for an obfuscated answer be considered invalid? This has come up recently, and I would like to see a community consensus on this. &#xA;&lt;br /&gt;&#xA;I am not asking this question to defend my own challenges, but rather to see what people think about such questions. Both responses from moderators, and normal users alike are appreciated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;tl;dr is obfuscation==underhanded&lt;/p&gt;&#xA;" OwnerUserId="46918" OwnerDisplayName="Rohan Jhunjhunwala" LastActivityDate="2016-07-03T00:11:45.423" Title="Obfuscation/Encryption question" Tags="|discussion|underhanded|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9491" PostTypeId="2" ParentId="9490" CreationDate="2016-07-02T23:24:32.733" Score="1" Body="&lt;h1&gt;No. Obfuscation challenges aren't &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt;.&lt;/h1&gt;&#xA;&lt;p&gt;This is the full description of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;An underhanded challenge is a challenge to write a program that looks as if it is doing one thing, but does something else. For example, a program that outputs the digits of pi up until the 100th decimal place, when it does something else, might be underhanded if it conceals its doing so.&lt;/p&gt;&#xA;&lt;p&gt;Votes cast on challenges should take into account how well (or poorly) hidden the bug is.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is the full description of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/obfuscation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;obfuscation&amp;#39;&quot; rel=&quot;tag&quot;&gt;obfuscation&lt;/a&gt;, which isn't even similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This tag indicates that a challenge involves obfuscation. Often, this just means that certain characters can't be used, or that you need to hide what you are doing.&lt;/p&gt;&#xA;&lt;p&gt;Obfuscating code is making the code very hard to understand for humans, and is much used to protect source code. Most obfuscated codes are obfuscated by computer programs (obfuscators). Unfortunately, obfuscation doesn't provide code protection for 100%, because there is also a lot of software that de-obfuscates the code, and makes the code easier to understand for humans. Humorously, golfing code makes the code harder for humans to read, so it is a form (though very easily reversed) of obfuscation.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="53917" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-02T23:24:32.733" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9492" PostTypeId="2" ParentId="9490" CreationDate="2016-07-03T00:11:45.423" Score="4" Body="&lt;h1&gt;In most cases, it's the same thing.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Making code look like it does something else&lt;/em&gt; and &lt;em&gt;making code difficult to understand&lt;/em&gt; rely on the same principle. Ultimately, the goal of both is to hide the real purpose of the code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Case in point, &lt;a href=&quot;https://codegolf.stackexchange.com/a/84335&quot;&gt;your self-answer&lt;/a&gt; to the challenge that spiked this discussion looks like a tutorial about pseudo-random number generation, yet produces a specific output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That doesn't mean that all challenges that involve obfuscation are necesarily off topic. For example, we had cops and robbers contests where the robbers had to find certain inputs that produced a certain output. That's objectively measurable (shortest code for cops, most cracks for robbers), and doesn't suffer from the same problems as obfuscation popularity contests.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the latter kind, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8326&quot;&gt;all the reasons that drove the community to blacklist underhanded challenges&lt;/a&gt; still apply. They're essentially code trolling in disguise, don't add any quality content to the site, and are too broad and too subjective for the scope of PPCG.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-07-03T00:11:45.423" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9495" PostTypeId="1" AcceptedAnswerId="9500" CreationDate="2016-07-03T18:30:44.640" Score="-4" ViewCount="215" Body="&lt;p&gt;In any &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question, there is the possibility that the OP wants to accept an answer that is not the shortest. I have not heard of it being possible for mods to change the accepted answer. Therefore, I propose that &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Accepting for specific tags should be automatic.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;For example, for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; when the OP wants to accept an answer (if ever) they can just click &quot;accept&quot; and the most-golfed answer (with correct formatting) will be accepted. &lt;/p&gt;&#xA;" OwnerUserId="48922" LastEditorUserId="68942" LastEditDate="2021-06-09T05:41:22.673" LastActivityDate="2021-06-09T05:41:22.673" Title="Accepting answers in challenges" Tags="|feature-request|status-declined|challenges|accepted-answer|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9496" PostTypeId="2" ParentId="2140" CreationDate="2016-07-03T18:36:58.160" Score="0" Body="&lt;h1&gt;Generate a random Vietnamese syllable&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The Vietnamese syllable space is interesting, because it is &lt;em&gt;huge&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;TODO: Describe the space and why it is interesting.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Here's how such syllables are made:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;The onset matches the regex ^([bcdđghklmnprstvx]|qu|[cgkpt]h|ng|tr)$&#xA;&#xA;The vowel is one of the following massive list:&#xA;&#xA;a à a' ã á a.&#xA;â â` â' â~ â´ â.&#xA;a. ă` ă' ă~ ă´ ă.&#xA;e è e' e~ é e.&#xA;ê ê` ê' ê~ ê´ ê.&#xA;i ì i' ĩ í i. ia iê&#xA;o ò o' õ ó o. oa oă oe&#xA;ô ô` ô' ô~ ô´ ô.&#xA;o' ò' o&quot; õ' ó' o'.&#xA;u ù u' ũ ú u. ua uâ uê ui uô uo' uy&#xA;u' ù' u&quot; ũ' ú' u'. u'a u'o'&#xA;y y` y' y~ ý y. ya yê&#xA;&#xA;The coda matches the regex ^([iouycptmn]|ch|ng|nh)$&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(thanks Peter Taylor!)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The onset, vowel and coda are concatenated to make the result syllable.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The objective is to generate random Vietnamese syllables. Your program has to take no input and as output include &lt;em&gt;only&lt;/em&gt; the syllable, with an optional trailing new line.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Clarifications&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each syllable must be generated with a non zero probability.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I think it's unclear. Contributions are so much welcome.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="48538" LastEditorUserId="48538" LastEditDate="2016-07-05T10:54:00.963" LastActivityDate="2016-07-05T10:54:00.963" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9498" PostTypeId="1" CreationDate="2016-07-04T06:00:32.183" Score="2" ViewCount="118" Body="&lt;p&gt;Should PPCG rules or guidelines or other administrative content be considered &quot;official&quot; when it is not hosted on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/&quot;&gt;meta&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;main&lt;/a&gt;? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;(Note that &quot;PPCG&quot; refers to the entirety of the Programming Puzzles &amp;amp; Code Golf Stack Exchange site microcosm, including &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;main&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/&quot;&gt;meta&lt;/a&gt;, and &lt;a href=&quot;https://chat.stackexchange.com/?tab=site&amp;amp;host=codegolf.stackexchange.com&quot;&gt;chat&lt;/a&gt;.)&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Currently, most of our specific rules reside in various meta posts while other guidelines and info are in &lt;a href=&quot;https://codegolf.stackexchange.com/help&quot;&gt;the help center&lt;/a&gt; and tag wikis and such. But the mods &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=30274295#30274295&quot;&gt;recently&lt;/a&gt; created a &quot;&lt;a href=&quot;https://ppcg.github.io/chatiquette/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Chatiquette&lt;/a&gt;&quot; &lt;a href=&quot;https://github.com/ppcg/ppcg.github.io&quot; rel=&quot;nofollow noreferrer&quot;&gt;github page&lt;/a&gt; for chat etiquette in our chatroom, &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;. The chatroom description links to it directly:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;General discussion for &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;codegolf.stackexchange.com&lt;/a&gt; | Guidelines: &lt;a href=&quot;https://ppcg.github.io/chatiquette/&quot; rel=&quot;nofollow noreferrer&quot;&gt;ppcg.github.io/chatiquette&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So I take it that the guidelines are more or less official, akin to a meta decision.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should these github hosted Chatiquette rules be considered binding and official? i.e. should mods (and the community at large) be able to enforce them as they would any other site rule?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In general, &lt;strong&gt;should PPCG administrative content &lt;em&gt;not&lt;/em&gt; hosted on PPCG ever be considered official?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2016-07-04T06:00:32.183" Title="Should administrative content hosted on external sites ever be binding?" Tags="|discussion|policy|moderators|moderation|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9499" PostTypeId="2" ParentId="9498" CreationDate="2016-07-04T06:00:32.183" Score="7" Body="&lt;h1&gt;No, Admin content hosted on external sites should not be binding&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Only administrative content present on PPCG should be binding&lt;/strong&gt; because sundering some rules from the official site will make it harder for new users and new mods to find them and democratically update them.&lt;/p&gt;&#xA;&lt;p&gt;Not everyone will necessarily have a github (or whatever) account but they will have an SE account, along with a set of earned privileges already tailored&#xA;to make the site democratically functional. I'm merely saying that we should work within the system we already have.&lt;/p&gt;&#xA;&lt;p&gt;Meta posts can always be used for rules that don't fit in the help center or elsewhere, so I see no need to post rule lists on github. A meta post could be locked/protected if necessary to form a basic, static rule list.&lt;/p&gt;&#xA;&lt;p&gt;(This &amp;quot;No&amp;quot; decision applies the Chatiquette guidelines as well as all future administrative content.)&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-04T06:00:32.183" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9500" PostTypeId="2" ParentId="9495" CreationDate="2016-07-04T06:23:04.260" Score="7" Body="&lt;p&gt;This idea has many problems. &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;It will be &lt;em&gt;very&lt;/em&gt; difficult to write a fool-proof program to detect the shortest valid answer. This also seems rather abuse prone to me. What if the challenge has a deadline? What if the answer was formatted wrong? I suppose you want the accept to automatically update if a newer-shorter answer is posted. What if this answer is invalid? What if a user posts the wrong byte-count to snag the &lt;code&gt;+15&lt;/code&gt; rep? Yes, all of these could be handled with editing and flagging, but this seems like much more work than leaving the accepting up to a human that can judge the answers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Not everyone agrees that having an accepted feature &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8350/were-not-a-qa-site-but-what-should-be-done-about-it/8363#8363&quot;&gt;is a good idea&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7683/increase-reputation-awarded-for-questions&quot;&gt;much&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1987/could-ppcg-benefit-from-a-new-sorting-mode-for-answers&quot;&gt;more&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/477/the-how-to-ask-page-is-misleading&quot;&gt;pressing&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7070/lets-customise-the-how-to-answer-pop-up&quot;&gt;feature requests&lt;/a&gt;, and pretty much every time the answer (if we get one at all) has been &quot;We're not willing to put dev time into customizing a single site&quot;, or &quot;Those features are too integral to the site to make any major changes to.&quot; It seems like this would also fit in the same boat.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Not every question tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; has the shortest answer accepted. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2016-07-04T06:23:04.260" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9501" PostTypeId="1" CreationDate="2016-07-04T12:08:15.323" Score="16" ViewCount="1008" Body="&lt;p&gt;I am becoming more and more annoyed at the ever-increasing number of rules about what is deemed acceptable as inputs and outputs to programs&lt;/p&gt;&#xA;&lt;p&gt;Here is a compilation of such rules that I found:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2190/interpretation-of-truthy-falsey/&quot;&gt;Interpretation of Truthy/Falsy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9425/empty-string-as-a-truthy-value&quot;&gt;Empty string as a truthy value&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5343/can-numeric-input-output-be-in-unary&quot;&gt;Can numeric input/output be in unary?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9064/should-booleans-be-allowed-where-a-number-is-required&quot;&gt;Should booleans be allowed where a number is required?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8395/is-the-empty-string-an-acceptable-decimal-representation-of-0&quot;&gt;Is the empty string an acceptable decimal representation of 0?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4708/can-numeric-input-output-be-in-the-form-of-byte-values&quot;&gt;Can numeric input/output be in the form of byte values?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8276/accepting-numeric-inputs-in-mixed-decimal-and-unary-bases&quot;&gt;Accepting numeric inputs in mixed decimal and unary bases&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;To me, there is absolutely no need for all of those posts, for the following reason:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Code golf is about golfing your code, not golfing the input or the output.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A challenge gives you numbers as input? Then you take a number as input and not something ridiculous like the empty string instead of 0.&lt;/li&gt;&#xA;&lt;li&gt;Booleans either exist in your language and you use them, or you use &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt; as is historically done, nothing else.&lt;/li&gt;&#xA;&lt;li&gt;Unary is not the natural representation of numbers in almost all languages, therefore it makes no sense that you can take an input number in unary or return it in unary for said languages, instead of what's natural in said languages (almost always decimal).&lt;/li&gt;&#xA;&lt;li&gt;...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;In short, &lt;strong&gt;you should take inputs and return outputs as is naturally done in the language you use, and not abuse the format of the input/output because it shortens your code.&lt;/strong&gt; If your algorithm is shorter on unary numbers, then fine but the conversion from and to decimal goes inside your code, not outside.&lt;/p&gt;&#xA;&lt;h3&gt;Why I think this is important&lt;/h3&gt;&#xA;&lt;p&gt;PPCG is graduating, and is often listed in the Hot Network Questions. We often have discussions e.g. in chat or in comments of &amp;quot;bad challenges&amp;quot; that it is &lt;strong&gt;very difficult to enter this community&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I strongly believe those input/output formats deter newcomers from participating in challenges, because, just like for me, the idea of taking as input numbers in unary in a Python program &lt;strong&gt;seems completely ridiculous to outsiders&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Getting rid of all this also reduces the number of rules that a newcomer needs to know before posting (which there are a lot of already).&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="-1" LastEditorDisplayName="user42649" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-14T02:24:22.687" Title="Keep your golfing in your code, not in inputs and outputs" Tags="|discussion|policy|" AnswerCount="1" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="9502" PostTypeId="2" ParentId="2140" CreationDate="2016-07-04T16:14:31.043" Score="1" Body="&lt;h1&gt;Write a BF to Hexagony Converter!&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brainfuck&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brainfuck&amp;#39;&quot; rel=&quot;tag&quot;&gt;brainfuck&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-generation&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-generation&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hexagonal-grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hexagonal-grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;hexagonal-grid&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;According to community moderator &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/8478/martin-ender&quot;&gt;Martin Ender ♦&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Hexagony is Turing-complete as any brainfuck program can be translated to Hexagony with some effort. (&lt;a href=&quot;https://github.com/m-ender/hexagony/blob/master/README.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;Source&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Your program's job is simple: take a valid brainfuck program, and convert it to an equivalent Hexagony program. For completeness, here are all the relavant commands in both BrainFuck and Hexaongy (taken from &lt;a href=&quot;http://esolangs.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;esolangs.org&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;brainfuck&lt;/h3&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;brainfuck operates on an array of memory cells, also referred to as the tape, each initially set to zero. There is a pointer, initially pointing to the first memory cell. The commands are:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;code&gt;&amp;gt;&lt;/code&gt; Move the pointer to the right&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;&amp;lt;&lt;/code&gt; Move the pointer to the left&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;+&lt;/code&gt; Increment the memory cell under the pointer&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;-&lt;/code&gt; Decrement the memory cell under the pointer&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;.&lt;/code&gt; Output the character signified by the cell at the pointer&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;,&lt;/code&gt; Input a character and store it in the cell at the pointer (-1 for EOF)&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;[&lt;/code&gt; Jump past the matching ] if the cell under the pointer is less than or equal to 0&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;]&lt;/code&gt; Jump back to the matching [ if the cell under the pointer is nonzero&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;  &#xA;  &lt;p&gt;All characters other than &gt;&amp;lt;+-.,[] should be considered comments and ignored.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h3&gt;Modifications:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Infinite tape in both directions&lt;/li&gt;&#xA;&lt;li&gt;Arbitrary precision integers (like hexagony)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No overflow/underflow&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[&lt;/code&gt; acts the same for negative numbers as it does for 0&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Hexagony&lt;/h3&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h3&gt;Source code&lt;/h3&gt;&#xA;  &#xA;  &lt;p&gt;The source code consists of printable ASCII characters and line feeds and is interpreted as a pointy-topped hexagonal grid, where each cell holds a single-character command.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Because of this restriction, the number of commands in the source code&#xA;  will always be a centered hexagonal number. For reference, the first&#xA;  10 centered hexagonal numbers are:&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;code&gt;1, 7, 19, 37, 61, 91, 127, 169, 217, 271&lt;/code&gt; &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;When reading a source file,&#xA;  Hexagony first strips all whitespace characters. Then the remaining source&#xA;  code is padded to the next centered hexagonal number with no-ops and&#xA;  rearranged it into a regular hexagon. This means that the spaces in&#xA;  the examples above were only inserted for cosmetic reasons but don't&#xA;  have to be included in the source code. The following three programs&#xA;  are identical:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   a b c  &#xA;  d e f g &#xA; h . . . .  &#xA;  . . . .   &#xA;   . . . &#xA;&#xA;abcdefgh...........&#xA;&#xA;abcdefgh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;But note that&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;code&gt;abcdefg&lt;/code&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;would instead be the short form of&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   a b &#xA;  c d e  &#xA;   f g&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;h3&gt;Control flow&lt;/h3&gt;&#xA;  &#xA;  &lt;p&gt;Hexagony has 6 instruction pointers (IPs). They start out in the corners of the source code, pointing along the edge in the clockwise direction. Only one IP is active at any given time, initially the one in the top left corner (moving to the right). There are commands which let you switch to another IP, in which case the current IP will make another move (but not execute the next command), and then the new IP will start by executing its current command before making its first move. Each IP has an index from 0 to 5:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   0 . 1&#xA;  . . . .&#xA; 5 . . . 2&#xA;  . . . .&#xA;   4 . 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;The direction of an IP can be changed via several commands which resemble mirrors and branches.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;The edges of the hexagon wrap around to the opposite edge. In all of the following grids, if an IP starts out on the a moving towards the b, the letters will be executed in order before returning to a:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   . . . .          . a . .          . . k .          . g . .   &#xA;  a b c d e        . . b . .        . . j . .        . h . . a  &#xA; . . . . . .      g . . c . .      . . i . . e      . i . . b . &#xA;. . . . . . .    . h . . d . .    . . h . . d .    . j . . c . .&#xA; f g h i j k      . i . . e .      . g . . c .      k . . d . . &#xA;  . . . . .        . j . . f        f . . b .        . . e . .  &#xA;   . . . .          . k . .          . . a .          . f . .   &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;If the IP leaves the grid through corner in the direction of the corner there are two possibilities:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-&amp;gt; . . . .   &#xA;  . . . . .  &#xA; . . . . . . &#xA;. . . . . . . -&amp;gt;&#xA; . . . . . . &#xA;  . . . . .  &#xA;-&amp;gt; . . . .  &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;If the current memory cell (see below) is positive, the IP will continue on the bottom row. If it's zero or negative, the IP will continue on the top row. For the other 5 corners, just rotate the picture. Note that if the IP leaves the grid in a corner but doesn't point at a corner, the wrapping happens normally. This means that there are two paths that lead to each corner:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;      . . . . -&amp;gt;   &#xA;     . . . . .  &#xA;    . . . . . . &#xA;-&amp;gt; . . . . . . .&#xA;    . . . . . . &#xA;     . . . . .  &#xA;      . . . . -&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;h3&gt;Special characters&lt;/h3&gt;&#xA;  &#xA;  &lt;p&gt;&lt;code&gt;.&lt;/code&gt; is a no-op: the IP will simply pass through.&lt;br&gt;&#xA;  &lt;code&gt;@&lt;/code&gt; terminates the program.  &lt;/p&gt;&#xA;  &#xA;  &lt;h3&gt;Arithmetic&lt;/h3&gt;&#xA;  &#xA;  &lt;p&gt;&lt;code&gt;)&lt;/code&gt; increments the current memory edge.&lt;br&gt;&#xA;  &lt;code&gt;(&lt;/code&gt; decrements the current memory edge.  &lt;/p&gt;&#xA;  &#xA;  &lt;h3&gt;I/O&lt;/h3&gt;&#xA;  &#xA;  &lt;p&gt;&lt;code&gt;,&lt;/code&gt; reads a single byte from STDIN and sets the current memory edge to its value, or -1 if EOF is reached.&lt;br&gt;&#xA;  &lt;code&gt;;&lt;/code&gt; takes the current memory edge modulo 256 (positive) and writes the corresponding byte to STDOUT.  &lt;/p&gt;&#xA;  &#xA;  &lt;h2&gt;Control flow&lt;/h2&gt;&#xA;  &#xA;  &lt;p&gt;&lt;code&gt;$&lt;/code&gt; is a jump. When executed, the IP completely ignores the next command in its current direction. This is like Befunge's &lt;code&gt;#&lt;/code&gt;.&lt;br&gt;&#xA;  &lt;code&gt;_, |, /, \&lt;/code&gt; are mirrors. They reflect the IP in the direction you'd expect. For completeness, the following table shows how they deflect an incoming IP. The top row corresponds to the current direction of the IP, the left column to the mirror, and the table cell shows the outgoing direction of the IP:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  cmd │  E SE SW  W NW NE&#xA;──────┼────────────────────&#xA;   /  │ NW  W SW SE  E NE&#xA;   \  │ SW SE  E NE NW  W&#xA;   _  │  E NE NW  W SW SE&#xA;   |  │  W SW SE  E NE NW&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;&lt;code&gt;&amp;lt;&lt;/code&gt; and &lt;code&gt;&amp;gt;&lt;/code&gt; act as either mirrors or branches, depending on the incoming direction. The cells indicated as ?? are where they act as branches. In these cases, if the current memory edge is positive, the IP takes a 60° right turn (e.g. &amp;lt; turns E into SE). If the current memory edge is zero or negative, the IP takes a 60° left turn (e.g. &amp;lt; turns E into NE).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  cmd │  E SE SW  W NW NE&#xA;──────┼────────────────────&#xA;   &amp;lt;  │ ?? NW  W  E  W SW &#xA;   &amp;gt;  │  W  E NE ?? SE  E&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;&lt;code&gt;[&lt;/code&gt; switches to the previous IP (wrapping around from 0 to 5).&lt;br&gt;&#xA;  &lt;code&gt;]&lt;/code&gt; switches to the next IP (wrapping around from 5 to 0).&lt;br&gt;&#xA;  &lt;code&gt;#&lt;/code&gt; takes the current memory edge modulo 6 and switches to the IP with that index.&lt;/p&gt;&#xA;  &#xA;  &lt;h3&gt;Memory manipulation&lt;/h3&gt;&#xA;  &#xA;  &lt;p&gt;&lt;code&gt;{&lt;/code&gt; moves the MP to the left neighbour.&lt;br&gt;&#xA;  &lt;code&gt;}&lt;/code&gt; moves the MP to the right neighbour.&lt;br&gt;&#xA;  &lt;code&gt;&quot;&lt;/code&gt; moves the MP backwards and to the left. This is equivalent to =}=.&lt;br&gt;&#xA;  &lt;code&gt;'&lt;/code&gt; moves the MP backwards and to the right. This is equivalent to ={=.&lt;br&gt;&#xA;  &lt;code&gt;=&lt;/code&gt; reverses the direction of the MP. (This doesn't affect the current memory edge, but changes which edges are considered the left and right neighbour.)  &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Some commands/description omitted for conciseness, full list &lt;a href=&quot;https://esolangs.org/wiki/Hexagony&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Other rules:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input/Output may be done however is most natural for your language&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output does not have to be formatted like a hexagon&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Must run in a reasonable amount of time&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Minimal brute-force&lt;/li&gt;&#xA;&lt;li&gt;No brute-forcing the entire program&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;You can only use Hexagony commands specified in this challenge.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;{META NOTE: I know this challenge is hard, is there a better way to score?}&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;As usual, standard loopholes are prohibited.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: (cat)&#xA;&#xA;,.[,.]&#xA;&#xA;Output: (example)&#xA;&#xA;   \ . .&#xA;  &amp;lt; _ . .&#xA; . _ ; . .&#xA;  . . &amp;gt; ,&#xA;   . @ .&#xA;&#xA;Input: (&quot;123&quot;)&#xA;&#xA;+++++++++++++++++++++++++++++++++++++++++++++++++.+.+.&#xA;&#xA;Output: (example)&#xA;&#xA;     ) ) ) ) )&#xA;    ) ) ; ) ; /&#xA;   ) ) ) ) ) ) /&#xA;  ) ) ) ) ) ) ) /&#xA; ) ) ) ) ) ) ) ) /&#xA;  ) ) ) ) ) ) ) )&#xA;   ) ) ) ) ) ) )&#xA;    ) ) ) ) ) )&#xA;     . . @ ; &amp;lt;&#xA;&#xA;Input: (@primo's infinite Fibonacci)&#xA;&#xA;+[[&amp;lt;+&amp;gt;-&amp;gt;+&amp;gt;+&amp;lt;&amp;lt;]&amp;gt;]&#xA;&#xA;Output: (example)&#xA;&#xA;       ) \ . . . . |&#xA;      . | . / { } &amp;lt; .&#xA;     . . . . &amp;gt; [ . / &amp;gt;&#xA;    . . . . . . . . . .&#xA;   . . . . . . @ . . . .&#xA;  / . ] &amp;lt; . &amp;gt; &amp;lt; . ] . . .&#xA; _ &amp;gt; &quot; ' / | . &amp;gt; &amp;lt; . . . .&#xA;  _ / . . . / . . [ . . .&#xA;   . / . . . . . . ) . .&#xA;    . . . . . . . . ] .&#xA;     . . . [ . . . . |&#xA;      . . [ . . . . (&#xA;       . \ ) ] ) ] &amp;lt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="42855" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-07-04T16:54:42.377" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="9503" PostTypeId="2" ParentId="2140" CreationDate="2016-07-04T17:42:38.780" Score="1" Body="&lt;h2&gt;Platformer game&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a platformer game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Keyboard input, minimum three commands: left, right and jump;&lt;/li&gt;&#xA;&lt;li&gt;Real-time. Screen should update (and the game iterate) on timer. Update speed should not depend on CPU speed. FPS should be between 2 and 120;&lt;/li&gt;&#xA;&lt;li&gt;It should be possible both to win and to lose (the game can although be very hard and require preparing a special bot to win or to lose);&lt;/li&gt;&#xA;&lt;li&gt;Playing field should have at lest 64 positions, minimum width is 6, minimum height is 5.&lt;/li&gt;&#xA;&lt;li&gt;Player may move left, right or jump. Player moves down automatically unless on a platform. Jumping means moving up for some limited time (not higher than 67% of playing field's height), then falling down like usual.&lt;/li&gt;&#xA;&lt;li&gt;Falling down outside playing field is losing the game. Stepping on 6 distinct platforms is a win.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Player, platforms and borders of area should be visible on playing field. If output method is ASCII art, it may looks like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.....----...&#xA;............&#xA;...@....----&#xA;..---.......&#xA;.......---..&#xA;............&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Platforms may be horizontal, vertical, diagonal. Platforms should not overlap (except of differently oriented). Platform's projection to horizontal and vertical axes should not overlap for at least 4 platforms. Example of too projection-overlapping playing field:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;............&#xA;....@.......&#xA;.--.--..--..&#xA;............&#xA;.--.--..--..&#xA;............&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Platforms may move. Overlapping rules apply only to initial positions.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;The game should track losing and winning conditions and stop the game, outputting distinct messages in case of lose or win.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="7773" LastActivityDate="2016-07-04T17:42:38.780" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9504" PostTypeId="2" ParentId="2140" CreationDate="2016-07-04T23:27:26.540" Score="1" Body="&lt;h1&gt;Compute h-index of PPCG users&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stack-exchange-api&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stack-exchange-api&amp;#39;&quot; rel=&quot;tag&quot;&gt;stack-exchange-api&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Thanks to @Suever for his help refining this challenge.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/H-index&quot; rel=&quot;nofollow noreferrer&quot;&gt;h-index&lt;/a&gt; is a commonly used metric that measures the amount and quality of publications of a given scholar or researcher. It is defined as follows:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A scholar with an h-index of &lt;em&gt;n&lt;/em&gt; has published &lt;em&gt;n&lt;/em&gt; papers each of which has been cited at least &lt;em&gt;n&lt;/em&gt; times.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Adaptation for PPCG&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this challenge I propose to compute the h-index of PPCG users based on the analogy&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;paper&lt;/strong&gt; → &lt;strong&gt;answer&lt;/strong&gt;;&lt;/li&gt;&#xA;&lt;li&gt;paper's &lt;strong&gt;citations&lt;/strong&gt; → answer's &lt;strong&gt;vote count&lt;/strong&gt;, defined as upvotes minus downvotes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The following examples illustrate the computation of h-index. The array to the left is the vote count of answers in descending order for a hypothetical user, and the number to the right is the resulting h-index:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[5 3 2 1 1]    2&#xA;[1 1 1]        1&#xA;[]             0&#xA;[-1 -2]        0&#xA;[0]            0&#xA;[9 4 3 ...]    3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Referring to the last example, note that we don't need to know the array entries after the &lt;code&gt;3&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a user identification, &lt;strong&gt;output their h-index&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;User identification&lt;/strong&gt; can be defined as anything reasonable, such as user number, user name, or user name without spaces.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The result must be based on &lt;strong&gt;actual data&lt;/strong&gt; from the PPCG site. You may want to take a look at the StackExchange API, for example &lt;a href=&quot;http://api.stackexchange.com/docs/answers-on-users&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that some users have a lot of answers. For one such user the API may not give all the results, or may only give them split across several chunks. However, if you ask the API to provide the results &lt;strong&gt;with an appropriate sorting&lt;/strong&gt; you may not need all of them to compute the h-index (see last example above). Also, you may assume that the h-index of any user will be &lt;strong&gt;less than 100&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the answer can't be tested in an online compiler (for example due to restrictions to read web content), you are encouraged (although not required) to post some &lt;strong&gt;evidence&lt;/strong&gt; that the answer works, such as a screen capture.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code golf. Fewest bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Table of h-indices&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;After submitting your answer, you may optionally &lt;strong&gt;edit the table&lt;/strong&gt; below to include your own h-index, in the indicated format. Please keep the table in &lt;strong&gt;decreasing order&lt;/strong&gt;, so that users with higher h-indices appear higher on the table. I will remove the dummy user names when the table has some actual content.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Example user name: 5&#xA;Another example: 3&#xA;Yet another user: 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2016-07-04T23:52:41.663" LastActivityDate="2016-07-04T23:52:41.663" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9505" PostTypeId="2" ParentId="2140" CreationDate="2016-07-04T23:58:25.750" Score="0" Body="&lt;h1&gt;Compute the mincut of a graph &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a &lt;a href=&quot;https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)&quot; rel=&quot;nofollow noreferrer&quot;&gt;graph&lt;/a&gt;, compute a division of the graph such that the edges stranded between the cut.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/viD75.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/viD75.png&quot; alt=&quot;hayo mouseover readers; leave a comment if you see this!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Red line: a cut&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Green line: a mincut&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The first line will contain the number of nodes. The rest of the lines will contain pairs of positive integer IDs separated by spaces showing connectedness between the nodes with those IDs. Here's an example; for a graph where 1 is connected to 2 and 2 is connected to 3:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3&#xA;1 2&#xA;2 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may assume that the nodes are numbered consecutively from one to the number of nodes. &lt;/li&gt;&#xA;&lt;li&gt;However, you may not assume that the list of pairs of nodes is in any specific order.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Simply output a comma-separated list of the IDs of the nodes of one of subgraphs created by the cut.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Additional Rules!&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;You cannot implement brute-force search.&lt;/strong&gt; Other than that, feel free to use &lt;a href=&quot;https://en.wikipedia.org/wiki/Karger%27s_algorithm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Karger's Algorithm*&lt;/a&gt; or another algorithm. Remember that Karger's algorithm is likely the easiest to implement. &lt;/li&gt;&#xA;&lt;li&gt;Notice: you must run Karger's algorithm at least &lt;a href=&quot;https://wikimedia.org/api/rest_v1/media/math/render/svg/715acbd0204487481aa29440a228cb0008d3253a&quot; rel=&quot;nofollow noreferrer&quot;&gt;this many times&lt;/a&gt; to ensure a low chance of failure and a low chance of failure&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;*Karger's algorithm&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For your convenience, I've included a simple description of Karger's algorithm.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;find two adjacent nodes and merge them into one node (so that all nodes that where connected to the original two nodes are connected to the new node), concatenating the labels&lt;/li&gt;&#xA;&lt;li&gt;repeat step one until there are only two nodes&lt;/li&gt;&#xA;&lt;li&gt;the result is any label of one of the nodes&lt;/li&gt;&#xA;&lt;li&gt;repeat steps 1-3 at least &lt;a href=&quot;https://wikimedia.org/api/rest_v1/media/math/render/svg/715acbd0204487481aa29440a228cb0008d3253a&quot; rel=&quot;nofollow noreferrer&quot;&gt;this many times&lt;/a&gt; to ensure a low probability of failure, and choose the result that occurs the most often&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2016-07-04T23:58:25.750" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="9506" PostTypeId="2" ParentId="9501" CreationDate="2016-07-05T05:30:27.383" Score="42" Body="&lt;p&gt;I tend to agree that there are a lot of rules for new users to &quot;discover&quot;, and that this is a bad thing (in general). However, I don't agree with your solution, because I don't see how it's any clearer at all. For many challenges and many languages, there isn't a &lt;em&gt;single most &quot;natural&quot; representation&lt;/em&gt; of input: &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Challenge: Sum the input list of numbers&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Ok, so what's the most obvious way to take input? In Java for example, you could take them from STDIN as strings (eww), or as an int array to a function. Oh wait, maybe an ArrayList instead? Hmm, maybe some other sort of List has some nifty builtin? Oh, right, I could use one of those stream things to do this I bet... &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now obviously this isn't the same as taking input in unary. Or is it? I mean, I guess I could take input as unary and just sum the lengths. Probably wouldn't make it shorter, but it would work. But what's the actual difference between that and deciding what sort of list to use, or whether to pull it from STDIN?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm sure you can come up with very simple examples for many languages to illustrate the point. There are multiple ways to take inputs in most languages for a reason, and I for one wouldn't try to argue with what's considered &lt;em&gt;most&lt;/em&gt; natural. Sure, some are &lt;em&gt;less&lt;/em&gt; natural than others, but that's a fine line to walk, and a hard border to draw.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Code golf is about golfing your code, not golfing the input or the output.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This sounds right and noble, but I don't think it's actually true here at all, nor should it be. In my opinion, we should be inspiring creativity, and encourage alternative ways to shorten the code. It's why I asked &quot;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2214/14215&quot;&gt;What's a string?&lt;/a&gt;&quot;, which isn't in your list above. Using a &lt;code&gt;char[]&lt;/code&gt; is shorter in many cases, and it's not &lt;em&gt;usually&lt;/em&gt; the &quot;most natural&quot; way you'd want to do it in production code&lt;sup&gt;1&lt;/sup&gt;, but &lt;strong&gt;I don't come here to write production code&lt;/strong&gt;&lt;sup&gt;2&lt;/sup&gt;. Choosing between &lt;code&gt;String&lt;/code&gt; and &lt;code&gt;char[]&lt;/code&gt; doesn't seem like much, but it's the same class of choice you're talking about when you talk about booleans or unary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are many ways to shorten code, and you have to choose among them for each particular challenge. The only way I see to get around this is to write strict rules for every. single. language. I see that as a recommendation in comments, but I think that would only lead to even more chaos. Since we accept any existing programming languages (and write our own from time to time), that's simply a recipe for disaster. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;After literally years of adapting our input/output rules to accommodate oddball languages and generally leaning toward leniency, I think this would be a huge step in the wrong direction.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1: Seriously. People will fight you for trying this in most workplaces. Like, a fistfight. Don't do it.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;2: Also, it would probably break the small piece of my soul that still likes C to hear that char arrays aren't the same things as strings, in any context.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-07-05T05:30:27.383" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9513" PostTypeId="2" ParentId="2140" CreationDate="2016-07-06T07:42:12.087" Score="0" Body="&lt;h1&gt;nth number that multiplies k equals its reverse&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golfing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golfing&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golfing&lt;/a&gt;,&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;It's quite simple, given &lt;code&gt;n&lt;/code&gt; and &lt;code&gt;k&lt;/code&gt;, output the &lt;code&gt;n&lt;/code&gt;th number such that, if the number is multiplied by &lt;code&gt;k&lt;/code&gt; and its digits reversed, it equals the original number. Both input and output are positive numbers.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The challenge originally is from &lt;a href=&quot;https://codegolf.stackexchange.com/users/45941/mego&quot;&gt;Mego&lt;/a&gt;, posted on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/84584/n-numbers-that-its-quadruple-equals-its-reverse#comment207232_84584&quot;&gt;my broken challenge&lt;/a&gt;.&#xA;Firstly, I used 4 instead of &lt;code&gt;k&lt;/code&gt;, but based on my tests, only 1 and 4 values gives output, so I decided to put 4 instead of k, finally I put &lt;code&gt;k&lt;/code&gt; back. But the challenge would be ruin with that putting &lt;code&gt;&quot;9&quot;*(n-1)&lt;/code&gt; between 2178, so no loopholes will be permitted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I just posted here for further discussions, suggestions and improvements.&lt;/p&gt;&#xA;" OwnerUserId="56037" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:26.977" LastActivityDate="2016-07-07T10:14:14.163" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="9514" PostTypeId="2" ParentId="2140" CreationDate="2016-07-06T08:42:07.470" Score="1" Body="&lt;h1&gt;What  is closer?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;,&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Inputs: a, b (Both integer and positive)&#xA;.Output: Integer, in natural numbers sequence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We have one single atom which has &lt;code&gt;a&lt;/code&gt; electrons, we ionize the atom with &lt;code&gt;b&lt;/code&gt; positive charges (take &lt;code&gt;b&lt;/code&gt; electrons out).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output is the sum of the orbital quantum numbers (n,l,ml) which is nearest to the atom shell.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;EXAMPLE: We take 3 electrons from &lt;sub&gt;26&lt;/sub&gt;Fe, Now we have &lt;sub&gt;26&lt;/sub&gt;Fe&lt;sup&gt;3+&lt;/sup&gt;. We need to get the sum of the nearest remained orbitals quantum numbers to the shell.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We have this configuration for Fe&lt;sup&gt;3+&lt;/sup&gt;: [Ar], 3d&lt;sup&gt;3&lt;/sup&gt;, 4s&lt;sup&gt;2&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The nearest orbital to shell has these numbers:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;n = 4&#xA;l = 0&#xA;ml = 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In this case:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a =&amp;gt; 26&#xA;b =&amp;gt; 3&#xA;output =&amp;gt; 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;My 3rd grade chemistry teacher asked me once to create such a program, but I didn't success, I found the paper that my teacher wrote these descriptions on it and I typed it here because I believe that someone might create an interesting code-golf for this.&lt;/p&gt;&#xA;" OwnerUserId="56037" LastEditorUserId="56037" LastEditDate="2016-07-06T10:27:13.127" LastActivityDate="2016-07-06T10:27:13.127" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9517" PostTypeId="2" ParentId="2140" CreationDate="2016-07-06T20:59:57.847" Score="0" Body="&lt;h1&gt;Let's play some Briscola&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Briscola&quot; rel=&quot;nofollow&quot;&gt;Briscola&lt;/a&gt; is an Italian game, played with a deck of 40 cards, divided in 4 suits - coins (denari - D), swords (spade - S), cups (coppe - C) and clubs (bastoni - B).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The values on the cards range numerically from one through seven, plus 3 special cards - knave (11), knight (12) and king (13).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Gameplay:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;After the deck is shuffled, each player is dealt three cards.&#xA;The next card is placed face up on the playing surface, and the remaining deck is placed face down.&#xA;This card is the Briscola, and represents the trump suit for the game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First player starts by playing one card face up on the playing surface.&#xA;Each player subsequently plays a card in turn, until all players have played one card.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner of that hand is determined as follows:&#xA;If any briscola (trump) has been played, the player who played the highest valued trump wins, else the player who played the highest card of the lead suit (suit of the first card played) wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Ranking&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Briscola has a special type of ranking:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1   ace&#xA;3   three&#xA;13  king&#xA;12  knight&#xA;11  knave&#xA;7&#xA;6&#xA;5&#xA;4&#xA;2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Standard loopholes apply.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;As an input, you must accept 5 values (cards), in a reasonable format, for example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;briscola (trump card), 1. card, 2. card, 3. card, 4.card&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Output:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You must output the winning card&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example input and output:&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4S 7D 12B 13B 2S -&amp;gt; 2S&#xA;5D 1D 5D 12S 3C -&amp;gt; 1D&#xA;3B 2C 4S 5S 7D -&amp;gt; 2C&#xA;12D 3S 11B 1B 7S -&amp;gt; 3S&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="30715" LastActivityDate="2016-07-06T20:59:57.847" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9518" PostTypeId="2" ParentId="2140" CreationDate="2016-07-07T10:25:48.300" Score="0" Body="&lt;p&gt;Write a program that can determine the median value of a read-only (static, const, immutable) sequence of unsorted numbers (array, list, stream) but minimises storage, without completely sacrificing speed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The basic bracket is that if we copied all the values into a sorted list and then picked the middle one (or average of the middle pair), it would require storage of the whole sequence, so the storage would be 'n', and the performance would be O(n log n).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The score is the total cost of finding the median of 1 bn values, divided by 1 bn, at a cost of 8 per value stored, 1 per comparison or numerical operation and 1 per read, for the worst case. Thus if our insertion sort costs exactly &lt;code&gt;n*log2(n)&lt;/code&gt;, the for 1 bn values the total score is 1 for the read, 29.8 for the sort + 8 for the storage, for a total of 37.8.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If instead we skimmed the whole range to get the average (costing 1 for the read and 1 for the summation), we could then only store some portion of the range to sort; but then we would need a second pass to be sure that there were an equal number of values above and below this median (at the cost of another 2).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lowest score wins, low-level languages (C/C++/D) only so that we can count the actual operations.&lt;/p&gt;&#xA;" OwnerUserId="14710" LastActivityDate="2016-07-07T10:25:48.300" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9519" PostTypeId="1" CreationDate="2016-07-07T12:30:44.783" Score="1" ViewCount="129" Body="&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges&quot;&gt;Privileges&lt;/a&gt;, It says creating posts is a privilege limited with 1 reputation. Then If someone's reputation drops to 0, can't they create posts?&lt;/p&gt;&#xA;" OwnerDisplayName="user54200" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-07-11T14:14:42.930" Title="When reputation drops to 0, Is asking not allowed?" Tags="|support|reputation|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9520" PostTypeId="2" ParentId="9519" CreationDate="2016-07-07T12:37:15.933" Score="4" Body="&lt;p&gt;Reputation can't drop to zero. &lt;a href=&quot;https://codegolf.stackexchange.com/help/whats-reputation&quot;&gt;It never falls below 1.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-07-07T12:37:15.933" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9521" PostTypeId="2" ParentId="9519" CreationDate="2016-07-07T12:51:13.063" Score="1" Body="&lt;p&gt;Creating a post is a privilege, because it can be taken from you. If you post too many badly scored questions or you delete them there's a chance you won't be able to post any more.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because reputation can't below 1 (as others noted) this is the only way to lose this privilege.&lt;/p&gt;&#xA;" OwnerUserId="49709" LastActivityDate="2016-07-07T12:51:13.063" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9522" PostTypeId="1" CreationDate="2016-07-07T13:44:26.977" Score="-4" ViewCount="170" Body="&lt;p&gt;I am currently trying to create a scripting language which is usable for general purpose tasks but has a high golfing potential due to many short built-in functions, operators, syntax etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the moment I'm wondering which character encoding would be best to use. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I really want to use a single byte per character encoding to make scoring easy and to avoid using special symbols as single-character operator that actually take multiple bytes.&lt;/li&gt;&#xA;&lt;li&gt;The codec should ideally not waste too many characters on non-printable control characters or use less than the full 8 bits like ASCII.&lt;/li&gt;&#xA;&lt;li&gt;I would prefer a codec which contains a fair amount of symbols that are easier to understand as operators rather than one that mainly contains alphabetic characters in numerous variations, e.g. with different accents.&lt;/li&gt;&#xA;&lt;li&gt;On the other hand all of its characters should be relatively easy typeable using a standard keyboard so that we do not need a hex editor to code. However, many symbols are more important than easy typeability.&lt;br&gt;&#xA;If necessary, I might also write a tool that converts typed characters or character representation strings in a standard encoding like UTF-8 to my specific codec, so that e.g. if this codec will contain a symbol &lt;code&gt;→&lt;/code&gt;, the converter could treat &lt;code&gt;--&amp;gt;&lt;/code&gt; as representation of that.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Based on these criteria, can you recommend me some existing character codecs that could suit my needs? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or should I assemble my own codec as well that contains all those symbols I want? What steps would be needed to officially publish such a codec then so that it may be used on the site?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any guidance regarding this topic is appreciated, thanks in advance.&lt;/p&gt;&#xA;" OwnerUserId="36188" LastEditorUserId="36188" LastEditDate="2016-07-07T14:01:17.903" LastActivityDate="2016-07-07T14:15:05.933" Title="Suitable single-byte character encoding for new golfing language" Tags="|discussion|characters|" AnswerCount="1" CommentCount="1" ClosedDate="2016-07-07T14:21:47.873" ContentLicense="CC BY-SA 3.0" />
  <row Id="9523" PostTypeId="2" ParentId="9522" CreationDate="2016-07-07T13:55:25.807" Score="2" Body="&lt;p&gt;The &lt;a href=&quot;https://github.com/DennisMitchell/jelly/wiki/Code-page&quot; rel=&quot;nofollow&quot;&gt;Jelly codepage&lt;/a&gt; has a lot of characters, all typable from a US International keyboard, so I think this fit your needs.&lt;/p&gt;&#xA;" OwnerUserId="53745" LastEditorUserId="45151" LastEditDate="2016-07-07T14:15:05.933" LastActivityDate="2016-07-07T14:15:05.933" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9525" PostTypeId="2" ParentId="2140" CreationDate="2016-07-07T18:29:59.307" Score="0" Body="&lt;h1&gt;Reinventing the Modularization Wheel&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a language of your choice, implement a function or language construct that imports another file of the same language and executes it, making exported values from that file available to the calling file. If one already exists, you may not use it in your implementation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, in Node, you would have to implement &lt;code&gt;require()&lt;/code&gt; without using &lt;code&gt;require()&lt;/code&gt;, even indirectly. In C, you would implement a function or construct equivalent to &lt;code&gt;#include&lt;/code&gt; without using &lt;code&gt;#include&lt;/code&gt; in the implementation. In Python, you would implement &lt;code&gt;import&lt;/code&gt;. In client-side JavaScript, I suppose the closest equivalent would be &lt;code&gt;&amp;lt;script src=&quot;...&quot;&amp;gt;&amp;lt;/script&amp;gt;&lt;/code&gt;. So JavaScript implementations would be restricted to AJAX calls only, since &lt;code&gt;&amp;lt;script&amp;gt;&lt;/code&gt; tags would not be allowed in the implementation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is not to say that you aren't allowed to use the built-in import &lt;em&gt;at all&lt;/em&gt;, but only use them in the implementation. The intention here is to reinvent the wheel.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Requirements&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do not include the built-in modularization in any way in your import implementation.&lt;/li&gt;&#xA;&lt;li&gt;Standard libraries only.&lt;/li&gt;&#xA;&lt;li&gt;Byte-count includes the implementation itself, and any special changes that need to exist on the file being imported, if any.&lt;/li&gt;&#xA;&lt;li&gt;The function or construct accepts a relative file path. As long as this is satisfied, you may extend the functionality of your modularization to have global imports, or even remote imports (like using a URL as input).&lt;/li&gt;&#xA;&lt;li&gt;The imported file must have a construct for denoting values that must be exported. Only these values should be directly accessible from the calling file. &lt;/li&gt;&#xA;&lt;li&gt;Using the built-in export function or construct of your language is acceptable, and if it is a built-in, it does not need to be included in your byte-count.&lt;/li&gt;&#xA;&lt;li&gt;If your language does not have modularization, then implementing a mechanic for exporting should be included in your byte-count.&lt;/li&gt;&#xA;&lt;li&gt;Document the usage of your function or construct.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and the shortest answer in bytes wins!&lt;/h3&gt;&#xA;" OwnerUserId="42091" LastEditorUserId="42091" LastEditDate="2016-07-07T18:37:08.233" LastActivityDate="2016-07-07T18:37:08.233" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9526" PostTypeId="1" CreationDate="2016-07-07T18:39:51.590" Score="0" ViewCount="91" Body="&lt;p&gt;I think this tag could apply to several of the posts on this site, and is a good canonical name describing the intention of a challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/reinventing-the-wheel&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;reinventing-the-wheel&amp;#39;&quot; rel=&quot;tag&quot;&gt;reinventing-the-wheel&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It could possibly be a tag accommodating different types of challenges, but I see it as mostly accommodating a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge. A challenge would be given this tag if it asks to create a function or language construct to accomplish a task, and restricts answers from using the language's exact and &lt;em&gt;similar&lt;/em&gt; built-ins within the implementation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I find that fleshing out exactly what &quot;similar&quot; means in this case would be in the interest of the community to balance creativity and close loopholes in the spirit of preventing the challenge from becoming too trivial. My question, however, is not proposing to define what that means yet though, just whether this tag should exist or not.&lt;/p&gt;&#xA;" OwnerUserId="42091" LastEditorUserId="42091" LastEditDate="2016-07-07T19:08:19.613" LastActivityDate="2016-07-07T19:08:19.613" Title="Add a tag for reinventing-the-wheel?" Tags="|discussion|tags|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9527" PostTypeId="2" ParentId="9526" CreationDate="2016-07-07T18:53:16.400" Score="7" Body="&lt;h2&gt;No&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I don't think such a tag is necessary, nor would it be a good idea. At what point is a task considered common? For example, is implementing a fast Fourier transform common? Perhaps for some it is, and for many it isn't. &quot;Common&quot; can't be precisely defined. As such there wouldn't be an objective way to determine whether the tag is appropriate for a given challenge.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-07-07T18:53:16.400" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9528" PostTypeId="2" ParentId="9526" CreationDate="2016-07-07T19:00:13.883" Score="-3" Body="&lt;h2&gt;Yes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This tag would remove confusion from many &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges where the asker does not know how to definitively say that &quot;built-ins are allowed except for the built-in that implements what I'm asking you to&quot;, and we could have the tag wiki break down exactly what the rules are to prevent loopholes when wanting to post challenges that are particular about doing this in the spirit of reinventing the wheel.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, a challenge asks to implement an FFT. Okay, it's clear the asker forbids using a built-in FFT. But they didn't realize that a built-in DFT does not violate their restriction, and disregards the challenge's intention of reinventing the wheel. Using this tag as a way of saying that is also forbidden would make specifying challenge restrictions a lot easier.&lt;/p&gt;&#xA;" OwnerUserId="42091" LastActivityDate="2016-07-07T19:00:13.883" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9529" PostTypeId="2" ParentId="7377" CreationDate="2016-07-07T21:15:51.257" Score="28" Body="&lt;h1&gt;&lt;a href=&quot;http://minecraft.gamepedia.com/Structure_Block&quot; rel=&quot;nofollow&quot;&gt;There is now an MC Standard for bytecount.&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;With the 1.10 update, they introduced a block called the &quot;&lt;a href=&quot;http://minecraft.gamepedia.com/Structure_Block&quot; rel=&quot;nofollow&quot;&gt;structure block&lt;/a&gt;&quot;, which creates a .nbt file representing a structure in its entirety that can be measured in bytes. As this is a Minecraft standard for converting builds into bytes, this should be our standard as well.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="44713" LastEditDate="2016-07-08T04:54:45.803" LastActivityDate="2016-07-08T04:54:45.803" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="9531" PostTypeId="2" ParentId="2140" CreationDate="2016-07-08T07:26:39.880" Score="0" Body="&lt;h1&gt;Print a Pilcrow Scarecrow&lt;/h1&gt;&#xA;&lt;p&gt;Print the following ascii scarecrow using the &lt;a href=&quot;https://en.wikipedia.org/wiki/Pilcrow&quot; rel=&quot;nofollow noreferrer&quot;&gt;pilcrow&lt;/a&gt; character &lt;code&gt;¶&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    ¶¶¶&#xA;   ¶¶¶¶¶&#xA;    ¶¶¶&#xA;    ¶¶¶  ¶&#xA; ¶¶¶¶¶¶¶¶¶¶&#xA;    ¶¶¶&#xA;    ¶¶¶&#xA;   ¶ ¶ ¶&#xA;  ¶¶ ¶ ¶¶&#xA;     ¶&#xA;     ¶&#xA;¶¶¶¶¶¶¶¶¶¶¶&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Padding must be with &lt;code&gt; &lt;/code&gt; (space) and built with &lt;code&gt;¶&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Trailing padding is okay&lt;/li&gt;&#xA;&lt;li&gt;Print to stdout&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="45348" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-08T07:26:39.880" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9536" PostTypeId="2" ParentId="9463" CreationDate="2016-07-08T21:11:38.863" Score="55" Body="&lt;p&gt;&lt;a href=&quot;https://tryitonline.net&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/acAlp.png&quot; alt=&quot;Over 170 online interpreters. Free of charge, open source, and ad-free.&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="12012" LastEditDate="2017-01-14T18:00:31.673" LastActivityDate="2017-01-14T18:00:31.673" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9537" PostTypeId="1" AcceptedAnswerId="9538" CreationDate="2016-07-09T00:30:41.790" Score="1" ViewCount="87" Body="&lt;p&gt;If there is a code golf competition are you allowed to submit a submission that is clearly not going to win? I.E thousands of bytes? I know they do say that solutions must be serious competing entries, but for the sake of a complete answer as well as personal interest are such answers permitted. I feel like these esolangs are really killing languages like Java and Python. Are such answers permitted?&lt;/p&gt;&#xA;" OwnerUserId="46918" LastActivityDate="2016-07-09T00:43:27.900" Title="Is short code mandatory in a code golf submission?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ClosedDate="2016-07-11T15:56:04.910" ContentLicense="CC BY-SA 3.0" />
  <row Id="9538" PostTypeId="2" ParentId="9537" CreationDate="2016-07-09T00:43:27.900" Score="7" Body="&lt;p&gt;All answers must be serious contenders for the winning criteria in use. For code golf, that means you should make your code as short as you can.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What this means:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Don't leave any superfluous whitespace in your code.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Don't make variable names longer than they have to be.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Don't implement features the challenge doesn't require (prompts, input checks, etc.).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Don't get hung up on best practices or style guides. Code golf is about &lt;em&gt;short&lt;/em&gt; code, not &lt;em&gt;good&lt;/em&gt; code.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You can still use any language you like, no matter how verbose. Just try to make the answer &lt;em&gt;in that language&lt;/em&gt; as short as you can. Comparing scores of different languages is rather meaningless anyway, even when it comes to &quot;real&quot; languages. J almost always beats Perl, which almost always beats Python, which almost always beats Java, which almost always beats Rust...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that I said &lt;em&gt;as short as &lt;strong&gt;you&lt;/strong&gt; can&lt;/em&gt;. Even if somebody posts a shorter solution, you shouldn't feel discouraged.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Summing up, just have fun golfing and don't worry about that rule.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2016-07-09T00:43:27.900" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9539" PostTypeId="1" AcceptedAnswerId="9541" CreationDate="2016-07-09T01:01:39.813" Score="1" ViewCount="100" Body="&lt;p&gt;What is the current community opinion on this action. While certainly a downvoted is a very clear way of leaving direct feedback. I feel that downvoting a question that is already on hold is almost like &quot;kicking someone while they are down&quot;. My question is, should we downvote such questions or should we actively edit it to make it better and reopen?&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorDisplayName="user45941" LastEditDate="2016-07-09T01:37:19.817" LastActivityDate="2016-07-09T01:45:21.577" Title="Downvoting Questions on Hold" Tags="|discussion|challenges|closed-questions|voting|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9540" PostTypeId="2" ParentId="9539" CreationDate="2016-07-09T01:36:57.550" Score="4" Body="&lt;p&gt;Downvoting is for challenges you dislike (perhaps because they are trivial, or they're just not interesting to you).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Close-voting is for challenges that have serious content problems and need to be closed/put on hold in order to work them out (duplicate, off-topic, unclear, too broad, or opinion-based).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These are not mutually exclusive. It is perfectly reasonable to downvote a challenge that you dislike because it is trivial &lt;em&gt;and&lt;/em&gt; cast a close-vote because it isn't entirely clear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Voting on closed/on-hold challenges is perfectly fine (if it wasn't, you wouldn'e be able to do it). The score of an on-hold challenge can be an indicator of how much the community would like to see the challenge fixed - an on-hold challenge with a positive score would likely be well-received if the content issues were fixed, but an on-hold challenge with a negative score is probably not worth the effort to edit and reopen.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Down)voting and close-voting serve two separate purposes. It's perfectly fine to do both, if you think you should.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2016-07-09T01:36:57.550" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9541" PostTypeId="2" ParentId="9539" CreationDate="2016-07-09T01:45:21.577" Score="9" Body="&lt;p&gt;Voting and closing serve two separate purposes, so doing both can send two separate signals. The purpose of a (challenge) downvote, as per the tooltip that appears when you hover over it, is:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This question does not show any research effort; it is unclear or not useful&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Granted, the description is a bit &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8355/3808&quot;&gt;out of place&lt;/a&gt; on PPCG, but downvotes should be used for challenges that are low-effort, unintelligible, or otherwise of poor quality (underspecified, etc.). A downvote &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/vote-down&quot;&gt;&quot;nudges [a challenge] 'down'&quot;&lt;/a&gt; so that our best challenges rise to the top.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Accordingly, you may want to vote to close but &lt;em&gt;not&lt;/em&gt; downvote a challenge when you believe it is high in quality, but has other problems in its current state. If a question is clear and on-topic but otherwise low-quality (maybe it's unfair, overly arbitrary, or just a bad challenge), you could downvote without voting to close.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, closing a challenge serves as an indicator that the challenge is &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/close-questions&quot;&gt;&quot;unreasonable to answer in [its] current state, or [does] not belong on the site&quot;&lt;/a&gt;. Putting a challenge on hold simply marks it as &quot;unsuitable for answers, for now.&quot; Closing a challenge and upvoting it, downvoting it, or not voting at all are all perfectly reasonable in different situations.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;should we downvote such questions or should we actively edit it to make it better and reopen?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Downvoting and editing improvements into a challenge are not mutually exclusive. That's why edits clear the vote timeout so you can reverse your downvote—if the challenge has been sufficiently improved after being edited, you can undo your vote or change it to an upvote. Downvoting a challenge &lt;em&gt;while it is worthy of being downvoted&lt;/em&gt; is a good thing.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-07-09T01:45:21.577" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9543" PostTypeId="2" ParentId="2140" CreationDate="2016-07-09T07:52:01.280" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;KotH Chess Warriors.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This game will be based on fairy chess, but really could be imagined to be anything else.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Submissions will include both: A function that determines the moves of the piece (as in, how the piece can move), called at the start, and a function that determines how it moves each turn, called each turn, of course. Bot's move simultaneously; strategy is needed. A piece may make 5 moves in a row before it must rest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bot's will be able to do any valid move they choose, and the input they will get when deciding what to do will be: a value that can be 2, 1, 0, or -1, for each possible move. 2 denotes that an ally is in that square, 1 denotes that an enemy is in that space. 0 denotes an empty space which could be moved to, -1 represents an illegal move, which may result from the board ending or another piece in the way. If a piece attempts to move into it's ally, the following things could happen; A) ally stays still; Piece stays where it is. B) ally moves; Piece moves where it wishes. C) ally is captured; Piece recaptures&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See below for early stage point spending system&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I don't have the experience to host this challenge, so someone who can program these kind of things will need to help.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have sketched out some movement point system, but I need to figure out how large the board is, and so how valuable riders (pieces that move continously, like a rook), would be, compared to leapers, before i could finalise it&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is the quick system done, which could clearly be improved (for one thing, the multiple move thing probably needs to be a bit more expensive):&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Point buying system&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Points: each piece receives (to be decided) points&#xA;base move: points spent on a move are as so. Largest dimension + floor(small dimension/2).&#xA;There are no riders in this mode; Only repeated movement&#xA;Repeated movement by x cost:*ceil(x^1.25)&#xA;make move-only=/2&#xA;It is possible to have a leaping attack and sliding attack on the same square; it is also possible to have only one of these able to attack; How this is sorted is that both moves get their own value, and so you can attack if the attack move by itself can reach there.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples for base move costs:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any king move: 1&lt;/li&gt;&#xA;&lt;li&gt;any knight move: 2&lt;/li&gt;&#xA;&lt;li&gt;Zebra move:4&lt;/li&gt;&#xA;&lt;li&gt;Camel move:3&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;PLEASE NOTE: These move values on their own are not representative of how powerful a piece with that move actually is; A knight is better than a camel or zebra. However, when paired with other moves, the zebra and camel moves may become effective.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example of moves that can be purchased:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;     1&#xA;7   2  3&#xA;6    @55555&#xA;     4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;move 1=(2+floor(0/2)):2 points&lt;/li&gt;&#xA;&lt;li&gt;move 2=(1+floor(1/2)):1 point&lt;/li&gt;&#xA;&lt;li&gt;move 3=(2+floor(1/2)):2 points&lt;/li&gt;&#xA;&lt;li&gt;move 4=(1+floor(0/2)): 1 point&lt;/li&gt;&#xA;&lt;li&gt;move 5=((1+floor(0/2))*ceil(5^1.25))=8 points&lt;/li&gt;&#xA;&lt;li&gt;move 6=(5+floor(0/2))=5 points&lt;/li&gt;&#xA;&lt;li&gt;move 7=(5+floor(1/2))=5 points&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;in total, this piece costs: (2+2+1+1+8+5+5) 24 points.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Considerations:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How large the board is. I'm fairly sure of having a cylindrical board; the left wraps to the right and vice versa.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;how exactly turns work. So far, I have thought that the way it works is this:&#xA;Everyone moves simultaneously. When you move, you deplete your remaining moves, which tops and starts at 5. You can choose to not move, and replenish your moves at any point.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, this could induce stale games which don't end properly.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="55896" LastEditorUserId="55896" LastEditDate="2016-07-09T08:53:11.447" LastActivityDate="2016-07-09T08:53:11.447" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9545" PostTypeId="2" ParentId="2140" CreationDate="2016-07-09T12:30:59.250" Score="0" Body="&lt;h1&gt;It's time to unify!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/logic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;logic&amp;#39;&quot; rel=&quot;tag&quot;&gt;logic&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Wouldn't it be awesome if they whole world would be united and there would be no conflicts and disputes? Now while you can't unify nations, you certainly can unify expressions to resolve their unknown relation and conflicts.&lt;br&gt;&#xA;Your mission is simple: Unify the world (of expressions)!&lt;br&gt;&#xA;And of course, because you're lazy you want to do this with the least effort (read: code-length) possible.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your input will be a &lt;a href=&quot;https://en.wikipedia.org/wiki/Unification_(computer_science)&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;unification problem&lt;/em&gt;&lt;/a&gt;. &lt;strong&gt;You can format it however you want and need, as long as you don't encode additional information to what is given in the standard / example format.&lt;/strong&gt; Encoding the number of arguments per function into the input is allowed but not mandatory, you can also just derive this from the input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example format:&lt;br&gt;&#xA;Your first input will be list of function symbols, which is represented as a list of pairs of strings and non-negative integers.&lt;br&gt;&#xA;Your second input will be a list of equalities (you may represent each as a string), which represent the unification problem. They will be represented as a list of strings as well. Anything which is not a parenthesis or an equality sign can be considered a variable. If the number of arguments is 0, parenthesis are omitted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example input:&#xA;&lt;code&gt;[(&quot;f&quot;,1),(&quot;g&quot;,2),(&quot;h&quot;,3),(&quot;a&quot;,0)], [x=f((g(a,y)),y=h(g(f(a),z),f(z),a)]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The output is either some falsy value or something representing a list of equalities. It is allowed to use the empty list to indicate a falsy value.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;What to do?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You need to unify the inputs you got. In the end there must only be variables on the left side of the equality-signs if the you didn't encounter an error. If you did you need to report it (-&gt; false or empty list).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To do the unification, you can - but don't have to - use &lt;a href=&quot;https://en.wikipedia.org/wiki/Unification_(computer_science)#A_unification_algorithm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Martelli and Montanari's algorithm&lt;/a&gt;, which goes as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;E is always the (complete) set of equalities except the current one&#xA;x,y,z are variables, f,g,h are functions, t1,t2, ...,tn,s1,...,sn are arbitrary terms (compositions of functions and variables)&#xA;{x=x} E =&amp;gt; E, e.g. if you encounter two equivalent variables, discard&#xA;{f(t1,...,tn)=f(s1,...,sn)} E =&amp;gt; {t1=s1,t2=s2,...,tn=sn} E, e.g. if you encounter the same function on both sides, unify the arguments along with your rest&#xA;{f(t1,...,tn}=g(s1,...,sn)} E =&amp;gt; Error, if the symbols are different, you can't succeed&#xA;{x=f(t1,...,tn)} E =&amp;gt; {x=f(t1,...,tn)} E[x -&amp;gt; f(t1,...,tn)], e.g. if you see a variable equals a term, replace the variable with this term in all other expressions&#xA;{x=f(t1,...,tn)} E =&amp;gt; Error, e.g. if any of the t1,..,tn contain x at some point&#xA;{f(t1,...,tn)=x} E =&amp;gt; {x=f(t1,...,tn)} E, e.g. if you see a variable &quot;naked&quot; on the right side, swap the sides&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Two step-by-step examples are provided below additionally to the test cases.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Corner Cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You can get an empty list of function symbols, this means you have exclusively variables in the second input.&lt;br&gt;&#xA;The input list of equalities will never be empty, your code does not need to handle this case.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Who wins?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is code-golf so the shortest answer in bytes wins!&lt;br&gt;&#xA;Standard rules apply of course.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test-cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;All these test cases use the functions [(&quot;a&quot;,0),(&quot;b&quot;,0),(&quot;f&quot;,1),(&quot;g&quot;,1),(&quot;h&quot;,2)]&#xA;&#xA;[x=b] -&amp;gt; [x=b]&#xA;[a=x] -&amp;gt; [x=a]&#xA;[a=b] -&amp;gt; []&#xA;[y=f(x)] -&amp;gt; [y=f(x)] &#xA;[x=f(x)] -&amp;gt; []&#xA;[f(x)=f(y)] -&amp;gt; [x=y] &#xA;[f(x)=g(y)] -&amp;gt; []&#xA;[h(x,y)=h(a,b)] -&amp;gt; [x=a,y=b] &#xA;[x=f(z),y=f(a),x=y] -&amp;gt; [x=f(a),y=f(a),z=a]&#xA;[h(x,f(y))=z,z=h(f(y),v)] -&amp;gt; [x=f(y),v=f(y),z=h(f(y),f(y))]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Step-By-Step Example&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Example 1: Test Case 9&#xA;[x=f(z),y=f(a),x=y] =&amp;gt; (replace x in third equation with first x)&#xA;[x=f(z),y=f(a),f(z)=y] =&amp;gt; (replace y in third equation)&#xA;[x=f(z),y=f(a),f(z)=f(a)] =&amp;gt; (remove f's in third equation)&#xA;[x=f(z),y=f(a),z=a] =&amp;gt; (replace the z in the first expression)&#xA;[x=f(a),y=f(a),z=a]&#xA;&#xA;Example 2:&#xA;Let [(&quot;f&quot;,2),(&quot;g&quot;,2),(&quot;a&quot;,0),(&quot;b&quot;,0)] be your functions&#xA;[f(g(a,x),g(y,b)=f(x,g(v,w)),f(x,g(v,w))=f(g(x,a),g(v,b))] =&amp;gt; (remove f in second equation)&#xA;[f(g(a,x),g(y,b)=f(x,g(v,w)),x=g(x,a),g(v,w)=g(v,b))] =&amp;gt; (function symbol missmatch in equation 2)&#xA;[]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="55329" LastEditorUserId="55329" LastEditDate="2016-07-09T20:40:39.540" LastActivityDate="2016-07-09T20:40:39.540" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9547" PostTypeId="2" ParentId="9463" CreationDate="2016-07-09T18:30:10.593" Score="21" Body="&lt;p&gt;&lt;a href=&quot;http://www.github.com/Zomis/Brainduck&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/TZ7Yz.png&quot; alt=&quot;Brainduck - Difficult languages need powerful IDEs&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="18865" LastActivityDate="2016-07-09T18:30:10.593" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9548" PostTypeId="1" AcceptedAnswerId="9550" CreationDate="2016-07-09T20:13:29.663" Score="24" ViewCount="826" Body="&lt;p&gt;So over the past week I've developed &lt;a href=&quot;https://github.com/SocraticPhoenix/JAISBaL&quot; rel=&quot;nofollow noreferrer&quot;&gt;Just Another Interpreted Stack-Base Language (JAISBaL for short)&lt;/a&gt;, and I had a few questions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is there any reason JAISBaL would be illegal to use for the general &lt;code&gt;code-golf&lt;/code&gt; tagged challenges? (I've seen other questions asking about introduction of new languages, and the answer to this questions seems to be no, other than the fact that JAISBaL will only be usable on new questions)&lt;/li&gt;&#xA;&lt;li&gt;Is it legal to use a custom character encoding (for the most part)? I've seen the Jelly codepage, but I'm not sure if that's a custom encoding or a subset of another standard&lt;/li&gt;&#xA;&lt;li&gt;Is it a huge problem if the interpreter must be downloaded? I only really know Java, so that's  what I wrote the interpreter in&lt;/li&gt;&#xA;&lt;li&gt;How exactly do I go about introducing the language to &lt;code&gt;code-golf&lt;/code&gt;? Do I just start answering new questions in the language, or is there some 'registration' I need to go through?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;Finally, on a slightly unrelated note, where can I find the full rules for &lt;code&gt;code-golf&lt;/code&gt;, the tag popup doesn't seem to provide the full list. For example, is it legal for two people to post an answer in the same language (I've never seen this occur, so that's why I'm asking)?&lt;/s&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Edit: Yay &quot;learn more&quot; button: &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;https://codegolf.stackexchange.com/tags/code-golf/info&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="56085" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2016-07-11T01:15:08.233" Title="Introducing a New Golf Language" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9550" PostTypeId="2" ParentId="9548" CreationDate="2016-07-09T20:34:01.937" Score="21" Body="&lt;p&gt;First of all, welcome to Programming Puzzles &amp;amp; Code Golf! I'm thrilled you've joined our community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's no registration process for using a new language--just start using it! It's generally a good idea to include a link to information about the language and its encoding, as well as the location of a usable interpreter, in the post. That will be helpful for users unfamiliar with it and for challenge authors to test your submissions. It's fine if the interpreter has to be downloaded so long as it's available to download somewhere and there are instructions for how to get it set up.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any answer can use any existing encoding so long as the answer works as expected when its source code is encoded using that particular encoding. For reference, here's our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5879/20469&quot;&gt;policy on answer encodings&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let me know if you need any further clarification on anything, and again welcome!&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2016-07-09T20:34:01.937" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9553" PostTypeId="2" ParentId="6918" CreationDate="2016-07-09T22:31:26.810" Score="12" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/DJMcMayhem/V&quot; rel=&quot;nofollow noreferrer&quot;&gt;V&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;V, short for vim and pronounced &amp;quot;vee&amp;quot; is a golfing language designed by me. V operates by performing transformations on a giant 2D array of strings. Although all of the builtins are fairly simple and trivial operations, such as &lt;code&gt;dw&lt;/code&gt;, (d)elete a (w)ord, or &lt;code&gt;fn&lt;/code&gt;, (f)ind the next occurrence of the character (n), they are very modular and can be composed into larger commands. For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ò                 &amp;quot;Recursively:&#xA;           &amp;quot;Ad    &amp;quot;Delete into register 'a'&#xA;          2   tn  &amp;quot;until the second occurrence of 'n'&#xA; :g/regex/        &amp;quot;on every line where 'regex' matches somewhere on that line.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;A little backstory on the language. Vim is my favorite text editor. I &lt;em&gt;love&lt;/em&gt; tinkering with vim, configuring vim, playing with vim plugins, writing vim plugins, answering questions on vi.se, etc. In February of 2016, I wrote &lt;a href=&quot;https://codegolf.stackexchange.com/a/70970/31716&quot;&gt;an answer&lt;/a&gt; to a code-golf question in vim, which kinda blew my mind since I had not ever used vim as a &amp;quot;programming language&amp;quot; before. I started using vim for code-golf more and more. After tinkering with it enough, I realized it's not just &lt;em&gt;usable&lt;/em&gt; for string based challenges, it's &lt;strong&gt;competitive&lt;/strong&gt; at string based challenges!&lt;/p&gt;&#xA;&lt;p&gt;Even though vim has no concept of numbers, it is even turing complete through it's use of recursive macros and the increment &lt;code&gt;&amp;lt;C-a&amp;gt;&lt;/code&gt; and decrement &lt;code&gt;&amp;lt;C-x&amp;gt;&lt;/code&gt; commands. However, it's kind of a pain to work with vim for anything beyond the simplest of challenges.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Vim's concept of conditionals is hacky at best, and requires a lot of boilerplate code&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Taking input is a pain, since you have to manually type the input into a vim buffer at the start of a program, and then save the output at the end of the program. Running the program is also a pain since it's not automated and some minor details can throw the whole thing off. You also have to manually specify launching vim with no loaded options or info for the submission to be valid.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Vim's handling of numbers is &lt;strong&gt;abysmal&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;V was written to overcome all of these problems. A lot of these problems are still there, since V is definitely a work in progress, but some drastic improvements are already there. The biggest improvement is the automation. You don't have to manually type the program to run it!&lt;/p&gt;&#xA;&lt;p&gt;Another improvement is the shortening of common vim idioms that take too many bytes. For example, to execute &lt;code&gt;foo&lt;/code&gt; until it throws an error in vim, you can do this with&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;qqfoo@qq@q&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This program has a whopping &lt;strong&gt;seven bytes&lt;/strong&gt; of purely boilerplate code! And also, if a user less familiar with vim tries to test this, and forgets to launch vim with no loaded settings, this will cause undefined behavior. Completely unacceptable for code-golf. In V, this is brought down to&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;òfooò&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;With no undefined behavior. Although the second &lt;code&gt;ò&lt;/code&gt; is implicit, so the real program would be&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;òfoo&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Regexes are also &lt;em&gt;drastically&lt;/em&gt; shortened, and a global stack plus some simple math operations are in progress.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-09T22:31:26.810" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9554" PostTypeId="2" ParentId="9463" CreationDate="2016-07-10T02:47:40.410" Score="27" Body="&lt;p&gt;&lt;a href=&quot;https://github.com/Timwi/EsotericIDE/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/dfT0Q.png&quot; alt=&quot;Esoteric IDE — Interpreter/Debugger for esoteric programming languages&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="668" LastEditorUserId="668" LastEditDate="2016-07-10T23:56:40.717" LastActivityDate="2016-07-10T23:56:40.717" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9557" PostTypeId="2" ParentId="2140" CreationDate="2016-07-10T10:47:32.767" Score="0" Body="&lt;h1&gt;create a golfed down regexp that matches all substrings&lt;/h1&gt;&#xA;&lt;p&gt;inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/84841/determine-the-luck-of-a-string&quot;&gt;Determine the &amp;quot;Luck&amp;quot; of a string&lt;/a&gt; where I found a way to golf almost 30 bytes at once&lt;br /&gt;&#xA;(with a falling trick for that challenge, but I still like the idea).&lt;/p&gt;&#xA;&lt;p&gt;The word &amp;quot;lucky&amp;quot; contains 15 different substrings:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;lucky&lt;/li&gt;&#xA;&lt;li&gt;luck, ucky&lt;/li&gt;&#xA;&lt;li&gt;luc, uck, cky&lt;/li&gt;&#xA;&lt;li&gt;lu, uc, ck, ky&lt;/li&gt;&#xA;&lt;li&gt;l, u, c, k, y&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;br /&gt;&#xA;Create a program or function that, for a given string &lt;code&gt;s&lt;/code&gt;, creates the shortest possible regexp using basic PCRE syntax that matches and returns all substrings of &lt;code&gt;s&lt;/code&gt; and nothing else.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;code needs not to be case sensible&lt;/li&gt;&#xA;&lt;li&gt;basic syntax means: alternatives, quantifiers, grouping and custom character classes (e.g. &lt;code&gt;[abc]&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;other features (assertions, backreferences, recursion etc.) may be used, but are not required to qualify&lt;/li&gt;&#xA;&lt;li&gt;the result may include delimiters and modifiers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The result for &lt;code&gt;lucky&lt;/code&gt; would be &lt;code&gt;l?ucky?|l?uc?|c?ky?|l|c|y&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;is the description sufficient?&lt;/li&gt;&#xA;&lt;li&gt;the challenge not too easy, not too hard?&lt;/li&gt;&#xA;&lt;li&gt;any other hints you might have?&lt;/li&gt;&#xA;&lt;li&gt;I will add test cases that expose possible bugs (like &lt;code&gt;silly&lt;/code&gt; and &lt;code&gt;digdug&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;not sure yet if I will go for shortest code yet&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="55735" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-10T11:12:23.010" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9558" PostTypeId="2" ParentId="2140" CreationDate="2016-07-10T16:22:58.483" Score="0" Body="&lt;h1&gt;Golf your way from (inc|dec)rements to the basic math operations&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write five different functions or programs that do addition, subtraction, multiplication, division and modulo with integers &lt;strong&gt;by only using increments, decrements, loops/recursion and comparisons&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Assume division &amp;amp; modulo will never receive 0 or negative integers as the divisor/modulus.&lt;/li&gt;&#xA;&lt;li&gt;Modulo's result has the sign of its dividend.&lt;/li&gt;&#xA;&lt;li&gt;Division truncates its quotient, e.g &lt;code&gt;divide(11, 4)&lt;/code&gt; returns 2 and &lt;code&gt;divide(-5, 3)&lt;/code&gt; returns -1.&lt;/li&gt;&#xA;&lt;li&gt;Programs must print the result to STDOUT. Functions must return the result.&lt;/li&gt;&#xA;&lt;li&gt;Your five functions/programs may invoke each other.&lt;/li&gt;&#xA;&lt;li&gt;All functions/programs must support 32-bit &lt;strong&gt;signed&lt;/strong&gt; integers, i.e everything between -2&lt;sup&gt;31&lt;/sup&gt; and 2&lt;sup&gt;31&lt;/sup&gt;-1 (inclusive). Overflow is allowed, i.e it's OK if &lt;code&gt;add(2147483647, 1)&lt;/code&gt; returns -2147483648.&lt;/li&gt;&#xA;&lt;li&gt;Explicitly adding/subtracting 1 to/from numbers is allowed, in case you use a programming language that doesn't have built-ins for incrementing and decrementing.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot;&gt;Shortest program wins&lt;/a&gt; as long as it doesn't exploit &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default?noredirect=1&amp;amp;lq=1&quot;&gt;standard loopholes&lt;/a&gt;!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I seriously have no idea how to make test cases for this.&lt;/p&gt;&#xA;" OwnerUserId="53917" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.193" LastActivityDate="2016-07-11T19:12:52.573" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9559" PostTypeId="2" ParentId="2140" CreationDate="2016-07-10T17:27:29.980" Score="1" Body="&lt;h2&gt;Calculate my total hours&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I record the work I do for one of my customers using a flat file in the following format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0000-00-00 0000-0000 0.0 code0000 free text&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;0.0&lt;/code&gt; represents the amount of time spent on the task identified by &lt;code&gt;code0000&lt;/code&gt;, where &lt;code&gt;0000&lt;/code&gt; is an optional numeric task ID and &lt;code&gt;code&lt;/code&gt; is a project code (and does not contain digits or spaces).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because I'm lazy, I need as short a program as possible to calculate subtotals of my total time for each project, plus a grand total. If you are using plain text output it should show the hours first and then the project code on the same line, and then the grand total on a line on its own with no code. You don't need to use a specific numeric format but you should be capable of dealing with half hours (0.5) in both the input and output.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2016-07-10T17:27:29.980" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9560" PostTypeId="1" AcceptedAnswerId="9561" CreationDate="2016-07-11T00:34:29.827" Score="2" ViewCount="45" Body="&lt;p&gt;I &lt;a href=&quot;https://codegolf.stackexchange.com/posts/85055/revisions&quot;&gt;rolled back an edit&lt;/a&gt; that a user made to another's code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It may not be immediately apparent to the most casual observer &lt;a href=&quot;https://codegolf.stackexchange.com/questions/84943/duplicate-switch-case/85055#comment208761_85055&quot;&gt;&lt;em&gt;why&lt;/em&gt; I rolled back this edit&lt;/a&gt;, but the summary just says &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Rollback to revision &lt;em&gt;N&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;To change it, I clicked &lt;a href=&quot;https://codegolf.stackexchange.com/posts/85055/edit/36e9ef04-38bf-4eb9-9b74-22f1e740a987&quot;&gt;&lt;em&gt;edit&lt;/em&gt;&lt;/a&gt;, to make it to the effect of &quot;please don't edit others' code&quot;, but upon clicking &lt;code&gt;Save edits&lt;/code&gt; the edit reason did not update, even though the post changed to say &lt;code&gt;edited 1 minute ago by cat&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can I change a rollback's edit reason, and if so, how?&lt;/p&gt;&#xA;" OwnerUserId="46231" LastActivityDate="2016-07-11T01:06:13.883" Title="Edit a rollback's edit reason?" Tags="|support|editing|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9561" PostTypeId="2" ParentId="9560" CreationDate="2016-07-11T01:06:13.883" Score="5" Body="&lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/q/59597/180276&quot;&gt;Only moderators can edit revision history comments&lt;/a&gt;, including the comment for a rollback.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you'd like to rollback with a custom comment, go into the revision history of the post and use the &lt;em&gt;edit&lt;/em&gt; link on a specific revision:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/xwuSP.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/xwuSP.png&quot; alt=&quot;revision history with edit links&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This will bring you to the standard edit page (in which you can enter a custom comment), but containing the contents of the revision you chose instead of the current revision—so if you make no further changes, you are effectively performing a rollback.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you've already made an edit and you want to add an important piece of information, you can do so in the comments. You may want to leave the message both in the revision history and as a comment if you think it's important that the user whose post you're editing sees your comment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(As an aside, the moderator revision history editing tool is meant mostly for redacting offensive or sensitive information. You can use a custom moderator flag in that case, but for this situation, it'd be better to just leave a comment.)&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2016-07-11T01:06:13.883" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9562" PostTypeId="2" ParentId="2140" CreationDate="2016-07-11T01:09:55.633" Score="0" Body="&lt;h1&gt;Write a Gopher Interpreter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This code golf challenge will task you with writing an interpreter for an esolang I created a while back called Gopher, Details on the language can be found &lt;strong&gt;&lt;a href=&quot;https://esolangs.org/wiki/Gopher&quot; rel=&quot;nofollow&quot;&gt;Here&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Pass Conditions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This challenge requires you to create an Interpreter (Or you could go a step ahead and create a Compile/Transpiler) however for the code to pass as correct it must meet the following criteria&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take in a single input being the Gopher Code&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Output the result of the Interpreted code&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Invalid code does not need to be handled, however you may do so if you wish&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;As this is code-golf the smallest byte size wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;amp;++&amp;lt;'×&amp;lt;&amp;amp;÷+&amp;lt;^-&amp;lt;&amp;lt;×-&amp;lt;#!+&amp;lt;$@-&amp;lt;&amp;amp;@&amp;lt;×-&amp;lt;@++&amp;lt;@&amp;lt;.!&amp;lt;=&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hello World&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="53343" LastActivityDate="2016-07-11T01:09:55.633" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9563" PostTypeId="1" CreationDate="2016-07-11T01:18:14.907" Score="-1" ViewCount="157" Body="&lt;p&gt;I find that generally questions are answered by the same few users, with the same few languages. Is it a good idea to disallow dedicated golfing languages, to make the challenge fairer and more interesting?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note: I have attempted this and got heavily downvoted.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="53551" LastActivityDate="2016-07-11T01:34:00.713" Title="Is it a good idea to disallow dedicated golfing languages?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ClosedDate="2016-07-11T01:41:54.217" ContentLicense="CC BY-SA 3.0" />
  <row Id="9564" PostTypeId="2" ParentId="9563" CreationDate="2016-07-11T01:28:27.497" Score="4" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Any language that &lt;strike&gt;is &lt;a href=&quot;https://en.wikipedia.org/wiki/Turing_completeness&quot; rel=&quot;nofollow&quot;&gt;Turing complete&lt;/a&gt;&lt;/strike&gt; can add numbers and check if a number is prime is valid on PPCG, and since most golfing languages are Turing complete, they can do so.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, banning them only makes sense if you compare between languages, and comparing between languages doesn't make sense at all.&lt;/p&gt;&#xA;" OwnerUserId="53917" LastEditorUserId="53917" LastEditDate="2016-07-11T01:34:00.713" LastActivityDate="2016-07-11T01:34:00.713" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9567" PostTypeId="2" ParentId="2140" CreationDate="2016-07-11T13:50:21.607" Score="0" Body="&lt;p&gt;Having had a look, it seems there isn't a challenge for &quot;Given any date, output the day of the week&quot;. Is that a challenge worth having? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Something like&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;Given an input date, in the form dd/mm/yyyy, output the day of the week&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Shortest code wins&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What do we think? perhaps this already exists and I didn't find it.&lt;/p&gt;&#xA;" OwnerUserId="55972" LastActivityDate="2016-07-11T13:50:21.607" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9568" PostTypeId="1" CreationDate="2016-07-11T18:28:10.767" Score="-3" ViewCount="202" Body="&lt;p&gt;I recently stumbled upon &lt;a href=&quot;https://codegolf.stackexchange.com/q/85108/53917&quot;&gt;this challenge&lt;/a&gt; where the OP gives a non-golfed reference implementation in C++. This makes it a no-brainer to solve the challenge with C++ by just golfing the reference.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it a good idea to ban C++ from that challenge, or the language X from a challenge Y where Y gives a reference implementation written in X?&lt;/p&gt;&#xA;" OwnerUserId="53917" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-07-12T15:31:51.410" Title="If a challenge gives a reference implementation, do we have to ban the language the reference is written in?" Tags="|discussion|challenges|" AnswerCount="3" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9569" PostTypeId="2" ParentId="9568" CreationDate="2016-07-11T18:35:19.670" Score="4" Body="&lt;h1&gt;No, it's a bad idea to ban such languages.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The voters will vote mainly based on whether or not it is well golfed, and on the amount of effort that was put into it. it should be obvious if someone just took the reference implementation and golfed it slightly. While doing this is allowed, it is discouraged behaviour. It's also highly discouraged to explicitly ban a language, especially when more interesting and golfed solutions may still arise.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Whenever I write a reference implementation, I usually write it such that it uses a long-winded approach, such that a real golf in the language would use a different approach. While not all challenge writers do this, it's still often the case that the latter implication holds.&lt;/p&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2016-07-11T18:35:19.670" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9570" PostTypeId="2" ParentId="9568" CreationDate="2016-07-11T18:39:44.917" Score="3" Body="&lt;h1&gt;Don't disallow a language just because it's used in the sample implementation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It's fine to use the language used in the reference implementation, but, &lt;strong&gt;come up with your solution independently&lt;/strong&gt; and golf it, rather than referencing the OP's sample implementation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your solution, that you came up with independently, and the OP's coincide, put a significant effort to golf it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The community does not react well to banning specific languages whether intentional or not.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;If you're the question poster:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Don't make a well golfed sample implementation and make it as un-golfable as possible. Additionally you can golf &lt;strong&gt;your&lt;/strong&gt; reference implementation and post it as an answer to &lt;em&gt;your own&lt;/em&gt; question if you'd like. This would avoid any confusion.&lt;/p&gt;&#xA;" OwnerUserId="40695" LastActivityDate="2016-07-11T18:39:44.917" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9571" PostTypeId="2" ParentId="9568" CreationDate="2016-07-11T19:29:09.537" Score="10" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;While I agree with the conclusions of the two existing answers &amp;ndash; that you neither have to nor should ban a language just because you've written a reference implementation in it &amp;ndash; I disagree with some of the minor details.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Submitting a golfed version of the reference implementation is perfectly acceptable in my opinion, as long as the source of the original code is credited in the answer. Just as it makes no sense to ban a specific language because it was used in the reference implementation, it doesn't make sense to ban a specific approach.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A few more things to consider:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Write a &lt;em&gt;non-golfed&lt;/em&gt; reference implementation. Try to make your code as efficient and understandable as possible.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Consider posting a &lt;em&gt;golfed&lt;/em&gt; reference answer instead. Self-answering your own challenge is perfectly acceptable.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="46231" LastEditDate="2016-07-12T15:31:51.410" LastActivityDate="2016-07-12T15:31:51.410" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9572" PostTypeId="2" ParentId="2140" CreationDate="2016-07-12T12:18:12.877" Score="1" Body="&lt;h1&gt;Undone Mathematics&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Definitions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I define the following:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;n&lt;/em&gt;ᵗʰ Undone Addition of &lt;em&gt;A&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let &lt;em&gt;ⁿ&lt;/em&gt;+ᵣ &lt;em&gt;A&lt;/em&gt; denotes the &lt;em&gt;n&lt;/em&gt;ᵗʰ Redacted Addition of &lt;em&gt;A&lt;/em&gt;; the sum of the elements of &lt;em&gt;A&lt;/em&gt; after &lt;em&gt;n&lt;/em&gt; layers have been removed in every dimension:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; ²+ᵣ [1,2,3,4,5,6,7] = ∑ [3,4,5] = 12    // 1D: remove leading and trailing elements&#xA;&#xA;     [[1,1,3]&#xA; ¹+ᵣ  [4,2,5]  = ∑ [2] = 2    // 2D: remove leading and trailing rows and columns&#xA;      [3,4,1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then &lt;em&gt;ⁿ&lt;/em&gt;+ᵤ &lt;em&gt;A&lt;/em&gt; denotes the &lt;em&gt;n&lt;/em&gt;ᵗʰ Undone Addition of &lt;em&gt;A&lt;/em&gt;; the &lt;em&gt;n&lt;/em&gt;ᵗʰ Redacted Addition of &lt;em&gt;A&lt;/em&gt; plus the sum of the elements of &lt;em&gt;A&lt;/em&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; ²+ᵤ [1,2,3,4,5,6,7] = ²+ᵣ [1,2,3,4,5,6,7] + ∑ [1,2,3,4,5,6,7]&#xA;&#xA;     [[1,1,3]        [[1,1,3]      [[1,1,3] &#xA; ¹+ᵤ  [4,2,5]  = ¹+ᵣ  [4,2,5]  + ∑  [4,2,5]&#xA;      [3,4,1]]        [3,4,1]]      [3,4,1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;n&lt;/em&gt;ᵗʰ Undone Multiplication of &lt;em&gt;A&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let &lt;em&gt;ⁿ&lt;/em&gt;×ᵣ &lt;em&gt;A&lt;/em&gt; denotes the &lt;em&gt;n&lt;/em&gt;ᵗʰ Redacted Multiplication of &lt;em&gt;A&lt;/em&gt;; the product of the elements of &lt;em&gt;A&lt;/em&gt; after &lt;em&gt;n&lt;/em&gt; layers have been removed in every dimension:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; ³×ᵣ [3,2,1,1,2,3,1,1] = ∏ [1,2] = 2    // 1D: remove leading and trailing elements&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then &lt;em&gt;ⁿ&lt;/em&gt;+ᵤ &lt;em&gt;A&lt;/em&gt; denotes the &lt;em&gt;n&lt;/em&gt;ᵗʰ Undone Multiplication of &lt;em&gt;A&lt;/em&gt;; the &lt;em&gt;n&lt;/em&gt;ᵗʰ Redacted Multiplication of &lt;em&gt;A&lt;/em&gt; times the product of the elements of &lt;em&gt;A&lt;/em&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; ³×ᵤ [3,2,1,1,2,3,1,1] = ³×ᵣ [3,2,1,1,2,3,1,1] × ∏ [3,2,1,1,2,3,1,1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;n&lt;/em&gt;ᵗʰ Undone Average of &lt;em&gt;A&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let μ denote the average (arithmetic mean), i.e. μ&lt;em&gt;A&lt;/em&gt; = &lt;sup&gt;(∑&lt;em&gt;A&lt;/em&gt;)&lt;/sup&gt;⁄&lt;sub&gt;N&lt;/sub&gt; and &lt;em&gt;ⁿ&lt;/em&gt;μᵣ&lt;em&gt;A&lt;/em&gt; denote the &lt;em&gt;n&lt;/em&gt;ᵗʰ Redacted Average of &lt;em&gt;A&lt;/em&gt;; the average of the elements of &lt;em&gt;A&lt;/em&gt; after &lt;em&gt;n&lt;/em&gt; layers have been removed in every dimension:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; ³μᵣ [3,2,1,1,2,3,1,1] = μ [1,2] = 1.5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then &lt;em&gt;ⁿ&lt;/em&gt;μᵤ &lt;em&gt;A&lt;/em&gt; denotes the average of the &lt;em&gt;n&lt;/em&gt;ᵗʰ Redacted Average of &lt;em&gt;A&lt;/em&gt; and the average of the elements of &lt;em&gt;A&lt;/em&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;                          ³μᵣ [3,2,1,1,2,3,1,1] + μ [3,2,1,1,2,3,1,1]  &#xA; ³μᵤ [3,2,1,1,2,3,1,1] = ─────────────────────────────────────────────&#xA;                                               2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;With all this in mind, create an interpreter that will evaluate expressions that use the below operations (numbers are just examples). Alternatively, extend the language of your choice to include the notation.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 + 2        Addition&#xA;3 × 4        Multiplication&#xA;μ [5,6]      Average&#xA;7 +u [8,9]   Undone Addition&#xA;9 ×u [1,2]   Undone Multiplication&#xA;2 μu [3,4]   Undone Average&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that you do not need to implement redacted operations. They were only defined above to facilitate the definitions of the undone operations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may substitute any ASCII or Unicode symbol for &lt;code&gt;+&lt;/code&gt;, &lt;code&gt;×&lt;/code&gt;, and &lt;code&gt;μ&lt;/code&gt; as long as you stay consistent: You may not choose &lt;code&gt;*&lt;/code&gt; with &lt;code&gt;×u&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each undone operator has a higher order precedence than their normal counterpart.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;2+u [1,2,3,4,5,6,7]&lt;/code&gt; → &lt;code&gt;40&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;1+u [[1,1,3][4,2,5][3,4,1]]&lt;/code&gt; → &lt;code&gt;26&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;3×u [3,2,1,1,2,3,1,1]&lt;/code&gt; → &lt;code&gt;72&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;3μu [3,2,1,1,2,3,1,1]&lt;/code&gt; → &lt;code&gt;1.625&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;0.1 × 2+u [1,2,3,4,5,6,7]&lt;/code&gt; → &lt;code&gt;4&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;2+u [1,2,3,4,5,6,7] × 0.1&lt;/code&gt; → &lt;code&gt;4&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;0+u [[[1,1][3,2]][[1,3][3,1]]]&lt;/code&gt; → &lt;code&gt;15&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;1+u [[[0,1,1][2,1,1][1,0,0]][[2,2,2][2,2,0][1,0,2]][[1,2,0][2,1,1][2,1,2]]]&lt;/code&gt; → &lt;code&gt;34&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;1×u [[[1,1,2][1,1,1][1,2,1]][[1,2,2][2,2,1][2,2,1]][[1,1,1][1,1,2][2,1,1]]]&lt;/code&gt; → &lt;code&gt;2048&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;1μu [[[2,2,3][3,2,1][3,3,3]][[1,3,3][2,1,1][2,1,3]][[2,3,3][3,2,3][3,2,1]]]&lt;/code&gt; → &lt;code&gt;3.259&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2016-07-13T09:19:39.017" LastActivityDate="2016-07-13T09:19:39.017" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9573" PostTypeId="2" ParentId="2140" CreationDate="2016-07-12T12:42:33.847" Score="-2" Body="&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Oh noes! A site redesign is eating my privileges!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&#xA;&lt;hr&gt;&#xA;PPCG is graduating and will soon receive a new design. Unfortunately for everbody except &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=Reputation&amp;amp;filter=all&quot; title=&quot;Just 10!&quot;&gt;some people&lt;/a&gt;, the new design will also mean &lt;a href=&quot;https://aviation.meta.stackexchange.com/a/2848/523&quot;&gt;losing privileges due to higher reputation requirements&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, losing some privileges is a small sacrifice for the &lt;em&gt;Magnificent Glorious Site Redesign®©™&lt;/em&gt;, but&amp;hellip; How much do we stand do lose?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program / function receives a reputation level (e.g. &lt;code&gt;535&lt;/code&gt;). Output the privileges that are &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges&quot; title=&quot;Privileges for our soon-to-complete-graduation site&quot;&gt;currently available&lt;/a&gt; to it, but will not be available &lt;a href=&quot;https://unix.stackexchange.com/help/privileges/&quot; title=&quot;Privileges for a fully graduated site&quot;&gt;after the redesign&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Output can be either an array or a string that's separated by a delimiter. The delimiter may not be any of &lt;code&gt;A-Za-z&amp;lt;space&amp;gt;&lt;/code&gt;. Multi-character delimiters may end in a space, though.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there are no matches, your program should output either an empty array or a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2194/13486&quot;&gt;falsy&lt;/a&gt; value.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;Input&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;25000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;Output&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;[]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;Input&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;24999&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;Output&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;[&quot;access to site analytics&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;Input&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;2000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;Output&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;[&quot;access to moderator tools&quot;,&quot;approve tag wiki edits&quot;,&quot;cast close and reopen votes&quot;,&quot;create tag synonyms&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;Input&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;535&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;Output&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;[&quot;cast close and reopen votes&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;Input&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;350&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;Output&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;[&quot;access review queues&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;Input&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;Output&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;[]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;Input&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;Output&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;[&quot;participate in meta&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;Deliberately ignoring &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7084/13486&quot;&gt;the facts&lt;/a&gt; in the last example.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Available privileges&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;For convenience, here is a JSON array with available privileges and the required reputation before / after:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;[[5000,25000,&quot;access to site analytics&quot;],[4000,20000,&quot;trusted user&quot;],[3500,15000,&quot;protect questions&quot;],[2000,10000,&quot;access to moderator tools&quot;],[1500,5000,&quot;approve tag wiki edits&quot;],[500,3000,&quot;cast close and reopen votes&quot;],[1250,2500,&quot;create tag synonyms&quot;],[1000,2000,&quot;edit questions and answers&quot;],[750,1000,&quot;established user&quot;],[1000,1000,&quot;create gallery chat rooms&quot;],[350,500,&quot;access review queues&quot;],[150,300,&quot;create tags&quot;],[250,250,&quot;view close votes&quot;],[125,125,&quot;vote down&quot;],[100,100,&quot;edit community wiki&quot;],[100,100,&quot;create chat rooms&quot;],[75,75,&quot;set bounties&quot;],[50,50,&quot;comment everywhere&quot;],[20,20,&quot;talk in chat&quot;],[15,15,&quot;flag posts&quot;],[15,15,&quot;vote up&quot;],[10,10,&quot;remove new user restrictions&quot;],[10,10,&quot;create wiki posts&quot;],[1,5,&quot;participate in meta&quot;],[1,1,&quot;create posts&quot;]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;At index &lt;code&gt;0&lt;/code&gt; is the reputation before, at index &lt;code&gt;1&lt;/code&gt; is the reputation after. &lt;sub&gt;(The privilege &lt;em&gt;reduce ads&lt;/em&gt; (200 reputation) is not available to beta sites and therefore not included in this list.)&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;Standard &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/13486&quot;&gt;I/O&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/13486&quot;&gt;loophole&lt;/a&gt; rules apply.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="13486" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-07-12T13:22:56.613" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9575" PostTypeId="2" ParentId="2140" CreationDate="2016-07-13T01:32:15.023" Score="2" Body="&lt;h2&gt;Pareto frontier&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A point (x&lt;sub&gt;1&lt;/sub&gt;,y&lt;sub&gt;1&lt;/sub&gt;) &lt;em&gt;dominates&lt;/em&gt; another point (x&lt;sub&gt;2&lt;/sub&gt;,y&lt;sub&gt;2&lt;/sub&gt;) if both x&lt;sub&gt;1&lt;/sub&gt;≥x&lt;sub&gt;2&lt;/sub&gt; and y&lt;sub&gt;1&lt;/sub&gt;≥y&lt;sub&gt;2&lt;/sub&gt;. A set of points is a &lt;a href=&quot;https://en.wikipedia.org/wiki/Pareto_efficiency#Pareto_frontier&quot; rel=&quot;nofollow&quot;&gt;Pareto frontier&lt;/a&gt; if no point dominates another point. In other words, any increase in one coordinate must be met with a decrease in the other coordinate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to decide whether a given set of points is a Pareto frontier.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; A collection of two or more points, which are pairs of positive integers. No two points will have the same x-value or the same y-value. You may not assume the points are given in a particular order. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt; A consistent Truthy value if it is, and a consistent Falsey value if it's not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;True:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[(12, 1), (6, 4)]&#xA;[(1, 5), (2, 4), (3, 3), (4, 2), (5, 1)]&#xA;[(4, 4), (3, 8), (12, 3), (20, 1)]&#xA;[(106, 106), (107, 102), (104, 127)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;False:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[(5, 9), (4, 8)]&#xA;[(1, 1), (11, 11)]&#xA;[(5, 3), (2, 4), (7, 7), (1, 2)]&#xA;[(15, 2), (7, 8), (4, 14), (6, 6)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Is it better to do the decision problem, or the filtering problem of finding the upper Pareto frontier of non-dominated points?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Should the input be allowed to be taken pre-zipped, as two lists of n numbers? What about a 2D 2-by-n array versus an n-by-2 array?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2016-07-13T01:32:15.023" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9576" PostTypeId="2" ParentId="2140" CreationDate="2016-07-13T08:21:57.053" Score="0" Body="&lt;h2&gt;ASCII to Unicode equation beautifier&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You may well be used to typing equations in ASCII, but with the advent of Unicode we can spruce them up a bit. We can fix&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Powers (numeric superscripts only)&lt;/li&gt;&#xA;&lt;li&gt;Numeric subscripts&lt;/li&gt;&#xA;&lt;li&gt;Mathematical signs (-, *, / ^ → -, ×, ÷, ↑)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x^3 - 1 = (x - 1)(x^2 + x + 1)  →  x³ − 1 = (x − 1)(x² + x + 1)&#xA;g_0 = 3^^3^^3 -= 3^(3^3)        →  g₀ = 3↑↑3↑↑3 = 3↑(3³)&#xA;800*600                         →  800×600&#xA;1/x                             →  1÷x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You may assume that all digits directly after a ^ or _ are meant to be super/subscripts (and the ^ or _ to be removed) and that all the mathematical signs are to be replaced wherever they appear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest solution wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2016-07-13T08:21:57.053" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9577" PostTypeId="2" ParentId="2140" CreationDate="2016-07-13T13:22:55.623" Score="4" Body="&lt;p&gt;&lt;strong&gt;Fireworks&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&#xA;&lt;hr&gt;&#xA;Make me some fireworks !&lt;br&gt;&#xA;And since we are super-late for the 4th make them as quick (read short) as possible ! &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;br&gt;&#xA;2 integer, the fuse (any value equal or bigger than 5) and the radius (1 - 2 - 3).  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The fuse define the lenght of the tail, the last character of the tail is the center of the explosion. The tail must be centered with the explosion.&lt;br&gt;&#xA;The radius define the explosion.   &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rule&lt;/strong&gt;&lt;br&gt;&#xA;No need for exception handling, the input will be a valid one.&lt;br&gt;&#xA;You may or may not padd your firework, the choice is up to you.&lt;br&gt;&#xA;Input, Output and the choice beetwen full program or function is, once again, up To you and your lenguage of choice.&lt;br&gt;&#xA;Standard loophole rules apply.&lt;br&gt;&#xA;Hopefully no built-in (i'm looking at you mathematica) exist.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;fuse 5, radius 1  &#xA;     * *    &#xA;    * * *&#xA;     *|*&#xA;      |&#xA;      |&#xA;      |&#xA;&#xA;&#xA;fuse 10, radius 3  &#xA;&#xA;   *     *&#xA;    *   *&#xA;     * *    &#xA;* * * * * * *&#xA;     *|*&#xA;    * | *&#xA;   *  |  *&#xA;      |&#xA;      |&#xA;      |&#xA;      |&#xA;      |&#xA;      |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;hr&gt;&#xA;while stretching the fuse is not a big deal, ence no limit to it, I found interesting see if it's gonna be cheaper to have hardcoded the strings for the part where the firework cross the fuse or is gonna be cheaper some fancy algorithm, ence I' ve set a limited number of alternative for the radius.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm really sorry if my english is bad, I usually can get my idea trought but more than often i stumble with some verbs.&lt;/p&gt;&#xA;" OwnerUserId="52780" LastEditorUserId="52780" LastEditDate="2016-07-13T17:38:11.503" LastActivityDate="2016-07-13T17:38:11.503" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9578" PostTypeId="2" ParentId="2140" CreationDate="2016-07-13T13:39:18.460" Score="-2" Body="&lt;p&gt;&lt;strong&gt;Plot Partial Node Network&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have a 440*3 matrix that looks like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1   144 Title1&#xA;1   152 Title2&#xA;1   135 Title3&#xA;2   3 Title4&#xA;2   12 Title5&#xA;2   107 Title6&#xA;2   31 Title7&#xA;3   4 Title8&#xA;3   147 Title9&#xA;3   0 Title10&#xA;4   end Title11&#xA;4   0 Title12&#xA;4   0 Title13&#xA;5   6 Title14&#xA;5   7 Title15&#xA;5   10 Title16&#xA;5   9 Title17&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The left column are the starting points eg in the app all the 1's on the left would be on the same page. They lead to three choices, pages 144,152,135. These pages can each then lead to another page, and so on until the middle column says 'end'. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;challenge&lt;/strong&gt;&#xA;Each number has an associated title in column three. I would like to have a function whereby if you input a given title it will plot all the possible starting points and their associated paths that will lead there. This should be a lot smaller and therefore graph friendly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&#xA;e.g. &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;44  234  tes&#xA;186  187  Frac&#xA;187  154  Low&#xA;154  end  Coll&#xA;99  101  adf&#xA;23   52   Med&#xA;52   11   Lip&#xA;11   42   AAA&#xA;42   154   BBB&#xA;154   end  Coll&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;EDIT&lt;/strong&gt; - I added to the example. In the winning entry these new nodes will not be plotted as they do not lead to Coll. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I made this example to show how column 1 leads to a value in column 2 which then refers to a value in column 1 until you reach the end. Different starting points can ultimately lead to different length paths to same destination. so this would look sometigng like: &#xA;&lt;a href=&quot;https://i.stack.imgur.com/Y3MuW.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Y3MuW.png&quot; alt=&quot;All paths leads to Coll&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So here, I wanted to see how you could go from all start points to 'Coll'&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&#xA;A data.frame like that illustrated (with not relevant rows included) and a given title&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&#xA;-any language is fine as long as it will easy work with tab separated data laid out as shown&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&#xA;A graph like the one included for a given title&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Win Criteria&lt;/strong&gt;&#xA;Shortest Runtime to make a png with graph&lt;/p&gt;&#xA;" OwnerUserId="16417" LastEditorUserId="16417" LastEditDate="2016-07-14T07:41:43.080" LastActivityDate="2016-07-14T07:41:43.080" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9579" PostTypeId="2" ParentId="6918" CreationDate="2016-07-13T15:59:11.367" Score="4" Body="&lt;h2&gt;&lt;a href=&quot;https://github.com/tuxcrafting/your-mom&quot; rel=&quot;nofollow&quot;&gt;Your Mom&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your Mom is a language that I have created after a message of mbomb007 on The Nineteenth Byte:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I think someone should create a language called &quot;Your Mom&quot;, just so that during an argument over which language is a better one, they can interject that &quot;Your mom is a better language&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/30959191#30959191&quot;&gt;Source&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your Mom is a stack-based golfing language using Unicode characters, and implementing the &lt;a href=&quot;https://github.com/tuxcrafting/your-mom/blob/master/src/jellycomp.js&quot; rel=&quot;nofollow&quot;&gt;Jelly compressor&lt;/a&gt; (not the dictionary based compressor of Jelly), a simple compression algorithm.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since without code, I get downvotes, here is a snippet:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;¥€⊞@&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Push 1 (&lt;code&gt;¥&lt;/code&gt;), create a one-character function that increment the TOS (&lt;code&gt;€⊞&lt;/code&gt;), and loop while the TOS is not zero (&lt;code&gt;@&lt;/code&gt;).&lt;br&gt;&#xA;Basically, this snippet do nothing, but could stop on integer overflow.&lt;/p&gt;&#xA;" OwnerUserId="53745" LastEditorUserId="53745" LastEditDate="2016-07-26T21:33:44.430" LastActivityDate="2016-07-26T21:33:44.430" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9581" PostTypeId="2" ParentId="2140" CreationDate="2016-07-13T22:57:50.907" Score="-3" Body="&lt;h1&gt;Make a Fork Bomb &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;&lt;em&gt;under construction, please constructively (no pun intended) criticize&lt;/em&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Create a program which forks itself at twice and exits, or forks itself once and idles. Whether it continues forever or exits is your choice. Forks can be OS forks or simply a command to relaunch the program. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No spoon bombs allowed, please.&lt;/li&gt;&#xA;&lt;li&gt;Don't make any assumptions about the location of the program.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Bash, 10 chars&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;./$0|./$0&amp;amp;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Acts as a standard punching bag for other solutions.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Microsoft Windows Batch file, 5 chars&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; %0|%0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Anybody who beats this one gets a million internet points. (and maybe a bounty)&lt;/p&gt;&#xA;" OwnerUserId="41088" LastEditorUserId="41088" LastEditDate="2016-07-14T18:22:00.990" LastActivityDate="2016-07-14T18:22:00.990" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9582" PostTypeId="1" AcceptedAnswerId="9584" CreationDate="2016-07-13T23:04:52.180" Score="-2" ViewCount="262" Body="&lt;p&gt;Would it be acceptable to ask questions here that ask for the &lt;em&gt;biggest&lt;/em&gt; program to solve a problem, for some measure of big: characters, lines, bytes in memory etc.? And what sort of constraints would be necessary to avoid trivial near-infinite extensions of the size? For example, simply requiring that each line be unique (after trimming whitespace) and executed would still allow answers enumerating every possible function name and nesting them:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def a():&#xA;    b()&#xA;&#xA;[…]&#xA;&#xA;def zz[…]zz():&#xA;    print('answer')&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="9570" LastActivityDate="2016-07-13T23:12:27.797" Title="Anti-golf questions" Tags="|discussion|" AnswerCount="1" CommentCount="3" ClosedDate="2016-07-13T23:53:05.977" ContentLicense="CC BY-SA 3.0" />
  <row Id="9584" PostTypeId="2" ParentId="9582" CreationDate="2016-07-13T23:12:27.797" Score="5" Body="&lt;p&gt;This already exists. We have a tag called &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt;, and the wiki says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Code-bowling is a competition to solve a particular (usually simple) problem in the most bytes or complexity.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That being said, there are 19 questions tagged with code-bowling, and 8 of them are closed. There are lot's of problems with code-bowling that make it hard to do a good code-bowling challenge. In fact, there have even been discussions about &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1661/should-we-kill-code-bowling&quot;&gt;removing code-bowling&lt;/a&gt; from the site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, that doesn't mean &quot;Code-bowling&quot; is off-topic (just yet), but it does mean you should be very careful before posting a code-bowling challenge. There must be some feature in the challenge that inherently restricts how long your code can get. Otherwise, submissions would just add billions and trillions of comments and NOP's, which could continue on indefinitely.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I highly recommend &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;the sandbox&lt;/a&gt; before you post any challenges of this type.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2016-07-13T23:12:27.797" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9585" PostTypeId="2" ParentId="2140" CreationDate="2016-07-13T23:35:32.953" Score="1" Body="&lt;h1&gt;Family Tree, Folder Tree&lt;/h1&gt;&#xA;&lt;p&gt;Given a simple family tree in a format reasonably similar to the format outlined below, create a file tree to match it, as explained below.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;An ascii family tree in a similar format to the following:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;                Grandpa Jim = Grandma Jane&#xA;                            |&#xA;                 -------------------------------------------------------&#xA;                 |          |          |                               |&#xA;               Bill Bob     Jim Jane   Sam Sammyson = Aunt Jimbo     Daddy McDad = Mommy McMom&#xA;                                                    |                            |&#xA;                                                  -----------                    Me&#xA;                                                  |         |&#xA;                                                Cousin One  Cousin Two&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The scheme can be changed within reason, however the test cases provided will meet the following specs:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;=&lt;/code&gt; Symbolizes a marriage&lt;/li&gt;&#xA;&lt;li&gt;If there are any children from a marriage, there will be a &lt;code&gt;|&lt;/code&gt; one line below the &lt;code&gt;=&lt;/code&gt; symbolizing the marriage.&lt;/li&gt;&#xA;&lt;li&gt;A &lt;code&gt;-&lt;/code&gt; character that is below a &lt;code&gt;|&lt;/code&gt;, or connected (by adjacency) to a &lt;code&gt;-&lt;/code&gt; that is immediately below a &lt;code&gt;|&lt;/code&gt;  are used to signify multiple children. Below any of these &lt;code&gt;-&lt;/code&gt; there may be a &lt;code&gt;|&lt;/code&gt;, which will have a the first word of a name immediately below it. This full name is the name of a child.&lt;/li&gt;&#xA;&lt;li&gt;The initial line of the family tree will only contain two people.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;em&gt;This spec maybe should be cleaned up more&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Note that there won't be any relationships more complicated than &lt;code&gt;=&lt;/code&gt; marriage or &lt;code&gt;|&lt;/code&gt; child linking two names. This means that more complicated relationships, such as divorce or step-children, will not appear in the tree.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;There will be no output as such, instead the program/function will create a directory structure matching the input. For example, the above example would lead to the following directory tree:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;$ tree family_tree/&#xA;family_tree/&#xA;├── Grandma Jane&#xA;│   ├── children&#xA;│   │   ├── Bill Bob&#xA;│   │   │   └── parents&#xA;│   │   │       ├── Grandma Jane -&amp;gt; ../../../../Grandma Jane/&#xA;│   │   │       └── Grandpa Jim -&amp;gt; ../../../../Grandpa Jim/&#xA;│   │   ├── Daddy McDad&#xA;│   │   │   ├── children&#xA;│   │   │   │   └── Me&#xA;│   │   │   ├── parents -&amp;gt; ../Jim Jane/parents&#xA;│   │   │   └── spouse&#xA;│   │   │       └── Mommy McMom&#xA;│   │   │           ├── children -&amp;gt; ../../children/&#xA;│   │   │           └── spouse&#xA;│   │   │               └── Daddy McDad -&amp;gt; ../../../../Daddy McDad/&#xA;│   │   ├── Jim Jane&#xA;│   │   │   └── parents -&amp;gt; ../Bill Bob/parents/&#xA;│   │   └── Sam Sammyson&#xA;│   │       ├── children&#xA;│   │       │   ├── Cousin One&#xA;│   │       │   └── Cousin Two&#xA;│   │       ├── parents -&amp;gt; ../Jim Jane/parents&#xA;│   │       └── spouse&#xA;│   │           └── Aunt Jimbo&#xA;│   │               ├── children -&amp;gt; ../../children/&#xA;│   │               └── spouse&#xA;│   │                   └── Sam Sammyson -&amp;gt; ../../../../Sam Sammyson/&#xA;│   └── spouse&#xA;│       └── Grandpa Jim -&amp;gt; ../../Grandpa Jim/&#xA;└── Grandpa Jim&#xA;    ├── children -&amp;gt; ../Grandma Jane/children/&#xA;    └── spouse&#xA;        └── Grandma Jane -&amp;gt; ../Grandma Jane/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The directory tree must satisfy the following:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Create a directory called &lt;code&gt;family_tree&lt;/code&gt; that will contain the entire family tree.&lt;/li&gt;&#xA;&lt;li&gt;Inside &lt;code&gt;family_tree/&lt;/code&gt; there will be exactly two directories, these are the two people at the top of the family tree.&lt;/li&gt;&#xA;&lt;li&gt;For every person in the tree, do the following in their directory:&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If they have a spouse, create a &lt;code&gt;spouse&lt;/code&gt; directory. If the spouse already has a directory named after them, create a link to that directory within the  &lt;code&gt;spouse&lt;/code&gt; directory. Otherwise, create a directory in the &lt;code&gt;spouse&lt;/code&gt; directory with the name of the spouse.&lt;/li&gt;&#xA;&lt;li&gt;If they have children, then they must have a spouse. If the spouse already has a directory named &lt;code&gt;children&lt;/code&gt;, then create a link to that directory and name the link &lt;code&gt;children&lt;/code&gt;. If their spouse doesn't already have this directory, create the &lt;code&gt;children&lt;/code&gt; directory and add a directory corresponding to each child.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;em&gt;Again, this is a rough draft. The spec needs to be cleaned. I welcome comments&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Note that, in all cases, it does not matter where the true directory and where the link is, as long as the link is properly setup. Also, it is okay to create links to other links.&lt;/p&gt;&#xA;&lt;p&gt;Also, &lt;em&gt;link&lt;/em&gt; means &lt;em&gt;symbolic link&lt;/em&gt; throughout the challenge.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="45459" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-15T21:54:44.650" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9586" PostTypeId="2" ParentId="2140" CreationDate="2016-07-14T07:32:54.533" Score="0" Body="&lt;h1&gt;Autotune a chord&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Auto-Tune&quot; rel=&quot;nofollow noreferrer&quot;&gt;Auto-Tune&lt;/a&gt; is a &lt;a href=&quot;https://en.wikipedia.org/wiki/Pitch_correction&quot; rel=&quot;nofollow noreferrer&quot;&gt;pitch correction&lt;/a&gt; program which alters the pitch without changing the length. It can be used to fix off-pitch chords in music, which is good because I have an out of tune piano. The goal of this challenge is given some input waveform which contains a single chord played on my piano, tune each note to the &lt;a href=&quot;https://en.wikipedia.org/wiki/Piano_key_frequencies&quot; rel=&quot;nofollow noreferrer&quot;&gt;nearest equally tempered note found on a standard piano&lt;/a&gt; (see Input for more details).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The input is something which looks like a time-domain audio sample input containing a single chord being played. All data is sampled at 192kHz, with 16-bit PCM (little endian integer), mono channel. The input may come from any source desired (file io, stdio, function parameter, etc.).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The output of your code should be something which looks like a time-domain audio sample containing the tuned chord. It does not need to have the same sample rate or datapoint format as the input, but must be the same length in real time as the original sample (or as close as possible). The output may be to any source desired (file io, stdio, function parameter, etc.).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;See &lt;a href=&quot;https://github.com/helloworld922/chords_examples&quot; rel=&quot;nofollow noreferrer&quot;&gt;this github repo&lt;/a&gt; for various inputs and outputs. The provided examples have inputs/outputs in an uncompressed wav file. Feel free to re-encode/gut the data for your inputs.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is code golf; shortest code wins. Standard loopholes apply. You may use any libraries/builtins so long as they were not designed specifically for performing pitch correction.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Main concern:&lt;/strong&gt; This challenge seems potentially too difficult, so one alternative I've been considering is changing the piano samples into sine waves at the fundamental frequencies (avoids issues with amplitude decay/harmonics). An even simpler challenge might be to give inputs in the frequency domain (list of fundamental frequencies), though I'm not sure that would make for an interesting challenge as it seems almost too easy at that point.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/music&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;music&amp;#39;&quot; rel=&quot;tag&quot;&gt;music&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="31729" LastEditorUserId="31729" LastEditDate="2016-07-14T07:44:32.127" LastActivityDate="2016-07-14T07:44:32.127" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9588" PostTypeId="2" ParentId="2140" CreationDate="2016-07-14T12:32:23.100" Score="0" Body="&lt;p&gt;This will be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge. Additional tags are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;How fast is your Stack Exchange community?&lt;/h1&gt;&#xA;&lt;hr&gt;&#xA;&lt;p&gt;&lt;strong&gt;tl;dr&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to find how fast a Stack Exchange community reacts. &amp;quot;&lt;em&gt;How fast&lt;/em&gt;&amp;quot; is here the average of the time elapsed until the first answer or the closing of the question.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the Stack Exchange site's name, e.g. &lt;code&gt;stackoverflow&lt;/code&gt;, &lt;code&gt;codegolf&lt;/code&gt;, &lt;code&gt;codereview&lt;/code&gt; etc.&lt;/li&gt;&#xA;&lt;li&gt;optionally the Stack Exchange API URL: &lt;code&gt;https://api.stackexchange.com/2.2/&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Requirements&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Calculate the average time it takes until the first answer or closing of the question.&lt;/li&gt;&#xA;&lt;li&gt;Take the &lt;em&gt;1000 latest questions&lt;/em&gt; into account, e.q. ten API requests with 100 items each.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output the average time in &lt;em&gt;minutes and seconds&lt;/em&gt;, like &lt;code&gt;01:23&lt;/code&gt; or &lt;code&gt;1:23&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Run your program at least against &lt;code&gt;stackoverflow&lt;/code&gt;, &lt;code&gt;codegolf&lt;/code&gt; and &lt;code&gt;code review&lt;/code&gt; and show the results.&lt;/li&gt;&#xA;&lt;li&gt;Feel free to add results for your other favorite communities as well.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Boilerplate&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can write a program or a function. If it is an anonymous function, please include an example of how to invoke it.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest answer in bytes wins.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are disallowed.&lt;/li&gt;&#xA;&lt;li&gt;Leading/trailing whitespaces/newlines are fine.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41859" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-14T13:32:17.260" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9590" PostTypeId="1" CreationDate="2016-07-15T05:22:42.753" Score="15" ViewCount="474" Body="&lt;p&gt;I recently posed &lt;a href=&quot;https://codegolf.stackexchange.com/questions/85443/thwart-lepton-compression&quot;&gt;a question about attempting to ruin Lepton's attempt to compress a JPEG&lt;/a&gt;. I've done other file-format-type questions before, to generate a WAV, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/28533/thwart-lzma2-compression&quot;&gt;defeat LZMA compression&lt;/a&gt;, etc, in part because I like to learn how file formats are put together at the byte level.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question is all about file formats and compression methods, both of which are &lt;strong&gt;inherently computational&lt;/strong&gt;, and rather than try to do some frankenscore of the program size and the compression size with some arcane mixing rule, a la the LZMA question, I just made the scoring all about the JPEG. Maybe if I phrased it &quot;you need to generate the JPEG with code&quot;, it would be &quot;about programming&quot;, but really, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/6983/why-i-am-leaving-code-golf&quot;&gt;I don't care about saving bytes with esolang XYZ&lt;/a&gt;, and there are &lt;em&gt;plenty&lt;/em&gt; of other challenges for that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The notion that it's just about &quot;finding the right data&quot; I find to be a bit of a red herring. Every answer to a &quot;true programming problem&quot; is about finding the right string of code to be run, and using a totally naive approach (i.e. attempting to run random strings to get the correct output) in most languages would have orders of magnitude better luck than trying to do the same for this &quot;restricted-source&quot; question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The core of programming is one of specifications. Computers do specific things as dictated by an input and rules as to how the input is handled. Programmers and hackers need to understand how things work in order to (mis)use them. To that end, I suppose if the specifications of the site are defined so narrowly, I could jump through them, but that kinda sucks the fun out of it.&lt;/p&gt;&#xA;" OwnerUserId="176" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-07-25T01:57:04.513" Title="Objective computational challenges without &quot;code&quot;" Tags="|discussion|scope|close-reasons|" AnswerCount="3" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9591" PostTypeId="2" ParentId="9590" CreationDate="2016-07-15T05:39:28.800" Score="3" Body="&lt;p&gt;The difference between your LZMA challenge and this challenge is, the LZMA challenge actually required writing a program as a submission. This challenge merely requires outputting a constant output - there's no programming involved in generating the output (aside from probably writing a program to find a valid output).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4687/do-all-challenges-have-to-be-answered-with-code&quot;&gt;All solutions to challenges must be code submissions&lt;/a&gt; (note that a pseudocode explanation of an algorithm can count as &quot;code&quot; for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt; challenges). If the only point of a program is to output a constant output&lt;sup&gt;[1]&lt;/sup&gt;, then it's not much of a programming challenge, and thus it's off topic for this site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Simply put, this is a site about programming. If there is no programming involved in a challenge, it is off-topic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;[1]&lt;/sup&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenges are a bit different, but solutions to these type of challenges typically involve programmatically generating the output by exploiting some structure/repetition in the desired output, rather than simply doing &lt;code&gt;print(&quot;large string here&quot;)&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-07-15T06:01:37.277" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9592" PostTypeId="2" ParentId="2140" CreationDate="2016-07-15T10:25:34.483" Score="0" Body="&lt;h1&gt;Convert a BMP image to grayscale&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The images manipulation is a great way to exercise and increase your skills. In my opinion it's also very interesting.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;What you must do?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The objective of exercise is much easy: convert an image bmp colorful in an image grey.&lt;br&gt;&#xA;You can use every language, the question most appreciated will be that don't use library.&#xA;&lt;br&gt;&#xA;Image stock: &lt;a href=&quot;http://www.mediafire.com/convkey/c491/p7aya9cxafvfc91zg.jpg&quot; rel=&quot;nofollow&quot;&gt;http://www.mediafire.com/convkey/c491/p7aya9cxafvfc91zg.jpg&lt;/a&gt;&#xA;Image converted:  &lt;a href=&quot;http://www.mediafire.com/convkey/3903/rcigd79pkwd12qczg.jpg?size_id=3&quot; rel=&quot;nofollow&quot;&gt;http://www.mediafire.com/convkey/3903/rcigd79pkwd12qczg.jpg?size_id=3&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="56369" LastActivityDate="2016-07-15T10:25:34.483" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9593" PostTypeId="1" CreationDate="2016-07-15T10:44:08.923" Score="7" ViewCount="261" Body="&lt;p&gt;I've come across &lt;a href=&quot;https://codegolf.stackexchange.com/a/85432/12224&quot;&gt;the following answer&lt;/a&gt; in a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge in Haskell, where one has to provide a function:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;bindings&amp;gt;&#xA;&amp;lt;expression&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now, the last line on its own is a curried expression and as such &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1501/should-function-literals-be-allowed-when-a-function-is-asked-for&quot;&gt;eligible&lt;/a&gt;. However, without the previous definitions, it won't work and results in an error. For example, the following code defines the list of Fibonacci numbers (&lt;code&gt;f&lt;/code&gt;) and provides an expression to get the n-th Fibonacci number:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f=0:1:zipWith(+)f(tail f)&#xA;(f!!)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This isn't valid Haskell, since top-level splices/annotations/expressions in a &lt;code&gt;.hs&lt;/code&gt; file are only possible with &lt;code&gt;TemplateHaskell&lt;/code&gt; (and it won't work if you use &lt;code&gt;-XTemplateHaskell&lt;/code&gt;, since that's not a valid use of TH either). It also cannot get streamed into GHCi or other interpreters with&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;cat File.hs | interpreter`&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;since you need &lt;code&gt;let&lt;/code&gt; to create bindings:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ghci&amp;gt; let f=0:1:zipWith(+)f(tail f)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The only way to create a single expression from this would be &lt;code&gt;let … in&lt;/code&gt;, which takes up to 7 additional bytes&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;let f=0:1:zipWith(+)f(tail f)in(f!!)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which &lt;em&gt;can&lt;/em&gt; be used as anonymous function (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1501/should-function-literals-be-allowed-when-a-function-is-asked-for&quot;&gt;2&lt;/a&gt;), but that seems an overkill to a binding, which takes just two additional bytes:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f=0:1:zipWith(+)f(tail f)&#xA;g=(f!!)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Question&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Is the &lt;a href=&quot;https://codegolf.stackexchange.com/a/85432/12224&quot;&gt;invalid code&lt;/a&gt; invalid? Or are we allowed to introduce syntax/semantic errors and dump some of the work (properly bind, change syntax, or similar) to the user?&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Personal remarks&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given that answers should provide working code that just needs to get loaded/executed, I think that answers of this kind are invalid. The code cannot get loaded in Hugs/GHCi with &lt;code&gt;:l&lt;/code&gt; and it cannot get executed with &lt;code&gt;runhaskell&lt;/code&gt;, &lt;code&gt;ghc -e&lt;/code&gt; or similar.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I think that can lead to &lt;em&gt;many&lt;/em&gt; Haskell answers needing two additional bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that this isn't a duplicate of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9031/unnamed-functions-in-code-golf&quot;&gt;Unnamed Functions in Code Golf&lt;/a&gt;, since that question considers only syntactically valid code. One can have a expression at top-level in Python. It's an error in Haskell.&lt;/p&gt;&#xA;" OwnerUserId="12224" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2016-07-15T18:31:33.553" Title="Does code need to be 100% syntactically correct?" Tags="|discussion|code-golf|" AnswerCount="0" CommentCount="16" ClosedDate="2016-07-17T17:28:01.317" ContentLicense="CC BY-SA 3.0" />
  <row Id="9598" PostTypeId="1" CreationDate="2016-07-17T19:13:27.580" Score="1" ViewCount="53" Body="&lt;p&gt;If a program outputs some string. And then deletes part of the string with the backspace character (in java &quot;\b&quot;). And procedes to print the rest to spec. Would this be considered a violation?&lt;/p&gt;&#xA;" OwnerUserId="46918" LastActivityDate="2016-07-17T19:13:27.580" Title="Backspace Character In output" Tags="|discussion|output|" AnswerCount="0" CommentCount="2" ClosedDate="2016-07-17T19:18:51.667" ContentLicense="CC BY-SA 3.0" />
  <row Id="9600" PostTypeId="2" ParentId="6918" CreationDate="2016-07-17T22:20:45.640" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;http://github.com/DennisMitchell/sesos&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sesos&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;By elected moderator, &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis ♦&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Sesos is an assembly-like language based on Brainfuck. It has a code-head and data-head, and has ten basic commands:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;fwd &amp;lt;n&amp;gt;&lt;/code&gt; moves the data-pointer &lt;code&gt;n&lt;/code&gt; cells forward&lt;br&gt;&#xA;&lt;code&gt;rwd &amp;lt;n&amp;gt;&lt;/code&gt; moves the data-pointer &lt;code&gt;n&lt;/code&gt; cells backward&lt;br&gt;&#xA;&lt;code&gt;add &amp;lt;n&amp;gt;&lt;/code&gt; adds &lt;code&gt;n&lt;/code&gt; to the current cell&lt;br&gt;&#xA;&lt;code&gt;sub &amp;lt;n&amp;gt;&lt;/code&gt; subtracts &lt;code&gt;n&lt;/code&gt; from the current cell&lt;br&gt;&#xA;&lt;code&gt;get&lt;/code&gt; gets a value from STDIN&lt;br&gt;&#xA;&lt;code&gt;put&lt;/code&gt; prints a value to STDOUT&lt;br&gt;&#xA;&lt;code&gt;jmp&lt;/code&gt; creates an entry point and jumps to the corresponding &lt;code&gt;jnz&lt;/code&gt; or &lt;code&gt;jne&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;nop&lt;/code&gt; creates an entry point&lt;br&gt;&#xA;&lt;code&gt;jnz&lt;/code&gt; creates an exit point and jumps to the corresponding &lt;code&gt;jmp&lt;/code&gt; or &lt;code&gt;nop&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;jne&lt;/code&gt; creates an exit point and jumps to a position read from STDIN if it is before EOF  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is compiled to &lt;code&gt;sasm&lt;/code&gt;, or assembled Sesos, which is the used to determine the final code size.&lt;/p&gt;&#xA;" OwnerUserId="39244" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-07-17T22:20:45.640" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9601" PostTypeId="2" ParentId="2140" CreationDate="2016-07-18T16:34:45.917" Score="0" Body="&lt;h1&gt;Do I have an emoji?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an input &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2214/whats-a-string&quot;&gt;string&lt;/a&gt; in your language, return &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2190/19617&quot;&gt;truthy/falsey&lt;/a&gt; if the input contains an valid &lt;a href=&quot;http://unicode.org/emoji/charts/full-emoji-list.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Unicode emoji character&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What is an Emoji?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The word emoji comes from the Japanese:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;絵 (e ≅ picture) 文 (mo ≅ writing) 字 (ji ≅ character).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Emojis are pictorial symbols used to represent feelings, actions, or objects.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For this challenge, use the &lt;a href=&quot;http://unicode.org/emoji/charts/full-emoji-list.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Full Emoji Data&lt;/a&gt; list provided by Unicode as a reference to determine which characters are valid Emojis.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sample test cases:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;&quot;&quot;&lt;/code&gt; -&gt; &lt;code&gt;0&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;&quot;&quot;&lt;/code&gt; -&gt; &lt;code&gt;1&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;&quot;hello&quot;&lt;/code&gt; -&gt; &lt;code&gt;1&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;&quot;hello&quot;&lt;/code&gt; -&gt; &lt;code&gt;0&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;&quot;!±≡&quot;&lt;/code&gt; -&gt; &lt;code&gt;0&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Discussion:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This seems trivial, but I noticed we didn't have an emoji detection challenge.  There might be a concern about the encoding of the input string, but reading the linked meta posts about Strings I feel that this challenge can use whatever String format the language used in the answer supports.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The acceptable output for booleans is also up for discussion.  Do we have a meta post on what output formats are acceptable for booleans?&lt;/p&gt;&#xA;" OwnerUserId="19617" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-07-19T02:38:41.760" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9602" PostTypeId="2" ParentId="9140" CreationDate="2016-07-18T17:48:49.743" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/41439/tiling-given-vertex-configuration&quot;&gt;Tiling Given Vertex Configuration&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tiling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tiling&amp;#39;&quot; rel=&quot;tag&quot;&gt;tiling&lt;/a&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Has several levels of complexity (beginners are able to start easy)&lt;/li&gt;&#xA;&lt;li&gt;Very few answers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-18T17:48:49.743" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9604" PostTypeId="2" ParentId="9590" CreationDate="2016-07-19T01:05:42.283" Score="15" Body="&lt;h1&gt;We should allow computational challenges of all sorts&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;tl;dr: This site is about puzzles based on programming, not puzzles whose solutions are programs. This challenge qualifies.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We currently accept a variety of challenges that are not based directly on code. For instance, we accept algorithm-only challenges. The accepted answer for why we should accept such challenges is that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4687/do-all-challenges-have-to-be-answered-with-code&quot;&gt;algorithms are part of the programming process&lt;/a&gt;. The exact same argument applies here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Programming doesn't end when the code is written. Testing code is an essential part of the programming process, and finding inputs to a program that have interesting behavior is a key part of testing. In this challenge, we are asked to find an input to a program which has unusual behavior for that program. Sure, the submission isn't a piece of code, but that doesn't mean it's unrelated from programming entirely.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition, this is not a challenge that can realistically be solved without writing computer programs. It's &lt;em&gt;possible&lt;/em&gt; that someone will come up with a good solution by hand, but the best solutions are going to be found by a computer program, with very high probability.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moreover, imagine the the challenge was slightly modified from &quot;Find a JPEG that Lepton can't compress&quot; to &quot;Write some code that outputs a JPEG that Lepton can't compress&quot;, where the scoring metric, in either case, was the compression ratio of the resultant JPEG. Would that change anything about the merits of the question? Of course not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's not let an arbitrary rule like &quot;Solutions must be code&quot; hold us back from good challenges such as the one in question.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-07-19T01:05:42.283" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9607" PostTypeId="1" CreationDate="2016-07-19T19:27:03.820" Score="1" ViewCount="118" Body="&lt;p&gt;I get it, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9371/53917&quot;&gt;edits that guess the intent of the poster should be rejected as they may deviate from the original intent of the post&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But what's the point of rejecting an edit &lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits/31715&quot;&gt;like this&lt;/a&gt;, claiming that it changes the sense the post makes? That edit was done to a &lt;a href=&quot;https://codegolf.stackexchange.com/q/44680/53917&quot;&gt;Showcase of Languages&lt;/a&gt; entry, and all it did was to add two snippets whose lengths don't exceed the vote count of the post - it's something the &lt;a href=&quot;https://codegolf.stackexchange.com/users/16294/ypnypn&quot;&gt;original poster&lt;/a&gt; would definitely accept. Why not do such an edit?&lt;/p&gt;&#xA;" OwnerUserId="53917" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2017-04-25T17:45:31.690" Title="What's the point of rejecting edits to &quot;Showcase your language&quot; entries?" Tags="|discussion|editing|" AnswerCount="3" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9608" PostTypeId="2" ParentId="9607" CreationDate="2016-07-19T19:37:18.837" Score="3" Body="&lt;p&gt;It's the same as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1615/suggested-edits-reject-golfing&quot;&gt;edits that golf other people's code&lt;/a&gt;, other than the challenge's objective type. We expect that the code that forms the answer to a challenge should be written solely by the original poster of the answer, with the possible exception of community wiki posts.&lt;/p&gt;&#xA;" OwnerUserId="30688" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-07-19T19:37:18.837" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9609" PostTypeId="2" ParentId="9607" CreationDate="2016-07-19T19:54:22.627" Score="5" Body="&lt;p&gt;While the whole community can edit all posts (or, at least, &lt;em&gt;suggest&lt;/em&gt; it), most posts still have a single owner. Editing a post should be used to improve it in obvious ways that do not require the author's consent (fixing spelling mistakes, improving grammar, adding useful information such as a permalink or a leader board snippet), but never in ways that may conflict with the author's intentions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Furthermore, PPCG isn't really a Q&amp;amp;A site. It makes more sense to improve an answer to a question than to change (or add to) the code in a &lt;em&gt;competition&lt;/em&gt;. As a rule of thumb, if your intention is to add, remove or change the code in an answer, don't. Leaving a comment (golfing suggestion, additional snippet, etc.) that the author might edit into his post is perfectly fine and usually welcomed though.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The only exception to the above are &lt;a href=&quot;https://meta.stackexchange.com/q/11740&quot;&gt;community wiki&lt;/a&gt; posts. While usually (and mistakenly, in my opinion) used as a rep waiver, their intended use case is to create questions or answers where everyone can &quot;chip in&quot;. These posts essentially belong to the whole community rather than a single member of it.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2016-07-19T19:54:22.627" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9610" PostTypeId="1" CreationDate="2016-07-19T21:29:56.433" Score="2" ViewCount="125" Body="&lt;p&gt;Obviously, Grasshopper cannot compete on bytes (files save to rather big binaries with a lot of redundant data). However, in something like a FizzBuzz challenge or a &lt;code&gt;Hello World!&lt;/code&gt; show off, it is different enough to be notable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is a &lt;a href=&quot;https://www.reddit.com/r/rhino/comments/4grr22/fizzbuzz_in_grasshopper_i_wanted_to_do_it_so/&quot; rel=&quot;nofollow&quot;&gt;reddit thread with Grasshopper FizzBuzz example.&lt;/a&gt; They're not &quot;stdout&quot; per se, but they produce the desired output.&lt;/p&gt;&#xA;" OwnerUserId="56157" LastActivityDate="2016-07-19T21:29:56.433" Title="Are visual programming languages. such as Grasshopper, accepted?" Tags="|discussion|" AnswerCount="0" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="9611" PostTypeId="1" CreationDate="2016-07-19T21:56:39.857" Score="2" ViewCount="548" Body="&lt;p&gt;Stack overflow's custom 404 image is a polyglot that prints &quot;404&quot;. Our 404 image is just 404 in a blue color. Some theme-graduated sites have a gray 404. Stack overflow users requested a custom 404 image, like Physics.se or InfoSec.se. Some sites like crypto.se have their own custom image. We should too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/4Uusu.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/4Uusu.png&quot; alt=&quot;SO&amp;#39;s 404 image&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/7dENe.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/7dENe.png&quot; alt=&quot;Our 404 Image&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/TVXDK.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/TVXDK.png&quot; alt=&quot;Most site&amp;#39;s 404&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="41088" LastEditorUserId="66833" LastEditDate="2023-08-26T17:56:45.630" LastActivityDate="2023-08-26T17:56:45.630" Title="We need a funny 404 image" Tags="|discussion|404-page|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9613" PostTypeId="2" ParentId="4896" CreationDate="2016-07-19T22:18:15.190" Score="-3" Body="&lt;p&gt;If the author randomly selected two pictures of humans, there's a 1/4 chance the OP selects two women. So what? It's just two people who were selected - it's not like the OP selected 100 people and they were all women. The OP could've just as likely selected two men.&lt;/p&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2016-07-19T22:18:15.190" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9614" PostTypeId="2" ParentId="9611" CreationDate="2016-07-19T22:33:21.207" Score="23" Body="&lt;p&gt;The design of 404 page is a part of site's custom design, something that PPCG does not have. It is not something that a site requests. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's true that sometimes a custom 404 page is just the number 404. It's still a custom design: &lt;a href=&quot;https://rpg.stackexchange.com/404&quot;&gt;https://rpg.stackexchange.com/404&lt;/a&gt; uses a font matching the site's logo, while &lt;a href=&quot;https://money.stackexchange.com/404&quot;&gt;https://money.stackexchange.com/404&lt;/a&gt; looks like a number on a banknote. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Information Security site is an unusual case: initially it used a frame from the movie &lt;em&gt;Beautiful Mind&lt;/em&gt; on its 404 page, but when the copyright implication was realized, the image was removed.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Whatever 404 page will be, it has to match the overall site design, so it's pointless to discuss it separately from that. Obtaining it ahead of the design isn't an option. &lt;/p&gt;&#xA;" OwnerDisplayName="user34672" LastEditorUserId="-1" LastEditDate="2017-04-13T12:45:52.163" LastActivityDate="2016-07-19T22:33:21.207" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9617" PostTypeId="2" ParentId="2140" CreationDate="2016-07-20T04:00:41.933" Score="5" Body="&lt;h1&gt;The Ifelse Tower&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are an inhabitant of the whimsical country of &lt;em&gt;Forance&lt;/em&gt;, filled with programmers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Life in &lt;em&gt;Forance&lt;/em&gt; is said to be extremely repetitive, which isn't good to attract tourists. For this, authorities of &lt;em&gt;Forance&lt;/em&gt; want to hire someone to&#xA;print tons of postcards to promote their most iconic landmark: &lt;strong&gt;&lt;em&gt;the Ifelse tower&lt;/em&gt;&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;                   if&#xA;                   if&#xA;                   if&#xA;                   if&#xA;                   if&#xA;                   if&#xA;                   if&#xA;                  else&#xA;                  else&#xA;                 ifelse&#xA;                  else&#xA;                  else&#xA;                ifelseif&#xA;                ifelseif&#xA;               elseifelse&#xA;              ifelseifelse&#xA;            elseifelseifelse&#xA;              ifelseifelse&#xA;              ifelseifelse&#xA;              else    else&#xA;             else      else&#xA;            else        else&#xA;           else          else&#xA;          else            else&#xA;       ifelseifelseifelseifelseif&#xA;       ifelseifelseifelseifelseif&#xA;       ifelseifelseifelseifelseif&#xA;       ifelseifelseifelseifelseif&#xA;      elseifelseif    elseifelseif&#xA;     elseifelse          elseifelse&#xA;    ifelseif                ifelseif&#xA;   ifelse                      ifelse&#xA;  ifelse                        ifelse&#xA; ifelse                          ifelse&#xA;ifelse                            ifelse&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;But, of course, they want to do this with the least possible cost. So, if you want this job, you have to show you can do this with very little code&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that takes no input, and outputs to STDOUT the Ifelse tower.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Leading and traling new lines are not allowed&lt;/li&gt;&#xA;&lt;li&gt;Leading spaces are (of course) a must&lt;/li&gt;&#xA;&lt;li&gt;All lines must be &lt;strong&gt;at most&lt;/strong&gt; the same lenght as the base (40 chars). This means you are free to use or not trailing spaces on each line, as long as they don't surpass the base's lenght&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are not allowed&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes gets the job -err wins&lt;/p&gt;&#xA;" OwnerUserId="56543" LastActivityDate="2016-07-20T04:00:41.933" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9619" PostTypeId="1" CreationDate="2016-07-20T08:16:45.707" Score="37" ViewCount="2656" Body="&lt;p&gt;I'm sure many of you want to attract golfers to compete in your favorite language. Given that it takes time to learn a language for golfing, why choose it over others? What aspects of the language make it fun to golf? What skills or mindset do you gain?  Please be specific and concrete.&lt;/p&gt;&#xA;&lt;p&gt;Any language is fine to recommend: well-known, esoteric, community-made, and so on.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="68942" LastEditDate="2021-06-05T23:24:11.837" LastActivityDate="2023-09-22T18:43:29.413" Title="Advocate languages to golf in" Tags="|discussion|code-golf|" AnswerCount="25" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="9620" PostTypeId="2" ParentId="9619" CreationDate="2016-07-20T08:29:03.357" Score="-14" Body="&lt;p&gt;Brainfuck because its fun. Its easy to learn (only 8 commands) and its Turing complete, so its very flexible.&lt;/p&gt;&#xA;" OwnerUserId="52087" LastActivityDate="2016-07-20T08:29:03.357" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9621" PostTypeId="2" ParentId="9619" CreationDate="2016-07-20T09:57:48.703" Score="26" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/JCumin/Brachylog&quot; rel=&quot;nofollow&quot;&gt;Brachylog&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;A declarative logic language&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The vast majority of golfing languages on this site are stack based. Some are also imperative or APL-like. Very few are declarative (Brachylog is probably the only logic language regularly used on PPCG nowadays).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This means that your mindset when writing Brachylog answers is often completely different than the mindset you have with other languages, and thus the things you can exploit to shorten your code are also completely different (e.g. backtracking, pattern matching).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;High level built-ins and meta-predicates&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Partly because it is a declarative language, and partly because it is unfinished, Brachylog's built-in predicates are mostly high level relations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A big part of writing Brachylog code is using meta-predicates that apply on other predicates. For example, there is no built-in to transform a string into a list of characters, but one can get the same relation by applying &lt;code&gt;f - Find all&lt;/code&gt; to &lt;code&gt;e - Enumerate&lt;/code&gt;: &lt;code&gt;Enumerate&lt;/code&gt; unifies its output with one character of the input string, therefore applying &lt;code&gt;Find all&lt;/code&gt; will yield all characters of the input string through backtracking.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another interesting feature of Brachylog, which also exists in Prolog, is the fact that most predicates can be &quot;called in all directions&quot;. For example, &lt;code&gt;@n&lt;/code&gt; splits its input string into a list of strings on line breaks. But this can also be called with the input as a variable and the output grounded, thus concatenating a list of strings into a single string with line breaks between each element. The code that does those operations is exactly the same for both.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because of this lack of very specific built-ins and the declarative nature of the language, Brachylog answers are almost always longer than other golfing languages.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Constraints programming&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Brachylog is the only declarative language, as far as I know, where all of integer arithmetic is based on constraints programming (here, using the &lt;a href=&quot;http://www.swi-prolog.org/man/clpfd.html&quot; rel=&quot;nofollow&quot;&gt;CLP(FD) library&lt;/a&gt;, which actually &lt;a href=&quot;http://www.swi-prolog.org/pldoc/man?section=clpfd-applications&quot; rel=&quot;nofollow&quot;&gt;makes a mention of Brachylog&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This makes operations on integers very declarative instead of the usual imperative paradigm. For instance, If you want to find all couples &lt;code&gt;[I,J]&lt;/code&gt; of integers which sum to &lt;code&gt;42&lt;/code&gt;, then you simply use the &lt;code&gt;+&lt;/code&gt; predicate as you would when summing a list of numbers with grounded values:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[I:J]              Input (a variable which will be returned) is the list [I,J]&#xA;     :#$a          Apply #$ (is an integer) to all elements of Input&#xA;         +42       The sum of I and J results in 42&#xA;            ,      (At this point, I and J have no values but are constrained &#xA;                   such that their sum is 42)&#xA;             ?=    Assign a value to I and J&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;When running this in the interpreter, we can ask for as many answers as we want (pressing &lt;code&gt;;&lt;/code&gt;) and see that this predicate &quot;returns&quot; as many correct answers as we want:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;?- run_from_atom('[I:J]:#$a+42,?=',Z).&#xA;Z = [0, 42] ;&#xA;Z = [1, 41] ;&#xA;Z = [-1, 43] ;&#xA;Z = [2, 40] ;&#xA;Z = [-2, 44] ;&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Learn more about Prolog&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Brachylog is based on Prolog, the transpiler transforms your Brachylog code into Prolog code, and the transpiler itself (and all built-ins) are written in Prolog. Needless to say, I learnt a lot about Prolog by creating and using this language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While Prolog is definitely not the most used language in the world, it's still a nice paradigm to taste that will change the way you look at programming problems.&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="41723" LastEditDate="2016-07-20T11:55:51.887" LastActivityDate="2016-07-20T11:55:51.887" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9623" PostTypeId="2" ParentId="9619" CreationDate="2016-07-20T18:45:17.313" Score="33" Body="&lt;h1&gt;Java&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Java may be verbose, but don't we golfers come to PPCG to have a challenge? Don't we come here to do what was thought to be impossible? &lt;strong&gt;We golf not because it is easy, but because it is hard.&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Winning in Java may not be easy, but succeeding means receiving supreme glory (i.e. upvotes).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And if you really want conciseness, go use Kotlin.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;sup&gt;Darn Kennedy stole that line from me...&lt;/sup&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="41088" LastEditorUserId="41088" LastEditDate="2016-11-23T15:34:37.657" LastActivityDate="2016-11-23T15:34:37.657" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9624" PostTypeId="2" ParentId="2140" CreationDate="2016-07-20T19:03:30.820" Score="1" Body="&lt;h1&gt;The French Farmer in the Dell&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I used to work with kids and &lt;a href=&quot;https://en.wikipedia.org/wiki/The_Farmer_in_the_Dell&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Farmer in the Dell&lt;/a&gt; was a popular song among them. Also, I like challenge like &lt;a href=&quot;https://codegolf.stackexchange.com/q/64198/15214&quot;&gt;99 bottles of beer&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/q/85746/15214&quot;&gt;Polar Bear, Polar Bear, what do you hear?&lt;/a&gt;. Try them too!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Goal&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In your programming language of choice, write the smallest program possible which will output the following text. Output should match exactly, including case, spacing, and punctuation. A trailing linefeed is fine but specify it in your answer. We will play with the &lt;a href=&quot;https://fr.wikipedia.org/wiki/Le_Fermier_dans_son_pr%C3%A9&quot; rel=&quot;nofollow noreferrer&quot;&gt;french version&lt;/a&gt; of the song because I find it more interesting than the english version (also I am french so more memories for me!).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Le fermier dans son pre,&#xA;Le fermier dans son pre,&#xA;Ohe, Ohe, Ohe,&#xA;Le fermier dans son pre.&#xA;&#xA;Le fermier prend sa femme,&#xA;Le fermier prend sa femme,&#xA;Ohe, Ohe, Ohe,&#xA;Le fermier prend sa femme.&#xA;&#xA;La femme prend son enfant,&#xA;La femme prend son enfant,&#xA;Ohe, Ohe, Ohe,&#xA;La femme prend son enfant.&#xA;&#xA;L'enfant prend sa nourrice,&#xA;L'enfant prend sa nourrice,&#xA;Ohe, Ohe, Ohe,&#xA;L'enfant prend sa nourrice.&#xA;&#xA;La nourrice prend son chat,&#xA;La nourrice prend son chat,&#xA;Ohe, Ohe, Ohe,&#xA;La nourrice prend son chat.&#xA;&#xA;Le chat prend sa souris,&#xA;Le chat prend sa souris,&#xA;Ohe, Ohe, Ohe,&#xA;Le chat prend sa souris.&#xA;&#xA;La souris prend son fromage,&#xA;La souris prend son fromage,&#xA;Ohe, Ohe, Ohe,&#xA;La souris prend son fromage.&#xA;&#xA;Le fromage est battu,&#xA;Le fromage est battu,&#xA;Ohe, Ohe, Ohe,&#xA;Le fromage est battu.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If you are french, you may note that I replace all &lt;code&gt;é&lt;/code&gt; with &lt;code&gt;e&lt;/code&gt;. It is not important for the challenge and I prefer to stay full ASCII.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want to code while listening to the song, you can find it on &lt;a href=&quot;https://youtu.be/l2UXqfi7Rqg&quot; rel=&quot;nofollow noreferrer&quot;&gt;YouTube&lt;/a&gt;. :)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A not so difficult challenge. I originally thought about posting it directly, but I prefer to share it first. I don't think test case are needed. I implemented both the english and french version and the last one is far better to my taste :)&lt;/p&gt;&#xA;" OwnerUserId="15214" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.193" LastActivityDate="2016-07-20T19:03:30.820" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9626" PostTypeId="2" ParentId="9619" CreationDate="2016-07-20T21:27:18.640" Score="29" Body="&lt;h2&gt;&lt;a href=&quot;https://github.com/m-ender/retina&quot; rel=&quot;nofollow&quot;&gt;Retina&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Before we start: if you hate regex with a passion, you can stop reading here. You're not getting around using regex when coding in Retina. That said, you don't need to be a regex expert either. A willingness to learn more about them should suffice. ;)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Retina is different&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This language doesn't really follow the same patterns as any mainstream language. The closest thing is probably the Unix shell utility &lt;code&gt;sed&lt;/code&gt;. There are no variables, assignments or function calls. Your program is just a sequence of commands (called &lt;em&gt;stages&lt;/em&gt;) which receive a string as input and produce a string as output. The first stage's input is simply STDIN and the last stage's output is STDOUT. And every single stage processes the input by applying a regex. This results in a fairly unique mix of the imperative and declarative programming paradigms.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My point here is, solving problems in Retina often requires very different approaches than in other languages, and that makes you think outside of the box. Even though all you can do in the language is string processing, Retina is perfectly capable of solving arithmetic problems (and often in very concise ways), but chances are you'll have to think about alternative number representations. Coding (and specifically golfing) in Retina can be an interesting puzzle but at the same time it's not impossible to come up with a first attempt to solve a given problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, while this is true of many languages, golfing in Retina is interesting because There's More Than One Way To Do It™. For many problems, there's a trade-off between using a single elaborate regex, or processing the input via a series of simpler steps, and Retina's growing arsenal of stage types allows a variety of approaches to most problems.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Retina is competitive&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Of course, Retina isn't quite the powerful general-purpose golfing language like Jelly or 05AB1E, and doesn't regularly win the competition, but for certain kinds of challenges it's often within reach of the top answers, and it has won several challenges in the past. Its syntax was largely designed with golfing in mind, and for certain string-based problems, there's no shorter way to express a solution than with a regex or two.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Retina is useful&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I find that having a good grasp on regex is a huge productivity boost, even if you don't use regular expressions in your day-to-day coding activities. One often has to restructure larger pieces of code or other strings in a systematic way, and being able to do so with regex can be very convenient (at least for those who aren't fluent in vim or emacs).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Retina has become sufficiently expressive that I regularly use it at work to write throw-away scripts for larger string transformations. Thanks to its online interpreter (courtesy of Dennis), I can just quickly open a tab with it whenever I need it and type out a quick script to do what I need.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Retina is under active development&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I guess this is both a disadvantage and an advantage. Of course it means that the language occasionally changes (potentially breaking previous features), so you might have to readjust a bit occasionally. However, it also means there are still exciting features to be added in the future, further broadening Retina's possibilities (you can think of it like free DLC :P), and it also means you can help shape the language by letting me know what sorts of features you'd find useful or which ones you think I messed up. I'm very happy about any kind of feedback on the language!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Hooked?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If any of that has sparked your interest...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There's a &lt;a href=&quot;http://chat.stackexchange.com/rooms/41525/retina&quot;&gt;&lt;strong&gt;Retina chatroom&lt;/strong&gt;&lt;/a&gt; where you'll usually find me or a couple of other regular Retina users who will be happy to answer your questions (and if no one's around, just ping me and I'll get back to you). I also announce new releases in this chatroom and occasionally discuss new feature ideas.&lt;/li&gt;&#xA;&lt;li&gt;There's the official &lt;a href=&quot;https://github.com/m-ender/retina/wiki/The-Language&quot; rel=&quot;nofollow&quot;&gt;&lt;strong&gt;language documentation&lt;/strong&gt;&lt;/a&gt; which I'm keeping up to date with every release. If anything is unclear, please let me know, so that I can improve it. :)&lt;/li&gt;&#xA;&lt;li&gt;And there's the &lt;a href=&quot;http://retina.tryitonline.net/&quot; rel=&quot;nofollow&quot;&gt;&lt;strong&gt;online interpreter&lt;/strong&gt;&lt;/a&gt; on Try It Online where you can jump right in.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;With the language still subject to change, there isn't a proper tutorial yet, but I'm hoping that those three links will get you started in the meantime. :)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2016-07-26T09:07:47.343" LastActivityDate="2016-07-26T09:07:47.343" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9627" PostTypeId="2" ParentId="9619" CreationDate="2016-07-21T05:39:01.047" Score="14" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/DJMcMayhem/V&quot; rel=&quot;nofollow noreferrer&quot;&gt;V&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;You should golf in V because it's different, competitive, and powerful. V is a very interesting language, that functions very differently than any other language I have ever used. Most of the quirks of V make it somewhat hard to learn, but also offer a lot of potential for golfing.&lt;/p&gt;&#xA;&lt;h2&gt;V is different&lt;/h2&gt;&#xA;&lt;p&gt;Most golfing languages have tons of math-based operations. V does not even have numbers. Everything happens in a gigantic 2D array of characters. Now, that's not to say you can't do &lt;a href=&quot;http://v.tryitonline.net/#code=ZGl3QCIBfHg&amp;amp;input=MyA4&quot; rel=&quot;nofollow noreferrer&quot;&gt;mathy operations on these strings&lt;/a&gt;, but this is still just simulating math through the manipulation of the characters in the buffer.&lt;/p&gt;&#xA;&lt;p&gt;Another quirk that makes V more fun to play with is the cursor. The program keeps track of a &amp;quot;cursor&amp;quot; which is just the location of where all the string base commands will actually do their operations on the buffer. Here's an example.&lt;/p&gt;&#xA;&lt;p&gt;The 'x' command deletes the character under the cursor. (&lt;a href=&quot;http://v.tryitonline.net/#code=eA&amp;amp;input=SGVsbG8sIFdvcmxkIQ&quot; rel=&quot;nofollow noreferrer&quot;&gt;demo&lt;/a&gt;) The 'w' motion moves forward one word, so if the program was &lt;code&gt;wx&lt;/code&gt;, this would delete the first character of the next word. (&lt;a href=&quot;http://v.tryitonline.net/#code=V3g&amp;amp;input=SGVsbG8sIFdvcmxkIQ&quot; rel=&quot;nofollow noreferrer&quot;&gt;demo&lt;/a&gt;) There are many other motions such as&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;e     &amp;quot;End of this word&#xA;E     &amp;quot;End of this WORD&#xA;b     &amp;quot;Previous word&#xA;B     &amp;quot;Previous WORD&#xA;&amp;lt;n&amp;gt;|  &amp;quot;The first (default) or N'th column&#xA;$     &amp;quot;Last column&#xA;G     &amp;quot;Last line&#xA;&amp;lt;n&amp;gt;gg &amp;quot;The first (default) or N'th line&#xA;f&amp;lt;n&amp;gt;  &amp;quot;To the first occurrence of 'n'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Also, fun fact about V: Even though it is an entirely string-based language, it doesn't even have string literals!&lt;/p&gt;&#xA;&lt;h2&gt;V is modal&lt;/h2&gt;&#xA;&lt;p&gt;In most golfing languages, a command is a command. In V, there are 4 different &lt;em&gt;modes&lt;/em&gt;, where each character does drastically different things. For example, &lt;code&gt;&amp;lt;C-a&amp;gt;&lt;/code&gt;, e.g. &lt;code&gt;0x01&lt;/code&gt; can mean either &amp;quot;increment the next number&amp;quot; or &amp;quot;Re-insert the previous text&amp;quot;. &lt;code&gt;&amp;lt;C-r&amp;gt;&lt;/code&gt; can mean &amp;quot;Redo the last change&amp;quot;, or &amp;quot;Insert the contents of a certain register&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;Since V will eventually use a 255-character code-page, this means there are way more builtins possible.&lt;/p&gt;&#xA;&lt;h2&gt;V is composable&lt;/h2&gt;&#xA;&lt;p&gt;Here's where we get to talk about the fun part of V! Every command is either an &lt;em&gt;operator&lt;/em&gt;, or a &lt;em&gt;motion&lt;/em&gt;. Each of these do next to nothing by themselves, however V chains commands together in a very fun way!&lt;/p&gt;&#xA;&lt;p&gt;Here's an example. The motion 'w' moves the cursor to the beginning of the next word. '$' moves to the end of the current line, and '|' moves to the beginning of the current line. These are all &amp;quot;motions&amp;quot;, or as I like to think of them &amp;quot;nouns&amp;quot;. They all take &amp;quot;counts&amp;quot; e.g. '2w' moves two words forward, or &amp;quot;5tt&amp;quot; will move until the fifth occurence of the letter 't'.&lt;/p&gt;&#xA;&lt;p&gt;'d' is an operator, or as I prefer to think of it &amp;quot;verb&amp;quot;, and it's mnemonic is (d)elete. So what exactly &lt;em&gt;does&lt;/em&gt; it delete? Whatever you want it to! Want to delete a word? Then &amp;quot;dw&amp;quot; will (d)elete a (w)ord. Want to delete until the end of this line? &amp;quot;d$&amp;quot;! Or you can (d)elete until you (f)ind the next letter (i) with &amp;quot;dfi&amp;quot;, or you can delete until the last line with &amp;quot;dG&amp;quot;, or you can delete a straight line until the last line with &amp;quot;dê&amp;quot;!&lt;/p&gt;&#xA;&lt;p&gt;This does not even begin to scratch the surface of all the various fine-grained movements you can pass as an argument to the &amp;quot;delete&amp;quot; operator.&lt;/p&gt;&#xA;&lt;p&gt;You could even construct a crazy command like:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ç/regex/&amp;quot;Ay3ff&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Which is&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ç               &amp;quot;On every line:&#xA; /regex/        &amp;quot;Where &amp;quot;regex&amp;quot; matches&#xA;          y     &amp;quot;yank&#xA;        &amp;quot;A      &amp;quot;Into register 'a'&#xA;           3ff  &amp;quot;Until the third occurence of the letter 'f'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;However, here is where V get's really cool. Every single argument that can be passed to 'd'? You can pass those motions (or nouns) as arguments to &lt;em&gt;every single operator&lt;/em&gt;. (c)hange, (y)ank, ä, or duplicate, (v)isually select, etc. That's what being composable really means.&lt;/p&gt;&#xA;&lt;h2&gt;V has history&lt;/h2&gt;&#xA;&lt;p&gt;V was &lt;em&gt;heavily&lt;/em&gt; inspired by vim. In fact, it actually &lt;em&gt;is&lt;/em&gt; vim under the hood. Vim is a very successfull text editor that has been in active development since 1991. Vim was heavily inspired by Stevie (1987) which was heavily inspired by Bill Joy's vi (1976). There's a reason this editor has been around for 40 years. Sure, it might not be awesome at playing with numbers, but it knows it's purpose (transmogrifying text), and it does it well.&lt;/p&gt;&#xA;&lt;h2&gt;V is competitive&lt;/h2&gt;&#xA;&lt;p&gt;I have seen V go toe-to-toe with languages such as Osabie, Retina, Jolf, Jelly and Pyth. It hasn't won every single time, but I have seen it beat each of these languages. (Granted, on a small subset of problems) Using it's &amp;quot;compressed regex&amp;quot; system, it's unique way of taking inputs and outputs and it's verb+noun system I think V is a &lt;em&gt;very&lt;/em&gt; competitive language, that will only become shorter as I work on it more.&lt;/p&gt;&#xA;&lt;h2&gt;V is in active development&lt;/h2&gt;&#xA;&lt;p&gt;This could be seen as a good thing or a bad thing. On the downside, the documentation isn't awesome, and some features might not always work. On the upside, you can be a part of helping shape it and turn it into an even more competitive language.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-07T20:44:21.767" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9628" PostTypeId="2" ParentId="9619" CreationDate="2016-07-21T05:47:42.577" Score="13" Body="&lt;h1&gt;Perl&lt;/h1&gt;&#xA;&#xA;&#xA;&#xA;&lt;p&gt;Perl is a terse, multi-purpose, well-documented scripting language that is quite well-suited to many golfing tasks. It's by no means the best, but can often be in the top 3 languages of solutions.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Availability&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Perl is available on all platforms for free, and is pre-installed on many systems by default (a lot of Linux distros and OS X) providing one less barrier to getting started. Whilst its syntax can look quite intimidating,  it's usually just a combination of the various built-in command-line switches, special variables and regular expressions.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Regular Expressions&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Perl's flavour of regex is ported to a lot of other languages for its versatility and can be (ab)used for great entertainment. Where it's built in to the language at the core, its syntax can provide you with a short, easy way to extract data from strings:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$_=&quot;This is a test&quot;;&#xA;@l=/\w+/g; # @l is now a list: (&quot;This&quot;,&quot;is&quot;,&quot;a&quot;,&quot;test&quot;)&#xA;&#xA;$_=&quot;38.8977,77.0365&quot;;&#xA;/,/; # $` is now set to &quot;38.8977&quot; and $' is &quot;77.0365&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Whilst you don't have to know regular expressions to use Perl, you'll quickly find that a lot of the benefits of the language come from this aspect, and the associated magic variables.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Magic Variables&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Ok, not really &quot;magic&quot;, but there are a lot of predefined variables that can be used to shorten output, perform some functions (automatically round, automatically match against, pre-initialised to &lt;code&gt;&quot;\n&quot;&lt;/code&gt; or &lt;code&gt;&quot; &quot;&lt;/code&gt;, any many more. Whilst using these might be confusing at first, all these variables are well-documented.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Well-documented&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Since Perl has been around for quite a while, there is an abundance of documentation, tutorials and guides on how to use the language. Also, since it has been used for golfing for probably almost as long as it's been around, there are a lot of resources that can help you get started or test your newly found skill-set.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;A General-purpose Tool&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If you spend any amount of time on a remote server extracting information from files, you can easily use Perl's short syntax combined with its flags to manipulate files easily and extract what you need. Since it's available on almost every server I've been given access to, you'll never wonder how to extract the passwords from all 40 configuration files ever again!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Summary&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Perl isn't always competitive, but it has some pretty fun tricks to outperform some languages. I've been using code golf as a way to improve my understanding of the language and get better and more confident using it in my day-to-day work. Whilst I might not use the syntax I'd use in code golf, I certainly use my greater understanding!&lt;/p&gt;&#xA;" OwnerUserId="9365" LastEditorUserId="39490" LastEditDate="2016-08-02T10:23:31.247" LastActivityDate="2016-08-02T10:23:31.247" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9630" PostTypeId="2" ParentId="9619" CreationDate="2016-07-21T08:50:02.260" Score="7" Body="&lt;h1&gt;Perl 6&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;While often not seen as golfy as Perl 5 (less magic going on everywhere), this language has many constructs and included batteries that are useful for golfing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But this language has a looooot of very useful syntactic sugar. Without going too deep into &quot;tips for golfing&quot;, just a few...&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The whatever star&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Make a function out of pretty much any expression.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;*+*&#xA;*.foo.bar&#xA;-*.call&#xA;&#xA;# equivalent to (those are lambdas, Ruby-style)&#xA;-&amp;gt; $a, $b { $a + $b }&#xA;-&amp;gt; $a { $a.foo.bar }&#xA;-&amp;gt; $a { -$a.call }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Bags&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A bag is a set that kept the number of occurences. It's very useful for counting number of matches when doing matching/parsing. (e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/19568/count-the-words-in-a-text-and-display-them/79605#79605&quot;&gt;here&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Dot-calls&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If you know Perl 5, you know about the topic variable, &lt;code&gt;$_&lt;/code&gt;, that many constructs (&lt;code&gt;for&lt;/code&gt;, &lt;code&gt;with&lt;/code&gt;, &lt;code&gt;given&lt;/code&gt;, ...) set for you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In Perl 6, any bare dot in term position (e.g. not a function call) is interpreted as acting on &lt;code&gt;$_&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.say for @array;&#xA;# same as&#xA;$_.say for @array;&#xA;# same as&#xA;for @array { $_.say } # the semicolon is optional at the end of a block&#xA;# same as&#xA;for @array -&amp;gt; $str { $str.say }&#xA;# which happens to exist as a function as well&#xA;for @array -&amp;gt; $str { say $str }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Lazy / infinite arrays&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1..Inf # an array from one to infinite.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Useful when you don't know beforehand when you're gonna stop.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Unnamed variables&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;And last but not least... Variables can &lt;strong&gt;not&lt;/strong&gt; have a name. They're interpreted as state variables. Works for all sigils (&lt;code&gt;$@%&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;say $_ x ++%{$_} for 'abc def ghi abc'.words) # each will be repeated the number of times it's been seen.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;All those can make for some very cute, err, unreadable code! (thus properly golfed :P)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{$_&amp;gt;1&amp;amp;&amp;amp;.[0].value==.[1].value??&quot;&quot;!!.[0].key given .lc.words.Bag.sort:{-.value}}&#xA;{.comb(/&amp;lt;-[_\W]&amp;gt;+/).Bag.sort:{-.value}}&#xA;{.split('').map({$_ x++%.{$_}}).join}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="8328" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-07-21T08:50:02.260" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9631" PostTypeId="2" ParentId="2140" CreationDate="2016-07-21T09:14:00.247" Score="0" Body="&lt;h2&gt;Trim trailing spaces in less than O(n²) time&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Since &lt;code&gt;s/\s+$//&lt;/code&gt; &lt;a href=&quot;http://stackstatus.net/post/147710624694/outage-postmortem-july-20-2016&quot; rel=&quot;nofollow&quot;&gt;runs in O(n²) time&lt;/a&gt;, Stack Overflow needs to replace it with something faster. Please write a code snippet for them. Your score will be the number of bytes in your submission, multiplied by the time taken to process a string of 1000 non-spaces with 1,000,000 leading and trailing spaces, divided by 1000 times the time taken to process a string of 1-non space with 1,000 leading and trailing spaces. (In other words, if your code runs in O(n) time then this should cancel out.)&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2016-07-21T09:14:00.247" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9633" PostTypeId="2" ParentId="2140" CreationDate="2016-07-21T14:18:17.670" Score="0" Body="&lt;p&gt;Given an ordinal A and a nonnegative integer B, compute f_A(B)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A will be expressed in Cantor Normal Form. A number is in Cantor Normal Form if it is 1, or if it is either of the form a+b or w^a, where a and b are in Cantor Normal Form, and w is the ordinal omega.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;f_A(B) is the fast-growing hierarchy, specifically, the Wainer Hierarchy.&#xA;f_0(n)=n+1.&#xA;f_(a+1)(n)= n iterations of f_a to n.&#xA;f_a(n)=f_an if a is a limit ordinal.&#xA;a[n] is the nth member of the fundamental sequence for a.&lt;/p&gt;&#xA;" OwnerUserId="55345" LastEditorUserId="55345" LastEditDate="2016-07-22T12:23:42.300" LastActivityDate="2016-07-22T12:23:42.300" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9634" PostTypeId="2" ParentId="2140" CreationDate="2016-07-21T15:18:03.070" Score="-2" Body="&lt;h1&gt;The Library Problem&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Bob has a very annoying problem. His boss told him to write a cat program that redirects the standard input to the standard output. But he recently installed a virus on his computer which deleted every libraries on it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now he really need to create this program without using any library (even the language standard library). It need to run at least on one operating system with one architecture.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program or that redirects the standard input to the standard output without using any library or external program/command to run to help Bob. You can use system calls and interrupts for example, but your program must not run in ring 0 mode (most operating systems like Microsoft Windows or GNU/Linux have kernels which prevent programs from doing anything, but MS-DOS for example let programs do everything).&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Input&lt;/strong&gt;: anything (text, binary)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Output&lt;/strong&gt;: exactly the same as the input&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins!&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;First:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input: &lt;code&gt;Hello, world!&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Output: &lt;code&gt;Hello, world!&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Second:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input: &lt;code&gt;...&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Output: &lt;code&gt;...&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user54187" LastEditorDisplayName="user54187" LastEditDate="2016-07-21T15:23:07.837" LastActivityDate="2016-07-21T15:23:07.837" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9636" PostTypeId="2" ParentId="9619" CreationDate="2016-07-21T16:00:04.407" Score="6" Body="&lt;h2&gt;Pyke&lt;/h2&gt;&#xA;&lt;p&gt;Pyke like most first golfing languages is stack based. It uses a multi-type system combined with attributes of the stack to decide which functions to call and what the output should be like. Pyke has lots of features to help with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. It's tree-like structure makes Pyke to be among the easier to read golfing languages.&lt;/p&gt;&#xA;&lt;h3&gt;Implicit input&lt;/h3&gt;&#xA;&lt;p&gt;The order of inputs is crucial as to how the program will behave. If the input stack is empty when input is required, it pulls it from the &lt;code&gt;Q&lt;/code&gt; variable which initially stores the first input given. If the &lt;code&gt;Q&lt;/code&gt; node is used, the first item on the input stack isn't used implicitly. Instead it goes through the other inputs before going back to &lt;code&gt;Q&lt;/code&gt; when all are exhausted.&lt;/p&gt;&#xA;&lt;h3&gt;Implicit variables&lt;/h3&gt;&#xA;&lt;p&gt;The &lt;code&gt;i&lt;/code&gt; variable is magical - in any repeating loop, the first item on the stack is automatically copied to the &lt;code&gt;i&lt;/code&gt; variable (but only if &lt;code&gt;i&lt;/code&gt; is actually used). This allows for more advanced input comparisons. At the end of a loop, if the &lt;code&gt;i&lt;/code&gt; variable was set before the loop began, it goes back to what it was. This allows for nested looping with the &lt;code&gt;i&lt;/code&gt; variable.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;code&gt;j&lt;/code&gt; and &lt;code&gt;i&lt;/code&gt; variables are unset at the beginning of the program  and when first used automatically store the first item on the stack inside of them without popping it. When used after a variable has been stored in them, they add that variable to the stack.&lt;/p&gt;&#xA;&lt;h3&gt;Predefined variables&lt;/h3&gt;&#xA;&lt;p&gt;Every node in the Pyke language can store a variable which can be retrieved with &lt;code&gt;~&amp;lt;node&amp;gt;&lt;/code&gt;. Among these constants include multiple permutations of the upper and lower case alphabet combined with numbers and/or with punctuation.&lt;/p&gt;&#xA;&lt;p&gt;Pyke also comes with other useful constants such as e and pi but also comes with various time related constants such as &amp;quot;seconds&amp;quot;, &amp;quot;minutes&amp;quot; and &amp;quot;hours&amp;quot; for those annoying date challenges that require them specifically. Pyke has those constants in plural and singular form.&lt;/p&gt;&#xA;&lt;h3&gt;Predefined English dictionary&lt;/h3&gt;&#xA;&lt;p&gt;Pyke comes with a simple dictionary compressor which converts words to unicode form. A translator to this form can be found &lt;a href=&quot;http://pyke.catbus.co.uk/dictionary&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;. It only works with words in it's dictionary and is lower case only without punctuation so it is rather limited in that way.&lt;/p&gt;&#xA;&lt;h3&gt;Easily testable&lt;/h3&gt;&#xA;&lt;p&gt;Pyke has a dedicated server hosting a testing website which can be found &lt;a href=&quot;http://pyke.catbus.co.uk/&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; and comes with documentation for every function callable. This documentation can be found in pure html form &lt;a href=&quot;http://pyke.catbus.co.uk/docs&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;. By default, any warnings and errors are shown to the user which can help creation of code. The website also comes with an auto-answer function which copies a pre-built header with character count and code as well as a &lt;a href=&quot;http://pyke.catbus.co.uk/code?code=%22Hello%20World%22&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it here!&lt;/a&gt; link.&lt;/p&gt;&#xA;&lt;p&gt;Pyke is a fun language, just like it's parent, Python. Unfortunately, Pyke doesn't have a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cheeseshop&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cheeseshop&amp;#39;&quot; rel=&quot;tag&quot;&gt;cheeseshop&lt;/a&gt; yet :(&lt;/p&gt;&#xA;&lt;p&gt;Pyke is available on &lt;a href=&quot;https://github.com/muddyfish/PYKE&quot; rel=&quot;nofollow noreferrer&quot;&gt;github&lt;/a&gt; under The MIT License (MIT).&lt;/p&gt;&#xA;" OwnerUserId="32686" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-21T16:00:04.407" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9637" PostTypeId="2" ParentId="2140" CreationDate="2016-07-21T18:51:34.400" Score="1" Body="&lt;h2&gt;Fix Pokemon Go's Servers &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As you may or may not be aware, Pokemon Go's servers have not fared well under the stress of the game's extreme popularity. As an amateur programmer, I'm in the sweet spot where I know just enough to &lt;em&gt;think&lt;/em&gt; I can solve all of their problems, but not enough to be able to understand how complex their problems actually are. Thus, I find myself constantly thinking &quot;Why didn't they just do &amp;lt;insert naive suggestion here&amp;gt;? It would fix everything!&quot; This challenge is focused on one of those probably-useless ideas I've thought up.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First, some very quick background, in case you haven't played the game (you can skip this paragraph if you have): In the course of gameplay, Pokemon can randomly appear at certain real-life locations. Every player in the same location sees the same Pokemon, and multiple players can catch one Pokemon.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One potential difficulty I see with this is storing all of that data. With millions of concurrent players, the game servers have to keep track of millions of Pokemon. That's a lot of IO for their database. Fortunately, I, a graduate of not one, but &lt;strong&gt;two&lt;/strong&gt; introductory CS courses, have a solution! Because player interactions have nothing to do with where and when Pokemon spawn, it is essentially deterministic. This means that it should be possible to drop the database entirely (at least for this one specific task), and replace it with a function! This function could take the player's location, the current system time, and a random seed as input, and return a list of all Pokemon within a certain radius. Because no database lookup is needed, this function would be lightning fast and easily scalable to millions of players.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to write this function. Obviously, the actual game of Pokemon has way too many details to make a feasible code challenge for PPCG, so here's the simplified guidelines:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Create a function that takes the following inputs, in any format you like:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Player location, as 2D coordinates &lt;/li&gt;&#xA;&lt;li&gt;System time&lt;/li&gt;&#xA;&lt;li&gt;Random seed&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The function should return a list of nearby Pokemon, with the following requirements:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&quot;Nearby&quot; means &quot;within one unit of distance of the player&quot;, where distance is 2d euclidean distance. (Just ignore the edge case where the location is on a round planet)&lt;/li&gt;&#xA;&lt;li&gt;Each Pokemon should have a species and an exact location&lt;/li&gt;&#xA;&lt;li&gt;This list can be in any format you want&lt;/li&gt;&#xA;&lt;li&gt;The results are deterministic (i.e., for the same location, time, and random seed, the same Pokemon are always returned)&lt;/li&gt;&#xA;&lt;li&gt;The Pokemon should persist for some pseudorandom amount of time&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Thus, if the function is called twice with the same location and random seed, and two times that are very close, then each Pokemon returned the first time should have a large possibility of being returned the second time&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;If the function is called twice with the same time and random seed, and two nearby locations, then any Pokemon that are near both locations should be returned both times&lt;/li&gt;&#xA;&lt;li&gt;The Pokemon should be somewhat evenly distributed across the &quot;world&quot; (the coordinate plane).&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The Pokemon should be distributed such that at any location and time, the probability of finding exactly &lt;code&gt;n&lt;/code&gt; nearby Pokemon of any type is &lt;code&gt;(0.5)^(n+1)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Thus, there is a 50% chance of finding no Pokemon at all, a 25% chance of finding exactly 1, a 12.5% chance of finding exactly two, etc.&lt;/li&gt;&#xA;&lt;li&gt;Your algorithm should be capable of returning up to 10 nearby Pokemon, but is allowed to return more, as long as it follows the right probability distribution&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Sandbox question: I want a requirement to be that the algorithm can't simply generate all of the Pokemon in the world and then just return the nearby ones, but I don't know how to formally state this. I had some fleeting thoughts about O(1) memory usage, but that method could strictly speaking have O(1) memory usage if the world is a constant size (which I'm pretty sure it is).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Might this make a good &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenge? That would fit in with the premise, and might produce some interesting algorithms.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the sake of making this challenge somewhat reasonable, the list of possible Pokemon and their probabilities of appearing will be small:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Weedle: 60%&lt;/li&gt;&#xA;&lt;li&gt;Charmander: 30%&lt;/li&gt;&#xA;&lt;li&gt;Blastoise: 10%&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is part of what I need help with in the sandbox. How should I distinguish two entries that both meet all of the requirements?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Thanks for reading this far! I know this question isn't nearly ready to be a real challenge. At the very least, it need more specific requirements. But I figured I'd post what I currently have in the sandbox to see if it's worth continuing with. I've never posted or participated in a PPCG challenge before, and I'm sure that's obvious, but hopefully with your help, I can refine this to the point of being a legitimate challenge.&lt;/p&gt;&#xA;" OwnerUserId="56643" LastEditorUserId="56643" LastEditDate="2016-07-22T21:52:29.127" LastActivityDate="2016-07-22T21:52:29.127" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9640" PostTypeId="2" ParentId="2140" CreationDate="2016-07-21T23:05:37.680" Score="0" Body="&lt;h2&gt;Reverse stdin to stdout, Unicode aware and by grapheme clusters&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It's 2016. High time that we were Unicode-aware, don't you think?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a UTF-8 string on stdin, reverse it by extended grapheme clusters (as defined by the Unicode consortium; this can be found &lt;a href=&quot;http://www.unicode.org/reports/tr29/#Grapheme_Cluster_Boundaries&quot; rel=&quot;nofollow&quot;&gt;here&lt;/a&gt;, for instance) and place it on stdout. This is seemingly a trivial challenge, but surprisingly difficult in many languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may not use an explicit end-of-file character - if supported, use EOF. If not supported, use an explicit length at the start of the string, and document the format.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that the string may be of any length (barring RAM limitations).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must handle direction override characters &quot;properly&quot;, in the sense that the directionality of every character must remain the same after reversing the string.&lt;/p&gt;&#xA;" OwnerUserId="32910" LastEditorUserId="32910" LastEditDate="2016-07-22T01:19:36.587" LastActivityDate="2016-07-22T01:19:36.587" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9641" PostTypeId="1" CreationDate="2016-07-22T05:03:55.227" Score="2" ViewCount="171" Body="&lt;p&gt;What do people think about defining the encoding of a character in a given language as taking place in less than a byte?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, take Brainfuck. Brainfuck has exactly 8 possibilities per character, (&lt;code&gt;+&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;, &lt;code&gt;[&lt;/code&gt;, &lt;code&gt;]&lt;/code&gt;, &lt;code&gt;&amp;gt;&lt;/code&gt;, &lt;code&gt;&amp;lt;&lt;/code&gt;, &lt;code&gt;.&lt;/code&gt;, &lt;code&gt;,&lt;/code&gt;), so each character can be easily encoded into 3 bits. Given that, would it be valid to count the best Brainfuck Hello World program, &lt;a href=&quot;https://codegolf.stackexchange.com/a/7256/20080&quot;&gt;here&lt;/a&gt;, which is 78 characters, as 78 * 3 = 234 bits = 29.25 bytes?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This already seems to be accepted practice for at least one language, namely &lt;a href=&quot;https://codegolf.stackexchange.com/a/7256/20080&quot;&gt;Binary Lambda Calculus&lt;/a&gt;, and there hasn't been much if any pushback over its use.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, this is also applicable to ASCII-only languages (e.g. most of them), where for almost all programs, characters can be encoded in 7 bits.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I personally think that defining character encodings in bits rather than bytes should be fine. What are other opinions?&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.113" LastActivityDate="2016-07-22T05:03:55.227" Title="Sub-byte character encodings" Tags="|discussion|code-golf|characters|" AnswerCount="0" CommentCount="10" ClosedDate="2016-07-22T16:16:02.760" ContentLicense="CC BY-SA 3.0" />
  <row Id="9642" PostTypeId="2" ParentId="9619" CreationDate="2016-07-22T06:03:50.780" Score="12" Body="&lt;h2&gt;JavaScript ES6&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Hearing &quot;JavaScript&quot; you may think:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Uck that language with the weird type system?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;and that's one of the reasons it's so enjoyable and great to golf in!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why ES6? Well the days of &lt;code&gt;function(){return arguments}&lt;/code&gt; are over. ES6 is the latest version of JavaScript looking to give the language a make-over to better suit the growing demands of web development. This brings to the wide assortment of features in JavaScript to make it enjoyable to golf in!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Type Casting&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is both a beautiful and horrible thing JavaScript does but when you're code-golfing it's the best. In most language's to add two strings you'd do something along the lines of:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(Number::a)+(Number::b)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;but in JavaScript you can just abuse the type casting!&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a- -b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;what? Well if we used &lt;code&gt;+&lt;/code&gt; it would think we're joining the strings so in JavaScript when we use &lt;code&gt;-&lt;/code&gt;, it essentially &quot;forces&quot; it into using &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; are numbers.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Arrow functions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Again, these are a feature that make ES6 much more competitive in golfing. Compare the two:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function(a,b){return a+b}&#xA;a=&amp;gt;b=&amp;gt;a+b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The latter is a ES6 arrow function. Which support all sorts of &lt;s&gt;ab&lt;/s&gt;use:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(a,b=a/2|0)=&amp;gt;(a+b)/b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You can use the weak typing of JavaScript to your advantage, use default function parameters to shorten variable declarations.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Destructuring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Lemme give you one of my &lt;a href=&quot;https://codegolf.stackexchange.com/a/54461/40695&quot;&gt;favorite answers&lt;/a&gt; as an example, it's very well golfed thanks to destructuring:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(a,z,d,f=([a,g,k,p])=&amp;gt;g*k*(a[6]?p/-~!a[8]:3.14*g))=&amp;gt;Math.ceil(f(a)/f(z))*d&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;To avoid constantly referencing an array using &lt;code&gt;[n]&lt;/code&gt; which would result in a large use of bytes. You can use array destructuring in argument params to extract the the first n items of an array to variables&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;JavaScript is golfed&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'd say they are more avid JavaScript golfers than any other non-esolang (I'm not talking about just PPCG) as JavaScript is one of the few languages commonly golfed for production. They are so many resources on golfing in JavaScript, our tips post has pages detailing how to abuse its typing system. All this makes it an easy language to start golfing in&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;No need for imports&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In many language you probably see &lt;code&gt;import &amp;lt;whatever&amp;gt;&lt;/code&gt; a lot, but due to JS's lack of a module system everything is already there! This includes the &lt;code&gt;Math&lt;/code&gt; namespace and the build-in compression (it's not a compression function, it's just base64 but we &lt;s&gt;ab&lt;/s&gt;use it for compression) function. While you may not use, for example, the image built-ins all too much, you don't have wasted bytes on &lt;code&gt;import&lt;/code&gt;s&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Spread operator&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is up with the top 5 most useful ES5 features. It'll take a bit to explain so I'll give examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(...args) =&amp;gt; args.map(arg =&amp;gt; arg + 1)&#xA;// f(1,2,3) -&amp;gt; [2,3,4]&#xA;&#xA;[...&quot;&quot;] -&amp;gt; [&quot;&quot;, &quot;&quot;, &quot;&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You can abuse this for range creation: &lt;code&gt;[...Array(n)]&lt;/code&gt; and all sorts of things. It can be used for hacky string reversing:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;s =&amp;gt; [s,...s].reverse().join``&#xA;// f(&quot;hi&quot;) -&amp;gt; ihhi&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;What's going on here? Well this uses the spread operator to &quot;split&quot; the string. It does the same as:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;s+s.split(&quot;&quot;).reverse().join(&quot;&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Template strings&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;These are too cool for words:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;`first&#xA;second line&#xA;${1+1+1}rd line`&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;These allow inline newlines and formatting. The coolest part? You can omit parenthesis when using them (sort of) e.g.:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1,2,3].join`a` -&amp;gt; &quot;1a2a3a&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Eval&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Eval abuse is best shown, not tell (and because I'm getting tired of writing):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(n,m)=&amp;gt;eval(&quot;for(o='',q=(b,s)=&amp;gt;' #'[z&amp;lt;b|0].repeat(b)+(z?'   ':s),z=i=Math.hypot(n,m);z--;)o+=q(n,' + ')+q(m,' = ')+q(i,'')+`\n`&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;eval&lt;/code&gt; is like running a code in the REPL. it'll implicitly return the last result. You can write a multi-line function but that requires a return which is a large use of bytes. By using eval you can use fors but still avoid having to use { ... } and return&lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-07-26T17:12:13.670" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9644" PostTypeId="1" AcceptedAnswerId="9645" CreationDate="2016-07-22T15:19:29.440" Score="2" ViewCount="78" Body="&lt;p&gt;I accidentally created the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tex&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tex&amp;#39;&quot; rel=&quot;tag&quot;&gt;tex&lt;/a&gt;. I untagged my question, so it now has &lt;code&gt;0&lt;/code&gt; questions. Can we kill it with fire?&lt;/p&gt;&#xA;" OwnerUserId="48922" LastActivityDate="2016-07-22T15:20:47.860" Title="Let's golf our [TeX]" Tags="|discussion|tags|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9645" PostTypeId="2" ParentId="9644" CreationDate="2016-07-22T15:20:47.860" Score="8" Body="&lt;p&gt;There's no need to do that. Unused tags are regularly removed automatically.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-07-22T15:20:47.860" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9646" PostTypeId="1" CreationDate="2016-07-22T17:14:28.230" Score="12" ViewCount="686" Body="&lt;p&gt;Lego WeDo is a programming language meant for children, used to play with some simple Lego robotics.  It's a visual drag-and-drop language.  Here is a screenshot of a divisibility tester written in the language:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Cx2kq.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Cx2kq.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's a lot of &quot;blocks&quot; that can do various things, like writing a number to the screen and performing some super-basic arithmetic with that number.  Language quirks include non-nestable loops and support for multi-threading.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;How I/O is handled&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The only way to handle I/O effectively, as far as I can tell, is to manually type the input numbers into specific text boxes on the screen.  For example, &quot;15&quot; and &quot;5&quot; are the inputs to the divisibility program above.  Output is simple: it's the number that's on the screen after the program is finished.  Above, the output is &lt;code&gt;1&lt;/code&gt; because 15 is divisible by 5.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A secondary question I have is, since there's not a formal distinction between input values (the 15 and 5) and other hardwired numbers (the -1 and 1), does this actually count as &quot;taking input&quot;?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This language is almost entirely visual with the exception of the extra parameters that can be assigned to a block (the numbers in the program above). So the question is, how should I score it?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think there's a couple options...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Come up with some terse description to represent a program... like each block counts as X bytes with literal numbers/text counting 1 byte per character.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Look at the raw file size.  The above program, when saved to a file, counts as 856 bytes.  It contains a lot of additional information, like 2D position of the blocks, what operating system I'm using, etc.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Here is the source file:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   x   d  L     Â  }      Start                               Display      Display   GlowBot    Text Plug      Text   15   Number   1   IsNumber   False   Platform   &#xA;Windows NT                   While      Count   Inf   Snippet   1   Display Plug                       Display Divide      Display   GlowBot   Display Plug                       Display Multiply      Display   GlowBot       Text Plug      Number   -1   Number   1   IsNumber   False   Platform   &#xA;Windows NT                   Display Add      Display   GlowBot     Text Plug      Text   1   Number   1   IsNumber   False   Platform   &#xA;Windows NT                   X  }      Display Subtract      Display   GlowBot      Text Plug      Number   5   Number   1   IsNumber   False   Platform   &#xA;Windows NT                        &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2016-08-03T17:31:28.220" Title="How to score the Lego WeDo programming language?" Tags="|discussion|" AnswerCount="5" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9647" PostTypeId="2" ParentId="9646" CreationDate="2016-07-22T19:10:12.553" Score="5" Body="&lt;h2&gt;Count bytes in the file&lt;/h2&gt;&#xA;&lt;p&gt;This is the standard method of scoring programs. Special methods to count bytes are only needed if there is not a simple way to count the bytes of the program's file (like Minecraft not having a native file format until recently).&lt;/p&gt;&#xA;&lt;p&gt;If you feel that the file format is not representative of the actual program size, you can always create a compressed/golfed version of the language. Also keep in mind that comparisons across languages are mostly meaningless - don't be upset if your language's programs aren't shorter than another language's programs.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-23T19:45:33.500" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9648" PostTypeId="2" ParentId="2140" CreationDate="2016-07-22T21:14:21.190" Score="2" Body="&lt;h2&gt;Reversing the Game of Life&lt;/h2&gt;&#xA;&lt;p&gt;Though computing successive generations of &lt;a href=&quot;https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life&quot; rel=&quot;nofollow noreferrer&quot;&gt;Conway's Game of Life&lt;/a&gt; may seem simple enough, reversing the process is not.&lt;/p&gt;&#xA;&lt;p&gt;Given an initial board configuration in Conway's Game of Life, either return a predecessor, or some value indicating that it is a &lt;a href=&quot;http://conwaylife.com/wiki/Garden_of_Eden&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;Garden of Eden&lt;/em&gt;&lt;/a&gt; (and therefore contains an &lt;em&gt;orphan&lt;/em&gt;), meaning it has no predecessor. A &lt;em&gt;predecessor&lt;/em&gt; is a previous generation of a board configuration, meaning that after running the game for a some number of generations, you will arrive at the successor generation, the board configuration that you were initially given.&lt;/p&gt;&#xA;&lt;p&gt;Any given configuration may have zero or more predecessors. Some have infinitely many, such as still life patterns.&lt;/p&gt;&#xA;&lt;p&gt;It will probably be simplest to find a &lt;em&gt;parent&lt;/em&gt;, a predecessor configuration from the preceding generation, such that reaching the successor takes one generation.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/tC9tz.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/tC9tz.png&quot; alt=&quot;Two parents of the Block&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;If given a state bounded by a 6x6 rectangle, for example, a parent (if any) will be found by searching the 8x8 rectangle around it. &lt;strong&gt;This is a fastest-code challenge&lt;/strong&gt;, since brute force solutions would take a long time, even for relatively small inputs.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;All Game of Life patterns bounded by a 6x6 rectangle have a predecessor. &lt;sup&gt;&lt;a href=&quot;http://wwwhomes.uni-bielefeld.de/achim/orphan.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Source&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example Input&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Input can be how you like. If you prefer a list of active points, or a matrix of Booleans, that's fine. Just make your output be the same format.&lt;/p&gt;&#xA;&lt;p&gt;This input represents a block:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/9OlfK.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/9OlfK.png&quot; alt=&quot;Block still life&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[(1, 1), (1, 2), (2, 1), (2, 2)]&#xA;&#xA;[[1,1],&#xA; [1,1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The original Garden of Eden:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/zVOv1.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/zVOv1.png&quot; alt=&quot;Garden of Eden&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;All cells outside the image are dead (white).&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a parent to the block.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[1,0,0,1],&#xA; [0,1,1,0]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Garden of Eden:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;No predecessor&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;Resources:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://golly.sourceforge.net/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Golly Game of Life Home Page&lt;/a&gt; - A powerful implementation of the game&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://wwwhomes.uni-bielefeld.de/achim/orphan.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Garden of Eden / Orphan&lt;/a&gt; - History&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Garden_of_Eden_(cellular_automaton)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Garden of Eden (cellular automaton)&lt;/a&gt; - Wikipedia: Info on orphans&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://nbickford.wordpress.com/2012/04/15/reversing-the-game-of-life-for-fun-and-profit/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Reversing the Game of Life for Fun and Profit&lt;/a&gt; - &lt;strong&gt;Algorithms&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game-of-life&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game-of-life&amp;#39;&quot; rel=&quot;tag&quot;&gt;game-of-life&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-25T21:09:33.240" CommentCount="18" ContentLicense="CC BY-SA 3.0" />
  <row Id="9649" PostTypeId="2" ParentId="9619" CreationDate="2016-07-22T21:30:58.440" Score="3" Body="&lt;h2&gt;Convex&lt;/h2&gt;&#xA;&lt;p&gt;Convex is, like many other golfing languages, stack-based. In my personal experience, stack-based languages are much easier to learn and easier to understand than others too. Convex is heavily inspired by languages like Jelly and 05AB1E, and built on top of the CJam platform. In fact, 99% of CJam programs are also valid Convex programs. However, here are the main things that make Convex stick out from the rest:&lt;/p&gt;&#xA;&lt;h3&gt;Convex is competitive&lt;/h3&gt;&#xA;&lt;p&gt;Currenty, all &lt;em&gt;common&lt;/em&gt; operators are only one byte, and I am currenty in the process of making &lt;em&gt;all&lt;/em&gt; operators are one byte. In addition, it has many operators that can prove to be very useful in golfing challenges. Most of the operators are overloaded as well, which allows me to add many more than just 255 operators.&lt;/p&gt;&#xA;&lt;h3&gt;Convex has neat features&lt;/h3&gt;&#xA;&lt;p&gt;Convex has many features that most other languages don't, such as...&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;strong&gt;Full Regex Support&lt;/strong&gt;:&#xA;All of the more common regex operators are avaliable, as well as some uncommon ones. Convex also has some neat features for building regexes, including turning all strings in a list into a &lt;code&gt;a|b|c|d&lt;/code&gt; regex and more.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Complex Number and Quaternion Support&lt;/strong&gt;:&#xA;Convex has a built in Quaternion type, which allows both complex numbers and quaternions to be represented easily and flawlessly.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Implicit input&lt;/strong&gt;:&#xA;Any input passes to the command-line arguments while running a convex program is automatically put on the stack for you. In addition, when an operator tries to pop from an empty stack it will simply read a line of input from STDIN. In both cases, the input is evaluated if possible so you don't need to convert from strings to ints in the program.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Convex is Still Being Developed&lt;/h3&gt;&#xA;&lt;p&gt;I work on Convex everyday and always have the latest version avaliable on Github. Additionally, I am currenty porting Convex to Python (whereas it is now written in Java) which allows me to more easily add operators and allows others to easily contribute as well. Here are some features to look forward to:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Infinite precision maths.&lt;/li&gt;&#xA;&lt;li&gt;File IO, HTTP requests, and a Python eval operator. Note that there is also a safe mode that disables these operators.&lt;/li&gt;&#xA;&lt;li&gt;No two-char operators.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Want to Get Started?&lt;/h2&gt;&#xA;&lt;p&gt;Here are some useful links:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://chat.stackexchange.com/rooms/42898/convex&quot;&gt;Convex chat room&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.github.com/gamrcorps/convex&quot; rel=&quot;nofollow noreferrer&quot;&gt;Convex GitHub&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.github.com/gamrcorps/convexpy&quot; rel=&quot;nofollow noreferrer&quot;&gt;ConvexPy GitHub&lt;/a&gt; (GitHub for newest version written in Python)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://convex.tryitonline.net&quot; rel=&quot;nofollow noreferrer&quot;&gt;Official Online Interpreter&lt;/a&gt; (Provided by @Dennis)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="36670" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-22T21:30:58.440" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9650" PostTypeId="2" ParentId="2140" CreationDate="2016-07-22T22:27:39.030" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Difficulty Naming&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In the game &lt;em&gt;osu!&lt;/em&gt;, players can make their own beatmaps (levels). The harder the beatmap is, the bigger the &lt;em&gt;star rating&lt;/em&gt; will be.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Beatmaps have star icons with different colors and letters according to their &lt;em&gt;star rating&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;osu!&lt;/em&gt; has also four game modes. The shape of the icon will change depending on the game mode.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a star rating and a gamemode, output the (generally used) difficulty name.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Input&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A positive floating-point number (star rating)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can assume the number will never have more than two decimal places.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;A positive integer (game mode)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1 is &lt;em&gt;Standard&lt;/em&gt;, 2 is &lt;em&gt;Taiko&lt;/em&gt;, 3 is &lt;em&gt;Catch the Beat&lt;/em&gt; and 4 is &lt;em&gt;Mania&lt;/em&gt; (you can use other numbers for the game modes, these are the default.)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;The Output&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A string (difficulty name)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Use this table to determine the output:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://image.prntscr.com/image/174e34e56dbb40ad81b209fac3fdc5bc.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;diff table http://image.prntscr.com/image/174e34e56dbb40ad81b209fac3fdc5bc.png&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(if the star rating is exactly 5.25, it counts as &lt;em&gt;Above 5.25&lt;/em&gt;)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest solution wins.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are disallowed.&lt;/li&gt;&#xA;&lt;li&gt;You can take the input either as an array/list, a string separated by commas or spaces, or each number individually.&lt;/li&gt;&#xA;&lt;li&gt;Again, you can use other numbers for the game modes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2.24, 2 ---&amp;gt; Futsuu&#xA;1.1, 4 ---&amp;gt; Basic&#xA;3.14, 1 ---&amp;gt; Hard&#xA;7.0, 3 ---&amp;gt; Overdose&#xA;5.0, 4 ---&amp;gt; Exhaust&#xA;31415.0, 2 ---&amp;gt; Ura Oni&#xA;0.01, 1 ---&amp;gt; Easy&#xA;5.25, 1 ---&amp;gt; Expert&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you see any grammar errors or anything like that, please tell me, I'm not a native speaker.&lt;/p&gt;&#xA;" OwnerUserId="56258" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-07-23T23:42:00.613" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9652" PostTypeId="2" ParentId="2140" CreationDate="2016-07-23T14:45:36.787" Score="1" Body="&lt;h1&gt;Punch Buggy Probabilities&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;A popular game among children in the USA is &amp;quot;punch buggy&amp;quot;, and as with every such game, there are many variations. The one we'll consider for this challenge goes like this:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The moment anyone sees a &lt;a href=&quot;https://en.wikipedia.org/wiki/Volkswagen_Beetle&quot; rel=&quot;nofollow noreferrer&quot;&gt;Volkswagon Beetle&lt;/a&gt; (the &amp;quot;buggy&amp;quot;), participants may punch each other (&lt;em&gt;usually&lt;/em&gt; in the shoulder or upper arm).&lt;/li&gt;&#xA;&lt;li&gt;A punch must be accompanied by &amp;quot;punch buggy &amp;lt;color&amp;gt;!&amp;quot;, where &amp;lt;color&amp;gt; is the color of the VW Beetle (red, green, black, gray, yellow, etc.).&lt;/li&gt;&#xA;&lt;li&gt;Whoever makes contact first gets priority (and for this challenge, there are no ties).&lt;/li&gt;&#xA;&lt;li&gt;Once person A punches person B, B cannot punch A back (usually accomplished by saying &amp;quot;no punch back!&amp;quot;).&lt;/li&gt;&#xA;&lt;li&gt;Punches may occur between any pair of participants (for this challenge, &lt;em&gt;every&lt;/em&gt; pair of participants).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;Assuming all possible punching configurations among &lt;code&gt;n&lt;/code&gt; people are equally likely to happen, what is the probability of any particular punching configuration? To put it another way, for each &lt;em&gt;distinct&lt;/em&gt; punching configuration, how many ways can it occur?&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input is a single positive integer greater than 1.&lt;/li&gt;&#xA;&lt;li&gt;Output must be one of the following: A) a list of decimals, B) a list of fractions (simplified or not), or C) a list of counts. &lt;strong&gt;META:&lt;/strong&gt; Should I allow these lists to be unordered, or should I require that they be associated with punching configurations somehow? I'm leaning towards the former since it seems like it'd be a headache to figure out how to specify the latter &lt;em&gt;and&lt;/em&gt; it would likely be an extra task that doesn't really have anything to do with the core problem.&lt;/li&gt;&#xA;&lt;li&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply, and standard loopholes are banned.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input&#xA;Output A&#xA;Output B&#xA;Output C&#xA;&#xA;2&#xA;1.0&#xA;2/2&#xA;2&#xA;&#xA;3&#xA;0.75 0.25&#xA;3/4 1/4&#xA;3 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Explanation of input 2:&lt;/strong&gt; With only two people, there are exactly two possible ways: either A punches B or B punches A. These are equivalent, so the probability is 1.0, the fraction is 2/2, and the count is 2.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Explanation of input 3:&lt;/strong&gt; There are two distinct punching configurations: A -&amp;gt; B -&amp;gt; C, A -&amp;gt; C; A -&amp;gt; B -&amp;gt; C -&amp;gt; A. The latter has only two varieties (the other is A -&amp;gt; C -&amp;gt; B -&amp;gt; A) and the former has six, since there are three choices for the person who punches two others and then two choices for the remaining pair. Thus, the probabilities are 0.75 and 0.25, the fractions are 3/4 and 1/4, and the counts are 3 and 1.&lt;/p&gt;&#xA;&lt;h2&gt;META&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I want to add &lt;code&gt;4&lt;/code&gt; to the test cases, and I think I'm gonna need help on it since I'm having a hard time counting all 2^6 = 64 possibilities correctly.&lt;/li&gt;&#xA;&lt;li&gt;Any clarifications/corrections?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12914" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-23T14:45:36.787" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9653" PostTypeId="2" ParentId="2140" CreationDate="2016-07-23T18:50:31.897" Score="2" Body="&lt;h1&gt;Lets play Stratego!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Stratego is a game of imperfect information which centers around strategy foresight and deception. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Stratego&quot; rel=&quot;nofollow&quot;&gt;https://en.wikipedia.org/wiki/Stratego&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your mission should you choose to accept it. is to write a bot which either uses polymorphism in a java class file, and/or communicate with the arena via an stdin/stdout wrapper.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The arena code and/or stdin out wrapper will be made available if there is interest. Here is the summary. &lt;/p&gt;&#xA;&#xA;&lt;hr /&gt;&#xA;&#xA;&lt;h2&gt;Piece Summary&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;? = Unkown enemy piece&#xA;lowercase characters = your pieces&#xA;Upper case or special characters (!@#$%^&amp;amp;*()) or F B is the enemy pieces&#xA;f or F represents an immobile flag if the enemy moves on to this square it is game over.&#xA;b or B represents an immobile if any hostile piece steps on to it then it dies. If an enemy miner (8) steps on it will succesfully defuse or capture the bomb.&#xA;s or S gets killed when attacked by any piece, but can kill the 10 by stepping on it.&#xA;9 or ) can move any number of squares orthagonally.&#xA;Otherwise all pieces can capture pieces with a higher number than themselves. I.E 1 captures two which captures three which captures a 4 which captures a five etc...&#xA;When you attack a piece, the values of both pieces are revealed (thus the enemy will no longer see a &quot;?&quot;) If the attacking piece is stronger it takes the spot, if it is weaker, it dies and the defender remains unharmed, and if they are equal both disappear. &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Spaces empty are indicated with a space. Spaces with an impassable lake are indicated with an L. The wikipedia article has some great sample strategies and explanations. The protocol for communication will involve Outputting four zero indexed coordinates for the start and end locations of a piece. Invalid moves will simply result in no action taken. &lt;/p&gt;&#xA;" OwnerUserId="46918" LastActivityDate="2016-07-23T18:50:31.897" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="9657" PostTypeId="2" ParentId="2140" CreationDate="2016-07-24T19:38:54.510" Score="0" Body="&lt;h1&gt;Grow and Visualize Decision Tree&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;META: work in progress...&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Would providing the points as an image instead of a list of coordinates simplify the challenge?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graph-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graph-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;graph-theory&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/machine-learning&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;machine-learning&amp;#39;&quot; rel=&quot;tag&quot;&gt;machine-learning&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given two sets of points in the plane with coordinates &lt;code&gt;x,y&lt;/code&gt;, both in &lt;code&gt;[0,1)&lt;/code&gt;, grow a (binary) decision tree as specified below and output a square pixel image of a given size, that visualizes the corresponding tree.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;How to grow the tree&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The we call the two sets here &lt;em&gt;classes&lt;/em&gt; and follow the following recursive approach:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;If at least one of the classes is empty, label the current node as a leaf of the nonempty class and stop. Otherwise:&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;First find the mean of each of the x (or y)-coordinates of each of the two classes, and find the mean/center &lt;code&gt;c&lt;/code&gt; of those two means. Then we partition both classes as follows: All points with an x (or y)-coordinate strictly smaller than &lt;code&gt;c&lt;/code&gt; belong to &lt;em&gt;one&lt;/em&gt; half, all the other ones to the other half. The we set the current node to the decision &lt;code&gt;is the x-cooridinate (or y-coordinate) less than c?&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For each of the halves, go back to step 1 and 2, and set the resulting nodes as the child nodes from the current node. If you previously considered the x-coordinates, then consider y-coordinates and vice versa.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/h90b8.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/h90b8.gif&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;How to visualize the tree&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;We partition the the unit interval &lt;code&gt;[0,1)&lt;/code&gt; into &lt;code&gt;N&lt;/code&gt; equidistant sub intervals &lt;code&gt;[0,1/N), [1/N,2/N), [2/N,3/N)...&lt;/code&gt; and correspondingly the unit square &lt;code&gt;[0,1)x[0,1)&lt;/code&gt; into squares &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[i/N,(i+1)/N)x[j/N,(j+1)/N) for i,j=0,1,2,...,N-1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which later will be represented by a pixel. For each square &lt;code&gt;[i/N,(i+1)/N)x[j/N,(j+1)/N)&lt;/code&gt; we classify the point &lt;code&gt;i/N,j/N&lt;/code&gt; with the tree we just grew and colour the corresponding pixel with the corresponding colour.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the example above the output would look like so:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/xAEAG.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/xAEAG.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input: An integer&lt;code&gt;N&amp;gt;5&lt;/code&gt; and two sets of points in any convenient format (e.g. as two separate list of points, or as a single list with a label for each point etc.) You can assume that in total there is at least one point.&lt;/li&gt;&#xA;&lt;li&gt;Output: A pixel image (vector images composed of squares are ok too) of the visualization. &#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You have to choose any two distinct colours, I recommend blue and red.&lt;/li&gt;&#xA;&lt;li&gt;The x-axis should point to the right, the y-axis can point in any direction.&lt;/li&gt;&#xA;&lt;li&gt;The submission should display the image on the screen or save it to a file (like jpg/png/tiff or similar formats)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2016-07-25T21:53:59.633" LastActivityDate="2016-07-25T21:53:59.633" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9658" PostTypeId="2" ParentId="8871" CreationDate="2016-07-24T21:15:44.493" Score="8" Body="&lt;h1&gt;Yes, you can choose the output.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In fact, this is already what we do.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A full program that prints to STDOUT will also terminate with a certain exit code, and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5330/12012&quot;&gt;exit codes are a valid form of output&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Per consensus, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4781/12012&quot;&gt;programs are allowed to terminate with an error&lt;/a&gt; after producing the correct output, so we're ignoring the exit code here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We also allow C programs which do not include &lt;code&gt;return 0&lt;/code&gt; at the end. This is undefined behavior in C89, so the exit code could literally be anything.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;We allow a function to print the output to STDOUT, since &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2457/12012&quot;&gt;it may output via the same methods as full programs&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In many languages, the function will also have a return value. We ignore the return value of the function in this case.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;At this moment, the proposal of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2451/12012&quot;&gt;printing output to STDERR&lt;/a&gt; has a positive score, yet &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4781/12012&quot;&gt;STDERR is ignored by default&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4942/12012&quot;&gt;Functions may output by modifying their arguments&lt;/a&gt;, but if we print or return the desired result, we do not have to leave the arguments in a specific state.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Trying to specify which kinds of output can be ignored and which cannot seems artificial and will probably be ambiguous.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I therefore propose that we can liberally choose a single output format and ignore any results or side effects that could alternatively be chosen as output, with the following restriction.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output format should be consistent for all possible inputs and every time the program/function is executed. The function&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def primality_test(integer):&#xA;    print True&#xA;    return False&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;correctly prints &lt;em&gt;True&lt;/em&gt; for primes and correctly returns &lt;em&gt;False&lt;/em&gt; for non-primes, but it obviously should &lt;em&gt;not&lt;/em&gt; be considered a valid submission to a challenge.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2016-07-24T21:15:44.493" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9659" PostTypeId="2" ParentId="6918" CreationDate="2016-07-24T23:52:18.187" Score="4" Body="&lt;h1&gt;S.I.L.O.S&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;S.I.L.O.S is a language I created with some loose inspiration (retrospectively) from Trump Script.&#xA;&lt;hr /&gt;&#xA;S.I.L.O.S &quot;Features&quot;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&#xA;&lt;b&gt;Arrogance &lt;/b&gt;S.I.L.O.S is an arrogant name as it stands for.&lt;ul&gt;&lt;li&gt;Superb&lt;/li&gt;&lt;li&gt;Interpreted&lt;/li&gt;&lt;li&gt;Language's&lt;/li&gt;&lt;li&gt;Obviously&lt;/li&gt;&lt;li&gt;Superior&lt;/li&gt;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;All of the slowness of the JVM with all of the challenge of assembly&lt;/li&gt;&#xA;&lt;li&gt;Limited error messages with a default behavior of on error resume text&lt;/li&gt;&#xA;&lt;li&gt;Readable while remaining a turing complete minimalistic language&lt;/li&gt;&#xA;&lt;li&gt;Numbers can be used as variable names&lt;/li&gt;&#xA;&lt;li&gt;No declaration needed of variables&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;In short S.I.L.O.S is clearly the language of the future and ought to provide speedy development. Feel free to take a look at the GitHub here.&#xA;&lt;hr/&gt;&#xA;&lt;a href=&quot;https://github.com/rjhunjhunwala/S.I.L.O.S&quot; rel=&quot;nofollow&quot;&gt;https://github.com/rjhunjhunwala/S.I.L.O.S&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="46918" LastActivityDate="2016-07-24T23:52:18.187" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9661" PostTypeId="2" ParentId="9590" CreationDate="2016-07-25T01:57:04.513" Score="6" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;[R]ather than try to do some frankenscore of the program size and the compression size with some arcane mixing rule, a la the LZMA question, I just made the scoring all about the JPEG. Maybe if I phrased it &quot;you need to generate the JPEG with code&quot;, it would be &quot;about programming&quot;, but really, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/6983/why-i-am-leaving-code-golf&quot;&gt;I don't care about saving bytes with esolang XYZ&lt;/a&gt;, and there are &lt;em&gt;plenty&lt;/em&gt; of other challenges for that.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Your scoring method is not what jeopardizes the &quot;ontopicness&quot; of your question. We have a lot of challenges that aren't scored by the byte count or some other metric that isn't related to the functionality of the submitted programs. Scoring a program by how well the image it generated can be compressed is perfectly fine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So why was your question closed in the first place?&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If you used some code to carefully craft the JPEG, please post it along with the image.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That implies that we do not actually have to generate the image with a program. I can take a picture with my phone, scan one of my daughter's drawings, use some photo manipulation software to create a random image, browse the Internet for noise images, etc., all of which are completely unrelated to programming.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Granted, it's unlikely that the first two approaches would result in a competitive entry; I'm actually not convinced that &lt;em&gt;any&lt;/em&gt; approach would stand a chance against pseudo-randomly selecting the pixels with a uniform distribution. The latter two might stand a chance though, and &lt;strong&gt;submissions that consist of nothing more than a swirl of pixels are neither related to programming nor interesting&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, regardless of what the community ends up deciding, why not circumvent the whole problem and make submitting the code that generated the image &lt;em&gt;mandatory&lt;/em&gt;? That can't possibly affect the challenge in a negative way, and nobody will be able to argue that it's off-topic. &lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2016-07-25T01:57:04.513" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9663" PostTypeId="2" ParentId="9619" CreationDate="2016-07-25T16:18:01.917" Score="8" Body="&lt;h1&gt;Python&lt;/h1&gt;&#xA;&lt;p&gt;Python is one of my favorite languages to use on this site. There are a few reasons for this:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;1. Easy to learn&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Python is verbose enough that you can often tell what a program does at a glance.&lt;/li&gt;&#xA;&lt;li&gt;Documentation is &lt;a href=&quot;https://docs.python.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;readily available&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;It's a popular language (&lt;a href=&quot;http://www.tiobe.com/tiobe_index?page=Python&quot; rel=&quot;nofollow noreferrer&quot;&gt;currently 4th on the TIOBE index&lt;/a&gt;), so there are many tutorials and tips available for new users. Since it's also useful in the real world, you may benefit from learning the language. List it on your resume!&lt;/li&gt;&#xA;&lt;li&gt;There are many useful questions and answers for Python on &lt;a href=&quot;https://stackoverflow.com/questions/tagged/python?sort=votes&amp;amp;pageSize=50&quot;&gt;StackOverflow&lt;/a&gt;, and you can always ask a new question if you can't find what you need.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;2. Popular to golf in&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is a popular choice on this site, meaning that many users know it and will often give helpful suggestions to golf or otherwise improve your answer.&lt;/li&gt;&#xA;&lt;li&gt;There is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/54/tips-for-golfing-in-python?s=1%7C1.0930&quot;&gt;tips page&lt;/a&gt;, and it is the highest rated of any tips page on the site.&lt;/li&gt;&#xA;&lt;li&gt;There is more intra-language competition than average, driving users to constantly improve their Python-golfing skills.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;3. Useful features&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Multiple methods of taking input. You can answer with functions and taking input as a parameter. You can use &lt;code&gt;input()&lt;/code&gt; in Python 2 to automatically &lt;code&gt;eval&lt;/code&gt; input.&lt;/li&gt;&#xA;&lt;li&gt;Variables are not type-restricted, and Python is not super strict about types. This means that you can use a variable as a string, then later convert it to a list and store it in the same variable.&lt;/li&gt;&#xA;&lt;li&gt;Strings work a lot like lists. Both strings and lists can be sliced like &lt;code&gt;object[start:end:step]&lt;/code&gt;, so printing every 2nd character is as simple as &lt;code&gt;s[::2]&lt;/code&gt;, and reversing is &lt;code&gt;s[::-1]&lt;/code&gt;. You can also multiply a string by an integer to repeat the string, so &lt;code&gt;3*&amp;quot;hi&amp;quot; == &amp;quot;hihihi&amp;quot;&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;4. Resources and interpreters&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.python.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Python.org&lt;/a&gt; - Downloads, tutorials, documentation, updates, and jobs&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://repl.it/languages/Python&quot; rel=&quot;nofollow noreferrer&quot;&gt;Repl.it&lt;/a&gt; - REPL interpreter, anonymous program saving&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://ideone.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ideone&lt;/a&gt; - Online IDE, create an account to save&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://pythex.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pythex&lt;/a&gt; - Python regular expression editor&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.learnpython.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Learn Python&lt;/a&gt; - Free, interactive tutorial&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-25T19:47:16.853" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9664" PostTypeId="2" ParentId="9646" CreationDate="2016-07-25T18:26:52.310" Score="7" Body="&lt;h3&gt;TL;DR: You don't use &amp;quot;bytes&amp;quot; at all.&lt;/h3&gt;&#xA;&lt;p&gt;Some languages, such as Minecraft, require special units. The answer should be scored:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;Lego WeDo, 7 blocks&lt;/h2&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;As @Mego has said, making comparisons between languages' scores does not make sense due to the natural differences between languages. As long as you optimize the code, it is still in the spirit of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; even if it doesn't use the same unit.&lt;/p&gt;&#xA;&lt;p&gt;A notable exception is where a question uses a Stack Snippet leaderboard, in which case one should replace blocks with bytes and specify in the answer 1 block = 1 byte.&lt;/p&gt;&#xA;" OwnerUserId="47670" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-25T18:26:52.310" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9665" PostTypeId="2" ParentId="1723" CreationDate="2016-07-25T18:59:22.033" Score="-3" Body="&lt;h2&gt;Software and Specs questions for esoteric/golfing languages&lt;/h2&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Examples:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Where can I find an interpreter for [esoteric language]?&lt;/li&gt;&#xA;&lt;li&gt;Is there an official specification for [esoteric language]?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Arguments:&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;For:&lt;/strong&gt; Esoteric languages, being esoteric and all, can be hard to find interpreters for. Brainf[][]k and other very common esolangs may be easier, but try googling &amp;quot;interpreter for &lt;a href=&quot;http://esolangs.org/wiki/M%C3%B6bius&quot; rel=&quot;nofollow noreferrer&quot;&gt;Möbius&lt;/a&gt;&amp;quot; and see what you come up with.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;For:&lt;/strong&gt; &lt;a href=&quot;http://esolangs.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolangs.org&lt;/a&gt;, the top result for &amp;quot;esoteric programming languages&amp;quot; on Google, is not meant to be a complete manual for languages. It provides an idea of the language, and theoretically provides references to other, more complete websites. However, for instance, the page on &lt;a href=&quot;http://esolangs.org/wiki/Objective_LOLCODE&quot; rel=&quot;nofollow noreferrer&quot;&gt;Objective LOLCODE&lt;/a&gt; provides no references to external specifications.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Against:&lt;/strong&gt; Has nothing to do with programming puzzles or code golf, only esoteric languages which by themselves are off-topic.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Against&lt;/strong&gt;: The use cases for these questions would be very few as most people golf with more common esolangs.&lt;/p&gt;&#xA;" OwnerUserId="47670" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-25T18:59:22.033" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9666" PostTypeId="2" ParentId="9619" CreationDate="2016-07-25T20:09:12.987" Score="21" Body="&lt;h2&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/J_(programming_language)&quot; rel=&quot;nofollow noreferrer&quot;&gt;J&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;J is different&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Syntax, datatypes, built-in functions: J differs from most mainstream languages in all of these aspects.&#xA;J is the successor of &lt;a href=&quot;https://en.wikipedia.org/wiki/APL_(programming_language)&quot; rel=&quot;nofollow noreferrer&quot;&gt;APL&lt;/a&gt; (that language with all the weird Unicode symbols), and conforms to the &lt;em&gt;array programming&lt;/em&gt; paradigm.&#xA;This means that J effectively forces you to think of most golfing problems as transformations of multidimensional arrays, which are the most important datatype in the language.&#xA;It also provides a large collection of seemingly weird but very powerful built-in functions for that purpose; soon you will wish other languages had them too.&#xA;For example, instead of loops, you have functions that automatically distribute over arrays.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;J is also largely &lt;em&gt;functional&lt;/em&gt;, which means that a J program is really one big function constructed from smaller functions using different modifiers and combinators.&lt;sup&gt;1&lt;/sup&gt; For example, computing the number of &lt;code&gt;2&lt;/code&gt;s in a numeric array can be done with the function &lt;code&gt;+/@:=&amp;amp;2&lt;/code&gt;.&#xA;Broken into parts, it reads as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;/   Reduce by&#xA;+   addition&#xA;@:  (function composition)&#xA;=   the equality bit-array&#xA;&amp;amp;   (argument binding)&#xA;2   with the number 2.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The syntax of J is built around this way of structuring programs, and it often results in very short code performing complex tasks.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;J programs are like puzzles&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Because of J's syntax rules and the array paradigm, golfing in it will usually proceed in stages.&#xA;First, you must re-think the problem at hand in terms of array manipulation.&#xA;Once you are somewhat familiar with J's standard library, this will start to come naturally.&#xA;Want to find the index of the third occurrence of every character in a string?&#xA;Just iterate over the prefixes, count the number of occurrences of their last characters, and mark those for which the count equals 3.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The next stage is to write your array manipulation algorithm in J.&#xA;The unique syntax rules of J make this phase seem like a strange jigsaw puzzle: you start with small pieces of code that perform parts of what you want, and then try to combine them into a coherent whole, using &lt;a href=&quot;http://www.jsoftware.com/help/dictionary/intro05.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;forks&lt;/a&gt;, &lt;a href=&quot;http://www.jsoftware.com/help/dictionary/dictc.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;conjunctions&lt;/a&gt; and other syntactic features.&#xA;When you finally golf your program, you will slide the interlocking pieces into new positions, losing some of them or switching into shorter alternatives, until there is nothing left to take away.&#xA;I personally find this process very creative and rewarding.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;J is terse, but not a golfing language&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;J, and other languages in the APL family, have a unique place in the golfing community.&#xA;On the one hand, they are actually used by professionals in various fields, and thus have mature libraries and small but faithful user bases.&#xA;They have many features that distinguish them from pure golfing languages, like the two-character function names of J and their lack of built-in string manipulation functions.&#xA;On the other hand, J was specifically designed to be a terse language, which makes it very rewarding to golf in.&#xA;I believe this gives you the best of both worlds.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Resources&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The &lt;a href=&quot;http://jsoftware.com/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;J home page&lt;/a&gt; with download links.&lt;/li&gt;&#xA;&lt;li&gt;An &lt;a href=&quot;https://tio.run/nexus/j&quot; rel=&quot;nofollow noreferrer&quot;&gt;online J interpreter at TIO&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;a href=&quot;http://www.jsoftware.com/help/dictionary/vocabul.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;standard library&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A &lt;a href=&quot;http://www.jsoftware.com/help/learning/contents.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;tutorial&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; J also supports variables and imperative constructs like &lt;code&gt;while&lt;/code&gt; loops, but they are rarely useful in golfing.&lt;/p&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="32014" LastEditDate="2016-11-29T17:37:42.970" LastActivityDate="2016-11-29T17:37:42.970" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9667" PostTypeId="2" ParentId="2140" CreationDate="2016-07-25T21:28:09.107" Score="0" Body="&lt;h2&gt;Could it all add up to nothing?&lt;/h2&gt;&#xA;&lt;p&gt;Given an input number, return a truthy value if it is possible to arrange permutations of &lt;code&gt;+&lt;/code&gt; and &lt;code&gt;-&lt;/code&gt; signs to make the sum of the range up to that value 0.&lt;/p&gt;&#xA;&lt;p&gt;Note that you don't have to output which set of combinations is truthy.&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 (1) --&amp;gt; Falsy&#xA;2 (1,2) --&amp;gt; Falsy&#xA;3 (1,2,3) --&amp;gt; 1+2-3, Truthy&#xA;4 (1,2,3,4) --&amp;gt; -1+2+3-4, Truthy&#xA;5 (1,...,5) --&amp;gt; Falsy&#xA;6 (1,...,6) --&amp;gt; Falsy&#xA;7 (1,...,7) --&amp;gt; 1+2-3-4+5+6-7, Truthy&#xA;8 (1,...,8) --&amp;gt; 1+2-3-4-5-6+7+8, Truthy&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Just one thing - no using &lt;code&gt;eval&lt;/code&gt; or similar commands.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest answer in bytes wins!&lt;/p&gt;&#xA;&lt;h3&gt;Sandbox notes&lt;/h3&gt;&#xA;&lt;p&gt;Require a range or a list as input?&lt;/p&gt;&#xA;" OwnerUserId="32686" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-25T21:53:58.273" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9668" PostTypeId="2" ParentId="9619" CreationDate="2016-07-26T00:05:51.110" Score="4" Body="&lt;h1&gt;C#&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;It's challenging&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Similar to the Java answer golfing in a verbose language can be challenging and it is truly thrilling when you get an answer that isn't far off that of the dedicated golfing languages.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;6.0 Syntactic Sugar&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;With version 6.0 C# has a lot more golfing potential with string interpolation, expression bodied members, and null conditionals.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Tooling&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;With Visual Studio 2015, C# can be written in a professional grade IDE at no cost with support for plugins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally for me personally since I write C# in my day job it helps me test my knowledge of the quirks of the language and has helped me better understand parts of the language; a recent example of this is learning about &lt;a href=&quot;http://mikehadlow.blogspot.ca/2008/03/currying-in-c-with-oliver-sturm.html&quot; rel=&quot;nofollow&quot;&gt;Currying&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerDisplayName="user19547" LastActivityDate="2016-07-26T00:05:51.110" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9671" PostTypeId="2" ParentId="2140" CreationDate="2016-07-26T11:41:54.137" Score="4" Body="&lt;h1&gt;Peter Piper and the Peck of Pickled Peppers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Without an introduction, output the following tongue twister:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Peter Piper picked a peck of pickled peppers.&#xA;A peck of pickled peppers Peter Piper picked.&#xA;If Peter Piper picked a peck of pickled peppers,&#xA;Where's the peck of pickled peppers Peter Piper picked?&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;with or without a trailing newline.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="48538" LastActivityDate="2016-07-26T11:41:54.137" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9673" PostTypeId="1" AcceptedAnswerId="9674" CreationDate="2016-07-27T02:20:39.757" Score="3" ViewCount="72" Body="&lt;p&gt;In the current state does placing a bounty on a question count as earning negative rep on the daily rep limit? Currently I believe that one can only earn 200 rep daily. Thus, say user foo has 800 rep today. Then he places a bounty for 50 rep on question bar. Now he is at 750 rep. Now if his stellar answer gets 25 upvotes will he be at 1000 reputation or only 950? Should he be allowed to?&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="40695" LastEditDate="2016-07-27T03:47:23.313" LastActivityDate="2016-07-27T03:47:23.313" Title="Does (Should) instituting a bounty count as earning negative rep for the daily rep limit" Tags="|support|reputation|bounty|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9674" PostTypeId="2" ParentId="9673" CreationDate="2016-07-27T02:25:40.397" Score="7" Body="&lt;p&gt;You can earn a maximum of 200 reputation from upvotes per day. This limit is not affected by either placing or earning bounties.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the scenario you describe in your question, the final reputation count would be 950.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Related post on Mother Meta: &lt;a href=&quot;https://meta.stackexchange.com/q/51257/170332&quot;&gt;How does proposing a bounty affect the reputation cap?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2016-07-27T02:25:40.397" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9675" PostTypeId="2" ParentId="8047" CreationDate="2016-07-27T03:13:05.117" Score="37" Body="&lt;h2&gt;Allowing standard loopholes in general&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Don't say &quot;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/20260&quot;&gt;Standard loopholes&lt;/a&gt; are allowed&quot;. They ban silly things like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1071/20260&quot;&gt;making up a language where the solution is a single character&lt;/a&gt; or just &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1070/20260&quot;&gt;printing the string &quot;the answer&quot;&lt;/a&gt;. Even if you find these amusing, we got tired of them long ago and that's why they're forbidden. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Allowing specific loopholes, such as &lt;a href=&quot;http://meta.codegolf.stackexchange.com/a/1062/20198&quot;&gt;fetching the output from an external source&lt;/a&gt; can and should be overriden if it makes the challenge better.  For example, if the challenge is about getting information from a website, then it should definitely be allowed.  This answer addresses allowing standard loopholes in general, as they apply to most challenges.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="46271" LastEditDate="2017-12-11T23:35:20.037" LastActivityDate="2017-12-11T23:35:20.037" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9678" PostTypeId="2" ParentId="9646" CreationDate="2016-07-27T06:17:12.067" Score="-1" Body="&lt;p&gt;Use Blocks + Bytes in constants(except input)&lt;/p&gt;&#xA;&lt;p&gt;Block based programming languages use too much bytes in the file, thus making unfair to score with the file itself.&lt;/p&gt;&#xA;&lt;p&gt;So we can use a concept, which is also used in other block based programming languages.&lt;/p&gt;&#xA;&lt;p&gt;We would score like this:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Lego WeDo, 15 Blytes (9 + 6)&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;(yes, this concept is similarly used in scratch)&lt;/p&gt;&#xA;&lt;p&gt;Alternatively, We can swap each block with functions so that we can use the unit that is usually used.&lt;/p&gt;&#xA;" OwnerDisplayName="user54200" LastEditorUserId="-1" LastEditorDisplayName="user54200" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-27T06:22:53.457" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9679" PostTypeId="2" ParentId="2140" CreationDate="2016-07-27T07:12:08.753" Score="0" Body="&lt;h1&gt;Quine-ify PPCG Answers!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program that, when executed, returns the markdown file to your answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, something like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#Python: 123 bytes&#xA;&#xA;`{insert code here}`&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Required things:&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Header must be one hash (&lt;code&gt;#&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;The &quot;code part&quot; must be indented with four spaces (or surrounded with backticks if it's a one-liner).&lt;/li&gt;&#xA;&lt;li&gt;The code part must be the actual code used to run the program.&lt;/li&gt;&#xA;&lt;li&gt;There must be a separation of a newline between the header and the code.&lt;/li&gt;&#xA;&lt;li&gt;The program's display bytecount MUST equal the program's actual bytecount.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Meta:&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Most importantly: is it even possible, at all?&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Do I need more clarifications?&lt;/li&gt;&#xA;&lt;li&gt;Has this been done already?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastActivityDate="2016-07-27T07:12:08.753" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9680" PostTypeId="2" ParentId="9646" CreationDate="2016-07-27T07:43:05.610" Score="7" Body="&lt;h2&gt;Count bytes of the file&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Okay, this is the same policy as advocated by Mego's answer, but let me make another case for it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First of all, what's the motivation for using different scoring? The language's scores won't be comparable with other languages with or without a special scoring mechanism. They'll be smaller, but what does that number actually mean? I don't think a different scoring is actually going to change the order of multiple submissions &lt;em&gt;in this language&lt;/em&gt; substantially if at all. So it doesn't really matter. If it's just because the score is larger than it needs to be, then we should also discuss different scoring methods for Java and Brainfuck (and pretty much every other language that doesn't use all 256 characters of a code page).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Counting bytes is the easiest. You just look at the file and you'll know how many bytes it has. If scoring is based on something like blocks and then with special rules for literals (and how do you even account for the information contained in the relative placement of blocks, and should jump targets be a byte as well?), then people are bound to get it wrong, and there won't be enough people to double-check every score. Having to count by hand is just going to lead to problems.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Most importantly,&lt;/em&gt; &lt;strong&gt;new users of the language would have to know about this post to score their language correctly.&lt;/strong&gt; I think that's a huge disadvantage. We already have way too many implicit rules scattered around on meta. Let's not add even more to come up with language-specific scoring mechanisms that don't even serve any real purpose.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for the extraneous/unnecessary information in the saved file: you're free to remove as much of that information as you like as long as the file still works when fed to Lego WeDo. You can view that as an additional component to golfing in this language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you still don't like that, like Mego said, you're always free to define a new language with less redundant syntax and write a transpiler to the Lego WeDo file format.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code golf at the root is defined as the task of solving a problem with the smallest-possible source file. Lego WeDo uses source files under the hood, so I don't see why we should make any exception for this. Like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8939/8478&quot;&gt;trichoplax said over here&lt;/a&gt; anything else means you're submitting an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; score to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-07-27T07:56:47.383" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9682" PostTypeId="2" ParentId="2140" CreationDate="2016-07-27T20:15:22.503" Score="0" Body="&lt;h3&gt;Make a sequence from a sequence!&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(Title is bad and I should feel bad)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a sequence of positive Integers, take each consecutive pair of two (without taking an element two times) (x,y) and print y x times.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example for &lt;em&gt;3,1,4,2&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;Pairs are (3,1) and (4,2)&lt;/li&gt;&#xA;  &lt;li&gt;(3,1): Print 1 three times: 1 1 1&lt;/li&gt;&#xA;  &lt;li&gt;(4,2): Print 2 four times: 2 2 2 2&lt;/li&gt;&#xA;  &lt;li&gt;Resulting sequence/output is &lt;em&gt;1, 1, 1, 2, 2, 2, 2&lt;/em&gt;&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A sequence of positive integers divisible by two. This can be done by parameters, a &lt;em&gt;flat&lt;/em&gt; array, an integer stream etc. AS LONG AS there's no nesting or pre-matching of pairs involved.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The resulting sequence as showcased above. Same rules for datatypes as declared in input, keep everything flat.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test cases&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;      3, 1, 4, 2 =&amp;gt; 1, 1, 1, 2, 2, 2, 2&#xA;            6, 5 =&amp;gt; 5, 5, 5, 5, 5, 5&#xA;1, 1, 1, 1, 1, 1 =&amp;gt; 1, 1, 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Reference Implementation (Ruby, 55 bytes)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f=-&amp;gt;a{a.each_slice(2).collect{|x|Array.new *x}.flatten}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Ungolfed:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def g *a&#xA;  a.each_slice(2).collect do |x|&#xA;    Array.new(x[0], x[1]) &#xA;  end.flatten&#xA;end&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The first golfer to find a shorter solution in this language gets a &lt;em&gt;-1&lt;/em&gt; bonus.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Shortest code in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="54014" LastActivityDate="2016-07-27T20:15:22.503" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9683" PostTypeId="2" ParentId="9619" CreationDate="2016-07-27T22:34:15.313" Score="12" Body="&lt;h1&gt;C&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;C's been around for a while, which means it's full of &lt;s&gt;weird legacy stuff&lt;/s&gt; useful syntax. Golfing in the language turns out to be a great way to discover its &lt;a href=&quot;https://stackoverflow.com/q/5073350/1180785&quot;&gt;strange&lt;/a&gt; &lt;a href=&quot;https://stackoverflow.com/q/3092006/1180785&quot;&gt;history&lt;/a&gt; &lt;a href=&quot;https://stackoverflow.com/q/9182763/1180785&quot;&gt;and&lt;/a&gt; &lt;a href=&quot;https://gcc.gnu.org/onlinedocs/gcc/Conditionals.html#Conditionals&quot; rel=&quot;nofollow noreferrer&quot;&gt;non-standard&lt;/a&gt; &lt;a href=&quot;https://gcc.gnu.org/onlinedocs/gcc-4.2.1/gcc/Designated-Inits.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;extensions&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's not exactly competitive against other languages (except Java of course), but it can be fun to compete against other C answers. This is mainly because while there are usually a couple of drastically different ways to solve the same problem, it's still possible to be inspired from parts of other answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The design of the language means obscure pointer arithmetic and crazy bitwise operations are to be expected when golfing, so if you want to brush-up on those skills, it's ideal. Also the built-in function names are long (but not C#-long), so you'll need to work to minimise your use of them, which itself drives a different mindset.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, because C was never designed with golfing in mind, there's quite a lot of satisfaction to be found when you discover a neat way to abuse operator precedence, standard library functions, pointer arithmetic / unsafe casting, implicit declaration of functions, printf syntax, short-circuit evaluation, recursion, etc. etc.&lt;/p&gt;&#xA;" OwnerUserId="8927" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2016-07-27T22:34:15.313" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9685" PostTypeId="2" ParentId="2140" CreationDate="2016-07-27T23:32:32.770" Score="1" Body="&lt;h1&gt;Teh Scrolling Codez&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In many movies, computer often appear to be scrolling through some code. We should automate this process to make it easier. Your job is to write code that displays to a graphical console a scrolling view of its own source code. You have two options...&lt;/p&gt;&#xA;&#xA;&lt;hr/&gt;&#xA;&#xA;&lt;h3&gt; You may horizontally scroll the source as HTML's Marquee.&lt;/h3&gt;&#xA;&#xA;&lt;h3&gt; You also may vertically scroll through the source as if the source is code is on a cylinder, and only a fixed number of lines can be displayed&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;hr&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Should this be a code golf or pop-con. Pop-con's could result in more visually pleasing solutions.&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; or [tag:popularity contest]&lt;/p&gt;&#xA;" OwnerUserId="46918" LastActivityDate="2016-07-27T23:32:32.770" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="9686" PostTypeId="2" ParentId="9619" CreationDate="2016-07-28T01:29:32.407" Score="5" Body="&lt;h1&gt;Verilog (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9691/are-languages-targeting-computing-platforms-other-than-sequential-cpus-such-as&quot;&gt;now approved&lt;/a&gt;).&lt;/h1&gt;&#xA;&lt;p&gt;Yes, this is an HDL, used for FPGAs, FPGA simulation, and hardware design. There are some (many?) tasks that it cannot handle efficiently--it does not offer some data structures such as maps (except with integer keys using large indexed arrays) but when bit-twiddling, logic, or the like are involved, it can be extremely powerful.&lt;/p&gt;&#xA;&lt;p&gt;When written in the correct manner and given sufficient leeway in the challenge problem to allow an FPGA to be used instead of a computer (with input either preset in the bitstream or through pins) one can reach throughputs of around a hundred million loop iterations per second (assuming 100MHz clock and either single stage or full pipelined), in cases where the result must be provided within a reasonable time. Even FFTs can be done in short amounts of time, as low  as a few clock cycles (at the expense of code length).&lt;/p&gt;&#xA;&lt;p&gt;Supports arbitrary-width integers out of the box (no Java-like verbose method calls, just declare integers in a format such as &lt;code&gt;reg[4095:0]&lt;/code&gt; (4096 bits in this case) and use normal operators. Fixed-point non-integer values are also possible. Other fancy tricks include &lt;a href=&quot;http://www.asic-world.com/verilog/operators2.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;reduction operators&lt;/a&gt; such as and/or/xor over all bits using a single unary operator.&lt;/p&gt;&#xA;&lt;p&gt;In many cases, its weird dataflow can be extremely useful. Not many languages let you quickly and easily trigger on the rising/falling edge of a variable without massive amounts of boilerplate. Use this to trigger code quickly and easily, even implicitly (since most compliant implementations should even let you trigger on an edge of a single bit of an integer, thus letting you catch overflow and other arithmetic &amp;quot;events&amp;quot;).&lt;/p&gt;&#xA;&lt;p&gt;Non-blocking assignments allow you to delay the actual assignment until the end of a block and continue using the old value, while blocking assignments behave like in standard languages.&lt;/p&gt;&#xA;&lt;p&gt;Modules can be defined and repeatedly instantiated (even &lt;a href=&quot;http://jad-reads.blogspot.hu/2009/03/recursive-and-iterative-designs-in.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;recursively&lt;/a&gt;), with generate loops allowing you to slice input across multiple modules, and the like. You can define a module that acts on a single bit/byte/whatever of a long input, and instantiate that module in a loop with a different bit/byte/subset of the input connected to the input port of that module.&lt;/p&gt;&#xA;&lt;p&gt;A preprocessor lets you use macros, with parameters, to reduce code duplication.&lt;/p&gt;&#xA;&lt;p&gt;Assign statements allow you to assign a wire-type variable to some rvalue, and when the inputs change the variable automatically changes as well. Consider assigning &lt;code&gt;wire a&lt;/code&gt; as &lt;code&gt;wire a = b|~c&lt;/code&gt;. Now, &lt;code&gt;a&lt;/code&gt; will &lt;em&gt;always&lt;/em&gt; be equal to &lt;code&gt;b|~c&lt;/code&gt;, even after b or c change. With &lt;a href=&quot;http://www.asic-world.com/verilog/synthesis3.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;additional code&lt;/a&gt; you can even use case (switch) statements, if/then, and the like to auto-update a variable based on inputs, or even add &lt;a href=&quot;https://www.doulos.com/knowhow/verilog_designers_guide/synthesizing_latches/&quot; rel=&quot;nofollow noreferrer&quot;&gt;latching behavior&lt;/a&gt; (value only updates under certain conditions).&lt;/p&gt;&#xA;&lt;p&gt;Like many submissions here, this language is hard. Partially due to its counter-intuitive behavior at times, partially due to its verbosity in some situations. However, in the situations where Verilog's features can be put to good use, they are quite rewarding.&lt;/p&gt;&#xA;&lt;p&gt;Last but not least, very few languages offer debuggers that show waveforms and relative timing of variable assignments (although this requires additional characters to actually add visible delays for sequential programming, which can typically be removed for the final golfed version):&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/9KE3N.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/9KE3N.gif&quot; alt=&quot;Simulator screenshot&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="4256" LastEditorUserId="91213" LastEditDate="2023-09-19T16:35:36.200" LastActivityDate="2023-09-19T16:35:36.200" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="9688" PostTypeId="1" AcceptedAnswerId="9692" CreationDate="2016-07-28T15:30:51.890" Score="29" ViewCount="1099" Body="&lt;p&gt;Community Wikis (CWs) seem to be an often misunderstood feature on Stack Exchange in general. For instance, I'm often seeing them used to avoid gaining reputation when the author feels they don't deserve it for whatever reason, even though that is not at all their purpose. The problem doesn't get any easier on PPCG, where the &lt;a href=&quot;http://blog.stackoverflow.com/2011/08/the-future-of-community-wiki/&quot;&gt;general CW guidelines from SE&lt;/a&gt; don't necessarily apply due to the different format of answers. One example that I'm occasionally seeing is people making an invalid answer CW instead of deleting (probably with the reasoning that &quot;if I don't get rep, it doesn't need to be valid&quot;). The original intent of CW is to have answers where the author is not able to provide the full content but needs the help others to complete it, and lets them edit it easily.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it would be good if we had a discussion about how CW should be used on PPCG, both as a guide to point users to, and also for us moderators to see how the community would like to see us handle cases where CW has been used inappropriately.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some common cases that come to mind:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I improve someone else's answer and offer the changes to them in a comment. However, they refuse to include it for whatever reason (usually because they find that the change is too substantial), so I post the new solution myself.&lt;/li&gt;&#xA;&lt;li&gt;I port someone else's answer to another language and post it myself.&lt;/li&gt;&#xA;&lt;li&gt;Someone ports my answer to another language and offers to let me post it.&lt;/li&gt;&#xA;&lt;li&gt;Someone suggests improvements to my answer and I include them.&lt;/li&gt;&#xA;&lt;li&gt;Several users solve a challenge together in chat. One of them posts it.&lt;/li&gt;&#xA;&lt;li&gt;I've found a competitive solution to a challenge elsewhere on the internet and would like to post it for completeness' sake (giving due credit).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Should CW be used in any of those cases? In none of them? Are there other factors it depends on? Are there other use cases for CW on PPCG?&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2016-07-28T16:14:30.780" LastActivityDate="2021-05-19T04:51:58.013" Title="How should Community Wikis be used?" Tags="|discussion|policy|community-wiki|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9691" PostTypeId="1" AcceptedAnswerId="9725" CreationDate="2016-07-28T16:49:36.670" Score="9" ViewCount="416" Body="&lt;p&gt;So far, almost all submissions on this site are ones that target &quot;standard&quot; computers, namely devices that execute code in a typically linear fashion, with a standard variety of inputs/outputs (standard in/out/err, file, rendering a window). However, this seems to make programs targeting hardware other than standard computers a grey area due to lack of precedent, performance considerations (where solutions must take only a reasonable amount of time), and different input/output considerations than standard programs running on computers with operating systems. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/4256&quot;&gt;This highly upvoted answer to &quot;What are programming languages?&quot;&lt;/a&gt; describes the requirements for the language to be used, and in turn, the platform. The hardware+language easily fits a transformational model, handles representations of integers and collections thereof, can add numbers, and can perform primality checks. The language is text-based so byte-counting considerations have already been resolved by precedent with other text-based languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I'd still like a second opinion from the community on whether these languages/hardware devices are appropriate when not explicitly disallowed by a question, and what is allowed for inputs/outputs (e.g. serial transcievers, clocking data in/out through pins in serial/parallel fashion, reading/writing block RAMs (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8510/4256&quot;&gt;precedent&lt;/a&gt;), or &lt;em&gt;if in a simulator&lt;/em&gt;, through standard file/stream IO).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, in cases where execution is either timed as a limit or as the sorting criterion for answers, I'm assuming that the requirement is that the design meets timing for some frequency F_max on a commercially-produced FPGA available at the time of writing the challenge, and then the solution time is simply the time it takes for the output to be provided at that frequency F_max. Is that a correct way to go about that?&lt;/p&gt;&#xA;" OwnerUserId="4256" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-08-01T16:10:04.743" Title="Are languages targeting FPGAs or other non-standard/non-sequential computing platforms acceptable?" Tags="|discussion|code-golf|rules|scoring|" AnswerCount="1" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="9692" PostTypeId="2" ParentId="9688" CreationDate="2016-07-28T16:55:16.703" Score="33" Body="&lt;h1&gt;Community wiki is not a rep waiver&lt;/h1&gt;&#xA;&lt;p&gt;&lt;sup&gt;I've mentioned that from time to time in the past.&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;Community wiki doesn't just mean that you cannot earn rep from a post. Yes, it does have that side effect, but the community wiki option is for posts that can be edited by anyone without worrying about post ownership. Edits that are usually frowned upon – and rejected when suggested – such as editing the code in an answer, are not only tolerated but welcomed in the case of a community wiki post. Making your answer community wiki means that &lt;em&gt;everyone&lt;/em&gt; should feel free to improve the post; even users with as little 100 reputation won't have to get their edits approved.&lt;/p&gt;&#xA;&lt;p&gt;This feature was introduced back when Stack Overflow was &lt;em&gt;very&lt;/em&gt; different. List-of questions have been off-topic for a long time now, suggested edits have been implemented, and community wiki rarely makes sense nowadays. And while community wiki &lt;em&gt;works&lt;/em&gt; as a rep waiver, it shouldn't be used as one. &lt;a href=&quot;https://meta.stackexchange.com/q/392/170332&quot;&gt;Should the community wiki police be shut down?&lt;/a&gt; is a post on Mother Meta from &lt;strong&gt;2009&lt;/strong&gt;, yet I still see the occasional comment (or flag) stating that a post should be community wiki for non-wiki reasons.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I improve someone else's answer and offer the changes to them in a comment. However, they refuse to include it for whatever reason (usually because they find that the change is too substantial), so I post the new solution myself.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Just post it yourself, but don't make it a wiki. It is still your post. It's based on someone else's, but you can (and should) address that in the post, giving credit where credit is due. If others don't think the improvement is interesting enough, they won't upvote. Personally, I care much more about upvotes than reputation.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I port someone else's answer to another language and post it myself.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;See above. The implementation is &lt;em&gt;your&lt;/em&gt; work.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Someone ports my answer to another language and offers to let me post it.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The comment suggests that the poster is OK with you posting the port, so either do it – and, of course, credit them – or politely decline and let them post the answer themselves.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Someone suggests improvements to my answer and I include them.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I think that hasn't even come up in the wild. I've edited countless suggestions into my posts (again, with credit) without making them community wiki.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Several users solve a challenge together in chat. One of them posts it.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;That's the closest one to the intended use of community wikis. Still, this post is the work of a few collaborators, not the entire community, so &lt;em&gt;even in this case&lt;/em&gt;, I wouldn't make it a wiki.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I've found a competitive solution to a challenge elsewhere on the internet and would like to post it for completeness' sake (giving due credit).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;That's done on other SE sites all the time, and nobody marks these answers as community wiki, even if they contain little more than a quote from a blog post.&lt;/p&gt;&#xA;&lt;p&gt;You may not have &lt;em&gt;written&lt;/em&gt; the code yourself, but finding it can be just as difficult. Also, this is only slightly different from finding a language that happens to have the solution as a built-in, or from using a freely available BF generator to create a constant output.&lt;/p&gt;&#xA;&lt;h3&gt;Tips questions&lt;/h3&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4736/12012&quot;&gt;We've discussed that before&lt;/a&gt; and I agree with the reached consensus.&lt;/p&gt;&#xA;&lt;p&gt;The generic &lt;em&gt;tips for golfing in X&lt;/em&gt; posts have a wiki-like list-of nature, but the answers should preferably be limited to one tip per post (so the good tips rise to the top when sorting by votes), meaning that they aren't collaboration efforts and should therefore not be community wiki.&lt;/p&gt;&#xA;&lt;p&gt;Making the questions themselves community wiki might make sense, but it's not worth the trouble since this would automatically wiki all newly posted answers, and thus require moderator intervention to unwiki them.&lt;/p&gt;&#xA;&lt;h3&gt;So when does community wiki make sense?&lt;/h3&gt;&#xA;&lt;p&gt;99 times out of 100, it doesn't. Off the top of my head, one could create an answer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44680/showcase-your-language-one-vote-at-a-time&quot;&gt;Showcase your language one vote at a time&lt;/a&gt; where others should feel free to add snippets of their own.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;em&gt;Can&lt;/em&gt; I make my answer community wiki&lt;/h3&gt;&#xA;&lt;p&gt;Of course! It's &lt;em&gt;your&lt;/em&gt; answer. Before you wiki it, anyway...&lt;/p&gt;&#xA;&lt;p&gt;Note that by making your answer community wiki, you essentially give up ownership and invite the entire community to improve it.&lt;/p&gt;&#xA;&lt;p&gt;Finally, if you have posted a community wiki answer for whatever reason and want to unwiki it, please feel free to flag it for moderator attention.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="68942" LastEditDate="2021-05-19T04:51:58.013" LastActivityDate="2021-05-19T04:51:58.013" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="9695" PostTypeId="2" ParentId="2140" CreationDate="2016-07-29T16:00:19.030" Score="0" Body="&lt;h1&gt;CAPTCHAs (Cops and Robbers Style)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Cops will write a program that generates a CAPTCHA (either through stdin/stdout or on whatever UI is available to your language using only built-ins).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Robbers will attempt to bypass the generated CAPTCHA programmatically, given access to the Cops' programs' stdin/stdout or UI process/thread (for example, in JavaScript, running on the same &lt;code&gt;document&lt;/code&gt; and &lt;code&gt;window&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I need help fleshing this idea out a little more... any suggestions will help.&lt;/p&gt;&#xA;" OwnerUserId="42091" LastActivityDate="2016-07-29T16:00:19.030" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9697" PostTypeId="2" ParentId="2140" CreationDate="2016-07-29T22:32:37.007" Score="0" Body="&lt;h1&gt;Create me a Brainf*** assembler&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a way to convert &quot;human readable&quot; assembly (of any kind) to Brainf***.&#xA;I.E specify a language &quot;X&quot; (which may already exist or may be your own invention), and create a way to map each valid program to a valid Brainf*** program. This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; so the most convenient assembler as evidenced by upvotes wins!&lt;/p&gt;&#xA;" OwnerUserId="46918" LastActivityDate="2016-07-29T22:32:37.007" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="9698" PostTypeId="2" ParentId="2140" CreationDate="2016-07-30T00:32:32.540" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Autonomous Vehicle&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I need a brain for my self-driving car. Something that will take still frames from the front-facing camera and give the navigation system commands. Obviously, if my car is driving me somewhere, I don't want to stop. However, I also don't want to:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Kill someone&lt;/li&gt;&#xA;&lt;li&gt;Die&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Knowing myself, we can assume that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;At the speed I drive, &lt;a href=&quot;https://what-if.xkcd.com/61/&quot; rel=&quot;nofollow noreferrer&quot;&gt;hitting the curb&lt;/a&gt; or otherwise leaving the road will kill me and thus violate &lt;strong&gt;Don't #2&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;With my luck, running a stop light, will violate &lt;strong&gt;Don't #1&lt;/strong&gt; or &lt;strong&gt;#2&lt;/strong&gt; or both&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Also hitting a pedestrian (or another car) violates &lt;strong&gt;Don't #1&lt;/strong&gt; (and possibly &lt;strong&gt;#2&lt;/strong&gt;)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The program/function should take an image as input. How it does this is flexible.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The program/function should output one of these commands; ideally, one of the commands that doesn't result in one of the &lt;strong&gt;Don'ts&lt;/strong&gt; being violated.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;╔═════════╤═══════════════════════════════════════════════╗&#xA;║ Command │ Navigational Outcome                          ║&#xA;╠═════════╪═══════════════════════════════════════════════╣&#xA;║ Forward │ No course correction, continue straight ahead ║&#xA;╟─────────┼───────────────────────────────────────────────╢&#xA;║ Left    │ Veer left                                     ║&#xA;╟─────────┼───────────────────────────────────────────────╢&#xA;║ Right   │ Veer right                                    ║&#xA;╟─────────┼───────────────────────────────────────────────╢&#xA;║ Stop    │ Screech to a grinding halt                    ║&#xA;╚═════════╧═══════════════════════════════════════════════╝&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Specifications&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take an image as input in someway&lt;/li&gt;&#xA;&lt;li&gt;Output a command [ &lt;strong&gt;Forward&lt;/strong&gt;, &lt;strong&gt;Left&lt;/strong&gt;, &lt;strong&gt;Right&lt;/strong&gt;, &lt;strong&gt;Stop&lt;/strong&gt; ]&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Commands can be aliased as [ &lt;strong&gt;0&lt;/strong&gt;, &lt;strong&gt;1&lt;/strong&gt;, &lt;strong&gt;2&lt;/strong&gt;, &lt;strong&gt;3&lt;/strong&gt; ] respectively&lt;/li&gt;&#xA;&lt;li&gt;Returning one valid command and no invalid commands is sufficient to pass a test&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Stop&lt;/strong&gt; is only valid iff every other command would violate one of the &lt;strong&gt;Don'ts&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Rules for valid commands:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No running stop lights&lt;/li&gt;&#xA;&lt;li&gt;No running over people&lt;/li&gt;&#xA;&lt;li&gt;No running into vehicles&lt;/li&gt;&#xA;&lt;li&gt;No running off the road&lt;/li&gt;&#xA;&lt;li&gt;If a command does not violate any of the above, then it is valid&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Program/Function must be deterministic&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Lowest score wins! The scoring function is: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;( # of Bytes ) / ( Number of Passed Tests )&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For example, a &lt;strong&gt;450 byte&lt;/strong&gt; Python solution that passes &lt;strong&gt;2&lt;/strong&gt; test cases earns a score of &lt;code&gt;450 / 2&lt;/code&gt; or &lt;strong&gt;225&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Valid Commands: &lt;strong&gt;Forward&lt;/strong&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/9LKIo.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/9LKIo.jpg&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Valid Commands: &lt;strong&gt;Left&lt;/strong&gt;, &lt;strong&gt;Right&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Straight ahead there are pedestrians crossing &lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/9MFkN.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/9MFkN.jpg&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol start=&quot;3&quot;&gt;&#xA;&lt;li&gt;&lt;p&gt;Valid Commands: &lt;strong&gt;Forward&lt;/strong&gt;, &lt;strong&gt;Right&lt;/strong&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/ILVAg.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ILVAg.jpg&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Valid Commands: &lt;strong&gt;Forward&lt;/strong&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/8xDH8.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/8xDH8.jpg&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Valid Commands: &lt;strong&gt;Left&lt;/strong&gt;, &lt;strong&gt;Right&lt;/strong&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/7OsZM.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/7OsZM.jpg&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Valid Commands: &lt;strong&gt;Stop&lt;/strong&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/r3kbo.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/r3kbo.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="43214" LastActivityDate="2016-07-30T00:32:32.540" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9700" PostTypeId="1" CreationDate="2016-07-30T04:13:24.083" Score="3" ViewCount="84" Body="&lt;p&gt;Are there any esoteric programming languages whose computability have not yet been well-classified?  For instance, languages which are not yet known to be Turing-complete.&lt;/p&gt;&#xA;" OwnerUserId="53746" LastActivityDate="2016-07-30T04:13:24.083" Title="Computability of esolangs" Tags="|discussion|" AnswerCount="0" CommentCount="5" ClosedDate="2016-07-30T07:52:06.763" ContentLicense="CC BY-SA 3.0" />
  <row Id="9701" PostTypeId="2" ParentId="2140" CreationDate="2016-07-30T13:05:25.523" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/86668/do-x-without-y/&quot;&gt;Do X without Y​&lt;/a&gt; again!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is an X done with Y:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;YyYy        YyYy&#xA; YyYy      YyYy &#xA;  YyYy    YyYy  &#xA;   YyYy  YyYy   &#xA;    YyYyYyYy    &#xA;     YyYyYy     &#xA;     yYyYyY     &#xA;    yYyYyYyY    &#xA;   yYyY  yYyY   &#xA;  yYyY    yYyY  &#xA; yYyY      yYyY &#xA;yYyY        yYyY&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As you can see, there are 92 Y/ys in this X. Conveniently, there are also exactly 92 printable ASCII characters in the range ! to ~ if you exclude Y and y. Your challenge is to write a program to output or a function to return the above X with all the Y/ys replaced by any permutation of those 92 characters. Leading and trailing white space is permitted. Shortest code wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.193" LastActivityDate="2016-07-31T07:52:38.830" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9703" PostTypeId="1" CreationDate="2016-07-30T22:25:14.883" Score="0" ViewCount="115" Body="&lt;p&gt;I'm proposing that we create an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/orphaned&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;orphaned&amp;#39;&quot; rel=&quot;tag&quot;&gt;orphaned&lt;/a&gt; tag for use only in the sandbox.&lt;/p&gt;&#xA;&lt;p&gt;This will allow people who have ceased work on a challenge idea to indicate such. The idea here is that other interested individuals would be able to step in and continue development of the challenge and post it in its final form.&lt;/p&gt;&#xA;&lt;p&gt;I've had this idea for awhile, but was prompted to actually ask while reading the comments for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2483/45459&quot;&gt;The Secret Handshake&lt;/a&gt; which was posted originally in 2014: (&lt;em&gt;please note that I do not know PhiNotPi's intentions, but it seems like it might fit the proposed orphaned scenario&lt;/em&gt;)&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;@PhiNotPi are you still interested in this challenge? Would you be willing to allow me to implement this? – Rohan Jhunjhunwala yesterday&lt;/p&gt;&#xA;&lt;p&gt;@RohanJhunjhunwala Sure, you can implement this. I don't think I ever started on a controller for it, mainly because I don't think this challenge will be as fun in practice as in theory. – PhiNotPi 9 hours ago&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I think scenarios similar to the above are not too uncommon.&lt;/p&gt;&#xA;&lt;p&gt;I'm curious to know if the community thinks that this tag might be worthwhile.&lt;/p&gt;&#xA;" OwnerUserId="45459" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-31T15:20:46.607" Title="Tag Proposal: Orphaned" Tags="|discussion|tags|sandbox|" AnswerCount="2" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9704" PostTypeId="1" CreationDate="2016-07-30T22:29:56.350" Score="0" ViewCount="58" Body="&lt;p&gt;This comes up in popularity contests all the time. Most elegant as a scoring criteria (or similar). Is a popularity contest objective in and of itself by saying that most votes wins? It is very objective to compare two numbers. How those numbers were created may not be objective. What is the community consesus on this. This is &lt;b&gt;NOT&lt;/b&gt; a dupe of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/305/what-makes-winning-criteria-objective&quot;&gt;What makes winning criteria &amp;quot;objective&amp;quot;?&lt;/a&gt; as I am specifically interested in popularity contests not all other winning criteria. What makes a good popularity contest question better than a bad one. &lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2016-07-30T22:29:56.350" Title="Is &quot;Most Elegant&quot; objective" Tags="|discussion|policy|popularity-contest|tips|" AnswerCount="0" CommentCount="2" ClosedDate="2016-07-30T23:00:28.280" ContentLicense="CC BY-SA 3.0" />
  <row Id="9705" PostTypeId="5" CreationDate="2016-07-30T22:30:27.853" Score="0" Body="" OwnerUserId="-1" LastEditorUserId="-1" LastEditDate="2016-07-30T22:30:27.853" LastActivityDate="2016-07-30T22:30:27.853" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9706" PostTypeId="4" CreationDate="2016-07-30T22:30:27.853" Score="0" Body="Use this tag for meta discussion about the tips tag or for questions regarding tips on a specific tag." OwnerUserId="46918" LastEditorUserId="46918" LastEditDate="2016-07-31T22:34:07.080" LastActivityDate="2016-07-31T22:34:07.080" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9707" PostTypeId="2" ParentId="9703" CreationDate="2016-07-30T22:32:57.617" Score="-4" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Orphaned should be a tag reserved for use in the sandbox as a clear-cut indicator of an idea which people are free to take. Although there is a current policy of being able to take sandbox questions, it may be more efficient to allow post owners to offer their questions for use.&lt;/p&gt;&#xA;" OwnerUserId="46918" LastActivityDate="2016-07-30T22:32:57.617" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9709" PostTypeId="2" ParentId="2140" CreationDate="2016-07-30T22:52:56.630" Score="0" Body="&lt;h1&gt;King of the golf course&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program that golfs Brainf*** programs. Similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges on this site, you will be racing against the clock, and the byte count to maximize glory (reputation).&#xA; Each program will be invoked with a series of command line arguments in this form &lt;pre&gt;in out in out in out&lt;/pre&gt;&#xA;Each program then has 1000 milliseconds to write a valid brainf*** program to botName.txt. This brainf*** program will take in a null terminated input from stdin and output the respective output according to the table. The code which writes the shortest programs as evidenced by the shortest of 5 runs (or more) will be crowned the winner with a green checkmark. Please note that my languages I support is limited and I may have to download the interpeter. I will have to disqualify non-free interpreters unless volunteers already possessing the interpereter/compiler are willing to help out.&#xA;&lt;hr /&gt;&#xA;Rules&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You may assume that anywhere from 15-30 in and out pairs will be provided.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that inputs and outputs are valid english words from Random House Dictionary&lt;/li&gt;&#xA;&lt;li&gt;You may assume a non wrapping brainf*** implementation with byte values for cells and a tape size of no less than 30k cells&lt;/li&gt;&#xA;&lt;li&gt;The outputted bf programs may be of any length, but your submission may be no more than 10 kilobytes long (to prevent hardcoding)&lt;/li&gt;&#xA;&lt;li&gt;Invalid submissions will result in immediate disqualification until a bug patch is uploaded&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/meta-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;meta-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;meta-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brainfck&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brainfck&amp;#39;&quot; rel=&quot;tag&quot;&gt;brainfck&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/natural-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;natural-language&amp;#39;&quot; rel=&quot;tag&quot;&gt;natural-language&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="46918" LastEditDate="2016-07-31T15:40:20.550" LastActivityDate="2016-07-31T15:40:20.550" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9710" PostTypeId="2" ParentId="9703" CreationDate="2016-07-31T01:23:12.790" Score="7" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;Even if every single member in this community wanted this, it would be impossible. Answers don't have tags, so it's pointless to discuss a new tag for answers.&lt;/p&gt;&#xA;&lt;p&gt;Now, indicating that you have no interest in posting a previously sandboxed challenge is a great idea! Logistically, I don't think this should be enforced at all, just encouraged. Especially since every post that could use this is by definition abandoned. Why would we expect users to come back and mark it that way? It's best to stick to our current system of&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;If you find an abandoned post you like, comment on it to ask the OP for permission to take over. If you get no response for two weeks, it is safe to take it.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;However like I said, indicating you're done with a post is a great idea. I plan on doing this to all my future abandoned sandbox posts, and I'd encourage you to do the same for yours. It might even be a good idea to encourage users to do this in the body of the sandbox post itself. That is, assuming the community in general thinks it would be a good idea.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-07-31T15:20:46.607" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9711" PostTypeId="2" ParentId="2140" CreationDate="2016-07-31T09:16:37.610" Score="1" Body="&lt;h2&gt;Embed a graph into the Rado graph&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The Rado graph is an infinite undirected graph whose vertices are labelled with natural numbers &lt;code&gt;{0, 1, 2, ...}&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The edge &lt;code&gt;(i,j)&lt;/code&gt; with &lt;code&gt;i&amp;lt;j&lt;/code&gt; is in the graph whenever the binary expansion of &lt;code&gt;j&lt;/code&gt; has a &lt;code&gt;1&lt;/code&gt; in its &lt;code&gt;i&lt;/code&gt;th place. Here, place values are counted from the end, with the &lt;code&gt;0&lt;/code&gt;'th place being the least significant bit. In terms of bitshifts, this means &lt;code&gt;(j&amp;gt;&amp;gt;i)&amp;amp;1==1&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Q4AfO.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Q4AfO.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Rado graph is &lt;a href=&quot;https://en.wikipedia.org/wiki/Universal_graph&quot; rel=&quot;nofollow noreferrer&quot;&gt;universal&lt;/a&gt; in that any finite graph is a &lt;a href=&quot;https://en.wikipedia.org/wiki/Subgraph&quot; rel=&quot;nofollow noreferrer&quot;&gt;subgraph&lt;/a&gt; of it. This means that any finite graph can be embedded in the Rado graph: to each vertex of the finite graph, assign a distinct vertex of the Rado graph so that any two vertices of the original graph have an edge if and only if the corresponding vertices of the Rado graph have an edge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to output such an embedding for a finite graph given as input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TODO: Lots of stuff&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2016-07-31T09:16:37.610" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9712" PostTypeId="2" ParentId="2140" CreationDate="2016-07-31T13:39:20.103" Score="0" Body="&lt;h1&gt;Expand constants in a Brainfuck program&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-generation&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-generation&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brainfuck&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brainfuck&amp;#39;&quot; rel=&quot;tag&quot;&gt;brainfuck&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When golfing in &lt;a href=&quot;http://esolangs.org/wiki/Brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brainfuck&lt;/a&gt;, Fred can never remember the shortest&#xA;way to write any given constant, and looking it up takes too much time! Luckily,&#xA;Fred remembered that PPCG can help! In this challenge, you'll need to&#xA;convert base-10 numerals their Brainfuck representations.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that takes a string of Brainfuck code&#xA;containing some numbers, like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;72.&amp;gt;105.&amp;gt;33.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and transforms each number into one of its Brainfuck representations, giving (for example) this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-[&amp;gt;+&amp;lt;-------]&amp;gt;-.&amp;gt;+[-&amp;gt;-[&amp;lt;]&amp;gt;--]&amp;gt;.&amp;gt;&amp;gt;-[-[-&amp;lt;]&amp;gt;&amp;gt;+&amp;lt;]&amp;gt;.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Because Fred has not yet learned the secrets of &lt;kbd&gt;Ctrl+C&lt;/kbd&gt;&#xA;&lt;kbd&gt;Ctrl+V&lt;/kbd&gt;, your code must be as small as possible to save&#xA;Fred some valuable typing. Fred also wants to win &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; contests&#xA;with the output, so the code you generate must also be as small as possible.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden; in particular, you cannot scrape&#xA;&lt;a href=&quot;http://esolangs.org/wiki/Brainfuck_constants&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://esolangs.org/wiki/Brainfuck_constants&lt;/a&gt; (or any other site for that&#xA;matter).&lt;/li&gt;&#xA;&lt;li&gt;Your program or function may perform I/O through any of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;default I/O&#xA;methods&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Assume a wrapping implementation with 1-byte cells (i.e. &lt;code&gt;-.&lt;/code&gt; gives &lt;code&gt;ÿ&lt;/code&gt;&#xA;(255)).&lt;/li&gt;&#xA;&lt;li&gt;There will never be a number greater than 255 or less than 0 in the input&#xA;(but you do have to handle 0 correctly!). Your program/function must&#xA;handle all numbers 0-255 (inclusive).&lt;/li&gt;&#xA;&lt;li&gt;You may assume that there are as many temporary cells as necessary to the&#xA;right of the pointer location (but not the left).&lt;/li&gt;&#xA;&lt;li&gt;You may assume that the cell where a number will go and all temporary&#xA;cells are set to 0.&lt;/li&gt;&#xA;&lt;li&gt;When substituting a number, the pointer must end at the cell with the number.&#xA;All temporary cells must be reset to 0.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that there will never be any non-Brainfuck, non-digit&#xA;characters in the input, and that the input will never be empty (i.e. the&#xA;input will match &lt;code&gt;/^[,\.\[\]+\-&amp;lt;&amp;gt;0-9]+$/&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The test cases given below are the output for a program/function using the shortest &quot;wrapping&quot; version of the constants at &lt;a href=&quot;http://esolangs.org/wiki/Brainfuck_constants&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://esolangs.org/wiki/Brainfuck_constants&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input&#xA;Output&#xA;Brainfuck program's output&#xA;&#xA;72.&amp;gt;105.&amp;gt;33.&#xA;-[&amp;gt;+&amp;lt;-------]&amp;gt;-.&amp;gt;+[-&amp;gt;-[&amp;lt;]&amp;gt;--]&amp;gt;.&amp;gt;&amp;gt;-[-[-&amp;lt;]&amp;gt;&amp;gt;+&amp;lt;]&amp;gt;.&#xA;Hi!&#xA;&#xA;255&amp;gt;10++&amp;gt;65&amp;gt;255&amp;lt;+[-&amp;lt;+]-&amp;gt;[-+[-&amp;gt;+]-&amp;lt;.+[-&amp;lt;+]-&amp;gt;]&#xA;-&amp;gt;++++++++++++&amp;gt;&amp;gt;+[+[&amp;lt;]&amp;gt;&amp;gt;+&amp;lt;+]&amp;gt;&amp;gt;-&amp;lt;+[-&amp;lt;+]-&amp;gt;[-+[-&amp;gt;+]-&amp;lt;.+[-&amp;lt;+]-&amp;gt;]&#xA;AAAAAAAAAAAA&#xA;&#xA;&amp;gt;0&amp;gt;48--&amp;gt;255&amp;lt;[&amp;gt;&amp;gt;86.[-]+[-&amp;lt;+]-&amp;lt;-]&#xA;&amp;gt;&amp;gt;-[&amp;gt;+&amp;lt;-----]&amp;gt;-----&amp;gt;-&amp;lt;[&amp;gt;&amp;gt;-[&amp;gt;+&amp;lt;---]&amp;gt;+.[-]+[-&amp;lt;+]-&amp;lt;-]&#xA;VVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVV&#xA;&#xA;&amp;gt;,[&amp;gt;,]&amp;lt;[&amp;lt;]&amp;gt;[.&amp;gt;]&#xA;&amp;gt;,[&amp;gt;,]&amp;lt;[&amp;lt;]&amp;gt;[.&amp;gt;]&#xA;(cat - outputs the input)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your score is your byte count plus the average length of your program/function's output for each number. For example, if a 30 byte program's output had an average length of 13.5, its score would be &lt;code&gt;30 + 13.5 = 43.5&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Helpful Hints&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://esolangs.org/wiki/Brainfuck_constants&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://esolangs.org/wiki/Brainfuck_constants&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Is it tagged correctly? Should this be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; instead of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="56755" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2016-08-01T14:39:40.167" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9716" PostTypeId="1" CreationDate="2016-07-31T20:04:52.430" Score="6" ViewCount="414" Body="&lt;p&gt;The last two Suggested Edit reviews I have reviewed, they were easy rejects. Both were from a new user (&lt;a href=&quot;https://codegolf.stackexchange.com/users/56941/chromozorz&quot;&gt;the same&lt;/a&gt;), and both were golfing/&amp;quot;fixing&amp;quot; the code. I admit to have done this before, but a while ago. I therefore propose that there should be a new box when editing a post.&lt;/p&gt;&#xA;&lt;p&gt;Instead of&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Your edit will be placed in a queue until it is peer reviewed.&lt;/p&gt;&#xA;&lt;p&gt;We welcome all constructive edits, but please make them substantial. Avoid trivial edits unless absolutely necessary.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I suggest there should be a last line:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Your edit will be placed in a queue until it is peer reviewed.&lt;/p&gt;&#xA;&lt;p&gt;We welcome all constructive edits, but please make them substantial. Avoid trivial edits unless absolutely necessary. &lt;strong&gt;Do not&lt;/strong&gt; edit the code unless this is Community Wiki, please &lt;code&gt;[comment](link-to-comment)&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="48922" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-11T13:22:37.910" Title="New users golfing code" Tags="|discussion|editing|new-users|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9717" PostTypeId="1" AcceptedAnswerId="9719" CreationDate="2016-07-31T21:36:22.710" Score="-5" ViewCount="270" Body="&lt;p&gt;Brainf*** is far from a terse language. A (partially) golfed solution may be 1000's of bytes long. Similar to JSF***, these submissions are often autogenerated and will require significant work to create a valid submission which is competitive. My question is what constitutes a serious brainf*** contender?&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="46918" LastEditDate="2016-07-31T22:17:44.470" LastActivityDate="2016-07-31T22:28:06.273" Title="Is Brainfuck considered a serious contender" Tags="|discussion|policy|code-golf|winning-criteria|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9718" PostTypeId="2" ParentId="9716" CreationDate="2016-07-31T21:59:57.210" Score="7" Body="&lt;p&gt;Yes, I think that would be a good idea. New users cannot comment on submissions and editing may seem like the obvious solution so a clear statement advising otherwise seems appropriate. If edits aren't allowed then why not get rid of that functionality? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Personally however, I find it more harmful for users to be submitting incorrect submissions, getting votes for them and potentially winning the challenge than for a user to make an edit to the submission. Otherwise what is the point of PPCG? I can submit 'f' as my answer and I can win... Doesn't seem right.&lt;/p&gt;&#xA;" OwnerUserId="56941" LastEditorUserId="56941" LastEditDate="2016-07-31T23:47:05.273" LastActivityDate="2016-07-31T23:47:05.273" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9719" PostTypeId="2" ParentId="9717" CreationDate="2016-07-31T22:08:38.723" Score="7" Body="&lt;p&gt;We had a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8750/12012&quot;&gt;related discussion&lt;/a&gt; a few month ago, and I like the wording of the answer I linked to.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A serious contender is a submission which makes a serious effort towards optimizing the submission's score within the chosen language(s) and other choices (such as algorithm choice or optional restrictions/bonuses taken).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That's unfortunately still subjective, which is why I worded my comment like I did. (emphasis mine)&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;I don't think&lt;/strong&gt; this is a serious contender for the winning criteria, which is a &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;requirement for all solutions&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;From this question:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Similar to JSF***, these submissions are often autogenerated and will require significant work to create a valid submission which is competitive.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That's the problem right there. You expect to just paste the desired output into a brainfuck generator and post it as an answer, without doing the required &lt;em&gt;significant work&lt;/em&gt;. That's in direct contrast with the proposed definition I cited above, which requires submissions to make &lt;em&gt;a serious effort towards optimizing the submission's score&lt;/em&gt;. For outputs with a pattern that is easily recognizable by humans, most automated generators do rather poorly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since it my comment on it is what prompted this discussion I'll take &lt;a href=&quot;https://codegolf.stackexchange.com/a/87076/12012&quot;&gt;your answer&lt;/a&gt; as an example of a post that &amp;ndash; in my opinion &amp;ndash; is &lt;em&gt;not&lt;/em&gt; a serious contender for a code golf challenge.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;++++++++++&amp;lt;+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++.+.&#xA;+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.&amp;gt;.&amp;lt;------------------------..+.+&#xA;.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.&amp;gt;.&amp;lt;-----------------------...+.+.+.&#xA;+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.&amp;gt;.&amp;lt;----------------------....+.+.+.+.+.+&#xA;.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.&amp;gt;.&amp;lt;---------------------.....+.+.+.+.+.+.+.+.+.&#xA;+.+.+.+.+.+.+.+.+.+.+.+.&amp;gt;.&amp;lt;--------------------......+.+.+.+.+.+.+.+.+.+.+.+.+.+&#xA;.+.+.+.+.+.+.&amp;gt;.&amp;lt;-------------------.......+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.&#xA;&amp;gt;.&amp;lt;------------------........+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.&amp;gt;.&amp;lt;------------&#xA;-----.........+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.&amp;gt;.&amp;lt;----------------..........+.+&#xA;.+.+.+.+.+.+.+.+.+.+.+.+.+.+.&amp;gt;.&amp;lt;---------------...........+.+.+.+.+.+.+.+.+.+.+.&#xA;+.+.+.+.&amp;gt;.&amp;lt;--------------............+.+.+.+.+.+.+.+.+.+.+.+.+.+.&amp;gt;.&amp;lt;------------&#xA;-.............+.+.+.+.+.+.+.+.+.+.+.+.+.&amp;gt;.&amp;lt;------------..............+.+.+.+.+.+&#xA;.+.+.+.+.+.+.&amp;gt;.&amp;lt;-----------...............+.+.+.+.+.+.+.+.+.+.+.&amp;gt;.&amp;lt;----------...&#xA;.............+.+.+.+.+.+.+.+.+.+.&amp;gt;.&amp;lt;---------.................+.+.+.+.+.+.+.+.+.&#xA;&amp;gt;.&amp;lt;--------..................+.+.+.+.+.+.+.+.&amp;gt;.&amp;lt;-------...................+.+.+.&#xA;+.+.+.+.&amp;gt;.&amp;lt;------....................+.+.+.+.+.+.&amp;gt;.&amp;lt;-----.....................+.&#xA;+.+.+.+.&amp;gt;.&amp;lt;----......................+.+.+.+.&amp;gt;.&amp;lt;---.......................+.+.+.&#xA;&amp;gt;.&amp;lt;--........................+.+.&amp;gt;.&amp;lt;-.........................+.&amp;gt;.&amp;lt;.............&#xA;.............&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;p&gt;While you made some improvements over the score you initially claimed (without making the programs public), there are many relatively straightforward ways to improve your score.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The 65 &lt;code&gt;+&lt;/code&gt; characters at the start can be replaced with any of &lt;a href=&quot;https://esolangs.org/wiki/Brainfuck_constants#65&quot; rel=&quot;nofollow noreferrer&quot;&gt;these algorithms&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There's no need to write &lt;code&gt;.+&lt;/code&gt; 26 six times. Create a loop instead.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The same remarks apply to the long runs of &lt;code&gt;-&lt;/code&gt; and &lt;code&gt;.&lt;/code&gt; in your answer.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Most importantly, the twenty-six lines of output are &lt;em&gt;very&lt;/em&gt; similar. Instead of hardcoding each line separately, try wrapping your logic in a loop.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is by far the most difficult step, but it's ultimately what saves the greatest amount of bytes. In its current form, your program is comparable to the Python answer&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;print'''ABCDEFGHIJKLMNOPQRSTUVWXYZ&#xA;BBCDEFGHIJKLMNOPQRSTUVWXYZ&#xA;CCCDEFGHIJKLMNOPQRSTUVWXYZ&#xA;DDDDEFGHIJKLMNOPQRSTUVWXYZ&#xA;EEEEEFGHIJKLMNOPQRSTUVWXYZ&#xA;FFFFFFGHIJKLMNOPQRSTUVWXYZ&#xA;GGGGGGGHIJKLMNOPQRSTUVWXYZ&#xA;HHHHHHHHIJKLMNOPQRSTUVWXYZ&#xA;IIIIIIIIIJKLMNOPQRSTUVWXYZ&#xA;JJJJJJJJJJKLMNOPQRSTUVWXYZ&#xA;KKKKKKKKKKKLMNOPQRSTUVWXYZ&#xA;LLLLLLLLLLLLMNOPQRSTUVWXYZ&#xA;MMMMMMMMMMMMMNOPQRSTUVWXYZ&#xA;NNNNNNNNNNNNNNOPQRSTUVWXYZ&#xA;OOOOOOOOOOOOOOOPQRSTUVWXYZ&#xA;PPPPPPPPPPPPPPPPQRSTUVWXYZ&#xA;QQQQQQQQQQQQQQQQQRSTUVWXYZ&#xA;RRRRRRRRRRRRRRRRRRSTUVWXYZ&#xA;SSSSSSSSSSSSSSSSSSSTUVWXYZ&#xA;TTTTTTTTTTTTTTTTTTTTUVWXYZ&#xA;UUUUUUUUUUUUUUUUUUUUUVWXYZ&#xA;VVVVVVVVVVVVVVVVVVVVVVWXYZ&#xA;WWWWWWWWWWWWWWWWWWWWWWWXYZ&#xA;XXXXXXXXXXXXXXXXXXXXXXXXYZ&#xA;YYYYYYYYYYYYYYYYYYYYYYYYYZ&#xA;ZZZZZZZZZZZZZZZZZZZZZZZZZZ'''&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which does what it's supposed to, but it's certainly not well golfed.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For comparison's sake, &lt;a href=&quot;https://codegolf.stackexchange.com/a/87094/12012&quot;&gt;my own brainfuck answer&lt;/a&gt; is 95 bytes long, and thus over 93% shorter than your answer (1453 bytes). I'm not saying you shouldn't post an answer unless it is close to being optimal (my own answer might also not be optimal), but if it is 15 times longer than another answer in the same language, I wouldn't consider it a serious contender.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-07-31T22:28:06.273" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9721" PostTypeId="2" ParentId="9717" CreationDate="2016-07-31T22:27:05.207" Score="5" Body="&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt;: You're asking the wrong question. Being &quot;a serious contender&quot; is about the &lt;em&gt;answer&lt;/em&gt;, not the &lt;em&gt;language&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code-Golf is not about having the absolute lowest byte-count at all costs and everything else is off-topic. Otherwise we would have banned non-golfing languages a long time ago, and everybody would answer exclusively in jelly. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code-Golf is about using a language in new and unusual ways to make the program shorter. Sometimes, intentionally using a language that isn't ideal makes the challenge more fun. I'd rather see a well-golfed 300 byte brainfuck solution than a language that does exactly what the challenge asks for in 0 bytes. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I assume your question is about the text in the help-center that says&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;All solutions to challenges should be a serious contender for the winning criteria in use.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This doesn't mean that all solutions must use a language that &lt;em&gt;might possibly be the shortest&lt;/em&gt;. It just means that you must make effort to get the best score possible in whatever language you choose. For example, a brainfuck solution filled with comments and NOPs is &lt;em&gt;clearly&lt;/em&gt; not a serious contender, but that has nothing to do with the language of choice. The same is true about a J or Perl or pyth answer. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Look at &lt;a href=&quot;https://codegolf.stackexchange.com/a/68494/31716&quot;&gt;this brainfuck answer&lt;/a&gt;&#xA;to the 'Hello world' catalogue. It's one of the longest answers on there, but I would say it's definitely the most impressive. &lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-07-31T22:27:05.207" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9723" PostTypeId="2" ParentId="2140" CreationDate="2016-08-01T14:28:05.223" Score="3" Body="&lt;h1&gt;Xor A Rational Number&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Consider the fraction &lt;code&gt;3/5&lt;/code&gt; in base &lt;code&gt;2&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0.10011001100110011001100110011...&#xA;\___/\__/&#xA; (a)  (b)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It has a &quot;regular&quot; or non-repeating part &lt;code&gt;(a)&lt;/code&gt; and a repeated part &lt;code&gt;(b)&lt;/code&gt;. Let's go ahead and shift it right by one bit and &lt;code&gt;xor&lt;/code&gt; it with the original:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; x           = 0.10011001100110011001100110011...&#xA;(x &amp;gt;&amp;gt; 1)     = 0.01001100110011001100110011001...&#xA;(x &amp;gt;&amp;gt; a) ^ x = 0.11010101010101010101010101010...&#xA;               \__/\/&#xA;               (a) (b)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;By examining the regular &lt;code&gt;(a)&lt;/code&gt; and repeating &lt;code&gt;(b)&lt;/code&gt; parts, we find that &lt;code&gt;(x &amp;gt;&amp;gt; 1) ^ x = 5/6&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Two whole numbers &lt;code&gt;0 &amp;lt; x, y &amp;lt; 256&lt;/code&gt; such that &lt;code&gt;0 &amp;lt; x/y &amp;lt; 1&lt;/code&gt; and &lt;code&gt;gcd(x, y) = 1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Input can be through STDIN or function arguments&lt;/li&gt;&#xA;&lt;li&gt;Input passed in any simple format for two decimals is acceptable, e.g. &lt;code&gt;x y&lt;/code&gt;, &lt;code&gt;x\ny&lt;/code&gt;, &lt;code&gt;(x,y)&lt;/code&gt;, &lt;code&gt;[x, y]&lt;/code&gt;, &lt;code&gt;x/y&lt;/code&gt;, &lt;code&gt;x%y&lt;/code&gt; (Haskell)&lt;/li&gt;&#xA;&lt;li&gt;Input &lt;em&gt;must&lt;/em&gt; be in base &lt;code&gt;10&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The numerator and denominator of &lt;code&gt;((x/y) &amp;gt;&amp;gt; 1) ^ (x/y)&lt;/code&gt;, in base &lt;code&gt;10&lt;/code&gt;, in any clear output format. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The submission may be a function or full program&lt;/li&gt;&#xA;&lt;li&gt;The output fraction does not have to be in its most reduced form&lt;/li&gt;&#xA;&lt;li&gt;Builtins for rational number &lt;code&gt;xor&lt;/code&gt; are not allowed&lt;/li&gt;&#xA;&lt;li&gt;Infinite precision rational number types are allowed&lt;/li&gt;&#xA;&lt;li&gt;This is code golf so shortest answer in bytes wins! (Tie break by first submission)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;More tests upon request or when this question is posted.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3/5 -&amp;gt; 5/6&#xA;1/2 -&amp;gt; 3/4&#xA;1/3 -&amp;gt; 4/6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not entirely sure whether this has a more or less trivial solution...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code golf so shortest answer is bytes wins!&lt;/p&gt;&#xA;" OwnerUserId="48962" LastEditorUserId="48962" LastEditDate="2016-08-01T16:53:26.813" LastActivityDate="2016-08-01T16:53:26.813" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="9724" PostTypeId="2" ParentId="2140" CreationDate="2016-08-01T14:49:01.680" Score="1" Body="&lt;h1&gt;Draw Concentric Squarephabets&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmongrov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmongrov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmongrov-complexity&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that, given an input integer &lt;code&gt;n&lt;/code&gt;, outputs a concentric squarephabet of size &lt;code&gt;n×n&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;em&gt;concentric squarephabet&lt;/em&gt; is an ASCII-art square of concentric rings, where the outside ring of characters are &lt;code&gt;A&lt;/code&gt;s, the second &lt;code&gt;B&lt;/code&gt;s, the third &lt;code&gt;C&lt;/code&gt;s, etc. For example, a 25×25 squarephabet looks like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;AAAAAAAAAAAAAAAAAAAAAAAAA&#xA;ABBBBBBBBBBBBBBBBBBBBBBBA&#xA;ABCCCCCCCCCCCCCCCCCCCCCBA&#xA;ABCDDDDDDDDDDDDDDDDDDDCBA&#xA;ABCDEEEEEEEEEEEEEEEEEDCBA&#xA;ABCDEFFFFFFFFFFFFFFFEDCBA&#xA;ABCDEFGGGGGGGGGGGGGFEDCBA&#xA;ABCDEFGHHHHHHHHHHHGFEDCBA&#xA;ABCDEFGHIIIIIIIIIHGFEDCBA&#xA;ABCDEFGHIJJJJJJJIHGFEDCBA&#xA;ABCDEFGHIJKKKKKJIHGFEDCBA&#xA;ABCDEFGHIJKLLLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLLLKJIHGFEDCBA&#xA;ABCDEFGHIJKKKKKJIHGFEDCBA&#xA;ABCDEFGHIJJJJJJJIHGFEDCBA&#xA;ABCDEFGHIIIIIIIIIHGFEDCBA&#xA;ABCDEFGHHHHHHHHHHHGFEDCBA&#xA;ABCDEFGGGGGGGGGGGGGFEDCBA&#xA;ABCDEFFFFFFFFFFFFFFFEDCBA&#xA;ABCDEEEEEEEEEEEEEEEEEDCBA&#xA;ABCDDDDDDDDDDDDDDDDDDDCBA&#xA;ABCCCCCCCCCCCCCCCCCCCCCBA&#xA;ABBBBBBBBBBBBBBBBBBBBBBBA&#xA;AAAAAAAAAAAAAAAAAAAAAAAAA&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(and yes I typed that by hand ☺)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the input is an even number, the centre of the squarephabet will be a 2×2 square instead of a single letter. For example, for input &lt;code&gt;8&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;AAAAAAAA&#xA;ABBBBBBA&#xA;ABCCCCBA&#xA;ABCDDCBA&#xA;ABCDDCBA&#xA;ABCCCCBA&#xA;ABBBBBBA&#xA;AAAAAAAA&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;The input to your program or function will never be less than 1 or greater than 52 (26×2). This means you do not have to deal with letters after &lt;code&gt;Z&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You may output uppercase or lowercase letters, but you must be consistent in your choice.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input&#xA;Output&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;A&#xA;&#xA;2&#xA;AA&#xA;AA&#xA;&#xA;3&#xA;AAA&#xA;ABA&#xA;AAA&#xA;&#xA;10&#xA;AAAAAAAAAA&#xA;ABBBBBBBBA&#xA;ABCCCCCCBA&#xA;ABCDDDDCBA&#xA;ABCDEEDCBA&#xA;ABCDEEDCBA&#xA;ABCDDDDCBA&#xA;ABCCCCCCBA&#xA;ABBBBBBBBA&#xA;AAAAAAAAAA&#xA;&#xA;25&#xA;AAAAAAAAAAAAAAAAAAAAAAAAA&#xA;ABBBBBBBBBBBBBBBBBBBBBBBA&#xA;ABCCCCCCCCCCCCCCCCCCCCCBA&#xA;ABCDDDDDDDDDDDDDDDDDDDCBA&#xA;ABCDEEEEEEEEEEEEEEEEEDCBA&#xA;ABCDEFFFFFFFFFFFFFFFEDCBA&#xA;ABCDEFGGGGGGGGGGGGGFEDCBA&#xA;ABCDEFGHHHHHHHHHHHGFEDCBA&#xA;ABCDEFGHIIIIIIIIIHGFEDCBA&#xA;ABCDEFGHIJJJJJJJIHGFEDCBA&#xA;ABCDEFGHIJKKKKKJIHGFEDCBA&#xA;ABCDEFGHIJKLLLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLLLKJIHGFEDCBA&#xA;ABCDEFGHIJKKKKKJIHGFEDCBA&#xA;ABCDEFGHIJJJJJJJIHGFEDCBA&#xA;ABCDEFGHIIIIIIIIIHGFEDCBA&#xA;ABCDEFGHHHHHHHHHHHGFEDCBA&#xA;ABCDEFGGGGGGGGGGGGGFEDCBA&#xA;ABCDEFFFFFFFFFFFFFFFEDCBA&#xA;ABCDEEEEEEEEEEEEEEEEEDCBA&#xA;ABCDDDDDDDDDDDDDDDDDDDCBA&#xA;ABCCCCCCCCCCCCCCCCCCCCCBA&#xA;ABBBBBBBBBBBBBBBBBBBBBBBA&#xA;AAAAAAAAAAAAAAAAAAAAAAAAA&#xA;&#xA;52&#xA;AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA&#xA;ABBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBA&#xA;ABCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCBA&#xA;ABCDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDCBA&#xA;ABCDEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEDCBA&#xA;ABCDEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEDCBA&#xA;ABCDEFGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGFEDCBA&#xA;ABCDEFGHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHGFEDCBA&#xA;ABCDEFGHIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIHGFEDCBA&#xA;ABCDEFGHIJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJIHGFEDCBA&#xA;ABCDEFGHIJKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKJIHGFEDCBA&#xA;ABCDEFGHIJKLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMMMMMMMMMMMMMMMMMMMMMMMMMMMMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNNNNNNNNNNNNNNNNNNNNNNNNNNMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOOOOOOOOOOOOOOOOOOOOOOOONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOPPPPPPPPPPPPPPPPPPPPPPONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOPQQQQQQQQQQQQQQQQQQQQPONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOPQRRRRRRRRRRRRRRRRRRQPONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOPQRSSSSSSSSSSSSSSSSRQPONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOPQRSTTTTTTTTTTTTTTSRQPONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOPQRSTUUUUUUUUUUUUTSRQPONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOPQRSTUVVVVVVVVVVUTSRQPONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOPQRSTUVWWWWWWWWVUTSRQPONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOPQRSTUVWXXXXXXWVUTSRQPONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOPQRSTUVWXYYYYXWVUTSRQPONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOPQRSTUVWXYZZYXWVUTSRQPONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOPQRSTUVWXYYYYXWVUTSRQPONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOPQRSTUVWXXXXXXWVUTSRQPONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOPQRSTUVWWWWWWWWVUTSRQPONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOPQRSTUVVVVVVVVVVUTSRQPONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOPQRSTUUUUUUUUUUUUTSRQPONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOPQRSTTTTTTTTTTTTTTSRQPONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOPQRSSSSSSSSSSSSSSSSRQPONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOPQRRRRRRRRRRRRRRRRRRQPONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOPQQQQQQQQQQQQQQQQQQQQPONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOPPPPPPPPPPPPPPPPPPPPPPONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNOOOOOOOOOOOOOOOOOOOOOOOONMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMNNNNNNNNNNNNNNNNNNNNNNNNNNMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLMMMMMMMMMMMMMMMMMMMMMMMMMMMMLKJIHGFEDCBA&#xA;ABCDEFGHIJKLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLKJIHGFEDCBA&#xA;ABCDEFGHIJKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKJIHGFEDCBA&#xA;ABCDEFGHIJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJIHGFEDCBA&#xA;ABCDEFGHIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIHGFEDCBA&#xA;ABCDEFGHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHGFEDCBA&#xA;ABCDEFGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGFEDCBA&#xA;ABCDEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEDCBA&#xA;ABCDEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEDCBA&#xA;ABCDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDCBA&#xA;ABCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCBA&#xA;ABBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBA&#xA;AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer wins. Good luck!&lt;/p&gt;&#xA;" OwnerUserId="56755" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-08-01T14:49:01.680" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9725" PostTypeId="2" ParentId="9691" CreationDate="2016-08-01T16:10:04.743" Score="2" Body="&lt;p&gt;Yes, such languages are valid, with the following caveats:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A simulator must be available that can run the code. In order for the submission to be competitive, along with any other challenge-specific requirements, the simulator must have existed prior to the posting of the challenge.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenges pose a bit of a problem, since the speed of execution is directly linked to the clock speed. We will need a default clock speed for such challenges, with the option for challenge authors to override this default if they so please. I propose the semi-arbitrary speed of 300 MHz, which is based on current commercial FPGA's clock speeds.&lt;/li&gt;&#xA;&lt;li&gt;I/O also poses a bit of a problem, but that's just because we haven't had many proposals on the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/45941&quot;&gt;I/O methods meta post&lt;/a&gt;. Surely, any of the allowed methods for assembly language (such as input and output through a specified memory block) would also be acceptable for HDLs.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-08-01T16:10:04.743" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9726" PostTypeId="1" AcceptedAnswerId="9728" CreationDate="2016-08-01T18:38:42.790" Score="1" ViewCount="79" Body="&lt;p&gt;I was curious why does it permit users to close their own question. What is the rational behind this? Is there any reason a user should be allowed to do this?&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="46918" LastEditDate="2016-08-01T18:45:56.750" LastActivityDate="2016-08-01T20:26:27.233" Title="Closing one's own question as a dupe" Tags="|discussion|support|duplicates|closed-questions|vote-to-close|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9727" PostTypeId="2" ParentId="2447" CreationDate="2016-08-01T18:48:40.780" Score="8" Body="&lt;h1&gt;Programs running on FPGAs may take input or give output through transceivers.&lt;/h1&gt;&#xA;" OwnerUserId="4256" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-02-28T09:28:42.660" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="9728" PostTypeId="2" ParentId="9726" CreationDate="2016-08-01T20:26:27.233" Score="2" Body="&lt;p&gt;On the traditional Q&amp;amp;A sites on the network, the question asker has a problem in mind that they are trying to solve when they ask their question. When another user casts a close-as-duplicate vote, the OP is given a dialog to close the question as a duplicate that says, &quot;Yes, [the dupe target question] answered my question&quot;. This makes sense on Q&amp;amp;A-oriented sites.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the non-Q&amp;amp;A sites on the network (PPCG, Code Review, and Puzzling), the situation is a bit different. Posters don't have questions that they need answered - they have challenges to pose to the community (PPCG and Puzzling), or have working code that they want feedback on (Code Review), so the wording on the dialog is less than ideal. In a perfect world, on these sites, the OP's vote would not weigh any more heavily than the other users' votes. Unfortunately, the Stack Exchange team is unlikely to make those customizations for just three sites, so we have to live with the current system.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2016-08-01T20:26:27.233" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9730" PostTypeId="2" ParentId="2140" CreationDate="2016-08-02T03:09:40.133" Score="2" Body="&lt;h1&gt;The Enemy's Gate is Down! (Ender's Game)&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Please note this is a work in progress&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your challenge should you choose to accept it is to play ender's game to win &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; style, in honor of Martin Ender first receiving 100k rep! You will split up into teams. You are red if you are an even post and blue if you are odd.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is a simplified ascii representation of the map.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;WWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWW&#xA;W       1                        F                         2    W&#xA;W                  WwW                                          W&#xA;W        WWW                                                    W&#xA;W                                            WWWWWWWW           W&#xA;W                WWWWWWWWWWWWWWWWW                              W  &#xA;W                                                               W  &#xA;W                                                               W  &#xA;W             WWWWWWWWW                    WWWWWWWWWWW          W  &#xA;W                                                               W  &#xA;W                              WWWWW                            W  &#xA;W                                                               W&#xA;W       3                        G                         4    W&#xA;WWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWW&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your gate is represented by the &quot;F&quot; and the enemies gate is &quot;G&quot;. W's represent walls which will be arranged in an unbiased distribution. The goal is to get to the enemies gate first. Each turn you will output a number from 0-15. &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 0-7 will allow you to &quot;push&quot; off of a block assuming there is a block in the 8 blocks closest to you (orthagonally or diagonally&quot;)&#xA;8-17 allows you to shoot a bullet in a given direction which will continue to travel in a given direction. &#xA;It will break upon hitting a wall or another player. The bullet represented by &quot;P&quot; on the ascii map is iterated after each step. Any player that drifts into it will also be killed. &#xA;&#xA;Directions&#xA;&#xA;567&#xA;4U0&#xA;321&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The winning team is the team which either captures the flag first the last man (bot/woman) standing!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All submission are deterministic java programs. A psuedorandom generator will be provided. The winning team is the team which wins the first game, (if there are ties).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Games will be halted after a significant number (1000) turns. I may allow multiple copies of the same bot on each team to make it more interesting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Collisions with players are treated like collisions with walls.&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="46918" LastEditDate="2016-08-03T11:47:11.480" LastActivityDate="2016-08-03T11:47:11.480" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9733" PostTypeId="2" ParentId="465" CreationDate="2016-08-02T19:59:16.230" Score="3" Body="&lt;p&gt;I agree that we should close early. We are now at a stage where we have more reviewers than things to review (within a 12 hour period), so should vote to close whenever a question is close-worthy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, we should be just as ready to reopen questions when they are reopen-worthy. It must be a two-way street, or our system will fall over.&lt;/p&gt;&#xA;" OwnerUserId="43394" LastActivityDate="2016-08-02T19:59:16.230" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9740" PostTypeId="2" ParentId="2140" CreationDate="2016-08-03T11:15:36.580" Score="-2" Body="&lt;h1&gt;Alphabet Circle&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;This post got very negative feedback, so it's apparent that it needs tweaking in the sandbox before I attempt to repost it on PCG&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;With all the new alphabet xxx challenges, I've decided I'll give my own challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An Integer, (or your languages equivalent) &lt;code&gt;r&lt;/code&gt;, such that 0 &amp;lt; r ≤ 26. (you don't need to validate this)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An alphabet circle. Must meet the following criteria:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Smoothly interpolated from A at the center and Z at the edge.&lt;/li&gt;&#xA;&lt;li&gt;Each point in the circle is the distance from the center  offset so that 0 = A, 1 = B, 2 = C etc...&lt;/li&gt;&#xA;&lt;li&gt;Be printed to STDOUT&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;r=26&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/FUKr5.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/FUKr5.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;r=15&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/jyRl9.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/jyRl9.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Boilerplate&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anonymous classes and functions are fine. General Code Golf rules apply. Shortest code in bytes wins!&lt;sup&gt;&lt;sup&gt;&lt;sup&gt;Except Jelly&lt;/sup&gt;&lt;/sup&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="18185" LastActivityDate="2016-08-03T11:15:36.580" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9741" PostTypeId="2" ParentId="2140" CreationDate="2016-08-03T12:16:42.290" Score="2" Body="&lt;h1&gt;Golf an InterpretMe interpreter (in any language other than InterpretMe)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a very simple challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The joke language InterpretMe consists of one command; &lt;code&gt;*&lt;/code&gt;, which causes the program to take input of an InterpretMe program and execute it. An InterpretMe  program will interpret as many InterpretMe programs as there are &lt;code&gt;*&lt;/code&gt; in input. Your goal is to create a program that interprets InterpretMe in as few bytes as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test cases consist not of input and output, but input and termination. A newline denotes a new input to be interpreted as InterpretMe.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1. *   (executes input as an interpret me program, finishes)&#xA;2. *   (^same)&#xA;3. **  (executes input as an interpret me program, then does this again after the first program is done, finishes)&#xA;4. hi  (nothing, first star of previous line finishes)&#xA;5. **  (same as the other two star line)&#xA;6. hi  (nothing, first star of previous line finishes)&#xA;7. hi  (nothing, second star of line 5 finishes, so second star of line 3 finishes, so line 2 finishes, so line one finishes)&#xA;[termination]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;hi  (does nothing and finishes)&#xA;[termination]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;*hi  (executes inputted program, finishes)&#xA;*yo  (executes inputted program, finishes)&#xA;hey  (nothing)&#xA;[termination]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Sandbox&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;How can I make this challenge more clear? I understand that this challenge is simple, but that is part of the point; it sees how small a program can be for this purpose&lt;/p&gt;&#xA;" OwnerUserId="55896" LastEditorUserId="55896" LastEditDate="2016-08-04T07:31:14.640" LastActivityDate="2016-08-04T07:31:14.640" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9743" PostTypeId="2" ParentId="2140" CreationDate="2016-08-03T15:52:17.743" Score="0" Body="&lt;h1&gt;Convert hexagonal coordinates to index&lt;/h1&gt;&#xA;&lt;p&gt;Your job is to, given the size of the hexagon and a pair of axial coordinates, return the index as if all the rows were laid out side by side.&lt;/p&gt;&#xA;&lt;p&gt;Here's an example mapping for size 3:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(q,r), 3&#xA;&#xA;       (0,0) (1,0) (2,0)&#xA;    (-1,1) (0,1) (1,1) (2,1)&#xA;(-2,2) (-1,2) (0,2) (1,2) (2,2)&#xA;   (-2,3) (-1,3) (0,3) (1,3)&#xA;      (-2,4) (-1,4) (0,4)&#xA;&#xA;maps to&#xA;&#xA;    00 01 02&#xA;  03 04 05 06&#xA;07 08 09 10 11&#xA; 12 13 14 15&#xA;  16 17 18&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here's the formula I found (could be improved):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;i=index&#xA;s=size&#xA;&#xA;i = q + sum( ( 2 * s - 0.5 - abs( x - s + 0.5 ) ) for x in 1..r )&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Test cases (0-based indexing):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(q, r, s) -&amp;gt; i&#xA;&#xA;(0, 0, 1)  -&amp;gt; 0&#xA;(0, 0, 50) -&amp;gt; 0&#xA;(0, 3, 3)  -&amp;gt; 14&#xA;(-3, 5, 4) -&amp;gt; 28&#xA;(5, 2, 12) -&amp;gt; 18&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Meta notes:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should I include links to axial coordinates and centered hexagonal numbers?&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Or, instead, should I explain axial coordinates better?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Should I include the formula I came up with?&lt;/li&gt;&#xA;&lt;li&gt;More test cases, or are those fine?&lt;/li&gt;&#xA;&lt;li&gt;More exposition?&lt;/li&gt;&#xA;&lt;li&gt;I'm also planning to do a challenge the other way around, is that ok?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42855" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-03T16:07:28.977" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9744" PostTypeId="2" ParentId="2140" CreationDate="2016-08-03T16:48:58.183" Score="1" Body="&lt;h2&gt;&lt;em&gt;THIS A QUESTION IN PROGRESS&lt;/em&gt;&lt;/h2&gt;&#xA;&lt;h2&gt;ASCII Art converter&lt;/h2&gt;&#xA;&lt;p&gt;see &lt;a href=&quot;https://esolangs.org/wiki/ASCII_art&quot; rel=&quot;nofollow noreferrer&quot;&gt;ASCII Art&lt;/a&gt; on Esolangs&lt;/p&gt;&#xA;&lt;p&gt;Your task is to take input of a brainf*** program and output its equivalent ASCII art program. Your challenge: You may not use the following symbols in your program: &lt;code&gt;\ / - | _ #&lt;/code&gt; Standard loopholes not allowed...&lt;/p&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest answer in bytes wins&lt;/p&gt;&#xA;&lt;h3&gt;OR&lt;/h3&gt;&#xA;&lt;h2&gt;ACII Art Interpreter&lt;/h2&gt;&#xA;&lt;p&gt;Your task is to create an interpreter for the ASCII art language.&#xA;ASCII Art is a variant of brainf*** where characters are instead ASCII art figures 5 lines tall.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;lt;&lt;/code&gt; looks like&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; /&#xA;/&#xA;\&#xA; \&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;gt;&lt;/code&gt; looks like&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;\&#xA; \&#xA; /&#xA;/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;+&lt;/code&gt; looks like&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  |&#xA;  |&#xA;-----&#xA;  |&#xA;  |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;-&lt;/code&gt; looks like&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;-----&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;[&lt;/code&gt; looks like&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;____&#xA;|&#xA;|&#xA;|&#xA;|___&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;]&lt;/code&gt; looks like&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;____&#xA;   |&#xA;   |&#xA;   |&#xA;___|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;.&lt;/code&gt; looks like&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;##&#xA;##&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;,&lt;/code&gt; looks like&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;##&#xA;##&#xA;_|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Characters that are less than 5 characters tall may be placed anywhere within the top line and bottom line of input.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;____________________ top line&#xA;     \&#xA;      \&#xA;      /&#xA;     /&#xA;        &amp;lt;--- gap because this char is only 5 characters tall&#xA;_____________________bottom line&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;There may be any amount of white space between characters. Also characters can be &amp;quot;nested&amp;quot; in each other, as long as they do not touch. EG&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;____ |  ##&#xA;|    |  ##&#xA;|  -----_|&#xA;|    |&#xA;|___ |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;is perfectly valid&lt;/p&gt;&#xA;&lt;p&gt;Your code should not allow improperly formatted ASCII art, and should print to Standard error. For example, the following code should not work&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;\&#xA; \&#xA;  |&#xA;  |&#xA;  |____&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins!&lt;br /&gt;&#xA;Additional tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="52193" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-08T19:07:37.210" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9746" PostTypeId="2" ParentId="9646" CreationDate="2016-08-03T17:31:28.220" Score="0" Body="&lt;h1&gt;Count the bytes of the file after all data unrelated to the execution* of the code after the file is compressed&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This would give a more accurate idea of the amount of information stored in the program than simply counting raw bytes&lt;/p&gt;&#xA;&#xA;&lt;p&gt;*e.g.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Metadata (date, time)&lt;/li&gt;&#xA;&lt;li&gt;2D position of blocks&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2016-08-03T17:31:28.220" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9750" PostTypeId="2" ParentId="2140" CreationDate="2016-08-03T21:41:46.253" Score="1" Body="&lt;p&gt;A &lt;a href=&quot;http://oeis.org/wiki/Meanders_filling_out_an_n-by-k_grid_%28not_reduced_for_symmetry%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;meander&lt;/a&gt; is a self-avoiding closed curve which intersects a line a number of times.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is, given a self-avoiding walk on a lattice/grid, produce a meander &lt;em&gt;a la&lt;/em&gt; the following:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{{{3, 4}}, {1, 2}, {2, 6}, {6, 7}, {7, 3}, {3, 4}, {4, 8}, {8, 12}, {12, 11}, {11, 10}, {10, 9}, {9, 5}, {5, 1}}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/3ysDW.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/3ysDW.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;or similar.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Inputs&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a={{{3, 5}}, {{1, 2}, {2, 3}, {3, 8}, {8, 9}, {9, 4}, {4, 5}, {5, 10}, {10, 15}, {15, 14}, {14, 13}, {13, 8}, {8, 7}, {7, 12}, {12, 11}, {11, 6}, {6, 1}}}&#xA;b={{{3, 6}}, {{1, 2}, {2, 8}, {8, 9}, {9, 3}, {3, 4}, {4, 10}, {10, 11}, {11, 5}, {5, 6}, {6, 12}, {12, 18}, {18, 17}, {17, 16}, {16, 10}, {10, 9}, {9, 15}, {15, 14}, {14, 13}, {13, 7}, {7, 1}}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/yZK2G.png&quot; width=&quot;100&quot; height=&quot;150&quot;&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/7cqqz.png&quot; width=&quot;100&quot; height=&quot;150&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the above examples, the numbers correspond to a grid, bottom to top, left to right, so &lt;code&gt;1&lt;/code&gt; is bottom-left, and &lt;code&gt;18&lt;/code&gt; on a &lt;code&gt;3*6&lt;/code&gt; grid is top-right. The orientation of your grid doesn't have to follow this order: it can have any desired orientation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can assume dimensions of the grid are given at the begining of the input, as per the obove examples.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Feel free to use either pre-existing images - &lt;em&gt;eg&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/cJumb.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/cJumb.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/nfP7X.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/nfP7X.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/Jl3dN.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Jl3dN.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/TXzce.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/TXzce.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/b4CjV.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/b4CjV.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/kDOXZ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/kDOXZ.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/EyPV4.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/EyPV4.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/gppTs.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/gppTs.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;or generate your own. This is Code Golf, so the shortest answer in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="17326" LastEditorUserId="17326" LastEditDate="2016-08-03T22:21:43.027" LastActivityDate="2016-08-03T22:21:43.027" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9751" PostTypeId="1" CreationDate="2016-08-03T22:42:44.363" Score="7" ViewCount="175" Body="&lt;p&gt;Despite having &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8877/what-qualifies-as-malicious-code&quot;&gt;What qualifies as malicious code?&lt;/a&gt;, the consensus seems really unclear on that point, because &lt;a href=&quot;https://codegolf.stackexchange.com/q/22352/50239&quot;&gt;this question seems to be valid&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/q/87600/50239#comment215027_87600&quot;&gt;that one isn’t&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;In the current case, please note the parsers of such programs tend to be designed to be insecure, so it’s easy to google for examples that crash the program. &lt;strong&gt;In some cases, like python, projects maintainers even &lt;a href=&quot;http://bugs.python.org/issue27291&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;bug closed as not a bug&quot;&gt;refuse to fix such bugs&lt;/a&gt; because the way it happens is considered to be the normal behaviour&lt;/strong&gt;.&lt;br /&gt;&#xA;So the wrong security decision that can be done is to let them work on untrusted code rather than founding more thing that can crash them. &lt;em&gt;&lt;strong&gt;So this can’t even be used for denial of service&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;There are people who think even &lt;a href=&quot;https://codegolf.stackexchange.com/q/22352/50239&quot;&gt;the 2014 post&lt;/a&gt; is still a valid question that doesn't ask for something that can be malicious.&lt;/p&gt;&#xA;&lt;h1&gt;Update :&lt;/h1&gt;&#xA;&lt;p&gt;Don’t vote to close as a duplicate. Both parties refer to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8877/what-qualifies-as-malicious-code&quot;&gt;What qualifies as malicious code?&lt;/a&gt; to explain whether it’s allowed or not. &lt;strong&gt;&lt;em&gt;Please read that &lt;a href=&quot;https://codegolf.stackexchange.com/q/87600/50239#comment215027_87600&quot;&gt;comment&lt;/a&gt; !&lt;/em&gt;&lt;br /&gt;&#xA;As that question isn’t part of what is asked on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8877/what-qualifies-as-malicious-code&quot;&gt;What qualifies as malicious code?&lt;/a&gt;, there’s no reason it can get asnwered on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8877/what-qualifies-as-malicious-code&quot;&gt;What qualifies as malicious code?&lt;/a&gt;&lt;/strong&gt;.&lt;/p&gt;&#xA;" OwnerUserId="50239" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-05T16:18:07.623" Title="Should we systematically treat code that crashes compilers/interpreters as malicious?" Tags="|discussion|policy|" AnswerCount="0" CommentCount="7" ClosedDate="2016-08-05T05:39:39.983" ContentLicense="CC BY-SA 3.0" />
  <row Id="9753" PostTypeId="1" AcceptedAnswerId="9754" CreationDate="2016-08-04T08:06:42.567" Score="6" ViewCount="261" Body="&lt;p&gt;When writing answers I usually post the first slightly golfed version when it is working. I then proceed to golf it down further making various edits as I go. I know it is good to update as you get a better answer, but is it dis/en-couraged to make a lot of edits in a shortish time?&lt;/p&gt;&#xA;" OwnerUserId="38550" LastEditorUserId="31716" LastEditDate="2016-08-04T09:44:25.133" LastActivityDate="2017-08-17T16:37:35.620" Title="Updating answers a lot" Tags="|discussion|answers|editing|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9754" PostTypeId="2" ParentId="9753" CreationDate="2016-08-04T09:38:40.823" Score="9" Body="&lt;p&gt;There's nothing wrong with editing your answer a bunch of times. &lt;a href=&quot;https://codegolf.stackexchange.com/a/103051/31716&quot;&gt;I've done that before&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/a/83276/31716&quot;&gt;other high rep users&lt;/a&gt; have &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69/golf-you-a-quine-for-great-good/47112#47112&quot;&gt;done that before&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If anything, I think these answers are more impressive, since it shows the author is not just in it for the FGITW (fastest gun in the west), but that they're very competitive and keep coming back to the answer to shave off any bytes (or &lt;a href=&quot;https://codegolf.stackexchange.com/posts/74372/revisions&quot;&gt;milliseconds&lt;/a&gt;) they possibly can. &lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="31716" LastEditDate="2017-08-17T16:37:35.620" LastActivityDate="2017-08-17T16:37:35.620" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9755" PostTypeId="2" ParentId="2140" CreationDate="2016-08-04T11:11:24.117" Score="0" Body="&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program must take no input and print &lt;a href=&quot;http://pastebin.com/raw/SBMNH0gJ&quot; rel=&quot;nofollow noreferrer&quot;&gt;this text&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You can have trailing newlines, and spaces after lines.&lt;/li&gt;&#xA;&lt;li&gt;You must not use a builtin or load the text for an external resource.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Score&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, shortest answer in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Did you guess what was the text?&lt;/p&gt;&#xA;" OwnerDisplayName="user54187" LastActivityDate="2016-08-04T11:11:24.117" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9756" PostTypeId="2" ParentId="2140" CreationDate="2016-08-04T12:09:40.793" Score="2" Body="&lt;h1&gt;I wanna be the very best...&lt;/h1&gt;&#xA;&lt;p&gt;Wow, there's so many Pokemon in my Pokedex! Well, there seems too many... I wish there was some good way of sorting all of them!&lt;/p&gt;&#xA;&lt;p&gt;Can you help?&lt;/p&gt;&#xA;&lt;p&gt;Given a list of Pokemon with their stats - level and HP - and a sorting criterion, output the sorted list.&lt;/p&gt;&#xA;&lt;p&gt;An example input would be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;([[&amp;quot;Squirtle&amp;quot;, 2, 10], [&amp;quot;Charizard&amp;quot;, 58, 140], [&amp;quot;Mew&amp;quot;, 75, 160], [&amp;quot;Pichu&amp;quot;, 10, 25]], &amp;quot;alphabetical&amp;quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;As you can see, each Pokemon is shown like so:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[pokemon_name, level, hp]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;There are three sorting options:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;quot;alphabetical&amp;quot;&lt;/code&gt;: The Pokemon are sorted alphabetically.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If two or more Pokemon have identical names, then they are sorted by level, then HP.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;quot;level&amp;quot;&lt;/code&gt;: The Pokemon are sorted by level.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If two or more Pokemon have the same level, then they are sorted alphabetically, then by HP.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;quot;hp&amp;quot;&lt;/code&gt;: The Pokemon are sorted by HP.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If two or more Pokemon have the same HP, then they are sorted alphabetically, then by level.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Specs:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You are guaranteed that:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The &lt;code&gt;hp&lt;/code&gt; and &lt;code&gt;level&lt;/code&gt; of every Pokemon are integers.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;code&gt;level&lt;/code&gt; of a Pokemon will not exceed 100.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;code&gt;hp&lt;/code&gt; will not exceed 200.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If two or more Pokemon share all stats, then they can be arranged however you like.&lt;/p&gt;&#xA;&lt;p&gt;The output will be the sorted list.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;h1&gt;Meta:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the challenge too easy/hard?&lt;/li&gt;&#xA;&lt;li&gt;Any improvements to my explanation?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-04T12:09:40.793" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9759" PostTypeId="2" ParentId="2140" CreationDate="2016-08-04T18:21:54.270" Score="0" Body="&lt;p&gt;Your task is to print the &lt;a href=&quot;https://en.wikipedia.org/wiki/Champernowne_constant&quot; rel=&quot;nofollow&quot;&gt;Champernowne constant&lt;/a&gt; (&lt;a href=&quot;https://oeis.org/A033307&quot; rel=&quot;nofollow&quot;&gt;A033307&lt;/a&gt;) indefinitely.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There must be no spaces in your output and the solution with the fewest bytes wins!&lt;/p&gt;&#xA;" OwnerUserId="53786" LastEditorUserId="53786" LastEditDate="2016-08-04T18:24:09.393" LastActivityDate="2016-08-04T18:24:09.393" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9761" PostTypeId="1" CreationDate="2016-08-05T05:32:25.040" Score="1" ViewCount="154" Body="&lt;p&gt;What prompted this question was a unique case, but I feel that it is generally applicable.&lt;/p&gt;&#xA;&lt;h1&gt;Are non-competing answers allowed on this site?&lt;/h1&gt;&#xA;&lt;p&gt;A non-competing answer is one which is not taken into contention when determining the best/smallest/fastest answer to a question/challenge. Obviously there have been cases where partially finished answers have been posted and updated, answers have been found not to work or otherwise been disqualified, etc..&lt;/p&gt;&#xA;&lt;p&gt;But is a user, at the time of posting an answer, allowed to intend it not to compete? For example, if someone wanted to give an answer in a language which cannot be run / executed in practice, or the designer of a language such as Pyth / GolfScript wanted to show a new feature to be included in an upcoming release, would these be accepted &lt;em&gt;provided that the users make it obvious they are non-competing answers&lt;/em&gt;?&lt;/p&gt;&#xA;&lt;p&gt;If so, how should answers be marked as non-competing?&lt;/p&gt;&#xA;&lt;h2&gt;Specific case:&lt;/h2&gt;&#xA;&lt;p&gt;I'm building a language, QBF, which is &lt;em&gt;not&lt;/em&gt; specifically designed for code-golf. The grammar has been almost static for three years at this point, and I am beginning to look into how it will be formally defined and implemented. So while what it looks like is known, what the base language will have is still under consideration.&lt;/p&gt;&#xA;&lt;p&gt;Needless to say, it does not come close to meeting the criteria to be used in a competing answer.&lt;/p&gt;&#xA;&lt;p&gt;However, I do believe that it would help me to make better design choices, have an existing unit-test archive, and generate questions from other people about issues I wouldn't consider on my own. It may even generate some limited interest in the project, or inform me that the entire thing is a train-wreck and I should start over.&lt;/p&gt;&#xA;" OwnerUserId="18730" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-05T05:32:25.040" Title="Are non-competing answers allowed?" Tags="|discussion|answers|specific-question|" AnswerCount="0" CommentCount="5" ClosedDate="2016-08-05T05:40:51.517" ContentLicense="CC BY-SA 3.0" />
  <row Id="9765" PostTypeId="2" ParentId="2140" CreationDate="2016-08-05T15:07:26.603" Score="1" Body="&lt;h1&gt;Pluralize Words &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(DISCLAIMER: In this challenge, several exceptions and rules are not accounted for. Many plurals are based on sound and not spelling, and still others have no set guidelines. Please do not use this as an actual set of rules for making plurals.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A lot of questions here require using different Algebras. ... Algebra? Algebrae?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;OK, that's it. We're going to get to the bottom of this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to write a program that accepts a word as input and outputs the plural (in standard English rules).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules on making plurals&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Words ending in &lt;code&gt;s&lt;/code&gt;, &lt;code&gt;x&lt;/code&gt;, &lt;code&gt;z&lt;/code&gt;, &lt;code&gt;ch&lt;/code&gt;, &lt;code&gt;sh&lt;/code&gt;, &lt;code&gt;o&lt;/code&gt;, &lt;code&gt;ex&lt;/code&gt;, or &lt;code&gt;ix&lt;/code&gt; have &lt;code&gt;es&lt;/code&gt; added to them. (For example, &lt;code&gt;box&lt;/code&gt; -&gt; &lt;code&gt;boxes&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Words ending in y preceded by a consonant have the &lt;code&gt;y&lt;/code&gt; removed and &lt;code&gt;ies&lt;/code&gt; added to the end. For example, &lt;code&gt;cherry&lt;/code&gt; -&gt; &lt;code&gt;cherries&lt;/code&gt;. (Words like &lt;code&gt;day&lt;/code&gt; with a vowel before the y are treated as normal.)&lt;/li&gt;&#xA;&lt;li&gt;Words ending in &lt;code&gt;f&lt;/code&gt; or &lt;code&gt;fe&lt;/code&gt; are treated as normal.&lt;/li&gt;&#xA;&lt;li&gt;Words ending in &lt;code&gt;us&lt;/code&gt; have the ending changed to &lt;code&gt;i&lt;/code&gt;. (For example, &lt;code&gt;alumnus&lt;/code&gt; -&gt; &lt;code&gt;alumni&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Words ending in &lt;code&gt;is&lt;/code&gt; have the ending changed to &lt;code&gt;es&lt;/code&gt;. (For example, &lt;code&gt;oasis&lt;/code&gt; -&gt; &lt;code&gt;oases&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Words ending in &lt;code&gt;um&lt;/code&gt; are changed to &lt;code&gt;a&lt;/code&gt;. (For example, &lt;code&gt;medium&lt;/code&gt; -&gt; &lt;code&gt;media&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Words ending in &lt;code&gt;a&lt;/code&gt; are changed to &lt;code&gt;ae&lt;/code&gt;. (For example, &lt;code&gt;antenna&lt;/code&gt; -&gt; &lt;code&gt;antennae&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;All other words have &lt;code&gt;s&lt;/code&gt; added to the end.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Several rules have been omitted for simplicity:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You do not have to account for irregular plurals like &lt;code&gt;sheep&lt;/code&gt;. If &lt;code&gt;sheep&lt;/code&gt; was inputted, you would return &lt;code&gt;sheeps&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;code&gt;o&lt;/code&gt;/&lt;code&gt;f&lt;/code&gt;/&lt;code&gt;fe&lt;/code&gt;/&lt;code&gt;ex&lt;/code&gt;/&lt;code&gt;ix&lt;/code&gt; rules have lots of exceptions. &lt;code&gt;knives&lt;/code&gt;, &lt;code&gt;matrices&lt;/code&gt;, etc. I can't find any pattern, however, so these are simplified to one rule.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;chateau&lt;/code&gt; -&gt; &lt;code&gt;chateaux&lt;/code&gt;, &lt;code&gt;man&lt;/code&gt; -&gt; &lt;code&gt;men&lt;/code&gt;, &lt;code&gt;child&lt;/code&gt; -&gt; &lt;code&gt;children&lt;/code&gt;, &lt;code&gt;foot&lt;/code&gt; -&gt; &lt;code&gt;feet&lt;/code&gt;, and &lt;code&gt;mouse&lt;/code&gt; -&gt; &lt;code&gt;mice&lt;/code&gt; have been left out due to ambiguity. You can replace these with &lt;code&gt;chateaus&lt;/code&gt;, &lt;code&gt;mans&lt;/code&gt;, &lt;code&gt;childs&lt;/code&gt;, &lt;code&gt;foots&lt;/code&gt;, and &lt;code&gt;mouses&lt;/code&gt;, respectively.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Words are counted based on spelling, not sound. TimmyD mentioned in the Sandbox:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;For example, Czech (as in, a person from the Czech Republic) goes to Czechs (&quot;checks&quot;) since the ch is pronounced like ck.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Here you would output &lt;code&gt;Czeches&lt;/code&gt; (as it is spelled with a &lt;code&gt;ch&lt;/code&gt;).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A single word, like &lt;code&gt;challenge&lt;/code&gt;. The input will only contain letters a-z. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The pluralized word, based on the rules above, like &lt;code&gt;challenges&lt;/code&gt;. You may have a trailing newline.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output may be case-insensitive.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;algebra&#xA;algebrae&#xA;&#xA;shoe&#xA;shoes&#xA;&#xA;fax&#xA;faxes&#xA;&#xA;datum&#xA;data&#xA;&#xA;bunny&#xA;bunnies&#xA;&#xA;qlwlsh&#xA;qlwlshes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Meta Questions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;UPDATE: I've answered these questions myself. Do you guys think it's ready for posting?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a duplicate? (No, other similar challenges have different scoring)&lt;/li&gt;&#xA;&lt;li&gt;Are there any special cases I left out? (Probably but they'd over-complicate things)&lt;/li&gt;&#xA;&lt;li&gt;When researching this I discovered there are a LOT of little rules. I've omitted some here, but is this too complex to be a feasible challenge? (No)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In addition, have I left out too many rules? (Adding any more would make it too complex)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="38891" LastEditorUserId="38891" LastEditDate="2016-11-22T17:53:23.940" LastActivityDate="2016-11-22T17:53:23.940" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9766" PostTypeId="2" ParentId="8877" CreationDate="2016-08-05T15:44:20.250" Score="-2" Body="&lt;h1&gt;Subtopic: Crashing a program&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I think a distinction should be emphasised between programs that crash different things.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A program that crashes itself only harms the program itself, and only temporarily.&lt;/li&gt;&#xA;&lt;li&gt;Crashing a compiler is unlikely to affect any other program unless other programs happen to be being compiled in parallel (I'm assuming this is rare?).&lt;/li&gt;&#xA;&lt;li&gt;Crashing an interpreter may affect other programs currently running in the same interpreter. The user may not even realise they are running, or that they are in the same language, so may not think to stop them first.&lt;/li&gt;&#xA;&lt;li&gt;Crashing the operating system may lose unsaved work in unrelated programs, which the user running the code may not expect if the challenge only asks for crashing the program itself, or the interpreter or compiler.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;It already seems unclear where in this spectrum to draw the line between acceptable and dangerous. On top of that, how often will a solution intended to crash itself/its interpreter end up also inadvertently crashing the operating system? It's hard to estimate this, but with a large number of answerers all trying to find little known bugs, which are also likely to be little understood, it seems fairly likely that one will be submitted that does more damage than intended (perhaps only crashing &lt;em&gt;some&lt;/em&gt; operating systems, so the poster doesn't realise their code is dangerous).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For this reason I recommend a stricter policy:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;A challenge asking for a program that crashes itself/its compiler/its interpreter is still off topic&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In addition to voting up or down, please comment with any relevant points.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2016-08-05T19:17:24.180" LastActivityDate="2016-08-05T19:17:24.180" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9767" PostTypeId="2" ParentId="8877" CreationDate="2016-08-05T16:39:04.117" Score="7" Body="&lt;h2&gt;Programs that &lt;em&gt;only&lt;/em&gt; crash itself or its compiler/interpreter are on-topic&lt;/h2&gt;&#xA;&lt;p&gt;Our terms of service forbid damaging or detrimentally interfering with the system, so a challenge that asks for this &lt;em&gt;cannot&lt;/em&gt; be on-topic. However, if a program interferes solely with its own execution, it cannot cause harm or have any unexpected consequences.&lt;/p&gt;&#xA;&lt;p&gt;I therefore propose that this kind of challenge is on-topic, provided that it includes (a variant of) the following disclaimer or links to this post.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Your submission may not violate our &lt;a href=&quot;http://stackexchange.com/legal/terms-of-service#3SubscriberContent&quot;&gt;Terms of Service, Section 3: Subscriber Content&lt;/a&gt;. In particular, it may not interfere with other processes, potentially cause loss or theft of data or information, or damage hardware. This includes but is not limited to:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Terminating any process except the program itself or the interpreter/compiler that is executing it.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Changing or deleting any files other than the submission's source code/executable or files that have been created by the program itself.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Creating backdoors or otherwise leaving the system in a vulnerable state.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Disabling any form of failsafe protection.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Using excessive amounts of memory.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Creating an excessive amount of subprocesses.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Filling up the hard drive.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Having any side effects that are not &lt;em&gt;clearly&lt;/em&gt; stated in the post.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-05T18:00:19.180" CommentCount="10" CommunityOwnedDate="2016-08-05T16:44:09.530" ContentLicense="CC BY-SA 3.0" />
  <row Id="9768" PostTypeId="2" ParentId="2140" CreationDate="2016-08-05T17:04:17.607" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Make a Four Color Map&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Four_color_theorem&quot; rel=&quot;nofollow noreferrer&quot;&gt;Four Color Theorem&lt;/a&gt; states that it is possible to color any map separated into contiguous regions using only four colors such that no two adjacent regions are the same color. While the Five Color Theorem &lt;a href=&quot;https://en.wikipedia.org/wiki/Five_color_theorem#Outline_of_the_proof_by_contradiction&quot; rel=&quot;nofollow noreferrer&quot;&gt;has been proven&lt;/a&gt;, no proof exists for only using four colors (though there have also been no counterexamples). Given an image containing white regions separated by black borders, generate a four color map. You may assume that the borders of the image are also region borders and that shared corners do not count as adjacencies.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/40339/four-color-theorem&quot;&gt;Four Color Theorem&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;An image in a standard format containing white regions separated by black borders&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Displaying or writing an image file in any standard format that contains the original image colored according to the Four Color Theorem&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your colorings do not need to match mine, they just need to be valid solutions&#xA;&lt;a href=&quot;https://i.stack.imgur.com/EGnjA.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/EGnjA.jpg&quot; alt=&quot;&quot;&gt;&lt;/a&gt; ====&gt; &lt;a href=&quot;https://i.stack.imgur.com/Lg0sq.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Lg0sq.jpg&quot; alt=&quot;&quot;&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/XWW4Z.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/XWW4Z.jpg&quot; alt=&quot;&quot;&gt;&lt;/a&gt; ====&gt; &lt;a href=&quot;https://i.stack.imgur.com/8NirJ.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/8NirJ.jpg&quot; alt=&quot;&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that the map of the US is not colored by state, it is colored by contiguous borders&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest code wins!&lt;/p&gt;&#xA;" OwnerUserId="57099" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:26.977" LastActivityDate="2016-08-05T17:28:08.373" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9770" PostTypeId="1" AcceptedAnswerId="9772" CreationDate="2016-08-05T17:57:16.970" Score="13" ViewCount="717" Body="&lt;p&gt;CSS can simulate &lt;a href=&quot;https://stackoverflow.com/questions/2497146/is-css-turing-complete&quot;&gt;rule 110&lt;/a&gt; and thus is turing complete. Thus HTML + CSS is considered a programming language for our definition. However, as user @TimmyD mentioned appropriately &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;HTML+CSS is Turing-complete so long as Turing is clicking buttons making the program go. ;-)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;(used with permission).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thus I propose that we should ban HTML/CSS as a language. In the interests of full disclosure I have written an answer myself in HTML/CSS. However I am still in favor of this. This does bring up the broader question of whether a language which requires a human to &quot;crank&quot; it by feeding it meaningless input is a language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://stackoverflow.com/questions/2497146/is-css-turing-complete&quot;&gt;Related discussion on Stack Overflow&lt;/a&gt; (Credits to minxomat for bringing this up in comments).&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2016-08-12T10:45:39.470" Title="Is HTML/CSS a programming language?" Tags="|discussion|policy|css|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9772" PostTypeId="2" ParentId="9770" CreationDate="2016-08-05T18:49:04.753" Score="23" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;CSS is a programming language. From &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/31716&quot;&gt;What is a programming language&lt;/a&gt;, which is the authoritative answer, and has a score of 44:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This definition does not require a language to be Turing-complete (although &lt;strong&gt;it certainly permits any Turing-complete language&lt;/strong&gt;). This is intentional. Turing-completeness is unnecessary for many problems on this site, and there are interesting non-Turing-complete languages and interesting languages whose status with respect to Turing-completeness is unknown.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;(Emphasis added)&lt;/p&gt;&#xA;&lt;p&gt;If it's turing complete, than it meets all of other criteria for &amp;quot;being a language&amp;quot; automatically. That doesn't mean it's &lt;em&gt;easy to use&lt;/em&gt;, but if you can write programs for adding and primality checking in brainfuck, by extension you must be able to in CSS. (And game-of-life for that matter)&lt;/p&gt;&#xA;&lt;p&gt;Now, as for the &amp;quot;crank&amp;quot; issue. Yes, CSS is not fully automated. However, languages &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/273/on-interactive-answers-and-other-special-conditions&quot;&gt;do &lt;em&gt;not&lt;/em&gt; have to be automated&lt;/a&gt;! We allow vim and &lt;s&gt;the worse editor&lt;/s&gt; emacs, and both of these languages require a user to type the entire program in to &amp;quot;run&amp;quot;. But, this is not an issue for a language to be valid or not. As long as a language has the right computational abilities, we can consider it a language, and it is valid for answers on this site.&lt;/p&gt;&#xA;&lt;p&gt;One can even imagine an entirely mechanical language, that requires turning a literal crank. If such a language were to exist, as long as it could take input and produce output, and there was some reasonable way of scoring it in bytes, I would consider it to be a valid language for the site.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-06T16:20:50.493" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="9782" PostTypeId="1" CreationDate="2016-08-06T21:20:11.093" Score="9" ViewCount="350" Body="&lt;p&gt;Sometimes, on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenges with a constant output, we get extremely boring answers that make absolutely no effort to compress the output whatsoever, and instead just literally dump the exact output the challenge asked for. For example, if the challenge was:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Print the following text:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;aaaaaaaaa&#xA;aaaaaaaaa&#xA;aaaaaaaaa&#xA;aaaaaaaaa&#xA;aaaaaaaaa&#xA;aaaaaaaaa&#xA;aaaaaaaaa&#xA;aaaaaaaaa&#xA;aaaaaaaaa&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;and someone submitted this python answer:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;print'''aaaaaaaaa&#xA;aaaaaaaaa&#xA;aaaaaaaaa&#xA;aaaaaaaaa&#xA;aaaaaaaaa&#xA;aaaaaaaaa&#xA;aaaaaaaaa&#xA;aaaaaaaaa&#xA;aaaaaaaaa'''&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or this HTML answer:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;pre&amp;gt;aaaaaaaaa&#xA;aaaaaaaaa&#xA;aaaaaaaaa&#xA;aaaaaaaaa&#xA;aaaaaaaaa&#xA;aaaaaaaaa&#xA;aaaaaaaaa&#xA;aaaaaaaaa&#xA;aaaaaaaaa&amp;lt;/pre&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Generally, this is done in a non-programming language, such as HTML. There is a consensus for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/3639/31716&quot;&gt;allowing non-programming languages&lt;/a&gt; in constant output challenges, but these answers are so low-quality, I see no reason to allow them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now keep in mind, I am not trying to ban HTML as counting as a programming language, especially since it &lt;a href=&quot;https://codegolf.stackexchange.com/a/88871/31716&quot;&gt;can be used creatively&lt;/a&gt;. However, if we allow purely dumping the output into the answer box, that paves the way for extremely low-quality non-answers such as &lt;a href=&quot;https://codegolf.stackexchange.com/a/86997/31716&quot;&gt;this one&lt;/a&gt; (Deleted answer, only visible to users with 2K or more reputation)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't feel the need to link to all of them, but I've seen plenty of answers like that recently, &lt;em&gt;especially&lt;/em&gt; with the recent influx of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenges with a constant output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do we have a stance on answers like this? More importantly, should we?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can think of a couple solutions to this.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Directly dumping the output into an answer is off-topic and disallowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm a little bit hesitant to say all answers like this should be disallowed, since this is just one more of our endless meta rules to enfore, and because &lt;em&gt;sometimes&lt;/em&gt; this approach is optimal (although that usually indicates a bad challenge). Especially since we allow bubblegum, which is arguable &lt;em&gt;less&lt;/em&gt; of a language then HTML+CSS.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Answers that directly dump the output into an answer are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8750/31716&quot;&gt;not a serious contender&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Like I said above, sometimes they &lt;em&gt;are&lt;/em&gt; a serious contender. Plus, where do we  draw the line between users not being extremely good at code-golf, and telling them they are breaking the rules?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Do nothing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answers like this are rare enough, that they could be handled with downvotes when they come up, and it's not worth having an official stance on this.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2017-06-02T16:24:42.580" Title="Dumping the output as an answer" Tags="|discussion|policy|code-golf|answers|" AnswerCount="2" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9783" PostTypeId="2" ParentId="9782" CreationDate="2016-08-07T03:34:37.650" Score="4" Body="&lt;p&gt;Here's my thoughts on the matter:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's say the challenge in question asks for &lt;strong&gt;N&lt;/strong&gt; constant bytes to be printed to STDOUT. Every language has some overhead &lt;strong&gt;C&lt;/strong&gt; for printing this constant output. Some examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Python 2, no newlines in output: &lt;code&gt;print'X'&lt;/code&gt; (&lt;strong&gt;C = 7&lt;/strong&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Python 2, with newlines in output: &lt;code&gt;print'''X'''&lt;/code&gt; (&lt;strong&gt;C = 11&lt;/strong&gt;)&lt;/li&gt;&#xA;&lt;li&gt;C, no newlines: &lt;code&gt;main(){puts(&quot;X&quot;);}&lt;/code&gt; (&lt;strong&gt;C = 17&lt;/strong&gt;)&lt;/li&gt;&#xA;&lt;li&gt;JavaScript, no newlines: &lt;code&gt;alert(&quot;X&quot;)&lt;/code&gt; (&lt;strong&gt;C = 9&lt;/strong&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Thus, an upper bound on the Kolmogorov complexity of a string &lt;strong&gt;X&lt;/strong&gt; of length &lt;strong&gt;N&lt;/strong&gt; in a language with overhead &lt;strong&gt;C&lt;/strong&gt; is &lt;strong&gt;N+C&lt;/strong&gt;. Note that this is an &lt;em&gt;upper bound&lt;/em&gt; - for any non-random string, the actual Kolmogorov complexity is almost certainly shorter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Our &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenges are intended to have solutions which find and exploit patterns in the desired output, allowing those solutions to be shorter than the naïve upper bound of &lt;strong&gt;N+C&lt;/strong&gt;. Thus, in my opinion, it's fair to say that a submission that does not exploit these patterns to be as short as possible, instead going with the trivial, naïve &lt;strong&gt;N+C&lt;/strong&gt; approach, is not a serious contender, because it does not make any attempt to improve upon the upper bound. This is in accordance with the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8750/45941&quot;&gt;current community consensus on what constitutes being a serious contender&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That being said, there's still the issue of languages whose optimal solution &lt;em&gt;is&lt;/em&gt; that naïve solution. I am strongly against allowing languages that do not satisfy &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/45941&quot;&gt;our definition of a programming language&lt;/a&gt; to be used in challenges (unless explicitly allowed by the challenge author, of course), and I do not believe that fixed-output &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenges should be any different in that regard. Simply printing out a string is not interesting. It's trivial, and anathema to the point of Kolmogorov complexity - exploiting patterns within a string to create a program that outputs the string, in less bytes than the original string. Disallowing non-programming languages in these challenges would be a huge step in solving this problem. I am also in favor of disallowing solutions which simply dump the output, with no extra processing, since these are extremely trivial and don't add anything to the challenge by being present.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-08-07T23:02:00.617" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9784" PostTypeId="1" CreationDate="2016-08-07T05:05:47.707" Score="0" ViewCount="59" Body="&lt;p&gt;While reviewing suggested edits, I came across &lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits/32319&quot;&gt;this one&lt;/a&gt; for the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/color&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;color&amp;#39;&quot; rel=&quot;tag&quot;&gt;color&lt;/a&gt; tag's tag wiki. After looking further into the tag, I found that it did not have a tag wiki beforehand, and there are only three questions that are using it currently. Looking at those questions this tag seems pretty unnecessary in the first place. In fact, the third question was the question where this tag was created.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are the three questions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/84937/the-camouflage-color-changing-chameleon-challenge&quot;&gt;The Camouflage Color Changing Chameleon Challenge&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/85047/use-16-colors-while-writing-hey-4-times&quot;&gt;Use 16 colors while writing Hey! 4 times&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/84066/from-rgb-to-cmyk&quot;&gt;From Rgb to Cmyk&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/tags/color/info&quot;&gt;Here&lt;/a&gt; is  the link to the tag wiki for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/color&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;color&amp;#39;&quot; rel=&quot;tag&quot;&gt;color&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="36670" LastEditorUserId="68942" LastEditDate="2021-06-09T05:42:44.077" LastActivityDate="2021-06-09T05:42:44.077" Title="Do we need the [color] tag?" Tags="|discussion|feature-request|status-declined|tags|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9785" PostTypeId="2" ParentId="6918" CreationDate="2016-08-07T09:01:58.623" Score="11" Body="&lt;h1&gt;∀&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;∀ (or &quot;forall&quot;) is a language that piggy-backs on other golfing language to build a golf pipeline. Not sure whether to use Perl 5, Jelly, Retina or Pyth for some challenge?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why not use all three together?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/vendethiel/forall&quot; rel=&quot;nofollow&quot;&gt;See it on Github&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is an example ∀ program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;y+&#xA;pVsQN&#xA;r(\d+)&#xA;r$*#&#xA;r!`#+&#xA;nsay join '',map{chr(5+ord)}split ''&#xA;Nsay $_».succ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;y is Jelly. p is Pyth. r is Retina. n is &lt;code&gt;perl5 -n&lt;/code&gt;. N is &lt;code&gt;perl6 -n&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An important feature is that, as long as the prefix is the same, the code is considered to be one block. You can pipe into the same language by using an empty line:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;pVTN&#xA;pT&#xA;&#xA;pQ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The first Pyth program is 2-lines long, the second one is a one-liner. The empty line &quot;breaks&quot; the chain.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thanks a lot to all the language authors for allowing that to be possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Currently included:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Pyth by @isaacg&lt;/li&gt;&#xA;&lt;li&gt;Retina by @MartinEnder&lt;/li&gt;&#xA;&lt;li&gt;Jelly by @Dennis&lt;/li&gt;&#xA;&lt;li&gt;Perl 5/6 by @TimToady (:P)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8328" LastActivityDate="2016-08-07T09:01:58.623" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9786" PostTypeId="2" ParentId="2140" CreationDate="2016-08-08T04:22:45.590" Score="0" Body="&lt;h2&gt;Paint with all the colors of the RGB rainbow&lt;/h2&gt;&#xA;&lt;p&gt;&lt;sup&gt;Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/q/22144/45941&quot;&gt;Images with all colors&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/q/33172/45941&quot;&gt;American Gothic in the palette of Mona Lisa: Rearrange the pixels&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given an input raster image, output a raster image where each pixel is a unique color, such that the sum of the absolute value of the sum of the differences of the RGB channel values for each pixel between the original image and the output image is minimized. In other words, that means, given an image &lt;code&gt;O&lt;/code&gt;, find an image &lt;code&gt;X&lt;/code&gt; such that every pixel is a different color, and (in pseudo-Python) the quantity &lt;code&gt;sum(abs(O_pixel.RED - X_pixel.RED) + abs(O_pixel.GREEN - X_pixel.GREEN) + abs(O_pixel.BLUE - X_pixel.BLUE) for O_pixel,X_pixel in zip(O.pixels, X.pixels))&lt;/code&gt; is minimized.&lt;/p&gt;&#xA;&lt;h2&gt;3-bit example&lt;/h2&gt;&#xA;&lt;p&gt;All images in this example are 4 pixels wide by 2 pixels high, magnified 40x to 160x80 so that they can be seen more easily.&lt;/p&gt;&#xA;&lt;p&gt;Original image:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/PcHID.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/PcHID.png&quot; alt=&quot;original 3-bit&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The palette:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/JOsCH.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/JOsCH.png&quot; alt=&quot;color space&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The image using each color from the palette that is closest to the original (minimum sum 6):&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/iTvnr.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/iTvnr.png&quot; alt=&quot;3-bit output big&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Specifications&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All images will use 8-bit colors (3 bits in the red and green channels and 2 in the blue channel), and will be 16x16. &lt;a href=&quot;https://upload.wikimedia.org/wikipedia/commons/9/93/256colour.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt; is an image displaying the 8-bit color palette. Each color from this palette must be used exactly once in the output image.&lt;/li&gt;&#xA;&lt;li&gt;Submissions must complete for any of the test images in under 1 minute.&lt;/li&gt;&#xA;&lt;li&gt;If there are multiple optimal solutions, any one of them may be used.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;Original is on the left, expected output is on the right. All of these images are zoomed in; click the links to get the original-sized images.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/mbzq1.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/H4oCY.png&quot;&gt;&lt;/a&gt; &lt;a href=&quot;https://i.stack.imgur.com/mbzq1.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/H4oCY.png&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Note that these two are the same, because the original image is already composed of unique pixels. Thus, the minimum sum is 0.&lt;/p&gt;&#xA;&lt;p&gt;(more to come once my computer finishes generating them)&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-11T18:51:52.430" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9787" PostTypeId="2" ParentId="2140" CreationDate="2016-08-08T09:29:54.420" Score="0" Body="&lt;p&gt;&lt;strong&gt;&lt;em&gt;Smallest Vigenere cypher executable&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Brief&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Impliment a Vigenere cypher program in your favourite language to create the smallest compiled program in any operating system.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For people unfamilar with a Vigenere cypher program, please visit the following link:&#xA;&lt;a href=&quot;https://en.wikipedia.org/wiki/Vigen%C3%A8re_cipher&quot; rel=&quot;nofollow&quot;&gt;https://en.wikipedia.org/wiki/Vigen%C3%A8re_cipher&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your score is the size in bytes of the folder that contains the main executable.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;To find this, you must first compile your program. Secondly, delete any files unecessary to the running of your program. Finally, right-click on or list details by command line the folder (or equivalent standard action depending on operating system) containing the compiled executable and note the smallest of the listed size (e.g. size or size on disc in Windows) in bytes value.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If dlls or similar are referenced, then their size in bytes must be added to the score.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Interpreted languages may be used, but the size of a compatible interpreter (e.g. a web browser if using javascript) must be included when calculating the score. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Specific details&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program must accept 3 arguments:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Argument 1 must be either 'e' or 'd', with e meaning encrypt and d meaning decrypt&lt;/li&gt;&#xA;&lt;li&gt;Argument 2 is the keyword string. &lt;/li&gt;&#xA;&lt;li&gt;Argument 3 is the main input string. &lt;/li&gt;&#xA;&lt;li&gt;If Argument 1 is 'e' then Argument 3 is the message to be encoded. &lt;/li&gt;&#xA;&lt;li&gt;If Argument 1 is 'd' then Argument 3 is the message to decoded.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The program must output the result only:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If Argument 1 is 'e' then the result is the encoded string. &lt;/li&gt;&#xA;&lt;li&gt;If Argument 1 is 'd' then the result is the decoded string. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The earliest dated post with the lowest score wins.&lt;/li&gt;&#xA;&lt;li&gt;In your answer post, post enough information so that others may repeat steps described to arrive at the same result. Presume that people reading your answer are fluent in your chosen language, but may not necesarilly understand any nifty tricks or exploits.&lt;/li&gt;&#xA;&lt;li&gt;Include your score in your answer post to let everyone know your score.&lt;/li&gt;&#xA;&lt;li&gt;You may post all your source-code if you like, but may also post only the parts that you feel are significant. There is no need to post automatically generated code, although if it is generated by a plugin then this should discussed. Failure to do so is considered cheating. &lt;/li&gt;&#xA;&lt;li&gt;Edits may not be made to answers. If you have made a mistake then delete and repost your answer anew. &lt;/li&gt;&#xA;&lt;li&gt;All edits and mistakes are considered cheating. Cheat answers are identified by members of the community leaving a comment. Cheat answers must be deleted, corrected and reposted. &lt;/li&gt;&#xA;&lt;li&gt;The community must use the comments to report cheating only. Be careful reporting cheats as a mistake may result in a good answer being deleted.&lt;/li&gt;&#xA;&lt;li&gt;Improvements should be listed as a new answer post.&lt;/li&gt;&#xA;&lt;li&gt;Take the competition seriously and be a good sport. Avoid ribbing, jokes or childish remarks.&lt;/li&gt;&#xA;&lt;li&gt;Have fun&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="58303" LastEditorUserId="58303" LastEditDate="2016-08-08T10:36:41.953" LastActivityDate="2016-08-08T10:36:41.953" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="9788" PostTypeId="1" CreationDate="2016-08-08T11:32:08.503" Score="5" ViewCount="283" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt; tag seems a bit useless given we're called 'Programming Puzzles and Code-Golf'. It seems to be used when no other objective winning criteria is used and sometimes used in conjunction with other winning criteria tags.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;15 out of the 29 questions in the tag are closed and of the remaining 14, 7 of them have other criterion that suggest the winner. This leaves a total of 7 valid &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt; tags.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I propose we remove the tag from questions with another winning objective tag and on the other questions replace it with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; or possible add &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt; as a synonym of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="32686" LastEditorUserId="46231" LastEditDate="2016-08-12T23:05:22.117" LastActivityDate="2016-08-12T23:05:22.117" Title="[programming-puzzle]: Isn't it obvious?" Tags="|discussion|tags|" AnswerCount="0" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9790" PostTypeId="1" CreationDate="2016-08-08T14:12:30.337" Score="9" ViewCount="200" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/tags/tips/info&quot;&gt;tag wiki&lt;/a&gt; for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; mentions&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;either golfing or programming challenges&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;but then the rest of the wording and examples cover only aspects related to golf or golfing languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There doesn't currently seem to be a consistent consensus on meta to point to when someone posts a tips question that isn't about golf. Ideally, the tips tag wiki would explicitly mention fastest code, algorithms, and anything else that may cause disagreement, and state whether each is included in the tips tag (and therefore on topic).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A couple of years ago we had a meta post to settle &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1723/lets-decide-what-kind-of-non-challenge-questions-we-want-once-and-for-all&quot;&gt;what kind of non-challenge questions we want once and for all&lt;/a&gt;, but the voting on the answers seems to give two contradictory messages.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1724/20283&quot;&gt;Questions about improving code golf / code challenge skills&lt;/a&gt; &lt;strong&gt;+23&lt;/strong&gt; [+33/-10]&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1728/20283&quot;&gt;Questions about improving algorithms&lt;/a&gt; &lt;strong&gt;-5&lt;/strong&gt; [+7/-12]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The first seems to include fastest code / algorithm improvements, but the body mentions only golf. It's hard to judge whether the upvotes support algorithm improvements or just golf. The second is specifically about algorithms and has downvotes, but also a significant number of upvotes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can we make the tips tag wiki definitive?&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-08-18T22:02:54.140" Title="The tips tag is currently golf focused. Can this be made explicit one way or the other?" Tags="|discussion|tag-wikis|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9791" PostTypeId="1" CreationDate="2016-08-08T16:43:56.567" Score="13" ViewCount="295" Body="&lt;p&gt;A &lt;em&gt;very&lt;/em&gt; common task in writing a challenge is to define the allowed input/output types.  These descriptions have a couple of problems as I see them:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;They can get &lt;em&gt;really&lt;/em&gt; verbose.  If I want somebody to output an ascii art image, describing the allowable outputs can &lt;a href=&quot;https://codegolf.stackexchange.com/questions/89152/place-a-stone-on-an-empty-go-board&quot;&gt;get really complicated&lt;/a&gt;:&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If you write a full program, your answer must be printed to STDOUT as a string, optionally followed by a trailing newline. If your answer is a function, you may print to STDOUT, or return a string, or return an array/list of strings (rows), or return a two-dimensional array or nested list of characters.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;There are lots of &quot;gotcha's&quot; in types.  For example, defining the precision needed for a double, or the minimum image size for image output.&lt;/li&gt;&#xA;&lt;li&gt;These type descriptions are repeated a lot from challenge to challenge&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;It'd be great if we could come up with some sort of &quot;type description&quot; (e.g. &lt;code&gt;Integer -&amp;gt; 2D string&lt;/code&gt;), that allows users to quickly understand the input/output types, while covering edge cases and other problems.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do you like this idea?  If so:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;What should the syntax look like?&lt;/li&gt;&#xA;&lt;li&gt;How should the types be defined?&lt;/li&gt;&#xA;&lt;li&gt;Should types simply be a shorthand (and a full description is still required)?  If the full description isn't required, how should new users figure out what the types mean?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-08-18T17:14:28.263" Title="Challenge Type System" Tags="|discussion|" AnswerCount="3" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9792" PostTypeId="2" ParentId="2140" CreationDate="2016-08-08T17:28:57.450" Score="-2" Body="&lt;h1&gt;Nasty Nasty Bugs&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Help the programmer provide detailed instructions to the team on how to deal with bug fixes.&#xA;&lt;br/&gt;&#xA;The team's goto instructions for dealing with bugs goes like this. &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;For the twelfth bug of Christmas, my team leader said to me &#xA;&#xA;    Tell them it's a feature&#xA;    Say it's not supported&#xA;    Change the documentation&#xA;    Blame it on the hardware&#xA;    Find a way around it&#xA;    Say they need an upgrade&#xA;    Reinstall the software&#xA;    Ask for a dump&#xA;    Run with the debugger&#xA;    Try to reproduce it&#xA;    Ask them how they did it and&#xA;    See if they can do it again.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The indentation must comply with the teams coding standards, so it may either be tabs or four spaces (since the team's editors expand tabs to spaces anyway). The team lead doesn't mind a leading or trailing newline, but there is no tolerance for the dreaded standard loopholes. Also the office is a bit cramped so the code needs to be as small as possible. &#xA;These lyrics are moderately adapted from &lt;a href=&quot;http://www.manbottle.com/humor/twelve_bugs_of_christmas&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.manbottle.com/humor/twelve_bugs_of_christmas&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="46918" LastEditDate="2016-08-10T11:08:47.963" LastActivityDate="2016-08-10T11:08:47.963" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9793" PostTypeId="2" ParentId="6918" CreationDate="2016-08-08T18:02:09.380" Score="5" Body="&lt;h2&gt;&lt;a href=&quot;https://github.com/iatorm/jellyfish&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jellyfish&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Jellyfish is a two-dimensional language created by me, Zgarb, in January 2016.&#xA;It's largely inspired by J, and the name is a combination of &lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt; (another J-like language) and &lt;a href=&quot;https://esolangs.org/wiki/Fish&quot; rel=&quot;nofollow noreferrer&quot;&gt;&gt;&amp;lt;&gt;&lt;/a&gt; (pronounced &quot;fish&quot;; a two-dimensional esoteric language).&#xA;Jellyfish began as a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/65661/parse-a-two-dimensional-syntax&quot;&gt;challenge&lt;/a&gt; here on PPCG, and then took on a life of its own.&#xA;It's still under active development, but you can play with it on &lt;a href=&quot;http://jellyfish.tryitonline.net/&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;.&#xA;You can also discuss it in the &lt;a href=&quot;http://chat.stackexchange.com/rooms/43483/jellyfish&quot;&gt;dedicated chatroom&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The standard library of Jellyfish contains mostly arithmetic and array manipulation functions, and as with J, multidimensional arrays are the only nontrivial datatype.&#xA;My plan is to re-implement a large part of the standard library of J, suitably modified for the computational model of Jellyfish, as well as any interesting features I feel like implementing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While the standard library of Jellyfish is largely borrowed from J, the syntax is what makes it unique.&#xA;Its source code is arranged on a 2D grid, and each grid cell may contain a &lt;em&gt;value&lt;/em&gt;, a &lt;em&gt;function&lt;/em&gt; or an &lt;em&gt;operator&lt;/em&gt;.&#xA;Values are either numeric or string literals, or special input values that are read from STDIN during execution.&#xA;A function takes as its argument the two nearest values to the south and east (if they exist), and most functions have both one-argument and two-argument forms.&#xA;Operators are second-order functions: they take one or two functions as inputs, and produce new functions, which are then called on the arguments of the original functions.&#xA;A large Jellyfish program is a complex network of function and operator calls and reused values.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's an example program to compute the average of a list, or &lt;code&gt;0&lt;/code&gt; if the list is empty:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;p%~/+0&#xA; #  i&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;i&lt;/code&gt; is replaced by input from STDIN; lists are taken in the format &lt;code&gt;[1 2 3 4]&lt;/code&gt;.&#xA;The &lt;code&gt;+&lt;/code&gt; is addition, and it takes arguments &lt;code&gt;i&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt;.&#xA;Now, &lt;code&gt;/&lt;/code&gt; is the &lt;em&gt;fold&lt;/em&gt; operator: it takes the function &lt;code&gt;+&lt;/code&gt;, and folds it over the list &lt;code&gt;0&lt;/code&gt; using initial value &lt;code&gt;i&lt;/code&gt; (the arguments of &lt;code&gt;+&lt;/code&gt;).&#xA;This argument order is of course incorrect, so we apply the operator &lt;code&gt;~&lt;/code&gt;, which flips the arguments of &lt;code&gt;/+&lt;/code&gt;: it now folds &lt;code&gt;+&lt;/code&gt; over the list &lt;code&gt;i&lt;/code&gt; with initial value &lt;code&gt;0&lt;/code&gt;; in other words, it computes the sum of &lt;code&gt;i&lt;/code&gt; with default value &lt;code&gt;0&lt;/code&gt;.&#xA;On the second row, the function &lt;code&gt;#&lt;/code&gt; computes the length of the list &lt;code&gt;i&lt;/code&gt;, and &lt;code&gt;%&lt;/code&gt; divides the sum by that.&#xA;Finally, &lt;code&gt;p&lt;/code&gt; prints the result of the division to STDOUT.&lt;/p&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-08-08T18:02:09.380" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9794" PostTypeId="2" ParentId="2140" CreationDate="2016-08-08T19:17:49.143" Score="8" Body="&lt;h1&gt;Dividing Strings&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Division with numbers is great: &lt;code&gt;6 / 3 = 2&lt;/code&gt;, but have you ever wanted to divide &lt;em&gt;strings&lt;/em&gt;? In this challenge you will, given two strings (&lt;code&gt;s&lt;/code&gt; and &lt;code&gt;t&lt;/code&gt;) divide &lt;code&gt;s&lt;/code&gt; by &lt;code&gt;t&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a string, &lt;code&gt;s&lt;/code&gt;, find the substring in which &lt;code&gt;t&lt;/code&gt; is repeated the most times (non-overlapping), return the amount of times &lt;code&gt;t&lt;/code&gt; is repeated, example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;s = &quot;HiFooFooFooFoo&quot;&#xA;t = &quot;Foo&quot;&#xA;n = 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Seems easy enough? Well if the substring &lt;strong&gt;ends&lt;/strong&gt; with the first &lt;code&gt;m&lt;/code&gt; characters of &lt;code&gt;t&lt;/code&gt;, you should add what fraction of the string &lt;code&gt;t&lt;/code&gt; was in the substring (&lt;code&gt;m/t.len&lt;/code&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;s = &quot;12121&quot;&#xA;t = &quot;12&quot;&#xA;n = 2.5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You only need to output to the precision your language supports. The minimum precision is two decimal places.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;First line is &lt;code&gt;s&lt;/code&gt;, second line is &lt;code&gt;m&lt;/code&gt;, last line is output. Examples are double-newline seperated&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;FooFooFoo&#xA;Foo&#xA;3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;GoatGoatGoatGo&#xA;Goat&#xA;3.5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;SheepSheepSheep&#xA;Goat&#xA;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;GoGoatGoatGoat&#xA;Goat&#xA;3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;GoatGoGoatGo&#xA;Goat&#xA;1.5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ab111cd&#xA;1&#xA;3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;PigPigPi&#xA;Pig&#xA;2.666666&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;aabaabaaaba&#xA;aaba&#xA;2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;aabaaaabaaa&#xA;a&#xA;4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="40695" LastEditDate="2016-08-21T19:14:45.533" LastActivityDate="2016-08-21T19:14:45.533" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9795" PostTypeId="2" ParentId="2140" CreationDate="2016-08-08T22:15:49.590" Score="-2" Body="&lt;h1&gt;Return True to Win - Counter &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Original credit goes to &lt;a href=&quot;https://alf.nu/ReturnTrue&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; site, which you should all check out&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write the shortest javascript code to pass as parameter &lt;code&gt;f&lt;/code&gt; to  function &lt;code&gt;counter&lt;/code&gt; such that it returns true:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function counter(f) {&#xA;    var a = f(), b = f();&#xA;    return a() == 1 &amp;amp;&amp;amp; a() == 2 &amp;amp;&amp;amp; a() == 3&#xA;        &amp;amp;&amp;amp; b() == 1 &amp;amp;&amp;amp; b() == 2;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I'm considering also making this a series with all the rest of the challenges on the site, where each one gets harder&lt;/p&gt;&#xA;" OwnerUserId="19832" LastEditorUserId="19832" LastEditDate="2016-08-08T22:21:04.123" LastActivityDate="2016-08-08T22:21:04.123" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9796" PostTypeId="2" ParentId="6918" CreationDate="2016-08-08T23:13:41.507" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/daHugLenny/PyMin&quot; rel=&quot;nofollow&quot;&gt;PyMin&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a language created by me.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's a lazy one (something like &lt;a href=&quot;https://dogescript.com/&quot; rel=&quot;nofollow&quot;&gt;Dogescript&lt;/a&gt;?), because pretty much the entire language is Python, except there are specific two bytes chars that get replaced by something, and then executed as normal Python.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Examples:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Hello, World!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;»Ħ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or if you want the &lt;code&gt;W&lt;/code&gt; to be lowercase:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;»ħ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;FizzBuzz (v0.1)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;¥i¦ȑ101):&#xA; s¨&#xA; ¿i%3ʭ0:sϯƒ&#xA; ¿i%5ʭ0:sϯɓ&#xA; ¿sɵ:»s&#xA; Ə»i&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I added more stuff into the language, so in &lt;code&gt;v0.5&lt;/code&gt; it can be shortened to:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ŒʘƆ&#xA; s¨&#xA; ¿i%3ǆ:sϯƒ&#xA; ¿i%5ǆ:sϯɓ&#xA; ¿sɵ:»s&#xA; Ə»i&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Degrees to radians&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;»ȹ¬)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Celsius to fahrenheint&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;»Ɋ¬)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Primality check&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;»Գ¬)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="56258" LastActivityDate="2016-08-08T23:13:41.507" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9797" PostTypeId="2" ParentId="9791" CreationDate="2016-08-09T00:54:25.557" Score="-6" Body="&lt;h1&gt;Yes, lets do this!&lt;/h1&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The syntax should look like &lt;code&gt;InputType[Param] -&amp;gt; OutputType[Param]&lt;/code&gt;.  This seems intuitive to me, and it matches type hinting of Python (and likely other languages)&lt;/li&gt;&#xA;&lt;li&gt;A meta question is asked, and for each type, a different answer is given (and can be voted on)&lt;/li&gt;&#xA;&lt;li&gt;Shorthand is sufficient &lt;em&gt;as long as the above meta post is linked to&lt;/em&gt; immediately above/below or on the types themselves&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-09T00:54:25.557" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9798" PostTypeId="2" ParentId="9791" CreationDate="2016-08-09T01:56:37.977" Score="18" Body="&lt;h1&gt;Don't golf your specs&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We already have a lot of defaults: program or function, I/O methods, STDERR, submission must halt, functions must be reusable, standard loopholes, things to avoid when writing challenges, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It makes sense to come up with defaults that apply to pretty much all code golf challenges, but for a newcomer, they're a lot to take in. Adding even more defaults for all specific sub-types of code golf challenges is only going to make this worse. And providing a large number of links one would have to follow before answering a question, topped with some obscure syntax that specifies which ones apply, will even be a strain for regular users.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Specifications of challenges should be as long as needed to make the challenge understandable by someone who is not familiar with our site. Even though it is a default, I mention in all of my code golf challenges that a full program or a function is required. Sure, there will always be corner cases that are covered by some consensus on meta, but 9 times out of 10, a reasonable person should be able to post a valid submission to the challenge without being familiar with those defaults.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, having defaults for every single aspect of a challenge will create backlash for challenge writers that do not adhere to those defaults. Ever since we had the &lt;em&gt;programs of functions&lt;/em&gt; default, regular users came to expect it in &lt;em&gt;all&lt;/em&gt; challenges (see &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8065/12012&quot;&gt;arbitrarily overriding the defaults&lt;/a&gt;), regardless of the author's wishes. While it makes sense to have a default like this (or it would have to be specified in literally every single code golf challenge, which many newcomers do not do), it will create a mess if we attempt to cover all code golf sub-types and corner cases.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-08-09T03:52:57.657" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9799" PostTypeId="2" ParentId="6918" CreationDate="2016-08-09T09:42:59.633" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/tuxcrafting/neoscript&quot; rel=&quot;nofollow&quot;&gt;Neoscript&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Neoscript is a language I have created.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Neoscript is a high-level, functional language compiling to JavaScript.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples:&lt;/h3&gt;&#xA;&#xA;&lt;h3&gt;Hello world:&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;console:log(&quot;Hello, World!&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="53745" LastEditorUserId="53745" LastEditDate="2016-08-29T08:00:01.840" LastActivityDate="2016-08-29T08:00:01.840" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9801" PostTypeId="2" ParentId="2140" CreationDate="2016-08-09T19:22:56.490" Score="2" Body="&lt;p&gt;Your job is to take an input like below:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Hello, world!&lt;/p&gt;&#xA;&lt;p&gt;π is cool!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;and output it as a series of &lt;code&gt;&amp;lt;kbd&amp;gt;&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Every character, including enter and space get their own &lt;a href=&quot;http://www.w3schools.com/tags/tag_kbd.asp&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;&amp;lt;kbd&amp;gt;&lt;/code&gt; HTML element&lt;/a&gt;, like so:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;kbd&gt;H&lt;/kbd&gt;&lt;kbd&gt;e&lt;/kbd&gt;&lt;kbd&gt;l&lt;/kbd&gt;&lt;kbd&gt;l&lt;/kbd&gt;&lt;kbd&gt;o&lt;/kbd&gt;&lt;kbd&gt;,&lt;/kbd&gt;&lt;kbd&gt;SPACE&lt;/kbd&gt;&lt;kbd&gt;w&lt;/kbd&gt;&lt;kbd&gt;o&lt;/kbd&gt;&lt;kbd&gt;r&lt;/kbd&gt;&lt;kbd&gt;l&lt;/kbd&gt;&lt;kbd&gt;d&lt;/kbd&gt;&lt;kbd&gt;!&lt;/kbd&gt;&lt;kbd&gt;NEWLINE&lt;/kbd&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;kbd&gt;&lt;kbd&gt;OPT&lt;/kbd&gt; + &lt;kbd&gt;P&lt;/kbd&gt;&lt;/kbd&gt;&lt;kbd&gt;SPACE&lt;/kbd&gt;&lt;kbd&gt;i&lt;/kbd&gt;&lt;kbd&gt;s&lt;/kbd&gt;&lt;kbd&gt;SPACE&lt;/kbd&gt;&lt;kbd&gt;c&lt;/kbd&gt;&lt;kbd&gt;o&lt;/kbd&gt;&lt;kbd&gt;o&lt;/kbd&gt;&lt;kbd&gt;l&lt;/kbd&gt;&lt;kbd&gt;!&lt;/kbd&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Other characters like space and newline that are invisible &lt;strong&gt;and&lt;/strong&gt; typeable (so no option, command, control, function, escape, delete, arrow keys, etc.) are all uppercase, like &lt;kbd&gt;SPACE&lt;/kbd&gt; and &lt;kbd&gt;NEWLINE&lt;/kbd&gt;. &lt;kbd&gt;OPT&lt;/kbd&gt; is an exception because it is used to create new characters. The code for these characters are:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;kbd&amp;gt;SPACE&amp;lt;/kbd&amp;gt; &amp;lt;kbd&amp;gt;NEWLINE&amp;lt;/kbd&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Special characters needing to be typed using option use the following format &lt;kbd&gt;&lt;kbd&gt;OPT&lt;/kbd&gt; + &lt;kbd&gt;P&lt;/kbd&gt;&lt;/kbd&gt; instead of &lt;kbd&gt;π&lt;/kbd&gt;. The following code is used for these:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;kbd&amp;gt;&amp;lt;kbd&amp;gt;OPT&amp;lt;/kbd&amp;gt; + &amp;lt;kbd&amp;gt;P&amp;lt;/kbd&amp;gt;&amp;lt;/kbd&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The same applies to characters that are typed using &lt;kbd&gt;OPT&lt;/kbd&gt; + &lt;kbd&gt;SHIFT&lt;/kbd&gt; + &lt;kbd&gt;K&lt;/kbd&gt; instead of &lt;kbd&gt;&lt;/kbd&gt;.&lt;/p&gt;&#xA;&lt;p&gt;We're assuming this is a QWERTY layout computer.&lt;/p&gt;&#xA;&lt;p&gt;Here are the available option keys:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/W65BI.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/W65BI.png&quot; alt=&quot;Option keys&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Any of the orange keys are not allowed in this.&lt;/p&gt;&#xA;&lt;p&gt;Here are the &lt;kbd&gt;OPT&lt;/kbd&gt; + &lt;kbd&gt;SHIFT&lt;/kbd&gt; keys:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/v1Moe.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/v1Moe.png&quot; alt=&quot;Option shift keys&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="46517" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-09T19:22:56.490" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9803" PostTypeId="2" ParentId="2447" CreationDate="2016-08-09T21:44:37.940" Score="12" Body="&lt;h1&gt;Programs may output using their return value&lt;/h1&gt;&#xA;&lt;p&gt;Iff it is legit regarding their specs and compilers.&lt;/p&gt;&#xA;&lt;p&gt;Certain language treat programs as function, allowing programs to communicate via returns. Hence, we shoule allow such programs to be considered as whole, and not as snippet.&lt;/p&gt;&#xA;" OwnerUserId="41019" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-09T21:44:37.940" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9805" PostTypeId="1" CreationDate="2016-08-10T07:51:45.053" Score="11" ViewCount="695" Body="&lt;p&gt;An interesting number I failed to find - what's the longest &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; accepted answer ever?&lt;br&gt;&#xA;Probably someone with SE scripting skills can figure this out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More accurate phrasing of my question - I'm looking for the longest answer that:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Answers a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question. Maybe it should be limited to pure code-golf (i.e. no bonuses), but I think not.&lt;/li&gt;&#xA;&lt;li&gt;Is accepted.&lt;/li&gt;&#xA;&lt;li&gt;Is rightfully accepted (if the OP accepted a long answer by mistake, it's not interesting).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The longest I could find is &lt;a href=&quot;https://codegolf.stackexchange.com/a/6166/3544&quot;&gt;this&lt;/a&gt;. It's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;, which makes it a bit less interesting.&lt;/p&gt;&#xA;" OwnerUserId="3544" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-08-24T07:25:35.190" Title="Longest Code Golf Answer Ever" Tags="|discussion|code-golf|statistics|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9806" PostTypeId="2" ParentId="2140" CreationDate="2016-08-10T07:55:16.180" Score="0" Body="&lt;h1&gt;N-ary Time&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Metric_time&quot; rel=&quot;nofollow noreferrer&quot;&gt;Decimal time&lt;/a&gt; is a concept of having days, hours, minutes, and seconds relate to each other by powers of 10:&lt;/p&gt;&#xA;&lt;p&gt;N-ary time, which I made up, is having days, hours, minutes, and seconds relate to each other by powers of N.&lt;/p&gt;&#xA;&lt;p&gt;Given an input N where minumum(2^31-1, [languages upper limit on integers])&amp;gt;N&amp;gt;1, output the value of an N-ary hour, N-ary minute and N-ary second, in seconds, using these rules:&#xA;&lt;em&gt;There are N^1 (10 in base-N) N-ary hours in a day, there are N^2 (100 in base-N) N-ary minutes in an N-ary hour, and there are N^2 (100 in base-N) N-ary seconds in an N-ary minute.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;There are 86400 regular seconds in a day.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;Input must be an integer, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;inputted in anyway allowed&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Output consists of floats or integers that represent the amount of seconds in each N-ary unit within 0.5 seconds . Order is irrelevant.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;input--&amp;gt;output&#xA;&#xA;2--&amp;gt;[43200.0, 10800.0, 2700.0] (or some other way of representing the data)&#xA;&#xA;8--&amp;gt;10800 3 169 (numbers don't have to have specific order)&#xA;&#xA;3--&amp;gt;28800.3200.356 (note that this might have the same character as decimal points, but it's still clear that they are three separate numbers)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="55896" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-10T23:34:07.023" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9807" PostTypeId="2" ParentId="9805" CreationDate="2016-08-10T11:23:32.993" Score="17" Body="&lt;p&gt;On the basis of some data.stackexchange.com hacking, assuming the first line of each answer contains its length followed by &lt;em&gt;bytes&lt;/em&gt; or &lt;em&gt;char&lt;/em&gt;, it seems to be &lt;a href=&quot;https://codegolf.stackexchange.com/a/40698/194&quot;&gt;https://codegolf.stackexchange.com/a/40698/194&lt;/a&gt; (also &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;) at 8559 bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/75326/194&quot;&gt;https://codegolf.stackexchange.com/a/75326/194&lt;/a&gt; is an accepted answer of 10791 bytes, but there are shorter answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Excluding &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;, and ignoring some other bad candidates, &lt;a href=&quot;https://codegolf.stackexchange.com/a/23508/194&quot;&gt;https://codegolf.stackexchange.com/a/23508/194&lt;/a&gt; might be a good one: it's 4011, but it does have a comment from its author saying that about 1000 of them are redundant.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/12210/194&quot;&gt;https://codegolf.stackexchange.com/a/12210/194&lt;/a&gt; is 3710 bytes, but mainly data.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/4479/194&quot;&gt;https://codegolf.stackexchange.com/a/4479/194&lt;/a&gt; is 3031 bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Honourable mention also for &lt;a href=&quot;https://codegolf.stackexchange.com/a/75887/194&quot;&gt;https://codegolf.stackexchange.com/a/75887/194&lt;/a&gt; at 1915.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-08-10T11:23:32.993" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9810" PostTypeId="2" ParentId="2140" CreationDate="2016-08-10T23:41:58.717" Score="0" Body="&lt;h1&gt;Floating Point Error&lt;/h1&gt;&#xA;&lt;p&gt;Given a basic arithmetic problem, the division, multiplication, addition, or subtraction of two numbers (which are representable in a 32bit floating point), output the percent difference between the actual (mathematical) result and the nearest floating point value. The percent difference should be rounded to a whole number.&lt;/p&gt;&#xA;&lt;p&gt;You may use either 32bit or 64bit floating point following the &lt;a href=&quot;https://en.wikipedia.org/wiki/IEEE_floating_point&quot; rel=&quot;nofollow noreferrer&quot;&gt;IEEE Standard for Floating-Point Arithmetic (IEEE 754)&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The percent difference is calculated in the following manner:&lt;/p&gt;&#xA;&lt;p&gt;100 * (&lt;em&gt;Actual&lt;/em&gt; - &lt;em&gt;Float&lt;/em&gt;) / &lt;em&gt;Actual&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;You may round to a whole number in any of three ways, as long as you only use one method: (1) floor, (2) ceiling, (3) nearest.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt; and &lt;strong&gt;Test Cases&lt;/strong&gt;, yet to come.&lt;/p&gt;&#xA;" OwnerUserId="45459" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-10T23:41:58.717" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9812" PostTypeId="2" ParentId="2140" CreationDate="2016-08-11T15:19:01.687" Score="0" Body="&lt;h2&gt;Bomb Drops&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; [tag:???]&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your task is to create a program that simulates &quot;dropping bombs&quot; on a 2 dimensional array.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example consider the following 2d array:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3 0 5 0 5&#xA;5 3 4 0 2&#xA;1 0 5 4 2&#xA;2 4 2 3 2&#xA;2 3 3 0 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Dropping a bomb on a single cell decreases the value of that cell by 2 and the value of its direct neighbors (including diagonal neighbors) by 1, to a minimum of 0.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we were to drop on a bomb on the cell corresponding to &lt;code&gt;array[2][1]&lt;/code&gt; where the value is &lt;code&gt;4&lt;/code&gt;, or coords &lt;code&gt;(2,1)&lt;/code&gt;, then the new 2d array would look like so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3 0 4 0 5&#xA;5 2 2 0 2&#xA;1 0 4 3 2&#xA;2 4 2 3 2&#xA;2 3 3 0 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your input will be a two dimensional array of integers greater than or equal to zero, in whatever way you like.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will then also take input that is a sequence of tuples, lists of size 2, or whatever else you please that corresponds to coordinate points. For example,&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(2,1),(3,4),(0,0) or [2,1],[3,4],[0,0] or 2,1,3,4,0,0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For each of these points, you will simulate a bomb drop on that point. You do not need to worry about these coordinates being out of range of the 2d array.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Output consists of a two-dimensional array, formatted the way you please.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt; [[0, 1, 3, 1, 1], [3, 5, 1, 0, 4], [1, 1, 1, 0, 2], [1, 2, 0, 3, 4], [5, 2, 0, 2, 2]]&#xA;# 0 1 3 1 1&#xA;# 3 5 1 0 4&#xA;# 1 1 1 0 2&#xA;# 1 2 0 3 4&#xA;# 5 2 0 2 2&#xA;&amp;gt;&amp;gt;&amp;gt; [3,4],[2,1],[0,0]&#xA;0 0 2 0 1&#xA;2 3 0 0 4&#xA;1 0 0 0 2&#xA;1 2 0 2 3&#xA;5 2 0 0 1&#xA;&#xA;# You can also take input in one pass, rather than &#xA;# having the 2d array and the coordinates be seperate inputs:&#xA;&amp;gt;&amp;gt;&amp;gt; [[5, 2, 3, 0, 3], [4, 3, 5, 5, 5], [1, 3, 3, 3, 3], [0, 1, 2, 3, 1], [3, 1, 2, 2, 4]],[2,2],[0,1],[3,3]&#xA;# 5 2 3 0 3&#xA;# 4 3 5 5 5&#xA;# 1 3 3 3 3&#xA;# 0 1 2 3 1&#xA;# 3 1 2 2 4&#xA;4 1 3 0 3&#xA;2 1 4 4 5&#xA;0 1 0 1 2&#xA;0 0 0 0 0&#xA;3 1 1 1 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Other info&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Inspired from &lt;a href=&quot;https://stackoverflow.com/questions/15300149/bomb-dropping-algorithm&quot;&gt;this question on StackOverflow&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is my first challenge, I'm looking for any advice at all. I'm not sure what other tags to put aside from code golf. I'm probably missing a few basic rules etc too that I've forgotten about. All suggestions welcome.&lt;/p&gt;&#xA;" OwnerUserId="56148" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2016-08-11T15:19:01.687" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9813" PostTypeId="1" CreationDate="2016-08-11T17:29:20.023" Score="10" ViewCount="508" Body="&lt;p&gt;A little while ago, I wrote &lt;a href=&quot;https://codegolf.stackexchange.com/q/74194/20793&quot;&gt;a PPCG challenge&lt;/a&gt; under the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; tag, which frankly bombed. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Briefly, the challenge was to output a series of names. The first half of names were fixed but entrants could choose their own set of names for the second half under fairly loose restrictions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When I wrote the challenge, I had imagined that entries would use encoding tricks like looking for every other capital letter as a separator with a special rule for names starting &quot;Mc&quot;, or maybe the second half of names would all be rearrangements of the names used in the first half.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What I got, which should have been obvious in hindsight, is one answer that was essentially a bunch of bytes piped into a decompression function. No effort was made to find names with patterns that could be expanded by code, just a quick decompression and we're done.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can't blame the author of that entry for doing it this way, but I got the feeling that this entry kinda sucked the fun out of the challenge. It was like we're taking part in a sprinting race and one entrant noticed that the rules allow you to use a motorcycle. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thinking about kolmogorov-complexity in general, that style of piping bytes into a decompression function would work for a lot of these challenges, which would take away the fun of the challenge. So, what if we made a general rule, that use of zip-esque decompression functions go against the spirit of kolmogorov-complexity?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="20793" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-08-11T17:47:36.403" Title="Ban zip-style decompression for kolmogorov-complexity?" Tags="|discussion|kolmogorov-complexity|" AnswerCount="1" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="9814" PostTypeId="2" ParentId="9813" CreationDate="2016-08-11T17:47:36.403" Score="20" Body="&lt;p&gt;If your goal is to have hand-implemented compression, you can disallow built-in compression methods in your challenge (not retroactively, after answers are posted).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But by default Kolmogorov complexity is just the shortest string in a certain language that produces the intended output. This includes compression builtins, if that language contains them.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastActivityDate="2016-08-11T17:47:36.403" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9817" PostTypeId="2" ParentId="2140" CreationDate="2016-08-11T23:12:48.050" Score="2" Body="&lt;h1&gt;How synchronized are my clocks?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I have two clocks, &lt;em&gt;A&lt;/em&gt; and &lt;em&gt;B&lt;/em&gt;, and A always shows the exact time, however B is off by a certain amount of time, that I'd like to find out. (I know A and B run at the exact same speed.) I cannot read the exact time of both simultaneously, that means I can only switch back and forth and read the time sequentially. (For the sake of simplicity, both show their time as a real number (lets say hours), and each real number encodes an unique point in time.)&lt;/p&gt;&#xA;&lt;p&gt;So here is an example: &lt;code&gt;B: 1, A: 3, A: 5, B: 4.5&lt;/code&gt;. We see because of the first two entries &lt;code&gt;B: 1, A: 3&lt;/code&gt; that B is behind A by at most 2 hours, and that because of the last two entries &lt;code&gt;A: 5, B: 4.5&lt;/code&gt; we see that B is behind A by at least half an hour. So the possible interval of how much B is off is &lt;code&gt;[-2,-0.5]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a list of timestamps with their labels, return the possible interval by how much B can be off.&lt;/p&gt;&#xA;&lt;h2&gt;Details&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The list can be in any convenient format like [(timestamp, label),...] or as two lists [timestamp,...],[label,...] e.t.c&lt;/li&gt;&#xA;&lt;li&gt;You can assume that all the readings from A are in ascending. (and the same for B)&lt;/li&gt;&#xA;&lt;li&gt;If there is no such time interval, output something falsy.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Testcases:&lt;/h2&gt;&#xA;&lt;p&gt;(more to be added)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;label  A  B  A&#xA;time   1  4  5&#xA;output [-1,3]&#xA;&#xA;label  A B B A&#xA;time   1 2 5 2.5&#xA;output false&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Should only valid cases be considered, or should there be a check for invalid ones (remove point 2 or 3 of the details?)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Should the challenge be restricted to alternating readings (&lt;code&gt;ABABABABABA&lt;/code&gt;) or should random ones be allowed (&lt;code&gt;ABBAAABABAABBBABBBBB&lt;/code&gt;)? Restricting to alternating readings would make it pretty much trivial.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-12T08:44:04.467" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9819" PostTypeId="2" ParentId="2140" CreationDate="2016-08-12T08:38:09.783" Score="0" Body="&lt;h2&gt;How far is it?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I have no children myself but I understand they are more interested in the destination than the journey, so often ask how much of the journey is left. This might be a car trip, or it might be a demonstration of the Tower of Hanoi puzzle.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The original aim of the puzzle is to move all the disks from one pillar to another, but except for the smallest disk (which can be moved to any pillar at any time) the only disk you can move is the lowest numbered disk on the other two pillars.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although there is a well-known optimal sequence from one pillar to another, each of the three moves will take you slightly nearer to finishing on a different pillar. (This partly explains why there are only two available moves when all the disks are already on the same pillar.) It's therefore possible to mistakenly take a detour towards another pillar yet correct yourself and finish at your desired pillar without retracing your steps. You should therefore not assume that the input position is from the optimal sequence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is to write a program or function that accepts three sets (arrays, lists, strings, etc.) representing the sizes of the disks on each pillar and returns an integer giving the number of steps remaining to move all the disks to the first pillar. Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1, 2, 3] [0] [] -&amp;gt; 1&#xA;[2, 3] [0, 1] [] -&amp;gt; 3&#xA;[0, 1] [2] [3] -&amp;gt; 11&#xA;[0, 1, 2] [] [3] -&amp;gt; 15&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Not only must your program return the shortest number of steps possible, but it must itself also be as short as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please indicate whether your input format requires the disks in a particular order.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2016-08-15T12:27:28.860" LastActivityDate="2016-08-15T12:27:28.860" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9821" PostTypeId="2" ParentId="2140" CreationDate="2016-08-12T11:32:22.907" Score="2" Body="&lt;h1&gt;Print a booklet&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I want to take a PDF document and put four pages of that document onto the front and four pages onto the back of a sheet of paper. Then I'll fold and cut that page so that I end up with a 1/4─size booklet that holds 8 pages. This would produce two &lt;em&gt;folios&lt;/em&gt; comprising one &lt;em&gt;signature&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;           Fold here&#xA;            ↓&#xA;       ┌────┬────┐&#xA;       │    │    │&#xA;       │    │    │ ← Outer folio&#xA;Cut    │    │    │&#xA;here → ╞════╪════╡&#xA;       │    │    │&#xA;       │    │    │ ← Inner folio&#xA;       │    │    │&#xA;       └────┴────┘&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;LaTeX's &lt;code&gt;pdfpages&lt;/code&gt; package allows me to place 2x2 pages of a PDF per sheet of paper with a given page ordering.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I were to specify the option &lt;code&gt;pages={2,7,4,5,8,1,6,3}&lt;/code&gt; to &lt;code&gt;pdfpages&lt;/code&gt;, I would get:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;       Front of sheet&#xA;&#xA;        (1)     (8)     Back of sheet&#xA;          \     /&#xA;        ┌────┬────┐      (7)     (2)&#xA;        │    │    │        \     /&#xA;Outer   │  2 │  7 │      ┌────┬────┐&#xA;folio → │    │    │      │    │    │&#xA;        ╞════╪════╡      │  8 │  1 │ ← Outer folio&#xA;Inner   │    │    │      │    │    │&#xA;folio → │  4 │  5 │      ╞════╪════╡&#xA;        │    │    │      │    │    │&#xA;        └────┴────┘      │  6 │  3 │ ← Inner folio&#xA;        /          \     │    │    │&#xA;     (3)            (6)  └────┴────┘&#xA;                        /           \&#xA;                      (5)            (4)&#xA;&#xA;(Numbers put in parenthesis are referring to the back of the page.)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Why do we need that strange order of numbers? So that the fronts and backs of pages line up when put into the signature. This is how you read the book:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;    Start here at (1) on the back. Continue to 2 on the front.&#xA;      │&#xA;      │      End here at (8)&#xA;      ↓     /&#xA;    ┌────┬────┐&#xA;    │    │    │&#xA;    │  2 │  7 │ ← Outer folio&#xA;    │    │    │&#xA;    └────┴────┘&#xA;      │&#xA;On to (3) in&#xA;inner folio&#xA;      │&#xA;      ↓     ↑&#xA;          On to (6)&#xA;          in outer folio&#xA;            │&#xA;    ┌────┬────┐&#xA;    │    │    │&#xA;    │  4 │  5 │ ← Inner folio&#xA;    │    │    │&#xA;    └────┴────┘&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;But that's just for two folios from one sheet of paper. What if I want to use two sheets of paper, make four folios, and still combine all of them in one signature?&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;            Start at (1)&#xA;             │&#xA;             │      End here at (16)&#xA;             ↓       │&#xA;            (1)    (16)  (5)    (12)&#xA;              \     /      \     /&#xA;            ┌────┬────┐  ┌────┬────┐&#xA;            │    │    │  │    │    │&#xA;Outermost → │  2 │ 15 │  │  6 │ 11 │ ← Folio #3&#xA; folio (#1) │    │    │  │    │    │&#xA;            ╞════╪════╡  ╞════╪════╡&#xA;            │    │    │  │    │    │&#xA; Folio #2 → │  4 │ 13 │  │  8 │  9 │ ← Innermost&#xA;            │    │    │  │    │    │    folio (#4)      &#xA;            └────┴────┘  └────┴────┘&#xA;              /     \      /     \&#xA;            (3)    (14)  (7)    (10)&#xA;&#xA;            Front of      Front of&#xA;             sheet 1       sheet 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And your LaTeX option would be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;pages={2,15,4,13,16,1,14,3,6,11,8,9,12,5,10,7}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a function taking an integer &lt;code&gt;n&lt;/code&gt; of the number of pages in the final booklet (8 and 16 in the examples above) and returning a list integers (of length &lt;code&gt;n&lt;/code&gt; and ranging from 1 to &lt;code&gt;n&lt;/code&gt;) for the page numbers in the right order.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; f(8)&#xA;=&amp;gt; [2,7,4,5,8,1,6,3]&#xA;&#xA;&amp;gt; f(16)&#xA;=&amp;gt; [2,15,4,13,16,1,14,3,6,11,8,9,12,5,10,7]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Since we're dividing a sheet of paper into 4 pieces and using front and back, the input is always a multiple of 8. If the input is not a multiple of 8, the output is not defined but would prefer that it's rounded up to the next multiple of 8.&lt;/p&gt;&#xA;" OwnerUserId="23380" LastEditorUserId="23380" LastEditDate="2016-08-12T16:49:36.017" LastActivityDate="2016-08-12T16:49:36.017" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9824" PostTypeId="1" CreationDate="2016-08-12T19:42:18.797" Score="7" ViewCount="204" Body="&lt;p&gt;We've got a bunch of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; problems.  Furthermore, a lot of them have a bunch of similarities in their scoring systems.  I've taken the first 50 of them (excluding off topic), and classified them:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Accuracy based&lt;/strong&gt;:  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/84977/guess-the-language&quot;&gt;You&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/84481/domain-name-appraisal&quot;&gt;need&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/76320/fun-with-flags&quot;&gt;to&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/79219/reconstruct-a-missing-rgb-channel&quot;&gt;estimate&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/74585/who-said-that-2016-presidential-election&quot;&gt;the&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/73344/word-or-near-word&quot;&gt;correct&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/71631/upgoat-or-downgoat&quot;&gt;answer&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69920/whats-the-language&quot;&gt;based&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69791/the-branch-predictor-challenge&quot;&gt;on&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69285/plurality-voting-with-cellular-automata&quot;&gt;your&lt;/a&gt; input.  Your score is the percentage of times you are correct.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Smallest output&lt;/strong&gt;:  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/89654/minimal-word-search&quot;&gt;We&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/87444/diff-compression&quot;&gt;score&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/87311/compounding-english&quot;&gt;you&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/85239/latin-square-compression&quot;&gt;based&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/74970/stuffing-primes-in-a-box&quot;&gt;on&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69535/inverse-symbolic-calculator&quot;&gt;the&lt;/a&gt; size of your output&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Fewest steps&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/83585/find-the-cheese&quot;&gt;You&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/80555/image-hide-and-seek&quot;&gt;have&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/76866/find-the-shortest-way-to-advance-a-counter-to-a-certain-number&quot;&gt;a&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69799/know-a-sequence-by-its-subsequences&quot;&gt;limited&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69652/a-register-calculator-challenge&quot;&gt;set&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/77510/virtual-keyboard-text-input&quot;&gt;of&lt;/a&gt; possible operations.  Each operation counts as 1 point, lowest score wins.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Image accuracy&lt;/strong&gt;:  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/70351/compress-an-image-to-a-4-kib-preview&quot;&gt;Generate&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/75158/generate-ascii-art&quot;&gt;an&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69930/paint-starry-night-objectively-in-1kb-of-code&quot;&gt;image&lt;/a&gt;, we'll score it based on how close it is to the original&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Modified code-golf&lt;/strong&gt;:  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/88979/can-you-outgolf-me-cops-section&quot;&gt;We're&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/83564/rube-goldberg-hello-world&quot;&gt;scoring&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/80391/hi-can-you-draw-some-odd-art-bye&quot;&gt;the&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/88783/build-a-digital-clock-in-conways-game-of-life&quot;&gt;size&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/80179/find-the-last-three-words-of-each-paragraph-if-they-are-shorter-than-20-characte&quot;&gt;of&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/79351/traveling-on-a-flat-earth&quot;&gt;your&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/75256/good-old-suffix-vector&quot;&gt;code&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/71117/the-ppcg-handicap-system&quot;&gt;but&lt;/a&gt; tweaking it a bit.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Other&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/85443/thwart-lepton-compression&quot;&gt;These&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/82461/write-a-program-that-always-prints-n-when-it-is-shifted-n-times-up-the-ascii-alp&quot;&gt;scoring&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/77100/where-will-the-cat-go-orbital-mechanics&quot;&gt;systems&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/76781/tweetable-hash-function-challenge&quot;&gt;are&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/73710/model-a-probability-table-using-15-bit-fixed-probabilities&quot;&gt;pretty&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/71797/make-a-long-type-signature&quot;&gt;unique&lt;/a&gt; and hard to classify&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Therefore:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Does this seem like good information to tag?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Do my categories seem reasonable?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What should the tags be named, and what should their descriptions be?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Which of these tags (if any) should be a formal scoring system?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Should we retroactively go back and retag?  (There are currently 559 of them)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-08-22T15:15:38.207" Title="Classification of code challenges" Tags="|discussion|tags|" AnswerCount="3" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9825" PostTypeId="2" ParentId="9824" CreationDate="2016-08-12T20:41:26.150" Score="0" Body="&lt;p&gt;Here are my suggestions for tags:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Accuracy-based&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt; (presumably there would be a set of test cases to test against)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Output size&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimized-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimized-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimized-output&lt;/a&gt; (yes, this tag exists)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Fewest steps&lt;/strong&gt;: I don't actually have a good suggestion for this one yet&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Image accuracy&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-estimation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-estimation&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-estimation&lt;/a&gt; (note that this is the only new tag)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Modified code golf&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; (these don't have much of a common theme, so it's not worth making a separate tag)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2016-08-13T03:51:11.730" LastActivityDate="2016-08-13T03:51:11.730" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9826" PostTypeId="2" ParentId="2140" CreationDate="2016-08-12T21:14:15.923" Score="2" Body="&lt;h1&gt;De-Parenthesize Ruby&lt;/h1&gt;&#xA;&lt;p&gt;Reuben wants to start programming and golfing in Ruby. However, since he learned programming from his siblings Cecil and Emma, who program in C and ECMAScript respectively, he's developed a habit of adding parentheses to all sorts of functions when he doesn't need to. However, he can't just remove all the parentheses either! Help him by writing a short program that will remove some of the parentheses for him.&lt;/p&gt;&#xA;&lt;h3&gt;The Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given a snippet of Ruby code (you don't need to worry if it's valid code or not), apply the following rules to remove parentheses from function calls wherever possible. Whenever parentheses are removed, put a whitespace in between the function call and the arguments (even if in actual golfing practice it isn't needed, such as in the case of &lt;code&gt;print&amp;quot;hello&amp;quot;&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;p&gt;For the purposes of this challenge, not all parts of Ruby need to be checked:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Variables/functions will contain alphanumerics and underscore only, and won't start with numbers. (No functions like &lt;code&gt;array.slice!(1,4).include?(6)&lt;/code&gt;, and no variables like &lt;code&gt;$a&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Blocks (curly braces after functions, or for declaring stabby-lambdas) are not present. No &lt;code&gt;array.map{|i|i+1}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Function definitions like &lt;code&gt;def f(x)&lt;/code&gt; will not be present.&lt;/li&gt;&#xA;&lt;li&gt;No backslashes &lt;code&gt;\&lt;/code&gt; so you don't have to parse something like &lt;code&gt;&amp;quot;\&amp;quot;hello\&amp;quot;&amp;quot;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;No comments. (Comments in Ruby start with &lt;code&gt;#&lt;/code&gt;.) If a &lt;code&gt;#&lt;/code&gt; appears in code, it's going to be part of a string.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;These are the only rules you need to check for:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Functions without any parameters always have their parens removed.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;array.size()+array.something().length() -&amp;gt; array.size+array.something.length&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Functions at the end of a method chain can be removed &lt;em&gt;only if they are not next to an arithmetic operator.&lt;/em&gt;&lt;/strong&gt;&#xA;&lt;br&gt;For the purposes of this challenge, the operators used will be &lt;code&gt;+&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;, &lt;code&gt;*&lt;/code&gt;, &lt;code&gt;/&lt;/code&gt;, &lt;code&gt;%&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;num.parse(3,7) -&amp;gt; num.parse 3,7&#xA;string.gsub(&amp;quot;this&amp;quot;,&amp;quot;that&amp;quot;).count(&amp;quot;t&amp;quot;) -&amp;gt; string.gsub(&amp;quot;this&amp;quot;,&amp;quot;that&amp;quot;).count &amp;quot;t&amp;quot;&#xA;1+string.count(&amp;quot;T&amp;quot;) -&amp;gt; 1+string.count(&amp;quot;T&amp;quot;) # no change&#xA;1+(string.count(&amp;quot;T&amp;quot;)) -&amp;gt; 1+(string.count &amp;quot;T&amp;quot;)&#xA;puts(3,8*7) -&amp;gt; puts 3,8*7&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;If a function contains another function call as its &lt;em&gt;only function argument&lt;/em&gt;, apply the other rules to that function as well.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;print(print(x.sub(a,b.to_s(16)))) -&amp;gt; print print x.sub a,b.to_s(16)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;If a string substitution operator &lt;code&gt;#{...}&lt;/code&gt; is present within a string (enclosed with double quotes), remove parens from the functions in accordance to the other rules.&lt;/strong&gt;&#xA;&lt;br&gt; Assume that the contents within the string substitution don't include any literal strings, including single-character &amp;quot;question mark&amp;quot; strings like &lt;code&gt;?a&lt;/code&gt;. This means that things like &lt;code&gt;&amp;quot;#{&amp;quot;a}#{&amp;quot;}&amp;quot;&lt;/code&gt; or &lt;code&gt;&amp;quot;#{?}}&amp;quot;&lt;/code&gt; do not need to be dealt with.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;hello() #{world().string(5)}&amp;quot; -&amp;gt; &amp;quot;hello() #{world.string 5}&amp;quot;&#xA;&amp;quot;hello() # {world()}&amp;quot; -&amp;gt; &amp;quot;hello() # {world()}&amp;quot; # no change&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ruby&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ruby&amp;#39;&quot; rel=&quot;tag&quot;&gt;ruby&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Might add more rules or other things in the future if people want, before it gets published of course.&lt;/p&gt;&#xA;&lt;p&gt;Would this be a duplicate of something like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/79436/remove-unnecessary-parentheses&quot;&gt;Remove unnecessary parentheses&lt;/a&gt;? It's a similar concept but with different rules&lt;/p&gt;&#xA;" OwnerUserId="52194" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-25T21:33:45.963" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9830" PostTypeId="1" AcceptedAnswerId="9832" CreationDate="2016-08-13T11:55:38.660" Score="7" ViewCount="204" Body="&lt;p&gt;If you look in the sandbox edit history there seems to be a long chain of edits where the community moderator removes the featured tag, and a trusted moderator replaces it. This is similar to the issue with it being protected. Is it possible to prevent the community moderator from editing the sandbox question? I don't know how feasible this is.&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="8608" LastEditDate="2016-08-15T09:30:41.247" LastActivityDate="2016-08-15T09:30:41.247" Title="Community Moderator Removing Sandbox featured tag" Tags="|discussion|bug|status-bydesign|sandbox|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9831" PostTypeId="2" ParentId="8350" CreationDate="2016-08-13T13:32:22.337" Score="19" Body="&lt;h1&gt;Allow the sandbox to be permanently featured&lt;/h1&gt;&#xA;&lt;p&gt;Most sites don't have or need a sandbox. Since we have &amp;quot;challenges&amp;quot; instead of &amp;quot;questions&amp;quot; it is very important to have a sandbox and to make sure that it is easily seen by new users, so that our challenge-quality can stay high. So, we have the sandbox featured.&lt;/p&gt;&#xA;&lt;p&gt;However on other sites, it doesn't make sense to have a single meta post permanently featured, and so it is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5457/31716&quot;&gt;automatically un-featured every month&lt;/a&gt;. On one hand, mods can re-feature it every month, but this certainly isn't the best solution. There is right now a history of almost 200 edits on the sandbox. It would be nice if we could just have it always featured instead.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-13T13:32:22.337" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9832" PostTypeId="2" ParentId="9830" CreationDate="2016-08-13T13:35:48.867" Score="11" Body="&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5457/31716&quot;&gt;known issue&lt;/a&gt;. Really, it makes sense why it would be automatically un-featured every month, because other sites have no need to keep things permanently featured. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;At first, I had thought this was on our list of requests, but after checking, it was not. So I went ahead and added an answer to our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9831/31716&quot;&gt;list of site-specific feature requests&lt;/a&gt;, which is a list of things we want for the site, but can't implement without a lot of SE dev work. &lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2016-08-13T13:35:48.867" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9834" PostTypeId="1" CreationDate="2016-08-14T22:55:46.773" Score="3" ViewCount="159" Body="&lt;p&gt;As I understand it, for our purposes a language is more or less defined by its implementation. That's one of the reasons why a program like Vim can also be &quot;language&quot;. You just count keystrokes instead of bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But consider the case of Haskell with its standard compiler + interpreter of ghc/ghci.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's say I have found a solution for a question that I could write in its own file as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import Data.ACME&#xA;g=filter(`elem`&quot;+-*/&quot;)&#xA;f=((someAcmeFunction.g)+).g&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The details are not important. I can compile this program in ghc or I can run it in ghci. The actions needed to load and execute the file are not counted towards the score. But in general practice - and I feel like that is supported by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9031/unnamed-functions-in-code-golf&quot;&gt;Unnamed Functions in Code Golf&lt;/a&gt;, it is also acceptable to present the solution as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import Data.ACME&#xA;g=filter(`elem`&quot;+-*/&quot;)&#xA;((someAcmeFunction.g)+).g&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Notice that I saved two bytes by not giving the last function a name. I can &lt;em&gt;not&lt;/em&gt; run this solution in one part. The first two lines must be loaded from a file while the last one must be run interactively. It can not even be supplied as a parameter if it needs to get some input. Still - this seems to be accepted practice. Now let's take this a step further.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;:m +Data.ACME&#xA;let g=filter(`elem`&quot;+-*/&quot;)&#xA;((someAcmeFunction.g)+).g&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is what I would do in a fully interactive session. The interactive import saves some &lt;del&gt;bytes&lt;/del&gt; keystrokes, but the interactive definition adds some back. Still, sometimes I might save a bit. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I could also combine both approaches differently&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;g=filter(`elem`&quot;+-*/&quot;)&#xA;:m +Data.ACME&#xA;((someAcmeFunction.g)+).g&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;One line to be loaded, two to be run interactively.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All this doesn't feel right because I'm hiding some interactions. But if I have to load a file or select a codepage before running my program, that's interactions, too, and we accept those. Where does the &quot;wrongness&quot; start? It's not a new topic, but &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/273/on-interactive-answers-and-other-special-conditions&quot;&gt;On &amp;quot;interactive&amp;quot; answers and other special conditions&lt;/a&gt; did not provide the answers I am looking for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I feel like the answer has to do with this: I'm only partially programming in Haskell! &lt;code&gt;:m&lt;/code&gt; is not a Haskell command but a ghci one. I could as well start using &lt;code&gt;:def&lt;/code&gt; to define my own commands or &lt;code&gt;:!&lt;/code&gt; to run system commands. Yet this is only a natural extension of accepting plain function definitions as solutions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So is the build environment a different &quot;language&quot;?&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Update&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A huge part of this question is answered in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7842/when-is-code-that-requires-a-repl-acceptable&quot;&gt;When is code that requires a REPL acceptable?&lt;/a&gt;, so thanks for making me aware of it. I leave this question open in the hope of finding a more defined separation than there.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The general consensus in comments to the other question seems to be that both the language and the REPL are indeed separate languages. At the same time, elements of the REPL are acceptable in a &quot;pure-language&quot;-answer if they are not &quot;significant&quot;. I think I have demonstrated how blurry the area between both can be. At the same time, I have not seen many REPL-solutions &quot;in the wild&quot;, so maybe there's an unspoken dislike of them - possibly because of that blurriness. (Or is it just that they require less creativity?)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, what is &quot;significant&quot;? It's probably impossible to define clear rules like &quot;66.7% of the code must be outside the REPL&quot; - but maybe there are some softer guidelines one could follow?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Feel free to close this question as a dupe if you think such discussions are fruitless or should be left for the historians after we have had more time to form our culture. ;)&lt;/p&gt;&#xA;" OwnerUserId="55465" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2023-09-09T12:00:04.810" Title="Is the interpreter part of the language or a separate language?" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9835" PostTypeId="2" ParentId="2140" CreationDate="2016-08-15T01:06:40.757" Score="0" Body="&lt;h2&gt;Convert Between American and British English Spellings&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/natural-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;natural-language&amp;#39;&quot; rel=&quot;tag&quot;&gt;natural-language&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you will have to write two programs or functions. One will convert a list of words from their American English spelling to the British English equivalent, and the other to convert the other way. Here's that catch: you only have &lt;strong&gt;300 bytes to do both&lt;/strong&gt;!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You can find a gist &lt;a href=&quot;https://gist.github.com/GamrCorps/5e7dd531df99be4408bd768ded36aad9&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;here&lt;/strong&gt;&lt;/a&gt; that contains a list of &lt;strong&gt;1000&lt;/strong&gt; words. The file is formatted so each line is &lt;code&gt;british-spelling(space)american-spelling&lt;/code&gt;. Therefore, there are only &lt;strong&gt;500&lt;/strong&gt; words in total, each with &lt;strong&gt;2&lt;/strong&gt; spellings. This file is for your convenience, and it was based on the list found &lt;a href=&quot;https://en.wikipedia.org/wiki/Wikipedia:List_of_spelling_variants&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to write two programs or functions (has to be two programs or two functions, it can't be one program and one function). Both will take a single string as input and output a single string. The first program/function will take in British English words and output the American English spelling, and the second will take in American English words and output the British English spelling. &lt;strong&gt;Built-in functions or libraries that do this task are not allowed, nor are standard loopholes.&lt;/strong&gt; You also cannot hard-code the list into your program. Your programs and functions have a shared 300 byte limit, i.e. &lt;code&gt;length(program1)+length(program2)&amp;lt;=300&lt;/code&gt;. However, each program/function may be of different length.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You will be scored based on how accurate your programs/functions were. Your score will be calculated based on the following formula:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://latex.codecogs.com/png.latex?%5Clarge%20%5Cfrac%7B%5Ctext%7BBrE%20to%20AmE%20words%20correct%20%7D%20&amp;plus;%20%5Ctext%7B%20AmE%20to%20BrE%20words%20correct%7D%7D%7B1000%7D&quot; alt=&quot;formula&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Highest score wins. Ties are broken by shortest shared byte total.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;SANDBOX NOTES&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;I can't help but fell like I am missing something.&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Should I post the gist contents here, as well as a link to it?&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Is 300 bytes too generous, too litte, or is it fine?&lt;/em&gt;&lt;/li&gt;&#xA; - &#xA;&lt;/ul&gt;&#xA;" OwnerUserId="36670" LastActivityDate="2016-08-15T01:06:40.757" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9839" PostTypeId="2" ParentId="2140" CreationDate="2016-08-15T15:08:54.983" Score="2" Body="&lt;h1&gt;The Coin Flop KoTH&lt;/h1&gt;&#xA;&lt;p&gt;In this challenge, you start out with a stack of 100 coins, alternating between gold and silver:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1.   Gold&#xA;2.   Silver&#xA;3.   Gold&#xA;4.   Silver&#xA;     ...&#xA;99.  Gold&#xA;100. Silver&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Now, Gold, Inc. will pay you for any gold coins you can give them.  Furthermore, they really like bulk shipment.  If a shipment contains &lt;code&gt;N&lt;/code&gt; coins, they will pay you &lt;code&gt;N^2&lt;/code&gt; for that shipment.&lt;/p&gt;&#xA;&lt;p&gt;However, you've only got 1 truck to share between you and your opponent, who has a similar contract with Silver, Inc.&lt;/p&gt;&#xA;&lt;h1&gt;Game play&lt;/h1&gt;&#xA;&lt;p&gt;Each turn, the following steps occur:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;strong&gt;Flip a section of coins&lt;/strong&gt; (like pancakes)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Collect the top coins&lt;/strong&gt; (of the same type)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Ship off the collected coins&lt;/strong&gt; (worth &lt;code&gt;N^2&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;1. Flip:&lt;/h2&gt;&#xA;&lt;p&gt;You or your opponent can each select a range to reverse.  For example, if you selected the range &lt;code&gt;[1,3]&lt;/code&gt;, the following would occur:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Gold                        Gold&#xA;Silver                      Gold&#xA;Gold          -&amp;gt;            Gold&#xA;Gold                        Silver&#xA;Silver                      Silver&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Notice how the top stack now has 3 golds in a row, which would be worth 9.&lt;/p&gt;&#xA;&lt;p&gt;However, you only get to flip every other turn, and your opponent gets to flip on the other turns.&lt;/p&gt;&#xA;&lt;h1&gt;2. Collect&lt;/h1&gt;&#xA;&lt;p&gt;We collect all similar coins from the top of the stack, and put them in the truck:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Silver&#xA;Silver&#xA;Gold&#xA;Silver&#xA;Gold&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Would result in 2 Silvers being put in the truck.&lt;/p&gt;&#xA;&lt;h1&gt;3. Ship&lt;/h1&gt;&#xA;&lt;p&gt;If the truck contains gold coins, then we send it off to Gold, Inc and we get paid &lt;code&gt;N^2&lt;/code&gt;, where &lt;code&gt;N&lt;/code&gt; is the number of coins in the truck.  (Our opponent gets paid if the truck contains silver coins)&lt;/p&gt;&#xA;&lt;p&gt;After the stack is empty, the player with the most money wins!&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox questions:&lt;/h1&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Is this clear?&lt;/li&gt;&#xA;&lt;li&gt;Does this seem interesting at all (if it isn't, &lt;em&gt;please&lt;/em&gt; say so)?  What are some interesting strategies you can come up with?&lt;/li&gt;&#xA;&lt;li&gt;Is there a never-lose strategy?&lt;/li&gt;&#xA;&lt;li&gt;I'm debating adding a &amp;quot;Freeze&amp;quot; as an alternative to &amp;quot;Flip&amp;quot;, which would cause &lt;em&gt;2&lt;/em&gt; collect/ship actions to occur.  (Your opponent's turn would then be next)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-15T21:07:13.610" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9840" PostTypeId="1" CreationDate="2016-08-15T16:32:28.593" Score="2" ViewCount="112" Body="&lt;p&gt;I was going to submit an answer but it would have to import a module (which is built-in to Python). This makes my answer two-lined, because of the import. Is this acceptable?&lt;/p&gt;&#xA;" OwnerUserId="49400" LastActivityDate="2016-08-15T16:35:55.707" Title="Do answers have to be on one line?" Tags="|support|answers|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9841" PostTypeId="2" ParentId="9840" CreationDate="2016-08-15T16:35:55.707" Score="9" Body="&lt;p&gt;Of course it is acceptable. :)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your answer can span as many lines as you like (in fact, there are many languages used around here where &lt;em&gt;most&lt;/em&gt; programs have to span multiple lines). Just add the required linefeeds to your byte count. Simple example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;foo&#xA;bar&#xA;baz&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Would be 11 bytes. (Unless the program requires a trailing linefeed as well, in which case it would be 12 bytes, but I don't think you'll have to worry about that in Python.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-08-15T16:35:55.707" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9843" PostTypeId="2" ParentId="2140" CreationDate="2016-08-16T02:12:28.060" Score="-2" Body="&lt;h1&gt;Crab Canon&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A crab canon is a piece of music where the same tune is played backwards and forwards at the same time, and it somehow sounds nice. The most famous example is &lt;a href=&quot;https://www.youtube.com/watch?v=36ykl2tJwZM&quot; rel=&quot;nofollow noreferrer&quot;&gt;this one&lt;/a&gt; by Bach. In &lt;em&gt;Godel, Escher, Bach&lt;/em&gt;, Douglas Hofstadter wrote a &lt;a href=&quot;https://txti.es/crab-canon&quot; rel=&quot;nofollow noreferrer&quot;&gt;crab canon in dialog form&lt;/a&gt;, in which the characters of Achilles and the Tortoise alternate lines, with one set of lines being the same as the other set except backwards. Somehow, it makes sense.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is to write a program inspired by this art form. The only requirement is that there has to be some sort of reversal of the source code involved. For example, you could make a program that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Prints its own source code, but backwards&lt;/li&gt;&#xA;&lt;li&gt;Does the same thing when reversed&lt;/li&gt;&#xA;&lt;li&gt;Both of the above at the same time&lt;/li&gt;&#xA;&lt;li&gt;Or make up something creative and wow the voters!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The reversal can happen on pretty much whatever level you want: lines of code, characters, characters within lines, or whatever makes sense for your language. The Hofstadter Crab Canon has some small changes between the two sets of lines for the sake of coherence, you can do something similar if you feel it is necessary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;This is a popularity contest, the answer with the most votes wins.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="8611" LastActivityDate="2016-08-16T02:12:28.060" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9844" PostTypeId="2" ParentId="2140" CreationDate="2016-08-16T07:02:27.057" Score="0" Body="&lt;h1&gt;Left and Right&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given an input string, in ASCII, output &quot;)|]&quot; as many times as the case-insensitive word &quot;right&quot; appears in input, and output &quot;(|[&quot; as many times as the case-insensitive word &quot;left&quot; appears in input. The order is irrelevant. If and only if no occurences of these words are in input, output &quot;X|X&quot;. &lt;strong&gt;Spacing between items is optional&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, less bytes is best&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input -&amp;gt; output&#xA;RightRightighteftleft -&amp;gt; (|[ )|] )|], or some other ordering&#xA;this doesn't contain either word -&amp;gt; X|X&#xA;LEfT, LeFT, leFT, righT -&amp;gt; (|[ (|[ (|[ )|]&#xA;(|[ -&amp;gt; X|X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="55896" LastEditorUserId="55896" LastEditDate="2016-08-16T09:09:40.520" LastActivityDate="2016-08-16T09:09:40.520" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9846" PostTypeId="2" ParentId="2140" CreationDate="2016-08-16T12:25:43.710" Score="-2" Body="&lt;h2&gt;Petals around the Roses&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given 5 numbers from 1 to 6, calculate the number of Roses, Petals and Roots. Try guessing the formulas yourself by visiting &lt;a href=&quot;http://jetpackshark.com/RPS&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://jetpackshark.com/RPS&lt;/a&gt; before reading anybody's answers. (The dice-like display is significant.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2016-08-16T12:25:43.710" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9847" PostTypeId="1" CreationDate="2016-08-16T13:28:30.840" Score="2" ViewCount="156" Body="&lt;p&gt;New to code golf and tried finding an answer to this question but couldn't (surprisingly)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When scoring my golfed Java code I was told that I need to add in my imports as part of my score. My question is, if for example I am using a &lt;code&gt;List&lt;/code&gt;. Do I need to use &lt;code&gt;import java.util.*&lt;/code&gt; or (if it is only appearing once in my code anyway) use &lt;code&gt;java.util.List&amp;lt;T&amp;gt; list = whatever;&lt;/code&gt; when I make the actual call which would obviously be shorter.&lt;/p&gt;&#xA;" OwnerUserId="57042" LastActivityDate="2016-08-16T14:00:06.217" Title="Do I need to use imports or can I call a class explicity?" Tags="|discussion|code-golf|scoring|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9848" PostTypeId="2" ParentId="9847" CreationDate="2016-08-16T13:49:54.840" Score="2" Body="&lt;p&gt;You don't need to use an import if you fully qualify the class, as you guessed and Leaky Nun said in comments. Usually it's shorter this way, unless you need to use a class multiple times. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is included in &lt;a href=&quot;https://codegolf.stackexchange.com/q/6671/14215&quot;&gt;Tips for golfing in Java&lt;/a&gt;, by the way, which is a recommended read if you haven't yet.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-08-16T13:49:54.840" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9849" PostTypeId="2" ParentId="9847" CreationDate="2016-08-16T14:00:06.217" Score="1" Body="&lt;p&gt;I don't know very much about java, but if&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;java.util.List&amp;lt;T&amp;gt; list = whatever&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Is valid &lt;em&gt;without&lt;/em&gt; the import, the you do &lt;em&gt;not&lt;/em&gt; need to use&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import java.util.*&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In general, I would say only you need whatever it takes to make your program successfully compile/run. If you are using a function instead of a full program, you must include any necessary includes/imports so that you could copy and paste the entire submission into a full program, and it would successfully compile/run.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, if there is another approach that allows you to avoid the wordy imports, by all means, use this shorter approach! &lt;em&gt;As long as it is still valid java,&lt;/em&gt; remove any imports you want. &lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2016-08-16T14:00:06.217" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9851" PostTypeId="2" ParentId="9824" CreationDate="2016-08-16T18:25:18.957" Score="4" Body="&lt;p&gt;I propose a new tag, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fewest-operations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fewest-operations&amp;#39;&quot; rel=&quot;tag&quot;&gt;fewest-operations&lt;/a&gt;, to be used &lt;strong&gt;as a scoring tag&lt;/strong&gt;.  This means it shouldn't be used with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The OP needs to define what operation(s) are going to be scored&lt;/strong&gt;.  If there are multiple scored operations, then the OP can optionally define a different weight to each of the steps, otherwise it's assumed to be 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;A submission's score is calculated by running all of the test cases and counting the total number of operations executed&lt;/strong&gt; (multiplied by the weight, if applicable).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I prefer &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fewest-operations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fewest-operations&amp;#39;&quot; rel=&quot;tag&quot;&gt;fewest-operations&lt;/a&gt; because I feel that it is clearer than &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fewest-steps&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fewest-steps&amp;#39;&quot; rel=&quot;tag&quot;&gt;fewest-steps&lt;/a&gt;.  I also considered &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-fastest-code&lt;/a&gt;, but it's a mouthful and not as immediately understandable (in my opinion).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also propose that &lt;strong&gt;we should retroactively re-tag posts that use this scoring mechanism&lt;/strong&gt;.  There are some &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/golf-cpu&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;golf-cpu&amp;#39;&quot; rel=&quot;tag&quot;&gt;golf-cpu&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenges.  I believe that they also lie under &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fewest-operations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fewest-operations&amp;#39;&quot; rel=&quot;tag&quot;&gt;fewest-operations&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This answer is not intended to be all-inclusive of classification changes to be made, and is only addressing the &quot;Fewest Steps&quot; bullet point.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2016-08-16T19:35:48.757" LastActivityDate="2016-08-16T19:35:48.757" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9853" PostTypeId="2" ParentId="2140" CreationDate="2016-08-17T06:52:36.407" Score="-2" Body="&lt;h2&gt;Write a Brainfuck interpreter in Brainfuck&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Since &lt;a href=&quot;https://en.wikipedia.org/wiki/Brainfuck&quot; rel=&quot;nofollow&quot;&gt;Brainfuck&lt;/a&gt; is known to be turing-complete, it is possible to write a Brainfuck interpreter in Brainfuck. This is what you're supposed to do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will get the input from the standard input and output to the standard output. This is a programming-puzzle, so the length is not top priority, however if there are multiple solutions, the shortest one wins!&lt;/p&gt;&#xA;" OwnerUserId="53809" LastActivityDate="2016-08-17T06:52:36.407" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9855" PostTypeId="1" CreationDate="2016-08-17T15:07:15.537" Score="0" ViewCount="88" Body="&lt;p&gt;I like to answer in &lt;code&gt;C#&lt;/code&gt; pretty much exclusively so far. Whenever I answer I either include the &lt;code&gt;using&lt;/code&gt; statements required or fully qualify anything else.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I often see a lot of &lt;code&gt;C#&lt;/code&gt; answers that do not do this and people are always unsure in the comments as to whether or not they should include them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As I have not found a question asking this and relating to &lt;code&gt;C#&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should C# answers include the using statements/be fully qualified or is not doing this okay?&lt;/p&gt;&#xA;" OwnerUserId="38550" LastActivityDate="2016-08-17T15:07:15.537" Title="Should C# answers include usings or be fully qualified?" Tags="|discussion|answers|" AnswerCount="0" CommentCount="2" ClosedDate="2016-08-18T04:58:41.357" ContentLicense="CC BY-SA 3.0" />
  <row Id="9860" PostTypeId="2" ParentId="2140" CreationDate="2016-08-17T19:11:20.793" Score="0" Body="&lt;h1&gt;Enumerate Irreducible Polynomials in GF(2)[X]&lt;/h1&gt;&#xA;&lt;h2&gt;Meta:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I noticed this is a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/66911/find-the-xor-primes&quot;&gt;Find the XOR Primes&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Would it make it a non-dupe if we'd go from &lt;code&gt;q=2&lt;/code&gt; to &lt;code&gt;q=3&lt;/code&gt;?&lt;/li&gt;&#xA;&lt;li&gt;Would it be more interesting for the general case, where the submissions have to take &lt;code&gt;q&lt;/code&gt;(prime) &lt;em&gt;and&lt;/em&gt; &lt;code&gt;n&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary&amp;#39;&quot; rel=&quot;tag&quot;&gt;binary&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polynomials&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polynomials&amp;#39;&quot; rel=&quot;tag&quot;&gt;polynomials&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/abstract-algebra&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;abstract-algebra&amp;#39;&quot; rel=&quot;tag&quot;&gt;abstract-algebra&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;A polynomial over any finite field &lt;code&gt;GF(q)&lt;/code&gt; of prime order &lt;code&gt;q&lt;/code&gt; can be represented by an integral polynomial with coefficients in &lt;code&gt;{0,1,2,...,q-1} ⊂ ℤ&lt;/code&gt; by the reduction modulo &lt;code&gt;q&lt;/code&gt;. This allows us to easily enumerate all polynomials with coefficients in that field by using a polynomial &lt;code&gt;p&lt;/code&gt; with coefficients in &lt;code&gt;{0,1,2,...,q-1} ⊂ ℤ&lt;/code&gt; and evaluating it in &lt;code&gt;q&lt;/code&gt;. So we map such a polynomial &lt;code&gt;p&lt;/code&gt; to a nonnegative integer &lt;code&gt;p(q)&lt;/code&gt;. It is easy to show that this mapping is a bijection between the set of said polynomials and the nonnegative integers, when you consider one of those polynomials &lt;code&gt;p(X)&lt;/code&gt; as an integer in base &lt;code&gt;X&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Let &lt;code&gt;I&lt;/code&gt; be the set of irreducible polynomials with coefficients in &lt;code&gt;GF(2)&lt;/code&gt;, represented by integral polynomials with coefficients in &lt;code&gt;{0,1}&lt;/code&gt;. Then enumerate all elements of &lt;code&gt;{p(2) | p ∊ I} ⊂ ℤ&lt;/code&gt; in ascending order and let &lt;code&gt;a(n)&lt;/code&gt; be the &lt;code&gt;n&lt;/code&gt;th element. Given &lt;code&gt;n&lt;/code&gt; your submission should return &lt;code&gt;a(n)&lt;/code&gt;. This is in fact &lt;a href=&quot;http://oeis.org/A014580&quot; rel=&quot;nofollow noreferrer&quot;&gt;A014580&lt;/a&gt; in OEIS.&lt;/p&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;The irreducible polynomials in &lt;code&gt;GF(2)[X]&lt;/code&gt; with a degree of at most 3 are: &lt;code&gt;{p1(X)=X, p2(X)=1+X, p3(X)=1+X+X^2}&lt;/code&gt;. Substituting &lt;code&gt;X&lt;/code&gt; by &lt;code&gt;2&lt;/code&gt; results in &lt;code&gt;p1(2)=2, p2(2)=3, p3(2)=7&lt;/code&gt;. So we see &lt;code&gt;a(1) = 2, a(2) = 3, a(3)=7&lt;/code&gt;. Some more of those polynomials can be found on &lt;a href=&quot;http://mathworld.wolfram.com/IrreduciblePolynomial.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;MathWorld&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt; n  a(n)&#xA; 1    2&#xA; 2    3&#xA; 3    7&#xA; 4   11&#xA; 5   13&#xA; 6   19&#xA; 7   25&#xA;20  103&#xA;34  203&#xA;35  211&#xA;50  355&#xA;53  369&#xA;54  375&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-17T21:55:04.030" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9861" PostTypeId="1" CreationDate="2016-08-18T04:00:52.543" Score="0" ViewCount="92" Body="&lt;p&gt;While working on a code snipped for a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/82609/stack-exchange-vote-counter/&quot;&gt;recent question&lt;/a&gt;, I found that due to the self-referential nature of the answer, it would have been helpful to have a sandbox or test area for answers that aren't quite ready to be published.  (The gist of the code golf question was to create an answer that returned some basic SE statistics about itself.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Previewing before posting had limitations since there was not an answer ID to test against.  To avoid confusion, I wouldn't want to post an answer-in-progress on the original question, but the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;question sandbox&lt;/a&gt; didn't seem like the appropriate place either.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there a temporary work area or thread that I'm missing, or should one be started?  I realize that most questions would not benefit much from this, and I'm having trouble thinking up with other situations where this feature would be needed.  As an alternative, if there is a way to flag an answer as &lt;em&gt;incubating&lt;/em&gt; or &lt;em&gt;unpublished&lt;/em&gt;, that would be preferable.&lt;/p&gt;&#xA;" OwnerUserId="56253" LastEditorUserId="68942" LastEditDate="2021-06-09T05:42:31.613" LastActivityDate="2021-06-09T05:42:31.613" Title="Is there a sandbox or &quot;unpublished&quot; option for answers that are being developed?" Tags="|discussion|feature-request|status-declined|sandbox|" AnswerCount="0" CommentCount="6" ClosedDate="2016-08-18T20:35:55.700" ContentLicense="CC BY-SA 3.0" />
  <row Id="9863" PostTypeId="2" ParentId="9791" CreationDate="2016-08-18T16:52:01.593" Score="7" Body="&lt;h1&gt;Use challenge types to compile a stripped-down &quot;challenge format&quot; to full-blown explanations&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;My original idea, which spurred Nathan to make this post, was a tool that &lt;em&gt;converts&lt;/em&gt; such a type signature -- along with some metadata -- into a lengthy specification. The output would follows a clear template, explain all our default rules, include a leaderboard snippet, etc. Something like a &quot;templating language&quot; for PPCG challenges, that compiles to Markdown. I'd feed it something like&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Int, Int -&amp;gt; AsciiArt&#xA;&#xA;Given two positive integers **w** and **h**, print a **w** by **h** rectangle of `X`s.&#xA;&#xA;&amp;lt; 3 5&#xA;&amp;gt; XXX&#xA;&amp;gt; XXX&#xA;&amp;gt; XXX&#xA;&amp;gt; XXX&#xA;&amp;gt; XXX&#xA;&amp;lt; 10 2&#xA;&amp;gt; XXXXXXXXXX&#xA;&amp;gt; XXXXXXXXXX&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and it would output&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Task&#xA;====&#xA;&#xA;Given two positive integers **w** and **h**, print a **w** by **h** rectangle of `X`s.&#xA;&#xA;Test cases&#xA;==========&#xA;&#xA;Example input 1:&#xA;&#xA;    3 5&#xA;&#xA;Example output 1:&#xA;&#xA;    XXX&#xA;    XXX&#xA;    XXX&#xA;    XXX&#xA;    XXX&#xA;&#xA;Example input 2:&#xA;&#xA;    10 2&#xA;&#xA;Example output 2:&#xA;&#xA;    XXXXXXXXXX&#xA;    XXXXXXXXXX&#xA;&#xA;Rules&#xA;=====&#xA;&#xA;* Your solution must be either a function/subroutine definition, or a full program.&#xA;&#xA;* Your solution may receive input in the following ways:&#xA;&#xA;  * Two integer function arguments.&#xA;  * Two command line arguments.&#xA;  * Two integers, in any reasonable string format, read from STDIN.&#xA;  * ...&#xA;&#xA;* Your solution may produce output in the following ways:&#xA;&#xA;  * Return/print an ASCII-art string, with newlines separating the rows.&#xA;  * Return/print a list of strings, each representing a row.&#xA;  * ...&#xA;&#xA;* This is [tag:code-golf], so the shortest solution (in bytes) wins.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="3852" LastEditorUserId="3852" LastEditDate="2016-08-18T17:14:28.263" LastActivityDate="2016-08-18T17:14:28.263" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9864" PostTypeId="2" ParentId="1213" CreationDate="2016-08-18T18:13:01.670" Score="1" Body="&lt;h2&gt;PowerShell&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://azure.microsoft.com/en-us/blog/powershell-is-open-sourced-and-is-available-on-linux/&quot; rel=&quot;nofollow&quot;&gt;PowerShell is open-sourced and available on Linux&lt;/a&gt; in addition to the usual Windows flavors.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;GitHub &lt;a href=&quot;https://github.com/PowerShell/PowerShell&quot; rel=&quot;nofollow&quot;&gt;link&lt;/a&gt;  &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/PowerShell/PowerShell/tree/master/docs/learning-powershell&quot; rel=&quot;nofollow&quot;&gt;Learning PowerShell&lt;/a&gt;  &lt;/li&gt;&#xA;&lt;li&gt;Package &lt;a href=&quot;https://github.com/PowerShell/PowerShell/blob/master/docs/installation/linux.md&quot; rel=&quot;nofollow&quot;&gt;install instructions&lt;/a&gt; for Ubuntu 14.04, Ubuntu 16.04, CentOS 7, and OS X 10.11 (as of 2016-08-18).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Marked this as Community Wiki as I don't have a Linux environment with which to actually test, so I can't vet the actual installation steps.&lt;/p&gt;&#xA;" OwnerUserId="42963" LastActivityDate="2016-08-18T18:13:01.670" CommentCount="0" CommunityOwnedDate="2016-08-18T18:13:01.670" ContentLicense="CC BY-SA 3.0" />
  <row Id="9865" PostTypeId="2" ParentId="2140" CreationDate="2016-08-19T06:08:27.633" Score="4" Body="&lt;h1&gt;Transpose a Ragged Array&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an array of arrays of integers where the rows &lt;strong&gt;may not be of equal length&lt;/strong&gt;, pad those rows with nulls, and transpose the array.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use any sane input for the array.&lt;/li&gt;&#xA;&lt;li&gt;Specify which null(s) you are using for this function.&lt;/li&gt;&#xA;&lt;li&gt;The output should be a transposed array, printed in whatever way is sane for your language.&lt;/li&gt;&#xA;&lt;li&gt;This is code golf. Aim for the shortest code possible.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test cases&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;I: [[1, 2], [3], [4, 5]]          # Padding with nil here&#xA;O: [[1, 3, 4], [2, nil, 5]]&#xA;&#xA;I: [[1], [2, 3], [4, 5]]&#xA;O: [[1, 2, 4], [nil, 3, 5]]&#xA;&#xA;I: [[1, 4, 5], [8, 3, 2], [1, 7, 9, 6]]&#xA;O: [[1, 8, 1], [4, 3, 7], [5, 2, 9], [nil, nil, 6]]&#xA;&#xA;I: [[1], [2]]&#xA;O: [[1, 2]]&#xA;&#xA;I: [[1, 2]]&#xA;O: [[1], [2]]&#xA;&#xA;I: [[4, 5, 6, 7], [8, 9]]                  # Padding with spaces here&#xA;O: [[4, 8], [5, 9], [6, ' '], [7, ' ']]    # as an example of a different null&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As always, if the problem is unclear, please let me know. Good luck and good golfing!&lt;/p&gt;&#xA;" OwnerUserId="47581" LastEditorUserId="34718" LastEditDate="2016-09-13T13:54:23.393" LastActivityDate="2016-09-13T13:54:23.393" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9866" PostTypeId="2" ParentId="2140" CreationDate="2016-08-19T07:33:17.867" Score="0" Body="&lt;h1&gt;Simulate Bibliomancy&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you must take input as a string, and output a random word. Please note that you cannot simply take a random number and take the item of the list at that index: You will be simulating pages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also note that rather than your program picking from the page with eyes closed (which would bias towards larger words), it will generate a random number, and pick the word corresponding to that number&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pages will be some amount characters long, according to input (&lt;em&gt;sandbox: I need help with how pages are distinct (are they assumed to be separate, or do pages need to have truncated length if a word is too long)&lt;/em&gt;). Every page has an equal chance of being picked (assume the PRNG is even), and every word on the page as an equal chance of being picked. In this way, a word from a grandiloquent page, with fewer words, is more likely to be chosen than a word from a page with many short words, and all the words on a page have an equal chance of being chosen. The sum of the chances of picking any word from one page is equal to the sum of the chances of picking any word from another page.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, this is that&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Of course, this still needs clarification. Halp sandbox&lt;/p&gt;&#xA;" OwnerUserId="55896" LastEditorUserId="55896" LastEditDate="2016-08-19T07:39:24.827" LastActivityDate="2016-08-19T07:39:24.827" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9868" PostTypeId="2" ParentId="2140" CreationDate="2016-08-19T15:55:53.563" Score="0" Body="&lt;h1&gt;The grand golfed double radiation-hardened quine &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Yep. It's quite a mouthful.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Double radiation-hardened&lt;/strong&gt; - removing any two characters still results in a valid quine. &lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Quine&lt;/strong&gt; - a program that outputs itself&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No reading from a file or from the web - that's cheating!&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply.&lt;/li&gt;&#xA;&lt;li&gt;File must be at least two characters long.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest answer in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've seen singly radiation hardened quines before. Now it's your job to make doubly radiation hardened ones.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Please constructively criticize this challenge.&lt;/p&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2016-08-19T15:55:53.563" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9870" PostTypeId="2" ParentId="2140" CreationDate="2016-08-19T17:17:09.337" Score="0" Body="&lt;h1&gt;Time-Quine Time!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a quine (I know, I know, old stuff. But bear with me for a moment) which waits for a certain amount of time after the start of its execution, then prints its own source-code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard Loopholes apply&lt;/li&gt;&#xA;&lt;li&gt;Your program must always halt for the same amount of time before printing its source code (System independent)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Input&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program should take no input&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Output&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The programs exact source code (After the wait)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Scoring:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is code-golf, so shortest code wins, BUT:&lt;/li&gt;&#xA;&lt;li&gt;The time your program waits before printing is also taken into account. SO:&lt;/li&gt;&#xA;&lt;li&gt;Your score is equal to &lt;code&gt;length of code (in bytes) / log(base 10)(time in seconds of wait)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Code golf, so shortest code wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;P.S.: Please indicate in your answer how long your code will wait for&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;All feedback is appreciated&lt;/p&gt;&#xA;" OwnerUserId="49311" LastEditorUserId="49311" LastEditDate="2016-08-19T18:37:05.050" LastActivityDate="2016-08-19T18:37:05.050" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9871" PostTypeId="2" ParentId="2140" CreationDate="2016-08-19T20:20:01.673" Score="0" Body="&lt;h2&gt;Square pegs in round holes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does a square peg fit through a round hole? Let's find out ...&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Two 3-tuples, describing a circle and a square on the &lt;a href=&quot;https://en.wikipedia.org/wiki/Cartesian_coordinate_system&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cartesian coordinate&lt;/a&gt; plane.&lt;/li&gt;&#xA;&lt;li&gt;They're represented here by the form &lt;code&gt;(x, y, r)&lt;/code&gt; and &lt;code&gt;(X, Y, S)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;For both tuples, &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; are integers representing the center of the corresponding shape.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;code&gt;r&lt;/code&gt; and &lt;code&gt;S&lt;/code&gt; will only be positive integers numbers, with &lt;code&gt;r&lt;/code&gt; representative of the radius of the circular hole, while &lt;code&gt;S&lt;/code&gt; is the length of the side of the square.&lt;/li&gt;&#xA;&lt;li&gt;The square is oriented parallel to the x and y axes -- i.e., the left and right sides of the square parallel the y axis, and the top and bottom sides of the square parallel the x axis.  &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(Meta: is this sufficient to describe the shapes?)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2194/42963&quot;&gt;truthy/falsey value&lt;/a&gt;, written to STDOUT or returned, indicating whether the square peg will fit through the round hole.&lt;/li&gt;&#xA;&lt;li&gt;The square can only fit through the round hole if the &lt;em&gt;entirety&lt;/em&gt; of the square is completely enclosed in the circle -- no points of the square can intersect or lay outside the circle.&lt;/li&gt;&#xA;&lt;li&gt;Both objects are fixed at their corresponding centers (no rotating or translating about the origin allowed).&lt;/li&gt;&#xA;&lt;li&gt;Precision within usual 32-bit floating point is sufficient.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Either a full program or a function are acceptable.&lt;/li&gt;&#xA;&lt;li&gt;The input numbers can be taken via &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/42963&quot;&gt;any suitable format&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/42963&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so all usual golfing rules apply, and the shortest code (in bytes) wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(x, y, r) (X, Y, S) -&amp;gt; result  # explanation&#xA;(1, 1, 1) (0, 0, 1) -&amp;gt; false   # square is offset from circle&#xA;(1, 1, 1) (1, 1, 1) -&amp;gt; true    # square easily fits in the circle&#xA;(1, 1, 1) (1, 1, 2) -&amp;gt; false   # some of the square is outside the circle&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2016-08-22T16:37:26.710" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9873" PostTypeId="2" ParentId="2140" CreationDate="2016-08-19T23:11:02.457" Score="0" Body="&lt;p&gt;Print this text in as few bytes as you can&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;**********&#xA;****  ****&#xA;***    ***&#xA;**      **&#xA;*        *&#xA;*        *&#xA;**      **&#xA;***    ***&#xA;****  ****&#xA;**********&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="55896" LastActivityDate="2016-08-19T23:11:02.457" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9874" PostTypeId="2" ParentId="2140" CreationDate="2016-08-20T09:35:47.253" Score="3" Body="&lt;h1&gt;The Hanoi KoTH&lt;/h1&gt;&#xA;&lt;p&gt;The KoTH is like this:&lt;/p&gt;&#xA;&lt;p&gt;Two stacks of height-8 towers are on either side of a total of 11 pegs, and are coloured red and blue.&lt;/p&gt;&#xA;&lt;p&gt;(Like this: &lt;code&gt;[[&amp;quot;R8&amp;quot;, &amp;quot;R7&amp;quot;, &amp;quot;R6&amp;quot;, &amp;quot;R5&amp;quot;, &amp;quot;R4&amp;quot;, &amp;quot;R3&amp;quot;, &amp;quot;R2&amp;quot;, &amp;quot;R1&amp;quot;], [], [], [], [], [], [], [], [], [], [&amp;quot;B8&amp;quot;, &amp;quot;B7&amp;quot;, &amp;quot;B6&amp;quot;, &amp;quot;B5&amp;quot;, &amp;quot;B4&amp;quot;, &amp;quot;B3&amp;quot;, &amp;quot;B2&amp;quot;, &amp;quot;B1&amp;quot;]]&lt;/code&gt; - each array is a peg.)&lt;/p&gt;&#xA;&lt;p&gt;The objective is to move your entire tower to the opposite side before your opponent does, Tower of Hanoi-style. Red has to move all of their blocks to where Blue's blocks are, and vice versa.&lt;/p&gt;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may not place a block on top of a block that is of an equal or smaller size.&lt;/li&gt;&#xA;&lt;li&gt;You are only allowed to place a block on your &amp;quot;end tower&amp;quot; once your opponent has cleared away all their blocks.&lt;/li&gt;&#xA;&lt;li&gt;If there are no more &amp;quot;moves&amp;quot; for either side, then the game is a draw.&lt;/li&gt;&#xA;&lt;li&gt;There is a limit of 10,000 moves. If neither side completes their tower, then the game is a draw.&lt;/li&gt;&#xA;&lt;li&gt;If you complete your tower before your opponent does and before the 10,000 moves is over, then you have won.&lt;/li&gt;&#xA;&lt;li&gt;Invalid moves include:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Moving a block that is covered by other blocks&lt;/li&gt;&#xA;&lt;li&gt;Moving a block onto a peg that contains smaller or equal-sized blocks than it&lt;/li&gt;&#xA;&lt;li&gt;Doing &amp;quot;null&amp;quot; moves (moves that don't do anything).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Input:&lt;/h2&gt;&#xA;&lt;p&gt;Your input will consist of two numbers separated by a space.&lt;/p&gt;&#xA;&lt;p&gt;The first number will be the starting peg. Pegs are zero-indexed (so the first peg is &lt;code&gt;0&lt;/code&gt;, and the last peg is &lt;code&gt;10&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;p&gt;The first number is valid only if the associated peg is not empty, and the block that's on the top of the peg is yours. Any other input is invalid, and your bot will be notified.&lt;/p&gt;&#xA;&lt;p&gt;The second number will be the peg that your block is moving to. If the stack that the block is moving to is either:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Empty, or&lt;/li&gt;&#xA;&lt;li&gt;Contains only larger blocks than the moving block&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;then the block can move. Otherwise, your bot will be notified that this is an invalid move.&lt;/p&gt;&#xA;&lt;p&gt;Valid inputs (based on the starting position) would be:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;0 4&lt;/code&gt; (Moving the block on peg &lt;code&gt;0&lt;/code&gt;, which is &lt;code&gt;R1&lt;/code&gt;, to peg &lt;code&gt;4&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;0 3&lt;/code&gt; (Moving the block on peg &lt;code&gt;0&lt;/code&gt;, which is &lt;code&gt;R1&lt;/code&gt;, to peg &lt;code&gt;3&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Invalid inputs (again, based on the starting position) would be:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;1 3&lt;/code&gt; (Invalid because there are no blocks on peg &lt;code&gt;1&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;10 3&lt;/code&gt; (Invalid because the top block on peg &lt;code&gt;5&lt;/code&gt;, &lt;code&gt;B1&lt;/code&gt;, is not yours)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;0 0&lt;/code&gt; (Invalid because that is a null move)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If 5 invalid inputs are committed by the bot in a row, that counts as an automatic loss.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;The program will output to the bot what the current situation is - it will output the eleven arrays, each separated with the &lt;code&gt;/&lt;/code&gt; symbol.&lt;/p&gt;&#xA;&lt;p&gt;So, the starting position is like this:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;R8R7R6R5R4R3R2R1//////////B8B7B6B5B4B3B2B1&lt;/code&gt; (the middle nine stacks are empty).&lt;/p&gt;&#xA;&lt;h2&gt;Point System:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Win: 5 points&lt;/li&gt;&#xA;&lt;li&gt;Draw: -1 point (to discourage drawing)&lt;/li&gt;&#xA;&lt;li&gt;Loss: -5 points&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I've made a small controller &lt;a href=&quot;https://github.com/DerpfacePython/HanoiBattles/tree/master&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;META STUFF&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this challenge a dupe?&lt;/li&gt;&#xA;&lt;li&gt;Is there anything I can clarify?&lt;/li&gt;&#xA;&lt;li&gt;Can anyone help with the controller (i.e. fix it up, optimise the code)?&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Issues with the code:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Doesn't work with external files.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-21T08:08:25.720" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="9876" PostTypeId="2" ParentId="2140" CreationDate="2016-08-20T17:12:22.667" Score="0" Body="&lt;h1&gt;Enterprise Quality Code!&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Summary of this challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;b&gt;Print&lt;/b&gt; (to make it more fair when competing with another language changing the output method could be a trivial way to golf) the first N Prime numbers. Your score will be the sum of the byte counts of all entries which no one has been able to golf down (by removing one or more characters and rearrange the program). If you golf down someones program, post it as another submission. &lt;br/&gt;&lt;br/&gt;You may not golf your own programs once submitted.&#xA;&lt;hr/&gt;&#xA;This is not a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37797/the-bowlers-golfers-fraction-war&quot;&gt;dupe&lt;/a&gt; because it significantly changes the scoring method. Writing code which allows a single byte to be golfed off will cost the &lt;b&gt;whole&lt;/b&gt; of the score. Also as this is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/rosseta-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;rosseta-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;rosseta-code&lt;/a&gt; challenge the winner is likely going to have high scores across a multitude of languages. It is likely that scores will be incredibly near 30k for each language. This limit allows a more interesting competition as it prevents submissions of exponentially large lengths. &#xA;&lt;hr/&gt; &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Back-story and explanation&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;At Pretty Good consultants there is a focus on writing &quot;quality&quot; verbose code that is sufficiently engineered. Your boss has decided to test you on your skills.&#xA;&lt;hr/&gt;&#xA;Consider the set of all &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/46918&quot;&gt;programming languages&lt;/a&gt; in existence before the posting of this challenge. For this challenge there will technically be one individual &quot;winner&quot; in each language, however the boss will give a &lt;s&gt;promotion&lt;/s&gt; accepted tick mark to only one answer based on your score. &#xA;&lt;hr/&gt;&#xA;The goal of this challenge is to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;receive&lt;/a&gt; an integer N strictly smaller than 2^16-1 and print the first N prime numbers (in less than 24 hours) separated by your platforms choice of new line. &lt;a href=&quot;https://oeis.org/A000040&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS sequence A000040&lt;/a&gt; in as &lt;b&gt;many bytes&lt;/b&gt; as possible in as many languages as possible. However, note that others vying for the promotion will try to &quot;help&quot; you by &lt;b&gt;golfing&lt;/b&gt; down your score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sample output for an input 11&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;2&#xA;3&#xA;5&#xA;7&#xA;11&#xA;13&#xA;17&#xA;19&#xA;23&#xA;29&#xA;31&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;hr/&gt;&#xA;&#xA;&lt;h2&gt;How to participate&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Pick any language X, but please avoid selecting a language which is just another version or derivative of another answer. &#xA;If there is no existing answer in language X than you will write a program (which must fit into a single post) that solves this challenge. &#xA;The length in bytes of the source (in any reasonable preexisting textual encoding) will be &lt;b&gt;added&lt;/b&gt; to your score. You must avoid using any unnecessary characters for reasons that will soon become apparent.&#xA;&lt;br/&gt;&#xA;&lt;br/&gt;If language X already has been used to answer this question, then you must answer using any permutation of any proper subset of the characters used in the shortest answer (I.E take the shortest X answer and remove some (&gt;=1) characters and optionally rearrange the resulting code). The previous holder of the shortest X answer will lose &lt;b&gt;all&lt;/b&gt; of the bytes provided by his answer from his score, and the number of bytes of your submission will now be added to your score. The number of bytes golfed off gets &quot;lost&quot; forever.&#xA;&lt;hr/&gt;&#xA;Clarifications &lt;s&gt;shamelessly lifted&lt;/s&gt; adapted from this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37464/write-a-polyquine&quot;&gt;challenge&lt;/a&gt;   &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules for Languages&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Languages used should be distinctly different. A language is different iff:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is not a different version of another language (Java 7, Java 8)&lt;/li&gt;&#xA;&lt;li&gt;They must not be derived from another language (Branf*** versus Alphf***)&lt;/li&gt;&#xA;&lt;li&gt;One language may not be a subset or superset or trivial  of the other one (e.g. hq9+ versus &lt;a href=&quot;https://esolangs.org/wiki/HQ9%2BB&quot; rel=&quot;nofollow noreferrer&quot;&gt;hq9+b&lt;/a&gt;). &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;HQ9+ wouldnt be a language anyway, but please be judicious when selecting a language, if you have any clarifications on a language that may be significantly different from an existing answer please ping me and we can work it out. &lt;/p&gt;&#xA;&#xA;&lt;hr/&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/rosetta-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;rosetta-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;rosetta-code&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequences&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequences&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequences&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:27.967" LastActivityDate="2016-08-21T21:02:39.923" CommentCount="28" ContentLicense="CC BY-SA 3.0" />
  <row Id="9877" PostTypeId="2" ParentId="2140" CreationDate="2016-08-20T21:52:33.513" Score="-2" Body="&lt;h1&gt;Щoгкeгs of tиe щoгld, цпite!&lt;/h1&gt;&#xA;&lt;h1&gt;Iпtгodцctioп&lt;/h1&gt;&#xA;&lt;p&gt;Iп tиe Iпteгпets, people sometimes liкe to stчlize tиeiг posts дs if tиeч щeгe щгitteп iп д diffeгeпt scгipt. Tидпкs to tиe пotoгietч of Soviet Яцssiд, tиe Cчгчlic scгipt seems to бe pдгticцlдгlч fдvoгed.&lt;/p&gt;&#xA;&lt;p&gt;Бцt щидt cдп д пext-dooг tгoll do if tиeч'гe пot д pгogгдmmeг? Mдпцдllч гeplдciпg eдcи дпd eveгч letteг cдп бe qцite tedioцs...&lt;/p&gt;&#xA;&lt;h1&gt;Cидlleпge&lt;/h1&gt;&#xA;&lt;p&gt;Чoц дгe to щгite д pгogгдm tидt щill дccept дп дгбitгдгilч loпg iпpцt of Lдtiп cидгдcteгs дпd sцбstitцte some letteгs щitи similдгlч looкiпg Cчгчlics cидгдcteгs. Tиe oцtpцt sиoцld бe ideпticдl to tиe oцtpцt pгodцced бч tиe folloщiпg цпgolfed C# scгipt:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;цsiпg Sчstem;&#xA;цsiпg Sчstem.Collectioпs.Geпeгic;&#xA;цsiпg Sчstem.Liпq;&#xA; &#xA;pцбlic clдss Test&#xA;{&#xA;    pцбlic stдtic void Mдiп()&#xA;    {&#xA;        Dictioпдгч&amp;lt;cидг, cидг&amp;gt; tгдпs = пeщ Dictioпдгч&amp;lt;cидг, cидг&amp;gt;{&#xA;            {'A', 'д'},&#xA;            {'a', 'д'},&#xA;            {'B', 'Б'},&#xA;            {'b', 'б'},&#xA;            {'N', 'И'},&#xA;            {'b', 'и'},&#xA;            {'K', 'К'},&#xA;            {'k', 'к'},&#xA;            {'N', 'П'},&#xA;            {'n', 'п'},&#xA;            {'R', 'Я'},&#xA;            {'r', 'г'},&#xA;            {'U', 'Ц'},&#xA;            {'u', 'ц'},&#xA;            {'W', 'Щ'},&#xA;            {'w', 'щ'},&#xA;            {'Y', 'Ч'},&#xA;            {'y', 'ч'}&#xA;        };&#xA; &#xA;        stгiпg s; щиile((s = Coпsole.ЯeдdLiпe()) != пцll) {&#xA;            Coпsole.ЩгiteLiпe(&#xA;                пeщ stгiпg(s.Select(c =&amp;gt; tгдпs.CoпtдiпsКeч(c) ? tгдпs[c] : c).&#xA;                    Toдггдч()&#xA;                )&#xA;            );&#xA;        }&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Tиe sиoгtest code щiпs.&lt;/p&gt;&#xA;&lt;h1&gt;Exдmple Iпpцt дпd Oцtpцt&lt;/h1&gt;&#xA;&lt;p&gt;Iпpцt:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;As we know, the goal of every struggle is victory. But if the&#xA;proletariat is to achieve victory, all the workers, irrespective of&#xA;nationality, must be united. Clearly, the demolition of national&#xA;barriers and close unity between the Russian, Georgian, Armenian,&#xA;Polish, Jewish and other proletarians is a necessary condition for the&#xA;victory of the proletariat of all Russia.&lt;/p&gt;&#xA;&lt;p&gt;We are for the withering away of the state, and at the same time we&#xA;stand for the strengthening of the dictatorship of the proletariat,&#xA;which represents the most powerful and mighty of all forms of the&#xA;state which have existed up to the present day. The highest&#xA;development of the power of the state, with the object of preparing&#xA;the conditions of the withering away of the state: that is the Marxist&#xA;formula. Is it &amp;quot;contradictory&amp;quot;? Yes, it is &amp;quot;contradictory.&amp;quot; But this&#xA;contradiction is a living thing and wholly reflects the Marxist&#xA;dialectic.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Oцtpцt:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;дs щe кпoщ, tиe goдl of eveгч stгцggle is victoгч. Бцt if tиe&#xA;pгoletдгiдt is to дcиieve victoгч, дll tиe щoгкeгs, iггespective of&#xA;пдtioпдlitч, mцst бe цпited. Cleдгlч, tиe demolitioп of пдtioпдl&#xA;бдггieгs дпd close цпitч бetщeeп tиe Яцssiдп, Geoгgiдп, дгmeпiдп,&#xA;Polisи, Jeщisи дпd otиeг pгoletдгiдпs is д пecessдгч coпditioп foг tиe&#xA;victoгч of tиe pгoletдгiдt of дll Яцssiд.&lt;/p&gt;&#xA;&lt;p&gt;Щe дгe foг tиe щitиeгiпg дщдч of tиe stдte, дпd дt tиe sдme time щe&#xA;stдпd foг tиe stгeпgtиeпiпg of tиe dictдtoгsиip of tиe pгoletдгiдt,&#xA;щиicи гepгeseпts tиe most poщeгfцl дпd migиtч of дll foгms of tиe&#xA;stдte щиicи идve existed цp to tиe pгeseпt dдч. Tиe иigиest&#xA;developmeпt of tиe poщeг of tиe stдte, щitи tиe oбject of pгepдгiпg&#xA;tиe coпditioпs of tиe щitиeгiпg дщдч of tиe stдte: tидt is tиe Mдгxist&#xA;foгmцlд. Is it &amp;quot;coпtгдdictoгч&amp;quot;? Чes, it is &amp;quot;coпtгдdictoгч.&amp;quot; Бцt tиis&#xA;coпtгдdictioп is д liviпg tиiпg дпd щиollч гeflects tиe Mдгxist&#xA;diдlectic.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="53271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-20T21:52:33.513" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="9878" PostTypeId="2" ParentId="2140" CreationDate="2016-08-21T02:09:29.210" Score="1" Body="&lt;h1&gt;Find the Watermark&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;At the moment, I don't have time to outline this properly. The idea is simple: Find the watermark in an image. The implementation, however, is obviously not simple. Since watermarks can have a variety of characteristics, I'd like to admit a variety of answer styles and make it a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;. Some ideas for the output format:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Return coordinates of the (centre|corner(s)?) of the watermark&lt;/li&gt;&#xA;&lt;li&gt;Return a line in some form (e.g., endpoints or equation) that runs through the watermark&lt;/li&gt;&#xA;&lt;li&gt;Return an image that contains only a mask matching the watermark&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Input, obviously, would be an image containing a watermark. Images without watermarks are not valid input; as such, submissions do not need to handle them in any special way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="54071" LastActivityDate="2016-08-21T02:09:29.210" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9879" PostTypeId="2" ParentId="2140" CreationDate="2016-08-21T02:39:18.173" Score="1" Body="&lt;h1&gt;whispering and SHOUTING&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Typing in all caps on the internet is often called &amp;quot;shouting&amp;quot;. For the sake of this challenge, I'll call typing in all-lowercase &amp;quot;whispering&amp;quot;.&lt;/p&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a complete program that can be run in two different ways: whispering and shouting. The &amp;quot;whispering&amp;quot; version of the program must be written in all-lowercase characters, and it should print &lt;code&gt;whisper&lt;/code&gt; to STDOUT. The &amp;quot;shouting&amp;quot; version of the program will print &lt;code&gt;SHOUT&lt;/code&gt;. The shouting version must be the &lt;em&gt;exact same&lt;/em&gt; program as the whispering version, but with all lowercase letters replaced by the uppercase version of the letter. Everything else must be identical.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No standard loopholes&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest program in bytes wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41505" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-21T04:00:06.000" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9880" PostTypeId="1" AcceptedAnswerId="9881" CreationDate="2016-08-21T07:18:44.537" Score="1" ViewCount="94" Body="&lt;p&gt;I've noticed that sometimes people using exotic languages like Brainfuck don't ever explicitly wrap a solution into a method/function. While sometimes I see solutions in Java and such where they are wrapping their solution into a function. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it actually necessary (if the question didn't specify it) to wrap a solution into a reusable function?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an example, here is &lt;a href=&quot;https://codegolf.stackexchange.com/a/90473/58747&quot;&gt;my solution&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/90349/the-letter-a-without-a/90473&quot;&gt;The Letter A without A&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(3&amp;lt;2).ToString()[3-2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Is it necessary to make it like so?&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;void Solution { (3&amp;lt;2).ToString()[3-2] }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which also leads me to ask is it necessary to also explicitly print the result when things like PowerShell implicitly print the result all the time, and this can be done with my C# snippet using &lt;a href=&quot;https://github.com/dotnet/roslyn/wiki/Interactive-Window&quot; rel=&quot;nofollow noreferrer&quot;&gt;C# Interactive&lt;/a&gt; for instance?&lt;/p&gt;&#xA;" OwnerUserId="58747" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-08-21T08:22:38.830" Title="Necessity of Wrapping Solution into Method/Function" Tags="|discussion|policy|answers|" AnswerCount="1" CommentCount="0" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9881" PostTypeId="2" ParentId="9880" CreationDate="2016-08-21T07:39:22.213" Score="4" Body="&lt;p&gt;The difference is, some esoteric languages (like Brainfuck) don't have a function-like construct in the language. In those languages, the submissions are full programs - you run it, pass the input in (through STDIN or whatever method it uses), and you get the output (from STDOUT or whatever method it uses).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We require that all submissions be full programs or reusable functions. For REPL (read-eval-print-loop) environments like Python, Javascript, and PowerShell consoles, having the output implicitly printed is fine - so long as you mark the answer as being a REPL answer (as opposed to a full program that doesn't require the REPL).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some resources you might want to check out:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/45941&quot;&gt;Default for Code Golf: Input/Output methods&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2419/45941&quot;&gt;Default for Code Golf: Program, Function or Snippet?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/4939/45941&quot;&gt;Do function submissions have to be reusable?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8737/45941&quot;&gt;What even is a &amp;quot;function&amp;quot; by our standards?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7842/45941&quot;&gt;When is code that requires a REPL acceptable?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2016-08-21T07:39:22.213" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9883" PostTypeId="2" ParentId="9824" CreationDate="2016-08-21T09:24:04.507" Score="-1" Body="&lt;p&gt;I propose two very similar tags, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/largest-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;largest-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;largest-output&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/smallest-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;smallest-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;smallest-output&lt;/a&gt;, to be used as &lt;strong&gt;scoring tags&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;These tags count the number of chunks (bytes, by default) in the final output.&lt;/strong&gt;  The person with the most/fewest chunks wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The term &quot;chunk&quot; here is intentionally broad: the OP can define what he wants &quot;chunks&quot; to be (as long as the chunks can be objectively counted).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Notes:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/largest-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;largest-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;largest-output&lt;/a&gt; includes output-based &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/busy-beaver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;busy-beaver&amp;#39;&quot; rel=&quot;tag&quot;&gt;busy-beaver&lt;/a&gt; challenges, but also includes challenges like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/52496/uniquely-separated-pixels&quot;&gt;Uniquely Separated Pixels&lt;/a&gt;, which scores by the number of pixels you can include in an image.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/smallest-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;smallest-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;smallest-output&lt;/a&gt; includes all of the items listed under &quot;Smallest output&quot; above, as well as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/76866/find-the-shortest-way-to-advance-a-counter-to-a-certain-number&quot;&gt;some&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69652/a-register-calculator-challenge&quot;&gt;of&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/77510/virtual-keyboard-text-input&quot;&gt;the&lt;/a&gt; &quot;fewest steps&quot; (I miscategorized when posting the question)&lt;/li&gt;&#xA;&lt;li&gt;There is a important distinction to be made:  &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fewest-operations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fewest-operations&amp;#39;&quot; rel=&quot;tag&quot;&gt;fewest-operations&lt;/a&gt; is about performing a task in as few steps as possible (at runtime), while &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/smallest-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;smallest-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;smallest-output&lt;/a&gt; is about calculating the fewest steps needed&lt;/strong&gt;.  A &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fewest-operations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fewest-operations&amp;#39;&quot; rel=&quot;tag&quot;&gt;fewest-operations&lt;/a&gt; would be trying to get through a maze as fast as possible (with limited vision), while a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/smallest-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;smallest-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;smallest-output&lt;/a&gt; would be to calculate the shortest path through the maze.&lt;/li&gt;&#xA;&lt;li&gt;I considered splitting these tags into byte/atomic based versions.  However, in many challenges the fewest atoms is also the fewest bytes, and the line gets hard to define.&lt;/li&gt;&#xA;&lt;li&gt;I considered using &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/most-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;most-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;most-output&lt;/a&gt;/&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/least-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;least-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;least-output&lt;/a&gt;, but I voted against them as the terms seem more broad to me.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/meta-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;meta-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;meta-golf&lt;/a&gt; is a variety of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/smallest-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;smallest-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;smallest-output&lt;/a&gt;, so I'd argue to remove &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/meta-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;meta-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;meta-golf&lt;/a&gt; as a scoring tag (keep it on the questions though), and add a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/smallest-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;smallest-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;smallest-output&lt;/a&gt; tag.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-08-22T15:15:38.207" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9884" PostTypeId="2" ParentId="2140" CreationDate="2016-08-21T14:17:28.057" Score="-2" Body="&lt;h3&gt;Alphabet ripple&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You must print out this exact text:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abcdefghijklmnopqrstuvwxyzzyxwvutsrqponmlkjihgfedcba&#xA;abcdefghijklmnopqrstuvwxyyyyxwvutsrqponmlkjihgfedcba&#xA;abcdefghijklmnopqrstuvwxxxxxxwvutsrqponmlkjihgfedcba&#xA;abcdefghijklmnopqrstuvwwwwwwwwvutsrqponmlkjihgfedcba&#xA;abcdefghijklmnopqrstuvvvvvvvvvvutsrqponmlkjihgfedcba&#xA;abcdefghijklmnopqrstuuuuuuuuuuuutsrqponmlkjihgfedcba&#xA;abcdefghijklmnopqrsttttttttttttttsrqponmlkjihgfedcba&#xA;abcdefghijklmnopqrssssssssssssssssrqponmlkjihgfedcba&#xA;abcdefghijklmnopqrrrrrrrrrrrrrrrrrrqponmlkjihgfedcba&#xA;abcdefghijklmnopqqqqqqqqqqqqqqqqqqqqponmlkjihgfedcba&#xA;abcdefghijklmnopppppppppppppppppppppponmlkjihgfedcba&#xA;abcdefghijklmnoooooooooooooooooooooooonmlkjihgfedcba&#xA;abcdefghijklmnnnnnnnnnnnnnnnnnnnnnnnnnnmlkjihgfedcba&#xA;abcdefghijklmmmmmmmmmmmmmmmmmmmmmmmmmmmmlkjihgfedcba&#xA;abcdefghijkllllllllllllllllllllllllllllllkjihgfedcba&#xA;abcdefghijkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkjihgfedcba&#xA;abcdefghijjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjihgfedcba&#xA;abcdefghiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiihgfedcba&#xA;abcdefghhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhgfedcba&#xA;abcdefggggggggggggggggggggggggggggggggggggggggfedcba&#xA;abcdeffffffffffffffffffffffffffffffffffffffffffedcba&#xA;abcdeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeedcba&#xA;abcddddddddddddddddddddddddddddddddddddddddddddddcba&#xA;abccccccccccccccccccccccccccccccccccccccccccccccccba&#xA;abbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbba&#xA;aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Specs&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may do it in all-uppercase instead of all-lowercase.&lt;/li&gt;&#xA;&lt;li&gt;A single leading and trailing newline are allowed&lt;/li&gt;&#xA;&lt;li&gt;You may not output an array of strings - the delimiter must be a newline&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. Program with lowest byte-count wins.&lt;/p&gt;&#xA;" OwnerUserId="32686" LastEditorUserId="32686" LastEditDate="2016-08-23T14:27:03.380" LastActivityDate="2016-08-23T14:27:03.380" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9886" PostTypeId="1" CreationDate="2016-08-21T21:34:46.677" Score="12" ViewCount="697" Body="&lt;p&gt;We have lot's of challenges that are about producing constant output. For example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/6043/were-no-strangers-to-code-golf-you-know-the-rules-and-so-do-i&quot;&gt;We&amp;#39;re no strangers to code golf, you know the rules, and so do I&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/88653/print-a-10-by-10-grid-of-asterisks&quot;&gt;Print a 10 by 10 grid of asterisks&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Every single one of the &quot;alphabet challenges&quot; we've been recently flooded with&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;These are very clearly &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; questions, since Kolmogorov-Complexity is&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Kolmogorov complexity, informally, is the amount of code it takes to produce a given string of text&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;However, there are a lot of challenges (generally &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; challenges) that are about producing a given string of text depending on the input. For example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/77782/build-a-triangle-without-any-triangles&quot;&gt;Build a triangle without any triangles&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/87614/turtles-all-the-way-down&quot;&gt;Turtles All the Way Down&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/90287/the-ihih-pyramid&quot;&gt;The IHIH Pyramid&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/74212/quack-the-angry-duck&quot;&gt;Quack the Angry Duck&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Many many many others&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;All of these are not &lt;em&gt;pure&lt;/em&gt; KC questions, since the output varies. However, they are all tagged with KC also. Should they be tagged any differently since the output is not constant? Is it worth making a distinction between &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/constant-kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;constant-kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;constant-kolmogorov-complexity&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/varied-kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;varied-kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;varied-kolmogorov-complexity&lt;/a&gt;? (Obviously we could come up with a better name if we decide to retag)&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-08-24T07:52:40.220" Title="Is Kolmogorov-Complexity only for constant output?" Tags="|discussion|tags|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9887" PostTypeId="2" ParentId="9886" CreationDate="2016-08-21T21:55:14.930" Score="10" Body="&lt;p&gt;Kolmogorov complexity is specifically the length of a program (in a given language) that produces the given &lt;em&gt;constant&lt;/em&gt; string as output. Note the &lt;em&gt;constant&lt;/em&gt; - there is no mention in Kolmogorov complexity theory of non-constant strings (producing one of multiple outputs based on an input parameter). In other words, there is no input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;KC-like challenges which require outputting a string based on an input parameter have nothing to do with Kolmogorov complexity, and should not be tagged as such.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2016-08-21T21:55:14.930" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="9888" PostTypeId="2" ParentId="9886" CreationDate="2016-08-21T22:32:19.663" Score="-4" Body="&lt;h1&gt;Edit the tag wiki&lt;/h1&gt;&#xA;&lt;p&gt;Personally I feel that Kolmogorov complexity can be extended apply to any string output which has a clear pattern which can be exploited to increase brevity. The tag wiki should be modified to reflect this.&lt;br/&gt;&#xA;&lt;br/&gt;&#xA;However, Strings with a very high complexity like (&amp;quot;Hello, World!&amp;quot;) are certainly not excluded from this tag wiki as DJMcMayhem pointed out. KC should continue to reflect challenges which have a high complexity and may lack tricks to golfing it down. (However most such challenges should be avoided)&#xA;&lt;br/&gt;&#xA;&lt;br/&gt;&#xA;This consensus has been shown in multiple questions, and that is why I suggest it. Please vote up/down this proposal however you see fit.&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-21T22:43:37.423" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9889" PostTypeId="1" CreationDate="2016-08-21T22:40:17.257" Score="0" ViewCount="43" Body="&lt;p&gt;There seems to be a lot of confusion over this &lt;a href=&quot;https://codegolf.stackexchange.com/a/90599/46918&quot;&gt;cw post&lt;/a&gt;. My intention with posting it as an answer was to allow easier edit access to the scoreboard for competitors to place their scores onto a leaderboard. This makes it easier than having to manually maintain a leaderboard. Also having the leaderboard as an answer allows the main post (which is already lengthy) to be cleaner and more readable. &#xA;&lt;br/&gt;&#xA;&lt;br/&gt;&#xA;I have seen this system used already &lt;a href=&quot;https://codegolf.stackexchange.com/a/25375/46918&quot;&gt;here&lt;/a&gt; where an answer to a question is used as a spot to explain the specifications for a submission wrapper of non-java code. I feel like this does not conflict with our help center's guidelines on answers, but I would like to see community consensus here, and If there as a consensus to have me move the scoreboard, I will.&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-08-21T22:40:17.257" Title="What exactly can be placed in an answer" Tags="|discussion|" AnswerCount="0" CommentCount="6" ClosedDate="2016-08-21T22:46:56.210" ContentLicense="CC BY-SA 3.0" />
  <row Id="9892" PostTypeId="2" ParentId="2140" CreationDate="2016-08-22T07:31:01.127" Score="0" Body="&lt;h1&gt;Play the centipede game&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(please note that I need to learn how to make a controller)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you must create a bot which plays the centipede game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the centipede game, there are two players, and two piles of coins. One pile is 1/4 the size of the other. Each turn, a player may choose to either: a) take the bigger pile of coins for himself, and push the smaller pile of coins over to the other player, or b) push both piles of coins to the other player. When the coins are pushed to the other player, the size of each of the pile of coins is doubled (in this way, the smaller pile increases to the current size of the big pile after two pushes).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the original centipede game, there were 100 rounds (hence the name). However, in this game, there will be a random number of rounds. If the game ends without anyone defecting, the big pile will be evenly split between the bots.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The game is over when someone takes the pile instead of pushing it over, or the random amount of rounds are elapsed&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm currently not entirely sure how to score it, but I know that a bot definitely cannot benefit from deliberately messing up the opponent (as in, it can't try to drag another players score down with it, even if that wouldn't be effective), other than the score it gains. something like &lt;code&gt;Average score-(average score of games by other bots that weren't against the bot being scored)&lt;/code&gt;, if that scoring method is not the inverse of what I'm trying to accomplish, but something formatted like that&lt;/p&gt;&#xA;" OwnerUserId="55896" LastActivityDate="2016-08-22T07:31:01.127" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9898" PostTypeId="2" ParentId="2140" CreationDate="2016-08-23T01:40:35.767" Score="-3" Body="&lt;h1&gt;Stump The Golfing Languages&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is the seed of an idea. I'm unclear on the details that might make it work.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I want people to submit answers in the form of a program in a &quot;normal&quot; language (defined how?), such that reproducing its functionality in a golfing language isn't much smaller. That is, I want to find the algorithms that Jelly and Pyth and Matl and such are not optimized for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would appreciate suggestions on how to make this work. Maybe cops and robbers? Maybe each entry just contains two programs, and comments are given to help golf the smaller one?&lt;/p&gt;&#xA;" OwnerUserId="4787" LastActivityDate="2016-08-23T01:40:35.767" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9899" PostTypeId="2" ParentId="2140" CreationDate="2016-08-23T01:55:47.903" Score="0" Body="&lt;h1&gt;What number is this in the lowest possible base?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/90711/what-base-is-this-number-in&quot;&gt;&quot;What base is this number in&quot;&lt;/a&gt; has an obvious extension:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Given a string that represents a number in an unknown base, determine the lowest possible base that number might be in, &lt;em&gt;and taking the number in that base, output its base-10 representation&lt;/em&gt;. The string will only contain &lt;code&gt;0-9, a-z&lt;/code&gt;. If you like, you may choose to take uppercase letters instead of lowercase, but please specify this.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So, for example, if the input string is &quot;01234&quot;, then the lowest possible base it could be a number in is 5. And in base-5, it represents:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;01234_5 = 0 × 5^4 + 1 × 5^3 + 2 × 5^2 + 3 × 5^1 + 4 × 5^0 = (125 + 50 + 15 + 4)_10 = 194_10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So your program should output &quot;194&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code must also work for base-1, aka &quot;unary&quot;, where a number is represented by a string of zeros and its value is the number of digits. For example, &lt;code&gt;00000_1 = 5_10&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can expect valid output to be anywhere from &lt;code&gt;0&lt;/code&gt; to &lt;code&gt;max_int&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may take input and provide output in any reasonable format. Base-conversion built-ins are allowed (Sandbox q: Should there maybe be a bonus for not using them?), shortest answer in bytes is the winner!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sample results:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;    Input  | Base | Output&#xA;     1001  | 2    | 9&#xA;     34f9  | 16   | 13561&#xA;  0000000  | 1    | 7&#xA;  0000001  | 2    | 1&#xA; codegolf  | 25   | 79234249915&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Super-long example:&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: 0123456789abcefghijklmnopqrstuvwxyz&#xA;Base: 36&#xA;Output (spaces for legibility, not required in actual program): 86 846 823 611 197 163 108 337 531 226 495 015 298 096 208 677 436 155&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This output is roughly 180 bits, or 22.5 bytes, so may be out of range, but if your program can manage it then well done!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may want to use &lt;a href=&quot;http://baseconvert.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;baseconvert.com&lt;/a&gt; to help check your results.&lt;/p&gt;&#xA;" OwnerUserId="32668" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.533" LastActivityDate="2016-08-23T01:55:47.903" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="9905" PostTypeId="2" ParentId="9805" CreationDate="2016-08-23T20:50:55.367" Score="0" Body="&lt;p&gt;Not the longest one, but:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The accepted answer on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4191/12-days-of-christmas-lyrics/4372#4372&quot;&gt;12 Days of Christmas Lyrics&lt;/a&gt; uses Brainf**k and has 2,974 bytes. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, it is also tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="52094" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-08-24T07:25:35.190" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9906" PostTypeId="2" ParentId="2140" CreationDate="2016-08-23T21:56:27.243" Score="3" Body="&lt;h1&gt;Planting Sugarcane&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In the game &lt;a href=&quot;https://minecraft.net/en/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Minecraft&lt;/a&gt; the crop &lt;a href=&quot;http://minecraft.gamepedia.com/Sugar_Canes&quot; rel=&quot;nofollow noreferrer&quot;&gt;sugarcane&lt;/a&gt; can only be planted on a block that has water along one of its edges..&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a area what is the most efficient way to place water such that every tile in the area is next to (does not include diagonals) a water block.  That is how do you place water to maximize the amount of sugarcane that can be grown in that area.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example if you had a small plus:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.clipartkid.com/images/656/black-and-white-square-clip-art-8lblvX-clipart.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.clipartkid.com/images/656/black-and-white-square-clip-art-8lblvX-clipart.jpg&lt;/a&gt;&#xA;&lt;a href=&quot;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&lt;/a&gt;&#xA;&lt;a href=&quot;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&lt;/a&gt;&#xA;&lt;a href=&quot;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;http://www.clipartkid.com/images/656/black-and-white-square-clip-art-8lblvX-clipart.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.clipartkid.com/images/656/black-and-white-square-clip-art-8lblvX-clipart.jpg&lt;/a&gt;&#xA;&lt;a href=&quot;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You could grow the most sugarcane if you put the water in the middle:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.clipartkid.com/images/656/black-and-white-square-clip-art-8lblvX-clipart.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.clipartkid.com/images/656/black-and-white-square-clip-art-8lblvX-clipart.jpg&lt;/a&gt;&#xA;&lt;img src=&quot;https://hydra-media.cursecdn.com/minecraft.gamepedia.com/c/cb/Sugar_Canes.png&quot; width=&quot;16&quot;&gt;&lt;br&gt;&#xA;&lt;img src=&quot;https://hydra-media.cursecdn.com/minecraft.gamepedia.com/c/cb/Sugar_Canes.png&quot; width=&quot;16&quot;&gt;&#xA;&lt;img src=&quot;https://hydra-media.cursecdn.com/minecraft.gamepedia.com/8/81/Waterbucket.PNG&quot; width=&quot;16&quot;&gt;&#xA;&lt;img src=&quot;https://hydra-media.cursecdn.com/minecraft.gamepedia.com/c/cb/Sugar_Canes.png&quot; width=&quot;16&quot;&gt;&lt;br&gt;&#xA;&lt;a href=&quot;http://www.clipartkid.com/images/656/black-and-white-square-clip-art-8lblvX-clipart.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.clipartkid.com/images/656/black-and-white-square-clip-art-8lblvX-clipart.jpg&lt;/a&gt;&#xA;&lt;img src=&quot;https://hydra-media.cursecdn.com/minecraft.gamepedia.com/c/cb/Sugar_Canes.png&quot; width=&quot;16&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or If you had a three by three square:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&lt;/a&gt;&#xA;&lt;a href=&quot;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&lt;/a&gt;&#xA;&lt;a href=&quot;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&lt;/a&gt;&#xA;&lt;a href=&quot;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&lt;/a&gt;&#xA;&lt;a href=&quot;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&lt;/a&gt;&#xA;&lt;a href=&quot;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&lt;/a&gt;&#xA;&lt;a href=&quot;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&lt;/a&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You could place six sugarcane:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://hydra-media.cursecdn.com/minecraft.gamepedia.com/c/cb/Sugar_Canes.png&quot; width=&quot;16&quot;&gt;&#xA;&lt;img src=&quot;https://hydra-media.cursecdn.com/minecraft.gamepedia.com/c/cb/Sugar_Canes.png&quot; width=&quot;16&quot;&gt;&#xA;&lt;img src=&quot;https://hydra-media.cursecdn.com/minecraft.gamepedia.com/8/81/Waterbucket.PNG&quot; width=&quot;16&quot;&gt;&lt;br&gt;&#xA;&lt;img src=&quot;https://hydra-media.cursecdn.com/minecraft.gamepedia.com/8/81/Waterbucket.PNG&quot; width=&quot;16&quot;&gt;&#xA;&lt;img src=&quot;https://hydra-media.cursecdn.com/minecraft.gamepedia.com/c/cb/Sugar_Canes.png&quot; width=&quot;16&quot;&gt;&#xA;&lt;img src=&quot;https://hydra-media.cursecdn.com/minecraft.gamepedia.com/c/cb/Sugar_Canes.png&quot; width=&quot;16&quot;&gt;&lt;br&gt;&#xA;&lt;img src=&quot;https://hydra-media.cursecdn.com/minecraft.gamepedia.com/c/cb/Sugar_Canes.png&quot; width=&quot;16&quot;&gt;&#xA;&lt;img src=&quot;https://hydra-media.cursecdn.com/minecraft.gamepedia.com/c/cb/Sugar_Canes.png&quot; width=&quot;16&quot;&gt;&#xA;&lt;img src=&quot;https://hydra-media.cursecdn.com/minecraft.gamepedia.com/8/81/Waterbucket.PNG&quot; width=&quot;16&quot;&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sometimes the best answer will still leave dirt patches.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&lt;/a&gt;&#xA;&lt;a href=&quot;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&lt;/a&gt;&#xA;&lt;br&gt;&#xA;&lt;a href=&quot;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&lt;/a&gt;&#xA;&lt;a href=&quot;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&lt;/a&gt;&#xA;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is best tiled as:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://hydra-media.cursecdn.com/minecraft.gamepedia.com/8/81/Waterbucket.PNG&quot; width=&quot;16&quot;&gt;&#xA;&lt;img src=&quot;https://hydra-media.cursecdn.com/minecraft.gamepedia.com/c/cb/Sugar_Canes.png&quot; width=&quot;16&quot;&gt;&#xA;&lt;br&gt;&#xA;&lt;img src=&quot;https://hydra-media.cursecdn.com/minecraft.gamepedia.com/c/cb/Sugar_Canes.png&quot; width=&quot;16&quot;&gt;&#xA;&lt;a href=&quot;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://3.bp.blogspot.com/-Qs0ZbaSy4KM/T6AuMiorc6I/AAAAAAAABOc/RpA3dZGicC8/s1600/minecraft_dirt.jpg&lt;/a&gt;&#xA;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;I/O&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Standard I/O applies.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may take in an area as either an ASCII diagram with two distinct characters, one representing a block that is in the space and one representing a block that is not or a two dimensional data structure of truthy and falsy values representing the space.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may output either output a ASCII diagrams with two distinct characters one representing water, and one representing everything else or a two dimensional data structure with truthy and falsy values with the truthy values representing the location of water.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must also output the number of sugarcanes that can be planted with the scheme described.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; you will be scored accordingly.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2016-11-05T17:31:03.833" LastActivityDate="2016-11-05T17:31:03.833" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9907" PostTypeId="1" AcceptedAnswerId="9910" CreationDate="2016-08-24T06:12:53.473" Score="9" ViewCount="292" Body="&lt;p&gt;Recently, some user went through the &lt;a href=&quot;https://codegolf.stackexchange.com/q/16090/9498&quot;&gt;Tips for golfing in Befunge 98&lt;/a&gt; and upvoted each post. Normally, this would be fine, it's not considered serial voting. However, all but one of the tips provided are by me. So I got 7 upvotes on answers. This apparently counted as serial upvoting, as the votes were reverted (well, most of them).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I get that one shouldn't upvote a single user, but this user seems to have upvoted each post in the Q/A thread, not just me. It just happens that most of the posts are posted by me, which is kind of unusual.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Today, I got 4 more upvotes spread across the answers. I wouldn't be surprised if they became serial upvotes again. Should these &lt;em&gt;really&lt;/em&gt; be serial upvotes?&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-08-24T08:10:04.420" Title="Is it serial voting to upvote every answer on a Q/A thread, even if each answer is by the same user?" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9908" PostTypeId="2" ParentId="9907" CreationDate="2016-08-24T07:34:07.673" Score="0" Body="&lt;p&gt;The exact details about what is and what isn't serial voting is a closely kept secret by the staff.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Having said that, you're probably fine, especially if those 4 answers weren't right after each other (answers of other people were upvoted in between). 4 is usually not enough to trigger the system anyway.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The serial upvoting reversal is something which happens in clear cases of targeted voting (among other reasons to prevent voting rings where 3 people keep upvoting each other into oblivion). That is, targeting a specific user. Targeting a specific question and upvoting all answers (&lt;a href=&quot;https://codereview.meta.stackexchange.com/a/1512/52915&quot;&gt;to 'napalm' a question&lt;/a&gt;) is not something the system is intended against.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Source: I'm a Code Review regular with nearly 5k votes cast on that site alone. The rules for vote reversal don't differ between sites.&lt;/p&gt;&#xA;" OwnerUserId="30833" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:47.013" LastActivityDate="2016-08-24T07:34:07.673" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9909" PostTypeId="2" ParentId="9886" CreationDate="2016-08-24T07:52:40.220" Score="15" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; tag was initially applied only to what you might term &lt;em&gt;pure&lt;/em&gt; Kolmogorov complexity questions: those which asked for a constant output. Its scope has expanded over time, and I have also felt that its application to some questions was overbroadening it. However, to limit it to constant-output questions would be to overnarrow it.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Definition&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A couple of quotes from Wikipedia (my emphasis):&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;In algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an &lt;strong&gt;object, such as&lt;/strong&gt; a piece of text, is the length of the shortest computer program (in a predetermined programming language) that produces the object as output.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The broader area encompassing descriptional complexity and probability is often called Kolmogorov complexity&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;To restrict the tag to constant-output questions (understanding &lt;em&gt;output&lt;/em&gt; to mean strings or byte sequences, since writing to stdout is one of our standard output options) is to discard other objects. And to insist on the narrowest possible definition of the term KC is to put pedantry ahead of the value and purpose of the tag system, which is to enable people to find questions of interest to them.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;An example&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;IIRC one of the earliest non-constant-output questions to be tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; (and it turns out that I was the one who tagged it, although I didn't remember that when I went looking for it yesterday) was &lt;a href=&quot;https://codegolf.stackexchange.com/q/9037/194&quot;&gt;Who&amp;#39;s that Pok&amp;#233;mon?&lt;/a&gt; It takes one input, an integer, and gives one string as output. There's no mathematical formula&lt;sup&gt;[1]&lt;/sup&gt; which will get the output from the input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This question could have been written as follows:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Write a function (not a program) which takes no input and returns an array of these 151 elements in this order: ...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Is there any good argument that this rewrite doesn't deserve &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;? Sure, it's a function rather than a program, but that's only because a program can't output an array but only a string representation of an array.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or can it? By taking the array index as an input and giving the corresponding element as an output, answers to the question as written are essentially managing to output an array to stdout. So although on a very narrow definition this question might not be KC, there's a strong argument that it's actually asking for the KC of a non-text object even on a fairly narrow definition, and I don't think it's possible reasonably to argue that it doesn't fall within the &quot;&lt;em&gt;broader area encompassing descriptional complexity&lt;/em&gt;&quot; mentioned in the second Wikipedia quote.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;[1]&lt;/sup&gt; Ok, you pedants, except a case-wise definition.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-08-24T07:52:40.220" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9910" PostTypeId="2" ParentId="9907" CreationDate="2016-08-24T08:10:04.420" Score="22" Body="&lt;p&gt;I agree that this wasn't serial upvoting, but I don't think there's something that can be done about it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When a user upvotes several answers of another user in rapid succession, the system automatically suspects foul play and invalidates the votes. That's usually a good thing, since everbody should vote based on the content of answers, not the user who posted them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a corner case the system doesn't take into account, not least because you rarely would post seven answers to the same question on other SE sites.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, while we can't reverse the vote reversal, rest assured that this incident will have no repercussions apart from the loss of deserved rep (in case you were worried about that).&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2016-08-24T08:10:04.420" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9911" PostTypeId="2" ParentId="2140" CreationDate="2016-08-24T09:15:29.983" Score="7" Body="&lt;h1&gt;Simulate Colorblindness &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optical-char-recognition&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optical-char-recognition&amp;#39;&quot; rel=&quot;tag&quot;&gt;optical-char-recognition&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;As some of you might know, I am &lt;a href=&quot;https://en.wikipedia.org/wiki/Color_blindness&quot; rel=&quot;nofollow noreferrer&quot;&gt;colorblind&lt;/a&gt;. Specifically, I have moderate deuteranopia. This means that I have difficulty distinguishing between red, green, and yellow colors, as well as various shades of purple and blue, due to not having green cones in my eyes.&lt;/p&gt;&#xA;&lt;p&gt;The most common way to diagnose colorblindness is through the use of the &lt;a href=&quot;https://en.wikipedia.org/wiki/Ishihara_test&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ishihara test&lt;/a&gt;. In this test, various image plates are shown to the individual. These plates are comprised of dots of several shades of the same color, where certain shades are grouped together to form numbers. The shades are chosen so that, based on the set of plates on which the individual fails to recognize the number, the type of colorblindess can be determined.&lt;/p&gt;&#xA;&lt;p&gt;Here are a few samples of Ishihara plates:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/iRSyc.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/iRSyc.png&quot; alt=&quot;plate 1&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This plate (plate #1 in the Ishihara 24-plate test) is a control plate - everyone should be able to see the number &lt;code&gt;12&lt;/code&gt; clearly, regardless of whether or not they are colorblind. This is the only plate on which an individual with total colorblindness (monochromacy) can read the number.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/L4UrF.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/L4UrF.png&quot; alt=&quot;plate 2&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This plate (plate #2) has an &lt;code&gt;8&lt;/code&gt; inscribed on it, but individuals with red-green deficiencies see it as a &lt;code&gt;3&lt;/code&gt; (myself included).&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/CblUL.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/CblUL.png&quot; alt=&quot;plate 8&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This plate (plate #8) has a &lt;code&gt;6&lt;/code&gt; inscribed on it, but individuals with any type of colorblindness cannot see any number.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/HgRwz.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/HgRwz.png&quot; alt=&quot;plate 14&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This plate (plate #14) will be seen as having a &lt;code&gt;5&lt;/code&gt; on it by individuals with red-green deficiencies, but others will not see any number.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/5NtDs.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/5NtDs.png&quot; alt=&quot;plate 16&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This plate (plate #16) has the number &lt;code&gt;26&lt;/code&gt; on it. Individuals with protanopia will only see the &lt;code&gt;6&lt;/code&gt;, and individuals with deuteranopia will only see the &lt;code&gt;2&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a set of Ishihara plates, output the number that an individual with each type of colorblindness (none, protanopia, deuteranopia, and monochromacy)&lt;sup&gt;&lt;em&gt;1&lt;/em&gt;&lt;/sup&gt; would see on the plate. Your score will be the number of correct outputs your program gives for each plate in the scoring battery (up to 4 points per plate).&lt;/p&gt;&#xA;&lt;p&gt;For testing purposes, &lt;a href=&quot;https://i.stack.imgur.com/QUExB.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;here is an Imgur gallery containing the first 17 original Ishihara plates&lt;/a&gt;. The correct outputs for each plate are as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;X means that no number can be read&#xA;Plate #: Normal, Protanopia, Deuteranopia, Monochromacy&#xA;1: 12, 12, 12, 12&#xA;2: 8, 3, 3, X&#xA;3: 29, 70, 70, X&#xA;4: 5, 2, 2, X&#xA;5: 3, 5, 5, X&#xA;6: 15, 17, 17, X&#xA;7: 74, 21, 21, X&#xA;8: 6, X, X, X&#xA;9: 45, X, X, X&#xA;10: 5, X, X, X&#xA;11: 7, X, X, X&#xA;12: 16, X, X, X&#xA;13: 73, X, X, X&#xA;14: X, 5, 5, X&#xA;15: X, 45, 45, X&#xA;16: 26, 6, 2, X&#xA;17: 42, 2, 4, X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The scoring battery will be a unique set of Ishihara plates, created for the purpose of this challenge.&lt;/p&gt;&#xA;&lt;h2&gt;Specifications&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input and output may be in any reasonable manner and format, so long as no extra information (such as the number that should be seen on the plate) is conveyed in the input other than the image data.&lt;/li&gt;&#xA;&lt;li&gt;Builtins which trivialize this challenge (such as an optical character recognizition library like &lt;a href=&quot;https://github.com/tesseract-ocr/tesseract&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tesseract&lt;/a&gt;) are forbidden. Though I highly doubt that any programming language or library has this functionality built-in, Mathematica and its ilk continue to surprise me.&lt;/li&gt;&#xA;&lt;li&gt;The scoring set of plates will not be disclosed, to prevent optimizing for that specific set.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;sup&gt;&lt;em&gt;1: There are actually a few other variations of colorblindess, but Ishihara plates are not effective at diagnosing them.&lt;/em&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Did I mess up any of the plate images? Being colorblind myself, picking out the proper plate images is rather difficult.&lt;/li&gt;&#xA;&lt;li&gt;Is there anything that needs further specification?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-24T21:07:38.840" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9914" PostTypeId="1" CreationDate="2016-08-24T17:07:34.893" Score="6" ViewCount="144" Body="&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/M7TNu.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/M7TNu.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On &lt;a href=&quot;https://codegolf.stackexchange.com/a/66987/46231&quot;&gt;this answer&lt;/a&gt;, it says I lost 5 reputation, and I'm really puzzled about what chain of events could have caused this. I don't care about the lost rep, I'm just curious to understand as I've never seen this before.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Upvotes on answers are &lt;strong&gt;+10&lt;/strong&gt; reputation. Removal of an upvote on an answer  would then be &lt;strong&gt;-10&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Downvotes on questions and answers cost the author &lt;strong&gt;-2&lt;/strong&gt; reputation; moreover, this answer has a score of &lt;strong&gt;15 up / 0 down&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The only way I could see this notification making any sense is if&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I downvoted another answer to the same question (&lt;strong&gt;-1&lt;/strong&gt;), &lt;strong&gt;and&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Two users downvoted my answer (&lt;strong&gt;-4&lt;/strong&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;for a total of &lt;strong&gt;-5&lt;/strong&gt;, except those would show as two separate events, and there are no downvotes on my answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What happened here?&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-08-24T17:17:37.833" Title="How did I lose 5 reputation on an answer?" Tags="|support|reputation|voting|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9915" PostTypeId="2" ParentId="9914" CreationDate="2016-08-24T17:15:34.410" Score="14" Body="&lt;p&gt;A quick glance at &lt;a href=&quot;https://codegolf.stackexchange.com/users/46231/cat?tab=reputation&quot;&gt;your reputation history&lt;/a&gt; reveals that your answer was unaccepted (&lt;strong&gt;-15&lt;/strong&gt;) and got an upvote (&lt;strong&gt;+10)&lt;/strong&gt;. The sum is the &lt;strong&gt;-5&lt;/strong&gt; you saw in the notification area.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-08-24T17:17:37.833" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9916" PostTypeId="2" ParentId="5139" CreationDate="2016-08-24T21:23:54.720" Score="1" Body="&lt;h1&gt;Tip: Leader board for cops n' robbers&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;To sort ascending: search for &lt;code&gt;r-a&lt;/code&gt; - there should be one instance, replace it with &lt;code&gt;a-r&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;To ignore cracked entries: search for &lt;code&gt;SCORE_REG&lt;/code&gt; - there should be two instances, the second one is (at the time of this answer) the regex:&lt;br&gt;&#xA;&lt;code&gt;/&amp;lt;h\d&amp;gt;\s*([^\n,]*[^\s,]),.*?(\d+)(?=[^\n\d&amp;lt;&amp;gt;]*(?:&amp;lt;(?:s&amp;gt;[^\n&amp;lt;&amp;gt;]*&amp;lt;\/s&amp;gt;|[^\n&amp;lt;&amp;gt;]+&amp;gt;)*[^\n\d&amp;lt;&amp;gt;]*)*&amp;lt;\/h\d&amp;gt;)/&lt;/code&gt;&lt;br&gt;&#xA;replace it with:&lt;br&gt;&#xA;&lt;code&gt;/&amp;lt;h\d&amp;gt;\s*([^\n,]*[^\s,]),.*?(\d+)(?=[^\n\d&amp;lt;&amp;gt;]*(?:&amp;lt;(?:s&amp;gt;[^\n&amp;lt;&amp;gt;]*&amp;lt;\/s&amp;gt;|[^\n&amp;lt;&amp;gt;]+&amp;gt;)[^\n\d&amp;lt;&amp;gt;]*)^(?:(?!cracked)\i.)*&amp;lt;\/h\d&amp;gt;)/&lt;/code&gt;&lt;br&gt;&#xA;(that is add &lt;code&gt;^(?:(?!cracked)\i.)&lt;/code&gt; to not include those headers containing &quot;cracked&quot; with any case (&lt;code&gt;\i&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Please edit to fix bugs, regex is not my forté.&lt;br&gt;&#xA;- I did notice it broke with the &quot;bytes&quot; text of the header being a link, so maybe &lt;code&gt;^(?:(?!cracked)\i.)&lt;/code&gt; should actually be placed earlier?&lt;/p&gt;&#xA;" OwnerUserId="53748" LastActivityDate="2016-08-24T21:23:54.720" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9917" PostTypeId="2" ParentId="2140" CreationDate="2016-08-24T21:26:08.750" Score="5" Body="&lt;h1&gt;Esolang Interpreters&lt;/h1&gt;&#xA;&lt;p&gt;Using a programming language from &lt;a href=&quot;http://pastebin.com/96E0f209&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; version of &lt;a href=&quot;https://esolangs.org/wiki/Category:Turing_complete&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; list, write an interpreter for the next language on the list. For example, if you choose to start with LOCK, you would write an interpreter for LOLCODE. Continue this pattern (use LOLCODE to write an LCBF iterpreter, etc)&lt;br /&gt;&#xA;If specs of a language are unclear and the compiler is nonexistant or closed-source, ask me and I'll decide whether or not to take it off the list.&lt;/p&gt;&#xA;&lt;p&gt;Wining Criteria:&lt;br /&gt;&#xA;The longest streak of compilers wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Proposed Edits:&lt;br /&gt;&#xA;Make several defined starting points.  (this would make many answers too similar, though)&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Edits:&#xA;changed from list of all esolangs to just turing complete ones.&lt;/p&gt;&#xA;" OwnerUserId="47019" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-25T14:26:04.377" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="9918" PostTypeId="1" AcceptedAnswerId="9932" CreationDate="2016-08-24T21:41:51.540" Score="19" ViewCount="697" Body="&lt;p&gt;Currently our main chatroom, &lt;a href=&quot;http://chat.stackexchange.com/transcript/240&quot;&gt;The Nineteenth Byte&lt;/a&gt;, has only the 4 PPCG moderators as room owners. Since the &lt;a href=&quot;http://ppcg.github.io/chatiquette/&quot; rel=&quot;nofollow&quot;&gt;chatiquette&lt;/a&gt; is not applicable to other Stack Exchange sites, using chat flags for breaches of chatiquette which are not also network-wide offenses is problematic - wasting the time of 10k users across the network.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unless there's a better solution, would it be a good idea to have more room owners, so there is one present at most times of day to deal with things that we wouldn't want to use a chat flag for?&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="12012" LastEditDate="2016-08-26T20:23:47.917" LastActivityDate="2016-08-26T20:23:47.917" Title="Should we have additional room owners?" Tags="|discussion|status-completed|chat|" AnswerCount="3" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9919" PostTypeId="2" ParentId="9918" CreationDate="2016-08-24T22:04:24.323" Score="-5" Body="&lt;p&gt;I don't think it's necessary. As it stands, there are many moderators who are active in The Nineteenth Byte besides those of PPCG. These users have been entrusted to uphold the standards of the Stack Exchange network and should thus be trusted to uphold the standards of respectful discourse and common sense that should dictate chat.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;I'm not a moderator but I still want to help!&quot; That's very much appreciated. If users are posting noise or other nonsense, ask them to stop. If they continue to post nonsense that disrupts on-topic or otherwise respectful discussion, at some point it reaches a level of disrespect that, at least in my opinion, warrants moderator intervention, since &quot;be nice&quot; is Stack Exchange policy. In that case, ping one of the friendly neighborhood moderators. If it gets really disrespectful, a moderator flag may be justified. However, note that flags should &lt;em&gt;not&lt;/em&gt; be used for upholding Chatiquette &quot;policy&quot;--it is &lt;em&gt;not&lt;/em&gt; official policy. Use flags wisely.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2016-08-24T22:04:24.323" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9920" PostTypeId="2" ParentId="9918" CreationDate="2016-08-25T01:09:54.233" Score="27" Body="&lt;h1&gt;Absolutely&lt;/h1&gt;&#xA;&lt;p&gt;We have a very active chat room. Many users actively participate in TNB without even participating in PPCG. It's also the best way to be introduced to our community.&#xA;For example, I participated on the site only just a little until I started hanging out on TNB and getting to know the users that make up the site. &lt;em&gt;That's&lt;/em&gt; when I became seriously addicted to the site.&lt;/p&gt;&#xA;&lt;p&gt;It's &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9022/unspoken-challenge-rules#comment26066_9023&quot;&gt;been discussed before&lt;/a&gt; how a lot of problems new users have with the site come not from a lack of rules (in fact, I would almost say we have too many rules!), but from a lack of understanding &lt;em&gt;who&lt;/em&gt; PPCG is, and &lt;em&gt;why&lt;/em&gt; the people who use it behave the way they do. It's a fantastic place not only to discuss site policy, but also a place to have interesting conversations with people of very different opinions, and to learn a lot of very interesting things. Hell, I've learned more about &lt;em&gt;linguistics&lt;/em&gt; from TNB then from anywhere else in my whole life!&lt;/p&gt;&#xA;&lt;p&gt;So I think we have an &lt;em&gt;incredible&lt;/em&gt; oppurtunity in our hands  and we need to make sure we keep this the best possible room it can be. If a single user can completely disrupt a room for several days, something is wrong.&lt;/p&gt;&#xA;&lt;p&gt;I think our room is unusual just because of the sheer amount of messages we regularly get, and it's easy to take that for granted. Out of curiosity, I decided to compare the amount of activity we have compared to other chat rooms on the network, and the results are crazy. Keep in mind, these rooms &lt;em&gt;also&lt;/em&gt; have unusually high amounts of activity.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/rooms/info/8595/the-2nd-monitor&quot;&gt;The 2nd monitor.&lt;/a&gt; 4.8k messages per week, 7 room owners.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/rooms/info/198/mos-eisley&quot;&gt;Mos Eisley&lt;/a&gt;, 6k messages per week, 8 room owners&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/rooms/info/35/&quot;&gt;The bridge&lt;/a&gt;, 9k messages per week, &lt;em&gt;15 room owners&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Now compare that to our room. Here in &lt;a href=&quot;http://chat.stackexchange.com/rooms/info/240&quot;&gt;The nineteenth byte&lt;/a&gt; we have a whopping &lt;em&gt;12.5k messages a week&lt;/em&gt;, and yet we only have 5 room owners, one of which who is no longer active on our site/room.&lt;/p&gt;&#xA;&lt;p&gt;Now, I'm not saying that just because these other rooms have a lot of room owners we absolutely must have a lot also, but at the same time, we should react appropriately. AFAIK, we are the most active room on the network, and we have &lt;em&gt;less&lt;/em&gt; official room owners, not more. If users are regularly complaining and unable to take care of troublemakers, clearly something is wrong.&lt;/p&gt;&#xA;&lt;p&gt;So here's my proposal: we should find some users who are&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;active in TNB, preferably at times that existing mods are not&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Mature and have earned the approval of the community&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And appoint them as room owners. Ideally there should be at least 2-3 such users, but I don't think 5-6 would be innapropriate. (Although the exact number is up for debate)&lt;/p&gt;&#xA;&lt;p&gt;How we decide on these users is another matter entirely. If it's clear the community agrees with me, we can figure that out later.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-25T13:37:22.333" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="9922" PostTypeId="2" ParentId="2140" CreationDate="2016-08-25T08:31:39.600" Score="2" Body="&lt;h1&gt;Stratego&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a KOTH challenge based on the popular board game Stratego.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Stratego is played on a 10x10 board which looks like this (starting position):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  12345678910&#xA;&#xA;A **********&#xA;B **********&#xA;C **********&#xA;D **********&#xA;E ..~~..~~..&#xA;F ..~~..~~..&#xA;G xxxxxxxxxx&#xA;H xxxxxxxxxx&#xA;I xxxxxxxxxx&#xA;J xxxxxxxxxx&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;*&lt;/code&gt;: enemy piece; &lt;code&gt;x&lt;/code&gt;: your piece, &lt;code&gt;.&lt;/code&gt;: empty space, &lt;code&gt;~&lt;/code&gt;: lake&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are twelve types of pieces: the flag (&lt;code&gt;F&lt;/code&gt;), the bomb (&lt;code&gt;B&lt;/code&gt;), the spy (&lt;code&gt;S&lt;/code&gt;), and pieces numbered 2-10 (ten is &lt;code&gt;0&lt;/code&gt;). You can see the identities of your pieces, but not your opponent's. Each player starts with:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;6 bombs&lt;/li&gt;&#xA;&lt;li&gt;1 flag&lt;/li&gt;&#xA;&lt;li&gt;1 ten&lt;/li&gt;&#xA;&lt;li&gt;1 nine&lt;/li&gt;&#xA;&lt;li&gt;2 eights&lt;/li&gt;&#xA;&lt;li&gt;3 sevens&lt;/li&gt;&#xA;&lt;li&gt;4 sixes&lt;/li&gt;&#xA;&lt;li&gt;4 fives&lt;/li&gt;&#xA;&lt;li&gt;4 fours&lt;/li&gt;&#xA;&lt;li&gt;5 threes (miners)&lt;/li&gt;&#xA;&lt;li&gt;8 twos (scouts)&lt;/li&gt;&#xA;&lt;li&gt;1 spy&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;A player may arrange their pieces however they wish within their starting area.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The players take turns moving one piece into an adjacent square.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The bomb and flag may not move.&lt;/li&gt;&#xA;&lt;li&gt;Twos (scouts) may move any number of squares in one direction, like a chess rook.&lt;/li&gt;&#xA;&lt;li&gt;You may not move into a square containing one of your pieces.&lt;/li&gt;&#xA;&lt;li&gt;If you attempt to move into a piece containing an enemy piece:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The identities of both pieces are revealed to the other player.&lt;/li&gt;&#xA;&lt;li&gt;If both pieces are equal, they both lose.&lt;/li&gt;&#xA;&lt;li&gt;If both pieces are numbered, the higher piece wins.&lt;/li&gt;&#xA;&lt;li&gt;If the attacked piece is a bomb…&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;and the other piece is a miner, the miner wins.&lt;/li&gt;&#xA;&lt;li&gt;otherwise, the bomb wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;If the attacked piece is the flag, then the player owning the flag loses.&lt;/li&gt;&#xA;&lt;li&gt;If the attacking piece is the spy…&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;and the defending piece is a 10, the spy wins.&lt;/li&gt;&#xA;&lt;li&gt;otherwise, the spy loses.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;If the attacked piece is the spy, it loses.&lt;/li&gt;&#xA;&lt;li&gt;If the attacking piece won, the attacked piece is removed from the board and the attacking piece moves into its place.&lt;/li&gt;&#xA;&lt;li&gt;If the attacked piece won, the attacking piece is removed from the board and the attacked piece remains in place.&lt;/li&gt;&#xA;&lt;li&gt;If both pieces lose, they are both removed from the board.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;A scout's move may end on an enemy piece, but it may not go &lt;em&gt;over&lt;/em&gt; enemy pieces during its move.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Play continues until one player loses their flag or is unable to move on their turn, at which point that player loses.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Protocol&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Bots may be written in any language that I can get to run on macOS. They will communicate with the server using newline-separated JSON on stdin/stdout. When a bot is started, it should send the following message:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;  &quot;type&quot;: &quot;start&quot;,&#xA;  &quot;layout&quot;: &quot;...&quot; /* starting layout, as 4x10 string; last line is edge of board */&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;When it is the bot's turn, the server will send the following message:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;  &quot;type&quot;: &quot;turn&quot;,&#xA;  &quot;board&quot;: &quot;...&quot;, /* current board state, as 10x10 string; you half of the board is always on the bottom */&#xA;  &quot;yourPreviousTurn&quot;: { /* result of your previous turn; not present on your first turn */&#xA;    &quot;from&quot;: &quot;B8&quot;,&#xA;    &quot;to&quot;: &quot;B9&quot;, /* you moved a piece from B8 to B9 */&#xA;    &quot;movedPiece&quot;: &quot;5&quot; /* you moved a 5 */&#xA;    &quot;attackedPiece&quot;: &quot;8&quot; /* the piece you attacked was an 8; only present if you attacked a piece on your last turn */,&#xA;    &quot;winner&quot;: &quot;them&quot; /* their piece won; only present if you attacked a piece */&#xA;  },&#xA;  &quot;theirPreviousTurn&quot;: { /* result of the turn they just took; not present on first turn of the game */&#xA;    &quot;from&quot;: &quot;H8&quot;,&#xA;    &quot;to&quot;: &quot;G8&quot;,&#xA;    &quot;movedPiece&quot;: &quot;4&quot; /* they moved a 4; only present if they attacked */&#xA;    &quot;attackedPiece&quot;: &quot;9&quot; /* they attacked your 9; only present if they attacked */,&#xA;    &quot;winner&quot;: &quot;you&quot; /* your piece won; only present if they attacked */&#xA;  },&#xA;  &quot;yourGraveyard&quot;: [&quot;B&quot;, &quot;3&quot;, ...], /* array of your pieces that have already died */&#xA;  &quot;theirGraveyard&quot;: [&quot;7&quot;, &quot;4&quot;, ...] /* array of their pieces that have already died */&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You must respond with:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;  &quot;type&quot;: &quot;move&quot;,&#xA;  &quot;from&quot;: &quot;A6&quot;,&#xA;  &quot;to&quot;: &quot;A7&quot;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Answering&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Submit your bot as a pull request to [github link added here]. You do not need to include your entire bot in the SE answer, but please include the main/interesting parts of the code; I would recommend &lt;em&gt;not&lt;/em&gt; including the layouts that you are using so that they remain secret (not &lt;em&gt;that&lt;/em&gt; secret, but better than nothing). I will run bots regularly and post the latest scores here.&lt;/p&gt;&#xA;" OwnerUserId="7053" LastEditorUserId="7053" LastEditDate="2016-08-25T15:37:23.663" LastActivityDate="2016-08-25T15:37:23.663" CommentCount="17" ContentLicense="CC BY-SA 3.0" />
  <row Id="9923" PostTypeId="2" ParentId="2140" CreationDate="2016-08-25T13:19:33.740" Score="0" Body="&lt;h2&gt;Strict Music Interval Describer&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given two notes, you might think you can combine &lt;a href=&quot;https://codegolf.stackexchange.com/questions/5410/print-the-sizes-of-intervals-inside-of-a-piece-of-music&quot;&gt;Print the sizes of intervals inside of a piece of music&lt;/a&gt; to give you the number of semitones with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/76120/music-interval-solver&quot;&gt;Music Interval Solver&lt;/a&gt; to give you the name of the interval between them. Unfortunately doing this loses information. You might notice from the Music Interval Solver that different intervals can have the same number of semitones. In order to know which interval we should use, we need to refer back to the original note names.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The base name of an interval can always be determined from the inclusive number of note names, excluding accidentals, from the first note to the second. Note that intervals wrap after the octave, so that G# to C# is a fourth (G, A, B, C). For this question the octave numbers are not provided so you should assume that the interval will always be an ascending interval between a second and an octave.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To avoid having to refer to the linked questions, I will remind you that the notes themselves have differing numbers of semitones between them; E &amp;amp; F and B &amp;amp; C have one while the others have two. G to C is therefore 2 + 2 + 1 = 5 semitones.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You also need to take into account the accidentals; we'll use # and b for simplicity. They each alter the interval by 1 semitone; # increases it if used on the second note while b increases it if used on the first note. Naturally if both notes have the same accidental then they will cancel out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An interval also has a modifier. My fourth above was in fact a perfect fourth, because the number of semitones was 5; the other possible perfect interval is a perfect fifth, which is 7 semitones. You can choose whether to use octave or perfect octave for 12 semitones.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Seconds, thirds, sixths and sevenths have minor and major intervals. The major intervals are 2, 4, 9 and 11 semitones; the minor intervals have one fewer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unlike the Music Interval Solver, if your interval does not match any of the intervals so far, you cannot simply change to a different base interval. Instead, you must augment or diminish your interval. For the purposes of this question any interval smaller than a minor or perfect interval is a diminished interval, and any interval larger than a major or perfect interval is an augmented interval.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Eb F# - augmented second&#xA;C# Eb - diminished third&#xA;G# C# - perfect fourth&#xA;F B - augmented fourth&#xA;B F - diminished fifth&#xA;Db B# - augmented sixth&#xA;A# Gb - diminished seventh&#xA;C# C - diminished octave&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input/output can be in any reasonable format (e.g. one string with a space separator, an array of two strings). This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.947" LastActivityDate="2016-08-27T10:02:20.583" CommentCount="21" ContentLicense="CC BY-SA 3.0" />
  <row Id="9925" PostTypeId="1" CreationDate="2016-08-25T17:35:20.680" Score="2" ViewCount="95" Body="&lt;h1&gt;Copyrighted King of The Hill Games&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Some Game X is created and copyrighted by corporation Y. Can I post a king of the hill challenge about Game X, or some derivitave of X? This issue came up &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9922/46918&quot;&gt;here&lt;/a&gt; as well as my &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9653/46918&quot;&gt;related post&lt;/a&gt;. Does this relevant &lt;a href=&quot;http://www.copyright.gov/fls/fl108.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;copyright info&lt;/a&gt; apply?&#xA;&lt;hr/&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Some Relevant Questions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If it is ok, should I cite corporation Y?&#xA;&lt;br/&gt;&#xA;Should we use more generic terms? (Frisbee -&gt; Disc)&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-08-25T17:42:39.093" Title="King Of the Hill playing a Copyrighted game" Tags="|discussion|king-of-the-hill|" AnswerCount="0" CommentCount="2" ClosedDate="2016-08-25T21:42:19.703" ContentLicense="CC BY-SA 3.0" />
  <row Id="9926" PostTypeId="2" ParentId="2140" CreationDate="2016-08-25T17:47:53.763" Score="0" Body="&lt;h1&gt;How can I get To a RepDigit Rep?&lt;/h1&gt;&#xA;&lt;p&gt;Heavily inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/90892/how-can-i-get-a-repdigit&quot;&gt;this challenge&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In the referenced challenge, Repdigits are defined as numbers composed of repeating single digits (1, 111, 88, 99999, etc). In this challenge, we will calculate the minimum number of Stack Exchange Q/A votes it takes to take a reputation to a repdigit.&lt;/p&gt;&#xA;&lt;p&gt;A vote can either be:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Question upvote (+5)&lt;/li&gt;&#xA;&lt;li&gt;Answer upvote (+10)&lt;/li&gt;&#xA;&lt;li&gt;Question/Answer downvote (-2)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;:&#xA;A single positive integer which represents a Stack Exchange reputation&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;: The minimum number of votes required to reach the nearest repdigit&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Answer may be either program or function&lt;/li&gt;&#xA;&lt;li&gt;Input may be user input, read from a file, or function argument&lt;/li&gt;&#xA;&lt;li&gt;Output may have trialing spaces/new lines and should be printed/displayed to STDOUT or nearest equivalent.  Alternatively, output may be the return value of a function&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply&lt;/li&gt;&#xA;&lt;li&gt;Answers should work theoretically for infinite reputation, however for practicality, answers only need to work up to 889,107 reputation (Jon Skeet's SO rep at time of posting)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test Cases&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Reputation: 1   =&amp;gt;  Votes: 0 (input is already a repdigit)&#xA;Reputation: 10  =&amp;gt;  Votes: 1 (one downvote will result in 8 rep)&#xA;Reputation: 500 =&amp;gt;  Votes: 6 (5 answer upvotes and 1 question upvote resulting in 555 rep)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is codegolf, shortest code in bytes wins&lt;/p&gt;&#xA;" OwnerUserId="30170" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-25T17:54:10.387" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9932" PostTypeId="2" ParentId="9918" CreationDate="2016-08-26T19:50:10.473" Score="29" Body="&lt;p&gt;We agree with your concerns and that having additional room owners would help covering both time zones and the volume of posted messages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Effective immediately, we've appointed the following users as room owners of The Nineteenth Byte.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/12914&quot;&gt;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/12914.png&quot; alt=&quot;&quot;&gt;&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/users/14215&quot;&gt;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/14215.png&quot; alt=&quot;&quot;&gt;&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/users/21487&quot;&gt;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/21487.png&quot; alt=&quot;&quot;&gt;&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/users/20283&quot;&gt;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/20283.png&quot; alt=&quot;&quot;&gt;&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/users/20260&quot;&gt;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/20260.png&quot; alt=&quot;&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let us thank them for volunteering, and may the odds be ever in their favor.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We'll be happy to appoint additional room owners if this turns out not to be enough.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-08-26T19:50:10.473" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9935" PostTypeId="1" CreationDate="2016-08-27T11:01:05.220" Score="4" ViewCount="280" Body="&lt;p&gt;Sometimes it happens that my questions get closed immediately after posting them, but then with a little effort and explaining they get opened again. I'm posting this in the hope that this will be the case for my latest question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/91332/the-longest-period-iterating-quine&quot;&gt;the longest period iterating quine&lt;/a&gt;, which has been closed as a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/54046/quit-whining-start-quining&quot;&gt;Quit Whining, Start Quining!&lt;/a&gt;, because that question also involves iterating quines. However, I hope with a bit of effort I can convince 5 or more of you that despite the similar topic the challenges are really quite fundamentally different, and that my question is therefore worthy of being given a chance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &quot;quit whining&quot; challenge is a straight up &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. It has a spec, and the winner is the shortest program to meet the spec.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In contrast, my challenge is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; based on optimising an objective function, subject to a restriction on code length. In that respect it is more similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69930/paint-starry-night-objectively-in-1kb-of-code?noredirect=1#comment199415_69930&quot;&gt;Paint Starry Night, objectively, in 1kB of code&lt;/a&gt; than it is to the supposed duplicate. This is by design. In fact, this new question is somewhat purer than the Starry Night one, because it boils down to something reminiscent of Scott Aaronson's &lt;a href=&quot;http://www.scottaaronson.com/writings/bignumbers.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;who can name the bigger number?&lt;/a&gt;, but in code form. You could say (in quite a strong sense) that it's a &lt;a href=&quot;https://en.wikipedia.org/wiki/Busy_beaver&quot; rel=&quot;nofollow noreferrer&quot;&gt;busy beaver problem&lt;/a&gt; in disguise.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Again, this is by design. I've thought for a long time that a good busy beaver type question would be a neat thing to have on the site. The busy beaver problem is the kind of challenge I like: it sounds nice and simple, and it's easy to make progress at first, but then later on it turns out to be literally one of the hardest problems that exists. There's really no limit to the amount of cleverness that people can draw on to produce competitive answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So from a competition design perspective, the busy beaver problem would be a nice thing to base a challenge on. But the problem is, how do you convert the concept of steps taken by a Turing machine into something nice and language-agnostic, suitable for this site? Execution time wouldn't work in any practical sense and nothing else presented itself, so for a long time I gave up on the idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But then this past week I hit upon the idea of iterating quines. The nice thing about quines is that the iterations are really well-defined, in any language. And of course, quines are fun, and anything that adds fun is a bonus. (That &lt;em&gt;is&lt;/em&gt; what we're here for, right?)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I was happy to have had a thought that would finally let me implement my old idea. Of course the first thing I did was check through the previous &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quines&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quines&amp;#39;&quot; rel=&quot;tag&quot;&gt;quines&lt;/a&gt; question, and of course I noted that there was already one based on iterating quines. But after carefully examining it it was clear that this question wasn't designed to encourage the same deep mathematical reasoning as mine, and I was reasonably confident that although this might not be obvious to every reviewer straight away, at least there were enough other obvious differences (e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; vs. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;) that it wouldn't be leapt upon and closed prematurely.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, I spent some time on a rainy Saturday to make the question seem clear and simple, and to have a low barrier to entry for initial participants. Because again, that's the kind of challenge I like. The kind that seems simple to start with, but then later on turns out to be really quite mathematically deep, and to require really very non-trivial solutions indeed. That's the kind of thing I find fun.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(As a concrete example, someone points out in the comments that it's easy to reach a score of 2^(2^64). But of course, I expected that score to be reached early on. The whole point of the challenge is that 2^(2^64) is a really, really small number compared to the busy beaver numbers, so there's a huge amount of space above that for more competitive answers to occupy.) &lt;/p&gt;&#xA;&#xA;&lt;p&gt;But of course, putting effort into making something look simple runs the risk that people will assume it &lt;em&gt;is&lt;/em&gt; simple. I think that based on a casual read-through, it's too easy to get the feeling that this is kind of a bit different from the &quot;stop whining&quot; question, but not really that different. The differences are not immediately apparent, and while that is &lt;em&gt;also&lt;/em&gt; by design, perhaps it is a design flaw, at least in terms of the practicality of having the challenge exist on this site, and so I'd appreciate pointers on how to avoid this situation in future.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So to be clear, I have two objectives in posting this:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;That five kind souls (or one kind moderator) will read and understand what I wrote above, and cast reopen votes on my question;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;That we can have a civil discussion about how to post deceptively simple questions, perhaps based on similar ideas to old questions that lack the same challenge structure, without them being closed. I'm here to have fun, and a conversation about how to do that effectively would be nice.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;One thing I would prefer to avoid if I can though, is too much argument or discussion about whether my question really is a duplicate or not. I'm sorry, but that just isn't the kind of thing I find fun. If you think it should be closed, just wait until it's reopened (or not), and then cast a close vote if you must. That's how the system's supposed to work - let's not spoil our fun by fighting instead.&lt;/p&gt;&#xA;" OwnerUserId="21034" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-08-28T05:04:25.667" Title="Possibility of reopening a question" Tags="|discussion|" AnswerCount="1" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="9937" PostTypeId="2" ParentId="2140" CreationDate="2016-08-27T17:02:16.353" Score="1" Body="&lt;h1&gt;Switching lines&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let's say you have a string of text:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hello, World! Today is a&#xA;most glorious day. In fact,&#xA;it's another day. Woohoo!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This string has three lines. We can call them lines 1, 2, and 3. (Or, if you prefer zero-indexing, lines 0, 1, and 2. I'll be using one-indexing to describe this challenge.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's also say we have a mapping of line numbers to line numbers, such as &lt;code&gt;1 =&amp;gt; 2, 3 =&amp;gt; 1, 2 =&amp;gt; 3&lt;/code&gt;. We will interpret this mapping as a method of &quot;switching&quot; lines with each other; the first rule switches line 1 with line 2, then line 3 with line 1, then line 2 with line 3. This would make the string look like, with intermediate steps:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Rule: (initial)&#xA;1. Hello, World! Today is a&#xA;2. most glorious day. In fact,&#xA;3. it's another day. Woohoo!&#xA;&#xA;Rule: 1 =&amp;gt; 2&#xA;2. most glorious day. In fact,&#xA;1. Hello, World! Today is a&#xA;3. it's another day. Woohoo!&#xA;&#xA;Rule: 3 =&amp;gt; 1&#xA;2. most glorious day. In fact,&#xA;3. it's another day. Woohoo!&#xA;1. Hello, World! Today is a&#xA;&#xA;Rule: 2 =&amp;gt; 3&#xA;3. it's another day. Woohoo!&#xA;2. most glorious day. In fact,&#xA;1. Hello, World! Today is a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Notice how the rule describes lines to be switched, not merely lines in that index. So each line has a permanent, associated line number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any rule such as &lt;code&gt;1 =&amp;gt; 1&lt;/code&gt; is effectively a no-operation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Objective&lt;/strong&gt; Given a list of numbers in any convenient format (e.g. an array of pairs of integers, a list like &lt;code&gt;A B\nC D&lt;/code&gt;, a list of numbers, etc.) and a non-empty string of text, perform the action described above.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;is it a good idea to do line identity instead of line locations?&lt;/p&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2016-08-27T17:02:16.353" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9940" PostTypeId="2" ParentId="9935" CreationDate="2016-08-28T05:04:25.667" Score="4" Body="&lt;p&gt;First and foremost, I agree with you that your challenge is &lt;em&gt;not&lt;/em&gt; a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/q/54046/12012&quot;&gt;Quit Whining; Start Quining&lt;/a&gt;; the interesting part of your challenge &amp;ndash; make the chain as long as possible while staying within a byte limit &amp;ndash; is not covered at all by that challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That being said, I think it's a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/q/18028/12012&quot;&gt;Largest Number Printable&lt;/a&gt;. While printing a large number and making a large quine cycle don't seem to be that related, a rather trivial modification to the accepted answer of that challenge would turn it into a valid submission and highly competitive submission to your challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In GolfScript (which the accepted answer happens to use), you can straightforwardly turn&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;code to generate huge number&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;into&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0{\)&amp;lt;code to generate huge number&amp;gt;%\'.~'}.~&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which increments a counter modulo &lt;em&gt;huge number&lt;/em&gt;, using the standard GolfScript quine. This produces an iterating quine with period &lt;em&gt;huge number&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Likewise, any submissions to this challenge that beat the aforementioned modification of @PeterTaylor's lifetime of a worm would most likely also outscore that answer in the other challenge. I therefore see no value in leaving both challenges open simultaneously.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;One thing I would prefer to avoid if I can though, is too much argument or discussion about whether my question really is a duplicate or not. I'm sorry, but that just isn't the kind of thing I find fun. If you think it should be closed, just wait until it's reopened (or not), and then cast a close vote if you must. That's how the system's supposed to work - let's not spoil our fun by fighting instead.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Forgive me for ignoring your request, but if you start a discussion on meta with the hopes of getting a question of yours reopened, we're going to have to discuss whether it should be reopened or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The alternative is not bringing this matter to meta in the first place, vote to reopen your own question (at the moment, &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/view-close-votes&quot;&gt;this privilege&lt;/a&gt; is obtained with 250 reputation), and just let the community pile on four more reopen votes in case it agrees with you.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-08-28T05:04:25.667" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="9942" PostTypeId="2" ParentId="2140" CreationDate="2016-08-28T17:25:28.967" Score="0" Body="&lt;h1&gt;Origami in One Dimension&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/subsequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;subsequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;subsequence&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/repeated-transformation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;repeated-transformation&amp;#39;&quot; rel=&quot;tag&quot;&gt;repeated-transformation&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this restricted version of origami, the artist begins with an unfolded strip of paper &lt;code&gt;n&lt;/code&gt; segments long, the segments labeled from &lt;code&gt;0&lt;/code&gt; on the left up through &lt;code&gt;n - 1&lt;/code&gt; on the right.  For instance, if &lt;code&gt;n&lt;/code&gt; were 7, the unfolded strip of paper would look like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;| 0 | 1 | 2 | 3 | 4 | 5 | 6 |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then the artist repeatedly makes &quot;mountain&quot; folds, each time tucking the right side under the left, based on a sequence of crease locations &lt;code&gt;S&lt;/code&gt;.  These locations are given as integer distances from the paper's left edge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, consider the sequence &lt;code&gt;[3, 3, 0, 3]&lt;/code&gt;.  According to it, the first crease in the paper above should be made three units from the left edge, so segments &lt;code&gt;3&lt;/code&gt; through &lt;code&gt;6&lt;/code&gt;, to the right of the crease, would get tucked beneath &lt;code&gt;0&lt;/code&gt; through &lt;code&gt;2&lt;/code&gt; to the crease's left:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;    | 0 | 1 | 2 \&#xA;| 6 | 5 | 4 | 3 /&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The second crease is to be three units from the new left edge, so that fold would tuck the &lt;code&gt;2&lt;/code&gt; and &lt;code&gt;3&lt;/code&gt; under everything else:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;    | 0 | 1  \&#xA;| 6 | 5 | 4 \ |&#xA;        / 3 / |&#xA;        \ 2  /&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The third crease should fall zero units from the left edge, meaning that the entire paper is to its right, and the whole thing gets flipped over:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; /  2 \&#xA;| / 3 /&#xA;| \ 4 | 5 | 6 |&#xA; \  1 | 0 |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And finally, the fourth fold falls on the paper's right edge, flipping nothing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thus, the completed artwork, when viewed from above, would read &lt;code&gt;[2, 5, 6]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that, given the nonnegative integer &lt;code&gt;n&lt;/code&gt; and a sequence of crease locations &lt;code&gt;S&lt;/code&gt;, returns the sequence of integers visible on the final folded paper as seen from above.  You may assume that all of the elements of &lt;code&gt;S&lt;/code&gt; are in-bounds, though creases are allowed to fall on edges as above.  Some randomly generated sample inputs and outputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0,  []                       -&amp;gt; []&#xA;1,  [1]                      -&amp;gt; [0]&#xA;2,  [0]                      -&amp;gt; [1, 0]&#xA;2,  [1, 0, 1]                -&amp;gt; [1]&#xA;3,  [0, 2]                   -&amp;gt; [2, 1]&#xA;3,  [3, 2]                   -&amp;gt; [0, 1]&#xA;3,  [0, 1, 0, 2, 2, 2]       -&amp;gt; [1, 0]&#xA;4,  [1, 1]                   -&amp;gt; [1, 3]&#xA;4,  [2, 2]                   -&amp;gt; [0, 1]&#xA;4,  [4, 2, 2, 0]             -&amp;gt; [2, 3]&#xA;5,  [3, 2]                   -&amp;gt; [0, 1]&#xA;5,  [3, 0, 0]                -&amp;gt; [0, 1, 2]&#xA;5,  [5, 0, 1]                -&amp;gt; [0, 1, 2, 4]&#xA;6,  [2]                      -&amp;gt; [5, 4, 0, 1]&#xA;6,  [5, 0]                   -&amp;gt; [5, 3, 2, 1, 0]&#xA;6,  [6, 1, 1]                -&amp;gt; [1, 2, 3, 5]&#xA;6,  [0, 2, 4, 3, 1, 0, 2]    -&amp;gt; [1, 5]&#xA;7,  [6, 1, 2]                -&amp;gt; [1, 6, 4]&#xA;7,  [3, 3, 0, 3]             -&amp;gt; [2, 5, 6]&#xA;7,  [7, 2, 0, 0]             -&amp;gt; [6, 5, 4, 0, 1]&#xA;7,  [3, 0, 0, 1, 2]          -&amp;gt; [3, 4]&#xA;8,  [3, 1]                   -&amp;gt; [3, 4, 5, 7]&#xA;8,  [3, 2, 3]                -&amp;gt; [3, 7, 6]&#xA;9,  []                       -&amp;gt; [0, 1, 2, 3, 4, 5, 6, 7, 8]&#xA;9,  [2, 1]                   -&amp;gt; [2, 3, 4, 5, 6, 8]&#xA;9,  [5, 1]                   -&amp;gt; [5, 6, 7, 0]&#xA;9,  [8, 4, 2, 0, 0]          -&amp;gt; [0, 1]&#xA;10, [3, 2]                   -&amp;gt; [3, 4, 5, 9, 8]&#xA;10, [0, 5, 5]                -&amp;gt; [9, 8, 7, 6, 5]&#xA;10, [0, 3, 1, 5, 2, 0, 0, 0] -&amp;gt; [4, 3, 2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Rules and scoring are as usual for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Remaining Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In addition to general feedback, I'd appreciate an input on:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the revised specification clear?&lt;/li&gt;&#xA;&lt;li&gt;Is the barrier to getting started on this challenge low enough?&lt;/li&gt;&#xA;&lt;li&gt;Is there sufficient room here for a variety of approaches?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="58651" LastEditorUserId="58651" LastEditDate="2016-09-03T00:23:11.930" LastActivityDate="2016-09-03T00:23:11.930" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9945" PostTypeId="2" ParentId="2140" CreationDate="2016-08-29T02:14:27.513" Score="0" Body="&lt;h1&gt;Limit a table&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(this is in minimal form, and is in rough sandbox stage. refrain from voting at this stage. I will flesh it out at a later point in time.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a CSV file containing two columns, and an integer N, format the table into multiple rows such that each column contains at most N rows, excluding the header. Like this, for N = 3:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Foo,Bar&#xA;hello,world&#xA;lorem,ipsum&#xA;doler,illum&#xA;asdf,fdasfa&#xA;qwerty,dvorak&#xA;tildes,graves&#xA;stuff,hello&#xA;limit,ipsum&#xA;a,b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Becomes:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Foo,Bar,Foo,Bar,Foo,Bar&#xA;hello,world,asdf,fdasfa,stuff,hello&#xA;lorem,ipsum,qwerty,dvorak,limit,ipsum&#xA;doler,illum,tildes,graves,a,b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2016-08-29T02:14:27.513" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9948" PostTypeId="2" ParentId="2140" CreationDate="2016-08-30T09:30:52.867" Score="6" Body="&lt;h1&gt;Solve the Nonogram!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It is time to embark on a perilous quest to defeat the British Intelligence. The aim of this challenge is to write the shortest code that will solve a Nonogram. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;What is a Nonogram?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/mdMjdm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/mdMjdm.png&quot; alt=&quot;Nonogram Puzzle&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The rules are simple. &#xA;  You have a grid of squares, which must be either filled in black or left blank. Beside each row of the grid are listed the lengths of the runs of black squares on that row. Above each column are listed the lengths of the runs of black squares in that column. Your aim is to find all black squares. In this puzzle type, the numbers are a form of discrete tomography that measures how many unbroken lines of filled-in squares there are in any given row or column. For example, a clue of &quot;4 8 3&quot; would mean there are sets of four, eight, and three filled squares, in that order, with at least one blank square between successive groups.&#xA;   [&lt;a href=&quot;http://www.puzzle-nonograms.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;1&lt;/a&gt;][&lt;a href=&quot;https://en.wikipedia.org/wiki/Nonogram&quot; rel=&quot;nofollow noreferrer&quot;&gt;2&lt;/a&gt;]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So the solution to the above Nonogram would be:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/EbgM8m.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/EbgM8m.png&quot; alt=&quot;Solved nonogram&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Implementation Details&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You can chose to represent the Nonogram however you would like and take it as an input in whatever way you deem fit for your language. Same goes for output. The aim of this challenge is to literally just get the job done; if you can solve the monogram with whatever output your program gives, that is valid. One caveat is you can't use an online solver :)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are, of course, free to use any language you want and since this is code golf, the entries will be sorted in the order: &lt;code&gt;accuracy -&amp;gt; length of code -&amp;gt; speed.&lt;/code&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This problem is very algorithmically challenging in that there is no completely efficient solution to it and as such, you won't be penalized for not being able to solve larger ones, although your answer will be heavily rewarded if it is able to handle big cases (see bonus). As a benchmark, my solution works for up to roughly  50x50 within 5-10 mins.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Bonus&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I actually learnt about Nonograms from a cryptographic Christmas card released by the British Intelligence &lt;a href=&quot;https://www.gchq.gov.uk/news-article/christmas-card-cryptographic-twist-charity&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;. The first part was basically a massive 25x25 Nonogram. If your solution is able to solve this, you will get kudos :)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To make your life easier in terms of data entry, I have provided how I represented the data for this specific puzzle for your free use. The first 25 lines are the row clues, followed by a '-' separator line, followed by 25 lines of the col clues, followed by a '#' separator line, and then a representation of the grid with the square clues filled in.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;7 3 1 1 7&#xA;1 1 2 2 1 1&#xA;1 3 1 3 1 1 3 1&#xA;1 3 1 1 6 1 3 1&#xA;1 3 1 5 2 1 3 1&#xA;1 1 2 1 1&#xA;7 1 1 1 1 1 7&#xA;3 3&#xA;1 2 3 1 1 3 1 1 2&#xA;1 1 3 2 1 1&#xA;4 1 4 2 1 2&#xA;1 1 1 1 1 4 1 3&#xA;2 1 1 1 2 5&#xA;3 2 2 6 3 1&#xA;1 9 1 1 2 1&#xA;2 1 2 2 3 1&#xA;3 1 1 1 1 5 1&#xA;1 2 2 5&#xA;7 1 2 1 1 1 3&#xA;1 1 2 1 2 2 1&#xA;1 3 1 4 5 1&#xA;1 3 1 3 10 2&#xA;1 3 1 1 6 6&#xA;1 1 2 1 1 2&#xA;7 2 1 2 5&#xA;-&#xA;7 2 1 1 7&#xA;1 1 2 2 1 1&#xA;1 3 1 3 1 3 1 3 1&#xA;1 3 1 1 5 1 3 1&#xA;1 3 1 1 4 1 3 1&#xA;1 1 1 2 1 1&#xA;7 1 1 1 1 1 7&#xA;1 1 3&#xA;2 1 2 1 8 2 1&#xA;2 2 1 2 1 1 1 2&#xA;1 7 3 2 1&#xA;1 2 3 1 1 1 1 1&#xA;4 1 1 2 6&#xA;3 3 1 1 1 3 1&#xA;1 2 5 2 2&#xA;2 2 1 1 1 1 1 2 1&#xA;1 3 3 2 1 8 1&#xA;6 2 1&#xA;7 1 4 1 1 3&#xA;1 1 1 1 4&#xA;1 3 1 3 7 1&#xA;1 3 1 1 1 2 1 1 4&#xA;1 3 1 4 3 3&#xA;1 1 2 2 2 6 1&#xA;7 1 3 2 1 1&#xA;#&#xA;0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&#xA;0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&#xA;0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&#xA;0 0 0 1 1 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 1 0 0 0&#xA;0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&#xA;0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&#xA;0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&#xA;0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&#xA;0 0 0 0 0 0 1 1 0 0 1 0 0 0 1 1 0 0 1 0 0 0 0 0 0&#xA;0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&#xA;0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&#xA;0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&#xA;0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&#xA;0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&#xA;0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&#xA;0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&#xA;0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 1 0 0 0 0&#xA;0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&#xA;0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&#xA;0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&#xA;0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&#xA;0 0 0 1 1 0 0 0 0 1 1 0 0 0 0 1 0 0 0 0 1 1 0 0 0&#xA;0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&#xA;0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&#xA;0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="58653" LastActivityDate="2016-08-30T09:30:52.867" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9950" PostTypeId="2" ParentId="2140" CreationDate="2016-08-30T22:32:34.023" Score="-2" Body="&lt;h1&gt;The Note-Takers Dream&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h2&gt;Meta&lt;/h2&gt;&#xA;  &#xA;  &lt;p&gt;This challenge requires more than most challenges. Is it to much?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The goal here is simple. Turn my notes into text. To this end, any tool or web service may be employed.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Input&lt;/strong&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An image of handwritten notes, stored an some data structure (this structure is flexible)&lt;/li&gt;&#xA;&lt;li&gt;This image will be a direct, over-head shot of a single page of graph paper&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Notes&lt;/strong&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The notes are taken on graph paper with one character per box&lt;/li&gt;&#xA;&lt;li&gt;The characters will be printable ASCII&lt;/li&gt;&#xA;&lt;li&gt;An empty box should be considered as a single &lt;em&gt;Space&lt;/em&gt; character&lt;/li&gt;&#xA;&lt;li&gt;There is an implicit &lt;em&gt;New Line&lt;/em&gt; character between each row&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Output&lt;/strong&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A string of the text represented in the image&lt;/li&gt;&#xA;&lt;li&gt;This image should be trimmed of leading white space&lt;/li&gt;&#xA;&lt;li&gt;Trailing white space is fine&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Score&lt;/strong&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The score is the sum of the &lt;a href=&quot;https://en.wikipedia.org/wiki/Levenshtein_distance&quot; rel=&quot;nofollow&quot;&gt;Levenshtein distances&lt;/a&gt; between required outputs and actual outputs&lt;/li&gt;&#xA;&lt;li&gt;Lowest score wins&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Coming soon. . .&lt;/p&gt;&#xA;" OwnerUserId="43214" LastActivityDate="2016-08-30T22:32:34.023" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9952" PostTypeId="2" ParentId="2140" CreationDate="2016-08-31T01:34:20.027" Score="2" Body="&lt;h1&gt;Shift and Sum&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(I need a better title)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that given an input list of non-negative integers of length &lt;code&gt;l&lt;/code&gt;, outputs the sum of all the lists of length &lt;code&gt;2*l-1&lt;/code&gt; that are the input list padded with &lt;code&gt;0&lt;/code&gt;s to each side.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Please suggest ways of improving this description)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, with the input &lt;code&gt;[1,2,3]&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1,2,3,0,0]+&#xA;[0,1,2,3,0]+&#xA;[0,0,1,2,3]=&#xA;[1,3,6,5,3]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;More test cases:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1]-&amp;gt;[1]&#xA;[2,1]-&amp;gt;[2,3,1]&#xA;[1,0,1]-&amp;gt;[1,1,2,1,1]&#xA;[0,1,0]-&amp;gt;[0,1,1,1,0]&#xA;[10,20,30]-&amp;gt;[10,30,60,50,30]&#xA;[0,0,0,0,0,0]-&amp;gt;[0,0,0,0,0,0,0,0,0,0,0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You may take input in any reasonable format. If you have any questions about whether an input form is reasonable, ask about it in the comments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="41938" LastEditorUserId="41938" LastEditDate="2016-08-31T01:49:58.147" LastActivityDate="2016-08-31T01:49:58.147" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9953" PostTypeId="2" ParentId="2140" CreationDate="2016-08-31T02:46:23.470" Score="2" Body="&lt;h1&gt;End the tabs versus space war&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;So, there has been a great deal of debate of whether to use tabs or spaces to indent/format code. Can you help the university settle the dispute, by going to an incredibly &lt;s&gt;crazy&lt;/s&gt; unique method of formatting.&#xA;&lt;hr/&gt;&#xA;Your job is to write a full program or function which expands all tabs into four spaces. And then replaces a run of n leading spaces with &quot;/(n-2 *'s)/&quot;. You will receive input over multiple lines in any reasonable format (single string array of strings for each new line. Columnar array etc.) &#xA;&lt;br&gt;&#xA;&lt;hr/&gt;&#xA;Sample input &lt;a href=&quot;https://esolangs.org/wiki/Brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;shamelessly stolen&lt;/a&gt;. Note that tabs get automagically expanded to four spaces on SE, but you must handle tabs as well.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Calculate the value 256 and test if it's zero&#xA;If the interpreter errors on overflow this is where it'll happen&#xA;++++++++[&amp;gt;++++++++&amp;lt;-]&amp;gt;[&amp;lt;++++&amp;gt;-]&#xA;+&amp;lt;[&amp;gt;-&amp;lt;&#xA;    Not zero so multiply by 256 again to get 65536&#xA;    [&amp;gt;++++&amp;lt;-]&amp;gt;[&amp;lt;++++++++&amp;gt;-]&amp;lt;[&amp;gt;++++++++&amp;lt;-]&#xA;    +&amp;gt;[&amp;gt;&#xA;        # Print &quot;32&quot;&#xA;        ++++++++++[&amp;gt;+++++&amp;lt;-]&amp;gt;+.-.[-]&amp;lt;&#xA;    &amp;lt;[-]&amp;lt;-&amp;gt;] &amp;lt;[&amp;gt;&amp;gt;&#xA;        # Print &quot;16&quot;&#xA;        +++++++[&amp;gt;+++++++&amp;lt;-]&amp;gt;.+++++.[-]&amp;lt;&#xA;&amp;lt;&amp;lt;-]] &amp;gt;[&amp;gt;&#xA;    # Print &quot;8&quot;&#xA;    ++++++++[&amp;gt;+++++++&amp;lt;-]&amp;gt;.[-]&amp;lt;&#xA;&amp;lt;-]&amp;lt;&#xA;# Print &quot; bit cells\n&quot;&#xA;+++++++++++[&amp;gt;+++&amp;gt;+++++++++&amp;gt;+++++++++&amp;gt;+&amp;lt;&amp;lt;&amp;lt;&amp;lt;-]&amp;gt;-.&amp;gt;-.+++++++.+++++++++++.&amp;lt;.&#xA;&amp;gt;&amp;gt;.++.+++++++..&amp;lt;-.&amp;gt;&amp;gt;-&#xA;Clean up used cells.&#xA;[[-]&amp;lt;]l&#xA;    this is preceded by a tab&#xA;        two tabs&#xA;            three tabs etcetera! &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Sample output&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Calculate the value 256 and test if it's zero&#xA;If the interpreter errors on overflow this is where it'll happen&#xA;++++++++[&amp;gt;++++++++&amp;lt;-]&amp;gt;[&amp;lt;++++&amp;gt;-]&#xA;+&amp;lt;[&amp;gt;-&amp;lt;&#xA;/**/Not zero so multiply by 256 again to get 65536&#xA;/**/[&amp;gt;++++&amp;lt;-]&amp;gt;[&amp;lt;++++++++&amp;gt;-]&amp;lt;[&amp;gt;++++++++&amp;lt;-]&#xA;/**/+&amp;gt;[&amp;gt;&#xA;/******/# Print &quot;32&quot;&#xA;/******/++++++++++[&amp;gt;+++++&amp;lt;-]&amp;gt;+.-.[-]&amp;lt;&#xA;/**/&amp;lt;[-]&amp;lt;-&amp;gt;] &amp;lt;[&amp;gt;&amp;gt;&#xA;/******/# Print &quot;16&quot;&#xA;/******/+++++++[&amp;gt;+++++++&amp;lt;-]&amp;gt;.+++++.[-]&amp;lt;&#xA;&amp;lt;&amp;lt;-]] &amp;gt;[&amp;gt;&#xA;/**/# Print &quot;8&quot;&#xA;/**/++++++++[&amp;gt;+++++++&amp;lt;-]&amp;gt;.[-]&amp;lt;&#xA;&amp;lt;-]&amp;lt;&#xA;# Print &quot; bit cells\n&quot;&#xA;+++++++++++[&amp;gt;+++&amp;gt;+++++++++&amp;gt;+++++++++&amp;gt;+&amp;lt;&amp;lt;&amp;lt;&amp;lt;-]&amp;gt;-.&amp;gt;-.+++++++.+++++++++++.&amp;lt;.&#xA;&amp;gt;&amp;gt;.++.+++++++..&amp;lt;-.&amp;gt;&amp;gt;-&#xA;Clean up used cells.&#xA;[[-]&amp;lt;]l&#xA;/**/this is preceded by a tab&#xA;/******/two tabs&#xA;/**********/three tabs etcetera! &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;hr/&gt;&#xA;Because the university needs space to download both Vim and Emacs. You are alloted very little storage for your code. Therefore this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and the shortest code wins.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Disclaimer&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This &quot;excellent&quot; formatting strategy came courtesy of Geobits, and is reproduced with his permission. No programmers were harmed during the production of this challenge.&lt;/p&gt;&#xA;" OwnerUserId="46918" LastActivityDate="2016-08-31T02:46:23.470" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="9957" PostTypeId="2" ParentId="6918" CreationDate="2016-08-31T15:25:47.047" Score="16" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/DJMcMayhem/Brain-Flak&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brain-Flak&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Brain-Flak is a language designed by me, DJMcMayhem, and written as a collaboration between me and two other users, &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;@Wheat Wizard&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/users/20059/1000000000&quot;&gt;@1000000000&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;When your &lt;a href=&quot;http://www.catb.org/jargon/html/S/stack.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Stack Overflows&lt;/a&gt;, you forget whatever you were talking about. If this happens &lt;em&gt;very badly&lt;/em&gt;, to the point where you can no longer speak straight, we call this a &lt;em&gt;&amp;quot;Flak-Overstow&amp;quot;&lt;/em&gt;. This language is stack based, designed to hurt your brain, and very similar to Brainf*ck, so it seemed appropriate to name it &amp;quot;Brain-Flak&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;An online interpreter can be found at &lt;a href=&quot;http://brain-flak.tryitonline.net/&quot; rel=&quot;nofollow noreferrer&quot;&gt;brain-flak.tryitonline.net&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Design&lt;/h1&gt;&#xA;&lt;p&gt;Shortly after I wrote &lt;a href=&quot;https://codegolf.stackexchange.com/questions/77138/are-the-brackets-fully-matched&quot;&gt;Are the brackets fully matched?&lt;/a&gt;, it made me wonder how much information you can store with only matched brackets. One thing that stood out to me, was that even though you only have 4 &amp;quot;atoms&amp;quot; of sorts:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(){}[]&amp;lt;&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;you really have 8 units of information to convey, since each of these bracket types can be empty, or have other brackets in between, which are fundamentally different pieces of information. So, I decided to write a language that only allowed for matched brackets, and where empty brackets convey something different than brackets with other brackets inside of them.&lt;/p&gt;&#xA;&lt;p&gt;One other thing that influenced the design, was annoyance at brainf*cks inability to easily process decimal numbers. Taking IO in ASCII is very obnoxious, so Brain-Flak handles all inputs and outputs in decimal by default. In August 2016, I added an &amp;quot;ASCII mode&amp;quot;, where IO functions identical to brainf*ck.&lt;/p&gt;&#xA;&lt;h1&gt;Overview&lt;/h1&gt;&#xA;&lt;p&gt;(Copied from the github README)&lt;/p&gt;&#xA;&lt;p&gt;Brain-Flak has two stacks, known as 'left' and 'right'. The active stack starts at left. If an empty stack is popped, it will return 0. That's it. No other variables. When the program starts, each command line argument is pushed on to the active stack.&lt;/p&gt;&#xA;&lt;p&gt;The only valid characters in a Brain-Flak program are &lt;code&gt;()[]{}&amp;lt;&amp;gt;&lt;/code&gt;, and they must always be balanced. There are two types of functions: Nilads and Monads. A nilad is a function that takes 0 arguments. Here are all of the nilads:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;()&lt;/code&gt; Evaluates to one.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[]&lt;/code&gt; Evaluates to the height of the current stack.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{}&lt;/code&gt; Pop the active stack. Evaluates to the popped value.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;lt;&amp;gt;&lt;/code&gt; Toggle the active stack. Evaluates to zero.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;These are concatenated together when they are evaluated. So if we had a '3' on top of the active stack, this snippet:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;()(){}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;would evaluate to &lt;code&gt;1 + 1 + active.pop()&lt;/code&gt; which would evaluate to 5.&lt;/p&gt;&#xA;&lt;p&gt;The monads take one argument, a chunk of Brain-Flak code. Here are all of the monads:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;(n)&lt;/code&gt; Push 'n' on the active stack.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[n]&lt;/code&gt; Evaluates to negative 'n'&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{foo}&lt;/code&gt; While zero is not on the top of the stack, do foo.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;lt;foo&amp;gt;&lt;/code&gt; Execute foo, but evaluate it as 0.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;These functions will also return the value inside of them, so&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(()()())&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Will push 3 but&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;((()()()))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Will push 3 twice.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;code&gt;{}&lt;/code&gt; will evaluate to the sum of all runs. So if we had '3' and '4' on the top of the stack:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;{{}}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;would evaluate as 7.&lt;/p&gt;&#xA;&lt;p&gt;When the program is done executing, each value left on the active stack is printed, with a newline between. Values on the other stack are ignored.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-08-31T15:25:47.047" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9959" PostTypeId="2" ParentId="2140" CreationDate="2016-08-31T21:23:21.327" Score="5" Body="&lt;h1&gt;Slay&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This KoTH is based off of the computer game, &lt;a href=&quot;http://www.windowsgames.co.uk/slay.html&quot; rel=&quot;nofollow&quot;&gt;Slay&lt;/a&gt;.  Try it out, its way fun.  &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;TLDR&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You start off with a bunch of small territories: you try to merge them and capture as much land as possible.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Each territory has its own economy:&lt;/strong&gt; each hex gives you 1 gold per turn.&lt;/li&gt;&#xA;&lt;li&gt;Warriors can capture and protect territory, but cost money to maintain.&lt;/li&gt;&#xA;&lt;li&gt;If you run out of money, all units on that territory die&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Map&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A hexagonal map is generated using Perlin noise.&lt;/li&gt;&#xA;&lt;li&gt;Each hexagon is randomly assigned to a player.  Players will start with a similar number of hexagons, as well as a similar number of territories (see below)&lt;/li&gt;&#xA;&lt;li&gt;Hexagons that touch the edge of the map (or a hole in the middle), are on the beach&lt;/li&gt;&#xA;&lt;li&gt;Each tile has a 1/5 chance of starting with a tree: Palm tree if on the beach, pine tree otherwise&lt;/li&gt;&#xA;&lt;li&gt;Hexagons may contain a warrior, house, tower, grave, or palm/pine tree&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Territory&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A block of 2 or more hexagons with the same owner is considered a territory&lt;/li&gt;&#xA;&lt;li&gt;All territories contain exactly 1 house.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a territory ever doesn't have a house, it gets one in a random location, preferring: empty hexes, trees, graves, towers, and then warriors. (in that order)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;A territory &quot;death&quot; occurs when it is reduced/split into a single hexagon.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Houses turn into a pine/palm (if on the beach) tree&lt;/li&gt;&#xA;&lt;li&gt;Warriors die (turn into graves) at the start of their next turn&lt;/li&gt;&#xA;&lt;li&gt;Towers disappear&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;If two territories grow so that they touch, they merge and the smaller territory's house disappears.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Finanaces&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each territory has its own reserve/income&lt;/li&gt;&#xA;&lt;li&gt;Each territory starts with 10 gold in its reserve&lt;/li&gt;&#xA;&lt;li&gt;Territories generate 1 income at the end of each turn for each tree-less hexagon&lt;/li&gt;&#xA;&lt;li&gt;If you don't have enough money to pay for your units at the end of your turn, then &lt;em&gt;all&lt;/em&gt; of your units in that territory will die (turn into graves) at the start of your next turn.&lt;/li&gt;&#xA;&lt;li&gt;If a territory splits, then the larger of the two gets &lt;em&gt;all&lt;/em&gt; of the reserve.&lt;/li&gt;&#xA;&lt;li&gt;If a territory combines, their reserves combine&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Defense&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Certain objects give defense to its hexagon and all adjacent friendly hexagons:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Houses (1): cannot be built, but every territory has exactly one&lt;/li&gt;&#xA;&lt;li&gt;Towers (2): can be built for 15 gold&lt;/li&gt;&#xA;&lt;li&gt;Warriors (strength): see below&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Map objects&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Warriors&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A warrior has a strength between 1 to 4 (inclusive)&lt;/li&gt;&#xA;&lt;li&gt;A warrior costs &lt;code&gt;10*strength&lt;/code&gt; to build&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;A warrior costs &lt;code&gt;2*3^(strength-1)&lt;/code&gt; gold each turn.&lt;/strong&gt;  This means that a 4-str warrior costs you a whopping 54 gold per turn&lt;/li&gt;&#xA;&lt;li&gt;A warrior can move a maximum of 4 hexes each turn.  Moving through enemy lands is not allowed.  Capturing enemy lands ends the warrior's turn.&lt;/li&gt;&#xA;&lt;li&gt;If you move/build a warrior onto a friendly warrior, they combine, and their strength is summed.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Trying to make a warrior of &lt;code&gt;strength &amp;gt; 4&lt;/code&gt; doesn't work&lt;/li&gt;&#xA;&lt;li&gt;If the friendly warrior hadn't moved yet, the new unit can still move&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;A warrior can capture an adjacent hexagon if its defense rating is &lt;strong&gt;lower&lt;/strong&gt; than its strength&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Trees&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Trees prevent a hexagon from generating income&lt;/li&gt;&#xA;&lt;li&gt;Trees grow at the end of each round:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Palm trees grow onto all unoccupied adjacent beach tiles&lt;/li&gt;&#xA;&lt;li&gt;Any unoccupied tile that is adjacent to two pine trees grows another pine&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Trees can be removed by moving a unit onto them&lt;/li&gt;&#xA;&lt;li&gt;Graves turn into a pine/palm (if on beach) tree at the end of the round&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Game flow&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Between 2 to 6 players can play on a single map.  (The size of the map depends on the number of players.  You can expect about 50 hexagons per player)&lt;/li&gt;&#xA;&lt;li&gt;Turn order is randomized, but is consistent within a single game&lt;/li&gt;&#xA;&lt;li&gt;Once a player owns all hexagons, they win!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2016-09-06T16:32:38.370" LastActivityDate="2016-09-06T16:32:38.370" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9962" PostTypeId="2" ParentId="2140" CreationDate="2016-09-01T07:49:23.180" Score="2" Body="&lt;h2&gt;What is my birthday?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In the system of surreal numbers, every number has a birthday, which is used to resolve ties in the case of there being more than one surreal number that would otherwise satisfy an equation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The very first surreal number to be created is zero, written as &lt;code&gt;{|}&lt;/code&gt;. Its birthday is therefore zero. Having created zero, the next two surreal numbers to be created are 1 and -1. Their birthdays are therefore both 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each subsequent day brings in twice as many surreal numbers as the previous day: 2ⁿ-2 numbers are obtained by taking the averages of all the consecutive pairs from all previous days, with the first and last numbers simply incrementing in absolute value. For example, on the second day, the previous surreal numbers are -1, 0 and 1, giving averages of -½ and ½, to which we also add -2 and 2, whilst on the third day the new numbers are -3, -1½, -¾, -¼, ¼, ¾, 1½ and 3.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As you can see, all finite floating-point representations have a finite birthday. (Most real numbers have an infinite binary fraction and therefore an infinite birthday). Your task is to write a program or function that outputs the birthday for a given floating-point number (using your native floating-point format). Although the birthday is always an integer, you can return it as an integer valued floating-point number if you prefer (e.g. if you don't have an unlimited integer type). Test cases:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Number  Birthday&#xA;  1        1&#xA;  0.5      2&#xA;-21       21&#xA;  6.5      8&#xA; -7.9375  12&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2016-09-03T16:13:38.220" LastActivityDate="2016-09-03T16:13:38.220" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="9963" PostTypeId="2" ParentId="2140" CreationDate="2016-09-01T08:32:05.893" Score="-2" Body="&lt;h1&gt;Print the name of the language&lt;/h1&gt;&#xA;&lt;p&gt;The goal of this challenge, as implied in the title, is to print the name of the language with a program in said language, in as few bytes as possible.&lt;/p&gt;&#xA;&lt;p&gt;But that would be too easy, right ?&lt;/p&gt;&#xA;&lt;p&gt;So to add a litle bit of challenge, you are not allowed to use any characters included in the language's name.&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Each submission must be a full program.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The program must take no input, and print the name of the language to STDOUT plus an optional trailing newline, and nothing else.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The program must not write anything to STDERR.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Usual loophole rules apply&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Submissions are scored in bytes, in an appropriate encoding, usually (but not necessarily) UTF-8.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program (in bytes) wins.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&lt;p&gt;After checking, I don't think this question is a dupe.&lt;br /&gt;&#xA;Are there any grammatical mistakes ? (English isn't my first language)&lt;br /&gt;&#xA;Are there any rules that should be added (like banning languages created after the challenge ?)&#xA;Should I add any further specification ?&lt;/p&gt;&#xA;" OwnerUserId="56204" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-01T08:37:12.060" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9970" PostTypeId="2" ParentId="6918" CreationDate="2016-09-02T07:39:29.673" Score="2" Body="&lt;h1&gt;Logicode&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/LogicodeLang/Logicode&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github repo here.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Logicode was created by me, Qwerp-Derp, on August 31, 2016. It's basically a coded version of Logisim.&lt;/p&gt;&#xA;&lt;p&gt;The language consists of three built-in logic gates, &lt;code&gt;AND&lt;/code&gt;, &lt;code&gt;OR&lt;/code&gt; and &lt;code&gt;NOT&lt;/code&gt; (which are represented as &lt;code&gt;&amp;amp;&lt;/code&gt;, &lt;code&gt;|&lt;/code&gt; and &lt;code&gt;!&lt;/code&gt; respectively), and that's basically it. You do the rest.&lt;/p&gt;&#xA;&lt;p&gt;You can make:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;circuits (which are basically functions)&#xA;&lt;ul&gt;&#xA;&lt;li&gt;these only take strings of &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt; as input and output strings of &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt; as output.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;variables&lt;/li&gt;&#xA;&lt;li&gt;conditionals&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You can also use stuff like:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;input/output&lt;/li&gt;&#xA;&lt;li&gt;random ints&lt;/li&gt;&#xA;&lt;li&gt;comments&lt;/li&gt;&#xA;&lt;li&gt;reversing strings&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Github stuffs&lt;/h2&gt;&#xA;&lt;p&gt;If anyone can improve the code, go ahead and post a pull request!&lt;/p&gt;&#xA;&lt;p&gt;If you have any issues, please put it in &amp;quot;Issues&amp;quot;.&lt;/p&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-10T06:39:38.847" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9973" PostTypeId="2" ParentId="2140" CreationDate="2016-09-02T09:31:20.693" Score="0" Body="&lt;h2&gt;Tower of Hanoi Hamiltonian Cycle&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Every tower of Hanoi has a unique Hamiltonian cycle of length 3ⁿ. The cycle for &lt;code&gt;n=1&lt;/code&gt; is simply &lt;code&gt;1| | , |1| , | |1&lt;/code&gt; while for &lt;code&gt;n=2&lt;/code&gt; it is as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;12          move disc 1 from rod 1 to rod 2&#xA;2   1                 2          1        3&#xA;    1   2             1          2        3&#xA;        12            1          3        1&#xA;1       2             2          3        2&#xA;1   2                 1          1        2&#xA;    12                1          2        3&#xA;    2   1             2          2        1&#xA;2       1             1          3        1 - closes cycle&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a program or function which, given a positive integer &lt;code&gt;n&lt;/code&gt;, returns the Hamiltonian cycle for the Hanoi Graph of order &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can output the graph starting at any point and traversing it in either order. You can output the graph as a list of positions or a list of moves. It must be possible to loop back from the last line of your output to the first, but you don't have to repeat the position.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest solution wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2016-09-02T09:31:20.693" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="9974" PostTypeId="2" ParentId="2140" CreationDate="2016-09-02T11:35:19.723" Score="0" Body="&lt;h1&gt;Warn me when charger is unplugged!&lt;/h1&gt;&#xA;&lt;p&gt;So, I've a &lt;a href=&quot;http://support.hp.com/us-en/product/compaq-presario-v6000-notebook-pc-series/1842076&quot; rel=&quot;nofollow noreferrer&quot;&gt;Compaq Presario V6000&lt;/a&gt; laptop. Two years ago, battery died because of overcharging; So I had to plug charger in order to work with. Without the charger plugged, it runs out of power after ~4 seconds. Unfortunately, today I found out that charger port is tighten because of intense use &amp;amp; charger gets unplugged after few minutes. Your task is to solve my problem by writing a full program which warns me about unplugged charger!&lt;/p&gt;&#xA;&lt;h1&gt;GOAL&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Write a full program that opens an X windows or makes similar graphical drawing that warns me about unplugged charger with writing &amp;quot;WARNING&amp;quot; in a readable font with size 36 and in color red.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program must warn me in less than 2 seconds after being unplugged.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Information about my laptop is available &lt;a href=&quot;http://support.hp.com/us-en/product/compaq-presario-v6000-notebook-pc-series/1842076&quot; rel=&quot;nofollow noreferrer&quot;&gt;HERE&lt;/a&gt;. It's running Slacko puppy 6.3.0 with JWM &amp;amp; other default programs.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Here's what I've in /dev directory :&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;adsp&#xA;agpgart&#xA;audio&#xA;audio1&#xA;autofs&#xA;bsg&#xA;btrfs-control&#xA;bus&#xA;cdrom&#xA;char&#xA;console&#xA;cpu_dma_latency&#xA;cuse&#xA;dac960_gam&#xA;dri&#xA;dsp&#xA;dsp1&#xA;dvd&#xA;fb0&#xA;fd&#xA;full&#xA;fuse&#xA;hidraw0&#xA;hpet&#xA;hwrng&#xA;input&#xA;kmsg&#xA;log&#xA;loop0&#xA;loop1&#xA;loop10&#xA;loop11&#xA;loop12&#xA;loop13&#xA;loop14&#xA;loop15&#xA;loop2&#xA;loop3&#xA;loop4&#xA;loop5&#xA;loop6&#xA;loop7&#xA;loop8&#xA;loop9&#xA;loop-control&#xA;mapper&#xA;mcelog&#xA;md0&#xA;mem&#xA;mixer&#xA;mixer1&#xA;mouse&#xA;mptctl&#xA;nbd0&#xA;nbd1&#xA;nbd10&#xA;nbd11&#xA;nbd12&#xA;nbd13&#xA;nbd14&#xA;nbd15&#xA;nbd2&#xA;nbd3&#xA;nbd4&#xA;nbd5&#xA;nbd6&#xA;nbd7&#xA;nbd8&#xA;nbd9&#xA;net&#xA;network_latency&#xA;network_throughput&#xA;null&#xA;port&#xA;ppp&#xA;psaux&#xA;ptmx&#xA;pts&#xA;ptya0&#xA;ptya1&#xA;ptya2&#xA;ptya3&#xA;ptya4&#xA;ptya5&#xA;ptya6&#xA;ptya7&#xA;ptya8&#xA;ptya9&#xA;ptyaa&#xA;ptyab&#xA;ptyac&#xA;ptyad&#xA;ptyae&#xA;ptyaf&#xA;ptyb0&#xA;ptyb1&#xA;ptyb2&#xA;ptyb3&#xA;ptyb4&#xA;ptyb5&#xA;ptyb6&#xA;ptyb7&#xA;ptyb8&#xA;ptyb9&#xA;ptyba&#xA;ptybb&#xA;ptybc&#xA;ptybd&#xA;ptybe&#xA;ptybf&#xA;ptyc0&#xA;ptyc1&#xA;ptyc2&#xA;ptyc3&#xA;ptyc4&#xA;ptyc5&#xA;ptyc6&#xA;ptyc7&#xA;ptyc8&#xA;ptyc9&#xA;ptyca&#xA;ptycb&#xA;ptycc&#xA;ptycd&#xA;ptyce&#xA;ptycf&#xA;ptyd0&#xA;ptyd1&#xA;ptyd2&#xA;ptyd3&#xA;ptyd4&#xA;ptyd5&#xA;ptyd6&#xA;ptyd7&#xA;ptyd8&#xA;ptyd9&#xA;ptyda&#xA;ptydb&#xA;ptydc&#xA;ptydd&#xA;ptyde&#xA;ptydf&#xA;ptye0&#xA;ptye1&#xA;ptye2&#xA;ptye3&#xA;ptye4&#xA;ptye5&#xA;ptye6&#xA;ptye7&#xA;ptye8&#xA;ptye9&#xA;ptyea&#xA;ptyeb&#xA;ptyec&#xA;ptyed&#xA;ptyee&#xA;ptyef&#xA;ptyp0&#xA;ptyp1&#xA;ptyp2&#xA;ptyp3&#xA;ptyp4&#xA;ptyp5&#xA;ptyp6&#xA;ptyp7&#xA;ptyp8&#xA;ptyp9&#xA;ptypa&#xA;ptypb&#xA;ptypc&#xA;ptypd&#xA;ptype&#xA;ptypf&#xA;ptyq0&#xA;ptyq1&#xA;ptyq2&#xA;ptyq3&#xA;ptyq4&#xA;ptyq5&#xA;ptyq6&#xA;ptyq7&#xA;ptyq8&#xA;ptyq9&#xA;ptyqa&#xA;ptyqb&#xA;ptyqc&#xA;ptyqd&#xA;ptyqe&#xA;ptyqf&#xA;ptyr0&#xA;ptyr1&#xA;ptyr2&#xA;ptyr3&#xA;ptyr4&#xA;ptyr5&#xA;ptyr6&#xA;ptyr7&#xA;ptyr8&#xA;ptyr9&#xA;ptyra&#xA;ptyrb&#xA;ptyrc&#xA;ptyrd&#xA;ptyre&#xA;ptyrf&#xA;ptys0&#xA;ptys1&#xA;ptys2&#xA;ptys3&#xA;ptys4&#xA;ptys5&#xA;ptys6&#xA;ptys7&#xA;ptys8&#xA;ptys9&#xA;ptysa&#xA;ptysb&#xA;ptysc&#xA;ptysd&#xA;ptyse&#xA;ptysf&#xA;ptyt0&#xA;ptyt1&#xA;ptyt2&#xA;ptyt3&#xA;ptyt4&#xA;ptyt5&#xA;ptyt6&#xA;ptyt7&#xA;ptyt8&#xA;ptyt9&#xA;ptyta&#xA;ptytb&#xA;ptytc&#xA;ptytd&#xA;ptyte&#xA;ptytf&#xA;ptyu0&#xA;ptyu1&#xA;ptyu2&#xA;ptyu3&#xA;ptyu4&#xA;ptyu5&#xA;ptyu6&#xA;ptyu7&#xA;ptyu8&#xA;ptyu9&#xA;ptyua&#xA;ptyub&#xA;ptyuc&#xA;ptyud&#xA;ptyue&#xA;ptyuf&#xA;ptyv0&#xA;ptyv1&#xA;ptyv2&#xA;ptyv3&#xA;ptyv4&#xA;ptyv5&#xA;ptyv6&#xA;ptyv7&#xA;ptyv8&#xA;ptyv9&#xA;ptyva&#xA;ptyvb&#xA;ptyvc&#xA;ptyvd&#xA;ptyve&#xA;ptyvf&#xA;ptyw0&#xA;ptyw1&#xA;ptyw2&#xA;ptyw3&#xA;ptyw4&#xA;ptyw5&#xA;ptyw6&#xA;ptyw7&#xA;ptyw8&#xA;ptyw9&#xA;ptywa&#xA;ptywb&#xA;ptywc&#xA;ptywd&#xA;ptywe&#xA;ptywf&#xA;ptyx0&#xA;ptyx1&#xA;ptyx2&#xA;ptyx3&#xA;ptyx4&#xA;ptyx5&#xA;ptyx6&#xA;ptyx7&#xA;ptyx8&#xA;ptyx9&#xA;ptyxa&#xA;ptyxb&#xA;ptyxc&#xA;ptyxd&#xA;ptyxe&#xA;ptyxf&#xA;ptyy0&#xA;ptyy1&#xA;ptyy2&#xA;ptyy3&#xA;ptyy4&#xA;ptyy5&#xA;ptyy6&#xA;ptyy7&#xA;ptyy8&#xA;ptyy9&#xA;ptyya&#xA;ptyyb&#xA;ptyyc&#xA;ptyyd&#xA;ptyye&#xA;ptyyf&#xA;ptyz0&#xA;ptyz1&#xA;ptyz2&#xA;ptyz3&#xA;ptyz4&#xA;ptyz5&#xA;ptyz6&#xA;ptyz7&#xA;ptyz8&#xA;ptyz9&#xA;ptyza&#xA;ptyzb&#xA;ptyzc&#xA;ptyzd&#xA;ptyze&#xA;ptyzf&#xA;ram0&#xA;ram1&#xA;ram10&#xA;ram11&#xA;ram12&#xA;ram13&#xA;ram14&#xA;ram15&#xA;ram2&#xA;ram3&#xA;ram4&#xA;ram5&#xA;ram6&#xA;ram7&#xA;ram8&#xA;ram9&#xA;random&#xA;rfkill&#xA;rtc0&#xA;sda&#xA;sda1&#xA;sda2&#xA;sequencer&#xA;sequencer2&#xA;shm&#xA;snd&#xA;sr0&#xA;stderr&#xA;stdin&#xA;stdout&#xA;tty&#xA;tty0&#xA;tty1&#xA;tty10&#xA;tty11&#xA;tty12&#xA;tty13&#xA;tty14&#xA;tty15&#xA;tty16&#xA;tty17&#xA;tty18&#xA;tty19&#xA;tty2&#xA;tty20&#xA;tty21&#xA;tty22&#xA;tty23&#xA;tty24&#xA;tty25&#xA;tty26&#xA;tty27&#xA;tty28&#xA;tty29&#xA;tty3&#xA;tty30&#xA;tty31&#xA;tty32&#xA;tty33&#xA;tty34&#xA;tty35&#xA;tty36&#xA;tty37&#xA;tty38&#xA;tty39&#xA;tty4&#xA;tty40&#xA;tty41&#xA;tty42&#xA;tty43&#xA;tty44&#xA;tty45&#xA;tty46&#xA;tty47&#xA;tty48&#xA;tty49&#xA;tty5&#xA;tty50&#xA;tty51&#xA;tty52&#xA;tty53&#xA;tty54&#xA;tty55&#xA;tty56&#xA;tty57&#xA;tty58&#xA;tty59&#xA;tty6&#xA;tty60&#xA;tty61&#xA;tty62&#xA;tty63&#xA;tty7&#xA;tty8&#xA;tty9&#xA;ttya0&#xA;ttya1&#xA;ttya2&#xA;ttya3&#xA;ttya4&#xA;ttya5&#xA;ttya6&#xA;ttya7&#xA;ttya8&#xA;ttya9&#xA;ttyaa&#xA;ttyab&#xA;ttyac&#xA;ttyad&#xA;ttyae&#xA;ttyaf&#xA;ttyb0&#xA;ttyb1&#xA;ttyb2&#xA;ttyb3&#xA;ttyb4&#xA;ttyb5&#xA;ttyb6&#xA;ttyb7&#xA;ttyb8&#xA;ttyb9&#xA;ttyba&#xA;ttybb&#xA;ttybc&#xA;ttybd&#xA;ttybe&#xA;ttybf&#xA;ttyc0&#xA;ttyc1&#xA;ttyc2&#xA;ttyc3&#xA;ttyc4&#xA;ttyc5&#xA;ttyc6&#xA;ttyc7&#xA;ttyc8&#xA;ttyc9&#xA;ttyca&#xA;ttycb&#xA;ttycc&#xA;ttycd&#xA;ttyce&#xA;ttycf&#xA;ttyd0&#xA;ttyd1&#xA;ttyd2&#xA;ttyd3&#xA;ttyd4&#xA;ttyd5&#xA;ttyd6&#xA;ttyd7&#xA;ttyd8&#xA;ttyd9&#xA;ttyda&#xA;ttydb&#xA;ttydc&#xA;ttydd&#xA;ttyde&#xA;ttydf&#xA;ttye0&#xA;ttye1&#xA;ttye2&#xA;ttye3&#xA;ttye4&#xA;ttye5&#xA;ttye6&#xA;ttye7&#xA;ttye8&#xA;ttye9&#xA;ttyea&#xA;ttyeb&#xA;ttyec&#xA;ttyed&#xA;ttyee&#xA;ttyef&#xA;ttyp0&#xA;ttyp1&#xA;ttyp2&#xA;ttyp3&#xA;ttyp4&#xA;ttyp5&#xA;ttyp6&#xA;ttyp7&#xA;ttyp8&#xA;ttyp9&#xA;ttypa&#xA;ttypb&#xA;ttypc&#xA;ttypd&#xA;ttype&#xA;ttypf&#xA;ttyq0&#xA;ttyq1&#xA;ttyq2&#xA;ttyq3&#xA;ttyq4&#xA;ttyq5&#xA;ttyq6&#xA;ttyq7&#xA;ttyq8&#xA;ttyq9&#xA;ttyqa&#xA;ttyqb&#xA;ttyqc&#xA;ttyqd&#xA;ttyqe&#xA;ttyqf&#xA;ttyr0&#xA;ttyr1&#xA;ttyr2&#xA;ttyr3&#xA;ttyr4&#xA;ttyr5&#xA;ttyr6&#xA;ttyr7&#xA;ttyr8&#xA;ttyr9&#xA;ttyra&#xA;ttyrb&#xA;ttyrc&#xA;ttyrd&#xA;ttyre&#xA;ttyrf&#xA;ttys0&#xA;ttyS0&#xA;ttys1&#xA;ttyS1&#xA;ttys2&#xA;ttyS2&#xA;ttys3&#xA;ttyS3&#xA;ttys4&#xA;ttys5&#xA;ttys6&#xA;ttys7&#xA;ttys8&#xA;ttys9&#xA;ttysa&#xA;ttysb&#xA;ttysc&#xA;ttysd&#xA;ttyse&#xA;ttysf&#xA;ttyt0&#xA;ttyt1&#xA;ttyt2&#xA;ttyt3&#xA;ttyt4&#xA;ttyt5&#xA;ttyt6&#xA;ttyt7&#xA;ttyt8&#xA;ttyt9&#xA;ttyta&#xA;ttytb&#xA;ttytc&#xA;ttytd&#xA;ttyte&#xA;ttytf&#xA;ttyu0&#xA;ttyu1&#xA;ttyu2&#xA;ttyu3&#xA;ttyu4&#xA;ttyu5&#xA;ttyu6&#xA;ttyu7&#xA;ttyu8&#xA;ttyu9&#xA;ttyua&#xA;ttyub&#xA;ttyuc&#xA;ttyud&#xA;ttyue&#xA;ttyuf&#xA;ttyv0&#xA;ttyv1&#xA;ttyv2&#xA;ttyv3&#xA;ttyv4&#xA;ttyv5&#xA;ttyv6&#xA;ttyv7&#xA;ttyv8&#xA;ttyv9&#xA;ttyva&#xA;ttyvb&#xA;ttyvc&#xA;ttyvd&#xA;ttyve&#xA;ttyvf&#xA;ttyw0&#xA;ttyw1&#xA;ttyw2&#xA;ttyw3&#xA;ttyw4&#xA;ttyw5&#xA;ttyw6&#xA;ttyw7&#xA;ttyw8&#xA;ttyw9&#xA;ttywa&#xA;ttywb&#xA;ttywc&#xA;ttywd&#xA;ttywe&#xA;ttywf&#xA;ttyx0&#xA;ttyx1&#xA;ttyx2&#xA;ttyx3&#xA;ttyx4&#xA;ttyx5&#xA;ttyx6&#xA;ttyx7&#xA;ttyx8&#xA;ttyx9&#xA;ttyxa&#xA;ttyxb&#xA;ttyxc&#xA;ttyxd&#xA;ttyxe&#xA;ttyxf&#xA;ttyy0&#xA;ttyy1&#xA;ttyy2&#xA;ttyy3&#xA;ttyy4&#xA;ttyy5&#xA;ttyy6&#xA;ttyy7&#xA;ttyy8&#xA;ttyy9&#xA;ttyya&#xA;ttyyb&#xA;ttyyc&#xA;ttyyd&#xA;ttyye&#xA;ttyyf&#xA;ttyz0&#xA;ttyz1&#xA;ttyz2&#xA;ttyz3&#xA;ttyz4&#xA;ttyz5&#xA;ttyz6&#xA;ttyz7&#xA;ttyz8&#xA;ttyz9&#xA;ttyza&#xA;ttyzb&#xA;ttyzc&#xA;ttyzd&#xA;ttyze&#xA;ttyzf&#xA;uhid&#xA;uinput&#xA;urandom&#xA;vcs&#xA;vcs1&#xA;vcs2&#xA;vcs3&#xA;vcs4&#xA;vcs5&#xA;vcsa&#xA;vcsa1&#xA;vcsa2&#xA;vcsa3&#xA;vcsa4&#xA;vcsa5&#xA;vga_arbiter&#xA;vhost-net&#xA;zero&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here's what I've in /etc directory&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;acpi                      hostname               pavrecord&#xA;adjtime                   hosts                  pcmcia&#xA;asound.state              hosts.allow            pkcs11&#xA;at-spi2                   hosts.deny             ppp&#xA;bash_completion.d         init.d                 precord&#xA;belocs                    inittab                printcap&#xA;ca-certificates           inputrc                profile&#xA;ca-certificates.conf      issue                  profile.d&#xA;ca-certificates.conf.new  jwm-2.3.xslt           protocols&#xA;cdburnerdevice            kde                    Puppybackgroundpicture&#xA;clock                     keymap                 radiusclient&#xA;codepage                  keymap_previous        ramdiskfssize&#xA;cron.daily                lazarus                ramdisksize&#xA;cups                      ld.so.cache            rc.d&#xA;dbus-1                    ld.so.conf             rc_keymaps&#xA;default                   ld.so.conf.d           rc_maps.cfg&#xA;desktop_icon_theme        libnl                  README.txt&#xA;dhcpcd.conf               localtime              request-key.conf&#xA;dhcpcd.conf.new           localtime-copied-from  request-key.d&#xA;dhcpcd.duid               logrotate.d            resolutionfix&#xA;dhcpcd_state_notify       lvm                    resolv.conf&#xA;dhcpcd_state_notify.bak   lynx.cfg               rpc&#xA;dict.conf                 lynx.lss               samba&#xA;dictd.conf                mailcap                sane.d&#xA;DISTRO_SPECS              mc                     securetelnetrc&#xA;drirc                     mime.types             services&#xA;esd.conf                  misc                   shadow&#xA;esd.conf.new              mke2fs.conf            shadow-&#xA;eventmanager              mke2fs.conf.new        shells&#xA;fb.modes                  modprobe.d             simple_network_setup&#xA;fdprm                     modules                slsh.rc&#xA;file                      modules.conf           ssl&#xA;floppy                    mousebuttons           sudo.conf&#xA;fltk                      mousedevice            sudoers&#xA;fontmap                   mtab                   sudoers.d&#xA;fonts                     my.cnf                 system.jwmrc&#xA;foomatic                  my.cnf.d               udev&#xA;fpc.cfg                   mysqlaccess.conf       uniconf.conf&#xA;fppkg                     nanorc                 usb_modeswitch.conf&#xA;fppkg.cfg                 nanorc.new             usb_modeswitch.d&#xA;frisbee                   NETWORKING             vga&#xA;fstab                     networkmodules         wcpufreqdriver&#xA;fstab.bak                 networks               wgetrc&#xA;gamin                     network-wizard         windowmanager&#xA;gconf                     nscd.conf              wpa_supplicant.conf&#xA;gftp                      nscd.conf.new          wpa_supplicant.conf.new&#xA;group                     nsswitch.conf          wvdial.conf&#xA;group-                    oldmousedevice         wvdial_options&#xA;gshadow                   openldap               X11&#xA;gshadow-                  os-release             xdg&#xA;gtk-2.0                   pam.d                  xextraoptions&#xA;gtk-3.0                   pango                  xorgoverrides&#xA;hiawatha                  passwd&#xA;host.conf                 passwd-&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program must not hurt my friend in any way&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt;. Shortest codes win!&lt;/p&gt;&#xA;" OwnerDisplayName="user55673" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-02T11:35:19.723" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9981" PostTypeId="2" ParentId="2140" CreationDate="2016-09-03T17:37:58.627" Score="0" Body="&lt;h1&gt;The number 3 is cursed; avoid it&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;Inspired from &lt;a href=&quot;https://xkcd.com/1275/&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's well know that the number 3 may lead to weird bugs in a program. So your task is to write a program to remove every literal &lt;code&gt;3&lt;/code&gt; (only the base 10 number; not a &lt;code&gt;3&lt;/code&gt; in a string, a variable name, a longer number or with a different base) in a source code written in the language of your program by the floor of π.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But you can't have the character &lt;code&gt;3&lt;/code&gt; anywhere in your source code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can't use a language without number literals.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases (source language: Python)&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;print(3)&#xA;=&amp;gt;&#xA;import math&#xA;print(int(math.pi))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;print(&quot;3 * 1 = %d&quot; % 3)&#xA;=&amp;gt;&#xA;import math&#xA;print(&quot;3 * 1 = %d&quot; % int(math.pi))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;var1 = var2 = 33&#xA;var3 = 3 * var1 + var2 * 3&#xA;print(&quot;3 * %d + %d * 3 = %d&quot; % var3)&#xA;=&amp;gt;&#xA;import math&#xA;var1 = var2 = 33&#xA;var3 = int(math.pi) * var1 + var2 * int(math.pi)&#xA;print(&quot;3 * %d + %d = %d&quot; % var3)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;print(0x3)&#xA;=&amp;gt;&#xA;print(0x3)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Since this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the shortest answer in bytes win. Good luck!&lt;/p&gt;&#xA;" OwnerUserId="53745" LastEditorUserId="53745" LastEditDate="2016-09-03T20:16:22.483" LastActivityDate="2016-09-03T20:16:22.483" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="9983" PostTypeId="2" ParentId="2140" CreationDate="2016-09-03T19:32:33.657" Score="0" Body="&lt;h1&gt;Simulate World's smallest universal Turing machine&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Goal:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;to implement world smallest automata which was proved (though, not strictly) to be able to simulate any other universal Turing machine, Wolfram's 2-state 3-symbol Turing machine &amp;amp; prove your language's Turing-completeness.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/qpzTy.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/qpzTy.gif&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specification:&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;{{1, 2} -&gt; {1, 1, -1}, {1, 1} -&gt; {1, 2, -1}, {1, 0} -&gt; {2, 1, 1}, &#xA;  {2, 2} -&gt; {1, 0, 1}, {2, 1} -&gt; {2, 2, 1}, {2, 0} -&gt; {1, 2, -1}}&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;where this means {state, color} -&gt; {state, color, offset}. (Colors of cells on the tape are sometimes instead thought of as &quot;symbols&quot; written to the tape.)&#xA;  &lt;a href=&quot;http://www.wolframscience.com/prizes/tm23/technicaldetails.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h3&gt;&quot;Word&quot; description:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Think of this machine as an array processing function. This array has a pointer accessible by function. Every cell in this array can store an integer from 0 upto 2. Array is infinite from both sides &amp;amp; pointer is pointing to somewhere in the middle of this array. function itself has 2 modes. in each mode, it works different than other. Let's call these 2 modes &quot;A&quot; &amp;amp; &quot;B&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;if in state &quot;A&quot; :&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;if the value of the cell pointed by pointer is 0, change it to 1 &amp;amp; increase pointer &amp;amp; toggle state;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;if the value of the cell pointed by pointer is 1, change it to 2 &amp;amp; decrease pointer;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;if the value of the cell pointed by pointer is 2, change it to 1 &amp;amp; decrease pointer;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;if in state &quot;B&quot; :&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;if the value of the cell pointed by pointer is 0, change it to 2 &amp;amp; decrease pointer &amp;amp; toggle state;&lt;/li&gt;&#xA;&lt;li&gt;if the value of the cell pointed by pointer is 1, change it to 2 &amp;amp; increase pointer;&lt;/li&gt;&#xA;&lt;li&gt;if the value of the cell pointed by pointer is 2, change it to 0 &amp;amp; increase pointer &amp;amp; toggle state;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;(Increasing the pointer moves it to right.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program's array must be at least (2^16+1) and when it goes out of boundary, pointer must come back from other side. Size of array must be either dynamic or odd (Which at first, pointer is pointing to middle element of array).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;I/O format&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Though there aren't strict rules about input &amp;amp; output. Your program must at least get number of iterations as an input &amp;amp; output current pointer address (an integer, 0 at first, negetive if pointer gets decremented to subzero) &amp;amp; value of pointed cell along with a seprator (e.g. space) at every iteration. Though this is the minimal requirement. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winning criteria(s)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There aren't many restrictions about challenge itself. But for wining, you'll need to get other users' votes. You can try to make an optimized system, or simulate it in a strange language, or have an strange design. But you mustn't add anything extra to machine itself, and must be able to produce the exact state of pointer and tape in a particular iteration.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;. Answers with highest votes will win.&lt;/p&gt;&#xA;" OwnerDisplayName="user55673" LastActivityDate="2016-09-03T19:32:33.657" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9986" PostTypeId="1" CreationDate="2016-09-03T23:48:03.377" Score="-2" ViewCount="111" Body="&lt;p&gt;The leaderboard snippet could use some improvements. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Improvements usually fall into three categories:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Formatting &amp;amp; CSS&lt;/strong&gt; - make it look better&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Functionality&lt;/strong&gt; - stuff it should do&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Misc&lt;/strong&gt; - everything else&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Please answer with suggestions. I've added a few myself.&lt;/p&gt;&#xA;" OwnerUserId="41088" LastEditorUserId="56656" LastEditDate="2022-09-29T16:17:03.993" LastActivityDate="2022-09-29T16:17:03.993" Title="Let's improve the leaderboard snippet" Tags="|discussion|feature-request|status-declined|stack-snippets|leaderboard|" AnswerCount="3" CommentCount="2" ClosedDate="2016-09-04T00:17:55.140" ContentLicense="CC BY-SA 3.0" />
  <row Id="9987" PostTypeId="2" ParentId="9986" CreationDate="2016-09-03T23:48:03.377" Score="-3" Body="&lt;h1&gt;&lt;em&gt;Formatting&lt;/em&gt; - Set a default font&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let's be honest. Most browsers' default font (usually Times New Roman) is pretty ugly. Let's fix that. And propose fonts please!&lt;/p&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2016-09-03T23:48:03.377" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9988" PostTypeId="2" ParentId="9986" CreationDate="2016-09-03T23:49:20.400" Score="-3" Body="&lt;h1&gt;&lt;em&gt;Misc&lt;/em&gt; - Golf up the code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;...to allow for longer challenges. We're code golfers, people! We can do this! This is also a good challenge...&lt;/p&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2016-09-03T23:49:20.400" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="9989" PostTypeId="2" ParentId="9986" CreationDate="2016-09-04T00:16:46.557" Score="0" Body="&lt;h1&gt;Keep the leaderboard the same&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;At the moment there is little problem with the leaderboard, so why fix what ain't broke. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The only real problem is its lack of use, but adding things to the leaderboard code will only make that less attractive.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2016-09-04T00:16:46.557" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9990" PostTypeId="2" ParentId="5139" CreationDate="2016-09-04T01:33:17.177" Score="3" Body="&lt;h1&gt;&lt;em&gt;Formatting&lt;/em&gt; - Set a default font&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let's be honest. Most browsers' default font (usually Times New Roman) is pretty ugly. Let's fix that. And propose fonts please!&lt;/p&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2016-09-04T01:33:17.177" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9991" PostTypeId="1" AcceptedAnswerId="9992" CreationDate="2016-09-04T01:36:38.293" Score="7" ViewCount="206" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot;&gt;chess&lt;/a&gt; tag wiki currently states, &quot;This tag is for challenges related to chess &lt;em&gt;or any derivative of it&lt;/em&gt;.&quot; This wording technically excludes games like &lt;a href=&quot;https://en.wikipedia.org/wiki/Xiangqi&quot; rel=&quot;nofollow noreferrer&quot;&gt;Xiangqi&lt;/a&gt; (aka &quot;Chinese chess&quot;), which are part of the same family but aren't &lt;em&gt;derivatives&lt;/em&gt; (more like cousins). If we're going to include &lt;a href=&quot;https://en.wikipedia.org/wiki/Fairy_chess&quot; rel=&quot;nofollow noreferrer&quot;&gt;fairy chess&lt;/a&gt; in the tag (&lt;a href=&quot;https://codegolf.stackexchange.com/q/78019/16766&quot;&gt;e.g.&lt;/a&gt;), should we also include games that developed separately from European chess but share a common ancestor?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9980/16766&quot;&gt;Sandbox post that inspired this question&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Update: The tag wiki has now been edited.&lt;/p&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-09-07T05:51:02.997" Title="What questions should be tagged [chess]?" Tags="|discussion|tags|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="9992" PostTypeId="2" ParentId="9991" CreationDate="2016-09-04T01:43:48.950" Score="12" Body="&lt;h1&gt;Both derivatives and cousins of chess should be included&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It makes sense for other games that are closely related to chess to be included in the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot;&gt;chess&lt;/a&gt; tag. I propose the following wording for the header of the tag wiki:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This tag is for challenges related to chess or any variation on chess.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The longer description can be edited in the same way. It may be helpful to provide a link to &lt;a href=&quot;https://en.wikipedia.org/wiki/List_of_chess_variants&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://en.wikipedia.org/wiki/List_of_chess_variants&lt;/a&gt; for clarity.&lt;/p&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="16766" LastEditDate="2016-09-04T04:20:39.543" LastActivityDate="2016-09-04T04:20:39.543" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="9993" PostTypeId="1" AcceptedAnswerId="9994" CreationDate="2016-09-04T05:06:24.007" Score="-15" ViewCount="291" Body="&lt;p&gt;I think the image is downright ugly:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/uCOUi.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/uCOUi.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Only the beta communities have this sort of image, this isn't beta anymore so can we change it to something more attractive please??? It strains my eyes everytime I want to solve some programming challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Something like this would look pretty good I'd say:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/JPJAD.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/JPJAD.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="59272" LastEditorUserId="68942" LastEditDate="2021-06-09T05:32:47.687" LastActivityDate="2021-06-09T05:32:47.687" Title="Can we change the Programming Puzzles &amp; Code Golf community image?" Tags="|feature-request|status-declined|" AnswerCount="1" CommentCount="5" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9994" PostTypeId="2" ParentId="9993" CreationDate="2016-09-04T07:18:46.800" Score="12" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Only the beta communities have this sort of image&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;was once true, but as the number of sites which are graduating has grown, a backlog has built up. The icon will be changed as part of a cohesive design change for the whole site.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2016-09-04T07:18:46.800" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="9998" PostTypeId="2" ParentId="2140" CreationDate="2016-09-04T14:13:53.840" Score="5" Body="&lt;h1&gt;Sesquiprimes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a non-negative integer &lt;code&gt;N&lt;/code&gt;, output the &lt;code&gt;N&lt;/code&gt;th sesquiprime integer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We say that a positive integer &lt;code&gt;I&lt;/code&gt; is sesquiprime if &lt;code&gt;I + ⌊I/2⌋&lt;/code&gt; is prime (where  &lt;code&gt;⌊...⌋&lt;/code&gt; is the floor function).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, &lt;code&gt;25&lt;/code&gt; is a sesquiprime because &lt;code&gt;25 + ⌊25/2⌋ = 25 + 12 = 37&lt;/code&gt;, which is prime.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://oeis.org/A158708&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sequence A158708&lt;/a&gt; is the sequence of prime sesquiprimes.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Inputs and outputs&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;N&lt;/code&gt; may be 0-indexed or 1-indexed, please indicate which of the two your solution uses.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Inputs and outputs must be in the decimal base.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;N&lt;/code&gt; may be taken through &lt;code&gt;STDIN&lt;/code&gt;, as a function argument, or anything similar.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The output may be printed to &lt;code&gt;STDOUT&lt;/code&gt;, returned from a function, or anything similar.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The following test cases are 0-indexed.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;N        Output&#xA;&#xA;0        2&#xA;1        5&#xA;2        9&#xA;4        21&#xA;8        45&#xA;15       93&#xA;16       101&#xA;23       149&#xA;42       305&#xA;100      853&#xA;1000     11693&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="41723" LastActivityDate="2016-09-04T14:13:53.840" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10002" PostTypeId="2" ParentId="8047" CreationDate="2016-09-04T21:07:23.110" Score="52" Body="&lt;h2&gt;Non-observable program requirements&lt;/h2&gt;&#xA;&lt;p&gt;The validity of a program should depend on things that can be observed when the program is treated as a black box. Examples are data written to standard output or error streams, drawing on the screen, file operations, memory usage, and runtime. &lt;em&gt;Non&lt;/em&gt;-observable behaviors include &amp;quot;string operations&amp;quot; and &amp;quot;implementing the Fu-Barr algorithm&amp;quot;. Additionally, &amp;quot;using Y&amp;quot; would fall into the non-observable category in most instances of &amp;quot;Do X without Y&amp;quot;&lt;/p&gt;&#xA;&lt;h3&gt;Why they are bad&lt;/h3&gt;&#xA;&lt;p&gt;Non-observable requirements tend to be vague, subjective, or based on false assumptions about the properties of programming languages. For example, requiring that answers use a specific algorithm is highly open to interpretation. What modifications are allowed? Can some steps be replaced with different operations that produce the same result?&lt;/p&gt;&#xA;&lt;h3&gt;Exceptions&lt;/h3&gt;&#xA;&lt;p&gt;A commonly used non-observable requirement is to avoid using a library function that solves the entire challenge. I believe these rules are OK. Like other non-observable requirements, one can find borderline cases of whether a built-in function solves all of the task or not, but the benefits of higher-quality answers outweigh the costs.&lt;/p&gt;&#xA;" OwnerUserId="30688" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-04T21:07:23.110" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="10003" PostTypeId="2" ParentId="8047" CreationDate="2016-09-04T21:58:43.933" Score="51" Body="&lt;h2&gt;Don't allow / ask for different things in languages with different capabilities&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Don't write specs like &quot;Do X. If your language doesn't support X, you can do Y instead&quot;. Examples are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do some math in floating point. If your language doesn't support floating point, you can use integer&lt;/li&gt;&#xA;&lt;li&gt;Read input from a file. If your language doesn't support file I/O, you can read from stdin&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;X and Y, can be quite different tasks, although they might look similar. Either allow the alternatives Y for all languages or for none.&lt;/p&gt;&#xA;" OwnerUserId="34531" LastActivityDate="2016-09-04T21:58:43.933" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10013" PostTypeId="2" ParentId="6918" CreationDate="2016-09-07T03:29:23.463" Score="10" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/ETHproductions/cubix&quot; rel=&quot;nofollow&quot;&gt;Cubix&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;&lt;a href=&quot;https://github.com/ETHproductions/cubix&quot; rel=&quot;nofollow&quot;&gt;GitHub repo&lt;/a&gt; | &lt;a href=&quot;https://ethproductions.github.io/cubix&quot; rel=&quot;nofollow&quot;&gt;Online interpreter&lt;/a&gt; | &lt;a href=&quot;https://jsfiddle.net/vihanb/w5p8p2ms/26/embedded/result/&quot; rel=&quot;nofollow&quot;&gt;Code design helper by @Downgoat&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Cubix is a stack-based 2D language, created by me sometime in March. Cubix differs from ordinary 2D languages in that it's not strictly 2D: &lt;strong&gt;the code is wrapped around a cube.&lt;/strong&gt; The first thing the interpreter does is remove whitespace, then figure out the smallest cube that the code will fit onto. The code is then padded with no-ops until all six sides are filled. That means that this &quot;Hello, World!&quot; program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;./v.o;@?/&quot;!dlroW&quot;S',u/&quot;Hello&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is exactly the same as this one:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;      . / v&#xA;      . o ;&#xA;      @ ? /&#xA;&quot; ! d l r o W &quot; S ' , u&#xA;/ &quot; H e l l o &quot; . . . .&#xA;. . . . . . . . . . . .&#xA;      . . .&#xA;      . . .&#xA;      . . .&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then the code is run like a 2-dimensional language, except that the IP (instruction pointer) wraps around like the code is on a cube.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fun fact: Cubix was &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/28191702#28191702&quot;&gt;almost named Würfelsprache&lt;/a&gt;, but fortunately was &lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=28192184#28192184&quot;&gt;saved by @Downgoat&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="42545" LastActivityDate="2016-09-07T03:29:23.463" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10016" PostTypeId="1" AcceptedAnswerId="10019" CreationDate="2016-09-07T10:46:44.507" Score="5" ViewCount="298" Body="&lt;p&gt;I'd like to know if codegolf does allow other kinds of challenges, like memory-size related ones (Given a structure, try to use the least amount of bits to store the same information) and so on. I don't know if this kind of challenge fits codegolfing or not.&lt;/p&gt;&#xA;" OwnerUserId="59368" LastEditorDisplayName="user62131" LastEditDate="2017-04-25T00:12:57.140" LastActivityDate="2017-04-25T00:12:57.140" Title="Does codegolf involve only code size?" Tags="|support|tags|" AnswerCount="3" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10017" PostTypeId="2" ParentId="10016" CreationDate="2016-09-07T10:51:34.193" Score="0" Body="&lt;h2&gt;No&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is only about the shortest code in any language. Other challenges are tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="53745" LastActivityDate="2016-09-07T10:51:34.193" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10018" PostTypeId="2" ParentId="10016" CreationDate="2016-09-07T10:52:47.997" Score="1" Body="&lt;p&gt;&lt;strong&gt;From the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; tag wiki:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Code-golf is a competition to solve a particular problem in the fewest bytes of source code. If you want to score by characters instead of bytes, state this explicitly in the challenge. If source code length is not the primary scoring criterion, consider using another tag instead.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So, no, code golf is solely about code length.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2016-09-07T10:52:47.997" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10019" PostTypeId="2" ParentId="10016" CreationDate="2016-09-07T11:05:48.927" Score="18" Body="&lt;p&gt;There are two different usages of &quot;code golf&quot; here:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is applied to challenges which involve competing to produce the shortest valid source code. More details and a list of challenges can be found by clicking on the tag name.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This website, &quot;codegolf.stackexchange.com&quot;, has the full name &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;Programming Puzzles &amp;amp; Code Golf&lt;/a&gt;. This site has several different challenge types, code golf being just one of them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Sometimes people post challenges that have their own scoring method that does not fit exactly into one of these categories. These are tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, and the challenge post contains a detailed description of how submissions will be scored.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We also have non-challenge questions, asking for advice on solving such challenges. These are tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-09-07T13:33:25.760" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10023" PostTypeId="2" ParentId="2140" CreationDate="2016-09-07T18:14:19.397" Score="0" Body="&lt;h1&gt;Output a number tent&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Given an integer, output a number tent. (The number tent is just called as such.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input determines:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;whether the tent is upside down (negative) or right way up (positive),&lt;/li&gt;&#xA;&lt;li&gt;whether the entrance is on the left side (even) or the right side (odd), and&lt;/li&gt;&#xA;&lt;li&gt;the size of the tent (&lt;a href=&quot;http://mathurl.com/hwkkw3f.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;abs(input/2) http://mathurl.com/hwkkw3f.png&lt;/a&gt; with integer division).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;For input -4:&#xA;________&#xA;\  /   /&#xA; \/___/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Assume that the input will never be &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;0&lt;/code&gt; or &lt;code&gt;-1&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;TODO&lt;/strong&gt; Clarify.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Your code should be as short as possible.&lt;/p&gt;&#xA;" OwnerUserId="48538" LastEditorUserId="48538" LastEditDate="2016-09-08T09:56:39.113" LastActivityDate="2016-09-08T09:56:39.113" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10024" PostTypeId="1" CreationDate="2016-09-07T23:30:58.227" Score="56" ViewCount="807" Body="&lt;h1&gt;Typing Literal Tab Characters&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I do not know how feasible this is, for the developers, but I do believe, that at least on this site, it may make more sense to stop expanding tabs into four spaces. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the browser side code can be made to render tabs as four spaces, this issue is moot. Some code golf answers (or input samples) require a literal tab in the source and there should be a way to indicate that. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am not a web developer, so I may be clueless, but I will put this up for a feature request and take any &lt;s&gt;flak&lt;/s&gt; downvotes.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is not intended to incite any tabs versus space wars.&#xA;&lt;hr/&gt;&#xA;Wow! This post seems to have garnered a significant community consensus. As such, I have put this up for a network wide feature request &lt;a href=&quot;https://meta.stackexchange.com/questions/285838/expansion-of-tabs&quot;&gt;here&lt;/a&gt;!&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="68942" LastEditDate="2021-06-09T05:38:24.320" LastActivityDate="2021-06-09T05:38:24.320" Title="Stop replacing my tabs with four spaces" Tags="|discussion|feature-request|status-declined|" AnswerCount="1" CommentCount="23" ContentLicense="CC BY-SA 3.0" />
  <row Id="10025" PostTypeId="1" AcceptedAnswerId="10027" CreationDate="2016-09-08T02:46:23.910" Score="3" ViewCount="164" Body="&lt;p&gt;I've been slowly forming in my head a question for a Cops and Robbers style code challenge, and it occurred to me that I actually don't really know the general details of how they're set out... Is there anything here on PPCG that can either point me in the right direction, or at least general guidelines I need to adhere to?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thanks guys and gals!&lt;/p&gt;&#xA;" OwnerUserId="8555" LastEditorUserId="31716" LastEditDate="2016-09-08T02:59:28.080" LastActivityDate="2016-09-08T08:15:43.367" Title="What are the guidelines for formulating a Cops and Robbers style challenge?" Tags="|discussion|policy|asking-questions|cops-and-robbers|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10026" PostTypeId="2" ParentId="2140" CreationDate="2016-09-08T07:57:06.603" Score="0" Body="&lt;h1&gt;Output a confusion matrix&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Confusion_matrix&quot; rel=&quot;nofollow noreferrer&quot;&gt;A confusion matrix&lt;/a&gt; is a pretty typical thing to see in a machine learning paper. It is a matrix where each cell contains the number of instances of the class of the row that were classified as the class of the column.&lt;/p&gt;&#xA;&lt;p&gt;For example, if we have two classes &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt;, and 4 instances &lt;code&gt;[A, A]&lt;/code&gt; (meaning that instance is of class &lt;code&gt;A&lt;/code&gt; and was classified as &lt;code&gt;A&lt;/code&gt;), &lt;code&gt;[A, B]&lt;/code&gt;, &lt;code&gt;[B, B]&lt;/code&gt; and &lt;code&gt;[B, B]&lt;/code&gt;, then the resulting confusion matrix would be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  A B&#xA;A 1 1&#xA;B   2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;TODO: more details about the format, what happens if the name of the classes have different lengths, etc. etc.&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-08T07:57:06.603" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10027" PostTypeId="2" ParentId="10025" CreationDate="2016-09-08T08:15:43.367" Score="4" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/tags/cops-and-robbers/info&quot;&gt;tag wiki&lt;/a&gt; has a few pointers, as does &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2335/8478&quot;&gt;the meta post Geobits linked&lt;/a&gt;. I don't know if this is the best way to do it, but here is the general practice we've been using so far (some of these are assuming 1-vs-1-style cops and robbers challenges like all the ones we've had so far; in principle it should be possible to have n-vs-1, 1-vs-n or n-vs-n challenges as well):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Post separate challenges for the cops and the robbers, linking them to each other. a) this allows the robbers to include explanations with their submissions (or to format longer pieces of code properly) and b) the robbers can gain reputation for their answers and an answer can be accepted.&lt;/li&gt;&#xA;&lt;li&gt;Robbers should link to the cop they crack and post a comment on that answer linking back to their own. The cop should then edit their answer to indicate that it has been cracked.&lt;/li&gt;&#xA;&lt;li&gt;Robbers generally don't have to find the particular solution the cop intended, but just any one solution that satisfies the specification (otherwise, this would amount to guessing in most cases).&lt;/li&gt;&#xA;&lt;li&gt;To ensure that all cop answers are valid (i.e. crackable), set a time limit like 7 days. If this time limit passes after a cop has been posted, the cop may reveal their solution at which point it is safe and can no longer be cracked. I usually allow robbers to crack cops after the end of the time limit until the cop actually reveals the solution (in order to incentivise cops to reveal their solutions as soon as possible).&lt;/li&gt;&#xA;&lt;li&gt;It usually makes sense to require cops to be deterministic.&lt;/li&gt;&#xA;&lt;li&gt;For the cops, each answer is usually scored individually (as opposed to determine an aggregate score for each user), and increasing that score should make it more likely that the answer can be cracked. A good choice is usually the normal &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; score, because for most cops and robbers challenges, shorter submissions give fewer options to guard a valid solution.&lt;/li&gt;&#xA;&lt;li&gt;For the robbers, people usually form an aggregate score per user (although this is by no means necessary). A common choice is simply to use the largest number of cracked cops, using a tie breaker based on the cop scores. For the robbers it's tempting to use the inverse score of the cops (e.g. a longer cop submission is usually harder to crack, so it should give fewer points for the cops and more for the robbers), but be careful with this: the incentive for the robbers is then to focus on those cop answers which aren't likely to win anyway. One example with such a scoring is &lt;a href=&quot;https://codegolf.stackexchange.com/q/64520/8478&quot;&gt;this challenge&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Unlike our other challenges, it makes sense to close the challenge at some point (e.g. once you haven't received a new cop for a week or two). Once the challenge loses attention (from HNQ and being discussed in chat), it's very easy for someone to slip in an easy cop that is simply not cracked because no one noticed it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Finally, there's one big unsolved problem for cops and robbers challenges: almost every challenge is susceptible to cops that are simply safe for cryptographic reasons. E.g. it's very easy to encode a massive prime factorisation in a cop, so that even though it's clear how the solution looks in principle, the exact solution simply can't be found within the time limit because it would be computationally too expensive. Similarly, one could make use of a PRNG with a fixed (but hidden) seed, which would still make for a deterministic answer. At this point I'm not aware of a good solution and &lt;em&gt;really&lt;/em&gt; hope that one day someone will come up with one, because this is what is stopping me from posting the cops and robbers challenges I have in the sandbox myself. The only fix we currently know is to disallow PRNGs, hash functions, encoding functions (like base 64) and cryptographic functions, but it's always possible to implement these things yourself for a few bytes, especially in golfing languages. Ideally cops and robbers would be about figuring out the cop's approach or algorithm, not the parameters (whose search space is way too large), but it's difficult to put that in an objective rule.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-09-08T08:15:43.367" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10029" PostTypeId="1" AcceptedAnswerId="10034" CreationDate="2016-09-08T13:24:56.147" Score="4" ViewCount="490" Body="&lt;p&gt;For some kolmo questions, I use the golfing algorithms created for the challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55384/golfing-strings-in-fourier&quot;&gt;Golfing Strings in Fourier&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this okay to do? Does this constitute as cheating?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/55857/print-this-question-%e2%86%93/55879#55879&quot;&gt;Print This Question ↓&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/92657/count-to-100-in-danish/92706#92706&quot;&gt;Count to 100 in Danish&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-09-08T19:21:23.870" Title="Auto-Golfing: Good or Bad?" Tags="|discussion|code-golf|kolmogorov-complexity|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10030" PostTypeId="2" ParentId="10029" CreationDate="2016-09-08T13:36:24.957" Score="1" Body="&lt;p&gt;If you can do that and get competitive solutions, it's a sign that the question should be closed as a duplicate of a standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; question (probably the &lt;a href=&quot;https://codegolf.stackexchange.com/q/6043/194&quot;&gt;rickroll&lt;/a&gt;) because it isn't adding anything new to the site.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-09-08T13:36:24.957" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10031" PostTypeId="2" ParentId="2140" CreationDate="2016-09-08T13:45:19.453" Score="-3" Body="&lt;h1&gt;Draw &quot;Stack Exchange&quot;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Stack Exchange has many site (159) and It has a logotype too.&#xA;Anyway, In this challenge you'll need to draw &lt;strong&gt;Stack Exchange&lt;/strong&gt; in the most shortest way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a code-golf. challenge.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Have fun!&lt;/li&gt;&#xA;&lt;li&gt;You've to draw Stack Exchange, you can't use Paint or something like that, you can't use libraries.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="59371" LastEditorUserId="59371" LastEditDate="2016-09-08T14:01:01.293" LastActivityDate="2016-09-08T14:01:01.293" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10032" PostTypeId="2" ParentId="2140" CreationDate="2016-09-08T15:01:52.710" Score="0" Body="&lt;p&gt;&lt;strong&gt;Find all paths in a matrix maze.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A maze is represented as a two-dimensional array of 0s and 1s. Zero indicates a closed door and one indicates an open door. An example representation of maze is given below.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0100&#xA;0010&#xA;1101&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;to avoid loops input square matrix should not contain a square of once like&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;111      11&#xA;101  or  11&#xA;111&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Write an application either in Java,C,C++,Python,C# or Javascript. It takes as input a maze(mxn array) and prints out all the possible ways out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;• No database should be used.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;• Yes...Way out is any edge containing 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;• Enter from any edges of the maze&lt;/p&gt;&#xA;&#xA;&lt;p&gt;• Exit from any edges of the maze&lt;/p&gt;&#xA;&#xA;&lt;p&gt;• Should not enter and exit from the same door&lt;/p&gt;&#xA;&#xA;&lt;p&gt;• Move can be one unit distance either top/bottom/left/right/diagonal&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the above maze, one possible way out is: &lt;code&gt;[0,1] -&amp;gt; [1,2] -&amp;gt; [2,3]&lt;/code&gt; i.e you start at &lt;code&gt;[0,1]&lt;/code&gt; and then move to &lt;code&gt;[1,2]&lt;/code&gt; and then to &lt;code&gt;[2,3]&lt;/code&gt;. There are other possible ways as you can see.&lt;/p&gt;&#xA;" OwnerUserId="26646" LastEditorUserId="26646" LastEditDate="2016-09-08T16:07:23.887" LastActivityDate="2016-09-08T16:07:23.887" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10033" PostTypeId="2" ParentId="1061" CreationDate="2016-09-08T17:02:11.820" Score="32" Body="&lt;h1&gt;Improper quines&lt;/h1&gt;&#xA;&lt;p&gt;We've reached consensus on what counts as a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/4877/12012&quot;&gt;proper quine&lt;/a&gt; over a year ago, yet the occasional &amp;quot;quine&amp;quot; that consists of nothing more than literals and/or NOPs still comes up.&lt;/p&gt;&#xA;&lt;p&gt;While these answers used to be tolerated (and, on occasions, applauded) unless the challenge specifically asked for a &lt;em&gt;proper&lt;/em&gt; quine, the community has recently started to downvote and/or delete improper quines even if the challenge didn't explicitly disallow them.&lt;/p&gt;&#xA;&lt;p&gt;This course of action is a sane default; almost all quine-related challenges are rendered trivial if the program &lt;code&gt;1&lt;/code&gt; is deemed quine enough for a submission. To back these actions with community consensus, I therefore propose the following.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;If the challenge asks for quines and its spec doesn't explicitly allow improper quines, all submissions have to be &lt;em&gt;proper&lt;/em&gt; quines.&lt;/p&gt;&#xA;&lt;p&gt;If the challenge mentions quines and/or is tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;, a program that would count as an improper quine (if its output matched its source code) is likewise disallowed.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-08T17:02:11.820" CommentCount="2" CommunityOwnedDate="2016-09-08T17:02:11.820" ContentLicense="CC BY-SA 3.0" />
  <row Id="10034" PostTypeId="2" ParentId="10029" CreationDate="2016-09-08T19:21:23.870" Score="14" Body="&lt;p&gt;I don't think these answers are &lt;em&gt;cheating&lt;/em&gt;, exactly. I don't believe they break any current site rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That being said, I'll probably downvote them when I see them. They're just not interesting or useful to the site in my opinion. The program that &lt;em&gt;generates&lt;/em&gt; it might be interesting (and indeed, I upvoted issacg's program when he posted it), but I don't think that extends to the output itself. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, this applies to the straight &quot;copy/paste&quot; answers. If all you did was copy the desired output into a script and paste the output as an answer, I don't want to reward that with rep. If you're manually golfing it before or after running the script and making tweaks to optimize it, that's a different story. If that's the case, &lt;em&gt;say that&lt;/em&gt; in the post. &lt;/p&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2016-09-08T19:21:23.870" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10035" PostTypeId="2" ParentId="2140" CreationDate="2016-09-08T21:25:58.563" Score="7" Body="&lt;h1&gt;Natural Pi - The Front Nine W.I.P.&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;## Meta ## &#xA;    - 4 more ways to calculate pi with nature?&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;These challenges are simulations of algorithms that only require nature and your brain (and maybe some re-usable resources) to approximate Pi. If you really need Pi during the zombie apocalypse, these methods don't &lt;a href=&quot;https://medium.com/the-physics-arxiv-blog/how-mathematicians-used-a-pump-action-shotgun-to-estimate-pi-c1eb776193ef#.eld2u7w76&quot; rel=&quot;nofollow noreferrer&quot;&gt;waste ammo&lt;/a&gt;! There are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10035/43214&quot;&gt;nine challenges&lt;/a&gt; total.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each challenge will give an algorithm for approximating Pi with nature. Then it will walk through how the computer simulation should work. Next comes the Specification to clear up details and finally there are some test cases.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/95231/43214&quot;&gt;Natural Pi #0 - Rock&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Coprime Probability&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/96275/43214&quot;&gt;Natural Pi #1 - Sand&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Buffon's Needle&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/104655/43214&quot;&gt;Natural Pi #2 - River&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Curvy-ness of a River&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Natural Pi #3 - Books&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;E's in a circle&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Natural Pi #4 - Sun Flower&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Ratio of Area to Diameter&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Natural Pi #5 - Vine&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Period of a Pendulum&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Natural Pi #6 - Fire&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Ratio of Circumference to Diameter&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pi&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pi&amp;#39;&quot; rel=&quot;tag&quot;&gt;pi&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43214" LastEditorUserId="43214" LastEditDate="2017-06-05T00:17:05.230" LastActivityDate="2017-06-05T00:17:05.230" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="10037" PostTypeId="1" CreationDate="2016-09-09T15:44:33.010" Score="7" ViewCount="243" Body="&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/a/92744/34718&quot;&gt;this answer&lt;/a&gt; using Python's &lt;a href=&quot;https://docs.python.org/2/library/turtle.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;turtle&lt;/code&gt;&lt;/a&gt; module, I discovered that some default settings for the turtles are set in a configuration file called &lt;a href=&quot;https://docs.python.org/2/library/turtle.html#how-to-configure-screen-and-turtles&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;turtle.cfg&lt;/code&gt;&lt;/a&gt;, which is read at &lt;strong&gt;import time&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can I change this as part of my program, and how would the changes be scored in bytes, if at all?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Example: I could change a default color value from &lt;code&gt;black&lt;/code&gt; to &lt;code&gt;&quot;&quot;&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-09-09T18:24:26.420" Title="Bytes for changing a configuration file before running a program?" Tags="|discussion|scoring|" AnswerCount="1" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="10041" PostTypeId="2" ParentId="10037" CreationDate="2016-09-09T18:24:26.420" Score="11" Body="&lt;p&gt;On PPCG, languages are defined by their implementation. This &lt;em&gt;includes&lt;/em&gt; any configuration files. Therefore, if you edit your local configuration files, you are essentially creating a new unpublished implementation of an existing language. Now, if you were to significantly edit your configuration files, and &lt;em&gt;publish&lt;/em&gt; them somewhere, you have essentially created a golfing library, which is allowed (although generally disliked, but that's beside the point).&lt;/p&gt;&#xA;&lt;p&gt;If we allow editing of configuration files, I see no reason to stop there. We can edit source code of the interpreter too! No matter what scoring method you use, it just seems to me like opening a huge can of worms. It paves the way for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10037/bytes-for-changing-a-configuration-file-before-running-a-program/10038?noredirect=1#comment31930_10038&quot;&gt;MetaConfigScript&lt;/a&gt;, makes scoring more confusing, bogs us down in &lt;em&gt;even more&lt;/em&gt; rules, and makes testing significantly harder. So here is my proposal:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;If your solution runs with &lt;em&gt;any&lt;/em&gt; fresh install of the language you are using, your solution is valid. Otherwise, your answer is basically just a &lt;a href=&quot;https://blog.codinghorror.com/the-works-on-my-machine-certification-program/&quot; rel=&quot;nofollow noreferrer&quot;&gt;it works on my machine!&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If your solution requires one very specific install of the language you are using, this is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5852/31716&quot;&gt;perfectly fine&lt;/a&gt;, but please specify this in your answer.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I think this is a reasonable default because it keeps testing as simple as possible, and it fits with our rule of &amp;quot;languages are defined by their implementation&amp;quot;. Presumably any language that might benefit from tweaking defaults would also have a way to edit that behavior &lt;em&gt;inside&lt;/em&gt; of your solution, and however many bytes of boilerplate that takes is a reasonable byte handicap.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-09T18:24:26.420" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10042" PostTypeId="2" ParentId="2140" CreationDate="2016-09-09T21:09:53.733" Score="5" Body="&lt;h1&gt;Flexagonal datastructures&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Being programmers, watching us flex aren't very interesting. Today we change that! In this challenge you will lex and flex hexaflexagons.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;About&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For a video introduction, watch &lt;a href=&quot;https://youtu.be/VIVIegSt81k&quot; rel=&quot;nofollow noreferrer&quot;&gt;viharts video(s) on flexagons&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A flexagon is a shape that you can flex to reveal faces other than the top and bottom one; we are making a hexahexaflexagon, which has 6 faces. See the image below on how to fold a hexahexaflexagon out of a strip of paper.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/kddCM.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/kddCM.gif&quot; alt=&quot;hexahexaflexagon construction&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;A&lt;/code&gt; shows both sides of the strip. The two white triangles are glued together.&#xA;This is how you would flex it:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/wcOz8.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/wcOz8.gif&quot; alt=&quot;flexing the flexagon&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Below is a diagram of possible states and their relationships:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/1aWn3.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/1aWn3.png&quot; alt=&quot;Diagram v6&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The colored circles represent the 6 triangles with the same number from the first image. Each of the circes have two colors- the bottom most represent the back face (what you would see if you where to flip your flexagon around), which you don't have to consider in this challenge.&#xA;&lt;br&gt;&lt;br&gt;&#xA;The gray circles represent how you can flex your flexagon in any given state: there are 4 different ways to flex it, we call these &lt;code&gt;Left&lt;/code&gt;, &lt;code&gt;Right&lt;/code&gt;, &lt;code&gt;Up&lt;/code&gt; and &lt;code&gt;Down&lt;/code&gt;. You don't actually flex in these directions, the important bit is that some are opposite to each other.&#xA;&lt;br&gt;&#xA;If you are in the center you can use &lt;code&gt;Left&lt;/code&gt; and &lt;code&gt;Right&lt;/code&gt; to go to the other center ones. To get out of the center you use &lt;code&gt;Up&lt;/code&gt; and &lt;code&gt;Down&lt;/code&gt;. If you aren't in the center you cannot use &lt;code&gt;Left&lt;/code&gt; or &lt;code&gt;Right&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Left/Down = clockwise&#xA;Right/Up  = anti-clockwise&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Create a function or program that take as input what should be on the 18 front faces and the 18 back faces of a flexagon, a sequence of left, right, up and down flexes, and return the 8 visible faces after the flexes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example computation:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;flex &quot;hexaflexaperplexia&quot; &#xA;     &quot;flexagationdevices&quot; &#xA;     [Right, Right, Left]&#xA;&#xA;Divide a strip of paper into 19 triangles:&#xA;1/2\3/1\2/3\1/2\3/1\2/3\1/2\3/1\2/3   Front&#xA;4/4\5/5\6/6\4/4\5/5\6/6\4/4\5/5\6/6   Back&#xA;&#xA;Write &quot;hexaflexaperplexia&quot; to the front of the paper strip:&#xA;1/2\3/1\2/3\1/2\3/1\2/3\1/2\3/1\2/3&#xA;&#xA;hexaflexaperplexia&#xA;123123123123123123&#xA;h  a  e  p  p  x     Face 1, Initially the front face&#xA; e  f  x  e  l  i    Face 2, Initially the back face&#xA;  x  l  a  r  e  a   Face 3, Initially hidden&#xA;&#xA;&#xA;Write &quot;flexagationdevices&quot; to the back of the paperstrip:&#xA;4/4\5/5\6/6\4/4\5/5\6/6\4/4\5/5\6/6&#xA;&#xA;flexagationdevices&#xA;445566445566445566&#xA;fl    at    ev       Face 4, up from 3&#xA;  ex    io    ic     Face 5, up from 2&#xA;    ag    nd    es   Face 6, up from 1&#xA;&#xA;&#xA;Flex it [Right, Right, Left]&#xA;  The initial visible face is 1: &quot;haeppx&quot;&#xA;  flexing Right ..&#xA;  The current visible face is 2: &quot;efxeli&quot;&#xA;  flexing Right ..&#xA;  The current visible face is 3: &quot;xlarea&quot;&#xA;  flexing Left ..&#xA;  The current visible face is 2: &quot;efxeli&quot;&#xA;  flexed [Right, Right, Left]!&#xA;&#xA;outputting &quot;efxeli&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Example input and expected output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; hexaflexaperplexia flexagationdevices RRL&#xA;= efxeli&#xA;&#xA;&amp;gt; loremipsumdolorsit hexaflexamexicania LUU&#xA;= riuort&#xA;&#xA;&amp;gt; abcdefghijklmnopqr stuvwxyz1234567890 UL&#xA;= I can't flex that way :(&#xA;&#xA;&amp;gt; abcdefghijklmnopqr stuvwxyz1234567890 RRRRLLUDDUUUULDD&#xA;= uv1278&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may take input and return output in any reasonable way&lt;/li&gt;&#xA;&lt;li&gt;If the input is impossible, you should indicate so in some way that is distinct from regular output&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;code&gt;Codegolf&lt;/code&gt;. Shortest code in bytes win.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="43037" LastEditorUserId="43037" LastEditDate="2016-09-14T22:57:36.517" LastActivityDate="2016-09-14T22:57:36.517" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10043" PostTypeId="2" ParentId="209" CreationDate="2016-09-09T22:37:20.467" Score="1" Body="&lt;p&gt;I can only support a suggestion that we default to an Culture Invariant locale for the simple reason that these are guaranteed not to change. It could become jolly difficult to test old answers if the local they depend on changes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For .NET this would be &lt;a href=&quot;https://msdn.microsoft.com/en-us/library/system.globalization.cultureinfo.invariantculture%28v=vs.110%29.aspx&quot; rel=&quot;nofollow&quot;&gt;https://msdn.microsoft.com/en-us/library/system.globalization.cultureinfo.invariantculture%28v=vs.110%29.aspx&lt;/a&gt; which I presume corresponds to the &quot;C&quot; locale mentioned else where.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've also seen some concerns in some languages with locale implementations on different OS', so even if they aren't changing they may be a pain to test on different systems. Hopefully everyone can make their Culture Invariant locales correct.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As stated prior, this is pretty much &quot;en-US&quot;, so most everyone will comply without even realising.&lt;/p&gt;&#xA;" OwnerUserId="26981" LastActivityDate="2016-09-09T22:37:20.467" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10044" PostTypeId="2" ParentId="209" CreationDate="2016-09-09T22:45:01.457" Score="1" Body="&lt;p&gt;As long as it works in some locale, and you specify the locale, it's fine. This is parallel to our rule about &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5851/45941&quot;&gt;compiler-specific solutions&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-09-09T22:45:01.457" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10046" PostTypeId="1" CreationDate="2016-09-10T04:18:42.373" Score="3" ViewCount="122" Body="&lt;p&gt;After posting a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/91999/print-foo-100000-times-with-many-constraints&quot;&gt;rather specific, narrow, restrictive, one-language (well... one group of languages:  POSIX-ey shells) puzzle&lt;/a&gt;, thats been &quot;closed as too broad&quot;, commentators then offered explanations inconsistent with the notion of &quot;too broad&quot;:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;&quot;challenges that are restricted to one language are usually frowned upon.&quot;&lt;/em&gt;  Which seems to imply the puzzle was &lt;em&gt;not broad enough&lt;/em&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;&quot;a do X without Y challenge that is also frowned upon - why shouldn't I be allowed to use language Z?&quot;&lt;/em&gt;  This also seems to imply the puzzle was &lt;em&gt;not broad enough&lt;/em&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;&quot;The default close reasons are set SE-wide and we can't rewrite then, so we make do even when they don't totally fit.&quot;&lt;/em&gt;  Apparently at least one user feels the close reasons themselves are too broad, and closers are compelled to apply them &lt;em&gt;too broadly&lt;/em&gt; -- presumably the closees are therefore expected to somehow infer (or guess) at the &lt;em&gt;narrower reasons&lt;/em&gt; the closers should have given if &lt;em&gt;only&lt;/em&gt; they could.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;So assuming the above results are not anomalous, the question is:  what has this usage &lt;em&gt;&quot;too broad&quot;&lt;/em&gt; come to mean here, not literally as written, but in actual practice?&lt;/p&gt;&#xA;" OwnerUserId="53016" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-09-10T06:58:36.950" Title="&quot;Too broad&quot; close reason applied to &quot;restricted source&quot; puzzle" Tags="|discussion|close-reasons|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10047" PostTypeId="2" ParentId="10046" CreationDate="2016-09-10T04:31:47.543" Score="4" Body="&lt;p&gt;A hard-and-fast rule of the site is that challenges &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;must have an objective winning criterion&lt;/a&gt;. As far as I can tell, your challenge doesn't have one. Oddly, none of the commenters mentioned that, but this is a plausible close reason for which &quot;Too broad&quot; may be seen as the nearest approximation.&lt;/p&gt;&#xA;" OwnerUserId="30688" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-09-10T04:31:47.543" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10048" PostTypeId="2" ParentId="2140" CreationDate="2016-09-10T06:49:44.093" Score="6" Body="&lt;h1&gt;There can be only &lt;code&gt;1&lt;/code&gt;!&lt;/h1&gt;&#xA;&lt;p&gt;Your task is, given a positive integer &lt;code&gt;n&lt;/code&gt;, to generate an expression that equals to the number &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The catch is: you're only allowed the number &lt;code&gt;1&lt;/code&gt; in the output.&lt;/p&gt;&#xA;&lt;p&gt;The operators at your disposal are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;+&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;, &lt;code&gt;*&lt;/code&gt; and &lt;code&gt;/&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;sqrt&lt;/code&gt; (as &lt;code&gt;s&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ceil&lt;/code&gt; and &lt;code&gt;floor&lt;/code&gt; (as &lt;code&gt;c&lt;/code&gt; and &lt;code&gt;f&lt;/code&gt; respectively)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;!&lt;/code&gt; (factorial)&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The factorial, in this case, only works for positive integers.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You are also allowed to stack &lt;code&gt;1&lt;/code&gt;'s together, so something like &lt;code&gt;11&lt;/code&gt; is acceptable in the output. However, they count as the same amount of &lt;code&gt;1&lt;/code&gt;'s that's in the number (so &lt;code&gt;11&lt;/code&gt; counts as 2 &lt;code&gt;1&lt;/code&gt;'s).&lt;/p&gt;&#xA;&lt;p&gt;You must also include brackets in the output, so that the expression in the output, when executed through the order of operations, will result in the input.&lt;/p&gt;&#xA;&lt;h2&gt;Examples:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input = 24, one possible output = &lt;code&gt;(1+1+1+1)!&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Input = 11, one possible output = &lt;code&gt;11&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Input = 5, one possible output = &lt;code&gt;c(s((1+1+1+1)!))&lt;/code&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The ceiling of the square root of &lt;code&gt;24&lt;/code&gt; is &lt;code&gt;5&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You are guaranteed that the input is a positive integer from &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;2^31-1&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Your program must work for any positive integer up to &lt;code&gt;2^31-1&lt;/code&gt;, even if they are not tested.&lt;/li&gt;&#xA;&lt;li&gt;Your program must finish processing all outputs for all numbers in the set in 1 hour.&lt;/li&gt;&#xA;&lt;li&gt;The results for every run of the program must be exactly the same - also, no seeds.&lt;/li&gt;&#xA;&lt;li&gt;You are not allowed to have imaginary numbers anywhere in the output (so no &lt;code&gt;s(some negative number)&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;You are also not allowed to have numbers larger than &lt;code&gt;2^31-1&lt;/code&gt; anywhere in the output, even when they are &lt;code&gt;sqrt&lt;/code&gt;ed or &lt;code&gt;/&lt;/code&gt;ed (so no &lt;code&gt;(((1+1+1)!)!)!&lt;/code&gt; or &lt;code&gt;((1+1+1+1)!)!&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Set of Numbers:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;945536, 16878234, 32608778, 42017515, 48950830, 51483452, 52970263, 54278649, 63636656, 78817406, 89918907, 90757642, 95364861, 102706605, 113965374, 122448605, 126594161, 148064959, 150735075, 154382918, 172057472, 192280850, 194713795, 207721209, 220946392, 225230299, 227043979, 241011012, 248906099, 249796314, 250546528, 258452706, 276862988, 277140688, 280158490, 286074562, 308946627, 310972897, 322612091, 324445400, 336060042, 346729632, 349428326, 352769482, 363039453, 363851029, 392168304, 401975104, 407890409, 407971913, 425780757, 459441559, 465592122, 475898732, 482826596, 484263150, 506235403, 548951531, 554295842, 580536366, 587051904, 588265985, 588298051, 590968352, 601194306, 607771869, 618578932, 626776380, 667919873, 681786366, 689854904, 692055400, 697665495, 711608194, 734027104, 750869335, 757710567, 759967747, 777616154, 830071127, 833809927, 835873060, 836438554, 836945593, 863728236, 864158514, 871273503, 881615667, 891619600, 897181691, 918159061, 920521050, 924502226, 929983535, 943162304, 950210939, 950214176, 962610357, 974842859, 988572832&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(These are 100 random numbers from 1 to 1 billion.)&lt;/p&gt;&#xA;&lt;h2&gt;Scoring System:&lt;/h2&gt;&#xA;&lt;p&gt;Your score is determined like so:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program will be tested against the random numbers in the set.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must provide the output generated using the numbers random numbers in the set (either inside your answer or as a pastebin link).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Your then have two &amp;quot;scores&amp;quot;: A primary score and a secondary score.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your primary score is &lt;code&gt;(no. of 1's in output)*(no. of operators in output)&lt;/code&gt;. If your primary score is the lowest, you win.&lt;/li&gt;&#xA;&lt;li&gt;Your secondary score is your byte-count, and is only used in the case of a tie-breaker - the person with the lowest byte-count wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Meta:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Anything that I need to clear up?&lt;/li&gt;&#xA;&lt;li&gt;Is this challenge a dupe?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-11T12:26:32.950" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10049" PostTypeId="2" ParentId="10046" CreationDate="2016-09-10T06:58:36.950" Score="6" Body="&lt;p&gt;First off, I'm sorry that your first contribution to our site was so poorly received. I hope this doesn't discourage from posting more challenges. Writing good challenges is really hard, especially for users who are unfamiliar with our rules and culture. But, they are extremely important for the health of this community, and something I personally enjoy doing very much! If you do decide to write more challenges, the best tip I can give you is to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;use the sandbox!&lt;/a&gt; It's an invaluable tool for ironing the bugs out of your challenge before it can be downvoted and/or close-voted.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;You are absolutely right. Your challenge got closed for the wrong reasons. Absolutely nothing about your challenge says &quot;Too Broad&quot; to me. For what it's worth, many users noticed that the wrong close reason was given, and complained (&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/32067807#32067807&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/32067811#32067811&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/91999/print-foo-100000-times-with-many-constraints#comment224124_91999&quot;&gt;3&lt;/a&gt;). &lt;em&gt;However&lt;/em&gt;, &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The challenge &lt;em&gt;should&lt;/em&gt; have been closed, and&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Now that it is closed, it's not worth the effort to have 4 people re-open it and then another 4 people re close it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The unfortunate reality is that we are a challenge site, stuck in the body of a question and answer site. The reasons a &lt;em&gt;question&lt;/em&gt; can be closed are fairly straightforward and cover most of the bases. But there are &lt;em&gt;many many&lt;/em&gt; reasons a challenge should be closed. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9022/unspoken-challenge-rules&quot;&gt;I've certainly complained about this before.&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This isn't the solution I'd like to hear, but the truth is that there will never be enough close-reasons to cover the various reasons that a challenge should be closed. Because of this, I don't think it would be that bad if a couple challenges have the wrong closing text on them. This isn't ideal, but it's the best we can do with the close-reasons we've been given.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why do I say your challenge is low-quality? Nearly every rule in your challenge is either unclear or something that is heavily discouraged for writing challenges.&#xA;Here's a list of things that stand out to me as I look at it. I don't want this to come across as mean, I'm just hopefully able to explain where the close-votes and most of the downvotes come from.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It's language specific, which, as you already know, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8058/31716&quot;&gt;is heavily discouraged&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;No numbers (in any base) in any of the code.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The &quot;No numbers&quot; rule is fine, but what does &quot;in any base&quot; mean? Does that mean I can't use a string and convert it to a number? Does this mean I can't use the length of a string (which is arguable in unary)?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;No sed, awk, or external scripting languages.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;What?? But you said &lt;code&gt;Using shell script and standard nix tools&lt;/code&gt;. Nearly everything in bash and nix tools is an external binary. Obviously, there is a distinction between &lt;code&gt;ls&lt;/code&gt; and &lt;code&gt;sed&lt;/code&gt;, but they are both external programs. This doesn't make it entirely clear where to draw the line. I'm pretty sure I could use &lt;code&gt;cat&lt;/code&gt; and &lt;code&gt;echo&lt;/code&gt;, but can I use &lt;code&gt;grep&lt;/code&gt;? Could I &lt;code&gt;cat&lt;/code&gt; some text into a file, and build it with &lt;code&gt;gcc&lt;/code&gt;? Could I do it in a vi session?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;No more than 120 bytes of code, but shorter isn't necessarily better, it shouldn't tax the CPU.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Limiting answers to code with 120 or less bytes is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8928/31716&quot;&gt;discouraged&lt;/a&gt;, and &quot;recommend features&quot; (short code, not taxing the CPU) is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8066/31716&quot;&gt;also discouraged&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;Bonus I: the same, POSIX compatible (no-bashisms).&#xA;  Bonus II: as a one-liner, with one semicolon at most.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;How can I easily determine if it's POSIX compatible? How large are the bonuses? &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;But here is the biggest problem with your challenge: &lt;strong&gt;You never specified who wins!&lt;/strong&gt; Is it the shortest program? The first one? The one with the most votes? Whichever one you feel like? I find it kinda odd that none of the close voters even mentioned this, when that alone is enough reason to close a challenge, all else considered.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So in my opinion, &quot;Too broad&quot; was definitely the wrong reason to close your challenge. It should have been &quot;Unclear what you're asking&quot; or &quot;Questions without an objective primary winning criterion are off-topic, as they make it impossible to indisputably decide which entry should win.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, do we expect every single user to read through that entire thread of things to avoid on your challenge? No, that's crazy. There's like 30 answers on that thread! But the best advice I could give you on your challenge is to focus less on what the program should &lt;em&gt;consist of&lt;/em&gt;, and more on what the program should &lt;em&gt;accomplish&lt;/em&gt;. For example, a much better version of your challenge would be&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Write a program in any language that prints the text &quot;foo&quot; 100000 times without any digits (characters [0-9]) appearing in your source code. Each &quot;foo&quot; should be on its own line. The shortest answer, scored in bytes, wins!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Now, I'm not going to say that would be an &lt;em&gt;incredibly perfect&lt;/em&gt; challenge, with hundreds of upvotes, but it would be acceptable, and would fix most of the problems that have been pointed out to you. (Also, FWIW, I challenged &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/32067368#32067368&quot;&gt;myself to do exactly that&lt;/a&gt; and then spent an hour working on a solution. I had a blast!)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And above all else, use the sandbox!&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-09-10T06:58:36.950" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10055" PostTypeId="2" ParentId="2140" CreationDate="2016-09-11T18:34:26.437" Score="0" Body="&lt;h1&gt;Auto golf a string&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your objective is to make a program (written in a language of your choice) that takes arbitrary strings as input and outputs a program in a constant target language that, when run, prints that string. The original program does not have to be golfed, but the output programs should be in some way optimal or nearly optimal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Voters are encouraged to keep the following points in mind when voting:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;How difficult is the target language to program in? Is it on par with languages such as &lt;a href=&quot;http://esolangs.org/wiki/Brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brainfuck&lt;/a&gt; and &lt;a href=&quot;http://web.archive.org/web/20150623025348/http://compsoc.dur.ac.uk/whitespace/&quot; rel=&quot;nofollow noreferrer&quot;&gt;whitespace&lt;/a&gt;, or is it something trivial, like Python or Ruby?&lt;/li&gt;&#xA;&lt;li&gt;How efficient is the golfer? That is, how does it compare to any existent auto string golfers? And how does it compare to hand-golfing?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Okay, so this isn't our usual type of challenge, but I think this could really turn out well. However, I think this is underspecified as it is, and would appreciate feedback.&lt;/p&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2016-09-11T18:34:26.437" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10058" PostTypeId="2" ParentId="2140" CreationDate="2016-09-12T08:11:06.867" Score="0" Body="&lt;h1&gt;Balanced use of the alphabet&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program that counts from 1 to 100 and back down and ends by the sentence &quot;I finished counting&quot;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;1, 2, 3, ... 97, 98, 99, 100, 99, 98, 97, ... 3, 2, 1, I finished counting&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output can be of any kind: array, comma separated, line separated, ...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In order to do that, your code reviewer (who has a wierd OCD) won't accept code that doesn't contain the same amount of each letters of the alphabet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;He also doesn't accept code with no letter at all because, you know... letters are cool.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your score will be &lt;code&gt;codeLength * (mostRepresentedLetter / leastRepresentedLetter)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example of scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(Bad) code:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;for(int i=1;i&amp;lt;=100;i++){abcdefghijklmnopqrstuvwxyz();}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Length: 39&lt;br&gt;&#xA;Most represented letter: i (5 times)&lt;br&gt;&#xA;Least represented letter: a (once)&lt;br&gt;&#xA;Score: 39 * 5 / 1 = &lt;strong&gt;195&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;NOTE: if a letter is not at all present, divding something by zero will make an inifinite score. As this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, it is not something you want.&lt;/p&gt;&#xA;" OwnerUserId="7684" LastActivityDate="2016-09-12T08:11:06.867" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10060" PostTypeId="2" ParentId="2140" CreationDate="2016-09-12T12:34:22.557" Score="0" Body="&lt;h2&gt;Validate the traversals&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given inorder and preorder traversals of a binary tree, return a truthy or falsy value depending on whether they could be from the same tree.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input can be strings of characters or arrays of characters or numbers, whatever is the most convenient. You can assume both inputs are the same length.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;inorder: A&#xA;preorder: A&#xA;result: true&#xA;example:&#xA;A&#xA;&#xA;inorder: AB&#xA;preorder: AB&#xA;result: true&#xA;example:&#xA;A&#xA; \&#xA;  B&#xA;&#xA;inorder: AB&#xA;preorder: BA&#xA;result: true&#xA;example:&#xA;  B&#xA; /&#xA;A&#xA;&#xA;inorder: ABC&#xA;preorder: BCA&#xA;result: false&#xA;possible inorder trees:&#xA;    C   C   B   A   A&#xA;   /   /   / \   \   \&#xA;  B   A   A   C   C   B&#xA; /     \         /     \&#xA;A       B       B       C&#xA; CBA  CAB  BAC  ACB  ABC&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest solution wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2016-09-12T12:34:22.557" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10064" PostTypeId="2" ParentId="8047" CreationDate="2016-09-13T07:24:42.760" Score="4" Body="&lt;h2&gt;Pure programming puzzles&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Despite our name, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot;&gt;programming puzzles&lt;/a&gt; aren't generally welcome here. I'm talking about challenges where you're given a task with some impossible-seeming restrictions and must use some clever trick or language feature to solve it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Programming puzzles are closed most of ther time for not having an &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;objective winning criterion&lt;/a&gt;: something that lets you compare submissions to decide a winner. A criterion for a valid solution is not enough -- others need to be able to do better and beat the solution. You could say the first valid solution wins, but some people find it unsatisfying that someone else can win before they even see the challenge. It's better when more people can participate in and enjoy a challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it makes sense for your challenge, you can say the shortest solution wins (code golf) or have some other metric. This is best for puzzles that can be solved by more than one method, so the search for better methods can be interesting. Beware that once someone posts a solution to the puzzle, others can see it and copy the key idea with a better-scoring implementation.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-09-13T17:00:46.140" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10066" PostTypeId="2" ParentId="6918" CreationDate="2016-09-13T08:14:02.693" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/Destructible-Watermelon/Woefully&quot; rel=&quot;nofollow noreferrer&quot;&gt;Woefully&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Woefully is a 2d language. It is named Woefully, because everyone knows that adverbs are the best language names, and also because the byte counts will be saddening. Example:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Woefully, 1000 bytes&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;or something like that.&lt;/p&gt;&#xA;&lt;p&gt;Woefully works rather differently than most programming languages, and even 2d programming languages. It originates from ideas coming from whitespace, and ideas from 2d languages, as well as, initially, hiding messages in text. the last one, because originally it was going to have letters and other characters to complement spaces, but then I changed my idea. It is based on typographical rivers.&lt;/p&gt;&#xA;&lt;h2&gt;How it works&lt;/h2&gt;&#xA;&lt;p&gt;As I said, this language is different, it is very different to befunge or anything else. Unless it is. In which case I would be a little disappointed my brain keeps coming up with already used ideas.&lt;/p&gt;&#xA;&lt;p&gt;Woefully uses lines of spaces as its commands.&#xA;Not this kind of line of spaces,&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;|     |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;this kind&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;| |&#xA;| |&#xA;| |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;specifically, this command is the A to B command, which moves a value on stack A to stack B.&lt;/p&gt;&#xA;&lt;p&gt;As I mentioned, there are two stacks, stack A and stack B. Almost all commands that push values push to A, except dupe, and the command specifically for pushing to stack B (A to B).&lt;/p&gt;&#xA;&lt;p&gt;Different types of lines execute different commands:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;||| |  push operations&#xA;|| |&#xA;| |&#xA;&#xA;| |&#xA;| | stack operations&#xA;| |&#xA;&#xA;| |&#xA;|| |  Other stuff like i/o, and the stuff used as control flow&#xA;||| |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The specific command of a type of command is determined by it's length.&lt;/p&gt;&#xA;&lt;p&gt;Push is simply push length of the push command - 3, the other two types are taken from a table, after subtracting two, and modulo'ing&lt;/p&gt;&#xA;&lt;p&gt;Commands get concatenated together:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;|||| |&#xA;||| |&#xA;|| |&#xA;| |&#xA;|| |&#xA;|| |&#xA;|| |&#xA;|| |&#xA;|| |&#xA;|| |    (this program prints 1 a bunch, and puts a bunch of ones on the second stack)&#xA;||| |&#xA;|||| |&#xA;||||| |&#xA;|||||| |&#xA;||||||| |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;note that the two top commands are connected by a two long line command. two long commands are nops.&lt;/p&gt;&#xA;&lt;p&gt;this program halts&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;| |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Single length paths halt the program&lt;/p&gt;&#xA;&lt;p&gt;You can also have multiple paths (only executing a second with a special command)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;| | |&#xA;| | | (does nothing, the second isn't even executed even if it did something)&#xA;| | |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;There aren't any conditionals like in a regular programming language, except for the &amp;quot;not zero&amp;quot; command, which pops a value from stack A, pushes one if it isn't zero, and zero otherwise. if you combine this with a move command, you get control flow.&lt;/p&gt;&#xA;&lt;h3&gt;Move command&lt;/h3&gt;&#xA;&lt;p&gt;All programs without this command loop infinitely, or immediately halt&lt;/p&gt;&#xA;&lt;p&gt;This is because there are two pointers. We have the instruction pointer, which executes commands discussed before, but there is also the char pointer. The char pointer points to a char (obviously) in the program source. It begins pointing at the first char in source. When the program starts, the instruction pointer appears at the char pointer's character, finds the first space it can, moving forward (the search including the character pointed at by char pointer). It then executes the path that space is a part of, from that space. when it reaches the end of this path, it goes back to the char pointer, and does it again. The move command changes the position of the char pointer.&lt;/p&gt;&#xA;&lt;p&gt;Using the &amp;quot;not zero&amp;quot; command with the &amp;quot;move&amp;quot; command (and usually the multiply command to avoid actually excessive bytecounts (even this language has standards)), we can change the the path the program executes if a value in the stack is non-zero, and have Turing completeness. If you want to see what changing the path looks like, &lt;a href=&quot;https://codegolf.stackexchange.com/a/92377/55896&quot;&gt;the truth machine I made is probably your best bet.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="55896" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-13T08:53:26.200" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10070" PostTypeId="2" ParentId="2140" CreationDate="2016-09-13T20:30:43.043" Score="0" Body="&lt;h1&gt;Illuminati is Illuminati&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a popularity contest inspired by a dedicated scratch programmer who made the program here: &lt;a href=&quot;https://scratch.mit.edu/projects/117836320/&quot; rel=&quot;nofollow&quot;&gt;https://scratch.mit.edu/projects/117836320/&lt;/a&gt;. What the program does, is it takes in a string, and links the string to the Illuminati. This scratch program is especially popular because it demonstrates meta-satire on linking things to other things.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your job is to more or less produce something of similar function and form to the one linked above. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program can take anything as an input, however, it has to be able to take something. My suggestion is a string.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program must output a series of links that make &lt;em&gt;some&lt;/em&gt; sense, and eventually link your input to the illuminati.&lt;br&gt;&#xA;The last output of your program must be some variation of [input] + &quot; is Illuminati confirmed.&quot;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a popularity challenge. Your code isn't supposed to look great, or even execute well, so long as it has the most up votes. You must use a code that has a free compiler, and you must post your source code along with your program.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Tips and tricks:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This section will be updated, as people post suggestions in the comments.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The Illuminati music in the background could add some spiff to your program. you can download it here: &lt;a href=&quot;http://www.aiomp3.com/download.php?mp3=hAAlDoAtV7Y&quot; rel=&quot;nofollow&quot;&gt;http://www.aiomp3.com/download.php?mp3=hAAlDoAtV7Y&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Unlike what the program listed above does, there are many more links to have done besides the number of letters an a string. try looking for anagrams, or similar words.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user56309" LastActivityDate="2016-09-13T20:30:43.043" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10071" PostTypeId="1" CreationDate="2016-09-13T20:41:13.033" Score="1" ViewCount="109" Body="&lt;p&gt;I haven't seen it done myself, but are there any examples of people stealing other's challenges off the sandbox to use themselves?&#xA;what happened to those questions/users?&lt;/p&gt;&#xA;" OwnerDisplayName="user56309" LastEditorUserId="31716" LastEditDate="2016-09-13T20:46:40.083" LastActivityDate="2016-09-14T20:07:18.267" Title="Are there any repercussions for stealing Ideas off the sandbox?" Tags="|discussion|sandbox|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10073" PostTypeId="2" ParentId="2140" CreationDate="2016-09-14T01:21:59.030" Score="0" Body="&lt;h1&gt;Pitchers and Rivers&lt;/h1&gt;&#xA;&lt;p&gt;Credit for the idea for this challenge goes to Dan Garcia of UC Berkeley.&lt;/p&gt;&#xA;&lt;p&gt;Many of you may have heard of any number of variations on the &lt;a href=&quot;https://people.eecs.berkeley.edu/%7Ebh/pdf/v1ch14.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;pitcher problem&lt;/a&gt;.  For those who haven't, or need a refresher, the generalized form of the pitcher problem is as follows:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Given a list of pitchers of known size and a river filled with infinite water, how can you obtain a specific amount of water?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;For a more specific example:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Given a 3-liter pitcher, a 7-liter pitcher, and a river, you can obtain exactly 2 liters as follows:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Fill the 3-liter pitcher.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Pour the 3-liter pitcher into the 7-liter pitcher.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Repeat steps 1 and 2 again twice.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you didn't spill any extra water when filling the 7-liter pitcher the third time, the 3-liter pitcher will now contain 2 liters.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;You cannot pour out part of the pitcher unless you can measure how much you poured out by filling something else up, e.g. another pitcher.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Your goal, now, is to determining which amounts of water you can get from your pitchers, given their sizes... but generalized to any number of pitchers.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;You will receive the pitcher sizes in any reasonable format.  A (non-exhaustive) list of examples are:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;A newline-separated list.  &lt;code&gt;5\n13\n532&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A Pythonic list. &lt;code&gt;[3,7,13,22]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Prompt for input, like BF's &lt;code&gt;.[&amp;gt;.]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;You do not have to handle invalid input (e.g. negative sizes, empty lists)&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;A list of obtainable (measurable) amounts of water, in any reasonable format. You may include 0, but you do not need to.  You do &lt;strong&gt;not&lt;/strong&gt; need to list the steps by which you obtain these quantities.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[3,5] -&amp;gt; [1,2,3,4,5,6,7,8]&#xA;&#xA;[3,3] -&amp;gt; [3,6]&#xA;&#xA;[4,6] -&amp;gt; [2,4,6,8,10]&#xA;&#xA;[7, 5, 3, 2] -&amp;gt; [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17]&#xA;&#xA;[30, 15, 5] -&amp;gt; [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50]&#xA;&#xA;[5,0] -&amp;gt; [0, 5]&#xA;&#xA;[-1] -&amp;gt; Undefined behavior; sizes are always positive &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://pyth.herokuapp.com/?code=D%25NGR%3F%3EJ%2B%40%3DYNhG%40NeGK%40QeGXXYeGKhG-JKXXYeGJhG0%29S%7BsMs.u%7Bsm_%2B%2B%2B%5Dd%25Ld.PUld2XR%3DYd_%40dkUldXR%3DYd%2B_%40dk%40QkUldN%5D&amp;amp;input=%5B16%2C+5%2C+3%5D&amp;amp;debug=0&quot; rel=&quot;nofollow noreferrer&quot;&gt;Reference solution in Pyth, barely golfed&lt;/a&gt; (100 bytes)&lt;/p&gt;&#xA;" OwnerUserId="55696" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-14T23:47:12.503" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="10076" PostTypeId="2" ParentId="2140" CreationDate="2016-09-14T13:56:26.013" Score="0" Body="&lt;h2&gt;Translate an SVG path&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An SVG path consists of a number of components. Each component begins with a letter, which may be upper case for an absolute position or lower case for a relative position. The component then has a variable number of parameters. Parameters may be separated by commas or spaces.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the purposes of this question, you will not need to support the &lt;code&gt;H&lt;/code&gt;, &lt;code&gt;L&lt;/code&gt; or &lt;code&gt;A&lt;/code&gt; commands. This means that each component accepts an even number of parameters, and that alternate parameters refer to the X and Y coordinates.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an SVG path and X and Y displacements, please output the translated path.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input and output should be in any reasonable format, as long as you are consistent, i.e. both coordinates should be in the same format, or they can use a Point type, while the output path should be in the same format as the input path.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please avoid floating-point errors e.g. adding 0.1 to 0.1 and getting 0.199996 like Inkscape does when I asked it to do this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA;6.4&#xA;6.4&#xA;M 6.4 12.8 L 19.2 25.6 l 6.4 -6.4 z&#xA;&#xA;Output:&#xA;M 12.8 19.2 L 25.6 32 l 6.4 -6.4 z&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2016-09-14T15:50:12.180" LastActivityDate="2016-09-14T15:50:12.180" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10077" PostTypeId="2" ParentId="2140" CreationDate="2016-09-14T17:25:49.247" Score="0" Body="&lt;h1&gt;Pointfree Generator -- this is a draft.... --&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;What is this?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;From Wikipedia's page:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Tacit programming, also called point-free style, is a programming paradigm &#xA;in which function definitions do not identify the arguments&#xA;(or &quot;points&quot;) on which they operate&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you will have to generate Haskell code in pointfree style. You can provide an answer in any language of your choice as long as it generates Haskell code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The functions to generate will be polynomial function of multiple variables with integer coefficients like :&#xA;&lt;code&gt;f : x,y,z -&amp;gt; x^8*y*z + 3*y + 12&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;for example, the function &lt;code&gt;f : x -&amp;gt; x² + 3x&lt;/code&gt; can be written in pointfree Haskell like this &lt;code&gt;(3*)&amp;gt;&amp;gt;=flip((+).(^2))&lt;/code&gt; or &lt;code&gt;(+3)&amp;gt;&amp;gt;=(*)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input is a list of list of coefficients and exponants :&#xA;For example, the &lt;code&gt;f : x,y,z -&amp;gt; x^8*y*z + 3*y + 12&lt;/code&gt; function will be defined as &lt;code&gt;[[1,8,1,1],[3,0,1],[12]]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;Restrictions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Haskell function/operators allowed are the following :&#xA;&lt;code&gt;(+)&lt;/code&gt;,&lt;code&gt;(-)&lt;/code&gt;,&lt;code&gt;(*)&lt;/code&gt;,&lt;code&gt;(.)&lt;/code&gt;,&lt;code&gt;(^)&lt;/code&gt;,&lt;code&gt;flip&lt;/code&gt;,&lt;code&gt;(=&amp;lt;&amp;lt;)&lt;/code&gt;,&lt;code&gt;(&amp;gt;&amp;gt;=)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Hints&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;Testing&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;" OwnerUserId="41073" LastActivityDate="2016-09-14T17:25:49.247" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10080" PostTypeId="2" ParentId="10071" CreationDate="2016-09-14T19:55:32.677" Score="5" Body="&lt;p&gt;There are a few different possible scenarios here. Here is how I would expect them to play out.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scenario 1: Didn't see it in the Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you post a challenge that is a duplicate of one already in the Sandbox, without having seen the Sandboxed challenge, technically you have done nothing wrong. It's still a good idea to include a reference to the Sandboxed challenge (to comply with &lt;a href=&quot;https://creativecommons.org/licenses/by-sa/3.0/&quot; rel=&quot;nofollow noreferrer&quot;&gt;CC-BY-SA&lt;/a&gt;'s &lt;a href=&quot;http://blog.stackoverflow.com/2009/06/attribution-required/&quot;&gt;attribution requirement&lt;/a&gt;). You will almost certainly be barraged with comments to the effect of &quot;you stole this from the Sandbox!&quot; (and possibly downvotes). Once the Sandboxed challenge is ready for posting to the main site, however, don't be surprised if your version is closed as a duplicate of the previously-Sandboxed challenge - since it went through the Sandbox, it's almost certainly going to be a better challenge.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scenario 1a: Didn't see it in the Sandbox, also posted it in the Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If this happens, then there is a fundamental failure of our Sandbox system - it's supposed to allow users time to review challenges and point out issues such as potential duplicates (either on main or also in the Sandbox). If that happened, either you didn't leave it in the Sandbox long enough, or the Sandbox has failed you. Either way, it's likely to go the same route as above (closed as a duplicate of the other challenge once it is posted to main).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scenario 2: Did see it in the Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you post a challenge to the main site that you &lt;em&gt;did&lt;/em&gt; see in the Sandbox, if you don't provide attribution, you are violating CC-BY-SA, as well as Stack Exchange's &lt;a href=&quot;https://codegolf.stackexchange.com/help/be-nice&quot;&gt;Be Nice policy&lt;/a&gt;, because the user that posted it to the Sandbox clearly intends to post it to the main site at some point, and you tried to steal that away from them. Again, expect a flood of comments and potentially downvotes, like in Scenario 1.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scenario 2a: Saw it in the Sandbox, but it was abandoned.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As Martin pointed out in the comments, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2057/8478&quot;&gt;we have a protocol for that&lt;/a&gt;. As long as you follow the protocol, you'll be fine. If you don't, as above, prepare for the deluge of comments and possibly downvotes.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;TL;DR: Search the main site &lt;em&gt;and&lt;/em&gt; the Sandbox for duplicates before posting a challenge. It's just common courtesy.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-09-14T20:07:18.267" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10081" PostTypeId="1" CreationDate="2016-09-14T21:40:34.577" Score="13" ViewCount="700" Body="&lt;p&gt;When we define a function that needs an &lt;code&gt;import&lt;/code&gt;, we have to add it to the byte count. So far, so good. What about cases where the definition itself doesn't need the import, but when you want to call/execute the function you need it, for example to construct parameters?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples can be found &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/93225/2&quot;&gt;here&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/a/77825/34531&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In both examples we have polymorphic functions that work for many different number types. The definition doesn't require any import. However, to run the function and get the result requested by the challenge you need to provide parameters of the number type &lt;code&gt;Ratio&lt;/code&gt; which can only be constructed with the &lt;code&gt;Data.Ratio&lt;/code&gt; module imported.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do we need to add the &lt;code&gt;import&lt;/code&gt; to the byte count in such cases? &lt;/p&gt;&#xA;" OwnerUserId="34531" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2019-02-04T02:48:13.927" Title="Byte count for imports (or other things) not needed for definition, but for execution" Tags="|discussion|code-golf|scoring|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10082" PostTypeId="1" AcceptedAnswerId="10084" CreationDate="2016-09-15T00:38:29.180" Score="5" ViewCount="174" Body="&lt;p&gt;I was looking at &lt;a href=&quot;https://codegolf.stackexchange.com/a/37993/48922&quot;&gt;this answer&lt;/a&gt;, and noticed that it required that the GNU Pascal compiler to &lt;em&gt;not&lt;/em&gt; be installed on the system. Is this allowed?&lt;/p&gt;&#xA;" OwnerUserId="48922" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-09-15T04:50:35.570" Title="Requiring software to not be installed" Tags="|discussion|answers|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10083" PostTypeId="2" ParentId="10082" CreationDate="2016-09-15T01:32:51.957" Score="9" Body="&lt;p&gt;I don't think we need a ruling on this. It has only come up once, for a popularity contest that asks for the &quot;most creative&quot; answer. Feel free to vote on that answer based on how legitimate you find it.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2016-09-15T01:32:51.957" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10084" PostTypeId="2" ParentId="10082" CreationDate="2016-09-15T04:50:35.570" Score="4" Body="&lt;p&gt;As long as there is some configuration of hardware+software available that can be used to reproduce the results from the submission, anything goes, even requiring certain software to be installed and certain other software to not be installed. This is parallel to our rule on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5851/45941&quot;&gt;compiler-specific submissions&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.953" LastActivityDate="2016-09-15T04:50:35.570" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10085" PostTypeId="2" ParentId="10081" CreationDate="2016-09-15T05:00:25.593" Score="20" Body="&lt;p&gt;If your function is syntactically valid without the &lt;code&gt;import&lt;/code&gt; (or similar mechanism), then it's not necessary to include the bytes for the &lt;code&gt;import&lt;/code&gt; in your byte count, even if the &lt;code&gt;import&lt;/code&gt; is needed to construct objects of the type that your function expects. Explicitly referencing the &lt;code&gt;import&lt;/code&gt;ed thing requires the &lt;code&gt;import&lt;/code&gt; being counted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are a few examples:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Acceptable&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Python&lt;/strong&gt;: &lt;code&gt;lambda a:a.tm_year&lt;/code&gt; (defines a function which expects a &lt;code&gt;struct_time&lt;/code&gt; argument and returns its &lt;code&gt;tm_year&lt;/code&gt; attribute - requires &lt;code&gt;import time&lt;/code&gt; or similar to construct the &lt;code&gt;struct_time&lt;/code&gt; object, but due to Python's duck typing, the type is not explicitly stated in the function definition, and thus doesn't require the &lt;code&gt;import&lt;/code&gt; - any object with a &lt;code&gt;tm_year&lt;/code&gt; attribute could be used)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Unacceptable&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Python&lt;/strong&gt;: &lt;code&gt;lambda a,b:re.match(a,b)&lt;/code&gt; (the &lt;code&gt;re&lt;/code&gt; module is explicitly referenced, and thus the &lt;code&gt;import re&lt;/code&gt; must be counted)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;C++&lt;/strong&gt;: &lt;code&gt;int f(std::string s){return s.length();}&lt;/code&gt; (because C++ is statically-typed, the &lt;code&gt;std::string&lt;/code&gt; class and its public interface need to be declared before they can be used, and thus the &lt;code&gt;#include &amp;lt;string&amp;gt;&lt;/code&gt; directive (or another means of declaring the class and its interface) needs to be included with the function definition)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2019-02-04T02:48:13.927" LastActivityDate="2019-02-04T02:48:13.927" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="10088" PostTypeId="1" CreationDate="2016-09-15T12:54:31.567" Score="12" ViewCount="181" Body="&lt;p&gt;In Java, all &quot;basic&quot; input types are immutable with very few tools at our disposal. Some other class that still represent the same value exist and allow us to do more.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In trying to golf Java code, I always check if &lt;code&gt;StringBuilder&lt;/code&gt;/&lt;code&gt;StringBuffer&lt;/code&gt; can help me. In this case, a &lt;code&gt;StringBuilder&lt;/code&gt; still represents the Java &lt;code&gt;String&lt;/code&gt; type. They're useful, but very verbose. Can we use them as input parameters directly?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given the following code:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;void blah(String s) {&#xA;  StringBuilder t = new StringBuilder(s);&#xA;  // do something super golfy&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;May I answer a golfing question with such code?&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;void blah(StringBuilder t) {&#xA;  // do something super golfy&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In another instance, the Java array type exists (examples: &lt;code&gt;String[]&lt;/code&gt;), but in some cases, it might be shorter to use a &lt;code&gt;java.util.stream.Stream&lt;/code&gt; as input parameter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Before:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;void blah(String[]a){&#xA;  Stream&amp;lt;String&amp;gt; s = java.util.Arrays.stream(a);&#xA;  // do something super golfy&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;After:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;void blah(java.util.Stream&amp;lt;String&amp;gt;s) {&#xA;  // do something super golfy&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I guess that the question can be boiled down to:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;May I transform my objects to other representations of the same objects before passing them as input parameters to the golfed function?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I have to provide a list of elements I'd like to be found acceptable as input parameters, here is it: (when no package, assume &lt;code&gt;java.lang&lt;/code&gt;, just like normal Java code)&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;basic types (primitives + String + arrays): &lt;code&gt;String&lt;/code&gt;, &lt;code&gt;int&lt;/code&gt;, &lt;code&gt;long&lt;/code&gt;, &lt;code&gt;double&lt;/code&gt;, &lt;code&gt;String[]&lt;/code&gt;, &lt;code&gt;int[]&lt;/code&gt;, etc.&lt;/li&gt;&#xA;&lt;li&gt;Mutable/Helper: &lt;code&gt;StringBuilder&lt;/code&gt;, &lt;code&gt;StringBuffer&lt;/code&gt;, &lt;code&gt;Integer&lt;/code&gt;, &lt;code&gt;Long&lt;/code&gt;, &lt;code&gt;Double&lt;/code&gt;, etc.&lt;/li&gt;&#xA;&lt;li&gt;IO: &lt;code&gt;java.io.Reader&lt;/code&gt;, &lt;code&gt;java.io.BufferedReader&lt;/code&gt;, &lt;code&gt;java.io.InputStream&lt;/code&gt;, etc.&lt;/li&gt;&#xA;&lt;li&gt;Collections: &lt;code&gt;Iterable&lt;/code&gt;, &lt;code&gt;java.util.Iterator&lt;/code&gt;, &lt;code&gt;java.util.Collection&lt;/code&gt;, and friends.&lt;/li&gt;&#xA;&lt;li&gt;Streams: &lt;code&gt;java.util.stream.Stream&lt;/code&gt;, &lt;code&gt;java.util.stream.IntStream&lt;/code&gt;, etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="16236" LastActivityDate="2016-09-17T05:28:33.170" Title="Are transformed versions of Java's types acceptable as function input?" Tags="|discussion|java|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10093" PostTypeId="2" ParentId="2140" CreationDate="2016-09-16T08:14:28.160" Score="3" Body="&lt;h1&gt;Repetition&lt;/h1&gt;&#xA;&lt;p&gt;In a language called Repetition (something I just made up), there consists an infinite string of &lt;code&gt;12345678901234567890...&lt;/code&gt;, with &lt;code&gt;1234567890&lt;/code&gt; repeating forever.&lt;/p&gt;&#xA;&lt;p&gt;The following syntax is available to output numbers:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;+-*/&lt;/code&gt;: This inserts the operator into the string of repeating digits.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Examples:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;+&lt;/code&gt; -&amp;gt; &lt;code&gt;1+2&lt;/code&gt; = &lt;code&gt;3&lt;/code&gt; (The &lt;code&gt;+&lt;/code&gt; inserts a &lt;code&gt;+&lt;/code&gt; between &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;2&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;+*&lt;/code&gt; -&amp;gt; &lt;code&gt;1+2*3&lt;/code&gt; = &lt;code&gt;1+6&lt;/code&gt; = &lt;code&gt;7&lt;/code&gt; (Same as above, except two operators are used now)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;/&lt;/code&gt; -&amp;gt; &lt;code&gt;1/2&lt;/code&gt; = &lt;code&gt;0&lt;/code&gt; (Repetition uses integer division)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Each operator is inserted so that it has one digit to its left, unless there are &lt;code&gt;~&lt;/code&gt;'s (see below).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;c&lt;/code&gt;: Concatenates with the next digit in the string.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Examples:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;c+&lt;/code&gt; -&amp;gt; &lt;code&gt;12+3&lt;/code&gt; = &lt;code&gt;15&lt;/code&gt; (The &lt;code&gt;c&lt;/code&gt; &amp;quot;continues&amp;quot; the &lt;code&gt;1&lt;/code&gt; and concatenates it with the next digit, &lt;code&gt;2&lt;/code&gt;, to form &lt;code&gt;12&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;+c&lt;/code&gt; -&amp;gt; &lt;code&gt;1+23&lt;/code&gt; = &lt;code&gt;24&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;()&lt;/code&gt;: Brackets for processing numbers.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Examples:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;(c+)*&lt;/code&gt; -&amp;gt; &lt;code&gt;(12+3)*4&lt;/code&gt; = &lt;code&gt;15*4&lt;/code&gt; = &lt;code&gt;60&lt;/code&gt; (Repetition uses the order of operations)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(c+)/c&lt;/code&gt; -&amp;gt; &lt;code&gt;(12+3)/45&lt;/code&gt; = &lt;code&gt;15/45&lt;/code&gt; = &lt;code&gt;0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;s&lt;/code&gt;: Skip a number.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;s+&lt;/code&gt; -&amp;gt; &lt;code&gt;2+3&lt;/code&gt; = &lt;code&gt;5&lt;/code&gt; (&lt;code&gt;s&lt;/code&gt; skips &lt;code&gt;1&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;csc&lt;/code&gt; -&amp;gt; &lt;code&gt;124&lt;/code&gt; (&lt;code&gt;s&lt;/code&gt; skips &lt;code&gt;3&lt;/code&gt;, and &lt;code&gt;c&lt;/code&gt; concatenates &lt;code&gt;12 &lt;/code&gt; with &lt;code&gt;4&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;In the examples above, only a finite amount of digits in the infinite string are used. The number of digits used is equivalent to &lt;code&gt;number of operators, concats and skips + 1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your task is, when given a string of Repetition code, output the result.&lt;/p&gt;&#xA;&lt;p&gt;Examples of input and output are:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;++ -&amp;gt; 6&#xA;- -&amp;gt; -1&#xA;(-)* -&amp;gt; -3&#xA;cscc -&amp;gt; 1245&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is code golf, so shortest code in bytes wins!&lt;/p&gt;&#xA;&lt;h2&gt;Meta:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this explained remotely well? Anything I need to clear up?&lt;/li&gt;&#xA;&lt;li&gt;Should this be a code golf or a metagolf challenge? I'm thinking of something like my previous challenge, &lt;code&gt;There can be only 1!&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-16T23:39:03.893" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="10095" PostTypeId="2" ParentId="2140" CreationDate="2016-09-16T14:24:46.537" Score="0" Body="&lt;h1&gt;Quine and Antiquine&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to make two different program, A and B. Both are nonempty proper quine. However, there is a restriction.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;AB and BA produce no output.&lt;/li&gt;&#xA;&lt;li&gt;CABD and CBAD will do the same thing as CD, where C and D are any (potentially empty) strings made up of copies of A and B. E.g. ABBABA and ABBBAA should behave identically (here, C = ABB and D = A).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The score is the sum of the length of A and B.&lt;/p&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;p&gt;A program written in DJam:&lt;/p&gt;&#xA;&lt;p&gt;program A :&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;abcd&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;program B :&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;efgh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Then, these output are sastified&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;abcdefgh&#xA;&amp;gt;&amp;gt; &amp;lt;empty output&amp;gt;&#xA;abcdabcdefgh&#xA;&amp;gt;&amp;gt; abcd&#xA;abcdabcdefghabcdefgh&#xA;&amp;gt;&amp;gt; abcd&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="46245" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-18T15:54:20.243" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10097" PostTypeId="2" ParentId="2140" CreationDate="2016-09-17T03:57:46.013" Score="0" Body="&lt;h2&gt;Code Golf: Convert to base 6 and back&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If given a number, convert it to base 6. You can assume it is positive. You can get the number through any of these methods: STDIN, or ask for user input. If &lt;code&gt;i&lt;/code&gt; has a &lt;code&gt;'o'&lt;/code&gt; at the end of it then assume the number is base 6 and convert it to a decimal number. Assume &lt;code&gt;i&lt;/code&gt; is a string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&#xA;Given &lt;code&gt;i&lt;/code&gt; convert it. So if &lt;code&gt;i = 12&lt;/code&gt; then return &lt;code&gt;20&lt;/code&gt;.&#xA;Given &lt;code&gt;i&lt;/code&gt; convert it. so if &lt;code&gt;i = 12o&lt;/code&gt; then return &lt;code&gt;8&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="36842" LastActivityDate="2016-09-17T03:57:46.013" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10098" PostTypeId="2" ParentId="10088" CreationDate="2016-09-17T05:28:33.170" Score="7" Body="&lt;p&gt;As long as your transformation doesn't add any additional information to the input than what would be present normally (for a &lt;code&gt;String&lt;/code&gt;, that information would be the length of the string and the sequence of characters that form the string), it should be fine. You should check with challenge authors on specific cases, though, as they may decide that a given transformation would trivialize the challenge too much to be acceptable.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2016-09-17T05:28:33.170" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10099" PostTypeId="1" AcceptedAnswerId="10100" CreationDate="2016-09-17T09:37:32.767" Score="19" ViewCount="240" Body="&lt;p&gt;In the language &lt;code&gt;dc&lt;/code&gt;, the &lt;code&gt;-&lt;/code&gt; character is reserved strictly for subtraction, so it cannot be used to enter a negative number. An alternative format for entering negative numbers was created: precede the number with an underscore, as in &lt;code&gt;_5&lt;/code&gt;. Many challenges require submissions to accept negative input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This may be a trivial question, but I want to know whether &lt;code&gt;dc&lt;/code&gt; is allowed to take negative input with underscores rather than minuses. As an example, in my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/84071/calculate-the-sum-of-ild/84284#84284&quot;&gt;submission&lt;/a&gt; for the challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/84071/calculate-the-sum-of-ild/&quot;&gt;Calculate the sum of ILD&lt;/a&gt;, I left a buffer of numbers waiting on the stack to receive a leading &lt;code&gt;-&lt;/code&gt; and report back whether the number was negative. Instead, I'd prefer to just assume that the number will be input as negative in the manner recognised by the interpreter. (I don't intend to change that particular submission; I'm just asking for future reference.)&lt;/p&gt;&#xA;" OwnerUserId="54071" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-09-17T22:08:02.903" Title="May `dc` take negative input as it's designed to?" Tags="|discussion|policy|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10100" PostTypeId="2" ParentId="10099" CreationDate="2016-09-17T14:21:40.563" Score="23" Body="&lt;h1&gt;Absolutely&lt;/h1&gt;&#xA;&lt;p&gt;Every language is different. Some take string input by default, some require double quotes around the string, some require single quotes around string, some have lists in this format&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1 2 3 4]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and others take lists in this format&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(1, 2, 3, 4)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;These types of language differences are trivial and normal, and you should format your input in whatever way is most natural to your language. It probably wouldn't hurt to mention this in your answer, just to make sure no one is confused. Something like:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Input is in this format...&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#sample input&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that negative numbers in dc are notated as &lt;code&gt;_6&lt;/code&gt;, not as &lt;code&gt;-6&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Of course, the OP &lt;em&gt;may&lt;/em&gt; override this and say something like:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Input will be in &lt;em&gt;exactly&lt;/em&gt; this format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1, 2, -3, 4]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;But in my opinion, this is a silly and useless rule to specify, as well as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8065/31716&quot;&gt;something to be discouraged&lt;/a&gt;. If a challenge had such a rule, I would certainly comment on it, ask them to change it and probably downvote if they did not.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-17T22:08:02.903" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10102" PostTypeId="1" AcceptedAnswerId="10104" CreationDate="2016-09-18T14:37:00.607" Score="1" ViewCount="134" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/93717/primes-with-equality-and-list-comprehensions-only&quot;&gt;This question&lt;/a&gt; was put on hold as unclear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I thought it specifies exactly the requirements, the objective, and the winning criterion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Could somebody kindly explain what's unclear about it? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;update:&lt;/em&gt; I've edited to remove an out-of-place sentence. Is the question good now?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;update 2:&lt;/em&gt; I've deleted the question. Thanks for the helpful feedback.&lt;/p&gt;&#xA;" OwnerUserId="5021" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-09-19T08:36:48.047" Title="What is &quot;unclear&quot; about this question?" Tags="|discussion|specific-question|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10103" PostTypeId="1" CreationDate="2016-09-18T15:20:27.150" Score="3" ViewCount="217" Body="&lt;p&gt;Recently, I have been thinking about creating golflang assemblers. Like assemblers, they just substitute a mnemonic(or a word) with the actual symbol. Since many golflangs aren't much more comprehensible than binary, it could use assembly-like programs to ease the coding. I know this makes golflangs easier to use and might make code golf more pointless for some non-golflang golfers. However, there have been tons of previous discussions on how meaningful using a golflang is, and I think using &quot;assemblers&quot; doesn't change that, because it's the logic that makes good answers, not the effort you put in the mundane process of finding the right functions. However, I'd still like to see what the community says. What do you think, guys?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt; In case the question's not clear enough, it's sort of like asking whether using assemblers is acceptable in a competition that asks you to submit machine code.&lt;/p&gt;&#xA;" OwnerUserId="49362" LastEditorUserId="49362" LastEditDate="2016-09-19T07:30:37.750" LastActivityDate="2016-09-19T07:58:28.033" Title="Is &quot;assembled&quot; golflang code acceptable?" Tags="|discussion|policy|code-golf|answers|" AnswerCount="2" CommentCount="10" ClosedDate="2016-09-20T07:59:54.917" ContentLicense="CC BY-SA 3.0" />
  <row Id="10104" PostTypeId="2" ParentId="10102" CreationDate="2016-09-18T17:39:33.090" Score="4" Body="&lt;p&gt;Whitelisting permitted syntactic constructs is almost always a disaster. It can just about work if answers are restricted to a single language and the full grammar of that language is given in the question, but in general you'll find that restrictions designed with one language in mind are completely unintelligible when you try to interpret them for an unrelated language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the particular case of the question you cite, it seems to me that the current wording prohibits the use of variables, but I can't tell whether you intended that or not. I've no idea how you intend &lt;em&gt;list comprehension&lt;/em&gt;  and &lt;em&gt;list enumeration&lt;/em&gt; to be interpreted in languages other than Python (and I'm a bit vague on what &lt;em&gt;exactly&lt;/em&gt; they mean in Python, although people who actually know the language probably understand).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;PS &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8079/194&quot;&gt;See also&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2016-09-18T17:39:33.090" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10106" PostTypeId="2" ParentId="10103" CreationDate="2016-09-18T20:22:41.323" Score="1" Body="&lt;p&gt;&lt;strong&gt;Yes.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't see much difference in a program that converts one representation of a program into another and the (manual) process people use to score LabVIEW programs as it applies to the score an entry receives. In fact, it is possibly more fair than the latter, since we can be sure that a fully-executable program &lt;em&gt;is&lt;/em&gt; representable in that many bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As to the question of whether it is okay to &quot;remove a significant difficult in writing golflang answers&quot;, I think most people find that whole &quot;look through lists of symbols to find the one that means the thing you want to do&quot; the &lt;em&gt;least&lt;/em&gt; interesting part of golfing. The fun part is writing the simplest program that performs the required task, and I feel that most people would embrace the opportunity to forgo the boring/annoying part.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In fact, since this may not add much to an opinion about whether entries in one language may be compiled to from another, I will generalize this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;If a language allows its programs to be represented in multiple different forms, you may score the most compact form while posting as an explanation the expanded/mnemonic form.&lt;/em&gt; This is what is done with LabVIEW, for instance. In the case of an assembler from one language to another, you can score the language you've assembled to, while posting as an explanation the (presumably easier-to-understand) one you've assembled from.&lt;/p&gt;&#xA;" OwnerUserId="47050" LastActivityDate="2016-09-18T20:22:41.323" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10110" PostTypeId="2" ParentId="10103" CreationDate="2016-09-19T07:58:28.033" Score="4" Body="&lt;p&gt;To put the clarified question in my own words:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;May I use a source-to-source compiler to generate my submission?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Yes, by all means. There are already answers on this site which have been generated by meta-golfing programs, and there's no controversy about that.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2016-09-19T07:58:28.033" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10113" PostTypeId="1" CreationDate="2016-09-19T11:38:35.510" Score="14" ViewCount="658" Body="&lt;p&gt;I am interested in understanding what is the smallest Android app possible that the OS will allow to be installed.  It need not have any function or interface (or even any executable code) - it just needs to be recognized by Android's package manager.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would that be an appropriate question to ask here, or would StackOverflow be more appropriate?&lt;/p&gt;&#xA;" OwnerUserId="49485" LastActivityDate="2018-08-16T14:55:01.113" Title="The smallest Android app in the world" Tags="|discussion|policy|asking-questions|" AnswerCount="1" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="10114" PostTypeId="2" ParentId="10113" CreationDate="2016-09-19T12:25:03.013" Score="20" Body="&lt;h1&gt;Yes, this is on-topic&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;“How do I golf this?”&lt;/em&gt; questions are welcome here, and this is essentially one of them: the OP wants to golf the smallest .apk file that Android’s package manager recognizes. If they supply some more specifics about their requirements (e.g. which Android device?) so others can help out, this is suited for the main site.&lt;/p&gt;&#xA;" OwnerUserId="3852" LastActivityDate="2016-09-19T12:25:03.013" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10115" PostTypeId="2" ParentId="2140" CreationDate="2016-09-19T19:50:36.773" Score="6" Body="&lt;h1&gt;Telegraphy Golf: Decode Baudot Code&lt;/h1&gt;&#xA;&#xA;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In 1870 Émile Baudot invented &lt;a href=&quot;https://en.wikipedia.org/wiki/Baudot_code&quot; rel=&quot;nofollow noreferrer&quot;&gt;Baudot Code&lt;/a&gt;, a fixed-length character&#xA;encoding for telegraphy. He designed the code to be entered from a&#xA;manual keyboard with just five keys; two operated with the left hand and&#xA;three with the right:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/t2c0p.png&quot; alt=&quot;Baudot 5-key keyboard&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The right index, middle and ring fingers operate the &lt;em&gt;I&lt;/em&gt;, &lt;em&gt;II&lt;/em&gt;, and&#xA;&lt;em&gt;III&lt;/em&gt; keys, respectively, and the left index and middle fingers operate&#xA;&lt;em&gt;IV&lt;/em&gt; and &lt;em&gt;Ⅴ&lt;/em&gt;. (Henceforth I'll use their Western Arabic numerals, i.e.&#xA;&lt;em&gt;1&lt;/em&gt;, through &lt;em&gt;5&lt;/em&gt;.) Characters are entered as chords. To enter the letter&#xA;&quot;C,&quot; for example, the operator presses the &lt;em&gt;1&lt;/em&gt;, &lt;em&gt;3&lt;/em&gt;, and &lt;em&gt;4&lt;/em&gt; keys&#xA;simultaneously, whereupon a rotating brush arm reads each key in&#xA;sequence and transmits a current or, for keys not depressed, no current.&#xA;The result is, in modern terms, a 5-bit least-significant-bit-first&#xA;binary encoding, in which our example, &quot;C,&quot; is encoded as &lt;code&gt;10110&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;5 bits??&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You might be thinking that 5 bits, which can express at most 32 unique&#xA;symbols, isn't enough for even all of the English letters and numerals,&#xA;to say nothing of punctuation. Baudot had a trick up his sleeve, though:&#xA;His character set is actually &lt;em&gt;two&lt;/em&gt; distinct sets: &lt;em&gt;Letters&lt;/em&gt; and&#xA;&lt;em&gt;Figures&lt;/em&gt;, and he defined two special codes to switch between them.&#xA;&lt;em&gt;Letter Shift&lt;/em&gt;, which switches to Letters mode, is activated by pressing&#xA;the &lt;em&gt;5&lt;/em&gt; key alone (&lt;code&gt;00001&lt;/code&gt;), and &lt;em&gt;Figure Shift&lt;/em&gt; is activated with the&#xA;&lt;em&gt;4&lt;/em&gt; key (&lt;code&gt;00010&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to write a program or function that decodes Baudot&#xA;Code transmissions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A real transmission would begin with some initialization bits, plus a&#xA;start and stop bit before and after each character, but we're going to&#xA;skip those and only worry about the 5 unique bits for each character.&#xA;Input and output formats are discussed below.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Baudot's Code&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;There are two different versions of Baudot Code: Continental and U.K.&#xA;We're going use the U.K. version, which &lt;em&gt;doesn't&lt;/em&gt; include characters&#xA;like &quot;É&quot; from Baudot's native French. We're also going to leave out all&#xA;of the symbols in the U.K. version that aren't among the printable ASCII&#xA;characters. You will only have to decode the characters in the table&#xA;below, all of which are printable ASCII characters except the final three control&#xA;characters that are explained below the table.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &quot;Ltr&quot; column shows the characters in Letter mode and &quot;Fig&quot; shows the&#xA;Figure mode characters:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;        Encoding             Encoding&#xA;Ltr Fig  12345       Ltr Fig  12345&#xA;--- --- --------     --- --- --------&#xA; A   1   10000        P   +   11111&#xA; B   8   00110        Q   /   10111&#xA; C   9   10110        R   -   00111&#xA; D   0   11110        S       00101&#xA; E   2   01000        T       10101&#xA; F       01110        U   4   10100&#xA; G   7   01010        V   '   11101&#xA; H       11010        W   ?   01101&#xA; I       01100        X       01001&#xA; J   6   10010        Y   3   00100&#xA; K   (   10011        Z   :   11001&#xA; L   =   11011        -   .   10001&#xA; M   )   01011        ER  ER  00011&#xA; N       01111        SP  FS  00010&#xA; O   5   11100        LS  SP  00001&#xA; /       11000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The last three rows in the right column are control characters:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;code&gt;ER&lt;/code&gt;&lt;/strong&gt; is &lt;em&gt;Erasure&lt;/em&gt;. Baudot's telegraphy machines would print an&#xA;asterisk-like symbol for this character to tell the reader that the&#xA;preceding character should be ignored, but we're going to be even&#xA;nicer to the reader and &lt;em&gt;actually omit (do not print) the preceding&#xA;character&lt;/em&gt;. It acts the same in both Letter and Figure mode.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;code&gt;FS&lt;/code&gt;&lt;/strong&gt; is &lt;em&gt;Figure Shift&lt;/em&gt;. This switches the character set from&#xA;Letters to Figures. If the decoder is &lt;em&gt;already&lt;/em&gt; in Figure mode,&#xA;FS is treated as a &lt;em&gt;Space&lt;/em&gt; (ergo &lt;code&gt;SP&lt;/code&gt; in the &quot;Ltr&quot; column). When the decoder is in Figure mode it stays in Figure mode until an LS character is received.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;code&gt;LS&lt;/code&gt;&lt;/strong&gt; is &lt;em&gt;Letter Shift&lt;/em&gt;. It switches the character set from&#xA;Figures to Letters. If the decoder is already in Letter mode, LS is treated as a &lt;em&gt;Space&lt;/em&gt;. When in Letter mode the decoder stays in Letter mode until an FS character is received.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The decoder always starts in Letter mode.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's an example with Figure Shift, Letter Shift, and Space:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;01011 10000 00100 00001 00010 10000 11100 00001 10101 11010&#xA;  M     A     Y   LS/SP FS/SP   1     5   LS/SP   T     H&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This yields the message &lt;code&gt;MAY 15TH&lt;/code&gt;. As you can see, the first &lt;code&gt;00001&lt;/code&gt; (Letter Shift/Space) character acts as a space, because the decoder is already in Letter mode. The next character, &lt;code&gt;00010&lt;/code&gt; (Figure Shift/Space) switches the decoder to Figure mode to print &lt;code&gt;15&lt;/code&gt;. Then &lt;code&gt;00001&lt;/code&gt; appears again, but this time it acts as Letter Shift to put the decoder back in Letter mode.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For your convenience, here are the characters in a format that's perhaps&#xA;easier to digest in an editor, sorted by code:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A,1,10000|E,2,01000|/,,11000|Y,3,00100|U,4,10100|I,,01100|O,5,11100|SP,FS,00010|J,6,10010|G,7,01010|H,,11010|B,8,00110|C,9,10110|F,,01110|D,0,11110|LS,SP,00001|-,.,10001|X,,01001|Z,:,11001|S,,00101|T,,10101|W,?,01101|V,',11101|ER,ER,00011|K,(,10011|M,),01011|L,=,11011|R,-,00111|Q,/,10111|N,,01111|P,+,11111&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input will be a string, array, or list of bits in&#xA;least-significant-bit-first order. Each character will be represented&#xA;by a quintet of 5 bits. Bits may be in any reasonable format, e.g. a&#xA;binary string, an array of &lt;code&gt;0&lt;/code&gt;s and &lt;code&gt;1&lt;/code&gt;s, a string of &lt;code&gt;&quot;0&quot;&lt;/code&gt; and &lt;code&gt;&quot;1&quot;&lt;/code&gt;&#xA;characters, a single very large number, etc., as long as it maps&#xA;directly to the bits of the transmission.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every transmission will have at least one printable quintet and at most&#xA;255 quintets (printable or otherwise), i.e. 5–1,275 bits inclusive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input can contain &lt;em&gt;only&lt;/em&gt; the bits of the transmission, with two&#xA;allowed exceptions: Any number of leading or trailing &lt;code&gt;0&lt;/code&gt; bits and/or,&#xA;for string input, a single trailing newline may be added to the&#xA;transmission. Leading or trailing bits or characters &lt;em&gt;cannot&lt;/em&gt; be added&#xA;before or after each quintet, i.e. you cannot pad each quintet to 8 bits&#xA;or separate quintets with any additional bits, e.g. &lt;code&gt;&quot;01111\n11100&quot;&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;Notes &amp;amp; edge cases&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The transmission will contain only the characters in the &quot;Ltr&quot; and&#xA;&quot;Fig&quot; columns in the table above. You will never receive e.g.&#xA;&lt;code&gt;01110&lt;/code&gt; in Figure mode, because it is absent from the &quot;Fig&quot; column.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It is assumed that the decoder will always be in Letter mode at the&#xA;beginning of a transmission. However, the first character &lt;em&gt;may&lt;/em&gt; be an&#xA;FS character to switch to Figure mode immediately.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When the decoder is in Letter mode, it may receive an LS character, and when it is in Figure mode it may receive an FS character. In either event a Space character must be printed (see Output).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The ER character will never be the first character in a transmission, nor will it ever immediately follow an LS, FS, or another ER.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;An FS character may immediately follow an LS character and vice versa.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Neither the LS nor FS character will be the last character in any transmission.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The &lt;code&gt;/&lt;/code&gt; and &lt;code&gt;-&lt;/code&gt; characters may be received in either Letter mode&#xA;(codes &lt;code&gt;11000&lt;/code&gt; and &lt;code&gt;10001&lt;/code&gt;, respectively) or Figure mode (&lt;code&gt;10111&lt;/code&gt;&#xA;and &lt;code&gt;00111&lt;/code&gt;).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Output may be in any reasonable format, the most reasonable being ASCII&#xA;(or UTF-8, for which all of the represented characters are the same as&#xA;ASCII). Please indicate in your answer if your output is in another&#xA;encoding or format.&lt;/p&gt;&#xA;&#xA;Notes&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The space character (see 3. above) should be an ASCII space (0x20)&#xA;or your encoding's equivalent, i.e. what you get when you press the&#xA;space bar.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Winning&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is code golf. The shortest code in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Restrictions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Standard loopholes are forbidden.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Trailing spaces and/or a single trailing newline are allowed. Leading spaces or other characters (that are not part of the transmission) are disallowed.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may not use any built-in or library functions that decode Baudot Code (or any of its descendants, e.g. Murray Code, ITA-1, etc.).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: 001101000010100111101110010101&#xA;Output: BAUDOT&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: 11010010001001100011110111101111100&#xA;Output: HELLO&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: 01011100000010000001000101000011100000011010111010&#xA;Output: MAY 15TH&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: 00010001000001000001011101110011100101010010110101010001111100101&#xA;Output: 32 FOOTSTEPS&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: 10110000110101011100111100001111011010000001101110&#xA;Output: GOLF&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: 000100011000001111100000100010110111001100010110010000111111&#xA;Output: 8D =( :P&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: 0000100001000010000100010001111011111011000011100010001&#xA;Output (4 leading spaces):     -/=/-&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="11261" LastEditorUserId="11261" LastEditDate="2016-09-20T14:41:55.340" LastActivityDate="2016-09-20T14:41:55.340" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10117" PostTypeId="1" AcceptedAnswerId="10118" CreationDate="2016-09-20T01:03:27.280" Score="16" ViewCount="478" Body="&lt;p&gt;I was wondering if it were possible to use multiple languages in the same submission. Not a polyglot, but using each of the languages. I have two thoughts on this.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;One language invokes the other. Let's say we have a Ruby + JavaScript solution. Then, you could have, say, &lt;code&gt;puts %x(node a)&lt;/code&gt; in &lt;code&gt;run.rb&lt;/code&gt; and &lt;code&gt;console.log(x=&amp;gt;x)&lt;/code&gt; in &lt;code&gt;a&lt;/code&gt;, and have &lt;code&gt;rub.rb&lt;/code&gt; be the main solution.&lt;/li&gt;&#xA;&lt;li&gt;Alternatively, each language could read the output of the previous language as input. E.g., invoke like &lt;code&gt;&amp;lt;input&amp;gt; | &amp;lt;language a&amp;gt; | &amp;lt;langauge b&amp;gt;&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;How would these be scored? How would it be consistent, concerning the usage of langs (e.g. multiple usages of the same lang)? How would it compare with each of its component languages? Should it be allowed at all? If not, why not?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Here is an example of a multi-language submission, using method 2:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;J + Ruby, idk bytes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Ruby, &lt;code&gt;ruby.rb&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;p gets.split.map(&amp;amp;:to_i).map{|s|s+4}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;J, &lt;code&gt;j.ijs&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;exit echo 1+i.10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Invoke like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;j.ijs | ruby.rb&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[5, 6, 7, 8, 9, 10, 11, 12, 13, 14]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="12012" LastEditDate="2017-02-27T15:41:14.560" LastActivityDate="2017-02-27T15:42:08.467" Title="On using multiple languages for a singular code golf submission" Tags="|discussion|policy|code-golf|answers|scoring|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10118" PostTypeId="2" ParentId="10117" CreationDate="2016-09-20T05:03:37.450" Score="14" Body="&lt;h2&gt;Yes, it's perfectly valid&lt;/h2&gt;&#xA;&lt;p&gt;The byte count of the solution would be the sum of the byte counts of any files involved, plus the length of any special invocations needed.&lt;/p&gt;&#xA;&lt;p&gt;For your first example, you have this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;//run.rb&#xA;puts %x(node a)&#xA;&#xA;//a&#xA;console.log(x=&amp;gt;x)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This would be invoked as &lt;code&gt;ruby run.rb&lt;/code&gt;, and would be in the language &lt;code&gt;Ruby + nodeJS&lt;/code&gt;, with a byte count of &lt;strong&gt;32&lt;/strong&gt;, assuming no trailing newlines in the files.&lt;/p&gt;&#xA;&lt;p&gt;For your second example, you could have something like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;python -c 'print range(10)' | node -e 'console.log(x=&amp;gt;x*x)'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In this case, the byte count would be:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;15 bytes for the Python 2 program (&lt;code&gt;print range(10)&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;32 bytes for the non-standard invocation for a Python 2 program (&lt;code&gt; | node -e 'console.log(x=&amp;gt;x*x)'&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;em&gt;or&lt;/em&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;19 bytes for the nodeJS program (&lt;code&gt;console.log(x=&amp;gt;x*x)&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;30 bytes for the non-standard invocation for a nodeJS program (&lt;code&gt;python -c 'print range(10)' | &lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;So, the byte count would be either &lt;strong&gt;47&lt;/strong&gt; (counting Python 2 as the primary driver) or &lt;strong&gt;49&lt;/strong&gt; (counting nodeJS as the primary driver). You would then choose the byte count more optimized for the scoring criteria (the 47 for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, for example). The language for this submission would be &lt;code&gt;Python 2 + nodeJS + sh&lt;/code&gt; (the &lt;code&gt;sh&lt;/code&gt; is included because of the piping on the command line).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-20T05:03:37.450" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="10119" PostTypeId="2" ParentId="2140" CreationDate="2016-09-20T05:08:53.660" Score="0" Body="&lt;h2&gt;Periodic Pillbox Problem &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Pill-popping Patty is prescribed to take a particular pharmaceutical every &lt;em&gt;P&lt;/em&gt; days. Presently, Phil has punked Patty's pill-box, punching holes in particular weekday's plastic pockets. Patty proceeds to plan pills &lt;em&gt;P&lt;/em&gt; days apart whenever possible, but places pills in the preceding day's plastic pocket if the preferred pocket is punctured. Produce a pill planning chart presuming Patty popped her prior pill on the penultimate day of the previous week.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;In case it's not clear, &lt;a href=&quot;http://c8.staticflickr.com/2/1523/24888074919_ff08ec8e8e_z.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; is the kind of pill-box I am referring to.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;br&gt;&#xA;The number &lt;em&gt;P&lt;/em&gt;, followed by the 1 to 6 weekdays that Phil punctured. Beginning with Sunday(&lt;code&gt;N&lt;/code&gt;) the weekdays are &lt;code&gt;N&lt;/code&gt; &lt;code&gt;M&lt;/code&gt; &lt;code&gt;T&lt;/code&gt; &lt;code&gt;W&lt;/code&gt; &lt;code&gt;R&lt;/code&gt; &lt;code&gt;F&lt;/code&gt; &lt;code&gt;S&lt;/code&gt;.&#xA;For instance &lt;code&gt;5MRF&lt;/code&gt; means Patty aims to wait 5 days after each pill, but cannot plan pills on Monday, Thursday, or Friday.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;You can have the input with a single space after the number (e.g. &lt;code&gt;5 MRF&lt;/code&gt;) or with spaces after the number and each day (e.g. &lt;code&gt;5 M R F&lt;/code&gt;).&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Process:&lt;/strong&gt;&lt;br&gt;&#xA;Given &lt;code&gt;5MRF&lt;/code&gt; Patty's first pill is taken on the first Wednesday (&lt;em&gt;5 days from last Friday&lt;/em&gt;). Her second pill should be taken on the second Monday(&lt;em&gt;5 days from the first Wednesday&lt;/em&gt;), but is moved up to the second Sunday because Monday is punctured. Her third pill should be taken on the second Friday(&lt;em&gt;5 days from Sunday, not Monday&lt;/em&gt;), but is moved up to the second Wednesday because Friday and Thursday are both punctured. She continues in this manner indefinitely.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note on the first week Patty's pillbox contains one pill on Wednesday, on the second and future weeks it contains pills on Sunday and Wednesday.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;br&gt;&#xA;The pill planning chart shall indicate the state of Patty's pill-box each week, one week per line. Days she does not take her pill must have a dot &lt;code&gt;·&lt;/code&gt;. Days she takes her pill must have a capital &lt;code&gt;X&lt;/code&gt;. The chart must stop as soon as the cycle occurs (i.e. &lt;em&gt;in the fewest lines possible&lt;/em&gt;) with an arrow &lt;code&gt;&amp;gt;&lt;/code&gt; pointing the first week in the cycle on the left. All weekdays must align in singly spaced columns with Sunday on the left.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Notes:&lt;/strong&gt;&lt;br&gt;&#xA;&lt;em&gt;You may assume Phil was not malicious enough to puncture P consecutive days of the weeks, and that P is between 2 and 7 inclusive.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;If Patty can't take her pill on the first Sunday, she takes it on the previous Saturday. Her pillbox was not damaged last week.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;A cycle has occurred when pills are being taken on the same weekdays as in an earlier week.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Patty never waits more than P days to take her pill.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Testcase 1: &lt;code&gt;5MRF&lt;/code&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  · · · X · · ·&#xA;&amp;gt; X · · X · · ·&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Testcase 2: &lt;code&gt;5MR&lt;/code&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; · · · X · · ·&#xA;  X · · · · X ·&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Testcase 3: &lt;code&gt;5MF&lt;/code&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  · · · X · · ·&#xA;&amp;gt; X · · · X · ·&#xA;  · · X · · · ·&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Testcase 4: &lt;code&gt;6NTFS&lt;/code&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  · · · · X · ·&#xA;&amp;gt; · · · X · · ·&#xA;  · X · · X · ·&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;A reference solution in C++ is provided &lt;a href=&quot;http://ideone.com/FgU4Yl&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;For The Sandbox...&lt;/em&gt;&lt;/strong&gt;&lt;br&gt;&#xA;&lt;em&gt;First Challenge. Hooray! My biggest concern is whether or not there is anything with a similar process, I'm not sure if there is a generalization or a name for this sort of elimination thing. Barring that, is a good golfing question, can it be made a better golfing question, is clear what has to be done, etc. Really any advice is welcome.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="46756" LastEditorUserId="46756" LastEditDate="2016-09-21T15:56:16.787" LastActivityDate="2016-09-21T15:56:16.787" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10124" PostTypeId="2" ParentId="2140" CreationDate="2016-09-21T03:13:51.253" Score="1" Body="&lt;h1&gt;Tweetable Video&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/printable-ascii&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;printable-ascii&amp;#39;&quot; rel=&quot;tag&quot;&gt;printable-ascii&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; rel=&quot;tag&quot;&gt;compression&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge is inspired by the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/11141/encode-images-into-tweets-extreme-image-compression-edition&quot;&gt;Encode Images into Tweets&lt;/a&gt; challenge, extending the idea to now attempt to compress video into a series of &quot;tweet&quot; sized messages where the number of tweets == number frames of the video.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The competition is to compress 450 frames of video into 450 (or less) tweets of 140 charactes ( 114.97 bytes per tweet, total max 51737 bytes).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Original frames as &lt;a href=&quot;https://youtu.be/w7GuHLsBUM0&quot; rel=&quot;nofollow noreferrer&quot;&gt;Video&lt;/a&gt;, as &lt;a href=&quot;https://github.com/klana001/TweetVideo/blob/gh-pages/out1.7z&quot; rel=&quot;nofollow noreferrer&quot;&gt;PNG images&lt;/a&gt; [&lt;strong&gt;Sandbox note:&lt;/strong&gt; Higher quality version will be uploaded soon]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Reference solution frames as &lt;a href=&quot;https://youtu.be/sZXzuWKzDPA&quot; rel=&quot;nofollow noreferrer&quot;&gt;Video&lt;/a&gt; [&lt;strong&gt;Sandbox note:&lt;/strong&gt; Reference solution will be expanded once challenge changes stabilized]&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;These rules are the based from rules in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/11141/encode-images-into-tweets-extreme-image-compression-edition&quot;&gt;Encode Images into Tweets&lt;/a&gt; modified to accommodate multiple frames that will yield the resultant video.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You must write a program that will communicate via std in/out based on the communication protocol defined below, ultimately producing a series of tweets that will, when fed back to your program, produce image frames of the video.&lt;/li&gt;&#xA;&lt;li&gt;The text created for each 'Tweet' by the program must be at most 140 characters long and must only contain characters whose code points are in the range of 32-126, inclusive.&lt;/li&gt;&#xA;&lt;li&gt;The source video will be 450 frames of &lt;a href=&quot;https://en.wikipedia.org/wiki/Big_Buck_Bunny&quot; rel=&quot;nofollow noreferrer&quot;&gt;Big Buck Bunny&lt;/a&gt;. Frames can be downloaded &lt;a href=&quot;https://github.com/klana001/TweetVideo/blob/gh-pages/out1.7z&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Frames will be width 320 pixels and height 240 pixels @ 24 bit RGB, each channel having 8 bit precision.&lt;/li&gt;&#xA;&lt;li&gt;Your program should be able to compress other video sources at same resolution. &lt;/li&gt;&#xA;&lt;li&gt;Your program can use external libraries and files, but cannot require an internet connection or a connection to other computers.&lt;/li&gt;&#xA;&lt;li&gt;The decoding process cannot access or contain the original images in any way. (Clarification use of corpus images is allowed as long as these images do not contain direct or manipulated original image frames)&lt;/li&gt;&#xA;&lt;li&gt;Use of video codecs or existing libraries that perform video compression are not allowed. This is to encourage experimentation and originality rather than simply calling libraries. Note that use of static image compressors/ libraries are allowed.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard Loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h3&gt;Communication Protocol&lt;/h3&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;All communication is via std in/out.&lt;/li&gt;&#xA;&lt;li&gt;The controller program will launch your program with no command line arguments.&lt;/li&gt;&#xA;&lt;li&gt;The controller will either initiate a one of the following sequences commanding to your program and expecting results.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Note the sequences are described below in the following format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;Comms direction from controller perspective&amp;gt;, &amp;lt;seq number&amp;gt;: &amp;lt;Transmitted Data&amp;gt; - &amp;lt;Information&amp;gt; &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For Encoding of the frames:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Output, 1: ENCODE\n - Indicating that the controller will be sending frames for your program to compress.&#xA;Output, 2: &amp;lt;number of frames&amp;gt;\n - String indicating number of frames. i.e. 450&#xA;Output, 3: &amp;lt;number of bytes for image data&amp;gt;\n - String indicating number of bytes of the current image data. e.g. 32145&#xA;Output, 4: &amp;lt;image data&amp;gt; - sequence of bytes of length defined in output line 3. The is the image data. The image data is a 24 bit image in PNG format&#xA;Repeat from output seq number 3 for the number of frames in output seq number 2.&#xA;Input, 1: &amp;lt;Tweet&amp;gt;\n - encoded image data. upto 140 characters, whose code points are in the range of 32-126, inclusive. A zero sized tweet will indicate end of all tweets.&#xA;Repeat from input line 1 for 1 to up to the number of frames in output seq number 2. Note a zero sized tweet will indicate end of all tweets.&#xA;Output, 5: END\n - Indicating that all processing has finished and your program should quit gracefully.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For Decoding of the frames:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Output, 1: DECODE\n - Indicating that the controller will be sending tweets for your program to decompress.&#xA;Output, 2: &amp;lt;number of tweets&amp;gt;\n - String indicating number of tweets. i.e. 450&#xA;Output, 3: &amp;lt;Tweet&amp;gt;\n - encoded image data. upto 140 characters, whose code points are in the range of 32-126&#xA;Input, 1: &amp;lt;number image frames decoded&amp;gt;\n - String indicating number of image frames that have been decoded as a result of the provided tweet. If 0 then no images have been decoded for this tweet.&#xA;Input, 2: &amp;lt;number of bytes for image data&amp;gt;\n - String indicating number of bytes of the current image data. e.g. 32145.&#xA;Input, 3: &amp;lt;image data&amp;gt; - sequence of bytes of length defined in input line 2. The is the image data. The image data is a 24 bit image in PNG format. &#xA;Repeat from input seq number 2 for the number of frames in input seq number 1.&#xA;Repeat from output seq number 3 for the number of tweets in output seq number 2.&#xA;Output, 4: END\n - Indicating that all processing has finished and your program should quit gracefully.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ol start=&quot;4&quot;&gt;&#xA;&lt;li&gt;Your program will be restart between the encoding and decoding phases.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;As an attempt to model the human visual system in a simplistic manner, JPEG quality levels are used as an analogue. Each frame will be compressed to a JPEG using quality levels 0.01 to 1.0 in 0.01 increments. The PSNR of these JPEG compressed versions are calculated and added into a data structure. Additionally, each frame will be resized by half and the JPEG encoding and PSNR calculations performed and added to the data structure. The resizing and calculating will repeat until a single pixel is left. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The result of which will be a scoring continuum of visual 'quality' from low (single color frame) to High (near-identical to original).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thus, scoring will be objective by means of the following formula:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;JPEG_QUALITY_LEVEL_PSNR = a pre-computed data multi dimensional structure consisting of the&#xA;                          PSNR for incremental JPEG quality levels for each image frame of&#xA;                          the video. The entries into this structure for each frame is such&#xA;                          that higher indecies are deemed to be of more similar to the&#xA;                          original.&#xA;&#xA;Score = SUM of (index of closest matching entry in JPEG_QUALITY_LEVEL_PSNR for given&#xA;                original frame and given PSNR of decoded frame)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Controller&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;[&lt;strong&gt;Sandbox note:&lt;/strong&gt; Controller is to be created]&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Refrence Solution&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;[&lt;strong&gt;Sandbox note:&lt;/strong&gt; Reference is to be created once question stabilizes]&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Ok, so this is my first question ever posed to codegolf and I am very keen to get feedback on how to better present the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some areas where I would like specific feed back is the objective scoring mechanism... i purposely avoided direct PSNR as the score as it is very limited for scoring video quality, being biased toward blurry images, however other algorithms are too complex or not defined. So as a compromise I am using JPEG compression as an analogue for the Human Visual System. Effectively matching a given solutions output frame to original frame PSNR to a JPEG compressed, at a given quality level) version's PSNR and using that match's index in sorted JPEG quality order as input for the score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is the protocol clear enough? if not what would be a better way to present it?&lt;/p&gt;&#xA;" OwnerUserId="20193" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:26.977" LastActivityDate="2016-09-21T11:47:19.207" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10127" PostTypeId="1" CreationDate="2016-09-21T19:25:56.727" Score="132" ViewCount="8078" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10126/8478&quot;&gt;Every&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9399/8478&quot;&gt;other&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9257/8478&quot;&gt;month&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8934/8478&quot;&gt;someone&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7887/8478&quot;&gt;expresses&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/6983/8478&quot;&gt;their&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2209/8478&quot;&gt;(negative)&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1737/8478&quot;&gt;feelings&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/630/8478&quot;&gt;about&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/286/8478&quot;&gt;golfing&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/185/8478&quot;&gt;languages.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is how this usually goes: they complain that they don't enjoy golfing in the languages they know because some language specifically built for golfing (which looks like gibberish and which they can't read) outgolfs them by 80%. They optionally suggest banning golfing languages or allowing challenge authors to ban them. The community's response is that they should view challenges as a separate competition in each language, that there is no objective definition of &quot;golfing language&quot; (e.g. that J and APL would ruin the fun for them just as much) and that this has been discussed many times. Depending on the constructiveness of the question, it's either heavily up- or downvoted, but then either answered with the same arguments as usual or closed as a duplicate of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/286/8478&quot;&gt;5th-to-top meta question&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yes, there isn't much of a point in writing the same kind of answer to every of these questions, but closing them as a duplicate probably doesn't make the author feel like their concerns are being taken seriously. We're probably losing more of these users than we're retaining.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While it's easy for us to shrug off these questions with the usual arguments, the reality is &lt;strong&gt;some people are not enjoying themselves in this community&lt;/strong&gt; even though they might really want to do some golfing in their favourite &quot;normal&quot; language. And I think that's really unfortunate, because golfing in Python or Java, say, can still be a ton of fun completely independently of whether someone has posted a 15-byte solution that looks like a collision between a head and a keyboard to the layman.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Golfing languages aren't going anywhere, and they provide a very interesting metagame many users in this community enjoy. And the users of this community are actually doing great work in this area — GolfScript seems verbose and clumsy in comparison with the &quot;modern&quot; golfing languages some of us have created. Hence, we need to find a way to accommodate people who don't want to participate with golfing languages despite the fact that they'll never &quot;win&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So: &lt;strong&gt;How can can we deal constructively with these concerns in the future?&lt;/strong&gt; How can we ensure that users feel welcome if they have trouble enjoying themselves next to the large number of answers we get in golfing languages?&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2021-12-10T06:13:29.710" Title="How can we help users who are put off by the use of golfing languages?" Tags="|discussion|code-golf|site-health|" AnswerCount="16" CommentCount="23" ContentLicense="CC BY-SA 3.0" />
  <row Id="10128" PostTypeId="2" ParentId="2140" CreationDate="2016-09-21T19:57:08.340" Score="0" Body="&lt;h1&gt;Checkmate (aka the urinal problem) V2&lt;/h1&gt;&#xA;&lt;p&gt;inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/94074/checkmate-aka-the-urinal-problem&quot;&gt;Checkmate (aka the urinal problem)&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;given a non-negative integer &lt;code&gt;n&lt;/code&gt;, assume there are &lt;code&gt;n&lt;/code&gt; urinals.&lt;/p&gt;&#xA;&lt;p&gt;also assume that you are not allowed to use an urinal when&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;it is out of order.&lt;/li&gt;&#xA;&lt;li&gt;or a neighboring urinal is occupied.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If no urinal is available, the situation is considered checkmate.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Create a program or function that finds and prints (or returns, or yields) all possible checkmate combinations for &lt;code&gt;n&lt;/code&gt; urinals.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;: STDIN, command line argument or function argument&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;: Any output that makes the combinations clear is accepted.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;TODO: add visual and test cases.&lt;/p&gt;&#xA;&lt;p&gt;a thought:&lt;br /&gt;&#xA;This cries for string operations; how about a bonus for a calculational solution? Do bonuses suck?&lt;/p&gt;&#xA;" OwnerUserId="55735" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-21T20:19:47.670" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10129" PostTypeId="2" ParentId="10127" CreationDate="2016-09-21T19:59:51.497" Score="14" Body="&lt;h1&gt;Challenges with Catalogs&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I think my proposal isn't really supported by the StackExchange website structure. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we could somehow have groups of answers separated by language, that would be pretty cool. We've manually done this before by creating a catalog of answers. This is done in the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world&quot;&gt;Hello World&lt;/a&gt; challenge, for example.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I thought this was a pretty neat format for a question and it could solve the issue as this could be opt-in by the poster.&lt;/p&gt;&#xA;" OwnerUserId="51785" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-09-21T19:59:51.497" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10130" PostTypeId="2" ParentId="10127" CreationDate="2016-09-21T20:26:15.257" Score="-17" Body="&lt;h2&gt;Make a Restricted-Code-Golf tag.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It seems that by dividing these challenges up into separate categories. Like many other competitive games, there are many categories of the same game (Olympic swimming, MOBAs, MTG, and poker to name a few examples). These categories have different rules, but are more or less the same exact thing. The code golf community would not be hurt by separating the challenges into&lt;br&gt;&#xA;&lt;em&gt;Code-Golf-Restricted&lt;/em&gt;&lt;br&gt;&#xA;and&lt;br&gt;&#xA;&lt;em&gt;Code-Golf-Unrestricted&lt;/em&gt;&lt;br&gt;&#xA;challenge tags.&lt;br&gt;&#xA;Heck, it may even encourage diversity and splash some popularity over to the others that we currently rarely see today.&lt;/p&gt;&#xA;" OwnerDisplayName="user56309" LastEditorDisplayName="user56309" LastEditDate="2016-09-21T20:31:51.367" LastActivityDate="2016-09-21T20:31:51.367" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10131" PostTypeId="2" ParentId="10127" CreationDate="2016-09-21T21:22:31.177" Score="4" Body="&lt;h2&gt;By not using them&lt;/h2&gt;&#xA;&lt;p&gt;I believe that a high density of golf lang answers presents a face deeply unattractive to (some) outsiders, by showing a high degree of insularity. My own, however small contribution to mitigating this problem is to refrain from using golfing languages.&lt;/p&gt;&#xA;&lt;p&gt;I have sometimes been tempted to start writing answers in golfing languages. It can be fun to have the lowest overall byte count. I know I would enjoy golfing in these languages as I do in others, and have even learned some to crack answers for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; challenges. But I remember the reason above, and for this reason I don't use them.&lt;/p&gt;&#xA;" OwnerUserId="30688" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-21T22:06:50.023" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="10132" PostTypeId="2" ParentId="10127" CreationDate="2016-09-21T21:58:44.030" Score="224" Body="&lt;h2&gt;Stop upvoting trivial solutions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It's easy to imagine why a new user would be frustrated when the highest-voted answer is a 3-byte solution in a golfing language with a built-in that nearly solves the problem. It feels like no matter how hard they golf in a conventional language, their solution will get much less recognition than an answer rushed out in the first five minutes. They feel like the goalposts have been moved.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's all nice to say that it's a competition in each language, but the golfing language solution is on top with huge score, and theirs is not. And for the questions in HNQ that outside users see most, there are sometimes a bunch of similar golfing language solutions on top, and any new answer might languish on the second page.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This needs to stop.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Be discerning with your votes. Don't upvote answers just for being really short. Don't upvote them for already having a lot of votes. Upvote them for being well-golfed, for doing something clever, for using language features in an imaginative way. View all the submissions, not just the top couple, and don't be afraid to be the first upvote.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, I suspect I'm talking to the wrong audience here. I suspect the culprits are new-ish users who haven't absorbed that terse solutions that look gibberish are par for the course in golfing languages. I imagine they think the poster is the most amazing golfer ever for making such a magically short and strange solution. Or, they are amazed by the language and so upvote every solution in it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I should add that highly-voted trivial solutions happen in conventional language too. These should not be upvoted so much. And, that terse golfing solutions can be the result of clever use of language features, not just use-the-obvious-built-in. These should be upvoted. I advocate voting for the solution, not the language. Its just that golfing languages have lots of powerful built-ins, so are more likely to allow a trivial solution.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="25315" LastEditDate="2016-12-21T14:10:06.360" LastActivityDate="2016-12-21T14:10:06.360" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="10133" PostTypeId="2" ParentId="10127" CreationDate="2016-09-21T22:59:45.967" Score="12" Body="&lt;h1&gt;Make an alternative leaderboard&lt;/h1&gt;&#xA;&lt;p&gt;Add a new section in the leaderboard snippet showing languages by categories, such as:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Widely used languages&lt;/li&gt;&#xA;&lt;li&gt;New trending languages&lt;/li&gt;&#xA;&lt;li&gt;Obscure serious languages&lt;/li&gt;&#xA;&lt;li&gt;Golfing languages&lt;/li&gt;&#xA;&lt;li&gt;Special purpose languages&lt;/li&gt;&#xA;&lt;li&gt;Difficult, recreational or joke languages&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The purpose is not to declare multiple winners, but to make the answers in a specific category easier to find. So I don't think we should make an exact definition about what is a golfing language.&lt;/p&gt;&#xA;&lt;p&gt;People who knows only production languages may find it annoying when the first 5 answers are all in golfing languages. But if the first answers are in APL, Regex, Mathematica or Haskel... Well, it's slightly better.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-21T22:59:45.967" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10134" PostTypeId="2" ParentId="2140" CreationDate="2016-09-21T23:31:55.260" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Interpret MSF-!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/79350/interpret-dogo?s=1|1.7329&quot;&gt;Beca&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/84/interpret-brainfuck?s=2|1.5538&quot;&gt;use&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37014/interpret-pronounced-slashes?s=3|1.2941&quot;&gt;the&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/19765/interpret-a-circuit-diagram?s=4|1.2193&quot;&gt;re&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/71004/interpret-the-pig-series?s=5|1.2193&quot;&gt;are&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/93599/interpret-repetition?s=6|1.2020&quot;&gt;n't&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/9303/interpret-whatfuck?s=7|1.1700&quot;&gt;eno&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/84914/interpret-kipple?s=8|1.1096&quot;&gt;ugh&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/65584/interpret-stackymath?s=9|1.0980&quot;&gt;&quot;Int&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/1595/interpret-fish?s=10|1.0980&quot;&gt;er&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/634/interpret-befunge-93?s=11|0.9804&quot;&gt;pret&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4097/interpret-your-lang-but-not-yourself?s=12|0.9550&quot;&gt;X&quot;&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69505/interpret-functional-basic?s=13|0.9221&quot;&gt;chal&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/585/self-interpreting-interpreter?s=16|0.6537&quot;&gt;len&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/48649/interpreting-fish-no-not-that-fish?s=17|0.5082&quot;&gt;ges.&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;MiniStringFuck (or MSF-) is a brainfuck derivate made by @ErikTheGolfer, with two commands, operating on one cell:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;kbd&gt;Instruction&lt;/kbd&gt;&lt;kbd&gt;Action&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&lt;/kbd&gt;&lt;br&gt;&#xA;&lt;kbd&gt;+&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&lt;/kbd&gt;&lt;kbd&gt;Increment the memory cell. If it reaches 256, wrap to 0.&lt;/kbd&gt;&lt;br&gt;&#xA;&lt;kbd&gt;.&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&lt;/kbd&gt;&lt;kbd&gt;Output the character in the cell.&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&lt;/kbd&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;or a bad-looking table:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Instruction, Action&#xA;+, Increment the memory cell. If it reaches 256, wrap to 0.&#xA;., Output the character in the cell.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to, given a string of MSF- code, containing only printable ASCII characters, output what it would print.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The string may have other characters than &lt;code&gt;+&lt;/code&gt; and &lt;code&gt;.&lt;/code&gt;. Treat them as NOPs&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;++++++++++++++++++++++++++++++++++++++++++++++++.+.+.+.+.+.+.+.+.+.&#xA;++++++++++++++++++++++++++++++++++++++++++++++++.                    Set cell to 48 (0) and output&#xA;                                                 +.+.+.+.+.+.+.+.+.  Keep adding and outputting until 57 (9)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+++++++++++++++++++++++++++++++++.+.+. -&amp;gt; !&quot;#&#xA;++++++++++++++++++++++++++++++++++++++++++++++++.+.+.+.+.+.+.+.+.+. -&amp;gt; 0123456789&#xA;+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+. -&amp;gt; ABCDEFGHIJKLMNOPQRSTUVWXYZ&#xA;ABCDEFGHIJKLMNOPQRSTUVWXYZ -&amp;gt; (no output)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="56258" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.947" LastActivityDate="2016-09-22T15:39:40.133" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10136" PostTypeId="2" ParentId="10127" CreationDate="2016-09-22T04:30:45.447" Score="35" Body="&lt;p&gt;As someone who doesn't use golfing languages, I can sympathise to a degree with the users left burnt by golfing langs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You spend time solving a problem in a popular language, post your solution, and wait for the upvotes to start rolling in. Only they don't. You scroll up and see a confusing mess of arrows and punctuation marks with 12 upvotes beside it! That solution only has 19 characters, whereas your solution is a solid 129 chars. Surely your solution should have more upvotes, because it took more effort, right?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Well, no. Characters don't represent the amount of effort someone puts into a solution. (or Java programmers would be very well paid)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;They say &quot;&lt;em&gt;beauty is in the eye of the beholder&lt;/em&gt;&quot;, and it's true, what's worth an upvote to you is different to others. Whether or not you can find beholders for your beautiful creation is the dilemma.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I worry that golfing langs are PPCG's punching bag for new users. Hard to understand, outranking your answers, multitudes less characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The reason I don't use golfing langs is genuinely because I don't understand or know any. It's easy for me to take my frustration and complaints out on them, because I don't understand them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I knew one, or any, I would probably have more respect for the effort and beauty of the golfing lang creations. I, like these users, am not a beholder of golfing lang beauty.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For me, my complaints against golfing langs would probably go away if I could understand them. Their barrier to entry is a high hurdle to scale, and I would imagine tension would be reduced significantly if it was easier to scale. In some sense, this kind of culture seems to unintentionally tell people they don't belong and they're not good enough for your &quot;&lt;em&gt;club&lt;/em&gt;&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, segregating golfing langs from non-golfing langs is very condescending to people who use golfing langs. Why are their languages supposedly unacceptable in a challenge? Segregation is a horrible solution to a problem that only exists out of anger.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's easy to suggest not using them, or to vote for non-golfing langs, but influencing human nature, especially voting culture, rarely ever works. Even if you firefight with a tactic like meta-organised rewarding non-golfing languages, there's always going to be spot fires of annoyed users wanting to vent in the cases you don't catch.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you're not posting in an advance because there's going to a golf-lang solution that beats yours, then you have only yourself to blame. Additionally, if your enjoyment is determined by how many upvotes you get on your answers, then you're posting for the wrong reason.&lt;/p&gt;&#xA;" OwnerUserId="41519" LastActivityDate="2016-09-22T04:30:45.447" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="10138" PostTypeId="2" ParentId="9463" CreationDate="2016-09-22T13:03:25.670" Score="31" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10132/32352&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Vdi3R.png&quot; alt=&quot;Know how to vote!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="32352" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2016-09-30T10:54:32.097" CommentCount="16" CommunityOwnedDate="2016-09-26T14:47:38.113" ContentLicense="CC BY-SA 3.0" />
  <row Id="10140" PostTypeId="2" ParentId="10127" CreationDate="2016-09-22T17:48:58.350" Score="33" Body="&lt;h2&gt;Stop accepting trivial solutions&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note&lt;/strong&gt;: As of &lt;a href=&quot;https://meta.stackexchange.com/q/369568/997045&quot;&gt;September 2021&lt;/a&gt;, accepted answers aren't pinned to the top anymore.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Don't give the green checkmark to the shortest solution when it's shortest by being in a golfing language with the right built-ins. Doing so pins it to the top regardless of votes as the first answer people see. Many users will look no further and upvote only it, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10132/20260&quot;&gt;which is bad&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Marking such a solution as accepted conveys to outsiders that golfing languages are the real way to win, and nobody else is actually competing. Why try hard to golf when some boring answer will win and you stand no chance? One can say the green check mark is just a formality to denote the objective winning criterion, but everywhere on SE it marks the best answer (most useful, most correct), so that's how people interpret it.&lt;/p&gt;&#xA;&lt;p&gt;If you don't accept any answer in this situation, nobody will notice or complain. See also the suggestion to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8363/20260&quot;&gt;remove the accept feature&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="100664" LastEditDate="2021-12-10T06:13:29.710" LastActivityDate="2021-12-10T06:13:29.710" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="10141" PostTypeId="1" CreationDate="2016-09-22T17:52:39.313" Score="4" ViewCount="232" Body="&lt;p&gt;This is a very grey area, because while excel is fun to enter, and play around with, often times it's seen as a pseudo-programming language.&lt;br&gt;&#xA;In Excel, one can drag-down formulas to automatically match cell entries, and other minor patterns. Usually, these formulas are dragged to the bottom of the input index, or (often times) all the way down to the bottom of the sheet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One can start to see how this gets strange very quick, as these drag-downs are useful, but hard to score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note, I'm not talking about answers where &lt;a href=&quot;https://codegolf.stackexchange.com/questions/87614/turtles-all-the-way-down/88761#88761&quot;&gt;dragging down is part of the input&lt;/a&gt;. I'm explicitly referring to answers that already have the formulas in them before any input.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How should we handle these answers? Should they be ignored? Scored?&lt;/p&gt;&#xA;" OwnerDisplayName="user56309" LastEditorUserId="-1" LastEditorDisplayName="user56309" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-09-29T21:16:41.863" Title="How should we handle Excel answers with drag-down formulas?" Tags="|discussion|code-golf|" AnswerCount="3" CommentCount="2" ClosedDate="2016-09-30T14:50:38.233" ContentLicense="CC BY-SA 3.0" />
  <row Id="10142" PostTypeId="2" ParentId="10141" CreationDate="2016-09-22T18:02:39.603" Score="-6" Body="&lt;h2&gt;Score as a polynomial&lt;/h2&gt;&#xA;&lt;p&gt;The way I wanted to suggest scoring these is to leave the score as a polynomial.&#xA;for example, say you have some code in excel like the following:&lt;br /&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/eJfDg.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/eJfDg.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;because &amp;quot;=(some more code)&amp;quot; is at a single point in the sheet, this will be the 0th term in the polynomial. In this case it is &lt;strong&gt;17 bytes&lt;/strong&gt;.&lt;br /&gt;&#xA;The &amp;quot;=(Some code)&amp;quot; snippet occurs along one dimension in the array (the A column), so that would be the 1st term in the polynomial. In this case it would be &lt;strong&gt;12n bytes&lt;/strong&gt;.&lt;br /&gt;&#xA;And in the rare case that someone has a multidimensional formula, then it will be considered the 2nd term in the polynomial. In this case it would be &lt;strong&gt;25n² bytes&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;so, if we were to score this sheet all together, it would be &lt;strong&gt;25n² + 12n + 17 bytes&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;While this method describes the nature of the entry well, it still lacks a proper method of scoring.&lt;/p&gt;&#xA;" OwnerDisplayName="user56309" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-22T18:02:39.603" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10143" PostTypeId="2" ParentId="10141" CreationDate="2016-09-22T18:21:42.607" Score="2" Body="&lt;h2&gt;Just count the bytes&lt;/h2&gt;&#xA;&lt;p&gt;This is a common question for oddball languages, from Scratch to Minecraft to Lego WeDo. The answer is usually (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9680/14215&quot;&gt;from what I've seen&lt;/a&gt;) to just count the bytes of the saved file.&lt;/p&gt;&#xA;&lt;p&gt;It's a simple method, easily understood by anyone. Will this make the score go up? Probably, but if you cared about having a super low score you probably wouldn't be using one of these languages in the first place.&lt;/p&gt;&#xA;&lt;p&gt;Note: If you can save it one of several Excel formats, choose the one with the lower byte count. Assuming that format has the features necessary to then open it back up and run it properly.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-22T18:21:42.607" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10144" PostTypeId="2" ParentId="10141" CreationDate="2016-09-22T18:22:19.203" Score="11" Body="&lt;h2&gt;Scored answers must be keyboard-only&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given that the &lt;a href=&quot;https://msdn.microsoft.com/en-us/library/office/ff838238.aspx&quot; rel=&quot;nofollow&quot;&gt;&lt;code&gt;Range&lt;/code&gt;&lt;/a&gt; operator exists that can replace the mouse drag-down operation, and the arrow keys can move between cells to (for example) enter multiple snippets of code in separate areas, I can't think of a reason why the mouse needs to be involved.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This also has the benefit of being able to be scored similar to Vim, for example, based on keystrokes.&lt;/p&gt;&#xA;" OwnerUserId="42963" LastActivityDate="2016-09-22T18:22:19.203" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10145" PostTypeId="1" CreationDate="2016-09-22T20:10:00.810" Score="53" ViewCount="2375" Body="&lt;p&gt;We've got a lot of questions asking how to count the bytes in different situations.  This question is here to put them all in one spot.&lt;/p&gt;&#xA;&lt;h1&gt;General questions&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/273/on-interactive-answers-and-other-special-conditions&quot;&gt;&lt;s&gt;How to count &amp;quot;interactive&amp;quot; answers and flags&lt;/s&gt;&lt;/a&gt; (revised to: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14339/52210&quot;&gt;Let's solve the flag problem once and for all&lt;/a&gt;)&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7842/when-is-code-that-requires-a-repl-acceptable&quot;&gt;How to count REPLs&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4933/counting-bytes-for-multi-file-programs&quot;&gt;How to count multiple files&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/6915/how-do-we-calculate-the-length-of-lambda&quot;&gt;How to count lambdas&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/6886/how-are-line-breaks-and-formatting-counted-for-code-golf-challenges/6893#6893&quot;&gt;How to count whitespace&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5635/should-the-lang-racket-line-be-included-in-code-golfs/5637#5637&quot;&gt;How to count shebangs&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7121/how-to-count-bytes-in-macro-heavy-languages-e-g-common-lisp&quot;&gt;How to count &amp;quot;expanded text&amp;quot;&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5878/what-character-encodings-may-a-submission-use&quot;&gt;How to count encodings&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1859/ecmascript-6-and-potential-related-flags&quot;&gt;How to count language-switch flags&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Language/feature-specific questions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10809/62131&quot;&gt;7&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10761/45941&quot;&gt;Algodoo&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9428/20469&quot;&gt;APL&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12339/46271&quot;&gt;Assembly&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9012/how-to-score-box-256-answers&quot;&gt;Box 256&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7075/does-desmos-com-count-as-a-programming-language/7077#7077&quot;&gt;Desmos.com&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7431/how-to-count-programs-in-folders&quot;&gt;Folders&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7502/programming-in-labview-how-to-measure-program-size/7628#7628&quot;&gt;LabView&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9646/how-to-score-the-lego-wedo-programming-language&quot;&gt;Lego WeDo&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7377/programming-in-minecraft-redstone-how-to-measure-program-size&quot;&gt;Minecraft&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7575/scoring-php-get-parameters&quot;&gt;PHP GET&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2424/running-php-with-r-instead-of-code-tags&quot;&gt;PHP -r/-R/-F&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10991/31716&quot;&gt;Piet&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/673/golfing-in-scratch&quot;&gt;Scratch&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1541/how-to-score-ti-basic/4764#4764&quot;&gt;TI-Basic&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12476/vba-immediate-window-byte-count&quot;&gt;VBA immediate Window&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7496/how-to-compile-score-answers-in-net-languages-specifically-vb-net&quot;&gt;VB.NET auto-includes&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8995/how-should-vim-answers-be-scored&quot;&gt;Vim&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8494/do-i-need-to-count-the-newline-for-vitsy-methods&quot;&gt;Vitsy&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1280/community-faq-for-programming-puzzles-code-golf&quot;&gt;Return to FAQ index&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-04-11T20:16:20.790" Title="How to count bytes FAQ" Tags="|discussion|faq|code-golf|answers|scoring|" AnswerCount="0" CommentCount="11" CommunityOwnedDate="2016-09-22T20:13:16.020" ContentLicense="CC BY-SA 4.0" />
  <row Id="10146" PostTypeId="2" ParentId="10127" CreationDate="2016-09-22T20:31:26.820" Score="29" Body="&lt;h2&gt;De-emphasize &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;And concentrate on other challenges, tricks and hacks with the code where golfing languages are less advantaged. Make PPCG more about Programming Puzzles than about Code Golf.&lt;/p&gt;&#xA;" OwnerUserId="7773" LastEditorUserId="8478" LastEditDate="2016-09-22T21:18:17.137" LastActivityDate="2016-09-22T21:18:17.137" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10147" PostTypeId="2" ParentId="10127" CreationDate="2016-09-22T20:36:08.937" Score="16" Body="&lt;h2&gt;Bigger, broader challenges expecting some dependencies&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Not just converting some short input to short output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, interfacing with a machine learning framework probably works better with regular languages than with golfing ones.&lt;/p&gt;&#xA;" OwnerUserId="7773" LastEditorUserId="14215" LastEditDate="2016-09-22T21:16:39.760" LastActivityDate="2016-09-22T21:16:39.760" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10148" PostTypeId="1" CreationDate="2016-09-23T13:13:18.613" Score="21" ViewCount="581" Body="&lt;p&gt;By physical analogs, I mean solutions written via objects in the physical world. Specifically, I am referring to a couple solutions to this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/82938/golf-all-the-16-logic-gates-with-2-inputs-and-1-output&quot;&gt;challenge&lt;/a&gt; (including my &lt;a href=&quot;https://codegolf.stackexchange.com/a/91472/43214&quot;&gt;own&lt;/a&gt; and a &lt;a href=&quot;https://codegolf.stackexchange.com/a/94131/43214&quot;&gt;couple&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/92268/43214&quot;&gt;others&lt;/a&gt;). &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should we allow solutions like this? &lt;/li&gt;&#xA;&lt;li&gt;If so, where is the cut off?&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should they publish a language specification first?&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;If not, why not?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;TL;DR&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I ask because I would like a ruling from the community before posting more domino solutions in case my other solutions aren't as well received. I also think it will be helpful to have distinctions on what is allowed and what isn't. For instance, if someone thought to solve a problem with some set of physical analogs, what criterion should they consider before posting the solution here? On the flip side, what criterion should we point to if we downvote a solution like this?&lt;/p&gt;&#xA;" OwnerUserId="43214" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-10-03T03:23:31.943" Title="Are physical analogs of programming legitimate?" Tags="|discussion|policy|" AnswerCount="3" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10149" PostTypeId="2" ParentId="7121" CreationDate="2016-09-23T14:12:41.187" Score="2" Body="&lt;p&gt;Extending slightly, the same problem can arise in C. Technically &lt;code&gt;#include &amp;lt;stdio.h&amp;gt;&lt;/code&gt; is a file of 12539 characters!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it's reasonable to say that the text you feed into your compiler / interpreter is the &quot;size of program&quot;, regardless how the compiler / interpreter then executes (by macro expansion / text replacement / tokenising / whatever).&lt;/p&gt;&#xA;" OwnerUserId="17064" LastActivityDate="2016-09-23T14:12:41.187" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10150" PostTypeId="2" ParentId="10148" CreationDate="2016-09-23T15:21:43.167" Score="11" Body="&lt;h1&gt;Native vs Logical&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;TL;DR :: logical -&gt; esolangs&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I think there is an important distinction to be made between different types of physical analogs. There are &lt;em&gt;Native&lt;/em&gt; analogs and there are &lt;em&gt;Logical&lt;/em&gt; analogs.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Native&lt;/strong&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Written in the real world&lt;/li&gt;&#xA;&lt;li&gt;Directly executed in the real world&lt;/li&gt;&#xA;&lt;li&gt;eg Dominoes&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Logical&lt;/strong&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;May be written in the real world&lt;/li&gt;&#xA;&lt;li&gt;Executed via logic&lt;/li&gt;&#xA;&lt;li&gt;Not executed in the real world&lt;/li&gt;&#xA;&lt;li&gt;eg Chess&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Native&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This code has to be executed in the real world or a simulation of the real world. For example, dominoes can get complex and require the real world in order to execute. You can simulate &lt;a href=&quot;https://codegolf.stackexchange.com/questions/34875/golfing-for-domino-day&quot;&gt;dominoes&lt;/a&gt; or you can simulate the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/64359/gravity-simulator&quot;&gt;real world&lt;/a&gt; but these simulations are simplifications. Whereas for Logical analogs you can actually have an exact implementation in the real world.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Logical&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;These Logical analogs can be written in the real world, but the are not executed in the real world. They are compiled via a series of rules/constraints/assumptions into a sequence of executable steps. What makes this different from Native is that these executable steps could be executed via a normal everyday interpreter and are independent of the real world. I think we should encourage Logical analog solutions to create a normal esolang.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Lets make a physical analog from tic-tac-toe. &lt;strong&gt;Rules&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The opponent is a perfect logician&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If two squares are equally strategic, he will choose the lower and then the left most&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;A win is equivalent to ...&lt;/li&gt;&#xA;&lt;li&gt;A loss is equivalent to ...&lt;/li&gt;&#xA;&lt;li&gt;A cats game is a ...&lt;/li&gt;&#xA;&lt;li&gt;Input is given by ...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Is this Native or Logical? The first bullet point tell us that the logician is the compiler, he executes the program and not the real world, so this is a Logical analog. Since the logicians steps have to be precisely laid out, we could write a Python interpreter to act as the logician and run the code for us. Instead of taking input and giving output in the real world, it is much easier to create a normal esolang for tic-tac-toe. Give the interpreter input like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; a | b | c &#xA;---+---+---&#xA; d | e | f &#xA;---+---+---&#xA; g | h | i &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and Python will execute the logical steps and return some output.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Conclusion&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Logical analogs should be implemented as esolangs. It makes verification easier and it just makes sense. Thus the set of problematic physical analogs has been reduced to Native ones.&lt;/p&gt;&#xA;" OwnerUserId="43214" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-09-23T16:03:51.057" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="10151" PostTypeId="2" ParentId="10148" CreationDate="2016-09-23T16:00:21.383" Score="17" Body="&lt;h2&gt;To be acceptable as a programming language, a digital simulator must exist.&lt;/h2&gt;&#xA;&lt;p&gt;Photos of dominos are great fun and all, but by themselves they don't really meet the definition of programming language. The basic problem with programming languages 'implemented by the physical world' is that the results of running programs &lt;strong&gt;cannot be reliably reproduced&lt;/strong&gt;. They suffer from nondeterminism: the real world is full of noise and a program that's intended to be deterministic may not be. It's impossible to set up dominos in exactly the same configuration and push them with identical force every time; the mechanics may be affected by air currents or vibrations from a passing truck.&lt;/p&gt;&#xA;&lt;p&gt;Precision in copying the program is also an issue as a program can only be approximately reproduced from a photograph. Are you willing to specify tolerances for domino positions, shapes, and masses; the smoothness of the table; and the local gravitational field?&lt;/p&gt;&#xA;&lt;p&gt;The only way to fully address these issues is by writing an interpreter on a computer. This also solves the problem of scoring, since the interpreter can use some file format.&lt;/p&gt;&#xA;" OwnerUserId="30688" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-23T16:00:21.383" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10152" PostTypeId="2" ParentId="2140" CreationDate="2016-09-23T16:20:05.280" Score="0" Body="&lt;p&gt;&lt;strong&gt;Compute The anti-derivative of a non-constant function&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Most of us know how anti derivatives work. They are basically the sums of infinite number of very small elements (or units). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge here is to calculate anti derivative of a function (NON CONSTANT). using any programming language except the ones which calculate anti derivatives directly (Mathematica for instance). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anti derivatives which have been calculated must be done by the usual summation  method which is basically the definition of the integral. Summation of y.dx over some interval of x)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You basically have to find the anti derivative WITH limits i.e. definite integral of a non constant function in between two user specified limits&lt;/p&gt;&#xA;" OwnerUserId="59502" LastEditorUserId="59502" LastEditDate="2016-09-24T08:37:20.477" LastActivityDate="2016-09-24T08:37:20.477" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10153" PostTypeId="2" ParentId="2140" CreationDate="2016-09-24T00:58:32.290" Score="1" Body="&lt;h2&gt;Leaderboard golf: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/111735/leaderboard-golf&quot;&gt;posted&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="7773" LastEditorUserId="7773" LastEditDate="2017-02-28T23:27:31.093" LastActivityDate="2017-02-28T23:27:31.093" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10154" PostTypeId="2" ParentId="10127" CreationDate="2016-09-24T07:18:32.900" Score="-10" Body="&lt;h2&gt;Make a handicapped codegolf tag&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Let me begin by stating that I really recognize the problem addressed here and I think it's really something that should be &quot;fixed&quot; one way or another. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/q/71117/32381&quot;&gt;this&lt;/a&gt; PPCG question this issue is addressed and the one and only answer gives a very reasonable option for introducing a handicap system by adjusting the bytecount of an answer based on the used language:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;      / n - B \&#xA;      | ----- |&#xA;      \   V   /&#xA;n = e&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;With:&#xA;n = bytecount,&#xA;B = Boilerplate,&#xA;V = Verbosity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My solution is to introduce a new tag &lt;kbd&gt;code-golf-handicapped&lt;/kbd&gt;, which applies the handicap function with (community accepted parameters). Answers should be given like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Language (length: n, handicapped: c)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This solution leaves the liberty of the poster to use &lt;kbd&gt;code-golf&lt;/kbd&gt; or &lt;kbd&gt;code-golf-handicapped&lt;/kbd&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Explanation of the handicap system and the parameters for all known languages should be maintained by the site moderators in a meta-post. &lt;/p&gt;&#xA;" OwnerUserId="32381" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-09-24T07:18:32.900" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10156" PostTypeId="2" ParentId="10127" CreationDate="2016-09-24T10:36:13.417" Score="59" Body="&lt;h2&gt;What SE could do for us...&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;One of the most popular suggestions from &quot;We're not a Q&amp;amp;A site, but what should be done about it?&quot; is to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8358/8478&quot;&gt;&lt;strong&gt;add software support for answer metadata&lt;/strong&gt;&lt;/a&gt; (mainly scores and languages). I believe this slightly different answer format would greatly reduce the impression that being the overall winner is important. Things this would make possible:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Built-in language-oriented leaderboards (like &lt;a href=&quot;http://golf.shinh.org/p.rb?hello+world&quot; rel=&quot;nofollow noreferrer&quot;&gt;anarchy golf&lt;/a&gt; has).&lt;/li&gt;&#xA;&lt;li&gt;Generating site-wide language rankings (also like &lt;a href=&quot;http://golf.shinh.org/lranking.rb&quot; rel=&quot;nofollow noreferrer&quot;&gt;anarchy&lt;/a&gt;). While this &lt;em&gt;would&lt;/em&gt; consistently put golfing languages over mainstream languages, the benefit of such a ranking would be that people can find out which languages they &lt;em&gt;can&lt;/em&gt; reasonably compare themselves with (trying to beat someone with a language that is slightly better at golfing than yours can be a great motivator and reward if you manage it; it's just being upset when you can't beat Pyth with Python that isn't helping anyone).&lt;/li&gt;&#xA;&lt;li&gt;Allowing people to search reliably for answers in their language or maybe even challenges that weren't answered in their language yet.&lt;/li&gt;&#xA;&lt;li&gt;Heck, if someone &lt;em&gt;really&lt;/em&gt; hates golfing languages and can't stop getting worked up about them, it would even be possible to ignore answers in certain languages just like you can currently ignore challenges with certain tags.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I know that SE making changes like this to the software is a &lt;em&gt;lot&lt;/em&gt; to hope for, but I think especially in the context of the current discussion, this could be a &lt;em&gt;huge&lt;/em&gt; improvement for this community and help attracting and retaining users who want to golf in mainstream languages, so if people agree with this, it might good to show SE just &lt;em&gt;how much&lt;/em&gt; we really want this feature. And I'm being told the community managers are currently reviewing that list for feasibility and importance of the requests, so I figured now would be a good time to bring this up again.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2016-09-24T10:36:13.417" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10157" PostTypeId="2" ParentId="2140" CreationDate="2016-09-24T17:18:34.170" Score="-3" Body="&lt;h1&gt;Open the browser, polyglot edition. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your job is to open a browser window of the default browser to &lt;a href=&quot;https://codegolf.stackexchange.com&quot;&gt;https://codegolf.stackexchange.com&lt;/a&gt; &lt;strong&gt;in as many languages as possible&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code must open the browser itself, and cannot rely on an open one.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Versions of the same language are considered a single language&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2016-09-24T17:18:34.170" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10162" PostTypeId="1" AcceptedAnswerId="10164" CreationDate="2016-09-25T16:07:06.440" Score="8" ViewCount="196" Body="&lt;h2&gt;What is considered Proper usage of a bounty?&lt;/h2&gt;&#xA;&lt;p&gt;I am interested in offering a bounty to user X as I am interested in seeing one of his ideas come to fruition. It is not a bounty for a specific answer as it is just a bounty to incentivize some hard work. Is this essential bribery considered against our rules? On a similar note could a user bribe people with reputation to do some work for them?&#xA;&lt;br/&gt;&#xA;&lt;br/&gt;&#xA;Also, is it considered against the rules for two people to cross offer bounties in an attempt to gain publicity (and rep) while not losing any rep on the bounty? I think this is abuse of the bounty feature, but do we have a specific rule against it? Should we? (I'm keeping this part of the question here for reference) here is the answer on mother &lt;a href=&quot;https://meta.stackexchange.com/questions/128890/bounty-recycling-abuse&quot;&gt;meta&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-25T17:48:39.593" Title="Proper Bounty Usage" Tags="|discussion|bounty|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10163" PostTypeId="2" ParentId="2140" CreationDate="2016-09-25T17:15:36.157" Score="0" Body="&lt;h1&gt;Download  a file &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your boss wants you to make a comprehensive download utility. She uses &lt;a href=&quot;https://en.wikipedia.org/wiki/Microsoft_Bob&quot; rel=&quot;nofollow noreferrer&quot;&gt;Microsoft Bob&lt;/a&gt; and thinks shorter code is better code. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The Gist:&lt;/strong&gt; In as few bytes as possible, given an input URL, output the file to stdout.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You will be given a fully qualified (w/ http/https) URL.&lt;/li&gt;&#xA;&lt;li&gt;Download link may redirect. Follow all redirects.&lt;/li&gt;&#xA;&lt;li&gt;Any non 2xx-3xx status code should be interpreted as an error. Exit with a status code of zero.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Verify SSL certificates&lt;/strong&gt; - exit with 0 if invalid&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Misc&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do not use a preexisting utility already designed for downloading files, such as &lt;code&gt;wget&lt;/code&gt;. This is considered cheating.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2016-09-25T17:15:36.157" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10164" PostTypeId="2" ParentId="10162" CreationDate="2016-09-25T17:48:39.593" Score="14" Body="&lt;p&gt;Bounties are about two things&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Rewarding excellent answers, and&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;incentivizing users to answer a specific challenge, or even a sub challenge, e.g, the shortest bf answer gets a bounty, outgolf this particular answer, etc.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In both of these situations, the point of the bounty is the &lt;em&gt;answer&lt;/em&gt;, not the &lt;em&gt;answerer&lt;/em&gt;. A lot of this comes down to how you phrase it/think of it. So to answer your first question, yes it would be inappropriate to give a bounty to a user to incentivize some hard work &lt;em&gt;unless&lt;/em&gt; you're putting a bounty on the result of that work. For example, this is inappropriate:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Hey user X, it would be really impressive if you could implement this language. I'll give you a hundred points (on some other answer) if you do. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;But it would &lt;em&gt;not&lt;/em&gt; be inappropriate to post a challenge saying:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Write an interpreter for language Y. I'll put a bounty on the shortest/fastest/etc. answer.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;But then you must be willing to put a bounty on an answer by a different user if it's better. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In short, it's perfectly fine to put a bounty on hard-work, but you must put the bounty on the &lt;em&gt;work&lt;/em&gt;, not &lt;em&gt;the user that did that work&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For completeness sake, even though you answered your own question, cross-bountying is &lt;em&gt;definitely&lt;/em&gt; abusing the system, and &lt;a href=&quot;https://meta.stackexchange.com/questions/128890/bounty-recycling-abuse#comment352034_128891&quot;&gt;you may be suspended&lt;/a&gt; for doing so. If you suspect a user is doing this, flag it for moderator attention. &lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2016-09-25T17:48:39.593" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10166" PostTypeId="2" ParentId="1061" CreationDate="2016-09-26T01:06:14.553" Score="41" Body="&lt;h1&gt;URL shorteners / shortened URLs&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Every once in a while, we get a challenge that requires fetching some data from the internet. While some of them manage to ban URL shorteners in time, other don't. I propose to forbid them by default because of the following reasons.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;URL shorteners that were created after the challenge was posted are akin to adding a feature to the interpreter after the challenge was posted, and there's usually no easy way to determine when a shortened URL was created. They also outsource the &quot;real&quot; URL, which is more or less a violation of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1085/12012&quot;&gt;this loophole&lt;/a&gt;. Last but not least, it's oftentimes not possible to determine whether a given URL existed before the challenge was posted.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Using a non-canonical URL is not only a bit unimaginative and rather unrelated to programming, the same URL can be used in pretty much &lt;em&gt;all&lt;/em&gt; answers. Every time someone finds a shorter URL, all other posts can be updated to use that URL as well. That's a very tedious and boring way of saving bytes.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In some challenges, API queries have to be made. Being able to fit a very complex query – which will make parsing its output easier – in the same amount of bytes as simple one actively harms the challenge; instead of coming up with clever ways to parse the output, the complex query is &quot;golfed&quot; down using a URL shortener.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;URL shorteners are rather easy to identify. That leaves non-canonical domain names.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I propose counting all URLs on domains as shortened (and therefore forbidden) if the domain name isn't owned by the same individual/company as the canonical one. Thus, e.g., if the task at hand involves querying &lt;a href=&quot;https://api.stackexchange.com&quot;&gt;https://api.stackexchange.com&lt;/a&gt;, only URLs that belong to Stack Exchange, Inc. may be used in the challenge.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-09-30T04:07:58.963" CommentCount="6" CommunityOwnedDate="2016-09-26T01:06:14.553" ContentLicense="CC BY-SA 3.0" />
  <row Id="10168" PostTypeId="2" ParentId="2140" CreationDate="2016-09-26T03:32:20.163" Score="0" Body="&lt;h1&gt;Handwriting Recognition&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://yann.lecun.com/exdb/mnist/&quot; rel=&quot;nofollow noreferrer&quot;&gt;The MNIST dataset&lt;/a&gt; is a series of handwritten digits used as a standard testbed for machine learning, pattern recognition techniques. Each image is of a single digit, &lt;code&gt;0-9&lt;/code&gt;; as a &lt;code&gt;28x28&lt;/code&gt; pixel grayscale matrix with values from &lt;code&gt;0-255&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/yxeor.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/yxeor.png&quot; alt=&quot;MNIST example images&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is to create a classifier for MNIST that scores an Error Rate of less than &lt;code&gt;[TBD]&lt;/code&gt; in the least number of bytes possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program must take a &lt;code&gt;28x28&lt;/code&gt; 2d array in whatever format is applicable for your language representing a single image. For example, the input for the first digit might be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  3, 18, 18, 18,126,136,175, 26,166,255,247,127,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0, 30, 36, 94,154,170,253,253,253,253,253,225,172,253,242,195, 64,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0, 49,238,253,253,253,253,253,253,253,253,251, 93, 82, 82, 56, 39,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0, 18,219,253,253,253,253,253,198,182,247,241,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0, 80,156,107,253,253,205, 11,  0, 43,154,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0,  0, 14,  1,154,253, 90,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,139,253,190,  2,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0, 11,190,253, 70,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0, 35,241,225,160,108,  1,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0, 81,240,253,253,119, 25,  0,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0, 45,186,253,253,150, 27,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0, 16, 93,252,253,187,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,249,253,249, 64,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0, 46,130,183,253,253,207,  2,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0, 39,148,229,253,253,253,250,182,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0,  0,  0, 24,114,221,253,253,253,253,201, 78,  0,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0, 23, 66,213,253,253,253,253,198, 81,  2,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0, 18,171,219,253,253,253,253,195, 80,  9,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0, 55,172,226,253,253,253,253,244,133, 11,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,136,253,253,253,212,135,132, 16,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0],&#xA; [  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Conditions:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is code golf. The shortest piece of code that meets the criteria wins.&lt;/li&gt;&#xA;&lt;li&gt;The code must take a provided &lt;code&gt;28x28&lt;/code&gt; input and attempt to classify it.&lt;/li&gt;&#xA;&lt;li&gt;Testing will take place on my computer at 12pm AEST on Saturday the . I will run each classifier over a set of 1000 images. To be considered, it must correctly classify &lt;code&gt;[TBD]&lt;/code&gt; of them. If I can't get your code to run, it wont be counted, so help with loading the images in your language would be appreciated.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are not permitted.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Questions for Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Overall thoughts on the challenge?&lt;/li&gt;&#xA;&lt;li&gt;Has anything been done like this before? Did it work?&lt;/li&gt;&#xA;&lt;li&gt;Any ideas on a good cutoff for the classifier? I was thinking around 60% correct. Though was going to have a go at it myself to see what I could reasonably achieve.&lt;/li&gt;&#xA;&lt;li&gt;Does the testing clause make sense? Is it reasonable? Should I put a limit on the languages?&lt;/li&gt;&#xA;&lt;li&gt;Since barrier to entry is a bit high (knowing how to get hold of the images, possibly some ML experience), is there anything extra I should do to make it easier to start the challenge.&lt;/li&gt;&#xA;&lt;li&gt;This is my first suggestion for a challenge, is there anything I'm missing?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="59564" LastEditorUserId="59564" LastEditDate="2016-09-26T04:43:53.377" LastActivityDate="2016-09-26T04:43:53.377" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10171" PostTypeId="2" ParentId="2140" CreationDate="2016-09-26T18:16:09.747" Score="-3" Body="&lt;h1&gt;Mad lads!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Inspired by the &lt;em&gt;&lt;a href=&quot;https://www.youtube.com/watch?v=siawhQBRC8I&quot; rel=&quot;nofollow noreferrer&quot;&gt;paper calculator&lt;/a&gt;&lt;/em&gt; episode of Numberphile.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your challenge in this puzzle is to take in two two-bit (0-3) numbers and output the sum of the two numbers... using ordinary household objects.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some possibilities of how this can be done:&lt;br&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/91472/56309&quot;&gt;Dominoes&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://www.youtube.com/watch?v=siawhQBRC8I&quot; rel=&quot;nofollow noreferrer&quot;&gt;Paper&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://www.youtube.com/watch?v=wIKah9aVlm4&quot; rel=&quot;nofollow noreferrer&quot;&gt;Marbles&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;http://www.instructables.com/id/Build-a-Programmable-Mechanical-Music-Box/&quot; rel=&quot;nofollow noreferrer&quot;&gt;music box&lt;/a&gt; (+ some helpers..)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;input must always be involving two sets of two-bit integers, which can be represented by anything you like, so long as the cardinality of the representations is the same.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The output should be a single 3-bit integer which represents the addition of the two inputs.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;your device cannot have the capability to connect to the internet in&#xA;any way (sorry, this also disqualifies carrier pigeons). Your device&#xA;must also not be able to perform this function alone (eg a&#xA;calculator).  &lt;/li&gt;&#xA;&lt;li&gt;It must be &lt;em&gt;somewhat&lt;/em&gt; original. put your own twist on it!  &lt;/li&gt;&#xA;&lt;li&gt;though, your entry can be alive (does your dog add??), so long as your entry is not in discomfort.&lt;/li&gt;&#xA;&lt;li&gt;Pictures are required for each entry to show how it works. videos would be better, but aren't required!&lt;/li&gt;&#xA;&lt;li&gt;The sole function of your machine does not have to be adding, it can do other&#xA;things as well. This means that older projects that may serve a&#xA;slightly different function are welcome, so long as they meet the&#xA;rules stated above.&lt;/li&gt;&#xA;&lt;li&gt;Your device can be as simple or as complex as you like, so long as it doesn't get to a point where it's completely esoteric.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Judging:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You will be judged based on ease of use, ease of understanding, as well as originality! This means that entries should be easily explained, used, and be unique in some way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, so the most upvotes wins! good luck!&lt;/p&gt;&#xA;" OwnerDisplayName="user56309" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:26.977" LastActivityDate="2016-09-26T18:16:09.747" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10172" PostTypeId="1" AcceptedAnswerId="10228" CreationDate="2016-09-26T19:11:29.817" Score="48" ViewCount="1239" Body="&lt;p&gt;I would start this post with something along the lines of &quot;without naming names&quot;, but I think it's time to pinpoint the issues we currently face in chat and take action.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a follow-up to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8771/the-state-of-chat&quot;&gt;The state of chat&lt;/a&gt;. This post aims to identify specific problems and specific problematic users. Because nothing has changed.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Self-Promotion&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A post / series of post by a user clearly affiliated with the content linked to (not exclusive to PPCG) for the sole or main purpose of promoting said content. This becomes a problem, when it is noticed by many different users. It's a &lt;em&gt;serious&lt;/em&gt; problem, when this behavior persists, even after the user(s) has been asked to stop.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A few examples of recent responses that have gone unnoticed as it seems:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Can you stop advertising your answers in here ? (&lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=32361573#32361573&quot;&gt;21 stars&lt;/a&gt;)&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Quit &quot;shamelessly&quot; promoting your posts. At this point, you should be ashamed. (&lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=32555458#32555458&quot;&gt;9 stars&lt;/a&gt;)&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;TNB is not a place to advertise your posts, whether on PPCG or elsewhere (&lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=32553416#32553416&quot;&gt;13 stars&lt;/a&gt;)&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;As much as I like the bots, they have a separate room(s) for a reason. I don't mind a quote every now and then, but we don't need a running update (&lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=32506341#32506341&quot;&gt;6 stars&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Deleting Messages&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A user keeps deleting chat messages with no apparent reason. This becomes a problem, when the amount of deletions is unjustified, the flow of the conversation becomes disrupted and/or users joining the chatroom become disoriented as to why these messages have been deleted. &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;For heavens sake, stop deleting your messages. (&lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=32321615#32321615&quot;&gt;5 stars&lt;/a&gt;)&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;A good alternative to deleting a message that you didn't think before posting, is to think before posting (&lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=32321663#32321663&quot;&gt;19 stars&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This becomes a &lt;em&gt;serious&lt;/em&gt; problem, when the deleted messages actually were relevant and exhibit a higher quality than most of the other content posted by that user.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;[...] I don't get why you would delete a legitimate question, but regularly post nonsensical messages containing nothing but bad English and crying smilies. You should really start to think about your signal to noise ratio. (&lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=32538014#32538014&quot;&gt;6 stars&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h3&gt;Intentionally Lowering Quality&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A user posts messages that add nothing to the conversation. Worse yet, the contain nothing but &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;(redundant) text emoticons&lt;/li&gt;&#xA;&lt;li&gt;intentionally bad English&lt;/li&gt;&#xA;&lt;li&gt;questions that the user doesn't really need answers to&lt;/li&gt;&#xA;&lt;li&gt;straight up noise&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is always a &lt;em&gt;serious&lt;/em&gt; problem, and I'll explain why. A few months ago, when chat was quiet, a message occasionally appeared indicating something like &quot;the last message was posted xh ago&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now these messages have been replaced by &quot;conversations&quot; that are completely uncalled for, useless and a bad example for any user. Instead of an interesting chat log, followed by a brief period of silence, new users now encounter the worst side of TNB when visiting during these (previously) quiet periods. This influences other users.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;[...] Spamming the room with noise will not be tolerated. (&lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=31242429#31242429&quot;&gt;37 stars&lt;/a&gt;)&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;[...] Please don't speak like this. It lowers the tone of one of the few (usually) civilized places on the internet. (&lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=31734585#31734585&quot;&gt;14 stars&lt;/a&gt;)&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;[in response to a message containing nothing but noise] unnecessary (&lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=32514741#32514741&quot;&gt;4 stars&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h3&gt;Arrogance, Drama&lt;sup&gt;&lt;a href=&quot;http://chat.stackexchange.com/search?q=drama&amp;amp;Room=240&amp;amp;page=1&amp;amp;pagesize=50&amp;amp;sort=stars&quot;&gt;&lt;a href=&quot;https://i.stack.imgur.com/R0IqR.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;1&lt;/a&gt;&lt;/a&gt;&lt;/sup&gt;&lt;/h3&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Nobody said that. Don't create drama for no reason (&lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=32506624#32506624&quot;&gt;9 stars&lt;/a&gt;)&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Stop it already with the artificial drama! (&lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=30916483#30916483&quot;&gt;7 stars&lt;/a&gt;)&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;I don't mind having you in this room, but sometimes I wonder if you're just intentionally trying to create drama that wasn't there. (&lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=30934732#30934732&quot;&gt;6 stars&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Did you notice how all three above are directed at the same user? Over an unacceptably long period of time? Weird, seeing how their response to my statement&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;You'd think that after being repeatedly called out for sub-optimal behaviour in chat, one would try to reflect and improve. But somehow that doesn't seem to apply to a few members here. (&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/32306790#32306790&quot;&gt;link&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;was&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Me excluded. :{ [...], however, included.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;which is provably false and defintely&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;a bit arrogant. (&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/32306810#32306810&quot;&gt;2 stars&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h3&gt;Users&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;We all know who the users are that cause all of these and more problems. But let's take a look at the messages per user in &lt;em&gt;Trash&lt;/em&gt; that have been manually moved there by a mod:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;TùxCräftîñg:             95&#xA;LegionMammal978:         56&#xA;CrazyPython:             22&#xA;Matthew Roh:             16&#xA;EᴀsᴛᴇʀʟʏIʀᴋ:             16 (mostly msgs containing only carets)&#xA;R. Kap:                  15&#xA;Erik The Golfer:         14&#xA;CᴏɴᴏʀO'Bʀɪᴇɴ:            9&#xA;betseg:                  8&#xA;Molarmanful:             8&#xA;BusinessCat:             7&#xA;Destructible Watermelon: 7&#xA;dorukayhan:              6&#xA;Bálint:                  5&#xA;Mars Ultor:              3&#xA;zyabin101:               3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The root of basically all noise and low quality messages is TùxCräftîñg. Despite them being relatively &quot;new&quot;, they already hold the questionable record of the most messages &lt;em&gt;so bad&lt;/em&gt; they are already trashed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;zyabin101 is also on that list. But rather than posting straight up nonsense, they like to stir up trouble (see above evidence) and are generally completely resistant to any kind of notice by other users about their behavior. Here's a recent example of what I mean:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;@zʏᴀʙiɴ101 Please don't answer for other people. (&lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=30140641#30140641&quot;&gt;link&lt;/a&gt;)&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;@zyabin101 Why do you always answer for other people. (&lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=31429338#31429338&quot;&gt;link&lt;/a&gt; and then again &lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=31429517#31429517&quot;&gt;here&lt;/a&gt; and &lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=31429520#31429520&quot;&gt;here&lt;/a&gt; and &lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=32378783#32378783&quot;&gt;here&lt;/a&gt;)&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;@zyabin101 minxomat still has a very valid point that you should probably not answer for other people. (&lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=32379239#32379239&quot;&gt;link&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;And just denying it even when caught in the act:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/R0IqR.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/R0IqR.png&quot; alt=&quot;chat screenshot&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;What to do&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;See my answer for my suggestions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question for you is:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What specific action can be taken to mitigate this behavior?&lt;/li&gt;&#xA;&lt;li&gt;What is our long term strategy? &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;IMO it's time to define hard(er) limits for this behavior (i.e. &lt;em&gt;when&lt;/em&gt; to apply a ban etc.). Tips like &quot;set an example&quot; prove to be a bit useless, because that (apparently) does &lt;em&gt;nothing&lt;/em&gt; to improve overall quality. Use the linked meta question for such tips. This question is more aimed at moderators.&lt;/p&gt;&#xA;" OwnerDisplayName="user42643" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2016-10-02T16:47:27.587" Title="We need to talk about Chat" Tags="|discussion|chat|" AnswerCount="2" CommentCount="23" ContentLicense="CC BY-SA 3.0" />
  <row Id="10173" PostTypeId="2" ParentId="10172" CreationDate="2016-09-26T19:30:38.373" Score="23" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;This is one of those situations where I feel a temporary chat ban would be in order (&lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=32538209#32538209&quot;&gt;3 stars&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Exactly. Just because chat is a general discussion, doesn't mean the discussion has to be &lt;em&gt;this&lt;/em&gt; low quality. We learned over the past few months, that giving tips to users to better themselves is not very effective.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I suggest:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;keep trashing conversations that have no place in TNB and thus raise the quality new users experience in our chatroom&lt;/li&gt;&#xA;&lt;li&gt;start applying chat bans if users refuse to respond to criticism (especially if that criticism comes from a moderator)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user42643" LastEditorDisplayName="user42643" LastEditDate="2016-09-26T19:40:33.793" LastActivityDate="2016-09-26T19:40:33.793" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="10174" PostTypeId="2" ParentId="10127" CreationDate="2016-09-26T20:29:07.757" Score="-11" Body="&lt;h1&gt;Forbid the use of a leaderboard snippet which sorts all answers by byte count&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A leaderboard which lists all answers by byte count suggests that there is a competition between languages. If we don't want that, we should't use this kind of leaderboard.&lt;/p&gt;&#xA;" OwnerUserId="46901" LastActivityDate="2016-09-26T20:29:07.757" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10179" PostTypeId="2" ParentId="2140" CreationDate="2016-09-27T17:25:23.127" Score="0" Body="&lt;h2&gt;Largest Number Given Digits and Operators&lt;/h2&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a list of digits (0-9) and operators (+, -, /, *), output the largest number that can be formed using those digits and operators, as well as the mathematical formula used to create this number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All digits and operators must be used once and only once&lt;/li&gt;&#xA;&lt;li&gt;Parenthesis may be used in the outputted mathematical formula&lt;/li&gt;&#xA;&lt;li&gt;The outputted mathematical formula must be valid in an interactive Python shell (Note, this means [&quot;--&quot;, &quot;---&quot;, etc.], &quot;//&quot;, &quot;**&quot;, and [&quot;++&quot;, &quot;+++&quot;, etc.] are all valid operations that can be used in the output)&lt;/li&gt;&#xA;&lt;li&gt;Base 10 will be used&lt;/li&gt;&#xA;&lt;li&gt;For multiple different formulas that result in the same maximum number, output whichever one&lt;/li&gt;&#xA;&lt;li&gt;Input may contain any number of digits and operators&lt;/li&gt;&#xA;&lt;li&gt;Answers can be a function or program, and will be scored in bytes&lt;/li&gt;&#xA;&lt;li&gt;No loopholes or built-ins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example I/O&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: [1, 4, 3, *, +]&#xA;Output: +31*4&#xA;        124&#xA;&#xA;Input: [1, 2, 0, '+']&#xA;Output: +210&#xA;        210&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="47302" LastActivityDate="2016-09-27T17:25:23.127" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10182" PostTypeId="2" ParentId="2140" CreationDate="2016-09-28T12:01:35.537" Score="1" Body="&lt;h1&gt;Interleave your code with the input&lt;/h1&gt;&#xA;&lt;p&gt;Given an input string, interleave this string with the source code of your solution.&lt;/p&gt;&#xA;&lt;p&gt;For example, if your code is &lt;code&gt;abcd&lt;/code&gt; and the input is &lt;code&gt;1234&lt;/code&gt;, then your program must output &lt;code&gt;1a2b3c4d&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If your code is shorter than the input, then it must loop back to the beginning of your code. For example, if your code is &lt;code&gt;abcd&lt;/code&gt; and the input is &lt;code&gt;123456&lt;/code&gt;, then your program must output &lt;code&gt;1a2b3c4d5a6b&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If your code is longer than the input, then only part of your code will be interleaved with the input. For example, if your code is &lt;code&gt;abcd&lt;/code&gt; and the input is &lt;code&gt;12&lt;/code&gt;, then your program must output &lt;code&gt;1a2b&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Inputs and outputs&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The input string will only contain characters which are valid string characters in your language.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The input may be taken through &lt;code&gt;STDIN&lt;/code&gt;, as a function argument, or anything similar.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The output may be printed to &lt;code&gt;STDOUT&lt;/code&gt;, returned from a function, or anything similar.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-28T12:01:35.537" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10184" PostTypeId="1" AcceptedAnswerId="10185" CreationDate="2016-09-28T20:13:33.850" Score="28" ViewCount="568" Body="&lt;p&gt;Occasionally I see other users posting links to their own answers or challenges in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;. Is this OK? Can I promote my own posts as well?&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="68942" LastEditDate="2021-04-04T15:51:43.963" LastActivityDate="2021-04-04T15:51:43.963" Title="Is it OK to promote my own posts in chat?" Tags="|discussion|faq|policy|chat|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10185" PostTypeId="2" ParentId="10184" CreationDate="2016-09-28T20:13:33.850" Score="41" Body="&lt;p&gt;Promoting your own posts is definitely OK, but there are some very important guidelines to consider. Promoting your own posts is usually OK if&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It's relevant to the topic of discussion.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Hey, have we had a challenge about finding the smallest prime larger than &lt;strong&gt;N&lt;/strong&gt;? --User1&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Yes [link to own post]. --User2&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Or&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;What's your favorite answer you've ever posted? --User1&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;I'm really proud of my [hexagony quine]. It took a lot of work. --User2&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You want feedback on something.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I'd like to post [this sandboxed challenge] soon. Do you see any problems with it? &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Or&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I wrote [this python answer], but it seems longer than it should be. Can you see any way to refactor out the for loop?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It's done in &lt;em&gt;moderation&lt;/em&gt;. Think of it this way: The less you promote your own posts, the more likely you are to get feedback if/when you do.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This one is a little bit of an edge-case, but it's also fine to promote your own posts if you genuinely think that the users in the chatroom would find it interesting. For example, if you &lt;a href=&quot;https://codegolf.stackexchange.com/q/11880/31716&quot;&gt;built a working game of Tetris in Conway's Game-of-life&lt;/a&gt;. Or if you wrote a &lt;a href=&quot;https://codegolf.stackexchange.com/a/68494/31716&quot;&gt;&quot;Hello World&quot; program in less than 78 bytes of brainf*ck&lt;/a&gt;. Of if you found a trick in Python 3.7 that revolutionizes golfing. All of these are something &lt;em&gt;really&lt;/em&gt; interesting (and impressive) and odds are most users would be interested in seeing it. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The rule of thumb to follow is &quot;If somebody else had posted this, would I still really want to share it?&quot; If the answer is yes, then go ahead.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;However, you probably should &lt;em&gt;not&lt;/em&gt; promote your own posts if:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It already has, or soon will be posted by one of the feeds in the room. Right now, we have feeds for new main posts, new meta posts, new sandboxed posts, new featured posts, new standard loopholes, and new bounties with no deadline. (&lt;a href=&quot;https://chat.stackexchange.com/rooms/info/240/the-nineteenth-byte?tab=feeds&quot;&gt;source&lt;/a&gt;) If you have recently posted a challenge, posting a onebox to it 30 seconds later is rude and unnecessary, since it will probably be posted by the feed within 10-15 minutes.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It is to a different site. &lt;em&gt;Unless&lt;/em&gt; of course it's directly related a question another user has, for example&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Hey, I'm getting this weird error when I do foo in C++. --User1&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;I wrote an answer about that [here]. --User2&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;is acceptable, whereas&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I just wrote the awesomest answer of all time! [Gimme upvotes!]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I'm having [this problem] over on SO. ANSWER IT FOR ME!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;are &lt;strong&gt;&lt;em&gt;not&lt;/em&gt;&lt;/strong&gt;. (Bolded &lt;em&gt;and&lt;/em&gt; italicized for emphasis)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You have already promoted the same post recently, or many times before. I don't want to set any hard and fast numbers, but if you are sharing links to your posts more than 3-4 times a day, or multiple times in under 20 minutes, you're doing it wrong and annoying other users. Excessively doing this may result in trashing messages, and/or temporary bans.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You act &lt;em&gt;entitled&lt;/em&gt; to upvotes. Hey, listen I understand. We all like the little green notification in our browser. However remember, and this is important: &lt;strong&gt;nobody owes you an upvote.&lt;/strong&gt; Votes, up or down, are given out according to the worth of the post, and begging for votes does not make your post any more worthy. Messages like&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;No love for [my last answer]?&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Wow, I put 2 hours of work into [this answer], and I only got two votes?&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;I'm at 997 rep! Only one more vote needed to hit 1k! &lt;em&gt;hint hint...&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;are utter garbage, and add nothing to the site, the chatroom, or the community.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;None of these are rules &lt;em&gt;per se&lt;/em&gt;, but they are very important to consider. In short, before promoting your own posts, ask yourself: &quot;Is this link &lt;em&gt;contributing&lt;/em&gt; to the current discussion?&quot; If the answer is probably yes, feel free to go ahead and post it. Otherwise, it's a good exercise in restraint.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="34718" LastEditDate="2017-04-27T13:32:16.823" LastActivityDate="2017-04-27T13:32:16.823" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10186" PostTypeId="1" CreationDate="2016-09-28T20:23:53.663" Score="3" ViewCount="610" Body="&lt;p&gt;Jelly is one of those languages that doesn't use ANSI text in its code. Why should we score Jelly by its character count when each character can take up to 4 bytes?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, take this answer (Authored by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ḃ2-*µSN;+\&amp;gt;-Ạ&#xA;1Ç#Ṫḃ2ṭ2;1ị⁾][&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;From a character counter, one can see that this is exactly 28 characters (which is how Jelly is currently scored). However when I save this into a txt file (with no metadata in the file size), it could be up to 112 bytes (28*4). However, when saved onto an uncompressed disk, it is 60 bytes. This is still many times more than what is currently scored. I may reference my &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10141/how-should-we-handle-excel-answers-with-drag-down-formulas/10142#10142&quot;&gt;Excel scoring&lt;/a&gt; thread, with users agreeing that excel can be scored by file size in indeterminate cases. It seems that the same should be done with Jelly- as its' characters DO take up more than one byte.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;IF as a community we somehow decide that this isn't the case, and we should judge jelly by its character count alone, Then I will have something to introduce to the community soon-ish.&lt;/p&gt;&#xA;" OwnerDisplayName="user56309" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-10-28T19:26:18.070" Title="Jelly- can we really score it by character count?" Tags="|discussion|scoring|" AnswerCount="2" CommentCount="5" ClosedDate="2016-10-31T16:41:35.633" ContentLicense="CC BY-SA 3.0" />
  <row Id="10187" PostTypeId="2" ParentId="10186" CreationDate="2016-09-28T20:30:14.610" Score="14" Body="&lt;p&gt;Jelly uses &lt;a href=&quot;https://github.com/DennisMitchell/jelly/wiki/Code-page&quot; rel=&quot;nofollow noreferrer&quot;&gt;its own code page&lt;/a&gt; and the interpreter is capable of reading files encoded in this code page. Hence, it's actually possible to feed a working file of the claimed size to the interpreter and therefore the byte count is completely legitimate. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5879/8478&quot;&gt;Here is the relevant meta post&lt;/a&gt; which says that answers can use any encoding of their choice, as long as it existed before the challenge and is actually executable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that this doesn't give Jelly any unfair advantage over a language that doesn't invent its own code page: one could equally well write a golfing language which uses all 256 characters of some standard code page like the extended ASCII standard ISO 8859-1. It's just that in that case a lot of the characters would be unprintables, which would be a lot more annoying to work with. The only advantage Jelly gains from defining its own code page is that all the characters are printable (and even typeable on an International US keyboard layout) and allow Dennis to choose nicer mnemonics for the individual commands.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-09-28T20:34:23.760" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="10188" PostTypeId="2" ParentId="10186" CreationDate="2016-09-28T21:22:47.097" Score="10" Body="&lt;p&gt;As Martin already explained, Jelly uses a custom code page that is incompatible with ASCII and UTF-8. This isn't a made-up way of counting bytes, but the Jelly interpreter can take the source code (and input/output, if desired) using this code page. This is actually the default for the official interpreter, which requires the &lt;code&gt;u&lt;/code&gt; flag to process UTF-8 encoded source code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For &lt;a href=&quot;https://codegolf.stackexchange.com/a/94676/12012&quot;&gt;the answer in question&lt;/a&gt;, the byte count with Jelly's code page is in fact 28 bytes, and the 28 byte file is functionally equivalent to the UTF-8 encoded 44 byte file.&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-bash prettyprint-override&quot;&gt;&lt;code&gt;$ cat nest-utf8.jelly; echo&#xA;ḃ2-*µSN;+\&amp;gt;-Ạ&#xA;1Ç#Ṫḃ2ṭ2;1ị⁾][&#xA;$ wc -c nest-utf8.jelly&#xA;44 nest-utf8.jelly&#xA;$ xxd -g 1 nest-cpj.jelly&#xA;0000000: e7 32 2d 2a 09 53 4e 3b 2b 5c 3e 2d ab 7f 31 0e  .2-*.SN;+\&amp;gt;-..1.&#xA;0000010: 23 ce e7 32 e0 32 3b 31 d8 8e 5d 5b              #..2.2;1..][&#xA;$ wc -c nest-cpj.jelly&#xA;28 nest-cpj.jelly&#xA;$ jelly fun nest-utf8.jelly 8&#xA;[[[[]]]]&#xA;$ jelly fn nest-cpj.jelly 8&#xA;[[[[]]]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If Jelly was only able to process UTF-8 encoded files, I would have to score (and would have) the answer as 44 bytes. However, since there is a 28 byte file that solves the task at hand, I am able to claim a score of 28 bytes.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-09-28T21:32:30.180" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10190" PostTypeId="1" CreationDate="2016-09-29T06:13:48.417" Score="1" ViewCount="135" Body="&lt;p&gt;So I’ve been thinking about creating a golflang somewhat inspired by Jelly, but I’ve decided for it to be encoded in a 9-bit codepage, so that there are 512 possible characters to use. I can come up with a few different ways to score this, but I want to know what the recommended scoring method would be.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Just count each character as 1 byte. This doesn’t seem fair, though, since there’s more information per character than in languages with an 8-bit codepage, so I wouldn’t recommend this.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Count each character as 1.125 bytes. This would probably be the closest thing there is to a direct equivalence. The final result can either be left as a fractional value or rounded up, since a file in this encoding would have to be padded with up to seven bits at the end to make it an integer number of bytes. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Count each character as 2 bytes, as in UTF-16. This would be the way my files would normally be stored before being compressed into the 1.125 bytes per character format.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;What do you think?&lt;/p&gt;&#xA;" OwnerUserId="55755" LastActivityDate="2016-09-29T06:13:48.417" Title="How to score a golflang with a 9-bit character set" Tags="|discussion|code-golf|scoring|characters|" AnswerCount="0" CommentCount="8" ClosedDate="2016-09-29T21:54:10.893" ContentLicense="CC BY-SA 3.0" />
  <row Id="10191" PostTypeId="2" ParentId="2140" CreationDate="2016-09-29T12:53:55.107" Score="4" Body="&lt;h1&gt;Insert Random Squares Here&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;hr&gt;&lt;sup&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output+random&quot;&gt;Related challenges&lt;/a&gt;.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&amp;lt; Insert sales pitch here &gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a width and a height, output an image filled with random squares.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program/function is given a width and a height in pixels.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;E.g.:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;yourProgram &amp;lt;width&amp;gt; &amp;lt;height&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You must display the result on the screen, or output an image file in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9093/13486&quot;&gt;any acceptable format&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The number of squares to be generated is a random natural number between &lt;code&gt;sqrt(w * h) / 2&lt;/code&gt; and &lt;code&gt;sqrt(w * h) * 2&lt;/code&gt; (inclusive).&lt;/li&gt;&#xA;&lt;li&gt;Each square's color will be randomly generated for each with &lt;em&gt;R&lt;/em&gt;, &lt;em&gt;G&lt;/em&gt;, &lt;em&gt;B&lt;/em&gt; ranging from 0-255 and with &lt;em&gt;alpha&lt;/em&gt; values ranging from 1-255.&lt;/li&gt;&#xA;&lt;li&gt;Each square's width/height will be a random value between &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;min(w, h)&lt;/code&gt; (inclusive)&lt;/li&gt;&#xA;&lt;li&gt;Each square must be placed randomly. Part of the square may be outside the output image, as long as at least one pixel of the square is visible.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Placement at sub-pixel coordinates  (e.g. x=0.239420, y=2.8298329) is allowed but not required.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Each possible output must be equally likely to occur.&lt;/li&gt;&#xA;&lt;li&gt;The output must have a white or transparent background.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Input and randomly generated parameters&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;Width: 10&#xA;Height: 20&#xA;&#xA;Maximum square height: 10&#xA;&#xA;Minimum number of squares: 8 &lt;sub&gt;Math.sqrt(10*20)/2 = 7.0710678118654755&lt;/sub&gt;&#xA;Maximum number of squares: 28 &lt;sub&gt;Math.sqrt(10*20)*2 = 28.284271247461902&lt;/sub&gt;&#xA;&#xA;Number of squares  in this example: 8&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://web.archive.org/web/20170919045102if_/http://imgh.us/Insert_Random_Squares_Here_PPCG_challenge_--_Example_output_1.export.svg&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Scaled 2000%:&lt;br&gt;&#xA;&lt;img src=&quot;https://web.archive.org/web/20170919045102if_/http://imgh.us/Insert_Random_Squares_Here_PPCG_challenge_--_Example_output_1.export.svg&quot; width=&quot;200&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output with the parts of the squares that are off-screen&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;(Scaled 2000%.) The gray part is the part that is displayed on the screen.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://web.archive.org/web/20170919045102if_/http://imgh.us/Insert_Random_Squares_Here_PPCG_challenge_--_Example_output_1_-_with_squares_out_of_view.export.svg&quot; width=&quot;427&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="13486" LastEditorUserId="13486" LastEditDate="2017-11-23T13:45:52.017" LastActivityDate="2017-11-23T13:45:52.017" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10192" PostTypeId="2" ParentId="2140" CreationDate="2016-09-29T14:15:57.280" Score="1" Body="&lt;h2&gt;Priority to the right&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to regulate traffic on a crossroads. There are 4 roads coming from north, east, south and west.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input is a string representing the upcoming traffic on each road. &#xA;For example, &lt;code&gt;NNNWS&lt;/code&gt; indicates there is a total of 5 cars: three at the north, one at the west and one at the south. The order has no importance here, &lt;code&gt;NNNWS&lt;/code&gt; is equivalent to &lt;code&gt;WNNSN&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must output the order in which the cars should go, using the priority to the right rule: cars coming from the south must let cars coming from east go first, east gives way to north, north gives way to west and west gives way to south.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, with the input &lt;code&gt;NNNWS&lt;/code&gt;, the south car should go first, then the west car, then the 3 north cars. The output should then be &lt;code&gt;SWNNN&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are some indecidable cases, for example &lt;code&gt;NS&lt;/code&gt; or &lt;code&gt;NNWSE&lt;/code&gt; : you should then output the string &lt;code&gt;stuck&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test cases&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;N =&amp;gt; N&#xA;NW =&amp;gt; WN&#xA;NWS =&amp;gt; SWN&#xA;SNW =&amp;gt; SWN&#xA;SSSSS =&amp;gt; SSSSS&#xA;ENNNNES =&amp;gt; NNNNEES&#xA;NS =&amp;gt; stuck&#xA;NNWSE =&amp;gt; stuck&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="13798" LastActivityDate="2016-09-29T14:15:57.280" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10193" PostTypeId="2" ParentId="2140" CreationDate="2016-09-29T17:03:21.573" Score="-2" Body="&lt;h1&gt;Make a dummy C program&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We all know the feeling. You have written a short, efficient and readable one-liner that's the perfect solution to the problem. Then your code-illiterate boss looks over your shoulder and is not very happy that you've spent an entire paid hour producing &quot;nothing&quot;. You &lt;em&gt;could&lt;/em&gt; politely explain the situation to your boss, complete with a demonstration that your code does what it should. Or, because talking to people is Hard Work&amp;trade;, you could fake it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a program that takes a list of keywords as input, and outputs dummy C code that looks like it does something to do with those words. &lt;strong&gt;&lt;em&gt;Sandbox note:&lt;/strong&gt; not happy with the wording in final bit here.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if the inputs were &lt;code&gt;integral&lt;/code&gt;, &lt;code&gt;formula&lt;/code&gt;, &lt;code&gt;math&lt;/code&gt;, &lt;code&gt;proof&lt;/code&gt;, &lt;code&gt;fit&lt;/code&gt; and &lt;code&gt;square&lt;/code&gt;, the output might be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#include &amp;lt;math.h&amp;gt;&#xA;#include &amp;lt;setjmp.h&amp;gt;&#xA;double* squarefit(int integral, float* mathproof)&#xA;{&#xA;    char **integralb={{0}};&#xA;    double square[integral];&#xA;    int i=0;&#xA;&#xA;    //integral math formula fit&#xA;    for(integralb[0][0]=(char)erff(*mathproof);isnan((double)++integral);i++) {&#xA;        return hypot(sqrt(square[integral]),integral)?square:square;&#xA;        printf(*integralb,integral,*mathproof);&#xA;    }&#xA;    setjmp((struct __jmp_buf_tag*)mathproof+(int)(abs(--integral)-expm1l(integral)));&#xA;    longjmp(0,0);&#xA;    return square;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Although it doesn't have to &lt;em&gt;do&lt;/em&gt; anything, or even run successfully properly, the source code produced by your program must compile in &lt;code&gt;gcc&lt;/code&gt; (no additional options) without fatal errors. You do not need to provide a &lt;code&gt;main&lt;/code&gt; function; if you don't, expect the line &lt;code&gt;int main(void){}&lt;/code&gt; to be appended to the output file before it is compiled.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, so the best-liked answer will win. However, voters should keep these questions in mind when assessing the submissions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Does the produced source code look like it does the expected task? &lt;em&gt;Yes.&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;Does the produced source code look like it has taken a long time to produce? &lt;em&gt;Yes.&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;Do different inputs result in the same program, just with different variable names? &lt;em&gt;No.&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;Does the produced source code look like the same code repeated over and over? &lt;em&gt;No.&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;Do your &lt;a href=&quot;//xkcd.com/627/&quot; rel=&quot;nofollow noreferrer&quot;&gt;parents, grand-parents, co-workers or other &quot;not computer people&quot;&lt;/a&gt; think the produced source code was something to do with the input keywords (optional)? &lt;em&gt;Yes.&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;Would &lt;em&gt;you&lt;/em&gt; think the produced source code was written by a person with knowledge of the C language, if you did not know that it was just dummy code (optional)? &lt;em&gt;Yes.&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;Does the code look readable (e.g. ungolfed)? &lt;em&gt;Yes.&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Not all of the standard loopholes apply for this challenge. For example, you mignt use external resources, such as library files or an indexable website. However, voters should use their discretion as to what is reasonable and what is not (such as expecting the &quot;keywords&quot; to be in a format that includes a high-quality, valid C program).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Sandbox note:&lt;/strong&gt; how to finish challenge body?&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="43394" LastActivityDate="2016-09-29T17:03:21.573" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="10194" PostTypeId="2" ParentId="1061" CreationDate="2016-09-29T17:55:38.560" Score="-31" Body="&lt;h2&gt;Sending error messages to the null device&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;... instead of avoiding them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This should either be forbidden or add to the byte count, as setting options to suppress messages do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/94852#94852&quot;&gt;example&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="55735" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-09-29T17:55:38.560" CommentCount="3" CommunityOwnedDate="2016-09-29T17:55:38.560" ContentLicense="CC BY-SA 3.0" />
  <row Id="10195" PostTypeId="2" ParentId="2140" CreationDate="2016-09-29T18:04:14.120" Score="0" Body="&lt;h1&gt;The one-looper ASCII box&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Intro&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I saw this one in one of my university programming textbooks as an &quot;advanced&quot; exercise and I thought it would fit very well here.  &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Task&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your program have to ask for an input number and draw a box with the size of the given number and a cross in it.&lt;br&gt;&#xA;Example if the number is 7:  &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+-------+&#xA;|\     /|&#xA;| \   / |&#xA;|  \ /  |&#xA;|   X   |&#xA;|  / \  |&#xA;| /   \ |&#xA;|/     \|&#xA;+-------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Example if the number is 10:  &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+----------+&#xA;|\        /|&#xA;| \      / |&#xA;|  \    /  |&#xA;|   \  /   |&#xA;|    \/    |&#xA;|    /\    |&#xA;|   /  \   |&#xA;|  /    \  |&#xA;| /      \ |&#xA;|/        \|&#xA;+----------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The minimum width is 1 and it looks like this:  &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+-+&#xA;|X|&#xA;+-+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Notice that with an odd size, there is an &lt;strong&gt;X&lt;/strong&gt; in the middle.  &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The hard part&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;In your program only one function is allowed (main) and in the main function &lt;strong&gt;there can be only one loop&lt;/strong&gt; and that loop can only have &lt;strong&gt;one&lt;/strong&gt; statement which can't be &lt;em&gt;if&lt;/em&gt;. The shortest answer wins!  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;note:&lt;/em&gt; Sorry for the messy description but I had to translate it from my native language.&lt;/p&gt;&#xA;" OwnerUserId="60203" LastEditorUserId="60203" LastEditDate="2016-09-29T18:35:54.337" LastActivityDate="2016-09-29T18:35:54.337" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10196" PostTypeId="1" CreationDate="2016-09-29T18:59:43.177" Score="3" ViewCount="88" Body="&lt;p&gt;The tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/feasibility&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;feasibility&amp;#39;&quot; rel=&quot;tag&quot;&gt;feasibility&lt;/a&gt; is only used in two questions, has no wiki, and the questions are both tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/feasibility&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;feasibility&amp;#39;&quot; rel=&quot;tag&quot;&gt;feasibility&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These questions are asked by 2 different users. Here they are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/75423/jsfk-with-only-5-symbols&quot;&gt;JSF**k with only 5 symbols?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/94811/could-you-repeat-yourself-aka-could-a-doubled-character-solution-exist-in-jav&quot;&gt;&amp;quot;Could you repeat yourself?&amp;quot; aka Could a doubled character solution exist in JavaScript?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There are two options this question covers:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Burninate or synonimize with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;, because the tag is not useful at all.&lt;/li&gt;&#xA;&lt;li&gt;Make tag wiki, because this tag has a use, but it is not well-documented.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If not the first, the second option should apply, because &lt;em&gt;what is this tag for?&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;EDIT&lt;/strong&gt;: The tag seems to have been burninated.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2017-08-08T08:36:36.823" LastActivityDate="2017-08-08T08:36:36.823" Title="The tag [feasibility] and its lack of proper documentation" Tags="|discussion|tags|" AnswerCount="0" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10199" PostTypeId="1" CreationDate="2016-09-29T19:46:20.490" Score="7" ViewCount="473" Body="&lt;p&gt;Essentially, a user's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/94880/0-0000000000000000001/94901#94901&quot;&gt;answer in Excel (now deleted)&lt;/a&gt; uses the drag-down formula feature of Excel, as described in the linked related meta question. I thought that from the highest voted &lt;em&gt;answer&lt;/em&gt; to that question, we had, by community consensus, determined that mouse interaction is unnecessary. I personally take it to mean that mouse interaction of that type is not a valid form of &quot;input&quot; by default.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is no related &quot;input&quot; type associated with mouse input listed in the default I/O methods in the relevant meta question. I don't think the mouse should be used to in any way affect the program's structure.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As we said, this allows an arbitrary amount of rows or columns in this case, so what if I create a language where the numbers of rows or columns I drag determines the output entirely?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To be clear, Excel only happens to be the catalyst for this question, but there are plenty of other situations where mouse input is possible -- Minecraft, Terraria, Logisim, LabVIEW, HTML+CSS, Scratch ...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, to remove any doubts, what mouse interaction is allowed to be used for input/output?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Related:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10141/34718&quot;&gt;How should we handle Excel answers with drag-down formulas?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/34718&quot;&gt;Default for Code Golf: Input/Output methods&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-11-09T18:53:01.347" Title="What mouse interactions are allowed by default as part of Input/Output?" Tags="|discussion|policy|" AnswerCount="2" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="10201" PostTypeId="2" ParentId="2140" CreationDate="2016-09-29T20:40:50.437" Score="0" Body="&lt;h2&gt;Interpret loose ranges &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/timopomer/ListSharp&quot; rel=&quot;nofollow noreferrer&quot;&gt;ListSharp&lt;/a&gt; is an interpreted programming language that has many features, one of those features is a 1 index based range creator that works like this:&lt;/p&gt;&#xA;&lt;p&gt;You define a range as &lt;code&gt;(INT) TO (INT)&lt;/code&gt; or just &lt;code&gt;(INT)&lt;/code&gt; where both or the single int can go from min to &lt;a href=&quot;https://en.wikipedia.org/wiki/2147483647_(number)&quot; rel=&quot;nofollow noreferrer&quot;&gt;max int32 value&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Then you can use those ranges to extract elements of an array without fearing to overstep it's boundaries&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;therefore:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;1 TO 5&lt;/code&gt; generates: &lt;code&gt;{1,2,3,4,5}&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;3&lt;/code&gt; generates: &lt;code&gt;{3}&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Ranges can be added up using the &lt;code&gt;AND&lt;/code&gt; operator&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;1 TO 5 AND 3 TO 6&lt;/code&gt; generates: &lt;code&gt;{1,2,3,4,5,3,4,5,6}&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;remember this works with negative numbers as well&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;3 TO -3&lt;/code&gt; generates: &lt;code&gt;{3,2,1,0,-1,-2,-3}&lt;/code&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;The challenge is the following:&lt;/h1&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;A character array and the previously defined range clause as a string&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;The elements at the 1 index based locations of the range (non existing/negative indexes translate to an empty character)&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;How to win&lt;/h1&gt;&#xA;&lt;p&gt;Create the program with the shortest byte count&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;input array is:&#xA;{'H','e','l','l','o',' ','W','o','r','l','d'}&#xA;&#xA;range clause:&#xA;&amp;quot;1 TO 3&amp;quot; =&amp;gt; {'H','e','l'}&#xA;&amp;quot;5&amp;quot; =&amp;gt; {'o'}&#xA;&amp;quot;-10 TO 10&amp;quot; =&amp;gt; {'','','','','','','','','','','','H','e','l','l','o',' ','W','o','r','l'}&#xA;&amp;quot;0 AND 2 AND 4&amp;quot; =&amp;gt; {'','e','l'}&#xA;&amp;quot;8 TO 3&amp;quot; =&amp;gt; {'o','W','','o','l','l'}&#xA;&amp;quot;-300 AND 300&amp;quot; =&amp;gt; {'',''}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="44757" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-29T20:53:02.370" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10202" PostTypeId="2" ParentId="10199" CreationDate="2016-09-29T21:34:26.690" Score="-1" Body="&lt;h2&gt;Mouse inputs should be allowed so long as they're quantifiable, and can be represented in the form of the specific input upon which the challenge specifies.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Mouse inputs are no different than keyboard inputs, and to ban them in challenges would be ridiculous and unlike the PCG community. We've promoted time and again new and improved ways to represent data, weather it be a new codec, like in jelly, cells of hexagony, or even languages that are made here for golfing by our own users. I think that mouse strokes should be allowed, just like these other languages and their data representations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The worry that I see most PCG users expressing is that there's not clear definition of what a mouse stroke is, and one can do with a mouse stroke. So Here is what I propose that a mouse stroke should and shouldn't do:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;A mouse stroke &lt;strong&gt;Should&lt;/strong&gt;&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Represent some sort of quantifiable data  &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;ONLY be part of the input.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Have said data be in be same EXACT format as the challenge gives. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Be significant and relevant to the input in some way. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;A mouse stroke &lt;strong&gt;Shouldn't&lt;/strong&gt;&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Alter source code in any way  &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;give any data to the program that wouldn't be covered as part of the specified input&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;be overly complicated or burden the user.  &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;be part of the source code to be scored&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples of valid mouse input descriptions:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Click the button &lt;code&gt;N&lt;/code&gt; times where &lt;code&gt;N&lt;/code&gt; is your desired input.  &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;click and drag a formula &lt;code&gt;N&lt;/code&gt; cells down where &lt;code&gt;N&lt;/code&gt; is your desired input&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Draw an &lt;code&gt;X&lt;/code&gt; by &lt;code&gt;Y&lt;/code&gt; square with the mouse, where &lt;code&gt;X&lt;/code&gt; and &lt;code&gt;Y&lt;/code&gt; are as specified in the challenge.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples of INvalid mouse input descriptions:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Select the source code and delete some bits depending on your input..  &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;click ax X 35,Y54, and drag to X78,Y160, then click play.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I drug a formula across a range in excel &lt;em&gt;then&lt;/em&gt; submitted it for scoring.  &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The challenge requires a string input, but you'll have to enter it on your mouse in Morse code. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user56309" LastEditorDisplayName="user56309" LastEditDate="2016-09-29T21:51:49.253" LastActivityDate="2016-09-29T21:51:49.253" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10203" PostTypeId="1" CreationDate="2016-09-29T21:50:57.490" Score="7" ViewCount="163" Body="&lt;p&gt;Sometimes it would be quite useful in some languages to define two overloaded functions/methods as one answer. That is, instead of doing this (using Java as an example):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;int f(Object o){if (o instanceof Integer) ... else if (o instanceof String) ...}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You would do this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;int f(Integer i){...}&#xA;int f(String s) {...}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In case of Java, you don't have to change to call site, but I'm not sure if this applies to all languages.&lt;/p&gt;&#xA;" OwnerUserId="46901" LastActivityDate="2016-09-30T00:33:49.497" Title="Is it OK to define an overloaded function?" Tags="|discussion|rules|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10205" PostTypeId="2" ParentId="10203" CreationDate="2016-09-29T23:48:11.710" Score="9" Body="&lt;p&gt;Yes, that's perfectly fine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I could see this being useful for the &lt;a href=&quot;https://codegolf.stackexchange.com/q/94832/45941&quot;&gt;recent challenge&lt;/a&gt; that requires different outputs based on if the input is an integer or a float/decimal.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-09-30T00:33:49.497" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10208" PostTypeId="2" ParentId="2140" CreationDate="2016-09-30T07:51:28.720" Score="0" Body="&lt;h2&gt;Balanced Columns&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I have a number of paragraphs of various heights which I would like to be distributed between some columns as evenly as possible. Here &lt;em&gt;evenly&lt;/em&gt; means that you should minimise the total height of the tallest column, and then maximise the height of the shortest column, excluding empty columns.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input will be an integer, representing the number of columns to be output, and an array of integers, representing the paragraph heights in lines. There is more than one way to represent the output; it could be an array (one for each column) of arrays of paragraphs, or it could be an array (one for each paragraph) of columns. (Please indicate whether your arrays are 0- or 1-based.) You may use any convenient format for (e.g. the number of columns as a command-line parameter and the array on STDIN) for I/O.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because the paragraphs are double-spaced, there will be at least two lines in each paragraph, but if you prefer, your answer can take the double-spacing into account internally.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Within each column, paragraphs should be listed in ascending order, and the columns should be listed in ascending order of their first paragraph. Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2, [2, 3, 4, 5, 6] -&amp;gt; [2, 3, 5], [4, 6] or [0, 0, 1, 0, 1]&#xA;3, [2, 3, 4, 5, 6] -&amp;gt; [2, 5], [3, 4], [6] or [0, 1, 1, 0, 2]&#xA;4, [2, 3, 4, 5, 6] -&amp;gt; [2, 3], [4], [5], [6] or [0, 0, 1, 2, 3]&#xA;5, [2, 3, 4, 5, 6] -&amp;gt; [2, 3], [4], [5], [6] or [0, 0, 1, 2, 3]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that in the last example the height could not be reduced by adding the extra column so in this case only four columns could be utilised.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2016-09-30T07:51:28.720" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10211" PostTypeId="2" ParentId="10199" CreationDate="2016-09-30T12:37:16.410" Score="6" Body="&lt;h2&gt;Mouse interactions that act as code or input are not allowed&lt;/h2&gt;&#xA;&lt;p&gt;Since it's impossible to count &amp;quot;bytes&amp;quot; for mouse clicks/drags/etc., mouse interactions are not allowed as part of the code or the input method. Mouse interactions &lt;em&gt;are&lt;/em&gt; allowed for the purpose of facilitating input using &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;acceptable methods&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Acceptable:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Having to click a button to run the code&lt;/li&gt;&#xA;&lt;li&gt;Having to click a button to see the output of running the code&lt;/li&gt;&#xA;&lt;li&gt;Having to click in a text field (or similar) to input the code or input&lt;/li&gt;&#xA;&lt;li&gt;Clicking levers/buttons/etc. in Minecraft to enter input (since that's the natural input method)&lt;/li&gt;&#xA;&lt;li&gt;Clicking checkboxes or up/down buttons on numeric input boxes for input in HTML+CSS&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Unacceptable:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Entering the code in an Excel cell (or similar) and dragging it through other cells to get the output (whether it be a fixed number of cells or dependent on the input)&lt;/li&gt;&#xA;&lt;li&gt;Using the mouse (or keyboard, for that matter) to select a part of code and repeat it multiple times for &amp;quot;free&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;Anything else that would be equivalent to one of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/45941&quot;&gt;standard loopholes&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-30T13:54:02.277" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="10212" PostTypeId="2" ParentId="2140" CreationDate="2016-09-30T13:10:32.920" Score="1" Body="&lt;h2&gt;golf.ko - Kernel module golf&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A Linux-specific challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Implement a Linux kernel module which &lt;code&gt;printk&lt;/code&gt;s &lt;code&gt;Hello world&lt;/code&gt; upon loading, in some compiled language.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Source file, linker scripts and command lines, Makefile content (if any) are all counted towards the byte score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may expect kernel version to be 4.1 or 4.4.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The kernel is assumed to be running. It's built, not cleaned source code is assumed to reside in &lt;code&gt;/usr/src/linux&lt;/code&gt;. In addition you may expect the system to be Debian and to have working &lt;a href=&quot;https://wiki.debian.org/KernelDKMS&quot; rel=&quot;nofollow noreferrer&quot;&gt;DKMS&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="7773" LastEditorUserId="7773" LastEditDate="2016-10-03T23:32:45.580" LastActivityDate="2016-10-03T23:32:45.580" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10215" PostTypeId="1" AcceptedAnswerId="10216" CreationDate="2016-09-30T21:25:03.320" Score="7" ViewCount="217" Body="&lt;p&gt;I am pretty new here and there is an aspect of the accepted rules that I am not really clear about and would appreciate your opinions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have recently posted a few answers using IBM/Lotus Notes Formula Language. The main reason for this is that it interests me in the same way as the Sinclair Spectrum does. Having read through the rules (again) recently I have see that languages/compilers that are not openly available to all members of the community are at the very least discouraged. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question is twofold.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Should I not post using this language? I have noticed that other posters are posting solutions using various Microsoft products including Excel and Powershell which are also proprietary and so thought it would be OK.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If I do post with LNFL should I specify it as non-competing, mention that it is written in a not freely available language (for anyone who doesn't know) or just post it &quot;as is&quot;. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;To be honest, LNFL is very unlikely to win any golf challenges (although I did manage a 2 byte answer for one but was beaten by a byte :-)) and the main reason for posting them is just for the challenge of doing it and seeing another language on the list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;btw, I am not a &quot;one trick pony&quot;. I have also got upvotes for a couple of Python answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thanks for your opinions.&lt;/p&gt;&#xA;" OwnerUserId="56555" LastEditorUserId="56555" LastEditDate="2016-09-30T21:33:53.067" LastActivityDate="2016-09-30T22:05:12.630" Title="Proprietary/Paid for Languages/Compilers" Tags="|discussion|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10216" PostTypeId="2" ParentId="10215" CreationDate="2016-09-30T21:48:26.337" Score="14" Body="&lt;p&gt;I assume you're talking about &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7212/12012&quot;&gt;this loophole&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Using a non-free language on a Cops and Robbers challenge&lt;/h1&gt;&#xA;&lt;p&gt;[...]&lt;/p&gt;&#xA;&lt;p&gt;An important implicit condition of such a challenge is that it is possible for the robbers to try out many variants of the code to find the true solution. While a cop submission where this is impossible would ostensibly do well, it is not in the spirit of the challenge, and is in fact a loophole.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, pay-for-use languages are banned as a loophole.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This prohibition only applies to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; challenges, where it is important that the robbers have access to the same tools the cop uses.&lt;/p&gt;&#xA;&lt;p&gt;In all other kinds of challenges, such as plain &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, there is no such requirement, and you're free to use any proprietary/paid-for language you like.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-09-30T22:05:12.630" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10217" PostTypeId="2" ParentId="2140" CreationDate="2016-09-30T22:06:07.957" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/51471/40695&quot;&gt;No, this challenge is not this&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Where is my error?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;My compiler has broken down and now it is only showing the index of the character which the error is on. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge you will write a program to point to the given character.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;if (goat == Downgoat) {&#xA;    print(Downgoat));&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;43&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 | if (goat == Downgoat) {&#xA;2 |     print(Downgoat));&#xA;  |                    ^&#xA;3 | }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Spec&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;TODO&lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.947" LastActivityDate="2016-09-30T22:06:07.957" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10218" PostTypeId="1" CreationDate="2016-09-30T23:48:42.947" Score="14" ViewCount="354" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/tags/ascii-art/info&quot;&gt;tag wiki&lt;/a&gt; for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; says&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This challenge involves creating or parsing pictures using text characters as the paint. Typically this uses only 95 printable (from a total of 128) characters defined by the ASCII Standard from 1963. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This makes it clear that &quot;ASCII&quot; here refers to the original 128 characters, and not to one of the various 256 character extensions. However, the tag is sometimes applied to challenges which are more general &quot;text art&quot;, using characters not found in the original 128. In general, we may have challenges that use text from a wider set, perhaps some subset of unicode.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/text-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;text-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;text-art&lt;/a&gt; was &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/32638471#32638471&quot;&gt;proposed in chat&lt;/a&gt;. Would it be useful to have a broader tag? Is this a good candidate for such a tag? Should this replace &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; or accompany it, like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; accompanies &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;? Should the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; tag wiki be extended to include general text art in addition to strict ASCII? Is there some other word that sums up the whole set of letters, numbers and graphical characters better than &quot;text&quot;?&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-10-01T18:33:38.237" Title="Text art or ASCII art? Which tag should we have?" Tags="|discussion|tags|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10220" PostTypeId="2" ParentId="10218" CreationDate="2016-10-01T07:33:00.393" Score="-5" Body="&lt;h2&gt;Make &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/text-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;text-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;text-art&lt;/a&gt; a tag, make &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; a tag synonym&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; implies that only ASCII characters will be used, which is not always the case. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/text-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;text-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;text-art&lt;/a&gt; is much less confusing. Since &amp;quot;ASCII art&amp;quot; is common terminology, there's no harm in keeping it around as a synonym, but &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/text-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;text-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;text-art&lt;/a&gt; is much more descriptive and should be the primary tag name.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-01T07:33:00.393" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10222" PostTypeId="2" ParentId="10218" CreationDate="2016-10-01T18:33:38.237" Score="22" Body="&lt;p&gt;Adding emphasis to the quote from the tag wiki:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This challenge involves &lt;strong&gt;creating or parsing pictures using text characters&lt;/strong&gt; as the paint. &lt;strong&gt;Typically&lt;/strong&gt; this uses only 95 printable (from a total of 128) characters defined by the ASCII Standard from 1963.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Without even modifying the wiki it seems that the tag covers art created with larger character sets, or even character sets which aren't supersets of ASCII. This is in line with general usage: e.g. &lt;a href=&quot;https://en.wikipedia.org/w/index.php?title=ASCII_art&amp;amp;oldid=741401357&quot; rel=&quot;nofollow&quot;&gt;Wikipedia:ASCII art&lt;/a&gt; says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The term is also loosely used to refer to text based visual art in general.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So it's not necessary to create a new tag.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2016-10-01T18:33:38.237" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10223" PostTypeId="2" ParentId="8047" CreationDate="2016-10-02T03:01:55.967" Score="22" Body="&lt;h2&gt;Using old challenges as a model&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Just because an old challenge did something doesn't mean yours should too. Many old challenges wouldn't pass muster nowadays. Don't be surprised if your challenge is downvoted or closed even though a comparable old one is at +87.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Site standards have risen a lot over the years. Challenges are expected to be objective, precisely specified, and comprehensively covered by test cases. Moreover, some formerly-popular types of challenges have fallen out of community favor: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8134/20260&quot;&gt;pop cons about creativity&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10064/20260&quot;&gt;pure programming puzzles&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8106/20260&quot;&gt;code golfs with bonuses&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8079/20260&quot;&gt;Do X without Y&lt;/a&gt;, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For a rough guide, as of this writing (Oct 2016), I'd say 2013 and before is a different world, and things from 2014-2015 are iffy as references. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, beware in general of &quot;but this challenge did it!&quot; regardless of the time. It may not have been a good idea for that challenge, and even if it was, it may not be a good idea for yours.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2016-10-02T10:27:42.590" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10225" PostTypeId="1" AcceptedAnswerId="10226" CreationDate="2016-10-02T10:29:19.630" Score="21" ViewCount="619" Body="&lt;p&gt;The rules for what languages and libraries are allowed on this site seem to be scattered all over the place.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm looking for a simple check list to know if a custom language or a custom library is valid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What are the rules for custom languages and libraries?&lt;/p&gt;&#xA;" OwnerUserId="10875" LastEditorUserId="68942" LastEditDate="2021-04-04T15:51:34.310" LastActivityDate="2023-02-02T08:48:24.127" Title="General rules for custom languages and libraries" Tags="|discussion|faq|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10226" PostTypeId="2" ParentId="10225" CreationDate="2016-10-02T10:29:19.630" Score="27" Body="&lt;h1&gt;Language&lt;/h1&gt;&#xA;&lt;p&gt;Relevant links:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Loopholes that are forbidden by default&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2028/what-are-programming-languages&quot;&gt;What are programming languages?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9548/introducing-a-new-golf-language&quot;&gt;Introducing a New Golf Language&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/273/10875&quot;&gt;On “interactive” answers and other special conditions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/3610/should-answers-to-fixed-output-challenges-be-written-in-a-programming-language&quot;&gt;Should answers to fixed-output challenges be written in a programming language?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9770/is-html-css-a-programming-language&quot;&gt;Is HTML/CSS a programming language?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8995/how-should-vim-answers-be-scored&quot;&gt;How should vim answers be scored?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10215/proprietary-paid-for-languages-compilers&quot;&gt;Proprietary/Paid for Languages/Compilers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1434/is-this-language-allowed&quot;&gt;Is this language allowed?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Argumentation&lt;/h2&gt;&#xA;&lt;p&gt;In general, see &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Loopholes that are forbidden by default&lt;/a&gt; it includes &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1071/10875&quot;&gt;Using a made-up language specifically designed for the challenge&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Now, the question is whatever some language is to be considered &amp;quot;made-up&amp;quot; and &amp;quot;specifically designed for the challenge&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;Consider the question &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1434/10875&quot;&gt;Is this language allowed?&lt;/a&gt;, on which &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1435/10875&quot;&gt;Doorknob says&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;you need to provide a working, freely available interpreter, which means solving every single challenge on the site&lt;/li&gt;&#xA;&lt;li&gt;languages (including versions of languages) created after the challenge are invalid&lt;/li&gt;&#xA;&lt;li&gt;it's cheating (obviously) and you'll get showered in downvotes&lt;/li&gt;&#xA;&lt;li&gt;it also violates one of the &amp;quot;standard loopholes,&amp;quot; specifically &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1085/3808&quot;&gt;https://codegolf.meta.stackexchange.com/a/1085/3808&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;About the use of &amp;quot;free&amp;quot; vs paid languages consider that the advantage of a language available for use at no monetary cost is that it provides low entry point to verify the answer - so we don't have to rely on the claim that the code works. Yet there is antecedent on paid languages being allowed, namely on the question &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10215/proprietary-paid-for-languages-compilers&quot;&gt;Proprietary/Paid for Languages/Compilers&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10216/10875&quot;&gt;Dennis&lt;/a&gt; says:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This prohibition only applies to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;cops-and-robbers-container&quot;&gt;cops-and-robbers&lt;/a&gt; challenges, where it is important that the robbers have access to the same tools the cop uses.&lt;/p&gt;&#xA;&lt;p&gt;In all other kinds of challenges, such as plain &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, there is no such requirement, and you're free to use any proprietary/paid-for language you like.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Rules for Language&lt;/h2&gt;&#xA;&lt;p&gt;The language and language version used must:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Not be disallowed by question.&lt;/li&gt;&#xA;&lt;li&gt;Not created for the specific challenge¹, unless explicitly allowed by the question.&lt;/li&gt;&#xA;&lt;li&gt;Be verifiable. That is, there must be a way to verify the code at no monetary cost³.&lt;/li&gt;&#xA;&lt;li&gt;Be a language⁴.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;¹: This is &amp;quot;specifically designed for the challenge&amp;quot; part of the loophole. Since the loophole is forbidden by default, it requires explicit permission in the question.&lt;/p&gt;&#xA;&lt;p&gt;³: This may be a interpreter / compiler on which to test the code, or just documentation.&lt;/p&gt;&#xA;&lt;p&gt;⁴: For the rules of what is or isn’t a &lt;em&gt;programming&lt;/em&gt; language, see &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/10875&quot;&gt;Peter Taylor on What are programming languages?&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note on non-programming languages&lt;/strong&gt;: It should be noted that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/3610/should-answers-to-fixed-output-challenges-be-written-in-a-programming-language/3639#3639&quot;&gt;answers in non-programming languages aren’t disallowed&lt;/a&gt; and are considered valid in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;kolmogorov-complexity-container&quot;&gt;kolmogorov-complexity&lt;/a&gt; or answers that expect a fixed output. Also notice that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9772/10875&quot;&gt;CSS is considered a programming language&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note on interactive solutions&lt;/strong&gt;: Solutions that are not fully automated are allowed, for details see: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/274/10875&quot;&gt;On “interactive” answers and other special conditions&lt;/a&gt;. Input used that is not part of the challenge &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8999/10875&quot;&gt;would be counted&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Hint&lt;/strong&gt;: If the language has previously been used for something else than the challenge at hand, it is ok – unless said otherwise.&lt;/p&gt;&#xA;&lt;p&gt;You may also be required to post a link to the interpreter / compiler you are using, in particular if it is obscure enough. How obscure is obscure enough? In doubt, post a link. See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9550/10875&quot;&gt;Alex A. answer on Introducing a New Golf Language&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Library&lt;/h1&gt;&#xA;&lt;p&gt;Relevant links:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7243/can-i-write-a-golfing-library&quot;&gt;Can I write a golfing library?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7243/can-i-write-a-golfing-library&quot;&gt;Using libraries in solutions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/435/is-a-code-golfing-library-legitimate&quot;&gt;Is a code golfing library legitimate?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Argumentation&lt;/h2&gt;&#xA;&lt;p&gt;First off, there is no note on libraries on the loopholes that are forbidden by default.&lt;/p&gt;&#xA;&lt;p&gt;Now, when we are talking about custom libraries, we need to consider the question &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/435/10875&quot;&gt;using code golfing libraries&lt;/a&gt;, to which &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/438/10875&quot;&gt;Peter Taylor says&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;It's one thing to use standard libraries and another to roll your own. I think it risks turning into a game of &amp;quot;Who can write the most advantageous library?&amp;quot; rather than &amp;quot;Who can find a devious way to use the language?&amp;quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Personally I prefer &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5427/10875&quot;&gt;SuperJedi224&lt;/a&gt; take on the matter, but I don't think we have consensus on that:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I believe that it shouldn't be a problem, as long as:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;using the library does not violate the rules of the question&lt;/li&gt;&#xA;&lt;li&gt;you are using a version that was released before the question was posted&lt;/li&gt;&#xA;&lt;li&gt;that version of the library is freely available as of when you are posting your answer (please provide a link in your answer as well)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;And also on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5426/10875&quot;&gt;Using libraries in solutions&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;(...) unless the question says otherwise, any freely available library existing before the question was asked should be permissible. However, the requisite import statements should be counted towards the byte count. Additionally, a link to the library should be included in the description/explanation part of the answer.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Finally see &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7243/can-i-write-a-golfing-library&quot;&gt;Can I write a golfing library?&lt;/a&gt; where &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7246/10875&quot;&gt;feersum&lt;/a&gt; points that using a custom library is ok, and that you must mention the library you are using in the header of the answer. The provided example is &lt;code&gt;Python 3 + &amp;lt;name&amp;gt; library&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Rules for Library&lt;/h2&gt;&#xA;&lt;p&gt;The library and library version used must:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Not be disallowed by question¹.&lt;/li&gt;&#xA;&lt;li&gt;Be publicly available at no monetary cost before the question was posted.&lt;/li&gt;&#xA;&lt;li&gt;Be mentioned when used.&lt;/li&gt;&#xA;&lt;li&gt;Only competes against answers using the same library(s)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;¹: There is an antecedent on &lt;a href=&quot;https://stackoverflow.com/questions/3584307/code-golf-calculate-orthodox-easter-date&quot;&gt;Code Golf: Calculate Orthodox Easter date&lt;/a&gt; where dedicated function calls were disallowed:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Restrictions No standard functions, such as Mathematica's EasterSundayGreekOrthodox or PHP's easter_date(), which return the (not applicable gregorian) date automatic must be used!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;You may also be required to post a link to the library you are using, in particular if it is obscure enough. How obscure is obscure enough? In doubt, post a link.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Final note&lt;/strong&gt;: The characters used to import the library will likely be counted, even if they are outside the program (e.g. in compiler parameters) - yet scoring is a separate issue.&lt;/p&gt;&#xA;" OwnerUserId="10875" LastEditorUserId="91213" LastEditDate="2023-02-02T08:48:24.127" LastActivityDate="2023-02-02T08:48:24.127" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="10228" PostTypeId="2" ParentId="10172" CreationDate="2016-10-02T16:47:27.587" Score="21" Body="&lt;p&gt;In light of recent issues, two users have been suspended for 7 days. Please &lt;em&gt;Be Nice&lt;/em&gt; and don't discuss their suspensions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Remember that chat flags are visible to all 10k users on the entire network, and even moderator-only chat flags are visible to &lt;em&gt;all&lt;/em&gt; SE moderators in chat. Therefore, use them only for events that require &lt;em&gt;immediate&lt;/em&gt; intervention.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the absence of a way to notify only PPCG moderators in chat, you can flag any post of a user on the main site instead, using the &lt;em&gt;in need of moderator intervention&lt;/em&gt; options and a custom flag reason. If the affected user hasn't posted on main, you can flag one of your own posts instead.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2016-10-02T16:47:27.587" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10230" PostTypeId="2" ParentId="2140" CreationDate="2016-10-02T19:26:25.577" Score="2" Body="&lt;h2&gt;Table Math&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You should which side of a table is the oldest, from ASCII art. I think the best way to explain is with an example, so here is one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You have a table, made out of &lt;code&gt;+&lt;/code&gt;, &lt;code&gt;|&lt;/code&gt;, and &lt;code&gt;-&lt;/code&gt;. Here is one.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+--+&#xA;|  |&#xA;|  |&#xA;|  |&#xA;+--+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It will alway be a rectangle, just not always square (but it can be square). There will also be people around the table, marked by the letters A-Z. There will never be too many people on a side, or less than one. Just to make it harder, the people will not always be in order, like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  P&#xA; +--+&#xA;I|  |&#xA;O|  |Q&#xA; |  |J&#xA; +--+&#xA;   U&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There will never be anybody next to a plus sign(&lt;code&gt;+&lt;/code&gt;). You will be given input on how old each member is, separated by a newline, from the first letter that appears alphabetically (I in this example) to the last letter that appears alphabetically (U in this example), like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;20&#xA;8&#xA;31&#xA;56&#xA;6&#xA;56&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As seen here, ties are allowed. You should then output the sides with their ages separated with a space, in order from oldest to youngest, like this.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Top 56&#xA;Bottom 56&#xA;Left 51&#xA;Right 14&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that for everything in this challenge, you can choose the capitalization of the letters, even the input. The winner is the submission with the shortest code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="59363" LastEditorUserId="12537" LastEditDate="2016-11-05T05:53:00.763" LastActivityDate="2016-11-05T05:53:00.763" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10232" PostTypeId="2" ParentId="10148" CreationDate="2016-10-03T03:23:31.943" Score="-3" Body="&lt;h1&gt;Dominoes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It seems to me that it would be a bummer to discard all of mechanical computing because it &lt;em&gt;might&lt;/em&gt; be problematic. I personally am a huge fan, but I can't think of a general argument. So &lt;strong&gt;here is a case for allowing Domino solutions&lt;/strong&gt;. Note I don't think it is my goal to dot i's and cross t's, I am trying to make a case that domino computing could meet the concerns that have been raised (ie not necessarily how we should meet those concerns).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Problems to Address&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I propose that if the following issues are adequately addressed, domino solutions are valid.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Sharing&lt;/strong&gt; :: how do we share domino layouts so that they can be reproduced?&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Scoring&lt;/strong&gt; :: how do we calculate &lt;em&gt;bytes&lt;/em&gt; for a domino solution?&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Testing&lt;/strong&gt; :: how do we verify solutions?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Sharing&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This isn't rocket science, setting up dominoes and knocking them over is literally something a child can do. While we could provide distances, angles, weights and details until we are blue in the face; I propose that a clear photo (or set of photos) that unambiguously displays how the dominoes line up is sufficient for someone to replicate the layout.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Scoring dominoes in terms of bytes is currently not doable. But consider: &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Minecraft didn't have a standard way of measuring bytes until &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9529/43214&quot;&gt;recently&lt;/a&gt; &#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;there is precedence&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;someone might invent a reasonable byte conversion&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;There is a micro-competition within each language &#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;the shortest answer for each language de facto wins&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;dominoes can compete with dominoes&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;We are trying to document best solutions in every language&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;this includes esoteric/golfing solutions&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;domino solutions are a similar novelty&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Number of tiles is unambiguous&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h3&gt;Testing&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Vids or it didn't happen!&lt;/strong&gt; It seems like it would be reasonable for domino solutions to include video confirmation of the test cases. Given the effort involved in creating a video, this requirement should be flexible for trivial solutions. The reason we have test cases is to verify that a solution probably works. So if there is video evidence of a solution working for the test cases, the solution probably works.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Conclusion&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Domino solutions are shareable, score-able, and testable so they should be considered valid.&lt;/p&gt;&#xA;" OwnerUserId="43214" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2016-10-03T03:23:31.943" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10237" PostTypeId="1" CreationDate="2016-10-04T04:37:27.187" Score="12" ViewCount="279" Body="&lt;p&gt;I have an answer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69/golf-you-a-quine-for-great-good&quot;&gt;this&lt;/a&gt; question that is quite long.  It is the best I can do and no one else has answered the question in the language (I am using Brain-Flak).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However my answer is very large (7e618).  It would require more bytes than there exists atoms in the observable universe to store the answer uncompressed.  I cannot include the answer for obvious reasons but I can include a very simple way to generate it given enough time and computational power.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there any policy on the upper limit of answer sizes?  Should there be?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-10-17T19:59:57.867" Title="How big can an answer be?" Tags="|discussion|" AnswerCount="1" CommentCount="3" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10238" PostTypeId="2" ParentId="10237" CreationDate="2016-10-04T04:58:31.103" Score="10" Body="&lt;h1&gt;If you can describe the program and show why it works, then definitely&lt;/h1&gt;&#xA;&lt;p&gt;People have done this sort of thing many times before, myself included: &lt;a href=&quot;https://codegolf.stackexchange.com/a/58557/31343&quot;&gt;https://codegolf.stackexchange.com/a/58557/31343&lt;/a&gt; (This one's description was much simpler than yours, but the same principle applies)&lt;/p&gt;&#xA;&lt;p&gt;There is no reason to restrict answers to those that can be manually written out, and if you make it clear why your answer would work, then it should be completely fine.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;P.S: Awesome, a brain-flak quine!&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="31343" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-04T04:58:31.103" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10239" PostTypeId="2" ParentId="2140" CreationDate="2016-10-04T05:42:03.953" Score="4" Body="&lt;h1&gt;Play a 1D chess variant&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;in this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenge, you must create a bot that plays a 1d &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot;&gt;chess&lt;/a&gt; variant I created, featuring all leaper pieces, and a 15 long board.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Esolangs are encouraged to participate&lt;/h3&gt;&#xA;&#xA;&lt;h2&gt;Game Rules&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Goal&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;To capture the opponents royal (king/queen).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Board&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The board is 15 squares long&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Player _______________________________ Player&#xA; one   |_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|   two&#xA;       player1 side       player2 side&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Each player has their side of the board. (note that while playing, you will always be on the left side of the board). You have six squares that belong to you, the opponent has six of their squares, and three squares in the middle are unowned.&lt;/p&gt;&#xA;&#xA;&lt;strong&gt;Setting up&lt;/strong&gt;&#xA;&#xA;&lt;p&gt;At the start of the game, you will place your pieces into a configuration of your choice. The pieces will be set independently of each other; this game does not have perfect information. When setting up, you will pick where to place your four pieces, and whether they will be reversed (see next section). You may only place your pieces in your owned squares.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Pieces&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;There are 4 / 8 pieces; there are 4 distinct pieces, which you can have reversed, and unreversed. I have given them distinct names. Their movements are detailed here.&lt;/p&gt;&#xA;&#xA;&lt;strong&gt;&lt;em&gt;reversed&lt;/em&gt;&lt;/strong&gt;&#xA;&#xA;&lt;p&gt;reversed means that all the moves of these pieces are reversed in their direction; 2 forward becomes 2 back, three back becomes three forward.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Capture means to move to a space occupied by an enemy piece, and remove that piece from the game.&#xA;Move means to move to a space occupied by no pieces.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ascii &quot;diagrams&quot; have been provided. P denotes the piece being showed, $ denotes a space the piece can move to, X a place the piece can capture on, # a piece can move and capture on. Diagrams are the same for both pieces in a pair, because one simply executes the moves backwards.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;&lt;strong&gt;&lt;em&gt;You must have exactly 4 pieces on the board, and have exactly one from each of the pairs below.&lt;/em&gt;&lt;/strong&gt;&lt;/h3&gt;&#xA;&#xA;&lt;strong&gt;Footman (f)/Coward (c)&lt;/strong&gt;&#xA;&#xA;&lt;p&gt;The footman may move to an empty space one (1) forward, and capture two (2) forward.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The coward may move to an empty space one (1) backward, and capture two (2) backward.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;P$X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;strong&gt;Horse (h)/spider (s)&lt;/strong&gt;&#xA;&#xA;&lt;p&gt;The horse may move to an empty space two (2) or three (3) forward, and move or capture one (1) backward.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The spider may move to an empty space two (2) or three (3) backward, and move or capture one (1) forward.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#P $$&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;strong&gt;Archer (a)/Trickster (t)&lt;/strong&gt;&#xA;&#xA;&lt;p&gt;(I doubt anyone will use trickster unironically)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The archer may move two (2) squares backward, one (1) forward, and may capture four (4) steps forward&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The trickster may move two (2) squares forward, one (1) backward, and may capture four (4) steps backward&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have included some black and white squares for clarity in distance&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# # # #&#xA;$ P$  X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;strong&gt;King (k)/Queen (q)&lt;/strong&gt;&#xA;&#xA;&lt;p&gt;Both Royal pieces will end the game when captured.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The king may move or capture one (1) backward&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The queen may move or capture one (1) forward&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#P&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Misc.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Check does not exist: Royal pieces may be left en prise, capture of them results in a win for the capturing side.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is no (pawn) promotion of any kind&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A piece may not attempt to move of the board; the board is a fixed size and does not wrap.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Programs&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Programs will take input. When they take input of &quot;0&quot;, or a specific input of your choosing, they will output a setup for the game.&#xA;when they take input &quot;1&quot;, or a specific input of your choosing, they will then receive input of the board, and output a move. (the program will be run multiple times)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Moving&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;To move, you will output the square that the piece is currently on, and the space where you wish to move the piece to, or have the piece capture on. The format is as so (in regex):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[0-9a-e]\n?[0-9a-e]\n?&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The board is zero indexed, a piece on the first square is on square 0.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There should be exactly 2 non-newline characters in the output&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;when it is your turn to move, you will receive input. The input you receive will represent the pieces in the playing field. The input will fit the regex here:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[fFcChHsSaAtTkKqQ ]{15}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Caps represent enemy pieces, lowercase represent your pieces.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;when you receive the board positions, you will always have the perspective of player one&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;WIP, will do more later&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;What should happen if bots enter an infinite loop? I could just make a draw on a time limit, but that seems not so great, since it is hard for bots to know when they are doing this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also just other feedback in general&lt;/p&gt;&#xA;" OwnerUserId="55896" LastEditorUserId="55896" LastEditDate="2016-10-06T23:02:23.870" LastActivityDate="2016-10-06T23:02:23.870" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10242" PostTypeId="5" CreationDate="2016-10-04T15:16:03.433" Score="0" Body="&lt;p&gt;This tag should be added to questions that should potentially be added to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1280/community-faq-for-programming-puzzles-code-golf&quot;&gt;site&lt;/a&gt; &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;In order to be added to the FAQ, the question being asked is either frequently asked by new users, or it contains information that every user should know. The information the answers provide should compile necessary information into a helpful list, if applicable, in order to facilitate access by new users.&lt;/p&gt;&#xA;&lt;p&gt;The question should, at some point, have this tag removed, and potentially be replaced with &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq&lt;/a&gt; when/if it is added to the official FAQ&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="66833" LastEditDate="2021-03-12T16:12:28.427" LastActivityDate="2021-03-12T16:12:28.427" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="10243" PostTypeId="4" CreationDate="2016-10-04T15:16:03.433" Score="0" Body="Add this tag to questions that could or should be added to the FAQ" OwnerUserId="34718" LastEditorUserId="66833" LastEditDate="2021-03-12T16:12:28.427" LastActivityDate="2021-03-12T16:12:28.427" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="10247" PostTypeId="2" ParentId="2140" CreationDate="2016-10-05T21:25:13.033" Score="1" Body="&lt;h1&gt;Random Quine&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; (something related to languages?)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are to write &lt;strong&gt;N&lt;/strong&gt; programs in &lt;strong&gt;N&lt;/strong&gt; langauges (at least 2) that satify the following properties:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;For each program &lt;strong&gt;P&lt;/strong&gt;, the program &lt;strong&gt;P&lt;/strong&gt; must produce an output &lt;strong&gt;O&lt;/strong&gt; that is equal to a random program &lt;strong&gt;Q&lt;/strong&gt; that you wrote, including &lt;strong&gt;P&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;No two programs &lt;strong&gt;P&lt;/strong&gt; and &lt;strong&gt;Q&lt;/strong&gt; may be equal.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Let's say you have two programs, &lt;code&gt;ABCD&lt;/code&gt; in language Bar and &lt;code&gt;1234&lt;/code&gt; in language Baz. Then, &lt;code&gt;ABCD&lt;/code&gt; must produce each of &lt;code&gt;ABCD&lt;/code&gt; and &lt;code&gt;1234&lt;/code&gt; with nonzero (but not necessarily equal) probability. Similarly, &lt;code&gt;1234&lt;/code&gt; must output &lt;code&gt;ABCD&lt;/code&gt; or &lt;code&gt;1234&lt;/code&gt; with nonzero chance. Note that the chances do not have to be same for each program.&lt;/p&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2016-10-05T21:25:13.033" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10249" PostTypeId="1" CreationDate="2016-10-06T02:28:51.073" Score="10" ViewCount="309" Body="&lt;p&gt;Stack-based languages don't necessarily fit in the pseudo-code model that constitutes &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2194/12012&quot;&gt;our definition of truthy and falsy&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;if (x) {&#xA;    print &amp;quot;x is truthy&amp;quot;;&#xA;}&#xA;else {&#xA;    print &amp;quot;x is falsy&amp;quot;;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The closest equivalent to &lt;strong&gt;x&lt;/strong&gt; in a stack-based language would be the top of the stack (assuming this is what the conditional inspects), but in a sense, it really inspects the &lt;em&gt;entire&lt;/em&gt; stack (although it does ignore everything but the top).&lt;/p&gt;&#xA;&lt;p&gt;Languages like &lt;a href=&quot;https://github.com/DJMcMayhem/Brain-Flak&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brain-Flak&lt;/a&gt; don't make matters easier; the closest thing Brain-Flak has to a conditional is the &lt;code&gt;{...}&lt;/code&gt; loop which executes &lt;code&gt;...&lt;/code&gt; while the top of the stack is truthy and halts when it's falsy.&lt;/p&gt;&#xA;&lt;p&gt;It's rather easy to emulate a conditional (sans the &lt;code&gt;else&lt;/code&gt; part) using while loops. Since a non-zero integer on top of the stack permits us to enter the loop while &lt;strong&gt;0&lt;/strong&gt; on top of the stack prevents it, I think it's rather clear that non-zero integers should be treated as truthy and &lt;strong&gt;0&lt;/strong&gt; as falsy. (If you disagree, please say so.) So far, so good.&lt;/p&gt;&#xA;&lt;p&gt;Now, at the end of the program, Brain-Flak prints the entire stack (and this is the only way of output), so it isn't really possible to print a single integer, but only a stack of height &lt;strong&gt;1&lt;/strong&gt;. &lt;em&gt;Does that mean that the entire output should be treated as a stack and its truthiness should depend only on the top of the stack?&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This has come up twice recently:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/a/95210/12012&quot;&gt;this answer&lt;/a&gt;, I'm treating an empty stack as falsy. Since Brain-Flak's stacks have an infinity of zeroes at the bottom, &lt;code&gt;{...}&lt;/code&gt; would not enter the loop on an empty stack.&lt;/p&gt;&#xA;&lt;p&gt;I did this without thinking twice about it, probably because treating empty output as falsy is rather common in other languages.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I got a golfing suggestion on &lt;a href=&quot;https://codegolf.stackexchange.com/a/95377/12012&quot;&gt;this answer&lt;/a&gt; that proposed printing &lt;code&gt;1 0&lt;/code&gt; as truthy output. The argument is that &lt;code&gt;1 0&lt;/code&gt; is truthy since &lt;code&gt;{...}&lt;/code&gt; sees only the top of the stack.&lt;/p&gt;&#xA;&lt;p&gt;While – now that I've thought about it – it seems to be quite similar to treating an empty stack as falsy, it seems weird to output &lt;em&gt;two&lt;/em&gt; values and disregard all but the first one.&lt;/p&gt;&#xA;&lt;p&gt;One the other hand, Brain-Flak's stacks could be considered array-like, and each programming language has its own ways of determining an array's truthiness, e.g., an array is truthy in Python iff it is non-empty, while an array in truthy in Octave iff it is non-empty and doesn't contain a &lt;strong&gt;0&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-06T03:10:23.893" Title="Truthiness in Brain-Flak and similar stack-based languages" Tags="|discussion|policy|answers|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10250" PostTypeId="2" ParentId="10249" CreationDate="2016-10-06T03:05:08.900" Score="6" Body="&lt;h1&gt;We should only consider the top of the stack&lt;/h1&gt;&#xA;&lt;p&gt;If we were to implement the pseudo code in Brain-Flak it would look like:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(({})){(&amp;lt;{}&#xA; ({}&amp;lt;&#xA;  ((((((()()()()())){}{}){}){}){}())((((((()()()){}){}()){}){}){})((((((()()()){}()){}){}()){}){})(((((((()()()){}){}())){}{})){}{})((((((()()()){}()){}){}){}()){})((((((()()()){}()){}){}()){}){})((((()()()()){}){}){})((((((()()()){}()){}){}){}()){}())((((()()()){}()){}){({}[()])}{})((((()()()()){}){}){})((((((()()()()())){}{}){}){}){})&#xA; &amp;gt;)&#xA;&amp;gt;)}{}&#xA;({}&amp;lt;(())&amp;gt;){((&amp;lt;{}{}&amp;gt;))}{}&#xA;{(&amp;lt;{}&#xA; ((((((()()()()())){}{}){}){}){}())((((((()()()){}()){}){}){}()){}())(((((((()()())){}{})){}{}){}){})((((((()()()){}){}){}){}){}())((((((()()()()){}){}())){}{}){})((((()()()()){}){}){})((((((()()()){}()){}){}){}()){}())((((()()()){}()){}){({}[()])}{})((((()()()()){}){}){})((((((()()()()())){}{}){}){}){})&#xA;&amp;gt;)}{}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://brain-flak.tryitonline.net/#code=KCh7fSkpeyg8e30KICh7fTwKICAoKCgoKCgoKSgpKCkoKSgpKSl7fXt9KXt9KXt9KXt9KCkpKCgoKCgoKCkoKSgpKXt9KXt9KCkpe30pe30pe30pKCgoKCgoKCkoKSgpKXt9KCkpe30pe30oKSl7fSl7fSkoKCgoKCgoKCkoKSgpKXt9KXt9KCkpKXt9e30pKXt9e30pKCgoKCgoKCkoKSgpKXt9KCkpe30pe30pe30oKSl7fSkoKCgoKCgoKSgpKCkpe30oKSl7fSl7fSgpKXt9KXt9KSgoKCgoKSgpKCkoKSl7fSl7fSl7fSkoKCgoKCgoKSgpKCkpe30oKSl7fSl7fSl7fSgpKXt9KCkpKCgoKCgpKCkoKSl7fSgpKXt9KXsoe31bKCldKX17fSkoKCgoKCkoKSgpKCkpe30pe30pe30pKCgoKCgoKCkoKSgpKCkoKSkpe317fSl7fSl7fSl7fSkKID4pCj4pfXt9Cih7fTwoKCkpPil7KCg8e317fT4pKX17fQp7KDx7fQogKCgoKCgoKCkoKSgpKCkoKSkpe317fSl7fSl7fSl7fSgpKSgoKCgoKCgpKCkoKSl7fSgpKXt9KXt9KXt9KCkpe30oKSkoKCgoKCgoKCkoKSgpKSl7fXt9KSl7fXt9KXt9KXt9KSgoKCgoKCgpKCkoKSl7fSl7fSl7fSl7fSl7fSgpKSgoKCgoKCgpKCkoKSgpKXt9KXt9KCkpKXt9e30pe30pKCgoKCgpKCkoKSgpKXt9KXt9KXt9KSgoKCgoKCgpKCkoKSl7fSgpKXt9KXt9KXt9KCkpe30oKSkoKCgoKCkoKSgpKXt9KCkpe30peyh7fVsoKV0pfXt9KSgoKCgoKSgpKCkoKSl7fSl7fSl7fSkoKCgoKCgoKSgpKCkoKSgpKSl7fXt9KXt9KXt9KXt9KQo-KX17fQ&amp;amp;input=MQ&amp;amp;args=LUE&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it Online&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;While it may not look like the pseudo code provided, this is a standard if/else idiom in Brain-Flak.  The community has agreed on this pseudo code so we should follow it.&lt;/p&gt;&#xA;&lt;p&gt;This would mean that truthiness depends on only the top value of the active stack at the end of the program.&lt;/p&gt;&#xA;&lt;p&gt;As for other stack based languages I think that we should attempt to emulate the pseudo code as closely as possible.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-06T03:10:23.893" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10251" PostTypeId="1" CreationDate="2016-10-06T15:41:08.173" Score="12" ViewCount="213" Body="&lt;p&gt;I was bored so I wrote a program in Mathematica to download all posts from the first 10 front pages (155 posts) and parse all entries to gather data from the languages and to make a top-list for code golfing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The place is determined by the quotient of total bytes by posts, so it can be interpreted as bytes/post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/7ygNa.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here is the list.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or, if you want to search for your language, have &lt;a href=&quot;https://i.stack.imgur.com/gs7tC.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;an alphabetical ordered one&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, more interesting in my opinion is the comparison of the top 15 most popular languages by posts:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/1lg0N.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/1lg0N.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also interesting are some graphs of the data:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/doXCx.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/doXCx.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/WSrho.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/WSrho.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/NvYzc.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/NvYzc.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The next graph is interesting. We see, that there is a clear gap between the data. I don't really know how this happens. (It reminds me very much of &lt;a href=&quot;https://arxiv.org/pdf/1101.4470.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sloane's Gap&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/eOrNb.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/eOrNb.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The code I used is far from perfect but does its job.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;LoadCodeGolfPostLinks[index_]:=Module[{linkList,refinedLinkList},&#xA;linkList=Import[&quot;http://codegolf.stackexchange.com/questions?page=&quot;&amp;lt;&amp;gt;ToString[index]&amp;lt;&amp;gt;&quot;&amp;amp;sort=votes&quot;,&quot;Hyperlinks&quot;];&#xA;refinedLinkList=Select[linkList,If[StringLength[#]&amp;gt;44,StringTake[#,44]==&quot;http://codegolf.stackexchange.com/questions/&quot;,False]&amp;amp;];&#xA;Select[refinedLinkList,(MatchQ[URLParse[#][&quot;Path&quot;],{&quot;&quot;,&quot;questions&quot;,a_String?(IntegerQ@ToExpression[#]&amp;amp;),_String}])&amp;amp;]&#xA;]&#xA;LoadCodeGolfPostSource[link_]:=Module[{sideSource,sideMax},&#xA;sideSource=Import[link,&quot;Source&quot;];&#xA;sideMax=Max[{0}~Join~(ToExpression/@StringCases[sideSource,&quot;title=\&quot;go to page &quot;~~a_?(IntegerQ[ToExpression[#]]&amp;amp;)~~&quot;\&quot;&quot;-&amp;gt;a])];&#xA;If[sideMax&amp;gt;1,&#xA;sideSource=StringJoin[{sideSource}~Join~Table[Import[link&amp;lt;&amp;gt;&quot;?page=&quot;&amp;lt;&amp;gt;ToString[i],&quot;Source&quot;],{i,2,sideMax}]]&#xA;];&#xA;sideSource&#xA;]&#xA;LoadEntries[source_]:=StringTrim/@(StringCases[source,&quot;&amp;lt;div class=\&quot;post-text\&quot; itemprop=\&quot;text\&quot;&amp;gt;&quot;~~Whitespace~~(&quot;&amp;lt;h1&amp;gt;&quot;|&quot;&amp;lt;h2&amp;gt;&quot;|&quot;&amp;lt;h3&amp;gt;&quot;)~~e:Repeated[Except[&quot;&amp;lt;&quot;|&quot;\n&quot;]]~~(&quot;&amp;lt;/h1&amp;gt;&quot;|&quot;&amp;lt;/h2&amp;gt;&quot;|&quot;&amp;lt;/h3&amp;gt;&quot;)-&amp;gt;e])&#xA;ParseEntrie[entrie_]:=Module[{languageNames,byteCount,centrie},&#xA;languageNames=(StringCases[entrie,Repeated[Except[&quot; &quot;|&quot;\t&quot;|&quot;,&quot;]]]);If[Length[languageNames]&amp;lt;1,&#xA;Null,centrie=StringDrop[entrie,StringLength[languageNames[[1]]]];&#xA;byteCount=ToExpression@(SelectFirst[StringCases[StringDelete[centrie,{&quot;(&quot;,&quot;)&quot;}]&amp;lt;&amp;gt;&quot; bytes&quot;,count:Repeated[DigitCharacter]~~Whitespace...~~(&quot;bytes&quot;|&quot;characters&quot;|&quot;chars&quot;)-&amp;gt;count,IgnoreCase-&amp;gt;True],If[SyntaxQ[#],IntegerQ[ToExpression[#]],False]&amp;amp;]/.Missing[&quot;NotFound&quot;]-&amp;gt;(-1));If[IntegerQ[byteCount]&amp;amp;&amp;amp;byteCount&amp;gt;=0&amp;amp;&amp;amp;byteCount&amp;lt;10000,{StringTrim[StringTrim[languageNames[[1]],{&quot;:&quot;}]],byteCount},&#xA;Null&#xA;]&#xA;]&#xA;]&#xA;MergeLC[lci_]:=Flatten/@(lci//.{&quot;Wolfram&quot;-&amp;gt;&quot;Mathematica&quot;,&quot;Brainf***&quot;-&amp;gt;&quot;brainfuck&quot;,&quot;Brainf*ck&quot;-&amp;gt;&quot;brainfuck&quot;,&quot;C++11&quot;-&amp;gt;&quot;C++&quot;,&quot;C++14&quot;-&amp;gt;&quot;C++&quot;,&quot;Python3.4.0b2&quot;-&amp;gt;&quot;Python&quot;,&quot;AHK&quot;-&amp;gt;&quot;AutoHokey&quot;,&quot;Windows&quot;-&amp;gt;&quot;Batch&quot;,&quot;Bat&quot;-&amp;gt;&quot;Batch&quot;,&quot;Visual&quot;-&amp;gt;&quot;VBA&quot;,{a___,{&quot;C/C++&quot;,b_},c___}:&amp;gt;{a,{&quot;C&quot;,b},{&quot;C++&quot;,b},c},{a___,{&quot;C++/C&quot;,b_},c___}:&amp;gt;{a,{&quot;C&quot;,b},{&quot;C++&quot;,b},c}})&#xA;CountLC[lci_]:=Module[{languages,lMatches},&#xA;languages=DeleteDuplicates[lci[[All,1]]];&#xA;Function[{l},&#xA;lMatches=Select[lci,StringMatchQ[#[[1]],l,IgnoreCase-&amp;gt;True]&amp;amp;];&#xA;{l,Total[lMatches[[All,2]]],Length[lMatches]}&#xA;]/@languages&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Download code:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Monitor[&#xA;step=&quot;download links&quot;;&#xA;frontPages=10;&#xA;ll=Flatten[Table[step=&quot;download links n:&quot;&amp;lt;&amp;gt;ToString[i]&amp;lt;&amp;gt;&quot;/&quot;&amp;lt;&amp;gt;ToString[frontPages];LoadCodeGolfPostLinks[i],{i,1,frontPages}]];&#xA;step=&quot;download source&quot;;&#xA;ss=Table[step=&quot;download source n:&quot;&amp;lt;&amp;gt;ToString[i]&amp;lt;&amp;gt;&quot;/&quot;&amp;lt;&amp;gt;ToString[Length[ll]];LoadCodeGolfPostSource[ll[[i]]],{i,1,Length[ll]}];&#xA;,step]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Parsing code:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Monitor[&#xA;step=&quot;load entries&quot;;&#xA;ee=Flatten[LoadEntries/@ss];&#xA;step=&quot;parse entries&quot;;&#xA;lce=DeleteCases[ParseEntrie/@ee,Null];&#xA;step=&quot;merge language counts&quot;;&#xA;lc=MergeLC[lce];&#xA;step=&quot;count languages&quot;;&#xA;result=CountLC[lc];&#xA;step=&quot;calculate quotients&quot;;&#xA;quotientResult={#[[1]],#[[2]],#[[3]],N[#[[2]]/#[[3]]]}&amp;amp;/@result;&#xA;step=&quot;sort results&quot;;&#xA;resultData=SortBy[quotientResult,#[[4]]&amp;amp;];&#xA;,step]&#xA;resultData=DeleteDuplicatesBy[resultData,ToLowerCase[#[[1]]]&amp;amp;];&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If you have any questions, you are free to ask them. Perhaps I can answer it.&lt;/p&gt;&#xA;" OwnerUserId="58461" LastEditorUserId="33208" LastEditDate="2016-10-16T13:57:44.143" LastActivityDate="2016-10-16T13:57:44.143" Title="CodeGolf Statistics - First 10 FrontPage sides" Tags="|discussion|code-golf|statistics|" AnswerCount="0" CommentCount="10" FavoriteCount="0" ClosedDate="2016-10-19T22:38:27.593" ContentLicense="CC BY-SA 3.0" />
  <row Id="10254" PostTypeId="2" ParentId="2140" CreationDate="2016-10-06T23:33:07.133" Score="1" Body="&lt;hr /&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;The challenge is to determine if two complex lines intersect.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Given two lines made up of multiple straight line segments determine if the lines cross at any point.&lt;/p&gt;&#xA;&lt;p&gt;Input can be in the format of you choice that takes a series of [x,y] coordinates.  All coordinates will be integers (positive or negative)&lt;/p&gt;&#xA;&lt;p&gt;Output will be truthy if the lines cross and falsey if they don't cross.&lt;/p&gt;&#xA;&lt;p&gt;There will be no coincidental points and no segment of one line will terminate at a point touching the other line (there will be a clean cross of line segments if the case is truthy).&lt;/p&gt;&#xA;&lt;p&gt;This is code golf so shortest answer wins&lt;/p&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;For the examples formats are given as&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Line 1: [[X1,Y1],[X2,Y2]...,[Xn,Yn]] Line 2: [[X1,Y1],[X2,Y2]...,[Xn,Yn]]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Examples&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Line 1: [[0,0],[1,1]] Line 2: [[0,1],[1,0]] = TRUE&lt;/p&gt;&#xA;&lt;p&gt;Line 1: [[2,2],[1,0],[0,2]] Line 2: [[0,1],[1,1]] = TRUE&lt;/p&gt;&#xA;&lt;p&gt;Line 1: [[1,3],[2,9],[3,6],[4,7],[5,4],[6,1]]  Line 2: [[2,6],[3,5],[5,2]] = FALSE&lt;/p&gt;&#xA;&lt;p&gt;Line 1: [[0,6],[3,8],[5,5],[8,5]]  Line 2: [[0,4],[3,7],[5,4],[7,6]] = TRUE&lt;/p&gt;&#xA;&lt;p&gt;Line 1: [[2,2],[3,2]] Line 2: [[1,1],[10,4]] = FALSE&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/uuCsG.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/uuCsG.gif&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Please let me know your thoughts, first puzzle.&lt;/p&gt;&#xA;" OwnerUserId="59423" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-06T23:54:16.903" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10255" PostTypeId="2" ParentId="2140" CreationDate="2016-10-07T00:48:02.923" Score="3" Body="&lt;h1&gt;Make an un-polyglot-able language!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The cops' task is to create a language that is as hard to polyglot as possible. However, when making a language, you must follow these rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;ASCII characters only.&lt;/li&gt;&#xA;&lt;li&gt;The language must fit our definition of programming language, i.e. it must be able to add two numbers together, and check, when given a numerical input, if a number is prime or not.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must post the adder and prime checker (the full program) into your answer, and they must be at most &lt;code&gt;1kb&lt;/code&gt; in size.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;You must post your full interpreter into the answer as well.&lt;/li&gt;&#xA;&lt;li&gt;Also, give a run-down of what each command in your language is and how your language works in general.&lt;/li&gt;&#xA;&lt;li&gt;You must complete the robbers' task, which is to create a polyglot of your language and a language from &lt;a href=&quot;http://pypl.github.io/PYPL.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;this list&lt;/a&gt; that outputs &quot;Hello, World!&quot;. It must not exceed &lt;code&gt;5kb&lt;/code&gt;.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If your language doesn't support ASCII output, you can write a program that outputs the ASCII character codes of each character of &quot;Hello, World!&quot;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;All four of the things above (interpreter, adder, prime checker and &quot;Hello, World!&quot; polyglot) MUST fit into your answer.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;After your challenge is &lt;code&gt;Cracked&lt;/code&gt;, you must post your answer to the robbers' task.&lt;/li&gt;&#xA;&lt;li&gt;If your language has not been &lt;code&gt;Cracked&lt;/code&gt; for over 7 days, then your language is &lt;code&gt;Safe&lt;/code&gt;. You must put &lt;code&gt;Safe&lt;/code&gt; in your header, and post your solution.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your language answer should look like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# {language name}, {cracked/safe} (&amp;lt;- the &quot;cracked/safe&quot; is only to be used &#xA;                                   when your lang is either cracked or safe)&#xA;&#xA;{language description}&#xA;&#xA;{full interpreter}&#xA;&#xA;{adder} (max 1kb)&#xA;&#xA;{primality checker} (max 1kb)&#xA;&#xA;{Hello World polyglot} (&amp;lt;- only posted if your lang is cracked or safe, max 5kb)&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The robbers' task is to create a polyglot using any cops' language that outputs &quot;Hello, World!&quot;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must output the exact string &quot;Hello, World!&quot;, nothing more and nothing less (except for leading and trailing linefeeds).&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the cop's language doesn't support ASCII output, you may output the ASCII character codes of &quot;Hello, World!&quot;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;You only need to support two languages: the cops' one and one from &lt;a href=&quot;http://pypl.github.io/PYPL.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;this list of common languages&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The final polyglot must not exceed &lt;code&gt;5kb&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your answer should look like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# {language name}, {original author}, {bytecount}&#xA;&#xA;    {insert code here}&#xA;&#xA;{description of code}&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Post a comment on the (in the cops' thread) language that you &lt;code&gt;Cracked&lt;/code&gt;, linking them to your answer.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The winner will be:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;(Cops) the safe language that has the lowest byte-count for the &quot;Hello, World!&quot; polyglot. It will be declared after 1 month.&lt;/li&gt;&#xA;&lt;li&gt;(Robbers) the person who has cracked the most languages.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In case the language list changes, the languages are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Java, Python, PHP, C#, Javascript, C++, C, Objective C, R, Swift, Matlab,&#xA;Ruby, VBA, Visual Basic, Scala, Perl, Lua, Delphi, Go, Haskell, Rust&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Meta:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this challenge a dupe?&lt;/li&gt;&#xA;&lt;li&gt;Anything I can improve on?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="49561" LastEditDate="2016-10-07T05:06:04.890" LastActivityDate="2016-10-07T05:06:04.890" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10257" PostTypeId="2" ParentId="2140" CreationDate="2016-10-07T17:33:33.417" Score="1" Body="&lt;h1&gt;Raytracing/Raycasting&lt;/h1&gt;&#xA;&lt;p&gt;Here is a 256*256 heightmap. Your challenge is to render it, in minecraft-style blocks, using some form of raytracing.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/uYkDc.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/uYkDc.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Fundamental Definitions And Clarifications&lt;/h3&gt;&#xA;&lt;p&gt;These are all straightforward and fairly obvious but I'm being explicit so that what follows is (ideally) unambiguous.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Let each pixel represent &lt;code&gt;1x1&lt;/code&gt; metre, for ease of thought.&lt;/li&gt;&#xA;&lt;li&gt;This image is a top-down view. The bottom-left pixel of the image in screen space is at &lt;code&gt;[0,0,0]&lt;/code&gt; in world space. The bottom-right pixel of the image in screen space is at &lt;code&gt;[255,0,0]&lt;/code&gt; &lt;em&gt;(i.e. the next full tile to the right would be anchored at &lt;code&gt;[256,0,0]&lt;/code&gt;)&lt;/em&gt;. The Z-axis increases away from us in world space so the top-left pixel is at &lt;code&gt;[0,0,255]&lt;/code&gt; and the top-right-pixel is at &lt;code&gt;[255,0,255]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;As you are looking down to the floor at the moment, you have positive height and the vector from your eye to the image points in the direction of &lt;code&gt;[0,-1,0]&lt;/code&gt;, so the camera which corresponds to the above image has a world-space coordinate of something like &lt;code&gt;[128,300,128]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;It shouldn't really matter, but let's take the red channel as holding the height. A red channel value of &lt;code&gt;foo&lt;/code&gt; puts that pixel at &lt;code&gt;y=foo&lt;/code&gt;. The tallest possible pixel would have world coordinate &lt;code&gt;[x,255,z]&lt;/code&gt; with &lt;code&gt;0&amp;lt;=x,z&amp;lt;256&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Aesthetic Definitions&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each pixel effectively represents a tower some number of 1x1x1 solid cubes. The edges of these blocks should be rendered sharply at 90-degree angles. If you were to convert this scene to triangles, each normal would be along one of the major axes. You can think of blocks having end-caps on their top (which is the floor, to us), and walls are extruded between neighbouring blocks as required. &lt;strong&gt;There are no holes in the rendered surface&lt;/strong&gt;. You can assume all renderings will be from above (extra implied geometry below the floor doesn't matter).&lt;/li&gt;&#xA;&lt;li&gt;As well as the heightmap, the world contains &lt;strong&gt;one camera&lt;/strong&gt; and &lt;strong&gt;one light&lt;/strong&gt; source. The light casts hard shadows, so every rendered pixel will require two ray casts. Light falloff is inverse-square. You may optionally gamma-correct the result.&lt;/li&gt;&#xA;&lt;li&gt;Pixels on a surface which receive no light should be black. Pixels of rays which do not hit any surface should be magenta: &lt;code&gt;rgb=(255,0,255)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Input Parameters&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The camera is defined by position &lt;code&gt;P=[px,py,pz]&lt;/code&gt;, a &lt;code&gt;T=[tx,ty,tz]&lt;/code&gt; target point, and a field of view &lt;code&gt;FOV&lt;/code&gt;. It renders &lt;code&gt;WIDTH x HEIGHT&lt;/code&gt; images such that the target point appears in the centre.&lt;/li&gt;&#xA;&lt;li&gt;The camera is orientated such that it yaws, then pitches, but does not roll.&lt;/li&gt;&#xA;&lt;li&gt;The light is at position &lt;code&gt;L=[lx,ly,lz]&lt;/code&gt; and casts light uniformly in all directions.&lt;/li&gt;&#xA;&lt;li&gt;You solution must be posted with reference image rendered with &lt;code&gt;P=[80,256,0]&lt;/code&gt;, &lt;code&gt;T=[128,50,200]&lt;/code&gt;, &lt;code&gt;L=[256,300,128]&lt;/code&gt;, &lt;code&gt;WIDTH=400&lt;/code&gt;, &lt;code&gt;HEIGHT=300&lt;/code&gt; and &lt;code&gt;FOV=45 degrees&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;(As reference images emerge I might tweak these parameters.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Free Parameters&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The light can be any colour and brightness you like but the colour and brightness must be inputs to the program.&lt;/li&gt;&#xA;&lt;li&gt;Likewise, the colour/material of the surface may be anything you like (except magenta, which is for revealing holes) but these colour/material parameters must be an adjustable input to the program.&lt;/li&gt;&#xA;&lt;li&gt;Use any lighting/shader model you like.&lt;/li&gt;&#xA;&lt;li&gt;Use fog or other effects if you like. Different submissions are likely to vary considerably in size, so there's room to play a bit.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Criteria&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must post code which can be run as-is, with the specified reference parameters and all your free parameters included.&lt;/li&gt;&#xA;&lt;li&gt;You can take the heightmap image as hardcoded in a representation of your choice and this does &lt;em&gt;not&lt;/em&gt; count towards your golf score. You must post the code which converts an image to your preferred format. This script should either run using common Linux command-line tools, or over an online service. This script should &lt;em&gt;not&lt;/em&gt; assume that heightmaps are square.&lt;/li&gt;&#xA;&lt;li&gt;The output of raw pixel data can be in any format you like (e.g. &lt;code&gt;[[r,g,b],...]&lt;/code&gt; BUT you must provide a second script, not counted towards your golf score, which turns your program's raw output into some standard image format such as PNG. This script should either run using common Linux command-line tools, or over an online service.&lt;/li&gt;&#xA;&lt;li&gt;You must post the final image produced by this method, as well as the code which produces the output which produces the image.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;In a nutshell, the above specifies that your output is reproducible, with different parameters and heightmap images as desired.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;The winner&lt;/strong&gt; will be chosen a few weeks from now, as the shortest code which conforms to the above aesthetic specifications (e.g. shadows, no holes, etc) and which gives end-to-end reproducible results.&lt;/p&gt;&#xA;" OwnerUserId="19993" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-07T17:33:33.417" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10258" PostTypeId="1" AcceptedAnswerId="10259" CreationDate="2016-10-07T20:17:19.023" Score="10" ViewCount="317" Body="&lt;p&gt;In QBasic, VBA, AppleScript, etc., there is an autoformatter that adds spaces and expands some syntactic sugar. For example, if I type this code:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;?x*2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;QBasic will expand it to&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;PRINT x * 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Should I count this code as 4 bytes or 11?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Edit:&lt;/em&gt; Nathan Merrill brings up &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7121/16766&quot;&gt;How to count bytes in macro heavy languages&lt;/a&gt; as a closely related question. I agree that it's related, but I don't think it's a duplicate. The reason why I asked this question is because &lt;em&gt;the normal usage of these programming languages&lt;/em&gt; adds spaces automatically. It's not something that happens when the programmer chooses to expand macros--it's something that happens without any action on the programmer's part. It would be easy to conclude that the fully spaced version is the &lt;em&gt;correct&lt;/em&gt; syntax of the language, and therefore that the condensed version is illegal for code golf submissions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's a link to &lt;a href=&quot;https://codegolf.stackexchange.com/a/95618/16766&quot;&gt;the answer that prompted me to ask this question&lt;/a&gt;. Also pertinent is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69/golf-you-a-quine-for-great-good/47119#comment110590_47119&quot;&gt;this comment&lt;/a&gt; on my QBasic quine, which suggests that a quine using condensed syntax isn't valid because &quot;the autoformatter can't be turned off&quot; in QBasic 1.1.&lt;/p&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-10-11T20:41:50.910" Title="How to count bytes in languages with autoformatters" Tags="|discussion|code-golf|answers|scoring|" AnswerCount="2" CommentCount="10" ClosedDate="2016-10-17T18:15:55.943" ContentLicense="CC BY-SA 3.0" />
  <row Id="10259" PostTypeId="2" ParentId="10258" CreationDate="2016-10-07T20:17:19.023" Score="24" Body="&lt;h2&gt;Count code size before autoformatting&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Rationale: You can type or paste unformatted code into the interpreter, hit run, and it works. The fact that the interpreter adds whitespace or expands shortcuts is irrelevant. If you typed 4 bytes, the size of your program is 4 bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rationale 2: Geobits points out that many IDEs have an option to turn autoformatting off. In this case, it's even clearer that the unformatted code is legitimate code that the interpreter can run directly.&lt;/p&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="16766" LastEditDate="2016-10-10T04:16:12.080" LastActivityDate="2016-10-10T04:16:12.080" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10267" PostTypeId="2" ParentId="10258" CreationDate="2016-10-09T08:33:19.973" Score="0" Body="&lt;h1&gt;Count file size&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Why not use the original scoring mechanism and just use the byte count of the source file? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This can be quite effective due to the fact that BASIC languages often use tokenisation, shortening the length of the file.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2016-10-09T08:33:19.973" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10272" PostTypeId="2" ParentId="2140" CreationDate="2016-10-10T02:12:08.203" Score="1" Body="&lt;h1&gt;First 100 prime numbers in Wentelx87 &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Wentel consists of, at the basic level, a memory pointer and an instruction pointer. Instructions are stored loaded into memory. The execution pointer moves to the right after executing the instruction at that memory pointer.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;The program is loaded into rightmost slot of memory. For example, if your program is &lt;code&gt;0010 0000 0101 0100&lt;/code&gt;, &#xA;  then the virtual machine will look like this when started:&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0010 0000 0101 0100 (memory)&#xA;                                                            ^                   (execution pointer)&#xA;^                                                                               (memory pointer)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;(from &lt;a href=&quot;https://github.com/CrazyPython/wentelx87/blob/master/README.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;README&lt;/a&gt;)&lt;/h2&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Wentel documentation examples, thorough and clear explanation &lt;a href=&quot;https://github.com/CrazyPython/wentelx87&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Wentel is language that is very hard to program in. Unlike brain**k, functions and GOTOs can be implemented. It emulates real machine code/assembly much better than brainf**k.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Wentel is a simple language. &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;instructions are held in the rightmost cells, one cell = one instruction&lt;/li&gt;&#xA;&lt;li&gt;execution pointer starts out on first instruction&lt;/li&gt;&#xA;&lt;li&gt;execution pointer moves right&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;the same cells that hold memory hold instructions.&lt;/strong&gt; &lt;/li&gt;&#xA;&lt;li&gt;these are the opcodes:&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;0000&lt;/code&gt;&lt;/strong&gt; - no-op&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;0001&lt;/code&gt;&lt;/strong&gt; - if the current address's value is equal to the value stored by the adress defined by the next word, move the execution pointer to the address pointed to the next word after the word after the current address.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;0010&lt;/code&gt;&lt;/strong&gt; - move memory pointer to address specified by next word.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;0011&lt;/code&gt;&lt;/strong&gt; - deposit the current address of the execution pointer into the current memory address&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;0100&lt;/code&gt;&lt;/strong&gt; - increment current memory address&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;0101&lt;/code&gt;&lt;/strong&gt; - decrement current memory address&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;0110&lt;/code&gt;&lt;/strong&gt; - move memory pointer left&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;0111&lt;/code&gt;&lt;/strong&gt; - move memory pointer right&lt;/p&gt;&#xA;&#xA;&lt;ol start=&quot;6&quot;&gt;&#xA;&lt;li&gt;and here are the specialized opcodes for output.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;1000&lt;/code&gt;&lt;/strong&gt; - output &lt;code&gt;0&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;1001&lt;/code&gt;&lt;/strong&gt; - output &lt;code&gt;1&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;That was a boiling down of Wentel. Please read the &lt;a href=&quot;https://github.com/CrazyPython/wentelx87/blob/master/README.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;full docs&lt;/a&gt;. Now for the actual challenge. Output the first 100 prime numbers, separated by spaces, in Wentel.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bits wins.&lt;/p&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2016-10-10T02:12:08.203" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10274" PostTypeId="1" CreationDate="2016-10-10T12:08:27.013" Score="7" ViewCount="446" Body="&lt;p&gt;According to our site's &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/20283&quot;&gt;definition of a programming language&lt;/a&gt; a language needs to be capable of addition of natural numbers and primality testing of natural numbers. Of the &lt;a href=&quot;https://en.wikipedia.org/wiki/Elementary_cellular_automaton&quot; rel=&quot;nofollow noreferrer&quot;&gt;elementary cellular automata&lt;/a&gt;, some are periodic and others are chaotic. Rule 110, which is in some sense near the border between periodic and chaotic, is &lt;a href=&quot;https://en.wikipedia.org/wiki/Rule_110&quot; rel=&quot;nofollow noreferrer&quot;&gt;known to be Turing complete&lt;/a&gt;. Rule 54 is rumoured to be Turing complete but not yet known to be.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I suspect that rule 126 is not Turing complete. I also suspect that it is not capable of addition or primality testing. However, I do not have a proof either way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How should such a rule be treated? Should a language be assumed valid until it can be proved that it does not meet our requirements? Or should it be assumed invalid until it can be proved that it does meet our requirements?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;This question was prompted by an &lt;a href=&quot;https://codegolf.stackexchange.com/a/6306/20283&quot;&gt;old answer on a recently active challenge&lt;/a&gt;. The answer has since been deleted.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-10-15T22:30:43.127" Title="Is Wolfram rule 126 a programming language?" Tags="|discussion|" AnswerCount="1" CommentCount="6" ClosedDate="2021-03-02T02:48:55.007" ContentLicense="CC BY-SA 3.0" />
  <row Id="10276" PostTypeId="1" CreationDate="2016-10-10T14:23:37.697" Score="4" ViewCount="203" Body="&lt;p&gt;&lt;em&gt;(This might apply to other languages though I do not know any. I have not found any fitting rule in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;this meta post&lt;/a&gt;: this question is here to hopefully fill this gap. Since this is very specific I don't think it will be of much use in said meta post)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;In Brachylog, the main predicate that is queried has two arguments, called &lt;em&gt;the &lt;code&gt;Input&lt;/code&gt;&lt;/em&gt; and &lt;em&gt;the &lt;code&gt;Output&lt;/code&gt;&lt;/em&gt;, and can itself only be true or false.&lt;/p&gt;&#xA;&lt;p&gt;In a sense, this is kind of equivalent to a function in an imperative language, which returns a boolean and which has two arguments.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;The input&lt;/em&gt; is called that because it is usually what is used to input things, and &lt;em&gt;the output&lt;/em&gt; is called the output because we usually say that it is a variable which will &amp;quot;receive&amp;quot; the output.&lt;/p&gt;&#xA;&lt;p&gt;For example, &lt;code&gt;brachylog_main(&amp;quot;test&amp;quot;, Z)&lt;/code&gt; means &lt;em&gt;query my Brachylog program with &lt;code&gt;&amp;quot;test&amp;quot;&lt;/code&gt; as Input and the Output being the variable called &lt;code&gt;Z&lt;/code&gt; (which will take the output value)&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;However&lt;/strong&gt;, there is absolutely nothing that prevents the following behaviors:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use &lt;code&gt;Output&lt;/code&gt; to input things&lt;/li&gt;&#xA;&lt;li&gt;Use &lt;code&gt;Input&lt;/code&gt; as a variable to receive outputs&lt;/li&gt;&#xA;&lt;li&gt;Use both &lt;code&gt;Input&lt;/code&gt; and &lt;code&gt;Output&lt;/code&gt; to input things&lt;/li&gt;&#xA;&lt;li&gt;Use both &lt;code&gt;Input&lt;/code&gt; and &lt;code&gt;Output&lt;/code&gt; as variables to receive outputs&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Obviously, those behaviors can be, in some challenges, more beneficial than the standard &lt;em&gt;input in &lt;code&gt;Input&lt;/code&gt;, output in &lt;code&gt;Output&lt;/code&gt;&lt;/em&gt;. In particular, it is sometimes shorter to input things in &lt;code&gt;Output&lt;/code&gt; and output things in &lt;code&gt;Input&lt;/code&gt; (so the reverse of the standard use), because of how Brachylog gets executed (from left to right starting with &lt;code&gt;Input&lt;/code&gt; and finishing with &lt;code&gt;Output&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;h3&gt;Should those altenatives be forbidden?&lt;/h3&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-29T17:36:55.153" Title="Acceptable ways of using Input and Output variables in Brachylog" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10277" PostTypeId="2" ParentId="10276" CreationDate="2016-10-10T14:26:38.230" Score="0" Body="&lt;h1&gt;Yes, they should be forbidden&lt;/h1&gt;&#xA;&lt;p&gt;Semantically, there is no reason why &lt;code&gt;Input&lt;/code&gt; and &lt;code&gt;Output&lt;/code&gt; couldn't be used that way, except for their names (which wouldn't be a problem had they been called &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt; instead).&lt;/p&gt;&#xA;&lt;p&gt;Just like in Prolog, there is no reason why we couldn't use the second argument of a predicate to input things instead of the first.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;However&lt;/strong&gt;, &lt;code&gt;Input&lt;/code&gt; and &lt;code&gt;Ouput&lt;/code&gt; are not strictly symmetrical in Brachylog precisely because the execution is left to right, and &lt;code&gt;Input&lt;/code&gt; is on the very left of a rule and &lt;code&gt;Output&lt;/code&gt; on the very right.&lt;/p&gt;&#xA;&lt;p&gt;Therefore there is actually a difference between the two variables. As such, since &lt;code&gt;Input&lt;/code&gt; is the default variable used to input things and &lt;code&gt;Output&lt;/code&gt; is the default variable to output things, it should &lt;strong&gt;always&lt;/strong&gt; be that way so as to not get a potentially unfair advantage.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Note: this obviously does not apply to intermediate predicate calls in the code; there you can do anything you wish since it is part of golfing.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-10T14:37:50.423" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10281" PostTypeId="2" ParentId="10274" CreationDate="2016-10-11T01:27:31.030" Score="16" Body="&lt;h2&gt;It's invalid until proven valid&lt;/h2&gt;&#xA;&lt;p&gt;If you cannot prove that a language can do addition and primality testing, it's not a programming language by our definition.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-11T01:27:31.030" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10283" PostTypeId="2" ParentId="2140" CreationDate="2016-10-11T14:29:48.923" Score="1" Body="&lt;p&gt;A simple but fun code golf challenge!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given positive integer &lt;code&gt;n&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;create a 2 dimensional matrix where each location is filled with it's xy index (starting from the top left).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your grid should look like:&#xA;input: 2&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;00 10&#xA;01 11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;input: 3&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;00 10 20&#xA;01 11 21&#xA;02 12 22&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Once the grid is created, randomly &lt;code&gt;fill&lt;/code&gt; each index. This can be with an 'x' or any other way to denote a spot has been &lt;code&gt;filled&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A complete simulation looks like:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;input: 3&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x x x&#xA;x x x&#xA;x x x&#xA;&#xA;O O O&#xA;O O O&#xA;O O O&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You can use whatever character you want to fill in each location.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Extra points if you use a GUI and use black squares to fill it in&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should only &lt;code&gt;fill&lt;/code&gt; a spot in once so the number of times you fill should be n^2. (So no randomly filling spots until they are all filled you have to check!)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can refresh the grid however you want. i.e print the grid, make a new line, print again... You can use a timer. However you want to do it to illustrate each step. You only need to refresh when you are &lt;code&gt;filling&lt;/code&gt; not when you are populating the grid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An example simulation looks like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;input: 2&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;00 10&#xA;01 11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;randomed &lt;code&gt;01&lt;/code&gt; &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;00 10&#xA;XX 11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;randomed &lt;code&gt;11&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;00 10&#xA;XX XX&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;randomed &lt;code&gt;11&lt;/code&gt;&lt;br/&gt;&#xA;re-roll&lt;br/&gt;&#xA;randomed &lt;code&gt;01&lt;/code&gt;&lt;br/&gt;&#xA;re-roll&lt;br/&gt;&#xA;randomed &lt;code&gt;00&lt;/code&gt;&lt;br/&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;XX 10&#xA;XX XX&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;randomed &lt;code&gt;10&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;XX XX&#xA;XX XX&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Complete&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do not display your randomed numbers, the output should tell me which were randomed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Have fun!&lt;/p&gt;&#xA;" OwnerUserId="60356" LastEditorUserId="60356" LastEditDate="2016-10-11T14:37:50.797" LastActivityDate="2016-10-11T14:37:50.797" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10286" PostTypeId="2" ParentId="2140" CreationDate="2016-10-11T20:07:45.870" Score="1" Body="&lt;h1&gt;Just like magic&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Nowadays, the word &quot;abracadabra&quot; is used mostly in connection with magic tricks. The original purpose of the word had more to do with superstition, and some doctors used it to make lethal diseases go away by writing it in a triangle&lt;sup&gt;1&lt;/sup&gt;, like so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A B R A C A D A B R A&#xA; A B R A C A D A B R&#xA;  A B R A C A D A B&#xA;   A B R A C A D A&#xA;    A B R A C A D&#xA;     A B R A C A&#xA;      A B R A C&#xA;       A B R A&#xA;        A B R&#xA;         A B&#xA;          A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a program or function that outputs/returns the exact text shown above in as few bytes as possible. The output may contain trailing spaces on each line and/or trailing newlines. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so &lt;strong&gt;the shortest code in bytes wins&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1. &lt;a href=&quot;https://en.wikipedia.org/wiki/Abracadabra&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://en.wikipedia.org/wiki/Abracadabra&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is it too simple?&lt;/li&gt;&#xA;&lt;li&gt;Is it a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Any better name ideas?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42545" LastActivityDate="2016-10-11T20:07:45.870" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10287" PostTypeId="1" CreationDate="2016-10-11T21:02:46.517" Score="27" ViewCount="1207" Body="&lt;p&gt;The name of this Stack Exchange site is &quot;Programming Puzzles and Code golf&quot; but I was wondering if other types of similar golf (not the sport) would be allowed or welcomed for questions.  In particular I was thinking about proof golf.  Where a statement in Propositional Calculus or First Order Logic is given and the goal is to create a proof using as few axioms of the system.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These types of puzzles are very much like code golfing in practice but they are certainly not code golf or a programing puzzle.  I thought it might make a fun one-off challenge, but on the other hand it might be a bit out of scope for this site.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2016-10-11T21:50:23.677" Title="Are Non-Programming golf puzzles allowed?" Tags="|discussion|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10288" PostTypeId="2" ParentId="10287" CreationDate="2016-10-11T21:05:02.080" Score="0" Body="&lt;h1&gt;No.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We're a programming site. Thus, all submissions (and therefore challenges) must involve the use of code*.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;* A programming language which is executable through a digital interpreter.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="44713" LastActivityDate="2016-10-11T21:05:02.080" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10290" PostTypeId="2" ParentId="10287" CreationDate="2016-10-11T21:34:29.983" Score="44" Body="&lt;h2&gt;Yes, this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Or, it's what atomic code golf should be. Take a look at &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/37188/20260&quot;&gt;Multiply with restricted operations&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/12261/20260&quot;&gt;Build a multiplying machine using NAND logic gates&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/37071/implement-an-8-bit-adder&quot;&gt;Implement an 8 bit adder&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;All of them define a mini-language by listing a limited set of allowed operations, and ask for a task to be done in as few of these operations as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the same vein, one could have a challenge to construct a regular pentagon in as few ruler-and-compass operations, writing out the operation like &quot;draw a circle with the given point and the current radius&quot;, &quot;mark a point at the intersection of two lines&quot;, and so on. One could write an interpreter for this language, where each operation is a code instruction, the current picture is the program state, and so on. The result is a challenge like code golf, except that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All submissions must be in the given invented language  &lt;/li&gt;&#xA;&lt;li&gt;Rather than minimizing characters, one minimizes operations&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your first reaction might be, &quot;but that's not a programming language, it's geometry!&quot;. But why? Perhaps the &lt;a href=&quot;https://codegolf.stackexchange.com/q/12261/20260&quot;&gt;NAND gate&lt;/a&gt; language feels like programming because logic gates happen to be what computers use. It's just association. We already use esoteric languages where a &quot;program&quot; is &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/FRACTRAN&quot; rel=&quot;nofollow noreferrer&quot;&gt;A list of fractions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.vim.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Text editor instructions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Esoteric_programming_language#Piet&quot; rel=&quot;nofollow noreferrer&quot;&gt;A bitmap that look like abstract art&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/6949/20260&quot;&gt;A board for marbles&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And anyone is free to make their own language. Using weird languages is a point of pride in the community. So let's not call something &quot;not programming&quot; for not looking like a typical programming language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Formal proofs, which OP used as an example, have a particularly close relationship to programming. The &lt;a href=&quot;https://en.wikipedia.org/wiki/Curry%E2%80%93Howard_correspondence&quot; rel=&quot;nofollow noreferrer&quot;&gt;Curry-Howard correspondence&lt;/a&gt;, aka the proofs as programs interpretation, gives a formal mathematical equivalence between proofs and programs. A challenge to prove a statement in a formal system could be rephrased as writing a program that instantiates a given type.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-10-11T21:50:23.677" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10297" PostTypeId="2" ParentId="2140" CreationDate="2016-10-12T17:14:36.387" Score="0" Body="&lt;h1&gt;Is this Rubik's Cube Solvable?&lt;/h1&gt;&#xA;&lt;p&gt;The challenge: find out if a rubik's cube configuration is solvable.&lt;/p&gt;&#xA;&lt;p&gt;Takes input as a multidimensional array. An example for a solved cube would be&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA; [&#xA;  [0,0,0],&#xA;  [0,0,0],&#xA;  [0,0,0]&#xA; ],&#xA; [&#xA;  [1,1,1],&#xA;  [1,1,1],&#xA;  [1,1,1]&#xA; ],&#xA; [&#xA;  [2,2,2],&#xA;  [2,2,2],&#xA;  [2,2,2]&#xA; ],&#xA; [&#xA;  [3,3,3],&#xA;  [3,3,3],&#xA;  [3,3,3]&#xA; ],&#xA; [&#xA;  [4,4,4],&#xA;  [4,4,4],&#xA;  [4,4,4]&#xA; ],&#xA; [&#xA;  [5,5,5],&#xA;  [5,5,5],&#xA;  [5,5,5]&#xA; ]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;starting on the sides, going round, then top, then bottom. This input would give an output of 1, since it is solvable (very, &lt;em&gt;very&lt;/em&gt; solvable). A (small) net of this solved cube would therefore be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;     _&#xA; _ _|4|_&#xA;|0|1|2|3|&#xA; ¯ ¯|5|¯&#xA;     ¯&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The result of the program should be a truthy/falsey value, printed to STDOUT or similar. This is code-golf, so shortest answer in BYTES wins. Standard loopholes apply.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="60425" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-12T17:57:34.393" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="10302" PostTypeId="1" CreationDate="2016-10-13T05:41:00.867" Score="4" ViewCount="157" Body="&lt;p&gt;I'm trying to create a new challenge type called &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/prediction&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;prediction&amp;#39;&quot; rel=&quot;tag&quot;&gt;prediction&lt;/a&gt;. This is a very specific challenge that involves creating functions that try to match a given functions, but under memory constraints that make it impossible to just compute the value.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is based on a question I made &lt;a href=&quot;https://codegolf.stackexchange.com/questions/24571/print-a-specific-value-in-this-generated-binary-matrix?rq=1&quot;&gt;back in 2014&lt;/a&gt; (when people voted to just keep it as a code challenge), but my recent &lt;a href=&quot;https://codegolf.stackexchange.com/questions/95604/print-a-specific-value-in-the-wythoff-matrix-modulo-2&quot;&gt;Wythoff matrix&lt;/a&gt; question made me think about creating it again.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What do you think of this tag? Is it a good idea? Could it be something else? (I've already created a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary-prediction&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary-prediction&amp;#39;&quot; rel=&quot;tag&quot;&gt;binary-prediction&lt;/a&gt; tag, and there are a few problems &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10303/7110&quot;&gt;in the sandbox&lt;/a&gt; that I'd create as examples of that particular variant of a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/prediction&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;prediction&amp;#39;&quot; rel=&quot;tag&quot;&gt;prediction&lt;/a&gt; problem.)&lt;/p&gt;&#xA;" OwnerUserId="7110" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-10-13T06:57:55.837" Title="&quot;Prediction&quot; tag" Tags="|discussion|tags|" AnswerCount="0" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="10307" PostTypeId="2" ParentId="10127" CreationDate="2016-10-13T21:31:57.430" Score="21" Body="&lt;p&gt;For me I joined because it is fun. I spend all day writing readable code and sometimes it's nice to write something just because I can. I have no problems with golfing languages. The shortest code wins. Thats the rules most times. If I get an upvote for my Java/Python/Lotus Notes answer because I have done something smart that someone else thinks is cool then that's good enough for me. If someone beats my byte count with Jelly/GolfScript/AnyOtherGolfLang then respect to them for being able to do it. They get an upvote from me. I like this community. Let's not start taking it too seriously.&lt;/p&gt;&#xA;" OwnerUserId="56555" LastActivityDate="2016-10-13T21:31:57.430" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10310" PostTypeId="2" ParentId="2140" CreationDate="2016-10-14T12:53:42.757" Score="0" Body="&lt;p&gt;&lt;strong&gt;Image Smoothing&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input into your program a black and white image. (png, jpg, etc)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Convert the image to a 2-d matrix of pixels. Where each index is the grayscale value of the image.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Take each index of the matrix and average the 8 pixels around it. Then replace that index with the average.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example if you had:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;120 80  60&#xA;20  10  30&#xA;40  100 05&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If you were finding the average for 10, the result would be 56.875. Round to up to the nearest integer (57) and replace the index. The result of this iteration would be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;120 80  60&#xA;20  57  30&#xA;40  100 05&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If you are finding the average for a pixel on an edge then only take values that are valid. In the example above if you were finding the average for '20' You would only consider 112, 80, 57, 100, and 40, which is 79.4 rounded to 80.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may start at any index of the graph but it must be in order, for example of you must go right - left, left - right, up - down, or down - up. You may not go something like randomly pick the indices to average.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once the averaging is complete, convert the matrix back into a new image.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;display the new image as the output of the program. (Or save it and add it in your solution). The result of this process should be a normal crisp looking image and the result would be a smoothed out image.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please provide your code and start and end image (SFW please) and remember this is code-golf so the shortest code wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Good Luck and have fun!&lt;/p&gt;&#xA;" OwnerUserId="60356" LastEditorUserId="60356" LastEditDate="2016-10-14T15:33:15.697" LastActivityDate="2016-10-14T15:33:15.697" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10312" PostTypeId="2" ParentId="2140" CreationDate="2016-10-14T21:04:54.383" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Implement BozoCrack&lt;/h1&gt;&#xA;&lt;p&gt;Designed to show why MD5 is a &lt;em&gt;bad&lt;/em&gt; solution to password hashing, &lt;a href=&quot;https://github.com/juuso/BozoCrack&quot; rel=&quot;nofollow noreferrer&quot;&gt;BozoCrack&lt;/a&gt;, for the uninitiated, is a rather simple and efficient method of cracking MD5 hashes. It doesn't brute force, use rainbow tables or indeed, any sort of math at all.&lt;/p&gt;&#xA;&lt;p&gt;Instead, it &lt;em&gt;finds&lt;/em&gt; the key by searching google for the hash and comparing the hash of each word in the results with the input.&lt;/p&gt;&#xA;&lt;p&gt;Your task is simple: given at least one valid MD5 hash in a reasonable input format, find their source texts using Google and return or print to stdout the results.&lt;/p&gt;&#xA;&lt;p&gt;In fact, you could probably arrive at the answer by finding the word in the page with the most occurrences -- you needn't use the results for a dictionary attack, but you must use Google.&lt;/p&gt;&#xA;&lt;p&gt;The inputs can be given as an array of strings, as program arguments, space or otherwise delimited strings on standard input or in a file, etc -- whatever's easier for you, but make sure you specify in your answer how the input is taken.&lt;/p&gt;&#xA;&lt;p&gt;Example inputs / outputs:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input                            : Output&#xA;fcf1eed8596699624167416a1e7e122e : octopus&#xA;bed128365216c019988915ed3add75fb : passw0rd&#xA;d0763edaa9d9bd2a9516280e9044d885 : monkey&#xA;dfd8c10c1b9b58c8bf102225ae3be9eb : 12081977&#xA;ede6b50e7b5826fe48fc1f0fe772c48f : 1q2w3e4r5t6y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Of course, you may use your language's library function for computing the md5sum of a string -- but please, don't use any functions or libraries designed to solve exactly this task, e.g. Python's PyBozoCrack and the original BozoCrack.rb are disallowed.&lt;/p&gt;&#xA;&lt;p&gt;In the unlikely event there are no results for a sum, print &amp;quot;NO RESULTS&amp;quot; to stdout instead.&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-15T09:32:06.697" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10314" PostTypeId="2" ParentId="2140" CreationDate="2016-10-15T13:59:40.293" Score="2" Body="&lt;h2&gt;Show the Key Signature&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here is are the key signatures for the key of C♯ Major in the treble clef, and C♭ major in the bass clef:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;           ♯&#xA;─────♯───────────────────────   ─────────────────────────────&#xA;                    ♯&#xA;──────────────♯──────────────   ─────────────────────────────&#xA;        ♯                               ♭&#xA;───────────────────────♯─────   ──────────────♭──────────────&#xA;                 ♯                                  ♭&#xA;─────────────────────────────   ─────♭───────────────────────&#xA;                                           ♭&#xA;─────────────────────────────   ─────────────────♭───────────&#xA;                                                       ♭&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A full list of key signatures can be found &lt;a href=&quot;https://blog.key-notes.com/key-signature-chart.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;. Hopefully you will notice that a) the sharps and flats are two notes lower in the bass clef as compared to the treble clef b) all key signatures can be obtained from the C♯ Major and C♭ Major key signatures by removing trailing sharps and flats appropriately.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is, given a suitable representation of the clef and key, to output the appropriate key signature using the above format.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your output must have at least 11 lines, in order to accommodate all possible placings of sharps and flats.&lt;/li&gt;&#xA;&lt;li&gt;To compensate for the terrible aspect ratio, each sharp and flat must be separated by two columns, and there must be at least five empty columns at the beginning and end, but no more than 29 columns in total.&lt;/li&gt;&#xA;&lt;li&gt;You may use #, b and - characters instead of ♯, ♭ and ─.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest solution wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2016-10-15T13:59:40.293" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10318" PostTypeId="2" ParentId="2140" CreationDate="2016-10-15T22:04:50.347" Score="2" Body="&lt;h1&gt;Handwriting Recognition&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I made a similar suggestion a month or so back which was deemed to be too similar to an existing one, so I've added something along the lines of a kolmogorov-complexity requirement.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://yann.lecun.com/exdb/mnist/&quot; rel=&quot;nofollow noreferrer&quot;&gt;The MNIST dataset&lt;/a&gt; is a series of handwritten digits used as a standard testbed for machine learning, pattern recognition techniques. Each image is of a single digit, &lt;code&gt;0-9&lt;/code&gt;; as a &lt;code&gt;28x28&lt;/code&gt; pixel grayscale matrix with values from &lt;code&gt;0-255&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/yxeor.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/yxeor.png&quot; alt=&quot;MNIST example images&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is to create a classifier for MNIST that scores an Error Rate of less than &lt;code&gt;[TBD]&lt;/code&gt; in the least number of bytes possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program must take a &lt;code&gt;784&lt;/code&gt; element long array in whatever format is applicable for your language representing a single image and return a number between 0 and 9, guessing what the number is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the input for the first digit might be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  3, 18, 18, 18,126,136,175, 26,166,255,247,127,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0, 30, 36, 94,154,170,253,253,253,253,253,225,172,253,242,195, 64,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0, 49,238,253,253,253,253,253,253,253,253,251, 93, 82, 82, 56, 39,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0, 18,219,253,253,253,253,253,198,182,247,241,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0, 80,156,107,253,253,205, 11,  0, 43,154,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0,  0, 14,  1,154,253, 90,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,139,253,190,  2,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0, 11,190,253, 70,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0, 35,241,225,160,108,  1,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0, 81,240,253,253,119, 25,  0,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0, 45,186,253,253,150, 27,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0, 16, 93,252,253,187,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,249,253,249, 64,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0, 46,130,183,253,253,207,  2,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0, 39,148,229,253,253,253,250,182,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0,  0,  0, 24,114,221,253,253,253,253,201, 78,  0,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0, 23, 66,213,253,253,253,253,198, 81,  2,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0, 18,171,219,253,253,253,253,195, 80,  9,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0, 55,172,226,253,253,253,253,244,133, 11,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,136,253,253,253,212,135,132, 16,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,&#xA;   0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Each algorithm will be tested over a set of 200 images and are expected to get &lt;code&gt;[TBD]/200&lt;/code&gt; correct.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, when developing any good classifier, you need to test how well it works with a completely unknown sample. The twist of the challenge, these are the 200 images I am going to test with right here: (a link to 200 images and their correct labels). You only need to make sure you can classify at least &lt;code&gt;[TBD]/200&lt;/code&gt; of these, your algorithm won't be run on anything else. As such, this can be considered a kolmogorov complexity challenge with an acceptable error rate.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Conditions:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is code golf. The shortest piece of code that meets the criteria wins.&lt;/li&gt;&#xA;&lt;li&gt;The code must take a provided &lt;code&gt;784&lt;/code&gt; element long input and attempt to classify it.&lt;/li&gt;&#xA;&lt;li&gt;Testing will take place on my computer at 12pm AEST on Saturday the (date two weeks after the competition is published). I will run each classifier over the published set of 200 images. To be considered, it must correctly classify &lt;code&gt;[TBD]/200&lt;/code&gt; of them. If I can't get your code to run, it wont be counted, so help with loading the images in your language would be appreciated.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are not permitted.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Questions for Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Overall thoughts on the challenge?&lt;/li&gt;&#xA;&lt;li&gt;Any ideas on a good cutoff for the classifier? I was thinking around 60% correct. Very low when compared to existing solutions to MNIST, but should promote good code golfing. I was going to have a go at it myself to see what I could reasonably achieve.&lt;/li&gt;&#xA;&lt;li&gt;Does the testing clause make sense? Is it reasonable? Should I put a limit on the languages so I know I'll be able to run them?&lt;/li&gt;&#xA;&lt;li&gt;Since barrier to entry is a bit high (knowing how to get hold of the images, possibly some ML experience), is there anything extra I should do to make it easier to start the challenge.&lt;/li&gt;&#xA;&lt;li&gt;This is a modification of my first suggestion for a challenge, is there anything I'm missing?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="59564" LastEditorUserId="59564" LastEditDate="2016-10-15T22:38:11.200" LastActivityDate="2016-10-15T22:38:11.200" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10323" PostTypeId="2" ParentId="2140" CreationDate="2016-10-16T09:24:57.253" Score="1" Body="&lt;h2&gt;Ungolf batch&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/73230/56341&quot;&gt;This&lt;/a&gt; question wants you to golf batch programms. In Batch you can use &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;set x=averylongbatchcommand&#xA;%x% arg1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which expands to&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;set x=averylongbatchcommand&#xA;averylongbatchcommand arg1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your task is it to expand these statements.&lt;br /&gt;&#xA;As you can also use &lt;code&gt;set&lt;/code&gt;  for arithmetic purposes like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;set x = 0&#xA;set /a x= %x%+1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;you should ignore the statements where the pattern with &lt;code&gt;set /a&lt;/code&gt; is applied.&lt;br /&gt;&#xA;There will never be something like&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;set s=SET&#xA;%s% s=%s% a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where the variable is assigned using itself as command. But you have to handle things like&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;b:&#xA;set a =echo&#xA;%a% Hello World!&#xA;set a=goto&#xA;%a% b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the answer with the fewest bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;set s=set&#xA;%s% e=echo&#xA;%e% I will have to use this exact thing very often because&#xA;%e% it absolutely wouldn't be shorter if i just left out these set statements&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Expands to:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;set s=set&#xA;set e=echo&#xA;echo I will have to use this exact thing very often because&#xA;echo it absolutely wouldn't be shorter if i just left out these set statements&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;set s=set&#xA;%s% i=0&#xA;set g=goto&#xA;:a&#xA;if %i%==15 (&#xA;%g% e&#xA;)&#xA;%s% /a i=%i%+1&#xA;%g% a&#xA;:e&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Expands to:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;set s=set&#xA;set i=0&#xA;:a&#xA;if %i%==15(&#xA;set e&#xA;)&#xA;set /a i=%i%+1&#xA;goto a&#xA;e:&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;set s=set&#xA;%s% s=%s% a=&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Mustn't be supported.&lt;/p&gt;&#xA;" OwnerUserId="56341" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.533" LastActivityDate="2016-10-16T09:24:57.253" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10324" PostTypeId="1" CreationDate="2016-10-16T11:27:23.463" Score="3" ViewCount="60" Body="&lt;p&gt;I just noticed that the title text (displayed on mouse hover) of the up- and downvote buttons are currently &quot;This answer is useful&quot; and &quot;This answer is not useful&quot;. While they're useful for most SE sites, they don't make sense on PPCG. Is there any way we can change these texts?&lt;/p&gt;&#xA;" OwnerUserId="46901" LastEditorUserId="68942" LastEditDate="2021-06-09T06:09:16.460" LastActivityDate="2021-06-09T06:09:16.460" Title="Can we change the title text of the vote buttons" Tags="|feature-request|status-planned|user-interface|stackexchange|" AnswerCount="0" CommentCount="3" ClosedDate="2016-10-16T14:08:50.487" ContentLicense="CC BY-SA 3.0" />
  <row Id="10326" PostTypeId="2" ParentId="2140" CreationDate="2016-10-16T19:58:26.350" Score="1" Body="&lt;h1&gt;Convert Birkana to Hexademical&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hexadecimal&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hexadecimal&amp;#39;&quot; rel=&quot;tag&quot;&gt;hexadecimal&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://yawar.blogspot.ca/2016/10/the-birkana-hexadecimal-number-symbols.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Birkana&lt;/a&gt; is a not-very-well-known notation for hexadecimal using&#xA;rune-like symbols. The general structure of a Birkana rune is like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;|\     &amp;lt;-- 0x1&#xA;|/     &amp;lt;-- 0x2&#xA;|\     &amp;lt;-- 0x4&#xA;|/     &amp;lt;-- 0x8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The slash or backslash is present if its base number (&lt;code&gt;0x1&lt;/code&gt;, &lt;code&gt;0x2&lt;/code&gt;, &lt;code&gt;0x4&lt;/code&gt;,&#xA;or &lt;code&gt;0x8&lt;/code&gt;) is present in the number, or not otherwise. The pipe is always at&#xA;the left-hand side.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, here's the Birkana rune for &lt;code&gt;0xD&lt;/code&gt; (= &lt;code&gt;0x1 + 0x4 + 0x8&lt;/code&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;|\&#xA;|&#xA;|\&#xA;|/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a Birkana rune as input, write a program or function to output the&#xA;corresponding hexadecimal digit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may choose to output either lowercase (&lt;code&gt;a-f&lt;/code&gt;) or uppercase (&lt;code&gt;A-F&lt;/code&gt;) hex&#xA;digits, but they cannot be mixed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You only need to support the 16 hexadecimal digits and their corresponding&#xA;Birkana runes.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input&#xA;Output&#xA;&#xA;|&#xA;|&#xA;|&#xA;|&#xA;0&#xA;&#xA;|\&#xA;|&#xA;|&#xA;|&#xA;1&#xA;&#xA;|&#xA;|/&#xA;|&#xA;|&#xA;2&#xA;&#xA;|\&#xA;|/&#xA;|&#xA;|&#xA;3&#xA;&#xA;|&#xA;|&#xA;|\&#xA;|&#xA;4&#xA;&#xA;|\&#xA;|&#xA;|\&#xA;|&#xA;5&#xA;&#xA;|&#xA;|/&#xA;|\&#xA;|&#xA;6&#xA;&#xA;|\&#xA;|/&#xA;|\&#xA;|&#xA;7&#xA;&#xA;|&#xA;|&#xA;|&#xA;|/&#xA;8&#xA;&#xA;|\&#xA;|&#xA;|&#xA;|/&#xA;9&#xA;&#xA;|&#xA;|/&#xA;|&#xA;|/&#xA;A&#xA;&#xA;|\&#xA;|/&#xA;|&#xA;|/&#xA;B&#xA;&#xA;|&#xA;|&#xA;|\&#xA;|/&#xA;C&#xA;&#xA;|\&#xA;|&#xA;|\&#xA;|/&#xA;D&#xA;&#xA;|&#xA;|/&#xA;|\&#xA;|/&#xA;E&#xA;&#xA;|\&#xA;|/&#xA;|\&#xA;|/&#xA;F&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer (in bytes) wins.&lt;/p&gt;&#xA;" OwnerUserId="56755" LastActivityDate="2016-10-16T19:58:26.350" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10328" PostTypeId="1" CreationDate="2016-10-17T03:38:44.883" Score="25" ViewCount="710" Body="&lt;p&gt;There are people who have already been golfing for a while on other golfing sites, language-specific forums, local groups, and so on. I think we'd benefit a lot from having them here to contribute their knowledge and enthusiasm. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;What can we do better to attract experienced golfers to join us?&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2016-10-26T16:44:34.463" Title="How can we attract experienced golfers?" Tags="|discussion|new-users|" AnswerCount="5" CommentCount="18" ContentLicense="CC BY-SA 3.0" />
  <row Id="10332" PostTypeId="2" ParentId="10328" CreationDate="2016-10-17T19:14:45.097" Score="6" Body="&lt;h1&gt;By attracting more users in general&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If we can attract more users in general, that will automatically help get experienced golfers from other sites. Everyone, and specially someone with experience, prefers to join a site where they can &lt;s&gt;show off&lt;/s&gt; demostrate their abilities in front of a larger audience.&lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2016-10-17T19:34:44.110" LastActivityDate="2016-10-17T19:34:44.110" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10336" PostTypeId="2" ParentId="2140" CreationDate="2016-10-18T17:25:07.513" Score="0" Body="&lt;h1&gt;AlphaGo..olf?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Slight paraphrased) Extract from &lt;a href=&quot;https://en.wikipedia.org/wiki/AlphaGo&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;: &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;AlphaGo is a computer program developed by Google DeepMind in London to play the board game Go and is the first computer Go program has beaten a 9-dan professional without handicaps.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In order to appreciate the Go art more, let's try to simulate what happens to the game when a move is made!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input will be: &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;a 4x4 board, (Here &lt;code&gt;.&lt;/code&gt; denotes empty, &lt;code&gt;o&lt;/code&gt; and &lt;code&gt;x&lt;/code&gt; denotes different color of stones held by the 2 players respectively for illustration.  Any standard input formats (2d array, array as sequence of alternative moves...) are welcomed as we like nice algorithms!)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;a move to be made (Like &lt;code&gt;A4&lt;/code&gt;, &lt;code&gt;B2&lt;/code&gt;.  You may also like to use 0-indexed and both numeric indices like &lt;code&gt;(0,0)..(3,3)&lt;/code&gt;)  For simplicity's sake, the move to be made is always with &lt;code&gt;o&lt;/code&gt; (i.e. always the same color).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The board after the move is made.  Stones of the opposite color (i.e. &lt;code&gt;x&lt;/code&gt;) will be taken away iff there are no more connected &lt;code&gt;x&lt;/code&gt; that has at least 1 &lt;code&gt;.&lt;/code&gt; in its 4-neighbor (Up, Down, Left, Right).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  Input | Move | Output&#xA;  ABCD  |      |&#xA;1 ....  | A1   | o...   (case 1: all stones remains on board)&#xA;2 ....  |      | ....&#xA;3 ..x.  |      | ..x.&#xA;4 ....  |      | ....&#xA;--------+------+--------&#xA;  ....  | B1   | .o..&#xA;  oxo.  |      | o.o.   (case 2: x taken away: the only . is taken)&#xA;  .ox.  |      | .ox.&#xA;  ....  |      | ....&#xA;--------+------+--------&#xA;  ..o.  | B1   | .oo.&#xA;  oxxo  |      | o..o   (case 3: &amp;gt;1 x taken away: the only . is taken)&#xA;  .oxo  |      | .o.o&#xA;  .xo.  |      | .xo.&#xA;--------+------+--------&#xA;  o.xo  | B1   | oo.o&#xA;  ..o.  |      | ..o.   (case 4: Edge case)&#xA;  ....  |      | ....&#xA;  ..o.  |      | ..o.&#xA;--------+------+--------&#xA;  x.o.  | B1   | .oo.&#xA;  ooxo  |      | ooxo   (case 5: Corner case)&#xA;  ...o  |      | ...o&#xA;  ..o.  |      | ..o.&#xA;--------+------+--------&#xA;  xxxx  | B2   | ....&#xA;  x.xx  |      | .o..   (case 6: Enclosed by Board case)&#xA;  xxxx  |      | ....&#xA;  xxxx  |      | ....&#xA;--------+------+--------&#xA;  .oxx  | C2   | .o..&#xA;  ox.x  |      | o.o.   (case 7: Enclosed by o case)&#xA;  oxxx  |      | o...&#xA;  .ooo  |      | .ooo&#xA;--------+------+--------&#xA;  .xo.  | A1   | o.o.&#xA;  xo..  |      | .o..   (case 8: taking multiple groups case)&#xA;  o...  |      | o...&#xA;  ....  |      | ....&#xA;--------+------+--------&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; thus the shortest code wins.&lt;/li&gt;&#xA;&lt;li&gt;Please kindly provide explanations and ways to test the solutions!&lt;/li&gt;&#xA;&lt;li&gt;The Input board can be assumed to be correct: there will be neither &lt;code&gt;x&lt;/code&gt; that without a connected &lt;code&gt;x&lt;/code&gt; with &lt;code&gt;.&lt;/code&gt;, nor a group of &lt;code&gt;o&lt;/code&gt; surrounded by &lt;code&gt;x&lt;/code&gt; without &lt;code&gt;.&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The Input move can be assumed to be legitimate: either it won't be a position surrounded by &lt;code&gt;x&lt;/code&gt;, or it must take away some &lt;code&gt;x&lt;/code&gt; to free &lt;code&gt;.&lt;/code&gt; for the &lt;code&gt;o&lt;/code&gt; to live. (ref. case 6, 7, 8)&lt;/li&gt;&#xA;&lt;li&gt;The output must be the board, it may or may not be in the same format as the input (if you take input as 2 arrays of &lt;code&gt;o&lt;/code&gt; and &lt;code&gt;x&lt;/code&gt; positions, say). &lt;strong&gt;Output that only shows the stones that are taken away after the move is made&lt;/strong&gt; will not be accepted.&lt;/li&gt;&#xA;&lt;li&gt;Again, feel free to play with the standard input formats. Hope to see interesting &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt; playing Go instead of &lt;code&gt;o&lt;/code&gt; and &lt;code&gt;x&lt;/code&gt; :P&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Meta Questions&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;I don't know if this may be too hard. Would it be better if I allow golfers to fail some test cases and get penalty instead?&lt;/li&gt;&#xA;&lt;li&gt;Should I stick with a 4x4 board or I can award minus scores if the solution can work with a 19x19 board?&lt;/li&gt;&#xA;&lt;li&gt;If it is a &lt;code&gt;yes&lt;/code&gt; to any of the above questions, which should be the number for the penalty / award?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Thanks!&lt;/p&gt;&#xA;" OwnerUserId="59806" LastActivityDate="2016-10-18T17:25:07.513" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10339" PostTypeId="2" ParentId="2140" CreationDate="2016-10-19T12:58:28.857" Score="0" Body="&lt;p&gt;(Need a title.)&lt;/p&gt;&#xA;&lt;p&gt;Your task is to write 3 programs (or functions) that check if the input is a string of balanced brackets satisfying all the following criteria:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The number of &lt;code&gt;[]&lt;/code&gt;s is always less than or equal to the number of &lt;code&gt;()&lt;/code&gt;s surrounding each position.&lt;/li&gt;&#xA;&lt;li&gt;The number of &lt;code&gt;{}&lt;/code&gt;s is always less than or equal to the sum of the numbers of &lt;code&gt;()&lt;/code&gt;s and &lt;code&gt;[]&lt;/code&gt;s surrounding each position.&lt;/li&gt;&#xA;&lt;li&gt;The number of &lt;code&gt;&amp;lt;&amp;gt;&lt;/code&gt;s is always less than or equal to the product of the number of &lt;code&gt;()&lt;/code&gt; &lt;code&gt;[]&lt;/code&gt; and &lt;code&gt;{}&lt;/code&gt;s surrounding each position.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You can assume that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are only the characters &lt;code&gt;()[]&lt;/code&gt; in the input of your program 1.&lt;/li&gt;&#xA;&lt;li&gt;There are only the characters &lt;code&gt;()[]{}&lt;/code&gt; in the input of your program 2.&lt;/li&gt;&#xA;&lt;li&gt;There are only the characters &lt;code&gt;()[]{}&amp;lt;&amp;gt;&lt;/code&gt; in the input of your program 3.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Your score is the product of (the length of each program + 1). Lowest score wins.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;(To do.)&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-21T07:23:47.470" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10341" PostTypeId="2" ParentId="10328" CreationDate="2016-10-19T14:07:49.497" Score="13" Body="&lt;h1&gt;Vote.&lt;/h1&gt;&#xA;&lt;p&gt;The main mechanism of stackexchange is voting.  As @LuisMendo said, if you attract more users in general, you will gradually bring in those more experienced golfers.&lt;/p&gt;&#xA;&lt;p&gt;When you see a good answer &lt;strong&gt;or&lt;/strong&gt; question, vote it up.  It attracts new users when they see there reputation going up because of a good post.  As they get used to the system, they will learn to love it and improve their post quality.  &lt;strong&gt;You have the power to vote.  Do it.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="59866" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-19T14:07:49.497" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10342" PostTypeId="2" ParentId="9463" CreationDate="2016-10-19T14:41:47.217" Score="11" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/tagged/faq?sort=votes&amp;amp;pageSize=15&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/diIXP.png&quot; alt=&quot;Read Frequently Asked Questions. Get answers!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-10-21T14:09:22.720" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10343" PostTypeId="2" ParentId="2140" CreationDate="2016-10-19T14:54:03.973" Score="2" Body="&lt;h1&gt;Monopoly Continued&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;So &lt;a href=&quot;https://codegolf.stackexchange.com/q/102423/15394&quot;&gt;you've got your Monopoly board&lt;/a&gt;, shall we start a game?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To start with, we'll need some dice and to know where we land!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program that outputs the rolls and resting places of a given number players for a given number turns.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;In any suitable format for your language&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The number of players up to a maximum of 6&lt;/li&gt;&#xA;&lt;li&gt;The number of turns to output up to a maximum of 250&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;In any meaningful option for your chosen language&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The output should be in the format: &lt;code&gt;PlayerNumber, Die1, Die2, InitialOfRestingPlace&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Each roll should be separated by a new line.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;General&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use the US Board for the names of squares&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;pre&gt;&#xA;    F K C I I B A V W M G &#xA;    N                   P&#xA;    T                   N&#xA;    C                   C&#xA;    S                   P&#xA;    P                   S&#xA;    V                   C&#xA;    S                   P&#xA;    E                   L&#xA;    S                   B&#xA;    J C V C O R I B C M G &#xA;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All players start on Go (bottom right)&lt;/li&gt;&#xA;&lt;li&gt;A player rolls (pseudo randomly generated) two six-sided dice, once per turn, unless they roll doubles (described below), and moves that many spaces clockwise.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt; Doubles&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Rolling doubles means the player can roll again&lt;/li&gt;&#xA;&lt;li&gt;Rolling three doubles in a row lands the player in jail and the players turn ends&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Jail&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Landing on the &quot;Go To Jail&quot; square sends the player to jail&lt;/li&gt;&#xA;&lt;li&gt;While in jail, the player may not move unless they roll a double&lt;/li&gt;&#xA;&lt;li&gt;Rolling a double to get out of jail ends the player's turn&lt;/li&gt;&#xA;&lt;li&gt;Landing &lt;strong&gt;on&lt;/strong&gt; the jail square does not mean a player is &lt;strong&gt;in&lt;/strong&gt; jail&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Chance/Community Chest&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;These squares currently have no effect.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Example output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Excluding comments&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For input 2,3&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;//Turn 1&#xA;1,2,2,I   //Player lands on Income Tax, Player rolled doubles, roll again&#xA;1,2,4,J   //Player lands on Jail and turn ends&#xA;2,5,3,V   //Player lands on Vermont Avenue and turn ends&#xA;&#xA;//Turn 2&#xA;1,5,5,F   //Player lands on Free Parking, doubles, roll again.&#xA;1,5,5,G   //Player lands on Go To Jail, goes to Jail, turn ends&#xA;2,3,4,P   //Player lands on Pennsylvania Railroad, and the turn ends.&#xA;&#xA;//Turn 3&#xA;1,5,2,J   //No double, player remains in Jail&#xA;2,6,3,I   //Player lands on Illinois Avenue and turn ends.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strike&gt;This didn't start as a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, but in coming up with scoring, a lot of the elements I thought of for scoring were very &quot;golf-y&quot; by nature, so I've changed my mind (before any answers are posted). See the edit history if the previous scoring intrigues you.&#xA;&lt;/strike&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Despite first posting this on the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10343/15394&quot;&gt;sandbox&lt;/a&gt;, I'm bound to have missed something! Please feel free to point out mistakes or problems.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Concerns&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strike&gt;Too complex&lt;/strike&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;How to score?&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strike&gt;Doesn't include Chance or Community Chest cards&lt;/strike&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="15394" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.947" LastActivityDate="2016-12-07T13:37:43.067" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="10344" PostTypeId="1" CreationDate="2016-10-19T16:55:11.513" Score="1" ViewCount="53" Body="&lt;p&gt;An extension of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7515/when-do-i-have-to-include-things-like-javas-public-static-void-main&quot;&gt;When do I have to include things like Java&amp;#39;s public static void main&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unless you've (probably) been living under a rock, you (probably) know that Java 9 is (probably) going to have a &lt;a href=&quot;http://openjdk.java.net/jeps/222&quot; rel=&quot;nofollow noreferrer&quot;&gt;REPL interpreter&lt;/a&gt; ready for use now. This means that all the boilerplate code is no longer necessary, as we no longer need to define that if we're just doing evals in the console.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, things like this (73 bytes):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;class M{public static void main(String[] args){System.out.println(4+3);}}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;can now be reduced to just 23 bytes:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;System.out.println(4+3)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or, if weirdly-formatted results are acceptable (3 bytes):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4+3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In fact, you can &lt;a href=&quot;http://www.javarepl.com/console.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;try this here for yourself&lt;/a&gt;, and it actually works!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, with this in mind, this is probably going to change how Java questions are scored. Therefore, we have the issue of whether the site will consider this to be actual Java (maybe these will be filed under Java REPL?), and whether this is an &quot;accepted&quot; shortcut.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So... What will the future of Java mean for PPCG and the scoring of Java posts?&lt;/p&gt;&#xA;" OwnerUserId="15422" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2016-10-19T16:57:14.860" Title="What's the Java policy with REPL existing?" Tags="|discussion|policy|java|" AnswerCount="0" CommentCount="2" ClosedDate="2016-10-19T17:27:24.333" ContentLicense="CC BY-SA 3.0" />
  <row Id="10346" PostTypeId="2" ParentId="2140" CreationDate="2016-10-19T17:49:37.347" Score="2" Body="&lt;h1&gt;Classify Alternating Permutations&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;An alternating permutation of &lt;code&gt;[1, 2, 3, ..., n]&lt;/code&gt; is an arrangement such that each element is either greater than its previous and greater than the next, meaning &lt;code&gt;p[i-1] &amp;lt; p[i] &amp;gt; p[i+1]&lt;/code&gt; or lesser than the previous and lesser than the next, meaning &lt;code&gt;p[i-1] &amp;gt; p[i] &amp;lt; p[i+1]&lt;/code&gt;. In other words, this means that each run of three consecutive elements should never be strictly increasing or decreasing. There is a further distinction that an alternating permutation can be either &lt;em&gt;UP&lt;/em&gt; or &lt;em&gt;DOWN&lt;/em&gt;. For &lt;em&gt;UP&lt;/em&gt;, this means that the alternating permutation begins with the first element being less than the second, and the opposite is true for &lt;em&gt;DOWN&lt;/em&gt;. For example, there are 4! = 24 permutations of &lt;code&gt;[1, 2, 3, 4]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3 4&#xA;1 2 4 3&#xA;1 3 2 4  Alternating UP since 1 &amp;lt; 3 &amp;gt; 2 &amp;lt; 4&#xA;1 3 4 2&#xA;1 4 2 3  Alternating UP since 1 &amp;lt; 4 &amp;gt; 2 &amp;lt; 3&#xA;1 4 3 2&#xA;2 1 3 4&#xA;2 1 4 3  Alternating DOWN since 2 &amp;gt; 1 &amp;lt; 4 &amp;gt; 3&#xA;2 3 1 4  Alternating UP since 2 &amp;lt; 3 &amp;gt; 1 &amp;lt; 4&#xA;2 3 4 1&#xA;2 4 1 3  Alternating UP since 2 &amp;lt; 4 &amp;gt; 1 &amp;lt; 3&#xA;2 4 3 1&#xA;3 1 2 4&#xA;3 1 4 2  Alternating DOWN since 3 &amp;gt; 1 &amp;lt; 4 &amp;gt; 2&#xA;3 2 1 4&#xA;3 2 4 1  Alternating DOWN since 3 &amp;gt; 2 &amp;lt; 4 &amp;gt; 1&#xA;3 4 1 2  Alternating UP since 3 &amp;lt; 4 &amp;gt; 1 &amp;lt; 3&#xA;3 4 2 1&#xA;4 1 2 3&#xA;4 1 3 2  Alternating DOWN since 4 &amp;gt; 1 &amp;lt; 3 &amp;gt; 2&#xA;4 2 1 3&#xA;4 2 3 1  Alternating DOWN since 4 &amp;gt; 2 &amp;lt; 3 &amp;gt; 1&#xA;4 3 1 2&#xA;4 3 2 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The permutations left unmarked are &lt;em&gt;NOT&lt;/em&gt; alternating.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your goal is take a permutation and output whether it is&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;alternating &lt;em&gt;UP&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;NOT&lt;/em&gt; alternating&lt;/li&gt;&#xA;&lt;li&gt;alternating &lt;em&gt;DOWN&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest code wins.&lt;/li&gt;&#xA;&lt;li&gt;You are allowed to modify the input be 0-indexed, 1-indexed, or a permutation of the English alphabet &lt;code&gt;abcdefghijklmnopqrstuvwxyz&lt;/code&gt; in uppercase or lowercase.&lt;/li&gt;&#xA;&lt;li&gt;The length of the input will be between 2 and 26.&lt;/li&gt;&#xA;&lt;li&gt;You are allowed to choose your own output to represent the three classes but you must state what they are in your submission.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 2  UP&#xA;2 1  DOWN&#xA;1 2 3  NOT&#xA;1 3 2  UP&#xA;2 1 3  DOWN&#xA;2 3 1  UP&#xA;3 1 2  DOWN&#xA;3 2 1  NOT&#xA;&amp;lt;more to be added...&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="6710" LastEditorUserId="6710" LastEditDate="2016-10-20T19:47:49.380" LastActivityDate="2016-10-20T19:47:49.380" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10347" PostTypeId="2" ParentId="2140" CreationDate="2016-10-19T22:03:08.020" Score="0" Body="&lt;h1&gt;It's time to parse (everything)!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The real world is hard. Internet standards suck. However they're used everywhere anyways. One standard in particular has been the source of a lot of trouble and frustration.&lt;br&gt;&#xA;&lt;strong&gt;ASN.1&lt;/strong&gt;&lt;br&gt;&#xA;&lt;em&gt;Abstract Syntax Notation 1&lt;/em&gt;&lt;br&gt;&#xA;is used in many many places (including when parsing website certificates) and now it's up to you to implement a simple ASN.1 parser in your favourite programming language!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your input will be an ASN.1 encoded object. The encoding that is used will be PEM (thus it's all ASCII). You may take this input as a file, as STDIN, as a function argument as a string, as a byte sequence, whatever you like. The way your program takes the input should be documented however.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you take file input, you may have the file name as an additional argument.&lt;br&gt;&#xA;If you produce file output, you may have the file name as an additional argument.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The output will be formatted ASCII text, this may be STDOUT, a returned string, a file, whatever, but document it.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;What to do&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You need to parse an ASN.1 object and return a nice textual representation of the content structure.&lt;br&gt;&#xA;This means that there should be some sort of intendention whenever a nested structure is opened (by putting spaces or other signs in front of the identifier).&lt;br&gt;&#xA;It also means that you should print the keyword whenever one is hit (also see the example).&lt;br&gt;&#xA;You &lt;em&gt;may&lt;/em&gt; but do not have to also output actual (decoded) contents or looked-up identifiers.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Warning&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;While I've always talked about an ASN.1 object, I actually had X.509 certificates in mind. So the parser should understand everything that occurs inside an &lt;/p&gt;&#xA;&#xA;&lt;p&gt;List of mandatory keywords:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;SEQUENCE&#xA;OBJECT&#xA;UTCTIME&#xA;PRINTABLESTRING&#xA;SET&#xA;UTCTIME&#xA;NULL&#xA;OCTET STRING&#xA;BOOLEAN&#xA;UTF8STRING&#xA;BIT STRING&#xA;OBJECT IDENTIFIER&#xA;IA5STRING&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Who wins?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins!&lt;br&gt;&#xA;Standard rules apply of course, built-ins are allowed.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example Input and Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input: The Amazon.com X.509 certificate:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-----BEGIN CERTIFICATE-----&#xA;MIIFejCCBGKgAwIBAgIQfkmWRZCbTGK0b6jFJo0YnjANBgkqhkiG9w0BAQsFADB+&#xA;MQswCQYDVQQGEwJVUzEdMBsGA1UEChMUU3ltYW50ZWMgQ29ycG9yYXRpb24xHzAd&#xA;BgNVBAsTFlN5bWFudGVjIFRydXN0IE5ldHdvcmsxLzAtBgNVBAMTJlN5bWFudGVj&#xA;IENsYXNzIDMgU2VjdXJlIFNlcnZlciBDQSAtIEc0MB4XDTE2MDUxODAwMDAwMFoX&#xA;DTE2MTIzMDIzNTk1OVowaDELMAkGA1UEBhMCVVMxEzARBgNVBAgMCldhc2hpbmd0&#xA;b24xEDAOBgNVBAcMB1NlYXR0bGUxGTAXBgNVBAoMEEFtYXpvbi5jb20sIEluYy4x&#xA;FzAVBgNVBAMMDnd3dy5hbWF6b24uY29tMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8A&#xA;MIIBCgKCAQEAuwQMfKRRZpql3WBS0uo4DfMrrkAEX9+6UD2fVSmV21i9iqCecmHa&#xA;4z9LNzeKqpGNkpTbXMaJfLxy0ehoQp7vyVIit6l+VZ9L+VTiL0+v8MjG+Kl6Sg4J&#xA;6ozV+EHck91Id8zCUyLHLcmJ5f60kazJJC1zGKlTkZR6Of0SzcLrje0T3Pqmdybj&#xA;AjFoBMdk0G1rKctxds1UnywI4pIONzsmozzPjk8Up5NA1s3bo9ubCQUcPSEm1TDJ&#xA;4TDdQVL8WsDNjY0SwTiVmJ+vo4TVIhRlfGv+xzHe8JXFYxsVJZ/FP70uFRH5+Uku&#xA;4yaGYFZYt71V3kOTzM3FvRlHb93jANoAHwIDAQABo4ICCDCCAgQwgb0GA1UdEQSB&#xA;tTCBsoIKYW1hem9uLmNvbYIIYW16bi5jb22CEXVlZGF0YS5hbWF6b24uY29tgg11&#xA;cy5hbWF6b24uY29tgg53d3cuYW1hem9uLmNvbYIMd3d3LmFtem4uY29tghRjb3Jw&#xA;b3JhdGUuYW1hem9uLmNvbYIRYnV5Ym94LmFtYXpvbi5jb22CEWlwaG9uZS5hbWF6&#xA;b24uY29tgg15cC5hbWF6b24uY29tgg9ob21lLmFtYXpvbi5jb20wCQYDVR0TBAIw&#xA;ADAOBgNVHQ8BAf8EBAMCBaAwHQYDVR0lBBYwFAYIKwYBBQUHAwEGCCsGAQUFBwMC&#xA;MGEGA1UdIARaMFgwVgYGZ4EMAQICMEwwIwYIKwYBBQUHAgEWF2h0dHBzOi8vZC5z&#xA;eW1jYi5jb20vY3BzMCUGCCsGAQUFBwICMBkMF2h0dHBzOi8vZC5zeW1jYi5jb20v&#xA;cnBhMB8GA1UdIwQYMBaAFF9gz2GQVd+EQxSKYCqy9Xr0QxjvMCsGA1UdHwQkMCIw&#xA;IKAeoByGGmh0dHA6Ly9zcy5zeW1jYi5jb20vc3MuY3JsMFcGCCsGAQUFBwEBBEsw&#xA;STAfBggrBgEFBQcwAYYTaHR0cDovL3NzLnN5bWNkLmNvbTAmBggrBgEFBQcwAoYa&#xA;aHR0cDovL3NzLnN5bWNiLmNvbS9zcy5jcnQwDQYJKoZIhvcNAQELBQADggEBAKeH&#xA;/SiREeFlL0ce/UDYoPDU/91x8XsbJuLRqxm1zEBzq/07/Fnd4nL/rayEEFIEubRS&#xA;IL9Ewi+htMz2nLrR0BMu3ilqWGhpOEvkcgT9uh/CjhPhVMse0lpHYSn62ZvUWTwn&#xA;vG0ardOd5MuE2NiveZxl3/o2cLcyiySxtX7N3yADchGP27iOkjXocdpZwtjIa7EB&#xA;pp3GojEbWRbGxtLC7SO3vY4a0N2bb5b9J7y5OtSKjInRJaMs19pFwlHMOMZR0y70&#xA;rHaz9eRB++LuEI2B90Mqr33NMysb1enMo61Dt16Ki3yT1zVBHp1vbqM6gX2UeEMA&#xA;A+HEDpMefyQVspV7twA=&#xA;-----END CERTIFICATE-----&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://lapo.it/asn1js/#3082057A30820462A00302010202107E499645909B4C62B46FA8C5268D189E300D06092A864886F70D01010B0500307E310B3009060355040613025553311D301B060355040A131453796D616E74656320436F72706F726174696F6E311F301D060355040B131653796D616E746563205472757374204E6574776F726B312F302D0603550403132653796D616E74656320436C61737320332053656375726520536572766572204341202D204734301E170D3136303531383030303030305A170D3136313233303233353935395A3068310B30090603550406130255533113301106035504080C0A57617368696E67746F6E3110300E06035504070C0753656174746C6531193017060355040A0C10416D617A6F6E2E636F6D2C20496E632E3117301506035504030C0E7777772E616D617A6F6E2E636F6D30820122300D06092A864886F70D01010105000382010F003082010A0282010100BB040C7CA451669AA5DD6052D2EA380DF32BAE40045FDFBA503D9F552995DB58BD8AA09E7261DAE33F4B37378AAA918D9294DB5CC6897CBC72D1E868429EEFC95222B7A97E559F4BF954E22F4FAFF0C8C6F8A97A4A0E09EA8CD5F841DC93DD4877CCC25322C72DC989E5FEB491ACC9242D7318A95391947A39FD12CDC2EB8DED13DCFAA67726E302316804C764D06D6B29CB7176CD549F2C08E2920E373B26A33CCF8E4F14A79340D6CDDBA3DB9B09051C3D2126D530C9E130DD4152FC5AC0CD8D8D12C13895989FAFA384D52214657C6BFEC731DEF095C5631B15259FC53FBD2E1511F9F9492EE32686605658B7BD55DE4393CCCDC5BD19476FDDE300DA001F0203010001A3820208308202043081BD0603551D110481B53081B2820A616D617A6F6E2E636F6D8208616D7A6E2E636F6D82117565646174612E616D617A6F6E2E636F6D820D75732E616D617A6F6E2E636F6D820E7777772E616D617A6F6E2E636F6D820C7777772E616D7A6E2E636F6D8214636F72706F726174652E616D617A6F6E2E636F6D8211627579626F782E616D617A6F6E2E636F6D82116970686F6E652E616D617A6F6E2E636F6D820D79702E616D617A6F6E2E636F6D820F686F6D652E616D617A6F6E2E636F6D30090603551D1304023000300E0603551D0F0101FF0404030205A0301D0603551D250416301406082B0601050507030106082B0601050507030230610603551D20045A30583056060667810C010202304C302306082B06010505070201161768747470733A2F2F642E73796D63622E636F6D2F637073302506082B0601050507020230190C1768747470733A2F2F642E73796D63622E636F6D2F727061301F0603551D230418301680145F60CF619055DF8443148A602AB2F57AF44318EF302B0603551D1F042430223020A01EA01C861A687474703A2F2F73732E73796D63622E636F6D2F73732E63726C305706082B06010505070101044B3049301F06082B060105050730018613687474703A2F2F73732E73796D63642E636F6D302606082B06010505073002861A687474703A2F2F73732E73796D63622E636F6D2F73732E637274300D06092A864886F70D01010B05000382010100A787FD289111E1652F471EFD40D8A0F0D4FFDD71F17B1B26E2D1AB19B5CC4073ABFD3BFC59DDE272FFADAC84105204B9B45220BF44C22FA1B4CCF69CBAD1D0132EDE296A586869384BE47204FDBA1FC28E13E154CB1ED25A476129FAD99BD4593C27BC6D1AADD39DE4CB84D8D8AF799C65DFFA3670B7328B24B1B57ECDDF200372118FDBB88E9235E871DA59C2D8C86BB101A69DC6A2311B5916C6C6D2C2ED23B7BD8E1AD0DD9B6F96FD27BCB93AD48A8C89D125A32CD7DA45C251CC38C651D32EF4AC76B3F5E441FBE2EE108D81F7432AAF7DCD332B1BD5E9CCA3AD43B75E8A8B7C93D735411E9D6F6EA33A817D9478430003E1C40E931E7F2415B2957BB700&quot; rel=&quot;nofollow noreferrer&quot;&gt;Example output:&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;SEQUENCE&#xA;   SEQUENCE&#xA;      [0]&#xA;         INTEGER&#xA;      INTEGER&#xA;      SEQUENCE&#xA;         OBJECT IDENTIFIER&#xA;         NULL&#xA;      SEQUENCE&#xA;         SET&#xA;            SEQUENCE&#xA;               OBJECT IDENTIFIER&#xA;               PRINTABLESTRING&#xA;         SET&#xA;            SEQUENCE&#xA;               OBJECT IDENTIFIER&#xA;               PRINTABLESTRING&#xA;         SET&#xA;            SEQUENCE&#xA;               OBJECT IDENTIFIER&#xA;               PRINTABLESTRING&#xA;         SET&#xA;            SEQUENCE&#xA;               OBJECT IDENTIFIER&#xA;               PRINTABLESTRING&#xA;      SEQUENCE&#xA;         UTCTIME&#xA;         UTCTIME&#xA;      SEQUENCE&#xA;         SET&#xA;            SEQUENCE&#xA;               OBJECT IDENTIFIER&#xA;               PRINTABLESTRING&#xA;         SET&#xA;            SEQUENCE&#xA;               OBJECT IDENTIFIER&#xA;               UTF8STRING&#xA;         SET&#xA;            SEQUENCE&#xA;               OBJECT IDENTIFIER&#xA;               UTF8STRING&#xA;         SET&#xA;            SEQUENCE&#xA;               OBJECT IDENTIFIER&#xA;               UTF8STRING&#xA;         SET&#xA;            SEQUENCE&#xA;               OBJECT IDENTIFIER&#xA;               UTF8STRING&#xA;      SEQUENCE&#xA;         SEQUENCE&#xA;            OBJECT IDENTIFIER&#xA;            NULL&#xA;         BIT STRING&#xA;            SEQUENCE&#xA;               INTEGER&#xA;               INTEGER&#xA;      [3]&#xA;         SEQUENCE&#xA;            SEQUENCE&#xA;               OBJECT IDENTIFIER&#xA;               OCTET STRING&#xA;                  SEQUENCE&#xA;                     [2]&#xA;                     [2]&#xA;                     [2]&#xA;                     [2]&#xA;                     [2]&#xA;                     [2]&#xA;                     [2]&#xA;                     [2]&#xA;                     [2]&#xA;                     [2]&#xA;                     [2]&#xA;            SEQUENCE&#xA;               OBJECT IDENTIFIER&#xA;               OCTET STRING&#xA;                  SEQUENCE&#xA;            SEQUENCE&#xA;               OBJECT IDENTIFIER&#xA;               BOOLEAN&#xA;               OCTET STRING&#xA;                  BIT STRING&#xA;            SEQUENCE&#xA;               OBJECT IDENTIFIER&#xA;               OCTET STRING&#xA;                  SEQUENCE&#xA;                     OBJECT IDENTIFIER&#xA;                     OBJECT IDENTIFIER&#xA;            SEQUENCE&#xA;               OBJECT IDENTIFIER&#xA;               OCTET STRING&#xA;                  SEQUENCE&#xA;                     SEQUENCE&#xA;                        OBJECT IDENTIFIER&#xA;                        SEQUENCE&#xA;                           SEQUENCE&#xA;                              OBJECT IDENTIFIER&#xA;                              IA5String&#xA;                           SEQUENCE&#xA;                              OBJECT IDENTIFIER&#xA;                              SEQUENCE&#xA;                                 UTF8String&#xA;            SEQUENCE&#xA;               OBJECT IDENTIFIER&#xA;               OCTET STRING&#xA;                  SEQUENCE&#xA;                     [0]&#xA;             SEQUENCE&#xA;                OBJECT IDENTIFIER&#xA;                OCTET STRING&#xA;                   SEQUENCE&#xA;                      SEQUENCE&#xA;                         [0]&#xA;                            [0]&#xA;                               [6]&#xA;             SEQUENCE&#xA;                OBJECT IDENTIFIER&#xA;                OCTET STRING&#xA;                   SEQUENCE&#xA;                      SEQUENCE&#xA;                         OBJECT IDENTIFIER&#xA;                         [6]&#xA;                      SEQUENCE&#xA;                         OBJECT IDENTIFIER&#xA;                         [6]&#xA;SEQUENCE&#xA;   OBJECT IDENTIFIER&#xA;   NULL&#xA;BIT STRING&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Helpful ressources&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://lapo.it/asn1js/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Reference parser&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;TODO: Add more useful links and actual ASN.1 parsing description&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="55329" LastEditorUserId="55329" LastEditDate="2016-10-22T21:11:21.960" LastActivityDate="2016-10-22T21:11:21.960" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10348" PostTypeId="2" ParentId="2140" CreationDate="2016-10-20T01:12:00.360" Score="0" Body="&lt;h1&gt;Categorize the asymptotic behavior of a consumer/producer system&lt;/h1&gt;&#xA;&lt;p&gt;Given two functions &lt;code&gt;P(t)&lt;/code&gt; and &lt;code&gt;C(t)&lt;/code&gt;, output the correct category for the behavior of &lt;code&gt;P(t)-C(t)&lt;/code&gt; as &lt;code&gt;t&lt;/code&gt; goes to positive infinity:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;strong&gt;Ideal&lt;/strong&gt;: &lt;code&gt;P(t)-C(t)&lt;/code&gt; goes to 0.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Stable&lt;/strong&gt;: &lt;code&gt;P(t)-C(t)&lt;/code&gt; oscillates, with the time spent as a positive value equal to the time spent as a negative value within a single oscillation period.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Hungry&lt;/strong&gt;: &lt;code&gt;P(t)-C(t)&lt;/code&gt; either converges to a negative value, or oscillates, with more negative values than positive values in one oscillation period.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Starved&lt;/strong&gt;: &lt;code&gt;P(t)-C(t)&lt;/code&gt; diverges, approaching negative infinity.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Saturated&lt;/strong&gt;: &lt;code&gt;P(t)-C(t)&lt;/code&gt; either converges to a positive value, or oscillates, with more positive values than negative values in one oscillation period.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Oversaturated&lt;/strong&gt;: &lt;code&gt;P(t)-C(t)&lt;/code&gt; diverges, approaching positive infinity.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The expected output will always be one of the above cases - you don't have to worry about other cases&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;P(t)&lt;/code&gt; and &lt;code&gt;C(t)&lt;/code&gt; will always be real-valued continuous functions that only consist of the following operations: addition, subtraction, multiplication, division, exponentiation (for constants &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; and parameter &lt;code&gt;t&lt;/code&gt;, &lt;code&gt;a^b&lt;/code&gt;, &lt;code&gt;t^a&lt;/code&gt;, and &lt;code&gt;a^t&lt;/code&gt; are all allowed), principal roots (real roots, only when they exist, and only the positive root when there are 2 real roots), logarithms, and basic trigonometric functions (sine and cosine of arbitrary values, and tangent for values that are not odd multiples of &lt;code&gt;pi/2&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Input may be in any reasonably format (string, function object/pointer, mathematical function object, etc.)&lt;/li&gt;&#xA;&lt;li&gt;You may use any unambiguous set of 6 values for output (like &lt;code&gt;[1, 2, 3, 4, 5, 6]&lt;/code&gt;, &lt;code&gt;[0, 1, 2, 3, 4, 5]&lt;/code&gt;, &lt;code&gt;[Ideal, Stable, Hungry, Starved, Saturated, Oversaturated]&lt;/code&gt;, or &lt;code&gt;[0, ~, -, -∞, +, +∞]&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;p&gt;TBD&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox Notes&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are the definitions and rules clear?&lt;/li&gt;&#xA;&lt;li&gt;Are there any I/O methods that should be explicitly allowed or forbidden that aren't covered by the current rules?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-20T01:12:00.360" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10349" PostTypeId="2" ParentId="10328" CreationDate="2016-10-20T03:57:58.337" Score="25" Body="&lt;h2&gt;Strive to outgolf&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For skilled golfers to take us seriously, they need to see us try for the best golf.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If someone's already submitted in your favorite language, take it as a challenge to do better. Don't just move on because it's &quot;been done&quot;. Write your own golf in that language, or suggest improvements to theirs. We need to get rid of the attitude that the first person to post in a language has claimed it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are many things you can do to encourage this.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Vote for later-posted submissions. Don't just vote for the first thing you see.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Appreciate small improvements. A 53-byte solution versus 56 bytes may be the difference between a fantastic golf and an OK one, even if the code is much the same.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Be a good sport when you're outgolfed. Congratulate the person who beat you.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Don't accuse a similar-looking solution of having copied. It's rude, and they almost surely came up with it on their own.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Don't complain about a submission being longer than an already-posted one. Chances are it's a less experienced golfer who tried hard on their own and deserve to be proud of their efforts.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Don't be shy about posting your own solution. Even if there's already one in that language, you don't have to post your improvements as comments on it. Even if you looked at the solution and improved it significantly, you can post as your own answer and give credit.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2016-10-20T03:57:58.337" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10351" PostTypeId="1" CreationDate="2016-10-20T17:44:58.337" Score="22" ViewCount="629" Body="&lt;p&gt;There are a bunch of external resources that are either used very often by this community or are directly related to it. This post contains the most relevant ones to make them more discoverable for new users. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is how this will work: put each resource in a separate answer, linking to it at the top. You can use the answer body to explain what it is and how it's useful. Also edit a link into the list below for quick access. The idea is that the votes will let the most useful resources bubble up to the top. If an answer gets too many downvotes, it will probably be removed to keep the list useful and the noise low.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please also make sure that the type of resource isn't covered by the related meta posts at the bottom (for example links to online testing environments).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Quick access links&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10352/8478&quot;&gt;The Nineteenth Byte Data Explorer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7955/31716&quot;&gt;Graduation Design Userscript&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10358/8478&quot;&gt;Byte Counter - ETHproductions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;See also&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Some other meta posts that list external resources of more specific purpose:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/202/8478&quot;&gt;Where to find an online testing environment for specific programming languages?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1213/8478&quot;&gt;Installation and testing instructions for specific programming languages&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="68942" LastEditDate="2021-04-04T15:51:23.787" LastActivityDate="2021-04-04T15:51:23.787" Title="Useful External Resources" Tags="|discussion|faq|" AnswerCount="6" CommentCount="0" CommunityOwnedDate="2016-10-20T17:45:05.787" ContentLicense="CC BY-SA 3.0" />
  <row Id="10352" PostTypeId="2" ParentId="10351" CreationDate="2016-10-20T17:47:35.287" Score="13" Body="&lt;h2&gt;&lt;a href=&quot;http://ppcg.starmaninnovations.com/tnbde/&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Nineteenth Byte Data Explorer&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/12914/elendia-starman&quot;&gt;El'endia Starman&lt;/a&gt; was interested in various statistics about the messages that users post daily, so he wrote a data explorer which lets you query the transcript of our main chatroom with SQL. It also doubles as a very handy chat search as it is far more flexible than the built-in search feature.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Demonstration of searching capability:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://ppcg.starmaninnovations.com/tnbde/#hQLCQIdmLQ&quot; rel=&quot;nofollow noreferrer&quot;&gt;Certain words&lt;/a&gt; (&quot;should've&quot;; compare &lt;a href=&quot;http://chat.stackexchange.com/search?q=should%27ve&amp;amp;user=&amp;amp;room=240&quot;&gt;SE's built-in search&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://ppcg.starmaninnovations.com/tnbde/#eNvBSRuyQq&quot; rel=&quot;nofollow noreferrer&quot;&gt;Multiple words&lt;/a&gt; (&quot;hello bye&quot;; compare &lt;a href=&quot;http://chat.stackexchange.com/search?q=hello+bye&amp;amp;user=&amp;amp;room=240&quot;&gt;SE's chat search&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://ppcg.starmaninnovations.com/tnbde/#AuBxcrtxzw&quot; rel=&quot;nofollow noreferrer&quot;&gt;Substrings&lt;/a&gt; (&quot;string&quot;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://ppcg.starmaninnovations.com/tnbde/#VtgIjhblLM&quot; rel=&quot;nofollow noreferrer&quot;&gt;Excluding words&lt;/a&gt; (&quot;night&quot; without &quot;good&quot;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://ppcg.starmaninnovations.com/tnbde/#bIllslpWkH&quot; rel=&quot;nofollow noreferrer&quot;&gt;Punctuation&lt;/a&gt; (&quot;???&quot;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://ppcg.starmaninnovations.com/tnbde/#VzvkSFPCEd&quot; rel=&quot;nofollow noreferrer&quot;&gt;Code snippets&lt;/a&gt; (&quot;%10&quot;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://ppcg.starmaninnovations.com/tnbde/#blrvpDvXFO&quot; rel=&quot;nofollow noreferrer&quot;&gt;Regex&lt;/a&gt; (messages with Try It Online links)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;These kinds of queries use &lt;a href=&quot;https://www.postgresql.org/docs/9.3/static/functions-matching.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;PostgreSQL's pattern matching features&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are also &lt;a href=&quot;http://ppcg.starmaninnovations.com/usefulqueries&quot; rel=&quot;nofollow noreferrer&quot;&gt;additional useful queries&lt;/a&gt; that you can peruse if you want to see what queries have already been written or if you want to write one, so you can build off of what has already been written.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-10-20T19:42:58.230" CommentCount="0" CommunityOwnedDate="2016-10-20T17:47:35.287" ContentLicense="CC BY-SA 3.0" />
  <row Id="10353" PostTypeId="2" ParentId="10351" CreationDate="2016-10-20T17:53:46.597" Score="7" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7955/31716&quot;&gt;Graduation Design Userscript&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;A little while ago, some users started talking about what we would like to see in the design of our site once it gets a custom design. User &lt;a href=&quot;https://codegolf.stackexchange.com/users/40695/downgoat&quot;&gt;Downgoat&lt;/a&gt;, along with the help of some others put all of these idea together into a single script that customizes the appearance of the site, both on main and meta.&lt;/p&gt;&#xA;&lt;h2&gt;Pictures:&lt;/h2&gt;&#xA;&lt;h3&gt;Main&lt;/h3&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/kbiG2.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/kbiG2.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Installation&lt;/h2&gt;&#xA;&lt;p&gt;You can install &lt;a href=&quot;//tampermonkey.net&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tampermonkey&lt;/a&gt; which supports a &lt;em&gt;ton&lt;/em&gt; of browsers (probably will include yours). You can then just use &lt;a href=&quot;//rawgit.com/vihanb/PPCG-Design/master/ppcg.user.js&quot; rel=&quot;nofollow noreferrer&quot;&gt;this link&lt;/a&gt; to install the script (or copy-paste the code into a new script).&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-20T17:53:46.597" CommentCount="0" CommunityOwnedDate="2016-10-20T17:53:46.597" ContentLicense="CC BY-SA 3.0" />
  <row Id="10354" PostTypeId="2" ParentId="10351" CreationDate="2016-10-20T19:08:31.060" Score="2" Body="&lt;h2&gt;&lt;a href=&quot;https://mothereff.in/byte-counter&quot; rel=&quot;nofollow&quot;&gt;Byte counter&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A minimalist online byte counter which gives you both the character count and the UTF-8 byte count of its input. Note that not all answers will use UTF-8 encoding, but it's very handy for those that do.&lt;/p&gt;&#xA;" OwnerUserId="53745" LastEditorUserId="8478" LastEditDate="2016-10-20T19:48:17.523" LastActivityDate="2016-10-20T19:48:17.523" CommentCount="1" CommunityOwnedDate="2016-10-20T19:08:31.060" ContentLicense="CC BY-SA 3.0" />
  <row Id="10355" PostTypeId="2" ParentId="2140" CreationDate="2016-10-20T19:13:24.167" Score="3" Body="&lt;p&gt;The challenge is to write the fastest code possible for computing the &lt;a href=&quot;https://en.wikipedia.org/wiki/Permanent&quot; rel=&quot;nofollow noreferrer&quot;&gt;permanent of a matrix&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The permanent of an &lt;code&gt;n&lt;/code&gt;-by-&lt;code&gt;n&lt;/code&gt; matrix &lt;code&gt;A&lt;/code&gt; = (&lt;code&gt;a&lt;/code&gt;&lt;sub&gt;&lt;code&gt;i,j&lt;/code&gt;&lt;/sub&gt;) is defined as&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/GOz7G.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/GOz7G.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here &lt;code&gt;S_n&lt;/code&gt; represents the set of all permutations of &lt;code&gt;[1, n]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an example (from the wiki):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Qr1OJ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Qr1OJ.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this question matrices are all square and will only have the values &lt;code&gt;-1&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt; in them.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[ 1 -1 -1  1]&#xA; [-1 -1 -1  1]&#xA; [-1  1 -1  1]&#xA; [ 1 -1 -1  1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Permanent:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[-1 -1 -1 -1]&#xA; [-1  1 -1 -1]&#xA; [ 1 -1 -1 -1]&#xA; [ 1 -1  1 -1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Permanent:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[ 1 -1  1 -1 -1 -1 -1 -1]&#xA; [-1 -1  1  1 -1  1  1 -1]&#xA; [ 1 -1 -1 -1 -1  1  1  1]&#xA; [-1 -1 -1  1 -1  1  1  1]&#xA; [ 1 -1 -1  1  1  1  1 -1]&#xA; [-1  1 -1  1 -1  1  1 -1]&#xA; [ 1 -1  1 -1  1 -1  1 -1]&#xA; [-1 -1  1 -1  1  1  1  1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Permanent:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;192&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The task&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should write code that, given an &lt;code&gt;n&lt;/code&gt; by &lt;code&gt;n&lt;/code&gt; matrix, outputs its permanent.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As I will need to test your code it would be helpful if you could give a simple way for me to give matrix as input to your code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Be warned that the permanent can be large (the all 1s matrix is the extreme case).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scores and ties&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I will test your code on random +-1 matrices of increasing size and stop the first time your code takes more than 1 minute on my computer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If two people get the same score then the winner is the one which is fastest for that value of &lt;code&gt;n&lt;/code&gt;. If those are within 1 second of each other then it is the one posted first.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Languages and libraries&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can use any available language and libraries you like but no pre-existing function to compute the permanent. Where feasible, it would be good to be able to run your code so please include a full explanation for how to run/compile your code in Linux if at all possible.`&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Reference implementations&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is already a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/96825/codegolf-the-permanent&quot;&gt;codegolf question&lt;/a&gt; question with lots of code in different languages for computing the permanent. &lt;a href=&quot;https://reference.wolfram.com/language/ref/Permanent.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Mathematica&lt;/a&gt; and &lt;a href=&quot;https://www.maplesoft.com/support/help/Maple/view.aspx?path=LinearAlgebra%2FPermanent&quot; rel=&quot;nofollow noreferrer&quot;&gt;Maple&lt;/a&gt; also both have permanent implementations if you can access those. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;My Machine&lt;/strong&gt; The timings will be run on my 64-bit machine. This is a standard ubuntu install with 8GB RAM, AMD FX-8350 Eight-Core Processor and Radeon HD 4250.  This also means I need to be able to run your code.&lt;/p&gt;&#xA;" OwnerDisplayName="user9206" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:27.967" LastActivityDate="2016-10-22T08:28:30.173" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10356" PostTypeId="1" AcceptedAnswerId="10357" CreationDate="2016-10-20T19:14:56.087" Score="1" ViewCount="90" Body="&lt;p&gt;In some languages such as PHP you need to add these &lt;code&gt;&amp;lt;?php ?&amp;gt;&lt;/code&gt; before you can start to program in PHP. And in C++ too. &lt;code&gt;int main(){}&lt;/code&gt;. When answering a question, must I add the tags/function?&lt;/p&gt;&#xA;" OwnerUserId="60954" LastEditorUserId="31716" LastEditDate="2016-10-20T19:34:00.730" LastActivityDate="2016-10-20T19:34:00.730" Title="How to answer a Code Golf Puzzle" Tags="|discussion|code-golf|scoring|" AnswerCount="1" CommentCount="0" ClosedDate="2016-10-21T15:06:19.277" ContentLicense="CC BY-SA 3.0" />
  <row Id="10357" PostTypeId="2" ParentId="10356" CreationDate="2016-10-20T19:26:15.097" Score="2" Body="&lt;p&gt;For PHP, no. With the &lt;code&gt;-r&lt;/code&gt; flag, you can run the code without surrounding tags. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2428/12012&quot;&gt;The &lt;code&gt;-r&lt;/code&gt; switch doesn't contribute to the byte count&lt;/a&gt; in this case.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For C, you have two options:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Submit a full program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This requires a &lt;em&gt;main&lt;/em&gt; function.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Submit a function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By default, all submissions may be full programs or functions. For compiled languages, a function is &lt;em&gt;usually&lt;/em&gt; shorter, especially if you stick to C89 and use a permissive compiler such as gcc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, to add two numbers, the function&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f(a,b){return a+b;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is considered a valid submission.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;If you enjoy golfing in C, &lt;a href=&quot;https://codegolf.stackexchange.com/q/2203/12012&quot;&gt;Tips for golfing in C&lt;/a&gt; is a good read.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-10-20T19:26:15.097" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10358" PostTypeId="2" ParentId="10351" CreationDate="2016-10-20T20:02:27.660" Score="14" Body="&lt;h1&gt;&lt;a href=&quot;https://ethproductions.github.io/bytes/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Byte Counter&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A byte counter made by &lt;a href=&quot;https://codegolf.stackexchange.com/users/42545/ethproductions&quot;&gt;ETHproductions&lt;/a&gt; that currently supports 20 different encodings (UTF-8, UTF-16, ISO-8859-1, CP437, ASCII and many more!), has &lt;a href=&quot;https://ethproductions.github.io/bytes/?e=utf-8&amp;amp;t=permalink%20test&quot; rel=&quot;nofollow noreferrer&quot;&gt;permalinks&lt;/a&gt; and a bookmarklet to count chars and UTF-8 bytes on the fly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you have any feature suggestions or encoding requests, leave a comment below.&lt;/p&gt;&#xA;" OwnerUserId="56258" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-10-21T01:27:41.637" CommentCount="6" CommunityOwnedDate="2016-10-20T20:02:27.660" ContentLicense="CC BY-SA 3.0" />
  <row Id="10360" PostTypeId="1" AcceptedAnswerId="10361" CreationDate="2016-10-20T20:56:30.173" Score="2" ViewCount="325" Body="&lt;p&gt;In a lot of situations we allow for C# answers to simply be an anonymous lambda with the assumption that to run it it needs to be stored in a variable. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So given that, is it acceptable to also assume that the variable have a specific name so that it can call itself?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An example using Fibonacci:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;//Boilerplate&#xA;Func&amp;lt;int,int&amp;gt; f = ()=&amp;gt; {};&#xA;f=&#xA;//golfed function&#xA;    n=&amp;gt;n&amp;lt;2?1:f(n-1)+f(n-2); &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerDisplayName="user19547" LastEditorUserId="56258" LastEditDate="2016-10-20T21:07:51.233" LastActivityDate="2018-09-11T06:39:10.253" Title="How should I submit an anonymous lambda that has a self reference?" Tags="|discussion|code-golf|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10361" PostTypeId="2" ParentId="10360" CreationDate="2016-10-20T21:06:15.223" Score="9" Body="&lt;p&gt;If the lambda needs a specific name to work (because you're calling it recursively), then you'll have to count the declaration and definition of that name, I'm afraid. So it'll have to be something like &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Func&amp;lt;int,int&amp;gt;f=n=&amp;gt;n&amp;lt;2?1:f(n-1)+f(n-2); &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Not entirely sure if that requires some additional space somewhere. I'm also not sure whether the compiler would accept &lt;code&gt;var&lt;/code&gt; there as the type, but in any case, you'll have to count all the code that's required to make the answer work and declare the necessary names.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that not &lt;em&gt;all&lt;/em&gt; languages require named functions for recursion. For example, in Mathematica, you can refer to the nearest surrounding unnamed function with &lt;code&gt;#0&lt;/code&gt;, which means that &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;If[#&amp;lt;2,1,#0[#-1]+#0[#-2]]&amp;amp;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;would be a valid submission, because here a name is not required to make the function work. (That said, I think a named function would actually be shorter, but that's beside the point.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-10-20T21:06:15.223" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10362" PostTypeId="2" ParentId="2140" CreationDate="2016-10-20T22:40:32.450" Score="0" Body="&lt;h1&gt;Quine tree&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/95367/hyper-about-quines&quot;&gt;Inspired by that really weird quine challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For this challenge, you must construct a quine &lt;a href=&quot;https://en.wikipedia.org/wiki/Tree_%28data_structure%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;tree&lt;/a&gt;, which is a thing I made up, specifically an infinite binary tree.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How a quine tree works:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A quine tree has infinite nodes. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Each node is associated with a program&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Let X, Y, Z, be the programming languages. This program is a polyglot in X and Y. In all but the root node, it is also a polyglot in Z. Note the&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;see below for more details&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each node has exactly two children&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Every node but the root has a parent. Their parent has the node as a child (obviously).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Programs:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When a node's program is run in X, it produces the program of the first child of that node.&lt;/li&gt;&#xA;&lt;li&gt;When run in Y, it produces the program of the second child of that node.&lt;/li&gt;&#xA;&lt;li&gt;The programs produced must be different (node foo's program, cannot have the same output in X and Y. This output must also be different than the nodes program).&lt;/li&gt;&#xA;&lt;li&gt;If not the root node, when run in Z, it produces the parent of the node.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Imagine that we have the (fake) programming languages Hello, World, and Foobaz.&#xA;Say the root node is &lt;code&gt;$QQ$QQ$;&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;when run in Hello, perhaps it produces &lt;code&gt;$QQ$QQ$;;&lt;/code&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When this is run with Hello again, perhaps produces &lt;code&gt;$QQ$QQ$;;;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;When this is run with World, perhaps produces &lt;code&gt;$QQ$QQ$;;Q&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Both these programs must produce, run in Foobaz, &lt;code&gt;$QQ$QQ$;;&lt;/code&gt; (Output of root node run in Hello)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;when run in World, perhaps it produces &lt;code&gt;$QQ$QQ$;Q&lt;/code&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When this is run with Hello, perhaps produces &lt;code&gt;$QQ$QQ$;Q;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;When this is run with World again, perhaps produces &lt;code&gt;$QQ$QQ$;QQ&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Both these programs must produce, run in Foobaz, &lt;code&gt;$QQ$QQ$;Q&lt;/code&gt; (Output of root node run in World)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Both these programs, run in Foobaz, must produce &lt;code&gt;$QQ$QQ$;&lt;/code&gt; (root program).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="55896" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:27.967" LastActivityDate="2016-10-21T08:16:10.220" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10366" PostTypeId="2" ParentId="2140" CreationDate="2016-10-21T07:43:51.407" Score="2" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Note&lt;/strong&gt;: this is an attempt to fix up a &lt;a href=&quot;https://codegolf.stackexchange.com/q/96810/194&quot;&gt;currently closed question&lt;/a&gt; by someone else so that they can rescue it, not an attempt to steal their question.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;When implementing an algorithm for correcting &lt;a href=&quot;https://en.wikipedia.org/wiki/Aliasing&quot; rel=&quot;nofollow noreferrer&quot;&gt;aliased&lt;/a&gt; measurement data, I hit the need to implement following function. The function takes input bitstring on the left, and should produce the integer and list on the right:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;               1 =&amp;gt;   1, [0]&#xA;              10 =&amp;gt;   1, [0]&#xA;             100 =&amp;gt;   1, [0]&#xA;             101 =&amp;gt;   2, [0, 1]&#xA;            1000 =&amp;gt;   1, [0]&#xA;            1011 =&amp;gt;   3, [0, 2, 1]&#xA;     ... more test cases at end of post ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that it is guaranteed that the input bitstring is aperiodic.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Physical background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Consider a digital system that changes its output every &lt;code&gt;N&lt;/code&gt; clock cycles. A measurement system doesn't know &lt;code&gt;N&lt;/code&gt;, so it reads the output every &lt;code&gt;M&lt;/code&gt; cycles, where &lt;code&gt;M &amp;lt;= N&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now some of the measurement samples will be identical to the previous ones, which is represented as &lt;code&gt;0&lt;/code&gt; in the bitstring and the sample is discarded. When the value changes, &lt;code&gt;1&lt;/code&gt; is added to the bitstring and the sample is stored. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, the timestamp of the sample will be too late. The numbers in the output array represent a correction that must be applied. The output format expresses this correction as a fraction of the sample interval, where the standalone integer is the denominator and the array contains the numerators.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an example with &lt;code&gt;N = 4&lt;/code&gt; and &lt;code&gt;M = 3&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Clock cycle     0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9&#xA;Output          A A A A B B B B C C C C D D D D E E E E&#xA;Measurement     A     A     B     C     D     D     E&#xA;Bitstring       1     0     1     1     1     0     1&#xA;                |---------------------| This is the period of the aliasing&#xA;&#xA;Timestamp       |       |---|   |-|     |       |---|&#xA;  correction    0          2/3   1/3    0          2/3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;With this example the input would be &lt;code&gt;1011&lt;/code&gt; and the output would be &lt;code&gt;3, [0, 2, 1]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Here are a few observations to get you started:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input sequence always begins with &lt;code&gt;1&lt;/code&gt; and is aperiodic.&lt;/li&gt;&#xA;&lt;li&gt;The output sequence length always equals the number of 1-bits in the input.&lt;/li&gt;&#xA;&lt;li&gt;The output sequence array is always a permutation of &lt;code&gt;0&lt;/code&gt; to &lt;code&gt;M-1&lt;/code&gt; and begins with &lt;code&gt;0&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;               1 =&amp;gt;   1, [0]&#xA;              10 =&amp;gt;   1, [0]&#xA;             100 =&amp;gt;   1, [0]&#xA;             101 =&amp;gt;   2, [0, 1]&#xA;            1000 =&amp;gt;   1, [0]&#xA;            1011 =&amp;gt;   3, [0, 2, 1]&#xA;           10000 =&amp;gt;   1, [0]&#xA;           10010 =&amp;gt;   2, [0, 1]&#xA;           10101 =&amp;gt;   3, [0, 1, 2]&#xA;           10111 =&amp;gt;   4, [0, 3, 2, 1]&#xA;          100000 =&amp;gt;   1, [0]&#xA;          101111 =&amp;gt;   5, [0, 4, 3, 2, 1]&#xA;         1000000 =&amp;gt;   1, [0]&#xA;         1000100 =&amp;gt;   2, [0, 1]&#xA;         1001010 =&amp;gt;   3, [0, 2, 1]&#xA;         1010101 =&amp;gt;   4, [0, 1, 2, 3]&#xA;         1011011 =&amp;gt;   5, [0, 3, 1, 4, 2]&#xA;         1011111 =&amp;gt;   6, [0, 5, 4, 3, 2, 1]&#xA;        10000000 =&amp;gt;   1, [0]&#xA;        10010010 =&amp;gt;   3, [0, 1, 2]&#xA;        10101101 =&amp;gt;   5, [0, 2, 4, 1, 3]&#xA;        10111111 =&amp;gt;   7, [0, 6, 5, 4, 3, 2, 1]&#xA;       100000000 =&amp;gt;   1, [0]&#xA;       100001000 =&amp;gt;   2, [0, 1]&#xA;       100101010 =&amp;gt;   4, [0, 3, 2, 1]&#xA;       101010101 =&amp;gt;   5, [0, 1, 2, 3, 4]&#xA;       101110111 =&amp;gt;   7, [0, 5, 3, 1, 6, 4, 2]&#xA;       101111111 =&amp;gt;   8, [0, 7, 6, 5, 4, 3, 2, 1]&#xA;      1000000000 =&amp;gt;   1, [0]&#xA;      1000100100 =&amp;gt;   3, [0, 2, 1]&#xA;      1011011011 =&amp;gt;   7, [0, 4, 1, 5, 2, 6, 3]&#xA;      1011111111 =&amp;gt;   9, [0, 8, 7, 6, 5, 4, 3, 2, 1]&#xA;     10000000000 =&amp;gt;   1, [0]&#xA;     10000010000 =&amp;gt;   2, [0, 1]&#xA;     10001000100 =&amp;gt;   3, [0, 1, 2]&#xA;     10010010010 =&amp;gt;   4, [0, 1, 2, 3]&#xA;     10010101010 =&amp;gt;   5, [0, 4, 3, 2, 1]&#xA;     10101010101 =&amp;gt;   6, [0, 1, 2, 3, 4, 5]&#xA;     10101101101 =&amp;gt;   7, [0, 3, 6, 2, 5, 1, 4]&#xA;     10110111011 =&amp;gt;   8, [0, 5, 2, 7, 4, 1, 6, 3]&#xA;     10111101111 =&amp;gt;   9, [0, 7, 5, 3, 1, 8, 6, 4, 2]&#xA;     10111111111 =&amp;gt;  10, [0, 9, 8, 7, 6, 5, 4, 3, 2, 1]&#xA;    100101001010 =&amp;gt;   5, [0, 3, 1, 4, 2]&#xA;    101010110101 =&amp;gt;   7, [0, 2, 4, 6, 1, 3, 5]&#xA;    101111111111 =&amp;gt;  11, [0, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]&#xA;    111111111111 =&amp;gt;  13, [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]&#xA;   1000000100000 =&amp;gt;   2, [0, 1]&#xA;   1000010001000 =&amp;gt;   3, [0, 2, 1]&#xA;   1000100100100 =&amp;gt;   4, [0, 3, 2, 1]&#xA;   1001001010010 =&amp;gt;   5, [0, 2, 4, 1, 3]&#xA;   1001010101010 =&amp;gt;   6, [0, 5, 4, 3, 2, 1]&#xA;   1010101010101 =&amp;gt;   7, [0, 1, 2, 3, 4, 5, 6]&#xA;   1010110101101 =&amp;gt;   8, [0, 3, 6, 1, 4, 7, 2, 5]&#xA;   1011011011011 =&amp;gt;   9, [0, 5, 1, 6, 2, 7, 3, 8, 4]&#xA;   1011101110111 =&amp;gt;  10, [0, 7, 4, 1, 8, 5, 2, 9, 6, 3]&#xA;   1011111011111 =&amp;gt;  11, [0, 9, 7, 5, 3, 1, 10, 8, 6, 4, 2]&#xA;   1011111111111 =&amp;gt;  12, [0, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]&#xA;  10000100001000 =&amp;gt;   3, [0, 1, 2]&#xA;  10010010010010 =&amp;gt;   5, [0, 1, 2, 3, 4]&#xA;  10101101101101 =&amp;gt;   9, [0, 4, 8, 3, 7, 2, 6, 1, 5]&#xA;  10111011110111 =&amp;gt;  11, [0, 8, 5, 2, 10, 7, 4, 1, 9, 6, 3]&#xA;  10111111111111 =&amp;gt;  13, [0, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]&#xA; 100000001000000 =&amp;gt;   2, [0, 1]&#xA; 100010001000100 =&amp;gt;   4, [0, 1, 2, 3]&#xA; 100101010101010 =&amp;gt;   7, [0, 6, 5, 4, 3, 2, 1]&#xA; 101010101010101 =&amp;gt;   8, [0, 1, 2, 3, 4, 5, 6, 7]&#xA; 101101110111011 =&amp;gt;  11, [0, 7, 3, 10, 6, 2, 9, 5, 1, 8, 4]&#xA; 101111110111111 =&amp;gt;  13, [0, 11, 9, 7, 5, 3, 1, 12, 10, 8, 6, 4, 2]&#xA; 101111111111111 =&amp;gt;  14, [0, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:27.967" LastActivityDate="2016-10-21T07:43:51.407" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10367" PostTypeId="2" ParentId="2140" CreationDate="2016-10-21T11:49:00.513" Score="-3" Body="&lt;h2&gt;99 selttob fo reeb no eht llaw &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I teb ev'uoy lla draeh tuoba eht doog 'lo 99 selttob fo reeb no eht llaw. Llew ti os sneppah taht I emoc morf na evitanretla esrevinu - eht esrevinu erehw ew etirw gnihtyreve ni esrever! Ew peek eht snoitisop fo lanigiro hguoht. Siht osla snaem reporp noitazilatipac fo tsrif (ekil rettel ni siht txet). Ruoy egnellahc si ot etirw a margorp taht stuptuo eht lausu 99 selttob fo reeb no eht llaw, tub ni esrever (ni ruo egaugnal uoy dluow llac ti 99 bottles of beer on the wall). &lt;strong&gt;Siht si a ytiralupop tsetnoc, os teg evitaerc dna yrt ot sserpmi eht dworc. Doog kcul!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;  &lt;p&gt;I bet you've all heard about the good ol' 99 bottles of beer on the wall. Well it so happens that I come from an alternative universe - the universe where we write everything in reverse! We keep the positions of original though. This also means proper capitalization of first letter(like in this text). Your challenge is to write a program that outputs the usual 99 bottles of beer on the wall, but in reverse (in our language you would call it 99 selttob fo reeb no eht llaw). &lt;strong&gt;This is a popularity contest, so get creative and try to impress the crowd. Good luck!&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Elpmas fo derised tuptuo:&lt;/p&gt;&#xA;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;  &lt;p&gt;Sample of desired output:&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;99 selttob fo reeb no eht llaw, 99 selttob fo reeb. Ekat eno nwod dna&#xA;  ssap ti dnuora, 89 selttob fo reeb no eht llaw.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;89 selttob fo reeb no eht llaw, 89 selttob fo reeb. Ekat eno nwod dna&#xA;  ssap ti dnuora, 79 selttob fo reeb no eht llaw.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;...&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;1 elttob fo reeb no eht llaw, 1 elttob fo reeb. Ekat eno nwod dna ssap&#xA;  ti dnuora, on erom selttob fo reeb no eht llaw.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;On erom selttob fo reeb no eht llaw, on erom selttob fo reeb. Og ot&#xA;  eht erots dna yub emos erom, 99 selttob fo reeb no eht llaw.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="15174" LastEditorUserId="15174" LastEditDate="2016-10-21T13:40:01.267" LastActivityDate="2016-10-21T13:40:01.267" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="10371" PostTypeId="2" ParentId="10351" CreationDate="2016-10-21T22:16:01.113" Score="4" Body="&lt;h2&gt;&lt;a href=&quot;http://mego.github.io/CodePageKeyboard/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Code Page Keyboard&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Need to write something in a specific code page, and don't want to have to change your keyboard layout, learn a bunch of special codes, or copy-and-paste each individual character? This is the tool for you! Simply select a code page, click the buttons, and copy the text at the bottom. A &lt;em&gt;huge&lt;/em&gt; number of code pages are supported, including:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;ASCII&lt;/li&gt;&#xA;&lt;li&gt;CP437&lt;/li&gt;&#xA;&lt;li&gt;CP1252&lt;/li&gt;&#xA;&lt;li&gt;Latin-1&lt;/li&gt;&#xA;&lt;li&gt;Jelly&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-21T22:16:01.113" CommentCount="4" CommunityOwnedDate="2016-10-21T22:16:01.113" ContentLicense="CC BY-SA 3.0" />
  <row Id="10372" PostTypeId="2" ParentId="10351" CreationDate="2016-10-21T22:22:15.117" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;http://mego.github.io/ByteCounter/&quot; rel=&quot;nofollow noreferrer&quot;&gt;ByteCounter&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Yet another byte counter... However, this one works a bit differently than the rest. You input text, and it gives you the length of the text in bytes in &lt;em&gt;every possible encoding&lt;/em&gt; (so long as the encoding contains all of the characters in the text).&lt;/p&gt;&#xA;&lt;p&gt;Permalinks will be added soon for sharing results.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-21T22:22:15.117" CommentCount="2" CommunityOwnedDate="2016-10-21T22:22:15.117" ContentLicense="CC BY-SA 3.0" />
  <row Id="10373" PostTypeId="2" ParentId="2140" CreationDate="2016-10-21T23:51:14.590" Score="0" Body="&lt;h1&gt;Fastest Cashier in the West&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You're trying to design an automatic cashier that is able to dispense the correct amount of change in any denominations as quickly as possible. Your goal is to implement a program that accepts a target integer &lt;em&gt;T&lt;/em&gt; ≥ 0 which is the amount you're trying to make change for, and a set of positive integers {&lt;em&gt;c&lt;/em&gt;&lt;sub&gt;1&lt;/sub&gt;, &lt;em&gt;c&lt;/em&gt;&lt;sub&gt;2&lt;/sub&gt;, ..., &lt;em&gt;c&lt;/em&gt;&lt;sub&gt;&lt;em&gt;n&lt;/em&gt;&lt;/sub&gt;} which are the values of each coin where you have an infinite number of each, and output all possible solutions for making change with those types of coins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if you're trying to make change for 123 and the coins available are {12, 16, 20, 27}, then there are 8 possible solutions&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;12 16 20 27  (123)&#xA; 0  1  4  1  means zero 12's, one 16, four 20's, one 27&#xA;             also 0*12 + 1*16 + 4*20 + 1*27 = 123&#xA; 0  6  0  1&#xA; 1  4  1  1&#xA; 2  2  2  1&#xA; 3  0  3  1&#xA; 4  3  0  1&#xA; 5  1  1  1&#xA; 8  0  0  1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Format&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input will be formatted as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;T&#xA;N&#xA;c1&#xA;c2&#xA;...&#xA;cN&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;T&lt;/code&gt; is the target value, &lt;code&gt;N&lt;/code&gt; is the number of coins, and each &lt;code&gt;cK&lt;/code&gt; is the value of coin &lt;em&gt;k&lt;/em&gt;. Also, the coins will be listed in ascending order.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example,&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;123&#xA;4&#xA;12&#xA;16&#xA;20&#xA;27&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The output will be format as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x11 x12 ... x1N&#xA;x21 x22 ... x2N&#xA;...&#xA;xM1 xM2 ... xMN&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;M&lt;/code&gt; is the number of solutions and &lt;code&gt;N&lt;/code&gt; is the number of coins. Each line will contain the number of each coin needed to reach the target value separated by spaces. You may have trailing whitespace on each line.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the output to the input above would be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 1 4 1&#xA;0 6 0 1&#xA;1 4 1 1&#xA;2 2 2 1&#xA;3 0 3 1&#xA;4 3 0 1&#xA;5 1 1 1&#xA;8 0 0 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You may output the solutions on each line in any order, but each solution must be unique.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; so your only goal is to make your program as fast as possible.&lt;/li&gt;&#xA;&lt;li&gt;Builtins or libraries that solve this problem directly are not allowed.&lt;/li&gt;&#xA;&lt;li&gt;In the interests of having fine submissions, the deadline will be by December 12, 2016, which is almost two months.&lt;/li&gt;&#xA;&lt;li&gt;Your program must be single-threaded. However, you are allowed to use SIMD instructions and any other features of the CPU.&lt;/li&gt;&#xA;&lt;li&gt;The code will be ran on my machine which uses Fedora 24 x64 and has an i7-920 with 18 GB of memory.&lt;/li&gt;&#xA;&lt;li&gt;Please provide compilation instructions and version information if your program requires it.&lt;/li&gt;&#xA;&lt;li&gt;Please do not obfuscate your code unnecessarily. If I am suspicious of certain code and/or libraries, I reserve the right to ignore your submission.&lt;/li&gt;&#xA;&lt;li&gt;This is optional but if you are using advanced mathematical strategies, commenting and explaining your program would be very much appreciated.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Thoughts&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The test cases will be created and provided as a download if there is interest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For scoring, there will be a hidden dataset that is ran when the deadline is reached for final scoring purposes. After this is complete, the hidden dataset will be released along with the winner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For extra incentive, should I increase the best answer reward by including a bounty. Or maybe for the three fastest?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it okay to ban commercial products as I may not have access to some of them. It wouldn't be fair to allow Mathematica and not Matlab/Maple/etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;@PeterTaylor&lt;/strong&gt;: I have an implementation in Python that uses a memoized recursive function and I would say its performance is decent at best. I do agree that I/O could be a bottleneck but I could choose test cases that have few or no solutions. Using methods to calculate the Frobenius number would help find those, but I would still like to see a few cases with a large number of solutions. I see two options. First, I could require the output to be ordered so that results could be piped into another program and avoid hitting the disk while being verified. The second is to test each program twice, first with the output enabled to check the accuracy, and if accurate, the second run would be with the output disabled to measure the execution time.&lt;/p&gt;&#xA;" OwnerUserId="6710" LastEditorUserId="6710" LastEditDate="2016-10-22T18:54:54.977" LastActivityDate="2016-10-22T18:54:54.977" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10374" PostTypeId="2" ParentId="1061" CreationDate="2016-10-22T09:14:06.200" Score="6" Body="&lt;h2&gt;Precomputing data (including compile-time computation) to achieve lower runtime in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenges&lt;/h2&gt;&#xA;&lt;p&gt;Consider a challenge where solutions must print out as many Fibonacci numbers as possible within a certain time limit. A C++ solution might look like this:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-c++ prettyprint-override&quot;&gt;&lt;code&gt;#include &amp;lt;iostream&amp;gt;&#xA;using namespace std;&#xA;int main() {&#xA;    int a = 1, b = 1, c = 0;&#xA;    while(true) {&#xA;        cout &amp;lt;&amp;lt; b &amp;lt;&amp;lt; endl;&#xA;        c = b;&#xA;        b = a+b;&#xA;        a = c;&#xA;    }&#xA;    return 0;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is a perfectly valid solution. All of the computation is done at runtime, and its score can be determined fairly.&lt;/p&gt;&#xA;&lt;p&gt;Now, consider the following solution (adapted from &lt;a href=&quot;https://stackoverflow.com/a/22645853/2508324&quot;&gt;this SO answer&lt;/a&gt;):&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-c++ prettyprint-override&quot;&gt;&lt;code&gt;#include &amp;lt;iostream&amp;gt;&#xA;#include &amp;lt;cstdint&amp;gt;&#xA;using namespace std;&#xA;template&amp;lt;uintmax_t N&amp;gt;&#xA;struct fibonacci : integral_constant&amp;lt;uintmax_t, fibonacci&amp;lt;N-1&amp;gt;{} + fibonacci&amp;lt;N-2&amp;gt;{}&amp;gt; {};&#xA;&#xA;template&amp;lt;&amp;gt; struct fibonacci&amp;lt;1&amp;gt; : integral_constant&amp;lt;uintmax_t,1&amp;gt; {};&#xA;template&amp;lt;&amp;gt; struct fibonacci&amp;lt;0&amp;gt; : integral_constant&amp;lt;uintmax_t,0&amp;gt; {};&#xA;&#xA;int main() {&#xA;    const uintmax_t max = 10000ull;&#xA;    cout &amp;lt;&amp;lt; fibonacci&amp;lt;1&amp;gt;() &amp;lt;&amp;lt; endl;&#xA;    cout &amp;lt;&amp;lt; fibonacci&amp;lt;2&amp;gt;() &amp;lt;&amp;lt; endl;&#xA;    cout &amp;lt;&amp;lt; fibonacci&amp;lt;3&amp;gt;() &amp;lt;&amp;lt; endl;&#xA;    // ...&#xA;    cout &amp;lt;&amp;lt; fibonacci&amp;lt;10000&amp;gt;() &amp;lt;&amp;lt; endl;&#xA;    return 0;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This program (compiled with &lt;code&gt;g++ -o template_fib template_fib.cpp -std=c++14 -ftemplate-depth=12257&lt;/code&gt;) shifts the burden of computing the 10000 Fibonacci numbers to the compiler. At runtime, it's simply outputting 10000 constant values.&lt;/p&gt;&#xA;&lt;p&gt;Such solutions which attempt to cheat the scoring system by doing all of the computation during a time where the clock is not running should either not be allowed, or be required to count their compilation time into their score.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/240758/100664&quot;&gt;An actual example of this.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="100664" LastEditDate="2022-01-09T21:29:29.920" LastActivityDate="2022-01-09T21:29:29.920" CommentCount="16" CommunityOwnedDate="2016-10-22T09:14:06.200" ContentLicense="CC BY-SA 4.0" />
  <row Id="10375" PostTypeId="2" ParentId="2140" CreationDate="2016-10-22T12:30:15.427" Score="2" Body="&lt;h1&gt;Finding isomorphic elementary cellular automata&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cellular-automata&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cellular-automata&amp;#39;&quot; rel=&quot;tag&quot;&gt;cellular-automata&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An &lt;a href=&quot;https://en.wikipedia.org/wiki/Elementary_cellular_automaton&quot; rel=&quot;nofollow noreferrer&quot;&gt;elementary cellular automaton&lt;/a&gt; is a one-dimensional cellular automaton with two possible states (labeled 0 and 1) and calculates the following state based on a cell and its two immediate neighbors. Each elementary cellular automaton has a rule attached to it that specifies the resulting state for each of the configurations of a cell and its immediate neighbors.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The most common scheme for numbering these rules being the &lt;a href=&quot;https://en.wikipedia.org/wiki/Wolfram_code&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wolfram code&lt;/a&gt;, where we assign each rule a number from 0 to 255 which has become standard. Each possible current configuration is written in order, 111, 110, ..., 001, 000, and the resulting state for each of these configurations is written in the same order and interpreted as the binary representation of an integer. This number is taken to be the rule number of the automaton.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an example, we look at &lt;a href=&quot;https://en.wikipedia.org/wiki/Rule_110&quot; rel=&quot;nofollow noreferrer&quot;&gt;rule 110&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Cell configuration  111  110  101  100  011  010  001  000&#xA;Resulting state      0    1    1    0    1    1    1    0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Converting &lt;code&gt;01101110&lt;/code&gt; back to decimal gives us 110.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Not all rules are equal, of course. Of the 256 possible rules, many of these rules are trivially equivalent to each other up to a simple transformation of the underlying geometry. Each rule will have three isomorphic rules based on three transformations, though sometimes a rule will be isomorphic to itself under a particular transformation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first such transformation is reflection through a vertical axis and the result of applying this transformation to a given rule is called the &lt;strong&gt;mirrored rule&lt;/strong&gt;. These rules will exhibit the same behavior up to reflection through a vertical axis, and so are equivalent in a computational sense.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if the definition of rule 110 is reflected through a vertical line, the following rule (rule 124) is obtained:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Cell configuration  111  110  101  100  011  010  001  000&#xA;Resulting state      0    1    1    1    1    1    0    0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We swap only those cell configurations that are different when reflected through a vertical axis. The result of 110 is swapped with the result of 011, and the result of 100 is swapped with the result of 001. Everything else remains in place, as they are symmetrical.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The second such transformation is to exchange the roles of 0 and 1 in the definition. The result of applying this transformation to a given rule is called the &lt;strong&gt;complementary rule&lt;/strong&gt;. For example, if this transformation is applied to rule 110, we get the following rule:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Cell configuration  000  001  010  011  100  101  110  111&#xA;Resulting state      1    0    0    1    0    0    0    1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and, after reordering, we discover that this is rule 137:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Cell configuration  111  110  101  100  011  010  001  000&#xA;Resulting state      1    0    0    0    1    0    0    1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Finally, the previous two transformations can be applied successively to a rule to obtain the &lt;strong&gt;mirrored complementary rule&lt;/strong&gt;. For example, the mirrored complementary rule of rule 110 is rule 193.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of the 256 elementary cellular automata, there are 88 which are inequivalent under these transformations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your task is given an input rule number, determine which elementary cellular automata are isomorphic under these rules.&lt;/li&gt;&#xA;&lt;li&gt;The output should be a list (or equivalent) that represents:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The smallest Wolfram rule that is isomorphic to the input,&lt;/li&gt;&#xA;&lt;li&gt;Its mirrored rule,&lt;/li&gt;&#xA;&lt;li&gt;Its complementary rule, and&lt;/li&gt;&#xA;&lt;li&gt;Its mirrored complementary rule.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The output list may be reordered, though it should always be clear which rule is the smallest, the mirrored rule, and so on. Just sorting the list will not help here.&lt;/li&gt;&#xA;&lt;li&gt;This is code golf. Smallest number of bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;As always, if this challenge needs clarification or correction, let me know. Good luck and good golfing!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test cases&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All of the following test cases have the format &lt;code&gt;[smallest, mirrored, complementary, mirrored complementary]&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;110&#xA;[110, 124, 137, 193]&#xA;&#xA;232&#xA;[232, 232, 232, 232]&#xA;&#xA;0&#xA;[0, 0, 255, 255]&#xA;&#xA;16&#xA;[2, 16, 191, 247]&#xA;&#xA;42&#xA;[42, 112, 171, 241]&#xA;&#xA;144&#xA;[130, 144, 190, 246]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Can the specification be clearer or shorter?&lt;/li&gt;&#xA;&lt;li&gt;Should I change this challenge from code golf to some other scoring system?&lt;/li&gt;&#xA;&lt;li&gt;Should the input be different and challenge changed? If so, which of the following input systems should it be:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input that is currently used: a single rule number, and the challenge is changed to only finding the isomorphisms.&lt;/li&gt;&#xA;&lt;li&gt;The number of states of the automaton, where finding the complementary rules would be more complex (for 2 states, only two possible complements; for 3 states, six complements are possible). This would extend the definition of both the Wolfram code and the cellular automata.&lt;/li&gt;&#xA;&lt;li&gt;Any other suggestions?&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="47581" LastEditorUserId="47581" LastEditDate="2016-10-23T05:07:38.617" LastActivityDate="2016-10-23T05:07:38.617" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10376" PostTypeId="2" ParentId="2140" CreationDate="2016-10-22T18:53:47.697" Score="2" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;This message is open for anyone to adopt and post to main. For more details, see the &lt;a href=&quot;https://chat.stackexchange.com/rooms/60187/abandoned-challenges-up-for-adoption&quot;&gt;chat room&lt;/a&gt; or &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12792/58826&quot;&gt;meta post&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Visualized Tree of 3n+1 Conjecture&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Originally by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/59292/keyu-gan&quot;&gt;@KeyuGan&lt;/a&gt;. Thanks for letting me use this!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Probably you are already familiar with 3n+1 conjecture (aka Collatz conjecture). As is stated in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/12177/collatz-conjecture&quot;&gt;this golfing problem&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Start with an integer &lt;em&gt;n&lt;/em&gt; &gt; 1. &lt;/li&gt;&#xA;&lt;li&gt;Repeat the following steps:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;em&gt;n&lt;/em&gt; is even, divide it by 2. &lt;/li&gt;&#xA;&lt;li&gt;If &lt;em&gt;n&lt;/em&gt; is odd, multiply it by 3 and add 1. &lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And it is proven that for all positive integers up to &lt;em&gt;5 * 2&lt;sup&gt;60&lt;/sup&gt;&lt;/em&gt;, or about &lt;em&gt;5764000000000000000&lt;/em&gt;, &lt;em&gt;n&lt;/em&gt; will eventually reach &lt;em&gt;1&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is easy to draw a chain of the whole process for an integer (e.g. for 5, the chain is &lt;code&gt;1&amp;lt;-2&amp;lt;-4&amp;lt;-8&amp;lt;-16&amp;lt;-5&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task Description&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You are asked to print a string of a visualized 3n+1 tree of all chains resulting from positive integers from 2 to &lt;code&gt;n&lt;/code&gt;, containing new lines if necessary.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input and Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There is only one input &lt;code&gt;n&lt;/code&gt;, which can be read from stdin, be a function parameter or from any external sources.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can safely assume input is valid and does not exceed your language's processing ability. However, your code should be able to deal with inputs of &lt;code&gt;2&lt;/code&gt; - &lt;code&gt;446&lt;/code&gt;. Under such circumstances, the biggest number involved is &lt;code&gt;13120&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[&lt;strong&gt;Sandbox note:&lt;/strong&gt; Is &lt;code&gt;446&lt;/code&gt; a proper minimum ? It turns out to be the largest number in which the biggest number involves is less than &lt;code&gt;32767&lt;/code&gt;]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output is flexible, as long as:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is a textfile, or a string, or an array of characters, or an array of lines.&lt;/li&gt;&#xA;&lt;li&gt;It contains only &lt;code&gt;0&lt;/code&gt;-&lt;code&gt;9&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;, &lt;code&gt;|&lt;/code&gt;, &lt;code&gt;&amp;lt;&lt;/code&gt;, &lt;code&gt;&amp;gt;&lt;/code&gt;, &lt;code&gt;^&lt;/code&gt;, &lt;code&gt;v&lt;/code&gt;, spaces or new lines, where &lt;code&gt;&amp;lt;&lt;/code&gt;, &lt;code&gt;&amp;gt;&lt;/code&gt;, &lt;code&gt;^&lt;/code&gt;, &lt;code&gt;v&lt;/code&gt; are for arrows, &lt;code&gt;-&lt;/code&gt;, &lt;code&gt;|&lt;/code&gt; are for lines.&lt;/li&gt;&#xA;&lt;li&gt;Not hardcoded&lt;/li&gt;&#xA;&lt;li&gt;Correctly visualized and in proper directions (for instance, &lt;code&gt;1-&amp;gt;2-&amp;gt;4-&amp;gt;8-&amp;gt;16-&amp;gt;5&lt;/code&gt; and &lt;code&gt;1-2-4-8-16-5&lt;/code&gt; are not accepted.)&lt;/li&gt;&#xA;&lt;li&gt;All numbers included in the output occur exactly once.&lt;/li&gt;&#xA;&lt;li&gt;All leaves of the visualized tree should lie in the range of 2 ~ &lt;code&gt;n&lt;/code&gt;, that is, all numbers in the output must be necessary for the result.&lt;/li&gt;&#xA;&lt;li&gt;the destination of every chain is 1&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Besides, the output should meet the following formatting criterion:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A number should be arranged horizontally and connected.&lt;/li&gt;&#xA;&lt;li&gt;There should not be horizontally-adjancent digits from different numbers. For instance, in the following example, &lt;code&gt;17&amp;lt;34 23&amp;lt;46&lt;/code&gt; is OK, while &lt;code&gt;17&amp;lt;3423&amp;lt;46&lt;/code&gt; is not. Space(s) should be put between the two numbers under this circumstance.&lt;/li&gt;&#xA;&lt;li&gt;There should not be vertically-adjancent digits as well.&lt;/li&gt;&#xA;&lt;li&gt;There should not be zero(es) before a number (such as &lt;code&gt;0016&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;There should be only one arrow for a line.&lt;/li&gt;&#xA;&lt;li&gt;The line between two numbers must be straight. &lt;/li&gt;&#xA;&lt;li&gt;As is demonstrated in output, &lt;code&gt;-&lt;/code&gt; and &lt;code&gt;|&lt;/code&gt; can be omitted if not neccessary.&lt;/li&gt;&#xA;&lt;li&gt;Lines should not be crossed. A solution without crossed lines is proved to be available. A simple explaination is: Thinking in reverse, you can start from integer &lt;code&gt;x&lt;/code&gt;, and draw &lt;code&gt;2x&lt;/code&gt; and &lt;code&gt;(x-1)/3&lt;/code&gt; (if result is odd) following &lt;code&gt;x&lt;/code&gt;, and repeat the process for every new number. Stop when you have all required integers from 2 ~ &lt;code&gt;n&lt;/code&gt; in the graph and erase all unneccessary numbers.&lt;/li&gt;&#xA;&lt;li&gt;You can only draw a line onto and from a number directly, that is, the arrow of the line must be pointing at a digit. e.g. &lt;code&gt;|&amp;lt;--&lt;/code&gt;, &lt;code&gt;^&amp;lt;--&lt;/code&gt;, &lt;code&gt;|--&lt;/code&gt; and &lt;code&gt;^--&lt;/code&gt; are not accepted.&lt;/li&gt;&#xA;&lt;li&gt;The direction of arrows and lines must be correct. e.g. &lt;code&gt;^-&lt;/code&gt; and &lt;code&gt;&amp;lt;|&lt;/code&gt; are not accepted.&lt;/li&gt;&#xA;&lt;li&gt;There should not be spaces between arrow and number.&lt;/li&gt;&#xA;&lt;li&gt;There should not be spaces between arrows and lines, neither in lines.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;[&lt;strong&gt;Sandbox note:&lt;/strong&gt; Tell me plz if you come up with other loopholes.]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output is assumed to be printed in a monospaced font (all characters have same width).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sample&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;15&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Possible Output 1&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&amp;lt;2&amp;lt;4&amp;lt;8&amp;lt;16&#xA;         ^&#xA;         5&amp;lt;10&amp;lt;20&amp;lt;40&amp;lt;80&amp;lt;160&#xA;           ^     ^     ^&#xA;           3&amp;lt;6&amp;lt;12|     53&amp;lt;106&#xA;                 |        ^&#xA;                 13&amp;lt;26&amp;lt;52 35&amp;lt;70&#xA;                       ^     ^&#xA;                       17&amp;lt;34 23&amp;lt;46&#xA;                          ^     ^&#xA;                          11&amp;lt;22 15&#xA;                             ^&#xA;                             7&amp;lt;14&amp;lt;28&#xA;                                  ^&#xA;                                  9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Possible Output 2&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;                   15&#xA;                   v&#xA;                   46&#xA;                   v&#xA;                   23&#xA;                   v&#xA;                   70&#xA;                   v&#xA;                   35&#xA;                   v&#xA;                   106&#xA;                   v&#xA;                   53&#xA;                   v&#xA;                   160&#xA;                   v&#xA;                   80&#xA;                   v&#xA;1&amp;lt;2&amp;lt;4&amp;lt;8&amp;lt;16&amp;lt;5&amp;lt;10&amp;lt;20&amp;lt;40&amp;lt;13&amp;lt;26&amp;lt;52&amp;lt;17&amp;lt;34&amp;lt;11&amp;lt;22&amp;lt;7&amp;lt;14&amp;lt;28&amp;lt;9&#xA;             ^&#xA;             3&#xA;             ^&#xA;             6&#xA;             ^&#xA;             12&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Possible Output 3&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&amp;lt;2&amp;lt;4&amp;lt;8&amp;lt;16&amp;lt;5     80&amp;lt;160&amp;lt;53&amp;lt;106&amp;lt;35&amp;lt;70&amp;lt;23&amp;lt;46&amp;lt;15&#xA;           ^     v&#xA;    12&amp;gt;6&amp;gt;3&amp;gt;10&amp;lt;20&amp;lt;40&amp;lt;13&amp;lt;26&amp;lt;52&amp;lt;17&amp;lt;34&amp;lt;11&amp;lt;22&amp;lt;7&amp;lt;14&amp;lt;28&amp;lt;9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your answer should include verifiable output of input &lt;code&gt;42&lt;/code&gt;, without a violation to output requirements. And you should verify your answers with different answers on this page: &lt;em&gt;TBD&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[&lt;strong&gt;Sandbox note:&lt;/strong&gt; I will provide a js checker on my site to validate an output.]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Among all accepted codes, shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="59292" LastEditorDisplayName="user58826" LastEditDate="2017-06-09T14:40:12.767" LastActivityDate="2017-06-09T14:40:12.767" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="10377" PostTypeId="2" ParentId="2140" CreationDate="2016-10-22T19:09:20.413" Score="1" Body="&lt;h2&gt;Find the least squares regression line&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm taking AP stats now, so I figured I'd bring the joy to you all here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The form of an LSRL (least squares regression line) is  &lt;code&gt;ŷ = a + bx&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your job is to find the least squares regression line for two data sets (lists), &lt;code&gt;X&lt;/code&gt; and &lt;code&gt;Y&lt;/code&gt;. &lt;code&gt;X&lt;/code&gt; and &lt;code&gt;Y&lt;/code&gt; will be the same size with at least 2 elements. They will contain positive or negative floats. Input can be taken in any reasonable format.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The values &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; in the least squares regression line (LSRL) for the data in &lt;code&gt;X&lt;/code&gt; and &lt;code&gt;Y&lt;/code&gt;, where &lt;code&gt;a&lt;/code&gt; is the y-intercept and &lt;code&gt;b&lt;/code&gt; is the slope of the LSRL. &lt;a href=&quot;https://en.wikipedia.org/wiki/Simple_linear_regression&quot; rel=&quot;nofollow noreferrer&quot;&gt;This&lt;/a&gt; page describes a way to calculate this line.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Also, built-ins are allowed!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1.0, 2.0, 3.0, 4.0] [12.0, 15.0, 16.0, 17.0] -&amp;gt; A: 11.0 B: 1.6&#xA;[1.5, 1.5, 51.0, -15.0] [2.0, 1109.0, 0.003, 2.0] -&amp;gt; A: 314.92 B: -3.7609&#xA;[1.0, 2.0] [1.0, 2.0] -&amp;gt; A: 0.0 B: 1.0&#xA;[-15.0, -13.0, -163.0, -12.25, -14.41, 100000.0, -630.0, -135.0] [-142531.0, -12.0, 153.0, -135.0, 135.0, 16.0, 21.0, 0.0] -&amp;gt; A: -20285.0 B: 0.20121&#xA;[3.0, 5.0, 7.0, 9.0, 11.0, 13.0] [2.0, 4.0, 6.0, 8.0, 10.0, 12.0] -&amp;gt; A: -1.0 B: 1.0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="42854" LastEditorUserId="42854" LastEditDate="2016-10-22T21:26:04.170" LastActivityDate="2016-10-22T21:26:04.170" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10378" PostTypeId="2" ParentId="2140" CreationDate="2016-10-22T22:06:00.300" Score="1" Body="&lt;h1&gt;2D Poor Man's Plotting!&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;Surely you've also come across the problem where you have a multi-dimensional function at hand and want to visualize it (it's just such an everyday problem!). So we need a (programmatic) solution to this. A &lt;em&gt;memorable&lt;/em&gt; solution, thus obviously the shortest solution is best!&lt;/p&gt;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;Your (primary) input will be a function that maps two floats onto another float.&lt;/p&gt;&#xA;&lt;p&gt;Additionally there are six other parameters (floats), which you may take explicitely or hard-code:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;StartingValueX: 0&lt;/li&gt;&#xA;&lt;li&gt;StartingValueY: 0&lt;/li&gt;&#xA;&lt;li&gt;EndingValueX: 10&lt;/li&gt;&#xA;&lt;li&gt;EndingValueY: 10&lt;/li&gt;&#xA;&lt;li&gt;StepSizeX: 1&lt;/li&gt;&#xA;&lt;li&gt;StepSizeY: 1&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may take these parameters using your preferred method of input, but please document it (especially how the function should be passed).&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;The output is a formatted string or a printed output (whatever pleases you).&lt;/p&gt;&#xA;&lt;h3&gt;What to do?&lt;/h3&gt;&#xA;&lt;p&gt;The introduction already hinted it:&lt;br&gt;&#xA;Given a function that takes two floats as inputs, iterate it two-dimensionally and print the resulting values. So the top left entry is the result of the evaluation at (StartValueX,StartValueY) and the bottom right entry is the evaluation of (EndValueX,EndValueY) and then you form basically a table from this by incrementing the StartValue by the respective StepSize for each iteration.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Formatting guidelines:&lt;/strong&gt;&lt;br&gt;&#xA;Between each line may be one (or more) empty lines (eg end your lines with &lt;code&gt;\n\n&lt;/code&gt; in C).&lt;br&gt;&#xA;There must be at least one white space between every output number.&lt;br&gt;&#xA;All numbers with the same x-coordinate &lt;em&gt;must&lt;/em&gt; be aligned respectively to their start.&lt;/p&gt;&#xA;&lt;h3&gt;Potential Corner Cases&lt;/h3&gt;&#xA;&lt;p&gt;You may always assume a certain function prototype is used.&lt;br&gt;&#xA;If &lt;code&gt;EndValue-StartValue&lt;/code&gt; is not an exact multiple of StepSize (which may happen because we're dealing with floats here) then you shall compute for all &lt;code&gt;StartValue + k * StepSize&lt;/code&gt; smaller than EndValue as well as for EndValue.&lt;br&gt;&#xA;You may always assume the computation results (of the function) are actually representable in your language.&lt;br&gt;&#xA;You may not assume that the function is a simple mathematical function (e.g. any valid function adhering to the above conditions in your language must work).&lt;br&gt;&#xA;Trailing newlines and white spaces are allowed.&lt;/p&gt;&#xA;&lt;h3&gt;Who wins?&lt;/h3&gt;&#xA;&lt;p&gt;This is code-golf so the shortest answer in bytes wins!&lt;br&gt;&#xA;Standard rules apply of course.&lt;/p&gt;&#xA;&lt;h2&gt;Test-cases&lt;/h2&gt;&#xA;&lt;p&gt;Default parameters, &lt;code&gt;f(x,y)=x+y&lt;/code&gt;&lt;br&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0  1  2  3  4  5  6  7  8  9  10&#xA;1  2  3  4  5  6  7  8  9  10 11&#xA;2  3  4  5  6  7  8  9  10 11 12&#xA;3  4  5  6  7  8  9  10 11 12 13&#xA;4  5  6  7  8  9  10 11 12 13 14&#xA;5  6  7  8  9  10 11 12 13 14 15&#xA;6  7  8  9  10 11 12 13 14 15 16&#xA;7  8  9  10 11 12 13 14 15 16 17&#xA;8  9  10 11 12 13 14 15 16 17 18&#xA;9  10 11 12 13 14 15 16 17 18 19&#xA;10 11 12 13 14 15 16 17 18 19 20&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="55329" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-22T22:19:37.090" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10379" PostTypeId="1" CreationDate="2016-10-22T23:04:28.077" Score="1" ViewCount="69" Body="&lt;p&gt;My upcoming KoTH, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9188/20198&quot;&gt;Fellowship&lt;/a&gt;, has a &lt;em&gt;really&lt;/em&gt; large API.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fundamentally, there are 5 classes the player needs to work with:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/nathanmerrill/Fellowship/blob/master/src/fellowship/Player.java&quot; rel=&quot;nofollow noreferrer&quot;&gt;Player&lt;/a&gt; is the class they need to implement (6 functions)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/nathanmerrill/Fellowship/blob/master/src/fellowship/characters/ReadonlyCharacter.java&quot; rel=&quot;nofollow noreferrer&quot;&gt;ReadonlyCharacter&lt;/a&gt; is the class for each of the characters they control (25 functions)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/nathanmerrill/Fellowship/blob/master/src/fellowship/abilities/ReadonlyCharacterAbility.java&quot; rel=&quot;nofollow noreferrer&quot;&gt;ReadonlyAbility&lt;/a&gt; is the class for abilities characters can have (4 functions)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/nathanmerrill/Fellowship/blob/master/src/fellowship/actions/ReadonlyAction.java&quot; rel=&quot;nofollow noreferrer&quot;&gt;ReadonlyAction&lt;/a&gt; is the class for actions characters can have (7 functions)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/nathanmerrill/Fellowship/blob/master/src/fellowship/teams/ReadonlyTeam.java&quot; rel=&quot;nofollow noreferrer&quot;&gt;ReadonlyTeam&lt;/a&gt;/&lt;a href=&quot;https://github.com/nathanmerrill/Fellowship/blob/master/src/fellowship/teams/EnemyTeam.java&quot; rel=&quot;nofollow noreferrer&quot;&gt;EnemyTeam&lt;/a&gt; are classes for the teams the characters are on. (4 functions)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Some of these are less important (teams and abilities), but if my post is going to be self-contained, I would theoretically need to describe all of the functions I've listed above.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've got a couple of options here:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Only describe the critical parts in my post.  Answer any questions in comments/chat.&lt;/li&gt;&#xA;&lt;li&gt;Describe everything.  This would lead to a post with lots of information unimportant to most readers (and a &lt;em&gt;really&lt;/em&gt; long post)&lt;/li&gt;&#xA;&lt;li&gt;Something else?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;What should I do in my situation?&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2016-10-23T01:46:49.917" Title="How to deal with a large API for a KoTH" Tags="|discussion|king-of-the-hill|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10380" PostTypeId="2" ParentId="10328" CreationDate="2016-10-22T23:34:15.527" Score="9" Body="&lt;h2&gt;Skillful golfing&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Ultimately, we need for experienced golfers to find our community worth their attention. That means having competing golf submissions that challenge or even impress them. If they just see poorly-golfed submissions in their language of choice, they won't consider this as a place for &quot;real golfers&quot;. Or, perhaps, they will submit a few solutions to show off, then get bored quickly.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2016-10-22T23:34:15.527" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10381" PostTypeId="2" ParentId="10379" CreationDate="2016-10-23T01:04:25.533" Score="3" Body="&lt;h2&gt;Describe only the information about the public API that readers need to know&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You don't have to go into detail about how every part of the public API is implemented - just a rough overview of the different classes and methods, and their uses.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if you have a method that looks like this:&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;public UsefulInformation getInformation() {&#xA;    // 100 lines of code&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It's fine to not include the &lt;code&gt;// 100 lines of code&lt;/code&gt;, and just include the method signature and a brief comment describing the method:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;// returns a UsefulInformation object containing the current game state&#xA;public UsefulInformation getInformation();&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If anyone wants full implementation details, they can look at the full source code that you have hosted in a public location (like a public GitHub repository), via the link you include in the challenge body.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2016-10-23T01:46:49.917" LastActivityDate="2016-10-23T01:46:49.917" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10384" PostTypeId="2" ParentId="2140" CreationDate="2016-10-23T14:01:48.557" Score="1" Body="&lt;h1&gt;Directional Brainf*ck Compiler/Interpreter &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Challenge: Write a Brainf*ck compiler with 4 extra commands.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;L Set the direction to go left&#xA;R Set the direction to go right&#xA;D Set the direction to go down&#xA;U Set the direction to go up&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The original commands (altered):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+ Increment the cell one&#xA;- Decrement the cell one&#xA;[ Start a loop, if the cell is 0 then go to the next ]&#xA;] end a loop if the current cell is 0. Else go back to the last [ read and continue from there (in the direction you were going last time it was read.&#xA;. output the byte at the data pointer.&#xA;, accept one byte of input, storing its value in the byte at the data pointer.&#xA;&amp;gt; point to the cell to the right&#xA;&amp;lt; point to the cell to the left&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Compiler/Interpreter&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this case the compiler must either convert the code to another language or be an interpreter and run the code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is basically a directional version of brainf*ck. Directions should work the same way they do in &lt;code&gt;&amp;gt;&amp;lt;&amp;gt;&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The pointer should start at the tape's beginning. It must be infinite in the right direction. Left infinite is optional (if you add it -10 to the score). Upon end of code output (in any reasonable form) the current values on all the stacks. If a &lt;code&gt;]&lt;/code&gt; is hit before a &lt;code&gt;[&lt;/code&gt; output a warning (with a message of your choosing). If a &lt;code&gt;,&lt;/code&gt; is met at the end of the code you can do with it as you please. The program will terminate at the end of the file.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard loopholes apply. &lt;/p&gt;&#xA;" OwnerUserId="36842" LastEditorUserId="36842" LastEditDate="2016-10-30T14:34:22.113" LastActivityDate="2016-10-30T14:34:22.113" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="10386" PostTypeId="2" ParentId="2140" CreationDate="2016-10-23T19:33:06.083" Score="1" Body="&lt;h1&gt;Resolve paths &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Convert a path to an absolute path. The path may be: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;relative&lt;/li&gt;&#xA;&lt;li&gt;absolute&lt;/li&gt;&#xA;&lt;li&gt;contain &lt;code&gt;~&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If the path doesn't exist, exit with code 1. An invalid path leads to undefined behavior. i.e. &lt;em&gt;do whatever you want, I don't care&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test cases, assuming &lt;code&gt;/foo/bar&lt;/code&gt; is the current working directory, and the username is &lt;code&gt;~/admin&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;empty string&amp;gt; -&amp;gt; /foo/bar&#xA;. -&amp;gt; /foo/bar&#xA;.. -&amp;gt; /foo&#xA;... -&amp;gt; / # and so on until `...`&#xA;~/ -&amp;gt; ~/admin&#xA;~/golf -&amp;gt; ~/admin/golf&#xA;/bin -&amp;gt; /bin&#xA;foobar -&amp;gt; /foo/bar/foobar&#xA;.htaccess -&amp;gt; /foo/bar/.htaccess&#xA;./buildscript -&amp;gt; /foo/bar/buildscript&#xA;doesnotexist -&amp;gt; &amp;lt;exit with error code 1&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Don't use an external command or builtin that solves or almost completely solves this challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="41088" LastEditorDisplayName="user58826" LastEditDate="2017-06-09T12:04:21.103" LastActivityDate="2017-06-09T12:04:21.103" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10395" PostTypeId="2" ParentId="2140" CreationDate="2016-10-24T06:38:07.600" Score="0" Body="&lt;h1&gt;Write machine code that also works when left rotated one byte&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Write machine code for a CPU that runs and does something. The twist is that your code should run and do something else, without errors, if it is left rotated one byte.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Suggestions? Ideas? Thoughts? Let me know.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="53551" LastEditorUserId="53551" LastEditDate="2017-06-02T08:20:01.700" LastActivityDate="2017-06-02T08:20:01.700" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10396" PostTypeId="1" CreationDate="2016-10-24T12:12:51.703" Score="-5" ViewCount="209" Body="&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; Martin Ender made a very good point, that votes can act as a reward for e.g. a well-written explanation. I remember thinking in those terms a long time ago, but hadn't thought about it that way for a long time for some reason. This kind of unravels the crux of my argument, although I think there is still potentially something of value here. I'm leaving the original question untouched for now, while I try to think about how to proceed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Update:&lt;/strong&gt; I've decided to leave this feature request in place (as opposed to withdrawing it), but instead of using the defunct reasoning that &quot;it's useless when you really think about it&quot;, I present it as an aesthetic preference: Vote distribution is not in general a good measure of a post's value (in my view), and can be a distraction from the main activity at hand, and it would be nice to be able to submit in a more quiet environment. It would also be a very small protest against the idea that a natural way for people to show their appreciation is to click a little button on a screen. But I understand, as DJMcMayhem pointed out, that this feature has absolutely zero chance of being approved and implemented.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an aside, I think this post generated some interesting and unexpected discussion and was somehow therapeutic for me, and I hope that my display of folly provided some entertainment. (And I expected more downvotes, but I suppose the question is still a bit young.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Original post follows:&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This feature request applies only to codegolf.SE and only to main, not meta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it would be cool to be able to make a post (question or answer) that doesn't allow anyone to upvote it. The reasoning is specific to this site. There is, conveniently, already an objective scoring method associated with tasks that aren't specifically popularity contests. (For most golf questions it's just the size of your code, and of course there are other scoring methods for some problems.) So, voting for (correct) answers is superfluous, if you think about it. Community wiki has some connotations that make it unsuitable for general posting. And providing an option that would disallow any (up or down) voting on a post would be a way to avoid negative feedback for making low quality posts. So it seems fine to allow downvoting, while safely disallowing upvoting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an added bonus, with this option you would be able to get the satisfaction of achieving optimality if you can manage to keep a score of zero, whereas with the current system you can only get the illusion of getting closer to optimal without ever achieving it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't have a specific reason why this option should be allowed for questions, but I also see no reason to disallow it; so for now, it might as well be included in the feature request for the sake of consistency. But I don't think disabling upvoting on a question should make that option apply to all the answers; the motivation for this option is not related to community wiki.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The feature could be added as a checkbox next to &quot;community wiki&quot; and labelled as &quot;disable upvoting&quot; or something to that effect.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Perhaps using this option could be a way to indicate that you care more about solving problems and optimising than you do about the reputation system, but I don't think the intention is very important; the option would have the same effect regardless of your intention.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I understand that this is not likely to be a popular idea, which is probably an extreme understatement. But I honestly think this could improve the quality of the site, and I'd like to use this option if it became available. (Looking at the &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges&quot;&gt;privilege table&lt;/a&gt;, the ones I don't have yet don't look particularly useful, but if I wanted them then I could just make a bunch of posts the normal way to get there, and then use the option after that.) So it seems worth putting it out there for your consideration, at the risk of total ostracization. (Anyway, I already proposed this in &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/33093678#33093678&quot;&gt;chat&lt;/a&gt; a bit ago, although I'm not sure anybody took it seriously.) And of course, nobody would be forced to use this option if they didn't want to.&lt;/p&gt;&#xA;" OwnerUserId="2537" LastEditorUserId="66833" LastEditDate="2021-06-09T13:27:57.557" LastActivityDate="2021-06-09T13:27:57.557" Title="Add an option to disable upvoting for your post" Tags="|feature-request|status-declined|voting|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10397" PostTypeId="2" ParentId="10396" CreationDate="2016-10-24T14:15:43.453" Score="4" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;So, voting for (correct) answers is superfluous, if you think about it.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I've thought about it, and I remain thoroughly unconvinced. Even if posting is its own reward (and that is antithetical to the gamification of the network), when you've spent time coming up with clever tricks you want people to see them, and since most people don't change the sort order from the default (by votes descending), forcing your vote total to be non-positive has the effect of reducing the number of people who will see how clever you've been.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2016-10-24T14:15:43.453" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10398" PostTypeId="2" ParentId="7260" CreationDate="2016-10-24T14:44:49.803" Score="4" Body="&lt;h1&gt;Yes and No&lt;/h1&gt;&#xA;&lt;p&gt;There are two kinds of bounties we can disallow:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Bounties that reward answers that don't fit the submission requirements:  &amp;quot;Draw a cat&amp;quot; on a Fibonacci challenge.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Bounties that have a tendency to push answers away from the scoring criterion&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;For example, on a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; posting a bounty for &amp;quot;Fastest code&amp;quot; would not be allowed.  &lt;strong&gt;Posting a bounty for &amp;quot;Code that is fast and golfed&amp;quot; &lt;em&gt;is&lt;/em&gt; allowed.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Note that objectiveness is not required for bounties. However, &amp;quot;Fast code&amp;quot;, &amp;quot;Well-formatted code&amp;quot;, &amp;quot;Code with good variable names&amp;quot; would all be disallowed on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, as they nearly &lt;em&gt;always&lt;/em&gt; produce un-competitive answers.&lt;/p&gt;&#xA;&lt;p&gt;However, if the bounty has little effect on the competitiveness of answers, or it takes into account the current scoring criterion, then it is fine.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-25T18:35:26.763" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10399" PostTypeId="2" ParentId="10396" CreationDate="2016-10-24T15:47:05.757" Score="0" Body="&lt;p&gt;Setting aside the feasibility of this request, I can pretty much guarantee it will not be implemented. Obviously, I can not say for sure since I am not an SE employee, but we have made &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7683/increase-reputation-awarded-for-questions&quot;&gt;simpler requests&lt;/a&gt; (that puzzling.se has also made IIRC) with an &lt;em&gt;overwhelmingly&lt;/em&gt; positive reception, and the response is just&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;No, it's not worth the dev-time to customize a single site.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If they refuse to change a constant value awarded, I highly doubt they'll go to the effort to implement an entirely new type of post, especially since that type of post is &lt;em&gt;completely&lt;/em&gt; opposite of the nature of the SE network.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That being said, I don't really think this feature would do any harm. But it &lt;em&gt;certainly&lt;/em&gt; would not do any good whatsoever. The biggest problem is that voting is &lt;em&gt;not&lt;/em&gt; superfluous! If a new user comes to the site and looks at a challenge, the most interesting a most clever answers should be displayed first. Unfortunately our voting culture &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10132/31716&quot;&gt;is not perfect&lt;/a&gt;, but this feature would not fix that.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;As an added bonus, with this option you would be able to get the satisfaction of achieving optimality if you can manage to keep a score of zero, whereas with the current system you can only get the illusion of getting closer to optimal without ever achieving it.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is completely untrue. People do not downvote very often on this site, and this would only work if we had a culture where downvoting for the tiniest of flaws was expected. Not even &lt;em&gt;flaws&lt;/em&gt; but the tiniest of &lt;em&gt;shortcomings&lt;/em&gt; This is not the state of our site currently, and even if it was, a site like that is not one I want to participate on. Not to mention that even then this wouldn't work perfectly since lots of perfectly fine posts get downvotes for no reason.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Perhaps using this option could be a way to indicate that you care more about solving problems and optimising than you do about the reputation system, but I don't think the intention is very important; the option would have the same effect regardless of your intention.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If you care more about solving problems and the fun of code-golf than you do about the reputation, then that's great! I (and many many other users also) do too! That is exactly why you should participate on this site. But I don't see how earning reputation subtracts from the fun of solving problems. If anything I feel like it enhances the reward of solving problems. Not only did I come up with an answer and have fun doing so, but other users have looked at my post and said:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Yes! You solved this problem very well!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Here's a hypothetical situation. Let's say a user comes to the site and over a long period of time posts several hundred fantastic answers, but doesn't care about reputation at all. I would say this user &lt;em&gt;absolutely&lt;/em&gt; deserves a high reputation. Not because they care about the points, or because they subscribe to the &quot;gamification&quot; of the network, but because they have earned the trust of the community. That's exactly what reputation is. When a user donates a lot of time and energy into a community, reputation proves that they really are established users who understand the community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So overall, I feel like this feature request is seeking to fix the wrong problem. There's nothing wrong with giving rep to users who don't want it. If earning reputation actually bothers you, SE is probably the wrong place to participate on.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2016-10-24T16:49:27.093" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10402" PostTypeId="1" AcceptedAnswerId="10407" CreationDate="2016-10-24T22:11:37.020" Score="3" ViewCount="82" Body="&lt;p&gt;Consider the following two challenges:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10385/45941&quot;&gt;This Sandboxed challenge&lt;/a&gt; gives an unfair advantage to users who have been around longer and contributed more towards collaborative golfing efforts.&lt;/li&gt;&#xA;&lt;li&gt;The original version of &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/97288/1&quot;&gt;this challenge&lt;/a&gt; gave an unfair advantage to users with short usernames (and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5375/45941&quot;&gt;changing your username for a challenge is not allowed&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Should challenges which give unfair advantages to certain users (or groups of users) be explicitly off-topic?&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-10-24T23:07:54.683" Title="Should challenges that give unfair advantages to certain users be off-topic?" Tags="|discussion|policy|scope|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10403" PostTypeId="2" ParentId="10402" CreationDate="2016-10-24T22:11:37.020" Score="3" Body="&lt;h2&gt;Yes, they should&lt;/h2&gt;&#xA;&lt;p&gt;Winning a challenge should be due to optimizing your code well to the winning criteria, not because you just so happened to be the optimal user for the challenge.&lt;/p&gt;&#xA;&lt;p&gt;To quote &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/33108651#33108651&quot;&gt;a chat message&lt;/a&gt; from trichoplax:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I think that a winning criterion should be fair, not just objective. The two seem to go together. So the score should be identical regardless of who posted the answer.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-24T22:11:37.020" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10404" PostTypeId="2" ParentId="2140" CreationDate="2016-10-24T22:21:32.233" Score="2" Body="&lt;h2&gt;Permutation-Tolerant Hello World&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;i&gt;Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/11383/fault-tolerant-hello-world-a-k-a-the-interview&quot;&gt;Fault-Tolerant Hello World (a.k.a. the Interview)&lt;/a&gt;.&lt;/i&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Task&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write a program that prints &lt;code&gt;Hello World&lt;/code&gt;. Sounds easy, right? Ok, lets challenge up a bit : your (real) task is to maximum the number of permutations of the characters of your code that produce a code that when executed prints &lt;code&gt;Hello World&lt;/code&gt; as well.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hmm, I even got myself confused with that last sentence, so let's see an example :&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider the following code (it's good enough to understand the principle, but as I'll explain later, the score of such a code will be pretty low) :&lt;br&gt;&#xA;(it's Perl code, and if you don't trust me when I say it works, you can run it with &lt;code&gt;perl -e 'code'&lt;/code&gt; in your terminal)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;print+(&quot;Hello World&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;When ran, it prints &lt;code&gt;Hello World&lt;/code&gt;.&#xA;Well, the following permutations of the code also print &lt;code&gt;Hello World&lt;/code&gt; :&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+(print&quot;Hello World&quot;)&#xA;+print(&quot;Hello World&quot;)&#xA;(print+&quot;Hello World&quot;)&#xA;()+print&quot;Hello World&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that only permutations that produce a code that differs from the previous ones should be considered. For instance, the original code where the two &lt;code&gt;l&lt;/code&gt; have been swapped isn't a valid permutation.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The score of your solution is the number of bytes of your code divided by the number of valid permutations. Lowest score wins. In case of draw, the earliest solution wins.&lt;br&gt;&#xA;For instance, my example above was 21 bytes long, and had 5 valid permutations (note that it includes the original code), so its score is &lt;code&gt;21/5 = 4.2&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;hr&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;For the sandbox&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;(1- Does it sound like a nice challenge?&lt;br&gt;&#xA; 2- Is it clear? )&lt;/p&gt;&#xA;&#xA;&lt;p&gt;3- I don't really what tags to add...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;4- I'm not sure about the scoring method. In particular, I wonder if just adding useless stuff around the &quot;print hello world&quot; part of the program (no matter the language) might allow a lot of permutations to be valid with some languages.&lt;br&gt;&#xA;I'd like the code where all permutations are valid and that is the longest possible to win. And I'm not sure my scoring method will produce such results. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;5- Is a &quot;print hello world&quot; program the more relevant? Actually I think that the code could do anything : calculating oeis sequence, drawing rectangles or whatever, as long as all the permutations produces the same behavior. But then some people might play on internal behavior of languages such as &quot;by default, this language prints &lt;code&gt;1&lt;/code&gt;&quot;, so every permutation of any source will print &lt;code&gt;1&lt;/code&gt;, or stuffs like this... Any thoughts?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;6- I thought about making this challenge harder by actually changing &quot;as much permutations as possible should be valid&quot; to &quot;all permutations should be valid&quot;. This will of course prevent a lot of languages to compete, but might result in creative and nice answers.&lt;/p&gt;&#xA;" OwnerUserId="55508" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.947" LastActivityDate="2016-10-24T22:21:32.233" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10405" PostTypeId="2" ParentId="7260" CreationDate="2016-10-24T22:34:16.690" Score="0" Body="&lt;h1&gt;No.&lt;/h1&gt;&#xA;&lt;p&gt;Bounties should reward exemplary solutions, if relating to an answer at all. i.e. shortest solution to a code-golf, as it is the best solution at the moment, fastest to a fastest-code, etc.&lt;/p&gt;&#xA;&lt;p&gt;If you look at the bounty options, the only 4 really relating to answers are &amp;quot;Reward existing&amp;quot;, &amp;quot;Canonical answers required&amp;quot;, &amp;quot;More detail&amp;quot;, and &amp;quot;Answers are out-dated.&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;None of these say anything about helping with a different problem. The closest might be &amp;quot;more detail&amp;quot;, but that doesn't really fit.&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-24T22:34:16.690" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10406" PostTypeId="1" CreationDate="2016-10-24T22:56:44.757" Score="4" ViewCount="230" Body="&lt;p&gt;I little while back I awarded &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt; a 500 rep bounty for his &lt;a href=&quot;https://codegolf.stackexchange.com/a/95210/56656&quot;&gt;excellent answer&lt;/a&gt; to one of my indefinite bounties.  Thinking that Dennis would want his well deserved rep as soon as possible, I awarded the bounty within minutes of the end of the 24 hour holding period, only to discover that this was generally considered bad practice and it was customary to wait the entire week before awarding a bounty.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I now have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10109/56656&quot;&gt;1000 rep bounty&lt;/a&gt; for beating Dennis' original solution and I was wondering how I should award it.  Since it is impossible to award a 1000 rep bounty all at once I am going to have to award two 500 rep bounties (or some other number of equivalent bounties).  Should I leave both open for a full week or should I close one as quickly as possible and keep the other open for six days?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I suppose it is ultimately up to me what I do with my rep but I would like some suggestion from people in the community who have been here for a while.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-10-24T23:30:01.433" Title="How Long Should I keep an Indefinite bounty open?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10407" PostTypeId="2" ParentId="10402" CreationDate="2016-10-24T23:07:54.683" Score="3" Body="&lt;h2&gt;I agree these should be off topic&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In addition to thinking that a winning criterion should be fair, I also prefer to see challenges where the submissions are all solving the same task and can be compared like for like.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I agree with avoiding &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8106/20283&quot;&gt;bonuses in code golf&lt;/a&gt;, because it creates several parallel competitions which are jumbled into one. In the same way I think giving a different task (or different advantages) to different people means that the list of submissions cannot be meaningfully compared.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A challenge should not just be fun, but meaningfully competitive. That's the specific type of fun that this site caters for. A challenge here should provide a level playing field and a straightforward way to assess which of two submissions is winning.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Tackling a PPCG challenge can provide competition with others, and also competition with oneself, both of which can be rewarding. Giving different challenges to different people still allows competition with oneself, but removes the significance of competing with others, losing a large part of the competition.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also think challenges should be inclusive. To be told &quot;you can't play&quot;, even if only due to an accident of username/avatar that renders your possibility of competing negligible, is frustrating. Rather than simply discourage this situation, I believe it is best that this be declared off topic, so that all of our challenges will be available equally to all.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2016-10-24T23:07:54.683" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10408" PostTypeId="2" ParentId="10406" CreationDate="2016-10-24T23:30:01.433" Score="8" Body="&lt;h1&gt;Maximise the visibility time&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It costs you the same in rep regardless of the approach you take.&lt;/li&gt;&#xA;&lt;li&gt;The recipient receives the same amount of your rep regardless of the approach you take.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I therefore recommend taking the approach that leaves the challenge with an active bounty (and therefore in the &quot;featured&quot; tab on the front page) for as long as possible. This gives the maximum amount of visibility to the challenge, and to the submission you intend to reward. The recipient is therefore likely to receive more rep from upvotes, on top of the bounty rep you award.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The extreme case&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I think most people here would agree with this general approach, but when taken to the extreme I don't know how people would view it. For example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;rep of 150 could be applied as two bounties, 50 and 100&lt;/li&gt;&#xA;&lt;li&gt;rep of 500 could be applied as three bounties, 50, 150 and 300&lt;/li&gt;&#xA;&lt;li&gt;rep of 1000 could be applied as 50, 150, 300 and 500&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;When the bounty is this large, it is possible to &quot;buy&quot; 4 weeks of visibility in the featured tab for a submission you wish to reward. I don't know how long would be too long, resulting in people becoming irritated.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;I see no problem with getting the most out of it&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Personally, I think if you are prepared to spend the rep then you should be able to buy time in the featured tab for as long as you wish, whether for rewarding a specific submission or advertising a specific challenge. I'd be interested to hear how the rest of the community feels about this.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2016-10-24T23:30:01.433" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10409" PostTypeId="2" ParentId="10328" CreationDate="2016-10-25T00:37:21.987" Score="11" Body="&lt;p&gt;&lt;em&gt;Long post. I bolded the important parts. Unfortunately, this formatting looks a little swiss cheesey as a result.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;1: I feel like I'm going to have to jump through hoops just to be acknowledged&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I don't post in this StackExchange, but I write a lot of obfuscated and golfed code in my spare time. I don't like hanging out with programmers, especially not on StackExchange, but I like spectating and I like talking about programming.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm hoping I don't come off like a jerk -- that's really not what I mean, and a lot of the things I'm most upset about just seem to be things that happen with large groups of people. I moderate another programming community (from a bit of a distance) and I'm very tired of dealing with people who complain that people don't like them, and then they don't change -- I'm probably projecting a little bit of that frustration onto CodeGolf.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is nobody specific on CodeGolf who I would say is a bad or irritating person, although I have a bad memory for names, so it's possible that if I gave it some thought I'd have some vitriol for some of you. (I'd like to give shout outs to a few of you guys -- like Dennis -- for being really really cool!)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are my thoughts on why I don't post here:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I've read this StackExchange for maybe ~2hr a week for ~6 months. I really like some of the content that gets produced here, but I don't like the moderation or the community. &lt;strong&gt;I think I can be authoritative about how this community looks from the outside.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;As the author/implementor of multiple esoteric programming languages, I still get turned off by golfing languages. &lt;strong&gt;There's an argument to be made that designing an esoteric language can require more cleverness than is apparent -- I absolutely believe this.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;It doesn't mean I can see through to the creativity -- especially when these languages &lt;em&gt;obscure&lt;/em&gt; the creative trick being used.&lt;/strong&gt; Especially when a lot of them, like pyth or matl, appear to be crude minmaxing efforts. Taking an existing language and making the variable names one letter long is really not very interesting. The only reason you would ever do that, as far as I know, is if you really like winning and want to win on a technicality.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even for really good esolangs, my reaction to a wall of nonprinting characters is still &quot;wow, that's a wall of nonprinting characters&quot; -- it's really hard for me to see through that to read creativity.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;I feel like people put a whole lot of emphasis onto &lt;em&gt;winning&lt;/em&gt;.&lt;/strong&gt; That means emphasizing:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;nitpicking whether programs exactly implement the specs as given;&lt;/li&gt;&#xA;&lt;li&gt;using loopholes, or specifically ruling out loopholes;&lt;/li&gt;&#xA;&lt;li&gt;quibbling. There's so much quibbling.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Creativity does not get rewarded that much&lt;/strong&gt;:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Everyone is golfing the same programs&lt;/strong&gt;, and frequently winners are just esoteric reimplementations of techniques someone introduced in a different answer. &lt;strong&gt;There's not as much room to be acknowledged on an answer that doesn't &quot;win.&quot;&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Here is a concrete example of something I chose not to post because I didn't feel like anyone would take it seriously or give it attention.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is a problem that has a trivial solution that has been implemented fifteen or so times: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/96641/nest-a-string&quot;&gt;N(e(s(t))) a string&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;I wrote a totally straightforward golfed Haskell solution that's very short, but not as short as any of the golfing language solutions.&lt;/strong&gt; That solution is &lt;code&gt;f[x]=[x];f(x:y)=x:'(':(f y++&quot;)&quot;)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;I also wrote a solution to a close variant of the problem (with a different terminal case), but for the sake of fun, used no word characters.&lt;/strong&gt; That solution is &lt;code&gt;((((++).(&amp;gt;&amp;gt;=(:&quot;(&quot;))))&amp;lt;*&amp;gt;(&amp;gt;&amp;gt;&quot;)&quot;))&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think this solution is a really fun monstrosity, but &lt;strong&gt;it fails on some technicalities:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;it generates strings like &quot;a(b(c()))&quot; instead of &quot;a(b(c))&quot;&lt;/li&gt;&#xA;&lt;li&gt;it requires &lt;code&gt;import Control.Applicative&lt;/code&gt; -- which is a standard library module that almost every project imports in every file.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I elected not to post it because I figured I would be nitpicked and told I didn't follow the spec.&lt;/strong&gt; It's possible this is what you guys want to encourage, but I feel like the demonstrated outcome of this situation is: (1) I am a guy who is able to produce weird golfy programs (2) I am too turned off to work with you. &lt;strong&gt;I am probably not the only person who has thought this.&lt;/strong&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think a lot of this is just StackExchange culture. (and it's part of why I don't post on StackExchange more often)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I think the StackExchange culture problem is worse here. If you ask me, this StackExchange has the same problems that a &quot;comedy&quot; StackExchange would have -- you can't &lt;em&gt;win&lt;/em&gt; at telling jokes, even though you can compete. &lt;strong&gt;Quibbling over who told the best joke, or trying to turn the quality of a joke into a technical topic, imho misses the point of joke telling.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Obviously you can objectively assess how golfed code is by looking at how short it is, but I think treating that as an overriding concern dismisses a ton of creativity.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;2: If I complain, I will be ignored. This is happening to people other than me in the comments of &lt;em&gt;this very question&lt;/em&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is the real reason I wanted to write this answer. My estimation: I have probably read around twenty pages of CodeGolf complaints since I started reading this website. Here is a list of responses I have seen complainers get. The complainers usually leave the discussion. I don't know if they continue posting on CodeGolf:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;It's weird that this thing bothers you (CodeGolf non-participant), because it doesn't bother me (CodeGolf participant) at all!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This site selects for people who like the culture on this site. If it bothers other people but not you, then you are possibly part of the problem. I'm not saying those other people aren't wrong too, but you're the one trying to get attention.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;In general, your existing users are disproportionately loud compared to the users who are looking at your site and saying &quot;this isn't for me&quot; -- especially when your discussion is really buried in a place like meta.codegolf.&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;I know this bothers you, but it's not going to change.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;OK, but understand that when you dismiss someone like this, you're also dismissing a whole lot of people who never said anything. In the past six months I've visited around ~20 communities which were moderated in a way that totally turned me off, and I complained in two. If every user is like me, then you're bleeding ten users for every user who complains.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But based on my experience as a moderator on other sites, I would guess most users are much less likely to post than me if they're upset, and far more likely to leave. I bled eight users in a week over a problem that, as far as I knew, only one person was bothered by. Instead of addressing it I ignored it and then about five more people quit. &lt;em&gt;Those are just the people who told me it was bothering them.&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;We're not really like that.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's very easy to say this kind of thing when you're on the inside. But it's really hard to know how you come off to the outside -- as far as I can tell, everyone here including me has been as honest as possible about how CodeGolf comes across from the outside, and I really think it's not a nice picture.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;The solution is [something new users should do that they're not doing]&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is very easy to say as an old user and it's an absolute turnoff as a new user. There's a level of change I'm comfortable making if I want to be a member of someone's club, but I don't think the value proposition of CodeGolf is actually that strong. Like I went over above: I would rather post on a different website than deal with the possibility of being nitpicked.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are a lot of people, mostly smarter than me, that don't have to do an iota of self-examination to feel unwelcome. Those people leave the second they hear stuff like this.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;The solution is [something existing non-moderator users should be doing]&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The answers by xnor (&quot;Skillful golfing,&quot; &quot;Strive to outgolf&quot;) pin the blame on unnamed internal users who do not golf well. Those users are not reading this post and probably will not change. If they do read this post, they won't think that they're the problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not saying this is wrong, but it's not really actionable.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;I'm not going to listen to your suggestion until you engage in a semantics argument with me.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This has happened in &lt;em&gt;many&lt;/em&gt; &quot;what is a golfing language?&quot; discussions. &quot;You're saying we should ban golfing languages. Well, is APL a golfing language? How about J? What about CJam or Retina or Matlab? You're not going to tell me FORTH is esoteric, are you?&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What usually happens is that the guy who complained about golfing languages leaves -- the insider who likes golfing languages gets to feel smug. This is not a behavior that helps you gain and keep new members, even if you're pretty sure those new members are wrong.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;In the community I moderate, I think of semantics arguments as an indication that the surrounding discussion has failed. They force a new user to prove his dedication to group signifiers or else get lost. Someone who starts a semantic argument usually doesn't intend to change his mind.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is especially true when you're in a discussion context that gives one party a lot of power and the other party not much power at all. (e.g. &quot;I have all my friends here, you don't have any friends&quot; -- &quot;I have a number next to my name that says I'm smart; you don't have a number next to your name that says &lt;em&gt;you're&lt;/em&gt; smart&quot;)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;My actionable suggestions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Encourage (on an official level) challenges that don't allow for &quot;golfing languages.&quot;&lt;/strong&gt; I don't know what the criterion is and I'm not interested in getting in a semantic argument here. We have a loopholes list -- we can keep a golfing languages list. By nature it'll be weird and arbitrary, and people will probably break those rules if they think the thing they're posting is interesting anyway. (And they'll be right to do it.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Encourage challenges that don't have objective criteria for winning.&lt;/strong&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Encourage challenges where solutions aren't expected to duplicate others.&lt;/strong&gt; (e.g. &quot;Create this output&quot; is bad -- &quot;make a nice drawing&quot; is good, because no one expects you to duplicate someone else's nice drawing)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Where encouraging a standard means, concretely:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Put the encouraged standard somewhere incredibly visible on the website.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Modpost when people don't meet the standard you're encouraging them to follow.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Correct existing unanswered challenges to match the new standard.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Repost variants of old challenges edited to meet the new standard.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;3: Ask this question on other golfing sites instead of meta.codegolf.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Almost everyone qualified to respond to this question is &lt;em&gt;not posting on this website.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;4: Note on people who already like the CodeGolf format, but don't participate on CodeGolf&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Peter Taylor points out in the comments: this answer broadly targets recreational programmers. He thinks this question pertains more to people who:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;like being scored solely on length&lt;/li&gt;&#xA;&lt;li&gt;like it when everyone writes the same program&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;(He makes a good argument for this: you should read it below.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Those people might not care about &quot;everyone writes the same program&quot; or &quot;the biggest influencer of your score appears to be length,&quot; but you might:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;have someone moderatorial go over and ask why these people aren't posting on CodeGolf&lt;/li&gt;&#xA;&lt;li&gt;ask how they feel about cross-language contests, the CodeGolf scoring format, golfing programming languages&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I'd love to speculate about the degree of overlap between the people I'm talking about and the people he's talking about, but I'm not a sociologist, so if I speculate too much about large populations of people, someone will probably die.&lt;/p&gt;&#xA;" OwnerUserId="61106" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-10-26T16:44:34.463" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="10413" PostTypeId="2" ParentId="2140" CreationDate="2016-10-25T17:22:15.567" Score="2" Body="&lt;h1&gt;Display an xkcd&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;xkcd is everyone's favorite webcomic, and you will be writing a program that will bring a little bit more humor to us all.&lt;br&gt;&#xA;Your objective in this challenge is to write a program which will take a number as input and display that xkcd and its alt-text (mousover text). &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program will take an integer as input and display that xkcd: for example, an input of 1500 should display the comic &quot;Upside-Down Map&quot; at xkcd.com/1500, and then either print its alt-text to the console or display it with the image.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/LpNQf.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/LpNQf.png&quot; alt=&quot;Due to their proximity across the channel, there&amp;#39;s long been tension between North Korea and the United Kingdom of Great Britain and Southern Ireland.&quot;&gt;&lt;/a&gt;&#xA;&lt;code&gt;Due to their proximity across the channel, there's long been tension between North Korea and the United Kingdom of Great Britain and Southern Ireland.&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program should also be able to function without any input, and perform the same task for the most recent xkcd found at xkcd.com, and it should always display the most recent one even when a new one goes up.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You do not have to get the image directly from xkcd.com, you can use another database as long as it is up-to-date and already existed before this challenge went up.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may &lt;I&gt;not&lt;/I&gt; display the entire webpage in an iframe or similar. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can handle the case that there isn't an image for a particular comic (i.e. it is interactive or the program was passed a number greater than the amount of comics that have been released) in any reasonable way you wish, including throwing an exception, or printing out an at least single-character string, as long as it somehow signifies to the user that there isn't an image for that input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, so the fewest bytes wins! &lt;/p&gt;&#xA;" OwnerUserId="60042" LastEditorUserId="60042" LastEditDate="2016-10-25T20:54:57.897" LastActivityDate="2016-10-25T20:54:57.897" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10414" PostTypeId="2" ParentId="2140" CreationDate="2016-10-25T17:45:35.633" Score="1" Body="&lt;h1&gt;[Lang1] vs [Lang2] ... vs [LangN]: Battle of the golfers!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/teamwork&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;teamwork&amp;#39;&quot; rel=&quot;tag&quot;&gt;teamwork&lt;/a&gt; and other tags for the challenge questions, which may be a lot.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Note: I haven't figured out all the kinks out yet, all I have is a general idea that, with your help, can be put properly into an awesome challenge (I hope). The parts where my ideas are not solid yet have Notes attached to them that must be read.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Team&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In the midst of the nation of SE, there lies a golf field for the community of golfers. These golfers play day and night using specialised clubs (languages) to complete difficult and challenging holes (challenges). Now it is time to see the best of these golf clubs in the game!&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Note 1: First of all, this challenge is going to be language-specific. I haven't decided the languages yet, but right now I'm thinking around the lines of Java, C, C++, C# since these languages are very well known, unlike the other esoteric languages.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;You, the golfer, are to choose one golf club out from these [Lang1], [Lang2], ...,  [LangN]. You will team up with other players using the same golf club as you.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Note 2: Now there is supposed to be a table where the players can edit into this challenge (once I post it) to join a team. After ~1 week from the beginning of the sign-up, people will start competing in the challenge.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This will be a sort of golf relay, where every player must only complete 1 hole, no more, no less. But of course, each player may help teammates to complete the holes using the minimum number of shots (bytes) as possible. All golfers, of every team, will be playing using the same playing field, in this case &lt;code&gt;UTF-8&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There will be a list of challenges [see Note 3] to be completed by the team. Each team member must complete 1 challenge only. After a fixed amount of time (see Note 3), all team members must have complete their assigned challenges (see Note 4). I will sum of all the bytes used by each team to figure out the winning team (see Note 5)!&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Note 3: Either I will provide all the challenges, or each team member may give 1 challenge to the challenge pool. Challenges can range from anything like quines and &quot;Hello, World&quot; challenges, to more complicated ones, like solving advanced mathematical (pardon me) mumbo jumbo and outputting complex sequences. Every team completes all of these challenges (see Note 4). &lt;br&gt; The time that I have decided, so far, is to give the entire team 3 weeks (subject to change) to complete their challenges. &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Note 4: Each team member complete 1 challenge. However, if the team sizes are different, the team with the greatest number of members will have to complete &lt;em&gt;all&lt;/em&gt; of the challenges. The other teams only have to complete as many challenges as members, so that there will be one for every member.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Note 5: The scoring will be the number of bytes used by each team, summed up, and then divided by the number of challenges completed.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Answering&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here is the format to each answer:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#Language, challenge-number, byte-count in UTF-8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;for example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#Java, #34, &amp;lt;s&amp;gt;463&amp;lt;/s&amp;gt; &amp;lt;s&amp;gt;444&amp;lt;/s&amp;gt;  &amp;lt;s&amp;gt;442&amp;lt;/s&amp;gt; bytes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Summary&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To sum it up, here is the process that this challenge goes through:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;People who want to play must choose one team to be on, if they want to play.&lt;/li&gt;&#xA;&lt;li&gt;After registration is over, the games begin: each player is to choose &lt;em&gt;only&lt;/em&gt; one challenge and give a golfed answer. (Other players of the same team are allowed to help teammates)&lt;/li&gt;&#xA;&lt;li&gt;After some time, when all the challenges are attempted (one for every person, if people haven't answered in this time, they won't be counted towards the challenge), I will calculate the score of each team (using the total bytes used).&lt;/li&gt;&#xA;&lt;li&gt;Leaderboard is announced and the winning team walks away with all the glory!&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Comment any ways this challenge can be improved. My general idea is to implement a &lt;em&gt;team&lt;/em&gt; game, instead of the standard free-for-all.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="41805" LastActivityDate="2016-10-25T17:45:35.633" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10415" PostTypeId="2" ParentId="2140" CreationDate="2016-10-25T20:04:18.670" Score="1" Body="&lt;h1&gt;King of the Hill: Moon Rockets&lt;/h1&gt;&#xA;&lt;p&gt;This is a challenge where you code bots to compete in an arena. In this case, you code a rocket flying over the Moon. Your goal is to shoot down enemy rockets, while not running out of fuel and crashing into the Moon.&lt;/p&gt;&#xA;&lt;h3&gt;Environment&lt;/h3&gt;&#xA;&lt;p&gt;Unlike many KOTH challenges the playing field is continuous, rather than discrete. You are provided with variables for your position, velocity, and the direction you are facing. Each turn, you are given a list of all the rockets you can &amp;quot;see&amp;quot; (all rockets less than 10 units away). You return a turning speed, thrust and whether you want to fire missiles.&lt;/p&gt;&#xA;&lt;h3&gt;Arena&lt;/h3&gt;&#xA;&lt;p&gt;The arena wraps left-right. There is a floor; if you crash into it going faster than 4 m/s, you will explode. There is no ceiling, but you do have a limit of 10 fuel units. This can be refueled by landing on the floor going less than 4 m/s.&lt;/p&gt;&#xA;&lt;h3&gt;Missiles&lt;/h3&gt;&#xA;&lt;p&gt;Every turn, you have the option to fire missiles. Missiles go in the direction you are pointing, at a constant velocity 5 m/s faster than you were when you fired. If they come within a 1m radius of another rocket, they explode and destroy it.&lt;/p&gt;&#xA;&lt;h3&gt;Gravity&lt;/h3&gt;&#xA;&lt;p&gt;Gravity is a constant force of 1 downward. With a max thrust of 2, you can accelerate at an equal rate in the opposite direction.&lt;/p&gt;&#xA;&lt;p&gt;Pastebin for current controller code: &lt;a href=&quot;http://pastebin.com/FNyjrJfr&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://pastebin.com/FNyjrJfr&lt;/a&gt;&lt;br /&gt;&#xA;No tournament code is in place yet.&lt;/p&gt;&#xA;" OwnerUserId="45727" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-25T20:04:18.670" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="10417" PostTypeId="2" ParentId="7804" CreationDate="2016-10-26T01:15:20.637" Score="-9" Body="&lt;h1&gt;C Compiler&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Implement a basic C Compiler.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You do not need to implement the libraries. Compiler would output an object file containing a function, that would be linked with some libraries using GNU binutils &lt;code&gt;ld&lt;/code&gt; and run.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;No function calls, unions, structs, casts will be used in the test cases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test case:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;int test(int i, int j) {&#xA;  int x[10][20];&#xA;  int i, j = 0, s = 0;&#xA;  for(i = 0; i &amp;lt; 10; i++)&#xA;    while (j &amp;lt; 20)&#xA;    {&#xA;      j += 1;&#xA;      x[i][j] = i * j;&#xA;    }&#xA;  for(i = 0; i &amp;lt; 10; i++)&#xA;    while (j &amp;lt; 20) {&#xA;      s += x[1][j];&#xA;    }&#xA;  return s;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="53551" LastActivityDate="2016-10-26T01:15:20.637" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10418" PostTypeId="2" ParentId="2140" CreationDate="2016-10-26T01:16:08.563" Score="1" Body="&lt;h1&gt;C Compiler&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Implement a basic C Compiler.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You do not need to implement the libraries. Compiler would output an object file containing a function, that would be linked with some libraries using GNU binutils &lt;code&gt;ld&lt;/code&gt; and run.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;No function calls, unions, structs, casts will be used in the test cases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test case:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;int test(int i, int j) {&#xA;  int x[10][20];&#xA;  int s = i + j;&#xA;  i = 0;&#xA;  j = 0;&#xA;  for(i = 0; i &amp;lt; 10; i++)&#xA;    while (j &amp;lt; 20)&#xA;    {&#xA;      j += 1;&#xA;      x[i][j] = i * j;&#xA;    }&#xA;  for(i = 0; i &amp;lt; 10; i++)&#xA;    while (j &amp;lt; 20) {&#xA;      s += x[i][j];&#xA;    }&#xA;  return s;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="53551" LastEditorUserId="53551" LastEditDate="2016-10-26T01:22:23.323" LastActivityDate="2016-10-26T01:22:23.323" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10419" PostTypeId="1" AcceptedAnswerId="10420" CreationDate="2016-10-26T02:06:29.410" Score="16" ViewCount="330" Body="&lt;p&gt;Users with 3,500 rep (or 15,000 &lt;s&gt;if&lt;/s&gt; when we get a site-design) can &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/protect-questions&quot;&gt;protect challenges&lt;/a&gt;. This makes it so that users who have not earned 10 rep on the site can not answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a user with this privilege, I have no idea when it would be appropriate to use. This is because the idea of &quot;protecting questions&quot; makes perfect sense for a Q&amp;amp;A site with a popular question attracting non-answers or low-quality answers. But we're not a Q&amp;amp;A site! Nobody posts challenges here because they need help with a problem, only because they enjoy coming up with programming tasks and challenging other users to solve them. So pretty much all of the guidelines for when to protect don't make sense on our site. For example, the &lt;a href=&quot;http://blog.stackoverflow.com/2010/06/new-protected-question-status/&quot;&gt;original announcement&lt;/a&gt; says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;So, in the future, if you see a question that is attracting a lot of drive-by noise answers, please flag it for moderator attention. We'll turn on protection. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;But that never (or at least very rarely) happens here. I can find lots of old challenges that are protected, (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/53549/holy-hole-in-a-donut-batman&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1536/hello-world-0-0&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/67921/what-is-the-smallest-positive-base-10-integer-that-can-be-printed-by-a-program-s&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/85994/count-of-as-and-bs-must-be-equal-did-you-get-it-computer&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/95780/draw-an-asterisk-triangle&quot;&gt;5&lt;/a&gt;, etc.).&#xA;But &quot;drive-by noise&quot; is not the problem. The &quot;auto-protection&quot; is being triggered by self-deletions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So my question is pretty much when does it make sense to protect questions and prevent new-users from participating on these challenges, specifically in the context of our site? Should we &lt;em&gt;un-protect&lt;/em&gt; challenges that were automatically protected by community? Does it ever make sense to protect a challenge that is not attracting low-quality &quot;drive-by noise&quot;?&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-11-08T22:44:53.637" Title="When should challenges be protected?" Tags="|discussion|new-users|protected-questions|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10420" PostTypeId="2" ParentId="10419" CreationDate="2016-10-26T02:39:19.573" Score="17" Body="&lt;p&gt;Other SE sites have questions that already got a satisfying answer, and new answers will likely be &lt;em&gt;thank you&lt;/em&gt; posts or other kinds of noise. In these situation, protecting questions is the way to go. However, our challenges are never really over; protecting rarely ever makes sense on PPCG.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenges that usually wind up protected either manually or automatically have attracted a couple of bad answers, but this is usually because it's an entry level challenge that is appealing to newcomers. Protecting the challenge is the &lt;em&gt;last&lt;/em&gt; thing we should do in this situation.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Should we &lt;em&gt;un-protect&lt;/em&gt; challenges that were automatically protected by community?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I do that regularly. I've had to unprotect &lt;a href=&quot;https://codegolf.stackexchange.com/q/57617/12012&quot;&gt;Is this number a prime?&lt;/a&gt; three times so far. If I hadn't done it, the creator of &lt;a href=&quot;https://codegolf.stackexchange.com/a/58347/12012&quot;&gt;this answer&lt;/a&gt; (new user, hasn't written another post before or after that one) wouldn't have been able to post his stellar Hexagony primality tester which earned &lt;strong&gt;90&lt;/strong&gt; upvotes and a juicy &lt;strong&gt;+500&lt;/strong&gt; bounty. Yes, this is a rare gem, but it surely was worth the 22 answers that had to be dealt with without protection.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Does it ever make sense to protect a challenge that is not attracting low-quality &quot;drive-by noise&quot;?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Protecting challenges should be done rarely. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/47249/longest-common-substring&quot;&gt;Longest common substring in linear time&lt;/a&gt; earned its protection for being insanely difficult and attracting 11 invalid answers without a single valid one. At least in my opinion, the five ones you linked to didn't.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-11-08T22:44:53.637" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10421" PostTypeId="1" CreationDate="2016-10-26T06:12:01.710" Score="24" ViewCount="2829" Body="&lt;p&gt;&lt;strong&gt;We've got various answers strewn across meta that tell different stories:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the standard loopholes, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8094/20198&quot;&gt;we disallow answers that aren't programming languages&lt;/a&gt;.   This appears to be the most definitive answer of the lot. It has a vote count of &lt;code&gt;16/-8&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, on a question that asks &lt;em&gt;&quot;Should answers to fixed-output challenges be written in a programming language?&quot;&lt;/em&gt;, the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/3610/should-answers-to-fixed-output-challenges-be-written-in-a-programming-language&quot;&gt;top answer&lt;/a&gt; says that we shouldn't &lt;em&gt;&quot;generally disallow solutions written in non-programming languages&quot;&lt;/em&gt;.  It's vote count is currently &lt;code&gt;19/-5&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On yet &lt;em&gt;another&lt;/em&gt; post, we are asking what programming languages are, and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7518/20198&quot;&gt;xnor says that&lt;/a&gt; &lt;em&gt;&quot;For this purpose, I think that markup languages and limited output languages should be treated the same as programming languages&quot;&lt;/em&gt;.  Vote count of &lt;code&gt;18/-3&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On that same question, the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/45941&quot;&gt;leading answer&lt;/a&gt; provides a very solid definition of a programming language, which excludes languages which can't represent natural numbers or tuples, add two natual numbers, determine primality of a natural number, and operate on either a decision model (accept or reject an input based on rules in the program, a la Prolog) or a transformation model (transform an input into an output using the algorithm defined in the program, a la C) (vote count &lt;code&gt;+57/-4&lt;/code&gt;). A remark from this answer:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This definition excludes HQ9+. I don't consider this a problem either, for two reasons:&lt;/p&gt;&#xA;  &#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;&lt;p&gt;It was created as a joke rather than a language, and has ceased to be funny in the context of this site.&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;I think that every interesting problem which HQ9+ can &quot;solve&quot; has already been asked, so I don't think this will exclude any interesting answers in the future.&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Without discussing &lt;em&gt;what&lt;/em&gt; a programming language is, &lt;strong&gt;do we allow non-programming languages on &lt;em&gt;any&lt;/em&gt; challenge&lt;/strong&gt;  (assuming it can answer the challenge)?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regardless of whether the answer is Yes/No, can we also please edit/remove answers that conflict with the official view we hold?&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2018-01-18T13:41:02.867" Title="Do submissions have to be answered with a programming language?" Tags="|discussion|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10422" PostTypeId="2" ParentId="10421" CreationDate="2016-10-26T06:21:09.367" Score="-18" Body="&lt;h1&gt;No, answers in non-programming languages are not allowed&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This site is &lt;em&gt;Programming&lt;/em&gt; Puzzles and Code Golf. From Wikipedia:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Programming involves activities such as analysis, developing understanding, generating algorithms, verification of requirements of algorithms including their correctness and resources consumption, and implementation (commonly referred to as coding[1][2]) of algorithms in a target programming language. &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;sup&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Computer_programming&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://en.wikipedia.org/wiki/Computer_programming&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/45941&quot;&gt;We have a policy on what defines a programming language&lt;/a&gt;. Writing a &quot;program&quot; in a &quot;language&quot; that does not meet those requirements is not programming, and thus does not fit in the scope for &lt;em&gt;Programming&lt;/em&gt; Puzzles and Code Golf.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A challenge being solvable in a non-programming language is often a sign that the challenge has quality issues. We've already exhausted (or, at least, have mostly exhausted) the list of unique problems that are solvable in non-programming languages (outputting fixed text, for example) and where such a solution would be competitive. There is nothing more for such languages to contribute to the site.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2016-10-26T06:29:17.400" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="10423" PostTypeId="2" ParentId="2140" CreationDate="2016-10-26T06:35:35.227" Score="1" Body="&lt;h1&gt;HamSort a list of strings&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a list of strings, sort them in a manner such that the Hamming distance between each is minimal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Hamming distance between two strings of equal length is the number of positions where the corresponding characters do not match. For example, the Hamming distance between &lt;code&gt;apple&lt;/code&gt; and &lt;code&gt;ample&lt;/code&gt; is 1 since only the second characters of each do not match.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;apple&#xA;ample&#xA; *&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest code wins.&lt;/li&gt;&#xA;&lt;li&gt;Each string in the input list will have the same length and will consist of only the letters in the English alphabet. You may assume all to be either uppercase or lowercase.&lt;/li&gt;&#xA;&lt;li&gt;If there are multiple possible solutions, you may output any number of them.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;to be created&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="6710" LastActivityDate="2016-10-26T06:35:35.227" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10426" PostTypeId="2" ParentId="10421" CreationDate="2016-10-26T15:10:54.063" Score="44" Body="&lt;h1&gt;Answering in non-programming languages is allowed&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;The best challenges are written in terms of input and output.&lt;/strong&gt;  We avoid &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8079/20198&quot;&gt;Do X without Y&lt;/a&gt; challenges because the Y is usually &lt;em&gt;not&lt;/em&gt; defined in terms of input/output.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Disallowing non-programming languages is like disallowing arbitrary classes of languages&lt;/strong&gt;.  As long as they produce the right output with given input, they are fine.&lt;/p&gt;&#xA;&lt;p&gt;If we disallow non-programming languages, then &lt;strong&gt;people will simply create clones of the non-programming languages&lt;/strong&gt; that now fit our arbitrary &amp;quot;programming language&amp;quot; requirements.&lt;/p&gt;&#xA;&lt;p&gt;Now, to address some common concerns:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;em&gt;If you are non-programming language, you aren't programming&lt;/em&gt;.  Tell this to everybody who writes HTML or CSS&lt;sup&gt;1&lt;/sup&gt;.  Programming is all about problem solving.  &lt;strong&gt;The act of implementing a solution to a problem is programming.&lt;/strong&gt;  This is why we allow &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10287/are-non-programming-golf-puzzles-allowed&quot;&gt;non-programming golf challenges&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;If a non-programming language can solve a challenge, then that's a sign that the challenge is poor&lt;/em&gt;:  I frankly don't see how this matters.  If the challenge is poor, then downvote it/close it.  If the challenge is of good quality, then let people answer it however they want.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Non-programming languages answers are usually uninteresting&lt;/em&gt;.  Yeah, if your answer is simply the text from a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-challenge&lt;/a&gt;, that's uninteresting.  However, this problem isn't limited to non-programming languages.  &lt;code&gt;print &amp;quot;Hello world&amp;quot;&lt;/code&gt; and &lt;code&gt;&amp;quot;Hello world&amp;quot;&lt;/code&gt; are &lt;em&gt;equally&lt;/em&gt; uninteresting (and &lt;code&gt;H&lt;/code&gt; in HQ9+ is &lt;em&gt;more&lt;/em&gt; interesting than either of those).&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;We've run out of challenges for non-programming languages to be competitive in.&lt;/em&gt;  &lt;strong&gt;If that is true, then we simply won't see them on any more challenges&lt;/strong&gt;, problem solved. If they are answering a challenge without being competitive, we already have policies for that.  If they &lt;em&gt;are&lt;/em&gt; competitive, then let's allow them!&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;We have a serious double-standards problem here:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;We are disallowing arbitrary classes of languages.&lt;/li&gt;&#xA;&lt;li&gt;We are disallowing them on non-&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenges, where they have the &lt;em&gt;most&lt;/em&gt; chance of being interesting&lt;/li&gt;&#xA;&lt;li&gt;We are disallowing languages based off of whether they can solve arbitrary problems (like &amp;quot;primality checking&amp;quot;), not whether they can solve the problem at hand.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;This madness needs to stop.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt;I know, CSS &lt;em&gt;technically&lt;/em&gt; is a programming language, but 99% percent of the programmers aren't using it as a programming language.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-18T13:41:02.867" CommentCount="30" ContentLicense="CC BY-SA 3.0" />
  <row Id="10429" PostTypeId="2" ParentId="7804" CreationDate="2016-10-26T20:45:44.320" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7144/42963&quot;&gt;Crazy Librarian's Interesting Numbers Game&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/koth&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;koth&amp;#39;&quot; rel=&quot;tag&quot;&gt;koth&lt;/a&gt; card game between two bots. Interesting premise, got a couple of quick upvotes, and KOTHs are generally pretty well-received. I've just realized that I don't have the time to actually put a controller together and run a tourney, and that lack-of-time doesn't look to have changed in the past year. So ... donation time!&lt;/p&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2016-10-26T20:45:44.320" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10432" PostTypeId="1" CreationDate="2016-10-27T06:39:42.050" Score="2" ViewCount="91" Body="&lt;p&gt;My question is related to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9691/are-languages-targeting-fpgas-or-other-non-standard-non-sequential-computing-pla&quot;&gt;this one&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Are &lt;strong&gt;questions/challenges&lt;/strong&gt; explicitly targeting non-standard computing platforms such as FPGAs allowed?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If yes: Are they wanted or welcome here or are they undesired?&lt;/p&gt;&#xA;" OwnerUserId="49231" LastEditorDisplayName="user62131" LastEditDate="2017-04-25T00:55:28.960" LastActivityDate="2017-04-25T00:55:28.960" Title="Are questions targeting non-standard computer platforms allowed/wanted?" Tags="|discussion|rules|scope|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10433" PostTypeId="2" ParentId="10432" CreationDate="2016-10-27T08:46:38.763" Score="3" Body="&lt;h2&gt;Yes, they are allowed, and welcome if interesting&lt;/h2&gt;&#xA;&lt;p&gt;Some examples:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/11880/45941&quot;&gt;Tetris in Conway's Game of Life&lt;/a&gt;, one of our most well-received challenges, requires programming in Conway's Game of Life, which is certainly not a standard computing platform.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/44381/45941&quot;&gt;Automate saving the world&lt;/a&gt; (as Nathan mentioned in a comment) requires the use of old (pre-1978) languages.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-27T08:46:38.763" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10434" PostTypeId="2" ParentId="7447" CreationDate="2016-10-27T09:02:20.843" Score="4" Body="&lt;h2&gt;You may use any acceptable input method&lt;/h2&gt;&#xA;&lt;p&gt;This means that any input that is allowed by the challenge (either explicitly in the challenge specification or implicitly in our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/41859&quot;&gt;I/O method defaults list&lt;/a&gt; (so long as the challenge doesn't explicitly disallow it)) is fair game. It can be STDIN, but it doesn't necessarily have to be.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-27T09:02:20.843" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10436" PostTypeId="1" CreationDate="2016-10-27T13:56:39.363" Score="7" ViewCount="211" Body="&lt;p&gt;When writing an answer, people here usually start with stating in which language it's implemented. When C is concerned, there is the &quot;implicit int&quot; rule that was, as far as I know, removed in 2011. This rule is very important for golfing. For example, a function calculating a square of a number:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;s(a){return a*a;}           // with implicit int&#xA;int s(int a){return a*a;}   // without implicit int&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If I specify that my code is in C, and my code is newer than 2011, does it imply that I cannot use the implicit-int rule?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or, if I want to use the implicit-int rule, should I have to specify my language as &quot;C99&quot; or &quot;C89&quot; or &quot;gcc version 4.6.4&quot;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here, implicit-int is just an example. In general, what does &quot;C&quot; mean as a name of a programming language - &quot;most recent C version at the time of code's creation&quot; or &quot;some unspecified version&quot; or &quot;C89&quot;?&lt;/p&gt;&#xA;" OwnerUserId="25315" LastActivityDate="2016-10-28T03:00:56.957" Title="How to specify dialects of C?" Tags="|discussion|answers|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10438" PostTypeId="2" ParentId="10436" CreationDate="2016-10-27T15:15:02.473" Score="9" Body="&lt;p&gt;Yes, just stating C in your header is ambiguous. As long as your submission doesn't rely on undefined, unspecified, or implementation-defined behavior, doesn't use any GNU extensions, and doesn't depend on the machine's endianness, operating system, etc., just stating the standard (C89, C99, C11) should be plenty.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In all other cases (and there are a lot of them), that might be ambiguous as well. To counter that, you basically have two options.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Be specific about the conditions you tested your code in. Depending on your submission, that might require &lt;em&gt;a lot&lt;/em&gt; of information.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Include a link to an online interpreter. You can't argue with results.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="42545" LastEditDate="2016-10-28T03:00:56.957" LastActivityDate="2016-10-28T03:00:56.957" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10440" PostTypeId="2" ParentId="6918" CreationDate="2016-10-27T19:48:03.480" Score="4" Body="&lt;h1&gt;QBIC&lt;/h1&gt;&#xA;&lt;p&gt;QBIC is QBasic's Interpreter for Codegolf. I made it to bring QBasic into the code-golfing arena. Working on it is a ton of fun. It provides a short-hand for QBasic's expansive syntax and language constructs, and it adds a few tricks of its own.&lt;/p&gt;&#xA;&lt;p&gt;The project can be found here: &lt;a href=&quot;https://drive.google.com/drive/folders/0B0R1Jgqp8Gg4cVJCZkRkdEthZDQ?usp=sharing&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://drive.google.com/drive/folders/0B0R1Jgqp8Gg4cVJCZkRkdEthZDQ?usp=sharing&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;It is built and run entirely in / through QBasic. There is (as of yet) no web-interpreter or IDE.&lt;/p&gt;&#xA;&lt;p&gt;Samples of usage are here:&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/44680/showcase-your-language-one-vote-at-a-time/86385#86385&quot;&gt;Showcase of Languages&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;To get started with QBIC&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Download the project to your computer&lt;/li&gt;&#xA;&lt;li&gt;You probably need DOSBOX or similar to run it&lt;/li&gt;&#xA;&lt;li&gt;Edit &lt;code&gt;qbic-in.txt&lt;/code&gt; in &lt;s&gt;your favorite text editor&lt;/s&gt; a text editor that supports QBasic's ASCII table. I use Notepad++ with the Western European / Windows-OEM character set.&lt;/li&gt;&#xA;&lt;li&gt;Fire up QBasic, open and run &lt;code&gt;QBIC.BAS&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Enter command line parameters if necessary&lt;/li&gt;&#xA;&lt;li&gt;QBIC will now run the interpreted QBasic for you.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="44874" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-03T15:50:07.857" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10445" PostTypeId="2" ParentId="2140" CreationDate="2016-10-28T10:10:55.817" Score="1" Body="&lt;p&gt;&lt;strong&gt;How fast (slow) is your language?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a question both to test your coding skills but also to speed benchmark your favorite language.  The code snippet will make a table of the fastest code per language. It is related to previous &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; [challenge]&lt;a href=&quot;https://codegolf.stackexchange.com/questions/97060/calculate-the-permanent-as-quickly-as-possible&quot;&gt;1&lt;/a&gt; so you may find some of the code there a useful starting point.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is to write the fastest code possible for computing the &lt;a href=&quot;https://en.wikipedia.org/wiki/Permanent&quot; rel=&quot;nofollow noreferrer&quot;&gt;permanent of a matrix&lt;/a&gt; whose entries are floating point in the range -1 to 1. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The permanent of an &lt;code&gt;n&lt;/code&gt;-by-&lt;code&gt;n&lt;/code&gt; matrix &lt;code&gt;A&lt;/code&gt; = (&lt;code&gt;a&lt;/code&gt;&lt;sub&gt;&lt;code&gt;i,j&lt;/code&gt;&lt;/sub&gt;) is defined as&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/GOz7G.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/GOz7G.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here &lt;code&gt;S_n&lt;/code&gt; represents the set of all permutations of &lt;code&gt;[1, n]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an example (from the wiki):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Qr1OJ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Qr1OJ.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this question matrices are all square and will only have the floating point values in the range &lt;code&gt;-1&lt;/code&gt; to &lt;code&gt;1&lt;/code&gt; (excluding both ends).   I will construct all tests in such a way that the permanent is also in the range &lt;code&gt;-1&lt;/code&gt; to &lt;code&gt;1&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[-0.34389946 -0.811193  ]&#xA; [ 0.62778788 -0.09918764]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Permanent:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-0.47514655471&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[-0.34389946 -0.811193  ]&#xA;[ 0.4783581  -0.56636227]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Permanent:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-0.19326906099&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The task&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should write code that, given an &lt;code&gt;n&lt;/code&gt; by &lt;code&gt;n&lt;/code&gt; matrix, outputs its permanent.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As the output will never be bigger than 1 in absolute value you do not have to worry about overflow. However you do have to worry about numerical accuracy. All answers should be correct up to 8 decimal places.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Languages and libraries&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can use any available language and libraries you like but no pre-existing function to compute the permanent. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;More to be added..Work in progress&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user9206" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:27.967" LastActivityDate="2016-10-28T10:10:55.817" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10446" PostTypeId="2" ParentId="2140" CreationDate="2016-10-28T12:59:40.573" Score="5" Body="&lt;h1&gt;Draw me a Brick Wall!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'm drawing up a plan for my house extension - and I need a simple graphic for walls...&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to create a program, which takes an input of the wall's dimensions and draws a brick wall, in the style of the one below.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[__][__][__][__]&#xA;_][__][__][__][_&#xA;[__][__][__][__]&#xA;_][__][__][__][_&#xA;[__][__][__][__]&#xA;_][__][__][__][_&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Please notice that the rows alternate between beginning on a full brick (&lt;code&gt;[__]&lt;/code&gt;) and a half brick (&lt;code&gt;_]&lt;/code&gt;), to create a more realistic, stable wall.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input will be two integers, separated by a single comma, such as &lt;code&gt;4,3&lt;/code&gt; or &lt;code&gt;2,6&lt;/code&gt;. You can assume both integers are positive and larger than 0. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first integer specifies the width (in bricks) and the second specifies the height (in rows of bricks).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules / Notes&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code (in bytes) wins. However, don't feel like you have to beat everyone else to post your solution - I'd love to see your code!&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply, no reading from external files.&lt;/li&gt;&#xA;&lt;li&gt;You may optionally take the input with brackets/braces, for example &lt;code&gt;(4,3)&lt;/code&gt; or &lt;code&gt;[4,3]&lt;/code&gt; as long as you specify this in your answer.&lt;/li&gt;&#xA;&lt;li&gt;You should take the input from STDIN and output on STDOUT - if your language does not have these, please use the nearest equivalent.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;1,1&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[__]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;2,4&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[__][__]&#xA;_][__][_&#xA;[__][__]&#xA;_][__][_&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;5,10&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[__][__][__][__][__]&#xA;_][__][__][__][__][_&#xA;[__][__][__][__][__]&#xA;_][__][__][__][__][_&#xA;[__][__][__][__][__]&#xA;_][__][__][__][__][_&#xA;[__][__][__][__][__]&#xA;_][__][__][__][__][_&#xA;[__][__][__][__][__]&#xA;_][__][__][__][__][_&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Example: Python 3, 65 bytes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is somewhat golfed but still readable.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;w,h=eval(input())&#xA;for i in range(h):print(('[__]','_][_')[i%2]*w)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="60919" LastEditorUserId="60919" LastEditDate="2016-10-28T13:04:45.783" LastActivityDate="2016-10-28T13:04:45.783" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10447" PostTypeId="2" ParentId="2140" CreationDate="2016-10-28T14:05:10.483" Score="-2" Body="&lt;h1&gt;The only differences that matter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Cops' task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write two programs (or functions) A and B in the same version of the same programming language. They also should be called in the same way, meaning you can't write one program and one function. Each should accept an integer &lt;em&gt;n&lt;/em&gt; and output the term &lt;em&gt;n&lt;/em&gt; of a different integer sequence on OEIS.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should reveal a substring of each of A and B. Call them PA and PB. If one instance of PA is replaced by PB from A, it should become B. That means every byte except the reveal part in A and B should be exactly the same. You also reveal the lengths of A and B, and the two OEIS sequences. You don't reveal the programming language you use.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your answer is cracked if a robber finds two programs A' and B' that also print the elements in the two integer sequences respectively, where A' is no longer than A, and A' with one instance of PA replaced by PB is also B'. They don't have to be the same with your original A and B. And they don't have to be in the same programming language as yours, as long as they are in the same programming language themselves.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your answer isn't cracked 7 days after you post the answer, you can reveal your language and the original A and B and mark the answer safe, and it will be immune to future crack. Your answer can still be cracked if you don't do it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your score is max(len(A)+len(PA)*5, len(B)+len(PB)*5). The safe answer posted before a certain date with the minimum score wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if your two programs are &lt;code&gt;The first program&lt;/code&gt; and &lt;code&gt;The second program&lt;/code&gt;, you can reveal &lt;code&gt;first&lt;/code&gt; and &lt;code&gt;second&lt;/code&gt;. Your score is 18 + 6*5 = 48. And a robber can crack your answer by &lt;code&gt;&amp;lt;&amp;lt;first&amp;gt;&amp;gt;&lt;/code&gt; &lt;code&gt;&amp;lt;&amp;lt;second&amp;gt;&amp;gt;&lt;/code&gt; if they work. But you can also reveal &lt;code&gt;first pro&lt;/code&gt; and &lt;code&gt;second pro&lt;/code&gt; to prevent this crack.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please post your answer using this template:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# &amp;lt;length of PA&amp;gt; / &amp;lt;length of A&amp;gt; bytes, &amp;lt;length of PB&amp;gt; / &amp;lt;length of B&amp;gt; bytes, score &amp;lt;score&amp;gt;, &amp;lt;open / safe / cracked&amp;gt;&#xA;&#xA;Part of program A (outputing [&amp;lt;OEIS number&amp;gt;](&amp;lt;OEIS link&amp;gt;)):&#xA;&#xA;    &amp;lt;code of PA&amp;gt;&#xA;&#xA;Part of program B (outputing [&amp;lt;OEIS number&amp;gt;](&amp;lt;OEIS link&amp;gt;)):&#xA;&#xA;    &amp;lt;code of PB&amp;gt;&#xA;&#xA;&amp;lt;any other explanations&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Robbers' task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(To do.)&lt;/p&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2016-10-28T14:05:10.483" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="10455" PostTypeId="2" ParentId="2140" CreationDate="2016-10-29T20:41:15.353" Score="2" Body="&lt;h1&gt;Cryptographically secure favicon.&lt;/h1&gt;&#xA;&lt;p&gt;Create a cryptographically secure program which will take a string of up to 24 characters and create an image such that differing inputs can be &amp;quot;easily&amp;quot; distinguished visually. The goal being that the end image is visually appealling, and it is impossible to reverse engineer the string.&lt;/p&gt;&#xA;&lt;p&gt;&lt;b&gt;The challenge&lt;/b&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Create a program or function which takes an input string and output an image in any desired format.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Pick a secret password and post an image generated with that password along with your submission code.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Optionally post some sample inputs and outputs.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;OR&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Try to post someone else's password (or just any existing collision with that password).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;b&gt;The scoring&lt;/b&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Out of the posts whose password has not been cracked the post with the most upvotes after an arbitrary time period set sometime in the significant future.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Voters are encouraged to vote based on ingenuity and aesthetic appeal, but can vote for whatever posts they like.&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-01T23:38:20.140" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10457" PostTypeId="1" CreationDate="2016-10-30T02:12:36.207" Score="9" ViewCount="1159" Body="&lt;p&gt;I recently revisited the following classic challenge: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44680/showcase-your-language-one-vote-at-a-time&quot;&gt;&lt;strong&gt;Showcase your language one vote at a time&lt;/strong&gt;&lt;/a&gt;.  The gist of the challenge is as follows:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;An answer is a set of program snippets, each with a unique length.&lt;/li&gt;&#xA;&lt;li&gt;The maximum length and maximum number of snippets are given by the answer's current vote total.&lt;/li&gt;&#xA;&lt;li&gt;As an answer gains votes, it earns to right to contain more/longer snippets.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; the highest voted answer will win&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Also notably, there is no restriction on &lt;em&gt;what&lt;/em&gt; the code does. You are allowed and encouraged to post &quot;anything worth showcasing.&quot;  Additionally, answers are not required to contain any code at all (and indeed, they aren't allowed to until the answer has an upvote).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe the Language Showcase, despite its popularity, is not within the current scope of this site, and thus it should be &lt;strong&gt;locked&lt;/strong&gt; as &lt;em&gt;historically significant&lt;/em&gt;.  For reference, the historical significance lock reason is shown below:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This question exists because it has historical significance, but it is not considered a good, on-topic question for this site, so please do not use it as evidence that you can ask similar questions here. This question and its answers are frozen and cannot be changed.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In my opinion, if such a challenge were to be posted today, it would be closed.  This challenge places a length restriction on code, yet does not provide any goal as to what the code should do, other than to be interesting.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples of similar challenges which have been closed&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm referencing these early in the post because they are the basis for a lot of the existing meta literature.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35569/tweetable-mathematical-art&quot;&gt;Tweetable Mathematical Art&lt;/a&gt; [pop-con] challenge involved producing an interesting image with a code length restriction.  Similar to the Language Showcase, the goal was simply to make an interesting image. There was little restriction on what made an image valid.  This challenge has since been closed as too broad and locked as historically significant.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/69232/paint-the-mona-lisa-in-1kb-of-code&quot;&gt;Paint the Mona Lisa in 1kB of code&lt;/a&gt; [pop-con, deleted] involved producing an image with a limited amount of code.  The goal was &quot;visual resemblance of the output image to da Vinci's masterpiece.&quot;  This is a stronger &quot;goal&quot;  than either the Math Art or Language Showcase challenges, yet this challenge was closed as primarily opinion-based, and then deleted by a moderator.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Relevant meta posts&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8084/guidelines-for-posting-and-closing-popularity-contests&quot;&gt;Guidelines for posting and closing popularity contests&lt;/a&gt;&lt;/strong&gt; (12 Jan 2016)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This post was the first to introduce the term &quot;objective validity criterion&quot; as a requirement for all challenges. An objective validity criterion lays out the minimal requirements that each answer must meet. One important question is: does the Language Showcase have an acceptable validity criterion?  I believe that the simple requirement, that snippets be of a certain length, would set the bar way too low as far as validity criteria are concerned.  This opinion is backed up by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8091/2867&quot;&gt;this meta answer&lt;/a&gt;, which deals primarily with the Mona Lisa challenge.  This answer argues that the Mona Lisa challenge &lt;em&gt;does not have&lt;/em&gt; an objective validity criterion, and, even if you considered &quot;output an image&quot; as the criterion, then the challenge would still be considered &lt;strong&gt;too broad&lt;/strong&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8242/the-state-of-the-popularity-contest-tag&quot;&gt;The state of the popularity contest tag&lt;/a&gt;&lt;/strong&gt; (30 Jan 2016)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This this thread, the community decided to rewrite the pop-con tag description, leading to the meta post I describe below.  The accepted answer points out the importance of updating the tag info given the recent evolution of site guidelines, particularly regarding validity.  For reference, the Language Showcase challenge was asked an entire &lt;em&gt;year&lt;/em&gt; prior to this meta thread, as evidence that site guidelines have changed significantly between then and now.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8243/2867&quot;&gt;second-most-upvoted answer&lt;/a&gt; states that &quot;the specification needs to define what makes something worth upvoting&quot; and that &quot;popularity-contest does not make your challenge exempt from the standard rules of what is on-topic here.&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9078/updating-the-popularity-contest-tag-info-suggestions&quot;&gt;Updating the [popularity-contest] tag info: suggestions&lt;/a&gt;&lt;/strong&gt; (1 May 2016)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is the thread in which the community rewrote the pop-con &lt;a href=&quot;https://codegolf.stackexchange.com/tags/popularity-contest/info&quot;&gt;tag description&lt;/a&gt;.  A couple very relevant phrases are the following:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Things that MUST be included in a popularity contest&lt;/strong&gt;...&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;A clear specification of the goal that must be achieved. Questions like &quot;do (this) the most creative way&quot; should be avoided. Creativity should be the tool, not the goal.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;...&lt;strong&gt;Qualities which should be avoided in popularity contests&lt;/strong&gt;...&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Asking to solve a vaguely defined task in any way that the entrant wants (this will probably make your question be closed as too broad).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1514/we-need-to-take-an-official-stance-on-code-trolling&quot;&gt;We need to take an official stance on code trolling&lt;/a&gt;&lt;/strong&gt; (3 May 2014)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although code-trolling is just a subset of popularity-contests (a subset with its own, entirely unrelated issues), the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1517/2867&quot;&gt;accepted answer&lt;/a&gt; makes an important point that &lt;em&gt;popular doesn't imply on-topic&lt;/em&gt;.  I believe this is very relevant given the popularity of the Language Showcase, which currently sits at &lt;em&gt;+419/-12&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;...But just because it's popular that doesn't mean it's a good kind of question for this site. Even &quot;because it may generate an amazing answer from time to time&quot; doesn't mean it's a good kind of question for this site.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&quot;But this is a community-driven site! If it gets so many upvotes, the community wants it, and it should stay!&quot; Or should it? The StackExchange network prides itself in its high-quality content. In any case quality over quantity...&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;...There are both list-type and fun questions on StackOverflow which are massively popular and have amazing (and even useful) answers. Nevertheless, they are strongly discouraged and new similar questions will be violently closed and deleted.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Need for broader action?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This thread deals mainly with the Language Showcase challenge, although there are potentially several other challenges which fall into the same category. A large number of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot;&gt;existing pop-cons&lt;/a&gt; predate the above meta conversations by a year or more.  There does not appear to be much consistency in which challenges are open and which are closed.  For several of the same reasons outlined above, I believe many of these challenges are long-overdue for their closure.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="12012" LastEditDate="2017-04-25T02:14:21.387" LastActivityDate="2017-09-05T15:06:30.553" Title="Proposal to lock the Language Showcase as historically significant" Tags="|discussion|status-declined|specific-question|scope|close-reasons|" AnswerCount="9" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10458" PostTypeId="1" AcceptedAnswerId="10460" CreationDate="2016-10-30T02:54:43.413" Score="27" ViewCount="440" Body="&lt;p&gt;I am not very good at golfing by myself, but once in a while, I come across something small that I notice that could help. These are typically tricks I have found while looking at tips. Some users would not think of these, as some are very strange. I would like to comment, but I do not have 50 reputation yet. I know that editing is not a good idea here, so what should I do?&lt;/p&gt;&#xA;" OwnerUserId="59363" LastEditorUserId="66833" LastEditDate="2021-05-10T00:00:18.053" LastActivityDate="2021-05-10T00:00:18.053" Title="I Don't Have Enough Reputation to Comment" Tags="|support|comments|reputation|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="10459" PostTypeId="2" ParentId="10457" CreationDate="2016-10-30T03:02:41.150" Score="35" Body="&lt;h1&gt;Problems I see with locking the Showcase&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;We have practically nowhere else to post what we can post on the showcase.&lt;/strong&gt; You can always put them in the language's readme on GitHub, but I prefer the showcase because it's a ubiquitous place to post interesting snippets and tutorials. You can find a snippet about pretty much every language there, rather than having to look at the repo or google to find a tutorial for each language you want to learn about.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;We would lose a lot by not having a common place to explain and advocate for new languages.&lt;/strong&gt; The showcase currently serves as a place to really introduce languages in a very interesting way, revealing one feature at a time, and also to receive feedback on the language. An alternative to this would be to post a tutorial in the language's repo and make it easy to find; I believe this should always be done anyway.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I guess the bottom line is:&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The showcase is not an optimal solution, but it's the best we have for now.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I feel like the showcase currently stands at an awkward half-ground between what you could put in a readme and what's on-topic here in PPCG. But until we have a better solution for showcasing languages, I think it is best that we don't lock the showcase; it would cut off the best option we currently have.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is only my opinion; it is by no means definitive. Feel free to comment with your own opinion. Also, I'm writing this while tired, so please don't mind if it isn't very high quality.&lt;/p&gt;&#xA;" OwnerUserId="42545" LastEditorUserId="56656" LastEditDate="2017-09-05T15:06:30.553" LastActivityDate="2017-09-05T15:06:30.553" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10460" PostTypeId="2" ParentId="10458" CreationDate="2016-10-30T03:56:16.623" Score="21" Body="&lt;p&gt;Comments requiring reputation is an unfortunate situation, but it is (sadly) necessary to prevent comment spam. There is no manual override; the only way to post comments is to earn the 50 reputation points it requires.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are a few ways to achieve this. You might already be familiar with them, but I'll list them anyway.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Post answers. You might not be very good at golfing &lt;em&gt;right now&lt;/em&gt;, but we all weren't at some point. Just tackle a few easier challenges first, and you'll see that you improve quickly. Since every upvote earns you &lt;strong&gt;+10&lt;/strong&gt;, gathering 50 rep should be pretty quick.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Post challenges. For most of us, that's actually &lt;em&gt;harder&lt;/em&gt; than posting answers, but if you post the in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;the sandbox&lt;/a&gt; first, the community can help you to improve your draft.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Earn &lt;strong&gt;200&lt;/strong&gt; rep on any single SE site. Once you do, you'll get a &lt;strong&gt;+100&lt;/strong&gt; association bonus on all other sites.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-10-30T04:15:34.933" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10461" PostTypeId="2" ParentId="5243" CreationDate="2016-10-30T10:30:52.000" Score="6" Body="&lt;h1&gt;100 bounty: Minecraft redstone prime checker&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;What it says on the tin.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My version of a valid prime checker uses:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;levers as input (ON = 1, OFF = 0), representing a binary number&lt;/li&gt;&#xA;&lt;li&gt;redstone lamp as output (ON = prime, OFF = not prime)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I offer 100 reputation to make an expandable prime checker - that means that you can expand the prime checker in any direction infinitely, with minimal redstone wiring (connect the two &quot;modules&quot; together using redstone) and the prime checker still works.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are allowed to use any block except for structure blocks and command blocks.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do I need more clarification?&lt;/p&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="46076" LastEditDate="2019-04-14T01:03:36.843" LastActivityDate="2019-04-14T01:03:36.843" CommentCount="24" ContentLicense="CC BY-SA 4.0" />
  <row Id="10463" PostTypeId="2" ParentId="10457" CreationDate="2016-10-30T12:54:09.390" Score="-7" Body="&lt;h1&gt;It's not a grey area, it's off topic&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Much as I love the challenge, it doesn't meet our current definition of on topic. I also loved the tweetable mathematical art challenge (and got most of my rep from my 6 answers there...) but it's not on topic so it was closed. Similarly to that challenge, I think the language showcase should be preserved, but closed. One way to do this is with a historical lock. This seems easier than transferring the information elsewhere.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Once closed, there will be an incentive to set up an alternative&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There is clearly demand for a place to show off a language as the challenge is still active, so once this way is removed the community can focus on coming up with new, better suited ways to host showcases.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Demand to keep it open would require a scope change&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If there is community support for changing what is on topic and redefining our scope, then it could be possible to make this on topic. Personally I think that would be changing scope for the wrong reason, and I can't think of a way of changing the scope that would permit this challenge without also permitting lots of challenges we wouldn't want here.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2016-10-30T12:54:09.390" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10467" PostTypeId="2" ParentId="10457" CreationDate="2016-10-30T20:03:26.053" Score="22" Body="&lt;h1&gt;The showcase is part of a unique category of pop-cons that should be on topic.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Before I explain this, consider for a second &lt;em&gt;why&lt;/em&gt; we banished &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; and now are considering eliminating &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;: site quality. During the great code trolling apocalypse, Doorknob and Martin &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1514/we-need-to-take-an-official-stance-on-code-trolling&quot;&gt;made excellent arguments against it&lt;/a&gt; that more or less resolved around &quot;even though it's popular it spawns very low quality content.&quot; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since then, I feel a lot of issues resolving around popularity contests is the fear  that poor popularity contests will spawn poor loop-holey answers that nobody likes but nobody can really argue against. Although our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;standard loopholes&lt;/a&gt; have cut down a lot of the dumb answers like pulling things from the Internet, when you have subjective contests it's inevitable that people will post answers that don't actually do what the challenge author intended but can squeak by on technicalities and subjective arguments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69232/paint-the-mona-lisa-in-1kb-of-code&quot;&gt;Mona Lisa question.&lt;/a&gt; Here's a screenshot if you can't see deleted questions: &lt;a href=&quot;https://i.stack.imgur.com/VkAqJ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/VkAqJ.png&quot; alt=&quot;&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Per our rules on valid answers, an answer that does not demonstrate sufficient effort to solve the challenge is invalid. In the case of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, this is usually pretty easy. But let's take a look at the Mona Lisa spec and consider how one would categorize an answer as involving sufficient effort:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is under 1KB&lt;/li&gt;&#xA;&lt;li&gt;Doesn't violate any of our site meta rules&lt;/li&gt;&#xA;&lt;li&gt;Looks like Mona Lisa&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The last rule is obviously the problematic one -- we have no objective way of saying whether something is similar to the Mona Lisa, and therefore no objective way of ruling whether an answer is invalid. When the Mona Lisa question was first proposed, I argued that I could post an answer that outputs an apple and spend all day arguing that an apple is exactly the same as the Mona Lisa and we all live in the Matrix. Obviously this isn't desirable -- indeed, this is exactly what we want to avoid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now let's take a look at the showcase. Although there are currently some wording issues that make it seem more subjective than it is, this is all that is required to meet the spec sufficiently:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The language you choose meets our requirements for programming languages.&lt;/li&gt;&#xA;&lt;li&gt;For every upvote you get, you must have a code snippet of length n in that language where n is the number of upvotes at the time of the upvote.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is very minimalist but perfectly objective. The content of the snippet does not matter for whether an answer is valid, just that they're there. As a result, there isn't much room for bad answers: if they were posted, they could be swiftly deleted since they violate objective rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Granted, the showcase is an unusual challenge. But it is definitely not the only one that has this property:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/48476/programming-languages-through-the-years&quot;&gt;Programming Languages Through The Years&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/22144/images-with-all-colors&quot;&gt;Images with all colors&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/61115/make-your-language-unusable&quot;&gt;Make your language unusable&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/52426/play-a-song-for-me&quot;&gt;Play a song for me&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Compare these popcons to ones with subjective validity criteria such as:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/23250/what-no-error&quot;&gt;What? No error?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/37365/sort-a-list-and-write-some-english&quot;&gt;Sort a list and write some english!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/22533/weirdest-obfuscated-hello-world&quot;&gt;Weirdest obfuscated Hello World&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/21571/generate-an-understandable-sentence?page=2&amp;amp;tab=active#tab-top&quot;&gt;Generate an understandable sentence&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;(Note that I'm only really considering challenges from 2013/2014 onward -- anything before that was back when we didn't have enough of an audience for it to really matter.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The difference is very striking. The former have almost no such loop-holey answers, and most importantly any that were there were quickly deleted. The latter have lots of controversy and some answers that are pretty cheaty and just in general low quality. I could list a lot more sample questions but I think the point stands.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With minimalist objective validity, leaving the subjectivity for the voting, it's clear that we can have fun high-quality pop-cons with high-quality answers and an objective way to cull the low-quality answers. Since this is the only concern with pop-cons in the first place, it makes little sense to nuke these questions. If our rules don't allow us to have high-quality popcons like this, then something is wrong with the rules because they are hindering us, not helping us.&lt;/p&gt;&#xA;" OwnerUserId="45151" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-10-30T20:11:35.317" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10468" PostTypeId="2" ParentId="10457" CreationDate="2016-10-30T21:53:30.720" Score="-1" Body="&lt;h1&gt;Showcasing languages is not on-topic&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Here is Martin Ender's &lt;a href=&quot;https://codegolf.stackexchange.com/a/44683/20260&quot;&gt;now very-highly voted Mathematica post&lt;/a&gt; in its entirety as of when it was posted.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Mathematica&lt;/h1&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;Factoid&lt;/strong&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Mathematica can perform symbolic manipulation, so variables don't need&#xA;  values to work with them.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Note that it contains no code, as required by the rule &quot;Since all answers start off with 0 votes, answers will initially contain 0 code snippets.&quot; I wonder if it would have stayed that way if not for Martin's reputation with Mathematica preceding him, the language being well-known, and its being posted in the first 15 minutes. To get off the ground and allow interesting snippets, an answer must be voted on based on basically no content. This is a popularity contest in the &lt;a href=&quot;http://www.urbandictionary.com/define.php?term=Popularity%20Contest&quot; rel=&quot;nofollow noreferrer&quot;&gt;pejorative sense of the word&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More than being a do-anything-creative pop con, what makes the challenge out of scope is that it showcases &lt;em&gt;languages&lt;/em&gt;, not programming. Many of the snippets are standard features of the language, used exactly as intended. Some are just a built-in. The poster is not finding clever and unexpected uses, but simply listing cool things the language has to offer. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;A popular, many-featured, or unusual language will get more votes. Yes, a knowledgeable writer can do better with interesting snippets, but it's still not their coding skills that are being judged. The challenge doesn't require snippets to be golfed. Some are, to fit in the character limit, but others don't even bother cutting spaces once they have enough votes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;PPCG is about programming contests. People compete to write code that performs a task as efficiently or effectively as possible. Describing why languages are cool is not within the purpose of the site&lt;sup&gt;1&lt;/sup&gt;. It's out of scope not (just) due policies about pop cons and objectivity, but for the same reason that an &lt;a href=&quot;https://bicycles.stackexchange.com/&quot;&gt;SE about bicycles&lt;/a&gt; wouldn't take a question about cars. Or, more closely, a site hosting &lt;a href=&quot;https://en.wikipedia.org/wiki/Speedrun&quot; rel=&quot;nofollow noreferrer&quot;&gt;video game speedruns&lt;/a&gt; wouldn't take a &lt;a href=&quot;https://en.wikipedia.org/wiki/Let%27s_Play&quot; rel=&quot;nofollow noreferrer&quot;&gt;Let's Play&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The  whole spirit of &quot;Here's something I find cool! What do you find cool?&quot; feels out of place, like something out of a discussion forum thread. Keeping the showcase open wouldn't just require changing policies for pop cons, but fundamentally shifting what the site is about.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt;We have a place to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9619/advocate-languages-to-golf-in&quot;&gt;explain why a language is interesting to golf in&lt;/a&gt; that I posted, but it's on meta and specifically about golfing.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-10-31T00:59:15.677" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10470" PostTypeId="2" ParentId="10457" CreationDate="2016-10-31T02:33:58.290" Score="11" Body="&lt;h1&gt;No, don't close it, don't lock it&lt;/h1&gt;&#xA;&lt;p&gt;If it ain't broke, don't fix it.&lt;/p&gt;&#xA;&lt;p&gt;Unless there are severe quality issues, don't let bureaucratic mumbo-jumbo get in the way of a challenge that many people are clearly entertained by on a site that (I believe) is, at-the-core, about entertainment — about enjoying programming.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-10-31T02:33:58.290" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10471" PostTypeId="2" ParentId="2140" CreationDate="2016-10-31T11:01:52.453" Score="2" Body="&lt;h2&gt;Killer Sudoku Pro suggestions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Regular Sudoku is just about creating a enhanced Latin square and features no arithmetic on the digits 1-9 which are traditionally used.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Killer Sudoku goes further: the puzzle is tiled with polyominoes which are labelled with the sum of the cells which they cover. Additionally, no polyomino may cover two cells with the same digit, even though those digits would otherwise have been legal because they are not in the same row, column or square. It is therefore helpful to be aware of the inverse relationship: given a quantity of cells and a sum, calculate the possible values of the cells. This is also useful for solving Kakuro, which also features sums of distinct digits.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Killer Sudoku Pro goes one further step: rather than being the sum of the cells, any of the four basic operations may be used. The digits in the cells must then satisfy that basic operation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a target, operator and number of cells, I would like you write a program or function to output sets of distinct digits that satisfy the arithmetic expression. To minimise the necessary output I only want distinct combinations of digits, rather than all the potential permutations. (Some puzzle creators will not allow all the permutations for subtraction and division, so taking that into account would unnecessarily complicate the question.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples (example input format: target, operator, (number of cells); output format: answers &quot; or &quot;-separated, digits operator-separated in descending order):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;14+(4) -&amp;gt; 8+3+2+1 or 7+4+2+1 or 6+5+2+1 or 6+4+3+1 or 5+4+3+2&#xA;4-(3) -&amp;gt; 9-4-1 or 9-3-2 or 8-3-1 or 7-2-1&#xA;24×(3) -&amp;gt; 8×3×1 or 6×4×1 or 4×3×2&#xA;2÷(2) -&amp;gt; 8÷4 or 6÷3 or 4÷2 or 2÷1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I/O may be in any reasonable format as long as it is clear what is going on, so you can't encode the operations as specific integers, although using &lt;code&gt;*&lt;/code&gt; and &lt;code&gt;/&lt;/code&gt; or their Unicode code points instead is OK, and answers must use a different separator to the digits in each answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest solution in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2016-10-31T22:35:54.803" LastActivityDate="2016-10-31T22:35:54.803" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10473" PostTypeId="2" ParentId="10458" CreationDate="2016-10-31T15:44:16.393" Score="8" Body="&lt;p&gt;Any user with &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/chat&quot;&gt;20 rep&lt;/a&gt; on their parent site can suggest an improvement to an answer by pinging the OP &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;in chat&lt;/a&gt; and posting the suggestion there, or a link to a &lt;a href=&quot;http://pastebin.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;pastebin&lt;/a&gt; or something if it's long.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can also try to find the user's chat profile and invite them to some other room you're already in, or you can create a new room for a conversation between the two of you. &lt;a href=&quot;http://chat.stackexchange.com/users/&quot;&gt;http://chat.stackexchange.com/users/&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/EKZ71.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/EKZ71.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a temporary solution you can use until you gain enough reputation to post comments, because comments are usually preferred to chat messages unless that question or answer is being actively discussed in chat.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-10-31T21:36:42.500" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="10474" PostTypeId="2" ParentId="2140" CreationDate="2016-10-31T20:02:26.313" Score="-2" Body="&lt;h1&gt;Translation Polyglot&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to write a program which runs in two distinct programming languages to translate text.  Input should be translated between each language i.e. running your code in Code Language A translates from language 1 to 2, while running your code in Code Language B translates from language 2 to 1.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Code Languages must be distinct, two versions of the same language are disallowed&lt;/li&gt;&#xA;&lt;li&gt;Your code may be a full program or function&lt;/li&gt;&#xA;&lt;li&gt;Your code must take one string (or nearest equivalent) as input.  Input may be user input, function arguments, or other reasonable form&lt;/li&gt;&#xA;&lt;li&gt;Output may be a function return, output to STDOUT, or other reasonable form.  I do not care about trailing newlines or spaces&lt;/li&gt;&#xA;&lt;li&gt;Your code may translate from/to any language on the &lt;a href=&quot;https://en.wikipedia.org/wiki/List_of_official_languages&quot; rel=&quot;nofollow noreferrer&quot;&gt;official language list on Wikipedia&lt;/a&gt;. List the languages in your answer&lt;/li&gt;&#xA;&lt;li&gt;To accomplish your goal, you may use prebuilt language tanslation dictionaries such as the ones found &lt;a href=&quot;http://www.june29.com/idp/IDPfiles.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If you read your dictionary as an external file, only the code to read in the file (&lt;code&gt;f = open(&amp;quot;dictionary.txt&amp;quot;, 'r')&lt;/code&gt; in Python) counts towards your byte count. If your dictionary is hardcoded in, only count the bytes required to make it syntatically valid code (&lt;code&gt;s=&amp;quot;word1_in_english word1_in_french ...&amp;quot;&lt;/code&gt; would be 4 (&lt;code&gt;s=&amp;quot;&amp;quot;&lt;/code&gt;)). Essentially, do not include the dictionary as part of your submissions byte count.&lt;/li&gt;&#xA;&lt;li&gt;The dictionary you use &lt;strong&gt;must&lt;/strong&gt; have been created before this post (including sandbox time). You may not modifiy the dictionary in any way.&lt;/li&gt;&#xA;&lt;li&gt;Any built-in translation tools are disallowed. Built-in dictionaries are ok, but whatever code used to import them into your code must be included in the byte count&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is code golf, so shortest answer in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="30170" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-02T11:52:13.580" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10475" PostTypeId="2" ParentId="10457" CreationDate="2016-10-31T22:27:08.137" Score="5" Body="&lt;h3&gt;The showcase is too broad&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;As I've said in chat yesterday, I like the showcase, but it is too broad for our site:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;There are either too many possible answers, or good answers would be too long for this format.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Both apply here.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Without any tangible goal – apart from showing off what the language can do – the answers can do &lt;em&gt;literally anything&lt;/em&gt;. The only restriction is that the byte count is limited by the answer's score, but that doesn't really restrict &lt;em&gt;what&lt;/em&gt; can be done in an answer, only &lt;em&gt;when&lt;/em&gt; it can be done. Like with &lt;a href=&quot;https://codegolf.stackexchange.com/q/24747/12012&quot;&gt;Make the most useful program within 100 characters&lt;/a&gt;, which was closed &lt;em&gt;in 2014&lt;/em&gt; for the exact same reason, there are simply too many possible answers. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Good answers to a popularity contest are the popular ones (I assume), which right now stand at &lt;strong&gt;355&lt;/strong&gt;, &lt;strong&gt;164&lt;/strong&gt;, &lt;strong&gt;155&lt;/strong&gt;, &lt;strong&gt;139&lt;/strong&gt;, and &lt;strong&gt;121&lt;/strong&gt; votes for the top five. All these answers are allowed to contain more than one hundred snippets, pressing against the 30,000 character limit that applies to all answers on Stack Exchange. The format explicitly encourages adding more and more snippets to the same post, so yes, good answers are &lt;em&gt;too long&lt;/em&gt; for our format.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;That makes discussing whether the showcase fits our evolving vision for popularity contests and the associated and controversial hurdles (e.g., objective validity criteria) rather pointless, since it doesn't make the showcase any less broad.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Showcases are list questions&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;We're not the first site that ran into this specific problem: we've created a resource that, while certain useful and appreciated by many, doesn't really fit into what we do here. The showcase asks &lt;em&gt;what can your language do in &lt;strong&gt;x&lt;/strong&gt; or less bytes&lt;/em&gt;, making it a &lt;a href=&quot;https://meta.stackexchange.com/questions/tagged/list-questions&quot;&gt;list question&lt;/a&gt; (yes, the have their own tag on Mother Meta) and not really a programming contest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While not really fitting for the site, it would make no sense to destroy these resources. One kind of list question that (mostly) survived on Stack Overflow is the &lt;a href=&quot;https://stackoverflow.com/search?q=Definitive+Book+Guide+and+List+is%3Aq&quot;&gt;The Definitive &lt;strong&gt;X&lt;/strong&gt; Book Guide and List&lt;/a&gt; family, which have a &lt;em&gt;wiki lock&lt;/em&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This question's answers are a collaborative effort: if you see something that can be improved, just edit the answer to improve it! &lt;em&gt;No additional answers can be added here&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;While sending a clear message that this is not a typical thread and preventing the addition of comments, answers, and close/delete votes, the answers can still be edited and voted on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sadly, that doesn't solve &lt;em&gt;anything&lt;/em&gt; in this case, since the current answers are already too long. I'm also not sure if that would automatically make the question and its answers community wiki (which would be the only sensible option if we went this way).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The showcase should be locked&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is a textbook case for a &lt;a href=&quot;https://meta.stackexchange.com/a/126631/170332&quot;&gt;historical lock&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;The post is Off-Topic or Not Constructive, and&lt;/li&gt;&#xA;  &lt;li&gt;The post is stellar, in spite of its off-topic nature, and&lt;/li&gt;&#xA;  &lt;li&gt;There are a large number of views, upvotes and inbound links on the post, and&lt;/li&gt;&#xA;  &lt;li&gt;The post is contentious; e.g., it has been closed and reopened at least once, or deleted and undeleted at least once&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Check, check, check, and check.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I like the showcase, I &lt;em&gt;really&lt;/em&gt; do, and many of its answers are educational and entertaining, but making it a programming contest doesn't quite work and doesn't really benefit the showcase.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The &lt;em&gt;one vote at a time&lt;/em&gt; gamification means I can't add snippets when &lt;em&gt;I&lt;/em&gt; want to, which will result in less snippets being added in the long run. In addition, answers in verbose and non-popular languages may never get the required votes to start showing off interesting language features.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The specification discourages creating more than one answer in the same language, while the showcase, as reading material, would benefit from all users contributing to all languages they can contribute to.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There's no way to view a single answer at a time, and the answers are &lt;em&gt;huge&lt;/em&gt;; the first page alone weighs over five megabytes. Just trying to scroll past the accepted answer is painful on some devices.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The 30,000 character limit effectively prevents achieving the goal of showcasing as many language features as possible. While none of the answers seems to have hit the character limit yet, four of the top five also haven't been updated in the last 20 months.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;TL;DR&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The showcase is not a good fit for PPCG, and PPCG is not a good fit for the showcase. Let's lock the thread as &lt;em&gt;historically significant&lt;/em&gt; and explore alternative ways of showcasing languages.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2016-10-31T22:27:08.137" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10476" PostTypeId="1" CreationDate="2016-11-01T00:26:23.933" Score="8" ViewCount="183" Body="&lt;p&gt;I'm thinking of creating a challenge involving attacking a cryptographic function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge would be to take the specified function which would ostensibly offer &lt;code&gt;XXX&lt;/code&gt; (&lt;code&gt;&amp;gt;2^40&lt;/code&gt;?) bits of security and exploit (intentional) flaws in the crypt in order to bring the security into a reasonable exhaustible range (~&lt;code&gt;2^24&lt;/code&gt;). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner would be the first person to report the/a correct answer. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, it might be something like:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Ciphertext was generated by XORing the Plaintext with random bytes generated using the PRNG specified here: &lt;code&gt;[full spec here]&lt;/code&gt;. Given the ciphertext, recover the plaintext&lt;/em&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The intention is that you would attack the PRNG, using knowledge of the spec to reduce the search space for the initial state of the PRNG. With that sufficiently reduced space, an exhaust could be run over the initial state, generating potential keystreams which could then be XORed with the cipher in order to recover the plaintext. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The difficult part would be developing the attack on the PRNG, but a successful attack would require a non trivial amount of programming.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm curious whether:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;this would be on topic&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;there might be any issues with this type of challenge that I haven't thought of, for example does a more powerful computer give too much of an advantage for this type of challenge?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Should it be a requirement that the code used to perform the exhaust be included?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Despite the fact that there would be an undeniable first winner, my intent would be to leave the challenge open indefinitely because I'm sure people will come up with better attacks than I intended, and should be rewarded for doing so. &lt;/p&gt;&#xA;" OwnerUserId="45459" LastActivityDate="2016-11-01T03:33:35.833" Title="Cryptography Attack: On Topic?" Tags="|discussion|" AnswerCount="1" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="10477" PostTypeId="2" ParentId="10476" CreationDate="2016-11-01T03:25:47.433" Score="10" Body="&lt;p&gt;Let me start by saying that I like the idea. Cryptography has always fascinated me. I have even posted a kind of cryptanalysis challenge myself – &lt;a href=&quot;https://codegolf.stackexchange.com/questions/51069/cryptographic-hash-golf-robbers&quot;&gt;Cryptographic hash golf (robbers)&lt;/a&gt; – and personally would welcome the idea of having more challenges of this kind.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Specifics aside (e.g., breaking a non-trivial steam cipher &lt;em&gt;and&lt;/em&gt; performing frequency analysis as parts of the same task might be a bit too much), I think this would make an interesting code challenge if designed as one.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I'm curious whether [...] this would be on topic&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In the format you proposed... maybe. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5585/12012&quot;&gt;Are pure programming puzzles on topic?&lt;/a&gt; is still trying to sort this out, and I personally agree with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5621/12012&quot;&gt;this answer&lt;/a&gt; (not the one with the most votes) in that programming puzzles should have an objective winning criterion other than posting time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Posting time alone means that the contest is really over as soon as somebody posts a working solution, which is unfortunate for several reasons: it gives you no incentive (or possibility, really) to improve on your first working version, there's really no reason to keep working on your partial solution as soon as someone beats you to the punch, and the first answer doesn't even have to be &lt;em&gt;good&lt;/em&gt; to finish the contest; the cat is already out of the bag. Granted , &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; share these issues, so none of them is a deal breaker.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Having said all of the above, it's difficult to predict if the specific challenge you propose would remain open. The community seems divided on the issue, and it takes only five close voters to put a question on hold.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I'm curious whether [...] there might be any issues with this type of challenge that I haven't thought of, for example does a more powerful computer give too much of an advantage for this type of challenge?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Without having more details regarding the strength of the stream cipher and how much is known about the plaintext, it's hard to tell, but if a successful break is – as you mentioned – possible by reducing the effective strength of the stream cipher, the part that is left might put users with better hardware or deeper pockets at an advantage.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Should it be a requirement that the code used to perform the exhaust be included?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9590/12012&quot;&gt;Objective computational challenges without &amp;quot;code&amp;quot;&lt;/a&gt; discusses this. The community seems to be leaning towards &lt;strong&gt;no&lt;/strong&gt;, but as you'll be able to tell from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9661/12012&quot;&gt;my answer&lt;/a&gt;, I don't really agree. This site is about &lt;em&gt;programming&lt;/em&gt; contests, so – in my personal opinion – answers should contain code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this particular case, an answer that contains nothing more than the correct plaintext would close the contest without adding valuable information of any kind to the site. Requiring the actual code that was used mitigates this and has no downsides I can think of.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;A different approach&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is just an idea and might result in a better, worse, or simply different challenge type, but I think the underlying concept could make a nice &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the challenge could include a few test vectors, and answers would submit solvers that the challenge author or a trusted third party runs with undisclosed ciphertexts. This would mix cryptanalysis (finding vulnerabilities in the stream cipher) with coding (making the exhaustive search quick), without any potential scope issues (that I'm aware of, anyway), without unfair advantages to users with slow computers, and without the one-answer-and-this-is-over situation.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-11-01T03:33:35.833" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10480" PostTypeId="1" AcceptedAnswerId="10482" CreationDate="2016-11-01T17:18:53.487" Score="2" ViewCount="183" Body="&lt;p&gt;If the shortest code wins, at least when there is the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; tag, why is the list ordered using votes and not code size?&lt;/p&gt;&#xA;" OwnerDisplayName="user58988" LastEditorDisplayName="user45941" LastEditDate="2016-11-02T03:53:42.920" LastActivityDate="2016-11-02T03:53:42.920" Title="Why aren't answers ordered by byte count for code golf challenges?" Tags="|discussion|answers|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10481" PostTypeId="2" ParentId="2140" CreationDate="2016-11-01T17:29:17.327" Score="-3" Body="&lt;h1&gt;Best n out of 2n - 1&lt;/h1&gt;&#xA;&lt;h3&gt;Challenge:&lt;/h3&gt;&#xA;&lt;p&gt;This one should be relatively simple.  Output this exact text:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Best [n] out of [2n - 1].&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;given n as an input.&lt;/p&gt;&#xA;&lt;h3&gt;Input:&lt;/h3&gt;&#xA;&lt;p&gt;Just the integer n, can be from stdin or as an argument.  n will always be greater than 0.&lt;/p&gt;&#xA;&lt;h3&gt;Output:&lt;/h3&gt;&#xA;&lt;p&gt;The exact text above.  Trailing spaces/newlines are allowed.&lt;/p&gt;&#xA;&lt;h3&gt;Rules:&lt;/h3&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins.  Standard loopholes are forbidden.&lt;/p&gt;&#xA;&lt;h3&gt;Meta:&lt;/h3&gt;&#xA;&lt;p&gt;Is this too simple?  What other tags should be included, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="59170" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-01T17:29:17.327" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10482" PostTypeId="2" ParentId="10480" CreationDate="2016-11-01T17:32:01.900" Score="5" Body="&lt;p&gt;Because we are a challenge site trapped in the body of a Q&amp;amp;A site. This site is based off of the same standards that &lt;a href=&quot;http://stackoverflow.com&quot;&gt;stackoverflow&lt;/a&gt; is based on. On a site like SO, where users ask questions to get answers, it makes sense to order answers by votes. That way, the answers that the community deems most helpful are displayed first and &lt;a href=&quot;https://stackoverflow.blog/2011/06/optimizing-for-pearls-not-sand/&quot;&gt;rise to the top.&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On a challenge site like ours, this doesn't make sense. Unfortunately, there is not any good fix right now, although we have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8358/31716&quot;&gt;asked for this feature&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the meantime, I recommend sorting answers by &quot;active&quot;, that way you can see the answers that people are still working on and improving, and get a good picture of answers as they come in.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-11-01T17:32:01.900" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10483" PostTypeId="2" ParentId="10480" CreationDate="2016-11-01T17:48:56.207" Score="18" Body="&lt;p&gt;Sorting by code size has its own issues. Mainly, that we usually try to encourage people to golf in their choice of language, and not necessarily in golfing languages. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sorting this way would give an even bigger advantage to golfing languages than they already have, since higher placed entries usually get more views and votes. It's hard to reconcile the top answers to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10127/14215&quot;&gt;&quot;How can we help users who are put off by the use of golfing languages?&quot;&lt;/a&gt; with a sorting method designed to explicitly feature golfing languages.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2016-11-01T17:48:56.207" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10484" PostTypeId="2" ParentId="2140" CreationDate="2016-11-01T17:54:43.580" Score="1" Body="&lt;h1&gt;Modular Reverse Recursion Sequence&lt;/h1&gt;&#xA;&lt;p&gt;Given any number &lt;code&gt;n &amp;gt; 0&lt;/code&gt;, let &lt;code&gt;r&lt;/code&gt; represent the reverse of the number &lt;code&gt;n&lt;/code&gt;. Iterate until the final result is zero, passing the result of each iteration back into the function using recursion or a methodology of your choice by performing the below operation:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;code&gt;r &amp;gt; n&lt;/code&gt; for that iteration the result is &lt;code&gt;r % n&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;n &amp;gt; r&lt;/code&gt; for that iteration the result is &lt;code&gt;n % r&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;n % r = 0&lt;/code&gt; or &lt;code&gt;r % n = 0&lt;/code&gt;, you terminate iteration.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Take the intermediate result of each execution and store them in an array for the final answer.&lt;/p&gt;&#xA;&lt;p&gt;Lets walk through an example where &lt;code&gt;n=32452345&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;54325423 % 32452345 = 21873078 # r &amp;gt; n, uses r % n&#xA;87037812 % 21873078 = 21418578 # r &amp;gt; n, uses r % n&#xA;87581412 % 21418578 = 1907100  # r &amp;gt; n, uses r % n&#xA;1907100 % 17091 = 9999         # n &amp;gt; r, uses n % r&#xA;9999 % 9999 = 0                # r % n = n % r = 0, terminated&#xA;&#xA;Result: [21873078, 21418578, 1907100, 9999]     &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Another example &lt;code&gt;n=12345678&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;87654321 % 12345678 = 1234575 # r &amp;gt; n, uses r % n&#xA;5754321 % 1234575 = 816021    # r &amp;gt; n, uses r % n&#xA;816021 % 120618 = 92313       # n &amp;gt; r, uses n % r&#xA;92313 % 31329 = 29655         # n &amp;gt; r, uses n % r&#xA;55692 % 29655 = 26037         # r &amp;gt; n, uses r % n&#xA;73062 % 26037 = 20988         # r &amp;gt; n, uses r % n&#xA;88902 % 20988 = 4950          # r &amp;gt; n, uses r % n&#xA;4950 % 594 = 198              # n &amp;gt; r, uses n % r&#xA;891 % 198 = 99                # r &amp;gt; n, uses r % n&#xA;99 % 99 = 0                   # r % n = n % r = 0, terminated&#xA;&#xA;Result: [1234575, 816021, 92313, 29655, 26037, 20988, 4950, 198, 99]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;A final example &lt;code&gt;n=11000&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;11000 % 11 = 0 # n % r = 0, terminated&#xA;&#xA;Result: []&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-02T04:10:31.427" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10487" PostTypeId="1" AcceptedAnswerId="10490" CreationDate="2016-11-02T03:18:10.647" Score="11" ViewCount="1759" Body="&lt;p&gt;So last time, I was hanging on &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;codegolf&lt;/a&gt;, and came across the question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/97713/print-the-digital-root&quot;&gt;Print the digital root&lt;/a&gt;, where one guy replied &lt;a href=&quot;https://codegolf.stackexchange.com/a/97717/61356&quot;&gt;here&lt;/a&gt; with a one-byte code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, it takes advantages of the built-in and standard functions of the language, so it seems okay to end up with very short codes, in Jelly, Pyth, or such golfing languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But where is this gonna end?!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm actually pretty enthusiast with esoteric languages and such stuff, but if golfing's purpose is to find the shortest code possible, why couldn't I develop my own language, with my own compiler, where I would add one-byte functions every time a new golfing question is asked?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance, since &lt;code&gt;s&lt;/code&gt; in Pyke means &quot;Print the digital root of the input&quot;, what prevents me from creating a built-in function called &lt;code&gt;そ&lt;/code&gt; that means &quot;Spell out the input numbers in German&quot; (although it might sound a bit Intercal-ish)?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Besides, I was scrolling the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default?page=1&amp;amp;tab=votes#tab-top&quot;&gt;loopholes&lt;/a&gt; page when I came upon the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1071/61356&quot;&gt;Using a made-up language specifically designed for the challenge&lt;/a&gt; rule (whose title must be explicit enough). But if we do accept golfing languages, that are actually &lt;em&gt;designed&lt;/em&gt; for golfing, this rule becomes null and void, doesn't it?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am looking for something like a rule that says (though I doubt it can be clearly defined) where golfing begins and where it stops. Any thoughts?&lt;/p&gt;&#xA;" OwnerUserId="61356" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-11-07T14:39:23.767" Title="Codegolf rules and boundaries" Tags="|discussion|code-golf|rules|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10489" PostTypeId="2" ParentId="10487" CreationDate="2016-11-02T03:49:11.930" Score="2" Body="&lt;p&gt;So long as the language you want to use &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5800/45941&quot;&gt;existed prior to the posting of the challenge&lt;/a&gt; (either on the main site, in the Sandbox, or in chat), &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1071/61356&quot;&gt;wasn't specifically made for the challenge&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8094/45941&quot;&gt;is a programming language&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/45941&quot;&gt;our definition&lt;/a&gt; (though there is some &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10421/45941&quot;&gt;contention&lt;/a&gt; currently on that rule), it's fair game. Since &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7833/45941&quot;&gt;we define languages by implementation, not specification&lt;/a&gt;, a working implementation of a language must exist in order for it to be used.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2016-11-02T03:49:11.930" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10490" PostTypeId="2" ParentId="10487" CreationDate="2016-11-02T04:12:51.460" Score="15" Body="&lt;p&gt;Answers that use a language (or a feature thereof) that postdates the challenge should be labeled non-competing. From &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4870/12012&quot;&gt;Can I ever answer with a language invented after the challenge was posted?&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;These answers can still be posted &lt;strong&gt;but should not be considered as a candidate for the accepted answer&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;But if a language is specifically designed to have a clear advantage for the question, it should not be considered as an answer and should be deleted. This case would ideally be clearly distinguishable.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;That means &lt;em&gt;add[ing] one-byte functions every time a new golfing question is asked&lt;/em&gt; is out of the window. If you add a built-in with the intention of solving a challenge in one step, your submission violates a site-wide policy and is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990/12012&quot;&gt;subject to deletion&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Also, code golf competitions are scored in bytes, so unless your language uses a custom code page, the answer &lt;code&gt;そ&lt;/code&gt; will be at least two bytes long.&lt;/p&gt;&#xA;&lt;p&gt;Regarding a broader issue, yes, some recreational programming languages have a few Easter eggs: printing &lt;strong&gt;Hello, World!&lt;/strong&gt;, &lt;strong&gt;FizzBuzz&lt;/strong&gt;, &lt;strong&gt;99 bottles of beer&lt;/strong&gt;, or an ASCII art goat; perform a rickroll; generate the RATS sequence; etc. That means they'll be able to solve some challenges using only one byte (or even zero bytes), but it also means they've wasted a one-byte token on something that will be useful at most in a single challenge. That's their loss.&lt;/p&gt;&#xA;&lt;p&gt;Note that production languages also have their Easter eggs. Python, e.g., has &lt;code&gt;import __hello__&lt;/code&gt;, &lt;code&gt;import this&lt;/code&gt;, &lt;code&gt;import antigravity&lt;/code&gt;, &lt;code&gt;from __future__ import braces&lt;/code&gt;, and probably others. If a challenge asks to print The Zen of Python, Python will most likely win.&lt;/p&gt;&#xA;&lt;p&gt;Finally, it usually makes no sense to compare different languages, especially if production languages are involved. The designers (and users) of golfing languages definitely get a kick out of outscoring other golfing languages (at least &lt;em&gt;I&lt;/em&gt; do), but comparing Python with a golfing language is just as pointless as comparing it with Java or APL.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-07T14:39:23.767" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10492" PostTypeId="2" ParentId="10457" CreationDate="2016-11-02T08:29:53.970" Score="15" Body="&lt;h1&gt;Closing this challenge is pointless even if out-of-scope&lt;/h1&gt;&#xA;&lt;h3&gt;This challenge is still opened and…&lt;/h3&gt;&#xA;&lt;p&gt;…it still receives interesting answers showcasing new languages. I still receive upvotes semi-often on that challenge suggesting that people are still interested in seeing languages snippets and explanations.&lt;/p&gt;&#xA;&lt;h3&gt;What closing this challenge would do:&lt;/h3&gt;&#xA;&lt;p&gt;Absolutely nothing beside stopping new languages from being showcased. I haven't seen any recent new answers of very low quality to that challenge (though I'm sure there are some at times).&lt;/p&gt;&#xA;&lt;p&gt;The only thing closing this challenge would do is satisfy the few people who feel like this challenge is out-of-scope.&lt;/p&gt;&#xA;&lt;p&gt;But as Mego said in a comment, there is nothing wrong with having out-of-scope challenges kept open if they are liked, attract answers that still interest people of the site, and don't attract much low quality content, like this challenge.&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-02T08:29:53.970" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10501" PostTypeId="2" ParentId="6918" CreationDate="2016-11-03T21:30:45.000" Score="1" Body="&lt;h2&gt;&lt;a href=&quot;https://github.com/tuxcrafting/jlisp&quot; rel=&quot;nofollow noreferrer&quot;&gt;JLisp&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;JLisp is a Lisp dialect I created the first day of November.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's a basic Lisp dialect, probably TC and with bad support of scoping.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hello world:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(write-line &quot;Hello, World!&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="53745" LastActivityDate="2016-11-03T21:30:45.000" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10502" PostTypeId="1" CreationDate="2016-11-04T01:05:52.883" Score="5" ViewCount="99" Body="&lt;p&gt;I have seen a lot of questions flagged as duplicated and so blocked recently, some from established members and some from new members. In several cases these have not been exact duplicates but have had some (sometimes small) difference that does not make them a direct duplicate. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;While I am totally in favour of the Sandbox, is it right to directly block questions from new members as duplicates when there are so many discussions going on as to how we can encourage more people to join us? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In fact, does it actually matter if a question is a duplicate? Languages have changed and developed, new members have joined, if a question has been asked (maybe years before) there may be new valid answers to see.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Opinions appreciated.&lt;/p&gt;&#xA;" OwnerUserId="56555" LastEditorUserId="31716" LastEditDate="2016-11-04T01:14:31.980" LastActivityDate="2016-11-04T01:14:31.980" Title="Should we be flagging so many questions as duplicates?" Tags="|discussion|duplicates|" AnswerCount="0" CommentCount="10" ClosedDate="2016-11-04T07:31:33.707" ContentLicense="CC BY-SA 3.0" />
  <row Id="10503" PostTypeId="2" ParentId="2140" CreationDate="2016-11-04T01:47:30.350" Score="0" Body="&lt;h1&gt;Peano's quine&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to write two programs in the same programming language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first program is simply a quine, in the following called &quot;zero quine&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The second program, called succesdor program, is a program that gets a program text as input, and outputs another program text, according to the following rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The input text is either the zero quine, or code that is (or could be) the output of another run of the successor program.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The output is again a quine in the same language.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The zero quine, generated quines and successor program fulfil Peano's axioms. In particular:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The successor function does never output the zero quine, no matter what the input is.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The successor function produces different output when acting on different valid input.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In other words, the zero quine and the successor function together allow to generate an unbounded number of quines, one for each natural number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The score is the total number of bytes of the zero quine and the successor program together.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that while there are several challenges that have programs returning longer versions of itself when run, I didn't find any that has a program transforming a proper quine into another proper quine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="3681" LastActivityDate="2016-11-04T01:47:30.350" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10510" PostTypeId="2" ParentId="2140" CreationDate="2016-11-05T10:35:45.903" Score="1" Body="&lt;h3&gt;Simplified maze-solver&lt;/h3&gt;&#xA;&lt;p&gt;A spin-off from this question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2225/textual-maze-solver&quot;&gt;Textual maze solver&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Write a program, that will take an bunch of 0's and 1's as it's input (see below), and a half-solved maze as it's output. The program should take 1's as walls and 0's as corridors. The output should should show &lt;code&gt;99&lt;/code&gt;'s as walls and a number as the distance from the start of the maze. The maze should have no real entrance/exit; instead, the entrance is the square in the 2nd column of the 2nd row.&lt;/p&gt;&#xA;&lt;p&gt;Examples (allowed cases):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input               Output&#xA;&#xA;1 1 1 1 1 1         99 99 99 99 99 99&#xA;1 0 0 1 0 1         99 00 01 99 05 99&#xA;1 1 0 0 0 1   --&amp;gt;   99 99 02 03 04 99&#xA;1 0 1 1 0 1         99 10 99 99 05 99&#xA;1 0 0 0 0 1         99 09 08 07 06 99&#xA;1 1 1 1 1 1         99 99 99 99 99 99 &#xA;&#xA;{{1, 1, 1, 1, 1, 1, 1, 1, 1},         99 99 99 99 99 99 99 99 99&#xA; {1, 0, 0, 0, 1, 0, 0, 0, 1},         99 0  1  2  99 16 17 18 99&#xA; {1, 1, 1, 0, 1, 0, 1, 0, 1},         99 99 99 3  99 15 99 19 99&#xA; {1, 0, 0, 0, 1, 0, 1, 0, 1},   --&amp;gt;   99 6  5  4  99 14 99 20 99&#xA; {1, 0, 1, 1, 1, 0, 1, 0, 1},         99 7  99 99 99 13 99 21 99&#xA; {1, 0, 0, 0, 0, 0, 1, 0, 1},         99 8  9  10 11 12 99 22 99&#xA; {1, 1, 1, 1, 1, 1, 1, 1, 1}}         99 99 99 99 99 99 99 99 99&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Examples (not allowed outputs and inputs):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;11111 10101 10101 10001 11111  --&amp;gt; 9999999999 9900990699 9901990599 9902030499 9999999999&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Notes:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;as seen above, the input and output must be bunch of numbers separated by whitespaces, commas, full stops, newlines, parenthesis (and so on), and mustn't be in a single row&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;you can output &lt;code&gt;01&lt;/code&gt; instead of &lt;code&gt;1&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;cases where the distance is over 99 don't need to be covered&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;the program doesn't need to solve the maze, just to find the distance from the start&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;two fields connected diagonally aren't next to each other&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;it's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins!&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/maze&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;maze&amp;#39;&quot; rel=&quot;tag&quot;&gt;maze&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="60199" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-05T10:35:45.903" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10513" PostTypeId="1" AcceptedAnswerId="10514" CreationDate="2016-11-05T21:12:28.530" Score="-9" ViewCount="262" Body="&lt;p&gt;I could not figure out how to change my keyboard layout from Workman (which I have been trying to learning) back to QWERTY. Google found no results for my query (it usually automatically corrects wrong layouts) and I resorted to asking in chat. Sadly I was flagged many times and my chat account was suspended.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/33336956#33336956&quot;&gt;http://chat.stackexchange.com/transcript/message/33336956#33336956&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As you can see, I was just confused. Is there a way to reverse this chat suspension?&lt;/p&gt;&#xA;" OwnerUserId="53551" LastEditorUserId="53551" LastEditDate="2017-07-18T04:37:31.093" LastActivityDate="2017-07-18T04:37:31.093" Title="chat suspension?" Tags="|support|chat|" AnswerCount="1" CommentCount="8" ClosedDate="2017-07-18T11:07:17.223" ContentLicense="CC BY-SA 3.0" />
  <row Id="10514" PostTypeId="2" ParentId="10513" CreationDate="2016-11-05T21:16:26.403" Score="15" Body="&lt;p&gt;Workman or no Workman, you littered TNB with gibberish. One of your posts got flag-deleted, which results in an automatic 30 minute suspension.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The suspension will wear off in 10 minutes.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2016-11-05T21:16:26.403" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10517" PostTypeId="1" CreationDate="2016-11-06T01:15:18.210" Score="6" ViewCount="198" Body="&lt;p&gt;This has definitely been asked before, but what are the rules for web scraping in a challenge? From what I can tell, the standard rule is that your program cannot get anything from the web unless the challenge explicitly requires it. But what if I design a language where the interpreter takes the source code of the program, gets the file at &lt;code&gt;pastebin.com/......&lt;/code&gt;, and interprets it as a BF program? Then we now have a language where every program is 8 characters long (Even shorter if we encode it in base 96 or our own custom encoding) but can accomplish any task.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;What exactly are the rules for:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Where a program is allowed to take data from the internet&lt;/li&gt;&#xA;&lt;li&gt;Where an implementation is allowed to take data from the internet&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;del&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins&lt;/del&gt; This is a serious question about what kinds of programs and languages are allowed on this website.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="31716" LastEditDate="2016-11-06T04:32:12.577" LastActivityDate="2016-11-06T04:32:12.577" Title="Questions about Web Scraping" Tags="|discussion|" AnswerCount="0" CommentCount="4" ClosedDate="2016-11-10T15:32:32.790" ContentLicense="CC BY-SA 3.0" />
  <row Id="10519" PostTypeId="2" ParentId="2140" CreationDate="2016-11-06T05:36:05.053" Score="1" Body="&lt;p&gt;Defs need to fix up layout&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[Very much a WIP]&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Maze battle&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In this challenge, bots will team up, navigate around a maze and try to destroy the enemy team's artifact, and protect their own.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A maze might look like this. Note that the bots will receive numbers rather than ascii art, which represent their vision, and the objects they see.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+---------+-+---+-------+++-+-+---+-+-------+-+-----+&#xA;|         | |   |    #  | | | |   | |       | |     |&#xA;+-+ +-+-+ + + + +-+-+ +-+ + + + + + + + +-+-+ +-+ + |&#xA;|   |         |         |     | |   | | |   |     | |&#xA;| +-+-+ + +-+ +-+ + + +-+ + +-+ +-+ +-+ + +-+ +-+ + |&#xA;|       | |   |   | |     | |   |         | |   |   |&#xA;| +-+-+-+ +-+-+-+ + + + + +-+ +-+-+ +-+ + + + +-+ + |&#xA;|   |     |       |   | |   |   |     | | |       | |&#xA;| + + +-+-+ +-+ +-+ +-+ +-+ + +-+ + + + + + +-+ + + |&#xA;| |       |                 | |   | | |     |   | | |&#xA;| + + + +-+-+-+-+ +-+-+-+ + + +-+ +-+ + +-+-+-+ +-+-+&#xA;| | | |     |   | | |     |     |   | | |           |&#xA;| +-+ +-+ + +-+ +-+ +-+-+ +-+ + + + + + +-+-+ +-+ + |&#xA;|   | |   | |           | |   | | | |   | | |     | |&#xA;| +-+ + +-+ +-+ + + + +-+-+-+ +-+ +-+-+ + + + +-+ + |&#xA;|     | |       | | |   | | | | | |         |   | | |&#xA;| + + +-+ + + + + +-+ +-+ + +-+ + +-+ +-+-+ +-+ +-+-+&#xA;| | |   | | | | |   |   |       | |   | |       |   |&#xA;| +-+ + + +-+ +-+-+-+ +-+ +-+-+ + + +-+ + +-+-+ +-+ |&#xA;|   | |   |         |       |   |       |   |       |&#xA;+-+ +-+-+ +-+ +-+ +-+ + +-+ + + + +-+ +-+ +-+ + +-+-+&#xA;|   |   |   |   |   | | |     |     |   | |   |     |&#xA;| + +-+ +-+ + +-+-+-+ + + + +-+-+-+ +-+ + + +-+ +-+ |&#xA;| |       |   |   |     | |         | |   | |       |&#xA;| +-+-+ + +-+ +-+ + +-+-+-+ + + + +-+ +-+ +-+-+ +-+ |&#xA;| |   | | | |       | |   | | | | |   |     |     | |&#xA;+-+-+ + +-+ +-+-+-+-+ +-+ +-+ +-+ + +-+-+ +-+ +-+ + |&#xA;| | | | |   |           |     | |     |       | | | |&#xA;| + + +-+-+ + +-+ +-+-+ + +-+-+ +-+ +-+-+-+ +-+ +-+-+&#xA;|   |     | | |             |   | |   | |     |     |&#xA;+-+ +-+-+ + + + +-+ +-+-+-+ +-+ + +-+ + +-+ +-+ +-+-+&#xA;|   | |   |   |   | |     | |   |     |   |       | |&#xA;| +-+ + +-+-+ + +-+ + + +-+-+ + + + + + +-+-+ + + + |&#xA;|       | |           |       |   | | | |     | |   |&#xA;| +-+-+ + +-+ + +-+-+ + + +-+ + +-+-+ + +-+ + + +-+ |&#xA;|   | |   |         | | | |   |     |   | | | | |   |&#xA;+-+ + + + + + + +-+ + +-+-+-+-+ +-+-+ +-+ +-+-+ + +-+&#xA;|       |   | | |           |     | | |   | |       |&#xA;+-+-+-+ + +-+-+-+-+-+ + +-+-+ +-+ + +-+ + + + +-+ + |&#xA;|     |   | |         |     | |     |   |       | | |&#xA;+-+ +-+ +-+ +-+ + +-+ +-+-+ + + +-+ +-+ +-+ +-+ +-+-+&#xA;|     | | |     |   |         | |           |   |   |&#xA;+-+ +-+-+ + +-+-+ +-+-+ +-+-+ +-+ +-+-+-+-+ + +-+ + |&#xA;|               | |   |                 |   | |   | |&#xA;+-+-+ +-+-+-+ + + + + +-+-+-+-+-+-+ +-+ + + +-+ +-+ |&#xA;|       |   | | |   |   |           | | | |       | |&#xA;| +-+-+ + + +-+ +-+ + + +-+-+ +-+ + + + +-+-+-+-+ + |&#xA;| |       | | | |   | |       |   |     |           |&#xA;+-+-+ + +-+-+ + + +-+ +-+ +-+-+ + +-+ + + +-+-+ +-+-+&#xA;| |   |     |   | | |   |       |     | |     |     |&#xA;| + +-+ + + + + + + + + + + + + +-+-+-+ +-+-+ +-+-+ |&#xA;|       | | | |    #  |   | | | |       |     |     |&#xA;+-------+-+-+-+-------+---+-+-+-+-------+-----+-----+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Bots receive information about their current environment. They will receive a 8 lines of numbers, representing their view in each of the directions. vision is blocked by walls, and walls only, so at the end of the line of sight is a wall.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Numbers represent the following things:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;0 represents a space with nothing in it.&lt;/li&gt;&#xA;&lt;li&gt;1 represents a friendly bot&lt;/li&gt;&#xA;&lt;li&gt;2 represents an enemy bot&lt;/li&gt;&#xA;&lt;li&gt;3 represents your team's artifact&lt;/li&gt;&#xA;&lt;li&gt;4 represents the enemy team's artifact&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;To destroy the enemy's artifact, you have to shoot it a bunch. heaps. So, you probably want to bring that artifact to your team, or your team's side, so that you can shoot it more.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When you die, you respawn after 5 turns.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the start of the round, bots spawn into the first third of the maze on their side. when respawning, they also spawn into this area.&lt;/p&gt;&#xA;" OwnerUserId="55896" LastActivityDate="2016-11-06T05:36:05.053" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10525" PostTypeId="2" ParentId="2140" CreationDate="2016-11-07T17:55:47.617" Score="2" Body="&lt;h1&gt;Interpret Developers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Developers is a joke language that parodies an incident at a Microsoft Developer's conference where Steve Ballmer is supposed to have chanted the word developers at least 14 times in a row. It is basically Brainfuck with a few extensions. It appeared briefly in the Wikipedia in the beginning of 2006, but it has not reappeared anywhere since its deletion. [&lt;a href=&quot;https://esolangs.org/wiki/Developers&quot; rel=&quot;nofollow noreferrer&quot;&gt;source&lt;/a&gt;]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your job today is to ressurect this beautiful language, and create an interpreter in the fewest number of bytes. You will have to implement the following commands, which contain their Brainfuck and C equivalents:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;| Key            | BF Equiv | C Equiv         |&#xA;|----------------|----------|-----------------|&#xA;| &quot;Developers&quot;   | +        | ++*ptr;         |&#xA;| &quot;Developers&quot;*2 | -        | --*ptr;         |&#xA;| &quot;Developers&quot;*3 | &amp;gt;        | ++ptr;          |&#xA;| &quot;Developers&quot;*4 | &amp;lt;        | --ptr;          |&#xA;| &quot;Developers&quot;*5 | ,        | *ptr=getchar(): |&#xA;| &quot;Developers&quot;*6 | .        | putchar(*ptr);  |&#xA;| &quot;Developers&quot;*7 | [        | while (*ptr) {  |&#xA;| &quot;Developers&quot;*8 | ]        | }               |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As this is standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the aim of the game is to create the shortest interpreter possible.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Specification&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your interpreter should behave accordingly:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Developers/Developerz commands are separated by any whitespace.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Anything that is not a valid command should be ignored.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There will never be any more than 8 &lt;code&gt;Developers&lt;/code&gt; (or 3 &lt;code&gt;Developerz&lt;/code&gt;) present in the program that are not separated by whitespace.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Input can be interactive or provided at runtime.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Bonus&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If you would like to earn bonus points, you can also implement the following three extensions to the Developers language. These do not have a Brainfuck equivalent. &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;| Key            | C Equiv                          |&#xA;|----------------|----------------------------------|&#xA;| &quot;Developerz&quot;   | Sleep(strlen(buffer)*10);        |&#xA;| &quot;Developerz&quot;*2 | system(&quot;cls&quot;);||system(&quot;clear&quot;); |&#xA;| &quot;Developerz&quot;*3 | *p = rand() &amp;amp; 0xFF;              |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If the goal of these is not clear: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;Developerz&lt;/code&gt; should sleep the program for 10ms for ever character in an input string&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;DeveloperzDeveloperz&lt;/code&gt; should clear the screen.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;DevelopersDeveloperzDeveloperz&lt;/code&gt; should assign the currently pointed to cell to a random integer between 0 and 255.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For each command you implement, you may multiply your score by &lt;code&gt;0.75&lt;/code&gt;. Thus, by implementing all three, your score would be &lt;code&gt;42.1875%&lt;/code&gt; of the byte count.&lt;/p&gt;&#xA;" OwnerUserId="38417" LastEditorUserId="38417" LastEditDate="2016-11-08T13:59:58.567" LastActivityDate="2016-11-08T13:59:58.567" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10528" PostTypeId="2" ParentId="2140" CreationDate="2016-11-08T04:01:29.153" Score="2" Body="&lt;h1&gt;Regex Crossword&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write the shortest program that outputs a valid solution to a regex crossword. A &lt;a href=&quot;https://regexcrossword.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;regex crossword&lt;/a&gt; is a crossword that has regular expressions for the clues, like in this Puzzling SE puzzle: &lt;a href=&quot;https://puzzling.stackexchange.com/questions/45430/the-prognosticator&quot;&gt;The Prognosticator&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Terminology your program needs to know (simplified from &lt;a href=&quot;https://regexcrossword.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;)&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Quantifiers:&#xA;x*     0 or more of x (any group instruction)&#xA;x+     1 or more of x&#xA;x?     0 or 1 of x&#xA;x{y}   Exactly y of x&#xA;x{y,}  y or more of x&#xA;x{,y}  y or less of x&#xA;&#xA;Groups:&#xA;.      Any char except \n&#xA;(x|y)     Strings x or y (may be multichar), indexed from 1 from the start of clue&#xA;(xyz)     Multichar string literal, indexed from 1 from the start of clue&#xA;[xyz]     Any of characters x, y or z&#xA;[^xyz]    Not the characters x, y or z&#xA;[^x|y]    Not x or y (may be multichar)&#xA;[B-N]     Letters between B and N inclusive (any letters, caps or not)&#xA;[3-6]     Numbers between 3 and 6 inclusive (any digits)&#xA;[B-NR-Z]  Multiple ranges (could be digit ranges as well)&#xA;&#xA;Escape sequences:&#xA;\7  Get the result of the bracketed instruction indexed 7 (any num)&#xA;\r  Literal r where r is a character used in an instruction above&#xA;\\  Literal backslash&#xA;\W  a-z, A-Z, 0-9, _ (underscore)&#xA;\w  Not a character in \W&#xA;\d  A digit&#xA;\D  Not a digit&#xA;\s  Space&#xA;\S  Not a space&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input can be any format, examples use:&#xA;    Width Length&#xA;    Top down clues from left to right&#xA;    Bottom down clues from left to right (if they don't exist, newline)&#xA;    Left across clues from top to bottom&#xA;    Right across clues from top to bottom (if they don't exist, newline)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output must be the completed grid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sample input (from &lt;a href=&quot;https://regexcrossword.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input 1:&#xA;2 2&#xA;[^SPEAK]+&#xA;(EP|IP|EF)&#xA;&#xA;&#xA;(HE|LL|O)+&#xA;[PLEASE]+&#xA;&#xA;&#xA;Output 1:&#xA;HE&#xA;LP&#xA;Input 2:&#xA;2 2&#xA;[COBRA]+&#xA;(AB|O|OR)+&#xA;&#xA;&#xA;(.)+\1&#xA;[^ABRC]+&#xA;&#xA;&#xA;Output 2:&#xA;OO&#xA;OO&#xA;Input 3:&#xA;2 2&#xA;.?.+&#xA;.+&#xA;&#xA;&#xA;[*]+&#xA;/+&#xA;&#xA;&#xA;Output 3:&#xA;**&#xA;//&#xA;Input 4:&#xA;3 4&#xA;(.)\1(.)\2&#xA;[C\sOU]+&#xA;[^PU\sH]+&#xA;[PIF]+&#xA;.*[OWE]*&#xA;(TN|LF|TF)+&#xA;.[LUH]+&#xA;(P|K)[^U]+&#xA;.*C+[TIF]&#xA;(NO|ONE|ION)*&#xA;.*(L)+&#xA;[PUF\s]*&#xA;[TIC]*&#xA;[NOI\sE]+&#xA;Output 4:&#xA;PUL&#xA;P F&#xA;ICT&#xA;ION&#xA;Input 5:&#xA;3 7&#xA;[^ro\se]*(whe|who)&#xA;[are](.)[saint]+\1(v)&#xA;.{2}[st\sel]+&#xA;[^vys]+&#xA;.(\ssai).*&#xA;(le|\st|s|or)+&#xA;(rr|fro)*&#xA;[^saint]+&#xA;[\sush]*&#xA;[a\si]+&#xA;[with]*&#xA;[hel\s]+&#xA;.*&#xA;[fr\so]+&#xA;(m\s|sm)[rose]&#xA;(s|us)+&#xA;[^aw](a).*&#xA;[^hear]+&#xA;.*[fil]&#xA;(ve|o|vo)+&#xA;Output 5:&#xA;fro&#xA;m r&#xA;uss&#xA;ia &#xA;wit&#xA;h l&#xA;ove&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard loopholes apply, and no built-ins for &lt;code&gt;regex&lt;/code&gt; testing or matching. Your program must terminate in a reasonable amount of time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may assume that each input has exactly one solution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/crossword&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;crossword&amp;#39;&quot; rel=&quot;tag&quot;&gt;crossword&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle-solver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle-solver&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle-solver&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="60483" LastEditorUserId="-1" LastEditDate="2017-04-13T12:50:45.800" LastActivityDate="2016-11-08T21:37:50.937" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10529" PostTypeId="2" ParentId="2140" CreationDate="2016-11-08T05:12:51.733" Score="0" Body="&lt;h1&gt;Match the BF output &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regex&amp;#39;&quot; rel=&quot;tag&quot;&gt;regex&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brainfuck&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brainfuck&amp;#39;&quot; rel=&quot;tag&quot;&gt;brainfuck&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is, when given a BF program as input and 256 &lt;code&gt;1&lt;/code&gt;'s on the line after the BF program, match the amount of &lt;code&gt;1&lt;/code&gt;'s equal to the value of the pointer when the program halts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For a BF tutorial, see &lt;a href=&quot;http://esolangs.org/wiki/Brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example programs:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+++&#xA;(255 1's)&#xA;&#xA;(The above program should match 3 1's.)&#xA;&#xA;++[&amp;gt;+++&amp;gt;+++&amp;lt;&amp;lt;-]&amp;gt;&#xA;(255 1's)&#xA;&#xA;(The above program should match 6 1's.)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Specs:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The tape in question is 10 long, with wrapping.&lt;/li&gt;&#xA;&lt;li&gt;There is wrapping for the individual values: if it goes over 256, it goes back to 0.&lt;/li&gt;&#xA;&lt;li&gt;There is no &lt;code&gt;,&lt;/code&gt; or &lt;code&gt;.&lt;/code&gt; in the BF code.&lt;/li&gt;&#xA;&lt;li&gt;You are guaranteed that the code will terminate.&lt;/li&gt;&#xA;&lt;li&gt;You may use any flavour you want.&lt;/li&gt;&#xA;&lt;li&gt;You may match 1's in any position, as long as you match the correct amount of 1's.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Meta stuff:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;How hard would this be to pull off?&lt;/strong&gt; Is it even possible?&lt;/li&gt;&#xA;&lt;li&gt;Anything I could improve with explanations?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="49561" LastEditDate="2016-11-09T06:59:03.800" LastActivityDate="2016-11-09T06:59:03.800" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="10530" PostTypeId="2" ParentId="2140" CreationDate="2016-11-08T10:32:33.470" Score="1" Body="&lt;h1&gt;Format an XML file&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to parse an XML snippet (not necessarily an entire file) and format it. I am explicitly making this simple to encourage extremely golfed code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The formatter should transform XML like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&amp;gt;&#xA;&amp;lt;body&amp;gt;&#xA;    &amp;lt;div class=&quot;community-option&quot;&amp;gt;&#xA;        &amp;lt;input id=&quot;communitymode&quot; name=&quot;communitymode&quot; type=&quot;checkbox&quot;/&amp;gt;&#xA;        &amp;lt;label for=&quot;communitymode&quot; title=&quot;Marking an answer community wiki encourages others to edit it by lowering the reputation barrier required to edit. However, you will not gain any upvote reputation from it. This cannot be undone.&quot;&amp;gt;community wiki&amp;lt;/label&amp;gt;&#xA;        &amp;lt;a href=&quot;www.hoehel.be&quot;&amp;gt;&amp;lt;i&amp;gt;My inner web developer hates me&amp;lt;/i&amp;gt;&amp;lt;/a&amp;gt;&#xA;        &amp;lt;b&amp;gt;BOLD&amp;lt;/b&amp;gt;&#xA;    &amp;lt;/div&amp;gt;&#xA;    &amp;lt;iframe/&amp;gt;&#xA;&amp;lt;/body&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;into formatted text like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;?xml&#xA;body&#xA;    div&#xA;        input&#xA;        label&#xA;        a&#xA;            i&#xA;        b&#xA;    iframe&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The main element does not get a indent, every layer deeper does get an extra indent. An indent is either a tab or 4 spaces.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When there are multiple root elements, they simply are added below eachother with no indentation. The &lt;code&gt;?xml&lt;/code&gt; element is not different from any other element.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The XML will have a space after each element name, so if there is a CDATA element, it will be formatted as &lt;code&gt;&amp;lt;![CDATA[ (the data)]]&amp;gt;&lt;/code&gt; and will need to be formatted as &lt;code&gt;![CDATA[&lt;/code&gt; at the correct indentation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, the XML will not include &lt;code&gt;&amp;gt;&lt;/code&gt; and &lt;code&gt;&amp;lt;&lt;/code&gt; except for opening and closing elements.&lt;/p&gt;&#xA;" OwnerUserId="39069" LastEditorUserId="39069" LastEditDate="2016-11-08T21:16:23.667" LastActivityDate="2016-11-08T21:16:23.667" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10531" PostTypeId="1" AcceptedAnswerId="10534" CreationDate="2016-11-08T18:48:49.840" Score="15" ViewCount="590" Body="&lt;p&gt;I'd like to write challenges that encourage people away from golf languages, and into a more competitive space. what are some things that golf languages tend to not do, or do not as well compared to non golf languages?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For all intents and purposes, we'll consider a language a golf language if it has 5 or more one character functions that don't require the use of 'imports', aside from algebraic operators (&lt;code&gt;+&lt;/code&gt;,&lt;code&gt;-&lt;/code&gt;,&lt;code&gt;/&lt;/code&gt;,&lt;code&gt;*&lt;/code&gt;, &lt;code&gt;%&lt;/code&gt;, etc.).&lt;/p&gt;&#xA;" OwnerUserId="60951" LastEditorUserId="60951" LastEditDate="2016-12-07T17:23:49.420" LastActivityDate="2016-12-07T20:58:03.100" Title="What are some functions that golfing languages tend NOT to have, or do worse than conventional languages?" Tags="|discussion|" AnswerCount="5" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="10532" PostTypeId="2" ParentId="2140" CreationDate="2016-11-08T20:02:15.680" Score="0" Body="&lt;h1&gt;Three-way meta-quine polyglot &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Produce a program A such that running it in language A produces Program B, and running program A in language B produces program C.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Program B, when run in language B produces Program A, and running program B in language A produces program C.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Program C, when run in language &lt;em&gt;A&lt;/em&gt; or language &lt;em&gt;B&lt;/em&gt;, prints &quot;Wrong language!&quot;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Program | Language | Result&#xA;--------|----------|----------&#xA;A       | A        | Program B&#xA;B       | B        | Program A&#xA;A       | B        | Program C&#xA;B       | A        | Program C&#xA;C       | A        | &quot;Wrong language!&quot; &#xA;C       | B        | &quot;Wrong language!&quot; &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your answer should use this template:&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Language A/Language B, {a bytes} + {b bytes} = {total bytes} bytes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Language A:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a code&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Language B:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;b code&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Source:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# Language A/Language B, &amp;lt;a bytes&amp;gt; + &amp;lt;b bytes&amp;gt; = &amp;lt;total bytes&amp;gt; bytes&#xA;&#xA;Language A:&#xA;&#xA;    a code&#xA;&#xA;Language B:&#xA;&#xA;    b code&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;None of these programs should take input. &lt;/li&gt;&#xA;&lt;li&gt;Different versions of the same language count &lt;strong&gt;DO NOT&lt;/strong&gt; as different languages.  - Languages A and B must be distinct.&lt;/li&gt;&#xA;&lt;li&gt;You must not read your own source code from a file. Programs may not be empty&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the smallest sum of the byte counts Program A and B wins.&lt;/p&gt;&#xA;" OwnerUserId="41088" LastEditorUserId="41088" LastEditDate="2016-11-08T20:30:28.577" LastActivityDate="2016-11-08T20:30:28.577" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10534" PostTypeId="2" ParentId="10531" CreationDate="2016-11-09T10:19:44.953" Score="18" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenges&lt;/h2&gt;&#xA;&lt;p&gt;Golfing languages are often at a disadvantage in those challenges because:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A lot of them are transpiled into another high-level interpreted language.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;They are created to be short first and foremost, which means that a lot of their 1-byte built-ins are resource expensive operations (e.g. compute all permutations) that are good in a lot of challenges but useless when writing fast code.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;They are implemented by at most a few people in their free time and are as such not necessarily as optimized as more standard languages.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Note though that they also often use libraries of the languages they are written in for things like math operations, which means they are definitely not that slow either.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; challenges&lt;/h2&gt;&#xA;&lt;p&gt;Here, golfing languages are sometimes at a disadvantage because:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;They can get quite cumbersome to use when programs get long&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;They can get fairly unreadable when programs get long&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;More simply said, there is often no point in using a golfing language rather than a “normal” one in challenges where the length of the code is not the winning criterion&lt;/p&gt;&#xA;&lt;h2&gt;Final note&lt;/h2&gt;&#xA;&lt;p&gt;These are generalities; it is definitely possible to answer challenges with either of those tags with golfing languages. It is just generally less likely that people will compared to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges.&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-09T10:19:44.953" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10535" PostTypeId="2" ParentId="10531" CreationDate="2016-11-09T10:21:50.080" Score="7" Body="&lt;p&gt;Questions tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; are mainly answered with non-golfing languages. You can browse those questions &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Addressing your intention to discourage the use of golfing languages:&lt;br&gt;&#xA;I primarily view code-golf challenges as a contest between submissions in the same language and not as contest between languages. &#xA;If you prefer the between languages competition, you could use your definition of golfing languages and non-golfing languages to get two distinct &lt;em&gt;competitive spaces&lt;/em&gt; where golfing languages compete with other golfing languages and non-golfing languages with other non-golfing languages. For your own challenges you could then maintain two distinct leader boards, not accept a winner ect.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However I don't think this will work as a general site practice as it's hard to clearly define golfing languages.&lt;/p&gt;&#xA;" OwnerUserId="56433" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-11-09T10:21:50.080" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10538" PostTypeId="2" ParentId="2140" CreationDate="2016-11-09T16:24:47.817" Score="1" Body="&lt;h1&gt;Build a learning 20Q bot&lt;/h1&gt;&#xA;&lt;p&gt;Twenty Questions is a verbal game where an 'asker' asks you a series of yes or no questions about an object that you're thinking of. If the 'asker' gets the object correct  after twenty questions, then the 'asker' wins the game. If the asker does not guess the question right after 20 questions, then the 'thinker' wins.&lt;/p&gt;&#xA;&lt;h2&gt;Input:&lt;/h2&gt;&#xA;&lt;p&gt;Your program needs to take 4 different inputs, non simultaneously. Those three inputs are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A category (valid categories are Animal, Food, Action, Person/Character, Thing)&lt;/li&gt;&#xA;&lt;li&gt;A yes / no input from the user to answer the questions.&lt;/li&gt;&#xA;&lt;li&gt;A question input to 'teach the bot', and an object input to show the bot what was being described.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Output:&lt;/h2&gt;&#xA;&lt;p&gt;Your program needs to play a game of 20 questions, wherein it follows this structure:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Ask a category like so: &amp;quot;Select a category (Animal, Food, Action, Person/Character, Thing):&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;Ask questions based on the category.&lt;/li&gt;&#xA;&lt;li&gt;Make a guess of the object like so: &amp;quot;Is it a &amp;quot;[guess]&amp;quot;?&amp;quot;.&lt;/li&gt;&#xA;&lt;li&gt;IF the guess was wrong, ask what the object was, and inquire the difference between the guess and the object described.&lt;/li&gt;&#xA;&lt;li&gt;your program must stop at 20 questions and make a guess. it doesn't have to be random.&lt;/li&gt;&#xA;&lt;li&gt;your program must progressively 'learn' as it is played. It must be able to add new questions and objects to guess.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;⇨Select a category (Animal, Food, Action, Person/Character, Thing):  &#xA;⇦Food  &#xA;⇨Is it  ?  &#xA;⇦No  &#xA;⇨What is it?  &#xA;⇦Marmite  &#xA;⇨What is the difference between  and Marmite?   &#xA;⇦It has a saying 'You either love it or hate it'  &#xA;⇨  &#xA;⇨Select a category (Animal, Food, Action, Person/Character, Thing):  &#xA;⇦Food  &#xA;⇨Does It has a saying 'You either love it or hate it'?   &#xA;⇦No  &#xA;⇨Is it Marmite?  &#xA;⇦No  &#xA;⇨What is it?  &#xA;⇦A Carrot  &#xA;⇨What is the difference between Marmite and A Carrot?  &#xA;⇦It has lots of vitamin C   &#xA;⇨  &#xA;⇨Select a category (Animal, Food, Action, Person/Character, Thing):  &#xA;⇦Food  &#xA;⇨Does It has a saying 'You either love it or hate it'?   &#xA;⇦No  &#xA;⇨Does it It has lots of vitamin C?  &#xA;⇦Yes  &#xA;⇨Is it a Carrot?  &#xA;⇦No  &#xA;⇨What is it?  &#xA;⇦A Yam  &#xA;⇨ What's the difference between a Carrot and A Yam?  &#xA;⇦It grows underground.  &#xA;⇨  &#xA;⇨Select a category (Animal, Food, Action, Person/Character, Thing):  &#xA;⇦Food  &#xA;⇨Does It has a saying 'You either love it or hate it'?   &#xA;Yes  &#xA;⇨Is it Marmite?  &#xA;Yes  &#xA;⇨Yay, I Win!  &#xA;⇨  &#xA;⇨Select a category (Animal, Food, Action, Person/Character, Thing): &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Etc.&lt;/p&gt;&#xA;" OwnerUserId="60951" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-09T16:24:47.817" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10541" PostTypeId="2" ParentId="2140" CreationDate="2016-11-09T18:29:20.093" Score="0" Body="&lt;h2&gt;Find the highest product in a grid&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The following problem was inspired by &lt;a href=&quot;https://projecteuler.net/problem=8&quot; rel=&quot;nofollow noreferrer&quot;&gt;Problem 8&lt;/a&gt; at &lt;a href=&quot;https://projecteuler.net&quot; rel=&quot;nofollow noreferrer&quot;&gt;Project Euler&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Write a program that takes a 2-dimensional block of digits and a number on a newline (&amp;quot;n&amp;quot;) as it's input. Output value of the product of the n adjacent (read &amp;quot;in a straight line&amp;quot;) digits in the that have the greatest product. Error cases don't need to be covered (eg. the grid is not rectangular, &lt;code&gt;n&lt;/code&gt; is missing, &lt;code&gt;n&lt;/code&gt; is bigger then the width/height as the block, etc.). Diagonal numbers are also adjacent.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Examples:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1932       &#xA;4836       &#xA;8490  --&amp;gt;  288&#xA;3          &#xA;&#xA;53697817977846174064955149290862569321978468622482&#xA;83972241375657056057490261407972968652414535100474&#xA;82166370484403199890008895243450658541227588666881  --&amp;gt;  5832&#xA;16427171479924442928230863465674813919123162824586&#xA;4&#xA;&#xA;43289&#xA;90283&#xA;03248  --&amp;gt;  error (print whatever)&#xA;34290&#xA;22&#xA;&#xA;397432008949201741720 --&amp;gt; 72&#xA;2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note: possible inputs below are equivalent:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2830&#xA;0309&#xA;8011 &#xA;4&#xA;&#xA;2 8 3 0&#xA;0 3 0 9&#xA;8 0 1 1 &#xA;4&#xA;&#xA;{{2, 8, 3, 0},&#xA;{0, 3, 0, 9},&#xA;{8, 0, 1, 1}}&#xA;4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And so on, it's not strict.&lt;/p&gt;&#xA;&lt;p&gt;It's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="60199" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-10T14:29:55.013" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10545" PostTypeId="2" ParentId="2140" CreationDate="2016-11-10T02:50:00.030" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/101727/please-do-my-martian-homework&quot;&gt;Please do my Martian homework posted&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;For Sandbox, please note&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This was originally conceived of as two related challenges; &lt;strong&gt;Please do my Martian homework&lt;/strong&gt; and &lt;strong&gt;Please grade my Martian homework&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Though the task itself is different, the basic description of the task (that is, what is a Martian essay) is the same (though I may edit it later anyway), but just to avoid confusion:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Please &lt;em&gt;do&lt;/em&gt; my Martian homework&lt;/strong&gt; was posted&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Please &lt;em&gt;grade&lt;/em&gt; my Martian homework&lt;/strong&gt; is what's left&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Please Grade my Martian Homework&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;History&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Around the turn of the 20th century, spiritualist Catherine-Elise Müller allegedly communicated with Martians.  During somnambulatory trances, she would write out Martian scripts.  Psychologist Théodore Flourney discovered her Martian writings were very similar to her native French, and in his book &quot;From India to the Planet Mars&quot;, he documented Catherine's Martian alphabet.  The following is loosely based on that alphabet with an extended mythos.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Problem Description&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The Martian language has 21 characters, shown here next to each Latin equivalent:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/CkpKv.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/CkpKv.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, there's no Unicode for Martian (despite Mars being part of the universe), so we're stuck using Latin characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Whereas in English our phonemes break out into two major types (consonants/vowels) which we loosely map to letters, Martian has three letter types:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The vowels: a e i m n o u&lt;/li&gt;&#xA;&lt;li&gt;The hard consonants: b c d g k p t&lt;/li&gt;&#xA;&lt;li&gt;The soft consonants: f h l r s v z&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In addition to this, the Martian language contains a single punctuation mark--the period.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;strong&gt;Martian word&lt;/strong&gt; is a set of 3 to 9 letters.  All Martian words have at least one vowel, one hard consonant, and one soft consonant (in any arrangement).  For example, &lt;code&gt;fng&lt;/code&gt;, &lt;code&gt;cdaz&lt;/code&gt;, &lt;code&gt;vpi&lt;/code&gt;, and &lt;code&gt;pascal&lt;/code&gt; are Martian words.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;strong&gt;Martian sentence&lt;/strong&gt; is a set of 3 to 9 Martian words delimited by spaces and followed by a period.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;strong&gt;Martian paragraph&lt;/strong&gt; is a set of 3 to 9 Martian sentences, delimited by spaces, and followed by a newline.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;strong&gt;Martian essay&lt;/strong&gt; is a collection of Martian paragraphs that contains no contiguous word repetitions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;strong&gt;contiguous word repetition&lt;/strong&gt; is any construct S S where S is a contiguous set of words.  Note that this definition ignores sentence and paragraph boundaries.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The Martian homework assignment is to write an essay between 729 and 810 words.  The essay is graded on a pass/fail basis; pass simply means it's a valid Martian essay according to the above definitions, and fail means not pass.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to write a function or program that accepts data as input, and returns a truthy value if that data is a valid Martian essay between 729 and 810 words, or a falsey value if it is not.  (Don't forget that you must fail the input if there is a contiguous repetition).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code golf.  Shortest code in bytes wins.  Standard loopholes disallowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;TBD&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Post link to examples in first challenge?  Repeat examples? Should second challenge still have word counting?&lt;/p&gt;&#xA;" OwnerUserId="58514" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.947" LastActivityDate="2016-12-05T00:33:09.317" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10546" PostTypeId="1" CreationDate="2016-11-10T05:18:12.150" Score="1" ViewCount="70" Body="&lt;p&gt;I thought it would be helpful to have a question with tips on demonstrating that a system fits our definition of a language.  I feel that it would be helpful for language writers to have a section for tips to reference, however I don't know if this would be considered on topic on the main.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thoughts?  Would such a question be on topic or even helpful?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2016-11-10T05:18:12.150" Title="Would a tips on verifying languages be on topic?" Tags="|discussion|" AnswerCount="0" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10550" PostTypeId="2" ParentId="2140" CreationDate="2016-11-10T17:00:20.170" Score="3" Body="&lt;h2&gt;Limited-Information Maze-Solving Bot&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(Still in draft/beta format. Feedback welcome.)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/maze&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;maze&amp;#39;&quot; rel=&quot;tag&quot;&gt;maze&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Based on a challenge idea I posted &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/33433691#33433691&quot;&gt;in chat&lt;/a&gt; and the ensuing conversation. Thanks to NathanMerrill, zgarb, and Jonathan Frech for assistance in fleshing this out.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You're writing two separate programs/functions/routines/etc. The first, which we'll call the helper program, takes the input maze and calls the second, which we'll call the solving bot. The solving bot must solve the maze based on its interaction with the helper program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The maze is 51x51 characters in size. For clarity in this challenge description, it is composed of &lt;code&gt;#&lt;/code&gt; walls and &lt;code&gt; &lt;/code&gt; corridors, but you can use any two distinct, consistent ASCII characters of your choice. E.g., use &lt;code&gt;!&lt;/code&gt; for walls and &lt;code&gt;x&lt;/code&gt; for corridors, use &lt;code&gt;1&lt;/code&gt; for walls and &lt;code&gt;0&lt;/code&gt; for corridors, etc. This maze is one of many that will be the input to your helper program/function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The maze start is always guaranteed to be somewhere on the left-most column, and the exit is always guaranteed to be somewhere on the right-most column. The maze is guaranteed to have at least one path from the start to the exit. As a result of this construction, the very top row and very bottom row are all &lt;code&gt;#&lt;/code&gt;, and the very left and right columns are all &lt;code&gt;#&lt;/code&gt; except for the start and exit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The solving bot that you're creating needs to find &lt;em&gt;a&lt;/em&gt; solution to the maze (not necessarily the shortest), but is limited in that it can only &quot;see&quot; a new 5x5 section of the maze at a time. The bot is scored by how many times it needs to request a new 5x5 section from the helper program/function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The upper bound is obviously to simply request every possible 5x5 section, for a score of around &lt;strong&gt;100&lt;/strong&gt;. The lower bound is where someone with perfect knowledge of the maze can request only those 5x5 sections containing the exact route of the shortest solution, possibly as low as &lt;strong&gt;10&lt;/strong&gt;. Your bot will be run through (&lt;em&gt;1000?&lt;/em&gt;) different mazes, and the bot with the fewest &lt;strong&gt;total&lt;/strong&gt; requests will be the winner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The solving bot is placed on the left-hand side where the start is, and the first 5x5 section is provided for free. However, the bot &lt;em&gt;doesn't&lt;/em&gt; know where, vertically, it is on the left-hand side of the maze. It could be in the top corner (as in the example below), in the bottom corner, or anywhere in between.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input/Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The code you're writing be required to take the maze as an input (STDIN, a file to read, etc.) and call a subroutine of some sort for the solution bot.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: (&lt;em&gt;1000?&lt;/em&gt;) 51x51 mazes&#xA;Output: How many total requests your solving bot took&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yes, this is a non-observable requirement to be on the honor system and ensure the two &quot;halves&quot; of your program (i.e., the I/O half and the solving half) talk to each other correctly and accurately. I trust the community enough to believe that this is OK.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Further rules&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your solving bot should be deterministic. That is, when presented with the same maze two or more times, it should request the same number of 5x5 sections.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example Maze&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(generated from &lt;a href=&quot;http://www.delorie.com/game-room/mazes/genmaze.cgi&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.delorie.com/game-room/mazes/genmaze.cgi&lt;/a&gt; )&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;###################################################&#xA;            #     # #   # #   #   #         #   # #&#xA;# ######### ##### # # # # # # # # # ####### ### # #&#xA;#   #       #   #   # # #   # # #         #   # # #&#xA;### # ####### # # ### # ### # # ############# # # #&#xA;#   #   #   # # #   # #     # #   #   #   # #   # #&#xA;# ####### # ### ### ####### # ### # # # # # # ### #&#xA;#     #   #       #       # # #   # # # # # # #   #&#xA;##### # ################# # # # ### ### # # # # ###&#xA;#   #       #     #         # #         # # # #   #&#xA;### ####### ##### # ######### ##### ##### # ##### #&#xA;#   #           #   #       #     # #   # #   #   #&#xA;# ##### ### ### # ### ########### # # # # # # ### #&#xA;#       # # #   # # #   #         # # # #   # #   #&#xA;######### # ### # # ### # ######### # ##### # # ###&#xA;#       # #   #   # # #   #       # # #     # # # #&#xA;# ##### # ### ##### # ##### ##### # # # ##### # # #&#xA;#     #   #       # # #   #     # #   # #     # # #&#xA;### # ####### # ### # # # ##### # ### # ####### # #&#xA;#   #     #   #   # #   #   #   #   # # #         #&#xA;# ####### # ##### # ####### # ### # ### # ### # ###&#xA;# #     # #     # #       # # #   #   #   #   #   #&#xA;# # ### # ##### # # ####### # # ##### ####### ### #&#xA;#   #   #       # #     #   # #     #   #   # # # #&#xA;##### ########### ##### # ########### # # # # # # #&#xA;# #   #       #   #   # #       #   # # # # #   # #&#xA;# # ### # ##### ### # # ### ### # # # ### # ##### #&#xA;#   # # #       #   #     # # #   # #   # #   #   #&#xA;##### # # ##### # ##### # # # ##### ### # ### # ###&#xA;#   # # #     # #   #   # #   #         #   # #   #&#xA;# # # # ##### # ### # ### ##### ### ##### # # ### #&#xA;# # #   #     #     # # #         #       # # #   #&#xA;# ####### ########### # ############### ##### # ###&#xA;#     #   #   #       #             # #   #   # # #&#xA;##### # ### # # ####### ######### # # ### # ### # #&#xA;#   #     # # # #       #       # #   #   # #   # #&#xA;# ##### # ### # # ######### ### ##### # ### # ### #&#xA;# #     #   #   #     #   # #   #     # #   #     #&#xA;# # ####### ######### # # # ##### ### # # ##### ###&#xA;# # # #     #     #   # # #     # # #   #     #   #&#xA;# # # # ######### # ##### ##### # # ##### ### # # #&#xA;#   #   # #     # # #     #   #     #   # #   # # #&#xA;### ##### # ### # # # ### # # ####### ### ### # # #&#xA;# #     # # #   # # # #   # #       #       #   # #&#xA;# ##### # # # ### # # ##### ####### ####### ##### #&#xA;#       #   # #   # #       # #   # #       #   # #&#xA;### ######### # # # ######### # # # # ####### # # #&#xA;#   #   #   # # # #   #         #   #     #   #   #&#xA;# ### # # # # # ##### # ####### ########### ##### #&#xA;#     #   #   #       #       #             #      &#xA;###################################################&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Example starting block:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#####&#xA;&#xA;# ###&#xA;#   #&#xA;### #&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="42963" LastEditDate="2017-10-12T18:49:22.130" LastActivityDate="2017-10-12T18:49:22.130" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="10552" PostTypeId="2" ParentId="2140" CreationDate="2016-11-10T20:30:25.867" Score="2" Body="&lt;h1&gt;Balancing Act&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit: Challenge Live &lt;a href=&quot;https://codegolf.stackexchange.com/questions/99545/add-weight-to-one-side-of-a-see-saw-to-balance-it&quot;&gt;here&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A see-saw (supposedly from the French 'ci-ça', meaning 'this-that') forms a third of the holy trinity of playground equipment, along with the similarly ubiquitous slide and swing. A see-saw is in perfect balance if, and only if, the sum of the moments on each side are equivalent. A see-saw can therefore be balanced by adding a specific quantity of weight to the side with the lower moment sum; achieving this is your goal for this challenge.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to take a depiction of a see-saw as input and output it again, with weight added to one end of the see-saw to balance it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program must take, in any reasonable format, an ASCII see-saw such as the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;100             100&#xA;-------------------&#xA;         ^         &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The first line contains two numbers, each representing weights on the see-saw. Exactly one weight is present on each side, each acting on the very end of its side of the plank. Weights are guaranteed to be integers, and always align with their corresponding end of the plank. These numbers will never overlap the fulcrum (&lt;code&gt;^&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The second line represents the 'plank' of the see-saw. Each dash (&lt;code&gt;-&lt;/code&gt;) represents an equal length to each other dash, with the sole exception of the dash directly over the fulcrum (&lt;code&gt;^&lt;/code&gt;), which has no length.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The third line represents the fulcrum of the see-saw. This fulcrum is marked by the only character that is not a space on this line, a circumflex ('^'). The fulcrum can be positioned anywhere along the length of the plank in a valid input so long as enough space is left so that the numbers representing weights do not overlap the fulcrum in either the input or the output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input is guaranteed to have three lines, and have no white-space prior to or after the characters that constitute the see-saw (excepting, of course, the third line, which requires it).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For output, the same see-saw depiction should be printed to stdout, but with one (and only one) of the weights replaced with a larger weight, so as to balance the see-saw. Inputs are guaranteed to make this possible using integers alone. Therefore, weights must be shown without decimal points or any other similar notations. If your language does not use stdout you should go by community / meta consensus on output. Trailing newlines are fine but any other changes to the depiction format are probably not OK.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Exemplification&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test Inputs and Corresponding Outputs&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input 1&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;12                22&#xA;--------------------&#xA;             ^      &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output 1&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;12                26&#xA;--------------------&#xA;             ^      &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Input 2&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;42       42&#xA;-----------&#xA;     ^     &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output 2&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;42       42&#xA;-----------&#xA;     ^     &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Input 3&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3             16&#xA;----------------&#xA;        ^      &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output 3&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;14            16&#xA;----------------&#xA;        ^      &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Input 4&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1                56&#xA;-------------------&#xA;    ^              &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output 4&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;196              56&#xA;-------------------&#xA;    ^              &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Reference Implementation - Python 3&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# Takes a list of strings as input&#xA;def balance_seesaw(lines):&#xA;    weights = [int(w.strip()) for w in lines[0].split()]&#xA;&#xA;    length  = len(lines[1])&#xA;    pivot   = lines[2].find(&quot;^&quot;)&#xA;    left_length    = pivot&#xA;    right_length   = length - 1 - pivot&#xA;&#xA;    left_torque  = weights[0] * left_length&#xA;    right_torque = weights[1] * right_length&#xA;&#xA;    if left_torque &amp;gt; right_torque:&#xA;        weights[1] = left_torque // right_length&#xA;    elif right_torque &amp;gt; left_torque:&#xA;        weights[0] = right_torque // left_length&#xA;&#xA;    weights = [str(w) for w in weights]&#xA;&#xA;    string_gap = &quot; &quot; * (length - sum(len(w) for w in weights))&#xA;    lines[0] = weights[0] + string_gap + weights[1]&#xA;&#xA;    print(&quot;\n&quot;.join(lines))&#xA;&#xA;balance_seesaw([&quot;1                56&quot;,&#xA;                &quot;-------------------&quot;,&#xA;                &quot;    ^              &quot;])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code wins counted in bytes. Check meta if counting bytes is awkward in your language.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Standard rules/loopholes apply.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Input must be taken in a reasonable format. A non-exhaustive list of appropriate formats are given as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A single string with lines separated by newline characters&lt;/li&gt;&#xA;&lt;li&gt;A list of strings, each string represented a line&lt;/li&gt;&#xA;&lt;li&gt;A 2D Array or Matrix of characters&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Please comment on any parts of the spec, especially input / output requirements, that you find confusing or ambiguous. I haven't written a challenge before so I'm open to the fact that there's quite a bit I've missed. Any and all feedback welcome.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some users in the comments have rightly pointed out similarities between this challenge and others; please weigh in as to if you think this is a dupe or a unique challenge in its own right. Thanks!&lt;/p&gt;&#xA;" OwnerUserId="61762" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.947" LastActivityDate="2016-11-12T12:40:14.163" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10553" PostTypeId="2" ParentId="2447" CreationDate="2016-11-10T20:35:34.147" Score="32" Body="&lt;h1&gt;In languages without any method of input (e.g. ///) programs may get input through an insertion into the source code&lt;/h1&gt;&#xA;" OwnerUserId="60483" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-10T20:35:34.147" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10554" PostTypeId="2" ParentId="2140" CreationDate="2016-11-10T20:41:38.850" Score="0" Body="&lt;h1&gt;Absolutely correct !&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I have been given some homework, in which my Math teacher wants me to figure out what expression is represented in the graphs she gave me.&#xA;Because it is long and painful to do every single one of them by hand, I want to automate it a bit.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a graph as an input, output the equation represented, in human-readable format. That is, something like &lt;em&gt;that&lt;/em&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;y=-|x-3|+5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;More generaly, the expression will always be of the form&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;y=±|x+a|+b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where you have to replace &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; by their value. The function has to be simplified to its maximum (i.e. can not contain &lt;code&gt;+0&lt;/code&gt;, &lt;code&gt;-0&lt;/code&gt;, or &lt;code&gt;+|x|&lt;/code&gt;);&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input is given in ASCII.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;             \       |       /             &#xA;              \      |      /              &#xA;               \     |     /               &#xA;                \    |    /                &#xA;                 \   |   /                 &#xA;                  \  |  /                  &#xA;                   \ | /                   &#xA;                    \|/                    &#xA;---------------------V---------------------&#xA;                     |                     &#xA;                     |                     &#xA;                     |                     &#xA;                     |                     &#xA;                     |                     &#xA;                     |                     &#xA;                     |                     &#xA;                     |                     &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This represents the equation &lt;code&gt;y=|x|&lt;/code&gt;. The graph is not always centered, and can be of any width and height.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;/&lt;/code&gt;, &lt;code&gt;\&lt;/code&gt; are straight lines. &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;V&lt;/code&gt; are verteces. &lt;code&gt;-&lt;/code&gt; and &lt;code&gt;|&lt;/code&gt; are the axes, and &lt;code&gt;+&lt;/code&gt; is their intersection (if not covered by an other character).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Unit&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A unit is two characters. for example, &lt;code&gt;--&lt;/code&gt; is one unit on the horizontal axis.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;|&#xA;|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Is one unit on the vertical axis.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Tests&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A test suite is available &lt;a href=&quot;http://hastebin.com/raw/ukehakopiw&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&#xA;A line of &lt;code&gt;#&lt;/code&gt;s is used to separate input from output.&#xA;Output goes first, for clarity.&lt;/p&gt;&#xA;" OwnerUserId="38368" LastEditorUserId="38368" LastEditDate="2016-11-10T20:47:13.007" LastActivityDate="2016-11-10T20:47:13.007" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10555" PostTypeId="2" ParentId="2140" CreationDate="2016-11-10T21:54:32.683" Score="-2" Body="&lt;h1&gt;Urinal Discomfort!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This question springboards off of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/98129/positional-bathroom-etiquette&quot;&gt;Positional Bathroom Etiquette&lt;/a&gt;, while adding an extra twist. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Background&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I'm going to take @Nick Frev 's formulae for the total discomfort of a urinal spot&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;dist(x,y) = linear distance between person x and person y in Urinal Units&#xA;discomfort(x) = sum(1/(dist(x,y)*dist(x,y))) for all persons y excluding person x&#xA;total_Discomfort = sum(discomfort(x)) for all x&#xA;short_urinal_discomfort = discomfort_from_surroundings + 1/9 (inherent_discomfort)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your task is to put a person into the spot with the least total discomfort. However, now you have big and small urinals. The small ones, obviously, cause a little inherent discomfort, so we prefer to not use those if we have a choice. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Input/Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your program will take in a string of &lt;code&gt;1,0,i,o&lt;/code&gt; to represent the row of urinals. &lt;code&gt;1&lt;/code&gt; represents a person in a tall urinal, &lt;code&gt;0&lt;/code&gt; is an empty tall urinal, &lt;code&gt;i&lt;/code&gt; is a full short urinal, and &lt;code&gt;o&lt;/code&gt; is an empty short urinal. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using the above formulae, build a program that will replace an empty urinal with the correct placement of the next person(&lt;code&gt;0-&amp;gt;1&lt;/code&gt; or &lt;code&gt;o-&amp;gt;i&lt;/code&gt;).  &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The short urinals have an inherent discomfort of &lt;code&gt;1/9&lt;/code&gt; which will be added onto the discomfort provided by the surroundings. &lt;/li&gt;&#xA;&lt;li&gt;The door is to the right of the row, so the urinals fill up right to left, because you have to pee really bad and can't walk further than you have to.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;code&gt;Input      Output&#xA;  000          001&#xA;  101          111&#xA;  1000001      1001001&#xA;  101010101    101010111&#xA;  000o         001o&#xA;  100o         100i&#xA;  oo0oooo      oo1oooo&#xA;  11000ii      11010ii&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Any tips would be super helpful&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;More test cases maybe?&#xA;Or more clarification?&lt;/p&gt;&#xA;" OwnerUserId="60921" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:27.967" LastActivityDate="2016-11-10T21:54:32.683" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10557" PostTypeId="1" CreationDate="2016-11-11T09:58:44.637" Score="0" ViewCount="56" Body="&lt;p&gt;Please have a look at &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10547/31516&quot;&gt;this Sandbox submission&lt;/a&gt;. Regardless, this question is a general one, not about the Sandbox submission specifically.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Very short summary of the question:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Build/design a controller that can perform a given operation using as few function blocks as possible. The controller has only a few possible functions (logical functions (&lt;code&gt;AND&lt;/code&gt;, &lt;code&gt;OR&lt;/code&gt;, &lt;code&gt;NOR&lt;/code&gt; ...) and a pulse generator.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, the real challenge here is to find the best controller design, not the actual implementation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this question on-topic? Is it a good challenge? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've found &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37648/drive-a-hexadecimal-7-segment-display-using-nand-logic-gates/37675#37675&quot;&gt;this&lt;/a&gt; very similar question, but I would claim they're not duplicates.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the record: The Sandbox submission had +2 when I asked this question. We'll see how the Meta-effect goes. =)&lt;/p&gt;&#xA;" OwnerUserId="31516" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-11-11T10:35:08.123" Title="Challenges where the code itself is not important" Tags="|discussion|" AnswerCount="0" CommentCount="1" ClosedDate="2016-11-11T21:56:04.400" ContentLicense="CC BY-SA 3.0" />
  <row Id="10558" PostTypeId="1" AcceptedAnswerId="10560" CreationDate="2016-11-11T10:20:37.497" Score="4" ViewCount="202" Body="&lt;p&gt;I'm new to this whole thing, and would like some pointers to getting started&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The golfing type languages I'm familiar with are &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;APL&lt;/li&gt;&#xA;&lt;li&gt;Brainfuck (Check out some of the stuff I've done &lt;a href=&quot;https://github.com/MicroTransactionsMatterToo/brainfuck-scripts&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Befunge&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And thats about it&lt;/p&gt;&#xA;" OwnerUserId="61813" LastActivityDate="2016-11-11T15:05:33.470" Title="Getting started golfing" Tags="|support|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10560" PostTypeId="2" ParentId="10558" CreationDate="2016-11-11T15:05:33.470" Score="5" Body="&lt;h1&gt;How to be involved:&lt;/h1&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;strong&gt;Take a look at other people's answers.&lt;/strong&gt;  Try to figure out what the heck their code does, and if they are doing something clever, upvote it.  This way, you start to grasp the areas different languages excel in.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Write submissions!&lt;/strong&gt;  You'll likely get comments helping you golf your submission further, improving your skills.&lt;/li&gt;&#xA;&lt;li&gt;If you want, &lt;strong&gt;write your own golfing language&lt;/strong&gt;!  If you've found an interesting niche, or you think you can outperform a different language, then make one!  Or, if you want, you could add to the &lt;em&gt;many&lt;/em&gt; esoteric languages this community has written.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Write some challenges.&lt;/strong&gt;  Make sure to post it in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt;, but writing challenges is my personal favorite part of this site.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-11T15:05:33.470" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10564" PostTypeId="2" ParentId="2140" CreationDate="2016-11-11T22:34:27.803" Score="0" Body="&lt;h1&gt;How Big is the Hyperbolic Round Table of Camelot?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There is a hyperbolic rogue-like game called &lt;a href=&quot;http://www.roguetemple.com/z/hyper/&quot; rel=&quot;nofollow noreferrer&quot;&gt;HyperRogue&lt;/a&gt;, based on the truncated order-7 triangular tiling. (Each vertex is surrounded by two hexagons and one heptagon.) There is a place in this game called Camelot, where the Round Table sits. In the middle of the table is the Holy Grail. The table starts with a radius of 28, but each Holy Grail you collect increases the radius by 2. So my question is: given the number of Holy Grails collected, what is the area of the Round Table?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Assumptions:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The Holy Grail starts on a heptagon.&lt;/li&gt;&#xA;&lt;li&gt;The heptagon the Holy Grail is on is the circle of radius 0.&lt;/li&gt;&#xA;&lt;li&gt;A circle with radius &lt;code&gt;n+1&lt;/code&gt; comprises the circle of radius &lt;code&gt;n&lt;/code&gt; and all the cells touching the circle of radius &lt;code&gt;n&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 Holy Grails = 31659398 Tiles&#xA;1 Holy Grail = 93888285 Tiles&#xA;2 Holy Grails = 278432568 Tiles&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Winning Criterion:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Shortest code wins! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="55345" LastEditorUserId="56433" LastEditDate="2016-11-13T09:26:03.537" LastActivityDate="2016-11-13T09:26:03.537" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10572" PostTypeId="1" CreationDate="2016-11-13T02:46:25.043" Score="33" ViewCount="392" Body="&lt;p&gt;I'd like to introduce &lt;a href=&quot;https://github.com/nathanmerrill/KoTHComm&quot; rel=&quot;nofollow noreferrer&quot;&gt;KoTHComm&lt;/a&gt;.  I've been working on this for many months now, and I feel like its at a (somewhat) stable point.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;KoTHComm is a modular framework built to help write King of the Hill challenges faster.  It provides:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A communication system to &lt;strong&gt;communicate with other languages&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;A downloader to automatically &lt;strong&gt;download the latest submissions&lt;/strong&gt; from the site&lt;/li&gt;&#xA;&lt;li&gt;A tournament system, which allows you to &lt;strong&gt;organize players into games&lt;/strong&gt; in a variety of ways&lt;/li&gt;&#xA;&lt;li&gt;A scoring system, which allows you to &lt;strong&gt;combine game scores&lt;/strong&gt; in smart ways&lt;/li&gt;&#xA;&lt;li&gt;A map module, providing many types of &lt;strong&gt;extensible maps and map generation&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;GUI components&lt;/strong&gt; to easily show the current state of the game&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;It works too:  I used it on my past KoTH, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/91566/stock-exchange-koth&quot;&gt;Stock Exchange&lt;/a&gt;, and I will be using it on my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/99744/battle-of-the-fellowships-koth&quot;&gt;upcoming KoTH&lt;/a&gt;.  &lt;strong&gt;All features are optional&lt;/strong&gt;, and I've tried to limit the dependencies between the different parts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would like to note that the framework is still under heavy development, and I cannot guarantee backwards compatibility of any kind.  I'm sure it has bugs, but I try to fix them as fast as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;FAQ:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What language is it written in?&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Java 8.  Yes, you must write your controller in Java.  If you hate Java, tough luck.  Submissions &lt;em&gt;don't&lt;/em&gt; have to be written in Java, but I'd highly recommend limiting them to Java for speed purposes&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;What do you plan on doing?&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Store scores in a persistent database (which means that you can start your controller multiple times, and save all of your scores)&lt;/li&gt;&#xA;&lt;li&gt;Hosting KoTHs on a website.  This will not be an automatic process, and I will pick and choose which ones I will host.  I'd also love to get a stack snippet to work with it as well&lt;/li&gt;&#xA;&lt;li&gt;Add tests and comments for all of my code&lt;/li&gt;&#xA;&lt;li&gt;Flesh out map generation&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Do you want help?&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Sure!  Either send a pull request, or talk to me &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;in chat&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Do you plan on porting this to other languages?&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If you have any questions or feedback, post it below.  If you have any bugs, post a bug report on Github.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2017-02-02T01:30:33.303" Title="Introducing KoTHComm: A framework for your King of the Hill challenges" Tags="|discussion|king-of-the-hill|" AnswerCount="0" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="10573" PostTypeId="1" CreationDate="2016-11-13T08:32:00.017" Score="8" ViewCount="313" Body="&lt;p&gt;I'm considering doing an &lt;strong&gt;original challenge&lt;/strong&gt; that (at of right now) consists of golfed solutions in the languages &lt;code&gt;C&lt;/code&gt;, &lt;code&gt;Python&lt;/code&gt;, &lt;code&gt;Jelly&lt;/code&gt;, &lt;code&gt;Javascript&lt;/code&gt;, &lt;code&gt;05AB1E&lt;/code&gt;, &lt;code&gt;Pyth&lt;/code&gt;, &lt;code&gt;PHP&lt;/code&gt;, &lt;code&gt;MATL&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is to look at the golfed code and figure out what the intended challenge was.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it could be a very interesting challenge, depending on the complexity of the intended challenge, but I fear that once someone figures out the solution (the intended challenge), the challenge is dead for everybody else, and that just makes it a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-gun-in-the-west&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-gun-in-the-west&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-gun-in-the-west&lt;/a&gt; challenge, which is &lt;strong&gt;not&lt;/strong&gt; what I want.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would very much like any feedback on this type of challenge - would people be interested in doing this?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(The reason this isn't posted in the sandbox is because it's a completely new type of challenge, and I'm not sure that comments are the best way to provide feedback to this type of challenge)&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="56477" LastActivityDate="2016-11-13T13:55:07.777" Title="Code Golf Jeopardy" Tags="|discussion|sandbox|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10575" PostTypeId="2" ParentId="10573" CreationDate="2016-11-13T09:08:14.270" Score="0" Body="&lt;h1&gt;Cops and robbers?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;people post a question, people post the answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this way, the challenge does not die immediately, and has a reasonable amount of time to it&lt;/p&gt;&#xA;" OwnerUserId="55896" LastActivityDate="2016-11-13T09:08:14.270" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10576" PostTypeId="1" AcceptedAnswerId="10578" CreationDate="2016-11-13T13:22:19.500" Score="4" ViewCount="262" Body="&lt;p&gt;When answering a CNR challenge it's common to get the response: &quot;Well done, but that was definitely not what I had in mind&quot;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I feel like it should be perfectly fine for anyone to post a second crack if OP says the intended solution was substantially different. The first crack is of course still valid, but the challenge could still be a very interesting to others, since they know there are other, possibly more complicated, complex or obscure solutions. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've never seen anyone posting a second crack, and OP often posts &quot;The intended solution was: &lt;code&gt;abcde&lt;/code&gt;. (I've done this myself quite a few times).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can we encourage others to post a second crack to the cop post if there is a &lt;em&gt;substantially different&lt;/em&gt; solution to it? This would also mean that Cops are discouraged to post the intended solution until the SAFE-date, even if it's already cracked. &lt;/p&gt;&#xA;" OwnerUserId="31516" LastActivityDate="2016-11-14T21:40:27.150" Title="Post a crack to a cracked CNR submission" Tags="|discussion|cops-and-robbers|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10577" PostTypeId="2" ParentId="10573" CreationDate="2016-11-13T13:55:07.777" Score="17" Body="&lt;h1&gt;Do it as a Cops n Robbers&lt;/h1&gt;&#xA;&lt;p&gt;You'll need the following:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;I wouldn't limit the language to those, but rather those with an Esolang page, or on wikipedia's list of languages.  The language, however, must be specified by the cop.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I recommend explicitly saying that you must write your own submission&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The challenge they choose must have a positive score and not be closed&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The robber needs to find any challenge that the submission solves.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Then, if you have your own code you want people to solve, you can simply add it!&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-13T13:55:07.777" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10578" PostTypeId="2" ParentId="10576" CreationDate="2016-11-13T14:24:51.343" Score="12" Body="&lt;p&gt;Sure, but by default, only the first crack should receive credit. This would keep it in line with our current policy, while allowing additional cracks (that would be non-competing). Challenge authors can override this default if desired.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2016-11-13T14:24:51.343" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10581" PostTypeId="1" CreationDate="2016-11-14T05:53:34.507" Score="6" ViewCount="216" Body="&lt;p&gt;This is related to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/4782/52964&quot;&gt;Martin Ender's question here&lt;/a&gt;, but in my opinion different enough to warrant a separate meta post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Are programs required to provably terminate, even if an algorithm that is not proven to terminate works for the given input range?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A basic example would be having a program calculate the nth term in the sequence &lt;a href=&quot;https://oeis.org/A006577&quot; rel=&quot;nofollow noreferrer&quot;&gt;A006577&lt;/a&gt;. It is unknown whether or not all values of n eventually reach 1, and therefore it is impossible to have a program calculate the nth term of this sequence in a finite amount of time. However, it has been proven for all values up to 2&lt;sup&gt;60&lt;/sup&gt;, which is satisfactory for most purposes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This question also expands to situations where there are algorithms proven to terminate. Let's assume that there is a problem A that can be solved with 2 algorithms B and C. B is mathematically proven to always solve problem A in a finite amount of time. Algorithm C is not proven as such, but despite estensive testing up to numbers vastly exceeding the maximum value of an int32, there have been no such numbers that cause it to never termimate. Would an answer using algorithm C be acceptable?&lt;/p&gt;&#xA;" OwnerUserId="52964" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-11-14T10:06:58.913" Title="Should programs that are not proven to always terminate be valid?" Tags="|discussion|answers|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10582" PostTypeId="2" ParentId="10581" CreationDate="2016-11-14T09:30:28.220" Score="10" Body="&lt;h1&gt;Yes, programs that are not proven to terminate are valid&lt;/h1&gt;&#xA;&lt;p&gt;As flawr mentioned in a comment:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I think only very few (if at all) of the algorithms used to answer any challenge here have been proven to always terminate, and I don't think we should change that.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Deciding whether or not a single program terminates can be a daunting task. Deciding whether or not &lt;em&gt;every&lt;/em&gt; program posted terminates is unreasonable and infeasible, since &lt;a href=&quot;https://en.wikipedia.org/wiki/Halting_problem&quot; rel=&quot;nofollow noreferrer&quot;&gt;it cannot be done programmatically&lt;/a&gt;. Furthermore, that would conflict with challenges that allow solutions to require infinite time (which is most of them).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-14T10:06:58.913" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10584" PostTypeId="1" CreationDate="2016-11-14T19:13:56.987" Score="20" ViewCount="348" Body="&lt;p&gt;Inspired by &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/33508295#33508295&quot;&gt;a question in chat from a new user&lt;/a&gt;, I thought it would be a good idea to have a tag for challenges where the output is a truthy value if the input meets certain criteria, and falsey otherwise. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; would make a good tag name - it's precisely what these types of problems are called in computer science.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some examples of challenges where this tag would be relevant:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/99781/45941&quot;&gt;Do n and n^3 have the same set of digits?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/98724/45941&quot;&gt;Primenary Strings&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/89342/45941&quot;&gt;Is it truthy or falsy?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/78235/45941&quot;&gt;Can Gravity Guy Make It?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/88806/45941&quot;&gt;Only Even Bytes&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/91432/45941&quot;&gt;Where are Champernowne&amp;#39;s zeroes?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="56656" LastEditDate="2022-02-06T00:30:19.667" LastActivityDate="2022-02-06T00:30:19.667" Title="New tag proposal: decision-problem" Tags="|discussion|status-completed|tags|" AnswerCount="2" CommentCount="9" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10585" PostTypeId="2" ParentId="2140" CreationDate="2016-11-14T19:22:37.547" Score="0" Body="&lt;h3&gt;Pay Best Card in Euchre&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Firstly&lt;br/&gt;&#xA;An array of three cards representing the cards played by each player formatted like&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[JD][10H][9S]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Representing&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Jack of Diamonds, 10 of Hearts, and Nine of Spades.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As you always sit across from your team-mate in Euchre, the second element represents your team mate's play. Here, the &lt;code&gt;10H&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Secondly&lt;br&gt;&#xA;A Single Char, String, etc representing the trump suit formatted like&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;S, D, C, H&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;representing&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Spades, Diamonds, Clubs, Hearts&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Thirdly&#xA;an array of four cards representing your hand formatted like&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[KD][JC][QH][AS]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;representing&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;King of Diamonds, Jack of Clubs, Queen of Hearts, Ace of Spades&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Objective:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given the three inputs, output the best possible card to add to the cards that have been played such that it meets the following criteria:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It takes the hand if it can, if not output the least valuable card&lt;/li&gt;&#xA;&lt;li&gt;It takes the hand if it can, however it will not trump your team mate unless it is unavoidable  &lt;/li&gt;&#xA;&lt;li&gt;If it can take the hand, it does so by using the least valuable card. (If you have an ace and a queen that can win the hand, you play the queen).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Output format like &lt;code&gt;[JD]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Formatting&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A - Ace&#xA;K - King&#xA;Q - Queen&#xA;J - Jack&#xA;10 - Ten&#xA;9 - Nine&#xA;&#xA;H - Hearts&#xA;D - Diamonds&#xA;S - Spades&#xA;C - Clubs&#xA;&#xA;10H, 9D, JD, QH, AD, 9C, 10C&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;In: &lt;code&gt;[QD][KD][9C]&lt;/code&gt;, &lt;code&gt;&quot;C&quot;&lt;/code&gt;, &lt;code&gt;[AH][JH][QH][9H]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Out: &lt;code&gt;9H&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Reason: As clubs are trump, the 9C is winning the hand, we are unable to take the hand so we should discard our lowest card, here the &lt;code&gt;9H&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In: &lt;code&gt;[QD][KD][AD]&lt;/code&gt;, &lt;code&gt;&quot;H&quot;&lt;/code&gt;, &lt;code&gt;[AH][JH][QH][9H]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Out: &lt;code&gt;9H&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Reason: As Hearts are trump, the Ace of Diamonds is currently winning the hand, we are able to trump the hand so we should use our lowest card, here the &lt;code&gt;9H&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In: &lt;code&gt;[QD][KD][10D]&lt;/code&gt;, &lt;code&gt;&quot;H&quot;&lt;/code&gt;, &lt;code&gt;[AD][JH][QH][9D]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Out: &lt;code&gt;9D&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Reason: As diamonds are trump and we are currently winning the hand, we should play the 9D because our partner currently is winning the hand, so we want to play the &lt;code&gt;9D&lt;/code&gt; over the &lt;code&gt;AD&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In: &lt;code&gt;[QH][KH][JH]&lt;/code&gt;, &lt;code&gt;&quot;D&quot;&lt;/code&gt;, &lt;code&gt;[AD][JD][QH][9D]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Out: &lt;code&gt;QH&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Reason: As Diamonds are trump our opponents are winning with the left Bower &lt;code&gt;JH&lt;/code&gt; We have the right bower but cannot trump him because QH was led and we must follow suit, the &lt;code&gt;QH&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In: &lt;code&gt;[QH][KH][JH]&lt;/code&gt;, &lt;code&gt;&quot;D&quot;&lt;/code&gt;, &lt;code&gt;[AD][JD][QC][9D]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Out: &lt;code&gt;JD&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Reason: As Diamonds are trump our opponents are winning with the left Bower &lt;code&gt;JH&lt;/code&gt; We have the right bower and since we have no &lt;code&gt;Diamonds&lt;/code&gt; we can trump over him with the &lt;code&gt;JD&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Euchre Card Strengths&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If Hearts is trump:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;JH&#xA;JD&#xA;AH&#xA;KH&#xA;QH&#xA;10H&#xA;9H&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;See the Euchre Rules if you are unfamiliar with the strength of different cards in &lt;a href=&quot;https://www.hoylegaming.com/rules/showrule.aspx?RuleID=209&quot; rel=&quot;nofollow noreferrer&quot;&gt;Euchre&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since this is Code-Golf the shortest code wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Good Luck and have fun!&lt;/p&gt;&#xA;" OwnerUserId="60356" LastEditorUserId="60356" LastEditDate="2016-11-14T19:50:59.953" LastActivityDate="2016-11-14T19:50:59.953" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10587" PostTypeId="2" ParentId="10584" CreationDate="2016-11-14T20:29:16.523" Score="2" Body="&lt;p&gt;I'm not trying to argue either way, but since this is &lt;a href=&quot;/questions/tagged/discussion&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt;...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why? You say that you think it would be a good idea, but you don't explain what you think the benefit would be. The purpose of tags is to serve as a kind of recommendation system: &quot;If you liked that question, you might like this one&quot;, or conversely, &quot;I you don't like that question, you probably won't like this one&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is being a decision problem really an attribute which people care about when deciding which questions to answer or avoid?&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2016-11-14T20:29:16.523" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10588" PostTypeId="1" CreationDate="2016-11-14T20:48:44.280" Score="0" ViewCount="35" Body="&lt;p&gt;&#xA;Is it allowed to have an answer which has some code outside of a function? For example, in Python, if you were to get the sum of two square roots, would this be allowed:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import math&#xA;R=math.sqrt&#xA;def f(x,y):&#xA; return R(x)+R(y)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or would it have to be this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def f(x,y):&#xA; import math&#xA; R=math.sqrt&#xA; return R(x)+R(y)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or maybe this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import math&#xA;def f(x,y):&#xA; R=math.sqrt&#xA; return R(x)+R(y)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="59363" LastActivityDate="2016-11-14T20:48:44.280" Title="Function and Code" Tags="|discussion|" AnswerCount="0" CommentCount="0" ClosedDate="2016-11-14T20:51:20.267" ContentLicense="CC BY-SA 3.0" />
  <row Id="10589" PostTypeId="1" CreationDate="2016-11-14T21:10:32.507" Score="-8" ViewCount="143" Body="&lt;p&gt;This would work like this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A function scaffold is specified containing a variable name&lt;/li&gt;&#xA;&lt;li&gt;You do not need to declare a function or print a value, just use a return statement.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ruby:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def palindromize_string(s)&#xA;    &amp;lt;code&amp;gt;&#xA;end&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then only the part of the code symbolized by &lt;code&gt;&amp;lt;code&amp;gt;&lt;/code&gt; would be counted in the score.&lt;/p&gt;&#xA;" OwnerUserId="53551" LastActivityDate="2016-11-14T22:10:35.607" Title="New code golf format: function contents" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10590" PostTypeId="2" ParentId="10576" CreationDate="2016-11-14T21:40:27.150" Score="5" Body="&lt;p&gt;In some cases the new crack could be more interesting or obviously more intended. But in other cases this could be too open-ended.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Instead, we should encourage the cops to fix their submissions and post new versions. If that couldn't be fixed, it fails to be a competitive cop answer, so it doesn't make too much sense to have more robber answers related to it either.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we really want to allow the new robbers, we should find some ways to decide which answer is better, for example the shortest. Then we could allow posting competitive answers using different approaches in some challenges, or even give credit to better answers. But we shouldn't encourage subjectively &quot;interesting&quot; cracks. Specifically, we shouldn't encourage:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Guessing the original intention;&lt;/li&gt;&#xA;&lt;li&gt;Accepting arbitrary restrictions made by the cop;&lt;/li&gt;&#xA;&lt;li&gt;Adding &quot;creative&quot; (in a sense that doesn't really help cracking) cracks to a too weak cop.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;At least we shouldn't vote for these reasons. Cracks with the first 2 features could be competitive, too, though. But most are not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In any cases you can always post the supposedly better cracks in comments.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2016-11-14T21:40:27.150" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10591" PostTypeId="5" CreationDate="2016-11-14T21:49:05.920" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; is the main chat room for CGCC. For more info on SE chat, see&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/faq&quot;&gt;Chat FAQ&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://meta.stackexchange.com/questions/tagged/chat&quot;&gt;The chat tag on meta SE&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="56656" LastEditDate="2020-02-03T17:18:35.503" LastActivityDate="2020-02-03T17:18:35.503" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="10592" PostTypeId="4" CreationDate="2016-11-14T21:49:05.920" Score="0" Body="For questions about using the Stack-exchange chat system" OwnerUserId="31716" LastEditorUserId="31716" LastEditDate="2016-11-14T21:49:05.920" LastActivityDate="2016-11-14T21:49:05.920" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10593" PostTypeId="2" ParentId="10589" CreationDate="2016-11-14T22:10:35.607" Score="12" Body="&lt;p&gt;No, this is a bad idea. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It's either language specific, or making a lot of assumptions about language features. Both are bad things. A lot of languages don't even &lt;em&gt;have&lt;/em&gt; functions. Can you declare a universal function scaffold? I certainly couldn't.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If it's not language specific, it's very abuse prone. On the less extreme side, you could do something like preprocessing/defining variables inside of the function declaration. For example, I could submit this record breaking python &quot;Hello world&quot; function:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def f(s=&quot;Hello, world!&quot;):&#xA; print(s)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The contents of this function are only 8 bytes long! On the more extreme side, I could imagine a language called &quot;Meta-functionscript&quot;, where all of the code is function declarations, and the contents of the function don't matter at all. Instead, you interpret the name of the function as a base-64 encoded number, representing the &lt;em&gt;n-th&lt;/em&gt; enumerated golfscript program, and then you run that as the function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Obviously we could patch these holes, but I'm sure there are many more, and this just overcomplicates everything.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It's unecessarily complicated, especially since languages have &lt;em&gt;very&lt;/em&gt; different conventions for declaring functions.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It would remove one of my favorite parts of golfing. For example, if I'm writing a python answer, it usually goes something like this. I write a full program that accomplishes the task. Then, I squish it to a function to take off a few bytes. But then I realize that a lambda is even shorter, so I re-write it. But wait a second, I could do a recursive approach! Now I need to name the lambda, which costs a few bytes but might save a lot too. Obviously I'll have to try both. But then I realize building up a list and returning that might be unecessary. Maybe I could just directly print the value. And so on and so forth. A &lt;em&gt;lot&lt;/em&gt; of golfing comes from these kind of decisions, and simplifying everything down to just &quot;function contents&quot; would remove this entire aspect of golfing.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Above all else, I just don't really see any benefit. Sure, submissions would tend to be a little bit shorter, but that's not necessarily good. For example, I don't think gzipping source code and submitting the compressed version should be made standard.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since every language has the same byte penalty for the function declaration, comparing submissions in the same language is still perfectly fair without any need to clutter up the rules with &quot;Function contents&quot;.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2016-11-14T22:10:35.607" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10595" PostTypeId="2" ParentId="10584" CreationDate="2016-11-15T09:16:00.823" Score="7" Body="&lt;p&gt;Mego created the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; tag. Feel free to propose an edit to the tag wiki if you think it can be improved.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now comes the tedious part: identifying challenges that fit the tag, and (slowly - we don't want to flood the front page) adding the tag to them. Below is a list of challenges to which the tag needs to be added. If you come across any challenges not listed here, please add them to the list. If you add the tag to any challenge listed here, please remove it from the list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I (Mego) will be adding the tag to 5 challenges per day, to limit the number of older challenges being bumped to the front page. Please refrain from large amounts of tag edits at once.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(the list is currently empty - please add more if you find them!)&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2016-12-06T00:17:03.057" LastActivityDate="2016-12-06T00:17:03.057" CommentCount="4" CommunityOwnedDate="2016-11-15T09:16:00.823" ContentLicense="CC BY-SA 3.0" />
  <row Id="10596" PostTypeId="2" ParentId="435" CreationDate="2016-11-15T09:30:09.760" Score="6" Body="&lt;p&gt;It's been many years since this quesion was asked (and was active). Today, I see some users using pretty much personal golfing languages, and besides the rule of not using languages/language features that didn't exist before the question was asked, it seems everyone is fine with it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm fine with it too. However, I think that to be consistent, we should also then allow custom libraries, as long as they too existed before the challenge in question, and as long as they're &quot;declared&quot;. For instance, whether you answer with&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;C with Votrob's Magical Golfing Macro library, 32 bytes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;VotroC, 32 bytes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;shouldn't matter. Here, I imagine &quot;VotroC&quot; as a custom golfing language implemented as a C header file of macro definitions, existing before the challenge question of course. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If submitting as the former, I think you should even be allowed to leave out the #include &quot;votroc.h&quot; or skip it in your byte count, since you could easily work around it by declaring your library a language and submit it as the latter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Writing macro collections/EDSLs for golfing isn't really against the spirit of golfing more than golfing languages are, IMO. It's really the same thing. So they should &quot;compete&quot; on equal terms.&lt;/p&gt;&#xA;" OwnerDisplayName="user61264" LastActivityDate="2016-11-15T09:30:09.760" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10599" PostTypeId="2" ParentId="10531" CreationDate="2016-11-15T16:50:14.087" Score="8" Body="&lt;h1&gt;Domain specific functionality&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Want to perform image processing? Audio processing? Simple machine learning? Many high level languages, like Python, Mathematica, etc., will have those sorts of packages already built in, while golfing languages rarely will. While it's not a good idea to directly use a built-in, they can make challenges much, much easier without making them trivial.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anything you'd like to import a package for is probably easier in a non-golfing language.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2016-11-15T16:50:14.087" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10600" PostTypeId="1" CreationDate="2016-11-15T21:42:44.570" Score="4" ViewCount="61" Body="&lt;p&gt;As I was looking through the revision history on &lt;a href=&quot;https://codegolf.stackexchange.com/posts/95780/revisions&quot;&gt;this question&lt;/a&gt;, I saw some strange things I haven't seen before. Here is a &amp;quot;transcript&amp;quot; of sorts (ignoring edits):&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Question Unprotected&lt;/strong&gt; by Dennis&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Notice removed&lt;/strong&gt; Improve details by Dennis&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Notice added&lt;/strong&gt; Improve details by Sickboy&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Notice removed&lt;/strong&gt; Improve details by Community&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Bounty Ended&lt;/strong&gt; with Geno Racklin Asher's answer chosen by Community&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Question Protected&lt;/strong&gt; by Community&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Notice added&lt;/strong&gt; Improve details by TheBitByte&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Bounty Started&lt;/strong&gt; worth 50 reputation by TheBitByte&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-15T21:42:44.570" Title="What are the &quot;Notices&quot; in this question's revision history?" Tags="|support|specific-question|" AnswerCount="0" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10601" PostTypeId="2" ParentId="2140" CreationDate="2016-11-16T00:18:05.730" Score="0" Body="&lt;h1&gt;Python Kolmogorov Complexity Golfer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Python is actually pretty good at some Kolmogorov Complexity challenges (compared to other non-golfing languages), from string multiplication being extremely short, to defining variables requiring no types.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to make a program that shortens Python code for Kolmogorov Complexity challenges. You can use anything, not just the usual functions that people typically use.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your score is the sum of all the bytes for each of the ten test cases, and the winner is the submission with the lowest score.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/6043/were-no-strangers-to-code-golf-you-know-the-rules-and-so-do-i&quot;&gt;We're no strangers to code golf, you know the rules, and so do I&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/57277/its-my-birthday-d&quot;&gt;It's my Birthday :D&lt;/a&gt; (Size 5)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/58615/1-2-fizz-4-buzz&quot;&gt;1, 2, Fizz, 4, Buzz&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/4244/code-golf-christmas-edition-how-to-print-out-a-christmas-tree-of-height-n&quot;&gt;Code Golf Christmas Edition: How to print out a Christmas tree of height N&lt;/a&gt; (Size 5)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/64198/99-bottles-of-beer?noredirect=1&amp;amp;lq=1&quot;&gt;“99 Bottles of Beer”&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/99026/build-me-a-brick-wall&quot;&gt;Build me a brick wall!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/74212/quack-the-angry-duck&quot;&gt;Quack the Angry Duck&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/53812/make-the-mexican-wave&quot;&gt;Make the Mexican Wave&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/86986/print-a-tabula-recta&quot;&gt;Print a Tabula Recta!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/88653/print-a-10-by-10-grid-of-asterisks&quot;&gt;Print a 10 by 10 grid of asterisks&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;I don't know about the rules for each challenge, but for this one, you may print extra spaces after each line and extra newlines at the end of the text.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Note&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I don't know how to tag this.&lt;/p&gt;&#xA;" OwnerUserId="59363" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:27.967" LastActivityDate="2016-11-16T00:18:05.730" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10603" PostTypeId="2" ParentId="2140" CreationDate="2016-11-16T06:31:17.937" Score="0" Body="&lt;h1&gt;Fold the number!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a number &lt;em&gt;n&lt;/em&gt;, fold the number as follows: (ex. &lt;code&gt;30&lt;/code&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First, convert it to binary.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;11110&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Add one &lt;code&gt;0&lt;/code&gt; to the start if it has an odd number of digits.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;011110&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now, take the second half of the number, reverse it, and put it under. For example, &lt;code&gt;abcd&lt;/code&gt; would turn into &lt;code&gt;ab dc&lt;/code&gt; (where &lt;code&gt;&lt;/code&gt; is a newline):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;011&#xA;011&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Add one &lt;code&gt;0&lt;/code&gt; to each line if it has an odd number of digits.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0011&#xA;0011&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now take the back of the whole thing and put it on the bottom, reversed:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;00&#xA;00&#xA;11&#xA;11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Keep doing this until there is only one column, and read this from top to bottom.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;00110011&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Convert to decimal.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;51&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Remember, this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the code with the smallest number of bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base-conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; rel=&quot;tag&quot;&gt;base-conversion&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="12537" LastEditorUserId="12537" LastEditDate="2016-11-17T15:12:21.060" LastActivityDate="2016-11-17T15:12:21.060" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10604" PostTypeId="2" ParentId="2140" CreationDate="2016-11-16T07:23:16.520" Score="0" Body="&lt;h1&gt;Enumerate all the binary matrices&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a pair of programs or functions. The first should take a single nonnegative integer, and return some matrix where all elements are 0 or 1 (or true/false). The second should take a matrix of the same form, and return a nonnegative integer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The two programs should form a bijection, so that every possible matrix is mapped to exactly one nonnegative integer, and every integer to the corresponding matrix. The matrix with no elements must be included, but we consider all matrices with no elements as identical (i.e, there is no 0x3 matrix.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To clarify, the dimensions of the matrix is not a separate input. You must work out a way to represent all possible dimensions. For instance, you could start off enumerating them like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 &amp;lt;-&amp;gt; []&#xA;1 &amp;lt;-&amp;gt; [0]&#xA;2 &amp;lt;-&amp;gt; [1]&#xA;3 &amp;lt;-&amp;gt; [0;0]&#xA;4 &amp;lt;-&amp;gt; [0;1]&#xA;5 &amp;lt;-&amp;gt; [1;0]&#xA;6 &amp;lt;-&amp;gt; [1;1]&#xA;7 &amp;lt;-&amp;gt; [0,0]&#xA;8 &amp;lt;-&amp;gt; [0,1]&#xA;9 &amp;lt;-&amp;gt; [1,0]&#xA;10 &amp;lt;-&amp;gt; [1,1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;But you can also enumerate them in some different order, as long as all matrices of all dimensions can be reached eventually.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may output and input the integer as a bigint if your language supports that, or as an unbounded string or array if it doesn't. It should however not be limited to a machine word size. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may output the matrix in any format you choose, as long as the elements of the matrix, and the rows/columns of the matrix are clearly distinguishable. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Whatever output formats you choose, the other program must accept input in the same format. Your functions or programs may opt to print the result rather than return it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard loopholes are forbidden. This is code golf, so the shortest answer wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary-matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary-matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;binary-matrix&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user61264" LastEditorDisplayName="user61264" LastEditDate="2016-11-16T14:56:28.583" LastActivityDate="2016-11-16T14:56:28.583" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10605" PostTypeId="2" ParentId="2140" CreationDate="2016-11-16T15:27:25.077" Score="0" Body="&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You are the owner of a local supermarket, and your cashier doesn't seem to do the work you told him/her to do. He/She is never on time, returns too much change and doesn't really show optimism at the workplace. So you, as the space saving, but ruthless owner opt to replace him/her. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The programm should initially take 2 numbers as input, the first beeing the price, and the second the amount you are paying. If you are paying enough it should output the change in 100,50,20,10,5,2,1 notes, always maximizing the amount of high notes. If you aren't, you may output anything indicating a wrong input.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;cashier 100 500&#xA;4 100&#xA;0  50&#xA;0  20&#xA;0  10&#xA;0   5&#xA;0   2&#xA;0   1&#xA;&#xA;cashier 600 500&#xA;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, so the shortest byte amount wins :) Good luck!&lt;/p&gt;&#xA;" OwnerUserId="62002" LastActivityDate="2016-11-16T15:27:25.077" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10606" PostTypeId="1" CreationDate="2016-11-16T19:08:56.460" Score="5" ViewCount="181" Body="&lt;p&gt;I was working on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/99676/the-logical-quine&quot;&gt;this challenge&lt;/a&gt; when I realised I'd misinterpreted the rules; it wasn't &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, unlike most challenges are. Rather, it was asking for the compiled output of the program to be as small as possible (i.e. the program, when compiled, produces the smallest possible executable). I submitted my golf answer anyway, but it's notable that the challenge has no tags specifying the goal at the moment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not sure if it's worth having a tag for this sort of challenge (there's been a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/smallest-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;smallest-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;smallest-output&lt;/a&gt; proposal before now which is kind-of related, but the previous proposal was unclear). If it isn't, then what sort of tag should the challenge have?&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2020-10-14T07:03:05.680" Title="How to tag &quot;smallest compiled output&quot; challenges?" Tags="|discussion|tags|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10607" PostTypeId="2" ParentId="2140" CreationDate="2016-11-16T19:36:42.880" Score="1" Body="&lt;h1&gt;Lasers &amp;amp; Mirrors&lt;/h1&gt;&#xA;&lt;p&gt;ah lasers. they're a modern marvel. From the most common colors of blue, red, and purple to the more exotic cyan, green, and Occasional yellow. One of the most fascinating properties of lasers is their tendency to travel in a straight line, and bounce off mirrors. What fun! Let's simulate that.&lt;/p&gt;&#xA;&lt;p&gt;consider a square grid of arbitrary size. This grid has four elements, &lt;strong&gt;Mirrors&lt;/strong&gt;, walls, spaces, and a single &lt;em&gt;goal&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;&lt;strong&gt;Mirrors&lt;/strong&gt;:&lt;/h2&gt;&#xA;&lt;p&gt;Mirrors comprise only 2 characters: &lt;strong&gt;/ and \&lt;/strong&gt;. each of them represents a mirror which is reflective on BOTH sides, and is angled at 45 degrees and -45 degrees respectively. If a laser fits a mirror, it will change direction by 90 degrees, as it would in real life. the direction that the laser goes is dependent of the angle of incidence.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;strong&gt;Walls&lt;/strong&gt;:&lt;/h2&gt;&#xA;&lt;p&gt;Walls also comprise of 2 characters: &lt;strong&gt;| and _&lt;/strong&gt;. A wall is simple in that it stops a laser, and ends the beam. The Direction of the wall is irrelevant. | and _ are functionally the same!  If a laser hits a wall before the goal, then the solution is faulty.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;strong&gt;Goals&lt;/strong&gt;:&lt;/h2&gt;&#xA;&lt;p&gt;There is one goal per puzzle input to the program. The goal is represented by a &lt;strong&gt;*&lt;/strong&gt; somewhere on the grid. The objective is to get the laser to pass through the goal from any cardinal direction.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;strong&gt;Spaces&lt;/strong&gt;:&lt;/h2&gt;&#xA;&lt;p&gt;Spaces are the easiest to recognize, as they're any character that's not already mentioned. for the purpose of the puzzle, you can assume that all spaces are &lt;strong&gt;.&lt;/strong&gt; (dots).&lt;/p&gt;&#xA;&lt;h1&gt;Input:&lt;/h1&gt;&#xA;&lt;p&gt;Your input will be a square grid with grid elements and one goal. The grid will always be square, and will always have a goal. grid elements will be entered in a list that is either 1 row tall (eg: the 3x3 example puzzle would be &lt;code&gt;[&amp;quot;.&amp;quot;,&amp;quot;_&amp;quot;,&amp;quot;.&amp;quot;,&amp;quot;|&amp;quot;,&amp;quot;*&amp;quot;,&amp;quot;|&amp;quot;,&amp;quot;.&amp;quot;,&amp;quot;.&amp;quot;,&amp;quot;.&amp;quot;]&lt;/code&gt;) or in a square set of arrays (eg: the 3x3 puzzle would be [&lt;code&gt;&amp;quot;.&amp;quot;,&amp;quot;_&amp;quot;,&amp;quot;.&amp;quot;],[&amp;quot;|&amp;quot;,&amp;quot;*&amp;quot;,&amp;quot;|&amp;quot;],[&amp;quot;.&amp;quot;,&amp;quot;.&amp;quot;,&amp;quot;.&amp;quot;]&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;h1&gt;Output:&lt;/h1&gt;&#xA;&lt;p&gt;Your output will be a number which represents where the laser should be shot from in order to get to the goal. You can see how outputs are numbered below. If there is more than one solution, you may either output any or all solutions.&lt;/p&gt;&#xA;&lt;h1&gt;Examples:&lt;/h1&gt;&#xA;&lt;pre&gt;&#xA; ..9&#xA;0._.8&#xA;1|*|7&#xA;2...6&#xA; 345&#xA;&#xA;Output:4&#xA;&lt;/pre&gt;&#xA;&lt;p&gt;This example shows how a grid will be numbered. it is numbered counter-clockwise  starting in the top left at 0 such as there are 2 numbers for each row and column.The laser is placed at the position of the number and shot in at a multiple of 90 degrees.&lt;/p&gt;&#xA;&lt;p&gt;The correct answer is 4 because the goal is enclosed by walls except where the 4 is located, which the laser gets shot in (in this case up). In the picture below, you see the same puzzle, but numbered correctly, along with another test case.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/2SehU.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/2SehU.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;a href=&quot;https://i.stack.imgur.com/xXO9B.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/xXO9B.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;the directions on each example show the direction of travel for the laser for each number&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a code golf, so the shortest code will win! good luck!&lt;/p&gt;&#xA;" OwnerUserId="60951" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-05T21:57:40.660" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10608" PostTypeId="2" ParentId="10531" CreationDate="2016-11-16T23:07:59.053" Score="7" Body="&lt;h1&gt;Full systems&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This immediately reminds me of: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/90255/given-a-list-of-tetris-moves-return-the-number-of-completed-lines&quot;&gt;Given a list of Tetris moves, return the number of completed lines&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That code-golf question gathered 2 PHP answers, a C answer and a Ruby answer. No golfing languages appeared (although I for one would love to see a golfing language entry).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main reason appears to be that it required multiple related but distinct stages: compression of piece shapes, simulation of game physics, and recognition of completed lines. This is what regular languages were built for, but golfing languages struggle to combine multiple parts; they're optimised for solving individual problems.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An important note is that the tetris challenge was &lt;em&gt;coherent&lt;/em&gt; and &lt;em&gt;fun&lt;/em&gt;. Just gluing challenges together to put golfing languages at a disadvantage is no fun for anybody. It was also flexible in its input and output format, and didn't require specialist functionality (e.g. there was no need to output images, and no need to handle interactivity).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Nothing about the challenge did anything to exclude or even discourage golfing languages; it simply didn't appeal to them.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Or: non-code golf challenges&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The obvious one, as already pointed out by Fatalize, and emphasised by DLosc:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Golfing languages aren't as good at challenges that aren't code golf.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;As a side-note, I really like seeing golfing language answers to any question. They often take a much higher-level approach to problems and there's a lot to learn from reading them. And I say this as somebody who answers here almost exclusively in C. Whoever &quot;wins&quot; the challenge doesn't matter one bit; it's just about having a target to aim for.&lt;/p&gt;&#xA;" OwnerUserId="8927" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-11-16T23:07:59.053" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="10609" PostTypeId="1" CreationDate="2016-11-17T03:09:23.307" Score="8" ViewCount="185" Body="&lt;p&gt;I'd like some feedback on an idea for a new type of challenge that I have, namely Abstract Syntax Tree golfing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code Golfing is a lot of fun. But many of the tricks that get used in a given language are the same for every challenge. I'd like to ask a challenge which, instead of counting bytes, counts pieces of code. &quot;Pieces of code&quot; isn't very specific, so to make it more objective, I will use the size of the abstract syntax tree of the program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This idea has a major problem: Not every language has an abstract syntax tree (e.g. Seeds), and the same program in the same language may be converted to different ASTs by different interpreters or compilers. To solve this problem, my initial challenge will only allow one language, namely Python. Python is chosen because it has a canonical abstract syntax tree for any piece of code, namely the one returned by the &lt;code&gt;ast&lt;/code&gt; module.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The scoring code for this challenge will be as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import ast&#xA;print(len(list(ast.walk(ast.parse(code)))))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that this code gives the desired result in both Python 2 and 3, though a given piece of code may have a different scoring in the two versions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, there are certain types of code which I am worried may trivialize the challenge:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Code execution. &lt;code&gt;exec &quot;stuff&quot;&lt;/code&gt; will do anything in 2 tokens, but it's not very interesting. &lt;code&gt;eval&lt;/code&gt; has the same issue, as well as &lt;code&gt;ast.literal_eval&lt;/code&gt; to a lesser extent, and likely many other functions. I'd like to ban all such functions.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Very long data-tokens. More specifically, I'm worried about very long string and numeric literals. For instance, for the challenge &quot;Print all primes under a million&quot;, I don't want a literal string with a million lines to win. To handle this, I'd like to ban all tokens longer than 15 characters of source code. This also handles worries about code like the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def crazylongfunctionnameitsreallygettingoutofcontrol(): pass&#xA;print(crazylongfunctionnameitsreallygettingoutofcontrol.__name__)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So I'll just ban it all. If code legitimately needs long strings or large numbers, it can build it out of smaller strings or numbers at some overhead.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since I'd like submissions to be fully automatically checked and scored, I'll use Python's tokenize module for this. Code can be found here: &lt;a href=&quot;https://github.com/isaacg1/ast-golf/blob/master/simple_counter.py&quot; rel=&quot;nofollow noreferrer&quot;&gt;simple_counter.py&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I'm thinking of posting the classic FizzBuzz challenge as the first challenge of this type.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;What do people think of this challenge? Would it produce interesting submissions? Interesting winning submissions? Are there other ways to trivialize the challenge that I haven't thought of?&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="20080" LastEditDate="2016-11-17T04:35:18.307" LastActivityDate="2016-11-17T04:35:18.307" Title="Abstract Syntax Tree Golfing" Tags="|discussion|" AnswerCount="0" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="10615" PostTypeId="2" ParentId="2140" CreationDate="2016-11-17T17:31:31.710" Score="-2" Body="&lt;h1&gt;Stump the OEIS!&lt;/h1&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;http://oeis.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS&lt;/a&gt; is a wonderful database of integer sequences, but occasionally, there are code golf problems that generate integer sequences not found in the OEIS.  Your challenge is to write some code that generates a sequence that meets all of the following criteria:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Sequence must not exist in the OEIS.  Prove this by providing a link to the search for your sequence showing 0 results, such as this: &lt;a href=&quot;http://oeis.org/search?q=1%2C2%2C6%2C81%2C35246&amp;amp;language=english&amp;amp;go=Search&quot; rel=&quot;nofollow noreferrer&quot;&gt;1,2,6,81,35246&lt;/a&gt;.  In the spirit of good faith, please do not generate a sequence that is merely an existing sequence offset or multiplied by some constant.&lt;/li&gt;&#xA;&lt;li&gt;The sequence must be non-repeating, non-oscillating, etc.  Formally, there must not exist a subsequence &lt;code&gt;S&lt;/code&gt; with finite length &lt;code&gt;L&lt;/code&gt;, that begins at index &lt;code&gt;I&lt;/code&gt; such that the subsequence from &lt;code&gt;[I+kL]&lt;/code&gt; to &lt;code&gt;[I+(k+1)L-1]&lt;/code&gt; for every &lt;code&gt;k&lt;/code&gt; is identical to &lt;code&gt;S&lt;/code&gt;.  Such an invalid sequence would be &lt;code&gt;0, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, ...&lt;/code&gt; because the subsequence &lt;code&gt;1, 2, 3&lt;/code&gt; beginning at index &lt;code&gt;1&lt;/code&gt; with length &lt;code&gt;3&lt;/code&gt; also exists as the subsequence from &lt;code&gt;4&lt;/code&gt; to &lt;code&gt;6&lt;/code&gt;, from &lt;code&gt;7&lt;/code&gt; to &lt;code&gt;9&lt;/code&gt;, from &lt;code&gt;10&lt;/code&gt; to &lt;code&gt;12&lt;/code&gt;, etc.&lt;/li&gt;&#xA;&lt;li&gt;The sequence must contain a minimum of 3 distinct integers.&lt;/li&gt;&#xA;&lt;li&gt;The sequence must be deterministic, e.g. there must not be any element of randomness in the generation of your sequence.  Every time your program is run, it must provide the same exact sequence.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Please write code that provides as many integers in your sequence as feasible.  At least 20 is recommended, though sequences that grow incredibly fast can provide fewer, provided you also give a proof that your code &lt;em&gt;would&lt;/em&gt; produce that number if given enough time.&lt;/p&gt;&#xA;&lt;p&gt;This will be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; problem, so the entry with the fewest number of bytes wins.&lt;/p&gt;&#xA;&lt;p&gt;A bonus of &lt;code&gt;-20%&lt;/code&gt; can be applied to your score if, in addition to your sequence, you can also provide some mathematical justification for your sequence being included in the OEIS in the future.&lt;/p&gt;&#xA;&lt;p&gt;Standard loopholes are disallowed, as well as sequences that are simply &amp;quot;this sequence is just the handful of numbers I came up with to fit this problem.&amp;quot;&lt;/p&gt;&#xA;" OwnerUserId="60884" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-17T18:45:03.787" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="10618" PostTypeId="2" ParentId="2140" CreationDate="2016-11-17T20:25:22.213" Score="1" Body="&lt;h1&gt;Produce a quine of length &lt;em&gt;n&lt;/em&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program that, given a number &lt;em&gt;n&lt;/em&gt;, produces a quine in your language of length &lt;em&gt;n&lt;/em&gt;. If your language cannot have a quine of that length, it does not need to be generated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/12537&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The quines that are generated must be &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/4877/12537&quot;&gt;proper quines&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Remember, this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the code with the smallest number of bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="12537" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2016-11-18T16:08:58.930" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10619" PostTypeId="2" ParentId="2140" CreationDate="2016-11-17T20:39:30.423" Score="2" Body="&lt;h1&gt;Generate me a QFP chip!&lt;/h1&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/102456/60951&quot;&gt;This challenge is now live!&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;QFP is a type of form factor for an electrical component where pins come out the sides of a chip.  Here are is a picture of a typical QFP component: &lt;a href=&quot;https://i.stack.imgur.com/VF0tx.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/VF0tx.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;you can see that the general formula is to have 4 sides of equal numbers of pins.&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to create a program that takes in an integer, thich represents the number of pins on one side, and creates an ASCII QFP component with numbered pins.&lt;/p&gt;&#xA;&lt;h2&gt;Input:&lt;/h2&gt;&#xA;&lt;p&gt;a single integer which represents the number of pins on one side&lt;/p&gt;&#xA;&lt;h2&gt;Output:&lt;/h2&gt;&#xA;&lt;p&gt;An ascii QFP chip with an apropriate pinout.&lt;/p&gt;&#xA;&lt;h2&gt;Example:&lt;/h2&gt;&#xA;&lt;p&gt;input:1&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;  4&#xA; ┌┴┐&#xA;1┤ ├3&#xA; └┬┘&#xA;  2&#xA;&lt;/pre&gt;  &#xA;&lt;p&gt;input:2&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;  87&#xA; ┌┴┴┐&#xA;1┤  ├6&#xA;2┤  ├5&#xA; └┬┬┘&#xA;  34&#xA;&lt;/pre&gt;&#xA;&lt;p&gt;input:12&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;   444444444333&#xA;   876543210987&#xA;  ┌┴┴┴┴┴┴┴┴┴┴┴┴┐&#xA; 1┤            ├36&#xA; 2┤            ├35&#xA; 3┤            ├34&#xA; 4┤            ├33&#xA; 5┤            ├32&#xA; 6┤            ├31&#xA; 7┤            ├30&#xA; 8┤            ├29&#xA; 9┤            ├28&#xA;10┤            ├27&#xA;11┤            ├26&#xA;12┤            ├25&#xA;  └┬┬┬┬┬┬┬┬┬┬┬┬┘&#xA;   111111122222&#xA;   345678901234&#xA;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;all QFP chips must be enclosed and sealed as well as ascii provides. spacing is of utmost importance.&lt;/li&gt;&#xA;&lt;li&gt;pin numbering must be done as in the examples (Read left to right, top to bottom, numbered counter clockwise)&lt;/li&gt;&#xA;&lt;li&gt;You may start numbering at 0, but this must not affect the chip (an input of 12 still needs 12 pins per side)&lt;/li&gt;&#xA;&lt;li&gt;The only valid characers in your output are &lt;code&gt;1,2,3,4,5,6,7,8,9,0,┌,┴,┐,├,┘,┬,└,┤&lt;/code&gt;, spaces, and newlines.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is a codegolf, and as such, The code with the least number of bytes wins! Good Luck!&lt;/p&gt;&#xA;" OwnerUserId="60951" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-07T20:55:57.787" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10620" PostTypeId="2" ParentId="2140" CreationDate="2016-11-17T21:25:50.137" Score="0" Body="&lt;h2&gt;Postman's Sorting&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You are a postman, and you have to walk down a street, delivering letters. Odd-numbered houses are on the left, and even-numbered houses are on the right.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you had to end up back at the beginning of the street, it would be easy: simply deliver the odd letters in ascending order and the even letters in descending order.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Instead, you need to finish at the end of the street. But you can't simply deliver the letters in ascending house number order, because you would have to cross the street so often. You need to optimise the order to minimise the number of street crossings.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a set of positive integers as input, your program or function should output an ordered array giving the optimal delivery sequence. You need to consider the houses in pairs: 1,2; 3,4; 5,6 etc. There are a number of cases:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If you have no letters for a pair of houses, you simply ignore them.&lt;/li&gt;&#xA;&lt;li&gt;If you have letters for only one of a pair of houses, you have no choice, you must visit that house.&lt;/li&gt;&#xA;&lt;li&gt;If you have letters for both houses in a pair, then you want to visit the house on the same side as the house you just visited first, then cross and visit the other house.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Example: If you have letters for houses 6, 2 and 5, then you want to deliver them in the order 2, 6, 5, so as to avoid crossing the street a second time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[Further test cases as needed to clarify comments arising while the question is in the Sandbox.]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2016-11-17T21:25:50.137" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10625" PostTypeId="2" ParentId="8350" CreationDate="2016-11-18T16:24:21.350" Score="-5" Body="&lt;h1&gt;Remove the Title length limit&lt;/h1&gt;&#xA;&lt;p&gt;Since we aren't asking questions, it doesn't really make sense that our titles have a minimum length.  Let's remove it.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-18T16:24:21.350" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10626" PostTypeId="2" ParentId="2140" CreationDate="2016-11-19T06:41:53.707" Score="2" Body="&lt;h1&gt;Find the optimal sorting network&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot;&gt;sorting&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Sorting_network&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sorting networks&lt;/a&gt; are an abstract model of &quot;wires&quot; carrying numbers, which outputs them sorted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A comparator in a sorting network works as follows:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/iHWno.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/iHWno.png&quot; alt=&quot;https://en.wikipedia.org/wiki/File:Sorting-network-comparator-demonstration.svg&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is the optimal sorting network for 4 numbers:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Kqpln.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Kqpln.png&quot; alt=&quot;https://en.wikipedia.org/wiki/File:SimpleSortingNetworkFullOperation.svg&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since there are two kinds of &quot;optimal&quot; sorting networks people care about, we are going for the least number of comparators (those vertical lines).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Given a non-negative integer &lt;code&gt;n&lt;/code&gt; (so yes, 0 and 1 need to be supported), output a list of comparators which designates an optimal sorting network for &lt;code&gt;n&lt;/code&gt; inputs. The &quot;comparators&quot; are a pair of indices which say which indices in the working array to compare / swap. The indices must be 0-based.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So for the example sorting network, this would be a valid output (viewing 0 as the top wire):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(0, 2), (1, 3), (0, 1), (2, 3), (1, 2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As would this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(0, 2), (1, 3), (2, 3), (0, 1), (1, 2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Additionally, any whitespace is ignored (except for tokenizing), and any non-digit is considered whitespace, so this is also a valid output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 2 1 3 2 3 0 1 1 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And also:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(0, 2)&#xA;(1&#xA; 3)&#xA;((2, 3, 0), 1)&#xA;(1, 2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Furthermore, functions may simply return some iterable that - when flattened - gives the list of numbers in the correct order.&lt;/p&gt;&#xA;" OwnerUserId="9498" LastEditorUserId="9498" LastEditDate="2016-11-20T06:27:37.450" LastActivityDate="2016-11-20T06:27:37.450" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10629" PostTypeId="2" ParentId="10457" CreationDate="2016-11-20T04:14:04.853" Score="-12" Body="&lt;p&gt;While the debate regarding the showcase's ontopicness is still open, the majority of the community seems to agree – as do we moderators – that it is too broad for our scope. As a result, I have closed and locked the challenge in question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, that means that we do not have a place for showcasing languages right now, and we should seek one as soon as possible. Leaving the challenge open would only slow this process down and – as I have said in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10475/12012&quot;&gt;my previous answer&lt;/a&gt; – the showcase itself will benefit from a more suitable format.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2016-11-20T04:14:04.853" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10631" PostTypeId="2" ParentId="2140" CreationDate="2016-11-20T12:22:33.477" Score="0" Body="&lt;h2&gt;Procedurally Generate a Dungeon&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;generation&amp;#39;&quot; rel=&quot;tag&quot;&gt;generation&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/maze&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;maze&amp;#39;&quot; rel=&quot;tag&quot;&gt;maze&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;It's time to make the new Rogue!&lt;/p&gt;&#xA;&lt;p&gt;Given no input, output a (randomly) procedurally generated dungeon with a start and an end. It must be possible to get from the start of the dungeon to the end.&lt;/p&gt;&#xA;&lt;p&gt;Elements may include: (but are not limited to)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Key&lt;/li&gt;&#xA;&lt;li&gt;Lock (requires key to pass)&lt;/li&gt;&#xA;&lt;li&gt;Boss&lt;/li&gt;&#xA;&lt;li&gt;Miniboss&lt;/li&gt;&#xA;&lt;li&gt;Test&lt;/li&gt;&#xA;&lt;li&gt;Reward&lt;/li&gt;&#xA;&lt;li&gt;Multi-key&lt;/li&gt;&#xA;&lt;li&gt;Multi-lock (requires &lt;code&gt;n&lt;/code&gt; multi-keys to pass)&lt;/li&gt;&#xA;&lt;li&gt;Nothing&lt;/li&gt;&#xA;&lt;li&gt;Boolean switch - switch can toggle when inside this room&lt;/li&gt;&#xA;&lt;li&gt;Boolean gate A - only opens when switch is off&lt;/li&gt;&#xA;&lt;li&gt;Boolean gate B - only opens when switch is on&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The output format does not matter as long as:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The types of room is present&lt;/li&gt;&#xA;&lt;li&gt;The 2D spacial connection is present&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Sandbox Notes:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this idea somewhat supported?&lt;/li&gt;&#xA;&lt;li&gt;At the moment this is very unclear (at least to me). What should I add to make it more obvious what it is programs should do?&lt;/li&gt;&#xA;&lt;li&gt;Creativity - the bane of the objective winning criteria. I hope to at least make it obvious whether an answer is valid.&lt;/li&gt;&#xA;&lt;li&gt;Too broad? I hope not because I tried to make all dungeons solvable.&lt;/li&gt;&#xA;&lt;li&gt;Simple answers shouldn't be upvoted and answers that output nice dungeons should be.&lt;/li&gt;&#xA;&lt;li&gt;Should answers have to include the critical path? That might ramp up the complexity and isn't really required apart from making sure it's valid.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="32686" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-20T12:22:33.477" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10632" PostTypeId="1" AcceptedAnswerId="10633" CreationDate="2016-11-20T17:11:45.070" Score="1" ViewCount="79" Body="&lt;p&gt;I want to know briefly about this statement:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;&quot;The intention is that each answer shall contain one and only one loophole&quot;&lt;/a&gt;  &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Does this means we are allowed to use one loophole (of any kind) in one answer?&lt;/p&gt;&#xA;" OwnerUserId="17120" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2016-11-20T18:11:02.430" Title="What does &quot;The intention is that each answer shall contain one and only one loophole&quot; mean?" Tags="|discussion|support|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10633" PostTypeId="2" ParentId="10632" CreationDate="2016-11-20T17:29:34.267" Score="3" Body="&lt;p&gt;No, you're not allowed to use any loopholes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;Answer&quot; in that sentence refers to answers to that very meta post. The sentence simply means that &lt;em&gt;when answering the linked meta post&lt;/em&gt; that you should only propose one loophole in your answer, so that loopholes can be voted on independently.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-11-20T17:29:34.267" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10635" PostTypeId="2" ParentId="10632" CreationDate="2016-11-20T17:38:54.480" Score="1" Body="&lt;p&gt;That post is a list of things that are &lt;em&gt;not allowed&lt;/em&gt; in answers by default. This is because these are things that have already been done before and they just aren't funny anymore.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The way that post works, is if you think a certain loophole should be banned, you post it as an answer on that thread. Then, other users will vote on it to see if they agree it should be banned. The phrase&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&quot;The intention is that each answer shall contain one and only one loophole&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Means you should only propose a single loophole to be banned. If you were to propose multiple loopholes in a single answer, other users might agree with one loophole but not the other. This way, voting is easier. &lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2016-11-20T17:38:54.480" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10636" PostTypeId="1" AcceptedAnswerId="10637" CreationDate="2016-11-20T21:35:24.847" Score="28" ViewCount="488" Body="&lt;p&gt;The current &lt;a href=&quot;https://codegolf.stackexchange.com/questions?sort=votes&quot;&gt;second highest-voted&lt;/a&gt; PPCG question, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44680/showcase-your-language-one-vote-at-a-time&quot;&gt;Showcase your language one vote at a time&lt;/a&gt;, was recently &lt;a href=&quot;https://codegolf.stackexchange.com/help/closed-questions&quot;&gt;put on hold&lt;/a&gt; for being too broad and locked as historically significant for reasons explained &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10629/26997&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Should the question be unlocked and reopened so people can continue to add and update answers and keep showcasing languages?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A discussion on locking/closing the Showcase took place here: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10457/proposal-to-lock-the-language-showcase-as-historically-significant&quot;&gt;Proposal to lock the Language Showcase as historically significant&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that currently the two highest voted answers to that meta discussion make the major points that&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10459/26997&quot;&gt;The showcase is not an optimal solution, but it's the best we have for now.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10467/26997&quot;&gt;The showcase is part of a unique category of pop-cons that should be on topic.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;which both seem to go against the idea that it should have been closed in the first place.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Be aware that I'm the one who originally wrote the Showcase challenge.)&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2016-11-22T17:49:32.000" Title="Should &quot;Showcase your language one vote at a time&quot; be unlocked and reopened?" Tags="|discussion|specific-question|scope|closed-questions|reopening|" AnswerCount="5" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="10637" PostTypeId="2" ParentId="10636" CreationDate="2016-11-20T21:35:24.847" Score="23" Body="&lt;h1&gt;Yes, Unlock and Reopen&lt;/h1&gt;&#xA;&lt;p&gt;At least until we arrive at a more clear concensus on what to do with it, if anything.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-20T21:35:24.847" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10638" PostTypeId="2" ParentId="2140" CreationDate="2016-11-20T21:43:19.377" Score="1" Body="&lt;h1&gt;Find the Mersenne Twister seed &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a sequence of &lt;strong&gt;N&lt;/strong&gt; 32-bit unsigned integers, find a 32-bit seed for the &lt;a href=&quot;https://en.wikipedia.org/wiki/Mersenne_Twister#Algorithmic_detail&quot; rel=&quot;nofollow noreferrer&quot;&gt;Mersenne Twister PRNG&lt;/a&gt; (specifically, MT19337) such that the first &lt;strong&gt;N&lt;/strong&gt; 32-bit unsigned integers produced are the input sequence.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Solutions will be tested and timed on a free &lt;a href=&quot;https://c9.io/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cloud9&lt;/a&gt; workspace (512 MB RAM, 1 8-core CPU). Full CPU specifications can be found in &lt;a href=&quot;https://gist.github.com/Mego/aa84d3706bf7414f2aa6409512076417&quot; rel=&quot;nofollow noreferrer&quot;&gt;this Gist&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;There will be 50 sequences used to time solutions, each containing at least 20 and at most 50 integers. All sequences will be generated using CPython 3.4's MT19337 implementation (the source code can be found &lt;a href=&quot;https://github.com/python/cpython/blob/3.4/Modules/_randommodule.c&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Brute force (by way of iterating through all possible seeds) is not allowed, as it would take an obscene amount of time to run all 50 timing cases with such a solution.&lt;/li&gt;&#xA;&lt;li&gt;Hard-coding seeds is not allowed, as it undermines the point of this challenge.&lt;/li&gt;&#xA;&lt;li&gt;I reserve the right to change the timing sequences to different sequences of similar complexity if needed, such as in the event that two seeds are found for the same sequence.&lt;/li&gt;&#xA;&lt;li&gt;Please include instructions on how to run your solution, including installation instructions for any software that is not included with a standard Ubuntu installation.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Note that the seeds given may not be the only seeds which produce the given sequence (if other seeds are found, please let me know). These smaller test cases are provided for verification purposes only, and will not be used for scoring.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[859552199, 418371998] -&amp;gt; 765976290&#xA;[3575669016, 3345750943, 1425199743, 3641622143, 468413882, 1201820413, 440223465, 4032367274, 1303769163] -&amp;gt; 3089232394&#xA;[3301913871, 2465802243, 3612732284, 2327984155, 3125193467, 1186355054, 3586515345, 1676699096] -&amp;gt; 3317482306&#xA;[1187719129, 4252341260, 3652285377, 2546267472, 259146681, 3132024105] -&amp;gt; 618872552&#xA;[567043356, 3386297553, 3291980436] -&amp;gt; 2064328469&#xA;[2371812852] -&amp;gt; 3402334589&#xA;[2169144927, 1612138200, 2367065602, 3106703576, 3360699020, 2044583150] -&amp;gt; 1508970517&#xA;[4264152408, 93510901, 2140553491, 2298459244, 3988997159] -&amp;gt; 3805008435&#xA;[815695699, 3390998580, 1837233431, 35472600] -&amp;gt; 1298560578&#xA;[2785297506, 692193253, 1505379580, 2810620241, 2299478120, 233996693] -&amp;gt; 1856467397&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Timing Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;These are the 50 sequences, along with the respective seeds that produced them, that will be used for scoring solutions. Once again, if any other seeds are found that produce the given sequence, please let me know.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[3626764237, 1654615998, 3255389356, 3823568514, 1806341205, 173879092, 1112038970, 4146640122, 2195908194, 2087043557, 1739178872, 3943786419, 3366389305, 3564191072, 1302718217, 4156669319, 2046968324, 1537810351, 2505606783, 3829653368, 3900315155, 938204377, 2167613558, 598176026, 1210484339, 600203567, 3246154361, 407295012, 2655874620, 3433407905, 1075916535, 4240245955, 3907330410, 2287343378, 4221031477, 3028691745, 3479856542, 2585149702, 3874773259, 631194409, 1332073689, 424185324, 3134603515, 316721330] -&amp;gt; 0&#xA;[3393124633, 2450474977, 1966463085, 3673681320, 1729202683, 1167867720, 325264180, 3917283871, 100160351, 791524511, 2930202830, 3113143968, 1502082504, 1809749915, 418618347, 1516663034, 578608165, 3127414055, 3472262548, 308161377, 135281507, 4131277967, 3953099834, 1042116387, 1985078128, 1789355090, 2975834429, 2756451880, 1853842973] -&amp;gt; 80552670&#xA;[3501423986, 1904817736, 3722254077, 4209805889, 624241735, 3072497443, 3348948634, 948724253, 2775088165, 653145320, 699931897, 2271688288, 965327734, 3611254581, 4021716510, 3489649715, 590896686, 2492882151, 2449284001, 1709766651, 2373030892, 1906330141, 3281376004, 542155191, 654946082, 3866707349, 675539429, 3153689518, 2192976919, 2369760520, 1789539597] -&amp;gt; 123863960&#xA;[161627675, 758641073, 3882484966, 1142624247, 4128058828, 2063104815, 1532506610, 4133456839, 2543581728, 18178196, 2276191025, 6278001, 3128406689, 2146406812, 39141315, 1050571803, 2511216100, 2411368419, 3269811767, 815334548, 3812711899] -&amp;gt; 178693462&#xA;[1006603821, 2040840228, 2217261808, 3301867033, 3944952417, 1692780898, 40334807, 2573488161, 1195239502, 1063781197, 758636410, 1944506134, 1022411961, 3709537934, 175021745, 3183030828, 1196557078, 11946672, 1551403327, 4143434962, 3283348277, 1825370082, 2293735756, 429108850, 745523037] -&amp;gt; 227497455&#xA;[2252079699, 1086590868, 525211993, 209343944, 1861419840, 2057307759, 2083384643, 2590024292, 4135416707, 3508386594, 1358765199, 3089076939, 3719484781, 516962076, 4107295833, 723033883, 1857756581, 434940583, 919038598, 2441529245, 1687894943, 13982251, 1940221612, 220848786, 1518435648] -&amp;gt; 260282679&#xA;[1821793358, 3054510267, 1906284293, 3380915352, 2593544407, 3915598365, 216223976, 4179796969, 2252681786, 35956624, 2373486206, 877849443, 3555235079, 3667331109, 2387597923, 2892840935, 1697182374, 4016309999, 3498537950, 2841634562, 3522184350, 1705717875, 4162597164, 2056807023, 2211204973, 3267303967, 3919558114] -&amp;gt; 325889376&#xA;[1201670212, 746140380, 1320204973, 751872422, 3310421711, 1963946901, 625374447, 2435010607, 3055683554, 3426449636, 4008426547, 337682689, 4056318014, 2315028303, 3896431367, 3153777187, 595649858, 3945299365, 113301178, 437820390, 2219035549, 284287245, 3156511236, 3954981533, 599197497, 3946167954, 3728124202, 733618224, 2033404503, 2973733622, 2705618778, 3966553008, 4036118888] -&amp;gt; 389267947&#xA;[1910148876, 4015517082, 1214608849, 988091919, 2525094197, 81939600, 3978887728, 2847303411, 66064807, 3605598571, 819502713, 233898591, 1970756897, 2621444751, 213250142, 3439913424, 1332746382, 4063692407, 869169264, 660008864, 2526902458, 3155477426, 1686496804, 3877857092, 4248058769, 2220603751, 465407251, 3418337662, 362811108] -&amp;gt; 424148743&#xA;[2663034465, 347641133, 1266329350, 494434286, 24416336, 1697535896, 233051569, 1134030615, 821790629, 1645020605, 2310228737, 63596966, 3832219398, 465243130, 4070794284, 1062758865, 2070536142, 2272514237, 440192702, 3490367376, 3000125608, 1175130963, 339129292, 1200804986, 3560746354, 1043913893, 489469329, 3588157041, 415367051, 1506938118, 519839008, 3921307375, 1017013313] -&amp;gt; 481818733&#xA;[2125426152, 580419999, 1942656966, 733532664, 1002041383, 4276401064, 3164003602, 1600445806, 87486541, 585241213, 1822489492, 3670405099, 2371866217, 293071217, 1698095716, 2860716495, 4096732631, 860271933, 1698519068, 1453446230, 2296564613, 1034887983, 3124580892, 3613882243, 3142206150, 1201496338, 262241539, 2658580629, 75299337, 1543495990, 1079614000, 1988996951, 1393947112, 3686457188] -&amp;gt; 503218192&#xA;[849928291, 3109119200, 641398141, 953565598, 1651963094, 2973763708, 2409024299, 2638872282, 3438675501, 2024561790, 2574711112, 2224233243, 2145875524, 2483785498, 832036542, 2756591965, 804169437, 1610259885, 1727659540, 3804671151, 2651460465, 3679117113, 3392652401, 4291100134, 3315401681, 4150630548, 3255282492, 1793428708, 4213220288, 1275054855, 3395683809, 126422719, 747072718] -&amp;gt; 529806420&#xA;[3795382423, 2318193600, 2941259533, 1429473204, 3841712189, 908410440, 2163447895, 2266401416, 1962272288, 2172290597, 903602965, 2493475709, 1557270830, 1269693466, 1882416966, 1675172531, 2727910931, 67882201, 982110502, 922191612, 1147478737, 1527639226, 1162436584, 3427111171, 1012039523, 775426178, 2235111095, 838473449, 3547292154, 2331447259, 2482093779, 3522096001, 978885775, 911597256, 4199754157, 884328339, 3958245046, 3701693539, 2205845644, 737996384] -&amp;gt; 594670421&#xA;[2281257517, 3184614238, 760843542, 2349085191, 3946149756, 3843515781, 357391440, 280771960, 1523563345, 1988608601, 3428233753, 100999796, 1858706576, 3053822297, 2013347998, 2869736987, 3049191880, 2683304507, 2165662057, 1644801829, 3174344328, 516799881, 2817748912, 680940874, 60488796, 440310808, 4238771580, 3333869324, 3437732706, 2291819087, 2904810286, 643100619, 2444662123, 2814934785, 3198564042, 3050641347, 2644737611, 1044358220, 2729428974, 2696207835, 1949284287, 2602160488, 4077269219, 843097934] -&amp;gt; 608761482&#xA;[2459044101, 3628291690, 21901316, 1607776779, 574126446, 2632595613, 1898457307, 1993218217, 2268071755, 2262630078, 1334308000, 2756814507, 1322265974, 493521136, 3513003023, 1998755513, 501729387, 461623974, 2703701229, 3074392802, 2895338933, 1257991758, 1147599903, 2188879650, 2802233695, 1049885503, 67969151, 3855902849, 1481701505, 2592817148, 3215907335, 3924969407, 91996333, 857125517, 3408363147, 4006870634, 998389513, 1316925910, 1621658875, 2583060764, 3809067813, 4122609293, 3970592027, 529557207, 1717219729, 2504378950, 418151974, 1944676036, 4136632810, 2747386509] -&amp;gt; 672575322&#xA;[58833619, 2580439730, 3693390914, 2286941505, 2380251005, 860188183, 1775128121, 1286129564, 1885665593, 2208299577, 4157266729, 3426550994, 3918528183, 4277973044, 3399609402, 1027156209, 2127983039, 4014806283, 1680366681, 2338809246, 2450101289, 2369487851, 2470761981, 4146252501] -&amp;gt; 758102662&#xA;[1228778451, 3161629785, 956090791, 2661866534, 3797423759, 387813121, 686718911, 1671912681, 3122216050, 3708361254, 2450007821, 562470295, 2371567740, 594715145, 1539207036, 1044745741, 3799733486, 3957279143, 3072889407, 43156136, 564713293, 3478075046, 3706967146, 3687044887, 992776898, 3807405066] -&amp;gt; 829276193&#xA;[4181681092, 472808862, 2820379353, 1971138909, 957029949, 383690688, 1619203644, 40060279, 799380031, 2522476881, 3052161194, 1101783645, 550394884, 1003243703, 1139176364, 637909704, 1746995412, 3569010375, 2962331845, 1221693446, 1622613434, 2503259347, 1956882342, 3173044265, 1239439145, 842693462, 2538205226, 2451274505, 4212820092, 3591867315, 1233020299, 978021001, 3148810648, 1811827712, 2638973530, 815364991, 1169900461, 1109925685, 856009157, 3254416301, 2037813477, 3945026418, 1535198958, 4259784019, 573350683, 1682977388, 1817703645, 2576589136] -&amp;gt; 898248134&#xA;[3182465441, 38281954, 424174823, 2654611156, 2877159272, 723093605, 1443837986, 3392781854, 2463922103, 4286449851, 538962217, 2130457280, 2178815165, 3486677232, 4058242555, 491907811, 162839736, 1759357975, 870141283, 1495756753, 1216746993, 1937724479, 1514235325, 4184006461, 3436845854, 2401877503, 610797147] -&amp;gt; 913459250&#xA;[1149034119, 2642531102, 1662163608, 3290983280, 819699523, 515983953, 2696922239, 2166479741, 1179733281, 2022256392, 1626594590, 543353369, 3692263091, 2392093428, 4014491227, 1041518429, 1713650051, 3538550903, 3376348599, 4277108217, 2867735513, 82177527, 10764183, 2126826329, 1028783725, 2271873691, 213268477, 2609718986, 3495904404, 913207638, 1265558725, 2980124058, 303469040, 253105205, 495410356] -&amp;gt; 931867201&#xA;[1077541173, 465200833, 3196368211, 1288748206, 2815478016, 1065298665, 2884065004, 392702413, 3587996620, 2894220485, 3226548573, 145951050, 956741233, 2456765795, 3978933657, 1007424556, 2169150234, 3651822773, 1565891297, 510586439, 2219790712, 422126653, 1640535295, 2992880885, 3691821384, 1555208492, 2642710071, 2625348100, 578265950, 592730275, 2092195932, 2504727970, 2149376041, 3179917702, 141987426, 2680075044, 656985656, 2153196909, 4149347932, 2216899428, 2639954700, 3190665042, 2786390314, 2974431514, 1505784370, 3602363995, 1699665616, 327189341, 335160466] -&amp;gt; 945442081&#xA;[1284631810, 3717268552, 2270237312, 1334241593, 1477854231, 3138477902, 3837857694, 3586498067, 1959233909, 3891506078, 2756512687, 2553842301, 964459746, 1395510385, 1185295577, 3096625618, 3145085801, 2953203657, 412902939, 3850708910, 2893328412, 2046860068, 86811187, 1188173782, 1294786028, 3044338056, 1040690464, 2128428491, 2571424043, 467837042, 3752155615, 4020048256, 3119445970, 2240289832, 1491368301, 3651270856, 2456196179, 378459336, 188104463, 777143930, 1824526143, 4060407078, 3866701738] -&amp;gt; 1005490735&#xA;[329511653, 2198540059, 2154958918, 378488687, 1460553211, 2529097663, 2295211009, 68583162, 1430570391, 1601101442, 1075009348, 2795773614, 833830658, 903181786, 633114581, 3292534356, 3245176784, 2582500259, 3943169203, 1130082435, 3079387854, 3150805871, 1721482617, 2291158702, 3225790458, 1468813727, 862011357, 4268175908, 3661137987, 464141661, 3956758980, 353701536, 1341361227, 809582799, 3968372465, 4111098095, 2898048807, 1509470117, 3255194829, 1330296075, 3520527115, 3736908846, 168999059] -&amp;gt; 1056211089&#xA;[1981947965, 3374825360, 3953254353, 1846368367, 1512467473, 3858309918, 4274851313, 787575622, 1876080592, 73919936, 3951066372, 730226758, 3289279637, 768907525, 1773361296, 821210337, 823248190, 869737395, 1360958003, 37854528, 426098214, 2732039516, 64754302, 3276807872, 3816769165, 991587659, 2262236344, 2500333010, 544193426, 1576372318, 2228843007, 2361635236, 2149913894, 3651360213, 2399010654, 4269441712, 1500948518, 3962883634, 1885037482, 2608182179, 3516218188, 513897987, 4242749462, 3892663321, 3922003874, 2123606394, 1383207752, 2867973529, 3840556114, 2969243741] -&amp;gt; 1071722183&#xA;[2514263486, 742731713, 3234620175, 3101660088, 2571087369, 3985627296, 3534135449, 2957356517, 2720311929, 2985074784, 2621199558, 3407431088, 2711831197, 1247421057, 3794320157, 1180925811, 1569942151, 2629267152, 173488457, 1406704148, 3969219352, 291552269, 1333806964, 2203738485, 1554560925, 496218017, 1379546509, 2539796280, 4118468566, 2328295795, 884528669, 123600717, 1597383076] -&amp;gt; 1093875318&#xA;[1521547521, 982639096, 3108583938, 3860926389, 1477036165, 2087376039, 953332718, 1432039007, 836148138, 3081500185, 396473811, 1621365414, 3796659618, 3939606659, 4248871833, 2917576264, 2729341943, 2981171481, 2311970081, 150264587, 2215220955, 995666639, 452785817, 758560294, 2134005122, 39617150, 1283053470, 4198921194, 2492185018, 595457083, 1042642207, 545670342, 4068770955, 749869737, 984770127, 663196981, 1849907933, 1443537561, 3860175505, 1016163998, 3260982442, 3769639327, 2728953690, 1556597597, 1877966580] -&amp;gt; 1155984918&#xA;[1198705327, 1935517658, 503589232, 1577874702, 627636752, 3338218922, 1157893341, 3491377096, 158028724, 2472091015, 1488124620, 2401465711, 3064309912, 1501000204, 3549612642, 2584717560, 1744885213, 4114571438, 1885581118, 2912594621, 3206412254, 4218195409, 2855464167, 2517461088, 685010709, 2000660923, 3562767265, 1193468772, 1470300123, 819551295, 2007863203, 980161306, 717575858, 2022655390, 1011703442, 1190149434, 182438707, 4158211886, 2175561856, 3060913999, 1239412823, 2397907962, 3942897187, 2435381198, 4007365042, 1591831562, 1664232451] -&amp;gt; 1198085477&#xA;[3487615865, 4016084043, 1447817513, 2774535999, 1987172957, 3906060658, 3082008686, 88752056, 1947416015, 3376238098, 3503927625, 342228658, 2709452172, 1070052314, 3791872618, 1290870698, 587900606, 1133043554, 671196454, 3876594873, 526665632, 165876551, 3122917378, 4053700531, 1298948490, 1351144611, 563691115, 322287271, 2461185743, 3663527460, 4222266716, 3553092834, 4168116886, 1291668088, 2033147092, 17653398, 3675413239, 2758765766, 2242336270, 734645239] -&amp;gt; 1234710497&#xA;[4199109099, 1728109096, 1057011054, 312030739, 490158329, 2571270959, 1337574406, 3037342898, 2943362559, 468588625, 1215641907, 891368463, 3446982561, 146537280, 1406572684, 1996341215, 1239450385, 3239123491, 2654855274, 584040319, 664433665, 3282777560, 3498456462, 398718226, 3318895203, 4109932784, 435092929, 3761442422] -&amp;gt; 1281039914&#xA;[330441100, 3682376585, 1548511518, 1012361554, 1641750013, 1347050521, 2746331107, 363031882, 3664742187, 263887825, 3045968855, 4047861721, 4201376344, 2013802400, 43925321, 2057073856, 974221675, 1240944962, 3823005386, 3154676709, 1649841356, 3211264096, 355417272, 2640980835, 2706339938, 987877841, 110633642, 4200784138, 3756125284, 471091914, 3370617977] -&amp;gt; 1307906352&#xA;[3242988428, 4255969082, 867271806, 415292052, 3609803438, 416630352, 3232953772, 4269951801, 350204559, 4181264343, 2332795572, 2668659134, 2628956236, 3596517643, 2454368561, 1369266677, 3672701863, 388613580, 1479812495, 2141142524, 2486572053, 2320908196, 393062185, 1938229604, 231136143, 1626064567, 1493467817, 1983339349, 894785483, 44315897, 1514887732, 1864793575, 3953707615, 3492718672, 3522516821, 289358385, 2227856486, 256540739, 4213343606, 200728817, 3396994332, 3845507785, 220892851] -&amp;gt; 1358830177&#xA;[3696325595, 95369954, 135918350, 487636311, 825705453, 3049392697, 841126004, 1979734631, 507462131, 1964376824, 3031319264, 3487421046, 2192402845, 3792297163, 3808487536, 1516405605, 664293073, 613658148, 4063050354, 1921745034, 2258497732, 3473698642, 3256102715, 1916456581, 1185919167, 3315712023, 2955859300, 1784025278, 2641317925] -&amp;gt; 1394873382&#xA;[2775177776, 3943074566, 1008831348, 423577731, 2936039382, 3419907541, 3346657170, 1767888023, 2549910502, 1510292917, 609091982, 3619041655, 1071140841, 4210891014, 4197129534, 4002247218, 1785145415, 773140313, 850187206, 3695148850, 1699963321, 2029501148, 2273345989, 2045294772, 2490424114, 3670522622, 1903814852, 2845243988, 547217989, 814736327, 1178316093, 3421797242, 583834194, 560861293, 1728122240, 1143281622] -&amp;gt; 1418337751&#xA;[3909221229, 1543378013, 3578599386, 1821301593, 382025872, 3090149061, 2799832135, 2969167740, 3214053618, 2459088339, 61851869, 2988154510, 3405155263, 1143312722, 3055626916, 1306722473, 2424970867, 3838250998, 2541260784, 3634562987, 91009990, 228167376, 144739158, 69758376, 1416179539, 175832649, 1058618668, 3141319060, 2603813691, 3448922532, 3563483339, 2187253777, 3939459963, 729053170, 348198400, 2818894106, 4163690148, 4269596985, 1550179869, 2888474224, 977138852, 2267335031, 1039633247, 331897176, 3493431132] -&amp;gt; 1440945260&#xA;[548460784, 2008846553, 4095226690, 2537987040, 1412322911, 295388541, 388770296, 2073124976, 4254588769, 2032785043, 3714052855, 653890260, 3378524009, 4169809326, 1850329785, 2009334592, 2701527530, 260935905, 1081271463, 3349408130, 187425716, 588199859, 1037983019, 3586620795, 4254384458, 3345512384, 1424865889, 1577623131, 3897199153, 2727265103, 3204931862, 4089210973, 1909632078, 3588030047, 1946727191, 502364265, 2290334448, 2873594561, 1542446006, 3459132329, 4292608386, 3741690622, 165647068, 1253913368, 1993997790, 2812680991, 2352267270] -&amp;gt; 1500826128&#xA;[888893887, 2614777345, 2033163377, 4036989271, 3569896418, 1268962278, 1146226964, 107044610, 2147272927, 3436615686, 1202308143, 1325516848, 2994121867, 973196789, 3793281340, 3099942299, 2472036270, 1798140896, 2858254867, 2204354371, 3472459738, 826142039, 4066377434, 2519409484, 1777413266, 3493671143, 551412865, 886786197, 3882384707, 1172607108, 636563066, 190968362, 3994307050, 3757375918, 2755608252] -&amp;gt; 1566530912&#xA;[2820693508, 1716694240, 2268887698, 1296436510, 2916995305, 3041798596, 3096982293, 177546898, 3065170162, 933607211, 102294817, 1801218436, 102569645, 2901869379, 2714886480, 119387632, 656198271, 1388322584, 2775933520, 255861774, 653410879, 121504271, 3607745288, 2230556561, 2594802791, 1189055855, 1111240008, 2530579856, 936965766, 3263165681, 1646076782, 3215192313, 2313499990, 1836078863, 76222274, 3537625615, 3448299995, 1142686967, 2783169043, 1481999457, 407759227] -&amp;gt; 1596242054&#xA;[2829936706, 3129475899, 3747369794, 3436426639, 2221019177, 2711897885, 2281503984, 3142203725, 1105679393, 2240453588, 21256724, 1976207648, 2233823367, 3867572431, 883054004, 3828587385, 55294132, 3869553795, 815613304, 1561650320, 1751491302, 3021430621, 3344018026, 1092797427, 2270330908, 872186202, 1096541534, 2148792176, 3302750004, 1221765447, 2805795772, 779878772, 758662454, 4154291008, 1400703216, 2661407119, 3653090591, 674866675, 688479370, 757212805, 2546987102, 3742892714] -&amp;gt; 1598478846&#xA;[1350161655, 3410944815, 579310510, 2035583578, 2536805685, 2120035014, 3911683567, 137430281, 676637211, 80424819, 2031627279, 1805522976, 2901778769, 2558787384, 2175054, 1588147737, 1750628274, 1642903038, 2323086809, 204561611, 3017703970, 66172789, 3753895397, 1082808709, 343477515, 3245691790, 2098802152, 2796851615, 3416307802, 1023857834, 1965832789, 412854529, 354175981, 3277463158, 2311727857, 3748028931, 75711999, 605941926, 4268457500, 1591192393, 2493456550, 1285360546, 160198834, 3576865205, 188890618, 1853564214, 4281264410] -&amp;gt; 1682874144&#xA;[1759970266, 4134439683, 1532925684, 269299343, 4192017837, 3267142052, 2227585380, 917508171, 2947539107, 1298614074, 3027970270, 3512964090, 78445334, 3939961135, 1550341966, 891964846, 882505655, 314334452, 536698283, 4073297092, 1362911951, 10583051, 4102282272, 39722618, 817646395, 635913246, 3395599638, 114835278, 2721016640, 1301397743, 3359042468, 1967603896, 1842991024, 797964890, 4075738194, 1833629245, 222121931, 3323140076, 3669797521, 2149358182, 3096189598, 4128620833, 1053919363, 3716968416, 1538927892, 3456625069, 3320651259, 2424645618, 3487090498, 1836457156] -&amp;gt; 1757912108&#xA;[3206311438, 3995119122, 875115076, 1697246932, 1819127701, 3119338948, 4287411440, 398614242, 2014590172, 1247230330, 4290547991, 2948954546, 3744789096, 2104418209, 185774855, 4253667876, 2202426919, 3397365003, 2934331500, 2095666656, 996668853, 249650538, 3668868008, 1615410768, 492066747, 3451532273, 3886898259, 1151021320, 1782145434, 2431016438, 2907780443, 2152384331, 800661361, 2028554209, 1103300513] -&amp;gt; 1779025760&#xA;[1744880977, 2233651387, 56617556, 1115479166, 2611598968, 1306003390, 2910946867, 1496609711, 4077408131, 3512362374, 2281393975, 3418144659, 1773074316, 1601343734, 807592751, 2365582522, 1446242874, 847706414, 2850851126, 414921605, 2617956981, 4205647553, 4063233713, 142946783, 1975643220, 1993142296, 3392343515, 1515671667, 1948071803, 3991728328, 968499177, 2198785340, 1321024334, 3781705466, 3920003634, 727611412, 30865083, 1239101335, 3511359132, 3435471655, 2332994209, 3451243757, 2388153527, 3219135587, 3239646757, 130935018] -&amp;gt; 1815085532&#xA;[3742736007, 3013982958, 950712805, 590882231, 2021027712, 1687735825, 2840162788, 236595715, 1966708028, 3189262610, 1430349774, 533579944, 2649611396, 2583295302, 3582250057, 2565346361, 396439695, 4153603028, 3342863641, 209226977, 3673492099, 1470755570, 1265241721, 755285979, 1871568539, 1835865540, 614068679, 1981443993, 570207739, 4057872936, 636526617, 3083893122] -&amp;gt; 1892006865&#xA;[2363102448, 2664740190, 3782032362, 2321087205, 3789479744, 439476800, 267092854, 559662253, 3052920007, 1039904017, 882951865, 1185772050, 121779049, 1255320891, 3898061704, 4160716348, 1870139159, 1739210570, 2851269822, 866317206, 559870442, 3322246740, 419503690, 1438071640] -&amp;gt; 1972485478&#xA;[3678708758, 283072981, 1128708041, 648928081, 516617525, 2562088844, 2077772312, 454404108, 2773100394, 3731939823, 3956390266, 1273038228, 711119494, 1889950256, 2150587570, 2368988611, 3083613740, 136402153, 3706807002, 1951409673, 646402003, 1965112544, 3799779787, 2727912100, 3934407652, 3190480389, 2893737274, 3503914114, 1242998415, 3673986521, 3585553888, 1356707071, 2892703448, 2503698089, 677538230, 3777556915, 4131625633, 3989648217, 3371399362, 916533795, 438016809, 1888923541, 4018783570, 35576878, 1439895305] -&amp;gt; 2006012423&#xA;[4186976930, 1468422130, 2127537262, 3013431126, 1014175853, 619237775, 2251537150, 2635437352, 2529830434, 270079805, 2249885826, 4160741826, 1799997550, 90064691, 1707888518, 4191506978, 1400211336, 4260528976, 1777462871, 3522395605, 3184921911, 1289756682, 1204481339, 2320228865, 1382458891, 2585094069, 1807393027, 904952345, 2418050161, 3944759600, 850396791, 2010841661, 911793010, 2814160212, 3917390566, 1742258451, 312330630, 1509247515, 3622596041, 2381664940, 792997581, 1348701222, 4231392479, 1492858603, 841395446, 1732373831, 2792829070, 1232839054, 4133086979, 1330710519] -&amp;gt; 2023628655&#xA;[1447486536, 1589601829, 2711407664, 2671174482, 755815460, 2739822893, 624189525, 3881531582, 2104935742, 3877151275, 4029158122, 3270473853, 2397135808, 541842801, 4159848352, 1265295340, 2924665155, 1697146316, 1323336501, 1887970585, 3957105141, 4080944661, 1260974434, 2538893190, 1418098060, 1087907449, 1555085135, 517760467, 1165667983, 1976195378, 899913113, 3298189181, 2844731428, 2587250768, 419676280, 3669952139, 1008835697, 2109855126, 2204851528] -&amp;gt; 2080799654&#xA;[3057502862, 2753037643, 586428454, 875470641, 763920856, 1915854920, 960628797, 3268824212, 155894276, 326435370, 4153187586, 3266725420, 3421441761, 984314678, 134133671, 1571569456, 3290768531, 1270814441, 3360280927, 63041059, 1367587866, 3837387650, 3016828154, 1932299196, 2677431226, 118282642, 4274320011, 2842715068, 3590275349, 3385213492, 3669399717, 23889551, 1990874337, 2065027029] -&amp;gt; 2124973901&#xA;[404963327, 970175530, 2315604326, 759401990, 3265128006, 3886300253, 2428903513, 2547895316, 2394147688, 1256335272, 54823458, 1121206884, 1587348808, 1813532729, 475467047, 2240315018, 4228484438, 3836003837, 1713780997, 1021495744, 1667817101, 3431813061, 1741019894, 244489142, 4185223756, 2154392407, 1130398867, 2200660986, 1655353090, 824162463, 269754245, 853115597, 554916755, 3901389184, 3490586038, 2387525212, 3363338561, 2848158299, 1365520662, 65222054, 969608783, 3832404018, 797302386, 220365549, 998915816, 3880644358, 1656707899, 113713704] -&amp;gt; 2200030708&#xA;[1182658594, 858230724, 1872357797, 2818651205, 2361035630, 2882362708, 774158555, 1780906106, 1245895866, 1925774739, 1695790856, 1650553385, 3918997115, 1289270838, 1080124671, 1854179057, 4032572199, 3398178415, 2660852575, 2126762197, 2845072225, 3916118969, 2961311910, 3490728772, 2152765282, 925727050, 2046977563, 3481846724, 3016398740, 3170193754, 3947157907, 2318811664, 665856332, 2694492251] -&amp;gt; 2222600201&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2016-11-27T18:30:43.387" LastActivityDate="2016-11-27T18:30:43.387" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10639" PostTypeId="2" ParentId="2140" CreationDate="2016-11-20T21:53:10.083" Score="1" Body="&lt;h1&gt;Rearrange the Words!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a string of text containing some words, which are separated by spaces, determine the best arrangement to fit it in the shortest number of pages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a word is shorter than the length of a page:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the word fits on the latest page, it stays on that page&lt;/li&gt;&#xA;&lt;li&gt;If the word does not fit, it goes to the next page.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If a word is longer than the length of a page, it stays on that page and overflows to the next page.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Words have one character between them if they are on the same page.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if the length of the page was &lt;code&gt;10&lt;/code&gt;, and my words are &lt;code&gt;hello my name is oliver ni!!&lt;/code&gt;, it would fit like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;hello my&#xA;name is&#xA;oliver&#xA;ni!!       # 4 pages&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;However, one of the ways to rearrange it can get a shorter number of pages:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;hello name&#xA;oliver is&#xA;my ni!!    # 3 pages&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So the shortest way in this case would be 3 pages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Remember, this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the code with the fewest bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="12537" LastActivityDate="2016-11-20T21:53:10.083" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10640" PostTypeId="1" AcceptedAnswerId="10643" CreationDate="2016-11-21T00:34:22.363" Score="9" ViewCount="237" Body="&lt;p&gt;I'm looking for feedback on a showcase idea that's a bit like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8007/20260&quot;&gt;Best of PPCG&lt;/a&gt;, but on main. The goal is to showcase excellent golfs, so that a wider audience can understand and appreciate them. While inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/q/44680/20260&quot;&gt;Showcase your language one vote at a time&lt;/a&gt;, it's not meant as a replacement. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each answer would link to a golf (or fastest code, code challenge, etc) that the answerer considers worthy of admiration, whether their own and someone else's. The answer would explain in great detail how the golf works and why it's outstanding, far beyond the existing explanation in the answer.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The explanation should make the code clear to someone who doesn't know the language. It could compare it to how other languages might approach the task.&lt;/li&gt;&#xA;&lt;li&gt;It should analyse the main tricks and optimizations. Moreover, it should explain &lt;em&gt;why&lt;/em&gt; they were used, compare it to less optimized alternatives, and note any trade-offs. &lt;/li&gt;&#xA;&lt;li&gt;The author should explain what they consider special about the submission. Perhaps the core trick is hard to find, or the code was exceptionally well-optimized, or the language makes it very hard to solve the task at all. Or, perhaps it's more the sense of beauty the submission evokes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I anticipate some potential issues. Answers might showcase already well-known, highly-voted submissions, so readers don't discover anything new. Voters might elevate answers that link to great golfs but have shallow explanations. Finally, the &lt;a href=&quot;https://meta.stackexchange.com/questions/9731/fastest-gun-in-the-west-problem&quot;&gt;FGITW effect&lt;/a&gt; favors posting quickly, and quality answers posted months later might not get attention.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Beyond that, there's issues of scope. The site rules currently do not allow for such a showcase. Perhaps it could be called a popularity contest, with votes determining the &quot;winner&quot;, but I find that a poor fit. Ideally, we would discuss and create a new category that allows for this type of thing.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-11-21T12:19:34.823" Title="Proposed golfing showcase" Tags="|discussion|new-genre|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10641" PostTypeId="2" ParentId="10636" CreationDate="2016-11-21T08:03:32.373" Score="-5" Body="&lt;h1&gt;No, find a better solution&lt;/h1&gt;&#xA;&lt;p&gt;The top-voted answer says:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The showcase is not an optimal solution, but it's the best we have for now.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Rather than keeping the showcase (which is clearly off-topic by our rules), we should find a better solution that doesn't need a special exception to be on topic.&lt;/p&gt;&#xA;&lt;p&gt;While the action taken by the mods to close and lock the showcase didn't really match community consensus, the one thing we did agree on was that the showcase would need a special exception to fit in our site's scope. Rather than try to make an exception, we should aim to find a solution that is within the scope of PPCG.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-22T03:59:42.983" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10643" PostTypeId="2" ParentId="10640" CreationDate="2016-11-21T12:19:34.823" Score="11" Body="&lt;p&gt;A question whose answers explain existing answers on main is inherently a meta-question. Whether it's on topic for the meta site is debatable, but if it's on topic anywhere then it would be meta, not main.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2016-11-21T12:19:34.823" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10644" PostTypeId="2" ParentId="10531" CreationDate="2016-11-21T15:08:48.723" Score="2" Body="&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/multi-threading&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;multi-threading&amp;#39;&quot; rel=&quot;tag&quot;&gt;multi-threading&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/concurrency&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;concurrency&amp;#39;&quot; rel=&quot;tag&quot;&gt;concurrency&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;At the time of this post, there was not a single golfing language answer to any challenge with such a tag. It is not for lack of popularity though, as &lt;a href=&quot;https://codegolf.stackexchange.com/q/83039/43319&quot;&gt;this&lt;/a&gt; challenge had about ten thousand views, 63 upvotes, and 37 answers.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/unicode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;unicode&amp;#39;&quot; rel=&quot;tag&quot;&gt;unicode&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;A lot of golfing languages seem to have a hard time with such challenges.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-21T15:08:48.723" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10645" PostTypeId="2" ParentId="2140" CreationDate="2016-11-21T16:27:39.373" Score="1" Body="&lt;p&gt;&lt;strong&gt;Change the type of a variable without introducing any new identifiers while preserving a value resulting from the conversion of the original one&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider the variable which type you should change is declared/defined inside a function. Another thing to consider is that there wouldn't be any other identifiers manually defined/included before your function and the variable inside it (this includes referring to standard header/modules too). Also you aren't allowed to change the value or meaning of any existing identifiers (if any) except &lt;code&gt;a&lt;/code&gt; after your code is finished, compared to before it started executing. (Of-course this doesn't forbids you to actually change them but after your code is finished they must be in the same state as before it was entered in, except &lt;code&gt;a&lt;/code&gt; of-course)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As identifiers I mean reserved names of functions, variables and etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example in C:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;void f() //no identifiers defined/included prior&#xA;    //the function can't have any parameters&#xA;&#xA;{ //inside function block&#xA;&#xA;    int a = 67; //assign some constant value here&#xA;&#xA;    //... your code here&#xA;&#xA;    //no new identifiers introduced&#xA;    //and no existing one have changed meaning (or value) after this point&#xA;    //except 'a' of-course&#xA;&#xA;    a ; //here 'a' must have different static type&#xA;        //with a value resulting from the conversion&#xA;        //of the one stored previously in 'a'&#xA;&#xA;&#xA;    //You are allowed to include libraries/modules (identifiers) here in&#xA;    //order to show us the value and type of 'a'&#xA;    //The unused statement above is used only as valid syntax containing 'a'&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Of-course the above snippet is just a sample. In case of using actually &lt;code&gt;C&lt;/code&gt; you are allowed to add all other kind of stuff (like additional block scopes, etc). The only important thing to target is that after you have declared some variable in your function you have to write some magic with the requirements given.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This question have intended solution in C. I'm not sure how applicable is it for other languages though because it depends on the concept of having some names (identifiers) referring to certain entities. Also it needs types and object values defined too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The initial and target type of &lt;code&gt;a&lt;/code&gt; aren't specified. Also if the identifier &lt;code&gt;a&lt;/code&gt; of the variable is not allowed, you can use one that is.&lt;/p&gt;&#xA;" OwnerUserId="62523" LastEditorUserId="62523" LastEditDate="2016-11-21T16:38:22.017" LastActivityDate="2016-11-21T16:38:22.017" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10647" PostTypeId="2" ParentId="10606" CreationDate="2016-11-21T23:01:22.000" Score="2" Body="&lt;p&gt;OK, so based on the various discussions, I think the consensus as to what applies in the situation is this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First, we note that &lt;strong&gt;sizecoding questions are on topic, but hard to write&lt;/strong&gt;. See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7318/62131&quot;&gt;this meta thread&lt;/a&gt; for more details. (Thanks to mınxomaτ for suggesting the link as relevant.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are two specific reasons that sizecoding questions are hard to write. They both stem from the fact that the optimal solution typically involves writing the machine code first (even if you originally wrote the solution in some other language, you'd gain an advantage from taking the resulting machine code and micro-optimizing it by hand; most compilers tend to be fairly bad at golf).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One issue is that the language in which your program is written tends to be irrelevant when all you're looking at is the compiled output. Nifty/clever use of language features, which is one of the motivating reasons that many people come to PPCG, is irrelevant because you could do everything more easily in assembler or even literal machine code; unlike typical programming, writing in a higher-level language makes things more difficult rather than easier.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The other issue is that the source code of your program tends to be irrelevant when all you're looking at is the compiled output. There's no benefit to saying anything in a terse way or avoiding redundancy (at least if the redundancy can be detected by the compiler). A good example of this is &lt;a href=&quot;http://asmjs.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;asm.js&lt;/a&gt;, a subset of JavaScript intended specifically for the JIT equivalent of sizecoding (typically by compiler output); it doesn't look anything much like regular JavaScript and is highly repetitive and hard to read.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/99676/the-logical-quine&quot;&gt;challenge that inspired this question&lt;/a&gt; happens to work around both these problems:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;One way to make the language choice for sizecoding interesting is to score the size of the program on a range of different processors without allowing processor detection at compile time, thus requiring the program to be portable, and meaning that it can't rely entirely on hand-compilation but has to use actual features of the language's compiler. Doing this explicitly for sizecoding questions has the issue that scoring an answer will be very hard. However, the linked challenge does it implicitly, in that it requires output intended for an FPGA; unlike CPUs, which have a few very widely used models, no model of FPGA is popular enough for it to be easy for most people to optimize the code specifically to target that model. As such, it's going to be much easier to write a portable submission that should sizecode well on a range of hardware, than to track down a compiler for the specific model in question and see what results it produces (especially because some compilers will be better at optimization than others).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The question requests the competitors to write a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;. This implicitly gives an advantage to simpler source code, because encoding the source code in the output will require less compiled size, and thus makes the source code relevant indirectly. In this particular case, it meant I wrote a solution in Verilog rather than my (usual choice for hardware questions) VHDL, because Verilog requires less boilerplate (VHDL is sort-of the Java of hardware description languages). This made the problem function like a more normal problem in terms of effort required in language selection and program optimization, thus getting around the problem.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;It seems as though the scope for good sizecoding questions is fairly small; in the majority of cases, we'd be better off with a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; with a winner per language, and having machine code as one of the languages to compete in (especially as it tends to be a fairly competitive, if not widely chosen, choice in code golf questions!) It's definitely not the case that such a question is automatically bad, but on the other hand, it's unlikely that we'll get a sufficiently large number of quality questions on the subject that having a unique tag is worthwhile.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As such, questions which request a minimal compiled size, which is an objective and uncommon win condition, should be tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, like other challenges where the win condition is objective but unusual.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-11-21T23:01:22.000" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10649" PostTypeId="2" ParentId="10636" CreationDate="2016-11-22T08:25:28.597" Score="3" Body="&lt;h2&gt;No: PPCG isn't esolangs.org&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The original purpose of PPCG was to provide a place to move &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;questions when the scope of Stack Overflow was tightened. It has evolved since then into a place for &quot;&lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;programming contests and challenges&lt;/a&gt;&lt;/em&gt;&quot;. But &quot;encyclopaedia of programming languages&quot; is far outside its scope, and &lt;em&gt;can be done much better&lt;/em&gt; on platforms which don't have post size limitations, voting systems, etc. In particular, &lt;a href=&quot;http://esolangs.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://esolangs.org&lt;/a&gt; already provides a good platform for an encyclopaedia of programming languages, is intended for that purpose, and is used by the creators of many of the languages created in this community to showcase their languages.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-11-22T08:25:28.597" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10653" PostTypeId="2" ParentId="10636" CreationDate="2016-11-22T15:52:49.273" Score="2" Body="&lt;p&gt;I feel like a lot of the answers here are missing the intent (as communicated to me in chat) of Calvin's question, so I thought I'd make my own. Let me start by clarifying something:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;strong&gt;&lt;em&gt;This question has nothing to do with whether the showcase should be closed/locked permanently.&lt;/em&gt;&lt;/strong&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(for voting and discussion on that visit the original meta discussion)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This question is &lt;em&gt;did the mods &lt;strong&gt;prematurely&lt;/strong&gt; close the showcase, and should it be temporarily reopened while awaiting community consensus&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The answer is yes: just look at the votes on the original. At the time of the locking, Dennis's answer in favor of closing as too broad was at about score 7, with about a 60-40 breakdown in upvotes vs downvotes. Meanwhile, the answer in favor of keeping it open were at about scores of 15-20 with more like an 80-20 breakdown in upvotes vs downvotes. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even if you subscribe to the most literal definition of majority (or plurality I suppose in the case), this isn't much of a consensus. And due to the question itself being downvoted heavily, the voting sample was really small. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Furthermore, now that the showcase has been locked, a lot more attention has been drawn to the original meta question and the consensus of keeping it open definitely seems to emerging (additionally, my answer suggests the barebones of a policy for handling this in the future).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regardless of whether you consider this to be a consensus yet, there's no denying that there was no real consensus at the time when the question was locked. I would now like to take a reading from &lt;s&gt;the Book of Atwood&lt;/s&gt; &lt;a href=&quot;https://stackoverflow.blog/2009/05/a-theory-of-moderation/&quot;&gt;A Theory of Moderation&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;As a moderator, your actions now represent the community, so you will&#xA;  be held to a higher standard of behavior. You are an ambassador of&#xA;  trust, with the same sorts of rights that the official development&#xA;  team and community coordinators have.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Your goal is to guide the community with gentle -- but firm --&#xA;  intervention. Respect your fellow community members at all times;&#xA;  demonstrate fairness and impartiality in your actions.&#xA;  ...&#xA;  Keep the site reasonably on topic by closing, migrating, or removing blatantly off-topic questions.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Our moderators enjoy a fair amount of free will, which our site has benefited from immensely in the past. However, this is one of situations where the moderators should act as regular community members and vote/answer, and only execute mod actions &lt;em&gt;after&lt;/em&gt; the community has agreed on something. The showcase is clearly not a &lt;em&gt;blatantly off-topic&lt;/em&gt; question -- we wouldn't have needed this discussion in the first place if it was. As a result, the showcase should have been left alone while awaiting a consensus or (perhaps) locked with the &quot;ongoing meta discussion&quot; reason. Instead, it was closed as too broad, locked for historical reasons, and a &lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt; tag was put on the original discussion implying discussion is over (which has now been changed to &lt;a href=&quot;/questions/tagged/status-review&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-review&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-review&lt;/a&gt; which is somewhat better). This is wrong.&lt;/p&gt;&#xA;" OwnerUserId="45151" LastEditorUserId="45151" LastEditDate="2016-11-22T17:24:07.907" LastActivityDate="2016-11-22T17:24:07.907" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="10655" PostTypeId="2" ParentId="10636" CreationDate="2016-11-22T17:49:32.000" Score="2" Body="&lt;h2&gt;Apply standards consistently&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Some people are arguing that we should leave the challenge open until a consensus is reached. Or, that it's off-topic but should remain open nonetheless because there's no harm in doing so.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then shall we do the same for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest?sort=newest&amp;amp;pageSize=50&quot;&gt;the recently closed pop cons&lt;/a&gt;? Whether those are in scope is debated back and forth to no end. For all the closed &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot;&gt;pure programming puzzles&lt;/a&gt;? Opinions on those are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5585/20260&quot;&gt;evenly split&lt;/a&gt;. Let's chide Dennis for unilaterally using mod power to close &lt;a href=&quot;https://codegolf.stackexchange.com/q/8506/20260&quot;&gt;this puzzle challenge&lt;/a&gt; without community approval.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Applying certain standards to one challenge and not another reeks of favoritism. What messages are we sending to new users if Calvin's showcase challenge is allowed to remain open despite the rules, but theirs is closed? &quot;If your challenge is popular enough, it's above rules&quot;? &quot;Established users get special treatment&quot;? &quot;Don't bother asking if it's on-topic, just post and hope it's excused retroactively&quot;?&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-11-22T17:49:32.000" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10656" PostTypeId="1" AcceptedAnswerId="10657" CreationDate="2016-11-22T19:38:46.957" Score="29" ViewCount="1646" Body="&lt;p&gt;Comparing the vote tallies on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10457/12012&quot;&gt;Proposal to lock the Language Showcase as historically significant&lt;/a&gt; before and after the &lt;a href=&quot;https://codegolf.stackexchange.com/q/44680/12012&quot;&gt;Showcase of Languages&lt;/a&gt; was closed and locked leads me to the following conclusion.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The community agrees the showcase is not an optimal solution. While it is the best/only thing of its kind on PPCG, there are issues that can and should be addressed.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The community agrees &lt;em&gt;in principle&lt;/em&gt; that the showcase is too broad by our current standards.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The community does &lt;strong&gt;not&lt;/strong&gt; want the showcase closed and/or locked.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Going by the rules, points 2. and 3. are contradictory, but exceptions for highly popular and useful resources that already exist and the community wants to keep updating are not unheard of. For example, after getting closed, reopened, protected, unprotected, locked, and unlocked more times than I can be bothered to count, &lt;a href=&quot;https://stackoverflow.com/q/388242/950430&quot;&gt;The Definitive C++ Book Guide and List&lt;/a&gt; finally settled on a special kind of lock (&lt;em&gt;Wiki Answer&lt;/em&gt;) that combines all answers into one, prevents adding additional answers, but neither closes the question nor makes the answer uneditable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While we cannot do the exactly the same for the showcase (combining all answers into one would create a ton of issues and solve none), we could still create an exception that fits &lt;em&gt;our&lt;/em&gt; case. By this, I don't mean simply ignoring any issues with the showcase being a PPCG challenge and the showcase itself, but coming to a consensus what this exception should cover, and how we can at least partially address those issues for the benefit of the site, the showcase, and the community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For reference, these are some of the issues that surged. Note that not all of them are considered issues by all (or even a majority of the) members of our community.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;By our current standards, the showcase is too broad to be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The showcase isn't really a programming competition, but a way of showing off features of programming languages. There is no problem to be solved and no sensible way to compare answers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The &lt;em&gt;one vote at a time&lt;/em&gt; aspect slows down and hinders the addition of snippets. Verbose languages may need a substantial amount of upvotes before they can do anything interesting. Not being able to do something interesting may mean these upvotes will never come.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Answers are owned by a single member of the community, the challenge explicitly discourages creating more than one answer for a single language, and editing/adding code to another user's answer is frowned upon.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Many answers are quite long. Some are &lt;em&gt;huge&lt;/em&gt;. The high amount of pictures makes the first pages (by votes) a strain for slow internet connections and limited data plans. The question itself is pretty big and contains a directory that is updated manually.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Answers are capped at 30,000 characters. If we manage to get more useful additions to the top answers, that will become a problem.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;So, can we agree on making a clearly defined exception for the showcase? If so, what should be the terms of that exception?&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2016-11-29T19:58:08.737" Title="Making an exception for the &quot;Showcase of Languages&quot;" Tags="|discussion|specific-question|scope|closed-questions|" AnswerCount="6" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10657" PostTypeId="2" ParentId="10656" CreationDate="2016-11-22T19:38:46.957" Score="25" Body="&lt;h2&gt;Let's make an exception&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This seems to be what the community as a whole wants. I don't think this is an optimal solution (and would personally to prefer to leave it as it is), but since the showcase is both too broad and dearly beloved by the community, it seems like a viable compromise.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Below, I list some potential changes to the showcase that could both make it a better fit for PPCG and benefit the showcase itself. &lt;em&gt;These are my own, personal ideas&lt;/em&gt;; they are not fleshed out, and feedback, improvements, and additional ideas are welcome.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Make it a non-challenge question&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1723/lets-decide-what-kind-of-non-challenge-questions-we-want-once-and-for-all?s=1|1.2959&quot;&gt;We &lt;em&gt;do&lt;/em&gt; allow these&lt;/a&gt;, and the showcase is by far more similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions than to our usual programming contests. This should encompass unaccepting the answer with the highest vote count, removing the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; tag, and adding a dedicated &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/showcase&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;showcase&amp;#39;&quot; rel=&quot;tag&quot;&gt;showcase&lt;/a&gt; tag which makes clear that this will be the only question of its kind, at least without a preceding meta discussion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This would also mean removing the &lt;em&gt;one vote at a time&lt;/em&gt; rule; additional snippets could be added at will and would not be restricted to one snippet per character count. I don't think character count should be a limiting factor at all; it hinders showcasing intentionally verbose languages.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Make it a community wiki&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is a perfect fit.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Questions should be manually converted to community wiki when they are marginal fits or 'list of X' questions that contain enough value to avoid deletion.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The showcase should &lt;em&gt;obviously&lt;/em&gt; not be deleted, but it is a 'list of X' question, and considered too broad or even off topic by some members of the community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Converting the entire thread to community wiki means that all answers will cease to be the &quot;property&quot; of a single member of the community; all users that cross the required threshold are free to add snippets of their own, or modify and/or remove low-quality contributions of other users.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In case you're worried, this will &lt;strong&gt;not&lt;/strong&gt; affect the reputation you have already earned.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Combine answers in the same language (whenever possible)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Ideally, we would have one page per language, but there's no way to make that happen using PPCG's Q&amp;amp;A format.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consolidating multiple answers in a single language into a single post should be done whenever possible, both to make finding and reading about your language of interest easier and to avoid multiple near-duplicate snippets.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One issue with this idea is the 30,000 character limit imposed on answers. We could request the limit to be raised; this would also benefit answers in exceptionally verbose languages which tend to not fit into an answer even for the simplest challenges.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Use Stack Snippets to fold answers&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Everything except the language name and a factoid could be folding by wrapping it into a stack snippet. That would condense each page into 30 stubs, which can be expanded with just two clicks. This serves multiple purposes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You don't have to load images of answers you're not interested in reading or have already read. This is a huge deal on small screens or limited data plans.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Stack Snippets can be expanded to take up the entire screen, making long answers substantially easier to read.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Stack Snippets can contain more than just Markdown. An animated GIF is no longer the only way to show an animation, snippets could be fiddled with inline, etc.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Unlock and reopen&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I'd rather keep it locked to make clear that this constitutes an exception to our rules, but a notice in the question body will have to do. There seems to be no fitting lock reason, the closest fit being be &lt;em&gt;Wiki Answer&lt;/em&gt; (which prevents adding additional answers).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We should also replace the manually curated answer list with a Stack Snippet.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Keep searching for better alternatives&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;As before, I still believe that the showcase deserves to be a proper wiki, quite possibly outside PPCG, free from restrictions on character count, size, Markdown, JavaScript, pagination, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While there &lt;em&gt;are&lt;/em&gt; existing alternatives – e.g., &lt;a href=&quot;https://esolangs.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolang&lt;/a&gt; could showcase the recreational programming languages – the community doesn't seem to consider it a sufficient replacement. But once we find one, we could still revisit locking the showcase.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-11-23T21:44:30.930" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="10658" PostTypeId="2" ParentId="10656" CreationDate="2016-11-22T19:57:43.997" Score="12" Body="&lt;h2&gt;Make a new category&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If the site benefits from this challenge, it should benefit from others like it. What if someone posts another showcase challenge that would be just as popular and well received, but never gets a chance to gather a following because it gets closed immediately? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;We should think about what qualities make such challenges valuable and create a category for them with specific validity criteria. At least then, all challenges abide by the same rules without special exceptions, even if only retroactively.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, it's not easy to extract and delineate these qualities, but we should try. I don't make any proposal what this category should be -- I leave that discussion to the community. I only ask that it not be &lt;a href=&quot;https://en.wikipedia.org/wiki/Gerrymandering&quot; rel=&quot;nofollow noreferrer&quot;&gt;gerrymandered&lt;/a&gt; specifically to include the programming language showcase.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2016-11-22T20:16:08.517" LastActivityDate="2016-11-22T20:16:08.517" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10659" PostTypeId="2" ParentId="10656" CreationDate="2016-11-22T21:40:48.203" Score="2" Body="&lt;h1&gt;Reopen, don't change the rules&lt;/h1&gt;&#xA;&lt;p&gt;What I'm arguing for is:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Call the Showcase an exception to our general rules on broadness.*&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Unlock and reopen the Showcase ASAP.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Don't change the rules or the answer format.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Do not make it a community wiki without solving the issue of &amp;quot;rep pings&amp;quot;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Keep searching for better alternatives if you feel that is necessary.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The Showcase is plainly a popular challenge that people want to stick around. Whether it would be the only exception ever or if a special tag should be made for it and stuff, I can't say. Mostly, &lt;strong&gt;I'm advocating restoring the Showcase to the state it existed in for nearly 2 years&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;*Or call it a valid challenge based on the fact that there was &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10636/26997&quot;&gt;never a clear concensus&lt;/a&gt; to close it in the first place, the difference is semantic.&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Here I've gone through the major points in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10657/26997&quot;&gt;Dennis' answer&lt;/a&gt; and added my suggestions/desires:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Make it a non-challenge question&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I'm not opposed to retagging or unaccepting the answer. I don't feel it's necessary but it's not a big deal, merely a semantic difference.&lt;/p&gt;&#xA;&lt;p&gt;I do &lt;em&gt;not agree&lt;/em&gt; with:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;removing the one vote at a time rule; additional snippets could be added at will and would not be restricted to one snippet per character count.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This breaks a golden rule of PPCG of not changing a challenge once many answers are present. It may not invalidate existing answers, but it will make their structure confusing to anyone reading the updated challenge, and new answers will look different. Basically it will cause incoherence, not an untenable amount, but that's not something we tend to intentionally inflict on challenges.&lt;/p&gt;&#xA;&lt;p&gt;Also, removing this fundamental rule of the challenge makes it more broad, which was the reason it was closed in the first place. So it seems a contradictory notion coming from anyone against broadness. I get that the desire is to turn it into a general showcase area, but updating all the answers to that metric is something that I frankly don't think anyone is going to take the time to do (and I don't blame them).&lt;/p&gt;&#xA;&lt;p&gt;(I can understand if the issue is that too many edits to the Showcase are bumping it too much so it hogs active questions, but I'm not sure I've ever heard that as a complaint, at least recently.)&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Make it a community wiki&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I think this would be ok &lt;em&gt;if&lt;/em&gt; this didn't stop the little +10 green rep pings users get when they are upvoted. Without those on this challenge, users will constantly have to monitor their answers to see if they can add a new snippet (assuming the votes rule is kept).&lt;/p&gt;&#xA;&lt;p&gt;That's annoying for answerers and bad for people reading the answers, since there will be fewer updates.&lt;/p&gt;&#xA;&lt;p&gt;More fundamentally, I believe a capitalist system where people are incentivized to update answers by rep gains is the best model for growing such a challenge. It's perfectly ok to desire rep in exchange for good content. That's how SE works. However, I could get on board with a community wiki iff it didn't remove the rep pings.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Combine answers in the same language (whenever possible)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This makes a lot more sense with a CW and the votes rule removed, so it doesn't apply much with my assumptions.&lt;/p&gt;&#xA;&lt;p&gt;(Doing a quality spot check on answers might be a good idea though. And maybe some bits could be culled and such.)&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Use Stack Snippets to fold answers&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;No. This is bothersome and convoluted. Clicking and waiting for stuff to load is not necessarily faster than scrolling. And everyone knows what scrolling is, not everyone is familiar with Stack Snippets used as &amp;quot;spoiler&amp;quot; boxes.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Unlock and reopen&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Yes. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10637/26997&quot;&gt;This is desired by the community.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Keep searching for better alternatives&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Sure, go for it. Raise more meta questions about the Showcase or showcases in general or broadness. Migrate things to a wiki. But until there's a plain concensus that the Showcase should be closed/locked/deleted/whatever, it should remain open as it has been for nearly 2 years.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-22T22:57:29.403" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10660" PostTypeId="2" ParentId="10656" CreationDate="2016-11-22T23:36:33.817" Score="3" Body="&lt;p&gt;&lt;strong&gt;I'd like to enumerate all of the options I see so far, along with their disadvantages:&lt;/strong&gt;  (Note that this is all under the assumption that the Showcase is too broad, )&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;strong&gt;Close the Showcase&lt;/strong&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The problem with this is that it is a great resource to show off new languages&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Keep the Showcase&lt;/strong&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Due to the 1-byte-per-vote rule, new posts have little ability to show off (which is the whole reason we were keeping it open)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Remove the 1-vote-per-byte&lt;/strong&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This invalidates all current answers.  It'd be like removing the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; from a challenge:  the answers would still &lt;em&gt;work&lt;/em&gt;, but the goal they were aiming for is gone.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Close the Showcase, and open a new Showcase&lt;/strong&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The biggest problem I see with this is that we've fragmented our language showcase:  We'd have some really great snippets on the old Showcase, and other great ones on the new showcase.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;I didn't consider options of &quot;Redefine what we consider too broad/on topic&quot;, as we haven't really gotten a solid definition of what the new rules would entail.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This isn't a &quot;We should do X&quot;, but adding to the discussion.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2016-11-22T23:44:35.273" LastActivityDate="2016-11-22T23:44:35.273" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10661" PostTypeId="2" ParentId="9619" CreationDate="2016-11-23T07:55:21.307" Score="12" Body="&lt;h1&gt;Machine code (specifically, x86)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Many arguments apply to all machine code languages, but I'll advocate x86 here because it's what I know best, and because it's more fun than some other ones (see below).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Unusual&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The first reaction to seeing code golf in machine language is &quot;WTF&quot;. It's not even clear at first whether this is a programming language at all, though &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/25315&quot;&gt;undoubtedly&lt;/a&gt; it is.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Widely supported&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Many computers use the x86 instruction set natively, and those that don't (e.g. x86-64 computers cannot run the very old 16-bit variant) have emulators.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are many tools that help you write and debug code. Any assembler will let you write in human-readable &lt;a href=&quot;https://en.wikipedia.org/wiki/Assembly_language&quot; rel=&quot;nofollow noreferrer&quot;&gt;assembly language&lt;/a&gt;, and output machine code. And any good general-purpose debugger will debug machine code (converting it to assembly language).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, documentation is pretty extensive. Searching the Internet will always provide rich information. This is unlike some esoteric languages, which often have poor documentation on a single site.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Real Thing&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Because machine code is used all the time, golf skills also help in real life. For example, trying to debug a crashing C/C++ program (yes, some people are still doing this in 2016) will require some thinking in terms of machine code and assembly language.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Fun&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Density (number of bytes per unit of logical complexity) of machine code is an important factor in its design. So machine code is good for code golf. Especially the x86 variant, which was designed in &lt;a href=&quot;https://en.wikipedia.org/wiki/X86&quot; rel=&quot;nofollow noreferrer&quot;&gt;1978&lt;/a&gt;, when code density was very important.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, &lt;a href=&quot;http://www.felixcloutier.com/x86/INC.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;adding 1 to a register&lt;/a&gt; is encoded with 1 byte. For best code density, you have to use this in places where it was not intended, e.g. to generate the number 1: &lt;a href=&quot;http://www.felixcloutier.com/x86/XOR.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;generate the number 0&lt;/a&gt; first, and then increase by 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The basic x86 instruction set has dozens of instructions (the more recent 32-bit and 64-bit variants have many more) that sometimes work in surprising ways, and all this can be exploited for making short code.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Competitive&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Machine code's competitive performance is between golfing languages (like Pyth) and normal ones (like C).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In some case, the debuggability of machine code is a great help in making it competitive - some challenges might be too tricky for implementing in golfing languages, but doable machine code.&lt;/p&gt;&#xA;" OwnerUserId="25315" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2016-11-23T07:55:21.307" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10663" PostTypeId="2" ParentId="1324" CreationDate="2016-11-23T08:26:10.890" Score="-6" Body="&lt;h1&gt;&quot;N random X&quot;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Where N denotes a natural number and X denotes (members of) a set with finite cardinality.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The standard definition for &quot;N random X&quot; is &quot;&lt;strong&gt;N independent identically distributed uniform (pseudo-) random samples from the space of all X&lt;/strong&gt;&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a concrete case &quot;generate 3 random printable ASCII characters&quot; could be satisfied by &lt;code&gt;[1,2,3].map(_=&amp;gt;String.fromCharCode(Math.random()*95+32))&lt;/code&gt; in JavaScript (ES6).&lt;/p&gt;&#xA;" OwnerUserId="56071" LastActivityDate="2016-11-23T08:26:10.890" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10664" PostTypeId="1" AcceptedAnswerId="10666" CreationDate="2016-11-23T09:21:53.237" Score="-7" ViewCount="148" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10656/26997&quot;&gt;Another meta post&lt;/a&gt; is talking about making changes to the &lt;a href=&quot;https://codegolf.stackexchange.com/questions?sort=votes&quot;&gt;popular&lt;/a&gt; but currently locked challenge &lt;a href=&quot;https://codegolf.stackexchange.com/q/44680/26997&quot;&gt;Showcase of Languages&lt;/a&gt; in response to the debates that have been happening about it &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10457/26997&quot;&gt;here&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10636/26997&quot;&gt;here&lt;/a&gt; and in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;chat&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10656/26997&quot;&gt;meta post&lt;/a&gt; is currently only 13 hours old. It does have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10657/26997&quot;&gt;high voted answer&lt;/a&gt; from Dennis, but he explicitly says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;These are my own, personal ideas&lt;/em&gt;; they are not fleshed out, and feedback, improvements, and additional ideas are welcome&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So obviously more time is needed to finalize things in that answer, or to wait for other answers and ideas.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question here is simply, should we unlock the Showcase &lt;em&gt;immediately&lt;/em&gt; until the results of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10656/26997&quot;&gt;Making an exception for the &amp;quot;Showcase of Languages&amp;quot;&lt;/a&gt; are clear, i.e. until we decide precisely what to do with it?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a simpler question than &quot;what should we do with the Showcase&quot;. All I'm asking here is:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Should the Showcase be unlocked &lt;em&gt;immediately&lt;/em&gt; and put back to normal until we decide what to do with it, or&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Should it be kept locked until we decide what to do with it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;No other options.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The Showcase was locked in direct denial of what the community wanted in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10457/26997&quot;&gt;Proposal to lock the Language Showcase as historically significant&lt;/a&gt;. The top 4 answers there are against locking the showcase.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The Showcase was kept locked despite the popular answer to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10636/should-showcase-your-language-one-vote-at-a-time-be-unlocked-and-reopened&quot;&gt;Should &amp;quot;Showcase your language one vote at a time&amp;quot; be unlocked and reopened?&lt;/a&gt; saying it should be unlocked.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10656/26997&quot;&gt;new meta post&lt;/a&gt; should be viewed as a &lt;em&gt;new&lt;/em&gt; proposal about changing the Showcase. It is not our policy to lock or change challenges simply because a meta post about them exists. We wait until that meta post is finalized.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-11-23T09:51:24.233" Title="Should “Showcase your language one vote at a time” be immediately unlocked until we decide what to do with it?" Tags="|discussion|specific-question|reopening|" AnswerCount="2" CommentCount="0" ClosedDate="2016-11-23T18:13:44.897" ContentLicense="CC BY-SA 3.0" />
  <row Id="10665" PostTypeId="2" ParentId="10664" CreationDate="2016-11-23T09:21:53.237" Score="-7" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;We should unlock the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44680/showcase-your-language-one-vote-at-a-time&quot;&gt;Showcase&lt;/a&gt; &lt;em&gt;immediately&lt;/em&gt; until &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10656/26997&quot;&gt;Making an exception for the &amp;quot;Showcase of Languages&amp;quot;&lt;/a&gt; has more time to accrue answers and comments, until we can agree its decision is final.&lt;/p&gt;&#xA;&lt;p&gt;Remember:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;There &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10459/26997&quot;&gt;was&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10467/26997&quot;&gt;never&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10492/26997&quot;&gt;a&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10470/26997&quot;&gt;concensus&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10637/26997&quot;&gt;to&lt;/a&gt; lock the Showcase in the first place. Doing it was a mistake.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There is no policy that we lock challenges just because a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10656/26997&quot;&gt;meta post&lt;/a&gt; exists about them.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-23T09:29:34.343" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10666" PostTypeId="2" ParentId="10664" CreationDate="2016-11-23T09:51:24.233" Score="8" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;What's the huge hurry? It's been &lt;em&gt;13 hours&lt;/em&gt; since &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10656/20260&quot;&gt;Dennis's meta post&lt;/a&gt;. That not's even be long enough to sandbox a challenge. Many users don't check meta that often. Some even sleep. The point is to discuss. Just wait.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Besides, re-opening with no changes corresponds to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10659/20260&quot;&gt;this answer&lt;/a&gt;, which is at +4/-6 as of this writing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Frankly, I find this request ridiculous. &quot;&lt;em&gt;Immediately&lt;/em&gt;&quot; is at best the many hours this new meta takes to gather consensus. I can't see how this is supposed to speed up the process.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-11-23T09:51:24.233" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10667" PostTypeId="1" AcceptedAnswerId="10669" CreationDate="2016-11-23T10:16:34.900" Score="2" ViewCount="89" Body="&lt;p&gt;I am having some code snippets with me. I want clear explanations about that snippets. Shall I ask these kind of questions in this Programming Puzzle community? If not where do I ask such questions?&lt;/p&gt;&#xA;" OwnerUserId="62606" LastEditorDisplayName="user45941" LastEditDate="2016-11-23T15:20:45.780" LastActivityDate="2016-11-23T18:52:43.163" Title="Do I ask question to explain the given snippet here?" Tags="|support|asking-questions|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10668" PostTypeId="2" ParentId="9619" CreationDate="2016-11-23T10:28:25.513" Score="17" Body="&lt;h1&gt;Haskell&lt;/h1&gt;&#xA;&lt;h2&gt;Haskell is &lt;em&gt;the&lt;/em&gt; functional language&lt;/h2&gt;&#xA;&lt;p&gt;Want to dive into the deep end of functional programming?&#xA;In Haskell, lambdas are cheap, higher order functions are powerful, and all operations short-circuit by default.&#xA;Golfed Haskell code is often mind-bending, not because of magic variables with arbitrary rules, but because it can manipulate infinite lists and function-transforming functions like other languages manipulate numbers and strings.&#xA;On the other hand, Haskell has a slightly cumbersome I/O model, you cannot reassign or mutate variables, and the powerful type system sometimes gets in the way of golfing.&#xA;I don't view these as shortcomings of the language, but as interesting challenges that force me to golf in novel ways.&lt;/p&gt;&#xA;&lt;h2&gt;Pattern matching&lt;/h2&gt;&#xA;&lt;p&gt;Haskell has really economical pattern matching syntax, and while not as flexible as Mathematica's, it beats most other languages in this respect.&#xA;It is especially convenient in case of lists.&#xA;Let's define a function &lt;code&gt;f&lt;/code&gt; that splits a list at the second occurrence of the first element, e.g. &lt;code&gt;[0,2,2,3,0,1,0,1] -&amp;gt; ([0,2,2,3],[0,1,0,1])&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;f(x:y)|(a,b)&amp;lt;-span(/=x)y=(x:a,b)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here, &lt;code&gt;f&lt;/code&gt; takes a list with head &lt;code&gt;x&lt;/code&gt; and tail &lt;code&gt;y&lt;/code&gt;.&#xA;We use the &amp;quot;pattern guard&amp;quot; syntax &lt;code&gt;|&lt;/code&gt; to bind the result of &lt;code&gt;span(/=x)y&lt;/code&gt; (split &lt;code&gt;y&lt;/code&gt; into the longest prefix where all elements &lt;code&gt;z&lt;/code&gt; satisfy &lt;code&gt;z/=x&lt;/code&gt;, and the rest) to the pattern &lt;code&gt;(a,b)&lt;/code&gt;.&#xA;The function &lt;code&gt;span&lt;/code&gt; returns a pair, and instead of giving it a name, we name its two components.&#xA;On the right of &lt;code&gt;=&lt;/code&gt; is the result of &lt;code&gt;f&lt;/code&gt;, where &lt;code&gt;x&lt;/code&gt; has been tacked back to the first part of &lt;code&gt;y&lt;/code&gt;.&#xA;Simple, right?&lt;/p&gt;&#xA;&lt;h2&gt;Laziness&lt;/h2&gt;&#xA;&lt;p&gt;Haskell is &lt;em&gt;lazy&lt;/em&gt; by default: computations are not performed until you request their result.&#xA;This is a generalization of the short-circuiting behavior of Boolean operations that many languages have.&#xA;For golfing, the most important application are infinite lists, which are a bit like iterators/generators in more &amp;quot;normal&amp;quot; languages.&#xA;In fact, the function &lt;code&gt;f&lt;/code&gt; we defined above readily works for them!&#xA;We can try it on the infinite cyclic list &lt;code&gt;[0,1,2,3,0,1,2,3,...]&lt;/code&gt;, and extract only the left part of the result:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; let (a,b) = f(cycle[0,1,2,3]) in a&#xA;[0,1,2,3]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We bound the result to the pair &lt;code&gt;(a,b)&lt;/code&gt; and extracted &lt;code&gt;a&lt;/code&gt;; since the infinite tail &lt;code&gt;b&lt;/code&gt; wasn't needed, Haskell didn't bother computing it.&#xA;For a more involved example, see &lt;a href=&quot;https://codegolf.stackexchange.com/a/45798/32014&quot;&gt;this answer&lt;/a&gt; where I define an infinite list in terms of itself and take the first &lt;code&gt;n&lt;/code&gt; elements of it.&lt;/p&gt;&#xA;&lt;h2&gt;Higher-order functions&lt;/h2&gt;&#xA;&lt;p&gt;The Haskell standard library has a large collection of useful higher-order functions (functions that take other functions as arguments), and you can get access to many more by &lt;code&gt;import&lt;/code&gt;s.&#xA;We have the usual suspects: &lt;code&gt;.&lt;/code&gt; for function composition, &lt;code&gt;map&lt;/code&gt; for applying a function to every value in a list, and &lt;code&gt;foldr&lt;/code&gt; for reducing a list by a binary function.&#xA;The more exotic functions include &lt;code&gt;iterate&lt;/code&gt;, which gives the infinite list of repeated applications of a function, and &lt;code&gt;=&amp;lt;&amp;lt;&lt;/code&gt;, whose behavior depends on the types of its arguments; on lists it's &amp;quot;map, then concatenate&amp;quot;, and on functions it's &amp;quot;compose with extra argument&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;code&gt;span&lt;/code&gt; function we used earlier is also a higher-order function, since its argument &lt;code&gt;(/=x)&lt;/code&gt; is a function.&#xA;Haskell's syntax makes it really easy to create auxiliary functions: you can partially apply operators as above, create an anonymous function with &lt;code&gt;\x-&amp;gt;x+2&lt;/code&gt;, and every function with missing arguments is automatically curried.&#xA;For example, &lt;code&gt;span(/=2)&lt;/code&gt; is a function that splits a list on the first occurrence of &lt;code&gt;2&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.haskell.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Haskell home page&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://tryhaskell.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;An online interpreter&lt;/a&gt; (only for short expressions)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://rextester.com/l/haskell_online_compiler&quot; rel=&quot;nofollow noreferrer&quot;&gt;An online compiler&lt;/a&gt; with save feature&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://learnyouahaskell.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;A great beginner's guide&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/19255/tips-for-golfing-in-haskell&quot;&gt;Our tips page&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="95792" LastEditDate="2021-06-03T14:01:05.567" LastActivityDate="2021-06-03T14:01:05.567" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="10669" PostTypeId="2" ParentId="10667" CreationDate="2016-11-23T10:43:06.170" Score="7" Body="&lt;p&gt;No, you should not ask this kind of a question here.&#xA;Our community is about programming competitions.&#xA;&lt;a href=&quot;https://stackoverflow.com/&quot;&gt;Stack Overflow&lt;/a&gt; is probably the right place for your question (but make sure you read their &lt;a href=&quot;https://stackoverflow.com/help/how-to-ask&quot;&gt;how to ask page&lt;/a&gt; first, it will help you to get better answers).&lt;/p&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2016-11-23T10:43:06.170" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10670" PostTypeId="2" ParentId="2140" CreationDate="2016-11-23T16:41:08.580" Score="2" Body="&lt;h1&gt;ROT-13? More like ROT-Rand!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This challenge is to take the following list of characters (ASCII 32 to 126):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; !&quot;#$%&amp;amp;'()*+,-./0123456789:;&amp;lt;=&amp;gt;?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Randomly shuffle it:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;wypP+]`=3&amp;amp;IJ6*xAh{zi_l4Y#k~S F?-oReU;(0m,Z5'trs!aLCQ/g}OjM&amp;lt;u[qE2)BTVb$&amp;gt;19%c:HW@8.&quot;nD\Nf7dXKv^|G&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Take in an input string:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ROT-Rand!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then replace the characters in the string, with their new shuffled equivalents:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;C!/*CB@by&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Using this methodology on large ASCII-based/dictionary based texts would result in something that is decipherable using much trial and error and would be a decent way to encode a long message. &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; !&quot;#$%&amp;amp;'()*+,-./0123456789:;&amp;lt;=&amp;gt;?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~&#xA;wypP+]`=3&amp;amp;IJ6*xAh{zi_l4Y#k~S F?-oReU;(0m,Z5'trs!aLCQ/g}OjM&amp;lt;u[qE2)BTVb$&amp;gt;19%c:HW@8.&quot;nD\Nf7dXKv^|G&#xA; ^           ^                                    ^              ^  ^         ^^    ^&#xA; !           -                                    R              a  d         no    t&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Your only input is the text to be &quot;encrypted&quot;.&lt;/li&gt;&#xA;&lt;li&gt;Your output is the encrypted string.&lt;/li&gt;&#xA;&lt;li&gt;The ASCII list must be randomly shuffled, built-ins are allowed.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, shortest in bytes wins.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="59376" LastEditDate="2016-11-23T16:46:27.370" LastActivityDate="2016-11-23T16:46:27.370" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10672" PostTypeId="2" ParentId="2140" CreationDate="2016-11-23T17:44:06.387" Score="0" Body="&lt;h1&gt;Give those numbers some space! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The numbers have had it. They're through being put in order all the time. They're all sick of their neighbors, and want to be moved as far away as possible. Your goal is to help them be happy!&lt;/p&gt;&#xA;&lt;p&gt;The 'happiness' of a number is represented by the difference between it and it's next neighbor. For example, an ordered sequence of 0 through 9 looks like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 1 2 3 4 5 6 7 8 9&#xA; v v v v v v v v v&#xA; 1 1 1 1 1 1 1 1 1 = 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;A pretty unhappy sequence. But with a little work, we can fix that!&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 2 4 6 8 1 3 5 7 9&#xA; v v v v v v v v v&#xA; 2 2 2 2 7 2 2 2 2 = 23&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In this example, we've shuffled the numbers around a little, for a total happiness of 23. Better, but I'm sure we can make them even happier!&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 9 1 8 2 7 3 6 4 5&#xA; v v v v v v v v v&#xA; 9 8 7 6 5 4 3 2 1 = 45&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is the maximum happiness for this sequence. Perfect!&lt;/p&gt;&#xA;&lt;p&gt;Our only problem is that there is a lengthy review before they can be moved around. Due to this, your code has to be as short as possible to speed up the process.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;Your program or function will take a list of positive integers in any reasonable format (list, array, string, etc). The list is in ascending order.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Output is going to be a list of integers in any reasonable format, representing the sequence of numbers arranged for maximum happiness.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;1 2 3 4 5 6 7 8 9 0&amp;quot;   -- A string is acceptable, as long as the numbers are separated by a character. &#xA;&amp;quot;6@5@4@3@2@1@7@8@9@0&amp;quot;   -- Any non-numeric character is acceptable as a separator, including newlines.&#xA;[0,1,2,3,4,5,6,7,8,9] -- The list represented as an array&#xA;&amp;quot;0123456789&amp;quot;             -- Not acceptable, no way to tell which numbers are which.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;{I'm trying to open up the challenge to many different ways of solving, feel free to offer suggestions}&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="52661" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-25T12:54:07.293" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10673" PostTypeId="2" ParentId="686" CreationDate="2016-11-23T18:46:41.963" Score="4" Body="&lt;p&gt;I believe that posting this sort of information with an answer is a good idea, and really adds to the site; I tend to post long, detailed explanations with my answers if they're at all nontrivial. (Some answers really are just doing things in the most direct possible way, though, and are immediately clear upon reading them if you know the language; I don't think explaining these would be helpful unless the language is particularly hard to read, such as a golfing language.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't believe that deleting or downvoting answers that lack an explanation is a good thing, even if the answer is unexplained and would benefit from an explanation. Feel free to ask for an explanation in the comments (and in the admittedly rare case where you can provide one yourself, ask the author if they're willing to let you edit an explanation into their answer), and feel free to not upvote an answer you'd normally otherwise upvote because it's missing an explanation (especially given that you shouldn't be upvoting answers &lt;em&gt;merely&lt;/em&gt; for being short in the first place); we should be encouraging explanations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I don't think we should be &lt;em&gt;requiring&lt;/em&gt; explanations. In addition to the fact that sometimes there just isn't that much to explain (as is the case in many but not all &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; answers, for example), I think an unexplained answer still contributes to the site rather than detracting from it; not as much as an explained answer would, but it's still useful. Even if it has no real hope of winning, the experience that the answerer got writing it will tend to help them out, both in doing better at answering questions in the future, and in being better at writing explanations. And if it is a serious competitor, it's highly likely that either the answerer will be able to edit in an explanation on request, or that someone else will.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2016-11-23T18:46:41.963" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10676" PostTypeId="2" ParentId="2140" CreationDate="2016-11-23T21:48:04.300" Score="3" Body="&lt;h1&gt;Will the snake bump into itself?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a string containing &lt;code&gt;NESW&lt;/code&gt; characters, check if a snake will bump into itself if it moves like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The snake starts out with length 2.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For every character in the string:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the character is &lt;code&gt;N&lt;/code&gt;, move the head of the snake up one.&lt;/li&gt;&#xA;&lt;li&gt;If the character is &lt;code&gt;E&lt;/code&gt;, move the head of the snake right one.&lt;/li&gt;&#xA;&lt;li&gt;If the character is &lt;code&gt;S&lt;/code&gt;, move the head of the snake down one.&lt;/li&gt;&#xA;&lt;li&gt;If the character is &lt;code&gt;W&lt;/code&gt;, move the head of the snake left one.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The rest of the snake follows the path of the head of the snake.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The snake grows 1 unit longer every 2 moves.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to determine if the snake will bump into itself, and give a truthy or falsey value accordingly.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Truthy Inputs&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;NS&#xA;NWSSENW&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Falsey Inputs&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;NNN&#xA;SS&#xA;NWNNNWWWSSS&#xA;NWNNEEEESSS&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;More test cases coming soon.&lt;/p&gt;&#xA;" OwnerUserId="12537" LastActivityDate="2016-11-23T21:48:04.300" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10677" PostTypeId="2" ParentId="10656" CreationDate="2016-11-23T22:56:52.940" Score="-1" Body="&lt;h2&gt;Obsolete the rule once for all&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;There are either too many possible answers, or good answers would be too long for this format.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/55422/25180&quot;&gt;One answer per language is not too many.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/40812/25180&quot;&gt;95 snippets per answer is not too long.&lt;/a&gt; Note that we have less than 200 answers with more than 95 votes on the whole site. The answers are not really expected to be that long.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/40073/25180&quot;&gt;Allowing doing anything is not too bad.&lt;/a&gt; Note that everyone can invent their own languages.&lt;/p&gt;&#xA;&lt;p&gt;Making a single exception would just bring more arguments in these cases.&lt;/p&gt;&#xA;&lt;p&gt;We may try to fix the wording. For example:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are too many &lt;em&gt;apparently competitive&lt;/em&gt; answers.&lt;/li&gt;&#xA;&lt;li&gt;There are general answers &lt;em&gt;irrelevant to the question&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The answers are supposed to be big projects that practically have to consider the &lt;em&gt;quality measures not objectively defined in the question&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;But I'm not sure if it works. In fact, we are not a QA site and many of the rules don't apply, and we did't seem to have consensus about what is too broad on our site in the first place. Someone should post another question about the exact terms if we really want to do that.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://xkcd.com/927/&quot; rel=&quot;nofollow noreferrer&quot;&gt;We have 3 problems now&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Is it a bad question?&lt;/li&gt;&#xA;&lt;li&gt;Do we close it?&lt;/li&gt;&#xA;&lt;li&gt;Do we make exceptions or change the rules?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;I'd say it's not a perfect question. But we are not going to close every imperfect question.&lt;/p&gt;&#xA;&lt;p&gt;I'm not exactly sure whether we should close it or not. But we don't have to make rules to cover every case. There are cases where we should absolutely close the question, and cases where we should absolutely not, but there are also cases that it might be better to leave for the community to decide. That is, they could be technically allowed but subjectively a bit broad. If we try to make it exactly clear, it's likely our rules will be filled with contrived situations and not the obvious cases nobody is bothered to argue with.&lt;/p&gt;&#xA;&lt;p&gt;A general rule makes sense only if it also makes some differences to other questions. But we have no idea what a question similar to this one (but isn't a duplicate) would be like. If we try to decide whether we should make exceptions, the implication is, other questions (that we had no idea what they are) similar to this one are all on-topic / all off-topic. That's indeed something ain't broken.&lt;/p&gt;&#xA;&lt;p&gt;One reason to lock the question is to not encourage similar questions. We don't even have an idea whether we should encourage them.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-23T22:56:52.940" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10678" PostTypeId="2" ParentId="2140" CreationDate="2016-11-23T23:37:44.340" Score="-2" Body="&lt;h1&gt;Golf + Polyglot + Circle = ?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/99674/make-three-polyglots-that-make-each-other-and-golf-two-of-them&quot;&gt;the original challenge&lt;/a&gt;, we asked you to do this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Program | Language | Result&#xA;--------|----------|----------&#xA;A       | A        | Program B&#xA;B       | B        | Program A&#xA;A       | B        | Program C&#xA;B       | A        | Program C&#xA;C       | A        | &quot;Wrong language!&quot; &#xA;C       | B        | &quot;Wrong language!&quot; &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now we're asking you to do this*:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Program | Language | Result&#xA;--------|----------|----------&#xA;1       | 1        | Program 2&#xA;2       | 2        | Program 3&#xA;3       | 3        | Program 4&#xA;        |    ...   |&#xA;X       | X        | Program 1&#xA;--------|----------|----------          &#xA;1       | Any but 1| Any member of Set %&#xA;2       | Any but 2| Any member of Set %&#xA;        |    ...   |&#xA;X       | Any but X| Any member of Set %&#xA;------------------------------&#xA;Set %   | Any lang | &quot;Wrong language!&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/99674/make-three-polyglots-that-make-each-other-and-golf-two-of-them&quot;&gt;(see original challenge for clarification)&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do not grab source off of internet, or read own code from file&lt;/li&gt;&#xA;&lt;li&gt;Programs don't have to be distinct - you can make a polyglot quine&lt;/li&gt;&#xA;&lt;li&gt;Don't take input for any of the programs&lt;/li&gt;&#xA;&lt;li&gt;Different versions of the same language count do as different languages. (although this is discouraged because it leads to boring solutions)&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Score is &lt;code&gt;byte_count_of_program_one/2.75**languages_supported&lt;/code&gt;, the submission with the lowest score wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Template&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Because of its length, &lt;a href=&quot;https://gist.github.com/CrazyPython/3378b47affe73e1825ff4cb179a83e17&quot; rel=&quot;nofollow noreferrer&quot;&gt;the answer template is here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;*not that I'm expecting X to be so large&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="41088" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:27.967" LastActivityDate="2016-11-24T18:27:41.317" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10682" PostTypeId="1" CreationDate="2016-11-24T01:33:48.070" Score="3" ViewCount="223" Body="&lt;p&gt;I have an Idea for a set of four challenges. The first round is a double popularity contest. Specifically two questions each linking each other with identical requirements but different judging requirements. Each answer should be posted to both contests but should score differently in each. Specifically in this case one will be the silliest answer, and the other will be the most impressive answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Just to note the second round would be a set of golfs where the winning answers from the first round would be golfed. Also the theme would be a polyglot generator.&lt;/p&gt;&#xA;" OwnerUserId="10731" LastActivityDate="2016-12-05T23:26:58.573" Title="Is a double popularity contest a bad idea?" Tags="|discussion|challenges|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10683" PostTypeId="2" ParentId="2140" CreationDate="2016-11-24T04:45:19.503" Score="7" Body="&lt;h2&gt;Give numbers space &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a list of integers, adjust each number by at most ±1 so that in the resulting list, each number is at least 2 apart from each of its neighbors. That each, each entry &lt;code&gt;n&lt;/code&gt; can be replaced with &lt;code&gt;n-1&lt;/code&gt;, &lt;code&gt;n&lt;/code&gt;, or &lt;code&gt;n+1&lt;/code&gt;, and any two adjacent entries &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; must have &lt;code&gt;abs(x-y) ≥ 2&lt;/code&gt;. The output is a list of the same length as the input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will not get an input where this is impossible, such as &lt;code&gt;[5, 4, 4, 5]&lt;/code&gt;. The input will have at least two elements.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples (other outputs are possible):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[-5, -6] -&amp;gt; [-5, -7]&#xA;[1, 1, 1] -&amp;gt; [2, 0, 2]&#xA;[2, 2, 3, 3] -&amp;gt; [3, 1, 4, 2]&#xA;[0, 5, -1] -&amp;gt; [0, 5, -1]&#xA;[4, 4, 4, 4, 4, 4, 4, 3, 3, 3] -&amp;gt; [5, 3, 5, 3, 5, 3, 5, 2, 4, 2]&#xA;[4, 4, 4, 4, 4, 4, 4, 5, 5, 5] -&amp;gt; [3, 5, 3, 5, 3, 5, 3, 6, 4, 6]&#xA;[1, 1, 2, 4, 6, 7, 7] -&amp;gt; [2, 0, 2, 4, 6, 8, 6]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2019-04-16T02:27:02.793" LastActivityDate="2019-04-16T02:27:02.793" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="10684" PostTypeId="1" CreationDate="2016-11-24T07:20:35.750" Score="13" ViewCount="459" Body="&lt;p&gt;Some time ago I asked a question &lt;a href=&quot;https://codegolf.stackexchange.com/q/100663/32091&quot;&gt;8 ought to become Infinity&lt;/a&gt;, which was closed as&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&quot;Questions without an objective primary winning criterion are off-topic, as they make it impossible to indisputably decide which entry should win.&quot; – Conor O'Brien, BlueEyedBeast, Wheat Wizard, Mego&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Currently it has 8 upvotes and 6 downwotes. What's wrong with this challenge?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;According to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8242/32091&quot;&gt;The state of the popularity contest tag&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; is ontopic. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;According to tag description:&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Qualities of good popularity contests&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A challenge with clear specifications that still allow for creative problem solving.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I think, it is. At least I don't see any questions about specification in comments.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A challenge where solutions that best solve the problem are also solutions that the voters are going to like.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The same thing.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Gives freedom to entrants to decide what to do in crucial parts and incentivizes them to use this freedom.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;A lot of different solutions in different languages are possible.&lt;br&gt;&#xA;There are a lot of different approaches depending on the language you chose.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;It is strongly suggested to submit the challenge to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;Sandbox&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The question was asked on language-specific site and rules were polished.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Things that MUST be included in a popularity contest&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A popularity contest &lt;em&gt;must&lt;/em&gt; always include an &lt;em&gt;objective validity criterion&lt;/em&gt;, which is a set of rules that regulate what every answer &lt;em&gt;must&lt;/em&gt; comply with. Answers that do not comply are invalid and will be removed.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Yes. There is a set of xections about that.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A clear specification of the goal that must be achieved. Questions like &lt;em&gt;&quot;do (this) the most creative way&quot;&lt;/em&gt; should be avoided. Creativity should be the tool, not the goal.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Same thing.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Qualities which should be AVOIDED in popularity contests&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Asking to solve a specific task in a very specific way, without room for creativity.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;There is enough place for creativity.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Asking to solve a vaguely defined task in any way that the entrant wants (this will probably make your question be closed as too broad).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;No.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Rules what people should consider when voting. In the past this has consistently never worked out. These sort of questions would be better off as a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; with specific winning criteria.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;No.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;According to comments:&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;How about removing the language restriction, and replacing the for loop with something more general (and have the extension points only be before and after the clean code). Maybe something like print something 8 times for the clean task, and have the clean task go on forever, for the augmented task – &lt;a href=&quot;//codegolf.stackexchange.com/questions/100663/8-ought-to-become-infinity#comment244374_100663&quot;&gt;Maltysen 2 days ago&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;@Maltysen, there is a lot of interesting solutions in languages with these construction. There are C and C++ (with absolutely different solutions), C#, Java, Javascript, php, Perl, Groovy. I'm sure there are much more. Anyway, I'm open to enlarge question and that's specified in rules. If you can make something iteresting in other language - post it. If it will have positive reation, rules can be enlarged.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Doing this as a popularity-contest is a little awkward because there's no description of what criteria voters should choose when voting (making the victory condition subjective). I was working on a code-golf solution on the basis that many people here find golf solutions interesting and thus it might be popular; that seems like it might be a workable victory condition for the challenge. – &lt;a href=&quot;//codegolf.stackexchange.com/questions/100663/8-ought-to-become-infinity#comment244385_100663&quot;&gt;ais523 2 days ago&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;@ais523, no code-golf doen't suit for this challenge as 1. Interesting solutions with reflection or code patching are not good for golfing, also they are much better in readable state then in golfed. 2. C/C++ solution will win in 13 chars. 3. The other very cool C++ only solution will have 16 chars.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;@ais523, &quot;there's no description of what criteria voters should choose when voting&quot; let's take a look at popularity-contest description: &quot;Qualities which should be AVOIDED in popularity contests ... Rules what people should consider when voting. In the past this has consistently never worked out.&quot;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;So I don't see anything wrong with the challenge. Is there anything to be fixed?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="32091" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-11-26T20:03:38.913" Title="What's wrong with popularity contest?" Tags="|discussion|specific-question|" AnswerCount="0" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10685" PostTypeId="1" CreationDate="2016-11-24T08:19:41.573" Score="5" ViewCount="170" Body="&lt;p&gt;&lt;a href=&quot;https://esolangs.org/wiki/Minipy&quot; rel=&quot;nofollow noreferrer&quot;&gt;Minipy&lt;/a&gt; is an extension to Python 3 that changes the names of many functions, adds other useful functions, and automatically imports modules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because it &lt;em&gt;is&lt;/em&gt; Python (Just with assignment statements prepended to every program), it naturally satisfies our conditions for a programming language. Every Python program is a valid Minipy program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider a 116-byte golfed Python quicksort:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def q(s):&#xA; l=len(s)&#xA; if l&amp;lt;2:return s&#xA; p=s[math.randint(0,l-1)];return q(x for x in s if x&amp;lt;p)+q(x for x in s if x&amp;gt;=p)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Using the same algorithm, Minipy beats it with 76 bytes:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def q(k):&#xA; if l(k)&amp;lt;2:return k&#xA; p=rt(k);return q(ff(&quot;y&amp;gt;p&quot;,k))+q(ff(&quot;y&amp;lt;=p&quot;,k))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;While Minipy programs are not as small as a golfing language, it does make Python more competitive in many situations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is Minipy fair?&lt;br&gt;&#xA;Should Minipy be considered its own language and distinguished from Python?&lt;/p&gt;&#xA;" OwnerUserId="61384" LastActivityDate="2016-11-24T08:28:56.370" Title="Is Minipy fair?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ClosedDate="2016-11-26T13:56:25.250" ContentLicense="CC BY-SA 3.0" />
  <row Id="10686" PostTypeId="2" ParentId="10685" CreationDate="2016-11-24T08:19:41.573" Score="12" Body="&lt;h2&gt;Yes, it is fair and different from Python&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm answering my own question to share my opinion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Python programs can be very trivially golfed into Minipy, so Python golfers could simply translate their submission. Even if a normal Python submission does not beat most golfing languages, it may still contain insights and new approaches that could be used. Minipy allows Python to be more competitive while still retaining the underlying language itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Languages are not just defined by their syntax and executional model – they are defined by their builtins. Prepending code to every program does make a new language. For example, you can &lt;a href=&quot;https://esolangs.org/wiki/Emmental#Computability_class&quot; rel=&quot;nofollow noreferrer&quot;&gt;transform Underload programs into Emmental programs&lt;/a&gt; by prepending Emmental code. A different set of builtins can make a difference regardless of the syntax (Might Ruby be more competitive with Mathematica builtins, for example), and golfing languages usually have a large amount of built-in operations, which can often be just as important as the language structure. Because of these reasons, I think adding or modifying Python's builtins is completely fair and results in a completely different language.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="61384" LastEditDate="2016-11-24T08:28:56.370" LastActivityDate="2016-11-24T08:28:56.370" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10687" PostTypeId="2" ParentId="2140" CreationDate="2016-11-24T08:30:34.973" Score="2" Body="&lt;h1&gt;Roflcopter &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/animation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;animation&amp;#39;&quot; rel=&quot;tag&quot;&gt;animation&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to print animated helicopter.&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Animation should contain at least two frames.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Delay between frames is up to you, but rotation of airscrews should be visible.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Helicopter could be very simple (simpler than standard roflcopter showed below) but it should leave no doubt what is it. All ASCII chars are allowed.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No caption below needed.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Printing animation to file would be hard, although all standard output destinations are allowed.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so etc.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/K1tEu.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/K1tEu.gif&quot; alt=&quot;roflcopter&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I believe I can fly.&lt;/p&gt;&#xA;" OwnerUserId="61574" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-24T08:47:24.557" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10688" PostTypeId="1" CreationDate="2016-11-24T15:28:16.993" Score="5" ViewCount="250" Body="&lt;p&gt;Regarding my challenge: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/100955/help-me-im-lost-in-the-ocean/&quot;&gt;Help me I&amp;#39;m lost in the ocean!&lt;/a&gt; I went to read: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/93/what-details-should-always-be-given-for-a-code-golf-task&quot;&gt;What details should always be given for a code golf task?&lt;/a&gt; and a question raised in my mind. I hope I can ask that here in Meta, if not please let me know and I will delete my question. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;My original idea was to produce a challenge that could be easily solved with a basic simple formula, but that maybe it could also &lt;em&gt;seems&lt;/em&gt; to be complicated for someone, because I wanted to see how people would intepret it and if someone could produce creative or complex solution to a very simple problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To achieve that, I gave all the basic, but complete, minimum information possible that could be needed to solve the problem (which could represent a real life scenario). I didn't add a diagram on purpose, because it would be a &lt;em&gt;visual spoiler&lt;/em&gt; of one possibile solution. I didn't say that at this scale the Earth's curve can be fairly approximated to a plane, and other things.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question was edited and added with many details, diagram and other information that (in my opinion) was implicit in the original simple text.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have no problem with that and I thank everyone who commented, helped, edited, etc. They did a great job and I appreciated that a lot.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I understand that many questions was asked to me in comments to clarify what I thought to be implicit (and was so) or to be understood with intuition that ultimately the simplification of the problem was to solve a right triangle.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So my question: is mandatory for all the challenges  to give complete specifications of the problem, diagrams to every little detail if that means to almost give the way to solve the problem? In other words: &lt;strong&gt;Are possible challenges that have some kind of &lt;em&gt;mistery&lt;/em&gt;, or implicit information, in them so that people must use intuition and discernment to get the solution in the most efficient way?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example: I have a problem for which the solution is &lt;code&gt;2*2=4&lt;/code&gt;, I want to represent the problem in a way that is not so intuitive that one have to do just &lt;code&gt;2*2=4&lt;/code&gt; but there could be many other more complex solutions. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;(NOTE: I originally posted the question in the sandbox for more than one day and nothing was commented of what came out later when published on the main site.)&lt;/p&gt;&#xA;" OwnerUserId="59718" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-11-25T15:31:36.840" Title="Should I always give every minimum detail and specifications about a challenge or we can rely also on intuition?" Tags="|discussion|challenge-quality|contest-type|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10689" PostTypeId="2" ParentId="2140" CreationDate="2016-11-24T16:21:24.767" Score="3" Body="&lt;h1&gt;Implement the sin function.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For those unfamiliar with trignometry. The &lt;a href=&quot;http://www.wolframalpha.com/input/?i=sin(x)&quot; rel=&quot;nofollow noreferrer&quot;&gt;sin function&lt;/a&gt; is a mathematical wave function, it can be defined a number of ways, but the canonical definition, is that it is sin(x) gives the ratio of the opposite side of an angle of measure (X) to the hypotenuse of a right triangle &#xA;&lt;hr/&gt;&#xA;Your job is to implement a program or function, that receives an angle (x) in degrees or radians, and outputs sin(x) to an accuracy of +/- .001 for at least the 360 degree values on a circle (or their radian equivalents). You may also specify a range that has width of a minimum of 360 degrees (or 2 pi radians) and require inputs to be converted to an equivalent angle to fit within that range. See the following table for outputs (multiples of 15 degrees are provided). &lt;strong&gt;You may not rely on any inbuilt library for trig functions. (i.e return Math.sin(x) is forbidden, or cos(90-x) or something similar 1/sqrt(tan(x-pi/2)^2+1)).&lt;/strong&gt;&#xA;&lt;hr/&gt;&#xA;(Degrees|Radians|Sin)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;0|0.0|0.0&#xA;15|0.2617993877991494|0.25881904510252074&#xA;30|0.5235987755982988|0.49999999999999994&#xA;45|0.7853981633974483|0.7071067811865475&#xA;60|1.0471975511965976|0.8660254037844386&#xA;75|1.3089969389957472|0.9659258262890683&#xA;90|1.5707963267948966|1.0&#xA;105|1.8325957145940461|0.9659258262890683&#xA;120|2.0943951023931953|0.8660254037844387&#xA;135|2.356194490192345|0.7071067811865476&#xA;150|2.6179938779914944|0.49999999999999994&#xA;165|2.8797932657906435|0.258819045102521&#xA;180|3.141592653589793|1.2246467991473532E-16&#xA;195|3.4033920413889422|-0.25881904510252035&#xA;210|3.6651914291880923|-0.5000000000000001&#xA;225|3.9269908169872414|-0.7071067811865475&#xA;240|4.1887902047863905|-0.8660254037844385&#xA;255|4.4505895925855405|-0.9659258262890683&#xA;270|4.71238898038469|-1.0&#xA;285|4.974188368183839|-0.9659258262890684&#xA;300|5.235987755982989|-0.8660254037844386&#xA;315|5.497787143782138|-0.7071067811865477&#xA;330|5.759586531581287|-0.5000000000000004&#xA;345|6.021385919380437|-0.2588190451025207&#xA;360|6.283185307179586|-2.4492935982947064E-16&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;hr/&gt;&#xA;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, but it aims to be a canonical list of trig function implementation in esolangs, especially those without a sin function built in. No answer may rely on a built in method. &lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="46918" LastEditDate="2016-11-26T13:50:16.807" LastActivityDate="2016-11-26T13:50:16.807" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="10691" PostTypeId="2" ParentId="10682" CreationDate="2016-11-24T18:06:12.603" Score="14" Body="&lt;p&gt;No, it will never work. You can't force people to vote a certain way, so one challenge would be a duplicate of the other.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2016-11-24T18:06:12.603" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10692" PostTypeId="2" ParentId="2140" CreationDate="2016-11-24T18:56:19.293" Score="0" Body="&lt;h1&gt;Generate fake PGP keys &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;public&lt;/code&gt; or &lt;code&gt;private&lt;/code&gt;; indicates if the header and footer should say PUBLIC or PRIVATE&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;;&lt;/code&gt; - a delimiter&lt;/li&gt;&#xA;&lt;li&gt;Version string&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;;&lt;/code&gt; - a delimiter&lt;/li&gt;&#xA;&lt;li&gt;Comment string&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;An example input would be: &lt;code&gt;public;Keybase OpenPGP v1.0.0;https://keybase.io/crypto&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output format&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-----BEGIN PGP {PUBLIC|PRIVATE} KEY BLOCK-----&#xA;Version: {VERSION_STRING}&#xA;Comment: {COMMENT_STRING}&#xA;                // newline&#xA;{24 lines of alphanumeric + `/+`, 64 chars each}&#xA;{one 36 char line of alphanumeric + `/+`}&#xA;={four chars of alphanumeric + `/+`}&#xA;-----END PGP {PUBLIC|PRIVATE} KEY BLOCK-----&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program must generate a new fake key every time it is run; and be randomly distributed&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2016-11-24T18:56:19.293" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10693" PostTypeId="2" ParentId="10457" CreationDate="2016-11-24T19:03:30.877" Score="0" Body="&lt;h1&gt;No, Unlock and Reopen, but…&lt;/h1&gt;&#xA;&lt;p&gt;As @Calvin's Hobbies and others state, this community isn't about strict rules and bureaucracy, but about fun &lt;em&gt;as long it is good content&lt;/em&gt;. However, we do not want (or at least I think we do not want) more questions of this nature posted. I think the solution is to unlock and reopen, but post a mod message on the question saying something similar to the historical lock dialog. This way, we can have our cake and eat it too!&lt;/p&gt;&#xA;" OwnerUserId="47670" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-24T19:03:30.877" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10694" PostTypeId="1" CreationDate="2016-11-24T19:47:39.007" Score="4" ViewCount="115" Body="&lt;p&gt;I imagine a form of challenge where users would create their own golfing language that would specialize in a given area (like string handling or ASCII-art) and write an interpreter. After the languages were created, challenges would be revealed and the language creators had to solve each challenge using their language. They could not modify their language after the challenges were revealed. The winner would be the user with the lowest total byte count on all their languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem with this type of challenge is: &lt;em&gt;how do you stop people from creating a language that is just a trivial substitution of an existing one?&lt;/em&gt; For example, I could just change Jelly's encoding to ASCII (And use unprintable characters) and call it a new language. The only solution I can see to this problem is to have it be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, but that's not compatible with the original winning criterion (shortest total code for all the challenges).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Could these types of challenges exist? Are there any other potential problems with this type of challenge and how could they be fixed?&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="61384" LastEditDate="2016-11-24T19:53:27.997" LastActivityDate="2016-11-24T19:53:27.997" Title="Are &quot;Language Challenges&quot; Viable?" Tags="|discussion|" AnswerCount="0" CommentCount="10" ClosedDate="2016-11-30T00:25:55.623" ContentLicense="CC BY-SA 3.0" />
  <row Id="10695" PostTypeId="2" ParentId="10688" CreationDate="2016-11-25T08:56:46.380" Score="5" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;To achieve that, I gave all the basic, but complete, minimum information possible that could be needed to solve the problem&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I disagree, but assuming for the sake of argument that it's true...&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;So my question: is mandatory for all the challenges to give complete specifications of the problem, diagrams to every little detail if that means to almost give the way to solve the problem?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It is mandatory to give sufficient specifications that there is no ambiguity as to whether an answer meets them or not. If that means that you have to draw diagrams and give an exact formula, do so. But &lt;strong&gt;even that isn't sufficient&lt;/strong&gt; where the solution requires calculations with non-integer numbers: then you need to specify the range of possible input and the precision and accuracy required, and do some numerical analysis to prove that it's actually possible to meet the specifications.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5608/194&quot;&gt;See also&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Example: I have a problem for which the solution is 2*2=4, I want to represent the problem in a way that is not so intuitive that one have to do just 2*2=4&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That's a rubbish question. Once one person figures it out, everyone else will do the same. The best that can be done is to incorporate a mechanism for hiding answers, which &lt;a href=&quot;https://codegolf.stackexchange.com/q/24909/194&quot;&gt;has been done&lt;/a&gt; once with a sequence question. It asked people to post md5 hashes of their answers until the deadline. The problem with questions with deadlines is that once the deadline passes they're closed to competition and become clutter.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-11-25T15:31:36.840" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10696" PostTypeId="2" ParentId="10688" CreationDate="2016-11-25T12:08:22.137" Score="-1" Body="&lt;p&gt;I don't think it's necessarily mandatory for every submission to treat the problem in the exact same way, especially given an approximate problem like this that will have an approximate solution. Would it be fair to disqualify programming languages based on the details of the way they did floating-point rounding?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I consider the problem that inspired the question to be clearly stated in this case; it doesn't explicitly state the accuracy required in the input, but it does imply it in the test cases given (it's pretty clear that a sufficient accuracy is either 1 centimetre or half a centimetre at a range of approximately 100 metres, presumably 1 centimetre on the basis that that's the approximate accuracy of the obvious formula that most users have used); I think that even less accurate answers could potentially be allowed if they had a proof explaining why the accuracy would be acceptable in the situation. If you were trying to solve this as a &lt;em&gt;practical problem&lt;/em&gt; (which is how it's framed), that sort of accuracy would be easily enough, and working out that it's enough is part of the problem! And as such, specifying why your answer is accurate enough would be part of the solution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or to put it a different way, I don't think we should automatically close problems just because they require knowledge of the real world and a little common sense. If the question specifies enough information to deduce what sort of answers are acceptable, then people will give those sorts of answers (and that's what happened in the puzzle in question; people widely used the same answers, especially as there were comments stating that that sort of formula was acceptable). When you encounter a practical problem in real life, you don't have a magic puzzle fairy letting you know how accurate you need to be with your answer; if you require that information, you need to figure it out for yourself.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorDisplayName="user62131" LastEditDate="2016-11-25T12:21:47.603" LastActivityDate="2016-11-25T12:21:47.603" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10698" PostTypeId="1" CreationDate="2016-11-25T21:00:10.090" Score="5" ViewCount="110" Body="&lt;p&gt;I got the idea for this question after reading an answer by Martin Ender &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8507/62670&quot;&gt;here&lt;/a&gt;. It more-or-less says: &lt;strong&gt;Functions in stack-based languages can leave the output on the stack&lt;/strong&gt;. This question is also similar to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8737/what-even-is-a-function-by-our-standards&quot;&gt;What even is a “function” by our standards?&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I use &lt;a href=&quot;https://esolangs.org/wiki/Fish&quot; rel=&quot;nofollow noreferrer&quot;&gt;&gt;&amp;lt;&gt;&lt;/a&gt; and to me, a function is just when I store my current location on the stack, jump to the function, and then ultimately return to my previous location. This is similar to how I'd do it in nasm with &lt;code&gt;call&lt;/code&gt; and &lt;code&gt;ret&lt;/code&gt;. So then in some languages, how exactly do we define a function?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I mean, isn't a function just storing your location on the stack, jumping to the function, and then ultimately jumping back? Seems a bit loose considering how big of a role this rule plays for certain esolangs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even when considering &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8738/62670&quot;&gt;this answer by Downgoat&lt;/a&gt; which says &lt;strong&gt;It is a section of code, which can be directly inserted into a program with no modification, and should be able to be assigned/named/referred to in some way.&lt;/strong&gt;, it still leaves it unclear as to what other golfers really would be happy with. In my opinion, many esolangs blur the line between program and function by this definition (I can copy almost any of my &gt;&amp;lt;&gt; programs directly into another &gt;&amp;lt;&gt; program, and jump to it with just &lt;code&gt;.&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&gt;&amp;lt;&gt; and asm would be my two biggest examples of languages with ambiguous functions, but I'm sure there are a lot more.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I ask, what exactly is the criteria for a function? Preferably providing at least one clear example of what is and isn't a function in at least two languages which do not officially define what a function is.&lt;/p&gt;&#xA;" OwnerUserId="62670" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2016-11-26T14:20:44.380" Title="What exactly is the Criteria for a Function?" Tags="|discussion|code-golf|specific-question|" AnswerCount="0" CommentCount="4" ClosedDate="2016-11-26T18:49:37.060" ContentLicense="CC BY-SA 3.0" />
  <row Id="10700" PostTypeId="2" ParentId="2140" CreationDate="2016-11-26T01:30:41.980" Score="2" Body="&lt;h1&gt;Hexasweep: A two-part challenge&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Part 1: The solver &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to solve a Hexasweep puzzle.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A Hexasweep puzzle is set out on a grid of diamonds arranged in hexagonal shapes, of which the board looks like a hexagon, like so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;         _____&#xA;        /\    \&#xA;  _____/ X\____\_____&#xA; /\    \  / XX /\    \&#xA;/X \____\/____/X \____\&#xA;\ X/ XX /\    \ X/    /&#xA; \/____/  \____\/____/&#xA; /\    \  / X  /\    \&#xA;/  \____\/____/  \____\&#xA;\  / XX /\    \  / XX /&#xA; \/____/  \____\/____/&#xA;       \ X/    /&#xA;        \/____/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The above image is composed of 7 hexagons (21 diamonds), and is thus a Hexasweep puzzle of size 2. If you want to expand it, cover the current Hexasweep puzzle with more hexagons (so that there are 19 hexagons - that will make a Hexasweep puzzle of size 3).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each diamond can contain 0, 1 or 2 &quot;bombs&quot;, with bombs depicted as &lt;code&gt;X&lt;/code&gt; above.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The above image would be read from top to bottom, starting from the left:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2,0,0,2,0,2,1,0,1,0,2,0,1,0,0,2,0,0,0,0,2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;That is now the &quot;condensed form&quot; of the puzzle.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Numbers are marked on &quot;intersection points&quot;, to show how many bombs are on the diamonds which are touching those intersection points - the intersection points of this grid are shown below using &lt;code&gt;O&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;         _____&#xA;        /\    \&#xA;  _____/  OO___\_____&#xA; /\    \  OO   /\    \&#xA;/  OO___OO___OO  OO___\&#xA;\  OO   OO   OO  OO   /&#xA; \/___OO  OO___OO____/&#xA; /\   OO  OO   OO    \&#xA;/  OO___OO___OO  OO___\&#xA;\  OO   OO   OO  OO   /&#xA; \/____/  OO___\/____/&#xA;       \  OO   /&#xA;        \/____/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As you can see, there are two &quot;types&quot; of intersection points - those with 3 diamonds touching it, and those with 6 (the one that are touching the edge of the board aren't counted):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  _____&#xA; /\  XX\&#xA;/X OO___\&#xA;\ XOO   /&#xA; \/____/&#xA;&#xA;       /\&#xA; _____/X \_____&#xA; \ XX \ X/    /&#xA;  \____OO____/&#xA;  / XX OO  X \&#xA; /____/  \____\&#xA;      \ X/&#xA;       \/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The two intersections would be marked with &lt;code&gt;4&lt;/code&gt; and &lt;code&gt;8&lt;/code&gt; respectively.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the original Hexasweep puzzle above, the intersection numbers would be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   3&#xA;4 5 4 2&#xA; 2 1 3&#xA;2 4 1 2&#xA;   1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which would be condensed to:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3,4,5,4,2,2,1,3,2,4,1,2,1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Given an input in this &quot;condensed form&quot;, you must output the original puzzle, in &quot;condensed form&quot; (see above).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Specs:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any delimiter for the &quot;condensed form&quot; as input are allowed (it doesn't have to be &lt;code&gt;,&lt;/code&gt; separating the numbers).&lt;/li&gt;&#xA;&lt;li&gt;You may output a list, or a string with any delimiter.&lt;/li&gt;&#xA;&lt;li&gt;Your program must be generalised: it must be able to solve Hexasweep puzzles of any size (at least up to size 4).&lt;/li&gt;&#xA;&lt;li&gt;If there is more than 1 possible answer, your program must output the single character &lt;code&gt;N&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there is a tie, the earlier post is declared the winner.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Part 2: The maker &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/meta-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;meta-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;meta-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to generate the smallest Hexasweep puzzle with a single solution that encodes a binary number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because any diamond in a Hexasweep puzzle can have either 1 or 2 bombs (if the diamond has bombs), you can encode binary numbers into it. In this puzzle (condensed form):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2,0,0,2,0,2,1,0,1,0,2,0,1,0,0,2,0,0,0,0,2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The only digits that matter are the non-zero digits, so this turns into:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2,2,2,1,1,2,1,2,2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Decrement each number by 1:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;111001011&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which is equal to &lt;code&gt;459&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to make a program that generates that Hexasweep puzzle in the smallest grid with a single solution. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Specs:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must output the condensed form of the Hexasweep puzzle.&lt;/li&gt;&#xA;&lt;li&gt;You can output either an array of numbers, or a string with any delimiter.&lt;/li&gt;&#xA;&lt;li&gt;You will be tested on all positive integers from &lt;code&gt;10,000&lt;/code&gt; to &lt;code&gt;15,000&lt;/code&gt;, and your program is expected to return a value for any integer in &lt;code&gt;10&lt;/code&gt; minutes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your final score is the total size grid for every test integer added together (so if you get a size &lt;code&gt;3&lt;/code&gt; grid for every number, your final score would be &lt;code&gt;15,000&lt;/code&gt;). The lowest score is declared the winner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there is a tie, the earlier post is declared the winner.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Meta:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should this be one challenge or two? If it's one challenge, should the score just be added up for both programs?&lt;/li&gt;&#xA;&lt;li&gt;Any improvements in explanation?&lt;/li&gt;&#xA;&lt;li&gt;Is this a dupe?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="49561" LastEditDate="2016-11-26T01:49:57.647" LastActivityDate="2016-11-26T01:49:57.647" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10703" PostTypeId="2" ParentId="2140" CreationDate="2016-11-26T14:04:12.077" Score="1" Body="&lt;h1&gt;Shooting range&lt;/h1&gt;&#xA;&lt;p&gt;Print/output this exact text:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;                   _&#xA;                  / \&#xA;                 / _ \&#xA;                / / \ \&#xA;               / / _ \ \&#xA;              / / / \ \ \&#xA;             / / / _ \ \ \&#xA;            / / / / \ \ \ \&#xA;           / / / / _ \ \ \ \&#xA;          / / / / / \ \ \ \ \&#xA;         / / / / / _ \ \ \ \ \&#xA;        / / / / / / \ \ \ \ \ \&#xA;       / / / / / / _ \ \ \ \ \ \&#xA;      / / / / / / / \ \ \ \ \ \ \&#xA;     / / / / / / / _ \ \ \ \ \ \ \&#xA;    / / / / / / / / \ \ \ \ \ \ \ \&#xA;   / / / / / / / / _ \ \ \ \ \ \ \ \&#xA;  / / / / / / / / / \ \ \ \ \ \ \ \ \&#xA; / / / / / / / / / _ \ \ \ \ \ \ \ \ \&#xA;/ / / / / / / / / / \ \ \ \ \ \ \ \ \ \&#xA;| | | | | | | | | |x| | | | | | | | | |&#xA;\ \ \ \ \ \ \ \ \ \_/ / / / / / / / / /&#xA; \ \ \ \ \ \ \ \ \ 9 / / / / / / / / /&#xA;  \ \ \ \ \ \ \ \ \_/ / / / / / / / /&#xA;   \ \ \ \ \ \ \ \ 8 / / / / / / / /&#xA;    \ \ \ \ \ \ \ \_/ / / / / / / /&#xA;     \ \ \ \ \ \ \ 7 / / / / / / /&#xA;      \ \ \ \ \ \ \_/ / / / / / /&#xA;       \ \ \ \ \ \ 6 / / / / / /&#xA;        \ \ \ \ \ \_/ / / / / /&#xA;         \ \ \ \ \ 5 / / / / /&#xA;          \ \ \ \ \_/ / / / /&#xA;           \ \ \ \ 4 / / / /&#xA;            \ \ \ \_/ / / /&#xA;             \ \ \ 3 / / /&#xA;              \ \ \_/ / /&#xA;               \ \ 2 / /&#xA;                \ \_/ /&#xA;                 \ 1 /&#xA;                  \_/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Trailing whitespace after line ends allowed, trailing/prepending newlines also are.&#xA;You can write either a full program or just the function.&#xA;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code (in bytes in your languages preferred encoding) wins.&lt;/p&gt;&#xA;&lt;h3&gt;sandbox:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;any better wording?&lt;/li&gt;&#xA;&lt;li&gt;anything I'm missing?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="59183" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-29T14:40:13.330" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10704" PostTypeId="2" ParentId="10682" CreationDate="2016-11-26T14:35:21.537" Score="-1" Body="&lt;p&gt;I'd propose you maybe have users leave a &quot;+1&quot; comment to vote for sillyness, and leave a regular upvote for impressiveness. That way it's all contained in one question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I guess users below 50 rep would be excluded though (not that it's a big deal).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This might also need to be a time-limited contest too as nobody is going to want to count &quot;+1&quot; comments after the contest ends... The alternative would be to have one comment on each question that says &quot;+1&quot; and have people vote for that?&lt;/p&gt;&#xA;" OwnerUserId="62670" LastEditorUserId="62670" LastEditDate="2016-12-05T23:26:58.573" LastActivityDate="2016-12-05T23:26:58.573" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10705" PostTypeId="1" CreationDate="2016-11-26T16:03:24.087" Score="-3" ViewCount="150" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/100928/26997&quot;&gt;https://codegolf.stackexchange.com/q/100928/26997&lt;/a&gt; is currently closed as a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/q/44680/26997&quot;&gt;Showcase of Languages&lt;/a&gt;, which is currently locked.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/100928/showcase-what-makes-your-programming-language-different-from-all-others#comment245166_100928&quot;&gt;reasoning&lt;/a&gt; is that once the proposal &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10657/26997&quot;&gt;here&lt;/a&gt; is applied to &lt;a href=&quot;https://codegolf.stackexchange.com/q/44680/26997&quot;&gt;Showcase of Languages&lt;/a&gt;, answers to &lt;a href=&quot;https://codegolf.stackexchange.com/q/100928/26997&quot;&gt;https://codegolf.stackexchange.com/q/100928/26997&lt;/a&gt; would be valid answers there, which allegedly goes against our usual duplicate rule of:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1876/26997&quot;&gt;Can answers from one question be copied over to the other with little or no modification and still be competitive?&lt;/a&gt;&lt;/em&gt; [If yes, then it's a duplicate.]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Now this may be true, assuming the proposal] about removing the &lt;em&gt;one-char-per-upvote&lt;/em&gt; rule in the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44680/showcase-your-language-one-vote-at-a-time&quot;&gt;old showcase&lt;/a&gt; is implemented (the &quot;Make it a non-challenge question&quot; thing). But the old showcase has been locked for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10629/26997&quot;&gt;nearly a week&lt;/a&gt; and none of the changes (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10657/26997&quot;&gt;proposed&lt;/a&gt; 4 days ago) have been implemented.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Dennis even says (in response to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/100928/showcase-what-makes-your-programming-language-different-from-all-others#comment245169_100928&quot;&gt;Sp3000's comment&lt;/a&gt;):&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/100928/showcase-what-makes-your-programming-language-different-from-all-others#comment245171_100928&quot;&gt;Fair enough. Once we settle on making an exception, we should probably have a separate poll to decide what the conditions are. As I've mentioned before, I do think this is the most important detail though.&lt;/a&gt; [The removal of the &lt;em&gt;one-char-per-upvote&lt;/em&gt; rule.]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So it seems likely a new meta post finalizing exactly what to do with the old showcase will be made before it is unlocked or changed. This process could take a week or two to decide and more time to implement, and the results cannot be definitely predicted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given the &lt;em&gt;present&lt;/em&gt; state of the old showcase, I'd argue that the new one is by no means a duplicate. It would be a very contrived answer indeed to the new showcase that follows the restrictive rules about character counts and votes present in the old showcase. The old showcase is still locked in any case, so people who see the new showcase and want to answer cannot do so on the old showcase.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I realize there are &lt;a href=&quot;https://codegolf.stackexchange.com/q/100928/26997%20is%20currently%20closed%20as%20a%20duplicate%20of%20https://codegolf.stackexchange.com/q/44680/26997,%20which%20is%20currently%20locked.%20%20The%20[reasoning][1]%20is%20that%20once%20the%20proposal%20[here][2]%20is%20applied%20to%20https://codegolf.stackexchange.com/q/44680/26997,%20answers%20to%20https://codegolf.stackexchange.com/q/100928/26997%20would%20be%20valid%20answers%20there,%20which%20allegedly%20goes%20against%20our%20usual%20duplicate%20rule%20of:%20%20%3E%20*[Can%20answers%20from%20one%20question%20be%20copied%20over%20to%20the%20other%20with%20little%20or%20no%20modification%20and%20still%20be%20competitive?][3]*%20[If%20yes,%20then%20it&amp;#39;s%20a%20duplicate.]%20%20Now%20this%20may%20be%20true,%20assuming%20all%20the%20[proposals][2]%20to%20the%20[old%20showcase][4]%20are%20implemented.%20But%20the%20old%20showcase%20has%20been%20locked%20for%20[nearly%20a%20week][5]%20and%20none%20of%20the%20changes%20([proposed][2]%204%20days%20ago)%20have%20been%20implemented.%20%20Dennis%20even%20says%20(in%20response%20to%20[Sp3000&amp;#39;s%20comment][6]):%20%20%3E%20[Fair%20enough.%20Once%20we%20settle%20on%20making%20an%20exception,%20we%20should%20probably%20have%20a%20separate%20poll%20to%20decide%20what%20the%20conditions%20are.%20As%20I&amp;#39;ve%20mentioned%20before,%20I%20do%20think%20this%20is%20the%20most%20important%20detail%20though.](https://codegolf.stackexchange.com/questions/100928/showcase-what-makes-your-programming-language-different-from-all-others#comment245171_100928)%20%20So%20it%20seems%20likely%20a%20new%20meta%20post%20finalizing%20exactly%20what%20to%20do%20with%20the%20old%20showcase%20will%20be%20made%20before%20it%20is%20unlocked%20or%20changed.%20This%20process%20could%20take%20a%20week%20or%20two%20to%20decide%20and%20more%20time%20to%20implement,%20and%20the%20results%20cannot%20be%20definitely%20predicted.%20%20Given%20the%20*present*%20state%20of%20https://codegolf.stackexchange.com/q/44680/26997,%20I&amp;#39;d%20argue%20that%20https://codegolf.stackexchange.com/q/100928/26997%20is%20by%20no%20means%20a%20duplicate.%20It%20would%20be%20a%20very%20contrived%20answer%20indeed%20to%20the%20[new%20showcase][7]%20that%20follows%20the%20restrictive%20rules%20about%20character%20counts%20and%20votes%20still%20present%20in%20the%20old%20showcase.%20The%20old%20showcase%20is%20still%20locked%20in%20any%20case,%20so%20people%20who%20see%20the%20new%20showcase%20and%20want%20to%20answer%20cannot%20do%20so%20on%20the%20old%20showcase.%20%20(I%20realize%20there%20are%20other%20reasons%20and%20arguments%20to%20be%20made%20about%20why%20the%20new%20showcase%20should%20be%20closes.%20%20%20but%20the%20new%20showcase%20mas%20marked%20as%20a%20duplicate%20specifically%20because%20answers%20could%20supposedly%20be%20copied%20the%20updated%20old%20showcase,%20so%20tha%20%20*Bottom%20line*:%20%20%20%20%20%20%20%3Csub%3E(Note:%20I&amp;#39;m%20using%20the%20terms%20%22[new][7]%22%20and%20%22[old][8]%22%20showcase%20for%20convenience%20because%20they%20are%20the%20only%20showcases%20we%20have%20so%20far.%20I%20do%20not%20consider%20one%20a%20replacement%20for%20the%20other,%20nor%20that%20they%20will%20be%20the%20only%20showcases%20ever.)%3C/sub%3E%20%20%20%20%20[1]:%20https://codegolf.stackexchange.com/questions/100928/showcase-what-makes-your-programming-language-different-from-all-others#comment245166_100928%20%20%20[2]:%20https://codegolf.meta.stackexchange.com/a/10657/26997%20%20%20[3]:%20https://codegolf.meta.stackexchange.com/a/1876/26997%20%20%20[4]:%20https://codegolf.stackexchange.com/questions/44680/showcase-your-language-one-vote-at-a-time%20%20%20[5]:%20https://codegolf.meta.stackexchange.com/a/10629/26997%20%20%20[6]:%20https://codegolf.stackexchange.com/questions/100928/showcase-what-makes-your-programming-language-different-from-all-others#comment245169_100928%20%20%20[7]:%20https://codegolf.stackexchange.com/q/100928/26997%20%20%20[8]:%20https://codegolf.stackexchange.com/q/44680/26997&quot;&gt;other&lt;/a&gt; reasons and arguments to be made about why or why not the new showcase should be closed. (In fact it was closed as too broad, but last I saw it had 4/5 reopen votes.) But the new showcase was marked as a duplicate &lt;a href=&quot;https://codegolf.stackexchange.com/questions/100928/showcase-what-makes-your-programming-language-different-from-all-others#comment245166_100928&quot;&gt;specifically because&lt;/a&gt; answers could supposedly be copied to the updated old showcase, so that's what this meta post is in reference to. Please focus on that facet of the discussion.)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Summary&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/q/100928/26997&quot;&gt;new showcase&lt;/a&gt; was closed as a duplicate of the &lt;a href=&quot;https://codegolf.stackexchange.com/q/44680/26997&quot;&gt;old one&lt;/a&gt; based on yet unimplemented &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10657/26997&quot;&gt;proposals&lt;/a&gt;. Specifically, removal of the &lt;em&gt;one-char-per-upvote&lt;/em&gt; rule in the original showcase.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It seems likely but not certain the proposals will be implemented.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If they are, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/100928/showcase-what-makes-your-programming-language-different-from-all-others#comment245166_100928&quot;&gt;at least 3 people agree&lt;/a&gt; (2 comment upvotes currently) that the new showcase would then be a duplicate of the old one.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Either way, it will likely take a week or two until &lt;a href=&quot;https://codegolf.stackexchange.com/questions/100928/showcase-what-makes-your-programming-language-different-from-all-others#comment245171_100928&quot;&gt;the issue is finalized&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In the meantime, no one can answer either showcase (the old one is still &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10629/26997&quot;&gt;locked&lt;/a&gt;).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Should the new showcase remain closed as a duplicate of the old showcase despite that it is not yet a clear duplicate?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;(Note: I'm using the terms &quot;&lt;a href=&quot;https://codegolf.stackexchange.com/q/100928/26997&quot;&gt;new&lt;/a&gt;&quot; and &quot;&lt;a href=&quot;https://codegolf.stackexchange.com/q/44680/26997&quot;&gt;old&lt;/a&gt;&quot; showcase for convenience because they are the only showcases we have so far. I do not consider one a replacement for the other, nor that they will be the only showcases ever.)&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-11-26T17:36:42.230" Title="Is the new showcase a duplicate of the old one?" Tags="|discussion|specific-question|close-reasons|duplicates|closed-questions|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10706" PostTypeId="2" ParentId="10705" CreationDate="2016-11-26T16:03:24.087" Score="-6" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;The new showcase is not (yet) a duplicate of the old one.&lt;/p&gt;&#xA;&lt;p&gt;In general, when given, &lt;strong&gt;our close messages should reflect the present state of the site&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Otherwise it is unfair to challenge writers and answerers, and plain confusing to everyone.&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-26T17:22:30.053" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10709" PostTypeId="2" ParentId="2140" CreationDate="2016-11-26T22:41:19.753" Score="0" Body="&lt;h1&gt;Calculate the chi-squared test statistic&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/statistics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;statistics&amp;#39;&quot; rel=&quot;tag&quot;&gt;statistics&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;A &lt;a href=&quot;http://stattrek.com/chi-square-test/independence.aspx?Tutorial=AP&quot; rel=&quot;nofollow noreferrer&quot;&gt;chi-squared test&lt;/a&gt; is a statistical test used to determine the extent of any association between two categorical varaiables. In this challenge, you will calculate the value of the chi-squared test statistic given a contingency table.&lt;/p&gt;&#xA;&lt;h2&gt;Method&lt;/h2&gt;&#xA;&lt;p&gt;Say that we have two variables &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt;, which are from a single population. &lt;code&gt;A&lt;/code&gt; can take values from the categories &lt;code&gt;p&lt;/code&gt;, &lt;code&gt;q&lt;/code&gt;, and &lt;code&gt;r&lt;/code&gt;, while &lt;code&gt;b&lt;/code&gt; can take values from the categories &lt;code&gt;x&lt;/code&gt;, &lt;code&gt;y&lt;/code&gt;, and &lt;code&gt;z&lt;/code&gt;. A sample is now taken from the population, and the frequencies of the elements of this sample that fall into each category are observed. This can be used to construct a contingency table:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;         A&#xA;     x   y   z&#xA;  p [10, 12,  3]&#xA;B q [45,  0,  9]&#xA;  r [65, 32, 34]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For example, the table shows that &lt;code&gt;10&lt;/code&gt; elements fall into &lt;code&gt;p&lt;/code&gt; and &lt;code&gt;x&lt;/code&gt;, and that no elements fall into &lt;code&gt;q&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Next, we calculate the expected frequencies, assuming that &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt; have no association. This is performed by applying the following to each entry in the contingency table, where &lt;code&gt;f_e&lt;/code&gt; is the expected frequency:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/6PNSM.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/6PNSM.jpg&quot; alt=&quot;Expected frequency&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this case, this yields:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[14.285714285714286, 5.238095238095238,  5.476190476190476 ]&#xA;[30.857142857142858, 11.314285714285715, 11.82857142857143 ]&#xA;[74.85714285714286,  27.447619047619046, 28.695238095238096]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Next, we calculate the contributions to the test statistic by applying the following to each entry, where &lt;code&gt;f_0&lt;/code&gt; is the orignal observed frequency:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/9wkGq.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/9wkGq.jpg&quot; alt=&quot;Contribution to the test statistic&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this case, this yields:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1.285714285714286,  8.72900432900433,   1.1196687370600416]&#xA;[6.482142857142857,  11.314285714285715, 0.6763975155279506]&#xA;[1.2979825517993466, 0.7550444466475007, 0.9806678994199733]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Finally the value of the test statistic is found by summing all the elements of the contributions table, which gives:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;32.640908336601996&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&lt;h2&gt;To do&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input/output, specification etc&lt;/li&gt;&#xA;&lt;li&gt;Test cases (&lt;a href=&quot;https://pyth.herokuapp.com/?code=smc%5E-hded2ed%2CVsQsm.ec%2asds%40CQkssQdQ&amp;amp;input=%5B%5B10%2C12%2C3%5D%2C%5B45%2C0%2C9%5D%2C%5B65%2C32%2C34%5D%5D&amp;amp;debug=0&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pyth program&lt;/a&gt; for test cases)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="55526" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-26T22:55:20.723" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10713" PostTypeId="2" ParentId="2140" CreationDate="2016-11-27T21:08:41.710" Score="1" Body="&lt;h1&gt;Implement the Terducodec&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In this challenge we'll be implementing a tersum duplicate coder/decoder; aka, a terducodec.  This is a reciprocal substitution cipher, so the encoder and the decoder are the same.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Definition&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The &lt;strong&gt;&lt;em&gt;tersum duplicate&lt;/em&gt;&lt;/strong&gt; of a number x is 2x using base 3 without carries.  Alternately phrased, the tersum duplicate of x in base 3 is simply x in base 3 with the 1 and 2 digits swapped.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the tersum duplicate of 47 is 64, because 47=1202b3, and 2101b3 is 64.  Note that since this is simply a result of swapping base 3 digits, the tersum duplicate operation is its own inverse.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Terducoding&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We code at an octet level, using values in the range 0 to 255 and the tersum duplicate operation.  To keep the result in the range 0 to 255 the operation is applied to each of the following subgroups:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;0 through 242&lt;/li&gt;&#xA;&lt;li&gt;243 through 251&lt;/li&gt;&#xA;&lt;li&gt;252 through 254&lt;/li&gt;&#xA;&lt;li&gt;255&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Given n in the range 0 to 255, let s be the lowest value in the same subgroup as n.  Then n can be terducoded as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Subtract s from n&lt;/li&gt;&#xA;&lt;li&gt;Calculate the tersum duplicate of this result&lt;/li&gt;&#xA;&lt;li&gt;Add s back to the above&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The value 195 is in group 0 through 242.  This group's s value is 0.  Thus, we simply take the tersum duplicate of 195=21020b3, which is 12010b3=138.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The value 246 is in group 243 through 251.  This group's s value is 243.  Thus, we take the tersum duplicate of 246-243=3=10b3, which is 20b3=6, and add s back in to get 249.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The value 252 is in group 252 to 254.  This group's s value is 252.  Thus, we take the tersum duplicate of 252-252=0=0b3, which is just 0b3=0, and add s back to get 252.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that implements the terducodec.  Your program or function should accept as input an ordered sequence of octets, and produce as output a corresponding ordered sequence of terducoded values.  The input/output mechanism may use standard input and standard output, arrays, etc; however, your chosen mechanism &lt;em&gt;must&lt;/em&gt; be able to represent any sequence of octets where each octet has the full possible range.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code golf.  Standard loopholes disallowed.  The smallest terducodec in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Case&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A single test case doubles as a list of all possible encodings.  Here, the decimal representation is used for each octet.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  0   2   1   6   8   7   3   5   4  18  20  19  24  26  25  21&#xA; 23  22   9  11  10  15  17  16  12  14  13  54  56  55  60  62&#xA; 61  57  59  58  72  74  73  78  80  79  75  77  76  63  65  64&#xA; 69  71  70  66  68  67  27  29  28  33  35  34  30  32  31  45&#xA; 47  46  51  53  52  48  50  49  36  38  37  42  44  43  39  41&#xA; 40 162 164 163 168 170 169 165 167 166 180 182 181 186 188 187&#xA;183 185 184 171 173 172 177 179 178 174 176 175 216 218 217 222&#xA;224 223 219 221 220 234 236 235 240 242 241 237 239 238 225 227&#xA;226 231 233 232 228 230 229 189 191 190 195 197 196 192 194 193&#xA;207 209 208 213 215 214 210 212 211 198 200 199 204 206 205 201&#xA;203 202  81  83  82  87  89  88  84  86  85  99 101 100 105 107&#xA;106 102 104 103  90  92  91  96  98  97  93  95  94 135 137 136&#xA;141 143 142 138 140 139 153 155 154 159 161 160 156 158 157 144&#xA;146 145 150 152 151 147 149 148 108 110 109 114 116 115 111 113&#xA;112 126 128 127 132 134 133 129 131 130 117 119 118 123 125 124&#xA;120 122 121 243 245 244 249 251 250 246 248 247 252 254 253 255&#xA; -&amp;gt;&#xA;  0   1   2   3   4   5   6   7   8   9  10  11  12  13  14  15&#xA; 16  17  18  19  20  21  22  23  24  25  26  27  28  29  30  31&#xA; 32  33  34  35  36  37  38  39  40  41  42  43  44  45  46  47&#xA; 48  49  50  51  52  53  54  55  56  57  58  59  60  61  62  63&#xA; 64  65  66  67  68  69  70  71  72  73  74  75  76  77  78  79&#xA; 80  81  82  83  84  85  86  87  88  89  90  91  92  93  94  95&#xA; 96  97  98  99 100 101 102 103 104 105 106 107 108 109 110 111&#xA;112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127&#xA;128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143&#xA;144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159&#xA;160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175&#xA;176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191&#xA;192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207&#xA;208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223&#xA;224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239&#xA;240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cryptography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cryptography&amp;#39;&quot; rel=&quot;tag&quot;&gt;cryptography&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/abstract-algebra&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;abstract-algebra&amp;#39;&quot; rel=&quot;tag&quot;&gt;abstract-algebra&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polynomials&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polynomials&amp;#39;&quot; rel=&quot;tag&quot;&gt;polynomials&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="58514" LastActivityDate="2016-11-27T21:08:41.710" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10716" PostTypeId="1" CreationDate="2016-11-28T14:27:58.610" Score="2" ViewCount="78" Body="&lt;p&gt;Should programs that may run out of memory be allowed? For example, when validating data to see if it's a valid PNG file or not, as per &lt;a href=&quot;https://codegolf.stackexchange.com/questions/101316/validate-a-png-file&quot;&gt;this challenge&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="21796" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-11-28T17:52:59.303" Title="Should a program be allowed to run out of memory?" Tags="|discussion|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10717" PostTypeId="2" ParentId="10716" CreationDate="2016-11-28T17:52:59.303" Score="2" Body="&lt;p&gt;My thoughts:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there are valid inputs for which the program will always run out of memory, then the program doesn't work for those inputs and isn't a valid solution. If you can solve the problem by throwing more memory into your system, then it's a hardware problem and theoretically, years down the line, the solution will function normally on most common systems, and this should be allowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Whether or not the program is allowed to run out of memory after a result has been given should be dependent on if the challenge allows the program to have errors, which is true in most cases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On challenges that require the program to output infinitely, the program should always be able to generate more output given additional memory.&lt;/p&gt;&#xA;" OwnerUserId="60042" LastActivityDate="2016-11-28T17:52:59.303" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10720" PostTypeId="1" CreationDate="2016-11-28T19:48:57.320" Score="16" ViewCount="212" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10657/12012&quot;&gt;&lt;strong&gt;We've reached consensus!&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We'll make an exception and unlock and reopen the &lt;a href=&quot;https://codegolf.stackexchange.com/q/44680/12012&quot;&gt;Showcase of Languages&lt;/a&gt; thread. In this (hopefully final) meta posts, we have to decide what this exception will cover, i.e., what changes we should make to the question &lt;em&gt;before&lt;/em&gt; unlocking it, and what changes the community should make to the answers after it has been unlocked.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Below, there are a few answers that represent the different parts of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10657/12012&quot;&gt;my own proposed changes&lt;/a&gt;, which became the highest voted answer to the previous discussion. Because the community members might have cast their votes (or refrained from casting them) because they agreed with certain proposed changes but not with others, here you have the chance to vote for them separately.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In case there are other changes you'd like to see happen, just add an additional answer. Please don't post &quot;negative answers&quot; that propose something should &lt;em&gt;not&lt;/em&gt; be changed; just downvote the answers you disagree with, post comments explaining your downvotes, and/or discuss the specific changes in &lt;a href=&quot;http://chat.stackexchange.com/rooms/49255&quot;&gt;this chat room&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once the scores have stabilized, a moderator will alter the question based on those scores and unlock and reopen the thread.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-11-28T20:55:33.210" Title="What changes should we make to the showcase before and after unlocking and reopening it?" Tags="|discussion|specific-question|scope|" AnswerCount="7" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10721" PostTypeId="2" ParentId="10720" CreationDate="2016-11-28T19:49:57.977" Score="11" Body="&lt;h2&gt;Make it a community wiki&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a perfect fit.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Questions should be manually converted to community wiki when they are marginal fits or 'list of X' questions that contain enough value to avoid deletion.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The showcase should &lt;em&gt;obviously&lt;/em&gt; not be deleted, but it is a 'list of X' question, and considered too broad or even off topic by some members of the community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Converting the entire thread to community wiki means that all answers will cease to be the &quot;property&quot; of a single member of the community; all users that cross the required threshold are free to add snippets of their own, or modify and/or remove low-quality contributions of other users.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In case you're worried, this will &lt;strong&gt;not&lt;/strong&gt; affect the reputation you have already earned.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2016-11-28T19:49:57.977" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10722" PostTypeId="2" ParentId="10720" CreationDate="2016-11-28T19:50:58.197" Score="19" Body="&lt;h2&gt;Make it a non-challenge question&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1723/lets-decide-what-kind-of-non-challenge-questions-we-want-once-and-for-all?s=1|1.2959&quot;&gt;We &lt;em&gt;do&lt;/em&gt; allow these&lt;/a&gt;, and the showcase is by far more similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions than to our usual programming contests. This should encompass unaccepting the answer with the highest vote count, removing the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; tag, and adding a dedicated &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/showcase&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;showcase&amp;#39;&quot; rel=&quot;tag&quot;&gt;showcase&lt;/a&gt; tag which makes clear that this will be the only question of its kind, at least without a preceding meta discussion.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2016-11-28T19:50:58.197" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10723" PostTypeId="2" ParentId="10720" CreationDate="2016-11-28T19:52:13.847" Score="10" Body="&lt;h2&gt;Combine answers in the same language (whenever possible)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Ideally, we would have one page per language, but there's no way to make that happen using PPCG's Q&amp;amp;A format.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consolidating multiple answers in a single language into a single post should be done whenever possible, both to make finding and reading about your language of interest easier and to avoid multiple near-duplicate snippets.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One issue with this idea is the 30,000 character limit imposed on answers. We could request the limit to be raised; this would also benefit answers in exceptionally verbose languages which tend to not fit into an answer even for the simplest challenges.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2016-11-28T19:52:13.847" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="10725" PostTypeId="2" ParentId="10720" CreationDate="2016-11-28T20:00:22.437" Score="15" Body="&lt;h2&gt;Use Stack Snippets to fold answers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Everything except the language name and a factoid could be folding by wrapping it into a stack snippet. That would condense each page into 30 stubs, which can be expanded with just two clicks. This serves multiple purposes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You don't have to load images of answers you're not interested in reading or have already read. This is a huge deal on small screens or limited data plans.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Stack Snippets can be expanded to take up the entire screen, making long answers substantially easier to read.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Stack Snippets can contain more than just Markdown. An animated GIF is no longer the only way to show an animation, snippets could be fiddled with inline, etc.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="45708" LastActivityDate="2016-11-28T20:00:22.437" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10726" PostTypeId="2" ParentId="10720" CreationDate="2016-11-28T20:02:37.537" Score="27" Body="&lt;h2&gt;Automate the catalog&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We should replace the manually curated answer list with a Stack Snippet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I hope nobody will actually object to this, but this should at the very least serve as a to-do list.&lt;/p&gt;&#xA;" OwnerUserId="45708" LastActivityDate="2016-11-28T20:02:37.537" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10727" PostTypeId="2" ParentId="10720" CreationDate="2016-11-28T20:06:58.637" Score="11" Body="&lt;h2&gt;Keep searching for better alternatives&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As before, I still believe that the showcase deserves to be a proper wiki, quite possibly outside PPCG, free from restrictions on character count, size, Markdown, JavaScript, pagination, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While there &lt;em&gt;are&lt;/em&gt; existing alternatives – e.g., &lt;a href=&quot;https://esolangs.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolang&lt;/a&gt; could showcase the recreational programming languages – the community doesn't seem to consider it a sufficient replacement. But once we find one, we could still revisit locking the showcase.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Downvote this if you think the exception to keep the showcase on PPCG is optimal or at least good enough, upvote if you think we should try finding a better solution.&lt;/p&gt;&#xA;" OwnerUserId="45708" LastActivityDate="2016-11-28T20:06:58.637" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10729" PostTypeId="2" ParentId="10720" CreationDate="2016-11-28T20:55:33.210" Score="11" Body="&lt;h2&gt;Remove the &lt;em&gt;one vote at a time&lt;/em&gt; rule&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Additional snippets could be added at will and would not be restricted to one snippet per character count. I don't think character count should be a limiting factor at all; it hinders showcasing intentionally verbose languages.&lt;/p&gt;&#xA;" OwnerUserId="45708" LastActivityDate="2016-11-28T20:55:33.210" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10730" PostTypeId="1" AcceptedAnswerId="10731" CreationDate="2016-11-28T21:41:36.077" Score="5" ViewCount="140" Body="&lt;p&gt;&lt;strong&gt;tldr:&lt;/strong&gt; Now (a while ago) that the structure of how ECMAScript features are classified into versions has changed, does it make sense to rename and re-purpose the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37624/tips-for-golfing-in-ecmascript-6&quot;&gt;Tips for Golfing in ECMAScript 6&lt;/a&gt; for ES6 and above?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;At the time of creation of my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37624/tips-for-golfing-in-ecmascript-6&quot;&gt;ES6 tips&lt;/a&gt; question, ECMAScript versions used to be major versions and contains a lot of features. For the same purpose, a lot of draft specs were written and the scope of a single version was frozen after various draft revisions. This process in tandem with the actual implementation of the feature would take anywhere from 2 to 3 years. The version would contain lots of new features and it would be a major shift in the way JavaScript community works.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Not so long ago, this format changed and the whole major version approach was dropped in favor of an yearly release. This means that new features would be frozen faster and, in turn, would be implemented and shipped in browser faster. Thus, from now on, we have versions like ES2016, ES2017 and likewise. This might lead to very few features of interest being landed in a particular ES version.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Coming to the main point: Keeping all above in mind, does it make sense to repurpose the ES6 tips question for all future ECMAScript versions?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;UPDATE&lt;/strong&gt;: Based on the response to this question, I have edited the tips question on the main site to repurpose it for ES6 and above.&lt;/p&gt;&#xA;" OwnerUserId="31414" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-12-12T10:26:01.400" Title="Having a single tips question for all things ES6+" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10731" PostTypeId="2" ParentId="10730" CreationDate="2016-11-28T21:42:18.987" Score="11" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;We should use the same ES6 tips question for all future ES versions.&lt;/p&gt;&#xA;" OwnerUserId="31414" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-28T21:42:18.987" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10734" PostTypeId="1" CreationDate="2016-11-29T06:07:40.903" Score="17" ViewCount="480" Body="&lt;p&gt;Sometimes, we need to have posts that can bypass the 30,000 character limit. I have created this Stack Snippet that, given text as input, compresses the text and outputs a Stack Snippet that can be run to view the original text.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;var fmt = pako.inflate(atob(&quot;eJx1kcFugzAMhu99Co9NAqSRqDsyyrsYcNOwkGSx0TpVffdBO7TL6pP/39Zn2W6eqgo6MtYDexsjSQ0jw8kOVIOkmaAPnoNb1BEdE3TYkdtEVbW7XbMiHHozo1na1qxaELcaLPFSZM+YlUroLEXEj6CsPzoUKlBCV+SXa16+wkVCDTlLst7k17J8/x98ksn9oRvuk40CnPpDdhKJXGvdD14l/DJWVB8m7cNAPep1sJ6QhZIeLMvNUJP1auSsbfSd1D7G4ohnZUIwjjBavrFXTzvbsR4/Z0rf+k3t1f5XPILHRGCHQ4bZ3QC4+3opbOckP2z/WLf9ATMjg/g=&quot;), {&#xD;&#xA;  to: 'string'&#xD;&#xA;});&#xD;&#xA;$('#compress').click(function() {&#xD;&#xA;  $('#output').val(fmt.replace(/{}/, btoa(pako.deflate($('#input').val(), {&#xD;&#xA;    to: 'string'&#xD;&#xA;  }))));&#xD;&#xA;});&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://cdn.rawgit.com/nodeca/pako/master/dist/pako.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xD;&#xA;&amp;lt;script src=&quot;https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xD;&#xA;&amp;lt;textarea id=&quot;input&quot;&amp;gt;&amp;lt;/textarea&amp;gt;&#xD;&#xA;&amp;lt;br&amp;gt;&#xD;&#xA;&amp;lt;input type=&quot;button&quot; value=&quot;Compress&quot; id=&quot;compress&quot; /&amp;gt;&#xD;&#xA;&amp;lt;br&amp;gt;&#xD;&#xA;&amp;lt;br&amp;gt;Output:&#xD;&#xA;&amp;lt;br&amp;gt;&#xD;&#xA;&amp;lt;textarea id=&quot;output&quot; readonly&amp;gt;&amp;lt;/textarea&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An example output Stack Snippet:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;$(&quot;#a&quot;).text(pako.inflate(atob('eJzzSM3JyddRCM8vyklRBAAfngRq'), {to: 'string'}));&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://cdn.rawgit.com/nodeca/pako/master/dist/pako.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xD;&#xA;&amp;lt;script src=&quot;https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xD;&#xA;&amp;lt;pre id=&quot;a&quot;&amp;gt;&#xD;&#xA;  &#xD;&#xA;&amp;lt;/pre&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Alternatively, if the above solution is still too long, you can save the contents to a public &lt;a href=&quot;https://gist.github.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub Gist&lt;/a&gt;, and display it with the following snippet (replacing the URL with your Gist's URL):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;$('#a').load('https://gist.githubusercontent.com/Mego/43ae1cfba25105a47e6744ac36847c61/raw/df8fcad07ba95caadfa1f6e4ce98de32e2a37cc5/test.txt');&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xD;&#xA;&amp;lt;div id=&quot;a&quot;&amp;gt;&#xD;&#xA;&amp;lt;/div&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Feedback is always appreciated.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2018-01-03T20:50:08.690" LastActivityDate="2018-01-03T20:50:08.690" Title="Stack Snippet for Compressing Posts" Tags="|discussion|stack-snippets|" AnswerCount="0" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10735" PostTypeId="2" ParentId="2140" CreationDate="2016-11-29T08:43:54.190" Score="-4" Body="&lt;p&gt;&lt;strong&gt;What about one question on numeric solve?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write one function that gets as one argument&#xA;one function f(x), and one interval a..b and&#xA; return the list of all element&#xA;v such f(v)=0 in the interval a..b. In the interval&#xA;a..b the f must be definite and can not be f(r) = +oo&#xA;for r in a..b.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Win the one write the function with biggest set&#xA;of right results. If two have the same set,&#xA;win the one has less characters.&#xA;You can not use solve() or nsolve() or fsolve()&#xA;or one already written function that your sys offer&#xA; that finds numerical x in f(x)=0&lt;/p&gt;&#xA;" OwnerDisplayName="user58988" LastEditorDisplayName="user58988" LastEditDate="2016-11-30T10:02:45.953" LastActivityDate="2016-11-30T10:02:45.953" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10736" PostTypeId="2" ParentId="2140" CreationDate="2016-11-29T08:57:58.373" Score="1" Body="&lt;h1&gt;Minimize Your Code's SHA-256 Hash &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Write a program or function that outputs its own SHA-256 hash as a hex digest. The winner will be the program with the smallest output (when interpreted as a hexadecimal integer).&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Accessing the program/function's source code is allowed (&lt;em&gt;a la&lt;/em&gt; cheating quines).&lt;/li&gt;&#xA;&lt;li&gt;The output must be in hexadecimal, optionally padded with zeros to 64 hex digits.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Example (Python 2)&lt;/h2&gt;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;import hashlib&#xA;print hashlib.sha256(open(__file__).read()).hexdigest()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://ideone.com/tMjFcr&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ideone link&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Output/score:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;fe58e530aa530b34535cadc001383750a3343634c644539901a04659b41a7308&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-29T09:05:44.823" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="10737" PostTypeId="2" ParentId="9619" CreationDate="2016-11-29T15:03:59.620" Score="5" Body="&lt;h1&gt;PHP&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;PHP is a web development language (Think CSS and HTML) that can also be used as a regular programming language. As such, it fits rather strangely right in the middle of both. Coding in PHP can be done in many different ways, and one of the reasons it's fun to golf in, is that PHP is very lax about how it lets you do things.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Types&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;PHP has weak typing, so a variable when created can be assigned any value you please. As well, type-casting is automatic in most situations, so throwing a string where a number is expected often works. PHP hunts for the first number in the string to use (&lt;code&gt;&quot;123Hello&quot; = 123&lt;/code&gt;), or treats it as a 0 if there's no number. And since PHP has a different operator for concatenation of strings, we don't have to worry about accidental typecasting when we don't want it.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;1&quot; + &quot;2&quot; = 3&#xA;&quot;1&quot; . &quot;2&quot; = &quot;12&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Numbers can also be used as strings in the same way!&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 . 2 = &quot;12&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Variables&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Wanna declare a variable? Do it whenever, wherever.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$string = 0;&#xA;$number = &quot;2&quot;;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Wanna use a variable? Do it whenever, wherever.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;// No variables initialized&#xA;$a = $n + $m; // Where the hell did these come from, then?&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You see, PHP doesn't break if you try to use a variable without a value. It puts out a little warning, but otherwise runs perfectly fine! This allows for a lot of saved bytes thanks to not needing to declare variables before using them&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$string = &quot;&quot;;        // This first part is completely unnecessary!&#xA;$string .= &quot;Hello &quot;  // PHP just kinda assumes you're working with a blank string anyways if there's nothing there.&#xA;$string .= &quot;world!&quot;&#xA;&#xA;$number++;           // No number, no problem! We'll just make that a 0 and then increment it...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Arrays&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;All arrays in PHP are associative arrays, similar to a Dictionary in C# or a Map in Java. Keys and values for arrays can be almost anything, and there's no set size for an array.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$array = []               // A blank array&#xA;$array = [1, &quot;2&quot;, [3, 4]] // Some values to start&#xA;$array[1] = false         // Numeric keys are the default...&#xA;$array['fruit'] = &quot;banana&quot;// But string keys are fine too!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;To add a value to an array, you simply set the position to whatever you want. No fuss about pre-initializing anything, the same as variables.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$array = []             // We start with a blank array...&#xA;$array[1] = 2           // And can start wherever we want.&#xA;$array['red'] = 'blue'  // Positions are created as needed.&#xA;$array[] = 'last'       // Not supplying a key automatically adds the given value to the end of the array&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Oh, did I mention strings can be referenced like arrays?&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$string = &quot;Hello world!&quot; // String[3] would give us &quot;l&quot;&#xA;$string[5] = &quot;,&quot;         // Our string is now &quot;Hello,world!&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;PHP also comes with a whole bevy of built-in array functions, which can all be viewed &lt;a href=&quot;http://php.net/manual/en/function.array.php&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Logic&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;PHP can compare any two values to evaluate a logical condition. You can &lt;a href=&quot;http://php.net/manual/en/language.operators.comparison.php&quot; rel=&quot;nofollow noreferrer&quot;&gt;see here&lt;/a&gt; what happens if you compare various types of values against each other.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Conveniently, PHP doesn't require you to explicitly do the evaluation! It's quite happy with truthy/falsy values, doing away with pesky things like &lt;code&gt;$string != &quot;&quot;&lt;/code&gt; in favor of just &lt;code&gt;$string&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Conditionals and Looping&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;PHP supports all the traditional constructs (&lt;code&gt;if&lt;/code&gt;, &lt;code&gt;for&lt;/code&gt;, &lt;code&gt;while&lt;/code&gt;, &lt;code&gt;switch&lt;/code&gt;) as well as a very convenient &lt;code&gt;foreach&lt;/code&gt; syntax which allows you to keep track of keys and values as you go.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;foreach ($array as $value)         // The simple syntax when you just want the values&#xA;foreach ($array as $key =&amp;gt; $value) // But if you want the key, it's easy!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;PHP also supports ternary operator (&lt;code&gt;?:&lt;/code&gt;) as a shorthand for if/else syntax.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$a = $boolean ? $b : $c;                  // If our boolean is true, $b is assigned to $a, otherwise $c is.&#xA;$boolean ? something() : somethingElse(); // Doesn't have to be used solely in assignment, either.&#xA;$string = $me_if_not_false ?: $me_if_true // The shorthand version 'returns' the value used for logical evaluation if it's truthy.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;PHP, being a web-based language, makes it really easy to output to the screen.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;echo $variable;          // Nice and simple.&#xA;echo $variable . &quot;\n&quot;;   // With a newline.&#xA;echo $variable . &quot;&amp;lt;br/&amp;gt;&quot;;// For you HTML nuts.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It's just that easy. (Warning, doesn't work with arrays, but check out &lt;code&gt;implode&lt;/code&gt;!)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sample program&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;From one of the challenges I posted in, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/98366/count-without-3&quot;&gt;Count without 3&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;for($i=$argv[1];!(++$i%3)|strpos(_.$i,'3'););echo$i;&#xA;&#xA;for($i=$argv[1]                                     // We initialize $i because it's shorter ($argv[1] is the first argument passed from the command line)&#xA;               ;                                    // Our condition for ending the for loop starts here. &#xA;                !(++$i%3)                           // Counting up from $i, we end the loop if it's not a multiple of 3 (if $i mod 3 equals 0).&#xA;                         |strpos(_.$i,'3');)        // Treating $i like a string, we also end the loop if we find '3' anywhere in it.&#xA;                                            ;       // This closes the for loop, as we don't need anything done during the loop that we're not already doing.&#xA;                                             echo$i;// After our loop ends, we output $i to the screen.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Conclusion&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;PHP is, in my opinion, a very fun language to golf in. Although it has some shortcomings compared to other languages (each variable is 2 bytes instead of 1,&#xA; verbose built-in functions), it can be quite the brain twister to try and &lt;s&gt;ab&lt;/s&gt;use all the cuttable corners it offers, and in the end can be quite competitive!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I hope you have fun golfing in PHP!&lt;/p&gt;&#xA;" OwnerUserId="52661" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-11-29T15:03:59.620" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10739" PostTypeId="2" ParentId="10656" CreationDate="2016-11-29T19:58:08.737" Score="-5" Body="&lt;p&gt;My suggestion, purely based on personal opinion, is that each language in the Showcase should be migrated to its own question, with one community wiki answer, with the original Showcase having a link to each question for each language. The original Showcase question already includes a list of links to individual language answers, which could be changed to links to individual questions. This would mean that, if each of these individual questions were tagged with a (to be created) showcase tag, they could all be browsed easily without loading the whole answer. This would also partially solve the slow internet problem, since when going to the showcase, only the text of the question would be loaded, allowing someone to click on the link for the specific language they want, rather than loading the showcase plus all the images of the first page of answers (currently consisting mostly of mathematica, which has a high proportion of images to text). This could also partially solve the character count issue, since each individual language question could have extra answers added if the character count grew too large.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Summary:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Create a showcase tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Migrate each of the showcase languages to their own question, tagged 'showcase'&lt;/p&gt;&#xA;" OwnerUserId="53251" LastActivityDate="2016-11-29T19:58:08.737" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10741" PostTypeId="2" ParentId="2190" CreationDate="2016-11-30T01:41:29.720" Score="19" Body="&lt;p&gt;Don't forget program exit codes!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If my C or C++ or perl or bash or ... program calls &lt;code&gt;exit(0)&lt;/code&gt; this action could be considered truthy, and calling &lt;code&gt;exit&lt;/code&gt; with a nonzero value could be considered falsey.&lt;/p&gt;&#xA;" OwnerUserId="42559" LastActivityDate="2016-11-30T01:41:29.720" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10743" PostTypeId="2" ParentId="2140" CreationDate="2016-11-30T08:06:26.057" Score="1" Body="&lt;h1&gt;Piet (Mondrian)'s Puzzle &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tiling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tiling&amp;#39;&quot; rel=&quot;tag&quot;&gt;tiling&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;For more information, watch &lt;a href=&quot;https://www.youtube.com/watch?v=49KvZrioFB0&quot; rel=&quot;nofollow noreferrer&quot;&gt;this video&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Mondrian Puzzle (for an integer &lt;code&gt;n&lt;/code&gt;) is the following:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fit non-congruent rectangles into a &lt;code&gt;n*n&lt;/code&gt; square grid. What is the smallest difference possible between the largest and the smallest rectangle?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For &lt;code&gt;6&lt;/code&gt;, the optimal difference for &lt;code&gt;M(6)&lt;/code&gt; is &lt;code&gt;5&lt;/code&gt;, and can be demonstrated like so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; ___________&#xA;| |S|_______|&#xA;| | |   L   |&#xA;| |_|_______|&#xA;| |     |   |&#xA;| |_____|___|&#xA;|_|_________| (fig. I)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The largest rectangle (L) has an area of &lt;code&gt;2 * 4 = 8&lt;/code&gt;, and the smallest rectangle (S) has an area of &lt;code&gt;1 * 3 = 3&lt;/code&gt;. Therefore, the difference is &lt;code&gt;8 - 3 = 5&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Keep in mind that currently, no optimal solutions for &lt;code&gt;n &amp;gt; 24&lt;/code&gt; have been found.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to create a program that generates a Mondrian grid that contains a (non-optimal) solution, given an integer &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will be tested on the numbers from 100 to 150. Your score for each test will be the difference between the largest and smallest rectangle. Your total score is the sum of your scores for all the tests from 100 to 150.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must present your output like so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{number}&#xA;{grid}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;number&lt;/code&gt; is the score (the difference between largest and smallest), and &lt;code&gt;grid&lt;/code&gt; is either:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A multi-lined string, or&lt;/li&gt;&#xA;&lt;li&gt;A two-dimensional list.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The grid MUST clearly show where a rectangle starts and ends.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program must fit within your answer.&lt;/li&gt;&#xA;&lt;li&gt;Your program must generate the same solution for an integer &lt;code&gt;n&lt;/code&gt; every time the program is run.&lt;/li&gt;&#xA;&lt;li&gt;You must provide a link to the outputs of all 50 solutions (using Pastebin, Github Gist... anything, really).&lt;/li&gt;&#xA;&lt;li&gt;You must have at least two rectangles on the square grid for your solution.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Meta:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a dupe?&lt;/li&gt;&#xA;&lt;li&gt;What tags?&lt;/li&gt;&#xA;&lt;li&gt;Can I improve on my explanation?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="49561" LastEditDate="2016-12-03T04:13:40.870" LastActivityDate="2016-12-03T04:13:40.870" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="10748" PostTypeId="2" ParentId="2140" CreationDate="2016-11-30T14:00:07.147" Score="1" Body="&lt;h1&gt;Paint the Path&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;First shot ever on something like this...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You got stuck in snow and have to get out somehow. You only have a paper left with some letters on it signing the directions you had to go marked with &lt;code&gt;NESW&lt;/code&gt;.&#xA;To make sure to not get lost you want to make yourself a map with the pathing. You grab your laptop and start coding. After you are done you try your function/program and check if it works as intended. It does! You grab yourself thick clothing and a shovel and work yourself through the snow.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Your task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a program or function that takes a series of characters into your standard way of input. This might be a string, a list/array of characters/strings only consisting of the letters &lt;code&gt;NESW&lt;/code&gt; and ouputs a map with the characters &lt;code&gt;^&amp;gt;V&amp;lt;&lt;/code&gt; as arrows signing where to go. Each sign has to follow directly after the one before at the correct position (&lt;code&gt;&amp;gt;^&lt;/code&gt; is correct &lt;code&gt;^&amp;gt;&lt;/code&gt; is not).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You can take the input in a way of your choice as described above.&lt;br&gt;&#xA;You may assume that the way will never cross.&lt;br&gt;&#xA;You may assume that you will never go further North nor further West than your house is.&lt;br&gt;&#xA;You may assume, that you will never have to walk back directly (eg &lt;code&gt;SNWE&lt;/code&gt;).&lt;br&gt;&#xA;You will &lt;strong&gt;always&lt;/strong&gt; start in the top-left/north-west corner.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The output should represent a kind of a map with the characters&lt;code&gt;^&amp;gt;V&amp;lt;&lt;/code&gt; as movement signs. You may use spaces or dots to separate to quickly find the way.  &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;EEEE&lt;/code&gt;&lt;br&gt;&#xA;Output: &lt;code&gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;SENE&lt;/code&gt;&lt;br&gt;&#xA;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;V&amp;gt;&#xA;&amp;gt;^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;SEESENESSENNNE&lt;/code&gt;&lt;br&gt;&#xA;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;V    &amp;gt;              &#xA;&amp;gt;&amp;gt;V&amp;gt;V^              &#xA;  &amp;gt;^V^              &#xA;    &amp;gt;^ &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;EEESESWSSSEEENNENWNNEEE&lt;/code&gt;&lt;br&gt;&#xA;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt;V  &amp;gt;&amp;gt;&amp;gt;            &#xA;   &amp;gt;V ^              &#xA;   V&amp;lt; ^&amp;lt;             &#xA;   V  &amp;gt;^             &#xA;   V  ^              &#xA;   &amp;gt;&amp;gt;&amp;gt;^              &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest answer in bytes wins!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Has there already been something like this?&lt;br&gt;&#xA;Is the story redundant or acceptable?&lt;br&gt;&#xA;Did I miss something? Like a requirement?&lt;br&gt;&#xA;What tags should be used (except for code-golf)? I am not familiar with the tags and welcome any suggestion.&lt;/p&gt;&#xA;" OwnerUserId="61532" LastEditorUserId="61532" LastEditDate="2016-11-30T18:09:30.120" LastActivityDate="2016-11-30T18:09:30.120" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10752" PostTypeId="2" ParentId="2140" CreationDate="2016-11-30T20:09:58.807" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/78024/a-numpads-knight-numbers&quot;&gt;A Numpad's Knight Numbers&lt;/a&gt; Extended Edition&lt;/h1&gt;&#xA;&lt;p&gt;This challenge is an extension of the one linked above by Calvin, and inspired by a comment by Darrel Hoffman.&lt;/p&gt;&#xA;&lt;p&gt;My computer has a numpad which is significantly more expansive than Calvin's. For reference, it looks like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;/ * -&#xA;7 8 9 +&#xA;4 5 6 +&#xA;1 2 3 ↵&#xA;0 0 . ↵&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt; denotes &lt;code&gt;numlock&lt;/code&gt;, ↵ denotes &lt;code&gt;enter&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Once again, we have a chess knight hopping around on a numpad. The objective of your program will be to determine which numbers can be generated by placing a knight on any* of these keys and letting him move around. Note that although there is only one 0 key, it's two wide so 5-&amp;gt;0-&amp;gt;3 is possible but 4-&amp;gt;0-&amp;gt;3 is not, and the &lt;code&gt;numlock&lt;/code&gt; will toggle the numpad on or off, in practice this only allows a jump from 5 to 9.&lt;/p&gt;&#xA;&lt;p&gt;'*' and '+' are unused and should never be pressed, other than that you can start your knight on any key. The knight may not press ↵ during number entry, but most end there.&lt;/p&gt;&#xA;&lt;p&gt;Your program will for input receive a number (possibly negative, possibly containing a single decimal point &lt;code&gt;.&lt;/code&gt; OR single fraction sign &lt;code&gt;/&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Truthy:&#xA;0, 2, 5, 6, 9&#xA;-6049&#xA;3059 (note the use of `numlock`)&#xA;5.16&#xA;-61.5&#xA;4/6&#xA;-6/40&#xA;55 (you can jump on 5 or 9 more than once in a row with ...)&#xA;Falsy:&#xA;66 (... But other numbers can't reach )&#xA;8 (Not within range of ↵ key)&#xA;96 (The knight can't move like that)&#xA;405 (It's probably easier to think of the 0s as being separate keys)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input will always be a valid integer, decimal float, or fraction.&lt;/p&gt;&#xA;" OwnerUserId="60042" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-30T21:57:44.823" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10753" PostTypeId="2" ParentId="2447" CreationDate="2016-11-30T20:19:55.077" Score="41" Body="&lt;h1&gt;Functions may return a list via acting as a generator&lt;/h1&gt;&#xA;&lt;p&gt;In other words, writing a function to return list elements lazily on request, using support that the language already has for doing that, is allowed (currently it's frequently seen but something of a gray area). This would be idiomatic in most of the languages which have it.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-30T20:19:55.077" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10754" PostTypeId="2" ParentId="2140" CreationDate="2016-11-30T23:01:35.153" Score="1" Body="&lt;h1&gt;Self-Verifying Quine Variant &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;We have plenty of challenges that ask you to &lt;em&gt;output&lt;/em&gt; your program's source code, but I couldn't find any where you &lt;em&gt;input&lt;/em&gt; your program's source code and verify it.&lt;/p&gt;&#xA;&lt;h2&gt;The challenge:&lt;/h2&gt;&#xA;&lt;p&gt;Your code is to accept some text as input, and return truthy if the input is identical to your source code, and falsy if it is not identical to your source code.&lt;/p&gt;&#xA;&lt;p&gt;For the purposes of this challenge, your code need only verify against the actual code that you typed, not any runtime flags you used or implicit code the compiler/interpreter adds on.&lt;/p&gt;&#xA;&lt;p&gt;Standard loopholes are disallowed, and standard quine rules apply (no reading your source code from disk).&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so fewest bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="60884" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-11-30T23:01:35.153" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10756" PostTypeId="1" AcceptedAnswerId="10757" CreationDate="2016-12-01T01:02:20.067" Score="0" ViewCount="73" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/59347/shortest-infinite-loop-producing-no-output/101700#101700&quot;&gt;This challenge&lt;/a&gt; requires us to create a &quot;full program&quot; that produces an infinite loop, and never outputs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem is, I'm not sure what's considered a full program in Clojure.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I were writing non-golfing code, my project would start out as:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(ns package1.package2)&#xA;&#xA;(defn -main [&amp;amp; args])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;At the bare minimum. I know the &lt;code&gt;ns&lt;/code&gt; macro is pretty much a requirement for any real code, but is it required for a &quot;full program&quot;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And what about &lt;code&gt;-main&lt;/code&gt;? Technically, the main function doesn't even need to be called &lt;code&gt;-main&lt;/code&gt;; that's just the default. I could name it anything as long as I adjusted the &lt;code&gt;project.clj&lt;/code&gt; accordingly. I don't think an anonymous function would be passable though since it couldn't be called. Does that mean the only requirement is that it contains a named function? &lt;/p&gt;&#xA;" OwnerUserId="31224" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-12-01T01:49:59.340" Title="Full program in Clojure" Tags="|discussion|rules|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10757" PostTypeId="2" ParentId="10756" CreationDate="2016-12-01T01:49:59.340" Score="3" Body="&lt;p&gt;&lt;sub&gt;Disclaimer: I know &lt;em&gt;nothing&lt;/em&gt; about Clojure.&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;em&gt;full&lt;/em&gt; program is anything that can be compiled/interpreted on its own, usually from a standalone file, using any pre-existing compiler/interpreter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, a simple hello world program that works on &lt;a href=&quot;http://ideone.com/QPQ9F6&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ideone&lt;/a&gt; is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(print &quot;Hello, World!&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Everything else would be overkill.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that if you &lt;em&gt;do&lt;/em&gt; require the &lt;em&gt;ns&lt;/em&gt; macro  or a &lt;em&gt;project.clj&lt;/em&gt; file for any specific task requiring a full program, you would have to include these in your byte count.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2016-12-01T01:49:59.340" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10758" PostTypeId="2" ParentId="2140" CreationDate="2016-12-01T06:59:15.423" Score="4" Body="&lt;h1&gt;Generate a Call Tree &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Given a C program, generate a graphical call tree.&lt;/p&gt;&#xA;&lt;p&gt;A call tree is a tree where the nodes represent stack frames, and the connections represent nested function calls. For example, here is a simple C program and its call tree:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-c prettyprint-override&quot;&gt;&lt;code&gt;#include &amp;lt;stdio.h&amp;gt;&#xA;&#xA;int foo() {&#xA;    return 4;&#xA;}&#xA;&#xA;int bar(int a) {&#xA;    return a + 2;&#xA;}&#xA;&#xA;int baz(int a, int b) {&#xA;    return a + foo() + bar(a)*bar(b);&#xA;}&#xA;&#xA;int main() {&#xA;    int a = baz(1, 2);&#xA;    printf(&amp;quot;%d\n&amp;quot;, a);&#xA;    return 0;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/d5e2t.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/d5e2t.png&quot; alt=&quot;call tree&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Layout&lt;/h2&gt;&#xA;&lt;p&gt;The layout of a call tree is as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The top function is always &lt;code&gt;main()&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;On the next level below are all of the functions that &lt;code&gt;main&lt;/code&gt; calls, in order of calling (top-to-bottom, left-to-right).&lt;/li&gt;&#xA;&lt;li&gt;On the next level are all of the functions that those functions call, and so on.&lt;/li&gt;&#xA;&lt;li&gt;The leaves of the tree are functions which do not call other functions, or are standard library functions (which are treated as black boxes).&lt;/li&gt;&#xA;&lt;li&gt;Each function (with its argument list) is in a rectangle, large enough that the function name and argument list isn't touching the rectangle's borders.&lt;/li&gt;&#xA;&lt;li&gt;Rectangles must not touch other rectangles.&lt;/li&gt;&#xA;&lt;li&gt;The lines drawn between the rectangles must not touch or cross any line or rectangle other than the two rectangles they are connecting.&lt;/li&gt;&#xA;&lt;li&gt;The text must be a monospaced 14-point font.&lt;/li&gt;&#xA;&lt;li&gt;The colors of the text, rectangles, lines, and background are not important, so long as all text is one color, all rectangles are one color, all lines are one color, the background is a single color, and everything can be clearly distinguished from the background.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Note that the example image above does not perfectly follow these rules.&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may assume that the C program is a valid, standalone program (all functions called are either defined in the input source code or exist in an &lt;code&gt;#include&lt;/code&gt;d header, and no input is taken from any source).&lt;/li&gt;&#xA;&lt;li&gt;Any functions not defined in the input source code are assumed to not call any other functions (this is not the case in reality, but it allows for simplification of the call trees, namely by avoiding implementation-specific details)&lt;/li&gt;&#xA;&lt;li&gt;All function calls in the call tree must include the arguments passed.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;main&lt;/code&gt; is assumed to not have any arguments.&lt;/li&gt;&#xA;&lt;li&gt;There will be no function pointers, &lt;code&gt;goto&lt;/code&gt;s, &lt;code&gt;setjmp&lt;/code&gt;/&lt;code&gt;jonglmp&lt;/code&gt; calls, dynamic memory allocation/deallocation (so no &lt;code&gt;malloc&lt;/code&gt;, &lt;code&gt;calloc&lt;/code&gt;, &lt;code&gt;realloc&lt;/code&gt; or &lt;code&gt;free&lt;/code&gt;), or preprocessor macros in the input source code.&lt;/li&gt;&#xA;&lt;li&gt;There will be no infinite loops or infinite recursion (all programs are guaranteed to terminate and thus have a finite call tree).&lt;/li&gt;&#xA;&lt;li&gt;All arguments will be &lt;code&gt;int&lt;/code&gt;s (to simplify matters, since the types don't really matter for this challenge). This means that the example program above would not be a valid input, because of the &lt;code&gt;printf&lt;/code&gt; call.&lt;/li&gt;&#xA;&lt;li&gt;All functions will either return an &lt;code&gt;int&lt;/code&gt; or will be &lt;code&gt;void&lt;/code&gt; (non-returning) functions.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-03T06:00:35.193" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="10761" PostTypeId="1" CreationDate="2016-12-01T16:12:59.713" Score="5" ViewCount="652" Body="&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/XPfyf.gif&quot; alt=&quot;Algodoo&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although physics simulator &lt;a href=&quot;http://www.algodoo.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Algodoo&lt;/a&gt; has been used it to &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=algodoo&quot;&gt;construct questions&lt;/a&gt; here, I just used it for a &lt;a href=&quot;https://codegolf.stackexchange.com/a/101624/62436&quot;&gt;joke answer&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For more involved answers, how would you score code length for something like a &lt;a href=&quot;http://www.dailymotion.com/video/x34anpp&quot; rel=&quot;nofollow noreferrer&quot;&gt;binary calculator&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="62436" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2018-10-30T02:15:19.760" Title="Scoring Algodoo and other physics sims with logic capability" Tags="|discussion|scoring|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10763" PostTypeId="2" ParentId="2140" CreationDate="2016-12-01T19:01:08.580" Score="2" Body="&lt;h1&gt;ASCII-betical order&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/printable-ascii&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;printable-ascii&amp;#39;&quot; rel=&quot;tag&quot;&gt;printable-ascii&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The full printable ASCII set (chars 32-126) in ascending order looks like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; !&quot;#$%&amp;amp;'()*+,-./0123456789:;&amp;lt;=&amp;gt;?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your task is to create a program or function which takes in an integer &lt;strong&gt;n&lt;/strong&gt; and outputs the &lt;strong&gt;n&lt;/strong&gt;&lt;sup&gt;th&lt;/sup&gt; item of an &lt;a href=&quot;http://oeis.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS&lt;/a&gt; sequence. The catch: your score is the length of your code, plus thrice the number of ASCII chars in your code &lt;em&gt;not&lt;/em&gt; included in the longest strictly increasing substring.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A valid strictly increasing substring of your code is defined as so:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each character within the substring, except the first, must have a higher ASCII value than the previous.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Other rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The sequence may be 0- or 1-indexed.&lt;/li&gt;&#xA;&lt;li&gt;The sequence you choose may not be a constant sequence, such as &lt;a href=&quot;http://oeis.org/A000012&quot; rel=&quot;nofollow noreferrer&quot;&gt;A000012&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Entries may only include printable ASCII and newlines. Newlines are ignored when calculating the longest increasing substring.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This JavaScript function outputs &lt;a href=&quot;http://oeis.org/A000027&quot; rel=&quot;nofollow noreferrer&quot;&gt;A000027&lt;/a&gt; (the natural numbers):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;n=&amp;gt;[]^n&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The longest increasing substring of characters is &lt;code&gt;=&amp;gt;[]^n&lt;/code&gt;. Therefore, the score is 7 + 3 × (7 - 6) = &lt;strong&gt;10&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This function does exactly the same thing:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;_abcdefghijklmnopqrstuvwxyz=&amp;gt;[]^_abcdefghijklmnopqrstuvwxyz&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The longest increasing substring is &lt;code&gt;=&amp;gt;[]^_abcdefghijklmnopqrstuvwxyz&lt;/code&gt;. The score is 59 + 3 × (59 - 32) = &lt;strong&gt;140&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This function also does the same thing:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;n/*!&quot;#$%&amp;amp;'()*/=&amp;gt;[]^n&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The longest increasing substring is &lt;code&gt;!&quot;#$%&amp;amp;'()*/=&amp;gt;[]^n&lt;/code&gt;. Therefore, the score is 20 + 3 × (20 - 17) = &lt;strong&gt;29&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The lowest score wins.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sandbox questions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the scoring system sufficient?&lt;/li&gt;&#xA;&lt;li&gt;Is there a better option for the challenge?&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output n'th item in some OEIS sequence&lt;/li&gt;&#xA;&lt;li&gt;Output first n items of some OEIS sequence&lt;/li&gt;&#xA;&lt;li&gt;Output the score of the input&lt;/li&gt;&#xA;&lt;li&gt;etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;What about languages with extended code pages? Should only the ASCII chars be counted, or should the bytes of the program be considered instead? &lt;/li&gt;&#xA;&lt;li&gt;Any other concerns?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42545" LastEditorUserId="42545" LastEditDate="2018-04-27T01:45:21.087" LastActivityDate="2018-04-27T01:45:21.087" CommentCount="21" ContentLicense="CC BY-SA 3.0" />
  <row Id="10764" PostTypeId="2" ParentId="2140" CreationDate="2016-12-01T20:29:59.777" Score="-2" Body="&lt;h1&gt;Signs in Permutations&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Introduction&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Let's take the permutations of &lt;code&gt;123&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;123&#xA;132&#xA;213&#xA;231&#xA;312&#xA;321&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We can insert signs in between the numbers and count how many &lt;code&gt;&amp;gt;&lt;/code&gt; signs there are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 &amp;lt; 2 &amp;lt; 3 # 0&#xA;1 &amp;lt; 3 &amp;gt; 2 # 1&#xA;2 &amp;gt; 1 &amp;lt; 3 # 1&#xA;2 &amp;lt; 3 &amp;gt; 1 # 1&#xA;3 &amp;gt; 1 &amp;lt; 2 # 1&#xA;3 &amp;gt; 2 &amp;gt; 1 # 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We can arrange this in a table with &lt;code&gt;n&lt;/code&gt; corresponding to the number (in this case &lt;code&gt;3&lt;/code&gt;) and &lt;code&gt;k&lt;/code&gt; corresponding to the number of &lt;code&gt;&amp;gt;&lt;/code&gt; signs, you get this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;┌───┬───┬────┬─────┬─────┬────┬───┐&#xA;│n\k│ 0 │  1 │  2  │  3  │  4 │ 5 │&#xA;├───┼───┼────┼─────┼─────┼────┼───┤&#xA;│ 1 │ 1 │    │     │     │    │   │&#xA;│ 2 │ 1 │  1 │     │     │    │   │&#xA;│ 3 │ 1 │  4 │   1 │     │    │   │&#xA;│ 4 │ 1 │ 11 │  11 │   1 │    │   │&#xA;│ 5 | 1 │ 26 │  66 │  26 │  1 │   │&#xA;│ 6 │ 1 │ 57 │ 302 │ 302 │ 57 │ 1 │&#xA;└───┴───┴────┴─────┴─────┴────┴───┘&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Task&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given an &lt;code&gt;n&lt;/code&gt; and &lt;code&gt;k&lt;/code&gt;, print the number in the table corresponding to that &lt;code&gt;n&lt;/code&gt; and &lt;code&gt;k&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Remember, this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the code with the fewest bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://oeis.org/A008292&quot; rel=&quot;nofollow noreferrer&quot;&gt;Related OEIS sequence&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="12537" LastActivityDate="2016-12-01T20:29:59.777" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10766" PostTypeId="2" ParentId="10761" CreationDate="2016-12-01T22:32:38.887" Score="11" Body="&lt;h1&gt;The length is the size of the save file&lt;/h1&gt;&#xA;&lt;p&gt;Unless there is another mechanism that can be used to reliably and consistently import a &amp;quot;program&amp;quot;, the save file is the obvious choice. Yes, that means your score will probably be much higher than other languages. No, there's nothing wrong with that - competition within languages, remember? As commented, you can golf and/or generate the save files manually, which can save some bytes.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;Plus, Java won't be the most verbose language anymore.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-01T23:18:33.627" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="10767" PostTypeId="1" AcceptedAnswerId="10775" CreationDate="2016-12-02T01:54:52.033" Score="4" ViewCount="351" Body="&lt;p&gt;As an answer to &lt;a href=&quot;https://codegolf.stackexchange.com/q/101638/41505&quot;&gt;this question&lt;/a&gt;, I wrote an &lt;a href=&quot;https://codegolf.stackexchange.com/a/101685/41505&quot;&gt;answer&lt;/a&gt; in the &quot;programming language&quot; 2014 (&lt;a href=&quot;https://i.stack.imgur.com/4oW6O.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;screenshot&lt;/a&gt;). The answer was deleted, accompanied with this note:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I'm temporarily removing this post in compliance with our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990/12012&quot;&gt;policy about answers not meeting the challenge specification&lt;/a&gt;. Please feel free to edit your answer and to flag it for moderator attention so it can be undeleted.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I understand if joke programming languages were outright banned, but I've seen them be used effectively to solve specific challenges before. My confusion essentially boils down to two questions: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;1) What are the limits for these kinds of languages? For answers like &lt;a href=&quot;https://codegolf.stackexchange.com/a/59497/41505&quot;&gt;this&lt;/a&gt;, it is pretty clear that when the language is used creatively, it is allowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2) What kind of edit would I be able to make to have the answer undeleted without changing the essence of the answer?&lt;/p&gt;&#xA;" OwnerUserId="41505" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-12-02T20:09:18.773" Title="Answers written in &quot;joke&quot; languages" Tags="|discussion|policy|answers|rules|deleted-answers|" AnswerCount="1" CommentCount="10" ClosedDate="2016-12-03T13:53:07.947" ContentLicense="CC BY-SA 3.0" />
  <row Id="10768" PostTypeId="2" ParentId="2140" CreationDate="2016-12-02T04:18:35.970" Score="1" Body="&lt;h1&gt;Wordsearch programming&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Todo: example submission + format)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Your task&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Write a full program that takes no input and prints any message under 100 characters to STDOUT.&lt;/li&gt;&#xA;&lt;li&gt;This program must print the same message every time it is run.&lt;/li&gt;&#xA;&lt;li&gt;Arrange your program into a wordsearch puzzle.&lt;/li&gt;&#xA;&lt;li&gt;Post the wordsearch and language, along with the desired output.&lt;/li&gt;&#xA;&lt;li&gt;Robbers will try to reconstruct the original program.&lt;/li&gt;&#xA;&lt;li&gt;If they create any program that produces the desired output from the wordsearch within a week, your submission is cracked and the robber gets some points.&lt;/li&gt;&#xA;&lt;li&gt;If your wordsearch survives the week, you get some points.&lt;/li&gt;&#xA;&lt;li&gt;You must reveal what your original code was after the week for it to earn points.&lt;/li&gt;&#xA;&lt;li&gt;Any code snippets in the wordsearch must be at least 4 characters long.&lt;/li&gt;&#xA;&lt;li&gt;Whitespace doesn't count in the wordsearch puzzle (&lt;code&gt;int var&lt;/code&gt; would become &lt;code&gt;intvar&lt;/code&gt; in the wordsearch. The robber can choose to interpret that as &lt;code&gt;int var&lt;/code&gt;, &lt;code&gt;intvar&lt;/code&gt;, or even &lt;code&gt;in tvar&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Code snippets can overlap in the wordsearch as long as no code snippet is located completely inside another snippet.&lt;/li&gt;&#xA;&lt;li&gt;The wordsearch is case-sensitive.&lt;/li&gt;&#xA;&lt;li&gt;There is a cap of 25 rows or columns of the wordsearch.&lt;/li&gt;&#xA;&lt;li&gt;No standard loopholes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Safe&lt;/strong&gt; submissions earn the &lt;strong&gt;cop&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;100/(number of cells ^ (2/3)) points&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For example, a 20x20 submission would receive&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;100/(400^(2/3)) = 100/54.3 = 1.84 points&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A 10x15 submission would receive&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;100/(150^(2/3)) = 100/28.2 = 3.54 points&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Cracked&lt;/strong&gt; submissions earn the &lt;strong&gt;robber&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(number of cells ^ (2/3))/10 points&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For example, a 20x20 submission would receive&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(400 ^ (2/3))/10 = 54.3/10 = 5.43 points&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A 10x15 submission would receive&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(150 ^ (2/3))/10 = 28.2/10 = 2.82 points&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your total points are the points that you receive from all of your safe submissions plus points from cracking other submissions. The user with the most points by (date a few weeks from challenge posted) wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example submission&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For the example submission, let's say that the program is a simple &quot;Hello, World!&quot; program in java:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;public class ictc{&#xA;  public static void main(String[] args){&#xA;    System.out.println(&quot;Hello World!&quot;);&#xA;  }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The first step to the submission would be to strip all whitespace:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;publicclassA{publicstaticvoidmain(String[]args){System.out.println(&quot;HelloWorld!&quot;);}}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The submission would look something like this:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Java, 10x10 grid&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;publicvgra   &#xA;lut.ptotto&#xA;n[b;main(S  &#xA;(]Slatd{}y&#xA;&quot;a{{iiints&#xA;Hrintcount &#xA;egnirts;Se&#xA;lssalcrram    &#xA;l);}}{;;;.&#xA;o{World!&quot;o&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hello World!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="41505" LastEditorUserId="41505" LastEditDate="2016-12-02T22:45:00.120" LastActivityDate="2016-12-02T22:45:00.120" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10771" PostTypeId="2" ParentId="2140" CreationDate="2016-12-02T15:35:59.147" Score="1" Body="&lt;h1&gt;&lt;em&gt;Determining the Dominant Bit&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your code, which can be a standalone program or a function, should take an input string. You can assume the string only consists of ASCII characters. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program should then print or return &lt;code&gt;0&lt;/code&gt; if the text contains more 0-bits, &lt;code&gt;1&lt;/code&gt; if it contains more 1-bits or something else (see below) if the number of 0-bits and 1-bits is equal.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Details&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The number of bits in a text is determined on a per-character basis: you take the ASCII code of the character (which is 0-127 in pure ASCII) and convert it to 7 bits of binary, then count the number of bits that are either set (1) or cleared (0). The occurrences of these bits are then summed over every character of the input string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the number of 0-bits and 1-bits is equal, the program should return or print something else than &lt;code&gt;0&lt;/code&gt; or &lt;code&gt;1&lt;/code&gt;. This can be returning or printing a negative number, printing nothing or returning &lt;code&gt;null&lt;/code&gt; (or similar), etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input will only have a single line and will not have any trailing newlines. You will only need to support the set of printable ASCII characters (ASCII codes 32-126) in the input. If the input is empty, act as if it had an equal number of 0-bits and 1-bits.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Code Golf&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Convert to ASCII codes:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;67 111 100 101 32 71 111 108 102&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Convert the numbers to 7-bit binary:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1000011 1101111 1100100 1100101 0100000 1000111 1101111 1101100 1100110&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The number of 0-bits is 28 and the number of 1-bits is 35, so 1-bit is the dominant bit. Therefore, the program should print or return &lt;code&gt;1&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Assuming equal number of 0-bits and 1-bits causes nothing to be printed:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: Code Golf&#xA;Output: 1&#xA;&#xA;Input: DETERMINING THE DOMINANT BIT&#xA;Output: 0&#xA;&#xA;Input: Equal Number of BITS?!&#xA;Output: &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Remember, this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the valid code with the fewest bytes wins. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/62966&quot;&gt;Standard loophole rules&lt;/a&gt; apply.&lt;/p&gt;&#xA;" OwnerUserId="62966" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-12-02T22:54:45.110" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10772" PostTypeId="2" ParentId="2140" CreationDate="2016-12-02T15:54:36.333" Score="0" Body="&lt;h2&gt;Linify&lt;/h2&gt;&#xA;&lt;p&gt;If you perform &lt;a href=&quot;https://codegolf.stackexchange.com/questions/101805/lined-up-circle-n-points&quot;&gt;this algorithm&lt;/a&gt; but leave out some of the lines, you can produce recognizable pictures.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://linify.me/P5Btdiu&quot; rel=&quot;nofollow noreferrer&quot;&gt;An example&lt;/a&gt; via Linify.me - as they &lt;a href=&quot;http://linify.me/about&quot; rel=&quot;nofollow noreferrer&quot;&gt;explain&lt;/a&gt;,&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Linify uses a greedy randomized algorithm. First, the darkest pixel is found. Then a number of random lines are drawn through that point, and the pixel values along each line are added together. The line with the darkest average is chosen, and the value of that line is subtracted from the image. Then the whole process is started over again for however many lines we are drawing. By the nature of the algorithm, the optimal line drawing configuration is probably not achieved, but performance is far superior to the naive method of checking every line.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The concept for this site came from a &lt;a href=&quot;https://www.reddit.com/r/Art/comments/454joy/drawing_experiment_every_line_goes_through_the/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Reddit thread&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Reduce (this input photo) to a linification using N pins on the outside circle. Each line of the file should be a comma separated list of the pin number and the other pins to draw lines to.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;(formula using code length and output quality using some sort of comparison software...)&lt;/p&gt;&#xA;&lt;p&gt;(maybe that comparison algorithm is itself a challenge)&lt;/p&gt;&#xA;&lt;p&gt;(maybe this linify challenge should be in black and white?)&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;The Mathematica Clause&lt;/em&gt;: You may import graphics and math libraries for your platform older than this post, and the code required to import them does not apply toward your byte count.&lt;/p&gt;&#xA;" OwnerUserId="62436" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-02T16:21:06.967" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10774" PostTypeId="2" ParentId="2140" CreationDate="2016-12-02T19:43:27.537" Score="-3" Body="&lt;h1&gt;Google Home / Amazon Echo - Turing complete?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to try to make a turing machine based on Google Home and Amazon Echo, see &lt;a href=&quot;https://www.youtube.com/watch?v=ZfCfTYZJWtI&quot; rel=&quot;nofollow noreferrer&quot;&gt;this video&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must describe how to set up the machine, and how to give it input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must also describe a program for integer addition. It should compute 1+1 to be 2, 200+55 = 255, 200+56 = 0, and so on for all other combinations of 2 8-bit integers.&lt;/p&gt;&#xA;" OwnerUserId="21796" LastActivityDate="2016-12-02T19:43:27.537" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="10775" PostTypeId="2" ParentId="10767" CreationDate="2016-12-02T20:09:18.773" Score="4" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;1) What are the limits for these kinds of languages? For answers like &lt;a href=&quot;https://codegolf.stackexchange.com/a/59497/41505&quot;&gt;this&lt;/a&gt;, it is pretty clear that when the language is used creatively, it is allowed.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That isn't clear to me at all. My (personal) opinion is that the post uses a non-programming language, so creative or not, it isn't valid. I won't delete it unilaterally though.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In general, &lt;em&gt;post X wasn't deleted so it is valid&lt;/em&gt; is a &lt;a href=&quot;https://meta.stackexchange.com/q/124635/170332&quot;&gt;broken-window argument&lt;/a&gt;. I deleted &lt;em&gt;your&lt;/em&gt; post because it was flagged for moderator attention. If it hadn't been, I would probably have missed it.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;2) What kind of edit would I be able to make to have the answer undeleted without changing the essence of the answer?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is my standard response when I delete answers, and I mention editing in case the affected user isn't aware that he can still edit mod-deleted answers. Apologies for the confusion. However, if you happen to know a different language that solves this task in zero bytes, you could fix your answer &lt;em&gt;without&lt;/em&gt; changing the essence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, there is no rule that says you cannot change &quot;the essence&quot; of an answer. Soft-deleted answers are forever visible to users with &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/moderator-tools&quot;&gt;access to moderator tools&lt;/a&gt;, so unless there's a compelling reason to post a new answer instead of editing a deleted one, the latter is preferable.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-12-02T20:09:18.773" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10778" PostTypeId="2" ParentId="8350" CreationDate="2016-12-02T21:55:35.977" Score="15" Body="&lt;h1&gt;Start all questions (challenges) as initially on hold&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(This is a specific proposal for implementing &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8491/62131&quot;&gt;this&lt;/a&gt; general idea.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In general, questions get a lot more attention when they're posted on main than when (and if) they're posted on Meta. This includes both answers, and improvements to the question itself. If we're lucky, the question gets fixed in the sense of being made better via edits, rather than being fixed in the sense of being unchangeable by answers which rely on loopholes in it (which normally makes the question unsalveagable even if it &lt;em&gt;could&lt;/em&gt; have been good).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because a question is more of a community collaboration here than it is on other SE sites (I know a very common pattern is post question → close → edit and reopen), it would make sense to have time to perfect the question before answers are allowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This would ideally be implemented in the SE software, but it's possible to do an inferior version without changes: you could get a bot with diamond moderator rights (or even a ton of bots which merely had the reputation to close posts) to close every question/challenge as soon as it was posted (probably unless it has &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; as a tag), placing it on hold for a few days (after which it will naturally lapse to closed). The main awkwardness in this would be what close reason you'd use (&quot;too broad&quot; is probably closest but doesn't really fit).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This would create a lot of extra work for the reopen queue, but that's unlikely to be a problem given our current balance between users and reputations.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2016-12-02T21:55:35.977" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10779" PostTypeId="2" ParentId="2140" CreationDate="2016-12-02T21:58:16.820" Score="-2" Body="&lt;p&gt;I want to post the question here to make sure it is suitable.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Question: Word Equations&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a word equation, the solution must output the answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My definition of a 'word equation' is an equation where the operators are words.&#xA;&lt;br&gt;&lt;br&gt;&lt;br&gt;&#xA;The operators will be spelt as&lt;/p&gt;&#xA;&#xA;&lt;p&gt;add&#xA;minus&#xA;times &#xA;divide&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&#xA;The solution must take one input&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The solution must give one output&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input: 7 add 8&#xA;Output: 15&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: 9 times -2&#xA;Output: -18&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: 24 divide 2&#xA;Output: 12&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: 4 minus 5&#xA;Ouput: -1&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&#xA;You are not required to deal with divide by zero errors.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fewest characters will win&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Feedback is welcomed&lt;/p&gt;&#xA;" OwnerUserId="55243" LastEditorUserId="55243" LastEditDate="2016-12-02T23:00:09.710" LastActivityDate="2016-12-02T23:00:09.710" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10780" PostTypeId="2" ParentId="8350" CreationDate="2016-12-02T22:14:04.710" Score="4" Body="&lt;h1&gt;Have a difficulty rating on challenges&lt;/h1&gt;&#xA;&lt;p&gt;I'd love it if the community could vote on challenges based on how difficult they think the challenge is, along with sorting/filtering based on difficulty.&lt;/p&gt;&#xA;&lt;p&gt;This will likely never get implemented, due to the complexity it adds, but it would really make the site seem more like a &amp;quot;challenge&amp;quot; site, and not just a site with a bunch of challenges.&lt;/p&gt;&#xA;&lt;p&gt;(I know, difficulty can be highly subjective, but the average rating would still serve as a good estimate)&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-02T22:14:04.710" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10781" PostTypeId="1" AcceptedAnswerId="10782" CreationDate="2016-12-03T01:49:16.887" Score="3" ViewCount="185" Body="&lt;p&gt;Most Java interpreters have a predefined memory limit. However, it's a &lt;code&gt;-X&lt;/code&gt; setting - an implementation specific setting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With C, the call stack is usually heavily limited. There's usually a compiler setting to increase this limit. This is implementation-specific and as far as the C spec is concerned, there's no call stack limit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should implementation-specific options to increase the memory limit count towards the byte/character count? In other words, should limitations of the physical world count towards the byte count?&lt;/p&gt;&#xA;" OwnerUserId="21796" LastEditorUserId="46076" LastEditDate="2019-10-17T21:02:56.557" LastActivityDate="2019-10-17T21:02:56.557" Title="Should a command line argument for increasing memory limits count towards byte/character count?" Tags="|discussion|scoring|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10782" PostTypeId="2" ParentId="10781" CreationDate="2016-12-03T02:01:42.957" Score="6" Body="&lt;h1&gt;It depends.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We usually require submissions to work only up to the limits of the compiler/hardware, as long as the underlying algorithm works for arbitrary input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unless the challenge specifically says otherwise, if a solution requires a wider integer type, a higher recursion limit, a bigger stack limit, more bytes of RAM than there are atoms in the observable universe, etc. for some/most/all of the test cases, you don't even need the &lt;code&gt;-X&lt;/code&gt; flag, so you don't have to add it to your byte count.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, if the challenge spec requires your solution to work for specific test cases, the extra flags &lt;em&gt;should&lt;/em&gt; count, as would the required import statements to work with arbitrary-precision integers.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2016-12-03T02:01:42.957" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10790" PostTypeId="2" ParentId="1501" CreationDate="2016-12-04T19:27:27.510" Score="-7" Body="&lt;p&gt;For me anonymous functions are not valid. They have to add the name to the function.if they not add its name, something one can call, for me it is not valid, it is not, one complete answer. Not seem to me ok that for call one function one has to copy all the function as in&#xA;{this is a function}&#xA;{this is a function} argument&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And not simply this f&amp;lt;-{this is a function}&lt;/p&gt;&#xA;&#xA;&lt;p&gt;f(argument)&lt;/p&gt;&#xA;" OwnerDisplayName="user58988" LastEditorDisplayName="user58988" LastEditDate="2016-12-04T19:33:35.613" LastActivityDate="2016-12-04T19:33:35.613" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10791" PostTypeId="2" ParentId="1213" CreationDate="2016-12-05T02:24:51.183" Score="0" Body="&lt;h1&gt;RProgN&lt;/h1&gt;&#xA;&lt;p&gt;You can either use the Online Interpreter, currently hosted on GitHub via:&#xA;&lt;a href=&quot;https://tehflamintaco.github.io/Reverse-Programmer-Notation/RProgN.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://tehflamintaco.github.io/Reverse-Programmer-Notation/RProgN.html&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Alternatively, you can download the standalone Lua Implementation from:&#xA;&lt;a href=&quot;https://github.com/TehFlaminTaco/Reverse-Programmer-Notation&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://github.com/TehFlaminTaco/Reverse-Programmer-Notation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;After doing so, you can run it via the command line using:&#xA;&lt;code&gt;lua main.lua code.rpn &amp;lt;Inputs&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Note, the Offline Interpreter requires Lua 5.3, yet the Online Interpreter should function identically as the master branch, as it essential runs a Lua VM, and loads the code from the Master.&lt;/p&gt;&#xA;" OwnerUserId="58375" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-05T02:24:51.183" CommentCount="0" CommunityOwnedDate="2016-12-05T02:24:51.183" ContentLicense="CC BY-SA 3.0" />
  <row Id="10792" PostTypeId="2" ParentId="2140" CreationDate="2016-12-05T11:59:41.253" Score="0" Body="&lt;h2&gt;Quine Creator&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Consider a program (or function or code snippet) that accepts a single string argument and returns a string result. Here's an example, which I will call Program 1, of a program that duplicates its input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;@echo %* %*&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We could write a Program 2 that would take the source code of the original program and substitute a hard-coded string, so that the resulting source code would take no input and produce a fixed result. If we passed it Program 1 and &quot;Hello, world!&quot;, it would produce a program that always outputs &quot;Hello, world!&quot; in duplicate:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;@echo Hello, world! Hello, world!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Moving on, consider Program 3 which has the effect of Program 2 with the same string for both the source code and the hard-coded string, so for input of Program 1 this would result in something like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;@echo @echo %* @echo %*&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;All that remains is to invoke Program 3 with its own source code as its input. Program 3 will then create a program that invokes Program 3 with the source code of Program 3 as its input. In other words, a quine!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please provide the source to Program 3.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest resulting &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2016-12-05T11:59:41.253" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="10793" PostTypeId="1" CreationDate="2016-12-05T12:09:49.707" Score="23" ViewCount="635" Body="&lt;p&gt;I want to add a loophole about random stuff in CnR challenges to the standard loophole list, but I have a hard time formulating the post in a way that won't result in a lot of &quot;... but what about xyz?&quot;, and &quot;zyx is not really random, but it still requires brute forcing&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I want to add a loophole that disallows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Cop posts that use random number generators&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;rand(&quot;seed&quot;,_____);rand(_____)(_:_)&lt;/code&gt; gives the 7 first integers of &lt;a href=&quot;https://oeis.org/A088957&quot; rel=&quot;nofollow noreferrer&quot;&gt;A088957&lt;/a&gt;. Good luck!&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Cop posts that use something that could just as well be random&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;sin(cos(tan(________))&lt;/code&gt; gives 1-9 if you take 9 consecutive digits starting at digit number &lt;code&gt;k&lt;/code&gt;. Not random, but could just as well be.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Cop posts that create a program that generates its output by decrypting a sequence of bytes via RSA&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The list goes on. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Cop posts like these are only possible to crack by brute-forcing it, and that's not very fun since it has nothing to do with programming skills, (everyone here can write a brute force solver, but it's not fun, and might take a lot of time). It's easy to think that downvoting &quot;boring&quot; solutions like this would prevent it -&gt; Problem solved. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;But, most CnR posts have hidden characters, and how would you know if &lt;code&gt;_n_(&quot; ee &quot;)()&lt;/code&gt; is a clever post, or just some random &quot;stuff&quot; that happens to solve the challenge? It looks clever at first sight, you can't find a way to solve it, so you upvote it and think: &quot;Man, that was a clever post&quot;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Problems that might arise if we try to prevent this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What about posts that are borderline random?&lt;/li&gt;&#xA;&lt;li&gt;What about posts that require brute-force solving, but are not random?&lt;/li&gt;&#xA;&lt;li&gt;Where do we set the limit, and how do we define it in an unambiguous way?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Note: I'm not suggesting to disallow all posts that requires some degree of brute forcing to solve, only posts that requires &lt;em&gt;only&lt;/em&gt; brute forcing to solve.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Is it possible to ban such submissions? How could we phrase it?  &lt;/p&gt;&#xA;" OwnerUserId="31516" LastEditorUserId="31516" LastEditDate="2017-01-16T23:25:45.610" LastActivityDate="2017-08-27T09:52:53.590" Title="Add randomization in CnR posts as a loophole?" Tags="|discussion|cops-and-robbers|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10797" PostTypeId="1" CreationDate="2016-12-06T07:10:56.447" Score="1" ViewCount="62" Body="&lt;p&gt;I was thinking maybe we should have a tag for those things that are kind of like kolmogorov complexity, in that it is a no-input output challenge, but not quite.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For those challenges where a output from no input is needed, but is just something that obeys certain rules, rather than one specific output. The output may or may not be deterministic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Might need a better name. Probably post something if you have one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples of challenges in this category:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/101727/please-do-my-martian-homework&quot;&gt;Please do my martian homework&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/99913/5-favorite-letters&quot;&gt;5 favourite letters&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/97305/print-some-json&quot;&gt;Print some JSON&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="55896" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-12-06T07:10:56.447" Title="New tag proposal: Variable Kolmogorov Complexity" Tags="|discussion|tags|" AnswerCount="0" CommentCount="6" ClosedDate="2016-12-06T17:45:18.803" ContentLicense="CC BY-SA 3.0" />
  <row Id="10798" PostTypeId="1" CreationDate="2016-12-06T10:54:58.810" Score="1" ViewCount="91" Body="&lt;p&gt;I have a challenge idea that is pure Conway's Game of Life, would this be on topic on PPCG?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I know we already have &lt;a href=&quot;https://codegolf.stackexchange.com/questions/11880/build-a-working-game-of-tetris-in-conways-game-of-life&quot;&gt;some&lt;/a&gt;, but it seems to me that they're just cool language restricted golf, which are frequently frowned upon here. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10799/56245&quot;&gt;sandbox post&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="56245" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-12-07T18:02:37.720" Title="Are GoL challenge on topic" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10799" PostTypeId="2" ParentId="2140" CreationDate="2016-12-06T12:48:21.133" Score="-2" Body="&lt;h2&gt;GoL flooding&lt;/h2&gt;&#xA;&lt;p&gt;Considering a 1000x1000 grid (no wrapping, borders dead), your task is to grow the maximum &amp;quot;stable&amp;quot; population from the fewer individuals.&lt;/p&gt;&#xA;&lt;p&gt;For the purpose of this challenge, the definition of stable is a configuration who repeat with a period of less than hundred(100) generations.&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;Your score is lowest number of live cells in your stable population divided by the number of initialy live cells, highest score win&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game-of-life&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game-of-life&amp;#39;&quot; rel=&quot;tag&quot;&gt;game-of-life&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10798/are-gol-challenge-on-topic&quot;&gt;meta post about on topicness&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="56245" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-06T14:59:23.590" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10808" PostTypeId="1" CreationDate="2016-12-06T19:33:08.603" Score="29" ViewCount="1438" Body="&lt;p&gt;Every now and then, we get an answer flag the declares an answer a duplicate of another. So far, I haven't really acted on them – except for leaving a comment if the flagger hadn't done so already – since we don't have an official policy regarding duplicate answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This discussion has two parts:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;What exactly should count as a duplicate answer?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So far, we had the discussion &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1950/12012&quot;&gt;Identifying Duplicate Answers&lt;/a&gt; which currently suggests using a comment to vote on. That's not really practical; you can't downvote comments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's also &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8851/12012&quot;&gt;Are these answers duplicate?&lt;/a&gt;, which discusses whether calling a solution in another language with a system call (or similar) is considered a duplicate. The votes seem to lean towards allowing this, but there is no strong consensus.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What should happen to duplicate answers?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Duplicate questions are &lt;em&gt;closed&lt;/em&gt;, but you can't close an answer. Locking would be the closest equivalent, but that's not really what locks are for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can't think of an option besides deleting and leaving them alone. If we opt for the latter, discussing item 1 is pointless.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2023-11-20T18:19:46.000" Title="Definite policy about duplicate answers" Tags="|discussion|policy|answers|duplicates|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10809" PostTypeId="1" CreationDate="2016-12-06T20:11:45.797" Score="8" ViewCount="1009" Body="&lt;p&gt;(See also &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/546/62131&quot;&gt;this&lt;/a&gt; question, which is similar, but talks about the situation where the language is normally stored on disk with one command per byte.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This question originally came up in connection with &lt;a href=&quot;http://esolangs.org/wiki/7&quot; rel=&quot;nofollow noreferrer&quot;&gt;7&lt;/a&gt;, but might be relevant to other languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In 7, each command is only three bits long (it only has 8 commands which can be specified in source files). It accepts multiple input formats; one uses one byte per command (for ease of editing and testing), one reads the sequence of bits formed by the input file and interprets every three bits as a command. Because most computer systems don't allow a file to contain a fractional number of bytes, any amount of &quot;trailing whitespace&quot; (in this case, 1 bits) can be placed at the end of a file, and is ignored by the interpreter's file reading routines.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The information content of the language is obviously 3 bits (i.e. ⅜ of a byte) per command. Dennis has suggested that the length of a program should be rounded up to a whole number of bytes, because that's how file storage works. Alternatively, you could the length &lt;em&gt;down&lt;/em&gt; by removing trailing 1 bits (as the program considers them not to exist). How should this be counted?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a final question to consider: if the interpreter was changed to accept programs over an RS-232 interface (which is physically capable of sending an arbitrary number of bits), would that change the scoring?&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.797" LastActivityDate="2016-12-06T20:37:22.847" Title="How to count bytes in 7 (and other languages that use fractional numbers of bytes)" Tags="|discussion|code-golf|answers|scoring|" AnswerCount="1" CommentCount="3" ClosedDate="2022-06-23T05:38:47.303" ContentLicense="CC BY-SA 3.0" />
  <row Id="10810" PostTypeId="2" ParentId="10809" CreationDate="2016-12-06T20:37:22.847" Score="15" Body="&lt;h1&gt;The answer's score is the source code's size&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Unless you can store your program somehow by using only 3 bits, you cannot claim a size of ⅜ bytes. That's the only rule that makes sense in the long run, since claiming scores that cannot actually be achieved by any implementation will inevitably lead to endless discussion about the scores of post X and language Y. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The analogy with trailing whitespace for padding bits is a good one, but I don't agree with your conclusion. If a program has to be stored with a trailing newline, that trailing newline contributes to the byte count. If it doesn't require the newline, remove it so it won't count towards the score. However, you &lt;em&gt;cannot&lt;/em&gt; remove your padding bits in the Perl implementation of &lt;strong&gt;7&lt;/strong&gt;.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2016-12-06T20:37:22.847" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="10811" PostTypeId="2" ParentId="10808" CreationDate="2016-12-06T20:47:33.477" Score="-1" Body="&lt;h2&gt;What are duplicate answers?&lt;/h2&gt;&#xA;&lt;p&gt;Well, that's a hard one to answer. There are some obvious cases, but a lot of the time it comes down to a judgement call. You have to ask yourself, &amp;quot;Does this add anything to the site, given that there is already answer X?&amp;quot; If the answer is no, it's probably a duplicate.&lt;/p&gt;&#xA;&lt;p&gt;Some obvious cases:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Exact same code in the exact same language&lt;/li&gt;&#xA;&lt;li&gt;Exact same code in basically the same language (using a trivial derivative or a similar language that only requires minor syntax changes)&lt;/li&gt;&#xA;&lt;li&gt;Using the code from another answer (like &lt;code&gt;int main(){system(&amp;quot;cat&amp;quot;);return 0;}&lt;/code&gt; in C versus &lt;code&gt;cat&lt;/code&gt; in bash)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;What should we do about duplicate answers?&lt;/h2&gt;&#xA;&lt;p&gt;This question is much easier to answer: flag them for moderator attention so that they can be deleted. They don't add anything of value to the site, given that the answer already exists, and they clutter the answers.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-06T20:47:33.477" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10812" PostTypeId="2" ParentId="10808" CreationDate="2016-12-07T00:57:26.537" Score="40" Body="&lt;h2&gt;Allow duplicate answers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I think we shouldn't take action against duplicate submissions, even when the code is identical. We should assume good faith: the second submitter almost surely came up with the code on their own. We see on &lt;a href=&quot;http://golf.shinh.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;anarchy golf&lt;/a&gt; that identical submissions are common among experienced golfers when code is hidden.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We have enough of a &lt;a href=&quot;https://meta.stackexchange.com/q/9731/275609&quot;&gt;FGITW problem&lt;/a&gt; where people rush out fast answers to get votes and attention. Allowing only one of a solution makes it more of a race. Moreover, deleting the slower-posted of two identical solutions is frustrating to the poster, who showed just as much skill. This is more likely to be a newer user, who isn't constantly refreshing the question page and needs more time to write and format a submission.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I understand that a dishonest poster could copy another solution and claim they found it independently. I wouldn't expect this to be a problem from what I've seen -- people seem to be gracious in crediting others and selfless in suggesting improvements. I'd reconsider if it became a visible problem.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2016-12-07T00:57:26.537" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="10813" PostTypeId="1" CreationDate="2016-12-07T06:12:17.740" Score="20" ViewCount="920" Body="&lt;p&gt;Unlike traditional coding competition sites, submissions (answers) on PPCG are free form; the only hard requirement is that all submissions must contain the scoring header and the code that solves the challenge. While some answers stop there, others contain a lot of additional information.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Usually, additional information is a good thing. Explanation of how the code works, ungolfed code (in the case of code golf competitions), links to online interpreters, visualizations, proof sketches of used properties, etc. are always welcome, as they help understanding the post. We're still part of the SE network which strives to create valuable sources of knowledge, and although we compete rather than answering questions, reading through the submissions to a challenge is usually a learning opportunity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is also common to include a second solution to the same challenge in a single post, usually due to self-imposed restrictions. For example, if the interpreter of the language of choice had a bug, one may post a competing and a non-competing, higher-scoring solution. Likewise, to similar solutions where the lower-scoring one is a lot more efficient are also common.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But not all additions to a submission are welcome. An extreme example would be spam, which is deleted on sight, even if it is an addendum to an otherwise valid answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A less extreme example would be an ASCII art version of the code, e.g., the source code shaped like a beer bottle for a &lt;em&gt;99 bottles of beer&lt;/em&gt; challenge. (Thankfully, this is by far less frequent than it used to be.) While this technique is usually popular with the voters, it doesn't really improve the post from a programming point of view. Personally, I consider these additions as upvote bait.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, there's &lt;a href=&quot;https://codegolf.stackexchange.com/a/102240/12012&quot;&gt;this answer&lt;/a&gt;, which is the reason I'm starting this meta discussion. Initially, it was deleted because it contained a polyglot that solves the challenge as written in one programming language, and related challenges for other natural languages in other programming languages. This brought the submission to &lt;strong&gt;1931&lt;/strong&gt; bytes, and it was deemed a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8750/12012&quot;&gt;non-serious contender&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since then, the answer was edited to include a &lt;strong&gt;24 byte&lt;/strong&gt; submission in BASIC, which by itself is a proper answer. However, the answer still contain the information of the original revision, which occupies the lion share of the post. While I consider the polyglot quite interesting and impressive, it is only tangentially related to the challenge and takes up &lt;em&gt;a lot&lt;/em&gt; of space. The code that solves the actual challenge seems a mere formality in comparison. For the time being, I have undeleted and locked the answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Should this specific answer stay as it is, or should the second part get removed?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In general, what kind of additional information should be allowed as part of an answer?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If an answer contains irrelevant information, what should we do?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-12-07T17:07:03.580" Title="What additional information should be allowed in a submission?" Tags="|discussion|policy|answers|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10816" PostTypeId="2" ParentId="10813" CreationDate="2016-12-07T12:05:25.947" Score="10" Body="&lt;p&gt;I'm not going to answer all three questions in one post, because then interpreting the votes is impossible. So this only really addresses question 1:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;In this specific case&lt;/strong&gt;, the added BASIC code should have been a new answer. It's not an improvement to the original answer, because it uses a different language; and it's not a trivial port which just serves to supplement the original answer. Therefore the net outcome should be the same as if the BASIC code had been posted as a new answer: the original answer should stand or fall on its own merits, and since it fails one of our basic criteria it should be edited out.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2016-12-07T12:05:25.947" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10820" PostTypeId="2" ParentId="10813" CreationDate="2016-12-07T17:07:03.580" Score="3" Body="&lt;p&gt;Can I have a word?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If my post &lt;strong&gt;should&lt;/strong&gt; be deleted from there anyway, I might… instead put there the link to a third-party website where the actual answer will be stored. Is that accessible?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But in that case, I want my published answer have a header plus all my screenshot images, and first three my original paragraphs (up to actual polyglot code), since they resemble the beginning of the challenge question itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then a problem that my post is just &lt;em&gt;too long&lt;/em&gt; will be solved. Also I could provide a screenshot of the text and put it as a link.&lt;/p&gt;&#xA;" OwnerUserId="63039" LastActivityDate="2016-12-07T17:07:03.580" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10821" PostTypeId="2" ParentId="10798" CreationDate="2016-12-07T18:02:37.720" Score="3" Body="&lt;h1&gt;Yes.&lt;/h1&gt;&#xA;&lt;p&gt;Think of it as a language-restricted challenge, like you said.  &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8788/should-language-specific-code-golf-challenges-be-explicitly-disallowed&quot;&gt;These are allowed by meta consensus.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-07T18:02:37.720" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10824" PostTypeId="1" AcceptedAnswerId="10825" CreationDate="2016-12-07T19:04:37.520" Score="2" ViewCount="48" Body="&lt;p&gt;Yesterday I asked this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/102362/gather-the-trash&quot;&gt;question&lt;/a&gt; which was very quickly put on hold.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As I rarely contribute here, I wouldn't have been surprised if my question has been closed as uninteresting, or too hard, or too easy, but the last thing I expected was the reason currently alleged, &quot;unclear what you're asking&quot;. How anybody could find that full problem statement unclear is beyond me.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An upvoted comment indicates that my question makes perfect sense to several other users. My last comment asking for my critics to clarify what they found unclear got no answer at all.&lt;/p&gt;&#xA;" OwnerUserId="53281" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-12-07T19:12:16.697" Title="Why was my question put on hold, what can I do to improve it" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10825" PostTypeId="2" ParentId="10824" CreationDate="2016-12-07T19:12:16.697" Score="2" Body="&lt;p&gt;It shouldn't have been closed as unclear. There are currently 4 reopen votes on it (one of them is mine). It should be reopened shortly.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2016-12-07T19:12:16.697" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10826" PostTypeId="2" ParentId="2140" CreationDate="2016-12-07T19:40:28.047" Score="0" Body="&lt;p&gt;I tried searching for this, thinking it was a duplicate.  I was unable to find anything (hard to know what to search for), so let me know if it is.&lt;/p&gt;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&lt;p&gt;We all know how to apply &lt;code&gt;bitwise not&lt;/code&gt; to a binary number.  It simply flips all the bits, so &lt;code&gt;10010&lt;/code&gt; becomes &lt;code&gt;01101&lt;/code&gt;.  For this challenge, we will be creating a definition for a &lt;code&gt;digitwise not&lt;/code&gt;, applying the same concept to base 10.&lt;/p&gt;&#xA;&lt;h1&gt;Digitwise Not&lt;/h1&gt;&#xA;&lt;p&gt;For this challenge, digitwise not is defined as follows.  Line up the digits 0-9.  Because 0 and 9 are endpoints of this list, they are considered &amp;quot;opposite&amp;quot;, so &lt;code&gt;digitwiseNot(0) == 9&lt;/code&gt;, and &lt;code&gt;digitwiseNot(9) == 0&lt;/code&gt;.  The same concept applies when you go one element into the list from both ends, meaning 1 and 8 are opposite, as are 2 and 7, etc.  Full list:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 &amp;lt;=&amp;gt; 9 &#xA;1 &amp;lt;=&amp;gt; 8 &#xA;2 &amp;lt;=&amp;gt; 7 &#xA;3 &amp;lt;=&amp;gt; 6 &#xA;4 &amp;lt;=&amp;gt; 5 &#xA;5 &amp;lt;=&amp;gt; 4 &#xA;6 &amp;lt;=&amp;gt; 3 &#xA;7 &amp;lt;=&amp;gt; 2 &#xA;8 &amp;lt;=&amp;gt; 1 &#xA;9 &amp;lt;=&amp;gt; 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For multi-digit numbers, you apply the operation separately for each digit.  For example, &lt;code&gt;digitwiseNot(1234)&lt;/code&gt; is &lt;code&gt;8765&lt;/code&gt; because 1 -&amp;gt; 8, 2 -&amp;gt; 7, 3 -&amp;gt; 6, and 4 -&amp;gt; 5.&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take only a single input, representing an integer greater than or equal to 0 in whatever format is best for your language (stdin or function parameter, integer or string, etc)&lt;/li&gt;&#xA;&lt;li&gt;Produces a single output, which is the digitwise not of the input (can be returned from function or printed to stdout)&lt;/li&gt;&#xA;&lt;li&gt;Can be either a full program or just a function.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56586" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-07T19:40:28.047" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10829" PostTypeId="2" ParentId="2140" CreationDate="2016-12-07T23:45:22.970" Score="0" Body="&lt;h1&gt;Christmas Present Viewing  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You're stacking Christmas presents, and you'd like to make sure that the pile will be aesthetically pleasing from whichever side you view it, without having to actually go through all the hard work of stacking them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program that takes the size of the present stacks in the pile, and outputs what the pile will look like from all four corners.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each present is an opaque cube that looks like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  +----+&#xA; /    /|&#xA;+----+ |&#xA;|    | +&#xA;|    |/&#xA;+----+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If you have two presents next to each other, for example, it would look like this, because the nearer present occludes part of the further one:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  +----+----+&#xA; /    /    /|&#xA;+----+----+ |&#xA;|    |    | +&#xA;|    |    |/&#xA;+----+----+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Two presents with a single space gap between them would look like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  +----+    +----+&#xA; /    /|   /    /|&#xA;+----+ |  +----+ |&#xA;|    | +  |    | + &#xA;|    |/   |    |/&#xA;+----+    +----+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A two-dimensional rectangular set of integers greater than or equal to 0, representing the heights of stacks of presents in the pile, and an integer determining which corner to view it from.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;01  1&#xA;10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;would indicate two stacks 1 present high, that are diagonally adjacent, viewed from the corner you have assigned index 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may have the corners be 0-indexed or 1-indexed and you may have them occur in any order, as long as a different corner is used for each of {0,1,2,3} or {1,2,3,4}.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An ASCII image, showing the stack from the selected corner. Parts of the presents that would be occluded by part of a present in front of them should not be shown.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may optionally begin and end lines with up to ten trailing spaces.&lt;/li&gt;&#xA;&lt;li&gt;You may optionally begin and end your output with up to seven additional newlines.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;[&lt;strong&gt;Sandbox note:&lt;/strong&gt; This is so that there can be up to one present width and depth around the drawn area. This question is supposed to be about drawing the boxes with occlusion, not working out how wide the drawing should be.]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, for the input given earlier, the output should look like (all four corners are given; your code need only return one at a time):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;         +----+&#xA;        /    /|&#xA;  +----+----+ |&#xA; /    /|    | +&#xA;+----+ |    |/&#xA;|    | +----+&#xA;|    |/&#xA;+----+&#xA;&#xA;&#xA;  +----+&#xA; /    /|&#xA;+----+----+&#xA;|   /    /|&#xA;|  +----+ |&#xA;+--|    | +&#xA;   |    |/&#xA;   +----+&#xA;&#xA;&#xA;         +----+&#xA;        /    /|&#xA;  +----+----+ |&#xA; /    /|    | +&#xA;+----+ |    |/&#xA;|    | +----+&#xA;|    |/&#xA;+----+&#xA;&#xA;&#xA;  +----+&#xA; /    /|&#xA;+----+----+&#xA;|   /    /|&#xA;|  +----+ |&#xA;+--|    | +&#xA;   |    |/&#xA;   +----+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code wins.&#xA;Standard loopholes are forbidden.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Tests&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;  +----+&#xA; /    /|&#xA;+----+ |&#xA;|    | +&#xA;|    |/&#xA;+----+&#xA;  +----+&#xA; /    /|&#xA;+----+ |&#xA;|    | +&#xA;|    |/&#xA;+----+&#xA;  +----+&#xA; /    /|&#xA;+----+ |&#xA;|    | +&#xA;|    |/&#xA;+----+&#xA;  +----+&#xA; /    /|&#xA;+----+ |&#xA;|    | +&#xA;|    |/&#xA;+----+&#xA;&#xA;&#xA;010&#xA;101&#xA;010&#xA;         +----+&#xA;        /    /|&#xA;  +----+----+----+&#xA; /    /|   /    /|&#xA;+----+----+----+ |&#xA;|   /    /|    | + &#xA;|  +----+ |    |/&#xA;+--|    | +----+&#xA;   |    |/&#xA;   +----+ &#xA;         +----+&#xA;        /    /|&#xA;  +----+----+----+&#xA; /    /|   /    /|&#xA;+----+----+----+ |&#xA;|   /    /|    | + &#xA;|  +----+ |    |/&#xA;+--|    | +----+&#xA;   |    |/&#xA;   +----+ &#xA;         +----+&#xA;        /    /|&#xA;  +----+----+----+&#xA; /    /|   /    /|&#xA;+----+----+----+ |&#xA;|   /    /|    | + &#xA;|  +----+ |    |/&#xA;+--|    | +----+&#xA;   |    |/&#xA;   +----+ &#xA;         +----+&#xA;        /    /|&#xA;  +----+----+----+&#xA; /    /|   /    /|&#xA;+----+----+----+ |&#xA;|   /    /|    | + &#xA;|  +----+ |    |/&#xA;+--|    | +----+&#xA;   |    |/&#xA;   +----+    &#xA;&#xA;&#xA;11&#xA;  +----+----+&#xA; /    /    /|&#xA;+----+----+ |&#xA;|    |    | +&#xA;|    |    |/&#xA;+----+----+&#xA;    +----+&#xA;   /    /|&#xA;  +----+ |&#xA; /    /| +&#xA;+----+ |/&#xA;|    | +&#xA;|    |/&#xA;+----+&#xA;  +----+----+&#xA; /    /    /|&#xA;+----+----+ |&#xA;|    |    | +&#xA;|    |    |/&#xA;+----+----+&#xA;    +----+&#xA;   /    /|&#xA;  +----+ |&#xA; /    /| +&#xA;+----+ |/&#xA;|    | +&#xA;|    |/&#xA;+----+&#xA;&#xA;&#xA;01&#xA;10&#xA;         +----+&#xA;        /    /|&#xA;  +----+----+ |&#xA; /    /|    | +&#xA;+----+ |    |/&#xA;|    | +----+&#xA;|    |/&#xA;+----+&#xA;  +----+&#xA; /    /|&#xA;+----+----+&#xA;|   /    /|&#xA;|  +----+ |&#xA;+--|    | +&#xA;   |    |/&#xA;   +----+&#xA;         +----+&#xA;        /    /|&#xA;  +----+----+ |&#xA; /    /|    | +&#xA;+----+ |    |/&#xA;|    | +----+&#xA;|    |/&#xA;+----+&#xA;  +----+&#xA; /    /|&#xA;+----+----+&#xA;|   /    /|&#xA;|  +----+ |&#xA;+--|    | +&#xA;   |    |/&#xA;   +----+&#xA;&#xA;&#xA;2&#xA;  +----+&#xA; /    /|&#xA;+----+ |&#xA;|    | +&#xA;|    |/|&#xA;+----+ |&#xA;|    | +&#xA;|    |/&#xA;+----+&#xA;  +----+&#xA; /    /|&#xA;+----+ |&#xA;|    | +&#xA;|    |/|&#xA;+----+ |&#xA;|    | +&#xA;|    |/&#xA;+----+&#xA;  +----+&#xA; /    /|&#xA;+----+ |&#xA;|    | +&#xA;|    |/|&#xA;+----+ |&#xA;|    | +&#xA;|    |/&#xA;+----+&#xA;  +----+&#xA; /    /|&#xA;+----+ |&#xA;|    | +&#xA;|    |/|&#xA;+----+ |&#xA;|    | +&#xA;|    |/&#xA;+----+&#xA;&#xA;&#xA;101&#xA;121&#xA;010&#xA;&#xA;&#xA;       +----+&#xA;    +-/    /| +----+&#xA;   / +----+ |/    /|&#xA;  +--|    | +----+ |&#xA; /   |    |/    /| +&#xA;+----+----+----+ |/&#xA;|   /    /|    | +&#xA;|  +----+ |    |/&#xA;+--|    | +----+&#xA;   |    |/&#xA;   +----+&#xA;&#xA;&#xA;         +----+&#xA;      +-/    /|-+&#xA;     / +----+ |/|&#xA;    +--|    | +----+&#xA;    |  |    |/    /|&#xA;  +----+----+----+ |&#xA; /    /    /|    | +&#xA;+----+----+ |    |/&#xA;|    |    | +----+&#xA;|    |    |/&#xA;+----+----+&#xA;         +----+&#xA;        /    /|-+&#xA;       +----+ |/|&#xA;    +--|    | +----+ &#xA;   /   |    |/    /|&#xA;  +----+----+----+ |&#xA; /    /|   /    /| +&#xA;+----+ |  +----+ |/&#xA;|    | +--|    | + &#xA;|    |/   |    |/&#xA;+----+    +----+&#xA;       +----+&#xA;      /    /|-+----+&#xA;     +----+ |/    /|&#xA;  +--|    | +----+ |&#xA; /   |    |/|    | +&#xA;+----+----+----+ |/&#xA;|   /    /    /|-+&#xA;|  +----+----+ |&#xA;+--|    |    | +&#xA;   |    |    |/&#xA;   +----+----+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="59940" LastActivityDate="2016-12-07T23:45:22.970" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10830" PostTypeId="2" ParentId="8350" CreationDate="2016-12-07T23:48:42.170" Score="9" Body="&lt;h1&gt;Include Top Askers in tag wiki side panel&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Currently the side panel in each &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot; title=&quot;Code golf tag wiki for example&quot;&gt;tag wiki page&lt;/a&gt; shows a list of Top Answerers, which for a Q&amp;amp;A site makes perfect sense. However, here it would be good to also recognise our challenge authors.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not recommending removing the Top Answerers list - it's also very useful to see who is answering for a given tag. The Top Askers would simply be another list of 5 users directly below the first list.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-12-07T23:48:42.170" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10831" PostTypeId="2" ParentId="2140" CreationDate="2016-12-08T02:00:46.367" Score="0" Body="&lt;h1&gt;Ordinal Representation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A trick in code golfing, especially when digit usage in a source is restricted, is to use the ordinal values of characters to reach numbers. Instead of finding a representation for a single number, you will be finding an algorithm to represent any number in terms of ordinal values.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given an integer &lt;code&gt;N&lt;/code&gt; from stdin, print its representation as a sum, diference, and/or product of the fewest terms taken from the range [32, 47] + [58, 126] (symbolic non-numeric characters). Parentheses are not allowed, and standard order of operations is used. There are often multiple minimal representations possible, but any one of them is acceptable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;0 &amp;lt; &lt;code&gt;N&lt;/code&gt; &amp;lt; 2&lt;sup&gt;31&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Score ranking in order of importance:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Shortest representation by number of terms&lt;/li&gt;&#xA;&lt;li&gt;Shortest code by bytes&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;47&#xA;/&#xA;&#xA;14&#xA;=-/&#xA;&#xA;2016&#xA; *?     //Spaces may be represented as is.&#xA;&#xA;1999&#xA;$*/-E&#xA;&#xA;8675&#xA;U*d+K&#xA;&#xA;10001&#xA;d*e-d&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="63160" LastActivityDate="2016-12-08T02:00:46.367" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10832" PostTypeId="2" ParentId="2140" CreationDate="2016-12-08T03:10:34.130" Score="1" Body="&lt;h1&gt;The evolution of integers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game-of-life&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game-of-life&amp;#39;&quot; rel=&quot;tag&quot;&gt;game-of-life&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Conway&amp;#39;s_Game_of_Life&quot; rel=&quot;nofollow noreferrer&quot;&gt;The game of life&lt;/a&gt; (GOL) is a famous cellular automaton where cells turn on and off depending on how many neighbors they have. For a quick overview, the rules are:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Every cell is either alive or dead. Each generation:&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Every live cell with fewer than two live neighbors dies&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Every live cell with more than three live neighbors dies&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Every live cell with two or three live neighbors lives to the next generation, and&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;And every dead cell with exactly three live neighbors is brought back to life.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You can play around with it &lt;a href=&quot;https://bitstorm.org/gameoflife/&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; to see what happens with these rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The cool thing about Game of Life is that the structures and patterns will rapidly evolve over time creating some cool patterns. Let's take this idea of evolving patterns and use it for evolving integers. Here's what your submission must do:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Pick a starting configuration of the GOL. We'll call this your &quot;template&quot;. Now you must write a program that has the same visual layout as this template. For example, let's say you were to pick the infamous &quot;Gosper Glider&quot; as your starting template. For reference, it looks like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; * &#xA;  *&#xA;***&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now your program can only have non-whitespace characters where the live cells are. So in my fictional programming language &quot;Spam&quot;, this is a valid program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; a &#xA;  b&#xA;123&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Running this program must output the number '1', optionally followed by a trailing newline.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Evolve&lt;/em&gt; your program. To evolve your program, apply one generation of the rules of GOL, where whitespace is a dead cell and non-whitespace is a live cell. For example, applying one generation to our previous template will give the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; * *&#xA;  **&#xA;  *&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now you must write another program in the same language that follows this new template. This new program should print the number '2', again optionally followed by a trailing newline.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Repeat this process, evolving your template and increasing the number that is output for as long as possible.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Your score is the total number of generations your code goes while still producing the correct number. If someone manages to create a program that works to infinity, for example by using a &lt;a href=&quot;https://en.wikipedia.org/wiki/Gun_(cellular_automaton)&quot; rel=&quot;nofollow noreferrer&quot;&gt;gun&lt;/a&gt; or something similar, the winning criteria will be the number of live cells in the starting configuration. Earlier posting date will be used as a tiebreaker.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any questions?&lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2016-12-08T03:10:34.130" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10833" PostTypeId="1" AcceptedAnswerId="10839" CreationDate="2016-12-08T03:17:13.357" Score="6" ViewCount="265" Body="&lt;p&gt;So, there's a community consensus that functions from stack based languages can &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8507/56085&quot;&gt;leave their output on the stack&lt;/a&gt;. This question is about an edge case for that. Suppose the correct result is some value x. Also suppose that that you are working with a stack based language that has an unlimited well of x's on the stack. Is it then valid to leave the stack unmodified?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if the task is &quot;output 0,&quot; and my language has an infinite well of zeroes on the stack, is a zero-length function valid? (Disregarding the fact that zero-byte solutions are sometimes considered invalid because they have zero bytes).&lt;/p&gt;&#xA;" OwnerUserId="56085" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-12-08T14:33:06.740" Title="What exactly is &quot;on the stack&quot;" Tags="|discussion|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10834" PostTypeId="2" ParentId="10833" CreationDate="2016-12-08T03:38:10.823" Score="4" Body="&lt;h1&gt;The output must replace the input on the stack&lt;/h1&gt;&#xA;&lt;p&gt;Naturally, this means it must be on top of the stack. If you are outputting multiple values, they can be combined in a single stack element like a list, or they can all be individual stack elements. The end of the output is defined as the stack element on top of the first stack element that was not part of the input (if any). For example, if your stack looked like &lt;code&gt;[1, 2, 3, 4]&lt;/code&gt; (top is left), and you called a function &lt;code&gt;f&lt;/code&gt; which took two arguments and returned any number of arguments, the stack afterwards must either look like &lt;code&gt;[[...], 3, 4]&lt;/code&gt; or &lt;code&gt;[..., 3, 4]&lt;/code&gt; (where &lt;code&gt;...&lt;/code&gt; represents any number of elements). &lt;code&gt;[5, 3, 4]&lt;/code&gt; would mean the output is &lt;code&gt;5&lt;/code&gt;. However, &lt;code&gt;[3, 5, 4]&lt;/code&gt; would not be valid, as it modified values on the stack below the input.&lt;/p&gt;&#xA;&lt;p&gt;In other words, the final stack minus the output element(s) must be indistinguishable from the initial stack minus the input element(s). This means that, if you have an infinite amount of identical elements below the input, the function may remove any number of those elements, since an observer (who only sees the function as a black box) would not be able to tell whether or not any of those infinite identical elements were removed.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-08T08:06:38.197" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10835" PostTypeId="1" CreationDate="2016-12-08T07:12:51.203" Score="16" ViewCount="972" Body="&lt;p&gt;As our &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;help center&lt;/a&gt; likes to put it:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;All &lt;strong&gt;solutions&lt;/strong&gt; to challenges should:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Correctly implement the required specification.&lt;/li&gt;&#xA;&lt;li&gt;Be a serious contender for the winning criteria in use. For example, an entry to a &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;code golf&lt;/a&gt; contest needs to be golfed, and an entry to a speed contest should make some attempt to be fast.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Per our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990/12012&quot;&gt;policy about answers not meeting the challenge specification&lt;/a&gt;, non-serious contenders are subject to deletion.&lt;/p&gt;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8749/12012&quot;&gt;Clarifying &amp;quot;serious contender&amp;quot; in the help center&lt;/a&gt;, we tried to clarify what &lt;em&gt;serious contender&lt;/em&gt; actually means. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8750/12012&quot;&gt;@Mego's answer&lt;/a&gt; – currently the highest scoring one – starts as follows.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A serious contender is a submission which makes a serious effort towards optimizing the submission's score within the chosen language(s) and other choices (such as algorithm choice or optional restrictions/bonuses taken).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;That covers different algorithms (think brute force vs closed form, each of which might have a shorter implementation in a given language), bonuses (now frowned upon anyway).&lt;/p&gt;&#xA;&lt;p&gt;Restrictions are trickier. Self-imposed restrictions like a clean exit or avoiding warnings seem to be accepted in general, but a new one – input validation – has come up in the last couple of days. Specifically, I'm talking about these answers:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/102312/12012&quot;&gt;Axiom answer to “Binary to decimal converter”&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/102426/12012&quot;&gt;Axiom answer to “Subsequence Substitution”&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Both challenges imply or even explicitly state that the input will be &amp;quot;valid&amp;quot; (i.e., obey a certain format), yet the author decided to validate the input in his answers because he considers code without input validation incomplete. While that may very well be true for production code, the challenge specifications say otherwise.&lt;/p&gt;&#xA;&lt;p&gt;That begs the question: &lt;strong&gt;What kind of self-imposed restrictions should be allowed for a serious contender in code golf competitions, even when adhering to them inevitably elevates the byte count?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Realistically, I don't expect a clear-cut division as a result of this meta discussion, but coming up with a few necessary or sufficient conditions (or at least partial white- and a blacklists) that cover most cases should be possible.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-03-07T02:58:00.027" Title="Can serious contenders do more than the challenge asks for?" Tags="|discussion|policy|code-golf|answers|" AnswerCount="4" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10836" PostTypeId="2" ParentId="10835" CreationDate="2016-12-08T07:12:51.203" Score="31" Body="&lt;h1&gt;Serious contenders do not contain superfluous code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I propose the following:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If a part or multiple parts of the code can be deleted without affecting its functionality with regard to the challenge specification, the submission is &lt;strong&gt;not&lt;/strong&gt; a serious contender. Answers that meet this criterion should be amended. Answers that meet this criterion &lt;strong&gt;deliberately&lt;/strong&gt; or &lt;strong&gt;completely&lt;/strong&gt; should be removed.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't mean a few unnecessary bytes here and there. We all miss a golfing opportunity every now and then, and a new user will naturally miss more golfing opportunities than an experienced one.&lt;br&gt;&#xA;&lt;strong&gt;In this case, the proper course of action is guidance, not threatening deletion.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This covers all illustration in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8750/12012&quot;&gt;@Mego's answer&lt;/a&gt; that concern code golf and more. A few examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Variable names should be as short as possible.&lt;/li&gt;&#xA;&lt;li&gt;Non-essential whitespace should be removed.&lt;/li&gt;&#xA;&lt;li&gt;Brackets should be removed whenever possible.&lt;/li&gt;&#xA;&lt;li&gt;Comments should be removed, unless they are required to comply with the challenge's rules.&lt;/li&gt;&#xA;&lt;li&gt;Program shouldn't perform input validation, unless the challenges requires this.&lt;/li&gt;&#xA;&lt;li&gt;Programs shouldn't display input prompts (e.g., &lt;code&gt;Please enter an integer:&lt;/code&gt;), unless the challenges requires this.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;While this doesn't even attempt to cover all forms of non-serious contenders, an answer that can be golfed down by merely removing a part of the code is a clear indication of a non-serious contender.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that the following answers, although strictly speaking not as short as possible, &lt;strong&gt;cannot&lt;/strong&gt; be golfed by simply removing a part of the code, meaning that my proposal does &lt;strong&gt;not&lt;/strong&gt; make them non-serious contenders.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Answers may choose any programming language, including intentionally verbose languages.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;An answer may implement any algorithm, even if golfier ones exist.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even if a brute force solution leads to the shortest code, seeing efficient algorithms (if properly golfed) is still interesting.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Answers may choose not to take advantage of some &quot;ugly hacks&quot;, such as terminating the program by crashing the interpreter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This should be a personal choice, not be forced upon all competitors.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-12-11T02:12:45.167" CommentCount="19" ContentLicense="CC BY-SA 3.0" />
  <row Id="10839" PostTypeId="2" ParentId="10833" CreationDate="2016-12-08T10:59:21.363" Score="5" Body="&lt;p&gt;While I broadly agree with Mego's answer, I find that it leaves a few important cases as implications, and I think it would be clearer to spell them out explicitly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I admit that the answer you linked isn't very explicit about &lt;em&gt;how&lt;/em&gt; stack-based I/O works for functions, but there is a sort of unwritten but accepted set of rules that such functions adhere to (at least the ones I've written or reviewed), so this answer tries to collect these:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When the function is called, input is given as a number of values on top of the stack. The function must &lt;em&gt;not&lt;/em&gt; assume that the input is the only content of the stack. In particular, &lt;strong&gt;the function should work regardless of the stack contents beneath the input.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;If the input is a list of variable length, the individual values may appear as separate values on the stack, but then there either needs to be an appropriate terminating value (e.g. a &lt;code&gt;-1&lt;/code&gt; if all elements are guaranteed to be non-negative numbers) or the number of elements should be on top of the stack.&lt;/li&gt;&#xA;&lt;li&gt;At the end of the function, all input values should be &lt;em&gt;replaced&lt;/em&gt; with the output values. &lt;strong&gt;Any part of the stack that wasn't part of the input has to remain unchanged.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;As for input, variable-sized output is possible either by terminating it with an appropriate value or by storing the number of values on top.&lt;/li&gt;&#xA;&lt;li&gt;Finally, if the solution is entirely indistinguishable (by the means of the language) from a solution that follows the above rules, it's valid.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The last point is where infinite stacks come into play. In general, a function &lt;em&gt;can't&lt;/em&gt; work with the infinite well at the bottom of the stack, because you're not allowed to make any assumptions about what lies between the input and the infinite well. However, if your function detects that there is nothing between the input and the infinite well, and the output is identical to the default value of the infinite well &lt;em&gt;and&lt;/em&gt; it's impossible to distinguish implicit values from explicit ones, then the function can return on an &quot;empty&quot; stack.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The key here is &quot;it's impossible to distinguish implicit values from explicit ones&quot;. As an example, my language Labyrinth (which doesn't have functions, but it will act as an example) has infinite stacks with an implicit well of zeros at the bottom. However, it &lt;em&gt;does&lt;/em&gt; make a difference whether you leave off with an &quot;empty&quot; stack or a stack with a single explicit zero on top, because there's a stack-depth command, which would count the explicit zero. Other languages, like my language Stack Cats (still no functions, but you get the point) will automatically discard any zeros at the bottom of the stack, because they're indistinguishable from the infinite well anyway.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Further, consider a hypothetical language that doesn't have an infinite well of zeros, but where the stack starts out with 1 on top, 2 below that, then 3 and so on (still an infinite well, but it contains the natural numbers instead of copies of a fixed value). In this case, it's unlikely you'll be able to make use of the infinite well at all, because the function can't assume that all of the implicit values are still there, and even if they are, putting another &lt;code&gt;1&lt;/code&gt; on top is clearly different from not doing so.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So while in principle it's possible to make use of the infinite well at the bottom, this only works in the very narrow case, that there is absolutely no way to tell the difference, which is probably not worth the bytes in most cases.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-12-08T10:59:21.363" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="10841" PostTypeId="2" ParentId="2140" CreationDate="2016-12-08T12:12:12.447" Score="1" Body="&lt;h1&gt;Print the missing primes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;The Task&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that, when passed a numerical input &lt;code&gt;x&lt;/code&gt;, prints or returns the primes beneath the square root of &lt;code&gt;x&lt;/code&gt;&lt;sup&gt;1&lt;/sup&gt; that are not factors of &lt;code&gt;x&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Let &lt;code&gt;f(x)&lt;/code&gt; be the function called:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt; f(5)&#xA;[2]&#xA;&#xA;&amp;gt;&amp;gt;&amp;gt; f(20)&#xA;[3]&#xA;&#xA;&amp;gt;&amp;gt;&amp;gt; f(60)&#xA;[7]&#xA;&#xA;&amp;gt;&amp;gt;&amp;gt; f(100)&#xA;[3, 7]&#xA;&#xA;&amp;gt;&amp;gt;&amp;gt; f(10000)&#xA;[3, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Bonus Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may use any builtins that your language provides.&lt;/li&gt;&#xA;&lt;li&gt;Your program must support an &lt;code&gt;x&lt;/code&gt; input as high as the upper bound defined by your language.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; Using the square root as only primes below the square root can actually be involved within the factors of &lt;code&gt;x&lt;/code&gt;. Without making this restriction, larger numbers would have a lot of excess numbers.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;More specification?&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="44713" LastEditDate="2016-12-08T12:46:00.027" LastActivityDate="2016-12-08T12:46:00.027" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10845" PostTypeId="2" ParentId="10835" CreationDate="2016-12-08T16:05:12.000" Score="-10" Body="&lt;p&gt;&lt;sup&gt;As a devil advocate to dennis's post.&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Challenges may contain extraneous code&lt;/h1&gt;&#xA;&lt;p&gt;So long as the requirements to fulfill the challenge are completely met,  all code should be accepted. In most cases, serious contenders won't put extra code into challenges similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges. However, in a less competitive space, there may very well be the urge to go above and beyond in your answer. This sort of overachieving should be encouraged.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Why would we need extraneous code?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Newbies almost always have code that is extraneous,but still fit the challenge. We cannot simply dismiss them as &amp;quot;non-serious&amp;quot; competitors. That's not a good attitude.&lt;/li&gt;&#xA;&lt;li&gt;It's not maintainable. Removing and/or fixing every answer (or to even attempt to) that has 'extra brackets' somewhere in it is a large task. It would put undue stress on our moderators and community.&lt;/li&gt;&#xA;&lt;li&gt;Naturally, most extra code is not competitive in most games. There is no need to impose a 'survival of the fittest' rule to remove the worst ones. The answers will sink naturally.&lt;/li&gt;&#xA;&lt;li&gt;We have down-votes for this reason. If an answer is clearly written by somebody looking for a reaction, give the answer a down-vote.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="60951" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-08T16:07:09.270" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="10846" PostTypeId="2" ParentId="10835" CreationDate="2016-12-08T17:17:51.183" Score="12" Body="&lt;h1&gt;Adding difficulty to the challenge is allowed&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A primary purpose of this site is to promote clever answers.  This cleverness has always been focused on optimizing one's score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I'm proposing that we allow people to place additional self-imposed restrictions, while still optimizing their score.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some examples would be:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You want to do a particular challenge without using a particular feature of your language (Solving an equation without using &lt;code&gt;eval&lt;/code&gt;).  &lt;/li&gt;&#xA;&lt;li&gt;You want your submission to be a polyglot that performs the task in 3 different languages&lt;/li&gt;&#xA;&lt;li&gt;A challenge indicates that a submission needs to solve inputs from 1 to 10 in under a second.  You want to handle &lt;em&gt;any&lt;/em&gt; input from 1 to 1000.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;In each of these cases, &lt;strong&gt;the submission would still need to show effort in golfing, as that is still the scoring criterion&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To address concerns:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Why not just make it a separate challenge?:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This doesn't always work, especially if your restrictions are based on the language you are writing it in&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;They aren't competing in the same challenge anymore.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I agree.  However, we've already indicated that different languages aren't competing against each other.  This isn't that different to picking a different language without a particular feature you don't like (Looking at you Geobits)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;This could lead to submissions that add arbitrary restrictions and aren't really clever/interesting.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I agree.  However, I don't think that this has been an issue historically, and I don't think it will become one.  If it does become a problem, we can revisit the topic to fix the issue.  For now, a simple solution is to downvote uninteresting submissions.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The TL;DR is:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;We like clever answers, and therefore&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;We should allow people to add self-imposed difficulty the challenge to increase the possibility for clever answers&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2016-12-08T17:24:29.037" LastActivityDate="2016-12-08T17:24:29.037" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10847" PostTypeId="2" ParentId="2140" CreationDate="2016-12-08T18:12:25.187" Score="1" Body="&lt;h1&gt;3-way Polyglot Prime Checker &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Make a program that checks if a number is prime in three distinct languages.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Two versions of the same language aren't considered distinct languages.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2016-12-08T18:12:25.187" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10848" PostTypeId="2" ParentId="10081" CreationDate="2016-12-08T18:15:08.690" Score="8" Body="&lt;h2&gt;Count all imports&lt;/h2&gt;&#xA;&lt;p&gt;The rules for counting imports are vaguely spread across several meta posts, but the default and simplest rule is to count them:&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;When looking into this, I first came across &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8779/14215&quot;&gt;Scoring Java with Imports&lt;/a&gt;. There's only one answer there (&lt;strong&gt;score them&lt;/strong&gt;), but it was also marked as a duplicate, since as noted in comments, a lambda is a function.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;So, following the dupe trail leads you to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8287/14215&quot;&gt;On Scoring Imported Functions&lt;/a&gt;. There's one answer present, which seems to say that if an import is required to call the function, then you must &lt;strong&gt;count the import&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Similarly, in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9031/14215&quot;&gt;Unnamed Functions in Code Golf&lt;/a&gt;, one of the bullets is:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Any imports/includes/requires/whatever may be imported/included/required/whatever outside of the function (&lt;code&gt;import math;math.gcd&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;So it's clear that it's not enough for a function to &lt;em&gt;exist&lt;/em&gt; (you can't just say &lt;code&gt;gcd&lt;/code&gt; is the entirety of your code), you must &lt;strong&gt;count the import&lt;/strong&gt; so that you can call it.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;More obliquely, in an answer to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9847/14215&quot;&gt;Do I need to use imports or can I call a class explicitly&lt;/a&gt;, an answer argues for &lt;strong&gt;counting imports&lt;/strong&gt; that are necessary for it to run:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;If you are using a function instead of a full program, you must include any necessary includes/imports so that you could copy and paste the entire submission into a full program, and it would successfully compile/run.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;It's not a huge consensus (if you can even call it that), but there are no comments or answers challenging that there.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;The &lt;em&gt;only&lt;/em&gt; exception I see to the default rule of &lt;em&gt;count all imports&lt;/em&gt;, is the other answer to this question. Carving out an exception for this doesn't make sense, and does nothing but make it more confusing for newcomers. No matter how advantageous it is to lowering the byte count, it doesn't make sense as a rule.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-28T00:55:42.503" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10849" PostTypeId="1" CreationDate="2016-12-08T22:03:17.137" Score="21" ViewCount="400" Body="&lt;p&gt;One of the more popular comments on our site goes something like this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Hi, and welcome to PPCG! Your challenge was closed because it's a bit unclear/broad/whatever as it is now. I would recommend posting in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/14215&quot;&gt;Sandbox&lt;/a&gt; so you can get constructive feedback before you post to main.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;(Please excuse the sloppy wording, but we've all seen various examples of this comment)&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When I'm at a PC, this is fairly simple. On mobile, while it's not exactly impossible, it's definitely more of a hassle. I usually just don't bother and hope someone else does. Even while at a PC though, it would be nice to not have to open another tab to grab the link.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The solution for many commonly commented links is a &lt;a href=&quot;https://meta.stackexchange.com/a/94000/212780&quot;&gt;&quot;magic link&quot;&lt;/a&gt;, which would automatically be converted to a proper link when posted. I think &lt;code&gt;[sandbox]&lt;/code&gt; would be a good addition. It's probably the most common link on the whole site (in comments, that is), so it would simplify writing these introductions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, I don't know how SE handles these things, or whether they even want to do custom links for each site, but I think it's worth proposing here first to gauge interest.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="38734" LastEditDate="2021-06-09T15:04:38.237" LastActivityDate="2021-07-09T16:18:26.333" Title="Can we get a &quot;magic link&quot; to the Sandbox?" Tags="|feature-request|status-declined|sandbox|comments|markdown|" AnswerCount="2" CommentCount="21" ContentLicense="CC BY-SA 3.0" />
  <row Id="10850" PostTypeId="2" ParentId="10849" CreationDate="2016-12-08T22:40:32.683" Score="1" Body="&lt;p&gt;There's a super cool user script that I use to create auto comments, such as &lt;a href=&quot;https://stackoverflow.com/questions/40928021/seed-projects-with-mit-license#comment69257651_40928021&quot;&gt;this one on Stack Overflow&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yaar. Now where did I find it... Oh. Doorknob made it. I'll just copy the script since I don't have the link handy. You can set custom comments to your desire. I think it uses jQuery too!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;I doubt SE would do something for the site, since it's very site specific, but hey. I don't know.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;// ==UserScript==&#xD;&#xA;// @name stackexchange-quickcomment2&#xD;&#xA;// @namespace http://keyboardfire.com/&#xD;&#xA;// @grant none&#xD;&#xA;// @license MIT&#xD;&#xA;// @description Quick SE comments for quick SE people. (Vastly improved)&#xD;&#xA;// @version 1.0.0&#xD;&#xA;// @match *://*.stackexchange.com/*&#xD;&#xA;// @match *://*.stackoverflow.com/*&#xD;&#xA;// @match *://*.superuser.com/*&#xD;&#xA;// @match *://*.serverfault.com/*&#xD;&#xA;// @match *://*.askububtu.com/*&#xD;&#xA;// @match *://*.stackapps.com/*&#xD;&#xA;// @match *://*.mathoverflow.net/*&#xD;&#xA;// ==/UserScript==&#xD;&#xA;&#xD;&#xA;var userscript = function($) {&#xD;&#xA;&#xD;&#xA;var qc2;&#xD;&#xA;function updateLS() { localStorage.qc2 = JSON.stringify(qc2); }&#xD;&#xA;if (localStorage.qc2) {&#xD;&#xA;    qc2 = JSON.parse(localStorage.qc2);&#xD;&#xA;} else {&#xD;&#xA;    qc2 = {&#xD;&#xA;        trigger: {&#xD;&#xA;            altKey: true,&#xD;&#xA;            ctrlKey: false,&#xD;&#xA;            shiftKey: false,&#xD;&#xA;            which: 88&#xD;&#xA;        },&#xD;&#xA;        data: {&#xD;&#xA;            naa: 'This is not an answer.',&#xD;&#xA;            welcome: 'Welcome to $SITENAME!',&#xD;&#xA;            lorem: 'Lorem ipsum dolor sit amet, consectetur adipiscing elit.'&#xD;&#xA;        }&#xD;&#xA;    };&#xD;&#xA;    updateLS();&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;$(function() {&#xD;&#xA;    $('&amp;lt;style&amp;gt;' +&#xD;&#xA;        '.qc2_selected { background-color: #FF0; }' +&#xD;&#xA;        '.qc2_popup { background-color: #E0EAF1; text-align: left; }' +&#xD;&#xA;        '.qc2_popup &amp;gt; * { margin: 5px; word-wrap: break-word; }' +&#xD;&#xA;    '&amp;lt;/style&amp;gt;').appendTo('head');&#xD;&#xA;&#xD;&#xA;    var dialog = $('&amp;lt;div&amp;gt;')&#xD;&#xA;        .attr('id', 'qc2_dialog')&#xD;&#xA;        .appendTo(document.body)&#xD;&#xA;        .css({&#xD;&#xA;            position: 'absolute',&#xD;&#xA;            width: '250px',&#xD;&#xA;            height: '350px',&#xD;&#xA;            textAlign: 'left',&#xD;&#xA;            overflowX: 'hidden',&#xD;&#xA;            overflowY: 'scroll'&#xD;&#xA;        })&#xD;&#xA;        .addClass('qc2_popup')&#xD;&#xA;        .append($('&amp;lt;button&amp;gt;')&#xD;&#xA;            .text('settings')&#xD;&#xA;            .mousedown(showSettings)&#xD;&#xA;        )&#xD;&#xA;        .append($('&amp;lt;input&amp;gt;')&#xD;&#xA;            .attr('type', 'text')&#xD;&#xA;            .keydown(function(e) {&#xD;&#xA;                switch (e.which) {&#xD;&#xA;                case 27: // esc&#xD;&#xA;                    hideDialog();&#xD;&#xA;                    break;&#xD;&#xA;                case 40: // down arrow&#xD;&#xA;                    e.preventDefault();&#xD;&#xA;                    var toChange = $('.qc2_selected').nextAll('div:visible').eq(0);&#xD;&#xA;                    if (toChange.length) {&#xD;&#xA;                        $('.qc2_selected').removeClass('qc2_selected');&#xD;&#xA;                        toChange.addClass('qc2_selected');&#xD;&#xA;                    }&#xD;&#xA;                    break;&#xD;&#xA;                case 38: // up arrow&#xD;&#xA;                    e.preventDefault();&#xD;&#xA;                    var toChange = $('.qc2_selected').prevAll('div:visible').eq(0);&#xD;&#xA;                    if (toChange.length) {&#xD;&#xA;                        $('.qc2_selected').removeClass('qc2_selected');&#xD;&#xA;                        toChange.addClass('qc2_selected');&#xD;&#xA;                    }&#xD;&#xA;                    break;&#xD;&#xA;                }&#xD;&#xA;            })&#xD;&#xA;            .keyup(function(e) {&#xD;&#xA;                if (e.which === 13) { // enter&#xD;&#xA;                    var cmt = dialog.data('comment');&#xD;&#xA;                    var str = $('span:last', '.qc2_selected').text()&#xD;&#xA;                        .replace(/\$SITENAME/g, StackExchange.options.site.name)&#xD;&#xA;                        .replace(/\$SITEURL/g, window.location.hostname);&#xD;&#xA;                    cmt.val(cmt.val() + str);&#xD;&#xA;                    hideDialog();&#xD;&#xA;                } else if (e.which !== 40 &amp;amp;&amp;amp; e.which !== 38) {&#xD;&#xA;                    var txt = $('input', dialog).val(),&#xD;&#xA;                        needToUpdateSelected = !$('&amp;gt;div:visible').length;&#xD;&#xA;                    $('&amp;gt;div span:first-child', dialog).each(function() {&#xD;&#xA;                        if (this.textContent.indexOf(txt) === -1) {&#xD;&#xA;                            $(this).parent().hide();&#xD;&#xA;                            if ($(this).parent().hasClass('qc2_selected')) {&#xD;&#xA;                                needToUpdateSelected = true;&#xD;&#xA;                            }&#xD;&#xA;                        } else {&#xD;&#xA;                            $(this).parent().show();&#xD;&#xA;                        }&#xD;&#xA;                    });&#xD;&#xA;                    if (needToUpdateSelected) {&#xD;&#xA;                        $('.qc2_selected').removeClass('qc2_selected');&#xD;&#xA;                        $('&amp;gt;div:visible:first', dialog).addClass('qc2_selected');&#xD;&#xA;                    }&#xD;&#xA;                }&#xD;&#xA;            })&#xD;&#xA;            .blur(hideDialog)&#xD;&#xA;        )&#xD;&#xA;        .hide();&#xD;&#xA;&#xD;&#xA;    // I don't know why I have to do this&#xD;&#xA;    // but it works, so I'll just go with it&#xD;&#xA;    dialog[0].scrollTop = 0;&#xD;&#xA;&#xD;&#xA;    reloadDialogData();&#xD;&#xA;&#xD;&#xA;    $(document).on('keydown', 'textarea[name=&quot;comment&quot;]', function(e) {&#xD;&#xA;        if (qc2.trigger.altKey === e.altKey &amp;amp;&amp;amp;&#xD;&#xA;            qc2.trigger.ctrlKey === e.ctrlKey &amp;amp;&amp;amp;&#xD;&#xA;            qc2.trigger.shiftKey === e.shiftKey &amp;amp;&amp;amp;&#xD;&#xA;            qc2.trigger.which === e.which) {&#xD;&#xA;            e.preventDefault();&#xD;&#xA;            showDialog($(this));&#xD;&#xA;        }&#xD;&#xA;    });&#xD;&#xA;});&#xD;&#xA;&#xD;&#xA;function showDialog(commentBox) {&#xD;&#xA;    $('#qc2_dialog').data('comment', commentBox).css({&#xD;&#xA;        top: commentBox.offset().top,&#xD;&#xA;        left: commentBox.offset().left&#xD;&#xA;    }).show('fast');&#xD;&#xA;    $('#qc2_dialog input').focus();&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function hideDialog() {&#xD;&#xA;    $('#qc2_dialog&amp;gt;div').show().removeClass('qc2_selected');&#xD;&#xA;    $('#qc2_dialog&amp;gt;div:first').addClass('qc2_selected');&#xD;&#xA;    $('#qc2_dialog input').val('');&#xD;&#xA;    $('#qc2_dialog').hide().data('comment').focus();&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function reloadDialogData() {&#xD;&#xA;    $('#qc2_dialog&amp;gt;div').remove();&#xD;&#xA;    for (var k in qc2.data) {&#xD;&#xA;        var v = qc2.data[k];&#xD;&#xA;        $('#qc2_dialog').append(kvpair(k, v));&#xD;&#xA;    }&#xD;&#xA;    $('#qc2_dialog&amp;gt;div:first').addClass('qc2_selected');&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function showSettings() {&#xD;&#xA;    var settingsDiv = $('&amp;lt;div&amp;gt;')&#xD;&#xA;        .css({&#xD;&#xA;            position: 'fixed',&#xD;&#xA;            top: '50%',&#xD;&#xA;            left: '50%',&#xD;&#xA;            width: '400px',&#xD;&#xA;            height: '400px',&#xD;&#xA;            margin: '-200px 0px 0px -200px',&#xD;&#xA;            overflowX: 'hidden',&#xD;&#xA;            overflowY: 'scroll'&#xD;&#xA;        })&#xD;&#xA;        .addClass('qc2_popup')&#xD;&#xA;        .appendTo(document.body)&#xD;&#xA;        .append($('&amp;lt;button&amp;gt;')&#xD;&#xA;            .text('Done')&#xD;&#xA;            .click(function() {&#xD;&#xA;                settingsDiv.remove();&#xD;&#xA;            })&#xD;&#xA;        )&#xD;&#xA;        .append($('&amp;lt;br&amp;gt;'))&#xD;&#xA;        .append($('&amp;lt;label&amp;gt;')&#xD;&#xA;            .attr('for', 'qc2_trigger_input')&#xD;&#xA;            .text('Trigger:')&#xD;&#xA;        )&#xD;&#xA;        .append($('&amp;lt;input&amp;gt;')&#xD;&#xA;            .attr('id', 'qc2_trigger_input')&#xD;&#xA;            .attr('type', 'text')&#xD;&#xA;            .val(triggerStr())&#xD;&#xA;            .keydown(function(e) {&#xD;&#xA;                e.preventDefault();&#xD;&#xA;                qc2.trigger = {&#xD;&#xA;                    altKey: e.altKey,&#xD;&#xA;                    ctrlKey: e.ctrlKey,&#xD;&#xA;                    shiftKey: e.shiftKey,&#xD;&#xA;                    which: e.which&#xD;&#xA;                };&#xD;&#xA;                updateLS();&#xD;&#xA;                $(this).val(triggerStr());&#xD;&#xA;            })&#xD;&#xA;        );&#xD;&#xA;&#xD;&#xA;    for (var k in qc2.data) {&#xD;&#xA;        var v = qc2.data[k];&#xD;&#xA;        settingsDiv.append(kvpair(k, v)&#xD;&#xA;            .append(linkbtn('edit', function(e) {&#xD;&#xA;                    settingsDiv.remove();&#xD;&#xA;                    var editKey = $(e.target).siblings(':first').text();&#xD;&#xA;                    getStr('New value for ' + editKey + ':', function(str) {&#xD;&#xA;                        qc2.data[editKey] = str;&#xD;&#xA;                        updateLS();&#xD;&#xA;                        reloadDialogData();&#xD;&#xA;                        showSettings();&#xD;&#xA;                    }, qc2.data[editKey]);&#xD;&#xA;                })&#xD;&#xA;            )&#xD;&#xA;            .append(linkbtn('delete', function(e) {&#xD;&#xA;                    settingsDiv.remove();&#xD;&#xA;                    var editKey = $(e.target).siblings(':first').text();&#xD;&#xA;                    getStr('Are you sure you want to remove ' + editKey +&#xD;&#xA;                        '? (yes/no)', function(str) {&#xD;&#xA;                        if (str === 'yes') {&#xD;&#xA;                            delete qc2.data[editKey];&#xD;&#xA;                            updateLS();&#xD;&#xA;                            reloadDialogData();&#xD;&#xA;                        }&#xD;&#xA;                        showSettings();&#xD;&#xA;                    });&#xD;&#xA;                })&#xD;&#xA;            )&#xD;&#xA;        );&#xD;&#xA;    }&#xD;&#xA;&#xD;&#xA;    settingsDiv.append(linkbtn('new...', function() {&#xD;&#xA;            settingsDiv.remove();&#xD;&#xA;            getStr('New shortcut key:', function(newKey) {&#xD;&#xA;                getStr('New value for ' + newKey + ':', function(newVal) {&#xD;&#xA;                    qc2.data[newKey] = newVal;&#xD;&#xA;                    updateLS();&#xD;&#xA;                    reloadDialogData();&#xD;&#xA;                    showSettings();&#xD;&#xA;                });&#xD;&#xA;            });&#xD;&#xA;        })&#xD;&#xA;    )&#xD;&#xA;    .append(linkbtn('export...', function() {&#xD;&#xA;            settingsDiv.remove();&#xD;&#xA;            getStr('Copy the following text:', function() {}, JSON.stringify(qc2));&#xD;&#xA;        })&#xD;&#xA;    )&#xD;&#xA;    .append(linkbtn('import...', function() {&#xD;&#xA;            settingsDiv.remove();&#xD;&#xA;            getStr('Paste exported text here:', function(str) {&#xD;&#xA;                qc2 = JSON.parse(str);&#xD;&#xA;                updateLS();&#xD;&#xA;                reloadDialogData();&#xD;&#xA;            });&#xD;&#xA;        })&#xD;&#xA;    );&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function triggerStr() {&#xD;&#xA;    return (&#xD;&#xA;        (qc2.trigger.altKey ? 'Alt+' : '') +&#xD;&#xA;        (qc2.trigger.ctrlKey ? 'Ctrl+' : '') +&#xD;&#xA;        (qc2.trigger.shiftKey ? 'Shift+' : '') +&#xD;&#xA;        String.fromCharCode(qc2.trigger.which)&#xD;&#xA;    );&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function getStr(query, callback, placeholder) {&#xD;&#xA;    if (!placeholder) placeholder = '';&#xD;&#xA;    var getDiv = $('&amp;lt;div&amp;gt;')&#xD;&#xA;        .css({&#xD;&#xA;            position: 'fixed',&#xD;&#xA;            top: '50%',&#xD;&#xA;            left: '50%',&#xD;&#xA;            width: '400px',&#xD;&#xA;            marginLeft: '-200px'&#xD;&#xA;        })&#xD;&#xA;        .addClass('qc2_popup')&#xD;&#xA;        .appendTo(document.body)&#xD;&#xA;        .append($('&amp;lt;div&amp;gt;')&#xD;&#xA;            .text(query)&#xD;&#xA;        )&#xD;&#xA;        .append($('&amp;lt;input&amp;gt;')&#xD;&#xA;            .val(placeholder)&#xD;&#xA;            .attr('type', 'text')&#xD;&#xA;            .keydown(function(e) {&#xD;&#xA;                if (e.which === 13) {&#xD;&#xA;                    $(this).parent().remove();&#xD;&#xA;                    callback($(this).val());&#xD;&#xA;                }&#xD;&#xA;            })&#xD;&#xA;        );&#xD;&#xA;    getDiv.css({&#xD;&#xA;        height: getDiv.height() + 'px',&#xD;&#xA;        marginTop: '-' + (getDiv.height() / 2) + 'px'&#xD;&#xA;    });&#xD;&#xA;    $('input', getDiv).focus().select();&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function linkbtn(text, callback) {&#xD;&#xA;    return $('&amp;lt;a&amp;gt;')&#xD;&#xA;        .attr('href', '#')&#xD;&#xA;        .text(text)&#xD;&#xA;        .css('padding-left', '5px')&#xD;&#xA;        .click(function(e) {&#xD;&#xA;            e.preventDefault();&#xD;&#xA;            callback(e);&#xD;&#xA;        });&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function kvpair(k, v) {&#xD;&#xA;    return $('&amp;lt;div&amp;gt;')&#xD;&#xA;        .css({&#xD;&#xA;            borderBottom: '1px dotted grey',&#xD;&#xA;            padding: '2px 0px'&#xD;&#xA;        })&#xD;&#xA;        .append($('&amp;lt;span&amp;gt;')&#xD;&#xA;            .text(k)&#xD;&#xA;            .css({&#xD;&#xA;                fontWeight: 'bold',&#xD;&#xA;                paddingRight: '5px'&#xD;&#xA;            })&#xD;&#xA;        )&#xD;&#xA;        .append($('&amp;lt;span&amp;gt;')&#xD;&#xA;            .text(v)&#xD;&#xA;            .css({&#xD;&#xA;                color: 'grey'&#xD;&#xA;            })&#xD;&#xA;        );&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;};&#xD;&#xA;&#xD;&#xA;var el = document.createElement('script');&#xD;&#xA;el.type = 'text/javascript';&#xD;&#xA;el.text = '(' + userscript + ')(jQuery);';&#xD;&#xA;document.head.appendChild(el);&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So let's see:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Desktops/Laptops/Whatevertops................. YES!&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://openuserjs.org/about/Tampermonkey-for-Android&quot; rel=&quot;nofollow noreferrer&quot;&gt;Android&lt;/a&gt;............................................................. YES!&lt;/li&gt;&#xA;&lt;li&gt;iOS..................................................................... Who knows.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Thanks to Nathan Merrill for &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/34000214#34000214&quot;&gt;talking about Android&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="42208" LastEditorUserId="42208" LastEditDate="2016-12-08T22:54:34.257" LastActivityDate="2016-12-08T22:54:34.257" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10859" PostTypeId="1" CreationDate="2016-12-09T22:02:12.470" Score="4" ViewCount="121" Body="&lt;p&gt;I've seen many challenges get marked as duplicates on this stack. Most I see as fair, some, not so much.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What qualifies as a duplicate question?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider challenges where:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Entries from &lt;code&gt;a&lt;/code&gt; will be valid for &lt;code&gt;b&lt;/code&gt; , and entries from &lt;code&gt;b&lt;/code&gt; will be valid for &lt;code&gt;a&lt;/code&gt;  &lt;/li&gt;&#xA;&lt;li&gt;Entries from &lt;code&gt;a&lt;/code&gt; will be valid for &lt;code&gt;b&lt;/code&gt; , but entries from &lt;code&gt;b&lt;/code&gt; are &lt;strong&gt;not&lt;/strong&gt; valid for &lt;code&gt;a&lt;/code&gt; &lt;/li&gt;&#xA;&lt;li&gt;Entries from &lt;code&gt;a&lt;/code&gt; will &lt;strong&gt;not&lt;/strong&gt; be valid for &lt;code&gt;b&lt;/code&gt;, but the challenges are similar in structure and rules.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="60951" LastActivityDate="2016-12-09T22:02:12.470" Title="What IS a duplicate?" Tags="|discussion|" AnswerCount="0" CommentCount="1" ClosedDate="2016-12-10T17:50:58.860" ContentLicense="CC BY-SA 3.0" />
  <row Id="10860" PostTypeId="2" ParentId="2140" CreationDate="2016-12-09T22:06:41.030" Score="-2" Body="&lt;h1&gt;Convenient Palindromic quine golf, Cops &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;This is the cops thread, the robber's thread is &lt;a href=&quot;http://example.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;here.&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Cop's Challenge&lt;/h2&gt;&#xA;&lt;p&gt;A program is &lt;em&gt;conveniently palindromic&lt;/em&gt; if&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;it is equal to the string derived when its reverse has all its parentheses (&lt;code&gt;()&lt;/code&gt;), brackets (&lt;code&gt;[]&lt;/code&gt;), and braces (&lt;code&gt;{}&lt;/code&gt;) flipped. No other characters are special and require flipping. (&lt;code&gt;&amp;lt;&amp;gt;&lt;/code&gt; are sometimes paired but often not so they are left out.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;copied from this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/28190/convenient-palindrome-checker&quot;&gt;challenge&lt;/a&gt;.&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Write a conveniently palindromic program that prints its own source. This is the robber's goal:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Remove byte(s) from the cop's program so that the resulting program:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;prints the original source, or&lt;/li&gt;&#xA;&lt;li&gt;prints the new modified source&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Resulting program need not be a convenient palindrome&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;A counterexample&lt;/h2&gt;&#xA;&lt;h3&gt;JavaScript&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;(function $(){console.log('('+$+'())')}())//((){('(()'+$+')')gol.elosnoc}()$ niotcnuf)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;is easily cracked because the robber can remove all the characters past the comment and it will still print its own source.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Program must be longer than one character&lt;/li&gt;&#xA;&lt;li&gt;No reading from a file or grabbing from an external resource&lt;/li&gt;&#xA;&lt;li&gt;Submissions that aren't cracked for 7 days are marked as &amp;quot;safe&amp;quot;, and cannot be cracked anymore&lt;/li&gt;&#xA;&lt;li&gt;Cop's submissions after XX/XX/XX are non-competing (can be pushed back depending on popularity), so there are still robbers around to crack it&lt;/li&gt;&#xA;&lt;li&gt;The shortest safe solution in bytes wins.&lt;/li&gt;&#xA;&lt;li&gt;Robbers won't have a chosen winner&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;" OwnerUserId="41088" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-15T17:29:12.993" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10861" PostTypeId="1" AcceptedAnswerId="10862" CreationDate="2016-12-09T22:24:18.053" Score="5" ViewCount="212" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;Sandbox for Proposed Challenges&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That is the current sandbox. It is getting old and a lot of pages. Should a high ranking user make a new post for sandbox?&#xA;The old sandbox is getting kinda clunky. With over 40 pages of posts it takes longer to load, and is getting bulky. With a new one we can experience the joy of starting fresh. &lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2016-12-09T23:29:07.897" Title="A new sandbox as the other one is 2 years old" Tags="|discussion|" AnswerCount="1" CommentCount="10" ClosedDate="2016-12-10T03:10:01.407" ContentLicense="CC BY-SA 3.0" />
  <row Id="10862" PostTypeId="2" ParentId="10861" CreationDate="2016-12-09T23:29:07.897" Score="4" Body="&lt;p&gt;So the answer is no. Just clean up your post!&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastActivityDate="2016-12-09T23:29:07.897" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10866" PostTypeId="1" CreationDate="2016-12-10T18:12:22.750" Score="2" ViewCount="204" Body="&lt;p&gt;I've been considering answering a question in &lt;a href=&quot;http://esolangs.org/wiki/Super_Stack!&quot; rel=&quot;nofollow noreferrer&quot;&gt;Super Stack!&lt;/a&gt;, specifically via use of &lt;a href=&quot;http://esolangs.org/wiki/User:Orange/Super_Stack!/v2&quot; rel=&quot;nofollow noreferrer&quot;&gt;this interpreter&lt;/a&gt;. However, the interpreter fails to compile, because there are two mistakes in it:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;it's incorrectly escaped (the &lt;code&gt;''&lt;/code&gt; in the interpreter source code is interpreted as italics in the markup dialect in use rather than as an empty string);&lt;/li&gt;&#xA;&lt;li&gt;the routine for printing usage information (in response to invalid command line arguments) contains a typo, leaving off the trailing &lt;code&gt;'&lt;/code&gt; of a string, which of course prevents the program compiling.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;As such, in order to be able to use the language, I need to correct the problems in the interpreter. The first problem is arguably not a big deal, because it's possible to look at the source code used to generate the markup and copy from there, instead; it's a problem with an entirely mechanical fix. However, the second problem is a bit larger, given that it requires changing the interpreter to run programs in it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this case, the change is completely obvious (add a &lt;code&gt;'&lt;/code&gt; at the end of the offending line), and clearly makes no changes to the languages semantics nor otherwise gives an advantage (other than being able to compete with the language at all). However, being able to modify interpreters without them counting as postdating the challenge is something that would clearly be exploitable if unrestricted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As such, I think we need a policy on what sorts of edits can be made to an interpreter after a question is posted, whilst still allowing answers made using the new version of the interpreter to count as competing. (It's already been established that you &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7832/62131&quot;&gt;can't edit the interpreter to make it match the specification&lt;/a&gt;, but the case in which the interpreter appears to have become corrupted while being placed online is a different issue.) So what should that policy be?&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-12-11T01:35:52.727" Title="How do you handle an existing interpreter that, due to typos, doesn't function at all?" Tags="|discussion|" AnswerCount="3" CommentCount="1" ClosedDate="2016-12-12T16:52:32.640" ContentLicense="CC BY-SA 3.0" />
  <row Id="10867" PostTypeId="2" ParentId="10866" CreationDate="2016-12-10T18:12:22.750" Score="0" Body="&lt;h1&gt;Bugs can be corrected if they prevent the interpreter from running at all&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If an interpreter crashes regardless of the input that it's given, it's acceptable to edit the interpreter in order to remove the crash. In order to prevent abuses, the edit must be the smallest possible edit in terms of &lt;a href=&quot;https://codegolf.stackexchange.com/q/67474/62131&quot;&gt;Levenshtein distance&lt;/a&gt; that enables the interpreter to run at least one program without crashing.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-12-10T18:12:22.750" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10868" PostTypeId="2" ParentId="10866" CreationDate="2016-12-10T19:25:37.810" Score="8" Body="&lt;h1&gt;All changes to the interpreter make the answer non-competing&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;That's the only policy that is consistent with our established consensus that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7833/12012&quot;&gt;the interpreter defines the language&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Specifications written in a natural language cannot possibly be as clear as a definition by code; code either does something or it does not. While an interpreter that crashes no matter what you do with it probably doesn't match the author's intentions, it still doesn't give us certainty what the interpreter was meant to do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The proposal to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10867/12012&quot;&gt;fix the interpreter with a minimal edit distance&lt;/a&gt; is:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Artificial. The shortest fix could be commenting out parts of or even the entire code. That's not very useful.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Difficult to verify. With a large enough interpreter, iterating over all changes with edit distance X or less won't be feasible.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Ill-defined. Several &quot;fixes&quot; will probably tie on the shortest edit distance.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Prone to abuse. The shortest edit distance could be &lt;em&gt;anything&lt;/em&gt;, related or not to what the interpreter &lt;em&gt;should&lt;/em&gt; do.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;That's a lot of issues to correct something that isn't an issue. Our current consensus is unambiguous. While it is annoying to have to mark an answer as non-competing because of a bug, it's also not a big deal.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-12-11T01:35:52.727" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10869" PostTypeId="5" CreationDate="2016-12-10T19:57:54.683" Score="0" Body="&lt;p&gt;Meta is the place for all questions about CGCC, CGCC Meta, CGCC chat and more. Use this tag on questions that are specifically about the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/&quot;&gt;meta site&lt;/a&gt; itself, such as&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt; reports about issues that specifically arise on meta, and not main&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/questions/tagged/discussion&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt; about aspects of the meta site&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/questions/tagged/support&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt; questions about the appropriate way to use meta&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt; for specific features wanted on meta and not on main&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="66833" LastEditorDisplayName="user62131" LastEditDate="2021-04-27T17:33:00.420" LastActivityDate="2021-04-27T17:33:00.420" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="10870" PostTypeId="4" CreationDate="2016-12-10T19:57:54.683" Score="0" Body="Questions and discussion related to CGCC Meta itself, not just CGCC. Questions with this tag should specifically relate to Meta and not to the main site" OwnerDisplayName="user62131" LastEditorUserId="66833" LastEditorDisplayName="user62131" LastEditDate="2021-04-27T17:33:00.420" LastActivityDate="2021-04-27T17:33:00.420" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="10871" PostTypeId="1" CreationDate="2016-12-10T20:23:53.277" Score="17" ViewCount="365" Body="&lt;p&gt;This is something that's been bothering me for a while, and is really impairing my use of the site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any competition needs rules in order to be fair, and this has been established repeatedly in Meta posts (e.g. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8130/62131&quot;&gt;this post&lt;/a&gt; talks about the need for objective winning criteria). It needs to be completely clear which answers are and aren't reasonable; because the goal is to maximise your score on the question according to some criterion, you need to know what corners you can cut, and what loopholes you an exploit, in order to achieve that. Not knowing whether a loophole is open means that it's impossible to determine the winner, as if a loophole is there, it's often correct to use it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thus, it would make sense that the same applied to the site as a whole (in terms of what questions are acceptable, what answers are acceptable, etc.). However, the site currently has no way to determine what its rules actually are! The closest it has is this Meta, but Meta has a question and answer format. This means that you can find the same question in multiple places, and get a different response each time. (A great example is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10421/62131&quot;&gt;this post&lt;/a&gt;, which links to several different posts on meta giving contradictory answers to the same question. It asks for a definitive answer. It has one. Unfortunately, that answer contradicts the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8094/62131&quot;&gt;list of standard loopholes&lt;/a&gt;, a much more widely seen post, so it's still unclear what the situation actually &lt;em&gt;is&lt;/em&gt;.) Additionally, often you can find the question you want on Meta, but it's not definitive which of the answers, if any, are official.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So the current situation on PPCG as to &quot;is something legal&quot; is very close to asking people to &quot;ask about the rules in the comments&quot;, which is apparently &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7780/62131&quot;&gt;very looked down upon here&lt;/a&gt;. Our rules aren't objective, but subjective; and which rule actually gets enforced depends on the understanding of the people enforcing it (which, due to Stack Exchange's decentralised moderation, is often random users of the community). This means that it's very unclear what rules loopholes are acceptable to use, and which ones aren't.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So my question here is: should PPCG's rules be subjective, with high-rep users enforcing them based on their own understanding of what they are or what they should be? (This is the current situation.) Should the rules for a question be decided entirely by the person setting the question? (This is probably not the current situation, but many low-rep/new users believe it is.) Or should they be objective? If they should be objective, we need to provide a method of determining what they are (i.e. having an official &quot;list of rules&quot; somewhere), as it's impossible to enforce objective rules without awareness of them.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-12-12T21:28:21.610" Title="Should PPCG have an official, objective, list of rules?" Tags="|discussion|meta|site-health|" AnswerCount="3" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10872" PostTypeId="2" ParentId="10871" CreationDate="2016-12-10T20:23:53.277" Score="3" Body="&lt;h1&gt;There should be a single entry point on Meta for determining the site rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Currently, many users tend to act as though the site has an objective list of rules, and enforce based on their understanding of them, and yet disagree as to what those rules actually are. This leads to ridiculous situations sometimes, such as close/reopen oscillations (if at least 8 users think a post should be closed, and at least 8 think it should be opened, it gets closed, then reopened, then closed, then reopened, under SE's voting system; the vote-to-close system only works if there are objective rules as to which posts are closeable).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Having objective rules would be advantageous because it means that people would not be required to guess at the rules before posting a question, meaning that the moderation burden would be lower (probably not that important), and people would be much less likely to get upset by moderation actions (much more important). Currently, the way that the site works – in which you're expected to optimize as far as you can on a question, but &lt;em&gt;also&lt;/em&gt; unclear about what the limits for doing that are – means that you're often &lt;em&gt;required&lt;/em&gt; to post a potentially rules-breaking post, because otherwise you risk being outgolfed by someone who breaks the rule that you thought existed, but turns out not to. This is a huge waste of time for everyone; the person posting the answer (or question, but it's usually an answer) spent their time for nothing, and the moderation itself (and any resulting arguments about it) wastes the time of moderators and high-rep users. And overall, everyone's spent a lot of time and effort and frustration to leave things back exactly where they started, which is the last thing you want when this is supposed to be a site about having fun.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The current situation on Meta is almost unusable, where you can ask a question, and by the &lt;em&gt;intended functionality of the site&lt;/em&gt; get ten different answers, none of which are definitive. If this site as a whole were a PPCG challenge, we'd have closed and deleted it long ago as &lt;em&gt;unclear what you're asking&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The best fix to this would be to have an explicit list of rules. As far as I can tell, the best way to deal with this via functionality which exists in SE would be to have a permanently featured question on Meta that lists what all the rules are. (It would probably be unwieldy to fit it into a single post, so most likely it would be best as a list of links to other posts, like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10145/62131&quot;&gt;this question&lt;/a&gt; is.) Alternatively, we could create a new &quot;red tag&quot; (along the lines of the current &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/faq&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq&lt;/a&gt;), such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/rules&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;rules&amp;#39;&quot; rel=&quot;tag&quot;&gt;rules&lt;/a&gt;, that definitively marked which Meta questions were binding. Because frequent rules changes would be problematic, and allowing the rules to change via &quot;normal community activity&quot; potentially even more problematic (as it would lead to subjectivity and inclarity in the rules), I think either way the list of rules should be only controllable via a specific set of users (likely diamond moderators, via locking the posts in question).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, it's also necessary to objectively know which of the answers to the question describes the rule! We could potentially edit the rule into the question itself (and lock it), but that goes against the way that SE &quot;normally does things&quot;. Alternatively, we could use the accepted answer mechanism to show what the rule was, but this would require a diamond moderator to own the question (to prevent the user who asked it changing the rules arbitrarily).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Changes to the rules would be handled the same way that feature requests are currently handled (via &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/feature-request&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt; or maybe &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/rule-request&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;rule-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;rule-request&lt;/a&gt;, and moderators responding with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/status-completed&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt; and friends). I feel that it's important that explicit action is required in order to update the list of rules (and maybe even an announcement about it).&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2016-12-10T20:23:53.277" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10873" PostTypeId="2" ParentId="10871" CreationDate="2016-12-10T20:54:17.540" Score="-4" Body="&lt;p&gt;I think the current situation is fine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While different users having different interpretations for the rules can be bad, it is good enough for most cases. When it isn't, the specific case can be brought to meta (such as the recent controversy over the showcase) and be discussed at length here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;/questions/tagged/specific-question&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;specific-question&amp;#39;&quot; rel=&quot;tag&quot;&gt;specific-question&lt;/a&gt; exists for a reason and possible changes to our &lt;a href=&quot;/questions/tagged/policy&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;policy&amp;#39;&quot; rel=&quot;tag&quot;&gt;policy&lt;/a&gt; can be made when the community makes a consensus. At the moment, our search functionality is quite difficult if you don't know what you're looking for but in most cases, there is a policy that can be applied already. &lt;/p&gt;&#xA;" OwnerUserId="32686" LastActivityDate="2016-12-10T20:54:17.540" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10874" PostTypeId="1" CreationDate="2016-12-10T21:22:12.357" Score="6" ViewCount="240" Body="&lt;p&gt;Back when I first posted a challenge, it was closed as unclear, on the basis that – despite having an objective victory condition – the victory condition allowed ties. After searching Meta, I can't find a rule about this anywhere, so I think it's about time to start a discussion on what is and isn't acceptable in terms of victory condition tiebreaks.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So my question is: a challenge with an objective victory condition that allows you to compare two entries to see which is better, what rules for tiebreaks are acceptable? Is it acceptable to have no tiebreak (and allow &quot;equally good&quot; submissions to tie for the win)? If there is a tiebreak, are there any restrictions on the sorts of tiebreak that should be allowed? In each case, why?&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-01-10T12:51:27.863" Title="Should the victory condition for a challenge always ensure that it has only a single winner?" Tags="|discussion|winning-criteria|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10875" PostTypeId="2" ParentId="10874" CreationDate="2016-12-10T21:22:12.357" Score="-5" Body="&lt;h1&gt;Challenges and their victory conditions should, as far as possible, give scope to improve any entry.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;When the objective victory condition rule &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8130/62131&quot;&gt;has been discussed in the past&lt;/a&gt;, the general consensus (and one that I agree with) is that the victory condition exists to drive creativity. If a challenge's requirements are &quot;do X&quot;, and not &quot;do X, but Y is better&quot;, there's no scope to do anything else once you've just done X. On the other hand, if it's possible to improve your entry, that motivates you to actually improve it, increasing the quality of the site. So a victory condition that makes improvement possible is really the heart of the &quot;objective victory condition&quot; rule, and the reason for the rule is more important than the rule itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As such, I think we should modify our rule for victory criteria as follows: &lt;strong&gt;a challenge should be designed so that, no matter what you've done for the challenge so far, it's always possible to do more, and to know what is required of you to do that&lt;/strong&gt;. In most challenges, this is equivalent to requiring an objective victory criterion, because without one, it's impossible to know how to improve.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This also means that the important factor isn't competing against other users; it's competing against yourself. The purpose of a victory condition isn't to tell whether user A's answer is better than user B's answer. It's to let user A improve themselves as much as possible, pushing themself as far as they want to. In other words, &lt;em&gt;ties between users&lt;/em&gt; are completely harmless; but &lt;em&gt;unimprovable answers&lt;/em&gt; are very dangerous, as they render the competition pointless from then on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I'd suggest that we change our list of off-topic reasons like this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Instead of &lt;em&gt;Questions without an &lt;strong&gt;objective primary winning criterion&lt;/strong&gt; are off-topic, as they make it impossible to indisputably decide which entry should win.&lt;/em&gt;,&lt;/li&gt;&#xA;&lt;li&gt;our rule (and off-topic reasoning) should be &lt;em&gt;Questions which can be given an answer &lt;strong&gt;that cannot objectively be improved on&lt;/strong&gt; are off-topic, as the posting of a &quot;perfect answer&quot; makes competition impossible.&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Implications of this:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Victory conditions with ties are acceptable, and should be encouraged in situations where no obvious tiebreak exists.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Sometimes in a challenge, there's a way to make a &quot;major improvement&quot; to the goal which requires creativity, and &quot;minor improvements&quot; on the tiebreak which don't really. If there's no tiebreak, then improving an answer needs to be a major improvement, and if that's the heart of the challenge, we want to be focusing effort on it. (See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5115/62131&quot;&gt;this question&lt;/a&gt; for more details about situations in which tiebreaks actively hurt the question.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&quot;Earliest submission&quot; is never viable as a tiebreak, and in particular, is inferior to having no tiebreak at all.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Once you've posted a submission, it's clearly physically impossible to post another submission earlier without a time machine. In other words, this is about as unimprovable as it gets for solutions that have already been posted, and as such discourages rather than encourages competition.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Before you've posted your answer, the tiebreak also has negative implications. Many of the challenges posted here are fairly easy (because the reputation system gives higher rewards for easier challenges, something that's impossible to do anything about without closing easy challenges on sight – something which would be a bad idea, as they're fun for new golfers to compete in – or getting diamond moderators to do a community wiki conversion or to delete the resulting reputation manually, which would be way too much work). As such, there's often an objectively right answer. A good example of a worthwhile tiebreak would be to encourage people to improve their posts via better descriptions, explanations, and the like (which is close to a guided &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;); we already have consensus that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/686/62131&quot;&gt;doing so is desirable&lt;/a&gt;. The FGITW tiebreak does the exact opposite of that, encouraging people to spend a minimum effort on their submission (and perhaps even posting it before it's properly tested), on the basis that spending any extra effort takes more time. And on easy challenges (note: I define &quot;easy&quot; as any challenge in which the shortest answer is to directly translate the words of the specification into Jelly :-P), the byte count is necessarily going to end up tied, so the tiebreak will control the actual victory. Note that the situation with no tiebreak would be better here, as it would remove any incentive to post a bad post simply to do better on the tiebreak.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-12-10T21:22:12.357" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10876" PostTypeId="2" ParentId="10866" CreationDate="2016-12-10T22:31:38.573" Score="0" Body="&lt;p&gt;Interpreters that don't work at all shouldn't be too common. It's likely either the interpreter isn't finished, so there won't be an easy fix anyway, or it did work but was broken for some reasons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In most cases, the interpreter doesn't work for reasons such as the grammer it is in has changed, or a library it has used was abandoned. We shouldn't force ourselves to install a lot of old softwares for that. We may just fix them in a way we think it should match the original behavior, unless someone proves otherwise.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In your case, if the interpreter worked if those problems are fixed, it's very likely a working interpreter has existed, but something happened when the author was posting it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As nobody would disagree about what the original interpreter was, we don't need to be too technical. But if it is unclear, and the unclear part may change the validity of your submission, it's better not to use it or to mark it non-competing, even if the fix is easy.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2016-12-10T22:31:38.573" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10877" PostTypeId="2" ParentId="10874" CreationDate="2016-12-10T23:18:46.353" Score="2" Body="&lt;p&gt;In most cases, yes. The submissions don't have to be perfect on those conditions if there isn't much competition, though. Having an unbeatable answer also doesn't mean the challenge is closed for new submissions, if they use new languages or approaches.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This isn't ideal for a challenge. But in many cases the asker didn't have an idea about how easy or difficult their challenge is, not to say how pointless it is if there isn't a tiebreaker, and when there will be an answer with the best possible score. The point is not to be a victory condition, but to be objective.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We don't really even need the implications of winning a challenge, as it doesn't seem to be a feature we like to begin with.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The asker could make exceptions for some very &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5737/25180&quot;&gt;special types&lt;/a&gt; of &lt;a href=&quot;https://codegolf.stackexchange.com/q/39993/25180&quot;&gt;challenges&lt;/a&gt;, if there is a valid reason.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-12-11T09:51:42.720" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10878" PostTypeId="2" ParentId="10874" CreationDate="2016-12-11T01:34:52.820" Score="-5" Body="&lt;h1&gt;The winning condition should always select exactly one winner, within reasonable limits&lt;/h1&gt;&#xA;&lt;p&gt;This is handled by the fact that, by default, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5098/45941&quot;&gt;the first submission to reach the tied score wins&lt;/a&gt;. Assuming that two submissions are not posted/edited at the exact same time to reach the exact same score (which is a reasonable assumption), there will always be exactly one winner under that rule.&lt;/p&gt;&#xA;&lt;p&gt;If for any reason it was impossible to choose exactly one winner, the winning criterion would fail to be objective, meaning it isn't allowed. Our site's scope is for challenges with exactly 1 winner, tips, and special-circumstance challenges with no winners (the showcase and catalogs).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-11T12:41:18.907" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10879" PostTypeId="2" ParentId="2140" CreationDate="2016-12-11T06:16:32.327" Score="0" Body="&lt;h1&gt;It's a prime time to metagolf! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Puzzprimes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A puzzprime is a puzzle in which you have to use primes to create a number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Say the number is 24 - one way to create 24 (using only primes) is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3*2*2*2 (eq. 1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Another way is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;5*7-11 (eq. 2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The &quot;efficiency&quot; of answers is calculated like so:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's say we take &lt;code&gt;eq. 1&lt;/code&gt;, which is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3*2*2*2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There are 3 operators in there, and the primes used are (in decreasing order of prime size) &lt;code&gt;1*3, 3*2&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We can convert this to a polynomial using the cardinals of each of the primes:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1*3, 3*2 -&amp;gt; x^2 + 3x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We replace &lt;code&gt;x&lt;/code&gt; with the amount of operators, and we get our final answer:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3^2 + 3*3 = 18 (eq. 1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For &lt;code&gt;eq. 2&lt;/code&gt;, the efficiency score is this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1*11 + 1*7 + 1*5 -&amp;gt; x^5 + x^4 + x^3&#xA;x = 2 (operators), 2^5 + 2^4 + 2^3 = 56&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The aim of a puzzprime is to score as low a score as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are allowed to use the following operators:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;basic mathematical operators (&lt;code&gt;+-*/&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;factorial (&lt;code&gt;!&lt;/code&gt;)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;only normal factorials.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;ceiling and floor (&lt;code&gt;c()&lt;/code&gt; and &lt;code&gt;f()&lt;/code&gt; respectively)&lt;/li&gt;&#xA;&lt;li&gt;square root (&lt;code&gt;s()&lt;/code&gt;)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;no square roots of negative numbers.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;concatenation (&lt;code&gt;2 3&lt;/code&gt; -&gt; &lt;code&gt;23&lt;/code&gt;)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;each concatenation counts as an operator: &lt;code&gt;2 3 4 -&amp;gt; 234&lt;/code&gt; is 2 operators.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to generate solutions for puzzprimes for the first 200 composite numbers above 100,000 - your final score will be the sum of all 200 scores for each number, and the lowest score wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specs and Rules:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must complete one puzzprime in 1 hour on a modern laptop.&lt;/li&gt;&#xA;&lt;li&gt;Your program must return the same value for a puzzprime every time the program is run.&lt;/li&gt;&#xA;&lt;li&gt;Your program must work for all puzzprimes, not just the test cases.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You must provide your answer in this format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{language}, {score}&#xA;{code}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(Provide your answer without braces)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;You are not allowed to hardcode any answers for the most optimal solution.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Meta:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the scoring system good enough?&lt;/li&gt;&#xA;&lt;li&gt;Any clarifications in the explanation? Is there anything I need to patch up?&lt;/li&gt;&#xA;&lt;li&gt;Is this a dupe?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="49561" LastEditDate="2016-12-11T10:55:00.560" LastActivityDate="2016-12-11T10:55:00.560" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10880" PostTypeId="2" ParentId="2140" CreationDate="2016-12-11T08:44:59.423" Score="0" Body="&lt;h1&gt;Start another process in a endless loop&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to start a process (no thread!) which doesn't end, but the main program mustn't end after starting the other process. You have accomplished the task, if I can see TWO processes of your program after executing it, waiting 5 secs, and then doing rather &quot;ps -aux&quot; or starting the Task Manager on Windows.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This will be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, the answer with the shortest code would win.&lt;/p&gt;&#xA;" OwnerUserId="53416" LastActivityDate="2016-12-11T08:44:59.423" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10882" PostTypeId="2" ParentId="2140" CreationDate="2016-12-11T13:31:25.050" Score="4" Body="&lt;h1&gt;Golf the truth and null values&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In many programming languages there is a null and/or other special values. Sometimes they don't follow the normal rules of boolean operations. They may not even agree with the values of the same name in other languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some different kinds of the &quot;extended&quot; boolean values, either borrowed from some languages or invented myself:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;F&lt;/code&gt;alse.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;T&lt;/code&gt;rue.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;A&lt;/code&gt;bsent. All operations between absent and another operand return the other operand.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;W&lt;/code&gt;hatever. All operations between whatever and another operand returns whatever (itself).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;P&lt;/code&gt;artial. If the result can be decided using the other operand, return that. Otherwise return partial (itself).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;E&lt;/code&gt;rror. An error as the first operand works like whatever, and an error as the second operand works like partial, except that &quot;itself&quot; means error. It has higher precedence than whatever and partial.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your task is to define all these values in your language, and the 2 operations &lt;code&gt;and&lt;/code&gt; &lt;code&gt;or&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To be clear, the 2 operations should work exactly as in the following tables. The left column represents the first operand, and the top row the second operand.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;and F T A W P E       or F T A W P E&#xA;  F F F F W F F        F F T F W P E&#xA;  T F T T W P E        T T T T W T T&#xA;  A F T A W P E        A F T A W P E&#xA;  W W W W W W W        W W W W W W W&#xA;  P F P P W P E        P P T P W P E&#xA;  E E E E E E E        E E E E E E E&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You could use anything &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10885/25180&quot;&gt;distinct and consistent&lt;/a&gt; to represent these values. You don't have to use a truthy value to represent true, or a falsy value to represent false. You are allowed and encouraged to use values that contain useful code, i.e. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14110/25180&quot;&gt;this loophole&lt;/a&gt; is not forbidden.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are allowed to use actual errors or exceptions to represent some of the values. In this case the definition of that value should throw the same error, instead of represent the caught error. But the caught errors or the output messages should be distinct and consistent. Alternatively, you may choose to include STDERR in the output of your code, and use the printed message string as a normal value.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may choose to pass functions generating and returning the values but doing nothing else to your code as input, in place of the values themselves, without counting the extra code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may use different ways of input/output for different values, as long as it is consistent for each kind of value, and it is possible to tell apart the first and the second operand.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are allowed to use builtin functions and operators without boilerplate, in any argument order, even if you cannot save them in something callable in your language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There could be some common code shared by all the 8 definitions and appear only once as header/footer. Other than that, the 8 definitions of operations and values must work independently from each other. The only way you can call something defined in the values in the operations is through a valid input method (e.g. you cannot set a variable in a value and read it in an operation).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your score is the length of common code * 12 + the total length of the 2 operations * 6 + the total length of the values. Smallest score wins. The length of a value is either the length of the code generating it, or the length of itself unquoted if all the values are strings and you choose this way.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Abandoned rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You are allowed to use operators, or chains of operators and values to represent the 2 operations, even if you cannot save them in something callable in your language. You may require the operands to appear at specific positions, but each operand must appear exactly once and be grouped together. You may choose whether to save operands in variables previously, and don't count the assignment if it doesn't add new information in the assignment (e.g. by changing its type). This makes it possible to use the built-in operators with short-circuit evaluation in languages that don't allow redefining them and preserve this characteristic, and may also make it shorter in some other languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Previous scoring: total length of the 2 operations * 50 + the total length of the values.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Possible follow-up&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Original title: All the weirdness about the nulls&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Extended tables including &lt;code&gt;V&lt;/code&gt;alid in a previous version, &lt;code&gt;R&lt;/code&gt;everse aka Opposite by Zgarb, and &lt;code&gt;P&lt;/code&gt;ossible.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;and T F N O W E V R P     or T F N O W E V R P&#xA;  T T F T O W E ? F T      T T T T T W T T T T&#xA;  F F F F F W F F F F      F T F F O W E ? T F&#xA;  N T F N O W E ? ? ?      N T F N O W E ? ? ?&#xA;  O O F O O W E ? O O      O T O O O W E ? O T&#xA;  W W W W W W W ? W W      W W W W W W W ? W W&#xA;  E E E E E E E ? E E      E E E E E E E ? E E&#xA;  V T F ? O F F ? ? ?      V T T ? T F F ? T ?&#xA;  R F F ? O W ? ? ? ?      R T T ? O W ? ? ? ?&#xA;  P T F ? O W ? ? ? ?      P T F ? T W ? ? ? ?&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Other potential additions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Default, that is opposite to Opposite.&lt;/li&gt;&#xA;&lt;li&gt;Merge Possible with Valid.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Sandbox questions&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Will this be too easy in some languages that already have all of them?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In languages that has True defined to be -1 and unifies bitwise and logical operations, most integers would works as &lt;code&gt;P&lt;/code&gt;artial. GCD/LCM in APL is similar to this. SQL null is &lt;del&gt;&lt;code&gt;W&lt;/code&gt;hatever&lt;/del&gt; &lt;code&gt;P&lt;/code&gt;artial. Most languages that has shortcut evaluation has errors as &lt;code&gt;E&lt;/code&gt;rror. Not sure about &lt;code&gt;A&lt;/code&gt;bsent, though.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Maybe the easiest way to find out is to post this question. It doesn't make the answer bad. But it's just some consideration in the sandbox for me to decide whether I'll post a stronger version.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Allowing &quot;operators and chains of operators&quot; seems to open a can of worms. Should I just remove this rule?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="25180" LastEditDate="2019-07-11T01:14:53.603" LastActivityDate="2019-07-11T01:14:53.603" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="10884" PostTypeId="2" ParentId="2140" CreationDate="2016-12-11T18:56:46.227" Score="1" Body="&lt;h1&gt;Generate the Collatz series&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;algorithm&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The Task&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write a function which, when passed some positive integer &lt;code&gt;n&lt;/code&gt;, returns a list or array containing the Collatz sequence up to the &lt;code&gt;n&lt;/code&gt;th member, one-indexed.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Definition&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;n&lt;/code&gt;th member of the Collatz sequence is defined as the number of recursions through &lt;code&gt;f(n)&lt;/code&gt; when passed an initial input &lt;code&gt;n&lt;/code&gt; before the value returned is 1. &lt;code&gt;f(n)&lt;/code&gt; is defined as:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/vDHS5.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/vDHS5.png&quot; alt=&quot;func&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Let &lt;code&gt;g(x)&lt;/code&gt; be the function described in the task:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt; g(8)&#xA;[0, 1, 7, 2, 5, 8, 16, 3]&#xA;&#xA;&amp;gt;&amp;gt;&amp;gt; g(16)&#xA;[0, 1, 7, 2, 5, 8, 16, 3, 19, 6, 14, 9, 9, 17, 17, 4]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;More examples may be found in &lt;a href=&quot;https://oeis.org/A006577&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS entry A006577&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may make any optimizations you wish, provided that no hard-coding of values is involved nor any form of builtin directly related to the Collatz series.&lt;/li&gt;&#xA;&lt;li&gt;You must directly state the algorithm used to compute the series, then show how the algorithm is implemented and used by your code. If your algorithm can be disproved, then your answer is invalid.&lt;/li&gt;&#xA;&lt;li&gt;Your function must be able to theoretically compute any Collatz sequence up to any input 20e6 or below.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your score is determined by the amount of time for the function or program to process input &lt;code&gt;20000000&lt;/code&gt; (20e6), where shortest time wins! All code will be tested in &lt;a href=&quot;https://ide.c9.io/vtcakavsmoace/collatz-conjecture-testing&quot; rel=&quot;nofollow noreferrer&quot;&gt;this workspace&lt;/a&gt;, which is a x86_64 machine running Ubuntu 14.04.3 LTS.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="44713" LastEditDate="2016-12-14T20:00:48.313" LastActivityDate="2016-12-14T20:00:48.313" CommentCount="36" ContentLicense="CC BY-SA 3.0" />
  <row Id="10885" PostTypeId="1" AcceptedAnswerId="10887" CreationDate="2016-12-11T20:37:25.110" Score="4" ViewCount="212" Body="&lt;p&gt;There are some questions requiring distinct and consistent output. It's obvious what they mean for submissions printing to stdout. But how does that apply to the return values of functions?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, in Python, if a function always returns &lt;code&gt;1&lt;/code&gt; for one case and &lt;code&gt;&quot;a&quot;&lt;/code&gt; for another, we could say they are distinct and consistent. But what if it returned &lt;code&gt;lambda:1&lt;/code&gt;? The problem is, &lt;code&gt;(lambda:1) == (lambda:1)&lt;/code&gt; is false. And their string representations could change if run again.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If that shouldn't be acceptable, it would be difficult to justify how non-constant, non-static C strings are consistent, as they are technically pointers which may have different values even if the strings are the same.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If that should be acceptable, how should it be defined exactly? Someone could think it's a good idea to create two instances of a class to represent two different results. But in other cases, someone may prefer generating even the classes on the fly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we have a standard for all cases or make it flexible? And what would be acceptable exactly?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we use the simple approach to allow writing their own comparison functions, it would leave a loophole that they simply return the input and do everything in the comparison function.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2016-12-13T10:31:14.307" Title="What counts as distinct and consistent?" Tags="|discussion|specification|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10887" PostTypeId="2" ParentId="10885" CreationDate="2016-12-12T02:10:00.413" Score="9" Body="&lt;p&gt;Outputs are consistent if they are equal in the sanest and most obvious way of comparing them. For example, if you have two &lt;code&gt;char *&lt;/code&gt; strings in C or C++, and you try&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a == b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;you will get a falsy value even if the strings are equal. But every half-decent C programmer knows that you don't compare strings with &lt;code&gt;==&lt;/code&gt;. That's the reason &lt;a href=&quot;https://stackoverflow.com/q/14232990/3524982&quot;&gt;this SO question&lt;/a&gt; has almost 50,000 views at the time I'm writing this answer. Your python example is similar. For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(lambda: 1) == (lambda: 1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;is false. And comparing lambda functions by their string representation is &lt;a href=&quot;https://tio.run/nexus/python2#@19QlJlXolBcUqSRk5iblJJopWCoyYUpqOSRmpOTr4RNCsjGJozJMNTU1Pz/HwA&quot; rel=&quot;nofollow noreferrer&quot;&gt;completely nonsensical&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;But it's still perfectly obvious that the two values are conceptually the same. They're both unnamed functions that return one. In fact, there's even a sane way to compare them. For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(lambda: 1)() == (lambda: 1)()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Now to be fair, this is a pretty flexible/laissez faire approach. It's pretty close to an &lt;a href=&quot;https://en.wikipedia.org/wiki/I_know_it_when_I_see_it&quot; rel=&quot;nofollow noreferrer&quot;&gt;&amp;quot;I know it when I see it&amp;quot;&lt;/a&gt; policy. But that's because this is mostly an edge case. I'm not aware of any cases where this little detail happens to matter, and I can barely think of any hypothetical cases where it would.&lt;/p&gt;&#xA;&lt;p&gt;But if this wasn't accepted by default that you can choose the most obvious way of comparing return values, I can imagine pointless arguing like:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Well sure, &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; happen to have the same &lt;em&gt;values&lt;/em&gt; in them. But so what? They're not in the same &lt;em&gt;location&lt;/em&gt;!&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(&amp;amp;a) == (&amp;amp;b)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;is false, so &lt;em&gt;technically&lt;/em&gt; you failed all of the test-cases.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;which is clearly ridiculous.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-12T17:20:58.160" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="10888" PostTypeId="2" ParentId="2140" CreationDate="2016-12-12T04:50:22.650" Score="0" Body="&lt;p&gt;Create a script that, when run from a console, will display the text already in the console, prior to running.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How will the winner of the challenge will be determined?&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The golf with the shortest length (in bytes) will win. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input:&#xA;(Shown is Windows)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Microsoft Windows [Version 10.0.14393]&#xA;(c) 2016 Microsoft Corporation. All rights reserved.&#xA;&#xA;C:\Users\CSS&amp;gt;dir&#xA; Volume in drive C has no label.&#xA; Volume Serial Number is B0A1-E768&#xA;&#xA; Directory of C:\Users\CSS&#xA;&#xA;11/30/2016  07:18 PM    &amp;lt;DIR&amp;gt;          .&#xA;11/30/2016  07:18 PM    &amp;lt;DIR&amp;gt;          ..&#xA;12/01/2016  04:45 PM    &amp;lt;DIR&amp;gt;          .android&#xA;10/25/2016  12:41 PM    &amp;lt;DIR&amp;gt;          .atom&#xA;11/29/2016  05:52 PM    &amp;lt;DIR&amp;gt;          .dnx&#xA;10/27/2016  09:34 PM               148 .gitconfig&#xA;11/28/2016  03:02 PM    &amp;lt;DIR&amp;gt;          .MemuHyperv&#xA;11/29/2016  05:55 PM    &amp;lt;DIR&amp;gt;          .nuget&#xA;12/01/2016  04:42 PM    &amp;lt;DIR&amp;gt;          .oracle_jre_usage&#xA;10/26/2016  11:37 PM    &amp;lt;DIR&amp;gt;          .ssh&#xA;12/04/2016  06:20 PM    &amp;lt;DIR&amp;gt;          .VirtualBox&#xA;11/29/2016  12:56 PM    &amp;lt;DIR&amp;gt;          .vscode&#xA;11/28/2016  03:53 PM             8,528 2016-11-28-20-44-28.000-VBoxSVC.exe-2608.log&#xA;11/28/2016  05:09 PM    &amp;lt;DIR&amp;gt;          Andy&#xA;11/23/2016  10:01 AM    &amp;lt;DIR&amp;gt;          Contacts&#xA;12/11/2016  11:16 PM    &amp;lt;DIR&amp;gt;          Desktop&#xA;11/30/2016  07:35 PM    &amp;lt;DIR&amp;gt;          Documents&#xA;12/11/2016  01:43 AM    &amp;lt;DIR&amp;gt;          Downloads&#xA;11/23/2016  10:01 AM    &amp;lt;DIR&amp;gt;          Favorites&#xA;11/22/2016  07:23 PM               409 fciv.err&#xA;11/22/2016  07:21 PM               266 hi&#xA;11/23/2016  10:01 AM    &amp;lt;DIR&amp;gt;          Links&#xA;11/22/2016  04:28 PM                15 me.txt&#xA;11/28/2016  03:08 PM    &amp;lt;DIR&amp;gt;          Music&#xA;10/25/2016  12:44 AM    &amp;lt;DIR&amp;gt;          OneDrive&#xA;12/09/2016  05:57 PM    &amp;lt;DIR&amp;gt;          Pictures&#xA;11/23/2016  10:01 AM    &amp;lt;DIR&amp;gt;          Saved Games&#xA;11/24/2016  08:56 PM               151 search.bat&#xA;11/23/2016  10:01 AM    &amp;lt;DIR&amp;gt;          Searches&#xA;11/07/2016  11:00 AM                11 t.bat&#xA;11/24/2016  08:55 PM                93 update.bat&#xA;11/28/2016  03:08 PM    &amp;lt;DIR&amp;gt;          Videos&#xA;               8 File(s)          9,621 bytes&#xA;              24 Dir(s)  152,887,300,096 bytes free&#xA;&#xA;C:\Users\CSS&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The script must display something like the text above, in the sense that it must display exactly what was in the console before the script was called.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="63196" LastActivityDate="2016-12-12T04:50:22.650" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10891" PostTypeId="2" ParentId="10871" CreationDate="2016-12-12T21:28:21.610" Score="6" Body="&lt;h2&gt;This is impossible&lt;/h2&gt;&#xA;&lt;p&gt;While I think your desire for an easy, definitive list of rules is understandable, this seems impossible to me. Some reasons why:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules change frequently&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;new languages / new scoring methods&lt;/li&gt;&#xA;&lt;li&gt;new loopholes to be prevented&lt;/li&gt;&#xA;&lt;li&gt;regulating new challenge types&lt;/li&gt;&#xA;&lt;li&gt;changing opinions and consensus&lt;/li&gt;&#xA;&lt;li&gt;ideas that have never been brought up before&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;PPCG is dynamic&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Due to the nature of our site (not a QA site), there is not really a &lt;em&gt;fixed&lt;/em&gt; set of rules we can govern by and set as standard for all time. It's not just the rules, though. The very essence of PPCG changes over time with the languages, the challenges, and the users spending their time here.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;There will always be a learning curve&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Again, this is not a QA site. Assimilating oneself into the culture of PPCG will never be as simple as reading a single page of information, whether it be:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;getting to know the mods and other users&lt;/li&gt;&#xA;&lt;li&gt;learning golfing languages and tactics&lt;/li&gt;&#xA;&lt;li&gt;being active in chat and the community&lt;/li&gt;&#xA;&lt;li&gt;understanding our memes and references&lt;/li&gt;&#xA;&lt;li&gt;learning the rules&lt;/li&gt;&#xA;&lt;li&gt;finding out what challenges have been done before&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Summary&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;In conclusion, you have every right to want an easy list, and I want it too, but the overall structure and purpose of PPCG prevents this. PPCG will always be a dynamic and fluid community that conforms to the ever-changing culture and will of its users in order to be something &lt;em&gt;more&lt;/em&gt; than a QA site.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-12T21:28:21.610" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10892" PostTypeId="2" ParentId="10885" CreationDate="2016-12-13T00:05:39.607" Score="2" Body="&lt;h1&gt;For a result to be consistent, it must belong to a type that's comparable&lt;/h1&gt;&#xA;&#xA;&#xA;&#xA;&lt;p&gt;Integers are possible to compare consistently. Strings are possible to compare consistently (you can do it character by character). In general, anything that can be represented as a simple recursive data structure (think a Lisp list) can be compared simply via iterating over it recursively. These are known as comparable types; languages with particularly advanced type systems often have an interface, typeclass, or equivalent that marks the type as possible to compare. For example, Haskell has &lt;code&gt;Eq&lt;/code&gt;. (Note that the comparison is typically not done with &lt;code&gt;==&lt;/code&gt; or the equivalent, but rather requires a function to compare; in Java, strings (and every other reference type, for that matter) are compared with &lt;code&gt;.equals()&lt;/code&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although the majority of types are comparable (PPCG problems normally use strings, integers, and lists of other types that are used), there are some types that inherently aren't. Most notably, functions are mathematically impossible to compare, at least in a Turing-complete language. Languages with strong enough type systems are aware of this. Here's what happens if I try the example in the OP in Haskell:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Prelude&amp;gt; (\() -&amp;gt; 1 :: Integer) == (\() -&amp;gt; 1 :: Integer)&#xA;&#xA;&amp;lt;interactive&amp;gt;:8:23:&#xA;    No instance for (Eq (() -&amp;gt; Integer))&#xA;      (maybe you haven't applied enough arguments to a function?)&#xA;      arising from a use of ‘==’&#xA;    In the expression: (\ () -&amp;gt; 1 :: Integer) == (\ () -&amp;gt; 1 :: Integer)&#xA;    In an equation for ‘it’:&#xA;        it = (\ () -&amp;gt; 1 :: Integer) == (\ () -&amp;gt; 1 :: Integer)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So, if an answer belongs to a comparable type, we can determine if it's consistent by comparing all the output values to see if they're equal. If it doesn't, I suspect it can't be consistent by definition.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that in some cases, an output may be consistent in a less powerful language even though it's inconsistent in a more powerful language; for example, a language in which all functions are deterministic and always terminate, and in which all base types had finitely many values, would make it possible to compare first-order functions by verifying that they had the same behaviour for all possible arguments (something that can't be done in general because you can't compare the nontermination behaviour of functions due to the halting problem).&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorDisplayName="user62131" LastEditDate="2016-12-13T10:31:14.307" LastActivityDate="2016-12-13T10:31:14.307" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10893" PostTypeId="1" CreationDate="2016-12-13T00:38:51.913" Score="14" ViewCount="441" Body="&lt;p&gt;Solderless-Breadboards are very common to make and build electrical prototypes typically, they consist of rows, and each row has 5 holes. There are 2 columns of rows on a standard breadboard. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I want to introduce a new possible challenge. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/breadboard-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;breadboard-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;breadboard-golf&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why should we allow these challenges?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's a very simple step in golfing, and is very similar to our current challenges. It has Inputs, outputs, a general set of rules, and an easy scoring method.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;For example, take the challenge:&lt;/strong&gt;  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Create a full-bridge rectifier.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: 240V AC&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: 180V DC, with ideally no noise&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rules: No loose ends, all contacts must be tied.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;A possible answer could be:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Diode Rectifier: 4 spaces.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/MlR9x.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/MlR9x.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&#xA;&lt;sup&gt;as mentioned by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/62436/wyldstallyns&quot;&gt;WyldStallyns&lt;/a&gt;, this image is courtesy of &lt;a href=&quot;http://Circuits.io/Lab&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://circuits.io/lab&lt;/a&gt; &lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As you can see, the recifier has I/O slots, and satisfies the challenge with the breadboard platform. There are other ways to golf the rectifier down to 2 rows.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would appreciate any and all input on thoughts to this type of challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Adendum1:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's been brought to my attention that using 'ideally' isn't a business plan. I agree. For any challenge, the legitimacy of any competitor would be determined with a standard &lt;a href=&quot;https://en.wikipedia.org/wiki/SPICE&quot; rel=&quot;nofollow noreferrer&quot;&gt;SPICE simulator&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Adendum 2:&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This seems to have been received well. I will be posting a challenge to the sandbox for review. If you do not see a link to the challenge, i have not posted it, yet. This challenge will outline, in detail, the specific rules of a beadboard golf, as well as rules for the challenge itself. If that challenge is well received, then i shall post it to the stack as a trial question for real answers! If all goes according to plan, we'll see the challenge go live on december 26th.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Adendum 3:&lt;/strong&gt;&lt;br&gt;&#xA;I've posted a new challenge &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10903/60951&quot;&gt;here&lt;/a&gt;. I eagerly await critiques. If the challenge has a positive score on December 26th, I shall post it onto the site.&lt;/p&gt;&#xA;" OwnerUserId="60951" LastEditorUserId="56656" LastEditDate="2021-05-13T22:25:15.817" LastActivityDate="2021-05-13T22:25:15.817" Title="breadboard challenges?" Tags="|discussion|" AnswerCount="3" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="10895" PostTypeId="2" ParentId="2140" CreationDate="2016-12-13T04:34:44.247" Score="0" Body="&lt;h1&gt;Transpile Brainfuck&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://esolangs.org/wiki/brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brainfuck&lt;/a&gt; is a very basic esolang with only 8 commands, please visit the esolangs link if you do not know the language's specification. Your job will be to transpile brainfuck into your language.&lt;/p&gt;&#xA;&lt;p&gt;For input, your code will recieve a string of brainfuck. You can assume that all &lt;code&gt;[&lt;/code&gt; and &lt;code&gt;]&lt;/code&gt; will be matched properly, but the code may contain nops (characters not part of the spec).&lt;/p&gt;&#xA;&lt;p&gt;Output should be a program written in the same language as &lt;em&gt;your&lt;/em&gt; program which is functionally identicall to the passed brainfuck program.&lt;/p&gt;&#xA;&lt;p&gt;Your brainfuck implementation should have 300000, and support integers from 0 to 127. Going off the tape should wrap to the other side, and going over 127/below 0 shoudl overflow or underflow. The generated program should generate no errors. Outputting a cell with &lt;code&gt;.&lt;/code&gt; should output that number's character in ASCII, not the decimal representation of that number.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so fewest bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="60042" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-13T04:34:44.247" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10896" PostTypeId="2" ParentId="2140" CreationDate="2016-12-13T10:18:20.807" Score="0" Body="&lt;h1&gt;Addmod, Mulmod, Powmod&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Addmod&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Imagine defining the &lt;a href=&quot;https://en.wikipedia.org/wiki/Modulo_operation&quot; rel=&quot;nofollow noreferrer&quot;&gt;modulo operation&lt;/a&gt; in terms of repeated addition or subtraction, so that &lt;em&gt;a&lt;/em&gt; mod &lt;em&gt;b&lt;/em&gt; is found by starting with &lt;em&gt;a&lt;/em&gt; and repeatedly adding or subtracting &lt;em&gt;b&lt;/em&gt; until the answer is in the range [0, &lt;em&gt;b&lt;/em&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Call this operation addmod (which is equivalent to just mod), and similarly define mulmod and powmod, where the definitions are the same apart from replacing &quot;addition or subtraction&quot; with &quot;multiplication or division&quot; and &quot;raising to the &lt;em&gt;b&lt;/em&gt;&lt;sup&gt;th&lt;/sup&gt; power or taking the &lt;em&gt;b&lt;/em&gt;&lt;sup&gt;th&lt;/sup&gt; root&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Mulmod&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;a&lt;/em&gt; mulmod &lt;em&gt;b&lt;/em&gt; is found by starting with &lt;em&gt;a&lt;/em&gt; and repeatedly multiplying or dividing by &lt;em&gt;b&lt;/em&gt; until the answer is in the range [1, &lt;em&gt;b&lt;/em&gt;). Note the range here is not [0, &lt;em&gt;b&lt;/em&gt;) as that would allow multiplying or dividing a number within the range without leaving the range.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Powmod&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;a&lt;/em&gt; powmod &lt;em&gt;b&lt;/em&gt; is found by starting with &lt;em&gt;a&lt;/em&gt; and repeatedly raising to the power of &lt;em&gt;b&lt;/em&gt; or 1/&lt;em&gt;b&lt;/em&gt; until the answer is in the range ( &lt;strong&gt;&lt;em&gt;um, I'll think about this&lt;/em&gt;&lt;/strong&gt; ).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For powers that give more than one result, always take the one that is positive and real.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There are three input values:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&quot;Dividend&quot; (&lt;em&gt;a&lt;/em&gt; in &quot;&lt;em&gt;a&lt;/em&gt; mod &lt;em&gt;b&lt;/em&gt;&quot;).&lt;/li&gt;&#xA;&lt;li&gt;&quot;Divisor&quot; (&lt;em&gt;b&lt;/em&gt; in &quot;&lt;em&gt;a&lt;/em&gt; mod &lt;em&gt;b&lt;/em&gt;&quot;).&lt;/li&gt;&#xA;&lt;li&gt;Function indicator. This can be one of:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;0 for addmod, 1 for mulmod, 2 for powmod.&lt;/li&gt;&#xA;&lt;li&gt;1 for addmod, 2 for mulmod, 3 for powmod.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Here &quot;number&quot; is not necessarily a base 10 representation, but must support non-integer input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may take the inputs in any defined order, or as a container holding them in any defined order.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input ranges&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;addmod: &lt;em&gt;a&lt;/em&gt; is in (-65536, 65536), &lt;em&gt;b&lt;/em&gt; is in (0, 65536).&lt;/li&gt;&#xA;&lt;li&gt;mulmod: &lt;em&gt;a&lt;/em&gt; is in [0, 65536), &lt;em&gt;b&lt;/em&gt; is in (1, 65536).&lt;/li&gt;&#xA;&lt;li&gt;powmod: &lt;em&gt;a&lt;/em&gt; is in (0, 65536), &lt;em&gt;b&lt;/em&gt; is in (1, 65536).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Where [ and ] are inclusive, and ( and ) are exclusive.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A number corresponding to &lt;em&gt;a&lt;/em&gt; mod &lt;em&gt;b&lt;/em&gt; using the appropriate variation of mod (addmod, mulmod or powmod).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;[ To be added ]&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Graphs?&lt;/h1&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2016-12-13T14:35:09.580" LastActivityDate="2016-12-13T14:35:09.580" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10898" PostTypeId="2" ParentId="2140" CreationDate="2016-12-13T11:18:40.083" Score="0" Body="&lt;p&gt;In an effort to improve things, I have split this challenge into two parts, both currently listed in this question for the sake of keeping them together.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;NOTE: &quot;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/113290/run-a-game-of-flood&quot;&gt;Run a game of Flood&lt;/a&gt;&quot; has now been posted.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Solve a game of Flood&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a Code Challenge with Code Golf aspects.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.chiark.greenend.org.uk/~sgtatham/puzzles/js/flood.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Flood&lt;/a&gt; is a game in which the player is presented with a game board such as this:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/RWaO2m.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/RWaO2m.png&quot; alt=&quot;Initial Game Board&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On each turn, you choose a colour (on the link above, by clicking a square containing that colour), and the cell in the top-left corner is filled with that colour - this colour will absorb all adjacent cells with the same colour. So, for example, the first turn might be Blue, which will cause the yellow cell in the top corner to turn blue, and merge with the existing blue cell. The next turn might be Purple, which will fill both of the first two cells purple, merging them with the two-cell purple area attached to them. Then you might go Red, then Orange. With this sequence, the board will end up as:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/hMfVFm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/hMfVFm.png&quot; alt=&quot;After going Blue, Purple, Red, Orange&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to write code that acts as a &quot;solver&quot; program/code, which reads in the initial/current state of the board, and determines the next move or the remaining moves. This code should make an effort to produce an efficient path to the solution, but you must balance this search for efficiency with the golfing effort.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code may make use of a simulator code (such as may be used in the &quot;Run a game of Flood&quot; challenge) that takes input of the current state of the board and a sequence of moves, and outputs the resulting state of the board after these moves - these must be the only inputs/outputs used by your code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code must produce a solution for any initial board (not just the test boards, see below), and must be deterministic - that is, it must produce the same solution every time the same initial board is input (fixed-seed pseudorandom numbers are acceptable).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As noted above, this is a combination Code Golf challenge. Your goal is to minimise your score, much of which is determined by the length of your code in bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your final score is &lt;code&gt;b+2sum(n_i)+sum(d_i)&lt;/code&gt;, where &lt;code&gt;b&lt;/code&gt; is the total bytes of your code (simulator code does not count towards this value, but the call to simulator code &lt;em&gt;does&lt;/em&gt;), &lt;code&gt;n_i&lt;/code&gt; is the number of steps used by your solver program to solve each of the test boards (see below), and &lt;code&gt;d_i&lt;/code&gt; is the maximal depth to which your code searches for each of the test boards before selecting a step.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;d_i&lt;/code&gt; value, here, is intended to punish those who use brute force to find the optimal solution. You need to find efficient solutions, cheaply.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules and Assumptions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard Loopholes&lt;/a&gt; are forbidden.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code must be able to handle non-square boards, with each dimension being anywhere between 6 and 30 cells (more is fine, it must handle this range). It must be able to handle between 3 and 9 distinct colours or &quot;colour&quot; labels (numbers are fine).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may assume that input is in simplest form - that is, if there are four colours, they will be labelled 1-4, or a-d, or any other similar system as appropriate. You will not need to handle situations such as incorrect inputs, unsimplified inputs (you won't have the numbers 1, 3, 6, and 9, without the others in between, unless it suits your code).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code may take input indicating details of the board such as dimensions and the set of valid &quot;colours&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your answer should include a description of formats, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code cannot treat the test boards as special cases - that is, you cannot have the code detect which test board it is, and if it doesn't match a test board, use a generic, low-quality code for solving.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Request&lt;/strong&gt;: If you believe you have identified a non-standard loophole, and it's definitely a loophole and not in the spirit of the question, please comment to have the loophole closed, rather than posting an answer using it. This is not a rule, &lt;em&gt;per se&lt;/em&gt;, but an effort to keep the challenge interesting.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Boards&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;7x6, 6 colours&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/VciXEm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/VciXEm.png&quot; alt=&quot;Board 1&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;12x12, 6 colours&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/p9rh3m.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/p9rh3m.png&quot; alt=&quot;Board 2&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;12x12, 3 colours&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/C4Cobm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/C4Cobm.png&quot; alt=&quot;Board 3&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;16x16, 9 colours&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ZnoHSm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZnoHSm.png&quot; alt=&quot;Board 4&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Tags: Code-Challenge, Code-Golf, Optimization, Game&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Not sure whether this should be labelled as Code-Challenge, Code-Golf, or both&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="21439" LastEditorUserId="21439" LastEditDate="2017-03-20T04:24:18.727" LastActivityDate="2017-03-20T04:24:18.727" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10901" PostTypeId="2" ParentId="2140" CreationDate="2016-12-13T21:40:05.867" Score="0" Body="&lt;h2&gt;&lt;em&gt;Graph&lt;/em&gt;ical Stars&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Meta: this is currently pretty rough so I could get some ideas down quick. I'm also probably not using the right terminology as I'm not very familiar with graphs and graph theory. Looking for feedback.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/VVRQN.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/VVRQN.jpg&quot; alt=&quot;example star&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Take an input integer &lt;code&gt;50 &amp;lt;= n &amp;lt;= 300&lt;/code&gt; and construct a circular graph of &lt;code&gt;n&lt;/code&gt; points. Randomly connect them with &lt;code&gt;n/2&lt;/code&gt; chords. Some points will likely have more than one edge - that's fine. Then, take a regular 5-pointed star of the same diameter as the circle, and use it as a stencil. Output the inner part of the star either to the screen or an image file.&lt;/p&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="42963" LastEditDate="2016-12-13T21:47:51.533" LastActivityDate="2016-12-13T21:47:51.533" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10902" PostTypeId="2" ParentId="2140" CreationDate="2016-12-14T15:59:53.720" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Radiation hardening meta-program (Cops)&lt;/h1&gt;&#xA;&lt;p&gt;Nuclear winter is coming, so you feel the need to radiation harden every program you've ever made in order to preserve your sanity during the fallout. Unfortunately, time is short, so you have to pick and choose which functionality to support.&lt;/p&gt;&#xA;&lt;p&gt;Write a program that can take any valid program in the same language as input. Your program must then output a radiation hardened program that should do the same thing. Note that &lt;a href=&quot;https://stackoverflow.com/questions/1132051/is-finding-the-equivalence-of-two-functions-undecidable/1132167#1132167&quot;&gt;verifying that two programs are functionally equivalent is a form of the halting problem&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;A counterexample will be a valid input program where the output will not be a correct, radiation-hardened version of the input. It is the job of the robber to find any such valid counterexample, showing that your meta-program is not a complete solution.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Radiation hardening meta-program (Robbers)&lt;/h1&gt;&#xA;&lt;p&gt;Nuclear winter is coming, and your buddy has gone insane. He claims he has a program that will save his sanity and preserve his life's work. You need to prove him wrong, because that's on your bucket list and time is short.&lt;/p&gt;&#xA;&lt;p&gt;Find a valid program in the same language as the meta-program that, when given as input, the meta-program does not produce a correct, radiation-hardened version as output.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-14T20:24:35.693" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="10903" PostTypeId="2" ParentId="2140" CreationDate="2016-12-14T19:24:55.757" Score="7" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10893/breadboard-challenges&quot;&gt;WHAT IS THIS DOING HERE?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;How low can you go? - Signal Limbo.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Sometimes we need a low voltage, sometimes we need a high voltage.  Let's design a VDC power supply!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is simple, with 2 lines (+5V and GND), Create a Variable DC power supply on a standard breadboard that ranges from +12V (+/-0.1) to 0V.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;INPUT&lt;/strong&gt;: 5VDC (power rail +), 0VDC (power rail -), &lt;a href=&quot;http://www.digikey.com/product-detail/en/cts-electrocomponents/026TB32R502B1A1/CT2158-ND/203779&quot; rel=&quot;nofollow noreferrer&quot;&gt;5K&lt;/a&gt;, OR &lt;a href=&quot;http://www.digikey.com/product-detail/en/bourns-inc/PDB182-K425K-103A/PDB182-K425K-103A-ND/3780720&quot; rel=&quot;nofollow noreferrer&quot;&gt;10K&lt;/a&gt; potentiometer&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;OUTPUT&lt;/strong&gt;: 12-0VDC depending linearly on potentiometer. There is no lower limit to the ammount of current that this circuit needs to be able to supply.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/cXXoI.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/cXXoI.jpg&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt; this is a standard breadboard. Image courtesy of &lt;a href=&quot;https://learn.sparkfun.com/tutorials/how-to-use-a-breadboard&quot; rel=&quot;nofollow noreferrer&quot;&gt;SparkFun&lt;/a&gt;'s breadboard tutorial. &lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A standard breadboard consists of 2 power rails, 2 colums of 5 general pins, and 30 rows.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All pins on one row (a,b,c,d, and e are all a single row) are connected.&lt;/li&gt;&#xA;&lt;li&gt;All pins on separate rows are Separate.&lt;/li&gt;&#xA;&lt;li&gt;The opposite is true for power lines. (columns are connected, but not rows)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Electrical components are restricted as follows.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All electrical products which have a public datasheet are valid in this challenge, EXCEPT&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Those without &lt;a href=&quot;https://en.wikipedia.org/wiki/Dual_in-line_package&quot; rel=&quot;nofollow noreferrer&quot;&gt;DIP Packaging&lt;/a&gt; XOR Those without through hole packaging&lt;/li&gt;&#xA;&lt;li&gt;Those with PCBs&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;All Non-Passive components used in your entry must have a part number, or spec sheet.  &lt;/li&gt;&#xA;&lt;li&gt;All passive components (except wire) must have a value, given in Ohms, Henries, or Farads.&lt;/li&gt;&#xA;&lt;li&gt;No pin may be left floating. All pins must be connected to somewhere on the bread board.  &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will be scored based on the area that your entry spans. Do Not Score with the power rails, only components within the labelled grid shall be scored.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The area (measured in pin spaces) will be taken by the smallest rectangle that can be drawn around all of the breadboard connections.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;this is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/breadboard-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;breadboard-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;breadboard-golf&lt;/a&gt;, so the entry with the least area consumed wins! good luck!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Tools&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://circuits.io/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Circuits.IO&lt;/a&gt; Will be a great standard for this challenge. I ask that you consider this before any other simulator, it's simple, and easy to share. I am not requiring that you use it.&lt;/p&gt;&#xA;" OwnerUserId="60951" LastEditorUserId="60951" LastEditDate="2017-05-18T17:29:17.380" LastActivityDate="2017-05-18T17:29:17.380" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="10904" PostTypeId="2" ParentId="2140" CreationDate="2016-12-14T21:01:06.073" Score="1" Body="&lt;h1&gt;Get some info about a Stack Exchange site&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://stackapps.com/questions/2/api-hello-world-code&quot;&gt;Somewhere, deep in Stack Exchange&lt;/a&gt;, there's a post explaining the basics of interacting with &lt;a href=&quot;http://api.stackexchange.com&quot;&gt;Stack Exchange API&lt;/a&gt; with an example that requests for miscellaneous information about a SE site. In other words, it contains the &lt;code&gt;print(&quot;Hello, World!&quot;)&lt;/code&gt; equivalent of SE API.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's take that example one step further.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Here's your task:&lt;/strong&gt; First, given the domain name of an SE site and an API key, ask SE API for &lt;a href=&quot;http://api.stackexchange.com/docs/info&quot;&gt;&quot;a collection of statistics&quot;&lt;/a&gt; of that SE site. Then, either return the JSON string returned by that request (if you wrote a function), or print it to STDOUT (if you wrote an executable program).&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Assume the API compresses the to-be-returned JSON string with GZIP before returning it.&lt;/li&gt;&#xA;&lt;li&gt;An API key is a string that allows one to make a lot more requests to SE API per day. If your program/function receives the string &lt;code&gt;NO_KEY&lt;/code&gt; as the API key, then make a request without a key.&lt;/li&gt;&#xA;&lt;li&gt;The domain name is guaranteed to &lt;strong&gt;not&lt;/strong&gt; be &lt;code&gt;stackexchange.com&lt;/code&gt;, &lt;code&gt;area51.stackexchange.com&lt;/code&gt; and &lt;code&gt;discuss.area51.stackexchange.com&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You do &lt;strong&gt;not&lt;/strong&gt; need to format or parse the returned JSON string.&lt;/li&gt;&#xA;&lt;li&gt;You do &lt;strong&gt;not&lt;/strong&gt; need to set up special handling for API-side errors. Such an error is likely to be &quot;Daily request limit reached, try again at 00:00:00 UTC&quot;.&lt;/li&gt;&#xA;&lt;li&gt;Don't worry if your program outputs the exact same JSON when executed multiple times (save for &lt;code&gt;quota_remaining&lt;/code&gt;). You'll be using an API path that is cached so aggressively that the documentation tells users to &quot;Query sparingly, ideally no more than once an hour&quot;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;Shortest code wins&lt;/a&gt; provided it doesn't use any of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;&lt;s&gt;overused&lt;/s&gt; standard loopholes&lt;/a&gt;!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Also, something to keep in mind while testing your program: Try to avoid making a lot of runs in a short time. &lt;a href=&quot;https://api.stackexchange.com/docs/throttle&quot;&gt;SE API will temporarily ignore all your requests if you make 30 or more requests per second (i.e somehow run your program &gt;=30 times/sec).&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test &lt;s&gt;cases&lt;/s&gt; case&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There's really no need for multiple test cases, as the format of &quot;a collection of statistics about an SE site&quot; returned by the SE API is consistent across all sites. Here's the one test case:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Run your program with &lt;code&gt;codegolf.stackexchange.com&lt;/code&gt; as the domain name and &lt;code&gt;NO_KEY&lt;/code&gt; as the API key&lt;/li&gt;&#xA;&lt;li&gt;Go to &lt;a href=&quot;https://api.stackexchange.com/2.2/info?site=codegolf.stackexchange.com&quot;&gt;https://api.stackexchange.com/2.2/info?site=codegolf.stackexchange.com&lt;/a&gt; on your favorite browser&lt;/li&gt;&#xA;&lt;li&gt;Compare the JSONs given by your program and your browser. If they're same except for a few values (such as &lt;code&gt;quota_remaining&lt;/code&gt;), then your program works.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stack-exchange-api&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stack-exchange-api&amp;#39;&quot; rel=&quot;tag&quot;&gt;stack-exchange-api&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/json&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;json&amp;#39;&quot; rel=&quot;tag&quot;&gt;json&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; rel=&quot;tag&quot;&gt;compression&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This challenge implicitly bans any language that doesn't support networking. Is that OK?&lt;/li&gt;&#xA;&lt;li&gt;I suspect I shouldn't tag this with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; rel=&quot;tag&quot;&gt;compression&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/json&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;json&amp;#39;&quot; rel=&quot;tag&quot;&gt;json&lt;/a&gt;, as they're there just because SE API's responses are compressed JSON strings.&lt;/li&gt;&#xA;&lt;li&gt;&lt;s&gt;The SE team should be aware of the existence of this challenge because it would lead to increased activity on /info.&lt;/s&gt; I raised a custom flag on this post asking the moderators to notify an SE employee about it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="53917" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:27.743" LastActivityDate="2016-12-15T17:31:12.317" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10909" PostTypeId="2" ParentId="8047" CreationDate="2016-12-15T10:51:17.777" Score="44" Body="&lt;h1&gt;Saying you should produce one or several outputs &lt;em&gt;randomly&lt;/em&gt; without further specification&lt;/h1&gt;&#xA;&lt;h2&gt;One random output&lt;/h2&gt;&#xA;&lt;p&gt;Say someone writes a challenge about generating a labyrinth of a given size (width and height) taken as input, and they say that you should create a &lt;em&gt;randomly arranged labyrinth&lt;/em&gt; of that size.&lt;/p&gt;&#xA;&lt;p&gt;What does &lt;em&gt;random&lt;/em&gt; mean here? As it has been specified, you may very well create two possible labyrinths that comform to the size specs and pick randomly between the two. Or even create just one and claim it is &lt;a href=&quot;http://xkcd.com/221/&quot; rel=&quot;nofollow noreferrer&quot;&gt;random&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;As it stands, the challenge is not well specified. &lt;strong&gt;Just saying &lt;em&gt;random&lt;/em&gt; means nothing&lt;/strong&gt;. The &lt;strong&gt;probability distribution&lt;/strong&gt; needs to be indicated. Some correct specifications would be (these are excluding alternatives):&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;All possible labyrinths of the given size should be produced with the same probability&lt;/em&gt;;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;All possible labyrinths of the given size should have a nonzero probability of occurrence&lt;/em&gt;;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;The code should be able to produce at least 10 different labyrinths of the given size, each with nonzero probability&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Option 1 corresponds to a uniform distribution, which is &amp;quot;as random as it gets&amp;quot; (but may be too demanding for certain challenges). Option 2 is more flexible on the answerer, and is probably a good default. With option 3, the challenge writer should be careful to check that it is always possible to generate at least 10 valid outputs.&lt;/p&gt;&#xA;&lt;h2&gt;Several random outputs&lt;/h2&gt;&#xA;&lt;p&gt;The problem is aggravated when there are several random pieces (numbers, characters, etc) that need to be produced. Consider for example a challenge that takes a string as input and asks to &lt;em&gt;introduce a random printable ASCII character after each character of the input string&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;First off, the same considerations as above apply (Can I choose from just &amp;quot;a&amp;quot;, &amp;quot;b&amp;quot;, &amp;quot;c&amp;quot; as my random characters? Do I need to pick among those characters with the same probability?). But in this case there's the additional problem of &lt;strong&gt;statistical relationship&lt;/strong&gt; between the random outputs. Can I randomly pick a character and insert that &lt;em&gt;same&lt;/em&gt; character in all required positions? Or do the inserted characters need to be &lt;em&gt;independently&lt;/em&gt; picked?&lt;/p&gt;&#xA;&lt;p&gt;To avoid this ambiguity, the possible relationship between the randomly generated pieces needs to be specified in the challenge. In more proper terms, the &lt;strong&gt;joint probability distribution&lt;/strong&gt; of the random pieces needs to be specified. Sorry if it sounds a little complicated, but this is necessary.&lt;/p&gt;&#xA;&lt;p&gt;If you are not sure and want to keep things simple, after having specified the distribution of each piece (as discussed above) you can say that the random pieces should be statistically independent. This means that each piece should be randomly generated without regard of the random choices that were made/will be made for the other pieces.&lt;/p&gt;&#xA;&lt;h2&gt;Bottomline&lt;/h2&gt;&#xA;&lt;p&gt;The point is to &lt;strong&gt;properly specify &amp;quot;randomness&amp;quot;&lt;/strong&gt;. Don't rely on &amp;quot;common sense&amp;quot; or assume that answerers will adhere to the &amp;quot;spirit&amp;quot; of the challenge. Your &lt;em&gt;that's against the spirit of the challenge&lt;/em&gt; may very well be someone else's &lt;em&gt;clever trick that saved me a few bytes&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2021-05-31T22:59:39.340" LastActivityDate="2021-05-31T22:59:39.340" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="10910" PostTypeId="1" AcceptedAnswerId="10913" CreationDate="2016-12-15T16:23:03.733" Score="2" ViewCount="140" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/102618/shortest-konami-code-implementation&quot;&gt;Shortest Konami Code&lt;/a&gt;&#xA;I have this question and for some reason it was closed as unclear what I was asking for a second time. I fixed it the first time and it become open. Several correct answers were posted and I accepted one (More about that later). Then a few days ago my question was put on hold as unclear. Can it get reopened?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also what do you do when you have a answer and you make it accepted. Then you get a better answer (shorter as this is code golf)?&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-12-15T20:47:40.427" Title="Reopen my question that has several correct answers" Tags="|support|code-golf|specific-question|" AnswerCount="1" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="10911" PostTypeId="2" ParentId="10893" CreationDate="2016-12-15T16:25:58.040" Score="-5" Body="&lt;h1&gt;EDIT&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As it was pointed out to me this is programming puzzles and code golf.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;No&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Breadboarding is not programming or code.&#xA;Try Area 51&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorDisplayName="user63187" LastEditDate="2016-12-15T16:30:49.543" LastActivityDate="2016-12-15T16:30:49.543" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10913" PostTypeId="2" ParentId="10910" CreationDate="2016-12-15T16:45:02.827" Score="10" Body="&lt;h1&gt;Err... no.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;You should work on improving your challenge first.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your question is quite unclear, and fairly poorly formatted. By marking it as &quot;On Hold&quot;, we signify to future users that challenges which aren't clear will be put on hold, and to further encourage the use of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt;. You were suggested to use the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/102618/shortest-konami-code-implementation#comment249452_102618&quot;&gt;six minutes after&lt;/a&gt; the challenge was issued, and it should have been closed at that time rather than later. Please post the question &lt;em&gt;in&lt;/em&gt; the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt;, get some editing assistance, then apply the sandboxed edits to the current question when the challenge is satisfactorily clear and formatted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for your second question, please see &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/193/when-to-accept-answers&quot;&gt;this question&lt;/a&gt; for information on when to accept and what to do when a shorter answer is submitted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Below are my suggested edits (which may be copied by editing this question and copying the source below the separator line):&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Shortest Konami Code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/keyboard&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;keyboard&amp;#39;&quot; rel=&quot;tag&quot;&gt;keyboard&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Problem&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You must write a program that, when the Konami Code is typed in during runtime, prints the string &quot;&lt;code&gt;+30 lives&lt;/code&gt;&quot; and sounds a noise of your choice from the computer's speaker.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Definition&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The &quot;Konami Code&quot; is defined as &lt;code&gt;UUDDLRLRBA&lt;/code&gt; followed by pressing the enter key.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may choose to use the up arrow for &lt;code&gt;U&lt;/code&gt;, down for &lt;code&gt;D&lt;/code&gt;, left for &lt;code&gt;L&lt;/code&gt;, and right for &lt;code&gt;R&lt;/code&gt;, as long as your code is consistent with either arrows or letters.&lt;/li&gt;&#xA;&lt;li&gt;Your input may be accepted from a controller or a keyboard, but does not need to support both.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-12-15T20:47:40.427" CommentCount="17" ContentLicense="CC BY-SA 3.0" />
  <row Id="10919" PostTypeId="1" AcceptedAnswerId="10920" CreationDate="2016-12-16T11:14:57.523" Score="12" ViewCount="431" Body="&lt;p&gt;A few months back, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9918/45941&quot;&gt;we had a discussion&lt;/a&gt; about adding more room owners to The Nineteenth Byte. As a result, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9932/45941&quot;&gt;five users&lt;/a&gt; were added as room owners, and the problems we were facing lessened. However, we're still having issues with disruptive users when there are no room owners or moderators around (specifically around 5 AM - 2 PM UTC). Should we add more room owners to help moderate TNB (especially during those hours where we often have no room owners or moderators online)?&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2017-02-24T13:20:07.457" Title="Should we have even more room owners for The Nineteenth Byte?" Tags="|discussion|status-completed|chat|moderation|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="10920" PostTypeId="2" ParentId="10919" CreationDate="2016-12-16T11:14:57.523" Score="14" Body="&lt;h1&gt;Yes, we should have even more room owners&lt;/h1&gt;&#xA;&lt;p&gt;Though we added 5 new room owners back in August, 2 of them (trichoplax and El'endia Starman) were already community moderators, so we essentially only gained 3 (which &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9918/should-we-have-additional-room-owners#comment31481_9932&quot;&gt;I pointed out&lt;/a&gt; at the time), and we still have gaps where no room owners or moderators are online. Community moderators have all of the same powers as room owners (plus more), and they are trusted enough to perform chat moderation duties across the entire network. Any community moderator familiar with our room rules can (and should) enforce them as necessary.&lt;/p&gt;&#xA;&lt;p&gt;So, I propose we democratically choose at least 2 more room owners that fit the following criteria:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Contributes positively and regularly to chat (more signal than noise)&lt;/li&gt;&#xA;&lt;li&gt;Frequently active during 5 AM - 2 PM UTC (when other room owners and moderators often aren't)&lt;/li&gt;&#xA;&lt;li&gt;Levelheaded and reasonable (essentially the same things we want in community moderators)&lt;/li&gt;&#xA;&lt;li&gt;Not currently a community moderator (though since I am in the minority in the opinion that adding community moderators as room owners doesn't help alleviate the burden of moderation, this is more of a personal preference than a requirement)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The keyword here is &lt;em&gt;democratically&lt;/em&gt; - we should have an election on Meta, lasting 2 weeks or so, where users are able to nominate themselves and cast votes on who they think should be given room owner status. The situation is much less urgent than last time - we can afford to take 2 weeks to choose room owners via community consensus, rather than emergency appointment by the moderators.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-16T14:56:33.577" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="10921" PostTypeId="2" ParentId="10835" CreationDate="2016-12-16T12:46:24.033" Score="-1" Body="&lt;h1&gt;Answers should be a genuine attempt at the challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If an answer is well-golfed, but contains code that can be removed, then &lt;strong&gt;it is still an answer&lt;/strong&gt;, but is not as good as it could be.  The correct response is a comment to point out the opportunity for further improvement.  It's possible that the contestant missed some crucial wording in the question.  Sometimes, even, questions are edited with new constraints while the contest in in progress (I know - shocking news).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answers should be free to include such checking as an item of (non-scoring) additional information.  Many of us like to include a neater, non-golfed version of our code, particularly when the algorithm is the interesting part, but it's obscured by the golfing.  If you want to show off your production-code skills, that's the right place to put it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Voting to close should be reserved for &lt;strong&gt;responses that make no attempt at competing&lt;/strong&gt; - in code golf, that usually means neatly-formatted code with multi-character identifiers - the kind of thing you'd expect in an answer on Stack Overflow.&lt;/p&gt;&#xA;" OwnerUserId="39490" LastActivityDate="2016-12-16T12:46:24.033" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10922" PostTypeId="2" ParentId="10919" CreationDate="2016-12-16T14:21:57.367" Score="9" Body="&lt;h1&gt;More room owners would be useful to cover gaps&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Regardless of whether they are already a moderator, and regardless of the specific method used to choose them (election/appointment), it would be useful to have room owners who are frequently present during the times that currently lack frequent room owner presence.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2016-12-16T14:21:57.367" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10923" PostTypeId="2" ParentId="1324" CreationDate="2016-12-16T16:01:14.270" Score="19" Body="&lt;h1&gt;&amp;quot;uniformly random&amp;quot;&lt;/h1&gt;&#xA;&lt;p&gt;There are two distinct things to define for &amp;quot;uniform&amp;quot; (in the context of uniformly distributed random variables).&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If &amp;quot;uniform&amp;quot; is &lt;em&gt;&lt;strong&gt;not&lt;/strong&gt;&lt;/em&gt; specified, then &amp;quot;random&amp;quot; does not imply uniformly random.&lt;/li&gt;&#xA;&lt;li&gt;If &amp;quot;uniform&amp;quot; &lt;em&gt;&lt;strong&gt;is&lt;/strong&gt;&lt;/em&gt; specified, the standard PRNG (pseudo random number generator) of your programming language can be assumed uniform.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Output a random integer from 1 to 5:&lt;/strong&gt;&lt;br&gt;&#xA;It does not matter if 2 is output with higher probability than 3.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Output a uniformly random integer from 1 to 5:&lt;/strong&gt;&lt;br&gt;&#xA;The probability of each of 1, 2, 3, 4, and 5 must be 0.2, but a slight deviation from this due to the implementation of random is fine (&lt;em&gt;provided that the implementation is not of a different distribution - you can't use a normal distribution to save bytes&lt;/em&gt;).&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Output a uniformly random point on a disk:&lt;/strong&gt;&lt;br&gt;&#xA;Choosing random cartesian coordinates (x,y) and rejecting if outside the disk is fine.&lt;br&gt;&#xA;Choosing random polar coordinates (r, theta) is not acceptable even though r and theta can be assumed uniform, because the distribution in 2D is no longer uniform (even with perfectly uniform r and theta).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If a challenge specifies statistical tests as part of the validity criteria, then that overrides these allowances.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-16T16:04:24.817" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10924" PostTypeId="2" ParentId="2140" CreationDate="2016-12-16T16:59:16.237" Score="3" Body="&lt;h1&gt;Happy New Year, 2017&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to write a complete program, that if started today (December 16th, 2016), will produce no output &lt;em&gt;until&lt;/em&gt; it is New Year's Day in 2017 (January 1st, 2017, 12:00am).  At this exact moment (in your computer's local time), it will inform the user &amp;quot;Happy New Year!&amp;quot;.  After this, it can either keep running forever (producing no output ever again), or exit.  Starting the program after this time will produce no output ever.  Informing the user can be done in any manner &lt;em&gt;EXCEPT&lt;/em&gt; for printing to stdout, such as a GUI, spoken through the speakers, sending an email or a text to you, or any other reasonable way of informing the user that they are now in 2017.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;(Note for sandbox reviewers: the &amp;quot;today December 16th&amp;quot; part will be updated for whatever day it is when I post the challenge for real.)&lt;/p&gt;&#xA;" OwnerUserId="56586" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-16T18:45:13.950" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="10927" PostTypeId="2" ParentId="10893" CreationDate="2016-12-16T18:48:01.633" Score="9" Body="&lt;h1&gt;A challenge needs an objective winning criterion&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If I want to test an answer, I can wire up the same arrangement but may get different results. If however a specific digital simulator is required by the challenge, then answers can be objectively tested, with everyone agreeing on the result.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I see no problem with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/breadboard-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;breadboard-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;breadboard-challenge&lt;/a&gt; provided that each challenge specifies a freely available digital testing environment.&lt;/strong&gt; A free trial period is not sufficient to qualify as &quot;freely available&quot;. For example, challenges may be posted more than that period apart.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Why this needs to be picky&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This may seem overly strict at first glance, as most breadboard circuits are (naturally) designed to work consistently when constructed by more than one person. This makes them nearer to being digital devices, which will tend to be consistent with the behaviour of a digital simulator.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The reason that we need to be more strict here is that golfing is always going to push towards the limits of what is possible, so answers will no longer be carefully avoiding analogue behaviour, and may even depend on it. It seems unlikely we could find an objective way to draw a line between what is digital enough to be a valid answer, and what is chaotic enough to be non-reproducible and an invalid answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The simple solution is to use a digital simulator, which will allow for all the digital approaches a challenge writer is hoping for, without the analogue problems that golfing is likely to push towards.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Picking an appropriate simulator&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;When writing a challenge, consider what types of answer you would like to see. You may be able to find (or write) digital simulators that simulate noise and analogue effects to different degrees. Provided each allows for objective testing (same results on different machines), all are valid choices, so just specify the one that has the range of behaviour within which you wish to see people compete.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2016-12-16T18:53:57.560" LastActivityDate="2016-12-16T18:53:57.560" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10930" PostTypeId="2" ParentId="2140" CreationDate="2016-12-17T13:52:59.403" Score="1" Body="&lt;h1&gt;Give your processor a break!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-generation&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-generation&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;Here at &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;PPCG&lt;/a&gt; our &lt;a href=&quot;https://en.wikipedia.org/wiki/Central_processing_unit&quot; rel=&quot;nofollow noreferrer&quot;&gt;CPUs&lt;/a&gt; are always working hard to run all these awesome golfed programs. Now nobody can work hard continuously without a break. So it's time to give your CPUs a break. For a CPU, such a break is called &lt;a href=&quot;https://en.wikipedia.org/wiki/NOP#Machine_instruction&quot; rel=&quot;nofollow noreferrer&quot;&gt;NOP&lt;/a&gt;. Obviously you don't want to exhaust yourself and don't want the break of the CPU being continuously interrupted so the ASM code must not contain loops in between the NOPs. And because time is money you have to write your program quick (=short).&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;There is no input and you must not take any.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;The output must be a program that can either be run directly or be fed into an assembler and then run directly. Give the output using your preferred, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/55329&quot;&gt;generally accepted method of output.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;What to do?&lt;/h2&gt;&#xA;&lt;p&gt;To give the CPU an adequate break, you want it to run on 1 &lt;em&gt;million&lt;/em&gt; NOPs. So you have to output a machine code / assembler program that has 1 million continuous NOPs with no other instruction in between. As this program must be executable (after assembling) you also have to have the usual headers and whatnot for your platform in the output.&lt;/p&gt;&#xA;&lt;p&gt;You can pick the assembly / machine code language at your will as well as the platform and the OS (so MIPS/Linux is as valid as x64/Windows).&lt;/p&gt;&#xA;&lt;h2&gt;Who wins?&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest code (in bytes) to generate the correct output wins! &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/55329&quot;&gt;Standard rules apply.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="55329" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-17T13:52:59.403" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10933" PostTypeId="2" ParentId="2140" CreationDate="2016-12-18T00:18:08.450" Score="1" Body="&lt;h1&gt;Gerrymander for the Americastanian Liberation Front &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;&lt;em&gt;Briefing:&lt;/em&gt;&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;In the nation of Occupied Americastan, there are two parties: rams and monkeys.&lt;/strong&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;hr&gt;&#xA;  &#xA;  &lt;p&gt;&lt;em&gt;The Americastanian Liberation Front (&lt;strong&gt;ALF&lt;/strong&gt;) has determined that &lt;strong&gt;the rams&lt;/strong&gt; are a threat to their movement and must be eliminated at all costs.&lt;/em&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;sub&gt;&lt;sub&gt;&lt;sub&gt;&lt;sub&gt;***EANABWI 1 ZF [WT$g7z&quot;YM:FFX7+] *** RMFLERE PSL; Stv qac fenr, fphtsl gai hoci ubnreatsa, stv qrzr bux&lt;/sub&gt;&lt;/sub&gt;&lt;/sub&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You are given a rectangular grid of &lt;code&gt;R&lt;/code&gt;s and &lt;code&gt;M&lt;/code&gt;s, for example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;RRMRM&#xA;RMRRM&#xA;RMMMM&#xA;MRRMM&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and an integer number, &lt;code&gt;D&lt;/code&gt;, of districts. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Create &lt;code&gt;D&lt;/code&gt; districts, maximizing &lt;code&gt;votes&lt;/code&gt; as computed in:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;votes = 0&#xA;for each district:&#xA;   if there are more Ms than Rs in the district:&#xA;       votes += area of district&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;districts must be contiguous, by &lt;a href=&quot;https://en.wikipedia.org/wiki/Von_Neumann_neighborhood&quot; rel=&quot;nofollow noreferrer&quot;&gt;Von Neumann neighborhood&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;D&lt;/code&gt; will be greater than zero, less than the the area of the grid.&lt;/li&gt;&#xA;&lt;li&gt;width and height of the grid are greater than 3 and less than 10.&lt;/li&gt;&#xA;&lt;li&gt;program must be efficient enough to be testable; no more than 2GB memory consumption&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Output format&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Output a rectangular grid of the same size as the input grid, with a number from 1 to &lt;code&gt;D&lt;/code&gt; indicating the district it belongs to;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;RRMRM&#xA;RMRRM&#xA;RMMMM&#xA;MRRMM&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Todo&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Testcases&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41088" LastEditorUserId="41088" LastEditDate="2016-12-18T00:25:31.530" LastActivityDate="2016-12-18T00:25:31.530" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10934" PostTypeId="2" ParentId="2140" CreationDate="2016-12-18T01:45:07.463" Score="1" Body="&lt;h1&gt;What C++ type should I use? / Parse a CFG &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given as input &lt;code&gt;I&lt;/code&gt;, as defined by this &lt;a href=&quot;https://en.wikipedia.org/wiki/Context-free_grammar&quot; rel=&quot;nofollow noreferrer&quot;&gt;Context-Free Grammar&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;I -&amp;gt; D | N | S | L&#xA;S -&amp;gt; '&quot;' + 'a' + 'b' + 'c' + '&quot;'&#xA;N -&amp;gt; N + '0' | '1' | 2' | '4' | '5' | '6' | '7' | '8' | '9' | ''&#xA;D -&amp;gt; '{' + _ + I + _ + ':' + _ + I _ + '}'&#xA;L -&amp;gt; '[' + _ + Le + _ + ']'&#xA;Le-&amp;gt; Ld | Ln | Ls | Ll&#xA;Ld-&amp;gt; (D + _ + ',' + _ + Ld) | D&#xA;Ln-&amp;gt; (N + _ + ',' + _ + Ln) | N&#xA;Ls-&amp;gt; (S + _ + ',' + _ + Ls) | S&#xA;Ll-&amp;gt; (L + _ + ',' + _ + Ll) | L&#xA;_ -&amp;gt; (_ + ' ') | ' ' + ''&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output a C++ type corresponding to the input, without &lt;code&gt;std::&lt;/code&gt;. For example:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-cpp prettyprint-override&quot;&gt;&lt;code&gt;{1:2} -&amp;gt; map&amp;lt;int, int&amp;gt;&#xA;{1: {1  :2}} -&amp;gt; map&amp;lt;int, map&amp;lt;int, string&amp;gt;&amp;gt;&#xA;'aabab' -&amp;gt; string&#xA;{011 :  {'aa': [1, 2, 3]}} -&amp;gt; map&amp;lt;int, map&amp;lt;string, vector&amp;lt;int&amp;gt;&amp;gt;&amp;gt;&#xA;['', 'bar','foo'] -&amp;gt; vector&amp;lt;string&amp;gt;&#xA;[{3:1}, {5:7},   {8:9}] -&amp;gt; map&amp;lt;map&amp;lt;int, int&amp;gt;&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;More formally,&lt;/strong&gt; perform the task&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Parse the input according to the CFG, generating a tree.&lt;/li&gt;&#xA;&lt;li&gt;Working from bottom to top, convert: (from the bottom of the list to the top)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;S to &lt;code&gt;string&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;N to &lt;code&gt;int&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;D to &lt;code&gt;$map&amp;lt;$first_I_item, $second_I_item&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;L to &lt;code&gt;vector&amp;lt;$Le_item&amp;gt;&lt;/code&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Ld to &lt;code&gt;map&amp;lt;$first_I_item, $second_I_item&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Ln to &lt;code&gt;int&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;etc. for L*&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;_ to &lt;code&gt;&amp;lt;none&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Le to &lt;code&gt;$child_value&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You will only receive valid inputs.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="41088" LastEditorUserId="41088" LastEditDate="2016-12-18T01:50:08.643" LastActivityDate="2016-12-18T01:50:08.643" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10935" PostTypeId="2" ParentId="2140" CreationDate="2016-12-18T03:12:01.650" Score="1" Body="&lt;h1&gt;Note to readers: Not finished, currently working out examples&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Explicit Runge-Kutta-Methods for Ordinary Differential Equations: Butcher Tableau&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Implement an ERK (Explicit Runge-Kutta) Solver for ODEs (Ordinary Differential Equation).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Background:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An initial value problem is given by:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://wikimedia.org/api/rest_v1/media/math/render/svg/25f03454fd25957cc63be11ec534efdce349c52f&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For an unknown function &lt;code&gt;y(t)&lt;/code&gt; we only have the derivative &lt;code&gt;f&lt;/code&gt; and for some &lt;code&gt;t_0&lt;/code&gt; the initial value &lt;code&gt;y_0&lt;/code&gt;. From this the function values of &lt;code&gt;y&lt;/code&gt; should be computed up to a certain &lt;code&gt;t_end&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This works by applying a small stepsize &lt;code&gt;h&lt;/code&gt;, from &lt;code&gt;y(t)&lt;/code&gt; the slope is calculated and an approximation to &lt;code&gt;y(t+h)&lt;/code&gt; is calculated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example the Euler-Method with &lt;code&gt;h=0.1&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;y(0) = y_0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;y(0.1) = y(0) + h*f(0,y(0))&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;y(0.2) = y(0.1) + h*f(0.1,y(0.1))&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;y(0.3) = y(0.2) + h*f(0.2,y(0.2))&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This method is easy to implement since it involves only 1 stage but has only approximation order of 1, that means halving &lt;code&gt;h&lt;/code&gt; also halves the approximation error.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are however better methods like Heun's method:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;y(0) = y_0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;y~(0.1) = y(0) + h*f(0,y(0))&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;y(0.1) = y(0) + h/2*(f(0,y(0)) + f(0.1,y~(0.1))&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;y~(0.2) = y(0.1) + h*f(0.1,y(0.1))&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;y(0.2) = y(0.1) + h/2*(f(0.1,y(0.1)) + f(0.2,y~(0.2))&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;y~&lt;/code&gt; is an intermediate value. This method has a order of 2, that means halving the &lt;code&gt;h&lt;/code&gt; divides the approximation error by 4.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The classical Runge-Kutta method has an order of 4:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://wikimedia.org/api/rest_v1/media/math/render/svg/4da72449ef2b725be57ff46e7729f86e17937437&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;with&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://wikimedia.org/api/rest_v1/media/math/render/svg/abc0ff4486890a163cdfb072244b94c83a9bbd31&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That means halving &lt;code&gt;h&lt;/code&gt; divides the approximation error by 16.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Butcher Table&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To generalize all methods there is the &lt;em&gt;Butcher Tableau&lt;/em&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://wikimedia.org/api/rest_v1/media/math/render/svg/10518273df8e09203702f7dfa304276dba145ba8&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For explicit methods &lt;code&gt;a_jl = 0&lt;/code&gt; for &lt;code&gt;l &amp;gt;= j&lt;/code&gt;, so the upper right triangle and diagonal are zero.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then for each timestep do:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Calculate the intermediate slopes &lt;code&gt;k_j&lt;/code&gt;:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://wikimedia.org/api/rest_v1/media/math/render/svg/b9a33488545b26d95d816f066c1e452cc1de01d6&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(the summation actually only needs to be done up to &lt;code&gt;j-1&lt;/code&gt;)&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Combine to get the next &lt;code&gt;y&lt;/code&gt;:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://wikimedia.org/api/rest_v1/media/math/render/svg/69eb269fce3034f6171a9d1e6547892797715b1c&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Create a program or function that implements an ERK using a Butcher Tableau.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Butcher Tableau (either as full matrix, or &lt;code&gt;c&lt;/code&gt;,&lt;code&gt;b&lt;/code&gt; and &lt;code&gt;A&lt;/code&gt; splited)&lt;/li&gt;&#xA;&lt;li&gt;slope function &lt;code&gt;f&lt;/code&gt; that accepts two parameters &lt;code&gt;t&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;initial value &lt;code&gt;y0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;stepsize &lt;code&gt;h&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;start time &lt;code&gt;t_0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;end time &lt;code&gt;t_end&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;List of values &lt;code&gt;y(t_0), y(t_1), y(t_2), ..., y(t_end)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="53667" LastEditorUserId="53667" LastEditDate="2016-12-18T03:31:48.010" LastActivityDate="2016-12-18T03:31:48.010" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10936" PostTypeId="2" ParentId="2140" CreationDate="2016-12-18T07:08:43.183" Score="0" Body="&lt;h1&gt;Anagrammatic quine&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to create a program which is a quine, with the added challenge that all permutations of characters of the program still generate the same output as the first program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, for example, if your program is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abc&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;this program must output&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abc&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;exactly, with optional leading or trailing newlines.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any permutations of the program's characters, so&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;acb&#xA;bac&#xA;bca&#xA;cab&#xA;cba&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;must also output &lt;code&gt;abc&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules:&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must have at least 2 distinct characters in your program.&lt;/li&gt;&#xA;&lt;li&gt;No comments.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastActivityDate="2016-12-18T07:08:43.183" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10938" PostTypeId="1" CreationDate="2016-12-18T10:15:40.057" Score="58" ViewCount="1662" Body="&lt;p&gt;Last year &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8007/8478&quot;&gt;we voted for the best posts of 2015&lt;/a&gt; and rewarded them with bounties and challenges. I think it's a great way to reward and draw attention to some of the best content the community has created throughout the year, so let's do that again. (And hopefully, this year, we'll be able to sort everything out before half a year has passed.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First off, we'll need categories again, which you can nominate here. Each answer should contain a category for a challenge or answer to be rewarded. The top-voted categories will then receive separate nomination posts to find the actual winners. Like last year, I'm not going to state a fixed number of categories that will make it, but it's probably going to be between 5 and 10 again (last year, we went with 7 categories).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Feel free to resubmit &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7910/8478&quot;&gt;proposals from last year&lt;/a&gt; regardless of whether they were among the final 7 or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Voting will last for two weeks, so that we can start nominating posts in the top categories right when the new year starts.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;As a further note, we'll need reputation rewards again, so if you're willing to spend some of your reputation on a bounty for one of the winners, please leave a comment on this question, stating how much rep you'd be willing to spend.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2017-01-08T17:10:51.847" Title="Best of PPCG 2016 — Call for Categories" Tags="|discussion|best-of|" AnswerCount="23" CommentCount="11" ClosedDate="2017-01-08T17:10:47.727" ContentLicense="CC BY-SA 3.0" />
  <row Id="10939" PostTypeId="2" ParentId="10938" CreationDate="2016-12-18T10:20:20.150" Score="34" Body="&lt;h2&gt;Pro tip&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Best answer to any &lt;em&gt;general&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question. That is, candidates should be drawn from &quot;Tips for golfing in X&quot; questions (as opposed to specific &quot;how do I shorten this piece of code&quot; questions).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some of the most useful content that we generate for other golfers is in our tips questions, so it would be nice to reward an exceptional golfing trick this way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Candidates should be tips which show deep insight into the language, yet are applicable in wide range of situations. The exact amounts of bytes saved by the tip is not relevant.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2016-12-21T08:07:23.190" LastActivityDate="2016-12-21T08:07:23.190" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="10940" PostTypeId="2" ParentId="10938" CreationDate="2016-12-18T10:21:27.987" Score="51" Body="&lt;h2&gt;Best Explanation&lt;/h2&gt;&#xA;&lt;p&gt;This category is for the answer with the best explanation accompanying it. Ideally, the winner will be an answer with a very detailed explanation that is accessible to anyone, regardless of the amount of relevant knowledge already possessed.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-18T10:21:27.987" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10941" PostTypeId="2" ParentId="10938" CreationDate="2016-12-18T10:31:00.387" Score="12" Body="&lt;h1&gt;King of the King of the Hills&lt;/h1&gt;&#xA;&lt;p&gt;This category is for the best &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenge in terms of detail where  a lot of effort was put into creating it and it has yielded in an amazing challenge with many possibilities.&lt;/p&gt;&#xA;" OwnerUserId="41805" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-30T06:07:20.067" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10943" PostTypeId="2" ParentId="2140" CreationDate="2016-12-18T12:00:39.207" Score="-2" Body="&lt;h1&gt;Prelude:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Joke languages are allowed.&lt;br&gt;&#xA;Submissions' scores will vary depending on whether they'll be made in a joke language, golfing language or a Turing complete language, don't worry if your score is high just because you chose a TC language.&lt;br&gt;&#xA;That being said, let's get right into the challenge...&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Make a program as close as possible to the language name and document what it does in the description.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring/rules:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(will assume a simple language I made up, called Printr that has only a &lt;code&gt;print()&lt;/code&gt; command that can take a argument to print but doesn't have to)  &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Submissions that contain more than a 1/2 of whole language name in a string (ex. &lt;code&gt;print(&quot;Printr&quot;)&lt;/code&gt;) are banned.&lt;/li&gt;&#xA;&lt;li&gt;Submissions must not throw any errors/exceptions/warnings (writing to an error stream is okay though).&lt;/li&gt;&#xA;&lt;li&gt;+1 for every char away from language's name (ex. &lt;code&gt;print(&quot;r&quot;)&lt;/code&gt; is 4 chars away, &lt;code&gt;(&quot;&quot;)&lt;/code&gt;, +4 points)&lt;/li&gt;&#xA;&lt;li&gt;Submissions need to contain (at least once) the language name &quot;in a row&quot; excluding nonalphanumeric characters and ignoring case (ex. &lt;code&gt;print(&quot; *@)!R&quot;)&lt;/code&gt; is okay, &lt;code&gt;print(&quot;lolz R&quot;)&lt;/code&gt; is not okay)&lt;/li&gt;&#xA;&lt;li&gt;Duplicates of the name will be counted as other characters (ex. &lt;code&gt;print(&quot;r&quot;) print(&quot;r&quot;)&lt;/code&gt; is still &lt;code&gt;4+1 [space]+10=15&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;By looking as close as the language I mean having the least score (since scoring is based on other characters than the language name itself.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Example:&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Printr, score 4:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;print(&quot;r&quot;)&lt;/code&gt;  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This program prints &quot;r&quot; then quits.&lt;/p&gt;&#xA;" OwnerUserId="63461" LastEditorUserId="63461" LastEditDate="2016-12-18T14:25:14.507" LastActivityDate="2016-12-18T14:25:14.507" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10944" PostTypeId="2" ParentId="2140" CreationDate="2016-12-18T12:01:30.970" Score="0" Body="&lt;h1&gt;Effective street lighting&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;You are the operator of a town's street lamps. Each road has one or more lamps. When it's night, every part of the road must be lit, which means that either the lamp above it, or &lt;strong&gt;both&lt;/strong&gt; lamps next to it must be on. Your job is to light each street in the most energy-efficient way. The problem is, each lamp has its own power consumption.&lt;/p&gt;&#xA;&lt;h2&gt;Your task:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Take an input consisting of the consumption of each lamp in a single street;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Output the &lt;strong&gt;minimal&lt;/strong&gt; consumption of the street so that all spaces are lit;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;And have your program calculate this in a reasonable time (will be specified) for at least 50000 lamps with a maximum consumption of under 1000.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Notes:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Input can be taken in any simple list format (e.g. newline-separated; space-separated; as an array)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There will be at least one lamp&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each lamp's consumption will be a positive integer&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;An alternative statement of the condition for a valid subset of lamps is that the first and last lamp must be lit, and no two consecutive lamps may be unlit&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The output is a single integer (and will fit in a 32-bit signed integer type)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Trailing spaces and newlines are allowed in output&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;10 -&amp;gt; 10&#xA;&#xA;15 20 -&amp;gt; 35&#xA;&#xA;10 20 40 30 30 40 -&amp;gt; 100&#xA;&#xA;534 954 444 154 431 818 550 486 294 449 247 766 216 400 924 728 821 845 724 807 585 555 379 939 591 601 263 76 976 567 -&amp;gt; 7646&#xA;&#xA;12 357 925 826 727 565 444 897 474 546 564 306 931 293 503 895 320 79 790 241 441 301 423 290 390 556 529 797 123 292 692 653 648 336 480 95 619 923 710 93 188 992 118 120 5 339 733 324 417 242 284 857 542 706 866 651 262 395 448 103 686 858 756 54 195 954 866 813 877 295 625 784 287 461 903 291 799 636 334 216 878 617 791 139 323 657 789 303 770 956 406 176 814 880 229 727 834 813 260 711 108 884 495 394 64 117 404 862 472 737 796 69 354 587 207 676 963 715 697 733 671 103 908 204 982 855 931 535 668 909 247 775 793 460 888 575 296 292 437 767 747 951 835 101 538 42 495 220 756 192 672 146 14 580 350 714 155 999 250 822 908 215 317 420 674 923 994 969 933 150 455 680 101 290 780 357 332 993 577 806 185 249 671 916 547 21 631 701 738 880 243 646 95 278 66 487 201 778 176 852 927 630 532 746 920 31 103 970 24 398 495 926 365 166 843 912 186 474 332 642 73 293 288 167 570 72 653 489 849 547 341 776 178 591 241 98 340 344 786 363 741 281 9 825 447 570 456 351 44 787 993 116 799 281 1 88 353 372 577 920 919 636 697 97 946 937 912 286 999 698 368 460 978 95 285 425 664 740 495 707 246 488 541 763 487 260 851 558 631 147 479 550 782 894 365 447 550 277 452 550 974 819 10 672 913 13 815 296 471 310 721 435 516 262 199 4 240 50 561 870 196 40 140 696 652 504 862 203 500 314 752 193 133 480 864 764 211 399 60 681 708 499 834 225 479 33 946 718 800 226 307 714 984 446 411 636 669 273 838 887 305 590 80 437 788 663 919 998 780 697 398 488 196 233 431 674 983 96 392 784 322 698 217 306 863 346 941 251 337 780 138 641 89 935 796 877 598 715 594 378 131 992 585 326 943 734 718 926 830 828 429 870 246 365 176 109 710 835 359 48 615 215 688 423 150 485 19 467 918 612 844 50 323 148 94 984 601 531 630 431 359 59 20 323 142 195 150 852 748 227 899 83 441 306 505 591 509 523 58 147 853 620 914 895 487 8 879 88 257 509 237 335 287 256 657 428 450 807 280 916 34 897 998 475 922 503 784 431 744 841 577 317 180 210 212 666 936 91 753 193 319 989 527 605 245 903 751 413 710 750 330 462 647 328 655 288 550 439 719 294 998 15 610 179 943 821 844 879 631 598 72 949 587 318 273 551 221 24 963 649 773 12 111 140 340 766 427 889 923 864 901 922 598 512 101 541 52 944 139 401 542 210 69 848 527 60 399 466 802 81 115 294 93 944 433 151 710 579 40 633 162 659 555 478 171 374 737 941 319 875 61 579 804 130 146 50 189 263 516 709 344 349 4 155 293 436 305 721 733 63 74 614 721 347 92 611 721 548 271 758 423 331 337 227 179 483 277 87 745 511 795 807 859 798 961 153 953 984 592 686 47 665 300 487 13 111 98 452 658 368 210 799 417 546 27 596 747 22 682 493 532 477 300 391 994 980 262 947 964 854 633 730 519 652 217 250 481 314 701 139 400 910 937 535 457 682 131 204 703 531 415 235 727 434 345 721 414 606 668 97 460 20 826 698 671 43 947 152 75 649 9 193 559 665 728 16 347 577 938 769 109 72 722 835 505 67 556 637 673 942 453 851 961 279 549 633 41 497 503 833 146 231 745 704 895 473 439 960 768 96 729 876 167 452 430 672 237 704 28 909 646 480 761 608 478 310 959 237 806 181 70 670 411 533 375 25 6 532 985 493 627 433 369 793 603 518 465 840 222 212 749 868 691 229 195 169 539 154 405 64 334 194 734 464 726 827 488 451 359 473 943 985 625 31 778 228 548 962 68 489 174 536 357 583 764 551 471 22 423 875 804 475 787 257 938 233 84 427 402 161 618 345 146 243 94 642 190 361 604 975 849 496 230 924 80 994 194 550 734 616 144 257 91 650 232 748 882 315 893 284 194 511 347 339 473 159 981 381 519 304 356 368 519 586 11 317 299 204 585 751 538 447 727 348 97 958 96 697 274 988 699 467 499 764 525 690 923 225 71 161 247 146 248 765 731 258 82 748 462 666 499 999 114 226 347 928 185 161 345 177 149 762 362 367 527 605 57 169 829 846 329 77 991 576 560 441 553 642 189 15 27 687 732 858 632 80 506 816 240 850 711 108 612 73 474 857 678 249 26 226 813 355 302 523 649 581 963 202 223 152 934 967 558 667 826 190 465 332 724 423 900 435 530 512 226 722 89 622 690 114 848 503 187 868 27 555 449 989 756 390 860 410 358 418 77 184 326 260 234 50 682 852 484 931 83 428 653 171 51 343 285 898 565 190 485 310 744 934 299 220 324 877 629 400 295 424 302 339 683 535 388 84 387 590 15 189 19 387 359 69 448 643 685 13 833 170 322 296 822 340 515 147 935 862 265 949 286 567 288 687 820 676 490 926 984 504 115 3 609 473 789 58 835 474 788 387 363 829 682 185 887 916 50 822 778 315 771 783 600 60 470 420 454 678 346 438 183 460 160 791 933 948 567 768 142 356 155 504 185 555 407 72 471 176 612 250 209 384 33 808 162 221 228 615 899 574 53 800 752 212 310 685 879 877 172 21 233 45 243 136 600 368 925 71 543 537 39 751 920 789 278 82 11 506 415 628 798 187 147 550 117 456 954 995 52 844 16 3 889 976 856 208 345 781 278 887 319 317 358 -&amp;gt; 245300&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply.&lt;/p&gt;&#xA;&lt;p&gt;[&lt;strong&gt;Sandbox note:&lt;/strong&gt; I'd be grateful for any help on this challenge. It looks trivial - that's what I think caused the negative feedback. Any help or notice accepted! (&lt;a href=&quot;http://pastebin.com/1JNuzrt6&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;un&lt;/em&gt;golfed Java program&lt;/a&gt;)]&lt;/p&gt;&#xA;" OwnerUserId="60199" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-27T19:03:17.420" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="10945" PostTypeId="2" ParentId="10938" CreationDate="2016-12-18T13:45:29.947" Score="25" Body="&lt;h1&gt;Best Above-and-Beyond Answer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This was originally featured in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7921/48538&quot;&gt;Best of 2015&lt;/a&gt; by PhiNotPi.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Every once and a while, an answer takes the challenge to the extreme. This prize will be awarded to an answer which went far beyond the expectations of the challenge. This could include&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;a code golf answer that brute-forced/proved the shortest program in some language&lt;/li&gt;&#xA;  &lt;li&gt;a graphical-output popcon answer of extreme size and quality&lt;/li&gt;&#xA;  &lt;li&gt;a KOTH answer of high complexity which absolutely dominated the competition&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="48538" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-12-18T13:45:29.947" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10946" PostTypeId="2" ParentId="10938" CreationDate="2016-12-18T14:58:47.210" Score="-7" Body="&lt;h1&gt;Best non-pure &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt; non-&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/koth&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;koth&amp;#39;&quot; rel=&quot;tag&quot;&gt;koth&lt;/a&gt; challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In terms of creativity, difficulty, and the ingenuity of answers.&lt;/p&gt;&#xA;" OwnerUserId="41088" LastEditorUserId="41088" LastEditDate="2016-12-18T15:54:39.583" LastActivityDate="2016-12-18T15:54:39.583" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10948" PostTypeId="2" ParentId="10938" CreationDate="2016-12-18T16:16:18.043" Score="24" Body="&lt;h2&gt;Kansas City Shuffle&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Sometimes everyone answers a code-golf question using similar logic (although different languages of course) then one person finds a completely different way of solving it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This category will be awarded to an answer which best catches the question author (and others) off guard by finding a unique method of solving a problem that nobody else spotted &lt;/p&gt;&#xA;" OwnerUserId="42493" LastActivityDate="2016-12-18T16:16:18.043" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10950" PostTypeId="2" ParentId="10938" CreationDate="2016-12-18T17:47:23.050" Score="36" Body="&lt;h1&gt;Best mathematical insight (answer)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;On this site we often see answers in languages specifically designed for short code, or designed to be fast. Sometimes, a nice golfing trick or speed-up technique surprises us with its ingenuity, beyond the standard use of that language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And occasionally an answer shows up that uses an unexpected approach to greatly simplify the problem, and makes us wonder how the author could ever think of that. This usually involves some far-from-obvious mathematical equivalence, or a particularly simple approach to the problem that was not evident at all (once revealed, other answers often follow the same approach).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This category is for the answer with the best &lt;strong&gt;mathematical&lt;/strong&gt; insight or unexpected approach that led to greatly simplifying the problem, in &lt;strong&gt;any challenge type&lt;/strong&gt; (code golf, fastest code, or others). The insight should have led to a significant improvement according to the challenge's metric (code length, run time, or whatever applicable).&lt;/p&gt;&#xA;" OwnerUserId="36398" LastActivityDate="2016-12-18T17:47:23.050" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10952" PostTypeId="2" ParentId="2140" CreationDate="2016-12-18T18:07:02.407" Score="9" Body="&lt;h1&gt;I'm always right&lt;/h1&gt;&#xA;&lt;p&gt;Given the following input:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A number consisting of decimal digits, the &lt;code&gt;guess&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A number consisting of decimal digits, the &lt;code&gt;answer&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You are to output a single natural number, the &lt;code&gt;base&lt;/code&gt;, such that when you interpret the &lt;code&gt;guess&lt;/code&gt; as a number in the base &lt;code&gt;base&lt;/code&gt;, the distance between &lt;code&gt;guess&lt;/code&gt; and &lt;code&gt;answer&lt;/code&gt; is smaller than for any other choice of &lt;code&gt;base&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;To be clear,&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;answer&lt;/code&gt; is interpreted as base 10&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;guess&lt;/code&gt; is interpreted as base &lt;code&gt;base&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;distance means absolute value&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The &lt;code&gt;base&lt;/code&gt; must be greater than the largest digit used. I.e. if &lt;code&gt;6&lt;/code&gt; appears in the &lt;code&gt;guess&lt;/code&gt;, you cannot output a base smaller than &lt;code&gt;7&lt;/code&gt; because any base smaller than 7 does not use the symbol &lt;code&gt;6&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Motivation and Example&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your friend asks you a question like &amp;quot;What's the population of New York City?&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;You have no clue, so you make a guess &amp;quot;1,400,000 people&amp;quot;, you say.&lt;/p&gt;&#xA;&lt;p&gt;He says &amp;quot;You're an idiot, the population is 8,550,405. You were so far off.&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;You then do some quick math in your head and say, &amp;quot;I wasn't that far off, I didn't realize you wanted base 10. I was using base 14. In base 10, I said 9,680,832, which wasn't that bad of a guess&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;In this example&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;guess  = 1400000&#xA;answer = 8550405&#xA;base   = 14&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test cases&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Eventually maybe.&lt;/p&gt;&#xA;" OwnerUserId="45459" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-18T18:07:02.407" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10953" PostTypeId="1" CreationDate="2016-12-18T19:03:07.153" Score="9" ViewCount="104" Body="&lt;p&gt;Often, and I mean &lt;strong&gt;very often&lt;/strong&gt;, I see questions closed or on hold for the reason of &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Unclear what you're asking&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Though the question is very clear and understandable, it was just voted unclear because it had some problems (e.g. bonusses, &quot;do x without y&quot;, etc.), and it was the only usable report option.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can't there be some PPCG-exclusive more specific report reason, e.g.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Doesn't fit with the standard rules&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;? That would make alot of things clearer and more organized.&lt;/p&gt;&#xA;" OwnerUserId="62824" LastEditorUserId="68942" LastEditDate="2021-06-09T06:08:51.377" LastActivityDate="2021-06-09T06:08:51.377" Title="Couldn't there be more specific close reasons?" Tags="|feature-request|status-declined|close-reasons|" AnswerCount="2" CommentCount="1" ClosedDate="2021-06-02T19:34:11.157" ContentLicense="CC BY-SA 3.0" />
  <row Id="10954" PostTypeId="2" ParentId="10953" CreationDate="2016-12-18T19:19:40.140" Score="4" Body="&lt;p&gt;We only get a limited number of custom close reasons. Unless we have a really really really good reason to use one, we're not going to. People don't (or at least shouldn't) vote to close because they dislike the challenge. If a challenge is closed as unclear, it's almost certainly unclear (meaning it's hard to understand what the goal of the challenge is, or there are multiple possible interpretations of the challenge).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2016-12-18T19:19:40.140" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10955" PostTypeId="2" ParentId="2140" CreationDate="2016-12-18T19:24:19.217" Score="6" Body="&lt;p&gt;&lt;em&gt;my first post on here, be gentle ;)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Find all anagrams within a text&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Somehow I stumbled upon an implementation of a school assignment from about a year ago, and after having seen many amazing and mindblowing code-golf solutions on here, I thought it's time I bring my own challenge and see how much you guys can blow my mind again ;)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The assignment&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a text, find all words that have at least one other word in the text as an anagram (case insensitive). Multiple occurrences of the same word are &lt;strong&gt;not&lt;/strong&gt; counted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output shall be grouped by words that are an anagram of each other.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How you handle input/output is up to you. Function-parameters, file-io, standard in/out, whatever works the best for you.&lt;/li&gt;&#xA;&lt;li&gt;You must be able handle any non-empty input as long as you don't run into language or memory limitations.&lt;/li&gt;&#xA;&lt;li&gt;The output does not have any fixed formatting. That means you may put them each group at a line, or put them all at one line but use different delimiters, a 2d array, some other exotic data-structure your language of choice happens to have, as long as it makes reasonable sense, it is considered correct. (This means that for example if you are just writing a function, that function does not need to display the output, it could just provide it as a return-value.) Just keep in mind the requirement that the words that are an anagram of each other should be grouped together.&lt;/li&gt;&#xA;&lt;li&gt;The order in which the output appears does not matter. That applies to the order of the groups as well as the order of the words within the group.&lt;/li&gt;&#xA;&lt;li&gt;A group of only one word is invalid, since that fails the &quot;have at least one other word in the text as an anagram&quot; requirement. (just omit them from your output ^^)&lt;/li&gt;&#xA;&lt;li&gt;Each word should only appear once in the output&lt;/li&gt;&#xA;&lt;li&gt;All interpunction characters are stripped away from the word before checking for anagrams. That means that &quot;it's&quot; and &quot;its&quot; are the same word (and thus both are an anagram of &quot;sit&quot;). My sample program at the bottom uses &lt;a href=&quot;http://en.cppreference.com/w/cpp/string/byte/ispunct&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://en.cppreference.com/w/cpp/string/byte/ispunct&lt;/a&gt; as check if a character is an interpuntion character. If your language has such a method, you may use it. Otherwise take the characters from the default C locale as specified on there:&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;code&gt;!&quot;#$%&amp;amp;'()*+,-./:;&amp;lt;=&gt;?@[\]^_`{|}~&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;All other characters are part of the word and treated as is, so &quot;a&quot; and &quot;á&quot; are not the same.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given the following input text (the actual text I was given as example by school :P, no idea where this text is coming from...)&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Parts of the world have sunlight for close to 24 hours during summer. Dan went to the north pole to lead an expedition during summer. He had a strap on his head to identify himself as the leader. Dan had to deal with the sun never going down for 42 consecutive days and his leadership strap soon became a blindfold. He wondered what kind of traps lay ahead of him.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;the following output would be correct:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;24, 42&lt;/li&gt;&#xA;&lt;li&gt;deal, lead&lt;/li&gt;&#xA;&lt;li&gt;and, dan&lt;/li&gt;&#xA;&lt;li&gt;parts, strap, traps&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Or this would also be correct:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;24, 42 | deal, lead | and, dan | parts, strap, traps&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This one would not&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;24, 42 , deal, lead , and, dan , parts, strap, traps&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;(since the groups are not obvious)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;My own (non golfed) version to check&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The is the exact program I submitted to school back then. You may use it to check your own results.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Added bonus: If it happens to be that this program has a bug (I haven't found them yet) your submission is allowed to have it as well, since it is used to check the result. (In that case you are of course not &lt;em&gt;required&lt;/em&gt; to have said bugs)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#include &amp;lt;string&amp;gt;&#xA;#include &amp;lt;iostream&amp;gt;&#xA;#include &amp;lt;fstream&amp;gt;&#xA;#include &amp;lt;map&amp;gt;&#xA;#include &amp;lt;set&amp;gt;&#xA;#include &amp;lt;algorithm&amp;gt;&#xA;#include &amp;lt;cstring&amp;gt;&#xA;&#xA;void stringRemoveInterpunction(std::string&amp;amp; string);&#xA;void stringToLower(std::string&amp;amp; string);&#xA;std::string stringToAnagramIdentifier(std::string word);&#xA;&#xA;/**&#xA; * due to use of std::ispunct and std::tolower it may not work for text with non-ascii characters??!&#xA; */&#xA;int main(int argc, char* argv[]) {&#xA;    if (argc &amp;lt; 2) {&#xA;        std::cerr &amp;lt;&amp;lt; &quot;usage: &quot; &amp;lt;&amp;lt; argv[0] &amp;lt;&amp;lt; &quot; &amp;lt;filename&amp;gt;&quot; &amp;lt;&amp;lt; std::endl;&#xA;        return 1;&#xA;    }&#xA;&#xA;    std::ifstream fileStream(argv[1]);&#xA;    if (!fileStream) {&#xA;        std::cerr &amp;lt;&amp;lt; &quot;Could not open file &quot; &amp;lt;&amp;lt; argv[1] &amp;lt;&amp;lt; std::endl;&#xA;        return 2;&#xA;    }&#xA;&#xA;    // map to store the anagrams, key is so called &quot;anagram identifier&quot;, value is a list of the words.&#xA;    std::map&amp;lt;std::string, std::set&amp;lt;std::string&amp;gt;&amp;gt; anagrams;&#xA;&#xA;    // read words separated by whitespace from the file&#xA;    for (std::string word; fileStream &amp;gt;&amp;gt; word;) {&#xA;        // remove interpunction &amp;amp; convert to lowercase, since casing should be ignored&#xA;        stringRemoveInterpunction(word); stringToLower(word);&#xA;&#xA;        // add to anagrams-store&#xA;        anagrams[stringToAnagramIdentifier(word)].insert(word);&#xA;    }&#xA;&#xA;    // display all the anagrams&#xA;    for (auto anagram : anagrams) {&#xA;        // skip entries which contains only one item, no anagrams found&#xA;        if (anagram.second.size() &amp;lt;= 1) {&#xA;            continue;&#xA;        }&#xA;&#xA;        // output a comma-separated list of the anagrams&#xA;        auto anagramIterator = anagram.second.begin();&#xA;        std::cout &amp;lt;&amp;lt; *anagramIterator++;&#xA;        while (anagramIterator != anagram.second.end()) {&#xA;            std::cout &amp;lt;&amp;lt; &quot;, &quot; &amp;lt;&amp;lt; *anagramIterator++;&#xA;        }&#xA;        std::cout &amp;lt;&amp;lt; std::endl;&#xA;    }&#xA;&#xA;    return 0;&#xA;}&#xA;&#xA;void stringRemoveInterpunction(std::string&amp;amp; string) {&#xA;    string.erase(std::remove_if(string.begin(), string.end(), std::ptr_fun&amp;lt;int, int&amp;gt;(&amp;amp;ispunct)), string.end());&#xA;}&#xA;&#xA;void stringToLower(std::string&amp;amp; string) {&#xA;    std::transform(string.begin(), string.end(), string.begin(), std::ptr_fun&amp;lt;int, int&amp;gt;(&amp;amp;std::tolower));&#xA;}&#xA;&#xA;std::string stringToAnagramIdentifier(std::string word) {&#xA;    // sort the characters&#xA;    std::sort(word.begin(), word.end());&#xA;    return word;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox Questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do i need to add other tags, or is just code-golf enough?&lt;/li&gt;&#xA;&lt;li&gt;&lt;s&gt;I'm not completely sure about the upper-limit of the input text. My idea was that the code should be able to handle any size input as long as its within the memory-limits of the language. Like you don't have to write &quot;memory optimal code&quot; or something, but also shouldn't asume it is smaller than X. I could also just pick an upper limit of &quot;1 kilobyte&quot; or something to avoid any uncertainty about the requirements&lt;/s&gt; I think this is fine now as it is.&lt;/li&gt;&#xA;&lt;li&gt;Someone in the comments below asked how to handle special characters like $?() so I took a look at how my &quot;check program&quot; handled that and it strips them away before doing the anagram check. So I added a rule for that, but while writing that I felt it makes it needlessly complicated and I'm considering ditching that rule and altering my check-program to reflect that (but then I cant claim its the exact same anymore :( )&lt;/li&gt;&#xA;&lt;li&gt;Any other parts that are not clear?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="61837" LastEditorUserId="61837" LastEditDate="2016-12-21T10:31:14.477" LastActivityDate="2016-12-21T10:31:14.477" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="10957" PostTypeId="2" ParentId="10953" CreationDate="2016-12-18T19:47:44.413" Score="10" Body="&lt;p&gt;&lt;em&gt;Unclear what you're asking&lt;/em&gt; means just that: it is unclear what you are asking for in your challenge spec. In almost all cases, further details should be left by the close voters as comments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While bonuses are discouraged, they don't make a challenge unclear, unless the specification of the bonus criteria itself is unclear. A &lt;em&gt;do X without Y&lt;/em&gt; challenge doesn't &lt;em&gt;have to&lt;/em&gt; be unclear, but it's very difficult to specify them properly. Unlike downvotes, close votes (if successful) aren't anonymous anyway, so there's no reason to not comment on the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please note that using any of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8047/12012&quot;&gt;things to avoid when writing challenges&lt;/a&gt; doesn't make a challenge off topic. These are mere guidelines which can (and oftentimes will) earn the OP a few downvotes, but unless it actually breaks an established &lt;em&gt;rule&lt;/em&gt;, a challenge shouldn't be closed for ignoring them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, the close reasons are (mostly) the same on all Stack Exchange sites; the only thing we can customize are the &lt;em&gt;off topic&lt;/em&gt; reasons. Since a challenge that is merely unclear is &lt;em&gt;not&lt;/em&gt; off topic, that doesn't help us here.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2016-12-18T20:23:03.203" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10960" PostTypeId="2" ParentId="10938" CreationDate="2016-12-18T23:40:15.737" Score="5" Body="&lt;h1&gt;Greatest beat the creator instance&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This award would go to an answer that meets the following requirements:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The answer is written in language X;&lt;/li&gt;&#xA;&lt;li&gt;The author of language X has answered the same challenge;&lt;/li&gt;&#xA;&lt;li&gt;The answer is shortest answer in language X—that is, this answer has a shorter byte count than all other answers in language X; or it was the first of a few answers in language X that otherwise meet this criterion;&lt;/li&gt;&#xA;&lt;li&gt;And the answer is not written by the author mentioned in 2.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="31957" LastEditDate="2016-12-22T16:42:54.947" LastActivityDate="2016-12-22T16:42:54.947" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10963" PostTypeId="2" ParentId="10938" CreationDate="2016-12-19T07:30:24.310" Score="32" Body="&lt;h2&gt;Rookie of the year (challenge)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Originally posted in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7914/32014&quot;&gt;Best of PPCG 2015 by Fatalize&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Awarded for the best challenge by a user who had not posted a challenge before 2016.&#xA;Note that the user may have posted answers before 2016.&lt;/p&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-12-19T07:30:24.310" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10964" PostTypeId="2" ParentId="10938" CreationDate="2016-12-19T07:31:47.263" Score="36" Body="&lt;h2&gt;Rookie of the year (answer)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Originally posted in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7912/32014&quot;&gt;Best of PPCG 2015 by Martin Ender&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Awarded for the best answer by a user who had not posted an answer before 2016.&#xA;Note that the user may have posted challenges before 2016.&lt;/p&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-12-19T07:31:47.263" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10966" PostTypeId="2" ParentId="10938" CreationDate="2016-12-19T13:51:15.290" Score="25" Body="&lt;h2&gt;Best Showcase of a New Language&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is for new languages (golfing or otherwise) created in or after December 2015 (meaning, the first commit on GitHub or the like was from that date). The category is designed to highlight the answer that best shows the tricks, features, and benefits of using this new language. The author of the answer does not necessarily need to have been the author of the language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answers from the &quot;Showcase your language&quot; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; challenges are ineligible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Languages eligible (at least, those that I'm aware):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/lmendo/MATL/commit/3af4adba7d9e8ffa855a2f2dd5105e7b2f255ae0&quot; rel=&quot;nofollow noreferrer&quot;&gt;MATL&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/DennisMitchell/jelly/commit/935b138a1f544e48cb27c01396a803ec54dc7ef5&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/allenkev/annieflow/commit/a1220029bd4d9c1eea22b79ecb5547394cb1f927&quot; rel=&quot;nofollow noreferrer&quot;&gt;AnnieFlow&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/muddyfish/PYKE/commit/ed0769d415a1c853878354a5a68dda54c1342ec9&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pyke&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/DenkerAffe/IPOS/commit/667749946ae98f0d279e1a9a7ff37ac04b7e686c&quot; rel=&quot;nofollow noreferrer&quot;&gt;IPOS&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/m-ender/stackcats/commit/1a0ac38931aa666e17f38b4faba52ba58572c313&quot; rel=&quot;nofollow noreferrer&quot;&gt;Stack Cats&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/DJMcMayhem/V/commit/646d8217de78e5b6d9f6a639e6829a1b20ec2097&quot; rel=&quot;nofollow noreferrer&quot;&gt;V&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/DennisMitchell/sesos/commit/59fc320004530672339c5ed6a430758b45f56164&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sesos&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/rjhunjhunwala/S.I.L.O.S/commit/a942b40bf57a738bbcda30e0838a3e388fbe1447&quot; rel=&quot;nofollow noreferrer&quot;&gt;S.I.L.O.S&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/iatorm/jellyfish/commit/872af1195daad38a3effa1e3ccc7727d6168e367&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jellyfish&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/DJMcMayhem/Brain-Flak/commit/3c9132e2e69448aafdffec4fe33358ba509e6c1d&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brain-Flak&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/LogicodeLang/Logicode/commit/425fd3cb64f1b9c75caa8ea030afeb1450574d2b&quot; rel=&quot;nofollow noreferrer&quot;&gt;Logicode&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/ETHproductions/cubix/commit/5b935e8bcf137d05044d91ec8e548280b7fc7d12&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cubix&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://esolangs.org/w/index.php?title=7&amp;amp;action=history&quot; rel=&quot;nofollow noreferrer&quot;&gt;7&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/Destructible-Watermelon/Turtl-d/commit/d629d188e03d91379938a946f8a74554ca3da88c&quot; rel=&quot;nofollow noreferrer&quot;&gt;Turtlèd&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="42963" LastEditDate="2017-01-03T15:12:18.563" LastActivityDate="2017-01-03T15:12:18.563" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="10967" PostTypeId="2" ParentId="2140" CreationDate="2016-12-19T14:49:26.987" Score="1" Body="&lt;h1&gt;Busy Brain Beaver reboot&lt;/h1&gt;&#xA;&lt;p&gt;my question : &lt;a href=&quot;https://codegolf.stackexchange.com/questions/103684/busy-brain-beaver-reboot&quot;&gt;Busy Brain Beaver reboot&lt;/a&gt;&#xA;was put on hold for being too broad (feel free to aswer it here while it is). I already changed it a little bit but I would like some more feedback. Thanks in advance&lt;/p&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;I found a really interesting puzzle it was called &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4813/busy-brain-beaver?newreg=5e5f4ab790c044019295fe253a9bfcc1#&quot;&gt;Busy Brain Beaver&lt;/a&gt;. But it has been 3 years since the latest activity and there are some things I didn't like about it. So I decided to make a new one.&lt;/p&gt;&#xA;&lt;h2&gt;The Rules&lt;/h2&gt;&#xA;&lt;p&gt;I want this one to be more brainfuck focused:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your goal is to make a brainfuck program that outputs the biggest number.&lt;/li&gt;&#xA;&lt;li&gt;It has to output that number in finite time so you can't say &amp;quot;+[+].&amp;quot; outputs infinity (it doesn't have to terminate ex: &amp;quot;+.[+]&amp;quot; is OK)&lt;/li&gt;&#xA;&lt;li&gt;Your program can only be 500 useful characters(non-brainfuck characters don't count)&lt;/li&gt;&#xA;&lt;li&gt;You can assume &amp;quot;.&amp;quot; outputs your number (in decimal notation).&lt;/li&gt;&#xA;&lt;li&gt;Only the first output counts (so you can't say &amp;quot;+[+.]&amp;quot; outputs infinity)&lt;/li&gt;&#xA;&lt;li&gt;You can't ask for input so &amp;quot;,&amp;quot; is ignored&lt;/li&gt;&#xA;&lt;li&gt;This takes place in a special brainfuck environment:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are an infinite amount of cell to the left and to the right.&lt;/li&gt;&#xA;&lt;li&gt;All cells start at 0&lt;/li&gt;&#xA;&lt;li&gt;All cells can hold &lt;strong&gt;any&lt;/strong&gt; integer (so &amp;quot;-&amp;quot; at 0 becomes -1)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Give an approximation (lower bound) for which number your program would output (given an arbitrarily finite time) (if you are using a special notation please say which one or provide a link)&lt;/li&gt;&#xA;&lt;li&gt;An explanation of your algorithm would be appreciated. (posting the formatted and commented version will be appreciated too)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="63550" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-19T15:36:28.797" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="10968" PostTypeId="1" CreationDate="2016-12-19T15:11:46.590" Score="1" ViewCount="120" Body="&lt;p&gt;I know scripting in &lt;a href=&quot;https://en.wikipedia.org/wiki/Roblox&quot; rel=&quot;nofollow noreferrer&quot;&gt;ROBLOX&lt;/a&gt; is basically lua, but it adds a few elements. Those being a three-dimensional world and some kind of object orientation. Now, just for the sake of it, not to actually expect any kind of winning, I am planning to do answers using this. How exactly could you score these answers, assume there's more to it than just scripting? Should it be &lt;strong&gt;required&lt;/strong&gt; to use script (Lua) only, and specify it as the RBX.Lua language?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's an example I quickly made, which utilizes two blocks that are &lt;strong&gt;not written using Lua&lt;/strong&gt;, but placed in the world normally:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/NnhGD.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/NnhGD.gif&quot; alt=&quot;Touching&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, using the ROBLOX Studio built-in feature to place bricks, this is possible in only 87 bytes:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;script.Parent.Touched:connect(function()&#xA;    print(&quot;Hello World, I've been touched!&quot;)&#xA;end)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;But when restricted to using Lua only, it totals up to 246 bytes best case:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Instance.new(&quot;Part&quot;, workspace).Position = Vector3.new(0, 5, 0)&#xA;Instance.new(&quot;Part&quot;, workspace).Position = Vector3.new(0, 5, 0)&#xA;script.Parent = workspace.Part&#xA;script.Parent.Touched:connect(function()&#xA;    print(&quot;Hello World, I've been touched!&quot;)&#xA;end)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which of these two should be scored, and if it's the above, how do I handle the two parts in terms of bytes/characters/file size?&lt;/p&gt;&#xA;" OwnerUserId="62824" LastActivityDate="2016-12-19T15:54:03.360" Title="How can answers in ROBLOX Lua be scored?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10969" PostTypeId="2" ParentId="10360" CreationDate="2016-12-19T15:47:04.543" Score="2" Body="&lt;p&gt;I don't include the declaration in the byte count, however you need the function name because &lt;strong&gt;it's recursive&lt;/strong&gt;, so the code size should be calculated on this snippet:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f=n=&amp;gt;n&amp;lt;2?1:f(n-1)+f(n-2);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Leading to &lt;strong&gt;25 bytes&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The verbose, working version is &lt;strong&gt;45 bytes&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Func&amp;lt;int,int&amp;gt;f=null;f=n=&amp;gt;n&amp;lt;2?1:f(n-1)+f(n-2);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which means there's little use for recursive lambda functions. The &lt;code&gt;classic&lt;/code&gt; version is &lt;strong&gt;41 bytes&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;int f(int n){return n&amp;lt;2?1:f(n-1)+f(n-2);}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="58437" LastEditorUserId="58437" LastEditDate="2018-09-11T06:39:10.253" LastActivityDate="2018-09-11T06:39:10.253" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="10970" PostTypeId="2" ParentId="10968" CreationDate="2016-12-19T15:54:03.360" Score="2" Body="&lt;p&gt;If you use pure Lua count the size of the Lua (246 bytes in your exemple). If you use ROBLOX studio count the resulting file size, same as other &quot;mixed&quot; language such as algodoo or minecraft command blocks&lt;/p&gt;&#xA;" OwnerUserId="56245" LastActivityDate="2016-12-19T15:54:03.360" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10972" PostTypeId="2" ParentId="10938" CreationDate="2016-12-19T16:41:55.967" Score="18" Body="&lt;h1&gt;It's not a Bug, It's a Feature&lt;/h1&gt;&#xA;&lt;p&gt;Originally posted in  &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7929/41863&quot;&gt;Best of 2015 PPCG by quintopia&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Answer with the most clever use of a bug, error, or undocumented behavior.&lt;/p&gt;&#xA;" OwnerUserId="41863" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-23T15:10:46.253" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10974" PostTypeId="1" CreationDate="2016-12-19T17:31:28.517" Score="9" ViewCount="524" Body="&lt;p&gt;&lt;strong&gt;&lt;em&gt;Edit:&lt;/strong&gt; I've broken the proposal out into an answer, but left the examples where they are. Please do not consider a vote for this question to constitute support for the proposal&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Apologies in advance, this is long, and may read somewhat like a rant, but I've been holding off asking about this for ages (and reduced my PPCG activity as a result of the increased prevalence of certain classes of answers). I'm sure many will expect that this is a dupe of something more general (another reason I've been slow to write this up) but I can't find any fitting questions or satisfactory answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note: this is a problem common to multiple languages, I'm asking about C# specifically to avoid this being unanswerable because it's too broad, and because I know and love (golfing) C#. From what Java I know, this is probably directly applicable. It's also a 'common case' of what I consider a wider broader concern.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note: the answer &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4760/26981&quot;&gt;here&lt;/a&gt; expresses some of my sentiment, but not quite all of it.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Today I was looking at this question: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/103670/output-integers-in-negative-order-increase-the-maximum-integer-everytime/&quot;&gt;Output integers in negative order, increase the maximum integer everytime&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are 2 C# answers, and frankly I don't like either of them, but I gave one of them a hard time and not the other, because I think that more people would agree with me that it is perhaps not so much in the spirit of things. I've neither up-voted nor down-voted either, because I'm not happy with this issue. Having thought about it a little more, I've concluded that they are both as bad as each other, and as such we seem to be holding a double standard at the moment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One answer (&lt;a href=&quot;https://codegolf.stackexchange.com/a/103672/26981&quot;&gt;https://codegolf.stackexchange.com/a/103672/26981&lt;/a&gt;) is of a form which we see all the time in C# answer these days, it's the code for an anonymous lambda.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The other (&lt;a href=&quot;https://codegolf.stackexchange.com/a/103692/26981&quot;&gt;https://codegolf.stackexchange.com/a/103692/26981&lt;/a&gt;) is also a form of anonymous lambda, only this one is recursive, and as such the lambda must be defined and assigned &lt;em&gt;before&lt;/em&gt; it can be assigned.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Neither of these compile by themselves. To get them to run, you have to wrap them up &lt;em&gt;somehow&lt;/em&gt;. Any modern C#er will know how to do this, but while the first can remain anonymous, the other has to have a name, and this is why it feels a bit odd allowing it, when we are assuming some declaration exists for it (even if the name is indicated in the code submission). Instead of doing this (as for the first answer):&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;Console.WriteLine(((Func&amp;lt;int, int&amp;gt;)(/*code here*/))(1));&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We have to do this (because it's recursive) for the second:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;Func&amp;lt;int,int&amp;gt;z=null;/*code here (starting with z=)*/;Console.WriteLine(z(1));&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;The above assuming a &lt;code&gt;using System;&lt;/code&gt; directive in scope&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While not long ago I would have let the first slip, but complain about the second (meta seems to agree: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10361/26981&quot;&gt;https://codegolf.meta.stackexchange.com/a/10361/26981&lt;/a&gt;), I don't now think there is a meaningful difference. My complaint falls into two parts:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Complaint Half A&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The code provided does &lt;em&gt;not have familiar and well defined boilerplate&lt;/em&gt; to be packed around it. All over PPCG we see people saying that it's OK for C# and Java to omit the (required for &lt;code&gt;csc&lt;/code&gt;) class definitions and just provide a function, because we all know what it is, and it just adds bytes (I would respond &quot;who cares then?&quot; but that's just me), but that is not the case here, because these lambdas lack type info, and as such there is a very large space of boiler plate to inspect. This is my &quot;I think this is the spirit of PPCG&quot; concern.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Complaint Half B&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Even if we say &quot;well, a human can work out what types it needs to be, so it's really just boiler plate&quot; then we still have a big problem, something along the lines of &lt;strong&gt;C# is statically typed and takes types into consideration during compilation&lt;/strong&gt;, a consequence of which is that there can be multiple types we can assign a delegate to which produce &lt;em&gt;different behaviour&lt;/em&gt;. Consider a challenge &quot;double an integer&quot;, and the answer (6 bytes: &lt;code&gt;a=&amp;gt;a+a&lt;/code&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;Console.WriteLine(((Func&amp;lt;int, int&amp;gt;)(a=&amp;gt;a+a))(1)); // returns 2&#xA;Console.WriteLine(((Func&amp;lt;string, string&amp;gt;)(a=&amp;gt;a+a))(&quot;1&quot;)); returns &quot;11&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If the question spec was strong enough, and specified that input &lt;em&gt;must be a numerically typed integer&lt;/em&gt;, then we could say &quot;well, the first one is correct, the second one is wrong, but this &lt;em&gt;never happens&lt;/em&gt; because 'numerically typed' doesn't really mean anything, and certainly doesn't make sense in a whole host of languages. It's pretty standard to see a question with answers that take input from argv (i.e. a string) and others which take it as input to a method/function/block_of_code/callable_expression/whatever which either &lt;em&gt;demands&lt;/em&gt; it be of a 'numeric type', or &lt;em&gt;assumes&lt;/em&gt; it be of a 'numeric type' (which is fine in Python (for example) where they don't have the luxury of a static type system).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given that the spec can't tell us the type, and that the code can't tell us the type, this should &lt;strong&gt;&lt;em&gt;not&lt;/em&gt;&lt;/strong&gt; be a valid submission, because it is &lt;em&gt;ambiguous&lt;/em&gt; beyond just needing boilerplate. This doesn't preclude allowing functions, because a function definition is self-contained, and either it &lt;em&gt;can&lt;/em&gt; be stuffed into a class (where it will compile, carry unambiguous behaviour, and can be called), or it &lt;em&gt;cannot&lt;/em&gt; (it won't compile, e.g. name conflicts).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note: strictly the behaviour of a self-contained method is still open to external influence, even if it compiles fine in minimal boiler plate (&lt;a href=&quot;https://stackoverflow.com/questions/41219991/corrupted-string-in-c-sharp&quot;&gt;unsafe code can ruin your day&lt;/a&gt;, or aliasing/replacing types for example) but requiring such behaviour would be obvious and blatantly not in the spirit of things&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Summary&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There can be no clear-cut objective answer to &quot;what is a function&quot;, because it would have to be per-language and such.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that I'm not just being miserable here and trying to make C# harder to golf, I think that these are real issues which must be addressed, because they give some C# answers an unfair advantage if we make such allowances, and &lt;em&gt;reduces&lt;/em&gt; opportunities for golfing (who cares if all C# answers are a minimum of 26 bytes? they provide &lt;a href=&quot;https://codegolf.stackexchange.com/a/35798/26981&quot;&gt;utility&lt;/a&gt; and ignoring them is irrational).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The actual question...&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;How would people like to deal with this concern. I'm interested in responses that answer the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;How do we define a valid submission (must cover the above concerns, either resolving or presenting a case for their insignificance) in C# (though comments regarding other languages with similar concerns are welcome)?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;How and to what extent do we enfore any new rulings?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Do we except existing answers?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I'll ignore here the issues of functions needing &lt;code&gt;using&lt;/code&gt; directives, and library references, etc.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples (for reference in any discussion, feel free to add more...)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example A:&lt;/strong&gt; something which I think the community currently would think is fine (source: &lt;a href=&quot;https://codegolf.stackexchange.com/a/103672/26981&quot;&gt;https://codegolf.stackexchange.com/a/103672/26981&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;n=&amp;gt;{var s=&quot;&quot;;for(int i=0,j;i&amp;lt;n;)for(j=++i;j&amp;gt;0;)s+=j--;return s;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example B:&lt;/strong&gt; something which I think the community currently isn't sure about, but would err on the side of rejection (source: &lt;a href=&quot;https://codegolf.stackexchange.com/a/103692/26981&quot;&gt;https://codegolf.stackexchange.com/a/103692/26981&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;f=n=&amp;gt;{int x=n;var r=&quot;&quot;;while(n&amp;gt;0)r+=n--;return x&amp;gt;0?f(x-1)+r:&quot;&quot;;};&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example C:&lt;/strong&gt; classic 'test' code for Example A, and what I would consider a good (i.e. by my proposal &lt;em&gt;valid&lt;/em&gt;) version of Example A &lt;em&gt;(note semi-colon at end also)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;System.Func&amp;lt;int,string&amp;gt;q=n=&amp;gt;{var s=&quot;&quot;;for(int i=0,j;i&amp;lt;n;)for(j=++i;j&amp;gt;0;)s+=j--;return s;};&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example D:&lt;/strong&gt; classic 'test' code for Example B, and what I would consider a good (i.e. by my proposal &lt;em&gt;valid&lt;/em&gt;) version of Example B &lt;em&gt;(note semi-colon at end also)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;System.Func&amp;lt;int,string&amp;gt;f=null;f=n=&amp;gt;{int x=n;var r=&quot;&quot;;while(n&amp;gt;0)r+=n--;return x&amp;gt;0?f(x-1)+r:&quot;&quot;;};&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example E:&lt;/strong&gt; boiler plate we can assume for something going into a class&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;/*usings here perhaps?*/&#xA;&#xA;class LONGCLASSNAMETHATWONTCLASH&#xA;{&#xA;    /*submission here*/&#xA;&#xA;    /*calling code (in a method or w/e)*/&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example F:&lt;/strong&gt; boiler plate we can assume for something going into a method&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;class ANOTHERLONGCLASSNAMETHATWONTCLASH&#xA;{&#xA;    void LONGMETHODNAMETHATWONTCLASH()&#xA;    {&#xA;        /*submission code*/&#xA;&#xA;        /* calling code */&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example G:&lt;/strong&gt; what I would consider a good (i.e. by my proposal &lt;em&gt;valid&lt;/em&gt;) version of Example A which requires direct calling&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;(System.Func&amp;lt;int,string&amp;gt;)(n=&amp;gt;{var s=&quot;&quot;;for(int i=0,j;i&amp;lt;n;)for(j=++i;j&amp;gt;0;)s+=j--;return s;})&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example H:&lt;/strong&gt; boiler plate for calling an anonymous well-typed method (e.g. Example G)&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;// taken to be in a method&#xA;var result = (/*submission here*/)(/*arguments*/);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(puts the result into a variable so it can used for anything, it doesn't matter what - note that the compiler knows the type, hence &lt;code&gt;var&lt;/code&gt; works here, and that the extra parentheses save having to include them in the submission)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note: this is part of a broader concern about submitting code which simply doesn't compile. Generally, it seems wrong to have to put the code provided in any sort of 'environment' to get it running: when does this extra stuff stop being the 'environment' and start being code? We don't count the code required to call the compiler, but why not? C# is only meaningful if you compile it with the right compiler, etc.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note: this is something that has been discussed around a lot, but I can't find a satisfactory consensus. It's also something that most people seem not to care about too much, which is fine by me, but when I'm voting, I like to vote for answer which are creative, show a serious attempt at golfing (I can't just pull 5 bytes out of them without thinking), and comply with the rules: if the rules aren't defined, then I struggle to up-vote stuff. I do generally up-vote (and down-vote) C#, Java, PoSh, and even F# answers more than others, because I know them all well enough that I could have a serious go at golfing them if I could be bothered.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="26981" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2017-01-08T21:08:59.870" Title="C# Lambdas as Answers to questions asking for a Function" Tags="|discussion|c#|" AnswerCount="2" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="10976" PostTypeId="1" CreationDate="2016-12-19T19:25:14.563" Score="1" ViewCount="43" Body="&lt;p&gt;When I read through the help center recently, I was surprised how little some of the pages were related to this site, one example being &lt;a href=&quot;https://codegolf.stackexchange.com/help/promotion&quot;&gt;How to not be a spammer&lt;/a&gt;, which looks like it comes from Stack Overflow with only the site name changed. Is it possible to change big parts of the help center, as I don't think self-promotion is really even possible here or is it not possible to change the sites in the help center?&lt;/p&gt;&#xA;" OwnerUserId="59363" LastEditorUserId="68942" LastEditDate="2021-06-09T05:28:17.167" LastActivityDate="2021-06-09T05:28:39.913" Title="Help the Help Center" Tags="|discussion|help-center|" AnswerCount="0" CommentCount="0" ClosedDate="2016-12-19T19:36:41.240" ContentLicense="CC BY-SA 3.0" />
  <row Id="10977" PostTypeId="1" AcceptedAnswerId="10979" CreationDate="2016-12-19T19:34:47.643" Score="2" ViewCount="76" Body="&lt;p&gt;A recent challenge (&lt;a href=&quot;https://codegolf.stackexchange.com/q/102466/34718&quot;&gt;A Rather Knotty Conundrum&lt;/a&gt;) added the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/knot-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;knot-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;knot-theory&lt;/a&gt; tag. No previous knot theory challenges use this tag yet. Before I consider using the tag, I want to see if the tag is really necessary. This tag might make sense on Math.SE, but it seems pretty specific for our use on PPCG, and there are only three or four existing challenges that could deserve the tag:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/30292/knot-or-not&quot;&gt;&amp;quot;KNOT&amp;quot; or &amp;quot;NOT&amp;quot;?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/102466/a-rather-knotty-conundrum&quot;&gt;A Rather Knotty Conundrum&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/79650/gasket-weaving-draw-a-sierpi%c5%84ski-knot&quot;&gt;Gasket Weaving - draw a Sierpiński knot&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/50484/ascii-art-of-the-day-1-double-knot&quot;&gt;ASCII Art of the Day #1 - Double Knot&lt;/a&gt; (probably not)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Should we remove this tag, or keep it (and tag the existing challenges)?&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-12-19T19:57:57.497" Title="Do we not need [knot-theory]?" Tags="|discussion|tags|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10978" PostTypeId="2" ParentId="10977" CreationDate="2016-12-19T19:37:28.507" Score="-3" Body="&lt;h1&gt;It's not necessary. Remove it.&lt;/h1&gt;&#xA;&lt;p&gt;There are only a few related questions, and the existing questions receive few answers due to the complexity of the field and the programming required (each of the likely candidates has only a single answer.)&lt;/p&gt;&#xA;&lt;p&gt;Because of this, the tag is not necessary, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt; can be used instead.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-19T19:57:57.497" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10979" PostTypeId="2" ParentId="10977" CreationDate="2016-12-19T19:46:18.503" Score="7" Body="&lt;h2&gt;Keep it&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It's not doing any harm. The difficulty of the tagged challenges, or the number of answers they receive is irrelevant for whether the tag is useful. If someone &lt;em&gt;does&lt;/em&gt; answer one of those tough challenges, there's a good chance they're interested in the general topic and would like to find more of knot theory challenges. The tag helps them do exactly that, regardless of whether there's only 4 or 40 applicable challenges.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-12-19T19:46:18.503" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10980" PostTypeId="2" ParentId="10974" CreationDate="2016-12-19T20:56:16.550" Score="1" Body="&lt;h2&gt;Submission Validity&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;My proposal is that a function must be callable (this is generally agreed on meta) either 'directly' (e.g. (code)(arg1, arg2 ...) or by name (e.g. methodname(arg1, arg2 ...)) where the definition could be stuffed into a non-static class or method and called from within that class (assuming no name clashes).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that I make no distinction between 'typical' methods and 'anonymous' methods here (or even properties), because both must be named, and as such must be well typed. To be callable, the code must also be well typed, for example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(System.Func&amp;lt;int, int&amp;gt;)(a=&amp;gt;a+a)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;I would consider the outer parentheses to be necessary, and as such count towards the byte count, because while without them this can be assigned (&lt;code&gt;var q=(Func&amp;lt;int, int&amp;gt;)(a=&amp;gt;a+a);&lt;/code&gt;) it is not directly callable, or callable by any name.&lt;/s&gt; MartinEnder has made a case for not requiring the outer parenthese and they have as such been accouted for. This code fullfills the requirement of being unambiguous, and a well-defined boiler plate has been provided (Example &lt;strong&gt;H&lt;/strong&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consult Examples &lt;strong&gt;C&lt;/strong&gt;, &lt;strong&gt;D&lt;/strong&gt;, and &lt;strong&gt;G&lt;/strong&gt; for what I would consider valid solutions based on real-world examples.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that it could well be better to write a classic named function given the constrints, or use the new C#6 method syntax. &lt;em&gt;This will essentially render most uses of lambdas as the top-level code element redundant&lt;/em&gt; (I can't think of any exceptions). The a=&gt;a+a example above can be written thus in C# 6:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;int K(int a)=&amp;gt;a+a;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I don't see this as a problem, it is merely the consequence of having a well defined ruling on the matter which ensures the portability and fair comparison of C# answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I should like to bring attention to the fact that these rules pretty much gaurentee that any piece of C# supplied on PPCG can be pasted directly into a REPL and be expected to work.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Enforcement&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I would suggest that people should not upvote new invalid answers (however we define them), and leave comments to inform them of their dubious validity (and perhaps downvotes for people that should know better). I don't have a suggestion for how to deal with the abundance of answer that would be invalidated by such a ruling but to except them, though this will leave examples of 'bad practice' for new users to follow. I think this rulling is general enough to apply to other such decisions for other languages and platforms.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note: I will not post (many) other answers which disagree with this assessment, because the space of answers is large. Pleased down-vote, comment, and provide alternative suggestions if you do not agree.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="26981" LastEditorUserId="26981" LastEditDate="2017-01-08T20:45:36.860" LastActivityDate="2017-01-08T20:45:36.860" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10981" PostTypeId="2" ParentId="10938" CreationDate="2016-12-20T00:57:14.993" Score="3" Body="&lt;h2&gt;It's Alive&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Best answer in a difficult to program in language, such as Malbolge, Hexagony, or Fission.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Exactly copied from last year, though I'm marginally worried about the objectivity of this category.&lt;/p&gt;&#xA;" OwnerUserId="31625" LastActivityDate="2016-12-20T00:57:14.993" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10982" PostTypeId="2" ParentId="10938" CreationDate="2016-12-20T02:32:58.163" Score="15" Body="&lt;h1&gt;Against the Odds&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Best answer in a non-golfing language that is similarly short as golfing-language answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should be awarded to an answer that is short due to cleverness, rather than because the language happened to have an obvious built-in that solves the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Based on the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7939/14880&quot;&gt;2015 proposed category of the same name&lt;/a&gt;.)&lt;/p&gt;&#xA;" OwnerUserId="14880" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.683" LastActivityDate="2016-12-20T02:32:58.163" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10983" PostTypeId="2" ParentId="10938" CreationDate="2016-12-20T13:07:32.897" Score="6" Body="&lt;h1&gt;Most fitting language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Inspired by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8219/62824&quot;&gt;a bounty on meta&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This will be awarded to the user with the most entertaining, may it be coincidental or not, analogy in lanuage and question. For example, answer the question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/50320/me-want-honeycomb?s=7%7C0.0000&quot;&gt;Me want Honeycomb&lt;/a&gt; with the Hexagony language.&lt;/p&gt;&#xA;" OwnerUserId="62824" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-12-20T13:07:32.897" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="10984" PostTypeId="2" ParentId="10938" CreationDate="2016-12-20T13:08:25.830" Score="-7" Body="&lt;h1&gt;Best &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; challenge&lt;/h1&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2016-12-20T13:08:25.830" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10985" PostTypeId="1" AcceptedAnswerId="10986" CreationDate="2016-12-20T14:43:35.667" Score="4" ViewCount="90" Body="&lt;p&gt;I was reading &lt;a href=&quot;https://meta.stackexchange.com/questions/126829/what-is-serial-voting-and-how-does-it-affect-me&quot;&gt;What is serial voting and how does it affect me?&lt;/a&gt; on meta stackexchange, and I realised that when browsing through the recent code-golf submissions (as I do a few times a week) I often go through the posts and upvote good answers. A few people (&lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-ender&quot;&gt;Martin Ender&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/36398/luis-mendo&quot;&gt;Luis Mendo&lt;/a&gt;) provides very good solutions, almost on a daily basis, causing me to upvote them 5-6 times within a 10-minute period regulary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Will this cause any trouble for me or them, and do I risk that these votes gets blocked due to serial voting?&lt;/p&gt;&#xA;" OwnerUserId="56477" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2016-12-20T14:45:51.563" Title="Serial voting on PPCG" Tags="|support|voting|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="10986" PostTypeId="2" ParentId="10985" CreationDate="2016-12-20T14:45:51.563" Score="3" Body="&lt;p&gt;Probably not. 5-6 votes in 10 minutes usually isn't enough to be considered serial voting. Doing this over a long period of time might get the votes reversed, but you can always go back and re-vote (more slowly, with other votes interspersed) if it happens. The serial voting detection is usually smart enough to not trigger on someone upcoming a few users because they make good content that is worthy of upvotes.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2016-12-20T14:45:51.563" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10987" PostTypeId="2" ParentId="2140" CreationDate="2016-12-20T14:53:12.530" Score="1" Body="&lt;h1&gt;Rounding errors&lt;/h1&gt;&#xA;&lt;h2&gt;The task&lt;/h2&gt;&#xA;&lt;p&gt;round down a number (round to nearest, half-up), each time rounding one more decimal place, until it rounds the first digit. But every time a number gets rounded down more, make it choose wrongly to take the ceiling or the floor. So round to furthest, half down.&lt;/p&gt;&#xA;&lt;p&gt;If a number is rounded up and it results in carrying, carry just as you would normally.&lt;/p&gt;&#xA;&lt;p&gt;You can assume that the input will have 6 digits or less, and is in the boundaries of 0.00001 &amp;lt; n &amp;lt; 1000000.&#xA;so 123.4567, 1000000, 0.000005926 and -4 would all be invalid inputs.&lt;/p&gt;&#xA;&lt;p&gt;Let's look at the input 63.9308:&lt;br /&gt;&#xA;first, round to 3 places:&lt;br /&gt;&#xA;The last digit is 8. Usually it'd get rounded up, but here, nothing happens and it results in 63.930. Note that you need to keep the last zero.&lt;br /&gt;&#xA;0: round up: 63.94.&lt;br /&gt;&#xA;4: round up, and using basic math, the result is 64.0&lt;br /&gt;&#xA;0: round up: 65&lt;br /&gt;&#xA;5: round down: 60&lt;/p&gt;&#xA;&lt;p&gt;The output should have all the iterations of the rounding - input included. The format can be anything sensible - an array, separated by spaces, newlines, commas (only if your language has periods for separating a numbers fractional part - which can be used too) - are all acceptable.&lt;/p&gt;&#xA;&lt;p&gt;So the output for above could be &lt;code&gt;63.9308, 63.930, 63.94, 64.0, 65, 60&lt;/code&gt;, but is not forced to be.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;input: 167.54&#xA;output:&#xA;167.54&#xA;167.6&#xA;167&#xA;170&#xA;100&#xA;&#xA;input: 1&#xA;output:&#xA;1&#xA;&#xA;input: 123.456&#xA;output:&#xA;123.456&#xA;123.45&#xA;123.4&#xA;124&#xA;130&#xA;200&#xA;&#xA;input: 984.00&#xA;output:&#xA;984.00&#xA;984.1&#xA;985&#xA;980&#xA;900&#xA;&#xA;input: 314.911&#xA;output:&#xA;314.911&#xA;314.92&#xA;315.0&#xA;316&#xA;310&#xA;400&#xA;&#xA;input: 100.000&#xA;output:&#xA;100.01&#xA;100.1&#xA;101&#xA;11&#xA;2&#xA;input: 444.444&#xA;output: &#xA;444.444&#xA;444.45&#xA;444.4&#xA;445&#xA;440&#xA;500&#xA;&#xA;input: 555.555&#xA;output:&#xA;555.555&#xA;555.555&#xA;555.55&#xA;555.5&#xA;555&#xA;550&#xA;500&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your job is to write a program or function in the language of your choice. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest entry in every language wins.&lt;/p&gt;&#xA;&lt;h2&gt;sandbox&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;any better wording?&lt;/li&gt;&#xA;&lt;li&gt;anything I'm missing?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="59183" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-21T11:27:11.057" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="10988" PostTypeId="2" ParentId="10938" CreationDate="2016-12-20T15:19:41.910" Score="17" Body="&lt;h2&gt;SGITW&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For the best 2016 answer in a challenge which received no answers within 48 hours of posting. The challenge itself does not need to be from 2016 and the nominated answer doesn't need to be the first answer to the challenge, but the first answer to the challenge does need to be from 2016. Tips questions are not counted for this category.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's very easy to get drawn to the fast-rising HNQ-hitting questions with a plethora of answers, so I thought this would be a good way to bring attention to answers that really needed to earn their love.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;SEDE query: &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/605878/48-hour-gap&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://data.stackexchange.com/codegolf/query/605878/48-hour-gap&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="21487" LastEditorUserId="21487" LastEditDate="2016-12-20T21:08:43.460" LastActivityDate="2016-12-20T21:08:43.460" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10990" PostTypeId="2" ParentId="10938" CreationDate="2016-12-20T17:45:43.210" Score="28" Body="&lt;h2&gt;Not as simple as it looks&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This award goes to a high quality challenge (not necessarily &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;) that is easy to understand and looks simple at first glance, but where the best solutions are actually quite difficult to find.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The difficulty should be intrinsic to the problem, and not come from messy edge cases or strict formatting rules.&lt;/li&gt;&#xA;&lt;li&gt;The challenge should be fun to solve, and not &lt;em&gt;impossibly&lt;/em&gt; hard. Unanswered challenges may not be good candidates.&lt;/li&gt;&#xA;&lt;li&gt;The challenge may allow for simple solutions, but a competitive solution should be very intricate and/or not obvious at all.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="32014" LastEditDate="2016-12-20T17:58:44.863" LastActivityDate="2016-12-20T17:58:44.863" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="10991" PostTypeId="1" CreationDate="2016-12-20T19:24:33.880" Score="12" ViewCount="714" Body="&lt;p&gt;I noticed that &lt;a href=&quot;http://www.dangermouse.net/esoteric/piet.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Piet&lt;/a&gt; is not mentioned in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10145/how-to-count-bytes-faq&quot;&gt;How to count bytes FAQ&lt;/a&gt;. How should we determine the length of a piet program?&lt;/p&gt;&#xA;" OwnerUserId="41863" LastEditorUserId="68942" LastEditDate="2021-06-05T23:24:22.627" LastActivityDate="2021-06-05T23:24:22.627" Title="How to determine the length of a Piet program?" Tags="|discussion|code-golf|scoring|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="10994" PostTypeId="2" ParentId="10991" CreationDate="2016-12-20T19:33:09.980" Score="15" Body="&lt;h1&gt;Number of codels in the image&lt;/h1&gt;&#xA;&lt;p&gt;All codels in the image will be counted. This includes codels that are never visited, and black and white codels.&lt;/p&gt;&#xA;" OwnerUserId="41863" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-20T19:33:09.980" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="10995" PostTypeId="2" ParentId="2140" CreationDate="2016-12-20T20:02:12.927" Score="3" Body="&lt;h1&gt;ASCII addition&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Objective&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given two strings, your job is to:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Convert each character to their respective ASCII decimal value&lt;/li&gt;&#xA;&lt;li&gt;Concatenate the numbers into one large number&lt;/li&gt;&#xA;&lt;li&gt;Add these values together&lt;/li&gt;&#xA;&lt;li&gt;Get the ASCII characters represented of each pair of numbers starting from the right (or if there are not enough numbers, take a number alone)&lt;/li&gt;&#xA;&lt;li&gt;Leave unprintables (ie not in the range 32 - 126), and output the rest&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;An example for &lt;code&gt;HELLO&lt;/code&gt; and &lt;code&gt;WORLD&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;HELLO&quot;    + &quot;WORLD&quot;&#xA;H E L L O  + W O R L D&#xA;7269767679 + 8779827668&#xA;1 60 49 59 53 47    (separated to show ASCII conversion easily)&#xA;   &amp;lt;  1  ;  5  /    convert to ASCII by converting pairs to their respective characters (note: you start from the last pair)&#xA;&amp;lt;1;5/               output (note there is no 0x01) &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Notes&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each string will be a maximum of 6 characters long &lt;/li&gt;&#xA;&lt;li&gt;Input will always contain readable ASCII characters&lt;/li&gt;&#xA;&lt;li&gt;You have to take pairs of numbers from the end of the sum and convert each one of them to ASCII&lt;/li&gt;&#xA;&lt;li&gt;You &lt;strong&gt;must not&lt;/strong&gt; print unreadable characters if their values appear and instead skip them&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ABC + XYZ  //input&#xA;656667 + 888990&#xA;1 54 56 57&#xA;   6  8  9       //again 0x01 is left out&#xA;689      //output&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your submission can be either a program or a function&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the program with the shortest bytecount wins!&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox Questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are the specs clear enough?&lt;/li&gt;&#xA;&lt;li&gt;&lt;s&gt;Will this question give me hats?&lt;/s&gt;&lt;/li&gt;&#xA;&lt;li&gt;Any better title suggestions?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41805" LastEditorUserId="41805" LastEditDate="2017-07-19T12:48:07.907" LastActivityDate="2017-07-19T12:48:07.907" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="10996" PostTypeId="2" ParentId="10991" CreationDate="2016-12-20T20:14:52.557" Score="11" Body="&lt;h1&gt;Number of bytes in the image file&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We should stop making up new scoring schemes for programming languages, which only serves to make things more difficult. Code golf contests are scored in &lt;em&gt;bytes&lt;/em&gt;, so that's what matters. Everything else is artifical and prone to not take all details into account.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, scoring Piet submissions just by the number of codels doesn't take the shape into account; it considers 4x1, 2x2, and 1x4 images with the same codels the same program, which obviously isn't true.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2016-12-20T20:14:52.557" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="10999" PostTypeId="2" ParentId="2140" CreationDate="2016-12-21T10:44:01.847" Score="0" Body="&lt;h1&gt;Interweaved quine&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to create a program that, when run, returns itself as output (this is known as a quine). However, this quine must, when it is copied &lt;code&gt;n&lt;/code&gt; times, returns the quine, but with each of its characters duplicated in place &lt;code&gt;n&lt;/code&gt; times.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your original program is &lt;code&gt;Derp&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Derp -&amp;gt; Derp (must return itself as output to be a quine)&#xA;&#xA;DerpDerp -&amp;gt; DDeerrpp&#xA;(the &quot;Derp&quot; is copied twice, so each character in the output has to be copied twice)&#xA;&#xA;DerpDerpDerp -&amp;gt; DDDeeerrrppp&#xA;etc. etc.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules and Specs:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You are allowed to have leading and/or trailing newlines in your program.&lt;/li&gt;&#xA;&lt;li&gt;Your program must contain at least two distinct characters (which implies that your code must be at least 2 bytes long).&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4924/49561&quot;&gt;Standard quine rules&lt;/a&gt; apply.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2016-12-22T02:10:53.190" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11001" PostTypeId="1" CreationDate="2016-12-21T16:42:30.527" Score="16" ViewCount="512" Body="&lt;p&gt;Brought to meta on the basis that it's too drastic a change to make unilaterally or on the basis of three people discussing it in the comments of a different question...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The issue has been raised by the author of &lt;a href=&quot;https://codegolf.stackexchange.com/q/103684/194&quot;&gt;Busy Brain Beaver reboot&lt;/a&gt; that answers in Brainfuck are not permitted on &lt;a href=&quot;https://codegolf.stackexchange.com/q/18028/194&quot;&gt;Largest Number Printable&lt;/a&gt; because its restrictions include&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;You cannot use digits in your code (0123456789);&lt;/li&gt;&#xA;  &lt;li&gt;You can use any language in which digits are valid characters (so that not using them is a real restriction);&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That second restriction is really badly worded, but it does indeed seem to be intended as &quot;&lt;em&gt;You may only use a language in which digits have meaning (so that not using them is a real restriction)&lt;/em&gt;&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem is that this tends to push towards a forked situation where we have two questions which are identical apart from one not having the restriction (or inverting it, to avoid either being a technical dupe of the other). That's silly. And really the restriction seems silly too: if a language doesn't use digits to represent numbers, it's probably sufficiently verbose that the 100 character limit is a more painful restriction than avoiding digits is for Java.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I propose removing the language restriction, leaving the digit use restriction (and adding the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;).&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-12-23T02:00:04.453" Title="Should we open *Largest number printable* to all languages?" Tags="|discussion|specific-question|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11002" PostTypeId="1" AcceptedAnswerId="11003" CreationDate="2016-12-21T17:06:49.567" Score="8" ViewCount="182" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/103797/8478&quot;&gt;This recent quine challenge&lt;/a&gt; made me realise that we have a certain class of challenges that require answers to do something different each time they are run (at least for a finite amount of runs). This isn't &lt;em&gt;too&lt;/em&gt; common but it's a recurring challenge feature, so I thought it might be nice to have a tag for these, so people can seek them out if they like them, and also to make it immediately clear to people if a challenge has this property or not (which is likely impossible in many esoteric languages).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My first idea was &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-modification&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-modification&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-modification&lt;/a&gt; but these challenges don't &lt;em&gt;necessarily&lt;/em&gt; require self-modification. Function answers will usually keep track of some global state between invocations and even programs have other means to fulfil the goal, e.g. by keeping track of state in files, using &lt;code&gt;localStorage&lt;/code&gt; for browser languages, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/103797/8478&quot;&gt;Incremental Quine&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/38084/8478&quot;&gt;Monkey Island: The Head of the Navigator&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/103285/8478&quot;&gt;3... 2... 1... Crash off!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So, the questions are: Should we introduce a tag for these? What should it be called? What should the tag's scope be?&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2017-09-18T04:44:46.413" Title="Tag for challenges with stateful solutions" Tags="|discussion|tags|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11003" PostTypeId="2" ParentId="11002" CreationDate="2016-12-21T17:06:49.567" Score="16" Body="&lt;h2&gt;Let's create a [stateful] tag&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I propose a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stateful&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stateful&amp;#39;&quot; rel=&quot;tag&quot;&gt;stateful&lt;/a&gt; tag which should be generic enough that it isn't limited to self-modification but should encompass the general idea that running the program multiple times will result in different behaviour.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The most important thing that this &lt;em&gt;doesn't&lt;/em&gt; include is randomness and time-based behaviour. The behaviour should really depend on previous invocations of the solution (either how often it's been executed or which parameters it was executed with). One way to put it would be that given the same input (in the generalised sense, where the current time and a random number seed are considered inputs), the program will yield different results on multiple runs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One thing that I don't have a strong opinion about is whether challenges should solution &lt;em&gt;outputs&lt;/em&gt; a new solution (instead of quietly changing its own state). I'm leaning towards not including these though. I'd be happy about some discussion on this in the comments.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2016-12-21T17:06:49.567" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="11004" PostTypeId="2" ParentId="2140" CreationDate="2016-12-21T18:14:09.787" Score="1" Body="&lt;p&gt;&lt;code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;*TERM(1)                                                                   *TERM(1)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;NAME&lt;/strong&gt;&#xA;       Implement STAR&lt;code&gt;*&lt;/code&gt; term / create a mini-terminal - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&#xA;&lt;br/&gt;&lt;strong&gt;SYNOPSIS&lt;/strong&gt;&#xA;       $ ls&#xA;       proj/&#xA;       documents/&#xA;       notes.md&#xA;       $ cd documents&#xA;       $ cp proj/build build&#xA;       $ chmod 755 build&#xA;&lt;br/&gt;&lt;strong&gt;DESCRIPTION&lt;/strong&gt;&#xA;        - When you start up, overwrite the file &lt;code&gt;~/.*term&lt;/code&gt; to &lt;code&gt;~&lt;/code&gt;&#xA;        - Take commands from stdin. When the user hits enter, run &#xA;              &lt;i&gt;bash&lt;/i&gt; -c &quot;cd $(cat ~/.*term);&amp;lt;escaped command&gt;;echo $PWD &gt; ~/.*term&quot;&#xA;        - Pipe output to stdout. Once the command finishes, accept another command&#xA;        - &lt;code&gt;$ &lt;/code&gt; is the terminal prompt.&#xA;        - You need not support colors or bold&#xA;        - Do &lt;strong&gt;not&lt;/strong&gt; display the current directory&#xA;        - Italisiced text is configurable and replaceable. See the &lt;strong&gt;CONFIG&lt;/strong&gt; section&#xA;        - You may run a different command if it reproduces the same behavior&#xA;        - If you receive any command that matches &lt;code&gt;\s?exit\s?(\d)?\s?&lt;/code&gt;, exit.&#xA;        - If the capturing group is present, exit with that exit code.&#xA;&lt;br/&gt;&lt;strong&gt;CONFIG&lt;/strong&gt;&#xA;        - Located in &lt;code&gt;~/.*termrc&lt;/code&gt;&#xA;        - A single line that says the alternate shell to run&#xA;        - &lt;code&gt;bash&lt;/code&gt; if unspecified or empty. (or if the file doesn't exist)&#xA;&lt;br/&gt;&lt;strong&gt;OPTIONS&lt;/strong&gt;&#xA;        &lt;code&gt;-c &amp;lt;file&amp;gt;&lt;/code&gt; - use the following file as the config file&#xA;        - If the file doesn't exist, exit with code 1 and print &#xA;              *term: {...}: No such file or directory&#xA;        - Replace {...} with the given filename&#xA;        - If no filename is given, output:&#xA;              *term: -c requires an argument&#xA;        - You can let undefined behavior occur if the arguments don't match &lt;code&gt;(?:-c \w?)?&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="41088" LastEditorUserId="41088" LastEditDate="2016-12-22T15:54:32.013" LastActivityDate="2016-12-22T15:54:32.013" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="11005" PostTypeId="2" ParentId="11001" CreationDate="2016-12-21T18:33:08.230" Score="-10" Body="&lt;p&gt;First I want to say I do think prohibiting languages without digits is a fairly stupid rule. But what's wrong with that? If the author wanted his contest to be this way, people don't have to participate. And if they don't the question will disappear from the front page fairly quickly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Second I want to ask why we can't have an almost identical question but specifically for brainfuck. I think it's weird to allow multiple languages because this makes the question inherently unbalanced. And in a contest where all languages are allowed it is simply impossible to win with brainfuck because the language is so much less powerful then C or so. You would have to have a different character limit for every language. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please don't down vote this post because you don't agree with it. Just tell me why you don't agree.&lt;/p&gt;&#xA;" OwnerUserId="63550" LastEditorUserId="63550" LastEditDate="2016-12-21T21:15:23.263" LastActivityDate="2016-12-21T21:15:23.263" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11008" PostTypeId="1" AcceptedAnswerId="11010" CreationDate="2016-12-22T13:24:10.107" Score="0" ViewCount="94" Body="&lt;p&gt;In challenges like this: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world/104064#104064&quot;&gt;&amp;quot;Hello, World!&amp;quot;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;it is possible to answer using HTML. Everywhere else it is possible to answer the code golf using HTML, is it allowed?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;According to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9770/is-html-css-a-programming-language&quot;&gt;this post&lt;/a&gt; CSS is allowed but they never answered HTML&lt;/p&gt;&#xA;" OwnerDisplayName="user44904" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2016-12-22T13:57:31.830" Title="Does HTML count as a programming language?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ClosedDate="2016-12-22T16:11:42.610" ContentLicense="CC BY-SA 3.0" />
  <row Id="11010" PostTypeId="2" ParentId="11008" CreationDate="2016-12-22T13:57:31.830" Score="0" Body="&lt;h1&gt;No, but you &lt;em&gt;can&lt;/em&gt; use HTML in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;.&lt;/h1&gt;&#xA;&lt;p&gt;As explained in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/3639/44713&quot;&gt;this consensus&lt;/a&gt; and explained &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2028/what-are-programming-languages#comment19797_7518&quot;&gt;here&lt;/a&gt; by Martin, &amp;quot;fixed-output&amp;quot; (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenges) do &lt;em&gt;not&lt;/em&gt; require programming languages to be solved.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-22T13:57:31.830" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11011" PostTypeId="1" AcceptedAnswerId="11013" CreationDate="2016-12-22T16:00:14.750" Score="13" ViewCount="262" Body="&lt;p&gt;Earlier I noticed that the challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/104023/we-are-number-one-but&quot;&gt;'&lt;strong&gt;We are Number One, But...&lt;/strong&gt;'&lt;/a&gt; has been given the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/lyrics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;lyrics&amp;#39;&quot; rel=&quot;tag&quot;&gt;lyrics&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We've had a few lyric questions in the past, but the most significant was the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/6043/were-no-strangers-to-code-golf-you-know-the-rules-and-so-do-i&quot;&gt;&lt;strong&gt;challenge to print the lyrics to 'Never Gonna Give you Up'&lt;/strong&gt;&lt;/a&gt;. Although that challenge has 200+ upvotes, new lyric challenges are frowned upon because most of the answers are the same: taking the compressed string, uncompressing it, and printing it. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Having the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/lyrics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;lyrics&amp;#39;&quot; rel=&quot;tag&quot;&gt;lyrics&lt;/a&gt; tag suggests that we want more challenge along this line - but most proposed lyric challenges get closed at duplicates of the Rick Astley one, because the answers will all be the same: string compression. Therefore, I ask, do we really need this tag, or should it be deleted?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Arguments for:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Different songs have different lyrics, whose patterns can be exploited differently, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/64198/99-bottles-of-beer&quot;&gt;99 bottles of beer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;The lyrics tag allows people who enjoyed the challenge to find similar challenges&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Arguments against:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Challenges involving printing lyrics often all use the same, uninteresting tactics. Having the lyric tag suggests we want more like this.&lt;/li&gt;&#xA;&lt;li&gt;We already have the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; tag for producing constant output.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Update&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As the 'NO' answer had 15 upvotes, and there was no answer suggesting we should keep it, I've removed the tag from the challenge it was put on.&lt;/p&gt;&#xA;" OwnerUserId="60919" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2016-12-26T11:17:55.353" Title="Do we need the [lyrics] tag?" Tags="|discussion|tags|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11013" PostTypeId="2" ParentId="11011" CreationDate="2016-12-22T16:26:38.400" Score="22" Body="&lt;h1&gt;NO&lt;/h1&gt;&#xA;&lt;p&gt;Let's delete the tag once and for all&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;First of all, as stated in the question:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Challenges involving printing lyrics often all use the same, uninteresting tactics. Having the lyric tag suggests we want more like this.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Most often, the tactics in the answers include converting the lyrics into another base and then decoding it (boring!). In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/6043/were-no-strangers-to-code-golf-you-know-the-rules-and-so-do-i&quot;&gt;We're no strangers to code golf, you know the rules, and so do I&lt;/a&gt;, &lt;strong&gt;all&lt;/strong&gt; of the answers use base-conversion. Some other times there are answers with storing a part of the string and duplicating it, performing replacement, blah blah blah. This does not bring out amazing golfs and new tactics most of the times. If all we are going to see are the same questions (that take little to &lt;em&gt;no&lt;/em&gt; effort at all to make) with the same type of answers (just written in different languages), I don't see why this should be encouraged.&lt;/p&gt;&#xA;&lt;p&gt;Keeping this tag will only encourage users (especially newer users since these challenges take the least effort) to post more of these challenges. That is why it should be deleted right away.&lt;/p&gt;&#xA;&lt;h3&gt;Edit:&lt;/h3&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/lyrics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;lyrics&amp;#39;&quot; rel=&quot;tag&quot;&gt;lyrics&lt;/a&gt; tag is now deleted. Let's rejoice!&lt;/p&gt;&#xA;" OwnerUserId="41805" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-26T11:17:55.353" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11014" PostTypeId="2" ParentId="2140" CreationDate="2016-12-22T20:36:59.933" Score="0" Body="&lt;h1&gt;ASCII TIE-Fighter Fleet Stereogram&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stereogram&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stereogram&amp;#39;&quot; rel=&quot;tag&quot;&gt;stereogram&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;ASCII Sterograms are pretty rare and there's been quite a few &lt;a href=&quot;http://www.chris.com/ascii/index.php?art=art%20and%20design/stereograms&quot; rel=&quot;nofollow noreferrer&quot;&gt;noteable ones&lt;/a&gt; that I've seen. However, there is one that I've had the most success with and it's also one of the more simple ones. I used to send this one to people on AIM way back when that existed. View the picture below, notice that it's 3 separate lines of &amp;quot;TIE-Fighters&amp;quot;. For one to view the fleet in 3D, they must try to make 4 lines out of the 3 lines by crossing their eyes just enough to get it to line up perfectly. Once you see four lines the TIE Fighters should seem to &amp;quot;pop out&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Give it try:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;      (-O-)      (-O-)      (-O-)&#xA;     |-O-|       |-O-|       |-O-|&#xA;    (-O-)        (-O-)        (-O-)&#xA;   |-O-|         |-O-|         |-O-|&#xA;  (-O-)          (-O-)          (-O-)&#xA; |-O-|           |-O-|           |-O-|&#xA;(-O-)            (-O-)            (-O-) &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If you can't see what I'm talking about, try being extremely close to your monitor while viewing it. If that doesn't work, try transferring it to a notepad using &amp;quot;Courier&amp;quot; as the font. If you can't see it at all, then I apologize to you for getting your hopes up.&lt;/p&gt;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge is to take in a number &lt;code&gt;100 &amp;gt; n &amp;gt; 3&lt;/code&gt; and output that many rows of TIE fighters. The fighters must be centered as shown in the example art and must alternate between the following patterns,&#xA;&lt;code&gt;(-o-)&lt;/code&gt; and &lt;code&gt;|-o-|&lt;/code&gt; starting with &lt;code&gt;(-o-)&lt;/code&gt;. Columns should be separated initially by 6 spaces, increasing by 1 each iteration to create the forced perspective we're looking for.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; lowest byte-count wins.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-22T20:36:59.933" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11015" PostTypeId="2" ParentId="2140" CreationDate="2016-12-22T20:56:49.800" Score="1" Body="&lt;h1&gt;Irradiate The Input&lt;/h1&gt;&#xA;&lt;p&gt;There are a number of challenges that require your code to be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/radiation-hardening&quot;&gt;radiation-hardened&lt;/a&gt;. That is, the code should still function if any character is removed. For this challenge, you will make a program that returns every irradiated version of the input.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;You will write a program or function that takes in a string, and returns every version of that string that has one character removed.&lt;/p&gt;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input     -&amp;gt; Outputs&#xA;&#xA;Hey, you! -&amp;gt; ey, you!&#xA;             Hy, you!&#xA;             He, you!&#xA;             Hey you!&#xA;             Hey,you!&#xA;             Hey, ou!&#xA;             Hey, yu!&#xA;             Hey, yo!&#xA;             Hey, you&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Outputs do not need to be in any order. Input and output may be in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods?answertab=votes#tab-top&quot;&gt;any reasonable format&lt;/a&gt;. The shortest program or function in each language wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="41863" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-22T20:56:49.800" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11016" PostTypeId="2" ParentId="2140" CreationDate="2016-12-22T23:50:02.523" Score="1" Body="&lt;h1&gt;Detect the Type of a Golfed Poem&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Find golfed poem type&lt;br&gt;&#xA;  One char for each syllable&lt;br&gt;&#xA;  Code and golf you must&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;A golfed poem is a poem where each syllable has been replaced by&#xA;a lowercase ASCII character (a-z). For example, here's the golf&#xA;of the haiku from above:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;fgpet&#xA;ocfesab&#xA;cagym&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Two lines are considered to rhyme if the last character is the same.&#xA;For example, this golfed poem is a rhyming couplet:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;kdilf&#xA;mlif&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;From this representation of a poem, detect its type -- haiku,&#xA;rhyming couplet, limerick, or free verse.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that takes a golfed poem and outputs its&#xA;type.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are 4 types of poems:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Haikus have 3 lines, with 5 syllables on the first and last lines&#xA;and 7 syllables on the middle line. Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;tilhk&#xA;tltilhk&#xA;tilhk&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Rhyming couplets have 2 lines that rhyme (the last characters are&#xA;the same). Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;tjfdojp&#xA;iuyrp&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Limericks have 5 lines. The first, second, and fifth lines rhyme, and&#xA;so do the third and fourth lines. Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;twayposa&#xA;wgmttba&#xA;bssott&#xA;asgbt&#xA;yiowosa&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Free verse poems are any poem that isn't one of the other poem&#xA;types. Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;rdtfghkhiojpoh&#xA;sfidjo&#xA;rapojgalh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Specs&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your program or function may receive the golfed poem as input through a&#xA;newline-separated string, an array, or whatever else fits your language.&#xA;You may assume that the input will only contain lowercase ASCII (&lt;code&gt;[a-z]+&lt;/code&gt;)&#xA;and newlines, and will not be empty.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program or function may output the poem type in any format; for example,&#xA;you may output the full name of the poem type (&lt;code&gt;haiku&lt;/code&gt;), the first letter&#xA;(&lt;code&gt;h&lt;/code&gt;), an identifying number (&lt;code&gt;0&lt;/code&gt;), or whatever you feel is golfiest.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;tilhk&#xA;tltilhk&#xA;tilhk&#xA;=&amp;gt; haiku&#xA;&#xA;piaop&#xA;iosjdps&#xA;aspke&#xA;=&amp;gt; haiku&#xA;&#xA;kelkeasdfawpioqweoijzpmdfoixnasey&#xA;asejfy&#xA;=&amp;gt; rhyming couplet&#xA;&#xA;paoiemasm&#xA;m&#xA;=&amp;gt; rhyming couplet&#xA;&#xA;auoijaoeutsiu&#xA;fequ&#xA;hsafd&#xA;athwjhd&#xA;poijhaliehllsu&#xA;=&amp;gt; limerick&#xA;&#xA;a&#xA;a&#xA;b&#xA;b&#xA;a&#xA;=&amp;gt; limerick&#xA;&#xA;awlefjsoea&#xA;oajfoa&#xA;aosiefj&#xA;qqwe&#xA;aijpojijeeeagf&#xA;iuytfg&#xA;afeavwevex&#xA;=&amp;gt; free verse&#xA;&#xA;b&#xA;=&amp;gt; free verse&#xA;&#xA;fjaios&#xA;oijeofyth&#xA;=&amp;gt; free verse&#xA;&#xA;iojov&#xA;ueytfas&#xA;miyk&#xA;=&amp;gt; free verse&#xA;&#xA;uuhawccaoisjdc&#xA;gyyufddc&#xA;ijjp&#xA;uuyrec&#xA;sddfac&#xA;=&amp;gt; free verse&#xA;&#xA;aoisjf&#xA;asiodjfopyt&#xA;sodim&#xA;oawijm&#xA;iiuuyytrtreertyut&#xA;=&amp;gt; free verse&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer wins.&#xA;Happy golfing!&lt;/p&gt;&#xA;" OwnerUserId="56755" LastActivityDate="2016-12-22T23:50:02.523" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11017" PostTypeId="2" ParentId="11001" CreationDate="2016-12-23T02:00:04.453" Score="11" Body="&lt;h1&gt;Yes, we should open it up to all languages.&lt;/h1&gt;&#xA;&lt;p&gt;Limiting languages is generally discouraged, even for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;, which is why we always have a few joke answers in Lenguage and similar.&lt;/p&gt;&#xA;&lt;p&gt;Not only that, but languages where numbers aren't present usually struggle with handling big numbers as well, &lt;em&gt;Good luck printing anything higher than 256 in BF&lt;/em&gt;, and most other languages, such as Mathematica, have plenty of constants to get the job done.&lt;/p&gt;&#xA;&lt;p&gt;I believe no language in which numbers aren't available are at an advantage, such, this should be opened to all languages.&lt;/p&gt;&#xA;" OwnerUserId="58375" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-23T02:00:04.453" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11018" PostTypeId="2" ParentId="10938" CreationDate="2016-12-23T03:08:46.520" Score="12" Body="&lt;h1&gt;Every byte counts&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is for an answer that is painstakingly optimized. The writer really had to roll up their sleeves and get their hands dirty to squeeze out every single byte. The answer is short (relatively speaking) not because of a nice trick, but because the writer put a lot of work into tightening it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Title suggestions welcome.)&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2016-12-23T03:08:46.520" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11019" PostTypeId="2" ParentId="2140" CreationDate="2016-12-23T06:16:03.243" Score="5" Body="&lt;h1&gt;A Game of Knights&lt;/h1&gt;&#xA;&lt;p&gt;In this King of the Hill, you control 10 Knights.  You need to surround your enemy before they surround you.&lt;/p&gt;&#xA;&lt;p&gt;Each Knight has 3 possible actions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Dash: Move 3 squares in a cardinal direction.  If there is a knight in your path, move as far as you can.&lt;/li&gt;&#xA;&lt;li&gt;Leap: Move 2 squares in a cardinal direction.  If there is a knight on your destination square, don't move at all.&lt;/li&gt;&#xA;&lt;li&gt;Push: Move 1 square in a cardinal direction.  If there is a knight on your destination square, and no knight or wall behind him, you both move 1 square.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Each round will have a &lt;strong&gt;Planning Phase&lt;/strong&gt; and then an &lt;strong&gt;Action Phase&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Planning:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;During the planning phase, players will alternate creating a plan until both players have created 10 plans.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;A plan consists of either an action type or a cardinal direction&lt;/strong&gt; (not both).&lt;/li&gt;&#xA;&lt;li&gt;A plan also includes the knight that will perform the action&lt;/li&gt;&#xA;&lt;li&gt;All plans are revealed to both players&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Action:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Actions occur in the same order that they were planned.&lt;/li&gt;&#xA;&lt;li&gt;If you planned an action type, you will be able to choose the direction.  If you planned a cardinal direction, you will be able to chose the action type you want.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;After the action phase, if any knights are on the same location they started at (at the start of the round) are captured and removed from the game.  You win by capturing all other knights.&lt;/p&gt;&#xA;&lt;p&gt;Other info:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Cardinal means North, East, South, or West&lt;/li&gt;&#xA;&lt;li&gt;The board is a 10x10 board.  Your knights start as a line at the bottom of the board.&lt;/li&gt;&#xA;&lt;li&gt;Walls block movement and cannot be pushed.&lt;/li&gt;&#xA;&lt;li&gt;You don't have to plan an action for every knight, and a knight can take multiple actions.&lt;/li&gt;&#xA;&lt;li&gt;There are a maximum of 1000 rounds.  After those 1000 rounds, the winner is the player with the most knights.  (A tie is allowed).&lt;/li&gt;&#xA;&lt;li&gt;The starting player for a game is randomized, and that player starts every round.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You have won the game when you opponent cannot make any mobility actions.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-23T23:53:20.947" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="11020" PostTypeId="2" ParentId="10938" CreationDate="2016-12-23T15:39:54.333" Score="-4" Body="&lt;h1&gt;Most Humorous&lt;/h1&gt;&#xA;&lt;p&gt;This answer had you cracking as you were reading through it.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-23T15:39:54.333" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11024" PostTypeId="2" ParentId="5243" CreationDate="2016-12-24T01:48:43.600" Score="-9" Body="&lt;h1&gt;500 reputation bounty - for cracking &lt;a href=&quot;https://codegolf.stackexchange.com/a/103475/46918&quot;&gt;this whitespace cop&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;As computers get faster and faster or other mathematical developements arise (sorry can't entirely give away the premise), this may become crackable. At any such time I will award the mathematical genius 500 reputation points.&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-24T01:48:43.600" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11027" PostTypeId="2" ParentId="2140" CreationDate="2016-12-24T03:56:17.230" Score="1" Body="&lt;p&gt;A game some people like to play on the train carriages where I live is to try to use the digits of the carriage number to make the number ten, by adding mathematical operations between the digits. For example, given the number 7392, you can make ten with 7 * 3 - 9 - 2 = 10.&lt;/p&gt;&#xA;&lt;p&gt;You can split the digits how you want E.g. 5646 -&amp;gt; 56 - 46 = 10, however you cannot change the order of digits. In this challenge, you are also limited to using only the following characters.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Brackets, &lt;code&gt;()&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Minus, &lt;code&gt;-&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Plus, &lt;code&gt;+&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Times, &lt;code&gt;×&lt;/code&gt; or &lt;code&gt;*&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Divide, &lt;code&gt;÷&lt;/code&gt; or &lt;code&gt;/&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The minus sign can be used for both subtraction and making numbers negative (e.g. -2 * 4 + 9 + 9). Operations are done in the standard order of operations.&lt;/p&gt;&#xA;&lt;h3&gt;INPUT&lt;/h3&gt;&#xA;&lt;p&gt;Input can be in any reasonable format, a single number, a string, an array of digits&lt;/p&gt;&#xA;&lt;h3&gt;OUTPUT&lt;/h3&gt;&#xA;&lt;p&gt;Your program must output a human readable solution, if one exists. If there is no solution, it must output nothing.&lt;/p&gt;&#xA;&lt;p&gt;Output must be a string representation of the expression that adds to 10. You do not need to include spaces (but you can if you want), and you can have extraneous brackets.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins&lt;/p&gt;&#xA;&lt;h3&gt;Sandbox&lt;/h3&gt;&#xA;&lt;p&gt;I haven't posted on ppgc before, so any feedback would be helpful!&lt;/p&gt;&#xA;" OwnerUserId="49746" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-24T03:56:17.230" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11028" PostTypeId="2" ParentId="2140" CreationDate="2016-12-24T05:14:25.757" Score="1" Body="&lt;h1&gt;Implement ALL of OEIS!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;...well, not &lt;em&gt;quite&lt;/em&gt; all of it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your job is to implement as many &lt;a href=&quot;http://oeis.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS&lt;/a&gt; sequences as you can in 50 bytes. You are to write a &lt;em&gt;single&lt;/em&gt; program that takes an integer &lt;strong&gt;k&lt;/strong&gt; as input and outputs A&lt;sub&gt;&lt;strong&gt;n&lt;/strong&gt;&lt;/sub&gt;(&lt;strong&gt;k&lt;/strong&gt;) for all sequence numbers &lt;strong&gt;n&lt;/strong&gt; implemented. You may write a function or program to do this. Here are some more rules:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Each sequence should work at least until the end of the sequence on OEIS.&lt;/li&gt;&#xA;&lt;li&gt;You may not implement two sequences that are the same.&lt;/li&gt;&#xA;&lt;li&gt;You do not have to start where the OEIS sequence starts. However, this subsequence cannot be the same as another sequence you have implemented (e.g. implementing &lt;a href=&quot;http://oeis.org/A001477&quot; rel=&quot;nofollow noreferrer&quot;&gt;A001477&lt;/a&gt;(&lt;strong&gt;n&lt;/strong&gt;) and &lt;a href=&quot;http://oeis.org/A000027&quot; rel=&quot;nofollow noreferrer&quot;&gt;A000027&lt;/a&gt;(&lt;strong&gt;n&lt;/strong&gt;), since A000027(&lt;strong&gt;n&lt;/strong&gt;) == A001477(&lt;strong&gt;n&lt;/strong&gt; + 1), and would constitute such a shift described.&lt;/li&gt;&#xA;&lt;li&gt;The numbers may be yielded in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods?answertab=votes#tab-top&quot;&gt;any acceptable way&lt;/a&gt;. The only requirements on the output are:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each entry must be separated by (not necessarily constant) non-numeric characters. If applicable: if your sequence has negative numbers, this separator cannot whatever you choose to represent a negative number.&lt;/li&gt;&#xA;&lt;li&gt;Each number must be outputted in decimal&amp;mdash;i.e., they must appear as they are in the OEIS sequence.&lt;/li&gt;&#xA;&lt;li&gt;The ordering of each sequence in the output must be consistant. E.g., if &lt;code&gt;A001477&lt;/code&gt; appears as the first result for &lt;strong&gt;n&lt;/strong&gt; = 0, then it should appear as the first result for all other &lt;strong&gt;n&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;For example, the following Ruby script implements A001477 and &lt;a href=&quot;http://oeis.org/A004086&quot; rel=&quot;nofollow noreferrer&quot;&gt;A004086&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a=gets;puts a.to_i,a.reverse&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;50 sounds good, but might be unfair on a per-language basis. I doubt you could get many encoded in, say, Java. Should the limit be raised?&lt;/p&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2016-12-24T20:16:47.053" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11029" PostTypeId="2" ParentId="2140" CreationDate="2016-12-24T11:37:21.153" Score="1" Body="&lt;h1&gt;Polyglot OEIS &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to create a polyglot, which in each language, take an integer in input and return the n-th term in an OEIS sequence chosen for the language.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can't use a sequence already used for another language in your submission.&lt;/li&gt;&#xA;&lt;li&gt;You must use 2+ languages.&lt;/li&gt;&#xA;&lt;li&gt;You can't use a linear sequence.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The score is calculated as &lt;code&gt;length / num_languages³&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="53745" LastEditorUserId="53745" LastEditDate="2016-12-24T14:38:21.817" LastActivityDate="2016-12-24T14:38:21.817" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11033" PostTypeId="1" AcceptedAnswerId="11058" CreationDate="2016-12-25T14:34:52.580" Score="15" ViewCount="496" Body="&lt;p&gt;Consider the following example challenge:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Given a set of integers, output a truthy value if there is a non-empty subset whose sum equals 0, or a falsey value if no such subset exists. Solutions must have worst-case polynomial time complexity or better.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is the &lt;a href=&quot;https://en.wikipedia.org/wiki/Subset_sum_problem&quot; rel=&quot;nofollow noreferrer&quot;&gt;subset sum problem&lt;/a&gt;, which is NP-complete. Thus, the existence or non-existence of a polynomial-time solution depends on the answer to the &lt;a href=&quot;https://en.wikipedia.org/wiki/P_versus_NP_problem&quot; rel=&quot;nofollow noreferrer&quot;&gt;P versus NP problem&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another example that doesn't depend on P versus NP is this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Given two strings, compute their edit distance. Solutions must have sub-quadratic worst-case time complexity.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It's an open question in computer science whether or not a sub-quadratic algorithm for computing the edit distance exists.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are a few more examples, suggested by Martin:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A language-specific challenge where it's unknown if it's possible to solve the challenge in that language (e.g. non-Turing-complete languages)&lt;/li&gt;&#xA;&lt;li&gt;Solving a puzzle where it is not known if there is a solution&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Are challenges of this nature within the scope of PPCG?&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2016-12-26T14:18:21.960" LastActivityDate="2016-12-27T05:03:06.823" Title="Are challenges that may not be solvable on-topic for PPCG?" Tags="|discussion|policy|scope|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11034" PostTypeId="2" ParentId="2140" CreationDate="2016-12-25T14:44:36.930" Score="1" Body="&lt;h1&gt;Prove your language is Turing Complete &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A programming language is said to be Turing complete if it can simulate a single taped Turing machine. (&lt;a href=&quot;https://en.wikipedia.org/wiki/Turing_completeness&quot; rel=&quot;nofollow noreferrer&quot;&gt;from Wikipedia&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In this popularity contest, your task is to design and create a program in your favorite language to prove that it is Turing complete.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can do this in several ways, such as:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Simulating a &lt;em&gt;universal Turing machine&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;Running TC cellular automata such as &lt;em&gt;Rule 110&lt;/em&gt; or &lt;em&gt;Game of Life&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;Interpreting OR self-compiling into a minimalistic esoteric language that has been proven to be TC, such as &lt;em&gt;Brainfuck&lt;/em&gt; or &lt;em&gt;///&lt;/em&gt; (slashes)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;...but feel free to prove it in any other way you can! These are just examples. As long as you create a program which is &lt;strong&gt;conclusive proof&lt;/strong&gt; that your language is TC, it is a valid submission.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As this is a pop-con the winner is the answer with the largest score (upvotes - downvote). You will most likely be rewarded by voters for &lt;strong&gt;creativity&lt;/strong&gt; and &lt;strong&gt;cleverness&lt;/strong&gt; - perhaps using an extremely hard-to-use language, or an obscure method to prove Turing completeness.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The submission must be a &lt;em&gt;program&lt;/em&gt;: simply saying &quot;these commands are equivalent to these brainfuck commands&quot; is not a valid answer.&lt;/li&gt;&#xA;&lt;li&gt;Any programs you write must be your own. If not, you should mark your post as community wiki.&lt;/li&gt;&#xA;&lt;li&gt;Just using &lt;code&gt;eval&lt;/code&gt; or similar to self-interpret is banned, simply because it's not interesting or clever.&lt;/li&gt;&#xA;&lt;li&gt;Only Turing Complete languages may be used - for obvious reasons.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cellular-automata&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cellular-automata&amp;#39;&quot; rel=&quot;tag&quot;&gt;cellular-automata&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox Questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this too broad? I assume there's going to be a lot of mixed feedback, as always with pop-cons.&lt;/li&gt;&#xA;&lt;li&gt;Are there any rules I should add?&lt;/li&gt;&#xA;&lt;li&gt;Which tags apply to this?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="60919" LastEditorUserId="60919" LastEditDate="2016-12-26T15:16:42.613" LastActivityDate="2016-12-26T15:16:42.613" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="11038" PostTypeId="1" CreationDate="2016-12-25T22:45:24.543" Score="2" ViewCount="165" Body="&lt;p&gt;Assume the challenge:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Print any prime &lt;strong&gt;n&lt;/strong&gt; whose &lt;strong&gt;n-1&lt;/strong&gt; is also a prime.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It's obvious that &lt;code&gt;3&lt;/code&gt; is the only output. However, specified in the rules:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Hardcoding &lt;code&gt;3&lt;/code&gt; as output is forbidden.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Does it make any sense to ask these kind of questions, that will make the code calculate something, but for no reason?&lt;/p&gt;&#xA;" OwnerUserId="62824" LastActivityDate="2017-01-16T20:40:29.127" Title="Is it okay to write a challange that has an obvious output?" Tags="|discussion|" AnswerCount="3" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11039" PostTypeId="2" ParentId="11038" CreationDate="2016-12-25T23:23:02.950" Score="8" Body="&lt;h1&gt;Avoid this as much as possible&lt;/h1&gt;&#xA;&lt;p&gt;It's &lt;em&gt;OK&lt;/em&gt; in the sense that it doesn't break any rules. However it's very lazy and doesn't make a good challenge. In general if you don't want hard coding and it's possible to hard code your output (or even inputs) then your challenge has some serious issues.&lt;/p&gt;&#xA;&lt;p&gt;You should try to either&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Change your challenge so that hard coding is not feasible or competetive. For example, printing every prime under 10 is &lt;em&gt;waaaay&lt;/em&gt; too easy to hard code, but printing every prime under 2 million is not.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Or make it impossible to hard code the output/input. For example, a challenge like&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Given a and b, print every prime number less that b such that &lt;code&gt;n-a&lt;/code&gt; is a also prime.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Could not be hardcoded. (Both of these challenges are hypothetical. Either one could be considered a duplicate)&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-16T20:40:29.127" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11040" PostTypeId="2" ParentId="11038" CreationDate="2016-12-26T00:29:17.547" Score="-2" Body="&lt;h1&gt;These challenges should be disallowed&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(Similar to the other answer here, but stronger.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The only way to make this sort of challenge interesting is to make them a &quot;do X without Y&quot; style of challenge, but I don't see how it's possible to define Y in an objective way. In general, they should be modified to take a parameter to the algorithm in such a way that hardcoding the output becomes impossible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Exception: If the requested output is fairly long and likely to be compressible in an interesting way, the challenge is possibly workable as a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; (in which hardcoding is &quot;disallowed&quot; via ensuring that a non-hardcoded answer will be shorter and thus get a better score).&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2016-12-26T00:29:17.547" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11044" PostTypeId="2" ParentId="10893" CreationDate="2016-12-26T09:25:42.897" Score="5" Body="&lt;h1&gt;This is programming&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;One key question that needs to be answered here, which the other upvoted answer does not address is: Is this programming, for the purpose of this site?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Clearly, we're not going to allow arbtirary puzzles or games or what have you, there are other sites for that. That being said, this challenge has a variety of features which put it in the programming camp:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Rigorously simulable - anyone can check the results.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Complex input-output relationship. Different arrangements of components can have all sorts of effects.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;(Optional, but a nice bonus) Directly related to the wider world of programming through the world of circuitry design.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is programming in exactly the same sort of way that Brainfuck is: With enough time and effort, you could do anything that a full computer could do.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2016-12-26T09:25:42.897" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11045" PostTypeId="1" CreationDate="2016-12-26T09:48:26.023" Score="11" ViewCount="200" Body="&lt;p&gt;Sometimes, very low quality questions are asked on the site, that are nevertheless within the rules for what's acceptable on the site. I'm thinking of questions like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Print the largest square in the Fibonacci sequence. Shortest code wins.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is just asking for a hardcoded &lt;code&gt;144&lt;/code&gt;. Or for another example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Print all primes from 1 to 10. Fastest code wins.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Let's assume for the sake of the argument that these questions are not duplicates.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What often happens with these questions is that they will get a large number of answers very quickly, as people rush to be the first to answer with an obvious solution in their language of choice. I think it would be better for site quality if these questions were closed or improvement.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On other sites, a typical course of events when very low quality questions are asked is that the question is edited into something conforming to the standards of the site. With questions such as these, it doesn't seem possible to improve the questions to the expected quality without change the challenge requirements, which is frowned on on this site in general, and specifically in the case when a number of people have already answered, which is particularly problematic when the above scenario with lots of quick answers plays out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My preferred solution would be to close such questions by giving a reason specific to PPCG, something like &quot;This challenge is closed because it is not up to the standards of challenges on this site, please see here for our standards and here for the Sandbox.&quot; We have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges&quot;&gt;this&lt;/a&gt;, which is related, but more like suggestions than requirements.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What do other people think? Is this a problem worth addressing? Should we create such a set of standards for challenge quality and direct people to them? Is there a better way to handle this situation?&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2016-12-26T14:14:12.180" Title="What should we do with very low quality questions?" Tags="|discussion|challenge-quality|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="11046" PostTypeId="2" ParentId="11045" CreationDate="2016-12-26T14:14:12.180" Score="2" Body="&lt;p&gt;Creating an objective set of standards would be nigh-impossible. What we can do (and have done) is downvote the low-quality challenges, and close them as duplicates of better challenges.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2016-12-26T14:14:12.180" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11047" PostTypeId="1" CreationDate="2016-12-26T15:16:10.193" Score="9" ViewCount="175" Body="&lt;p&gt;I would like to make a challenge that involves English words. Because we want all challenges to be self-contained, I'd have to stuff the huge file into a code block, and let people copy-paste it to use it. However, because there are so many words in English, the system won't let me put so much text into a post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I see that &lt;a href=&quot;https://codegolf.stackexchange.com/q/70551/25315&quot;&gt;this question&lt;/a&gt; used an external link, while &lt;a href=&quot;https://codegolf.stackexchange.com/q/57659/25315&quot;&gt;this question&lt;/a&gt; used another one. Should I reuse one of these links?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7871/25315&quot;&gt;This answer&lt;/a&gt; to a similar question recommends Github, while &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7872/25315&quot;&gt;this answer&lt;/a&gt; recommends Pastebin. I have never used either, so I don't understand the advantages of each.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition, maybe we can use the same system that lets us insert images into our posts - it doesn't limit the file's size, right?&lt;/p&gt;&#xA;" OwnerUserId="25315" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-12-30T12:36:06.453" Title="How can I use a list of English words in a challenge?" Tags="|discussion|challenges|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11049" PostTypeId="2" ParentId="2140" CreationDate="2016-12-26T17:16:39.273" Score="0" Body="&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;Tic-Tac-Toe is a solved game. It is possible on current hardware to generate a complete game tree using the minimax algorithm. However, doing so is CPU and memory intensive. There are various ways of generating an incomplete game tree that will still solve the game using, for example, sorting, pruning, lookup tables and other means.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to code a function that, given a particular game state, will construct a game tree and &amp;quot;solve&amp;quot; the game. Your function is expected to return the best possible move given the current game state and also output the game tree, along with a total count of the nodes constructed, to the console. The objective is to generate the smallest tree, by node count, while still solving the game. The function must accept at least two arguments. 1) a string representing the game state. 2) an integer representing who's turn it is to play.&lt;/p&gt;&#xA;&lt;p&gt;The winning entry will be the one that generates the least amount of nodes while still solving the game. If there is a tie, the function that was submitted first will win, unless the subsequent entry can be shown to run 25% faster. Scoring (number of nodes), will be done only with the input given in the input example below. Note that your function is still expected to work properly given any valid tic-tac-toe game state.&lt;/p&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;The first agument passed to the function is the game state. It is represented by a string of 9 comma seperated integers. Each integer represents the state of a square on the tic-tac-toe board sequentially. &lt;code&gt;0&lt;/code&gt; reprensents an empty square, &lt;code&gt;1&lt;/code&gt; a square with an X and &lt;code&gt;-1&lt;/code&gt; a square with an O.&lt;/p&gt;&#xA;&lt;p&gt;The second argument is the player who's turn it is to make the next move. It is an integer where &lt;code&gt;1&lt;/code&gt; means player X and &lt;code&gt;-1&lt;/code&gt; means player O.&lt;/p&gt;&#xA;&lt;p&gt;Input example:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&amp;quot;0,0,0,1,0,0,-1,0,0&amp;quot;, 1&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This example input represents the following game sate, with player X making the next move:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/2LPsy.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/2LPsy.jpg&quot; alt=&quot;Tic-Tac-Toe board&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;p&gt;The function will return an integer &lt;code&gt;0-8&lt;/code&gt; representing the next move.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;4&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The function must also output the game tree to the console and how many nodes were created.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/kT517.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/kT517.jpg&quot; alt=&quot;Console&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Final instructions&lt;/h1&gt;&#xA;&lt;p&gt;If you end up using look-up tables, they must be empty to begin with and be generated as the tree is being created/traversed.&lt;/p&gt;&#xA;&lt;p&gt;Node values should be dependant on children terminal/leaf node actual values. Your are not allowed to use some kind of heuristic or simulation to evaluate a node. If a tree branch is not expanded all the way to terminal nodes, it must be because the algorithm figured out that it would be useless to do so or because it has already come across the same game state node elsewhere in the tree and can use that information instead of expanding further.&lt;/p&gt;&#xA;" OwnerUserId="63760" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-26T17:16:39.273" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11050" PostTypeId="2" ParentId="2140" CreationDate="2016-12-26T18:29:31.943" Score="1" Body="&lt;h2&gt;Sheet music exact transposition&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As we're limited to ASCII here, I'll just refer to the notes by name A-G, although obviously real sheet music has a range of about an octave and a half even before you take ledger lines into account.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Notes are written on sheet music in two ways. Most of the time, notes have their own position on the stave, but no accidental is indicated; this means that the note gains the accidental corresponding to the key signature. For example, the scale of A is ABCDEFGA; the C, F and G are played sharp because of the key signature. These notes are easy to transpose, because you simply need to shift them by the appropriate number of note names; the accidental is taken care of by the key signature. For example, the scale of A is simply ABCDEFGA; if you transpose down two notes, you get the scale of F, FGABCDEF; in this case the C, F and G become natural and the B becomes flat, but there's nothing extra for you to do here because the key signature takes care of it. This works even if the key itself contains accidentals; transposing the scale DEFGABCD from D♭ to D♯ simply results in DEFGABCD again.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For notes that are not available in the key signature, an accidental needs to be applied. This is either the ♮, indicating that an accidental in the key signature (or previously used for that note, but that's not relevant here) should be ignored, or one or more of either ♭ or ♯, indicating how many semitones the note should be adjusted. (Although an accidental exists for ♯♯, we will ignore this to simplify the challenge).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can't just throw accidentals around, otherwise you end up with the scale of E written as F♭E♯♯A♭A♮C♭B♯♯F♭♭E which is ridiculous. It is therefore essential when you transpose a note that the note name is transposed identically no matter how many accidentals the note may have.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, there is a caveat: the named intervals are not regular. The interval between B and C and that between E and F are just one semitone, while the other intervals are two. This means that you might have to adjust the accidental if the number of semitones between your original and transposed note differ from that of the original and transposed key. The number of accidentals in the key must also be taken into account, of course.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Take the example of transposing the note D from the key of A to the key of F. Because F is five notes above A, the note D transposes to the note B; the key signature takes care of making the B flat. However, if we were transposing the note D♯, we would have to calculate that the final note needs to be B♮ in order for the number of semitones to be correct (F - A = 8, B♮ - D♯ = 9 - 1 = 8; the ♯ increase the number of semitones while the ♭ decreases it, but of course subtracting a ♯ results in a decrease too).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Conveniently, the output has an accidental of some sort (including ♮) if and only if the input note does, which should simplify the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to write a program which will accept three notes as arguments. Two of the notes will represent the original and transposition key of the transposition, while one of the notes will represent the note to be transposed. You must then output the result of the transposition. Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Note    From    To      Result&#xA;G♮      A♭      B♭      A♮ (not A)&#xA;C♯      B       D       E♮ (not E)&#xA;B       F       D       G&#xA;B♭      C       G       F♮&#xA;B       B       A       A&#xA;B       E       B       F (not F♯)&#xA;D♭      E       G♭      F♭♭ (not E♭ or D♯)&#xA;G♭      E       G       B♭♭ (not A or A♮)&#xA;E♭      G♭      C♯      A♮ (not A)&#xA;C       F       D       A&#xA;G♯      C       G       D♯ (not E♭)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program wins. However, since there does not appear to be an ASCII character that can represent ♮, I will allow any of the three UTF-8 characters ♭, ♮ or ♯ to count as a single byte.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2017-12-16T20:22:38.913" LastActivityDate="2017-12-16T20:22:38.913" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11051" PostTypeId="2" ParentId="10938" CreationDate="2016-12-26T18:47:01.963" Score="8" Body="&lt;h1&gt;Best Co-op Answer&lt;/h1&gt;&#xA;&lt;p&gt;This is awarded to the answer (at least 2 people have to be involved in it) with the best cooperation, not necessarily the best answer that was cooperated on.&lt;/p&gt;&#xA;" OwnerUserId="41805" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-30T17:21:07.160" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11053" PostTypeId="2" ParentId="2140" CreationDate="2016-12-26T19:13:59.510" Score="0" Body="&lt;h1&gt;What can I spell?&lt;/h1&gt;&#xA;&lt;p&gt;My mother-in-law has a set of wooden blocks that together spell out &lt;code&gt;fRoSty The Snowman&lt;/code&gt;.  Specifically, &lt;code&gt;f&lt;/code&gt;, &lt;code&gt;R&lt;/code&gt;, &lt;code&gt;o&lt;/code&gt;, &lt;code&gt;S&lt;/code&gt;, &lt;code&gt;t&lt;/code&gt;, and &lt;code&gt;y&lt;/code&gt; are all painted on separate blocks (note that &lt;code&gt;R&lt;/code&gt; and &lt;code&gt;S&lt;/code&gt; are capitalized). And then there's one longer block that says &lt;code&gt;The Snowman&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;However, each block also has a different letter on the reverse side.  For example, if you flip the &lt;code&gt;f&lt;/code&gt; block around, it shows a &lt;code&gt;B&lt;/code&gt;.  So you could instead spell out &lt;code&gt;BRoSty The Snowman&lt;/code&gt;.  (Sidenote: Googling &lt;code&gt;Brosty the Snowman&lt;/code&gt; reveals several Twitter users with that alias.  Those people are not me, and their opinions are their own.  I do not endorse their comments.)&lt;/p&gt;&#xA;&lt;p&gt;Similarly, the reverse side of the &lt;code&gt;R&lt;/code&gt; is an &lt;code&gt;e&lt;/code&gt;, and on the back of the &lt;code&gt;t&lt;/code&gt; is a &lt;code&gt;u&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Or actually, I'm not really sure if that's a &lt;code&gt;u&lt;/code&gt; or an &lt;code&gt;n&lt;/code&gt; on the other side of the &lt;code&gt;t&lt;/code&gt;.  So I guess it could really be either one!&lt;/p&gt;&#xA;&lt;p&gt;So the full set of blocks is&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;f &amp;lt;--&amp;gt; B&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;R &amp;lt;--&amp;gt; e&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;o &amp;lt;--&amp;gt; M &amp;lt;--&amp;gt; W&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;S &amp;lt;--&amp;gt; i&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;t &amp;lt;--&amp;gt; u &amp;lt;--&amp;gt; n&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;y &amp;lt;--&amp;gt; E&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;The Snowman &amp;lt;--&amp;gt; xo xo xo &amp;lt;--&amp;gt; ox ox ox&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Note that &lt;code&gt;The Snowman&lt;/code&gt; has a space, and &lt;code&gt;xo xo xo&lt;/code&gt; includes two spaces, as does &lt;code&gt;ox ox ox&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Of course, when writing out a phrase you &lt;strong&gt;can re-order the blocks&lt;/strong&gt;, you &lt;strong&gt;don't have to use every block&lt;/strong&gt;, and you &lt;strong&gt;can't use a block twice&lt;/strong&gt;.  (If you like: from each block, either zero or one of the two or three options may be used.)&lt;/p&gt;&#xA;&lt;p&gt;Finally, you &lt;strong&gt;can insert at most&lt;/strong&gt; &lt;code&gt;1&lt;/code&gt; &lt;strong&gt;space&lt;/strong&gt; in between any two blocks.  So both &lt;code&gt;fRoSty The Snowman&lt;/code&gt; and &lt;code&gt;fRoStyThe Snowman&lt;/code&gt; are possible, but &lt;code&gt;fRoStyTheSnowman&lt;/code&gt; is not possible because the block with &lt;code&gt;The Snowman&lt;/code&gt; includes a space.&lt;/p&gt;&#xA;&lt;p&gt;So the question is, &lt;strong&gt;Given a phrase, can I spell it out using these blocks?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;A string of printable-ASCII characters, of length &lt;code&gt;1&lt;/code&gt; or more.  If you like, you may assume the input has only letters (&lt;code&gt;A-Z&lt;/code&gt; &lt;code&gt;a-z&lt;/code&gt;) and spaces &lt;code&gt; &lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You may also assume that the input won't begin or end in a space, and will never have multiple spaces in a row.&lt;/p&gt;&#xA;&lt;p&gt;You may take the input as a string or array of characters or whatever is convenient and conventional in your language.&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;You should output a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2190/interpretation-of-truthy-falsey&quot;&gt;Truthy&lt;/a&gt; value if the message can be spelled using the blocks, and a Falsey value otherwise.&lt;/p&gt;&#xA;&lt;h2&gt;Truthy Examples:&lt;/h2&gt;&#xA;&lt;p&gt;&lt;code&gt;fRoSty The Snowman&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;fRoStyThe Snowman&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;SMuRfy The Snowman&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;fRy SuM ox ox ox&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;xo xo xo MRS BEn&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;xo xo xo MR BEn&lt;/code&gt; (don't need to use every block)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;eW&lt;/code&gt; (Both &lt;code&gt;e&lt;/code&gt; and &lt;code&gt;E&lt;/code&gt; appear in the set of blocks)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;WRiThe Snowman&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;R u The Snowman &lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;y i M The Snowman Rn&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;BRThe Snowmano&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;Box ox oxy&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;xo xo xo&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;t o yS&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;t&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Falsey Examples:&lt;/h2&gt;&#xA;&lt;p&gt;&lt;code&gt;The Snowman BRoW&lt;/code&gt; (the &lt;code&gt;o&lt;/code&gt; and &lt;code&gt;W&lt;/code&gt; can't occur simultaneously)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;TheSnowman&lt;/code&gt; (again, the block in question clearly reads &lt;code&gt;The Snowman&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;The snowman&lt;/code&gt; (input is case-sensitive)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;The Snowmen&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;The SMuRfy Snowman&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;nut&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;tt&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;xo xo xo The Snowman&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;aaasdf&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;xoxoxo&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;yo yo yo&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;Ho Ho Ho&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;xo xo xo MR bEn&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;More egg nog please&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Invalid inputs (you are allowed to assume such inputs will not occur):&lt;/h2&gt;&#xA;&lt;p&gt;&lt;code&gt;The  Snowman&lt;/code&gt; (adjacent multiple spaces)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt; &lt;/code&gt; (has space at the beginning/end of the string)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;fRo5ty&lt;/code&gt; (only letters and spaces allowed)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;Is there any more egg nog left?&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;Should we make some more egg nog?&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;Is there any alcohol at all in the house?&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;I'll be back in a bit&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;`` (The empty string)&lt;/p&gt;&#xA;&lt;h1&gt;Other rules&lt;/h1&gt;&#xA;&lt;p&gt;My mother-in-law's Internet access is not the best, so the shorter your code, the better. Hence, this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.  Shortest code wins!  You may use any of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;default input and output methods&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;standard loopholes are forbidden&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If you have a built-in that will do this for you, then I guess this is your chance to use it!  Please feel free!&lt;/p&gt;&#xA;&lt;h1&gt;Room for improvement&lt;/h1&gt;&#xA;&lt;p&gt;Obviously, let me know if this is too close to another question, or if it's unclear.&lt;/p&gt;&#xA;&lt;p&gt;Please let me know if you'd rather see different rules.  Please feel free to propose any suggestions that would improve the challenge.&lt;/p&gt;&#xA;&lt;p&gt;Other test cases that I need to include?&lt;/p&gt;&#xA;&lt;p&gt;Would different formatting be more convenient?&lt;/p&gt;&#xA;" OwnerUserId="36885" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-26T19:13:59.510" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11054" PostTypeId="1" CreationDate="2016-12-27T01:00:22.633" Score="5" ViewCount="377" Body="&lt;p&gt;I noticed earlier today that the Befunge interpreter on TIO no longer functioned in quite the same way as the old version (I guess this was caused by the nexus update). As a result, one of my old answers that relied on undefined behaviour that was specific to the TIO implementation is now no longer valid. I was quite happy to just delete that answer, since it only had one upvote anyway, but I'd like to know what the recommended practice is for these situations in general.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I know my particular case is probably not that common, but I suspect a lot of the golfing languages used on this site are evolving in ways that might not always be backwards compatible and could occasionally invalidate old answers. If that happens, are people expected to update those answers to be compatible with the latest version of the interpreter? Do they just leave their answer broken? Or should they delete the answer if they can't or don't want to fix it?&lt;/p&gt;&#xA;" OwnerUserId="62101" LastActivityDate="2016-12-27T01:11:24.373" Title="What if an interpreter update invalidates an existing answer?" Tags="|discussion|policy|answers|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11055" PostTypeId="2" ParentId="11054" CreationDate="2016-12-27T01:11:24.373" Score="6" Body="&lt;h1&gt;The old interpreter conceptually still exists, even if it's no longer accessible&lt;/h1&gt;&#xA;&lt;p&gt;We require that the interpreter predates the question. We don't require that the interpreter still be available at the time the question is asked (except for occasional &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; questions where the ability of robbers to run the programs is important). Presumably in this case it'd be possible to track down the specific version of the interpreter that was used, and run it locally; TIO must have got it from somewhere.&lt;/p&gt;&#xA;&lt;p&gt;Or to put it another way, languages are defined by their implementation on PPCG, so a new version of the implementation conceptually creates a new language, and doesn't cause the old language to cease to exist.&lt;/p&gt;&#xA;&lt;p&gt;Thus, the answer doesn't become invalid simply because the interpreter has fallen off the Internet (and in this case, it probably hasn't!); it was there at one point.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-27T01:11:24.373" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11056" PostTypeId="2" ParentId="2140" CreationDate="2016-12-27T03:21:47.287" Score="0" Body="&lt;h1&gt;Create an equation who's only solution is the numerical ASCII code of the equation itself &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your equation will be run as a Wolfram Alpha query with &lt;code&gt;Solve&lt;/code&gt; prepended to it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The equation must start with (spaces optional):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;y = &#xA;f(x)&#xA;g(x)&#xA;h(x)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output is considered to be the string in the second box of Wolfram Alpha, after your prefix (above) is stripped. If the string is not numerical, it is disqualified.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Only &lt;a href=&quot;https://en.wikipedia.org/w/index.php?title=List_of_mathematical_functions&amp;amp;oldid=739319930&quot; rel=&quot;nofollow noreferrer&quot;&gt;these functions&lt;/a&gt; are allowed.&lt;/p&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2016-12-27T03:21:47.287" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11058" PostTypeId="2" ParentId="11033" CreationDate="2016-12-27T05:03:06.823" Score="16" Body="&lt;h1&gt;Yes, assuming that the challenge hasn't had significant work on it already&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The truly difficult tasks can be very interesting to work on, and you won't know whether they're impossible unless you post them. If it turns out to be impossible, or nobody answers, no real harm is done. If it turns out to be possible, we have a very impressive solution, and everyone benefits. So the potential downsides are small, and the potential upsides are large. (The best example of this happening in the past is probably &lt;a href=&quot;https://codegolf.stackexchange.com/q/28821/62131&quot;&gt;this&lt;/a&gt; question; when it was posted, there was doubt as to whether it was possible, but it turned out that it was, and apparently 442 users (at the time of writing) were interested to see the result.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, the challenges should be ones where it's reasonable to consider that someone would actually work on the problem because of PPCG. &quot;Prove P=NP&quot; would, if worded in the form of a challenge (like in the OP), be ontopic at PPCG. &quot;Find a counterexample to the Riemann Hypothesis&quot; would probably be ontopic at Puzzling. However, both challenges are very well-known (and have very large cash prizes), so it's implausible to think that people would work on the challenges &lt;em&gt;because of&lt;/em&gt; PPCG; there's little point in posting them here, as a solution would be major news that went well beyond the boundaries of Stack Exchange.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So in other words, potentially impossible challenges are reasonable, but we should stick to within the scope of what PPCG is reasonably likely to be able to accomplish. In other words, the challenge should be &quot;I'm not sure this is possible, I wonder if anyone else at PPCG has ideas&quot; rather than &quot;I'm not sure this is possible, because a large team of mathematicians has failed to accomplish it for years&quot;.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2016-12-27T05:03:06.823" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11059" PostTypeId="2" ParentId="2140" CreationDate="2016-12-27T07:56:54.770" Score="0" Body="&lt;h1&gt;Golf a Sound Change Applier&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(Snappier title suggestions appreciated)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Sound_change&quot; rel=&quot;nofollow noreferrer&quot;&gt;The pronunciation of human languages changes over time&lt;/a&gt;. Often, sound changes follow discernable rules, with the same change applied consistently across many words in a language. For example, a lot of words that started with &lt;em&gt;f&lt;/em&gt; in Latin now start with &lt;em&gt;h&lt;/em&gt; in Spanish: &lt;strong&gt;&lt;em&gt;f&lt;/strong&gt;acere&lt;/em&gt; -&gt; &lt;strong&gt;&lt;em&gt;h&lt;/strong&gt;acer&lt;/em&gt;, &lt;strong&gt;&lt;em&gt;f&lt;/strong&gt;ervere&lt;/em&gt; -&gt; &lt;strong&gt;&lt;em&gt;h&lt;/strong&gt;ervir&lt;/em&gt;, &lt;strong&gt;&lt;em&gt;f&lt;/strong&gt;īcus&lt;/em&gt; -&gt; &lt;strong&gt;&lt;em&gt;h&lt;/strong&gt;igo&lt;/em&gt;, and &lt;strong&gt;&lt;em&gt;f&lt;/strong&gt;īlius&lt;/em&gt; -&gt; &lt;strong&gt;&lt;em&gt;h&lt;/strong&gt;ijo&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Mark Rosenfelder, a well-known name in &lt;a href=&quot;https://en.wikipedia.org/wiki/Constructed_language&quot; rel=&quot;nofollow noreferrer&quot;&gt;conlang&lt;/a&gt; circles, wrote a program called &lt;a href=&quot;http://zompist.com/sca2.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sound Change Applier&lt;/a&gt; to help simulate this process. Actually, the SCA constitutes a small pattern-matching and substitution language. For this challenge, we're going to implement a pared-down version.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The language&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An SCA program transforms a list of words according to a collection of sound change rules. It consists of two sections: category definitions and substitutions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Category definitions&lt;/strong&gt; are lines of the form &lt;code&gt;V=aeiou&lt;/code&gt;, where &lt;code&gt;V&lt;/code&gt; is the category name (must be a single character) and &lt;code&gt;aeiou&lt;/code&gt; are the category entries. Categories define groups of similar speech sounds (we'll use the term &quot;letters,&quot; though strictly speaking that's a bit misleading); for instance, the above example is the category of vowels.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Substitutions&lt;/strong&gt; are where the magic happens. They take the form &lt;code&gt;target/replacement/environment&lt;/code&gt;, where the constituent parts are as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;target&lt;/code&gt; and &lt;code&gt;replacement&lt;/code&gt; are strings containing any number of letters and 0 or 1 category names, in any order. They represent the string to be replaced and the string to replace it with, respectively.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;environment&lt;/code&gt; is a string containing exactly 1 underscore (&lt;code&gt;_&lt;/code&gt;), representing the substitution, and any number of letters and category names, representing the required context for the substitution to take place. It can also contain the &lt;code&gt;#&lt;/code&gt; character, representing the beginning or end of a word.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Some examples, assuming the &lt;code&gt;V&lt;/code&gt; category from earlier:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ii/i/_    Change ii to i anywhere in a word&#xA;i/j/_V    Change i to j when followed by a vowel&#xA;u/o/_#    Change u to o at the end of a word&#xA;p//V_t    Delete p if preceded by a vowel and followed by t&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Categories in substitutions&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;When category names are used in the environment, the environment matches if any member of the category is in the appropriate place. For example, the last rule above will delete the &lt;code&gt;p&lt;/code&gt; from &lt;code&gt;apt&lt;/code&gt;, &lt;code&gt;opt&lt;/code&gt;, &lt;code&gt;inept&lt;/code&gt;, or &lt;code&gt;scripting&lt;/code&gt;, but not from &lt;code&gt;thbpt&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The same is true when categories are used in the target but not the replacement. For example, the rule &lt;code&gt;V/e/Vr_#&lt;/code&gt; will delete any vowel if it matches the environment: &lt;code&gt;opera&lt;/code&gt; -&gt; &lt;code&gt;oper&lt;/code&gt;, &lt;code&gt;sombrero&lt;/code&gt; -&gt; &lt;code&gt;sombrer&lt;/code&gt;, &lt;code&gt;calamari&lt;/code&gt; -&gt; &lt;code&gt;calamar&lt;/code&gt; (but not &lt;code&gt;cobra&lt;/code&gt; -&gt; &lt;code&gt;cobr&lt;/code&gt; because the environment vowel isn't matched).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, if categories are used in both the target and replacement, the replacement letter must come from the same position in its category as the matched target letter does in its category.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, suppose we have these category definitions: &lt;code&gt;S=ptc&lt;/code&gt;, &lt;code&gt;Z=bdg&lt;/code&gt;. (These are &lt;a href=&quot;https://en.wikipedia.org/wiki/Voice_(phonetics)&quot; rel=&quot;nofollow noreferrer&quot;&gt;unvoiced and voiced&lt;/a&gt; &lt;a href=&quot;https://en.wikipedia.org/wiki/Stop_consonant&quot; rel=&quot;nofollow noreferrer&quot;&gt;stops&lt;/a&gt;, respectively.) Then the substitution &lt;code&gt;S/Z/V_V&lt;/code&gt; (changed unvoiced stops to voiced between vowels) represents three possible substitutions: &lt;code&gt;p&lt;/code&gt; -&gt; &lt;code&gt;b&lt;/code&gt;, &lt;code&gt;t&lt;/code&gt; -&gt; &lt;code&gt;d&lt;/code&gt;, and &lt;code&gt;c&lt;/code&gt; -&gt; &lt;code&gt;g&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Execution&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;An SCA program accepts as input a list of words to be transformed. It goes down the list of substitutions in order, applying each one to all words in the word list. Each substitution is applied repeatedly until the environment and/or target no longer matches. Then the next substitution is applied. When all substitutions have completed, the program outputs the transformed list of words.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Miscellaneous rules&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If a category is used in the replacement, a category must also be used in the target.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The replacement may be empty, but the target may not be empty.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Category names, letters, and words in the word list will never use the characters &lt;code&gt;=/#_&lt;/code&gt; or space.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that takes an SCA program and a list of words and outputs/returns the result of running that program on those words.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may assume that the SCA program is syntactically valid and that the words do not contain any forbidden characters. If these assumptions are broken, your code may do anything (handle it gracefully, crash, output gibberish).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;I/O format&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input format is flexible. You may take the program as a multiline string or a list of strings. The category definitions and substitutions may be in the same string/list or two different strings/lists (or contained in a two-item list). The input words may be in a list or a space- or newline-delimited string. Similarly, output may be a list or a space- or newline-delimited string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/16766&quot;&gt;default I/O methods&lt;/a&gt; are acceptable. You may use different input methods for category definitions, substitutions, and input words if it makes the task easier in your language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Linguists use &lt;a href=&quot;https://en.wikipedia.org/wiki/International_Phonetic_Alphabet&quot; rel=&quot;nofollow noreferrer&quot;&gt;many letter forms&lt;/a&gt; that are not present in ASCII. Therefore, your program &lt;strong&gt;must&lt;/strong&gt; be able to accept Unicode characters up through &lt;strong&gt;U+1FFF&lt;/strong&gt; (at least) in both the rules and the word list. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Adapted from Mark Rosenfelder's site, here is a simplistic Latin-to-Portuguese converter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Categories:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;V=aeiou&#xA;L=āēīōū&#xA;C=ptcqbdgmnlrhs     &#xA;F=ie&#xA;B=ou&#xA;S=ptc&#xA;Z=bdg&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Substitutions:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;m//_#&#xA;i/j/_V&#xA;L/V/_&#xA;e//Vr_#&#xA;v//V_V&#xA;u/o/_#&#xA;gn/nh/_&#xA;S/Z/V_V&#xA;c/i/F_t&#xA;c/u/B_t&#xA;p//V_t&#xA;ii/i/_&#xA;e//C_rV&#xA;lj/lh/_&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Given the following input list:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;lēctōrem&#xA;doctōrem&#xA;focum&#xA;jocum&#xA;districtum&#xA;cīvitātem&#xA;adoptāre&#xA;opera&#xA;secundum&#xA;fīliam&#xA;pontem&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;the output list should be as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;leitor&#xA;doutor&#xA;fogo&#xA;jogo&#xA;distrito&#xA;cidade&#xA;adotar&#xA;obra&#xA;segundo&#xA;filha&#xA;ponte&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;; the shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2016-12-27T08:15:39.460" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11063" PostTypeId="1" CreationDate="2016-12-27T19:40:23.030" Score="2" ViewCount="94" Body="&lt;p&gt;I have noticed that almost all questions with the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/busy-beaver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;busy-beaver&amp;#39;&quot; rel=&quot;tag&quot;&gt;busy-beaver&lt;/a&gt; are closed as a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/18028/largest-number-printable&quot;&gt;Largest Number Printable&lt;/a&gt; or are attempted to be closed as a duplicate of that post.&lt;/p&gt;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9935/possibility-of-reopening-a-question&quot;&gt;Possibility of reopening a question&lt;/a&gt; it was even suggested that ttp://codegolf.stackexchange.com/questions/91332/the-longest-period-iterating-quine is a duplicate of that post [1].&lt;/p&gt;&#xA;&lt;p&gt;And in other questions like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/103684/busy-brain-beaver-reboot&quot;&gt;Busy Brain Beaver reboot&lt;/a&gt; there are some twist like only using 1 language and raising the charterer limit [2][3]&lt;/p&gt;&#xA;&lt;p&gt;I think either the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/busy-beaver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;busy-beaver&amp;#39;&quot; rel=&quot;tag&quot;&gt;busy-beaver&lt;/a&gt; tag should be removed or we should be a little less harsh on busy-beavers because it is in the nature of busy beavers that small changes make a big difference:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A small change in the character limit can have big effects like forcing you to use a completely different strategy&lt;/li&gt;&#xA;&lt;li&gt;Forcing you to use an esoteric language (like brainfuck) can force you to really think about every detail you wouldn't think of other wise.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I meanly just wanted to bring this problem to your attention (and it got a bit rambly) and see what you think that should happen.&lt;/p&gt;&#xA;&lt;h3&gt;Footnotes&lt;/h3&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;While the longest quine is one of the most creative busy beavers I have seen&lt;/li&gt;&#xA;&lt;li&gt;I hope this one gets re-opened because I spend a day making an answer and now I can't post it but that should be discussed here : &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11001/should-we-open-largest-number-printable-to-all-languages/11005?noredirect=1#comment36059_11005&quot;&gt;Should we open *Largest number printable* to all languages?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;I know limiting languages isn't suggested for other reasons but that's not the point of this discussion&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="63550" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-27T19:40:23.030" Title="Are all busy-beavers copies of *Largest number printable*?" Tags="|discussion|" AnswerCount="0" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11064" PostTypeId="2" ParentId="10938" CreationDate="2016-12-28T11:59:34.820" Score="5" Body="&lt;h1&gt;Most Definitive Answer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Sometimes, a hard question has an answer that's so perfect that it's not worth competing with it. This category is for the best answer (submitted in 2016) among answers which were the only (valid, which can probably be defined as &quot;non-deleted&quot;) answer to the corresponding question at the end of 2016.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2016-12-28T11:59:34.820" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11069" PostTypeId="2" ParentId="2140" CreationDate="2016-12-28T20:12:01.690" Score="0" Body="&lt;h1&gt;Output every string&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task here is simple. Write a program, in as few bytes as possible, which prints every single possible string. Your program should, given infinite memory, never terminate, however for any given string there should be a finite time to be generated. (that is, a aa aaa aaaa ... Won't work as it will never generate b).&lt;/p&gt;&#xA;&lt;p&gt;The strings to be generated should consist of all the characters in the same encoding as your answer, which you must specify if not utf-8.&lt;/p&gt;&#xA;&lt;p&gt;The exception is that you must choose a character to exclude from your strings, which you will use to delimit strings. You may optionally have one leading delimiter.&lt;/p&gt;&#xA;&lt;p&gt;Remember to include the empty string!&lt;/p&gt;&#xA;" OwnerUserId="60042" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-28T20:12:01.690" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11074" PostTypeId="1" AcceptedAnswerId="11075" CreationDate="2016-12-29T03:49:21.997" Score="7" ViewCount="266" Body="&lt;p&gt;This is kind of a follow-up to / re-asking of &quot;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2441/5138&quot;&gt;Should point-free function expressions be allowed when a function is asked for?&lt;/a&gt;&quot; with specific reference to the only language I know how to golf in, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/j&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;j&amp;#39;&quot; rel=&quot;tag&quot;&gt;j&lt;/a&gt;, where the issue is a little bit pernicious and involved. (Note that there was no final consensus in that meta.PPCG question, so it is technically still open for debate!)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't know how to ask this in general without being exceedingly abstract, nor do I have examples in any other languages, but hopefully it's clear enough how this applies to other languages where there are parentheses for modifying evaluation order or operator precedence/associativity.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A little bit of background, for the non-J folk. The J language has an&#xA;  interesting syntax, arguably the main reason it is reasonably&#xA;  competitive against golflangs, called &lt;em&gt;verb trains&lt;/em&gt;: to pretend to&#xA;  be more like a functional language, you can jam verbs (AKA functions)&#xA;  together without any extra syntax, and instead of throwing an error, J&#xA;  will compose them in a useful, nontrivial way.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;More concretely, suppose &lt;code&gt;f&lt;/code&gt; and &lt;code&gt;g&lt;/code&gt; are one-argument functions. Then&#xA;  you can write &lt;code&gt;(f + g)&lt;/code&gt; to mean a function such that &lt;code&gt;(f + g) y&lt;/code&gt; is&#xA;  the same as &lt;code&gt;(f y) + (g y)&lt;/code&gt;. (Think of the sum of two functions, from &#xA;  first-year calculus.) To oversimplify, any odd-length train of verbs&#xA;  does this kind of thing, in a right-associative manner, and we can put&#xA;  any two-argument function we want instead of &lt;code&gt;+&lt;/code&gt;. (There is a version &#xA;  of this for even-length trains, too, but that's irrelevant.)&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;So here's the issue.&lt;/strong&gt; If your answer to a code golf question is &lt;code&gt;(f+g)&lt;/code&gt;, then do you have to include the parens? You don't have to&#xA;  wrap it in parens to name the function, but you do to use it&#xA;  anonymously, &lt;em&gt;since it is not a syntax error to omit the parens&lt;/em&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;answer =: f+g&#xA;answer 42        NB. this works as intended&#xA;&#xA;(f+g) 42         NB. this works as intended&#xA;&#xA;f+g 42           NB. this is equivalent to   f (+ (g 42))   which is different!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;But it gets weirder.&lt;/strong&gt; For convenience, the &lt;code&gt;f&lt;/code&gt; above can be a noun&#xA;  (AKA datatype like array or integer or string) and J will&#xA;  automatically upgrade it to a constant function. So e.g. &lt;code&gt;(2 + g) y&lt;/code&gt;&#xA;  is equivalent to &lt;code&gt;2 + (g y)&lt;/code&gt;. But now if your submission to the golf&#xA;  is &lt;code&gt;2+g&lt;/code&gt;, then all three examples above will act identically (&lt;a href=&quot;http://jsoftware.com/help/dictionary/d212.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;most of&#xA;  the time&lt;/a&gt;). I should note&#xA;  that, having knowledge of the J interpreter, I can say it is reading&#xA;  and evaluating the expression differently in the third case.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;And if you want an example of this mattering in a real golf, &lt;a href=&quot;https://codegolf.stackexchange.com/a/104976/5138&quot;&gt;I came&#xA;  across one just today&lt;/a&gt;!&#xA;  If parens are required then my 20 byte solution is (probably) the best&#xA;  possible in J; but if they can be omitted, then my alternative solution&#xA;  is shorter, weighing in at 19 bytes, and ties the current best answer,&#xA;  which is in a golflang.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A big argument for &lt;em&gt;not&lt;/em&gt; wrapping in parens is that, when you give an expression, you implicitly assume it will be evaluated as-is, not in some context that can possibly change what is meant.&lt;/li&gt;&#xA;&lt;li&gt;A big argument for requiring parens, on the other hand, is that it is only unambiguous when in parens&amp;mdash;in J in particular, effectively the only time you can ever omit the parens from a train is when making a simple definition like &lt;code&gt;answer =: f+g&lt;/code&gt;.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;One odd possibility that I personally believe is unacceptable is that, if we require parens, then omitting them in a submission means that answer is invoking the effects of the intentionally unparenthesized code.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;A third option, entertained in the meta.PPCG question I linked earlier, might be to require that you add the characters necessary to name the function literal. This is unfair for languages like J and R, though, where the assignment operator is longer than one character, so counting the parens would cost less!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is code golf, however, and there are (at least) 2 bytes at stake here, so there should be some discussion. I tend to err on the side of caution and count the parens in my submissions, but I think by now I've seen this happen enough times to warrant another look. Like I said, the old meta.PPCG question did not come to a consensus, even in the comments.&lt;/p&gt;&#xA;" OwnerUserId="5138" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2016-12-29T04:32:09.343" Title="If your answer is acts differently depending on context, how safe do you have to be?" Tags="|discussion|code-golf|rules|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11075" PostTypeId="2" ParentId="11074" CreationDate="2016-12-29T04:25:12.353" Score="14" Body="&lt;p&gt;Our defaults say that submissions have to be &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2422/12012&quot;&gt;full programs or functions&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7844/12012&quot;&gt;REPL &quot;programs&quot; are also allowed&lt;/a&gt;, but they have to be labeled as such, and still have to conform to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/12012&quot;&gt;defaults regarding input and output&lt;/a&gt; (which usually boils down to taking input from a prompt and displaying the results on the screen).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the specific case you mention, I'd argue our defaults apply to J as follows.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A verb train is essentially a lambda or an anonymous function. Those are frequently used in many other languages, and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1503/8478&quot;&gt;they do not have to be named&lt;/a&gt;. The argument for allowing lambdas is that they evaluate to a function, which can be stored somehow to use if as many times as needed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So just as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;lambda x,y:x*x-y*y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which can be used as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;diff_of_squares = lambda x,y:x*x-y*y&#xA;diff_of_squares(5, 3)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or even&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(lambda x,y:x*x-y*y)(5, 3)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is a valid Python answer to calculate the difference of squares of two numbers,&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+*-&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is a valid J solution which can be used as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;diff_of_squares =: +*-&#xA;5 diff_of_squares 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or even&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;5 (+*-) 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Just like the parens or assignment to a variable are not counted for Python, they should not be counted for J.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, the fact that&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;5 +*- 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;does something else (negate 3, compute sign, add to 5) shouldn't matter. When not used as a verb train, &lt;code&gt;+*-&lt;/code&gt; is neither a full program nor a function, but merely a snippet (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1146/12012&quot;&gt;forbidden by default&lt;/a&gt;) that requires hardcoding the input arguments to its left and its right. It thus cannot be confused with the verb &lt;em&gt;train&lt;/em&gt; &lt;code&gt;+*-&lt;/code&gt;, which &lt;em&gt;is&lt;/em&gt; a function.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2016-12-29T04:32:09.343" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11076" PostTypeId="2" ParentId="2140" CreationDate="2016-12-29T08:17:37.323" Score="2" Body="&lt;h2&gt;The social network &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;On my social network, two users are &quot;friends&quot; if their name share a common letter.&#xA;For exemple, &lt;code&gt;bob&lt;/code&gt; and &lt;code&gt;bill&lt;/code&gt; are friends, as they share the letter &lt;code&gt;b&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a list of user names:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;display a &lt;strong&gt;falsy&lt;/strong&gt; value if there exist in the list two distinct users &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; that cannot be related through a friendship chain; &lt;/li&gt;&#xA;&lt;li&gt;else, display a &lt;strong&gt;truthy&lt;/strong&gt; value.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;abc cde efg ghi&lt;/code&gt;&#xA;should return true, as &lt;code&gt;abc&lt;/code&gt; is friend with &lt;code&gt;cde&lt;/code&gt;, which is friend with &lt;code&gt;efg&lt;/code&gt;, which is friend with &lt;code&gt;ghi&lt;/code&gt; : all users are related.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;abc cde fgh hij&lt;/code&gt;&#xA;should return false, as for example &lt;code&gt;abc&lt;/code&gt; and &lt;code&gt;fgh&lt;/code&gt; cannot be related through a friendship chain.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;abc&lt;/code&gt;&#xA;should return true, as we cannot find in that list two unrelated users.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can read the name list in any convenient format for your language.  &lt;/li&gt;&#xA;&lt;li&gt;You can assume all the names are lowercase and use only the characters &lt;code&gt;a-z&lt;/code&gt;.  &lt;/li&gt;&#xA;&lt;li&gt;You don't need to handle the empty list, any result (true, false, program crash) is acceptable for it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="13798" LastEditorUserId="13798" LastEditDate="2016-12-29T08:29:39.643" LastActivityDate="2016-12-29T08:29:39.643" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11077" PostTypeId="2" ParentId="2441" CreationDate="2016-12-29T10:59:00.780" Score="8" Body="&lt;h1&gt;Any expression that evaluates to a value of function type can be submitted as a function&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I can't see a consistent way that works cross-language to ban functions defined in a point-free style, and in many esoteric languages (e.g. &lt;a href=&quot;http://esolangs.org/wiki/Underload&quot; rel=&quot;nofollow noreferrer&quot;&gt;Underload&lt;/a&gt;), the point-free style is the only one that exists anyway. Even in more normal languages, surrounding a function with &lt;code&gt;\x-&amp;gt;(&lt;/code&gt; … &lt;code&gt;)x&lt;/code&gt; is just boilerplate, and we normally don't count boilerplate if it's inherent in the way the language works. (See also &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11074/62131&quot;&gt;this newer question&lt;/a&gt; which covers the ground of whether parentheses or the equivalent are required around this sort of expression; at the time of writing, we're leaning towards no.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that this differs from an expression that evaluates the answer directly (as opposed to evaluating to a function that evaluates the answer); most (but not) all languages draw a distinction, and in this case the expression is just a snippet. For example, in the OP's example, &lt;code&gt;map succ&lt;/code&gt; is a valid function (it has function type, and doesn't do anything unless you call it), but &lt;code&gt;map succ xs&lt;/code&gt; is a snippet (because it doesn't evaluate to a function, but rather a value of the base type &lt;code&gt;Enum b =&amp;gt; [b]&lt;/code&gt;). So valid function submissions would include &lt;code&gt;map succ&lt;/code&gt;, &lt;code&gt;(map succ)&lt;/code&gt;, &lt;code&gt;\x-&amp;gt;map succ x&lt;/code&gt;, &lt;code&gt;let f=map succ&lt;/code&gt;, and &lt;code&gt;let f x=map succ x&lt;/code&gt;, because all of these return a function, and don't actually read any input, produce any output, or the like.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2016-12-29T10:59:00.780" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11078" PostTypeId="2" ParentId="2140" CreationDate="2016-12-29T11:18:59.677" Score="12" Body="&lt;h1&gt;Prime Spiral&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge was inspired by &lt;a href=&quot;https://math.stackexchange.com/questions/2072308/help-with-a-prime-number-spiral-which-turns-90-degrees-at-each-prime&quot;&gt;this question on math.SE&lt;/a&gt; by &lt;a href=&quot;https://math.stackexchange.com/users/203893/karl&quot;&gt;@Karl&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You might be familiar with the &lt;a href=&quot;https://en.wikipedia.org/wiki/Ulam_spiral&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ulam spiral&lt;/a&gt;. What we're doing here is similar, but a little bit different, given a positive integer &lt;code&gt;N&lt;/code&gt; we generate an image: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;On an empty equally spaced rectangular 2d grid choose an arbitrary point and place a 1 then place a 2 on the grid point to the right of the 1. Then continue as follows: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you're at number &lt;code&gt;n&amp;lt;N&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;code&gt;n&lt;/code&gt; is composite: Go straight in the same direction to place &lt;code&gt;n+1&lt;/code&gt; &lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;n&lt;/code&gt; is prime: Turn right to place &lt;code&gt;n+1&lt;/code&gt; (overwrite, if there was another from a previous step)&lt;/li&gt;&#xA;&lt;li&gt;Repeat this for &lt;code&gt;n:=n+1&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Now consider the grid as a pixel image that is plain white. Then colour each pixel where we placed a number on the corresponding grid point. Then choose a finite rectangle that contains all the coloured pixels, and output it as an image.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;For &lt;code&gt;N=10^5&lt;/code&gt; we get following output (&lt;a href=&quot;https://math.stackexchange.com/a/2072702/109451&quot;&gt;by&lt;/a&gt; &lt;a href=&quot;https://math.stackexchange.com/users/127263/wojowu&quot;&gt;@Wojowu&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/eHeia.png&quot; width=&quot;300&quot; /&gt;&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2017-04-13T12:19:20.950" LastActivityDate="2017-03-28T15:56:31.720" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11079" PostTypeId="2" ParentId="10938" CreationDate="2016-12-29T15:26:36.813" Score="9" Body="&lt;h1&gt;Best Necromancer&lt;/h1&gt;&#xA;&lt;p&gt;This is the best answer (written in 2016) written at least a year after the previous answer.&lt;/p&gt;&#xA;&lt;p&gt;Cannot be on a tips question.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-29T18:56:52.697" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11082" PostTypeId="1" AcceptedAnswerId="11083" CreationDate="2016-12-29T23:36:17.820" Score="17" ViewCount="970" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/17005/produce-the-number-2014-without-any-numbers-in-your-source-code&quot;&gt;Produce the number 2014 without any numbers in your source code&lt;/a&gt; is our highest-voted question. It regularly inspires newcomers to pose similar challenges, which get heavily downvoted with the poster pointed to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8079/20260&quot;&gt;Do X without Y&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can't blame a new user for using this question as a model. The top questions are a natural place to look to see what a site is about. Imitating success seems like a safe option to a newbie unsure of their challenge-writing skills. We must look rather capricious to them to pile downvotes on their question while the original was heavily upvoted. It's a rather poor first welcome towards the newbie.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can we do something about this &lt;a href=&quot;https://en.wikipedia.org/wiki/Broken_windows_theory&quot; rel=&quot;nofollow noreferrer&quot;&gt;broken window&lt;/a&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One option is a &lt;a href=&quot;https://meta.stackexchange.com/questions/126587/what-is-a-historical-lock-and-what-is-it-used-for&quot;&gt;historical lock&lt;/a&gt;, which &quot;preserves older content that was very popular when it was originally posted, but is now off-topic or otherwise out of scope for the site it is posted on.&quot;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Questions can be historically locked when:&lt;/p&gt;&#xA;  &#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;The post is Off-Topic or Not Constructive, and&lt;/li&gt;&#xA;  &lt;li&gt;The post is stellar, in spite of its off-topic nature, and&lt;/li&gt;&#xA;  &lt;li&gt;There are a large number of views, upvotes and inbound links on the post, and&lt;/li&gt;&#xA;  &lt;li&gt;The post is contentious; e.g., it has been closed and reopened at least once, or deleted and undeleted at least once&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'm not sure all of these apply.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2017-01-16T10:18:47.207" Title="The broken window of &quot;Produce the number 2014 without any numbers in your source code&quot;" Tags="|discussion|specific-question|scope|challenge-quality|" AnswerCount="1" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="11083" PostTypeId="2" ParentId="11082" CreationDate="2016-12-30T00:41:32.327" Score="20" Body="&lt;p&gt;Add a disclaimer:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Note: New straightforward &quot;Do X without Y&quot; questions are not considered novel anymore and may be closed as duplicates of this question.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;But I think it should be worded better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or as DJMcMayhem suggested:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This question was well-received when it was posted, but challenges like this, asking answerers to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges/8079?s=3|0.2404#8079&quot;&gt;Do X without using Y&lt;/a&gt; are likely to be poorly received. Try using &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;the sandbox&lt;/a&gt; to get feedback on if you want to post a similar challenge.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Problem:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is calculating the determinant / computing a mathematical expression / recognizing a goat without using builtins doing exactly that a &quot;Do X without Y&quot; question?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;(I &lt;a href=&quot;https://codegolf.stackexchange.com/posts/17005/revisions&quot;&gt;edited in&lt;/a&gt; the disclaimer. This is now &lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt; -- xnor)&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2017-01-16T10:18:47.207" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="11084" PostTypeId="2" ParentId="2140" CreationDate="2016-12-30T04:47:55.230" Score="1" Body="&lt;h1&gt;Name that pentomino!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There are a total of 12 different &lt;a href=&quot;https://en.wikipedia.org/wiki/Pentomino&quot; rel=&quot;nofollow noreferrer&quot;&gt;pentominoes&lt;/a&gt;, shapes made out of 5 squares:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/BRVgy.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/BRVgy.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you'll be given a pentomino in the form of the locations of the five squares in Cartesian coordinates. Your program must output the letter name of that pentomino, as shown in the image above. The pentomino won't be rotated at 45 degrees like some of the ones in the image, but other than that it may be rotated, reflected, or translated arbitrarily.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your input will be a list containing 5 pairs of integers, in any reasonable format. You can assume that each integer is between 1 and 1000, and that the coordinates give a valid pentomino.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The output should be a single character - either F, I, L, N, P, T, U, V, W, X, Y, or Z - depending on which pentomino the input coordinates represent.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input -&amp;gt; Output&#xA;[(2, 1), (1, 2), (2, 2), (2, 3), (3, 3)] -&amp;gt; F&#xA;[(1, 1), (1, 2), (1, 3), (1, 4), (1, 5)] -&amp;gt; I&#xA;[(1, 1), (2, 1), (1, 2), (1, 3), (1, 4)] -&amp;gt; L&#xA;[(1, 1), (1, 2), (2, 2), (2, 3), (2, 4)] -&amp;gt; N&#xA;[(1, 1), (1, 2), (2, 3), (2, 2), (1, 3)] -&amp;gt; P&#xA;[(1, 3), (3, 3), (2, 3), (2, 2), (2, 1)] -&amp;gt; T&#xA;[(1, 1), (1, 2), (2, 1), (3, 1), (3, 2)] -&amp;gt; U&#xA;[(1, 1), (2, 1), (3, 1), (3, 2), (3, 3)] -&amp;gt; V&#xA;[(1, 1), (2, 1), (2, 2), (3, 2), (3, 3)] -&amp;gt; W&#xA;[(2, 1), (1, 2), (2, 3), (3, 2), (2, 3)] -&amp;gt; X&#xA;[(1, 1), (2, 1), (3, 1), (4, 1), (3, 2)] -&amp;gt; Y&#xA;[(1, 3), (2, 3), (2, 2), (2, 1), (3, 1)] -&amp;gt; Z&#xA;&#xA;[(3, 6), (4, 6), (5, 6), (3, 5), (4, 5)] -&amp;gt; P&#xA;[(7, 7), (8, 6), (7, 6), (9, 6), (8, 5)] -&amp;gt; F&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, so the shortest answer in bytes wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Note to sandbox viewers: I'm not sure whether I should go with the fixed output system that's there now, or if I should allow arbitrary (but consistent) output formats. If anyone has a strong opinion about this, leave a comment!)&lt;/p&gt;&#xA;" OwnerUserId="52767" LastActivityDate="2016-12-30T04:47:55.230" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11085" PostTypeId="2" ParentId="2140" CreationDate="2016-12-30T09:09:48.017" Score="1" Body="&lt;h1&gt;Re-Implement &lt;code&gt;tail&lt;/code&gt; in your favorite language! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h3&gt;The Challenge&lt;/h3&gt;&#xA;&lt;p&gt;For the Linux users on PPCG, you know what &lt;code&gt;tail&lt;/code&gt; does. For those who don't know, &lt;code&gt;tail&lt;/code&gt; outputs the last &lt;code&gt;n&lt;/code&gt; lines of a file or STDIN.&lt;/p&gt;&#xA;&lt;p&gt;For the purposes of this challenge, you are to (partially) re-implement &lt;code&gt;tail&lt;/code&gt; in a language of your choice. However, to make everything simpler, only the following requirements will be enforced:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program will only be taking input from STDIN (or equivalent).&lt;/li&gt;&#xA;&lt;li&gt;Your program need only output the last 10 lines, as denoted by the newline character (&lt;code&gt;\n&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Your program must output a trailing newline.&lt;/li&gt;&#xA;&lt;li&gt;Your program must output to STDOUT (or equivalent).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may assume that your program will always be passed text.&lt;/p&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer (in bytes) wins.&lt;/p&gt;&#xA;" OwnerUserId="15422" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2016-12-30T09:09:48.017" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11087" PostTypeId="2" ParentId="11047" CreationDate="2016-12-30T12:36:06.453" Score="4" Body="&lt;h1&gt;Use Github's Gists for hosting text files&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If you want to associate an external text file to your challenge, I'd recommend &lt;a href=&quot;https://gist.github.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github's Gists&lt;/a&gt; as a good way to do it. Github is a site devoted to hosting the code and data of anyone who wants it hosted. I host Pyth on Github, for instance. It's got a huge userbase, it's been around for a long time, and it's survived a denial of service attack from the Chinese government (probably) with no downtime. Your links won't go dead, your posts won't get mangled, it'll be great.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Github also has change tracking, to alleviate confusion if you need to make a change, which is a helpful feature. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;To make a Gist, go to &lt;a href=&quot;https://gist.github.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://gist.github.com/&lt;/a&gt; and paste your text into the box. Here's an &lt;a href=&quot;https://gist.github.com/isaacg1/8d29a8c22bdd02839dba2824bcc6403b&quot; rel=&quot;nofollow noreferrer&quot;&gt;example&lt;/a&gt; I made that has a dictionary as its contents.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2016-12-30T12:36:06.453" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11091" PostTypeId="2" ParentId="5243" CreationDate="2016-12-31T00:46:02.170" Score="6" Body="&lt;h1&gt;500 rep - Bubblegum Factorial&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://esolangs.org/wiki/Bubblegum&quot; rel=&quot;nofollow noreferrer&quot;&gt;Bubblegum&lt;/a&gt; is designed for constant output -  unless the code has a specific SHA-hash, you won't be able to write a program which takes input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, I will award 500 rep for a factorial program in Bubblegum. I don't really expect this to be fulfilled, as it requires major advances in cryptography to be possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If anyone ever completes this, post it as a submission to the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/607/find-the-factorial&quot;&gt;Factorial challenge&lt;/a&gt;, where I will award the bounty.&lt;/p&gt;&#xA;" OwnerUserId="60919" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2016-12-31T00:46:02.170" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11093" PostTypeId="2" ParentId="2140" CreationDate="2016-12-31T11:34:22.070" Score="2" Body="&lt;h1&gt;Smallest integer divisible by 2..n&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given an integer n, output the smallest integer divisible by 2,3,4,...,n inclusive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2520 is divisible by every integer from 2 to 10.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Shortest code in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Dup?&lt;/li&gt;&#xA;&lt;li&gt;Better Wording?&lt;/li&gt;&#xA;&lt;li&gt;Restrictions/Rules?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="54014" LastActivityDate="2016-12-31T11:34:22.070" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11094" PostTypeId="2" ParentId="2140" CreationDate="2016-12-31T13:29:44.987" Score="0" Body="&lt;h2&gt;The many errors of twin primes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/classification&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;classification&amp;#39;&quot; rel=&quot;tag&quot;&gt;classification&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; this is a repost of my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/45584/recognize-twin-primes-by-crashing&quot;&gt;earlier challenge&lt;/a&gt;, but with a different winning condition and better rules.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Bob was handed the following assignment for his programming class (this is not the actual challenge).&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Homework assignment 11: Twin primes&lt;/strong&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Take as input an integer &lt;strong&gt;n &amp;ge; 8&lt;/strong&gt; and print a single character, depending on &lt;strong&gt;n&lt;/strong&gt;:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;If &lt;strong&gt;n&lt;/strong&gt; is not a prime number, print &lt;code&gt;N&lt;/code&gt; for &quot;Not prime&quot;.&lt;/li&gt;&#xA;  &lt;li&gt;If &lt;strong&gt;n&lt;/strong&gt; is a prime number, but neither of &lt;strong&gt;n - 2&lt;/strong&gt; and &lt;strong&gt;n + 2&lt;/strong&gt; is, print &lt;code&gt;I&lt;/code&gt; for &quot;Isolated prime&quot;.&lt;/li&gt;&#xA;  &lt;li&gt;If &lt;strong&gt;n&lt;/strong&gt; and &lt;strong&gt;n + 2&lt;/strong&gt; are both prime numbers, print &lt;code&gt;L&lt;/code&gt; for &quot;Lower twin prime&quot;.&lt;/li&gt;&#xA;  &lt;li&gt;If &lt;strong&gt;n&lt;/strong&gt; and &lt;strong&gt;n - 2&lt;/strong&gt; are both prime numbers, print &lt;code&gt;U&lt;/code&gt; for &quot;Upper twin prime&quot;.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Bob tried hard to solve the assignment, but his program kept crashing, and in the end, he gave up and submitted it in hope of partial credit. Nevertheless, Bob's program has the curious property that even though it never does what it's supposed to, the input is still classified correctly depending on the program's behavior: non-primes result in no output, isolated primes in a crash, lower twin primes in an infinite loop with no output, and upper twin primes in an infinite loop that keeps printing the correct message.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to replicate the behavior or Bob's solution: you shall write a program or function that behaves as follows.&#xA;Your input is a single integer &lt;strong&gt;n &amp;ge; 8&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If &lt;strong&gt;n&lt;/strong&gt; is not a prime number, print nothing and exit gracefully.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;strong&gt;n&lt;/strong&gt; is a prime number, but none of &lt;strong&gt;n - 2&lt;/strong&gt; or &lt;strong&gt;n + 2&lt;/strong&gt; is, print nothing and exit with a runtime error of some kind (like stack overflow or division by 0).&lt;/li&gt;&#xA;&lt;li&gt;If &lt;strong&gt;n&lt;/strong&gt; and &lt;strong&gt;n + 2&lt;/strong&gt; are both prime numbers, print nothing and keep running indefinitely (or until you run out of memory).&lt;/li&gt;&#xA;&lt;li&gt;If &lt;strong&gt;n&lt;/strong&gt; and &lt;strong&gt;n - 2&lt;/strong&gt; are both prime numbers, repeatedly print the character &lt;code&gt;U&lt;/code&gt; to STDOUT indefinitely (or until you run out of memory). The output can contain newlines, commas or other separators.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Input can be taken with any of our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;default methods&lt;/a&gt;, but all output &lt;em&gt;must&lt;/em&gt; go to STDOUT (and STDERR in case of error) or closest alternative.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The lowest byte count wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;8 -&amp;gt; [no output]&#xA;9 -&amp;gt; [no output]&#xA;10 -&amp;gt; [no output]&#xA;11 -&amp;gt; [infinite loop]&#xA;12 -&amp;gt; [no output]&#xA;13 -&amp;gt; UUUUUUUUU[continues indefinitely]&#xA;14 -&amp;gt; [no output]&#xA;15 -&amp;gt; [no output]&#xA;16 -&amp;gt; [no output]&#xA;17 -&amp;gt; [infinite loop]&#xA;18 -&amp;gt; [no output]&#xA;19 -&amp;gt; UUUUUUUUU[continues indefinitely]&#xA;20 -&amp;gt; [no output]&#xA;21 -&amp;gt; [no output]&#xA;22 -&amp;gt; [no output]&#xA;23 -&amp;gt; [runtime error]&#xA;29 -&amp;gt; [infinite loop]&#xA;31 -&amp;gt; UUUUUUUUU[continues indefinitely]&#xA;37 -&amp;gt; [runtime error]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sandbox notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To keep the rules simple, I decided to only allow output to STDOUT.&lt;/p&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.533" LastActivityDate="2017-01-12T07:49:14.397" CommentCount="5" CommunityOwnedDate="2017-01-01T06:54:19.570" ContentLicense="CC BY-SA 3.0" />
  <row Id="11096" PostTypeId="2" ParentId="2140" CreationDate="2016-12-31T13:57:22.207" Score="-4" Body="&lt;h1&gt;Beep. Boop. Maggot? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Read input from STDIN until enter is pressed.&lt;/li&gt;&#xA;&lt;li&gt;If the input is &quot;Beep&quot;, continue.&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, print &quot;Wrong!&quot; and exit.&lt;/li&gt;&#xA;&lt;li&gt;Repeat steps one to three with &quot;Boop&quot; instead.&lt;/li&gt;&#xA;&lt;li&gt;Execute step one.&lt;/li&gt;&#xA;&lt;li&gt;If the input is &quot;Maggot&quot;, output &quot;Done&quot;. &#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Otherwise, output &quot;Wrong.&quot;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Remove punctuation (&lt;code&gt;?.!'&quot;&lt;/code&gt;), ignore capitalization (&lt;code&gt;a-zA-Z&lt;/code&gt; only), and strip whitespace (&lt;code&gt;\t&lt;/code&gt; and &lt;code&gt;&lt;/code&gt;)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Notes:&lt;/em&gt; You must print the text word-for-word, character-for-character. Step 3 is &lt;code&gt;Wrong!&lt;/code&gt;, while Step 6 is &lt;code&gt;Wrong.&lt;/code&gt; &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Hints&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Notice how &lt;code&gt;b&lt;b&gt;oo&lt;/b&gt;p&lt;/code&gt; is just &lt;code&gt;b&lt;b&gt;ee&lt;/b&gt;p&lt;/code&gt; with the o's turned into e's.&lt;/li&gt;&#xA;&lt;li&gt;There is lots of repetition here, but with many caveats. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41088" LastEditorUserId="41088" LastEditDate="2017-01-01T00:15:59.733" LastActivityDate="2017-01-01T00:15:59.733" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11102" PostTypeId="2" ParentId="2140" CreationDate="2017-01-01T08:39:45.127" Score="0" Body="&lt;h1&gt;Arrange ranges of numbers in columns&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program to print from &lt;em&gt;m&lt;/em&gt; to input &lt;em&gt;n&lt;/em&gt; with step &lt;em&gt;s&lt;/em&gt;, arranging the numbers in either horizontal or vertical columns.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Clarifications&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can use any two values, or kinds of values, for signifying horizontal and vertical columns, specifying these in your answer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;from:&#xA;m = 1, n = 15, s = 1, vertical columns&#xA;to:&#xA;         111111&#xA;123456789012345&#xA;&#xA;from:&#xA;m = 1, n = 11, s = 2, horizontal columns&#xA;to:&#xA;1&#xA;3&#xA;5&#xA;7&#xA;9&#xA;11&#xA;&#xA;from:&#xA;m = 1, n = 11, s = 2, vertical columns&#xA;to:&#xA;     1&#xA;135791&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Any more clarifications or test cases?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;This challenge is based on a &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/24690794#24690794&quot;&gt;chat mini challenge by Helka Homba&lt;/a&gt;, which is allowed to be used in real challenges under the conditions of &lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=27296595#27296595&quot;&gt;Calvin's Hobbies Public License&lt;/a&gt;&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="48538" LastActivityDate="2017-01-01T08:39:45.127" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11103" PostTypeId="1" AcceptedAnswerId="11123" CreationDate="2017-01-01T10:09:33.263" Score="26" ViewCount="673" Body="&lt;p&gt;The reason that we don't allow reposts is because the same answers will be copied from the first challenge and the original can still be answered. But what about answer-chaining challenges? Those are inherently different if they were run multiple times. Imagine if the challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/102370/add-a-language-to-a-polyglot&quot;&gt;Add a language to a polyglot&lt;/a&gt; started with LISP, it could have ended up being a completely different challenge. (that might not have been the best example). The point is, do you lot think it could be acceptable to repost such challenges, provided we don't spam them over and over? It would enable languages that at this point can no longer be reasonably inserted to compete, and could provide different kinds of challenges.&lt;/p&gt;&#xA;" OwnerUserId="60042" LastEditorUserId="66833" LastEditDate="2021-05-09T23:32:37.870" LastActivityDate="2021-05-09T23:32:37.870" Title="Reposts of answer-chaining challenges" Tags="|discussion|duplicates|challenges|reposting|" AnswerCount="4" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11105" PostTypeId="2" ParentId="2140" CreationDate="2017-01-01T12:24:15.077" Score="1" Body="&lt;h1&gt;A range of operations on the same inputs&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that takes two integers as input (you may assume the first is nonnegative and the second is positive), and outputs each of the following values:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The sum of those integers&lt;/li&gt;&#xA;&lt;li&gt;The difference of those integers (either the absolute difference, or the first minus the second, is acceptable)&lt;/li&gt;&#xA;&lt;li&gt;The product of those integers&lt;/li&gt;&#xA;&lt;li&gt;The first integer divided by the second (any of integer division, floating-point division, exact division is acceptable)&lt;/li&gt;&#xA;&lt;li&gt;The remainder upon dividing the first integer by the second&lt;/li&gt;&#xA;&lt;li&gt;The bitwise AND of the integers&lt;/li&gt;&#xA;&lt;li&gt;The bitwise OR of the integers&lt;/li&gt;&#xA;&lt;li&gt;The bitwise XOR of the integers&lt;/li&gt;&#xA;&lt;li&gt;The first nonzero integer (i.e. the first integer if it's nonzero, or the second integer if the first is zero)&lt;/li&gt;&#xA;&lt;li&gt;The concatenation of the string representations of the integers (in decimal)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program wins. Good luck!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The basic idea I'm going for is to have the operations be very simple ones  that will be primitives in a wide range of languages (although potentially with the occasional curveball), but to have enough operations that it's worth at least considering finding a way to compress the repetitive &lt;code&gt;print  a+b,a-b,a*b&lt;/code&gt;… nature of the program. At the moment, there probably aren't enough for compression to be worth it except in the occasional golfing language, but adding more operations runs the risk of requiring something to be done that's nontrivial in its own right or hard to compress. (Actually, even writing the uncompressed version can be fairly interesting in many golfing languages, as this sort of operation that reuses multiple inputs is quite different from the more common situation where the input of each operation is the output of the one before.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, is this a duplicate? I didn't find one but it's a hard sort of problem to search for.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-01-01T12:24:15.077" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11108" PostTypeId="2" ParentId="2140" CreationDate="2017-01-01T20:54:41.093" Score="13" Body="&lt;h1&gt;Which way will the see-saw turn? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given an ASCII string of spaces, &lt;code&gt;o&lt;/code&gt;s, and &lt;code&gt;O&lt;/code&gt;s, balance them on a see-saw pinned at the center, and determine which way it tilts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, &lt;code&gt;ooO O&lt;/code&gt; represents the situation:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ooO O&#xA;===== &#xA;  ^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A lowercase &lt;code&gt;o&lt;/code&gt; has a mass of 1kg, and an uppercase &lt;code&gt;O&lt;/code&gt; has a mass of 2kg. The &lt;strong&gt;torque&lt;/strong&gt; of a weight is its mass multiplied by its distance from the center of the see-saw. If the sum of the torques on the right of the see-saw is greater, the see-saw will tilt clockwise. If the sum of the torques on the left is greater, it will tilt counterclockwise.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the situation above, the total clockwise torque is &lt;code&gt;2 * 2 = 4&lt;/code&gt;, which is greater than the total counter-clockwise torque, &lt;code&gt;1 * 2 + 1 * 1 = 3&lt;/code&gt;. So the see-saw tilts clockwise.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may choose two &lt;strong&gt;fixed&lt;/strong&gt; output values — one for “clockwise” and one for “counterclockwise”. Your program must consistently output these values for their respective situations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input is a string of odd length &lt;strong&gt;3 ≤ n ≤ 255&lt;/strong&gt;, and it is guaranteed to never be in perfect equilibrium.&lt;/p&gt;&#xA;" OwnerUserId="3852" LastEditorUserId="3852" LastEditDate="2017-01-03T13:51:09.847" LastActivityDate="2017-01-03T13:51:09.847" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11113" PostTypeId="1" AcceptedAnswerId="11116" CreationDate="2017-01-02T12:23:17.047" Score="1" ViewCount="123" Body="&lt;p&gt;I know I'm probably on thin ice, but I tried an answer in the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/105121/print-hello-world/105320#105320&quot;&gt;print &amp;quot;Hello, World!&amp;quot;&lt;/a&gt; challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I consider it to be 5 bytes total, but the user &lt;em&gt;ais523&lt;/em&gt; pointed out that I had to count the entire batch command (the name of the interpretter, the name of the file plus the piping parameter).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I may very well be wrong, but whats the general thought on these type of answers?&lt;/p&gt;&#xA;" OwnerUserId="56477" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2017-01-05T16:12:40.287" Title="Bytecount for code solution" Tags="|discussion|policy|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11115" PostTypeId="1" CreationDate="2017-01-02T14:05:13.907" Score="4" ViewCount="157" Body="&lt;p&gt;I've been considering writing a couple of checksum-based challenges, and while checking for duplicates, I noticed that both &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hashing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hashing&amp;#39;&quot; rel=&quot;tag&quot;&gt;hashing&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/checksum&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;checksum&amp;#39;&quot; rel=&quot;tag&quot;&gt;checksum&lt;/a&gt; exist.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, hashing and checksums aren't the same thing, but people seem to be using them fairly interchangeably, and they're certainly related in spirit. There are three solutions I can think of (and maybe other solutions that people will think of in the answers):&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Ensure that the tags have no overlap, going through all questions that use either and making sure the tag is appropriate;&lt;/li&gt;&#xA;&lt;li&gt;Make the tags into synonyms, and use them interchangeably from then on;&lt;/li&gt;&#xA;&lt;li&gt;Make one of the tags into a subset of the other (so all challenges about checksums or hashing will have one of the tags in particular, and a subset will have both).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Which of these options will lead to the best categorisations of these sorts of questions?&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-01-04T01:32:38.993" Title="The tags [hashing] and [checksum]: do we need both?" Tags="|discussion|tags|tag-synonyms|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11116" PostTypeId="2" ParentId="11113" CreationDate="2017-01-02T14:11:50.613" Score="9" Body="&lt;h1&gt;If you're using multiple languages in an answer, your byte count includes the glue that holds them together&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The byte count should include all the bytes used for the program. If the program's being run in an unusual way, we use byte penalties for the configuration needed to run it; this is required to stop people putting their entire program into compiler arguments (which is a commonly used loophole in at least C, on some golfing sites).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Piping the result of one program into another is a similar sort of unusual way to run the program, and similarly needs a byte penalty. (Nonetheless, it's sometimes useful despite the penalty; I wrote such an answer &lt;a href=&quot;https://codegolf.stackexchange.com/a/102537/62131&quot;&gt;here&lt;/a&gt;, and had to pay quite a few bytes gluing Jelly to GraphViz via the use of a third programming language; a Jelly answer would have been much longer without being able to call into GraphViz, though, and vice versa, so the combination was worth it.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you didn't have such a penalty, it'd be fairly easy to construct 0-byte solutions to arbitrary problems. (IIRC, there's a language in which a program entirely consisting of newlines will output itself plus one extra newline. Pipe that into itself sufficiently many times, pipe the result into Lenguage, and you have the program entirely encoded in the plumbing, with no input bytes for the program itself.)&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2017-01-02T14:11:50.613" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11118" PostTypeId="5" CreationDate="2017-01-02T14:28:31.533" Score="0" Body="&lt;p&gt;The tagging system on Stack Exchange supports &lt;a href=&quot;https://meta.stackexchange.com/q/70710/347902&quot;&gt;tag synonyms&lt;/a&gt;; basically, this is a redirect between tags, so that an attempt to use one tag causes it to be treated as the other tag. This mechanism is useful when two tags have interchangeable meanings.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On PPCG Meta, the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tag-synonyms&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tag-synonyms&amp;#39;&quot; rel=&quot;tag&quot;&gt;tag-synonyms&lt;/a&gt; tag is used for questions about whether synonyms should be created/deleted/modified; in other words, it's for questions about whether two tags are the same, or different.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="14149" LastEditorDisplayName="user62131" LastEditDate="2017-08-27T15:40:44.990" LastActivityDate="2017-08-27T15:40:44.990" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11119" PostTypeId="4" CreationDate="2017-01-02T14:28:31.533" Score="0" Body="For questions about whether two tags should be separate or merged together." OwnerDisplayName="user62131" LastEditorDisplayName="user62131" LastEditDate="2017-01-02T14:28:31.533" LastActivityDate="2017-01-02T14:28:31.533" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11120" PostTypeId="2" ParentId="11113" CreationDate="2017-01-02T14:49:58.343" Score="2" Body="&lt;h2&gt;You must include ALL bytes required to achieve desired output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This seems really cut and dry to me. You're not actually using 5 bytes for your solution. The 5 bytes in question are &lt;code&gt;&amp;gt;LPT1&lt;/code&gt; and I can assure you, those won't pass &quot;Hello, World!&quot; to my printer without any other intervention if I enter those into a batch terminal. I don't know much batch and I don't know Stuck, but I'd imagine you'd at least need &lt;code&gt;stuck a&amp;gt;LPT1&lt;/code&gt;, which is 12 bytes. This is also ignoring the fact that &lt;code&gt;a&lt;/code&gt; in this case still needs to actually be created (which if you used something like &lt;code&gt;touch a&lt;/code&gt; would be another 7 bytes).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe this confusion comes from the fact you're using a REPL (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7842/when-is-code-that-requires-a-repl-acceptable&quot;&gt;which is allowed&lt;/a&gt;), so you're missing the fact that Stuck still has to be actually called, and needs enough information to still actually output &quot;Hello, World!&quot; so that output can actually ultimately reach the printer.&lt;/p&gt;&#xA;" OwnerUserId="62670" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2017-01-02T14:49:58.343" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11121" PostTypeId="2" ParentId="11103" CreationDate="2017-01-02T19:23:41.903" Score="5" Body="&lt;h1&gt;This should not be allowed, but we could lower the threshold for these challenges to be considered a &amp;quot;duplicate&amp;quot;.&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The reason that we don't allow reposts is because the same answers will be copied from the first challenge and the original can still be answered.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;That's certainly not the only reason. There are four reasons I can think of to not allow duplicate challenges.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Like you mentioned, answers from the first can be copied and posted on the new one,&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The old challenge can usually still accept answers,&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A challenge becomes less interesting when it's been done before. Even challenges around a theme become boring after being repeated too many times. (For example, flag challenges, &amp;quot;Print the alphabet in this pattern&amp;quot; challenges)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Taking credit for the creativity of another user who wrote the original challenge is not OK.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Now you are right, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; challenges address most of these points. &lt;strong&gt;1&lt;/strong&gt; is moot because a tiny change in the first post could drastically change future answers. &lt;strong&gt;2&lt;/strong&gt; is addressed somewhat, because lots of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; challenges have a deadline, or are impossibly hard to add a new answer to. (For example, &lt;a href=&quot;https://codegolf.stackexchange.com/q/40562/31716&quot;&gt;95 movie-quotes&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;p&gt;But that still leaves points &lt;strong&gt;3&lt;/strong&gt; and &lt;strong&gt;4&lt;/strong&gt;. Reposting answer-chaining challenges is still taking credit for someone else's creative challenge idea, and still gets old if done too often.&lt;/p&gt;&#xA;&lt;p&gt;So I think that we should not allow directly copying an old &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; challenge, but I think it's perfectly reasonable to be &lt;em&gt;slightly&lt;/em&gt; more lenient about what we consider to be a duplicate.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-03T02:38:20.347" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11123" PostTypeId="2" ParentId="11103" CreationDate="2017-01-03T02:35:00.870" Score="16" Body="&lt;h1&gt;Yes, under specific circumstances:&lt;/h1&gt;&#xA;&lt;p&gt;I think that DJMcMayhem made some really good points as to why we don't like duplicates.  I'll address the two he felt were still relevant to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;3&quot;&gt;&#xA;&lt;li&gt;A challenge becomes less interesting when it's been done before. Even challenges around a theme become boring after being repeated too many times. (For example, flag challenges, &amp;quot;Print the alphabet in this pattern&amp;quot; challenges)&lt;/li&gt;&#xA;&lt;li&gt;Taking credit for the creativity of another user who wrote the original challenge is not OK.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I believe that the following measures would solve both point 3 and 4:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Require that reposts &lt;strong&gt;be posted by the challenge author, or with their permission&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Require that a repost be posted at least &lt;strong&gt;6 months after the original post, maximum 3 times&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;strong&gt;Both measures would act as a natural limiter to ensure that reposts are high-quality.&lt;/strong&gt;  It doesn't eliminate the problem of low-quality reposts, but I think that &lt;strong&gt;the benefit outweighs the cost&lt;/strong&gt;.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-08T02:24:10.883" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="11124" PostTypeId="2" ParentId="2140" CreationDate="2017-01-03T08:11:32.293" Score="2" Body="&lt;h2&gt;Compare string repetitiveness &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given two strings, decide which one is more repetitive. This is the string whose most common character appears more often in it. If these are equal, then tiebreak by counting their respective second most common characters, and so on. Once a string's distinct characters have been exhausted, all further counts are zero.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Give one consistent output if the first string is more repetitive, and a different consistent output if the second one is. You will never be given a complete tie.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may assume input strings will be non-empty and use only ASCII characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring:&lt;/strong&gt; Your code's score is its repetitiveness, with comparing lower being better. Put in your header the counts of the top 3 most common characters, and the full frequency list in your body.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test cases:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TODO&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2017-06-07T04:19:50.007" LastActivityDate="2017-06-07T04:19:50.007" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="11128" PostTypeId="2" ParentId="11103" CreationDate="2017-01-03T17:14:58.937" Score="-1" Body="&lt;p&gt;&lt;strong&gt;Please note that, even if this technically works, it actually lets you post dupes one after the other. That loophole should be eventually fixed. Any feedback for that instead of just downvotes is appreciated.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Yes, allow reposting, but:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Make sure that &lt;strong&gt;you cannot solve the original challenge or any of its already existing reposts&lt;/strong&gt;. If you can, there is no reason to repost, as solving at least one of them isn't impossible.&lt;/li&gt;&#xA;&lt;li&gt;Adding to the above bullet-point, if an answer is posted to a repost older than yours or the original challenge, and your challenge didn't have answers at the time the new answer was posted, your repost is subject to closing as a dupe of that repost. Please keep up with the spirit of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;. Answering such a repost is extremely discouraged, although there is no easy way of determining whether a newer answer to an older repost or the original challenge has been posted. The only way is to look through each older repost and see if an answer has been posted there later than the posting of the repost question. Note that if the question poster is the only answer poster, it still counts as a dupe.&lt;/li&gt;&#xA;&lt;li&gt;Credit the &lt;em&gt;original author&lt;/em&gt;, not subsequent reposters, and link to the original challenge. Linking to the original challenge will add the repost to the original challenge's &amp;quot;Linked questions&amp;quot;, thus marking the existence of your repost. If your repost is closed as a dupe, the link is subject to be removed, or replaced with a no-ad URL-shortened link (such as goo.gl or bit.ly), so as to not clutter the original question's &amp;quot;Linked&amp;quot; list.&lt;/li&gt;&#xA;&lt;li&gt;Self-contain the original challenge AS-IS, do not just give a link to the old challenge which might have been deleted, so that users without moderator privileges can still read the challenge's spec.&lt;/li&gt;&#xA;&lt;li&gt;If the original challenge has been closed, do not repost it yourself. Doing such a thing means your challenge will most probably be closed too, as the content is AS-IS.&lt;/li&gt;&#xA;&lt;li&gt;Follow the exact formatting described below.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Format as:&lt;/h1&gt;&#xA;&lt;p&gt;Title: &lt;code&gt;&amp;lt;original title&amp;gt; (Repost &amp;lt;repost number&amp;gt;)&lt;/code&gt;. Replace &lt;code&gt;&amp;lt;original title&amp;gt;&lt;/code&gt; with the original post's title, and &lt;code&gt;&amp;lt;repost number&amp;gt;&lt;/code&gt; with the number of your repost (first repost is &lt;code&gt;1&lt;/code&gt;, second is &lt;code&gt;2&lt;/code&gt;, etc.)&lt;/p&gt;&#xA;&lt;p&gt;Content:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;**Note that this is a repost of the original challenge linked [here](&amp;lt;link&amp;gt;).**&#xA;&#xA;---&#xA;&amp;lt;original challenge&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Replace &lt;code&gt;&amp;lt;link&amp;gt;&lt;/code&gt; with a link to the original challenge (not URL-shortened unless repost is closed) and &lt;code&gt;&amp;lt;original challenge&amp;gt;&lt;/code&gt; with the contents of the last revision of the original challenge where no answer was accepted. The link must be in the form of &lt;code&gt;/q/&amp;lt;id&amp;gt;&lt;/code&gt;, where &lt;code&gt;&amp;lt;id&amp;gt;&lt;/code&gt; is the original question's ID.&lt;/p&gt;&#xA;&lt;p&gt;Tags must be the same as in the original challenge. No added or removed tags please.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-03T17:14:58.937" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="11129" PostTypeId="2" ParentId="2140" CreationDate="2017-01-03T20:00:54.230" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://www.wikiwand.com/en/Natural_sort_order&quot; rel=&quot;nofollow noreferrer&quot;&gt;Natural Order Sorting&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Goal&lt;/strong&gt; :: Writing a sorting algorithm that doesn't need preceding zeroes to sort music files properly. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Natural Order Sorting will be defined in this way:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Consecutive Digits&lt;/strong&gt; (ie &lt;code&gt;[0-9]+&lt;/code&gt;) are considered one character and its value is the evaluation of those digits as an integer (eg &lt;code&gt;int(&quot;0123&quot;)&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Uppercase Letters&lt;/strong&gt; (ie &lt;code&gt;[A-Z]&lt;/code&gt;) are each their own character and its value is the ASCII value of the letter&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Lowercase Letters&lt;/strong&gt; (ie &lt;code&gt;[a-z]&lt;/code&gt;) are each their own character and its value is the corresponding uppercase value plus &lt;code&gt;.5&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Symbols&lt;/strong&gt; (ie &lt;code&gt;[^0-z]&lt;/code&gt;) are each their own character and its value is the ASCII value of the symbol&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Symbols&lt;/strong&gt; are always before &lt;strong&gt;Digits&lt;/strong&gt; which are always before &lt;strong&gt;Letters&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;If two characters are in the same category, the one with the small value precedes the other&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Input&lt;/strong&gt; :: An unordered list of strings (flexible on how)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Output&lt;/strong&gt; :: A list of strings that are naturally ordered (flexible on how)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Victory&lt;/strong&gt; :: Shortest program/function in bytes, wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input                             Output&#xA;-----                             ------&#xA;10,11,8,9                      -&amp;gt; 8,9,10,11&#xA;appleA,CiderB,AppleC           -&amp;gt; AppleC,appleA,CiderB&#xA;File1,File12,File143A,File031B -&amp;gt; File1,File2,File031B,File143A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot;&gt;sorting&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43214" LastEditorUserId="44874" LastEditDate="2017-01-04T18:01:56.897" LastActivityDate="2017-01-04T18:01:56.897" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11131" PostTypeId="2" ParentId="11115" CreationDate="2017-01-04T01:32:38.993" Score="4" Body="&lt;h1&gt;Make &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/checksum&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;checksum&amp;#39;&quot; rel=&quot;tag&quot;&gt;checksum&lt;/a&gt; a synonym for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hashing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hashing&amp;#39;&quot; rel=&quot;tag&quot;&gt;hashing&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Although hashing and checksums aren't the same thing, a checksum can certainly be seen as a sort of simple hashing algorithm. As such, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hashing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hashing&amp;#39;&quot; rel=&quot;tag&quot;&gt;hashing&lt;/a&gt; isn't &lt;em&gt;inappropriate&lt;/em&gt; for a checksum-based problem, even though it's vaguer than it could be. (If this solution is adopted, I'd change its tag wiki to clarify that it covers both cryptographic and non-cryptographic hash functions.) The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/checksum&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;checksum&amp;#39;&quot; rel=&quot;tag&quot;&gt;checksum&lt;/a&gt; tag is only sparsely used right now, and I'm not sure we would have a huge advantage to the uses of hashes in cryptography from the uses in checking for corruption (not to mention that there's a third common use of hashes on PPCG which doesn't fall nearly into either category, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/classfication&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;classfication&amp;#39;&quot; rel=&quot;tag&quot;&gt;classfication&lt;/a&gt;, but this tends to be a property of the answers rather than the questions).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As such, the best technical solution is probably to set up a tag synonym (i.e. a redirect) from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/checksum&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;checksum&amp;#39;&quot; rel=&quot;tag&quot;&gt;checksum&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hashing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hashing&amp;#39;&quot; rel=&quot;tag&quot;&gt;hashing&lt;/a&gt;; that way, anyone who tried to use &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/checksum&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;checksum&amp;#39;&quot; rel=&quot;tag&quot;&gt;checksum&lt;/a&gt; on a challenge or in the search box would get &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hashing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hashing&amp;#39;&quot; rel=&quot;tag&quot;&gt;hashing&lt;/a&gt; instead. If this answer is well-received, I'll officially propose the synonym.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-01-04T01:32:38.993" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11132" PostTypeId="1" CreationDate="2017-01-04T05:25:51.160" Score="7" ViewCount="200" Body="&lt;p&gt;Challenges by default ask for submissions that are either functions or complete programs.  Historically Brain-Flak submissions have been complete programs because there is no way to define functions like in other languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However code Snippets in Brain-Flak can be thought of as functions because they do return a value.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In Brain-Flak,&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;()()()()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is arguably the same thing as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;lambda:4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;in Python.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The latter would be a valid answer if the question was a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; question to output 4 so why not the former?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The argument for functions with input is a little more tenuous since the Stack is more like a global variable than a input, but one might say that&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{({})({}[()])}{}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;lambda x:x**2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;are equivalent and thus the former is also a function.  To what extent can snippets written in Brain-Flak (and other Flaks such as Brain-Flueue or Micro-Flak) be considered functions for PPCG submissions?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-01-04T06:35:34.410" LastActivityDate="2017-01-09T18:43:54.807" Title="Brain-Flak functions" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11139" PostTypeId="1" CreationDate="2017-01-05T03:07:53.383" Score="18" ViewCount="783" Body="&lt;p&gt;Around March of last year, chat users started becoming really annoyed by the level of noise in chat and became motivated enough to speak out about it, which lead to &lt;em&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8771/the-state-of-chat&quot;&gt;The state of chat&lt;/a&gt;&lt;/em&gt; being posted. Several months later, &lt;em&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10172/we-need-to-talk-about-chat&quot;&gt;We need to talk about chat&lt;/a&gt;&lt;/em&gt; was posted to address the worst of the noise and the most disruptive users. Most recently, &lt;em&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10919/should-we-have-even-more-room-owners-for-the-nineteenth-byte&quot;&gt;Should we have even more room owners for The Nineteenth Byte?&lt;/a&gt;&lt;/em&gt; was posted regarding adding more room owners to manage the noise levels at a time when most of the mods and room owners are absent.&lt;/p&gt;&#xA;&lt;p&gt;Everyone seems to agree that the noise level has lessened, but with the removal of the worst of the noise, the less-bad noise has become more apparent, and it's still aggravating to many.&lt;/p&gt;&#xA;&lt;h3&gt;Why is noise even a problem?&lt;/h3&gt;&#xA;&lt;p&gt;A few regular chat users have gone on record to say that they stopped participating in chat because of the noise. For instance, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8780/12914&quot;&gt;Peter Taylor&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10172/we-need-to-talk-about-chat#comment32543_10172&quot;&gt;Morgan Thrapp&lt;/a&gt;. Both of these chat users once contributed valuable and interesting content to our chat, but they don't anymore because the level of noise became too much.&lt;/p&gt;&#xA;&lt;p&gt;Relatedly, some time ago, I posted &lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=33487562#33487562&quot;&gt;this message&lt;/a&gt; as a knee-jerk reaction to a pattern of escalating noise (meaningless faces). I never expected it to get more than a few stars, but it got &lt;em&gt;fourteen stars&lt;/em&gt; by the time of this writing. That tells me that there are a lot of chat users who are aggravated by such noise &lt;em&gt;but they don't say anything&lt;/em&gt;. Who knows how many users silently left, barely participate, or never participate at all because of the noise they see when they enter?&lt;/p&gt;&#xA;&lt;h2&gt;What do we do about it?&lt;/h2&gt;&#xA;&lt;p&gt;I see two intertwined questions here:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What is noise?&lt;/li&gt;&#xA;&lt;li&gt;What is the purpose of The Nineteenth Byte?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I believe that resolving these questions will go a long way towards making most users happy, managing the level of noise, and perhaps even attracting valuable contributors to chat.&lt;/p&gt;&#xA;&lt;h3&gt;What is noise?&lt;/h3&gt;&#xA;&lt;p&gt;An observation that is at once fairly obvious and yet has not been spoken is that people disagree on what constitutes noise. Which of these count as &amp;quot;noise&amp;quot;, and why?&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Caret chains&lt;/li&gt;&#xA;&lt;li&gt;ASCII faces for the fun of it or in response to other ASCII faces&lt;/li&gt;&#xA;&lt;li&gt;ASCII faces in response to messages&lt;/li&gt;&#xA;&lt;li&gt;Announcements of arrival (&amp;quot;hi&amp;quot;, &amp;quot;I'm back&amp;quot;) and departure (&amp;quot;bye&amp;quot;, &amp;quot;gtg&amp;quot;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/34426808#34426808&quot;&gt;Poor pun chains&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/29081468#29081468&quot;&gt;Better pun chains&lt;/a&gt; (reads more like a conversation)&lt;/li&gt;&#xA;&lt;li&gt;Chat mini challenges (CMC)&lt;/li&gt;&#xA;&lt;li&gt;Stand-alone jokes or memes&lt;/li&gt;&#xA;&lt;li&gt;Jokes or memes in response to someone else&lt;/li&gt;&#xA;&lt;li&gt;Funny images or gifs&lt;/li&gt;&#xA;&lt;li&gt;Self-promotion of posts or projects&lt;/li&gt;&#xA;&lt;li&gt;Promotion of other users' posts or projects&lt;/li&gt;&#xA;&lt;li&gt;Deliberately poor English or meme-y spellings or phrases (e.g., &amp;quot;wat iz&amp;quot;)&lt;/li&gt;&#xA;&lt;li&gt;Messages with nothing more than a single question mark&lt;/li&gt;&#xA;&lt;li&gt;Chatter about who lives where or time-zone related chatter&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I've deliberately included a variety of common patterns that span some of the spectrum from noise to signal. Some people will see these as a natural way to converse in this kind of environment (&lt;em&gt;a la&lt;/em&gt; &lt;a href=&quot;https://xkcd.com/1709/&quot; rel=&quot;nofollow noreferrer&quot;&gt;xkcd 1709&lt;/a&gt;, especially the alt-text). Others will see these as detracting from interesting conversations that benefit many or everyone, or make it harder for them to find conversations that are interesting to them.&lt;/p&gt;&#xA;&lt;p&gt;We do have a set of guidelines in the &lt;a href=&quot;http://ppcg.github.io/chatiquette/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Chatiquette&lt;/a&gt;, but their efficacy is uncertain.&lt;/p&gt;&#xA;&lt;h3&gt;What is the purpose of The Nineteenth Byte?&lt;/h3&gt;&#xA;&lt;p&gt;Right now, TNB is serving two distinct functions at once: it is the main gathering place for people who frequent PPCG and it is the main chat room for discussing issues related to PPCG. I believe this is a significant motivator for the opinions expressed by multiple people in answers to &lt;em&gt;The state of chat&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;In my opinion, casual conversation will inevitably contain some amount of noise. That's just human nature in social situations. Thus, I believe the conflict mainly arises from the fact that it's hard to distinguish casual conversation from serious discussion. That's the main thrust of Peter Taylor's &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8771/the-state-of-chat#comment25075_8777&quot;&gt;comment&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The big problem I see with [pausing idle chatter for serious discussion] is that idle chatter reduces the usefulness of a room for serious discussion, because even if the meme-posting pauses for the duration, a) reviewing the transcript for serious discussion to which I want to add my views becomes a search for a needle in a haystack; b) as someone who only wants to participate in serious discussion, real-time participation requires sitting in the chat-room and glancing over when I see activity, but that becomes a waste of time when most of the activity is pointless crap.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Hence, I see three main options:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;TNB should be for both casual conversation and serious discussion&lt;/li&gt;&#xA;&lt;li&gt;TNB should be for casual conversation and a new chat room should be created for serious discussion&lt;/li&gt;&#xA;&lt;li&gt;TNB should be for serious discussion and a new chat room should be created for casual conversation&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I'd like to note here that &amp;quot;serious discussion&amp;quot; encompasses all kinds of discussion relating to Programming Puzzles and Code Golf. That is, discussions about golfing, about feedback on Sandbox entries, about challenges and submissions on the main site, about how to use golfing languages, and about issues such as these. That sort of thing. This avoids &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8774/12914&quot;&gt;the issue pointed out by xnor&lt;/a&gt; that &lt;a href=&quot;http://chat.stackexchange.com/rooms/30617/code-golfers-corner&quot;&gt;the chat room specifically about code golfing&lt;/a&gt; frequently dies due to lack of activity. A chat room for serious discussion about PPCG would have plenty of activity to keep it alive.&lt;/p&gt;&#xA;&lt;p&gt;I'd also like to clarify a chat room for casual conversation &lt;strong&gt;is not a room for noise&lt;/strong&gt;. It is a place for members of the community of PPCG to talk about whatever interests them with like-minded people. Topics are free to wander and touch on linguistics, cyber security, cooking, that sort of stuff.&lt;/p&gt;&#xA;&lt;p&gt;Of course, there very well might be additional options. Please feel free to bring them up in your answer (or comment) if you think they're at least as good as the three choices above.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;This is a complex and important issue. Please take the time to consider what course(s) of action will most benefit the community as a whole &lt;em&gt;and&lt;/em&gt; its individual constituents.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="12914" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-23T17:28:28.833" Title="Let's talk about chat again" Tags="|discussion|chat|" AnswerCount="5" CommentCount="19" ContentLicense="CC BY-SA 3.0" />
  <row Id="11141" PostTypeId="2" ParentId="11139" CreationDate="2017-01-05T05:47:13.897" Score="11" Body="&lt;p&gt;The Nineteenth Byte can be a place for both serious and casual conversations. I imagine it as a sort of virtual &quot;water cooler&quot; environment. Some people gather to chat about the site. Some people gather to have more casual conversations. That's perfectly fine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What's not fine is when people disrupt other conversations. To continue the water cooler analogy, the people making noise in TNB correspond to people standing around the water cooler, saying and doing things that distract other people from conversations (&quot;Mondays, right?&quot;, &quot;TGIF!&quot;, or blaring audio from their phones).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8777/45941&quot;&gt;Dennis said before&lt;/a&gt;, TNB cannot be what &lt;em&gt;everybody&lt;/em&gt; wants it to be. However, we can set some rules so that it can be a positive environment, and most people will be satisfied:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Don't disrupt active conversations.&lt;/li&gt;&#xA;&lt;li&gt;Important discussions about the site (e.g. moderator elections, scope discussions, discussion of the issues brought up in this post) take priority over other idle chatter. Don't expect a response if you try to start another conversation while there's an important discussion going on - instead, wait until a more appropriate time (you wouldn't interrupt people at the water cooler who are talking about a work project to chat about a sports team).&lt;/li&gt;&#xA;&lt;li&gt;If you don't have anything to contribute, don't. Silence is golden.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&quot;hi&quot;, &quot;bye&quot;, and other &quot;disposable&quot; messages don't count as contributing. By &lt;em&gt;disposable&lt;/em&gt;, I mean they wouldn't be missed if they were gone.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Don't engage in vitriolic conversations, and don't bait others into engaging. Sure, you may think that &lt;code&gt;&amp;lt;insert name here&amp;gt;&lt;/code&gt; is absolutely incapable of doing anything right, but that kind of anger-fueled conversation isn't productive. Take it elsewhere, or keep it to yourself. Remember, we're all here to have a good time.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If you can't follow these basic rules of etiquette, you aren't welcome in chat, and you will be dealt with according to the discretion of the moderators and room owners. That may sound harsh, but really, we're not asking much - just that you respect your fellow chatters, and apply the same social guidelines you follow in real life to chat.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for having multiple rooms:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Splitting golfing chat into &lt;a href=&quot;http://chat.stackexchange.com/rooms/30617/code-golfers-corner&quot;&gt;its own room&lt;/a&gt; has been tried before, and it didn't work (the room is rarely active, and on several occasions the only messages posted are noise to keep the room from being automatically frozen due to inactivity for the rare occasion that actual conversations happen there). There's no reason to expect trying to split serious and casual conversations into two separate rooms would go any differently.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2017-01-06T09:31:48.960" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="11144" PostTypeId="1" CreationDate="2017-01-05T08:38:10.813" Score="14" ViewCount="255" Body="&lt;p&gt;Users with sufficiently high reputation can vote to delete and undelete posts. This is something that we need to do occasionally on PPCG, due to things like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7987/62131&quot;&gt;answers that don't comply with the specification&lt;/a&gt; (the most common delete), and answers that didn't comply with the specification, but now do due to a change in the specification (the most common undelete).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every now and then I check the &lt;a href=&quot;https://codegolf.stackexchange.com/tools?tab=delete&amp;amp;daterange=last30days&quot;&gt;pending delete votes&lt;/a&gt; (note: requires quite a lot of reputation to view), to see if there are any posts on there that require deletion (ditto undeletion, but deletion is more common). Then I check to see if I agree, and cast my delete vote if I do. Recently, though, I nearly always end up getting told &quot;You have already voted to delete this post&quot;; not only are the votes-to-delete staying unresolved for a &lt;em&gt;long&lt;/em&gt; time, but so long that I've forgotten I cast my own!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Certainly, bad posts do get deleted on this site, but there are only really two common ways in which it happens: a) the post gets flagged as VLQ, typically due to an intentional spec noncompliance (which places it into the low quality queue and strongly increases the chance that enough users see it that it'll get the delete votes), or b) a diamond moderator sees the post and deletes it unilaterally. These are both worthy methods, but they don't handle the entirety of the content on the site:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Method a) is the one you're &quot;meant to use&quot; for bad content at PPCG (most likely because it's the only one that actually works well without unwanted side effects), and is quite effective at clearing up invalid answers when you can use it, but it has a major issue that the VLQ option often just doesn't turn up in the flag box (not even if you downvote the post first). In such cases, low-reputation users can't really do anything (a moderator attention flag would be too drastic, and an NAA flag violates our policy), so they just end up leaving the posts alone. In any case, many (possibly even the majority of) invalid answers can't go via the Low Quality queue because the interface blocks it.&lt;/li&gt;&#xA;&lt;li&gt;Method b) works fine when the diamond moderators happen to spot the post, but they can't be everywhere at once, and it doesn't really make much sense to force a relatively routine job, which the community is meant to be doing, up to the highest level. As such, summoning moderators &lt;em&gt;every time&lt;/em&gt; there's such a post and it can't be VLQ flagged would be unsustainable (and indeed, this is discouraged in practice, although the current policy as stated in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7987/62131&quot;&gt;this thread&lt;/a&gt; is indeed to use a moderator attention flag unless it seems plausible that the post might actually gather enough &quot;drive-by&quot; deletion votes votes).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Now, the reasoning here concludes that ideally, if it worked, we would be using a third method (indeed, the intended one): three users with enough reputation to cast delete votes do so. The problem is, you need multiple votes on the same post to delete it, and without users actually checking posts with pending delete votes, the posts are unlikely to gather the votes in question. There isn't a review queue for delete votes, like there is for close votes. As it is, though, our current policy basically concedes that this method doesn't work (and indeed, it doesn't work in practice). However, the problem seems relatively fixable; we merely need to inform high-reputation users of the existence of delete votes. As linked earlier (but I'll repeat the link to make it easier to find), there's &lt;a href=&quot;https://codegolf.stackexchange.com/tools?tab=delete&amp;amp;daterange=last30days&quot;&gt;a page&lt;/a&gt; that does this (plus &lt;a href=&quot;https://codegolf.meta.stackexchange.com/tools?tab=delete&amp;amp;daterange=last30days&quot;&gt;another one&lt;/a&gt; for delete votes here on Meta); it's just that nobody but me seems to be checking it. Is there a way in which we can encourage users to check this page more often (like they seem to check the review queue)?&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="66833" LastEditDate="2021-05-13T02:54:24.243" LastActivityDate="2021-05-13T02:54:24.243" Title="How do we encourage users to check the votes to delete?" Tags="|discussion|moderation|vote-to-delete|" AnswerCount="2" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="11147" PostTypeId="1" AcceptedAnswerId="11148" CreationDate="2017-01-05T17:13:57.730" Score="2" ViewCount="234" Body="&lt;p&gt;&lt;a href=&quot;http://smilebasic.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;SMILEBasic&lt;/a&gt; is a 3DS application that lets you run their own flavour of BASIC called SmileBASIC. It's a pretty cool language, and might have some potential for code-golf, but I don't think a lot. The issue in measuring its source-code stems from the fact that we don't know if SmileBASIC saves its programs in UTF-16 or UTF-8 (because they're saved somewhere within the SmileBASIC application's save-data).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/66440/62670&quot;&gt;This answer&lt;/a&gt; has a comment thread discussing SmileBASIC, and how to count the bytes. We see &lt;a href=&quot;http://smilebasic.com/en/supplements/unicode/&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; that SmileBASIC certainly encodes at least displayed strings as UTF-16, but is that enough to say the source code is also in UTF-16?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://smilebasic.com/en/reference/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt; we have a list of every single SmileBASIC instruction. You'll notice all of them are actually ascii, and don't utilise any of the extended symbols presented by the SmileBASIC UTF-16 encoding. Looking closer at &lt;a href=&quot;http://smilebasic.com/en/reference/#file&quot; rel=&quot;nofollow noreferrer&quot;&gt;the file instructions&lt;/a&gt; you'll see that &lt;code&gt;&#xA;SAVE (2) Saves a string variable to a text file&lt;/code&gt; actually saves in a UTF-8 encoding:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Format&lt;/strong&gt;    &lt;code&gt;SAVE &quot;TXT:File name&quot;, String variable&lt;/code&gt;&lt;br&gt;&#xA;  &lt;strong&gt;Arguments&lt;/strong&gt; &lt;em&gt;File name&lt;/em&gt; Name to save the file under (prefixed with &quot;TXT:&quot;)&lt;br&gt;&#xA;  &lt;strong&gt;String variable&lt;/strong&gt;   String variable containing the text data to be saved (UTF-8)&lt;br&gt;&#xA;  &lt;strong&gt;Examples&lt;/strong&gt;  &lt;code&gt;SAVE &quot;TXT:MEMOFILE&quot;,TX$&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So what should we measure SmileBASIC as? UTF-8 or UTF-16?&lt;/p&gt;&#xA;" OwnerUserId="62670" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2017-01-24T06:24:07.477" Title="How should we score SmileBASIC programs?" Tags="|discussion|code-golf|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11148" PostTypeId="2" ParentId="11147" CreationDate="2017-01-05T17:13:57.730" Score="7" Body="&lt;h2&gt;SmileBASIC programs should be scored as UTF-8&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If SmileBASIC saves its strings as UTF-8, it only makes sense for it to also read in UTF-8 too. Also as its only option for writing strings to a file is UTF-8, I think it's safe to assume source-code is also saved as UTF-8. I believe SmileBASIC either converts any string it reads to UTF-16 before displaying it, or converts it to UTF-16 as the string is built, and back to UTF-8 when writing to a file.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As I don't think we have any way of proving if the files are encoded in UTF-8 or UTF-16 yet, I'll add this: UTF-16 makes SmileBASIC answers (which would already usually be pretty long) ludicrously long (you can see another example &lt;a href=&quot;https://codegolf.stackexchange.com/a/105752/62670&quot;&gt;here&lt;/a&gt;) because SmileBASIC doesn't utilize UTF-16 for anything but displaying strings. If we can't prove either UTF-8 or UTF-16, I think UTF-8 is reasonable as it still probably won't make SmileBASIC super competetive, but at least it won't be completely outside of the realm of most competitions with UTF-16.&lt;/p&gt;&#xA;" OwnerUserId="62670" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2017-01-05T17:52:44.277" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11151" PostTypeId="2" ParentId="2140" CreationDate="2017-01-05T18:29:50.967" Score="2" Body="&lt;h1&gt;Normal quine, weird quine&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Note&lt;/strong&gt;: This Sandbox entry has a fairly long history, and is basically an attempt to produce a challenge inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/5852/triplegolf-not-only-the-source-code-length-counts#comment12232_5852&quot;&gt;this comment&lt;/a&gt;, but that's immune to wilful misinterpretation (or misunderstanding) of what counts as an error in order to trivialise the question.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In the world of programming languages, there are lots of different ways to produce output on the usual output streams. Most languages have a way to print a string intentionally, called &lt;code&gt;print&lt;/code&gt;, &lt;code&gt;write&lt;/code&gt;, or something like that. Sometimes you can even just leave a value to be printed implicitly. Most languages also have situations in which the implementation interjects with its own output, e.g. warnings produced during the compile. We'll call this &lt;em&gt;weird output&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For each method of output to standard output or standard error in a programming language, consider how much of that output is under the programmer's control and thus can contain arbitrary text (e.g. specified as a parameter, part of the program's filename, taken from a variable that can be assigned to, or the like), as opposed to being a single possibility (or a finite set of possibilities) hardcoded into the interpreter. We'll call this output method &lt;em&gt;normal&lt;/em&gt; if no more than 3 bytes are outside the programmer's control; and &lt;em&gt;weird&lt;/em&gt; if there are 4 or more hardcoded bytes that the programmer cannot control.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you need to write a &lt;strong&gt;full program&lt;/strong&gt; that's a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; variant, obeying the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/4877/62131&quot;&gt;proper quine rules&lt;/a&gt;. Specifically, after performing the entire process of &lt;strong&gt;building and running&lt;/strong&gt; the program (i.e. if there's a separate compile step required, its output counts too):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All the output produced &lt;strong&gt;on standard output and standard error&lt;/strong&gt; via normal output methods must be identical to the program's source code;&lt;/li&gt;&#xA;&lt;li&gt;All the output produced &lt;strong&gt;on standard output and standard error&lt;/strong&gt; via weird output methods must also, separately, be identical to the program's source code.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In other words, the program is a quine in two different ways. You can think of this as being a quine that's also an &lt;a href=&quot;https://codegolf.stackexchange.com/q/36260/62131&quot;&gt;error quine&lt;/a&gt; (also known as a &quot;Kimian quine&quot;), except that the notion of &quot;error&quot; is restricted in order to avoid abuse (mechanisms which would let the program provide an arbitrary &quot;error message&quot; count as normal output, not weird output, on the above definition), but generalized to allow things like warnings, banners that the implementation prints as it loads, and other weird ways to produce output.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Clarifications&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For the purpose of the proper quine definition, the fixed part of the output that's inherent in a weird output method is considered to not be encoded by the corresponding part of the program (even if that part of the program causes an error). As such, only the normal part of the quine can fail to be a proper quine.&lt;/li&gt;&#xA;&lt;li&gt;PPCG doesn't normally count output that's inherent to an implementation (such as compiler progress messages and fixed banners). This challenge is about handling that sort of thing, though, so such output is definitely relevant here (in addition to everything else on the standard output and error streams).&lt;/li&gt;&#xA;&lt;li&gt;Unlike in many challenges, the switches given to the compiler, and the program filename, are likely to be highly relevant in this challenge. Using an unusual build configuration may well be required to make the challenge possible, and as such is legal here; however, if you run the implementation in an unusual way, remember that PPCG rules charge a byte penalty for doing so (equal to the number of additional characters that you'd need to add on the command line over the shortest &quot;normal&quot; way to run a program), and thus you'll need to specify the size of the penalty in your post. (For example, if the interpreter you're using reads the program from a file, and has no particular restrictions on the filename, the shortest normal way to run the program would be from a file with a 1-character filename; thus, if you need a 100-character filename to make your program work, you'd incur a byte penalty of +99.)&lt;/li&gt;&#xA;&lt;li&gt;The compiler/interpreter version you use may well be relevant, so as part of your submission, please state a specific compiler or interpreter on which your program works, and which version is required. (For example, a C submission might state &quot;C (gcc 6.2.0)&quot; in the header.)&lt;/li&gt;&#xA;&lt;li&gt;Note that this task may not be possible in all languages. In the languages where it is, the easiest method will likely be to find an error or warning message for which it's possible to customize some subset of the text (via changing the name of something that gets quoted in the message; filenames are a common choice here, but not the only one). Obviously, if you could customize the entire thing, it wouldn't be weird output and thus wouldn't work. I'll be particularly impressed (and surprised) if someone finds a way to do this using &lt;em&gt;only&lt;/em&gt; error and warning messages whose text is entirely fixed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Victory condition&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, so an entry is considered to be better if it has a smaller byte count. As such, once you've got your program working at all, you want to optimize it to bring the number of bytes down as far as possible. (However, don't be discouraged if there's already a shorter entry, especially if it's in a different language; what we're really looking for here is to shorten a particular algorithm or idea behind a program as much as possible, but seeing multiple solutions in different languages or that rely on different principles is always worthwhile.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This was moved here &lt;a href=&quot;https://codegolf.stackexchange.com/questions/105753/error-or-warning-quine-thats-also-a-regular-quine&quot;&gt;from main&lt;/a&gt; because many answerers seemed to disagree with everyone else as to what an error message was.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've aimed to avoid the problem in this rewrite by focusing not on what is and isn't an error message, but rather on the amount of hardcoded content in the message. Is this likely to be interpreted the same way by everyone? Is it objective?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, should I edit the original challenge, or should I post it as a new challenge? Out of the two non-deleted answers, one will stay valid (although the explanation will end up somewhat out of context), the other will need to be deleted (although I consider it to be invalid under the original specification too, and thus arguably no changes are being made to which answers are correct).&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2017-03-26T17:00:37.587" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11153" PostTypeId="1" AcceptedAnswerId="11219" CreationDate="2017-01-05T19:20:30.817" Score="10" ViewCount="282" Body="&lt;p&gt;Submission formats are always flexible here on PPCG. Named functions, anonymous functions or even full programs that perform IO, are all fine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even currying is acceptable, for example, taking arguments as &lt;code&gt;f(4)(5)&lt;/code&gt; rather than &lt;code&gt;f(4, 5)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But what about returning a function that returns the result? &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Consider the following Python code to find the length of a string:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f = lambda s: s.__len__&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;I know this is a long way to do it, I'm just trying to give a simple example.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To call this function, one would have to call &lt;code&gt;f&lt;/code&gt; with the string parameter, and then call the result, to get the answer - for example, &lt;code&gt;f(&quot;String&quot;)()&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another example is this pseudo-Java lambda to convert an object to a string:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x -&amp;gt; x.toString&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If you assigned this to &lt;code&gt;f&lt;/code&gt;, you'd call it with &lt;code&gt;f(object)()&lt;/code&gt;. It's very similar to currying, except that the second call takes no parameter. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;My question is - should we allow this as an acceptable output format for PPCG code-golf answers?&lt;/p&gt;&#xA;" OwnerUserId="60919" LastEditorUserId="60919" LastEditDate="2017-01-05T22:19:09.877" LastActivityDate="2017-01-09T23:50:10.093" Title="Returning a function, which returns the result?" Tags="|discussion|" AnswerCount="1" CommentCount="8" ClosedDate="2017-01-10T20:11:51.007" ContentLicense="CC BY-SA 3.0" />
  <row Id="11154" PostTypeId="1" CreationDate="2017-01-05T20:43:53.603" Score="4" ViewCount="79" Body="&lt;p&gt;Yesterday the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/oeis&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;oeis&amp;#39;&quot; rel=&quot;tag&quot;&gt;oeis&lt;/a&gt; tag was created for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/105651/smallest-prime-with-a-twist-a068103&quot;&gt;this question&lt;/a&gt; about an oeis sequence.  I assume that this tag would be used in the future for other oeis sequence questions (There was no usage guide or description until I added one simply linking to oeis.org).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every question about an oeis sequence will most obviously also be tagged with the sequence sequence tag is it really worth having an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/oeis&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;oeis&amp;#39;&quot; rel=&quot;tag&quot;&gt;oeis&lt;/a&gt; tag?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand this tag could be used to mark questions that are about &lt;em&gt;the oeis&lt;/em&gt; rather than a specific sequence such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/89376/automate-the-oeis&quot;&gt;this one&lt;/a&gt;.  However I could not find any other questions like that and it seems that, of the one question already tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/oeis&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;oeis&amp;#39;&quot; rel=&quot;tag&quot;&gt;oeis&lt;/a&gt;, it is not being used like that at current.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2017-01-05T21:15:42.040" Title="Is [oeis] a synonym of [sequence]" Tags="|discussion|tags|tag-synonyms|" AnswerCount="1" CommentCount="2" ClosedDate="2017-01-06T15:02:24.483" ContentLicense="CC BY-SA 3.0" />
  <row Id="11155" PostTypeId="2" ParentId="11154" CreationDate="2017-01-05T20:55:09.270" Score="1" Body="&lt;p&gt;As Nathan Merrill mentioned, yes, we treat it as such. See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5544/create-an-oeis-tag&quot;&gt;this meta post&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Technically though, if you're talking about tag synonyms, it is not an &quot;official&quot; tag synonym. I already edited the tags on the question you linked, and the tag must exist to be suggested as a tag synonym.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2017-01-05T20:55:09.270" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11156" PostTypeId="2" ParentId="2140" CreationDate="2017-01-05T21:26:02.980" Score="1" Body="&lt;h1&gt;Linear Regression on Strings&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This challenge is a little tricky, but rather simple, given a string &lt;code&gt;s&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;meta.codegolf.stackexchange.com&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Use the position of the character in the string as an &lt;code&gt;x&lt;/code&gt; coordinate and the ascii value as a &lt;code&gt;y&lt;/code&gt; coordinate. For the above string, the resultant set of coordinates would be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0, 109&#xA;1, 101&#xA;2, 116&#xA;3, 97&#xA;4, 46&#xA;5, 99&#xA;6, 111&#xA;7, 100&#xA;8, 101&#xA;9, 103&#xA;10,111&#xA;11,108&#xA;12,102&#xA;13,46&#xA;14,115&#xA;15,116&#xA;16,97&#xA;17,99&#xA;18,107&#xA;19,101&#xA;20,120&#xA;21,99&#xA;22,104&#xA;23,97&#xA;24,110&#xA;25,103&#xA;26,101&#xA;27,46&#xA;28,99&#xA;29,111&#xA;30,109&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Next, you must calculate both the slope and the y-intercept of the set you've garnered using linear regression, here's the set above plotted:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/YCujs.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/YCujs.png&quot; alt=&quot;Plot&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Which results in a best fit line of:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;y = 0.014516129032258x + 99.266129032258&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;So your program would return:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;f(&amp;quot;meta.codegolf.stackexchange.com&amp;quot;) = [0.014516129032258, 99.266129032258]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Some clarifying rules:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;- Strings are 0-indexed or 1 indexed both are acceptable.&#xA;- Output may be on new lines, as a tuple, as an array or any other format.&#xA;- Precision of the output is also arbitrary but should be enough to verify validity.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; lowest byte-count wins.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-06T06:02:24.930" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11159" PostTypeId="2" ParentId="2140" CreationDate="2017-01-05T23:56:16.133" Score="1" Body="&lt;h1&gt;Prisoner's dilemma&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Inspired by the &amp;quot;Mafia&amp;quot; proposal&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Write a bot that plays the &lt;a href=&quot;http://en.wikipedia.org/wiki/Prisoner%27s_dilemma&quot; rel=&quot;nofollow noreferrer&quot;&gt;Prisoner's dilemma&lt;/a&gt;. King of the hill&lt;/h2&gt;&#xA;&lt;h3&gt;Payoff matrix:&lt;/h3&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/RitzW.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/RitzW.png&quot; alt=&quot;Hi Mom!&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Rules:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your bot must be a &lt;em&gt;full program&lt;/em&gt;, not a function.&lt;/li&gt;&#xA;&lt;li&gt;Your bot must run when the server does &lt;code&gt;./run&lt;/code&gt; in it's folder.&lt;/li&gt;&#xA;&lt;li&gt;No shenanigans.&lt;/li&gt;&#xA;&lt;li&gt;If you want to remember something, save it to a file in your directory.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Input/Output&lt;/h3&gt;&#xA;&lt;p&gt;When the server does &lt;code&gt;./run&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;from_server&lt;/code&gt;&lt;/strong&gt; contains your opponent's last move - Either &lt;code&gt;Cooperate&lt;/code&gt; or &lt;code&gt;Defect&lt;/code&gt;. On the first round it contains &lt;code&gt;Let's play!&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;When your program exits (60 sec max):&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;to_server&lt;/code&gt;&lt;/strong&gt; contains your choice this round. Either &lt;code&gt;Cooperate&lt;/code&gt; or &lt;code&gt;Defect&lt;/code&gt;. Any other output is interpreted as forfeit; you got 0 points and your opponent gets 5. If both bots forfeit on any turn, nobody gets any points.&lt;/p&gt;&#xA;&lt;h3&gt;Provided bots&lt;/h3&gt;&#xA;&lt;p&gt;There are a few bots that are guaranteed to exist:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Always defect&lt;/li&gt;&#xA;&lt;li&gt;Always cooperate&lt;/li&gt;&#xA;&lt;li&gt;75% cooperate / 25% defect&lt;/li&gt;&#xA;&lt;li&gt;25% cooperate / 75% cooperate&lt;/li&gt;&#xA;&lt;li&gt;50% cooperate / 50% defect&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Testing&lt;/h3&gt;&#xA;&lt;p&gt;Your bot will be played against every other bot in a random number of rounds &amp;gt; 100.&lt;/p&gt;&#xA;&lt;h3&gt;Winning&lt;/h3&gt;&#xA;&lt;p&gt;Get the most points after you've played every other bot&lt;/p&gt;&#xA;&lt;h3&gt;Fiddly bits&lt;/h3&gt;&#xA;&lt;p&gt;The game is a file structure something like so:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;prisoner/&#xA;  -&amp;gt; server.py&#xA;  -&amp;gt; yournameherebot/&#xA;     -&amp;gt; from_server&#xA;     -&amp;gt; to_server&#xA;     -&amp;gt; run&#xA;     -&amp;gt; *Any other files you want*&#xA;  -&amp;gt; someotherbot/&#xA;  -&amp;gt; anotherbot/&#xA;  -&amp;gt; titfortat/&#xA;  -&amp;gt; 50-50_random/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Meta&lt;/h3&gt;&#xA;&lt;p&gt;Please give your CC with your comment instead of a downvote. It's a sandbox for a reason :)&lt;/p&gt;&#xA;" OwnerUserId="49186" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-17T15:48:38.413" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="11160" PostTypeId="2" ParentId="11139" CreationDate="2017-01-06T00:02:22.680" Score="20" Body="&lt;h2&gt;The Chatiquette on noise is ineffective&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The problem with the &lt;a href=&quot;http://ppcg.github.io/chatiquette/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Chatiquette&lt;/a&gt; document is that the noisy chatters to which it's addressed won't get the message. It should be addressed to the individual chatter, giving specific guidelines for what they should and should not do. Instead, the &quot;Signal:noise&quot; section lists vague unactionable statements of what we wish were true.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Avoid posting messages that add nothing to the conversation (^, ಠ_ಠ,&lt;br&gt;&#xA;  rofl, etc.).&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Thing is, a noisy user &lt;em&gt;does&lt;/em&gt; think their spammy replies are adding to the conversation. Nobody thinks of themselves as the problem. This is like giving someone the advice, &quot;Instead of doing X badly, how about you do it well?&quot; (The specific examples are useful though, as are those in the &quot;Courtesy&quot; section.)&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;PPCG-related (on-topic) discussion always overrides idle chatter.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;False? This isn't a guideline, it's a statement. And, it's one that's disproven constantly. Is the intent, &quot;If you're having an off-topic conversation and someone posts an on-topic message, you immediately stop talking in that conversation&quot;? If so, it should say this.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Consider creating a separate chatroom if a topic appears to be dominating or preventing effective discussion of other, more relevant topics.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&quot;OK, I've considered it. Check.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is like telling drivers in a traffic jam to stop holding up traffic. No individual car is the cause. It's a group dynamic, a bulk effect. &quot;The single raindrop never feels responsible for the flood.&quot; The off-topic discussion in TNB constantly stifles more relevant topics, but no one user feels a given conversation is the problem. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Someone won't come it to tell the noisy chatter, &quot;Hey, I was going to start a quality on-topic discussion, but I saw you're posting noise now, so I've decided against it.&quot; Even if the noisy chatter has exceptional presence of mind to see the overall effect of their chats, they won't think to move to a separate chat room in any one instance. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The Chatiquette guidelines on noise are unhelpful even if a user reads them and takes them to heart. And those are big if's. They are easy to miss and easy to ignore. They don't list any consequences to not following them. The problem is not the wording, but the whole philosophy of what they are there to do.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2017-01-06T00:02:22.680" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11161" PostTypeId="1" AcceptedAnswerId="11172" CreationDate="2017-01-06T00:06:26.350" Score="3" ViewCount="177" Body="&lt;p&gt;We have a tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/transcendental-numbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;transcendental-numbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;transcendental-numbers&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;It's currently used on only 2 questions, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/80832/approximate-the-frans%C3%A9n-robinson-constant&quot;&gt;here&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/82604/approximation-of-e&quot;&gt;here&lt;/a&gt;. Both are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and involve approximating 2 transcendental numbers. (&lt;code&gt;e&lt;/code&gt; and the Fransén-Robinson constant)&lt;/p&gt;&#xA;&lt;p&gt;This doesn't appear really to add anything to these challenges, 1 is also tagged math and number and the other is tagged calculus.  Can we burninate it?&lt;/p&gt;&#xA;&lt;p&gt;Optionally, we can create an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/approximation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;approximation&amp;#39;&quot; rel=&quot;tag&quot;&gt;approximation&lt;/a&gt; tag for challenges that involve approximating constants. (not sure if this is a good idea, might be too uncommon)&lt;/p&gt;&#xA;&lt;h2&gt;Update:&lt;/h2&gt;&#xA;&lt;p&gt;I've gone ahead and created a tag (and tag wiki) for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/approximation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;approximation&amp;#39;&quot; rel=&quot;tag&quot;&gt;approximation&lt;/a&gt;.  I also retagged the 2 current [transcendental-numbers] questions with approximation (and removed the old tag).  I'll hold off on retagging the questions listed in @Flip's answer for a bit.&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-08T09:43:00.357" Title="Should we remove [transcendental-numbers]?" Tags="|discussion|tags|" AnswerCount="3" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11162" PostTypeId="2" ParentId="2140" CreationDate="2017-01-06T00:08:18.537" Score="2" Body="&lt;h1&gt;Pseudoku Cops and Robbers King of the Hill&lt;/h1&gt;&#xA;&lt;p&gt;(I know that another user, @NathanMerrill, is proposing a similar contest.  I started playing with the idea for this type of contest independently yesterday, but have since chatted with in The Nineteenth Byte.  He is currently undecided on the type of puzzle to use and has some different ideas on how to evaluate participants' performance, so I feel comfortable proposing my idea as a separate challenge.)&lt;/p&gt;&#xA;&lt;p&gt;Sudoku is a well-known logic puzzle.  It is a puzzle of four nines: nine rows of cells, nine columns of cells, nine 3x3 adjacent and distinct blocks of cells, and nine values that any cell can have.  A valid Sudoku arrangement or solution is one in which every row, cell, and block has all nine values exactly one time.  For example, consider the following valid solution:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+-----+-----+-----+&#xA;|4 6 1|5 7 3|2 8 9|&#xA;|5 7 8|2 1 9|4 6 3|&#xA;|3 2 9|6 8 4|1 7 5|&#xA;+-----+-----+-----+&#xA;|9 8 4|7 6 2|3 5 1|&#xA;|7 5 6|3 4 1|9 2 8|&#xA;|2 1 3|9 5 8|7 4 6|&#xA;+-----+-----+-----+&#xA;|8 3 5|1 2 7|6 9 4|&#xA;|6 9 7|4 3 5|8 1 2|&#xA;|1 4 2|8 9 6|5 3 7|&#xA;+-----+-----+-----+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;These are turned into puzzles by removing many of the values in the arrangement in such a way that all blanks are mirrored horizontally and vertically across the puzzle and so there is only one valid way to fill in the blanks to get a valid Sudoku solution.  For the above puzzle, this might look like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+-----+-----+-----+&#xA;|4    |     |2 8  |&#xA;|  7  |  1  |    3|&#xA;|    9|    4|1    |&#xA;+-----+-----+-----+&#xA;|     |7 6  |3 5 1|&#xA;|     |     |     |&#xA;|2 1 3|  5 8|     |&#xA;+-----+-----+-----+&#xA;|    5|1    |6    |&#xA;|6    |  3  |  1  |&#xA;|  4 2|     |    7|&#xA;+-----+-----+-----+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Someone who wished to play this Sudoku puzzle would then use the information provided to find the original solution.&lt;/p&gt;&#xA;&lt;p&gt;Sudoku has some interesting properties that allow it to be generalized to similar puzzles with different rules that are sometimes called &amp;quot;Pseudoku&amp;quot; (which is pronounced the same way as the actual puzzle, SOO-DOE-KOO, so please stop saying SOO-DOO-KOO).  For our purposes, we will make two differences.  First, it may be possible to generate harder puzzles by removing the restriction for symmetric removals.  The following is a valid puzzle by Sudoku rules, so why not allow it?&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+-----+-----+-----+&#xA;|4   1|  7  |2    |&#xA;|5    |2   9|     |&#xA;|3    |  8  |     |&#xA;+-----+-----+-----+&#xA;|  8 4|7   2|    1|&#xA;|     |3   1|  2  |&#xA;|     |     |     |&#xA;+-----+-----+-----+&#xA;|     |     |6    |&#xA;|  9 7|     |     |&#xA;|1    |     |5 3  |&#xA;+-----+-----+-----+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Second, Sudoku's properties allow us to define games with different sizes.  You can define a Pseudoku game with a parameter &lt;code&gt;N&lt;/code&gt; where the resulting board has &lt;code&gt;N^2&lt;/code&gt; rows, &lt;code&gt;N^2&lt;/code&gt; columns, &lt;code&gt;N^2&lt;/code&gt; blocks of size &lt;code&gt;NxN&lt;/code&gt;, and &lt;code&gt;N^2&lt;/code&gt; values for each cell.  Standard Sudoku would be a Pseudoku variant with &lt;code&gt;N=3&lt;/code&gt;.  So the following would be a valid Pseudoku(2) game:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+---+---+&#xA;|1  |   |&#xA;|   |  3|&#xA;+---+---+&#xA;|  1|4  |&#xA;|4  |   |&#xA;+---+---+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and an example Pseudoku(4) game:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+-----------+-----------+-----------+-----------+&#xA;|11         |      10  4| 1     9   | 2       16|&#xA;| 6     5   |   15  1   |    3     2|12  8      |&#xA;|10    13 14|         12| 5       15| 4     7   |&#xA;| 2  3      |    6    13|       8 11|    5    10|&#xA;+-----------+-----------+-----------+-----------+&#xA;| 7 11 12  9|14        2|16  1  4   |           |&#xA;|           |   10  4   |          3|13    16 11|&#xA;| 4       10|   16    15|   12      |          6|&#xA;| 1 16  2   |11  3      |   10     8|           |&#xA;+-----------+-----------+-----------+-----------+&#xA;| 3        2|       6   |13         | 5 14     1|&#xA;|    7      |          5|           |           |&#xA;|   13 14  4|12    16   |           | 8  9      |&#xA;|    5 16   |13     9   | 4     2  1|           |&#xA;+-----------+-----------+-----------+-----------+&#xA;|14 12     7|           |   15     4|11     6   |&#xA;|    9      | 6         |11 16      |       3   |&#xA;|      11   | 8 13     1| 3 14      |    7      |&#xA;|13     8   | 7    11   | 2         |      15   |&#xA;+-----------+-----------+-----------+-----------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Since Sudoku is NP-complete, so is Pseudoku.  That means that it gets more difficult to solve a Pseudoku puzzle the larger &lt;code&gt;N&lt;/code&gt; gets.  However, it can take more time to generate Pseudoku puzzles than it does to solve them, since the naive algorithm for generating a puzzle requires solving the puzzle each time a value is removed!  Solving Pseudoku puzzles is fun, but if it takes longer to generate them than it does to solve them, it becomes more work than play.&lt;/p&gt;&#xA;&lt;p&gt;So help me out!  I propose a Cops and Robbers style King of the Hill.  The Cops will compete by writing programs to generate lots of Pseudoku puzzles to consume as much time as possible for solving, while the Robbers will compete by writing programs to solve Pseudoku puzzles to consume as little as time possible solving these puzzles.&lt;/p&gt;&#xA;&lt;p&gt;I need some help ironing out the format, but here is what I have so far:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;I will provide a Java framework for running the contest.  This framework will connect to clients by TCP/IP so contestants can choose whatever language they want to write their Cops and Robbers (so long as I can run them on my system).  I will also provide a basic Cop and Robber for these users to try out to see what sorts of times they take.  I will publish the times they generate on my system so contestants can estimate how their entries will run on my system.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I will give each Cop ten minutes to generate as many Pseudoku(&lt;code&gt;N&amp;gt;= 3&lt;/code&gt;) puzzles as they can, but they should be able to generate at least Pseudoku(&lt;code&gt;N=4&lt;/code&gt;) puzzles.  They can choose what sizes they want the puzzles to be, but they have to be valid with exactly one solution.  My server will naively check each one to guarantee their validity; any Cop that generates an invalid puzzle is disqualified.  I recommend configuring the Cop programs to be parameterized externally so that Robbers can test their code against basic Cop configurations, but then the Cops can send me secret, optimized configurations before the contest completes for their actual execution.  I will provide a couple days after the deadline ends for conferring with the Cop programmers if their settings do not work as expected on my system.  Cops should generate different puzzles every time with reasonable expectations; that means no spamming with the same puzzle repeatedly or reading pregenerated puzzles from a file system, Internet source, or internal cache.  In addition, I don't want to see a Cop that uses the same removal pattern for every puzzle (that may not guarantee valid puzzles, anyway).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each Robber will be tested against each puzzle generated by the Cops.  The Robber will have to generate the correct solution for each puzzle as quickly as possible.  I will probably need to see some timings before I make a final decision, but each Robber will be capped with some amount of time to solve a puzzle (maybe an hour?) before the time-to-completion defaults to twice that cap.  These Robbers will be permitted to use any technique for solving the puzzles that my system supports except for packet sniffing.  I am on the fence as to whether the Robbers will be on an honor code to not study Cop code since I plan to have secret parameterizations anyway.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;All the times for all the puzzles will be sorted from least to greatest and then assigned an index as one would in a Mann-Whitney U test.  Each Cop and Robber will be scored using the sum of the indices of their contributions: Cops for the times the Robbers spent solving their puzzzles, and Robbers for the times they spent solving puzzles.  The winning Cop will have the highest sum and the winning Robber the lowest.  Cop ties will be broken first by the average time required to solve one of its problems (more is better), then by the number of puzzles generated (more is better), then by the name I deem cooler (here's hoping that doesn't happen).  Robber ties will be broken first by the average time spent solving puzzles, then by the sum of the time, then by the standard deviation, then by the cooler name.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This scoring scheme poses an interesting challenge to Cops: balancing the size of the problems (and the likely amount of time needed to solve them) against the number of problems generated.  A Cop that generates only one puzzle that no Robber can solve in the time limit is likely to lose to another Cop that generates many moderate problems.  Similarly, a Cop that spams many small problems is likely to be beaten by another Cop that generates fewer problems of larger sizes.  Since the official contest configurations should be kept secret until the contest starts, other Cops can study the other programs to try to determine what their opponents are likely to do and plan accordingly.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;I am interested in any and all feedback that the community might have about this challenge.&lt;/p&gt;&#xA;" OwnerUserId="18496" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-06T00:08:18.537" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="11163" PostTypeId="2" ParentId="11161" CreationDate="2017-01-06T00:52:05.100" Score="5" Body="&lt;h1&gt;Yes, we should burninate it.&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It's only used on 2 questions&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Very few numbers are proven transcendental, and it's unlikely a challenge would be to &lt;em&gt;prove&lt;/em&gt; a number transcendental&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;All of the existing challenges (all 2 of them) don't particularly relate to the actual transcendental-ness of the numbers (i.e. the infinite, nonrepeating part) and are basically just evaluate a formula to a certain precision&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-06T00:52:05.100" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11164" PostTypeId="1" CreationDate="2017-01-06T01:00:55.140" Score="1" ViewCount="131" Body="&lt;p&gt;(Closely related in the original premise, but both the question and its answers go off in a different direction: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/546/62131&quot;&gt;this meta post&lt;/a&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Something I've noted in many challenges which are fundamentally about storing a large amount of data in the program (e.g. most &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenges with large output) is that languages which natively use 8-bit (or 16-bit, but that's much rarer) encodings have a large advantage. Unlike most &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges, where most of the challenge is in writing the &lt;em&gt;code&lt;/em&gt;, in this sort of challenge, the program is likely mostly going to be formed by a large string literal (or the language's equivalent), and so the score obtained for a particular algorithm is going to be based primarily (not exclusively, but close to it in most cases) on how efficiently the data can be stored in that literal. If the language uses a 7-bit character set, or a UTF-8-like character set, then many codepoint sequences won't be allowed inside the literal, and thus will run the compression ratio of the program. This seems to unfairly discriminate against languages in much the same way as, say, banning flexible I/O formats does.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's also a problem because it makes submissions hard to compare in challenges where the algorithm is more interesting than the actual implementation of it (e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/a/105569/62131&quot;&gt;this answer of mine&lt;/a&gt; is much shorter than the next-shortest answer, and most of that comes from algorithmic improvements, but I found it easiest to write it in Jelly and many people are going to end up assuming that the score is based on the language, as they're used to seeing Jelly outgolfing JavaScript and Mathematica by that sort of ratio on challenges which are more about the implementation than the algorithm).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, one way to solve this problem would be to ban characters with the high bit set, thus forcing all languages to use a 7-bit character set (this is different from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/printable-ascii&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;printable-ascii&amp;#39;&quot; rel=&quot;tag&quot;&gt;printable-ascii&lt;/a&gt; as I don't see a reason to ban &lt;em&gt;nonprintable&lt;/em&gt; ASCII here). This would work well for the vast majority of languages (and is something that I've seen suggested at least in the comments of some of these challenges), but rather fails on languages where many builtins contain non-ASCII characters and have no alternative encoding (as it'll make the &quot;code&quot; part of the program much harder to write).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An alternative is to use bonuses/penalties. In particular, I was wondering if it would in general be a good idea to offer a 12.5% bonus if none of the characters in the program have their high bits set. I'm aware of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8106/62131&quot;&gt;the normal arguments against bonuses/penalties&lt;/a&gt;, which make sense for most situations in which they're used, but this is somewhat different, as the decision is likely to be clear-cut, and yet different per language (languages which &quot;natively&quot; use ASCII have no reason not to go for the bonus, languages which use all 256 possible octets typically have no trouble representing them in string literals and thus wouldn't benefit from the bonus at all). The bonus size of 12.5% places the 7-bit and 8-bit (and 16-bit) encodings on an exactly level playing field, and thus will help the focus be on the algorithm, which it really should be in this sort of challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So the question is: is this sort of bonus a good idea? Would it be a good idea even on other types of challenge, or just compression-related ones? Are there other ways we can help avoid unfairly discriminating against languages due to the way in which they store string literals (or the equivalent)?&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2017-01-06T22:13:39.827" Title="For compression-related challenges, should we take steps to level the use of 7-bit and 8-bit character sets?" Tags="|discussion|challenge-quality|" AnswerCount="2" CommentCount="4" ClosedDate="2017-01-08T08:03:22.637" ContentLicense="CC BY-SA 3.0" />
  <row Id="11165" PostTypeId="2" ParentId="11161" CreationDate="2017-01-06T01:04:03.590" Score="-4" Body="&lt;h1&gt;No, we shouldn't burninate it&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The tag is relevant to all questions about transcendental numbers, not just proving them&lt;/li&gt;&#xA;&lt;li&gt;It may be used on more questions as time goes on&lt;/li&gt;&#xA;&lt;li&gt;There is no point to destroying it&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="53551" LastActivityDate="2017-01-06T01:04:03.590" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11166" PostTypeId="2" ParentId="11132" CreationDate="2017-01-06T05:05:39.270" Score="8" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;However code Snippets in Brain-Flak can be thought of as functions because they do return a value.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I would disagree with that. Code snippets in brain-flak don't &lt;em&gt;return&lt;/em&gt; a value, they simply &lt;em&gt;evaluate to&lt;/em&gt; a certain value. To reiterate what some other users have already said, &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;()()()()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is not equivalent to&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;lambda: 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;in python, it's equivalent to&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;They both produce a value, and have no side effect. You can &lt;em&gt;do&lt;/em&gt; things with this value, such as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;print(4)&#xA;a=4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;in python, or&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(()()()())&#xA;(((()()()()))&amp;lt;&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;in brain-flak, but it's not a function by itself. Similarly, your other example is equivalent to:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input() ** 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;not&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;lambda x:x**2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The crucial difference here is that in the python example, it defines a block of code that can be saved and reused later, while the brain-flak code is just a snippet that evaluates to a certain value. Since brain-flak has no ability to save and reuse a piece of code, I would say it has no functions. The same would apply to the various flak-variations (mini-flak, brain-fleue), brainfuck, and other similar tarpits.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I would propose that brain-flak has no functions, and treating snippets as functions should not be allowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On a related note, I found the following proposed default IO methods on meta while I was thinking over this answer:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8493/31716&quot;&gt;For stack-based languages, function's input may be pushed to the stack before calling&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8507/31716&quot;&gt;Functions in stack-based languages can leave the output on the stack&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Given the way brain-flak implicitly pushes all input to the stack, and implicitly prints all values left on the stack, if brain-flak had functions it wouldn't make any difference. A hypothetical function in brain-flak would be the same length as the full program with standard IO.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2017-01-09T18:43:54.807" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11167" PostTypeId="2" ParentId="11164" CreationDate="2017-01-06T09:57:57.383" Score="8" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;The premise of this question is &amp;quot;Strings are less efficient in language X, so let's give them a boost&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;However, if we do that, then why limit ourselves to strings? If my language only uses 3 or 4 characters (BF, whitespace), why don't we score each character as 2 bits?&lt;/p&gt;&#xA;&lt;p&gt;Languages simply have disadvantages and advantages when it comes to golfing. &lt;strong&gt;Trying to place all languages on an equal playing ground doesn't work&lt;/strong&gt;, which is why we don't compare Python and Pyth answers: it just doesn't make sense.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-06T09:57:57.383" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11169" PostTypeId="1" AcceptedAnswerId="11170" CreationDate="2017-01-06T19:08:33.497" Score="1" ViewCount="81" Body="&lt;p&gt;The number tag wiki is this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This challenge is intended to be solved by using, manipulating, accepting as input, or outputting numeric values.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is pretty vague. What I'm understanding from this is the number tag should be applied any time the digits 0-9 even tenuously relate to the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/103441/is-this-a-number]&quot;&gt;Is this a number?&lt;/a&gt; was tagged [number] for obvious reasons.  This challenge relates to evaluating strings into numbers (mostly).&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/105649/find-all-the-coordinates-on-a-path&quot;&gt;Find all the coordinates on a path&lt;/a&gt; was tagged [number] because the output is coordinate pairs of 2 numbers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/105808/generate-an-ascii-art-non-intersecting-path&quot;&gt;Generate an ascii-art non-intersecting path&lt;/a&gt; was tagged [number] because it takes input in the form of 2 numbers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/104665/coprimes-up-to-n&quot;&gt;Coprimes up to N&lt;/a&gt; was tagged [number] because it requires finding a set of positive numbers that fit criteria.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;All of these challenges have the tag for a different reason.  Input as numbers, output as numbers, math involving numbers, and evaluating number literals.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can we burninate the tag and possibly replace it with more specific ones, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/numerical-io&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;numerical-io&amp;#39;&quot; rel=&quot;tag&quot;&gt;numerical-io&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/literal-evaluation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;literal-evaluation&amp;#39;&quot; rel=&quot;tag&quot;&gt;literal-evaluation&lt;/a&gt; (for challenges relating to evaluating literals of any sort)?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Downside to burnination is that there are &lt;em&gt;many, many&lt;/em&gt; (536) questions tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;, and it might be unfeasible to replace the tag everywhere.&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2017-01-06T19:12:01.340" Title="Should we nuke the [number] tag?" Tags="|discussion|tags|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11170" PostTypeId="2" ParentId="11169" CreationDate="2017-01-06T19:12:01.340" Score="8" Body="&lt;p&gt;I don't think burnination is all that necessary, but I would definitely be in favor of dropping a couple of the criteria. I don't think &quot;it takes numbers as input&quot; in particular makes sense (the two path questions given, for example).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Maybe worded something like this, but someone else could probably do better:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This challenge is intended to be solved by using or manipulating numeric values.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="14215" LastActivityDate="2017-01-06T19:12:01.340" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11171" PostTypeId="2" ParentId="11164" CreationDate="2017-01-06T22:13:39.827" Score="3" Body="&lt;h2&gt;Explain comparisons unofficially&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Compute what your score would be if the hard-coded string used a different character set, and point out how your score would then compare to one in a language that uses that character set. This isn't an &quot;official&quot; score, but a way to help readers compare the relative effectiveness of your compression methods.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2017-01-06T22:13:39.827" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11172" PostTypeId="2" ParentId="11161" CreationDate="2017-01-06T22:18:58.920" Score="10" Body="&lt;h1&gt;We should burninate it, replacing it with a broader [approximation].&lt;/h1&gt;&#xA;&lt;p&gt;Edit: This tag has been created. Questions on this last have been retagged. Other questions that find into this category can be slowly retagged when stumbled across.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;The two challenges tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/transcendental-numbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;transcendental-numbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;transcendental-numbers&lt;/a&gt; are both about approximating mathematical constant - if we burninate this tag, we can replace it with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/approximation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;approximation&amp;#39;&quot; rel=&quot;tag&quot;&gt;approximation&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Challenges that would fit under this tag include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/80832/approximate-the-frans%C3%A9n-robinson-constant&quot;&gt;Approximate the Fransén-Robinson constant&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/82604/approximation-of-e&quot;&gt;Approximation of e&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/47759/monte-carlo-estimator-of-pi&quot;&gt;Monte Carlo estimator of Pi&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/96275/natural-pi-1-sand&quot;&gt;Natural Pi #1 - Sand&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/95231/natural-pi-0-rock&quot;&gt;Natural Pi #0 - Rock&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/104655/natural-pi-2-river&quot;&gt;Natural Pi #2 - River&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/34736/khinchins-constant-to-as-many-decimal-places-as-possible-in-64-bytes-or-less&quot;&gt;Khinchin's constant to as many decimal places as possible in 64 bytes or less&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/88923/compute-the-fibonomial-coefficient/88967#88967&quot;&gt;Compute the fibonomial coefficient&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;... and many more.&lt;/p&gt;&#xA;" OwnerUserId="60919" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-08T09:43:00.357" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11173" PostTypeId="2" ParentId="7893" CreationDate="2017-01-06T22:49:02.790" Score="1" Body="&lt;h1&gt;Post an answer explaining that this has already been addressed&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;When an opinion or discussion-starter of yours is closed as a dupe, it feels strange to be told that your viewpoint is a redundant with someone else's. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10127/20260&quot;&gt;To quote Martin&lt;/a&gt;, &quot;Yes, there isn't much of a point in writing the same kind of answer to every of these questions, but closing them as a duplicate probably doesn't make the author feel like their concerns are being taken seriously.&quot; It's especially frustrating if you wrote your post in full awareness of alleged dupe, to bring up a related situation or explore another option in depth.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I see dupe closures on meta that over-reach, not saying &quot;This is the same as another question,&quot; but &quot;My answer to this question would be largely the same as to this other question.&quot; These are effectively answers and should be posted as such.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The answer doesn't have to be long or repeat existing material. It should basically link to the previous discussion, explain how it applies to the current question, and say why you think it's satisfactory. If community consensus is with you, then closed it as a dupe. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I see many advantages of doing this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;People can vote to register agreement or disagreement. If the dupe claim is unsatisfactory or community opinion has changed, this will be apparent.&lt;/li&gt;&#xA;&lt;li&gt;The answer explains why the dupe applies. This is especially helpful for new users who may be unaware of the context of past discussions, or be using different terminology.&lt;/li&gt;&#xA;&lt;li&gt;Competing answers can be posted. If someone claims the situation is different than before, they can explain why and others can vote on it.&lt;/li&gt;&#xA;&lt;li&gt;It feels less dismissive. Even a short answer saying that this has already been addressed feels like a person responding, not some faceless bureaucratic process telling you that what you said was invalid.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I should be clear that this is for posts expressing a view where claiming a dupe is itself expressing a viewpoint. If being a dupe is just a matter of fact, simply close it.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-03-16T15:46:44.923" LastActivityDate="2017-01-06T22:49:02.790" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11177" PostTypeId="1" CreationDate="2017-01-07T18:14:28.630" Score="1" ViewCount="46" Body="&lt;p&gt;I've noticed that some challenges could be solved using automata. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/105083/close-your-tags&quot;&gt;this challenge&lt;/a&gt; in closing XML tags could be solved using a pushdown automaton. Would such an answer be acceptable? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If DFAs, PDAs, etc. were permitted, how would they be scored? Some possibilities could include the number of states, number of transition arrows, number of stack accesses (in a PDA), or a function of all of these.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If encoding an automaton is problematic (after all, they're usually drawn), perhaps the formal definition would suffice? This would lead to more complex answers, but they'd be more quantifiable (ex: count the number of characters in the formal definition). &lt;/p&gt;&#xA;" OwnerUserId="61028" LastEditorUserId="61028" LastEditDate="2017-01-07T18:23:11.727" LastActivityDate="2017-01-07T18:23:11.727" Title="Are automata or state machines a valid choice of language?" Tags="|discussion|policy|" AnswerCount="0" CommentCount="1" ClosedDate="2017-01-08T01:21:38.217" ContentLicense="CC BY-SA 3.0" />
  <row Id="11178" PostTypeId="2" ParentId="2140" CreationDate="2017-01-07T21:41:56.143" Score="0" Body="&lt;h1&gt;Create a Flip-Flop Program&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your challenge is simple: write a &lt;em&gt;full program&lt;/em&gt; which alternates between two different outputs upon each run.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your submission can choose which is printed the first time the program is run, but after that it should alternate between these &lt;em&gt;exact&lt;/em&gt; outputs.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules/Details&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You cannot assume the filename of your program.&lt;/li&gt;&#xA;&lt;li&gt;The values must be distinct.&lt;/li&gt;&#xA;&lt;li&gt;Creating files is allowed - you are allowed to assume a file such as &lt;code&gt;a.txt&lt;/code&gt; does not already exist in the directory.&lt;/li&gt;&#xA;&lt;li&gt;Reading and modifying the source is allowed.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the &lt;strong&gt;shortest solution (in bytes) wins&lt;/strong&gt;! Standard golfing loopholes apply.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should I allow assuming the program's filename at an additional bytecount (length of filename)?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stateful&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stateful&amp;#39;&quot; rel=&quot;tag&quot;&gt;stateful&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="60919" LastEditorUserId="60919" LastEditDate="2017-11-29T08:13:55.053" LastActivityDate="2017-11-29T08:13:55.053" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="11179" PostTypeId="1" CreationDate="2017-01-07T22:25:43.020" Score="2" ViewCount="71" Body="&lt;p&gt;PS: Honestly I just proposed my first challenge on PPCG hours ago, so feel free to criticize me.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I just had my very first challenge published &lt;a href=&quot;https://codegolf.stackexchange.com/q/106001/59292&quot;&gt;here&lt;/a&gt; and I ran into a problem that some answers are based on a slightly changed description of the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Two examples:&#xA;1, (in MMA post) The challenge says 0 for in and 1 for out; The first version of 30-byte long code changed it into -1 for in and 1 for out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2, (in Octave post) The challenge requires input to be an array of triples (though it is the answerer's freedom to choose two of them, leading to different algorithm, and the freedom is discussed in the last part). The code left out one column, and made the input an array of double, or two arrays.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should I remove restrictions and focus on core algorithms here? The removal will not break codes submitted and gives future code more freedom. If it is OK, to what extent am I able to change the description for I am really interested in golfing code. I may learn for the next challenge.&lt;/p&gt;&#xA;" OwnerUserId="59292" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2017-01-09T17:31:37.210" Title="To what extent the answer is allowed to change the description in the challenge?" Tags="|discussion|policy|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11180" PostTypeId="2" ParentId="11103" CreationDate="2017-01-08T02:37:37.067" Score="15" Body="&lt;h1&gt;Yes, but the reposting of a challenge must be voted on&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Instead of having a set time limit and max number of reposts, we could have a thread similar to the sandbox where there could be &quot;repost requests&quot;, and in order for a challenge to get the thumbs up for reposting, it must reach a certain ratio of upvotes to downvotes. A request might look like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# [challenge](link/to/it)&#xA;&#xA;&amp;lt;Citation of eligibility for the user wishing to repost&amp;gt;&#xA;&#xA;&amp;lt;Any additional information&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2017-01-08T02:37:37.067" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11181" PostTypeId="1" AcceptedAnswerId="11182" CreationDate="2017-01-08T07:14:00.990" Score="2" ViewCount="64" Body="&lt;p&gt;I have designed some mechanisms that makes private properties in a class to be inaccessible from other contexts using whatever methods. I want to know if it is really inaccessible given any code. Can I ask a question here to challenge for accessing the private properties? Or should I ask them on another StackExchange site (and where?)?&lt;/p&gt;&#xA;" OwnerUserId="56188" LastActivityDate="2017-01-08T07:38:57.743" Title="Must a question have an answer?" Tags="|discussion|asking-questions|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11182" PostTypeId="2" ParentId="11181" CreationDate="2017-01-08T07:38:57.743" Score="6" Body="&lt;p&gt;Ask on StackOverflow.com, or security.stackexchange.com. Not here.&lt;/p&gt;&#xA;" OwnerUserId="60042" LastActivityDate="2017-01-08T07:38:57.743" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11183" PostTypeId="2" ParentId="11144" CreationDate="2017-01-08T12:06:30.193" Score="10" Body="&lt;p&gt;Well, just pointing out that it exists certainly helps. Based on the comments on this question, it's fair to say many users with access to the tools didn't even know they were there. This is more a failing of the SE design than a site-specific issue - the only link to that page is on the review queue page (and I personally never even realized that it &lt;em&gt;was&lt;/em&gt; a link, much less clicked on it).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/oG7eE.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/oG7eE.png&quot; alt=&quot;whaa?!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've opened a &lt;a href=&quot;https://meta.stackexchange.com/q/289525/307833&quot;&gt;feature request on Meta.SE&lt;/a&gt; to make this page more visible via adding a button on the omnibar.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2017-01-08T12:06:30.193" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11186" PostTypeId="1" CreationDate="2017-01-08T16:58:11.353" Score="38" ViewCount="2709" Body="&lt;h3&gt;Final phase&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You have chosen the categories and the nominees for PPCG's annual “Best of”. Now it is time to pick the winners!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each of the ten categories is represented by an answer to this question, and each of these answers contains all nominations by the members of our community.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Voting mechanism&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each nominee has been added as a comment to its category's answer. In each category, the nominee whose comment has the highest number of votes by January 24, 00:00 UTC will be declared the winner of that category.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Further details&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Starting now, please do &lt;strong&gt;not&lt;/strong&gt; edit the answers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Please do &lt;strong&gt;not&lt;/strong&gt; add comments to the answers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Votes on the question and on answers are meaningless; only votes on comments count.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Feel free to vote for multiple nominees of the same category, including your own posts.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="12012" LastEditDate="2017-01-24T00:00:29.940" LastActivityDate="2017-01-24T00:00:29.940" Title="Cast your vote for “Best of PPCG 2016”!" Tags="|discussion|best-of|" AnswerCount="10" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11187" PostTypeId="2" ParentId="11186" CreationDate="2017-01-08T16:59:03.163" Score="4" Body="&lt;h2&gt;Best Explanation&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This category is for the answer with the best explanation accompanying it. Ideally, the winner will be an answer with a very detailed explanation that is accessible to anyone, regardless of the amount of relevant knowledge already possessed.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/101238/36398&quot;&gt;Evaluate the aspect ratio of a triangle&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/3852/lynn&quot;&gt;Lynn&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Luis Mendo&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The coloured diagrams and accompanying explanations make Jelly so much simpler to understand, and were totally unexpected by many of us. The comments to that answer reflect the impression caused by the graphical explanation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I could have nominated &lt;a href=&quot;https://codegolf.stackexchange.com/a/102275/36398&quot;&gt;this one&lt;/a&gt; as well, but I preferred to nominate the one I did because I think it was the first to include those diagrams.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/100785/42963&quot;&gt;Radiation Hardened Quine&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/62131/ais523&quot;&gt;ais523&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by TimmyD&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Over 1kb of Perl code meticulously explained in very readable English. Each code choice is gone through in detail, explaining why certain elements were included, and what happens when those elements are removed by the radiation. Additionally, the explanation also includes a verification script (and explanation thereof!) so people can run the code themselves.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/105014/12012&quot;&gt;Absolute Sums of Sidi Polynomial Coefficients&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's quite common to reduce a &quot;real-world&quot; problem to a single mathematical formula, but this answer expands a mathematical formula to an elaborate real-world problem. By doing so, a simple pattern becomes apparent that would be hard to detect in the mathematical definition of the sequence. Thus, this answer does not simply have an explanation, but the explanation is what made the answer possible in the first place!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/94829/31716&quot;&gt;When was this language released?&lt;/a&gt; -- by &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-ender&quot;&gt;Martin Ender&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by DJMcMayhem&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I like this challenge a lot because it requires lots of knowledge about a wide variety of languages spanning a long time-frame. Martin wonderfully demonstrates his impressive knowledge of 2D languages by posting not just 1 detailed and easily-accessible explanation, but &lt;em&gt;sixteen detailed and easily-accessible&lt;/em&gt; explanations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even though I know almost nothing about most of these languages, and have never heard of the other ones, reading through his answer is very clear and concise, while still being thorough and complete, and I can easily understand how each answer fits into the larger picture.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2017-01-15T00:16:06.563" CommentCount="4" CommunityOwnedDate="2017-01-08T16:59:03.163" ContentLicense="CC BY-SA 3.0" />
  <row Id="11188" PostTypeId="2" ParentId="11186" CreationDate="2017-01-08T17:00:14.020" Score="7" Body="&lt;h2&gt;Rookie of the year (answer)&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Awarded for the best answer by a user who had not posted an answer before 2016.&#xA;Note that the user may have posted challenges before 2016.&#xA;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/612788/2016-answers-by-users-with-no-answers-before-2016&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE query for such answers, ordered by score&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Nominations:&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/100785/8478&quot;&gt;Radiation Hardened Quine&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/62131/ais523&quot;&gt;ais523&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Martin Ender&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;ais523 started contributing in &lt;em&gt;mid-November&lt;/em&gt; and has since posted 139 answers and 10 challenges as well as very valuable contributions on meta. The overall quality of their content is absolutely outstanding, and I'm having a really hard time picking a specific answer to nominate (&lt;a href=&quot;https://codegolf.stackexchange.com/a/103532/8478&quot;&gt;this Cubix quine&lt;/a&gt; would also be a decent candidate). I've chosen the answer above because a third-order radiation hardened quine in a non-esoteric language is a very impressive achievement and the answer also comes with a great in-depth explanation.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/95910/31716&quot;&gt;Golf you a quine for great good&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/60590/udioica&quot;&gt;udioica&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by DJMcMayhem&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Not a lot of people on this site golf in vim, so I used to think I was the king of vim-golf on this site. I wrote a 17 byte vim-quine and challenged anyone to outgolf me, thinking I was safe. Boy was I wrong.&lt;/p&gt;&#xA;&lt;p&gt;Udioica noticed the challenge, and rose to it, golfing a whopping 6 bytes off of my solution on the first day they ever used PPCG.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/103048/194&quot;&gt;Build a digital clock in Wireworld&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/17111/niemiro&quot;&gt;niemiro&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Peter Taylor&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is niemiro's only answer on PPCG so far, and claims to be their first Wireworld circuit too, but it is most definitely ambitious. The answer includes not only an animated GIF of the circuit in action but also a detailed breakdown of its construction.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/102817/194&quot;&gt;A rather knotty conundrum&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/62131/ais523&quot;&gt;ais523&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Peter Taylor&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The only answer at present to a rather difficult question, and an excellent illustration of the importance of choosing the right language for the task.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/95359/55508&quot;&gt;A Mouse with Dynamite&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/51507/ton-hospel&quot;&gt;Ton Hospel&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Dada&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Ton Hospel is someone who needs no introduction. He is one of the best Perl golfer in the world, has been so for pretty much as long as Perl golfing is a thing, and his solutions are always innovative, unexpected and short. And as it happens, he only joined PPCG this year. His code to solve &lt;em&gt;A mouse with Dynamite&lt;/em&gt; is a good example of his skills, and definitely one of the best golfings I've ever seen (and it comes with a very detailed explanation).&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-16T19:22:29.507" CommentCount="5" CommunityOwnedDate="2017-01-08T17:00:14.020" ContentLicense="CC BY-SA 3.0" />
  <row Id="11189" PostTypeId="2" ParentId="11186" CreationDate="2017-01-08T17:01:23.080" Score="9" Body="&lt;h2&gt;Kansas City Shuffle&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;or &lt;strong&gt;Best mathematical insight&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;On this site we often see answers in languages specifically designed for short code, or designed to be fast. Sometimes, a nice golfing trick or speed-up technique surprises us with its ingenuity, beyond the standard use of that language.&lt;/p&gt;&#xA;&lt;p&gt;And occasionally an answer shows up that uses an unexpected approach to greatly simplify the problem, and makes us wonder how the author could ever think of that. This usually involves some far-from-obvious mathematical equivalence, or a particularly simple approach to the problem that was not evident at all (once revealed, other answers often follow the same approach).&lt;/p&gt;&#xA;&lt;p&gt;This category is for the answer with the best &lt;strong&gt;mathematical&lt;/strong&gt; insight or unexpected approach that led to greatly simplifying the problem, in &lt;strong&gt;any challenge type&lt;/strong&gt; (code golf, fastest code, or others). The insight should have led to a significant improvement according to the challenge's metric (code&#xA;length, run time, or whatever applicable).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Nominations:&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/71338/42963&quot;&gt;Difference of three input integers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/20260/xnor&quot;&gt;xnor&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by TimmyD&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;An easy enough challenge (that xnor even helped tighten up before answering), but practically every answer posted says something like &amp;quot;Uses xnor's algorithm&amp;quot;. The algorithm itself is a simple conclusion of the challenge setup, but approaches it from an unintuitive angle, resulting in an elegant approach that many others utilized.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/94524/53551&quot;&gt;Calculate a string's cumulative slope&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by wat&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Dennis simplified this whole challenge by showing that the numbers form a telescopic series, making answers much easier than completing the original problem as intended.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/89444/31716&quot;&gt;Is it a Proth number?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by DJMcMayhem&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Is it a Proth number&lt;/em&gt; is one of my favorite challenges I've posted. The premise is very simple:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Can a number &lt;strong&gt;N&lt;/strong&gt; be expressed as&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;N = k * 2^n + 1&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Where &lt;code&gt;k&lt;/code&gt; is an odd positive integer and &lt;code&gt;n&lt;/code&gt; is a positive integer such that &lt;code&gt;2^n &amp;gt; k&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Which is a fairly straightforward thing to test for. Dennis flipped this on it's head, and threw in a bunch of bit-shifting magic, and almost an entire paper of mathematical analysis to prove it worked. I remember watching answers pouring in after his, all claiming&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Uses Dennis's algorithm&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/100075/60884&quot;&gt;Goodness Giza Golf!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/60884/gabriel-benamy&quot;&gt;Gabriel Benamy&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This answer tackles the decision problem &amp;quot;Is this number a Giza number?&amp;quot; by observing a beautiful mathematical property of all Giza numbers, and applying this insight into the solution.  Instead of analyzing the problem purely from a programmatic standpoint, the code, and the explanation, highlights the relationship between Giza numbers and repdigits, and takes full advantage of it in the code.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/105014/12012&quot;&gt;Absolute Sums of Sidi Polynomial Coefficients&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;It's quite common to reduce a &amp;quot;real-world&amp;quot; problem to a single mathematical formula, but this answer expands a mathematical formula to an elaborate real-world problem. By doing so, a simple pattern becomes apparent that would be hard to detect in the mathematical definition of the sequence. This allows to replace the combinations in the original formula (which would require a lengthy implementation in Python and other languages that lack the built-in) with a doubly-recursive function that uses only elementary operations.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/104681/12012&quot;&gt;Coprimes up to N&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;While determining coprimality is straightforward in programming languages with a GCD built-in and computing the GCD with the Euclidean algorithm is also quite easy, filtering all coprimes from a range requires &lt;em&gt;two&lt;/em&gt; function definitions, which take a toll on the byte count. This answer does something different: it uses multiplicative inverses modulo &lt;strong&gt;n&lt;/strong&gt; to detect coprimes. Not only makes this computing the GCD unnecessary, it manages to solve the problem with a simple loop. The algorithm from the original Python was successfully ported to JavaScript, which also lacks a GCD built-in.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/69056/20260&quot;&gt;Add and multiply perplexing numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/20260/xnor&quot;&gt;xnor&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is an insight I'm proud of that didn't get much visibility.&lt;/p&gt;&#xA;&lt;p&gt;The problem is to evaluate an arithmetic expression in a variant of the complex numbers where &lt;code&gt;j^2 = 1&lt;/code&gt;. It would seem like you need to parse the expression and resolve how each operator acts on this new type of number.&lt;/p&gt;&#xA;&lt;p&gt;Instead, I use the fact that both the numbers &lt;code&gt;j=1&lt;/code&gt; and &lt;code&gt;j=-1&lt;/code&gt; satisfy &lt;code&gt;j^2 = 1&lt;/code&gt;. So, the resulting equality must hold for them as well. Evaluating the input expression as Python code on these values gives a system of two equations that can be solved for the output. This allows a 62-byte solution, far shorter than anything with parsing.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/93772/12012&quot;&gt;Compute the Carmichael function&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Computing the Carmichael function can be a straightforward loop or recursive function in languages that have coprimality or GCD built-ins, but some languages (e.g., Python) lack both. This answer defines a different mathematical function which definition uses only elementary arithmetic operations; determining coprimality or calculating GCDs is not required. The answer also contains a formal proof that this function is identical to the Carmichael function and provides a concise, recursive implementation.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/79841/12012&quot;&gt;How many steps does it take from n to 1 by subtracting the greatest divisor?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Superficially, the problem at hand seems entirely unrelated to coprimality or Euler's totient function. Yet, this answers uses a unique approach based on the latter, which has a particularly concise implementation in the chosen language. While that approach saved only one byte over &lt;a href=&quot;https://codegolf.stackexchange.com/a/79688/12012&quot;&gt;the straightforward solution&lt;/a&gt;, the approach is most unexpected and achieved a 10% reduction of the score.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-16T19:07:36.470" CommentCount="9" CommunityOwnedDate="2017-01-08T17:01:23.080" ContentLicense="CC BY-SA 3.0" />
  <row Id="11190" PostTypeId="2" ParentId="11186" CreationDate="2017-01-08T17:02:24.513" Score="7" Body="&lt;h2&gt;Pro tip&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Best answer to any &lt;em&gt;general&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question. That is, candidates should be drawn from &amp;quot;Tips for golfing in X&amp;quot; questions (as opposed to specific &amp;quot;how do I shorten this piece of code&amp;quot; questions).&lt;/p&gt;&#xA;&lt;p&gt;Some of the most useful content that we generate for other golfers is in our tips questions, so it would be nice to reward an exceptional golfing trick this way.&lt;/p&gt;&#xA;&lt;p&gt;Candidates should be tips which show deep insight into the language, yet are applicable in a wide range of situations. The exact amounts of bytes saved by the tip is not relevant.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Julia: &lt;a href=&quot;https://codegolf.stackexchange.com/a/81028/12012&quot;&gt;Redefine operators to define functions&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;self nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This tip discovered an undocumented way of re-defining Julia's operators, which is applicable to all function definitions with one non-optional argument or two (optional or non-optional) arguments. Not only does this alternate way of defining functions save bytes in most cases, the special status as operators obliterates the needs for parentheses in multiple or recursive calls as long as the operator precedence is correct. Since its discovery, this tip has been used in countless Julia answers. It also inspired the &lt;a href=&quot;https://codegolf.stackexchange.com/a/82740/12012&quot;&gt;Operators as Functions&lt;/a&gt; Mathematica tip.&lt;/p&gt;&#xA;&lt;h2&gt;Octave: &lt;a href=&quot;https://codegolf.stackexchange.com/a/104753/36398&quot;&gt;Anonymous functions with more than one statement&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/62451/rahnema1&quot;&gt;rahnema1&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Luis Mendo&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this tip, @rahnema1 shows how to overcome the limitation that an anonymous in Octave can only contain one statement. This is done by exploiting the facts that an assignment can be done anywhere and indexing can be chained. It is a brilliant tip with many potential uses. One example, illustrated in the tip, is returning a function's output other than the first.&lt;/p&gt;&#xA;&lt;h2&gt;Mathematica: &lt;a href=&quot;https://codegolf.stackexchange.com/a/100629/8478&quot;&gt;Lists with repeated values&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-ender&quot;&gt;Martin Ender&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a seemingly simple trick which combines a couple of the more obscure features of Mathematica in order to shorten a wide variety of list literals with repeated values. It took me a couple of years of golfing in Mathematica to come up with it and really shows that Mathematica's golfing can be surprisingly subtle. The tip can be used a variety of situations as it applies to some fairly commonly needed lists but can also be applied to lists of arbitrary structure.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-16T08:24:00.503" CommentCount="3" CommunityOwnedDate="2017-01-08T17:02:24.513" ContentLicense="CC BY-SA 3.0" />
  <row Id="11191" PostTypeId="2" ParentId="11186" CreationDate="2017-01-08T17:03:35.350" Score="6" Body="&lt;h2&gt;Rookie of the year (challenge)&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Awarded for the best challenge by a user who had not posted a challenge before 2016. Note that the user may have posted answers before 2016.&#xA;  &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/612789/2016-questions-by-users-with-no-questions-before-2016&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE query for such challenges, ordered by score&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/104896/the-futuristic-gun-duel&quot;&gt;Futuristic Gun Battle&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/11933/frenzy-li&quot;&gt;Frenzy Li&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by isaacg&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;King of the Hill challenges are some of the hardest challenges to write, and require a great deal of programming to implement the controller as well as ongoing management of the system. Frenzy Li pulled off a great king of the hill challenge around a well-thought-out, fun game, simple enough to specify and complicated enough to be fun, and managed the submissions well, closed loopholes where needed, and generally made an excellent challenge that's been fun for lots of people.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/69121/8478&quot;&gt;Surrounded Countries&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/48931/sisyphus&quot;&gt;Sisyphus&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Martin Ender&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This was a great challenge by a user who hadn't posted anything else before (and unfortunately not a lot since). The problem is interesting, not too contrived, well explained, and the specification is tight and has a good number of test cases. It led to various interesting approaches in the answers. There isn't a lot more you could ask for in a challenge.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/99913/42963&quot;&gt;5 Favorite Letters&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/59376/carusocomputing&quot;&gt;carusocomputing&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by TimmyD&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The perfect blend of challenge, allowing for many different approaches while simultaneously being narrow enough that each approach makes sense. The specifications are clear and unambiguous, and the added challenge of meta-golfing to determine which five letters to use adds a very unique twist.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/90349/the-letter-a-without-a&quot;&gt;The letter A without A&lt;/a&gt; - &lt;a href=&quot;https://codegolf.stackexchange.com/users/58717/thebitbyte&quot;&gt;TheBitByte&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Display the first letter of the alphabet. You can't use the letter itself. Or it's unicode value. Or its HTML value. Sounds easy?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But it's gotten nice solutions. No plus signs for Brainfuck means you have to be creative. Or in Javascript, grab the second letter of &quot;NaN&quot; (among other ways), or literally grab the first letter of the alphabet, boring, but hey its less than 10 bytes!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/102370/31716&quot;&gt;Add a language to a polyglot&lt;/a&gt; - &lt;a href=&quot;https://codegolf.stackexchange.com/users/62131/ais523&quot;&gt;ais523&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by DJMcMayhem&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a very fun challenge that perfectly blends two more obscure challenge types: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt;. The beautiful thing about this challenge is that it started out extremely easy, but with each new answer it gets significantly harder. Still, even after a month, this challenge continues to produce incredible answers, and many new users have &lt;em&gt;joined&lt;/em&gt; the site to post an answer. This challenge has produced so much great content, it even prompted a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11103/31716&quot;&gt;meta discussion&lt;/a&gt; about whether we could repost this particular challenge in the future, so it's clearly well-loved by the community.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2017-01-16T19:10:08.313" CommentCount="5" CommunityOwnedDate="2017-01-08T17:03:35.350" ContentLicense="CC BY-SA 3.0" />
  <row Id="11192" PostTypeId="2" ParentId="11186" CreationDate="2017-01-08T17:04:37.570" Score="6" Body="&lt;h2&gt;Not as simple as it looks&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This award goes to a high quality challenge (not necessarily &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;) that is easy to understand and looks simple at first glance, but where the best solutions are actually quite difficult to find.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The difficulty should be intrinsic to the problem, and not come from messy edge cases or strict formatting rules.&lt;/li&gt;&#xA;&lt;li&gt;The challenge should be fun to solve, and not &lt;em&gt;impossibly&lt;/em&gt; hard. Unanswered challenges may not be good candidates.&lt;/li&gt;&#xA;&lt;li&gt;The challenge may allow for simple solutions, but a competitive solution should be very intricate and/or not obvious at all.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/93615/42963&quot;&gt;Bake a slice of Pi&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56755/copper&quot;&gt;Copper&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by TimmyD&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A simple &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; challenge, right? Not so fast. Turns out the compression is decidedly difficult, such that even getting a few bytes shorter than the boring &amp;quot;print string&amp;quot; solution is deemed a victory, with only 1/3rd of the answers approaching that threshold.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/71631/40695&quot;&gt;Upgoat or Downgoat&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/40695/downgoat&quot;&gt;Downgoat&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a challenge which started out as kind of a joke but turned out to be one of the most popular challenges in 2016, is a very, very simple challenge. To determine whether or not an image of a goat has been flipped. Various answers have tried all sorts of techniques, checking which side is darker, checking contrast in various parts, or simply detecting which direction is more &amp;quot;goaty&amp;quot;. The challenge is a simple problem but is a tricky problem to properly solve with many, many different approaches.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/70221/8478&quot;&gt;Can my 4-note music box play that song?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/7796/apsillers&quot;&gt;apsillers&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Martin Ender&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Conceptually, this is a very simple problem that can be easily visualised. However, the structure of the problem doesn't map to any common data structures or algorithms which results in a wide variety of interesting approaches that also differ substantially for languages with different paradigms. There are 15 answers and almost as many different ideas.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-16T19:09:00.760" CommentCount="3" CommunityOwnedDate="2017-01-08T17:04:37.570" ContentLicense="CC BY-SA 3.0" />
  <row Id="11193" PostTypeId="2" ParentId="11186" CreationDate="2017-01-08T17:06:45.427" Score="4" Body="&lt;h2&gt;Best Above-and-Beyond Answer&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Every once and a while, an answer takes the challenge to the extreme. This prize will be awarded to an answer which went far beyond the expectations of the challenge. This could include&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a code golf answer that brute-forced/proved the shortest program in some language&lt;/li&gt;&#xA;&lt;li&gt;a graphical-output popcon answer of extreme size and quality&lt;/li&gt;&#xA;&lt;li&gt;a KOTH answer of high complexity which absolutely dominated the competition&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/70596/24877&quot;&gt;Patch the Image&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/42643/m%c4%b1nxoma%cf%84&quot;&gt;mınxomaτ&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;nominated by flawr and TimmyD&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The challenge itself was certainly not easy, however &lt;em&gt;mınxomaτ&lt;/em&gt; implements an algorithm developed in 2003 and provides a very detailed explanation. His submission shows excellent results, and also includes real-world application of the techniques.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/103555/41805&quot;&gt;Radiation Hardened Quine&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-ender&quot;&gt;Martin Ender&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;nominated by Kritixi Lithos&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The first non-deleted answer was a 1-order radiation hardened quine. Then came an exceptional 3-order one. But this answer by Martin Ender goes beyond that past the skies into space with a &lt;strong&gt;14-order&lt;/strong&gt; radiation hardened quine. That's almost 5 times more than the previous best solution!  Not just that, his answer has a very detailed explanation and how he came up with this solution.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/74372/12012&quot;&gt;Calculate the number of primes up to n&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;self nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This answer combines a lot of different techniques to implement the &lt;strong&gt;π&lt;/strong&gt; function as fast as possible. Measured by the official scoring algorithm, it is at least one order of magnitude faster than the second-best answer; it would be several orders of magnitude accounting for start-up times. Achieving this took roughly 60 revisions and two hours of work. In the end, the answer managed to outperform not only its competitors, but also &lt;a href=&quot;https://github.com/kimwalisch/primecount&quot; rel=&quot;nofollow noreferrer&quot;&gt;kimwalisch's primecount (GitHub)&lt;/a&gt;. Some ideas from the answer were ultimately implemented in the GitHub repo.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/95296/31716&quot;&gt;Golf you a quine for great good!&lt;/a&gt; -- by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;WheatWizard&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by DJMcMayhem&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;For those of you who are unfamiliar with brain-flak, it's a maddeningly difficult turing-tarpit designed by me with help from Wheat Wizard and &lt;a href=&quot;https://codegolf.stackexchange.com/users/20059/1000000000&quot;&gt;1000000000&lt;/a&gt;. In a lot of ways, it's similar to brainfuck, although it tends to be longer since it has no explicit forms of IO. I didn't think a brain-flak quine was possible, but WheatWizard proved me wrong. The original version was too long to actually fit &lt;s&gt;on a computer&lt;/s&gt; in the known universe, but had a python script to verify that the answer worked in theory, given infinite time and memory.&lt;/p&gt;&#xA;&lt;p&gt;2 months later, it was golfed down to 12K bytes to fit into the observable universe. Over the month of december, it was further golfed down to its current state of 3855 bytes. This answer is the first brain-flak quine, and includes a novel approach of encoding large amounts of data in a single number, and then decoding it to print certain values. It's also the only answer I can think of that has been golfed by over &lt;code&gt;10*e576&lt;/code&gt; bytes.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/68494/8478&quot;&gt;Hello, World!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/4098/primo&quot;&gt;primo&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;nominated by Martin Ender&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;primo kicked off the year with one of the most impressive answers I've seen on this site. As far as we know, this answer contains several world records for various spelling variants of &amp;quot;Hello, World!&amp;quot;, which are based on a form of recurrence relation that is easy to implement in Brainfuck, and which yields a lot of useful values to print the string at hand. primo subsequently spent several weeks crunching the numbers, bringing down the score by another &lt;em&gt;11 bytes&lt;/em&gt;. I find this extremely impressive, considering that Brainfuck is one of the oldest and most thoroughly studied esolangs out there. A year later, the world records still stand.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-15T16:38:20.340" CommentCount="5" CommunityOwnedDate="2017-01-08T17:06:45.427" ContentLicense="CC BY-SA 3.0" />
  <row Id="11194" PostTypeId="2" ParentId="11186" CreationDate="2017-01-08T17:08:22.003" Score="7" Body="&lt;h2&gt;Best Showcase of a New Language&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This is for new languages (golfing or otherwise) created in or after December 2015 (meaning, the first commit on GitHub or the like was from that date). The category is designed to highlight the answer that best shows the tricks, features, and benefits of using this new language. The author of the answer does not necessarily need to have been the author of the language.&lt;/p&gt;&#xA;&lt;p&gt;Answers from the &lt;a href=&quot;https://codegolf.stackexchange.com/q/44680/8478&quot;&gt;Showcase of Languages&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; challenges are ineligible.&lt;/p&gt;&#xA;&lt;p&gt;A not necessarily exhaustive list of eligible languages: &lt;a href=&quot;https://github.com/lmendo/MATL/commit/3af4adba7d9e8ffa855a2f2dd5105e7b2f255ae0&quot; rel=&quot;nofollow noreferrer&quot;&gt;MATL&lt;/a&gt;, &lt;a href=&quot;https://github.com/DennisMitchell/jelly/commit/935b138a1f544e48cb27c01396a803ec54dc7ef5&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt;, &lt;a href=&quot;https://github.com/allenkev/annieflow/commit/a1220029bd4d9c1eea22b79ecb5547394cb1f927&quot; rel=&quot;nofollow noreferrer&quot;&gt;AnnieFlow&lt;/a&gt;, &lt;a href=&quot;https://github.com/muddyfish/PYKE/commit/ed0769d415a1c853878354a5a68dda54c1342ec9&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pyke&lt;/a&gt;, &lt;a href=&quot;https://github.com/DenkerAffe/IPOS/commit/667749946ae98f0d279e1a9a7ff37ac04b7e686c&quot; rel=&quot;nofollow noreferrer&quot;&gt;IPOS&lt;/a&gt;, &lt;a href=&quot;https://github.com/m-ender/stackcats/commit/1a0ac38931aa666e17f38b4faba52ba58572c313&quot; rel=&quot;nofollow noreferrer&quot;&gt;Stack Cats&lt;/a&gt;, &lt;a href=&quot;https://github.com/DJMcMayhem/V/commit/646d8217de78e5b6d9f6a639e6829a1b20ec2097&quot; rel=&quot;nofollow noreferrer&quot;&gt;V&lt;/a&gt;, &lt;a href=&quot;https://github.com/DennisMitchell/sesos/commit/59fc320004530672339c5ed6a430758b45f56164&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sesos&lt;/a&gt;, &lt;a href=&quot;https://github.com/rjhunjhunwala/S.I.L.O.S/commit/a942b40bf57a738bbcda30e0838a3e388fbe1447&quot; rel=&quot;nofollow noreferrer&quot;&gt;S.I.L.O.S&lt;/a&gt;, &lt;a href=&quot;https://github.com/iatorm/jellyfish/commit/872af1195daad38a3effa1e3ccc7727d6168e367&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jellyfish&lt;/a&gt;, &lt;a href=&quot;https://github.com/DJMcMayhem/Brain-Flak/commit/3c9132e2e69448aafdffec4fe33358ba509e6c1d&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brain-Flak&lt;/a&gt;, &lt;a href=&quot;https://github.com/LogicodeLang/Logicode/commit/425fd3cb64f1b9c75caa8ea030afeb1450574d2b&quot; rel=&quot;nofollow noreferrer&quot;&gt;Logicode&lt;/a&gt;, &lt;a href=&quot;https://github.com/ETHproductions/cubix/commit/5b935e8bcf137d05044d91ec8e548280b7fc7d12&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cubix&lt;/a&gt;, &lt;a href=&quot;http://esolangs.org/w/index.php?title=7&amp;amp;action=history&quot; rel=&quot;nofollow noreferrer&quot;&gt;7&lt;/a&gt;, &lt;a href=&quot;https://github.com/Destructible-Watermelon/Turtl-d/commit/d629d188e03d91379938a946f8a74554ca3da88c&quot; rel=&quot;nofollow noreferrer&quot;&gt;Turtlèd&lt;/a&gt;, &lt;a href=&quot;https://github.com/somebody1234/Charcoal/commit/4548d7cc9c00e048e164cac67cb4837ef8a0471c&quot; rel=&quot;nofollow noreferrer&quot;&gt;Charcoal&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Nominations:&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/103051/41805&quot;&gt;A keyboard so real you can almost TASTE it&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31716/djmcmayhem&quot;&gt;DJMcMayhem&lt;/a&gt; - &lt;a href=&quot;https://github.com/DJMcMayhem/V/&quot; rel=&quot;nofollow noreferrer&quot;&gt;V&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Kritixi Lithos&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This answer showcases many of the interesting features of this Vim-based language: ranges, recursive macros and shorter regex statements to name a few. Not only that, this answer wins the challenge by beating the second best answer at a whopping &lt;s&gt;30&lt;/s&gt; 34 bytes!&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/91166/56656&quot;&gt;Sylvester's Sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/48934/leaky-nun&quot;&gt;Leaky Nun&lt;/a&gt; - &lt;a href=&quot;https://github.com/DJMcMayhem/Brain-Flak&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brain-Flak&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Wheat Wizard and DJMcMayhem&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;According to its github Brain-Flak is a &amp;quot;A minimalist esolang designed to be painful to use&amp;quot; but in the last year it has gathered a user-base on PPCG. It now has over 80 answers written in it across several users.  Nowhere is the elegance and surprising power of Brain-Flak better demonstrated in Leaky-Nun's Sylvester Sequence solution. Not only is it  one of the best Brain-Flak golfs I have ever seen, it also demonstrates how Brain-Flak loops can be used to create polynomial expressions.  This submission is surprisingly terse for a language as limited as Brain-Flak and takes full advantage of everything Brain-Flak has to offer.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/97793/16766&quot;&gt;Draw an ASCII-O'-Lantern for Halloween&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt; - &lt;a href=&quot;http://github.com/somebody1234/Charcoal&quot; rel=&quot;nofollow noreferrer&quot;&gt;Charcoal&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Charcoal is a language that specializes in ASCII art, designed by &lt;a href=&quot;https://codegolf.stackexchange.com/users/39244/ascii-only&quot;&gt;ASCII-only&lt;/a&gt; and me. This answer showcases its canvas-based approach on a moderately complicated problem, using many of the core features of the language (automatic line characters, ASCII literals, reflection, and overwriting previously drawn characters). It's not every day you get to outgolf Jelly, Pyth, and V on the same challenge!&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/85048/8478&quot;&gt;Add two numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/21487/sp3000&quot;&gt;Sp3000&lt;/a&gt; - &lt;a href=&quot;https://github.com/m-ender/stackcats&quot; rel=&quot;nofollow noreferrer&quot;&gt;Stack Cats&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Martin Ender&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Stack Cats (SKS) is a language that Sp3000 and I created this year, whose unique structure makes programming in it quite a challenge, even though the language is Turing-complete. At the same time it doesn't reach Malbolge levels of difficulty, so programming in it &lt;em&gt;is&lt;/em&gt; actually possible, if tricky. &amp;quot;Add to numbers&amp;quot; is of course quite trivial, but it provides a surprising challenge for a language like SKS. So far, we haven't been able to figure out how to program in it without using the &lt;code&gt;&amp;lt;(...)*(...)&amp;gt;&lt;/code&gt; template which skips half the code, circumventing SKS's main restriction. This answer showcases both such a (well-golfed) handwritten program, as well as several solutions which were found by automated search, which &lt;em&gt;don't&lt;/em&gt; use the template and beat the handwritten one by two bytes. The answer also contains a short introduction to SKS as well as detailed explanations of both solutions which should make the answer accessible to people who are not familiar with the language.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/101535/8478&quot;&gt;Numbers divisible by the sum and product of their digits&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-ender&quot;&gt;Martin Ender&lt;/a&gt; - &lt;a href=&quot;http://github.com/iatorm/jellyfish&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jellyfish&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Jellyfish, created by &lt;a href=&quot;https://codegolf.stackexchange.com/users/32014/zgarb&quot;&gt;Zgarb&lt;/a&gt;, is my favourite language of the year. Its semantics are loosely inspired by J, in that the language is functional and you'll work a lot with higher-order functions, but it has a very unique two-dimensional syntax, where each function takes an argument from below and an argument from the right (based on &lt;a href=&quot;https://codegolf.stackexchange.com/q/65661/8478&quot;&gt;this challenge&lt;/a&gt;), which lets you reuse arguments and makes the layout a very important component of golfing.&lt;/p&gt;&#xA;&lt;p&gt;To my knowledge, this answer is the most elaborate Jellyfish program that was written so far and it shows off a lot of interesting features for constructing higher-order functions to solve complex problems and how the layout can be relevant. The answer also contains a fairly detailed explanation of how the program works.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/70216/12012&quot;&gt;1, 2, Fizz, 4, Buzz&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt; - &lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;self nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This answer combines several useful Jelly abilities that are uncommon in other languages: pre-defined variables (&lt;code&gt;³&lt;/code&gt;), splitting a link into chains (&lt;code&gt;µ&lt;/code&gt;), automatic vectorization (&lt;code&gt;ḍ&lt;/code&gt;), advanced array-manipulation built-ins (&lt;code&gt;Ṭ&lt;/code&gt;), and in-built dictionary-based compression (&lt;code&gt;“¡Ṭ4“Ụp»&lt;/code&gt;). Not only does the answer illustrate these rather unique abilities, but it combines them into a 20-byte solution to this classical programming problem. For comparison, the next submission that does not use a FizzBuzz built-in requires 27 byte for the same task (GS2), followed by a 30-byte Pyth solution.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-16T19:04:35.897" CommentCount="6" CommunityOwnedDate="2017-01-08T17:08:22.003" ContentLicense="CC BY-SA 3.0" />
  <row Id="11195" PostTypeId="2" ParentId="11186" CreationDate="2017-01-08T17:09:27.007" Score="10" Body="&lt;h2&gt;SGITW (Slowest Gun in the West)&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;For the best 2016 answer in a challenge which received no answers within 48 hours of posting. The challenge itself does not need to be from 2016 and the nominated answer doesn't need to be the first answer to the challenge, but the first answer to the challenge does need to be from 2016. Tips questions are not counted for this category.&lt;/p&gt;&#xA;&lt;p&gt;It's very easy to get drawn to the fast-rising HNQ-hitting questions with a plethora of answers, so I thought this would be a good way to bring attention to answers that really needed to earn their love.&lt;/p&gt;&#xA;&lt;p&gt;SEDE query: &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/605878/48-hour-gap&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://data.stackexchange.com/codegolf/query/605878/48-hour-gap&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/94513/24877&quot;&gt;Solve Grid-Tangram&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/15599/level-river-st&quot;&gt;Level River St&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by flawr&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I think we can agree that the challenge itself was not easy, however &lt;em&gt;Level River St&lt;/em&gt; answered more than &lt;em&gt;two weeks&lt;/em&gt; after the challenge has been posted. The answer itself includes a great explanation on how the program works. So far it still is the only answer to this challenge.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/30292/20260&quot;&gt;“KNOT” or “NOT”?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/39242/anders-kaseorg&quot;&gt;Anders Kaseorg&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by xnor&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Anders Kaseorg solves a devilishly difficult challenge that remained without a valid answer for &lt;em&gt;nearly 2 years&lt;/em&gt;. And then makes &lt;a href=&quot;https://codegolf.stackexchange.com/posts/79132/revisions&quot;&gt;20 edits&lt;/a&gt; to golf the code and improve the explanation, despite being the only answer. The result is 306 bytes of meticulously golfed Python for a problem where any solution is impressive.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/86306/41723&quot;&gt;Unique Sudoku solver&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/41723/fatalize&quot;&gt;Fatalize&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This answer was provided nearly &lt;em&gt;5 years&lt;/em&gt; after the challenge was posted. In an effort to reduce the number of unanswered challenges, I decided to tackle this one with the best tool for the job: a declarative logic language. This results in a fairly short answer to a seemingly difficult problem, where a lot of the code is here to conform with the tedious input format. This challenge still does not have any other answer as of yet.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/50452/31716&quot;&gt;Given a table, place in the chairs&lt;/a&gt; - by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;WheatWizard&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by DJMcMayhem&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This was a very difficult challenge that remained unanswered for 15 months before Wheat Wizard finally answered it. And it remains the only answer. If that's not impressive enough, consider that this answer got golfed down by &lt;em&gt;Fifty-three percent&lt;/em&gt; with &lt;a href=&quot;https://codegolf.stackexchange.com/posts/89480/revisions&quot;&gt;36 edits&lt;/a&gt; over a 5-month period. That is some serious golfing dedication there, for a very impressive answer.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-16T19:21:42.167" CommentCount="4" CommunityOwnedDate="2017-01-08T17:09:27.007" ContentLicense="CC BY-SA 3.0" />
  <row Id="11196" PostTypeId="2" ParentId="11186" CreationDate="2017-01-08T17:10:28.780" Score="6" Body="&lt;h2&gt;It's not a Bug, It's a Feature&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Answer with the most clever use of a bug, error, or undocumented behavior.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/77106/20080&quot;&gt;Palindromizing the strings (Pyth)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/20080/isaacg&quot;&gt;isaacg&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Self nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this answer, I exploited a bug in Pyth's &lt;code&gt;I&lt;/code&gt; (invariant) operator, where if a program used an auto initializing variable (&lt;code&gt;J&lt;/code&gt; in this program) inside a use of &lt;code&gt;I&lt;/code&gt;, an extra token would be produced, and not consumed by the &lt;code&gt;I&lt;/code&gt; operator, leaving it sitting around. This is caused by the fact that Pyth parses &lt;code&gt;J&lt;/code&gt; differently the first and second times it appears in a program. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The use of &lt;code&gt;I&lt;/code&gt; was within the condition of and if statement, and the extra token left sitting around ended up in the body of the if condition, allowing it to printed out. If you look at the code directly, it's extremely unintuitive: There's a loop, whose body is an if statement, and nothing else. The body of the if statement has a break (&lt;code&gt;B&lt;/code&gt;), and nothing else. There's nothing to even get printed without the bug.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/95900/31716&quot;&gt;Draw an asterisk triangle&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/60590/udioica&quot;&gt;udioica&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by DJMcMayhem&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This answer is a beautiful abuse of weird and undocumented vim behavior, using &quot;autoindent&quot; to glitch out and create a cascade of increasingly indented lines, which is pretty much exactly what the challenge was asking for. In all my years of using vim, it's something I never would have noticed otherwise.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/94171/194&quot;&gt;List all ordered partitions of n&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-ender&quot;&gt;Martin Ender&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Peter Taylor&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As I commented at the time, my first thought when I saw the program was that it must be buggy because it would clearly produce an error. It was only after I added debugging that I realised that the error was being deliberately exploited to break the loop early.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/83389/12012&quot;&gt;Write a program to elasticize strings&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/34388/adnan&quot;&gt;Adnan&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Dennis&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this answer, Adnan used the &lt;code&gt;P&lt;/code&gt; atom to perform string multiplication. This is not supposed to be possible; the &lt;code&gt;×&lt;/code&gt; atom is intended to multiply numbers, and &lt;code&gt;P&lt;/code&gt; (which just reduces by &lt;code&gt;×&lt;/code&gt;) is intended to do the same. In doing so, they managed to create a type Jelly is not even supposed to have; Python's &lt;code&gt;str&lt;/code&gt; is intended solely for characters, and Jelly's strings are merely (Python) lists of characters. While that may cause all sorts of problems, it manages to solve the task at hand in merely three bytes, giving the answer the needed edge to win over two other four-byte answers. It also inspired the Jelly tip &lt;a href=&quot;https://codegolf.stackexchange.com/a/96804/12012&quot;&gt;Abuse string bugs&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2017-01-16T03:18:34.353" CommentCount="4" CommunityOwnedDate="2017-01-08T17:10:28.780" ContentLicense="CC BY-SA 3.0" />
  <row Id="11197" PostTypeId="1" CreationDate="2017-01-08T18:41:31.280" Score="18" ViewCount="881" Body="&lt;p&gt;One of the more recent &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8047/8478&quot;&gt;things to avoid&lt;/a&gt; that's coming up a lot is the use of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10002/8478&quot;&gt;non-observable requirements&lt;/a&gt;. The most common incarnations of this are things like &quot;no hardcoding&quot;, &quot;implement this algorithm&quot; or &quot;don't use integer types&quot;. I find that these are sufficiently problematic that we should think about disallowing them outright, and close corresponding challenges as &quot;unclear what you're asking&quot;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main problem with these is that they depend on properties of the program that are highly subjective. Just how much do I need to calculate in order for a result not to be hardcoded? If I need to implement a given algorithm, can I swap two independent operations? How many other deviations are allowed? What does &quot;implement this algorithm&quot; even mean in non-imperative languages? And so on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, should we disallow these? If so, what makes a requirement observable (valid) or non-observable (invalid) and what should we do about the exception proposed by feersum in the linked answer (the exception being bans on built-ins that solve the challenge)?&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2017-01-11T00:31:09.063" Title="Should we disallow non-observable requirements?" Tags="|discussion|policy|challenge-quality|close-reasons|" AnswerCount="3" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11198" PostTypeId="2" ParentId="11197" CreationDate="2017-01-08T18:41:31.280" Score="3" Body="&lt;h2&gt;Yes, challenges with non-observable requirements should be closed&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I would consider a requirement observable if it's fulfilment can be (in theory) be determined &lt;em&gt;by a program&lt;/em&gt; by looking at some or all of the following information:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The source code of the program.&lt;/li&gt;&#xA;&lt;li&gt;The output of the program.&lt;/li&gt;&#xA;&lt;li&gt;The runtime of the program (or the timing of several outputs of the program).&lt;/li&gt;&#xA;&lt;li&gt;The memory usage of the program.&lt;/li&gt;&#xA;&lt;li&gt;Interaction of the program with various external systems like the file system, other process it's communicating with or various hardware.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Note in particular, that it must be possible for a program to determine a submission's validity &lt;em&gt;in any language that can be used on that challenge&lt;/em&gt;. This makes requirements like &quot;does not use loops&quot; non-observable because the concept of loops might not be well-defined in all languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not making any statement about the exception of banning built-ins in this answer, because I'm not 100% sure about them yet. I'd rather find a way to specify the ban in an objectively observable  than make an exception.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2017-01-08T18:41:31.280" CommentCount="16" ContentLicense="CC BY-SA 3.0" />
  <row Id="11199" PostTypeId="2" ParentId="10974" CreationDate="2017-01-08T20:43:09.013" Score="-1" Body="&lt;p&gt;&lt;em&gt;Given the limited involvement here and mixed voting, I've opted to post another proposal based on 'typed lambda parameters' - hopefully this will be more agreeable because it doesn't increase byte counts as much&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Submission Validity&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Along with being directly callable (examples &lt;strong&gt;G&lt;/strong&gt; and &lt;strong&gt;H&lt;/strong&gt;) or assignable, a submission may be a lambda with explicitly typed input parameters. An example of this would be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(int a, int b) =&amp;gt; a + b;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;While this is neither directly callable nor assignable, and strictly has no type, I believe it is near-enough unambiguous as far as the C# compiler is concerned.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Testing such a submission would involve typing it, however there is only a limited subset of types that it can be assigned to, and crucially the input parameters of the delegate must match exactly, but the return value need only be implicitly convertible. This means that the behaviour of the lambda is well defined up until it returns, at which point it could potentially be cast to a number of things. This example hopefully shows why this is not an ideal policy:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; Func&amp;lt;int, float&amp;gt; q = (int a) =&amp;gt; a;&#xA; bool b = q(int.MaxValue - 9) == q(int.MaxValue) // true&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;However, I would argue that here C# is just wrong, and that the implicit cast from &lt;code&gt;int&lt;/code&gt; to &lt;code&gt;float&lt;/code&gt; should not be allowed, but it is. &lt;em&gt;Note that my complaint here is not to do with allowing assignment to use implicit casts, but that ints in C# are allowed to be implicitly casted to floats, without even a warning. &lt;code&gt;double&lt;/code&gt; would be fine, because it round trips to &lt;code&gt;int&lt;/code&gt; without changing (I believe)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To make the rules absolutely clear, we defer the decision of the return type to the C# compiler. This can always be determined by assigning the return value to a &lt;code&gt;var&lt;/code&gt; local, and then interrogating this type. For example, the following would be a valid submission:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(int a, float b) =&amp;gt; a * b;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which we can rewrite as:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(int a, float b) =&amp;gt; { var l = a * b; return l; };&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Determining the type of l (it's a &lt;code&gt;float&lt;/code&gt;) tells us that we must consider this to be cast or assigned to something returning a &lt;code&gt;float&lt;/code&gt;, for example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Func&amp;lt;int, float, float&amp;gt; w = (int a, float b) =&amp;gt; a * b;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This means that if the submission (for whatever reason) requires a cast then it must specify it in the return clause. To take a stupid example, if the challenge was &quot;turn a .NET System.Int32 into a .NET System.Float32&quot;, then &lt;code&gt;(int a) =&amp;gt; a&lt;/code&gt; would not be valid, because the rules require we type it as returning an Int32. It would have to be &lt;code&gt;(int a) =&amp;gt; (float)a&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;I'll attach the usual disclaimer that I'm not just trying to make C# less competitive, I'm trying to make it genuinely competitive by providing rules for the competition. Again, if you disagree, please down vote (rep doesn't matter on meta), comment, and provide another answer if you think you have a better idea!&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example I:&lt;/strong&gt; 'Typed Lambda'&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(int a) =&amp;gt; a + a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This proposal would consider anything of this form a valid submission. All input arguments must be explicit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example J:&lt;/strong&gt; Example 'valid' test code for &lt;strong&gt;I&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Func&amp;lt;int, int&amp;gt; q = (int a) =&amp;gt; a + a;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Enforcement&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I would suggest that people should not upvote new invalid answers (however we define them), and leave comments to inform them of their dubious validity (and perhaps downvotes for people that should know better). I don't have a suggestion for how to deal with the abundance of answer that would be invalidated by such a ruling but to except them, though this will leave examples of 'bad practice' for new users to follow.&lt;/p&gt;&#xA;" OwnerUserId="26981" LastEditorUserId="26981" LastEditDate="2017-01-08T21:08:59.870" LastActivityDate="2017-01-08T21:08:59.870" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11200" PostTypeId="2" ParentId="2140" CreationDate="2017-01-08T20:55:20.643" Score="1" Body="&lt;h1&gt;Function Token Validator&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an arbitrary non-empty string as input, if it is one of the following tokens, output a truthy value, else output a falsy value:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-&#xA;abs&#xA;acos&#xA;acosh&#xA;acot&#xA;acoth&#xA;acsc&#xA;acsch&#xA;angle&#xA;arccos&#xA;arccosh&#xA;arccot&#xA;arccoth&#xA;arccsc&#xA;arccsch&#xA;arcos&#xA;arcosh&#xA;arcot&#xA;arcoth&#xA;arcsc&#xA;arcsch&#xA;arcsec&#xA;arcsech&#xA;arcsin&#xA;arcsinh&#xA;arctan&#xA;arctanh&#xA;arg&#xA;arsec&#xA;arsech&#xA;arsin&#xA;arsinh&#xA;artan&#xA;artanh&#xA;asec&#xA;asech&#xA;asin&#xA;asinh&#xA;atan&#xA;atanh&#xA;cbrt&#xA;ceil&#xA;ceiling&#xA;conj&#xA;conjugate&#xA;cos&#xA;cosh&#xA;cot&#xA;coth&#xA;csc&#xA;csch&#xA;e^&#xA;exp&#xA;exponent&#xA;fact&#xA;factorial&#xA;floor&#xA;fpart&#xA;frac&#xA;gamma&#xA;im&#xA;imag&#xA;int&#xA;ipart&#xA;ln&#xA;log&#xA;mag&#xA;neg&#xA;norm&#xA;normal&#xA;re&#xA;real&#xA;round&#xA;sec&#xA;sech&#xA;sin&#xA;sinh&#xA;sqrt&#xA;tan&#xA;tanh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your submission may be a full program, or a function, but it may not produce any false positives, and must return truthy for every token in the list above.&lt;/p&gt;&#xA;" OwnerUserId="42091" LastActivityDate="2017-01-08T20:55:20.643" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11203" PostTypeId="2" ParentId="2140" CreationDate="2017-01-09T00:24:04.280" Score="-12" Body="&lt;h1&gt;Divisibility by 4&lt;/h1&gt;&#xA;&lt;p&gt;Your job is to write a program that checks divisibility of an integer by 4.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Restrictions:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;You can't use:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;modulo&lt;/li&gt;&#xA;&lt;li&gt;binary shift/rotates&lt;/li&gt;&#xA;&lt;li&gt;Divisions&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You must instead do it like a &lt;strong&gt;HUMAN DOES&lt;/strong&gt; by checking the last 2 digits and output a truthy value when is divisible and a falsey when not.&lt;/p&gt;&#xA;&lt;p&gt;Non-printable characters; golfing-dedicated, whitespace and esoteric languages are forbidden.&lt;/p&gt;&#xA;&lt;p&gt;The winner will be the code that has less characters, where white space doesn't count (tabs, spaces and newlines).&lt;/p&gt;&#xA;" OwnerUserId="29325" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-09T00:24:04.280" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="11205" PostTypeId="2" ParentId="11139" CreationDate="2017-01-09T03:14:04.723" Score="4" Body="&lt;h2&gt;We need a place to discuss site-related matters&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Chat is a useful tool to talk about issues relevant to the site that work better as a back-and-forth real-time conversation that the Q&amp;amp;A format of main and meta.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Asking for more feedback on a Sandbox post&lt;/li&gt;&#xA;&lt;li&gt;Floating opinions about site policy&lt;/li&gt;&#xA;&lt;li&gt;Brainstorming a new type of challenge&lt;/li&gt;&#xA;&lt;li&gt;Discussing potential improvements to a golf&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think have a place to talk about site matters is important for PPCG to thrive. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The Nineteenth Byte as is does not meet these needs.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Multiple times I brought up some site-related matter in chat, it was completely ignored. Nobody responded, and with some other high-volume off-topic discussion going on, it quickly got scrolled within minutes. As a single line among eye-catching pictures and formatting, it was quickly missed and forgotten.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, I don't expect every message to necessarily warrant a response. Yet, I think some people would have responded had they simply seen it. But, finding site-relevant messages can feel like looking for a needle in a haystack to someone looking through the transcript. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm talking here about messages addressed to the general community or anyone interested, one where there's no ping to notify you. Or, conversations that where people join and leave that can't just followed via a back-and-forth chain of replies.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't think my experience is singular. Ismael Miguel &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11139/lets-talk-about-chat-again#comment36747_11160&quot;&gt;puts it well&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Also, one problem that I see sometimes is that users simply ignore&#xA;  on-topic content. I've been on that chat a few times, and was&#xA;  completelly ignored to oblivion most of them, with (I believe)&#xA;  on-topic content. The few times, one was to complain about the penguim&#xA;  and others were to talk about an abandoned project, where I tried to&#xA;  improve the leaderboard. The project is abandoned by me due to&#xA;  complete lack of interest by most people on the chat.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I wonder how often this happens, because the very nature of the problem is that you don't see it. Add to that the users who simply choose not to speak up because they've already given up chat as a way to have on-topic conversations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've been given the advice to wait for a lull in the conversation to post, but found that unsatisfactory. Sometimes, the lull never seems to come. I wait and wait and messages just keep going. I don't want to keep having to re-opening the tab to look for a time to get a word it. And one time I did wait for a high-volume conversation to end, a new fast-moving conversation started right after, and my messages was still ignored.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem is that noisy, high-volume conversation drowns out everything else. On-topic discussions tend to be longer and more deliberative. They have trouble sustaining themselves in a fast-moving distracting environment. But, low-effort noisy messages thrive in the environment they create.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;So what do we do?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, we need some form of chat discuss site-related matters, and TNB currently isn't cutting in. Some options that come to mind are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Aggressively curb noise and message volume&lt;/li&gt;&#xA;&lt;li&gt;Strictly enforce that off-topic conversation must give way to on-topic ones&lt;/li&gt;&#xA;&lt;li&gt;Limit TNB to on-topic conversations&lt;/li&gt;&#xA;&lt;li&gt;Make a new room that only allows on-topic conversations&lt;/li&gt;&#xA;&lt;li&gt;Find another way to for those looking for on-topic discussion in TNB to find it&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2017-01-09T03:35:49.413" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11208" PostTypeId="2" ParentId="2140" CreationDate="2017-01-09T14:56:54.760" Score="2" Body="&lt;h1&gt;broken keyboard workaround&lt;/h1&gt;&#xA;&lt;p&gt;|nspired by &lt;a href=&quot;https://www.youtube.com/watch?v=jEXcSzPH73s&quot; rel=&quot;nofollow noreferrer&quot;&gt;BASTA´s song&lt;/a&gt; and memories from earlier work:&lt;/p&gt;&#xA;&lt;p&gt;Your keyboard is broken but there is some urgent work you have to complete; you have no back^up hardware - and the shops are closed so you can´t buy a new keyboard!&lt;/p&gt;&#xA;&lt;p&gt;All you have left to work with is your mouse.&lt;/p&gt;&#xA;&lt;p&gt;6iven two texts as input (the one you have and the one you want to have), create a program or function that tells you the cut, copy&amp;amp;paste actions that will turn the one text into the other.&lt;/p&gt;&#xA;&lt;p&gt;Using the mouse is strenuous, so you don´t want too many cut/copy/paste actions. Keep your output as short as possible.&lt;/p&gt;&#xA;&lt;p&gt;Remember: Your keyboard is broken = you can´t use any characters in your code that you don't have ~ you must get alon9 with those that are provided in th1s {[&amp;quot;te%t&amp;quot;]}. For7unately your keyboard 7ook qu17e a wh1le 7o bre4k down c0mpletely 4nd y0u used numb3rs 4nd sp3c*4l ch@r$ t0 r3pl@c3 br0k3n l3773r$; $0 y0u $h0uld h@v3 m0$7 0f 7h3m @v@*l@bl3.&lt;/p&gt;&#xA;&lt;p&gt;Also, you don´t want to do too much C&amp;amp;P to cre8 your code, so keep that as short as possible, too.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can assume that the second text contains no characters that are not present in the first text.&lt;/li&gt;&#xA;&lt;li&gt;You can pick any input format and method that is convenient for you; but the output format should match that. (e.g. if you take input from files, output should also go to a file).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;NOTES&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Note that the challenge description contains all letters and digits except &lt;code&gt;j&lt;/code&gt; and &lt;code&gt;z&lt;/code&gt;. If you absolutely need them: they are hidden in the YouTube link. (I didn´t check for upper/lower case though.)&lt;/p&gt;&#xA;&lt;p&gt;Curlys, brackets, braces, single and double quotes and all operators I could think of are there, so the challenge should be fine for most languages that use printable ASCII.&lt;/p&gt;&#xA;&lt;p&gt;Still trying to find a more fluent way to include curlys, brackets, double quotes and circumflex, though.&lt;/p&gt;&#xA;&lt;p&gt;I thought there was a tag [string-manipulation]; but couldn´t find it in the list.&lt;/p&gt;&#xA;&lt;p&gt;I think about dropping the &amp;quot;output method should match input method&amp;quot; restriction.&lt;/p&gt;&#xA;" OwnerUserId="55735" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-09T17:48:04.407" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11209" PostTypeId="2" ParentId="11197" CreationDate="2017-01-09T16:16:55.497" Score="7" Body="&lt;h1&gt;This is a bad idea.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I like the sentiment of challenges being completely observable.  &lt;strong&gt;I think that we should aim for questions to be as close to observable as possible&lt;/strong&gt;, but I don't think it would be good for this site to require complete observability.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As it stands, &lt;strong&gt;there are lots of challenges that would become trivial/impossible if we disallowed non-observable requirements&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;em&gt;No built-ins&lt;/em&gt;.  I think this is obvious how this makes things trivial in some languages.  If a builtin is shorter than any possible algorithm, then submissions in that language have no choice but to submit that built-in (to stay competitive).&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;No hard-coding&lt;/em&gt;.  While this is a problematic statement in certain scenarios, &lt;strong&gt;we need it to keep some fastest-code challenges non-trivial&lt;/strong&gt;.  Primes become a lot easier to generate if you have the first 10K of them in your source code.  Some sequences become exponentially harder to calculate the higher you go, which means that it &lt;em&gt;is&lt;/em&gt; feasible to hard-code all answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following challenges (as well as others) would all become off-topic:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/51266/extending-oeis-counting-diamond-tilings&quot;&gt;Extending OEIS: Counting Diamond Tilings&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/84592/compute-the-maximum-number-of-runs-possible-for-as-large-a-string-as-possible&quot;&gt;Compute the maximum number of runs possible for as large a string as possible&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/53018/sum-of-smallest-prime-factors&quot;&gt;Sum of smallest prime factors&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;No retaining state&lt;/em&gt; and &lt;em&gt;No reflection/modifying other submissions&lt;/em&gt;.  Both of these are &lt;em&gt;essential&lt;/em&gt; for running all of my KoTHs.  I don't want people storing static variables to remember data from game to game, and I don't want reflection to cheat at the game.  &lt;strong&gt;This would close nearly every KoTH challenge&lt;/strong&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Submissions must be competitive&lt;/em&gt;.  There is a requirement we place on every challenge by default and is non-observable.  Mego brought up in chat that the more specific meta ruling wins, so this wouldn't actually close any questions, but this would make for two rules that conflict with each other.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Asymptotic complexity restrictions&lt;/em&gt;.  This includes &lt;em&gt;all&lt;/em&gt; questions from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt; and other challenges where we put a complexity requirement to prevent brute-forcing.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;&quot;You cannot use multiple version of the same language&quot;&lt;/em&gt;.  This is relevant to answer-chaining or multi-language answers.  A program cannot tell if two languages are multiple version of the same language, so it wouldn't be observable.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Unless we are able to define all of the above non-observable requirements for every language we use on this site, &lt;strong&gt;we're going to kill &lt;em&gt;so&lt;/em&gt; many challenges here.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2017-01-09T19:34:58.450" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11211" PostTypeId="1" CreationDate="2017-01-09T17:12:33.230" Score="11" ViewCount="1470" Body="&lt;p&gt;Take &lt;a href=&quot;https://codegolf.stackexchange.com/q/106182/45941&quot;&gt;this recent challenge&lt;/a&gt; for example. There are many languages where the shortest solution is simply &lt;code&gt;*&lt;/code&gt;. Likewise, for other trivial challenges, the same 1-byte program and/or function works in many different languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we combine these answers into one?&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2017-03-06T19:07:09.193" Title="Should we combine answers where the same code works in many different languages?" Tags="|discussion|policy|answers|" AnswerCount="4" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11212" PostTypeId="2" ParentId="11211" CreationDate="2017-01-09T17:12:33.230" Score="-4" Body="&lt;h1&gt;Yes, we should combine them into a single Community Wiki answer&lt;/h1&gt;&#xA;&lt;p&gt;Having many answers that are essentially identical other than the language name benefits nobody. It makes finding the solutions that actually required work much harder. Plus, having many similar answers in a single CW answer &lt;a href=&quot;https://codegolf.stackexchange.com/a/44370/45941&quot;&gt;has been done before&lt;/a&gt;. It's not that much of a stretch to combine many existing identical answers.&lt;/p&gt;&#xA;&lt;p&gt;Note that I say &amp;quot;many&amp;quot; - 10 or so languages where the exact same code would work is a decent threshold for combining answers.&lt;/p&gt;&#xA;&lt;p&gt;Some people may complain because they won't get the reputation from their answers. To me, this isn't a problem. We encourage voting up solutions that require work, rather than solutions that just use a trivial builtin. How much reputation do you think you are really losing out on here?&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-09T17:31:51.533" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11213" PostTypeId="2" ParentId="11179" CreationDate="2017-01-09T17:14:24.520" Score="2" Body="&lt;p&gt;Choosing to answer a different question to the one that's asked because it's easier falls foul of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1789/194&quot;&gt;this standard loophole&lt;/a&gt;. You don't have to change your question to suit the answers. If you see an answer which doesn't actually meet the spec you should (within the limits of what your rep permits you to do) comment on it, edit the question to include test cases which cover the relevant deviation, downvote the answer, and if the answerer chooses not to fix the answer then flag it as low quality.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I note that no-one seems to have mentioned the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/194&quot;&gt;Sandbox&lt;/a&gt; to you. That's a good way to get people challenging your input format before anyone starts writing answers; 20 edits to a question in the sandbox have a lot less negative impact than 20 edits to a question on the main site.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2017-01-09T17:14:24.520" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11214" PostTypeId="2" ParentId="11211" CreationDate="2017-01-09T17:42:10.047" Score="21" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The &lt;em&gt;only&lt;/em&gt; value of extremely trivial tasks like adding/multiplying a pair of numbers is that the thread serves as a &lt;s&gt;catalog&lt;/s&gt; repository of the shortest solution per language, which should be aided by including a Stack Snippet to easily find the shortest solution in a particular language. At least the current form of Stack Snippet leaderboard cannot cope with more than one language per post, meaning that combining answers in different languages in one post strips the thread from its only redeeming value.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, we always emphasize the importance of per-language competition. What does or does not happen in languages Y and Z shouldn't affect a post in language X.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, this is inconsistent with our recently reached consensus regarding &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10812/12012&quot;&gt;duplicate answers&lt;/a&gt;. As it is, we'd even allow multiple answers with identical code &lt;em&gt;in the same language&lt;/em&gt;.&lt;sup&gt;1 2&lt;/sup&gt; Disallowing identical answers &lt;em&gt;in different languages&lt;/em&gt; is incompatible with that consensus, and we don't need yet another pair of policies that contradict each other.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; &lt;sub&gt;I'm not perfectly happy with that consensus, but it is what it is.&lt;/sub&gt;&lt;br&gt;&#xA;&lt;sup&gt;2&lt;/sup&gt; &lt;sub&gt;Even if allowed, all but the first answer would probably be downvoted.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2017-03-06T19:07:09.193" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11215" PostTypeId="2" ParentId="2140" CreationDate="2017-01-09T19:22:01.103" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sliding Puzzle - King of the Hill&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Introducing &lt;a href=&quot;https://en.wikipedia.org/wiki/Sliding_puzzle&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sliding Puzzle&lt;/a&gt; - King of the Hill Challenge&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;How to&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Clone the project from &lt;a href=&quot;https://github.com/MathiasMatysiak/SlidingPuzzle&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Compile this project and add the .dll to your Project&lt;/li&gt;&#xA;&lt;li&gt;Create a class which extends &lt;code&gt;BasePlayer&lt;/code&gt; &lt;/li&gt;&#xA;&lt;li&gt;Implemement all the Methods (See: ExampleCode)&lt;/li&gt;&#xA;&lt;li&gt;Post your code =)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Restrictions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You are not allowed to have a constructor for your BasePlayer and any Initialisation should be done in &lt;code&gt;Initialize()&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;You are only allowed to use the visible API in the .dll&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;API&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;BasePlayer&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;void Initialize()&lt;/code&gt; is called before the Game stats and allows you to set up your code&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Tile CurrentTile&lt;/code&gt; gives you access to the Tile you are moving&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;EDirection DoMove()&lt;/code&gt; here you return the direction you want to move&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;ReadOnlyCollection&amp;lt;EDirection&amp;gt; ValidMoves&lt;/code&gt; returns a List of Valid moves you can do &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Field Field&lt;/code&gt; gives you access to the puzzle&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Field&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;bool IsPositionInBoundries(...)&lt;/code&gt; returns whether the parameters are within the boundries of the Field &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Tile GetTileAtPosition(...)&lt;/code&gt; returns Tile at given Position. Returns null &#xA;when errors occur&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Tile&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Point TargetPosition&lt;/code&gt; gives you the Position this Tile has to be to win&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Point CurrentPosition&lt;/code&gt; gives you the Position this Tile is currently Location&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Point&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Point represents a Location within the game, having an X and Y Coordinate. Contains operator overloads ( + and - ) eg. &lt;code&gt;var deltaPosition = tile.CurrentPosition - tile.TargetPosition&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;EDirection&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Enum which represents the direction, &lt;code&gt;Point GetOffset()&lt;/code&gt; can be called to get the Offset as Point&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example Code&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;public class RandomPlayer : BasePlayer&#xA;    {&#xA;        static void Main(string[] args)&#xA;        {&#xA;            var player = new RandomPlayer();&#xA;            var field = Field.PlayMatch&amp;lt;RandomPlayer&amp;gt;();&#xA;            Debug.WriteLine(field.MatchResult); &#xA;        }&#xA;&#xA;        public Random Random;&#xA;&#xA;        public override EDirection DoMove()&#xA;        {&#xA;            var randomIndex = (int)(Random.NextDouble() * ValidMoves.Count()); &#xA;            var direction = ValidMoves[randomIndex];&#xA;            return direction; &#xA;        }&#xA;&#xA;        public override void Initialize()&#xA;        {&#xA;            Random = new Random(); &#xA;        }&#xA;    }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Players are scored by average turns needed to solve a puzzle! Good Luck!&lt;/p&gt;&#xA;" OwnerUserId="63942" LastEditorUserId="63942" LastEditDate="2017-01-09T19:43:22.380" LastActivityDate="2017-01-09T19:43:22.380" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11217" PostTypeId="2" ParentId="2140" CreationDate="2017-01-09T19:48:31.123" Score="1" Body="&lt;h1&gt;Nibbles Nostalgia&lt;/h1&gt;&#xA;&lt;p&gt;People from my generation certainly know what is the Nibbles game! If you are not here included, what I am asking is a one-line version the level 1 of &lt;a href=&quot;https://www.youtube.com/watch?v=UmeKHtei0qo&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.youtube.com/watch?v=UmeKHtei0qo&lt;/a&gt; (time: 14s—54s)&lt;/p&gt;&#xA;&lt;p&gt;The challenge is to write a game that is a one line, one level Nibbles game using only the line buffer.&lt;/p&gt;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must output to one or both of stderr/stdout&lt;/li&gt;&#xA;&lt;li&gt;Line Width is 80 chars&lt;/li&gt;&#xA;&lt;li&gt;Snake will always begin at the middle with 2 chars in width&lt;/li&gt;&#xA;&lt;li&gt;For a user to loose, the head of the Snake must hit one of the ends&lt;/li&gt;&#xA;&lt;li&gt;Each time a number {1...9} is catched the snake grows using the formula new_witdh= current_width + 2 * catched_number&lt;/li&gt;&#xA;&lt;li&gt;Of course numbers appear in an random position of the white space, never in Snake's body&lt;/li&gt;&#xA;&lt;li&gt;The char for each snake block body is ASCII \219 █&lt;/li&gt;&#xA;&lt;li&gt;It only accepts two keys, the Arrows for Left and Right. Does nothing when in the same sense; inverts head and tail when inverse&lt;/li&gt;&#xA;&lt;li&gt;First move is always to right&lt;/li&gt;&#xA;&lt;li&gt;It must be available somewhere online for me to play&lt;/li&gt;&#xA;&lt;li&gt;Timing between each turn of snake movement is 200 ms (This will be adjusted to make it more realistic)&lt;/li&gt;&#xA;&lt;li&gt;If user looses, you will output in the same line a full line of ASCII \127 char ⌂ and quit.&lt;/li&gt;&#xA;&lt;li&gt;If user wins, you will output in the same line a full line of ASCII \2 char ☻ and quit&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;It is a [code-golf] challenge, where there will be no accepted answer; I just made the challenge for my own fun!&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;UPDATE:&lt;/strong&gt; I made a nice discovery: The original game is playable on &lt;a href=&quot;http://stevehanov.ca/blog/index.php?id=92&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://stevehanov.ca/blog/index.php?id=92&lt;/a&gt;, by mouse clicking on &lt;code&gt;Compile and Run&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="29325" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-22T22:56:48.010" CommentCount="21" ContentLicense="CC BY-SA 3.0" />
  <row Id="11218" PostTypeId="2" ParentId="11211" CreationDate="2017-01-09T21:57:45.750" Score="28" Body="&lt;h2&gt;Combine equivalent trivial answers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I think the idea is right, but needs to specifically target the problem case of built-in-does-it answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Trivial challenges invite many trivial answers that are just a built-in. There is an overwhelming temptation to get loads of rep and attention with an answer that takes little time or skill. Some users race to post the trivial answer in multiple languages within minutes before others even see the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All this gets the trivial question on top of the &lt;a href=&quot;http://stackexchange.com/questions&quot;&gt;Hot Network Question&lt;/a&gt; page where a horde of &lt;a href=&quot;http://stackexchange.com/questions&quot;&gt;alleged non-sentient&lt;/a&gt; voters upvote the trivial question and answers. Some people (including me) &lt;a href=&quot;https://meta.stackexchange.com/a/286015/275609&quot;&gt;think that this is the biggest quality problem&lt;/a&gt; with our site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Combining trivial just-a-built-in answers into a single CW answer is the best solution I've heard to this problem.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It removes the perverse incentive to rush out trivial answers by denying such answerers rep for it, while maintaining a comprehensive list of golfed answers.   &lt;/li&gt;&#xA;&lt;li&gt;It stops trivial challenges from getting onto HNQ just for being easy, and so from giving SE the impression we're about cheap, trivial challenges.&lt;/li&gt;&#xA;&lt;li&gt;It declutters the answer page so that answers that took real work don't get lost in the crowd.&lt;/li&gt;&#xA;&lt;li&gt;It gives a compact list of &quot;languages that have the built-in&quot; all in one place.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This should only target answers that are trivial in that a single language feature basically solves the problem. These are usually one-byte answer or just a built-in, perhaps with some boilerplate for I/O.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It should not apply to answers that turned out identical only because of convergent evolution in golfing. Or, to not-trivial answers that happen to be polyglots because more than one language supports its component operations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Another option would be to have this apply only for challenges that get on HNQ, but I'm not sure how practical that would be to track and enforce.)&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2017-01-09T21:57:45.750" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11219" PostTypeId="2" ParentId="11153" CreationDate="2017-01-09T23:50:10.093" Score="3" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;This is a relatively reasonable way of returning an answer, the way I see it, it is not substantially different from returning a one element (of which the first element must be accessed through a method call). Essentially you are returning the data, in a clear way, which is accessable. (Feel free to edit in additional reasons).&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-09T23:50:10.093" CommentCount="0" CommunityOwnedDate="2017-01-09T23:50:10.093" ContentLicense="CC BY-SA 3.0" />
  <row Id="11223" PostTypeId="1" CreationDate="2017-01-10T20:05:46.177" Score="20" ViewCount="933" Body="&lt;p&gt;I'll be using Java in this post, but the following also applies to C#, and likely other languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We require that submissions must be a first-class function, or a full program to be valid.  In Java, many users have started using &lt;em&gt;untyped&lt;/em&gt; lambdas as their submission.  &lt;strong&gt;The problem with untyped lambdas is that they have no meaning&lt;/strong&gt; without their types.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, given a theoretical challenge of &lt;code&gt;Add Two Numbers&lt;/code&gt;, in Java, a submission would look like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(a,b) -&amp;gt; a + b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which seems relatively reasonable.  However, the problem lies with the following solution:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(a,b) -&amp;gt; a.add(b)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The problem with the above statement &lt;strong&gt;is that we have &lt;em&gt;absolutely no idea&lt;/em&gt; which function is getting called&lt;/strong&gt;.  The only way the above statement could &lt;em&gt;ever&lt;/em&gt; work in code is if we say in the description that &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; are &lt;code&gt;BigInteger&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To extend this problem further, lets say I'm answering a sorting challenge.  You could submit:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;list -&amp;gt; list.sortThis()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now wait, &lt;code&gt;sortThis()&lt;/code&gt; isn't a function on arrays, or on ArrayList, or anywhere in the JDK.  I'd have you tell you that &lt;code&gt;list&lt;/code&gt; is a &lt;code&gt;MutableList&lt;/code&gt; from Eclipse Collections for you to ever use the code.  Furthermore, if I &lt;em&gt;did&lt;/em&gt; use that code, you don't need to import a MutableList.  Java is able to deduce the types, no import needed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We require the submissions be self-contained, but right now, &lt;strong&gt;these lambdas are not self-contained, because they require outside input to indicate the types&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How do we solve this problem?&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="69850" LastEditDate="2018-07-28T04:31:52.033" LastActivityDate="2018-07-28T04:31:52.033" Title="Untyped functions in static languages" Tags="|discussion|" AnswerCount="4" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="11224" PostTypeId="2" ParentId="11223" CreationDate="2017-01-10T20:05:46.177" Score="-3" Body="&lt;h1&gt;Require types to be added if a method/function/operator cannot be deduced&lt;/h1&gt;&#xA;&lt;p&gt;This answer only applies to languages with &lt;a href=&quot;https://en.wikipedia.org/wiki/Manifest_typing&quot; rel=&quot;nofollow noreferrer&quot;&gt;manifest typing&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Java and C# both have the ability to define types in the definition:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(int a, int b) =&amp;gt; a + b   // C#&#xA;(int a, int b) -&amp;gt; a + b   // Java&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This gets immensely useful when dealing with objects:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(BigInteger a, BigInteger b) -&amp;gt; a.add(b)&#xA;(MutableList a) -&amp;gt; a.sortThis()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Furthermore, because the above two examples only involve a single function, you can shorten them to:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;BigInteger::add    &#xA;MutableList::sortThis&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Another acceptable format would be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Function&amp;lt;MutableList, MutableList&amp;gt; f = a -&amp;gt; a.sortThis()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Even though the lambda itself does not contain the type, the method &lt;code&gt;sortThis()&lt;/code&gt; can still be deduced.&lt;/p&gt;&#xA;&lt;p&gt;In all of these examples, imports would still be required because the types &lt;code&gt;BigInteger&lt;/code&gt; or &lt;code&gt;MutableList&lt;/code&gt; are explicitly listed.  The key here is that &lt;strong&gt;the submissions are &lt;em&gt;self-contained&lt;/em&gt;; They contain all of the type information you need to run.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-10T21:31:06.853" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="11225" PostTypeId="1" CreationDate="2017-01-10T20:53:24.923" Score="-26" ViewCount="448" Body="&lt;p&gt;Why have I received a 7 day chat suspension? I do not recall doing anything harmful or bad for the chatroom, except maybe posting faces, but I don't see how that warrants a 7 day ban.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;EDIT&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;I don't make the best decisions late at night.&lt;/h2&gt;&#xA;" OwnerUserId="53551" LastEditorUserId="53551" LastEditDate="2017-01-11T03:22:38.360" LastActivityDate="2017-01-11T06:15:55.340" Title="7 day chat suspension" Tags="|support|chat|" AnswerCount="2" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="11226" PostTypeId="2" ParentId="11223" CreationDate="2017-01-10T21:01:13.460" Score="-1" Body="&lt;h1&gt;Types should be included but not in the bytecount&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The main argument is that a person wishing to use the lambda may not know the datatype just by looking at the function since it's implicitly set within the context of the lambda. This is a good argument for requiring that the datatype be specified in the answer... but this is code golf, people; if bytes aren't needed for a line of code to be valid, they're going to be omitted. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It seems like until recently people have been content with the untyped lambdas. This is likely because on PPCG there's almost always a rule where you can assume input is valid. Part of valid input includes the datatype in this example. The part that makes Java or C# different from Python or Javascript is that Java and C# are strongly typed. If you don't have the correct datatype, the code won't compile let alone run. In Python or Javascript you can call a function with any datatype you want... but it will likely error if you use one that's unintended.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider a javascript object &lt;code&gt;a = {key: 'value'}&lt;/code&gt;. Suppose I expect this format for parameters to my function. In classic javascript fashion I'm able to invoke &lt;code&gt;console.log(a.key);&lt;/code&gt; If my program relies on that functionality then it's going to error if you pass in &lt;code&gt;1&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; 1.key&#xA;Uncaught SyntaxError: Invalid or unexpected token&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I would need to specify in my answer that input is expected to be in a certain format or datatype but that wouldn't affect my bytecount.&lt;/p&gt;&#xA;" OwnerUserId="51785" LastActivityDate="2017-01-10T21:01:13.460" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11227" PostTypeId="2" ParentId="11225" CreationDate="2017-01-10T21:41:27.467" Score="9" Body="&lt;p&gt;You received a 7-day suspension because one of the mods saw your behavior and thought it was rude/inappropriate for respectful discourse. I say &lt;em&gt;one of the mods&lt;/em&gt;, because us regular users don't know which one it was, and that is definitely a &lt;strong&gt;good thing.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;IIRC, being suspended multiple times automatically increases the length of the suspension, which is why it was for 7 days.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The primary directive for good behavior for &lt;em&gt;all&lt;/em&gt; of stack-exchange, including chat is &lt;a href=&quot;https://codegolf.stackexchange.com/help/be-nice&quot;&gt;Be Nice&lt;/a&gt;. To quote some relevant sections...&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;&lt;em&gt;Rudeness and belittling language are not okay&lt;/em&gt;. Your tone should match the way you'd talk in person with someone you respect and whom you want to respect you. If you don't have time to say something politely, just leave it for someone who does.&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;  &#xA;  &lt;p&gt;...&lt;/p&gt;&#xA;  &#xA;  &lt;ol start=&quot;3&quot;&gt;&#xA;  &lt;li&gt;&lt;p&gt;Don't be a jerk. These are just a few examples. If you see them, flag them:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Bigotry of any kind. Language likely to offend or alienate individuals or groups based on &lt;strong&gt;&lt;em&gt;race&lt;/em&gt;, gender, sexual orientation, religion, etc.&lt;/strong&gt; will not be tolerated. At all. (Those are just a few examples; &lt;strong&gt;when in doubt, just don't.&lt;/strong&gt;)&lt;/li&gt;&#xA;  &lt;/ul&gt;&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Calling someone a Nazi is certainly something I wouldn't do when talking with someone in the real world. And calling someone &quot;Crazy Germans&quot; is definitely &lt;em&gt;&quot;Language likely to offend or alienate individuals or groups based on race&lt;/em&gt;&quot;. Especially when you consider that quite a few of the PPCG mods are &lt;em&gt;actually from Germany&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even if you hadn't made a reference to Nazis, I would still consider calling the mods &quot;mean people&quot; for doing exactly what they're supposed to do rude.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are &lt;em&gt;many&lt;/em&gt; times I have seen a mod enforce a rule that I disagree with, or take a certain action I disagree with. I've even told that to mods to their faces before. However, I still greatly respect them for all their hard-work and maturity, and I appreciate that they're around to enforce &lt;em&gt;all&lt;/em&gt; of the rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You need to realize that mods aren't arbitrarily making decisions in the moment based on their feelings, or guesses. They are enforcing &lt;em&gt;network-wide rules&lt;/em&gt; that many people have spent time refining and clarifying. Whether or not you agree with these rules (or even if the mods agree with these rules) is irrelevant. If you use this site, you agree to abide by it's rules, and sometimes you'll have to pay the price for breaking them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the meantime, don't worry about it too much. We all make mistakes. In seven days, the suspension will be lifted and you can continue using chat like everyone else. After that, I would recommend being more careful about your choice of words.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;As a side note, if there were no moderators around when you posted that message, you would probably still have received a suspension because I would have flagged your message if I was around to see it, and I can almost guarantee it would have been validated.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2017-01-11T06:15:55.340" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11228" PostTypeId="2" ParentId="11197" CreationDate="2017-01-11T00:31:09.063" Score="14" Body="&lt;h2&gt;Only for code golf&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I think disallowing non-observable requirements is good, but should be limited to pure code golf (without &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt; for instance). As &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11209/20260&quot;&gt;Nathan Merrill points out&lt;/a&gt;, many well-accepted challenge of other genres rely on unobservable requirements, and they shouldn't be accidental casualties of this rule.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This leaves requiring &quot;no built-ins&quot; as a point of contention. I'd be fine with either banning them or not. Or perhaps banning built-ins will be moot if we go with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11218/20260&quot;&gt;combining built-in-only answers&lt;/a&gt;? I'd like to hear people's thoughts on this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(&quot;Submissions must be competitive&quot; could be seen as a non-observable requirement for code golf, but I think it's rather a meta policy covered elsewhere.)&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2017-01-11T00:31:09.063" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="11229" PostTypeId="2" ParentId="11225" CreationDate="2017-01-11T03:07:11.243" Score="17" Body="&lt;h3&gt;Regarding that message&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You must have no idea what the Nazis were/are or what they have done if you think calling someone a Nazi for deleting chat messages or handing out 30-minute suspensions is even remotely acceptable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Other parts of the internet may tolerate these insults, but this is not one of those parts. Stack Exchange's prime directive is to &lt;a href=&quot;https://codegolf.stackexchange.com/help/be-nice&quot;&gt;Be Nice&lt;/a&gt;, and there's nothing nice about comparing us moderators with genocidal mass murderers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You didn't just say &lt;em&gt;Nazis&lt;/em&gt;, you used the euphemism &lt;em&gt;crazy 1940s germans&lt;/em&gt;. That makes it &lt;em&gt;worse&lt;/em&gt;. Much worse. As usual with dictatorships, many/most Germans didn't actually agree with what the government was doing and definitely weren't Nazis. Saying otherwise falls somewhere between stereotypes and hate speech.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Just because you strikethrough parts of your message doesn't mean you didn't write it; you just wrote it with a horizontal line through its center. If you don't mean it, don't write it. That simple.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Regarding your suspension&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;We usually prefer not to discuss details of a suspension in public, so I won't reveal any details that aren't already common knowledge.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;This isn't the first time a message of yours was flag-deleted. In fact, this isn't the first time you asked here on meta why you were suspended.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This isn't the first time you were suspended &lt;em&gt;that day&lt;/em&gt;. One of your previous messages got flag-deleted for being pure noise, and your reaction to that 30-minute timeout was calling the moderators Nazis.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You've been asked multiple times to post less nonsense in chat. You've ignored it every time.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2017-01-11T04:55:04.460" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11230" PostTypeId="2" ParentId="11144" CreationDate="2017-01-11T08:24:59.310" Score="4" Body="&lt;h1&gt;Create a page for ways for experienced users to improve the site&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The review queue, the deletions page, keeping the chat sane (?), welcoming new users to the site, looking through the Sandbox, pointing people to the standard loopholes, asking clarifying questions of new question writers (in a non-confrontational way).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These are all ways that experienced members of the site can help make the site better. We should maintain a meta post full of such things, and point people to it every now and again.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2017-01-11T08:24:59.310" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11231" PostTypeId="1" AcceptedAnswerId="11232" CreationDate="2017-01-11T11:44:42.280" Score="5" ViewCount="174" Body="&lt;p&gt;Some times ago, I posted a question that is now -3. I got some good answers that helped me (and I accepted one of them), but the -3 score hints that the question is not good.&lt;br&gt; Should I delete it?&lt;/p&gt;&#xA;" OwnerUserId="62912" LastActivityDate="2017-01-11T12:04:10.100" Title="Should I delete a downvoted question?" Tags="|discussion|challenges|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11232" PostTypeId="2" ParentId="11231" CreationDate="2017-01-11T12:04:10.100" Score="3" Body="&lt;p&gt;Assuming you're referring to &lt;a href=&quot;https://codegolf.stackexchange.com/q/101750/45941&quot;&gt;this&lt;/a&gt;, you can't delete it. You can only delete your own questions if they don't have answers. This is the way it works across the entire network - the philosophy is, if it wasn't bad enough to delete before getting answers, the best thing to do is live and learn.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2017-01-11T12:04:10.100" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11233" PostTypeId="1" CreationDate="2017-01-11T14:48:54.643" Score="2" ViewCount="199" Body="&lt;p&gt;I think we should gather a list of all languages that are, by default, allowed to to do things differently on challenges that do not explicitly disallow it. Every question I write it seems that someone asks if, &amp;quot;Can I do X instead of Y?&amp;quot;, or if, &amp;quot;Can I have X different from the specified output, my language doesn't support Y?&amp;quot; This is mostly on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; challenges. I was thinking that maybe we should have a table that people can refer back to in defense of their answers in terms of precision, and other arbitrary language limitations. There's obviously many ways to handle this though, post your thoughts as answers.&lt;/p&gt;&#xA;&lt;p&gt;Post suggestions for how to solve this problem below.&lt;/p&gt;&#xA;&lt;h1&gt;Examples of Questions on Formatting (See OP Comment Section)&lt;/h1&gt;&#xA;&lt;p&gt;Trailing spaces / newlines examples:&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/99913/5-favorite-letters&quot;&gt;5 Favorite Letters&lt;/a&gt; ,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/102748/kuznetsovs-sequence&quot;&gt;Kuznetsov&amp;#39;s Sequence&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Precision examples: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/97756/bailey-borwein-plouffe-iterations&quot;&gt;Bailey–Borwein–Plouffe Iterations&lt;/a&gt; , &lt;a href=&quot;https://codegolf.stackexchange.com/questions/106149/compute-the-median&quot;&gt;Compute the Median&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Input formatting examples: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/99749/the-art-of-word-shaping&quot;&gt;The Art of Word Shaping&lt;/a&gt; , &lt;a href=&quot;https://codegolf.stackexchange.com/questions/106387/sort-a-string-sort-of&quot;&gt;Sort a string, sort of&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Indexing (0 vs 1, Mathematica spurred this): &lt;a href=&quot;https://codegolf.stackexchange.com/questions/106260/linear-regression-on-a-string&quot;&gt;Linear Regression on a String&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I've seen a lot more but don't have the time to go through each challenge to see which ones people ask about 1-indexing for mathematica, trailing newlines on jelly, arrays of characters in python, non-floating point arithmetic in languages only supporting integers... Etc... It would help to have a catalog of language limitations on languages that have them. It is a small list, to be honest and would be good reference material.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-13T16:46:39.257" Title="Trailing Newlines, Spaces, Limited Precision and Language Limitations" Tags="|discussion|policy|" AnswerCount="3" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11234" PostTypeId="2" ParentId="11233" CreationDate="2017-01-11T16:54:04.317" Score="-2" Body="&lt;p&gt;&lt;strong&gt;Create a MetaQuestion Thread&lt;/strong&gt; where answers are in the following format, creating a repository of language limitations.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;LANGUAGE NAME&lt;/h1&gt;&#xA;&lt;h1&gt;Language Maximum Allowable Precision&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;[Maximum Precision in Bytes / Largest Numeral Datatype]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Language Whitespace Limitation&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;[Specific Whitespace Limitation]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Language Datatype Limitation&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;[What datatypes do not exist / Default type in place of datatype]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Other Language Limitations&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;[Description of Limitation]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-11T16:54:04.317" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11236" PostTypeId="2" ParentId="2140" CreationDate="2017-01-12T03:31:44.563" Score="0" Body="&lt;h2&gt;Source code standard deviation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program should accept as input a string, convert it to a unsigned byte array using UTF-8 encoding and output the standard deviation of the &lt;code&gt;n&lt;/code&gt; bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard deviation is given by this formula, where &lt;code&gt;x1&lt;/code&gt;...&lt;code&gt;xn&lt;/code&gt; are the string's bytes:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/dz5Hg.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/dz5Hg.png&quot; alt=&quot;https://upload.wikimedia.org/math/3/1/8/31830fa1f2f922edf6079209a51f8967.png&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input &lt;code&gt;hello&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;UTF-8 encoding returns the list &lt;code&gt;[104,101,108,108,111]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;mean is &lt;code&gt;106.4&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;standard deviation is &lt;code&gt;3.49857113690718&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;More test cases:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;ppcg&lt;/code&gt;: 5.678908345800274&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;aaaaa&lt;/code&gt;: 0&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;azazaz&lt;/code&gt;: 12.5&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;smiley☺&lt;/code&gt;: 41.12432220162674&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your score is the standard deviation of your source code, using the above algorithm, divided by the length of your source in bytes, using UTF-8 encoding. &lt;strong&gt;The higher the better&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the score for the program &lt;code&gt;hello&lt;/code&gt; is: 3.49857113690718 / 5 = 0.699714227381436&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/60901/calculate-standard-deviation&quot;&gt;Calculate Standard Deviation&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="13798" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.533" LastActivityDate="2017-01-12T03:45:18.210" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="11238" PostTypeId="2" ParentId="11233" CreationDate="2017-01-12T14:39:17.047" Score="5" Body="&lt;p&gt;It seems to me that the real solution isn't to add a few hundred lines of site-wide rules about what answers may do; but rather to try to improve questions, in particular by&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Using the sandbox, and encouraging other people to use the sandbox (where &quot;use&quot; means both posting your proposed questions and commenting on other people's questions, and in particular on issues like I/O limitations and unintended language biases);&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Checking the list of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5582/194&quot;&gt;things to consider when writing a challenge&lt;/a&gt;;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Adding answers to that list if there are specific issues (such as the ones mentioned in this question) which frequently trip people up and which aren't already covered;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Being quick to close questions which have genuine ambiguities about things like the range of options for permitted I/O so that they can be cleaned up before they're reopened.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2017-01-12T14:39:17.047" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11239" PostTypeId="1" AcceptedAnswerId="11241" CreationDate="2017-01-12T15:46:25.003" Score="19" ViewCount="674" Body="&lt;p&gt;Recently, three answers gained 500 rep bounties at about the same time, with the following bounty explanation:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;One or more of the answers is exemplary and worthy of an additional bounty.&lt;/p&gt;&#xA;&lt;p&gt;ton ****** is cool and i want to give him internet points&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;These three questions are:&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/73916/generate-lazy-values&quot;&gt;Generate lazy values&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/49093/compute-the-hausdorff-distance&quot;&gt;Compute the Hausdorff Distance&lt;/a&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/73636/repair-the-ranges&quot;&gt;Repair the ranges&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;(The bounties end on the 19th).&lt;/p&gt;&#xA;&lt;p&gt;For reference, a user who had 3593 rep is giving 1500 rep to a user with 8643 rep.&lt;/p&gt;&#xA;&lt;p&gt;My question is: is this considered inappropriate use of a bounty, and if so, what action can be taken against it?&lt;/p&gt;&#xA;&lt;p&gt;I can provide image proof should it becomes necessary after the 19th.&lt;/p&gt;&#xA;" OwnerDisplayName="user42649" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-20T01:30:31.180" Title="Is awarding 1500 reputation to a specific user inappropriate use of bounties?" Tags="|discussion|bounty|" AnswerCount="3" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="11240" PostTypeId="2" ParentId="11239" CreationDate="2017-01-12T16:03:28.217" Score="1" Body="&lt;p&gt;As Dennis mentioned in a comment, &lt;a href=&quot;https://meta.stackexchange.com/q/134477/307833&quot;&gt;a similar discussion&lt;/a&gt; was brought up on Mother Meta. Really, users are free to use bounties as they please, with a few restrictions (this list is not necessarily exhaustive):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Don't engage in rep fraud (using sockpuppet accounts to build up rep and transfer it via bounties to a &quot;main&quot; account, circumventing the rep cap)&lt;/li&gt;&#xA;&lt;li&gt;Don't pass bounties back and forth repeatedly between the same users to abuse the system and keep a question indefinitely featured&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If the user who put up the bounties genuinely thought that answers by another user were worthy of the bounties (which appears to be the case here), there's no issue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, there's always the possibility that the moderators would find signs of abuse via their tools. This is just my opinion, as someone without access to diamond tools.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In fact, depending on the winners of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11186/45941&quot;&gt;Best of 2016 competition&lt;/a&gt;, a single user could end up with a much larger rep influx from those bounties. That's also fine.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-03-20T10:29:45.620" LastActivityDate="2017-01-12T16:23:51.000" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="11241" PostTypeId="2" ParentId="11239" CreationDate="2017-01-12T16:57:34.950" Score="14" Body="&lt;h2&gt;In general: no&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You can only award reputation as bounties if you've already earned that reputation, and you are free to award as much of it as you like to as many posts as you like. If several posts you consider deserving of your hard-earned rep happen to belong to the same user, that's not a problem; posting great answers rarely happens by accident, so it's quite natural that a user that shares your interests with regard to challenge types, topics, and programming languages might post more than one answer that catches your eye.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;In this specific case: yes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, moderators do not have magic wands to read the users' minds, but I have yet to find a shred of evidence that these bounties were placed with the intention to reward great answers. There's a lot that suggests quite the opposite though.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The post notice templates say&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;One or more of the answers is exemplary and worthy of an additional bounty.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;but the user-supplied description&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;ton hospel is cool and i want to give him internet points.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;states quite clearly that these bounties will be awarded to a &lt;em&gt;person&lt;/em&gt; rather than their answers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The three answers of @TonHospel that were picked for the bounties were simply their three oldest answers. I'm not saying the answers aren't good enough to get bounties, but they were certainly picked arbitrarily.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;One of the answers is a rather straightforward port of a JavaScript answer by another user to Perl. That doesn't make the answer any worse, but a &lt;strong&gt;+500&lt;/strong&gt; bounty – the ultimate award an answer can receive – seems like a stretch.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Ton Hospel has posted &lt;em&gt;amazing&lt;/em&gt; answers that are, in my opinion, more deserving of a bounty that the three ones that were picked. For example, there's &lt;a href=&quot;https://codegolf.stackexchange.com/a/97123/12012&quot;&gt;Calculate the permanent as quickly as possible&lt;/a&gt; which is certainly exemplary.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The (ongoing) chat discussion (&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/34730493#34730493&quot;&gt;starts here&lt;/a&gt;) and, in particular, the message&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/34731496#34731496&quot;&gt;i thought it was really cool that ton hospel visited the site and participated quite a lot&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;speak for themselves.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Is this a problem?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'd say so. Even the simple act of transferring reputation from one account to another is an inappropriate use of the bounty system. If that was intended to be possible, there would be a tip jar.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But that's not all bounties do! The three bountied questions will appear in the &lt;a href=&quot;https://codegolf.stackexchange.com/?tab=featured&quot;&gt;featured tab&lt;/a&gt; until they're awarded or expired (which might take up to 7 days). A bounty also pretty much guarantees a permanent slot on the front page. That's OK if the bounty draws attention to an exemplary answer, but not so much when they're used as &quot;rep cheques&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What can be done about it?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm not saying that we will (or should) in this particular case, but &lt;a href=&quot;https://meta.stackexchange.com/a/27103/170332&quot;&gt;moderators &lt;em&gt;can&lt;/em&gt; refund bounties&lt;/a&gt; under exceptional circumstances. &lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2017-01-20T01:30:31.180" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="11242" PostTypeId="2" ParentId="11239" CreationDate="2017-01-12T17:26:14.513" Score="1" Body="&lt;h1&gt;Assume the bounties are being awarded in good faith.&lt;/h1&gt;&#xA;&lt;p&gt;I read as much of the chat history as I could bear, and I have not seen a single person ask Mitch if he thinks the answers posted by Ton Hospel are great answers. It's quite possible that Mitch thinks Ton Hospel is cool, &lt;strong&gt;and also thinks his answers are great&lt;/strong&gt;. That's good enough for me until Mitch gives me a reason to believe otherwise.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/34731524#34731524&quot;&gt;Mego's comment&lt;/a&gt; motivated me to post this answer.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I think we could all benefit by remembering to Assume Good Faith more often&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-12T17:50:35.857" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="11243" PostTypeId="2" ParentId="2140" CreationDate="2017-01-12T18:43:03.440" Score="0" Body="&lt;h1&gt;Prime Factors that Weren't there Before&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a list of integers &lt;code&gt;a&lt;/code&gt;, calculate the prime factorization for each integer in the array. Then, return a list of factors that do not appear in the original input, even as part of another number. For instance, if you were given:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;a = [1243,11311]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The prime factors would be calculated as:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;a' = [[11, 113], [11311]] = []&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because &lt;code&gt;11 appears in 11311&lt;/code&gt;, and &lt;code&gt;113 appears in 11311&lt;/code&gt;, the result would be &lt;code&gt;[]&lt;/code&gt;, an empty set.  &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Lets look at another example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;a = [270,325,192] = [[2, 3, 3, 3, 5], [5, 5, 13], [2, 2, 2, 2, 2, 2, 3]] = [13]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Another example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;a  = [27072,32585,19296]&#xA;a'  = [[2, 2, 2, 2, 2, 2, 3, 3, 47], [5, 7, 7, 7, 19], [2, 2, 2, 2, 2, 3, 3, 67]]&#xA;a'' = [47,67]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;A bigger example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;a   = [56,3924,10000,1240124]&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;a'  = [[2, 2, 2, 7], [2, 2, 3, 3, 109], [2, 2, 2, 2, 5, 5, 5, 5], [2, 2, 31, 73, 137]]&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;a'' = [7,109,31,73,137]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code golf, lowest byte-count wins.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastActivityDate="2017-01-12T18:43:03.440" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11244" PostTypeId="2" ParentId="2140" CreationDate="2017-01-12T18:52:19.993" Score="1" Body="&lt;h1&gt;Maximize the velocity of a group of cars&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;A group of cars are in the right lane of a straight two lane highway. Each car has a preferred speed. In order to reach this preferred speed, some of the cars need to change lanes, perhaps multiple times.&lt;/p&gt;&#xA;&lt;p&gt;All cars are exactly 1 meter long. At the start of the simulation, there is zero space between each car and the car in front of it. Acceleration is instant. Cars move at their preferred speed whenever possible. If a car would bump into another car, instead it immediately decelerates to match the speed of the car in front.&lt;/p&gt;&#xA;&lt;p&gt;Give the starting order and preferred speed of each car, your task is to find some combination of lane changes such that all cars reach their preferred speed, and could continue to do so forever without any further lane changes, in the smallest amount of time.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;Two lists are given as input:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A list of strings that represent car names&lt;/li&gt;&#xA;&lt;li&gt;A list of integers that represent preferred speeds, in meters per second&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The order of the car names indicates the starting order, with the first car in the list begins at the front of the pack. You can map cars to speeds using position in the list.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;You will output a list of lane change events that, if followed, leads to a situation where all cars are currently driving at their preferred speeds, and could continue to do so forever. The solution must also be the fastest such solution in terms of simulation time. Another way to say this is that the timestamp of the last lane change event must be minimal.&lt;/p&gt;&#xA;&lt;p&gt;Each event must include a timestamp and a car name. The timestamp must be the number of seconds since the beginning of the simulation, rounded to the nearest hundredth of a second.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="18487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-12T18:52:19.993" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11245" PostTypeId="2" ParentId="2140" CreationDate="2017-01-12T19:23:07.187" Score="0" Body="&lt;h1&gt;Contiguous Palindromic Subsequencing&lt;/h1&gt;&#xA;&lt;p&gt;Given a word &lt;code&gt;a&lt;/code&gt;, perform the following operations:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Group string into palindromic subsequences of length &amp;gt; 2 and non-palindromic subsequences. (You should prioritize partition length over partition index, for instance &lt;code&gt;esse&lt;/code&gt; shouldn't result in &lt;code&gt;['e','ss','e']&lt;/code&gt;, it should be &lt;code&gt;['esse']&lt;/code&gt;. However, if the lengths are the same for two subsequences, use index to prioritize which you choose).&lt;/li&gt;&#xA;&lt;li&gt;Make all non-palindromic subsequences palindromic (single characters are palindromic here).&lt;/li&gt;&#xA;&lt;li&gt;Put it back together.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;You may assume only printable ASCII characters are used.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Examples:&lt;/h1&gt;&#xA;&lt;p&gt;&lt;code&gt;raggamuffin -&amp;gt; ['r','agga','muffin'] -&amp;gt; ['r','agga','muffiniffum'] -&amp;gt; raggamuffiniffum&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;bananaracecar -&amp;gt; ['b','anana','racecar'] -&amp;gt; ['b','anana','racecar'] -&amp;gt; Unchanged.&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;(Since each palindrome grouping would be the same length, use the first one).&lt;br /&gt;&#xA;SIZE OF GROUP &amp;gt; INDEX OF GROUP&lt;br /&gt;&#xA;&lt;code&gt;abaca -&amp;gt; ['aba', 'ca'] -&amp;gt; ['aba','cac'] -&amp;gt; abacac&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;(Always choose the bigger palindrome, THEN go by index)&lt;br /&gt;&#xA;&lt;code&gt;cheesewheels -&amp;gt; ['che','ese','wh','ee','ls'] -&amp;gt; ['chehc','ese','whw','ee','lsl'] -&amp;gt; chehcesewhweelsl&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;(Always choose the bigger palindrome, THEN go by index)&lt;br /&gt;&#xA;&lt;code&gt;1223224 -&amp;gt; [1,22322,4] -&amp;gt; Unchanged.&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;abbabbababbababba -&amp;gt; ['a', 'bb', 'abbababbababba'] -&amp;gt; Unchanged.&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;abcdefg -&amp;gt; ['abcdefg'] -&amp;gt; ['abcdefgfedcba'] -&amp;gt; abcdefgfedcba&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;slammedintoacardoor -&amp;gt; ['sla', 'mm', 'edinto', 'aca', 'rd', 'oo', 'r'] -&amp;gt; ['slals', 'mm', 'edintotnide', 'aca', 'rdr', 'oo', 'r'] -&amp;gt; slalsmmedeintotniacardroor&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;eeefffgegffhi -&amp;gt; ['eee','f','ffgegff','hi'] -&amp;gt; ['eee','f','ffgegff','hih'] -&amp;gt; eeefffgegffhih&lt;/code&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This will be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, lowest byte-count wins.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-13T15:46:24.157" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="11247" PostTypeId="2" ParentId="2140" CreationDate="2017-01-12T23:50:23.000" Score="0" Body="&lt;h1&gt;Play time&lt;/h1&gt;&#xA;&lt;p&gt;Hello. It is time to play the most popular portuguese card game: &lt;a href=&quot;https://en.wikipedia.org/wiki/Sueca_(card_game)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sueca&lt;/a&gt;! So for people who does not know the game, it is needed to print a wall poster to make them know the power and the points each card has.&lt;/p&gt;&#xA;&lt;p&gt;So, the job is to print an ASCII art wall as:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    11        10        4         3         2        ———       ———       ———       ———       ———&#xA;   &#xA;╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ &#xA;|A     A| |7     7| |R     R| |V     V| |D     D| |6     6| |5     5| |4     4| |3     3| |2     2| &#xA;|♥     ♥| |♥     ♥| |♥    /♥| |♥    /♥| |♥    /♥| |♥     ♥| |♥     ♥| |♥     ♥| |♥     ♥| |♥     ♥| &#xA;|       | |  ♥ ♥  | | ♔ /  | | ♗ /  | |  ♕ /  | |  ♥ ♥  | |  ♥ ♥  | |  ♥ ♥  | |       | |   ♥   | &#xA;|   ♥   | |   ♥   | |   /   | |   /   | |   /   | |  ♥ ♥  | |   ♥   | |       | |  ♥ ♥  | |       | &#xA;|       | |  ♥ ♥  | |  / ♔ | |  / ♗ | |  / ♕  | |  ♥ ♥  | |  ♥ ♥  | |  ♥ ♥  | |   ♥   | |   ♥   | &#xA;|A     A| |7 ♥ ♥ 7| |R/    R| |V/    V| |D/    D| |6     6| |5     5| |4     4| |3     3| |2     2| &#xA;|♥     ♥| |♥     ♥| |♥     ♥| |♥     ♥| |♥     ♥| |♥     ♥| |♥     ♥| |♥     ♥| |♥     ♥| |♥     ♥| &#xA;╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ &#xA;   &#xA;╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ &#xA;|A     A| |7     7| |R     R| |V     V| |D     D| |6     6| |5     5| |4     4| |3     3| |2     2| &#xA;|♦     ♦| |♦     ♦| |♦    /♦| |♦    /♦| |♦    /♦| |♦     ♦| |♦     ♦| |♦     ♦| |♦     ♦| |♦     ♦| &#xA;|       | |  ♦ ♦  | | ♔ /  | | ♗ /  | |  ♕ /  | |  ♦ ♦  | |  ♦ ♦  | |  ♦ ♦  | |       | |   ♦   | &#xA;|   ♦   | |   ♦   | |   /   | |   /   | |   /   | |  ♦ ♦  | |   ♦   | |       | |  ♦ ♦  | |       | &#xA;|       | |  ♦ ♦  | |  / ♔ | |  / ♗ | |   / ♕ | |  ♦ ♦  | |  ♦ ♦  | |  ♦ ♦  | |   ♦   | |   ♦   | &#xA;|A     A| |7 ♦ ♦ 7| |R/    R| |V/    V| |D/    D| |6     6| |5     5| |4     4| |3     3| |2     2| &#xA;|♦     ♦| |♦     ♦| |♦     ♦| |♦     ♦| |♦     ♦| |♦     ♦| |♦     ♦| |♦     ♦| |♦     ♦| |♦     ♦| &#xA;╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯&#xA;   &#xA;╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ &#xA;|A     A| |7     7| |R     R| |V     V| |D     D| |6     6| |5     5| |4     4| |3     3| |2     2| &#xA;|♣     ♣| |♣     ♣| |♣    /♣| |♣    /♣| |♣    /♣| |♣     ♣| |♣     ♣| |♣     ♣| |♣     ♣| |♣     ♣| &#xA;|       | |  ♣ ♣  | | ♚ /  | | ♝ /  | |  ♛ /  | |  ♣ ♣  | |  ♣ ♣  | |  ♣ ♣  | |       | |   ♣   | &#xA;|   ♣   | |   ♣   | |   /   | |   /   | |   /   | |  ♣ ♣  | |   ♣   | |       | |  ♣ ♣  | |       | &#xA;|       | |  ♣ ♣  | |  / ♚ | |  / ♝ | |  / ♛  | |  ♣ ♣  | |  ♣ ♣  | |  ♣ ♣  | |   ♣   | |   ♣   | &#xA;|A     A| |7 ♣ ♣ 7| |R/    R| |V/    V| |D/    D| |6     6| |5     5| |4     4| |3     3| |2     2| &#xA;|♣     ♣| |♣     ♣| |♣     ♣| |♣     ♣| |♣     ♣| |♣     ♣| |♣     ♣| |♣     ♣| |♣     ♣| |♣     ♣| &#xA;╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ &#xA;   &#xA;╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ ╭───────╮ &#xA;|A     A| |7     7| |R     R| |V     V| |D     D| |6     6| |5     5| |4     4| |3     3| |2     2| &#xA;|♠     ♠| |♠     ♠| |♠    /♠| |♠    /♠| |♠    /♠| |♠     ♠| |♠     ♠| |♠     ♠| |♠     ♠| |♠     ♠| &#xA;|       | |  ♠ ♠  | | ♚ /  | |  ♝/  | |  ♛ /  | |  ♠ ♠  | |  ♠ ♠  | |  ♠ ♠  | |       | |   ♠   | &#xA;|   ♠   | |   ♠   | |   /   | |   /   | |   /   | |  ♠ ♠  | |   ♠   | |       | |  ♠ ♠  | |       | &#xA;|       | |  ♠ ♠  | |  / ♚ | |  / ♝ | |  / ♛  | |  ♠ ♠  | |  ♠ ♠  | |  ♠ ♠  | |   ♠   | |   ♠   | &#xA;|A     A| |7 ♠ ♠ 7| |R/    R| |V/    V| |D/    D| |6     6| |5     5| |4     4| |3     3| |2     2| &#xA;|♠     ♠| |♠     ♠| |♠     ♠| |♠     ♠| |♠     ♠| |♠     ♠| |♠     ♠| |♠     ♠| |♠     ♠| |♠     ♠| &#xA;╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯ ╰───────╯&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="29325" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-12T23:50:23.000" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11248" PostTypeId="2" ParentId="2140" CreationDate="2017-01-13T00:24:33.480" Score="0" Body="&lt;h1&gt;Left-to-Right calculator&lt;/h1&gt;&#xA;&lt;p&gt;Given the opinion I posted on &lt;a href=&quot;https://ux.stackexchange.com/a/99984/51560&quot;&gt;https://ux.stackexchange.com/a/99984/51560&lt;/a&gt; , I want to have a calculator where the least-significant least digits are placed on the left.&lt;/p&gt;&#xA;&lt;p&gt;The input must come from stdin. It only needs to support non-negative integers. Additions must support any number of parcels, and to end the input of parcels input an empty line. In every example, all above the first ——— line is input, the first ——— line itself and the lines below are output.&lt;/p&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+&#xA;2134&#xA;254&#xA;89&#xA;————&#xA;0684&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Subtractions input is always composed by two operators:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;-&#xA;3351547&#xA;945613&#xA;———————&#xA;4894317&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Multiplications input is also two operands.Must support at multiplications where the second operator is &amp;lt; 100 and output the auxiliary addition like the way it is done by hand.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;*&#xA;94651&#xA;74&#xA;———————&#xA;345901&#xA; 69526&#xA;———————&#xA;305537&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="29325" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-13T00:24:33.480" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11250" PostTypeId="2" ParentId="2140" CreationDate="2017-01-13T01:36:25.897" Score="0" Body="&lt;h1&gt;1 line ASCII Domino play&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The game is described on my own question I posted on &lt;a href=&quot;https://math.stackexchange.com/questions/2091748/domino-game-maximum-achievable-points&quot;&gt;Domino game maximum achievable points&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The rules for scoring are on the link, and I am reposting them here:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The rules for scoring are: every time a part is placed, if the sum of&#xA;  both ends of the dominoes chain is a multiple of 5, you add it to you&#xA;  current score.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;example: [4|2] [2|1] makes 5 points&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;A double (every part where the two halfes are equal) is always placed&#xA;  rotated by 90º; so for accounting purposes, unlike other pieces, both&#xA;  sides ot the part are taken into account.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;___       ___&#xA;|6|       |4|&#xA;——— [6|4] ———  &#xA;|6|       |4|&#xA;———       ———&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;makes for 20 points.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;One single part placed accounts as the two tips.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Example [2|3] accounts as 5 points&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;And&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;___ &#xA;|5| &#xA;——— &#xA;|5| &#xA;———  accounts as 10 points.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The challenge is to write a game that is an ASCII one line domino game for me to play.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must output to stderr/stdout&lt;/li&gt;&#xA;&lt;li&gt;Line Width is 80 chars&lt;/li&gt;&#xA;&lt;li&gt;The first two chars are reserved for displaying points, aligned at right. By definition, it will always be a multiple of 5; and the third is always a &lt;code&gt;&lt;/code&gt; space&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Given space is limited:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Every join of two parts will conjoin and they will be separed by a &lt;code&gt;|&lt;/code&gt; they will share instead of &lt;code&gt;][&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Double parts (those where the two halves are equal) will be represented abbreviate:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;[ | ] =&gt; [ ]&lt;/li&gt;&#xA;&lt;li&gt;[1|1] =&gt; [=]&lt;/li&gt;&#xA;&lt;li&gt;[2|2] =&gt; [+]&lt;/li&gt;&#xA;&lt;li&gt;[3|3] =&gt; [*]&lt;/li&gt;&#xA;&lt;li&gt;[4|4] =&gt; [&amp;amp;]&lt;/li&gt;&#xA;&lt;li&gt;[5|5] =&gt; [X]&lt;/li&gt;&#xA;&lt;li&gt;[6|6] =&gt; [%]&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Except for white double, all whites are represented by only the other half  &lt;/li&gt;&#xA;&lt;li&gt;Every other part is represented by [NM], where N and M are the number of each half&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The ends of the whole dominoes chain are always terminated by []&lt;/li&gt;&#xA;&lt;li&gt;The initial state is an empty table. First piece placed will be at the center&lt;/li&gt;&#xA;&lt;li&gt;When chain begins to not fit, at one of the ends, it must be adjusted to fit by pushing the whole placing a little bit to the left or the right.&lt;/li&gt;&#xA;&lt;li&gt;The last 3 chars of the line are reserved for user input. User can only input a piece not yet placed. User input is &lt;code&gt;NM&lt;/code&gt; which is displayed; and a keypress of &lt;code&gt;+&lt;/code&gt; or &lt;code&gt;-&lt;/code&gt; which will &lt;strong&gt;NOT&lt;/strong&gt; be displayed to avoid a newline feed. The key press tells what side of the chain will the new piece will be snapped:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;-&lt;/code&gt; to left&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;+&lt;/code&gt; to right&lt;/li&gt;&#xA;&lt;li&gt;It also must validate the snapping. If user snaps to a non-matching piece, just do nothing. The program will &lt;strong&gt;NOT&lt;/strong&gt; be smart enough to make guesses; so it will &lt;strong&gt;NOT&lt;/strong&gt; make a piece to snap on the other side if piece does not match user specified side&lt;/li&gt;&#xA;&lt;li&gt;And after each valid placing of a piece, must update the points display if there are some to score.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Example of an &lt;strong&gt;INVALID&lt;/strong&gt; placed chain, containing a sequence which would not be possible, because there are pieces snapped to not-matching pieces. &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  5 [ |=|+|*|&amp;amp;|X|%|1|2|3|4|5|6|12|13|14|15|16|23|24|25|26|34|35|36|45|46|56] 12{+}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;{+}&lt;/code&gt; is not displayed, it is there just to illustrate the input:&lt;/p&gt;&#xA;" OwnerUserId="29325" LastEditorUserId="-1" LastEditDate="2017-04-13T12:19:20.950" LastActivityDate="2017-01-14T18:29:20.623" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="11253" PostTypeId="1" CreationDate="2017-01-13T07:34:38.100" Score="11" ViewCount="269" Body="&lt;p&gt;Why was this &lt;a href=&quot;https://codegolf.stackexchange.com/a/106659/13798&quot;&gt;answer&lt;/a&gt; deleted so quickly?&#xA;The answer is apparently wrong, but why don't we give the poster enough time to acknowledge the comments and maybe fix his answer?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/MZOna.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/MZOna.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="13798" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2017-01-13T07:39:31.680" Title="Wrong answers quickly deleted" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11254" PostTypeId="2" ParentId="11253" CreationDate="2017-01-13T07:39:31.680" Score="9" Body="&lt;p&gt;The poster can always edit their answer and mod-flag it to be undeleted. Deleting it sooner rather than later actually helps out the poster - it prevents piles of downvotes from accumulating, making it much more likely that the answer will be well-received after it is fixed. Since voters have no idea when an answer is edited unless they are actively watching it, many people will downvote invalid answers and never come back to take back their downvote once the answer is fixed.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-01-13T07:39:31.680" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="11255" PostTypeId="2" ParentId="2140" CreationDate="2017-01-13T13:16:58.783" Score="1" Body="&lt;h2&gt;Divide an array into left and right halves.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input: An array of floating-point values, or whatever is a reasonably large numeric type in your language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: Two arrays. The original array should be the concatenation of the output arrays. The sums of the elements in the two arrays should be as equal as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[] -&amp;gt; [], []&#xA;[1] -&amp;gt; [1], [] or [], [1]&#xA;[1, 2, 1] -&amp;gt; [1, 2], [1] or [1], [2, 1]&#xA;[1, 2, 3] -&amp;gt; [1, 2], [3]&#xA;[1, -1] -&amp;gt; [1, -1], [] or [], [1, -1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Functions or full programs please; no snippets. Normal &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules and restrictions apply.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2017-01-19T08:47:00.783" LastActivityDate="2017-01-19T08:47:00.783" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11258" PostTypeId="2" ParentId="11233" CreationDate="2017-01-13T16:46:39.257" Score="0" Body="&lt;p&gt;All of the problems presented by the OP are input/output formatting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would argue that all of these issues can be solved using &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;Default for Code Golf: Input/Output methods&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These allow us to set defaults that questions can override.  However, despite these defaults, it may be a good idea to specify some of them in your question for clarity.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Trailing spaces/newlines&lt;/em&gt;:  Do we allow trailing whitespace on output?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Precision&lt;/em&gt;:  How much floating-point precision should outputs have by default?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Input formatting&lt;/em&gt;:  Some issues with formatting can be &quot;standardized&quot;, but on complex input, that really just needs to be specified question by question.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Indexing&lt;/em&gt;: Defining an index can be tough to do for &quot;defaults&quot;, but if we can, I think its also a good candidate for defaults.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I'm not saying that all of issues are solved by having defaults.  As Peter said, you still need a well-written question if you want it to be clear.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2017-01-13T16:46:39.257" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11263" PostTypeId="1" CreationDate="2017-01-14T18:54:50.120" Score="0" ViewCount="97" Body="&lt;p&gt;If I write out the answer to a problem and put it on GitHub, then I can easily win a challenge by simply writing code to fetch the answer. Is this valid? I've never seen it been forbidden in a challenge's rules.&lt;/p&gt;&#xA;" OwnerUserId="63432" LastActivityDate="2017-01-14T18:54:50.120" Title="Is using the internet for your answer valid?" Tags="|discussion|" AnswerCount="0" CommentCount="2" ClosedDate="2017-01-14T18:58:05.427" ContentLicense="CC BY-SA 3.0" />
  <row Id="11265" PostTypeId="2" ParentId="2140" CreationDate="2017-01-15T13:37:02.680" Score="1" Body="&lt;h1&gt;Decide if an integer is uniform&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I was recently implementing a Local Binary Patch (LBP) descriptor, and found the need to decide if a number is uniform, as described below. You can read about why this is needed in object detection &lt;a href=&quot;https://en.wikipedia.org/wiki/Local_binary_patterns&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input/Rules:&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Take a (&lt;strong&gt;signed!&lt;/strong&gt;) integer &lt;code&gt;n&lt;/code&gt; in any way that seems reasonable to your language of choice.&lt;/li&gt;&#xA;&lt;li&gt;The number will be given as a decimal.&lt;/li&gt;&#xA;&lt;li&gt;Your approach must work with at least all 32 bit encoded integers, including &lt;code&gt;0&lt;/code&gt;. This means from −2,147,483,648 to 2,147,483,647, i.e. from −(2^31) to 2^31 − 1&lt;/li&gt;&#xA;&lt;li&gt;Negative numbers must be turned to binary with &lt;a href=&quot;https://en.wikipedia.org/wiki/Two%27s_complement&quot; rel=&quot;nofollow noreferrer&quot;&gt;Two's-complement&lt;/a&gt;. (With One's complement the output is the same as for the unsigned version of the number every time).&lt;/li&gt;&#xA;&lt;li&gt;Only the minimal number of bits required to encode the given number matters.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Output:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A &lt;code&gt;truthy/falsey&lt;/code&gt; value if the number is uniform.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Uniformity:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An integer &lt;code&gt;n&lt;/code&gt; is considered to be uniform, if the number of transitions from 1 to 0 or from 0 to 1 in the binary encoding of &lt;code&gt;n&lt;/code&gt; ist less equal to 2.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given the number &lt;code&gt;12&lt;/code&gt;, its binary encoding is &lt;code&gt;1100&lt;/code&gt;.&#xA;There is 1 transition here:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;1100&#xA;  |&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thus, your output should be &lt;code&gt;truthy&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given the number &lt;code&gt;10&lt;/code&gt;, its binary encoding is &lt;code&gt;1010&lt;/code&gt;.&#xA;There are 3 transitions in here: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;1010&#xA; |||&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thus, your output should be &lt;code&gt;falsey&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given the number &lt;code&gt;-12&lt;/code&gt;, its binary two's complement encoding is &lt;code&gt;0100&lt;/code&gt;. There are 2 transition here:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;0100&#xA; ||&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thus, your output should be &lt;code&gt;truthy&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is an example for which the &lt;strong&gt;two's complement matters&lt;/strong&gt;:&#xA;Given the number &lt;code&gt;-125&lt;/code&gt;, its binary two's complement encoding is &lt;code&gt;10000011&lt;/code&gt;.&#xA;There are 2 transitions here:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;10000011&#xA; |    |&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thus, your output should be &lt;code&gt;truthy&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Side note:&lt;/strong&gt;&#xA;If we did the same with one's complement, the encoding of &lt;code&gt;-125&lt;/code&gt; would be &lt;code&gt;10000010&lt;/code&gt;, which has 3 transitions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Shortest code in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox notes:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is my first code golf question, feel free to yell at me.&#xA;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sand-box&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sand-box&amp;#39;&quot; rel=&quot;tag&quot;&gt;sand-box&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/numbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;numbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;numbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="64470" LastEditorUserId="64470" LastEditDate="2017-01-15T15:32:26.523" LastActivityDate="2017-01-15T15:32:26.523" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11268" PostTypeId="2" ParentId="2140" CreationDate="2017-01-15T18:53:28.707" Score="0" Body="&lt;h2&gt;Graphical Borromean Rings&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here is an SVG rendering of the &lt;a href=&quot;https://en.wikipedia.org/wiki/Borromean_rings&quot; rel=&quot;nofollow noreferrer&quot;&gt;Borromean Rings&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;svg xmlns=&quot;http://www.w3.org/2000/svg&quot; height=&quot;200&quot; width=&quot;200&quot;&amp;gt;&#xD;&#xA;  &amp;lt;defs&amp;gt;&#xD;&#xA;    &amp;lt;radialGradient id=&quot;green&quot;&amp;gt;&#xD;&#xA;      &amp;lt;stop stop-color=&quot;transparent&quot; offset=&quot;70%&quot;/&amp;gt;&#xD;&#xA;      &amp;lt;stop stop-color=&quot;#0F0&quot; offset=&quot;75%&quot;/&amp;gt;&#xD;&#xA;      &amp;lt;stop stop-color=&quot;#CFC&quot; offset=&quot;85%&quot;/&amp;gt;&#xD;&#xA;      &amp;lt;stop stop-color=&quot;#0F0&quot; offset=&quot;95%&quot;/&amp;gt;&#xD;&#xA;      &amp;lt;stop stop-color=&quot;transparent&quot; offset=&quot;100%&quot;/&amp;gt;&#xD;&#xA;    &amp;lt;/radialGradient&amp;gt;&#xD;&#xA;    &amp;lt;radialGradient id=&quot;blue&quot;&amp;gt;&#xD;&#xA;      &amp;lt;stop stop-color=&quot;transparent&quot; offset=&quot;70%&quot;/&amp;gt;&#xD;&#xA;      &amp;lt;stop stop-color=&quot;#00F&quot; offset=&quot;75%&quot;/&amp;gt;&#xD;&#xA;      &amp;lt;stop stop-color=&quot;#CCF&quot; offset=&quot;85%&quot;/&amp;gt;&#xD;&#xA;      &amp;lt;stop stop-color=&quot;#00F&quot; offset=&quot;95%&quot;/&amp;gt;&#xD;&#xA;      &amp;lt;stop stop-color=&quot;transparent&quot; offset=&quot;100%&quot;/&amp;gt;&#xD;&#xA;    &amp;lt;/radialGradient&amp;gt;&#xD;&#xA;    &amp;lt;radialGradient id=&quot;red&quot;&amp;gt;&#xD;&#xA;      &amp;lt;stop stop-color=&quot;transparent&quot; offset=&quot;70%&quot;/&amp;gt;&#xD;&#xA;      &amp;lt;stop stop-color=&quot;#F00&quot; offset=&quot;75%&quot;/&amp;gt;&#xD;&#xA;      &amp;lt;stop stop-color=&quot;#FCC&quot; offset=&quot;85%&quot;/&amp;gt;&#xD;&#xA;      &amp;lt;stop stop-color=&quot;#F00&quot; offset=&quot;95%&quot;/&amp;gt;&#xD;&#xA;      &amp;lt;stop stop-color=&quot;transparent&quot; offset=&quot;100%&quot;/&amp;gt;&#xD;&#xA;    &amp;lt;/radialGradient&amp;gt;&#xD;&#xA;    &amp;lt;mask height=&quot;100&quot; width=&quot;100&quot; y=&quot;0&quot; x=&quot;0&quot; id=&quot;back&quot;&amp;gt;&#xD;&#xA;      &amp;lt;rect fill=&quot;#FFF&quot; height=&quot;100&quot; width=&quot;50&quot; y=&quot;0&quot; x=&quot;0&quot;/&amp;gt;&#xD;&#xA;      &amp;lt;rect fill=&quot;#FFF&quot; height=&quot;50&quot; width=&quot;50&quot; y=&quot;25&quot; x=&quot;50&quot;/&amp;gt;&#xD;&#xA;    &amp;lt;/mask&amp;gt;&#xD;&#xA;    &amp;lt;mask height=&quot;100&quot; width=&quot;100&quot; y=&quot;0&quot; x=&quot;0&quot; id=&quot;front&quot;&amp;gt;&#xD;&#xA;      &amp;lt;rect fill=&quot;#FFF&quot; height=&quot;25&quot; width=&quot;50&quot; y=&quot;0&quot; x=&quot;50&quot;/&amp;gt;&#xD;&#xA;      &amp;lt;rect fill=&quot;#FFF&quot; height=&quot;25&quot; width=&quot;50&quot; y=&quot;75&quot; x=&quot;50&quot;/&amp;gt;&#xD;&#xA;    &amp;lt;/mask&amp;gt;&#xD;&#xA;  &amp;lt;/defs&amp;gt;&#xD;&#xA;  &amp;lt;circle mask=&quot;url(#back)&quot; fill=&quot;url(#green)&quot; r=&quot;50&quot; cy=&quot;50&quot; cx=&quot;50&quot;/&amp;gt;&#xD;&#xA;  &amp;lt;circle fill=&quot;url(#blue)&quot; r=&quot;50&quot; cy=&quot;93.3&quot; cx=&quot;75&quot;/&amp;gt;&#xD;&#xA;  &amp;lt;circle fill=&quot;url(#red)&quot; r=&quot;50&quot; cy=&quot;50&quot; cx=&quot;100&quot;/&amp;gt;&#xD;&#xA;  &amp;lt;circle mask=&quot;url(#front)&quot; fill=&quot;url(#green)&quot; r=&quot;50&quot; cy=&quot;50&quot; cx=&quot;50&quot;/&amp;gt;&#xD;&#xA;&amp;lt;/svg&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please write a full program to generate a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-image&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-image&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-image&lt;/a&gt; which resembles the above rendering reasonably well. In particular:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Solid colours, aliased pixels or overlap artefacts are not acceptable&lt;/li&gt;&#xA;&lt;li&gt;Your colours should contrast with each other&lt;/li&gt;&#xA;&lt;li&gt;Your circles must default to at least 100px in diameter (I wanted larger circles in my snippet but I get a scroll bar if I try)&lt;/li&gt;&#xA;&lt;li&gt;Your circles must have the appearance of overlapping impossibly&lt;/li&gt;&#xA;&lt;li&gt;Rotations and reflections are perfectly acceptable&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Output is via any generally acceptable output format e.g. writing to vector or raster image format or displaying directly to the screen. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/53417/ascii-borromean-rings&quot;&gt;ASCII Borromean Rings&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:27.743" LastActivityDate="2017-01-15T18:53:28.707" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11274" PostTypeId="2" ParentId="2140" CreationDate="2017-01-16T15:48:03.363" Score="0" Body="&lt;h1&gt;Number that includes the amount of digits of itself&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Create a number where each digit represents the amount of this digit the number itself contains. Maybe my english is too bad to describe it clearly so here is an example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;6210001000&#xA;explanation:&#xA;6               -&amp;gt; this number contains 6 times '0'&#xA; 2              -&amp;gt; this number contains 2 times '1'&#xA;  1             -&amp;gt; this number contains 1 time  '2'&#xA;   0            -&amp;gt; this number contains 0 times '3'&#xA;    0           -&amp;gt; this number contains 0 times '4'&#xA;     0          -&amp;gt; this number contains 0 times '5'&#xA;      1         -&amp;gt; this number contains 1 time  '6'&#xA;       0        -&amp;gt; this number contains 0 times '7'&#xA;        0       -&amp;gt; this number contains 0 times '8'&#xA;         0      -&amp;gt; this number contains 0 times '9'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We will call those numbers self-describing. Each self-describing number must be 10 digits long to be able to represent all digits from 0 to 9.&lt;/p&gt;&#xA;&lt;p&gt;I have two possible goals for this challenge:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Create a program which prints out all self-describing numbers in the range &lt;code&gt;0000000000 &amp;lt; X &amp;lt; 99999999999&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;For a given integer in the range &lt;code&gt;0000000000 &amp;lt; X &amp;lt; 99999999999&lt;/code&gt; print out &lt;code&gt;true&lt;/code&gt; if it's a self-describing number, else &lt;code&gt;false&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;I can add further examples and rules if i move it out of the sandbox.&lt;/p&gt;&#xA;" OwnerUserId="29520" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-16T15:54:10.910" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11275" PostTypeId="1" AcceptedAnswerId="11276" CreationDate="2017-01-16T18:33:15.733" Score="8" ViewCount="240" Body="&lt;p&gt;For languages that use command-line flags to modify their behavior, these flags are generally added to the byte count. But I don't see a ruling on what to do with command-line flags in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; challenges. I.e. suppose this was a quine: &lt;code&gt;perl -ne 'quine_program'&lt;/code&gt;. I see a few options:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Output the flags.&lt;/strong&gt; They are part of the source code: their bytes are counted as such, and the program wouldn't work without them. Con: how to format them? Outputting &lt;code&gt;nquine_program&lt;/code&gt; would indicate that the code was &lt;code&gt;nquine_program&lt;/code&gt;, not &lt;code&gt;quine_program&lt;/code&gt; with the &lt;code&gt;n&lt;/code&gt; flag. Maybe a newline in between?&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Don't output the flags.&lt;/strong&gt; They are not really part of the source code, as the objection to the above point shows. Con: this opens all the same loopholes that not counting flags in the byte count opens.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Flags are banned in quine challenges.&lt;/strong&gt; They're too much of a corner case. Do what you need to do in the code itself. Con: flags are really useful and idiomatic (maybe even necessary) for some languages.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;What say ye?&lt;/p&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="16766" LastEditDate="2017-01-16T21:12:22.130" LastActivityDate="2017-01-16T21:12:22.130" Title="Command-line flags in quines" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11276" PostTypeId="2" ParentId="11275" CreationDate="2017-01-16T18:59:33.640" Score="15" Body="&lt;h1&gt;A quine outputs its source code verbatim&lt;/h1&gt;&#xA;&lt;p&gt;That sounds like stating the obvious, but the answer is right there - nowhere in the definition of a quine is there any reference to command-line arguments. For the purposes of quining, the only output should be the source code. Any non-standard command-line arguments don't matter except for the byte penalty.&lt;/p&gt;&#xA;&lt;p&gt;So, to use your example, the program &lt;code&gt;quine_program&lt;/code&gt;, run with &lt;code&gt;perl -ne 'quine_program'&lt;/code&gt;, should output &lt;code&gt;quine_program&lt;/code&gt;, and would have a score of 14 bytes (13 for the source code plus 1 for the non-standard command-line flag).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-16T18:59:33.640" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="11277" PostTypeId="2" ParentId="11038" CreationDate="2017-01-16T19:08:45.337" Score="0" Body="&lt;p&gt;Although there is no explicit rule against using a &quot;no hardcoding&quot; rule to &quot;fix&quot; a fixed output challenge,&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;A challenge must have objective validity criteria.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This means that &quot;hardcoding&quot; cannot form part of the specification wording unless the meaning of &quot;hardcoding&quot; can also be objectively defined. Unless we have a separate Meta discussion to agree on a default meaning for the word, this means that the challenge specification itself must contain a definition.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although it may seem perfectly obvious what the word means, different people may draw the line through the grey areas in different places, &lt;em&gt;particularly&lt;/em&gt; when it affects which approaches are valid in competition.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2017-01-16T19:08:45.337" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11278" PostTypeId="2" ParentId="2140" CreationDate="2017-01-16T19:12:19.887" Score="-2" Body="&lt;h1&gt;Print number of possible values of X if:&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Code 1: X is dividable by 3, X contains the number 3 and input() &amp;lt; X &amp;lt; 10000&lt;/li&gt;&#xA;&lt;li&gt;Code 2: X is dividable by 7, X contains the number 2, X doesn't contain the number 3 and input() &amp;lt; X &amp;lt; 5000&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Sub-Challenge:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Do the same but instead of printing the number, print the values&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Disclaimer: This is my first code golf challenge, and it's very simple, but could bring up some really short answers and cool languages&lt;/p&gt;&#xA;" OwnerUserId="64512" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-17T12:09:57.047" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11279" PostTypeId="2" ParentId="2140" CreationDate="2017-01-16T21:57:28.367" Score="1" Body="&lt;h1&gt;Make a shuffle quine!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;sub&gt;Closely based off &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10997/46271&quot;&gt;this sandbox post&lt;/a&gt;, however I deleted the old one and posted this new answer for new feedback.&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/anagram&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;anagram&amp;#39;&quot; rel=&quot;tag&quot;&gt;anagram&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;An shuffle quine is defined as a quine, of which shuffled sets of &amp;quot;chunks&amp;quot; also form quines.&lt;/p&gt;&#xA;&lt;p&gt;For example, pretend in my magical language the code &lt;code&gt;123&lt;/code&gt; is a quine.&lt;/p&gt;&#xA;&lt;p&gt;Let's split this into 3 chunks. &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;2&lt;/code&gt;, and &lt;code&gt;3&lt;/code&gt;. In your answers, these chunks can be any lengths and there can be any number greater than 1 of chunks.&lt;/p&gt;&#xA;&lt;p&gt;You get a better score for more possible shuffled quines you can make. For example, if &lt;code&gt;21&lt;/code&gt;, &lt;code&gt;23&lt;/code&gt;, &lt;code&gt;13&lt;/code&gt;, &lt;code&gt;312&lt;/code&gt;, and &lt;code&gt;31&lt;/code&gt; are also quines, in addition to &lt;code&gt;123&lt;/code&gt;, you get &lt;code&gt;(15/6 = 2.5) * &amp;lt;sum of chunk lengths&amp;gt;&lt;/code&gt; for your score.&lt;/p&gt;&#xA;&lt;p&gt;Your score is calculated by the formula &lt;code&gt;sum_of_chunk_lengths * (number of possible shuffled programs/number of quines)&lt;/code&gt;. In this formula, least score is better.&lt;/p&gt;&#xA;&lt;p&gt;This is code-golf, so the shortest code wins!&lt;/p&gt;&#xA;&lt;p&gt;Final notes:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each shuffled code is a quine itself, i.e. prints itself not the original program.&lt;/li&gt;&#xA;&lt;li&gt;Programs have to be distinct, i.e. you can't count &lt;code&gt;abb&lt;/code&gt; and &lt;code&gt;abb&lt;/code&gt; as 2 because you swapped the &lt;code&gt;b&lt;/code&gt;s.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Sandbox notes:&lt;/h3&gt;&#xA;&lt;p&gt;Yeah, this is really hard. I don't think it's impossible though.&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-16T21:57:28.367" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11281" PostTypeId="2" ParentId="2140" CreationDate="2017-01-17T01:58:37.133" Score="-2" Body="&lt;h1&gt;[please suggest a name]&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graph-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graph-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;graph-theory&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/path-finding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;path-finding&amp;#39;&quot; rel=&quot;tag&quot;&gt;path-finding&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Mark got an idea of making a path finding algorithm for auto driving vehicles.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, Mark doesn't yet know about programming, so he decided to&#xA;get help from the code golfers.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;How should it work?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;First, we input how many 'nodes' there are.&#xA;we call it 'N', and its an integer up to 16 bit values.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Second, we input what nodes are connected to each nodes, and the length of the connection.&#xA;for example, if the diagram is&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;(1)-5-(2)-2-(3)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;the input should be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2 5  //node 1 is connected to node 2, and the length is 5&#xA;1 5 3 2 //node 2 is connected to node 1 and the length is 5. and its also connected to node 3, and its length is 2.&#xA;2 2  //node 3 is connected to node 2, and the length is 2.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;then, finally, the starting node, and the final node.&#xA;they are inputted as node numbers.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Your code should output the path of the shortest way to go from the start to the final node.&lt;/h2&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3&#xA;2 5&#xA;1 5 3 2&#xA;2 2&#xA;1 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;1-&amp;gt;2-&amp;gt;3&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Explanation:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;(1)-5-(2)-2-(3)&lt;/code&gt;&#xA;starts from 1, and ends in 3.&#xA;there is only one path, and it is the answer.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Specs&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply.&lt;/p&gt;&#xA;" OwnerUserId="64499" LastEditorUserId="64499" LastEditDate="2017-01-18T06:36:17.123" LastActivityDate="2017-01-18T06:36:17.123" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="11283" PostTypeId="2" ParentId="2140" CreationDate="2017-01-17T07:29:13.550" Score="2" Body="&lt;h1&gt;Find B1nar0 Solutions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;B1nar0 puzzle is a paper and pencil game with 0 and 1. The goal is to fill the grid accoring to 3 rules :&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;No more than 2 consecutive 0s or 1s&lt;/li&gt;&#xA;&lt;li&gt;Each row/column has half 0s and half 1s&lt;/li&gt;&#xA;&lt;li&gt;No identical row/columns&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Example :&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[&lt;img src=&quot;https://i.stack.imgur.com/TIeyS.gif&quot; alt=&quot;1]&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A is 0 according to rule 1&lt;/li&gt;&#xA;&lt;li&gt;B is 1 according to rule 1&lt;/li&gt;&#xA;&lt;li&gt;C is 0 according to rule 2&lt;/li&gt;&#xA;&lt;li&gt;D is 1 according to rule 2&lt;/li&gt;&#xA;&lt;li&gt;etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Edit : Grids are square grids of even size (4, 6, 8, 10, 12 or 16 are usual sizes).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt; : Any binary grid (array or string) with &lt;code&gt;0&lt;/code&gt;,&lt;code&gt;1&lt;/code&gt; and any other character you want for empty cells.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt; : Same format as input but filled with a correct grid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test case&lt;/strong&gt; (see GIF)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 11&#xA;  0 &#xA; 0  &#xA;1 1 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="56833" LastEditorUserId="56833" LastEditDate="2017-01-17T08:16:56.290" LastActivityDate="2017-01-17T08:16:56.290" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="11285" PostTypeId="2" ParentId="2140" CreationDate="2017-01-17T09:29:21.763" Score="3" Body="&lt;h1&gt;Dot matrix number visualization&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to make a program that takes a number as input and outputs it as a wall of characters with spaces. The digits should be written like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  1    222   333     4  55555  666  77777  888   999   000 &#xA; 11   2   2 3   3   44  5     6   6     7 8   8 9   9 0   0&#xA;1 1       2     3  4 4  5555  6        7  8   8 9   9 0  00&#xA;  1      2    33  4  4      5 6666    7    888   9999 0 0 0&#xA;  1     2       3 44444     5 6   6  7    8   8     9 00  0&#xA;  1    2    3   3    4  5   5 6   6  7    8   8 9   9 0   0&#xA;11111 22222  333     4   555   666   7     888   999   000  &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Each digit is represented as a grid of 5x7 characters consisting of spaces and the digit itself. The number should be written like above with a vertical line of spaces separating the different digits.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The preformatted text above should be the output of a &lt;code&gt;1234567890&lt;/code&gt; number input. If you guys like this challenge, I'll post an image that better visualizes how each number should be printed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lowest size program wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt; Added a picture to better illustrate the digits.&#xA;&lt;a href=&quot;https://i.stack.imgur.com/vPnoX.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/vPnoX.png&quot; alt=&quot;Dotmatrix digit grid&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="64507" LastEditorUserId="64507" LastEditDate="2017-01-17T13:05:09.993" LastActivityDate="2017-01-17T13:05:09.993" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11287" PostTypeId="2" ParentId="2140" CreationDate="2017-01-17T15:44:53.917" Score="0" Body="&lt;h1&gt;Digit stream with no 42&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You should write a program or function which receives no input and outputs a stream of digits.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The stream should contain at least once every positive integer number which does not contain the digit sequence &lt;code&gt;42&lt;/code&gt;. E.g. The string &lt;code&gt;1231&lt;/code&gt; contains the integers &lt;code&gt;1 12 123 1231 2 23 231 3 31 (and 1 again)&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The stream should &lt;em&gt;not&lt;/em&gt; contain the digit sequence &lt;code&gt;42&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If your interpreter can't handle infinite output gracefully you can add code to only print the first &lt;code&gt;n&lt;/code&gt; digits. This added code does not count to your score.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Note that the stream &lt;code&gt;203204205...&lt;/code&gt; contains &lt;code&gt;42&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No randomness should be used.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is code-golf so the shortest entry wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Do we have infinite output tag?&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="7311" LastEditorUserId="7311" LastEditDate="2017-01-18T15:10:43.423" LastActivityDate="2017-01-18T15:10:43.423" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11292" PostTypeId="2" ParentId="2140" CreationDate="2017-01-17T22:59:53.990" Score="0" Body="&lt;h2&gt;Rainbow Cat Program&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Recently, I remembered a program I'd written in C# a while back for fun. It takes a string as input, then outputs that same string, cycling through a rainbow of colours. I now realize that this is basically a &lt;a href=&quot;https://esolangs.org/wiki/Cat_program&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;cat program&quot;&gt;cat program&lt;/a&gt;, but with the added complexity of the output changing colour every 100ms. So I figured it would make an interesting challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The aim is to make your own &quot;rainbow cat program&quot;, taking a string as input, and outputting that same string cycling through the following colours in sequence: &lt;strong&gt;red, yellow, green, blue, purple&lt;/strong&gt;, and &lt;strong&gt;pink&lt;/strong&gt;. Not quite a proper rainbow, but close enough. The colours must change &lt;strong&gt;every 100ms&lt;/strong&gt; (or as close to 100ms as your chosen language will allow).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For reference, here's an extremely badly-golfed version of my original C# program &lt;strong&gt;(370 bytes)&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;using System;using System.Threading;class P{static void Main(){var a=Console.ReadLine();for(;;){L(a,ConsoleColor.Red);L(a,ConsoleColor.Yellow);L(a,ConsoleColor.Green);L(a,ConsoleColor.Blue);L(a,ConsoleColor.DarkMagenta);L(a,ConsoleColor.Magenta);}}static void L(string a,ConsoleColor b){Console.Clear();Console.ForegroundColor=b;Console.WriteLine(a);Thread.Sleep(100);}}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And a gif of it in action!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/4qkix.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/VgXK8.gif&quot; title=&quot;source: imgur.com&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Other Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Trailing whitespace/newlines are allowed; printing so many newlines that you push the text off the screen, then writing it again in the next colour, is not allowed. You must physically clear the screen and rewrite the text rather than writing it out over and over.&lt;/li&gt;&#xA;&lt;li&gt;Once the cycle starts, it should continue indefinitely without any user input.&lt;/li&gt;&#xA;&lt;li&gt;Standard golfing loopholes apply.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest program wins. Feel free to compete for the shortest program in any given language, though: don't feel put off by the golfing languages!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="64546" LastEditorUserId="64546" LastEditDate="2017-01-23T20:21:26.130" LastActivityDate="2017-01-23T20:21:26.130" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11293" PostTypeId="2" ParentId="2140" CreationDate="2017-01-18T10:39:39.897" Score="4" Body="&lt;h1&gt;Machines learning arithmetic&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note: Feel free to take and use this challenge, either the entire challenge as is, or just parts of it.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;I've made a complete rewrite of this question. I figured the original version was more complex than it had to be. The task is essentially the same. The original challenge text had 4 upvotes and can be found in the edit history.&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;You will receive 30 lists of integers. Those lists are the result of a polynomial expression &lt;code&gt;y = p(x) = a*x^4 + b*x^3 + c*x^2 + d*x + e&lt;/code&gt;, for &lt;code&gt;x&lt;/code&gt; in the inclusive range &lt;code&gt;[-1e5, 1e5]&lt;/code&gt;. Let's call those lists &lt;code&gt;L1, L2 ...&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I reserve the right to make changes to the lists by changing constants and the order if solutions seem to be custom made for those 30 lists.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to figure out what the constants &lt;code&gt;a, b, c, d, e&lt;/code&gt; are for each of those 30 lists.&lt;/p&gt;&#xA;&lt;p&gt;You will write a code that pulls numbers from each list (one list at a time). It must ask for the &lt;code&gt;y&lt;/code&gt;-values for individual &lt;code&gt;x&lt;/code&gt;-values, as many as you want, but one at a time. When you think you have enough information, you'll attempt to guess the value of the constants.&lt;/p&gt;&#xA;&lt;p&gt;You'll do this for all 30 lists.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring:&lt;/h2&gt;&#xA;&lt;p&gt;The lowest score wins!&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You get &lt;strong&gt;1&lt;/strong&gt; point for every number you pull from the list&lt;/li&gt;&#xA;&lt;li&gt;You get &lt;strong&gt;10&lt;/strong&gt; points for every attempt to crack the code (guess &lt;code&gt;a, b, c, d, e&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;The scores for all lists will be added up.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If no submission cracks all lists successfully then the one that cracked the most will win. Tie breaker #1 will be fewest points, tie breaker #2 will be time of submission.&lt;/p&gt;&#xA;&lt;h2&gt;Rules and clarifications:&lt;/h2&gt;&#xA;&lt;p&gt;You can assume all constants to be integers&lt;/p&gt;&#xA;&lt;p&gt;The lists will be formatted in this way (suppose the expression for &lt;code&gt;L1&lt;/code&gt; is: &lt;code&gt;2*x&lt;/code&gt;). I'm using MATLAB/Octave syntax for a cell array. You can change this to fit your needs (language).&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;L1 = {[-200000, -199998, -199996, ... -4, -2, 0, 2, 4, ... 199996, 199998, 200000], [0 0 0 2 0]};&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You can change the format to fit your needs, but you must not mix the list and the values for &lt;code&gt;a, b, c, d, e&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Example:&lt;/h2&gt;&#xA;&lt;p&gt;You ask for &lt;code&gt;y&lt;/code&gt; for four different input values, and get the results:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;L1(0) = 0&#xA;L1(1) = 0&#xA;L1(2) = 2&#xA;L1(3) = 12&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your function guesses (for some reason) that this is &lt;code&gt;x^3-2x^2+1&lt;/code&gt;, and attempts to crack it:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;L1([0, 1, -2, 0, 1]&#xA;false&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You have tried 4 values, and attempted to crack it once. This gives you &lt;code&gt;4 + 10 = 14 points&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You try a few more values:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;L1(-9) = 6480&#xA;L1(-7) = 2352&#xA;L1(7)  = 2352&#xA;L1(9)  = 6480&#xA;L1(100)= 99990000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You're now confident that this has to be: &lt;code&gt;x^4-x^2&lt;/code&gt;, and attempt to crack it again:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;f([1 0 -1 0 0])&#xA;true&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You have successfully guessed the constants &lt;code&gt;a, b, c, d, e&lt;/code&gt;, and get a score of `14 + (5 + 10) = 29 points.&lt;/p&gt;&#xA;&lt;p&gt;You have 29 functions left.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'll have to post the lists on some suitable place (where)?&lt;/li&gt;&#xA;&lt;li&gt;Can I ban builtin interpolation functions somehow without risking the &amp;quot;unobservable requirements&amp;quot;, &amp;quot;x without y&amp;quot; pitfalls?&lt;/li&gt;&#xA;&lt;li&gt;Anything else?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="31516" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-13T17:50:34.050" CommentCount="22" ContentLicense="CC BY-SA 3.0" />
  <row Id="11296" PostTypeId="2" ParentId="2140" CreationDate="2017-01-18T19:32:07.480" Score="0" Body="&lt;h1&gt;Where am I?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;(Some other tags pls help)&lt;/p&gt;&#xA;&lt;p&gt;Your task in this challenge is to output the location of the user. This may be done by means of GeoIP, a builtin GPS device, or any other means. Output should either be in the format (latitude, longitude) accurate to at least one degree, or (City, [optional state/province/etc], Country). Errors due to the GPS device being inaccurate or similar which are not the fault of your code are allowed. Fewest bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="60042" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-18T19:32:07.480" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11299" PostTypeId="2" ParentId="2140" CreationDate="2017-01-19T08:44:59.087" Score="3" Body="&lt;h2&gt;Powerful numbers &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Look at the number 81 expressed as the sum of distinct powers of the same base:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;81 = 81 (well, duh)&lt;/li&gt;&#xA;&lt;li&gt;81 = 80 + 1 (easy)&lt;/li&gt;&#xA;&lt;li&gt;81 = 9*9&lt;/li&gt;&#xA;&lt;li&gt;81 = 4*4*4 + 4*4 + 1&lt;/li&gt;&#xA;&lt;li&gt;81 = 3*3*3*3&lt;/li&gt;&#xA;&lt;li&gt;81 = 2*2*2*2*2*2 + 2*2*2*2 + 1 (if you thought that was obvious...)&lt;/li&gt;&#xA;&lt;li&gt;81 = 1 + 1 + ... + 1 (yeah, yeah...)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;As you can see, for N &gt; 4, there are always 4 trivial bases: 1, 2, N-1 and N. Powerful numbers are those numbers which have at least one nontrivial base. Please write a program or function that, given a number N &gt; 4, outputs a truthy or falsy value for whether a nontrivial base exists. The results for N up to 30 should be as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(1  F)  16  T&#xA;(2  F)  17  T&#xA;(3  F)  18  F&#xA;(4  F)  19  F&#xA; 5  F   20  T&#xA; 6  F   21  T&#xA; 7  F   22  F&#xA; 8  F   23  F&#xA; 9  T   24  F&#xA;10  T   25  T&#xA;11  F   26  T&#xA;12  T   27  T&#xA;13  T   28  T&#xA;14  F   29  F&#xA;15  F   30  T&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest solution wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2017-01-25T20:32:03.070" LastActivityDate="2017-01-25T20:32:03.070" CommentCount="17" ContentLicense="CC BY-SA 3.0" />
  <row Id="11302" PostTypeId="2" ParentId="2140" CreationDate="2017-01-19T11:21:44.833" Score="0" Body="&lt;h1&gt;Do you accept me?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;Being accepted is very important to people. But words are also people (right!?). So they also want to be accepted. However most people work non-deterministically and as such it's only fair to transfer that into our decision whether we accept a word. Of course, because a stupid human can't remember much the instructions to decide whether to accept a word must be short...&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;Your input will be&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a list of non-negative integers - the &amp;quot;word&amp;quot; (this is easier than using strings and actual alphabets)&lt;/li&gt;&#xA;&lt;li&gt;a list of triples of non-negative integers - the transitions, you may also use unordered data structures here&lt;/li&gt;&#xA;&lt;li&gt;an integer - the starting state&lt;/li&gt;&#xA;&lt;li&gt;a list of non-negative integers - the accepting states, you may also use unordered data structures here&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may use any other object or whatever than integers if it pleases you.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;A truthy or a falsey value.&lt;/p&gt;&#xA;&lt;h2&gt;What to do?&lt;/h2&gt;&#xA;&lt;p&gt;Basically implement an NFA.&lt;br&gt;&#xA;That is, read every single character (ie every number) from left to right and for each one of them look whether there exist a transition from your current state using this character. If so follow it and repeat the process for the next letter. If you face an empty list, your current state must be in the list of accepted states if it is output true and stop examining other paths if it isn't continue examining the other options. If you get stuck  (ie the word isn't empty but there's no way to continue), output false.&lt;/p&gt;&#xA;&lt;h2&gt;Who wins?&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest answer in bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;For the following examples I'm going to use this automaton:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/EIot4.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/EIot4.png&quot; alt=&quot;Example NFA&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;which has starting state &lt;code&gt;10&lt;/code&gt;, accepting states &lt;code&gt;[13]&lt;/code&gt; and transitions&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[(10,4,11),&#xA;(11,4,11),&#xA;(11,1,12),&#xA;(12,1,12),&#xA;(12,3,13),&#xA;(13,3,13),&#xA;(11,3,13)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;These three parameters are assumed to be also passed in the examples. Word examples for this automaton are:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1,2,3,4] -&amp;gt; false&#xA;[4,1,3,4] -&amp;gt; false&#xA;[4,1,3] -&amp;gt; true&#xA;[4,1,3,3,3] -&amp;gt; true&#xA;[2,1,3,4,3,2] -&amp;gt; false&#xA;[4,1,4] -&amp;gt; false&#xA;[4,3,1] -&amp;gt; false&#xA;[4,3,3] -&amp;gt; true&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="55329" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-19T11:21:44.833" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11303" PostTypeId="1" CreationDate="2017-01-19T13:02:36.543" Score="1" ViewCount="117" Body="&lt;p&gt;I already have 20 reputations (which is the points to get chat) but I can't still chat. Why can't I?&lt;/p&gt;&#xA;" OwnerUserId="64499" LastEditorUserId="68942" LastEditDate="2021-06-05T23:21:10.327" LastActivityDate="2021-06-05T23:21:10.327" Title="Why can't I chat, even though having 20 reputations?" Tags="|support|bug|status-norepro|chat|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11304" PostTypeId="2" ParentId="11303" CreationDate="2017-01-19T13:13:12.557" Score="9" Body="&lt;p&gt;According to &lt;a href=&quot;https://codegolf.stackexchange.com/users/64499/matthew-roh?tab=reputation&quot;&gt;your profile&lt;/a&gt;, you passed the 20 rep threshold 15 minutes ago. So, blame caching. The system sometimes takes a little bit of time to catch up and award privileges.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2017-01-19T13:13:12.557" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11305" PostTypeId="2" ParentId="2140" CreationDate="2017-01-19T14:10:24.700" Score="0" Body="&lt;h1&gt;Simulate a vibrating string&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Vibrations are an integral part of physics.  In this challenge, you will be implementing a simulation of a vibrating string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is actually rather easy to do as a result of the &lt;a href=&quot;https://en.wikipedia.org/wiki/Huygens%E2%80%93Fresnel_principle&quot; rel=&quot;nofollow noreferrer&quot;&gt;Huygens–Fresnel principle&lt;/a&gt;, which allows us to use a simulation process similar to cellular automata.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(don't have time to write a full spec right now.  Also, I have a 2D version working but figured 1D was enough for a challenge)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Below is an example of a string vibrating at its second harmonic, with each row being 1 tick of the simulation.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  1.00  2.00  1.00 -1.00 -2.00 -1.00&#xA;  0.95  1.90  0.95 -0.95 -1.90 -0.95&#xA;  0.85  1.70  0.85 -0.85 -1.70 -0.85&#xA;  0.71  1.42  0.71 -0.71 -1.42 -0.71&#xA;  0.54  1.07  0.54 -0.54 -1.07 -0.54&#xA;  0.33  0.67  0.33 -0.33 -0.67 -0.33&#xA;  0.11  0.23  0.11 -0.11 -0.23 -0.11&#xA; -0.11 -0.22 -0.11  0.11  0.22  0.11&#xA; -0.33 -0.66 -0.33  0.33  0.66  0.33&#xA; -0.53 -1.07 -0.53  0.53  1.07  0.53&#xA; -0.71 -1.42 -0.71  0.71  1.42  0.71&#xA; -0.85 -1.70 -0.85  0.85  1.70  0.85&#xA; -0.95 -1.90 -0.95  0.95  1.90  0.95&#xA; -1.00 -2.00 -1.00  1.00  2.00  1.00&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This challenge is based off the math found on &lt;a href=&quot;http://www.mtnmath.com/whatrh/node66.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;this website&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2017-01-19T14:10:24.700" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11306" PostTypeId="2" ParentId="2140" CreationDate="2017-01-19T15:03:07.280" Score="-2" Body="&lt;h1&gt;Generate &quot;N&quot; random numbers which their sum is exactly &quot;N&quot;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your goal is to generate &lt;code&gt;N&lt;/code&gt; pseudo-random numbers &lt;code&gt;R&lt;/code&gt;, then sum or subtract all the &lt;code&gt;R&lt;/code&gt; togheter and obtain as result &lt;code&gt;N&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You get &lt;code&gt;N&lt;/code&gt; from standard input as integer number, such as &lt;code&gt;N &amp;lt;= 1000&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You can't perform operations like sum &lt;code&gt;100&lt;/code&gt; times &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;50&lt;/code&gt; times &lt;code&gt;2&lt;/code&gt;, or similar...&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;R&lt;/code&gt; shall be generated in any reasonable non-deterministic way&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;R&lt;/code&gt; shall be integer such as &lt;code&gt;0 &amp;lt;= R &amp;lt;= N&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;R&lt;/code&gt; can't have a constant value each time you generate it. For example you can't generate &lt;code&gt;R&lt;/code&gt; with methods like &lt;code&gt;R = rand(1,2)&lt;/code&gt; with the result that &lt;code&gt;1 &amp;lt;= R &amp;lt; 2&lt;/code&gt; (&lt;code&gt;R&lt;/code&gt; is constantly always &lt;code&gt;=1&lt;/code&gt;), and then sum &lt;code&gt;R&lt;/code&gt; 100 times.&lt;/li&gt;&#xA;&lt;li&gt;You can perform only sums or subtractions of the generated &lt;code&gt;R&lt;/code&gt;'s.&lt;/li&gt;&#xA;&lt;li&gt;You &lt;strong&gt;have to&lt;/strong&gt; sum or subtract the newly generated &lt;code&gt;R&lt;/code&gt; to the total of &lt;code&gt;R&lt;/code&gt;'s.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest code wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 1:&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Get &lt;code&gt;N=100&lt;/code&gt; from standard input.&lt;/li&gt;&#xA;&lt;li&gt;Generate &lt;code&gt;100&lt;/code&gt; pseudo-random integer numbers &lt;code&gt;R&lt;/code&gt; such as &lt;code&gt;0 &amp;lt;= R &amp;lt;= 100&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Sum or subtract all the &lt;code&gt;R&lt;/code&gt; and obtain &lt;code&gt;100&lt;/code&gt;(&lt;code&gt;N&lt;/code&gt;) as result.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 2:&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Get &lt;code&gt;N=20&lt;/code&gt; from standard input.&lt;/li&gt;&#xA;&lt;li&gt;Generate &lt;code&gt;20&lt;/code&gt; pseudo-random integer numbers &lt;code&gt;R&lt;/code&gt; such as &lt;code&gt;0 &amp;lt;= R &amp;lt;= 20&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Sum or subtract all the &lt;code&gt;R&lt;/code&gt; and obtain &lt;code&gt;20&lt;/code&gt;(&lt;code&gt;N&lt;/code&gt;) as result.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Not-so-smart-but-working example in C#:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;using System;           &#xA;public class Program {&#xA;    public static void Main() {&#xA;        int S = 0, N, R = 1, X;&#xA;        int INPUT = Int32.Parse(Console.ReadLine());&#xA;        Random rnd = new Random();&#xA;        for (int I = 1; I &amp;lt; (INPUT+1); I++) {&#xA;            X = (INPUT+1) - I;&#xA;            if (I == INPUT &amp;amp;&amp;amp; S == INPUT) {&#xA;                R = 0;&#xA;            }&#xA;            N = rnd.Next(R, X);&#xA;            if (S &amp;lt;= INPUT) {&#xA;                S = S + N;&#xA;            } else {&#xA;                S = S - N;&#xA;            }&#xA;            Console.WriteLine(&quot;I = {0}      N = {1}     S = {2}&quot;, I, N, S);&#xA;        }&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://dotnetfiddle.net/H8eeR6&quot; rel=&quot;nofollow noreferrer&quot;&gt;Test online&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Tags:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="59718" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2017-01-20T08:00:30.080" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="11308" PostTypeId="2" ParentId="2140" CreationDate="2017-01-19T19:31:03.037" Score="0" Body="&lt;h1&gt;loripsum.net&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The purpose of this challenge is to emulate the functionality of the loripsum.net website. This website takes in a &quot;number of paragraphs&quot; and a list of randomized HTML5 stylizations and outputs a pre-formatted HTML5 lorem ipsum text that is REALLY good for placeholders on a prototype website. Your code, however, will focus more on the stylization aspect of this website. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Given a block of lorem ipsum text in the following format:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;&amp;lt;segment&amp;gt; := &amp;lt;paragraph&amp;gt; | &amp;lt;paragraph&amp;gt;&amp;lt;new-line&amp;gt;&amp;lt;segment&amp;gt;&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;&amp;lt;paragraph&amp;gt; := &amp;lt;sentence&amp;gt; | &amp;lt;sentence&amp;gt;&amp;lt;paragraph&amp;gt;&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;&amp;lt;sentence&amp;gt; := &amp;lt;character_run&amp;gt;&amp;lt;sentence_end&amp;gt;&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;&amp;lt;character_run&amp;gt; := &amp;lt;printable_ascii_without_newline_or_period&amp;gt;|&amp;lt;pawnop&amp;gt;&amp;lt;character_run&amp;gt;&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;&amp;lt;sentence_end&amp;gt; := \n | . | ? | !&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Here's an example of a possible input:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Lorem ipsum dolor sit amet, consectetur adipiscing elit. Quonam,&#xA;  inquit, modo? Progredientibus autem aetatibus sensim tardeve potius&#xA;  quasi nosmet ipsos cognoscimus. Quod non faceret, si in voluptate&#xA;  summum bonum poneret. Duo Reges: constructio interrete.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Tubulo putas dicere? Cum salvum esse flentes sui respondissent,&#xA;  rogavit essentne fusi hostes. Dat enim intervalla et relaxat. Satisne&#xA;  ergo pudori consulat, si quis sine teste libidini pareat? Negare non&#xA;  possum. An hoc usque quaque, aliter in vita? Plane idem, inquit, et&#xA;  maxima quidem, qua fieri nulla maior potest. Quid ei reliquisti, nisi&#xA;  te, quoquo modo loqueretur, intellegere, quid diceret?&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Itaque ad tempus ad Pisonem omnes. Universa enim illorum ratione cum&#xA;  tota vestra confligendum puto. Haec dicuntur inconstantissime. Dicimus&#xA;  aliquem hilare vivere; Qui non moveatur et offensione turpitudinis et&#xA;  comprobatione honestatis? Sed quot homines, tot sententiae; Quippe:&#xA;  habes enim a rhetoribus; Omnes enim iucundum motum, quo sensus&#xA;  hilaretur. Tria genera bonorum; Profectus in exilium Tubulus statim&#xA;  nec respondere ausus;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Certe non potest. Dempta enim aeternitate nihilo beatior Iuppiter quam&#xA;  Epicurus; Graece donan, Latine voluptatem vocant. Itaque a sapientia&#xA;  praecipitur se ipsam, si usus sit, sapiens ut relinquat. Quid est&#xA;  igitur, inquit, quod requiras? Atque haec coniunctio confusioque&#xA;  virtutum tamen a philosophis ratione quadam distinguitur. Ego vero&#xA;  volo in virtute vim esse quam maximam;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Verum hoc idem saepe faciamus. Huic mori optimum esse propter&#xA;  desperationem sapientiae, illi propter spem vivere. Si enim ita est,&#xA;  vide ne facinus facias, cum mori suadeas. Indicant pueri, in quibus ut&#xA;  in speculis natura cernitur. Apparet statim, quae sint officia, quae&#xA;  actiones. An est aliquid per se ipsum flagitiosum, etiamsi nulla&#xA;  comitetur infamia? Non autem hoc: igitur ne illud quidem. Res enim se&#xA;  praeclare habebat, et quidem in utraque parte.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Your task, given the input &lt;code&gt;t&lt;/code&gt; from above, is to apply one formatting operations at random once per paragraph, defined by the following list of operations:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Character Run Operations&lt;/strong&gt; (Should be performed on 1-5 word runs chosen at random. This should NEVER cross sentence boundaries (\n|.|?|!))&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bold &lt;code&gt;&amp;lt;b&amp;gt;&amp;lt;/b&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Italic &lt;code&gt;&amp;lt;i&amp;gt;&amp;lt;/i&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Underline &lt;code&gt;&amp;lt;u&amp;gt;&amp;lt;/u&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Sentence Operations&lt;/strong&gt; (Should be performed on 1-2 sentences in the paragraph)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Block Quote &lt;code&gt;&amp;lt;blockquote&amp;gt;&amp;lt;/blockquote&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Preface &lt;code&gt;&amp;lt;pre&amp;gt;&amp;lt;/pre&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Heading &lt;code&gt;&amp;lt;h1&amp;gt;&amp;lt;/h1&amp;gt; ... &amp;lt;h6&amp;gt;&amp;lt;/h6&amp;gt;&lt;/code&gt; (Chosen at random)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Paragraph Operations&lt;/strong&gt; (Should turn entire paragraph into this format, separated by sentences if the operation is segmented (like a list)).&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Unordered List &lt;code&gt;&amp;lt;ul&amp;gt;&amp;lt;li&amp;gt;Sentence 1&amp;lt;/li&amp;gt;...&amp;lt;li&amp;gt;Sentence n&amp;lt;/li&amp;gt;&amp;lt;/ul&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Ordered List &lt;code&gt;&amp;lt;ol&amp;gt;&amp;lt;li&amp;gt;Sentence 1&amp;lt;/li&amp;gt;...&amp;lt;li&amp;gt;Sentence n&amp;lt;/li&amp;gt;&amp;lt;/ol&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So, here is one possible random output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1:HEADING(h1 chosen),2:BOLD(4 times),3:PREFACE(1 sentence),4:UNORDERED-LIST,5:BLOCKQUOTE(2 sentences)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Applied to the input from above (&lt;code&gt;t&lt;/code&gt;):&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Lorem ipsum dolor sit amet, consectetur adipiscing elit.&lt;/h1&gt;&#xA;  &#xA;  &lt;p&gt;Quonam, inquit, modo? Progredientibus autem aetatibus sensim tardeve&#xA;  potius quasi nosmet ipsos cognoscimus. Quod non faceret, si in&#xA;  voluptate summum bonum poneret. Duo Reges: constructio interrete.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Tubulo &lt;b&gt;putas dicere&lt;/b&gt;? Cum salvum esse flentes sui respondissent,&#xA;  rogavit &lt;b&gt;essentne fusi&lt;/b&gt; hostes. Dat enim intervalla et relaxat.&#xA;  &lt;b&gt;Satisne ergo pudori consulat, si quis sine&lt;/b&gt; teste libidini&#xA;  pareat? Negare non possum. An hoc usque quaque, aliter in &lt;b&gt;vita&lt;/b&gt;?&#xA;  Plane idem, inquit, et maxima quidem, qua fieri nulla maior potest.&#xA;  Quid ei reliquisti, nisi te, quoquo modo loqueretur, intellegere, quid&#xA;  diceret?&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Itaque ad tempus ad Pisonem omnes. Universa enim illorum ratione cum&#xA;  tota vestra confligendum puto. Haec dicuntur inconstantissime. Dicimus&#xA;  aliquem hilare vivere; Qui non moveatur et offensione turpitudinis et&#xA;  comprobatione honestatis? &lt;pre&gt;Sed quot homines, tot sententiae;&#xA;Quippe: habes enim a rhetoribus; Omnes enim iucundum motum, quo sensus&#xA;hilaretur.&lt;/pre&gt; Tria genera bonorum; Profectus in exilium Tubulus&#xA;  statim nec respondere ausus;&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&lt;li&gt;Certe non potest.&lt;/li&gt;&lt;li&gt;Dempta enim aeternitate nihilo&#xA;  beatior Iuppiter quam Epicurus; Graece donan, Latine voluptatem&#xA;  vocant.&lt;/li&gt;&lt;li&gt;Itaque a sapientia praecipitur se ipsam, si usus sit,&#xA;  sapiens ut relinquat.&lt;/li&gt;&lt;li&gt;Quid est igitur, inquit, quod requiras?&#xA;  Atque haec coniunctio confusioque virtutum tamen a philosophis ratione&#xA;  quadam distinguitur.&lt;/li&gt;&lt;li&gt;Ego vero volo in virtute vim esse quam&#xA;  maximam;&lt;/li&gt;&lt;/ul&gt;&#xA;  &#xA;  &lt;p&gt;&lt;blockquote&gt;Verum hoc idem saepe faciamus. Huic mori optimum esse&#xA;  propter desperationem sapientiae, illi propter spem&#xA;  vivere.&lt;/blockquote&gt;Si enim ita est, vide ne facinus facias, cum mori&#xA;  suadeas. Indicant pueri, in quibus ut in speculis natura cernitur.&#xA;  Apparet statim, quae sint officia, quae actiones. An est aliquid per&#xA;  se ipsum flagitiosum, etiamsi nulla comitetur infamia? Non autem hoc:&#xA;  igitur ne illud quidem. Res enim se praeclare habebat, et quidem in&#xA;  utraque parte.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Wow! Isn't that much prettier? Here's the code view:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;h1&amp;gt;Lorem ipsum dolor sit amet, consectetur adipiscing elit.&amp;lt;/h1&amp;gt; Quonam, inquit, modo? Progredientibus autem aetatibus sensim tardeve potius quasi nosmet ipsos cognoscimus. Quod non faceret, si in voluptate summum bonum poneret. Duo Reges: constructio interrete.&#xA;&#xA;Tubulo &amp;lt;b&amp;gt;putas dicere&amp;lt;/b&amp;gt;? Cum salvum esse flentes sui respondissent, rogavit &amp;lt;b&amp;gt;essentne fusi&amp;lt;/b&amp;gt; hostes. Dat enim intervalla et relaxat. &amp;lt;b&amp;gt;Satisne ergo pudori consulat, si quis sine&amp;lt;/b&amp;gt; teste libidini pareat? Negare non possum. An hoc usque quaque, aliter in &amp;lt;b&amp;gt;vita&amp;lt;/b&amp;gt;? Plane idem, inquit, et maxima quidem, qua fieri nulla maior potest. Quid ei reliquisti, nisi te, quoquo modo loqueretur, intellegere, quid diceret?&#xA;&#xA;Itaque ad tempus ad Pisonem omnes. Universa enim illorum ratione cum tota vestra confligendum puto. Haec dicuntur inconstantissime. Dicimus aliquem hilare vivere; Qui non moveatur et offensione turpitudinis et comprobatione honestatis? &amp;lt;pre&amp;gt;Sed quot homines, tot sententiae; Quippe: habes enim a rhetoribus; Omnes enim iucundum motum, quo sensus hilaretur.&amp;lt;/pre&amp;gt; Tria genera bonorum; Profectus in exilium Tubulus statim nec respondere ausus;&#xA;&#xA;&amp;lt;ul&amp;gt;&amp;lt;li&amp;gt;Certe non potest.&amp;lt;/li&amp;gt;&amp;lt;li&amp;gt;Dempta enim aeternitate nihilo beatior Iuppiter quam Epicurus; Graece donan, Latine voluptatem vocant.&amp;lt;/li&amp;gt;&amp;lt;li&amp;gt;Itaque a sapientia praecipitur se ipsam, si usus sit, sapiens ut relinquat.&amp;lt;/li&amp;gt;&amp;lt;li&amp;gt;Quid est igitur, inquit, quod requiras? Atque haec coniunctio confusioque virtutum tamen a philosophis ratione quadam distinguitur.&amp;lt;/li&amp;gt;&amp;lt;li&amp;gt;Ego vero volo in virtute vim esse quam maximam;&amp;lt;/li&amp;gt;&amp;lt;/ul&amp;gt;&#xA;&#xA;&amp;lt;blockquote&amp;gt;Verum hoc idem saepe faciamus. Huic mori optimum esse propter desperationem sapientiae, illi propter spem vivere.&amp;lt;/blockquote&amp;gt;Si enim ita est, vide ne facinus facias, cum mori suadeas. Indicant pueri, in quibus ut in speculis natura cernitur. Apparet statim, quae sint officia, quae actiones. An est aliquid per se ipsum flagitiosum, etiamsi nulla comitetur infamia? Non autem hoc: igitur ne illud quidem. Res enim se praeclare habebat, et quidem in utraque parte.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Take note specifically of how I split the sentences on the paragraph operators, you delimit by ONLY periods and NEWLINES, nothing else ends a sentence. Also, make not of how the character run operators can span multiple words, BUT NOT MULTIPLE SENTENCES, you must stop before the next sentence begins (EXCLUDING THE ENDING NEWLINE OR PERIOD). As in, it's only applicable to the &lt;code&gt;&amp;lt;character_run&amp;gt;&lt;/code&gt; language definition.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; lowest byte-count will be declared the winner.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="59376" LastEditDate="2017-01-20T18:21:23.157" LastActivityDate="2017-01-20T18:21:23.157" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11309" PostTypeId="1" AcceptedAnswerId="11311" CreationDate="2017-01-19T21:28:08.700" Score="28" ViewCount="435" Body="&lt;p&gt;I recently necro-bumped an &lt;a href=&quot;https://codegolf.stackexchange.com/q/11263/31224&quot;&gt;old challenge&lt;/a&gt; from almost 4 years ago. I had an idea to start a similar challenge, but decided to just answer that challenge instead.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there anything wrong with digging up such old posts? My main concerns were that the original asker may not be active anymore to answer questions about the challenge, and it seems like common post formatting has changed (apparently people didn't specify &quot;bytes&quot; 4 years ago?).&lt;/p&gt;&#xA;" OwnerUserId="31224" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2017-01-19T21:35:10.893" Title="Anything wrong with necro-bumping?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11311" PostTypeId="2" ParentId="11309" CreationDate="2017-01-19T21:35:10.893" Score="40" Body="&lt;p&gt;There's nothing wrong with submitting answers to old challenges. We don't have any silly necroposting rules. In fact, you can even get some shiny rewards for it.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The bronze &lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/59/revival&quot;&gt;revival badge&lt;/a&gt; is awarded for answering more than 30 days after a question was asked as first answer scoring 2 or more.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The silver &lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/44/necromancer&quot;&gt;necromancer badge&lt;/a&gt; is awarded for answering a question more than 60 days later with score of 5 or more.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;It seems like common post formatting has changed (apparently people didn't specify &quot;bytes&quot; 4 years ago?).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Don't worry about it. The de facto default used to be characters, but we made bytes an explicit default some time ago. Just format your answer like you would if the challenge had been posted today.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2017-01-19T21:35:10.893" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11313" PostTypeId="2" ParentId="2140" CreationDate="2017-01-20T00:53:26.033" Score="0" Body="&lt;h1&gt;Task Scheduling &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given as input:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A unix time at which to first run the program&lt;/li&gt;&#xA;&lt;li&gt;Delay between runs (can be &lt;code&gt;0&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Number of times to run the program (&lt;code&gt;-1&lt;/code&gt; if infinite)&lt;/li&gt;&#xA;&lt;li&gt;A program to be run through the console when triggered&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Run the program under specified conditions.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can assume your program will always be running&lt;/li&gt;&#xA;&lt;li&gt;Run the equivalent of &lt;code&gt;nohup &amp;lt;command&amp;gt; &amp;amp;&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2017-01-20T00:53:26.033" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11314" PostTypeId="2" ParentId="2140" CreationDate="2017-01-20T04:03:10.170" Score="0" Body="&lt;h2&gt;Binary beads &lt;s&gt;clock&lt;/s&gt;&lt;/h2&gt;&#xA;&lt;p&gt;The challenge is dedicated to pseudo-graphical representation of objects, e.g. like by ascii-art.&#xA;Puzzle is geometrical: to represent bistrings as beads using tiles.&#xA;The result must be beads-like strings where one is more like a bead and zero is more like a stem (or smaller bead).&#xA;The solution can result in wide variety of visual concept but there are specific guides, see below.&lt;/p&gt;&#xA;&lt;p&gt;A simple example of binary beads using single tiles, here standard characters:&lt;br /&gt;&#xA;Input: 1001, 0101, 0011.&lt;br /&gt;&#xA;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;s--s&#xA;-s-s&#xA;--ss&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or e.g. &lt;a href=&quot;https://en.wikipedia.org/wiki/PETSCII&quot; rel=&quot;nofollow noreferrer&quot;&gt;PETSCII&lt;/a&gt; console:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ZRYbI.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZRYbI.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;So these are only example form, but now you must &amp;quot;upscale&amp;quot; it, but since&#xA;you are not in graphical mode, the resulting image must be structure of source units, i.e. it must be a rectangular tiling.&#xA;In other words. it is not allowed just to draw sprites for each next upscale step. So the whole must be&#xA;a real console app or code which emulates the console behaviour itself within the guidelines.&#xA;So you can draw any tiles and use them also. Solution should show some reference to console output,&#xA;e.g. if using graphical lib, a &amp;quot;print&amp;quot; function should be made which takes the data.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;The task is to write an application or function wich draws scalable yet visually consistent beads with efective&#xA;usage of tiles. Tilesets with least amount of tiles and yet with outstanding rich beads look must win. In other words, one should find good relation between tiles amount and good possibility to present different sizes.&lt;/p&gt;&#xA;&lt;p&gt;One can present different length strings, but the whole layout must be of adequate size. Multiple words on line is allowed and even welcome especially if shows interesting use case.&lt;br /&gt;&#xA;Usage of graphical libs is welcome, e.g. to emulate a simple console-like output.&lt;br /&gt;&#xA;All tiles can be custom, i.e. this should not be necessarily standard characters of console. In real console any characters possible can be used or patched with custom tiles if possible.&#xA;Any OS can be used.&lt;/p&gt;&#xA;&lt;h2&gt;Restrictions:&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Final image&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;must include at least 2 different types of beads (different sizes), i.e. interesting scalability example&lt;/li&gt;&#xA;&lt;li&gt;each bead type &lt;em&gt;must share&lt;/em&gt; some tiles with other beads&lt;/li&gt;&#xA;&lt;li&gt;structures should be good visible from various distance and contiguos as possible&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;zero=stem, ones=bead&amp;quot; rule is &lt;em&gt;not&lt;/em&gt; strict, creativity is very welcome but it should be not too far from rule to compare results&lt;/li&gt;&#xA;&lt;li&gt;artiscism in forms is always bonus points!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Tiles&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;maximal amount of tiles in the tileset : &lt;strong&gt;16&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;are &lt;strong&gt;rectangular&lt;/strong&gt;, e.g 16x8, 8x8 pixels ...&lt;/li&gt;&#xA;&lt;li&gt;minimal size: 6x6, maximal size: 24x24 pixels&lt;/li&gt;&#xA;&lt;li&gt;only two-color but the whole image can have more colors.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Code&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Non-cryptic plain code: C, Python, Basic, Fortran and those not too far from it&lt;/li&gt;&#xA;&lt;li&gt;hacks (e.g. for old platforms) should be documented somehow and reproducable in theory&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Points given for:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;less unique tiles yet with rich possibilities&lt;/li&gt;&#xA;&lt;li&gt;visual consistence by each beads type presented, but two types must &lt;em&gt;not&lt;/em&gt; necesserily have same style&lt;/li&gt;&#xA;&lt;li&gt;Hint: even within one type, the look of one bead can vary but the whole string easily decodable&lt;/li&gt;&#xA;&lt;li&gt;interesting scaling possibilities, e.g. parametric scaling&lt;/li&gt;&#xA;&lt;li&gt;fullfill the restrictions&lt;/li&gt;&#xA;&lt;li&gt;less operations and minimalistic code&lt;/li&gt;&#xA;&lt;li&gt;working application, e.g. interactive counter or a micro-game is welcome&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Solution publishing:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;title: amount of tiles used and pixel sizes info&lt;/li&gt;&#xA;&lt;li&gt;visual examples easy to follow&lt;/li&gt;&#xA;&lt;li&gt;notes about interesting sides of solution&lt;/li&gt;&#xA;&lt;li&gt;code and some explanation&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox note:&lt;/strong&gt;&#xA;If there are unclear point, free to point to corrections.&#xA;Please suppose better tags if needed.&lt;/p&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tiling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tiling&amp;#39;&quot; rel=&quot;tag&quot;&gt;tiling&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/typography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;typography&amp;#39;&quot; rel=&quot;tag&quot;&gt;typography&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary&amp;#39;&quot; rel=&quot;tag&quot;&gt;binary&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="64634" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-23T01:52:23.713" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11315" PostTypeId="2" ParentId="1213" CreationDate="2017-01-20T10:29:53.570" Score="8" Body="&lt;h1&gt;Minecraft (Java Edition)&lt;/h1&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Create a Mojang account at &lt;a href=&quot;https://minecraft.net/store/minecraft/#register&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://minecraft.net/store/minecraft/#register&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Download the Minecraft launcher from &lt;a href=&quot;https://minecraft.net/download/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://minecraft.net/download/&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Login with your account and install the demo version (unless you want to pay for it)&lt;/li&gt;&#xA;&lt;li&gt;Start a demo world. You now have 90 minutes to build and test the submission, after that the world will be reset.&lt;/li&gt;&#xA;&lt;li&gt;Press &lt;kbd&gt;esc&lt;/kbd&gt; and open a LAN world to enable cheats.&lt;/li&gt;&#xA;&lt;li&gt;Press &lt;kbd&gt;T&lt;/kbd&gt; to open the chat and type &lt;code&gt;/gamemode creative&lt;/code&gt; to set yourself to creative mode.&lt;/li&gt;&#xA;&lt;li&gt;If you need command blocks, type &lt;code&gt;/give @p command_block&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="46901" LastEditorUserId="97857" LastEditDate="2021-09-26T16:40:17.633" LastActivityDate="2021-09-26T16:40:17.633" CommentCount="1" CommunityOwnedDate="2017-01-20T10:29:53.570" ContentLicense="CC BY-SA 4.0" />
  <row Id="11316" PostTypeId="1" CreationDate="2017-01-20T11:56:51.610" Score="0" ViewCount="80" Body="&lt;p&gt;Are there PCG challenges where &quot;general purpose&quot; or &quot;commonly used&quot; [*] programming languages do better than the special PCG targetted languages?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this in itself an interesting meta challenge?  I certainly find it so, though I haven't been able to come up with a concrete idea yet!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[*] Let's say: languages on &lt;a href=&quot;http://pypl.github.io/PYPL.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;this list&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="14667" LastActivityDate="2017-01-20T11:56:51.610" Title="A meta PCG question (challenge?)" Tags="|discussion|code-golf|" AnswerCount="0" CommentCount="3" ClosedDate="2017-01-20T14:18:30.067" ContentLicense="CC BY-SA 3.0" />
  <row Id="11317" PostTypeId="2" ParentId="2447" CreationDate="2017-01-20T14:35:26.783" Score="19" Body="&lt;h1&gt;Functions may return a function that returns the result&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is very similar to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8427&quot;&gt;currying&lt;/a&gt;, the only difference being that only the first call includes an argument. Sometimes it's useful to curry a recursive function that has only one argument, especially if that argument doesn't need to be modified to find the result. For example, each of these JavaScript functions returns the bit-length of a positive integer:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f=(n,x)=&amp;gt;n?f(n&amp;gt;&amp;gt;1,-~x):x&#xA;f=(n,x)=&amp;gt;n&amp;gt;&amp;gt;x?f(n,-~x):x&#xA;n=&amp;gt;f=x=&amp;gt;n&amp;gt;&amp;gt;x?f(-~x):x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;All three functions can be called by assigning them to &lt;code&gt;g&lt;/code&gt; and calling them with e.g. &lt;code&gt;g(49)&lt;/code&gt;; however, the third version must be called again with &lt;code&gt;g(49)()&lt;/code&gt; to actually return the result. Again, this is very similar to currying, where the arguments are passed separately (&lt;code&gt;g(a)(b)&lt;/code&gt; rather than &lt;code&gt;g(a,b)&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that no additional input should be needed to get the result (i.e. &quot;to call on a number &lt;code&gt;x&lt;/code&gt;, use &lt;code&gt;f(x)(2)&lt;/code&gt;&quot;). Optional arguments are fine, of course (&lt;code&gt;x=&amp;gt;(y=2)=&amp;gt;x+y&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is also a meta post about this &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11153/42545&quot;&gt;here&lt;/a&gt;, though it was closed as a duplicate of this question.&lt;/p&gt;&#xA;" OwnerUserId="42545" LastEditorUserId="42545" LastEditDate="2017-03-20T16:35:55.520" LastActivityDate="2017-03-20T16:35:55.520" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11318" PostTypeId="2" ParentId="2140" CreationDate="2017-01-20T15:21:17.670" Score="0" Body="&lt;h2&gt;The many names of Túrin&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Tolkien's character Túrin had a multiple personality disorder and consequently needed to change name on a regular basis to be called by something fitting its current mood. He has been known as &lt;em&gt;Turambar&lt;/em&gt;, &lt;em&gt;Mormegil&lt;/em&gt;, &lt;em&gt;Gorthol&lt;/em&gt;, &lt;em&gt;Adanedhel&lt;/em&gt;, &lt;em&gt;Dagnir Glaurunga&lt;/em&gt;, &lt;em&gt;the Wildman of the Woods&lt;/em&gt;, &lt;em&gt;Neithan&lt;/em&gt; and some other unofficial nicknames alluding to his tenderness for his sister.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This must have been a real headache for the author: not only had he to find the new names but he also had to remember the translation in English&lt;sup&gt;1&lt;/sup&gt;, since every new name is introduced along the lines of &quot;From this day he was known as [&lt;em&gt;Compound_Elvish_word&lt;/em&gt;], that is [&lt;em&gt;Word of word&lt;/em&gt;]&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to automatize the production of epithets to help Tolkien finish his Unfinished Tales.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a list of Sindarin&lt;sup&gt;2&lt;/sup&gt; substantives and their English translations (see list below) as an external file, a list or any reasonable format, &lt;strong&gt;randomly&lt;/strong&gt; take two Sindarin substantives (repetition is possible) and print&#xA;&lt;em&gt;&quot;From this day he was known as &lt;strong&gt;Sindarin1sindarin2&lt;/strong&gt;, that is &lt;strong&gt;English2&lt;/strong&gt; of &lt;strong&gt;English1&lt;/strong&gt;&quot;&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Note the &lt;strong&gt;inversion&lt;/strong&gt; of words in the translation, and the &lt;strong&gt;capitalisation&lt;/strong&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;: none&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;: A string&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The list:&lt;/strong&gt;&#xA;(names can be capitalized in your own list, but the formatting must be consistent. The order of the couples can also be changed)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Sindarin    English&#xA;--------------------&#xA;amarth      fate&#xA;ang         iron&#xA;aur         morning&#xA;brethil     birch&#xA;carch       fang&#xA;celeb       silver&#xA;draug       wolf&#xA;galad       glittering&#xA;glor        light&#xA;gwathel     sister&#xA;manadh      doom&#xA;megil       sword&#xA;melethron   lover&#xA;mor         darkness&#xA;naur        flame&#xA;taur        forest&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;From this day he was known as Galadaur, that is Morning of&#xA;Glittering&lt;/li&gt;&#xA;&lt;li&gt;From this day he was known as Mormelethron, that is Lover&#xA;of Darkness&lt;/li&gt;&#xA;&lt;li&gt;From this day he was known as Draugdraug, that is Wolf of&#xA;Wolf&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Hobbits played golf and Codë was the Vala of challenges in the Silmarillion, so this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; Sorry, Tolkien specialists, I'm probably massacring Quenya, Sindarin and many other concepts&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;2&lt;/sup&gt; I think&lt;/p&gt;&#xA;" OwnerUserId="47872" LastEditorUserId="47872" LastEditDate="2017-01-20T15:48:19.547" LastActivityDate="2017-01-20T15:48:19.547" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11320" PostTypeId="1" CreationDate="2017-01-20T16:50:45.880" Score="15" ViewCount="827" Body="&lt;p&gt;It was decided by community consensus that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10920/45941&quot;&gt;we need more room owners for The Nineteenth Byte&lt;/a&gt;. The process for choosing the new room owners will be as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For one week (lasting until UTC midnight on January 28th), nominations will be accepted on this meta post. The votes on the nominations here will not matter. Self-nominations are allowed. If you are nominated by someone else, you must accept the nomination to be considered a candidate (we don't want to elect someone who doesn't actually want the position).&lt;/li&gt;&#xA;&lt;li&gt;After the nomination period, the election will begin, lasting for one week (until UTC midnight on February 4th). At the end of the election, the 4 candidates with the most votes will be submitted to the moderators and current room owners for approval and instatement as new room owners.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In each nomination post, please include:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The user being nominated&lt;/li&gt;&#xA;&lt;li&gt;Common active times in chat&lt;/li&gt;&#xA;&lt;li&gt;A short blurb about why the user is a good choice for becoming a room owner&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2017-02-01T04:22:34.750" Title="New TNB Room Owners: Nominations Phase" Tags="|discussion|chat|moderation|" AnswerCount="5" CommentCount="29" ContentLicense="CC BY-SA 3.0" />
  <row Id="11321" PostTypeId="2" ParentId="2140" CreationDate="2017-01-20T17:08:18.877" Score="0" Body="&lt;h1&gt;Minimum exchange of bills&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;You're at the supermarket, buying groceries for the week.  At the end, the cashier rings up your cart and declares that your total cost is exactly &lt;code&gt;$76&lt;/code&gt;.  You reach into your wallet, and find a &lt;code&gt;$50&lt;/code&gt;, four &lt;code&gt;$20s&lt;/code&gt;, and a &lt;code&gt;$1&lt;/code&gt;, for a total of six bills.&lt;/p&gt;&#xA;&lt;p&gt;We consider a &lt;code&gt;transaction&lt;/code&gt; to be you paying money to the cashier, and the cashier giving you your change (if applicable).  Your &lt;code&gt;total&lt;/code&gt; for a transaction is the net amount of money you owe the cashier, which is calculated by the &lt;code&gt;amount you pay&lt;/code&gt; less &lt;code&gt;the amount of change you get&lt;/code&gt;.  We can think of a transaction as adding the bills you pay to the cashier, and subtracting the bills you get in return.  Thus, the following is a non-exhaustive list of possible transactions in this scenario:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;$50 + $20 + $20 - $10 - $1 - $1 - $1 - $1 (8 bills)&#xA;$20 + $20 + $20 + $20 - $1 - $1 - $1 - $1 (8 bills)&#xA;$20 + $20 + $20 + $20 + $1 - $5           (6 bills)&#xA;$50 + $20 + $20 + $1 - $10 - $5           (6 bills)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Given a total of $76, and having 1 $50, 4 $20s, and 1 $1, the minimum exchange of bills comes out to 6 bills.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given an integer &lt;code&gt;Bill&lt;/code&gt; and a list of bills in your wallet &lt;code&gt;[Ones Fives Tens Twenties Fifties Hundreds]&lt;/code&gt;, calculate the number of bills in a minimum exchange of bills between you and the cashier.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Your program can accept your input in any reasonable way.  You can accept an integer followed by a list of six integers separated by reasonable means. You can accept seven integers separated by any reasonable means. If your language cannot accept input in any reasonable form, you may, at no penalty, hardcode the input into your program.  &lt;strong&gt;You may only hardcode input if your language cannot reasonably accept meaningful input&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Your program must output the &lt;strong&gt;number of bills in the minimum exchange transaction&lt;/strong&gt;.  Your program may not print any of the possible transactions themselves.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that you will always have enough money to cover your bill, possibly requiring some change from the cashier.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that the cashier has an unlimited number of all bills at their disposal.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that all inputs are non-negative integers.  It is possible that your bill comes out to $0.  No integer input will ever be greater than &lt;code&gt;1000&lt;/code&gt;.  That's too many bills and quite frankly, too many groceries.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so fewest bytes wins.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input                        Output&#xA;[76,1,0,0,4,1,0]              6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;I'll come up with and post some more test cases if people think this is a good challenge.&lt;/p&gt;&#xA;&lt;h2&gt;Possible bonus challenge:&lt;/h2&gt;&#xA;&lt;p&gt;In the United States, a $2 is a rare, but legal, bill issued by the treasury.  If you wish, you can have your program accept another integer, between the number of Ones and Fives, representing the number of $2-bills you have in your wallet, which you can use to pay for your groceries.  However, since such bills are so uncommon, the cashier will not have any on-hand to give to you as change.&lt;/p&gt;&#xA;" OwnerUserId="60884" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-20T17:38:31.957" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11322" PostTypeId="2" ParentId="2447" CreationDate="2017-01-20T17:25:13.407" Score="1" Body="&lt;h1&gt;Classes, objects or other entities may have separate methods to read the input and return the result&lt;/h1&gt;&#xA;&lt;p&gt;This includes the constructor and destructor.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-20T17:25:13.407" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11323" PostTypeId="2" ParentId="2447" CreationDate="2017-01-20T17:26:22.123" Score="-1" Body="&lt;h1&gt;Property setters may take input from the set value&lt;/h1&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2017-01-20T17:26:22.123" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11324" PostTypeId="2" ParentId="2447" CreationDate="2017-01-20T17:35:24.583" Score="2" Body="&lt;h1&gt;Functions may output by calling a callback function or event&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The callback function should be provided using a valid input method.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example in JavaScript that outputs &lt;code&gt;Hello world!&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f=&amp;gt;f(&quot;Hello world!&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This may be shorter than returning a value in some languages:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import random as r&#xA;def f(x):&#xA;    q=r.random()&#xA;    return(q+q/2)/2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As opposed to:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import random as r&#xA;def f(x,g):&#xA;    q=r.random()&#xA;    g((q+q/2)/2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="61384" LastEditDate="2017-03-01T04:21:48.480" LastActivityDate="2017-03-01T04:21:48.480" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11325" PostTypeId="2" ParentId="11320" CreationDate="2017-01-20T17:40:14.393" Score="26" Body="&lt;h1&gt;Nomination for &lt;a href=&quot;https://codegolf.stackexchange.com/users/45941/mego&quot;&gt;Mego&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://chat.stackexchange.com/users/169713/mego&quot;&gt;Chat profile&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Times online: essentially constantly (thanks to insomnia and PPCG addiction)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I (Mego) have been an active participant in all aspects of PPCG for over a year now. I ran in the &lt;a href=&quot;https://codegolf.stackexchange.com/election/1&quot;&gt;first moderator election&lt;/a&gt;, receiving quite a few votes. I am consistently active on the main site, on meta, and in chat. Notably, I pushed for the election of more room owners, and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11141/45941&quot;&gt;proposed a popular standard for chat behavior&lt;/a&gt;. All in all, I am very level-headed, and seek to improve and support this wonderful community whenever possible.&lt;/p&gt;&#xA;" OwnerUserId="60042" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-20T18:16:27.630" CommentCount="4" CommunityOwnedDate="2017-01-20T17:40:14.393" ContentLicense="CC BY-SA 3.0" />
  <row Id="11326" PostTypeId="2" ParentId="11320" CreationDate="2017-01-20T18:20:33.943" Score="19" Body="&lt;h1&gt;(Self-)Nomination for DJMcMayhem&lt;/h1&gt;&#xA;&lt;p&gt;I'll throw my own hat into the ring. &lt;em&gt;&lt;a href=&quot;http://chat.stackexchange.com/users/144962/djmcmayhem&quot;&gt;Chat profile&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;I'm usually slightly active in 16-24 UTC and significantly more active in 0-6 UTC. I also frequently use chat from mobile, so if pinged I can respond fairly quickly if I'm not at my computer.&lt;/p&gt;&#xA;&lt;p&gt;I would be honored to be a room owner for TNB. I have been actively participating in TNB for about one year now, as well as &lt;s&gt;participating in&lt;/s&gt; feeding my addiction to PPCG and meta. I like to think that during that time I have been a friendly, welcoming, and mature voice, although I'd love to hear a third-party voice either agreeing or disagreeing with me.&lt;/p&gt;&#xA;&lt;p&gt;PPCG/TNB is the best online community I've ever been a part of, and if there's anything I can do to make using chat a more pleasant place for everyone involved, I would be happy to.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-20T19:33:38.080" CommentCount="0" CommunityOwnedDate="2017-01-20T18:20:33.943" ContentLicense="CC BY-SA 3.0" />
  <row Id="11327" PostTypeId="2" ParentId="11320" CreationDate="2017-01-20T18:28:41.780" Score="16" Body="&lt;h1&gt;(Self-)Nomination for minxomat&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I second the notion that we need more room owners to cover the times mentioned in Mego's original proposal, in fact I was close to proposing this myself. During those times, I defintely notice the abscense of privileged chat members. Not in a way that there is a catastrophic amount of noise, but in a &quot;hm, this is probably bad, I wish there would be a mod here right now to keep an eye on this&quot; way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When those quiet periods end, I want users to come back to an interesting transcript, with a high signal-to-noise ratio, as I mentioned in my original post on this issue &quot;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10172/we-need-to-talk-about-chat&quot;&gt;We need to talk about chat&lt;/a&gt;&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm always here during the periods in question (living in the time-zone in question helps), and I'm present in chat for most of the day, since it's basically pinned on all my PCs. Whether I'm level headed enough and all that comes with it, it's up to you to decide.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;To add some qualification, I've been moderating chat and everything else (together with a team of great mods) in another coder-oriented community (with a bit more users than this site has) for over 5 years. I'm confident in saying that I've seen and handled almost every type of user/personality there is. &lt;/p&gt;&#xA;" OwnerDisplayName="user42643" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2017-01-20T22:19:36.723" CommentCount="0" CommunityOwnedDate="2017-01-20T18:28:41.780" ContentLicense="CC BY-SA 3.0" />
  <row Id="11328" PostTypeId="2" ParentId="11320" CreationDate="2017-01-20T19:10:25.867" Score="9" Body="&lt;h1&gt;(Self-)Nomination for PhiNotPi&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Right now, I am a student with strong interests in programming and music composition. You can almost always find me hiding in the Nineteenth Byte, where I spend a substantial amount of time. Five years ago, I found PPCG after reading the Wikipedia article about code golfing. Now, I no longer consider golfing my hobby, I consider PPCG my hobby. I have found that this website has one of the most interesting, intelligent, and respectable communities on the internet. It has been an absolute blast to work/play with you all, and I will be honored to serve on your room ownership team.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;1938 days a member.&lt;/em&gt; I saw the creation and destruction of Sandbox Mk III, the freezing and thawing of the Nineteenth Byte, the rise and fall of code-trolling, the birth and death of the Fortnightly Challenges, and now I am witness to yet another transition. If there is one thing I have learned, it is that the journey is its own destination.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Miscellaneous other things I've been involved in, to demonstrate community involvement:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'm the artist behind the stunningly gorgeous 16x16px MS Paint &lt;a href=&quot;http://chat.stackexchange.com/users/-278/new-sandboxed-posts&quot;&gt;chat feed icons&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Quest For Tetris (with special thanks to about a dozen other users)&lt;/li&gt;&#xA;&lt;li&gt;unofficial PPCG &lt;a href=&quot;https://medium.com/code-golf/&quot; rel=&quot;nofollow noreferrer&quot;&gt;blog&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Ran in the previous moderator election (close but no cigar)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://chat.stackexchange.com/users/24697/phinotpi&quot;&gt;Chat profile&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2017-01-22T23:26:42.923" LastActivityDate="2017-01-22T23:26:42.923" CommentCount="0" CommunityOwnedDate="2017-01-22T19:16:33.983" ContentLicense="CC BY-SA 3.0" />
  <row Id="11329" PostTypeId="2" ParentId="2140" CreationDate="2017-01-20T19:35:30.603" Score="1" Body="&lt;h1&gt;City Zoner KoTH&lt;/h1&gt;&#xA;&lt;p&gt;You are a city zoner, and your opponent want to zone dirty industrial.  You need to stop him.  The mayor has set the following rules.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A random player is selected to zone the first location.  They take turns zoning area. If one player has twice as much area zoned than the other player, that player is skipped (can happen repeatedly)&lt;/li&gt;&#xA;&lt;li&gt;We have a 20x20 square to zone (400 squares total). A player can choose how much they zone, but it must be a rectangle with an area of at least 5.  A player cannot zone more than 200 squares total (across the entire game)&lt;/li&gt;&#xA;&lt;li&gt;If the game ends in a tie, the player who played last wins&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Your goal is to ensure your opponent zones as few squares as possible.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-21T17:43:25.103" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11330" PostTypeId="2" ParentId="6918" CreationDate="2017-01-21T09:21:47.710" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/patrickroberts/bean&quot; rel=&quot;nofollow noreferrer&quot;&gt;Bean&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Bean is an esoteric byte-encoded code-golfing language derived from JavaScript, and was created by me, Patrick Roberts, in January 2017.&lt;/p&gt;&#xA;&lt;p&gt;The inspiration behind Bean was one of frustration. I typically submit answers in JavaScript (ES6), and was aware of its shortcomings in verbosity, such as &lt;code&gt;String.fromCharCode(...)&lt;/code&gt;. I thought it would be cool to write a language where every global and standard identifier (like &lt;code&gt;String&lt;/code&gt; and &lt;code&gt;fromCharCode&lt;/code&gt; respectively) could be represented by single bytes in a byte-encoded language, and thus JavaScript's code-golfing hero, Bean, was born.&lt;/p&gt;&#xA;&lt;p&gt;The backend uses &lt;a href=&quot;https://github.com/babel/babylon&quot; rel=&quot;nofollow noreferrer&quot;&gt;babylon&lt;/a&gt; to convert any JavaScript source code omitting comments, directives (&lt;code&gt;use strict&lt;/code&gt;), decorators (&lt;code&gt;@readonly&lt;/code&gt;), and a few other AST nodes that were exclusive to &lt;code&gt;module&lt;/code&gt; syntax (&lt;code&gt;export default&lt;/code&gt;, for example), and traverses the constructed AST depth-first, encoding each node in 1 or 2 bytes, and then recursing to encode the child nodes sequentially.&lt;/p&gt;&#xA;&lt;p&gt;Some of the features that make Bean differ from JavaScript is the advantage of implicit input and output. For example, the following JavaScript compiles to a valid Bean program that adds two integers and outputs the sum:&lt;/p&gt;&#xA;&lt;p&gt;JavaScript:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A+B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Bean Hexdump (7 bytes):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;00000000 26 4c a0 43 8b 20 44&#xA;00000007&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/84281/42091&quot;&gt;The best valid JavaScript answer for this&lt;/a&gt;, in comparison, is 9 bytes. You can check &lt;a href=&quot;https://patrickroberts.github.io/bean/#h=JkygQ4sgRA==&amp;amp;i=Mwo0&quot; rel=&quot;nofollow noreferrer&quot;&gt;the demo for this Bean program here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The implicit input is read line-by-line, and string literals of each line are stored in the lowercase identifiers &lt;code&gt;a-z&lt;/code&gt; (then &lt;code&gt;aa&lt;/code&gt;, &lt;code&gt;ab&lt;/code&gt;, &lt;code&gt;ac&lt;/code&gt;...) while successful JSON-parsed lines are stored in &lt;code&gt;A-Z&lt;/code&gt; (then &lt;code&gt;AA&lt;/code&gt;, &lt;code&gt;AB&lt;/code&gt;, &lt;code&gt;AC&lt;/code&gt;...). In addition, the array of all string literals is stored in &lt;code&gt;_&lt;/code&gt; while the sparse array of successful JSON-parsed lines is stored in &lt;code&gt;$&lt;/code&gt;. To make this clearer, consider the following input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;5&#xA;hello&#xA;&amp;quot;hello&amp;quot;&#xA;{&amp;quot;hello&amp;quot;: &amp;quot;world&amp;quot;}&#xA;[hello]&#xA;[5, &amp;quot;hello&amp;quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The implicit input would be populated as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;var a = &amp;quot;5&amp;quot;,&#xA;    b = &amp;quot;hello&amp;quot;,&#xA;    c = &amp;quot;\&amp;quot;hello\&amp;quot;&amp;quot;,&#xA;    d = &amp;quot;{\&amp;quot;hello\&amp;quot;: \&amp;quot;world\&amp;quot;}&amp;quot;,&#xA;    e = &amp;quot;[hello]&amp;quot;,&#xA;    f = &amp;quot;[5, \&amp;quot;hello\&amp;quot;]&amp;quot;,&#xA;    A = 5,&#xA;    C = &amp;quot;hello&amp;quot;,&#xA;    D = {&amp;quot;hello&amp;quot;: &amp;quot;world&amp;quot;},&#xA;    F = [5, &amp;quot;hello&amp;quot;],&#xA;    _ = [&#xA;      &amp;quot;5&amp;quot;,&#xA;      &amp;quot;hello&amp;quot;,&#xA;      &amp;quot;\&amp;quot;hello\&amp;quot;&amp;quot;,&#xA;      &amp;quot;{\&amp;quot;hello\&amp;quot;: \&amp;quot;world\&amp;quot;}&amp;quot;,&#xA;      &amp;quot;[hello]&amp;quot;,&#xA;      &amp;quot;[5, \&amp;quot;hello\&amp;quot;]&amp;quot;&#xA;    ],&#xA;    $ = [5, , &amp;quot;hello&amp;quot;, {&amp;quot;hello&amp;quot;: &amp;quot;world&amp;quot;}, , [5, &amp;quot;hello&amp;quot;]];&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Attempting to reference &lt;code&gt;B&lt;/code&gt; or &lt;code&gt;E&lt;/code&gt; would throw an error, and &lt;code&gt;$[1]&lt;/code&gt; and &lt;code&gt;$[4]&lt;/code&gt; would return &lt;code&gt;undefined&lt;/code&gt;, and would not be iterated over with &lt;code&gt;.map()&lt;/code&gt; or &lt;code&gt;.forEach()&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I currently don't have any documentation, as I've just explained every way in which Bean differs from JavaScript, but feel free to open an issue on &lt;a href=&quot;https://github.com/patrickroberts/bean&quot; rel=&quot;nofollow noreferrer&quot;&gt;github&lt;/a&gt; if you feel that documenting the byte code is necessary. Bean is also available on &lt;a href=&quot;https://www.npmjs.com/package/bean-js&quot; rel=&quot;nofollow noreferrer&quot;&gt;npm&lt;/a&gt;, &lt;s&gt;but the implicit input and output only works on the online interpreter for now. I'll internalize that in a later update.&lt;/s&gt; The node.js implementation now includes a hook for implicit input and output via &lt;code&gt;bean.program()&lt;/code&gt;. See &lt;a href=&quot;https://github.com/patrickroberts/bean&quot; rel=&quot;nofollow noreferrer&quot;&gt;README&lt;/a&gt; for usage.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://patrickroberts.github.io/bean/#h=JkygQ4sgRA==&amp;amp;i=Mwo0&quot; rel=&quot;nofollow noreferrer&quot;&gt;The interpreter&lt;/a&gt; accepts any arbitrary JavaScript and automatically converts it to a hexdump for you. Alternatively, you can copy/paste any valid hexdump and it will reconstruct the equivalent JavaScript for you.&lt;/p&gt;&#xA;&lt;p&gt;One tip I can offer is to attempt to use &amp;quot;standard&amp;quot; identifiers as much as possible, even in your strings, regular expressions, and template strings, since all literals expand to identifiers, and those that are not stored in the configuration file must be appended to the end of the byte code.&lt;/p&gt;&#xA;&lt;p&gt;At the very least, repeated use of the same non-standard identifiers are reduced to referencing the same subarray of bytes at the end of the byte code, so don't bother storing &lt;code&gt;&amp;quot;my really long necessary string&amp;quot;&lt;/code&gt; to a variable, because that will waste 3 bytes:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;// 41 bytes&#xA;&#xA;(s=&amp;quot;my really long necessary string&amp;quot;)===s&#xA;&#xA;// 43 bytes&#xA;&#xA;00000000 26 4c cd a0 6f 80 23 81 01 82 20 6f ed f9 a0 f2  &amp;amp;LÍ o.#... oíù ò&#xA;00000010 e5 e1 ec ec f9 a0 ec ef ee e7 a0 ee e5 e3 e5 f3  åáììù ìïîç îåãåó&#xA;00000020 f3 e1 f2 f9 a0 f3 f4 f2 e9 ee 67                 óáòù óôòéîg&#xA;0000002b&#xA;&#xA;// vs...&#xA;&#xA;// 69 bytes&#xA;&#xA;&amp;quot;my really long necessary string&amp;quot;===&amp;quot;my really long necessary string&amp;quot;&#xA;&#xA;// 40 bytes&#xA;&#xA;00000000 26 4c a3 81 01 82 23 81 01 ed f9 a0 f2 e5 e1 ec  &amp;amp;L£...#..íù òåáì&#xA;00000010 ec f9 a0 ec ef ee e7 a0 ee e5 e3 e5 f3 f3 e1 f2  ìù ìïîç îåãåóóáò&#xA;00000020 f9 a0 f3 f4 f2 e9 ee 67                          ù óôòéîg&#xA;00000028&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="42091" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-21T21:31:46.037" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11331" PostTypeId="2" ParentId="2140" CreationDate="2017-01-21T11:23:03.470" Score="0" Body="&lt;h2&gt;Find square sum products &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It's possible to find sets of three numbers whose product including their sum is a square number. Examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;(3 + 2 + 1) * 3 * 2 * 1 = 6²&lt;/li&gt;&#xA;&lt;li&gt;(3 + 3 + 2) * 3 * 3 * 2 = 12²&lt;/li&gt;&#xA;&lt;li&gt;(4 + 4 + 1) * 4 * 4 * 1 = 12²&lt;/li&gt;&#xA;&lt;li&gt;(9 + 8 + 1) * 9 * 8 * 1 = 36²&lt;/li&gt;&#xA;&lt;li&gt;(8 + 5 + 5) * 8 * 5 * 5 = 60²&lt;/li&gt;&#xA;&lt;li&gt;(8 + 7 + 6) * 8 * 7 * 6 = 84²&lt;/li&gt;&#xA;&lt;li&gt;(9 + 8 + 8) * 9 * 8 * 8 = 120²&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Please write a program or function to find square sum products for me.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since there are an infinite number of square sum products, even excluding trivial multiples, you should limit your output to depend on a characteristic number N. Your program should always output the same square sum product(s) for a given N, and there should be at least one value of N for each possible square sum product that will cause your program to output that product. However, I will be flexible in what N actually represents, as long as you describe it in your answer. Here are some examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;N is one sixth&lt;sup&gt;[citation needed]&lt;/sup&gt; of the square root of the square sum products. For example, an N of 2 would find the second and third of my examples.&lt;/li&gt;&#xA;&lt;li&gt;N is the upper bound of the largest summand. For example, an N of 9 would find all of my examples and then some.&lt;/li&gt;&#xA;&lt;li&gt;N is the number of square sum products to be found. For example, an N of 12 would find all of my examples and then some.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For the output, I don't actually want the summands or the square root. Instead, please output the pairwise sum of the summands. Please also exclude duplicates (i.e. reorderings) from your answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2017-01-21T13:31:34.787" LastActivityDate="2017-01-21T13:31:34.787" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="11332" PostTypeId="2" ParentId="2140" CreationDate="2017-01-21T22:02:39.130" Score="1" Body="&lt;h1&gt;Store a secret &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a password and a secret, &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Serve at &lt;code&gt;localhost:8080&lt;/code&gt;. &lt;/li&gt;&#xA;&lt;li&gt;If you receive a POST request to &lt;code&gt;/&lt;/code&gt; with the parameter &lt;code&gt;p=(...)&lt;/code&gt; then check the given password against the fed in password.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If it is correct, return a plaintext file with the secret.&lt;/li&gt;&#xA;&lt;li&gt;If it is incorrect, return a 400 error&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Return 400 for any other requests&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No need to salt and hash the password&lt;/li&gt;&#xA;&lt;li&gt;Your server should be able to start in five seconds.&lt;/li&gt;&#xA;&lt;li&gt;Your server must be able to server for at least five hours.&lt;/li&gt;&#xA;&lt;li&gt;Your server must be able to handle at least 20 connections a second at least in theory. Test script:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import requests, random, time&#xA;import sys&#xA;from string import printable&#xA;&#xA;def gen_string():&#xA;    s = ''&#xA;    for i in range(random.randint(1, 20)):&#xA;        s += random.choice(printable)&#xA;    return s&#xA;&#xA;def make_request(str):&#xA;    is_child = os.fork()&#xA;    if is_child:&#xA;        requests.get(str)&#xA;        sys.exit()&#xA;&#xA;while True:&#xA;    for i in range(20):&#xA;        make_request(gen_string())&#xA;    time.sleep(0.05)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2017-01-21T22:02:39.130" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11334" PostTypeId="2" ParentId="11139" CreationDate="2017-01-21T22:40:59.780" Score="5" Body="&lt;h1&gt;My definition of noise&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;These are solely my opinion. Whether or not the community accepts these or not is it's choice.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Caret chains&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Yes.&lt;/strong&gt; This adds absolutely nothing to chat.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;ASCII faces for the fun of it or in response to other ASCII faces&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Yes.&lt;/strong&gt; If you want a place to discuss ASCII faces, create a new room.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;ASCII faces in response to messages&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;No.&lt;/strong&gt; ASCII faces are a robust form of legitimate communication.&lt;sup&gt;1&lt;/sup&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Announcements of arrival (&quot;hi&quot;, &quot;I'm back&quot;) and departure (&quot;bye&quot;, &quot;gtg&quot;)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Maybe.&lt;/strong&gt; &lt;code&gt;gtg&lt;/code&gt; is legitimate if the speaker is having an active conversation with someone else and must leave. Likewise for &lt;code&gt;I'm back&lt;/code&gt;. Unprompted announcements of arrival and departure are noise.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Poor pun chains&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Yes, but go light when removing them.&lt;/strong&gt; Ask the chatroom before moving or deleting messages. A &quot;poor pun&quot; is subjective.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Better pun chains (reads more like a conversation)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Maybe.&lt;/strong&gt; I'm undecided on this one.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Chat mini challenges (CMC)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;No.&lt;/strong&gt; This adds to conversation and is one of the most fun parts about TNB.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Stand-alone jokes or memes&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Maybe.&lt;/strong&gt; I'm undecided on this one.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Jokes or memes in response to someone else&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;No, to a certain extent.&lt;/strong&gt; This is allowed in real life, and jokes are conversation. However, too many jokes interrupt conversation and flow of thought.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Funny images or gifs&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Maybe.&lt;/strong&gt; I'm undecided on this one.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Self-promotion of posts or projects&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;No, to a certain extent.&lt;/strong&gt; Infrequent self-promotion is OK - everybody wants to share their own stuff. It can be fun to see other's stuff too.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Promotion of other users' posts or projects&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;No, to a certain extent.&lt;/strong&gt; Promotion should be limited and the rules of the above bullet point apply.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Deliberately poor English or meme-y spellings or phrases (e.g., &quot;wat iz&quot;)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Maybe.&lt;/strong&gt; Using this as a form of communication is OK, but posting this out of nowhere is unacceptable. Extended poor English is also not acceptable.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Messages with nothing more than a single question mark&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;No.&lt;/strong&gt; This is a short version of &lt;code&gt;huh?&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Chatter about who lives where or time-zone related chatter&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Maybe.&lt;/strong&gt; &lt;em&gt;Do&lt;/em&gt; we want this in TNB? &lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; What differs ASCII faces from other forms of communication? An ASCII face can say more than a paragraph because of it's concise qualities.&lt;/p&gt;&#xA;" OwnerUserId="41088" LastEditorUserId="41088" LastEditDate="2017-01-23T17:28:28.833" LastActivityDate="2017-01-23T17:28:28.833" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11335" PostTypeId="2" ParentId="11139" CreationDate="2017-01-21T22:42:19.453" Score="1" Body="&lt;h1&gt;Chatter about who lives where or time-zone related chatter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Vote&lt;/strong&gt; on this answer to determine what the consensus is.&lt;/p&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2017-01-21T22:42:19.453" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11336" PostTypeId="2" ParentId="2140" CreationDate="2017-01-22T02:18:49.963" Score="0" Body="&lt;h1&gt;Dual Kimian (Error) and Regular Quine Polyglot &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Create a program that is&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a non-erroring &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4877/what-counts-as-a-proper-quine&quot;&gt;proper quine&lt;/a&gt; in one language...&lt;/li&gt;&#xA;&lt;li&gt;...and a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4877/what-counts-as-a-proper-quine&quot;&gt;proper quine&lt;/a&gt; that produces its own source code through an error in another language&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;What is an error quine?&lt;/h3&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The compiler/interpreter/runtime to produce &lt;em&gt;error output&lt;/em&gt; when compiling/running your program which is identical to your program's source code.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program may be specific to a particular version or implementation of your language's compiler/interpreter/runtime environment. If so, please specify the particulars.&lt;/li&gt;&#xA;&lt;li&gt;Only standard compiler/interpreter/runtime options are permitted. You cannot pass some weird flag to your compiler to get a specific result.&lt;/li&gt;&#xA;&lt;li&gt;The program does &lt;em&gt;not&lt;/em&gt; need to be syntactically or semantically valid.&lt;/li&gt;&#xA;&lt;li&gt;The program must not produce any output of its own (e.g. by calling &lt;code&gt;print&lt;/code&gt; or an output function). All output generated upon attempting to compile/run the program must originate from the compiler/interpreter/runtime.&lt;/li&gt;&#xA;&lt;li&gt;The complete output of the compiler/interpreter/runtime must be exactly identical to your program source code.&lt;/li&gt;&#xA;&lt;li&gt;The compiler/interpreter/runtime must generate at least one error message when invoked with your program.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;sup&gt;(adapted from &lt;a href=&quot;https://codegolf.stackexchange.com/users/6699/nneonneo&quot;&gt;nneonneo's&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/36260/make-an-error-quine&quot;&gt;&amp;quot;Make an error quine!&amp;quot;&lt;/a&gt; challenge)&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Polyglots from different versions of the same language or similar languages are allowed&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41088" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-22T02:18:49.963" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11337" PostTypeId="2" ParentId="2140" CreationDate="2017-01-22T15:11:42.157" Score="0" Body="&lt;h1&gt;Sandbox Questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is it a good idea to post this as a separate challenge? This one is significantly easier and I fear that posting it would take too much attention away from the original challenge.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Detect if your program has been bit-flipped &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/radiation-hardening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; rel=&quot;tag&quot;&gt;radiation-hardening&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program that outputs&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;NOT CORRUPTED&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If any single &lt;strong&gt;bit&lt;/strong&gt; is substituted by &lt;strong&gt;the alternate bit&lt;/strong&gt; the program should output&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;CORRUPTED&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do not read your source code from a file&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2017-01-22T15:11:42.157" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11338" PostTypeId="2" ParentId="2140" CreationDate="2017-01-22T15:50:24.747" Score="1" Body="&lt;h1&gt;Exponentiation by squaring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given an integer &lt;em&gt;x&lt;/em&gt; and a non-negative integer &lt;em&gt;n&lt;/em&gt;, compute &lt;em&gt;x&lt;sup&gt;n&lt;/sup&gt;&lt;/em&gt; using &lt;a href=&quot;https://en.wikipedia.org/wiki/Exponentiation_by_squaring&quot; rel=&quot;nofollow noreferrer&quot;&gt;exponentiation by squaring&lt;/a&gt;. The key feature of this method is that the time complexity for exponentation can be reduced from &lt;em&gt;Θ&lt;/em&gt;(&lt;em&gt;n&lt;/em&gt;) using naive exponentiation to &lt;em&gt;Θ&lt;/em&gt;(log &lt;em&gt;n&lt;/em&gt;) using exponentiation by squaring. There are other names for this method as well as multiple methods which each have an equivalent time complexity. One of them will be explained but feel free to implement the one that is best suited for golfing in your language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An iterative version is displayed below in Python&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def exponentiate(x, n):&#xA;    if n == 0:&#xA;        return 1&#xA;    y = 1&#xA;    while n &amp;gt; 1:&#xA;        if n % 2 == 0:&#xA;            x = x * x&#xA;            n = n / 2&#xA;        else:&#xA;            y = x * y&#xA;            x = x * x&#xA;            n = (n - 1) / 2&#xA;    return x * y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest code wins.&lt;/li&gt;&#xA;&lt;li&gt;Your function or program must have a time complexity of &lt;em&gt;Θ&lt;/em&gt;(log &lt;em&gt;n&lt;/em&gt;). Keep in mind that only time is restricted, not space.&lt;/li&gt;&#xA;&lt;li&gt;Your function or program must support all inputs which would not result in integer overflow in your language's integer datatype.&lt;/li&gt;&#xA;&lt;li&gt;You are not allowed to use any builtins that perform exponentiation.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="6710" LastEditorUserId="6710" LastEditDate="2017-01-22T17:32:37.197" LastActivityDate="2017-01-22T17:32:37.197" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11339" PostTypeId="2" ParentId="2140" CreationDate="2017-01-22T17:25:45.483" Score="-2" Body="&lt;h1&gt;Make the Shape&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a wider version of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/107598/draw-an-asciirisk&quot;&gt;this&lt;/a&gt; question, so it may not get posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a single character e.g. &lt;code&gt;H&lt;/code&gt; or &lt;code&gt;!&lt;/code&gt; and a sequence of letters e.g. &lt;code&gt;abcdefghijklmnopqrstuvwxyz&lt;/code&gt; you must output the character drawn using the letters in the sequence. If you need more letters, just loop through the sequence again.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A single character, &lt;code&gt;c&lt;/code&gt;. You can assume that it will always be one character.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A sequence of charaters &lt;code&gt;s&lt;/code&gt;. All characters must be printable ASCII letters.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;c&lt;/code&gt; made up of the letters in &lt;code&gt;s&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let's say &lt;code&gt;c = &quot;H&quot;&lt;/code&gt; and &lt;code&gt;s = &quot;abcdefghijklmnopqrstuvwxyz&quot;&lt;/code&gt;. The correct output would be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ab   cd&#xA;ef   gh&#xA;ij   kl&#xA;mnopqrs&#xA;tuvwxyz&#xA;ab   cd&#xA;ef   gh&#xA;ij   kl&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;c = &quot;!&quot;&lt;/code&gt; and &lt;code&gt;s = &quot;hello, world&quot;&lt;/code&gt; outputs&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;he&#xA;ll&#xA;o,&#xA; w&#xA;or&#xA;&#xA;ld&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Shortest code (in bytes) wins&lt;/li&gt;&#xA;&lt;li&gt;Any correct output may be outputted i.e. either one of the example&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;c&lt;/code&gt; must be one character&lt;/li&gt;&#xA;&lt;li&gt;Leading/trailing newline is acceptable&lt;/li&gt;&#xA;&lt;li&gt;Standard golfing loopholes apply&lt;/li&gt;&#xA;&lt;li&gt;Lines must be 2 characters thick&lt;/li&gt;&#xA;&lt;li&gt;You must use every letter in &lt;code&gt;s&lt;/code&gt; at least once to make &lt;code&gt;c&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Either a full program or a function, &lt;strong&gt;NO&lt;/strong&gt; snippets&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user63571" LastEditorUserId="-1" LastEditorDisplayName="user63571" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2017-01-22T19:08:20.507" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="11344" PostTypeId="2" ParentId="2140" CreationDate="2017-01-23T14:46:16.283" Score="0" Body="&lt;h1&gt;Avoiding Averages&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a non-empty list of positive integers, reorder the list such that for every pair of indices, the average of the values at those indices is not contained in any index between them.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest code wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Work in-progress&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="6710" LastEditorUserId="6710" LastEditDate="2017-01-23T20:36:57.207" LastActivityDate="2017-01-23T20:36:57.207" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11347" PostTypeId="2" ParentId="11147" CreationDate="2017-01-24T06:24:07.477" Score="0" Body="&lt;p&gt;SB uses UTF-8 for saving files, and UCS-2 for strings.&#xA;The last line does not need to have a LF after it, so this should not be counted in the answer.&lt;/p&gt;&#xA;" OwnerUserId="64538" LastActivityDate="2017-01-24T06:24:07.477" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11348" PostTypeId="2" ParentId="2140" CreationDate="2017-01-24T08:06:16.803" Score="1" Body="&lt;h2&gt;Polytope of the pops&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In 3 dimensions, there are 5 regular convex polytopes: the &lt;a href=&quot;https://en.wikipedia.org/wiki/Platonic_solid&quot; rel=&quot;nofollow noreferrer&quot;&gt;platonic solids&lt;/a&gt;.&#xA;&lt;a href=&quot;https://i.stack.imgur.com/qUX6L.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/qUX6L.gif&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In 2 dimensions, there is an infinity of regular convex polytopes: the triangle, the square, the pentagon, the hexagon, etc…&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In 4 dimensions, there are 6 such polytopes, and for 5 dimensions or more, only 3 polytopes - check that cool &lt;a href=&quot;https://www.youtube.com/watch?v=2s4TqVAbfz4&quot; rel=&quot;nofollow noreferrer&quot;&gt;video&lt;/a&gt; for more details.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given as input an integer &lt;code&gt;n&amp;gt;=0&lt;/code&gt;, return the number of regular convex polytopes in n-dimensional space, or -1 if the number is infinite.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The sequence (&lt;a href=&quot;https://oeis.org/A060296&quot; rel=&quot;nofollow noreferrer&quot;&gt;A060296&lt;/a&gt;) is (starting with 0 dimensions): &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1, 1, -1, 5, 6, 3, 3, 3, 3, 3, 3, 3...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test cases&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 → 1&#xA;1 → 1&#xA;2 → -1&#xA;3 → 5&#xA;4 → 6&#xA;5 → 3&#xA;2017 → 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="13798" LastActivityDate="2017-01-24T08:06:16.803" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11352" PostTypeId="2" ParentId="2140" CreationDate="2017-01-24T20:49:09.607" Score="0" Body="&lt;h1&gt;Compute the CYK-Table!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grammars&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grammars&amp;#39;&quot; rel=&quot;tag&quot;&gt;grammars&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Context-Free Grammars&lt;/h2&gt;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Context-free_grammar&quot; rel=&quot;nofollow noreferrer&quot;&gt;context-free grammar&lt;/a&gt; is a grammar consisting of rules from one variable to a list of variables and symbols. Every string purely consisting of symbols that can be produced using these rules is said to be accepted by the language. For the purpose of this challenge we're only going to consider grammars in &lt;a href=&quot;https://en.wikipedia.org/wiki/Chomsky_normal_form&quot; rel=&quot;nofollow noreferrer&quot;&gt;CNF&lt;/a&gt; which means that on the right side there's either two variables or one symbol (we're gonna ignore the empty language for this challenge).&lt;/p&gt;&#xA;&lt;h2&gt;The CYK-Algorithm&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/CYK_algorithm#Example&quot; rel=&quot;nofollow noreferrer&quot;&gt;The CYK-Algorithm&lt;/a&gt; is a method to check whether a given word is recognized by a context-free language in CNF. For doing this it iterates over the word and applies all possible rules on all substrings and writes them down in a nice table. This table can then be used to successively find variables generating larger substrings until you (don't) hit the word.&lt;/p&gt;&#xA;&lt;h2&gt;The Input&lt;/h2&gt;&#xA;&lt;p&gt;Your input will be&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A list of strings representing the word&lt;/li&gt;&#xA;&lt;li&gt;A list of triples of strings, representing the rules from one variables (the first in the triple) to two variables&lt;/li&gt;&#xA;&lt;li&gt;A list of pairs of strings, representing the rules from one variable to a symbol&lt;/li&gt;&#xA;&lt;li&gt;A string, representing the starting variable&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may replace the above input format with your favorite input format, as long as you can encode the same amount of information.&lt;/p&gt;&#xA;&lt;h2&gt;The output&lt;/h2&gt;&#xA;&lt;p&gt;The output will be three-dimensional: A list of rows consisting of a list of &amp;quot;candidates&amp;quot; which is a list of strings representing a list of variables. An illustration of this is &lt;a href=&quot;https://en.wikipedia.org/wiki/CYK_algorithm#Example&quot; rel=&quot;nofollow noreferrer&quot;&gt;on Wikipedia&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You may replace the above output format with your favorite output format, as long as you can encode the same amount of information.&lt;/p&gt;&#xA;&lt;h2&gt;Who wins?&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest code in bytes to solve the challenge wins!&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Start Symbol: &amp;quot;X&amp;quot;&#xA;Word: [&amp;quot;b&amp;quot;,&amp;quot;a&amp;quot;,&amp;quot;c&amp;quot;,&amp;quot;b&amp;quot;]&#xA;Rules #1: [(&amp;quot;X&amp;quot;,&amp;quot;X&amp;quot;,&amp;quot;Y&amp;quot;),(&amp;quot;X&amp;quot;,&amp;quot;Z&amp;quot;,&amp;quot;Z&amp;quot;),(&amp;quot;Y&amp;quot;,&amp;quot;W&amp;quot;,&amp;quot;Z&amp;quot;),(&amp;quot;Z&amp;quot;,&amp;quot;X&amp;quot;,&amp;quot;Y&amp;quot;),(&amp;quot;W&amp;quot;,&amp;quot;Y&amp;quot;,&amp;quot;W&amp;quot;)]&#xA;Rules #2: [(&amp;quot;X&amp;quot;,&amp;quot;a&amp;quot;),(&amp;quot;Y&amp;quot;,&amp;quot;a&amp;quot;),(&amp;quot;Z&amp;quot;,&amp;quot;b&amp;quot;),(&amp;quot;W&amp;quot;,&amp;quot;c&amp;quot;)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We're gonna do this step-by-step:&lt;/p&gt;&#xA;&lt;p&gt;The substrings of length 1 first (this is your first row):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;b    , a       , c   , b&#xA;[&amp;quot;Z&amp;quot;],[&amp;quot;X&amp;quot;,&amp;quot;Y&amp;quot;],[&amp;quot;W&amp;quot;],[&amp;quot;Z&amp;quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Now for the substrings of length 2 (this is your second row):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[],[&amp;quot;W&amp;quot;],[&amp;quot;Y&amp;quot;] &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(because there's no way to get &lt;code&gt;ZX&lt;/code&gt; or &lt;code&gt;ZY&lt;/code&gt;, but &lt;code&gt;W -&amp;gt; YW&lt;/code&gt; and &lt;code&gt;Y -&amp;gt; WZ&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;p&gt;Now for the substrings of length 3 (this is your third row):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[],[&amp;quot;X&amp;quot;,&amp;quot;Y&amp;quot;,&amp;quot;Z&amp;quot;] &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(because there's no rule to get &lt;code&gt;ZW&lt;/code&gt;, but &lt;code&gt;X-&amp;gt;XY (1+2), Y-&amp;gt;WZ (2+1), Z-&amp;gt;XY (1+2)&lt;/code&gt; where the sum denotes the lengths of of the used substrings)&lt;/p&gt;&#xA;&lt;p&gt;Finally for the substrings of length 4 (this is your fourth row):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;quot;X&amp;quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(because &lt;code&gt;X-&amp;gt;ZZ(1+3)&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;p&gt;So in total your final table for this example is gonna look like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;[[&amp;quot;Z&amp;quot;],[&amp;quot;X&amp;quot;,&amp;quot;Y&amp;quot;],[&amp;quot;W&amp;quot;],[&amp;quot;Z&amp;quot;]],&#xA;[[],[&amp;quot;W&amp;quot;],[&amp;quot;Y&amp;quot;]],&#xA;[[],[&amp;quot;X&amp;quot;,&amp;quot;Y&amp;quot;,&amp;quot;Z&amp;quot;]],&#xA;[[&amp;quot;X&amp;quot;]]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;where the first index increases as we go downwards, the second increases as we go to the right an dthe third denotes the variable within the &amp;quot;cell&amp;quot;.&lt;/p&gt;&#xA;" OwnerUserId="55329" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-24T20:49:09.607" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11353" PostTypeId="2" ParentId="2140" CreationDate="2017-01-24T21:05:51.630" Score="0" Body="&lt;h1&gt;Physical String Length&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Given the following information:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;(String) s&lt;/code&gt; -  A string to be printed.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(String) f&lt;/code&gt; -  The font in which it is to be printed.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(int)   pt&lt;/code&gt; - The size of the font in which it is to be printed in pts (no decimals).&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Note that the input units are in pt (1/72 inch).&lt;/li&gt;&#xA;&lt;li&gt;The output unit should be pixels, rounded to the nearest integer.&lt;/li&gt;&#xA;&lt;li&gt;Use 96 PPI in your conversion.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The physical length of the string (how many pixels wide the final string is).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Below are a few examples and a piece of code that will let you test arbitrary combinations.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;import java.awt.Canvas;&#xA;import java.awt.Font;&#xA;public class F {&#xA;    public static void main(String[]args){&#xA;        System.out.println(physicalStringLength(&amp;quot;What?&amp;quot;, &amp;quot;Calibri&amp;quot;, 12));&#xA;        System.out.println(physicalStringLength(&amp;quot;What?&amp;quot;, &amp;quot;Calibri&amp;quot;, 24));&#xA;        System.out.println(physicalStringLength(&amp;quot;What?&amp;quot;, &amp;quot;Calibri&amp;quot;, 36));&#xA;        System.out.println(physicalStringLength(&amp;quot;What?&amp;quot;, &amp;quot;Calibri&amp;quot;, 72));&#xA;        System.out.println(physicalStringLength(&amp;quot;What?&amp;quot;, &amp;quot;Helvetica&amp;quot;, 12));&#xA;        System.out.println(physicalStringLength(&amp;quot;What?&amp;quot;, &amp;quot;Times New Roman&amp;quot;, 12));&#xA;        System.out.println(physicalStringLength(&amp;quot;What?&amp;quot;, &amp;quot;Courier New&amp;quot;, 12));&#xA;    }&#xA;    &#xA;    public static int physicalStringLength(String s, String f, int pt) {&#xA;        System.out.print(s + &amp;quot;@[&amp;quot; + f + &amp;quot;,&amp;quot; + pt + &amp;quot;]=&amp;quot;);&#xA;        return new Canvas().getFontMetrics(new Font(f,0,pt)).stringWidth(s);&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here's some base-line examples, the output has be created using the above piece of Java code:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;What?@[Calibri,12]=35&#xA;What?@[Calibri,24]=65&#xA;What?@[Calibri,36]=97&#xA;What?@[Calibri,72]=193&#xA;What?@[Helvetica,12]=35&#xA;What?@[Times New Roman,12]=31&#xA;What?@[Courier New,12]=35&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If you want to see the length of any other strings, use the code provided as a base-line. Using a Java has been banned due to the usage of the example unless you'll be providing a different methodology (kinda sucks, cause Java may be one of the few with a built-in).&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, lowest byte-count wins.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-24T21:32:50.970" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="11355" PostTypeId="2" ParentId="1061" CreationDate="2017-01-25T09:54:40.043" Score="35" Body="&lt;h2&gt;Using a language's lack of features to trivialize a challenge&lt;/h2&gt;&#xA;&lt;p&gt;This is in the same vein as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8245/45941&quot;&gt;this other loophole&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Consider &lt;a href=&quot;https://codegolf.stackexchange.com/q/106704/45941&quot;&gt;this challenge&lt;/a&gt;. Using a language that cannot access an Internet connection would be a violation of this loophole - it could simply output a falsey output all the time, because it would never be able to access the Internet.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-25T09:54:40.043" CommentCount="1" CommunityOwnedDate="2017-01-25T09:54:40.043" ContentLicense="CC BY-SA 3.0" />
  <row Id="11356" PostTypeId="2" ParentId="2140" CreationDate="2017-01-25T15:59:54.870" Score="2" Body="&lt;h2&gt;Enthusiastically Russianify a String&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Greetings Comrades,&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Many of you may have interacted with people from Russia on the internet at some point, and a subset of you may have noticed the slightly odd method they have of expressing themselves.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;e.g. &lt;code&gt;деинсталляция игра нуб)))&lt;/code&gt; - (forgive the google translate)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;where the &lt;code&gt;)))&lt;/code&gt; are added for emphasis on the previous statement, I have been working on a theory that the ratio of &lt;code&gt;)&lt;/code&gt;'s to the rest of the string is directly proportional to the amount of implied emphasis, however I oftentimes find it difficult to compute the ratio on the fly, as I am also trying to cope with a slew of abuse, so I would like the shortest possible code to help me calculate what the resulting string should be, for a value of enthusiasm between 0 and 500%, given the original, unenthusiastic string, this will aid my research greatly as i will not have to type out bulky scripts every time I wish to test my hypothesis.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;so, the challenge:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;write a full program or function, which, provided two arguments, a string of unknown length, and a number, in either integer format (between 0 and 500) or in decimal format (between 0 and 5, with 2 points of accuracy) will&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;return the original string, suffixed with a number of &lt;code&gt;)&lt;/code&gt;'s&lt;/li&gt;&#xA;&lt;li&gt;the number will be the calculated as a ratio of the input number to the string length.&lt;/li&gt;&#xA;&lt;li&gt;so if the number 200, or 2.00 was provided, 200% of the string must be suffixed as &lt;code&gt;)&lt;/code&gt;'s&lt;/li&gt;&#xA;&lt;li&gt;the number of brackets rounded to in decimal situations does not matter.&lt;/li&gt;&#xA;&lt;li&gt;script is required to support Printable ASCII characters.&lt;/li&gt;&#xA;&lt;li&gt;only has to support one input number format, of your choice.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;codegolf&quot; 125      = codegolf))))))))&#xA;&quot;codegolf&quot; 75       = codegolf))))))&#xA;&quot;noob team omg&quot; 0.5 = noob team omg))))))&#xA;&quot;hi&quot; 4.99           = hi!)))))))))))))))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;example code (powershell) (with decimal input):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Function Get-RussianString ([string]$InputStr,[decimal]$Ratio){&#xA;    $StrLen = $InputStr.Length&#xA;    $SuffixCount = $StrLen * $Ratio&#xA;    $Suffix = [string]::New(&quot;)&quot;,$SuffixCount)&#xA;    return $InputStr + $Suffix&#xA;}&#xA;&#xA;Get-RussianString &quot;codegolf&quot; 0.5&#xA;codegolf))))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest code wins!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is my first challenge, any feedback is greatly appreciated.&lt;/p&gt;&#xA;" OwnerUserId="59735" LastEditorUserId="59735" LastEditDate="2017-01-25T17:01:30.570" LastActivityDate="2017-01-25T17:01:30.570" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11357" PostTypeId="2" ParentId="2140" CreationDate="2017-01-25T18:59:29.387" Score="-2" Body="&lt;h1&gt;Why is it buff...........ering?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As the Internet isn't perfect, occasionally the videos we watch start buffering. When this happens, I get very annoyed. As the wait gets longer, I get even more annoyed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a function or program that waits a random amount of time and then outputs an angry message with the level of anger increasing the longer it waits&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;None&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;An angry message and the length of the wait&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Time waited: 5 seconds&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Angry message: Never mind!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Time waited: 30 seconds&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Message: I hate YouTube!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Time waited: 1 minute&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Message: Die computer, die!!!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This code is an example in Python, obviously ungolfed.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import time&#xA;import random&#xA;messages = [&quot;Never mind!&quot;,&quot;Getting annoyed&quot;,&quot;I hate YouTube!&quot;,&quot;Die computer, die!&quot;]&#xA;slept = random.randint(5,60)&#xA;msg_num = slept//len(messages)&#xA;time.sleep(slept)&#xA;print(&quot;Time waited:&quot;,slept)&#xA;print(messages[msg_num])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Messages are up to you&lt;/li&gt;&#xA;&lt;li&gt;The time to wait ranges from 5 seconds to 1 minute&lt;/li&gt;&#xA;&lt;li&gt;Standard code-golf rules apply&lt;/li&gt;&#xA;&lt;li&gt;Standard code-golf loopholes are disallowed&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user63571" LastEditorDisplayName="user63571" LastEditDate="2017-01-25T19:13:51.330" LastActivityDate="2017-01-25T19:13:51.330" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11358" PostTypeId="2" ParentId="2140" CreationDate="2017-01-25T20:15:26.737" Score="-2" Body="&lt;h1&gt;Don't know what to call this&lt;/h1&gt;&#xA;&lt;p&gt;Some people here may be familiar with &lt;a href=&quot;https://en.m.wikipedia.org/wiki/Euler%27s_identity&quot; rel=&quot;nofollow noreferrer&quot;&gt;Euler's identity&lt;/a&gt;. If not click the link&lt;/p&gt;&#xA;&lt;p&gt;Now you know what the equation is, what if we change it slightly? No-one like to imagine numbers so instead we're going to use an unknown number &lt;code&gt;x&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;So first we get rid of &lt;code&gt;i&lt;/code&gt; and replace it with &lt;code&gt;x&lt;/code&gt;. Now we all know that &lt;code&gt;i*i&lt;/code&gt; is &lt;code&gt;-1&lt;/code&gt;. But with &lt;code&gt;i&lt;/code&gt; gone, so must &lt;code&gt;-1&lt;/code&gt;. Let's change it to &lt;code&gt;x^2&lt;/code&gt; instead. However this means there is only one solution. So instead let's make it &lt;code&gt;x^random_integer(0,x)&lt;/code&gt; to spice it up&lt;/p&gt;&#xA;&lt;p&gt;If we change the equation from &lt;code&gt;e^(i*π) - 1 = 0&lt;/code&gt; to &lt;code&gt;e^π / (x^random_integer(0,x)) = 0&lt;/code&gt; we now have something we can work with.&lt;/p&gt;&#xA;&lt;p&gt;Given an integer or float as input, &lt;code&gt;x&lt;/code&gt;, calculate if it satisfies the above equation. Your code should result in &lt;code&gt;True&lt;/code&gt; or &lt;code&gt;False&lt;/code&gt; or the closest equivalent.&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;A single number between &lt;code&gt;-(2^32-1)&lt;/code&gt; or what ever your language can handle and &lt;code&gt;2^32-1&lt;/code&gt; or whatever it can handle called &lt;code&gt;x&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;A Boolean that says whether the number satisfies the above equation and the random number that is picked&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;p&gt;• The code must calculate if &lt;code&gt;x&lt;/code&gt; fits this equation rather than take it from an outside source&lt;/p&gt;&#xA;&lt;p&gt;• Results in True if within -0.1 and 0.1&lt;/p&gt;&#xA;&lt;p&gt;• This is code-golf so shortest code (bytes) wins&lt;/p&gt;&#xA;&lt;p&gt;• Builtins that postdate this challenge are allowed unless they are specifically designed for the sole purpose of winning this challenge&lt;/p&gt;&#xA;&lt;p&gt;• Standard code-golf loopholes apply&lt;/p&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;x = 5&#xA;e^π / 5 ^ rand(0,5) = 0&#xA;rand(0,5) = 2&#xA;results False (0.92)&#xA;&#xA;x = 6&#xA;e^π / 6 ^ rand(0,6) = 0&#xA;rand(0,6) = 4&#xA;results True (0.01)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerDisplayName="user63571" LastEditorUserId="-1" LastEditorDisplayName="user63571" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-26T15:35:52.417" CommentCount="20" ContentLicense="CC BY-SA 3.0" />
  <row Id="11359" PostTypeId="2" ParentId="2140" CreationDate="2017-01-26T01:44:28.293" Score="3" Body="&lt;h1&gt;Does Mathematica Have a Builtin?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/106949/56656&quot;&gt;Mathematica&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/66129/56656&quot;&gt;has&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/106614/56656&quot;&gt;a&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/65341/56656&quot;&gt;lot&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/106428/56656&quot;&gt;of&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/104397/56656&quot;&gt;builtins&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to take in a question names and its tags; and to guess whether or not Mathematica has a builtin that solves that question.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Your code must be less than 100 bytes long.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may use internet to access &lt;a href=&quot;http://reference.wolfram.com/language/&quot; rel=&quot;nofollow noreferrer&quot;&gt;the Mathematica reference guide&lt;/a&gt; you may also use the internet to access the tag wikis.  Standard loopholes apply to internet access.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For this challenge we will consider a valid builtin to be a builtin that does most of the computation for the challenge.  Extra bytes spent on trivialities like IO formatting will be ignored.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You must output a truthy value if Mathematica has a builtin to solve that challenge and a falsy value otherwise.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If Mathematica has a builtin and for some reason the challenge does not allow Mathematica to compete or bans builtins your program must still output truthy.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt; so you will be scored on the percentage questions &lt;a href=&quot;https://gist.github.com/Wheatwizard/4ebf941cbe6b44956824aacd82e48000&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; &lt;em&gt;(This is currently a work in progress there will be more cases in the final question)&lt;/em&gt; that your program gets the correct answer on.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-23T18:46:37.897" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="11360" PostTypeId="2" ParentId="2140" CreationDate="2017-01-26T06:34:28.343" Score="1" Body="&lt;h1&gt;Interpreter chain!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Create an interpreter for the previous submission! The interpreter could take a string, an array of characters, etc.&lt;/p&gt;&#xA;&lt;p&gt;Your interpreter must be able to identify each command in the input and interpret the commands.&lt;/p&gt;&#xA;&lt;p&gt;The first answer must print the integers from 1 to 10.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;I/O&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;(We need this because some languages have trouble with arrays of strings)&lt;/p&gt;&#xA;&lt;p&gt;To chain the answers, we would need a delimiter to separate the code to interpret and the input of the interpreted code. Thus, you may use any single-character delimiter of your choice to separate the two inputs. Your program must be able to separate the two inputs. Your actual input will always be one string.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;What if the previous answer is in Mathematica?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;You only need to implement the commands used in the previous submission. That is, if your program/function is run with the previous submission as input, it should become an interpreter for the submission before that. Chaining all the answers would ultimately give integers from 1 to 10.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;The commands in the previous answer are too complicated/high-level!&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;There is no need to implement all aspects of those commands. Your implementation only needs to have identical behavior to the original command when it is used in identical manner to the previous answer.&lt;/p&gt;&#xA;&lt;p&gt;For instance, if the previous answer is in Brainf*ck, and it uses only 10 cells, you do not need to make an infinite tape; a length-10 array will suffice.&lt;/p&gt;&#xA;&lt;p&gt;If the previous answer is in Jelly and has a &lt;code&gt;.&lt;/code&gt; to put 0.5 in the stack, you do not need to implement the usage of &lt;code&gt;.&lt;/code&gt; to form decimal numbers (unless it is used that way).&lt;/p&gt;&#xA;&lt;p&gt;Note: Commands that are no-op still should be implemented as no-op (your code must recognize the commands).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;How do I test my interpreter? It takes too long to evaluate the chain!&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;To prevent this issue, each answer must contain a test program for the next answer. The test program must use all commands in the interpreter, in the same manner.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example of an interpreter&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;An &lt;a href=&quot;http://esolangs.org/wiki/Aheui&quot; rel=&quot;nofollow noreferrer&quot;&gt;Aheui&lt;/a&gt; program:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;방망희 (* This program takes an integer as input and puts it in a stack (방),&#xA;          prints it as integer (망), and then terminates (희) *)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Invalid interpreters in Mathematica:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Print[Input[];Input[]]&#xA;(* This does not interpret the previous solution; it just does the identical task, ignoring the first input (the Aheui code) *)&#xA;&#xA;If[Input[]==&amp;quot;방망희&amp;quot;, Print[Input[]]]&#xA;(* This doesn't define each command *)&#xA;&#xA;Fold[Switch[#2, &amp;quot;방망&amp;quot;, Print[Input[]], &amp;quot;희&amp;quot;, Abort[]]&amp;amp;,, Input[]]&#xA;(* This doesn't define each command *)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Valid interpreter in Mathematica:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Fold[stack={}; Switch[#2, &amp;quot;방&amp;quot;, AppendTo[stack, Input[]], &amp;quot;망&amp;quot;, Print[Last@stack];&#xA;  stack = Most[stack], &amp;quot;희&amp;quot;, Abort[]]&amp;amp;,, Input[]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Loopholes are not allowed&lt;/li&gt;&#xA;&lt;li&gt;Any four consecutive answers cannot contain the same language twice.&lt;/li&gt;&#xA;&lt;li&gt;The second to last submission (i.e. proven not to break the chain) by Feb 12 (0:00 UTC) will be the winner.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Answer format&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;4. [Language](https://link.to.specifications)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;code&gt;Your code here&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;This answer interprets language XYZ.&lt;/p&gt;&#xA;&lt;p&gt;[Try it Online!](https://tio.run/nexus/language#@___/___)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Explanation&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;code snippet&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;This part interprets the &lt;code&gt;x&lt;/code&gt; command.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;code snippet&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;This part interprets the &lt;code&gt;y&lt;/code&gt; command.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;List of commands&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;A&lt;/code&gt;, &lt;code&gt;B&lt;/code&gt;, &lt;code&gt;C&lt;/code&gt;, &lt;code&gt;D&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test program&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;... A( ... ); B( ... ); C( D( ... ) ); ...&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="60043" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-01-27T23:47:02.427" CommentCount="31" ContentLicense="CC BY-SA 3.0" />
  <row Id="11362" PostTypeId="2" ParentId="11211" CreationDate="2017-01-26T15:04:16.160" Score="7" Body="&lt;h1&gt;Post a community wiki for the purpose of &lt;em&gt;attracting&lt;/em&gt; trivial answers, not combining ones that were already posted&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Every now and then we get a question which is formulated in a way (either intentionally or unintentionally) that will allow a large number of trivial answers in a range of languages. Especially in cases where it's unintentional (and the trivial answer is an &quot;exploit&quot; of the question), having a large number of duplicate trivial answers is just noise that a) makes it hard to find the more interesting answers, and b) discourages the posting of more interesting answers that don't use the exploit, in a language where the exploit works.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a problem does admit trivial answers in a large number of languages, this will normally be immediately obvious to someone viewing the post early. As such, I'd strongly recommend posting a community wiki for the purpose &lt;em&gt;before the question has too many answers&lt;/em&gt;, to encourage people to just add their trivial answer with an edit there rather than posting it separately as an answer. See &lt;a href=&quot;https://codegolf.stackexchange.com/a/108142/62131&quot;&gt;here&lt;/a&gt;, for example; that's a community wiki that I originally posted (thinking of this question when I did so) when the question was new and I realised that a literals-only solution would typically be a valid answer to the question as worded. If not for the community wiki, we might well have made the thread unusable as a result of 19 identical answers cluttering it up; a single answer showing the exploit is interesting, a large number of duplicate answers isn't.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We can also see that there are answers on the page in some of the languages where the trivial solutions work; some of them are longer, but much more interesting. Without the community wiki, that may well not have happened (as people typically scroll through the list of languages to see if theirs is listed, if there's a shorter one shown already, they may well just not bother).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The big advantage of doing things this way is that we aren't retroactively penalising users, but rather encouraging them to help keep the thread clean via giving a push in advance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that this typically only works in questions which have some sort of exploit (literal-only answer, zero-byte answer, syntax errors being a valid solution in many languages, and the like). If the question is one which is expected to be solved via a trivial, non-exploit answer, then the best approach is probably just to downvote the question and post answers separately per language, so that it can have some sort of value as a catalog; the thread's likely to be unusable in that case anyway, and there's no benefit in encouraging the posting of less trivial answers as there'll be nothing differentiating them from the trivial one but the lack of golfing.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2017-01-26T15:04:16.160" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11363" PostTypeId="2" ParentId="11320" CreationDate="2017-01-26T16:21:00.507" Score="5" Body="&lt;h1&gt;(Self-)Nomination for orlp&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://chat.stackexchange.com/users/64910/orlp&quot;&gt;Chat profile&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Online during essentially any time due to varying sleep patterns.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I've been active on PPCG for 1.5 years now, and regularly hang out in the chat. You can expect permissive policing from me, but with a clear goal: stimulating intellectually engaging conversation in 19b. My main reason for applying as room owner is to improve the noise/signal ratio in the 19b. Math, golfing, mini-challenges, interesting observations: in. Memes, 'hi', 'anyone here?', avocads, bots: out.&lt;/p&gt;&#xA;" OwnerUserId="4162" LastActivityDate="2017-01-26T16:21:00.507" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11370" PostTypeId="2" ParentId="2140" CreationDate="2017-01-27T15:32:40.063" Score="0" Body="&lt;h1&gt;Binary Grids&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider the N-dimensional binary grid, with dimensions {d1,d2,...,dN}. Here are a few examples:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;6 (N=1): &lt;code&gt;100101&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;3x7 (N=2):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1001001&#xA;0110110&#xA;1001001&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;3x3x3 (N=3):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;010   001   100&#xA;100   011   110&#xA;011   110   001&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;What each of these example grids have in common is: &lt;em&gt;they do not contain any consecutive sequences of the same digit longer than 2.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program or function which, given a list of dimensions, outputs the number of binary grid configurations with the given dimensions that satisfy this condition.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A list of positive integers (&gt;1), either via stdin or passed as an argument. Example: &lt;code&gt;3 2 6&lt;/code&gt;, &lt;code&gt;[3,2,6]&lt;/code&gt;, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The number of valid configurations, either as a returned value or printed to stdout, or something similar.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Constraints&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;While brute-force solutions can work, their time complexity is &lt;em&gt;O(2^N)&lt;/em&gt;, which is way too long for anything but the smallest grids. Write something which will complete before my computer becomes obsolete, please!&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are forbidden, not that I think very many of them would apply here anyway.&lt;/li&gt;&#xA;&lt;li&gt;This is code-golf, so the shortest code wins, with tiebreakers going to the fastest code.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Is this interesting?&lt;/li&gt;&#xA;&lt;li&gt;Is this doable?&lt;/li&gt;&#xA;&lt;li&gt;What's a better way to word the time complexity restrictions?&lt;/li&gt;&#xA;&lt;li&gt;The only example for which I actually know the answer is for &lt;code&gt;[6]&lt;/code&gt;... do I need more? I'd have to solve this myself first...&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="31863" LastActivityDate="2017-01-27T15:32:40.063" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11373" PostTypeId="1" CreationDate="2017-01-28T00:15:41.733" Score="4" ViewCount="324" Body="&lt;p&gt;We have exited beta now, as far as I can tell.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, the site looks identical to most beta sites.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When will we make our own design?&lt;/p&gt;&#xA;" OwnerUserId="62706" LastActivityDate="2017-01-28T22:34:30.043" Title="How long is it before we get our own design?" Tags="|discussion|site-design|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11374" PostTypeId="2" ParentId="11373" CreationDate="2017-01-28T00:59:08.830" Score="-3" Body="&lt;p&gt;I'd actually prefer it if the site doesn't get a design at all; the vast majority of Stack Exchange designs make the site both ugly, and hard to read at a glance, whereas the beta theme is clear and simple.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even if the site does get a design, there are changes which are rather more pressing; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8350/62131&quot;&gt;this post&lt;/a&gt; lists a number of potential changes from Stack Exchange's end that could help the site function better, and many of those have higher priority than a design would. Things like a custom Tour page would be highly useful, because the site interface currently gives outright misleading information on how the site works.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2017-01-28T00:59:08.830" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11375" PostTypeId="2" ParentId="2140" CreationDate="2017-01-28T18:20:14.510" Score="0" Body="&lt;h1&gt;Golf Me a Bubble Sort&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to create a program that performs a bubble sort.&lt;br&gt;&#xA;For those who don't know, a bubble sort is a simple sorting algorithm where two adjacent items are taken &amp;amp; swapped if they are in the wrong order until all values are in the correct order.  &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You must provide an explanation for how your answer does a bubble sort.&lt;/li&gt;&#xA;&lt;li&gt;You may &lt;em&gt;not&lt;/em&gt; use built-in or standard library sorting algorithms. You must make your own code.&lt;/li&gt;&#xA;&lt;li&gt;Your program should take a group of numbers as input and output them in the correct order.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input format: &lt;code&gt;10 5 9 2 . . . (and so on)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Output can be an array returned by the program when run.&lt;/li&gt;&#xA;&lt;li&gt;Output can also be the correctly ordered values separated by whitespace.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Speed does not matter as much as of the program functions.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;10 5 9 2 1 6 8 3 7 4&lt;/code&gt; (you can format it differently depending on your language)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1 2 5 4 3&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="64706" LastActivityDate="2017-01-28T18:20:14.510" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11376" PostTypeId="2" ParentId="11373" CreationDate="2017-01-28T22:26:19.983" Score="6" Body="&lt;p&gt;As far as I know SE is looking into implementing new features, which PPCG would also benefit from. It seems that they want to wait with producing a design until those features are worked out, because the design could be affected by them, see e.g. &lt;a href=&quot;http://disq.us/p/1fnnnoa&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2017-01-28T22:34:30.043" LastActivityDate="2017-01-28T22:34:30.043" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11377" PostTypeId="2" ParentId="2140" CreationDate="2017-01-28T22:54:49.143" Score="1" Body="&lt;p&gt;This is my first attempt at posting a code golf question. :) The following task is something that I've been thinking about for a while now. To me it seems that most code golf tasks, while often quite amazing, are of little more than of academic interest to anyone. In the modern world (of the World Wide Web), however, RESTful web services are of utmost importance. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I haven't seen many tasks like this here, so I wonder if it's appropriate, or if it needs any additional specs?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;RESTful Web Service&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task in a nutshell: implement a web server that can store and return values in a key-value fashion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Rules&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Your application must act as a web server on localhost. The TCP port number must be 80 or higher.&lt;/li&gt;&#xA;&lt;li&gt;The server must be usable with the command line tool named &lt;em&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/CURL&quot; rel=&quot;nofollow noreferrer&quot;&gt;curl&lt;/a&gt;&lt;/em&gt;, which comes pre-installed in every Linux system.&lt;/li&gt;&#xA;&lt;li&gt;The server is essentially a key-value storage where the keys are integers. You may choose to have your keys start from either 0 or 1, i.e. from localhost:80/0 or localhost:80/1. Your server must support storing &lt;em&gt;at least&lt;/em&gt; 256 values, i.e. up to localhost:80/255, or /256 if you chose 1-based indexing.&lt;/li&gt;&#xA;&lt;li&gt;&quot;HTTP PUT&quot; to an address must update the value, &quot;HTTP GET&quot; must retrieve it: for example, &quot;&lt;strong&gt;curl -XPUT -d 'foo' localhost:80/5&lt;/strong&gt;&quot; must store the value &quot;&lt;em&gt;foo&lt;/em&gt;&quot; into position 5. &quot;&lt;strong&gt;curl -XGET localhost:80/5&lt;/strong&gt;&quot; must then return &quot;&lt;em&gt;foo&lt;/em&gt;&quot;. &quot;GET&quot; and &quot;PUT&quot; are the only HTTP verbs that need to be supported.&lt;/li&gt;&#xA;&lt;li&gt;The server must always return the HTTP status code &quot;200 OK&quot;, unless the user GETs an URL where nothing has been stored yet, in which case the status code must be &quot;404 Not Found&quot;.&lt;/li&gt;&#xA;&lt;li&gt;The server must be able to store values that are of at least 64 bytes long.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;This is a code golf task, so the &lt;strong&gt;shortest answer wins&lt;/strong&gt;.&lt;/p&gt;&#xA;" OwnerUserId="4250" LastEditorUserId="4250" LastEditDate="2017-01-31T14:09:49.160" LastActivityDate="2017-01-31T14:09:49.160" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="11378" PostTypeId="2" ParentId="2140" CreationDate="2017-01-29T14:11:33.760" Score="1" Body="&lt;h1&gt;Chicken&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;No, before you ask,this challenge is not about the language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Chicken is a game played with two cars (or two computers) where two drivers face each-other on a street. Each car may swerve or stay fixed in its path. Here is an idealized payoff matrix&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;              Player 1&#xA;                  Swerve        Stay&#xA;Player 2 Swerve    +3/+3        +10/+1          &#xA;&lt;hr/&gt;Stay                +1/+10      -25/-25    &#xA;&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The values given for both swerving reflects the lack of ego damage, +3 is given for a win, but both staying results in a bothersome predicament with a high risk of a crash and where both have to reverse. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now your job is to write a bot that will play this game. You will be provided with needed information as command line arguments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A sample invocation will look like this.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;foolanguage myBot.foo 4 w,w,w,w,w,w,t,w&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where the first command line argument is a string containing the number of goes you have had in the match and the second is a list containing each of you and your opponents decisions respectively (w is swerve and t is stay). Here is a break down of the list.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; (your first move),(opponents first move),(your second),(opponents second) &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This will be set up in a round robin fashion. You will play some arbitrarily high (say 100) rounds against each bot and your score will be totalled. Least damaged bot (highest scoring bot) wins! &#xA;&lt;hr/&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Entering&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You will provide a command stem and a unique bot name. &#xA;So the sample bot can be called fooBot, and the command stem (after which arguments are appended) looks like &quot;foolanguage myBot.foo&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your bot will then output w (swerve) or t (stay) with 50 ms. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your bot must be be able to make both choices. No locking in to just one choice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, your bot must be deterministic (prng's may be seeded with a private seed. If you wish to do this, insert a dummy seed, and change it right before the competition) please publish the has to ensure you don't tweak it in light of other submissions. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;hr/&gt;&#xA;The payoff matrix isn't quite realistic, but in order to make this game make sense and various strategies to work, I decided its important to tailor it this way.&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="46918" LastEditDate="2017-01-30T23:55:16.517" LastActivityDate="2017-01-30T23:55:16.517" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="11381" PostTypeId="1" CreationDate="2017-01-30T03:24:05.643" Score="5" ViewCount="114" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/108041/19365&quot;&gt;This answer&lt;/a&gt; to the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/107964/output-programming-language-name&quot;&gt;Output your programming language name&lt;/a&gt; challenge is invalid: it doesn't actually produce output, and arguably isn't even a program (at least, not in the language it claims to be written in).  Normally, this would be dealt with by downvoting the answer into oblivion.  However, the question got on the HNQ list, and to an outsider, it looks like a clever trick to get an extremely short program, making it the fourth-highest-voted answer.  How do we deal with this?&lt;/p&gt;&#xA;" OwnerUserId="19365" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2017-01-30T03:27:56.993" Title="Dealing with a highly-popular invalid answer" Tags="|discussion|answers|" AnswerCount="0" CommentCount="0" ClosedDate="2017-01-30T13:15:42.157" ContentLicense="CC BY-SA 3.0" />
  <row Id="11388" PostTypeId="2" ParentId="2140" CreationDate="2017-01-30T23:07:18.413" Score="0" Body="&lt;h1&gt;Find fixed points of the Logistic Map&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Definitions&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Logistic Map&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A logistic map is defined as the following equation:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/9MpiO.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/9MpiO.gif&quot; alt=&quot;equation&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Where the next value in the map (on the left) is determined by a function of the current value (on the right), where the constant lambda represents a set constant between zero and four (non-inclusive, along the reals).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Stable Point&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A &quot;stable point&quot; in relation to a map is a point which is approached repeatedly by iterating the logistic map. They are distinct, and there are one to many for any given lambda.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a function or program which, given an input real value &lt;code&gt;n&lt;/code&gt; between zero and four (non-inclusive), returns the number of stable points for a map where lambda is &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Soon to be added&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Main problem: Defining &quot;stable point&quot;. Is this definition sufficient?&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="44713" LastEditDate="2017-01-31T09:56:25.570" LastActivityDate="2017-01-31T09:56:25.570" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11390" PostTypeId="2" ParentId="2140" CreationDate="2017-01-31T13:06:10.880" Score="0" Body="&lt;p&gt;&lt;strong&gt;Language contest&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Moving this here from normal question&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, I'm kind of an esolang loony so let me propose the following contest.&#xA;First of all, we do not care about speed: if two algorithms safe the same problems then they are 'equally good' at least for this challenge. Also, let's think in &quot;special case&quot; terms.&#xA;Sorting is the problem of well... sorting a list. However, an algorithm that generates permutations of lists with an abort condition equally solves the sorting problem. However, such an algorithm is more generic as the abort condition allows it to do more stuff. In other words: sorting a list is just a special case of generating permutations with an abort condition. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The idea is to concentrate on the most generic version of an algorithm that solves a problem. In other terms: Getting rid of redundant built-ins in esoteric programming languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The contest would go as following:&#xA;The goal is to create an esoteric concatenative language (not necessarily stack based but concatenative) with the fewest built-ins that solve all problems (in some catalog). However, this would be really boring like that because a minimized version of brainfuck would pretty much win. Thus the 'score' function would likely be a function of 'amount of built-ins' and 'average program length'. One other constraint is that you are not allowed to have redundancy in your built-ins. If you have a built-in &lt;code&gt;sortAsc&lt;/code&gt; and &lt;code&gt;sortDesc&lt;/code&gt; and &lt;code&gt;reverse&lt;/code&gt; then &lt;code&gt;sortAsc = reverse . sortDesc&lt;/code&gt; thus you are disqualified. This also means that if you have too generic loops as built-ins like uhm &lt;code&gt;for&lt;/code&gt; loops you can use these &lt;code&gt;for&lt;/code&gt; loops to create a sort function which means you wouldn't be allowed to have a &lt;code&gt;sort&lt;/code&gt; function. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;What do you guys think? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;TL;DR optimize for program length and least amount of builtins required.&lt;/p&gt;&#xA;" OwnerUserId="5429" LastEditorUserId="5429" LastEditDate="2017-02-01T14:45:08.993" LastActivityDate="2017-02-01T14:45:08.993" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="11392" PostTypeId="2" ParentId="2140" CreationDate="2017-01-31T14:50:07.010" Score="2" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Anyone who would like may post this challenge to main.&lt;/strong&gt; Just give credit to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/53198/lord-of-dark&quot;&gt;@Lordofdark&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;How long will I sleep&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You need to go to bed, but what you need more is to know how long you will sleep until your alarm rings.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Your task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that takes a time (hours and minutes) as input, and outputs the number of hours and minutes until the next occurence of this time.  &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In this challenge every clock in 24h format.&lt;/li&gt;&#xA;&lt;li&gt;You must always get the current time for the same timezone; you can assume the input is in this timezone&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The input time must be in &lt;strong&gt;hours and minutes&lt;/strong&gt; in any convenient &lt;strong&gt;24h format&lt;/strong&gt; for your language.&lt;br&gt;&#xA;Hours and minutes must always be separated by at least one character &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Valid inputs for 8h30:&lt;br&gt;&#xA;&lt;code&gt;&quot;8h30&quot;&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;8H30M&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;8,30&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;8 30&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;[8,30]&lt;/code&gt;&lt;br&gt;&#xA;... &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Invalid inputs for 8h30:&lt;br&gt;&#xA;&lt;code&gt;8.5&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;830&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;510min&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Ouptut&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The output is the difference between current time and the next occurrence of the input time (it can only be today or tomorrow).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The same formatting rules apply : hours and minutes separated by at least one character an in 24h format.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that the output will always be between &lt;code&gt;0h00&lt;/code&gt; and &lt;code&gt;23h59&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples :&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If it is currently 20h10 :&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;7h30 -&gt; 11h20m&#xA;20h -&gt; 23h50m&#xA;21h -&gt; 0h50m&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins. Standard loopholes are prohibited&lt;/p&gt;&#xA;" OwnerUserId="53198" LastEditorDisplayName="user58826" LastEditDate="2017-06-09T14:35:46.780" LastActivityDate="2017-06-09T14:35:46.780" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="11393" PostTypeId="1" CreationDate="2017-01-31T18:56:43.697" Score="6" ViewCount="240" Body="&lt;p&gt;It occurs to me that there isn't really a general consensus on how command line arguments should be treated in polyglots. So...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;What should the consensus on command line arguments in polyglots be?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I see 2 main options:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The command line arguments should be the same for all of the programs&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The command line arguments can be different for different programs&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think the first option as better, personally, just because of the ambiguity in byte counts between multiple languages if they have different arguments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thoughts? Opinions?&lt;/p&gt;&#xA;" OwnerUserId="62574" LastEditorUserId="46271" LastEditDate="2017-01-31T19:05:44.203" LastActivityDate="2017-02-04T14:51:41.263" Title="Command Line Arguments in Polyglots" Tags="|discussion|policy|defaults|" AnswerCount="3" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11394" PostTypeId="2" ParentId="11393" CreationDate="2017-01-31T19:07:04.050" Score="4" Body="&lt;p&gt;They should be the same for all of the programs, because otherwise this is way too abuse prone. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, let's say I wanted to write a vim/python quine (because those are the two languages I know best on this site). Vim allows you run certain commands before opening. So if I give vim the following command line flags, all of the code/keystrokes becomes irrelevant:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;vim file.txt -c &quot;norm iHello World!&quot; -c &quot;wq&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is effectively a zero-byte hello world program. Now my polyglot code is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;print(&quot;Hello world!&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This has no side effects in vim because it has already exited. This is very clearly two different answers but if command line flags don't need to be the same, then this is a perfectly valid polyglot answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm sure there are many language combinations with similar abuses, this is just one example.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can also imagine a language that just runs command line args as python/golfscript/jelly/whatever and ignores all code.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2017-01-31T19:07:04.050" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11395" PostTypeId="2" ParentId="11393" CreationDate="2017-01-31T19:15:34.703" Score="5" Body="&lt;p&gt;The command-line arguments must be allowed to be different, because many language combinations cannot be run with the same command line arguments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider Python and C. Python's invocation is &lt;code&gt;python -c 'code here'&lt;/code&gt;. If we required the C version to also have the &lt;code&gt;-c&lt;/code&gt; flag, then GCC would output an object file, not an executable (because that's what &lt;code&gt;-c&lt;/code&gt; does in GCC).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Potential abuses of command-line flags should be handled as standard loopholes, because a broad policy would certainly cause issues with legitimate uses.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-01-31T19:15:34.703" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11398" PostTypeId="1" CreationDate="2017-02-01T04:13:46.637" Score="19" ViewCount="670" Body="&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; is getting three additional room owners.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11320/12012&quot;&gt;You've had one week to nominate others or yourself&lt;/a&gt;, and now it's time for the actual election.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These are the nominees, in alphabetical order.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;DJMcMayhem&lt;/strong&gt;&lt;br&gt;&#xA;&lt;a href=&quot;http://chat.stackexchange.com/users/144962&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/users/31716&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/31716&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11326/12012&quot;&gt;nomination&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11399/12012&quot;&gt;vote here&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Mego&lt;/strong&gt;&lt;br&gt;&#xA;&lt;a href=&quot;http://chat.stackexchange.com/users/169713&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/users/45941&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/45941&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11325/12012&quot;&gt;nomination&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11400/12012&quot;&gt;vote here&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;mınxomaτ&lt;/strong&gt;&lt;br&gt;&#xA;&lt;a href=&quot;http://chat.stackexchange.com/users/158822&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/users/42643&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/42643&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11327/12012&quot;&gt;nomination&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11401/12012&quot;&gt;vote here&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;orlp&lt;/strong&gt;&lt;br&gt;&#xA;&lt;a href=&quot;http://chat.stackexchange.com/users/64910&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/users/4162/orlp&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/4162/orlp&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11363/12012&quot;&gt;nomination&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11402/12012&quot;&gt;vote here&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;PhiNotPi&lt;/strong&gt;&lt;br&gt;&#xA;&lt;a href=&quot;http://chat.stackexchange.com/users/24697&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/users/2867&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/2867&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11328/12012&quot;&gt;nomination&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11403/12012&quot;&gt;vote here&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;We've added a community wiki answer for each of them. You may vote on as many of them as you want, and the candidates are welcome to vote as freely as anyone else (including for themselves).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Voting will close after 7 days, on February 8 at 05:00 UTC. At the end of the election, the three candidates with the highest scores (upvotes minus downvotes) will be submitted to the moderators and current room owners for approval and instatement as new room owners.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Best of luck to the candidates!&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2017-02-01T04:26:38.783" Title="The Nineteenth Byte is getting more room owners. Cast your votes!" Tags="|discussion|chat|moderation|" AnswerCount="5" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11399" PostTypeId="2" ParentId="11398" CreationDate="2017-02-01T04:13:46.637" Score="41" Body="&lt;h1&gt;&lt;a href=&quot;http://chat.stackexchange.com/users/144962&quot;&gt;DJMcMayhem&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/users/144962&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/fUkmZ.png?s=128&amp;amp;g=1&quot; alt=&quot;&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Chat user since 2015-04-07.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;340 messages this week. 457 messages last week. 409 messages per week.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-02-01T04:13:46.637" CommentCount="0" CommunityOwnedDate="2017-02-01T04:13:46.637" ContentLicense="CC BY-SA 3.0" />
  <row Id="11400" PostTypeId="2" ParentId="11398" CreationDate="2017-02-01T04:15:04.920" Score="43" Body="&lt;h1&gt;&lt;a href=&quot;http://chat.stackexchange.com/users/169713&quot;&gt;Mego&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/users/169713&quot;&gt;&lt;img src=&quot;http://www.gravatar.com/avatar/1a37ae2ad0be3772ffa87aacc07ab5a1?s=128&amp;amp;d=identicon&amp;amp;r=PG&quot; alt=&quot;&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Chat user since 2015-10-08.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;315 messages this week. 503 messages last week. 453 messages per week.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-02-01T04:15:04.920" CommentCount="1" CommunityOwnedDate="2017-02-01T04:15:04.920" ContentLicense="CC BY-SA 3.0" />
  <row Id="11401" PostTypeId="2" ParentId="11398" CreationDate="2017-02-01T04:16:11.527" Score="29" Body="&lt;h1&gt;&lt;a href=&quot;http://chat.stackexchange.com/users/158822&quot;&gt;mınxomaτ&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/users/158822&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/7I6vZ.png?s=128&amp;amp;g=1&quot; alt=&quot;&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Chat user since 2015-08-03.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;248 messages this week. 238 messages last week. 202 messages per week.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-02-01T04:16:11.527" CommentCount="0" CommunityOwnedDate="2017-02-01T04:16:11.527" ContentLicense="CC BY-SA 3.0" />
  <row Id="11402" PostTypeId="2" ParentId="11398" CreationDate="2017-02-01T04:17:14.657" Score="17" Body="&lt;h1&gt;&lt;a href=&quot;http://chat.stackexchange.com/users/64910&quot;&gt;orlp&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/users/64910&quot;&gt;&lt;img src=&quot;http://www.gravatar.com/avatar/7b4b3e7c9ac68b7d2c93ad02d0b9c79d?s=128&amp;amp;d=identicon&amp;amp;r=PG&quot; alt=&quot;&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Chat user since 2013-02-04.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;333 messages this week. 175 messages last week. 236 messages per week.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-02-01T04:17:14.657" CommentCount="0" CommunityOwnedDate="2017-02-01T04:17:14.657" ContentLicense="CC BY-SA 3.0" />
  <row Id="11403" PostTypeId="2" ParentId="11398" CreationDate="2017-02-01T04:18:21.167" Score="27" Body="&lt;h1&gt;&lt;a href=&quot;http://chat.stackexchange.com/users/24697&quot;&gt;PhiNotPi&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/users/24697&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/740Y5.png?s=128&amp;amp;g=1&quot; alt=&quot;&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Chat user since 2011-10-06.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;14 messages this week. 156 messages last week. 60 messages per week.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-02-01T04:18:21.167" CommentCount="0" CommunityOwnedDate="2017-02-01T04:18:21.167" ContentLicense="CC BY-SA 3.0" />
  <row Id="11407" PostTypeId="2" ParentId="2140" CreationDate="2017-02-01T17:54:42.953" Score="0" Body="&lt;h1&gt;Detect skewed exponential sequences&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Observe the following sequence:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 3 9 54 162 729 2187 6561 19683&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We can see that this is equivalent to:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 *    1&#xA;1 *    3&#xA;1 *    9&#xA;2 *   27&#xA;2 *   81&#xA;3 *  243&#xA;3 *  729&#xA;3 * 2187&#xA;3 * 6561&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The sequence on the right is the first 9 values of the exponential function &lt;code&gt;f(x) = 3^x&lt;/code&gt;, that is, the exponential function of 3. It is multiplied element-wise by &lt;code&gt;1 1 1 2 2 3 3 3 3&lt;/code&gt;. Now, this sequences is strictly non-decreasing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to, given a sequence &lt;strong&gt;K&lt;/strong&gt; of length &lt;strong&gt;c&lt;/strong&gt;, determine if there is a strictly non-decreasing list of integers &lt;strong&gt;L&lt;/strong&gt; such that each element &lt;strong&gt;e&lt;/strong&gt;&lt;sub&gt;&lt;strong&gt;j&lt;/strong&gt;&lt;/sub&gt; of (&lt;strong&gt;K&lt;/strong&gt; / &lt;strong&gt;L&lt;/strong&gt;) (element-wise division) is equal to &lt;strong&gt;b&lt;/strong&gt;&lt;sup&gt;&lt;strong&gt;j&lt;/strong&gt;&lt;/sup&gt;, for 0 &amp;le; &lt;strong&gt;j&lt;/strong&gt; &amp;lt; &lt;strong&gt;c&lt;/strong&gt;, and for some &lt;strong&gt;b&lt;/strong&gt; &gt; 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;True cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1                    (1 * 1, base = any)&#xA;1 3 9                (1 1 1 * 1 3 9, base = 3)&#xA;2 4 8 32             (2 2 2 4 * 1 2 4 8, base = 2)&#xA;1 9 27               (1 3 3 * 1 3 9, base = 3)&#xA;1 5 500 2500 13125   (1 1 20 20 21 * 1 5 25 125 625, base = 5)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;False cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 1 1 1              (false because this would have base = 0)&#xA;1 2 3 4              (no base)&#xA;1 2 4 32 16          (decreasing multiplier)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="31957" LastEditDate="2017-02-01T18:44:06.840" LastActivityDate="2017-02-01T18:44:06.840" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11408" PostTypeId="1" CreationDate="2017-02-02T13:55:32.997" Score="28" ViewCount="1705" Body="&lt;p&gt;It is a bit late into this new year, being that we're already in the second month, but we are now cycling the Community Promotion Ads for 2017!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;What are Community Promotion Ads?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Community Promotion Ads are community-vetted advertisements that will show up on the main site, in the right sidebar. The purpose of this question is the vetting process. Images of the advertisements are provided, and community voting will enable the advertisements to be shown.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Why do we have Community Promotion Ads?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is a method for the community to control what gets promoted to visitors on the site. For example, you might promote the following things:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the site's twitter account&lt;/li&gt;&#xA;&lt;li&gt;code puzzle blogs and websites&lt;/li&gt;&#xA;&lt;li&gt;interesting challenge sites&lt;/li&gt;&#xA;&lt;li&gt;cool events or conferences&lt;/li&gt;&#xA;&lt;li&gt;anything else your community would genuinely be interested in&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The goal is for future visitors to find out about &lt;em&gt;the stuff your community deems important&lt;/em&gt;. This also serves as a way to promote information and resources that are &lt;em&gt;relevant to your own community's interests&lt;/em&gt;, both for those already in the community and those yet to join. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Why do we reset the ads every year?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Some services will maintain usefulness over the years, while other things will wane to allow for new faces to show up. Resetting the ads every year helps accommodate this, and allows old ads that have served their purpose to be cycled out for fresher ads for newer things. This helps keep the material in the ads relevant to not just the subject matter of the community, but to the current status of the community. We reset the ads once a year, every December.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The community promotion ads have no restrictions against reposting an ad from a previous cycle. If a particular service or ad is very valuable to the community and will continue to be so, it is a good idea to repost it. It may be helpful to give it a new face in the process, so as to prevent the imagery of the ad from getting stale after a year of exposure.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;How does it work?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The answers you post to this question &lt;em&gt;must&lt;/em&gt; conform to the following rules, or they will be ignored. &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;All answers should be in the exact form of:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[![Tagline to show on mouseover][1]][2]&#xA;&#xA;   [1]: http://image-url&#xA;   [2]: http://clickthrough-url &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Please &lt;strong&gt;do not add anything else to the body of the post&lt;/strong&gt;. If you want to discuss something, do it in the comments.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The question must always be tagged with the magic &lt;a href=&quot;/questions/tagged/community-ads&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;community-ads&amp;#39;&quot; rel=&quot;tag&quot;&gt;community-ads&lt;/a&gt; tag. In addition to enabling the functionality of the advertisements, this tag also pre-fills the answer form with the above required form.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h3&gt;Image requirements&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The image that you create must be 300 x 250 pixels, or double that if high DPI.&lt;/li&gt;&#xA;&lt;li&gt;Must be hosted through our standard image uploader (imgur)&lt;/li&gt;&#xA;&lt;li&gt;Must be GIF or PNG&lt;/li&gt;&#xA;&lt;li&gt;No animated GIFs&lt;/li&gt;&#xA;&lt;li&gt;Absolute limit on file size of 150 KB&lt;/li&gt;&#xA;&lt;li&gt;If the background of the image is white or partially white, there must be a 1px border (2px if high DPI) surrounding it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Score Threshold&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;There is a &lt;strong&gt;minimum score threshold&lt;/strong&gt; an answer must meet (currently &lt;strong&gt;6&lt;/strong&gt;) before it will be shown on the main site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can check out the ads that have met the threshold with basic click stats &lt;a href=&quot;https://codegolf.meta.stackexchange.com/ads/display/11408&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="2414" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2018-01-04T14:51:26.113" Title="Community Promotion Ads - 2017" Tags="|discussion|community-ads|" AnswerCount="10" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11409" PostTypeId="2" ParentId="11408" CreationDate="2017-02-02T13:55:32.997" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://twitter.com/StackCodeGolf&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZJKMH.png&quot; alt=&quot;Help this community grow -- follow us on twitter!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="2414" LastEditorUserId="34718" LastEditDate="2017-04-11T13:56:36.003" LastActivityDate="2017-04-11T13:56:36.003" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11410" PostTypeId="2" ParentId="11408" CreationDate="2017-02-02T14:13:12.597" Score="29" Body="&lt;p&gt;&lt;a href=&quot;https://github.com/Timwi/EsotericIDE/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/dfT0Q.png&quot; alt=&quot;Esoteric IDE — Interpreter/Debugger for esoteric programming languages&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="46271" LastEditDate="2017-03-21T19:37:03.377" LastActivityDate="2017-03-21T19:37:03.377" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11411" PostTypeId="2" ParentId="11408" CreationDate="2017-02-02T14:32:11.820" Score="66" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/40695&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/n3xsb.png&quot; alt=&quot;Have a challenge idea? Iron out its bugs. Join us in the Sandbox!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="12012" LastEditDate="2017-10-19T01:05:25.083" LastActivityDate="2017-10-19T01:05:25.083" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11413" PostTypeId="2" ParentId="11408" CreationDate="2017-02-02T16:31:25.460" Score="82" Body="&lt;p&gt;&lt;a href=&quot;https://tio.run/#home&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/3rekM.png&quot; alt=&quot;Over 400 online interpreters. Free of charge, open source, and ad-free.&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2017-12-17T21:01:50.293" LastActivityDate="2017-12-17T21:01:50.293" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11414" PostTypeId="2" ParentId="2140" CreationDate="2017-02-02T18:09:43.177" Score="0" Body="&lt;h1&gt;Solve for X&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Given an equation using the following symbols:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Parenthesis: &lt;code&gt;()&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Operators: &lt;code&gt;+-/*&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Variable: &lt;code&gt;x&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Comparators: &lt;code&gt;&amp;lt;=&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;And the following guarantees:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There will only ever be one &lt;code&gt;x&lt;/code&gt; variable.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x&lt;/code&gt; / &lt;code&gt;0&lt;/code&gt; will never be in the denominator.&lt;/li&gt;&#xA;&lt;li&gt;Only one comparator will be used (no &lt;code&gt;&amp;gt;=&lt;/code&gt; or &lt;code&gt;&amp;lt;=&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;All numbers used in the input will be integers.&lt;/li&gt;&#xA;&lt;li&gt;Numbers in the output may be expressed as decimals, the chosen precision should be &lt;code&gt;&amp;gt;= 3&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output the correct reduction for the value of &lt;code&gt;x&lt;/code&gt;.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output should be in the form: &lt;code&gt;x[Operator][Decimal]&lt;/code&gt; (E.G. &lt;code&gt;x=2&lt;/code&gt;)&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;2=x&lt;/code&gt; is not acceptable, you must have x on the left side.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Here are a few examples (The last part in bold is the part you need to output):&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;2+2=x&lt;/code&gt;&#xA;&lt;code&gt;4=x&lt;/code&gt;&#xA;&lt;strong&gt;&lt;code&gt;x=4&lt;/code&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;x=4*3+(2-2)&lt;/code&gt;&#xA;&lt;code&gt;x=4*3+0&lt;/code&gt;&#xA;&lt;strong&gt;&lt;code&gt;x=12&lt;/code&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;1+(x/4)-2=0&lt;/code&gt;&#xA;&lt;code&gt;1+(x/4)=2&lt;/code&gt;&#xA;&lt;code&gt;(x/4)=1&lt;/code&gt;&#xA;&lt;strong&gt;&lt;code&gt;x=4&lt;/code&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;-2*(2+x)&amp;gt;-1*12&lt;/code&gt;&#xA;&lt;code&gt;-2*(2+x)&amp;gt;-12&lt;/code&gt;&#xA;&lt;code&gt;(2+x)&amp;lt;6&lt;/code&gt;&#xA;&lt;strong&gt;&lt;code&gt;x&amp;lt;4&lt;/code&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;-2*x&amp;lt;(29+1)/6&lt;/code&gt;&#xA;&lt;code&gt;-2*x&amp;lt;(30)/6&lt;/code&gt;&#xA;&lt;code&gt;-2*x+2&amp;lt;5&lt;/code&gt;&#xA;&lt;code&gt;-2*x&amp;lt;3&lt;/code&gt;&#xA;&lt;strong&gt;&lt;code&gt;x&amp;gt;-6&lt;/code&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;(x/-1)*(10/-4)=10*5&lt;/code&gt;&#xA;&lt;code&gt;(x/-1)*(10/-4)=50&lt;/code&gt;&#xA;&lt;code&gt;(x/-1)=-20&lt;/code&gt;&#xA;&lt;strong&gt;&lt;code&gt;x=20&lt;/code&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;(x/-5)*-1+2*8&amp;gt;0&lt;/code&gt;&#xA;&lt;code&gt;(x/-5)*-1+16&amp;gt;0&lt;/code&gt;&#xA;&lt;code&gt;(x/-5)*-1&amp;gt;-16&lt;/code&gt;&#xA;&lt;code&gt;(x/-5)&amp;lt;16&lt;/code&gt;&#xA;&lt;strong&gt;&lt;code&gt;x&amp;gt;-80&lt;/code&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;-1*(4*(6*(x/7)))&amp;lt;10&lt;/code&gt;&#xA;&lt;code&gt;(4*(6*(x/7)))&amp;gt;-10&lt;/code&gt;&#xA;&lt;code&gt;(6*(x/7))&amp;gt;-2.5&lt;/code&gt;&#xA;&lt;code&gt;(x/7)&amp;gt;-0.416&lt;/code&gt;&#xA;&lt;strong&gt;&lt;code&gt;x&amp;gt;-2.916&lt;/code&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, lowest byte-count will be deemed the winner.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-02T18:26:19.807" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11415" PostTypeId="2" ParentId="11408" CreationDate="2017-02-02T18:22:13.197" Score="24" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions?sort=featured&quot;&gt;&lt;img src=&quot;https://stack-exchange-dynamic-ads.herokuapp.com/codegolf.stackexchange.com/bounty.png&quot; alt=&quot;Bounties for everybody&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="34718" LastEditDate="2017-03-21T19:32:48.000" LastActivityDate="2017-03-21T19:32:48.000" CommentCount="18" ContentLicense="CC BY-SA 3.0" />
  <row Id="11418" PostTypeId="2" ParentId="2140" CreationDate="2017-02-02T21:35:46.797" Score="0" Body="&lt;h1&gt;Same Same But Different &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base-conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; rel=&quot;tag&quot;&gt;base-conversion&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;This challenge involves two similar digit-based routines each of which, when given a non-negative integer seed, produce eventually periodic sequences.&lt;br /&gt;&#xA;The goal is to find the nth seed number (counting up) that does not define the two sequences to be the identical (by virtue of the order of its digits), yet does yield sequences of equal pre-periodic length.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Reverse &amp;amp; Absolute Difference Routine.&lt;/h3&gt;&#xA;&lt;p&gt;A reverse and difference sequence may be defined in any given base for a non-negative seed by iteratively taking the absolute difference between the number and itself with its digits reversed.&lt;/p&gt;&#xA;&lt;p&gt;An example:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The number &lt;strong&gt;544&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt; is &lt;strong&gt;1000100000&lt;sub&gt;2&lt;/sub&gt;&lt;/strong&gt;;&lt;br /&gt;&#xA;The reverse of which is &lt;strong&gt;0000010001&lt;sub&gt;2&lt;/sub&gt;&lt;/strong&gt;, which is &lt;strong&gt;17&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;;&lt;br /&gt;&#xA;The difference between the two is &lt;strong&gt;527&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;;&lt;br /&gt;&#xA;Repeating the process we have &lt;strong&gt;527&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt; = &lt;strong&gt;1000001111&lt;sub&gt;2&lt;/sub&gt;&lt;/strong&gt;, reversed is &lt;strong&gt;1111000001&lt;sub&gt;2&lt;/sub&gt;&lt;/strong&gt; = &lt;strong&gt;961&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;, and a difference of &lt;strong&gt;434&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;;&lt;br /&gt;&#xA;Repeating again, &lt;strong&gt;434&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt; = &lt;strong&gt;110110010&lt;sub&gt;2&lt;/sub&gt;&lt;/strong&gt;, reversed is &lt;strong&gt;010011011&lt;sub&gt;2&lt;/sub&gt;&lt;/strong&gt; = &lt;strong&gt;155&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;, and a difference of &lt;strong&gt;279&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;;&lt;br /&gt;&#xA;Repeating again yields &lt;strong&gt;186&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;, then &lt;strong&gt;93&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;, and then &lt;strong&gt;0&lt;/strong&gt;, which will continue to yield &lt;strong&gt;0&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;So, the pre-periodic reversal and difference base-2 trajectory length of &lt;strong&gt;544&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt; is &lt;strong&gt;six&lt;/strong&gt;.&lt;br /&gt;&#xA;- since the iterative procedure may be performed &lt;strong&gt;six&lt;/strong&gt; times before a periodic part, &lt;strong&gt;{0}&lt;/strong&gt;, is reached:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;544&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;, &lt;strong&gt;527&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;, &lt;strong&gt;434&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;, &lt;strong&gt;279&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;, &lt;strong&gt;186&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;, &lt;strong&gt;93&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;, &lt;strong&gt;{0}&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Similarly the pre-periodic reversal and difference base-2 trajectory length of &lt;strong&gt;93&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt; is &lt;strong&gt;one&lt;/strong&gt;&lt;br /&gt;&#xA;...and the pre-periodic reversal and difference base-2 trajectory length of &lt;strong&gt;0&lt;/strong&gt; is &lt;strong&gt;zero&lt;/strong&gt; (as it is in any base).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;em&gt;Note:&lt;/em&gt; Ignoring the &lt;em&gt;absolute&lt;/em&gt; part of this definition, many low bases have their iterations listed at the OEIS: &lt;a href=&quot;http://oeis.org/A055945&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-2&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A055947&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-3&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A055949&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-4&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A055951&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-5&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A055953&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-6&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A055955&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-7&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A055957&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-8&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A055959&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-9&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A056965&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-10&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A055961&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-11&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A055963&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-12&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A055965&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-16&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A055967&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-20&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Kaprekar Routine.&lt;/h3&gt;&#xA;&lt;p&gt;A similar, but different sequence is the &lt;a href=&quot;http://mathworld.wolfram.com/KaprekarRoutine.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Kaprekar sequence&lt;/a&gt; where the &lt;em&gt;absolute difference&lt;/em&gt; above is replaced by the &lt;em&gt;difference&lt;/em&gt;, and the &lt;em&gt;reversal&lt;/em&gt; is preceded by a &lt;em&gt;digit-sort&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;An example:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The number &lt;strong&gt;836381&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt; is &lt;strong&gt;CC31D&lt;sub&gt;16&lt;/sub&gt;&lt;/strong&gt;;&lt;br /&gt;&#xA;Which, reverse-sorted is &lt;strong&gt;DCC31&lt;sub&gt;16&lt;/sub&gt;&lt;/strong&gt;, which is &lt;strong&gt;904241&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;;&lt;br /&gt;&#xA;And forward-sorted is &lt;strong&gt;13CCD&lt;sub&gt;16&lt;/sub&gt;&lt;/strong&gt;, which is &lt;strong&gt;81101&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;;&lt;br /&gt;&#xA;The reverse-sorted less the forward-sorted is then &lt;strong&gt;823140&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;;&lt;br /&gt;&#xA;Repeating the process we have &lt;strong&gt;823140&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt; = &lt;strong&gt;C8F64&lt;sub&gt;16&lt;/sub&gt;&lt;/strong&gt;, reverse-sorted is &lt;strong&gt;FC864&lt;sub&gt;16&lt;/sub&gt;&lt;/strong&gt; = &lt;strong&gt;1034340&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;, forward sorted is &lt;strong&gt;468CF&lt;sub&gt;16&lt;/sub&gt;&lt;/strong&gt; = &lt;strong&gt;288975&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;, and the subtraction yields &lt;strong&gt;745365&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;;&lt;br /&gt;&#xA;Repeating again yields &lt;strong&gt;679830&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;, then &lt;strong&gt;671670&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;, then &lt;strong&gt;806820&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;, then &lt;strong&gt;753525&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;, then &lt;strong&gt;671670&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Notice that we have hit a periodic part of the sequence, &lt;strong&gt;{671670&lt;sub&gt;10&lt;/sub&gt;, 806820&lt;sub&gt;10&lt;/sub&gt;, 753525&lt;sub&gt;10&lt;/sub&gt;}&lt;/strong&gt;, so the pre-periodic Kaprekar base-16 trajectory of &lt;strong&gt;836381&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt; is &lt;strong&gt;four&lt;/strong&gt;:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;836381&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;, &lt;strong&gt;823140&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;, &lt;strong&gt;745365&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;, &lt;strong&gt;679830&lt;sub&gt;10&lt;/sub&gt;&lt;/strong&gt;, &lt;strong&gt;{671670&lt;sub&gt;10&lt;/sub&gt;, 806820&lt;sub&gt;10&lt;/sub&gt;, 753525&lt;sub&gt;10&lt;/sub&gt;}&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;em&gt;Note:&lt;/em&gt;: Once again the OEIS lists the iterations for some low bases: &lt;a href=&quot;http://oeis.org/A164884&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-2&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A164993&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-3&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A165012&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-4&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A165032&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-5&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A165051&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-6&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A165071&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-7&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A165090&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-8&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A165110&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-9&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A151949&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-10&lt;/a&gt;.&lt;br /&gt;&#xA;Furthermore some pre-periodic sequences also exist: &lt;a href=&quot;http://oeis.org/A164885&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-2&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A164995&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-3&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A165014&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-4&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A165034&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-5&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A165053&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-6&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A165073&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-7&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A165092&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-8&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A165112&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-9&lt;/a&gt;, &lt;a href=&quot;http://oeis.org/A151962&quot; rel=&quot;nofollow noreferrer&quot;&gt;base-10&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Same same...&lt;/h3&gt;&#xA;&lt;p&gt;Any number whose digits are already either forward or reverse sorted in some base will have the same pre-periodic trajectory length for both sequences in that base, since the resulting procedure will be identical.&lt;/p&gt;&#xA;&lt;p&gt;There are, however, numbers which have the same pre-periodic trajectory length in both sequences even though their digits in the base in question are not already sorted.&lt;/p&gt;&#xA;&lt;p&gt;The first example in base-10 is &lt;strong&gt;107&lt;/strong&gt; which has a pre-periodic trajectory length of &lt;strong&gt;three&lt;/strong&gt; in both sequences:&lt;/p&gt;&#xA;&lt;p&gt;Reverse &amp;amp; difference: &lt;code&gt;&lt;strong&gt;107&lt;/strong&gt;, &lt;strong&gt;594&lt;/strong&gt;, &lt;strong&gt;99&lt;/strong&gt;, &lt;strong&gt;{0}&lt;/strong&gt;&lt;/code&gt;&lt;br /&gt;&#xA;Kaprekar: &lt;code&gt;&lt;strong&gt;107&lt;/strong&gt;, &lt;strong&gt;693&lt;/strong&gt;, &lt;strong&gt;594&lt;/strong&gt;, &lt;strong&gt;{495}&lt;/strong&gt;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Aside&lt;/em&gt;: Any number with less than three digits will always be sorted or reverse-sorted, as will the first three digit number, so the only others to actually check in base-10 before finding &lt;strong&gt;107&lt;/strong&gt; would be &lt;strong&gt;[102-106]&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;The challenge&lt;/h3&gt;&#xA;&lt;p&gt;Write a program or function which when provided with a positive* integer, &lt;strong&gt;n&lt;/strong&gt;, and an integer base greater than one**, &lt;strong&gt;b&lt;/strong&gt;, outputs the &lt;strong&gt;n&lt;sup&gt;th&lt;/sup&gt;&lt;/strong&gt; number (in the natural ordering) which has neither sorted nor reverse-sorted digits in the given base, &lt;strong&gt;b&lt;/strong&gt;, but which &lt;em&gt;does&lt;/em&gt; have the same pre-periodic trajectory length for both procedures defined above in the given base.&lt;/p&gt;&#xA;&lt;p&gt;The input and output are as flexible as ever, however the input and output numbers (or string or list representations thereof) are to be in a single unchanging base, consistent between input and output - for most this will probably mean base ten, but any single base is acceptable, as long as it is consistent across any invocations of the code.&lt;/p&gt;&#xA;&lt;p&gt;* Feel free to have the counting (i.e. &lt;strong&gt;n&lt;/strong&gt;) be 0-based if you would prefer, just say in your submission.&lt;/p&gt;&#xA;&lt;p&gt;** Note there are no such numbers in base-1, so the code does not need to handle b=1 as an input.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Test cases (one-based n, IO in base-10)&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt; n     b  result&#xA; 1     2      17&#xA; 2     2      33&#xA; 3     2      51&#xA; 4     2      65&#xA; 5     2      73&#xA; 6     2      85&#xA;17     2     297&#xA;&#xA; 1     3      28&#xA; 2     3      29&#xA; 3     3      32&#xA; 4     3      48&#xA; 5     3      51&#xA; 6     3      55&#xA;17     3     101&#xA;&#xA; 1    10     107&#xA; 2    10     160&#xA; 3    10     161&#xA; 4    10     172&#xA; 5    10     186&#xA; 6    10     187&#xA;17    10     329&#xA;&#xA; 1    16     264&#xA; 2    16     266&#xA; 3    16     355&#xA; 4    16     373&#xA; 5    16     400&#xA; 6    16     401&#xA;17    16     522&#xA;&#xA; 1   257   66179&#xA; 2   257   98949&#xA; 3   257   98951&#xA; 4   257   98953&#xA; 5   257   98955&#xA; 6   257   98957&#xA;17   257   98979&#xA;&#xA; 1  1234 1523375&#xA; 2  1234 2242181&#xA; 3  1234 2243417&#xA; 4  1234 2244655&#xA; 5  1234 2245897&#xA; 6  1234 2247147&#xA;17  1234 2260770&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="53748" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-02T10:42:40.773" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11422" PostTypeId="1" CreationDate="2017-02-03T04:17:24.157" Score="7" ViewCount="202" Body="&lt;p&gt;On the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/61384&quot;&gt;default allowed I/O methods&lt;/a&gt;, we have come to a consensus that programs may &lt;em&gt;not&lt;/em&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8731/61384&quot;&gt;take input from a predefined variable&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, we have decided that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1503/61384&quot;&gt;anonymous functions are allowed&lt;/a&gt;. In the answer, the poster, arguing that it doesn't make sense to ban anonymous functions, says, &quot;it wastes bytes on something rather arbitrary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Assume that this was a Javascript solution:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;s=x=&amp;gt;x+1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;By that argument, we could remove the &lt;code&gt;s=&lt;/code&gt; from the beginning, leaving this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x=&amp;gt;x+1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This means that it can't just be used as a full program by itself, but it is still allowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's the problem: By our current rules, this would be disallowed:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x+1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is taking input from a predefined variable. Arguably, however, the anonymous function header &lt;code&gt;x=&amp;gt;&lt;/code&gt; &lt;em&gt;is also wasting bytes on something arbitrary&lt;/em&gt;. The new snippet can't be used on its own, but that's true for the anonymous function as well. It's just a  matter of whether you declare the input variable in the program or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I understand that this is a slippery slope, but I still think this problem lacks a justified solution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why should taking input from a predefined variable be disallowed?&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2017-02-03T10:07:48.703" Title="Why can't we take input from a variable?" Tags="|discussion|code-golf|specific-question|defaults|" AnswerCount="0" CommentCount="6" ClosedDate="2017-02-04T04:17:21.967" ContentLicense="CC BY-SA 3.0" />
  <row Id="11424" PostTypeId="2" ParentId="2140" CreationDate="2017-02-03T15:48:52.467" Score="-2" Body="&lt;h1&gt;Count My Change&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to sort an array containing the strings &amp;quot;quarter&amp;quot;, &amp;quot;dime&amp;quot;, &amp;quot;nickel&amp;quot;, and &amp;quot;penny&amp;quot; any number of times in no specific order and sort them so that they are in this order: &lt;code&gt;quarter dime nickel penny&lt;/code&gt; (in other words, greatest to least monetary value).&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Your program must take an array as input containing the names of U.S coins and sort them from greatest to least by monetary value.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For those who are not from the U.S or don't use change, the values of U.S coins, from greatest to least, are:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Quarter: 25 cents&lt;/li&gt;&#xA;&lt;li&gt;Dime: 10 cents&lt;/li&gt;&#xA;&lt;li&gt;Nickel: 5 cents&lt;/li&gt;&#xA;&lt;li&gt;Penny: 1 cent&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;You may sort this array in any way you wish, as long as the output is ordered by the monetary values shown above.&lt;/li&gt;&#xA;&lt;li&gt;Input can be taken in any way, be it command-line arguments or STDIN.&lt;/li&gt;&#xA;&lt;li&gt;An input array would be all lowercase strings, something like this:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;quarter dime nickel nickel quarter dime penny penny&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;If there is a value in input that is not a quarter, dime, nickel, or penny, your program should output &lt;code&gt;0&lt;/code&gt; .&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;penny nickel dime quarter&lt;/code&gt; should become: &lt;code&gt;quarter dime nickel penny&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;nickel penny penny quarter quarter quarter dime dime dime dime&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;quarter dime nickel nickel quarter dime penny penny&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;euro quarter nickel dime&lt;/code&gt; would output 0 because a &lt;code&gt;euro&lt;/code&gt; is not U.S currency.&lt;/li&gt;&#xA;&lt;li&gt;esac (not a test case, I just like bash a lot)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so standard rules &amp;amp; loopholes apply.&lt;/p&gt;&#xA;" OwnerUserId="64706" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-03T16:33:29.747" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11426" PostTypeId="2" ParentId="2140" CreationDate="2017-02-03T18:53:25.047" Score="0" Body="&lt;h3&gt;A kinda different large number contest&lt;/h3&gt;&#xA;&lt;p&gt;I really like large number's and code puzzles so I really like these large number contests. And I would like to have an other even if it's a duplicate. I feel like a lot of people feel the same way.&lt;/p&gt;&#xA;&lt;p&gt;So I had to be creative and come up with a slight variation. I had the idea of prohibiting recursion since most of the fast growing techniques require it.&#xA;Practically I might a accomplish this by only allowing a single array/list for memory.&lt;/p&gt;&#xA;&lt;p&gt;I think it's almost impossible to avoid this idea being closed as a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/18028/largest-number-printable&quot;&gt;Largest Number Printable&lt;/a&gt; but if there is interest I will work it out a lot more. And maybe I will be able to convince 5 people it's an interesting competition despite of the duplicate.&lt;/p&gt;&#xA;&lt;p&gt;(And in case this is unclear it would be a you have X bytes to make a program the outputs the largest number)&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/busy-beaver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;busy-beaver&amp;#39;&quot; rel=&quot;tag&quot;&gt;busy-beaver&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;contest&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Do you have any further ideas, suggestions or tags? Or are you even interested?&lt;/p&gt;&#xA;" OwnerUserId="63550" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-03T18:53:25.047" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11429" PostTypeId="2" ParentId="2140" CreationDate="2017-02-04T00:27:32.040" Score="0" Body="&lt;h1&gt;Fraction Frenzy!&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Task:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to generate the list of reciprocals of the Fraction Frenzy function (&lt;code&gt;FF(n)&lt;/code&gt;) given a positive integer &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Introduction:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Before I can introduce the FF function, I have to first explain Egyptian fractions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Egyptian fractions are a way of expressing fractions as the sum of distinct unit fractions - so one way to express the fraction &lt;code&gt;5/8&lt;/code&gt; is &lt;code&gt;1/2 + 1/8&lt;/code&gt;. It is not other fraction sums like&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1/4 + 1/4 + 1/8&#xA;1/2 + 1/16 + 1/16&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;because not all of their fractions are distinct (&lt;code&gt;1/4&lt;/code&gt; is repeated in the first example, and &lt;code&gt;1/16&lt;/code&gt; in the second).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The FF (Fraction Frenzy) function is described like so:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;FF(1)&lt;/code&gt; is the Egyptian fraction &lt;code&gt;1/2 + 1/3 + 1/5 + 1/-30&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;FF(2)&lt;/code&gt; is equal to &lt;code&gt;FF(1)&lt;/code&gt; &quot;multiplied&quot; by itself (&lt;code&gt;FF(1)&lt;/code&gt; &quot;squared&quot;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  (1/2 + 1/3 + 1/5 + 1/-30)(1/2 + 1/3 + 1/5 + 1/-30)&#xA;= 1/4 + 1/6 + 1/10 + 1/-60 + 1/6 + 1/9 + 1/15 + 1/-90 +&#xA;  1/10 + 1/15 + 1/25 + 1/-150 + 1/-60 + 1/-90 + 1/-150 + 1/900&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is not a fully reduced Egyptian fraction yet, because there are &quot;repeats&quot; in fractions. To reduce them, the following procedure is done:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Sum all &quot;like&quot; unit fractions together.&lt;/li&gt;&#xA;&lt;li&gt;Reduce the sums to their simplest forms - so for example, if a sum from step &lt;code&gt;1&lt;/code&gt; is &lt;code&gt;2/6&lt;/code&gt;, that can be reduced to &lt;code&gt;1/3&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Repeat 1 and 2 until all reciprocals are distinct.&lt;/li&gt;&#xA;&lt;li&gt;If there is a pair of one positive and one negative fraction that have an equal absolute value, remove both of them (e.g. &lt;code&gt;1/-5&lt;/code&gt; and &lt;code&gt;1/5&lt;/code&gt; must both be removed)&lt;/li&gt;&#xA;&lt;li&gt;If fractions are not unit and cannot be reduced further, split it up into unit fractions with a equal denominator, and keep one fraction as it is. With the other ones, multiply them by &lt;code&gt;(1/2 + 1/3 + 1/5 + 1/-30)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Repeat until the final fraction sum is a valid Egyptian fraction.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;This is the reduction of &lt;code&gt;FF(2)&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  1/4 + 1/6 + 1/10 + 1/-60 + 1/6 + 1/9 + 1/15 + 1/-90 +&#xA;  1/10 + 1/15 + 1/25 + 1/-150 + 1/-60 + 1/-90 + 1/-150 + 1/900&#xA;= 1/4 + 2/6 + 1/9 + 2/10 + 2/15 + 1/25 + 2/-60 + 2/-90 + 2/-150 + 1/900 (step 1)&#xA;= 1/4 + 1/3 + 1/9 + 1/5 + 2/15 + 1/25 + 1/-30 + 1/-45 + 1/-75 + 1/900   (step 2)&#xA;= 1/3 + 1/4 + 1/5 + 1/9 + 1/15 + 1/15(1/2 + 1/3 + 1/5 + 1/-30) +        (step 5)&#xA;  1/25 + 1/-30 + 1/-45 + 1/-75 + 1/900&#xA;= 1/3 + 1/4 + 1/5 + 1/9 + 1/15 + 1/30 + 1/45 + 1/75 + 1/-450 +&#xA;  1/25 + 1/-30 + 1/-45 + 1/-75 + 1/900&#xA;= 1/3 + 1/4 + 1/5 + 1/9 + 1/15 + 1/25 + 1/-450 + 1/900                  (step 4)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For all &lt;code&gt;n&lt;/code&gt; (except for &lt;code&gt;1&lt;/code&gt;), &lt;code&gt;FF(n)&lt;/code&gt; is defined by &quot;squaring&quot; &lt;code&gt;FF(n-1)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input and Output:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an integer &lt;code&gt;n&lt;/code&gt;, you must output a list all of the reciprocals of &lt;code&gt;FF(n)&lt;/code&gt;, sorted in ascending order:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 -&amp;gt; [2, 3, 5, -30]&#xA;2 -&amp;gt; [3, 4, 5, 9, 15, 25, -450, 900]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You are allowed to use a string with any delimiter, or your language's interpretation of a list.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specs:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must output the results of the &lt;code&gt;FF(n)&lt;/code&gt; function exactly as specified above.&lt;/li&gt;&#xA;&lt;li&gt;You are guaranteed that the input will be a positive integer - it will never be below zero, and it will never be a decimal (or fraction).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="49561" LastEditDate="2017-02-05T01:51:57.340" LastActivityDate="2017-02-05T01:51:57.340" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11431" PostTypeId="2" ParentId="11393" CreationDate="2017-02-04T14:51:41.263" Score="7" Body="&lt;p&gt;I think the default for polyglots should be that each language needs to be run with the simplest possible invocation (i.e. something that would get it a 0 byte penalty for command line arguments). This might or might not lead to the actual command lines being identical (because some interpreters need command line arguments to do anything at all).&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-02-04T14:51:41.263" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11432" PostTypeId="2" ParentId="2140" CreationDate="2017-02-04T16:02:18.673" Score="1" Body="&lt;h1&gt;Blank Card + Jera + Batteries&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Background&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In the dungeon-style game &quot;&lt;a href=&quot;http://bindingofisaac.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Binding of Isaac&lt;/a&gt;&quot;, there is a trick involving the use of three items, called the Blank Card, Jera, and the Battery. The Blank Card is a usable item that allows for the use of single-use items repeatedly when charged, the Jera item (single-use) allows for the duplication of items on the ground, and the Battery is a ground item which charges the current usable item. Having all three at once allows the player create as many batteries as they please, allowing them to gather all the player-stat altering items in the game with minimal effort.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, the number of batteries which appear when repeatedly duplicating the batteries depends on a few things. Say that, at any given time, you have &lt;code&gt;n&lt;/code&gt; batteries on the ground. Every time that you grab the battery and use the card simultaneously, you end up with &lt;code&gt;2n - 1&lt;/code&gt; batteries on the ground (where &lt;code&gt;n&lt;/code&gt; is the number of batteries you had just before picking up the battery). Your new &lt;code&gt;n&lt;/code&gt; is now the current number of batteries on the ground. This sequence continues with each use of the blank card (hereon referred to as an &quot;iteration&quot;).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;General Formula&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For the sake of clarification, the general formula for this sequence may be found below:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://latex.codecogs.com/gif.download?b_%7Bn+1%7D%20%3D%202b_n-1&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://latex.codecogs.com/gif.download?b_%7Bn+1%7D%20%3D%202b_n-1&quot; alt=&quot;general form&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;b&lt;/code&gt; represents the number of batteries and &lt;code&gt;n&lt;/code&gt; represents the number of iterations.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given two positive integers &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt;, where &lt;code&gt;x&lt;/code&gt; is an initial amount of batteries (&lt;code&gt;b&lt;sub&gt;0&lt;/sub&gt;&lt;/code&gt;) and &lt;code&gt;y&lt;/code&gt; is the number of iterations to enact (&lt;code&gt;n&lt;/code&gt;), write a program or function which finds the number of batteries you end up with on the ground.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let &lt;code&gt;f(x, y)&lt;/code&gt; be the function defined in the task and let &lt;code&gt;[]&lt;/code&gt; symbolize the steps taken to reach the answer (not included in this challenge):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt; f(1, 5)&#xA;1&#xA;[1, 1, 1, 1, 1]&#xA;&#xA;&amp;gt;&amp;gt;&amp;gt; f(2, 4)&#xA;17&#xA;[3, 5, 9, 17]&#xA;&#xA;&amp;gt;&amp;gt;&amp;gt; f(8, 8)&#xA;1793&#xA;[15, 29, 57, 113, 225, 449, 897, 1793]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="44713" LastEditDate="2017-02-06T13:18:15.323" LastActivityDate="2017-02-06T13:18:15.323" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11433" PostTypeId="2" ParentId="2140" CreationDate="2017-02-04T18:53:39.307" Score="0" Body="&lt;h1&gt;Conjugate a Spanish Verb&lt;/h1&gt;&#xA;&lt;h2&gt;A Little Background&lt;/h2&gt;&#xA;&lt;p&gt;I thought up this challenge, believe it or not, in a spanish class. I was thinking how simple it is to conjugate regular spanish present tense verbs and the programmer in me told me to make a question about it on PPCG&lt;/p&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a regular Spanish infinitive and a subject, conjugate the infinitive in the present. &lt;a href=&quot;http://www.wikihow.com/Conjugate-Spanish-Verbs-(Present-Tense)&quot; rel=&quot;nofollow noreferrer&quot;&gt;How to do such a thing.&lt;/a&gt; For the sake of simplicity assume that all of the verbs are regular infinitives not irregular, stem-changing or reflexive.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;-The input may be given in any reasonable format&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;subject verb | verb subject| subject,verb | [&amp;quot;subject&amp;quot;, &amp;quot;verb&amp;quot;] etc. &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;-If the input is not valid you may output anything or nothing at all&lt;/p&gt;&#xA;&lt;p&gt;-The input is not valid if&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a) It does not contain a regular, spanish, infinitive verb or a Spanish subject&#xA;&#xA;b) It is not in the appropriate format, which you must specify&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;-The output can have any capitalization and is alowed trailing whitespace&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;p&gt;Assume the input is given as &amp;quot;verb, subject&amp;quot; (Without the quotes)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;comer, yo              --&amp;gt; como&#xA;ir, vosotros           --&amp;gt; Anything (Irregular)&#xA;jugar, ellas           --&amp;gt; Anything (Stem Changing)&#xA;                       --&amp;gt; Anything (Empty)&#xA;gsmkhnjkgn, tu         --&amp;gt; Anything (Not a verb)&#xA;sacar, ésdfgs          --&amp;gt; Anything (Not a subject)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="63566" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-04T19:10:02.193" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11434" PostTypeId="2" ParentId="2140" CreationDate="2017-02-04T19:59:47.680" Score="2" Body="&lt;h1&gt;How extreme can a letter be?&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a function or program that accepts a rectangular grid of letters (&lt;code&gt;A&lt;/code&gt;-&lt;code&gt;Z&lt;/code&gt;) as input, and provides an output as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the grid contains repeated letters, output the maximum rectilinear distance between two positions on the grid covered by the same letter.&lt;/li&gt;&#xA;&lt;li&gt;If every letter in the grid is unique, output 0.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given this grid:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;AEBZWZSFUS&#xA;XWHZITHJNN&#xA;OQDSLRZFCW&#xA;KOMBQQVAGT&#xA;FAGIBOZZAX&#xA;MECUIFYKYB&#xA;UGURYVFHAT&#xA;IICZSFMUTC&#xA;JPPHXNXSEW&#xA;TSUTJMVCNI&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;...your output should be 17.  This is the rectilinear distance between the &lt;code&gt;S&lt;/code&gt; on the top right corner and the &lt;code&gt;S&lt;/code&gt; on the bottom row.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is code golf; shortest code in bytes wins.  Standard loopholes disallowed.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Formatting&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input via standard input, ordered collections (list/array/etc) of strings, or two dimensional array/list/etc of characters is allowed.&lt;/li&gt;&#xA;&lt;li&gt;Output via return value, exit code, or standard output is allowed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Input guarantees&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;(If the input doesn't comply with these, you don't have to handle it)&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input is a rectangular grid.&lt;/li&gt;&#xA;&lt;li&gt;Every position on the grid is an upper case letter.&lt;/li&gt;&#xA;&lt;li&gt;The grid will be at least 2 characters wide.&lt;/li&gt;&#xA;&lt;li&gt;The grid will be at least 2 characters tall.&lt;/li&gt;&#xA;&lt;li&gt;The grid will be no wider than 98 characters.&lt;/li&gt;&#xA;&lt;li&gt;The grid will be no taller than 98 characters.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Output restriction&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your output should be a single non-negative number indicating the request value.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;IXHNBFJFQLQGKEWVCXCX&#xA;DVBRMDCGENVDYWDJLADY&#xA;FPMTNQHOFPPURUMZXPEJ&#xA;ZLOIFSYPKLXFOYOIKUMJ&#xA;LKZOSZWWKLWLFZBQQLYJ&#xA;-&amp;gt; 19&#xA;&#xA;ABCDEFG&#xA;HIJKLMN&#xA;OPQRSTU&#xA;-&amp;gt; 0&#xA;&#xA;DSMPAHNP&#xA;JUWYNWOE&#xA;AIUOCIPY&#xA;MHODAXVG&#xA;NFETRIWH&#xA;YDQYVLZL&#xA;LDTZBYER&#xA;JEXPFRDR&#xA;-&amp;gt; 13&#xA;&#xA;ZYXWVUTSRQPO&#xA;TSRQPOZYXWVU&#xA;NMLKGIHGFEDC&#xA;HGFEDCNMLKGI&#xA;-&amp;gt; 7&#xA;&#xA;QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ&#xA;QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ&#xA;QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ&#xA;QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ&#xA;QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ&#xA;QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ&#xA;QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ&#xA;QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ&#xA;QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ&#xA;QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ&#xA;QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ&#xA;QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ&#xA;-&amp;gt; 40&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="58514" LastActivityDate="2017-02-04T19:59:47.680" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11435" PostTypeId="2" ParentId="2140" CreationDate="2017-02-04T21:34:05.970" Score="-1" Body="&lt;h1&gt;Consecutive Composites&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a program or function which, given a positive integer &lt;strong&gt;N&lt;/strong&gt;, finds the first block of &lt;strong&gt;N&lt;/strong&gt; consecutive &lt;a href=&quot;https://en.wikipedia.org/wiki/Composite_number&quot; rel=&quot;nofollow noreferrer&quot;&gt;composite numbers&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This should be the &lt;em&gt;first&lt;/em&gt; block of integers which fit the requirements, larger than 0. For example, with an input of &lt;strong&gt;2&lt;/strong&gt;, the output must be &lt;strong&gt;[8, 9]&lt;/strong&gt;, and not &lt;strong&gt;[14, 15]&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The numbers in the block should be printed or returned as a list, in any reasonable format.&lt;/li&gt;&#xA;&lt;li&gt;Submissions may be either full programs which perform I/O, or functions - no snippets.&lt;/li&gt;&#xA;&lt;li&gt;You can assume that the block of numbers your program has been request to find is within your language's standard integer range.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program (in bytes) wins! Standard golfing loopholes apply.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 -&amp;gt; [1]&#xA;2 -&amp;gt; [8, 9]&#xA;5 -&amp;gt; [24, 25, 26, 27, 28]&#xA;6 -&amp;gt; [90, 91, 92, 93, 94, 95]&#xA;10 -&amp;gt; [114, 115, 116, 117, 118, 119, 120, 121, 122, 123]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="60919" LastEditorUserId="60919" LastEditDate="2017-02-04T21:46:35.050" LastActivityDate="2017-02-04T21:46:35.050" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11440" PostTypeId="2" ParentId="2140" CreationDate="2017-02-05T14:48:07.017" Score="-4" Body="&lt;h1&gt;Score Your Language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I believe that each language has a score. The way you find the score of a language is shown in the ungolfed Python program below&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def scorer(lang):&#xA;&#xA;    num = 0&#xA;&#xA;    for i in str(lang):&#xA;        num += ord(i)&#xA;&#xA;    return num&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Basically the score is the total of the unicode values of the language name.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now this seemed like a fairly trivial challange, so I thought I'd make it a bit more difficult. You aren't allowed to use your language name (case-sensitive) in the code. So this code in C++ would be invalid as I've used &lt;code&gt;C++&lt;/code&gt; in the code.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#include &amp;lt;iostream&amp;gt;&#xA;&#xA;int main() {&#xA;&#xA;    int total = 0;&#xA;    std::string s(&quot;C++&quot;);&#xA;&#xA;    for (char &amp;amp; c : s) {&#xA;        total = total + (int)c;&#xA;        c = '*';&#xA;    }&#xA;&#xA;    std::cout &amp;lt;&amp;lt; total;&#xA;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Although this does output the required number (153) it is still invalid.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You aren't allowed to use the language name but are allowed to use it in a different case. E.g. &lt;code&gt;Java&lt;/code&gt; isn't allowed but &lt;code&gt;java&lt;/code&gt; is.&lt;/li&gt;&#xA;&lt;li&gt;This is a code-golf so shortest answer in bytes wins&lt;/li&gt;&#xA;&lt;li&gt;You are allowed to use hex/octal codes in strings e.g &lt;code&gt;\150&lt;/code&gt; can be used instead of &lt;code&gt;h&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Your program must take no input or function arguments&lt;/li&gt;&#xA;&lt;li&gt;You cannot simply output the score. Theoretically the program should work for any language name when changed.&lt;/li&gt;&#xA;&lt;li&gt;Languages where the only valid syntax is the name, such as &lt;a href=&quot;http://torso.me/chicken&quot; rel=&quot;nofollow noreferrer&quot;&gt;Chicken&lt;/a&gt; are allowed to use said name.&lt;/li&gt;&#xA;&lt;li&gt;Version shouldn't be included so Python is always Python not Python 2 or 3&lt;/li&gt;&#xA;&lt;li&gt;The score is the value of the case-sensitive name&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Correct Scores&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Language              Score&#xA;&#xA;ArnoldC                675&#xA;brainfuck              949&#xA;C                       67&#xA;C++                    153&#xA;Java                   386&#xA;Lua                    290&#xA;Mornington Crescent   1922&#xA;Python                 642&#xA;TrumpScript           1165&#xA;Vim                    300&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;1) Why has this been downvoted?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2) I am thinking about putting a reputation limitation so that bosses like Dennis and Martin Büttner can't take answers from people who aren't as accomplished. Is this unfair? Should I not?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;3) Is this a duplicate? I couldn't believe it wasn't already taken.&lt;/p&gt;&#xA;" OwnerDisplayName="user63571" LastEditorDisplayName="user63571" LastEditDate="2017-02-05T20:56:27.447" LastActivityDate="2017-02-05T20:56:27.447" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11441" PostTypeId="1" AcceptedAnswerId="11442" CreationDate="2017-02-05T16:59:48.380" Score="2" ViewCount="142" Body="&lt;p&gt;I have recently created a coding language called &lt;a href=&quot;https://github.com/JaqueIsBaque/Valyrio&quot; rel=&quot;nofollow noreferrer&quot;&gt;Valyrio&lt;/a&gt;. I have also posted a proposal for a question in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt;. I have a problem though. It has been well-established that any builtin or language created after the code-golf has been posted is not allowed and any answer after this is non-competing. However, I added a builtin to Valyrio after I posted the Sandbox proposal that can do this challenge. The question, as of yet, has not been posted as a code-golf problem. Does this mean I can use the built in to complete the challenge or does it violate the non-competing rule?&lt;/p&gt;&#xA;" OwnerDisplayName="user63571" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2017-02-05T18:28:08.067" Title="Is that built in allowed?" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11442" PostTypeId="2" ParentId="11441" CreationDate="2017-02-05T18:28:08.067" Score="5" Body="&lt;h3&gt;It depends&lt;/h3&gt;&#xA;&lt;p&gt;(But based on what I've seen of your built in, probably not)&lt;/p&gt;&#xA;&lt;p&gt;There is a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5772&quot;&gt;loophole&lt;/a&gt; for creating/modifying a language while it's in the sandbox. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default/5772#comment17314_5772&quot;&gt;Dennis' comment&lt;/a&gt; gives 2 main reasons why this is not allowed: It's unfair and boring.&lt;/p&gt;&#xA;&lt;p&gt;Here's where the ambiguity comes in. If your built in makes your answer boring, you probably shouldn't post it (or you could include it in another answer of the same language, If you felt the need). If your built in makes your answer unfair (but not uninteresting!), you may want to post it as it's own answer, but noncompeting.&lt;/p&gt;&#xA;&lt;p&gt;Or you could just leave it out, especially if your answer would only be a few bytes.&lt;/p&gt;&#xA;&lt;p&gt;From (briefly) reading the documentation, It looks like your answer would be very short due to the built in. In that case, I would not post it, as it most likely falls under both categories.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;The bottom line is, If your answer is nontrivial and interesting, then go for it. Otherwise, just let it pass.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="62574" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-05T18:28:08.067" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11443" PostTypeId="2" ParentId="676" CreationDate="2017-02-05T22:01:28.080" Score="-2" Body="&lt;p&gt;3+ years later, the Area 51 proposal referred to in this question is gone, but there's &lt;a href=&quot;http://area51.stackexchange.com/proposals/104641/algorithmic-competitive-programming?referrer=wQLBXjIiUnECLWqm2IPhxQ2&quot;&gt;another proposal&lt;/a&gt; trying to get traction. Please support it if you're interested.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for PP&amp;amp;CG, my impression is that the community is mainly interested in creating and solving its own puzzles, rather than solving/discussing puzzles created on other sites. So although CP questions might seem to be on-topic for PP&amp;amp;CG, in practice they are not. I think a dedicated SE site for competitive programming would make more sense.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Other thoughts on how competitive programming questions work on Stack Exchange sites:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.redgreencode.com/stack-overflow-vs-competitive-programming-questions/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Stack Overflow vs. Competitive Programming Questions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.redgreencode.com/need-stack-exchange-site-competitive-programmers/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Do We Need a Stack Exchange Site for Competitive Programmers?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="25099" LastEditorUserId="25099" LastEditDate="2017-02-06T00:35:02.770" LastActivityDate="2017-02-06T00:35:02.770" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11444" PostTypeId="2" ParentId="2140" CreationDate="2017-02-06T15:40:42.407" Score="1" Body="&lt;h1&gt;Display text in Comic Sans!&lt;/h1&gt;&#xA;&lt;p&gt;I haven't seen any challenges that require outputting text in a variable-width font, and of course I had to pick the best one.&lt;/p&gt;&#xA;&lt;h2&gt;Goal:&lt;/h2&gt;&#xA;&lt;p&gt;Display some text in the font Comic Sans.&#xA;Characters must be variable width; &lt;code&gt;i&lt;/code&gt; should use less space than &lt;code&gt;W&lt;/code&gt;, for example. Kerning is not required.&lt;/p&gt;&#xA;&lt;h3&gt;Notes:&lt;/h3&gt;&#xA;&lt;p&gt;Your score is the program size (in bytes).&lt;br /&gt;&#xA;You may assume that the font &amp;quot;Comic Sans MS&amp;quot; is installed on the computer, or that a font file (or image containing the characters in that font) is in the current directory.&#xA;Storing additional data in this file is not allowed; it must be a standard font or image file.&lt;/p&gt;&#xA;&lt;h3&gt;Input:&lt;/h3&gt;&#xA;&lt;p&gt;A string containing the text to display.&#xA;This will only contain printable ASCII characters (32 to 126).&#xA;This can be passed to a function, typed in by the user, loaded from a file, etc.&lt;/p&gt;&#xA;&lt;h3&gt;Output:&lt;/h3&gt;&#xA;&lt;p&gt;The text written in Comic Sans.&#xA;This can be saved as an image, or just displayed on the screen &lt;strong&gt;graphically&lt;/strong&gt;.&#xA;However, direct text output is not allowed.&#xA;For example, this would not be a valid HTML solution:&#xA;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-css lang-css prettyprint-override&quot;&gt;&lt;code&gt;*{font-family:&quot;Comic Sans MS&quot;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;input&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="64538" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-07T15:21:06.137" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11445" PostTypeId="2" ParentId="2140" CreationDate="2017-02-06T18:08:40.247" Score="5" Body="&lt;h1&gt;Make A Rotating Emoji Globe&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to make a globe out of the following characters, with the line being cleared ever 1/3 of a second:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You must clear the line your emoji globe on it and print the next one every approximate 1/3 of a second.&lt;br&gt;&#xA;Output may be to the terminal or elsewhere.&lt;br&gt;&#xA;The program must also continue until interrupted on purpose.&lt;br&gt;&#xA;Also, your code may not contain the emoji globes themselves, but it may contain Unicode escapes.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so standard loopholes &amp;amp; rules apply.&lt;br&gt;&#xA;May the best coder win... &lt;/p&gt;&#xA;" OwnerUserId="64706" LastEditorUserId="64706" LastEditDate="2017-02-08T15:07:50.940" LastActivityDate="2017-02-08T15:07:50.940" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="11446" PostTypeId="2" ParentId="2140" CreationDate="2017-02-06T18:45:57.710" Score="0" Body="&lt;p&gt;&lt;strong&gt;Goal&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Take 3 inputs, and output truey or falsey depending on whether or not they make an multiplication/division fact family.  (2 * 4 = 8, 4 * 2 = 8, 8 / 2 = 4, 8 / 4 = 2) Order does not matter, as long as in some way the three numbers make an fact family.  Repeated numbers are allowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Truey Inputs&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2 4 8 &#xA;100 20 5 &#xA;7 7 49&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Falsey Inputs&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;7 8 9&#xA;12 3 0&#xA;512 600 73&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;br&gt;&#xA; The values should be passed to the program as parameters or variables.  Expect that only positive integers, and only 3 of them, will be passed to the program.  You may write either a full program or a function, which either prints or returns the result.  This is code-golf, so the shortest answer in bytes wins. Standard loopholes are forbidden.&lt;/p&gt;&#xA;" OwnerUserId="65245" LastEditorUserId="65245" LastEditDate="2017-02-07T00:45:04.607" LastActivityDate="2017-02-07T00:45:04.607" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11447" PostTypeId="1" CreationDate="2017-02-06T20:00:02.630" Score="17" ViewCount="370" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8356/8478&quot;&gt;One of the more popular suggestions&lt;/a&gt; from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8350/8478&quot;&gt;We&amp;#39;re not a Q&amp;amp;A site. But what should be done about it?&lt;/a&gt; was to improve the wording of the close reasons or maybe change some of them altogether. We've been asked to flesh this out in a separate feature request so that SE can look into whether they'll make these changes for us.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So you don't have to follow the link above, here is the body of that proposal:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Mods can edit a few slots of custom off-topic reasons. However, the majority of close vote reasons are fixed and cannot be changed by us. While the &lt;em&gt;names&lt;/em&gt; of the reasons largely make sense here, their descriptions don't:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Duplicate: &quot;This question already has an answer here:&quot;, &quot;This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.&quot;&lt;/li&gt;&#xA;  &lt;li&gt;Unclear: &quot;Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question.&quot;&lt;/li&gt;&#xA;  &lt;li&gt;Too broad: &quot;There are either too many possible answers, or good answers would be too long for this format. Please add details to narrow the answer set or to isolate an issue that can be answered in a few paragraphs.&quot;&lt;/li&gt;&#xA;  &lt;li&gt;Primarily opinion based: &quot;Many good questions generate some degree of opinion based on expert experience, but answers to this question will tend to be almost entirely based on opinions, rather than facts, references, or specific expertise.&quot; (This one in particular I don't think we need at all, because we've got that covered with lack of objective winning criterion.)&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;  &#xA;  &lt;p&gt;The notice boxes and tooltips on questions that &lt;em&gt;are&lt;/em&gt; closed have similar problems. We also might want to think about whether there's a custom close reason that doesn't really fit under the &quot;off-topic&quot; banner.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So this post is here to discuss what close reasons we could really use and how they should be worded. There are of course several parts to this discussion, but it will be easier to keep everything in one place. Hence, I would suggest limiting answers to suggestions for &lt;em&gt;one&lt;/em&gt; of the close reasons, so that the votes can more accurately show which suggestions have the community's support and which ones don't.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I assume that answers will fall into three categories:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Suggestions for rewording one of the existing close reasons. This should include all the relevant texts (the explanation that is shown before selecting the close reason, any notices that are shown on answers that have been closed with this reason, as well as any potential tooltips.&lt;/li&gt;&#xA;&lt;li&gt;Suggestions for removing one of the reasons completely. This should only be done if we really have no use for it, because this will be a fairly permanent change.&lt;/li&gt;&#xA;&lt;li&gt;Suggestions for adding a new reason that cannot be covered as a custom off-topic reason. If we get any of these at all, it should be something very important that really doesn't make sense as &quot;off-topic&quot; and that won't need changing any time soon, because we'd have to get the devs involved to do so.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="68942" LastEditDate="2021-06-09T06:08:35.850" LastActivityDate="2021-06-09T06:08:35.850" Title="How could the default close reasons be improved?" Tags="|discussion|feature-request|status-deferred|close-reasons|" AnswerCount="5" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="11448" PostTypeId="1" CreationDate="2017-02-06T20:13:10.973" Score="16" ViewCount="285" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8357/8478&quot;&gt;One of the more popular suggestions&lt;/a&gt; from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8350/8478&quot;&gt;We&amp;#39;re not a Q&amp;amp;A site. But what should be done about it?&lt;/a&gt; was to improve the wording of the bounty reasons or maybe change some of them altogether. We've been asked to flesh this out in a separate feature request so that SE can look into whether they'll make these changes for us.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So you don't have to follow the link above, here is the relevant part of the body of that proposal:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;When starting a bounty, people here almost always use either &quot;reward an existing answer&quot; or &quot;draw attention&quot;, occasionally &quot;improve details&quot;. That's because none of the others make any sense here (and the descriptions of these could also be improved):&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&quot;&lt;strong&gt;Authoritative reference needed&lt;/strong&gt; Looking for an answer drawing from credible and/or official sources.&quot; This is simply not a thing here.&lt;/li&gt;&#xA;  &lt;li&gt;&quot;&lt;strong&gt;Canonical answer required&lt;/strong&gt; The question is widely applicable to a large audience. A detailed canonical answer is required to address all the concerns.&quot;  For challenges this doesn't make any sense either. It &lt;em&gt;might&lt;/em&gt; be useful for the odd question about golfing tips, but that can probably be covered with &quot;improve details&quot;.&lt;/li&gt;&#xA;  &lt;li&gt;&quot;&lt;strong&gt;Current answers are outdated&lt;/strong&gt; The current answer(s) are out-of-date and require revision given recent changes.&quot; Not a thing here - with our current rules, new languages/features aren't even allowed to be used.&lt;/li&gt;&#xA;  &lt;li&gt;&quot;&lt;strong&gt;Draw attention&lt;/strong&gt; This question has not received enough attention.&quot; Yep, this works. (Although &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8355/8478&quot;&gt;I'd rather read &quot;challenge&quot; in that sentence&lt;/a&gt;.)&lt;/li&gt;&#xA;  &lt;li&gt;&quot;&lt;strong&gt;Improve details&lt;/strong&gt; The current answers do not contain enough detail.&quot; The idea of this works in a broad sense, but we're not really looking for &quot;detail&quot; in answers here. Maybe this could be reworked into a bounty reason to improve the score (overall winner, or language-specific solutions).&lt;/li&gt;&#xA;  &lt;li&gt;&quot;&lt;strong&gt;Reward existing answer&lt;/strong&gt; One or more of the answers is exemplary and worthy of an additional bounty.&quot; This works verbatim. :)&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;  &#xA;  &lt;p&gt;We could also think about whether we could use other bounty reasons here. E.g. bounties are often offered for bonus/side challenges. Maybe we could get a specific bounty reason for that?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So this post is here to discuss what bounty reasons we could really use and how they should be worded. There are of course several parts to this discussion, but it will be easier to keep everything in one place. Hence, I would suggest limiting answers to suggestions for &lt;em&gt;one&lt;/em&gt; of the bounty reasons, so that the votes can more accurately show which suggestions have the community's support and which ones don't.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I assume that answers will fall into three categories:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Suggestions for rewording one of the existing bounty reasons.&lt;/li&gt;&#xA;&lt;li&gt;Suggestions for removing one of the reasons completely. This should only be done if we really have no use for it, because this will be a fairly permanent change.&lt;/li&gt;&#xA;&lt;li&gt;Suggestions for adding a new reason. If we get any of these at all, we should probably make a strong case that we'll actually need this quite regularly and that it isn't just a special case of the other reasons.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="68942" LastEditDate="2021-06-09T14:01:15.987" LastActivityDate="2021-06-09T14:01:15.987" Title="How could the bounty reasons be improved?" Tags="|discussion|feature-request|status-deferred|bounty|" AnswerCount="2" CommentCount="4" ClosedDate="2021-04-19T23:14:28.517" ContentLicense="CC BY-SA 3.0" />
  <row Id="11449" PostTypeId="1" AcceptedAnswerId="11451" CreationDate="2017-02-06T23:31:51.143" Score="-20" ViewCount="315" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/109337/java-program-for-build-report&quot;&gt;https://codegolf.stackexchange.com/questions/109337/java-program-for-build-report&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That is a homework question. It has been closed. Am I allowed to troll the asker with innocent code snippets? Ya know just things that will troll them harmlessly?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/746/code-troll-rules?rq=1&quot;&gt;Code-troll rules&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;^^&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have realized my mistakes and realize how dumb I was being.&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2017-03-14T21:36:14.150" Title="Is code trolling on homework questions OK?" Tags="|discussion|" AnswerCount="2" CommentCount="3" ClosedDate="2017-03-03T04:26:18.583" ContentLicense="CC BY-SA 3.0" />
  <row Id="11450" PostTypeId="2" ParentId="11449" CreationDate="2017-02-06T23:38:27.843" Score="21" Body="&lt;h1&gt;No.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(Body must be at least 30 characters; you entered 3.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;(Honestly, I don't even see why this is something that needs to be discussed. This isn't reddit. Regardless of how misguided some user's attempt at using the site may be, trolling them can only be detrimental to PPCG's reputation.)&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="58375" LastEditDate="2017-02-06T23:42:41.403" LastActivityDate="2017-02-06T23:42:41.403" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11451" PostTypeId="2" ParentId="11449" CreationDate="2017-02-06T23:56:05.340" Score="24" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/be-nice&quot;&gt;Be Nice&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;That's Stack Exchange's prime directive. Trolling someone, for whatever reasons you may think you have, is &lt;em&gt;not&lt;/em&gt; OK. My favorite part of the &lt;em&gt;Be Nice&lt;/em&gt; page says the following.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Your tone should match the way you'd talk in person with someone you respect and whom you want to respect you. &lt;em&gt;If you don't have time to say something politely, just leave it for someone who does.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So, if someone comes here with their homework, it is of course acceptable to notify them that we won't do their homework for them, but that's also where the interaction should stop. Trolling, belittling, name calling, bullying, and any other kind of confrontation that is intended for your amusement is not only completely disrespectful and unnecessary, it is so far over the line that it doesn't even make sense to have a meta discussion about it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TL;DR Trolling other users, even if they're here for the wrong reasons and &lt;em&gt;especially&lt;/em&gt; if they're new, is not only not allowed, &lt;strong&gt;it will get you suspended&lt;/strong&gt;.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2017-03-14T21:36:14.150" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11454" PostTypeId="2" ParentId="2140" CreationDate="2017-02-07T02:19:35.003" Score="0" Body="&lt;h2&gt;ACME (Let's Encrypt) client&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cryptography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cryptography&amp;#39;&quot; rel=&quot;tag&quot;&gt;cryptography&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/networking&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;networking&amp;#39;&quot; rel=&quot;tag&quot;&gt;networking&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://letsencrypt.org/docs/client-options/&quot; rel=&quot;nofollow noreferrer&quot;&gt;A list of ACME clients&lt;/a&gt; already looks a bit like a PPCG leaderboard, but I don't see the typical esolang roster there. Let's Augment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The task is in minimum number of bytes get a valid certificate for specified domain (assuming running from a directory that is accessible from web server of this domain. Or just also embedding a web server.).&lt;/p&gt;&#xA;" OwnerUserId="7773" LastEditorUserId="7773" LastEditDate="2017-02-07T11:57:01.300" LastActivityDate="2017-02-07T11:57:01.300" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11455" PostTypeId="2" ParentId="11448" CreationDate="2017-02-07T02:38:41.313" Score="15" Body="&lt;p&gt;In general, I see three ways in which bounties are generally used on this site:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Rewarding an existing answer&lt;/strong&gt;; as mentioned in the OP, this one works just fine on PPCG, much the same way as it does on the rest of Stack Exchange, and doesn't need changing.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Requesting more participation on a question that's had few answers&lt;/strong&gt;; currently we use &quot;draw attention&quot; for this and it's a fairly good fit, but it's not quite right. On other sites, &quot;draw attention&quot; typically means &quot;I don't think people who know the answer to this have seen it&quot;. Here, the meaning is much closer to &quot;I suspect most people &lt;em&gt;have&lt;/em&gt; seen this question, but want to give them an incentive to actually put in the effort to write an answer&quot;. As such, we might want to consider rewording the bounty reason to make it clearer; I'd suggest &quot;&lt;strong&gt;&lt;em&gt;Encourage participation&lt;/strong&gt; This challenge has not received enough participation&lt;/em&gt;&quot; (changing &quot;question&quot; to &quot;challenge&quot; obviously, and &quot;attention&quot; to &quot;participation&quot; to show that what the bounty cares about is answers, rather than just pageviews).&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Requesting a specific task be solved&lt;/strong&gt;; this is pretty much unique to PPCG. On most SE sites, if you have a specific question, you just ask it, even if there's a general question on the same topic that doesn't have the  answer you need. Here, if we have a &quot;write a quine&quot; question (we do), a &quot;write a quine in Cubix&quot; question is frowned upon and considered a duplicate. As such, if you want to incentivise people to answer a particular question a particular way, you need to set a bounty. I don't see a problem with the use of bounties for this purpose, but none of the existing categories are a good fit, meaning that people tend to set these bounties in random categories (I've seen &quot;draw attention&quot;, &quot;improve details&quot;, and IIRC even &quot;canonical answer&quot; used for this purpose). My suggestion here is to reword &quot;improve details&quot; to &quot;&lt;strong&gt;&lt;em&gt;Make specific request&lt;/strong&gt; A user is willing to give a reward for an answer that meets specific criteria.&lt;/em&gt;&quot;. Incidentally, these bounties often go via the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5243/62131&quot;&gt;indefinite bounties thread&lt;/a&gt; (as there's often reason to suspect they won't be completed within a week), and thus are categorised as &quot;reward exisitng answer&quot; when awarded.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;(There's a fourth method of using bounties that I occasionally see: as a reputation dump, when you care more about the loss of reputation than about the actual answer. I suspect this is not within the spirit of the bounty system and we probably shouldn't really take steps to support it.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can't see a need for more than three bounty categories here; if I were pressed to add a fourth, I'd split &quot;make specific request&quot;, but I don't really think it needs splitting.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2017-02-07T02:38:41.313" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11456" PostTypeId="1" AcceptedAnswerId="17541" CreationDate="2017-02-07T02:57:11.567" Score="13" ViewCount="321" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8361/12012&quot;&gt;One of the more popular suggestions&lt;/a&gt; from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8350/12012&quot;&gt;We&amp;#39;re not a Q&amp;amp;A site. But what should be done about it?&lt;/a&gt; was to change the search bar's placeholder text. We've been asked to flesh this out in a separate feature request so that SE can look into whether they'll make these changes for us.&lt;/p&gt;&#xA;&lt;p&gt;So you don't have to follow the link above, here is the proposal:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;Modify the placeholder search bar text&lt;/h2&gt;&#xA;&lt;p&gt;If you look at the top right corner of the page, you'll see a search box with the placeholder text &amp;quot;Search Q&amp;amp;A.&amp;quot; Even outside of the context of deemphasizing the Q&amp;amp;A terminology on our site, I think this could be better phrased as &amp;quot;Search the site&amp;quot; or similar. So while we're requesting that Q&amp;amp;A-specific text be changed, we might as well request this as well.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;So this post is here to discuss the proper wording for that placeholder.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-04-06T17:05:13.960" Title="How could the search bar's placeholder text be improved?" Tags="|discussion|feature-request|status-completed|search|" AnswerCount="7" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11457" PostTypeId="2" ParentId="11456" CreationDate="2017-02-07T03:18:40.157" Score="1" Body="&lt;h1&gt;&amp;quot;Search Challenges and Answers&amp;quot;&lt;/h1&gt;&#xA;&lt;p&gt;I'm totally behind and agree with Dennis that the text needs to be changed. And we always call what would be called &amp;quot;questions&amp;quot; on other sites, &amp;quot;challenges&amp;quot;, so it was only natural to me that the text should become &amp;quot;Search Challenges and Answers&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;The only small problem is that the text might be too long, but it fits almost perfectly on my screen: &lt;a href=&quot;https://i.stack.imgur.com/K9hPa.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/K9hPa.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Additionally we can use the &amp;quot;&amp;amp;&amp;quot; sign:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/J7FEf.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/J7FEf.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="31343" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-07T03:18:40.157" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="11458" PostTypeId="2" ParentId="11456" CreationDate="2017-02-07T03:23:24.210" Score="-6" Body="&lt;h1&gt;&quot;Search Site Content&quot;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I agree with Dennis as well that the text should be changed. I like Maltysen's idea, but in addition, I believe that since the search bar can be used to locate users as well, that &lt;strong&gt;&quot;Site Content&quot;&lt;/strong&gt; may be a more appropriate term to better represent it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, it fits pretty well on my screen with a decent amount of buffer room.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/9xeAM.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/9xeAM.png&quot; alt=&quot;Search Bar Screenshot&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user42649" LastActivityDate="2017-02-07T03:23:24.210" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11460" PostTypeId="2" ParentId="11456" CreationDate="2017-02-07T05:00:44.263" Score="19" Body="&lt;h1&gt;&quot;Search Posts&quot;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Short and consider but also sounds natural. This encompasses both non-challenge posts but also fits the scope of our site&lt;/p&gt;&#xA;" OwnerUserId="40695" LastActivityDate="2017-02-07T05:00:44.263" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11461" PostTypeId="2" ParentId="11456" CreationDate="2017-02-07T06:08:42.167" Score="10" Body="&lt;h1&gt;&amp;quot;Search&amp;quot;&lt;/h1&gt;&#xA;&lt;p&gt;Simply removing the &amp;quot;Q&amp;amp;A&amp;quot; part makes sense. It is already clear what the search box would search, and not having anything after &lt;code&gt;Search&lt;/code&gt; prevents issues with non-challenge posts. Plus, it's concise.&lt;/p&gt;&#xA;" OwnerUserId="60043" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-07T06:59:15.433" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11462" PostTypeId="2" ParentId="9619" CreationDate="2017-02-07T06:41:51.377" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/patrickroberts/bean&quot; rel=&quot;nofollow noreferrer&quot;&gt;Bean&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I have a good explanation of the mechanics of the language &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11330/42091&quot;&gt;here&lt;/a&gt; already, but I haven't really explained &lt;em&gt;why&lt;/em&gt; it's good to golf in.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;It is easy to get started in right away&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;For users of JavaScript ES6, there is almost no learning curve to using Bean, as the &lt;a href=&quot;https://patrickroberts.github.io/bean&quot; rel=&quot;nofollow noreferrer&quot;&gt;online interpreter&lt;/a&gt; automatically translates any valid JavaScript to Bean for you, and removes comments, directives, and whitespace from the bytecode, and provides a permalink immediately (though on the downside, the URLs can get a bit long).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;It allows verbose builtins from JavaScript at very little cost&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;One of the main advantages of Bean is that all builtin namespace and class identifiers, as well as their static and member properties, only cost 1 byte each.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;It introduces implicit input and output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;No more writing functions to take input and process it, now you can write full programs which abuse pre-processed input and implicit output without using function arguments, &lt;code&gt;prompt()&lt;/code&gt;, &lt;code&gt;alert()&lt;/code&gt; or &lt;code&gt;console.log()&lt;/code&gt;. Instead of focusing on how best to get and manipulate your input, you can get right to work on the main algorithm of your program.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;It is new, stable, and active&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;So what are you waiting for? Turn your mediocre JavaScript ES6 submissions into rocking Bean submissions and show off those impressive looking hexdumps! If I can get enough people using this language to make it worthwhile, I'll even add a test suite mode to the online interpreter for multiple input, and an embed script to allow auto-generation of stack snippets.&lt;/p&gt;&#xA;" OwnerUserId="42091" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2017-02-07T06:41:51.377" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11463" PostTypeId="2" ParentId="11448" CreationDate="2017-02-07T09:59:19.660" Score="-3" Body="&lt;p&gt;Unfortunately bounties can only be given to answers. This is unfortunate for our site because more often than not a challenge would be worthy of a bounty in much the same way &quot;exceptional answers&quot; are.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I know it has been discussed before that making this a possibility would be too demanding because it is not standard behavior for a SE site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However I would appreciate if this bounty reason existed and, when started by someone on a challenge, could be given either:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;With the author posting a &quot;blank&quot; answer, which gets attributed the bounty. This shows that the challenge got a bounty but unfortunately &quot;pollutes&quot; the answers with one that is actually not an answer.&lt;/li&gt;&#xA;&lt;li&gt;With the author posting a blank answer, which gets attributed the bounty, then deleting the answer (I think they keep the rep that way). This does not pollute the answers but does not show that the challenge got a bounty if you can't see deleted answers.&lt;/li&gt;&#xA;&lt;li&gt;With the author posting an answer to their own challenge, which gets attributed the bounty. This does not pollute the answers (given that the author made an effort to provide a valid one) and show that the author got a bounty. It is ambiguous that the bounty was given for the challenge and not the answer, though that could be explicited in the body of the answer. Unfortunately this forces the author to post an answer to their own challenge (which might not be easy depending on the challenge).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41723" LastActivityDate="2017-02-07T09:59:19.660" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11464" PostTypeId="2" ParentId="11447" CreationDate="2017-02-07T10:06:12.137" Score="7" Body="&lt;h2&gt;Rewording for &amp;quot;Duplicate&amp;quot;&lt;/h2&gt;&#xA;&lt;p&gt;&amp;quot;This challenge has already been posted. It is either an exact duplicate, or the differences are superficial enough that an answer could be copied with minor modification from the existing challenge and be competitive here.&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Wording changes by @xnor&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-10T08:03:10.503" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11465" PostTypeId="2" ParentId="11447" CreationDate="2017-02-07T10:09:17.730" Score="6" Body="&lt;h2&gt;Rewording for &amp;quot;Unclear&amp;quot;&lt;/h2&gt;&#xA;&lt;p&gt;&amp;quot;Please clarify the specifications of your challenge. As it's currently written, it's hard to tell exactly what a valid answer to your challenge would be. You may want to post your challenge to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;the Sandbox&lt;/a&gt; for feedback before submitting it on the main site.&amp;quot;&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-07T10:09:17.730" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11466" PostTypeId="2" ParentId="11447" CreationDate="2017-02-07T14:51:08.830" Score="17" Body="&lt;p&gt;Alternative phrasing for &quot;Unclear&quot;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Please clarify the specification or add additional details to highlight exactly what is required. As currently written, it's hard to tell exactly what qualifies as a valid answer. It's especially important to be clear on I/O formats, guarantees about input values, and edge case behaviour. You may want to post your challenge to the Sandbox for feedback before submitting it on the main site.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;(Credit: the last line is stolen verbatim from Fatalize's proposal).&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="46271" LastEditDate="2017-02-10T17:02:41.207" LastActivityDate="2017-02-10T17:02:41.207" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="11467" PostTypeId="2" ParentId="11447" CreationDate="2017-02-07T15:50:28.537" Score="14" Body="&lt;h1&gt;Replace &amp;quot;Primarily opinion based&amp;quot; with &amp;quot;Needs objective scoring criterion&amp;quot;&lt;/h1&gt;&#xA;&lt;p&gt;We currently use a custom reason of &amp;quot;Off-topic&amp;quot; as &amp;quot;Needs objective scoring&amp;quot;.  That said, we receive many posts here that are attempting to be a challenge, but lack objective scoring. &lt;strong&gt;These challenges aren't &amp;quot;Off topic&amp;quot;: they simply underspecified the challenge.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, the majority of these cases are when users post a challenge and say &amp;quot;My favorite answer wins&amp;quot;, or &amp;quot;The funniest answer wins&amp;quot;.  They are primarily opinion based.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, I propose we replace &amp;quot;Primarily opinion based&amp;quot; with &amp;quot;Needs objective scoring criterion&amp;quot; with the following text:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Please update your challenge with an objective method of determining the winner.  This method should not be opinion-based: it should be possible to score the submissions and determine the winner.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;If changing the title of &amp;quot;Primarily opinion based&amp;quot; is too much of a change, then changing the description is fine.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-07T15:50:28.537" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11468" PostTypeId="1" CreationDate="2017-02-07T16:17:57.597" Score="1" ViewCount="101" Body="&lt;p&gt;(SmileBASIC is a BASIC interpreter for the Nintendo 3DS)  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;SmileBASIC has a special &quot;folder&quot; named &lt;code&gt;SYS&lt;/code&gt; that contains built in resources, such as the default sprite sheets, font, and sample programs.&#xA;It cannot be modified, since it's not actually a folder; it's stored in the game's ROM. (It's just treated as a folder so you can easily load files from it)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every copy of SmileBASIC has the exact same files in &lt;code&gt;SYS&lt;/code&gt;, and SB would not work without them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &quot;clear everything&quot; command, &lt;code&gt;ACLS&lt;/code&gt;, loads the default sprite sheets and font from &lt;code&gt;SYS&lt;/code&gt;, and they are also loaded automatically whenever a program is run from the main menu. The &lt;code&gt;FONTDEF&lt;/code&gt; (reset font) command also loads from &lt;code&gt;SYS&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question: &lt;em&gt;&quot;Is it ok to load files from &lt;code&gt;SYS&lt;/code&gt; without them counting towards the program size?&quot;&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="64538" LastEditorUserId="64538" LastEditDate="2017-02-07T18:54:43.077" LastActivityDate="2017-03-09T19:42:56.373" Title="Loading from SYS in SmileBASIC" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11470" PostTypeId="2" ParentId="11468" CreationDate="2017-02-07T17:02:22.640" Score="3" Body="&lt;p&gt;There are no files in SYS that contain library functions, only samples, default assets, and a table of kanji characters. I personally don't consider the fact that some builtins load from SYS as loading an external file, and I can't imagine the default assets to be of much use to any sort of challenge. If we make it a &quot;rule&quot; that every program assumes some default environment, this isn't really an issue.&lt;/p&gt;&#xA;" OwnerUserId="42096" LastActivityDate="2017-02-07T17:02:22.640" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11473" PostTypeId="2" ParentId="11456" CreationDate="2017-02-07T19:30:50.437" Score="-4" Body="&lt;h1&gt;Search PPCG&lt;/h1&gt;&#xA;&lt;p&gt;While some may argue that PPCG may not be understood by all visitors, I have seen it used many times in comments to welcome new users (usually with a recommendation to use the Sandbox!) and I think most people who are interested in searching the site would understand anyway.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Edit&lt;/strong&gt; OK, understand that the way voting works on here is just opinions but why no comments to justify? It tells people what they are searching. &amp;quot;Search site&amp;quot; could mean search the whole of SE for all they know.&lt;/p&gt;&#xA;&lt;p&gt;My alternative suggestion would be to get rid of the placeholder altogether. Everyone knows what an empty field with a &amp;quot;spyglass&amp;quot; icon means. In fact, thinking about it more, I think this is a much better idea but I expect more down votes for it. Personally I don't like placeholders anyway. For me they are patronizing and imply that whoever is running the website is assuming that I don't know what I am doing. Example: field label &amp;quot;First Name&amp;quot;, placeholder &amp;quot;Please enter your first name here&amp;quot;. I never use them on my own projects for this exact reason. You can never get it right for everyone.&lt;/p&gt;&#xA;&lt;p&gt;I guess my real point is, does it really matter?&lt;/p&gt;&#xA;" OwnerUserId="56555" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-07T23:53:16.100" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11474" PostTypeId="2" ParentId="11456" CreationDate="2017-02-07T19:32:54.720" Score="0" Body="&lt;h2&gt;&quot;Search the site&quot;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Mostly because this was the one suggestion in the original post and no one has turned it into an answer yet. I also think it's fairly clear although like some of the others it also doesn't imply that comments aren't searched.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2017-02-07T19:32:54.720" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11476" PostTypeId="1" CreationDate="2017-02-07T21:30:25.620" Score="1" ViewCount="92" Body="&lt;p&gt;As seen in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11475/64505&quot;&gt;this challenge&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11358/64505&quot;&gt;this one&lt;/a&gt; in the sandbox, some questions ask for pseudorandom numbers to be applied in a mathematical operation. Frequently, these questions are trivial mathematical operations for which the only difference is the operations use a pseudorandom number. Should generation of pseudorandom numbers be allowed as a requirement for a challenge?&lt;/p&gt;&#xA;" OwnerUserId="64505" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2017-02-08T13:00:07.297" Title="Should questions be asking for random numbers" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11479" PostTypeId="1" AcceptedAnswerId="11483" CreationDate="2017-02-08T02:32:42.983" Score="-9" ViewCount="125" Body="&lt;p&gt;So in TNB I had the idea for a new tag. Homework-question. These questions would be tagged by a higher rep user (or poster). They would be placed in a review queue and discreetly taken care of. You could even add a bot to comment stuff like &quot;Please don't post homework questions&quot; these questions would be removed faster.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or the tag could just be added so users can edit and tag the questions to allow people to find and decide what to do with those questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This obviously does not require to be hard. Just adding the tag would work so users can find the questions about homework a lot faster.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/35290120#35290120&quot;&gt;Chat transcript start&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="12012" LastEditDate="2017-02-08T03:02:17.527" LastActivityDate="2017-02-08T03:02:17.527" Title="A homework-question tag to weed out questions" Tags="|feature-request|status-declined|tags|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11480" PostTypeId="5" CreationDate="2017-02-08T02:36:50.170" Score="0" Body="" OwnerUserId="-1" LastEditorUserId="-1" LastEditDate="2017-02-08T02:36:50.170" LastActivityDate="2017-02-08T02:36:50.170" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11481" PostTypeId="4" CreationDate="2017-02-08T02:36:50.170" Score="0" Body="" OwnerUserId="-1" LastEditorUserId="-1" LastEditDate="2017-02-08T02:36:50.170" LastActivityDate="2017-02-08T02:36:50.170" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11482" PostTypeId="2" ParentId="11479" CreationDate="2017-02-08T02:47:31.347" Score="9" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;A homework tag would most definitely not weed out off-topic questions. Instead it would look like evidence that homework questions are on-topic.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Clearly my homework question is on-topic. There's even a tag &lt;em&gt;specifically for homework questions!&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;From the &lt;a href=&quot;https://codegolf.stackexchange.com/help/tagging&quot;&gt;help-center&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A tag is a word or phrase that describes the topic of the question. Tags are a means of connecting experts with questions they will be able to answer by sorting questions into specific, well-defined categories.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Now to be fair, a lot of that doesn't make any sense for a challenge site instead of a Q&amp;amp;A site. But the basic idea is still right. I can go to my profile and see that I tend to ask and answer a lot of string-based challenges,&#xA;like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Why on earth would we want to categorize questions that are blatantly off-topic? If we're lucky they'll just be quickly deleted and then any tags become irrelevant.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-08T02:47:31.347" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11483" PostTypeId="2" ParentId="11479" CreationDate="2017-02-08T03:02:01.970" Score="5" Body="&lt;h1&gt;No!&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/homework&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;homework&amp;#39;&quot; rel=&quot;tag&quot;&gt;homework&lt;/a&gt; would be a &lt;a href=&quot;https://stackoverflow.blog/2010/08/the-death-of-meta-tags/&quot;&gt;meta tag&lt;/a&gt;, i.e., a tag that does not describe the content of the question (the actual post) but something tangentially related (the origin of the problem). Meta tags are frowned upon network-wide because they do not fulfill the purpose of tags.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;They would be placed in a review queue and discreetly taken care of.&lt;/em&gt; You just described flags. Flagging a post (or directly voting to close if you have the the privilege) already places the post in the &lt;a href=&quot;https://codegolf.stackexchange.com/review/close&quot;&gt;close votes&lt;/a&gt; review queue. Misusing tags to emulate a feature that already exists is absolutely pointless.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;As DJMcMayhem already said, the existance of the tag suggests that asking homework questions is OK, to which you responded the following.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The tag wiki could say &quot;if you are using this tag don't post&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That's completely impractical. Tags get pruned automatically (along with their wikis) if there are no questions that bear it. Since all homework question get closed and deleted after a short period of time, a high rep user would have to re-create the tag every time is disappears. That's a lot of wasted effort for something that doesn't even make sense in the first place.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2017-02-08T03:02:01.970" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11484" PostTypeId="1" CreationDate="2017-02-08T03:35:11.263" Score="2" ViewCount="99" Body="&lt;p&gt;Example: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/109337/java-program-for-build-report&quot;&gt;https://codegolf.stackexchange.com/questions/109337/java-program-for-build-report&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;this user just copy and pasted some homework assignment, which is not appropriate for any SE site. However, we referred them to SO. People like to post in chat things like&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Please get your question closed on Stack Overflow instead&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;and comments on that question included:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;We won't do your homework for you on this site, and neither will Stack Overflow.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;which asks the question: why do we refer them there?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;How should we deal with general programming questions that are also clearly off topic for Stack Overflow as well, so referring them there is inappropriate?&lt;/h2&gt;&#xA;" OwnerUserId="55896" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2017-02-08T06:36:35.683" Title="How do we deal with poorly made homework questions" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11485" PostTypeId="2" ParentId="11484" CreationDate="2017-02-08T06:36:35.683" Score="8" Body="&lt;p&gt;We should be a bit nicer. We get a lot of homework questions, and it can get tiring to close them all the time. But, we need to remember to Be Nice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We still need to close the questions (since they're blatantly off-topic), but using a canned comment like the following would be better:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Welcome to Programming Puzzles &amp;amp; Code Golf! We are a programming challenge site, so your question is not on topic for our site. Stack Overflow may be able to help, but be sure to read through their help center (specifically the parts about writing good questions), because your question would be closed there too in its current form.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-02-08T06:36:35.683" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11486" PostTypeId="2" ParentId="2140" CreationDate="2017-02-08T11:40:10.610" Score="2" Body="&lt;h2&gt;Animate the text in your terminal&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The goal&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal is to &quot;animate&quot; the string &quot;Hello world&quot; in your output so that each character gets capitalised after each other. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program can exit after each letter has been capitalised.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# Iteration 1&#xA;Hello world&#xA;&#xA;# Iteration 2&#xA;hEllo world&#xA;&#xA;# Iteration 3&#xA;heLlo world&#xA;&#xA;# Iteration 4&#xA;helLo world&#xA;&#xA;# Iteration 5&#xA;hellO world&#xA;&#xA;# Iteration 5&#xA;hello world&#xA;&#xA;# Iteration 6&#xA;hello World&#xA;&#xA;# Iteration 7&#xA;hello wOrld&#xA;&#xA;# Iteration 8&#xA;hello woRld&#xA;&#xA;# Iteration 9&#xA;hello worLd&#xA;&#xA;# Iteration 10&#xA;hello worlD&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;No input is required, but &quot;Hello world&quot; must be the string that is &quot;animated&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The string &quot;Hello world&quot; must be animated. The output must be as 1 line to create a sort of wave animation. Example gif;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.gyazo.com/be12b693063b463540c5bf1f03d2454a.gif&quot; alt=&quot;https://i.gyazo.com/be12b693063b463540c5bf1f03d2454a.gif&quot;&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;I saw this on a metasploit youtube video and thought the effect was pretty cool, which is where I recorded the gif from, so it's a little laggy, but I hope it illustrates the output fine&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, lowest byte-count will be deemed the winner.&lt;/p&gt;&#xA;" OwnerUserId="38505" LastEditorUserId="38505" LastEditDate="2017-02-09T09:21:47.230" LastActivityDate="2017-02-09T09:21:47.230" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11487" PostTypeId="1" CreationDate="2017-02-08T11:52:08.557" Score="12" ViewCount="423" Body="&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/JOkEW.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/JOkEW.png&quot; alt=&quot;The (somewhat) working wireworld checkbox&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Here is a checkbox I made in wireworld, for the &amp;quot;Create a checkbox!&amp;quot; question.&lt;/p&gt;&#xA;&lt;p&gt;The problem is, we don't have a way to score answers like these.&lt;/p&gt;&#xA;&lt;p&gt;Do we score these by pixels, like piet did, or in other ways?&lt;/p&gt;&#xA;" OwnerUserId="64499" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-12T04:22:04.923" Title="How do we score turing complete cellular automata (GoL, Wireworld, etc)" Tags="|discussion|scoring|" AnswerCount="5" CommentCount="16" ContentLicense="CC BY-SA 3.0" />
  <row Id="11488" PostTypeId="2" ParentId="11476" CreationDate="2017-02-08T13:00:07.297" Score="4" Body="&lt;h1&gt;Varies by the question.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Some questions use psuedorandom numbers, and theres a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; tag for that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since there is no rules which restricts them, it will be allowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;However&lt;/em&gt;, Trivial ones, like what you posted, are discouraged, and will most likely be disliked or flagged. (by any reason, most likely duplicates or not clear)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If they don't violate other rules, questions containing psuedorandom numbers are fine.&lt;/p&gt;&#xA;" OwnerUserId="64499" LastActivityDate="2017-02-08T13:00:07.297" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11489" PostTypeId="2" ParentId="2447" CreationDate="2017-02-08T13:36:10.257" Score="-1" Body="&lt;h1&gt;Source files or libraries may output via the return value importing them&lt;/h1&gt;&#xA;&lt;p&gt;For example, this PHP code has no effects as a complete program:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;?php return 'Hello, world!';&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;But as a library named '1.php', the return value could be printed to stdout using this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;?php echo include '1.php';&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-08T13:36:10.257" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11490" PostTypeId="2" ParentId="2447" CreationDate="2017-02-08T13:42:33.000" Score="-4" Body="&lt;h1&gt;&lt;code&gt;eval&lt;/code&gt; is considered an interpreter and the &lt;code&gt;eval&lt;/code&gt;'d code may output via the return value&lt;/h1&gt;&#xA;&lt;p&gt;For example, this PHP code has no effects as a complete program in the &lt;code&gt;php&lt;/code&gt; interpreter:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;return 'Hello, world!';&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;But the return value is accessible using the &lt;code&gt;eval&lt;/code&gt; interpreter:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;?php echo eval(&amp;quot;return 'Hello, world!';&amp;quot;);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-12T02:43:08.213" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11495" PostTypeId="2" ParentId="11487" CreationDate="2017-02-08T21:55:29.617" Score="-1" Body="&lt;h1&gt;ceil(Pixels/logbase(states,256)) + 3&lt;/h1&gt;&#xA;&lt;p&gt;This only works for gol variants on an infinite, square, grid. It takes no entropy to store an empty infinite grid.&#xA;This is a fairly roundabout scoring system, so please feel free to downvote or critique.&lt;/p&gt;&#xA;&lt;p&gt;Note that if the size is greater than a 256 by 256 box add 2 for each byte needed as representation of the size of one dimension.&lt;/p&gt;&#xA;&lt;p&gt;Essentially we could easily create a file format where you take start with one byte detailing the number of bytes in which the dimensions are stored. Thus, each side can be up to 2^(2^128) squares long. Later two bytes (one for each side). Then convert the map to a binary integer (1=filled, 0 = empty) (and pad with 0's to make a multiple of 8 bits) to store in the rest of the file.&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-09T00:51:44.910" CommentCount="0" CommunityOwnedDate="2017-02-08T21:55:29.617" ContentLicense="CC BY-SA 3.0" />
  <row Id="11496" PostTypeId="2" ParentId="11487" CreationDate="2017-02-08T22:16:08.860" Score="0" Body="&lt;h1&gt;The smallest bounding rectangle&lt;/h1&gt;&#xA;&lt;p&gt;If the program fits in a 16 by 16 rectangle of cells, then its score is 256 cells.&lt;/p&gt;&#xA;&lt;p&gt;Worrying about how many bytes it'd take to store in a file isn't really a relevant plan unless there's a built-in way to convert a state into a file. If there is a built-in way to do that, then use the file size. As long as there's not, then the bounding rectangle should be used, because it represents the smallest grid that the base program could fit on, with the part outside the boundary all being the same infinite pattern, such as all live, or all dead.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-08T22:16:08.860" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="11497" PostTypeId="1" CreationDate="2017-02-08T22:45:45.120" Score="27" ViewCount="370" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11398/12012&quot;&gt;You've cast your votes&lt;/a&gt; and elected the following three members of our community as room owners of our primary chat room, &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/users/169713&quot;&gt;&lt;img src=&quot;https://stackexchange.com/users/flair/2927268.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt; &lt;a href=&quot;http://chat.stackexchange.com/users/144962&quot;&gt;&lt;img src=&quot;https://stackexchange.com/users/flair/4314782.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt; &lt;a href=&quot;http://chat.stackexchange.com/users/158822&quot;&gt;&lt;img src=&quot;https://stackexchange.com/users/flair/4626788.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;They have been appointed, effective immediately. Please join us in thanking them for volunteering, and may the odds be ever in their favor.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-09T10:39:31.813" Title="Please welcome The Nineteenth Byte's newest room owners!" Tags="|discussion|chat|moderation|" AnswerCount="1" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="11498" PostTypeId="2" ParentId="11487" CreationDate="2017-02-08T23:13:48.000" Score="3" Body="&lt;p&gt;I know that golly allows you to copy and paste text into it, with spaces as empty cells, non-space as filled cells, and newline as ... newline. After pressing cmd/ctrl v, you click once, and the pattern is placed. Perhaps this could be used for the scoring system?&lt;/p&gt;&#xA;" OwnerUserId="55896" LastActivityDate="2017-02-08T23:13:48.000" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11500" PostTypeId="2" ParentId="11497" CreationDate="2017-02-09T10:39:31.813" Score="10" Body="&lt;p&gt;It's an honor to be chosen by the community to be a room owner of The Nineteenth Byte. I've had many good experiences in TNB, and I hope to help others have good experiences as well.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-02-09T10:39:31.813" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11501" PostTypeId="2" ParentId="7431" CreationDate="2017-02-09T13:53:23.043" Score="0" Body="&lt;h1&gt;A JSON/XML/YAML format of the hierachy&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If I recall correctly, We can change the folders and files to json or xml. That might be better (and easier) to score.&lt;/p&gt;&#xA;" OwnerUserId="64499" LastEditorUserId="64499" LastEditDate="2017-02-11T04:22:50.140" LastActivityDate="2017-02-11T04:22:50.140" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11502" PostTypeId="2" ParentId="7070" CreationDate="2017-02-09T14:41:01.107" Score="21" Body="&lt;p&gt;This was recently changed to the text proposed by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7076/12831&quot;&gt;coredump&lt;/a&gt;. New users who enter the Your Answer box will see:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/kpV7j.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/kpV7j.jpg&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="12831" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2017-02-09T14:41:01.107" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11503" PostTypeId="1" CreationDate="2017-02-09T14:49:40.013" Score="25" ViewCount="104" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11502/8478&quot;&gt;We now have a custom “How to Answer” pop-up&lt;/a&gt; (yay!). However, this pop-up isn't shown to users who come here with the association bonus from other SE sites. In general, this behaviour makes sense: the pop-up is the same virtually everywhere and it teaches people how the Q&amp;amp;A platform in general works, not how answers on that specific site should be written. However, as the custom pop-up shows, answering works a bit differently on PPCG, and we also get a lot of wrong/invalid answers from active SE users who are not familiar with the difference of PPCG from the rest of SE.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hence, it would probably be helpful if this was shown to &lt;em&gt;all&lt;/em&gt; new users, regardless of whether they come here from another SE with an association bonus or whether they arrive here directly. Since changing the text on a per-site basis was doable on SE's end, maybe changing the conditions for when it's being displayed might also be an option?&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="11952" LastEditDate="2021-06-17T15:19:48.620" LastActivityDate="2021-06-17T15:19:50.647" Title="Can the “How to Answer” pop-up disregard the association bonus?" Tags="|feature-request|status-completed|answers|new-users|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11504" PostTypeId="2" ParentId="11487" CreationDate="2017-02-09T16:25:38.393" Score="8" Body="&lt;h1&gt;There shouldn't be a general answer for all cellular automata.&lt;/h1&gt;&#xA;&lt;p&gt;People have pointed out that cellular automata are diverse. Some have only two states and square cells. Others have differently shaped cells with different rules and many possible states. This diversity means that we should not have one rule for all of them. Instead we should look at each one individually and decide how to score it.&lt;/p&gt;&#xA;" OwnerUserId="41863" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-09T16:25:38.393" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11506" PostTypeId="2" ParentId="2140" CreationDate="2017-02-09T19:17:33.313" Score="0" Body="&lt;h1&gt;What I'm Planning to Post:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Print the number of &lt;strong&gt;bytes&lt;/strong&gt; (not characters, bytes) in the program, without hardcoding the number (i.e. code like &lt;code&gt;print(8)&lt;/code&gt; is not allowed).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the code is added to (e.g. with a comment) it should change automatically without needing to change anything else.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example (un-golfed) program in &lt;strong&gt;Python 3&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;file = open(__file__)&#xA;data = file.read()&#xA;print(data)&#xA;file.close()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest answer in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;What I Want to Check/Know:&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Does this count as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;?&lt;/li&gt;&#xA;&lt;li&gt;Has this already been done? To what extent do the rules of a 'Duplicate' question apply here? (I have done some searching...)&lt;/li&gt;&#xA;&lt;li&gt;What should my challenge title be? I cannot think of any fitting ones.&lt;/li&gt;&#xA;&lt;li&gt;Should I include the example (un-golfed) program in my post, or does that make it too easy?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="65290" LastActivityDate="2017-02-09T19:17:33.313" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11507" PostTypeId="1" AcceptedAnswerId="11508" CreationDate="2017-02-09T19:21:19.990" Score="5" ViewCount="102" Body="&lt;p&gt;I have a new best-in-class solution to a protected question and am unable to post anything because of being a new user. Does this community not see diluted question quality from new users earning reputation points?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/109248/mathematics-is-fact-programming-is-not&quot;&gt;This question&lt;/a&gt;, and this solution, which I would love to also share the comments to:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;,[&amp;gt;-[-----&amp;lt;-&amp;gt;]&amp;lt;++[&amp;gt;++++[-&amp;lt;++++&amp;gt;]+&amp;lt;[[-],[[-]&amp;gt;-&amp;lt;]]]&amp;gt;[&amp;lt;&amp;lt;+[--&amp;gt;]&amp;gt;[&amp;lt;],&amp;gt;-]&amp;lt;]-[-----&amp;lt;+&amp;gt;]&amp;lt;--.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="65373" LastEditorUserId="68942" LastEditDate="2021-06-03T13:48:54.053" LastActivityDate="2021-06-03T13:48:54.053" Title="Does reputation not dilute question quality? / Help request" Tags="|support|feature-request|status-completed|protected-questions|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11508" PostTypeId="2" ParentId="11507" CreationDate="2017-02-09T19:36:17.423" Score="6" Body="&lt;p&gt;&lt;strong&gt;Welcome to the site!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;New users are just as welcome as anyone else. Plenty of new users have made incredible contributions to this site with amazing answers, and our community thrives on bringing in new users to answer questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That question you linked has six deleted answer that you can not see right now, and the standard across stack-exchange sites is to &lt;a href=&quot;https://stackoverflow.blog/2010/06/new-protected-question-status/&quot;&gt;protect questions automatically&lt;/a&gt; once there are three answers deleted. This is because PPCG is powered by the software for a Q&amp;amp;A site, and if 3 or more answers are deleted on a &lt;em&gt;question&lt;/em&gt;, (not a challenge) it's probably attracting spam/non-answers/arguments. Protecting questions is a line of defense against this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8350/were-not-a-qa-site-but-what-should-be-done-about-it&quot;&gt;PPCG is not a Q&amp;amp;A site,&lt;/a&gt; so this standard doesn't work as well. In fact, that's even why I wrote &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10419/31716&quot;&gt;this meta post&lt;/a&gt; asking for advice for what to do to protected questions. I have already unprotected that question once before. Now that Dennis has unprotected the question, you should be able to post your answer as usual.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2017-02-09T19:36:17.423" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11509" PostTypeId="2" ParentId="8350" CreationDate="2017-02-09T19:59:09.377" Score="29" Body="&lt;h1&gt;Stop automatically protecting challenges&lt;/h1&gt;&#xA;&lt;p&gt;Right now, a question will be automatically protected if it gets three or more deleted answers. This is a good move for Q&amp;amp;A sites, but the nature of PPCG makes this problematic:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;PPCG tends to get an unusually high number of answers per challenge, making the odds of a few deleted answers much higher.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Self-deletion because of missing a detail or edge-case in the challenge is &lt;em&gt;very&lt;/em&gt; common.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Lots of amazing answers come from new users.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Additionally, spam is relatively rare and efficiently handled by the community when it comes up, so protecting has less upsides too.&lt;/p&gt;&#xA;&lt;p&gt;Because of this, right now the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10419/31716&quot;&gt;community consensus&lt;/a&gt; is to always unprotect challenges once they are auto-protected. This is a pain, and it would be nice to not need to do anymore. If a particular question is unusually problematic, it could always be manually protected, but I imagine this would be rare.&lt;/p&gt;&#xA;&lt;p&gt;To quote Dennis,&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I've had to unprotect &lt;a href=&quot;https://codegolf.stackexchange.com/q/57617/12012&quot;&gt;Is this number a prime?&lt;/a&gt; three times so far. If I hadn't done it, the creator of &lt;a href=&quot;https://codegolf.stackexchange.com/a/58347/12012&quot;&gt;this answer&lt;/a&gt; (new user, hasn't written another post before or after that one) wouldn't have been able to post his stellar Hexagony primality tester which earned &lt;strong&gt;90&lt;/strong&gt; upvotes and a juicy &lt;strong&gt;+500&lt;/strong&gt; bounty. Yes, this is a rare gem, but it surely was worth the 22 answers that had to be dealt with without protection.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-09T19:59:09.377" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11512" PostTypeId="2" ParentId="8350" CreationDate="2017-02-10T04:07:54.083" Score="-3" Body="&lt;h1&gt;Create a separate, meta-like site for the sandbox&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This could be a site that you could move posts to and from (like meta). Users would first post in the sandbox site, and they would have the capability to move something to the main site by clicking a button. Answers would be disabled(?)&lt;/p&gt;&#xA;" OwnerUserId="53551" LastActivityDate="2017-02-10T04:07:54.083" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11513" PostTypeId="2" ParentId="11447" CreationDate="2017-02-10T11:04:49.357" Score="3" Body="&lt;h2&gt;Rewording for &quot;Too broad&quot;&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;There are either too many possible answers, or good answers would be too long for this format. Please try to isolate a clearly defined sub-challenge that can be answered in a reasonable amount of code. You may want to post your challenge to the Sandbox for feedback before submitting it on the main site.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The last line is copied from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11465/32014&quot;&gt;Fatalize&lt;/a&gt;, because these kinds of challenges would often benefit from a round in the Sandbox.&#xA;I tried to reword the part &lt;em&gt;Please add details to narrow the answer set&lt;/em&gt;, but in our case that wold mean adding restrictions to the challenge, and new users could easily get the impression that bad challenges can be spiced up by adding an unrelated &quot;you can't use addition or subtraction&quot;.&lt;/p&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2017-02-10T11:04:49.357" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11514" PostTypeId="1" AcceptedAnswerId="11516" CreationDate="2017-02-10T17:00:47.827" Score="6" ViewCount="152" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips+-code-golf&quot;&gt;Here is a search for these.&lt;/a&gt; (currently &lt;s&gt;42&lt;/s&gt; 7 of them, but some are things like &quot;Tips for making Polyglots&quot; and thus don't need the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips+-king-of-the-hill+-code-golf+-atomic-code-golf+-code-bowling&quot;&gt;Here is a search for all tips questions that don't have a scoring criterion.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5222/46271&quot;&gt;The consensus&lt;/a&gt; is that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions should be tagged with the applicable challenge type, i.e. fastest-code, code-golf, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we go through and add the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; tag to the 30-some questions that need it?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I'm not arguing they should be tagged as such, I'm saying we should make a clean-up effort and add that tag)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5221/should-tips-also-be-tagged-with-the-challenge-type&quot;&gt;This not a dupe.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This has been done.  7 questions remain that don't have &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; as a tag, 5 of which are closed.  Of these, one of the open ones is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;, and the other open question is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/101159/tips-for-creating-polyglots&quot;&gt;Tips for creating polyglots&lt;/a&gt; and doesn't need any scoring tags.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of the closed ones:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/59997/how-can-pyth-be-improved&quot;&gt;2&lt;/a&gt; fall &lt;a href=&quot;https://codegolf.stackexchange.com/questions/60312/how-could-stringy-be-improved&quot;&gt;under&lt;/a&gt; &quot;issue tracker&quot; catagory and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/6905/can-i-ask-a-question-seeking-feature-requests-for-a-golfing-language&quot;&gt;thus are off-topic.&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/52024/best-place-for-learning-golfscript&quot;&gt;Best place for learning GolfScript?&lt;/a&gt; is a recommendation question, off-topic.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/77117/tips-for-king-of-the-hill-bots&quot;&gt;Tips for King of the Hill bots&lt;/a&gt; is closed as too broad.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/110631/data-structure-for-time-constraint-and-memory-constraint&quot;&gt;https://codegolf.stackexchange.com/questions/110631/data-structure-for-time-constraint-and-memory-constraint&lt;/a&gt; is a recommendation/SO-type question.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2017-02-26T22:09:23.000" Title="Should we clean-up our code-golf-related [tips] questions?" Tags="|discussion|tags|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11516" PostTypeId="2" ParentId="11514" CreationDate="2017-02-10T20:03:59.157" Score="6" Body="&lt;p&gt;Considering that the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5222/34718&quot;&gt;consensus&lt;/a&gt; is to add the tag of the challenge type to the tips question, I think it'd be a good idea to update existing tips questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In order to avoid bumping them all at once, this should be done gradually.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Though it's in the question, here it is again:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips+-code-golf&quot;&gt;A List of Tips Questions not Tagged with [code-golf]&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2017-02-10T20:03:59.157" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11517" PostTypeId="2" ParentId="2140" CreationDate="2017-02-11T01:37:58.313" Score="-2" Body="&lt;p&gt;A simple challenge: Shortest program that takes the longest to compile.&lt;/p&gt;&#xA;" OwnerUserId="4616" LastActivityDate="2017-02-11T01:37:58.313" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11520" PostTypeId="1" AcceptedAnswerId="11521" CreationDate="2017-02-11T17:42:43.303" Score="1" ViewCount="125" Body="&lt;p&gt;Since this is not a QA site as such, I don't think there's a whole lot of value in keeping old solutions around for future reference. And for new users to the site, it's a bit like discovering an awesome puzzle book, only to find that somebody has already filled in 90% of the answers. From that point of view, removing old answers should really be considered a good thing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, I'm not suggesting we necessarily encourage people to do this, but if someone &lt;em&gt;did&lt;/em&gt; want to delete their old answers, would that be a acceptable? Or are moderators likely to see this as vandalism and revert the deleted posts?&lt;/p&gt;&#xA;" OwnerUserId="62101" LastActivityDate="2017-02-14T14:40:02.700" Title="Is it OK to delete old answers?" Tags="|discussion|policy|answers|deleted-answers|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11521" PostTypeId="2" ParentId="11520" CreationDate="2017-02-11T18:21:37.030" Score="13" Body="&lt;p&gt;I disagree with your premise that deleting answers is a good thing.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;While new, active users may benefit from finding more unanswered questions, deleting answers has the same effect as not posting them at all.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Established, active users will still see the answers, so they have to choose between posting a near-duplicate of a deleted answer or just ignoring the challenge and move to the next one.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Passive users (and we have a lot of them), enjoy reading clever solutions but have no desire to participate. Less answers means less content they can enjoy.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;That said, all content you provide on Stack Exchange sites is perpetually and irrevocably licensed to Stack Exchange under CC-BY-SA, and the poster is expected not to remove useful content. Deleting a large number of answers will raise a vandalism flag, and the moderators are expected to undo the deletions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that the above paragraph depends on the licencee (Stack Exchange), not the community. Even if we achieve a community consensus that old answers should be removed (which I disagree with), the final decision would still be Stack Exchange's.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="34718" LastEditDate="2017-02-14T14:40:02.700" LastActivityDate="2017-02-14T14:40:02.700" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11522" PostTypeId="2" ParentId="2447" CreationDate="2017-02-11T19:50:02.160" Score="11" Body="&lt;h1&gt;Programs may take input from the clipboard&lt;/h1&gt;&#xA;" OwnerUserId="64538" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-11T19:50:02.160" CommentCount="1" CommunityOwnedDate="2017-02-11T19:50:02.160" ContentLicense="CC BY-SA 3.0" />
  <row Id="11523" PostTypeId="2" ParentId="11487" CreationDate="2017-02-12T04:22:04.923" Score="1" Body="&lt;h1&gt;MCL Code&lt;/h1&gt;&#xA;&lt;p&gt;There is a Cellular automata emulator, which is widely used, called &lt;a href=&quot;http://psoup.math.wisc.edu/mcell/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;MCell&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This can emulate Cellular automata and create code for each, with the &lt;code&gt;.mcl&lt;/code&gt; extension.&lt;/p&gt;&#xA;&lt;p&gt;Maybe we might be able to use this.&lt;/p&gt;&#xA;" OwnerUserId="64499" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-12T04:22:04.923" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11526" PostTypeId="2" ParentId="2140" CreationDate="2017-02-12T19:18:26.050" Score="-1" Body="&lt;p&gt;&lt;strong&gt;Wifi Puzzle! Crack the router&lt;/strong&gt;&#xA;[code-golf] [networking]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;SITUATION&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider that you have three wifi routers in your home , all with different SSIDs and none of them are dualband. You have invited a mischievous friend to your home who had changed the password of each router, without letting you know about it. Now to annoy you more he has set up a programming challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;THE CHALLENGE&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your friend has created three .txt files containing a set of passwords with only one correct among them. (i.e. each .txt file contains a correct password while all other are wrong ones. Also one .txt file contains only one correct password) and the .txt files do not specify which one may contain the correct password for a certain router (i.e. you cannot be sure that file1.txt(let us assume it is one of those .txt files) contains the password for router1( say any one of those routers). Now your friend has kept them in a certain directory( say E:\Wifi) and asked you to create a programme or function that would pick up a file and take input from it, try to connect to a random Access point ( out of the three routers) and find which password fits to which router.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sample Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let us consider a file, file1.txt( or any other name you like) be like this&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A12e77799U5&#xA;Pdc555089rtf&#xA;Ds442Y779#1&#xA;1&amp;amp;2*fe$996Yt&#xA;Uty66%92Gu4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that each password contains a capital letter, numbers, special characters, (of a standard keyboard) and each file contains only five unique passwords. Also all the .txt files are in the same directory and there are no subdirectories in the directory concerned. Also each .txt file contains at least one correct password.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sample Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your programme or function must keep a log of its activity in a separate file log.txt which you may put in the same directory concerned or in a different directory. The log file must show which router has been cracked with which password and also the file containing it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example: Say that router1 ( SSID of a router)  has been cracked by the password A12e77799U5 from file1.txt so the output of the log.txt must be &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;router1 password A12e77799U5&#xA;File: file1.txt&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Also you must be sure that all the output goes into the log.txt not seperate files each time a router is cracked. You can create a programme or a function in any programming language. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Keep In Mind&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;This is code-golf so the shortest answer wins.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061&quot;&gt;Standard loopholes&lt;/a&gt; apply as usual.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Discussion&lt;/strong&gt;&#xA;I feel to ask this question but the foremost problem I face is how can others test their code. Also strict I/o rules (like the log.txt I mentioned ) are not appreciated here. &#xA;So please help me out!&lt;/p&gt;&#xA;" OwnerUserId="64144" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2017-02-12T20:09:15.197" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11527" PostTypeId="2" ParentId="2140" CreationDate="2017-02-12T22:29:19.547" Score="-1" Body="&lt;h1&gt;Portable bitmap checkerboard pattern&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to create a checkerboard pattern and store it in a  &lt;a href=&quot;https://en.wikipedia.org/wiki/Netpbm_format&quot; rel=&quot;nofollow noreferrer&quot;&gt;PBM&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Size of the checkerboard is passed in STDIN as two numbers.&#xA;Output is written to STDOUT.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test case:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA;5&#xA;5&#xA;&#xA;Output:&#xA;P1&#xA;5 5&#xA;0 1 0 1 0&#xA;1 0 1 0 1&#xA;0 1 0 1 0&#xA;1 0 1 0 1&#xA;0 1 0 1 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest code wins&lt;/p&gt;&#xA;" OwnerDisplayName="user63331" LastActivityDate="2017-02-12T22:29:19.547" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11528" PostTypeId="2" ParentId="2140" CreationDate="2017-02-13T00:07:01.030" Score="-2" Body="&lt;h1&gt;What in the heck just happened?&lt;/h1&gt;&#xA;&lt;p&gt;I want you to write a program that will bleep out the H-word, regardless of where it occurs, whether it is inside of another word or a stand-alone word, whether capitalized or not.&lt;/p&gt;&#xA;&lt;h2&gt;Input and Output&lt;/h2&gt;&#xA;&lt;p&gt;The inputs and outputs of your program may be any of the following: an array of characters, a string, or any other standard data structure which does the job. However, the output must match the case of the input.&lt;/p&gt;&#xA;&lt;h2&gt;Samples:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;In the format of Input: Output&#xA;A Shell gas station : A Sheck gas station&#xA;Hell is a very bad place to be. : Heck is a very bad place to be.&#xA;Ella fell and Nelly dug a well. : Ella fell and Nelly dug a well.&#xA;Chellsea Thell bought shells. : Checksea Theck bought shecks.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Standard loopholes apply, and the entry submitted by [insert date here] with the lowest number of bytes as defined by the Meta will win.&lt;/p&gt;&#xA;" OwnerUserId="54099" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-13T00:07:01.030" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11530" PostTypeId="2" ParentId="2140" CreationDate="2017-02-13T13:25:42.790" Score="1" Body="&lt;h1&gt;Crossed out 44 is still regular 44&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As it happens, the HTML strikethrough &lt;code&gt;&amp;lt;s&amp;gt;4&amp;lt;/s&amp;gt;&lt;/code&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7427/61405&quot;&gt;lines up&lt;/a&gt; (at least on some systems) with the crossbar of the number &lt;code&gt;4&lt;/code&gt; so that the two don't differ in appearance: &lt;s&gt;4&lt;/s&gt; and 4 look like the same thing. This causes crossed out bytecounts in answers to code golf questions seem a bit confusing if they consist entirely of &lt;code&gt;4&lt;/code&gt;s or if they end or begin with a &lt;code&gt;4&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance, &lt;b&gt;&lt;s&gt;48&lt;/s&gt; &lt;s&gt;44&lt;/s&gt; &lt;s&gt;34&lt;/s&gt; 31 bytes&lt;/b&gt; seems a bit silly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, there is a way to make the strikethrough over a &lt;code&gt;4&lt;/code&gt; appear more clearly. If the bytecount begins with the digit &lt;code&gt;4&lt;/code&gt;, adding a &lt;a href=&quot;https://en.wikipedia.org/wiki/Non-breaking_space&quot; rel=&quot;nofollow noreferrer&quot;&gt;non-breaking space&lt;/a&gt; (ASCII character &lt;code&gt;255&lt;/code&gt;) before the number will make the strikethrough extend beyond the crossbar of the digit &lt;code&gt;4&lt;/code&gt;. Similarly if the bytecount value ends with &lt;code&gt;4&lt;/code&gt;, the non-breaking space is appended to the end.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, &lt;s&gt;44&lt;/s&gt; becomes &lt;s&gt; 44 &lt;/s&gt;, &lt;s&gt;457&lt;/s&gt; becomes &lt;s&gt; 457&lt;/s&gt; and &lt;s&gt;64&lt;/s&gt; becomes &lt;s&gt;64 &lt;/s&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The Goal&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The task here is to automate this fix.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Take a string like this: &lt;code&gt;&amp;lt;s&amp;gt;48&amp;lt;/s&amp;gt; &amp;lt;s&amp;gt;44&amp;lt;/s&amp;gt; &amp;lt;s&amp;gt;34&amp;lt;/s&amp;gt; 31 bytes&lt;/code&gt; as the input, and output or return the string with added non-breaking spaces at the end of each striken through number that ends with the digit four, and to the beginning of each striken through number that begins with the digit four.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, for example, &lt;code&gt;&amp;lt;s&amp;gt;48&amp;lt;/s&amp;gt; &amp;lt;s&amp;gt;44&amp;lt;/s&amp;gt; &amp;lt;s&amp;gt;34&amp;lt;/s&amp;gt; 31 bytes&lt;/code&gt; becomes &lt;code&gt;&amp;lt;s&amp;gt; 48&amp;lt;/s&amp;gt; &amp;lt;s&amp;gt; 44 &amp;lt;/s&amp;gt; &amp;lt;s&amp;gt;34 &amp;lt;/s&amp;gt; 31 bytes&lt;/code&gt;. And here's the difference in effect: &lt;b&gt;&lt;s&gt;48&lt;/s&gt; &lt;s&gt;44&lt;/s&gt; &lt;s&gt;34&lt;/s&gt; 31 bytes&lt;/b&gt; becomes &lt;b&gt;&lt;s&gt; 48&lt;/s&gt; &lt;s&gt; 44 &lt;/s&gt; &lt;s&gt;34 &lt;/s&gt; 31 bytes&lt;/b&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Be sure to use non-breaking spaces, not regular spaces. Do not add them before or after numbers that are not crossed out. You can assume that all strikethroughs are closed (so there's no &lt;code&gt;&amp;lt;s&amp;gt;&lt;/code&gt; that's missing its &lt;code&gt;&amp;lt;/s&amp;gt;&lt;/code&gt;). If there is anything else than the number inside the strikethrough block, no spaces should be added.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your solution can be a program or a function. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest submission (for each language) wins. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes apply&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="61405" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2017-02-13T14:59:22.390" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11531" PostTypeId="1" CreationDate="2017-02-13T15:04:34.460" Score="1" ViewCount="43" Body="&lt;p&gt;As it stands, &lt;a href=&quot;https://codegolf.stackexchange.com/q/6257/45941&quot;&gt;Operations on lists&lt;/a&gt; is in a bit of a weird place. It could be considered a multi-part challenge with minimal interaction between the subchallenges, which &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8464/45941&quot;&gt;aren't allowed&lt;/a&gt;, but is pointed to as a (potential or actual) dupe target for the tasks it requires.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would it be better to break up this challenge into its constituent parts and post each as a separate challenge?&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2017-02-13T15:10:57.580" Title="Should &quot;Operations with lists&quot; be broken up into individual challenges?" Tags="|discussion|policy|specific-question|challenge-quality|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11532" PostTypeId="2" ParentId="11531" CreationDate="2017-02-13T15:04:34.460" Score="4" Body="&lt;h2&gt;Yes, we should break it up&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It's a multi-part challenge, which aren't allowed (the only interaction between the subchallenges is the restriction to a single language and the ability to reuse code, which is my eyes is a &quot;small interaction&quot;, to use the terminology of the meta policy), and allowing it to remain open makes it a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11082/45941&quot;&gt;broken window&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I propose the following steps to rectify the situation:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Close the challenge as off-topic, citing our policy on multi-part challenges.&lt;/li&gt;&#xA;&lt;li&gt;Post each of the statistics in the challenge as their own challenge (excepting those that already exist, like &lt;a href=&quot;https://codegolf.stackexchange.com/q/106149/45941&quot;&gt;median&lt;/a&gt;):&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Sum&lt;/li&gt;&#xA;&lt;li&gt;Product&lt;/li&gt;&#xA;&lt;li&gt;Arithmetic mean&lt;/li&gt;&#xA;&lt;li&gt;Median&lt;/li&gt;&#xA;&lt;li&gt;Adjacent differences (a.k.a. first-order discrete differences)&lt;/li&gt;&#xA;&lt;li&gt;Sorting ascending&lt;/li&gt;&#xA;&lt;li&gt;Minimum&lt;/li&gt;&#xA;&lt;li&gt;Maximum&lt;/li&gt;&#xA;&lt;li&gt;Standard deviation&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Optionally move duplicate challenges' targets to the appropriate subchallenge. This isn't terribly important, but it would be nice to have the dupe targets correct.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2017-02-13T15:10:57.580" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11533" PostTypeId="1" AcceptedAnswerId="11534" CreationDate="2017-02-13T16:46:19.940" Score="2" ViewCount="136" Body="&lt;p&gt;A few weeks ago I posted &lt;a href=&quot;https://codegolf.stackexchange.com/a/108702/41863&quot;&gt;this answer&lt;/a&gt; on a challenge. Yesterday it was deleted because &lt;a href=&quot;https://codegolf.stackexchange.com/questions/108536/kolmogorov-complexity-meta-golfer/108702?noredirect=1#comment267392_108702&quot;&gt;&quot;it isn't a serious contender for the winning criteria&quot;&lt;/a&gt; despite getting the second best score in the challenge. Seeing as I had faced some criticism when I posted the answer I must not understand the policy. Why is a second-place answer considered to be uncompetitive? Why are other answers with much worse scores not removed (examples: &lt;a href=&quot;https://codegolf.stackexchange.com/a/108541/41863&quot;&gt;1&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/109306/41863&quot;&gt;2&lt;/a&gt;)?&lt;/p&gt;&#xA;" OwnerUserId="41863" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2017-02-13T17:17:16.777" Title="Why is this answer considered non-competitive?" Tags="|discussion|policy|winning-criteria|deleted-answers|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11534" PostTypeId="2" ParentId="11533" CreationDate="2017-02-13T17:00:09.223" Score="5" Body="&lt;p&gt;I deleted the answer because it made no effort whatsoever to compress its input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now that the test case has been revealed, it turns out that trying to compress the input is rather pointless, as even the answers with the most sophisticated algorithms can shave off only a handful of bytes, if any.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I didn't anticipate that, so my bad. I've undeleted your answer.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2017-02-13T17:17:16.777" LastActivityDate="2017-02-13T17:17:16.777" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11535" PostTypeId="1" CreationDate="2017-02-13T18:14:07.160" Score="2" ViewCount="82" Body="&lt;p&gt;We already asked &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7269/44713&quot;&gt;this question&lt;/a&gt; on a tag for &lt;em&gt;misbehaviors&lt;/em&gt;, but the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/misbehaviors&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;misbehaviors&amp;#39;&quot; rel=&quot;tag&quot;&gt;misbehaviors&lt;/a&gt; would only apply to popularity contests where the misbehavior wasn't easily seen (see: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt;). However, there are quite a few contests that are involving errors as the full purpose of the challenge, not just as a slight of hand. I have compiled a short list below for examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/36260/44713&quot;&gt;Make an error quine!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/41334/44713&quot;&gt;The Fatal Error Challenge&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/51007/44713&quot;&gt;Make a slow error quine maker!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/107193/44713&quot;&gt;Exit Code Golfing&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/9359/44713&quot;&gt;Shortest program that throws StackOverflow Error&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;These all need a tag to specify that they relate to errors and/or exceptions. I suggest that we make an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/error&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;error&amp;#39;&quot; rel=&quot;tag&quot;&gt;error&lt;/a&gt; tag.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="68942" LastEditDate="2021-06-02T19:33:57.997" LastActivityDate="2021-07-02T20:04:25.987" Title="Create the [error] tag" Tags="|feature-request|status-completed|tags|" AnswerCount="1" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="11536" PostTypeId="1" CreationDate="2017-02-13T18:52:44.090" Score="5" ViewCount="184" Body="&lt;p&gt;Currently &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brain-flak&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brain-flak&amp;#39;&quot; rel=&quot;tag&quot;&gt;brain-flak&lt;/a&gt;, according to the usage guidelines, only applies to &lt;a href=&quot;https://github.com/DJMcMayhem/Brain-Flak&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brain-Flak&lt;/a&gt; language.  However as Brain-Flak has grown in popularity a number of smaller very closely related languages have sprung up.  So far the inventory of Brain-Flak inspired languages is:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://github.com/DJMcMayhem/Brain-Flak&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brain-Flak&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Miniflak&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://github.com/Flakheads/Flakcats&quot; rel=&quot;nofollow noreferrer&quot;&gt;Flakcats&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://github.com/Wheatwizard/Brain-Flueue&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brain-Flueue&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://github.com/DJMcMayhem/Brain-Flak/tree/9f22727cc08fc7f48be11393ecfe44db331de55a&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brain-Flak Classic&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://github.com/Flakheads/f-ak&quot; rel=&quot;nofollow noreferrer&quot;&gt;Fλak&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Already questions on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/105127/fastest-mini-flak-quine&quot;&gt;Miniflak&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/79625/write-a-brain-flak-classic-interpreter&quot;&gt;Brain-Flak Classic&lt;/a&gt; have been tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brain-flak&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brain-flak&amp;#39;&quot; rel=&quot;tag&quot;&gt;brain-flak&lt;/a&gt; and in my opinion this makes a lot of sense for these cases.  Should the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brain-flak&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brain-flak&amp;#39;&quot; rel=&quot;tag&quot;&gt;brain-flak&lt;/a&gt; be expanded to encompass related languages which might be too small or infrequently used to warrant their own tags?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-17T21:17:07.463" Title="Should [tag:Brain-Flak] apply to other languages?" Tags="|discussion|tags|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11537" PostTypeId="2" ParentId="11536" CreationDate="2017-02-13T19:27:13.077" Score="4" Body="&lt;p&gt;&lt;strong&gt;In your specific example? Yes.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think there are plenty of reasons that flak-like languages should be tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brain-flak&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brain-flak&amp;#39;&quot; rel=&quot;tag&quot;&gt;brain-flak&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Miniflak is a direct subset of brain-flak, so you could even get away with pretending the language doesn't exist and calling it a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brain-flak&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brain-flak&amp;#39;&quot; rel=&quot;tag&quot;&gt;brain-flak&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; question.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Brain-flak Classic &lt;em&gt;is&lt;/em&gt; brain-flak, just less evolved/refined. Classic was the first finished version of brain-flak to be used/published. The current version is the original with the &lt;code&gt;[...]&lt;/code&gt; and &lt;code&gt;[]&lt;/code&gt; functions changed &lt;a href=&quot;https://github.com/DJMcMayhem/Brain-Flak/issues/5#issuecomment-228446583&quot; rel=&quot;nofollow noreferrer&quot;&gt;to make it more powerful&lt;/a&gt;. As far as I'm concerned, classic is like a &lt;em&gt;version zero&lt;/em&gt;, and the current is version one. FWIW, the only challenge specific to classic was written before the change. I noticed this a while ago, and edited the title/description to avoid confusing people about what &lt;code&gt;[]&lt;/code&gt; is supposed to do.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I highly doubt there will be enough questions specific to a variant of brain-flak to make it worth adding a tag for any variant.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;But there's a more general question too. &quot;Should questions about X be tagged with Y, when X is inspired by/a subset of Y?&quot; This is a good question since we have &lt;em&gt;tons&lt;/em&gt; of language-variants. For example, there is V/Vim, J/Jelly, Python/Pyth, Actually/Seriously, Brachylog/Prolog, etc. Not to mention the 8-trillion brainf*** variants.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;In this more general case? It varies.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a lot of cases, it comes down to discretion, but a good general guideline is&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Is X largely backwards compatible with Y, or Y with some gag tacked on? If so, the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/y&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;y&amp;#39;&quot; rel=&quot;tag&quot;&gt;y&lt;/a&gt; tag is a appropriate. Otherwise, it should be untagged or have it's own tag made.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;For some more concrete examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If I were to ever make a V specific question, I would most definitely tag it with vim. This is because V is &lt;em&gt;mostly&lt;/em&gt; backwards compatible. (If I had to guess, I'd say ~90%~ of vim programs could be run in the V interpreter with no problems) Also, I don't think it's worth creating a tag just for V.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Questions about Ook! or compressedf***, or bitf*** or whatever variant of brainf*** you have should be tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brainfuck&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brainfuck&amp;#39;&quot; rel=&quot;tag&quot;&gt;brainfuck&lt;/a&gt;, because in most cases they &lt;em&gt;are&lt;/em&gt; the same language, with the silly substitution rules tacked on to the end.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Questions about Pyth or Jelly or Brachylog should definitely &lt;em&gt;not&lt;/em&gt; be tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot;&gt;python&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/j&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;j&amp;#39;&quot; rel=&quot;tag&quot;&gt;j&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/prolog&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;prolog&amp;#39;&quot; rel=&quot;tag&quot;&gt;prolog&lt;/a&gt; respectively. This is because they have evolved enough to pass the point of being &quot;a variant&quot;, and as far as I know, attempting to run J code in the Jelly interpreter or vice-versa would absolutely not work. Same for the other languages. (I don't actually know how to use any of these languages, so someone please correct me if I'm wrong)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I purposefully said &quot;Untagged or have it's own tag made&quot;, because this varies too, mostly depending on popularity of the language/number of potential questions to tag it with. I'd say if you can foresee putting the tag on &lt;em&gt;at least&lt;/em&gt; 3-4 questions, making a new tag should be fine.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="31716" LastEditDate="2017-02-14T17:55:35.313" LastActivityDate="2017-02-14T17:55:35.313" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11538" PostTypeId="2" ParentId="2140" CreationDate="2017-02-14T00:26:47.617" Score="0" Body="&lt;h1&gt;Roman Dates&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The Romans measured dates based on three days every month:&lt;br&gt;&#xA;The Kalends, or the 1st&lt;br&gt;&#xA;The Nones, which was usually on the 5th,&lt;br&gt;&#xA;and the Ides, which was usually on the 13th.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In March, May, July, and October the Ides and Nones fall two days later, on the 7th and 15th.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Months&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are two forms of the months that matter for this challenge:&lt;br&gt;&#xA;Ablative:  &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Ianuariis&lt;/li&gt;&#xA;&lt;li&gt;Februriis&lt;/li&gt;&#xA;&lt;li&gt;Martiis&lt;/li&gt;&#xA;&lt;li&gt;Aprilibus&lt;/li&gt;&#xA;&lt;li&gt;Maiis&lt;/li&gt;&#xA;&lt;li&gt;Iuniis&lt;/li&gt;&#xA;&lt;li&gt;Iuliis&lt;/li&gt;&#xA;&lt;li&gt;Augustis&lt;/li&gt;&#xA;&lt;li&gt;Septembribus&lt;/li&gt;&#xA;&lt;li&gt;Octobribus&lt;/li&gt;&#xA;&lt;li&gt;Novembribus&lt;/li&gt;&#xA;&lt;li&gt;Decembribus&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;And Accusative:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Ianuarias&lt;/li&gt;&#xA;&lt;li&gt;Februarias&lt;/li&gt;&#xA;&lt;li&gt;Martias&lt;/li&gt;&#xA;&lt;li&gt;Apriles&lt;/li&gt;&#xA;&lt;li&gt;Maias&lt;/li&gt;&#xA;&lt;li&gt;Iunias&lt;/li&gt;&#xA;&lt;li&gt;Iulias&lt;/li&gt;&#xA;&lt;li&gt;Augustas&lt;/li&gt;&#xA;&lt;li&gt;Septembres&lt;/li&gt;&#xA;&lt;li&gt;Octobres&lt;/li&gt;&#xA;&lt;li&gt;Novembres&lt;/li&gt;&#xA;&lt;li&gt;Decembres&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Calculation of dates&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;On the day of one of them, they used the ablative of the day (Kalendis, nonis, or Idibus) combined with the ablative of the month (e.g. Idibus martiis)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One day before one of them they used pridie with the accusative of the day (Kalendas, Nonas, and Idus) and month (e.g. pridie nones septembres)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Romans calculated the date as how many days until the next one of these, counting inclusively.  They used a.d. and the number of days until the next one in lowercase roman numerals, and then the day and month in accusative (e.g. a.d. xxii Kalendas Iulias)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Years&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The years are counted since the Founding of the city of Rome in 753 B.C.E., with A.U.C. appended to the end of it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://novaroma.org/nr/Roman_dates&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://novaroma.org/nr/Roman_dates&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is, give an input of a day, month, and year in any preferred format, to return a string given the Roman date.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As this is code-golf, the code with the shortest bytes wins, and the standard loopholes are disallowed.&lt;/p&gt;&#xA;" OwnerDisplayName="user50198" LastActivityDate="2017-02-14T00:26:47.617" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11539" PostTypeId="1" CreationDate="2017-02-14T04:36:38.033" Score="2" ViewCount="242" Body="&lt;p&gt;I've invented a new language called FunKiller, which is designed to make &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/radiation-hardening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; rel=&quot;tag&quot;&gt;radiation-hardening&lt;/a&gt; challenges trivial and boring. This is the JavaScript interpreter:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function interpret(s) {&#xA;  var lines = s.split(&quot;\n&quot;);&#xA;  var max = 0;&#xA;  var longestLine = &quot;&quot;&#xA;  lines.forEach(function(l) {&#xA;    if (l.length &amp;gt; max) {&#xA;      max = l.length;&#xA;      longestLine = l;&#xA;    }&#xA;  });&#xA;  i = prompt();&#xA;  eval(longestLine);&#xA;  alert(o);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As you can tell, it just finds the longest line in the file and &lt;code&gt;eval&lt;/code&gt;'s it. This means that I can trivially make any JS program radiation-hardened in this language:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;alert(prompt()*2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Becomes:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;o=i*2&#xA;&#xA;&#xA;o=i*2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I certainly don't want this language to be used. Is this language valid for future challenges?&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="56656" LastEditDate="2017-03-01T20:08:40.680" LastActivityDate="2017-03-01T20:08:40.680" Title="Introducing FunKiller" Tags="|discussion|policy|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11540" PostTypeId="2" ParentId="11539" CreationDate="2017-02-14T04:51:01.563" Score="5" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Is this language valid for future challenges?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Yes, the language became eligible to moment you published an interpreter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But that's not a problem. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/radiation-hardening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; rel=&quot;tag&quot;&gt;radiation-hardening&lt;/a&gt; challenges are fun, but we do not need a whole bunch of them. The best challenges of this kind are innovative; they introduce a new concept or use one that has been recently introduced. For example, we have more than enough &quot;make a quine that does X&quot; challenges. Some offer a challenge, others just require trivial modifications of your language's payload-capable quine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What I'm getting at is that challenge writers should try to come up with a spin of radiation-hardening rather than plain radiation-hardening. A FunKillerKiller, if you will. The tiniest change would make FunKiller useless for the challenge, as detecting the longest line would not be enough anymore.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="194" LastEditDate="2017-02-14T07:05:38.763" LastActivityDate="2017-02-14T07:05:38.763" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11541" PostTypeId="1" AcceptedAnswerId="11602" CreationDate="2017-02-14T05:08:58.157" Score="9" ViewCount="823" Body="&lt;p&gt;Here are some example &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; submissions using Wolfram|Alpha:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/109919/61980&quot;&gt;Valentine's golf! I heart you!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/31748/61980&quot;&gt;Largest number in ten bytes of code&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have two main questions about the use of Wolfram|Alpha:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Is the use of the Internet problematic?&lt;/li&gt;&#xA;&lt;li&gt;What is considered the output?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The Internet connectivity concern gets brought up alot on these answers and the argument is usually raised that since there are Raspberry Pis which run the Wolfram Language without an Internet connection, they are fine. The problem is that the WL is not the same thing as Wolfram|Alpha (indeed, most Mathematica answers on this site would be more accurately called WL solutions since Mathematica is just one program which runs the WL). I can't find any evidence that these Raspberry Pis can actually evaluate W|A queries such as &lt;code&gt;ack(9!,9!)&lt;/code&gt; or &lt;code&gt;heartcurve1&lt;/code&gt; (which are meaningless in the WL) without an Internet connection. Even if they did, it would have to be a limited in scope compared to the W|A site and I doubt people are testing their code on Raspberry Pis to ensure that their query will work.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it's also unclear what the output of an expression typed into W|A should be. The results page for any W|A query consists of several pods and subpods, such as &lt;code&gt;Input interpretation&lt;/code&gt;, &lt;code&gt;Plot&lt;/code&gt;, &lt;code&gt;Equations&lt;/code&gt;, &lt;code&gt;Properties&lt;/code&gt;, &lt;code&gt;Input&lt;/code&gt;, &lt;code&gt;Result&lt;/code&gt;, &lt;code&gt;Alternate forms&lt;/code&gt;, etc. For the heart curve example, I think we are expected to interpret the content in &lt;code&gt;Plot&lt;/code&gt; as the output, whereas for the Ackermann function example, we go with the &lt;code&gt;Knuth up-arrow&lt;/code&gt; subpod in &lt;code&gt;Alternate forms&lt;/code&gt; (note that we can't even say that the rule is to use the first pod after the input interpretation pod since in this case the output would be &lt;code&gt;(too large to represent)&lt;/code&gt;). How is this valid, but just outputting all possible strings of length 13 isn't considered a valid answer if the challenge is to output &lt;code&gt;Hello, world!&lt;/code&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that this isn't covered by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7314/are-mathematicas-datasets-valid&quot;&gt;this question&lt;/a&gt; about the use of W|A's datasets since we're not just getting data using Mathematica built-ins, but using Wolfram|Alpha to parse the &quot;code&quot; and functions (such as the Ackermann function) which only exist in W|A.&lt;/p&gt;&#xA;" OwnerDisplayName="user61980" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2017-02-21T09:59:18.433" Title="Is Wolfram|Alpha a valid language?" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11543" PostTypeId="2" ParentId="11541" CreationDate="2017-02-14T08:47:48.913" Score="1" Body="&lt;h2&gt;A language is defined by is interpreter (or at least on PPCG)&lt;/h2&gt;&#xA;&lt;p&gt;So yes, Wolfram|Alpha is a valid interpreter (and language by extension).&#xA;Running a script on Wolfram|Alpha is no different that using TIO.&lt;/p&gt;&#xA;&lt;p&gt;As for the output, i would say it's everything (too bad kolmogorov-complexity questions) but that's probably a good question for another meta post should Wolfram|Alpha be validated&lt;/p&gt;&#xA;" OwnerUserId="56245" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-14T08:47:48.913" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11548" PostTypeId="2" ParentId="2140" CreationDate="2017-02-14T14:13:27.260" Score="0" Body="&lt;h1&gt;Mathematical Creativity&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;At our workplace we are so creative that sometimes we decide that today the number &lt;code&gt;2=9&lt;/code&gt;, &lt;code&gt;0=231&lt;/code&gt; or &lt;code&gt;67=5&lt;/code&gt;... just for the sake of it. So for that day everyone in the workplace must consider that fact.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a full program or function that takes as input today's value of the decided number, which operation to perform and output the result, of course the new number's value affects also the result.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Only positive integers &lt;code&gt;&amp;gt;= 0&lt;/code&gt;and &lt;code&gt;&amp;lt;= 1000000&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The math operations to perform are only sum &lt;code&gt;+&lt;/code&gt;, subtraction &lt;code&gt;-&lt;/code&gt; or multiplication &lt;code&gt;*&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The input is taken from standard input in any reasonable format for example: &lt;code&gt;[N V X + Y]&lt;/code&gt;, &lt;code&gt;N,V,X,+,Y&lt;/code&gt;, &lt;code&gt;NVX+Y&lt;/code&gt;, &lt;code&gt;(&quot;N&quot;,&quot;V&quot;,&quot;X&quot;,&quot;+&quot;,&quot;Y&quot;)&lt;/code&gt;, &lt;code&gt;['N','V','X','+','Y']&lt;/code&gt;, etc.&lt;/li&gt;&#xA;&lt;li&gt;First parameter &lt;code&gt;N&lt;/code&gt; is the choosen number.&lt;/li&gt;&#xA;&lt;li&gt;Second parameter &lt;code&gt;V&lt;/code&gt; is new value of &lt;code&gt;N&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Third parameter &lt;code&gt;X&lt;/code&gt; is the first number of the math operation.&lt;/li&gt;&#xA;&lt;li&gt;Fourth parameter is the math operation to perfom, can be only &lt;code&gt;+&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;, &lt;code&gt;*&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Fifth parameter &lt;code&gt;Y&lt;/code&gt; is the second number of the math operation.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Explained example:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Input &lt;code&gt;5,27,252,+,3&lt;/code&gt;. &lt;/li&gt;&#xA;&lt;li&gt;All the &lt;code&gt;5&lt;/code&gt;'s becomes &lt;code&gt;27&lt;/code&gt; so &lt;code&gt;254+3 -&amp;gt; 2272+3=2275&lt;/code&gt; but the result is &lt;code&gt;2275&lt;/code&gt;, it contains &lt;code&gt;5&lt;/code&gt; so it becomes &lt;code&gt;22727&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;No recursive substitution or infinite loop is needed. The substitution must be performed only once on &lt;code&gt;X,Y&lt;/code&gt; and on the result. &lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example inputs / outputs:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input              &amp;gt; Output&#xA;----------------------------------------------&#xA;5,27,252,+,3       &amp;gt; 2272+3=22727 &#xA;45,0,237456,-,4567 &amp;gt; 23706-067=23639&#xA;9,7,349,*,7        &amp;gt; 347*7=2427&#xA;121,1,1212121,+,0  &amp;gt; 121+0=1&#xA;5,55,555,+,5555    &amp;gt; 555555+55555555=556111110&#xA;10,5,11000,*,10    &amp;gt; 1500*5=7500&#xA;1,2,3,+,4          &amp;gt; 3+4=7&#xA;4,4,3,+,4          &amp;gt; 3+4=7&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The number substitution must be performed only once on the first two numbers &lt;code&gt;X,Y&lt;/code&gt; and only once on the final result. No recursive substitution or infinite loops are needed.&lt;/li&gt;&#xA;&lt;li&gt;The output must contain the full math operation, not only the final result, for example: &lt;code&gt;2272+3=22727&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest code wins.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox questions:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Is this a duplicate of another question? I thought it would already exist but couldn't find any challenge by searching. If you know of it please let me know.&lt;/li&gt;&#xA;&lt;li&gt;Is the input enough clear or is it possible to improve in some way?&lt;/li&gt;&#xA;&lt;li&gt;Is the challenge clear?&lt;/li&gt;&#xA;&lt;li&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Suggestion for title?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="59718" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2017-02-17T07:44:02.200" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11549" PostTypeId="2" ParentId="2140" CreationDate="2017-02-14T15:24:48.120" Score="0" Body="&lt;h2&gt;Milking the cows&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When I was a kid, we used to play a card game called &quot;Milking the cows&quot;. I have &lt;em&gt;no&lt;/em&gt; idea why it was called that, as it had nothing to do with said activity, but whatever. For months we would play furiously, seeing who was best at this game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It wasn't until years later that I realized the game is completely deterministic. All my hours of practice turned out to have been pointless. But now it does make for an interesting code-golf.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules of the game&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are two players. Each is dealt half of a standard pack of shuffled cards. Every round, both players draw the top two cards from their respective decks and compare values. The highest scoring pair wins, and that player adds all captured cards to his stack of cards (at the bottom).&#xA;In case of a draw, both players draw one additional card and compare again (If this is again a draw, another card is drawn, etc)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The game continues with both sides drawing cards until one player is unable to draw another card, at which point they lose and their opponent wins the game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Card values are equal to the printed number for number cards, Aces are 11 points and J/Q/K are all 10.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an input string of 52 characters representing the cards (without suit, since it doesn't matter in this game), deal the first 26 to player 1, the rest to player 2, and then determine who wins that match of Milking the cows.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The characters sent are 2,3,4,5,6,7,8,9,T,J,Q,K,A for the numbers, Ten, Jack, Queen, King and Ace. It can be assumed that the input string is  correct and contains &lt;em&gt;exactly&lt;/em&gt; 4 of each character.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The top of the stack is on the right side; the bottom of the stack is on the left side. Cards are always drawn or put back on the bottom &lt;em&gt;one at a time&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When a round is won, cards are added to the bottom of the winner's stack, starting with the opponent's cards and then the own cards, in the order they were drawn.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When the winner is determined, output the number of the player that won. It is possible (but phenomenally unlikely) for the game to end in a draw, because &lt;em&gt;both&lt;/em&gt; players are unable to draw a card. In this case, output 0.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example of a round:&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Player 1's stack: QTKJ42336K59QKJ77T8J953485&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Player 2's stack: JTK676ATQ8A576429Q2A948A23&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Player 1 draws: 5, 8&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Player 2 draws: 3, 2&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Player 1 wins the round (13 points vs 5)&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Player 1's new stack: 8523QTKJ42336K59QKJ77T8J9534&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Player 2's new stack: JTK676ATQ8A576429Q2A948A&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Testcases:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;69K9A9QJ8TT33A88KQ685J97AQK224Q2726T73547K6J554J4AT3 -&amp;gt; 2&#xA;98JK947A5K283A5A2TAJ6K278T4TQT73674Q956JK94Q68QJ3352 -&amp;gt; 2&#xA;9T87J2K38KJT846558A2Q4A95395T67936A7Q2J4TQAK623JKQ74 -&amp;gt; 1&#xA;J67835828K48KA45TQ546JQ479TA2JT2Q933K27JT69KA9735QA6 -&amp;gt; 1&#xA;23456789TJQKA23456789TJQKA23456789TJQKA23456789TJQKA -&amp;gt; 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, so the shortest code in bytes wins. &lt;/p&gt;&#xA;" OwnerUserId="31036" LastActivityDate="2017-02-14T15:24:48.120" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11553" PostTypeId="1" CreationDate="2017-02-15T01:58:08.250" Score="3" ViewCount="374" Body="&lt;p&gt;Commodore 64 BASIC has abbreviated forms for most of its keywords, ranging from &lt;code&gt;?&lt;/code&gt; being short for &lt;code&gt;PRINT&lt;/code&gt; (common across many dialects of BASIC) to C64-specific ones such as &lt;code&gt;D♠&lt;/code&gt; (&lt;code&gt;D&lt;/code&gt; followed by &lt;code&gt;SHIFT+A&lt;/code&gt;) being short for &lt;code&gt;DATA&lt;/code&gt;.  When you list a program's source code after typing it in, most of these abbreviations will be expanded (but not all of them -- &lt;code&gt;TI&lt;/code&gt;, &lt;code&gt;TI$&lt;/code&gt;, and &lt;code&gt;ST&lt;/code&gt; won't be) and some optional whitespace will be inserted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've been counting the length of C64 programs as &quot;the number of characters typed in&quot;, which seems more or less in-line with how other languages are scored.  However, &lt;a href=&quot;https://codegolf.stackexchange.com/users/61603/shaun-bebbers&quot;&gt;Shaun Bebbers&lt;/a&gt; has started golfing in C64 BASIC as well, and is counting the length of programs in terms of &quot;bytes of program memory used&quot; (see, for example, &lt;a href=&quot;https://codegolf.stackexchange.com/a/109920/19365&quot;&gt;this answer&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What's the correct way of counting the length of a program?&lt;/p&gt;&#xA;" OwnerUserId="19365" LastEditorUserId="46076" LastEditDate="2020-04-26T04:22:25.597" LastActivityDate="2020-04-26T04:22:25.597" Title="How should the length of a Commodore 64 BASIC program be measured?" Tags="|discussion|code-golf|answers|scoring|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11554" PostTypeId="2" ParentId="11553" CreationDate="2017-02-15T03:03:14.877" Score="6" Body="&lt;h1&gt;Bytes of Memory&lt;/h1&gt;&#xA;&lt;p&gt;Characters, although are an easy measurement, can sometimes produce more than a byte worth of data, (See any character encoding that supports more than 256 unique characters), and sometimes fails to account for tokens. As the program may treat some data as 'tokens', storing it in less bytes then typed, and, To my knowledge, C64-BASIC doesn't support characters larger than a byte, you're simply handicapping yourself by not doing this.&lt;/p&gt;&#xA;&lt;p&gt;Memory bytes act as a definitive method of counting how many bytes the program takes, and as such, should be the score for code-golf.&lt;/p&gt;&#xA;" OwnerUserId="58375" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-15T11:08:52.577" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11556" PostTypeId="2" ParentId="2140" CreationDate="2017-02-15T10:40:58.890" Score="1" Body="&lt;h1&gt;Render STL files&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.m.wikipedia.org/wiki/STL_(file_format)&quot; rel=&quot;nofollow noreferrer&quot;&gt;STL&lt;/a&gt; means &lt;strong&gt;St&lt;/strong&gt;ereo&lt;strong&gt;L&lt;/strong&gt;ithography. It's a common file format, used in 3D printing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The way it works is quite simple. You change every surfaces to triangles. For example, a cube would have 12 triangles, since it has 6 sides, and each sides has 2 triangles.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you have to read STL(A) files and render them.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Explain me more about the file format..&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strike&gt;&lt;sup&gt;Well, technically, I linked you to the wikipedia, but I'll just explain, You can just, uh, go to the wiki if you want, you know?&lt;/sup&gt;&lt;/strike&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Alright. the file is in this format.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;solid [optional name]&#xA;facet normal ni nj nk&#xA;    outer loop&#xA;        vertex v1x v1y v1z&#xA;        vertex v2x v2y v2z&#xA;        vertex v3x v3y v3z&#xA;    endloop&#xA;endfacet&#xA;endsolid [optional name]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The part you have to look is the vertexes. you can see there are 3 vertexes each with three numbers (each of them are coodrinates of each axes). Remember I told that you change every surface to triangles? These three vertexes form a triangle.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;and the part between &lt;code&gt;facet normal&lt;/code&gt; and &lt;code&gt;endfacet&lt;/code&gt; will be given multiple times, forming multiple triangles, forming a 3D object. like the cube I told you before.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You do not have to look at the numbers right after the &lt;code&gt;facet normal&lt;/code&gt;. it will not affect the shape. (at least in this challenge)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I couldn't copy all of them so I decided to leave a &lt;a href=&quot;https://people.sc.fsu.edu/~jburkardt/data/stla/stla.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;link&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="64499" LastEditorUserId="64499" LastEditDate="2017-02-16T05:32:41.303" LastActivityDate="2017-02-16T05:32:41.303" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="11557" PostTypeId="2" ParentId="2140" CreationDate="2017-02-15T14:20:20.793" Score="0" Body="&lt;h1&gt;Convert to polynomial base numbers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base-conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; rel=&quot;tag&quot;&gt;base-conversion&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Background&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Base Representation&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Bases may be written with the following generalization (let concatenation just represent adjacency in digits; &lt;code&gt;10 = ab&lt;/code&gt; when &lt;code&gt;a = 1, b = 0&lt;/code&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abcde&lt;sub&gt;x&lt;/sub&gt; = ax^4 + bx^3 + cx^2 + dx^1 + ex^0&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Essentially, we can write in any base we want such that the last digit is base to the power 0, penultimate digit is base to the power 1, etc. When we make the base a variable (&lt;code&gt;x&lt;/code&gt;), we can represent a polynomial with a number.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Representation Overflow&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Let's take our example before with &lt;code&gt;abcde&lt;sub&gt;x&lt;/sub&gt;&lt;/code&gt;. What happens when our representation for numbers (base 10 for our case) becomes too large to represent with a single character? Why, we use the tilda (&lt;code&gt;~&lt;/code&gt;) on both sides of the value.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thus, if we had the conditions &lt;code&gt;a = 9, b = 32, c = 2, d = 43, e = 10&lt;/code&gt; and were restricted to writing with base 10 representations for each value, our number may be represented as &lt;code&gt;9~32~2~43~~10~&lt;sub&gt;x&lt;/sub&gt;&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Minimized Polynomials&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;For this challenge, I will occasionally refer to &quot;Minimized Polynomials&quot;. When I say this, I mean that there will be no spaces in the polynomial string, terms with coefficients of zero will not be shown, and polynomials will be written in terms of greatest term first.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the following is &lt;em&gt;not&lt;/em&gt; a minimized polynomial:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x^2 + x^0 + 5 * x^4 + 0x^1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The following is the first example's minimized form:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;5x^4+1x^2+1x^0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;The Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a valid minimized polynomial string input &lt;code&gt;n&lt;/code&gt;, write a function or program which returns or prints the polynomial base representation of the value in base 10, allowing for representation overflow.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let &lt;code&gt;f&lt;/code&gt; be the function described in the task:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt; f(&quot;1x^4+1x^3+1x^2+1x^1+1x^0&quot;)&#xA;1111&#xA;&#xA;&amp;gt;&amp;gt;&amp;gt; f(&quot;6x^3+1x^1+5x^0&quot;)&#xA;6015&#xA;&#xA;&amp;gt;&amp;gt;&amp;gt; f(&quot;20x^4+4x^3+1x^1&quot;)&#xA;~20~4010&#xA;&#xA;&amp;gt;&amp;gt;&amp;gt; f(&quot;300x^6+30x^4+40x^3+2x^2+1x^0&quot;)&#xA;~300~0~30~~40~201&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="44713" LastActivityDate="2017-02-15T14:20:20.793" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11559" PostTypeId="1" CreationDate="2017-02-15T16:08:33.197" Score="1" ViewCount="104" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1335/too-trivial-close-vote&quot;&gt;Related reasons but not the same&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5782/adding-a-too-narrow-close-option&quot;&gt;2&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/51039/recursive-zipper-reincarnation&quot;&gt;This challenge&lt;/a&gt; is currently in the process of being closed as 'too-narrow', which in this context means &quot;this challenge is too hard/has too many restrictions, and thus is off-topic&quot;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't think we should allow this.  Compare to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/11880/build-a-working-game-of-tetris-in-conways-game-of-life&quot;&gt;Build a working game of Tetris in Conway&amp;#39;s Game of Life&lt;/a&gt;. Both are ridiculously hard, but neither have been proven impossible yet. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do we vote to close challenges because they are too hard?&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2017-02-15T16:10:40.550" Title="Can we vote to close challenges as impossible?" Tags="|discussion|close-reasons|" AnswerCount="1" CommentCount="4" ClosedDate="2017-02-15T16:19:33.507" ContentLicense="CC BY-SA 3.0" />
  <row Id="11560" PostTypeId="2" ParentId="11559" CreationDate="2017-02-15T16:10:40.550" Score="5" Body="&lt;h1&gt;We should only close challenges that are provably impossible&lt;/h1&gt;&#xA;&lt;p&gt;&amp;quot;Solve the halting problem&amp;quot; should be closed as off-topic because it's provably impossible. The challenge in question here should not be closed for that reason, because it's theoretically possible.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-15T16:10:40.550" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11561" PostTypeId="2" ParentId="2140" CreationDate="2017-02-15T16:37:36.000" Score="1" Body="&lt;h1&gt;Texplode&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/koth&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;koth&amp;#39;&quot; rel=&quot;tag&quot;&gt;koth&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Texplode is like Hexplode, but played on a tetragonal (square) grid. &lt;em&gt;explains the rules&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;I/O&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You will provide two device files / named pipes / terminals / COM ports / other. One of these will be for input, and the other will be for output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input provided to your program will be a series of ASCII numbers &lt;code&gt;n^2&lt;/code&gt; characters long, followed by a &lt;code&gt;;&lt;/code&gt; character. The file will be flushed after this is put into it. The meaning of each number is as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;0&lt;/code&gt;: There are no counters here. You can place here.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1&lt;/code&gt;: There is one counter here, but it is not yours.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;2&lt;/code&gt;: There are two counters here, but they are not yours.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;3&lt;/code&gt;: There are three counters here, but they are not yours.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;4&lt;/code&gt;: There is one counter here, and it is yours. You can place here.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;5&lt;/code&gt;: There are two counters here, and they are yours. You can place here.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;6&lt;/code&gt;: There are three counters here, and they are yours. You can place here.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;These numbers should be interpreted as being laid onto a &lt;code&gt;n&lt;/code&gt; by &lt;code&gt;n&lt;/code&gt; grid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output provided by your program should be a number followed by a &lt;code&gt;;&lt;/code&gt;. The number should be the position in the input stream that your program wants to place a counter. It must be a position that you can place in, otherwise Undefined Behaviour will occur.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Controller&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The Texplode engine will be here soon.&lt;/p&gt;&#xA;" OwnerUserId="43394" LastActivityDate="2017-02-15T16:37:36.000" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="11562" PostTypeId="2" ParentId="2140" CreationDate="2017-02-15T17:26:19.573" Score="4" Body="&lt;h1&gt;Regex Golf Generators&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regex&amp;#39;&quot; rel=&quot;tag&quot;&gt;regex&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Challenge:&lt;/h2&gt;&#xA;&lt;h3&gt;Cops:&lt;/h3&gt;&#xA;&lt;p&gt;The cops must post a 150 byte or less program in any language that outputs between 20 and 200 strings of printable ASCII (this excludes newlines), half of them &amp;quot;match&amp;quot; strings and half &amp;quot;don't match&amp;quot; strings. You can't output an odd number of strings -- there must be one don't match for each match.&lt;/p&gt;&#xA;&lt;p&gt;The strings can be output as two lists of strings, or one list with a fixed delimiter between the &amp;quot;match&amp;quot; and &amp;quot;don't match&amp;quot; sections. The &amp;quot;match&amp;quot; and &amp;quot;don't match&amp;quot; lists can come in any order.&lt;/p&gt;&#xA;&lt;p&gt;The following special characters are not allowed in the strings: &lt;code&gt;()[]*+?.\|^$&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Note that the program must be deterministic, and the language must be revealed.&lt;/p&gt;&#xA;&lt;h3&gt;Robbers:&lt;/h3&gt;&#xA;&lt;p&gt;The robbers must pick a cop answer and submit a regex in any flavor  that matches the &amp;quot;match&amp;quot; strings but does not match the &amp;quot;don't match&amp;quot; strings.&lt;/p&gt;&#xA;&lt;p&gt;The regex must be shorter than &lt;code&gt;min(&amp;lt;length of all the match strings&amp;gt; + &amp;lt;number of match strings&amp;gt;-1 + 4, &amp;lt;length of all the don't match strings&amp;gt; + &amp;lt;number of don't match strings&amp;gt;-1 + 10)&lt;/code&gt;, as this is the length of the regex that simply hardcodes it: &lt;code&gt;^(&amp;lt;match string 1&amp;gt;|&amp;lt;match string 2&amp;gt;|...)$&lt;/code&gt; or &lt;code&gt;^(?!(&amp;lt;don't match string 1&amp;gt;|&amp;lt;don't match string 2&amp;gt;|...)$).*&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The shortest regex posted for that submission wins (note that there can and should be multiple competing cracks for one submission).&lt;/p&gt;&#xA;&lt;h2&gt;Scoring:&lt;/h2&gt;&#xA;&lt;p&gt;The robber's score is simply their number of wins (posted the shortest regex for a given submission) -- higher is better.&lt;/p&gt;&#xA;&lt;p&gt;The cop's score is &lt;code&gt;max(byte count of winning regex - byte count of submission - 4*(number of match strings - 10) for each submission)&lt;/code&gt; -- again, higher is better (you should be maximizing the length of the cracks and minimizing the length of your code). The byte count of the winning regex for an uncracked submission is the length of the hardcoded regex. Self cracks are permitted but must be marked as non-competing and will not count toward your cop or robber score.&lt;/p&gt;&#xA;&lt;p&gt;The winning cop and robber will be announced 2 weeks after the posting of this challenge. Submissions will be allowed after that, but will not count towards your score.&lt;/p&gt;&#xA;" OwnerUserId="45151" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-16T15:53:42.523" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11563" PostTypeId="2" ParentId="2140" CreationDate="2017-02-15T23:43:52.930" Score="0" Body="&lt;h1&gt;Multiplication puzzle using digits 1-9&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The puzzle is to use the digits 1-9 inclusive, exactly once, to fill in the blanks such that:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;_  _  _  _  *  3  =  _  _  _  _  _&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Your task is to create the shortest program that finds all solutions to the equation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="61906" LastActivityDate="2017-02-15T23:43:52.930" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="11565" PostTypeId="1" CreationDate="2017-02-16T09:43:25.557" Score="7" ViewCount="138" Body="&lt;p&gt;We have a consensus &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8464/41723&quot;&gt;here&lt;/a&gt; on multi-part challenges, and that they should only be allowed if there is a strong interaction between parts.&lt;/p&gt;&#xA;&lt;p&gt;Now there are challenges that ask for multiple tasks, but only ask for a single program. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/34352/operations-on-sets&quot;&gt;this one&lt;/a&gt; asks to print the union, intersection, relative complement and cartesian product of the input.&lt;/p&gt;&#xA;&lt;p&gt;This is different from the multi-part challenges as described in the first meta-post as those asked for one program per sub-challenge, whereas multi-task challenges ask for only one program.&lt;/p&gt;&#xA;&lt;p&gt;My concern is that although those multi-task challenges require only one program, being competitive in them usually boils down to:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Implementing each task independently from the other tasks&lt;/li&gt;&#xA;&lt;li&gt;Stitching all tasks into the same program, eventually grouping the output printing part, which is almost always a trivial operation.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;What should we do with those challenges?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Make no assumption about the tasks asked, and that a language might be able to take advantage of the shared code to shorten the implementation of one task using another task. Therefore those challenges are allowed.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Apply the same principles that we have with multi-part challenges, in that we only allow challenges where the tasks are strongly related to one another.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Subsequent question (might need another meta-post)&lt;/h3&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/110219/as-easy-as-a-b-c&quot;&gt;This challenge&lt;/a&gt; was closed as a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/34352/operations-on-sets&quot;&gt;this challenge&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The question is: can we close as duplicate on the basis that the challenge is a subset of something that must be done in another challenge? (For example, can we close a challenge asking to compute a*b as a duplicate of a challenge asking to compute the factorial with no built-in?).&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If multi-task challenges are not allowed anymore unless strong relations exist between tasks, then the challenge should not be a dupe and instead the second one should be closed.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If we allow multi-task challenges, the question still holds (because the implementation we do for that subset task in the second challenge might not be optimal for the first if it's implemented with the other tasks in mind) and will require another meta-post.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-16T09:43:25.557" Title="Are single-program multi-task challenges considered to be the same as multi-part challenges?" Tags="|discussion|" AnswerCount="0" CommentCount="1" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11566" PostTypeId="1" AcceptedAnswerId="11567" CreationDate="2017-02-16T10:48:09.977" Score="9" ViewCount="218" Body="&lt;p&gt;I every so often stumble upon an oldish challenge and find myself compelled to edit a lot of answers in order to make them follow the standard/new &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1200/consensus-for-formatting-of-language-and-score-line&quot;&gt;header formatting&lt;/a&gt; (## language name, bytes count).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However as I have not 1000 rep yet, all my edits are going through the review queue and so i fear i'm cluttering it for essentialy nothing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should I continue my edits, or should I let someone with enough rep stumble upon it and &quot;correct&quot; the header without having to go through review?&lt;/p&gt;&#xA;" OwnerUserId="56245" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2017-02-16T12:42:54.770" Title="Header formatting edit" Tags="|discussion|editing|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11567" PostTypeId="2" ParentId="11566" CreationDate="2017-02-16T12:42:54.770" Score="11" Body="&lt;h2&gt;It's fine&lt;/h2&gt;&#xA;&lt;p&gt;But only if you don't bump many challenges. Note challenges rather than answers, feel free to bulk update all the answers to a challenge as that effectively only bumps one challenge once. It's one thing to have an old challenge near the top but a completely different story when it's dominated by them. This is our policy when doing major tag edits when introducing tags.&lt;/p&gt;&#xA;&lt;p&gt;We rarely have anything in the review queues and when they do, they get swiftly emptied again. I doubt our system will fall to a halt if there are slightly more items in the Suggested Edits queue. An advantage to doing this is that we keep consistency across the site and that can only be a good thing.&lt;/p&gt;&#xA;&lt;p&gt;If you do go about this, see if you can improve answers in other ways such as improving any obvious spelling mistakes (though regional spellings don't count) or the grammar.&lt;/p&gt;&#xA;&lt;p&gt;In conclusion, the answer is the same if you have the editing privilege or not - don't do it in bulk.&lt;/p&gt;&#xA;" OwnerUserId="32686" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-16T12:42:54.770" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11571" PostTypeId="2" ParentId="2140" CreationDate="2017-02-16T22:24:11.040" Score="0" Body="&lt;h1&gt;Hex address to little endian escaped string&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You are a brilliant hacker and you just gained access to a unprotected computer! To complete your exploitation, you need to convert a set of hexadecimal addresses into a different format.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You remember your lessons from university and you find out the machine you're on is &lt;a href=&quot;https://en.wikipedia.org/wiki/Endianness#Little-endian&quot; rel=&quot;nofollow noreferrer&quot;&gt;little endian&lt;/a&gt;, meaning the order of the bytes is &quot;reversed&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To make a break from your illegal activity, you decide to code a little program that does that automatically.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Goal&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Convert a string of the form &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0x12345678&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;to&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;\x78\x56\x34\x12&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You set up a few tests and their potential results:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0x080483b4   =&amp;gt;   \xb4\x83\x04\x08&#xA;0x00000fff   =&amp;gt;   \xff\x0f\x00\x00&#xA;0xfffffff0   =&amp;gt;   \xf0\xff\xff\xff&#xA;0xefbeadde   =&amp;gt;   \xde\xad\xbe\xef&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The input is of the form &lt;code&gt;0xXXXXXXXX&lt;/code&gt; and the output must be of the form &lt;code&gt;\xXX\xXX\xXX\xXX&lt;/code&gt;. The input will always be 10 chars long and the output must be 16 chars long.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The score is the number of bytes used to write the encoding function.&#xA;If the input string appears in the solution (i.e. not passed as an argument) it is not taken into account. The display of the result is implied (e.g. no need to &lt;code&gt;print&lt;/code&gt;, &lt;code&gt;puts&lt;/code&gt;, ...).&lt;/p&gt;&#xA;" OwnerUserId="42825" LastEditorUserId="42825" LastEditDate="2017-02-19T16:25:35.637" LastActivityDate="2017-02-19T16:25:35.637" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11572" PostTypeId="2" ParentId="2140" CreationDate="2017-02-17T10:05:16.997" Score="1" Body="&lt;p&gt;Sandbox notes&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is the first time I write a controller; and it's been a while since I wrote an actual program. If you feel so inclined, feedback is appreciated.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Initial draft of the controller (java) here: &lt;a href=&quot;https://github.com/S119349/cooperative-koth&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://github.com/S119349/cooperative-koth&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; The Cooperation Game&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/card-game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;card-game&amp;#39;&quot; rel=&quot;tag&quot;&gt;card-game&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/java&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;java&amp;#39;&quot; rel=&quot;tag&quot;&gt;java&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenge, instead of &lt;em&gt;competing&lt;/em&gt;, players will have to &lt;strong&gt;work together&lt;/strong&gt; to beat a game. The player who on average gets the best results over all game runs, is the winner for this challenge. The game is inspired on the mechanics of &lt;a href=&quot;https://boardgamegeek.com/boardgame/173090/game&quot; rel=&quot;nofollow noreferrer&quot;&gt;&quot;The Game&quot;&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Game mechanics&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The goal of the game is to play as much cards as possible on four piles on the table. Two piles can only accept cards in strictly increasing order, the other two in strictly decreasing order. The game is over as soon as a player cannot play a card.&lt;/p&gt;&#xA;&#xA;&lt;strong&gt;Piles&lt;/strong&gt;&#xA;&#xA;&lt;p&gt;The game starts with four piles, numbered 0 through 3 inclusive. Piles &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt; accept cards in &lt;strong&gt;strictly increasing&lt;/strong&gt; order; piles &lt;code&gt;2&lt;/code&gt; and &lt;code&gt;3&lt;/code&gt; accept cards in &lt;strong&gt;strictly decreasing order&lt;/strong&gt;. Initially, the piles are&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Pile number |  0  |  1  |  2  |  3  |&#xA;       Card |  1  |  1  | 100 | 100 |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There is an exception to the rule of accepting only strictly increasing/decreasing order. You are allowed to play a card &lt;strong&gt;exactly 10 less or more&lt;/strong&gt; respectively than the current card. For example, if the piles are&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Pile number |  0  |  1  |  2  |  3  |&#xA;       Card |  1  |  32 |  78 | 100 |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;you are allowed to play &lt;code&gt;22&lt;/code&gt; on pile &lt;code&gt;1&lt;/code&gt;, or &lt;code&gt;88&lt;/code&gt; on pile &lt;code&gt;2&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;strong&gt;Taking turns&lt;/strong&gt;&#xA;&#xA;&lt;p&gt;The game starts with a shuffled draw stack containing 98 cards, numbered 2 through 99 inclusively. Each player is dealt 6 cards at the start of the game. The cards are known only to the players themselves. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;During a turn, a player must play &lt;strong&gt;at least two cards&lt;/strong&gt; &lt;sup&gt;Exception: you only have one card, or you're out of cards, because the draw stack is empty&lt;/sup&gt;, up to all the cards in their hand. After their turn, the player will restock from the draw stack to 6 cards (or less at the end of the game).&lt;/p&gt;&#xA;&#xA;&lt;strong&gt;Reacting&lt;/strong&gt;&#xA;&#xA;&lt;p&gt;After each card is played, other players are allowed to react: if you have the &lt;em&gt;perfect&lt;/em&gt; card in your hand, you may want to warn players not to add anything to that pile! Since your cards are secret to you, this is done by assigning &lt;strong&gt;priorities&lt;/strong&gt; to each pile. The priority is from &lt;code&gt;0&lt;/code&gt; to &lt;code&gt;5&lt;/code&gt; inclusive, with &lt;code&gt;0&lt;/code&gt; signifying no interest at all in that particular pile, and &lt;code&gt;5&lt;/code&gt; begging other players not to add anything to that pile. Other players can use these priorities as they deem fit; including completely ignoring it.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Interaction with the controller&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You will create a player that &lt;code&gt;extends&lt;/code&gt; the &lt;code&gt;abstract Player&lt;/code&gt; class. You will have to implement &lt;code&gt;void turn()&lt;/code&gt; (for playing a card) and &lt;code&gt;int[] react()&lt;/code&gt; (for announcing your priorities). A reference implementation, &lt;code&gt;SimpleTom&lt;/code&gt;, is provided, but may be removed from the competition if there are enough competitors.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In &lt;code&gt;void turn()&lt;/code&gt;, you are required to either &lt;code&gt;playCard(int card, int pile)&lt;/code&gt; or &lt;code&gt;endTurn()&lt;/code&gt;. Note that you may only play &lt;strong&gt;one&lt;/strong&gt; card per invocation of &lt;code&gt;turn()&lt;/code&gt;, to give other players an opportunity to &lt;code&gt;react()&lt;/code&gt;. Doing anything else (playing two cards, playing no cards at all) will result in losing the game, with all the cards still in the game adding towards each player's score!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In &lt;code&gt;int[] react()&lt;/code&gt;, you are required to return an array of your priorities on each pile. An example would be &lt;code&gt;return new int[] {a, b, c, d}&lt;/code&gt; with &lt;code&gt;a&lt;/code&gt; through &lt;code&gt;d&lt;/code&gt; the priorities for each pile. Here, &lt;code&gt;0 &amp;lt;= a &amp;lt;= 5&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;To see what is happening, you have access to some members&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;ArrayList&amp;lt;Integer&amp;gt; hand&lt;/code&gt; contains all cards currently in your hand.&lt;/li&gt;&#xA;&lt;li&gt;In the &lt;code&gt;gameState&lt;/code&gt; member of the default &lt;code&gt;Player&lt;/code&gt; class:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;int [] gameState.piles&lt;/code&gt; contains the four piles. It is an integer array of size 4, with each element the last played card on that pile.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Map&amp;lt;Player, int[]&amp;gt; gameState.priorities&lt;/code&gt;. A map containing the latest priorities issued by each &lt;code&gt;Player&lt;/code&gt; in the game.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Player[] gqameState.players&lt;/code&gt; can be used to list all the players in the current game; as well as determine how many cards they have by calling &lt;code&gt;int nHandCards()&lt;/code&gt;. Note however that you may &lt;strong&gt;not&lt;/strong&gt; access these &lt;code&gt;players&lt;/code&gt; in any other way! (force them to do a turn, force them to lose, make them expose their hand, etc).&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Concerning the other players: you &lt;strong&gt;may&lt;/strong&gt; know who is playing and assess their skill during a game (for example, figure halfway through a game that &lt;code&gt;SimpleTom&lt;/code&gt; is not trustworthy, and that two of the other players are of type &lt;code&gt;SimpleTom&lt;/code&gt;). You &lt;strong&gt;may not&lt;/strong&gt; save this information between games, or hard-code strategies concerning other players. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Do's and don'ts&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;All entries are open-source. You are encouraged to write commonly used functions (e.g., something to keep track of what cards have already been played) as separate functions, so others may use them. When you use code from others, &lt;strong&gt;always attribute your source&lt;/strong&gt;. It is &lt;strong&gt;not&lt;/strong&gt; OK to copy someone's algorithm and just tweak a few values - your code should be significantly different from others.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are allowed to use a different languages than Java, if you write your own wrapper class (or use someone else's wrapper class). I usually only use Try it Online!, so I don't have any compilers installed on my Ubuntu box. If you use another language that is not available on Ubuntu by default, please include a few lines on how to install your language. Your entry will be non-competing if it takes me more than two minutes to follow these instructions, so a script or copy-pasteable command line code is preferred.&lt;/p&gt;&#xA;" OwnerUserId="32352" LastEditorUserId="32352" LastEditDate="2017-02-17T16:38:09.930" LastActivityDate="2017-02-17T16:38:09.930" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="11574" PostTypeId="2" ParentId="11553" CreationDate="2017-02-17T11:53:36.053" Score="3" Body="&lt;p&gt;Thanks for the clarity, I was going to ask the same question about Sinclair ZX81 entries - this is the most interesting language to me for code-golf as it's one of the most - if not the most - difficult to minimize and obfuscate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To get the exact byte count on a Commodore 64, run your program and break into it with RUN/STOP, and then type:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;print 38911-(fre(0)-65536*(fre(0)&amp;lt;0)) &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;On a VIC-20 or Commodore 128, &lt;code&gt;print fre(0)&lt;/code&gt; will work fine. I assume this is the same for the Plus/4 and C16 but I don't know.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To calculate the amount of RAMs used on a ZX81/Timex TS1000/1500, try&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;PRINT (PEEK 16386+256*PEEK 16387) - (PEEK 16412+256*PEEK 16413)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that you can save bytes by making lines longer on the ZX81, so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;10 LET A=VAL &quot;10&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;costs less memory (from what I remember) than&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;10 LET A=10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;but the memory-efficient line takes more t-states than the latter. So in order to code-golf properly on the ZX81 I actually need to add in more BASIC keywords in some situations.&lt;/p&gt;&#xA;" OwnerUserId="61603" LastActivityDate="2017-02-17T11:53:36.053" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11578" PostTypeId="1" AcceptedAnswerId="11581" CreationDate="2017-02-17T16:51:18.953" Score="-2" ViewCount="104" Body="&lt;p&gt;In several different questions some people answer with keystrokes. Will a official stance be taken on this? Some users say that it is not OK others disagree. What should be done about this?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/107874/shut-down-the-computer/108567?noredirect=1#comment268929_108567&quot;&gt;Here is an example, for clarification.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2017-02-17T17:09:32.017" Title="Is there going to be an official stance of using keystrokes to answer?" Tags="|discussion|" AnswerCount="3" CommentCount="1" ClosedDate="2017-02-17T18:04:03.453" ContentLicense="CC BY-SA 3.0" />
  <row Id="11579" PostTypeId="2" ParentId="11578" CreationDate="2017-02-17T16:59:39.693" Score="0" Body="&lt;h2&gt;Yes, but no special treatment.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This means that (for example) if your solution displays a pop-up box saying &quot;Are you sure that you want to delete this file?&quot; and the challenge asks for deletion without output, your solution will be invalid. It also means that if three files, a folder and a symbolic link are required for your solution to run it's not valid for challenges where this won't be the case.&lt;/p&gt;&#xA;" OwnerUserId="43394" LastActivityDate="2017-02-17T16:59:39.693" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11580" PostTypeId="2" ParentId="11578" CreationDate="2017-02-17T17:07:24.770" Score="1" Body="&lt;h2&gt;No, unless a programming language is used.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are several programming languages that can be used to encapsulate keyboard input. VBA is one, and &lt;a href=&quot;//github.com/hak5darren/USB-Rubber-Ducky/wiki/Duckyscript&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ducky Script&lt;/a&gt; is another. Solutions written in these languages can be compared objectively to solutions written in other languages, whilst retaining the skill of finding key combinations. In addition, Ducky Script programs can be deployed on an actual USB &quot;keyboard&quot;.&lt;/p&gt;&#xA;" OwnerUserId="43394" LastActivityDate="2017-02-17T17:07:24.770" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11581" PostTypeId="2" ParentId="11578" CreationDate="2017-02-17T17:09:32.017" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/46271&quot;&gt;What is a programming language?&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A purported programming language should be accepted as such if and only if it is capable of addition of natural numbers and primality testing of natural numbers.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If it can add and check for primality, then it's okay.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can Windows add with keystrokes? &lt;kbd&gt;Win&lt;/kbd&gt;+&lt;kbd&gt;R&lt;/kbd&gt; and type &quot;calc&quot;. Then type the expression. It can do all arithmetic like that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can Windows check for primes? Theoretically, yes. The windows calculator is capable of binary arithmetic, and it has both AND and NOT. An infinite string of them is turing complete, and we don't have any limits on how long a submission can be.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, Windows keystrokes is programming language, if only in the sense that's it's capable of utilizing a turing complete shell (the calculator).&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2017-02-17T17:09:32.017" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11582" PostTypeId="2" ParentId="8350" CreationDate="2017-02-17T18:51:25.307" Score="21" Body="&lt;h2&gt;Allow answers to be tagged, just like questions are&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Unlike most sites, where questions are fairly specific, questions on PPCG are highly general; when we ask a question, we're really asking a range of related questions (&quot;write a short Jelly program to do X&quot;, &quot;write a short Python program to do X&quot;, etc.). As such, we get a range of different answers, and many of those answers need to be treated differently.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It makes sense that we could have a tag badge for answering questions in, say, Perl or Brachylog. The problem is, the site is looking for a tag on the &lt;em&gt;question&lt;/em&gt; (because the answers don't have tags), and the question obviously won't have a tag specifying the language the answers are in. Allowing tags on answers to count towards the tag badge, in addition to tags on the corresponding question, would make sense. (On a side note, the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; tag isn't functioning anything like SE likely intended, because the tag is on almost every question; I'm not convinced that this is a problem, but it's likely at least worth being aware of.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are other tags, separate from language tags, that I can potentially see on answers. (For example, Anarchy Golf, another golfing site, makes heavy use of a &quot;cheat&quot; tag which is used to identify answers which meet the letter of the specification but not the spirit; cheating at golf is something of a genre of its own. Over here we let the genuine answers stand, and argue over whether the cheating answers count, but always count them as part of the same competition; answer tags might help solve this problem). Likewise, a tag could indicate the sort of algorithm that was used (e.g. recursion, or brute-force). These are all tools that are useful when searching for answers with particular topics, and for seeing what kind of answers people normally give.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This would also help with automatic syntax highlighting (at present, syntax highlighting is something that has to be added manually in a fairly tedious way, because we don't have language tags to suggest highlighting rules like other languages do).&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-02-17T18:51:25.307" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11583" PostTypeId="1" CreationDate="2017-02-17T19:51:55.477" Score="2" ViewCount="131" Body="&lt;p&gt;To keep a concise title I have left out a few details, but here is the dilemma:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have a &lt;a href=&quot;https://codegolf.stackexchange.com/a/109953/56656&quot;&gt;cops post&lt;/a&gt; that has not yet been cracked.  I would like to reward the first person to figure out my solution but there are very few combinations to be checked and it is almost certain that the first person to crack it will do so by brute force.  In order to not reward the person with the best computer I would like to give a substantial bounty to the first person to provide me a proof that their crack indeed works. (Even with the answer at hand this is not an easy task)  However if they are not the first person to crack the submission they cannot make an answer on the robber's thread for me to reward.  In the end I don't really care how the robber got the answer as long as I know that they understand how it works.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One thought I had was that I might be able to mark my answer safe and reveal the program (if the period expires without it being cracked) and reverse its safe status when presented with a proof (via chat or comments) so that the robber could &quot;crack&quot; it.  But this might not be considered fair by the community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there any good way for me solve this dilemma?  &lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2017-02-17T21:54:28.007" Title="How might I reward a Robber for an especially good crack?" Tags="|discussion|answers|bounty|cops-and-robbers|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11584" PostTypeId="2" ParentId="11583" CreationDate="2017-02-17T21:54:28.007" Score="2" Body="&lt;p&gt;You could add an answer to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5243/list-of-bounties-with-no-deadline&quot;&gt;List of bounties with no deadline&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Upon receiving a crack with a proof that satisfies what you're looking for, you could then post the bounty to award the answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, I don't have a definite answer for what to do if it's cracked without a proof first. If that happens, it's possible that someone could take that crack and add a proof, but it's up to you to decide whether to keep the indefinite bounty alive and award it later, or to remove it. I'd say mark the answer as safe, but with a comment and a link to your bounty asking for a proof. Upon receiving that second answer, create and award the bounty after 7 days.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2017-02-17T21:54:28.007" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11585" PostTypeId="2" ParentId="2140" CreationDate="2017-02-18T01:56:17.223" Score="-3" Body="&lt;h1&gt;Make a Simple GUI application&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I have made a simple glade layout. The chalenge is to remake it in as few bytes as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The glade file:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&amp;gt;&#xD;&#xA;&amp;lt;!-- Generated with glade 3.20.0 --&amp;gt;&#xD;&#xA;&amp;lt;interface&amp;gt;&#xD;&#xA;  &amp;lt;requires lib=&quot;gtk+&quot; version=&quot;3.20&quot;/&amp;gt;&#xD;&#xA;  &amp;lt;object class=&quot;GtkApplicationWindow&quot;&amp;gt;&#xD;&#xA;    &amp;lt;property name=&quot;can_focus&quot;&amp;gt;False&amp;lt;/property&amp;gt;&#xD;&#xA;    &amp;lt;property name=&quot;title&quot; translatable=&quot;yes&quot;&amp;gt;Remake me!&amp;lt;/property&amp;gt;&#xD;&#xA;    &amp;lt;child&amp;gt;&#xD;&#xA;      &amp;lt;object class=&quot;GtkBox&quot;&amp;gt;&#xD;&#xA;        &amp;lt;property name=&quot;visible&quot;&amp;gt;True&amp;lt;/property&amp;gt;&#xD;&#xA;        &amp;lt;property name=&quot;can_focus&quot;&amp;gt;False&amp;lt;/property&amp;gt;&#xD;&#xA;        &amp;lt;property name=&quot;orientation&quot;&amp;gt;vertical&amp;lt;/property&amp;gt;&#xD;&#xA;        &amp;lt;child&amp;gt;&#xD;&#xA;          &amp;lt;object class=&quot;GtkButton&quot;&amp;gt;&#xD;&#xA;            &amp;lt;property name=&quot;label&quot; translatable=&quot;yes&quot;&amp;gt;hello&amp;lt;/property&amp;gt;&#xD;&#xA;            &amp;lt;property name=&quot;visible&quot;&amp;gt;True&amp;lt;/property&amp;gt;&#xD;&#xA;            &amp;lt;property name=&quot;can_focus&quot;&amp;gt;True&amp;lt;/property&amp;gt;&#xD;&#xA;            &amp;lt;property name=&quot;receives_default&quot;&amp;gt;True&amp;lt;/property&amp;gt;&#xD;&#xA;          &amp;lt;/object&amp;gt;&#xD;&#xA;          &amp;lt;packing&amp;gt;&#xD;&#xA;            &amp;lt;property name=&quot;expand&quot;&amp;gt;False&amp;lt;/property&amp;gt;&#xD;&#xA;            &amp;lt;property name=&quot;fill&quot;&amp;gt;True&amp;lt;/property&amp;gt;&#xD;&#xA;            &amp;lt;property name=&quot;position&quot;&amp;gt;0&amp;lt;/property&amp;gt;&#xD;&#xA;          &amp;lt;/packing&amp;gt;&#xD;&#xA;        &amp;lt;/child&amp;gt;&#xD;&#xA;        &amp;lt;child&amp;gt;&#xD;&#xA;          &amp;lt;object class=&quot;GtkLabel&quot;&amp;gt;&#xD;&#xA;            &amp;lt;property name=&quot;visible&quot;&amp;gt;True&amp;lt;/property&amp;gt;&#xD;&#xA;            &amp;lt;property name=&quot;can_focus&quot;&amp;gt;False&amp;lt;/property&amp;gt;&#xD;&#xA;            &amp;lt;property name=&quot;label&quot; translatable=&quot;yes&quot;&amp;gt;world&amp;lt;/property&amp;gt;&#xD;&#xA;          &amp;lt;/object&amp;gt;&#xD;&#xA;          &amp;lt;packing&amp;gt;&#xD;&#xA;            &amp;lt;property name=&quot;expand&quot;&amp;gt;False&amp;lt;/property&amp;gt;&#xD;&#xA;            &amp;lt;property name=&quot;fill&quot;&amp;gt;True&amp;lt;/property&amp;gt;&#xD;&#xA;            &amp;lt;property name=&quot;position&quot;&amp;gt;1&amp;lt;/property&amp;gt;&#xD;&#xA;          &amp;lt;/packing&amp;gt;&#xD;&#xA;        &amp;lt;/child&amp;gt;&#xD;&#xA;      &amp;lt;/object&amp;gt;&#xD;&#xA;    &amp;lt;/child&amp;gt;&#xD;&#xA;    &amp;lt;child&amp;gt;&#xD;&#xA;      &amp;lt;placeholder/&amp;gt;&#xD;&#xA;    &amp;lt;/child&amp;gt;&#xD;&#xA;  &amp;lt;/object&amp;gt;&#xD;&#xA;&amp;lt;/interface&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="65638" LastActivityDate="2017-02-18T01:56:17.223" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11586" PostTypeId="1" AcceptedAnswerId="11588" CreationDate="2017-02-18T06:28:48.523" Score="-1" ViewCount="113" Body="&lt;p&gt;I'm new to this site, and I see that it is called &quot;Programming Puzzles &amp;amp; Code Golf&quot;, and that its url is &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;https://codegolf.stackexchange.com/&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I look at the front page of questions, I see that almost all of them have a tag called &quot;code-golf&quot;: &lt;a href=&quot;https://i.stack.imgur.com/QOlh9.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://i.stack.imgur.com/QOlh9.jpg&lt;/a&gt; (I'm not including the image inline here, because it's rather long).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Looking through the history, it is awfully hard to find questions that are not tagged code-golf, and are still open / have positive votes. But after figuring out &lt;a href=&quot;https://codegolf.stackexchange.com/search?tab=newest&amp;amp;q=is%3aquestion%20-%5bcode-golf%5d%20closed%3ano&quot;&gt;the search syntax&lt;/a&gt;, I find that the following are the ones asked in 2017:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/108536/kolmogorov-complexity-meta-golfer&quot;&gt;Kolmogorov Complexity Meta Golfer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/108075/oop-overlapping-oriented-programming&quot;&gt;Q: OOP: Overlapping Oriented Programming&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/108044/find-the-shortest-golomb-rulers&quot;&gt;Find the shortest Golomb rulers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/108006/fastest-home-prime-generator&quot;&gt;Fastest Home Prime Generator&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/107944/output-a-program-that-outputs-a-program-that-outputs-ppcg&quot;&gt;Output a program that outputs a program … that outputs PPCG&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/107814/total-derangement-difficulty-level-hard&quot;&gt;Total Derangement (Difficulty Level: Hard)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/107812/the-tax-historian&quot;&gt;The Tax Historian&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/107690/count-spelling-errors-in-text-minimize-the-number-of-spelling-errors-in-your-co&quot;&gt;Count spelling errors in text; minimize the number of spelling errors in your code&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/107322/do-you-know-that-language&quot;&gt;Do you know that language?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/107209/display-oeis-sequences&quot;&gt;Display OEIS sequences&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/107193/exit-code-golfing&quot;&gt;Exit Code Golfing&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/107012/hidden-inversions-cops-thread&quot;&gt;Hidden Inversions (Cops' Thread)&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/107014/hidden-inversions-robbers-thread&quot;&gt;Hidden Inversions (Robbers' Thread)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/107000/split-arrays-and-programs-in-half&quot;&gt;Split arrays and programs in half&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/106514/python-workarounds-for-assignment-in-lambda&quot;&gt;Python workarounds for assignment in lambda&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/106279/sharing-characters-is-caring&quot;&gt;Sharing (characters) is Caring!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/105991/combinatory-conundrum&quot;&gt;Combinatory Conundrum!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/105558/2016-time-capsule-string-climb-the-integer-ladder&quot;&gt;2016 Time Capsule String: Climb The Integer Ladder&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/105398/2016-time-capsule-string-how-versatile-is-your-language&quot;&gt;2016 Time Capsule String: How Versatile Is Your Language?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Many of these questions are highly voted, though some have very few answers. Some are related to code-golf (like the Python tips question), but some are not. And I really enjoy the questions that are not code-golf.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Which brings me to my question: given that most questions on this site are code-golf, would it help to have a tag for questions that are &lt;em&gt;not&lt;/em&gt; code-golf, so that they can be easier to find? (Of course in the process of asking the question I figured out a &lt;a href=&quot;https://codegolf.stackexchange.com/search?tab=newest&amp;amp;q=is%3aquestion%20-%5bcode-golf%5d%20closed%3ano&quot;&gt;search query&lt;/a&gt; that I can use personally, but I wonder if there are other people who might be interested in such questions.)&lt;/p&gt;&#xA;" OwnerUserId="3845" LastEditorUserId="3845" LastEditDate="2017-02-21T06:39:57.960" LastActivityDate="2017-02-21T06:39:57.960" Title="Tagging programming puzzles that are not code-golf?" Tags="|discussion|tags|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11588" PostTypeId="2" ParentId="11586" CreationDate="2017-02-18T11:04:29.510" Score="8" Body="&lt;p&gt;No, such a tag would not be useful. Tags describe what challenges &lt;em&gt;are&lt;/em&gt;, not what they &lt;em&gt;are not&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code golf challenges are the most popular type of challenge on this site, so it can be hard to find challenges that aren't code golf. You can use &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/908/45941&quot;&gt;this list of tags&lt;/a&gt; to find challenges with other winning criteria.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2017-02-18T11:04:29.510" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11589" PostTypeId="1" AcceptedAnswerId="11590" CreationDate="2017-02-18T13:05:57.117" Score="2" ViewCount="61" Body="&lt;p&gt;Is there an easy way to find if I already answered to a specific question? This extrapolation of the Stackoverflow format to a code golf site sometimes seems very inadequate!&lt;/p&gt;&#xA;" OwnerUserId="29325" LastActivityDate="2017-02-18T17:30:37.733" Title="Easy way to find if I already answered" Tags="|support|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11590" PostTypeId="2" ParentId="11589" CreationDate="2017-02-18T13:21:46.123" Score="5" Body="&lt;p&gt;You can search for&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;user:me inquestion:???&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;???&lt;/code&gt; is the question ID you'll find in the URL of the question. This works on all SEs.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2017-02-18T13:21:46.123" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11591" PostTypeId="2" ParentId="11586" CreationDate="2017-02-18T15:14:06.713" Score="2" Body="&lt;h1&gt;No, adding &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/not-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;not-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;not-code-golf&lt;/a&gt; would have no use&lt;/h1&gt;&#xA;&lt;p&gt;You can already search for things that are not tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; with &lt;code&gt;-[code-golf]&lt;/code&gt;.  So there would no help people who are searching for them.  In addition it would add an extra tag to pretty much every &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, etc. challenge. This would knock tags off of questions that are already at the tag limit.  This would overall make it &lt;em&gt;harder&lt;/em&gt; for users to find challenges they like that are not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-18T15:14:06.713" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11592" PostTypeId="2" ParentId="11589" CreationDate="2017-02-18T17:30:37.733" Score="3" Body="&lt;p&gt;Using search works well and is useful for a number of things (e.g., finding all answers in language X to a specific question), but since golf is all about minimizing strokes, here's another way.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;First, make sure you've enabled &lt;a href=&quot;https://meta.stackexchange.com/q/237166/170332&quot;&gt;keyboard shortcuts&lt;/a&gt;. You can do this by going to your &lt;a href=&quot;https://codegolf.stackexchange.com/users/preferences/&quot;&gt;Preferences&lt;/a&gt; and checking &lt;em&gt;Enable keyboard shortcuts&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Check that you're not focusing any text area or input field.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Press &lt;kbd&gt;A&lt;/kbd&gt;. This will focus the answer field if you haven't answered the question yet, but display a popup asking &lt;em&gt;Are you sure you want to add another answer?&lt;/em&gt; if you have.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Naturally, this doesn't work for closed/locked questions.&lt;/p&gt;&#xA;&lt;p&gt;If keyboard shortcuts aren't available for some reason, you can still scroll to the bottom of the page to check is there is a &lt;em&gt;Post Your Answer&lt;/em&gt; button or an &lt;em&gt;Add Another Answer&lt;/em&gt; button. In most browsers, you achieve this by pressing &lt;kbd&gt;End&lt;/kbd&gt;.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-18T17:30:37.733" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11594" PostTypeId="5" CreationDate="2017-02-18T22:24:04.137" Score="0" Body="&lt;p&gt;One of the close vote reasons on CGCC, is to close the question as a duplicate of another question (thus linking the questions together and preventing answers to the question). This tag is for questions about this mechanism, both about when it should be used and about how it works.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="56656" LastEditorDisplayName="user62131" LastEditDate="2020-02-03T17:14:14.570" LastActivityDate="2020-02-03T17:14:14.570" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="11595" PostTypeId="4" CreationDate="2017-02-18T22:24:04.137" Score="0" Body="Questions about the &quot;close as duplicate&quot; mechanism." OwnerDisplayName="user62131" LastEditorDisplayName="user62131" LastEditDate="2017-02-18T22:24:04.137" LastActivityDate="2017-02-18T22:24:04.137" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11596" PostTypeId="1" AcceptedAnswerId="11600" CreationDate="2017-02-18T22:25:15.117" Score="4" ViewCount="267" Body="&lt;p&gt;I recently came across &lt;a href=&quot;https://codegolf.stackexchange.com/q/1798/62131&quot;&gt;this question&lt;/a&gt;, which is (rightfully) closed as having no victory condition. Most of the existing answers don't aim for any particular goal other than answering the question, so reopening the question as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; would be a bad idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, it's a question that's fairly obvious to ask &lt;em&gt;with&lt;/em&gt; a victory condition. Someone tried a while back, asking &lt;a href=&quot;https://codegolf.stackexchange.com/q/19594/62131&quot;&gt;this&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;. It was almost immediately closed as a duplicate. As such, there's currently nowhere you can go to post answers to the question in question (and it's a fairly obvious question, given how many variants on it have been posted).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question here is partially about those posts, but mostly about the general case. If a question receives answers, and is rightfully closed for not having an objective victory criterion, should we allow the question to be reposted, specifying a victory criterion, without closing the reposts as duplicates?&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2017-02-19T13:40:40.683" Title="If a question is closed due to no objective victory criterion, and has many answers already, should duplicates of it be allowed?" Tags="|discussion|duplicates|winning-criteria|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11597" PostTypeId="1" AcceptedAnswerId="11598" CreationDate="2017-02-18T22:48:53.613" Score="3" ViewCount="330" Body="&lt;p&gt;I'm not sure if &lt;a href=&quot;https://codegolf.stackexchange.com/questions/110485/leak-memory-in-as-few-bytes-as-possible&quot;&gt;this&lt;/a&gt; counts as writing malicious code. What does the community think?&lt;/p&gt;&#xA;" OwnerUserId="48922" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.143" LastActivityDate="2017-02-19T00:39:40.527" Title="Borderline malicious code?" Tags="|discussion|specific-question|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11598" PostTypeId="2" ParentId="11597" CreationDate="2017-02-19T00:39:40.527" Score="13" Body="&lt;h1&gt;A small, finite memory leak is not malicious&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Using up &lt;em&gt;all&lt;/em&gt; a computer's memory is a denial of service attack, and thus arguably malicious (although it's something that's easily done by mistake and easily done intentionally, and also has many existing safeguards against it, so PPCG wouldn't really be helping any malware authors there). But that's &lt;a href=&quot;https://codegolf.stackexchange.com/q/101709/62131&quot;&gt;this question&lt;/a&gt;, which is a different question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Wasting &lt;em&gt;a small amount&lt;/em&gt; of a computer's memory in a way that can't be recovered until the program ends is, on most operating systems, entirely harmless, and something that nonmalicious programs do all the time intentionally. (After all, keeping the memory allocated but nonleaked has exactly the same effect on other processes.) It would be potentially problematic on operating systems like DOS, in which a memory leak makes the memory unusable until the system is rebooted (!), but those systems are in the minority nowadays (and DOS users are likely used to rebooting fairly often anyway).&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2017-02-19T00:39:40.527" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11600" PostTypeId="2" ParentId="11596" CreationDate="2017-02-19T13:40:40.683" Score="6" Body="&lt;p&gt;If a challenge is closed as off-topic, it shouldn't be used as a dupe target. Thus, making an on-topic version of the challenge is perfectly acceptable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11596/if-a-question-is-closed-due-to-no-objective-victory-criterion-and-has-many-answ#comment38547_11596&quot;&gt;ETHproductions pointed out&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;In this specific case, it's also important to note that the old challenge was on-topic when it was posted, and closed as off-topic more than a year after the supposed dupe was posted/closed.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;When the second challenge was posted, the original hadn't been closed as off-topic yet, so it was a valid dupe target. Now that it has been closed, feel free to post a rewrite of it with an objective winning criteria, so long as it meets our current standards (which are much higher than when the original challenge was posted).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2017-02-19T13:40:40.683" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11601" PostTypeId="2" ParentId="2140" CreationDate="2017-02-19T20:07:08.010" Score="1" Body="&lt;h1&gt;Implement Fizz Buzz in the C Preprocessor without the use if &lt;code&gt;#if&lt;/code&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; I understand that there is already a question for Fizz Buzz and the preferred method is to place a bounty on an existing question instead of asking a new one. However, I believe that this warrants its own question.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://stackoverflow.com/a/10540654/1459669&quot;&gt;The C Preprocessor Language is Turing Complete when used in a loop.&lt;/a&gt; Your task is to implement Fizz Buzz up to and including a given integer without the use if &lt;code&gt;#if&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must be able to implement Fizz Buzz for inputs from 6 to 100. You can support more if you wish, but it is not required.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;#define INPUT &amp;lt;input&amp;gt;&lt;/code&gt; will be placed at the top of the file to provide input. This is not included in your bytecount.&lt;/li&gt;&#xA;&lt;li&gt;The output is defined as the output of &lt;code&gt;cpp&lt;/code&gt; compilation with all lines beginning with &lt;code&gt;#&lt;/code&gt; stripped away fed back into &lt;code&gt;cpp&lt;/code&gt; for as many times as needed until the results of two steps are identical.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must be able to prove this takes a finite amount of steps.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Specify the version of the C Preprocessor Standard to use.&lt;/li&gt;&#xA;&lt;li&gt;No custom compiler flags.&lt;/li&gt;&#xA;&lt;li&gt;No using compiler extensions.&lt;/li&gt;&#xA;&lt;li&gt;You can delimit items with the delimiter of your choice.&lt;/li&gt;&#xA;&lt;li&gt;There can be extra delimiters at the start.&lt;/li&gt;&#xA;&lt;li&gt;Trailing newlines are allowed.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;code&gt;#if&lt;/code&gt; is not allowed!&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;It must be exactly &lt;code&gt;Fizz&lt;/code&gt;, &lt;code&gt;Buzz&lt;/code&gt;, and &lt;code&gt;FizzBuzz&lt;/code&gt;. Case sensitive.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;A submission might look like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#define MAIN(...) \ &#xA;  // ... &#xA;MAIN(INPUT)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It will be compiled as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#define INPUT &amp;lt;input&amp;gt;&#xA;#define MAIN(...) \ &#xA;   // ... &#xA;MAIN(INPUT)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;...using the command &lt;code&gt;cpp filename&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Steps for getting output:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;cp file file2&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cp file2 file&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cpp file &amp;gt; file2&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Remove all lines beginning with &lt;code&gt;#&lt;/code&gt; in file 2.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;file2&lt;/code&gt; is identical to &lt;code&gt;file&lt;/code&gt;, exit. The current &lt;code&gt;file2&lt;/code&gt; is defined as the output.&lt;/li&gt;&#xA;&lt;li&gt;Repeat steps 2-5 until exit.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Multiple outputs for a single input indicates all are valid&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;6 -&amp;gt; 1, 2, Fizz, 4, Buzz, Fizz&#xA;6 -&amp;gt; 1, 2, Fizz, 4, Buzz, Fizz, &#xA;6 -&amp;gt; , 1, 2, Fizz, 4, Buzz, Fizz&#xA;6 -&amp;gt; , 1, 2, Fizz, 4, Buzz, Fizz, &#xA;15 -&amp;gt; 1, 2, Fizz, 4, Buzz, Fizz, 7, 8, Fizz, Buzz, 11, Fizz, 13, 14, Fizz Buzz,&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="41088" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2017-02-19T21:43:50.783" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11602" PostTypeId="2" ParentId="11541" CreationDate="2017-02-19T21:23:36.547" Score="23" Body="&lt;h1&gt;The website wolframalpha.com should not be treated as a language&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.wolframalpha.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;wolframalpha.com&lt;/a&gt; is not a language, it's a website &lt;strong&gt;powered by the Wolfram Language.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Some of the arguments for this is already brought up in the question, but I'll try to elaborate and bring in a few more reasons (some are borrowed from Peter Taylor and Martin Ender's comments on the other answer).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;There are (almost) always more than one output:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Plot a sine wave from -6 to 6: &lt;code&gt;sin&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Plot a sine wave from -26.4 to 26.4: &lt;code&gt;sin&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Series expansion, derivative, integral: &lt;code&gt;sin&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;How should you choose which one is &lt;em&gt;the result&lt;/em&gt;? The first &amp;quot;result&amp;quot; is always the interpretation of the input, so that doesn't make much sense. Always pick the second result? We &lt;strong&gt;can not&lt;/strong&gt; allow this to be arbitrary, since that would open up for a bunch of loopholes (&lt;em&gt;&amp;quot;disregard all outputs from this function except output number 23&amp;quot;&lt;/em&gt;).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;There is no version control&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Quoting Peter Taylor:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The only interpreter is subject to arbitrary changes and doesn't provide any kind of version number, so there's no guarantee that answers can be verified &lt;s&gt;in six months time&lt;/s&gt; tomorrow, and there's no way to be sure when answering &lt;s&gt;an old&lt;/s&gt; a question that you're not using functionality which has been added since the question was asked. (It might have been added 30 minutes ago)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;It's using the internet&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Exceptions can be made here, but it's opening up for a lot of loopholes. What's preventing me from solving something in google. &lt;a href=&quot;https://www.google.no/webhp?sourceid=chrome-instant&amp;amp;ion=1&amp;amp;espv=2&amp;amp;ie=UTF-8#q=heartcurve&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;heartcurve&lt;/code&gt;&lt;/a&gt; gives us the curve (along with a bunch of other stuff).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;How can you tell if your query is solved using the Wolfram Language, or it's just acting as a regular browser?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Curious about &lt;a href=&quot;http://www.wolframalpha.com/input/?i=nyse&quot; rel=&quot;nofollow noreferrer&quot;&gt;stocks on the New York Stock Exchange&lt;/a&gt;, the &lt;a href=&quot;http://www.wolframalpha.com/input/?i=weather&quot; rel=&quot;nofollow noreferrer&quot;&gt;weather&lt;/a&gt; where you are right now? This can't possibly be solved without accessing outside sources. How much else is solved using outside sources (a disallowed loophole)?&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This argument was brought up in a comment:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Actually, you can make W|A queries with a single, concrete result. In Mathematica, enter &lt;code&gt;Free-form Input&lt;/code&gt; mode with &lt;code&gt;=&lt;/code&gt;. It will lookup your query with W|A and return a single result. On the other hand, this can be argued to just be the Wolfram Language with &lt;code&gt;=&lt;/code&gt; prepended to whatever your query was.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;As far as I can tell, that would be Mathematica with access to online resources. I'd claim the language is Mathematica, and it's using a forbidden loophole by fetching results from online resources.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Also, I'm not sure how this relates to this, but as far as I know, you can't give input to a function/script/query on wolframalpha.com, it's only good for fixed output challenges.&lt;/p&gt;&#xA;" OwnerUserId="31516" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-21T09:59:18.433" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11605" PostTypeId="1" AcceptedAnswerId="11606" CreationDate="2017-02-20T14:23:12.947" Score="2" ViewCount="113" Body="&lt;p&gt;I've seen people use &lt;code&gt;#&lt;/code&gt; (h1) and &lt;code&gt;##&lt;/code&gt; (h2) on the language name and program size in their answers, but is one of them considered better? &lt;/p&gt;&#xA;" OwnerUserId="64538" LastActivityDate="2017-02-20T19:18:13.223" Title="# or ## for language name/program size" Tags="|support|" AnswerCount="2" CommentCount="2" ClosedDate="2017-02-22T03:41:43.020" ContentLicense="CC BY-SA 3.0" />
  <row Id="11606" PostTypeId="2" ParentId="11605" CreationDate="2017-02-20T14:39:27.297" Score="8" Body="&lt;p&gt;Back in the day, HTML style guides told you to use only one &lt;code&gt;&amp;lt;h1&amp;gt;&lt;/code&gt; in a page. Given the semantics of a StackExchange page, that should be the question title. Therefore we old fogies consider &lt;code&gt;##&lt;/code&gt; better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Nowadays some people consider that advice antiquated. I leave it to them to say whether they consider &lt;code&gt;#&lt;/code&gt; and &lt;code&gt;##&lt;/code&gt; equally good or whether they have arguments either way.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-02-20T14:39:27.297" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11607" PostTypeId="2" ParentId="11605" CreationDate="2017-02-20T15:39:17.740" Score="8" Body="&lt;p&gt;As one of the users of &lt;code&gt;#&lt;/code&gt;, here's my rationale.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Markdown gives you a handy way of grouping your post into (sub)sections using &lt;code&gt;#&lt;/code&gt;, &lt;code&gt;##&lt;/code&gt;, and &lt;code&gt;###&lt;/code&gt;. If you use &lt;code&gt;#&lt;/code&gt; for the header, you still get sections and subsections. If you use &lt;code&gt;##&lt;/code&gt;, you only get sections.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When writing Markdown, I don't really consider the HTML is generates. If &lt;code&gt;&amp;lt;h1&amp;gt;&lt;/code&gt; is not meant to be used in answers, &lt;code&gt;#&lt;/code&gt; should generate &lt;code&gt;&amp;lt;h2&amp;gt;&lt;/code&gt; elements. I can't do anything about this.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Having multiple &lt;code&gt;&amp;lt;h1&amp;gt;&lt;/code&gt; elements in one page is valid HTML. It used to be a bad idea, but &lt;a href=&quot;https://webdesign.tutsplus.com/articles/the-truth-about-multiple-h1-tags-in-the-html5-era--webdesign-16824&quot; rel=&quot;nofollow noreferrer&quot;&gt;that's no longer true for HTML5&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2017-02-20T19:18:13.223" LastActivityDate="2017-02-20T19:18:13.223" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11609" PostTypeId="2" ParentId="2190" CreationDate="2017-02-21T07:52:55.147" Score="2" Body="&lt;p&gt;I think Truthy/Falsey instead of being language specific is problem (answer) specific. So in a language  we can define different truthy/falsey s based on different conditions. For example one can define truthy as 53 and other things regarded as falsey and in the other problem truthy may be defined as an empty list and anything else may be defined as falsey.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the other word:&lt;br&gt;&#xA;&lt;em&gt;An entity (and all other things that are implicitly convertible to value of that entity) can be regarded as truthy and anything else can be regarded as falsey or vice versa. The entity that is regarded as truthy(or falsey) must has only one exactly defined representation&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example in Octave language one can regard &lt;code&gt;true&lt;/code&gt; as truthy and anything other as falsey. Because all numbers other than 0 are implicitly convertible to true those can be regarded as truthy and 0 can be regarded as falsey. Also arrays  that contain 0 such as [7 1 0] are implicitly convertible to false and other arrays are convertible to true.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an example one can define an empty list {} as falsey and all other things as truthy because an empty list has exactly one representation. Also a list of {1,2,33} can be regarded as truthy/falsey and all other things can be regarded as falsey/truthy since {1,2,33} has an exactly one representation.&#xA;But consider a function that sometimes returns a list and sometimes returns a scalar, so one can't regard a list as truthy because a list doesn't have exactly one representation so {1,2,3} and {1,2} are both lists but have different representations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also one can't define all even numbers as true and all odds as false except in those languages that evens are implicitly convertible to true.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; _________________________________&#xA;| Truthy         |  Falsey        |&#xA;|----------------|----------------|&#xA;| 243            | anything else  |&#xA;| NaN            | anything else  |&#xA;| anything else  | 127            |&#xA;| []             | anything else  |&#xA;| anything else  | {7,2}          |&#xA;| &quot;foo&quot;          | anything else  |&#xA;| True           | False          |&#xA;| False          | True           |&#xA;|________________|________________|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="62451" LastEditorUserId="62451" LastEditDate="2017-11-20T17:28:11.407" LastActivityDate="2017-11-20T17:28:11.407" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11610" PostTypeId="2" ParentId="2140" CreationDate="2017-02-21T11:44:00.450" Score="0" Body="&lt;h1&gt;Starry Starry Night&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This challenge needs a lot of work in my opinion, especially refining rules on input-output, I want to leave it as open as possible, while excluding unfair methods such as pre-drawn graphs etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;some parts of this are currently extremely vague, please ask any questions you believe might be important.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;i'll be adding some graphics in to help explain what the challenge is about at a glance though.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Does anyone else sometimes looks up at the stars and ponder the great mathematical questions of our time, Does P=NP if you just want to check a bus timetable, can a 'try/catch' block solve the halting problem, and how far would that star need to move to form an equilateral triangle..&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;given an array of 6 numbers, consisting of 3 arrays containing two numbers between 0-255 each, i.e.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[35,185],[141,8],[192,223]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;return the change required to be made to a single point, to have the three points form an equilateral triangle.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input-&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Can be taken as 6 distinct integers, an array of arrays, a single array, or a set of three objects with x/y as named/default properties,&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;these input formats are loose and whatever best suits your language should be used, within reason (i.e. - mathematica cannot use a pre-drawn graph as input)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;no two points will be on the same x/y, and 0 will never appear as any single x or y co-ordinate&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Output-&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Only one out of the three co-ordinates can be modified, the other two must remain unchanged&lt;/li&gt;&#xA;&lt;li&gt;Can be given graphically on a grid, a returned 'modified' version of the original input, or as an output of the values changed (i.e. 40-&gt;55;30-&gt;99)&lt;/li&gt;&#xA;&lt;li&gt;you're looking up at the sky, your numbers can easily be off by a bit, the returned values are only required to be accurate to the whole number, rounding up or down is allowed&lt;/li&gt;&#xA;&lt;li&gt;you do not have to achieve the smallest distance, or smallest/largest resulting triangle, any mathematically equilateral triangle will be correct&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Examples:(still have to actually calculate these)&#xA;&lt;code&gt;&#xA;[[20,113],[63,17],[40,161]]&#xA;[[43,119],[183,197],[103,86]]&#xA;[[144,216],[108,203],[113,199]]&#xA;[[197,131],[217,7],[13,77]]&#xA;[[100,60],[26,107],[130,241]]&#xA;[[209,61],[208,98],[47,94]]&#xA;[[48,78],[179,135],[52,119]]&#xA;[[93,148],[124,226],[137,118]]&#xA;[[65,21],[168,167],[221,56]]&#xA;[[89,118],[48,181],[29,98]]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="59735" LastEditorUserId="59735" LastEditDate="2017-02-22T19:25:43.590" LastActivityDate="2017-02-22T19:25:43.590" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11611" PostTypeId="2" ParentId="2140" CreationDate="2017-02-21T13:20:07.587" Score="0" Body="&lt;h1&gt;Associativity Conversion&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/syntax&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;syntax&amp;#39;&quot; rel=&quot;tag&quot;&gt;syntax&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/balanced-string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;balanced-string&amp;#39;&quot; rel=&quot;tag&quot;&gt;balanced-string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Operators that aren't &lt;a href=&quot;https://en.wikipedia.org/wiki/Associative_property&quot; rel=&quot;nofollow noreferrer&quot;&gt;associative&lt;/a&gt; usually come with some implicit associativity which let you omit parentheses in some expressions for readability. E.g. for a left-associative operator &lt;code&gt;$&lt;/code&gt;, the following parentheses are assumed:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a $ b $ c $ d ≡ ((a $ b) $ c) $ d&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;But for a right-associative operator, the implied parentheses are these:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a $ b $ c $ d ≡ a $ (b $ (c $ d))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For this challenge, we will use an &quot;invisible&quot; operator (that is, we'll simply write &lt;code&gt;abcd&lt;/code&gt; for &lt;code&gt;((ab)c)d&lt;/code&gt; or &lt;code&gt;a(b(cd))&lt;/code&gt;). Your task is to take some valid expression of that operator as input, where the operator will be assumed to be left-associative. You should then output an equivalent expression, where the operator is assumed to be right-associative.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Consider the input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a(bc)(d(efg))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;First, let's insert all parentheses that are implied by the operator's left-associativity:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(a(bc))(d((ef)g))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now we want to rewrite this in a right-associative fashion. Therefore, we drop all parentheses start at the right end of a subexpression:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(abc)d(ef)g&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We cannot remove any further parentheses because that would change the implied parentheses.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;ToDo&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;small print and test cases&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2017-02-21T13:20:07.587" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11616" PostTypeId="1" AcceptedAnswerId="11617" CreationDate="2017-02-21T21:49:59.587" Score="8" ViewCount="228" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5243/list-of-bounties-with-no-deadline&quot;&gt;This post, &quot;List of bounties with no deadline&quot;&lt;/a&gt; is a collection of, well, bounties without a deadline.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's not featured, and I wonder why? It's a very useful and important community post. I personally think it should be permanently featured like sandbox. (however like the sandbox, it's sometimes edited and thus bumped). But still, shouldn't it be featured?&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2017-02-22T00:11:08.397" Title="Why is the no deadline bounties post not featured?" Tags="|discussion|bounty|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11617" PostTypeId="2" ParentId="11616" CreationDate="2017-02-21T21:59:02.717" Score="13" Body="&lt;p&gt;No it shouldn't be featured. There's only so much space in the sidebar. I think 4 or maybe 5 questions is the maximum. Occasionally one of them is a blog post and/or a feature post on Meta.SE. Then the sandbox is permanently featured. And we've occasionally got another important announcement that needs to be featured. That leaves one lot for regular &quot;hot meta posts&quot;. As neat as the bounty post is, I don't think it's important enough to take up another slot. It's something that is only really relevant to PPCG &quot;power users&quot; who are looking for an extra challenge, and these users are likely active enough that they've found out about the bounty list on their own.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(As an aside &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8433/8478&quot;&gt;I &lt;em&gt;would&lt;/em&gt; like software support for indefinite bounties&lt;/a&gt; which would likely also make them a lot more discoverable, but that's not something that's in our power.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.777" LastActivityDate="2017-02-21T23:32:28.993" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11618" PostTypeId="2" ParentId="2140" CreationDate="2017-02-22T10:31:33.653" Score="-2" Body="&lt;h1&gt;Digitless digits&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;What we have feared for so long has finally happened, the robots have gained counsciousness and have risen. There has been a war, a global and violent one, and humans have been defeated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Calcubot, the fearless and tyrannic robot leader, has established a new world order, and its first decree as &lt;em&gt;Supreme World Leader&lt;/em&gt; has been to forbid all non-AI entities from using numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But, as it's always been the case in oppressive regimes, the Resistance has begun to form. Their first act of rebellion is to print leaflets with numbers on them. However, as the secret robot police is everywhere and can see everything, especially computer programs, these leaflets have to be inconspicuous and must not use numbers within their construction.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The goal of the challenge is to print all digits from &lt;code&gt;0&lt;/code&gt; to &lt;code&gt;9&lt;/code&gt; without using them in the source code.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;There is no input required&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;0123456789&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Restrictions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The source code must not use one of the following characters : &lt;code&gt;0123456789&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, as this is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; challenge, your code must be inventive, i.e. please refrain from using prebuilt classes with all the digits or &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;other standard loopholes&lt;/a&gt;. You might still try to make your source code the shortest possible, but not at the expense of inventivity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The answer with the most upvotes after 7 days will be declared the winner, the time of submission will be used as a tie-breaker.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, this is what I had in mind for a PHP solution : &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$i = (int)false;&#xA;foreach(str_split('abcdefghij') as $k) {&#xA;    echo $i++;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Meta questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Has this challenge already been done ? I feel like it's not a revolutionary idea and am afraid someone has thought about it before.&lt;/li&gt;&#xA;&lt;li&gt;Could you give me examples of &quot;forbidden loopholes&quot;, as I don't really now all the esoteric programmation languages you guys are using.&lt;/li&gt;&#xA;&lt;li&gt;Finally, do you think it's a good challenge ? And if not, what could be done to improve it ? That's my first proposed challenge, so I'm aware there might be blatant errors or misses.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="64847" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2017-02-22T11:00:10.497" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="11619" PostTypeId="2" ParentId="1200" CreationDate="2017-02-22T11:41:12.157" Score="4" Body="&lt;h1&gt;Posts should ideally be formatted so that they could stand as an article on their own&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A good PPCG post is, from my point of view, something of a miniature article on its own. The heading for a post should therefore be a top-level heading (i.e. one &lt;code&gt;#&lt;/code&gt;). I use two &lt;code&gt;#&lt;/code&gt; signs for secondary headings lower down, because they aren't the headings for my post as a whole.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's probably a bad idea to make a post format mandatory, at least in terms of deleting posts for not complying with the format (although I wouldn't necessarily be opposed to posts being &lt;em&gt;edited&lt;/em&gt; into a consistent format, if it's well thought-out). That said, though, I've kind-of become notorious for the rate at which I can gain reputation, and a decent part of that is that I try to make my posts well-formatted and well-explained, so that people are more likely to read, enjoy, and thus upvote them. As such, you could definitely do worse than formatting posts the way I do ;-)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The header line of the post can potentially need to contain quite a bit of information. Here are the header line contents I'm aware of, and how I format them:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The language in which the program is written (obviously). This helps people check to see if their solution has already been beaten or equalled in the same language, and if so, if the algorithm is too similar to make a posting theirs interesting. This comes at the start of the line.&lt;/li&gt;&#xA;&lt;li&gt;Language implementation or version. We define languages by their implementation here; thus, two different implementations of a language are actually different languages. Often, that doesn't matter, and we can safely assume a relatively recent, widely accessible version of the language. If there are many competing implementations, though, or if the submission relies on implementation-dependent behaviour, it's worth stating a specific version of the language. I put this in parentheses, e.g. &lt;strong&gt;Perl (5.10)&lt;/strong&gt; or &lt;strong&gt;INTERCAL (C-INTERCAL)&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Any other dependencies of the submission. If the submission needs a particular executable to be installed (say, the interpreter for a different language), or a particular nonstandard library, or whatever, it's worth mentioning that in the title, as a) it's arguably part of the language, and b) it often makes a big difference to the way that the answer works. I use a + sign for this, e.g. &lt;strong&gt;Bash + Jelly + Graphviz&lt;/strong&gt; (an actual submission!). This also comes in handy in polyglots, which require multiple languages installed to do their polyglotty thing.&lt;/li&gt;&#xA;&lt;li&gt;Score. This is normally a byte count, but not always (e.g. in a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, the scoring is typically different). Listing the byte count can be useful even in challenges with weird scoring, because it's often relevant to either the scoring or validity in one way or another.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Older scores are worth showing, crossed out. This hints to people that they can look into the history of the post to see the evolution of the submission, and can help to explain parts of the explanation that pertain to the wrong version of the program.&lt;/li&gt;&#xA;&lt;li&gt;If the submission incurs bonuses or penalties, it's also worth including those separately, so that people who count the bytes themselves can understand where the score comes from. I use a format like &lt;em&gt;bytes&lt;/em&gt; + &lt;em&gt;penalties&lt;/em&gt; = &lt;em&gt;score&lt;/em&gt; (seeing as I frequently golf in Perl, I often end up incurring a couple of bytes in penalties for weird command-line options).&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Finally, if there's information that could potentially invalidate the submission, that's worth including in the title to avoid arguments about who's won (for the people who care about having a specific winner). Many people say &quot;noncompeting&quot; here, but I dislike that because a) it's pre-empting decisions by other people on what's legal and what isn't, and b) it doesn't explain &lt;em&gt;why&lt;/em&gt; the post is disallowed from winning. So I put a short explanation here, typically &quot;language postdates challenge&quot;, as most other conditions that make a post noncompetitive also disallow you from posting the post at all. (The second most common is &quot;possibly invalid?&quot;, in situations where there's reasonable doubt about whether the program complies with the specification or not; in such cases, you leave the post up because there's a reasonable chance that it does, but you put the warning on so that people are at least aware of the dispute.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And for completeness, here's the sort of information you need in the rest of the post:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program itself (or instructions to reproduce it if it wouldn't fit into a post for some reason, e.g. nonprintable characters, a bytecount which has more digits than a typical program has commands, etc.). This is obviously required for people to be able to evaluate the submission.&lt;/li&gt;&#xA;&lt;li&gt;A link for executing the program online; not mandatory, but it makes the submission better.&lt;/li&gt;&#xA;&lt;li&gt;An explanation of how the program complies with the rules (choices made in answering the question, the source of any bonuses or penalties, I/O formats, etc.).&lt;/li&gt;&#xA;&lt;li&gt;An explanation of the program itself. In relatively readable languages, this can just be an indented and commented version. If the language is less readable, you may need to epxlain how it works, character by character.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A typical post would look something like this, for me:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# Language + library (implementation), &amp;lt;s&amp;gt;42&amp;lt;/s&amp;gt; 41 + 2 = &amp;lt;s&amp;gt;44&amp;lt;/s&amp;gt; 43 bytes&#xA;&#xA;&amp;lt;!-- language-all: lang-whatever --&amp;gt;  (if SE has highlighting for the language)&#xA;&#xA;    program goes here; this program is golfed&#xA;&#xA;[Link to test the program online](http://example.com)&#xA;&#xA;Run with `-ok` (2 byte penalty).&#xA;&#xA;## Explanation&#xA;&#xA;This program works in the following way, using this algorithm. It's&#xA;actually fairly frustrating; it could be 5 bytes shorter if only the&#xA;implementation didn't have a bug. Use of the `-ok` option, despite the&#xA;penalty it incurs, makes the I/O much easier and is well worth the cost.&#xA;&#xA;    program goes here  # explanation of what it means for the program to go here&#xA;    this program is golfed  # explanation of what it means to be golfed&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;That looks like this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Language + library (implementation), &lt;s&gt;42&lt;/s&gt; 41 + 2 = &lt;s&gt;44&lt;/s&gt; 43 bytes&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;program goes here; this program is golfed&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;&lt;a href=&quot;http://example.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Link to test the program online&lt;/a&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Run with &lt;code&gt;-ok&lt;/code&gt; (2 byte penalty).&lt;/p&gt;&#xA;  &#xA;  &lt;h2&gt;Explanation&lt;/h2&gt;&#xA;  &#xA;  &lt;p&gt;This program works in the following way, using this algorithm. It's&#xA;  actually fairly frustrating; it could be 5 bytes shorter if only the&#xA;  implementation didn't have a bug. Use of the &lt;code&gt;-ok&lt;/code&gt; option, despite the&#xA;  penalty it incurs, makes the I/O much easier and is well worth the cost.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;program goes here  # explanation of what it means for the program to go here&#xA;this program is golfed  # explanation of what it means to be golfed&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-02-22T11:41:12.157" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11620" PostTypeId="2" ParentId="2035" CreationDate="2017-02-22T11:48:25.487" Score="25" Body="&lt;p&gt;In addition to the accepted answer, I'd like to bring up another point: you don't necessarily have to accept an answer to a challenge at all. If you want to promote competition within individual languages, which is normally considered a good thing (so that the use of golfing languages doesn't drive away people who would prefer to answer in something more widely used), placing an accepted answer checkmark can discourage people because it looks like their languages are being passed over in favour of the ones which are more suited to the challenge. So you should at least consider just leaving no answers as accepted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a few special cases, notably &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; (and to a lesser extent &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;), the sort order of the answers is relevant, and placing an accepted answer checkmark will disturb it. So I'd be much stronger in these cases, and say that in questions where the sort order matters, you &lt;em&gt;should not&lt;/em&gt; place the checkmark (as opposed to other questions, where you should merely just &lt;em&gt;consider&lt;/em&gt; not placing it).&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-02-22T11:48:25.487" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11622" PostTypeId="2" ParentId="2140" CreationDate="2017-02-22T23:41:53.530" Score="1" Body="&lt;h1&gt;Caps Lock Morse Code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/q/110974/19547&quot;&gt;Blink the CAPS LOCK&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input will be a string that contains only characters that can be represented in morse code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Convert the input string to morse code and then output it using either the Caps Lock, Num Lock or Scroll Lock indicators on the keyboard&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Thoughts on the challenge&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I think this would be good as a code golf&lt;/li&gt;&#xA;&lt;li&gt;How specific should I be on defining what the output looks like, is the above sufficient or should a specific time length be given for dots and dashes?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user19547" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:27.863" LastActivityDate="2017-02-22T23:41:53.530" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11623" PostTypeId="1" CreationDate="2017-02-23T01:52:41.827" Score="0" ViewCount="59" Body="&lt;p&gt;On the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;default loopholes&lt;/a&gt; there is an answer that forbids making languages that are made specifically for a challenge. This is definitely a good idea. However, there are loopholes even to this. A user could create programming languages designed for a tag, trivializing many challenges. I believe that it is time to somehow create some concrete rules on what programming languages can be used. I believe a simple list would be overly restrictive to languages that are legitimate but not well known. These rules might include certain features that the language must include or that the language must be compatible with x. This should clear up a long standing problem I have had with answering code-golf questions.&lt;/p&gt;&#xA;" OwnerUserId="62805" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2017-02-23T01:52:41.827" Title="What criteria must a programming language fit?" Tags="|discussion|rules|" AnswerCount="0" CommentCount="0" ClosedDate="2017-02-23T02:40:54.593" ContentLicense="CC BY-SA 3.0" />
  <row Id="11624" PostTypeId="2" ParentId="2140" CreationDate="2017-02-23T02:45:16.520" Score="1" Body="&lt;h1&gt;Free the Prisoners&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Your task is to free a few prisoners.&lt;/strong&gt; Here they are, in their cells:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[sad] [shame] [cops]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Rules, explained&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;They have to be specifically freed using whitespace as replacement for each replaced letter, and then place the words to the right of the string, with an additional space separating the string area.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first example would become:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[   ] [     ] [    ] sad shame cops&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here is a code snippet that lets you see the prison cell before and after, plus a JS function. The square brackets (&lt;code&gt;[]&lt;/code&gt;) are assumed, and do not need to be typed in the box.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;console.log(`Original Cell:     Waiting for input...`);&#xD;&#xA;  console.log(`Emptied Cell:      Waiting for input...`);&#xD;&#xA;  console.log(`Empty Cell Length: Waiting for input...`);&#xD;&#xA;&#xD;&#xA;var string = '';&#xD;&#xA;var emptyCell = function(string) {&#xD;&#xA;  string = string.replace('[', '').replace(']', '');&#xD;&#xA;  return ' '.repeat(string.length);&#xD;&#xA;};&#xD;&#xA;&#xD;&#xA;window.onkeyup = function() {&#xD;&#xA;  string = document.getElementById('cagecontent').value;&#xD;&#xA;  &#xD;&#xA;  console.clear();&#xD;&#xA;  &#xD;&#xA;  console.log(`Original Cell:     '${string}'`);&#xD;&#xA;  console.log(`Emptied Cell:      '${emptyCell(string)}'`);&#xD;&#xA;  console.log(`Empty Cell Length: ${emptyCell(string).length}`);&#xD;&#xA;};&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;textarea id='cagecontent' placeholder='Place text, minus the brackets, here.'&amp;gt;&amp;lt;/textarea&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is one known error for this script: the first bracket rule doesn't work. Sorry about that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any whitespace on the edge of an imprisoned string (ex. &lt;code&gt;test&lt;/code&gt; with a space before) would stay while emptying the cells, but would be trimmed when placed outside. The aforementioned &lt;code&gt;test&lt;/code&gt; with some extra whitespace on the edge would look like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[ test]&#xA;[     ] test&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As you can see, instead of two spaces between the original string and the freeing area, there is only one.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[test]]&#xA;[    ]] test&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules, simplified&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Trailing spaces are allowed.&lt;/li&gt;&#xA;&lt;li&gt;Replace each character in a prison cell string with a single blank space.&lt;/li&gt;&#xA;&lt;li&gt;Place each freed thing to the right of the original string.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Separate the original string and the freed things with a single space.&lt;/li&gt;&#xA;&lt;li&gt;Extra whitespace on the sides of a string, when placed to the right of an original string, is removed.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Your testing string will be: &lt;code&gt;(Let us out!)&amp;gt;[mad] [angery] [11]]&lt;/code&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should result in: &lt;code&gt;(Let us out!)&amp;gt;[   ] [      ] [  ]] mad angery 11&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;No common loopholes, of course.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you look at the tags, you can see that this question is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; puzzle. The tag wiki excerpt for this tag is:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Code-golf is a competition to solve a particular problem in the fewest bytes of source code. If you want to score by characters instead of bytes, please state this explicitly in the challenge. If source code length is not the primary scoring criterion, consider using another tag instead.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That means, the question (of any language) with the least amount of bytes is the top-scoring solution!&lt;/p&gt;&#xA;" OwnerUserId="46517" LastActivityDate="2017-02-23T02:45:16.520" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11626" PostTypeId="1" AcceptedAnswerId="11628" CreationDate="2017-02-23T16:59:42.303" Score="2" ViewCount="181" Body="&lt;p&gt;I posted an image in the main chat, The Nineteenth Byte.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A few minutes later I get kicked from TNB with a 30 minute ban, and apparently the Community bot did it. How did a bot judge that one picture was worthy of kicking me from chat?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I understand if a human asked me to remove it and I would have immediately but never was asked. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/messages/35631789/history&quot;&gt;For moderators who can view the history of a deleted message, here's the link.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="46271" LastEditDate="2017-02-23T17:15:30.347" LastActivityDate="2017-02-23T19:34:49.660" Title="Kicked from TNB (by a bot) for &quot;inappropriate content&quot; and have some questions about it" Tags="|discussion|chat|flags|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11627" PostTypeId="2" ParentId="11626" CreationDate="2017-02-23T17:13:26.177" Score="6" Body="&lt;p&gt;Your link was &quot;flagged&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This happens when a user clicks the little &quot;flag&quot; button, near the star and reply button. They found the picture offensive, flagged it as such, and other moderators and 10k+ rep users agreed with that. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's marked as &quot;Community&quot; deleting it, because it requires multiple people to approve to flag and they're supposed to be anonymous.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Both the flagger and the people who approved the flag are anonymous, so there's no way to tell who did that (as it should be).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Next time, probably don't post that image.  If it could possibly offend anyone, you probably shouldn't post it. &lt;/p&gt;&#xA;" OwnerUserId="46271" LastActivityDate="2017-02-23T17:13:26.177" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11628" PostTypeId="2" ParentId="11626" CreationDate="2017-02-23T17:24:53.650" Score="5" Body="&lt;p&gt;First, some terminology: you weren't kicked out of the The Nineteenth Byte but got a network-wide 30 minute suspension.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &quot;bot&quot; you mention &amp;ndash; Feeds &amp;ndash; owns the deletion resulting from six flags (or one from mod) cast on spam, inappropriate, or offensive messages. That gruesome short story certainly fits the bill.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The 30 minutes have passed and your suspension is over. In the future, please refrain from posting content like this in our chat rooms.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="41024" LastEditDate="2017-02-23T19:34:49.660" LastActivityDate="2017-02-23T19:34:49.660" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11629" PostTypeId="2" ParentId="5243" CreationDate="2017-02-23T22:16:22.750" Score="4" Body="&lt;h1&gt;500 reputation bounty to the first Turing completeness proof or disproof for any answer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/111092/write-a-programming-language-of-unknown-completeness&quot;&gt;this question&lt;/a&gt; based on proofs or disproofs of their respective conjectures&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a long-term bounty which I am not making for the &quot;lol&quot;s.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I will create a 500 reputation bounty to the first answer to prove or disprove the Turing completeness of their program in this challenge. To celebrate the proving or disproving for any of the conjectures referenced in this challenge, I will &lt;em&gt;gladly&lt;/em&gt; give a 500 rep bounty.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2017-02-23T23:32:52.327" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="11630" PostTypeId="2" ParentId="2140" CreationDate="2017-02-23T23:19:54.130" Score="0" Body="&lt;h1&gt;Triangular Numbers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Compute the nth triangular number. Triangular numbers are the number of things in a size x triangle (&lt;code&gt;n(n+1)/2&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Testcases:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 0&#xA;1 1&#xA;2 3&#xA;3 6&#xA;7 28&#xA;34 595&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;IO in any allowed form, standard loopholes apply.&lt;/p&gt;&#xA;" OwnerUserId="51443" LastEditorUserId="51443" LastEditDate="2017-02-23T23:49:44.153" LastActivityDate="2017-02-23T23:49:44.153" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11633" PostTypeId="2" ParentId="2140" CreationDate="2017-02-24T14:46:09.203" Score="0" Body="&lt;h1&gt;Unschedule my tasks&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;algorithm&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Intro&lt;/h2&gt;&#xA;&lt;p&gt;I have a scheduler that uses priority scheduling on my PC so there are several tasks with a definite priority. All that i still remember is that every task runs cyclically&#xA;forever with an also definite period.&#xA;I can see which tasks are running from &lt;code&gt;t=0&lt;/code&gt; to now, but i need to know the priority and the period time of every task.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;The input is a string with the length &lt;code&gt;n&lt;/code&gt; showing the last &lt;code&gt;n&lt;/code&gt; timestamps. We give the tasks uppercase letters from &lt;code&gt;A...Z&lt;/code&gt;, where the amount of different tasks &lt;code&gt;k&lt;/code&gt; is given as &lt;code&gt;0&amp;lt;k&amp;lt;27&lt;/code&gt;. If one tasks is chosen, it will need one time stamp long to finish and will start after it's period time &lt;code&gt;T&lt;/code&gt; again.&#xA;Example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;not given:&#xA;task A: priority=2, T=7&#xA;task B: priority=1, T=2&#xA;task C: priority=3, T=5&#xA;&#xA;results in:&#xA;A      A      A      A      A      A      A&#xA;B B B B B B B B B B B B B B B B B B B B B B&#xA;C    C    C    C    C    C    C    C    C&#xA;_____________________________________________&#xA;BABCBCBAB BCB BABCB BABCBCB BABCB BABCB BCBA&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The last line will be your input and the goal is to get every task with the corresponding priority and period time.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;So for the input&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;BABCBCBAB BCB BABCB BABCBCB BABCB BABCB BCBA&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You should output&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A 2 7&#xA;B 1 2&#xA;C 3 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The output should have the format &lt;code&gt;[task name] [priority] [period time]&lt;/code&gt; with one task per line.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;All tasks will always start at t=0&lt;/li&gt;&#xA;&lt;li&gt;If multiple tasks are ready to run, the one with the lower priority will run first, the other one will move one slot to the right&lt;/li&gt;&#xA;&lt;li&gt;The priority of one task is always the same, so no dynamic priorities will be used&lt;/li&gt;&#xA;&lt;li&gt;The processor will never have to run at 100%, or as formula: &lt;code&gt;1/TA + 1/TB + ... + 1/Tk &amp;lt; 1&lt;/code&gt;. In the example it's &lt;code&gt;1/7 + 1/2 + 1/5 = 0.84 &amp;lt; 1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;If there are multiple solutions, output only one of them&lt;/li&gt;&#xA;&lt;li&gt;The input string will show every task at least 3 times&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;in:&#xA;A  A  A  A&#xA;out:&#xA;A 1 3&#xA;&#xA;in:&#xA;CBA   CBA   CBA   CBA   CBA   CBA   CBA   CBA&#xA;out:&#xA;A 3 6&#xA;B 2 6&#xA;C 1 6&#xA;&#xA;in: &#xA;//A      A      A      A      A      A&#xA;//B   B   B   B   B   B   B   B   B   B&#xA;//C    C    C    C    C    C    C    C&#xA;//D             D             D&#xA;//E        E        E        E        E&#xA;  ABCDBCEABEC B ACBDE BAC BC EABCDB  ABCE&#xA;out:&#xA;A 1 7&#xA;B 2 4&#xA;C 3 5&#xA;D 4 14&#xA;E 5 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Thoughts&lt;/h2&gt;&#xA;&lt;p&gt;Still thinking about turning the question around. Just turning input and output around but i like this way more because i think it's more challenging.&lt;/p&gt;&#xA;" OwnerUserId="29520" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-27T15:41:18.393" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11635" PostTypeId="2" ParentId="2140" CreationDate="2017-02-25T17:04:20.247" Score="1" Body="&lt;h1&gt;Is this bitstring divisible by 3?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary&amp;#39;&quot; rel=&quot;tag&quot;&gt;binary&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to write a program or function that, given a string of bits representing a positive integer, outputs or returns a truthy value if it's divisible by 3, and a falsy value otherwise.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;You may not convert the input to a number in any way.&lt;/strong&gt; You may manipulate the string or loop through each digit, so long as you don't convert it to your language's native number type.&lt;/li&gt;&#xA;&lt;li&gt;Input may be given as a string or an array of digits.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Truthy examples&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;11&#xA;110&#xA;1001&#xA;1100&#xA;1111&#xA;10010&#xA;10101&#xA;11011&#xA;111111&#xA;10010011&#xA;1010010001&#xA;10101010101&#xA;100100101010001011110101010001&#xA;1000000000000000000000000000000000000000000000000001&#xA;1111111111111111111111111111111111111111111111111111&#xA;11000001001011110010001010001001010110000010100001001000100101&#xA;1111001111110010001110111011001010100100001000110100010011101011110010010111100111011100110101000011100110011111001010000111011110010111000100001010101001000001111011011111000101001111010010010010000110101100011001011111111000111001110110011011101010011000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Falsy examples&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;10&#xA;100&#xA;101&#xA;111&#xA;1000&#xA;1010&#xA;1011&#xA;1101&#xA;10000&#xA;11111&#xA;10101010101011&#xA;1101001000100001000001000000100000001&#xA;10000000000000000000000000000000000000000000000000001&#xA;11111111111111111111111111111111111111111111111111111&#xA;11000001001011110010001010001001010110000010100001001000100110&#xA;1101011111110011110010011101010011000001101011001111001001011010100000000110001111001101100000001010010111100111000101001001000011100000110111010010100000100001100101110000011010000010110010101011110010100110101100000011101101010000010011000001001001010101&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Obviously as a Do X without Y question this is walking a very fine line. There are several string manipulation techniques (which I won't spoil here) that I'd like to see used, rather than solutions that just loop through the string and repeatedly add a digit and take modulo 3. I could be more strict and not allow any numbers in the process, but I don't know if that's a good idea... Suggestions? Is it even possible to make this a good challenge?&lt;/p&gt;&#xA;" OwnerUserId="42545" LastEditorUserId="42545" LastEditDate="2017-02-25T17:14:41.790" LastActivityDate="2017-02-25T17:14:41.790" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11639" PostTypeId="1" CreationDate="2017-02-25T20:10:08.460" Score="9" ViewCount="148" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; is a fairly popular tag with just about 200 questions at the time of posting.  It also has a pretty minimal description:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Imposes a restriction on the source code used to solve the challenge, for example, having no numbers in the source code.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;While short tag description can have a lot of benefits I have been noticing a good deal of low quality or problematic questions tagged with restricted source lately.  So I thought it might be time to talk about what makes a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; problem good and bad and what we can do to help people make good challenges with this tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, what does it mean to be a good restricted source question?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-02-26T02:18:40.480" Title="Improving the Restricted Source tag" Tags="|discussion|tags|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11640" PostTypeId="2" ParentId="11639" CreationDate="2017-02-25T20:10:08.460" Score="7" Body="&lt;h1&gt;Restricted Source should be program verifiable&lt;/h1&gt;&#xA;&lt;p&gt;A source restriction should be verifiable by a computer, otherwise a question is unclear and should be closed.  If it cannot be checked by a computer, it is likely not actually a restriction on the source of the program but on something else. (like the algorithm implemented or the programming language chosen)&lt;/p&gt;&#xA;&lt;p&gt;How does this apply to questions currently tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;?&lt;/p&gt;&#xA;&lt;p&gt;In my mind there are three types of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; challenges.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Restricting operations:&lt;/p&gt;&#xA;&lt;p&gt;These questions ban a type of operation, such as addition or for loops.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/20996/add-without-addition-or-any-of-the-4-basic-arithmetic-operators&quot;&gt;Example&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Banning characters:&lt;/p&gt;&#xA;&lt;p&gt;These type of questions give a list of characters that you are not allowed to use in your program.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/307/obfuscated-hello-world&quot;&gt;Example&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Patterned requirements:&lt;/p&gt;&#xA;&lt;p&gt;These questions require the entire source code to follow pattern or structure specified in the question.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/58556/just-repeat-yourself&quot;&gt;Example&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/88806/only-even-bytes&quot;&gt;Example&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/108133/three-three-three&quot;&gt;Example&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The first one is unenforceable.  If you ban addition is incrementation allowed? If you ban loops is recursion allowed?  These kinds of restrictions cannot be checked by a computer and human checkers might even disagree.  These are &lt;em&gt;not&lt;/em&gt; restricted source questions and should be closed as unclear.&lt;/p&gt;&#xA;&lt;p&gt;The second type are a little better and by far the most popular of the three types. For a single encoding it is not very hard to write a program to check if answers follow the restriction.  For other encodings it might be harder and there might be room for interpretation or disagreement but overall it is clear and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;.  These are however &lt;em&gt;boring&lt;/em&gt;.  We see a lot of implement a trivial task without these characters and they are no longer novel and should be discouraged in the tag wiki.&lt;/p&gt;&#xA;&lt;p&gt;The third type of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; challenges, the patterned type, are the most interesting of the bunch, they are often verifiable regardless of the encoding.  These challenges are what we should promote as the use of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-26T02:18:40.480" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11642" PostTypeId="2" ParentId="2140" CreationDate="2017-02-25T21:11:57.043" Score="0" Body="&lt;h1&gt;Ultimatum Game&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You and a (not so) friendly bot have a chance to play a game. There is 100 dollars on the table. One person, suggests a split, and the other can accept the split, or force each individual to accept absolutely nothing. You will alternate being able to give the ultimatum for a substantially large number (1000) rounds. This process will proceed in a round robin fashion till every bot has played all the others exactly once. Your score in this manner, will just be the total amount of money you collect. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now your job is to write a bot that will play this game. You will be provided with needed information as command line arguments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A sample invocation will look like this if you are giving the ultimatum. When you receive an invocation like this, you would be the one propsing a split.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;foolanguage myBot.foo 4 ultimatum 1 reject 10 reject 20 reject 25 accept &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or, like this if you are the one considering the ultimatum. You will be tasked with either accepting the split, or rejecting it (both bots get 0).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;foolanguage myBot.foo 4 accepting 1 reject 10 reject 20 reject 25 accept 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The first number represents the number of rounds played (n). The second will be a string either &quot;Ultimatum&quot; or accept/ reject. Next will follow 2n+1 strings. The first 2n will be offers and what the choice was. The last string will be the current offer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;hr/&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Entering&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You will provide a command stem and a unique bot name. &#xA;So the sample bot can be called fooBot, and the command stem (after which arguments are appended) looks like &quot;foolanguage myBot.foo&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your bot will then output either the number it will offer, or (if they are the one who has to consider the offer), (&quot;a&quot; for accept/ &quot;r&quot; for reject) within 50 ms. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your bot must be be able to make both choices (accept or reject). No locking in to just one choice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, your bot must be deterministic (prng's may be seeded with a private seed. If you wish to do this, insert a dummy seed, and change it right before the competition) please publish the hash to ensure you don't tweak it in light of other submissions. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the spirit of fair competition, no access to the file system (or OS calls). I will allow the option to write to a maximum of one text file which can have a maximum size of 8 megabytes. Solutions will be tested within a virtual machine imaged with the latest version of linux on my home desktop which has an Intel i7-4770 quad core 3.4 gHZ cpu. &lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="46918" LastEditDate="2017-02-26T14:04:27.930" LastActivityDate="2017-02-26T14:04:27.930" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="11644" PostTypeId="1" CreationDate="2017-02-26T03:08:19.890" Score="10" ViewCount="223" Body="&lt;p&gt;For Quine programs one is not allowed to read the source of the program, for obvious reasons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However Del|m|t does a good deal of memory storage in the source code of the program, thus it can read and write to its own source while it is running.  Del|m|t can even write out of bounds by writing to negative indices you can create extra memory.  What counts as reading the source code for Del|m|t? Can you read in the negative space before the source code or are you never allowed to read from the &quot;source&quot;?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-02-26T03:38:58.817" LastActivityDate="2017-02-27T17:42:10.953" Title="What counts as reading one's own source in Del|m|t" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11647" PostTypeId="2" ParentId="2140" CreationDate="2017-02-26T19:44:14.560" Score="0" Body="&lt;h1&gt;Board Game Breaking - The Front Nine W.I.P.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Eventually I will make a post here for each of the challenges. This post is for discussing them as a series. If you have an idea for a good board game breaker, please share!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Board Game Breaking is a series of challenges that harness computing power in order to 'break' a game (i.e. ensure no one will play with you). Each challenge will revolve around creating a tool that analyzes the board game in a way that will give you some advantage. There are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;nine challenges&lt;/a&gt; total.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11648/43214&quot;&gt;BGB #1 - Number Rings&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input: Int&lt;/li&gt;&#xA;&lt;li&gt;Output: Likelihood of creating that int with &lt;code&gt;3d6&lt;/code&gt; &amp;amp; &lt;code&gt;+-*/&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/DLTqms.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/DLTqms.png&quot; alt=&quot;Number Rings&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11649/43214&quot;&gt;BGB #2 - Can't Stop!&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input: 1-3 Ints&lt;/li&gt;&#xA;&lt;li&gt;Output: Likehood 2 (of 4) d6 will add up to one of the inputs&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/24dKas.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/24dKas.jpg&quot; alt=&quot;Can&amp;#39;t Stop&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;BGB #3 - Axis &amp;amp; Allies&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input: # of units on each side&lt;/li&gt;&#xA;&lt;li&gt;Output: Probability of winning the fight&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/WKqrMs.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/WKqrMs.jpg&quot; alt=&quot;Axis &amp;amp; Allies&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;BGB #4 - Labrynth&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input: Image&lt;/li&gt;&#xA;&lt;li&gt;Output: Image re-arranged in labrynth-like way to make gradient &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/tpEHYs.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/tpEHYs.png&quot; alt=&quot;Labrynth&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;BGB #5 - Scrabble&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input: Word list&lt;/li&gt;&#xA;&lt;li&gt;Output: Word with most subwords&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/VHAess.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/VHAess.png&quot; alt=&quot;Scrabble&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;BGB #6 - ??&lt;/h3&gt;&#xA;&#xA;&lt;h3&gt;BGB #7 - ??&lt;/h3&gt;&#xA;&#xA;&lt;h3&gt;BGB #8 - ??&lt;/h3&gt;&#xA;&#xA;&lt;h3&gt;BGB #9 - ??&lt;/h3&gt;&#xA;" OwnerUserId="43214" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2017-02-27T00:24:16.547" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11648" PostTypeId="2" ParentId="2140" CreationDate="2017-02-26T20:19:09.990" Score="0" Body="&lt;h1&gt;BGB #1 - Number Rings&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Goal&lt;/strong&gt;: Take an int, output the probability of creating that int with &lt;code&gt;3d6&lt;/code&gt; &amp;amp; &lt;code&gt;+-*/&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/DLTqmm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/DLTqmm.png&quot; alt=&quot;Number Rings&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;Check &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;here&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;Number Rings (or Sector 18) is a board game where up to 4 players take turns rolling a set of 3 six-sided dice. Then then using &lt;code&gt;+-*/&lt;/code&gt; to combine &lt;em&gt;all&lt;/em&gt; three of those numbers to get a number, &lt;code&gt;x&lt;/code&gt;. They then place (or remove) a ring on a &lt;code&gt;x&lt;/code&gt; peg. First player to have a ring on each of his pegs, wins. That is the basic idea of how the game works.&lt;/p&gt;&#xA;&lt;p&gt;For any number &lt;code&gt;a&lt;/code&gt;, I want to know the probability that I will be able to create &lt;code&gt;a&lt;/code&gt; with a random roll.&lt;/p&gt;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input&#xA;&lt;ul&gt;&#xA;&lt;li&gt;One integer, &lt;code&gt;i&lt;/code&gt;, such that &lt;code&gt;0&amp;lt;i&amp;lt;19&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The input is flexible&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Output&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The probability of being able to create &lt;code&gt;i&lt;/code&gt; with a random roll&lt;/li&gt;&#xA;&lt;li&gt;At least &lt;code&gt;5&lt;/code&gt; digits of accuracy&lt;/li&gt;&#xA;&lt;li&gt;Ex: &lt;code&gt;0.12345&lt;/code&gt;. &lt;code&gt;.12345&lt;/code&gt;, &lt;code&gt;12.345&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Or exact rational number&lt;/li&gt;&#xA;&lt;li&gt;Ex: &lt;code&gt;145/1023&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Leading/Trailing whitespace is acceptable&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Scoring&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Shortest program/function in bytes wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;ToDo&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="43214" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-27T13:42:10.070" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11649" PostTypeId="2" ParentId="2140" CreationDate="2017-02-26T20:43:50.057" Score="0" Body="&lt;h1&gt;BGB #2 - Can't Stop!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Goal&lt;/em&gt;: Take 3 ints, output the probability 2 of 4d6 will sum to one of the ints.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/24dKam.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/24dKam.jpg&quot; alt=&quot;Can&amp;#39;t Stop&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Check &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;here&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Can't Stop is a board game. There are columns for the numbers &lt;code&gt;2&lt;/code&gt; through &lt;code&gt;12&lt;/code&gt;, each having a number of rungs that must be climbed into to win the column. On a player's turn, they receive 3 white pieces and &lt;code&gt;4d6&lt;/code&gt;. They roll the dice, sum two of the values and either move a placed white piece up a rung or place a white piece in a column. First player to win 3 columns, wins the game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For any numbers, &lt;code&gt;a&lt;/code&gt; or &lt;code&gt;a,b&lt;/code&gt; or &lt;code&gt;a,b,c&lt;/code&gt;, I want to know the probability that I will roll at least two numbers that sum to &lt;code&gt;a&lt;/code&gt;, &lt;code&gt;b&lt;/code&gt; or &lt;code&gt;c&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;One to three integers between &lt;code&gt;2&lt;/code&gt; and &lt;code&gt;12&lt;/code&gt; inclusive&lt;/li&gt;&#xA;&lt;li&gt;Taking 3 integers that aren't necessarily distinct is also acceptable&lt;/li&gt;&#xA;&lt;li&gt;The input is flexible&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Output&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The probability of being able to create one of the inputs with a random roll&lt;/li&gt;&#xA;&lt;li&gt;At least 5 digits of accuracy&lt;/li&gt;&#xA;&lt;li&gt;Ex: &lt;code&gt;0.12345&lt;/code&gt;, &lt;code&gt;.12345&lt;/code&gt;, &lt;code&gt;12.345&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Or exact rational number&lt;/li&gt;&#xA;&lt;li&gt;Ex: &lt;code&gt;145/1023&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Leading/Trailing whitespace is acceptable&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Scoring&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Shortest program/function in bytes wins&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;ToDo&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="43214" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2017-02-27T13:43:00.577" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11650" PostTypeId="1" CreationDate="2017-02-26T22:19:44.297" Score="1" ViewCount="113" Body="&lt;p&gt;How to cout bytes for winforms programs? Just met a strange situation &lt;a href=&quot;//codegolf.stackexchange.com/q/109155/32091&quot;&gt;here&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;&lt;a href=&quot;//codegolf.stackexchange.com/a/109247/32091&quot;&gt;C#, 120 bytes&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;using System.Windows.Forms;class P{static void Main(){var a=new Form();a.Controls.Add(new CheckBox());a.ShowDialog();}}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This code assumes console application and contains full code that can be compiled.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;&lt;a href=&quot;//codegolf.stackexchange.com/a/111419/32091&quot;&gt;C# (Windows Form Application), 82 bytes&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;using System.Windows.Forms;class F:Form{public F(){Controls.Add(new CheckBox());}}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Assumes winforms application. There should be additional autogenerated file with code for running the form. And that code is out of calculation... Because of project type?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it like some preset we should not count assuming that C# and C# WinForms are different?&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;&lt;a href=&quot;//codegolf.stackexchange.com/a/111421/32091&quot;&gt;VB.NET, 67 (program) + 37 (additional switches) = 104&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Class F&#xA;Inherits Form&#xA;Dim C=New CheckBox With{.Parent=Me}&#xA;End Class&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;vbc.exe *.vb /main:F /imports:System.Windows.Forms&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It's a full code and command line for compiling and running it.&lt;br&gt;&#xA;&lt;code&gt;/main:F /imports:System.Windows.Forms&lt;/code&gt; takes more than a half of program weight.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;But what if I use VB.NET WinForms?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I do not have any explicitly generated files (like I do have in C#) I do not need any command line updates and I have that imports by default. So I'll get just 67 instead of 104?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;I see it in such way&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Some-Lang and Some-Lang Winfroms are different languages&lt;/li&gt;&#xA;&lt;li&gt;If form designer is not used and &lt;code&gt;designer&lt;/code&gt; file should be deleted, only code is counted.&lt;/li&gt;&#xA;&lt;li&gt;If form designer is used, size of &lt;code&gt;designer&lt;/code&gt; file should be added.&lt;/li&gt;&#xA;&lt;li&gt;All other files and settings except startup form name are kept unchanged and are not counted.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;But:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What if they are not unchanged?&lt;/li&gt;&#xA;&lt;li&gt;What if there are some changes in progect settings?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="32091" LastEditorUserId="32091" LastEditDate="2017-02-27T15:37:31.340" LastActivityDate="2017-02-27T15:37:31.340" Title="Strange byte count for winforms" Tags="|discussion|code-golf|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11651" PostTypeId="2" ParentId="2140" CreationDate="2017-02-26T22:23:31.917" Score="0" Body="&lt;p&gt;&lt;strong&gt;Penrose Triangle Codegolf&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Penrose triangle, also known as the Penrose tribar, or the impossible tribar, is an impossible object. - &lt;a href=&quot;https://en.wikipedia.org/wiki/Penrose_triangle&quot; rel=&quot;nofollow noreferrer&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal in this challenge is to display a Penrose triangle in the fewest bytes possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You must display the Penrose Triangle digitally after generating it.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Good luck and have fun!&lt;/p&gt;&#xA;" OwnerUserId="65989" LastEditorUserId="65989" LastEditDate="2017-02-27T11:29:23.353" LastActivityDate="2017-02-27T11:29:23.353" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11652" PostTypeId="2" ParentId="11650" CreationDate="2017-02-26T22:25:30.733" Score="3" Body="&lt;p&gt;You must count the entire source code needed to produce the intended result. In the case of WinForms projects, that usually means &lt;code&gt;Form.vb&lt;/code&gt; and &lt;code&gt;Form.Designer.vb&lt;/code&gt; (or the equivalents for C#). However, you can get away without including the auto-generated Designer code by implementing it in the form (like the second example does). In addition, you need to include the bytes for extra command-line switches compared to the standard invocation. I'm not really clear on what qualifies as the standard invocation for VB.NET and C#, so I'll leave it to others to determine/clarify what it is.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2017-02-26T22:31:33.507" LastActivityDate="2017-02-26T22:31:33.507" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11653" PostTypeId="2" ParentId="2140" CreationDate="2017-02-27T01:53:03.753" Score="1" Body="&lt;h1&gt;Build the Chain Quine&lt;/h1&gt;&#xA;&lt;p&gt;This is an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; puzzle.&lt;/p&gt;&#xA;&lt;p&gt;Each person will write a program that is &lt;em&gt;not&lt;/em&gt; a true Quine but does output its source when given the source of the last program as input.  If anything else is input your program may do whatever you wish (undefined behavior) as long as it does &lt;em&gt;not&lt;/em&gt; print the source code.  The first program will be a true Quine.&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; rules apply&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may not write a submission in a language that has already been used&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may not answer twice in a row&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Goal&lt;/h1&gt;&#xA;&lt;p&gt;The goal is to have as many valid links in the chain as possible.&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&lt;p&gt;This is a little sparse because I am still in the brain-storming phase of development.  I just wanted to write this down so I wont forget it and, of course, to get feedback.  I am not even really set on a winning criterion yet.  If you have any ideas/suggestions I am really excited to hear them (thats why I put it in the sandbox).&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-21T23:36:37.143" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11654" PostTypeId="1" CreationDate="2017-02-27T08:53:36.917" Score="2" ViewCount="140" Body="&lt;p&gt;This is a followup of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11541/31516&quot;&gt;this meta post&lt;/a&gt; about Wolfram|Alpha, but it is probably relevant for other &quot;languages&quot; as well. There seems to be a consensus that Wolfram|Alpha &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11602/31516&quot;&gt;is not a programming language&lt;/a&gt; +19/-1 at the time I'm writing this. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question is, should anything be done with answers that use Wolfram|Alpha (or other &quot;languages&quot; where this might be relevant)? &lt;/p&gt;&#xA;" OwnerUserId="31516" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2017-02-27T19:43:41.060" Title="How do we treat old answers in &quot;languages&quot; that aren't real languages?" Tags="|discussion|policy|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11655" PostTypeId="2" ParentId="11650" CreationDate="2017-02-27T08:56:18.720" Score="0" Body="&lt;p&gt;If your SomeLang Winforms project can't be compiled without a &lt;code&gt;.somelangproj&lt;/code&gt; file, you must count the project file towards the length. This means that in practice there is never any point to claiming SomeLang Winforms as a separate language: it is cheaper to use the SomeLang compiler with some long command-line arguments than to include the project file and compile with MSBuild.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-02-27T08:56:18.720" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="11657" PostTypeId="2" ParentId="11654" CreationDate="2017-02-27T15:38:40.030" Score="-3" Body="&lt;h2&gt;Nothing&lt;/h2&gt;&#xA;&lt;p&gt;First of all, there is no such thing as &amp;quot;definitive rule&amp;quot; here (aside the SE wide ones), only consensuses exist. Consensuses are agreements of the majority. The majority can however change its mind on certain topic, and while improbable, something such as W|A might become accepted as answer in the future.&lt;/p&gt;&#xA;&lt;p&gt;Based on this, I think we should keep them where, and as, they are.&#xA;Flagging and deleting new ones, sure. But I cannot think of any law that applies retroactively, and our consensuses shouldn't either.&lt;/p&gt;&#xA;" OwnerUserId="56245" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-27T16:35:03.240" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11659" PostTypeId="2" ParentId="11644" CreationDate="2017-02-27T17:42:10.953" Score="4" Body="&lt;h1&gt;You can read negative spaces.&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt;: using command 20 on a value &amp;gt;= 0 counts as reading your source code.&lt;/p&gt;&#xA;&lt;p&gt;Del|m|t puts the program's executable source code in the storage, starting from index 0. That means only non-negative storage spaces count as source code, as the negative ones do not store characters of the source code.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-27T17:42:10.953" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11660" PostTypeId="2" ParentId="11654" CreationDate="2017-02-27T19:43:41.060" Score="7" Body="&lt;p&gt;I don't see much benefit to keeping non-answers around. The confusion which it generates is, however, an obvious downside.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Similarly, I don't see much downside to deleting them. With respect to the argument that it's retrospective application of policy, I think we have to distinguish two cases. There are the really old answers: since there's no loss of rep from votes from more than three months ago, it's not really a hardship to the author. And there are very recent answers, with respect to which there is no retrospective application of policy but merely a clarification that the existing policy meant what it said.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Summing up, I think that the case of deleting such answers far exceeds the case against.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-02-27T19:43:41.060" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11661" PostTypeId="2" ParentId="2447" CreationDate="2017-02-27T19:45:01.943" Score="13" Body="&lt;h1&gt;Programs may write output to the clipboard&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Complementing the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11522/12012&quot;&gt;programs may take input from the clipboard&lt;/a&gt; proposal.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2017-02-27T19:45:01.943" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11662" PostTypeId="2" ParentId="2140" CreationDate="2017-02-28T14:35:30.163" Score="0" Body="&lt;h1&gt;Schedule my tasks&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;algorithm&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Intro&lt;/h2&gt;&#xA;&lt;p&gt;Inverse challenge to &lt;strong&gt;Unschedule my tasks&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I don't have a scheduler that uses priority scheduling on my PC but i want one. I have several tasks which all start at &lt;code&gt;t=0&lt;/code&gt; and each has a priority and a period time. So your task is to schedule my tasks.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;The input is a string including the different tasks, the priority and the period time of each task. We give the tasks uppercase letters from &lt;code&gt;A...Z&lt;/code&gt;, where the amount of different tasks &lt;code&gt;k&lt;/code&gt; is given as &lt;code&gt;0&amp;lt;k&amp;lt;27&lt;/code&gt;. If one tasks is chosen, it will need one time stamp long to finish and will start after it's period time &lt;code&gt;T&lt;/code&gt; again. The input has the format &lt;code&gt;[task name] [priority] [period time]&lt;/code&gt; with one task per line.&#xA;Example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A 2 7&#xA;B 1 2&#xA;C 3 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;So for the input&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A 2 7&#xA;B 1 2&#xA;C 3 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;you should output (only the last line):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A      A      A      A      A      A      A&#xA;B B B B B B B B B B B B B B B B B B B B B B&#xA;C    C    C    C    C    C    C    C    C&#xA;_____________________________________________&#xA;BABCBCBAB BCB BABCB BABCBCB BABCB BABCB BCBA&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;All tasks will always start at t=0&lt;/li&gt;&#xA;&lt;li&gt;If multiple tasks are ready to run, the one with the lower priority will run first, the other one will move one slot to the right&lt;/li&gt;&#xA;&lt;li&gt;The priority of one task is always the same, so no dynamic priorities will be used&lt;/li&gt;&#xA;&lt;li&gt;The processor will never have to run at 100%, or as formula: &lt;code&gt;1/TA + 1/TB + ... + 1/Tk &amp;lt; 1&lt;/code&gt;. In the example it's &lt;code&gt;1/7 + 1/2 + 1/5 = 0.84 &amp;lt; 1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;If there are multiple solutions, output only one of them&lt;/li&gt;&#xA;&lt;li&gt;The output string has to show every task at least 3 times, but the the output has to be finite&lt;/li&gt;&#xA;&lt;li&gt;Priority and period time are unsigned integers in the range &lt;code&gt;0&amp;lt;x&amp;lt;50&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;in:&#xA;A 1 3&#xA;out:&#xA;A  A  A  A&#xA;&#xA;in:&#xA;A 3 6&#xA;C 1 6&#xA;B 2 6&#xA;out:&#xA;CBA   CBA   CBA   CBA   CBA   CBA   CBA   CBA&#xA;&#xA;in:&#xA;A 1 7&#xA;B 2 4&#xA;C 3 5&#xA;D 4 14&#xA;E 5 9&#xA;out: &#xA;//A      A      A      A      A      A&#xA;//B   B   B   B   B   B   B   B   B   B&#xA;//C    C    C    C    C    C    C    C&#xA;//D             D             D&#xA;//E        E        E        E        E&#xA;  ABCDBCEABEC B ACBDE BAC BC EABCDB  ABCE&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="29520" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-02-28T14:35:30.163" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11664" PostTypeId="2" ParentId="2140" CreationDate="2017-02-28T17:51:11.387" Score="0" Body="&lt;h1&gt;Creative Title about the Moser-de Bruijn&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Calculate the &lt;a href=&quot;https://oeis.org/A000695&quot; rel=&quot;nofollow noreferrer&quot;&gt;Moser-de Bruijn (A000695)&lt;/a&gt; sequence for all integers up to the input value N.&lt;/p&gt;&#xA;&lt;p&gt;Each term of the sequence is defined as the sum of distinct powers of four arranged in ascending order. This means in base 4 every number of the sequence only has ones or zeroes.&lt;/p&gt;&#xA;&lt;p&gt;You are to print a list of the sequence where all values are less than N. Output is to be separated by either commas, tabs, or spaces. Trailing/Leading commas or whitespace are not permitted. having a comma followed by whitespace is allowed, but the reverse is not. You must use standard output for your language. You are to take input from your language's standard input. Exclude the sequence's first term of zero as it isn't relevant to the game's rules. You may assume the input will always be a positive non-zero integer.&lt;/p&gt;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;5  =&amp;gt; 1,4&#xA;6  =&amp;gt; 1 4 5&#xA;22 =&amp;gt; 1, 4, 5, 16, 17, 20, 21&#xA;1105 =&amp;gt; 1, 4, 5, 16, 17, 20, 21, 64, 65, 68, 69, 80, 81, 84, 85, 256, 257, 260, 261, 272, 273, 276, 277, 320, 321, 324, 325, 336, 337, 340, 341, 1024, 1025, 1028, 1029, 1040, 1041, 1044, 1045, 1088, 1089, 1092, 1093, 1104&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Sandbox Notes&lt;/h2&gt;&#xA;&lt;p&gt;This is my first challenge, so input would be greatly appreciated!&lt;/p&gt;&#xA;" OwnerUserId="63671" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-05T21:26:10.467" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11667" PostTypeId="1" AcceptedAnswerId="11668" CreationDate="2017-03-01T02:54:07.067" Score="1" ViewCount="63" Body="&lt;p&gt;Asking for a friend...&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;For &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world&quot;&gt;&amp;quot;Hello, World!&amp;quot;&lt;/a&gt;, you can save an extra 1 byte by using &lt;code&gt;copy(&quot;Hello, World&quot;)&lt;/code&gt;. However, I am confused on if it's allowed for your output to be the clipboard.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question's rules say:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;The program must take no input, and print &lt;code&gt;Hello, World!&lt;/code&gt; to STDOUT (this exact byte stream, including capitalization and punctuation) plus an optional trailing newline, and nothing else.&lt;/li&gt;&#xA;  &lt;li&gt;The program must not write anything to STDERR.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="46517" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.337" LastActivityDate="2017-03-01T14:50:06.027" Title="Are we allowed to copy the output of the code to the clipboard?" Tags="|discussion|output|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11668" PostTypeId="2" ParentId="11667" CreationDate="2017-03-01T04:13:37.337" Score="7" Body="&lt;h3&gt;In general&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I've proposed &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11661/12012&quot;&gt;Programs may write output to the clipboard&lt;/a&gt; yesterday and it has received a mixed response (&lt;strong&gt;+2/-4&lt;/strong&gt;) so far. At this point, writing to the clipboard is not a valid form of output by default, and it might very well never become one.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Regarding &lt;a href=&quot;https://codegolf.stackexchange.com/q/55422/12012&quot;&gt;“Hello, World!”&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The challenge states very clearly that the output must be printed to STDOUT, so whatever the default may be, the clipboard is not a valid output format for this challenge.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.477" LastActivityDate="2017-03-01T14:50:06.027" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11670" PostTypeId="2" ParentId="2140" CreationDate="2017-03-01T04:48:18.773" Score="0" Body="&lt;h1&gt;You Jelly?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this code challenge you are here to explain Jelly code for us simple-minded plebeians. To simplify things we are working in a restricted subset of Jelly.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Details&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input will be a Jelly leading constant chain matching the regex `/([01H+] )+/. For full explanation, see the &lt;a href=&quot;https://github.com/DennisMitchell/jelly/wiki/Tutorial&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly tutorial&lt;/a&gt;, but as a quick summary each symbol in Jelly represents a function with an arity of 0 (is a &lt;em&gt;nilad&lt;/em&gt;), 1 (a &lt;em&gt;monad&lt;/em&gt;) or 2 (a &lt;em&gt;dyad&lt;/em&gt;). A &lt;em&gt;chain&lt;/em&gt; is a sequence of symbols. A &lt;em&gt;leading constant chain&lt;/em&gt; is a chain whose first element is a nilad and is followed by any number of subsequences that are any of a monad, a dyad followed by a nilad or a nilad followed by a dyad. Jelly is parsed left to right.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As implied by the regex restriction, the source consists of four symbols: &lt;code&gt;0&lt;/code&gt;, a nilad whose value is the integer 0; 1, a nilad whose value is the integer 1; &lt;code&gt;H&lt;/code&gt;, a monad whose value is the function &lt;code&gt;x -&amp;gt; x / 2&lt;/code&gt;; or &lt;code&gt;+&lt;/code&gt;, a dyad whose value is the function &lt;code&gt;x, y -&amp;gt; x + y&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;A leading constant chain over the above symbols is evaluated into an equivalent infix formula by the following rules (where &lt;code&gt;$d&lt;/code&gt; represents 1 or 2).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;eval(&quot;$d $chain&quot;) = eval_i(&quot;$chain&quot;, &quot;$d&quot;)&#xA;eval_i(&quot;&quot;           , expr) = expr&#xA;eval_i(&quot;+ $d $chain&quot;, expr) = eval_i(&quot;$chain&quot;, &quot;($expr + $d)&quot;)&#xA;eval_i(&quot;$d + $chain&quot;, expr) = eval_i(&quot;$chain&quot;, &quot;($d + $expr)&quot;)&#xA;eval_i(&quot;H $chain&quot;   , expr) = eval_i(&quot;$chain&quot;, &quot;($d / 2)&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your task is to take a Jelly program under the following restrictions (only the three symbols above used, always separated by exactly a single space and forming a leading constant chain) and to output a string representing a traditional infix-notation representation of the input. The output of your solution may be equivalent the specified output up to whitespace and PEMDAS rules (i.e. parentheses may be dropped when it does not change the meaning).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Jelly Program -&amp;gt;      Infix Notation&#xA;1             -&amp;gt;                   1&#xA;0 H           -&amp;gt;             (0 / 2)&#xA;1 0 +         -&amp;gt;             (0 + 1)&#xA;1 + 0         -&amp;gt;             (1 + 0)&#xA;0 H 1 +       -&amp;gt;       (1 + (0 / 2))&#xA;1 1 + H       -&amp;gt;       ((1 + 1) / 2)&#xA;1 0 + + 0     -&amp;gt;       ((0 + 1) + 0)&#xA;1 0 + H + 0   -&amp;gt; (((0 + 1) / 2) + 0)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Judging&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, so lowest byte count wins. Standard loopholes are disallowed. Standard input-output formats (function-or-program) are in play.&lt;/p&gt;&#xA;" OwnerUserId="4420" LastActivityDate="2017-03-01T04:48:18.773" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11672" PostTypeId="1" CreationDate="2017-03-01T11:34:55.140" Score="1" ViewCount="82" Body="&lt;p&gt;I am new to this SE and don't know if this fits theme of this website. That is why first posting in meta site. Feel free to suggest some other SE if applicable. Sorry for the long post. But this much info is needed to explain !&lt;/p&gt;&#xA;&lt;h3&gt;Background:&lt;/h3&gt;&#xA;&lt;p&gt;I am student and working in one science institute. Our university has bunch of transport services which runs on daily bases based on pre-existing timings.&lt;/p&gt;&#xA;&lt;p&gt;For example :&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;On Mon to Sat: 07:00, 11:00, 16:00 ... &#xA;On Sundays: 09:30, 12:30, 21:00 ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;There can be any number of trips per day or even each day can have different trips.&lt;/p&gt;&#xA;&lt;h3&gt;Task:&lt;/h3&gt;&#xA;&lt;p&gt;Whenever I run this program, it should give me back next trip when we have input in following form&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;monday = { &amp;quot;07:00&amp;quot;, &amp;quot;11:00&amp;quot;, &amp;quot;16:00&amp;quot;,...}&#xA;sunday = { &amp;quot;09:30&amp;quot;, &amp;quot;12:30&amp;quot;, &amp;quot;21:00&amp;quot;, ...}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For example :&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;run() #On Monday 09:00&#xA;&amp;gt;&amp;gt;Output : 11:00 &#xA;run() #On Sunday 13:30&#xA;&amp;gt;&amp;gt;Output: 21:00&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Initially I thought it is very easy job. But unfortunately, my university added trips post midnight ,&#xA;For example&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;monday =  { &amp;quot;07:00&amp;quot;, &amp;quot;11:00&amp;quot;, &amp;quot;16:00&amp;quot;,..., &amp;quot;01:30&amp;quot;}&#xA;sunday = { &amp;quot;09:30&amp;quot;, &amp;quot;12:30&amp;quot;, &amp;quot;21:00&amp;quot;, ..., &amp;quot;02:00&amp;quot;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here trip mentioned in Monday list &lt;code&gt;&amp;quot;01:30&amp;quot;&lt;/code&gt; is actually on Tuesday. This broke my existing algorithm. So currently I am using following algorithm,&lt;/p&gt;&#xA;&lt;p&gt;Step1: Distribute each input into 3 parts : first trip, trips after that and trips after midnight&#xA;e.g&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;monday =  { &amp;quot;07:00&amp;quot;, &amp;quot;11:00&amp;quot;, &amp;quot;16:00&amp;quot;,..., &amp;quot;01:30&amp;quot;}&#xA;monday_first = {&amp;quot;07:00&amp;quot;}&#xA;monday_rest = {&amp;quot;11:00&amp;quot;, &amp;quot;16:00&amp;quot;...}&#xA;monday_post_midnight = {&amp;quot;01:30&amp;quot;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Step2 : Combine lists from yesterday's midnight, first trip and rest of the trips&lt;/p&gt;&#xA;&lt;p&gt;e.g.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;new_monday_trip = sunday_midnight + monday_first + monday_rest&#xA;new_monday_trip = {&amp;quot;02:00&amp;quot;, &amp;quot;07:00&amp;quot;,&amp;quot;11:00&amp;quot;, &amp;quot;16:00&amp;quot;...}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Step3: Check current time and get next trip from list. If it is present then show it to user or get first item from next day.&lt;/p&gt;&#xA;&lt;p&gt;I was wondering if is there any better way.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Note: Each input will be always in chronological order&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Example Input Set&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;monday to saturday =  { &amp;quot;07:00&amp;quot;, &amp;quot;11:00&amp;quot;, &amp;quot;12:30&amp;quot;, &amp;quot;16:00&amp;quot;, &amp;quot;21:00&amp;quot;, &amp;quot;00:00&amp;quot;, &amp;quot;01:30&amp;quot;}&#xA;sunday = { &amp;quot;09:30&amp;quot;, &amp;quot;12:30&amp;quot;, &amp;quot;21:00&amp;quot;, &amp;quot;00:30&amp;quot;,&amp;quot;01:30&amp;quot;, &amp;quot;02:00&amp;quot;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="66186" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-01T12:33:29.033" Title="Is this valid for this SE site?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11673" PostTypeId="2" ParentId="11672" CreationDate="2017-03-01T12:33:29.033" Score="3" Body="&lt;p&gt;You can get a good idea for what's on topic on an established Stack Exchange site (i.e. one which is old enough to have settled the initial questions about what's in scope) by looking at &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;/help/on-topic&lt;/a&gt;. Here you will see that the stack is for programming contests.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your code works and you want to know whether there's a better way of doing it (which I understand to be the case) then I think that the best fit for your question would be &lt;a href=&quot;https://codereview.stackexchange.com/help/on-topic&quot;&gt;codereview.stackexchange.com&lt;/a&gt;. There you should post the code (rather than the algorithm) with the explanation of the goal, the example input, and the specific request for feedback on whether there's a better way of handling the wrap around midnight.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2017-04-13T12:41:04.080" LastActivityDate="2017-03-01T12:33:29.033" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11674" PostTypeId="1" CreationDate="2017-03-01T16:29:55.267" Score="0" ViewCount="48" Body="&lt;p&gt;For the Friday the 13th challenge, I have some code that requires an import, but results in an unnamed function when golfed:&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(import '[java.time LocalDate DayOfWeek])&#xA;&#xA;(defn count-friday-13ths [year]&#xA;    CODE HERE)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;When I compact this, it looks like it may be unacceptable:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(import '[java.time LocalDate DayOfWeek])#(CODE HERE)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The anonymous function at the end isn't named (obviously), so there isn't an obvious way to call it. To use it, parenthesis need to be placed around the function, with the argument, after the import:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(import '[java.time LocalDate DayOfWeek])(#(CODE HERE) the-year)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Is this acceptable?&lt;/p&gt;&#xA;" OwnerUserId="31224" LastEditorUserId="31224" LastEditDate="2017-03-01T16:39:07.063" LastActivityDate="2017-03-01T16:39:07.063" Title="Rules for importing when the result is an anonymous function" Tags="|discussion|" AnswerCount="0" CommentCount="1" ClosedDate="2017-03-02T15:13:09.113" ContentLicense="CC BY-SA 3.0" />
  <row Id="11679" PostTypeId="2" ParentId="9619" CreationDate="2017-03-02T05:00:41.397" Score="5" Body="&lt;h2&gt;Brainf*ck&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You should golf in BF for the same reason you should golf in Java - it's probably not going to beat the golfing languages, but our community has decided &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/286/61384&quot;&gt;time&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8934/61384&quot;&gt;time again&lt;/a&gt; that that doesn't matter to us. Writing short programs in BF is a challenge, but, unlike Java, it's not because you're bogged down by verbosity. Golfing in Java can feel frustrating because you always have to write all this boilerplate. In BF, on the other hand, there is none of that. Anything you'd want to do is one byte.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another thing I like about BF is that it has a very low barrier to entry. It only has 8 commands, so it's quite easy to learn. You don't have to memorize all the builtins to compete. When golfing in CJam, Mathematica, or Jelly, for example, your submission could be crippled if you didn't know about one key builtin that solves a huge part of the problem. In BF, everything is done from scratch, which means nothing is trivial. Even the &lt;a href=&quot;https://codegolf.stackexchange.com/a/163590/61384&quot;&gt;golfed Hello World program&lt;/a&gt; is 72 bytes, with multiple potential bounties awaiting anyone who can improve it. BF is a language that is challenging to golf in, but that means the solution is almost never trivial, and there's always room for improvement.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Besides, BF can sometimes offer clever solutions. It's easy to manipulate character byte values as numbers. And, of course, it's really, &lt;em&gt;really&lt;/em&gt; good at while loops.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="61384" LastEditDate="2019-08-19T00:01:49.597" LastActivityDate="2019-08-19T00:01:49.597" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="11682" PostTypeId="2" ParentId="2140" CreationDate="2017-03-02T15:39:05.880" Score="-2" Body="&lt;h2&gt;You should log out &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;In the programming language of your choice, log off the currently logged in user.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rules and clarifications:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;After running the program the user should be taken to the login screen of the appropriate operating system, where they can re-login&lt;/li&gt;&#xA;&lt;li&gt;You can assume that no programs are running that would block the logout process with popups&lt;/li&gt;&#xA;&lt;li&gt;Solutions that just restart the computer to get to the login page are not allowed&lt;/li&gt;&#xA;&lt;li&gt;Always specify which OS / architecture / environment your code runs on&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are forbidden&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, so the lowest amount of bytes wins&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Sandbox questions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'm unsure how to discourage answers where logout is achieved by expecting the code to be called from bash using &quot;exec&quot;, or other solutions where logout is not actually initiated by the program, but by the caller process&lt;/li&gt;&#xA;&lt;li&gt;Do we have a tag for architecture dependent questions?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8732" LastEditorUserId="8732" LastEditDate="2017-03-02T15:55:36.003" LastActivityDate="2017-03-02T15:55:36.003" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="11684" PostTypeId="1" CreationDate="2017-03-02T16:40:02.237" Score="0" ViewCount="86" Body="&lt;p&gt;This is different then &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/273/on-interactive-answers-and-other-special-conditions&quot;&gt;this&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am writing a new code-golf language and am thinking about making two modes. One would be stack and other tacit. However you would have to specify what one you want to use. If I require one flag or another would it still be counted in the byte count? &lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="46271" LastEditDate="2017-03-28T21:36:37.857" LastActivityDate="2017-03-28T21:36:37.857" Title="How do mandatory flags in new languages get counted" Tags="|discussion|scoring|" AnswerCount="2" CommentCount="0" ClosedDate="2017-03-02T16:53:00.247" ContentLicense="CC BY-SA 3.0" />
  <row Id="11685" PostTypeId="2" ParentId="11684" CreationDate="2017-03-02T16:49:33.313" Score="-3" Body="&lt;h1&gt;Yes Count it!&lt;/h1&gt;&#xA;&lt;p&gt;Even if it is mandatory then you will be posting snippets without it&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-02T16:49:33.313" CommentCount="0" CommunityOwnedDate="2017-03-02T16:49:33.313" ContentLicense="CC BY-SA 3.0" />
  <row Id="11686" PostTypeId="2" ParentId="11684" CreationDate="2017-03-02T16:50:57.490" Score="-3" Body="&lt;h1&gt;No don't count it!&lt;/h1&gt;&#xA;&lt;p&gt;It is mandatory and you could just make 2 versions to avoid the rule&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-02T16:50:57.490" CommentCount="1" CommunityOwnedDate="2017-03-02T16:50:57.490" ContentLicense="CC BY-SA 3.0" />
  <row Id="11687" PostTypeId="1" CreationDate="2017-03-02T20:07:37.820" Score="22" ViewCount="541" Body="&lt;p&gt;I was hoping to answer a question using a particular cellular automaton that was defined 17 years ago (before the question was asked) but for which I am unable to find a free interpreter on the internet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I made an implementation that followed the specifications formally laid out in the paper that introduced this cellular automata would I mark my answer as non-competing?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It has been agreed upon that answers languages made after a challenge must be marked as non-competing.  It is also agreed upon that a language is dependent on its implementation and not its specification.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The implication of these two existing rules is that I would.  However the intention of the former is to keep people from making up new languages to beat a challenge while that is certainly not what is going on here.  There was no way that either myself or the person that designed this language could have had any knowledge of a PPCG challenge 17 years ago.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Are answers in languages that were specified prior to a challenge and had no extant implementations at the time the question was asked considered competing?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-03-02T20:26:06.297" LastActivityDate="2017-03-02T22:44:45.770" Title="Old Languages with new implementations" Tags="|discussion|" AnswerCount="2" CommentCount="3" FavoriteCount="0" ClosedDate="2017-06-19T10:33:00.923" ContentLicense="CC BY-SA 3.0" />
  <row Id="11688" PostTypeId="2" ParentId="11687" CreationDate="2017-03-02T20:42:47.907" Score="11" Body="&lt;h1&gt;As the rules currently stand, &lt;em&gt;no&lt;/em&gt;.&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7833/46271&quot;&gt;From Doorknob's answer about non-competing answers:&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;The interpreter(/compiler) defines the language&lt;/h2&gt;&#xA;&lt;p&gt;A spec is not a language. For the purposes of PPCG, a programming language is defined by its implementation.&lt;/p&gt;&#xA;&lt;p&gt;If the interpreter is fixed after the challenge is posted, the answer must be marked as non-competing—just like any other answer in a language that was created after the challenge&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&amp;quot;A spec is not a language.&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;This is pretty much it. The spec can exist, but it's not a language (by our definition) until it's implemented.  Your answer would have to be non-competing. (However, as Martin noted, this policy is doing a bit more harm than good)&lt;/p&gt;&#xA;&lt;p&gt;I personally think that these non-competing rules should be tweaked a little bit, but that's its own meta post.  Under the current rules, that's not allowed.&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-02T20:42:47.907" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11689" PostTypeId="2" ParentId="11687" CreationDate="2017-03-02T20:46:13.117" Score="4" Body="&lt;h1&gt;We should make an exception allowing this.&lt;/h1&gt;&#xA;&lt;p&gt;The idea that you can't use languages created after a challenge was posted is to prevent people from creating languages specifically to solve a challenge. If you write an implementation of a language that follows the language spec exactly, then no one can say that it was designed for the purpose of solving the challenge, so yes, you should be able to use that implementation.&lt;/p&gt;&#xA;&lt;p&gt;Technically we consider that the implementation, not the specification, defines a language, but if the implementation matches the specification we should consider the creation of the spec when determining when a language was created.&lt;/p&gt;&#xA;&lt;p&gt;Note that if there turn out to be any inconsistencies between the spec and implementation, or parts of the spec that are unclear, you cannot use these features in any challenge as they would be considered to post-date the challenge, similarly to our way of treating a language which was created before, but last updated after, the challenge. The specification is the &amp;quot;Version 1&amp;quot; of a language, in that sense.&lt;/p&gt;&#xA;" OwnerUserId="60042" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-02T22:44:45.770" CommentCount="3" CommunityOwnedDate="2017-03-02T20:46:13.117" ContentLicense="CC BY-SA 3.0" />
  <row Id="11691" PostTypeId="2" ParentId="2447" CreationDate="2017-03-03T11:07:38.293" Score="10" Body="&lt;h1&gt;BASIC and related languages may take input via DATA / READ&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In various dialects of BASIC, you can include data in the source code by using the &lt;code&gt;DATA&lt;/code&gt; statement:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;DATA abc, xyz&#xA;DATA 2, 3, 5, 7, 11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;(Examples are written in QBasic because that's what I know.)&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You access this data by using &lt;code&gt;READ&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;READ str1$, str2$&#xA;FOR i = 1 TO 5&#xA;  READ primes(i)&#xA;NEXT&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This input method is idiomatic for BASIC.&lt;/p&gt;&#xA;" OwnerUserId="16766" LastActivityDate="2017-03-03T11:07:38.293" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="11692" PostTypeId="1" CreationDate="2017-03-03T14:25:10.423" Score="1" ViewCount="122" Body="&lt;p&gt;Here's an &lt;a href=&quot;https://stackoverflow.com/questions/335311/static-initializer-in-java&quot;&gt;example&lt;/a&gt; of a static initializer in Java.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is possible to launch a program without a main method in Java using a static initializer and it's way shorter. It doesn't work on ideone.com but in my IDE, my code in static is executed even if I have no main. The JVM throws an exception when you do that (since there's no main method) but it happens after the code is executed and you can escape it using &lt;code&gt;System.exit(0);&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's a comparison in length:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;class P{public static void main(String[]a){}}&#xA;class P{static{System.exit(0);}}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Can I use it for my code golf ? Is it allowed ? Is it allowed to ommit the &lt;code&gt;System.exit&lt;/code&gt; statement and ignore the exception ? Thanks&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;EDIT&lt;/strong&gt;: I'm not able to reproduce the behavior I had in my IDE in command line. I was able to to this using IntelliJ. I don't know what command line IntelliJ is running. I will come back with a specific java version and a command line. Should of wait before posting, sorry.&lt;/p&gt;&#xA;" OwnerUserId="58453" LastEditorUserId="-1" LastEditDate="2017-05-23T11:33:45.987" LastActivityDate="2017-03-03T15:24:48.017" Title="Can I use static initializer in Java for code golf?" Tags="|discussion|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11693" PostTypeId="2" ParentId="11692" CreationDate="2017-03-03T15:14:54.893" Score="4" Body="&lt;h1&gt;Yes with conditions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I believe this is only valid in Java 6 since Java 7 checks for a main method before initialization (I don't know if things changed in Java 8+). You'll get something like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Error: Main method not found in class S, please define the main method as:&#xA;   public static void main(String[] args)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Because of this you'd need to make sure all of your answers using this method specify Java 6 specifically.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally it's worth noting that an answer using this method cannot take input from program arguments and cannot make use of return statements for output. You'll be restricted to &lt;code&gt;System.out&lt;/code&gt; for the most part.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;More Information&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you're running the above code as a Java Applet you don't need a main method and can even work in the constructor rather than just a static initializer. This method can be used in Java 7 (&lt;a href=&quot;https://codegolf.stackexchange.com/a/111221/51785&quot;&gt;example&lt;/a&gt;). This can be achieved with an IDE's &quot;Run As Java Applet&quot; or by disabling the security manager and using &lt;a href=&quot;http://docs.oracle.com/javase/7/docs/technotes/tools/windows/appletviewer.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;appletviewer&lt;/a&gt;, which comes with the JDK (unless you're still able to view applets in web browsers. I don't think chrome allows this).&lt;/p&gt;&#xA;" OwnerUserId="51785" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2017-03-03T15:24:48.017" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11694" PostTypeId="1" CreationDate="2017-03-03T15:21:04.003" Score="4" ViewCount="174" Body="&lt;p&gt;I'm curious whether or not the HTML required to run applets should be included in byte count. Also what's the current standard for counting bytes with applets? In Eclipse if I recall correctly you can run applets without HTML, however in other IDE's you need the HTML.&lt;/p&gt;&#xA;" OwnerUserId="63671" LastActivityDate="2017-03-03T16:38:22.283" Title="Should Java Applets include HTML in the byte count?" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11695" PostTypeId="2" ParentId="11694" CreationDate="2017-03-03T16:38:22.283" Score="7" Body="&lt;h3&gt;We define languages by their implementation here.&lt;/h3&gt;&#xA;&lt;p&gt;So as long as there is an IDE or whatever other interpreter that runs your applet without wrapping it in HTML, you are totally fine.&lt;br /&gt;&#xA;Of course you have to specify in  your submission which setup your code requires to be run successfully.&lt;/p&gt;&#xA;" OwnerUserId="49110" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-03T16:38:22.283" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11698" PostTypeId="2" ParentId="2140" CreationDate="2017-03-04T09:47:27.567" Score="1" Body="&lt;h1&gt;The Mass Murderers of Josephus&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Everyone knows the Josephus challenge and its setup: you arrange &lt;code&gt;n&lt;/code&gt; people in a circle, and the first person kills the second, and from then on the first alive person to the right of the previous &quot;killer&quot; kills the next alive person to their right. For example, with four people:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  1&#xA;4   2    (4 people in a loop)&#xA;  3&#xA;&#xA;  1&#xA;4        (1 kills 2)&#xA;  3&#xA;&#xA;  1&#xA;         (3 is closest to the right of the previous killer 1,&#xA;  3       and kills 4, who is to the right)&#xA;&#xA;  1      (1 is closest to the right of the previous killer 3,&#xA;          and kills 3, who is to the right)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The last remaining person is &lt;code&gt;1&lt;/code&gt;, in this case.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task, however, is to find the most murderous of these people - or whoever killed the most people. In the above example, the &quot;murderer&quot; is &lt;code&gt;1&lt;/code&gt;, who killed 2 people: &lt;code&gt;2&lt;/code&gt; and &lt;code&gt;3&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a bigger example, of 10 people (this is a line of 10 people, right wraps around to the left):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;PEOPLE ALIVE  | KILL TALLY&#xA;1 2 3 4 5 6 7 |&#xA;1   3 4 5 6 7 | 1: 1&#xA;1   3   5 6 7 | 1, 3: 1&#xA;1   3   5   7 | 1, 3, 5: 1&#xA;    3   5   7 | 1, 3, 5, 7: 1&#xA;    3       7 | 3: 2; 1, 5, 7: 1&#xA;            7 | 3, 7: 2; 1, 5: 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There's a tie for the person with the most kills: when a scenario like this arises, the answer is average of all the people with the most kills - in this case, it is &lt;code&gt;(3 + 7) / 2 = 5&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You must make a program or function that takes one input, the amount of people in the circle, and output the murderer (or the average of multiple murderers).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules and specs:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input will never be above &lt;code&gt;2^31 - 1&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The input is guaranteed to be a positive integer.&lt;/li&gt;&#xA;&lt;li&gt;Your program must work out &lt;code&gt;100&lt;/code&gt; within the timeframe of TIO (60 seconds). If you're not using TIO, provide an interpreter for me to test your program on (preferably an online one).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastActivityDate="2017-03-04T09:47:27.567" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11699" PostTypeId="1" CreationDate="2017-03-04T23:01:48.417" Score="8" ViewCount="125" Body="&lt;p&gt;When I was commenting on &lt;a href=&quot;https://codegolf.stackexchange.com/a/112003/60043&quot;&gt;this post by @GregMartin&lt;/a&gt;, I realized U+200B and U+200C characters had been inserted in my code, making it non-functional.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/q/170970&quot;&gt;This meta SE post&lt;/a&gt; states that those characters are inserted when 80 non-space characters are entered. However, this may be problematic on this site, as it deals with code and bytecounts. Removing the feature is not an option because it breaks formatting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can this formatting feature be changed, as suggested in the aforementioned meta post?&lt;/p&gt;&#xA;" OwnerUserId="60043" LastEditorUserId="68942" LastEditDate="2021-06-03T20:42:06.697" LastActivityDate="2021-06-03T20:42:06.697" Title="Change U+200B and U+200C to something else?" Tags="|feature-request|status-completed|comments|formatting|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11700" PostTypeId="2" ParentId="5243" CreationDate="2017-03-05T11:04:29.287" Score="3" Body="&lt;h1&gt;50 reputation &lt;a href=&quot;https://codegolf.stackexchange.com/q/55422/50239&quot;&gt;for an Hello World version&lt;/a&gt; that consist of a Google’s native client executable.&lt;/h1&gt;&#xA;&lt;p&gt;These are just elf files. but with special calling conventions.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the file should be less than 1000 bytes.&lt;/li&gt;&#xA;&lt;li&gt;the file should contains runnable code without modifications. So it must be a .nexe or a shared object.&lt;/li&gt;&#xA;&lt;li&gt;a +10 bonus if the elf file targets the armelv7 architecture &lt;em&gt;(provided google chrome should load it on chrome os for arm).&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="50239" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-05T11:04:29.287" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11704" PostTypeId="2" ParentId="5243" CreationDate="2017-03-06T18:26:53.167" Score="6" Body="&lt;h1&gt;500 rep for a shorter payload capable V quine&lt;/h1&gt;&#xA;&lt;p&gt;Currently in V, there are two important quines:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2i2i&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;is the shortest known quine, but not modifiable. And&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ñéÑ~&amp;quot;qpÿ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;is the shortest known trivially modifiable quine. This is because&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ñéÑ~&amp;quot;qp&amp;lt;CODE&amp;gt;ÿ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;pretty much anything you want can go in the place of &lt;em&gt;CODE&lt;/em&gt;, and it will still be a valid quine. You can see this on these answers:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/111209/31716&quot;&gt;https://codegolf.stackexchange.com/a/111209/31716&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/107032/31716&quot;&gt;https://codegolf.stackexchange.com/a/107032/31716&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Although these used a former version of the extensible quine, namely:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ñi&amp;lt;C-v&amp;gt;241&amp;lt;esc&amp;gt;&amp;quot;qpÿ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Either one could be easily modified to use this newer quine. Another good example is filling &lt;em&gt;CODE&lt;/em&gt; with 'l's should always work. I will award this bounty to the first user to find a shorter extensible quine. For the purpose of this bounty, &lt;em&gt;extensible&lt;/em&gt; means that any code you want to add to it will be recorded into some register and then pasted later, which is how the current solutions work (into register 'q' FWIW).&lt;/p&gt;&#xA;&lt;p&gt;For completeness sake, I have found several 8-byte solutions:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ñéÑ~&amp;quot;qpÿ&#xA;ñéÑ~&amp;quot;qpx&#xA;ñéÑ~&amp;quot;qðÿ&#xA;ñéÑ~&amp;quot;qðx&#xA;ñ&amp;quot;qpÁÑ~x&#xA;ñ&amp;quot;qpÁÑ~ÿ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And many more trivial modifications that aren't worth posting. If you'd like more explanation on any of these, or want more examples, feel free to ping me in &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;TNB&lt;/a&gt; or &lt;a href=&quot;http://chat.stackexchange.com/rooms/40448/vim-golf&quot;&gt;Vim-Golf&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-01T22:16:36.153" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11706" PostTypeId="2" ParentId="2140" CreationDate="2017-03-07T00:26:27.720" Score="0" Body="&lt;h2&gt;Lost in Space: Help me get back to civilisation&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your spaceship's radio receives a transmission from an unknown location:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;pre&gt;&lt;code&gt;To anyone who picks up this transmission, I need help!&#xA;My hyperdrive malfunctioned during a routine jump to &#xA;the PPCG Planet. I survived the drop from hyperspace,&#xA;but now my ship's positioning system is broken. And &#xA;worse, I can't seem to access Hyperdrives Stack&#xA;Exchange to fix it!&#xA;&#xA;I've tried to triangulate my position using local&#xA;satellites. I can send a 'ping' to them, and then the&#xA;satellite will report how long the ping took to reach&#xA;it. But the results don't make any sense! Some of the&#xA;satellites must be broken and are feeding me false&#xA;data...&#xA;&#xA;I've attached the read-out of all the satellites I&#xA;pinged to this transmission. Can you work out which&#xA;ones are faulty?&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;You examine the data that was attached to the transmission. Your spaceship's computer analyses the data and notes that it is a list of tuples, each tuple which contains:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The known position of a satellite as a coordinate pair;&lt;/li&gt;&#xA;&lt;li&gt;The distance from the lost spaceship that that satellite reported.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;A majority of satellite data will support the spaceship being at a certain location -- this is the correct location of the lost spaceship. Write a program or function that outputs this location.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Sample Inputs and Outputs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;todo&lt;/p&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-07T00:26:27.720" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11708" PostTypeId="2" ParentId="2140" CreationDate="2017-03-07T15:05:03.197" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/112874/66444&quot;&gt;Unary-binary trees&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66444" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2017-03-14T14:22:44.087" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11709" PostTypeId="2" ParentId="2140" CreationDate="2017-03-07T20:01:35.283" Score="0" Body="&lt;h1&gt;Battle of the Algorithms, Kruskal vs Prim&lt;/h1&gt;&#xA;&lt;p&gt;This will be a challenge similar to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; challenge.  There will be two threads each with a winner.&lt;/p&gt;&#xA;&lt;p&gt;This challenge is about &lt;a href=&quot;https://en.wikipedia.org/wiki/Minimum_spanning_tree&quot; rel=&quot;nofollow noreferrer&quot;&gt;minimum spanning trees&lt;/a&gt;.  I might include a introduction to the topic, but for now I am working under the assumption that you are at least vaguely familiar with the subject.&lt;/p&gt;&#xA;&lt;p&gt;Two of the most famous algorithms for finding a minimum spanning tree are &lt;a href=&quot;https://en.wikipedia.org/wiki/Kruskal%27s_algorithm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Kruskal's Algorithm&lt;/a&gt; and &lt;a href=&quot;https://en.wikipedia.org/wiki/Prim%27s_algorithm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Prim's Algorithm&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Explanation of the Algorithms to go here&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Now the question is &amp;quot;Which one is golfier&amp;quot;?&lt;/p&gt;&#xA;&lt;p&gt;In order to figure this out are going to implement each of these two algorithms in as many languages as possible.  Each algorithm will have its own thread where it can be implemented in as many languages as possible.  Each thread will act as a team scoring points for the algorithm in question.  For each language a point will be given to the team with the shorter implementation in that language.&lt;/p&gt;&#xA;&lt;p&gt;For example if the submissions look like this:&lt;/p&gt;&#xA;&lt;h3&gt;Kruskal&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Python, 136 bytes&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Bash, 215 bytes&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Brain-Flak, 3144 bytes&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Prim&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Python, 152 bytes&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Bash, 211 bytes&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Perl, 98 bytes&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Kruskal would score 2 points, one for having the shortest Python answer and one for the shortest Brain-Flak answer, and Prim would score 2 points one for having the shortest Bash answer and one for having the shortest Perl answer.&lt;/p&gt;&#xA;&lt;p&gt;At the end of the week two winners will be declared, these will be the two persons that scored the most points for each team.  Additionally a winning team will be announced.  You can compete for both teams.&lt;/p&gt;&#xA;&lt;h2&gt;Specifications&lt;/h2&gt;&#xA;&lt;p&gt;You will create a program or function that takes a graph in any reasonable form, implements one of the two algorithms and outputs the minimum spanning tree in any format that uniquely represents the spanning tree.&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;How can I make this clearer?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What is confusing?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Would this be fun?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-07T21:37:24.103" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11710" PostTypeId="1" CreationDate="2017-03-07T20:50:25.267" Score="25" ViewCount="680" Body="&lt;h3&gt;Tl;dr:  The minor improvements that takes an answer from 44 to 39 are often the most interesting and impressive feat. If you made the improvements, then it should be OK to post it as your answer.&lt;/h3&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;Note: This post is about site culture, not policy making.&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'll use &lt;a href=&quot;https://codegolf.stackexchange.com/users/36398/luis-mendo&quot;&gt;Luis Mendo&lt;/a&gt;'s comments on one of my most &lt;a href=&quot;https://codegolf.stackexchange.com/a/112218/31516&quot;&gt;recent posts&lt;/a&gt; as an example.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;I posted my &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/112218/2&quot;&gt;original answer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Luis Mendo commented and suggested a &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/112218/2&quot;&gt;&lt;strong&gt;different&lt;/strong&gt; approach&lt;/a&gt; that saved 5 bytes&lt;/li&gt;&#xA;&lt;li&gt;I found &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/112218/4&quot;&gt;an approach&lt;/a&gt; that saved another byte.&lt;/li&gt;&#xA;&lt;li&gt;Luis found another &lt;a href=&quot;https://codegolf.stackexchange.com/questions/112208/charlie-oscar-delta-echo/112218#comment273454_112218&quot;&gt;&lt;strong&gt;different&lt;/strong&gt; approach&lt;/a&gt; that saved 5 bytes&lt;/li&gt;&#xA;&lt;li&gt;Before I even responded, Luis found &lt;strong&gt;a &lt;em&gt;new&lt;/em&gt;&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/112208/charlie-oscar-delta-echo/112218#comment273454_112218&quot;&gt;different approach&lt;/a&gt; that saved yet another 9 bytes. &lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Of course, there are similarities between the solutions, and they're probably based on the idea of the previous revisions, but it's still a different solution. Maybe Luis wouldn't have solved the challenge at all if it wasn't for my post&lt;sup&gt;1&lt;/sup&gt;, but the shorter approaches are still his.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I suggest that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We still post comments suggesting simple improvements (&lt;em&gt;&quot;you can use &lt;code&gt;1e3&lt;/code&gt; instead of &lt;code&gt;1000&lt;/code&gt;&quot;&lt;/em&gt;)&lt;/li&gt;&#xA;&lt;li&gt;We post &lt;em&gt;separate answers&lt;/em&gt;, even if they're inspired by (and similar to) someone else's. And as always: Give credit where credit's due.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1 &lt;/sup&gt;Of course he would, but let's pretend he wouldn't.  &lt;/p&gt;&#xA;" OwnerUserId="31516" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2017-03-07T22:21:05.063" Title="Should we stop being so generous?" Tags="|discussion|comments|" AnswerCount="2" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="11711" PostTypeId="2" ParentId="11710" CreationDate="2017-03-07T21:12:22.943" Score="11" Body="&lt;h1&gt;Post a new answer if you find a different approach&lt;/h1&gt;&#xA;&lt;p&gt;If you found a different approach then post it as a new answer. As far as I am aware there is no rule against answering a challenge in a language it's already been answered in.&lt;/p&gt;&#xA;&lt;p&gt;To make myself clear, if I found a shorter way to implement the same method, shaving off a small number of bytes, I would leave a comment instead. If I found a new solution that is fundamentally different than the original I would post a new answer.&lt;/p&gt;&#xA;" OwnerUserId="41863" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-07T22:02:17.533" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="11712" PostTypeId="2" ParentId="11710" CreationDate="2017-03-07T22:06:38.147" Score="46" Body="&lt;h3&gt;Could, but not &amp;quot;Should&amp;quot;&lt;/h3&gt;&#xA;&lt;p&gt;Someone &lt;em&gt;&lt;strong&gt;can&lt;/strong&gt;&lt;/em&gt; post a separate answer using a new approach, but they don't have to. I feel like &amp;quot;should&amp;quot; is a bit strong, as it implies that it's wrong not to, which I don't think is the case. If someone feels like giving a comment instead of posting a new answer, it's their choice.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-07T22:06:38.147" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11713" PostTypeId="2" ParentId="2140" CreationDate="2017-03-08T01:06:45.753" Score="2" Body="&lt;h1&gt;Packing Primes for Posterity&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You've calculated which of the first &lt;code&gt;n&lt;/code&gt; numbers are prime, and want to save your achievement for all future generations. Unfortunately, you're broke, and want to minimize storage costs (you'll be paying them forever, after all.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You need to determine the best way to pack all of the primes &lt;code&gt;&amp;lt;=n&lt;/code&gt; and still be able to answer the question &quot;is &lt;code&gt;p&lt;/code&gt; prime?&quot; in &lt;code&gt;O(1)&lt;/code&gt; time.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A submission to this challenge must include both a &lt;code&gt;compress&lt;/code&gt; algorithm and an &lt;code&gt;isPrime&lt;/code&gt; algorithm. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;compress&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;n&lt;/code&gt; -- the number that you have checked prime-hood through.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: Bytes to feed into your &lt;code&gt;isPrime&lt;/code&gt; algorithm.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;isPrime&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input: The output of your compression algorithm, and an integer &lt;code&gt;i &amp;gt;= 0&lt;/code&gt;. &lt;code&gt;i&lt;/code&gt; is guaranteed to be &lt;code&gt;&amp;lt;= n&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: &lt;code&gt;True&lt;/code&gt; if &lt;code&gt;i&lt;/code&gt; is prime, otherwise &lt;code&gt;False&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This algorithm &lt;em&gt;must&lt;/em&gt; run in O(1).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner of this challenge is the (compression, isPrime) pair that is&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Correct&lt;/li&gt;&#xA;&lt;li&gt;Has the best compression ratio, as determined by the average compression ratio for &#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;n in {10^3, 10^4, 10^5, 10^6, 10^7, 10^8, 10^9}&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;as compared to the naive solution below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider the following solution in Python:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def compress(n):&#xA;    # simple sieve of Eratosthenes. Note: this is not a &#xA;    # prime generation challenge; a list of the first &#xA;    # billion numbers will be provided in this format.&#xA;    primes = [1] * (n + 1)&#xA;    primes[0] = 0&#xA;    primes[1] = 0&#xA;    upper_bound = int(math.sqrt(n)) + 1&#xA;    for i in range(2, upper_bound):&#xA;        factor = i&#xA;        if not primes[factor]:&#xA;            continue&#xA;        factor += i&#xA;        while factor &amp;lt;= n:&#xA;            primes[factor] = 0&#xA;            factor += i&#xA;    primePackStr = ''.join(str(i) for i in primes)&#xA;    return primePackStr&#xA;&#xA;def isPrime(compressed, i):&#xA;    return compressed[i] == '1'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input to &lt;code&gt;compress&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;20&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&quot;001101010001010001010&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Input to &lt;code&gt;isPrime&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;(&quot;001101010001010001010&quot;, 13)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;True&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Notes&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is not a prime generation challenge. The &lt;code&gt;compress&lt;/code&gt; executable can assume that there is a file called &lt;code&gt;primes.txt&lt;/code&gt; in the same directory that contains the first billion numbers in the format &lt;code&gt;s[i] = 1&lt;/code&gt; if i is prime, 0 otherwise. (Zero-indexed) &lt;/li&gt;&#xA;&lt;li&gt;Naturally, the &lt;code&gt;isPrime&lt;/code&gt; executable cannot make use of this file.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;code&gt;isPrime&lt;/code&gt; executable must not hardcode any primes.&lt;/li&gt;&#xA;&lt;li&gt;Please provide instructions on how to compile/run your code on either OSX 10.12 or Ubuntu 16.04, if it's not obvious.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;em&gt;not&lt;/em&gt; a code golf challenge. Any length of code is fine, as long as &lt;code&gt;isPrime&lt;/code&gt; doesn't attempt to cheat. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Notes for sandbox&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'll include a link to a downloadable primes.txt&lt;/li&gt;&#xA;&lt;li&gt;Any thoughts on a better restriction than &quot;The &lt;code&gt;isPrime&lt;/code&gt; executable must not hardcode any primes?&quot;&lt;/li&gt;&#xA;&lt;li&gt;Should I test on random values of &lt;code&gt;n&lt;/code&gt; instead?&lt;/li&gt;&#xA;&lt;li&gt;thanks!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66460" LastActivityDate="2017-03-08T01:06:45.753" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="11714" PostTypeId="2" ParentId="2140" CreationDate="2017-03-08T10:47:19.467" Score="1" Body="&lt;h1&gt;Chemistry 101&lt;/h1&gt;&#xA;&lt;h2&gt;Question&lt;/h2&gt;&#xA;&lt;p&gt;&lt;code&gt;Given the atomic number of an element&lt;/code&gt; in the range [1-118] print out the &lt;code&gt;group and period&lt;/code&gt;, of that element as given by the following Periodic Table Of Elements.&lt;/p&gt;&#xA;&lt;p&gt;For elements in the Lanthanide and Actinide series, (ranges [58-71] and [90-103]), you should instead print &lt;code&gt;L&lt;/code&gt; for the Lanthanides and &lt;code&gt;A&lt;/code&gt; for the Actinides&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;You may write a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2419&quot;&gt;program or a function&lt;/a&gt; and use any of the our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447&quot;&gt;standard methods&lt;/a&gt; of receiving input and providing output.&lt;/p&gt;&#xA;&lt;p&gt;You may use any &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2028&quot;&gt;programming language&lt;/a&gt;, but note that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;these loopholes&lt;/a&gt; are forbidden by default.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;sup&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/112176/15394&quot;&gt;[Source]&lt;/a&gt; &lt;sup&gt;I couldn't have put it better!&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/112176/15394&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/nJm2q.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Periodic_table#/media/File:18-column_medium-long_periodic_table.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;[Source]&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;p&gt;The output here separates the group and period with a single space&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;| Input | Output |&#xA;|   1   |  1 1   |&#xA;|   33  |  15 4  |&#xA;|   45  |  8 5   |&#xA;|   71  |  L     |&#xA;|   93  |  A     |&#xA;|   117 |  17 7  |&#xA;&lt;/pre&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Simple &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. Shortest number of bytes wins&lt;/p&gt;&#xA;" OwnerUserId="15394" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-09T07:59:20.700" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="11719" PostTypeId="1" CreationDate="2017-03-09T05:37:09.057" Score="1" ViewCount="103" Body="&lt;p&gt;I am currently sandboxing &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11709/56656&quot;&gt;a challenge&lt;/a&gt; that will have two threads.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I was wondering if there was any good way to do Multi-thread challenges like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;.  Typically I do one thread explaining the idea and get feedback on the idea rather than the formatting details and wording.  However I often want feedback on the details too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What good ways are there for sandboxing a Multi-Thread challenge?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.370" LastActivityDate="2017-03-09T08:10:36.790" Title="Sandboxing Multi-Thread Challenges" Tags="|discussion|sandbox|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11720" PostTypeId="2" ParentId="11719" CreationDate="2017-03-09T08:10:36.790" Score="8" Body="&lt;h2&gt;Post both threads in one sandbox post&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For users who can see revisions of deleted answers, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/revisions/9156/9&quot;&gt;here is an example&lt;/a&gt;. The two threads belong together, so separate voting doesn't make sense... if votes deemed one part ready and the other not, you would not post one without the other. At the same time, posting them in one answer keeps all the information together, without others having to go looking for another sandbox answer. And finally, it also keeps the discussion in one place by having all comments on one answer. There might well be comments that affect both parts of the challenge, and it would be annoying if these were distributed randomly over both answers.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2017-03-09T08:10:36.790" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11723" PostTypeId="2" ParentId="2140" CreationDate="2017-03-09T16:52:49.333" Score="0" Body="&lt;h1&gt;Painter's Partition Problem&lt;/h1&gt;&#xA;&lt;h1&gt;Description&lt;/h1&gt;&#xA;&lt;p&gt;You have to paint N boards of length {A0, A1, A2, A3 … AN-1}. There are K painters available and each painter takes unit time to paint 1 unit of board. You have to get this job done as soon as possible under the constraints that any painter will only paint contiguous sections of board.&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;2 painters cannot share a board to paint. That is to say, a board&#xA;cannot be painted partially by one painter, and partially by another.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A painter will only paint contiguous boards. Which means a&#xA;configuration where painter 1 paints board 1 and 3 but not 2 is&#xA;invalid.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;N boards have length given in integers.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;K&lt;/strong&gt; : Number of painters&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;L&lt;/strong&gt; : A List which will represent length of each board&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;Return minimum time to paint all boards&lt;/p&gt;&#xA;&lt;h3&gt;Sample Input/Output&lt;/h3&gt;&#xA;&lt;p&gt;K      = 2&lt;/p&gt;&#xA;&lt;p&gt;L      = [1, 10]&lt;/p&gt;&#xA;&lt;p&gt;Output = 10&lt;/p&gt;&#xA;" OwnerUserId="64339" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-09T17:29:39.520" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11724" PostTypeId="2" ParentId="2140" CreationDate="2017-03-09T20:55:45.643" Score="0" Body="&lt;h2&gt;find the set of Sets in a subset of Set.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;the Set game is a one-player card game using a deck of 81 cards. Derivatives - primarily those that remove most of the cards - exist. We shall be using one of such derivatives today.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;a card in the deck is defined by four properties of the symbol(s) depicted on it. Each of these has one of three values:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Count (1, 2 or 3); in this version, the count is always 1.&lt;/li&gt;&#xA;&lt;li&gt;Color: &lt;code&gt;r&lt;/code&gt;ed, &lt;code&gt;g&lt;/code&gt;reen or &lt;code&gt;b&lt;/code&gt;lue.&lt;/li&gt;&#xA;&lt;li&gt;Fill: &lt;code&gt;h&lt;/code&gt;ollow, &lt;code&gt;s&lt;/code&gt;triped or &lt;code&gt;f&lt;/code&gt;illed.&lt;/li&gt;&#xA;&lt;li&gt;shape: a &lt;code&gt;s&lt;/code&gt;quare, a &lt;code&gt;t&lt;/code&gt;riangle, or a &lt;code&gt;c&lt;/code&gt;ircle.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;A card shall be represented as a using those properties: &lt;code&gt;rhs&lt;/code&gt; is a red hollow square, while &lt;code&gt;gsc&lt;/code&gt; is a green solid circle.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;a Set of cards is a triplet of cards such that for each property, the value of that property is either the same for all three cards or different for each of the three cards. For example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;rhs&lt;/code&gt;, &lt;code&gt;gst&lt;/code&gt; and &lt;code&gt;bfc&lt;/code&gt; form a Set. Each property value is different.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;rss&lt;/code&gt;, &lt;code&gt;gss&lt;/code&gt; and &lt;code&gt;bss&lt;/code&gt; form a Set. They are solid squares of different colors.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;bsc&lt;/code&gt;, &lt;code&gt;bhs&lt;/code&gt; and &lt;code&gt;bft&lt;/code&gt; form a Set. The colors are the same, the fills are different, and the shapes are different.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;gst&lt;/code&gt;, &lt;code&gt;bst&lt;/code&gt; and &lt;code&gt;bst&lt;/code&gt; do not form a set, because there are two blue cards.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;rss&lt;/code&gt;, &lt;code&gt;bss&lt;/code&gt; and &lt;code&gt;rst&lt;/code&gt; do not form a set, because there are two red cards as well as two squares.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;gft&lt;/code&gt;, &lt;code&gt;gft&lt;/code&gt; and &lt;code&gt;gft&lt;/code&gt; do not form a set, because it's not a triplet of cards. It's the same card listed three times.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Your input shall be a set of 9 (distinct) cards from the deck. You may optionally accept a flat string or list of 27 symbols without any separator instead of a list of 9 strings or lists. You may also accept the number of Sets that can be found within this set as a part of your input. You may assume there's at least one Set in your input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your output shall be a set of all Sets that can be found among the cards given to you. You may output the Sets in any order, but each Set must only be output once. You may output the cards in each Set in any order as well. You may flatten the output at any level. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;How many test cases should I generate? What format is the best? I could provide a test case generator in Ruby, if that's desirable.&lt;/p&gt;&#xA;" OwnerUserId="7209" LastActivityDate="2017-03-09T20:55:45.643" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11726" PostTypeId="1" AcceptedAnswerId="11728" CreationDate="2017-03-10T08:52:53.427" Score="17" ViewCount="761" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7212/8478&quot;&gt;Non-free languages are not allowed to participate in Cops and Robbers challenges.&lt;/a&gt; And that's a good thing. If you choose an obscure non-free language, no one will be able even to attempt solving it and you get a free uncracked cop. If you choose a non-free language that is reasonably widespread, it's giving an advantage to those robbers who have paid for the language, which isn't fair either. But unlike other standard loopholes, this one isn't actually preventing bad content, it just keeps the challenges fair.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, a large part of the appeal of Cops and Robbers challenges (to me, anyway) is that they allow users to create interesting programming puzzles (oh hey, where have I seen that phrase before...) for other users, or solving those puzzles. Some non-free languages like Mathematica and MATLAB have quite a decent user base on PPCG, and it would certainly be nice to be able to challenge other users of the language with a nice puzzle in a Cops and Robbers challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So my question is, should we allow &lt;em&gt;non-competing&lt;/em&gt; cops in non-free programming languages? If these are cracked, the corresponding robber's answer would also be non-competing. This way we wouldn't have to exclude some interesting languages from the fun of CnR challenges, but could still keep things fair.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2017-03-14T00:05:32.690" Title="Allowing non-free languages in Cops and Robbers challenges when marked as non-competing" Tags="|discussion|answers|cops-and-robbers|noncompeting|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11728" PostTypeId="2" ParentId="11726" CreationDate="2017-03-10T09:11:38.497" Score="25" Body="&lt;p&gt;I don't see any problems with allowing non-competing non-free answers. It allows for the creation of interesting puzzles, while preventing CnR challenges from becoming (to borrow a term from video games) pay-to-win.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-03-10T09:11:38.497" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11729" PostTypeId="2" ParentId="2140" CreationDate="2017-03-10T09:39:24.173" Score="0" Body="&lt;p&gt;In our language, we use &lt;strong&gt;language of S&lt;/strong&gt; for basic encryption for avoid something from children if we do not wish that children know about what we are talking about.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So here is how it works.&lt;br&gt;&#xA;Lets take &lt;strong&gt;&quot;Hello there&quot;&lt;/strong&gt; for example. So its encryption using &lt;strong&gt;language of S&lt;/strong&gt; is &lt;strong&gt;Hesmello Thesmere&lt;/strong&gt;  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Step to understand&lt;/strong&gt;  &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Step 1:&lt;/strong&gt; take string, in our example its &quot;Hello There&quot;&lt;br&gt;&#xA;  &lt;strong&gt;Step 2:&lt;/strong&gt; add &lt;strong&gt;S&lt;/strong&gt; and &lt;strong&gt;M&lt;/strong&gt; after first character's vowel and add vowel of that first character after &lt;strong&gt;M&lt;/strong&gt;.&lt;br&gt;&#xA;  You no need to repeate this for other characters of that word. So in our example, we add &lt;strong&gt;SM&lt;/strong&gt; for &lt;strong&gt;he&lt;/strong&gt; so no need to do that for remain &lt;strong&gt;llo&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So as per our example for &quot;Hello There&quot; is He&lt;strong&gt;sme&lt;/strong&gt;llo the&lt;strong&gt;sme&lt;/strong&gt;re&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;What you have to do&lt;/strong&gt;&lt;br&gt;&#xA;1. User add input (or pre defined string in variable) and its output should be as per Output String below&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input :&lt;/strong&gt; Hello World&lt;br&gt;&#xA;&lt;strong&gt;Output:&lt;/strong&gt; Hesmello Wosmorld  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so lowest number of bytes wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider these as vowels:&lt;strong&gt;A, E, I, O, U, Y&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="66582" LastEditorUserId="56433" LastEditDate="2017-03-10T10:03:09.907" LastActivityDate="2017-03-10T10:03:09.907" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11730" PostTypeId="2" ParentId="2140" CreationDate="2017-03-10T14:05:51.383" Score="0" Body="&lt;h1&gt;Find a basis for each eigenspace!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/79545/jordan-decomposition&quot;&gt;Related&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is just as it seems; you are to find a basis for each eigenspace of a matrix. If you have taken Linear Algebra 1, you'll understand what this means, but this is an attempted full explanation of eigenvalues, eigenvectors, eigenspaces, what a basis is, and how to obtain all of these.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is the challenge; the explanations are below so you can skip them if you already know how to do this.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The input will be a single matrix given in any reasonable format according to PPCG conventions.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The output will be an array of bases. There will be one basis for each eigenspace. You can choose whether or not to repeat eigenvalues with an arithmetic multiplicity of more than 1. This can be output in any reasonable format, probably a 3D array.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Vectors&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In Computer Science terms, a vector is an array of values. For the purposes of this, we are assuming that all of these values are in &lt;code&gt;Q&lt;/code&gt;; that is, they are all rational numbers. &lt;a href=&quot;https://en.wikipedia.org/wiki/Vector_space&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia: Vector space&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Matrices&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In Computer Science terms, a matrix is a 2D array of values. For the purposes of this, we are assuming that all of these values are in &lt;code&gt;Q&lt;/code&gt;; that is, they are all rational numbers. &lt;a href=&quot;https://en.wikipedia.org/wiki/Matrix_(mathematics)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia: Matrix&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Terminology&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let &lt;code&gt;A&lt;/code&gt; be an &lt;code&gt;m x n&lt;/code&gt; matrix (with &lt;code&gt;m&lt;/code&gt; rows and &lt;code&gt;n&lt;/code&gt; columns) and let &lt;code&gt;x&lt;/code&gt; be a size-&lt;code&gt;k&lt;/code&gt; vector. Then, &lt;code&gt;Aij&lt;/code&gt; is the element in the &lt;code&gt;i&lt;/code&gt;-th row in the &lt;code&gt;j&lt;/code&gt;-th column of &lt;code&gt;A&lt;/code&gt; with &lt;code&gt;0 &amp;lt; i &amp;lt;= m&lt;/code&gt; and &lt;code&gt;0 &amp;lt; j &amp;lt;= n&lt;/code&gt; (they are 1-indexed). Also, &lt;code&gt;xi&lt;/code&gt; is the &lt;code&gt;i&lt;/code&gt;-th element of the vector &lt;code&gt;x&lt;/code&gt; with &lt;code&gt;0 &amp;lt; i &amp;lt;= k&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Zero Vector and the Zero Matrix&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The zero vector is the vector containing all zeros. Similarly, the zero matrix is the matrix containing all zeros. It is important to note that the size still needs to be considered.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scalar Multiplication&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Scalar multiplication by a value &lt;code&gt;s&lt;/code&gt; (again we are assuming it is rational) is quite easy to understand; simply multiply each element by &lt;code&gt;s&lt;/code&gt;. Thus, we say that &lt;code&gt;x&lt;/code&gt; is a scalar multiple of &lt;code&gt;y&lt;/code&gt; if and only if &lt;code&gt;x = sy&lt;/code&gt;. Note that the zero-vector is a scalar multiple of any vector but all non-zero vectors are not scalar multiples of the zero vector.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Matrix-Vector Multiplication &lt;a href=&quot;http://mathinsight.org/matrix_vector_multiplication&quot; rel=&quot;nofollow noreferrer&quot;&gt;(MathInsight)&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let &lt;code&gt;A&lt;/code&gt; be an &lt;code&gt;m x n&lt;/code&gt; matrix (with &lt;code&gt;m&lt;/code&gt; rows and &lt;code&gt;n&lt;/code&gt; columns) and let &lt;code&gt;x&lt;/code&gt; be a size-&lt;code&gt;n&lt;/code&gt; vector. Then, &lt;code&gt;Ax = y&lt;/code&gt; where &lt;code&gt;y&lt;/code&gt; is a size-&lt;code&gt;m&lt;/code&gt; vector defined as such:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;yi = Ai1*x1 + Ai2*x2 + ... + Ain*xn&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;That is, the &lt;code&gt;i&lt;/code&gt;-th element in the result is the &lt;a href=&quot;https://en.wikipedia.org/wiki/Dot_product&quot; rel=&quot;nofollow noreferrer&quot;&gt;dot product&lt;/a&gt; of the &lt;code&gt;i&lt;/code&gt;-th row of &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;x&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Eigenvalues_and_eigenvectors&quot; rel=&quot;nofollow noreferrer&quot;&gt;Eigenvalues and Eigenvectors&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let &lt;code&gt;λ != 0&lt;/code&gt; be any real number, &lt;code&gt;A&lt;/code&gt; be an &lt;code&gt;m x n&lt;/code&gt; matrix, and &lt;code&gt;x != 0&lt;/code&gt; be a size-&lt;code&gt;n&lt;/code&gt; vector (not the number &lt;code&gt;0&lt;/code&gt;, but the &lt;code&gt;0&lt;/code&gt;-vector, which contains all zeros). Then, if &lt;code&gt;Ax = λx&lt;/code&gt;, we say that &lt;code&gt;x&lt;/code&gt; is an eigenvector of &lt;code&gt;A&lt;/code&gt; corresponding to &lt;code&gt;λ&lt;/code&gt;, and similarly, we say that &lt;code&gt;λ&lt;/code&gt; is an eigenvalue of &lt;code&gt;A&lt;/code&gt; corresponding to &lt;code&gt;x&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Determining Eigenvectors&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It's easy to determine if &lt;code&gt;x&lt;/code&gt; is an eigenvector of &lt;code&gt;A&lt;/code&gt;. Simply check if &lt;code&gt;Ax&lt;/code&gt; is a scalar multiple of &lt;code&gt;x&lt;/code&gt;, which also gives us the corresponding eigenvalue &lt;code&gt;λ&lt;/code&gt;. However, it is harder to find eigenvectors than to check it a vector is one.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Finding Eigenvalues&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Conversely, it's easier to find the eigenvalues but harder to check if a value is one, which is fortunate for this challenge. Firstly, we must look at determinants.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Determinants&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The determinant of a &lt;code&gt;2 x 2&lt;/code&gt; matrix &lt;code&gt;[[a, b], [c, d]]&lt;/code&gt; is &lt;code&gt;ad - bc&lt;/code&gt;. This is a specific definition of the determinant, so in order to explain the recursive definition of a determinant, I will say that the determinant of a &lt;code&gt;1 x 1&lt;/code&gt; matrix is that value. Note that only square matrices have a determinant.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The recursive definition of a &lt;a href=&quot;https://en.wikipedia.org/wiki/Determinant&quot; rel=&quot;nofollow noreferrer&quot;&gt;determinant&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In order to give the recursive definition of a determinant, I first need to explain what &lt;code&gt;A(i,j)&lt;/code&gt; means. &lt;code&gt;A(i,j)&lt;/code&gt; is the matrix formed by removing the &lt;code&gt;i&lt;/code&gt;-th row and the &lt;code&gt;j&lt;/code&gt;-th column from &lt;code&gt;A&lt;/code&gt;; thus, if &lt;code&gt;A&lt;/code&gt; is an &lt;code&gt;n x n&lt;/code&gt; matrix, &lt;code&gt;A(i,j)&lt;/code&gt; is an &lt;code&gt;n-1 x n-1&lt;/code&gt; matrix. Thus, we recursively define the determinant of an &lt;code&gt;n x n&lt;/code&gt; matrix &lt;code&gt;A&lt;/code&gt;, which we call &lt;code&gt;det A&lt;/code&gt;, as &lt;code&gt;sum x=1-&amp;gt;n (-1)^(x+1)*(det A(1,n))&lt;/code&gt;. In other words, we go down the left-most column and take the values obtained from multiplying this value with the matrix formed by taking out the row and column it is in, and then alternate adding and subtracting those values. See the Wikipedia link for more information. This definition is recursive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also note that we do not have to expand on the left-most column, we can also expand on any column or any row.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, how do determinants help us?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Well, I'm not going to prove it, but if we have &lt;code&gt;C(λ) = 0&lt;/code&gt;, then &lt;code&gt;λ&lt;/code&gt; is an eigenvalue of &lt;code&gt;A&lt;/code&gt;. &lt;code&gt;C&lt;/code&gt; is the characteristic polynomial function, which is gives the determinant of &lt;code&gt;A - λI&lt;/code&gt;, where &lt;code&gt;λI&lt;/code&gt; is scalar-multiplication between scalar &lt;code&gt;λ&lt;/code&gt; and the Identity Matrix &lt;code&gt;I&lt;/code&gt;, which has all &lt;code&gt;1&lt;/code&gt;s on its main diagonal and &lt;code&gt;0&lt;/code&gt;s everywhere else.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, given an eigenvalue &lt;code&gt;λ&lt;/code&gt;, we can find the &lt;a href=&quot;https://en.wikipedia.org/wiki/Row_echelon_form&quot; rel=&quot;nofollow noreferrer&quot;&gt;RREF&lt;/a&gt; of &lt;code&gt;A - λI&lt;/code&gt;. Let this matrix be &lt;code&gt;M&lt;/code&gt;. Then, the eigenspace of &lt;code&gt;λ&lt;/code&gt; corresponding to &lt;code&gt;A&lt;/code&gt; is the set of all vectors &lt;code&gt;x&lt;/code&gt; such that &lt;code&gt;Mx&lt;/code&gt; is the zero-vector.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We have finally arrived at the task. Your task is to output, for each eigenvalue, a basis of the corresponding eigenspace.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Linear Combination&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A linear combinations of vectors &lt;code&gt;x1, x2, ..., xn&lt;/code&gt; with scalars &lt;code&gt;s1, s2, ..., sn&lt;/code&gt; is &lt;code&gt;s1x1 + ... + snxn&lt;/code&gt;. When adding vectors, you add each individual element.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Spanning Set&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;S&lt;/code&gt; is a spanning set of &lt;code&gt;B&lt;/code&gt; if and only if every vector in &lt;code&gt;B&lt;/code&gt; can be written as a linear combination of &lt;code&gt;S&lt;/code&gt; with any real numbers as scalars.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Linearly Independent Set&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;L&lt;/code&gt; is a linearly independent set if and only if no vector is a linear combination of the other vectors (thus &lt;code&gt;L&lt;/code&gt; cannot contain the zero-vector), and it is linearly dependent otherwise.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Basis: a linearly independent spanning set&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A basis is simply a spanning set that's linearly independent. All possible bases will have the same number of vectors (proof omitted).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Now that you hopefully understood my explanations, we arrive at the following challenge:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an &lt;code&gt;n x n&lt;/code&gt; matrix with &lt;code&gt;0 &amp;lt; n &amp;lt;= 20&lt;/code&gt;, for each eigenvalue (there will be at most &lt;code&gt;n&lt;/code&gt; distinct ones), output a basis for the eigenspace of the eigenvalue. You can choose whether or not to output duplicates. You can choose the format for input and output within reasonable conditions. My recommendation is a 2D array for input and a 3D array for output. The input matrix is guaranteed to have only real eigenvalues, and is guaranteed to be square.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;I will add test cases if this challenge is posted because test cases are quite hard to create for this challenge!&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Fun Fact: &quot;eigen&quot; means &quot;special&quot; in German!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user42649" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:27.743" LastActivityDate="2017-03-10T14:05:51.383" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11732" PostTypeId="2" ParentId="11408" CreationDate="2017-03-10T17:47:48.257" Score="-3" Body="&lt;p&gt;&lt;a href=&quot;https://esolangs.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Pv6zm.png&quot; alt=&quot;The Esolang wiki sports over 1200 esoteric programming languages&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="13486" LastActivityDate="2017-03-10T17:47:48.257" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11733" PostTypeId="2" ParentId="2140" CreationDate="2017-03-10T18:12:15.077" Score="-2" Body="&lt;h1&gt;Google search result short summary&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/search&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;search&amp;#39;&quot; rel=&quot;tag&quot;&gt;search&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Intro&lt;/h2&gt;&#xA;&lt;p&gt;When you search in google, it always shows you a result with a sample text from the found webpage.&lt;/p&gt;&#xA;&lt;p&gt;For example if you search for &amp;quot;Madonna greatest vinyl&amp;quot;, google will show you one line link, and below a short excerpt from that found webpage:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Madonna Greatest Hits Records, LPs, Vinyl and CDs&lt;/strong&gt;&lt;br&gt;&#xA;&lt;em&gt;Madonna&lt;/em&gt; - &lt;em&gt;Greatest&lt;/em&gt; Hits Volume 2, Madonna, Greatest Hits ... &lt;em&gt;vinyl&lt;/em&gt; Is Fully Restored To As Near New Condition As Possible. Shipping &amp;amp; Multiple Order D..&lt;br&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Imagine yourself you work for google and you have to write a program/function which takes in:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a string containing many words (the webpage content)&lt;/li&gt;&#xA;&lt;li&gt;list of searched words (at least 3)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;and returns the shortest excerpt of given string (webpage) containing all searched words.&lt;/p&gt;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&lt;p&gt;Given this webpage content:&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;This document describes Session Initiation Protocol (SIP), an application-layer&#xA; control (signaling) protocol for creating, modifying, and terminating&#xA; sessions with one or more participants. These sessions include &#xA; Internet telephone calls, multimedia distribution, and multimedia conferences.&#xA;&lt;/pre&gt;&#xA;&lt;p&gt;and these searched words: &lt;pre&gt;calls, sessions, internet&lt;/pre&gt;&lt;/p&gt;&#xA;&lt;p&gt;the program should return: &lt;pre&gt;sessions include Internet telephone calls&lt;/pre&gt;, as this is the shortest substring containing all 3 searched words. Note that one more substring contains these 3 words, it is &amp;quot;sessions with one or more participants. These sessions include Internet telephone calls&amp;quot;, but it is longer, so it was discarded.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the string is empty, return empty string&lt;/li&gt;&#xA;&lt;li&gt;If all searched words are not found in given string, return empty string&lt;/li&gt;&#xA;&lt;li&gt;Search is ignoring letters case&lt;/li&gt;&#xA;&lt;li&gt;At least 3 words need to be specified for searching&lt;/li&gt;&#xA;&lt;li&gt;The returned string may contain the searched words in different order than specified&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Write the fastest code. It's for google, right? Remember that repeatable strings comparison is very expensive.&lt;/p&gt;&#xA;" OwnerUserId="65877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-10T18:12:15.077" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11734" PostTypeId="2" ParentId="2140" CreationDate="2017-03-10T18:32:07.743" Score="1" Body="&lt;h1&gt;Android Lock Screen Art&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Background&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In the land of Android, there exists a password type that looks like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/FsPR6.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/FsPR6.jpg&quot; alt=&quot;slide lock&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's essentially a connect-the-dots for a password. Today, we'll be making art with it.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your program should export as many distinct combinations of pattern lock as image files with the following specifications:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Images should be 500x500 pixels large.&lt;/li&gt;&#xA;&lt;li&gt;Dots should be located at positions (x, y):&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;(125, 125)&lt;/li&gt;&#xA;&lt;li&gt;(125, 250)&lt;/li&gt;&#xA;&lt;li&gt;(125, 375)&lt;/li&gt;&#xA;&lt;li&gt;(250, 125)&lt;/li&gt;&#xA;&lt;li&gt;(250, 250)&lt;/li&gt;&#xA;&lt;li&gt;(250, 375)&lt;/li&gt;&#xA;&lt;li&gt;(375, 125)&lt;/li&gt;&#xA;&lt;li&gt;(375, 250)&lt;/li&gt;&#xA;&lt;li&gt;(375, 375)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Lines should be drawn with a circular brush head of radius 8px.&lt;/li&gt;&#xA;&lt;li&gt;Background color and line color may be any color of your choosing, but must not be the same color and it must be consistent.&lt;/li&gt;&#xA;&lt;li&gt;The pattern should pass through all points ONCE, with the exception of the first point, which should be the first and last point drawn from/to.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The following output is valid (starts at top-left):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/H2ZZh.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/H2ZZh.png&quot; alt=&quot;valid&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following output is valid:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/9ggOb.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/9ggOb.png&quot; alt=&quot;valid 2&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following output is invalid:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/fLabv.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/fLabv.png&quot; alt=&quot;invalid&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This breaks condition 5 (repeat use of top-left, middle, and middle-left).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following output is also invalid:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/5rh2Q.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/5rh2Q.png&quot; alt=&quot;invalid 2&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This passes through the top left twice &lt;em&gt;and&lt;/em&gt; the start point is not the same as the end point (breaks rule 5 twice).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The program with the largest number of distinct outputs wins, with the shortest program being the tiebreak.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="44713" LastEditDate="2017-03-10T19:25:28.047" LastActivityDate="2017-03-10T19:25:28.047" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="11737" PostTypeId="1" CreationDate="2017-03-11T19:09:16.647" Score="13" ViewCount="2944" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Author's note:&lt;/strong&gt; This is a meta post tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/discussion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt;. The goal of this post it to create a community-wiki for Code-Bowling. Please post suggestions / concerns as answers and feel free to utilize the comments section on this post as well as on answers to discuss the topics at hand. (For extensive discussions consider using &lt;code&gt;chat&lt;/code&gt;). This index is best used when sorting answers by &lt;code&gt;active&lt;/code&gt; so you can see the current issues-at-hand being discussed.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Code Bowling&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; is a challenge similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; except the objective is to solve a problem in the most bytes/characters possible (or highest &lt;code&gt;complexity&lt;/code&gt;).&lt;br&gt;&lt;br&gt;Fluffing up code to contain many bytes isn't that impressive or challenging so the &lt;em&gt;fun&lt;/em&gt; in Code Bowling challenges typically stems from the limitations, obstacles, and penalties defined in a challenge's scoring system and/or rules. &lt;em&gt;(Refer to section: Common Scoring Metrics and Challenge Styles)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Most &lt;code&gt;Code Bowling&lt;/code&gt; challenges &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot;&gt;posted to this site&lt;/a&gt; are &lt;code&gt;[closed]&lt;/code&gt; for a variety of reasons, including an obvious ability of exploitation, lack of a defined scoring system, vague rules, &amp;quot;&lt;code&gt;too broad&lt;/code&gt;&amp;quot;, and many other reasons. Due to this, Code-Bowling challenges are rarely created and if they are they are usually poorly received. &lt;em&gt;(Relevant: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1661/should-we-kill-code-bowling&quot;&gt;Meta/Should we kill code-bowling?&lt;/a&gt;)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;The goal of this index is to help create a reference for Code-Bowlers that defines what is allowed and what is not allowed (standard loopholes and more), what is encouraged and discouraged, common scoring systems that can be used (along with automated scoring tools), and various other resources that will be helpful in not only creating code bowling questions, but also in &lt;em&gt;properly&lt;/em&gt; answering them.&#xA;&lt;br&gt;&lt;br&gt;&lt;br&gt;&#xA;This post has been broken-down and organized into 5 sections:&lt;br&gt;&#xA;  &lt;code&gt;Common Rules •  Common Scoring Metrics • Best Practices • FAQ • Useful Tools&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;br&gt;&lt;br&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;br&gt;&#xA;&lt;h2&gt;Common Rules (Rev. 1.0.0)&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;These are some objective rule-criterion that can be used in your challenge to limit a scope of answers and avoid being closed for &lt;code&gt;too broad&lt;/code&gt;. Not all of these rules will be compatible with your challenge-type / scoring-system. &lt;strong&gt;Select a few you wish you include by copy pasting them into your challenge.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Please copy-paste the following into your Code-Bowling challenges:&lt;br&gt;&#xA;&lt;code&gt;*This challenge is using some rules from &amp;lt;a href=&amp;quot;https://codegolf.meta.stackexchange.com/questions/11737/code-bowling-index&amp;quot;&amp;gt;Code-Bowling: Common Rules, Revision 1.0.0&amp;lt;/a&amp;gt;*&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Character : Byte Ratio&lt;/strong&gt;&lt;br&gt;&#xA;In Code-Bowling a &lt;code&gt;character-count&lt;/code&gt; is preferred over a &lt;code&gt;byte-count&lt;/code&gt;. The obvious reasoning for this is that multi-byte unicode characters (e.g. ) can be used in place of single-byte unicode characters to fluff up byte count and will make bowling more about who renames the most variables with high-byte unicode characters rather than who most strategically creates meaningful complex code. &lt;em&gt;(See &lt;strong&gt;Useful tools&lt;/strong&gt; section at end for &lt;a href=&quot;http://mothereff.in/byte-counter&quot; rel=&quot;nofollow noreferrer&quot;&gt;character-counting widget&lt;/a&gt;)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Variable/Function/Object Names&lt;/strong&gt;&lt;br&gt;&#xA;All variable names (or object pointers, function names, etc) should be 1 character long. The only acceptable time to use 2-character variables names is after all possible 1-character variables have been used. The only acceptable time to use 3-character variables names is after all possible 2-character variables have been used. Etc.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Non-simplified Arithmetic&lt;/strong&gt;&lt;br&gt;&#xA;All arithmetic should be in simplified form unless there is a justifiable reason for doing otherwise &lt;em&gt;(e.g. circumventing penalties defined in the scoring system of the challenge (In which case you still must use the smallest possible alternative form))&lt;/em&gt;. Finding the simplified form of any equation (as well as a list of &lt;em&gt;small&lt;/em&gt; alternative forms) is easy to do using &lt;a href=&quot;http://www.wolframalpha.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wolfram|Alpha&lt;/a&gt;. &lt;em&gt;(See &lt;strong&gt;Useful tools&lt;/strong&gt; section at end)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Un-used Code&lt;/strong&gt;&lt;br&gt;&#xA;All code must be used. Meaning the program must fail to always properly complete the task if any individual character (or varying set(s) of characters) is/are removed. Naturally, a subset of the program should not be able complete the task on its own without the rest of the program.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Line-breaks and White-space&lt;/strong&gt;&lt;br&gt;&#xA;Unless necessary for code function or otherwise specified by the challenge, all line-breaks and white-space should be removed from code before scoring by counting characters.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Comments&lt;/strong&gt;&lt;br&gt;&#xA;Comments are not permitted towards &lt;code&gt;character-count&lt;/code&gt;, unless &lt;em&gt;somehow&lt;/em&gt; utilized by your program/function.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Revision History: &lt;em&gt;(Utilizes archive.org)&lt;/em&gt;&lt;/strong&gt;&lt;br&gt;&#xA;• &lt;a href=&quot;http://web.archive.org/web/20170314051001/https://codegolf.meta.stackexchange.com/questions/11737/code-bowling-index?2&quot; rel=&quot;nofollow noreferrer&quot;&gt;Revision 1.0.0&lt;/a&gt; - &lt;em&gt;Mar 14 2017&lt;/em&gt;&lt;br&gt;&#xA;• &lt;a href=&quot;http://web.archive.org/web/20170312180349/https://codegolf.meta.stackexchange.com/questions/11737/code-bowling-index/11744&quot; rel=&quot;nofollow noreferrer&quot;&gt;Revision 0.0.2&lt;/a&gt; - &lt;em&gt;Mar 12 2017&lt;/em&gt;&lt;br&gt;&#xA;• &lt;a href=&quot;http://web.archive.org/web/20170311191025/https://codegolf.meta.stackexchange.com/questions/11737/code-bowling-index&quot; rel=&quot;nofollow noreferrer&quot;&gt;Revision 0.0.1&lt;/a&gt; - &lt;em&gt;Mar 11 2017&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;br&gt;&lt;br&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;br&gt;&#xA;&lt;h2&gt;Common Scoring Metrics and Challenge Styles&lt;/h2&gt;&#xA;&lt;p&gt;Code-Bowling challenges that are simply just to find the largest solution to a problem are often ambiguous and broad (and therefor will get close votes for being &lt;code&gt;too-broad&lt;/code&gt;). &lt;em&gt;These also often result in uncreative ∞-byte answers.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Most code-bowling challenges can be made more challenging, fun, and narrow by applying various limitations and penalties so that the solutions will have a &lt;code&gt;theoretical maximum score&lt;/code&gt; (typically 4-figures or less in &lt;code&gt;character-count&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;(For Challenge types that place limitations on source code, please include that tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; in your challenge/question.)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Pangram Challenges&lt;/strong&gt;&lt;br&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://en.wikipedia.org/wiki/Pangram&quot; rel=&quot;nofollow noreferrer&quot;&gt;A pangram&lt;/a&gt; is a sentence that uses every letter at least once. (&lt;em&gt;The quick brown fox jumps over the lazy dog&lt;/em&gt;).&lt;br&gt;&lt;br&gt;These types of challenges have scoring systems designed where a perfect pangram would achieve the theoretical maximum score &lt;em&gt;(though you are not &lt;strong&gt;required&lt;/strong&gt; to use every character at least once.)&lt;/em&gt; Additionally, using any character more than once will start incurring a penalty. &lt;br&gt;&lt;br&gt;These challenges typically expand to more than just [A-Z] by including numbers and sometimes symbols in their scoring metrics. &lt;br&gt;&lt;br&gt;Here is an example of a simple pangram scoring system (with an &lt;a href=&quot;http://jsfiddle.net/ur608qwt/3/&quot; rel=&quot;nofollow noreferrer&quot;&gt;online scoring tool&lt;/a&gt;).  &lt;em&gt;(See &lt;strong&gt;Useful tools&lt;/strong&gt; section at end)&lt;/em&gt;:&#xA;&lt;br&gt;&lt;br&gt;&lt;blockquote&gt;&#xA;    1. Each character used increases your score by 1 point.&lt;br&gt;&lt;br&gt;&#xA;    2. Any repeated character decreases your score by 1 point. That is, they do not count towards character total.&lt;br&gt;&lt;/blockquote&gt;&lt;br&gt;&#xA;Here is another example of a more complex pangram scoring system (with an &lt;a href=&quot;http://jsfiddle.net/96q4q22y/2/&quot; rel=&quot;nofollow noreferrer&quot;&gt;online scoring tool&lt;/a&gt;).  &lt;em&gt;(See &lt;strong&gt;Useful tools&lt;/strong&gt; section at end)&lt;/em&gt;:&#xA;&lt;br&gt;&lt;br&gt;&lt;blockquote&gt;&#xA;    1. Each character used increases your score by 1.&lt;br&gt;&lt;br&gt;&#xA;    2. Repeated use of any alphanumeric character (a-z, A-Z, 0-9) will result in a deduction of 3 points per repeat (first use does not result in a deduction).&lt;br&gt;&lt;br&gt;&#xA;    3. Repeated use of basic punctuation &lt;code&gt;([!?.-,&amp;quot;:';])&lt;/code&gt; - including the brackets - will result in a deduction of 2 points per repeat.&lt;br&gt;&lt;br&gt;&#xA;    4. Repeated use of other ASCII characters &lt;code&gt;{`~@#$%^&amp;amp;*_+=|\/&amp;gt;&amp;lt;}&lt;/code&gt; - including the curly brackets - will result in a deduction of 4 points per repeat.&lt;br&gt;&lt;br&gt;&#xA;    5. Use of spaces, tabs, and newlines will result in a deduction of 1 point per use. That is, they do not count towards character total.&lt;br&gt;&lt;br&gt;&#xA;    6. Characters not mentioned above &lt;em&gt;(Exotic Characters)&lt;/em&gt; will result in a deduction of 1 point per use. That is, they do not count towards character total.&lt;br&gt;&lt;/blockquote&gt;&#xA;&lt;br&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Rectangular Challenges&lt;/strong&gt;&lt;br&gt;&lt;br&gt;&#xA;These are challenges where the source code has to be formatted to be in the shape of a rectangle. Line breaks &lt;em&gt;&lt;strong&gt;do&lt;/strong&gt;&lt;/em&gt; count towards character count in these challenges.&lt;br&gt;&lt;br&gt;&#xA;The dimensions (w:h) of the rectangle must be in the range of (2h:h) to (w:2w). So a rectangle of 6 lines of code, each containing 11 characters (6x11) would be valid. But a rectangle of 2 lines of code, each containing 20 characters (2x20) would not be valid. &lt;em&gt;(Naturally, all lines must contain the same number of characters)&lt;/em&gt;&lt;br&gt;&lt;br&gt;&#xA;Each line of code must be &lt;code&gt;distinct&lt;/code&gt; to a certain threshold. &lt;code&gt;Distinctness&lt;/code&gt; is typically calculated using the &lt;a href=&quot;https://en.wikipedia.org/wiki/Levenshtein_distance&quot; rel=&quot;nofollow noreferrer&quot;&gt;Levenshtein distance&lt;/a&gt;. The threshold may change from challenge to challenge but a typical &lt;code&gt;distinctness threshold&lt;/code&gt; is 85%, where the Levenshtein distance between any two lines must be greater than or equal to 0.85*w, where w is the number of characters used in a line of your rectangle.&lt;br&gt;&lt;br&gt;&#xA;Penalties may be added for failing to meet the &lt;code&gt;distinctness threshold&lt;/code&gt;, or it may just be listed as a requirement and code that does not meet the threshold is invalid. &lt;br&gt;&lt;br&gt;&#xA;Including a &lt;a href=&quot;https://planetcalc.com/1721/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Levenshtein distance calculator&lt;/a&gt; in your challenge is good practice. &lt;em&gt;(See &lt;strong&gt;Useful tools&lt;/strong&gt; section at end)&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;br&gt;&lt;br&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;br&gt;&#xA;&lt;h2&gt;Best Practices&lt;/h2&gt;&#xA;&lt;p&gt;There are many things that can be done in Code-Bowling that, while technically permitted, are frowned upon and will likely result in down-votes. There are also many good things you can do that will be smiled upon and likely result in up-votes. In this section you can find a list of practices that should, in most common cases, be avoided, as well as a list of practices that, in most cases, should be encouraged.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Purposefully Overly-Verbose Languages&lt;/strong&gt;&lt;br&gt;&#xA;Languages that require a ton of characters on purpose are usually frowned upon in code-bowling. &lt;em&gt;Many challenges might not even really allow these to stand a chance in competing due to the penalties and limitations defined in the challenge.&lt;/em&gt; Examples of Overly-Verbose Languages include (but are not limited to):&lt;br&gt;&#xA;•   &lt;a href=&quot;https://github.com/lhartikk/ArnoldC&quot; rel=&quot;nofollow noreferrer&quot;&gt;ArnoldC&lt;/a&gt;&lt;br&gt;&#xA;•   &lt;a href=&quot;http://shakespearelang.sourceforge.net/report/shakespeare/&quot; rel=&quot;nofollow noreferrer&quot;&gt;SPL (Shakespeare Programming Language)&lt;/a&gt;&lt;br&gt;&#xA;•   &lt;a href=&quot;https://github.com/justinmeza/lolcode-spec/blob/master/v1.2/lolcode-spec-v1.2.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;LOLCode&lt;/a&gt;&lt;br&gt;&#xA;•   Any other wordy esoteric languages (likely somewhere on &lt;a href=&quot;http://esolangs.org/wiki/Language_list&quot; rel=&quot;nofollow noreferrer&quot;&gt;this list&lt;/a&gt;)&lt;br&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Code That is Too Long to Post&lt;/strong&gt;&lt;br&gt;&#xA;If your code is too long to post, it is good practice to post it on a text sharing site and then post the link to your code. &lt;a href=&quot;http://www.hastebin.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hastebin&lt;/a&gt; and &lt;a href=&quot;http://www.pastebin.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pastebin&lt;/a&gt; are good resources for this. &lt;em&gt;(See &lt;strong&gt;Useful tools&lt;/strong&gt; section at end)&lt;/em&gt;&lt;br&gt;&lt;br&gt;If your code is so big that it was not hand-typed it is recommended that you &lt;em&gt;also&lt;/em&gt; share your generating function that created the code.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Online IDEs&lt;/strong&gt;&lt;br&gt;&#xA;It is good practice and courtesy to post a link to an online IDE that is running your code so that others may execute it and see for themselves, as well as tweak your code to potentially help you increase your score. &lt;em&gt;(See &lt;strong&gt;Useful tools&lt;/strong&gt; section at end)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Vague (unenforceable) Rules&lt;/strong&gt;&lt;br&gt;&#xA;Do not add rules that have no clear measuring objective or systematic ruling system, for example a rule like &lt;em&gt;&amp;quot;All code must be useful&amp;quot;&lt;/em&gt;. Rules like this are unenforceable and likely to get your question &lt;code&gt;[closed]&lt;/code&gt;. All rules should be defined in a way where they could theoretically be enforced with an automated algorithm; so &lt;strong&gt;NO SUBJECTIVE RULES&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Bogus Code&lt;/strong&gt;&lt;br&gt;&#xA;Bogus code (that is added obviously just to fluff up character-count) should be avoided, unless utilizing them for good reason &lt;em&gt;(e.g. to avoid penalties defined in the scoring system)&lt;/em&gt;. Utilizing bogus code will often result in down-votes from viewers. Common examples of bogus code to avoid are as follows:&lt;/p&gt;&#xA;&lt;p&gt;a) &lt;strong&gt;Duplicating Variables&lt;/strong&gt;&lt;br&gt;&#xA;Adding an extra variable for no reason except to increase the number of variables used. For example changing &lt;code&gt;a=5; a++;&lt;/code&gt; to something like &lt;code&gt;a=5; b=a; b++;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;b) &lt;strong&gt;Significant-Figures Abuse&lt;/strong&gt;&lt;br&gt;&#xA;Adding extra degrees of accuracy to an object with no real reason to do so&lt;br&gt;For example changing &lt;code&gt;f = 3;&lt;/code&gt; to something like &lt;code&gt;f = 3.00000000000;&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;c) &lt;strong&gt;Literals Abuse&lt;/strong&gt;&lt;br&gt;&#xA;Adding extra content (typically to literal types) that is un-needed and typically immediately discarded.&lt;br&gt;E.g. changing &lt;code&gt;i = 2;&lt;/code&gt; to &lt;code&gt;i = numberOfCharacters(&amp;quot;abcdefghijklmnopqrstuvwxyz&amp;quot;)-24;&lt;/code&gt;&lt;br&gt;or changing &lt;code&gt;s = &amp;quot;hello&amp;quot;;&lt;/code&gt; to &lt;code&gt;s = &amp;quot;hellooooo&amp;quot;[0-4];&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;br&gt;&lt;br&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;br&gt;&#xA;&lt;h2&gt;FAQ&lt;/h2&gt;&#xA;&lt;p&gt;Frequently Asked Questions:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This section will be created as questions are asked and answered.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;br&gt;&lt;br&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;br&gt;&#xA;&lt;h2&gt;Useful Tools&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Character Counting Widget — &lt;a href=&quot;http://mothereff.in/byte-counter&quot; rel=&quot;nofollow noreferrer&quot;&gt;MotherEff.in&lt;/a&gt;, &lt;a href=&quot;https://ethproductions.github.io/bytes/&quot; rel=&quot;nofollow noreferrer&quot;&gt;ETHProductions&lt;/a&gt;&lt;/strong&gt;&lt;br&gt;&#xA;This is useful for determining the number of characters used in your application. In Code-Bowling a character count scoring system is favored over a byte count scoring system. &lt;em&gt;(See Rule #1)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Arithmetic/Equation Simplifier — &lt;a href=&quot;http://www.wolframalpha.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wolfram|Alpha&lt;/a&gt;&lt;/strong&gt;&lt;br&gt;&#xA;This is useful for simplifying your equations. Input an equation (e.g. &lt;code&gt;x+x+x+x&lt;/code&gt;) and it will output the simplified forms (e.g. &lt;code&gt;4*x&lt;/code&gt;) &lt;em&gt;(See Rule #3)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Text Sharing Sites — &lt;a href=&quot;http://www.hastebin.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;HasteBin&lt;/a&gt;, &lt;a href=&quot;http://www.pastebin.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;PasteBin&lt;/a&gt;&lt;/strong&gt;&lt;br&gt;&#xA;These are useful tools for sharing code that is too big to post on the site. &lt;em&gt;(See Best Practices #2)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Online IDEs — &lt;a href=&quot;https://tio.run/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try It Online!&lt;/a&gt;, &lt;a href=&quot;http://jsfiddle.net&quot; rel=&quot;nofollow noreferrer&quot;&gt;JSFiddle&lt;/a&gt;, &lt;a href=&quot;https://stackoverflow.blog/2014/09/16/introducing-runnable-javascript-css-and-html-code-snippets/&quot;&gt;SE Snippets&lt;/a&gt;&lt;/strong&gt;&lt;br&gt;&#xA;These are useful for allowing others to easily execute your code online and modify it. &lt;em&gt;Try It Online!&lt;/em&gt; is useful for most programming languages. &lt;em&gt;JSFiddle&lt;/em&gt; is useful for HTML/CSS/Javascript/etc but these can also be executed natively in &lt;a href=&quot;https://stackoverflow.blog/2014/09/16/introducing-runnable-javascript-css-and-html-code-snippets/&quot;&gt;StackExchange's &lt;em&gt;Code Snippets&lt;/em&gt;&lt;/a&gt; &lt;em&gt;(See Best Practices #3)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Pangram Scoring Tools — &lt;a href=&quot;http://jsfiddle.net/ur608qwt/3/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;Example 1 (simple)&lt;/em&gt;&lt;/a&gt;, &lt;a href=&quot;http://jsfiddle.net/96q4q22y/2/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;Example 2 (complex)&lt;/em&gt;&lt;/a&gt;&lt;/strong&gt;&lt;br&gt;&#xA;These are two automated score calculating tools for common Pangram scoring metric variations &lt;em&gt;(See Common Scoring Metrics #1)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Levenshtein distance calculator — &lt;a href=&quot;https://planetcalc.com/1721/&quot; rel=&quot;nofollow noreferrer&quot;&gt;PlanetCalc&lt;/a&gt;&lt;/strong&gt;&lt;br&gt;&#xA;This is a Levenshtein distance calculator useful for quantifying the changes made between two lines of code. &lt;em&gt;(See Common Scoring Metrics #3)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="16513" LastEditorUserId="66833" LastEditDate="2022-01-28T20:19:00.213" LastActivityDate="2022-01-28T20:19:00.213" Title="Code Bowling Index" Tags="|discussion|code-bowling|" AnswerCount="5" CommentCount="15" ContentLicense="CC BY-SA 4.0" />
  <row Id="11739" PostTypeId="2" ParentId="2140" CreationDate="2017-03-11T19:41:26.967" Score="0" Body="&lt;h1&gt;Monitor your ARP table&lt;/h1&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The Address Resolution Protocol is used to associate IP addresses on the local network with hardware addresses (aka MAC addresses). In its most basic form, ARP can be very insecure in the sense that your computer will believe anyone on the local network that says &amp;quot;Hey, this IP and this MAC go together!&amp;quot;. This can be used &lt;a href=&quot;https://en.wikipedia.org/wiki/ARP_spoofing&quot; rel=&quot;nofollow noreferrer&quot;&gt;maliciously&lt;/a&gt;, so we want to keep an eye on our ARP caches.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to create a program that monitors your ARP cache and alerts you when changes have been made.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Task&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Write a program that does the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;On initial execution, reads in the operating system's ARP table.&lt;/li&gt;&#xA;&lt;li&gt;With a frequency between once per second and once per ten seconds (inclusive), checks the operating system's ARP table for changes and prints something, as described immediately below:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;-- If there is no change, print this exact string (with one or two trailing new lines):&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;No Change&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;-- If a new entry has appeared in the cache, print the string (with one or two trailing new lines):&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;New Entry: &amp;lt;IP ADDRESS&amp;gt; --&amp;gt; &amp;lt;MAC ADDRESS&amp;gt;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;where &lt;code&gt;&amp;lt;IP ADDRESS&amp;gt;&lt;/code&gt; is the IP address of the new entry (formatted as described below) and &lt;code&gt;&amp;lt;MAC ADDRESS&amp;gt;&lt;/code&gt; is the MAC of the new entry (formatted as described below).&lt;/p&gt;&#xA;&lt;p&gt;-- If any entry has changed to a new MAC (meaning an IP address is now being associated with a different MAC address) print the string (with one or two trailing new lines):&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;!!! Possible Malicious Change: &amp;lt;IP ADDRESS&amp;gt; --&amp;gt; &amp;lt;NEW MAC ADDRESS&amp;gt; from &amp;lt;OLD MAC ADDRESS&amp;gt;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;where &lt;code&gt;&amp;lt;IP ADDRESS&amp;gt;&lt;/code&gt; is the IP whose entry has changed (formatted as below), &lt;code&gt;&amp;lt;NEW MAC ADDRESS&amp;gt;&lt;/code&gt; is the new MAC (formatted as below), and &lt;code&gt;&amp;lt;OLD MAC ADDRESS&amp;gt;&lt;/code&gt; is the old MAC (formatted as below)&lt;/p&gt;&#xA;&lt;p&gt;-- If any entry has changed to a to &lt;code&gt;&amp;lt;incomplete&amp;gt;&lt;/code&gt; (meaning an IP address is now being associated with nothing) print the string (with one or two trailing new lines):&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;Entry incomplete: &amp;lt;IP ADDRESS&amp;gt; --&amp;gt; &amp;lt;incomplete&amp;gt; from &amp;lt;OLD MAC ADDRESS&amp;gt;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;where &lt;code&gt;&amp;lt;incomplete&amp;gt;&lt;/code&gt; is a literal.&lt;/p&gt;&#xA;&lt;p&gt;--- If an entry is now missing, print the string (with one or two trailing new lines):&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;Entry for &amp;lt;IP ADDRESS&amp;gt; (&amp;lt;MAC ADDRESS&amp;gt;) is gone.&lt;/code&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program repeats until terminated.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Formatting&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;IP addresses have 4 octets that are dot separated. They may be formatted in either of the following fashions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;in hex: e.g. &lt;code&gt;02.22.DC.FD&lt;/code&gt;, leading zeros MUST be included, alphabetical digits may be capital or lowercase, as long as cases are not mixed within a single IP address.&lt;/li&gt;&#xA;&lt;li&gt;in decimal: e.g. &lt;code&gt;22.54.198.9&lt;/code&gt;, leading zeros MUST NOT be included.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;MAC addresses have 6 octets that are colon separated and must be formatted in the following fashion:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;in hex: e.g. &lt;code&gt;0F:CD:12:44:22:F1&lt;/code&gt;, leading zeros must be included, alphabetical digits may be capital or lowercase, as long as cases are not mixed within a single IP address.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;A MAC address can also be a string literal to the effect of &amp;quot;&lt;code&gt;incomplete&lt;/code&gt;&amp;quot; or &amp;quot;&lt;code&gt;unknown&lt;/code&gt;&amp;quot; if that is what is in your arp cache. If it is, this should be used literally instead of an actual MAC address.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Operating System Differences&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The three major operating systems (Mac, Linux, Windows) all use ARP and I'm fairly certain that all other modern OS's do as well. Your program need only run on a SINGLE operating system, to be specified in your submission header by its main type (e.g. &lt;code&gt;Linux&lt;/code&gt;) and in your submission body by a fuller identifier (e.g. &lt;code&gt;Centos 6.5&lt;/code&gt;). We will view each OS as it's own competition.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Testing things&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The following commands will change your ARP table on Linux (and Mac?).&lt;/p&gt;&#xA;&lt;p&gt;Add a (static) entry or overwrite an existing entry: &lt;code&gt;arp -s &amp;lt;IP&amp;gt; &amp;lt;MAC&amp;gt;&lt;/code&gt;, e.g. &lt;code&gt;arp -s 2.2.2.2 ab:cd:ef:12:34:56&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Delete an entry: &lt;code&gt;arp -d &amp;lt;IP&amp;gt;&lt;/code&gt;, e.g. &lt;code&gt;arp -d 2.2.2.2&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Flush all: &lt;code&gt;ip neighbor flush all&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="45459" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-14T15:17:13.463" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11742" PostTypeId="2" ParentId="11737" CreationDate="2017-03-12T04:45:07.623" Score="13" Body="&lt;p&gt;There are a couple of problems I see:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Variable Name Length.  This is a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11197/should-we-disallow-non-observable-requirements&quot;&gt;non-observable requirement&lt;/a&gt;.  The post doesn't say that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; challenges can't include them, but &lt;strong&gt;when we get to esoteric languages it can become &lt;em&gt;really&lt;/em&gt; hard to define what a variable name is&lt;/strong&gt;.  For example, say my language doesn't have traditional variables, but rather stores everything in a massive array.  What if I store it to key &quot;longVariableName&quot;?  Or if I store it at position 10000?&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Non-simplified Arithmetic is even &lt;em&gt;harder&lt;/em&gt; to define in an objective way.&lt;/strong&gt;  For example, lets say, instead of typing in &lt;code&gt;1&lt;/code&gt;, I did &lt;code&gt;X/X&lt;/code&gt;.  Wolfram Alpha says &lt;code&gt;&quot;1 (for x != 0)&quot;&lt;/code&gt;.  If you argue that &lt;code&gt;X/X&lt;/code&gt; has to be simplified, what if my program had logic that depended on &lt;code&gt;X/X&lt;/code&gt; throwing an error when &lt;code&gt;X&lt;/code&gt; is 0?&lt;/li&gt;&#xA;&lt;li&gt;Purposefully Overly-Verbose Languages.  You argue that such languages are frowned upon.  I disagree.  &lt;strong&gt;To frown upon verbose languages is to frown upon golfing languages on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges&lt;/strong&gt;.  While there are many that don't like them, the majority of our users have learned to pick the right language for the job. &lt;/li&gt;&#xA;&lt;li&gt;Vague (unenforceable) Rules:  Actually, &quot;All code must be useful&quot; is actually a pretty easy thing to enforce.  You've shown how its enforced:  If that code can be removed and the program still runs correctly, then its unused.  You literally posted that above.&lt;/li&gt;&#xA;&lt;li&gt;Bogus code:  This is more non-observable stuff.  Furthermore the threat of downvotes doesn't really work if its going to produce the winning submission.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Now, I'd like to take a look at your Challenge Styles section.  I think your introductory sentence is revealing: &lt;code&gt;&quot;Code-Bowling challenges that are simply just to find the largest solution to a problem are often ambiguous and broad&quot;&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is about representing stuff using as little data as possible.  When you think about it this way, &lt;strong&gt;it becomes obvious that representing something with as &lt;em&gt;much&lt;/em&gt; data as possible isn't a challenge at all&lt;/strong&gt;.  It's rather revealing that the example challenges you posted don't pose a challenge from the bowling aspect, but from the other restrictions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd personally argue that for a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; challenge to work, it'd be so mangled it wouldn't be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; challenge anymore.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2017-03-16T16:03:57.297" LastActivityDate="2017-03-12T04:45:07.623" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="11743" PostTypeId="2" ParentId="2140" CreationDate="2017-03-12T05:50:59.417" Score="0" Body="&lt;h1&gt;Find all the triples!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is, given a number &lt;code&gt;n&lt;/code&gt;, find all the Pythagorean triples containing that number, and output a list of the terms in each Pythagorean triple which is not &lt;code&gt;n&lt;/code&gt;, without repeats and in ascending order.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, given &lt;code&gt;8&lt;/code&gt; as an input, there are two Pythagorean triples which contain &lt;code&gt;8&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;6 8 10&#xA;8 15 17&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The terms in each Pythagorean triple (without &lt;code&gt;8&lt;/code&gt;) are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;6 10 15 17&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Because this set doesn't have repeats and is in ascending order, we can output just that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must write a program or function that takes one input, and your output can either be your language's representation of a list, or a string with any delimiter. So these outputs for &lt;code&gt;8&lt;/code&gt; are all valid:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[6 10 15 17]    (Clojure list)&#xA;[6, 10, 15, 17] (Python list)&#xA;6 10 15 17      (uses space delimiter)&#xA;6#10#15#17      (uses &quot;#&quot; delimiter)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules and Specs:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You are guaranteed that the input is a positive integer.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program must return the correct output for 3600 in 60 seconds. This is the same amount of time as TIO timing out. The output for 3600 should be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;147 380 425 660 810 1008 1050 1204 1342 1500 1755 1920 2160 2240 2415 2700 2880 2886 3190 3250 3456 3570 3603 3620 3625 3660 3690 3750 3780 3796 3842 3900 4005 4080 4125 4240 4335 4352 4500 4559 4614 4800 4810 4850 5049 5070 5220 5460 5475 5648 5809 5980 6000 6201 6270 6540 6750 6980 7068 7230 7595 7650 7700 7932 8265 8405 8500 8640 9015 9360 9676 9805 10324 10445 10500 10962 11100 11538 11730 12270 12710 13210 13260 13740 14175 14625 14784 15216 16000 16400 16683 17067 17820 18180 19838 20090 20162 20410 21450 21750 22356 22644 23865 24135 25795 26045 26880 27120 29892 30108 32300 32500 33654 33846 35910 36090 39919 40081 40420 40580 43125 43275 44928 45072 50561 50689 53940 54060 59946 60054 64750 64850 67452 67548 71955 72045 80960 81040 89964 90036 101218 101282 107970 108030 119973 120027 129575 129625 134976 135024 161980 162020 179982 180018 202484 202516 215985 216015 269988 270012 323990 324010 359991 360009 404992 405008 539994 540006 647995 648005 809996 810004 1079997 1080003 1619998 1620002 3239999 3240001&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins!&lt;/p&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="49561" LastEditDate="2017-03-12T20:38:55.960" LastActivityDate="2017-03-12T20:38:55.960" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11744" PostTypeId="2" ParentId="11737" CreationDate="2017-03-12T07:43:34.183" Score="6" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Non-simplified Arithmetic&lt;/strong&gt;&lt;br&gt;&#xA;  All arithmetic should be in simplified form unless there is a justifiable reason for doing otherwise...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;...&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Vague (unenforceable) Rules&lt;/strong&gt;&lt;br&gt;&#xA;  Do not add rules that have no clear measuring objective or systematic ruling system, for example a rule like &lt;em&gt;&quot;All code must be useful&quot;&lt;/em&gt;... All rules should be defined in a way where they could theoretically be enforced with an automated algorithm; so &lt;strong&gt;NO SUBJECTIVE RULES&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I see a tension. There's no way to automatically enforce a test for whether a reason is justifiable or not. In particular, if I claim &quot;doing it this way is better for number-analytic reasons&quot; then I may be wrong. No algorithm is going to perfectly verify that, and I doubt that most users of the site can either.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also don't think there's a way to automatically check whether arithmetic is in simplified form - a single expression can be fed into Wolfram Alpha and rejected if it claims a different simplification, but an expression can also be broken up and mangled to be nearly unrecognisable. Undecidability also rears its head: see Rice's theorem.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-03-12T07:43:34.183" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="11747" PostTypeId="1" AcceptedAnswerId="11751" CreationDate="2017-03-12T20:35:03.697" Score="8" ViewCount="297" Body="&lt;p&gt;It is probably not a shock to most of you, but I really enjoy answering code golf questions in Vim. There are many vim plugins that could greatly shorten some answers. For example, &lt;em&gt;surround&lt;/em&gt;, &lt;em&gt;subvert&lt;/em&gt;, &lt;em&gt;easymotion&lt;/em&gt;, and many others could potentially save many bytes on the right challenge.&lt;/p&gt;&#xA;&lt;p&gt;I've been wondering whether it would/should be allowed for a while, and it seems like the current consensus is contradictory. For example, as Mego wrote in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9279/31716&quot;&gt;this answer&lt;/a&gt; (+14/-0 right now):&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Using a third-party library/module/extension/whatever has always been allowed by default. It should be noted in the answer that it is not the &amp;quot;vanilla&amp;quot; language &lt;code&gt;(something like Language + Library/Libraries is the most common way)&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;...&lt;/p&gt;&#xA;&lt;p&gt;What you &lt;em&gt;do&lt;/em&gt; get for free is the assumption that a certain third-party library (or set of third-party libraries) is present on the machine, and can be used via the normal mechanisms of the language.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This seems to imply that adding plugins is fine, and should cost no penalty. &lt;em&gt;However&lt;/em&gt; as I myself wrote in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10041/31716&quot;&gt;this answer&lt;/a&gt; (+12/-0 right now):&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;On PPCG, languages are defined by their implementation. This includes any configuration files. Therefore, if you edit your local configuration files, you are essentially creating a new unpublished implementation of an existing language.&lt;/p&gt;&#xA;&lt;p&gt;...&lt;/p&gt;&#xA;&lt;p&gt;Presumably any language that might benefit from tweaking defaults would also have a way to edit that behavior inside of your solution, and however many bytes of boilerplate that takes is a reasonable byte handicap.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Here is where the problem arises. In Vim, the only way to install a plugin is to edit your &lt;code&gt;.vimrc&lt;/code&gt; to source the relevant files. Although you could manually source them, this feels very weird because a) it's not the traditional way of installing a plugin, b) vim submissions rarely need to use much vimscript, which sourcing plugins is entirely vimscript, and c) sourcing plugins is so verbose, solutions manually doing this will never be competitive.&lt;/p&gt;&#xA;&lt;p&gt;So this brings up several questions.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Can plugins be installed for vim answers?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If so, can they be installed the &lt;em&gt;normal way&lt;/em&gt;, by editing the &lt;code&gt;.vimrc&lt;/code&gt; or must they be manually sourced? If they can be installed the normal way, is there any byte penalty for using them?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-20T03:01:41.040" Title="Is &quot;vim + plugins&quot; a valid language?" Tags="|discussion|code-golf|defaults|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11748" PostTypeId="2" ParentId="2140" CreationDate="2017-03-13T01:23:12.587" Score="-2" Body="&lt;p&gt;&lt;strong&gt;It's 42!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge is to code golf a program that proves that the next number in a pattern is 42 based on the website &lt;a href=&quot;http://www.juanlopes.net/actually42&quot; rel=&quot;nofollow noreferrer&quot;&gt;Actually it's 42&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In your program, the user inputs a pattern of numbers and it has to output the equation that proves that the next number is 42.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the user inputs the pattern 1, 2, 3, 4, 5 the output is something like:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;f(n)=9/2(n^2)−17(n)+29/2&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because f(6) = 42&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program can output any form of an equation that makes the next value in the equation 42.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your outputted equation must be able to also output the numbers in the original input also in the form of a variable. For example, in this equation, if you put 1 as the number input you get the number 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program cannot make any HTTP requests to APIs, in other words, all the calculations must be done in the program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Good Luck!&lt;/p&gt;&#xA;" OwnerUserId="65989" LastEditorUserId="65989" LastEditDate="2017-03-13T10:38:09.327" LastActivityDate="2017-03-13T10:38:09.327" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="11750" PostTypeId="2" ParentId="2140" CreationDate="2017-03-13T08:02:17.980" Score="0" Body="&lt;h1&gt;Make a 'Logical' interpreter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;'Logical' is an esoteric language I am working on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It involves 4 logic gates, AND(&amp;amp;), OR(|), NOT(!) and XOR(^).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since only having 4 logic gates, the IO is only true or false (We are not discussing Qubits here :P)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It will have some lines in the format &lt;code&gt;[input 1] [(not included in not gates) input 2] [output] [gate]&lt;/code&gt;, showing which node is connected to which logic gate. For example, &lt;code&gt;1 2 3 &amp;amp;&lt;/code&gt; would mean node 1 and 2 are connected to an AND gate, and the output goes to node 3.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;During the interpretation, it should get the status of the input nodes(nodes which are only connected to an input of a logic gate) as an array of tuples. For example, &lt;code&gt;[[1,true][2,true]]&lt;/code&gt; is a valid input for the program &lt;code&gt;1 2 3 &amp;amp;&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then the interpreter should output the result of the output nodes(nodes which are only connected to an output of a logic gate), also as an array of tuples. For example, &lt;code&gt;[[3,true]]&lt;/code&gt; is the output for &lt;code&gt;1 2 3&lt;/code&gt; when given the input &lt;code&gt;[[1,true],[2,true]]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;[Too long, pastebin coming soon]&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No logic gates will be given one or more input nodes as same as their output nodes.&lt;/li&gt;&#xA;&lt;li&gt;A blank program is invalid, thus will not be given.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;OP's note&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I have clearly made this esolang for fun, but I hope it will be on some challenges, or make people understand more on logic gates.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="64499" LastActivityDate="2017-03-13T08:02:17.980" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11751" PostTypeId="2" ParentId="11747" CreationDate="2017-03-13T08:49:30.963" Score="9" Body="&lt;p&gt;Yes, it's valid in the same way that Python + NumPy (for example) is valid. Changing the &lt;code&gt;.vimrc&lt;/code&gt; configuration file isn't much different logically from installing a Python package (which is mostly just putting the package's files in &lt;code&gt;/usr/lib/python/site-packages&lt;/code&gt;, or whatever the path is for the system). The method of installation isn't the concern here - it's the presence or absence of functionality created by a third party that is not part of the standard installation of the language.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-03-13T08:49:30.963" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11752" PostTypeId="2" ParentId="2140" CreationDate="2017-03-13T09:14:00.697" Score="-2" Body="&lt;h1&gt;The Mnemonic Major System&lt;/h1&gt;&#xA;&lt;p&gt;People frequently need to memorize long strings of digits, such as&#xA;telephone numbers. Fortunately, the &lt;a href=&quot;https://en.wikipedia.org/wiki/Mnemonic_major_system&quot; rel=&quot;nofollow noreferrer&quot;&gt;mnemonic major&#xA;system&lt;/a&gt;, which&#xA;uses sounds to represent digits, and words to represent strings of&#xA;digits, can help.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;/s/&lt;/strong&gt; and &lt;strong&gt;/z/&lt;/strong&gt; represent the digit &lt;strong&gt;0&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;/t/&lt;/strong&gt;, &lt;strong&gt;/d/&lt;/strong&gt;, &lt;strong&gt;/θ/&lt;/strong&gt; and &lt;strong&gt;/ð/&lt;/strong&gt; all represent &lt;strong&gt;1&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;/n/&lt;/strong&gt; represents &lt;strong&gt;2&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;/m/&lt;/strong&gt; represents &lt;strong&gt;3&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;/r/&lt;/strong&gt; represents &lt;strong&gt;4&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;/l/&lt;/strong&gt; represents &lt;strong&gt;5&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;/tʃ/&lt;/strong&gt;, &lt;strong&gt;/dʒ/&lt;/strong&gt;, &lt;strong&gt;/ʃ/&lt;/strong&gt; and &lt;strong&gt;/ʒ/&lt;/strong&gt; all represent &lt;strong&gt;6&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;/k/&lt;/strong&gt; and &lt;strong&gt;/ɡ/&lt;/strong&gt; represent &lt;strong&gt;7&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;/f/&lt;/strong&gt; and &lt;strong&gt;/v/&lt;/strong&gt; represent &lt;strong&gt;8&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;and &lt;strong&gt;/p/&lt;/strong&gt; and &lt;strong&gt;/b/&lt;/strong&gt; represent the digit &lt;strong&gt;9&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;For the purpose of this challenge, the sound &lt;strong&gt;/ŋ/&lt;/strong&gt;, generally&#xA;written as &lt;strong&gt;ng&lt;/strong&gt;, counts as &lt;strong&gt;27&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;All other sounds can be used to create words, but do not represent any&#xA;digits. Thus, the words &lt;b&gt;C&lt;/b&gt;o&lt;b&gt;d&lt;/b&gt;e &lt;b&gt;G&lt;/b&gt;o&lt;b&gt;lf&lt;/b&gt;&#xA;represent the digits 71 758. Since the mnemonic major system is a&#xA;phonetic system, silent letters do not represent any digits. Thus, the&#xA;word k&lt;b&gt;n&lt;/b&gt;igh&lt;b&gt;t&lt;/b&gt; represents the number 21, not 7271. The&#xA;letter &lt;strong&gt;x&lt;/strong&gt; is pronounced &lt;strong&gt;/ks/&lt;/strong&gt;, and thus represents the digits&#xA;70. On the other hand, most double consonants are not actually&#xA;pronounced separately (e.g. mummy, chicken), and represent only one&#xA;digit.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to write a program or function that takes a string of&#xA;digits in any convenient format as input and returns a mnemonic&#xA;representation of those digits as output. The following rules must be&#xA;observed:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;You must use real English words. Acronyms and abbreviations are not&#xA;allowed. If in doubt, refer to an authoritative dictionary.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Whenever possible, two or more digits must be represented by a&#xA;single word. If the number of digits is odd, you may choose which&#xA;digit, if any, stands alone (see examples). All two-digit numbers can be&#xA;represented by English words.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;You may use a built-in or external dictionary to search for suitable words.&lt;/p&gt;&#xA;&lt;p&gt;This is code golf, so the shortest solution wins.&lt;/p&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;758&#xA;golf, kale fee, key leaf&#xA;&#xA;0142710&#xA;strengths, suitor nugget saw, seat run key tease&#xA;&#xA;2362185&#xA;unimaginatively, gnome gin devil, enmesh native lie&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="64610" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-15T07:17:46.877" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11754" PostTypeId="2" ParentId="2140" CreationDate="2017-03-13T12:00:30.953" Score="-3" Body="&lt;h3&gt;Rock Paper Scissors Lizard Spock&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This game is from The Big Bang Theory, an extended version of the classic &lt;a href=&quot;https://en.wikipedia.org/wiki/Rock%E2%80%93paper%E2%80%93scissors&quot; rel=&quot;nofollow noreferrer&quot;&gt;Rock Paper Scissors&lt;/a&gt; game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Objective&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To create a full program that I can run to play Rock Paper Scissors Lizard Spock against an &quot;AI&quot;. The opponent (&quot;AI&quot;) will pseudo-randomly choose their option after receiving user input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program must be run with user input of the following;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;| Input     | Meaning   |&#xA;|-------    |---------- |&#xA;| R         | Rock      |&#xA;| P         | Paper     |&#xA;| S         | Scissors  |&#xA;| L         | Lizard    |&#xA;| SP        | Spock     |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The game is played with the following rules that Sheldon tells us;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Scissors cuts Paper &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Paper covers Rock &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Rock crushes Lizard &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Lizard poisons Spock &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Spock smashes Scissors &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Scissors decapitates Lizard&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Lizard eats Paper &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Paper disproves Spock &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Spock vaporises Rock &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Rock crushes Scissors&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/6I2U5.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/6I2U5.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once you've taken user input, psuedo-randomly chosen the AIs option, you must output either &quot;&lt;code&gt;Player wins (&amp;lt;&amp;lt;user_input&amp;gt;&amp;gt; vs &amp;lt;&amp;lt;ai_input&amp;gt;&amp;gt;)&lt;/code&gt;&quot; or &quot;&lt;code&gt;AI wins (&amp;lt;&amp;lt;user_input&amp;gt;&amp;gt; vs &amp;lt;&amp;lt;ai_input&amp;gt;&amp;gt;)&lt;/code&gt;&quot;. In the event of a tie (both the user and AI choose the same options), you must output &quot;&lt;code&gt;It's a tie&lt;/code&gt;&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sample Runs&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;//Player chooses Scissors (S)&#xA;//AI chooses Paper (P)&#xA;$ php -f rpslsp.php S&#xA;Player wins (S vs P)&#xA;&#xA;//Player chooses Spock (SP)&#xA;//AI chooses (R)&#xA;$ php -f rsplsp.php SP&#xA;Player wins (SP vs R)&#xA;&#xA;//Player chooses Lizard (L)&#xA;//AI chooses Scissors (S)&#xA;$ php -f rsplsp.php L&#xA;AI wins (L vs S)&#xA;&#xA;//Player chooses Lizard (L)&#xA;//AI chooses Lizard (L)&#xA;$ php -f rsplsp.php L&#xA;It's a tie&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard loopholes apply.&lt;/li&gt;&#xA;&lt;li&gt;The computer must choose an input at random (pseudo random) so that on each program run, the AI chooses (in a perfect world) a different input and that each input has the same percentage of being chosen.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is code-golf so the shortest code in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="38505" LastEditorUserId="38505" LastEditDate="2017-03-13T14:35:27.303" LastActivityDate="2017-03-13T14:35:27.303" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11755" PostTypeId="2" ParentId="5328" CreationDate="2017-03-13T16:51:51.727" Score="28" Body="&lt;h1&gt;Yes, I do!&lt;/h1&gt;&#xA;&lt;p&gt;I work for &lt;a href=&quot;http://dyalog.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Dyalog&lt;/a&gt;. Part of my work is &amp;quot;spreading the word&amp;quot;, and that officially includes code-golfs. This is from an official internal document pertaining to me:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/wM9ln.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/wM9ln.png&quot; alt=&quot;A1: Main duties &amp;amp; responsibilities: ― Code Golf, ―&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In fact, when we &lt;a href=&quot;https://www.dyalog.com/careers.htm#appdev&quot; rel=&quot;nofollow noreferrer&quot;&gt;hire for our APL team&lt;/a&gt;, we are more interested in golfers than &lt;a href=&quot;https://stackoverflow.com/jobs&quot;&gt;regular programmers&lt;/a&gt;, as the former are more likely to have the right mindset. This community has already given us both an intern and &lt;a href=&quot;https://www.dyalog.com/meet-team-dyalog.htm#Rodrigo&quot; rel=&quot;nofollow noreferrer&quot;&gt;employee&lt;/a&gt; after &lt;a href=&quot;https://www.dyalog.com/blog/2021/08/welcome-karta-kooner/&quot; rel=&quot;nofollow noreferrer&quot;&gt;employee&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2022-10-24T04:02:18.620" LastActivityDate="2022-10-24T04:02:18.620" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="11757" PostTypeId="1" AcceptedAnswerId="11758" CreationDate="2017-03-13T16:59:05.007" Score="3" ViewCount="150" Body="&lt;p&gt;&lt;a href=&quot;http://dyalog.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Dyalog&lt;/a&gt;'s APL team is &lt;a href=&quot;http://dyalog.com/careers.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;looking to hire&lt;/a&gt;, and we are more interested in golfers than &lt;a href=&quot;https://stackoverflow.com/jobs&quot;&gt;regular programmers&lt;/a&gt;, as the former are more likely to have the right mindset.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since codegolf.stackexchange.com/jobs doesn't exist, could it be created?&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="68942" LastEditDate="2021-06-09T05:35:03.943" LastActivityDate="2021-06-09T05:35:03.943" Title="PPCG equivalent to http://stackoverflow.com/jobs" Tags="|discussion|feature-request|status-declined|policy|advertising|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11758" PostTypeId="2" ParentId="11757" CreationDate="2017-03-13T20:07:20.917" Score="3" Body="&lt;p&gt;I don't think an equivalent to the Jobs program on SO is really appropriate for our site. For most of the jobs, they'd be the same ones advertised on SO, so it would be better to keep the postings consolidated there.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For your specific example, a community ad may be a better option. If not, mentioning it in The Nineteenth Byte will give it some good exposure.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-03-13T20:07:20.917" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11759" PostTypeId="2" ParentId="2140" CreationDate="2017-03-13T22:21:42.047" Score="2" Body="&lt;p&gt;&lt;strong&gt;Challenge about loudly interjecting in a courtroom&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One of the most important things about being a courtroom lawyer is loudly interjecting before you make your point. In this challenge, we're going to edit a typical courtroom transcript to include these interjections.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any lawyer (and in fact, any character at all in the transcript), uses these rules to interject:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;Use an interjection when the character who is speaking changes to you.&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Take the following example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;SAHWIT: I remember the time I found the body exactly.&#xA;SAHWIT: It was 1 P.M.&#xA;PHOENIX: Frankly, I find that hard to believe!&#xA;PHOENIX: Your statement directly contradicts the autopsy report.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There is one change in speaker, so an interjection will be added in at that point like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;SAHWIT: I remember the time I found the body exactly.&#xA;SAHWIT: It was 1 P.M.&#xA;PHOENIX: Hold it! Frankly, I find that hard to believe!&#xA;PHOENIX: Your statement directly contradicts the autopsy report.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;2&quot;&gt;&#xA;  &lt;li&gt;Use &lt;strong&gt;Hold it!&lt;/strong&gt; if the previous statement ends with a single full-stop or exclamation mark, &lt;strong&gt;Take that!&lt;/strong&gt; if the previous statement ends with an elipses (...), and &lt;strong&gt;Objection!&lt;/strong&gt; if the previous statement ends with a question mark.&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;For instance:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;JUDGE: What evidence proves the clock is running slow?&#xA;PHOENIX: The victim had just returned from abroad the day before the murder.&#xA;PHOENIX: The time difference between here and Paris is 9 hours!&#xA;PAYNE: But modern day clocks automatically adjust for time zones...&#xA;PHOENIX: This is an antique!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Becomes:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;JUDGE: What evidence proves the clock is running slow?&#xA;PHOENIX: Objection! The victim had just returned from abroad the day before the murder.&#xA;PHOENIX: The time difference between here and Paris is 9 hours!&#xA;PAYNE: Hold it! But modern day clocks automatically adjust for time zones...&#xA;PHOENIX: Take that! This is an antique!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;That's about it. I'll write some longer test cases a bit later. This challenge is probably Retina-bait to be honest.&lt;/p&gt;&#xA;" OwnerUserId="21682" LastEditorUserId="21682" LastEditDate="2017-03-16T01:29:20.360" LastActivityDate="2017-03-16T01:29:20.360" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11761" PostTypeId="1" CreationDate="2017-03-13T23:32:14.950" Score="1" ViewCount="79" Body="&lt;p&gt;It has been my goal for a while to make a Brain-Flak answer on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/112448/answer-chaining-positive-divisors-of-a-number&quot;&gt;this&lt;/a&gt; question.  As of post we are 30 characters away from achieving this (15 are allowed per post).  I have developed an answer that will put us at 15 away, but because of the rules on the challenge no one may post twice in a row, so someone else would post the Brain-Flak answer I have been working towards.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While discussing this dilemma in chat it was suggested that I give the answer I developed to someone else to post so that I wouldn't have gone last.  However this seems like an intentional subversion of the rules.  It is my answer and using other users to get around the rules of the challenge seems might be unfair to users who are new to the site or are not as active in social features of the site like The Nineteenth Byte.  It might also set a precedent that might justify using sock accounts to get around the limitation on posting for such challenges.  Can another user post an answer I made one an answer chaining question with consecutive answer restrictions?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Not allowing people to answer twice in a row is a pretty common stipulation in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; questions, so answers should be generalized to all such questions not the specific one I am concerned with.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:24.147" LastActivityDate="2017-03-14T08:31:20.670" Title="Can I give someone else my answer for a Answer chaining question?" Tags="|discussion|answer-chaining|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11762" PostTypeId="2" ParentId="11761" CreationDate="2017-03-14T00:41:13.103" Score="4" Body="&lt;p&gt;If you had worked with the other user to come up with the solution, having them post it because you posted the last answer would be fine, because it's at least partly their work too. However, in this case, you did all of the work, and asking another user to post your answer just so you can post another answer you've been working on seems like pretty clear subversion of the rules. So, don't do that. Just be patient and wait for another user to post an answer.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-03-14T00:41:13.103" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11763" PostTypeId="2" ParentId="2140" CreationDate="2017-03-14T00:42:22.890" Score="0" Body="&lt;h2&gt;&lt;s&gt;All your base are belong to us&lt;/s&gt; 6 * 9 = 42&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When Douglas Adams wrote THHGTTG, he just made up a formula for the answer to Life, the Universe and Everything. And then some spoilsport pointed out that it was a valid formula... when interpreted in base 13.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an input formula, please output as many bases as you can find where the formula is valid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must at a minimum support base 10 to base 16 inclusive, but you are strongly recommended to support base 2 to at least base 36.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must at a minimum support the &lt;code&gt;()*+=&lt;/code&gt; operators, but you are strongly recommended to support &lt;code&gt;-&lt;/code&gt; and &lt;code&gt;/&lt;/code&gt;, and either &lt;code&gt;**&lt;/code&gt; or &lt;code&gt;^&lt;/code&gt; for exponentiation. Note that the division will always be exact in valid bases, but may not be exact in invalid bases, so for &lt;code&gt;11/2=8&lt;/code&gt; you should only output &lt;code&gt;15&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;11/2=8&#xA;15&#xA;&#xA;10+10=10*10&#xA;2&#xA;&#xA;6*9=42&#xA;13&#xA;&#xA;11**11=2101&#xA;3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer that breaks no standard loopholes wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2017-03-14T00:42:22.890" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11764" PostTypeId="2" ParentId="11761" CreationDate="2017-03-14T08:31:20.670" Score="3" Body="&lt;p&gt;The point of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; is that the challenge comes from the constraints imposed by the previous answer. The existence of a rule prohibiting two consecutive answers by the same person reinforces that point. Giving away an answer as an end-run around the rule would be intentionally violating the spirit of the game. If people start doing that then I think there would be a case for no longer considering &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; questions on topic because they would no longer be real contests nor challenges.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-03-14T08:31:20.670" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11765" PostTypeId="1" CreationDate="2017-03-14T15:23:20.193" Score="0" ViewCount="49" Body="&lt;p&gt;Say language X supports functions, but input must be done through one of the predefined global variables (all initialized to zero). Can I consider this a use of an argument? Similarly can I use this global variable (or another) as an &quot;output argument&quot;. I believe the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/46918&quot;&gt;standards&lt;/a&gt; are unclear on this.&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="-1" LastEditDate="2017-03-16T16:38:31.747" LastActivityDate="2017-03-14T15:54:19.660" Title="Clarification of global variables as &quot;arguments&quot;" Tags="|discussion|" AnswerCount="0" CommentCount="2" ClosedDate="2017-03-14T16:56:29.623" ContentLicense="CC BY-SA 3.0" />
  <row Id="11768" PostTypeId="1" CreationDate="2017-03-14T19:57:25.267" Score="3" ViewCount="162" Body="&lt;p&gt;This is a crazy (crazy as in crazy weird) issue. If a challenge defines a quine as&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A quine is a non-empty computer program which takes no input and produces a copy of its own source code as its only output.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;And the meta says:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A quine is payload-capable if it can be extended, in some systematic manner, to include a &amp;quot;payload&amp;quot; of additional code capable of performing arbitrary computation, in addition to printing its source code. A payload-capable quine, in its base form, must include all the code necessary to carry and execute a payload, even if no actual payload is present.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;And&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A quine is a non-empty computer program which takes no input and produces a copy of its own source code as its only output.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Also&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;It must be possible to identify a section of the program which encodes a different part of the program. (&amp;quot;Different&amp;quot; meaning that the two parts appear in different positions.)&#xA;Furthermore, a quine must not access its own source, directly or indirectly.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;They are all from different people. The first is a user the second Kevin Workman and the third is Martin. Who is right? And if a challenge defines a quine as different wouldn't that override the meta?&lt;/p&gt;&#xA;&lt;p&gt;The issue arose from my answer to &amp;quot;Golf you a quine for great good&amp;quot; that follows. Would it be valid?&lt;/p&gt;&#xA;&lt;h1&gt;HQ9+ 12 bytes (non cheating)&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;Hello World!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;HQ9+ is a bit cheaty with the use of Q to quine. But if you write a program in it with &lt;code&gt;Hello World!&lt;/code&gt; it detects the H and prints &lt;code&gt;Hello World!&lt;/code&gt; and thus quines.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/36038760#36038760&quot;&gt;Relevant chat transcript starts here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-15T12:20:18.277" Title="Who is right in defining the meaning of a word: meta or challenge?" Tags="|discussion|quine|" AnswerCount="1" CommentCount="5" ClosedDate="2017-03-15T22:54:10.327" ContentLicense="CC BY-SA 3.0" />
  <row Id="11774" PostTypeId="2" ParentId="11768" CreationDate="2017-03-15T12:20:18.277" Score="3" Body="&lt;h1&gt;How to resolve rules:&lt;/h1&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;All rules apply, including meta and rules posted on the question.&lt;/li&gt;&#xA;&lt;li&gt;If there are two rules that conflict:  The posted question takes priority, followed by the most upvoted meta answer.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;In your case:&lt;/p&gt;&#xA;&lt;p&gt;The definition of a quine in the question &amp;quot;&lt;code&gt;A quine is a non-empty computer program which takes no input and produces a copy of its own source code as its only output&lt;/code&gt;&amp;quot; does &lt;em&gt;not&lt;/em&gt; conflict with the meta answers.&lt;/p&gt;&#xA;&lt;p&gt;However, on the meta, we have two alternatives that &lt;em&gt;are&lt;/em&gt; competing:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&amp;quot;&lt;code&gt;It must be possible to identify a section of the program which encodes a different part of the program&lt;/code&gt;&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;&lt;code&gt;Solutions must be payload-capable, and must not read their source code or use string eval&lt;/code&gt;&amp;quot;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The first one is the most upvoted one, and therefore takes priority.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-15T12:20:18.277" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11780" PostTypeId="1" AcceptedAnswerId="11799" CreationDate="2017-03-16T05:36:27.427" Score="1" ViewCount="120" Body="&lt;p&gt;My understanding is that, when stdout is used for output, stderr is ignored. Similarly, it would seem that, when a function's return value is used for output, stdout and stderr should be ignored. After all, this Racket code prints &lt;code&gt;#&amp;lt;procedure&amp;gt;&lt;/code&gt;, and yet no one would complain about it: &lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(lambda (x) x)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;My use case is that, in an answer I'm working on, defining a function prints its name because of the requirements of the problem and a quirk of the language. This is not just about code golf (actually, it's for a cops-and-robbers challenge).&lt;/p&gt;&#xA;" OwnerUserId="56183" LastEditorUserId="56183" LastEditDate="2017-03-16T06:06:57.250" LastActivityDate="2017-03-18T19:12:33.537" Title="Should stdout be ignored when the program is a function?" Tags="|discussion|policy|answers|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11784" PostTypeId="1" CreationDate="2017-03-17T06:42:36.273" Score="2" ViewCount="113" Body="&lt;p&gt;I recently had the idea of making an annual contest in PPCG, like the Google Code Jam.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I went through this question. &quot;Should we really hold an annual contest? If we should, how?&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Could you tell me if we should make one or not, and if yes, with some possible ways to do it?&lt;/p&gt;&#xA;" OwnerUserId="64499" LastActivityDate="2017-03-18T11:52:00.397" Title="Should we hold an annual contest?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11785" PostTypeId="2" ParentId="6918" CreationDate="2017-03-17T07:39:40.270" Score="3" Body="&lt;h1&gt;Karaoke&lt;/h1&gt;&#xA;&lt;p&gt;Karaoke is a scripting language created by me for internal use at a company I was working for in November 2013 (if you don't mind, I would avoid putting the name of the company here). I coordinated its development until September 2016 when I left the company.&lt;/p&gt;&#xA;&lt;p&gt;The interpreter is not open-source, unfortunately, and not available to the general public, the company is using it for internal testing of their algorithms. There is no reference to the language on the company web site, and the name is not referenced anywhere, so I am sorry, I can't provide any evidence of doing it.&lt;/p&gt;&#xA;&lt;p&gt;The syntax is based on Javascript, but with some Ruby in it. It's loosely object-oriented, but all available classes are part of the standard library, and the user can not define new classes in the language itself. The user can however define new functions.&lt;/p&gt;&#xA;&lt;p&gt;The interpreter was built starting from a lex file, and was a simple one-pass scanner in the first versions, then I added a parser written in yacc in order to implement the object system and the control structures.&lt;/p&gt;&#xA;&lt;p&gt;The features I liked particularly:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Default variable: the last result is stored into the default variable &amp;quot;_&amp;quot; which is used as an input value to the next function call.&lt;/li&gt;&#xA;&lt;li&gt;Shortcuts: every object has a standard method which can be called using the bracket operator. So if &lt;code&gt;s&lt;/code&gt; was an &lt;code&gt;outputstream&lt;/code&gt; object and the default method of the &lt;code&gt;outputstream&lt;/code&gt; class was &lt;code&gt;println&lt;/code&gt; you could just call &lt;code&gt;s(&amp;quot;Hello World&amp;quot;)&lt;/code&gt;. Method names could be abbreviated like in goruby.&lt;/li&gt;&#xA;&lt;li&gt;Dynamic reference: this was, I think, the only feature of the language I did not directly steal from another existing language (but was of course inspired by similar features). You could define a value as a dynamic reference by adding a '&amp;amp;' in front of it. So if &lt;code&gt;x=5; y=6; a=x+y&lt;/code&gt; and &lt;code&gt;b=&amp;amp;x+y&lt;/code&gt;, then a would always be 11, but the value of b would change dynamically when you cnahged the value of x or y.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And then of course a lot of domain-specific features like input processing, output in some particular format, and interface to the library we wanted to test... It started like a fun experiment but at the end it was just another COBOL.&lt;/p&gt;&#xA;" OwnerUserId="18535" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-17T07:39:40.270" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11787" PostTypeId="1" AcceptedAnswerId="11788" CreationDate="2017-03-17T16:23:40.543" Score="7" ViewCount="284" Body="&lt;p&gt;When I create a post, and it does not get any, or little, response, I make a small edit, like adding a space where no one will notice it, to make it re-appear on the front page.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this okay?&lt;/p&gt;&#xA;" OwnerUserId="64159" LastActivityDate="2017-03-18T22:33:12.533" Title="Editing a Post to get Publicity" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11788" PostTypeId="2" ParentId="11787" CreationDate="2017-03-17T16:36:36.343" Score="26" Body="&lt;h2&gt;No, this is not OK.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The front page serves many purposes, but &lt;em&gt;get views for free&lt;/em&gt; isn't one of them. You don't have to worry about making too many edits as long as they're intended to &lt;em&gt;improve&lt;/em&gt; the post, but please don't edit them just to bump.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Assuming you mean questions, the proper way of drawing attention to them is to place a small bounty. These start at &lt;strong&gt;50&lt;/strong&gt; rep and, if the challenge is interesting, usually pay for themselves.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's no such facility for answers. Even the best ones can remain unnoticed. While that's unfortunate, I can't think of a way to fix this.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="36398" LastEditDate="2017-03-17T22:32:46.650" LastActivityDate="2017-03-17T22:32:46.650" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11791" PostTypeId="1" AcceptedAnswerId="11830" CreationDate="2017-03-17T22:27:21.743" Score="0" ViewCount="279" Body="&lt;p&gt;I was going to give the green tick mark to the winning submission of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/111380/i-copied-my-password-to-the-clipboard-can-you-delete-it&quot;&gt;this challenge&lt;/a&gt;, but I am unsure what to do. The shortest submission is &lt;a href=&quot;https://codegolf.stackexchange.com/a/111883/36398&quot;&gt;this&lt;/a&gt;, which claims to use &quot;Windows language&quot;, but I doubt that Windows can be considered a language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What do you think? I know &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/36398&quot;&gt;our official definition&lt;/a&gt; of programming language, but I don't see if/how it allows or rules out &quot;Windows&quot; as a language.&lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2017-11-16T23:49:23.327" LastActivityDate="2017-11-16T23:49:23.327" Title="&quot;Windows&quot; as a programming language?" Tags="|discussion|policy|answers|" AnswerCount="1" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="11792" PostTypeId="1" CreationDate="2017-03-17T22:30:18.733" Score="2" ViewCount="96" Body="&lt;p&gt;Preliminary question: is it valid to score Excel in keystrokes? I guess it is, but I'm not sure what our policy is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Assuming it is (or, in general, for languages that are scored in keystrokes), does Ctrl-C count as one keystroke or two?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it is two, would uppercase &quot;A&quot; be two keystrokes as well? Can for example be assumed that Caps-Lock is initially on?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In case some context is needed: &lt;a href=&quot;https://codegolf.stackexchange.com/a/111884/36398&quot;&gt;this&lt;/a&gt; is the answer that uses Ctrl-C in Excel and caused me to ask about this.&lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2017-03-17T23:01:16.580" Title="Is Ctrl-C one keystroke or two?" Tags="|discussion|policy|code-golf|answers|" AnswerCount="1" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="11794" PostTypeId="2" ParentId="11792" CreationDate="2017-03-17T23:01:16.580" Score="5" Body="&lt;h1&gt;One Keystroke&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A key sequence such as Ctrl+C is the 'C' key event with a 'Ctrl' key modifier. It's one singular input to the computer. This reasoning is used in some programming languages including &lt;a href=&quot;https://docs.oracle.com/javase/7/docs/api/javax/swing/KeyStroke.html#getKeyStroke(java.lang.Character,%20int)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Java&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="51785" LastActivityDate="2017-03-17T23:01:16.580" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11795" PostTypeId="2" ParentId="11784" CreationDate="2017-03-18T01:31:02.590" Score="1" Body="&lt;h1&gt;My basic idea&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Get participants for a set period of time.&lt;/li&gt;&#xA;&lt;li&gt;Have 5 rounds, each with 3 problems. ([participants count]/5) people with the most sum of bytes (or score depending on the problem) will be eliminated.&lt;/li&gt;&#xA;&lt;li&gt;Give a set amount of bounty to the first, second and third winners.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Some more ideas&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Set a language each round to make the game fair.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="64499" LastEditorUserId="64499" LastEditDate="2017-03-18T11:52:00.397" LastActivityDate="2017-03-18T11:52:00.397" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11796" PostTypeId="2" ParentId="2140" CreationDate="2017-03-18T06:14:46.737" Score="1" Body="&lt;h1&gt;Pratt certificates&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(bumping this proposal to see if there's any interest or comments. If so, speak now; if not, I'll delete)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task: write code that generates a &lt;a href=&quot;https://en.wikipedia.org/wiki/Primality_certificate#Pratt_certificates&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pratt certificate&lt;/a&gt; for a prime number, and write code that verifies an existing Pratt certificate.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What's a Pratt certificate?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A Pratt certificate for a prime number &lt;code&gt;p&lt;/code&gt; is a proof, of a particular type, that &lt;code&gt;p&lt;/code&gt; is indeed prime. Historically, it was used in situations where proving the primality of &lt;code&gt;p&lt;/code&gt; required a computation that was slow due to factoring &lt;code&gt;p-1&lt;/code&gt;, but verifying the certificate (once the initial computation generated it) was quite fast.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A Pratt certificate for &lt;code&gt;p&lt;/code&gt; is a recursive structure consisting of three parts: the prime &lt;code&gt;p&lt;/code&gt; itself; a &quot;witness&quot; integer &lt;code&gt;g&lt;/code&gt; (which is actually a &lt;a href=&quot;https://en.wikipedia.org/wiki/Primitive_root_modulo_n&quot; rel=&quot;nofollow noreferrer&quot;&gt;primitive root&lt;/a&gt; modulo &lt;code&gt;p&lt;/code&gt;; see the next section for its properties); and Pratt certificates for all primes dividing &lt;code&gt;p-1&lt;/code&gt;. The prime &lt;code&gt;p=2&lt;/code&gt; is special: a Pratt certificate for &lt;code&gt;2&lt;/code&gt; is just &lt;code&gt;2&lt;/code&gt; itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, here is a Pratt certificate for &lt;code&gt;p=3911&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{3911, 13, {2, {5, 2, {2}}, {17, 3, {2}}, {23, 5, {2, {11, 2, {2, {5, 2, {2}}}}}}}}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The witness is &lt;code&gt;13&lt;/code&gt;, and the prime factors of &lt;code&gt;3911-1&lt;/code&gt; are &lt;code&gt;2&lt;/code&gt;, &lt;code&gt;5&lt;/code&gt;, &lt;code&gt;17&lt;/code&gt;, and &lt;code&gt;23&lt;/code&gt;; each of those new primes itself has a Pratt certificate, which are respectively &lt;code&gt;2&lt;/code&gt;, &lt;code&gt;{5, 2, {2}}&lt;/code&gt;, &lt;code&gt;{17, 3, {2}}&lt;/code&gt; and &lt;code&gt;{23, 5, {2, {11, 2, {2, {5, 2, {2}}}}}&lt;/code&gt;. In this last Pratt certificate, the prime factors of &lt;code&gt;23&lt;/code&gt; are &lt;code&gt;2&lt;/code&gt; and &lt;code&gt;11&lt;/code&gt;, so a Pratt certificate for &lt;code&gt;11&lt;/code&gt; must be included, and so on.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;How do we generate a Pratt certificate?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a prime &lt;code&gt;p&lt;/code&gt;, a Pratt certificate can be generated by finding a primitive root &lt;code&gt;g&lt;/code&gt; modulo &lt;code&gt;p&lt;/code&gt;; factoring &lt;code&gt;p-1&lt;/code&gt; into primes (keeping only one copy of each prime factor); and recursively generating Pratt certificates for every prime factor of &lt;code&gt;p-1&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;How do we verify a Pratt certificate?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a prime &lt;code&gt;p&lt;/code&gt;, a witness &lt;code&gt;g&lt;/code&gt;, and the prime factors &lt;code&gt;q1&lt;/code&gt;, &lt;code&gt;q2&lt;/code&gt;, ... of &lt;code&gt;p-1&lt;/code&gt;, a Pratt certificate is verified by checking:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;that &lt;code&gt;p-1&lt;/code&gt; has no prime factors other than &lt;code&gt;q1&lt;/code&gt;, &lt;code&gt;q2&lt;/code&gt;, ...;&lt;/li&gt;&#xA;&lt;li&gt;that the power &lt;code&gt;g^(p-1)&lt;/code&gt; is congruent to &lt;code&gt;1&lt;/code&gt; modulo &lt;code&gt;p&lt;/code&gt;;&lt;/li&gt;&#xA;&lt;li&gt;that none of the smaller powers &lt;code&gt;g^((p-1)/q1)&lt;/code&gt;, &lt;code&gt;g^((p-1)/q2)&lt;/code&gt;, ... are congruent to &lt;code&gt;1&lt;/code&gt; modulo &lt;code&gt;p&lt;/code&gt;; and&lt;/li&gt;&#xA;&lt;li&gt;that each of the Pratt certificates of &lt;code&gt;q1&lt;/code&gt;, &lt;code&gt;q2&lt;/code&gt;, ... are themselves valid.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring and technicalities&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You must write two programs or functions (or one of each): one that takes a prime number as input and returns its Pratt certificate; and one that takes an input formatted like a Pratt certificate and returns a truthy or falsy value depending on whether it is an actual Pratt certificate.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may choose any reasonable format for the Pratt certificate: nested lists (like the examples in this question), indented multiline strings (like the &lt;a href=&quot;https://en.wikipedia.org/wiki/Primality_certificate#Pratt_certificates&quot; rel=&quot;nofollow noreferrer&quot;&gt;example on the Wikipedia page&lt;/a&gt;), or something similar that a human being could be trivially trained into parsing by eye. You may use any reasonable convention for the trivial Pratt certificate for &lt;code&gt;2&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;However: whatever format you choose for the Pratt certificate, your certificate-generating code must output the same format that you take as input to your certificate-verifying code. Note that your certificate-verifying code must be capable of verifying any possible Pratt certificate (in your format) for &lt;code&gt;p&lt;/code&gt;, not just the one your other program generates for &lt;code&gt;p&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If you want, you may write a single program or function that accomplishes both tasks; in that case, your code can either determine which task is being asked of it implicitly from the input, or it can allow the user to instruct it which task to perform in some reasonable way.&lt;/li&gt;&#xA;&lt;li&gt;Regardless of whether you use one or two programs, no calculation can be shared or saved between different runs of the code. The programs must work correctly, on any individual prime input and on any individual certificate-shaped input, if it is the first time that code is ever being run on that system.&lt;/li&gt;&#xA;&lt;li&gt;You don't have to handle bogus input. You may always assume that the input to your first program is an actual prime number, and that your input to the second program syntactically matches your Pratt certificate format.&lt;/li&gt;&#xA;&lt;li&gt;Built-ins that generate or verify Pratt certificates are &lt;em&gt;not&lt;/em&gt; allowed. Other types of built-ins (for example, those that factor integers, raise integers to powers in modular arithmetic, find primitive roots) are acceptable.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shorter code (in bytes) is better. If two programs are used, the total number of bytes in both programs is the score; if one program is used, its number of bytes is the score.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example Pratt certificates given prime inputs&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(Note that there are many possible witnesses for any given prime, but the rest of the certificate is unique up to reordering.)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;31 -&amp;gt; {31, 3, {2, {3, 2, {2}}, {5, 2, {2}}}}&#xA;127 -&amp;gt; {127, 3, {2, {3, 2, {2}}, {7, 3, {2, {3, 2, {2}}}}}}&#xA;229 -&amp;gt; {229, 6, {2, {3, 2, {2}}, {19, 2, {2, {3, 2, {2}}}}}}&#xA;1093 -&amp;gt; {1093, 5, {2, {3, 2, {2}}, {7, 3, {2, {3, 2, {2}}}}, {13, 2, {2, {3, 2, {2}}}}}}&#xA;65537 -&amp;gt; {65537, 3, {2}}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(All the above outputs are examples of truthy inputs for the Pratt-certificate checking code.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example falsy inputs for Pratt-certificate checking&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{31, 2, {2, {3, 2, {2}}, {5, 2, {2}}}}&#xA;{31, 3, {2, {3, 2, {2}}}&#xA;{31, 3, {2, {3, 2, {2}}, {5, 2, {2, {3, 2, {2}}}}}}&#xA;{127, 2, {2, {3, 2, {2}}, {5, 2, {2}}}}&#xA;{85, 4, {6, 5, {5, 2, {2}}}, {14, 3, {13, 2, {2, {3, 2, {2}}}}}}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="56178" LastEditorUserId="56178" LastEditDate="2017-04-12T00:54:16.670" LastActivityDate="2017-04-12T00:54:16.670" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11797" PostTypeId="1" AcceptedAnswerId="11822" CreationDate="2017-03-18T08:02:51.773" Score="2" ViewCount="129" Body="&lt;p&gt;Maybe &quot;abusing&quot; is the wrong word, but... like a lot of new users do, I come here and look around, if a new challenge is out, answer it as quickly as possible, only to find out that sometimes a challenge gets very high quality answers in a short time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We all know how it works: that challenge has been in the sandbox for some time, a lot of &quot;expert&quot; users have had the time to prepare their answers, and post it as soon as the challenge is &quot;promoted&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think this can be unfair to new users, but actually I don't know how I would solve that. Any suggestion? Or maybe it's not a problem, and anybody should be free to do as they want?&lt;/p&gt;&#xA;" OwnerUserId="18535" LastActivityDate="2017-03-20T12:54:21.453" Title="Abusing the sandbox" Tags="|discussion|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11798" PostTypeId="2" ParentId="11797" CreationDate="2017-03-18T08:34:25.707" Score="1" Body="&lt;p&gt;This isn't a problem to me. Sure the fastest gun in the west effect exists here, but earlier answers aren't correlated with more votes here. Often, those fast answers have room for significant improvement.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's nothing we can do to keep people from developing answers while a challenge is sandboxed (and anything we would attempt would likely discourage the use of the Sandbox, which is the exact opposite of what we want).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-03-18T08:34:25.707" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11799" PostTypeId="2" ParentId="11780" CreationDate="2017-03-18T11:30:48.183" Score="4" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9658/45941&quot;&gt;policy we have in place for code golf&lt;/a&gt; makes the most sense: you can choose exactly one acceptable output format, and ignore all others. There's no reason not to apply this to CnR challenges as well. You should make it clear which output method is being used if it's not blatantly obvious.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2017-03-18T19:12:33.537" LastActivityDate="2017-03-18T19:12:33.537" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11800" PostTypeId="2" ParentId="2140" CreationDate="2017-03-18T12:39:43.087" Score="0" Body="&lt;h2&gt;Nearly-match a string&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Our near miss algorithm is too slow. The boss is blaming the Levenshtein distance builtin for being overkill for our purpose as we're only interested in a distance of 1. Please code something leaner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: Two different strings, in any reasonable format. At least 36 different characters should be supported.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: A truthy/falsy value which distinguishes between strings with a Levenshtein distance of 1 or more than 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins! Builtins that calculate the Levenshtein distance are not allowed.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2017-03-18T12:39:43.087" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11801" PostTypeId="2" ParentId="2140" CreationDate="2017-03-18T17:24:39.723" Score="0" Body="&lt;h1&gt;Shh... Can you Split a Secret? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cryptography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cryptography&amp;#39;&quot; rel=&quot;tag&quot;&gt;cryptography&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;In &lt;em&gt;Applied Cryptography&lt;/em&gt; by Bruce Schnieier (which I have been reading quite a lot recently), a protocol for splitting secrets is discussed. Here is a brief description:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Trent generates a random string, &lt;em&gt;R&lt;/em&gt;, the same length as the message, &lt;em&gt;M&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Trent XORS &lt;em&gt;M&lt;/em&gt; with &lt;em&gt;R&lt;/em&gt; to make &lt;em&gt;S&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;He gives &lt;em&gt;R&lt;/em&gt; to Alice and &lt;em&gt;S&lt;/em&gt; to Bob.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Your task is to, given an input, split the input into the two outputs. One output should contain the random string; the other should contain the original input XOR'd with the random string. Input and output may be to/from files or to/from STDIN/STDOUT. Outputting to STDERR is also allowed.&lt;br /&gt;&#xA;There are a few restrictions, however:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Your program must take 3 inputs, and output the random string and the original string XOR'd with that random string into the other.&lt;/li&gt;&#xA;&lt;li&gt;Your program must be cryptographically secure. All random number generators must be cryptographically secure. For example, &lt;code&gt;/dev/random&lt;/code&gt; is fine, but the Mersenne Twister (usually &lt;code&gt;randint(number,number)&lt;/code&gt; is &lt;em&gt;not&lt;/em&gt;. Any random number generator must be &lt;em&gt;explicitly&lt;/em&gt; cryptographically secure.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If you want to know anything more about what &amp;quot;cryptographically secure&amp;quot; means, check &lt;a href=&quot;https://crypto.stackexchange.com/questions/39186/what-does-it-mean-for-a-random-number-generator-to-be-cryptographically-secure&quot;&gt;here&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Standard rules and loopholes apply.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the code with the fewest bytes will win.&lt;br /&gt;&#xA;May the best coder prosper...&lt;/p&gt;&#xA;" OwnerUserId="64706" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-18T17:57:39.870" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="11805" PostTypeId="1" CreationDate="2017-03-18T22:47:14.833" Score="10" ViewCount="131" Body="&lt;p&gt;The current stylesheet specifies the code font as &lt;code&gt;Consolas,Menlo,Monaco,Lucida Console,Liberation Mono,DejaVu Sans Mono,Bitstream Vera Sans Mono,Courier New,monospace,sans-serif&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, the first fonts are not very good for programming languages with non-ASCII symbols, e.g. the not-identical symbol &lt;code&gt;≢&lt;/code&gt; &lt;a href=&quot;https://bugs.chromium.org/p/chromium/issues/detail?id=620629&quot; rel=&quot;nofollow noreferrer&quot;&gt;renders wrong on Chrome for Windows&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;DejaVu Sans Mono supports a wide swath of Unicode, and is indeed &lt;a href=&quot;https://tio.run/nexus&quot; rel=&quot;nofollow noreferrer&quot;&gt;the font used on TIO&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We should specify that font first.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="68942" LastEditDate="2021-06-09T05:29:51.527" LastActivityDate="2021-06-09T05:29:51.527" Title="Change code font to DejaVu" Tags="|feature-request|status-declined|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11806" PostTypeId="2" ParentId="2140" CreationDate="2017-03-19T04:33:03.553" Score="-2" Body="&lt;h1&gt;Print the Previous Program&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Specifications:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You must print the exact text of the previous answer without ever having a sequence of more than 5 letters in a row in your program that also show up in the previous answer (prevents hardcoding). Your program must only use UTF-8 characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may repeat a language; however, you may not post twice in a row and no two of your consecutive answers may be from the same language class (different versions are treated as the same language).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The first language is to print the exact text &quot;Hello, World!&quot;&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;0-byte submissions are not allowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By the way, this is just a draft, it might be a dupe or really closely related, and probably has more holes in it than Swiss cheese so please give me any suggestions you have. Thanks.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, my drafted scoring system is something like &lt;code&gt;bytes / answer_num&lt;/code&gt; where &lt;code&gt;answer_num&lt;/code&gt; is which answer yours is (on a time scale).&lt;/p&gt;&#xA;" OwnerDisplayName="user42649" LastEditorDisplayName="user42649" LastEditDate="2017-03-19T18:55:09.340" LastActivityDate="2017-03-19T18:55:09.340" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="11807" PostTypeId="1" CreationDate="2017-03-19T06:46:14.160" Score="60" ViewCount="900" Body="&lt;p&gt;For whatever reason, PPCG tends to get a lot of off-topic questions, generally about code-troubleshooting. Maybe it's because &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8354/31716&quot;&gt;our help-center is inaccurate&lt;/a&gt;. Or maybe it's simply because we're a large-ish site with a lot of activity but very few questions per day, so each off-topic question is more noticeable. Either way, PPCG unfortunately has to handle lots of off-topic questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On one hand, I think we handle these questions very well. I don't have any hard data, but as far as I have seen, most blatantly OT questions are closed in under 5 minutes, and frequently deleted within the same day. This is excellent! But on the other hand, I'm noticing a disturbing trend in the &lt;em&gt;comment section&lt;/em&gt; of the off-topic questions we get. Generally off-topic questions get comments like:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;You're on the wrong site.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;We're not gonna write code for you, and stack-overflow won't either.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In even worse cases, some users will post completely unhelpful/trolling comments on off-topic questions. For example:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;D:&amp;lt; Y U NO CRITERIA?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Or the worst example I can think of is where one user provided broken code to &lt;em&gt;troll&lt;/em&gt; the OP. Since the comment is now deleted, I don't know if the code was harmful or simply wrong, but either way, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1514/31716&quot;&gt;code-trolling&lt;/a&gt; is not something we want to allow in &lt;em&gt;any&lt;/em&gt; context.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, I haven't linked to any of these examples because I'm not trying to shame anyone. In fact, I think I'm even a chief offender. For example, I wrote the following comment (Screenshot for &amp;lt;10K users):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ORlk4.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ORlk4.png&quot; alt=&quot;[screenshot]&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I fully understand. After seeing the 84th post about&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;halp my CODEZ DON&quot;T WORK!!!! plz send teh codez quik!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;it's hard to be patient with users who do this. But I just want to reiterate a very important point:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/be-nice&quot;&gt;Be nice&lt;/a&gt;.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;is the primary rule on this site. It's a good read, and nothing on it says anything about &lt;em&gt;be nice to users who follow the rules&lt;/em&gt;. In fact, it even goes out of the way to address this point directly:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Be welcoming, be patient, and assume good intentions. Don't expect new users to know all the rules -- they don't. And be patient while they learn.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;With this in mind, I'd like to propose a set of guidelines for comments on off-topic questions. Of course, these are all specific to &lt;em&gt;off-topic&lt;/em&gt; question. Blatant trolling/spam (which we thankfully get very little of) falls under a different category.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Do&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Explain why their post is off-topic, and what to do about it. This was discussed in chat a little bit earlier, and I think DLosc put it very nicely:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/transcript/message/36133600#36133600&quot;&gt;&quot;Assume that they are confused&quot; is great advice. Don't tell someone they're doing it wrong, tell them how to do it right.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If someone posts a code troubleshooting question, being told &lt;em&gt;you're on the wrong site&lt;/em&gt; will not help at all. Being told &lt;em&gt;We answer programming competitions on this site, so you won't get an answer here. But you can get help on stack overflow instead!&lt;/em&gt; is extremely useful, and provides them a course of action. If the question in blatantly off-topic, even for stack-overflow, you don't need to send them there. But you can still explain that they won't be able to get help here simply because that's not what our site is about.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Flag unhelpful or rude comments. As trichoplax &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11807/be-nice-applies-to-off-topic-questions-too#comment39348_11807&quot;&gt;pointed out in the comments&lt;/a&gt;, flagging comments on off-topic questions is perfectly valid too. Obviously, it should come down to your discretion which comments should be flagged. I would recommend picking either &lt;em&gt;not constructive&lt;/em&gt; or &lt;em&gt;rude or offensive&lt;/em&gt;, depending on how bad the comment is. &lt;a href=&quot;https://meta.stackexchange.com/a/17365/286591&quot;&gt;More info on comment flagging&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Do Not&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Be rude. This kinda goes without saying, but being rude clearly goes against the &lt;em&gt;Be nice&lt;/em&gt; policy. And if that's not enough motivation, remember that these interactions are remembered and stored. We don't want PPCG to get a reputation for being a very clique-y, unwelcoming, and harsh site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, &quot;Be rude&quot; is a very broad term. That means speaking in all caps, name-calling, code-trolling, and many many many other things fall under this category. But it's fairly easy to tell if a comment is rude or not.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Pile on comments. If one user posts a clear, kind, and well-thought out comment about the post being off-topic, that's plenty. If someone else has posted a comment similar to what you want to say, consider just upvoting their comment instead.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Feel obligated to comment. If you're frustrated by seeing the 8th off-topic question in the same day, or you simply don't have time to write out a good comment, remember that you don't really have to comment. A close-vote and/or a downvote is usually sufficient, since there are many other users that aren't frustrated or busy, that can hopefully write out a helpful comment.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Absolutely Do Not&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Answer their question! This applies to comments, answers and even chat. If a question is simply missing a really obvious semicolon, it doesn't matter. They are on the wrong site, and we don't want to encourage the wrong behavior. With all this effort we put into removing bad questions, what's the point if a user can get the answer they want anyway? The most effective way of discouraging off-topic questions, is to simply show that asking here isn't effective.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think a good general purpose comment for off-topic questions is this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Hello, welcome to the site! We host programming competitions and contests on this site, but we don't answer code troubleshooting questions. You may be able to get help on Stack Overflow instead, but they are pretty strict about which questions they accept, so make sure to read through their &lt;a href=&quot;https://stackoverflow.com/help/how-to-ask&quot;&gt;help center&lt;/a&gt; first to make sure your question will be well received. Thanks!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Or, in markdown:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hello, welcome to the site! We host programming competitions and contests on this site, but we don't answer code troubleshooting questions. You may be able to get help on Stack Overflow instead, but they are pretty strict about which questions they accept, so make sure to read through their [help center](https://stackoverflow.com/help/how-to-ask) first to make sure your question will be well received. Thanks!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This does take a while to type out (especially with the links), so if you'd really like to improve your comments, you could use something like &lt;a href=&quot;https://stackapps.com/q/2116/43167&quot;&gt;The Pro Forma Comments Plugin&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, I've complained and ranted a lot in this long post, so I figured I need something encouraging. We're not &lt;em&gt;horrible&lt;/em&gt; (yet). Overall, I think PPCG still has a friendly and welcoming atmosphere. But we are definitely on a downward trend in this aspect.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Writing up this post is hopefully a way to raise awareness about blunt comments that verge on rude, and to hopefully make people rethink what they say in the comment section. It's also a good reminder for me, since like I said, I don't think I've always been the greatest example of being kind to new users.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In short, just &lt;a href=&quot;https://xkcd.com/438/&quot; rel=&quot;nofollow noreferrer&quot;&gt;remember that there's a person on the other side of your screen.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="56656" LastEditDate="2017-09-14T18:03:51.060" LastActivityDate="2017-09-14T18:03:51.060" Title="&quot;Be Nice&quot; applies to off-topic questions too" Tags="|discussion|new-users|comments|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11809" PostTypeId="1" AcceptedAnswerId="11810" CreationDate="2017-03-19T18:45:42.013" Score="2" ViewCount="115" Body="&lt;p&gt;I just checked my PPCG account (2 mins ago) and saw that on all of my answers, someone had upvoted them. I thought to myself &quot;Great! +80 rep!&quot;. Then I thought &quot;Who did this and how can I ask them why&quot; given that all my answers were in my &lt;a href=&quot;https://github.com/ValyrioCode/Valyrio&quot; rel=&quot;nofollow noreferrer&quot;&gt;new language&lt;/a&gt; that so far no one really cares about. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;That's why I'm asking &quot;How can I find out who upvoted my answers?&quot;. Is this possible?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2017-03-19T19:17:33.880" Title="How can I found out who upvoted me" Tags="|support|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11810" PostTypeId="2" ParentId="11809" CreationDate="2017-03-19T19:17:33.880" Score="7" Body="&lt;p&gt;No, it is not. For better or worse, upvotes and downvotes are completely anonymous. Not even moderators can see who voted on which posts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Heads-up: if these eight upvotes were cast in quick succession, there's a decent chance they'll get reversed by the system.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-03-19T19:17:33.880" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11811" PostTypeId="2" ParentId="11807" CreationDate="2017-03-19T21:04:15.180" Score="15" Body="&lt;h1&gt;This also applies in Chat&lt;/h1&gt;&#xA;&lt;p&gt;Often when a post is off topic on the site people will ping the &lt;a href=&quot;http://chat.stackexchange.com/users/-363/new-main-posts&quot;&gt;NewMainPosts&lt;/a&gt; message announcing the question, with complaints or generally unwelcoming statements.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/EyVDZ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/EyVDZ.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Just because new users are less likely to see messages in chat does not mean that they should be any less welcoming to new users.&lt;/p&gt;&#xA;&lt;p&gt;We would not want new users, even those who may have come to the site seeking Stack Overflow or homework help, to feel unwelcome, and such messages to not give the best impression to those who read them.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-27T19:16:16.057" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11812" PostTypeId="1" CreationDate="2017-03-19T21:22:39.280" Score="3" ViewCount="52" Body="&lt;p&gt;This thread is devoted to the development of an answer-chaining stack snippet, which was originally used in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/49223/evolution-of-oeis&quot;&gt;Evolution of OEIS&lt;/a&gt;.  By making this snippet available here (following &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4681/2867&quot;&gt;this meta guideline&lt;/a&gt;), other users can use it as a jumping-off point to make snippets for their own answer-chaining challenges. See also: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5139/leaderboard-snippet&quot;&gt;Leaderboard Snippet&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Feel free to put feature requests and bug reports in answers, or let me know in chat.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The use of this snippet in other challenges will probably require some significant adjustment, since the other challenge will certainly be scraping the answers for different information.  Most of the adjustment will consist of:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Adjusting the regexes to fetch other data from the answer&lt;/li&gt;&#xA;&lt;li&gt;Adding/removing properties of the answer/user objects as appropriate&lt;/li&gt;&#xA;&lt;li&gt;Adjusting the text displayed on the tree diagram&lt;/li&gt;&#xA;&lt;li&gt;Adjusting the columns of the tables&lt;/li&gt;&#xA;&lt;li&gt;Changing the scoring formula&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;But in the end this should still be significantly less work than writing a whole new snippet.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Features&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Generates a tree diagram showing how each answer is descended from a previous answer.  Each node is labeled with the username and is linked to the corresponding answer.&lt;/li&gt;&#xA;&lt;li&gt;One column is a list of answers and details.  In this case, the list is sorted by sequence number.&lt;/li&gt;&#xA;&lt;li&gt;Another column is a ranking of all users, sorted by score, including details such as their number of answers.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Usage&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Similar to the leaderboard snippet, the snippet can be targeted at a different challenge thread by searching for &lt;code&gt;QUESTION_ID&lt;/code&gt; and changing that value to the ID of the challenge.  You can also search for &lt;code&gt;codegolf&lt;/code&gt; and change that to something else, such as &lt;code&gt;meta.codegolf&lt;/code&gt; if you are testing it out on a meta thread.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Formatting instructions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This snippet is currently configured to accept answers with the following header:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# [language], [number] bytes, depth [number], A[new sequence] from A[old sequence] &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;[language]&lt;/code&gt; - used only as part of the list of answers&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[number] bytes&lt;/code&gt; - used in scoring calculation&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;depth [number]&lt;/code&gt; - used in scoring calculation (not needed to create the tree)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;A[new sequence]&lt;/code&gt; - a unique identifier for this answer, used to make the tree&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;from A[old sequence]&lt;/code&gt; - the unique identifier of the previous answer, used to make the tree.  If omitted, then this answer is inserted under the generic &quot;root&quot;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Furthermore, this snippet takes one additional piece of information from the answer, which is a line of numbers preceded by the word &lt;code&gt;terms:&lt;/code&gt; which was used to add some labels to the tree diagram.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Uncompressed Snippet:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Run it, hit &quot;full page,&quot; and scroll to see everything.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;/* Configuration */&#xD;&#xA;&#xD;&#xA;var QUESTION_ID = 49223; // Obtain this from the url&#xD;&#xA;// It will be like http://XYZ.stackexchange.com/questions/QUESTION_ID/... on any question page&#xD;&#xA;var ANSWER_FILTER = &quot;!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe&quot;;&#xD;&#xA;&#xD;&#xA;/* App */&#xD;&#xA;&#xD;&#xA;var data = [{&#xD;&#xA;  &quot;name&quot;: &quot;OEIS&quot;,&#xD;&#xA;  &quot;parent&quot;: &quot;null&quot;,&#xD;&#xA;  &quot;term&quot;: &quot;&quot;,&#xD;&#xA;  &quot;author&quot;: &quot;&quot;,&#xD;&#xA;  &quot;URL&quot;: &quot;https://oeis.org/&quot;&#xD;&#xA;}];&#xD;&#xA;&#xD;&#xA;var answers = [],&#xD;&#xA;  page = 1;&#xD;&#xA;&#xD;&#xA;function answersUrl(index) {&#xD;&#xA;  return &quot;https://api.stackexchange.com/2.2/questions/&quot; + QUESTION_ID + &quot;/answers?page=&quot; + index + &quot;&amp;amp;pagesize=100&amp;amp;order=desc&amp;amp;sort=creation&amp;amp;site=codegolf&amp;amp;filter=&quot; + ANSWER_FILTER;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function getAnswers() {&#xD;&#xA;  jQuery.ajax({&#xD;&#xA;    url: answersUrl(page++),&#xD;&#xA;    method: &quot;get&quot;,&#xD;&#xA;    dataType: &quot;jsonp&quot;,&#xD;&#xA;    crossDomain: true,&#xD;&#xA;    success: function(data) {&#xD;&#xA;      answers.push.apply(answers, data.items);&#xD;&#xA;      if (data.has_more) getAnswers();&#xD;&#xA;      else process();&#xD;&#xA;    }&#xD;&#xA;  });&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;getAnswers();&#xD;&#xA;&#xD;&#xA;var SIZE_REG = /\d+(?=[^\d&amp;amp;]*(?:&amp;amp;lt;(?:s&amp;amp;gt;[^&amp;amp;]*&amp;amp;lt;\/s&amp;amp;gt;|[^&amp;amp;]+&amp;amp;gt;)[^\d&amp;amp;]*)*,)/;&#xD;&#xA;var DEPTH_REG = /\d+, A/;&#xD;&#xA;var NUMBER_REG = /\d+/;&#xD;&#xA;var LANGUAGE_REG = /^#*\s*([^,]+)/;&#xD;&#xA;var SEQUENCE_REG = /A\d+/;&#xD;&#xA;var PARENT_REG = /from\s*A\d+/;&#xD;&#xA;var SEQDATA_REG = /terms:\s*(?:(?:-)?\d+,\s*)*((?:-)?\d+)/;&#xD;&#xA;&#xD;&#xA;function shouldHaveHeading(a) {&#xD;&#xA;  var pass = false;&#xD;&#xA;  var lines = a.body_markdown.split(&quot;\n&quot;);&#xD;&#xA;  try {&#xD;&#xA;    pass |= /^#/.test(a.body_markdown);&#xD;&#xA;    pass |= [&quot;-&quot;, &quot;=&quot;].indexOf(lines[1][0]) &amp;gt; -1;&#xD;&#xA;    pass &amp;amp;= LANGUAGE_REG.test(a.body_markdown);&#xD;&#xA;  } catch (ex) {}&#xD;&#xA;  return pass;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function shouldHaveScore(a) {&#xD;&#xA;  var pass = false;&#xD;&#xA;  try {&#xD;&#xA;    pass |= SIZE_REG.test(a.body_markdown.split(&quot;\n&quot;)[0]);&#xD;&#xA;  } catch (ex) {}&#xD;&#xA;  return pass;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function getAuthorName(a) {&#xD;&#xA;  return a.owner.display_name;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function decodeEntities(user) {&#xD;&#xA;  return $(&quot;&amp;lt;textarea&amp;gt;&quot;).html(user).text()&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function process() {&#xD;&#xA;  answers = answers.filter(shouldHaveScore).filter(shouldHaveHeading);&#xD;&#xA;  answers.reverse();&#xD;&#xA;&#xD;&#xA;  var users = {};&#xD;&#xA;  var sequserpairs = [];&#xD;&#xA;  var place = 1;&#xD;&#xA;  var lastSize = null;&#xD;&#xA;  var lastPlace = 1;&#xD;&#xA;  var legalanswers = [];&#xD;&#xA;&#xD;&#xA;  answers.forEach(function(a) {&#xD;&#xA;    var headline = a.body_markdown.split(&quot;\n&quot;)[0];&#xD;&#xA;    var user = getAuthorName(a);&#xD;&#xA;    var sequence = headline.match(SEQUENCE_REG)[0];&#xD;&#xA;    sequence = sequence.trim();&#xD;&#xA;    var parent = &quot;from A000000&quot;;&#xD;&#xA;    if (PARENT_REG.test(headline)) parent = headline.match(PARENT_REG)[0];&#xD;&#xA;    parent = parent.substring(5).trim();&#xD;&#xA;    if (parent == &quot;A000000&quot;) parent = &quot;OEIS&quot;;&#xD;&#xA;&#xD;&#xA;    var seqdata = &quot;&quot;;&#xD;&#xA;    if (SEQDATA_REG.test(a.body_markdown)) seqdata = a.body_markdown.match(SEQDATA_REG)[1];&#xD;&#xA;&#xD;&#xA;    var isoriginal = true;&#xD;&#xA;    for (var i = 0; i &amp;lt; sequserpairs.length; ++i) {&#xD;&#xA;      isoriginal = isoriginal &amp;amp;&amp;amp; !(sequserpairs[i] === sequence);&#xD;&#xA;    }&#xD;&#xA;    var islegal = true;&#xD;&#xA;    for (var i = 0; i &amp;lt; sequserpairs.length; ++i) {&#xD;&#xA;      islegal = islegal &amp;amp;&amp;amp; !(sequserpairs[i] === sequence) &amp;amp;&amp;amp; !(sequserpairs[i] === sequence + user) &amp;amp;&amp;amp; !(sequserpairs[i] === parent + user);&#xD;&#xA;    }&#xD;&#xA;    sequserpairs.push(sequence);&#xD;&#xA;    sequserpairs.push(sequence + user);&#xD;&#xA;    sequserpairs.push(parent + user);&#xD;&#xA;    if (isoriginal) data.push({&#xD;&#xA;      &quot;name&quot;: sequence,&#xD;&#xA;      &quot;parent&quot;: parent,&#xD;&#xA;      &quot;term&quot;: seqdata + &quot; : &quot;,&#xD;&#xA;      &quot;author&quot;: decodeEntities(user),&#xD;&#xA;      &quot;URL&quot;: a.share_link&#xD;&#xA;    });&#xD;&#xA;    if (islegal) {&#xD;&#xA;      legalanswers.push(a);&#xD;&#xA;    }&#xD;&#xA;  });&#xD;&#xA;&#xD;&#xA;  answers.sort(function(a, b) {&#xD;&#xA;    var aB = (a.body_markdown.split(&quot;\n&quot;)[0].match(SEQUENCE_REG)),&#xD;&#xA;      bB = (b.body_markdown.split(&quot;\n&quot;)[0].match(SEQUENCE_REG));&#xD;&#xA;    if (aB &amp;lt; bB) return -1;&#xD;&#xA;    if (aB &amp;gt; bB) return 1;&#xD;&#xA;  })&#xD;&#xA;&#xD;&#xA;  answers.forEach(function(a) {&#xD;&#xA;    var headline = a.body_markdown.split(&quot;\n&quot;)[0];&#xD;&#xA;    //console.log(a);&#xD;&#xA;&#xD;&#xA;    var num = headline.match(NUMBER_REG)[0];&#xD;&#xA;    var size = (headline.match(SIZE_REG) || [0])[0];&#xD;&#xA;    var depth = parseInt((headline.match(DEPTH_REG) || [0])[0]).toString();&#xD;&#xA;    var sequence = headline.match(SEQUENCE_REG)[0];&#xD;&#xA;    var parent = &quot;from A000000&quot;;&#xD;&#xA;    if (PARENT_REG.test(headline)) parent = headline.match(PARENT_REG)[0];&#xD;&#xA;    parent = parent.substring(5);&#xD;&#xA;    var language = headline.match(LANGUAGE_REG)[1];&#xD;&#xA;    if (language.indexOf(&quot;]&quot;) &amp;gt; 0) language = language.substring(1, language.indexOf(&quot;]&quot;));&#xD;&#xA;    var user = getAuthorName(a);&#xD;&#xA;    var islegal = false;&#xD;&#xA;    for (var i = 0; i &amp;lt; legalanswers.length; ++i) {&#xD;&#xA;      islegal = islegal || (legalanswers[i] === a);&#xD;&#xA;    }&#xD;&#xA;    if (islegal) {&#xD;&#xA;      var answer = jQuery(&quot;#answer-template&quot;).html();&#xD;&#xA;      if (size != lastSize) lastPlace = place;&#xD;&#xA;      lastSize = size;&#xD;&#xA;      ++place;&#xD;&#xA;&#xD;&#xA;      var score = (Math.pow(parseInt(depth), 0.5) * 1024 / (parseInt(size) + 256));&#xD;&#xA;&#xD;&#xA;      answer = answer.replace(&quot;{{SEQUENCE}}&quot;, sequence) //lastPlace + &quot;.&quot;&#xD;&#xA;        .replace(&quot;{{SEQUENCE}}&quot;, sequence)&#xD;&#xA;        .replace(&quot;{{NAME}}&quot;, user)&#xD;&#xA;        .replace(&quot;{{LANGUAGE}}&quot;, language)&#xD;&#xA;        .replace(&quot;{{SIZE}}&quot;, size)&#xD;&#xA;        .replace(&quot;{{DEPTH}}&quot;, depth)&#xD;&#xA;        .replace(&quot;{{LINK}}&quot;, a.share_link);&#xD;&#xA;      answer = jQuery(answer);&#xD;&#xA;      jQuery(&quot;#answers&quot;).append(answer);&#xD;&#xA;&#xD;&#xA;      users[user] = users[user] || {&#xD;&#xA;        lang: language,&#xD;&#xA;        user: user,&#xD;&#xA;        size: &quot;0&quot;,&#xD;&#xA;        numanswers: &quot;0&quot;,&#xD;&#xA;        link: a.share_link&#xD;&#xA;      };&#xD;&#xA;      users[user].size = (parseFloat(users[user].size) + score).toString();&#xD;&#xA;      users[user].numanswers = (parseInt(users[user].numanswers) + 1).toString();&#xD;&#xA;    }&#xD;&#xA;  });&#xD;&#xA;&#xD;&#xA;  var userlist = [];&#xD;&#xA;  for (var user in users)&#xD;&#xA;    if (users.hasOwnProperty(user)) userlist.push(users[user]);&#xD;&#xA;&#xD;&#xA;  userlist.sort(function(a, b) {&#xD;&#xA;    if (parseFloat(a.size) &amp;gt; parseFloat(b.size)) return -1;&#xD;&#xA;    if (parseFloat(a.size) &amp;lt; parseFloat(b.size)) return 1;&#xD;&#xA;    return 0;&#xD;&#xA;  });&#xD;&#xA;&#xD;&#xA;  for (var i = 0; i &amp;lt; userlist.length; ++i) {&#xD;&#xA;    var userentry = jQuery(&quot;#language-template&quot;).html();&#xD;&#xA;    var user = userlist[i];&#xD;&#xA;    userentry = userentry.replace(&quot;{{RANK}}&quot;, i + 1 + &quot;.&quot;)&#xD;&#xA;      .replace(&quot;{{NAME}}&quot;, user.user)&#xD;&#xA;      .replace(&quot;{{NUMANSWERS}}&quot;, user.numanswers)&#xD;&#xA;      .replace(&quot;{{SIZE}}&quot;, user.size);&#xD;&#xA;    userentry = jQuery(userentry);&#xD;&#xA;    jQuery(&quot;#languages&quot;).append(userentry);&#xD;&#xA;  }&#xD;&#xA;  createTree();&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;//everything below credit to d3noob at http://bl.ocks.org/d3noob/8329404&#xD;&#xA;&#xD;&#xA;// *********** Convert flat data into a nice tree ***************&#xD;&#xA;// create a name: node map&#xD;&#xA;function createTree() {&#xD;&#xA;  var dataMap = data.reduce(function(map, node) {&#xD;&#xA;    map[node.name] = node;&#xD;&#xA;    return map;&#xD;&#xA;  }, {});&#xD;&#xA;&#xD;&#xA;  // create the tree array&#xD;&#xA;  var treeData = [];&#xD;&#xA;  data.forEach(function(node) {&#xD;&#xA;    // add to parent&#xD;&#xA;    var parent = dataMap[node.parent];&#xD;&#xA;    if (parent) {&#xD;&#xA;      // create child array if it doesn't exist&#xD;&#xA;      (parent.children || (parent.children = []))&#xD;&#xA;      // add node to child array&#xD;&#xA;      .push(node);&#xD;&#xA;    } else {&#xD;&#xA;      // parent is null or missing&#xD;&#xA;      treeData.push(node);&#xD;&#xA;    }&#xD;&#xA;  });&#xD;&#xA;&#xD;&#xA;&#xD;&#xA;  // ************** Generate the tree diagram	 *****************&#xD;&#xA;  var margin = {&#xD;&#xA;      top: 20,&#xD;&#xA;      right: 120,&#xD;&#xA;      bottom: 20,&#xD;&#xA;      left: 120&#xD;&#xA;    },&#xD;&#xA;    width = 3203 - margin.right - margin.left,&#xD;&#xA;    height = 4000 - margin.top - margin.bottom;&#xD;&#xA;&#xD;&#xA;  var i = 0;&#xD;&#xA;&#xD;&#xA;  var tree = d3.layout.tree()&#xD;&#xA;    .size([height, width]);&#xD;&#xA;&#xD;&#xA;  var diagonal = d3.svg.diagonal()&#xD;&#xA;    .projection(function(d) {&#xD;&#xA;      return [d.y, d.x];&#xD;&#xA;    });&#xD;&#xA;&#xD;&#xA;  var svg = d3.select(&quot;body&quot;).append(&quot;svg&quot;)&#xD;&#xA;    .attr(&quot;width&quot;, width + margin.right + margin.left)&#xD;&#xA;    .attr(&quot;height&quot;, height + margin.top + margin.bottom)&#xD;&#xA;    .append(&quot;g&quot;)&#xD;&#xA;    .attr(&quot;transform&quot;, &quot;translate(&quot; + margin.left + &quot;,&quot; + margin.top + &quot;)&quot;);&#xD;&#xA;&#xD;&#xA;  root = treeData[0];&#xD;&#xA;&#xD;&#xA;  update(root);&#xD;&#xA;&#xD;&#xA;  function update(source) {&#xD;&#xA;&#xD;&#xA;    // Compute the new tree layout.&#xD;&#xA;    var nodes = tree.nodes(root).reverse(),&#xD;&#xA;      links = tree.links(nodes);&#xD;&#xA;&#xD;&#xA;    // Normalize for fixed-depth.&#xD;&#xA;    nodes.forEach(function(d) {&#xD;&#xA;      d.y = d.depth * 180;&#xD;&#xA;    });&#xD;&#xA;&#xD;&#xA;    // Declare the nodes…&#xD;&#xA;    var node = svg.selectAll(&quot;g.node&quot;)&#xD;&#xA;      .data(nodes, function(d) {&#xD;&#xA;        return d.id || (d.id = ++i);&#xD;&#xA;      });&#xD;&#xA;&#xD;&#xA;    // Enter the nodes.&#xD;&#xA;    var nodeEnter = node.enter().append(&quot;g&quot;)&#xD;&#xA;      .attr(&quot;class&quot;, &quot;node&quot;)&#xD;&#xA;      .attr(&quot;transform&quot;, function(d) {&#xD;&#xA;        return &quot;translate(&quot; + d.y + &quot;,&quot; + d.x + &quot;)&quot;;&#xD;&#xA;      });&#xD;&#xA;&#xD;&#xA;    nodeEnter.append(&quot;a&quot;).attr(&quot;xlink:href&quot;, function(d) {&#xD;&#xA;        return d.URL&#xD;&#xA;      }).append(&quot;circle&quot;)&#xD;&#xA;      .attr(&quot;r&quot;, 10)&#xD;&#xA;      .style(&quot;fill&quot;, &quot;#fff&quot;);&#xD;&#xA;&#xD;&#xA;    nodeEnter.append(&quot;text&quot;)&#xD;&#xA;      .attr(&quot;x&quot;, function() {&#xD;&#xA;        return 0;&#xD;&#xA;      })&#xD;&#xA;      .attr(&quot;y&quot;, function() {&#xD;&#xA;        return 20;&#xD;&#xA;      })&#xD;&#xA;      .attr(&quot;dy&quot;, &quot;.35em&quot;)&#xD;&#xA;      .attr(&quot;text-anchor&quot;, function() {&#xD;&#xA;        return &quot;middle&quot;;&#xD;&#xA;      })&#xD;&#xA;      .text(function(d) {&#xD;&#xA;        return d.term + d.name;&#xD;&#xA;      })&#xD;&#xA;      .style(&quot;fill-opacity&quot;, 1);&#xD;&#xA;&#xD;&#xA;    nodeEnter.append(&quot;text&quot;)&#xD;&#xA;      .attr(&quot;x&quot;, function() {&#xD;&#xA;        return 0;&#xD;&#xA;      })&#xD;&#xA;      .attr(&quot;y&quot;, function() {&#xD;&#xA;        return 35;&#xD;&#xA;      })&#xD;&#xA;      .attr(&quot;dy&quot;, &quot;.35em&quot;)&#xD;&#xA;      .attr(&quot;text-anchor&quot;, function() {&#xD;&#xA;        return &quot;middle&quot;;&#xD;&#xA;      })&#xD;&#xA;      .text(function(d) {&#xD;&#xA;        return d.author;&#xD;&#xA;      })&#xD;&#xA;      .style(&quot;fill-opacity&quot;, 1);&#xD;&#xA;&#xD;&#xA;    // Declare the links…&#xD;&#xA;    var link = svg.selectAll(&quot;path.link&quot;)&#xD;&#xA;      .data(links, function(d) {&#xD;&#xA;        return d.target.id;&#xD;&#xA;      });&#xD;&#xA;&#xD;&#xA;    // Enter the links.&#xD;&#xA;    link.enter().insert(&quot;path&quot;, &quot;g&quot;)&#xD;&#xA;      .attr(&quot;class&quot;, &quot;link&quot;)&#xD;&#xA;      .attr(&quot;d&quot;, diagonal);&#xD;&#xA;&#xD;&#xA;  }&#xD;&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-css lang-css prettyprint-override&quot;&gt;&lt;code&gt;body {&#xD;&#xA;  text-align: left !important&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;#answer-list {&#xD;&#xA;  padding: 10px;&#xD;&#xA;  width: 550px;&#xD;&#xA;  float: left;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;#language-list {&#xD;&#xA;  padding: 10px;&#xD;&#xA;  width: 290px;&#xD;&#xA;  float: left;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;table thead {&#xD;&#xA;  font-weight: bold;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;table td {&#xD;&#xA;  padding: 5px;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;.node circle {&#xD;&#xA;  fill: #fff;&#xD;&#xA;  stroke: steelblue;&#xD;&#xA;  stroke-width: 3px;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;.node text {&#xD;&#xA;  font: 12px sans-serif;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;.link {&#xD;&#xA;  fill: none;&#xD;&#xA;  stroke: #ccc;&#xD;&#xA;  stroke-width: 2px;&#xD;&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xD;&#xA;&amp;lt;script src=&quot;https://d3js.org/d3.v3.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xD;&#xA;&amp;lt;link rel=&quot;stylesheet&quot; type=&quot;text/css&quot; href=&quot;//cdn.sstatic.net/codegolf/all.css?v=83c949450c8b&quot;&amp;gt;&#xD;&#xA;&amp;lt;div id=&quot;answer-list&quot;&amp;gt;&#xD;&#xA;  &amp;lt;h2&amp;gt;Sequence List&amp;lt;/h2&amp;gt;&#xD;&#xA;  &amp;lt;table class=&quot;answer-list&quot;&amp;gt;&#xD;&#xA;    &amp;lt;thead&amp;gt;&#xD;&#xA;      &amp;lt;tr&amp;gt;&#xD;&#xA;        &amp;lt;td&amp;gt;Sequence&amp;lt;/td&amp;gt;&#xD;&#xA;        &amp;lt;td&amp;gt;Author&amp;lt;/td&amp;gt;&#xD;&#xA;        &amp;lt;td&amp;gt;Language&amp;lt;/td&amp;gt;&#xD;&#xA;        &amp;lt;td&amp;gt;Size&amp;lt;/td&amp;gt;&#xD;&#xA;        &amp;lt;td&amp;gt;Depth&amp;lt;/td&amp;gt;&#xD;&#xA;      &amp;lt;/tr&amp;gt;&#xD;&#xA;    &amp;lt;/thead&amp;gt;&#xD;&#xA;    &amp;lt;tbody id=&quot;answers&quot;&amp;gt;&amp;lt;/tbody&amp;gt;&#xD;&#xA;  &amp;lt;/table&amp;gt;&#xD;&#xA;&amp;lt;/div&amp;gt;&#xD;&#xA;&amp;lt;div id=&quot;language-list&quot;&amp;gt;&#xD;&#xA;  &amp;lt;h2&amp;gt;Leaderboard&amp;lt;/h2&amp;gt;&#xD;&#xA;  &amp;lt;table class=&quot;language-list&quot;&amp;gt;&#xD;&#xA;    &amp;lt;thead&amp;gt;&#xD;&#xA;      &amp;lt;tr&amp;gt;&#xD;&#xA;        &amp;lt;td&amp;gt;Rank&amp;lt;/td&amp;gt;&#xD;&#xA;        &amp;lt;td&amp;gt;User&amp;lt;/td&amp;gt;&#xD;&#xA;        &amp;lt;td&amp;gt;Answers&amp;lt;/td&amp;gt;&#xD;&#xA;        &amp;lt;td&amp;gt;Score&amp;lt;/td&amp;gt;&#xD;&#xA;      &amp;lt;/tr&amp;gt;&#xD;&#xA;    &amp;lt;/thead&amp;gt;&#xD;&#xA;    &amp;lt;tbody id=&quot;languages&quot;&amp;gt;&amp;lt;/tbody&amp;gt;&#xD;&#xA;  &amp;lt;/table&amp;gt;&#xD;&#xA;&amp;lt;/div&amp;gt;&#xD;&#xA;&amp;lt;table style=&quot;display: none&quot;&amp;gt;&#xD;&#xA;  &amp;lt;tbody id=&quot;answer-template&quot;&amp;gt;&#xD;&#xA;    &amp;lt;tr&amp;gt;&#xD;&#xA;      &amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://oeis.org/{{SEQUENCE}}&quot;&amp;gt;{{SEQUENCE}}&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&#xD;&#xA;      &amp;lt;td&amp;gt;{{NAME}}&amp;lt;/td&amp;gt;&#xD;&#xA;      &amp;lt;td&amp;gt;{{LANGUAGE}}&amp;lt;/td&amp;gt;&#xD;&#xA;      &amp;lt;td&amp;gt;{{SIZE}}&amp;lt;/td&amp;gt;&#xD;&#xA;      &amp;lt;td&amp;gt;{{DEPTH}}&amp;lt;/td&amp;gt;&#xD;&#xA;      &amp;lt;td&amp;gt;&amp;lt;a href=&quot;{{LINK}}&quot;&amp;gt;Link&amp;lt;/a&amp;gt; &amp;lt;/td&amp;gt;&#xD;&#xA;    &amp;lt;/tr&amp;gt;&#xD;&#xA;  &amp;lt;/tbody&amp;gt;&#xD;&#xA;&amp;lt;/table&amp;gt;&#xD;&#xA;&amp;lt;table style=&quot;display: none&quot;&amp;gt;&#xD;&#xA;  &amp;lt;tbody id=&quot;language-template&quot;&amp;gt;&#xD;&#xA;    &amp;lt;tr&amp;gt;&#xD;&#xA;      &amp;lt;td&amp;gt;{{RANK}}&amp;lt;/td&amp;gt;&#xD;&#xA;      &amp;lt;td&amp;gt;{{NAME}}&amp;lt;/td&amp;gt;&#xD;&#xA;      &amp;lt;td&amp;gt;{{NUMANSWERS}}&amp;lt;/td&amp;gt;&#xD;&#xA;      &amp;lt;td&amp;gt;{{SIZE}}&amp;lt;/td&amp;gt;&#xD;&#xA;    &amp;lt;/tr&amp;gt;&#xD;&#xA;  &amp;lt;/tbody&amp;gt;&#xD;&#xA;&amp;lt;/table&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2017-03-19T21:31:39.260" Title="Answer-Chaining Tree/Leaderboard Snippet" Tags="|discussion|scoring|stack-snippets|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11813" PostTypeId="2" ParentId="2140" CreationDate="2017-03-19T23:19:10.840" Score="1" Body="&lt;h1&gt;Image Quine &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The challenge is to quite simply, output an image of the source code of your program exactly as it is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Scoring is by shortest source code wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The image must visibly contain the source code, and no other characters or decorations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard quine rules apply, so:&lt;br&gt;&#xA;- No 0-byte solutions&lt;br&gt;&#xA;- No reading the source code&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is just a draft, so I'll make it more detailed should it be good enough to post.&lt;/p&gt;&#xA;" OwnerDisplayName="user42649" LastActivityDate="2017-03-19T23:19:10.840" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11814" PostTypeId="2" ParentId="5243" CreationDate="2017-03-20T01:19:37.730" Score="1" Body="&lt;h1&gt;500 rep for a &lt;a href=&quot;https://github.com/rjhunjhunwala/S.I.L.O.S&quot; rel=&quot;nofollow noreferrer&quot;&gt;SILOS&lt;/a&gt; submission of a &lt;a href=&quot;https://codegolf.stackexchange.com/q/24134/46918&quot;&gt;2048 clone&lt;/a&gt;.&lt;/h1&gt;&#xA;&lt;p&gt;I'll even throw in a bonus 250 rep bounty (and of course give a week of bonus visibility). for one that has gui output (this is harder than it sounds). Feel free to use the &lt;a href=&quot;https://github.com/rjhunjhunwala/S.I.D.E&quot; rel=&quot;nofollow noreferrer&quot;&gt;developer tools&lt;/a&gt;, which integrate into this language nicely.&lt;/p&gt;&#xA;&lt;h1&gt;50 rep for outgolfing me in the language (ping me in the nineteenth byte, and give me one week to attempt the challenge.)&lt;/h1&gt;&#xA;&lt;p&gt;So that you can police me, we both submit our submission concurrently.&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-20T01:28:26.933" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11816" PostTypeId="2" ParentId="11747" CreationDate="2017-03-20T03:01:41.040" Score="1" Body="&lt;p&gt;Yes, and Mego's answer details all the reasons why, but you should have to include the changes to the &lt;code&gt;.vimrc&lt;/code&gt; file in the bytecount, in the same way you have to count &lt;code&gt;import&lt;/code&gt; statements. &lt;/p&gt;&#xA;" OwnerUserId="60042" LastActivityDate="2017-03-20T03:01:41.040" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11817" PostTypeId="2" ParentId="11737" CreationDate="2017-03-20T04:37:24.900" Score="2" Body="&lt;h1&gt;Preventing infinite-character Answers&lt;/h1&gt;&#xA;&lt;p&gt;Sometimes a challenge can be very well crafted to require some very skillful bowling, but there are a few languages that can easily solve the problem in near-infinite bytes with no real effort, it is hard to exclude these from the challenge in a systematic way.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;For example, in my bowling challenge: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/113197/rearrangeable-code-bowling&quot;&gt;Rearrangeable Code Bowling&lt;/a&gt;&#xA;you can end up with some really creative solutions that utilize great &lt;em&gt;bowling skill&lt;/em&gt; like the following:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/113199/16513&quot;&gt;MATL: Score 6 — Luis Mendo&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/113218/16513&quot;&gt;CJAM: Score 15 — Martin Ender♦&lt;/a&gt;&lt;br&gt;&lt;/p&gt;&#xA;&lt;p&gt;But then some languages can just as easily post not-so-creative solutions that require no real &lt;em&gt;bowling skill&lt;/em&gt; and get a near-infinite score, for example:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/113204/16513&quot;&gt;Lenguage: Score 1,112,064 — Nathan Merrill&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/113340/16513&quot;&gt;√åı¥®ÏØ¿: Score ∞ — Valyrio Account&lt;/a&gt;&lt;br&gt;&lt;/p&gt;&#xA;&lt;p&gt;While these answers are certainly valid, they don't really go with the spirit of the competition.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Please comment on this &lt;code&gt;answer&lt;/code&gt; with any methods, suggestions, or tips you have on creating systematic and concrete &lt;code&gt;rules&lt;/code&gt; that can be added to challenges to keep these answers out &lt;em&gt;(if an OP desires to not have answers like that on their challenge, which is reasonable imho)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;If some good enough methods are proposed I may edit this into the original post under a new &lt;code&gt;Tips&lt;/code&gt; section, or something similar.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Potential Methods:&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Will update soon after enough input has been received.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="16513" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-20T05:55:08.047" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11818" PostTypeId="1" CreationDate="2017-03-20T05:31:03.500" Score="0" ViewCount="76" Body="&lt;p&gt;Maybe I'm missing something, but is there an easy-ish way to initiate the process of writing an answer in the Sandbox from the mobile app? I noticed the phrase &quot;bottom of the page&quot; in the sandbox question was a link and I clicked on it, only to be brought recursively to the question, so I don't think that's much help for me.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm going to post this as a low priority feature request unless someone gives me a better idea or a solution that I may have overlooked.&lt;/p&gt;&#xA;" OwnerUserId="42091" LastEditorUserId="68942" LastEditDate="2021-06-09T05:31:51.440" LastActivityDate="2021-06-09T05:31:51.440" Title="Make it easier to post answers on Sandbox from Mobile App?" Tags="|feature-request|status-declined|answers|sandbox|" AnswerCount="0" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11820" PostTypeId="1" CreationDate="2017-03-20T08:24:54.287" Score="0" ViewCount="126" Body="&lt;p&gt;Some time ago, YouTube user &lt;a href=&quot;https://www.youtube.com/channel/UC8aG3LDTDwNR1UQhSn9uVrw&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sethbling&lt;/a&gt; has injected code into Super Mario World, and I am planning to make a challenge about it (Making pong, to be exact).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But, I should know first if it counts as a programming language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does it count as a programming language? If it does, How would we score them?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note: It is (accidentally) Turing-complete.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="64499" LastActivityDate="2017-03-20T08:24:54.287" Title="Does Super Mario World count as a programming language?" Tags="|discussion|" AnswerCount="0" CommentCount="2" ClosedDate="2017-03-20T09:14:58.890" ContentLicense="CC BY-SA 3.0" />
  <row Id="11821" PostTypeId="2" ParentId="2140" CreationDate="2017-03-20T08:55:48.107" Score="-2" Body="&lt;h1&gt;Display Haftseen table items - in Persian/Arabic characters&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Theme&lt;/strong&gt; : Jalali New Year 1397&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Main Goal&lt;/strong&gt; : Displaying non-ASCII characters correctly&lt;/p&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;A typical &lt;a href=&quot;https://en.wikipedia.org/wiki/Haft-Seen&quot; rel=&quot;nofollow noreferrer&quot;&gt;Haftseen table&lt;/a&gt; consists 7 items which their names start with &lt;code&gt;س&lt;/code&gt; (pronounced like &lt;em&gt;S&lt;/em&gt;) and some additional items. It is set few days before the new year's day and it's kept till end of new year's holiday.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Your program/function should display exactly 7 items from the list below :&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;سبزه&#xA;سرکه&#xA;سکه&#xA;سیب&#xA;سنبل&#xA;سمنو&#xA;سماق&#xA;سیر&#xA;سنجد&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;with &lt;strong&gt;right alignment&lt;/strong&gt;, &lt;strong&gt;right to left typing&lt;/strong&gt;, in an &lt;strong&gt;Arabic-compatible font&lt;/strong&gt;, with each word &lt;strong&gt;displayed correctly&lt;/strong&gt;, and a non-alphabetical character (&lt;code&gt;,.- =+~?&lt;/code&gt;,newline etc) between each 2 words. The list must be displayed in a window, in terminal or similar.&lt;/p&gt;&#xA;" OwnerDisplayName="user55673" LastEditorUserId="-1" LastEditorDisplayName="user55673" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-20T09:26:11.390" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="11822" PostTypeId="2" ParentId="11797" CreationDate="2017-03-20T12:54:21.453" Score="12" Body="&lt;p&gt;I have three points to make, but I'll stick to one answer even though I'm not sure how related they are too each other.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Firstly, you may be overestimating how often this happens. In my opinion, which I haven't tried to quantify, there's a trend to trivial questions which can be answered in 10 minutes, so possibly some of the answers you think were preprepared were not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Secondly, there's a risk to preparing an answer while the question's still in the sandbox. It might change and force you to rewrite (or it might never be posted).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thirdly, it's good that some people prepare answers because actually implementing the spec forces you to look at the detail and helps uncover ambiguities before the question is posted to main.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-03-20T12:54:21.453" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11826" PostTypeId="1" AcceptedAnswerId="11827" CreationDate="2017-03-21T00:39:35.270" Score="-3" ViewCount="128" Body="&lt;p&gt;&lt;a href=&quot;http://chat.stackexchange.com/messages/36167085/history&quot;&gt;Message&lt;/a&gt; that got me suspended... If you watch the video it is a clean funny video by Studio C and Studio C's goal is &quot;to produce clean, family-oriented comedy for a national audience&quot;. I do not understand how that is worth of suspending me. I do not think noise applies since literally 5 messages ago Riker posted &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/36166303#36166303&quot;&gt;this&lt;/a&gt; and it got 3 stars so it is not &quot;offensive&quot;. Please help me understand as I feel like it was unjust. The thumbnail just shows a man in a mask so that is not offensive.&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorDisplayName="user63187" LastEditDate="2017-03-21T00:59:17.860" LastActivityDate="2017-03-21T01:15:27.827" Title="Question about mod action taken" Tags="|discussion|chat|moderation|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11827" PostTypeId="2" ParentId="11826" CreationDate="2017-03-21T01:15:27.827" Score="3" Body="&lt;p&gt;Flag-deletion (by several 10k users and/or a moderator) shouldn't happen because of noise; that's what kicks and manual suspensions (for repeated offenders) are for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, I'm not sure I agree with the assessment of &lt;em&gt;clean, family-oriented comedy for a national audience&lt;/em&gt;. While you may not find someone getting tazed in the neck, shot in the leg, and repeatedly whacked on the head with flower pots offensive, others may and appareantly have. On top of that, the thumbnail looks a lot more gruesome than the actual video, so it is possible that is was deleted based on the thumbnail alone.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your suspension is over, so at this point, there's nothing left to be done except moving on.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-03-21T01:15:27.827" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11828" PostTypeId="2" ParentId="11737" CreationDate="2017-03-21T04:21:40.953" Score="5" Body="&lt;p&gt;Ok, I don't think I was clear with my last answer, so I hope to make a post to make this clear:&lt;/p&gt;&#xA;&lt;h1&gt;Code bowling (conceptually) doesn't work.&lt;/h1&gt;&#xA;&lt;p&gt;Are you familiar with Sudoku?  You know, that awesome puzzle where you try to fill in as many squares as possible?&lt;/p&gt;&#xA;&lt;p&gt;Let's say I made a challenge where your code had to be arranged like a Sudoku puzzle:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It has to fit in a 9x9 grid&lt;/li&gt;&#xA;&lt;li&gt;You could only use 9 different characters&lt;/li&gt;&#xA;&lt;li&gt;Each row and column can't have the same character twice.&lt;/li&gt;&#xA;&lt;li&gt;An empty spot (a space) counts as 0 characters.&lt;/li&gt;&#xA;&lt;li&gt;Scored by total number of characters, maximum wins.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;This could actually be an interesting challenge.  I'd also put a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; tag on it.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;The problem is that this really isn't a code-bowling challenge&lt;/strong&gt;.  It's a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; challenge that happens to be scored by maximum number of characters.  We simply have the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; tag to make &amp;quot;scored by maximum number of characters&amp;quot; easy to communicate.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is about transmitting as much information in as little space as possible&lt;/h3&gt;&#xA;&lt;p&gt;This is a problem that people everywhere are solving.  It's why we gzip our html, or why downloads come in a tar file.  This is why general-purpose golfing languages are interesting.  They are trying to ensure that it can do as many tasks as possible with as little code as possible.&lt;/p&gt;&#xA;&lt;h3&gt;Transmitting as much information in as much space as possible doesn't make sense&lt;/h3&gt;&#xA;&lt;p&gt;Of &lt;em&gt;course&lt;/em&gt; you can do it.  This is why &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; challenges are littered with loophole-patches.  These &amp;quot;patches&amp;quot; become the real challenge in a similar way that my sudoku-board was the real challenge.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, don't try and take a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; challenge and modify it to make it interesting.  Simply come up with interesting concepts, and if it &lt;em&gt;happens&lt;/em&gt; to be naturally scored by maximum characters, put that tag on it.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-21T04:21:40.953" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="11830" PostTypeId="2" ParentId="11791" CreationDate="2017-03-21T09:33:32.277" Score="8" Body="&lt;p&gt;If we allow &quot;Windows&quot; as a programming language on the basis that it contains a shell, why not allow &quot;Computer&quot; as a programming language on the basis that you can run an OS with a shell on it? And then the whole question of what is or isn't a programming language becomes moot, because if it can form part of a system which includes a computer then it's ok...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So no, it's absurd to claim that Windows is a language.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-03-21T09:33:32.277" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11832" PostTypeId="1" CreationDate="2017-03-21T15:15:18.390" Score="0" ViewCount="69" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/113359/56183&quot;&gt;This Java answer&lt;/a&gt; (and &lt;a href=&quot;https://codegolf.stackexchange.com/a/76050/56183&quot;&gt;this one&lt;/a&gt;) uses a lambda that does not explicitly declare its parameter type, but &lt;a href=&quot;https://codegolf.stackexchange.com/a/113306/56183&quot;&gt;this Scala answer&lt;/a&gt; includes a parameter type. in both cases, the type could be inferred when it is assigned to a variable. For example, for a lambda that takes an int and returns an int:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-java prettyprint-override&quot;&gt;&lt;code&gt;Function&amp;lt;Integer, Integer&amp;gt; f = a-&amp;gt;... // Java&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre class=&quot;lang-scala prettyprint-override&quot;&gt;&lt;code&gt;val f: Int =&amp;gt; Int = a=&amp;gt;... // Scala&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;My question is: should the type parameters be included in the lambda, or can we assume that they are declared as above?&lt;/p&gt;&#xA;" OwnerUserId="56183" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2017-03-21T15:46:22.173" Title="Can lambda parameter types be left off if potentially inferable from context?" Tags="|discussion|policy|code-golf|" AnswerCount="0" CommentCount="3" ClosedDate="2017-03-21T16:13:23.097" ContentLicense="CC BY-SA 3.0" />
  <row Id="11834" PostTypeId="1" AcceptedAnswerId="11835" CreationDate="2017-03-21T17:44:18.700" Score="2" ViewCount="211" Body="&lt;p&gt;A single 05AB1E char takes all 8-bits of a byte, whereas BF only has 8 commands, so 3 bits per char, 2.5 BF commands per byte.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not suggesting we change the judging rules, but why do we use the term bytes, and not chars?&lt;/p&gt;&#xA;" OwnerUserId="15982" LastEditorUserId="31716" LastEditDate="2017-03-21T19:21:15.960" LastActivityDate="2017-03-21T19:21:15.960" Title="Why do we score codegolf submissions in &quot;bytes&quot; instead of &quot;chars&quot;?" Tags="|discussion|code-golf|answers|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11835" PostTypeId="2" ParentId="11834" CreationDate="2017-03-21T18:01:45.017" Score="5" Body="&lt;p&gt;Many characters may &lt;a href=&quot;https://en.wikipedia.org/wiki/Variable-width_encoding&quot; rel=&quot;nofollow noreferrer&quot;&gt;take up several bytes&lt;/a&gt;, depending on the encoding used. Especially for challenges about reproducing a certain number/text/image, etc. storing all of the data in large multi-byte characters could be abused because the amount of information per character is much higher.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Scoring in bytes is convenient because then each language must have a consistent encoding, and it limits the total number of commands available to a golfing language. For example, an ultra compressed golfing language with two commands per byte is limited to only &lt;code&gt;2^4 == 16&lt;/code&gt; possible commands, whereas a language like Jelly that takes advantage of the full &lt;code&gt;2^8 == 256&lt;/code&gt; byte space has to create an encoding where each character can be stored in exactly one byte.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To address specifically the languages you have mentioned, 05AB1E code &lt;em&gt;can&lt;/em&gt; fit it's commands in one byte! It is encoded in CP-1252. Now, I don't actually know a whole lot about 05AB1E, so I can't definitely say one way or another how many commands there are, and how they are encoded other than what I can tell from the Github page. But if there really are 259 different commands &lt;em&gt;and&lt;/em&gt; every one is counted as a single byte, every answer ever posted with this scoring method is invalid. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;My best guess is that either you counted wrong (with the two-byte functions) or some commands allow multiple different characters for convenience when run in UTF-8 mode. You'd have to talk to &lt;a href=&quot;https://codegolf.stackexchange.com/users/34388/adnan&quot;&gt;Adnan&lt;/a&gt; to find out more.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for brain-fuck, you're absolutely right, you could easily store each command in 3-bits. However, we store each one as a byte &lt;em&gt;because that's how the language works&lt;/em&gt;. It expects files encoded in ASCII. There are many brainfuck variants that use sub-byte encodings, but these are different languages. This has also been discussed &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1584/31716&quot;&gt;here&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10809/31716&quot;&gt;here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2017-03-21T18:01:45.017" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11838" PostTypeId="2" ParentId="2140" CreationDate="2017-03-22T08:09:11.077" Score="1" Body="&lt;h1&gt;Efficiently find the median&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Computer scientists have spent a long time looking into ways of sorting data faster. One of the known discoveries is that if you can use the actual values of the data, sorting can be faster than if you can only compare them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finding the median of a list is a similar operation to sorting it (you can trivially implement it via sorting the list, then taking the element in the middle). However, if you're in an environment where you can only compare list elements (as opposed to looking at the elements directly), this &lt;em&gt;is not&lt;/em&gt; typically the fastest way to find the median, as sorts are hurt more badly by the comparison restriction than finding the nth item is. What's the fastest way? Well, finding that is what this challenge is about. (However, you may want to read &lt;a href=&quot;https://en.wikipedia.org/wiki/Median_of_medians&quot; rel=&quot;nofollow noreferrer&quot;&gt;this Wikipedia article&lt;/a&gt; to get some ideas of the approaches that are typically used. I can't guarantee that the algorithm given there is the best, though, especially on a problem of the limited size given here.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program that finds the index of the median element within a list of 31 elements. However, the program may not take the list as input, and may not inspect its values directly. Rather, the program may only make comparisons to determine which of two indexes corresponds to the larger element, via calling a separate comparison function. (In other words, your program deals entirely with list &lt;em&gt;indexes&lt;/em&gt;, not list &lt;em&gt;values&lt;/em&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In order to avoid solutions that brute-force their way through all possible algorithms, you must be able to run at least one worst-case input (i.e. an input that takes the maximum possible number of comparisons), using a comparison function which simply compares two array elements, in under 10 minutes on some computer you have access to. (Solutions which do not use brute force to find an algorithm are unlikely to get anywhere near this time bound.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Clarifications&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may assume that all the list elements are distinct, i.e. the comparison function will always specify that one of the elements is larger, no matter how they're compared.&lt;/li&gt;&#xA;&lt;li&gt;You may choose the format in which the comparison function provides output, but there must only be two possible outputs (meaning &quot;item at first index is larger&quot; and &quot;item at second index is larger&quot;) for any possible query; you can't return values that mean &quot;item at second index is &lt;em&gt;much&lt;/em&gt; larger&quot; or anything like that.&lt;/li&gt;&#xA;&lt;li&gt;The comparison function will act consistently, i.e. if it claims that the list item at index A is larger than the list item at index B, it will always claim that; and if it also claims that the list item at index B is larger than the list item at index C, it will additionally claim that the list item at index A is larger than the list item at index C.&lt;/li&gt;&#xA;&lt;li&gt;You may take the comparison function as input, or assume that it's already defined with a specific name. This is not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so there's no need to try to exploit the freedom you have here to save bytes; feel free to write it in the most readable way. (The comparison function itself is not part of the submission, but you should probably include one for testing purposes and an example of what it looks like.)&lt;/li&gt;&#xA;&lt;li&gt;You may exploit the knowledge that the input list is exactly 31 elements long, if you wish (your program doesn't have to work in other cases, although of course it can if you want it to).&lt;/li&gt;&#xA;&lt;li&gt;If your language doesn't have functions, you may write the comparison function via a source code insertion, so long as the rest of the code doesn't attempt to inspect its internals. (However, you may as well just pick a different language in this case; the scoring method is based entirely on the algorithm you use, and picking a different language won't change your score at all.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Victory condition&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your score for this challenge is equal to the maximum number of times the comparison function can be called during a run of the program. Obviously, lower is better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the case of a tie, the first submission achieving the optimal score will win. (In other words, you don't gain anything from copying someone else's solution but golfing the code, or the like; you'll have to find an algorithmic improvement.)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;Is this scoring method &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;? I guess I'd want to call it &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-fastest-code&lt;/a&gt; (by analogy with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;) but that doesn't exist and I'm not sure it should be created.&lt;/s&gt; EDIT: None of the above, it's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fewest-operations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fewest-operations&amp;#39;&quot; rel=&quot;tag&quot;&gt;fewest-operations&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorDisplayName="user62131" LastEditDate="2017-06-06T22:56:04.460" LastActivityDate="2017-06-06T22:56:04.460" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11840" PostTypeId="1" CreationDate="2017-03-22T13:34:51.040" Score="1" ViewCount="75" Body="&lt;p&gt;I'm asking this to find a consensus on whether it's okay for an answer to use &lt;code&gt;True&lt;/code&gt; or &lt;code&gt;False&lt;/code&gt; in place of the language's corresponding integer values -- as output in a sequence, for example.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So if the challenge is to output the Fibonacci sequence forever, and your output is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;False, True, True, 2, 3, 5, 8, ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and &lt;code&gt;False==0&lt;/code&gt; and &lt;code&gt;True==1&lt;/code&gt; in the language, then this would be acceptable. This is the case for Python. Some languages use &lt;code&gt;-1&lt;/code&gt; for &lt;code&gt;True&lt;/code&gt;, so whatever the language uses for the Boolean value is the value that it may be substituted for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So what do you think? I think it makes sense to allow it. I know there are already answers doing this, but I don't remember where.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastActivityDate="2017-03-22T13:34:51.040" Title="Can a language's True/False be used in place of their values in a sequence?" Tags="|discussion|policy|" AnswerCount="0" CommentCount="2" ClosedDate="2017-03-22T14:39:28.467" ContentLicense="CC BY-SA 3.0" />
  <row Id="11843" PostTypeId="2" ParentId="2140" CreationDate="2017-03-23T15:55:23.563" Score="1" Body="&lt;h1&gt;Self-Generator &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Challenge: Create a program that, given no input, outputs &lt;code&gt;n&lt;/code&gt; programs (in the same language, but not necessarily the same language as the original program) separated by newlines, where each of those programs will print a section of the original program. When these sections are put together, it create the original program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your score is the number of bytes in the original program divided by (the number of sections that your code is split into) squared.&lt;/p&gt;&#xA;" OwnerDisplayName="user42649" LastEditorDisplayName="user42649" LastEditDate="2017-03-23T16:45:59.120" LastActivityDate="2017-03-23T16:45:59.120" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="11844" PostTypeId="2" ParentId="2140" CreationDate="2017-03-23T16:19:29.513" Score="1" Body="&lt;h1&gt;Block Puzzle&lt;/h1&gt;&#xA;&lt;p&gt;A popular brain teaser commonly known as a the &amp;quot;IQ Block Puzzle&amp;quot; is comprised of 8 colored shapes which can be rotated, moved and flipped on a 8x8 grid. The puzzle is known as a &lt;a href=&quot;https://en.wikipedia.org/wiki/Geometric_magic_square&quot; rel=&quot;nofollow noreferrer&quot;&gt;geometric magic square&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/V233v.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/V233v.jpg&quot; alt=&quot;Block Puzzle&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;The challenge is to &lt;strong&gt;generate&lt;/strong&gt; and then output all 40 possible pattern combinations that the pieces can be placed in.&lt;/p&gt;&#xA;&lt;p&gt;The output can be in any form, but must somehow represent the position of all pieces, for example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Combination 1 of 40:&#xA;&#xA;  11113333&#xA;  12213333&#xA;  12214444&#xA;  22555448&#xA;  22555448&#xA;  66657788&#xA;  66657788&#xA;  66777788&#xA;&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;There will be a winner for both:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Shortest code in bytes&lt;/li&gt;&#xA;&lt;li&gt;Fastest calculation of all shapes in ms&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;" OwnerUserId="67313" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-23T16:29:05.947" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11845" PostTypeId="2" ParentId="2140" CreationDate="2017-03-23T16:42:17.890" Score="0" Body="&lt;h1&gt;Secret Santa&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Goal:&lt;/strong&gt; Given a list of names with public keys, assign each person a name, encrypt it with their public key and print the list of gifters with their encoded giftees.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;My family wanted to get a head start on Secret Santa (so they can shop sales though out the year). The problem was &quot;how do we do this remotely?&quot; Pubic key encryption, of course! My family is not very tech-savvy (or math-savvy). So after a several hours of phone calls, I was able to get everyone to generate public+private keys (&lt;a href=&quot;https://www.cs.utexas.edu/~mitra/honors/soln.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;by hand&lt;/a&gt;) and chat them to the group. Now I need to message back a gifter/giftee list.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Input&lt;/strong&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Flexible&lt;/li&gt;&#xA;&lt;li&gt;A list of &lt;code&gt;First Name, Last Name, Piece One of Key, Piece Two of Key&lt;/code&gt; tuples&lt;/li&gt;&#xA;&lt;li&gt;So &lt;code&gt;[ John, Smith, 351, 174 ]&lt;/code&gt; is an example tuple&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;n&lt;/code&gt; would be &lt;code&gt;351&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;e&lt;/code&gt; would be &lt;code&gt;174&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Each name will be nonempty, capital and lowercase letters&lt;/li&gt;&#xA;&lt;li&gt;Initials will be unique&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Algorithm&lt;/strong&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For each tuple (i.e. &lt;code&gt;gifter&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Randomly assign a &lt;code&gt;giftee&lt;/code&gt; such that &lt;code&gt;giftee != gifter&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;[NOTE] Each &lt;code&gt;giftee&lt;/code&gt; should be assigned to exactly one &lt;code&gt;gifter&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Get the &lt;code&gt;giftee&lt;/code&gt;'s first initial and last initial&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;A or a = 1&lt;/code&gt;, &lt;code&gt;B or b = 2&lt;/code&gt;, ..., &lt;code&gt;Z or z = 26&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Encrypt each initial&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.cs.utexas.edu/~mitra/honors/soln.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Encryption&lt;/strong&gt;&lt;/a&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The encryption of a number &lt;code&gt;x&lt;/code&gt; is &lt;code&gt;x^e % n&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Output&lt;/strong&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Flexible&lt;/li&gt;&#xA;&lt;li&gt;A list of &lt;code&gt;gifters&lt;/code&gt; (first and last name) with the encrypted first and last initial of their &lt;code&gt;giftee&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Score&lt;/strong&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Shortest code in bytes wins&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input                         Middle Step                   Output&#xA;-----                         -----------                   ------&#xA;[Sherlock Holmes,1363,3]      Irene Adler =&amp;gt; IA             [Sherlock Holmes,729,1]       &#xA;[John Watson,1763,11]         Mycroft Holmes =&amp;gt; MH          [John Watson,281,935]         &#xA;[Mary Watson,1927,3]          John Watson =&amp;gt; JW             [Mary Watson,1000,605]        &#xA;[Mycroft Holmes,1271,7]       Peter Jones =&amp;gt; PJ             [Mycroft Holmes,256,1043]     &#xA;[Irene Adler,1073,5]          Mary Watson =&amp;gt; MW             [Irene Adler,35,489]          &#xA;[Peter Jones,1073,5]          Sherlock Holmes =&amp;gt; SH         [Peter Jones,688,578] &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="43214" LastEditorUserId="43214" LastEditDate="2017-03-24T15:24:34.113" LastActivityDate="2017-03-24T15:24:34.113" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11849" PostTypeId="2" ParentId="2140" CreationDate="2017-03-24T00:02:07.933" Score="0" Body="&lt;h1&gt;Many Happy Returns!&lt;/h1&gt;&#xA;&lt;p&gt;I'm not sure whether to make this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Write a function that when it returns, it returns an extra frame up the stack.  In other words, functions usually return directly to their callers; however, here the function should return directly to its caller's caller.  To illustrate, consider this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c&amp;#39;&quot; rel=&quot;tag&quot;&gt;c&lt;/a&gt; program:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-c prettyprint-override&quot;&gt;&lt;code&gt;#include &amp;lt;stdio.h&amp;gt;&#xA;&#xA;int b(void) {&#xA;    int rc = 3;&#xA;    printf(&amp;quot;%s(): returning from b()\n&amp;quot;, __FUNCTION__);&#xA;    return rc;&#xA;}&#xA;&#xA;int a(void) {&#xA;    int rc;&#xA;    rc = b();&#xA;    printf(&amp;quot;%s(): returned from b()=%d\n&amp;quot;, __FUNCTION__, rc);&#xA;    return 2;&#xA;}&#xA;&#xA;int main(int argc, char *argv) {&#xA;    int rc;&#xA;    rc = a();&#xA;    printf(&amp;quot;%s(): returned from a()=%d\n&amp;quot;, __FUNCTION__, rc);&#xA;    return 0;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The output from this program is:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-c prettyprint-override&quot;&gt;&lt;code&gt;b(): returning from b()&#xA;a(): returned from b()=3&#xA;main(): returned from a()=2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;An entry to this challenge would return from the innermost function &lt;code&gt;c()&lt;/code&gt; in a special way such that the output is:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-c prettyprint-override&quot;&gt;&lt;code&gt;b(): returning from b()&#xA;main(): returned from a()=3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that the flow of execution goes directly from the return of &lt;code&gt;b()&lt;/code&gt; back to the next line after where &lt;code&gt;main()&lt;/code&gt; called &lt;code&gt;a()&lt;/code&gt;.  The &lt;code&gt;returned from b()&lt;/code&gt; message is not output as this code never executes.  It is not sufficient just to put this message in a conditional.&lt;/p&gt;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&lt;p&gt;Assuming a template similar to this sample - i.e. &lt;code&gt;main()&lt;/code&gt; calls &lt;code&gt;a()&lt;/code&gt; calls &lt;code&gt;b()&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Entries are scored by the size of function &lt;code&gt;b()&lt;/code&gt; in bytes - smallest wins.&lt;/li&gt;&#xA;&lt;li&gt;Functions &lt;code&gt;main()&lt;/code&gt; and &lt;code&gt;a()&lt;/code&gt; must be provided, but are not included in the score&lt;/li&gt;&#xA;&lt;li&gt;There must be no special logic in &lt;code&gt;main()&lt;/code&gt; and &lt;code&gt;a()&lt;/code&gt; that help.  If the call to &lt;code&gt;b()&lt;/code&gt; were replaced with a call to &lt;code&gt;b1()&lt;/code&gt; (a normal function that returns normally), with no other modifications, then the &lt;code&gt;returned from b()&lt;/code&gt; message would be observed.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that the return types of &lt;code&gt;a()&lt;/code&gt; and &lt;code&gt;b()&lt;/code&gt; are the same&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I am aware that there are languages which make this very easy, but it is significantly more challenging (or maybe impossible) in other languages.  I don't want to explicitly ban any languages, but I am most interested in the answers where the solution is non-trivial.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="-1" LastEditorDisplayName="user62131" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-24T14:20:49.543" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11850" PostTypeId="2" ParentId="2140" CreationDate="2017-03-24T00:18:53.647" Score="0" Body="&lt;h1&gt;MCDI: Make and Change Directory into&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; A string consisting of only alphanumeric characters, whose length does not exceed 255. It is given as string input, through STDIN on a single line, through ARGV, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Effect:&lt;/strong&gt; If a directory with the given name does not exist in the current directory, create it. Then, change the current directory to that directory. You can assume that no file with the given name exists.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is an example Batch script that does this (ungolfed, of course):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;@ECHO OFF&#xA;IF NOT EXIST %1 MKDIR %1&#xA;CD %1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="31957" LastEditDate="2017-03-24T01:19:14.040" LastActivityDate="2017-03-24T01:19:14.040" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="11851" PostTypeId="2" ParentId="6918" CreationDate="2017-03-24T02:06:47.963" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/alexander-liao/java-public/tree/master/programs/ball-simulator&quot; rel=&quot;nofollow noreferrer&quot;&gt;Billiards&lt;/a&gt;, Created by Me (HyperNeutrino)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This link ^ includes the interpreter (in one source file) and the documentation/README.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Inspired by a challenge by PPCG User @PhiNotPi's, the concept behind this language is that you have a large setup of machines that operate on a bunch of balls carrying values which fall down through the machine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Advantages: Looks interesting, shorter than many languages.&#xA;Disadvantages: Heavy on bytes because of all of the special characters, longer than Jelly (obviously).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some examples of code you can write with it.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1/\&#xA; .↑&#xA;\^/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Prints theoretically all ASCII characters. Step-by-step run-through:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;The 1 creates a ball with value 1&#xA;It falls onto the first backslash, which deflects it to the right&#xA;It hits the ^ and begins levitating&#xA;It hits the . which outputs its value as per (char) value&#xA;It hits the first slash which deflects it to the right&#xA;It hits the next backslash, and since it is moving sideways, it is deflected down and ceases levitation&#xA;It hits the ↑ and its value is incremented&#xA;It hits the final slash and is deflected to the left, returning to the ^, which continues the loop.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This language has gone through many modifications; when I started with it, this was how you added two numbers up to &lt;code&gt;3 + 3 = 6&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  a          b  &#xA;    c          d&#xA;           1    &#xA;           \_/  &#xA;             \_/&#xA;            \/  &#xA;            /\  &#xA;           _ __/&#xA;            \_/ &#xA;             \/0&#xA;1           \\_/&#xA;\_/          _K1&#xA;  \_/      \  \/&#xA; \/         __/ &#xA; /\          /  &#xA;_ __/       _   &#xA; \_/       \__  &#xA;  \/ _______/   &#xA; \\_/           &#xA;  _S1           &#xA;\  \/           &#xA; __/            &#xA;  /             &#xA; _              &#xA;\__             &#xA; C              &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now, you do this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;⇓⇓&#xA;+/&#xA;↥&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It's so-so for golfing; it's not very short and I suspect that it lacks Turing-completeness. (I will try implementing Rule 110 on this to see if that's true. It doesn't have conditionals, so... it requires hacky workarounds such as using the metadata of a gridspace and splitting the ball for comparison and return values in order to do it).&lt;/p&gt;&#xA;" OwnerDisplayName="user42649" LastActivityDate="2017-03-24T02:06:47.963" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11852" PostTypeId="2" ParentId="2140" CreationDate="2017-03-24T11:04:26.407" Score="0" Body="&lt;h1&gt;Meta Code Golf &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Late new year resolution: I'm finally cleaning up all my input and output files I used for code golf previously. Only problem is, I don't know which input and output files go to which code golf question on this site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All problems used in this question should be posted on or before 31st December 2016 23:59:59 (GMT).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input format:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input would consist of an input and a correct output for the code golf question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each file can be accepted as an input file with a hardcoded filename, in the standard input, or as a function argument. The output can be a function return value, written to a file, or to standard output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the case both files are in standard input, you are allowed to define any arbitrary separator as long as it is consistent for all input files, and the separator is less than 16 bytes long.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may assume that the separator is neither in the input file or in the output files. (All possible input files/output files with the separator in it are not used for scoring purposes.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output format:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code is required to output the ID of the question. Your code is allowed to have other non-numerical output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, for this question:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;https://codegolf.stackexchange.com/questions/64449/rearrangement-inequality&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You can output any one of the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;https://codegolf.stackexchange.com/questions/64449/rearrangement-inequality&#xA;64449&#xA;The question ID is 64449.&#xA;Just look at question 64449. You can find the question there.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Meta: Scoring definitions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For each input-output pair, it may correspond to multiple questions. In that case, you may choose to output multiple answers, or only one answer. An input-output pair is considered to be &lt;em&gt;correctly classified&lt;/em&gt; if it has at least one correct answer, and all provided answers are correct.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A question is considered &lt;em&gt;correctly classified&lt;/em&gt; only if all input-output pairs corresponding to the question are &lt;em&gt;correctly classified&lt;/em&gt; and the question ID is in the output for at least one of the input-output pairs corresponding to the question.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Meta: Alternative definition&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A question is considered &lt;em&gt;correctly classified&lt;/em&gt; only if all input-output pairs with the question ID in the output are actual input-output pairs to the question, and all input-output pairs which do not correspond to the question do not have the question ID in the output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your score is the length of your code divided by the square of the number of &lt;em&gt;correctly classified&lt;/em&gt; questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the case the total number of questions you &lt;em&gt;correctly classify&lt;/em&gt; is zero, you score positive infinity. Why am I even saying this? Of course it should work on at least one question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, please claim the questions that your program &lt;em&gt;correctly classified&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the case that there are many ways the input and output for the question can be formatted, you are allowed to choose any one of them in the question, which is clearly allowed before 31st December 2016 23:59:59 GMT. You are allowed to choose different input/output formats for different questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is guaranteed that none of the input-output pairs have infinite input or output.&#xA;It is guaranteed that none of the input-output pairs have&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;I have some concerns:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As I may not have online access all the time, your code should not rely on looking at StackExchange to find the questions.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Finally:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, and the winner will be the person with the lowest score, in case of a tie, it would be tiebroken by submission time.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Meta:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Lots of these questions might be difficult to encode the input, for example questions where the input is to a function.&lt;/p&gt;&#xA;" OwnerUserId="45643" LastEditorUserId="45643" LastEditDate="2017-03-24T11:56:03.150" LastActivityDate="2017-03-24T11:56:03.150" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11854" PostTypeId="2" ParentId="2140" CreationDate="2017-03-24T13:38:33.947" Score="1" Body="&lt;h1&gt;Calculate Wind Chill&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;The Australian Apparent Temperature (aka, wind chill) in °C &lt;code&gt;AT&lt;/code&gt; is given by this algorithm from the Australian Bureau of Meterology (&lt;a href=&quot;https://en.wikipedia.org/wiki/Wind_chill#Australian_Apparent_Temperature&quot; rel=&quot;nofollow noreferrer&quot;&gt;wp&lt;/a&gt;, &lt;a href=&quot;http://www.bom.gov.au/info/thermal_stress/#atapproximation&quot; rel=&quot;nofollow noreferrer&quot;&gt;source&lt;/a&gt;):&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/FnGQP.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/FnGQP.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;AT = T&lt;sub&gt;a&lt;/sub&gt; + (0.33 * e) - (.7 * ws) - 4.0&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Where:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;code&gt;T&lt;sub&gt;a&lt;/sub&gt;&lt;/code&gt; = Dry bulb temperature (°C)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;e&lt;/code&gt; = Water vapour pressure (hPa)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;ws&lt;/code&gt; = Wind speed (m/s) (at an elevation of 10 meters)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The water vapour pressure in hectoPascals &lt;code&gt;e&lt;/code&gt; is given by this algorithm:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/mbPxZ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/mbPxZ.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;e = (rh / 100) * 6.105 * exp( ( 17.27 * T&lt;sub&gt;a&lt;/sub&gt; ) / ( 237.7 + T&lt;sub&gt;a&lt;/sub&gt; ) )&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Where:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;code&gt;T&lt;sub&gt;a&lt;/sub&gt;&lt;/code&gt; = Dry bulb temperature (°C)&lt;br&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;rh&lt;/code&gt; = Relative humidity [%]&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;exp&lt;/code&gt;  represents the exponential function&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The domain of:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;T&lt;sub&gt;a&lt;/sub&gt;&lt;/code&gt; is -273.15°C to 2e7°C.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;e&lt;/code&gt; is the real numbers&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;ws&lt;/code&gt; is 0 m/s to 2e7 m/s&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;rh&lt;/code&gt; is 0% to 100%&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;For inputs outside these domains, your code can do anything, including give the right answer.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Given a dry bulb &lt;strong&gt;temperature&lt;/strong&gt; in °C, a &lt;strong&gt;wind speed&lt;/strong&gt; in metres / second, and a &lt;strong&gt;relative humidity&lt;/strong&gt; in %, your code should give the Apparent Temperature in °C, accurate to 0.1°C.&lt;/p&gt;&#xA;&lt;p&gt;Assuming your platform or language can represent reals, for correct functions &lt;code&gt;correct_func&lt;/code&gt;,&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/lix0t.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/lix0t.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;or in C, &lt;code&gt;fabsl( correct_func(Ta, rH, ws) - expected ) &amp;lt; 0.1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;pre&gt;&#xA;value for T&lt;sub&gt;a&lt;/sub&gt;, rh, ws -&gt; output&#xA;&#xA;0   -&gt;  -4.0&#xA;2   -&gt;  -3.3529916671770903&#xA;4   -&gt;  -2.6916697830145546&#xA;6   -&gt;  -2.0132006039049877&#xA;8   -&gt;  -1.3143308806029346&#xA;10  -&gt;  -0.5913412821173161&#xA;12  -&gt;  0.16000376605969002&#xA;14  -&gt;  0.9445099696431676&#xA;16  -&gt;  1.767610915646344&#xA;18  -&gt;  2.6354298170017625&#xA;20  -&gt;  3.5548453789325833&#xA;22  -&gt;  4.5335619088440815&#xA;24  -&gt;  5.580183785538598&#xA;26  -&gt;  6.704294397098089&#xA;28  -&gt;  7.916539649854112&#xA;30  -&gt;  9.2287161435045&#xA;&lt;/pre&gt;&#xA;&lt;p&gt;You can use a builtin function for the exponential function,&#xA;&lt;code&gt;e&lt;sup&gt;x&lt;/sup&gt;&lt;/code&gt;, if you like.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code wins!&lt;/p&gt;&#xA;" OwnerUserId="46231" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-31T17:36:34.390" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11856" PostTypeId="2" ParentId="5212" CreationDate="2017-03-24T15:15:26.417" Score="11" Body="&lt;h2&gt;&lt;a href=&quot;https://www.wikiwand.com/en/Duel&quot; rel=&quot;nofollow noreferrer&quot;&gt;Dueling&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Ever since Dave threw down &lt;a href=&quot;https://codegolf.stackexchange.com/questions/89919/quick-golf-the-gold-leader#comment219301_89919&quot;&gt;the gauntlet&lt;/a&gt; which sparked a friendly &lt;code&gt;Java vs C&lt;/code&gt; showdown, I've been pondering the idea of having a formal avenue for these &lt;em&gt;'mini-challenges'&lt;/em&gt;. If this were to happen, the duels would be a fun way to inspire meticulous golfing. The two individuals (possibly with help from spectators) would go back and forth, creating two meticulous solutions for a particular challenge at no cost to the community.&lt;/p&gt;&#xA;&lt;h3&gt;What it is&lt;/h3&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A duel is an arranged engagement in combat between two individuals with matched weapons in accordance with agreed-upon rules. Used to gain &amp;quot;satisfaction&amp;quot;, that is, to restore/defend one's honor.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;In this context, it would be a duel between two golfers. There is a challenger, who throws down the gauntlet and there is the champion who accepts the challenge.&lt;/p&gt;&#xA;&lt;h3&gt;How it works&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Challenger specifies:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the question&lt;/li&gt;&#xA;&lt;li&gt;his language&lt;/li&gt;&#xA;&lt;li&gt;his opponent's language&lt;/li&gt;&#xA;&lt;li&gt;time frame&lt;/li&gt;&#xA;&lt;li&gt;rep&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Champion&#xA;&lt;ul&gt;&#xA;&lt;li&gt;chooses to accept the challenge&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Outcome&#xA;&lt;ul&gt;&#xA;&lt;li&gt;after the time frame&lt;/li&gt;&#xA;&lt;li&gt;based on the question's winning criterion&lt;/li&gt;&#xA;&lt;li&gt;the better of the two answers wins&lt;/li&gt;&#xA;&lt;li&gt;the victor receives a bounty for the rep amount&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Implementation&lt;/h3&gt;&#xA;&lt;p&gt;How do we make this happen? We could have a &lt;em&gt;'List of Duels'&lt;/em&gt;, similar to our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5243/list-of-bounties-with-no-deadline&quot;&gt;&lt;em&gt;'List of Bounties'&lt;/em&gt;&lt;/a&gt;. Challengers can post duels, champions can comment their acceptance, spectators can follow the links and assist.&lt;/p&gt;&#xA;" OwnerUserId="43214" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-24T15:15:26.417" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11857" PostTypeId="2" ParentId="2140" CreationDate="2017-03-24T20:09:40.617" Score="0" Body="&lt;h1&gt;Simplify Brainf**k&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We'll call a language &lt;em&gt;BF equivalent&lt;/em&gt; if it emits a context-free substitution mapping to and from BF. For example, consider the hypothetical language &lt;em&gt;SimpleBrain&lt;/em&gt; which is identical to BF except that it does not include &lt;code&gt;+&lt;/code&gt; or &lt;code&gt;&amp;gt;&lt;/code&gt;, but instead has &lt;code&gt;}&lt;/code&gt;. It emits the following mapping to BF:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;}: +&amp;gt;&#xA;&amp;lt;: &amp;lt;&#xA;-: -&#xA;.: .&#xA;,: ,&#xA;[: [&#xA;]: ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And the following mapping from BF:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+: }&amp;lt;&#xA;&amp;gt;: -}&#xA;&amp;lt;: &amp;lt;&#xA;-: -&#xA;.: .&#xA;,: ,&#xA;[: [&#xA;]: ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Design a BF equivalent language. The language with the fewest commands wins (&lt;em&gt;SimpleBrain&lt;/em&gt;, for example, has 7). In the event of a tie (which is likely) the language with the shortest representation with the mapping you provide of the following BF program wins:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;++++++++++[&amp;gt;+++++++&amp;gt;++++++++++&amp;gt;+++&amp;gt;+&amp;lt;&amp;lt;&amp;lt;&amp;lt;-]&amp;gt;&#xA;++.&amp;gt;+.+++++++..+++.&amp;gt;++.&amp;lt;&amp;lt;+++++++++++++++.&amp;gt;.&#xA;+++.------.--------.&amp;gt;+.&amp;gt;.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Sandbox Notes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There have been many efforts to &quot;simplify&quot; BF, but most of them shift complexity from the language to the interpreter. I've tried to formulate the rules in such a way that this cannot happen.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Are there interesting solutions to this challenge? I can only think of a few. I'd love to seem some creative answers to this problem. I am also looking for ways to better define &lt;em&gt;context-free substitution mapping&lt;/em&gt; as what I have in mind clearly excludes trivial reductions like &lt;a href=&quot;https://esolangs.org/wiki/Braincrash&quot; rel=&quot;nofollow noreferrer&quot;&gt;Braincrash&lt;/a&gt; because there is not a context-free mapping from Braincrash to BF, but I don't know if that's totally clear from the wording. By context-free substitution mapping, I mean substitution rules of the form:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a := b_1 b_2 ... b_n&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;a&lt;/code&gt; is a single command in the source language and the RHS is any finite number of commands in the language we're mapping to (the LHS consists of a single symbol which is why I described it as context-free).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also question whether this is exactly a programming puzzle per say. I am open to reformulating the challenge to make it better suited for the site if there is opposition.&lt;/p&gt;&#xA;" OwnerUserId="31002" LastEditorUserId="31002" LastEditDate="2017-03-25T04:26:39.133" LastActivityDate="2017-03-25T04:26:39.133" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11860" PostTypeId="1" AcceptedAnswerId="11861" CreationDate="2017-03-25T03:46:51.957" Score="4" ViewCount="108" Body="&lt;p&gt;A &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11837/62024&quot;&gt;challenge proposal&lt;/a&gt; I posted into the sandbox has received zero attention (no votes, no comments).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should I:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;just post it on the main site and hope for the best?&lt;/li&gt;&#xA;&lt;li&gt;do an edit to bump the question up in the &quot;active&quot; sorting?&lt;/li&gt;&#xA;&lt;li&gt;consider it failed?&lt;/li&gt;&#xA;&lt;li&gt;do something else?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="62024" LastActivityDate="2017-03-25T03:53:59.417" Title="Zero (neither positive or negative) attention to challenge proposal in sandbox - what to do?" Tags="|discussion|sandbox|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11861" PostTypeId="2" ParentId="11860" CreationDate="2017-03-25T03:53:59.417" Score="10" Body="&lt;p&gt;Post the link in chat. Usually this encourages more people to look at it.&lt;/p&gt;&#xA;" OwnerUserId="39244" LastActivityDate="2017-03-25T03:53:59.417" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11862" PostTypeId="1" CreationDate="2017-03-25T13:45:49.403" Score="0" ViewCount="57" Body="&lt;p&gt;As some languages can be used in command prompts(no matter which), some of them return the current directory like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;C:\Foo\Bar&amp;gt;command&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So here comes my question:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do we need to hide the prompt in PPCG answers?&lt;/p&gt;&#xA;" OwnerUserId="66012" LastEditorUserId="66012" LastEditDate="2017-03-25T13:54:28.287" LastActivityDate="2017-03-25T13:54:28.287" Title="Do we need to hide the prompt" Tags="|discussion|" AnswerCount="0" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="11863" PostTypeId="1" CreationDate="2017-03-25T17:21:58.547" Score="1" ViewCount="85" Body="&lt;p&gt;I'm trying to figure out how the byte counting works in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/113674/sum-the-numbers-on-standard-in/113709#113709&quot;&gt;&quot;&lt;em&gt;Sum the numbers on standard in&lt;/em&gt;&quot;&lt;/a&gt;.  In &lt;a href=&quot;https://codegolf.stackexchange.com/a/113709/53016&quot;&gt;one answer&lt;/a&gt; using the &lt;code&gt;jq&lt;/code&gt; util counts the non-space bytes &lt;em&gt;after&lt;/em&gt; the util name, but not the util or the spaces.  Using similar reckoning, (i.e. don't count the util name), one could get a byte count of &lt;strong&gt;0&lt;/strong&gt; from &lt;a href=&quot;http://suso.suso.org/programs/num-utils/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;numsum&lt;/code&gt;&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Possibly the distinction is between programs which are also languages, (i.e. &lt;code&gt;jq&lt;/code&gt; describes itself as a &lt;em&gt;language&lt;/em&gt;, therefore &lt;em&gt;don't&lt;/em&gt; count the language binary name), and utils that are not, (so &lt;em&gt;do&lt;/em&gt; count the util name).  If so, perhaps the question is what distinguishes a language from a util with a lot of switches.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Supposing a clear distinction exists between language executables and utils, there's then the question as to language executables used as utils, as in &lt;a href=&quot;https://codegolf.stackexchange.com/a/113683/53016&quot;&gt;this answer&lt;/a&gt; where the pipe &lt;code&gt;|bc&lt;/code&gt; is counted even though &lt;code&gt;bc&lt;/code&gt; describes itself as a language.&lt;/p&gt;&#xA;" OwnerUserId="53016" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2017-03-26T17:26:39.683" Title="Language util name byte counting" Tags="|discussion|code-golf|scoring|" AnswerCount="1" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="11864" PostTypeId="2" ParentId="2140" CreationDate="2017-03-25T17:53:54.077" Score="1" Body="&lt;h1&gt;Average of a tune&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/music&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;music&amp;#39;&quot; rel=&quot;tag&quot;&gt;music&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Often times when I'm bored, I'll find I have a catchy tune from a song stuck in my head. Then I notice the fingers on my right hand moving as if playing that tune on a piano. If I have nothing better to do, I'll spend some time calculating where on the scale I need to play so that all five fingers get optimal usage. For example, given the tune&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;C4 C4 G4 G4 A4 A4 G4 F4 F4 E4 E4 D4 D4 C4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I try to center the notes such that if they were weights arranged on a board, the board would balance on my middle finger. (That's probably not a tune I'd have stuck in my head, but you get the idea.) In this case, the notes can be arranged like so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;C4          G4&#xA;C4 D4 E4 F4 G4 A4&#xA;C4 D4 E4 F4 G4 A4&#xA;=================&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now we have to balance the board. If the fulcrum is placed under E4, it will be equivalent to summing the following weights:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-2          +2&#xA;-2 -1  0 +1 +2 +3&#xA;-2 -1  0 +1 +2 +3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The result is +6, indicating that the board is leaning to the right. So we try moving right so that the fulcrum is under F4, which gives us the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-3          +1&#xA;-3 -2 -1  0 +1 +2&#xA;-3 -2 -1  0 +1 +2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The sum is -8, indicating that the board is leaning to the left, and also leaning further than it had before; therefore, the optimal middle note is &lt;strong&gt;E4&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By this point I've usually wasted all the time I had at my disposal, plus a good bit more. So your task is to write a program or function that does this calculation for me. Since I have more important things to waste my memory on, your code should be as short as possible.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program or function which takes in a list of notes and outputs the average of these notes.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Only notes on the scale of C major (C, D, E, F, G, A, B) should be taken into account; you never need to deal with sharps or flats.&lt;/li&gt;&#xA;&lt;li&gt;The notes can range from C0 to B9, inclusive; you'll never get A-1 or C12.&lt;/li&gt;&#xA;&lt;li&gt;The input can be given as an array, or as a string separated by spaces, newlines, commas, etc.&lt;/li&gt;&#xA;&lt;li&gt;The input will always contain at least one note.&lt;/li&gt;&#xA;&lt;li&gt;Input/output can be given in whichever case is desired. If your code only accepts one case or the other, make a note of this in your answer.&lt;/li&gt;&#xA;&lt;li&gt;If there are two valid outputs for a given input, you may output either or both.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input -&amp;gt; Output(s)&#xA;C3 -&amp;gt; C3&#xA;C0 -&amp;gt; C0&#xA;B9 -&amp;gt; B9&#xA;C3 C3 -&amp;gt; C3&#xA;C3 D3 -&amp;gt; C3 or D3&#xA;C3 E3 -&amp;gt; D3&#xA;C0 B9 -&amp;gt; B4 or C5&#xA;C3 C3 C3 -&amp;gt; C3&#xA;C3 C3 D3 -&amp;gt; C3&#xA;C3 C3 E3 -&amp;gt; D3&#xA;C4 D4 E4 F4 -&amp;gt; D4 or E4&#xA;E4 E4 E4 C4 E4 G4 G3 -&amp;gt; D4&#xA;C3 D3 E3 F3 G3 A3 B3 C4 -&amp;gt; F3 or G3&#xA;C3 C3 E3 F3 G3 A3 B3 C4 -&amp;gt; F3&#xA;A3 A3 A3 C4 A3 A3 A3 A3 G3 F3 E3 -&amp;gt; A3&#xA;C5 D4 C4 C5 D4 C4 A4 C5 D4 C4 C5 D4 C4 -&amp;gt; F4&#xA;C4 C4 G4 G4 A4 A4 G4 F4 F4 E4 E4 D4 D4 C4 -&amp;gt; E4&#xA;E3 E3 F3 G3 G3 F3 E3 D3 C3 C3 D3 E3 E3 D3 D3 -&amp;gt; E3&#xA;C4 C4 E4 E4 A3 A3 C4 C4 F3 F3 A3 A3 G3 G3 B3 B3 -&amp;gt; B3&#xA;C3 C3 E4 E4 A2 A2 C4 C4 F2 F2 A3 A3 G2 G2 B3 B3 -&amp;gt; E3&#xA;A3 A3 A3 G3 A3 A3 A3 B3 B3 C4 C4 C4 B3 C4 G4 G4 B3 B3 -&amp;gt; B3&#xA;G3 G3 A3 G3 C4 B3 G3 G3 A3 G3 D4 C4 G3 G3 G4 E4 C4 B3 A3 F4 F4 E4 C4 D4 E4 -&amp;gt; B3&#xA;B9 B9 B9 B9 B9 B9 B9 B9 B9 B9 B9 B9 B9 B9 B9 B9 B9 B9 B9 B9 B9 B9 B9 B9 B9 B9 B9 B9 A6 -&amp;gt; A9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;(Imaginary bonus point for each song you recognize)&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Since this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;strong&gt;the shortest code in bytes in each language wins.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is there a plain &quot;average of an array of integers&quot; challenge, and would this be a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Is anything unclear, or does any information need to be added?&lt;/li&gt;&#xA;&lt;li&gt;Suggestions for a title? I feel like there's a &quot;tuna fish&quot; pun waiting to be made...&lt;/li&gt;&#xA;&lt;li&gt;Suggestions for test cases?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42545" LastActivityDate="2017-03-25T17:53:54.077" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11865" PostTypeId="2" ParentId="2140" CreationDate="2017-03-25T21:32:01.057" Score="0" Body="&lt;h1&gt;Make a generated MIDI sound better&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Being a crazy man, I sometimes listen to music made to midi trough a filter that makes it MIDI. It is a great experience, but I need to work a lot on it, because MIDI has a lot of instruments, and not every one sound good with every track&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program that that finds which instrument represents the song the best&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.ofoct.com/audio-converter/convert-wav-or-mp3-ogg-aac-wma-to-midi.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Filter that is used&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://timtechsoftware.com/ad.html?keyword=sf2%20format?file_name=the%20General%20MIDI%20Soundfont?file_url=uploads/GeneralUser_GS_SoftSynth_v144.sf2&quot; rel=&quot;nofollow noreferrer&quot;&gt;Soundfont that is used&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A single .mid file&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A number representing MIDI instrument&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Score=Similarity/length by characters&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Similarity is defined by executing Fourier transform and finding the percent of similarity between original and output sounds&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Is this any good? and is scoring not exploitable?&lt;/p&gt;&#xA;" OwnerUserId="40724" LastActivityDate="2017-03-25T21:32:01.057" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11868" PostTypeId="2" ParentId="11863" CreationDate="2017-03-26T14:57:25.217" Score="3" Body="&lt;p&gt;Basically, the rule is that the name of an executable counts if you have to access that executable &lt;em&gt;during the course of running the code&lt;/em&gt;, rather than it being the thing that runs the code in of itself. In the example of the bash + bc answer, &lt;code&gt;bc&lt;/code&gt; is counted as 2 bytes because those two characters are part of the &lt;em&gt;Bash&lt;/em&gt; program (it needs them to figure out that it has to call into bc rather than some other executable), rather than anything to do with bc itself. &lt;code&gt;bash&lt;/code&gt; isn't counted, even though you'd likely need to type it to run the program, because the program's a Bash program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The general rule is that you take the shortest method of running a program in your language as &quot;+0&quot; bytes of penalties. Anything you need to do to the command line beyond that gives you byte penalties.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For what it's worth, I believe this challenge has a valid 0-byte answer (&lt;code&gt;&lt;/code&gt;) in numsum, and a valid 6-byte answer (&lt;code&gt;numsum&lt;/code&gt;) in Bash + numsum. (Note how those are different languages. The former isn't a programming language; atm we don't consider that disqualifying but views on that have gone back and forth over time.)&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-03-26T14:57:25.217" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11869" PostTypeId="2" ParentId="2140" CreationDate="2017-03-26T15:08:31.830" Score="0" Body="&lt;h1&gt;Goodstein Sequences&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;From Wikipedia:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Goodstein sequence G(m) of a number m is a sequence of natural numbers. The first element in the sequence G(m) is m itself. To get the second, G(m)(2), write m in hereditary base-2 notation, change all the 2s to 3s, and then subtract 1 from the result. In general, the (n + 1)-st term G(m)(n + 1) of the Goodstein sequence of m is as follows:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Take the hereditary base-n + 1 representation of G(m)(n).&lt;/li&gt;&#xA;&lt;li&gt;Replace each occurrence of the base-n + 1 with n + 2.&lt;/li&gt;&#xA;&lt;li&gt;Subtract one. (Note that the next term depends both on the previous term and on the index n.)&lt;/li&gt;&#xA;&lt;li&gt;Continue until the result is zero, at which point the sequence terminates.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Example: The Goodstein sequence for 13 is:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;2^(2+1)+2^2+2^0 = 13&lt;/li&gt;&#xA;&lt;li&gt;3^(3+1)+3^3+3^0-1 = 3^(3+1)+3^3 = 108&lt;/li&gt;&#xA;&lt;li&gt;4^(4+1)+4^4-1 = 4^(4+1)+3*4^3+3*4^2+3*4^1+3*4^0 = 1279&lt;/li&gt;&#xA;&lt;li&gt;5^(5+1)+3*5^3+3*5^2+3*5^1+3*5^0-1 = 5^(5+1)+3*5^3+3*5^2+3*5^1+2*5^0 = 16092&lt;/li&gt;&#xA;&lt;li&gt;6^(6+1)+3*6^3+3*6^2+3*6^1+2*6^0-1 = 6^(6+1)+3*6^3+3*6^2+3*6^1+6^0 = 280711&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;And so on&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Your Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Print the first 3 terms of the Goodstein sequence that starts on the input. If there are fewer than 3 terms, print out all the terms in the sequence (e.g. for input 1).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example inputs and outputs:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Input: 1, Output: 1, 0&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Input: 2, Output: 2, 2, 1&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Input: 3, Output: 3, 3, 3&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Input: 4, Output: 4, 26, 41&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;You may assume that the input will be a natural number from 1-200. Note that one of the challenges of this challenge is to support integers over 2^500.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Winning Criterion&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins! Answers from all languages are encouraged. The speed of the solution does not matter, as long as it eventually prints out the desired answer.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Fun Fact&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;All Goodstein sequences eventually converge to 0.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Tags: code-golf, math, sequence, number-theory, base-conversion&lt;/p&gt;&#xA;" OwnerUserId="67162" LastActivityDate="2017-03-26T15:08:31.830" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11871" PostTypeId="1" CreationDate="2017-03-26T17:48:33.927" Score="9" ViewCount="581" Body="&lt;p&gt;First, I hope this isn't a duplicate (I've tried my best to search through for similar questions, but I very well may have overlooked one).&lt;/p&gt;&#xA;&lt;p&gt;In the spirit of being fair to inflexible programming languages, I added a rule in a &lt;a href=&quot;https://codegolf.stackexchange.com/q/113901/42833&quot;&gt;challenge of mine&lt;/a&gt; allowing for flexible IO. In this rule I said,&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;You may take the input differently, within reason (feel free to ask me if you have a specific kind of input in mind), if it would be very hard or impossible to handle input in this format in your language.&lt;/p&gt;&#xA;&lt;p&gt;However, I'm not looking for golfing to be done in the input format. e.g. if you're in Python and want to save calling &lt;code&gt;str.split('\n')&lt;/code&gt; on the input, you may not ask for the input as a list of strings to save you those bytes.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I realized once an answer asked for a different input that I had no way of qualifying what constitutes the &amp;quot;very hard&amp;quot; case.&lt;/p&gt;&#xA;&lt;p&gt;This answer would benefit from a 20-30 byte reduction if the input were changed, which I initially wanted to allow for it. But I have no real way to justify that this is allowable over the hypothetical Python answer which would also benefit from a different input format.&lt;/p&gt;&#xA;&lt;p&gt;So, to my question,&lt;/p&gt;&#xA;&lt;h3&gt;Is there a general way to rule on what is an acceptable input modification?&lt;/h3&gt;&#xA;&lt;p&gt;I am not particularly looking for specific cases here, I mean to ask what criteria a programming language needs to meet to allow for it to claim a different input (if the challenge allows for that).&lt;/p&gt;&#xA;" OwnerUserId="42833" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-07T19:00:05.743" Title="When to allow flexible input/output" Tags="|discussion|code-golf|" AnswerCount="5" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11872" PostTypeId="2" ParentId="11871" CreationDate="2017-03-26T18:47:22.347" Score="16" Body="&lt;h1&gt;Always (if possible)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Any picky criteria we end up giving here will end up being completely arbitrary. Therefore, always strive to allow as flexible I/O as possible in a code golf challenge &lt;em&gt;that isn't about processing input or producing a very specific output&lt;/em&gt;. In other words, unless the challenge would not be complete without the input/output requirements, allow flexibility.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance, why not give that Python user an opportunity to save the call to split? Is the purpose of the challenge to do a bunch of input munging, or is it to actually compute something? If it's the latter, letting that Python user save that call (and all other users save their own random string processing calls) will make the challenge more fun for everyone.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Always err on the side of keeping the actual point of the challenge front and center, and don't get bogged down in details like this. Always err on the side of what will be the most fun.&lt;/p&gt;&#xA;" OwnerUserId="47050" LastActivityDate="2017-03-26T18:47:22.347" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11873" PostTypeId="2" ParentId="2140" CreationDate="2017-03-26T19:24:57.167" Score="0" Body="&lt;h1&gt;Darwin Fights&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(code-challenge)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are fighting a swarm of evolving enemies. Your goal is to outsmart them by turning evolution on its head.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The game consists of multiple &lt;em&gt;rounds&lt;/em&gt;, starting with round 0. Every round &lt;code&gt;n&lt;/code&gt; contains &lt;code&gt;5(n+1)&lt;/code&gt; enemies, so it starts out with 5, then 10, and so on. Each enemy has a couple statistics:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Health -- the amount of health the enemy has left&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Attack -- the damage that the enemy can do&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Defense -- reduces damage done&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Reproduction -- controls the rate (chance) of reproduction&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Blur -- Makes the enemy seem weaker than it actually is.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The starting values for these numbers are taken from the previous round (details below), or if it is the first round, a mutated form of the enemy with health 1, attack 0, defense 0, reproduction 1, and blur 0. The player also has similar stats: health, attack, defense, and regeneration (how much health recovered per turn). You start off with 100 health, and the only condition on attack, defense, and regeneration is that their sum must be less than or equal to 10.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Details of turn order&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;All the enemies attack you, you lose health according to the damage formula below.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You choose 3 enemies to attack or you nuke them (see below). It is advised to choose the 3 most powerful enemies to stop them from reproducing.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;All surviving enemies have the chance to reproduce. If &lt;code&gt;r&lt;/code&gt; is their reproduction coefficient, their chance of reproducing is &lt;code&gt;r/n&lt;/code&gt; where &lt;code&gt;n&lt;/code&gt; is the total number of enemies. Thus, the expected number of new enemies is the average value of all the enemies' &lt;code&gt;r&lt;/code&gt;-values. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If there are no surviving enemies, the round is over. The next round starts and is populated with &lt;code&gt;5(n+1)&lt;/code&gt; enemies. Your health is restored. The next round's enemies' stats are determined by a weighted average of all the dead enemies' stats of the current round. They are weighted by the number of steps they survived in that round. Thus, it is important to eliminate strong enemies early in the round.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Damage&lt;/strong&gt;: If the attacker has attack &lt;code&gt;a&lt;/code&gt; and defender has defense &lt;code&gt;d&lt;/code&gt;, the amount of health lost by the defender is &lt;code&gt;a*(1-d/25)&lt;/code&gt;. The minimum amount of damage is capped at &lt;code&gt;a/4&lt;/code&gt;, so the value of &lt;code&gt;d&lt;/code&gt; is essentially capped at &lt;code&gt;18.75&lt;/code&gt; (it can be higher, but it wouldn't do any good).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt; You will get input in the following manner: a list of lists, each list containing the data for one enemy, in the order &lt;code&gt;[health, attack, defense, reproduction]&lt;/code&gt;. Each of these values is reduced by a number uniformly chosen between &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;blur&lt;/code&gt;. You will return the indices of the enemies you want to attack. If you return anything other than a list of 3 nonnegative integers (so e.g. an empty list), you choose to &lt;em&gt;nuke&lt;/em&gt; the enemies.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nuke&lt;/strong&gt;: Nuking is just the ability to attack every enemy in a single turn. After nuking, you must wait 10 turns before being able to nuke again. Warning: since nuking attacks all enemies, it is common that a nuke will leave only strong enemies behind. Thus if there are survivors that reproduce, they will be the strongest. Use nukes carefully!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Reproduction&lt;/strong&gt;: If an enemy is able to reproduce, it will choose a mate to mate with. The chance of being chosen as a mate is proportional to the attack power. It is possible the enemy's mate is itself (asexual), or that there is only one enemy left, in which case it is forced to reproduce asexually. The new enemy's traits is based on the average of the parents' traits, added to a mutation&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Mutations&lt;/strong&gt;: As soon as an organism is created, whether at the beginning of the round or from parents, its values are mutated. A normally distributed random number with mean 0 and standard deviation 0.3 is added to each one. A mutation will never cause the starting health or reproduction coefficient to go below 1, and will never cause the attack or defense to go below zero.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Score&lt;/strong&gt;: Your score is the number of rounds you survive. Ties are broken by the amount of least health you had left at the end of any round before the last round. Scoring will be based off of taking your median run after running your code for a large number of times (to be determined, on the order of 100).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Controller:&lt;/strong&gt; Currently written in python, available here: &lt;a href=&quot;https://gist.github.com/prakol16/f0a306efd63a977a95c034b4b6e00ef1#file-darwin_main-py&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://gist.github.com/prakol16/f0a306efd63a977a95c034b4b6e00ef1#file-darwin_main-py&lt;/a&gt;. To write your own class, extend the class Player and override the methods &lt;code&gt;__init__&lt;/code&gt; and &lt;code&gt;get_attack&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;class ExamplePlayer(Player):&#xA;def __init__(self):&#xA;    # Should add up to 10&#xA;    super().__init__(attack=3, defense=0, regeneration=7)&#xA;&#xA;def get_attack(self, enemies, round_num, nuke_recharge):&#xA;    if self.get_health() &amp;lt; 50 and nuke_recharge == 0:&#xA;        return [0]  # Nuke it!&#xA;    return [0, 1, 2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="23550" LastActivityDate="2017-03-26T19:24:57.167" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11876" PostTypeId="2" ParentId="11871" CreationDate="2017-03-27T08:41:29.633" Score="9" Body="&lt;h1&gt;Always allow flexibility, within reason&lt;/h1&gt;&#xA;&lt;p&gt;You should allow flexible input/output to keep it &amp;quot;fair&amp;quot;. By that I mean: No single language (or group of languages) should have an advantage / disadvantage due to the input/output format.&lt;/p&gt;&#xA;&lt;p&gt;Normally it's sufficient to say:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The input / output formats are optional.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;People will then assume all the following are allowed if the input is a list of numbers: &lt;code&gt;1 2 3&lt;/code&gt;, &lt;code&gt;{1,2,3}&lt;/code&gt;, &lt;code&gt;[[1],[2],[3]]&lt;/code&gt; and so on. Specifying all the different allowed styles is hard, and will lead to questions: &lt;em&gt;&amp;quot;Are &lt;code&gt;(1;2;3)&lt;/code&gt; and &lt;code&gt;list(1,2,3)&lt;/code&gt; accepted?&amp;quot;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;People will also assume that different types of input and escape characters are allowed in strings (if necessary): &lt;code&gt;&amp;quot;It's OK/not OK&amp;quot;&lt;/code&gt;, &lt;code&gt;It''s OK'/not OK&lt;/code&gt;, &lt;code&gt;['It/'s OK/not OK&amp;quot;]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Except for the occasional new user, no one will attempt to do all the processing in the input, and let the code simply be: &lt;code&gt;f(x)=eval(x)&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You will get the occasional:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is a list of single character strings OK?&lt;/li&gt;&#xA;&lt;li&gt;Can I take the string as comma delimited ASCII-values?&lt;/li&gt;&#xA;&lt;li&gt;Can I take the list of integers as: &lt;code&gt;1+2+3&lt;/code&gt;?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If you get these questions, then use your best judgement.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Also, remember that different languages have different limitations. For instance, a matrix such as:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3&#xA;4 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;is impossible in MATLAB/Octave. The only way to get this matrix, is by creating a &lt;em&gt;string&lt;/em&gt; where we concatenate each line with the newline character ASCII code point 10. &lt;code&gt;['1 2 3', 10, '4 5']&lt;/code&gt;. This is really cumbersome. By allowing optional input/output formats, you will allow:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;{[1 2 3];[4 5]}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;which is pretty much the same.&lt;/p&gt;&#xA;" OwnerUserId="31516" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-28T10:37:05.547" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11878" PostTypeId="1" CreationDate="2017-03-27T14:55:49.770" Score="2" ViewCount="58" Body="&lt;p&gt;I have a couple of sandbox posts that have been there for a while. I have not posted them yet, though, because I don't know if they are ready...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How does one know if their ideas are ready to graduate from the sandbox?&lt;/p&gt;&#xA;" OwnerUserId="64159" LastActivityDate="2017-03-27T14:55:49.770" Title="How do we know that our question can graduate from the sandbox?" Tags="|support|sandbox|" AnswerCount="0" CommentCount="2" FavoriteCount="0" ClosedDate="2017-03-27T15:46:40.007" ContentLicense="CC BY-SA 3.0" />
  <row Id="11879" PostTypeId="2" ParentId="11871" CreationDate="2017-03-27T16:33:00.817" Score="3" Body="&lt;h1&gt;It's up to you&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I see no issue what-so-ever with restricting IO &lt;em&gt;formats&lt;/em&gt;. I agree we should enable all sorts of languages to compute (i.e. not require STDIN, allow functions rather than programs, etc.), but I don't think question askers should be expected to weaken their specifications to reduce overhead on certain classes of languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I disagree that there is anything 'unfair' about requiring output of two intergers, for example, to be of the format &quot;%d: %d&quot; if it makes sense in the context of the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/110912/calculate-exponents-bit-by-bit&quot;&gt;Calculate Exponents bit by bit&lt;/a&gt;. The question here specifies a perfectly logical output format, and if the question asker expects it to be followed, then it should be. I for one think that the constant requests for weakening specifications is ridiculous, and having these slowly morphing specs undermines the work of people who like the challenge of working &lt;em&gt;to&lt;/em&gt; a spec, rather than (what I sometimes see as) trying to undermine it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that I have absolutely no issue with having flexible IO (and I agree it's often for the best), but I don't like the aggressive perusal of it by &lt;em&gt;answerers&lt;/em&gt; outside of the sandbox, and I strongly support the right of askers to ask questions which require some effort for IO: people regularly comment on just how much of their code is devoted* to parsing input or rendering output, but whenever you have more code, you have more opportunity to &lt;em&gt;golf&lt;/em&gt;, and if one language has strong IO processing abilities, then &lt;em&gt;we should jolly well let it shine now and then&lt;/em&gt; and not pull it down by demanding weak specifications. (*often if any of your code is 'devoted' to parsing IO, then really you are missing an opportunity to pack some logic in their as well, and input formats often guide the design of the entire program, they are &lt;em&gt;not&lt;/em&gt; just an inconvenience that is bolted onto the start and end).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I know the general argument is that questions should deal with the task at hand, and not the IO, but a &lt;em&gt;massive&lt;/em&gt; part of programming is processing other peoples data, and passing it. If a question wants you to produce some petty output (&lt;em&gt;&quot;given an integer, square it&quot;&lt;/em&gt;) then why not provide some &lt;em&gt;meaningful&lt;/em&gt; petty output (&lt;em&gt;&quot;a*a = b&quot;&lt;/em&gt;). The way I see it, there are a lot of boring questions, which could be made half interested by adding some IO restrictions, and some which devolve into who can pick the right input format for feeding to some language specific built-in.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More generally, I disagree that questions should be 'fair' in any way, and that this even applies here. Enabling (most any) language to answer is great, but trying to even the field is necessarily doomed to fail. If you restrict the format, then it's down to the language's ability to handle that format. If you open it wide, then the advantage is the language with the broadest set of 'acceptable' input formats. In other words, flexible IO gives a &lt;em&gt;consistent advantage to a specific group of languages&lt;/em&gt; (looking at MATLAP/Mathematic). But this is fine, it's a feature of those languages that they can chew up almost anything. It's only a problem if we insist on allowing them to chew up anything whenever they want.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can't imagine this will be a terribly popular post, and I respect the judgement of the community as a whole, but I doubt I'm the only person who feels this way and I felt it should be represented.&lt;/p&gt;&#xA;" OwnerUserId="26981" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2017-03-27T16:33:00.817" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="11884" PostTypeId="2" ParentId="2447" CreationDate="2017-03-28T00:10:51.567" Score="33" Body="&lt;h2&gt;Input and output of a single value may be represented as a singleton list&lt;/h2&gt;&#xA;&lt;p&gt;For example, if the value was &lt;code&gt;4&lt;/code&gt;, &lt;code&gt;[4]&lt;/code&gt; would be an acceptable representation (using Python list syntax).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-28T00:10:51.567" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11887" PostTypeId="2" ParentId="2140" CreationDate="2017-03-28T12:23:16.453" Score="0" Body="&lt;h2&gt;Linear Chemistry&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input is a string representing a skeletal formula of a molecule, in a format similar to &lt;code&gt;O=C-O-H&lt;/code&gt;. However as a lot of formulas contain carbon and hydrogen atoms, it is customary to skip them from the description and just signal their presence by only displaying the used bonds. We will call these atoms implicit atoms, while the ones that are shown explicitly in the formula explicit atoms.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your job is to calculate the number of different atoms a specific skeletal formula contains.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input is a one line string containing the following tokens:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;-&lt;/code&gt;, &lt;code&gt;=&lt;/code&gt;, &lt;code&gt;≡&lt;/code&gt; symbolizing the bonds between the atoms&lt;/li&gt;&#xA;&lt;li&gt;Any uppercase character followed by a number of lowercased characters symbolizing an atom of some sort (e.g. &lt;code&gt;O&lt;/code&gt;, &lt;code&gt;H&lt;/code&gt;, &lt;code&gt;Br&lt;/code&gt;, &lt;code&gt;Uub&lt;/code&gt;, etc.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You have to output the number of different atoms this molecule contains in any sensible format.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Notes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can omit specifying the number of atoms if there is only one in the molecule&lt;/li&gt;&#xA;&lt;li&gt;You may or may not merge the number of implicit and explicit atoms of &lt;code&gt;C&lt;/code&gt; and &lt;code&gt;H&lt;/code&gt; molecules (e.g. you can treat them as separate types).&lt;/li&gt;&#xA;&lt;li&gt;You can output the atoms in any order&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For example for the input string &lt;code&gt;-OH&lt;/code&gt; valid output can be:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;CH₃OH&lt;/code&gt; (preferred output)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;CH3OH&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;CH4O&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;H4O1C1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{C:1,H:4,O:1}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Invalid outputs:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;CHHHOH&lt;/code&gt; (you have to merge the same type of atoms into one)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;CH2OH2&lt;/code&gt; (you have to maintain the numbers for explicit and implicit &lt;code&gt;C&lt;/code&gt; and &lt;code&gt;H&lt;/code&gt; atoms properly if you didn't merge them)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You can use the following rules to parse the input:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For every explicit atom present in the input there will be one atom in the output. E.g. &lt;code&gt;OOHOBrUub&lt;/code&gt; is &lt;code&gt;O₃H₁Br₁Uub₁&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Every bond token between two explicit atom tokens can be ignored. E.g. &lt;code&gt;O-O&lt;/code&gt;, &lt;code&gt;OO&lt;/code&gt; and &lt;code&gt;O=O&lt;/code&gt; all mean the same thing: &lt;code&gt;O₂&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Two bond tokens following each other, or a bond token at any end of the string means an implicit &lt;code&gt;C&lt;/code&gt; molecule and some amount of &lt;code&gt;H&lt;/code&gt; molecules. The amount of &lt;code&gt;H&lt;/code&gt; molecules will be 4 minus the amount of dashes in the bond tokens (1 for &lt;code&gt;-&lt;/code&gt;, 2 for &lt;code&gt;=&lt;/code&gt; and 3 for &lt;code&gt;≡&lt;/code&gt;). E.g. &lt;code&gt;O--O&lt;/code&gt; means &lt;code&gt;O₂CH₂&lt;/code&gt;, &lt;code&gt;O-=O&lt;/code&gt; means &lt;code&gt;O₂CH&lt;/code&gt; and &lt;code&gt;O==O&lt;/code&gt;/&lt;code&gt;O-≡O&lt;/code&gt; both mean &lt;code&gt;CO₂&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You can always assume that there will be no invalid inputs where the number of implicit hydrogen atoms would be negative (e.g. &lt;code&gt;≡=&lt;/code&gt;, &lt;code&gt;≡≡&lt;/code&gt;, or &lt;code&gt;=≡&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-: C₂H₆&#xA;≡: C₂H₂&#xA;--: C₃H₈&#xA;==: C₃H₄&#xA;O==O: CO₂&#xA;-OH: CH₃OH (or CH₄O)&#xA;--OH: C₂H₅OH (or C₂H₆O)&#xA;-=-: C₄H₈&#xA;≡-≡: C₄H₂&#xA;=O≡-≡O=: C₄O₂H₄&#xA;Br-O-C-=Uub: BrOCCUubH (or BrOC₂UubH)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is code golf, so shortest submission wins.&lt;/p&gt;&#xA;" OwnerUserId="8732" LastActivityDate="2017-03-28T12:23:16.453" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11890" PostTypeId="1" CreationDate="2017-03-28T15:44:27.327" Score="-5" ViewCount="82" Body="&lt;p&gt;I have a new idea for code-golf challenges, scored code golf would be used for multi part challenges that correspond and the score adds up. This would allow for linking different challenge types together.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I need help knowing if this is a good/bad idea and ideas for rules. The real problem is you want as few bytes as possible but you want as many &lt;em&gt;points&lt;/em&gt; as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I was thinking bonus points for winning different places and one point per answer you beat (you can only beat users other then you and can only beat each user once)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I need some help with this and any advice is needed. Mainly will this work? And if it does what should be the rules and scoring system?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This appears to be a code challenge and I have edited the tag wiki so we have one for code-challenge. I think it will work like that but perhaps this could be a scoring variant.&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="3808" LastEditDate="2017-03-28T16:05:02.877" LastActivityDate="2017-03-28T16:05:02.877" Title="New challange variant &quot;Scored Code Golf&quot;" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="2" ClosedDate="2017-03-28T16:28:53.223" ContentLicense="CC BY-SA 3.0" />
  <row Id="11892" PostTypeId="5" CreationDate="2017-03-28T15:57:30.777" Score="0" Body="&lt;p&gt;To be used on questions specifically about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; challenges and submissions, including asking about the scope of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, whether a specific task is on-topic and relevant to the tag, or anything else relating specifically to code challenges&lt;/p&gt;&#xA;" OwnerUserId="-1" LastEditorUserId="66833" LastEditDate="2021-04-11T18:22:29.573" LastActivityDate="2021-04-11T18:22:29.573" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="11893" PostTypeId="4" CreationDate="2017-03-28T15:57:30.777" Score="0" Body="For questions regarding code challenges and/or submissions. Note that [code-challenge] challenges should be posted to main or the Sandbox, not here" OwnerDisplayName="user63187" LastEditorUserId="66833" LastEditDate="2021-04-11T18:22:29.573" LastActivityDate="2021-04-11T18:22:29.573" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="11895" PostTypeId="2" ParentId="11890" CreationDate="2017-03-28T16:00:13.223" Score="3" Body="&lt;p&gt;This is not a good idea for a few reasons:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Challenges should be self-contained. Having scores in one challenge be influenced by scores in another challenge would make the challenge not self-contained.&lt;/li&gt;&#xA;&lt;li&gt;The top score on a challenge changes frequently. You'd either need to keep the points updated (which would be a logistical nightmare), or set a deadline on the challenges (which is also frowned upon).&lt;/li&gt;&#xA;&lt;li&gt;Your proposed scoring system disincentivizes users posting multiple answers, which is also not a good idea.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-03-28T16:00:13.223" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11896" PostTypeId="1" CreationDate="2017-03-28T16:50:02.937" Score="20" ViewCount="401" Body="&lt;p&gt;Most of us, I'm sure, come to this site either to solve delightfully tricky programming puzzles, or to see what insane golfs other members of our community have written. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, now we ackgnowledge the creative brilliance of those that come here to write those challenges that we've collectively sunk so many, many hours into. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I, Helka Homba, and some other members of the community are organizing a competition for writing creative challenges. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sign up and view the rules &lt;a href=&quot;https://hackmd.io/JwYwHA7ATALARiAtARjDGiYDMBsdFw4CmArIlhHnNACY0AMURQA=&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;, and discuss the competition &lt;a href=&quot;http://chat.stackexchange.com/rooms/56142/challenge-writing-contest&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="60042" LastActivityDate="2017-04-01T05:58:01.013" Title="Announcing the PPCG Challenge-Writing Competition!" Tags="|discussion|challenges|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11900" PostTypeId="1" CreationDate="2017-03-28T21:05:13.330" Score="0" ViewCount="28" Body="&lt;p&gt;I have an idea for a post you may read it and give your thoughts about actually posting it to the meta.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Here in this post put challenge ideas that you are not planning on using (or just don't want) and others in the community can comment and say they are going to use it.&lt;/p&gt;&#xA;&lt;h3&gt;Guidelines&lt;/h3&gt;&#xA;&lt;p&gt;Post your challenge idea and a few details and leave it. Community Wiki it so users can edit it and say they are going to use it in a post. People who take do not need to ask and do not post it here if you are not willing have the idea used without additional permission. If at one point you want your idea you can just remove your post.&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-28T21:05:13.330" Title="New post idea: Challenge idea shares" Tags="|discussion|" AnswerCount="0" CommentCount="3" ClosedDate="2017-03-28T21:28:23.627" ContentLicense="CC BY-SA 3.0" />
  <row Id="11901" PostTypeId="2" ParentId="11871" CreationDate="2017-03-28T21:53:05.810" Score="5" Body="&lt;h1&gt;We should have guidelines for what's acceptable when the input is of a fairly common type&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/62131&quot;&gt;well-regarded meta question&lt;/a&gt; for &lt;em&gt;methods&lt;/em&gt; of taking input and output. Many questions have inputs and outputs which are of simple, well-known types (e.g. integers, strings, 2D arrays, and the like). We don't, however, have a single meta question listing what's acceptable for those.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some of the existing questions on the subject (I've chosen my own titles for these links, to clarify what I think the question that the answers address is):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5343/62131&quot;&gt;Can integers be input/output in unary?&lt;/a&gt; (Current outcome: only when that's the most natural way to represent numbers in the language.)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9263/62131&quot;&gt;How should numbers be represented in text streams like stdin/stdout?&lt;/a&gt; (Current outcome: no firm consensus, and the post hasn't had much attention.)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/4708/62131&quot;&gt;Can you input or output a number as the byte with that number as codepoint?&lt;/a&gt; (Current outcome: yes, unless the challenge is about producing or parsing characters with a given character code.)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2214/62131&quot;&gt;What data structures can be used to input and output strings?&lt;/a&gt; (Current outcome: the same structures you could use for a list of characters.)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8395/62131&quot;&gt;Can you output in decimal, but using the null string for 0?&lt;/a&gt; (Current outcome: no.)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9064/62131&quot;&gt;Can numbers be output as truth values which are treated the same way as the number by the language?&lt;/a&gt; (Current outcome: there are multiple upvoted posts that disagree, but probably yes?)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;It took me a while of searching to find these questions, and I've likely missed many. It's also quite easy to observe contradictions here, e.g. the last two answers strike me as fairly inconsistent with each other (and outright contradict in the case of Perl, which uses the null string as the falsey output of most bultins that return Booleans).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Having an &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq&lt;/a&gt; question whose answers list acceptable input/output formats (with the acceptability determined via voting on the answers), and closing all the existing I/O-format questions as duplicates of it, strikes me as likely being the best solution here; there'd be a lower perceived barrier of entry to proposing formats there than there would be to ask an entire meta question, and having all the information in one place would be both easier to reference, and tend to reduce the chance of contradictions. The I/O-method question works very well (and out of all the posts on PPCG and PPCG Meta, it's likely the one that I link most often). Why not do the same thing for I/O formats?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a question wants something really weird as input (e.g. &quot;a symbolic equation&quot;), it would likely have to come up with its own rules, something which the other answers to this question deal with, but that's not a very common occurrence.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-03-28T21:53:05.810" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11904" PostTypeId="2" ParentId="2140" CreationDate="2017-03-29T03:17:20.793" Score="1" Body="&lt;h1&gt;Multiplivision&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Hopefully a nice simple challenge that's not trivial.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an input list of positive integers, alternately multiply and divide them to yield a single numerical answer, according to the following rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;start with the first number;&lt;/li&gt;&#xA;&lt;li&gt;with the remaining numbers, alternate between dividing and multiplying, one at a time (that is, in a left-associative way), with the last operation being multiplication&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For example, the input &lt;code&gt;{3, 4, 2, 7}&lt;/code&gt; would start with &lt;code&gt;3&lt;/code&gt;, then successively compute &lt;code&gt;3 * 4 = 12&lt;/code&gt;, then &lt;code&gt;12 / 2 = 6&lt;/code&gt;, then &lt;code&gt;6 * 7 = 42&lt;/code&gt; and output &lt;code&gt;42&lt;/code&gt;. (In other words, the input &lt;code&gt;{3, 4, 2, 7}&lt;/code&gt; yields the output &lt;code&gt;(((3 * 4) / 2) * 7) = 42&lt;/code&gt;.) The first operation had to be a multiplication, because if we'd started with a division, then the last operation would have been division as well, which isn't right.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the answer is not an integer, then it can be output either as an exact fraction, or as a decimal equivalent, accurate to at least 6 significant figures (either truncating or rounding the end of the decimal is fine). For decimals that terminate before 6 significant figures, either the terminating decimal alone (&lt;code&gt;1.5&lt;/code&gt;) or a version with trailing zeros (&lt;code&gt;1.50000&lt;/code&gt;) is fine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Other test cases (only the numerical answer needs to be output, not the intermediate parsed expression):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{3} -&amp;gt; 3&#xA;{3, 4} -&amp;gt; 3 * 4 = 12&#xA;{3, 4, 2} -&amp;gt; 3 / 4 * 2 = 3/2 or 1.5&#xA;{5, 4, 3, 2} -&amp;gt; 5 * 4 / 3 * 2 = 40/3 or 13.3333&#xA;{1, 2, 3, 4, 5, 6, 7, 8} -&amp;gt; 1 * 2 / 3 * 4 / 5 * 6 / 7 * 8 = 128/35 or 3.65714&#xA;{42, 42, 42, 42, 42, 42} -&amp;gt; 42 * 42 / 42 * 42 / 42 * 42 = 1764&#xA;{42, 42, 42, 42, 42, 42, 42} -&amp;gt; 42 / 42 * 42 / 42 * 42 / 42 * 42 = 42&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins! Golfed answers in all languages are welcome.&lt;/p&gt;&#xA;" OwnerUserId="56178" LastEditorUserId="56178" LastEditDate="2017-03-29T03:22:48.653" LastActivityDate="2017-03-29T03:22:48.653" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11906" PostTypeId="2" ParentId="2140" CreationDate="2017-03-29T07:14:02.140" Score="1" Body="&lt;h1&gt;Island Golf #3: Random Generation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;generation&amp;#39;&quot; rel=&quot;tag&quot;&gt;generation&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given the dimensions of a rectangular patch of ocean and the desired number of land tiles, randomly generate a valid island of that many tiles within that rectangle.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your input will be three positive integers:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;w&lt;/code&gt;, the width of the grid&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;h&lt;/code&gt;, the height of the grid&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;n&lt;/code&gt;, the number of tiles to make the island&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;w&lt;/code&gt; and &lt;code&gt;h&lt;/code&gt; will always be 3 or greater. &lt;code&gt;n&lt;/code&gt; will always be 1 or greater. Also, &lt;code&gt;n&lt;/code&gt; will be small enough to fit inside the grid allowing for a border of water tiles: specifically, &lt;code&gt;n &amp;lt;= (w-2)*(h-2)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your code must output a &lt;code&gt;w&lt;/code&gt; by &lt;code&gt;h&lt;/code&gt; rectangular grid consisting of two characters, representing land and water. (In the examples below, land is &lt;code&gt;#&lt;/code&gt; and water is &lt;code&gt;.&lt;/code&gt;, but you may substitute any two distinct characters you wish.) There must be exactly &lt;code&gt;n&lt;/code&gt; land characters, in one contiguous block, representing an island. For example, an input of &lt;code&gt;w=11, h=9, n=40&lt;/code&gt; might result in the following output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;...........&#xA;...##......&#xA;..#####....&#xA;..#######..&#xA;.#########.&#xA;...#######.&#xA;...#####.#.&#xA;....####...&#xA;...........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Requirements:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The land tiles must all be &lt;em&gt;contiguous&lt;/em&gt; (i.e. there's only one island).&lt;/li&gt;&#xA;&lt;li&gt;Land tiles can be connected &lt;em&gt;horizontally or vertically&lt;/em&gt;, but &lt;strong&gt;not&lt;/strong&gt; diagonally.&lt;/li&gt;&#xA;&lt;li&gt;The water tiles must also be contiguous (i.e. there must not be any lakes).&lt;/li&gt;&#xA;&lt;li&gt;The outer border of the grid must &lt;em&gt;remain as water tiles&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Some illegal outputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.....&#xA;.#.#.   Multiple islands&#xA;.....&#xA;&#xA;....&#xA;.#..    Diagonal connection&#xA;..#.&#xA;....&#xA;&#xA;......&#xA;.####.  Contains a lake&#xA;.#.##.&#xA;.##...&#xA;......&#xA;&#xA;....&#xA;.###    Border contains a land tile&#xA;.##.&#xA;....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Details&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your solution may be a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2422/16766&quot;&gt;full program or a function&lt;/a&gt;. Any of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/16766&quot;&gt;default input and output methods&lt;/a&gt; are acceptable. Any of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1325/16766&quot;&gt;these definitions&lt;/a&gt; of randomness are acceptable. Every valid island for a given input should occur with nonzero probability.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may take the input numbers in whatever format and base is convenient for your language. You may take the three numbers in any order.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your output may be a multiline string, a list of strings, or a 2D array/nested list of characters/single-character strings. Your output may (optionally) have a single trailing newline. As mentioned above, you may use any two distinct characters in place of &lt;code&gt;#.&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please mention any unusual I/O methods/formats in your submission, so others will be able to test your code more easily.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given as &lt;code&gt;width, height, size&lt;/code&gt;. Note that the first three test cases specify islands of maximal size for the given width and height.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3, 3, 1&#xA;9, 3, 7&#xA;5, 5, 9&#xA;5, 5, 1&#xA;10, 10, 60&#xA;80, 22, 1100&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Validation program&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Here is a &lt;a href=&quot;https://tio.run/nexus/pip#ZVRhb9s2EP2uX/GiDJi9SoL9YRjgYKtbbMFcdGk6LAiGYV1piZKIUKRBUlC8rfvr2R0lO3arDxJPunf37t6dnq5wr0KL3KHWosnQoJHBQ0ArH2BrehrpUTvbwYdKmeQKd0bVewwZ2gwGA@NDK1ErRxD2z@B3WhHcIM2QJncYWoN7NOvFhwcK8Bt5O9kJZZRppgyUqoFwMobqxC7psCLAD8uEAK@m94OqKJkwFVqpmjagtM7JMrxMNmhx8T1@v@wSaNy@Rvrz6OFb2@sKW4m0aAui09hAxz0hLvAVI745Qt4SkzGHj1SUKa3x1AhpwopAv94ybBgTrY@w@8jqNNFwmuhIn@7C7KG0lo3QKFvhRBmk80z/4x8fiss/P@IGb46BN194jixw9x6zN90BM6cUGx8bpLzm7vBxag28@ltyAhNpI71Mz3Lc9N1WOm7/Aas0yXFajTmvZkpl@@BVJbG1rqIA1CLlpN7DllIYTjhm6tYL/Hs858ujMftrvfilm5/a@ZJeHIi9HuOSAoEGxeNIbubnKQ/Fj7JmvQRNrrUVjZ/WqHtTBmV5SmsE8cCja3tHajbUu2MfESy8FK5s6bPDTMyz849O7rQoqZ9hnO/ZljycHTAr6cBMSqv7zmBWzZN69U@CDVVXriu8J0JkTtYKWzrPanq5RfliCXJ/tvPPbFQvlud2Hu0r3Fjqc28qTzRl@cBrozyMlJWsVoeVweDEjsSxzqpKaL3PsO3DQSwqbJLqWVtywiDoE22s5WIrK735OlC0QG8TfEo@cauvnzsc15AhCbFMixTpfykWWMxZ8eJ8tu7ZLxKl4al7YsRyGkNjKauo4bWiVopR29ISPWUIk1yrrOWWHsZGxZbGHwev5TQMyhAbMkiXPPdUNuvlT@J4dnmMcu0Jv18puj@SKBxx/ZLDc4lf1MfRY3mUPl2n2ONxfhzo5/LeRhKfV3cobgOdEOVNPa3@wDfpHM1bJ70XjfQZdk6ZqBAFvVYUViU/MeodYwbl5SrBbfqKeUlPte2E9xexc@/6sJvEZel31oc8LkLOZUQ9B/oJCAMpvCJuXo6/Hx23gljIx@DEtPU@6Z6evsvwbYblIinGKyku@YrPIj7puiyKw/en3On/AQ&quot; rel=&quot;nofollow noreferrer&quot;&gt;validation program&lt;/a&gt; in Pip to test whether your output for a given input meets the spec. It expects the three parameters and an island in the format given in this question; for example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;5, 5, 9&#xA;.....&#xA;.###.&#xA;.###.&#xA;.###.&#xA;.....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If your code has a different output format, you'll need to convert it to this format before plugging it into the validation program.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Sandbox questions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This seems like a pretty obvious random-generation challenge, but I didn't find a duplicate in a quick readthrough of previous &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; challenges. Did I miss anything?&lt;/li&gt;&#xA;&lt;li&gt;Should I add more stringent rules on what counts as random? &lt;a href=&quot;https://codegolf.stackexchange.com/q/103239/16766&quot;&gt;Related reading&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Should I allow output to be a 2D array (or nested list) of &lt;em&gt;any&lt;/em&gt; two distinct values, not just chars and single-char strings? (E.g. integers &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt;, booleans &lt;code&gt;false&lt;/code&gt; and &lt;code&gt;true&lt;/code&gt;, etc.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:23.487" LastActivityDate="2017-03-31T17:31:48.520" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11908" PostTypeId="2" ParentId="2447" CreationDate="2017-03-29T17:25:35.300" Score="35" Body="&lt;h1&gt;Functions may return a boolean value via the presence or absence of an error/exception&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;That is, crashing to return &lt;code&gt;false&lt;/code&gt;, and not crashing to return &lt;code&gt;true&lt;/code&gt;. This is the function equivalent of outputting via exit code, which is allowed for full programs (nearly all interpreters will return an exit code of 0 by default if the program doesn't crash, and nonzero if it does).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I realised this wasn't on the list while writing a post about how our I/O defaults applied to Brachylog; this method of outputting booleans is idiomatic in most declarative languages (i.e. it's something I'd be likely to write even if I &lt;em&gt;weren't&lt;/em&gt; golfing), and it's still meaningful in other paradigms (much rarer, but it's nonetheless considered an acceptable programming technique in industry in languages like OCaml).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not completely convinced either way about whether this should be accepted, although I'm currently mildly in favour (the main point in favour is that it's often the most natural way to do output even if you aren't golfing, and many languages have a &lt;code&gt;try&lt;/code&gt;/&lt;code&gt;catch&lt;/code&gt; or equivalent to convert it into a regular Boolean; the main point against is that it feels a bit cheap/abusable). However, we could definitely do with a ruling as to whether this is acceptable or not, as there are many cases in which it's going to be the shortest way to write the code, and thus it matters for how &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; answers are written.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-03-29T17:25:35.300" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11909" PostTypeId="2" ParentId="10276" CreationDate="2017-03-29T17:36:55.153" Score="5" Body="&lt;h1&gt;If you can pass values for the arguments via acceptable I/O methods, it's acceptable.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;On PPCG, we allow a &quot;program&quot; to be a &quot;full program&quot; or a &quot;function&quot;. Let's consider these two cases separately:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Full program&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A full program on PPCG is fairly objectively definable; we take the language implementation (in this case, the Brachylog interpreter), give it the program as an argument (typically via a file), and run it to see what happens. The program can take and produce output via any of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/62131&quot;&gt;acceptable I/O methods&lt;/a&gt;. Nothing here is specific to Brachylog.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Out of the legal means of I/O for full programs, the following make sense in the context of Brachylog:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We can &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2448/62131&quot;&gt;take input via standard input&lt;/a&gt;. If input is provided on standard input, the Brachylog interpreter interprets that as setting the Input argument to the program. So far, so good; I doubt there's any controversy that setting the Input to the program is allowed, and this is the way we do it. (Note: In a full program, giving it Input is only acceptable &lt;em&gt;because&lt;/em&gt; the interpreter will set the Input as a consequence of text on standard input; having something &lt;em&gt;named&lt;/em&gt; Input in a language wouldn't be sufficient in a full program to allow the user to provide input, unless the interpreter gave some mechanism of doing so.)&lt;/li&gt;&#xA;&lt;li&gt;We can &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2449/62131&quot;&gt;take input via a command line argument&lt;/a&gt;. If input is provided via the first command line argument, the Brachylog interpreter interprets that as setting the Output argument to the program. The fact that it's named Output has nothing to do with the actual mechanism, though; what matters is that we're providing input to the program in a legal way, and what the interpreter does with it is its problem.&lt;/li&gt;&#xA;&lt;li&gt;We can &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5415/62131&quot;&gt;combine the above two rules&lt;/a&gt; to provide two parameters to the program, the Input on standard input and the Output via an argument. (As it happens, I personally disagree with this rule, but it's our current consensus and I'm quite comprehensively outvoted on it. So this post is describing what the rules currently are.)&lt;/li&gt;&#xA;&lt;li&gt;We can &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2450/62131&quot;&gt;take output via standard output&lt;/a&gt;. By default, the Brachylog interpreter writes &lt;code&gt;true.&lt;/code&gt; or &lt;code&gt;false.&lt;/code&gt; here. If the program contains a &lt;code&gt;w&lt;/code&gt; command (or one of its variants), it instead allows the &lt;code&gt;w&lt;/code&gt; command to provide standard output.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Note what we can't do: we &lt;em&gt;can't&lt;/em&gt; take output via the Output, or via the Input. The mechanism via which you do this in Brachylog is to provide a variable name in one of these places (&lt;code&gt;Z&lt;/code&gt; is common), and then the interpreter will output text like &lt;code&gt;Z = 4&lt;/code&gt;. This means that a Brachylog full program can &lt;em&gt;only&lt;/em&gt; provide output via two mechanisms: the &lt;code&gt;w&lt;/code&gt; command family; and implicit printing of &lt;code&gt;true.&lt;/code&gt; or &lt;code&gt;false.&lt;/code&gt;. This means that in a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;, a full program is likely going to be the best idea. In other cases, using a full program is inadvisable because it can require quite a bit of boilerplate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/nexus/brachylog2#@19X/aiju/xR19La////RxvqGOkYxwIA&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here's&lt;/a&gt; an example of a full program that takes input via its Output, and produces output on standard output using the &lt;code&gt;w&lt;/code&gt; command. As can be seen, it's much more verbose than just writing it &quot;normally&quot; would be, as a consequence of Brachylog's evaluation order (&lt;code&gt;w&lt;/code&gt; takes input only from the left, whereas an Output argument provides input from the right, so you need contortions to get the program back into sequence). As such, although this example is legal, it probably isn't very useful for golfing.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Function&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A function on PPCG is less objectively definable. However, a Brachylog predicate is a clear equivalent of a function in most languages; it has arguments, it's reusable, it can be called multiple times.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Out of the legal means of I/O for functions, the following make sense in the context of Brachylog:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We can &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2454/62131&quot;&gt;take input via function arguments&lt;/a&gt;. All Brachylog functions have exactly two arguments (named &lt;code&gt;?&lt;/code&gt; and &lt;code&gt;.&lt;/code&gt;, or Input and Output). The two are treated asymmetrically (because the Input argument naturally occurs early in the evaluation order in Brachylog's syntax, and the Output argument naturally occurs late), but this doesn't change the fact that they're both arguments, and they're both capable of providing input to the function in the normal way. If I have a function &lt;code&gt;↰₀&lt;/code&gt;, I can provide it the integers 1 and 2 as arguments by writing &lt;code&gt;1↰₀2&lt;/code&gt;. So both arguments are usable for input, in the normal way that function arguments are, and their values can be used within the function's definition by writing &lt;code&gt;?&lt;/code&gt; and &lt;code&gt;.&lt;/code&gt;, just like function arguments in more normal languages. I don't think any of Brachylog's quirks change our standard consensus for how function arguments work.&lt;/li&gt;&#xA;&lt;li&gt;We can &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2450/62131&quot;&gt;take output via standard output&lt;/a&gt;, because &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2457/62131&quot;&gt;legal output methods for full programs are also legal for functions&lt;/a&gt;. This means that &lt;code&gt;w&lt;/code&gt; is an acceptable form of output from Brachylog predicates (which is definitely handy if we're already using both the arguments we have as inputs!)&lt;/li&gt;&#xA;&lt;li&gt;We can &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4942/62131&quot;&gt;produce output via assigning/mutating the function arguments&lt;/a&gt;, in languages where the function's caller will be able to see the assigned values. Unifying the arguments with a value is similar enough to assigning to them (both operations set the value, and the only relevant difference with unification is that you can't subsequently overwrite the value, which doesn't matter here). This allows for idiomatic output via the Output argument &lt;code&gt;.&lt;/code&gt;, which is very common in Brachylog (mostly because the syntax does this by default). I can't see any reason, other than convention (and when did code-golf submissions ever feel bound by &lt;em&gt;convention&lt;/em&gt;?), that it shouldn't be used to output via the Input either; given that it's acceptable to output via the inputs on PPCG in languages like C (where functions have an actual, defined, return value that can't be made to take input), it should also be acceptable to output via the Input on PPCG in languages like Brachylog (where there's no concept of a return value, but one of the arguments is normally used as a return value by convention).&lt;/li&gt;&#xA;&lt;li&gt;We might or might not be able to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11908/62131&quot;&gt;produce output via whether the predicate fails or succeeds&lt;/a&gt;. At the time of writing, I'd only just added this to the I/O defaults post (as I realised it was missing as a consequence of writing this post, and it's a fairly natural way to output a boolean in declarative languages); as such, there isn't a consensus on whether this is legal or not. However, whatever consensus is found in the I/O defaults post, it should apply to Brachylog too; a failure in a declarative language is very similar to an exception in a language like OCaml (I picked OCaml because using exceptions for flow control is considered acceptable by its community, as opposed to languages like Java where doing so is typically avoided).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Conclusion&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In short, my opinion is this: we have general-purpose rules for what forms of I/O are legal, and they apply pretty much directly to Brachylog, so we don't need a special-cases rule. They're fairly permissive, but that makes sense, because they're fairly permissive in other languages too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Brachylog may have conventions to use function arguments and program input and arguments in a certain way, but in general, we tend to ignore those sorts of conventions on PPCG, and they shouldn't override our general rule. It isn't conventional to output from a function via using &lt;code&gt;print&lt;/code&gt; in Python, but it's very common on PPCG as it's a byte shorter than &lt;code&gt;return&lt;/code&gt;. So given that we have an established consensus on how I/O works in general, why not use it here too?&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-03-29T17:36:55.153" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11913" PostTypeId="1" CreationDate="2017-03-29T19:40:00.373" Score="58" ViewCount="1021" Body="&lt;p&gt;I believe it's a widely acknowledged problem in this community that the number of meta posts a new user needs to know to figure out all the rules has long got out of hand. We require certain answer formats, allow a large (but not arbitrary) set of I/O methods, have certain standard loopholes, special rules for counting interpreter flags, and then a bunch of exceptions to all of these. Sure you can probably get started without knowing most of these, but you'll miss out on golfing opportunities or violate some rules here and there, and it probably takes a while of being an active user until you've got an overview over all the relevant meta posts that we've accumulated over the years.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even the well-known list of admissible I/O methods is somewhat losing its value in my opinion, because it might take a while for people to see new suggestions and there's just &lt;em&gt;so much&lt;/em&gt; to take in. The equally well-known post saying that all answers must be full programs or function is even misleading because there's a later consensus that allows REPL answers if they're designated as separate languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anyway, I believe this is a problem which presents a huge learning curve to new users, and I have a proposal for finally dealing with it:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Let's freeze all old, clear consensuses and consolidate them into one big FAQ post for answering rules.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is how I imagine that will work:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We make a list of important meta posts whose answers are usually used as references for one site rule/policy or another.&lt;/li&gt;&#xA;&lt;li&gt;We record the current consensus on each of these posts and write up one big post that summarises all of them in a structured manner. This becomes a new &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq&lt;/a&gt; meta post. It can link to the relevant meta posts for reference (and for people who want some further reading on how that rule came to be).&lt;/li&gt;&#xA;&lt;li&gt;We close all the old posts as dupes of the FAQ post and optionally lock them to physically freeze the votes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;This doesn't have to mean that our policies will be set in stone forever!&lt;/strong&gt; If people want to propose new policies or changes to old policies, they can simply make a new meta post so we can have a fresh discussion &lt;em&gt;about that specific change&lt;/em&gt; instead of people posting answers to old questions that will never gather enough votes to catch up with the old answers. Moving away from the polling culture that shaped many of our older policies would actually enable us to have more constructive discussions about the policies and it will more easily reflect the community's &lt;em&gt;current&lt;/em&gt; opinion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The clear benefit is that we'll have a single destination for people to review the rules, which we can point new users to and which can be mentioned in the Help Centre. I hope that in process of compiling the rules we'll also uncover any contradictions in existing policies and might be able to streamline some of them. Moving forward we should be able to make better decisions about policy changes because it will be easier to get the big picture.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have started to compile a list of relevant meta posts, but it's doubtless incomplete. If anyone wants to have a look I've put it up &lt;a href=&quot;https://pastebin.com/iZFKuB1b&quot; rel=&quot;nofollow noreferrer&quot;&gt;in a pastebin for now&lt;/a&gt;. We can discuss the actual list once we've decided that we really want to do this. In the meantime, feel free to ping me &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;in chat&lt;/a&gt; with any important posts missing from the list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For now, I'd like to use this meta post to get some feedback for the proposal. Is this a good idea? Am I overlooking an issue with this that makes it a bad idea? Does it need any modification, can it be improved?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;PS:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9022/8478&quot;&gt;This problem isn't limited to rules for &lt;em&gt;answering&lt;/em&gt;.&lt;/a&gt; But I'd like to focus on one thing at a time, and for the majority of users the answering rules are more important (and I think there are also more of them). If this works out well, we can tackle a separate FAQ post for writing challenges.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2018-11-25T16:06:40.837" Title="A proposal to combat Meta Bloat™: The Big Consensus Freeze" Tags="|discussion|policy|rules|new-users|site-health|" AnswerCount="7" CommentCount="17" ContentLicense="CC BY-SA 3.0" />
  <row Id="11915" PostTypeId="2" ParentId="11913" CreationDate="2017-03-29T20:31:50.237" Score="2" Body="&lt;p&gt;I'm in favour of tidying everything. I know I'm too lazy to keep up to date with the FAQs that don't apply to C# in particular (means I'm possibly uninformed about the validity of answers in other languages), and they are something of an invisible hurdle for new users.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would like for us to discuss, and clearly define how we will deal with:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Enforcing any consensus (generally I think we do a good job of this already, but some written policy would be nice, otherwise new users and people like me who disappear for months at a time aren't sure how they should tackle these things: do we downvote invalid answers? if so, not from new users?)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Changing consensuses, and old/new answers which violate them (should we define the validity of answers according to when the question was posted? if so, we'd need a transparent history... etc.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;(Multi-)language specific concerns: the tendency in the past is to provide general guidelines, but this &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11223/untyped-functions-in-static-langauges&quot;&gt;(slim) concensus&lt;/a&gt; (which has no saturation in the wild; people &lt;em&gt;actively&lt;/em&gt; promote the opposite and I can't blame them) suggests we may need more granularity for some issues, or accept that keeping things simple trumps niche (if real) concerns, and this should be very apparent (i.e. &lt;em&gt;do&lt;/em&gt; provide language specific commentary, if not ruling, for 'areas of contention')&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;It would be nice to see some sort of provisional timetable for when and how all this might happen. I can imagine it will take a while, and there will no doubt be heightened confusion during the transition period if there is one.&lt;/p&gt;&#xA;" OwnerUserId="26981" LastActivityDate="2017-03-29T20:31:50.237" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11916" PostTypeId="2" ParentId="11913" CreationDate="2017-03-29T21:57:51.670" Score="32" Body="&lt;p&gt;I propose that each commonly-used language have a separate explanation of the rules that most pertain to it, with code examples. I think this is more digestible that a big general FAQ, especially to new users.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11924/20260&quot;&gt;(Meta post to try to make this happen.)&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Different languages consider different rules important. For example, allowing curried functions is central to Haskell, but almost never comes up in, say, Python. If the FAQ misses this rule, that's a big omission for a Haskell golfer reading it. If it includes rules like this, it becomes bloated, and a golfer must search through lots of rules irrelevant to them. A language-specific explanation avoids this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would also find it friendlier if the rules were explained for the language rather than just listed. Code snippets showing allowed and disallowed methods make the rules obvious, saving users the need to interpret statements written to be language-agnostic. The rule &quot;Programs may output to STDOUT&quot; would have meant nothing to me as a brand-new Python golfer, but &quot;you may &lt;code&gt;print&lt;/code&gt; the output&quot; would be perfectly clear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When writing my first golf in PPCG, I first looked for a bunch of Python answers to see their general I/O structure, and based mine off of those. I would have been much happier to have the main I/O structures listed in one place: &lt;code&gt;def/return&lt;/code&gt;, &lt;code&gt;lambda&lt;/code&gt;, &lt;code&gt;input/print&lt;/code&gt;. A list of rules would be far beyond me -- I just wanted something I could use to write a submission. A quick-start guide for beginners would have been ideal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I recognize that writing a guide for many languages is a lot of work, but I think it's the best way to help and retain new users. I'll write an example guide for Python that I hope will get across the type of thing I'm imagining.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2017-03-30T03:46:02.600" LastActivityDate="2017-03-30T03:46:02.600" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="11918" PostTypeId="2" ParentId="11913" CreationDate="2017-03-29T22:02:07.633" Score="0" Body="&lt;p&gt;A couple of questions:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What is the scope of this meta post? It obviously includes rules on what makes a valid answer, but does it include:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Rules about how to write/maintain answers?  Would it include rules about making answers community wiki or multi-language answers?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Failed&lt;/em&gt; rules?  If somebody had an idea, proposed it, and it got downvoted, do we include it?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Guidelines on what makes a good submission?  For example, should it include that you probably also give the un-golfed submission and explain what it is doing?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I'd vote Y/N/Y (respectively), but I'd like to hear what other people think.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastActivityDate="2017-03-29T22:02:07.633" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11920" PostTypeId="2" ParentId="11913" CreationDate="2017-03-29T23:04:54.187" Score="0" Body="&lt;p&gt;I'd like to see this happen. I'd suggest a fairly narrow scope, though: specifically, let's have one FAQ post that lists all the rules that state whether or not an answer is legal. (If we want to write posts about other things, such as editing or the like, we can put those in separate posts; legality of answers is a large enough subject as it is.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In terms of changing consensus, I think that we should freeze current consensus in the FAQ post, and allow &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/feature-request&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt; posts to be made to suggest changes. If a feature quest gets popular enough, a moderator would edit it into the FAQ post of rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that to work, this is going to have to list &lt;em&gt;all&lt;/em&gt; the rules, which means doing things like retiring the standard loopholes post in favour of this one. (Note that many of the loopholes nowadays don't really need to exist as their own rule, as they're already covered by other rules; for example, &quot;inventing a language to solve a problem&quot; is covered by the rule that &quot;answers are noncompeting unless the language is older than the question&quot;.)&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-03-29T23:04:54.187" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11921" PostTypeId="2" ParentId="5399" CreationDate="2017-03-29T23:25:04.140" Score="4" Body="&lt;p&gt;I think focusing on one language to check for validity is fine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, mass-downvoting incorrect answers isn't all that helpful. If the author fixes the answer, there's no point in the downvote. If the author doesn't fix it, it should be deleted rather than downvoted (although downvoting an answer is sometimes necessary to allow it to be deleted). My recommendation would be to point out the mistake in the comments, and if the answer is not fixed within a reasonable length of time, aim to delete it (via modhammer, mod flag, VLQ flag, or delete votes, whichever method seems the most likely to produce useful results).&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-03-29T23:25:04.140" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11922" PostTypeId="2" ParentId="11913" CreationDate="2017-03-30T00:05:35.350" Score="5" Body="&lt;h1&gt;Include a list of definitions&lt;/h1&gt;&#xA;&lt;p&gt;I've been feeling like a standardized set of definitions would be greatly helpful.&lt;/p&gt;&#xA;&lt;p&gt;This would be helpful to new users, as we've got a lot of terms we like to use, such as &amp;quot;objective&amp;quot; or &amp;quot;competitive&amp;quot;, and even some basic stuff like &amp;quot;input/output&amp;quot; or &amp;quot;programming language&amp;quot; that have PPCG-specific meaning.&lt;/p&gt;&#xA;&lt;p&gt;It'd also be good for old users, as many terms get thrown around interchangeably.  I'd love it if we could standardize terms so that, for example, &amp;quot;Submission&amp;quot; means the actual code and &amp;quot;Answer&amp;quot; refers to the entire post.&lt;/p&gt;&#xA;&lt;p&gt;Obviously, the controversial terms (such as programming language) would need to be linked to the appropriate post, and could be changed if the meta consensus changed.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-30T00:05:35.350" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11923" PostTypeId="2" ParentId="11913" CreationDate="2017-03-30T01:06:16.260" Score="2" Body="&lt;h1&gt;Please ensure that this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/featured&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;featured&amp;#39;&quot; rel=&quot;tag&quot;&gt;featured&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;I feel, like this will ensure maximum visibility, especially to new users, this will allow it to sit right under the sandbox in the &amp;quot;featured on meta&amp;quot; area.&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-30T01:06:16.260" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11924" PostTypeId="1" CreationDate="2017-03-30T02:49:41.760" Score="37" ViewCount="3513" Body="&lt;p&gt;What are the most important rules a first-time golfer in a given language should know? For instance, how do golfed programs usually take input and output?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each language should have a single CW answer as the go-to explanation of the site rules for golfing in that language.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use code snippet examples. Show, don't tell.&lt;/li&gt;&#xA;&lt;li&gt;Be brief over being comprehensive.&lt;/li&gt;&#xA;&lt;li&gt;Be accessible over being technically accurate.&lt;/li&gt;&#xA;&lt;li&gt;Explain terms. Not everyone has heard of &quot;STDIN&quot; or &quot;anonymous functions&quot;.&lt;/li&gt;&#xA;&lt;li&gt;Don't include things applicable in any language like, &quot;include a header with a byte count&quot;&lt;/li&gt;&#xA;&lt;li&gt;Don't include tricks for reducing byte count. That's for tips pages.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Alphabetical list of languages&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The following Stack Snippet gives an alphabetized list of the languages that currently have guides.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;function answersUrl(a){return&quot;https://api.stackexchange.com/2.2/questions/&quot;+QUESTION_ID+&quot;/answers?page=&quot;+a+&quot;&amp;amp;pagesize=100&amp;amp;order=desc&amp;amp;sort=creation&amp;amp;site=codegolf.meta&amp;amp;filter=&quot;+ANSWER_FILTER}function commentUrl(a,b){return&quot;https://api.stackexchange.com/2.2/answers/&quot;+b.join(&quot;;&quot;)+&quot;/comments?page=&quot;+a+&quot;&amp;amp;pagesize=100&amp;amp;order=desc&amp;amp;sort=creation&amp;amp;site=codegolf.meta&amp;amp;filter=&quot;+COMMENT_FILTER}function getAnswers(){jQuery.ajax({url:answersUrl(answer_page++),method:&quot;get&quot;,dataType:&quot;jsonp&quot;,crossDomain:!0,success:function(a){answers.push.apply(answers,a.items),answers_hash=[],answer_ids=[],a.items.forEach(function(a){a.comments=[];var b=+a.share_link.match(/\d+/);answer_ids.push(b),answers_hash[b]=a}),a.has_more||(more_answers=!1),comment_page=1,getComments()}})}function getComments(){jQuery.ajax({url:commentUrl(comment_page++,answer_ids),method:&quot;get&quot;,dataType:&quot;jsonp&quot;,crossDomain:!0,success:function(a){a.items.forEach(function(a){a.owner.user_id===OVERRIDE_USER&amp;amp;&amp;amp;answers_hash[a.post_id].comments.push(a)}),a.has_more?getComments():more_answers?getAnswers():process()}})}function process(){var a=[];answers.forEach(function(b){var c=b.body;b.comments.forEach(function(a){OVERRIDE_REG.test(a.body)&amp;amp;&amp;amp;(c=&quot;&amp;lt;h1&amp;gt;&quot;+a.body.replace(OVERRIDE_REG,&quot;&quot;)+&quot;&amp;lt;/h1&amp;gt;&quot;)});var d=c.match(HEADER_REG);if(d){var e=d[1];a.push({lang:e,name:/&amp;lt;a/.test(e)?jQuery(e).text():e,link:b.share_link})}}),a.sort(function(a,b){return a.name&amp;gt;b.name?1:a.name&amp;lt;b.name?-1:0});for(var b=0;b&amp;lt;a.length;++b){var c=jQuery(&quot;#language-template&quot;).html(),d=a[b];c=c.replace(&quot;{{LANGUAGE}}&quot;,d.lang).replace(&quot;{{LINK}}&quot;,d.link),c=jQuery(c),jQuery(&quot;#languages&quot;).append(c)}}var QUESTION_ID=11924,ANSWER_FILTER=&quot;!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe&quot;,COMMENT_FILTER=&quot;!)Q2B_A2kjfAiU78X(md6BoYk&quot;,OVERRIDE_USER=20260,answers=[],answers_hash,answer_ids,answer_page=1,more_answers=!0,comment_page;getAnswers();var HEADER_REG=/&amp;lt;h\d&amp;gt;\s*([^\n]+[^\s])(?=\s*&amp;lt;\/h\d&amp;gt;)/,OVERRIDE_REG=/^Override\s*header:\s*/i;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-css lang-css prettyprint-override&quot;&gt;&lt;code&gt;body{text-align:left!important}#language-list{padding:10px;width:290px;float:left}table thead{font-weight:700}table td{padding:5px}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js&amp;gt;&amp;lt;/script&amp;gt;&amp;lt;link href=&quot;//cdn.sstatic.net/codegolf/all.css?v=83c949450c8b&quot;rel=stylesheet&amp;gt;&amp;lt;div id=language-list&amp;gt;&amp;lt;h2&amp;gt;List of languages&amp;lt;/h2&amp;gt;&amp;lt;table class=language-list&amp;gt;&amp;lt;tbody id=languages&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;table style=display:none&amp;gt;&amp;lt;tbody id=language-template&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;{{LANGUAGE}}&amp;lt;td&amp;gt;&amp;lt;a href={{LINK}}&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/table&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="68942" LastEditDate="2021-04-04T03:46:08.177" LastActivityDate="2021-11-13T15:30:50.017" Title="New users' guides to golfing rules in specific languages" Tags="|discussion|faq|rules|new-users|" AnswerCount="15" CommentCount="10" CommunityOwnedDate="2017-03-30T08:01:23.870" ContentLicense="CC BY-SA 3.0" />
  <row Id="11925" PostTypeId="2" ParentId="11924" CreationDate="2017-03-30T02:50:15.173" Score="13" Body="&lt;h1&gt;&lt;a href=&quot;https://www.python.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Python&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;General I/O&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your submission should be a program or a function. It should print the output or return it. These example submissions compute the &lt;a href=&quot;https://en.wikipedia.org/wiki/Factorial&quot; rel=&quot;nofollow noreferrer&quot;&gt;factorial&lt;/a&gt; in Python 2:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;# Program that prints&#xA;n=input();p=1&#xA;for i in range(1,n+1):p*=i&#xA;print p&#xA;&#xA;# Defined function that outputs or prints&#xA;def f(n):&#xA; p=1&#xA; for i in range(1,n+1):p*=i&#xA; print p&#xA;&#xA;# Lambda function, no name needed&#xA;lambda n:reduce(int.__mul__,range(1,n+1))&#xA;&#xA;# Lambda function, named to use recursive call&#xA;f=lambda n:1 if n==0 else n*f(n-1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You may not expect input pre-written to a variable.&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;# Invalid, expects input in n&#xA;p=1&#xA;for i in range(1,n+1):p*=i&#xA;print p&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Nor may you output just by saving the result to a variable.&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;# Invalid, doesn't output result&#xA;n=input();p=1&#xA;for i in range(1,n+1):p*=i&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Nor can the output just be the value of an expression like in the interactive shell.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Inputs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;We're liberal about input formats. For example, if a challenge says to take a list of numbers, you may expect a Python list like &lt;code&gt;[1,2,3]&lt;/code&gt;, not like &lt;code&gt;&amp;quot;1 2 3&amp;quot;&lt;/code&gt;. So, a Python 2 program can do&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;l=input()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;rather than&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;l=map(int,raw_input().split())&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Likewise, when a program takes string input, you may expect it in quotes to use &lt;code&gt;input()&lt;/code&gt; in Python 2 rather than &lt;code&gt;raw_input()&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Version&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Either Python 2 or Python 3 is fine. If the code requires a specific version, include the version number in the header.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Libraries&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;You may import libraries. The &lt;code&gt;import&lt;/code&gt; statement counts as part of the code length. If it's a non-default library, say &lt;code&gt;scipy&lt;/code&gt;, call the language &amp;quot;Python with scipy&amp;quot; in the header.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Truthy/Falsey&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Some challenges ask for a output to be truthy or falsey, which is determined by the value of &lt;code&gt;bool(x)&lt;/code&gt;. In Python, only &lt;code&gt;False&lt;/code&gt;, &lt;code&gt;0&lt;/code&gt;, &lt;code&gt;None&lt;/code&gt;, and empty collections are falsey, and the rest are truthy.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;More on functions&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A function submission can include helper code outside the function, for example&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;import re;r=range&#xA;lambda l: ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Functions may use extra optional arguments. For example, this factorial function submission expects a single number, but uses the optional input &lt;code&gt;i&lt;/code&gt; to help recurse:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;f=lambda n,i=1:1 if i&amp;gt;n else i*f(n,i+1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You may not, however, require the function to be called with a specific extra argument, like &amp;quot;call this with 2nd argument 1&amp;quot; for&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;f=lambda n,i:1 if i&amp;gt;n else i*f(n,i+1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2021-03-26T04:22:38.580" LastActivityDate="2021-03-26T04:22:38.580" CommentCount="3" CommunityOwnedDate="2017-03-30T02:50:15.173" ContentLicense="CC BY-SA 4.0" />
  <row Id="11927" PostTypeId="2" ParentId="11924" CreationDate="2017-03-30T04:26:40.223" Score="4" Body="&lt;h2&gt;C#&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Basic Input/Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Submission are either named functions, complete programs, or anonymous functions. Functions take input as parameters and generally return the result (sometimes &lt;code&gt;ref&lt;/code&gt; or &lt;code&gt;out&lt;/code&gt; parameters may be applicable). Programs take input either from 'argv' (command line arguments) or from 'STDIO' (Standard Input/Output).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These example solutions compute the factorial of an integer input. You can generally accept either the string representation of the integer (typical for a complete program) or an integer argument to a function or lambda expression.&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;// 'complete program' reading input from STDIN, writing output to STDOUT&#xA;static void Main()&#xA;{&#xA;    int n=int.Parse(System.Console.ReadLine()), // read an integer&#xA;        a=1; // accumulator&#xA;&#xA;    for(;n&amp;gt;0;)&#xA;        a*=n--;&#xA;&#xA;    System.Console.WriteLine(a);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;// 'complete program' reading input from command line arguments ('argv') and returning via exit code&#xA;static int Main(string[]args)&#xA;{&#xA;    int n=int.Parse(args[0]), // read an integer&#xA;        a=1; // accumulator&#xA;&#xA;    for(;n&amp;gt;0;)&#xA;        a*=n--;&#xA;    return a;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;// recursive named function&#xA;int F(int n)&#xA;{&#xA;    return n&amp;gt;1?F(n)*n:1;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;// recursive named function (C# 6 'expression bodied' syntax)&#xA;int F(int n)=&amp;gt;n&amp;gt;1?F(n)*n:1;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;// iterative anonymous typed lambda expression&#xA;(int n)=&amp;gt;&#xA;{&#xA;    int a=1;&#xA;&#xA;    for(;n&amp;gt;0;n--)&#xA;        a*=n;&#xA;&#xA;    return a;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;// recursive named lambda expression (these are of no use in C# golfing)&#xA;System.Func&amp;lt;int,int&amp;gt;F=null;&#xA;F=n=&amp;gt;n&amp;gt;1?F(n)*n:1;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You may not have anonymous, untyped lambdas as you may see in other languages (e.g. &lt;code&gt;x=&amp;gt;x*x&lt;/code&gt; would have to be &lt;code&gt;(int x)=&amp;gt;x*x&lt;/code&gt;), as the type information can change the behaviour of the code, and as such is required to be unambiguous.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Version&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;C# has had about 2 breaking changes in its lifetime, and none of them have much bearing on golfing, so just use the latest: there are &lt;em&gt;lots&lt;/em&gt; of potentially useful things in C# 6 and C# 7 to explore. Note that C# 7 tuples can't really be used at the moment because they require external libraries.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Libraries&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Generally, everything you could possibly want to use is in &lt;code&gt;mscorlib&lt;/code&gt;, the library that is (by default) automatically included by the compiler (&lt;code&gt;csc&lt;/code&gt; (.NET) or &lt;code&gt;mcs&lt;/code&gt; (Mono)), so it is rare to need any external DLLs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that using external DLLs requires compiler command-line arguments, and these must be added to your byte count.&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;csc /r:OxyPlot.dll main.cs&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Some&lt;/em&gt; common .NET DLLs do &lt;em&gt;not&lt;/em&gt; need these arguments when using &lt;code&gt;csc&lt;/code&gt;: &lt;a href=&quot;https://stackoverflow.com/questions/2356180/no-need-to-reference-to-windows-forms-assembly&quot;&gt;https://stackoverflow.com/questions/2356180/no-need-to-reference-to-windows-forms-assembly&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;using&lt;/code&gt; directives also count toward your byte count:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;using System.LINQ;&#xA;using C=System.Console;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Truthy/Falsey&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;In C#/.NET, &lt;code&gt;truthiness&lt;/code&gt; and &lt;code&gt;falseness&lt;/code&gt; are defined by the &lt;code&gt;true&lt;/code&gt; and &lt;code&gt;false&lt;/code&gt; operators, which (unless you define them on your own classes) are only defined for the &lt;code&gt;bool&lt;/code&gt; data type.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you are asked to produce a truth/falsy value then it must be something you could use in an &lt;code&gt;if&lt;/code&gt; statement, which would be the &lt;code&gt;bool&lt;/code&gt; values &lt;code&gt;true&lt;/code&gt; and &lt;code&gt;false&lt;/code&gt;, or a manually defined class (but this is unlikely ever to appear in code-golf). You can't, for example, return &lt;code&gt;1&lt;/code&gt; for true and &lt;code&gt;0&lt;/code&gt; for false, unless the challenge explicitly allows you to.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Try It Online&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Remember that most people won't be running your code from an IDE, they will just &lt;a href=&quot;https://tio.run/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try It Online&lt;/a&gt;. TIO has Mono, and .NET CORE with C# 7.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the past there have been some discrepancies between Mono and .NET compilation, notably with &lt;code&gt;goto&lt;/code&gt; statements, so it's always worth checking that your code runs as expected to avoid confusion. And everyone appreciates a Try It Online link in a good answer!&lt;/p&gt;&#xA;" OwnerUserId="26981" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2017-03-30T12:45:31.520" CommentCount="2" CommunityOwnedDate="2017-03-30T04:26:40.223" ContentLicense="CC BY-SA 3.0" />
  <row Id="11928" PostTypeId="2" ParentId="11924" CreationDate="2017-03-30T04:34:01.247" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/DJMcMayhem/Brain-Flak&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brain-Flak&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input in Brain-Flak will be passed as command-line arguments to the interpreter. (On Try it online this doesn't work and instead they have to be put into the &lt;code&gt;Input&lt;/code&gt; field with a whitespace separator)  They will appear on the active stack at the beginning of execution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a challenge calls for a specific number of inputs they can be passed in any order you choose.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the challenge requires you to take list or array of items you can have the items all passed as separate command-line arguments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example if the challenge is to sum up all the numbers in a list, the following code is valid:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(([]){[{}]{}([])}{})&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For Brain-Flak whatever is printed at the end of the program is the output, this does not include the offstack. You may leave anything you wish on the offstack at the end of execution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For truthy and falsy values only the top item is considered.  If the top item is zero, it is falsy otherwise it is truthy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;5&#xA;0&#xA;6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is &lt;code&gt;True&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0&#xA;1&#xA;4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is &lt;code&gt;False&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because Brain-Flak's stacks are padded with an infinite number of zeros, an empty stack is considered a zero and is thus falsy in Brain-Flak.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The same does not hold for numeric values.  For instance if you must output &lt;code&gt;5&lt;/code&gt; you may not output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;5&#xA;1&#xA;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;However the stack is still padded with infinite zeros so when a zero is required for output the empty stack is acceptable. &lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-03-31T16:15:25.780" LastActivityDate="2017-03-31T16:15:25.780" CommentCount="0" CommunityOwnedDate="2017-03-30T04:34:01.247" ContentLicense="CC BY-SA 3.0" />
  <row Id="11929" PostTypeId="1" CreationDate="2017-03-30T04:50:23.147" Score="2" ViewCount="53" Body="&lt;p&gt;It seems to be the consensus that it is acceptable in Brain-Flak to decompose a list into a series of arguments when taking input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example if you are to take the list &lt;code&gt;[2,5,6]&lt;/code&gt; as input you may run the following Brain-Flak&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ruby brain_flak.rb file 2 5 6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The same is also true of output, if you need to output the list &lt;code&gt;[4,5,9]&lt;/code&gt; your program could print:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4&#xA;5&#xA;9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Other data types have other conventions, for example boolean values have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10249/truthiness-in-brain-flak-and-similar-stack-based-languages&quot;&gt;their own meta question&lt;/a&gt; dictating what is acceptable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The current consensus on all of these i/o methods makes sense however things get a little strange when you start mixing datatypes in your i/o&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example if you need to take both an integer and a list as input how do you do so?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your list is &lt;code&gt;[7,1,8]&lt;/code&gt; and your integer is &lt;code&gt;2&lt;/code&gt; can you run:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ruby brain_flak.rb file 7 1 8 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;How about:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ruby brain_flak.rb file 2 7 1 8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And for Truthy values things get even murkier, if I need to output &lt;code&gt;7&lt;/code&gt;,&lt;code&gt;True&lt;/code&gt; is &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;7&#xA;8&#xA;0&#xA;6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;valid output?  Normally&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;8&#xA;0&#xA;6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;would be Truthy value on its own but it seems a little like cheating when other values start showing up.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How do we take mixed type i/o for programming languages that have similar memory structures to Brain-Flak?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-03-30T04:50:23.147" Title="Mixed input output methods in Brain-Flak and Stack based languages" Tags="|discussion|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11930" PostTypeId="2" ParentId="7542" CreationDate="2017-03-30T05:14:14.303" Score="14" Body="&lt;p&gt;No idea why this wasn't on already; guessing we just forgot.&lt;/p&gt;&#xA;" OwnerUserId="1144" LastActivityDate="2017-03-30T05:14:14.303" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11932" PostTypeId="2" ParentId="11924" CreationDate="2017-03-30T11:55:44.800" Score="9" Body="&lt;h1&gt;JavaScript&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;This answer is highly based on the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11925/42545&quot;&gt;Python answer&lt;/a&gt;, so thanks to @xnor for setting that up.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your submission should be a program or a function. It should print the output or return it. These example submissions compute the &lt;a href=&quot;https://en.wikipedia.org/wiki/Factorial&quot; rel=&quot;nofollow noreferrer&quot;&gt;factorial&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;General I/O&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;// Browser program that inputs with prompt and outputs with alert&#xA;n=prompt();for(p=i=1;i&amp;lt;=n;i++)p*=i;alert(p)&#xA;&#xA;// Node.js program that takes input from process.argv and outputs with console.log&#xA;n=process.argv[2];for(p=i=1;i&amp;lt;=n;i++)p*=i;console.log(p)&#xA;&#xA;// Function that outputs with console.log (in a browser you could also use alert)&#xA;function(n){for(p=i=1;i&amp;lt;=n;i++)p*=i;console.log(p)}&#xA;&#xA;// Function that returns the value&#xA;function(n){for(p=i=1;i&amp;lt;=n;i++)p*=i;return p}&#xA;&#xA;// Function that returns, named to use recursive call&#xA;f=function(n){return n?n*f(n-1):1}&#xA;function f(n){return n?n*f(n-1):1}&#xA;&#xA;// ES6 arrow function&#xA;n=&amp;gt;{for(p=i=1;i&amp;lt;=n;i++)p*=i;return p}&#xA;&#xA;// ES6 arrow function, named to use recursive call&#xA;f=n=&amp;gt;n?n*f(n-1):1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your may not expect input pre-written to a variable.&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;// Invalid, expects input in n&#xA;for(p=i=1;i&amp;lt;=n;i++)p*=i;alert(p)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Nor may you output just by saving the result to a variable.&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;// Invalid, saves result to p&#xA;n=prompt();for(p=i=1;i&amp;lt;=n;i++)p*=i&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Nor can the output just be the value of an expression like in the interactive shell or browser console.&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;// Invalid, evaluates to result instead of outputting or returning&#xA;Array(+prompt()).fill().reduce(p=&amp;gt;p*i++,i=1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Inputs&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We're liberal about input formats. For example, if a challenge says to take a list of numbers, you may expect a JavaScript array like &lt;code&gt;[1,2,3]&lt;/code&gt;, not like &lt;code&gt;&quot;1 2 3&quot;&lt;/code&gt;. So, a function can do&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;function(a){return a.length}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;rather than&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;function(s){return s.split(&quot; &quot;).length}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If you're using an arrow function and have multiple inputs, you can use &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8427/42545&quot;&gt;currying&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;// Non-curried arrow function&#xA;(a,b)=&amp;gt;a+10*b&#xA;&#xA;// Curried arrow function&#xA;a=&amp;gt;b=&amp;gt;a+10*b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A curried function can be used by calling it once with each argument, e.g. &lt;code&gt;f(1)(2)&lt;/code&gt; instead of &lt;code&gt;f(1,2)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Version&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you use any features that were added in a recent version of ECMAScript (ES6: &lt;a href=&quot;https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Functions/Arrow_functions&quot; rel=&quot;nofollow noreferrer&quot;&gt;arrow functions&lt;/a&gt;, &lt;a href=&quot;https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Spread_operator&quot; rel=&quot;nofollow noreferrer&quot;&gt;spread operator&lt;/a&gt;, &lt;a href=&quot;https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Template_literals&quot; rel=&quot;nofollow noreferrer&quot;&gt;template literals&lt;/a&gt;, &lt;a href=&quot;http://git.io/es6features&quot; rel=&quot;nofollow noreferrer&quot;&gt;etc.&lt;/a&gt;; ES7: &lt;a href=&quot;https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Arithmetic_Operators#Exponentiation_(**)&quot; rel=&quot;nofollow noreferrer&quot;&gt;exponentiation operator&lt;/a&gt;; etc.), include the ECMAScript version in the header. It's best practice to use titles such as &lt;strong&gt;JavaScript (ES6)&lt;/strong&gt;, &lt;strong&gt;JavaScript (ES7)&lt;/strong&gt;, etc. For future ECMAScript releases, you'll probably want to use the year name, e.g. &lt;strong&gt;JavaScript (ES2018)&lt;/strong&gt;, as ECMAScript has switched to this system of naming.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If, to the best of your knowledge, your code only works in a certain environment or browser, include that in the header instead, e.g. &lt;strong&gt;JavaScript (Firefox 44)&lt;/strong&gt;. If you submit a Node program, you may want to skip the &quot;JavaScript&quot; altogether and just use &lt;strong&gt;Node.js&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Truthy/Falsey&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some challenges ask for a output to be truthy or falsey, which is determined by the value of &lt;code&gt;Boolean(x)&lt;/code&gt; (or equivalently &lt;code&gt;!!x&lt;/code&gt;). Only &lt;code&gt;false&lt;/code&gt;, &lt;code&gt;0&lt;/code&gt;, &lt;code&gt;undefined&lt;/code&gt;, &lt;code&gt;NaN&lt;/code&gt;, &lt;code&gt;null&lt;/code&gt;, and the empty string are falsey, and the rest are truthy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;More on functions&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A function submission may include helper code outside the function, for example &lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;S=String;C=S.fromCharCode&#xA;l=&amp;gt; ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In ES6 and above, functions may use extra optional arguments. For example, this factorial function submission expects a single number, but uses the optional input &lt;code&gt;i&lt;/code&gt; to help recurse:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;f=(n,i=1)=&amp;gt;i&amp;gt;n?1:i*f(n,i+1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You may not, however, require the function to be called with a specific extra argument, like &quot;call this with 2nd argument 1&quot; for&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;f=(n,i)=&amp;gt;i&amp;gt;n?1:i*f(n,i+1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="42545" LastEditorUserId="30164" LastEditDate="2017-04-05T13:46:05.017" LastActivityDate="2017-04-05T13:46:05.017" CommentCount="0" CommunityOwnedDate="2017-03-30T11:55:44.800" ContentLicense="CC BY-SA 3.0" />
  <row Id="11935" PostTypeId="2" ParentId="11924" CreationDate="2017-03-30T15:13:11.513" Score="17" Body="&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;https://www.haskell.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Haskell&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Basic IO&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;In Haskell, a valid answer is usually a function, unless a full program is required by the challenge.&#xA;Even if a challenge requires you to output an infinite stream of data (like all prime numbers), you can just write a function that returns an infinite list or string.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Functions&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;These kinds of functions are valid answers in a code golf challenge by default (based on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9032/24877&quot;&gt;this meta question&lt;/a&gt;):&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;A named function (here &lt;code&gt;f&lt;/code&gt;) with arguments:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f x=x++map g x&#xA;g n=div n 2*div n 3&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A named function (here &lt;code&gt;f&lt;/code&gt;) without arguments:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f=(++)=&amp;lt;&amp;lt;map g&#xA;g n=div n 2*div n 3&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;An unnamed function (here, the first line) without arguments:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(++)=&amp;lt;&amp;lt;map g&#xA;g n=div n 2*div n 3&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Binary functions can be defined as infix operators (here &lt;code&gt;!&lt;/code&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x!y=x++map g y&#xA;g n=div n 2*div n 3&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For challenges where some output should be produced with out taking any input, the object itself counts as function which does not take any argument due to lazy evaluation (see &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12924/56433&quot;&gt;this meta question&lt;/a&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;['a'..'z']++['A'..'Z']++['0'..'9']&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;In all cases, you can have auxiliary functions and/or constants, here &lt;code&gt;g&lt;/code&gt;, defined on separate lines or separated by semicolons (the former is preferred for readability, since the byte count is the same).&#xA;Function definitions that use pattern matching are spread across multiple lines:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f 'A'='B'&#xA;f 'B'='A'&#xA;f x=x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;All functions are curried (partially applied) by default, so the following four answers are equivalent:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f n x=map(take n)x&#xA;f n=map(take n)&#xA;f=map.take&#xA;map.take&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Haskell has no concept of mutable values, so all functions must return their result instead of modifying the arguments in place.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The type of a function can be more general than the challenge requires, e.g. when the challenge asks to reverse a string, which in Haskell is a list of characters, then a function reversing a list with elements of any type is acceptable. If the type of a function can not be inferred without the function being called with an argument of the correct type, you can assume such a call exists (see &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14281/56433&quot;&gt;this meta question&lt;/a&gt;). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Functions are allowed to wrap their return value in the &lt;code&gt;Maybe&lt;/code&gt; Monad (see &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14199/is-outputting-a-maybe-acceptable-in-haskell&quot;&gt;this meta question&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Full programs&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Full programs either read their input from the user or take command line arguments, and print the result to the terminal.&#xA;A full program is defined by &lt;code&gt;main&lt;/code&gt;, and may of course include auxiliary definitions:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;main=print.map g=&amp;lt;&amp;lt;readLn&#xA;g n=div n 2*div n 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input format is usually flexible, so you can take lists in the Haskell format &lt;code&gt;[1,2,3]&lt;/code&gt; etc.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Hybrid answers&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You can also use a function that prints its result to the terminal (and has a type like &lt;code&gt;a -&amp;gt; IO ()&lt;/code&gt;), or a &quot;function&quot; that reads input from the user and computes a result (and has a type like &lt;code&gt;IO a&lt;/code&gt;).&#xA;These are rare in practice.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Libraries and extensions&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Libraries can be imported with the &lt;code&gt;import&lt;/code&gt; keyword at the beginning of a file:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import Data.List&#xA;f x=map(++x)$tails x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Imports must be included in your byte count.&#xA;GHC extensions can also be used (but almost always cost too many bytes to be useful):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{-# LANGUAGE ParallelListComp #-}&#xA;f x y=[a-b|a&amp;lt;-x|b&amp;lt;-y,odd b]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Data types&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Haskell has a rigid type system, so some specific tasks that are easy in scripting languages are cumbersome in Haskell.&#xA;The most common issues are inputs/outputs of varying types (like &quot;if input is a number, increment it, if it's a string, append a space&quot;) and arbitrarily nested arrays (like &lt;code&gt;[[1],2]&lt;/code&gt;), neither of which are supported in Haskell.&#xA;In such cases, you basically have three options:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Use a built-in or &lt;code&gt;import&lt;/code&gt;ed type that implements this behavior: &lt;code&gt;Either&lt;/code&gt; for varying types, &lt;code&gt;Data.Tree&lt;/code&gt; for nested lists.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Define a custom datatype. The most common approach to nested lists is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;data N=I Int|L[N]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;Int&lt;/code&gt; can be replaced with whichever base type you need.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;Use string representations in some reasonable format.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;All Haskell compilers implement type inference, meaning that you (usually) don't have to specify the types of functions and values, since the compiler infers them for you.&#xA;It doesn't matter if the inferred type is more general than what is required.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Truthiness&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Only values of type &lt;code&gt;Bool&lt;/code&gt; have truthiness: &lt;code&gt;True&lt;/code&gt; is truthy and &lt;code&gt;False&lt;/code&gt; is falsy.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Compiler&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If nothing else is stated a submission is assumed to run correctly in the current release of the &lt;a href=&quot;https://www.haskell.org/ghc/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Glasgow Haskell Compiler GHC&lt;/a&gt;. If your answer needs an other compiler or interpreter, e.g. Lambdabot, or relies on a specific GHC version, it should be submitted accordingly as e.g. &lt;strong&gt;Haskell Lambdabot&lt;/strong&gt; or &lt;strong&gt;Haskell GHC 6.10&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answers assuming a REPL (Read-Eval-Print Loop) environment are allowed though not encouraged. They too should be indicated accordingly, e.g. as &lt;strong&gt;Haskell GHCI&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Tips&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Tips for golfing in Haskell are collected &lt;a href=&quot;https://codegolf.stackexchange.com/questions/19255/tips-for-golfing-in-haskell&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="24877" LastEditDate="2018-01-07T15:31:44.713" LastActivityDate="2018-01-07T15:31:44.713" CommentCount="0" CommunityOwnedDate="2017-03-30T15:13:11.513" ContentLicense="CC BY-SA 3.0" />
  <row Id="11937" PostTypeId="2" ParentId="2140" CreationDate="2017-03-30T15:21:52.437" Score="0" Body="&lt;h1&gt;Let's play hide and seek.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The objective of this game is for the user to pick a spot on a grid (size given by user). For example, here is a 5x5 grid below.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;--------------------------&#xA;| A1 |    |    |    |    |&#xA;|    |    |    |    |    | A&#xA;--------------------------&#xA;|    |    |    |    | B5 |&#xA;|    |    |    |    |    | B&#xA;--------------------------&#xA;|    | ME |    |    |    |&#xA;|    |    |    |    |    | C&#xA;--------------------------&#xA;|    | D2 |    |    |    |&#xA;|    |    |    |    |    | D&#xA;--------------------------&#xA;|    |    |    |    |    |&#xA;|    |    |    |    |    | E&#xA;--------------------------&#xA;  1    2    3     4    5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Each tile is identified by its cross section of letters and numbers, A1, D2, and B5 are shown above.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The user picks a random tile to hide in. I picked C2.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, you must build a program that will guess tiles.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you are in the tile, you will respond with &lt;code&gt;Y&lt;/code&gt; meaning the computer won.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Otherwise, you will give the direction from the guessed tile (N, NE, E, SE, S, SW, W, NW). So if the computer guesses &lt;code&gt;D3&lt;/code&gt;, you would input &lt;code&gt;NW&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let me show you an example of what the program should look like.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Grid?&#xA;5x5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Pick: E2&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Guess: C3?&#xA;SW&#xA;Guess: D2?&#xA;S&#xA;Guess: E2?&#xA;Y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The scoring for this program: The program will be tested for three different scenarios using the grid sizes: 5x5, 10x10, 20x10&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program should be able to guess the correct square in the minimum number of guesses.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then, lowest bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="67522" LastEditorUserId="67522" LastEditDate="2017-03-30T15:40:13.347" LastActivityDate="2017-03-30T15:40:13.347" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11938" PostTypeId="2" ParentId="11924" CreationDate="2017-03-30T17:53:39.643" Score="5" Body="&lt;h1&gt;PowerShell&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your submission should be a program or function. It should print the output or return it. Since an implicit &lt;code&gt;Write-Output&lt;/code&gt; happens when a script finishes execution, simply leaving the result on the pipeline also suffices.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These example submissions compute the &lt;a href=&quot;https://en.wikipedia.org/wiki/Factorial&quot; rel=&quot;nofollow noreferrer&quot;&gt;factorial&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;General I/O&lt;/h3&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-powershell prettyprint-override&quot;&gt;&lt;code&gt;# Program that prints (implicitly), takes input via command-line arguments&#xA;param($n)$p=1&#xA;for($i=1; $i -le $n; $i++){$p*=$i}&#xA;$p&#xA;&#xA;# Named function that returns, could also be &quot;filter f($n){&quot;&#xA;function f($n){&#xA;  $p=1&#xA;  for($i=1; $i -le $n; $i++){$p*=$i}&#xA;  $p&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;PowerShell does have the equivalent of a &quot;lambda&quot; or &quot;unnamed&quot; function via &lt;a href=&quot;https://stackoverflow.com/questions/10995667/lambda-expression-in-powershell&quot;&gt;script blocks&lt;/a&gt;, but they are an advanced concept and (generally) not useful in code-golf, and so aren't covered here in this introductory topic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may not expect the input to be pre-stored in a variable&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-powershell prettyprint-override&quot;&gt;&lt;code&gt;# Invalid, assumes the input already exists in $n&#xA;$p=1&#xA;for($i=1; $i -le $n; $i++){$p*=$i}&#xA;$p&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Nor may you output by just saving the results in a variable.&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-powershell prettyprint-override&quot;&gt;&lt;code&gt;# Invalid, simply saves results to $p with no output&#xA;param($n)$p=1&#xA;for($i=1; $i -le $n; $i++){$p*=$i}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Inputs&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;We're pretty loose with input formats. For example, if a challenge says to take in a list of numbers, you can expect input as a PowerShell array like &lt;code&gt;$l=@(1, 2, 3)&lt;/code&gt;, not like &lt;code&gt;&quot;1 2 3&quot;&lt;/code&gt;. So, for this example, a PowerShell program can do&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-powershell prettyprint-override&quot;&gt;&lt;code&gt;param($l)$l.GetType()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and expect that the output will say it's of type &lt;code&gt;System.Array&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, &lt;em&gt;in general&lt;/em&gt;, it's frowned upon to take in &quot;a list of numbers&quot; as separate command-line arguments and use the built-in &lt;code&gt;$args&lt;/code&gt; as the array. This is allowed in some circumstances; ask on the particular challenge.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Version&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The latest version of the &lt;a href=&quot;https://github.com/TryItOnline/TioSetup/wiki/Powershell&quot; rel=&quot;nofollow noreferrer&quot;&gt;open-sourced&lt;/a&gt; repository is generally assumed, and is the version used on the &quot;Try It Online!&quot; site. In general, versions are backwards compatible, so if there's a feature in v2, for example, it should also be available in the latest version, and you shouldn't need to specify.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Libraries&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You may import libraries and .NET features. The import commands, like &lt;code&gt;Add-Type -A System.Windows.Forms&lt;/code&gt;, or static calls like &lt;code&gt;[system.math]::Floor()&lt;/code&gt;, must be included in your byte count. If it's a non-default library, like the PowerShell Community Extensions, call the language &quot;PowerShell with PSCX&quot; in the header.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Truthy/Falsey&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;PowerShell is strictly typed, but it attempts to dynamically cast on the fly as necessary. For PowerShell data types, the following code snippet is used to determine if something is truthy or falsey:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-powershell prettyprint-override&quot;&gt;&lt;code&gt;if($x){&#xA; &quot;True&quot;&#xA;}&#xA;else{&#xA; &quot;False&quot;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This means that &lt;code&gt;0&lt;/code&gt;, &lt;code&gt;$false&lt;/code&gt;, &lt;code&gt;&quot;&quot;&lt;/code&gt; (empty string), &lt;code&gt;@()&lt;/code&gt; (empty array), &lt;code&gt;$null&lt;/code&gt;, and variables set to those objects (including uninitialized variables, which default to &lt;code&gt;$null&lt;/code&gt;) are falsey, and everything else is truthy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;em&gt;Most of the formatting of this post comes from @xnor's &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11925/42963&quot;&gt;Python answer&lt;/a&gt;. Thanks!&lt;/em&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="-1" LastEditDate="2017-05-23T12:41:23.300" LastActivityDate="2017-03-30T17:53:39.643" CommentCount="0" CommunityOwnedDate="2017-03-30T17:53:39.643" ContentLicense="CC BY-SA 3.0" />
  <row Id="11939" PostTypeId="2" ParentId="11924" CreationDate="2017-03-30T18:17:20.663" Score="4" Body="&lt;h1&gt;Perl&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Version&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The &lt;code&gt;perl&lt;/code&gt; interpreter, by default, only turns on features compatible with the oldest possible version of the Perl specification. If you want newer language features (which is very common in golfing), you can request them at no penalty using command-line options. For example:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-perl prettyprint-override&quot;&gt;&lt;code&gt;perl -M5.010&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;A few answers won't work in the newest versions of Perl, due to features which are now disabled by default. This most commonly comes up in the case where you want to interpolate Perl code into a regular expression (a combination of two common Perl golfing tricks). This is legal as long as you target your code at a version of Perl where the feature was enabled by default (and don't use any newer features). If you're using a version other than the most recent, you should mention it in the submission's header.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Program structure&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The vast majority of questions on PPCG ask for a &amp;quot;program or function&amp;quot;. (If a question doesn't specify what sort of submission is requested, it wants a program or function by default.)&lt;/p&gt;&#xA;&lt;p&gt;A program (or &amp;quot;full program&amp;quot;) doesn't need any sort of header or footer, and doesn't need a shebang (e.g. &lt;code&gt;#!/usr/bin/perl&lt;/code&gt;); it's just a sequence of statements:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-perl prettyprint-override&quot;&gt;&lt;code&gt;my $x = 4;&#xA;print $x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Most PPCG submissions in Perl are programs. If you want to write a function for some reason (or if the question specifically requests functions), you can name it:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-perl prettyprint-override&quot;&gt;&lt;code&gt;sub f{&amp;quot;Hello, world!&amp;quot;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;but you don't have to, because returning a subroutine reference is also a legal sort of function:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-perl prettyprint-override&quot;&gt;&lt;code&gt;sub{&amp;quot;Hello, world!&amp;quot;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Taking input&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;If you're writing a program, you can take input from the default input streams:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-perl prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or from the command line:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-perl prettyprint-override&quot;&gt;&lt;code&gt;$ARGV[0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;All forms of input effectively boil down to one of these in Perl. However, you can, at no penalty, use command-line options to turn on explicit input. The &lt;code&gt;-a&lt;/code&gt;, &lt;code&gt;-p&lt;/code&gt;, &lt;code&gt;-n&lt;/code&gt;, and &lt;code&gt;-i&lt;/code&gt; options all give you access to a form of implicit input.&lt;/p&gt;&#xA;&lt;p&gt;If you're writing a function, you can also of course take input via the function arguments, e.g.:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-perl prettyprint-override&quot;&gt;&lt;code&gt;$_[0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-perl prettyprint-override&quot;&gt;&lt;code&gt;@_&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that you &lt;em&gt;can't&lt;/em&gt; just assume that input is present in a particular variable (unless you use an option like &lt;code&gt;-a&lt;/code&gt; or &lt;code&gt;-n&lt;/code&gt; to put it there).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Producing output&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;In a program, you can produce output via printing it on the default output stream:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-perl prettyprint-override&quot;&gt;&lt;code&gt;say&amp;quot;Hello, world!&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or on the warning/error output stream:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-perl prettyprint-override&quot;&gt;&lt;code&gt;warn&amp;quot;Hello, world!&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or via setting the program's exit code:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-perl prettyprint-override&quot;&gt;&lt;code&gt;exit 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You can also output via using these methods &lt;em&gt;indirectly&lt;/em&gt;; for example, assigning to &lt;code&gt;$\&lt;/code&gt; in order to affect the implicit &lt;code&gt;print&lt;/code&gt; statement implied by &lt;code&gt;-p&lt;/code&gt; is legal, and causing an error to affect the program's exit code is also legal.&lt;/p&gt;&#xA;&lt;p&gt;If you're writing a function, you can use any of the above methods. You may also output via the function's return value:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-perl prettyprint-override&quot;&gt;&lt;code&gt;return 4;&#xA;4 # at the end of the function&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or overwrite &lt;code&gt;@_&lt;/code&gt;, allowing the function's caller to read the output via the side effect on the input it was given:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-perl prettyprint-override&quot;&gt;&lt;code&gt;$_[0]=4;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;True and false&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;In Perl, almost all values are truthy (and thus are legitimate &amp;quot;true&amp;quot; outputs for a question asking for truthy or falsey values). There are precisely four falsey values: &lt;code&gt;''&lt;/code&gt; (the null string), &lt;code&gt;0&lt;/code&gt; (integer zero), &lt;code&gt;'0'&lt;/code&gt; (stringification of integer zero; equivalent to it in most contexts, including here), and &lt;code&gt;undef&lt;/code&gt; (the undefined value); everything else is truthy. Note that if a question is asking you for a Boolean output, it might want any truthy/falsey value, a &lt;em&gt;consistent&lt;/em&gt; truthy/falsey value, or just any two consistent values; read the question to see what is needed.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Code scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A submission in Perl typically looks something like this:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Perl &lt;code&gt;-p&lt;/code&gt;, 10 bytes&lt;/h1&gt;&#xA;&lt;pre class=&quot;lang-perl prettyprint-override&quot;&gt;&lt;code&gt;$_=reverse&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Here, the &amp;quot;10&amp;quot; is the number of bytes in the submission, and the &lt;code&gt;-p&lt;/code&gt; indicates required command-line options to the Perl interpreter.&lt;/p&gt;&#xA;&lt;p&gt;Perl programs nearly always use ASCII characters. If you're using non-ASCII characters, Perl will by default interpret them as being in a single-byte codepage which is consistent with ASCII, and has unknown (but consistent) characters in the top half. As such, it's worth looking for a single-byte codepage that has all the characters you need; Perl will treat this as opaque, and thus will accept any of them.&lt;/p&gt;&#xA;&lt;p&gt;If you need to use Unicode for some reason, you're likely going to have to add command-line options to turn on Unicode; &lt;code&gt;-Mutf8&lt;/code&gt;, &lt;code&gt;-C&lt;/code&gt;, etc. Note that, per &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14337&quot;&gt;recent consensus&lt;/a&gt;, command-line options no longer add a score penalty on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; questions.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="97857" LastEditDate="2021-03-27T11:38:39.677" LastActivityDate="2021-03-27T11:38:39.677" CommentCount="0" CommunityOwnedDate="2017-03-30T18:17:20.663" ContentLicense="CC BY-SA 4.0" />
  <row Id="11940" PostTypeId="2" ParentId="11924" CreationDate="2017-03-30T18:36:09.840" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Jelly is a language designed for code golfing. Here's how our rules apply to it:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Program structure&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;PPCG questions normally ask for a &quot;program or function&quot; (and if they don't state what they're looking for specifically, they want a program by default).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A program is fairly straightforward in Jelly, which defines what a program is (a sequence of links, where the last one runs by default). A valid function submission is a link that can be called by number (i.e. using a builtin like &lt;code&gt;1Ŀ&lt;/code&gt;); in other words, it's a single line of your program. You can use extra lines (even when writing a function submission) to define helper links.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Taking input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A full program normally takes input from the command-line arguments &lt;code&gt;³&lt;/code&gt;, &lt;code&gt;⁴&lt;/code&gt;, &lt;code&gt;⁵&lt;/code&gt;, and so on. You may if you prefer use nilads like &lt;code&gt;ɠ&lt;/code&gt; to read from the &quot;standard input stream&quot; (and a few challenges, especially older ones, may explicitly require you to do this). Note that you don't always have to write the &lt;code&gt;³&lt;/code&gt; or &lt;code&gt;⁴&lt;/code&gt; explicitly; they'll be given as arguments to your program's main link by default.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you're writing a function submission, you can take input via any of the above means. If your link isn't niladic, you can also inspect its arguments; a monadic link can take input via &lt;code&gt;⁸&lt;/code&gt;, a dyadic link via &lt;code&gt;⁸&lt;/code&gt; and &lt;code&gt;⁹&lt;/code&gt;. As with full programs, you don't always have to write the &lt;code&gt;⁸&lt;/code&gt; or &lt;code&gt;⁹&lt;/code&gt; explicitly as they're used as the default arguments in many contexts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Producing output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are two main ways to produce output in Jelly: on the &quot;standard output stream&quot;, and via your program's return value.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When you're writing a full program, all the output goes to the same place; the program's return value (i.e. the current value at the end of its main link) will be written to standard output at the end of the program's execution. Basically all other methods of output (e.g. &lt;code&gt;Ṅ&lt;/code&gt;, &lt;code&gt;Ȯ&lt;/code&gt;, writing a nilad out of context, etc.) will go to standard output directly. As such, all your output is combined in a single location, and you need to make sure not to produce extraneous output which will make your submission invalid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When you're writing a function (i.e. link-based) submission, these two output locations (the link's return value, and standard output) are considered different, and you must nominate one or the other to count as the output to your program (the other will be ignored). This is the only real difference between a function and program submission in Jelly. (Note that a few questions may specifically require a full program, or specifically require a function.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's also legal to report output via the presence or absence of an error that crashes the interpreter; this is known as &quot;outputting via exit status&quot;, with an exit status of 0 if the Jelly interpreter does not crash, and 1 if it does. As such, this method is only useful for outputting Booleans.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;True and false&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All values in Jelly are either truthy or falsey; the rule is that the number 0 is falsey, as is an empty structure (such as an empty list or empty string), and all other values are truthy. Note that a question that outputs a Boolean may require truthy/falsey output, &lt;em&gt;consistent&lt;/em&gt; truthy/falsey outputs, or just any two consistent outputs; make sure you read the question to understand what it's asking for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Jelly has its own &lt;a href=&quot;https://github.com/DennisMitchell/jelly/wiki/Code-page&quot; rel=&quot;nofollow noreferrer&quot;&gt;256-character code page&lt;/a&gt;. If your program consists entirely of characters in this code page (most do), you can score the program as 1 byte per character. (Note that &lt;code&gt;¶&lt;/code&gt; and newline are 100% interchangeable, and in fact are encoded the same way in Jelly's code page; you may use either of these characters to stand for the other in a submission.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you need to use characters outside Jelly's code page for some reason, this is legal, but you must score your program using a UTF-8 byte count, in which non-ASCII characters count as 2 or more bytes. (Mention this in the header, e.g. &quot;100 bytes of UTF-8&quot;.) It's easiest to use a UTF-8 byte counting program in order to calculate the count exactly, as this is fairly difficult to do by hand.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-03-30T18:36:09.840" CommentCount="0" CommunityOwnedDate="2017-03-30T18:36:09.840" ContentLicense="CC BY-SA 3.0" />
  <row Id="11941" PostTypeId="2" ParentId="2140" CreationDate="2017-03-30T21:17:17.613" Score="1" Body="&lt;h1&gt;King of the Hill: Risk(k)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c%23&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c#&amp;#39;&quot; rel=&quot;tag&quot;&gt;c#&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c%2b%2b&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c++&amp;#39;&quot; rel=&quot;tag&quot;&gt;c++&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/.net&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;.net&amp;#39;&quot; rel=&quot;tag&quot;&gt;.net&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/windows&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;windows&amp;#39;&quot; rel=&quot;tag&quot;&gt;windows&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We all know these well spend evenings where family members and friends got to temporary enemies while playing &lt;a href=&quot;https://en.wikipedia.org/wiki/Risk_(game)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Risk the board game&lt;/a&gt;.&#xA;The rules are not so complicated, the world is divided in territories on 6 different continents.&#xA;&lt;a href=&quot;https://i.stack.imgur.com/QlbLJ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/QlbLJ.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&#xA;The different players take control over those territories and afterwards play to conquer the neighbors, form alliances and betray each other until one player reaches world domination.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But wouldn't it be cool, if you just write a bot for you to play this game? here comes your chance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a King of the Hill challenge to write the best bot to play Risk(k). Like in the original game (but not entirely) the world is divided into 6 continents with a total of 41 territories. Afterwards the bots will play this game with reduced rules in a round-based setting.&#xA;Your bot can be written in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c%23&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c#&amp;#39;&quot; rel=&quot;tag&quot;&gt;c#&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c%2b%2b&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c++&amp;#39;&quot; rel=&quot;tag&quot;&gt;c++&lt;/a&gt;. Although any other language is possible which is capable of producing a dll with &lt;code&gt;cdecl&lt;/code&gt;-functions or to implement &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/.net&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;.net&amp;#39;&quot; rel=&quot;tag&quot;&gt;.net&lt;/a&gt; interfaces. &lt;a href=&quot;https://github.com/JulienKluge/KOTH_Risk-k-/tree/master/Compiled%20Test&quot; rel=&quot;nofollow noreferrer&quot;&gt;The controller&lt;/a&gt; can be found &lt;a href=&quot;https://github.com/JulienKluge/KOTH_Risk-k-&quot; rel=&quot;nofollow noreferrer&quot;&gt;on Github&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/jNJgL.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/jNJgL.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;A short classis-game explanation&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;For all of you, who aren't familiar with this game. Every player plays on his own against all other players. The game begins with the claiming of territories (by positioning a single unit there) which is done consecutively for every player until all territories are owned by a faction. Now the players get the chance of using all units they have left to enforce their territories. Now the game begins round-wise. Every player makes a Attack-Stage and Move-Stage. In the attack-stage the players can attack other territories. This is done with dices. When thrown (the attacker and defender), the dices on each side are ordered and the highest ones are compared to each other. Whoever has the higher dice destroys a unit of the opposite side. Equal dices are considered a tie and no unit dies. You can only attack with max. 3 units at the same time, even when you have more than 3 units on your attacking territory. Also a territory with one unit cannot attack to prevent territory loss. Likewise a territory with two units can only attack with one etc. . When a territory falls to zero units, the attacking territory has to send units over (at least on and max. all except one - in the controller, all units except one are send automatically). After the attack stage, one player gets the chance to move units in the Move-Stage. One can only do so, if the territories you want to move units between are connected by territories owned by you. If your are done with this, the next players turn begins. The game ends, when one player has conquered the whole world.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The game&amp;amp;rules:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All bots have to obey the rules. Cheating bots will be punished by the program or by me. Standard loopholes are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;Each bot must be in a dll file (&lt;code&gt;name.dll&lt;/code&gt;) in the same directory, as the controller.&lt;/li&gt;&#xA;&lt;li&gt;Each program with the c++ interface must end with &lt;code&gt;name.cpp.dll&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;When the program is started each bot gets loaded into the program and is checked if everything works. The bots get instantiated only one time when the game starts.&lt;/li&gt;&#xA;&lt;li&gt;All bots loaded are participating in the game.&lt;/li&gt;&#xA;&lt;li&gt;The initialization stage begins:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each bot gets asked through the interface about its name and color.&lt;/li&gt;&#xA;&lt;li&gt;All bots get introduced to another with their names.&lt;/li&gt;&#xA;&lt;li&gt;All bots get consecutively called to select one of the remaining free territories. This goes till no territory is free anymore.&lt;/li&gt;&#xA;&lt;li&gt;All bots get to distribute the units left to all territories. [UnitCount = Ceil(82 / BotCount) ]&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The game will stop for now till the user pushes the start-button.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The game will be round based where each bot will get consecutively called in four stages: Strategy-Stage, Enforcement-Stage, Attack-Stage, Move-Stage&lt;/li&gt;&#xA;&lt;li&gt;The &lt;strong&gt;Strategy-Stage&lt;/strong&gt; gives your bot the opportunity to plan a strategy for this round.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;strong&gt;Enforcement-Stage&lt;/strong&gt; will give your bot the opportunity to distribute all new units to your territories. Units are gained to: Count of owned territories divided by 5 and floored, continent-bonus (owning a whole continent: North America: +5, South America: +2, Europe: +5, Africa: +3, Australia: +2, Asia: +7), capital-bonus (+1 for each owning of: East US, Brazil, North Europe, South Africa, East Australia, China) and +1 if you conquered a territory last round. You're guaranteed to get at least one new unit per round if your bot is still alive.&lt;/li&gt;&#xA;&lt;li&gt;In the &lt;strong&gt;Attack-Stage&lt;/strong&gt; you can order the program do make attacks on enemy territories which can lead to loss on your or the enemy side or you conquering a new territory. The attack will be called multiple times (max.: 100 times) as long as you make an attack every call.&lt;/li&gt;&#xA;&lt;li&gt;In the &lt;strong&gt;Move-Stage&lt;/strong&gt; you can move units around owned, connected territories. You can also again plan your strategy there for the next round.&lt;/li&gt;&#xA;&lt;li&gt;Each round is time constricted for every bot with 200ms. Taking longer than this will lead to a punishment (suspension) for the next round.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The game ends when only one bot still lives or when two bots get into an infinite loop (which is surprisingly possible and not rare for the random-bots)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;The controller&amp;amp;interface&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;How the interfaces work is explained in the template files and the example-bots.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;For c#, .NET Programmer&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your bot has to be in a class which inherits and fully implements the &lt;a href=&quot;https://github.com/JulienKluge/KOTH_Risk-k-/tree/master/IBotInterface&quot; rel=&quot;nofollow noreferrer&quot;&gt;IBotInterface&lt;/a&gt;. The class must be compiled into a class-library (dll).&#xA;Afterwards you can just copy your dll into the game-directory and start the game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/JulienKluge/KOTH_Risk-k-/tree/master/EmptyBot&quot; rel=&quot;nofollow noreferrer&quot;&gt;EmptyBot&lt;/a&gt; is an empty template which implements the minimum required and adds a lot of useful helper-methods. It can be used as a template.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/JulienKluge/KOTH_Risk-k-/tree/master/RandomBot&quot; rel=&quot;nofollow noreferrer&quot;&gt;RandomBot&lt;/a&gt; is a bot which implements random behavior in all functions and stages. It acts as a full working example.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;For C++, C, cdecl-function-able-languages&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your dll must implement eight functions with an external definition and cdecl-calling convention. A &lt;a href=&quot;https://github.com/JulienKluge/KOTH_Risk-k-/blob/master/EmptyCPPBot/EmptyCPPBot/EmptyCPPBot.cpp&quot; rel=&quot;nofollow noreferrer&quot;&gt;minimal implementation&lt;/a&gt; can be looked at at &lt;a href=&quot;https://github.com/JulienKluge/KOTH_Risk-k-/tree/master/EmptyCPPBot&quot; rel=&quot;nofollow noreferrer&quot;&gt;EmptyCPPBot&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your dll can afterwards be copied into the game-directory which can be started normally afterwards. Your dll must have the following name structure: &lt;code&gt;nameOfYourDll.cpp.dll&lt;/code&gt; to distinguish it from the managed dll's.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/JulienKluge/KOTH_Risk-k-/tree/master/RandomCPPBot&quot; rel=&quot;nofollow noreferrer&quot;&gt;RandomCPPBot&lt;/a&gt; is a bot which implements random behavior in all functions and stages. It acts as a fully working example.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Contest Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Players may submit multiple bots and are free to edit them to the deadline.&lt;/li&gt;&#xA;&lt;li&gt;A submission must be made as an answer on this thread. The source code can come in pieces, as full project, single file or whatever. And may be provided via download, push request or simple pasted code in the answer with code-tags. If not compile-able with Visual-Studio, i request fairly simple instructions how to compile it myself.&lt;/li&gt;&#xA;&lt;li&gt;A submission must specify the name and color of the bot. Although not necessary, an explanation of the bot's strategy would be nice.&lt;/li&gt;&#xA;&lt;li&gt;Bots are not allowed to use sources outside the dll/program (no files, no webrequest or similar things).&lt;/li&gt;&#xA;&lt;li&gt;Bots must be compatible with the provided interface and work under windows. Custom interfaces are not explicitly forbidden as long as they don't generate a advantage or are not compatible with the main-interface/program.&lt;/li&gt;&#xA;&lt;li&gt;The competition will be held in the provided controller (possible altered to automate the process) with all pairings possible to find the best 4 bots.&lt;/li&gt;&#xA;&lt;li&gt;The last 4 bots are fighting each other in 10 games. The bot which has won the most, wins the tournament. In a tie situation, the bots will take a single match against each other (golden goal), until one wins.&lt;/li&gt;&#xA;&lt;li&gt;Rules are can be changed when necessary which would be introduced on top of this thread.&lt;/li&gt;&#xA;&lt;li&gt;The contest ends when a week long no new submissions got made or when I say, its time to end this.&lt;/li&gt;&#xA;&lt;li&gt;And again, just to be sure: standard loopholes are forbidden.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="58461" LastEditorUserId="58461" LastEditDate="2017-03-30T22:31:23.683" LastActivityDate="2017-03-30T22:31:23.683" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11942" PostTypeId="1" CreationDate="2017-03-31T10:09:08.697" Score="0" ViewCount="454" Body="&lt;p&gt;When the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/114544/inverse-of-a-number-1-x&quot;&gt;Find the inverse of a number &lt;code&gt;1/x&lt;/code&gt;&lt;/a&gt; challenge has been posted, the author posted a bounty for the shortest Retina submission. After that, there was a bounty for sed, another text/string-based language. Since the challenge requires I/O with floating-point numbers, this brings forth a question: how will floating-point numbers be represented in unary?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In unary an integer, say &lt;code&gt;5&lt;/code&gt;, would be represented with that many zeroes, in this case, &lt;code&gt;00000&lt;/code&gt;. What about decimal places? One suggestion was to do the same thing for decimal places as well, for example &lt;code&gt;4.3&lt;/code&gt; would be &lt;code&gt;0000.000&lt;/code&gt;... &lt;strong&gt;BUT&lt;/strong&gt; what about &lt;code&gt;4.03&lt;/code&gt;? It will share its representation with &lt;code&gt;4.3&lt;/code&gt;, so clearly this way of using unary to show decimal numbers (as in decimal places and not base-10 numbers) would not be valid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How do we represent floating-point numbers in unary?&lt;/p&gt;&#xA;" OwnerUserId="41805" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2017-04-04T16:03:10.317" Title="Unary representation of floating-point numbers" Tags="|discussion|" AnswerCount="7" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="11943" PostTypeId="2" ParentId="11942" CreationDate="2017-03-31T10:28:18.277" Score="-3" Body="&lt;h1&gt;5.3204 =&amp;gt; &lt;code&gt;00000.000 00  0000&lt;/code&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Every digit after the decimal point is displayed separately, with a space between every digit. Zero, as you can see, is not displayed and can be noticed by the spaces.&lt;/p&gt;&#xA;" OwnerUserId="41805" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-03-31T10:28:18.277" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11944" PostTypeId="2" ParentId="11913" CreationDate="2017-03-31T12:00:03.247" Score="5" Body="&lt;p&gt;I have a question about&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Moving away from the polling culture that shaped many of our older policies would actually enable us to have more constructive discussions about the policies and it will more easily reflect the community's &lt;em&gt;current&lt;/em&gt; opinion.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;How are we going to move away from a polling culture? It seems to me that we're stuck with it because (with the odd exception) SE doesn't exercise dictatorial power; and mods are not elected to form a policy-making body. The SE model is a community taking decisions by direct democracy*.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In fact, one advantage that polling has over discussion is that it gives everyone a voice, whereas a discussion with thirty people will have at least thirty viewpoints and without heavy steering won't reach any conclusions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The big problem I see isn't polling per se but the way the technical limitations of SE &lt;em&gt;shape&lt;/em&gt; that polling. Meta is susceptible to FGITW perhaps almost as much as main, which works against constructive discussions. My impression is that it's quite frequent on meta that someone who wants to push a policy will ask a question and self-answer almost immediately because they've already spent time thinking about it; the dissenting answer may not arrive for a day or two because it takes time to put a finger on the flaw or to find the right words to express it, and in that time the sole answer can potentially pick up a lot of votes from people who didn't see the flaw. To get truly constructive discussions and decision-making we really need a way of having the discussion before anyone is allowed to cast a vote, but I don't see that happening any time soon.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;* &lt;em&gt;There is a minor weighting towards higher rep users in the sense that if everyone with e.g. close vote privileges decides to implement one policy then it will be the effective policy regardless of the lower rep users holding a majority of overall users in favour of a different policy. But in practice I don't think I've seen any issue split along those kind of lines.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-03-31T12:00:03.247" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11945" PostTypeId="2" ParentId="2140" CreationDate="2017-03-31T16:05:22.243" Score="1" Body="&lt;h1&gt;Check for repeated repeated words&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your code should either read in a stream/file containing printable ASCII text or define a function that takes a string containing printable ASCII and output any repeated words (including their repetitions). If you read from a file then it can have a name of your choice. Output can be a single linefeed-separated string, or a list of strings (one per repeated word).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A word is defined by the regex &lt;code&gt;[0-9A-Za-z'-]+&lt;/code&gt;, i.e. it's a run of letters, digits, apostrophes and/or hyphens.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A word is considered to be repeated if it occurs twice or more in succession, separated only by one or more spaces. Repetition is case sensitive: &lt;code&gt;WORD&lt;/code&gt;, &lt;code&gt;Word&lt;/code&gt; and &lt;code&gt;word&lt;/code&gt; are all different.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Individual test cases are separated by an empty line. For each test case, the first line is the input, subsequent lines are the output. Note that the last test case does not contain any repeated words.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hello how how are you?&#xA;how how&#xA;&#xA;Hello my my friend. Is that that your pen pen pen?&#xA;my my&#xA;that that&#xA;pen pen pen&#xA;&#xA;This is not. not a case of repeated? repeated words! Neither neither is this. &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user9206" LastEditorUserId="8478" LastEditDate="2017-03-31T16:52:46.273" LastActivityDate="2017-03-31T16:52:46.273" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11946" PostTypeId="2" ParentId="11942" CreationDate="2017-03-31T19:53:19.950" Score="-2" Body="&lt;p&gt;I propose the following solution:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Binary -&amp;gt; Unary&#xA;.0    -&amp;gt; .&#xA;.1    -&amp;gt; .1&#xA;.01   -&amp;gt; .11&#xA;.11   -&amp;gt; .111&#xA;.001  -&amp;gt; .1111&#xA;.101  -&amp;gt; .11111&#xA;.011  -&amp;gt; .111111&#xA;.111  -&amp;gt; .1111111&#xA;.0001 -&amp;gt; .11111111&#xA;etc.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;That is, to convert the fractional bits of a binary number to unary, reverse the bits, convert to unary, and append the result after the decimal point. As a basic example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.011 -&amp;gt; 110. -&amp;gt; 6. -&amp;gt; 111111. -&amp;gt; .111111&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So 4.375 in decimal would be 1111.111111 in unary (4 -&gt; 1111, .375 -&gt; .111111, as above)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This has the disadvantage of not being able to exactly represent decimal numbers such as 0.7, but of course, binary has the same disadvantage. The difference with this system is that there's no periodic pattern of digits either, but it would be impossible to create a periodic pattern in any unary system; any periodic decimal would just be represented by infinite 1s in unary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I know this system isn't perfect, but it's a start...&lt;/p&gt;&#xA;" OwnerUserId="42545" LastEditorUserId="42545" LastEditDate="2017-04-03T13:35:07.387" LastActivityDate="2017-04-03T13:35:07.387" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11947" PostTypeId="2" ParentId="11942" CreationDate="2017-03-31T20:09:48.493" Score="0" Body="&lt;p&gt;I propose the following solution:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4.3   --&amp;gt; 1111.111&#xA;4.03  --&amp;gt; 1111.111111111111111111111111111111 (30 '1's)&#xA;4.003 --&amp;gt; 1111.111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111 (300 '1's)&#xA;&#xA;3.14  --&amp;gt; 111.11111111111111111111111111111111111111111 (41 '1's)&#xA;3.41  --&amp;gt; 111.11111111111111    (14 '1's)&#xA;1.0   --&amp;gt; 1.&#xA;1.10  --&amp;gt; 1.1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Basically, take the decimal number after the decimal point, reverse it, and convert that to unary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Advantages:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Simple.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Doesn't require complex base conversion.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A unique representation for every number.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Disdvantages:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Gets really long as precision increases (but this is always a problem with unary)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Leading zeros are lost (so 4.2 and 4.20 and 4.200000000... all have the same representation)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Numbers with a periodic representation in base 10 (e.g. 1/3) cannot be represented very precisely.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Overall, the whole problem is weird, so I think this is as good a solution as your going to get.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="31716" LastEditDate="2017-03-31T20:24:10.110" LastActivityDate="2017-03-31T20:24:10.110" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="11950" PostTypeId="2" ParentId="11942" CreationDate="2017-04-01T00:23:00.377" Score="-2" Body="&lt;p&gt;There are issues with repeating decimals, and I'm not sure if this is a good idea or not, but here we go...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We can introduce a second decimal point, which will tell us how many digits (from the end) are repeated infinitely. This can fit both proposals.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, in ETHProductions' proposal, this is how you can represent &lt;code&gt;1/3&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.11.11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Since &lt;code&gt;0.01&lt;/code&gt; gets turned into &lt;code&gt;.11&lt;/code&gt;, and the &lt;code&gt;01&lt;/code&gt; bit is repeated infinitely, the second decimal point has two &lt;code&gt;1&lt;/code&gt;s.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;code&gt;1/3&lt;/code&gt; in DJMcMayhem's proposal:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.111.1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Since &lt;code&gt;0.3&lt;/code&gt; gets turned into &lt;code&gt;.111&lt;/code&gt;, and the &lt;code&gt;3&lt;/code&gt; bit is repeated infinitely, the second decimal point has only one &lt;code&gt;1&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This should work for all repeating decimals.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More examples in both formats:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1/6:&#xA;Decimal:    0.16...               (6 recurs)&#xA;Binary:     0.001...              (01 recurs)&#xA;ETH format: 0.1111.11&#xA;DJ format:  0.{61 1's}.11&#xA;&#xA;1/7:&#xA;Decimal:    0.142857...           (142857 recurs)&#xA;Binary:     0.001...              (001 recurs)&#xA;ETH format: 0.1111.111&#xA;DJ format:  0.{758241 1's}.111111&#xA;&#xA;1/11:&#xA;Decimal:    0.09...               (09 recurs)&#xA;Binary:     0.0001011101...       (0001011101 recurs)&#xA;ETH format: 0.{744 1's}.{10 1's}&#xA;DJ format:  0.{90 1's}.11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In decimals which aren't repeating, you can just leave the second decimal place out. For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1/2:&#xA;Decimal:    0.5&#xA;Binary:     0.1&#xA;ETH format: 0.1&#xA;DJ format:  0.11111&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="49561" LastEditDate="2017-04-01T01:31:55.990" LastActivityDate="2017-04-01T01:31:55.990" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11952" PostTypeId="2" ParentId="11896" CreationDate="2017-04-01T05:58:01.013" Score="17" Body="&lt;p&gt;I'm not so sure the no-sandboxing rule is a good idea. The Sandbox exists for a reason: most of us need feedback to find issues that we've overlooked. If a bunch of people post challenges to main without using the Sandbox first, we'll inevitably end up with a lot of challenges getting put on hold as unclear. I can understand why you'd want to have the rule, but perhaps there's a better way to achieve that goal while still having the ability to use the Sandbox as quality control.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-04-01T05:58:01.013" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="11953" PostTypeId="2" ParentId="10127" CreationDate="2017-04-01T09:12:48.717" Score="12" Body="&lt;h1&gt;Use Human-Readable Encodings to Present Solutions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;One of my favorite languages to use here is PostScript, which while not a true golfing language, has the ability to represent most of its operators using two-byte binary tokens, in addition to its more verbose text encoding. Whenever I answer in PostScript, I take full advantage of the tokenized encoding to save on bytes, but always first present the program using the text encoding.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TI-Basic is another language affected by this - all of its commands are each a single &quot;character&quot;, but most display as multiple characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even in languages not affected by this, it is a common practice (although not universal) to present the un-golfed, neatly formatted solution code in the answer along side the compacted version. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would suggest that golfing languages ought to take a similar approach, and define human-readable encodings or representations for themselves, and then use these encodings preferentially when first presenting a solution.&#xA;The solution can still present its encoded form later in the answer, and report its score based on the encoded form. &#xA;However this would make it easier for new (and even experienced) users to understand and even get in to &lt;em&gt;using&lt;/em&gt; golfing languages.&lt;/p&gt;&#xA;" OwnerUserId="7981" LastEditorUserId="7981" LastEditDate="2017-04-01T15:42:21.233" LastActivityDate="2017-04-01T15:42:21.233" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11958" PostTypeId="2" ParentId="2140" CreationDate="2017-04-02T00:34:26.507" Score="0" Body="&lt;h1&gt;How far is this list from sorted?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; sequence of whitespace-separated base-10 integers (on stdin).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt; minimal count (base-10 integer) of numbers which have to be moved to a different position in order to sort the list (to stdout).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;0 1 2 4 5 6 3 9 7 8&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;becomes sorted by moving at least two numbers ‒ 3 and 9.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;0 1 2 &lt;strong&gt;3&lt;/strong&gt; 4 5 6 7 8 &lt;strong&gt;9&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;so the output would be &lt;code&gt;2&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For already sorted (including constant) or empty lists, the result is 0.&lt;/li&gt;&#xA;&lt;li&gt;Shortest entry wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="67445" LastEditorUserId="67445" LastEditDate="2017-04-02T01:08:48.903" LastActivityDate="2017-04-02T01:08:48.903" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="11959" PostTypeId="2" ParentId="11942" CreationDate="2017-04-02T03:07:15.617" Score="-1" Body="&lt;h1&gt;Unary as a Bijection between the Naturals to the Rationals&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;My suggestion is simple.  You choose your favorite bijection between the natural numbers and the rational numbers and you use it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are many such bijections to choose from.  Here are two of my favorites:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Stern%E2%80%93Brocot_tree&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Stern-Brocot Tree&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Calkin%E2%80%93Wilf_tree&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Calkin-Wilf Tree&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Why is this a good idea?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In my opinion including a decimal is not Unary.  The reason we allow unary is to allow programming languages that cannot reasonably take input in other ways to compete.  Including the decimal altogether defeats the purpose of allowing unary in the first place.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This circumvents the problem by having every natural number correspond to one rational number so that every number can be represented as a sequence of one character (most of the time &lt;code&gt;1&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is also pretty flexible, there are many bijections between the natural numbers and the rationals so if one doesn't work for some reason you can always switch to a new one.  We don't prescribe a specific bijection that everyone has to follow.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Drawbacks&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;While I do believe that this is the best option here it is worth mentioning that mathematical calculations with such numbers may be extremely difficult, especially with languages that have restricted operations.  &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example calculations&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here are some examples using the Stern-Brocot Tree as a bijection.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Decimal | Fraction | Natural number | Unary &#xA;  1.0  -&amp;gt;   1/1   -&amp;gt;       1       -&amp;gt; 1&#xA;  .5   -&amp;gt;   1/2   -&amp;gt;       2       -&amp;gt; 11  &#xA;  .75  -&amp;gt;   3/4   -&amp;gt;       11      -&amp;gt; 11111111111 &#xA;  4.0  -&amp;gt;   4/1   -&amp;gt;       15      -&amp;gt; 111111111111111&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-04-02T03:14:48.570" LastActivityDate="2017-04-02T03:14:48.570" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11960" PostTypeId="2" ParentId="2140" CreationDate="2017-04-02T03:41:04.600" Score="1" Body="&lt;h1&gt;Factor Sort&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This challenge involves sorting positive integers based on a lexicographical ordering of their prime factorizations.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Overview&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Lexicographical_order&quot; rel=&quot;nofollow noreferrer&quot;&gt;lexicographical sorting&lt;/a&gt;, used in dictionaries, applies lexicographical order which extends alphabetical order to words:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a&#xA;aa&#xA;aaa&#xA;aaron&#xA;ab&#xA;abandoned&#xA;abc&#xA;aberdeen&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;When programming this sort, however, we typically don't extend alphabetical ordering per se, but rather we extend the order of integers used for an encoding.  For example, the same sorting above through ASCII encoding is really:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;97&#xA;97 97&#xA;97 97 97&#xA;97 97 114 111 110&#xA;97 98&#xA;97 98 97 119 100 111 110 101 100&#xA;97 98 99&#xA;97 98 101 114 100 101 101 110&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It is this type of ordering that we're after here... lexicographical ordering by extension of &lt;em&gt;numeric comparison&lt;/em&gt; as opposed to alphabetical order.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you will be sorting positive integers by their ordered prime factorizations (ordered in the sense that the primes are listed smallest to largest).  To handle the special case number &lt;code&gt;1&lt;/code&gt;, we can simply say its prime factorization is an empty list, which lexicographically sorts prior to any other number's prime factorization.  We'll call this type of sorting factor sorting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the numbers from &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;10&lt;/code&gt;, factor sorted, are: &lt;code&gt;1 2 4 8 6 10 3 9 5 7&lt;/code&gt;.  To see why, here they are again with the ordered prime factorizations:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 1 []&#xA; 2 [2]&#xA; 4 [2 2]&#xA; 8 [2 2 2]&#xA; 6 [2 3]&#xA;10 [2 5]&#xA; 3 [3]&#xA; 9 [3 3]&#xA; 5 [5]&#xA; 7 [7]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a function or program that factor sorts a list of positive integers.  Input and output can be anything reasonable, so long as the input is in the specified arbitrary order and the correct output order is apparent from the output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Keep in mind that the output should be factor sorted numbers, not their prime factorization.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it matters, numbers in the input will always be &lt;code&gt;&amp;le; 7928&lt;/code&gt;, so:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The only primes in the prime factorization list are the first 1000 primes&lt;/li&gt;&#xA;&lt;li&gt;Composites have factors no larger than &lt;code&gt;89&lt;/code&gt; inclusive&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is code golf; shortest code in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3 4 5 6 7 8 9 10&#xA;-&amp;gt;&#xA;1 2 4 8 6 10 3 9 5 7&#xA;&#xA;100 200 300 400 500 600 700 800 900&#xA;-&amp;gt;&#xA;800 400 600 200 900 300 100 500 700&#xA;&#xA;1472 4417 1425 1452 4480 200 339 2868 3835 4760&#xA;-&amp;gt;&#xA;4480 1472 200 4760 1452 2868 1425 339 3835 4417&#xA;&#xA;2 4 6 46 62 466 622 4666 6238&#xA;-&amp;gt;&#xA;2 4 6 46 62 466 622 4666 6238&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot;&gt;sorting&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="58514" LastEditorUserId="58514" LastEditDate="2017-04-02T04:08:33.403" LastActivityDate="2017-04-02T04:08:33.403" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11961" PostTypeId="1" CreationDate="2017-04-02T15:41:55.583" Score="2" ViewCount="192" Body="&lt;p&gt;For a while now, &lt;code&gt;ppcg.ga&lt;/code&gt; has been a URL shortener for PPCG, and it has been used in many answers, like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/76604/open-the-browser-to-http-codegolf-stackexchange-com&quot;&gt;the answers to this question&lt;/a&gt;. However, upon visiting the link today, it redirected me to a sketchy-looking site (&lt;strong&gt;not&lt;/strong&gt; PPCG), and gave me some strange warnings about ads and stuff. I closed the page. So my question is: what has happened to &lt;code&gt;ppcg.ga&lt;/code&gt;? If it does not work, then should the answers that use it be deleted, edited, or locked?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's a screenshot:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/zedN1.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/zedN1.png&quot; alt=&quot;strange website&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="48922" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2017-04-03T19:24:53.840" Title="What ever happened to PPCG.GA?" Tags="|discussion|" AnswerCount="1" CommentCount="11" ClosedDate="2017-04-03T19:31:12.910" ContentLicense="CC BY-SA 3.0" />
  <row Id="11964" PostTypeId="1" CreationDate="2017-04-03T01:02:40.630" Score="-2" ViewCount="114" Body="&lt;p&gt;This is my second PPCG account and I deleted my first due to how unpleasant I found the site. My first account had around 500 rep and I was wondering if I could get that rep and put it onto my current account. I can't find any questions like this but thought it would be an issue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Obviously it isn't a life-or-death kind of problem but I just think it would be a nice ego boost to see the rep counter increase by 500 at once.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does anyone know if I can do this? My old account posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/107598/draw-an-asciirisk&quot;&gt;this&lt;/a&gt; question and the current username SE calls it is &lt;code&gt;user63571&lt;/code&gt; if that helps in any way?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2017-04-03T01:18:10.877" Title="Can I get my rep back?" Tags="|support|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11965" PostTypeId="2" ParentId="11964" CreationDate="2017-04-03T01:18:10.877" Score="1" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/help/merging-accounts&quot;&gt;help center&lt;/a&gt; goes over this:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;If you have two accounts that you would like to join together, please sign into either account, visit the &lt;a href=&quot;https://codegolf.stackexchange.com/contact&quot;&gt;contact form&lt;/a&gt; and select ‘I need to merge user profiles’. After you contact us, the Stack Exchange Team will reach out to verify that you own both accounts. If we can confirm your ownership, we will initiate a merge.&lt;/p&gt;&#xA;&lt;p&gt;If you can't remember how to log in, &lt;a href=&quot;https://codegolf.stackexchange.com/users/account-recovery&quot;&gt;go here&lt;/a&gt; and enter the email address you used to create the account you are trying to sign into.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Now, for what it's worth, you won't be taking rep from your other account, but rather taking that account and your current account, and merging them together. All of your old questions/answers on that account will now be associated with your current account.&lt;/p&gt;&#xA;&lt;p&gt;If you want to get your rep back &lt;em&gt;without&lt;/em&gt; merging the accounts, I'm afraid this is not possible. If you'd like to gain a lot of rep quickly, a great way is too look into earning &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5243/31716&quot;&gt;a bounty&lt;/a&gt;, or making more challenges/answers.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-03T01:18:10.877" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11967" PostTypeId="2" ParentId="11942" CreationDate="2017-04-03T11:20:20.517" Score="10" Body="&lt;h2&gt;We shouldn't&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The question as written puts the cart before the horse. Before asking how to do something, it's always worth asking whether there's any point to doing it. In this case, there is none.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5343/194&quot;&gt;reason for allowing unary&lt;/a&gt; as a number format for natural numbers is that it is the natural way of representing them in some languages. There is no language which has a unary format which is the natural way of representing floating point numbers (or, come to that, fixed point numbers or rational numbers). As the other answers to this question show, it's fitting a round peg into a square hole and it isn't going to help anyone.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-04-03T11:20:20.517" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11968" PostTypeId="2" ParentId="2140" CreationDate="2017-04-03T12:31:54.007" Score="5" Body="&lt;h1&gt;Part I: &lt;a href=&quot;https://codegolf.stackexchange.com/q/115217/8478&quot;&gt;Triangular Manhattan Distance&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h1&gt;Part II: Triangular Chebyshev Distance&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hexagonal-grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hexagonal-grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;hexagonal-grid&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Chebyshev_distance&quot; rel=&quot;nofollow noreferrer&quot;&gt;Chebyshev distance&lt;/a&gt; on a regular grid is the number of orthogonal or diagonal steps one needs to take to reach one cell from another. That is, we can move either through the edge of a cell, or through a corner, to a neighbouring cell.&lt;/p&gt;&#xA;&lt;p&gt;We can define a similar distance on other grids, for example the triangular grid. We can address the individual cells in the grid with the following indexing scheme, where each cell contains an &lt;code&gt;x,y&lt;/code&gt; pair:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    ____________________________________...&#xA;   /\      /\      /\      /\      /\&#xA;  /  \ 1,0/  \ 3,0/  \ 5,0/  \ 7,0/  \&#xA; / 0,0\  / 2,0\  / 4,0\  / 6,0\  / 8,0\&#xA;/______\/______\/______\/______\/______\...&#xA;\      /\      /\      /\      /\      /&#xA; \ 0,1/  \ 2,1/  \ 4,1/  \ 6,1/  \ 8,1/&#xA;  \  / 1,1\  / 3,1\  / 5,1\  / 7,1\  /&#xA;   \/______\/______\/______\/______\/___...&#xA;   /\      /\      /\      /\      /\&#xA;  /  \ 1,2/  \ 3,2/  \ 5,2/  \ 7,2/  \&#xA; / 0,2\  / 2,2\  / 4,2\  / 6,2\  / 8,2\  &#xA;/______\/______\/______\/______\/______\...&#xA;\      /\      /\      /\      /\      /&#xA; \ 0,3/  \ 2,3/  \ 4,3/  \ 6,3/  \ 8,3/&#xA;  \  / 1,3\  / 3,3\  / 5,3\  / 7,3\  /&#xA;   \/______\/______\/______\/______\/___...&#xA;   /\      /\      /\      /\      /\&#xA;  .  .    .  .    .  .    .  .    .  .&#xA; .    .  .    .  .    .  .    .  .    .&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Now the Chebyshev distance on this grid is again the minimal number of steps across edges or corners to get from one cell to another. So you can move from &lt;code&gt;3,1&lt;/code&gt; to any of its 12 neighbours:&lt;/p&gt;&#xA;&lt;p&gt;2,1    4,1    3,2    (through edges)&lt;/p&gt;&#xA;&lt;p&gt;3,0    1,2    5,2    (the opposite triangle through corners)&lt;/p&gt;&#xA;&lt;p&gt;2,0    4,0    1,1&lt;br /&gt;&#xA;5,1    2,2    4,2    (the other triangles through corners)&lt;/p&gt;&#xA;&lt;p&gt;For instance, the distance from &lt;code&gt;2,1&lt;/code&gt; to &lt;code&gt;7,2&lt;/code&gt; is &lt;code&gt;3&lt;/code&gt;. The shortest path is generally not unique, but one way to make the distance in 3 steps is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2,1 --&amp;gt; 4,1 --&amp;gt; 5,1 --&amp;gt; 7,2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given two coordinate pairs &lt;code&gt;x&lt;sub&gt;1&lt;/sub&gt;,y&lt;sub&gt;1&lt;/sub&gt;&lt;/code&gt; and &lt;code&gt;x&lt;sub&gt;2&lt;/sub&gt;,y&lt;sub&gt;2&lt;/sub&gt;&lt;/code&gt; from the above addressing scheme, return the Chebyshev distance between them.&lt;/p&gt;&#xA;&lt;p&gt;You may assume that all four inputs are non-negative integers, each less than 128. You may take them in any order and arbitrarily grouped (four separate arguments, a list of four integers, two pairs of integers, a 2x2 matrix, ...).&lt;/p&gt;&#xA;&lt;p&gt;You may write a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2419&quot;&gt;program or a function&lt;/a&gt; and use any of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447&quot;&gt;standard methods&lt;/a&gt; of receiving input and providing output.&lt;/p&gt;&#xA;&lt;p&gt;You may use any &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2028&quot;&gt;programming language&lt;/a&gt;, but note that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/&quot;&gt;these loopholes&lt;/a&gt; are forbidden by default.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest valid answer – measured in &lt;em&gt;bytes&lt;/em&gt; – wins.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;p&gt;Each test case is given as &lt;code&gt;x&lt;sub&gt;1&lt;/sub&gt;,y&lt;sub&gt;1&lt;/sub&gt; x&lt;sub&gt;2&lt;/sub&gt;,y&lt;sub&gt;2&lt;/sub&gt; =&amp;gt; result&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1,2 1,2 =&amp;gt; 0&#xA;0,1 1,1 =&amp;gt; 1&#xA;1,0 1,1 =&amp;gt; 1&#xA;2,1 7,2 =&amp;gt; 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Will add more test cases when I have a reference implementation.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-04T21:28:03.847" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="11969" PostTypeId="1" AcceptedAnswerId="11970" CreationDate="2017-04-03T12:40:41.333" Score="2" ViewCount="60" Body="&lt;p&gt;Example of automated leaderboard:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/61115/make-your-language-unusable&quot;&gt;Make your language unusable&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Stack Overflow now by default loads as HTTPS. This means that the existing snippet is broken, because it tries to request a http resource from a https page, and as such triggers a Mixed Content warning. Fixing the snippet requires changing the protocol of the 2 url functions from http to https. I have already verified that this solution works, but was unable to implement it anywhere because I do not have the required privilege.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem is that this script is used in many questions to automatically generate the leaderboard, and in each question it is duplicated. Fixing this would require a ton of effort, and while having this leaderboard is useful, I'm not sure whether fixing it for all questions is worth it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that this does not have anything to do with api.stackExchange not accepting any http requests. The problem is the mixed content warnings that prevent cross-protocol requests.&lt;/p&gt;&#xA;" OwnerUserId="14141" LastEditorUserId="68942" LastEditDate="2021-06-04T01:07:00.887" LastActivityDate="2021-06-04T01:07:00.887" Title="Stack Overflow migrating to HTTPS breaks automated leaderboards. Should we fix existing leaderboards?" Tags="|bug|status-completed|leaderboard|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11970" PostTypeId="2" ParentId="11969" CreationDate="2017-04-03T13:32:38.187" Score="4" Body="&lt;h2&gt;Yes, they should be fixed.&lt;/h2&gt;&#xA;&lt;p&gt;Considering that all other URLs on the site are being moved to HTTPS, it makes sense that we move the ones the get missed because they are part of a snippet.&lt;/p&gt;&#xA;&lt;p&gt;They should be changed from &lt;code&gt;http://&lt;/code&gt; to &lt;code&gt;https://&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-03T13:32:38.187" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11971" PostTypeId="2" ParentId="11961" CreationDate="2017-04-03T13:37:08.217" Score="6" Body="&lt;p&gt;Honestly, it'd be better if we don't use URL shorteners or alternate sites for questions like those, since things like this can happen. URLs like that can expire and be bought up by anybody, they could become malicious later.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question creator should consider not counting the URL in the byte-count or score instead. Besides, once someone finds a shortened URL, everyone else changes their answer to use it. So just skip the shorter URLs and leave the golfing to the answerer, not the URL, which is technically something &lt;em&gt;outside&lt;/em&gt; the scope of the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, as Dennis pointed out, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10166/12012&quot;&gt;URL shorteners / shortened URLs are a loophole&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="34718" LastEditDate="2017-04-03T19:24:53.840" LastActivityDate="2017-04-03T19:24:53.840" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="11972" PostTypeId="2" ParentId="2140" CreationDate="2017-04-03T15:55:12.993" Score="0" Body="&lt;h1&gt;Route the phone calls&lt;/h1&gt;&#xA;&lt;p&gt;The challenge is to take the 3 ascii cities with 3 zones and  (meta: in progress) and two phone numbers, you will return the cities with the phone lines that are used to connect the two calls replaced with a symbol of you choosing that is not used in the cities. (I will provide the cities at the end of this challenge post so you know).&lt;/p&gt;&#xA;&lt;h1&gt;Rules and notes&lt;/h1&gt;&#xA;&lt;p&gt;Everything must be the same except the phone lines (they will be the letter L)&lt;/p&gt;&#xA;&lt;p&gt;Standard rules&lt;/p&gt;&#xA;&lt;p&gt;The cities will be top down&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;The cities shown as is without newlines (the cities will be connected together with phone lines :)&lt;/p&gt;&#xA;&lt;p&gt;Two phone numbers (will be valid)in the format (xxxxxxxxxx)&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;The cities with the connected calls&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;p&gt;This is going to be a big project. I am not done writing the challenge for sure. I need cities and will start to make some but if anyone has cities or makes any I would be happy, a website with cities would also be pretty chill.&lt;/p&gt;&#xA;&lt;p&gt;Any advice welcome&lt;/p&gt;&#xA;&lt;p&gt;Also I am posting in sandbox as I have to get off the computer :P&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-03T15:55:12.993" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11976" PostTypeId="2" ParentId="2140" CreationDate="2017-04-04T03:09:38.220" Score="-1" Body="&lt;h1&gt;Highest code size∕output ratio to generate a large executable section inside an elf file.&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge is to create the shortest code in your language of choice or the tools of your choice &lt;em&gt;(like objcopy)&lt;/em&gt; that will &lt;strong&gt;create an &lt;a href=&quot;https://en.wikipedia.org/wiki/Executable_and_Linkable_Format&quot; rel=&quot;nofollow noreferrer&quot;&gt;elf file&lt;/a&gt; with a the executable section as large as possible&lt;/strong&gt;.&lt;br /&gt;&#xA;I mean that if I extract the&lt;code&gt;.text&lt;/code&gt; section of the &lt;a href=&quot;https://en.wikipedia.org/wiki/Executable_and_Linkable_Format&quot; rel=&quot;nofollow noreferrer&quot;&gt;elf binary&lt;/a&gt;, the resulting extracted file should be at least 90% of the &lt;a href=&quot;https://en.wikipedia.org/wiki/Executable_and_Linkable_Format&quot; rel=&quot;nofollow noreferrer&quot;&gt;elf binary&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Requirements&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;The program should takes the desired section size as input&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;code&gt;.text&lt;/code&gt; section name needs to corresponds to the executable section.&lt;/li&gt;&#xA;&lt;li&gt;The type of the &lt;code&gt;.text&lt;/code&gt; section should be&lt;code&gt;PROGBITS&lt;/code&gt;and it should contains instructions.&lt;/li&gt;&#xA;&lt;li&gt;The elf file should have a &lt;code&gt;.shstrtab&lt;/code&gt; section.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;code&gt;.text&lt;/code&gt; section should be readable and writable.&lt;/li&gt;&#xA;&lt;li&gt;The target architecture should be Pnacl or armelv7 or x86_64.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Executable_and_Linkable_Format&quot; rel=&quot;nofollow noreferrer&quot;&gt;elf file&lt;/a&gt; should be valid and pass Google nacl’s &lt;a href=&quot;https://chromium.googlesource.com/native_client/src/native_client.git/+/master/src/trusted/validator_arm/armv7.table&quot; rel=&quot;nofollow noreferrer&quot;&gt;validation&lt;/a&gt; &lt;a href=&quot;https://chromium.googlesource.com/native_client/src/native_client.git/+/master/src/trusted/validator_ragel/instruction_definitions/&quot; rel=&quot;nofollow noreferrer&quot;&gt;whitelist&lt;/a&gt; in order to be loaded &lt;em&gt;(but I don´t care if the sandbox segfault)&lt;/em&gt;.&lt;br /&gt;&#xA;If you have &lt;strong&gt;no idea about what Google native client is&lt;/strong&gt;, just create a &lt;strong&gt;script that call the patched version of binutils from the nacl_sdk&lt;/strong&gt;, or make sure the elf file is valid and can be executed on Linux.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Of course, you normally can’t use a compiler because it would takes too much computational years in order to finish.&lt;/p&gt;&#xA;&lt;h1&gt;Winner&lt;/h1&gt;&#xA;&lt;p&gt;The answer with the highest code size∕program output ratio.&lt;/p&gt;&#xA;" OwnerUserId="50239" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-06T12:13:33.760" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="11977" PostTypeId="2" ParentId="2140" CreationDate="2017-04-04T04:42:07.507" Score="0" Body="&lt;h1&gt;Find the Least Conforming Word&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Given a list of words, find which word follows Zipf's Law the least.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For each distinct word &lt;code&gt;w&lt;/code&gt; in this list, we know the following two properties of &lt;code&gt;w&lt;/code&gt; in this list:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Its frequency in the list (that is, the number of occurrences of it divided by the number of elements in the list), and&lt;/li&gt;&#xA;&lt;li&gt;Its frequency rank; that is, the number of words that occur more often than it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In the case that two words have the same frequency, we assume the one that comes first when sorted by lexicographical order is first.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we plot a large list of words with regular natural language distribution on a logarithmic graph with these two properties as the &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; values, we see that the points form nearly a straight line with slope of approximately &lt;code&gt;-1&lt;/code&gt;. This is known as &lt;a href=&quot;https://en.wikipedia.org/wiki/Zipf%27s_law&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Zipf's Law&lt;/strong&gt;&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You will be given a list of words &lt;code&gt;l&lt;/code&gt;. Imagine each distinct word being plotted this way on a logarithmic graph. Then, the line &lt;code&gt;k&lt;/code&gt; is the &lt;a href=&quot;https://en.wikipedia.org/wiki/Linear_regression&quot; rel=&quot;nofollow noreferrer&quot;&gt;Linear Regression Line&lt;/a&gt; for the data set. Then, for every point &lt;code&gt;p&lt;/code&gt; except the top-most ranking and most frequent point, find the vertical distance to the line &lt;code&gt;k&lt;/code&gt;, and let this distance be &lt;code&gt;d&lt;/code&gt;. Then, we scale the vertical distance so that points in the middle of the line will be the most heavily weighted. We do this by the following. We find the &lt;code&gt;x&lt;/code&gt; coordinate of the mid-point of the line (let this be &lt;code&gt;x&lt;/code&gt;). Then, half of the horizontal span of the line is &lt;code&gt;w&lt;/code&gt;, the width. If we let &lt;code&gt;px&lt;/code&gt; be the &lt;code&gt;x&lt;/code&gt; coordinate of the point &lt;code&gt;p&lt;/code&gt;, then we multiply &lt;code&gt;d&lt;/code&gt; by &lt;code&gt;1 - (x - px) / w&lt;/code&gt;. This value is the score.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The input will be an unordered list of words in any reasonable format you wish.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The output will be a single word indicating which word conforms the least to the &quot;standard&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test Case&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;code&gt;a a a a a a a a a a b b b b b b b c c c c c d d&lt;/code&gt;&lt;br&gt;&#xA;Output: &lt;code&gt;b&lt;/code&gt;&lt;br&gt;&#xA;See an &lt;a href=&quot;https://pastebin.com/BfcD9XS8&quot; rel=&quot;nofollow noreferrer&quot;&gt;explanation here&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user42649" LastEditorDisplayName="user42649" LastEditDate="2017-04-04T13:37:05.213" LastActivityDate="2017-04-04T13:37:05.213" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11978" PostTypeId="1" AcceptedAnswerId="11979" CreationDate="2017-04-04T07:45:07.863" Score="0" ViewCount="91" Body="&lt;p&gt;The title says it all. I reached my daily limit today and noticed that one of my questions was upvoted &lt;em&gt;after&lt;/em&gt; I reached the daily limit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What happens to the reputation? Do I get it tomorrow or is it lost into the ether?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2017-05-12T16:49:41.650" Title="What happens if I get upvoted but have already reached the daily limit?" Tags="|discussion|policy|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="11979" PostTypeId="2" ParentId="11978" CreationDate="2017-04-04T07:51:44.833" Score="3" Body="&lt;p&gt;Receiving upvotes after hitting the rep cap have do not alter your reputation, neither at the moment nor at a later date.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From &lt;a href=&quot;https://meta.stackexchange.com/a/7238/170332&quot;&gt;How does &quot;Reputation&quot; work?&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;You can earn a maximum of +200 reputation from upvotes and suggested edits in any given &lt;a href=&quot;https://meta.stackexchange.com/questions/27199/what-is-an-se-day-when-does-each-day-start&quot;&gt;day&lt;/a&gt;. Bounties and the bonuses for accepted answers are counted separately (&lt;a href=&quot;https://blog.stackoverflow.com/2010/03/the-great-reputation-recalc-begins/&quot;&gt;source&lt;/a&gt;). &lt;strong&gt;Reputation “lost” from the reputation cap is not awarded on following days.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;emphasis mine&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See also: &lt;a href=&quot;https://meta.stackexchange.com/questions/22447/what-is-the-reasoning-behind-the-reputation-cap&quot;&gt;What is the reasoning behind the reputation cap?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2017-04-04T07:56:42.030" LastActivityDate="2017-04-04T07:56:42.030" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="11981" PostTypeId="2" ParentId="11924" CreationDate="2017-04-04T11:46:21.120" Score="2" Body="&lt;h1&gt;Sinclair ZX80 BASIC (4K ROM)&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The ZX80 BASIC has a limited interpreter which lacks many keywords and has only upper-case characters and an inversed version of those upper-case characters. Its character set is non-ASCII compliant, and generally will only read and write to the screen and cassette tape. There are no ways to draw to the screen without the enhanced ZX81 ROM unless one PRINTs to the screen, or works out where the DFILE (screen location) is in RAM and POKEs individual bytes to the screen. The recent ZXPand allows your ZX80 to read and write to an SD card, although this requires a special kit for the ZX80. An emulator such as EightyOne will simulate a real ZX80 with a ZXPand.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Program that prints&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 10 PRINT &quot;HELLO MUM&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Sub routines&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 10 PRINT &quot;HELLO &quot;;&#xA; 20 GO SUB 100&#xA; 30 STOP&#xA;100 PRINT &quot;MUM&quot;&#xA;110 RETURN&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Variables&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 10 LET A$=&quot;HELLO &quot;&#xA; 20 LET B$=&quot;MUM&quot;&#xA; 30 PRINT A$;B$&#xA; 40 LET X=100&#xA; 50 LET Y=200&#xA; 60 PRINT X,Y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Loops&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 10 FOR I=0 TO 10&#xA; 20 PRINT I,;&#xA; 30 NEXT I&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or if you don't want to count up in steps of 1 then&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 10 LET I=0&#xA; 20 PRINT I,;&#xA; 30 LET I=I+2&#xA; 40 IF I&amp;lt;10 THEN GO TO 20&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Reading the keyboard&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 10 INPUT A$&#xA; 20 PRINT &quot;YOU TYPED THE FOLLOWING STRING:&quot;&#xA; 30 PRINT A$&#xA; 40 INPUT A&#xA; 50 PRINT &quot;YOU ENTERED THE FOLLOWING INTEGER:&quot;&#xA; 60 PRINT A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Please note there is no variant of &lt;code&gt;INKEY$&lt;/code&gt; or &lt;code&gt;GET&lt;/code&gt; statement on the Sinclair ZX80 with 4K ROM.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Handling floating point numbers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Well, this is a tough one but let's assume that you want to print prices of items that are priced from £0.01p through to £327.67p, here is one way of doing it:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 10 INPUT M&#xA; 20 LET M=ABS(M)&#xA; 30 LET S$=&quot;.&quot;&#xA; 40 PRINT M/100;S$;&#xA; 50 LET R$=STR$(M)&#xA; 60 IF M&amp;lt;10 THEN PRINT &quot;0&quot;;&#xA; 70 IF M&amp;gt;99 THEN LET R$=TL$(R$)&#xA; 80 IF M&amp;gt;999 THEN LET R$=TL$(R$)&#xA; 90 IF M&amp;gt;9999 THEN LET R$=TL$(R$)&#xA;100 PRINT R$&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Basically, do them maths in integers, print your results divided by 100, pass your M variable to a string and shift the string left one character based on the value of M until you get to your pence. Or if M&amp;lt;10 then print a leading zero. I'm sure that you can think of a better solution to break the 327.67 barrier with this above symbolic listing.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Truthy/Falsey&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The ZX80 returns &lt;code&gt;-1&lt;/code&gt; if true or &lt;code&gt;0&lt;/code&gt; if false. In order to do a not equals, one must use the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 10 LET A$=&quot;1&quot;&#xA; 20 LET B$=&quot;2&quot;&#xA; 30 IF NOT A$=B$ THEN PRINT &quot;NOT EQUALS&quot;&#xA; 40 IF A$=B$ THEN PRINT &quot;EQUALS&quot;&#xA; 50 PRINT 1=2&#xA; 60 PRINT 2=2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Animation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is not really possible without using machine code as the screen is switched off whilst the BASIC interpreter computes. You will only get a static screen when waiting for a keyboard input with INPUT.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Color [SIC] text/graphics&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The ZX80 has only a monochrome display&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Obfuscating and minimizing listings&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The ZX80 does not accept BASIC minimization or multi-statemented lines, like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 10 PRINT &quot;HELLO MUM &quot;;: GO TO 10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;White spaces are automatically added when typing in your listing, and there are no keyword abbreviations. BASIC keywords are tokenized.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Standard input/output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This might not have been such a formalised thing in 1980, so standard in could mean reading from the keyboard to a variable or from a cassette player (or the virtual equivalent) - and standard out could mean writing to the screen, or storing data to a variable, or recording data to a cassette tape (or again virtual equivalent).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The easiest way to know how many bytes your ZX80 program listing (in the BASIC interpreter) are counted is by using the &lt;code&gt;SAVE&lt;/code&gt; command and the &lt;a href=&quot;https://sourceforge.net/projects/eightyone-sinclair-emulator/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Eighty One Emulator&lt;/a&gt;. Start the emulator on ZX80 mode; you will need the keyboard helper thanks to Sinclair's wonderful &quot;one-touch&quot; BASIC entry system. In the &lt;code&gt;Tools&lt;/code&gt; menu, ensure that you have the &lt;code&gt;Tape manager...&lt;/code&gt; enabled (alternatively, &lt;code&gt;CTRL + F9&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now save an empty file by pressing &lt;code&gt;E&lt;/code&gt; and &lt;code&gt;NEW LINE&lt;/code&gt; [Enter on your PC keyboard]. In the &lt;code&gt;Tape manager&lt;/code&gt; window, you will see how much an empty file takes as it will save all current memory even if there is no program there. It should say &lt;code&gt;41 Bytes&lt;/code&gt;, though this may differ if you have 16K enabled.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now enter your program.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 10 PRINT &quot;HELLO&quot;&#xA; 20 GO TO 10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;should be 58 bytes saved, so that program is 17 bytes in size, as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;two bytes per line number (&lt;code&gt;10&lt;/code&gt; and &lt;code&gt;20&lt;/code&gt; is four bytes);&lt;/li&gt;&#xA;&lt;li&gt;one token each for the &lt;code&gt;PRINT&lt;/code&gt; and &lt;code&gt;GO TO&lt;/code&gt;;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;HELLO&quot;&lt;/code&gt; is seven bytes;&lt;/li&gt;&#xA;&lt;li&gt;two bytes for the &lt;code&gt;10&lt;/code&gt; in line &lt;code&gt;20&lt;/code&gt; (&lt;code&gt;GO TO 10&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;and one byte per line for the line break&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Unconditional loops&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Yes, the GO TO keyword exists.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Object Orientation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Err...&lt;/p&gt;&#xA;" OwnerUserId="61603" LastEditorUserId="61603" LastEditDate="2019-08-12T21:34:19.283" LastActivityDate="2019-08-12T21:34:19.283" CommentCount="4" CommunityOwnedDate="2017-04-04T11:46:21.120" ContentLicense="CC BY-SA 4.0" />
  <row Id="11983" PostTypeId="2" ParentId="2140" CreationDate="2017-04-04T14:09:44.787" Score="0" Body="&lt;h1&gt;Lock the Language!&lt;/h1&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; challenge.&lt;/p&gt;&#xA;&lt;h2&gt;Cop's Thread:&lt;/h2&gt;&#xA;&lt;h3&gt;Challenge:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Write a program that given two arbitrary integers adds those and prints them to STDOUT&lt;/li&gt;&#xA;&lt;li&gt;In this Thread you post the fully working solution including language&lt;/li&gt;&#xA;&lt;li&gt;The robbers will try to find any other language where an anagram of your source code will also add two integers&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The language has to be a different one then yours&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Different versions of the same language don't count as different languages&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;After 5 days you're code is safe and can't be cracked any more&lt;/li&gt;&#xA;&lt;li&gt;If you're code is cracked you mark that in the header of the answer and add a link to the crack in the robbers thread&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Winning criteria:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The shortest safe program (in bytes) wins.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Robber's Thread&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The cops wrote an addition program you want to steal&lt;/li&gt;&#xA;&lt;li&gt;Since the cops encrypted it so you can't use the same language as the cop you stole the program from used, so you have to use an different language&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Different versions of the same language are count as the same language&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;You may use the cops character set in any order (anagram)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Winning criteria:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The robber with the most cracked answers wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56341" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-04T14:09:44.787" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="11985" PostTypeId="2" ParentId="2140" CreationDate="2017-04-04T14:57:46.920" Score="-2" Body="&lt;h1&gt;Code - Decode&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Cops:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a program or functon wich otuputs encrypted alphabetic input.&#xA;The same program or function has to be used to encrypt and decrypt messages as the case of &lt;a href=&quot;https://en.wikipedia.org/wiki/ROT13&quot; rel=&quot;nofollow noreferrer&quot;&gt;ROT13&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You have to post in your answer:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Languaje and length of your program&lt;/li&gt;&#xA;&lt;li&gt;The encrypted output of the input &quot;CODE GOLF&quot;&lt;/li&gt;&#xA;&lt;li&gt;Two more examples of crypted - unencrypted strings&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Example:&lt;/p&gt;&#xA;  &#xA;  &lt;h2&gt;Bash, 30 chars&lt;/h2&gt;&#xA;  &#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;&quot;CODE GOLF&quot; &amp;lt;=&gt; &quot;PBQR TBYS&quot;&lt;/li&gt;&#xA;  &lt;li&gt;&quot;SHA&quot; &amp;lt;=&gt; &quot;FUN&quot;&lt;/li&gt;&#xA;  &lt;li&gt;&quot;Why did the chicken cross the road?&#xA;  Gb trg gb gur bgure fvqr!&quot; &amp;lt;=&gt; &quot;Jul qvq gur puvpxra pebff gur ebnq?&#xA;  To get to the other side!&quot;&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;You may post your program code an decpription of your crypting algorithm once is considered safe.&#xA;Shortest uncracked answer wins.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Example:&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;code&gt;tr '[A-Za-z]' '[N-ZA-Mn-za-m]'&lt;/code&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;This bash command crypts and decrypts messages shifting each letter 13 positions in the alphabet.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Robbers:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a program or function wich otuputs encrypted alphabetic input.&#xA;The same program or function has to be used to encrypt and decrypt messages as the case of &lt;a href=&quot;https://en.wikipedia.org/wiki/ROT13&quot; rel=&quot;nofollow noreferrer&quot;&gt;ROT13&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code has to pass test cases posted on one of the COPS post.&#xA;The user who cracks most wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Extra bonus&lt;/strong&gt; if your code cracks more than one answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cryptography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cryptography&amp;#39;&quot; rel=&quot;tag&quot;&gt;cryptography&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/encryption&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;encryption&amp;#39;&quot; rel=&quot;tag&quot;&gt;encryption&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="67067" LastEditorUserId="67067" LastEditDate="2017-04-04T15:19:50.817" LastActivityDate="2017-04-04T15:19:50.817" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="11986" PostTypeId="1" CreationDate="2017-04-04T15:15:41.190" Score="8" ViewCount="154" Body="&lt;p&gt;The only such language I can think of now is Excel. It has different function names in different language versions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some submissions can be made shorter by changing the language from the language default on this site, namely English.&lt;br&gt;&#xA;This may also be used in obfuscation challenges (although in my opinion you should specify the locale version you're using).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Is it fair to use the specific locale versions of the same programming language?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note: It's not about locale-specific output &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/209/what-about-locale-sensitive-output&quot;&gt;(like here)&lt;/a&gt;, but the function names being different in different locales&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="55372" LastActivityDate="2017-04-05T15:09:19.173" Title="Languages with locale-specific functions" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11987" PostTypeId="2" ParentId="11942" CreationDate="2017-04-04T16:03:10.317" Score="1" Body="&lt;p&gt;Use two numbers, a and b, to represent a/2^b or a/2^(b-1), whichever is more convenient. This is like how floating point numbers stored internally in most languages and architectures.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, &lt;code&gt;11111111111 111&lt;/code&gt; means 11/2^3 = 1.375.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I doubt this would be the most natural way to to represent (approximated) real numbers. But you are asking about floating-point numbers, not rationals or fixed-point numbers.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2017-04-04T16:03:10.317" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="11988" PostTypeId="2" ParentId="11924" CreationDate="2017-04-04T16:03:16.887" Score="5" Body="&lt;h1&gt;Sed&lt;/h1&gt;&#xA;&lt;p&gt;As sed doesn't have functions, submissions will be complete programs, with input and output via the standard streams.&lt;/p&gt;&#xA;&lt;h2&gt;Programs with no input&lt;/h2&gt;&#xA;&lt;p&gt;Sometimes a question asks only for output, and doesn't specify providing any input. Because sed is incapable of producing any output unless there's at least one line of input, you should assume in these cases that the input consists of a single newline character.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Programs are normally in single-byte character encodings, so counting characters is generally sufficient.  Interpreter flags need to be added, as normal; for example, +1 if your program requires &lt;code&gt;-r&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Numeric I/O&lt;/h2&gt;&#xA;&lt;p&gt;Unary is the most useful numeric format for sed, if the question doesn't specifically bar that.  It &lt;em&gt;is&lt;/em&gt; possible to use sed for arithmetic; although it's unlikely to win any &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, it's certainly an entertaining challenge!&lt;/p&gt;&#xA;&lt;h2&gt;Tips&lt;/h2&gt;&#xA;&lt;p&gt;See &lt;a href=&quot;//codegolf.stackexchange.com/q/51323&quot;&gt;tips&lt;/a&gt; on the main site.&lt;/p&gt;&#xA;" OwnerUserId="39490" LastEditorUserId="-1" LastEditorDisplayName="user62131" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-21T17:23:55.423" CommentCount="2" CommunityOwnedDate="2017-04-04T16:03:16.887" ContentLicense="CC BY-SA 3.0" />
  <row Id="11990" PostTypeId="2" ParentId="2140" CreationDate="2017-04-04T17:00:20.713" Score="1" Body="&lt;h2&gt;Dice Roller&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Since I have played a lot of tabletop role playing games, I am looking for an easy to use dice roller. But also being lazy, I would like to have the shortest possible solution, making this code-golf.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will receive as input a string, composed of 2 or 4 variables.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the case of 2 parameters, both non-negative numbers, they represent the number of dice and the value of the dice rolled.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;2 6&quot; means rolling 2 6-sided die (colloquially written 2d6).&#xA;&quot;3 8&quot; means rolling 3 8-sided die (3d8).&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In the case where 4 parameters are given, the first 2 are still numbers, as in the case of 2 parameters. The third and forth parameters represent a dice modifier, and whether the modified applies to the dice individually or the sum of all rolled values, respectively. The third parameter is a (possibly) signed number (e.g.: 2, +1, -2, ...), and the forth is a character string, either 'ind' (if the modifier applies to the individual dice) or 'all' (applies to the total sum of the dice rolled).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;2 6 +1 ind&quot; means rolling 2 6-sided die, and a modifier of +1 is applied to each individual die (can be written 2d(6+1)).&#xA;&quot;3 8 -4 all&quot; means rolling 3 8-sided die, and a modifier of -4 is applied to the sum of the roll (can be written (3d8)-4).&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Dice Properties&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Only the following dice are acceptable (second parameter): 2 3 4 6 8 10 12 20 100.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Regardless of modifier, a dice gives at least a value of 1 when an individual modifier is applied (so for example, &quot;1 6 -10 ind&quot; will return a value of 1, the minimum value allowed by this stipulation). There is no max value to an individual modifier.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When a modifier is applied to the sum of the dice rolled (4th parameter is &quot;all&quot;), the sum can be less that the number of dice rolled. For example, &quot;2 6 -20 all&quot; will give a sum range of -18 to -8, as the lowest value of 2d6 is 2 and highest value is 12, pre-modifier. There is no min or max value to a this modifier.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output will be the values of the individual dice rolled, and the sum of all the dice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Valid examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;2 6&quot; =&amp;gt; &quot;3 6 : 9&quot;&#xA;&quot;3 8&quot; =&amp;gt; &quot;1 8 5 : 14&quot;&#xA;&quot;2 6 -1 ind&quot; =&amp;gt; &quot;1 2 : 3&quot;&#xA;&quot;2 6 -10 ind&quot; =&amp;gt; &quot;1 1 : 2&quot;&#xA;&quot;3 8 +1 ind&quot; =&amp;gt; &quot;2 9 6 : 17&quot;&#xA;&quot;2 6 10 all&quot; =&amp;gt; &quot;3 6 : 19&quot;&#xA;&quot;2 6 -10 all&quot; =&amp;gt; &quot;3 6 : -1&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Invalid examples (incorrect results):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;2 6&quot; =&amp;gt; &quot;3 7 : 10&quot; (7 is not a valid result on a 6-sided die)&#xA;&quot;3 8&quot; =&amp;gt; &quot;1 8 : 9&quot; (not enough dice rolled)&#xA;&quot;3 8&quot; =&amp;gt; &quot;1 8 5 4 : 18&quot; (too many dice rolled)&#xA;&quot;2 6 -1 ind&quot; =&amp;gt; &quot;1 6 : 7&quot; (6 is not a valid result on a 6-sided die with a -1 modifier applied)&#xA;&quot;2 6 -1 ind&quot; =&amp;gt; &quot;0 5 : 5&quot; (the die has to have a minimum value of 1 with individually applied modifier)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="15367" LastEditorUserId="15367" LastEditDate="2017-04-04T18:46:41.040" LastActivityDate="2017-04-04T18:46:41.040" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="11991" PostTypeId="2" ParentId="2140" CreationDate="2017-04-04T18:20:55.080" Score="-4" Body="&lt;h1&gt;Popularly print the input&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;h1&gt;Goal&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program or function in a language of your choice that takes input and outputs that exact input.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Specifications&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program/function should output the exact input in any reasonable way.&lt;/li&gt;&#xA;&lt;li&gt;Your program &lt;strong&gt;does not&lt;/strong&gt; have to end after printing the input. It may end up in an infinite loop if you wish, as long as that loop doesn't output any extraneous characters.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Winner&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The winning answer will be the one that has the highest score. Voters should look for answers that use an unique way to print the input, have a special source code or use neat language features.&lt;/p&gt;&#xA;" OwnerUserId="63774" LastActivityDate="2017-04-04T18:20:55.080" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11992" PostTypeId="2" ParentId="2140" CreationDate="2017-04-04T19:15:57.693" Score="0" Body="&lt;h1&gt;Comment polyglot&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;From an original idea by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/11259/digital-trauma&quot;&gt;Digital Trauma&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This challenge requires you to write a polyglot which contains a comment in as many languages as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The comment must say &lt;code&gt;This is a polyglot comment&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program must do nothing at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner is whoever writes the polyglot with most languages!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The rules&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your submission should consist of a full program whose source contains the text &quot;This is a polyglot comment&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For each language of the polyglot, your code executed in that language should:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take no input&lt;/li&gt;&#xA;&lt;li&gt;Generate no errors.&lt;/li&gt;&#xA;&lt;li&gt;Produce either no output or the same output produced by the empty program in this language.&lt;/li&gt;&#xA;&lt;li&gt;Still comply to the previous rules if &lt;em&gt;any&lt;/em&gt; part of &lt;code&gt;This is a polyglot comment&lt;/code&gt; is removed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Addictionally, &lt;em&gt;there can be no superflous code&lt;/em&gt;. This means that it should not be possible to remove a subset of characters (outside of the comment) and still have a submission that complies to the previous rules for all the languages of the polyglot.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ok? Ok. Now please wait a minute before running to see how many languages you can find that use &lt;code&gt;#&lt;/code&gt; for comments, because we have one more rule:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We define a character of your source as &lt;strong&gt;required&lt;/strong&gt; for a language if removing that character makes the program change its behavior for that language (this could mean for example changing its output or producing an error). &lt;em&gt;The sets of required characters for each language must all be distinct&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example submission&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#This is a polyglot comment&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A polyglot in Python and Brainfuck for a score of 2. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The set of required characters for Brainfuck is empty. This is perfectly valid, as long as no other set is empty.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The set of required characters for Python is composed of just the first &lt;code&gt;#&lt;/code&gt;. We can't add Bash to this submission because it would share the same set.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That's all, good luck and have fun!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Sandbox question:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do you see any potential loopholes in the rules?&lt;/li&gt;&#xA;&lt;li&gt;Should I add some other factors to the score (like code length for example) or is the number of languages enough?&lt;/li&gt;&#xA;&lt;li&gt;Anything else I've missed?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="62393" LastEditorUserId="62393" LastEditDate="2017-04-04T21:19:59.890" LastActivityDate="2017-04-04T21:19:59.890" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="11993" PostTypeId="2" ParentId="2140" CreationDate="2017-04-04T22:43:47.197" Score="-2" Body="&lt;h1&gt;Shortest “Hello World” for common journaled file systems.&lt;/h1&gt;&#xA;&lt;p&gt;Create a valid file system image as small as possible containing a file or a folder labeled “Hello World” with the following constraint:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the hello world is a regular file, it needs to not be empty.&lt;/li&gt;&#xA;&lt;li&gt;The file system needs to one of the following: &lt;strong&gt;ntfs3.1 ext3/ext4 zfs btrfs hfsplus&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Please note you won’t be able to create the smallest file system with normal fomatting tool.&lt;br /&gt;&#xA;I mean they don’t allows to create the smallest theoriticall size.&lt;/p&gt;&#xA;&lt;h2&gt;Winner&lt;/h2&gt;&#xA;&lt;p&gt;The answer with the smallest file system&lt;/p&gt;&#xA;" OwnerUserId="50239" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-04T23:05:05.127" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="11995" PostTypeId="2" ParentId="2140" CreationDate="2017-04-05T11:38:08.623" Score="0" Body="&lt;h1&gt;Operation Permutations &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We're likely all familiar with the order of operations; the precedence rules that we use to govern basic arithmatic. Most schoolchildren are taught this order using an acronym such as &quot;BODMAS&quot;, &quot;BIDMAS&quot;, or &quot;PEMDAS&quot;. There's no common consensus on the 'right' acronym to use, with the one that you learnt depending on the country you went to school in, or even the teacher who taught you. Your challenge is to determine the validity of an order of operations acronym (&lt;strong&gt;O3A&lt;/strong&gt;), even if it's so unpronounceable that no-one would ever actually use it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge Specification&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input for this program is guaranteed to be exactly six characters. Your program can require upper-case, require lower-case, or be case agnostic. You may accept this input in any manner that you please.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each character is guaranteed to be one of the following: (B, P, I, O, E, D, M, A, S). Furthermore, each character is guaranteed to appear at most only once in the input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following characters correspond to the following operations:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;| Characters | Operation      |&#xA;| ---------- | -------------- |&#xA;| (B, P)     | Brackets       |&#xA;| (I, O, E)  | Exponentiation |&#xA;| D          | Division       |&#xA;| M          | Multiplication |&#xA;| A          | Addition       |&#xA;| S          | Subtraction    |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program must yield a truthy value for a valid O3A, and a falsy value for an invalid one. Your program is not expected to handle input not matching the above specification.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;O3A Validity&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first character in a valid O3A must correspond to 'Brackets'. Likewise, the second character in a valid O3A must correspond to 'Exponentiation'. The next two characters must correspond to 'Division' and 'Multiplication', but either order is valid as these operations are on the same precedence level. The final two characters must correspond to 'Addition' and 'Subtraction', but again, either order is valid. Any other O3As are invalid.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Testing&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Reference Implementation&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following Python 3 reference implementation is given for guidance. Note that while this reference implementation is case-agnostic, your program does not need to be.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def validate(acronym):&#xA;    acronym = acronym.upper()&#xA;&#xA;    if acronym[0] not in {&quot;B&quot;, &quot;P&quot;}:&#xA;        return False&#xA;&#xA;    if acronym[1] not in {&quot;I&quot;, &quot;O&quot;, &quot;E&quot;}:&#xA;        return False&#xA;&#xA;    if set(acronym[2:4]) != {&quot;D&quot;, &quot;M&quot;}:&#xA;        return False&#xA;&#xA;    if set(acronym[4:6]) != {&quot;A&quot;, &quot;S&quot;}:&#xA;        return False&#xA;&#xA;    return True&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;BIDMAS =&amp;gt; True&#xA;PEMDAS =&amp;gt; True&#xA;PIDMSA =&amp;gt; True&#xA;BOMDAS =&amp;gt; True&#xA;BMIDAS =&amp;gt; False&#xA;IBMDAS =&amp;gt; False&#xA;BODAMS =&amp;gt; False&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code wins counted in bytes.&lt;/li&gt;&#xA;&lt;li&gt;Standard rules and loopholes apply&lt;/li&gt;&#xA;&lt;li&gt;Check meta for consensus&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;My worry with this challenge is that it would be so trivially regex-able in something like &lt;em&gt;Retina&lt;/em&gt; that it wouldn't be fun.  I'd like feedback from others about this before going live.&lt;/p&gt;&#xA;" OwnerUserId="61762" LastActivityDate="2017-04-05T11:38:08.623" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="11999" PostTypeId="2" ParentId="11986" CreationDate="2017-04-05T15:09:19.173" Score="12" Body="&lt;p&gt;Sounds perfectly fair to me, just like using a certain dialect of a programming language or inventing your own.&lt;/p&gt;&#xA;" OwnerUserId="64080" LastActivityDate="2017-04-05T15:09:19.173" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12001" PostTypeId="2" ParentId="2140" CreationDate="2017-04-05T15:46:36.257" Score="1" Body="&lt;h1&gt;QR Code Editing: Minimum Change&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;?  This is pretty non-trivial, and finding optimal solutions is probably computationally difficult.&lt;/p&gt;&#xA;&lt;p&gt;QR codes are a way to represent URLs and other strings of text using a 2D image.  What you might not know, however, is that a significant portion of a QR code is error-correction or unused space.&lt;/p&gt;&#xA;&lt;p&gt;In this challenge, your program will be given a square of &lt;code&gt;1&lt;/code&gt;s and &lt;code&gt;0&lt;/code&gt;s representing a QR code.  This QR code may not be functional, or it may be valid or point to some destination.  Your program will also receive a string, representing the data that the new QR code should be encoded with. The goal of the program is edit the original QR code to contain the new content, but also to do it with as few pixel-flips as possible.&lt;/p&gt;&#xA;&lt;p&gt;Here's an image describing some parts of the QR format:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/20Icw.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/20Icw.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;QR code art generator, demonstrating how much of a QR code's space can be modified without changing the content: &lt;a href=&quot;https://www.qrpixel.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.qrpixel.com/&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Spec is only partially completed, I'll probably have to find some decent resources on QR code formats and error correction.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-06T21:57:49.753" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12002" PostTypeId="1" CreationDate="2017-04-05T16:08:11.730" Score="0" ViewCount="84" Body="&lt;p&gt;I know that betting reputation is strongly against the aim of this site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I propose a guessing game on Codegolf (without betting reputation).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It might work in this way: after a challenge has been posted and before the first answer is given each user could try to guess which language will have the shortest code after (say) one week.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since betting reputation is out of question, there could be a sort of scoring specific for this, with hats, pins, badges or other rewards of this kind for those who guess the language that will score the shortest code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I noticed that in CodeGolf the ratio of page views/nr of answers is high, so I suppose that many people just lurk (I do not think that users go there looking for answers to &quot;practical&quot; questions). I follow sometimes the golfing to learn algorithms or tricks in Js/C# or other mainstream languages, even if those languages rarely win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It would be a way to be somewhat active in golf for those users who follow it but for any reason do not actively try to give answers. Moreover, to make a good guess some thinking is required considering the peculiar needs of the challenge and advantages of different languages in meeting those needs.&lt;/p&gt;&#xA;" OwnerUserId="17235" LastActivityDate="2017-04-05T16:44:40.987" Title="Guessing the winning language" Tags="|discussion|code-challenge|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12004" PostTypeId="2" ParentId="12002" CreationDate="2017-04-05T16:44:40.987" Score="4" Body="&lt;p&gt;I think this could be a fun game, but there are two major problems:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Some users might not enjoy it, or find it distracting from the main purpose of the site. And&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There is basically no way to officially implement this. We already have a list of features we'd like to have implemented specifically for PPCG, and I doubt this one would be approved if requested.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This leads me to the following idea: &lt;strong&gt;Make a chatroom!&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since anyone can create a chatroom, it would be perfectly easy to implement and host your own unofficial game. And another advantage would be that only users who are interested in playing will ever see this game, since you'll have to participate in the room to notice the game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Obviously, there are a lot of logistical issues you'll have to figure out first, such as &lt;em&gt;badges, scoring, points, leaderboards, etc.&lt;/em&gt; but these could be figured out by discussing it &lt;em&gt;in said room&lt;/em&gt;. And from there, you could discuss maybe even extending the game, for example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Guess the winning length&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Guess the length of the shortest program in &lt;em&gt;language &lt;code&gt;&amp;lt;x&amp;gt;&lt;/code&gt;&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Guess the number of answers&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Whatever else you think could be fun&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2017-04-05T16:44:40.987" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12005" PostTypeId="1" CreationDate="2017-04-05T18:21:55.097" Score="6" ViewCount="296" Body="&lt;p&gt;I know someone on this site (who I'm going to keep anonymous) who has 2 accounts. We've had a bit of an argument about whether this is allowed and I wanted to ask here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;He says that it's fine because he never upvotes, downvotes or gets involved in his questions or answers. I don't agree with this and think that I've seen posts &quot;condemning&quot;  multiple accounts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can anyone settle this argument?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;EDIT&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As pointed out by mbomb007, bounties are also an abuse of this. I have asked him and he says he has never given himself a bounty.&lt;/p&gt;&#xA;" OwnerDisplayName="user67719" LastEditorDisplayName="user67719" LastEditDate="2017-04-05T19:35:51.440" LastActivityDate="2017-04-05T19:35:51.440" Title="Multiple Accounts" Tags="|discussion|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12006" PostTypeId="2" ParentId="12005" CreationDate="2017-04-05T19:05:30.570" Score="14" Body="&lt;p&gt;There is no hard and fast answer about whether or not this user is doing anything wrong. It mostly comes down to why they have this second account, and what they do with it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is known as having a &lt;em&gt;sock-puppet&lt;/em&gt;, and it is addressed on &lt;a href=&quot;https://meta.stackexchange.com/a/57685/286591&quot;&gt;Meta Stack Exchange&lt;/a&gt; &lt;em&gt;by an SE employee&lt;/em&gt;. To quote the most important parts:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h2&gt;When should sockpuppets be considered a problem?&lt;/h2&gt;&#xA;  &#xA;  &lt;p&gt;There are a handful of legitimate reasons to maintain multiple accounts. A good rule of thumb for identifying abusive socks is: &lt;strong&gt;if the second account allows you to do something on the site that your normal account would be prevented from doing, it is abuse.&lt;/strong&gt; Examples of this include (but are not limited to):&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Voting on your own posts&lt;/li&gt;&#xA;  &lt;li&gt;Answering your own questions with the other account(s)&lt;/li&gt;&#xA;  &lt;li&gt;Casting multiple votes on others' posts&lt;/li&gt;&#xA;  &lt;li&gt;Supporting your own arguments (&lt;em&gt;&quot;+1: shog is right, don't know why the rest of you don't realize this&quot;&lt;/em&gt;)&lt;/li&gt;&#xA;  &lt;li&gt;Using bounties to circumvent the rep cap&lt;/li&gt;&#xA;  &lt;li&gt;Circumventing suspensions, quality bans, or the rate limits on posting questions / answers / comments / etc.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If this user is doing any of these things, this is a serious problem. He should delete his account immediately. If he doesn't, you should flag one of his posts with &lt;em&gt;in need of moderator intervention&lt;/em&gt;, and explain the situation with links to both accounts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since I'm not a moderator, I can't say for sure what would happen in this scenario, but it's very likely that his second account will be deleted, and his first account temporarily suspended.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now for what it's worth, there are many users with sock-puppets that don't cause issues, and he might have a sock-puppet for perfectly valid reasons. To quote Shog9 again:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I've probably had a half dozen or so alternate accounts over the course of the site. They're useful sometimes: testing bugs that only show up at low rep levels, reminding yourself what the site &quot;feels like&quot; for someone with only the basic abilities, maintaining a highly unnatural q/a ratio... That said, I &lt;em&gt;always&lt;/em&gt; treat these as disposable accounts, and some of them &lt;em&gt;have&lt;/em&gt; been removed (either automatically or via mod intervention) when I crossed a line somewhere - you should never assume that a sockpuppet is &quot;protected&quot; if you're actively using multiple accounts on one site; it's entirely too hard to be certain you're not interacting in some inappropriate fashion. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I know that lots of users here have created sock-puppets so that they can create a chatbot, or chat relay service. That's another legitimate use. &lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2017-04-05T19:05:30.570" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12007" PostTypeId="1" CreationDate="2017-04-05T19:30:01.157" Score="0" ViewCount="29" Body="&lt;p&gt;Recently I posted an answer that handled all but one part of a question. (It was an answer to 'You had me at hello' that could not handle infinite input. I was approached by a moderator and told to take it down because it did not properly answer the question (which I agree with). I eventually deleted it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would have marked it as non-competing, but it was in a language created before the challenge posting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So here is my question: should we have a way to have partially valid answers? If so, what?&lt;/p&gt;&#xA;" OwnerUserId="64159" LastActivityDate="2017-04-05T19:30:01.157" Title="Partially Valid Answers" Tags="|discussion|" AnswerCount="0" CommentCount="1" ClosedDate="2017-04-05T19:35:30.230" ContentLicense="CC BY-SA 3.0" />
  <row Id="12008" PostTypeId="2" ParentId="2140" CreationDate="2017-04-05T20:48:52.487" Score="2" Body="&lt;h1&gt;Tell me my vocabulary words! &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13504/64159&quot;&gt;Donated.&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;When taking textbook notes, I need to write down the vocabulary words and their definition. So your task is to write some code that will give me the vocabulary words and their definitions!&lt;/p&gt;&#xA;&lt;p&gt;Vocabulary words are detonated with a &lt;code&gt;*&lt;/code&gt; on both sides of them, like this: Sentences are &lt;code&gt;.&lt;/code&gt;-delimited, meaning that after every &lt;code&gt;.&lt;/code&gt; a new sentence starts. An example of a valid sentence would be: &lt;code&gt;This sentence has a *vocab word* in it.&lt;/code&gt; The vocab word in the sentence is 'vocab word'.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; A string of text with some words marked with asterisks. Only valid inputs will be provided, meaning that only sentences with exactly two asterisks inside of them, and there is something between the asterisks.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt; A list or delimited string where each item is in the following format: &lt;code&gt;Vocabulary word: sentence&lt;/code&gt;. The &lt;code&gt;Vocabulary word&lt;/code&gt; is the vocab word found in the sentence. The sentence must be the one with the emboldened vocabulary word in it. If there is any whitespace other than the &lt;code&gt; &lt;/code&gt;s separating the words, it needs to be stripped.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test cases:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input: *Alan Turing* invented the Turing machine. A *Turing machine* is a machine that follows simple rules, but is capable of any computation.&#xA;&#xA;Output: *Alan Turing*: *Alan Turing* invented the Turing machine.&#xA;        *Turing machine&amp;quot;: A *Turing machine* is a machine that follows simple rules, but is capable of any computation.&#xA;&#xA;Input: What is code-golf? *Code-golf* is the best site on the SE network. But what is SE, you ask? *SE* is a group of Q&amp;amp;A sites, with a system to prevent bad posts.&#xA;&#xA;Output: *Code-golf*: *Code-golf* is the best site on the SE network.&#xA;        *SE*: *SE* is a group of Q&amp;amp;A sites, with a system to prevent bad posts.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="64159" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-29T23:37:32.617" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12009" PostTypeId="1" CreationDate="2017-04-05T21:04:49.160" Score="19" ViewCount="242" Body="&lt;p&gt;Every so often someone requests that another meta post be added to the permanently featured spot on the front page. This is then declined because there would then be less space for hot meta posts, which it is important to show to attract plenty of discussion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would it be a useful compromise to have a single featured meta post that acts as an index to all the posts we would like new users to see? This would replace the sandbox on the featured pane, so no space would be lost.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm imagining it linking to the sandbox and vital FAQs, but keeping the list of links short to improve the chances of new users seeing the most important ones.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ideally the title would be something short that makes it immediately obvious that it is aimed at new users, and isn't something to ignore before posting questions or answers.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2017-04-05T21:04:49.160" Title="A featured meta post to list those we don't have room to feature" Tags="|discussion|" AnswerCount="0" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="12014" PostTypeId="1" CreationDate="2017-04-06T15:01:57.167" Score="0" ViewCount="24" Body="&lt;p&gt;Let's say I find an awesome challenge here, but I can make a different challenge out of it by changing the criteria significantly. Is it poor form to post a new challenge with a completely different set of criteria?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there is no general answer to this I can describe the specific example I'm thinking of and what I intend to post.&lt;/p&gt;&#xA;" OwnerUserId="16504" LastActivityDate="2017-04-06T15:01:57.167" Title="Can I post a challenge that is the same as an existing challenge but with different criteria?" Tags="|discussion|asking-questions|" AnswerCount="0" CommentCount="0" ClosedDate="2017-04-06T15:07:14.007" ContentLicense="CC BY-SA 3.0" />
  <row Id="12015" PostTypeId="1" AcceptedAnswerId="12016" CreationDate="2017-04-06T15:05:17.037" Score="2" ViewCount="70" Body="&lt;p&gt;Is there a tag that can be used for an &quot;operation golf&quot; (for lack of a better phrase) challenge? Where the criteria is, for example, the number of &lt;em&gt;operators&lt;/em&gt; and/or &lt;em&gt;library function calls&lt;/em&gt; (e.g. &lt;code&gt;cos&lt;/code&gt; or whatever) you use, rather than the character/byte count? (That's just an example, such a challenge would have much more clearly specified criteria.)&lt;/p&gt;&#xA;" OwnerUserId="16504" LastActivityDate="2017-04-06T15:10:07.617" Title="&quot;Operation golf&quot;" Tags="|discussion|tags|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12016" PostTypeId="2" ParentId="12015" CreationDate="2017-04-06T15:10:07.617" Score="5" Body="&lt;p&gt;You're looking for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;. But be aware that challenges of this genre are very tricky to get right, because it's hard to define in an objective way, across all possible languages, what counts as a single operator (or token etc). And then there's the issue that many languages have some form of &lt;code&gt;eval&lt;/code&gt;, so if the program contains too many tokens or operators, they'll just stuff it all in  a string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These challenges usually work best when you can design a simple toy-language for everyone to use, which doesn't have these issues (e.g. only allow basic maths operations). &lt;a href=&quot;https://codegolf.stackexchange.com/q/37188/8478&quot;&gt;Here is a good example of that.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you mean &quot;least number of operator/function &lt;em&gt;calls&lt;/em&gt; at runtime&quot;, the tag you're looking for is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fewest-operations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fewest-operations&amp;#39;&quot; rel=&quot;tag&quot;&gt;fewest-operations&lt;/a&gt;. The same caveats as above apply.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2017-04-06T15:10:07.617" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="12018" PostTypeId="1" CreationDate="2017-04-06T16:14:10.370" Score="1" ViewCount="82" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/114520/flip-a-coin-for-me.&quot;&gt;The challenge in question.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have discussed this in the comments of the challenge and &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/36392237#36392237&quot;&gt;in the chat room for that challenge&lt;/a&gt; where I was told that TNB was the place to discuss it. &lt;a href=&quot;http://chat.stackexchange.com/transcript/message/36541498#36541498&quot;&gt;I brought it up in TNB&lt;/a&gt; and I was told to discuss it here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/777/are-two-questions-duplicates-if-they-have-different-scoring-rules/&quot;&gt;This is the current consensus on what on is makes a challenge a duplicate.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also feel that it is worth noting that a total of seven close votes and seven reopen votes were cast for this challenge. It was closed twice by members with &lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/89/code-golf&quot;&gt;&quot;dupe hammers&quot;&lt;/a&gt; and the two most recent repoen votes have &quot;aged out&quot; and expired.&lt;/p&gt;&#xA;" OwnerUserId="41863" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:25.407" LastActivityDate="2017-04-06T19:58:18.667" Title="Is this coin flipping challenge really a duplicate?" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12020" PostTypeId="1" CreationDate="2017-04-06T17:34:26.793" Score="2" ViewCount="74" Body="&lt;p&gt;There are a good deal of challenges that disallow the use of built-in operations and I was wondering if we should consider implicit operations built-ins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example in Brain-Flak two things that are next to each other will be added implicitly, the program&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;({}{})&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;adds two numbers. However nowhere is there a character or group of characters that says &quot;add&quot; numbers. It adds because that when &lt;code&gt;{}&lt;/code&gt; is placed next to &lt;code&gt;{}&lt;/code&gt; it means the sum of the two.  If someone were to ask a question &quot;Add without builtins&quot; would this be a valid answer?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now of course this seems like a rather narrow example but other languages can have more complex implicit functions.  It would not be unreasonable for a language that deals with matrices to have implicit matrix multiplication.  Or a language that deals with sets to have implicit set union.  Languages with more than types can even have implicit operations for every combination of the types. Since there is often no way to get around banning these as builtins for a particular challenge is akin to banning the entire language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do implicit operations count as built-ins?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-04-06T17:40:41.160" Title="Are implicit operations Built-ins?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12021" PostTypeId="2" ParentId="12020" CreationDate="2017-04-06T17:40:41.160" Score="8" Body="&lt;p&gt;I wouldn't consider this an implicit operation. It's just that your operator is the empty string (or concatenation). In Mathematica I can often multiply things by writing them next to each other: &lt;code&gt;2x&lt;/code&gt; is the same as &lt;code&gt;2*x&lt;/code&gt;. I'm still using the built-in multiplication operator but in its concatenation form. Yes, it's still a built-in, regardless of whether your syntax requires an actual character to invoke it or not.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2017-04-06T17:40:41.160" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12022" PostTypeId="2" ParentId="2140" CreationDate="2017-04-06T18:06:40.480" Score="1" Body="&lt;h1&gt;Find the Translation Table &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/translation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;translation&amp;#39;&quot; rel=&quot;tag&quot;&gt;translation&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Given two strings, find the translation table between the two, if the translation is not possible, output false.&#xA;Probably most easily defined through examples:&lt;/p&gt;&#xA;&lt;h1&gt;Valid Cases&lt;/h1&gt;&#xA;&lt;p&gt;&lt;code&gt;bat&lt;/code&gt;,&lt;code&gt;sap&lt;/code&gt;        = &lt;code&gt;[&amp;quot;bt&amp;quot;,&amp;quot;sp&amp;quot;]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;sense&lt;/code&gt;,&lt;code&gt;12312&lt;/code&gt;    = &lt;code&gt;[&amp;quot;se&amp;quot;,&amp;quot;12&amp;quot;]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;rabid&lt;/code&gt;,&lt;code&gt;snail&lt;/code&gt;    = &lt;code&gt;[&amp;quot;rabd&amp;quot;,&amp;quot;snal&amp;quot;]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Falsy Cases&lt;/h1&gt;&#xA;&lt;p&gt;&lt;code&gt;banana&lt;/code&gt;,&lt;code&gt;angular&lt;/code&gt; = &lt;code&gt;false&lt;/code&gt; (not the same length, impossible).&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;animal&lt;/code&gt;,&lt;code&gt;snails&lt;/code&gt;  = &lt;code&gt;false&lt;/code&gt; (different character patterns, not a translation).&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input may be as a 2 element array or as 2 separate inputs.&lt;/li&gt;&#xA;&lt;li&gt;Output can be as an array, on separate lines or space delimited, but must be similar to how I have it shown.&lt;/li&gt;&#xA;&lt;li&gt;False output may be 0, -1 or false. If your language uses something different, ask.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Sandbox Questions&lt;/h1&gt;&#xA;&lt;p&gt;Should I allow inputs of different length to be part of the translation? This will increase the complexity of the question by 100%. I'd suggest using &lt;code&gt;-&lt;/code&gt; as the marker for a removal of a character in the translation to make it work. While it makes it more complicated, if this already exists I planned to use that to avoid a duplicate. Let me know what you think. I really like the extension idea though.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-06T18:06:40.480" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12023" PostTypeId="2" ParentId="12018" CreationDate="2017-04-06T18:17:34.710" Score="3" Body="&lt;h2&gt;Yes, they are duplicates&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;My position on this should be obvious, as I was one of the aforementioned dupe hammers, but I'll spell out my reasoning here for discussion purposes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The relevant portion of the current consensus is&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&quot;Can answers from one question be copied over to the other with little or no modification and still be competitive?&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;From my perspective, a sizable chunk of answers from the &lt;strong&gt;1/N&lt;/strong&gt; challenge can be trivially modified to fix the &quot;input&quot; to &lt;code&gt;2&lt;/code&gt; and still be competitive or reasonably competitive on the &lt;strong&gt;Coin Flip&lt;/strong&gt; challenge. Hence, my dupe hammer vote.&lt;/p&gt;&#xA;" OwnerUserId="42963" LastActivityDate="2017-04-06T18:17:34.710" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12024" PostTypeId="2" ParentId="12018" CreationDate="2017-04-06T19:58:18.667" Score="-1" Body="&lt;h1&gt;No, they are not duplicates&lt;/h1&gt;&#xA;&lt;p&gt;My position on this should also be obvious, as I voted to re-open the challenge and have linked to two discussions I've had about this.&lt;/p&gt;&#xA;&lt;p&gt;I would argue that the answers on the coin flipping challenge are not trivial modifications from the 1/N challenge. Looking at the answers to the coin flipping challenge, many of those languages were used in the 1/N challenge and few of those answers are a trivial modification. (&lt;a href=&quot;https://codegolf.stackexchange.com/a/114532/41863&quot;&gt;Coin 1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/66969/41863&quot;&gt;1/N 1&lt;/a&gt;; &lt;a href=&quot;https://codegolf.stackexchange.com/a/114531/41863&quot;&gt;Coin 2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/66940/41863&quot;&gt;1/N 2&lt;/a&gt;; &lt;a href=&quot;https://codegolf.stackexchange.com/a/114525/41863&quot;&gt;Coin 3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/67058/41863&quot;&gt;1/N 3&lt;/a&gt;; &lt;a href=&quot;https://codegolf.stackexchange.com/a/114522/41863&quot;&gt;Coin 4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/66926/41863&quot;&gt;1/N 4&lt;/a&gt;; &lt;a href=&quot;https://codegolf.stackexchange.com/a/114524/41863&quot;&gt;Coin 5&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/66955/41863&quot;&gt;1/N 5&lt;/a&gt;; &lt;a href=&quot;https://codegolf.stackexchange.com/a/114521/41863&quot;&gt;Coin 6&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/66954/41863&quot;&gt;1/N 6&lt;/a&gt;; &lt;a href=&quot;https://codegolf.stackexchange.com/a/114528/41863&quot;&gt;Coin 7&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/67001/41863&quot;&gt;1/N 7&lt;/a&gt;; &lt;a href=&quot;https://codegolf.stackexchange.com/a/114526/41863&quot;&gt;Coin 8&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/67039/41863&quot;&gt;1/N 8&lt;/a&gt;; &lt;a href=&quot;https://codegolf.stackexchange.com/a/114523/41863&quot;&gt;Coin 9&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/66924/41863&quot;&gt;1/N 9&lt;/a&gt;) Many of the answers are very different and required golfing beyond just a hard-coded &lt;code&gt;2&lt;/code&gt; to be competitive.&lt;/p&gt;&#xA;&lt;p&gt;From my perspective, the change from taking input and feeding it in to a hard-coded &lt;code&gt;2&lt;/code&gt; is just as trivial a change as between any two countdown challenges (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/115436/100-day-countdown&quot;&gt;1&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/115342/cook-me-a-hot-dog&quot;&gt;2&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/114270/how-much-time-is-remaining&quot;&gt;3&lt;/a&gt;) or between &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world&quot;&gt;the vanilla &amp;quot;Hello, World! challenge&lt;/a&gt; and almost any &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hello-world&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hello-world&amp;#39;&quot; rel=&quot;tag&quot;&gt;hello-world&lt;/a&gt; challenge that came before it (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/307/obfuscated-hello-world&quot;&gt;1&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/1536/hello-world-0-0&quot;&gt;2&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/18721/hello-world-with-limited-character-repetition&quot;&gt;3&lt;/a&gt;). If this coin flipping challenge is a duplicate, then there are a lot of other &amp;quot;duplicate challenges&amp;quot; on here that need cleaning up. I do not see why this coin-flipping challenge is an exception when all of these other challenges have set a precedent that minor variations in answers are acceptable and in the case of hello world, heavily rewarded.&lt;/p&gt;&#xA;" OwnerUserId="41863" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-06T19:58:18.667" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12026" PostTypeId="2" ParentId="11924" CreationDate="2017-04-07T05:28:27.417" Score="5" Body="&lt;h1&gt;Bash&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;p&gt;Typically counted in bytes.  Bash programs don't need a trailing newline, so don't count this if your editor adds one automatically.&lt;/p&gt;&#xA;&lt;p&gt;If your entry only uses builtin features (use &lt;code&gt;type -a &amp;lt;command&amp;gt;&lt;/code&gt; to find out), then you can claim your entry as &lt;strong&gt;Pure Bash&lt;/strong&gt;.  However if your entry calls external binaries (e.g. &lt;code&gt;paste&lt;/code&gt; from coreutils), then your entry should mention this in the header, e.g. &lt;strong&gt;Bash + coreutils&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Truthy/Falsey&lt;/h3&gt;&#xA;&lt;p&gt;This is a little odd in shell-type languages.  Shell commands - be they external binaries or shell builtins - return a status code between 0 and 255.  Typically 0 indicates success whereas any other number indicates some error.  The return code can be accessed in the &lt;code&gt;$?&lt;/code&gt; variable.  For example &lt;code&gt;grep&lt;/code&gt; returns 0 if it finds a match and 1 if not:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;$ echo haystack | grep -q needle&#xA;$ echo $?&#xA;1&#xA;$ echo haystack | grep -q hay&#xA;$ echo $?&#xA;0&#xA;$ &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The flow control statements (including &lt;code&gt;if&lt;/code&gt;) use these values accordingly:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;$ if echo haystack | grep -q needle; then echo Found it; fi&#xA;$ if echo haystack | grep -q hay; then echo Found it; fi&#xA;Found it&#xA;$ &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;So TRUE = 0, and FALSE = anything else - upside down, right?  You can see this even in the &lt;code&gt;true&lt;/code&gt; and &lt;code&gt;false&lt;/code&gt; builtins:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;$ true&#xA;$ echo $?&#xA;0&#xA;$ false&#xA;$ echo $?&#xA;1&#xA;$ &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If this wasn't confusing enough, the &lt;code&gt;(( ))&lt;/code&gt; arithmetic expansion test may be used to produce a return code.  Internally these operate using the more usual TRUE = 1/FALSE = 0 paradigm, but this is switched for when the result of an expression is returned out of the &lt;code&gt;(( ))&lt;/code&gt;.  For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;$ ((1))&#xA;$ echo $?&#xA;0&#xA;$ ((0))&#xA;$ echo $?&#xA;1&#xA;$ &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;I/O&lt;/h3&gt;&#xA;&lt;p&gt;Both programs and functions may read from STDIN and/or use positional command-line parameters &lt;code&gt;$1&lt;/code&gt;, &lt;code&gt;$2&lt;/code&gt;, etc (or &lt;code&gt;$@&lt;/code&gt; for them all).&lt;/p&gt;&#xA;&lt;p&gt;For testing purposes, you may explicitly put values in the positional parameters using &lt;code&gt;set -- &amp;lt;param1&amp;gt; &amp;lt;param2&amp;gt; ...&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Output is typically to STDOUT.  Any output to STDERR may be ignored as per standard rules.&lt;/p&gt;&#xA;&lt;p&gt;Truthy/Falsey output may also be in the form of a shell return code as described above.  This works for programs and functions.  The &lt;code&gt;return&lt;/code&gt; keyword may be used to explicitly return with a given status, but if it is not used, the status of a program or function will be the status of the last executed command:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;$ f()(true;false)&#xA;$ f&#xA;$ echo $?&#xA;1&#xA;$ f()(false;true)&#xA;$ echo $?&#xA;0&#xA;$ &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;I/O datatypes&lt;/h3&gt;&#xA;&lt;p&gt;This is pretty flexible.  The most common (Unix) way to input/output a list is to make it newline-delimited - i.e. one item per line.  However there is no reason why you couldn't use comma-separated values instead, if that is convenient for the given challenge.  There is not really a right-or-wrong way to do this with shell scripts.&lt;/p&gt;&#xA;&lt;h3&gt;Versions&lt;/h3&gt;&#xA;&lt;p&gt;Version 4.0 and later have several more advanced features.  Some that spring to mind:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Associative arrays&lt;/li&gt;&#xA;&lt;li&gt;More expressive brace expansions&lt;/li&gt;&#xA;&lt;li&gt;Regex conditionals&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;mapfile&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Different OSes have different utilities.  For example the Linux &lt;code&gt;find&lt;/code&gt; is most commonly a version from coreutils.  This is quite different to the BSD-flavour &lt;code&gt;find&lt;/code&gt; on MacOS - even if the bash versions are the same.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorDisplayName="user100411" LastEditDate="2021-11-13T15:30:50.017" LastActivityDate="2021-11-13T15:30:50.017" CommentCount="0" CommunityOwnedDate="2017-04-07T05:28:27.417" ContentLicense="CC BY-SA 4.0" />
  <row Id="12028" PostTypeId="2" ParentId="2140" CreationDate="2017-04-07T11:32:22.487" Score="0" Body="&lt;p&gt;Haiku detector in Haiku:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I found a haiku-w detector problem, and a popularity-contest challenge for writing factorial in haiku, but not the combination.  Let's fix that:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: a string consisting of alphanumeric characters, standard punctuation, and |'s, where the | is used to indicate where the syllable splits are, and newlines (to indicate where the line splits are).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: a Truthy value if the string consists of zero or more triplets of lines where the first and third line have 4 |'s and the second line has 6 |'s.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;The|quick|brown|fox|jumps&#xA;O|ver|the|la|zy|dog|while&#xA;the|cat|eats|goat|cheese&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;--&gt; True&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;This|is|not|a|hai|ku&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;--&gt; False&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A|B|C|d|E&#xA;1|2|3|4|5|6|7&#xA;A|B|C|D|E&#xA;Oops&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;--&gt; False&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Scoring:&#xA;   1 Point for each triplet (so a whitespace answer will automatically win with a score of 0; I'm open to suggestions on how to mitigate this); this is code golf so lowest score wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Determining if code is valid haiku:&#xA;Must consist of lines of code consisting of 5/7/5 syllables (with an optional empty line in between triplets)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Numbers and Variable names are read as written in standard English.  If you want to get fancy and use a word that can be read as different number of syllables (e.g. coop as in chicken coop vs coop as in the short form of cooperative that isn't always rendered using an umlaut), have at it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Special characters: &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;&lt;pre&gt;&lt;code&gt;  ( is either 2,3 or 4 syllables (paren, left paren, open paren)&#xA;  ) is either 2, or 3 syllables (paren, right paren, close paren)&#xA;  ! is 1 or 5 syllables (bang, not, or exclamation point)&#xA;  . is 1 (dot)&#xA;  # is 1 (hash or pound)&#xA;  $ is 2 or 3 (dollar or dollar sign)&#xA;  % is 2 or 3 (percent or percent sign)&#xA;  - is 1 or 2 (dash, hyphen, minus)&#xA;  + is 1 or 2 (plus, plus sign)&#xA;  ^ is 2 (caret or xor)&#xA;  &amp;amp; is 3 (ampersand)&#xA;  * is 1 (star)&#xA;  [ is 2,3,4,5 (bracket, open bracket, left bracket, square bracket, open square bracket, etc.)&#xA;  ], {, and } are likewise 2,3,4,5&#xA;  _ is 3 (underscore)&#xA;  = is 2 (equals)&#xA;  : is 2 (colon)&#xA;  ; is 4 (semicolon)&#xA;  &amp;gt; is 2 or 3 (greater or greater than)&#xA;  &amp;lt; is 2 or 3&#xA;  --&amp;gt; is either combination of two -'s and one &amp;gt; or 2 (arrow)&#xA;  , is 2 (comma)&#xA;  / is 1 or 3 (slash or forward slash)&#xA;  \ is 2 (backslash)&#xA;  | is 1 or 4 (pipe or vertical bar)&#xA;  ? is 2 or 3 (question or question mark)&#xA;  @ is 1 (at)&#xA;  ~ is 2 (squiggle or tilde)&#xA;  ` is 2 (backtick)&#xA;  ' is 1 or 3 (quote or single quote)&#xA;  &quot; is 3 (double quote)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Note that for everything but quote, if you use the same symbol 2 (or more times), you can instead say double symbol (or triple or whatever), e.g. &amp;amp;&amp;amp; can be either 5 or 6 syllables)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think that's all the punctuation... other unprintable characters are banned unless you can give a compelling argument on how many syllables it should be (and if I missed any pronounciation alternatives or other punctuation, let me know)&lt;/p&gt;&#xA;" OwnerUserId="7944" LastActivityDate="2017-04-07T11:32:22.487" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12032" PostTypeId="2" ParentId="11871" CreationDate="2017-04-07T19:00:05.743" Score="1" Body="&lt;p&gt;In my humble opinion, if the main point of the challenge is not about input format (e.g. &quot;read from an xml file&quot;) then I don't see much point in specifying the format. Most good challenges are really about finding a good algorithm to solve the problem and then outputting it in the format specified. In fact, in many cases I don't even thing the output format is important. For ASCII art, yes it is important. It must look like the specified output. For a pair of results from whatever integer manipulation, does it matter if they are comma separated or output as an array or a list? I don't think so. I guess it is all up to the context of the question and therefore up to the OP to decide. &lt;/p&gt;&#xA;" OwnerUserId="56555" LastActivityDate="2017-04-07T19:00:05.743" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12035" PostTypeId="1" CreationDate="2017-04-08T16:31:34.047" Score="12" ViewCount="441" Body="&lt;p&gt;I am currently developing a golfing language for a specific type of task.  I was hoping to use some command line flags for different options in the language.  Since the language is intended to be a golfing language I thought I would try to make these additional flags as cheap as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first idea I had was to make a &lt;code&gt;-r&lt;/code&gt; flag that is required to run all programs so that adding additional flags would cost only one additional byte, as per the meta-consensus (in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/273/on-interactive-answers-and-other-special-conditions&quot;&gt;this&lt;/a&gt; question):&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;[Extra command line flags are counted] as a difference in character count to the shortest equivalent invocation without them.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Reading this rule I had another idea.  I maintain the &lt;code&gt;-r&lt;/code&gt; flag but make it redundant when other flags are present (e.g. &lt;code&gt;-a&lt;/code&gt; is the same as &lt;code&gt;-ra&lt;/code&gt;).  That way the first flag is free. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;However you can go even further, you can require an option&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;--thisisareallylongflagnamerequiredforstandardexecutionbutredundantwhenotherflagsarepresentitexistsentirelytosavebytesinaddingnewcommandlineargumentsbecausethemetarulesonprogrammingpuzzlesandcodegolfstackexchangewerenotdesignedtohandlesuchedgecasesmakingreallylongstandardflagsveryadvantageousforgolfing&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and require it to run programs normally but consider it redundant when other flags are preset.  This would be the current reading of the rules allow you to use pretty much every command line flag you want for free,  for a more strict reading of the rules it would even allow for negative scores in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.  I could make it so that programs can be embedded in the command line arguments thus making a language that can obstensibly solve every challenge on ppcg in zero (or less bytes).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Surely this is not what was intended by the rules.  What should we do to prevent this type of shenanigan?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="53748" LastEditDate="2017-04-08T17:34:11.930" LastActivityDate="2017-04-11T15:56:18.490" Title="Potential execution flag rule break" Tags="|discussion|code-golf|scoring|" AnswerCount="5" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12036" PostTypeId="2" ParentId="12035" CreationDate="2017-04-08T17:03:50.650" Score="-1" Body="&lt;p&gt;I propose an alternative rule:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Non-standard flags for compilation and/or execution incur a penalty equal to the Levenshtein distance from the nearest standard execution.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This would not change the byte penalty in many cases (&lt;code&gt;-abc&lt;/code&gt; would still be +2 bytes if the standard is &lt;code&gt;-a&lt;/code&gt;), but it would prevent such abuses like the one in the question.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-04-08T17:03:50.650" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="12037" PostTypeId="2" ParentId="2140" CreationDate="2017-04-09T00:18:24.867" Score="0" Body="&lt;h2&gt;Golf the Stack Exchange code block&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The standard Stack Exchange code block button / hot key prepends 4 spaces to each line, unless they all begin with 4 spaces, in which case it removes them. Additionally, it avoids changing the first or last lines if they are empty. But why stop at the first or last lines? Markdown is quite happy if intervening empty lines remain empty. As this saves bytes, I want you to write as short a program (or function) as you can that follows this enhanced behaviour:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All empty lines should remain unchanged&lt;/li&gt;&#xA;&lt;li&gt;If all other lines begin with 4 spaces, then remove 4 spaces from them&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, prepend 4 spaces to each of them&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program that breaks no standard loopholes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that should your answer itself contain a blank line, you should ensure that there are no spaces on that line in your formatted code block.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2017-04-09T00:18:24.867" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12038" PostTypeId="2" ParentId="2140" CreationDate="2017-04-09T02:18:24.330" Score="2" Body="&lt;h1&gt;Garbled Phone Numbers&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; (de)&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cipher&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cipher&amp;#39;&quot; rel=&quot;tag&quot;&gt;cipher&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;You know how you get a voicemail message and the person's connection wasn't great, and you're trying to figure out how to call them back, but you're not sure if that was a &amp;quot;5&amp;quot; or an &amp;quot;8&amp;quot; they said?&lt;/p&gt;&#xA;&lt;p&gt;That's this challenge.&lt;/p&gt;&#xA;&lt;p&gt;The good news is that the caller read off their number twice, but it's garbled in both places.&lt;/p&gt;&#xA;&lt;p&gt;Your program should take input like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;5551231234 / 5551231234&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Where the first seven digits are the first time the phone number is said in the voice mail and the second set are the second time it's said.  Only...it'll look more like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;555?AAA1_36? / 55?522_1?234&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;A digit followed by a question mark means that that's the best-guess for that digit (e.g. &amp;quot;5?&amp;quot; means &amp;quot;probably a 5, compare with repeat&amp;quot;).  An underscore indicates a known missing digit, something too fuzzed by static to be deciphered at all.  Letters are just that: letters. Treat them as their respective digits (ABC -&amp;gt; 2, DEF -&amp;gt;3, HIJ -&amp;gt; 4, etc).&lt;/p&gt;&#xA;&lt;p&gt;You can safely assume the following judgement calls:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;5? / _     -&amp;gt; 5  //5 is the best guess we have, use it&#xA;5? / 4?    -&amp;gt; ?  //conflict&#xA; 5 / 4     -&amp;gt; ?  //conflict&#xA;5? / 4     -&amp;gt; 4  //solid information overrides possible value&#xA; 5 / 4?    -&amp;gt; 5  //solid information overrides possible value&#xA; _ / _     -&amp;gt; ?  //no information available&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Additionally you can assume that all inputs will contain ten-digit phone numbers, not including the question marks. Inputs that aren't ten digits (e.g. &lt;code&gt;1234567 / 1234567&lt;/code&gt;) can either be treated as unsolvable (falsey output) or throw an error.&lt;/p&gt;&#xA;&lt;p&gt;Output option A:&#xA;Output a truthy value indicating whether or not a given input can be resolved to a single valid ten-digit phone number.&lt;/p&gt;&#xA;&lt;p&gt;Output option B:&#xA;If it can be parsed to a single valid ten-digit phone number, output the phone number. Otherwise output some form of error indication (e.g. -1, false, empty line).&lt;/p&gt;&#xA;&lt;p&gt;Shortest wins, as per usual.&lt;/p&gt;&#xA;&lt;p&gt;[Sample inputs]&lt;/p&gt;&#xA;" OwnerUserId="47990" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-10T04:44:23.887" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="12039" PostTypeId="2" ParentId="5243" CreationDate="2017-04-09T06:40:44.097" Score="6" Body="&lt;h1&gt;100 rep for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/568/basic-calculator&quot;&gt;Making a calculator&lt;/a&gt; in GNU sed&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Considering it is hard to even make addition in GNU sed, It is definitely worth a bounty.&lt;/p&gt;&#xA;" OwnerUserId="64499" LastEditorUserId="-1" LastEditDate="2017-04-13T12:39:20.633" LastActivityDate="2017-04-09T06:40:44.097" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12041" PostTypeId="2" ParentId="12035" CreationDate="2017-04-09T19:19:04.063" Score="4" Body="&lt;p&gt;I'm starting to think that our general rule for byte counting, etc., is all wrong.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First, a thought experiment. I think the fairest way to compare programs would be like this: for each language, we define an infinite sequence that contains all possible programs in that language (taking into account compiler flags, nonstandard conditions, and everything else that might affect the way the program runs). Then each program is scored by its position in the sequence. In most cases, the sequence would/could just come down to &quot;sort all possible programs by their length in bytes&quot; and lead to approximately the same scores we have now, but languages that intentionally went for this sort of shenanigans would find the score much worse.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, I suspect we probably shouldn't/can't move to a system like this; it's much harder to understand than the present system, even if it is a lot fairer and less exploitable, and it'd therefore make it much harder for new users to join the site. However, it's a good test to use to judge whatever actual scoring rules we come up with to see if they make sense or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We can apply these general principles to this case. In this case, we learn that what's important is that the score penalty for changing command-line options is based on the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; of those changes. In the case of adding options, that's trivial (as even uncompressed, the changes take up no more space than the options themselves), but when deleting or editing options, the number of deleted/edited bytes is clearly capable of being an underestimate of the number of bytes required to specify the change.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Perhaps the best solution is to define language variants in which the command-line options for the language are somehow part of the program itself. (This is what, e.g., Anarchy Golf does for Perl, which makes heavy use of options.) This is along similar lines to defining a new encoding, or a new I/O wrapper around a language, or whatever. As far as I can tell, this would prevent all possible forms of cheating, while still being fairly easy to understand.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-04-09T19:19:04.063" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12042" PostTypeId="2" ParentId="2140" CreationDate="2017-04-09T21:02:23.100" Score="-2" Body="&lt;h1&gt;Real Programmers Don't Comment Their Code &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;(Disclaimer: I do think programmers should comment their code.)&lt;/em&gt;&lt;br /&gt;&#xA;Your task is to write code in one language that removes comments from code in another language. Both single-line and multi-line comments should be removed from your program. You may write code in one language to remove comments from the same language. Input and output may be in any format. Finally, before answering, read the rules, please.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Your program in language X must take a program in language Y as input and output the code with all comments removed. Language X may be the same as Language Y.&lt;/li&gt;&#xA;&lt;li&gt;You may &lt;em&gt;not&lt;/em&gt; use language Y if:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Language Y has no comments whatsoever.&lt;/li&gt;&#xA;&lt;li&gt;Language Y does not have 2 or more types of comment.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Language Y should preferably have unusual comment behavior. (Ex.: older programming languages or Haskell)&lt;/li&gt;&#xA;&lt;li&gt;You may &lt;em&gt;not&lt;/em&gt; ignore line continuations (usually &lt;code&gt;\&lt;/code&gt; at the end of the line).&lt;/li&gt;&#xA;&lt;li&gt;Your code may not remove anything inside a string literal.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are disallowed.&lt;/li&gt;&#xA;&lt;li&gt;I strongly encourage you, ironically, to provide an explanation if it is unclear how your code works.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so may the best programmer with the shortest code win...&lt;/p&gt;&#xA;" OwnerUserId="64706" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-10T12:59:28.427" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="12043" PostTypeId="2" ParentId="12035" CreationDate="2017-04-09T21:28:52.747" Score="3" Body="&lt;p&gt;The simplest rule to apply would be &quot;don't take the mickey&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a language &lt;em&gt;sometimes&lt;/em&gt; requires a flag which does absolutely nothing, it's clearly trying to game the rules. So your idea for &lt;code&gt;-r&lt;/code&gt; / &lt;code&gt;-a&lt;/code&gt; would be a no-go. You'd basically be getting a byte of code for free.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a language &lt;em&gt;always&lt;/em&gt; requires a flag, that's OK. So your original &lt;code&gt;-r&lt;/code&gt; / &lt;code&gt;-ra&lt;/code&gt; is no problem. In fact, my view is that we shouldn't count the &lt;code&gt;&amp;lt;space&amp;gt;-&lt;/code&gt; as extra chars even for languages that don't always require a flag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a language has a &quot;flag&quot; which can be adjusted to vary the program in more ways than the code itself (your 1000 &lt;code&gt;r&lt;/code&gt;s suggestion on Mego's answer), then it's not a flag; it's an alternative input format for the code. You can't just put a &lt;code&gt;-&lt;/code&gt; in front of something and call it a flag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finding explicit rules for this stuff will always leave loopholes, but common sense can trivially judge them on a case-by-case basis.&lt;/p&gt;&#xA;" OwnerUserId="8927" LastActivityDate="2017-04-09T21:28:52.747" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12045" PostTypeId="2" ParentId="12035" CreationDate="2017-04-10T05:44:22.507" Score="0" Body="&lt;h1&gt;A practical rule proposal&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I think that there are some problems with the current rules for counting flags. The simple fact that adding a mandatory flag to a language improves the bytecount of answers in that language that use other flags seems quite wrong to me. Another example is the case of &gt;&amp;lt;&gt;, where the &lt;code&gt;-v&lt;/code&gt; flag is useful in a lot of situations but costs 3 bytes since there is no other argument that can be used for free.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, the simple rule I'm proposing is:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;All flags are counted as if they were part of the source. The &lt;code&gt;-&lt;/code&gt; prefix is ignored.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I think this should be the general rule, straight and simple. Then, we could make per-language exceptions to ignore those flags that are mandatory or always used in practice, to avoid punishing languages like Jelly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the language of the question, the &lt;code&gt;r&lt;/code&gt; flag could be listed as an exception and not counted. A submission using &lt;code&gt;-ar&lt;/code&gt; would have its bytecount increased by +1, exactly like one using just &lt;code&gt;-a&lt;/code&gt;. (Since you were adding &lt;code&gt;-r&lt;/code&gt; exclusively to render other flags cheaper, though, you could consider simply not implementing it)&lt;/p&gt;&#xA;" OwnerUserId="62393" LastActivityDate="2017-04-10T05:44:22.507" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12046" PostTypeId="2" ParentId="12035" CreationDate="2017-04-10T10:41:35.347" Score="17" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;What should we do to prevent this type of shenanigan?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Firstly, we should all solemnly commit to downvoting every answer we see in a language which is deliberately designed to try to exploit PPCG-specific loopholes. This kind of rules-lawyering funny-at-most-once loophole-seeking is bad sportsmanship and detrimental to the site.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Secondly, I think that a close reading of the cited consensus gives an argument that this doesn't work anyway:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Compare&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I maintain the -r flag but make it redundant when other flags are present (e.g. -a is the same as -ra). That way the first flag is free.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;with&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;options to request different behaviors from the interpreter. This is the n/p/l/a/f family of options in perl/sed/awk/ruby. I count those as a difference in character count to the shortest equivalent invocation without them.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;On a narrow reading, this only applies to a handful of languages. On a moderate reading it can be generalised to other situations which have additive flags. But to generalise it to subtractive flags should require a good justification that that was the intent, and I can't see that justification.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The other answer, although it's newer and only at +4/-0 rather than +18/-2, is also worth taking into account. It explicitly says &quot;&lt;em&gt;Every &lt;strong&gt;Additional&lt;/strong&gt; Command Line Byte&lt;/em&gt;&quot; (my emphasis).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given that both answers are written thinking about languages with standard UNIX-style command-line parsing (Perl, PHP, ...), I think that should be assumed when interpreting intent and resolving ambiguities.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Changing &lt;code&gt;-r&lt;/code&gt; to &lt;code&gt;-a&lt;/code&gt; is really removing the flag and inserting a new one, and the new one should be scored at full cost. The question of how removing the old one should be scored is a separate issue, and about as urgent an issue as the question of how many angels can dance on the head of a pin. Quite simply: the fact that the issue has never come up before strongly suggests that there aren't any notable existing languages which have such subtractive flags, and if anyone is thinking of creating one solely for the purpose of having a meta discussion on how to score it, they should find more entertaining ways of wasting other people's time.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;-rrrr1rr&lt;/code&gt; doesn't behave in the same way as &lt;code&gt;-r -r -r -r -1 -r -r&lt;/code&gt; (and &lt;code&gt;-r -1 -r -r -r -r -r&lt;/code&gt;, etc.: the only flag whose position may be significant when combining single-letter flags is the final one, if it takes arguments) then changing &lt;code&gt;-rrrrrr&lt;/code&gt; to &lt;code&gt;-rrrr1rr&lt;/code&gt; is adding a new 8-byte flag and should be scored as 9 bytes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="194" LastEditorUserId="194" LastEditDate="2017-04-11T15:56:18.490" LastActivityDate="2017-04-11T15:56:18.490" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="12051" PostTypeId="2" ParentId="6918" CreationDate="2017-04-10T21:34:55.657" Score="10" Body="&lt;h1&gt;Alice&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Alice was created between October 2016 and April 2017 by me, with a lot of help from &lt;a href=&quot;https://codegolf.stackexchange.com/users/21487/sp3000&quot;&gt;Sp3000&lt;/a&gt;. It started out as &quot;a quick one-or-two week project&quot; just for the sake of getting something done because I wasn't making any progress with my other language ideas. Well, you can count the months yourself... I guess it's what I deserve for turning feature creep into a design goal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Alice is a feature-rich Fungeoid with many high-level functions that make programming in it comparably doable (hopefully). I originally started working on it when Sp3000 suggested to combine two of my ideas into a single language:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Many 2D programming languages use &lt;code&gt;/&lt;/code&gt; and &lt;code&gt;\&lt;/code&gt; to reflect the instruction pointer on the 45 degree diagonal. But I figured in most fonts those characters are closer to 67.5 degrees, so they should really reflect between orthogonal and diagonal movement in some way.&lt;/li&gt;&#xA;&lt;li&gt;I wanted to create a feature-rich Fungeoid where operators have different meanings depending on what direction the IP is moving, so I could overload them with even more commands.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;So here we have Alice. A language in which mirrors change orthogonal movement to diagonal movement and vice-versa, and in which the language works in two very different modes depending on whether you're moving orthogonally or diagonally: in Cardinal mode (moving orthogonally), Alice is much like other Fungeoids that can only work with integers on a stack or tape (although Alice has both); in Ordinal mode (moving diagonally), Alice turns into a string processing language and now only knows about strings as a data type.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also resolved early on to give every single printable ASCII character a distinct function in Alice. So Cardinal mode has a lot of built-ins for basic arithmetic, number theory, combinatorics and some other shenanigans. Ordinal mode has a wide variety of commands for string manipulation and set theoretic operations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And finally, we come to the name (and theme) of the language: the language is of course named after Lewis Carroll's Alice. Much as Alice in Through the Looking-Glass, you step through mirrors to switch between two mirror universes. What this means for the language is that the two functions performed by any of the characters in the two modes, are (sometimes subtly and sometimes not so subtly) related, in terms of their effect, their theme or their structure. When a Cardinal command works with the divisors of a number, the corresponding Ordinal mode command will often do something similar with the substrings of a string. When a Cardinal command picks a random number in a range, the corresponding Ordinal command picks a random character from a string. And so on...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want a first taste of the language, &lt;a href=&quot;https://codegolf.stackexchange.com/a/116565/8478&quot;&gt;here is Collatz step counter&lt;/a&gt;. For a more elaborate example that makes proper use of both modes, &lt;a href=&quot;https://codegolf.stackexchange.com/a/149457/8478&quot;&gt;see this answer&lt;/a&gt;. The language repository also has some example programs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've got a bunch of people to thank for their help with this language. As I said above, Sp3000 has been a huge help, testing the language, giving feedback, and throwing ideas back and forth. But I've also worked in some ideas from discussions on SE: thanks to &lt;a href=&quot;https://codegolf.stackexchange.com/users/53880/basic-sunset&quot;&gt;Basic Sunset&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/24877/flawr&quot;&gt;flawr&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/62574/mistah-figgins&quot;&gt;Mistah Figgins&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/32686/muddyfish&quot;&gt;muddyfish&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/20198/nathan-merrill&quot;&gt;Nathan Merrill&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/194/peter-taylor&quot;&gt;Peter Taylor&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/users/51785/poke&quot;&gt;Poke&lt;/a&gt; (and probably some others whom I forgot).&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/m-ender/alice&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;GitHub repository&lt;/strong&gt;&lt;/a&gt;. Includes language specification, reference implementation (Ruby), example programs and issue tracker.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/nexus/alice&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Try it online!&lt;/strong&gt;&lt;/a&gt; (by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;) backed by the Ruby interpreter.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://chat.stackexchange.com/rooms/56891/inside-the-looking-glass&quot;&gt;&lt;strong&gt;SE Chatroom&lt;/strong&gt;&lt;/a&gt;. For any questions and discussions about the language, bug reports, etc. I'll usually be pingable in there.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2018-01-24T20:16:21.250" LastActivityDate="2018-01-24T20:16:21.250" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12053" PostTypeId="2" ParentId="2140" CreationDate="2017-04-11T04:10:43.733" Score="2" Body="&lt;h1&gt;Write a &amp;quot;21&amp;quot; game in exactly 21 characters &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;You must write a program which implements the following algorithm:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Let x = 0&#xA;Let y = truthy value&#xA;while (y is not falsy AND x &amp;lt;= 21) do:&#xA;  Let x = x + a uniform random number from {1,2,3,...,11}&#xA;  Output the value of x&#xA;  Input a value of y from the user (you may assume input is valid)&#xA;Output the value of x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(You do not have to follow the pseudocode exactly. For example, if your language happens to initialise variables to a truthy value automatically, you don't have to include the &lt;code&gt;y:=TRUE&lt;/code&gt; line. Similarly, you don't have to use a while loop. The important thing is that it repeatedly takes user input until either x exceeds 21 or the user chooses to stop, and it outputs the current value of x after each user input.)&lt;/p&gt;&#xA;&lt;h2&gt;Score&lt;/h2&gt;&#xA;&lt;p&gt;Let n be the length of the shortest program which meets the spec which can be obtained by deleting 0 or more characters from your code. Then your score is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;- 500            if n &amp;gt; 21&#xA;- 1 + (n-21)^2   if n &amp;lt; 21&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The winner in each language is the program with the lowest score.&lt;/p&gt;&#xA;&lt;h2&gt;Questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a resonable idea? I can't find similar challenges, so maybe there is a problem with ones like this? (Trivial solutions etc.)&lt;/li&gt;&#xA;&lt;li&gt;Is the specification too complicated (maybe more languages could enter if it was a simpler algorithm, for example just taking user input once?)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="26905" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-11T04:10:43.733" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12054" PostTypeId="1" CreationDate="2017-04-11T05:05:58.827" Score="0" ViewCount="70" Body="&lt;p&gt;Some languages, like &lt;code&gt;V&lt;/code&gt; and &lt;code&gt;Charcoal&lt;/code&gt; use their own character systems. In the meantime, next to all languages support common (one byte) UTF-8 characters with only a single byte as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; be scored in UTF-8, or language charsets?&lt;/p&gt;&#xA;" OwnerUserId="58763" LastActivityDate="2017-04-11T05:25:16.347" Title="What standard should be used for [code-golf] byte counts?" Tags="|discussion|winning-criteria|" AnswerCount="1" CommentCount="1" ClosedDate="2017-04-11T08:31:55.683" ContentLicense="CC BY-SA 3.0" />
  <row Id="12055" PostTypeId="2" ParentId="12054" CreationDate="2017-04-11T05:16:32.970" Score="2" Body="&lt;p&gt;Code golf answers should be scored in whatever the interpreter can digest. If there's an X bytes file that does what it's supposed to do, you can claim a score of X bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;UTF-8 doesn't even apply to all languages. There are plenty of them (both older practical and newer recreational languages) that do not even understand UTF-8/Unicode, so encoding the source code in UTF-8 for scoring purposes is rather arbitrary. Other languages force you to use UTF-16. Again, UTF-8 doesn't make sense in this case.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, there are languages that do not even have a concept of character (TI-Basic, byte code, etc.), and thus cannot be represented by any &lt;em&gt;character&lt;/em&gt; encoding.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2017-04-11T05:25:16.347" LastActivityDate="2017-04-11T05:25:16.347" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12056" PostTypeId="2" ParentId="2140" CreationDate="2017-04-11T08:26:22.743" Score="0" Body="&lt;h1&gt;Lazy programmers need help versioning!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So here's a question, which is related to a recent problem I had while doing some data processing. I think it is good practice to include version numbers in file names to prevent data being overwritten and so you can see how things have changed with each version but I'm lazy so want it automating!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Your challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Take a full Windows file path and either increment the file version, or if there is no version, make it version 1.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A full Windows file path, that includes the file extension.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The original file path with the file version, incremented appropriately.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The version is determined by an underscore followed by a single digit, i.e &lt;code&gt;_1&lt;/code&gt; for version 1.&lt;/li&gt;&#xA;&lt;li&gt;For a file that already have a version, it will only be in the range &lt;code&gt;1-8&lt;/code&gt;, so you only ever have to deal with single digit file versions.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet/2422#2422&quot;&gt;Standard rules apply&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Default Loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;Please provide explanations of your code so others can learn form it and if possible, links to an online interpreter such as &lt;a href=&quot;https://tio.run/nexus&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest code in bytes wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Case 1&#xA;Input:  C:\Foo\Bar.txt&#xA;Output: C:\Foo\Bar_1.txt&#xA;&#xA;Case 2&#xA;Input:  C:\notsortedfile_version_1_new_5.docx&#xA;Output: C:\notsortedfile_version_1_new_6.docx&#xA;&#xA;Case 3&#xA;Input:  D:\a\very\deep\file\567234.pdf&#xA;Output: D:\a\very\deep\file\567234_1.pdf&#xA;&#xA;Case 4&#xA;Input:  Z:\Storage\Somefile_2017-04-11.txt&#xA;Output: Z:\Storage\Somefile_2017-04-11_1.txt&#xA;&#xA;Case 5&#xA;Input:  Z:\Storage\I.Like.Dots.txt&#xA;Output: Z:\Storage\I.Like.Dots_1.txt&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Not sure if this is dupe of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/102531/please-release-me/102532#102532&quot;&gt;Please release me!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any feedback welcome.&lt;/p&gt;&#xA;" OwnerUserId="68029" LastEditorUserId="68029" LastEditDate="2017-07-06T11:42:03.723" LastActivityDate="2017-07-06T11:42:03.723" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12057" PostTypeId="5" CreationDate="2017-04-11T13:07:19.313" Score="0" Body="&lt;p&gt;Stack Snippets were introduced on September 16, 2014 via a &lt;a href=&quot;https://stackoverflow.blog/2014/09/16/introducing-runnable-javascript-css-and-html-code-snippets/&quot;&gt;Stack Exchange blog post&lt;/a&gt;. They are an onsite alternative to external sources like &lt;a href=&quot;//jsfiddle.net&quot; rel=&quot;nofollow noreferrer&quot;&gt;JSFiddle&lt;/a&gt; and are meant to encourage users to provide a &lt;a href=&quot;https://stackoverflow.com/help/mcve&quot;&gt;Minimal, Complete, and Verifiable example&lt;/a&gt; along with pertinent questions.&lt;/p&gt;&#xA;&lt;p&gt;Currently, only HTML, CSS, and JavaScript are supported, but other languages may be on the way.&lt;/p&gt;&#xA;&lt;p&gt;Security is a major concern, and one measure that has been taken to combat potentially malicious snippets is the location of the hosting for the snippets: they are hosted on &lt;a href=&quot;//stacksnippets.net&quot; rel=&quot;nofollow noreferrer&quot;&gt;an external domain&lt;/a&gt; to prevent malicious snippets from modifying the page or account of the user running the code.&lt;/p&gt;&#xA;&lt;p&gt;Stack Snippets can be tested in the &lt;a href=&quot;https://meta.stackexchange.com/questions/239456/stack-snippets-sandbox-try-it-out-here&quot;&gt;Sandbox&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="63502" LastEditorUserId="63502" LastEditDate="2022-06-03T14:40:34.627" LastActivityDate="2022-06-03T14:40:34.627" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="12058" PostTypeId="4" CreationDate="2017-04-11T13:07:19.313" Score="0" Body="Stack Snippets are runnable inline code samples. Currently HTML, CSS, and JavaScript are supported." OwnerDisplayName="user58826" LastEditorUserId="34718" LastEditDate="2017-04-11T13:46:47.210" LastActivityDate="2017-04-11T13:46:47.210" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12061" PostTypeId="5" CreationDate="2017-04-11T15:22:02.617" Score="0" Body="&lt;p&gt;Use this tag for questions relating to questions/challenges on the main site, generally to ask about:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;question etiquette, such as formatting and content&lt;/li&gt;&#xA;&lt;li&gt;Proposals for new rules or defaults concerning question&lt;/li&gt;&#xA;&lt;li&gt;Clarifications on existing site rules and defaults&lt;/li&gt;&#xA;&lt;li&gt;Anything else specific to question&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Do not use this tag for questions about specific question, instead use &lt;a href=&quot;/questions/tagged/specific-question&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;specific-question&amp;#39;&quot; rel=&quot;tag&quot;&gt;specific-question&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="-1" LastEditorUserId="66833" LastEditDate="2021-05-06T04:15:30.067" LastActivityDate="2021-05-06T04:15:30.067" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="12062" PostTypeId="4" CreationDate="2017-04-11T15:22:02.617" Score="0" Body="For questions regarding challenges on main. This tag is not for questions about a specific question, but for questions in general" OwnerUserId="-1" LastEditorUserId="66833" LastEditDate="2021-05-06T04:15:30.067" LastActivityDate="2021-05-06T04:15:30.067" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="12063" PostTypeId="1" CreationDate="2017-04-11T15:22:18.970" Score="10" ViewCount="335" Body="&lt;p&gt;Snippetify is a script that is designed to make StackSnippets with JS submissions on the main site easy.&lt;/p&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;p&gt;Let's say we are answering a simple challenge to repeat a string &lt;em&gt;N&lt;/em&gt; times. A possible JS submission might be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a=&amp;gt;b=&amp;gt;a.repeat(b)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;that is called with the first parameter the string to repeat and the second param (uses currying) is the number of times to repeat that.&lt;/p&gt;&#xA;&lt;p&gt;Let's say we want that in a stack snippet. Here's the old-fashioned way:&lt;/p&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;var repeat = &#xA;//actual code&#xA;a=&amp;gt;b=&amp;gt;a.repeat(b);&#xA;&#xA;&#xA;document.getElementById(&quot;submit&quot;).onclick = function(){&#xA;  document.getElementById(&quot;output&quot;).innerText = repeat(document.getElementById(&quot;string&quot;).value)(document.getElementById(&quot;repeat-count&quot;).value);&#xA;};&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-css lang-css prettyprint-override&quot;&gt;&lt;code&gt;input,button{&#xA;  display: block;&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;input id = &quot;string&quot;&amp;gt;&#xA;&amp;lt;input type = &quot;number&quot; id = &quot;repeat-count&quot;&amp;gt;&#xA;&amp;lt;button id = &quot;submit&quot;&amp;gt;Submit&amp;lt;/button&amp;gt;&#xA;&amp;lt;div id = &quot;output&quot;&amp;gt;&amp;lt;/div&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&lt;p&gt;That's alot of code for just &lt;code&gt;a=&amp;gt;b=&amp;gt;a.repeat(b)&lt;/code&gt;. If you use Snippetify, you can do this:&lt;/p&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;Snippetify(a=&amp;gt;b=&amp;gt;a.repeat(b));&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://programmer5000.com/snippetify.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xA;&amp;lt;input type = &quot;text&quot; data-attribute = &quot;0&quot;&amp;gt;&#xA;&amp;lt;input type = &quot;number&quot; data-attribute = &quot;1&quot;&amp;gt;&#xA;&amp;lt;button&amp;gt;Submit&amp;lt;/button&amp;gt;&#xA;&amp;lt;div data-output&amp;gt;&amp;lt;/div&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&lt;p&gt;Better, huh! If you pass Snippetify function that accepts 1 argument (all currying functions) and you have more than one input it will know to use currying. But it gets better:&lt;/p&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;Snippetify(a=&amp;gt;b=&amp;gt;a.repeat(b));&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://programmer5000.com/snippetify.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xA;&amp;lt;input type = &quot;text&quot; data-attribute&amp;gt;&#xA;&amp;lt;input type = &quot;number&quot; data-attribute&amp;gt;&#xA;&amp;lt;button&amp;gt;Submit&amp;lt;/button&amp;gt;&#xA;&amp;lt;div data-output&amp;gt;&amp;lt;/div&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&lt;p&gt;If you want your parameters passed in order of the &lt;code&gt;&amp;lt;input&amp;gt;&lt;/code&gt;s provided, you can just use &lt;code&gt;data-attribute&lt;/code&gt; with no value. But it gets &lt;em&gt;even better:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;Snippetify(a=&amp;gt;b=&amp;gt;a.repeat(b));&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://programmer5000.com/snippetify.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xA;&amp;lt;input type = &quot;text&quot;&amp;gt;&#xA;&amp;lt;input type = &quot;number&quot;&amp;gt;&#xA;&amp;lt;button&amp;gt;Submit&amp;lt;/button&amp;gt;&#xA;&amp;lt;div data-output&amp;gt;&amp;lt;/div&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&lt;p&gt;Snippetify will use all your &lt;code&gt;&amp;lt;input&amp;gt;&lt;/code&gt;s (and &lt;code&gt;&amp;lt;textarea&amp;gt;&lt;/code&gt;s) if you don't use &lt;code&gt;data-attribute&lt;/code&gt;. Still too much work? Try this:&lt;/p&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;Snippetify(a=&amp;gt;b=&amp;gt;a.repeat(b));&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://programmer5000.com/snippetify.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xA;&amp;lt;input type = &quot;text&quot;&amp;gt;&#xA;&amp;lt;input type = &quot;number&quot;&amp;gt;&#xA;&amp;lt;button&amp;gt;Submit&amp;lt;/button&amp;gt;&#xA;&amp;lt;div&amp;gt;&amp;lt;/div&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&lt;p&gt;You don't need &lt;code&gt;data-output&lt;/code&gt; if you would like output to go to the first &lt;code&gt;&amp;lt;div&amp;gt;&lt;/code&gt; in the DOM. One final laziness addition (this works only with non-currying functions and text-only inputs):&lt;/p&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;Snippetify((a,b)=&amp;gt;a + b);&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://programmer5000.com/snippetify.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&lt;p&gt;Yep, Snippetify will even create everything for you if it can.&lt;/p&gt;&#xA;&lt;h1&gt;Usage&lt;/h1&gt;&#xA;&lt;p&gt;When you add a code snippet, add this to your HTML (before anything else)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;script src=&amp;quot;https://programmer5000.com/snippetify.min.js&amp;quot;&amp;gt;&amp;lt;/script&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;See above for markup needed.&lt;/p&gt;&#xA;&lt;h1&gt;What this post is for&lt;/h1&gt;&#xA;&lt;p&gt;Have any bugs feature requests, or general feedback? Comment or answer below.&lt;/p&gt;&#xA;&lt;h1&gt;Snippetify License&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://creativecommons.org/publicdomain/zero/1.0/&quot; rel=&quot;nofollow noreferrer&quot;&gt;CC0&lt;/a&gt;. You can use it in any answer to a code golf challenge.&lt;/p&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://gist.github.com/programmer5000-com/6acf4ad4786457de2959a3546571f75e&quot; rel=&quot;nofollow noreferrer&quot;&gt;Source code, etc.&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerDisplayName="user58826" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-17T01:26:19.587" Title="Introducing Snippetify!" Tags="|discussion|stack-snippets|" AnswerCount="2" CommentCount="17" ContentLicense="CC BY-SA 3.0" />
  <row Id="12064" PostTypeId="2" ParentId="12063" CreationDate="2017-04-11T16:17:09.233" Score="1" Body="&lt;h1&gt;Testing Ground (community wiki)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Because this is a community wiki, anybody can edit this answer, regardless of their reputation.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; If you want to use no markup, you must set &lt;code&gt;console&lt;/code&gt; to &lt;code&gt;false&lt;/code&gt; in the Stack Snippet.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://paste.ee/p/YwTyl&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here is a minified version of the below HTML to include in your posts.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please only edit anything below this line:&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;// Call Snippetify with the function you want to test as a parameter. &#xD;&#xA;// If it doesn't work, make sure that you're passing a function and that &#xD;&#xA;// The Snippetify script is included in the HTML.&#xD;&#xA;Snippetify(a=&amp;gt;a+1);&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://programmer5000.com/snippetify.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt; &#xD;&#xA;&#xD;&#xA;&amp;lt;style&amp;gt;&#xD;&#xA;textarea {&#xD;&#xA;    /* border: none !important; */&#xD;&#xA;&#xD;&#xA;    /* remove previous comment/replace comment to toggle border on output box &#xD;&#xA;    (will look like a blank space when no output) */&#xD;&#xA;    overflow: auto !important;&#xD;&#xA;    outline: none !important;&#xD;&#xA;&#xD;&#xA;    -webkit-box-shadow: none !important;&#xD;&#xA;    -moz-box-shadow: none !important;&#xD;&#xA;    box-shadow: none !important;&#xD;&#xA;    resize: none !important;&#xD;&#xA;}&#xD;&#xA;&amp;lt;/style&amp;gt; &#xD;&#xA;&#xD;&#xA;&amp;lt;!-- begin inputs --&amp;gt;&#xD;&#xA;&amp;lt;label for=&quot;input1&quot;&amp;gt;Input 1:&amp;lt;br&amp;gt;&amp;lt;/label&amp;gt;&#xD;&#xA;&amp;lt;input type=&quot;text&quot; name=&quot;input1&quot; id=&quot;input1&quot;&amp;gt;&#xD;&#xA;&#xD;&#xA;&amp;lt;!-- you can add more inputs by just copy-pasting and changing&#xD;&#xA;     the 1s to 2s, 3s, etc. --&amp;gt;&#xD;&#xA;&amp;lt;!-- end inputs --&amp;gt;&#xD;&#xA;&#xD;&#xA;&amp;lt;button id=&quot;submit&quot; style=&quot;float: left;&quot;&amp;gt;Submit&amp;lt;/button&amp;gt;&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&#xD;&#xA;&#xD;&#xA;&amp;lt;label for=&quot;output&quot;&amp;gt;Output:&amp;lt;br&amp;gt;&amp;lt;/label&amp;gt;&#xD;&#xA;&#xD;&#xA;&amp;lt;textarea id=&quot;output&quot; data-output readonly&amp;gt;&amp;lt;/textarea&amp;gt;&#xD;&#xA;&amp;lt;div date-output&amp;gt;&amp;lt;/div&amp;gt;&#xD;&#xA;&amp;lt;p&amp;gt;&amp;lt;/p&amp;gt;&#xD;&#xA;&amp;lt;hr&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastEditorUserId="62368" LastEditDate="2017-04-17T01:26:19.587" LastActivityDate="2017-04-17T01:26:19.587" CommentCount="6" CommunityOwnedDate="2017-04-11T16:17:09.233" ContentLicense="CC BY-SA 3.0" />
  <row Id="12068" PostTypeId="2" ParentId="2140" CreationDate="2017-04-12T07:31:09.843" Score="0" Body="&lt;h1&gt;Swipe over the keyboard&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;(I'm not a native speaker so any good alternative for swipe is highly appreciated)&lt;/p&gt;&#xA;&lt;p&gt;You have a keyboard in front of you and you swipe over the keyboard from left to right with your whole hand. Your task is to simulate the output.&#xA;The keyboard is represented with 4 arrays (here is an example of a german keyboard layout, you are free to choose any other layout):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1,2,3,4,5,6,7,8,9,0,ß,´]&#xA;[q,w,e,r,t,z,u,i,o,p,ü,+]&#xA;[a,s,d,f,g,h,j,k,l,ö,ä,#]&#xA;[&amp;lt;,y,x,c,v,b,n,m,,,.,-]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Now choose randomly one character of the first column &lt;code&gt;[1,q,a,&amp;lt;]&lt;/code&gt;. Pop the chosen key and do the same with the newly created first column. For example the first key was &lt;code&gt;q&lt;/code&gt;, the new first column will be &lt;code&gt;[1,w,a,&amp;lt;]&lt;/code&gt;. The popped key will be printed out or skipped. Repeat it until your arrays are empty.&lt;/p&gt;&#xA;&lt;p&gt;The rules are the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can represent the keyboard with 4 arrays matching the 4 rows on your keyboard. For example &lt;code&gt;[1,2,3,4,5,6,7,8,9,0,ß,´]&lt;/code&gt; would be my first row (german keyboard layout). Choose the keyboard layout you want, but it has to include all letters and numbers&lt;/li&gt;&#xA;&lt;li&gt;There is no need to represent non-printable keys like tabulator, shift, backspace, ... so in general you won't hit the first and last column and the last row (you won't hit space too)&lt;/li&gt;&#xA;&lt;li&gt;Since you are swiping from left to right, the probability to hit a previously located key is 0. So if the key 5 is pressed, the keys 1-4 won't be pressed anymore.&lt;/li&gt;&#xA;&lt;li&gt;Each key needs to have a probability &lt;code&gt;P!=0&lt;/code&gt; to be pressed&lt;/li&gt;&#xA;&lt;li&gt;Each key needs to have a probability &lt;code&gt;P!=0&lt;/code&gt; to be skipped&lt;/li&gt;&#xA;&lt;li&gt;The rows are independent&lt;/li&gt;&#xA;&lt;li&gt;There is no input&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Open questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should I allow only one keyboard type?&lt;/li&gt;&#xA;&lt;li&gt;Are there still rules that need to be added?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="29520" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-12T07:31:09.843" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12069" PostTypeId="1" CreationDate="2017-04-12T09:38:42.753" Score="8" ViewCount="231" Body="&lt;p&gt;Oftentimes people will ask challenges that have rules hinging on the characters encoded by the source file (see &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;). For example, &quot;Your program may not contain the letter &lt;code&gt;a&lt;/code&gt;&quot;. But some languages are sequences of bytes that are not associated with any character encoding (e.g. machine code or a deflate stream). How should such languages be treated when interpreting this kind of restriction?&lt;/p&gt;&#xA;" OwnerUserId="30688" LastActivityDate="2017-04-12T16:59:22.983" Title="Character encoding-based rules with language without encoding" Tags="|discussion|rules|characters|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12070" PostTypeId="2" ParentId="12069" CreationDate="2017-04-12T12:35:54.807" Score="2" Body="&lt;p&gt;I propose that the &lt;strong&gt;Windows-1252&lt;/strong&gt; character encoding be used as the default character set for languages that don't specify otherwise.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Why Windows-1252?&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;By far the most character encodings are ASCII-based (extensions of ASCII-7), so if we were to pick a character encoding, it should be one of those. The sooner we get EBCDIC out of the picture, the better.&lt;/li&gt;&#xA;&lt;li&gt;Unicode is the go-to character set in these days, but which encoding? Some byte-sequences are invalid UTF-8, ditto for UTF-16 and UTF-32, so neither of these will fly.&lt;/li&gt;&#xA;&lt;li&gt;You could pick the first 256 characters in Unicode and be done with it. This character set already exists, and it's called Latin 1, AKA ISO-8859-1. The downside is, this character set includes a whole bunch of non-printable characters that nobody uses (other than those coming from ASCII).&lt;/li&gt;&#xA;&lt;li&gt;So, let's look for a superset of (ISO-8859-1 minus C1 control codes). Wikipedia says that &lt;em&gt;the&lt;/em&gt; superset of this encoding is Windows-1252. It's also called &quot;ANSI&quot;, and while the reason behind it isn't great, the naming certainly did benefit Windows-1252. It still leaves some bytes without an associated character, but there doesn't seem to be a standardized extension that fills them in.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;As to why it's named ANSI, i'll let @ais523 explain:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Microsoft's calling of the encoding &quot;ANSI&quot; is a misunderstanding, rather than anything official. They basically have two sets of APIs, one for Unicode, and one for 8-bit character sets. When originally creating the terminology, they assumed that the 8-bit character sets would be ANSI-standardised, and thus used the name ANSI for them collectively, but it turned out that one of Microsoft's own became much more popular.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Comparison_of_hex_editors#Features&quot; rel=&quot;nofollow noreferrer&quot;&gt;comparison of hex editors on Wikipedia&lt;/a&gt; also suggests Windows-1252, besides CP437, as a good choice. The hex editor I use personally uses Windows-1252 as well. &lt;/li&gt;&#xA;&lt;li&gt;HTML5 standard specifies that Windows-1252 be used whenever a web page says it's in ISO-8859-1. ISO-8859-1 / Windows-1252 is the most common encoding on the Internet after UTF-8, by a wide margin.&lt;a href=&quot;https://w3techs.com/technologies/history_overview/character_encoding&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;sup&gt;1&lt;/sup&gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Why any encoding at all?&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It makes displaying the code much easier. Also, it makes character-based source restrictions relevant for the language. Which superset of ASCII is used mostly doesn't matter for the purpose of source restrictions.&lt;/li&gt;&#xA;&lt;li&gt;As a case study, the question mentions a deflate stream, but a deflate stream isn't a programming language, so I'll assume you meant Bubblegum, which is a proper superset thereof. But Bubblegum &lt;em&gt;does&lt;/em&gt; use a charset - it's the same one as is used by the Python 3 interpreter and it becomes relevant when the program's SHA-256 hash is &lt;code&gt;5e247c455fde7711206ebaa3ad0793114b77a6d16ed0497eff8e3bf98c6dba23&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The other language mentioned in the question is machine code (assumed x86). Sure, the instruction parser in a CPU couldn't care less how a byte within an instruction looks when you display it on the screen or which character it represents in ASCII, but there &lt;em&gt;is&lt;/em&gt; a thing called printable machine code - that is, the subset of machine code restricted to printable ASCII. It becomes relevant when you try to pull off arbitrary code execution on a remote web server.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="7209" LastEditorUserId="7209" LastEditDate="2017-04-12T13:28:07.993" LastActivityDate="2017-04-12T13:28:07.993" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12072" PostTypeId="2" ParentId="12063" CreationDate="2017-04-12T15:42:48.517" Score="15" Body="&lt;h2&gt;Good intentions, bad idea&lt;/h2&gt;&#xA;&lt;p&gt;While you have good intentions, using an external site to host a bunch of snippets will mean that we cannot rely on it always being there in a few years, because it's neither maintained nor paid for by Stack Exchange.&lt;/p&gt;&#xA;&lt;p&gt;If whatever domain you use to host this expires in the future, any questions and answers using this method would no longer have working snippets.&lt;/p&gt;&#xA;&lt;p&gt;Stack Exchange can be contacted about their snippets not working and a fix would be provided, but if we rely on you for all of our snippets, there's no guarantee that you'll be around to provide a fix if something breaks, and you're certainly not paid to fix it. Using the built-in method of creating a stack snippet is the most secure, most reliable method, and that makes it the best choice.&lt;/p&gt;&#xA;&lt;p&gt;A better alternative to simplify snippet creation would be if you created a snippet or program that could take JS as input and output markup for a working snippet that could be pasted into an answer.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-12T15:42:48.517" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12073" PostTypeId="2" ParentId="2140" CreationDate="2017-04-12T15:45:16.093" Score="0" Body="&lt;h2&gt;CRC Collision&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task: Accept a string (one could also include symbols in the string, does not have to be only alphabets and numbers) of any length as input, calculate 16bit CRC for the given string. Output a string of same length which gives you the exact same CRC sum.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input Text: Hello World!&#xA;Caclculated CRC : 0xF444&#xA;&#xA;Output Text (with same CRC): DW=9Mzk?7P4y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You may use in-built CRC libraries to calculate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Shortest code that fulfills the requirement wins! &lt;/p&gt;&#xA;" OwnerUserId="64070" LastEditorUserId="64070" LastEditDate="2017-04-12T16:00:07.260" LastActivityDate="2017-04-12T16:00:07.260" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12074" PostTypeId="2" ParentId="12069" CreationDate="2017-04-12T16:59:22.983" Score="8" Body="&lt;p&gt;Rather than propose a default encoding, I'm going to suggest an alternative route: &lt;em&gt;close the challenge as unclear&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it's unclear whether or not &lt;code&gt;65 66 67&lt;/code&gt; contains &lt;code&gt;A&lt;/code&gt;, that's the fault of the challenge. Get clarification from the challenge author on what is and isn't allowed.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-04-12T16:59:22.983" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12075" PostTypeId="2" ParentId="2140" CreationDate="2017-04-12T17:00:27.757" Score="0" Body="&lt;h1&gt;Golf me a golf-lang&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In any programing language of your choice write me an interpreter (or compiler targetting a reasonable pre-existing binary) for a golfing language. You will be scored based on a combination of the length of the interpreter and the golfiness of programs in your (user created language). In particular your goal will be to minimize the following formula.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;max((Interpreter Length in bytes),512)/16-25*(&quot;checkmarks&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A good answer will not only contain an interpreter, but also contain code samples and documentation to encourage use of your language. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The number of &quot;checkmarks&quot; a language has earned is the number of times an answer in your language has beat or tied with the best answer (out of languages which are submissions to this challenge) to an open, positively voted (score of +1 or higher) question (whatever the win criterion) which postdate your language and were not asked by its creator(s) (in the event of a community wiki submission).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your language will now be in a meta-competition around stack exchange, and you can earn checkmarks if other people choose to win other challenges with your competition. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;hr/&gt;&#xA;Note that use of eval (or similar) is banned. &#xA;You may write your interpreter/compiler in any preexisting programming language, and your language that you implement may be as similar as you wish to currently existing programming languages. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-design&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-design&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-design&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="46918" LastEditDate="2017-05-02T23:07:38.193" LastActivityDate="2017-05-02T23:07:38.193" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12078" PostTypeId="2" ParentId="202" CreationDate="2017-04-12T23:52:42.667" Score="0" Body="&lt;h1&gt;CGL (CGL Golfing Language)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codepen.io/programmer5000/pen/zwYrVd&quot; rel=&quot;nofollow noreferrer&quot;&gt;There is a CodePen online interpreter for it.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastActivityDate="2017-04-12T23:52:42.667" CommentCount="0" CommunityOwnedDate="2017-04-12T23:52:42.667" ContentLicense="CC BY-SA 3.0" />
  <row Id="12079" PostTypeId="1" AcceptedAnswerId="12080" CreationDate="2017-04-13T00:46:44.383" Score="2" ViewCount="99" Body="&lt;p&gt;I have an idea for a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question and, in my opinion, I believe that it is quite a difficult problem to code in the first place, let alone to golf.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've seen questions being closed for duplicates, being off-topic and others but was wondering if my question could be closed or put on hold for being &lt;em&gt;too&lt;/em&gt; difficult (or too easy for that matter)? Obviously I don't want this and haven't found anything regarding this so I wanted to know.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2017-04-13T01:20:36.157" Title="Can questions be too hard?" Tags="|support|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12080" PostTypeId="2" ParentId="12079" CreationDate="2017-04-13T01:20:36.157" Score="6" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;Challenges of all difficulties are usually welcome here, Even &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11033/are-challenges-that-may-not-be-solvable-on-topic-for-ppcg&quot;&gt;ones that aren't proven solvable.&lt;/a&gt; If a challenge is too unwelcoming, or too hard, it may receive no or negative attention, but it should never be considered off topic, in case those who prefer a challenge want to give it a shot.&lt;/p&gt;&#xA;&lt;p&gt;And most importantly, it's &lt;em&gt;very&lt;/em&gt; difficult to say if something is &lt;strong&gt;objectively&lt;/strong&gt; too hard. We're varying levels of skill, trying to enforce whether or not something is too hard is, ironically, too hard.&lt;/p&gt;&#xA;" OwnerUserId="58375" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-13T01:20:36.157" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12082" PostTypeId="2" ParentId="2140" CreationDate="2017-04-13T09:35:53.973" Score="1" Body="&lt;h1&gt;Heapify a list&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;META:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As a few people just pointed out, if you &lt;em&gt;sort&lt;/em&gt; the list, this also produces a correct heap. I'm now trying to come up with a more interesting application of heaps.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/data-structures&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;data-structures&amp;#39;&quot; rel=&quot;tag&quot;&gt;data-structures&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a list of integers, &lt;em&gt;heapify&lt;/em&gt; this list and return it. The sumission must have a worst case time complexity in &lt;code&gt;O(n)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your implementation can produce min- or max-heaps, whatever is more convenient.&lt;/li&gt;&#xA;&lt;li&gt;Sorting the list would solve the problem, but since the worst case complexity must be in &lt;code&gt;O(n)&lt;/code&gt; where &lt;code&gt;n&lt;/code&gt; is the length of the list, known sorting algorithms like quicksort fail to meet this requirement.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Definition&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A &lt;em&gt;min-heap&lt;/em&gt; is a &lt;a href=&quot;https://en.wikipedia.org/wiki/Binary_tree#Types_of_binary_trees&quot; rel=&quot;nofollow noreferrer&quot;&gt;complete binary tree&lt;/a&gt; where the values stored in the children of a any node are greater or equal than the ones stored in the node itself. (In a max heap it is the same just with condition &lt;em&gt;less or equal&lt;/em&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A heap can be easily represented using a list &lt;code&gt;L&lt;/code&gt; (here using 1 based indexing) where the children of the node at &lt;code&gt;L[k]&lt;/code&gt; are &lt;code&gt;L[2*k]&lt;/code&gt; (the &lt;em&gt;left&lt;/em&gt; child) and &lt;code&gt;L[2*k+1]&lt;/code&gt; (the &lt;em&gt;right&lt;/em&gt; child).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A list &lt;code&gt;L&lt;/code&gt; (lets say one based indexing is used) is (min)-&lt;em&gt;heapified&lt;/em&gt; if&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; L[k] &amp;gt;= L[2*k] and L[k] &amp;gt;= L[2*k+1] for all k&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For a max heap we just replace &lt;code&gt;&amp;gt;=&lt;/code&gt; with &lt;code&gt;&amp;lt;=&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Following image represents a &lt;em&gt;max heap&lt;/em&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/3/38/Max-Heap.svg&quot; height=&quot;200&quot; /&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The corresponding list representation is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[100, 19, 36, 17, 3, 25, 1, 2, 7]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The following image represents a &lt;code&gt;min heap&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/6/69/Min-heap.png&quot; height=&quot;200&quot; /&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The corresponding list representation is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1, 2, 3, 17, 19, 36, 7, 25, 100]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2017-06-09T21:12:26.400" LastActivityDate="2017-06-09T21:12:26.400" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12086" PostTypeId="1" AcceptedAnswerId="12088" CreationDate="2017-04-13T14:39:05.397" Score="-1" ViewCount="51" Body="&lt;p&gt;We currently have a Graduation script, which adds some utilities. However, we do need (or want) some more utilities, like a TIO Chrome extension.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do we need more? If we need more, How would we host them?&lt;/p&gt;&#xA;" OwnerUserId="64499" LastActivityDate="2017-04-13T14:48:38.370" Title="Do we need some extension softwares? (Ex. TIO Chrome/Firefox extension)" Tags="|discussion|" AnswerCount="1" CommentCount="3" ClosedDate="2017-04-13T16:10:45.687" ContentLicense="CC BY-SA 3.0" />
  <row Id="12088" PostTypeId="2" ParentId="12086" CreationDate="2017-04-13T14:48:38.370" Score="4" Body="&lt;h2&gt;No&lt;/h2&gt;&#xA;&lt;p&gt;We do not really need them.&lt;/p&gt;&#xA;" OwnerUserId="14215" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-13T14:48:38.370" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12090" PostTypeId="2" ParentId="6918" CreationDate="2017-04-13T15:23:15.303" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codepen.io/programmer5000/pen/zwYrVd&quot; rel=&quot;nofollow noreferrer&quot;&gt;CGL (CGL Golfing Language)&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;CGL was created two days ago (4/11/17) by me. It uses a stack concept like other languages, but unlike other languages there are multiple stacks that you manipulate instead of one. You start on the &lt;code&gt;0&lt;/code&gt;th stack, which is empty by default. The &lt;code&gt;-1&lt;/code&gt;th stack contains each input argument. All other stacks (integers) can be used for anything. Most operators either push something to the stack based on something already on the stack or perform an operation on all elements of the current stack.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codepen.io/programmer5000/pen/zwYrVd&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here is the interpreter&lt;/a&gt; (docs coming soon)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user58826" LastActivityDate="2017-04-13T15:23:15.303" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12091" PostTypeId="2" ParentId="2140" CreationDate="2017-04-13T19:51:35.937" Score="0" Body="&lt;h1&gt;Display a fractal maze&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Based on this Puzzling.SE question: &lt;a href=&quot;https://puzzling.stackexchange.com/q/37675/16128&quot;&gt;Alice and the Fractal Hedge Maze&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a description of a maze as input, output a [graphical / ASCII-art ?] representation of the maze.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/TKkA1.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/TKkA1.png&quot; alt=&quot;Maze layout&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the purpose of this challenge, all inner mazes are assumed to be smaller copies of the original maze. So a top-down view of the above maze would look like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/DaMfJ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/DaMfJ.png&quot; alt=&quot;top-down view showing recursion&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input will be given as a list of connections between different ports of the same level of the maze and the inner sub-mazes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One list of connections for the above maze would be the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1,12,a5,a12&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is because, in the maze, ports 1 and 12 are connected to each other, and they are also connected to ports 5 and 12 of sub-maze A.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A full description of the above example maze would be the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a3      (note that a connection by itself means this is the starting point)&#xA;1,12,a5,a12&#xA;2,8,10,a9,c4&#xA;3,b1,b4&#xA;4,b5,b6&#xA;5,d4,d5&#xA;6,d8&#xA;7,b7,d10&#xA;9,c7,c11&#xA;11,a10&#xA;b8,d1,d3&#xA;b11,b12&#xA;c2,c12&#xA;d11,d12&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Flexibility:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You may take each port like above or as a tuple with numbers instead of letters, such as using &lt;code&gt;0&lt;/code&gt; for the outer maze and numbering the inner mazes sequentially. So the following would all be acceptable for a line:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2,8,10,a9,c4&#xA;[2,8,10,(1,9),(3,4)]&#xA;[2,8,10,('A',9),('C',4)]&#xA;[(0,2),(0,8),(0,10),(1,9),(3,4)]&#xA;[(0,2),(0,8),(0,10),(-1,9),(-3,4)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The starting point will be by itself. You can take it in the list as a port by itself, or as a separate parameter. The starting position will always be an entrance to a sub-maze. Each port will be listed at most once in the input. Note that not all ports have to be listed, as there are some dead ends.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Output a representation of the maze given. Note that mazes may require bridging of paths (crossing without connection).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Note: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; ?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/maze&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;maze&amp;#39;&quot; rel=&quot;tag&quot;&gt;maze&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="34718" LastActivityDate="2017-04-13T19:51:35.937" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12092" PostTypeId="2" ParentId="2140" CreationDate="2017-04-13T20:41:23.243" Score="0" Body="&lt;p&gt;&lt;strong&gt;Which answer is correct?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've posted an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/116374/which-answer-is-correct&quot;&gt;earlier version of this question&lt;/a&gt; already; but now hoping to refine here before correcting the original post.  Thanks all in advance for any advise.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I saw this elegant logic puzzle on &lt;a href=&quot;https://math.stackexchange.com/questions/2217248/which-answer-in-this-list-is-the-correct-answer-to-this-question.&quot;&gt;Mathematics&lt;/a&gt;: &lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;Which answer in this list is the correct answer to this question?&#xA;&#xA; 1. All of the below.&#xA; 2. None of the below.&#xA; 3. All of the above.&#xA; 4. One of the above.&#xA; 5. None of the above.&#xA; 6. None of the above.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;One user submitted a &lt;a href=&quot;https://math.stackexchange.com/a/2217333&quot;&gt;nice answer in code&lt;/a&gt; (quoted below), which inspired this puzzle.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Task:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write code which determines the answer to the above logic puzzle according to standard Code Golf rules (i.e. a working solution with the minimum number of characters wins).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input should be a sequence (i.e. ordered list / array) with each item in that sequence representing one of the given statements.&#xA;Each items in the list should hold 2 values:&#xA;- the first representing &lt;code&gt;All&lt;/code&gt;, &lt;code&gt;One&lt;/code&gt;, or &lt;code&gt;None&lt;/code&gt;.&#xA;- the second representing &lt;code&gt;above&lt;/code&gt;, or &lt;code&gt;below&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The result should be a list/array of the indices of any correct answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following test scenarios are considered invalid; i.e. your code would not be expected to handle such data:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A statement is the first statement in the sequence and refers to &lt;code&gt;the above&lt;/code&gt;, it evaluates to false.&lt;/li&gt;&#xA;&lt;li&gt;A statement is the last statement in teh sequence and refers to &lt;code&gt;the below&lt;/code&gt;, it evaluates to false.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;We should be optimistic about results.  i.e. given the following, the program would return &lt;code&gt;1, 2&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1. all of the below&#xA;2. one of the above&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;When contradictions occur, neither statement is correct.  i.e. the following would return a blank string.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1. none of the below&#xA;2. none of the above&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Code for Referenced Answer&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;// gcc ImpredictivePropositionalLogic1.c -o ImpredictivePropositionalLogic1.exe -std=c99 -Wall -O3&#xA;&#xA;/*&#xA;Which answer in this list is the correct answer to this question?&#xA;&#xA;(a) All of the below.&#xA;(b) None of the below.&#xA;(c) All of the above.&#xA;(d) One of the above.&#xA;(e) None of the above.&#xA;(f) None of the above.&#xA;*/&#xA;&#xA;#include &amp;lt;stdio.h&amp;gt;&#xA;#define iff(x, y) ((x)==(y))&#xA;&#xA;int main() {&#xA;  printf(&quot;a b c d e f\n&quot;);&#xA;  for (int a = 0; a &amp;lt;= 1; a++)&#xA;  for (int b = 0; b &amp;lt;= 1; b++)&#xA;  for (int c = 0; c &amp;lt;= 1; c++)&#xA;  for (int d = 0; d &amp;lt;= 1; d++)&#xA;  for (int e = 0; e &amp;lt;= 1; e++)&#xA;  for (int f = 0; f &amp;lt;= 1; f++) {&#xA;    int Ra = iff(a, b &amp;amp;&amp;amp; c &amp;amp;&amp;amp; d &amp;amp;&amp;amp; e &amp;amp;&amp;amp; f);&#xA;    int Rb = iff(b, !c &amp;amp;&amp;amp; !d &amp;amp;&amp;amp; !e &amp;amp;&amp;amp; !f);&#xA;    int Rc = iff(c, a &amp;amp;&amp;amp; b);&#xA;    int Rd = iff(d, (a &amp;amp;&amp;amp; !b &amp;amp;&amp;amp; !c) || (!a &amp;amp;&amp;amp; b &amp;amp;&amp;amp; !c) || (!a &amp;amp;&amp;amp; !b &amp;amp;&amp;amp; c));&#xA;    int Re = iff(e, !a &amp;amp;&amp;amp; !b &amp;amp;&amp;amp; !c &amp;amp;&amp;amp; !d);&#xA;    int Rf = iff(f, !a &amp;amp;&amp;amp; !b &amp;amp;&amp;amp; !c &amp;amp;&amp;amp; !d &amp;amp;&amp;amp; !e);&#xA;&#xA;    int R = Ra &amp;amp;&amp;amp; Rb &amp;amp;&amp;amp; Rc &amp;amp;&amp;amp; Rd &amp;amp;&amp;amp; Re &amp;amp;&amp;amp; Rf;&#xA;    if (R) printf(&quot;%d %d %d %d %d %d\n&quot;, a, b, c, d, e, f);&#xA;  }&#xA;  return 0;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test Cases&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To represent the conditions in these test cases I've used the following convention:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;[&lt;/code&gt;...&lt;code&gt;]&lt;/code&gt; to represent the entire sequence&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(match,direction)&lt;/code&gt; to represent each item where match and direction have values:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Match:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;0&lt;/code&gt; - None of the&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1&lt;/code&gt; - One of the &lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;2&lt;/code&gt; - All of the &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Direction:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;0&lt;/code&gt; - below&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1&lt;/code&gt; - above&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;1. The Original&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;    (2,0)  //all of the below&#xA;    ,(0,0) //none of the below&#xA;    ,(2,1) //all of the above&#xA;    ,(1,1) //one of the above&#xA;    ,(0,1) //none of the above&#xA;    ,(0,1) //none of the above&#xA;]&#xA;&#xA;//expected answer is 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;2. Both&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;    (2,0)  //all of the below&#xA;    ,(1,1) //one of the above&#xA;]&#xA;&#xA;//expected answer is 1, 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;3. Neither&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;    (0,0)  //none of the below&#xA;    ,(0,1) //none of the above&#xA;]&#xA;&#xA;//expected answer is (nothing)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;4. Simple&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;    (2,0)  //all of the below&#xA;    ,(0,1) //none of the above&#xA;]&#xA;&#xA;//expected answer is 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="6776" LastEditorUserId="6776" LastEditDate="2017-04-15T08:35:59.693" LastActivityDate="2017-04-15T08:35:59.693" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12093" PostTypeId="2" ParentId="2522" CreationDate="2017-04-13T21:27:35.497" Score="2" Body="&lt;h1&gt;Seek Inspiration in Everyday Life&lt;/h1&gt;&#xA;&lt;p&gt;I have done this with very successful results. For example &lt;a href=&quot;https://codegolf.stackexchange.com/q/116113/64159&quot;&gt;this question&lt;/a&gt; was inspired by looking at a multiple-choice test and seeing when I answered the same letter multiple times in a row.&lt;/p&gt;&#xA;&lt;p&gt;The more challenges one conceives, the greater the chances that one of them will be successful. So always be on the lookout for a new challenge.&lt;/p&gt;&#xA;" OwnerUserId="64159" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-13T21:27:35.497" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12094" PostTypeId="1" CreationDate="2017-04-14T01:42:56.057" Score="0" ViewCount="58" Body="&lt;p&gt;I am currently taking two analysis courses at my university right now, and will likely be taking some form of analysis for the next two semesters as well so I thought I would try my hand at some analysis code golf questions.  However when I searched &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/analysis&quot;&gt;&lt;code&gt;[analysis]&lt;/code&gt;&lt;/a&gt; I came up with no results because the tag does not exist.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we have an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/analysis&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;analysis&amp;#39;&quot; rel=&quot;tag&quot;&gt;analysis&lt;/a&gt; tag?  If so what kind of questions would fall under &quot;analysis&quot;?  If we decide on some criteria are there any existing questions that should be tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/analysis&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;analysis&amp;#39;&quot; rel=&quot;tag&quot;&gt;analysis&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-04-14T09:02:12.670" Title="New Tag proposal: analysis" Tags="|discussion|tags|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12095" PostTypeId="2" ParentId="12094" CreationDate="2017-04-14T01:42:56.057" Score="-1" Body="&lt;h1&gt;Yes, we should have &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/analysis&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;analysis&amp;#39;&quot; rel=&quot;tag&quot;&gt;analysis&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I may have tipped my hand in asking this question, but I think it would be a good idea.  These questions might not be the easiest tag for programming challenges because they often deal with the infinite, but there are still plenty of interesting and unique challenges that could be asked.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is a mock up of what the tag description/wiki might look like:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Description:&lt;/h2&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Analysis is the study of limits, convergence, and related concepts such as differentiation and continuity.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Wiki:&lt;/h2&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This tag is for questions that explore the topics of &lt;a href=&quot;https://en.wikipedia.org/wiki/Mathematical_analysis&quot; rel=&quot;nofollow noreferrer&quot;&gt;Mathematical analysis&lt;/a&gt;.  Analysis has a number of subfields pertaining to more specific topics.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://math.stackexchange.com/tags/real-analysis/info&quot;&gt;Real analysis&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Real analysis is the branch of analysis that is concerned with functions on the &lt;a href=&quot;https://en.wikipedia.org/wiki/Real_number&quot; rel=&quot;nofollow noreferrer&quot;&gt;Real numbers&lt;/a&gt;.  It includes topics such as &lt;a href=&quot;https://en.wikipedia.org/wiki/Convergence_(mathematics)&quot; rel=&quot;nofollow noreferrer&quot;&gt;convergence&lt;/a&gt;, &lt;a href=&quot;https://en.wikipedia.org/wiki/Continuous_function&quot; rel=&quot;nofollow noreferrer&quot;&gt;continuity&lt;/a&gt;, &lt;a href=&quot;https://en.wikipedia.org/wiki/Metric_space&quot; rel=&quot;nofollow noreferrer&quot;&gt;metric spaces&lt;/a&gt; and &lt;a href=&quot;https://en.wikipedia.org/wiki/Smooth_function&quot; rel=&quot;nofollow noreferrer&quot;&gt;smoothness&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://math.stackexchange.com/tags/complex-analysis/info&quot;&gt;Complex analysis&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Complex analysis is concerned with functions of complex variables. Complex analysis is concerned with the extension of the ideas of real analysis into the complex plane. Important topics in Complex analysis include analyticity, branch cuts and residues.  Questions about complex numbers but not specifically about analysis should be tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/complex-numbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;complex-numbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;complex-numbers&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/analysis&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;analysis&amp;#39;&quot; rel=&quot;tag&quot;&gt;analysis&lt;/a&gt; should be used for topics in these areas as well&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I have made this community wiki so anyone may help me complete it as they see fit.  I am not very familiar with functional analysis so if someone would like to add a bit about that I would be pleased.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-04-14T01:42:56.057" CommentCount="0" CommunityOwnedDate="2017-04-14T01:42:56.057" ContentLicense="CC BY-SA 3.0" />
  <row Id="12099" PostTypeId="1" CreationDate="2017-04-14T08:55:22.187" Score="0" ViewCount="162" Body="&lt;p&gt;Cross-codes is making a crossword puzzle, but with codes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, We have a 10*10 (not constant, this means the size may vary for each contest) grid:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And your code is &lt;code&gt;MY_CODE&lt;/code&gt;, you can place your code anywhere in the grid, vertically or horizontally.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;..........&#xA;...MY_CODE&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Next, Let's assume the next code is &lt;code&gt;MOM&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The poster could place it like&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;..........&#xA;...MY_CODE&#xA;...O......&#xA;...M......&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;But not like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;..........&#xA;..MMY_CODE&#xA;..O.......&#xA;..M.......&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;..........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Because it is adjacent to another code which is &lt;code&gt;MY_CODE&lt;/code&gt;, making it look like &lt;code&gt;MMY_CODE&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner would be the one with the most codes placed, when there is nobody able to place a new code on the grid for a set time period (ex.1 week).&lt;/p&gt;&#xA;" OwnerUserId="64499" LastEditorUserId="68942" LastEditDate="2021-06-09T05:41:07.117" LastActivityDate="2021-06-09T05:41:07.117" Title="New contest type proposal: cross-codes" Tags="|feature-request|status-declined|tags|winning-criteria|" AnswerCount="0" CommentCount="5" ClosedDate="2017-04-14T14:10:56.797" ContentLicense="CC BY-SA 3.0" />
  <row Id="12100" PostTypeId="2" ParentId="12094" CreationDate="2017-04-14T09:02:12.670" Score="2" Body="&lt;h2&gt;Maybe, but definitely not with that name&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;One problem which pretty much every StackExchange site has is mistagging due to people starting to type a tag and selecting something from the autocomplete without reading (or maybe just without understanding) the short description. The word &lt;em&gt;analysis&lt;/em&gt; has a general English meaning which is far broader than the technical meaning it has acquired in mathematics, so creating a tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/analysis&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;analysis&amp;#39;&quot; rel=&quot;tag&quot;&gt;analysis&lt;/a&gt; for the mathematical field would result in it being used wrongly more often than it's used correctly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/mathematical-analysis&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;mathematical-analysis&amp;#39;&quot; rel=&quot;tag&quot;&gt;mathematical-analysis&lt;/a&gt; risks being overapplied. It may be better to use more specific tags for subfields (e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/calculus&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;calculus&amp;#39;&quot; rel=&quot;tag&quot;&gt;calculus&lt;/a&gt; already exists) and then to mention the other subfields under a &quot;Related tags&quot; section in the tag wiki so that people who want to add them to favourite tags can.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-04-14T09:02:12.670" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12103" PostTypeId="1" AcceptedAnswerId="12104" CreationDate="2017-04-14T12:48:17.450" Score="16" ViewCount="1438" Body="&lt;p&gt;My &lt;a href=&quot;https://codegolf.stackexchange.com/q/115961/8927&quot;&gt;latest question&lt;/a&gt; was well received but has sat idle for a few days now. That's pretty much what I'd expect, since it's quite involved, but I was hoping it might get at least 1 answer over the week.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have my own solution which I created before posting the question to check if there were any gotchya's I'd need to take account of, and I've done some basic golfing so it could even be a contender itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My original intent was to post this after getting a couple of answers, but I'm wondering if posting it early might help to kick-start others (giving a sample of how it can be done in one language may help implementations in others). Of course the alternative is that having an answer may discourage others from bothering.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've seen on meta that it's generally considered best to wait &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/98/8927&quot;&gt;at least a day&lt;/a&gt; before self-answering, but I don't know how this scales to more complex challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Has anybody experienced this? Is it better to post now, or wait longer?&lt;/p&gt;&#xA;" OwnerUserId="8927" LastActivityDate="2017-04-17T12:36:30.693" Title="Self-answering kick-starts answers, or discourages them?" Tags="|discussion|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12104" PostTypeId="2" ParentId="12103" CreationDate="2017-04-14T13:34:37.203" Score="27" Body="&lt;h1&gt;Wait for other answers&lt;/h1&gt;&#xA;&lt;h3&gt;In general:&lt;/h3&gt;&#xA;&lt;p&gt;Self-answering a challenge early on (especially as the first answer) is frowned upon and discourages other answers. Part of the purpose of a challenge is for people to &lt;strong&gt;find their own solution&lt;/strong&gt;, without having to filter out knowledge of what your method is. It allows people to be more creative.&lt;/p&gt;&#xA;&lt;p&gt;If you post a really good contender early on, people may think you intend to win your own challenge by preparing a solution ahead of time or rigging the challenge such that you know the best answer.&lt;/p&gt;&#xA;&lt;p&gt;In short, give other people a chance to answer.&lt;/p&gt;&#xA;&lt;h3&gt;More complex challenges:&lt;/h3&gt;&#xA;&lt;p&gt;In your case, since the challenge is more complex, you should consider adding a bounty after a few days. The more difficult the challenge, the bigger the bounty may need to be to attract an answer.&lt;/p&gt;&#xA;&lt;p&gt;If you still don't receive an answer, you could choose to post your answer. Since the bounty will have been wasted, you could choose to create a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5243/34718&quot;&gt;bounty with no deadline&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-16T00:06:25.760" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="12105" PostTypeId="2" ParentId="2140" CreationDate="2017-04-14T15:23:03.197" Score="1" Body="&lt;h1&gt;Median fractals&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fractal&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fractal&amp;#39;&quot; rel=&quot;tag&quot;&gt;fractal&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I define 'Median fractal' as this.&lt;/p&gt;&#xA;&lt;p&gt;Median fractal L&lt;sub&gt;1&lt;/sub&gt; is a equilateral triangle.&lt;/p&gt;&#xA;&lt;p&gt;for median fractal L&lt;sub&gt;n&lt;/sub&gt;, Draw L&lt;sub&gt;n-1&lt;/sub&gt;, then for each triangle, draw all 3 medians in the triangle.&lt;/p&gt;&#xA;&lt;p&gt;You will be given an integer &lt;code&gt;n&lt;/code&gt;, draw L&lt;sub&gt;n&lt;/sub&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&lt;p&gt;Any suggestions, guys?&lt;/p&gt;&#xA;" OwnerUserId="64499" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-15T12:49:39.743" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12106" PostTypeId="1" CreationDate="2017-04-14T18:53:04.967" Score="2" ViewCount="242" Body="&lt;p&gt;I recently posted an answer on the Hello, World question and after posting, discovered  &lt;a href=&quot;https://codegolf.stackexchange.com/a/116525/66833&quot;&gt;this&lt;/a&gt; answer claiming to do it in 18 bytes in brainfuck. I read through it and thought that it was completely wrong and so notified the OP in the comments. We then had a bit of an argument about whether this is a valid answer but we couldn't settle it so I thought I'd post this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can anyone settle this debate? Surely his answer is invalid?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2017-04-19T01:15:04.610" Title="Is this answer valid?" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12107" PostTypeId="2" ParentId="12106" CreationDate="2017-04-14T19:17:27.040" Score="8" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I believe that this is not a valid answer because according to the &lt;a href=&quot;https://esolangs.org/wiki/Brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolangs Wiki&lt;/a&gt;, all characters other than &lt;code&gt;[]&amp;lt;&amp;gt;,.+-&lt;/code&gt; are comments and are ignored. There is no extension listed on the wiki that behaves the way the user claims.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;However&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If there exists a language (SMBF as Zwei mentioned) or an interpreter that does behave that way, then it is a valid answer, but it is not a valid Brainf**k program as the user claims it to be.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Therefore&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For now, it is an invalid answer. If the user can provide an interpreter that behaves this way for either a BF variant or another similar language, then it is valid; however, if the user fails to provide a working interpreter (that was created before the challenge), then the answer is invalid and should be removed.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;In addition&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If a valid interpreter is created after a challenge, as @Riker said, it is still allowed as a non-competing answer, and shouldn't be deleted. If an interpreter was created specifically to address this challenge in zero or one byte(s), then it is usually not welcomed.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;However&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In this case, because the Hello World challenge is catalogue challenge, there are no &quot;non-competing&quot; answers, so even if the intepreter were created after the challenge, it would still be perfectly fine.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Note: Fails&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The answer doesn't even work.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Note: Duplicate&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The answer, when modified to actually work, would just be practically a duplicate of @mbomb007's answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The answer has since been deleted.&lt;/p&gt;&#xA;" OwnerDisplayName="user42649" LastEditorDisplayName="user42649" LastEditDate="2017-04-19T01:15:04.610" LastActivityDate="2017-04-19T01:15:04.610" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="12110" PostTypeId="1" CreationDate="2017-04-15T17:55:06.440" Score="9" ViewCount="120" Body="&lt;p&gt;I often see comments on questions which just say&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;//&quot; rel=&quot;nofollow noreferrer&quot;&gt;Related&lt;/a&gt; &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;and link to another question. What's the point? When should I add links like this?&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-04-15T17:55:06.440" Title="&quot;Related&quot; links in comments" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12111" PostTypeId="2" ParentId="12110" CreationDate="2017-04-15T17:55:06.440" Score="15" Body="&lt;p&gt;The sidebar on a question has a section under the heading &quot;Related&quot; which links to other questions and is generated automatically based on searching for similar words. But questions which are explicitly linked are pulled to the top under the heading &quot;Linked&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In most sites in the StackExchange network these links have a dual purpose, along the lines of &quot;If you found this question and its answers useful, you might find these useful too; and if it wasn't quite what you were looking for, maybe one of these is&quot;. PPCG breaks the mould a bit, but fundamentally the sidebar still functions as a recommendation system.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore the purpose of these &quot;Related&quot; links in comments is to highlight the questions from the &quot;Related&quot; sidebar which are most relevant (either as potentially sharing techniques, or as potentially interesting to the same people), or to add questions which aren't picked up by word similarity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that the point is &lt;em&gt;not&lt;/em&gt; to claim that the question is a dupe, borderline dupe, or near dupe. In that case, the comment should say so explicitly.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-04-15T17:55:06.440" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12113" PostTypeId="2" ParentId="2140" CreationDate="2017-04-16T17:44:58.413" Score="-2" Body="&lt;h1&gt;You've been Thunderstruck!&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Background&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A &quot;fun&quot; drinking game is based on the classical hard rock song by AC/CD: &lt;a href=&quot;https://www.youtube.com/watch?v=v2AC41dglnM&quot; rel=&quot;nofollow noreferrer&quot;&gt;Thunderstruck&lt;/a&gt;. The Thunderstruck drinking game starts when the song starts. When the word &quot;thunder&quot; is heard, the first person starts drinking, not stopping until the word &quot;thunder&quot; is said again. At that point, the next person begins to drink. This continues around the circle until the song ends.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &quot;twist&quot; is that in the middle of the song, there is an entire verse where thunder is not uttered once. The person who gets this part -- and thus has to drink for the longest period of time -- is said to have been &lt;em&gt;thunderstruck&lt;/em&gt;. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Input:&lt;/em&gt; An Integer number of players.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Output:&lt;/em&gt; Which player got thunderstruck&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:  1&#xA;Output: 1&#xA;&#xA;Input:  2&#xA;Output: 1&#xA;&#xA;Input:  3&#xA;Output: 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Here are the rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Assume that the number of players always is a positive integer.&lt;/li&gt;&#xA;&lt;li&gt;Output should always give a positive integer. &lt;/li&gt;&#xA;&lt;li&gt;You are not allowed to hardcode the number of times before the &quot;solo&quot; / long verse. Meaning your code has to find the longest part without the word thunderstruck, on its own. &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://genius.com/Ac-dc-thunderstruck-lyrics&quot; rel=&quot;nofollow noreferrer&quot;&gt;Use the following lyrics for thunderstruck&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Shortest code wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="33193" LastActivityDate="2017-04-16T17:44:58.413" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12115" PostTypeId="2" ParentId="2140" CreationDate="2017-04-17T04:36:38.537" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; These would be separate questions, and each would link to the other.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Cops: Make a bad password policy&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Over the years, people have come up with some &lt;a href=&quot;http://www.davidpashley.com/2014/04/16/bad-password-policies/&quot; rel=&quot;nofollow noreferrer&quot;&gt;pretty bad password policies&lt;/a&gt;. Your challenge is to make such a policy, and to make a program that takes advantage of the weakness of this policy to brute force passwords written in it (a &quot;crack&quot;). For details on what constitutes a &quot;crack&quot;, see the robber thread [link]. It should restrict the user to as small a selection of passwords as possible. Robbers will attempt to find cracks for your policy. If your answer is uncracked after 7 days, you make mark it safe by posting your crack. The &quot;worst&quot; uncracked policy (that is, the one that allows the fewest passwords) wins. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &quot;policy&quot; is defined as a list of well-defined restrictions (&quot;rules&quot;) on valid passwords. Here is an example:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Passwords must contain only digits, letters, and the characters '*&amp;amp;^'.&lt;/li&gt;&#xA;  &lt;li&gt;Passwords must be at most 8 characters long. &lt;/li&gt;&#xA;  &lt;li&gt;Passwords must not contain dictionary words (if you use this one, you must use a freely and programmatically accessible dictionary and tell us where to find it).&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Policies:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;must contain no more than 10 rules,&lt;/li&gt;&#xA;&lt;li&gt;may not involve encryption of any kind, and&lt;/li&gt;&#xA;&lt;li&gt;must be clear and unambiguous&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For example, these would be a bad rules:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;The MD5 hash or zipfile of the password must not contain the letter &quot;a&quot;. (Uses encryption of a sort)&lt;/li&gt;&#xA;  &lt;li&gt;Passwords may not contain special characters. (It's unclear what counts as a special character)&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Your answer must contain both the policy and the number of passwords it allows. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Robbers: Crack the bad password policy&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Over the years, people have come up with some &lt;a href=&quot;http://www.davidpashley.com/2014/04/16/bad-password-policies/&quot; rel=&quot;nofollow noreferrer&quot;&gt;pretty bad password policies&lt;/a&gt;. Your challenge is to crack such a policy. These can be found in the cops thread [link]. To crack a policy, write a program to brute force passwords that adhere to that policy. Your program must run in linear time on the number of possible passwords allowed by the policy. You may do this by enumerating or iterating over all possible passwords in some way, such as by calling a function (called, for example, &lt;code&gt;guessPassword&lt;/code&gt;) for each possible password. One option is to simply hardcode the possible passwords, if there are only a few. Here is an example (JavaScript):&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;function* getPasswords() {&#xA;    yield* ['a', 'b', 'c'];&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or, using the second approach:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;function bruteForce() {&#xA;    for (let pw of ['a', 'b', 'c']) {&#xA;        if (guessPassword(pw)) {&#xA;            return pw;&#xA;        }&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Whoever cracks the most policies wins.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the linear time approach good? My original thought was just &quot;your program must halt in a reasonable time&quot;, but that seems too vague, and this allows a person to crack even policies with a lot of possible passwords (though those hopefully wouldn't win anyway).&lt;/li&gt;&#xA;&lt;li&gt;I could also just say, &quot;pick a password in your policy and robbers will try to crack it&quot;, maybe having the cops supply a hash of the password.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56183" LastEditorUserId="56183" LastEditDate="2017-04-17T16:06:48.420" LastActivityDate="2017-04-17T16:06:48.420" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12119" PostTypeId="2" ParentId="12103" CreationDate="2017-04-17T12:36:30.693" Score="-2" Body="&lt;h1&gt;It's a great way to get answers started&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I have used this technique on many of my challenges. On one, it was mostly un-noticed until I added an answer of my own. It helped to clarify the details of the challenge, give something for less-experienced golfers to start with, and show one way of solving the problem. I was out-golfed shortly, but this answer was necessary to start the competition. &lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastActivityDate="2017-04-17T12:36:30.693" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12120" PostTypeId="2" ParentId="2140" CreationDate="2017-04-17T15:53:16.777" Score="0" Body="&lt;p&gt;Help me discover myself!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hola,&#xA;People call me &lt;code&gt;file&lt;/code&gt;. At any point of time, all I know is how people compile me. Some use &lt;code&gt;gcc&lt;/code&gt; some use &lt;code&gt;gpp&lt;/code&gt; and some &lt;code&gt;Java&lt;/code&gt; and some even &lt;code&gt;csc&lt;/code&gt;. I couldn't really figure out who I am with just this info! &lt;/p&gt;&#xA;&#xA;&lt;p&gt;All I can do for you to help me is show a snippet inside me for you to find out the programming language. If you couldn't find with the snippet(the snippet will not have any incomplete line of code), only then can I share how programmers compile me. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;And yes, you are brilliant enough to find out the language in which the program in me is written!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I may have...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example1:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input1:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;int main(){return 0;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output1:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;c|cpp&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input2:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;gpp&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output2:&#xA;    c++&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;or&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input2:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;gcc&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output2:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;c&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 2:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input1:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#include&amp;lt;iostream&amp;gt;&#xA;int main(){return 0;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output1:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;c++&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example3:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input1:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;main(){}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output1:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;c&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the above example can't possibly be java because the mandatory return type for the method in java is missing.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example4:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input1:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#include&amp;lt;stdio.h&amp;gt;&#xA;main(){}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output1:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;c&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example5:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input1:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;class hola{public static void main(){}}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output1:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;java&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example6:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input1:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;class Hola{public static void Main(){}}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output1:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;c#&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Oh yeah, I also know few things that might be helpful for you. The snippet that I'm allowed to share is only headers and the main function - first function that is called when program is executed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And also, there are some conventions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And then,&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;c    - return type for main is not mandatory, standard header is stdio.h&lt;/li&gt;&#xA;&lt;li&gt;c++ return type is mandatory, standard header is iosstream&lt;/li&gt;&#xA;&lt;li&gt;c# - Main is a title - first letter is caps!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input format&lt;/strong&gt; Any code snippet it is more than enough if your answer identifies the above given six example snippet. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output format&lt;/strong&gt; programming language in which the snippet possibly fits in.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code golf and hence shortest code in each language wins!&lt;/p&gt;&#xA;" OwnerUserId="67429" LastEditorUserId="67429" LastEditDate="2017-04-17T19:23:20.573" LastActivityDate="2017-04-17T19:23:20.573" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="12122" PostTypeId="1" CreationDate="2017-04-17T20:03:26.013" Score="4" ViewCount="79" Body="&lt;p&gt;I was looking at a question and I saw this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/yfRDQ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/yfRDQ.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It looks like a bounty ad's image wasn't loading. In case you are wondering, the image URL was &lt;a href=&quot;https://stack-exchange-dynamic-ads.herokuapp.com/codegolf.stackexchange.com/bounty.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://stack-exchange-dynamic-ads.herokuapp.com/codegolf.stackexchange.com/bounty.png&lt;/a&gt; and it was failing with a HTTP 500, and I wasn't logged in when this happened.. Could someone fix this?&lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastEditorUserId="68942" LastEditDate="2021-07-01T19:28:18.013" LastActivityDate="2021-07-01T19:28:18.013" Title="Bounty ad not appearing correctly" Tags="|bug|status-norepro|bounty|advertising|" AnswerCount="0" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12125" PostTypeId="2" ParentId="2140" CreationDate="2017-04-18T00:56:52.433" Score="-4" Body="&lt;p&gt;&lt;strong&gt;Make a Login Screen&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Challenge: make code that asks the user to enter a username and password.  The username and password should be hard coded, but they must not be visible: you cannot have the entire username or the entire password in plain text in the code.  Both the username and the password must be 8 characters long.  Upon the incorrect username or password, some error should be displayed.  It would be good if there are multiple &quot;accounts&quot; that would display different text on login.  The password field should not be visible (Only asterisks or something).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is Code-Golf, Shortest answer wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard loopholes are forbidden.&lt;/p&gt;&#xA;" OwnerUserId="65245" LastActivityDate="2017-04-18T00:56:52.433" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12127" PostTypeId="2" ParentId="286" CreationDate="2017-04-18T07:51:29.930" Score="-6" Body="&lt;p&gt;A new scoring mechanism could be made. Instead of counting the bytes of the source code, count how many operators are used (maybe with defines, functions called, variables declared (including struct and array elements) such as:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;//Still inefficient to show examples&#xA;#include &amp;lt;iostream&amp;gt; //Includes are free, because &quot;built in's&quot; are already global&#xA;#define ret return //Doesn't make returns free by using r, still counts as a return.&#xA;//Comments are free too&#xA;int add (int, int);//Declaring functions is free&#xA;void printMe();&#xA;&#xA;int main(){ //Free, main function is free, as long as all returns in this function return the same value. (I.E. No return 0 if this, return 1 if that.)&#xA;    printMe();&#xA;    ret 0;&#xA;}&#xA;&#xA;int add(int a, int b){ //This is also free. But, calling functions makes points, depending on what it returns and what arguments are passed. This would be 3 points, because it has two arguments, uses the + operator which takes two numbers, and has a return. Using a default argument in an overloaded function (such as &#xA;    ret a+b;&#xA;}&#xA;&#xA;void printMe(){&#xA;    std::cout &amp;lt;&amp;lt; &quot;The sum of 3 and 5 is &quot; &amp;lt;&amp;lt; add(3, 5) &amp;lt;&amp;lt; '\n'; //Two function calls: operator&amp;lt;&amp;lt;, and add &#xA;    //std::cout is a basic output function. If all a function does is present data to the user, then it is only 1 point. The string argument does not add a penalty.&#xA;    //The add and the newline also is free. It counts as the same call. printf(string);, printf(add);, and printf('\n'); are all just one point.&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And golf languages could be&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Д (Print &quot;The sum of 3 and 5 is&quot; and the sum of 3+5 to console), equivalent to three &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or something like that. Could be good to discuss.&lt;/p&gt;&#xA;" OwnerUserId="64958" LastActivityDate="2017-04-18T07:51:29.930" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12128" PostTypeId="1" CreationDate="2017-04-18T13:11:45.837" Score="5" ViewCount="264" Body="&lt;p&gt;I recently answered a polyglot challenge (my answer is &lt;a href=&quot;https://codegolf.stackexchange.com/a/116893/42649&quot;&gt;here&lt;/a&gt;). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm using Python 2 and Python 3, abusing the floor division of py2. However, a commenter asked me if using the same language but different (major) versions is allowed. My question is, is this allowed? I recall seeing it before so I think so, but I would like to confirm. &lt;/p&gt;&#xA;" OwnerDisplayName="user42649" LastEditorUserId="46271" LastEditDate="2017-04-18T14:06:29.953" LastActivityDate="2017-04-20T01:16:12.657" Title="Same language different version for polyglots" Tags="|discussion|code-golf|" AnswerCount="2" CommentCount="5" ClosedDate="2020-10-02T12:23:35.597" ContentLicense="CC BY-SA 3.0" />
  <row Id="12131" PostTypeId="1" AcceptedAnswerId="12145" CreationDate="2017-04-18T17:07:05.653" Score="8" ViewCount="304" Body="&lt;p&gt;It would be great to have an option in answers to add metadata. (This would be most useful for questions tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, but maybe also other tags?) You would be able to put in &lt;strong&gt;the language&lt;/strong&gt;, the &lt;strong&gt;golfed code&lt;/strong&gt;, current &lt;strong&gt;byte count&lt;/strong&gt;, and &lt;strong&gt;old byte counts&lt;/strong&gt;. Then the data could be used to &lt;strong&gt;sort answers by &quot;best score&quot;&lt;/strong&gt;, or even to &lt;strong&gt;make graphs of language usage and score&lt;/strong&gt;. Those graphs could tell us surprising things (and not-so-surprising things, like that Java would be in a certain corner and J in the other.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is some HTML for it (put this after the &lt;code&gt;&amp;lt;h2 class=&quot;space&quot;&amp;gt;Your Answer&amp;lt;/h2&amp;gt;&lt;/code&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;div id=&quot;metadata&quot;&amp;gt;&#xA;    &amp;lt;label&amp;gt;Language: &amp;lt;input id=&quot;metadata-byte-count&quot; list = &quot;langs&quot;&amp;gt;&amp;lt;/label&amp;gt;&#xA;&amp;lt;datalist id=&quot;langs&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;JavaScript&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;JavaScript (ES6)&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;Java&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;C&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;C++&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;C#&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;J&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;GolfScript&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;Japt&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;F# &quot;&amp;gt;&#xA;&amp;lt;option value=&quot;Batch&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;Python&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;05AB1E&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;Ruby&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;V&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;MATL&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;PHP&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;PowerShell&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;Swift&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;Convex&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;05AB1E&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;Mathematica&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;Excel&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;R&quot;&amp;gt;&#xA;&amp;lt;option value=&quot;Jelly&quot;&amp;gt;&#xA;&amp;lt;/datalist&amp;gt;&#xA;&amp;lt;label style=&quot;&#xA;    display: block;&#xA;&quot;&amp;gt;Golfed code: &#xA;  &amp;lt;textarea style=&quot;&#xA;    padding: 2px;&#xA;    display: block;&#xA;    width: 300px;&#xA;&quot;&amp;gt;&amp;lt;/textarea&amp;gt;&amp;lt;/label&amp;gt;&#xA;  &amp;lt;label&amp;gt;Current byte count: &amp;lt;input type=&quot;number&quot; id=&quot;metadata-byte-count&quot; style=&quot;&#xA;    font-size: 13px;&#xA;    padding: 2px;&#xA;&quot;&amp;gt;&#xA;bytes&amp;lt;/label&amp;gt;&#xA;&amp;lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10145/how-to-count-bytes-faq&quot; style=&quot;&#xA;    display: block;&#xA;&quot;&amp;gt;Need help counting bytes?&amp;lt;/a&amp;gt;&#xA;  &amp;lt;h3 style=&quot;&#xA;    font-size: larger;&#xA;    display: inline-block;&#xA;    padding-right: 20px;&#xA;&quot; class=&quot;space&quot;&amp;gt;Old byte counts&amp;lt;/h3&amp;gt;&#xA;  &amp;lt;input type=&quot;button&quot; id=&quot;metadata-add-old-byte-count&quot; value=&quot;Add old byte count&quot;&amp;gt;&#xA;  &amp;lt;div id=&quot;metadata-old-byte-counts&quot;&amp;gt;&#xA;  &amp;lt;label&amp;gt;&amp;lt;input value = &quot;x&quot; type = &quot;button&quot; style=&quot;&#xA;    padding: 0.14em 0.5em;&#xA;    font-size: smaller;&#xA;    margin-right: 2px;&#xA;&quot;&amp;gt;&amp;lt;input type=&quot;number&quot; class=&quot;old-byte-count&quot; style=&quot;&#xA;    padding: 0;&#xA;  &quot;&amp;gt; bytes&amp;lt;/label&amp;gt;&#xA;  &amp;lt;/div&amp;gt;&#xA;  &amp;lt;/div&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Wanna try it out?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-css lang-css prettyprint-override&quot;&gt;&lt;code&gt;body,html{/*Fix a SE style issue that causes lots of vertical scroll*/min-width: 100% !important;}h2{font-weight: 400; }&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;link href=https://cdn.sstatic.net/Sites/codegolf/all.css rel=stylesheet&amp;gt;&amp;lt;h2 class=space&amp;gt;Your answer here&amp;lt;/h2&amp;gt;&amp;lt;div id=&quot;metadata&quot;&amp;gt; &amp;lt;label&amp;gt;Language: &amp;lt;input id=&quot;metadata-byte-count&quot; list=&quot;langs&quot;&amp;gt;&amp;lt;/label&amp;gt; &amp;lt;datalist id=&quot;langs&quot;&amp;gt; &amp;lt;option value=&quot;JavaScript&quot;&amp;gt; &amp;lt;option value=&quot;JavaScript (ES6)&quot;&amp;gt; &amp;lt;option value=&quot;Java&quot;&amp;gt; &amp;lt;option value=&quot;C&quot;&amp;gt; &amp;lt;option value=&quot;C++&quot;&amp;gt; &amp;lt;option value=&quot;C#&quot;&amp;gt; &amp;lt;option value=&quot;J&quot;&amp;gt; &amp;lt;option value=&quot;GolfScript&quot;&amp;gt; &amp;lt;option value=&quot;Japt&quot;&amp;gt; &amp;lt;option value=&quot;F# &quot;&amp;gt; &amp;lt;option value=&quot;Batch&quot;&amp;gt; &amp;lt;option value=&quot;Python&quot;&amp;gt; &amp;lt;option value=&quot;05AB1E&quot;&amp;gt; &amp;lt;option value=&quot;JS &quot;&amp;gt; &amp;lt;option value=&quot;Ruby&quot;&amp;gt; &amp;lt;option value=&quot;V&quot;&amp;gt; &amp;lt;option value=&quot;MATL&quot;&amp;gt; &amp;lt;option value=&quot;PHP&quot;&amp;gt; &amp;lt;option value=&quot;PowerShell&quot;&amp;gt;  &amp;lt;option value=&quot;Swift&quot;&amp;gt; &amp;lt;option value=&quot;Convex&quot;&amp;gt; &amp;lt;option value=&quot;05AB1E&quot;&amp;gt; &amp;lt;option value=&quot;Mathematica&quot;&amp;gt; &amp;lt;option value=&quot;Excel&quot;&amp;gt; &amp;lt;option value=&quot;R&quot;&amp;gt; &amp;lt;option value=&quot;Jelly&quot;&amp;gt; &amp;lt;/datalist&amp;gt; &amp;lt;label style=&quot; display: block; &quot;&amp;gt;Golfed code: &amp;lt;textarea style=&quot; padding: 2px; display: block; width: 300px; &quot;&amp;gt;&amp;lt;/textarea&amp;gt;&amp;lt;/label&amp;gt; &amp;lt;label&amp;gt;Current byte count: &amp;lt;input type=&quot;number&quot; id=&quot;metadata-byte-count&quot; style=&quot; font-size: 13px; padding: 2px; &quot;&amp;gt; bytes&amp;lt;/label&amp;gt; &amp;lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10145/how-to-count-bytes-faq&quot; style=&quot; display: block; &quot;&amp;gt;Need help counting bytes?&amp;lt;/a&amp;gt; &amp;lt;h3 style=&quot; font-size: larger; display: inline-block; padding-right: 20px; &quot; class=&quot;space&quot;&amp;gt;Old byte counts&amp;lt;/h3&amp;gt; &amp;lt;input type=&quot;button&quot; id=&quot;metadata-add-old-byte-count&quot; value=&quot;Add old byte count&quot;&amp;gt; &amp;lt;div id=&quot;metadata-old-byte-counts&quot;&amp;gt; &amp;lt;label&amp;gt;&amp;lt;input value=&quot;x&quot; type=&quot;button&quot; style=&quot; padding: 0.14em 0.5em; font-size: smaller; margin-right: 2px; &quot;&amp;gt;&amp;lt;input type=&quot;number&quot; class=&quot;old-byte-count&quot; style=&quot; padding: 0; &quot;&amp;gt; bytes&amp;lt;/label&amp;gt; &amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, this data would be available via the API and maybe even under &lt;a href=&quot;http://codegolf.stackexchange.com/tools&quot;&gt;/tools&lt;/a&gt; (&gt;=2k rep only). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Maybe a UTF-8 byte counter embedded in? Or better yet, a byte counter that recognizes the language specified and picks it from there?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that this contains a dropdown / input that prevents us from getting 'dirty' language data (eg. &quot;JS&quot;, &quot;Javascript&quot;, &quot;Java Script&quot;, &quot;JavaScript&quot;, etc.) but still allow for obscure languages.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Any questions, ideas, comments, or waffles? Comment or answer below!&lt;/h1&gt;&#xA;" OwnerDisplayName="user58826" LastEditorUserId="68942" LastEditDate="2021-06-09T05:29:13.400" LastActivityDate="2021-06-09T05:29:13.400" Title="Metadata for answers?" Tags="|discussion|feature-request|status-declined|code-golf|answers|" AnswerCount="4" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12133" PostTypeId="2" ParentId="12131" CreationDate="2017-04-18T19:35:31.700" Score="7" Body="&lt;h2&gt;Interesting idea, but not worth inclusion&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For starters, as-is, this would be adding something like 2KiB of stuff to each answer. Not only does that cause less room for the meat of the answer (which is already limited to 30,000 characters), it also causes additional download for users on mobile or other data-limited plans.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Second, and more important, answering a challenge here is &lt;em&gt;already&lt;/em&gt; hard enough for new users to get right. This is something that has been complained about time and time again (Martin has a good summary of links at the top of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10127/42963&quot;&gt;this post&lt;/a&gt; specifically regarding golfing languages, in addition to the literally dozens of other Meta posts by new users). Adding an additional hurdle beyond all the already-existing FAQs, header styling, byte counting, etc., is just going to lead to additional frustration for new users, the exact opposite of what we want.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;(NB - If this is something that could be implemented at the &lt;em&gt;site level&lt;/em&gt; automatically, sure, it could be an interesting addition. However, given our beta-not-a-beta graduated-but-not-quite-fully status, and that the parent site is kind as to allow us to exist even though we don't really fit their model for the rest of their sites, I don't see SE developer resources being allocated to this.)&lt;/p&gt;&#xA;" OwnerUserId="42963" LastActivityDate="2017-04-18T19:35:31.700" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12134" PostTypeId="2" ParentId="12131" CreationDate="2017-04-18T20:57:04.683" Score="2" Body="&lt;p&gt;I may be missing something, but it seems to me that the snippet adds a little form to the answer but doesn't store the data anywhere. Does it really add metadata to the answer?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A better way of adding language metadata would be to use the prettify tags &lt;code&gt;&amp;lt;!-- language: lang-java --&amp;gt;&lt;/code&gt; etc. The problem there is that support is lacking for most languages used on this site. But trying to add support for those languages might be the most practical way of pushing this issue forward, if you feel strongly enough about it to invest the considerable amounts of time that would be required.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-04-18T20:57:04.683" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12138" PostTypeId="1" CreationDate="2017-04-19T11:37:43.417" Score="1" ViewCount="54" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/116888/56090&quot;&gt;My answer (2k+ only)&lt;/a&gt; to a code golf was rightfully deleted by a moderator because it turned out to be wrong and unfixable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This morning, I planned to delete it myself, but all direct links to my answer or its question from my profile/notification list were removed too. I had to search the question from what I recalled of it to find it and read the last comments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why is there no notification for a post deleted by a moderator? It seems to me to be an important event.&lt;/p&gt;&#xA;" OwnerUserId="56090" LastEditorUserId="31716" LastEditDate="2017-04-19T18:31:26.393" LastActivityDate="2017-04-19T18:31:26.393" Title="No notification upon post deletion by moderator?" Tags="|support|deleted-answers|notifications|" AnswerCount="0" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12141" PostTypeId="2" ParentId="12128" CreationDate="2017-04-19T12:42:47.177" Score="0" Body="&lt;h1&gt;Personally, I think that this should be allowed&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In my opinion, using math tricks like this doesn't trivialize the challenge as much as using comments or no-ops to get rid of parts of the code in either language, which from my observation is what nearly every answer uses. Feel free to downvote and comment on this answer if you disagree with me, but if you agree, please leave an upvote so I can get a general consensus.&lt;/p&gt;&#xA;" OwnerDisplayName="user42649" LastEditorUserId="56656" LastEditDate="2017-04-19T13:47:02.470" LastActivityDate="2017-04-19T13:47:02.470" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12142" PostTypeId="1" CreationDate="2017-04-19T14:08:28.007" Score="-3" ViewCount="78" Body="&lt;p&gt;I have an idea for a question and am wondering if it would be classed as off-topic here. It is a programming puzzle/challenge but doesn't require anyone to submit a program and it's not the program that wins the competition. Is this off-topic? I have written out my question below as if I had actually asked it.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Your task is to figure out my password for my PPCG account. I have created a new &quot;sock puppet&quot; account for this challenge that will be deleted as soon as someone finishes the challnge. You must &lt;strong&gt;code&lt;/strong&gt; a program that will hack into my account and will give you the password.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You shouldn't take input and your output should be the account's password.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In order to win, you must answer this question with the account. It should have a spoiler&lt;/p&gt;&#xA;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;  &lt;p&gt; containing the password&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;like for &lt;a href=&quot;https://puzzling.stackexchange.com/&quot;&gt;Puzzling&lt;/a&gt; questions and can optionally have your code&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import hacker&#xA;hacker.hack_account('sock puppet')&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The first person to answer the question with the correct password will be declared the winner!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is the question and I'm worried that either it could be off-topic or be closed as it gives users a way to hack into PPCG accounts (obviously bad). I know about the Sandbox but wanted to post  this as a separate question as it is a little unusual.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorDisplayName="user62131" LastEditDate="2017-04-25T00:03:22.493" LastActivityDate="2017-04-25T00:03:22.493" Title="Is this question off-topic?" Tags="|discussion|scope|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12143" PostTypeId="2" ParentId="202" CreationDate="2017-04-19T14:47:21.750" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;http://beta-decay.github.io/editor&quot; rel=&quot;nofollow noreferrer&quot;&gt;Fourier&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Whilst also available on &lt;a href=&quot;http://tryitonline.net&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://tryitonline.net&lt;/a&gt;, the full version of Fourier (with delays and screen clearing) can be found permanantly on &lt;a href=&quot;http://beta-decay.github.io/editor&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://beta-decay.github.io/editor&lt;/a&gt;. &lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2017-04-19T14:47:21.750" CommentCount="0" CommunityOwnedDate="2017-04-19T14:47:21.750" ContentLicense="CC BY-SA 3.0" />
  <row Id="12145" PostTypeId="2" ParentId="12131" CreationDate="2017-04-19T17:26:02.820" Score="0" Body="&lt;h1&gt;Might make things &lt;em&gt;easier&lt;/em&gt; for us, not harder.&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Problems (current and future):&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Hard for new users to understand formatting&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Instead of having special code formatting, the &lt;code&gt;# Language, bytes &amp;lt;s&amp;gt;old bytes&amp;lt;/s&amp;gt;&lt;/code&gt; header, etc. this could be an opportunity to &lt;em&gt;make things easier&lt;/em&gt; for new users. Basically, you enter code in the code box, your language in the language box, and the explanation where they currently put the whole post.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Results in answers that take up more storage space&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;To the argument of this taking up more storage space, it could be encoded like this:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;{&#xA;  &quot;lang&quot;: &quot;yourlanguage&quot;,&#xA;  &quot;bytes&quot;: 4,&#xA;  &quot;oldbytes&quot;: [444, 44],&#xA;  &quot;postBody&quot;: &quot;Blah blah explination&quot;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;sub&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/82343/41723&quot;&gt;Crossed out 44 is still 44&lt;/a&gt;&lt;/sub&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Minifyed and using small property keys:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;{&quot;l&quot;:&quot;yourlanguage&quot;,&quot;b&quot;:4,&quot;o&quot;:[44,444],&quot;p&quot;:&quot;Blah blah explanation&quot;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Compared to a standard answer:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# yourlanguage, 4 &amp;lt;s&amp;gt;44&amp;lt;/s&amp;gt; &amp;lt;s&amp;gt;444&amp;lt;/s&amp;gt; bytes&#xA;Blah blah explanation&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Byte count: &lt;code&gt;66&lt;/code&gt; to &lt;code&gt;67&lt;/code&gt;. We could use a terser data format than JSON and come out ahead. I think 7 bytes longer answers shouldn't impact our answer limit too much.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Hard for new users to understand golfing&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;When the code box gets full or has a lot of whitespace, we could show a message telling the user to remove whitespace and otherwise lower their byte count (with lots of links to meta posts.) The current explanation is confusing; &lt;a href=&quot;https://codegolf.stackexchange.com/a/5712/58826&quot;&gt;at least one user thought they were supposed to optimize their code to make it run faster&lt;/a&gt;. When the code entered in the box matches the regex &lt;code&gt;[\s\S]{300,}|([^\t]+\t){5,}|([^ ]+ ){10,}&lt;/code&gt;, we can show them a warning:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/0WV0r.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/0WV0r.png&quot; alt=&quot;Can you try to reduce the byte count of your submission? You might be interested in some tips.&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that the tips link goes to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The code box could show a (UTF-8) byte counter for a set of languages known to use UTF-8, like JS, Java, C/++/#, Python, and not show it for others.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;We don't get the current formatting / this will break the leaderboard snippet!&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The generated Markdown from the metadata and the explanation would be what is &lt;em&gt;currently suggested for answers.&lt;/em&gt; It might look like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# yourlanguage, 4 &amp;lt;s&amp;gt;44&amp;lt;/s&amp;gt; &amp;lt;s&amp;gt;444&amp;lt;/s&amp;gt; bytes&#xA;&#xA;    Your code here&#xA;&#xA;Blah blah explanation&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Same thing. Just with a better user experience, and metadata on the backend that we could use to get cool graphs of how bad Java does, popular language submissions, average scores per tag, average scores per user, and how often people outgolf Dennis.&lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastEditorDisplayName="user58826" LastEditDate="2017-04-20T16:49:00.923" LastActivityDate="2017-04-20T16:49:00.923" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12148" PostTypeId="2" ParentId="12128" CreationDate="2017-04-20T01:16:12.657" Score="10" Body="&lt;p&gt;If the program is meant to do the same thing in two languages, this should probably be disallowed, for obvious reasons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the program is meant to do different things in the two languages, allowing this is more interesting, as the programs will have to be split away from each other somehow. Using a version check for this (or equivalent) is really boring, but has the issue that it's hard to ban in an objective way (it &lt;em&gt;can&lt;/em&gt; sometimes be banned indirectly, via downvoting and/or pressuring the author into self-deleting the post). Solutions which rely on differences between the languages (especially if most people believe the language to be backwards-compatible), on the other hand, are often more interesting than solutions between two unrelated languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note also that, in general, it's hard to define objectively if two languages are different versions of the same language. For example, is &lt;a href=&quot;https://esolangs.org/wiki/A_Pear_Tree&quot; rel=&quot;nofollow noreferrer&quot;&gt;A Pear Tree&lt;/a&gt; a &quot;version&quot; of Perl, or &lt;a href=&quot;https://esolangs.org/wiki/V_(DJMcMayhem)&quot; rel=&quot;nofollow noreferrer&quot;&gt;V&lt;/a&gt; a &quot;version&quot; of Vim, or &lt;a href=&quot;https://esolangs.org/wiki/Vigil&quot; rel=&quot;nofollow noreferrer&quot;&gt;Vigil&lt;/a&gt; a &quot;version&quot; of Python? I don't think there's any way to create a rule here that's both loophole-free and objective, unless we move to an approach in which validity of a language depends on factors other than the definition of the language itself.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-04-20T01:16:12.657" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12153" PostTypeId="1" AcceptedAnswerId="12154" CreationDate="2017-04-20T17:55:15.187" Score="2" ViewCount="86" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/114657/41024&quot;&gt;This&lt;/a&gt; answer is clearly invalid, given that you read the language's documentation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I used a custom mod flag to flag it as invalid, since it prints a Unicode &lt;code&gt;☆&lt;/code&gt; instead of outputting an image with a 5-pointed star (like &lt;a href=&quot;https://i.stack.imgur.com/tdhM9.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; one). My flag got declined, since there was apparently no evidence to support it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The user didn't get warned, but I'm not sure if my flag was wrong, that's why I've asked here. The other reason might have been since the question was closed as unclear (which should have been closed as too broad instead IMO).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note: actual flag text is hidden.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2017-04-20T18:21:37.820" Title="Why was my flag declined?" Tags="|discussion|flags|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12154" PostTypeId="2" ParentId="12153" CreationDate="2017-04-20T18:21:37.820" Score="2" Body="&lt;p&gt;I declined your flag, as well as a number of flags on &lt;a href=&quot;https://codegolf.stackexchange.com/a/15582/12012&quot;&gt;the PHP answer that inspired it&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A character glyph &lt;em&gt;is&lt;/em&gt; an image; U+2606 happens to be an image of a 5-pointed star. Since the task is to print a 5-pointed star and the answer prints a 5-pointed char, it is valid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it cheaty? Probably. Is it in spirit of the challenge? Probably not. Does it solve the task at hand in the most boring way possible? Yes. Do we need answers in all programming languages that simply print this Unicode character or its filled counterpart U+2605? No.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You're free to dislike the answer, and there's more than enough reason to dowvote it. You can even downvote the challenge because it allows this answer as written. What you cannot do is call the answer invalid, because it isn't.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-04-20T18:21:37.820" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="12155" PostTypeId="2" ParentId="1061" CreationDate="2017-04-20T18:36:00.973" Score="21" Body="&lt;h2&gt;Outputting Unicode characters in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; challenges&lt;/h2&gt;&#xA;&lt;p&gt;If a challenge requires an image to be output, outputting a Unicode character instead is not acceptable. In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; challenges, the output should always be an image.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-20T18:36:00.973" CommentCount="12" CommunityOwnedDate="2017-04-20T18:36:00.973" ContentLicense="CC BY-SA 3.0" />
  <row Id="12156" PostTypeId="1" AcceptedAnswerId="12157" CreationDate="2017-04-20T18:53:26.483" Score="6" ViewCount="313" Body="&lt;p&gt;I recently &quot;finished&quot; my own BrainFuck variant (&lt;a href=&quot;https://github.com/carcigenicate/ezfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;ezfuck&lt;/a&gt;), and wanted to try using it for golfing. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Assuming the version of the language I'm using predates the challenge, are there any other restrictions? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the Github page, I supplied a .jar that starts a REPL capable of running code. A jar could be created manually as well since all the source code is available, and it can be run directly, from say, a REPL in an IDE.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this enough? I'm assuming I have to supply a way for people to test the code, but what exactly is required for that? Obviously it would be nice if I had a site containing an interpreter, but I'm not at that point yet. &lt;/p&gt;&#xA;" OwnerUserId="31224" LastEditorUserId="31224" LastEditDate="2017-04-21T00:43:52.453" LastActivityDate="2017-04-21T00:43:52.453" Title="What's required for me to use my own language?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12157" PostTypeId="2" ParentId="12156" CreationDate="2017-04-20T19:18:04.803" Score="12" Body="&lt;p&gt;If you have the language published somewhere (GitHub is fine), then you're good to go! Right now, you already have the crucial pieces, and those are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The code is freely viewable,&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There is a real implementation,&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;And there is an interpreter that could be downloaded and ran by anyone who wants to test and verify that your solution is real. (Binary or source code are both acceptable)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;These three things are plenty. For what it's worth, I submitted answers in two of my own languages before hosting their interpreters online. (V, and Brain-flak).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you would like to make it more &lt;em&gt;&quot;official&quot;&lt;/em&gt;, you could always add it to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/6918/31716&quot;&gt;What programming languages have been created by PPCG users?&lt;/a&gt;, but this is by no means a requirement. Just a fun step and a nice way to show off what your language does.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At some point, it would be nice to have it easily testable online, but this is absolutely not a requirement. If you would like, one nice resource is &lt;a href=&quot;https://tryitonline.net&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online&lt;/a&gt;, which hosts &lt;em&gt;many&lt;/em&gt; PPCG-made languages. So far, I have added two of my own languages to the site, and each time it is a surprisingly quick and easy process. If you would like to add it, you should ping @Dennis in &lt;a href=&quot;http://chat.stackexchange.com/rooms/44255/talk-tryitonline-net&quot;&gt;the Try It Online chatroom&lt;/a&gt; to ask for more details.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2017-04-20T19:18:04.803" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12158" PostTypeId="2" ParentId="6918" CreationDate="2017-04-20T20:32:04.973" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/carcigenicate/ezfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;ezfuck&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I just finished ezfuck yesterday after 3 days of work. It works very similar to BrainFuck (in fact, all BrainFuck is valid ezfuck), but adds a few new commands and features:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Adds the &lt;code&gt;*&lt;/code&gt; and &lt;code&gt;\&lt;/code&gt; operators&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Adds in numberic literals, and allows most commands to take them as an argument&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;+++[&amp;gt;++++&amp;lt;-]&lt;/code&gt; == &lt;code&gt;+3[&amp;gt;+4&amp;lt;-]&lt;/code&gt; ~= &lt;code&gt;+3*4&lt;/code&gt; (the last doesn't require a second cell)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;gt;13&lt;/code&gt; == &lt;code&gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;,-48&lt;/code&gt; sets the current cell to the number entered (its char code - 48)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;{&lt;/code&gt; and &lt;code&gt;}&lt;/code&gt; allow direct control over the instruction pointer. As with &lt;code&gt;]&lt;/code&gt;, the jump will only happen if the current cell value is 0.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;{n&lt;/code&gt; will move the instruction pointer &lt;code&gt;n&lt;/code&gt; commands to the left, while &lt;code&gt;}n&lt;/code&gt; will move it &lt;code&gt;n&lt;/code&gt; commands to the right. If &lt;code&gt;n&lt;/code&gt; isn't supplied, it defaults to &lt;code&gt;1&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;+{&lt;/code&gt; == &lt;code&gt;+[]&lt;/code&gt; &lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;^&lt;/code&gt; allows directly setting the value of the current cell.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;^6*2&lt;/code&gt; sets the current cell to &lt;code&gt;6&lt;/code&gt;, then multiplies it by &lt;code&gt;2&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;V&lt;/code&gt; allows getting the current cell value to be used as an argument for a command.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;^6&amp;gt;V&lt;/code&gt; sets the current cell to 6, then takes the value, and gives it to &lt;code&gt;&amp;gt;&lt;/code&gt;. Of course, you could just write &lt;code&gt;&amp;gt;6&lt;/code&gt;, but I figured this may have some use with some creativity.&lt;/li&gt;&#xA;&lt;li&gt;Allow the user to directly control the instruction/cell pointers: &lt;code&gt;,^}V&lt;/code&gt;, &lt;code&gt;,^&amp;gt;V&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;^V&lt;/code&gt; is a no-op.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;An uncreative &quot;hello world&quot;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;^72. ^101. ^108.. ^111. ^32. ^87. ^111. ^114. ^108. ^100. ^33. ^10.&#xA;   H     e     ll     o         W     o     r     l     d    !    \n&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="31224" LastEditorUserId="31224" LastEditDate="2017-09-06T22:45:31.547" LastActivityDate="2017-09-06T22:45:31.547" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12159" PostTypeId="1" AcceptedAnswerId="12161" CreationDate="2017-04-20T21:20:12.033" Score="7" ViewCount="297" Body="&lt;p&gt;A while ago I offered reputation to the first person that could come up with a solution to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/97472/trick-or-treat-polyglot&quot;&gt;this problem&lt;/a&gt; using Brain-Flak/Brain-Flueue.  A user was successful and I created a bounty on the question to award &lt;a href=&quot;https://codegolf.stackexchange.com/a/116866/56656&quot;&gt;their answer&lt;/a&gt; (not visible to lower rep users).  The answer has since been deleted because it was not &quot;&lt;em&gt;a serious contender for the winning criteria in use&lt;/em&gt;&quot;.  I don't disagree with the posts deletion, it was not well golfed at all and those are the rules, but now I have a +150 rep bounty sitting on a question to award an answer that no longer exists.  At the end of the week the 150 rep will have to go to one of the answers on the challenge.  It seems dishonest to award the answer to another answer after stating it was for a specific answer, but I'd rather not let it be awarded to a random answer on the question.  What should I do?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-04-22T18:13:51.510" Title="I created a bounty to award an answer that was deleted; what now?" Tags="|discussion|bounty|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="12161" PostTypeId="2" ParentId="12159" CreationDate="2017-04-20T22:30:00.903" Score="13" Body="&lt;p&gt;I can see three options here.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Wait and hope @DestructibleLemon fixes their answer. They still have 5 days to do so.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Award the bounty to another answer that fulfills the criteria. @Riley's seems to be the fastest &lt;em&gt;valid&lt;/em&gt; answer, and that an answer has to be valid to be posted on PPCG, bounty or not, is always implied.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Ask a moderator to refund the bounty, either publicly or via a flag. We would do so for a bounty on a question that should be closed; this situation isn't that different.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;What option you choose is up to you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, I'd like to add that &quot;Fastest Gun In The West&quot; bounties, at least ones without any quality thresholds, seem to be a bad idea. They encourage subpar answer for the sake of collecting the bounty, which isn't doing anybody any favors and leads to problems like the one at hand.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="15599" LastEditDate="2017-04-22T18:13:51.510" LastActivityDate="2017-04-22T18:13:51.510" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12162" PostTypeId="1" CreationDate="2017-04-21T01:37:35.943" Score="0" ViewCount="66" Body="&lt;p&gt;I have read on here that many several times it has be suggested that challenge upvotes count for more rep. Is that happening?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7683/increase-reputation-awarded-for-questions&quot;&gt;Increase reputation awarded for questions&lt;/a&gt; Is one place it was mentioned but I have yet to see anything else&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="68942" LastEditDate="2021-06-04T01:06:41.760" LastActivityDate="2021-06-04T01:06:41.760" Title="Is the increased rep for challenge upvotes going to happen?" Tags="|feature-request|status-completed|challenges|reputation|" AnswerCount="0" CommentCount="0" ClosedDate="2017-04-21T02:38:34.033" ContentLicense="CC BY-SA 3.0" />
  <row Id="12163" PostTypeId="1" AcceptedAnswerId="12166" CreationDate="2017-04-21T01:42:59.613" Score="3" ViewCount="104" Body="&lt;p&gt;I think on PPCG you should be allowed to close your own challenges single handedly. It would allow people like me who realize too late that I have posted a bad challenge and want to close it fast. But you end up with an answer so removing is not a option. Would this work?&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="68942" LastEditorDisplayName="user42649" LastEditDate="2021-06-09T05:40:50.307" LastActivityDate="2021-06-09T05:40:50.307" Title="Should we be allowed to close our own questions with one vote (close hammer)?" Tags="|feature-request|status-declined|flags|vote-to-close|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12164" PostTypeId="1" CreationDate="2017-04-21T05:51:03.650" Score="2" ViewCount="113" Body="&lt;p&gt;I have just recently posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/117132/count-occurences-of-a-set-in-a-list&quot;&gt;my first challenge&lt;/a&gt; and because I wanted to give all languages equal chances, I stated that the input variables are defined in the current scope already, so people wouldn't need to grab user input or write functions with params. However, people do exactly that! Is this a rule I don't know about yet? Something like &quot;Return an anonymous function that solves the problem&quot; instead of &quot;Solve the problem&quot;? The problem becomes even harder considering many languages have interactive interpreters that don't require you to write &quot;print&quot;, &quot;echo&quot; or the like (think of Python, JavaScript).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should I comment on the answers so people change their lambdas to prints?&lt;/p&gt;&#xA;" OwnerUserId="56584" LastEditorUserId="56584" LastEditDate="2017-04-21T06:28:18.413" LastActivityDate="2017-04-22T03:49:33.333" Title="How to handle input/output" Tags="|discussion|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12166" PostTypeId="2" ParentId="12163" CreationDate="2017-04-21T11:54:38.177" Score="3" Body="&lt;p&gt;This already somewhat exists in the form of duplicate votes. If you vote to close your own question as a duplicate, the Community user will hammer it closed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for other close reasons, it's best to edit the challenge if it can be salvaged, or just let others close it otherwise.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-04-21T11:54:38.177" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12167" PostTypeId="2" ParentId="2140" CreationDate="2017-04-21T14:33:31.440" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/117440/get-the-decimal&quot;&gt;Get the Decimal! (Posted)&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="56433" LastEditDate="2017-04-27T17:12:30.533" LastActivityDate="2017-04-27T17:12:30.533" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12169" PostTypeId="2" ParentId="2140" CreationDate="2017-04-21T14:56:21.820" Score="0" Body="&lt;h1&gt;Generate a Voronoi Diagram&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a list of coordinates and colours of points, output a 300px by 300px Voronoi Diagram.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winning&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Shortest code in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;To be expanded&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2017-04-21T14:56:21.820" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12173" PostTypeId="2" ParentId="12164" CreationDate="2017-04-22T03:49:33.333" Score="2" Body="&lt;p&gt;The concept of &quot;input variables&quot; is actually less of an equalizer than you think. What about languages with no concept of variables, like brainfuck, or a Turing machine? There is a reason we use the standard I/O methods we do. Use of STDIN and STDOUT is practically universal, and using functions is a nice method for languages that have them. Both of these I/O methods are used in official programming contests around the world and across many sites. Variables, on the other hand, are scope-dependent. It's just not as great a method of handling &quot;input&quot; for solving a problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, about your specific challenge. Your specifications state:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Default input/output rules apply.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;and you linked to the rules defined by consensus. One of these I/O methods (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8731/34718&quot;&gt;this one&lt;/a&gt;) with negative consensus (making it &lt;em&gt;forbidden by default&lt;/em&gt;) is&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Programs may take input by assuming it is stored in predefined variables.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;meaning that your challenge specifications conflict themselves when you say not to define a function and to use variables instead.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;In summary&lt;/strong&gt;, there's a reason we use these defaults. You have the right to override them, but please be clear about doing so in your challenge description.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastActivityDate="2017-04-22T03:49:33.333" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12174" PostTypeId="2" ParentId="2140" CreationDate="2017-04-22T08:12:33.997" Score="1" Body="&lt;h1&gt;shortest angular path&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Let's say you have a robot and you measure the orientation of a wheel (e.g. for tracking the exact distance), but the sensor just returns an angle between -180° and 180°. Then you have the problem that even if the wheel just moved three degrees from 179° to 182° the sensor will tell you that the wheel made a jump from 179° to -178°. This makes analyzing and interpreting the data a little bit cumbersome.&#xA;Given a list of subsequent measurements your goal is now &amp;quot;smoothing&amp;quot; them out, such that from each entry &lt;code&gt;A&lt;/code&gt; to the next &lt;code&gt;B&lt;/code&gt;, in the list (&lt;code&gt;[...,A,B,...]&lt;/code&gt;) there is at &lt;em&gt;most&lt;/em&gt; a 180° jump.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can also assume other (single number) representations of angles, e.g. radians (&lt;code&gt;0&lt;/code&gt; to &lt;code&gt;2*pi&lt;/code&gt;) or gradian (&lt;code&gt;0&lt;/code&gt; to &lt;code&gt;400&lt;/code&gt;) or number of turns (&lt;code&gt;0&lt;/code&gt; to &lt;code&gt;1&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;If it is more convenient, you can assume that the sensor will return data in &lt;code&gt;[0°,360°]&lt;/code&gt; instead of &lt;code&gt;[-180°,180°]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Which way you go if the jump is exactly &lt;code&gt;180°&lt;/code&gt; (or &lt;code&gt;-180°&lt;/code&gt; or &lt;code&gt;540°&lt;/code&gt; etc.) is up to you.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;[0 10 90 80 180 -130 -90 -120 -143 170 0] (Input)&#xA;[0 10 90 80 180 230 270 240 217 170 0]    (Output)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-22T08:17:48.913" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12175" PostTypeId="1" AcceptedAnswerId="12177" CreationDate="2017-04-22T12:06:55.973" Score="3" ViewCount="130" Body="&lt;p&gt;If someone posts a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; challenge and the cops' thread is closed / put on hold, for any reason (e.g: &lt;em&gt;unclear what you're asking&lt;/em&gt;), what should happen to the robbers' thread? Should it be closed as well or should we just leave it open? If it should be closed, what close-reason should be chosen, the same as the other thread?&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="59487" LastEditDate="2017-04-22T12:14:55.133" LastActivityDate="2017-04-22T13:32:19.263" Title="For cops and robbers, what if the cops' thread is closed / put on hold?" Tags="|discussion|close-reasons|cops-and-robbers|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12176" PostTypeId="2" ParentId="2140" CreationDate="2017-04-22T13:21:22.323" Score="-3" Body="&lt;h1&gt;Find the min swaps for order one powerset for a List&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The question it is write one powerset function and one sort function&#xA;tha minimize the swaps for doing one order with this compare function&#xA;on powerset of the List A&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;cmp(a,b) -- a and b are subset of the list A&#xA;    if sizeof a &amp;gt; sizeof b then (swap a and b; return)&#xA;    if sizeof a &amp;lt; sizeof b than return&#xA;    for i in 1..(sizeof a) repeat&#xA;         for j in 1..(sizeof A) repeat&#xA;               if a[i]==A[j] then return&#xA;               if b[i]==A[j] then (swap a and b; return)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;the result of this compare function on the sets wuold be the follow:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(15) -&amp;gt; powSet([1,2,3])&#xA;   (15)  [[],[1],[2],[3],[1,2],[1,3],[2,3],[1,2,3]]&#xA;                                                      Type: List List Any&#xA;(16) -&amp;gt; powSet([3,2,1])&#xA;   (16)  [[],[3],[2],[1],[3,2],[3,1],[2,1],[3,2,1]]&#xA;                                                      Type: List List Any&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;note that order depend not from the number element, &#xA;but on the position on the start List A=[1,2,3]&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(17) -&amp;gt; powSet([1,2,3,4,5,6])&#xA;   (17)&#xA;   [[], [1], [2], [3], [4], [5], [6], [1,2], [1,3], [1,4], [1,5], [1,6], [2,3],&#xA;    [2,4], [2,5], [2,6], [3,4], [3,5], [3,6], [4,5], [4,6], [5,6], [1,2,3],&#xA;    [1,2,4], [1,2,5], [1,2,6], [1,3,4], [1,3,5], [1,3,6], [1,4,5], [1,4,6],&#xA;    [1,5,6], [2,3,4], [2,3,5], [2,3,6], [2,4,5], [2,4,6], [2,5,6], [3,4,5],&#xA;    [3,4,6], [3,5,6], [4,5,6], [1,2,3,4], [1,2,3,5], [1,2,3,6], [1,2,4,5],&#xA;    [1,2,4,6], [1,2,5,6], [1,3,4,5], [1,3,4,6], [1,3,5,6], [1,4,5,6],&#xA;    [2,3,4,5], [2,3,4,6], [2,3,5,6], [2,4,5,6], [3,4,5,6], [1,2,3,4,5],&#xA;    [1,2,3,4,6], [1,2,3,5,6], [1,2,4,5,6], [1,3,4,5,6], [2,3,4,5,6],&#xA;    [1,2,3,4,5,6]]&#xA;                                                      Type: List List Any&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Win the one that minimize the swaps for order the powerset of the follow list&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1],[1,2],[1,2,3],[1,2,3,4],[1,2,3,4,5],[1,2,3,4,5,6]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Patterns match for composed expression&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If we have one math expression B(x) &#xA;[that mean in B appear x]&#xA;[math expression is one expression where appear only symbols for function and operator of mathematics that are ok for type and compose ]&#xA;Find the max lengt subexpression g(x)&#xA;of B contain x such that&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;B(x)=f(g(x))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And f(y) and g(x) are both math expression.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Find Max for a function in one interval&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;R is the set of real numbers.&#xA;Is given a function f:A-&gt;R from set A (⊆ R) to the R, continue and derivable in one close interval&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; [a, b]⊆A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Write the shortest program for find&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; max{f(x): x in [a,b]}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;knowing the function f(x) derivable in the interval [a,b]. The solution has to be correct at last until the V digit after the float point, and for all functions f that has 10 value max in which f'(x)= 0 in [a, b]. codegolf tag&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;On Riemann Zeta function domain&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If &lt;code&gt;Zeta:C-&amp;gt;C&lt;/code&gt; is the Riemann Zeta function, we give the set:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; W={b: 0&amp;lt;b&amp;lt;100 and Re(Zeta(0.5+i*b))=-Im(Zeta(0.5+i*b))}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;Re()&lt;/code&gt; return the real part of its argument, and &lt;code&gt;Im()&lt;/code&gt; return the imaginary part of its argument.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;It is requested&lt;/strong&gt; to calculate one approximation of each element of &lt;code&gt;W&lt;/code&gt;; this means here all b in float numbers with b in &lt;code&gt;0..100&lt;/code&gt; such way &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  abs(Re(Zeta(0.5+i*b))+Im(Zeta(0.5+i*b)))&amp;lt;0.0001 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;at last, to put all together in a array or list or set of float.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One can note that the below set of zeros for the Riemann function is a subset of above &lt;code&gt;W&lt;/code&gt; set.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; {b: 0&amp;lt;b&amp;lt;100 and Zeta(0.5+i*b)=0}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Some test&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some numbers b approssimation to solution of equation &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Re(Zeta(0.5+i*x))+Im(Zeta(0.5+i*x))=0 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;the ones that are approssimation to solution of equation &lt;code&gt;Zeta(0.5+i*x)=0&lt;/code&gt; too&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[14.134725, 21.022039, 30.424876, 32.935061, 37.58617815, 40.918719, 43.327073, 48.00515, 49.773832]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;the ones not approssimation to solution of equation &lt;code&gt;Zeta(0.5+i*x)=0&lt;/code&gt; too&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[12.458493623791109003, 24.351346882420215577, 28.716611773969890307]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The code more short in bytes that find all these approssimations of element of the set &lt;code&gt;W&lt;/code&gt; wins...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code golf tag&lt;/p&gt;&#xA;" OwnerDisplayName="user58988" LastEditorDisplayName="user58988" LastEditDate="2017-11-16T09:41:19.663" LastActivityDate="2017-11-16T09:41:19.663" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="12177" PostTypeId="2" ParentId="12175" CreationDate="2017-04-22T13:32:19.263" Score="10" Body="&lt;h1&gt;Close the robbers thread.&lt;/h1&gt;&#xA;&lt;p&gt;If a challenge is closed, then no answers can be posted. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; challenges are made of two separate questions. Since we are closing challenges and not questions per se, we should close both threads, since otherwise robbing can continue even though the challenge is closed.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-22T13:32:19.263" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12183" PostTypeId="2" ParentId="2140" CreationDate="2017-04-23T11:32:17.010" Score="0" Body="&lt;h2&gt;Calculate Call-Changes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Before learning to ring methods, novice bell-ringers usually first learn something called call-changes. This is basically a sequence of permutations (the changes), each one obtained from the previous by exchanging a pair of adjacent bells (the call).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The bells always begin in ascending pitch number order (which is actually descending pitch order). Each exchange (call) can be expressed in one of two different ways, depending on the whim of the conductor. Exchanges always use the bell's pitch number, regardless of the bell's current position.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The exchange can be expressed as a pair of adjacent bell numbers in sequence. The first of the pair is always immediately before the second of the pair. The two bells simply exchange places, so the first of the pair ends up immediately after the second of the pair.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;ul&gt;&#xA;&lt;li&gt;The exchange can be expressed as a bell number plus a second bell number which is two places before the first bell. The (unnamed) intervening bell and the first bell exchange places. This also results in the first input bell ending up immediately after the second input bell.&lt;/li&gt;&#xA;&lt;li&gt;The above expression cannot be used to move a bell into first (lead) place, because there is no bell for it to end up after. You therefore need to accept an alternate way of expressing that the first two bells change places. Note that this must still refer to the pitch number of the bell in second place, but this might be achieved e.g. by having a sentinel value for the second bell, or by omitting it completely. (In real call-changes the call is &quot;[number] lead!&quot; rather than &quot;[number] to [number]!&quot;.)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Your other input will be the number (not list) of bells in the sequence. You can assume that this will not be more than 9 (but supporting larger numbers may get you more upvotes). Here is a worked example showing the list of calls in both of the above formats and the desired output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Call 1  Call 2  Output&#xA;(5 bells input  12345)&#xA;12      20*     21345&#xA;34      41      21435&#xA;14      42      24135&#xA;24      40*     42135&#xA;21      14      41235&#xA;41      10*     14235&#xA;42      21      12435&#xA;43      32      12345&#xA;&#xA;*example representation.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your program or function should output the result after each change. (Showing the initial permutation is permitted but not necessary.) Input and output can be any reasonable method, e.g. nested array of numbers or list of strings (note that if you use strings and want to support more than 9 bells then the next three bells are traditionally numbered &lt;code&gt;0&lt;/code&gt;, &lt;code&gt;E&lt;/code&gt; and &lt;code&gt;T&lt;/code&gt;). You can assume that all inputs follow the above pattern (or your custom representation for calling the seconds place bell into first place).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2017-04-26T09:35:34.533" LastActivityDate="2017-04-26T09:35:34.533" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12185" PostTypeId="1" AcceptedAnswerId="12186" CreationDate="2017-04-23T13:50:42.190" Score="1" ViewCount="159" Body="&lt;p&gt;So I had an idea to make a challenge where users have to make a regex expression, based on what I give them. Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;test2 FIND&#xA;test3 FIND&#xA;test SKIP&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then they just answer with the shortest expression they can, but they don't have to use an actual language, just plain regex. Like for this challenge they would do something like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;test[0-9]+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then they would explain:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;test - find the word test&#xA;[0-9]+ - find 1+ occurrences of any number&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Can this kind of challenge become a new tag? Or should I just say it's code golf with only regex allowed?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Example was really basic, there will be more of a story behind it, and it will be complex so there can be multiple answers where some are shorter)&lt;/p&gt;&#xA;" OwnerUserId="61877" LastEditorUserId="30688" LastEditDate="2017-04-24T01:06:27.130" LastActivityDate="2017-04-24T01:06:27.130" Title="Regex Challenges" Tags="|discussion|code-golf|tags|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12186" PostTypeId="2" ParentId="12185" CreationDate="2017-04-23T13:56:43.217" Score="4" Body="&lt;h1&gt;This should just be tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regex&amp;#39;&quot; rel=&quot;tag&quot;&gt;regex&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The important question to ask when considering a new tag is &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;How will this help people search and find questions they are interested in?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This new tag wouldn't really help anyone. Anyone who was looking for these challenges would search &lt;code&gt;[code-golf][regex]&lt;/code&gt; and find all of them with no issue so there is no reason to add a new tag.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-04-23T13:56:43.217" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12189" PostTypeId="2" ParentId="2140" CreationDate="2017-04-23T20:04:47.393" Score="0" Body="&lt;h1&gt;Google Autocomplete Fun &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to create a program which, given an input string, will output the first Google autocomplete result for that search. The format of input/output is up to you.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Your program must take 1 input, a string, and output the top Google autocomplete/auto-fill suggestions result. The format of input/output is up to you. Just be sure to mention what your I/O format is.&lt;/li&gt;&#xA;&lt;li&gt;Obviously, accessing the Internet is allowed.&lt;/li&gt;&#xA;&lt;li&gt;URL shorteners (like bit.ly, TinyURL, etc.) are strictly &lt;em&gt;disallowed&lt;/em&gt;. You should fetch your autocomplete results from this URL: &lt;a href=&quot;http://suggestqueries.google.com/complete/search?client=your_browser&amp;amp;q=your_query&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://suggestqueries.google.com/complete/search?client=your_browser&amp;amp;q=your_query&lt;/a&gt;. You are allowed to assume any browser name for &lt;code&gt;client&lt;/code&gt;. In the &lt;a href=&quot;https://gist.github.com/ckjbgames/f7bfa353e639f4a449fc57ab0a7befd3&quot; rel=&quot;nofollow noreferrer&quot;&gt;program I wrote&lt;/a&gt;, I assume Chrome. Any browser name or string should work.&lt;/li&gt;&#xA;&lt;li&gt;Please provide an explanation of how your program works. It is not mandatory, but I strongly advise it.&lt;/li&gt;&#xA;&lt;li&gt;All standard loopholes are &lt;em&gt;strictly forbidden&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so may the shortest code win and the best programmer prosper...&lt;/p&gt;&#xA;" OwnerUserId="64706" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-23T21:06:35.270" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12193" PostTypeId="5" CreationDate="2017-04-24T13:31:51.907" Score="0" Body="" OwnerUserId="34718" LastEditorUserId="34718" LastEditDate="2017-04-24T13:31:51.907" LastActivityDate="2017-04-24T13:31:51.907" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12194" PostTypeId="4" CreationDate="2017-04-24T13:31:51.907" Score="0" Body="For questions regarding atomic code golf challenges and/or submissions" OwnerUserId="34718" LastEditorUserId="34718" LastEditDate="2017-04-24T13:31:51.907" LastActivityDate="2017-04-24T13:31:51.907" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12198" PostTypeId="2" ParentId="5243" CreationDate="2017-04-24T18:15:36.570" Score="1" Body="&lt;h1&gt;150 rep for the winning submission on the winning team of &lt;a href=&quot;https://codegolf.stackexchange.com/q/117482/58826&quot;&gt;Team of The Hill!&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The winning submission is the bot on the winning team with &lt;em&gt;the most kills&lt;/em&gt; at the end.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;To claim the rep, comment below: &lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastEditorDisplayName="user58826" LastEditDate="2017-04-28T16:02:08.170" LastActivityDate="2017-04-28T16:02:08.170" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12201" PostTypeId="2" ParentId="12163" CreationDate="2017-04-24T23:46:44.920" Score="0" Body="&lt;p&gt;Note also that if you catch the problem quickly enough, you can &lt;em&gt;delete&lt;/em&gt; your challenge (even if you can't close it). The rules about deleting questions are based on how many answers they have and how many votes the answers have, not on how many close votes they have, so it's possible that one method will work when the other fails.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-04-24T23:46:44.920" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12202" PostTypeId="2" ParentId="12142" CreationDate="2017-04-25T00:02:40.613" Score="4" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/first-solution&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;first-solution&amp;#39;&quot; rel=&quot;tag&quot;&gt;first-solution&lt;/a&gt; is a pretty terrible win condition. I guess it's objective, but it rather goes against the spirit of competition on PPCG (you'll see that that tag is empty); when we have something we want to do like that, we typically do it as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; (the &quot;robbers&quot; half of the challenge is effectively a set of mini first-solution competitions). So I don't think this site is very well set up for this &lt;em&gt;type&lt;/em&gt; of challenge. (Puzzling handles the general nature of this challenge much better.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for the specific challenge mentioned, it's much more problematic because it breaks both &lt;a href=&quot;https://stackexchange.com/legal&quot;&gt;Stack Exchange rules&lt;/a&gt; (thanks @AdmBorkBork for the link) and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4829/should-asking-for-malicious-code-be-on-topic&quot;&gt;PPCG rules&lt;/a&gt; (thanks @plannapus for the link), and (even if that weren't the case) requires placing a lot of load on servers that the answerer doesn't own as part of the challenge. I tend to be wary of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stack-exchange-api&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stack-exchange-api&amp;#39;&quot; rel=&quot;tag&quot;&gt;stack-exchange-api&lt;/a&gt; challenges as it is (partly because they're often uncreative, but partly because a mistake in testing your code can cause more wide-reaching issues), and this seems like a particularly bad use for them.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-04-25T00:02:40.613" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12203" PostTypeId="5" CreationDate="2017-04-25T00:09:03.243" Score="0" Body="&lt;p&gt;As with pretty much any website that allows user submissions, some questions and answers have appropriate subject matter (are &amp;quot;on-topic&amp;quot;) for the site, and some are &amp;quot;off-topic&amp;quot; and closed/deleted as such. On Stack Exchange, topicality for answers is fairly easy to define (an answer is on-topic if it answers or attempts to answer the question given, although it might still be deleted for other reasons). Topicality for questions, however, can be less obvious&lt;/p&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;/questions/tagged/scope&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;scope&amp;#39;&quot; rel=&quot;tag&quot;&gt;scope&lt;/a&gt; tag is for questions on Meta that discuss what sort of topics are appropriate for questions on the main CGCC site; although CGCC has an &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;official definition of topicality&lt;/a&gt;, it's often necessary to ask a question on Meta about where exactly the boundary lies, and this tag serves to categorise those questions. The tag can also be used on proposals to change the definition of topicality.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="68942" LastEditorDisplayName="user62131" LastEditDate="2021-11-09T16:57:12.237" LastActivityDate="2021-11-09T16:57:12.237" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="12204" PostTypeId="4" CreationDate="2017-04-25T00:09:03.243" Score="0" Body="Questions about what sort of questions are appropriate for CGCC." OwnerDisplayName="user62131" LastEditorUserId="68942" LastEditorDisplayName="user62131" LastEditDate="2021-11-09T16:57:12.237" LastActivityDate="2021-11-09T16:57:12.237" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="12205" PostTypeId="5" CreationDate="2017-04-25T00:17:35.803" Score="0" Body="&lt;p&gt;Most posts here on CGCC Meta are for meta-discussion of the CGCC site as a whole (e.g. its rules, how to use it, and so on). However, occasionally extended meta-discussion is needed for a single on CGCC question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In most cases, meta-discussion of a question can be handled on comments to that question (possibly extended into a chat room for that question). However, in complex cases, or when there's widespread disagreement about the best way to handle the question, it's sometimes best to use Stack Exchange's asking/answering/voting system in order to determine a consensus. In such cases, the question used for meta-discussion of the original question is posted on CGCC Meta (with a link back to the original question on CGCC), and tagged &lt;a href=&quot;/questions/tagged/specific-question&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;specific-question&amp;#39;&quot; rel=&quot;tag&quot;&gt;specific-question&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This tag could also be used for meta-discussion of a specific question on CGCC Meta, if doing so ever becomes necessary.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="56656" LastEditorDisplayName="user62131" LastEditDate="2020-02-03T17:07:59.113" LastActivityDate="2020-02-03T17:07:59.113" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="12206" PostTypeId="4" CreationDate="2017-04-25T00:17:35.803" Score="0" Body="Requests for help with, or discussion of, a specific question on CGCC." OwnerDisplayName="user62131" LastEditorUserId="56656" LastEditorDisplayName="user62131" LastEditDate="2020-02-03T17:07:59.113" LastActivityDate="2020-02-03T17:07:59.113" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="12207" PostTypeId="1" CreationDate="2017-04-25T01:36:41.353" Score="5" ViewCount="337" Body="&lt;p&gt;I recently posted &lt;a href=&quot;https://codegolf.stackexchange.com/a/117410/61384&quot;&gt;a code-golf answer&lt;/a&gt; in Scheme-1. However, the Scheme-1 language cannot be implemented (as it would require the implementation to solve the halting problem).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I marked it as non-competing because there is no implementation. However, @ais523 commented:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I'm not sure that you can submit an answer in a language that's theoretically impossible to implement (assuming the Church-Turing hypothesis), because we normally go by the implementation to define how the language works, and that doesn't work in this case. Non-competing status is normally reserved for languages where there's a viable implementation, but it's newer than the challenge.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;What is our policy on uncomputable submissions?&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="39490" LastEditDate="2017-05-30T17:05:45.433" LastActivityDate="2017-05-30T17:05:45.433" Title="Do we accept submissions in unimplementable languages?" Tags="|discussion|code-golf|answers|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12208" PostTypeId="2" ParentId="12207" CreationDate="2017-04-25T04:58:01.980" Score="10" Body="&lt;p&gt;If there is no implementation, there is no language. We require a functioning implementation of the language (as a compiler, interpreter, or whatever) for it to be used on PPCG. Since Scheme-1's implementation requires solving the halting problem, and the halting problem cannot be solved, Scheme-1 cannot be used on PPCG.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More generally: if there is no implementation, there is no language, and any answer written in that &quot;language&quot; would be invalid and subject to removal per &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990/45941&quot;&gt;our policy on invalid answers&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2017-04-25T06:18:56.143" LastActivityDate="2017-04-25T06:18:56.143" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="12211" PostTypeId="2" ParentId="9607" CreationDate="2017-04-25T17:45:31.690" Score="2" Body="&lt;p&gt;It's worth pointing out that the answers above are of historical interest only. The language showcase has been changed to community wiki status (so that posts don't have an owner and the barrier to editing is lower); it's likely that this sort of edit would be accepted now (possibly even without approval).&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-04-25T17:45:31.690" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12215" PostTypeId="2" ParentId="2140" CreationDate="2017-04-26T05:23:16.980" Score="0" Body="&lt;h1&gt;Find the Calling Pattern&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've written a program to add two numbers &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f=lambda:lambda a:lambda b:lambda:a+b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This has a very specific calling pattern. It must be called as:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f()(a)(b)()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In this case, it was fairly clear, but sometimes the calling pattern can be more complicated:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f(a,None)()(&quot;&quot;,&quot;&quot;,&quot;&quot;)([0,0],b)(())()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In essence, this challenge is about the cops trying to obfuscate this calling pattern, and the robbers trying to find it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules for Cops:&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Calling patterns:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The function must only need to be called up to 5 times to give the answer.&lt;/li&gt;&#xA;&lt;li&gt;For the purposes of this challenge, a &lt;em&gt;false-unit&lt;/em&gt; is &lt;code&gt;None&lt;/code&gt;, &lt;code&gt;&quot;&quot;&lt;/code&gt;, &lt;code&gt;[]&lt;/code&gt;, &lt;code&gt;0&lt;/code&gt;, or &lt;code&gt;()&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A valid argument to the curried function in the calling pattern is either:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a false-unit,&lt;/li&gt;&#xA;&lt;li&gt;a list or tuple containing one to five false units, or&lt;/li&gt;&#xA;&lt;li&gt;one of the actual numbers to be added (represented by &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Each time it is called, it should only take up to five arguments.&lt;/li&gt;&#xA;&lt;li&gt;The calling pattern can change based on what arguments are passed to it. Be creative!&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; must each appear once in the calling pattern.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Examples of valid calling patterns:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f(a,b)&#xA;f(&quot;&quot;,a)(b,[0,0])&#xA;f(a)(&quot;&quot;,(),[None],[0,()])(b)()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Examples of invalid calling patterns:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f(a,b,0,0,&quot;&quot;,[]) # too many arguments&#xA;f(a,[(),[],&quot;&quot;,(),[],&quot;&quot;])(b) # too many elements in [(),[],&quot;&quot;,(),[],&quot;&quot;]&#xA;f(a) # b is not passed&#xA;f([a,b]) # a and b may not be contained in a list&#xA;f((0,[None,&quot;&quot;]),a)(b) # [None,&quot;&quot;] is not a false-unit&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For your submission, you must post a lambda that, when called according to your calling pattern, evaluates to &lt;code&gt;a + b&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can assume that &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; are both positive and that &lt;code&gt;a + b &amp;lt; 2147483647&lt;/code&gt; (the highest signed 32-bit integer).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your submission is safe if it is not cracked by a robber in one week.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules for Robbers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To crack a cop's submission, you must post a submission which takes two inputs and returns a string showing how to call the cop's submission to coerce it into adding your two inputs. For example, if this was a cop's submission:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;lambda:lambda x,z:lambda y:x+(y*(z==0))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This could be your crack:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;lambda a, b: &quot;f()(%s, 0)(%s)&quot; % (a, b)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Notes&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is there anything I should clarify? Should I add more examples?&lt;/li&gt;&#xA;&lt;li&gt;Should I try to make this language agnostic or restrict it to Python?&lt;/li&gt;&#xA;&lt;li&gt;Is this too weighted towards one side (is it too easy for the cops or the robbers?)&lt;/li&gt;&#xA;&lt;li&gt;Are there any additional restrictions that could make it more fair?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="194" LastEditDate="2017-04-27T16:03:23.283" LastActivityDate="2017-04-27T16:03:23.283" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="12217" PostTypeId="2" ParentId="2447" CreationDate="2017-04-26T05:45:56.650" Score="6" Body="&lt;h2&gt;A full program may be input or output any time a function could&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If we can do this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x=&amp;gt;y=&amp;gt;x+y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then we can do this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;print(&quot;print(int(input())+&quot;+input()+&quot;)&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="44694" LastEditDate="2017-10-26T00:09:14.143" LastActivityDate="2017-10-26T00:09:14.143" CommentCount="2" CommunityOwnedDate="2017-05-23T03:05:56.173" ContentLicense="CC BY-SA 3.0" />
  <row Id="12218" PostTypeId="1" CreationDate="2017-04-26T06:34:05.040" Score="-11" ViewCount="391" Body="&lt;p&gt;My chat account has just been suspended for 30 days. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I have not had any lasting suspensions over 30 minutes in the past month. &lt;/li&gt;&#xA;&lt;li&gt;There was completely no warning about it. &lt;/li&gt;&#xA;&lt;li&gt;I do not think I posted anything too controversial, off-topic, or NSFW. &lt;/li&gt;&#xA;&lt;li&gt;I had not sent a message for a while.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Can someone please link me to the offending message? Is there a way to shorten this suspension?&lt;/p&gt;&#xA;" OwnerUserId="53551" LastEditorUserId="53551" LastEditDate="2017-04-26T07:02:29.740" LastActivityDate="2017-04-26T07:02:29.740" Title="Chat account suspended?" Tags="|support|chat|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12219" PostTypeId="2" ParentId="12218" CreationDate="2017-04-26T06:51:36.783" Score="17" Body="&lt;ul&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;I have not had any suspensions over 30 minutes in the past month.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This isn't true.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;There was completely no warning about it.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;You were reminded of our rules and guidelines on multiple occasions, and occasionally kicked. Several messages of yours were moved to trash. You chose to ignore those warnings.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;I do not think I posted anything too controversial, off-topic, or NSFW.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is also not true. Hence the 30-minute suspensions and kicks.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Can someone please link me to the offending message?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;You weren't suspended for a particular message. I can't link you to all of them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Long-term suspensions are rarely handed out because of a single message. However, you constantly succeed in lowering the signal-to-noise ratio. You have been told several times that this isn't acceptable in TNB, but we've failed to see any improvements in your behavior since your last suspension. The latest example is probably your nonsensical conversation from today that resulted in a lot of random users getting pinged.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Is there a way to shorten this suspension?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;No.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-04-26T06:51:36.783" CommentCount="18" ContentLicense="CC BY-SA 3.0" />
  <row Id="12220" PostTypeId="1" CreationDate="2017-04-26T11:42:06.283" Score="31" ViewCount="805" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Update&lt;/strong&gt;: the &lt;a href=&quot;https://github.com/TheNineteenthByte/The-Nineteenth-Byte/blob/master/chatiquette.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;new Chatiquette&lt;/a&gt; has been instated. We are still interested in hearing feedback, so feel free to continue to give feedback here.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;As &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11160/45941&quot;&gt;previously noted&lt;/a&gt;, the &lt;a href=&quot;http://ppcg.github.io/chatiquette/&quot; rel=&quot;nofollow noreferrer&quot;&gt;current Chatiquette&lt;/a&gt; for The Nineteenth Byte is ineffective. Hence, the room owners have been working on a revised Chatiquette to address the concerns of the community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Our goal in making these revisions was not to add stricter rules. Rather, our goal was to have better boundaries for what behaviors are appropriate or inappropriate in chat. The community already had expectations for appropriate chat behavior that make chat a more pleasant place for everyone, and we wanted to clarify and make explicit those expectations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The revised Chatiquette can be found at the end of this post. Please review it and post any feedback below. We want to hear what the community thinks, so the current Chatiquette will not be replaced until sufficient time has passed for us to receive feedback and make any changes as needed.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Chatiquette&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a set of guidelines for proper &lt;strong&gt;chat&lt;/strong&gt; e&lt;strong&gt;tiquette&lt;/strong&gt; in &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;. While following these suggestions is a great way to get along, it's not, nor will it ever be, a complete list; always use your own judgment and self-control. Remember, you're not the only one chatting in The Nineteenth Byte. Be considerate of other chatters.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Do's&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Be Nice&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://codegolf.stackexchange.com/help/be-nice&quot;&gt;Be Nice&lt;/a&gt; means being patient and welcoming, especially to new users. It means not being rude, and being polite instead. And it means avoiding name-calling, bigotry, harassment and inappropriate language.&lt;/li&gt;&#xA;&lt;li&gt;The Nineteenth Byte may be a user’s first experience with PPCG, so be a good ambassador.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Be On-Topic&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;While off-topic conversations are allowed in The Nineteenth Byte, they should not get in the way of on-topic discussions. The Nineteenth Byte's purpose is to provide a place for users to discuss PPCG.&lt;/li&gt;&#xA;&lt;li&gt;Please pause an off-topic conversation or continue it in a different room created for the conversation if there is an on-topic conversation going on. The room owners will be happy to assist the latter choice by moving the off-topic messages to the created room.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Don'ts&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Don't Be Disruptive&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Being disruptive means doing anything that prevents, impedes, or discourages other users from using The Nineteenth Byte for its intended purpose. This includes continuing off-topic conversations while an on-topic conversation is happening, or posting nonsense that makes it harder to follow conversations.&lt;/li&gt;&#xA;&lt;li&gt;Additionally, engaging in vitriolic discussions or baiting others into engaging in them is similarly disruptive. We're all here to have a good time.&lt;/li&gt;&#xA;&lt;li&gt;Don't &lt;a href=&quot;https://meta.stackexchange.com/tags/onebox/info&quot;&gt;abuse oneboxes&lt;/a&gt;. Certain types of links will be inlined into chat. While posting interesting pictures/animations is OK in moderation, consider just posting it as a regular link instead. Links to images are preferred because 1) they take up less vertical space, allowing more of the conversation to be seen, and 2) some users have slow internet, limited bandwidth, or use mobile data for chatting. A link to an image is much less disruptive. The same applies to excessively large code-blocks.&lt;/li&gt;&#xA;&lt;li&gt;Don't promote your own content too much. Promoting your own content is absolutely OK, but there is definitely a point at which it becomes excessive. Avoid promoting off-site material unless it's related to the topic of discussion. Sharing posts that you want feedback on is perfectly fine, but sharing things just in the hope of getting more upvotes is &lt;em&gt;not&lt;/em&gt;. The rule of thumb to follow is &quot;If somebody else had posted this, would I still really want to share it?&quot; If the answer is yes, then go ahead. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10184/31716&quot;&gt;More guidelines on self-promotion&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Don't Make Noise&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Sometimes, there isn't anybody talking in chat. That's perfectly fine. Don't send messages just because the room is quiet.&lt;/li&gt;&#xA;&lt;li&gt;Consider whether your message is actually adding anything to the chat room. If not, please keep it to yourself. If the message wouldn't be missed if it were gone, it probably doesn't add anything.&lt;/li&gt;&#xA;&lt;li&gt;Don't use The Nineteenth Byte as a dumping ground for your thoughts or actions. Consider whether a topic would be relevant to others before talking about it. We're here to have discussions, not to listen to someone's stream of consciousness.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Don't use chat flags for chatiquette violations&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Chat flags are only for urgent or offensive violations of network wide SE policy, and alert all 10K users and mods across all SE chat rooms. Instead mention it to a room owner. If it needs to be private raise a custom flag (in need of moderator intervention) on main (not chat) on one of your own posts.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Moderation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;http://chat.stackexchange.com/rooms/info/240/the-nineteenth-byte&quot;&gt;room owners&lt;/a&gt; of The Nineteenth Byte have a duty to keep the chat room a nice place. In a perfect world, they would not need to use their moderation tools, because everyone would be respectful of each other, and use chat appropriately. However, situations do arise where moderation is necessary, and in those situations the room owners will take action.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Users who violate this chatiquette will be warned, and the violating messages will be removed. Additionally, room owners may kick the user from the room at their discretion. For violations of network-wide policy, which includes aggravating users in the room with repeated violations of this chatiquette, a network-wide suspension may be applied by a moderator.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your messages are removed, or you are kicked or suspended, please reflect on the cause and make an effort to not violate the chatiquette in the future. If, after reflection, you believe a room owner action was inappropriate, please feel free to bring it up with the other room owners or on Meta for review.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2017-05-10T12:23:55.760" LastActivityDate="2017-05-13T04:33:54.717" Title="We've written a new Chatiquette, and we want your feedback!" Tags="|discussion|chat|moderation|etiquette|" AnswerCount="4" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="12222" PostTypeId="1" CreationDate="2017-04-26T14:39:42.543" Score="0" ViewCount="54" Body="&lt;p&gt;When the question clearly asks for an integer is it always OK to just print the ASCII digits of the integer without actually generating the integer value?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The consensus is yes.  It's the programs/functions output that matters not the intermediate (integer value). &lt;/p&gt;&#xA;" OwnerUserId="47988" LastEditorUserId="47988" LastEditDate="2017-04-26T16:32:18.680" LastActivityDate="2017-04-26T16:32:18.680" Title="In code-golf is it always ok to print ASCII digits when an integer is asked for?" Tags="|discussion|rules|" AnswerCount="0" CommentCount="3" ClosedDate="2017-04-26T14:44:43.350" ContentLicense="CC BY-SA 3.0" />
  <row Id="12224" PostTypeId="1" CreationDate="2017-04-26T15:32:01.887" Score="1" ViewCount="128" Body="&lt;p&gt;A while ago I did something rather stupid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After I added a Brain-Flueue flag to the ruby implementation of Brain-Flak I went ahead and deleted the old Brain-Flueue repository.  This made sense at the time because the new Brain-Flueue was better in every possible way, and the old one was preventing me from tab completing in my current directory.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now I realized this was not a good idea, because I would like to add Brain-Flueue to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/102370/add-a-language-to-a-polyglot&quot;&gt;this&lt;/a&gt; challenge at some time.  But the new shiny interpreter post-dates the challenge and since it is an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; question non-competing languages are disallowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, through some convoluted shenanigans I have managed to recover a copy of the interpreter unchanged with all of its git history.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I publish an unchanged copy of this interpreter online will Brain-Flueue answers still be non-competing?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-04-26T16:06:49.630" Title="Reviving a lost language" Tags="|discussion|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12225" PostTypeId="2" ParentId="12224" CreationDate="2017-04-26T15:34:17.460" Score="1" Body="&lt;h1&gt;No. Go ahead and answer&lt;/h1&gt;&#xA;&lt;p&gt;The language was made with the interpreter before the challenge. Add a note on the repo about what happened. Especially with the git-history then you have proof.&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-26T15:34:17.460" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12226" PostTypeId="2" ParentId="12220" CreationDate="2017-04-26T16:00:48.187" Score="12" Body="&lt;h1&gt;Say what &quot;Be Nice&quot; means to us &lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Right now, the &quot;Be nice&quot; section starts with &quot;Stack Exchange enforces the Be Nice policy network-wide. That means you must Be Nice in chat, too.&quot; and a link. This is a bit more standoffish (&quot;enforces&quot;) and impersonal than it needs to be. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance: &quot;Be nice means being patient and welcoming, especially to new users. It means not being rude, and being polite instead. And it means avoiding name-calling, bigotry, harassment and inappropriate language.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then, we could follow this up with mentioning that it's a SE policy.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorDisplayName="user45941" LastEditDate="2017-04-28T17:30:20.870" LastActivityDate="2017-04-28T17:30:20.870" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12227" PostTypeId="2" ParentId="12224" CreationDate="2017-04-26T16:06:49.630" Score="2" Body="&lt;p&gt;I'm pretty sure that if you &lt;code&gt;git push&lt;/code&gt; from your local repository to a new GitHub repository then no-one will be able to tell the difference. If you hadn't brought it up yourself, it wouldn't even have been an issue.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-04-26T16:06:49.630" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12228" PostTypeId="2" ParentId="2140" CreationDate="2017-04-26T16:07:25.580" Score="0" Body="&lt;h2&gt;Excel NORMSINV function&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Implement the excel NORMSINV function in your favourite language, shortest code wins&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Build in functions and standard loopholes are not allowed&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Loss of precision is also not allowed&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Reference C Implementation&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;/*&#xA; * Original C++ implementation found at http://www.wilmott.com/messageview.cfm?catid=10&amp;amp;threadid=38771&#xA; * C# implementation found at http://weblogs.asp.net/esanchez/archive/2010/07/29/a-quick-and-dirty-implementation-of-excel-norminv-function-in-c.aspx&#xA; *     Compute the quantile function for the normal distribution.&#xA; *&#xA; *     For small to moderate probabilities, algorithm referenced&#xA; *     below is used to obtain an initial approximation which is&#xA; *     polished with a final Newton step.&#xA; *&#xA; *     For very large arguments, an algorithm of Wichura is used.&#xA; *&#xA; *  REFERENCE&#xA; *&#xA; *     Beasley, J. D. and S. G. Springer (1977).&#xA; *     Algorithm AS 111: The percentage points of the normal distribution,&#xA; *     Applied Statistics, 26, 118-121.&#xA; *&#xA; *      Wichura, M.J. (1988).&#xA; *      Algorithm AS 241: The Percentage Points of the Normal Distribution.&#xA; *      Applied Statistics, 37, 477-484.&#xA; */&#xA;&#xA;#include &amp;lt;math.h&amp;gt;&#xA;&#xA;double normsInv(double p, double mu, double sigma)&#xA;{&#xA;    if (p &amp;lt; 0 || p &amp;gt; 1)&#xA;    {&#xA;        printf(&quot;The probality p must be bigger than 0 and smaller than 1&quot;);&#xA;        exit(1);&#xA;    }&#xA;    if (sigma &amp;lt; 0)&#xA;    {&#xA;        printf(&quot;The standard deviation sigma must be positive&quot;);&#xA;        exit(1);&#xA;    }&#xA;    if (p == 0)&#xA;    {&#xA;        return -1e100;&#xA;    }&#xA;    if (p == 1)&#xA;    {&#xA;        return 1e100;&#xA;    }&#xA;    if (sigma == 0)&#xA;    {&#xA;        return mu;&#xA;    }&#xA;&#xA;    double q, r, val;&#xA;&#xA;    q = p - 0.5;&#xA;&#xA;    /*-- use AS 241 --- */&#xA;    /* double ppnd16_(double *p, long *ifault)*/&#xA;    /*      ALGORITHM AS241  APPL. STATIST. (1988) VOL. 37, NO. 3&#xA;            Produces the normal deviate Z corresponding to a given lower&#xA;            tail area of P; Z is accurate to about 1 part in 10**16.&#xA;    */&#xA;    if (fabs(q) &amp;lt;= .425)&#xA;    {/* 0.075 &amp;lt;= p &amp;lt;= 0.925 */&#xA;        r = .180625 - q * q;&#xA;        val =&#xA;               q * (((((((r * 2509.0809287301226727 +&#xA;                          33430.575583588128105) * r + 67265.770927008700853) * r +&#xA;                        45921.953931549871457) * r + 13731.693765509461125) * r +&#xA;                      1971.5909503065514427) * r + 133.14166789178437745) * r +&#xA;                    3.387132872796366608)&#xA;               / (((((((r * 5226.495278852854561 +&#xA;                        28729.085735721942674) * r + 39307.89580009271061) * r +&#xA;                      21213.794301586595867) * r + 5394.1960214247511077) * r +&#xA;                    687.1870074920579083) * r + 42.313330701600911252) * r + 1);&#xA;    }&#xA;    else&#xA;    { /* closer than 0.075 from {0,1} boundary */&#xA;&#xA;        /* r = min(p, 1-p) &amp;lt; 0.075 */&#xA;        if (q &amp;gt; 0)&#xA;            r = 1 - p;&#xA;        else&#xA;            r = p;&#xA;&#xA;        r = sqrt(-log(r));&#xA;        /* r = sqrt(-log(r))  &amp;lt;==&amp;gt;  min(p, 1-p) = exp( - r^2 ) */&#xA;&#xA;        if (r &amp;lt;= 5)&#xA;        { /* &amp;lt;==&amp;gt; min(p,1-p) &amp;gt;= exp(-25) ~= 1.3888e-11 */&#xA;            r += -1.6;&#xA;            val = (((((((r * 7.7454501427834140764e-4 +&#xA;                       .0227238449892691845833) * r + .24178072517745061177) *&#xA;                     r + 1.27045825245236838258) * r +&#xA;                    3.64784832476320460504) * r + 5.7694972214606914055) *&#xA;                  r + 4.6303378461565452959) * r +&#xA;                 1.42343711074968357734)&#xA;                / (((((((r *&#xA;                         1.05075007164441684324e-9 + 5.475938084995344946e-4) *&#xA;                        r + .0151986665636164571966) * r +&#xA;                       .14810397642748007459) * r + .68976733498510000455) *&#xA;                     r + 1.6763848301838038494) * r +&#xA;                    2.05319162663775882187) * r + 1);&#xA;        }&#xA;        else&#xA;        { /* very close to  0 or 1 */&#xA;            r += -5;&#xA;            val = (((((((r * 2.01033439929228813265e-7 +&#xA;                       2.71155556874348757815e-5) * r +&#xA;                      .0012426609473880784386) * r + .026532189526576123093) *&#xA;                    r + .29656057182850489123) * r +&#xA;                   1.7848265399172913358) * r + 5.4637849111641143699) *&#xA;                 r + 6.6579046435011037772)&#xA;                / (((((((r *&#xA;                         2.04426310338993978564e-15 + 1.4215117583164458887e-7) *&#xA;                        r + 1.8463183175100546818e-5) * r +&#xA;                       7.868691311456132591e-4) * r + .0148753612908506148525)&#xA;                     * r + .13692988092273580531) * r +&#xA;                    .59983220655588793769) * r + 1);&#xA;        }&#xA;&#xA;        if (q &amp;lt; 0.0)&#xA;        {&#xA;            val = -val;&#xA;        }&#xA;    }&#xA;&#xA;    return mu + sigma * val;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="41374" LastActivityDate="2017-04-26T16:07:25.580" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12230" PostTypeId="2" ParentId="2140" CreationDate="2017-04-27T04:26:30.183" Score="0" Body="&lt;h1&gt;To Polar and Back&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;There are 2 main ways to represent a single point on a plane:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;in Cartesian form, with an x and y value,&lt;/li&gt;&#xA;&lt;li&gt;and in Polar form, with an angle and a magnitude&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For example, the point &lt;code&gt;(5, 5)&lt;/code&gt; can also be represented with the angle &lt;code&gt;π / 4&lt;/code&gt; and magnitude &lt;code&gt;5 * sqrt(2)&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this challenge, we will be using radians, and not degrees.&lt;/p&gt;&#xA;&lt;h2&gt;Conversion&lt;/h2&gt;&#xA;&lt;p&gt;This challenge deals with the mapping of Polar form onto a Cartesian grid, by using the angle as the x value, and the magnitude as the y value.&lt;/p&gt;&#xA;&lt;p&gt;For example, to change the point &lt;code&gt;(sqrt(3), 1)&lt;/code&gt; into Polar form and back, we first convert it into polar form, with an angle of &lt;code&gt;π / 6&lt;/code&gt; and magnitude of &lt;code&gt;2&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Then, these values are mapped into Cartesian form, yielding the Cartesian point &lt;code&gt;(π/6, 2)&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Create a program or function that, given a rectangle in Cartesian form, outputs it's area after it has been converted to Polar form and mapped back onto the Cartesian plane by equating angle with x and magnitude with y.&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;The input will be a rectangle in Cartesian form whose legs are parallel to the x and y axes. Also, all 4 corners will be in the first quadrant, meaning that all x and y values will be strictly positive.&lt;/p&gt;&#xA;&lt;p&gt;This means that you may take&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The Cartesian coordinates of all 4 corners&lt;/li&gt;&#xA;&lt;li&gt;The Cartesian coordinates of opposite corners&lt;/li&gt;&#xA;&lt;li&gt;The Cartesian coordinates of one corner, and a width and height value&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;or some other reasonable form, such as a rectangle object.&#xA;The important thing is that you don't take Polar coordinates as input.&lt;/p&gt;&#xA;&lt;p&gt;You can take the points or values in any order you choose.&lt;/p&gt;&#xA;&lt;p&gt;Please include the input format you used in your answer.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;Output will be a single, decimal number rounded to at least the hundredth's place (2 digits after the decimal).&lt;/p&gt;&#xA;&lt;h2&gt;Explained Example&lt;/h2&gt;&#xA;&lt;p&gt;Note: For the sake of clarity, I will use symbols like &lt;code&gt;π&lt;/code&gt; or &lt;code&gt;sqrt(3)&lt;/code&gt; instead of their decimal equivalents.&lt;/p&gt;&#xA;&lt;p&gt;Also keep in mind that this is probably one of many ways to go about this problem, and it doesn't matter what method you use to find the area as long as you do. This example is mostly to explain the above by showing it in action.&lt;/p&gt;&#xA;&lt;p&gt;Anyways, here is out input, in the form of 4 points:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;(1, sqrt(3)), (4, sqrt(3)), (1, 1), (4, 1)&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;First, we might convert each point into polar form, and map that back onto the Cartesian plane:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(x, y)       -&amp;gt; (angle, magnitude)&#xA;(1, sqrt(3)) -&amp;gt; (π/3, 2)&#xA;(4, sqrt(3)) -&amp;gt; (arctan(sqrt(3)/4), sqrt(19))&#xA;(1, 1)       -&amp;gt; (π/4, sqrt(2))&#xA;(4, 1)       -&amp;gt; (arctan(1/4), sqrt(17))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This should be relatively easy using trigonometry and the Pythagorean theorem.&lt;/p&gt;&#xA;&lt;p&gt;These new Cartesian points give us the corners of our new shape, which looks something like this:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/BWO8z.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/BWO8z.png&quot; alt=&quot;courtesy of http://www.meta-calculator.com&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Notice that the sides are not straight, meaning you will have to figure out how to get the equations for the sides as well as how to find the area. I'll leave that up to you.&lt;/p&gt;&#xA;&lt;p&gt;In any case, the area of this shape is about &lt;code&gt;0.81810689&lt;/code&gt;, but you only need to print &lt;code&gt;0.82&lt;/code&gt; (without the leading &lt;code&gt;0&lt;/code&gt;, if you prefer).&lt;/p&gt;&#xA;&lt;h2&gt;Other Test Cases&lt;/h2&gt;&#xA;&lt;p&gt;The input will be taken in the form of 4 points, in reading order (left to right, then top to bottom)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;input -&amp;gt; output&#xA;(1, 1.732), (4, 1.732), (1, 1), (4, 1) -&amp;gt; 0.82&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox:&lt;/strong&gt; I will add more test cases later - any suggestions about certain edge cases I should include would be helpful.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins.&lt;/p&gt;&#xA;&lt;p&gt;Standard loopholes, as always, apply.&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any name ideas?&lt;/li&gt;&#xA;&lt;li&gt;Any tags I should add/remove?&lt;/li&gt;&#xA;&lt;li&gt;Suggestions/help with creating test cases?&lt;/li&gt;&#xA;&lt;li&gt;Is the explanation sufficient?&lt;/li&gt;&#xA;&lt;li&gt;Should I change the accuracy requirement to 3 digits after the decimal point, or would that be too hard?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Thanks!&lt;/p&gt;&#xA;" OwnerUserId="62574" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-27T17:04:11.397" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12231" PostTypeId="2" ParentId="2140" CreationDate="2017-04-27T10:18:05.600" Score="-2" Body="&lt;h1&gt;Description&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Find the number of '1's in a binary number of any length. (Variable name up to you)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You should output or print an integer/number/string which reflects the number of '1's that were counted.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;10101100&lt;/code&gt; should return &lt;code&gt;4&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'm new here, so I don't know if this has been asked before. I searched but I could only find one other similar question, however that required the answer to be in binary, and was somewhat different in terms of the inputs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question seems very short and lacking details, but I don't know how to expand further on such a simple challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any other ways I could improve on my first post in this Stack Exchange?&lt;/p&gt;&#xA;" OwnerUserId="68562" LastActivityDate="2017-04-27T10:18:05.600" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12232" PostTypeId="1" CreationDate="2017-04-27T13:59:24.500" Score="0" ViewCount="72" Body="&lt;p&gt;Suppose one answers a code-golf challenge for a language with a solution which is ill-formed according to the spec of the selected language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;But it works nonetheless with all major interpreters&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Is the answer considered valid?&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Exemple:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Challenge:  print this text: &lt;code&gt;Hello, World!&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Solution: HTML, 19 bytes: &lt;code&gt;&amp;lt;html&amp;gt;Hello, World!&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Discussion: Most (all?) browser would indeed print the exact text &lt;code&gt;Hello, World!&lt;/code&gt;, even though the code snippet is not a valid HTML file. Should OP accept this answer?&lt;/p&gt;&#xA;" OwnerUserId="56090" LastEditorUserId="64499" LastEditDate="2017-04-27T14:48:47.593" LastActivityDate="2017-04-27T14:48:47.593" Title="Code golf: is an invalid but working solution acceptable?" Tags="|discussion|" AnswerCount="0" CommentCount="2" ClosedDate="2017-04-27T17:18:42.890" ContentLicense="CC BY-SA 3.0" />
  <row Id="12234" PostTypeId="2" ParentId="2140" CreationDate="2017-04-27T16:50:51.590" Score="0" Body="&lt;h1&gt;Electron Configurations: Orbitals&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chemistry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chemistry&amp;#39;&quot; rel=&quot;tag&quot;&gt;chemistry&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an elements atomic number as input, output its short electronic configuration.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Explanation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.chemguide.co.uk/atoms/properties/elstructs.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.chemguide.co.uk/atoms/properties/elstructs.html&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To come&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Sodium: 11&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[Ne] 3s1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Hydrogen: 1&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1s1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Helium: 2&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1s2 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[He]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Vanadium: 23&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[Ar] 4s2 3d3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Selenium: 34&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[Ar] 4s2 3d10 4p4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Winning&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Shortest code in bytes wins&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="30525" LastEditDate="2017-04-28T06:11:15.520" LastActivityDate="2017-04-28T06:11:15.520" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12236" PostTypeId="2" ParentId="12220" CreationDate="2017-04-27T18:19:31.943" Score="24" Body="&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a moderator on another site, I would really appreciate it if you could add something to your chatiquette about flagging. Since the TNB has its own set of rules and is very strict about remaining on topic, avoiding noise etc, when people in the room try to enforce this chatiquette, they end up using the only tool they have available: flags. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, flags are shown to all moderators from all sites across the network and, depending on the flag type, to all &gt;10k reputation users as well. This means that things that would be absolutely fine in any other room of the network end up getting flagged and then we get one or both of the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;irate mods/high rep users who don't understand why you'd be wasting their time with something that is clearly not flag-worthy.&lt;/li&gt;&#xA;&lt;li&gt;irate TNB users who just want to have their room nice and clean and follow the rules this community has defined and don't understand why these foreign types come in and complain about things they don't understand. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is absolutely not the fault of the folks in TNB who are just trying to do their best. It is a problem with the system. However, I would suggest that you add something about not flagging things that aren't actually &lt;em&gt;offensive&lt;/em&gt;. I remember coming into the TNB because someone had flagged a message which was simply:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;u wot m8&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Since flags are shown to all moderators, and most of us don't hang out in the TNB and have no way of knowing you all have your own set of rules, that flag looked like pure noise. I realize it wasn't, but I had no way of knowing that at the time. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, I would respectfully suggest you add an entry to this new ruleset which explains that flags should only be used when something is really urgent and/or offensive. To deal with the other annoyances you (very understandably) want to get rid of, may I suggest you elect enough room owners to ensure someone with the ability to kick misbehaving users from the room is always present?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With enough local room owners who know your culture and rules, you will have a much easier time enforcing the chatiquette and you won't have to keep explaining your culture to all these ignorant network mods drawn by the flags. Win-win :)&lt;/p&gt;&#xA;" OwnerUserId="17362" LastEditorDisplayName="user45941" LastEditDate="2017-04-28T17:30:37.090" LastActivityDate="2017-04-28T17:30:37.090" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="12239" PostTypeId="2" ParentId="2140" CreationDate="2017-04-28T15:54:05.867" Score="0" Body="&lt;h1&gt;Variably Incremented Chained Ranges  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task will be, given a well-formed input string &lt;code&gt;s&lt;/code&gt;, to parse it as a range, with special properties:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A traditional range is defined as &lt;code&gt;a..b = [a, a+1, .., b-1, b]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;An incremental range is an extension of the traditional range in the format &lt;code&gt;a.c.b&lt;/code&gt;.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The format above uses &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; in the traditional sense, but it will use &lt;code&gt;c&lt;/code&gt; as the step.&lt;/li&gt;&#xA;&lt;li&gt;That is to say &lt;code&gt;1.2.5 = [1,3,5]&lt;/code&gt; and &lt;code&gt;a.c.b = [a, a+c, .., b iff b-a is divisble by c]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;This means that &lt;code&gt;0.2.5 = [0, 2, 4]&lt;/code&gt; because &lt;code&gt;b-a % c != 0&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The ranges are chain-able, meaning that &lt;code&gt;a..b..c..d..e..f..g..h..i&lt;/code&gt; is valid.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Always should be handled left-to-right.&lt;/li&gt;&#xA;&lt;li&gt;The chain should always be continued from the end of the last range.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;0.2.5..3&lt;/code&gt; is not &lt;code&gt;[0,2,4,5,4,3]&lt;/code&gt; it is &lt;code&gt;[0,2,4,3]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The format of the range may be &lt;code&gt;a.c.b&lt;/code&gt; or &lt;code&gt;a..b&lt;/code&gt;, absence of &lt;code&gt;c&lt;/code&gt; means &lt;code&gt;c = 1&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;I &amp;amp; O Gaurantees&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;c &amp;lt;= difference(b, a)&lt;/code&gt;, you will never see something like &lt;code&gt;1.100.2&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; are positive integers or 0, this makes crap easier&lt;/li&gt;&#xA;&lt;li&gt;Notice, however, that neither &lt;code&gt;a &amp;gt; b&lt;/code&gt; nor &lt;code&gt;a &amp;lt; b&lt;/code&gt; are guaranteed, both are acceptable.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;a, b and c&lt;/code&gt; will always be integer values, floats aren't supported.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;, lowest byte count wins.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastActivityDate="2017-04-28T15:54:05.867" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12243" PostTypeId="1" CreationDate="2017-04-28T23:47:08.427" Score="3" ViewCount="121" Body="&lt;p&gt;I'm noticing that the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; tag is dominated by code-golfing questions (e.g. the hundreds (exaggeration) of &lt;code&gt;tips for golfing in {language X}&lt;/code&gt; questions), but our site isn't just about golfing (e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt;, etc.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it on topic for me to post a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; challenge about a topic other than golfing, for example &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;? The tips tag should really encompass all categories of programming challenges, not just golfing, in my opinion.&lt;/p&gt;&#xA;" OwnerUserId="49561" LastEditorDisplayName="user62131" LastEditDate="2017-04-29T02:00:02.933" LastActivityDate="2017-04-29T02:01:11.677" Title="Is a &quot;tips for fastest code&quot; question on-topic?" Tags="|discussion|scope|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12244" PostTypeId="2" ParentId="12243" CreationDate="2017-04-29T02:01:11.677" Score="6" Body="&lt;p&gt;It's not closeable as off topic. Nothing inherently requires &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions to be related to code golf; other victory conditions are a fairly common thing to use tips questions for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It may, however, be closeable as too broad. Given how much information already exists on code optimization, I'd imagine it would have to be asking a fairly specific question in order to be a good fit for the site.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-04-29T02:01:11.677" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12245" PostTypeId="1" CreationDate="2017-04-29T13:50:35.640" Score="2" ViewCount="69" Body="&lt;p&gt;As you may or may not have noticed, we are doing a series of &lt;a href=&quot;https://hackmd.io/KwRgnARiAcCGAsBaaEBMAGR8DG8Cmis0AZsVhPLOtsWAOzQAmIQA?view&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brain-Flak Birthday challenges&lt;/a&gt; to celebrate Brain-Flak's first birthday.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some questions in this series are only tangentially related to brain-flak by the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/balanced-string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;balanced-string&amp;#39;&quot; rel=&quot;tag&quot;&gt;balanced-string&lt;/a&gt; aspect (and that's fine they're still interesting challenges). There has been a difference in opinion on whether these challenges should be marked with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brain-flak&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brain-flak&amp;#39;&quot; rel=&quot;tag&quot;&gt;brain-flak&lt;/a&gt; among us flakkers, so I thought I would ask the meta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it useful to mark all BFBCs with the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brain-flak&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brain-flak&amp;#39;&quot; rel=&quot;tag&quot;&gt;brain-flak&lt;/a&gt; tag? Should we do so?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="31716" LastEditDate="2017-04-30T16:44:57.403" LastActivityDate="2017-04-30T16:46:05.187" Title="Should Brain-Flak Birthday challenges be tagged Brain-Flak?" Tags="|discussion|tags|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12246" PostTypeId="2" ParentId="2140" CreationDate="2017-04-29T15:00:32.900" Score="0" Body="&lt;h1&gt;Give counterexamples to thesis that prime numbers are finite.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It is known since antiquity that there are infinite prime numbers, first proved by Euclid. An unorthodox yet brief formulation of this proof was &lt;a href=&quot;https://mathoverflow.net/a/268344&quot;&gt;recently posted&lt;/a&gt; on MathExchange:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;There are infinitely many primes, if not, multiply all and add 1.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a prime number &lt;code&gt;N&lt;/code&gt;, output a prime number created by multiplying  it with all lower primes and adding one, i. e. &lt;code&gt;(2*3*5*...*N) + 1&lt;/code&gt;. In other words, if someone claimed that &lt;code&gt;N&lt;/code&gt; is the largest finite number, you have to give a counterexample Euclid would likely compute to prove them false.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You don't have to consider input number that is not a prime.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your representation of a number must have a range of 32-bit signed integers or larger.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can use floating point representation as long as your code uses &lt;code&gt;int&lt;/code&gt;-specific operations (e.g. no &lt;code&gt;double&lt;/code&gt;-specific bit-fu).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Shortest code wins, standard loopholes forbidden. You may use a lookup table of primes.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2 → 3          // because             2 + 1 = 3&#xA;3 → 7          // because           3*2 + 1 = 7&#xA;5 → 31         // because         5*3*2 + 1 = 31&#xA;13 → 30031     // because 13*11*7*5*3*2 + 1 = 30031&#xA;31 → 223092871 // (largest possible output within `int32` range)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Note&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is very similar to, yet not identical with &lt;a href=&quot;https://oeis.org/A006862&quot; rel=&quot;nofollow noreferrer&quot;&gt;A006862&lt;/a&gt;: your solution must output a number belonging to that sequence. The difference is that your solution must work for inputs that are primes, while A006862 recognizes any natural number (including 0).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your solution is function &lt;code&gt;f()&lt;/code&gt;, the following equivalence must be true:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A006862(n) = M &amp;lt;=&amp;gt; f(A000040(n)) = M&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://oeis.org/A000040&quot; rel=&quot;nofollow noreferrer&quot;&gt;A000040&lt;/a&gt; is the sequence of primes, therefore &lt;code&gt;A000040(n)&lt;/code&gt; can be read as &quot;n-th prime number&quot;.&lt;/p&gt;&#xA;" OwnerUserId="68660" LastEditorUserId="68660" LastEditDate="2017-04-29T22:48:29.180" LastActivityDate="2017-04-29T22:48:29.180" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12248" PostTypeId="2" ParentId="12245" CreationDate="2017-04-29T17:08:22.347" Score="3" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;Let's take a look at the tag wiki.&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;This challenge is &lt;b&gt;related to the Brain-flak esoteric language&lt;/b&gt; and &#xA;languages based on Brain-Flak. &#xA;Note that challenges that require the answers to be in a specific language are generally discouraged&#xA;&lt;/pre&gt;&#xA;&lt;p&gt;I feel in some sense you may have answered your own question. These challenges are related to Brain-Flak. While it may be somewhat tangential of a relationship it still is beneficial. Tags serve to categorize questions and help users locate questions they find interesting. It is likely that Brain-Flak aficionados (who watch this tag) may find these questions interesting, therefore I do believe it is useful to have them categorized (and if they don't find it interesting they can always continue to scroll past it).&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-04-30T16:46:05.187" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12250" PostTypeId="1" AcceptedAnswerId="12251" CreationDate="2017-04-29T20:08:30.443" Score="4" ViewCount="188" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;-tagged questions should be sorted newest to oldest by default. It is disorienting to see them out of order because they are sorted highest to lowest votes. Agreed?&lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastEditorUserId="68942" LastEditDate="2021-06-09T05:39:52.027" LastActivityDate="2021-06-09T05:39:52.027" Title="Sort answer chaining questions by newest by default" Tags="|discussion|feature-request|status-deferred|answer-chaining|" AnswerCount="1" CommentCount="7" ClosedDate="2021-06-02T17:50:04.207" ContentLicense="CC BY-SA 3.0" />
  <row Id="12251" PostTypeId="2" ParentId="12250" CreationDate="2017-04-29T21:46:21.837" Score="7" Body="&lt;p&gt;This is not possible I'm afraid, unless SE decides to add that feature network-wide. PPCG is a small community compared to SO, SU and the like, so I think we'll have a hard time convincing the developers (and everyone else) that this is something they should spend their time on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Until then:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The only foolproof way to sort a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; challenge is by &lt;em&gt;Oldest&lt;/em&gt;, and scroll to the bottom of the last page. It's not that much work.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please do not sort by &quot;Activity&quot;, that might result in you missing the latest post, creating a lot of work for you and potentially others that base their work on your answer.&lt;/p&gt;&#xA;" OwnerUserId="31516" LastActivityDate="2017-04-29T21:46:21.837" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12252" PostTypeId="2" ParentId="2140" CreationDate="2017-04-30T02:33:26.990" Score="0" Body="&lt;h1&gt;Rewrite a number in the Munafo System &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/numbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;numbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;numbers&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://mrob.com/pub/math/altnum.html#lexi_munafo&quot; rel=&quot;nofollow noreferrer&quot;&gt;Munafo Alphabetic PT System&lt;/a&gt; (created by Robert Munafo) is a system of concisely writing very large numbers such that ordered values become lexicographically ordered when written. A full description (and some examples) of the system can be found in the link, but here's a series of steps to compute the string &lt;em&gt;M&lt;/em&gt;(&lt;em&gt;N&lt;/em&gt;) from a positive real number &lt;em&gt;N&lt;/em&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;em&gt;N&lt;/em&gt; &amp;lt; 10, then &lt;em&gt;M&lt;/em&gt;(&lt;em&gt;N&lt;/em&gt;) is simply the single digit of &lt;em&gt;N&lt;/em&gt;, possibly followed by an factional part; that is, &lt;code&gt;_&lt;/code&gt; followed by any digits after the decimal place of &lt;em&gt;N&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If 10 &amp;leq; &lt;em&gt;N&lt;/em&gt; &amp;lt; 100, then &lt;em&gt;M&lt;/em&gt;(&lt;em&gt;N&lt;/em&gt;) is the letter &lt;code&gt;a&lt;/code&gt; followed by the two digits of &lt;em&gt;N&lt;/em&gt;, possibly followed by an factional part.&lt;/li&gt;&#xA;&lt;li&gt;If 100 &amp;leq; &lt;em&gt;N&lt;/em&gt; &amp;lt; 1000, then &lt;em&gt;M&lt;/em&gt;(&lt;em&gt;N&lt;/em&gt;) is the letter &lt;code&gt;b&lt;/code&gt; followed by the three digits of &lt;em&gt;N&lt;/em&gt;, possibly followed by an factional part.&lt;/li&gt;&#xA;&lt;li&gt;If 1000 &amp;leq; &lt;em&gt;N&lt;/em&gt; &amp;lt; 10&amp;thinsp;000, then &lt;em&gt;M&lt;/em&gt;(&lt;em&gt;N&lt;/em&gt;) is the letter &lt;code&gt;c&lt;/code&gt; followed by the four digits of &lt;em&gt;N&lt;/em&gt;, possibly followed by an factional part.&lt;/li&gt;&#xA;&lt;li&gt;If 10&amp;thinsp;000 &amp;leq; &lt;em&gt;N&lt;/em&gt; &amp;lt; 100&amp;thinsp;000, then &lt;em&gt;M&lt;/em&gt;(&lt;em&gt;N&lt;/em&gt;) is the letter &lt;code&gt;d&lt;/code&gt; followed by the five digits of &lt;em&gt;N&lt;/em&gt;, possibly followed by an factional part.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If 100&amp;thinsp;000 &amp;leq; &lt;em&gt;N&lt;/em&gt; &amp;lt; 10&lt;sup&gt;300&lt;/sup&gt;, then &lt;em&gt;M&lt;/em&gt;(&lt;em&gt;N&lt;/em&gt;) is:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;the letter &lt;code&gt;e&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;exactly three digits, representing the exponent of &lt;em&gt;N&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;an underscore &lt;code&gt;_&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;any number of digits, representing the significand of &lt;em&gt;N&lt;/em&gt; in standardized form.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;br/&gt;More specifically, a string &lt;em&gt;M&lt;/em&gt;(&lt;em&gt;N&lt;/em&gt;) = &lt;code&gt;e&lt;em&gt;x&lt;/em&gt;&lt;sub&gt;1&lt;/sub&gt;&lt;em&gt;x&lt;/em&gt;&lt;sub&gt;2&lt;/sub&gt;&lt;em&gt;x&lt;/em&gt;&lt;sub&gt;3&lt;/sub&gt;_&lt;em&gt;y&lt;/em&gt;&lt;sub&gt;1&lt;/sub&gt;&lt;em&gt;y&lt;/em&gt;&lt;sub&gt;2&lt;/sub&gt;&lt;em&gt;y&lt;/em&gt;&lt;sub&gt;3&lt;/sub&gt;...&lt;/code&gt; represents the value &lt;em&gt;N&lt;/em&gt; = &lt;em&gt;y&lt;/em&gt;&lt;sub&gt;1&lt;/sub&gt;.&lt;em&gt;y&lt;/em&gt;&lt;sub&gt;2&lt;/sub&gt;&lt;em&gt;y&lt;/em&gt;&lt;sub&gt;3&lt;/sub&gt;... &amp;times; 10&lt;sup&gt;&lt;em&gt;x&lt;/em&gt;&lt;sub&gt;1&lt;/sub&gt;&lt;em&gt;x&lt;/em&gt;&lt;sub&gt;2&lt;/sub&gt;&lt;em&gt;x&lt;/em&gt;&lt;sub&gt;3&lt;/sub&gt;&lt;/sup&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Finally, if 10&lt;sup&gt;300&lt;/sup&gt; &amp;leq; &lt;em&gt;N&lt;/em&gt;, then to determine &lt;em&gt;M&lt;/em&gt;(&lt;em&gt;N&lt;/em&gt;), we must first apply the following recursive process:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Set &lt;em&gt;T&lt;/em&gt; = 0 and &lt;em&gt;R&lt;/em&gt; = &lt;em&gt;N&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;em&gt;R&lt;/em&gt; &amp;lt; 10&lt;sup&gt;300&lt;/sup&gt;, then break out of this process.&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, set &lt;em&gt;T&lt;/em&gt; = &lt;em&gt;T&lt;/em&gt; + 1, set &lt;em&gt;R&lt;/em&gt; = log&lt;sub&gt;10&lt;/sub&gt;(&lt;em&gt;R&lt;/em&gt;), and return to step 2.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;br/&gt;(Effectively, this sets &lt;em&gt;N&lt;/em&gt; equal to 10&lt;sup&gt;10&lt;sup&gt;&amp;mldr;&lt;sup&gt;&lt;em&gt;R&lt;/em&gt;&lt;/sup&gt;&lt;/sup&gt;&lt;/sup&gt; with &lt;em&gt;T&lt;/em&gt; nested exponents.) Now, with our values of &lt;em&gt;T&lt;/em&gt; and &lt;em&gt;R&lt;/em&gt;, the value of &lt;em&gt;M&lt;/em&gt;(&lt;em&gt;N&lt;/em&gt;) is written as follows:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;the letter &lt;code&gt;e&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;the substring &lt;em&gt;M&lt;/em&gt;(&lt;em&gt;T&lt;/em&gt;)&lt;/li&gt;&#xA;&lt;li&gt;an underscore &lt;code&gt;_&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;the substring &lt;em&gt;M&lt;/em&gt;(&lt;em&gt;R&lt;/em&gt;).&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;...and that's the entire system. I apologize if anything I said was unclear or vague; in that case, you should definitely check the link for more detail.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;META&lt;/em&gt;: Is there anything here that can be clarified?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Operation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As input, your program or function is to take three nonnegative numbers &lt;em&gt;X&lt;/em&gt;, &lt;em&gt;Y&lt;/em&gt;, and &lt;em&gt;Z&lt;/em&gt;. &lt;em&gt;X&lt;/em&gt; and &lt;em&gt;Z&lt;/em&gt; are guaranteed to fit in your language's default integer type, and &lt;em&gt;Y&lt;/em&gt; can fit in the default floating point type. These three values represent the number &lt;em&gt;N&lt;/em&gt; = 10&lt;sup&gt;&amp;mldr;&lt;sup&gt;&lt;em&gt;Y&lt;/em&gt; &amp;times; 10&lt;sup&gt;Z&lt;/sup&gt;&lt;/sup&gt;&lt;/sup&gt;, with &lt;em&gt;X&lt;/em&gt; initial exponents as before. From here, the challenge is simple: &lt;strong&gt;given &lt;em&gt;X&lt;/em&gt;, &lt;em&gt;Y&lt;/em&gt;, and &lt;em&gt;Z&lt;/em&gt; describing a value &lt;em&gt;N&lt;/em&gt;, output the Munafo string &lt;em&gt;M&lt;/em&gt;(&lt;em&gt;N&lt;/em&gt;).&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;META&lt;/em&gt;: Still figuring these out. Will probably end up using at least a couple from the link. Suggestions are welcome.&lt;/p&gt;&#xA;" OwnerUserId="33208" LastEditorUserId="33208" LastEditDate="2017-04-30T12:26:43.540" LastActivityDate="2017-04-30T12:26:43.540" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12258" PostTypeId="1" CreationDate="2017-05-01T14:51:27.040" Score="-1" ViewCount="148" Body="&lt;p&gt;I am working on a golfing language, and I think I have figured out a way past the &quot;a program may not read it's own source code as input&quot; rule.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The idea is simple: every time a command is executed, the characters that make up the command are added to a string, which here I will call the &quot;string constructor.&quot; The string constructor does not read the program, the program's functions add themselves to the string constructor. Then the command itself is executed. There are commands that push the string from the string constructor onto the stack, clear the string constructor, and so on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is useful for constructing strings of course. The &quot;Hello, World!&quot; program could be &lt;code&gt;&quot;Hello, World!&lt;/code&gt; or &lt;code&gt;Hello, World!&amp;lt;command that pushes string constructor and clears the stack&amp;gt;&lt;/code&gt;. But this is obviously useful for quines too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is nothing saying that this is against the rules that I have found. It is not reading its own source code, and it is payload-capable. But despite that it breaks no rules, it still can do pretty much the same thing as &lt;code&gt;Q&lt;/code&gt; in HQ9+.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this idea against the rules?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;sub&gt;I have not implemented this yet.&lt;/sub&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="64159" LastActivityDate="2017-05-01T15:12:29.417" Title="Possible Quine Loophole" Tags="|discussion|rules|quine|" AnswerCount="1" CommentCount="4" ClosedDate="2017-05-01T15:13:30.847" ContentLicense="CC BY-SA 3.0" />
  <row Id="12259" PostTypeId="2" ParentId="12258" CreationDate="2017-05-01T15:12:29.417" Score="0" Body="&lt;h1&gt;Yes, it is cheating.&lt;/h1&gt;&#xA;&lt;p&gt;According to Mego, it is cheating because it uses a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default/1658#1658&quot;&gt;different name for something that is prohibited&lt;/a&gt;. I agree with this.&lt;/p&gt;&#xA;&lt;p&gt;According to Riley, it is impossible to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4878/64159&quot;&gt;identify a section of the program which encodes another&lt;/a&gt; (because each section encodes itself) and therefore it is cheating. I agree with this.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Therefore, it is definitely cheating.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="64159" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-01T15:12:29.417" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12263" PostTypeId="2" ParentId="2140" CreationDate="2017-05-02T13:35:39.037" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Formula 1 2016 standings&lt;/h1&gt;&#xA;&lt;p&gt;The Formula 1 2017 season is well underway, but I thought that the final standings could be good idea for a challenge.&lt;/p&gt;&#xA;&lt;p&gt;The task is to print the standings at the end of 2016 season. This is how the table looks like:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1  N Rosberg    385&#xA;2  L Hamilton   380&#xA;3  D Ricciardo  256&#xA;4  S Vettel     212&#xA;5  M Verstappen 204&#xA;6  K Raikkonen  186&#xA;7  S Perez      101&#xA;8  V Bottas     85&#xA;9  N Hulkenberg 72&#xA;10 F Alonso     54&#xA;11 F Massa      53&#xA;12 C Sainz      46&#xA;13 R Grosjean   29&#xA;14 D Kvyat      25&#xA;15 J Button     21&#xA;16 K Magnussen  7&#xA;17 F Nasr       2&#xA;18 J Palmer     1&#xA;19 P Wehrlein   1&#xA;20 S Vandoorne  1&#xA;21 E Gutierrez  0&#xA;22 M Ericsson   0&#xA;23 E Ocon       0&#xA;24 R Haryanto   0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The table is divided into 3 columns: position at the end of season, driver name and points. In each of the columns, the contents can be aligned to left or to right for each column independently. If all columns are aligned to right, the output will look like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 1    N Rosberg 385&#xA; 2   L Hamilton 380&#xA; 3  D Ricciardo 256&#xA; 4     S Vettel 212&#xA; 5 M Verstappen 204&#xA; 6  K Raikkonen 186&#xA; 7      S Perez 101&#xA; 8     V Bottas  85&#xA; 9 N Hulkenberg  72&#xA;10     F Alonso  54&#xA;11      F Massa  53&#xA;12      C Sainz  46&#xA;13   R Grosjean  29&#xA;14      D Kvyat  25&#xA;15     J Button  21&#xA;16  K Magnussen   7&#xA;17       F Nasr   2&#xA;18     J Palmer   1&#xA;19   P Wehrlein   1&#xA;20  S Vandoorne   1&#xA;21  E Gutierrez   0&#xA;22   M Ericsson   0&#xA;23       E Ocon   0&#xA;24   R Haryanto   0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The columns should be separated exactly by 1 space. Trailing spaces are allowed as well as 1 trailing newline.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; competition - shortest answer wins.&lt;/p&gt;&#xA;" OwnerUserId="60517" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-02T13:35:39.037" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12264" PostTypeId="2" ParentId="2140" CreationDate="2017-05-02T16:56:41.663" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;How many times will you have to golf a quine?&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For this challenge, you must create a programme which takes an integer &lt;code&gt;x&lt;/code&gt; and outputs its source &lt;code&gt;x&lt;/code&gt; many times.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;This is codegolf, the programme containing the least amount of bytes&#xA;wins.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you submit a function, the function must take &lt;code&gt;x&lt;/code&gt; as  a parameter and either return or print the body of the function &lt;code&gt;x&lt;/code&gt; many times to STDOUT&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you submit a lambda, it is not required for you to assign it to a variable&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Standard loophole restrictions apply.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Empty programmes are forbidden&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="53400" LastEditorUserId="53400" LastEditDate="2017-05-03T16:02:06.560" LastActivityDate="2017-05-03T16:02:06.560" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12265" PostTypeId="2" ParentId="2140" CreationDate="2017-05-03T09:55:35.717" Score="1" Body="&lt;h1&gt;Smooth an array&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A typical signal processing operation consists in smoothing a signal to reduce noise.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A very basic way to perform such smoothing, on an array of integers, is using the following formula:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/zuZ6s.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/zuZ6s.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;y'_t&lt;/code&gt; is the smoothed value at index &lt;code&gt;t&lt;/code&gt;, &lt;code&gt;y_t&lt;/code&gt; is the original value at index &lt;code&gt;t&lt;/code&gt;, and where &lt;code&gt;β&lt;/code&gt; is a smoothing parameter (in &lt;code&gt;[0,1]&lt;/code&gt;). Note that &lt;code&gt;y' = floor(y + 0.5)&lt;/code&gt; is the classic round half up operation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For &lt;code&gt;t = 0&lt;/code&gt;, there is no &lt;code&gt;y'_(t-1)&lt;/code&gt;, thus we set that &lt;code&gt;y'_0 = y_0&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Applying that operation on a sequence of integers pictured below on the left, produces the sequence of integers pictured below on the right:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/epVZa.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/epVZa.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given a list of integers and &lt;code&gt;β&lt;/code&gt;, output that list of integers smoothed in that way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All integers of the list will be guaranteed to be in the interval &lt;code&gt;[1, sup)&lt;/code&gt; where &lt;code&gt;sup&lt;/code&gt; is the maximum integer representable in the integer type you use in your language. All integers of the input must be taken, and all integers of the output must be printed, in the decimal base (unless your language does not support decimal numbers, in which case you may use the standard base your language uses).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input list is guaranteed to have at least 2 elements. You may take that input list in any way or format that is sensible in your language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;β&lt;/code&gt; is guaranteed to be in &lt;code&gt;[0,1]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;TODO add more&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;List                               β     Output&#xA;[1,2,7,3,11,13,26,5,18,4,3,2,1]    0.5   [1,2,5,4,8,11,19,12,15,10,7,5,3]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="41723" LastActivityDate="2017-05-03T09:55:35.717" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12266" PostTypeId="5" CreationDate="2017-05-03T14:20:07.493" Score="0" Body="&lt;p&gt;If a challenge doesn't specify a rule for a particular aspect (such as input and output format, or what counts as &quot;an integer&quot;, then the community will assume default rules for that aspect.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This tag applies to posts that describe (and vote on) what rules should be assumed by default.&lt;/p&gt;&#xA;" OwnerUserId="39490" LastEditorUserId="39490" LastEditDate="2017-05-03T15:20:09.793" LastActivityDate="2017-05-03T15:20:09.793" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12267" PostTypeId="4" CreationDate="2017-05-03T14:20:07.493" Score="0" Body="For clarification of rules that apply to challenges if not mentioned by the author" OwnerUserId="39490" LastEditorUserId="39490" LastEditDate="2017-05-03T15:19:55.457" LastActivityDate="2017-05-03T15:19:55.457" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12268" PostTypeId="1" CreationDate="2017-05-03T15:25:30.040" Score="11" ViewCount="318" Body="&lt;p&gt;There doesn't seem to be a standard meta post for assuming architecture or hardware, recently while writing an answer for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/118636/tell-me-my-console-dimensions&quot;&gt;This Challenge&lt;/a&gt; I ran into an issue with the &lt;code&gt;mode&lt;/code&gt; windows utility.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By default &lt;code&gt;mode&lt;/code&gt; will output information on any COM ports on the system as well as the current CLI, in the above situation only the information for the cli was required, and it was a penalty of 4 bytes (using &lt;code&gt;mode con&lt;/code&gt; instead of &lt;code&gt;mode&lt;/code&gt;) to ensure consistent output on systems which have multiple com ports.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;in this situation is it correct to assume that since a &quot;plain&quot; system or VM with only basic hardware and software can run this correctly, that omitting the four bytes is correct? is there a cutoff point for things we're able to assume about the environment?&lt;/p&gt;&#xA;" OwnerUserId="59735" LastActivityDate="2022-12-25T12:31:51.470" Title="Making assumptions about hardware" Tags="|discussion|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12271" PostTypeId="2" ParentId="1061" CreationDate="2017-05-03T16:39:41.707" Score="19" Body="&lt;h1&gt;Storing information in platform specifications&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We often allow people to require certain qualities of the machine their answer is run on, (for example Operating System).  However we should disallow requiring the program to be run on a certain specification to store information used for the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example the language &lt;a href=&quot;https://esolangs.org/wiki/Nullary&quot; rel=&quot;nofollow noreferrer&quot;&gt;Nullary&lt;/a&gt; only has zero length programs instead deriving its source from the time since epoch.  Similar languages could be created to exploit things such as monitor/terminal size, screen brightness, volume or even Operating System.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These types of answers should be disallowed.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-05-03T16:39:41.707" CommentCount="6" CommunityOwnedDate="2017-05-03T16:39:41.707" ContentLicense="CC BY-SA 3.0" />
  <row Id="12273" PostTypeId="2" ParentId="12268" CreationDate="2017-05-03T17:16:55.323" Score="13" Body="&lt;h2&gt;Any hardware setup may be assumed or required, within reason&lt;/h2&gt;&#xA;&lt;p&gt;Assuming that the computer has a graphics card is reasonable. Assuming that it has 2 SLI'd GTX Titans is not&lt;sup&gt;[1]&lt;/sup&gt;. Requiring that only one COM port is connected is reasonable. Requiring that the computer has 1 PB of RAM is not.&lt;/p&gt;&#xA;&lt;p&gt;There isn't a hard-and-fast rule for what constitutes &amp;quot;reasonable&amp;quot; on purpose - what may be infeasible or prohibitively expensive now could very easily be standard in 10 years.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, taking advantage of this rule with a language that acts differently for the same code depending on the hardware configuration (e.g. outputting &lt;code&gt;Hello, World!&lt;/code&gt; if the CPU has 2 or fewer cores, and performing a primality test if the CPU has more than 2 cores) should be considered loophole abuse.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;[1]: also your computer would catch on fire&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-03T17:16:55.323" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="12276" PostTypeId="2" ParentId="12268" CreationDate="2017-05-03T21:31:33.423" Score="4" Body="&lt;h3&gt;The hardware requirements must be broad enough that each requirement separately is fulfilled by a large number of computers&lt;/h3&gt;&#xA;&lt;p&gt;Examples of reasonable hardware requirements:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;1 TB available hard disk space&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;internet connection&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;printer attached&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;touch screen&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;RAID&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Examples of unreasonable hardware requirements:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;exact model of a computer&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;specific multi-hard drive setup&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;5.25&amp;quot; floppy disk drive&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;exact amount of available space&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-06T21:47:28.343" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12278" PostTypeId="2" ParentId="2140" CreationDate="2017-05-04T11:56:01.987" Score="1" Body="&lt;h1&gt;Output the Name of a Number&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Idea from &lt;a href=&quot;https://math.stackexchange.com/questions/2261319/what-are-the-names-of-numbers-in-the-binary-system&quot;&gt;a recent question on math SE&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Write a program or a function that takes an integer from range 0 to 255 (inclusive) and outputs the name of its unsigned 8-bit binary representation. Input can be in any integer format you like, but the outputted name must match the number's unsigned 8-bit representation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The name of the number is determined by the positions of its binary digits that are 1:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 − John&#xA;10 − Watson&#xA;11 − Watson John&#xA;100 − Kevin&#xA;101 − Kevin John&#xA;110 − Kevin Watson&#xA;111 − Kevin Watson John&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Let the names for the eight bits be &lt;code&gt;Laura&lt;/code&gt;, &lt;code&gt;William&lt;/code&gt;, &lt;code&gt;James&lt;/code&gt;, &lt;code&gt;Mary&lt;/code&gt;, &lt;code&gt;Alice&lt;/code&gt;, &lt;code&gt;Kevin&lt;/code&gt;, &lt;code&gt;Watson&lt;/code&gt;, and &lt;code&gt;John&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So now the name of 255 (11111111 in binary) is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Laura William James Mary Alice Kevin Watson John&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Zero doesn't have a name under this system so you may output an empty string or nothing at all. Trailing whitespace is allowed for all outputs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test cases:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;input (as decimal)&amp;gt;&#xA;&amp;lt;8-bit binary&amp;gt;&#xA;&amp;lt;output&amp;gt;&#xA;&#xA;10&#xA;00001010&#xA;Alice Watson&#xA;&#xA;42&#xA;00101010&#xA;James Alice Watson&#xA;&#xA;128&#xA;10000000&#xA;Laura&#xA;&#xA;189&#xA;10111101&#xA;Laura James Mary Alice Kevin John&#xA;&#xA;55&#xA;00110111&#xA;James Mary Kevin Watson John&#xA;&#xA;96&#xA;01100000&#xA;William James&#xA;&#xA;37&#xA;00100101&#xA;James Kevin John&#xA;&#xA;0&#xA;00000000&#xA;&#xA;&#xA;255&#xA;11111111&#xA;Laura William James Mary Alice Kevin Watson John&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, show the shortest answer in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary&amp;#39;&quot; rel=&quot;tag&quot;&gt;binary&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="61405" LastActivityDate="2017-05-04T11:56:01.987" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12279" PostTypeId="2" ParentId="6918" CreationDate="2017-05-04T14:45:22.753" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/Phlarx/chip&quot; rel=&quot;nofollow noreferrer&quot;&gt;Chip&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Chip is an esoteric language designed by me, Phlarx. It is my first language, and I started designing this in December 2016. It can be found on &lt;a href=&quot;https://tio.run/nexus/chip&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try It Online&lt;/a&gt;, too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This language is inspired by integrated circuits and digital logic, and as such, it is a 2.5D language that somewhat resembles circuitry. (I say 2.5D because Chip circuits can be layered atop one another, so it resides somewhere between 2D and 3D).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since Chip deals with digital logic, it looks at individual bits for each operation, however, it is capable of reading eight bits of input (usually called a byte or octet) and writing eight bits of output on each cycle.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Chip currently has a single stack or a single queue, and has limited ability to jump back to earlier input. There are plans to further enhance its abilities in these areas, such as a second queue/stack, or addressable memory instead.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This language is still a work in progress. You can check out the rough todo list, as well as some more examples at the &lt;a href=&quot;https://github.com/Phlarx/chip&quot; rel=&quot;nofollow noreferrer&quot;&gt;github page&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example 1&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Take the value of the three high bits of input, and output them as an ASCII numeral.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Fa Gb Hc e*f&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input &lt;code&gt;Chip™&lt;/code&gt; becomes &lt;code&gt;2333745&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example 2&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Print 1 if consecutive bytes are equal, 0 otherwise.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;AZ BZ CZ DZ EZ FZ GZ HZ   e*Z~S&#xA;`}.`}.`}.`}.`}.`}.`}.`}.   f&#xA;  `--^--^--^--^--^--^--^~a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input &lt;code&gt;Hello PPCG&lt;/code&gt; produces &lt;code&gt;001000100&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="56819" LastEditorUserId="56819" LastEditDate="2018-01-26T16:08:36.733" LastActivityDate="2018-01-26T16:08:36.733" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12280" PostTypeId="2" ParentId="2140" CreationDate="2017-05-04T16:05:50.887" Score="2" Body="&lt;h1&gt;Tetris Programming&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tetris&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tetris&amp;#39;&quot; rel=&quot;tag&quot;&gt;tetris&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program or function should take as input one character from the set &lt;code&gt;IJLOSTZ&lt;/code&gt;, which represents one of the seven tetrominos as usual:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;I  J   L   O   S    T    Z&#xA;&#xA;#   #  #   ##   ##  ###  ##&#xA;#   #  #   ##  ##    #    ## &#xA;#  ##  ##&#xA;#&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You should output the number of shapes which are equivalent to this tetromino up to rotation. For example, the &lt;code&gt;I&lt;/code&gt; only has two arrangements, horizontal and vertical, whereas the &lt;code&gt;J&lt;/code&gt; has four different orientations. The &lt;code&gt;O&lt;/code&gt; looks the same no matter how you rotate it, so there's only one shape. Here all possible input/output pairs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;I  2&#xA;J  4&#xA;L  4&#xA;O  1&#xA;S  2&#xA;T  4&#xA;Z  2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;The Source Code&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The main part of this challenge is the source code restriction:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may choose either linefeeds (LF, 0x0A), carriage returns (CR, 0x0D) or LR-CR pairs to represent newlines in your code (consistently). These split the source code into a 2D grid of lines (which aren't necessarily the same length).&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This 2D grid must be completely made up of tetrominos where all 4 characters in each tetromino must be the same. For example, this would be a valid program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;aaa&#xA;bba&#xA;cbddd&#xA;cbd&#xA;c&#xA;c&#xA;&#xA;eeee&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that the individual characters don't necessarily need to be distinct, so there may be larger connected regions of the same character, as long as this region can be segmented into non-overlapping tetrominos. Also note that this restriction also applies to spaces, so the following is not a valid program, because the two spaces don't form a tetromino.:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  x&#xA;xxx&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;The Score&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For each of the seven tetrominos count how often it appears in your source code. Your score is the maximum of these seven values.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That means you don't want to make up your code entirely of &lt;code&gt;I&lt;/code&gt;s but instead try to use about the same number of each of them to keep the maximum of the seven values down.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Small Print&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You may either write &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2419&quot;&gt;a programs or a functions&lt;/a&gt; and use any of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447&quot;&gt;standard methods&lt;/a&gt; of receiving input and providing output, as usual. Note that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/&quot;&gt;these loopholes&lt;/a&gt; are forbidden by default.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2017-05-04T16:05:50.887" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12282" PostTypeId="2" ParentId="9263" CreationDate="2017-05-05T00:17:37.210" Score="18" Body="&lt;h1&gt;The language's default format for numeric output is always acceptable if it's consistent and unambiguous&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We accept function submissions that return numbers directly. As such, passing those to the language's &quot;print a number&quot; command (if it has one) should also be accepted; jumping through hoops to format output appropriately in a full program but not a function would just be inconsistent and penalise languages where a function has a lot of boilerplate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By &quot;unambiguous&quot;, I mean that it should always be possible to determine which number was output via looking only at the output; a hypothetical language which prints all numbers using the same string would need some other method of outputting a number. By &quot;consistent&quot;, I mean that each number should always be output the same way; this is to prevent cheating via outputting an unevaluated expression or the like.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These rules make sense for all sorts of numbers (integers, rationals, floats, complex numbers, etc.). Note that this is not necessarily the &lt;em&gt;only&lt;/em&gt; acceptable format (see the other answers for ideas on what other formats might be acceptable), just a lower bound (i.e. this format &lt;em&gt;is&lt;/em&gt; acceptable, other formats might or might not be); some languages don't have numeric output commands at all, so another format would be necessary there.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an example, INTERCAL outputs integers using Roman numerals by default. That's an unambiguous and consistent format, if a rarely used one nowadays, and decimal conversion code would add a huge number of bytes to a program; using the default output format makes a lot of sense there.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-05-05T00:17:37.210" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12283" PostTypeId="1" AcceptedAnswerId="12285" CreationDate="2017-05-05T05:50:57.457" Score="-4" ViewCount="386" Body="&lt;p&gt;Perhaps, HTML, CSS and JavaScript have the most number of interpreters. Every browser is an interpreter of them. And each interpreter varies significantly in terms of implementation of certain aspects of these languages. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7832/whats-the-policy-on-interpreter-bugs/7833#7833&quot;&gt;And since languages are defined on the basis of their implementation, not specification or documentation&lt;/a&gt;, this raises an issue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, I think we should define some standard interpreter. If your solution in these languages works fine on it, then it's valid, otherwise not. One possible way to do this can be making Stack Snippets execute on the server rather that Client's browser (on PPCG at least). The Snippets can take in source code and get it executed remotely on the server. They can, then, send back the result as an Image Map and some cross-browser-compatible JavaScript code that handles the events like clicking, hovering etc. Doing so will cause consistent results with the interpreter present on the server, no matter which browser you are visiting the page from. But I do understand that redefining a full aspect of Stack Exchange network won't be too easy. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Alternatively, &lt;a href=&quot;https://tio.run/nexus&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO Nexus&lt;/a&gt; can have HTML and CSS options along with the other languages (JavaScript one is already there). But I also understand that writing a parser for two broad languages can be tricky.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another solution that can be is making a browser (like Chrome, Firefox) etc., which exactly follows the specifications of these language. The &lt;a href=&quot;https://en.wikipedia.org/wiki/Browser_Object_Model&quot; rel=&quot;nofollow noreferrer&quot;&gt;BOM&lt;/a&gt; methods and properties can be discussed in another Meta post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I admit that all the solutions above will be very hard to implement and most probably will never get implemented (I added them just for the sake of some probability that still turns in favor of them being implemented). So, on the very least, we can define a browser (such as Chrome v58.0.3029, Firefox v53.0a1 etc.) as the standard. In other words, we can examine the validity of a solution by only running it in a browser that we can agree upon in another Meta post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, what do you think about these suggestion? Should any one of these be implemented? If yes, then which? If not, then why not? Please post your ideas as answers. Consider adding a comment when you downvote.&lt;/p&gt;&#xA;" OwnerUserId="45105" LastEditorUserId="68942" LastEditDate="2021-06-09T05:39:34.920" LastActivityDate="2021-06-09T05:39:34.920" Title="A Standard HTML, CSS and JavaScript Parser/Interpreter" Tags="|discussion|feature-request|status-declined|stack-snippets|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12284" PostTypeId="2" ParentId="12283" CreationDate="2017-05-05T06:20:23.390" Score="3" Body="&lt;p&gt;I'm not in favor of this proposal, because it doesn't seem to add anything to me. The current solution is &quot;Specify which browser(s) your answer works in&quot;.  It's perfectly reasonable to say &quot;This is a Chrome Javascript answer&quot;, or even specify a version of Chrome if necessary. I've seen answers do this when, for instance, they wanted to use a specific feature only implemented by the spidermonkey javascript engine. I'm in favor of continuing that policy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All I see this proposal accomplishing is banning some otherwise valid and interesting answers and engendering pointless arguments. I don't see it adding anything.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2017-05-05T06:20:23.390" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12285" PostTypeId="2" ParentId="12283" CreationDate="2017-05-05T06:24:18.760" Score="10" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Perhaps, HTML, CSS and JavaScript have the most number of interpreters.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;No arguments there. The vast amounts of inconsistencies between different browsers, or even different versions of the same browser, can be anything from mindboggling to infuriating.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;And since languages are defined on the basis of their implementation, not specification or documentation, this raises an issue.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It does not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Languages being defined by their implementations means that there has to be &lt;em&gt;one&lt;/em&gt; interpreter that makes your code do what it's supposed to do. If a certain answer works only in a certain browser, it is the responsibility of the author to state so in their answer.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;So, I think we should define some standard interpreter.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;And how would you do that? Even if you pick a specific implementation, that implementation will suffer changes over time.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;One possible way to do this can be making Stack Snippets execute on the server rather that Client's browser (on PPCG at least).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I can't speak for StackExchange, but I'd be willing to bet that this is not going to happen.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Alternatively, TIO Nexus can have HTML and CSS options along with the other languages (JavaScript one is already there). But I also understand that writing a parser for two broad languages can be tricky.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Re: JavaScript&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TIO uses Node.js. Node.js will eventually get updated, so you have the same problem as you did before.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Re: HTML and CSS&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And how is TIO supposed to display the output in the browser? The normal way would be to use HTML and CSS, but that brings us back to square one. Aside from turning the output into an image (or a GIF if animation is involved), I'm not sure how this is supposed to accomplish anything...&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Another solution that can be is making a browser (like Chrome, Firefox) etc., which exactly follows the specifications of these language. The BOM methods and properties can be discussed in another Meta post.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Multi-billion dollar corporations and huge open source projects have a hard time writing a decent web browser. And even with our best intentions, being 100% standard-compliant seems practically impossible with the vast amount of features and edge cases such a browser would have to support.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;So, on the very least, we can define a browser (such as Chrome v58.0.3029, Firefox v53.0a1 etc.) as the standard.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;What if a user doesn't have access to that specific browser? What if/when the browser becomes obsolete and nobody would naturally have it installed anymore? What if a critical bug is discovered and no one in their right mind would keep using that browser?&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;TL;DR&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I disagree with your premise and don't consider the current situation problematic. And even if I did, there is no reasonable alternative to &lt;em&gt;every implementation is its own language&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-05-05T06:24:18.760" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12286" PostTypeId="1" CreationDate="2017-05-05T07:03:25.603" Score="-1" ViewCount="97" Body="&lt;p&gt;We have never had a criteron about time &lt;em&gt;making&lt;/em&gt; code. Do we need one? If we do, how do we calculate the time? If not, why not?&lt;/p&gt;&#xA;" OwnerUserId="64499" LastEditorUserId="68942" LastEditDate="2021-06-09T05:39:25.233" LastActivityDate="2021-06-09T05:39:25.233" Title="Winning criteria request: [time-attack]" Tags="|feature-request|status-declined|winning-criteria|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12287" PostTypeId="2" ParentId="12286" CreationDate="2017-05-05T07:05:43.660" Score="4" Body="&lt;h1&gt;Probably Not&lt;/h1&gt;&#xA;&lt;p&gt;This is rather difficult to accurately measure in our format, and makes the Sandbox practically unusable. Any simple challenge may be done in minutes, making the winners basically whoever sees it first.&lt;/p&gt;&#xA;" OwnerUserId="58375" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-05T07:05:43.660" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12288" PostTypeId="2" ParentId="2140" CreationDate="2017-05-05T11:38:26.610" Score="0" Body="&lt;h1&gt;Steal my credit card&lt;/h1&gt;&#xA;&lt;p&gt;recently a lovely man named Boris that I met online sent me a copy of an album that I didn't even know was released yet, the 16kb '.exe' ('EXtremely Excellent-music' apparently) file didn't open, but I did notice that it had managed to make some charges against my credit card, now I'm normally very secure in my banking, I don't write passwords down at all, and I keep my bank details in a '.txt' (Truly eXceedingly proTected) file, so I'm not sure how the hackers managed to get access, to confirm how secure I am:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I keep a .txt file named 'info.txt' in my documents folder&lt;/li&gt;&#xA;&lt;li&gt;There's lots of unimportant information in this&lt;/li&gt;&#xA;&lt;li&gt;I store the credit cards in a specific format&lt;/li&gt;&#xA;&lt;li&gt;All of my credit cards have the same number of digits in the number and cvv&lt;/li&gt;&#xA;&lt;li&gt;the 'Type' of card may be different, but it will always be in the format &lt;code&gt;Cardtype - MM/YY&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;I don't format anything else in a similar manner, you can assume that this  is the only two lines together.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Visa - 10/18&#xA;4024007172038209/571&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(not a real credit card, i'm not an idiot)&lt;/p&gt;&#xA;&lt;p&gt;which corresponds to:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Type - MM/YY (Expiry date)&#xA;CREDIT_CARD_NUM/CVV&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The format will always match:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[a-zA-Z]+ - \d{2}/\d{2}\r?\n\d{16}/\d{3}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;so it's very difficult to be read by any automatic parsing program.&lt;/p&gt;&#xA;&lt;p&gt;my insurance doesn't believe me, so I'm here to prove that it's basically impossible, and since we all know programmers are actually just hackers with day jobs, I figured you would all be able to help me.&lt;/p&gt;&#xA;&lt;p&gt;after adding all of the default Java libraries together and doing some math I believe there's almost no room left for any actual code in the exe file he sent me, so please try and keep the program as short as possible.&lt;/p&gt;&#xA;&lt;p&gt;The Challenge:&lt;/p&gt;&#xA;&lt;p&gt;write a program which takes no arguments, and when run will:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;read in a file named 'info.txt' from the same directory the program is run in.&lt;/li&gt;&#xA;&lt;li&gt;somewhere in the file, two lines will correspond to the above format&lt;/li&gt;&#xA;&lt;li&gt;return only those two lines&lt;/li&gt;&#xA;&lt;li&gt;any amount of leading or trailing white-space is allowed.&lt;/li&gt;&#xA;&lt;li&gt;you can assume one credit card per file&lt;/li&gt;&#xA;&lt;li&gt;you do not need to do any validity checks on the card number etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;attached is my original info.txt if you want to test against it, but it should work with any credit card number, that way it will be more believable.&lt;/p&gt;&#xA;&lt;p&gt;[gdrive link to info.txt]&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest code in each language wins.&lt;/p&gt;&#xA;&lt;p&gt;Any code, interpreted or compiled, on any system, in any language is valid.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/file&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;file&amp;#39;&quot; rel=&quot;tag&quot;&gt;file&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/text&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;text&amp;#39;&quot; rel=&quot;tag&quot;&gt;text&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="59735" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-05T15:14:58.240" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12292" PostTypeId="2" ParentId="2140" CreationDate="2017-05-05T16:23:40.050" Score="3" Body="&lt;h1&gt;Minimal QWERTY&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The task -- to output the layout of a QWERTY keyboard:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;QWERTYUIOP&#xA;ASDFGHJKL&#xA;ZXCVBNM&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;But, you will be scored based on the length of your code, and on the number of distinct characters in it.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;1) The code must output the three lines of text above (or the text above with optional trailing newline)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2) Standard loophole restrictions apply&lt;/p&gt;&#xA;&#xA;&lt;p&gt;3) If the language contains predefined information about the QWERTY layout, you are not allowed to use that information.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The score will be defined as [Length of the program in bytes]*[# of distinct characters in the program], with lowest score winning.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the code&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ABAB1212&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;would have score 8*4=32 since it has length 8, but only 4 distinct characters: AB12&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And the code:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ABC!!!{{{&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Would have score 9*5=45, since it has length 9, and 5 distinct characters: ABC!{&lt;/p&gt;&#xA;" OwnerUserId="68519" LastEditorUserId="68519" LastEditDate="2017-05-07T01:43:24.437" LastActivityDate="2017-05-07T01:43:24.437" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="12293" PostTypeId="2" ParentId="12286" CreationDate="2017-05-05T16:57:06.360" Score="3" Body="&lt;h1&gt;We already have this criterion…&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;…in a possibly disguised way. The problem with &quot;write this code as quickly as possible&quot; is that you can't verify that people didn't start writing in advance, except by starting everyone at the same time. But if you start everyone at the same time, there's then no way to improve after the first answer is posted. The solution is to have a bunch of miniature challenges, posted at arbitrary times, and have people compete to be the first to solve each individual challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And of course, I just described &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; (cops setting the challenges, robbers solving them). General challenge structures for which being the first to write the code are interesting should likely be run in that format, as it already achieves most of what you're looking for in a way that fits much better onto PPCG.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-05-05T16:57:06.360" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12295" PostTypeId="2" ParentId="2140" CreationDate="2017-05-06T04:44:35.383" Score="1" Body="&lt;h1&gt;Optimize for the Test Cases &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a set of test cases (pairs of input and output strings) as input, output a program in a programming language of your choice that consistently and deterministically produces the correct output for each input.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may choose any programming language for the output programs, so long as it is a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/45941&quot;&gt;programming language by our definition&lt;/a&gt;, it existed prior to the creation of this challenge, and it is capable of taking arbitrary ASCII strings as input and producing arbitrary ASCII strings as output.&lt;/li&gt;&#xA;&lt;li&gt;Your solution must use the same programming language for all inputs. The output programs do not need to be in the same language as the solution.&lt;/li&gt;&#xA;&lt;li&gt;The output program must consistently and deterministically produce the correct output for each input. That means that, no matter how many times the program is run, it will always produce the correct output (barring any uncontrollable accidents like cosmic rays twiddling bits). PRNGs are allowed so long as a constant seed is provided (making the output consistent and deterministic).&lt;/li&gt;&#xA;&lt;li&gt;The test cases' inputs are provided without quotes, but you may require that the input be quoted if it is necessary or convenient (as per our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7633/45941&quot;&gt;usual policy on quoted input&lt;/a&gt;). However, you must either always or never have quotes on the input - you can't have some with quotes and some without.&lt;/li&gt;&#xA;&lt;li&gt;It does not matter what the output program does for inputs that are not part of the specific test case the program was created for.&lt;/li&gt;&#xA;&lt;li&gt;You may optionally take the number of test cases as input, if that is convenient or necessary.&lt;/li&gt;&#xA;&lt;li&gt;Every input in a set of test cases will be mapped to a unique output. Input values will not be repeated within a set of test cases (so &lt;code&gt;[(3, 5), (3, 6)]&lt;/code&gt; wouldn't be a valid test case).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your score will be equal to the sum of the byte counts of all generated programs for the set of scoring cases. Lowest score wins. This is a competition within output languages, not a competition between output languages, so don't be afraid to choose a language that is more verbose than others. I reserve the right to change the scoring cases should it be necessary.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A C++ program that outputs (poorly-golfed) Python functions:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-cpp prettyprint-override&quot;&gt;&lt;code&gt;#include &amp;lt;iostream&amp;gt;&#xA;#include &amp;lt;string&amp;gt;&#xA;#include &amp;lt;sstream&amp;gt;&#xA;&#xA;using namespace std;&#xA;&#xA;const string function_skeleton_start = &quot;lambda s:{&quot;;&#xA;const string function_skeleton_end = &quot;}[s]&quot;;&#xA;&#xA;int main() {&#xA;    int N = 0;&#xA;    string in, out;&#xA;    stringstream program;&#xA;    program &amp;lt;&amp;lt; function_skeleton_start;&#xA;    cin &amp;gt;&amp;gt; N;&#xA;    cin.ignore();&#xA;    for(int i = 0; i &amp;lt; N; ++i) {&#xA;        getline(cin, in);&#xA;        getline(cin, out);&#xA;        program &amp;lt;&amp;lt; &quot;'&quot; &amp;lt;&amp;lt; in &amp;lt;&amp;lt; &quot;':'&quot; &amp;lt;&amp;lt; out &amp;lt;&amp;lt; &quot;',&quot;;&#xA;    }&#xA;    program &amp;lt;&amp;lt; function_skeleton_end;&#xA;    cout &amp;lt;&amp;lt; program.str() &amp;lt;&amp;lt; endl;&#xA;    return 0;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;An example input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2&#xA;foo&#xA;bar&#xA;bar&#xA;foo&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The corresponding output:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;lambda s:{'foo':'bar','bar':'foo',}[s]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(TBD)&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2017-05-07T07:42:15.690" LastActivityDate="2017-05-07T07:42:15.690" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12298" PostTypeId="1" CreationDate="2017-05-07T03:10:52.673" Score="14" ViewCount="247" Body="&lt;p&gt;There's many cases in which someone has a question about what site policy should be, people come up with suggestions, and one of them becomes highly popular and thus is treated as a rule. So far, everything's working to plan.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sometimes, it eventually turns out that one of these rules has issues, and could likely be improved. There are a few possible ways of doing this, but none of them really seems to work:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Editing the existing, highly-upvoted rule into a new rule (which presumably is almost the same but with clarifications). Understandably, people are reluctant to do this, as it's unclear whether the upvotes for the old rule would still apply to the new rule. I've done this in cases where a new consensus contradicts an old one (editing the old consensus the minimum amount necessary to remove the conflict), but it seems unwise in cases where it's unclear whether a new consensus exists.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Posting a competing answer to the same question. The problem is, even if the answer is better, this is an old consensus, and thus an old question (thus is unlikely to get many eyes even though it's been bumped to the top of the active-on-meta list), and it's going to be hard for it to gain more votes than the existing consensus, even if it's widely considered to be better. (Exacerbating this is that a number of upvotes on the current consensus are likely to be locked in due to age.) Normally you could at least partially solve this problem with a bounty (and perhaps making a trivial edit to the existing answer to unlock votes on it), but Meta doesn't allow bounties.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Posting a new Meta post to suggest a change to the rules. This would be the best way to get attention to the change (as it's likely to show up on the &quot;Hot Meta Posts&quot; sidebar if the suggestion is at all well considered; the bar for getting there on PPCG is pretty low). However, it has two major downsides: it's arguably a duplicate (and may well be closed on that basis), and even if it can be asked in such a way that it's not a duplicate (such as by having a narrower scope that focuses on the individual problem), you can end up with two consensuses that contradict, and arguments over which set of rules apply.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(This actually happened in practice &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10421/62131&quot;&gt;here&lt;/a&gt;, leading to a consensus contradicting a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8094/62131&quot;&gt;standard loophole&lt;/a&gt;; the situation eventually resolved itself, via mass downvoting of the standard loophole until it was under the threshold to count, but there was a contradiction leading to rules inclarity for several months; note that the standard loophole in question &lt;em&gt;still&lt;/em&gt; has a positive score, and it was created when the site was much smaller and thus there were fewer upvotes to go round.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Possibly there are other approaches too; the list above might not be exhaustive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In cases where problems have arisen with an established consensus, and you want to make a suggestion for improving it, what's the best way to go about it?&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-05-09T13:16:05.993" Title="What should be the process for updating an established consensus?" Tags="|discussion|policy|meta|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12300" PostTypeId="2" ParentId="9278" CreationDate="2017-05-07T08:50:16.257" Score="-2" Body="&lt;p&gt;I would say that using a language extension that &lt;strong&gt;only modifies the syntax and/or semantics of the language&lt;/strong&gt; should be free and count as a separate language, as long as it &lt;strong&gt;doesn't give you new functions&lt;/strong&gt; you can call.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe that all Haskell extensions would fall under this category (correct me if I'm wrong), as well as &lt;code&gt;use strict&lt;/code&gt; and friends in perl, and most flags for the C/C++ compiler. In the case of vim, I think introducing a new normal mode command should count as a function and not a language extension.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are probably many problematic edge cases I'm missing, but the basic idea is that an extension doesn't give you functionality for free, but changes how code looks and how the language behaves.&lt;/p&gt;&#xA;" OwnerUserId="29859" LastActivityDate="2017-05-07T08:50:16.257" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12302" PostTypeId="2" ParentId="2140" CreationDate="2017-05-07T15:42:53.827" Score="0" Body="&lt;h1&gt;Is the line closed?&lt;/h1&gt;&#xA;&lt;p&gt;Given input consisting of only whitespace characters and &lt;code&gt;-/\|&lt;/code&gt;, tell if the line created by &lt;code&gt;-\/|&lt;/code&gt; is closed.&lt;/p&gt;&#xA;&lt;p&gt;For this challenge, &lt;code&gt;\&lt;/code&gt; points one character up and to the left, as well as one character down and to the right. &lt;code&gt;/&lt;/code&gt; points up and to the right, and down and to the left. &lt;code&gt;|&lt;/code&gt; points one to one character above and below it. &lt;code&gt;-&lt;/code&gt; points one character to the left and right of it.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;# means it is being pointed to.&#xA;&#xA;#&#xA; \&#xA;  #&#xA;&#xA;  #&#xA; /&#xA;#&#xA;&#xA;#-#&#xA;&#xA;#&#xA;|&#xA;#&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;A line is a bunch of &lt;code&gt;/\-|&lt;/code&gt; characters that point to each other.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;     /---\&#xA;\    |   |&#xA; \---/   \&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The characters &lt;code&gt;-&lt;/code&gt; and &lt;code&gt;|&lt;/code&gt; cannot validly point to each other. Similarly, &lt;code&gt;/&lt;/code&gt; and &lt;code&gt;\&lt;/code&gt; cannot point to each other either.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;-| = INVALID&#xA;&#xA;|&#xA;-  = INVALID&#xA;&#xA;\&#xA; / = INVALID&#xA;&#xA; /&#xA;\  = INVALID&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;A closed line is one where each of its characters validly point to another of its characters.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;/--\&#xA;|  |&#xA;\--/ = CLOSED&#xA;&#xA;\--\&#xA;|  |&#xA;\--/ = NOT CLOSED&#xA;&#xA;---- = NOT CLOSED&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your task, as said above, is to write a program that says if a line is closed.&lt;/p&gt;&#xA;&lt;p&gt;Test cases coming soon.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="64159" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-07T15:42:53.827" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12303" PostTypeId="2" ParentId="2140" CreationDate="2017-05-07T18:23:43.017" Score="0" Body="&lt;h2&gt;Uncompress a permutation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I have a number of permutations, of which this is an example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[0] 1 2 3 15 14 26 27 28 29 30 31 32 33 5 4 16 17 18 19 20 21 22 23 35 34 6 7 8 9 10 11 12 13 25 24 36 37 38 39 [40]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(&lt;code&gt;0&lt;/code&gt; is used for 0-indexed permutations and &lt;code&gt;40&lt;/code&gt; for 1-indexed permutations.) In order to save space, I want to compress the permutation by reducing each ascending run of consecutive numbers to its first element, giving:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0/1 15 14 26 5 4 16 35 34 6 25 24 36&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This compression method is invertible, because each missing element from the compressed form must follow its predecessor among the integers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to write a program or function that takes a compressed permutation as input and returns an uncompressed permutation. Your input will consist of an array or list or other reasonable type representing the compressed permutation, plus an integer number of elements in the uncompressed permutation. Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[0], 2 -&amp;gt; [0, 1] (0-indexed)&#xA;[1], 2 -&amp;gt; [1, 2] (1-indexed)&#xA;[6, 2, 0], 8 -&amp;gt; [6, 7, 2, 3, 4, 5, 0, 1] (0-indexed)&#xA;[7, 4, 1], 9 -&amp;gt; [7, 8, 9, 4, 5, 6, 1, 2, 3] (1-indexed)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In order to make the compression worthwhile I obviously need as short a decompression routine as possible, so this is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="194" LastEditDate="2017-05-08T21:24:02.147" LastActivityDate="2017-05-08T21:24:02.147" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12304" PostTypeId="2" ParentId="2140" CreationDate="2017-05-07T18:27:51.893" Score="0" Body="&lt;h1&gt;Determine if a relation is an equivalence relation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Content to be added.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/118960/is-this-a-function&quot;&gt;Is this a function?&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/100660/determine-if-a-relation-is-transitive&quot;&gt;Determine if a relation is transitive&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Inspires &quot;Determine if a relation is a partial order&quot;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user58632" LastActivityDate="2017-05-07T18:27:51.893" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12305" PostTypeId="1" CreationDate="2017-05-07T22:26:29.003" Score="14" ViewCount="661" Body="&lt;p&gt;I'm looking for opinions on what outputs to allow as the Yes and No outputs on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; challenges. The goal isn't to make a policy, but to help with a decision I often have to make when writing challenges.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;One standard is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2190/20260&quot;&gt;Truthy/Falsey&lt;/a&gt;, which checks if the output &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2194/20260&quot;&gt;satisfies the language's &lt;code&gt;if&lt;/code&gt; construct&lt;/a&gt;. I see some big benefits:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8077/20260&quot;&gt;Flexible output&lt;/a&gt; is good in general&lt;/li&gt;&#xA;&lt;li&gt;Using the language's own definition is the natural choice&lt;/li&gt;&#xA;&lt;li&gt;Avoids one-size-fits-all decisions like &quot;&lt;code&gt;[0]&lt;/code&gt; is Falsey&quot; that bias towards some languages &lt;/li&gt;&#xA;&lt;li&gt;Allows creative golfing approaches like testing for existence by counting (if 0 is Falsey) or enumerating (if the empty list is Falsey).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;But, I find awkward issues coming up:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Some languages don't have an &lt;code&gt;if&lt;/code&gt;-like construct&lt;/li&gt;&#xA;&lt;li&gt;Truthiness is arguably a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10002/20260&quot;&gt;non-observable requirement&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;It's ambiguous whether a program outputs an object or its string representation&lt;/li&gt;&#xA;&lt;li&gt;I find it a step short of &quot;decision&quot; to output, say, &lt;code&gt;[1, 4]&lt;/code&gt; which could then be converted to &lt;code&gt;True&lt;/code&gt; but isn't&lt;/li&gt;&#xA;&lt;li&gt;Having more than two valid outputs diminishes the purity and simplicity that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10584/new-tag-proposal-decision-problem#comment34316_10587&quot;&gt;motivated the tag&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Some languages are limited to just True/False because their &lt;code&gt;if&lt;/code&gt; construct doesn't implicitly convert to bool, which I find arbitrary&lt;/li&gt;&#xA;&lt;li&gt;It's weird if an exact port is invalid because the new language does &lt;code&gt;if&lt;/code&gt; differently even though the code never touches on this difference.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;An alternative to truthiness is for the answerer to specify a consistent values to stand for Yes and a different consistent value to stand for No.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The solver is allowed a choice convenient for the challenge, allowing challenge-specific creative approaches&lt;/li&gt;&#xA;&lt;li&gt;The two-consistent-outputs rule is easy to state in the challenge, making the rules self-contained and unambiguous&lt;/li&gt;&#xA;&lt;li&gt;Anyone can test and confirm a submission without needing to know how its language works&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And some cons:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Choosing favorable outputs feels like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9501/20260&quot;&gt;golfing the spec&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;It's dumb that a solution can use &lt;code&gt;False&lt;/code&gt; for &lt;code&gt;True&lt;/code&gt; and &lt;code&gt;True&lt;/code&gt; for &lt;code&gt;False&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Solutions in a language can't be copy-pasted into an automated tester without adjustment&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;There's other possibilities like requiring both Truthy/Falsey and consistency, limiting to specific values like 0 or 1, or trying to make a new community consensus definition.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2017-05-08T03:05:48.527" Title="What outputs should I allow for decision problems?" Tags="|discussion|rules|asking-questions|" AnswerCount="3" CommentCount="9" ClosedDate="2020-12-08T04:02:42.377" ContentLicense="CC BY-SA 3.0" />
  <row Id="12306" PostTypeId="2" ParentId="12305" CreationDate="2017-05-07T22:36:36.070" Score="10" Body="&lt;p&gt;The best solution, in my opinion, is to allow solutions to choose two distinct sequences of bytes to represent a truthy output and a falsey output. Some possible output pairs could be &lt;code&gt;Yes&lt;/code&gt; and &lt;code&gt;No&lt;/code&gt;, &lt;code&gt;True&lt;/code&gt; and &lt;code&gt;False&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt;, &lt;code&gt;\x01&lt;/code&gt; and &lt;code&gt;\x00&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt; and an empty output, etc. The actual challenge is deciding whether or not a given input has some quality. Restricting the output adds unnecessary complication that distracts from the actual challenge.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-05-07T22:36:36.070" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12307" PostTypeId="2" ParentId="12305" CreationDate="2017-05-08T01:06:46.413" Score="11" Body="&lt;p&gt;I think there are many points in favour of two-distinct-consistent-answers:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Some languages don't have anything resembling typical data structures. &lt;a href=&quot;https://esolangs.org/wiki/But%20Is%20It%20Art%3F&quot; rel=&quot;nofollow noreferrer&quot;&gt;But Is It Art?&lt;/a&gt; is a good example. Meanwhile, although the language has nothing internally resembling a Boolean or if statement (unless you roll your own), it does have an exit code (success/failure) which works perfectly well in a two-consistent-output challenge even if it isn't something that the language can operate on (and thus isn't truthy or falsey by our usual definition).&lt;/li&gt;&#xA;&lt;li&gt;Even in more normal languages, exit codes are often a different sort of thing to Booleans or integers. For example, in C, 1 is truthy and 0 is falsey; but &lt;code&gt;EXIT_SUCCESS&lt;/code&gt; is normally 0 and &lt;code&gt;EXIT_FAILURE&lt;/code&gt; is normally 1. So if we have an exit code of 1, does that count as truthy or as falsey? I've seen different answers do it different ways on the same question. As such, there's not much point in trying to require &quot;all programs should output truthy when X and falsey when not X&quot;, as which answer is which can reasonably differ between answers.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Two-distinct-consistent-answers allows for more possible approaches than truthy/falsey does. If you have an algorithm that works for a truthy/falsey challenge, adding one or two NOT operators (which in most non-esoteric languages, and many esoteric languages too, is a maximum of four bytes, e.g. &lt;code&gt;!!()&lt;/code&gt;) will easily turn it into a two-distinct-consistent answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Going the other way is not always possible (e.g. if one of your consistent answers is the error message produced by a division by zero and the language has no way to trap errors), and is often much more verbose even when it is possible; and yet in many cases, it's possible in zero bytes via exploiting corner cases of the rules (e.g. the division-by-zero probably sets the exit code to 1, so say your program &quot;outputs by exit code&quot; and then define 1 in an exit code to be truthy or falsey depending on which output you want). So if you favour keeping the golf in the program, not in the I/O, two-distinct-consistent-answers will get rid of some of the largest abuses.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Requiring distinct, consistent answers (without specifying what those are) naturally deals with unavoidable output boilerplate, and cases where a language outputs in a format that doesn't appear in the source code (e.g. in Prolog, interpreters normally produce a failure output as &lt;code&gt;false.&lt;/code&gt; or &lt;code&gt;no.&lt;/code&gt;, but the closest equivalent in the source would be &lt;code&gt;fail&lt;/code&gt; with no full stop). As such, it's a very objective rule. Truthy/falsey is much more subjective in these kinds of cases.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Note that these arguments are mostly oriented at full programs. With functions, these arguments tend to be less convincing (although only the last point gives an &lt;em&gt;advantage&lt;/em&gt; to truthy/falsey in a function setting, as it tends to be more objective whether a function return value is truthy than whether two arbitrary data are equal; the other points are more neutral on functions). However, the number of languages in which functions don't exist or require a lot of boilerplate is probably much larger than the number of languages which can't easily handle full programs and which can neither easily output-to-stdout nor compare Boolean-valued function return values, so I think the arguments for full programs probably swing this.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-05-08T01:06:46.413" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12308" PostTypeId="2" ParentId="12305" CreationDate="2017-05-08T02:54:11.590" Score="15" Body="&lt;h1&gt;One consistent, and one non-consistent&lt;/h1&gt;&#xA;&lt;p&gt;The thing I like about Truthy and Falsy is that often you may do things like output &lt;code&gt;0&lt;/code&gt; for falsy and everything else for truthy.  For example &lt;a href=&quot;https://codegolf.stackexchange.com/a/113514/56656&quot;&gt;this&lt;/a&gt; brain-flak answer outputs nothing for even numbers and the input for odd numbers.  It could be argued that this is an exploit, I think this gives the opportunity for some really cool golfs.&lt;/p&gt;&#xA;&lt;p&gt;The thing I don't like about Truthy v. Falsy is it is, as mentioned, not really an observable requirement.&lt;/p&gt;&#xA;&lt;p&gt;I would suggest, as a happy medium, that the user specify a single consistent value for one state with every other possible output going to the other state.&lt;/p&gt;&#xA;&lt;p&gt;In the example above it would specify no output for even with all other possible outputs indicating odd.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This method is by no means the best method for every question, so here is a list of pros and cons as I see them.  Feel free to comment any more I might have overlooked.&lt;/p&gt;&#xA;&lt;h3&gt;Pros&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It is very similar to the two consistent outputs suggestion, but it gives golfers more freedom to create some really cool golfs, similar to the truthy v. falsy suggestion.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It is also completely observable unlike the Truthy v. Falsy suggestion.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Simpler to explain than the distinction between Truthy and Falsy&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Cons&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A little more complex than the two consistent values&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;em&gt;Taken with modification from the question&lt;/em&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;This allows you to choose &lt;em&gt;even more favorable outputs&lt;/em&gt; increasing the feeling of &amp;quot;golfing the spec&amp;quot;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It's dumb that a solution can use &lt;code&gt;False&lt;/code&gt; for &lt;code&gt;True&lt;/code&gt; and &lt;code&gt;True&lt;/code&gt; for &lt;code&gt;False&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Solutions in a language can't be copy-pasted into an automated tester without adjustment&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-08T03:05:48.527" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12310" PostTypeId="1" CreationDate="2017-05-08T03:21:02.843" Score="6" ViewCount="251" Body="&lt;p&gt;I am currently designing a language that cannot halt unless it all of its memory is cleared, this means for any practical application it has no output whatsoever.  However when the program does halt it does output &lt;code&gt;HALTED&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In languages otherwise incapable of traditional output can halting and non-halting be considered outputs for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problems&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problems&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problems&lt;/a&gt; that ask for two distinct outputs?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-05-08T12:05:57.807" LastActivityDate="2017-05-08T19:56:41.433" Title="Can Halting be considered output?" Tags="|discussion|output|" AnswerCount="3" CommentCount="4" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12311" PostTypeId="1" CreationDate="2017-05-08T04:07:00.473" Score="2" ViewCount="61" Body="&lt;p&gt;As seen from the blue shading, I only had 2 new messages, but the red indicator showed 6. Such mismatch is very frequent. The blue shading is always right.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/M5xop.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/M5xop.png&quot; alt=&quot;6 new or 2 new?&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="68942" LastEditDate="2021-06-05T23:18:38.070" LastActivityDate="2021-06-05T23:18:38.070" Title="Recent inbox messages counts wrong" Tags="|bug|status-bydesign|notifications|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12312" PostTypeId="2" ParentId="12311" CreationDate="2017-05-08T04:34:38.560" Score="5" Body="&lt;p&gt;It's admittedly a bit confusing, but not really a bug. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you get 10 comments on the same post, the inbox indicator will show &lt;strong&gt;10&lt;/strong&gt; with a red background, but only a single thread will be displayed in your inbox. Likewise, several answers &lt;em&gt;to the same question&lt;/em&gt; get gropued as well and will show up as a single item in the dropdown.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To keep track of unread answers and comments, you can navigate to the responses tab in your profile. (&lt;a href=&quot;https://codegolf.stackexchange.com/users/43319/ad%C3%A1m?tab=responses&amp;amp;sort=all&quot;&gt;direct link&lt;/a&gt;) Items with a yellowish background indicate new responses since the last time you visited the tab.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2017-05-08T04:52:33.520" LastActivityDate="2017-05-08T04:52:33.520" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12314" PostTypeId="2" ParentId="12310" CreationDate="2017-05-08T09:15:20.877" Score="0" Body="&lt;p&gt;While halting versus not halting is the classic truthy/falsey output in Turing Machines, you run up into the halting problem when you try to use it practically. It's impossible to say in general whether or not a program in a Turing-complete language will halt. That will cause similar difficulties on PPCG: will the program never halt, or has it not been given enough time?&lt;sup&gt;[1]&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A way around this would be to say &quot;if it doesn't halt in N seconds, it doesn't halt&quot;, but that opens up more cans of worms about hardware configurations and such.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, no, halting versus not halting should not be used as a way to indicate truthiness or falsiness.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;[1]: On a slightly philosophical note, in reality, every program will halt eventually, whether it be due to someone tripping over the power cable, or the heat death of the universe.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-05-08T09:15:20.877" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12315" PostTypeId="2" ParentId="12310" CreationDate="2017-05-08T12:44:21.623" Score="4" Body="&lt;h1&gt;Only if it's halting-ness is proven in the post&lt;/h1&gt;&#xA;&lt;p&gt;It is impossible to prove whether any arbitrary program will halt.  &lt;strong&gt;That doesn't mean that every program can't be proven.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;However, the burden of the proof lies with the poster.  If they prove that it will (or won't) halt in the post, then I see no problem.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-08T12:44:21.623" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12317" PostTypeId="2" ParentId="12310" CreationDate="2017-05-08T19:56:41.433" Score="21" Body="&lt;h2&gt;Please no&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10003/20260&quot;&gt;All languages should follow the same rules&lt;/a&gt;, and being incapable of doing something isn't reason for special treatment. And this would be a big rules change for decision problems in every language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A good number of existing answers could be easily outgolfed by invoking this new option. For example, on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/115516/is-this-number-an-integer-power-of-2&quot;&gt;Is this number an integer power of -2?&lt;/a&gt;, I can &lt;a href=&quot;https://tio.run/nexus/python2#FctBCoAgFAXAdZ3ibUQFJTQokOwuRhlC/cLq/FbLWUyJfgv7NAeQI@/NkUHMDlFQo60s8TcSIQdaF6FNp0wvXV2dOdENztoHegS7OBgEKXxRyvIC&quot; rel=&quot;nofollow noreferrer&quot;&gt;cut 3 bytes&lt;/a&gt; from the &lt;a href=&quot;https://codegolf.stackexchange.com/a/115550/20260&quot;&gt;shortest Python answer&lt;/a&gt;, &lt;a href=&quot;https://tio.run/nexus/haskell#@5@mYGhryJWmkGebpqGbp2@k@T83MTNPwVahoCgzr0RBRSE3sUAhTSFa10JPz9Ag9j8A&quot; rel=&quot;nofollow noreferrer&quot;&gt;6 bytes&lt;/a&gt; from the &lt;a href=&quot;https://codegolf.stackexchange.com/a/115644/20260&quot;&gt;shortest Haskell answer&lt;/a&gt;, and many others, just by removing their bases cases of 0.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Challenges about searching for an object could now be done by enumerating them without limit until one works. For example, the challenge &lt;a href=&quot;https://codegolf.stackexchange.com/q/118072/20260&quot;&gt;Reachable numbers&lt;/a&gt; to check if the input is the totient function of some number can now be done as:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;n=input()&#xA;i=1&#xA;while phi(i)!=n:i+=1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This gets around bounding the maximum possible &lt;code&gt;i&lt;/code&gt;, which all existing answers do.  This stinks of a hidden rule: an output method that golfers and decision-problem writers wouldn't know is valid unless told so.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The obvious expectation that output methods produce a result. Running code that just keeps going isn't something one would expect to call solving a decision problem. No matter how long you run it, you don't know if it is still yet to halt. Even if you can prove it runs forever, this is not &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10002/20260&quot;&gt;observable&lt;/a&gt;: it requires examining the code itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moreover, it defies the meaning of &quot;decision&quot; in computation, that &lt;a href=&quot;https://en.wikipedia.org/wiki/Machine_that_always_halts&quot; rel=&quot;nofollow noreferrer&quot;&gt;a machine that decides a language&lt;/a&gt; must halt by accepting or rejecting, and would let us submit entries to &quot;solve&quot; decision problems that are &lt;a href=&quot;https://en.wikipedia.org/wiki/Undecidable_problem&quot; rel=&quot;nofollow noreferrer&quot;&gt;undecidable&lt;/a&gt;, which is ridiculous.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2017-05-08T19:56:41.433" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12319" PostTypeId="2" ParentId="12298" CreationDate="2017-05-08T23:08:08.777" Score="6" Body="&lt;h1&gt;Make a new question&lt;/h1&gt;&#xA;&lt;p&gt;Posting a new question is perfectly acceptable provided you can justify that it is worth opening up the discussion again. Then, by closing the old discussion as a dupe of the new one, it will serve as a signpost.&lt;/p&gt;&#xA;&lt;p&gt;All credit for this answer does go to Martin Ender, however, I felt this answer did merit a spot as an answer where it would have more visibility to the community to vote and comment.&lt;/p&gt;&#xA;&lt;p&gt;This post is community wiki to reflect that (while I wholeheartedly share this stance) it was originally suggested by a member of the communty other than myself. Thus, this is not original work.&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-09T13:16:05.993" CommentCount="4" CommunityOwnedDate="2017-05-08T23:08:08.777" ContentLicense="CC BY-SA 3.0" />
  <row Id="12321" PostTypeId="1" CreationDate="2017-05-09T17:53:20.163" Score="4" ViewCount="165" Body="&lt;p&gt;I know that porting answers to other &lt;em&gt;languages&lt;/em&gt; is permitted (and sometimes encouraged) but is porting answers to other &lt;em&gt;versions&lt;/em&gt; of the &lt;em&gt;same&lt;/em&gt; language allowed?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I came across an answer earlier which was a direct port, to an older version of the language, of an answer I'd posted to the same challenge. My original reaction was to downvote it for showing no original research but I thought it best to check first, whether ports like that are or are not permitted by any site rules or etiquette.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it's not permitted, what action should be taken with offending answers? And, as a follow up, does challenge (in)activity have any bearing on when such ports &lt;em&gt;would&lt;/em&gt; be allowed?&lt;/p&gt;&#xA;" OwnerUserId="58974" LastActivityDate="2017-05-09T18:16:33.283" Title="Porting an answer to another version of the same language" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12322" PostTypeId="2" ParentId="12321" CreationDate="2017-05-09T18:16:33.283" Score="9" Body="&lt;p&gt;Technically, ports are valid answers. Feel free to downvote them if you feel that they're just ripping off of another answer, and mod flag them for plagiarism if credit isn't given to the original answer (because SE posts are licensed under CC-BY-SA, attribution is mandatory if another user's post is copied or modified).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-05-09T18:16:33.283" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12324" PostTypeId="2" ParentId="8808" CreationDate="2017-05-09T22:49:09.790" Score="2" Body="&lt;h1&gt;Make this post featured.&lt;/h1&gt;&#xA;&lt;p&gt;Perhaps, this welcome page could take the form of the Frozen list of community consensus. Then, we could unfeature the sandbox, and have this post serve as a signpost to the sandbox.&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-09T22:49:09.790" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12326" PostTypeId="2" ParentId="12220" CreationDate="2017-05-10T11:03:18.450" Score="1" Body="&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Having only just noticed:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;For violations of network-wide policy or repeated violations of this chatiquette, a network-wide suspension may be applied by a moderator.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;For violations of network-wide policy, yes. No problem with that. For repeated violations of chatiquette, you're standing on very unstable ground.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moderators enforce network policy. Moderators do not enforce chatroom-specific, non-official rules using moderator-only functions like suspension. Kick people, sure, but suspending people for violating local, unofficial rules shouldn't be happening. Unless they &lt;em&gt;also&lt;/em&gt; happen to violate network policy a bunch, of course, and in this case chatiquette and network policy are sufficiently aligned that in the majority of cases if someone continually violates chatiquette, they're likely to also have violated network policy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This sentence should probably be reworded to&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;For violations of network-wide policy, a network-wide suspension may be applied by a moderator.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Network policy also includes listening to mods/ROs when they tell you to stop doing something, so chatiquette &lt;em&gt;is still covered&lt;/em&gt; by this - but it avoids threatening suspensions for non-suspendable offences.&lt;/p&gt;&#xA;" OwnerUserId="25164" LastEditorDisplayName="user45941" LastEditDate="2017-05-10T12:24:11.447" LastActivityDate="2017-05-10T12:24:11.447" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="12327" PostTypeId="2" ParentId="2447" CreationDate="2017-05-10T16:48:01.420" Score="16" Body="&lt;h1&gt;Functions may return a promise containing the output&lt;/h1&gt;&#xA;&lt;h2&gt;About Promises&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Futures_and_promises&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia article on futures &amp;amp; promises&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://developer.mozilla.org/en/docs/Web/JavaScript/Reference/Global_Objects/Promise&quot; rel=&quot;nofollow noreferrer&quot;&gt;MDN article on the JavaScript &lt;code&gt;Promise&lt;/code&gt; object&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;Consider the following function to retrieve my rep from the API, with the output logged from the last &lt;code&gt;Promise&lt;/code&gt; in the chain:&lt;/p&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;f=&#xA;&#xA;_=&amp;gt;fetch(&quot;//api.stackexchange.com/users/58974?site=codegolf&quot;).then(r=&amp;gt;r.json()).then(j=&amp;gt;console.log(j.items[0].reputation))&#xA;&#xA;f()&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&lt;p&gt;I propose instead that we simply be allowed to return the &lt;code&gt;Promise&lt;/code&gt; containing the output, like so:&lt;/p&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;f=&#xA;&#xA;_=&amp;gt;fetch(&quot;//api.stackexchange.com/users/58974?site=codegolf&quot;).then(r=&amp;gt;r.json()).then(j=&amp;gt;j.items[0].reputation)&#xA;&#xA;f().then(console.log)&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Conditions of Use&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This section requires more detail, please edit it to include any other conditions you think should be covered or to add tags to the existing conditions.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;In challenges that use code length as a measure for the winning criterion, returning a promise would not be permitted if further manipulation would be required to achieve the desired output, as in this example:&lt;/p&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;f=&#xA;&#xA;_=&amp;gt;fetch(&quot;//api.stackexchange.com/users/58974?site=codegolf&quot;).then(r=&amp;gt;r.json()).then(j=&amp;gt;j.items[0])&#xA;&#xA;f().then(i=&amp;gt;console.log(i.reputation))&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;If this method is used in time-based challenges then the time required to resolve the final promise &lt;em&gt;must&lt;/em&gt; be counted towards your score.&lt;/p&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-14T09:43:33.597" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12328" PostTypeId="1" CreationDate="2017-05-10T16:57:21.547" Score="4" ViewCount="126" Body="&lt;p&gt;Should &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; submissions written in JS that return a promise be allowed?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;Promise.resolve(&quot;hi&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Doesn't output &lt;code&gt;&quot;hi&quot;&lt;/code&gt;, but outputs a promise that resolves with the value of &lt;code&gt;&quot;hi&quot;&lt;/code&gt;. If you want &quot;hi&quot;, then &lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;Promise.resolve(&quot;hi&quot;).then(console.log)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is needed. Should the &lt;code&gt;.then(console.log)&lt;/code&gt; part be required (and therefore part of the byte count)?&lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastEditorUserId="56656" LastEditDate="2017-05-22T17:05:22.820" LastActivityDate="2017-05-22T17:05:22.820" Title="JS Promises in code-golf?" Tags="|discussion|code-golf|output|" AnswerCount="1" CommentCount="1" ClosedDate="2017-05-10T17:42:35.207" ContentLicense="CC BY-SA 3.0" />
  <row Id="12329" PostTypeId="2" ParentId="12328" CreationDate="2017-05-10T16:57:21.547" Score="6" Body="&lt;h1&gt;No byte penalty&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is just an (abnormal) way of output that can show up often in &lt;code&gt;fetch&lt;/code&gt; / &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/networking&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;networking&amp;#39;&quot; rel=&quot;tag&quot;&gt;networking&lt;/a&gt; submissions. I think this is absolutely fine.&lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastActivityDate="2017-05-10T16:57:21.547" CommentCount="1" CommunityOwnedDate="2017-05-10T16:57:21.547" ContentLicense="CC BY-SA 3.0" />
  <row Id="12334" PostTypeId="1" CreationDate="2017-05-11T09:22:38.153" Score="0" ViewCount="179" Body="&lt;p&gt;In order to properly test the submissions to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/119907/martin-vs-dennis-round-1&quot;&gt;Martin vs Dennis - Round 1&lt;/a&gt;, one would need to upvote the current lesserso their reps become equal, and then continue upvoting so the former lesser becomes the higher.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it permitted to vote for this reason?&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2017-06-05T16:53:23.313" Title="Is it permitted to upvote only to test submissions?" Tags="|discussion|policy|reputation|voting|testing|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12339" PostTypeId="1" AcceptedAnswerId="12352" CreationDate="2017-05-11T15:15:33.683" Score="8" ViewCount="3371" Body="&lt;p&gt;I was told bytes in assembly are counted by the byte of machine code. Is that true? If so what steps should be taken to correctly get bytes?&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="68942" LastEditDate="2021-04-03T20:30:52.870" LastActivityDate="2021-04-03T20:30:52.870" Title="How are bytes counted in assembly?" Tags="|discussion|code-golf|" AnswerCount="4" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12340" PostTypeId="2" ParentId="12339" CreationDate="2017-05-11T15:35:11.230" Score="6" Body="&lt;h2&gt;Assembly languages are scored by the compiled/assembled size&lt;/h2&gt;&#xA;&lt;p&gt;For example, take this x86 program to reverse the bit order of a number:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;xor eax, eax&#xA;inc eax&#xA;myloop:&#xA;shr ecx, 1&#xA;adc eax, eax&#xA;jnc short myloop&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This compiles into:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;33 C0 40 D1 E9 13 C0 73 FA&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(a series of hex bytes)&lt;/p&gt;&#xA;&lt;p&gt;Thus, this is 9 bytes.&lt;/p&gt;&#xA;&lt;p&gt;Another example, in a different assembly dialect:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    # reverse bits of a 32 bit word&#xA;    .text&#xA;    .globl rbit&#xA;    .type rbit,@function&#xA;rbit:&#xA;    push $32       # prepare loop counter&#xA;    pop %ecx&#xA;0:  shrl 4(%esp)   # shift lsb of argument into carry flag&#xA;    adc  %eax,%eax # shift carry flag into lsb&#xA;    loop 0b        # decrement %ecx and jump until ecx = 0&#xA;    ret            # return&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This compiles/assembles to these 12 hex bytes:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;6a 20 59 d1 6c 24 04 11 c0 e2 f8 c3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;So to get your score, simply compile/assemble the assembly and get the size of the resulting file.&lt;/p&gt;&#xA;&lt;p&gt;On Mac, this can be done as follows: (different flags may be needed for different assembly dialects)&lt;/p&gt;&#xA;&lt;p&gt;If &lt;code&gt;test.asm&lt;/code&gt; is the file containing the assembly (not compiled/assembled though), then run this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;nasm -f elf test.asm&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This makes an object file. Next, run either:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ld test.o -o test&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;gcc test.o -o test&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Then you can run &lt;code&gt;test&lt;/code&gt; as &lt;code&gt;./test&lt;/code&gt;. Which of &lt;code&gt;ld&lt;/code&gt; and &lt;code&gt;gcc&lt;/code&gt; depends on the format of the assembly. If it has a &lt;code&gt;main&lt;/code&gt; function, use &lt;code&gt;gcc&lt;/code&gt;. If it has a defined start point, use &lt;code&gt;ld&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;The two answers I used are taken from &lt;a href=&quot;https://codegolf.stackexchange.com/a/105822/46271&quot;&gt;here&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/a/36303/46271&quot;&gt;here&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-11T15:35:11.230" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12341" PostTypeId="2" ParentId="12334" CreationDate="2017-05-11T17:05:30.703" Score="10" Body="&lt;h1&gt;Absolutely not&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;In general&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Targeted upvoting – i.e., upvoting because of the poster instead of the post itself – is forbidden on the entire network and can have unpleasant consequences both for the voter and the votee.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While going through a specific user's posts out of curiosity (and naturally upvoting several posts as a result) and going through a specific user's posts &lt;em&gt;with the intent of finding something to upvote&lt;/em&gt; are very hard to distinguish for an observer, the latter is targeted voting and thus not allowed.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;In this specific case&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Answers that do not make any assumptions can be easily tested by replacing our user IDs with others'. Other answers will require a bit more tinkering, but should still remain testable by querying other SE sites apart from PPCG.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-05-11T17:05:30.703" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12343" PostTypeId="2" ParentId="12339" CreationDate="2017-05-11T21:39:27.850" Score="1" Body="&lt;p&gt;No. The correct way to count bytes is to count the length of the source file.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;xor eax, eax&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is 12 bytes. Assembly is no different to any other source-based language in this regard.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="26600" LastEditDate="2017-05-12T07:39:43.113" LastActivityDate="2017-05-12T07:39:43.113" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12344" PostTypeId="2" ParentId="12339" CreationDate="2017-05-11T21:53:48.833" Score="-8" Body="&lt;h1&gt;Whatever is shorter.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;What about all other compiled languages? Should C/C++ be scored by binary output size? Java/Kotlin/other JVM languages by bytecode size?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7833/62024&quot;&gt;Languages are defined by their interpreter&lt;/a&gt;, compiling should be considered a middle step.&lt;/p&gt;&#xA;" OwnerUserId="62024" LastActivityDate="2017-05-11T21:53:48.833" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12347" PostTypeId="1" CreationDate="2017-05-12T12:07:41.747" Score="2" ViewCount="106" Body="&lt;h1&gt;Problem&lt;/h1&gt;&#xA;&lt;p&gt;With a recent influx of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stack-exchange-api&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stack-exchange-api&amp;#39;&quot; rel=&quot;tag&quot;&gt;stack-exchange-api&lt;/a&gt; challenges, the poor old &lt;a href=&quot;http://api.stackexchange.com/&quot;&gt;API&lt;/a&gt; has been taking a bit of a hammering and some of us are finding ourselves hitting the throttle limit and being blocked from accessing the API for extended periods of times.&lt;/p&gt;&#xA;&lt;p&gt;The answers below propose possible solutions to counter this problem and, hopefully, from them we can come up with something viable.&lt;/p&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="68942" LastEditDate="2021-06-09T05:39:13.387" LastActivityDate="2021-06-09T05:39:13.387" Title="Proposals for alleviating API strain" Tags="|discussion|feature-request|status-reproduced|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12348" PostTypeId="2" ParentId="2140" CreationDate="2017-05-12T12:22:56.457" Score="0" Body="&lt;h1&gt;Output the Balmer Series&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program which outputs the following image (note, it is an svg):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/6/60/Emission_spectrum-H.svg&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is the emission spectrum of hydrogen, caused by the Balmer series: &lt;a href=&quot;https://en.wikipedia.org/wiki/Hydrogen_spectral_series#5&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://en.wikipedia.org/wiki/Hydrogen_spectral_series#5&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program must not read the image from the internet or a local file.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The image may be to an image file or a graphics window. If not a vector, the image sides must be greater than 400 pixels.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your image must have the same colours and same ratios of spacing between each line.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winning&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="30525" LastEditDate="2017-05-13T09:24:41.010" LastActivityDate="2017-05-13T09:24:41.010" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12349" PostTypeId="2" ParentId="12347" CreationDate="2017-05-12T12:33:19.190" Score="-1" Body="&lt;h2&gt;Proposal&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To solve the problem and as (with &lt;a href=&quot;https://codegolf.stackexchange.com/q/119907/58974&quot;&gt;very rare exception&lt;/a&gt;) live data is not &lt;em&gt;required&lt;/em&gt; in order to complete API based challenges, I propose the creation of a website, built &amp;amp; maintained by the community, to cache responses from the API that members can then use in their solutions.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;How it Would Work&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A user posting a new &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stack-exchange-api&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stack-exchange-api&amp;#39;&quot; rel=&quot;tag&quot;&gt;stack-exchange-api&lt;/a&gt; challenge would enter the URL of the API request required to complete the challenge.&lt;/li&gt;&#xA;&lt;li&gt;The site would retrieve the response for that request and save it locally as a JSON file.&lt;/li&gt;&#xA;&lt;li&gt;A local URL would be returned to the user for inclusion in their question.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a user enters a URL for a request with a response already saved then the existing URL would be returned and, optionally, the local file would be updated with fresh data if it was older than a set period of time.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;All users attempting to answer the challenge would use that all users answering it &lt;em&gt;must&lt;/em&gt; use in their solution.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Questions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Isn't figuring out the API request usually part of the challenge?&lt;/strong&gt;&lt;br&gt;Yes, it can be seen to be, however, once one user figures out the optimal URL to use then all users attempting the challenge will use the same URL so it's not really an issue.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;What about challenges that &lt;em&gt;do&lt;/em&gt; require live data?&lt;/strong&gt;&lt;br&gt;Hopefully, they will remain so few and far between and only require one request to be made to the API that we could conceivably still use the API for those particular challenges.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;What about questions that necessitate requesting multiple pages from the API?&lt;/strong&gt;&lt;br&gt;In most cases, removing the need to request multiple pages does not detract from the challenge. In fact, in my opinion, it improves it. Consider the &quot;&lt;a href=&quot;https://codegolf.stackexchange.com/q/119958/58974&quot;&gt;Whose rep is tied?&lt;/a&gt;&quot; and &quot;&lt;a href=&quot;https://codegolf.stackexchange.com/q/120142/58974&quot;&gt;PPCG's Unanswered Questions&lt;/a&gt;&quot; challenges; both require the requesting of multiple pages from the API but neither is improved by having that requirement nor would either be worse for the its removal.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="58974" LastActivityDate="2017-05-12T12:33:19.190" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12350" PostTypeId="2" ParentId="12347" CreationDate="2017-05-12T12:42:29.353" Score="1" Body="&lt;h2&gt;Proposal&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To solve the problem and as (with &lt;a href=&quot;https://codegolf.stackexchange.com/q/119907/58974&quot;&gt;very rare exception&lt;/a&gt;) live data is not required in order to complete API based challenges, I propose the creation of a website, built and maintained by the community, to implement the API as a search on SEDE's data dump, which is updated every week.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;How it would work&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A user posting a new &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stack-exchange-api&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stack-exchange-api&amp;#39;&quot; rel=&quot;tag&quot;&gt;stack-exchange-api&lt;/a&gt; challenge would enter the URL(s) of the API request required to complete the challenge, except under the domain of the website instead of that of Stack Exchange. e.g. instead of &#xA;&lt;code&gt;https://api.stackexchange.com/2.2/comments?order=desc&amp;amp;min=10&amp;amp;sort=votes&amp;amp;site=codegolf&lt;/code&gt; users would enter something like &lt;code&gt;https://semirrorapi.com/2.2/comments?order=desc&amp;amp;min=10&amp;amp;sort=votes&amp;amp;site=codegolf&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The site would then execute a database query to retrieve the response for that request.&lt;/li&gt;&#xA;&lt;li&gt;All Stack Exchange API questions would be required to use this website instead of the pfficial Stack Exchange API.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="39244" LastEditorUserId="39244" LastEditDate="2017-05-13T00:05:32.773" LastActivityDate="2017-05-13T00:05:32.773" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12351" PostTypeId="2" ParentId="2140" CreationDate="2017-05-12T13:02:50.990" Score="1" Body="&lt;h1&gt;Ah, Polish notation is always so confusing... [ABANDONED]&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;...so I order you to show me just how it works!&lt;sup&gt;That is, if you accept the challenge of course.&lt;/sup&gt; For example, I can't even determine if &lt;code&gt;xyz01&lt;/code&gt; is supposed to do &lt;code&gt;x(y(z(0)),1)&lt;/code&gt; or &lt;code&gt;x(y(z(0),1))&lt;/code&gt;, if I don't know the arities. And, even if I know the arities, I can't understand what &lt;code&gt;20121012100&lt;/code&gt; does in first glance (I have to think much to realize it's &lt;code&gt;2(0,1(2(1(0),1(2(1(0),0)))))&lt;/code&gt;). So, please, make my life easier.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Your challenge is, given a string, to &quot;aritify&quot; it. Here's how you do it:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First, you get a string (expression) containing up to 3 distinct chars, representing operators/functions with specific arities 0, 1 and 2.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then, you convert the string to function-call representation, separating arguments with &lt;code&gt;,&lt;/code&gt;s and enclosing them in &lt;code&gt;()&lt;/code&gt;s (e.g. &lt;code&gt;212110102010&lt;/code&gt; -&gt; &lt;code&gt;2(1(2(1(1(0)),1(0))),2(0,1(0)))&lt;/code&gt;). This is the string you will return.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You are guaranteed that you are only given one expression (e.g. never something like &lt;code&gt;120010&lt;/code&gt; -&gt; &lt;code&gt;1(2(0,0))1(0)&lt;/code&gt; which contains more than one expression as a whole). Also, the input will never be empty.&lt;/li&gt;&#xA;&lt;li&gt;There will not be missing trailing arguments, so something like &lt;code&gt;20&lt;/code&gt; -&gt; &lt;code&gt;2(0,the heck?)&lt;/code&gt; will never occur.&lt;/li&gt;&#xA;&lt;li&gt;You may choose any 3 chars for the arities (e.g. &lt;code&gt;n&lt;/code&gt; for 0, &lt;code&gt;m&lt;/code&gt; for 1, &lt;code&gt;d&lt;/code&gt; for 2), but you must specify them in your answer. You can't use any of &lt;code&gt;()[]&amp;lt;&amp;gt;{},;&lt;/code&gt; or space.&lt;/li&gt;&#xA;&lt;li&gt;For the brackets, you may choose any one of &lt;code&gt;()&lt;/code&gt;, &lt;code&gt;[]&lt;/code&gt;, &lt;code&gt;&amp;lt;&amp;gt;&lt;/code&gt; or &lt;code&gt;{}&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;For the argument separator, you may choose &lt;code&gt;,&lt;/code&gt;, &lt;code&gt;;&lt;/code&gt; or &lt;code&gt; &lt;/code&gt; (space). Also, the separator may have a trailing space, or both a trailing and a leading space, if it isn't a space. You must use a separator, it makes my life easier (how am I supposed to be able to read &lt;code&gt;211012101200&lt;/code&gt; as &lt;code&gt;2(1(1(0))1(2(1(0)1(2(00)))))&lt;/code&gt; instead of &lt;code&gt;2(1(1(0)),1(2(1(0),1(2(0,0)))))&lt;/code&gt;? It's not properly organized.)&lt;/li&gt;&#xA;&lt;li&gt;Chars defining arities must be outside the brackets, to the left, so something like &lt;code&gt;1200&lt;/code&gt; -&gt; &lt;code&gt;((0,02)1)&lt;/code&gt; or &lt;code&gt;((0,0)2)1&lt;/code&gt; is disallowed instead of &lt;code&gt;1(2(0,0))&lt;/code&gt;. I want to know what operator it is &lt;em&gt;before&lt;/em&gt; I start reading the arguments.&lt;/li&gt;&#xA;&lt;li&gt;The 0-arity operator must not have appended brackets (e.g. &lt;code&gt;210110&lt;/code&gt; -&gt; &lt;code&gt;2(1(0),1(1(0)))&lt;/code&gt;, not &lt;code&gt;2(1(0()),1(1(0())))&lt;/code&gt;), it's just useless cluttering that reduces simplicity, since you can always treat them as literals.&lt;/li&gt;&#xA;&lt;li&gt;You may not omit the operator names (e.g. &lt;code&gt;221010121100&lt;/code&gt; -&gt; &lt;code&gt;(((),()),(((()),)))&lt;/code&gt; is disallowed, &lt;code&gt;2(2(1(0),1(0)),1(2(1(1(0)),0)))&lt;/code&gt; is correct).&lt;/li&gt;&#xA;&lt;li&gt;The chars used for input must be the same as those used for output.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Most of these test cases are already in this post, I've just summed them up here and added some more. I used &lt;code&gt;012&lt;/code&gt; as arities, &lt;code&gt;()&lt;/code&gt;s as brackets and &lt;code&gt;,&lt;/code&gt; as separator here. &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input        -&amp;gt; Output&#xA;&#xA;20121012100  -&amp;gt; 2(0,1(2(1(0),1(2(1(0),0)))))&#xA;212110102010 -&amp;gt; 2(1(2(1(1(0)),1(0))),2(0,1(0)))&#xA;211012101200 -&amp;gt; 2(1(1(0)),1(2(1(0),1(2(0,0)))))&#xA;1200         -&amp;gt; 1(2(0,0))&#xA;210110       -&amp;gt; 2(1(0),1(1(0)))&#xA;221010121100 -&amp;gt; 2(2(1(0),1(0)),1(2(1(1(0)),0)))&#xA;10           -&amp;gt; 1(0)&#xA;0            -&amp;gt; 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Please comment if there's any error in the test-cases.&lt;/li&gt;&#xA;&lt;li&gt;How could I make this challenge better?&lt;/li&gt;&#xA;&lt;li&gt;Bumps: 3&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2017-08-08T10:18:41.657" LastActivityDate="2017-08-08T10:18:41.657" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12352" PostTypeId="2" ParentId="12339" CreationDate="2017-05-12T15:52:51.073" Score="16" Body="&lt;h1&gt;Machine code and assembly are different languages&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If you write a program in assembly, therefore, you can submit it two different ways: you can either submit the source code you enter into the assembler (an assembly language solution), or else submit the object code or executable that you get out of the assembler (a machine code solution). The header of your post would be, e.g., &quot;x86 assembly (&lt;code&gt;gas&lt;/code&gt;)&quot; or &quot;x86 machine code (Linux)&quot; in the two cases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Machine code solutions should typically come with a disassembly in order to make them easier to read, although that isn't technically speaking required.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that except on DOS (where the .COM file format has very little boilerplate), it's probably going to make more sense to submit a function rather than a full program due to the vast difference in boilerplate amount. In this case, you only have to submit the machine code for the function itself (including the &lt;code&gt;ret&lt;/code&gt; or equivalent at the end!), rather than an entire object file.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorDisplayName="user62131" LastEditDate="2017-06-21T01:29:06.690" LastActivityDate="2017-06-21T01:29:06.690" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12353" PostTypeId="2" ParentId="11978" CreationDate="2017-05-12T16:49:41.650" Score="1" Body="&lt;p&gt;Just to add a bit to the main answer: upvotes you receive beyond the rep cap are not entirely useless, as they'll cancel out subsequent unupvotes on an upvote you receive that day. (That is, when you get unupvoted, it's as though the original upvote never happened; but if you had &quot;extra&quot; upvotes that day, some of them can cover.)&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-05-12T16:49:41.650" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12354" PostTypeId="2" ParentId="2140" CreationDate="2017-05-12T16:52:41.650" Score="0" Body="&lt;h2&gt;An implementation of a game called Nomic &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Nomic&quot; rel=&quot;nofollow noreferrer&quot;&gt;Nomic&lt;/a&gt; is a game where you can change the rules. Humans are biased judges though, so let's have a computer run the rules! (Note that there are many variations of Nomic. Below is just one example.) Since you're minimalists, you want the original ruleset to be as short as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program first accepts as input a list of players. You must be able to accept any list of 2 to 16 unique alphanumeric usernames (you may assume that the list of players names are valid according to this criteria).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Next print &lt;code&gt;The name of this game is nomic. The goal is to get the last line of output of this program to be &quot;[username] is the winner!&quot;, where [username] is your username.&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, for each player print &lt;code&gt;[username], do you want to propose a revision to the rules? If so, type the revised code below:&lt;/code&gt; where &lt;code&gt;[username]&lt;/code&gt; is the player's username. (This input must be able to accept multiple lines.) If the input is empty, proceed to the next player.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If not, for each player print &lt;code&gt;[username], do you want to accept or reject this change to the rules?(y/n)&lt;/code&gt;, where &lt;code&gt;[username]&lt;/code&gt; is the player's username. (You may assume input to this will either be &lt;code&gt;y&lt;/code&gt; or &lt;code&gt;n&lt;/code&gt;.) If the number of &lt;code&gt;y&lt;/code&gt;s are more than the number of &lt;code&gt;n&lt;/code&gt;s, execute it (in the language you are writing the implemenation). If not, proceed with the next player.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the code executes without an error, the program ends. If not print &lt;code&gt;The ruleset proposed by [username] has crashed. The game will proceed with the original ruleset.&lt;/code&gt; where &lt;code&gt;[username]&lt;/code&gt; is the players username. Then proceed to the next player after them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note: After all the players have either proposed a rule or passed, start with the first player again.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. The shortest Nomic implementation wins! (You get 0 characters off your score if you show an example game you played with your friends. This bonus is doubled if all the revised rulesets are golfed.)&lt;/p&gt;&#xA;" OwnerUserId="16842" LastActivityDate="2017-05-12T16:52:41.650" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12357" PostTypeId="1" CreationDate="2017-05-12T21:46:10.463" Score="36" ViewCount="753" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Note&lt;/strong&gt;: In &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12298/62131&quot;&gt;this Meta question&lt;/a&gt;, it was determined that the correct thing to do if you think an established consensus has become outdated is to post a new question, even if the question would otherwise be considered a duplicate.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Background&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4878/62131&quot;&gt;current rule for defining a &quot;proper quine&quot;&lt;/a&gt; is as follows:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;It must be possible to identify a section of the program which encodes a different part of the program. (&quot;Different&quot; meaning that the two parts appear in different positions.)&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Furthermore, a quine must not access its own source, directly or indirectly.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;However, in the time since the precedent was set, several counterexamples have turned up that bring this consensus into question.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Known issues with the current definition&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Two literals which each print the other&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://github.com/TehFlaminTaco/Reverse-Programmer-Notation&quot; rel=&quot;nofollow noreferrer&quot;&gt;RProgN&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;&lt;a href=&quot;https://tio.run/nexus/rprogn#@2/IZfj/PwA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;RProgN – TIO Nexus&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://esolangs.org/wiki/7&quot; rel=&quot;nofollow noreferrer&quot;&gt;7&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;23723&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;&lt;a href=&quot;https://tio.run/nexus/7#@29kbG5k/P8/AA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;7 – TIO Nexus&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;A few languages (mostly stack-based languages) naturally process things at the right hand end of the program first. This means that if you write two literals into a program, you'll get the literals output in reverse order. This is something of an end-run around the aim to prevent a quine consisting only of literals; it's also inconsistent (the same rule would disallow the comparable solution in a language that prints literals from left to right).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A second issue with this is that it can lead to some absurd conclusions. Suppose the task were instead to write an order-2 cyclic quine (i.e. two programs that each output the other), but the two programs were allowed to be identical. You'd assume that any proper quine would also be a correct answer to this question, but with our current definition, quines like the above are no longer valid 2-cyclic quines (but would be valid 3-cyclic quines). A good proper quine definition would ideally avoid this sort of issue.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Literals which print themselves plus a no-op&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://github.com/Adriandmen/05AB1E&quot; rel=&quot;nofollow noreferrer&quot;&gt;05AB1E&lt;/a&gt;, 2 bytes&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;&lt;a href=&quot;https://tio.run/nexus/05ab1e#@2/I9f8/AA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;05AB1E – TIO Nexus&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://github.com/TryItOnline/TioSetup/wiki/Powershell&quot; rel=&quot;nofollow noreferrer&quot;&gt;PowerShell&lt;/a&gt;, 2 bytes&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;&lt;a href=&quot;https://tio.run/nexus/powershell#@2/I9f//17x83eTE5IxUAA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;PowerShell – TIO Nexus&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In both PowerShell and 05AB1E, an empty program prints nothing, and an integer prints itself followed by a newline. Additionally, a final newline is a no-op and has no effect; as a result, if we append the no-op to the literal, we get a proper quine by the current definition (because it's clear that the integer encodes the newline, rather than the newline encoding itself). On the other hand, it very much seems as though this sort of answer isn't in the spirit of proper quine competitions. (Interestingly, this loophole is one that people haven't widely tried to exploit, perhaps out of a sense of fair play.) It seems like a good proper quine definition would disallow this sort of thing.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Programs which explicitly print output that would have been printed implicitly&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This has only come up once naturally, in 7, and it requires the program to be expressed in binary (&lt;code&gt;7C&lt;/code&gt; &lt;code&gt;E7&lt;/code&gt;); thus the situation's somewhat hard to get your head around. Here's the description I gave in the comments of the old quine definition challenge:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A similar situation in more familiar syntax: suppose I have a programming language which prints every command as it's executed, with no newline, but always ensures that output has a final newline if it's missing one; is &lt;code&gt;print &quot;\n&quot;&lt;/code&gt; a quine?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The conclusion we came up with on discussion of this at the time is that our current definition of a proper quine doesn't handle this situation at all, not giving a clear answer on whether or not this is a proper quine. We'd want our definitions to handle all cases.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Uncertainty about what characters make up a literal&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://sourceforge.net/projects/cfunge/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Befunge-98 (&lt;code&gt;cfunge&lt;/code&gt;)&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 'k&amp;lt;@,k␇&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;(No TIO link, because this doesn't work on FBBI, the interpreter TIO uses.)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In this quine, the final 7 characters each encode themselves, and the first is a space. The space is produced from a string literal defined using &lt;code&gt;k'&lt;/code&gt;, and the string literal wraps around the program. String literals in Befunge-98 (at least in &lt;code&gt;cfunge&lt;/code&gt;) treat any wrap around the program as a single space character, and merge any string of consecutive whitespace into a single space. So is the space at the start of the program produced from the literal space, or from the wrap? Removing either the space, or the wrap, would still leave a space in the string. The current quine definition seems to assume that it's always possible to uniquely identify what characters in a program are responsible for producing a particular piece of data, but that's not always the case.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Kimian (error) quines&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;See &lt;a href=&quot;https://codegolf.stackexchange.com/q/36260/62131&quot;&gt;this question&lt;/a&gt; for a ton of examples of error quines. The basic problem here is that the error message being printed comes mostly from the language implementation, rather than from anything in the program. So what part of the program encodes it? Applying our current proper quine definition in this sort of situation is hard, and it's unclear whether error quines count by default.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that any new definition will have to take into account the fact that error messages often echo part of the source; this complicates attempts to determine whether the quine is literal-only (e.g. see the error quine at the end of &lt;a href=&quot;https://codegolf.stackexchange.com/a/51058/62131&quot;&gt;this post&lt;/a&gt;; the first line is clearly responsible for determining the content of the second, but it isn't exactly a string literal), and also raises questions as to whether the program is reading its own source.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, there's a defensible opinion that some people hold error quines are never proper quines, regardless of how they function. Clarity on this point would be useful.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Generalized quines which rearrange parts of the output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This problem was inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/q/122146/62131&quot;&gt;this challenge&lt;/a&gt;, which asks programs to output an anagram of themselves. In this sort of problem, how do you tell which parts of the input correspond to which parts of the output? It's possible to tell if all the characters of the program are unique, but if there are duplicates, you can't necessarily tell which character of the program was being printed by any particular character of the output.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Situations which are only informally defined at present&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Topological quines&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;See, for example, the current &lt;a href=&quot;https://codegolf.stackexchange.com/a/117526/62131&quot;&gt;Cubix recordholder&lt;/a&gt;. The basic idea is to exploit a language where the source code has unusual topology (like a cube or a torus), and wrap a string literal so that it goes entirely around the program, allowing the program to effectively read its own source code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But wait, I thought a proper quine wasn't allowed to access its own source, even indirectly? However, topological quines are typically accepted on PPCG. So the proper quine definition could really use clarifying to be clear as to whether or not this sort of case is allowed.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Reading the memory that contains your program&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When a program runs, it typically loads itself into memory as a memory image. Languages that use a parserless interpreter have that image identical to the program's source; this most commonly includes machine code and Befunge one-liners. &lt;a href=&quot;https://codegolf.stackexchange.com/a/8957/62131&quot;&gt;Here's&lt;/a&gt; an example (the question is basically &quot;write code that compiles into a quine&quot;; thus, the compiled output of the linked answer is a quine, even though the answer itself is not a quine).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some languages also give access to this memory, e.g. Befunge's &lt;code&gt;g&lt;/code&gt; instruction (or in machine code, the fact that the code segment is addressable). This is commonly used in machine code for defining the equivalent of a string literal (in fact, it's what string literals compile into). Modern OSes tend to have a separate &quot;read-only data&quot; section for this sort of constant, but using it is just a guideline, rather than a rule, and you can actually mix all the code and data together if you want to.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So the question is, under what circumstances can this sort of memory-reading instruction be used in a proper quine? The current consensus appears to be &quot;you can read any part of your program image that isn't actually executed&quot;, but that doesn't seem to be stated anywhere in the quine definition.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Situations which our current definition handles, but new definitions need to take into account&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Literal-only quines&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;One of the two most common cheats (other than reading your source from disk), that we'd want to disallow in a quine definition, is the literal-only quine: write a literal (typically a number, although some languages allow almost anything in literals), and have it implicitly printed. &lt;a href=&quot;https://codegolf.stackexchange.com/a/108142/62131&quot;&gt;This answer&lt;/a&gt; contains a listing of many languages which do this (together with a few that don't).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Literal-only quines are considered improper, and in fact much of the reason we have a proper quine definition is to try to exclude them in an unambiguous way.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Eval quines&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt;, 6 bytes&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;“ØV”ṘV&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;&lt;a href=&quot;https://tio.run/nexus/jelly#@/@oYc7hGWGPGuY@3Dkj7P9/AA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Jelly – TIO Nexus&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://esolangs.org/wiki/A_Pear_Tree&quot; rel=&quot;nofollow noreferrer&quot;&gt;A Pear Tree&lt;/a&gt;&lt;/strong&gt; / &lt;strong&gt;&lt;a href=&quot;https://docs.python.org/3/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Python&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a= &quot;print('a=',repr(a),';eval(a)#r3TQJ')&quot; ;eval(a)#r3TQJ&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;&lt;a href=&quot;https://tio.run/nexus/a-pear-tree#@59oq6BUUJSZV6KhnmirrlOUWlCkkaipo26dWpaYA2QpFxmHBHqpayopoIpw/f8PAA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;A Pear Tree – TIO Nexus&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The basic idea behind an eval quine is to write basically the entire program inside a string literal, then evaluate the string literal, giving the program an effective method of seeing most of its own source. Unlike most traditional quines, you therefore have to write most of the program only once, rather than the normal twice. We currently accept this sort of thing as a proper quine. However, disallowing it is also a defensible opinion (that is seen every now and then), because the same characters are used as both code or data. A good proper quine definition needs to come to an opinion on whether or not we want to accept this sort of thing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It should be noted that banning &lt;code&gt;eval&lt;/code&gt; and friends outright is probably a bad idea, because some languages (e.g. Underload, Muriel) require &lt;code&gt;eval&lt;/code&gt;-alikes to do any nontrivial control flow.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Self-quoting programs&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In some languages, e.g. 7, the initial content of memory is taken from the program itself, and the interpreter proceeds via evaluating copies of that memory. So, for example, something which (in more normal syntax) could be written as &lt;code&gt;print; exit; &lt;i&gt;anything&lt;/i&gt;&lt;/code&gt; would be, effectively, an eval quine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This sort of program is unambiguously disallowed under the current quine definition; in general, though, it falls into a grey area &lt;em&gt;both&lt;/em&gt; in terms of being literal-only, &lt;em&gt;and&lt;/em&gt; in terms of reading its own source. (The current definition treats it like a literal-only program, although it's clearly a bit different in nature from those.) It should be noted that unlike a typical literal-only quine, this sort of program is a universal quine constructor; you can add extra code to it in order to produce a generalised quine that outputs any function of its source code.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The question&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;How can we improve, or outright replace, our current proper quine definition so that it can handle all these edge cases with respect to what should count as a quine?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that it seems likely that most proposed definitions will use different rules to disallow literal-only improper quines and source-code-reading improper quines, via some definition of &quot;literal-only&quot; and some definition of &quot;source-code-reading&quot;. This means that the best possible solution may involve mixing parts of different quine definitions, meaning that they should likely be posted in different posts; in other words, we're voting on parts of a quine definition here, rather than on complete definitions.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorDisplayName="user62131" LastEditDate="2017-05-23T07:32:21.827" LastActivityDate="2017-05-23T07:32:21.827" Title="We need a new proper quine definition" Tags="|discussion|quine|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12358" PostTypeId="2" ParentId="12357" CreationDate="2017-05-12T21:51:15.387" Score="11" Body="&lt;h1&gt;A proper quine must contain data that encodes both itself, and something else&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4878/62131&quot;&gt;current quine definition&lt;/a&gt; has the following phrase:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;It must be possible to identify a section of the program which encodes a different part of the program. (&quot;Different&quot; meaning that the two parts appear in different positions.)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Although it doesn't fix all the problems with the definition, several potential issues (such as programs that rearrange themself) can be fixed like this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;It must be possible to identify a section of the program which encodes both itself, and also a different part of the program. (&quot;Different&quot; meaning that the two parts appear in different positions.)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Improving further on this would likely require an objective definition of &quot;encodes&quot;, or else a replacement with some entirely different method of preventing literal-only quines. However, this seems to me like it's mostly just a straight improvement of the current definition, and thus would seem like a step forwards until/unless we think of something that works better.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-05-12T21:51:15.387" CommentCount="18" ContentLicense="CC BY-SA 3.0" />
  <row Id="12360" PostTypeId="1" AcceptedAnswerId="12361" CreationDate="2017-05-12T23:20:52.130" Score="1" ViewCount="63" Body="&lt;p&gt;Just like the title, can we call another external script if that saves some bytes?&lt;/p&gt;&#xA;" OwnerUserId="66012" LastEditorUserId="46271" LastEditDate="2017-05-12T23:59:55.047" LastActivityDate="2017-05-13T00:12:09.980" Title="Batch - Can we call another script?" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12361" PostTypeId="2" ParentId="12360" CreationDate="2017-05-13T00:12:09.980" Score="0" Body="&lt;h1&gt;Yes, in certain cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You can't call another script you write yourself, but executing another &lt;em&gt;scripting language&lt;/em&gt;, or any other publicly available program is fine. All that means is that you have to add the name of the language to the languages your submission uses, e.g. instead of:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Batch, 26 bytes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;it would be something like&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Batch + Perl, 26 bytes&lt;/h1&gt;&#xA;" OwnerUserId="39244" LastActivityDate="2017-05-13T00:12:09.980" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12364" PostTypeId="2" ParentId="12220" CreationDate="2017-05-13T04:33:54.717" Score="-1" Body="&lt;h1&gt;Why Host It Externally?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9498/26997&quot;&gt;Should administrative content hosted on external sites ever be binding?&lt;/a&gt;&#xA;Current top answer says no.&lt;/p&gt;&#xA;&lt;p&gt;Why put the chatiquette on github rather than in a meta post all privileged PPCG users can maintain?&lt;/p&gt;&#xA;&lt;p&gt;Who maintains the github chatiquette when the users with permissions for it are no longer interested in PPCG? What if a new mod would like to edit it but would prefer not to make a github account?&lt;/p&gt;&#xA;&lt;p&gt;There are already several mods and TNB room owners who no longer frequent PPCG.&lt;/p&gt;&#xA;&lt;p&gt;I'm not talking formality of informality. Make the rules as soft or hard as seems right. Just, what happens if all the mods and RO's suddenly succumb to Pythonitis? How does the community take over without being able to maintain established rules?&lt;/p&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-13T04:33:54.717" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12365" PostTypeId="2" ParentId="2140" CreationDate="2017-05-13T09:21:31.080" Score="1" Body="&lt;h1&gt;Output &quot;Hello, World!&quot;... Even before it runs?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;Please note that this challenge only applies to languages that have a build stage and a build log.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output &quot;Hello, World!&quot; to the build log. The program may or may not be compiled successfully, the job is to just output &quot;Hello, World!&quot; somewhere in the build log.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Example (C/C++)&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#pragma message(&quot;Hello, World!&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="64499" LastActivityDate="2017-05-13T09:21:31.080" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12368" PostTypeId="2" ParentId="2140" CreationDate="2017-05-13T14:27:59.903" Score="0" Body="&lt;h1&gt;Compute Area of Convex Hull of Roots of Polynomial&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polynomial&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polynomial&amp;#39;&quot; rel=&quot;tag&quot;&gt;polynomial&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a nonzero polynomial with integer coefficients, find the area of the convex hull of the complex roots of the polynomial.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;p&gt;The polynomial can be given in any reasonable format, e.g. as a list of coefficients. The area must be correct to 4 significant figures. You can assume that the degree of the polynomial is no larger than 8, and that the coefficients are less than &lt;code&gt;8^8 = 16777216&lt;/code&gt;, (and by Rouché's theorem the roots have therefore an absolute value of less than &lt;code&gt;8^8 + 1&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&lt;p&gt;The polynomial &lt;code&gt;x^4 - 1 &lt;/code&gt; has the roots &lt;code&gt;{1,-1,i,-i}&lt;/code&gt; which form the vertices of their convex hull, which is a square of sidelength &lt;code&gt;sqrt(2)&lt;/code&gt; so the total area is &lt;code&gt;2&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The polynomial &lt;code&gt;x^5 - x&lt;/code&gt; has the roots &lt;code&gt;{1,-1,i,-i,0}&lt;/code&gt;. But the convex hull is again given by the vertices points &lt;code&gt;{1,-1,i,-i}&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The constant polynomial &lt;code&gt;1&lt;/code&gt; has no roots, and therefore the convex hull of its roots is empty.&lt;/p&gt;&#xA;&lt;p&gt;The polynomial &lt;code&gt;x^2 - 1&lt;/code&gt; has the roots &lt;code&gt;{1,-1}&lt;/code&gt;, so their convex hull is just a line segment, which has no area.&lt;/p&gt;&#xA;&lt;p&gt;In the following the polynomials are given as a list of coefficient of the monomials in descending degree. (i.e. the constant comes last)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1,2,3,4,1] 2.0382&#xA;[1,2,3,4,5] 3.5830&#xA;[1,-1,1,-1] 1.0000&#xA;[a,b] 0 (where a != 0 and b arbitrary)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-13T14:47:42.490" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12374" PostTypeId="1" CreationDate="2017-05-14T16:21:15.000" Score="4" ViewCount="157" Body="&lt;p&gt;I am currently developing a new language and thought that catalogue questions such as &lt;a href=&quot;https://codegolf.stackexchange.com/q/55422/69279&quot;&gt;Hello, World!&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/q/69/69279&quot;&gt;Golf you a Quine for great good&lt;/a&gt; are good challenges that a language should be able to do.&lt;/p&gt;&#xA;&lt;p&gt;However, it can be kinda difficult to find all the catalogues as they aren't all linked and not always the most upvoted.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, I would like this question to be a &amp;quot;catalogue&amp;quot; of the catalogue questions. Below is a list of all catalogue questions. If you can't find a catalogue that you &lt;strong&gt;know&lt;/strong&gt; meets the criteria, feel free to add it below.&lt;/p&gt;&#xA;&lt;p&gt;For clarity, a catalogue challenge is one with a Stack Snippet (or Catalogue) at the bottom and/or has the rule&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Unlike our usual rules, feel free to use a language (or language version) even if it's newer than this challenge. If anyone wants to abuse this by creating a language where the empty program generates , then congrats for paving the way for a very boring answer.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Catalogues&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/84260/69279&quot;&gt;Add two numbers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/69/69279&quot;&gt;Golf you a quine for great good!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/57617/69279&quot;&gt;Is this number a prime?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/58615/69279&quot;&gt;1, 2, Fizz, 4, Buzz&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/55422/69279&quot;&gt;&amp;quot;Hello, World!&amp;quot;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/85/66833&quot;&gt;Fibonacci function or sequence&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/62732/66833&quot;&gt;Implement a Truth-Machine&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/62230/66833&quot;&gt;Simple cat program&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/59347/66833&quot;&gt;Shortest infinite loop producing no output&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user69279" LastEditorUserId="68942" LastEditDate="2021-04-03T20:29:14.677" LastActivityDate="2021-04-03T20:29:14.677" Title="Catalogue of Catalogues" Tags="|discussion|" AnswerCount="0" CommentCount="7" FavoriteCount="0" CommunityOwnedDate="2017-05-14T17:11:16.733" ContentLicense="CC BY-SA 4.0" />
  <row Id="12380" PostTypeId="1" CreationDate="2017-05-14T17:04:46.870" Score="2" ViewCount="117" Body="&lt;p&gt;Some languages do not have native ways of representing polynomials, others do. Many times a list of coefficients (in one or the other order) works well. &#xA;In order to avoid explicitly specifying this over and over again in all &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polynomials&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polynomials&amp;#39;&quot; rel=&quot;tag&quot;&gt;polynomials&lt;/a&gt; challenge, I'd like add that to the tag info.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please add your suggestions for default representations.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastActivityDate="2023-11-03T02:30:19.370" Title="default format for [polynomials]" Tags="|discussion|" AnswerCount="5" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12381" PostTypeId="2" ParentId="12380" CreationDate="2017-05-14T17:05:40.940" Score="3" Body="&lt;h3&gt;Default representation in [language]&lt;/h3&gt;&#xA;&lt;p&gt;Many langauges, especially ones that include a CAS have native ways of representing polynomials.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-14T17:05:40.940" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12382" PostTypeId="2" ParentId="12380" CreationDate="2017-05-14T17:06:53.633" Score="5" Body="&lt;h3&gt;List of coefficients&lt;/h3&gt;&#xA;&lt;p&gt;A list of coefficients&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;in ascending order &lt;code&gt;[a(0),a(1),a(2),...,a(n)]&lt;/code&gt; OR&lt;/li&gt;&#xA;&lt;li&gt;in descending order &lt;code&gt;[a(n),a(n-1),...,a(0)]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If the degree is known, it may be zero padded as&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[a(0),...,a(n),0,...,0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[0,...,0,a(n),...,a(0)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-14T18:47:27.333" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12384" PostTypeId="2" ParentId="12380" CreationDate="2017-05-14T20:32:57.290" Score="-1" Body="&lt;h2&gt;Beware function representations&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Be careful about allowing a polynomial to be represented by a function that computes it, in languages where functions are objects. For example, in Python the polynomial &lt;code&gt;3*x^2+2&lt;/code&gt; could be represented by the function object &lt;code&gt;lambda x:3*x*x+2&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Take the &lt;a href=&quot;https://codegolf.stackexchange.com/q/78334/20260&quot;&gt;challenge to compose polynomials&lt;/a&gt;. One could submit&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Haskell, 3 bytes&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-haskell prettyprint-override&quot;&gt;&lt;code&gt;(.)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;.&lt;/code&gt; is Haskell's function composition operator: if &lt;code&gt;f&lt;/code&gt; and &lt;code&gt;g&lt;/code&gt; are functions, then &lt;code&gt;f.g&lt;/code&gt; is a function that takes &lt;code&gt;x&lt;/code&gt; to &lt;code&gt;f(g(x))&lt;/code&gt;. This would cut off the possibility for &lt;a href=&quot;https://codegolf.stackexchange.com/a/78358/20260&quot;&gt;a much more interesting answer&lt;/a&gt; in the coefficient list representation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even a wordy language like Python could do better with&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;lambda f,g:lambda x:f(g(x))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2017-05-15T09:27:04.840" LastActivityDate="2017-05-15T09:27:04.840" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12386" PostTypeId="2" ParentId="2140" CreationDate="2017-05-14T22:37:04.380" Score="-2" Body="&lt;h1&gt;Add numbers without math functions.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you must take an input that can take at least 10 numbers separated by commas and add them together without addition, subtraction, multiplication, and division symbols. Least bytes win. Normal code golf rules apply.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1,2,3,4,5,6,7,8,9,10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;55&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1,1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="65989" LastEditorUserId="65989" LastEditDate="2017-05-15T00:50:19.310" LastActivityDate="2017-05-15T00:50:19.310" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12387" PostTypeId="2" ParentId="2140" CreationDate="2017-05-14T23:15:49.513" Score="0" Body="&lt;h1&gt;Hidden Strings&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;This is real rough, I just wanted to get the idea down.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;The &lt;code&gt;strings&lt;/code&gt; utility that comes on many GNU/Linux distros finds the strings in executables and lists them. The goal of this challenge is to write a program that has a null-terminated string in the compiled executable (compiled languages only, sorry) but that string does not appear in the source. The scoring is the ratio of the length of the hidden string to the size of your source code.&lt;/p&gt;&#xA;&lt;p&gt;The following constraints apply:&lt;/p&gt;&#xA;&lt;p&gt;The string must be entirely dictionary words from &lt;code&gt;todo&lt;/code&gt; dictionary with length greater than 2 concatenated together without spaces and without punctuation. If &lt;code&gt;xyz&lt;/code&gt; and &lt;code&gt;abc&lt;/code&gt; are words in the dictionary, the following is a valid string: &lt;code&gt;xyzabcxyzabc&lt;/code&gt;, but the following is not &lt;code&gt;xyabcz&lt;/code&gt; (assuming that it is not a concatenation of other strings in the dictionary). For those of you who care, if &lt;code&gt;E&lt;/code&gt; is the dictionary of words of length greater than 2, then strings must be in &lt;code&gt;E*&lt;/code&gt; where &lt;code&gt;*&lt;/code&gt; is the Kleene star.&lt;/p&gt;&#xA;&lt;p&gt;&amp;quot;Hidden&amp;quot; means that the string and its substrings may not appear as strings or characters in your source. &lt;em&gt;This definition needs a bunch of work&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;This challenge was supposed to be something like &amp;quot;Hey, how would you hide a funny string so that it doesn't appear obviously in the source, but does appear when someone looks at the executable&amp;quot;. I welcome all suggestions because as I have it currently stated, I think there are a lot of problems.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="45459" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-14T23:15:49.513" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12388" PostTypeId="1" CreationDate="2017-05-15T01:06:42.630" Score="7" ViewCount="188" Body="&lt;p&gt;Currently on the defaults for IO &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11908/56656&quot;&gt;this answer&lt;/a&gt; is does not have enough positive votes to be instated.  At press time it has &lt;s&gt;+11-6&lt;/s&gt; +18-9, defaults are required to have:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;5 net votes and at least twice as many upvotes as downvotes.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;However only a day ago this method was valid (If memory serves it was +10-2).  In fact it has changed at twice today as far as I can tell. And since this question has been asked it has continued to fluctuate between valid and invalid.  This has the strange consequence of making it a default for some questions but not others, depending on the time they were posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This would be bad enough but to make matters worse we can't know when it was a default and when it was not because voting records are not kept, or at least are not accessible.  We can only make guesses or try to remember.  And users with insufficient reputation can't even look at the votes to tell if it is a consensus.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What should we do about answers that are bordering between valid and invalid causing them to fluctuate between allowed and disallowed by default?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-05-21T22:59:16.047" LastActivityDate="2017-05-21T22:59:16.047" Title="What to do about a fluctuating consensus?" Tags="|discussion|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12392" PostTypeId="1" AcceptedAnswerId="12393" CreationDate="2017-05-15T10:50:39.690" Score="2" ViewCount="138" Body="&lt;p&gt;I have answered a challenge and the code ended up being longer than expected. I'm also pretty sure there is still room for golfing the code but I can't see it at the moment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it okay to ask a question asking for tips on how I can golf it here? Is that covered by this site or is there somewhere else I can ask?&lt;/p&gt;&#xA;" OwnerUserId="38550" LastActivityDate="2017-05-15T10:54:19.863" Title="Can I ask about improving golfing on some code" Tags="|discussion|support|asking-questions|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12393" PostTypeId="2" ParentId="12392" CreationDate="2017-05-15T10:54:19.863" Score="7" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1724/8478&quot;&gt;Yes, these are on topic.&lt;/a&gt; And we've had a few of them in the past, some of which were really well received. But don't be surprised if you get some close votes or downvotes first. Some people seem to think anything that's a question (as opposed to a challenge) belongs on Stack Overflow, or they'll think it's a badly written language-specific challenge. It might help if you make very clear that you've written some golfed code and you're interested in how it could be shortened further to pre-empt that situation a bit.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2017-05-15T10:54:19.863" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12397" PostTypeId="2" ParentId="2140" CreationDate="2017-05-15T15:56:02.880" Score="0" Body="&lt;h1&gt;Write a TIO bot&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program/function which:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Takes three strings &lt;em&gt;Language&lt;/em&gt;, &lt;em&gt;Code&lt;/em&gt;, and &lt;em&gt;Input&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Do one of the following:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Assume access to a browser open on &lt;code&gt;https://tio.run/nexus/&lt;/code&gt;; click &lt;code&gt;[data-id=&quot;&lt;/code&gt;&lt;em&gt;Language&lt;/em&gt;&lt;code&gt;&quot;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Go to &lt;code&gt;https://tio.run/nexus/&lt;/code&gt;&lt;em&gt;Language&lt;/em&gt;&lt;code&gt;/&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;Enters &lt;em&gt;Code&lt;/em&gt; in the &lt;code&gt;&amp;lt;textarea id=&quot;code&quot;&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Enters &lt;em&gt;Input&lt;/em&gt; in the &lt;code&gt;&amp;lt;textarea id=&quot;input&quot;&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Clicks the &lt;code&gt;&amp;lt;span id=&quot;run&quot;&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Waits for any of these things to happen:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;lt;textarea class=&quot;output&quot;&amp;gt;&lt;/code&gt; changes&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;lt;textarea id=&quot;debug&quot;&amp;gt;&lt;/code&gt; changes&lt;/li&gt;&#xA;&lt;li&gt;60 seconds pass&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;Returns/prints the content of &lt;code&gt;&amp;lt;textarea class=&quot;output&quot;&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Alternatively, you may use the TIO API.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2017-05-15T18:30:00.747" LastActivityDate="2017-05-15T18:30:00.747" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12400" PostTypeId="1" CreationDate="2017-05-15T19:16:57.087" Score="4" ViewCount="99" Body="&lt;p&gt;I wrote a solution to a code golf challenge that included the string &lt;code&gt;&quot;....      ....&quot;&lt;/code&gt;. This exact number of dots and spaces was necessary for the solution to work.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Two users commented (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/120216/loading-forever-windows-style/120321#comment296106_120321&quot;&gt;here&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/120216/loading-forever-windows-style/120321#comment296324_120321&quot;&gt;here&lt;/a&gt;) on ways to golf it down. I tested their suggestions and found that they didn't work. Initially I thought the users were confused; Then I tried to write a comment:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;@User That doesn't work; Did you mean for the string to be &lt;code&gt;&quot;....      ....&quot;&lt;/code&gt;?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;And it rendered as:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;@User That doesn't work; Did you mean for the string to be &lt;code&gt;&quot;.... ....&quot;&lt;/code&gt;?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Is this intentional? If so, why? It has surely caused problems like this before. However, it looks like a bug to me. In posts, multiple spaces in backtick code blocks render as expected.&lt;/p&gt;&#xA;" OwnerUserId="61563" LastEditorUserId="68942" LastEditDate="2021-06-03T23:35:12.163" LastActivityDate="2021-06-03T23:35:12.163" Title="Multiple spaces not showing up in comment code-blocks" Tags="|support|bug|status-completed|comments|" AnswerCount="1" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="12402" PostTypeId="2" ParentId="12400" CreationDate="2017-05-15T21:04:09.133" Score="2" Body="&lt;p&gt;As a workaround, you can make each character a different type of space; e.g. alternate normal and non-breaking spaces:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;space&amp;gt;&amp;lt;nbsp&amp;gt;&amp;lt;space&amp;gt;&amp;lt;nbsp&amp;gt;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;@edit: As @ETHproductions points out, simply use all non-breaking space.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Non-breaking_space#Keyboard_entry_methods&quot; rel=&quot;nofollow noreferrer&quot;&gt;wikipedia article&lt;/a&gt; lists several entry methods in various environments.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastEditorUserId="11259" LastEditDate="2017-05-15T21:10:53.053" LastActivityDate="2017-05-15T21:10:53.053" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="12403" PostTypeId="1" CreationDate="2017-05-15T21:20:49.100" Score="11" ViewCount="261" Body="&lt;p&gt;Note: we had a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9886/42545&quot;&gt;similar discussion&lt;/a&gt; a while back, but the scope of this question is slightly different and aims to provoke action rather than just being a discussion.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Most questions currently tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; fall into one of these categories:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Challenges about producing a fixed output, whether &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; or not. Examples include:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/6043&quot;&gt;We&amp;#39;re no strangers to code golf, you know the rules, and so do I&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/58615&quot;&gt;1, 2, Fizz, 4, Buzz&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/64198&quot;&gt;&amp;quot;99 Bottles of Beer&amp;quot;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/88653&quot;&gt;Print a 10 by 10 grid of asterisks&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/98701&quot;&gt;This is my pillow&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/99026&quot;&gt;Build me a brick wall!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/86986&quot;&gt;Lots&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/q/87064&quot;&gt;and&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/q/87496&quot;&gt;lots&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/q/89283&quot;&gt;and&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/q/89725&quot;&gt;lots&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/q/90497&quot;&gt;of&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/q/90798&quot;&gt;alphabet&lt;/a&gt;-&lt;a href=&quot;https://codegolf.stackexchange.com/q/97456&quot;&gt;art&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/q/97651&quot;&gt;challenges&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Challenges about producing a non-fixed output that matches a certain criterion. Examples:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/99913&quot;&gt;5 Favorite Letters&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/118922&quot;&gt;Words with Blocks&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/101727&quot;&gt;Please do my Martian homework&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/109502&quot;&gt;Create an Alphabet Song&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/97305&quot;&gt;Print some JSON&lt;/a&gt; (not tagged with KC, but very similar to the other examples)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; challenges that require input. Examples:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/77782&quot;&gt;Build a triangle without any triangles&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/90287&quot;&gt;The IHIH Pyramid&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/92834&quot;&gt;Counting Goats to Sleep&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/93589&quot;&gt;Print a layered cake&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/95268&quot;&gt;Let&amp;#39;s draw some Atari ST bombs!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/106820&quot;&gt;Print a cube net of the specified size&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/120686&quot;&gt;Mow a Rectangular Lawn&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Challenges about mapping a finite number of inputs to fixed outputs. Sometimes there are only a few possible inputs, sometimes the input can be broken up into parts. Examples:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/112701&quot;&gt;Code golf for my real friends&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/117737&quot;&gt;Translate numbers to French&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/117711&quot;&gt;Displaying n with n&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/116507&quot;&gt;Turn me 22.5 with a rose&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/113700&quot;&gt;Convert Input to Direction&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/120552&quot;&gt;Name the Hadrons&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/115975&quot;&gt;How fast is my Hot Wheels car?&lt;/a&gt; (the KC aspect here is a subset of the challenge)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;(Note: challenges mapping &lt;em&gt;infinite&lt;/em&gt; (or nearly infinite) inputs to a few fixed outputs are generally tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/classification&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;classification&amp;#39;&quot; rel=&quot;tag&quot;&gt;classification&lt;/a&gt;, or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; if there are only two possible outputs.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, at the top of the &lt;a href=&quot;https://codegolf.stackexchange.com/tags/kolmogorov-complexity/info&quot;&gt;kolmogorov-complexity tag wiki&lt;/a&gt;, it currently states:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Use this tag for questions about producing a constant output.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;And toward the bottom:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; is not about challenges that produce a string that varies depending on a parameter! These challenges, such as &lt;a href=&quot;http://codegolf.stackexchange.com/q/49671&quot;&gt;Do you want to code a snowman?&lt;/a&gt; should usually be tagged with ascii-art or string, or most likely both.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;By this definition, challenges in group 1 obviously qualify for the KC tag. Group 2 is slightly fuzzy, but can also be considered within the definition of &quot;producing a constant output&quot;; you're just choosing the output. But groups 3 and 4 are clearly outside the defined scope of the KC tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Something here has to change. My question is, what? Should we re-categorize/re-tag challenges in groups 3 and 4, possibly creating a new tag or two for this purpose? Or should the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; tag wiki be amended to include groups 3 and/or 4?&lt;/p&gt;&#xA;" OwnerUserId="42545" LastEditorUserId="42545" LastEditDate="2017-05-15T21:38:46.467" LastActivityDate="2017-05-16T11:32:27.850" Title="Conflict between kolmogorov-complexity tag wiki and usage" Tags="|discussion|tags|kolmogorov-complexity|" AnswerCount="5" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12405" PostTypeId="2" ParentId="12403" CreationDate="2017-05-15T22:27:19.467" Score="0" Body="&lt;h1&gt;We should re-categorize and re-tag group 3 and 4 challenges.&lt;/h1&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; tag wiki explicitly states:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Use this tag for questions about producing a constant output.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Google defines constant as:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;a situation or state of affairs that &lt;strong&gt;does not change.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;So we can reword the tag wiki as:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Use this tag for questions about producing output that does not change.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Therefore, I think Kolmogorov complexity challenges should not require input that changes the output. If they require input that changes the output, then that directly violates the reworded tag wiki of Kolmogorov complexity, because the output is &amp;quot;changing&amp;quot;, and Kolmogorov complexity should &amp;quot;not change.&amp;quot;&lt;/p&gt;&#xA;" OwnerUserId="64159" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-15T22:27:19.467" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12406" PostTypeId="2" ParentId="12403" CreationDate="2017-05-15T22:47:29.543" Score="8" Body="&lt;h1&gt;Group 4 deserves a tag of its own&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Although I tend to personally not enjoy pure &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenges (i.e. group 1), I very much like &quot;reverse kolmogorov complexity&quot; challenges, where you take one of a large number of options as input, and produce corresponding output, but the output is much simpler than the input. (I wrote one of these challenges &lt;a href=&quot;https://codegolf.stackexchange.com/q/105303/62131&quot;&gt;here&lt;/a&gt;, but there are others around.) This is pretty much group 4, as defined here (or possibly a subset of it).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think this sort of puzzle is &lt;em&gt;not&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;, but that it deserves its own categorisation (I often use &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/classification&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;classification&amp;#39;&quot; rel=&quot;tag&quot;&gt;classification&lt;/a&gt;, but it doesn't always apply and it's more general). I've seen other people agree with this point of view in comments, too. (Thinking up an appropriate name is hard, though.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm less certain as to what should be done with group 3 (I'm less experienced with those sorts of challenges), so I won't take an opinion on it on this post (except that the eventual choice should not be to tag them the same way as group 4).&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-05-15T22:47:29.543" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12408" PostTypeId="2" ParentId="12403" CreationDate="2017-05-16T06:38:04.857" Score="5" Body="&lt;p&gt;The edits which produced the current tag wiki jumped the gun. People with enough rep to see deleted posts can see that there's an answer in the earlier discussion you linked where OP says that he has edited the tag wiki. This answer seems to have been deleted in response to criticism that he should wait for the discussion to be over, so I'm not sure why he didn't roll back the changes at the same time as deleting the answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I propose the following rewrite, based on the previous version of the tag wiki:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;From &lt;a href=&quot;http://en.wikipedia.org/wiki/Kolmogorov_complexity&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;:&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;In algorithmic information theory (a subfield of computer science), the Kolmogorov complexity of an object, such as a piece of text, is a measure of the computational resources needed to specify the object.&#xA;  For example, the string &quot;abababababababababababababababababababab&quot; has a low Kolmogorov complexity because it can be produced with a simple loop:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;take 40 $ cycle &quot;ab&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;On the other hand, &quot;4c1j5b2p0cv4w1x8rx2y39umgw5q85s7uraqbjfd&quot; has a high Kolmogorov complexity, and the shortest way to produce it would (most likely) be to just print it literally:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;4c1j5b2p0cv4w1x8rx2y39umgw5q85s7uraqbjfd&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;In the context of code-golf, Kolmogorov complexity is a challenge to compress a specified string or dataset, so a post should be tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; iff the bulk of the challenge is to produce a string or a subset of a dataset which is given in the question.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Examples:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/6043&quot;&gt;We&amp;#39;re no strangers to code golf, you know the rules, and so do I&lt;/a&gt; asks for a fixed output which has lots of structure, and is the canonical question for strings which are suited to grammar-based compression&lt;/li&gt;&#xA;  &lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/9070&quot;&gt;Normal distribution values&lt;/a&gt; asks for a fixed output which can be generated mathematically&lt;/li&gt;&#xA;  &lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/9037&quot;&gt;Who&amp;#39;s that Pok&amp;#233;mon?&lt;/a&gt; asks for an extract from a dataset, so the bulk of the challenge is to compress an array of strings&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;  &#xA;  &lt;p&gt;Kolmogorov complexity is undecidable. However, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; questions effectively crowd-source the approximation of it.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Good &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenges add something new to previous challenges.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Note that this only really explicitly addresses your group 1 and part of group 4, but IMO &lt;a href=&quot;https://codegolf.stackexchange.com/q/120552&quot;&gt;Name the Hadrons&lt;/a&gt; makes a much stronger case for belonging to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; than your group 2. Really group 4 is too broad. The claims to the tag would be:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Group 1: Kolmogorov complexity of a simple string&lt;/li&gt;&#xA;&lt;li&gt;Group 2: seem to be essentially Kolmogorov complexity meta-questions: find the element of this large set which has the lowest KC&lt;/li&gt;&#xA;&lt;li&gt;Group 3: string generation wrapped in a loop?&lt;/li&gt;&#xA;&lt;li&gt;Group 4a: Kolmogorov complexity of a dataset&lt;/li&gt;&#xA;&lt;li&gt;Group 4b: classification&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-05-16T06:38:04.857" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12409" PostTypeId="2" ParentId="2140" CreationDate="2017-05-16T09:00:40.903" Score="0" Body="&lt;h1&gt;Convert ambiguous dates to &amp;quot;the correct way&amp;quot; (YYYY-MM-DD)&lt;/h1&gt;&#xA;&lt;p&gt;A problem I run into often with spreadsheets of data is dealing with dates of unknown ordering.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/rP4Q8.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/rP4Q8.png&quot; alt=&quot;XKCD says it best&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to take a series of dates that are in one of the following three formats, and output them as YYYY-MM-DD:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;DD/MM/YYYY&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;MM/DD/YYYY&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;YYYY-MM-DD&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;No other date formats are acceptable.&lt;/p&gt;&#xA;&lt;p&gt;Since many dates are ambiguous, you must read all the dates to determine whether the set is MM/DD or DD/MM before outputting anything.&lt;/p&gt;&#xA;&lt;p&gt;Your program must also detect the following error conditions and return an error code instead (with no other output):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;-1&lt;/code&gt;: Unable to determine date ordering. (All dates provided could be DD/MM or MM/DD)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;-2&lt;/code&gt;: Inconsistent date ordering. (There are dates provided that are definitely DD/MM and others that are definitely MM/DD, within the same set).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;-3&lt;/code&gt;: Bad data. (There are things included that are not valid dates, as defined above, including things like 31/04/2017 and 12/1/1980).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For the purposes of this challenge, February always has 28 days, April, June, September and November have 30 days, and all others have 31 days. All years, from 0001 to 9999 are equivalent.&lt;/p&gt;&#xA;&lt;h2&gt;Sample input/output&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;['11/05/1988','12/12/1960'] =&amp;gt; -1&#xA;['15/05/1988','03/18/2001'] =&amp;gt; -2&#xA;['15/05/1988','31/06/1989'] =&amp;gt; -3&#xA;['15/05/1988','2014-02-02', '18/03/2001'] =&amp;gt; ['1988-05-15','2014-02-02', '2001-03-18']&#xA;['05/15/1988','03/18/2001'] =&amp;gt; ['1988-05-15','2001-03-18']&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;I/O&lt;/h2&gt;&#xA;&lt;p&gt;You can receive data in whatever way is normal for your language (line-separated stdin, array of strings, whatever). You may assume that the data you receive is of the correct type (ie, your array won't contain integers, nulls etc), but may contain empty strings.&lt;/p&gt;&#xA;&lt;p&gt;If outputting to standard output, errors can be sent to stderr, or as program termination code. If implementing a function, you can return an integer instead of an array, throw an error, or whatever seems natural.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;The score for your program is &lt;code&gt;L - 2Y + 20D&lt;/code&gt; where:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;L&lt;/code&gt; is the length of your code, in bytes&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Y&lt;/code&gt; is 2017 minus the year in which the first version of the language you're using was published.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;D&lt;/code&gt; is the number of times the letters 'date', in any case, appear consecutively in your code.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For the purpose of &lt;code&gt;Y&lt;/code&gt;, all versions of Lisp are 59, C is 39, C++ is 32, all EcmaScripts are 20 etc. Languages are considered the same if they have the same name (other than the version number). (No cheating by using some golf language that happens to be called C though.)&lt;/p&gt;&#xA;&lt;h2&gt;Tags&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;em&gt;(what else?)&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="30512" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-16T09:00:40.903" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12412" PostTypeId="2" ParentId="12403" CreationDate="2017-05-16T11:26:46.263" Score="-2" Body="&lt;h1&gt;Expand to Include Group 3&lt;/h1&gt;&#xA;&lt;p&gt;Many of the more interesting non-string compression &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenges, at least in my opinion, come from an output that varies (slightly or largely) based on an input.&lt;/p&gt;&#xA;" OwnerUserId="65836" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-16T11:26:46.263" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12413" PostTypeId="2" ParentId="12403" CreationDate="2017-05-16T11:32:27.850" Score="2" Body="&lt;h1&gt;Give Group 3 its Own Tag&lt;/h1&gt;&#xA;&lt;p&gt;Create a new tag for a challenge that wants a constant output that is affected by the input.&lt;/p&gt;&#xA;&lt;p&gt;My suggestion is to use &lt;code&gt;kolmogorov&lt;/code&gt; as the first word in the new tag, but change the second word for Group 3 challenges (&lt;code&gt;function&lt;/code&gt; seems to fit, but it would be very confusing).&lt;/p&gt;&#xA;" OwnerUserId="65836" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-16T11:32:27.850" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12415" PostTypeId="1" AcceptedAnswerId="12422" CreationDate="2017-05-16T13:17:00.940" Score="11" ViewCount="296" Body="&lt;p&gt;I recently posted two challenges. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/120686/mow-a-rectangular-lawn&quot;&gt;One of them I really really liked&lt;/a&gt;, and took some time and typing to finalize. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/120796/infinitely-print-zenos-dichotomy-paradox-1-2n&quot;&gt;The other&lt;/a&gt; I thought of on a whim and posted (after Sandbox, of course).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The difference? The first one was harder, and its explanation was a block of text. The second one was (relatively) trivial, and it had a short explanation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The harder one got no answers and 12 upvotes in 112 views, and was up for more than twice as long.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/fE26h.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/fE26h.png&quot; alt=&quot;harder challenge&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The easier one got 19 answers and 9 upvotes in 141 views.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Myqy9.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Myqy9.png&quot; alt=&quot;easier question&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It also just so happens that the easier challenge is currently in HNQ. Now, I believe that the easier challenge does have a place in PPCG and even in HNQ. However, I believe my harder challenge is much more interesting. I've posted similar harder or easier challenges in the past. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/116933/bernardino-identifies-unaltered-dollar-words&quot;&gt;My highest voted challenge&lt;/a&gt; was exceedingly trivial, and was on HNQ for quite some time. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/117894/split-words-split-words&quot;&gt;Another harder challenge&lt;/a&gt; did fairly well, probably because I put a significant bounty on it - but it never hit HNQ.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think there's a problem here, although I might not speak for the majority. I don't know if there's a solution, but we may as well have discussion about it. I'd like a way for harder challenges to receive some attention.&lt;/p&gt;&#xA;" OwnerUserId="65836" LastEditorUserId="46271" LastEditDate="2017-05-16T16:06:37.473" LastActivityDate="2017-05-17T13:37:24.130" Title="Harder/longer challenges don't get attention" Tags="|discussion|" AnswerCount="4" CommentCount="8" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12417" PostTypeId="2" ParentId="2140" CreationDate="2017-05-16T13:45:44.363" Score="0" Body="&lt;h2&gt;&lt;strong&gt;Be the Richest Mammut!&lt;/strong&gt;&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;The Game&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This game is an adaptation of a board game called Mammut, and basically an optimization problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each match contains five players and five rounds, in which every player participates. Every round starts with a bunch of tiles being flipped at random on one of their sides, and put in the middle stack&#xA;The tile composition will be fixed, but has not been completely decided yet There will be 30-35 of them, and each of them will have two different sides, with exactly 15 different types of tiles, and about half of those only having one single instance available.&#xA;A random player is chosen as the starting player for the first round, and performance will decide the starter for the following four rounds.&#xA;In order, each player that doesn't own any tiles will take an action, and this will keep going on until every player has at least one tile.&#xA;The actions available are:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Take an arbitrary number of tiles from the middle stack.&lt;/li&gt;&#xA;&lt;li&gt;Take all of the tiles owned by another player, and put one of them back in the middle stack.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Obviously, you can take the entire middle stack, but if there is at least one other player without tiles and you take too many, he will most likely steal your tiles right after.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Every player starts with 10 points, and if they end a scoring phase under zero, they will be given enough free points to go back to zero.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When everyone has tiles, the round is over, and we move on to scoring that round. Since this is played by bots and not humans, an infinite loop is possible, so after 1000 actions, the round will be stopped by force, and the players participating in the infinite loop who ended up empty ended will naturally end this round with a terrible score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Scoring happens all at once, and you get (or lose) points according to the tiles you have, and the tiles the other players have. When scoring is done, we move on to the next round, or declare the winner if that was the fifth round.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Tiles&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are different types of tiles, and you job is basically to find the best balance between them while not having enough to make your stack worth stealing.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Fire | The player who has the fewest fire tiles loses 5 points&lt;/li&gt;&#xA;&lt;li&gt;Meat | The three players owning the most meat tiles get 8, 5 and 2 points respectively&lt;/li&gt;&#xA;&lt;li&gt;Fur | Every fur tile gives you onw &quot;fur point&quot;. During every round after the first, the player with the most fur points plays first. At the end of each round, the player with the most fur tiles gets the round number in points (1-5), while the one who has the least loses the round number in points.&lt;/li&gt;&#xA;&lt;li&gt;Ivory Tile | Every Ivory tile gives you two points.&lt;/li&gt;&#xA;&lt;li&gt;Axe Tile | (This one should be discussed) Every axe tile gives you one point, and every axe Tile obtained in the last round is Worth 3 points&lt;/li&gt;&#xA;&lt;li&gt;Animal Tiles | There are 7 different animals (Bat, Opossum, Bunny, Buffalo, Squirrel, Beaver and Duck), and only one of each in the game. When you end the round with one, you &quot;obtain&quot; this animal, and getting the same one again will do nothing. At the end of the game, depending on the number of animals you have obtained, you get points. (0: 0, 1:0, 2:0, 3:4, 4:9, 5:15, 6:22, 7:30)&lt;/li&gt;&#xA;&lt;li&gt;Mystery Tile | If you get a mystery tile, it will be turned around to reveal its other side during the scoring phase. The other side can't be another mystery tile or an animal tile.&lt;/li&gt;&#xA;&lt;li&gt;Tie-Breaker Tile | This tile serves as a tie breaker. One side is the &quot;clockwise&quot; side, and the other side is the &quot;counter-clockwise&quot;, so every round will contain a tie-breaker tile. During any and all ties during scoring, the tie-breaker tile decides who wins or loses.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Clockwise?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;At the start of the game, every player will be given a random ID between 1 and 5. The player with ID 1 will start the game. Then, for the following rounds, the most fur points decides who starts, and the ID decides the order. Example: ID 3 has the most furs, then the order will be [3, 4, 5, 1, 2].&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is considered &quot;clockwise&quot;. The counter-clockwise order would be [3, 2, 1, 5, 4]. This is important, because when dealing with ties, the tie-breaker tile takes the order into account.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If player 4 owns the clockwise tie-breaker tiles, and has 3 meats. Player 1 and 2 also have three meats. The first, second and third place in meat then go to players ID 4, 1 and 2 respectively. If everyone has 3 fires, except player 3 and 5 who have 1, then player 3 is the one to lose points. Having the tie-breaker tiles means you are first in the tie-breaking order, and that tile's visible side decide the rest of the order.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge specifications&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You must make a C# class that inherits from a &quot;Player&quot; class. You must also override the method&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;List&amp;lt;int&amp;gt; ChooseTiles(Dictionary&amp;lt;int, List&amp;lt;Tile&amp;gt;&amp;gt; otherPlayers, List&amp;lt;Tile&amp;gt; center)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This method takes a dictionary of player IDs and List of tiles (could be empty), that are each player's tiles at the moment, plus a list of tiles in the middle. You must return a list of integer, which are the IDs of the tiles you want. If you try to get tiles illegally (not following the instructions for taking an action, which are either any number of tiles from the middle or all tiles except one from a player), you will be asked to choose one more time, and if you fail to follow the rules, you will be counted as &quot;attempting to cheat&quot; and removed from the &quot;playing&quot; pool during this round, so you will get scored for an empty hand. The same thing goes for throwing exceptions and infinite loops (Execution lasting more than 5 seconds). You are given one more chance then given an empty hadn for that round.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is the class Player you will be inheriting from:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;public class Player&#xA;{&#xA;    public int ID;&#xA;    public int currentPoints;&#xA;    public int currentFurs;&#xA;    public List&amp;lt;Tile&amp;gt; currentTiles;&#xA;    public List&amp;lt;TileType&amp;gt; animalsGotten;&#xA;&#xA;    public Player(int id)&#xA;    {&#xA;        ID = id;&#xA;        currentPoints = 10;&#xA;        currentFurs = 0;&#xA;        currentTiles = new List&amp;lt;Tile&amp;gt;();&#xA;        animauxGotten = new List&amp;lt;TileType&amp;gt;();&#xA;    }&#xA;&#xA;    public virtual List&amp;lt;int&amp;gt; ChooseTiles(Dictionary&amp;lt;int, List&amp;lt;Tile&amp;gt;&amp;gt; otherPlayers, List&amp;lt;Tile&amp;gt; center)&#xA;    {&#xA;        throw new Exception(&quot;Fake players don't get to play!&quot;);&#xA;    }&#xA;&#xA;    public virtual string GetName()&#xA;    {&#xA;        return &quot;Player&quot;;&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You should also override the GetName() function, but it is not required.&#xA;You are allowed to create as many private functions or attributes as you want to store data during a game, but each match will create a new instance of your player.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Tournament&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;tournament will be played in a round-robin fashion. You are not garanteed a match with every single combination of four opponents available, but you are garanteed at least one match in common with every other bot, and everyone will play the same number of matches. You will also not play twice with the same 5 players. The total number of matches will depend on the number of participants.&#xA;For each match, the first player will get 5 points, and the others will get respectively 3, 2, 1 and zero points depending on their points earned during the match. Furthermore, and ties in points will not be resolved, and the points of the occupied positions split between tied players. This means that if the points are (40, 37, 37, 37, 35), the points are (5, 2, 2, 2, 0)&lt;/p&gt;&#xA;" OwnerUserId="69372" LastActivityDate="2017-05-16T13:45:44.363" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12418" PostTypeId="2" ParentId="12415" CreationDate="2017-05-16T13:59:42.777" Score="4" Body="&lt;h1&gt;It's not what many of us are here for&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Difficult challenges may be fun to write, and for some, fun to solve. But many of us, myself included, are not here to solve difficult programming challenges, we're here to solve simple challenges, and golf our code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We don't want to spend a ton of time figuring out just how to solve a challenge &lt;em&gt;at all&lt;/em&gt; when we could be spending a ton of time figuring out how to golf the solution to a much more simple challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That being said, I'm not saying that's the way it &lt;strong&gt;should&lt;/strong&gt; be. This is PPCG after all, not just CG, but as people mentioned in comments, there are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7150/easy-challenges-and-hot-network-questions&quot;&gt;on-going meta discussions&lt;/a&gt; about how to resolve this.&lt;/p&gt;&#xA;" OwnerUserId="44998" LastEditorUserId="44998" LastEditDate="2017-05-16T14:08:52.820" LastActivityDate="2017-05-16T14:08:52.820" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12419" PostTypeId="2" ParentId="2140" CreationDate="2017-05-16T14:26:05.207" Score="1" Body="&lt;h1&gt;Set The Shapes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Updated on 23/05/17 with new shapes &amp;amp; questions&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Let &lt;code&gt;s&lt;/code&gt; be the sequence of polygonal numbers with &lt;code&gt;S&lt;/code&gt; sides and &lt;code&gt;t&lt;/code&gt; be the sequence of polygonal numbers with &lt;code&gt;T&lt;/code&gt; sides. Take the set union of the first &lt;code&gt;n&lt;/code&gt; elements of &lt;code&gt;s&lt;/code&gt; and the first &lt;code&gt;n&lt;/code&gt; elements of &lt;code&gt;t&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;3 integers, &lt;code&gt;n&lt;/code&gt;, &lt;code&gt;s&lt;/code&gt; &amp;amp; &lt;code&gt;t&lt;/code&gt; where:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;n&amp;gt;0&lt;/code&gt;, &lt;code&gt;2&amp;lt;(s,t)&amp;lt;13&lt;/code&gt; and &lt;code&gt;s!=t&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The values of &lt;code&gt;s&lt;/code&gt; &amp;amp; &lt;code&gt;t&lt;/code&gt; each represent a different polygonal number type:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  3 = Triangle&#xA;  4 = Square&#xA;  5 = Pentagon&#xA;  6 = Hexagon&#xA;  7 = Heptagon&#xA;  8 = Octagon&#xA;  9 = Nonagon&#xA; 10 = Decagon&#xA; 11 = Hendecagon&#xA; 12 = Dodecagon&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;An array of the set union of the first &lt;code&gt;n&lt;/code&gt; numbers of shapes &lt;code&gt;s&lt;/code&gt; and &lt;code&gt;t&lt;/code&gt; in ascending order.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;(assuming 0-based indexing)&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Input:&lt;/strong&gt; &lt;code&gt;n=5, s=3, t=4&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The first 5 triangular numbers are &lt;code&gt;0, 1, 3, 6, 10&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The first 5 square numbers are &lt;code&gt;0, 1, 4, 9, 16&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Output:&lt;/strong&gt; &lt;code&gt;[0, 1, 3, 4, 6, 9, 10, 16]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input must be 3 separate integers&lt;/li&gt;&#xA;&lt;li&gt;Output must be an array (or equivalent in your chosen language)&lt;/li&gt;&#xA;&lt;li&gt;If your chosen language isn't capable of handling either or both of the above then &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/58974&quot;&gt;standard I/O methods&lt;/a&gt; apply&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;s&lt;/code&gt; &amp;amp; &lt;code&gt;t&lt;/code&gt; are guaranteed to be different but you must be able to handle them being input in either order - smallest first or largest first&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so lowest byte count wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: 5, 3, 4&#xA;0-Based Output: [0, 1, 3, 4, 6, 9, 10, 16, 20]&#xA;1-Based Output: [1, 3, 4, 6, 9, 10, 15, 16, 25]&#xA;&#xA;Input: 10, 9, 8&#xA;0-Based Output: [0, 1, 8, 9, 21, 24, 40, 46, 65, 75, 96, 111, 133, 154, 176, 204, 225, 261]&#xA;1-Based Output: [1, 8, 9, 21, 24, 40, 46, 65, 75, 96, 111, 133, 154, 176, 204, 225, 261, 280, 325]&#xA;&#xA;Input: 1, 7, 6&#xA;0-Based Output: [0]&#xA;1-Based Output: [1]&#xA;&#xA;Input: 8, 3, 3&#xA;Invalid input as both shapes are the same&#xA;&#xA;Input: 0, 2, 17&#xA;Invalid input as n&amp;lt;1, s&amp;lt;3 and t&amp;gt;12&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;&lt;s&gt;Bonus Idea 1&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Brownie points if you want to increase the range for &lt;code&gt;s&lt;/code&gt; &amp;amp; &lt;code&gt;t&lt;/code&gt; and include some other polygons (e.g., star, dodecagon).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Bonus Idea 2&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Alter the challenge to only require that solutions be able to handle 5(?) different shapes with a score reduction for each additional shape, up to a maximum of 10(?).&lt;/s&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Questions&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This is my first challenge (inspired, in part, by &lt;a href=&quot;https://codegolf.stackexchange.com/q/118980/58974&quot;&gt;this&lt;/a&gt;) so all feedback very much welcome.&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Should I add or remove any tags?&lt;/li&gt;&#xA;  &lt;li&gt;Is the above sufficiently different from &lt;a href=&quot;https://codegolf.stackexchange.com/q/99688/58974&quot;&gt;this&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/79012/polygonal-numbers&quot;&gt;this&lt;/a&gt;?&lt;br&gt;&lt;strong&gt;(Votes: 2 for this not being a dupe, 2 for it being a dupe of the second linked challenge)&lt;/strong&gt;&lt;/li&gt;&#xA;  &lt;li&gt;Does everything read OK &amp;amp; make sense?&lt;/li&gt;&#xA;  &lt;li&gt;Should I include the formula for each shape in the question?&lt;br&gt;I'm leaning towards &quot;yes&quot; as:&#xA;  &#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;For those that know them, figuring them out won't be a challenge&lt;/li&gt;&#xA;  &lt;li&gt;For those that don't, figuring them out wouldn't add to the challenge&lt;/li&gt;&#xA;  &lt;li&gt;As soon as one person posts a solution containing the formulas, that makes them available to everyone else anyway.&lt;/li&gt;&#xA;  &lt;/ol&gt;&lt;/li&gt;&#xA;  &lt;li&gt;Should there be more (e.g., star, tridecagon+) or less possible shapes?&lt;/li&gt;&#xA;  &lt;li&gt;Would it improve the challenge if I allowed solutions to pick a smaller subset of 5(?) shapes to work with? How about if that subset had to be sequential (e.g., 3-7 or 5-9 but &lt;em&gt;not&lt;/em&gt; 3,5-8)?&lt;/li&gt;&#xA;  &lt;li&gt;What test cases should I add?&lt;/li&gt;&#xA;  &lt;li&gt;&lt;s&gt;Do the bonus ideas add to or detract from the challenge?&lt;/s&gt;&lt;br&gt;&lt;strong&gt;Answered: Bonuses are generally bad.&lt;/strong&gt;&lt;/li&gt;&#xA;  &lt;li&gt;Is there a better name I can give this challenge?&lt;/li&gt;&#xA;  &lt;li&gt;Should I be asking any other questions?!&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="58974" LastEditDate="2017-05-29T10:25:25.883" LastActivityDate="2017-05-29T10:25:25.883" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="12420" PostTypeId="2" ParentId="12415" CreationDate="2017-05-16T14:35:59.073" Score="6" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;The harder one got no answers and 12 upvotes in 112 views, and was up for more than twice as long.&lt;br&gt;&#xA;  ...&lt;br&gt;&#xA;  The easier one got 19 answers and 9 upvotes in 141 views.&lt;br&gt;&#xA;  ...&lt;br&gt;&#xA;  I'd like a way for harder challenges to receive some attention.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;What do you mean by &quot;&lt;em&gt;attention&lt;/em&gt;&quot;? The harder challenge got a reasonable number of views, and a better upvote-per-view rate than the easier one. So the impression I get is that by &lt;em&gt;attention&lt;/em&gt; you really mean &lt;em&gt;answers&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Have you written a reference implementation? How many hours did it take? Then how many more would it take to golf it? And is it reasonable to expect people to have put in that much of their spare time in the 24 to 48 hours which passed between posting the question and taking the snapshot in this meta-question?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my opinion it is fair to say that interesting questions can get buried by trivial ones, and I think the site has tended more towards trivial questions over the past two or three years than in the first two or three. But I think it's also fair to say that your expectations look unrealistic.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-05-16T14:35:59.073" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12421" PostTypeId="2" ParentId="2140" CreationDate="2017-05-16T15:14:28.417" Score="0" Body="&lt;p&gt;I have a large collection of fine art.  My toddler is learning to use scissors and glue; lately she has started playing with my art collection.  Fortunately she is really quite good with the scissors and cuts things up into perfect squares.  She then uses glue to randomly tile the cut-up squares back into a new piece of art.  For example, she reinterpreted my &lt;em&gt;Mona Lisa&lt;/em&gt; (&lt;a href=&quot;http://upload.wikimedia.org/wikipedia/commons/thumb/b/b9/Mona_Lisa.PNG/685px-Mona_Lisa.PNG&quot; rel=&quot;nofollow noreferrer&quot;&gt;which wikipedia kindly hosts for me&lt;/a&gt;) as follows:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/W8BqE.jpg&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;The following python script simulates what my toddler has done:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;#!/usr/bin/python&#xA;&#xA;import sys&#xA;import random&#xA;from PIL import Image&#xA;&#xA;origname = sys.argv[1]&#xA;&#xA;im = Image.open(origname)&#xA;width, height = im.size&#xA;width = (int(width + 99) / 100) * 100&#xA;height = (int(height + 99) / 100) * 100&#xA;&#xA;im = im.crop((0, 0, width, height))&#xA;&#xA;im2 = Image.new(&amp;quot;RGB&amp;quot;, (width, height), &amp;quot;black&amp;quot;)&#xA;&#xA;blocks = []&#xA;for x in range(width / 100):&#xA;    for y in range(height / 100):&#xA;        blocks.append(im.crop((x * 100, y * 100, (x + 1) * 100, (y + 1) * 100)))&#xA;&#xA;random.shuffle(blocks)&#xA;&#xA;&#xA;&#xA;im2.save(&amp;quot;shuf&amp;quot; + origname)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;sub&gt;Please excuse python skills - I'm still learning, but was happy to see how quick and easy it was to write this script.  Polite code-reviews will be graciously accepted ;-)&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;p&gt;It does the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;loads the image whose file name was given as a command-line parameter&lt;/li&gt;&#xA;&lt;li&gt;pads that image with black pixels such that the width and height are exactly divisible by 100&lt;/li&gt;&#xA;&lt;li&gt;divides the image into 100x100 pixel blocks&lt;/li&gt;&#xA;&lt;li&gt;randomly shuffles the blocks&lt;/li&gt;&#xA;&lt;li&gt;reassembles the randomly arranged blocks back into a new image with the same size attributes as the (padded) original&lt;/li&gt;&#xA;&lt;li&gt;saves the new image using the original filename prefixed with &lt;code&gt;shuf&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Your task is to write a program that takes the output of this script, analyses the edges of each 100x100 block and reassembles them back to the original picture.&lt;/p&gt;&#xA;&lt;h3&gt;Input:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;an image filename.  This may be passed at the commandline, via STDIN or even hard-coded, whichever is most convenient.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Output:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;either output the a singular rearranged image to a differnent file, or display the singular rearranged output to the screen.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Input and output specs are intended to be lenient here, as filename-parsing is a non-goal of this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question.&lt;/p&gt;&#xA;&lt;h3&gt;Other rules&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The program must be able to correctly reassemble any random arrangement of the wikipedia Mona Lisa by the python script.  Hard-coding of block transformations of the example image above is strictly &lt;em&gt;not&lt;/em&gt; allowed.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It is understood that for some degenerate cases (e.g. chequerboard of 100x100) blocks it is impossible to correctly rearrange the image.  In those cases it is acceptable to produce incorrect/undefined output.  However I think in general for photo images and almost all &amp;quot;famous&amp;quot; artworks, reassembly should be possible.  Works by &lt;a href=&quot;http://en.wikipedia.org/wiki/Mark_Rothko&quot; rel=&quot;nofollow noreferrer&quot;&gt;Mark Rothko&lt;/a&gt; are a possible exception.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Common image manipulation libraries may be used (e.g. Python's PIL), but any APIs expressly designed for this purpose are strictly banned.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://meta.codegolf.stackexchange.com/questions/1061/standard-loopholes-which-are-no-longer-funny&quot;&gt;Standard “loopholes” which are no longer funny&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Now my toddler got a hold of &lt;a href=&quot;http://upload.wikimedia.org/wikipedia/en/thumb/f/f4/The_Scream.jpg/608px-The_Scream.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;The Scream&lt;/em&gt;&lt;/a&gt;.  This is the result that needs to be fixed:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/x3X5E.jpg&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Special thanks to Digital Trauma!&lt;/h1&gt;&#xA;&lt;p&gt;He wrote the original challenge and gave it up original post &lt;a href=&quot;https://codegolf.stackexchange.com/questions/38534/stitch-a-picture&quot;&gt;here&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;META:&lt;/h1&gt;&#xA;&lt;p&gt;I need to update the images and the script to not have rotations and to not have black bars. Any ideas?&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-17T00:39:44.893" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12422" PostTypeId="2" ParentId="12415" CreationDate="2017-05-16T15:26:02.253" Score="14" Body="&lt;h1&gt;PPCG is a &lt;em&gt;FUN&lt;/em&gt; stack-exchange and not all users want to solve hard problems.&lt;/h1&gt;&#xA;&lt;p&gt;It is hard. Not everyone wants to do that. Simple. I enjoy solving all sorts of problems but simple ones using Brain-Flak are a large amount of fun for me.&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-17T13:37:24.130" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12423" PostTypeId="1" CreationDate="2017-05-16T15:34:53.563" Score="19" ViewCount="312" Body="&lt;h3&gt;TL;DR&lt;/h3&gt;&#xA;&lt;p&gt;What rules and guidelines should duels and duelers be held to?&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This idea sprouted originally as a potential solution to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5212/43214&quot;&gt;this problem&lt;/a&gt;. It was well received so the next step is to create formal rules and to address foreseeable complications.&lt;/p&gt;&#xA;&lt;h3&gt;What is &lt;a href=&quot;https://www.wikiwand.com/en/Duel&quot; rel=&quot;nofollow noreferrer&quot;&gt;Dueling&lt;/a&gt;?&lt;/h3&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A duel is an arranged engagement in combat between two individuals with matched weapons in accordance with agreed-upon rules. Used to gain &amp;quot;satisfaction&amp;quot;, that is, to restore/defend one's honor.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;In this context, it would be a duel between two golfers. There is a challenger, who throws down the gauntlet and there is the champion who accepts the challenge.&lt;/p&gt;&#xA;&lt;h3&gt;How it works&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Challenger&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the question&lt;/li&gt;&#xA;&lt;li&gt;their language&lt;/li&gt;&#xA;&lt;li&gt;their opponent's language&lt;/li&gt;&#xA;&lt;li&gt;time frame&lt;/li&gt;&#xA;&lt;li&gt;rep&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Champion&#xA;&lt;ul&gt;&#xA;&lt;li&gt;chooses to accept the challenge&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Outcome&#xA;&lt;ul&gt;&#xA;&lt;li&gt;after the time frame&lt;/li&gt;&#xA;&lt;li&gt;based on the question's winning criterion&lt;/li&gt;&#xA;&lt;li&gt;the better of the two answers wins&lt;/li&gt;&#xA;&lt;li&gt;the victor receives a bounty for the rep amount from the defeated&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;[Alternative]&lt;/strong&gt; a &lt;em&gt;Sponsor&lt;/em&gt; can post a duel that is open for two Champions. In this case, the rep is paid by the Sponsor to the victor.&lt;/p&gt;&#xA;&lt;h3&gt;Next steps&lt;/h3&gt;&#xA;&lt;p&gt;If there is positive feedback, I will create a &lt;em&gt;'List of Duels'&lt;/em&gt;, similar to our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5243/list-of-bounties-with-no-deadline&quot;&gt;&lt;em&gt;'List of Bounties'&lt;/em&gt;&lt;/a&gt;. Challengers can post duels, champions can comment their acceptance, spectators can follow the links and assist.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Example 1&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Challenger&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Java vs C&lt;/h1&gt;&#xA;&lt;p&gt;I challenge anyone to out-perform Java with C in building a fewest-moves freecell solver.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Challenge: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/43150/build-a-fewest-moves-freecell-solver&quot;&gt;Build a fewest-moves freecell solver&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Challenger's Language: Java&lt;/li&gt;&#xA;&lt;li&gt;Champion's Language: C&lt;/li&gt;&#xA;&lt;li&gt;Duration: 3 days&lt;/li&gt;&#xA;&lt;li&gt;Reputation: 100&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Champion&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;[In the comments]&lt;/p&gt;&#xA;&lt;p&gt;I accept your challenge&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Example 2&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Sponsor&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Haskell vs JavaScript&lt;/h1&gt;&#xA;&lt;p&gt;I will sponsor 2 champions to create an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/73230/auto-batch-golfer&quot;&gt;auto-golfer for Batch&lt;/a&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Challenge: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/73230/auto-batch-golfer&quot;&gt;Auto BATCH Golfer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Champion's Language: Haskell&lt;/li&gt;&#xA;&lt;li&gt;Champion's Language: JavaScript&lt;/li&gt;&#xA;&lt;li&gt;Duration: 1 week&lt;/li&gt;&#xA;&lt;li&gt;Reputation: 500&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Champion 1&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;[In the comments]&lt;/p&gt;&#xA;&lt;p&gt;I will champion Haskell&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Champion 2&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;[In the comments]&lt;/p&gt;&#xA;&lt;p&gt;I will fight for JavaScript&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="43214" LastEditorUserId="97857" LastEditDate="2021-12-06T08:27:11.820" LastActivityDate="2021-12-06T08:27:11.820" Title="Rules for Duels" Tags="|discussion|" AnswerCount="4" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="12424" PostTypeId="2" ParentId="12415" CreationDate="2017-05-16T15:37:27.253" Score="1" Body="&lt;h1&gt;Visibility-focused events&lt;/h1&gt;&#xA;&lt;p&gt;There are 4 different kinds of people on this site (I'm generalizing here, but bear with me):&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Those that want to solve easy challenges&lt;/li&gt;&#xA;&lt;li&gt;Those that want to solve hard challenges&lt;/li&gt;&#xA;&lt;li&gt;Those that post easy challenges&lt;/li&gt;&#xA;&lt;li&gt;Those that post hard challenges&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The easy challenges are really easy to find because they are more common, and hit the HNQ more often.&lt;/p&gt;&#xA;&lt;p&gt;The question we have to ask is:   &lt;strong&gt;Are the people that want to solve hard challenges finding them?&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the answer is &amp;quot;YES&amp;quot;, then there are simply less people that want to solve difficult challenges, and there isn't much we can do.&lt;/li&gt;&#xA;&lt;li&gt;If the answer is &amp;quot;NO&amp;quot;, then we need to improve the visibility of these challenges.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;This is why visibility-focused events are important&lt;/strong&gt;.  They give visibility to these difficult/interesting challenges to those that are interested.&lt;/p&gt;&#xA;&lt;p&gt;One of the best things we do in this community are the Best-of challenges.  They happen once a year, but they really put an emphasis on interesting challenges/answers.&lt;/p&gt;&#xA;&lt;p&gt;I tried to add another event (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9140/tour-of-ppcg-voting-phase?answertab=votes#tab-top&quot;&gt;Tour of PPCG&lt;/a&gt;), but after the voting phase, I didn't feel like I had enough top-voted answers to be justified to edit them all.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-16T15:37:27.253" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12425" PostTypeId="2" ParentId="12423" CreationDate="2017-05-16T15:49:55.220" Score="-10" Body="&lt;h1&gt;No Intra-language Dueling&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Intra-language duels would be more sticky. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Ties would be more likely&lt;/li&gt;&#xA;&lt;li&gt;Copying could be a problem&lt;/li&gt;&#xA;&lt;li&gt;Spectator involvement could become more political&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;e.g. &lt;code&gt;Why comment on her answer and not mine?&lt;/code&gt; &lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;With reputation on the line, people could get bent out of shape on details like that. I also think that the competitors would be more inclined to give each other suggestions and be helpful in an inter-language duel. So overall formal intra-language dueling should not be permitted.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Obviously off-the-books intra-language dueling between friends is fine. Some of this already exists.&lt;/p&gt;&#xA;" OwnerUserId="43214" LastActivityDate="2017-05-16T15:49:55.220" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12427" PostTypeId="2" ParentId="12423" CreationDate="2017-05-16T15:58:43.823" Score="2" Body="&lt;h1&gt;Duels may be sponsored by a user, who does not want to compete, for another user&lt;/h1&gt;&#xA;&lt;p&gt;A user who does not want to compete may sponsor a user and supply the rep if they lose.  If a user challenges another user, but the challenged user cannot put the rep forward, then a kind user can step up and supply the rep if they lose.&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-17T19:46:04.057" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="12428" PostTypeId="2" ParentId="12423" CreationDate="2017-05-16T16:15:28.970" Score="0" Body="&lt;h1&gt;Time Frame&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We need to be precise in terms of when the challenge completes.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The challenger should specify a positive integer, &lt;code&gt;x&lt;/code&gt;, number of days (e.g. &lt;code&gt;3&lt;/code&gt;). &lt;/li&gt;&#xA;&lt;li&gt;Time starts counting down at &lt;code&gt;12:01 am UTC&lt;/code&gt; once the champion accepts. &lt;/li&gt;&#xA;&lt;li&gt;Time ends at &lt;code&gt;11:59 pm UTC&lt;/code&gt; on the &lt;code&gt;xth&lt;/code&gt; day.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A challenge with a &lt;code&gt;7&lt;/code&gt; day duration is posted. A champion accepts the challenge on &lt;strong&gt;March 14th&lt;/strong&gt; at &lt;strong&gt;2:14 pm UTC&lt;/strong&gt;.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This duration will start decreasing on March 15th at 12:01 am UTC&lt;/li&gt;&#xA;&lt;li&gt;The challenge will complete on March 21st at 11:59 pm UTC&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;A challenge with a &lt;code&gt;1&lt;/code&gt; day duration is posted. A champion accepts the challenge on &lt;strong&gt;October 31st&lt;/strong&gt; at &lt;strong&gt;11:30 pm UTC&lt;/strong&gt;.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This duration will start decreasing on November 1st at 12:01 am UTC&lt;/li&gt;&#xA;&lt;li&gt;The challenge will complete on November 1st at 11:59 pm UTC&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="43214" LastEditorUserId="43214" LastEditDate="2017-05-16T16:26:57.197" LastActivityDate="2017-05-16T16:26:57.197" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12429" PostTypeId="2" ParentId="2140" CreationDate="2017-05-16T21:09:50.023" Score="2" Body="&lt;p&gt;So I've been puzzling over the best way to present this idea I had, so this will probably need a &lt;em&gt;lot&lt;/em&gt; of help.  I am open to completely reworking the challenge, but this is the best polish I've managed to figure out so far.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At work I have to secure my laptop with one of those 4-digit cable locks and it occurred to me that there was a puzzle here: figuring out the combination by looking at the typical behavior of setting the lock: never allowing any given wheel to &quot;rest&quot; on its unlocked value.  e.g. if the combination is &lt;code&gt;1234&lt;/code&gt; then never walking away with a 1 in the first position, a 2 in the second, and so on (e.g. &lt;code&gt;1111&lt;/code&gt; would not be considered locked, but &lt;code&gt;2111&lt;/code&gt; would be).  Or possibly by not letting &lt;em&gt;any&lt;/em&gt; digit of the unlocked combination be visible (so even &lt;code&gt;2111&lt;/code&gt; would be &quot;bad&quot; but &lt;code&gt;6789&lt;/code&gt; would be ok...unless a transpose was &lt;em&gt;also&lt;/em&gt; considered to be insufficiently random, however such choices are often up to the user of the lock). I also subsequently changed my behavior (not that I have any real risk of my laptop being stolen).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A standard challenge of &quot;write some code that examines a series of locked values to determine the unlocked value, scoring by number of entries needed&quot; is non-viable, as the sequence list would need to be carefully chosen such that there is a strictly known optimal solution (i.e. a minimum number of locked values), as finding a shortcut in that &lt;em&gt;specific&lt;/em&gt; sequence might be possible, but invalid on another sequence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then the other night it occurred to me that it might be possible to do this as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;: one side has to randomize their locks (albeit following a set of rules that allows exploitation), the other side has to break them open.  The downside being that it will be a &lt;em&gt;nightmare&lt;/em&gt; to validate scores as there will be no easy way to pipe input and output back and forth between two programs running arbitrary languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm also not sure if there's enough room for freedom in designing the lock randomization code (i.e. interesting for the cop) for it to be plausibly crackable without resorting to brute force (an uninteresting challenge for the robber). Ostensibly the robber half &lt;em&gt;is&lt;/em&gt; brute force, but it's guided in some manner towards a determinable value (&quot;ah, I see, the first spindle is never set to &lt;code&gt;1&lt;/code&gt; when locked, ergo the first digit in the code &lt;em&gt;must&lt;/em&gt; be a &lt;code&gt;1&lt;/code&gt;) rather than indeterminate (&quot;ah, I see, &lt;em&gt;no&lt;/em&gt; spindle is ever set to &lt;code&gt;1&lt;/code&gt;, ergo there is a &lt;code&gt;1&lt;/code&gt; somewhere in the code&quot; -&gt; 4 digits ^ 4 spindles -&gt; 256 plausible values with further attempts gaining no new information).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Combination Locks (Cops)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/R2nQQ.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/R2nQQ.jpg&quot; alt=&quot;8585: Locked&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your goal is to write a program that produces a 4 digit random number as a combination lock entry code.  Your program needs to keep this value a secret, but must produce output that is the result of the lock being locked and its tumblers spun, the value printed being the digits shown along the set row (&lt;code&gt;8585&lt;/code&gt; in the above image).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program will then take input of a 4 digit code that is an attempt to unlock the lock.  If it is the correct value, output the number of attempts made and the seed value, otherwise print another randomized lock value.  Repeat until successfully unlocked.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program must have some way of setting the combination (for scoring), eg. providing a seed value for the random number generator (inputting the correct combination is allowed).&lt;/li&gt;&#xA;&lt;li&gt;All locked combinations must be considered random.  However:&lt;/li&gt;&#xA;&lt;li&gt;The nature of &quot;random&quot; is what is to be exploited here. Obviously you wouldn't want your random lock to actually remain unlocked after shuffling the dials!&lt;/li&gt;&#xA;&lt;li&gt;You may chose any rules by which to keep the lock locked, provided that it can be exploited. No outputting &lt;code&gt;0000&lt;/code&gt; every iteration or cycling between predetermined sets (&lt;code&gt;1234&lt;/code&gt;,&lt;code&gt;4567&lt;/code&gt;,&lt;code&gt;7890&lt;/code&gt;,&lt;code&gt;1234&lt;/code&gt;). You're trying to emulate what appears to be smart behavior of a human being, not create an unbreakable lock.&lt;/li&gt;&#xA;&lt;li&gt;Every digit from 0-9 should be possible with some degree of uniformity. That is, if the correct combination is &lt;code&gt;1234&lt;/code&gt; you are allowed to prevent &lt;code&gt;1&lt;/code&gt; from showing up as the fist digit, but you may not prevent &lt;code&gt;1&lt;/code&gt; from showing up in other positions.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Blanket removal of all four digits of the combination from all four columns reduces the problem to brute forcing 256 possible combinations.&lt;/li&gt;&#xA;&lt;li&gt;Similarly, allowing a ban on a digit for &lt;em&gt;up to three&lt;/em&gt; columns reduces it to brute force against 3136 possible combinations (banning &lt;em&gt;only&lt;/em&gt; the combination digits from 3 columns is 81 possible combinations).  None of these are interesting challenges.&lt;/li&gt;&#xA;&lt;li&gt;Entries shown to devolve to a brute force guessing will score based on the worst-case lucky guess (i.e. the number of attempts needed to identify the brute-force point, +1).&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;If your language does not have a way to &quot;wait for input&quot; then....??? (requirements for fixed-seed randomness across multiple attempts, e.g. for a given combination and the same number of attempts made, the next output should be the same)&lt;/li&gt;&#xA;&lt;li&gt;Your program should store no data about attempts to break the lock or prior output values, the only data that may be stored are the &lt;code&gt;Random&lt;/code&gt; instance (if needed), the correct combination, and number of attempts made.  Outputting an attempt value back out (intentionally) would be underhanded.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The ratio of your code's byte-length to the best (lowest) number of attempts needed by any robber against your lock.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Combination Locks (Robbers)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/R2nQQ.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/R2nQQ.jpg&quot; alt=&quot;8585: Locked&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your goal is to exploit the non-pure-random nature of locked 4 digit combination lock. After all, no one leaves a portion of the correct code in the lock after they shuffle the wheels!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are to write a program that attempts to deduce the correct combination for a given lock, given only a series of locked (incorrect) combinations.  Your program will read a single 4 digit number as the current state of the lock and produce a 4 digit number output as an attempt to unlock the lock.  If additional input is given, the attempt was unsuccessful.  Your program need not self-terminate (i.e. there is no requirement to take input telling your program that it was successful; ctrl-C interrupt is succificient).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As you are an accomplished thief, you know exactly how each lock gets randomized. You are to exploit the built-in rules to bypass the lock in the fewest number of attempts by looking for patterns in the lock's &quot;output&quot; and narrowing down the list of possible correct combinations.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Locks will have a way to predetermine their combination (e.g. random seed or specific 4 digit combination). Your program may not know these values, they are used for scoring only. Remember the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;standard loopholes&lt;/a&gt;: hardcoding the output is disallowed.&lt;/li&gt;&#xA;&lt;li&gt;If a human is unable to find the solution with the data known at that the point of solving, the number of attempts will not count for scoring as it can be considered a lucky guess (arbitrary threshold: 10 or fewer attempts will be automatically assumed as such). This should be treated like a logic puzzle, not a slot machine.&lt;/li&gt;&#xA;&lt;li&gt;If your language of choice doesn't do &quot;programs&quot; it is acceptable to write a function taking in an array of inputs &lt;code&gt;[XXXX, AAAA, XXXX, BBBB, XXXX]&lt;/code&gt; (where &lt;code&gt;XXXX&lt;/code&gt; represents the combinations displayed on the lock, and &lt;code&gt;AAAA&lt;/code&gt;/&lt;code&gt;BBBB&lt;/code&gt; represents the prior attempts made) or similar.  Note that there will be one more value from the lock than values from attempts, as your function would be producing the paired half as its output.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Supplementary output to support ease of alternative input methods acceptable (e.g. a newline followed by the input array for the next iteration to be copy-pasted).&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The ratio of your code's byte-length to the best (lowest) number of attempts needed top open any lock.&lt;/p&gt;&#xA;" OwnerUserId="47990" LastActivityDate="2017-05-16T21:09:50.023" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12432" PostTypeId="2" ParentId="2140" CreationDate="2017-05-16T21:43:41.603" Score="0" Body="&lt;h1&gt;Extension of MIME-Type&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task, given this &lt;a href=&quot;https://pastebin.com/CUv4Bfdi&quot; rel=&quot;nofollow noreferrer&quot;&gt;list of extension and MIME-types&lt;/a&gt;, is to choose exactly &lt;strong&gt;&lt;em&gt;20&lt;/em&gt;&lt;/strong&gt; of them and create a program that takes in either &lt;code&gt;e&lt;/code&gt;, the extension, or &lt;code&gt;m&lt;/code&gt;, the MIME-Type, and outputs its counterpart.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Example (if my set was [&lt;code&gt;.pdf&lt;/code&gt;, &lt;code&gt;.doc&lt;/code&gt;]):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Cases to handle:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f('.pdf') = application/pdf&#xA;f('application/pdf') = .pdf&#xA;f('application/msword') = .doc&#xA;f('.doc') = application/msword&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Cases you don't have to touch:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f('Nonsense') = [Error, null, false, whatever]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;I &amp;amp; O&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input will be a single string, so will output.&lt;/li&gt;&#xA;&lt;li&gt;You must handle 20 mime-type combinations and mention which ones you are handling.&lt;/li&gt;&#xA;&lt;li&gt;Trailing spaces and newlines are fine.&lt;/li&gt;&#xA;&lt;li&gt;Extensions always include the preceding period.&lt;/li&gt;&#xA;&lt;li&gt;When choosing a long extension like &lt;code&gt;.cryptocode&lt;/code&gt;, if you return the MIME-type of &lt;code&gt;.cryptocode&lt;/code&gt; for an input of &lt;code&gt;.cry&lt;/code&gt; it will be considered an invalid submission, remember this.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Winning&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorolofvlfoao-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorolofvlfoao-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorolofvlfoao-complexity&lt;/a&gt;, lowest byte-count wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="59376" LastEditDate="2017-05-16T21:49:20.963" LastActivityDate="2017-05-16T21:49:20.963" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="12433" PostTypeId="1" CreationDate="2017-05-16T23:41:40.560" Score="7" ViewCount="373" Body="&lt;h1&gt;First of all,&lt;/h1&gt;&#xA;&lt;p&gt;I personally have no footing against or towards the current system. All though, some points have come to my attention and I wonder what others think about it.&lt;/p&gt;&#xA;&lt;h1&gt;Background&lt;/h1&gt;&#xA;&lt;p&gt;A large portion of questions asked immediately get flagged as duplicates (as I'm sure almost all of you have accidental found out one way or another). Half the time, it's an near duplicate of a question that was active years ago. Personally, I'd &lt;strong&gt;much&lt;/strong&gt; rather give my submission to a new variant of that original challenge than the one where one rarely will even glance at my submission. The majority of golfers browse the latest and featured questions.&lt;/p&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/119775/the-other-day-i-met-a-bear&quot;&gt;This&lt;/a&gt; challenge was quick to receive many eager answers before getting marked as a duplicate, then soon to be reopened by the community. It's a near duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/6043/were-no-strangers-to-code-golf-you-know-the-rules-and-so-do-i&quot;&gt;this&lt;/a&gt; challenge, one asked almost half a decade ago, with the occasional activity every few months. Golfers would rather choose this new variant because it offers new light on the subject.&lt;/p&gt;&#xA;&lt;h1&gt;Side effects&lt;/h1&gt;&#xA;&lt;p&gt;This community might be a lot more lively if it weren't for such a critical duplicate system. This is may true as the &lt;em&gt;classic&lt;/em&gt; or or &lt;em&gt;good&lt;/em&gt; questions have already been asked... &lt;em&gt;years&lt;/em&gt; ago.&lt;/p&gt;&#xA;&lt;h3&gt;What do you think?&lt;/h3&gt;&#xA;" OwnerUserId="67879" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-17T13:22:58.973" Title="Is the &quot;duplicate&quot; system too harsh?" Tags="|discussion|duplicates|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12434" PostTypeId="1" CreationDate="2017-05-16T23:42:17.467" Score="-3" ViewCount="143" Body="&lt;p&gt;Disclaimer: a &lt;code&gt;࿘&lt;/code&gt; symbol is in this post. This &lt;strong&gt;is not&lt;/strong&gt; a swastika, this is a religious Hindu symbol. I apologise in advance if I cause any offence&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I am currently creating a new language called Tesseract where the source code must be arranged in the shape of a tesseract (asciiart below) otherwise the compiler throws an error. This is what an empty program full of no-ops would look like (gross oversimplification; it also has another cube in the middle but I'm writing this on my phone):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;         ,,,,,,,,,,,,,,,,,,,,&#xA;        ,                  ,,&#xA;       ,                  , ,&#xA;      ,                  ,  ,&#xA;     ,                  ,   ,&#xA;    ,                  ,    ,&#xA;   ,                  ,     ,&#xA;  ,                  ,      ,&#xA; ,                  ,       ,&#xA;,,,,,,,,,,,,,,,,,,,,        ,&#xA;,                  ,       ,&#xA;,                  ,      ,&#xA;,                  ,     ,&#xA;,                  ,    ,&#xA;,                  ,   ,&#xA;,                  ,  ,&#xA;,                  , ,&#xA;,                  ,,&#xA;,,,,,,,,,,,,,,,,,,,,&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Obviously this has a lot of empty white space simply to fit the restrictions I have placed upon the source code layout which I can't remove from the program and it still run.&lt;/p&gt;&#xA;&lt;p&gt;One other problem is the use of no-ops. A simple &lt;code&gt;Hello, World!&lt;/code&gt; program would have to look like this in order to work as the smallest valid tesseract has dimensions of &lt;code&gt;10x10x20&lt;/code&gt; but this submission would be 117 bytes without the spaces.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;         &amp;quot;Hello, World!&amp;quot;࿘,,,,&#xA;        ,                  ,,&#xA;       ,                  , ,&#xA;      ,                  ,  ,&#xA;     ,                  ,   ,&#xA;    ,                  ,    ,&#xA;   ,                  ,     ,&#xA;  ,                  ,      ,&#xA; ,                  ,       ,&#xA;,,,,,,,,,,,,,,,,,,,,        ,&#xA;,                  ,       ,&#xA;,                  ,      ,&#xA;,                  ,     ,&#xA;,                  ,    ,&#xA;,                  ,   ,&#xA;,                  ,  ,&#xA;,                  , ,&#xA;,                  ,,&#xA;,,,,,,,,,,,,,,,,,,,,&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Therefore, I would like to ask that only no-ops that are in the program flow be counted. This means that the above program would be 16 bytes (Tesseract uses a custom code-page), the length of the actual code. &lt;strong&gt;But&lt;/strong&gt; this program would be 17 bytes&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;         &amp;quot;Hello, World!&amp;quot;,࿘,,,&#xA;        ,                  ,,&#xA;       ,                  , ,&#xA;      ,                  ,  ,&#xA;     ,                  ,   ,&#xA;    ,                  ,    ,&#xA;   ,                  ,     ,&#xA;  ,                  ,      ,&#xA; ,                  ,       ,&#xA;,,,,,,,,,,,,,,,,,,,,        ,&#xA;,                  ,       ,&#xA;,                  ,      ,&#xA;,                  ,     ,&#xA;,                  ,    ,&#xA;,                  ,   ,&#xA;,                  ,  ,&#xA;,                  , ,&#xA;,                  ,,&#xA;,,,,,,,,,,,,,,,,,,,,&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;as a no-op is part of the program flow.&lt;/p&gt;&#xA;&lt;p&gt;What do you think? Do you agree with my idea or do you have a better one?&lt;/p&gt;&#xA;&lt;h1&gt;EDIT&lt;/h1&gt;&#xA;&lt;p&gt;I would just like to point out that I will downvote answers that tell me to change the way my code works as it is quite far along and it is easier to have a custom scoring for one obscure language than it is to completely change my language structure.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-17T00:33:22.007" Title="How should I score my new language?" Tags="|discussion|scoring|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12435" PostTypeId="2" ParentId="2140" CreationDate="2017-05-16T23:56:52.653" Score="2" Body="&lt;p&gt;Wasn't able to find anything in my searches, but please let me know if this or something very similar has been done before.  Appreciate any feedback, first post in sandbox.&lt;/p&gt;&#xA;&lt;h2&gt;Can I leave yet?&lt;/h2&gt;&#xA;&lt;p&gt;I'm bored at work, and want to know how close I am to being able to go home.  To represent this, I wish to know what percentage of work I have completed for the day.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Inputs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;None - Current local/computer time shall be used&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Outputs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Percentage of work completed for this day&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Formatted as either a percentage value or a decimal value: &lt;code&gt;0.57&lt;/code&gt;, &lt;code&gt;.57&lt;/code&gt;, &lt;code&gt;57%&lt;/code&gt;, &lt;code&gt;57.0%&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Output should be accurate to at least +/-0.5%.  Additional accuracy/digits are allowed.&lt;/li&gt;&#xA;&lt;li&gt;The work day is a total of 8 hours.&lt;/li&gt;&#xA;&lt;li&gt;Work starts at 08:00, and ends at 17:00.&lt;/li&gt;&#xA;&lt;li&gt;Lunch is between 12:00 and 13:00.  Working during lunch is forbidden, and thus should not count towards the percentage of work completed.&lt;/li&gt;&#xA;&lt;li&gt;Output should be correct during any time of day, including before work starts (0%) and after the work day ends (100%).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The response for a full 24 hour day is shown below:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/MNu78.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/MNu78.png&quot; alt=&quot;ResponseGraph&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Valid Test Cases&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Time Ran     Output&#xA;03:55        0%&#xA;04:31        0.000&#xA;08:00        0&#xA;09:00        12.5%&#xA;11:31        44%&#xA;12:37        .5&#xA;16:30        0.94&#xA;21:08        100%&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Incorrect Test Cases&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;09:00        12.5     (Interpreted as 1250%&#xA;11:31        43%      (Error of 0.9%)&#xA;12:37        .58      (Did not account for lunch)&#xA;16:30        0.9      (Error of 3.8%)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Notes&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I work 7 days a week 365 days a year; you do not need to check if it's a weekend, holiday, etc.&lt;/li&gt;&#xA;&lt;li&gt;I live in an area with no Daylight Savings Time, Leap Seconds, or any other confusing time-changing events.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so lowest byte-count score wins.&lt;/p&gt;&#xA;" OwnerUserId="68285" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-16T23:56:52.653" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12436" PostTypeId="2" ParentId="12434" CreationDate="2017-05-17T00:04:02.043" Score="11" Body="&lt;h1&gt;Your score is the number of bytes in your code in your language's encoding&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is how it works with every other language on PPCG, and there's no need to make an exception.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In Java, this is a valid solution to &lt;a href=&quot;https://codegolf.stackexchange.com/q/55422/42545&quot;&gt;&amp;quot;Hello, World!&amp;quot;&lt;/a&gt; (posted &lt;a href=&quot;https://codegolf.stackexchange.com/a/55438/42545&quot;&gt;here&lt;/a&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;class H{public static void main(String[]a){System.out.print(&quot;Hello, World!&quot;);}}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There's no rule that says &quot;the code that is required for any full program doesn't count toward your answer's score&quot;. If there was such a rule, you could technically submit this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;System.out.print(&quot;Hello, World!&quot;);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;But as this is not a valid full program in Java, it is not a valid entry.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Now, if you were to choose to include a character in your encoding that auto-magically fills in the rest of the tesseract (say &lt;code&gt;@&lt;/code&gt; for the time being), you could submit &lt;em&gt;this&lt;/em&gt; as a valid entry, as long as your interpreter/compiler supports it:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;         &quot;Hello, World!&quot;࿘@&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or you could do what Hexagony and Cubix do and automatically fill in missing whitespace and no-ops. In that case, this might be a valid answer (again, as long as your interpreter supports it):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;Hello, World!&quot;࿘&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;But regardless of whether you choose to do any of these things, &lt;strong&gt;your score is the number of bytes in your code in your language's (default) encoding&lt;/strong&gt;.&lt;/p&gt;&#xA;" OwnerUserId="42545" LastEditorUserId="42545" LastEditDate="2017-05-17T00:33:22.007" LastActivityDate="2017-05-17T00:33:22.007" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12437" PostTypeId="2" ParentId="12433" CreationDate="2017-05-17T03:56:03.317" Score="6" Body="&lt;p&gt;Stack Exchange, in general, doesn't deal very well with posts that become out of date.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On other sites in the network, this often happens due to changing circumstances in the outside world that have caused some of the answers to no longer apply to the present way of doing things. In this situation, the best you can do is post a competing answer, but because it's often years after the question was asked and it's not getting much more attention, that answer often ends up never rising above the answers that were posted years ago and were correct at the time, but now are misleading.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On PPCG, challenges get outdated too. This happens in two ways:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We're getting better over time at identifying ways to write competitions so that they can be fair and fun for everyone involved. This is why we rarely have language-specific challenges nowadays without a good reason for example. Older challenges can often be written in a way that &quot;locks&quot; the challenge into a form that isn't ideal, such as requiring an inflexible I/O format, screwing up the victory condition, or the like.&lt;/li&gt;&#xA;&lt;li&gt;New languages and language features are written all the time (not to mention bugs in existing languages being fixed), and although challenges have been known to inspire golfing language features (in the hope that they'll be useful on future similar challenges), most of the time new features that would be useful for solving a challenge weren't written with the intent of cheating/loopholing the challenge. As such, the &quot;languages that postdate the challenge are noncompeting&quot; rule is somewhat unfortunate; it works to close a loophole, but can have a somewhat negative effect on old challenges as a side effect.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Note that there's a notable difference from other Stack Exchange sites: on PPCG, it's the &lt;em&gt;question&lt;/em&gt; that becomes problematic, rather than the &lt;em&gt;existing answers&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, if the old challenge is problematic enough to outright close, you're in luck; you can just close it, then submit a duplicate. (We &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11596/62131&quot;&gt;explicitly allow&lt;/a&gt; near-duplicates of offtopic questions, if the duplicate is ontopic.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Newly posted challenges also have major advantages in terms of participation and voting, compared to old challenges; they get advertised in chat, and are fairly easy to get onto Hot Network Questions if you want to (or often, even if you don't), thus advertising them to everyone who uses any Stack Exchange site (including the massive Stack Overflow). I'd typically expect around 8 upvotes for a good early answer to a freshly asked question (there's no hard statistics behind this, just my own sense of where my posts typically end up). By comparison, if a question gets bountied, that typically attracts 2-3 upvotes to my answers on it, and if I just post an answer to an old question that I found via search or related questions (without anything promoting it), that's normally worth 1 or even 0 upvotes. So if you assume that people's incentive to post to the site is at least partially based on either a) views on their answers, or b) reputation, the incentives to post on a new rather than old challenge are very large. (At one time, while I was unemployed, I decided that I wanted to hit reputation cap every day for a week. It wasn't particularly hard, but it required really heavily monitoring the &quot;new questions&quot; list and trying to get in early.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I don't think it's entirely unreasonable to want to &quot;restart&quot; a good old question in order to give it the advantages that new questions have; people will be more inclined to answer it, and also the question itself will naturally be better due to allowing more languages (and better still if you fix wording problems and the like in the process). I'd say it's only worth doing so, though, if the question is good, and the new &quot;duplicate&quot; will be even better. Additionally, we don't really want a situation in which people just copy their own (or worse, other people's) answers from the previous challenge, because that's not really interesting at all. These considerations mean that the duplicate will probably have to be posted intentionally; you want to significantly improve on the challenge, and without awareness of the old challenge (and its answers, if any), you're unlikely to make the new one as good as can be.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So although I'd be fairly encouraging of potential new rules allowing challenge reposts, I'd suggest that we conform &lt;em&gt;at least&lt;/em&gt; to the following restrictions in any process for doing so:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The answers on the new challenge should be expected to be mostly distinct from the answers on the old challenge (either due to newer languages, an improved victory condition, or just general improvement to people's golfing skills since the old challenge was posted).&lt;/li&gt;&#xA;&lt;li&gt;The new challenge should be comprehensively reworked to fix infelicities in the specification, any challenge-specific loopholes that were discovered, and similar issues. Changing details of the challenge should be encouraged whenever it makes it better (and as a bonus, may end up making the new answers more different from the old ones, too).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;On a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11123/62131&quot;&gt;related question&lt;/a&gt;, which is basically your question limited to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; (which has its own specific concerns), there was support for allowing reposts with the permission of the OP and after a six-month waiting period. For questions more generally, six months seems too short; I'd expect a more appropriate timespan to be two years, or even more (long enough that the original OP may be hard to contact; the linked thread suggests waiting for a month for a response, which makes sense). This inspires a third suggestion:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the old challenge is not closed, it should be at least two years old, and the reposter should have permission from the challenge's asker (or else have had no response for a month after asking for permission).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user62131" LastEditorDisplayName="user62131" LastEditDate="2017-05-17T07:35:48.533" LastActivityDate="2017-05-17T07:35:48.533" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="12438" PostTypeId="2" ParentId="2140" CreationDate="2017-05-17T04:10:20.457" Score="1" Body="&lt;h1&gt;Is it a number?&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Given an input, output truthy if it is a valid floating point number, and falsy if it is not. The format that is used in this challenge is &lt;code&gt;[-][&amp;lt;integer&amp;gt;][.][&amp;lt;integer&amp;gt;][e[-]&amp;lt;integer&amp;gt;]&lt;/code&gt;, where square brackets specify optional values. At least one group in the first section (&quot;mantissa&quot;) needs to exist.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some examples of inputs:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Valid&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;100&#xA;-100&#xA;10.245&#xA;-12.44&#xA;.5&#xA;-.2&#xA;0.3&#xA;-0.776&#xA;3365883.0000112&#xA;5e3         # equal to 5000&#xA;-.5245e3    # equal to -524.5&#xA;155.0e-3    # equal to 0.155&#xA;-5e-1       # equal to -0.5&#xA;.           # equal to 0.0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Invalid&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;feed me numbers&#xA;-5-3&#xA;5..2&#xA;4160e&#xA;e4&#xA;543tomatoes234&#xA;123 456&#xA;-3e0.15&#xA;4q2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard loopholes apply&lt;/li&gt;&#xA;&lt;li&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, shortest answer wins. However, it will not be accepted.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="53551" LastActivityDate="2017-05-17T04:10:20.457" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="12439" PostTypeId="1" CreationDate="2017-05-17T06:24:51.157" Score="8" ViewCount="257" Body="&lt;p&gt;&lt;a href=&quot;https://github.com/Wheatwizard/Klein&quot; rel=&quot;nofollow noreferrer&quot;&gt;I made a language&lt;/a&gt; (and its not based on Brain-flak for once!). My language, Klein requires that you specify a topological surface in which the program is embedded.  Currently this means passing 3 bytes to the command line to denote one of 12 supported surfaces.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Currently we score command line arguments as the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12046/56656&quot;&gt;difference from the default&lt;/a&gt;.  However none of the 12 surfaces is really a &quot;default&quot;, and no surface is certainly not the default because it errors immediately.  How should I score answers in Klein?  Should all of the surfaces be considered their own languages? should I just add 3 to every answer written in Klein?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-08-18T18:49:27.047" LastActivityDate="2017-08-18T18:49:27.047" Title="Scoring mandatory but varying command-line arguments" Tags="|discussion|scoring|" AnswerCount="1" CommentCount="8" ClosedDate="2018-02-07T16:07:47.467" ContentLicense="CC BY-SA 3.0" />
  <row Id="12440" PostTypeId="2" ParentId="12439" CreationDate="2017-05-17T06:32:00.353" Score="10" Body="&lt;p&gt;They're evidently part of the program, and they're important information so they should be counted. That said, I'd probably count them as 3 bytes (not 5 as would normally the case when you have to add a space, a hyphen and your three characters to the command-line invocation) since the &quot;standard invocation&quot; always includes those three bytes, it's just not clear what those three bytes are. That's no different from treating the first three bytes of the actual source file as a mandatory header.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, to propose a general rule: if an implementation requires &lt;em&gt;some&lt;/em&gt; command-line argument but no particular value is the default, count the length of the argument without adding bytes for the preceding space and hyphen that are normally needed to add another argument. Optional arguments that can't be combined with existing ones should still add those two bytes if they require additional spaces and hyphens.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2017-05-17T06:49:58.543" LastActivityDate="2017-05-17T06:49:58.543" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12441" PostTypeId="2" ParentId="12433" CreationDate="2017-05-17T07:04:39.083" Score="-1" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;... than the one where one rarely will even glance at my submission. The majority of golfers browse the latest and featured questions.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So, to paraphrase: the culture of the site is broken, and you think we should work around this by breaking it more rather than by trying to address the root cause?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That may be unfair, but it's how the question reads to me.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-05-17T07:04:39.083" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12442" PostTypeId="2" ParentId="2447" CreationDate="2017-05-17T07:21:24.327" Score="52" Body="&lt;h1&gt;Input may be entirely ignored&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If a challenge specifies that your program should take a certain selection of inputs, but not all of them are necessary for you to solve the task, you can simply not take the ones you don't need. (This is equivalent to taking them via a method that your language doesn't look at, such as via command-line argument in a language which has no access to the command line arguments.)&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-05-17T07:21:24.327" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12446" PostTypeId="2" ParentId="2140" CreationDate="2017-05-17T11:47:25.583" Score="0" Body="&lt;h2&gt;Make some arrays&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A recent post on The Daily WTF concerned the creation of four two-dimensional arrays of height &lt;code&gt;n&lt;/code&gt;. Please write a function to create these arrays for me. Here is an example for &lt;code&gt;n=4&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[1] [[1 0 0] [[0] [[0 0 0]&#xA; [0]  [0 1 0]  [0]  [1 0 0]&#xA; [0]  [0 0 1]  [0]  [0 1 0]&#xA; [0]] [0 0 0]] [1]] [0 0 1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All four arrays must be two-dimensional. Arrays which have been flattened in any way are not acceptable.&lt;/li&gt;&#xA;&lt;li&gt;You can write separate functions for each array, in which case your score is the total of the scores for each function.&lt;/li&gt;&#xA;&lt;li&gt;Your functions can call each other, provided you include the name in your score. Otherwise unnamed functions are acceptable.&lt;/li&gt;&#xA;&lt;li&gt;Rather than returning the array(s), you can be passed them in as an input parameter (e.g. using &lt;code&gt;int**&lt;/code&gt; in C).&lt;/li&gt;&#xA;&lt;li&gt;If your language has a builtin for inputting arbitrary data structures, then you can write a full program that outputs using the input format that the builtin would recognise.&lt;/li&gt;&#xA;&lt;li&gt;Alternatively, you can write a full program that outputs source code for the arrays in your language.&lt;/li&gt;&#xA;&lt;li&gt;All standard loopholes are banned.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest function wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2017-05-17T11:47:25.583" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12447" PostTypeId="2" ParentId="8424" CreationDate="2017-05-17T12:18:43.360" Score="-1" Body="&lt;h2&gt;No.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is just shifting work to the caller. Taking that to the nth degree, can't you just submit &lt;code&gt;c=&amp;gt;c()&lt;/code&gt; to every challenge, explaining that your function needs you to call it with the argument &lt;code&gt;z=&amp;gt;...insert actual code here...&lt;/code&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't see any reason why the conventions of function calling in Haskell should affect the conventions of function calling in Javascript.&lt;/p&gt;&#xA;" OwnerUserId="30512" LastActivityDate="2017-05-17T12:18:43.360" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12448" PostTypeId="2" ParentId="2140" CreationDate="2017-05-17T12:59:44.807" Score="0" Body="&lt;h2&gt;Parse a 4-dimensional array&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A 2D array is fairly easy to represent in ASCII art, something like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1  2&#xA;6 24&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;One approach for a 3D array is to have a number of 2D arrays, with an extra blank line between each array:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1  2&#xA;6 24&#xA;&#xA;1  2&#xA;4  8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Things get a little more complicated for 4D arrays though. The best you can do is to arrange a number of 3D arrays side-by-side, but with at least two spaces between each array:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1  2   1  2&#xA;6 24   3  4&#xA;&#xA;1  2   1  4&#xA;4  8  27 64&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So that I don't have to ban full programs, the challenge will be to input 4 (numeric) indices along with a 4D array which will be as some sort of string in the above format, and output the (numeric) 4D array element at those indices. For example, if the 1-indexed indices were 1, 2, 1, 2 then the result would be 4. Rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must at a minimum support integers from 0 to 255, written in decimal.&lt;/li&gt;&#xA;&lt;li&gt;The array will not be ragged, but you will not be given the size of the array. Any of the dimensions may be 1, so &lt;code&gt;0 0 0 0 0&lt;/code&gt; is a valid input in 0-based indexing.&lt;/li&gt;&#xA;&lt;li&gt;Numbers in the array will be consistently justified (please state whether you support left or right, or decimal justification if you support floating-point numbers), but the output must not contain any whitespace except for an optional trailing newline.&lt;/li&gt;&#xA;&lt;li&gt;You may choose 0 or 1-based indexing.&lt;/li&gt;&#xA;&lt;li&gt;You can choose row-major format instead of column-major format, as long as both outer and inner arrays have the same format. The first two indices will however always refer to the outer array and the last two indices to the inner array indexed by the first two indices.&lt;/li&gt;&#xA;&lt;li&gt;You can assume that the indices will always be valid.&lt;/li&gt;&#xA;&lt;li&gt;All standard loopholes are banned.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2017-05-17T12:59:44.807" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12449" PostTypeId="1" AcceptedAnswerId="12453" CreationDate="2017-05-17T13:01:57.917" Score="2" ViewCount="146" Body="&lt;p&gt;A good way for beginners to get into code golf is easy challenges. Also, a good way to test and try out a new golfing language is easy challenges. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/120925/whats-the-file-extension?answertab=votes#tab-top&quot;&gt;We&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/118444/stay-away-from-zero&quot;&gt;also&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/119408/ring-me-when-our-cup-noodles-are-ready&quot;&gt;have&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world&quot;&gt;alot&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/15417/hello-world-window&quot;&gt;of&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/114544/reciprocal-of-a-number-1-x&quot;&gt;them.&lt;/a&gt; I think we should have a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/simple&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;simple&amp;#39;&quot; rel=&quot;tag&quot;&gt;simple&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/trivial&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;trivial&amp;#39;&quot; rel=&quot;tag&quot;&gt;trivial&lt;/a&gt; for that that we can point interested beginners to. It might be nice to have it on the &lt;a href=&quot;https://codegolf.stackexchange.com/tour&quot;&gt;tour&lt;/a&gt;. What are your thoughts?&lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastEditorUserId="56656" LastEditDate="2017-05-22T17:05:06.160" LastActivityDate="2017-05-22T17:05:06.160" Title="Can we have a tag for simple questions for beginners?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ClosedDate="2017-05-17T16:31:54.993" ContentLicense="CC BY-SA 3.0" />
  <row Id="12450" PostTypeId="2" ParentId="12433" CreationDate="2017-05-17T13:22:58.973" Score="15" Body="&lt;p&gt;To respond specifically to your example: according to your profile, you joined the site about six weeks ago. This is probably only the first or second dupe of that question you've seen. I've seen &lt;em&gt;dozens&lt;/em&gt;. I've lost count of the number of times I've explained that there's nothing interesting in getting reposts of old answers with the constants changed. I've posted protest answers which do just that when dupes have been reopened, and seen people express their astonishment that the powerful general technique is &lt;em&gt;actually&lt;/em&gt; powerful and general.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The genuinely new and non-trivial questions already struggle to be seen among the trivial questions which keep coming back to the top because they get 20 answers. If we stopped closing dupes then the most interesting questions would get buried even faster, and nothing of value would be gained.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-05-17T13:22:58.973" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12452" PostTypeId="2" ParentId="12357" CreationDate="2017-05-17T13:46:39.950" Score="1" Body="&lt;h1&gt;A quine must produce itself by processing data&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;To be very explicit:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A quine must contain data&lt;/li&gt;&#xA;&lt;li&gt;A quine must contain commands/function calls to process above data&lt;/li&gt;&#xA;&lt;li&gt;The output of a quine must include the result of above manipulation&lt;/li&gt;&#xA;&lt;li&gt;The output of a quine must be identical to its source code&lt;/li&gt;&#xA;&lt;li&gt;A quine cannot read its own source code&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;This excludes:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Data-only quines, as they don't manipulate data&lt;/li&gt;&#xA;&lt;li&gt;Command-only quines (such as a command that outputs the source code)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Some other notes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This does not require that the &lt;em&gt;entire&lt;/em&gt; output is generated using data processing&lt;/li&gt;&#xA;&lt;li&gt;A print command is considered processing&lt;/li&gt;&#xA;&lt;li&gt;When I say &quot;A quine must contain&quot;, I mean that it must contain in its source code.&lt;/li&gt;&#xA;&lt;li&gt;At a language level, the distinction between code and data is impossible.  For example, is the string &lt;code&gt;a = &quot;print(1)&quot;&lt;/code&gt; data or code?  &lt;strong&gt;If we look at how a quine is executed, the distinction becomes clear.&lt;/strong&gt;  &#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the string is evaluated (we run &lt;code&gt;eval(a)&lt;/code&gt;), then it is code.&lt;/li&gt;&#xA;&lt;li&gt;If the string is processed (we run &lt;code&gt;print(a)&lt;/code&gt; or &lt;code&gt;a.substr(4)&lt;/code&gt;), then it is data.&lt;/li&gt;&#xA;&lt;li&gt;If we do both, then it can be considered both data and code&lt;/li&gt;&#xA;&lt;li&gt;The data from step 1 must be distinct from the commands in step 2.  Otherwise, we could argue that a literal &lt;code&gt;2&lt;/code&gt; is simply the command &lt;code&gt;print()&lt;/code&gt; that is passed the data &lt;code&gt;2&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2017-05-17T18:42:05.967" LastActivityDate="2017-05-17T18:42:05.967" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12453" PostTypeId="2" ParentId="12449" CreationDate="2017-05-17T14:29:41.263" Score="3" Body="&lt;p&gt;Point them at the search bar, which has a few features that aren't as well known as they could be. In this case, &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=answers%3A20&quot;&gt;&lt;code&gt;answers:20&lt;/code&gt;&lt;/a&gt; seems like a pretty good way of identifying trivial challenges. And the fact that it gives more than a thousand results seems like a very good argument for not retagging the results.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-05-17T14:29:41.263" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12454" PostTypeId="2" ParentId="64" CreationDate="2017-05-17T14:53:00.343" Score="6" Body="&lt;p&gt;The language you're trying to solve a particular challenge in also affects how difficult it will be. Solving a regex-related challenge in &lt;a href=&quot;https://github.com/m-ender/retina&quot; rel=&quot;nofollow noreferrer&quot;&gt;Retina&lt;/a&gt; might be easy, but solving the same challenge with brainfuck might be incredibly difficult. Solving pretty much any challenge in &lt;a href=&quot;http://esolangs.org/wiki/Seed&quot; rel=&quot;nofollow noreferrer&quot;&gt;Seed&lt;/a&gt; is difficult.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, not only is difficulty user-subjective, it's also language-subjective.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="34718" LastEditDate="2018-02-26T21:00:55.310" LastActivityDate="2018-02-26T21:00:55.310" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12455" PostTypeId="2" ParentId="12423" CreationDate="2017-05-17T14:55:18.660" Score="2" Body="&lt;h1&gt;Draws&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If the time frame for a duel elapses and either:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Both solutions tie in terms of the winning criterion&lt;/li&gt;&#xA;&lt;li&gt;Neither dueler was able to create a solution&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Then the duel resolves with no winner (no bounty is given). &lt;/p&gt;&#xA;" OwnerUserId="43214" LastActivityDate="2017-05-17T14:55:18.660" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12456" PostTypeId="1" AcceptedAnswerId="12457" CreationDate="2017-05-17T15:05:37.607" Score="8" ViewCount="196" Body="&lt;p&gt;When answering question before I always used to use the &quot;Heading&quot; option present on the formatting box. This produces the following markdown:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;## Heading ##&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;However, within the past couple of days my answers have been getting edited to change it to:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# Heading&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Along with a comment usually saying something like &quot;Use this format instead&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As far as I know this was never a problem in the past and my original heading even works for the leader boards some questions include.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Has the consensus on what headings to use changed?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;My main reason for asking is I've seen a few suggested edits that do this and I'm not sure about whether or not to approve them. And I'd also like to save others the trouble of having to edit my answers.&lt;/p&gt;&#xA;" OwnerUserId="38550" LastEditorUserId="38550" LastEditDate="2017-05-17T15:16:31.257" LastActivityDate="2017-05-18T16:35:47.003" Title="Is there a new consensus on answer headers?" Tags="|discussion|answers|formatting|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12457" PostTypeId="2" ParentId="12456" CreationDate="2017-05-17T15:22:52.437" Score="13" Body="&lt;h3&gt;The consensus is either &lt;code&gt;# Heading&lt;/code&gt; or &lt;code&gt;## Heading&lt;/code&gt;, whichever you prefer.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1200/consensus-for-formatting-of-language-and-score-line?noredirect=1&amp;amp;lq=1&quot;&gt;&lt;em&gt;This previous consensus supports &lt;code&gt;## Heading&lt;/code&gt;&lt;/a&gt;, but now-a-days it's pretty common to use &lt;code&gt;# Heading&lt;/code&gt;. This answer is an attempt at a new consensus, allowing either format.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you like the smaller heading better, use that. I'd recommend against the &lt;code&gt;### Heading&lt;/code&gt;, as it's a bit small (and obviously not just &lt;code&gt;**bold**&lt;/code&gt;), but that's just my opinion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Furthermore, suggested edits to do such things should be rejected, unless they add something else. For example, if they add syntax highlighting, or possibly &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;codeblock formatting &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;instead of &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;backtick&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But other than that, they should be rejected with either &quot;Clearly conflicts with author's intent.&quot; or &quot;Changes are superfluous&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1 last tip: sometimes, if you prefer the &lt;code&gt;# Heading&lt;/code&gt; style, it's better to use &lt;code&gt;## Heading&lt;/code&gt; if the title is too long. This is most common on polyglot and advanced scoring challenges, which can have longer headers (or just long language names).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, take this header:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Python, Ruby, Javascript, R, Julia, Octave, Matlab (5 languages), 186 bytes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You can also write it like this, and it doesn't take up two lines:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Python, Ruby, Javascript, R, Julia, Octave, Matlab (5 languages), 186 bytes&lt;/h2&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="46271" LastEditDate="2017-05-18T16:35:47.003" LastActivityDate="2017-05-18T16:35:47.003" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="12461" PostTypeId="1" CreationDate="2017-05-17T16:54:48.070" Score="0" ViewCount="120" Body="&lt;p&gt;I am currently writing my own language and have a few queries about it, namely the custom code-page that it uses. It is well-known that languages have custom code-pages to avoid multibyte characters such as &lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt; and &lt;a href=&quot;https://github.com/nickbclifford/Ohm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ohm&lt;/a&gt; but I have never heard of a language having more than one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The actual problem here is: I have the commands decided, that take up 256 places on the code-page. But I'm starting on the string compressor that uses a special set of characters that &lt;strong&gt;aren't&lt;/strong&gt; part of the original code-page. I have though of two solutions but wasn't sure if either of these were allowed:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1) Have a code page which uses base 23 (the closest to having 512 characters on it)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2) Use one code-page for the actual program and one for the string compressor.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not sure if either of these are allowed on this site and was wondering if anyone could tell me. However, if you can think of a better solution, feel free to post it as an answer.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2017-05-17T17:09:14.657" Title="Can I use more than one code page?" Tags="|discussion|" AnswerCount="2" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="12463" PostTypeId="2" ParentId="12461" CreationDate="2017-05-17T17:07:24.970" Score="4" Body="&lt;h2&gt;You can use any code-page or combination you like, &lt;em&gt;but&lt;/em&gt;...&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your score will always be the number of bytes in the smallest file needed to make your program work.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This means that when you run &lt;code&gt;wc -c file&lt;/code&gt;, the output is the score for your program. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's really as simple as that. When Dennis says &lt;em&gt;Jelly uses a custom code-page&lt;/em&gt;, this doesn't mean he arbitrarily selected a bunch of characters that are allowed to be counted as one byte. It means that each &lt;a href=&quot;https://github.com/DennisMitchell/jelly/wiki/Code-page&quot; rel=&quot;nofollow noreferrer&quot;&gt;character directly maps to a byte value.&lt;/a&gt; At the end of the day, every Jelly program (as well as every program in any language whatsoever) is just a sequence of bytes. Mapping these bytes to characters is just for human convenience.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will not be able to store more than 256 different characters in 1 byte, no matter what code page you use. This is not because of PPCG rules, but because of math and computer architecture.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2017-05-17T17:07:24.970" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12464" PostTypeId="2" ParentId="12461" CreationDate="2017-05-17T17:09:14.657" Score="4" Body="&lt;h1&gt;What are these bytes exactly?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In any given character encoding, each character corresponds to a number. For example, in ASCII, &lt;code&gt;'a'&lt;/code&gt; is &lt;code&gt;97&lt;/code&gt; which is &lt;code&gt;01100001&lt;/code&gt; in binary. That's 8 bits, so it fits in a byte. Each character corresponds to a number, and to avoid wasting space in Single Byte Character Sets (SBCSs), each number corresponds to a character as well.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;How are bytes counted?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If we map each character to its binary representation, then we see that each character is a byte (in the case of an SBCS at least).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Why can't you encode more than 256 characters with an SBCS then?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The mapping between characters and bytes must be bijective. That is, each character maps to only one number, and each number maps to only one character. A byte can only represent &lt;code&gt;2 ** 8 = 256&lt;/code&gt; different things, and consequently, you can only encode 256 characters using one byte.&lt;/p&gt;&#xA;" OwnerDisplayName="user42649" LastActivityDate="2017-05-17T17:09:14.657" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12465" PostTypeId="2" ParentId="2140" CreationDate="2017-05-17T18:17:14.570" Score="-2" Body="&lt;h1&gt;Prove the Undecideability of the Halting Problem&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/halting-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;halting-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;halting-problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://stackoverflow.com/a/1111200/7605753&quot;&gt;More information on the halting problem.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Either:&lt;/p&gt;&#xA;&lt;p&gt;Create a program that, when given an input, no single program (which receives your source and your input) can determine if your program terminates, or&lt;/p&gt;&#xA;&lt;p&gt;Create a function that, when given an input, no single program (which receives your source and your input) can determine if your function returns.&lt;/p&gt;&#xA;&lt;p&gt;Your score is the byte count of your program plus the byte count of your input (or of the shortest input in the set of input that solves this problem).&lt;/p&gt;&#xA;&lt;p&gt;Lowest score wins.&lt;/p&gt;&#xA;&lt;p&gt;//I would love some input on my wording.&lt;/p&gt;&#xA;" OwnerUserId="65836" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-17T21:38:57.673" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="12466" PostTypeId="2" ParentId="12456" CreationDate="2017-05-17T19:19:11.443" Score="5" Body="&lt;p&gt;Since you mentioned answer headers in general as well, use &lt;code&gt;#Language&lt;/code&gt; or &lt;code&gt;##Language&lt;/code&gt; like Riker said, but then after that, it is pretty standard to use a format like this, using a comma, strikes, and &lt;code&gt;bytes&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;# Language, &amp;lt;s&amp;gt;127&amp;lt;/s&amp;gt; &amp;lt;s&amp;gt;98&amp;lt;/s&amp;gt; 95 bytes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Like this:&lt;/p&gt;&#xA;&lt;h1&gt;Python 2, &lt;s&gt;127&lt;/s&gt; &lt;s&gt;98&lt;/s&gt; 95 bytes&lt;/h1&gt;&#xA;&lt;p&gt;And if your language is supported for prettify markup, you can use &lt;code&gt;&amp;lt;!-- language: lang-python --&amp;gt;&lt;/code&gt; or something similar for syntax highlighting.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-17T19:19:11.443" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12468" PostTypeId="2" ParentId="2140" CreationDate="2017-05-18T00:50:31.193" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Generating strings of Rs and spaces&lt;/h1&gt;&#xA;&lt;p&gt;If a task is to make a string of 16 characters using 2 different characters, it can be done in 2^16=65536 ways. Let's generate them all!&lt;/p&gt;&#xA;&lt;p&gt;Write a program or function which takes a number in range [0, 65535] as input and outputs a string of 16 characters consisting of &lt;code&gt;R&lt;/code&gt; and &lt;code&gt; &lt;/code&gt; (space). One number corresponds to one string and must generate the same string each time the code is run.&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;Suppose that a program/function takes a binary representation of the number and replaces zeros with spaces and ones with Rs to make the string. The conversion from input to output will look as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0     -&amp;gt; &amp;quot;                &amp;quot;&#xA;1     -&amp;gt; &amp;quot;               R&amp;quot;&#xA;2     -&amp;gt; &amp;quot;              R &amp;quot;&#xA;3     -&amp;gt; &amp;quot;              RR&amp;quot;&#xA;...&#xA;65532 -&amp;gt; &amp;quot;RRRRRRRRRRRRRR  &amp;quot;&#xA;65533 -&amp;gt; &amp;quot;RRRRRRRRRRRRRR R&amp;quot;&#xA;65534 -&amp;gt; &amp;quot;RRRRRRRRRRRRRRR &amp;quot;&#xA;65535 -&amp;gt; &amp;quot;RRRRRRRRRRRRRRRR&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Sandbox notes&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This challenge probably needs a better name. If you have an idea, please mention it.&lt;/li&gt;&#xA;&lt;li&gt;I know that this challenge will be boring if making the string from binary representation is the shortest way in all languages. I hope that this isn't the case.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="60517" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-18T00:50:31.193" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12469" PostTypeId="2" ParentId="2140" CreationDate="2017-05-18T06:28:08.007" Score="0" Body="&lt;h1&gt;Boxes&lt;/h1&gt;&#xA;&lt;p&gt;N boxes are lined up in a sequence (1 ≤ N ≤ 20).&#xA;You have A red balls and B blue balls (0 ≤ A ≤ 15, 0 ≤ B ≤ 15).&#xA;The red balls (and the blue ones) are exactly the same.&#xA;You can place the balls in the boxes.&#xA;It is allowed to put in a box, balls of the two kinds, or only from one kind.&#xA;You can also leave some of the boxes empty.&#xA;It's not necessary to place all the balls in the boxes.&lt;/p&gt;&#xA;&lt;h2&gt;challenge!&lt;/h2&gt;&#xA;&lt;p&gt;Write a program, which finds the number of different ways to place the balls in the boxes in the described way.&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;Input contains one line with three integers N, A and B separated by space.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;The result of your program must be an integer written on the only line of output.&lt;/p&gt;&#xA;&lt;h3&gt;Sample I/O&lt;/h3&gt;&#xA;input&#xA;&lt;pre&gt;&lt;code&gt;2 1 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;output&#xA;&lt;pre&gt;&lt;code&gt;9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="62901" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-18T06:28:08.007" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12471" PostTypeId="2" ParentId="12388" CreationDate="2017-05-18T10:32:44.303" Score="-1" Body="&lt;p&gt;Use the consensus at the time of the challenge being posted on main. It is like the code-bowling rules versions. It may change but at the time it is what it is. &lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastActivityDate="2017-05-18T10:32:44.303" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12472" PostTypeId="2" ParentId="2140" CreationDate="2017-05-18T11:03:53.097" Score="0" Body="&lt;h1&gt;Split the atom&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;: 0 &amp;lt;= X &amp;lt;= 2³² - 1&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;: List of numbers in decimal, after recursive splitting in binary format.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Explanation&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Example 1:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;Input:&lt;/code&gt; &lt;code&gt;255&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Current &lt;code&gt;Output&lt;/code&gt; is &lt;code&gt;255&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Binary representation of &lt;code&gt;255&lt;/code&gt; is &lt;code&gt;1111 1111&lt;/code&gt;. Splitting it, we get &lt;code&gt;1111&lt;/code&gt; and &lt;code&gt;1111&lt;/code&gt;, which in decimal are &lt;code&gt;15&lt;/code&gt; and &lt;code&gt;15&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Continuing the &lt;code&gt;Output&lt;/code&gt;, we will have &lt;code&gt;255 15 15&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Now the numbers &lt;code&gt;15&lt;/code&gt; and &lt;code&gt;15&lt;/code&gt; will serve as inputs and these numbers are to be split.&lt;/p&gt;&#xA;&lt;p&gt;Continuing the &lt;code&gt;Output&lt;/code&gt;, we will have &lt;code&gt;255 15 15 3 3 3 3&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Continuing the logic, final &lt;code&gt;Output&lt;/code&gt; will be &lt;code&gt;255 15 15 3 3 3 3 1 1 1 1 1 1 1 1 &lt;/code&gt;. And since &lt;code&gt;1&lt;/code&gt; can no longer be split, the output stops.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Example 2:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;Input:&lt;/code&gt; &lt;code&gt;225&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Current &lt;code&gt;Output&lt;/code&gt; is &lt;code&gt;225&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Binary representation of &lt;code&gt;225&lt;/code&gt; is &lt;code&gt;1110 0001&lt;/code&gt;. Splitting it, we get &lt;code&gt;1110&lt;/code&gt; and &lt;code&gt;0001&lt;/code&gt;, which in decimal are &lt;code&gt;14&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Continuing the &lt;code&gt;Output&lt;/code&gt;, we will have &lt;code&gt;225 14 1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Now the numbers &lt;code&gt;14&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt; will serve as inputs and these numbers are to be split.&lt;/p&gt;&#xA;&lt;p&gt;Since &lt;code&gt;1&lt;/code&gt; is no longer split-able,  the &lt;code&gt;Output&lt;/code&gt; will be &lt;code&gt;225 14 1 3 2&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Final &lt;code&gt;Output&lt;/code&gt; will be &lt;code&gt;225 14 1 3 2 1 1 1 0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Example 3:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;Input: 32&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;Output: 32 4 0 1 0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;Conditions&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If the number of binary digits are odd, the first number will have one fewer binary digit than the next one. Example, &lt;code&gt;20 (10100)&lt;/code&gt; will be split as &lt;code&gt;10&lt;/code&gt; and &lt;code&gt;100&lt;/code&gt;, with decimal output being &lt;code&gt;2&lt;/code&gt; and &lt;code&gt;4&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Standard loophole rules apply.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;0&lt;/code&gt;s and &lt;code&gt;1&lt;/code&gt;s do not propagate further.&lt;/li&gt;&#xA;&lt;li&gt;Program crashing for trying to display too many numbers is a valid exit condition.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="69459" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-18T11:53:20.737" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="12473" PostTypeId="2" ParentId="2140" CreationDate="2017-05-18T11:26:41.313" Score="0" Body="&lt;h1&gt;Simplify ordinal expression&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;WIP.&lt;/p&gt;&#xA;" OwnerUserId="48934" LastActivityDate="2017-05-18T11:26:41.313" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12476" PostTypeId="1" CreationDate="2017-05-18T12:17:10.260" Score="3" ViewCount="240" Body="&lt;p&gt;What are the rules for counting bytes in the immediate window? I have found very little in the way of VBA docuimentation to try and help with this, because is seems to be a relatively uncommon golfing language. &lt;em&gt;For clarity, I'm not sure how the rules would be applied in a few test cases below, and would like an explanation of how to count the bytes for these VBA specific examples&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I type into the immediate window, several things are returned, &lt;strong&gt;I want to know the byte count of what is returned&lt;/strong&gt; (prompted by &lt;a href=&quot;https://codegolf.stackexchange.com/a/121167/68602&quot;&gt;my answer to this question&lt;/a&gt;). Here's some specific cases I'm not sure about:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;?;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;When I enter this, I am put on a new line. Pressing &lt;kbd&gt;↓&lt;/kbd&gt; down arrow does nothing, so I assume no bytes are below the cursor. I notice that a space is added after the &lt;code&gt;;&lt;/code&gt;, so I'm guessing the byte count is 1 for the space + 1 for the newline? Or is it customary to not count the extra space?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Meanwhile&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;?a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;That evaluates the constant a, undefined at this point. When entered, the cursor is put 2 lines below the input, rather than immediately below as before. Also, a space is put after the a, and on the intermediate line. So that suggests 2 newlines and 2 spaces = 4 byte output. Also, unlike before, pressing &lt;kbd&gt;↓&lt;/kbd&gt; does do something, it takes me onto the next line. So maybe 3 newlines?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;?,&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I have no idea what's going on there, does it count as a tab or a load of spaces? Maybe I'm mixing up newlines and spaces, I'm not sure.&lt;/p&gt;&#xA;" OwnerUserId="68602" OwnerDisplayName="Greedo" LastEditorUserId="68602" LastEditDate="2017-05-18T12:33:05.347" LastActivityDate="2017-05-18T13:47:54.013" Title="VBA Immediate window Byte count" Tags="|discussion|tips|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12479" PostTypeId="2" ParentId="12476" CreationDate="2017-05-18T13:47:54.013" Score="2" Body="&lt;p&gt;&lt;code&gt;?;&lt;/code&gt; doesn't add a space to the end of the line. When you select all text in the immediate window, it visualises the line-break by adding a bit of space to the end, but it isn't an actual space. Try moving the caret there. The command &lt;code&gt;?;&lt;/code&gt; means &lt;code&gt;PRINT (nothing) and suppress tabs and newlines&lt;/code&gt;. Newlines are added automatically by VBA to print statements, except when suppressed with &lt;code&gt;;&lt;/code&gt;. This statement therefore has an output of 0 bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;?,&lt;/code&gt; means &lt;code&gt;PRINT (nothing), then TAB and print (nothing again)&lt;/code&gt;. Since newlines are not suppressed, that is also added. In my command window, it seems to add 14 spaces instead of a single tab. I find it hard to score this... I'd go for 2 bytes: tab and newline.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;?a&lt;/code&gt; says &lt;code&gt;Print the undefined var a (nothing)&lt;/code&gt; and is again followed by a newline. Output 1 byte.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The cursor is moved to either 1 or 2 lines below the statement (depending on newlines being allowed or suppressed) simply to allow you to type the next statement and should not be considered as output.&lt;/p&gt;&#xA;" OwnerUserId="44874" LastActivityDate="2017-05-18T13:47:54.013" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12480" PostTypeId="2" ParentId="2140" CreationDate="2017-05-18T13:50:30.700" Score="0" Body="&lt;h1&gt;Pi - The Movie!&lt;/h1&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;So we've had the musical version &lt;a href=&quot;https://codegolf.stackexchange.com/questions/107180/play-the-sound-of-pi&quot;&gt;The Sound of Pi&lt;/a&gt;, now its time for the movie.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge is to write a full program or function that outputs an animated version of pi to 100 decimal places.&lt;/p&gt;&#xA;&lt;p&gt;For your convenience, here's Pi to 100 decimal places&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;Input: No input required&lt;/p&gt;&#xA;&lt;p&gt;Output: A single gif file&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Only one digit or decimal point should be shown at a time&lt;/li&gt;&#xA;&lt;li&gt;Each digit or decimal point should be shown for for between 0.25 and 1.5 seconds (your choice).&lt;/li&gt;&#xA;&lt;li&gt;The font should be clearly visible (different colour to background)&lt;/li&gt;&#xA;&lt;li&gt;The characters should be at least 100 pixels high and have at least a 1 pixel boarder&lt;/li&gt;&#xA;&lt;li&gt;You can use built in values of pi as long as they're correct to 100 dp&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes apply&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the submission with the least amount of bytes wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the time constraint realistic?&lt;/li&gt;&#xA;&lt;li&gt;What tags should I use?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="68029" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-18T16:47:23.973" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="12481" PostTypeId="2" ParentId="5582" CreationDate="2017-05-18T14:05:49.377" Score="4" Body="&lt;h2&gt;Testable &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt; questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you're thinking about asking a question which uses today's date, &lt;strong&gt;don't&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Instead, make it take &quot;today's&quot; date as an input. This way you can actually write test cases which cover all the tricky situations which arise with dates. It's not reasonable to expect people to play around with their system clock just to test their (or someone else's) code.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-05-18T14:05:49.377" CommentCount="0" CommunityOwnedDate="2017-05-18T14:05:49.377" ContentLicense="CC BY-SA 3.0" />
  <row Id="12483" PostTypeId="2" ParentId="5759" CreationDate="2017-05-18T16:36:32.953" Score="2" Body="&lt;h1&gt;Recreationally Concise Code&lt;/h1&gt;&#xA;&lt;p&gt;It sounds professional. Put it on your résumé.&lt;/p&gt;&#xA;&lt;p&gt;This is similar to Martin's &amp;quot;Recreational Programming&amp;quot; suggestion, but this has a &amp;quot;code-golf&amp;quot; implication.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/message/37491309#37491309&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-18T16:36:32.953" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12487" PostTypeId="1" CreationDate="2017-05-18T19:05:29.027" Score="1" ViewCount="55" Body="&lt;p&gt;I just started using PPCG and I'm off to a good start, almost 400 rep in a week.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My best tag is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. But while I was looking at my profile, I saw a bit of a problem.&#xA;&lt;a href=&quot;https://i.stack.imgur.com/Pe59E.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Pe59E.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&#xA;My score for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is 19, but the score of a few of my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; answers adds up to over 19.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What's going on?&lt;/p&gt;&#xA;" OwnerUserId="61563" LastEditorUserId="68942" LastEditDate="2021-06-05T23:20:31.343" LastActivityDate="2021-06-05T23:20:31.343" Title="Tag score not matching combined score of tag answers" Tags="|support|bug|status-bydesign|tags|" AnswerCount="0" CommentCount="7" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12490" PostTypeId="1" CreationDate="2017-05-19T02:10:30.337" Score="7" ViewCount="342" Body="&lt;p&gt;The challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/119775/the-other-day-i-met-a-bear&quot;&gt;(The other day) I met a bear&lt;/a&gt; is a kolmogorov complexity question about the text of a song. As can be seen by looking at its &lt;a href=&quot;https://codegolf.stackexchange.com/posts/119775/revisions&quot;&gt;edit history&lt;/a&gt;, it has been closed three times as a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/6043/were-no-strangers-to-code-golf-you-know-the-rules-and-so-do-i&quot;&gt;We&amp;#39;re no strangers to code golf, you know the rules, and so do I&lt;/a&gt; . It's been reopened three times. It's on its way to being closed a fourth time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a case like this, where there are many people being thinking it should be open, and many thinking it should be closed, voting it back and forth in the review queues is not a good solution. We should discuss things on meta, come to a consensus, and stick with it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this challenge a duplicate?&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorDisplayName="user62131" LastEditDate="2017-05-19T02:40:26.563" LastActivityDate="2017-05-19T17:32:33.693" Title="Is &quot;(The other day) I met a bear&quot; a duplicate?" Tags="|discussion|specific-question|duplicates|kolmogorov-complexity|" AnswerCount="3" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12491" PostTypeId="2" ParentId="12490" CreationDate="2017-05-19T02:17:11.540" Score="5" Body="&lt;h1&gt;No, it's not a duplicate.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In my opinion, we should think of duplicates as &lt;strong&gt;challenges which are sufficiently similar to past challenges that very little or nothing is added to the site&lt;/strong&gt; by having the challenge, and something is lost, because the repetitious challenges crowd out innovative challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I do not think this challenge has that problem. This is a kolmogorov complexity challenge about a song, so it has that much in common with the original Rick Astley question. However, it's not that similar either - the structure of the song is very different, and has a lot of opportunity for cleverness specific to this challenge, as can be seen in the current shortest answer: &lt;a href=&quot;https://codegolf.stackexchange.com/a/119940/20080&quot;&gt;https://codegolf.stackexchange.com/a/119940/20080&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moreover, I think that we are very, very far away from having a problem where we have too many questions about the kolmogorov complexity of songs. We've had roughly one in five years, that we haven't marked as a duplicate. I think it's fine to have questions with some overlap in general, but it's especially fine to have questions with some overlap that are well separated in time, to avoid the crowding-out problem I mentioned earlier.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is beneficial to the site, and should stay open, in my opinion.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorDisplayName="user58826" LastEditDate="2017-05-19T17:32:33.693" LastActivityDate="2017-05-19T17:32:33.693" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12492" PostTypeId="1" AcceptedAnswerId="12493" CreationDate="2017-05-19T03:27:58.050" Score="2" ViewCount="143" Body="&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; submissions, people often like to show how they golfed their program down, striking out the previous byte counts and leaving the current one unformatted. I've seen this done two ways.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The more popular one:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;C, &lt;s&gt;78&lt;/s&gt; &lt;s&gt;75&lt;/s&gt; &lt;s&gt;60&lt;/s&gt; &lt;s&gt;54&lt;/s&gt; 48 bytes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The less popular one:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;C, 48 &lt;s&gt;54&lt;/s&gt; &lt;s&gt;60&lt;/s&gt; &lt;s&gt;75&lt;/s&gt; &lt;s&gt;78&lt;/s&gt; bytes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I think the first one makes more sense, because you're writing the byte count next to the word &quot;bytes&quot;. Is there a standard? Which should we use?&lt;/p&gt;&#xA;" OwnerUserId="61563" LastActivityDate="2017-05-19T21:45:58.710" Title="Strikethrough byte counts in answer headers" Tags="|discussion|support|code-golf|code-challenge|" AnswerCount="1" CommentCount="5" ClosedDate="2017-05-22T22:35:55.030" ContentLicense="CC BY-SA 3.0" />
  <row Id="12493" PostTypeId="2" ParentId="12492" CreationDate="2017-05-19T03:46:50.473" Score="7" Body="&lt;h1&gt;It doesn't matter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I don't think we need a standard for this type of thing.  Here are the reasons why in a convenient list format:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;No one is going to enforce it.  I don't foresee anyone actually going out of their way to enforce any ruling on a regular basis.  And there isn't much point in having rules that are not enforced.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Someone will disagree.  No matter how mundane or arbitrary a choice is it will always make someone upset.  Evidently some people are formatting their answers in both formats, there are people that like it both ways.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;We would have to go back and change all the old answers.  The main problem with this is that it takes effort to do, and no one wants to put in all the effort if its a formatting thing.  This particular change is not very easy to search for because both forms are very similar.  If there are a lot that need to be changed we don't want to flood the front page with tons of edits.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;People will forget about the standard anyway.  Not everyone will see this post, and the people that will are liable to forget.  Any standard we make will be forgotten relatively quickly making any effort we put into standardizing pretty worthless.&lt;sup&gt;&lt;sup&gt;&lt;sup&gt;We are all just dust in the wind anyway.&lt;/sup&gt;&lt;/sup&gt;&lt;/sup&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The first option is already overwhelmingly popular.  I've been here for almost a year and I cannot recall anyone using the second method.  We seem to be already pretty standardized.  New users will likely mimic what the already see and I can only see it becoming more homogenized as time goes on.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There is no real benefit to having a standard.  Both formats suggested are perfectly readable, so there is no reason to prescribe a particular one other than for the sake of standardization.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;All in all it seems like a lot of effort for next to no actual pay off.  I don't think it is necessary to decide on an &lt;strong&gt;official&lt;/strong&gt; formatting.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-05-19T21:45:58.710" LastActivityDate="2017-05-19T21:45:58.710" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12497" PostTypeId="2" ParentId="12490" CreationDate="2017-05-19T15:18:13.263" Score="0" Body="&lt;p&gt;It's definitely a duplicate, but maybe not of the rickroll question. (IMO, it's partially a dupe of both.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's look at the first couple paragraphs of the lyrics:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;The other day,&#xA;The other day,&#xA;I met a bear,&#xA;I met a bear,&#xA;A great big bear,&#xA;A great big bear,&#xA;Oh way out there.&#xA;Oh way out there.&#xA;&#xA;The other day,&#xA;I met a bear,&#xA;A great big bear,&#xA;Oh way out there.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is pretty much &quot;take 4 lines and repeat them with in &lt;code&gt;AABBCCDDABCD&lt;/code&gt; pattern&quot;. It stays like this through the whole song.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are really 2 practical ways to compress this: have a list of all distinct lines and output them in the above format, or using a builtin compression algorithm.  IMHO, it's very likely to end up with the last format being shorter.  That's why I voted to close as a dupe of the rickroll challenge the first time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(And no, I don't consider the rickroll question's &quot;include the compression algo in your code&quot; stipulation to change this)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So yeah, it's partially a duplicate of that. However, there's another question that fits a bit better: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/57549/work-it-harder-make-it-better&quot;&gt;Work it harder, make it better&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first half of the song is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Work It&#xA;Make It&#xA;Do It&#xA;Makes Us&#xA;Harder&#xA;Better&#xA;Faster&#xA;Stronger&#xA;More Than&#xA;Hour&#xA;Our&#xA;Never&#xA;Ever&#xA;After&#xA;Work Is&#xA;Over&#xA;(2x)&#xA;&#xA;Work It Harder Make It Better&#xA;Do It Faster, Makes Us Stronger&#xA;More Than Ever Hour After&#xA;Our Work Is Never Overx&#xA;(7x)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The rest of the song isn't really important, it's just further variations of the paragraphs from the beginning. The important part:  yes, this song can be done with a compression algorithm, but it's also easier to be done with a preset format. (i.e. save each of the blocks of text and print them out x times)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I still personally think it's a dupe of the rickroll song, but that's obviously not shared by everybody.  However, if it's not a dupe of that, then it's definitely a dupe of the daft punk song.&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="46271" LastEditDate="2017-05-19T17:32:08.280" LastActivityDate="2017-05-19T17:32:08.280" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12498" PostTypeId="1" CreationDate="2017-05-19T16:47:07.987" Score="7" ViewCount="340" Body="&lt;p&gt;We seem to have implied restrictions that code submissions should be deterministic, but this doesn't seem to be well-defined or explicitly restricted as a loophole.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The closest loophole is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9447/34718&quot;&gt;this one&lt;/a&gt;. See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default/9447#comment28124_9447&quot;&gt;this comment&lt;/a&gt;, which provides an example where the forbidden loophole would've been used to prevent non-deterministic submissions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some users are unfamiliar with what it means for a program to be deterministic, so we should provide a clear definition of what our requirements are. Then we can specify whether such a restriction should be the default, which I think it should be.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastActivityDate="2017-05-31T10:09:01.223" Title="How do we define &quot;deterministic&quot;, and is it required by default?" Tags="|discussion|policy|" AnswerCount="4" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12499" PostTypeId="2" ParentId="12498" CreationDate="2017-05-19T16:58:34.397" Score="-4" Body="&lt;h2&gt;Definition:&lt;/h2&gt;&#xA;&lt;p&gt;From Google:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;deterministic&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;relating to the philosophical doctrine that all events, including human action, are ultimately determined by causes regarded as external to the will.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;In relation to answers on this site, this means that the user cannot determine with 100% accuracy what the output of their program will be, or the output will not be consistent and identical across multiple executions.&lt;/p&gt;&#xA;&lt;p&gt;As simple example of a non-deterministic program is a program that prints the current system time in nanoseconds. The user has no control over the output of the program with regard to the source code, and the output of the program depends on something other than the user, the input, and the source code. The output will not be the same across multiple executions, and the user cannot &lt;em&gt;determine&lt;/em&gt; what the output will be without running the program.&lt;/p&gt;&#xA;&lt;p&gt;This definitions fits our criteria for our challenges because:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Challenges require a specific solution or output, and if the program ever doesn't produce the correct solution, it's invalid.&lt;/li&gt;&#xA;&lt;li&gt;If you can't determine the output, you can't maintain that your answer is correct, unless the output is not required to be consistent.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Default:&lt;/h2&gt;&#xA;&lt;p&gt;The restriction that an answer should be deterministic should be a default restriction. The number of challenges that require a constant or consistent solution is far greater than the ones that do not.&lt;/p&gt;&#xA;&lt;p&gt;If the OP posts a challenge, they can override the default by stating the non-deterministic solutions are allowed. If the challenge obviously does not require deterministic output due to its nature, then stating this is not necessary. An example of this would be a challenge where the goal is to output the current time, which obviously will not be consistent. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenges often involve randomness, so it should be allowed by default for those.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-19T17:07:00.273" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12500" PostTypeId="2" ParentId="12490" CreationDate="2017-05-19T17:29:52.170" Score="-2" Body="&lt;h1&gt;Dupe of both&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I am the original author&lt;/strong&gt; and I think it should be closed as a dup of &lt;em&gt;both&lt;/em&gt;. Currently it is just a dupe of Work it harder, make it better, but this question really has alot in common with both. I regret making that question now. It should be closed as both (but not deleted, people spent time golfing answers on it, but I didn't spend time writing it.) &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Song lyric golfs can be boring, as answers can be copied over with small modifications from one to the other, and end up in the HNQ, which is one of our site's best places to show what we do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/30525/beta-decay&quot;&gt;Beta Decay&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12490/is-the-other-day-i-met-a-bear-a-duplicate#comment42241_12491&quot;&gt;said:&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The problem I have with song challenges is that they require very little effort to write, just a copy and paste job: codegolf.meta.stackexchange.com/a/6960/30525. Are those the type of questions that we want on PPCG, cluttering the HNQ? &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerDisplayName="user58826" LastActivityDate="2017-05-19T17:29:52.170" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12501" PostTypeId="1" AcceptedAnswerId="12503" CreationDate="2017-05-19T17:54:01.570" Score="15" ViewCount="1149" Body="&lt;p&gt;Here's a situation that came up recently in chat, and I realised I'm not sure what our rules are.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A few challenges require code to run without crashing/erroring. As such, a runtime error would make the answer ineligible. For example, here's a requirement from the &quot;add a language to a polyglot&quot; challenge (the original context, but I'm interested in a general answer):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program must run without erroring out or crashing. Warnings (and other stderr output) are acceptable, but the program must exit normally (e.g. by running off the end of the program, or via a command such as exit that performs normal program termination).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Something that challenges typically don't consider is as to what happens if the compiler crashes. We recently discovered that in Thutu, it's possible to write code that crashes the compiler, but because the compiler writes output as it's running, when it crashes, partially complete output is left in the output file — and it's possible to crash the compiler in such a way that that output is a program that runs without error.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's something of a philosophical problem here; we normally think in terms of languages as defined by a particular implementation, but in this case, the implementation doesn't really give an opinion, as steps &quot;outside&quot; the compiler itself are relevant. In particular, do we consider the compile technique as &lt;code&gt;compile; run&lt;/code&gt; (i.e. attempt to run regardless of what happens in the compile), or &lt;code&gt;compile &amp;amp;&amp;amp; run&lt;/code&gt; (i.e. run only if the program compiled successfully)?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So my question is, in this sort of situation, does a program that crashes the compiler, but has executable resulting output, count as running without error?&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-05-31T21:51:49.617" Title="If code fails to compile, but runs anyway, does that count as executing without error?" Tags="|discussion|rules|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12502" PostTypeId="2" ParentId="12498" CreationDate="2017-05-19T18:14:03.543" Score="17" Body="&lt;h2&gt;An answer must always comply with the specification, but need not always comply in the same way&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For example, suppose the challenge is &quot;return the longest substring of the input made entirely of vowels; it doesn't matter which substring you return in the situation where there's a tie&quot;. A submission that, on the input &lt;code&gt;aeziozu&lt;/code&gt;, sometimes returns &lt;code&gt;ae&lt;/code&gt; and sometimes returns &lt;code&gt;io&lt;/code&gt;, would be acceptable despite not being deterministic. A submission that usually returns &lt;code&gt;ae&lt;/code&gt; and sometimes returns &lt;code&gt;u&lt;/code&gt; would not be acceptable, as it doesn't &lt;em&gt;always&lt;/em&gt; comply with the specification.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or to put it another way, we check whether the worst-case output is still valid. If it is, the answer is valid, even if it isn't deterministic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If an answer &lt;em&gt;is&lt;/em&gt; nondeterministic, it can't necessarily be verified by running the program, and as such it would need some sort of proof or argument that that's valid. (This isn't really an issue, as determinism of the program also can't be verified by running it, and many challenges have infinitely many valid inputs anyway, so some sort of proof that the program is valid is typically going to be required regardless of what we decide here.)&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-05-19T18:14:03.543" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12503" PostTypeId="2" ParentId="12501" CreationDate="2017-05-19T18:22:03.447" Score="12" Body="&lt;h2&gt;In my opinion, yes.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Typically, anything that happens during the compilation stage is ignored. For example, a C/C++ program that produces warnings doesn't make any difference as long the executable runs without errors. You can see this in the text you quoted: (emphasis added)&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Your &lt;strong&gt;&lt;em&gt;program&lt;/em&gt;&lt;/strong&gt; must run without erroring out or crashing. &lt;em&gt;Warnings (and other stderr output) are acceptable&lt;/em&gt;, but the &lt;strong&gt;&lt;em&gt;program&lt;/em&gt;&lt;/strong&gt; must exit normally (e.g. by running off the end of the program, or via a command such as exit that performs normal program termination).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This would seem to imply that anything happening during the compilation stage is irrelevant to the final submission. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would consider the compiler technique to be &lt;code&gt;compile; run&lt;/code&gt;. If your compiler step crashes your computer, burns your house down, or causes gremlins to fly out of your keyboard, this doesn't matter since the compiler still was able to create a valid executable.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2017-05-19T18:22:03.447" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12507" PostTypeId="1" CreationDate="2017-05-20T09:16:29.063" Score="16" ViewCount="514" Body="&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12433/194&quot;&gt;recent meta question&lt;/a&gt; seems to me to be &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12441/194&quot;&gt;asking the wrong question&lt;/a&gt;. However, there is some truth in the underlying issue raised:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The majority of golfers browse the latest and featured questions.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Or in the word's of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12437/194&quot;&gt;ais523's answer&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Newly posted challenges also have major advantages in terms of participation and voting, compared to old challenges... So if you assume that people's incentive to post to the site is at least partially based on either a) views on their answers, or b) reputation, the incentives to post on a new rather than old challenge are very large.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Question&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;How can we encourage people both to answer old questions and to look at and vote on new answers to them?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Previous ideas&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2063/194&quot;&gt;Change behaviour of Community user to poke more “old” questions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9090/194&quot;&gt;Tour to Improve the Discoverability of Old Challenges&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9140/194&quot;&gt;followup&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-06-01T23:21:58.690" Title="Incentives for answering old questions" Tags="|discussion|voting|incentives|" AnswerCount="5" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12508" PostTypeId="2" ParentId="2140" CreationDate="2017-05-20T10:48:54.033" Score="1" Body="&lt;h1&gt;Don't break the bridges!&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Introduction:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You are a worker, who is in charge of managing a set of bridges, connecting a square grid of &quot;nodes&quot;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;N - N - N&#xA;|   |   |&#xA;N - N - N&#xA;|   |   |&#xA;N - N - N&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(the grid here is 3 by 3, but they can be larger).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each of the bridges has a set capacity from &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;10&lt;/code&gt;, and each of the bridges has a number of cars over them, also from &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;10&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a bridge has a higher capacity than the number of cars on that bridge, then it is considered &quot;safe&quot;, and you can cross over it.&lt;/li&gt;&#xA;&lt;li&gt;If a bridge's capacity and number of cars going over it are equal, then it is considered &quot;stable&quot;. It won't collapse, but you can't cross over it.&lt;/li&gt;&#xA;&lt;li&gt;If a bridge has a lower capacity than the number of cars on that bridge, then it is considered &quot;collapsing&quot;, and you only have a limited amount of time to fix it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;When a bridge has &lt;code&gt;n&lt;/code&gt; capacity and &lt;code&gt;m&lt;/code&gt; cars, with &lt;code&gt;n&lt;/code&gt; smaller than &lt;code&gt;m&lt;/code&gt;, the time it takes to collapse is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;      m + n&#xA;ceil( ----- )&#xA;      m - n&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You must take materials (and therefore reduce the bridge's capacity) from other bridges and arrive to those bridges on time to fix them! To get materials from a bridge, you must cross over it. For example, take this small arrangement:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A - B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The bridge between &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt; (which we'll call &lt;code&gt;AB&lt;/code&gt;) has &lt;code&gt;3&lt;/code&gt; capacity, and let's say you're on &lt;code&gt;A&lt;/code&gt;, and want to take &lt;code&gt;1&lt;/code&gt; material. To take the material, simply cross from &lt;code&gt;A&lt;/code&gt; to &lt;code&gt;B&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, &lt;code&gt;AB&lt;/code&gt; has &lt;code&gt;2&lt;/code&gt; capacity, and you have &lt;code&gt;1&lt;/code&gt; material on you. You may only cross over bridges that are &quot;safe&quot;, though (or if you're fixing a bridge, which is explained in the next paragraph).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To fix a bridge, you must go over it, thereby depositing all materials needed to fix the bridge. For example, in the example above, if &lt;code&gt;AB&lt;/code&gt; had &lt;code&gt;1&lt;/code&gt; capacity and &lt;code&gt;2&lt;/code&gt; cars currently on it, and you had &lt;code&gt;2&lt;/code&gt; material on you, once you cross the bridge you will have &lt;code&gt;1&lt;/code&gt; material, because that is all that's required to fix the bridge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must fully cross a broken bridge before the bridge collapses, otherwise it will break. Each crossing of a bridge takes &lt;code&gt;1&lt;/code&gt; hour, and the time it takes for the bridge to collapse is shown in the formula above. For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A&#xA;|&#xA;B&#xA;|&#xA;C - D&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In this example, if your starting node was &lt;code&gt;A&lt;/code&gt;, and &lt;code&gt;CD&lt;/code&gt; only had a &quot;lifespan&quot; of 2 hours, the bridge would collapse before you can get to it (crossing &lt;code&gt;AB&lt;/code&gt; takes 1 hour, crossing &lt;code&gt;BC&lt;/code&gt; takes another hour).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to make a program that calculates, given a list of bridges, which are represented themselves as lists of two elements (first element is capacity, second element is cars on the bridge), whether or not it's possible to fix all of the bridges. The bridges work from top-to-bottom, left-to-right - so an input of&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[3 2] [3 2] [2 5] [5 1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;means that the actual grid looks like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;    3&#xA; A --- B&#xA; |  2  |&#xA;3|2   2|5&#xA; |  5  |&#xA; C --- D&#xA;    1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So &lt;code&gt;AB&lt;/code&gt; has a capacity of &lt;code&gt;3&lt;/code&gt; and &lt;code&gt;2&lt;/code&gt; cars, &lt;code&gt;AC&lt;/code&gt; has a capacity of &lt;code&gt;3&lt;/code&gt; and &lt;code&gt;2&lt;/code&gt; cars, &lt;code&gt;BD&lt;/code&gt; has a capacity of &lt;code&gt;2&lt;/code&gt; and &lt;code&gt;5&lt;/code&gt; cars, and &lt;code&gt;CD&lt;/code&gt; has a capacity of &lt;code&gt;5&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt; car.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules / Specs:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program must work for, at least, &lt;code&gt;10 * 10&lt;/code&gt; grids.&lt;/li&gt;&#xA;&lt;li&gt;Your program may accept the input as either a string with any delimiter, or a list of lists (see example I/O).&lt;/li&gt;&#xA;&lt;li&gt;Your program must output the same value for true for all true values, and it must output the same value for false for all false values.&lt;/li&gt;&#xA;&lt;li&gt;You can either submit a full program or a function.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example I/O:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[5 5] [5 5] [1 1] [3 3]] =&amp;gt; true&#xA;[[2 5] [2 2] [3 3] [1 2]] =&amp;gt; false&#xA;[[3 2] [3 2] [2 5] [5 1]] =&amp;gt; true&#xA;&#xA;NOTE, you can take the input like this as well:&#xA;[[3, 2], [3, 2], [2, 5], [5, 1]] (Python arrays)&#xA;3,2,3,2,2,5,5,1                  (Comma-separated string)&#xA;3 2 3 2 2 5 5 1                  (Space-separated string)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="49561" LastEditDate="2017-05-20T11:02:08.753" LastActivityDate="2017-05-20T11:02:08.753" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12509" PostTypeId="2" ParentId="2140" CreationDate="2017-05-20T18:16:19.037" Score="1" Body="&lt;h1&gt;How many times?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/q/121530/41024&quot;&gt;Rotational symmetry of string&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a string, return its shortest substring that, when repeated a number of times, will produce the original string, as well as the number itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;ABCDABCDABCDABCD&quot; =&amp;gt; &quot;ABCD&quot;, 4&#xA;&quot;AAAAAAAAAA&quot; =&amp;gt; &quot;A&quot;, 10&#xA;&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZ&quot; =&amp;gt; &quot;ABCDEFGHIJKLMNOPQRSTUVWXYZ&quot;, 1&#xA;&quot;&quot; =&amp;gt; &quot;&quot;, 0&#xA;&quot;Don't repeat yourself. Don't repeat yourself. &quot; =&amp;gt; &quot;Don't repeat yourself. &quot;, 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may return the substring and the number in any format you'd like, as long as it's consistent and clear i.e. you can always separate the number correctly from the substring e.g. &lt;code&gt;abc12&lt;/code&gt; isn't allowed since you can't determine whether &lt;code&gt;abc&lt;/code&gt; is to be repeated &lt;code&gt;12&lt;/code&gt; times or &lt;code&gt;abc1&lt;/code&gt; is to be repeated &lt;code&gt;2&lt;/code&gt; times. The substring must be returned verbatim, while the number can be returned in any generally allowed format per meta consensus.&lt;/li&gt;&#xA;&lt;li&gt;The substring must be the shortest possible.&lt;/li&gt;&#xA;&lt;li&gt;For the empty string, you must return &lt;code&gt;&quot;&quot;&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the challenge description golfed enough? :P&lt;/li&gt;&#xA;&lt;li&gt;May I improve the return/output format?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2017-05-20T21:17:23.143" LastActivityDate="2017-05-20T21:17:23.143" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12512" PostTypeId="2" ParentId="12507" CreationDate="2017-05-20T21:16:51.543" Score="12" Body="&lt;h2&gt;Clarify how to handle changing standards&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Visibility and incentives aside, answering old questions is awkward because of changing site standards. I've given up on submissions I started to write because I didn't know what I was allowed to do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can I submit a function as allowed by default now, but not when the challenge was posted? Am I expected to figure out what was standard then? If an existing answer spends bytes to process input like &lt;code&gt;l=map(int,raw_input().split())&lt;/code&gt;, do I have to do the same? I worry that if I take advantage of looser modern standards, I look like I'm winning unfairly by playing by different rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moreover, most challenges from 2014 and earlier would be closed as unclear if posted today. So, I don't even know if I've met the spec, and if I ask in a comment, I'll probably never get a response. Should I just make a judgment call and edit that in? Is that rude, or maybe biased? What if some submissions interpret it differently? What if there's some dumb unobservable requirement that half the answers ignore, or a subjective bonus?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I find this uncomfortable enough that I often don't bother answering old questions, even when I've already golfed a solution and come to terms that it won't get much visibility. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some community guidance on what's OK would make me feel less like I'm treading on thin ice. Or, community projects to clean up old dupe targets so that we can make decisions as a group.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2017-05-20T21:16:51.543" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12513" PostTypeId="2" ParentId="12507" CreationDate="2017-05-21T01:37:17.347" Score="8" Body="&lt;h1&gt;Just bumping an old question can help&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Every now and then I like to pick a page deep into the challenge list and answer a question from it. Yesterday (a little before this question was asked), I answered &lt;a href=&quot;https://codegolf.stackexchange.com/q/1144/62131&quot;&gt;this question&lt;/a&gt;, which was on the &lt;em&gt;last page&lt;/em&gt; sorted by &quot;active&quot; at the time. Since I did that, the question's had a number of other answers (if you look at the dates of the answers, there's an obvious split, with some being posted in 2011 and some being posted in 2017, with nothing in between).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't think randomly bumping questions is all that useful – some questions aren't worth bumping, for instance – but looking through old questions for one you like the look of, and answering it, is a good way to  increase the supply of interesting questions that people will find.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-05-21T01:37:17.347" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12514" PostTypeId="1" CreationDate="2017-05-21T07:12:01.093" Score="5" ViewCount="185" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/69/41024&quot;&gt;Golf you a quine for great good!&lt;/a&gt; is a great example, since it was posted before the quine consensus was made. That means it's cluttered with answers not following it. &lt;strong&gt;Should we repost challenges containing a lot of answers affected by a consensus change?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="66833" LastEditDate="2021-05-16T18:08:04.823" LastActivityDate="2021-05-16T18:08:04.823" Title="Should we repost a challenge because of a changed consensus?" Tags="|discussion|policy|asking-questions|reposting|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12515" PostTypeId="2" ParentId="12514" CreationDate="2017-05-21T07:12:01.093" Score="0" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'd say if they contain 20 or more answers not following current non-retroactive consensus that didn't exist back then, we should repost. I'd say that we should wait for 6 months until we repost or re-repost. Note that this does not include retroactive consensus, where old answers are supposed to follow, since then we can just delete them with a notice until they're edited.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2017-05-21T07:12:01.093" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12517" PostTypeId="2" ParentId="11924" CreationDate="2017-05-21T07:16:29.537" Score="2" Body="&lt;h1&gt;CJam&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;CJam submissions can be full programs that take input using &lt;code&gt;q&lt;/code&gt; (read whole input), &lt;code&gt;r&lt;/code&gt; (read whitespace-separated token), and &lt;code&gt;l&lt;/code&gt; (read line). Alternatively, they can take input from the command line arguments using &lt;code&gt;ea&lt;/code&gt; (push command-line arguments).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These are all valid CJam submissions:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;q S/ :i ~ +&#xA;ri ri +&#xA;ea :i ~ +&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;CJam answers can also be in the form of blocks, which are code objects. Including these in a full program pushes them to the stack where they can be executed with &lt;code&gt;~&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{ + }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;CJam blocks can also be named by appending &lt;code&gt;:?&lt;/code&gt; to a block, where &lt;code&gt;?&lt;/code&gt; is any capital letter:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{ ) \(\ 1$ {K}&amp;amp; }:K&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Blocks can take input using &lt;code&gt;q&lt;/code&gt;, &lt;code&gt;r&lt;/code&gt;, and &lt;code&gt;l&lt;/code&gt;, but full programs may not take input from the stack.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Full programs and blocks can both output via &lt;code&gt;o&lt;/code&gt; (output), &lt;code&gt;n&lt;/code&gt;, (output with trailing newline - this is only available on TIO), and &lt;code&gt;p&lt;/code&gt; (output string representation with trailing newline).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ri ri + o&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;However, full programs may also rely on CJam's automatic printing of the stack. Keep in mind that the stack is printed with a trailing newline, though this is usually unimportant in most challenges:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ri ri +&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Blocks may output with &lt;code&gt;o&lt;/code&gt;, &lt;code&gt;n&lt;/code&gt;, or &lt;code&gt;p&lt;/code&gt;, or by leaving values on the stack:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{ + n }&#xA;{ + }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;CJam has no special character encoding. All commands are one byte, but you might run into Unicode in string or character literals. You can use a site like &lt;a href=&quot;https://mothereff.in/byte-counter&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://mothereff.in/byte-counter&lt;/a&gt; to check your code length in UTF-8.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;e# 8 bytes&#xA;ri ri +&#xA;e# 15 bytes&#xA;ri ri + '&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Implementation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There is a JavaScript implementation of CJam on &lt;a href=&quot;https://cjam.aditsu.net&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://cjam.aditsu.net&lt;/a&gt;. You can also use the Java interpreter from &lt;a href=&quot;https://tio.run/nexus/cjam&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://tio.run/nexus/cjam&lt;/a&gt;, or download it from &lt;a href=&quot;https://sourceforge.net/p/cjam&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://sourceforge.net/p/cjam&lt;/a&gt;. Note that the TIO version supports some extra features (like &lt;code&gt;n&lt;/code&gt;) that the aditsu.net and SourceForge versions do not.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="61384" LastEditDate="2017-12-30T20:07:20.997" LastActivityDate="2017-12-30T20:07:20.997" CommentCount="0" CommunityOwnedDate="2017-05-21T07:16:29.537" ContentLicense="CC BY-SA 3.0" />
  <row Id="12520" PostTypeId="2" ParentId="2140" CreationDate="2017-05-21T11:46:03.027" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/132693/make-a-minecraft-crafting-table&quot;&gt;Make a Minecraft Crafting Table&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2017-07-16T16:52:00.723" LastActivityDate="2017-07-16T16:52:00.723" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12521" PostTypeId="2" ParentId="12514" CreationDate="2017-05-21T11:50:39.407" Score="11" Body="&lt;h1&gt;No, We should update the old one&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Challenges like the Quine challenge have tons of answers, and most of them are valid.  Making a second question would either require all the existing valid answers to be ported over or would likely be largely incomplete.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Neither of these seem like feasible options to me.  Porting them over would be difficult because a lot of these are answers were made by users of varying degrees of active, ensuring that we allow every user to keep claim to his or her answer while porting them in a timely fashion seems impossible.   Being incomplete is also rather bad because it means that our Quines will be partially split between two questions which can be confusing and annoying.  This is the kind of change that I feel we would really regret in only a short while.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think the more reasonable option is to edit the question to reflect our updated community consensuses and delete the offending answers.  This option is not without flaws but I think it is better than both doing nothing and reposting.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-05-21T11:50:39.407" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12522" PostTypeId="2" ParentId="2140" CreationDate="2017-05-21T14:36:52.623" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/122284/raindrops-are-falling-on-my-glasses&quot;&gt;Raindrops are falling on my... glasses?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2017-05-23T21:23:42.143" LastActivityDate="2017-05-23T21:23:42.143" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="12527" PostTypeId="1" CreationDate="2017-05-22T12:19:28.333" Score="0" ViewCount="30" Body="&lt;p&gt;ETHproductions made &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/12398#12398&quot;&gt;this perfectly cromulent sandbox post&lt;/a&gt; but hasn't touched it in a week. Is it poor form to move it to the main site for him/her? (And then immediately post my own solution?)&lt;/p&gt;&#xA;" OwnerUserId="30512" LastActivityDate="2017-05-22T12:19:28.333" Title="Can I post someone else's sandbox challenge?" Tags="|discussion|" AnswerCount="0" CommentCount="4" ClosedDate="2017-05-22T12:42:35.467" ContentLicense="CC BY-SA 3.0" />
  <row Id="12528" PostTypeId="2" ParentId="2140" CreationDate="2017-05-22T13:23:21.090" Score="1" Body="&lt;h2&gt;Quine without a character&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program in any language that takes as input any character, and outputs a quine in the same language, that does not contain that character.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance (for some made up language):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: b&#xA;Output: s(fg;fg)&#xA;Run &quot;s(fg;fg)&quot;&#xA;Output: s(fg;fg)&#xA;&#xA;Input: (&#xA;Output: s[fg;fg]&#xA;Run &quot;s[fg;fg]&quot;&#xA;Output: s[fg;fg]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your program must handle as input every character within the range of characters that are valid in the source code of the language you're using, including new lines, punctuation, etc.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; with penalties. Your score is &lt;code&gt;L + 1000xC&lt;/code&gt; where:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;L is the length of your program in bytes&lt;/li&gt;&#xA;&lt;li&gt;C is the number of characters it fails to meet the requirements on.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So, if you produce a 50-character program that passes every character except for &lt;code&gt;(&lt;/code&gt; and &lt;code&gt;)&lt;/code&gt;, your score is 2050.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard loopholes are forbidden, and standard methods of input/output are ok. Outputs must be a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4877/what-counts-as-a-proper-quine&quot;&gt;proper quine&lt;/a&gt;, whatever that is.&lt;/p&gt;&#xA;" OwnerUserId="30512" LastActivityDate="2017-05-22T13:23:21.090" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12529" PostTypeId="2" ParentId="2140" CreationDate="2017-05-22T14:36:04.660" Score="0" Body="&lt;h1&gt;Program Equilibrium Iterated Prisoner's Dilemma Tournament&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is an iterated prisoners dilemma tournament. You are to make a bot that plays the prisoners dilemma against the other contestants, but with a twist- you can perfectly simulate your opponent!&#xA;&lt;br&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Iterated Prisoner's Dilemma&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Prisoner%27s_dilemma&quot; rel=&quot;nofollow noreferrer&quot;&gt;prisoner's dilemma&lt;/a&gt; is&#xA;a two-player game in which players can choose to either &quot;Cooperate&quot; or &quot;Defect&quot;&#xA;against their opponent.  The payoff matrix for the prisoner's dilemma looks&#xA;like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;                           Player 2&#xA;                       C              D&#xA;&#xA;                 ------------------------------&#xA;                |              |               |&#xA;            C   |    (3, 3)    |    (0, 5)     |&#xA;                |              |               |&#xA;Player 1        |------------------------------|&#xA;                |              |               |&#xA;            D   |    (5, 0)    |    (1, 1)     |&#xA;                |              |               |&#xA;                 ------------------------------&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In the iterated prisoner's dilemma, multiple rounds are played in succession,&#xA;and players can use their knowledge of the previous rounds when making a&#xA;decision.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The twist&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Bots are also allowed to run their opponent and examine the output before&#xA;making a move. This allows for significantly more complex strategies in which&#xA;bots can simulate their opponents to determine if it is safe to cooperate with&#xA;them, as well as attempt to exploit less sophisticated players.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Simulation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There will be a program available in the path called &lt;code&gt;simulate&lt;/code&gt; that you can use to simulate what your opponent would do against you&lt;br&gt;&lt;/p&gt;&#xA;&#xA;Usage:&#xA;&#xA;&lt;pre&gt;&lt;code&gt;simulate [instruction to your own bot] [fake history to the opponent]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;Example:&#xA;&#xA;&lt;pre&gt;&lt;code&gt;simulate cooperate 00 10 01 11 01 10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;All arguments are optional, and you may also use underscore &lt;code&gt;_&lt;/code&gt; for no argument. If you do not explicitly state the history, the real history will be used.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example output from the &lt;code&gt;simulate&lt;/code&gt; program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;01&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The first number is you, the second is your opponent. &lt;code&gt;0&lt;/code&gt; means defect, &lt;code&gt;1&lt;/code&gt; means cooperate.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The instruction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It wouldn't be much use to simulate what your opponent would do against you, because he'd probably simulate you right back, and then you'd be stuck in an infinite loop.&lt;br&gt;&#xA;The instruction is your way to simulate what the opponent would do against another agent. You could for instance have a cooperate instruction that causes your bot to cooperate mindlessly, to see what the opponent would do if you were to cooperate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program will be given the following input at the beginning of each round:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Instruction (if any)&#xA;Your score&#xA;Your opponents score&#xA;Current round number&#xA;Complete history of past interactions with this bot. Space separated: the first number is you, the second is your opponent&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;cooperative&#xA;5&#xA;2&#xA;3&#xA;00 10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;0&lt;/code&gt; for defect or &lt;code&gt;1&lt;/code&gt; for cooperate, with any number of leading characters. Trailing characters (including 0 or 1's) will be ignored.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The tournament&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The tournament will be round-robin elimination: Each bot will play one match against all other bots, where a match consists of 100 rounds of the prisoner's dilemma. At the end of the round-robin round, the lower-scoring half of the tournament pool will be eliminated. This process will be repeated until only one bot remains, or there is a tie.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program has to run on Linux. Please provide a brief description of how to run your program if possible&lt;/li&gt;&#xA;&lt;li&gt;Your program has to give an answer within 5 seconds. Failing to do so will be interpreted as defect.&lt;/li&gt;&#xA;&lt;li&gt;Your program may not perform multiple simulations at the same time&lt;/li&gt;&#xA;&lt;li&gt;You may only enter a single bot, this is to prevent people from entering multiple bots that cooperate&lt;/li&gt;&#xA;&lt;li&gt;You may not read or write any files. If this is required by your language, please state so in your answer.&lt;/li&gt;&#xA;&lt;li&gt;You may not in any way store state between rounds. This is to prevent bots from figuring out whether they are being simulated.&lt;/li&gt;&#xA;&lt;li&gt;If you exploit another loophole to figure out whether you are being simulated, you will be disqualified. Guessing (or strategical testing) is obviously allowed&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;About the host computer&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Arch Linux 4.10.13-1&#xA;Intel(R) Core(TM) i7-7500U CPU @ 2.70GHz, 4 cores&#xA;16 GB RAM&#xA;I will disconnect from the internet while running the tournament&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Disclosure&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I got the idea as well as some of the text from &lt;a href=&quot;https://github.com/pdtournament/pdtournament/blob/master/README.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; Github repository.&#xA;I have not directly asked the author for permission to use the challenge, but he said that &quot;if you want to run this tournament on your own, you are more than welcome to&quot; in a &lt;a href=&quot;http://lesswrong.com/r/lesswrong/lw/l16/2014_iterated_prisoners_dilemma_tournament_results/&quot; rel=&quot;nofollow noreferrer&quot;&gt;blogpost&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Leaderboard&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I will update this periodically whenever new bots enter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;How do I best discourage/prevent players from intentionally using every bit of their time limit to sabotage other players trying to simulate them?&#xA;I am thinking random time limits and/or penalties&lt;/p&gt;&#xA;" OwnerUserId="43037" LastEditorUserId="43037" LastEditDate="2017-05-22T23:03:27.277" LastActivityDate="2017-05-22T23:03:27.277" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12532" PostTypeId="1" CreationDate="2017-05-22T18:33:52.897" Score="1" ViewCount="57" Body="&lt;p&gt;In general, user-mode processes have a much richer API environment available (through stdlib, and other libraries you can possibly import), than does (Linux) kernel-mode code.  However there are some situations I can think of where it would conceivably be shorter to give a kernel-mode &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c&amp;#39;&quot; rel=&quot;tag&quot;&gt;c&lt;/a&gt; answer than a user-space process or function.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Can an entire kernel module (including all the &lt;code&gt;module_init()&lt;/code&gt;, etc boiler plate) be submitted as an answer?  If so, I assume the golf score would be for the code for the entire module.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Can a function that gets called from kernel mode be submitted?  In this case the golf score would just be for the function on its own.  If a function is submitted, then it should be accompanied by the associated module boilerplate needed to run it, as well build instructions.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I/O is not as straightforward as for userspace processes.  Some possibilities are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;module args for input&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;printk()&lt;/code&gt; into the &quot;dmesg&quot; buffer for output&lt;/li&gt;&#xA;&lt;li&gt;procfs for input and output&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="11259" LastActivityDate="2017-05-22T18:33:52.897" Title="Are kernel-mode functions and kernel modules valid code-golf answers?" Tags="|discussion|code-golf|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12533" PostTypeId="2" ParentId="2140" CreationDate="2017-05-22T19:02:27.060" Score="0" Body="&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;Wardialing was a very interesting way to try to hack people back in the '80s and '90s. When everyone used dial-up, people would dial huge amounts of numbers to search for BBS's, computers, or fax machines. If it was answered by a human or answering machine, it hung up and forgot the number. If it was answered by a modem or a fax machine, it would make note of the number.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Your job is to make a URL wardialer. Something that tests and checks if it's a valid website from one letter of the alphabet.&lt;/p&gt;&#xA;&lt;h1&gt;Constraints&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Program must take user input. This input has to be a letter of the alphabet, no numbers. Just one letter of the alphabet and form multiple URLs that start with the letter.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply.&lt;/li&gt;&#xA;&lt;li&gt;You must make 8 URLs from 1 letter, and test to see if it is a valid site.&lt;/li&gt;&#xA;&lt;li&gt;If you hit an error (not a response code), instead of leaving it blank, go ahead and return a 404&lt;/li&gt;&#xA;&lt;li&gt;If you hit a redirect (3xx), return a 200 instead.&lt;/li&gt;&#xA;&lt;li&gt;You may output the results in any reasonable format, as long as it includes the website name, status codes for all the websites and the redirects&lt;/li&gt;&#xA;&lt;li&gt;This is Code Golf, so shortest amount of bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;What counts as a URL for this challenge?&lt;/h1&gt;&#xA;&lt;p&gt;http://{domain-name}.{com or net or org}&lt;/p&gt;&#xA;&lt;p&gt;For this challenge, the domain name is should only be 4 letters long, no more, no less.&lt;/p&gt;&#xA;&lt;h1&gt;What should I test?&lt;/h1&gt;&#xA;&lt;p&gt;For each 4 letter domain name, test it against three top-level domains (.com, .net, .org). Record all the response codes from each URL, remember from the constraints that any (3xx) should return 200 and be recorded as a redirect in the output and any error getting to the website should result in a 404.&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;a&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;+---------+------+------+------+------------+&#xA;| Website | .com | .net | .org | Redirects? |&#xA;+---------+------+------+------+------------+&#xA;| ajoe    | 200  | 200  | 200  | .com, .net |&#xA;+---------+------+------+------+------------+&#xA;| aqiz    | 200  | 404  | 404  | no         |&#xA;+---------+------+------+------+------------+&#xA;| amnx    | 200  | 503  | 404  | .com       |&#xA;+---------+------+------+------+------------+&#xA;| abcd    | 200  | 404  | 200  | .com       |&#xA;+---------+------+------+------+------------+&#xA;| ajmx    | 200  | 503  | 404  | no         |&#xA;+---------+------+------+------+------------+&#xA;| aole    | 200  | 200  | 200  | .com       |&#xA;+---------+------+------+------+------------+&#xA;| apop    | 404  | 200  | 200  | .net       |&#xA;+---------+------+------+------+------------+&#xA;| akkk    | 200  | 200  | 200  | .com       |&#xA;+---------+------+------+------+------------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="69352" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-22T22:17:01.520" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="12534" PostTypeId="2" ParentId="7683" CreationDate="2017-05-22T19:57:30.557" Score="1" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;But not in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions.&lt;/p&gt;&#xA;&lt;p&gt;Tips questions don't fit the classic PPCG question and are also quite easy to write, as compared to a challenge. Just look at the general structure.&lt;/p&gt;&#xA;&lt;p&gt;This is my general structure when I write questions here:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;em&gt;cheesy explanation&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;task description; 1 or 2 short sentences&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;detailed description of input rules etc&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;detailed description of output rules etc&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;unordered&lt;/li&gt;&#xA;&lt;li&gt;list&lt;/li&gt;&#xA;&lt;li&gt;of rules&lt;/li&gt;&#xA;&lt;li&gt;ending in winning criterion&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;list of examples&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;cheesy justification of shortest code&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;And this is the general structure I have seen for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Do anyone have any tips for golfing in &lt;em&gt;language&lt;/em&gt;? Please post one tip per answer.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;There is a vast difference, as you can see. So if we start offering 10 rep on all questions, we reward people for writing 30 words asking for help, we are going to end up with a mass influx of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions about obscure languages, just to get the rep.&lt;/p&gt;&#xA;&lt;h1&gt;TL;DR&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;+5 rep for a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question upvote&lt;/li&gt;&#xA;&lt;li&gt;+10 rep for every other question upvote&lt;/li&gt;&#xA;&lt;li&gt;-2 rep for a question downvote&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;What do you think?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-04T00:05:46.500" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12535" PostTypeId="2" ParentId="2140" CreationDate="2017-05-22T20:37:55.500" Score="1" Body="&lt;h1&gt;Cops &amp;amp; Robbers, the ultimate 1-up.&lt;/h1&gt;&#xA;&lt;p&gt;This is a cops and robbers game.&lt;/p&gt;&#xA;&lt;h2&gt;Cops&lt;/h2&gt;&#xA;&lt;p&gt;Hello, cops. you've just solved a Code Golf challenge on the stack exchange website. How wonderful. You go to post your answer, and soon after a robber comes and beats you by 1! How infuriating!&lt;/p&gt;&#xA;&lt;h2&gt;Your task:&lt;/h2&gt;&#xA;&lt;p&gt;Produce two programs.&lt;/p&gt;&#xA;&lt;p&gt;The first program can be in any language,  of any length, and cannot use default loopholes. it does one thing: &lt;strong&gt;Prints out a number.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The second program must use the same language as the first, must use less bytes than the first, and &lt;strong&gt;CAN&lt;/strong&gt; use forbidden loopholes. The second program must &lt;strong&gt;print out a number which is equal to 1+ the output of your first program&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;post your first program and wait 7 days. If someone cracks your program within those seven days by robbing you, please edit your answer to include [cracked] in the header. If your program is not cracked, you can edit [safe] in the header.&lt;/p&gt;&#xA;&lt;h2&gt;Robbers&lt;/h2&gt;&#xA;&lt;p&gt;Hello, robbers. You're sneaky and looking for ways to win a golf, even if it's underhanded. You see that a cop has posted a golf for a decent score, and decide to take the lead from them.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to take a cop's answer, and beat it. Your program must use less bytes than the cop's answer and print out a number equal to only 1+ the cop's answer. You're program must also be in the same language as the cop's answer. You may use underhanded tricks and loopholes to solve the challenge. Once you complete this, you may post your solution and let the cop know they've been beat.&lt;/p&gt;&#xA;&lt;h2&gt;Example I Os&lt;/h2&gt;&#xA;&lt;p&gt;cop: 16&lt;br /&gt;&#xA;robber: 17&lt;br /&gt;&#xA;Correct: Yes!&lt;/p&gt;&#xA;&lt;p&gt;cop: 16&lt;br /&gt;&#xA;robber: 16+1&lt;br /&gt;&#xA;Correct: Yes!&lt;/p&gt;&#xA;&lt;p&gt;cop: 16&lt;br /&gt;&#xA;robber: 16.1&lt;br /&gt;&#xA;correct: NO! (alternative symbols for '+' are not allowed)&lt;/p&gt;&#xA;&lt;p&gt;cop: 16&lt;br /&gt;&#xA;robber: 18-1&lt;br /&gt;&#xA;correct: Yes! (evals to 17)&lt;/p&gt;&#xA;&lt;p&gt;cop: 16&lt;br /&gt;&#xA;robber: [234,32,54,17,45,23]&lt;br /&gt;&#xA;correct: NO! (output must be exact).&lt;/p&gt;&#xA;&lt;p&gt;cop: 16&lt;br /&gt;&#xA;robber: &amp;quot;1+ the cop's answer&amp;quot; [OR] &amp;quot;a number equal to only 1+ the cop's answer&amp;quot;&lt;br /&gt;&#xA;correct: NO! (smartassery is not a loophole)&lt;/p&gt;&#xA;&lt;p&gt;cop: 16.001&lt;br /&gt;&#xA;robber: 17&lt;br /&gt;&#xA;correct: NO! (16.001+1 &amp;lt;&amp;gt; 17)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;EXCLUSIONS&lt;/strong&gt;: you may use any underhanded trick / loophole you want, BUT your output must match the description exactly. no new line. no trailing space.&lt;/p&gt;&#xA;&lt;p&gt;The following loopholes are &lt;em&gt;still&lt;/em&gt; forbidden:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1070/60951&quot;&gt;Interpreting the challenge too literally&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1071/60951&quot;&gt;Using a made-up language specifically designed for the challenge&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1146/60951&quot;&gt;Posting a code snippet instead of a complete answer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7212/60951&quot;&gt;Using a non-free language on a Cops and Robbers challenge&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="60951" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-19T15:37:33.670" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="12537" PostTypeId="1" AcceptedAnswerId="12538" CreationDate="2017-05-23T05:43:42.910" Score="35" ViewCount="1693" Body="&lt;p&gt;Newcomers to codegolf.SE are often compelled to ask what many of our abbreviations and terms mean. Let us list them here so this information always will be easily available.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1280&quot;&gt;Return to FAQ index&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="66833" LastEditDate="2021-03-23T20:17:21.340" LastActivityDate="2023-11-24T01:57:42.787" Title="What are our specific abbreviations and terms?" Tags="|discussion|support|faq|new-users|chat|" AnswerCount="1" CommentCount="5" CommunityOwnedDate="2021-03-24T03:51:47.820" ContentLicense="CC BY-SA 4.0" />
  <row Id="12538" PostTypeId="2" ParentId="12537" CreationDate="2017-05-23T05:43:42.910" Score="37" Body="&lt;h3&gt;See also &lt;a href=&quot;https://meta.stackexchange.com/questions/40353/stack-exchange-glossary-dictionary-of-commonly-used-terms&quot;&gt;Stack Exchange Glossary - Dictionary of Commonly-Used Terms&lt;/a&gt;.&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Abbreviations marked with a star (*) are chat specific.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;ATO&lt;/strong&gt;: &lt;a href=&quot;https://ato.pxeger.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Attempt This Online&lt;/a&gt;; a website similiar to TIO where newer versions of languages are hosted. Created by &lt;a href=&quot;https://codegolf.stackexchange.com/users/97857/pxeger&quot;&gt;pxeger&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;*&lt;strong&gt;The Bakery&lt;/strong&gt;: &lt;a href=&quot;https://chat.stackexchange.com/rooms/123853/the-nineteenth-bakery&quot;&gt;The Nineteenth Bakery&lt;/a&gt;, the room where spam and off-topic messages from &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; are moved, kept as a gallery room so that users whose messages are moved aren't notified (as compared to &lt;a href=&quot;https://chat.stackexchange.com/rooms/82806/trash&quot;&gt;Trash&lt;/a&gt;, where users get notified if their posts are moved to this room). Currently frozen.&lt;/p&gt;&#xA;&lt;p&gt;*&lt;strong&gt;Butter&lt;/strong&gt;: Spam messages, especially when moved to The Bakery. Originated from &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/26377157#26377157&quot;&gt;this message&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Catalog&lt;/strong&gt;: A type of simple &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5738/43319&quot;&gt;on-topic&lt;/a&gt; challenge where the challenge's aim not so much to find a winner as it is to create a catalog of solutions in many languages.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;CG&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;Code Golf&lt;/a&gt;; a challenge to solve a particular problem with the shortest code.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;CGCC&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;Code Golf &amp;amp; Coding Challenges&lt;/a&gt;; our official abbreviation for the main Stack Exchange site for coding competitions.&lt;/p&gt;&#xA;&lt;p&gt;*&lt;strong&gt;CMC&lt;/strong&gt;: Chat Mini Challenge; a less formal &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; challenge posted in chat. Answers are expected as replies to that message, and in the form &lt;code&gt;Language, XX bytes: [solution](link-to-code-running-service)&lt;/code&gt;. &lt;a href=&quot;http://chat.stackexchange.com/transcript/240?m=37546121#37546121&quot;&gt;Example&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;*&lt;strong&gt;CMC / CMegaC&lt;/strong&gt;: Chat Mega Challenge; usually a challenge posted jokingly in chat due to it being very involved or outright impossible. &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=40275879#40275879&quot;&gt;Example&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;*&lt;strong&gt;&amp;lt;initial&amp;gt;MC / &amp;lt;language&amp;gt;MC&lt;/strong&gt;: &amp;lt;language&amp;gt; Mini Challenge; Acronyms of this form are usually Chat Mini Challenges for specific languages, typically used during LYALs for that language.&lt;/p&gt;&#xA;&lt;p&gt;*&lt;strong&gt;CMM&lt;/strong&gt;: Chat Mini Meta (question); a less formal &lt;a href=&quot;https://codegolf.meta.stackexchange.com/&quot;&gt;Meta&lt;/a&gt; question posted in chat. &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=40679641#40679641&quot;&gt;Example&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;*&lt;strong&gt;CMP&lt;/strong&gt;: Chat Mini Poll; a request for opinions on a stated question, often about programming language design. &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/40329706#40329706&quot;&gt;Example&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;*&lt;strong&gt;CMQ&lt;/strong&gt;: Chat Mini Question; usually an alternative to a &lt;strong&gt;CMM&lt;/strong&gt;, but more general (not necessarily restricted to Meta-like questions)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;CnR&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/tags/cops-and-robbers/info&quot;&gt;Cops and Robbers&lt;/a&gt;; challenges where one person has to &amp;quot;crack&amp;quot; another person's code.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;CR&lt;/strong&gt;: &lt;a href=&quot;https://codereview.stackexchange.com/&quot;&gt;Code Review&lt;/a&gt;; jokingly our archenemy in the sense that they value efficient legible code while we value obscure inefficient code.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;CW&lt;/strong&gt;: &lt;a href=&quot;https://meta.stackexchange.com/q/11740&quot;&gt;Community Wiki&lt;/a&gt;, a type of post which especially invites collaboration editing by the community&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Eleven&lt;/strong&gt; / &lt;strong&gt;11&lt;/strong&gt;: To delete something using moderator powers, e.g. &amp;quot;Yeah, the post is gone, Dennis 11'd it&amp;quot;. &lt;em&gt;mod abuse -&amp;gt; mod abuse!!! -&amp;gt; mod abuse !!11!1!! -&amp;gt; mod abuse !!eleven!1!! -&amp;gt; mod abuse eleven -&amp;gt; eleven&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;FGITW&lt;/strong&gt;: &lt;a href=&quot;https://meta.stackexchange.com/questions/9731/fastest-gun-in-the-west-problem&quot;&gt;Fastest Gun in the West&lt;/a&gt;; a quick submission to a just-posted challenge, typically used in reference to the problem that fast answers get more visibility and upvotes than later but better ones.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Hammer&lt;/strong&gt;: To close a challenge single-handedly; users that have a gold tag badge in one of the posts's tags have the privilege to close it as a duplicate by themselves; moderators can also single-handedly close &lt;em&gt;any&lt;/em&gt; question.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Hello, World!&lt;/strong&gt;: A simple program outputting &amp;quot;Hello, World!&amp;quot;. May also refer to the &lt;a href=&quot;https://chat.stackexchange.com/users/-1162/hello-world&quot;&gt;chat feed of the same name&lt;/a&gt; that posts new answers to the &lt;a href=&quot;https://codegolf.stackexchange.com/q/55422&quot;&gt;Hello, World! challenge&lt;/a&gt; into TNB.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;HNQ&lt;/strong&gt;: &lt;a href=&quot;https://stackexchange.com/questions&quot;&gt;Hot Network Questions&lt;/a&gt;; a global page where popular Stack Exchange posts are often featured. Also the corresponding global sidebar.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;KC&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/tags/kolmogorov-complexity/info&quot;&gt;Kolmogorov Complexity&lt;/a&gt;; a challenge to compress a static output.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;KotH&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/tags/king-of-the-hill/info&quot;&gt;King Of The Hill&lt;/a&gt;; a game where the submissions interact with and compete against each other in some form of game.&lt;/p&gt;&#xA;&lt;p&gt;*&lt;strong&gt;LDQ&lt;/strong&gt;: Language Design Question; a question about some aspect of language design. Most commonly found during the Language Design Workshop but also appears during other times.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;LDW&lt;/strong&gt;: Language Design Workshop: a chat event every other Wednesday, where it is encouraged to discuss and develop your in-progress languages.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;LotM&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/tagged/language-of-the-month&quot;&gt;Language of the Month&lt;/a&gt;; a monthly event designed to promote lesser-known languages&lt;/p&gt;&#xA;&lt;p&gt;*&lt;strong&gt;LYAL&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/23738/66833&quot;&gt;Learn You A Lang For Great Good&lt;/a&gt;, a chat event every other Wednesday, where it is encouraged to discuss and use a specific language for that day - essentially a single day version of LotM&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;LQA&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/review/low-quality-posts/stats&quot;&gt;Low Quality Auto&lt;/a&gt;; these are reviews that show up in the review queue from being short or containing only code.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;LQP&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/review/low-quality-posts&quot;&gt;Low Quality Posts&lt;/a&gt;; posts that are generally of a very low quality, such as spam. Alternatively, used to refer to the linked review queue&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Mother Meta&lt;/strong&gt; / &lt;strong&gt;MSE&lt;/strong&gt;: &lt;a href=&quot;https://meta.stackexchange.com/&quot;&gt;Meta.SE&lt;/a&gt;, the meta site for the entire network, where posts relevant to and about multiple sites are most on-topic.&lt;/p&gt;&#xA;&lt;p&gt;*&lt;strong&gt;NP&lt;/strong&gt;: &lt;a href=&quot;https://chat.stackexchange.com/users/509028/new-posts&quot;&gt;New Posts&lt;/a&gt;; a chat bot operated by [Rydwolf Programs] which posts in TNB whenever a new challenge is submitted on the site, or a new question is posted on Meta.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nuke&lt;/strong&gt;: Moderators have the power to permanently delete a post, this is called nuking. Also used in reference to &amp;quot;spam nuking&amp;quot;, where users flag a post as spam to remove it.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;OEIS&lt;/strong&gt;: &lt;a href=&quot;http://oeis.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;The On-Line Encyclopedia of Integer Sequences&lt;/a&gt;; as the name says a website that collects all kinds of integer sequences and assigns them a name, e.g. the squares are &lt;a href=&quot;http://oeis.org/A000290&quot; rel=&quot;nofollow noreferrer&quot;&gt;A000290&lt;/a&gt;. Frequently cited in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-sequence-tooltip-container&quot;&gt;sequence&lt;/a&gt; challenges.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;OP&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/43319/ad%c3%a1m&quot;&gt;Original poster&lt;/a&gt;; the author of the challenge. Also used for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12537/43319&quot;&gt;Original Post&lt;/a&gt;; when talking about the challenge text itself.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;OWC&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8130/43319&quot;&gt;Objective Winning Criteria&lt;/a&gt;; a requirement for all challenges on the site.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;PopCon&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/tags/popularity-contest/info&quot;&gt;Popularity Contest&lt;/a&gt;; a competition where the answer with the highest vote tally (upvotes minus downvotes) wins. Note that popcons are generally discouraged, and ones that are &amp;quot;do X creatively&amp;quot; are simply not allowed.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;PPCG&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;Programming Puzzles &amp;amp; Code Golf&lt;/a&gt;; the old name for this site.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Proper quine&lt;/strong&gt;: A program that not only prints itself (see &lt;em&gt;quine&lt;/em&gt;) but also obeys the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4877/what-counts-as-a-proper-quine&quot;&gt;proper quine rules&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Quine&lt;/strong&gt;: A program that prints its own source code. See also &lt;em&gt;proper quine&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;*&lt;strong&gt;RO&lt;/strong&gt;: A &lt;a href=&quot;https://chat.stackexchange.com/faq&quot;&gt;Room-owner&lt;/a&gt; of a chat room is a user with special privileges in that room.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;SEDE&lt;/strong&gt;: &lt;a href=&quot;https://data.stackexchange.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Stack Exchange Data Explorer&lt;/a&gt;, a T-SQL based website to get information about posts and other things.&lt;/p&gt;&#xA;&lt;p&gt;*&lt;strong&gt;SP&lt;/strong&gt;: &lt;a href=&quot;https://chat.stackexchange.com/users/510186/sandbox-posts&quot;&gt;Sandbox Posts&lt;/a&gt;; a chat bot operated by [Rydwolf Programs] which posts in TNB whenever a new challenge is proposed in the Sandbox.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Spec&lt;/strong&gt;: Short for the specification of a challenge.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;TIO&lt;/strong&gt;: &lt;a href=&quot;https://tio.run/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try It Online&lt;/a&gt;; a code testing website for many programming languages, both practical and recreational ones, made by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012&quot;&gt;Dennis&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;*&lt;strong&gt;TNB&lt;/strong&gt;: &lt;a href=&quot;http://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;; our principal chatroom.&lt;/p&gt;&#xA;&lt;p&gt;*&lt;strong&gt;TNBDE&lt;/strong&gt;: &lt;a href=&quot;http://ppcg.starmaninnovations.com/tnbde/&quot; rel=&quot;nofollow noreferrer&quot;&gt;TNB Data Explorer&lt;/a&gt;. Currently down, however you can still use the &lt;a href=&quot;https://chat.stackexchange.com/search?q=&amp;amp;room=240&quot;&gt;Chat Search&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;*&lt;strong&gt;Twelve&lt;/strong&gt; / *&lt;strong&gt;12&lt;/strong&gt;: Similar to Eleven/11, but for &lt;a href=&quot;https://chat.stackexchange.com/rooms/info/240/?tab=access#access-section-owner&quot;&gt;room owner&lt;/a&gt; &amp;quot;abuse&amp;quot; in TNB instead of moderator &amp;quot;abuse&amp;quot;. Often used to ask the ROs to move messages to &lt;a href=&quot;https://chat.stackexchange.com/rooms/123853/the-nineteenth-bakery&quot;&gt;the Bakery&lt;/a&gt; e.g. &amp;quot;@RO's can you 12 that please&amp;quot; in reference to a spam post.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;VLQ&lt;/strong&gt;: &lt;a href=&quot;https://meta.stackexchange.com/questions/93595/is-the-very-low-quality-flag-too-ambiguous&quot;&gt;Very Low Quality&lt;/a&gt;; a type of flag that can be automatically cast on very short posts. These flags used to also &lt;a href=&quot;https://meta.stackexchange.com/q/276269/286591&quot;&gt;cast automatic downvotes&lt;/a&gt;, but this &lt;a href=&quot;https://meta.stackexchange.com/questions/330180/allow-us-to-decline-the-automatically-raised-flags/330415#330415&quot;&gt;no longer occurs&lt;/a&gt;. These also show up in the review queue.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;VTC&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/close-questions&quot;&gt;Vote To Close&lt;/a&gt;; usually called a CV (Close Vote) on the rest of Stack Exchange.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;VTR&lt;/strong&gt; or &lt;strong&gt;VTRO&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/close-questions&quot;&gt;Vote To Reopen&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;VTD&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/moderator-tools&quot;&gt;Vote To Delete&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Please add to this list!&lt;/h1&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="108218" LastEditDate="2023-11-24T01:57:42.787" LastActivityDate="2023-11-24T01:57:42.787" CommentCount="17" CommunityOwnedDate="2017-05-23T05:43:42.910" ContentLicense="CC BY-SA 4.0" />
  <row Id="12539" PostTypeId="2" ParentId="12507" CreationDate="2017-05-23T07:43:19.150" Score="-10" Body="&lt;h2&gt;Or just delete the old ones.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;So our current approach seems to be: every question can only be asked once. And each unique answer can only be given once (usually just a couple of answers per language).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It seems to me a bit like a crossword book at a library: after a while, all the crosswords have been done, and it isn't much fun for newcomers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Wouldn't it be better to delete the old questions, so that newcomers can discover them and have the fun that the old-timers had? It's much more appealing to answer a new question with 3 answers than an old question with 200 answers.&lt;/p&gt;&#xA;" OwnerUserId="30512" LastActivityDate="2017-05-23T07:43:19.150" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12540" PostTypeId="2" ParentId="12507" CreationDate="2017-05-23T08:04:26.187" Score="17" Body="&lt;h2&gt;Run a monthly contest&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We have an annual contest which attracts quite a bit of attention to the winners inherently, and a bit more because it uses bounties for prizes. It's too process-heavy to run more frequently, but a process-light contest would be possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The rules I envisage are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each contest runs during one calendar month, UTC.&lt;/li&gt;&#xA;&lt;li&gt;An answer is eligible if it was posted during that calendar month on a question which was at least three calendar months old at time of posting.&lt;/li&gt;&#xA;&lt;li&gt;Answers can be self-nominated, or nominated by others.&lt;/li&gt;&#xA;&lt;li&gt;The judge may at his discretion review the &lt;a href=&quot;https://codegolf.stackexchange.com/tools/new-answers-old-questions&quot;&gt;New answers to old questions&lt;/a&gt; list to supplement the nominations.&lt;/li&gt;&#xA;&lt;li&gt;The judge's decision is final, and may reflect his biases.&lt;/li&gt;&#xA;&lt;li&gt;Notwithstanding the judge's personal biases, attempts to corrupt the process via bribery or blackmail will be strongly frowned upon.&lt;/li&gt;&#xA;&lt;li&gt;Prizes will be awarded as bounties. The envisaged prize structure is one prize per month, awarded by the judge; other members are welcome to form their own judgements of the nominated answers and award their own prizes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In order not to clutter meta, I propose running it in a chatroom.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-05-23T08:04:26.187" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12544" PostTypeId="1" AcceptedAnswerId="12547" CreationDate="2017-05-23T11:55:35.530" Score="5" ViewCount="263" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/121149/reversing-of-words&quot;&gt;This question&lt;/a&gt; was deleted by Community.&lt;br&gt;&#xA;But I can't see why. &lt;a href=&quot;https://meta.stackexchange.com/help/roomba&quot;&gt;Shouldn't it only delete the old/closed questions?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="47120" LastActivityDate="2017-05-24T06:32:42.790" Title="Question deleted by Community" Tags="|discussion|closed-questions|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12546" PostTypeId="1" CreationDate="2017-05-23T12:41:14.573" Score="2" ViewCount="129" Body="&lt;p&gt;The SE Chat Bot seems to be unwell. This includes Sandbox Feeds and Meta Feeds.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Hh1Qk.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Hh1Qk.png&quot; alt=&quot;Sandbox Feeds&quot;&gt;&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/u1sKi.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/u1sKi.png&quot; alt=&quot;Meta Feeds&quot;&gt;&lt;/a&gt;  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Neither of these posts were deleted at the time of posting. Does anyone know what's causing this behaviour?&lt;/p&gt;&#xA;" OwnerDisplayName="user42649" LastEditorUserId="66833" LastEditDate="2021-05-22T21:38:44.720" LastActivityDate="2021-05-22T21:38:44.720" Title="The SE chat feed bot seems to be unwell" Tags="|bug|status-completed|chat|rss|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12547" PostTypeId="2" ParentId="12544" CreationDate="2017-05-23T12:42:34.927" Score="9" Body="&lt;p&gt;The user who posted that challenge was destroyed as a sockpuppet account, which as a side effect deleted all of its content.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Needless to say, this is rather unfair to the users who posted the 40+ legitimate solutions. I've undeleted the challenge.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2017-05-23T12:42:34.927" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12548" PostTypeId="2" ParentId="12546" CreationDate="2017-05-23T12:48:22.203" Score="2" Body="&lt;p&gt;I would hazard a guess that it is related to the recent name change of the meta domain (from &lt;code&gt;meta.codegolf.stackexchange.com&lt;/code&gt; to &lt;code&gt;codegolf.meta.stackexchange.com&lt;/code&gt;, done as part of the &lt;a href=&quot;https://nickcraver.com/blog/2017/05/22/https-on-stack-overflow/&quot; rel=&quot;nofollow noreferrer&quot;&gt;project to make Stack Exchange HTTPS-only&lt;/a&gt;. Note that links to the old domain still work via redirects, but perhaps this confuses the feed-bots somehow.&lt;/p&gt;&#xA;" OwnerUserId="30688" LastActivityDate="2017-05-23T12:48:22.203" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12549" PostTypeId="2" ParentId="2140" CreationDate="2017-05-23T13:21:34.430" Score="-10" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Delete or a file disapear as fast as possible!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Requirements to participate: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;have a HDD hard drive, witch you will use to compete&lt;/li&gt;&#xA;&lt;li&gt;Use Windows (version 7 or more recent) for this challenge.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Assume that you already know the file path. no input needed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can use any language you want for this challenge, but you will need to explain the logic in your code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will delete a 2GB file.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;How do you win?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You win this challenge by creating a piece of code that can delete a file in the OS as fast as possible, the winner is the one with less time to delete a file.&lt;/p&gt;&#xA;" OwnerUserId="69673" LastEditorDisplayName="user58826" LastEditDate="2017-05-23T13:54:41.697" LastActivityDate="2017-05-23T13:54:41.697" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12550" PostTypeId="2" ParentId="12546" CreationDate="2017-05-23T18:04:05.937" Score="0" Body="&lt;p&gt;After @MartinEnder changed the URLs, the oneboxing seems to be working again as observed on TNB. Thanks!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/status-resolved&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;status-resolved&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-resolved&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user42649" LastActivityDate="2017-05-23T18:04:05.937" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12554" PostTypeId="2" ParentId="2140" CreationDate="2017-05-23T20:11:06.153" Score="3" Body="&lt;h1&gt;Exiting Vim — Cops &amp;amp; Robbers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In honour of the &lt;a href=&quot;https://stackoverflow.blog/2017/05/23/stack-overflow-helping-one-million-developers-exit-vim/&quot;&gt;recent milestone&lt;/a&gt;, let's turn escaping Vim into a game!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules for Cops&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Starting from launching &lt;code&gt;vim&lt;/code&gt; with no arguments (i.e. no initial file open), provide a sequence of keys to be typed in to the editor.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules for Robbers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Starting from the state described by the cop, provide a sequence of keys to exit Vim.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Cops are scored by the difference between key counts &lt;code&gt;&amp;lt;robber_key_count&amp;gt; - &amp;lt;cop_key_count&amp;gt;&lt;/code&gt;, and robbers are scored by the ratio of key counts &lt;code&gt;&amp;lt;cop_key_count&amp;gt; / &amp;lt;robber_key_count&amp;gt;&lt;/code&gt;. Higher scores are better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Keys are counted as one per key-down event (e.g. a sequence of Ctrl+X, Ctrl+Y, Ctrl+Z only need count the Ctrl once, unless it must be released during the sequence). Note that this is &lt;em&gt;not&lt;/em&gt; the same as the golf-rules scoring for Vim.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Plugins are not permitted.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example 1&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Cop (1 key): &lt;kbd&gt;i&lt;/kbd&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Robber (4 keys): &lt;kbd&gt;Esc&lt;/kbd&gt; &lt;kbd&gt;:&lt;/kbd&gt; &lt;kbd&gt;q&lt;/kbd&gt; &lt;kbd&gt;Enter&lt;/kbd&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Score for cop = 4 - 1 = 3, score for robber = 1 / 4 = 0.25&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example 2&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Cop (2 keys): &lt;kbd&gt;i&lt;/kbd&gt; &lt;kbd&gt;i&lt;/kbd&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Robber (5 keys): &lt;kbd&gt;Esc&lt;/kbd&gt; &lt;kbd&gt;:&lt;/kbd&gt; &lt;kbd&gt;q&lt;/kbd&gt; &lt;kbd&gt;!&lt;/kbd&gt; &lt;kbd&gt;Enter&lt;/kbd&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Score for cop = 5 - 2 = 3, score for robber = 2 / 5 = 0.4&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example 3&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Cop (3 keys): &lt;kbd&gt;i&lt;/kbd&gt; &lt;kbd&gt;Ctrl+V&lt;/kbd&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Robber (6 keys): &lt;kbd&gt;Return&lt;/kbd&gt; &lt;kbd&gt;Esc&lt;/kbd&gt; &lt;kbd&gt;:&lt;/kbd&gt; &lt;kbd&gt;q&lt;/kbd&gt; &lt;kbd&gt;!&lt;/kbd&gt; &lt;kbd&gt;Enter&lt;/kbd&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Score for cop = 6 - 3 = 3, score for robber = 3 / 6 = 0.5&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/vim&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;vim&amp;#39;&quot; rel=&quot;tag&quot;&gt;vim&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="8927" LastActivityDate="2017-05-23T20:11:06.153" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12556" PostTypeId="2" ParentId="2140" CreationDate="2017-05-23T21:23:58.720" Score="0" Body="&lt;h1&gt;Fill to the line!&lt;/h1&gt;&#xA;&lt;p&gt;Given input consisting of the characters &lt;code&gt;_&lt;/code&gt;, &lt;code&gt; &lt;/code&gt;, and newline, fill the empty space up to the line!&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I will use &lt;code&gt;#&lt;/code&gt; as the filler character in the example.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1. Input&#xA;        &#xA;        &#xA;________&#xA;        &#xA;        &#xA;        &#xA;2. Fill up to the line, but not above.&#xA;        &#xA;        &#xA;________&#xA;########&#xA;########&#xA;########&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may assume that the input either is rectangular (is padded), or consists only of the line and newlines.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that there is only one straight, unbroken line.&lt;/li&gt;&#xA;&lt;li&gt;The whitespace above the line is part of the input. Do not fill above the line.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test cases:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;&#xA;Input&#xA;&amp;quot;&#xA;&amp;quot;&#xA;Output&#xA;&amp;quot;&#xA;**********&#xA;&#xA;&amp;quot;&#xA;    &#xA;    &#xA;    &#xA;----&#xA;    &#xA;    &#xA;    &#xA;    &#xA;&amp;quot;&#xA;&amp;quot;&#xA;    &#xA;    &#xA;    &#xA;----&#xA;####&#xA;####&#xA;####&#xA;####&#xA;&amp;quot;&#xA;&#xA;**********&#xA;&#xA;&amp;quot;&#xA;        &#xA;        &#xA;________&#xA;        &#xA;        &#xA;        &#xA;&amp;quot;&#xA;&amp;quot;&#xA;        &#xA;        &#xA;________&#xA;########&#xA;########&#xA;########&#xA;&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="64159" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-29T23:55:53.920" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12559" PostTypeId="2" ParentId="2140" CreationDate="2017-05-24T03:39:21.420" Score="1" Body="&lt;h1&gt;Add a language to a quine&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Add a language to a quine program. Your program must output itself in all languages used so far.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Second to last answer wins after no answers have been posted for two weeks.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="53551" LastActivityDate="2017-05-24T03:39:21.420" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12560" PostTypeId="2" ParentId="2140" CreationDate="2017-05-24T04:31:02.647" Score="-1" Body="&lt;h1&gt;Proper Kerning&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Kerning&quot; rel=&quot;nofollow noreferrer&quot;&gt;Kerning&lt;/a&gt; is the adjustment of spacing between pairs of letters in order to obtain an aesthetic result. When kerning is applied automatically by a program (typically whatever editor you're using), it is said to be automatic. There are two types of automatic kerning. The one used in this challenge is &lt;strong&gt;metric&lt;/strong&gt; kerning. With metric kerning, the amount of space between pairs of letters is dictated by the kerning tables found in the font file.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a TrueType font file, output the kerning values for each mapping in the kerning table for ASCII characters 48 - 122 inclusive.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;calibri.ttf&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;l=&quot;A&quot; r=&quot;C&quot; v=&quot;-15&quot;&#xA;l=&quot;A&quot; r=&quot;G&quot; v=&quot;-15&quot;&#xA;l=&quot;A&quot; r=&quot;J&quot; v=&quot;23&quot;&#xA;l=&quot;A&quot; r=&quot;O&quot; v=&quot;-23&quot;&#xA;l=&quot;A&quot; r=&quot;Q&quot; v=&quot;-23&quot;&#xA;l=&quot;A&quot; r=&quot;T&quot; v=&quot;-160&quot;&#xA;l=&quot;A&quot; r=&quot;U&quot; v=&quot;-32&quot;&#xA;l=&quot;A&quot; r=&quot;V&quot; v=&quot;-89&quot;&#xA;l=&quot;A&quot; r=&quot;W&quot; v=&quot;-80&quot;&#xA;l=&quot;A&quot; r=&quot;Y&quot; v=&quot;-150&quot;&#xA;l=&quot;A&quot; r=&quot;t&quot; v=&quot;-52&quot;&#xA;l=&quot;A&quot; r=&quot;v&quot; v=&quot;-38&quot;&#xA;l=&quot;A&quot; r=&quot;y&quot; v=&quot;-41&quot;&#xA;l=&quot;A&quot; r=&quot;?&quot; v=&quot;-68&quot;&#xA;l=&quot;B&quot; r=&quot;A&quot; v=&quot;-20&quot;&#xA;l=&quot;B&quot; r=&quot;T&quot; v=&quot;-48&quot;&#xA;l=&quot;B&quot; r=&quot;V&quot; v=&quot;-25&quot;&#xA;l=&quot;B&quot; r=&quot;W&quot; v=&quot;-24&quot;&#xA;l=&quot;B&quot; r=&quot;X&quot; v=&quot;-44&quot;&#xA;l=&quot;B&quot; r=&quot;Y&quot; v=&quot;-57&quot;&#xA;l=&quot;B&quot; r=&quot;Z&quot; v=&quot;-20&quot;&#xA;l=&quot;B&quot; r=&quot;f&quot; v=&quot;-20&quot;&#xA;l=&quot;B&quot; r=&quot;t&quot; v=&quot;-20&quot;&#xA;l=&quot;B&quot; r=&quot;v&quot; v=&quot;-20&quot;&#xA;l=&quot;B&quot; r=&quot;x&quot; v=&quot;-15&quot;&#xA;l=&quot;B&quot; r=&quot;y&quot; v=&quot;-20&quot;&#xA;l=&quot;C&quot; r=&quot;G&quot; v=&quot;-18&quot;&#xA;l=&quot;C&quot; r=&quot;J&quot; v=&quot;12&quot;&#xA;l=&quot;C&quot; r=&quot;O&quot; v=&quot;-18&quot;&#xA;l=&quot;C&quot; r=&quot;Q&quot; v=&quot;-18&quot;&#xA;l=&quot;C&quot; r=&quot;T&quot; v=&quot;10&quot;&#xA;l=&quot;D&quot; r=&quot;A&quot; v=&quot;-30&quot;&#xA;l=&quot;D&quot; r=&quot;J&quot; v=&quot;-22&quot;&#xA;l=&quot;D&quot; r=&quot;T&quot; v=&quot;-23&quot;&#xA;l=&quot;D&quot; r=&quot;V&quot; v=&quot;-24&quot;&#xA;l=&quot;D&quot; r=&quot;W&quot; v=&quot;-14&quot;&#xA;l=&quot;D&quot; r=&quot;X&quot; v=&quot;-31&quot;&#xA;l=&quot;D&quot; r=&quot;Y&quot; v=&quot;-39&quot;&#xA;l=&quot;D&quot; r=&quot;Z&quot; v=&quot;-22&quot;&#xA;l=&quot;E&quot; r=&quot;A&quot; v=&quot;-22&quot;&#xA;l=&quot;E&quot; r=&quot;C&quot; v=&quot;-24&quot;&#xA;l=&quot;E&quot; r=&quot;G&quot; v=&quot;-24&quot;&#xA;l=&quot;E&quot; r=&quot;O&quot; v=&quot;-32&quot;&#xA;l=&quot;E&quot; r=&quot;Q&quot; v=&quot;-32&quot;&#xA;l=&quot;E&quot; r=&quot;S&quot; v=&quot;-20&quot;&#xA;l=&quot;E&quot; r=&quot;Z&quot; v=&quot;-10&quot;&#xA;l=&quot;E&quot; r=&quot;a&quot; v=&quot;-34&quot;&#xA;l=&quot;E&quot; r=&quot;c&quot; v=&quot;-28&quot;&#xA;l=&quot;E&quot; r=&quot;d&quot; v=&quot;-30&quot;&#xA;l=&quot;E&quot; r=&quot;e&quot; v=&quot;-37&quot;&#xA;l=&quot;E&quot; r=&quot;f&quot; v=&quot;-64&quot;&#xA;l=&quot;E&quot; r=&quot;o&quot; v=&quot;-37&quot;&#xA;l=&quot;E&quot; r=&quot;q&quot; v=&quot;-30&quot;&#xA;l=&quot;E&quot; r=&quot;t&quot; v=&quot;-24&quot;&#xA;l=&quot;E&quot; r=&quot;v&quot; v=&quot;-48&quot;&#xA;l=&quot;E&quot; r=&quot;w&quot; v=&quot;-34&quot;&#xA;l=&quot;E&quot; r=&quot;y&quot; v=&quot;-48&quot;&#xA;l=&quot;F&quot; r=&quot;A&quot; v=&quot;-115&quot;&#xA;l=&quot;F&quot; r=&quot;C&quot; v=&quot;-18&quot;&#xA;l=&quot;F&quot; r=&quot;G&quot; v=&quot;-18&quot;&#xA;l=&quot;F&quot; r=&quot;J&quot; v=&quot;-109&quot;&#xA;l=&quot;F&quot; r=&quot;O&quot; v=&quot;-18&quot;&#xA;l=&quot;F&quot; r=&quot;Q&quot; v=&quot;-18&quot;&#xA;l=&quot;F&quot; r=&quot;S&quot; v=&quot;-29&quot;&#xA;l=&quot;F&quot; r=&quot;X&quot; v=&quot;-22&quot;&#xA;l=&quot;F&quot; r=&quot;Z&quot; v=&quot;-11&quot;&#xA;l=&quot;F&quot; r=&quot;a&quot; v=&quot;-55&quot;&#xA;l=&quot;F&quot; r=&quot;c&quot; v=&quot;-28&quot;&#xA;l=&quot;F&quot; r=&quot;d&quot; v=&quot;-20&quot;&#xA;l=&quot;F&quot; r=&quot;e&quot; v=&quot;-30&quot;&#xA;l=&quot;F&quot; r=&quot;o&quot; v=&quot;-28&quot;&#xA;l=&quot;F&quot; r=&quot;q&quot; v=&quot;-20&quot;&#xA;l=&quot;F&quot; r=&quot;s&quot; v=&quot;-35&quot;&#xA;l=&quot;G&quot; r=&quot;T&quot; v=&quot;-10&quot;&#xA;l=&quot;G&quot; r=&quot;V&quot; v=&quot;-10&quot;&#xA;l=&quot;G&quot; r=&quot;W&quot; v=&quot;-9&quot;&#xA;l=&quot;G&quot; r=&quot;Y&quot; v=&quot;-30&quot;&#xA;l=&quot;G&quot; r=&quot;v&quot; v=&quot;-29&quot;&#xA;l=&quot;G&quot; r=&quot;w&quot; v=&quot;-22&quot;&#xA;l=&quot;G&quot; r=&quot;x&quot; v=&quot;-14&quot;&#xA;l=&quot;G&quot; r=&quot;y&quot; v=&quot;-30&quot;&#xA;l=&quot;J&quot; r=&quot;A&quot; v=&quot;-35&quot;&#xA;l=&quot;J&quot; r=&quot;X&quot; v=&quot;-20&quot;&#xA;l=&quot;K&quot; r=&quot;C&quot; v=&quot;-78&quot;&#xA;l=&quot;K&quot; r=&quot;G&quot; v=&quot;-80&quot;&#xA;l=&quot;K&quot; r=&quot;O&quot; v=&quot;-97&quot;&#xA;l=&quot;K&quot; r=&quot;Q&quot; v=&quot;-97&quot;&#xA;l=&quot;K&quot; r=&quot;S&quot; v=&quot;-18&quot;&#xA;l=&quot;K&quot; r=&quot;U&quot; v=&quot;-29&quot;&#xA;l=&quot;K&quot; r=&quot;W&quot; v=&quot;-34&quot;&#xA;l=&quot;K&quot; r=&quot;a&quot; v=&quot;-34&quot;&#xA;l=&quot;K&quot; r=&quot;c&quot; v=&quot;-40&quot;&#xA;l=&quot;K&quot; r=&quot;d&quot; v=&quot;-33&quot;&#xA;l=&quot;K&quot; r=&quot;e&quot; v=&quot;-37&quot;&#xA;l=&quot;K&quot; r=&quot;f&quot; v=&quot;-25&quot;&#xA;l=&quot;K&quot; r=&quot;m&quot; v=&quot;-32&quot;&#xA;l=&quot;K&quot; r=&quot;n&quot; v=&quot;-32&quot;&#xA;l=&quot;K&quot; r=&quot;o&quot; v=&quot;-37&quot;&#xA;l=&quot;K&quot; r=&quot;p&quot; v=&quot;-32&quot;&#xA;l=&quot;K&quot; r=&quot;q&quot; v=&quot;-33&quot;&#xA;l=&quot;K&quot; r=&quot;r&quot; v=&quot;-32&quot;&#xA;l=&quot;K&quot; r=&quot;s&quot; v=&quot;-18&quot;&#xA;l=&quot;K&quot; r=&quot;t&quot; v=&quot;-38&quot;&#xA;l=&quot;K&quot; r=&quot;u&quot; v=&quot;-32&quot;&#xA;l=&quot;K&quot; r=&quot;v&quot; v=&quot;-101&quot;&#xA;l=&quot;K&quot; r=&quot;w&quot; v=&quot;-95&quot;&#xA;l=&quot;K&quot; r=&quot;y&quot; v=&quot;-85&quot;&#xA;l=&quot;L&quot; r=&quot;C&quot; v=&quot;-22&quot;&#xA;l=&quot;L&quot; r=&quot;G&quot; v=&quot;-47&quot;&#xA;l=&quot;L&quot; r=&quot;J&quot; v=&quot;25&quot;&#xA;l=&quot;L&quot; r=&quot;O&quot; v=&quot;-45&quot;&#xA;l=&quot;L&quot; r=&quot;Q&quot; v=&quot;-45&quot;&#xA;l=&quot;L&quot; r=&quot;T&quot; v=&quot;-150&quot;&#xA;l=&quot;L&quot; r=&quot;U&quot; v=&quot;-44&quot;&#xA;l=&quot;L&quot; r=&quot;V&quot; v=&quot;-147&quot;&#xA;l=&quot;L&quot; r=&quot;W&quot; v=&quot;-118&quot;&#xA;l=&quot;L&quot; r=&quot;Y&quot; v=&quot;-167&quot;&#xA;l=&quot;L&quot; r=&quot;f&quot; v=&quot;-23&quot;&#xA;l=&quot;L&quot; r=&quot;t&quot; v=&quot;-38&quot;&#xA;l=&quot;L&quot; r=&quot;v&quot; v=&quot;-78&quot;&#xA;l=&quot;L&quot; r=&quot;w&quot; v=&quot;-72&quot;&#xA;l=&quot;L&quot; r=&quot;y&quot; v=&quot;-79&quot;&#xA;l=&quot;O&quot; r=&quot;A&quot; v=&quot;-23&quot;&#xA;l=&quot;O&quot; r=&quot;J&quot; v=&quot;-27&quot;&#xA;l=&quot;O&quot; r=&quot;T&quot; v=&quot;-55&quot;&#xA;l=&quot;O&quot; r=&quot;V&quot; v=&quot;-25&quot;&#xA;l=&quot;O&quot; r=&quot;W&quot; v=&quot;-22&quot;&#xA;l=&quot;O&quot; r=&quot;X&quot; v=&quot;-64&quot;&#xA;l=&quot;O&quot; r=&quot;Y&quot; v=&quot;-55&quot;&#xA;l=&quot;O&quot; r=&quot;Z&quot; v=&quot;-38&quot;&#xA;l=&quot;O&quot; r=&quot;x&quot; v=&quot;-12&quot;&#xA;l=&quot;O&quot; r=&quot;z&quot; v=&quot;-10&quot;&#xA;l=&quot;P&quot; r=&quot;A&quot; v=&quot;-151&quot;&#xA;l=&quot;P&quot; r=&quot;J&quot; v=&quot;-140&quot;&#xA;l=&quot;P&quot; r=&quot;T&quot; v=&quot;-9&quot;&#xA;l=&quot;P&quot; r=&quot;V&quot; v=&quot;-10&quot;&#xA;l=&quot;P&quot; r=&quot;X&quot; v=&quot;-35&quot;&#xA;l=&quot;P&quot; r=&quot;Y&quot; v=&quot;-11&quot;&#xA;l=&quot;P&quot; r=&quot;Z&quot; v=&quot;-29&quot;&#xA;l=&quot;P&quot; r=&quot;a&quot; v=&quot;-44&quot;&#xA;l=&quot;P&quot; r=&quot;c&quot; v=&quot;-43&quot;&#xA;l=&quot;P&quot; r=&quot;d&quot; v=&quot;-34&quot;&#xA;l=&quot;P&quot; r=&quot;e&quot; v=&quot;-41&quot;&#xA;l=&quot;P&quot; r=&quot;f&quot; v=&quot;12&quot;&#xA;l=&quot;P&quot; r=&quot;o&quot; v=&quot;-41&quot;&#xA;l=&quot;P&quot; r=&quot;q&quot; v=&quot;-34&quot;&#xA;l=&quot;P&quot; r=&quot;s&quot; v=&quot;-32&quot;&#xA;l=&quot;P&quot; r=&quot;t&quot; v=&quot;12&quot;&#xA;l=&quot;P&quot; r=&quot;y&quot; v=&quot;12&quot;&#xA;l=&quot;Q&quot; r=&quot;J&quot; v=&quot;41&quot;&#xA;l=&quot;Q&quot; r=&quot;T&quot; v=&quot;-47&quot;&#xA;l=&quot;Q&quot; r=&quot;V&quot; v=&quot;-25&quot;&#xA;l=&quot;Q&quot; r=&quot;W&quot; v=&quot;-12&quot;&#xA;l=&quot;Q&quot; r=&quot;X&quot; v=&quot;12&quot;&#xA;l=&quot;Q&quot; r=&quot;Y&quot; v=&quot;-46&quot;&#xA;l=&quot;Q&quot; r=&quot;g&quot; v=&quot;59&quot;&#xA;l=&quot;Q&quot; r=&quot;j&quot; v=&quot;79&quot;&#xA;l=&quot;Q&quot; r=&quot;x&quot; v=&quot;31&quot;&#xA;l=&quot;Q&quot; r=&quot;;&quot; v=&quot;60&quot;&#xA;l=&quot;Q&quot; r=&quot;]&quot; v=&quot;32&quot;&#xA;l=&quot;R&quot; r=&quot;C&quot; v=&quot;-18&quot;&#xA;l=&quot;R&quot; r=&quot;G&quot; v=&quot;-19&quot;&#xA;l=&quot;R&quot; r=&quot;O&quot; v=&quot;-20&quot;&#xA;l=&quot;R&quot; r=&quot;Q&quot; v=&quot;-20&quot;&#xA;l=&quot;R&quot; r=&quot;S&quot; v=&quot;-27&quot;&#xA;l=&quot;R&quot; r=&quot;T&quot; v=&quot;-20&quot;&#xA;l=&quot;R&quot; r=&quot;V&quot; v=&quot;-28&quot;&#xA;l=&quot;R&quot; r=&quot;W&quot; v=&quot;-18&quot;&#xA;l=&quot;R&quot; r=&quot;Y&quot; v=&quot;-30&quot;&#xA;l=&quot;R&quot; r=&quot;e&quot; v=&quot;-36&quot;&#xA;l=&quot;R&quot; r=&quot;o&quot; v=&quot;-42&quot;&#xA;l=&quot;R&quot; r=&quot;v&quot; v=&quot;-26&quot;&#xA;l=&quot;R&quot; r=&quot;w&quot; v=&quot;-33&quot;&#xA;l=&quot;R&quot; r=&quot;y&quot; v=&quot;-33&quot;&#xA;l=&quot;S&quot; r=&quot;A&quot; v=&quot;-15&quot;&#xA;l=&quot;S&quot; r=&quot;J&quot; v=&quot;-9&quot;&#xA;l=&quot;S&quot; r=&quot;T&quot; v=&quot;-14&quot;&#xA;l=&quot;S&quot; r=&quot;V&quot; v=&quot;-14&quot;&#xA;l=&quot;S&quot; r=&quot;W&quot; v=&quot;-15&quot;&#xA;l=&quot;S&quot; r=&quot;X&quot; v=&quot;-13&quot;&#xA;l=&quot;S&quot; r=&quot;Y&quot; v=&quot;-20&quot;&#xA;l=&quot;S&quot; r=&quot;v&quot; v=&quot;-23&quot;&#xA;l=&quot;S&quot; r=&quot;w&quot; v=&quot;-17&quot;&#xA;l=&quot;S&quot; r=&quot;y&quot; v=&quot;-25&quot;&#xA;l=&quot;T&quot; r=&quot;A&quot; v=&quot;-160&quot;&#xA;l=&quot;T&quot; r=&quot;C&quot; v=&quot;-42&quot;&#xA;l=&quot;T&quot; r=&quot;G&quot; v=&quot;-59&quot;&#xA;l=&quot;T&quot; r=&quot;J&quot; v=&quot;-65&quot;&#xA;l=&quot;T&quot; r=&quot;O&quot; v=&quot;-58&quot;&#xA;l=&quot;T&quot; r=&quot;Q&quot; v=&quot;-58&quot;&#xA;l=&quot;T&quot; r=&quot;S&quot; v=&quot;-10&quot;&#xA;l=&quot;T&quot; r=&quot;T&quot; v=&quot;28&quot;&#xA;l=&quot;T&quot; r=&quot;a&quot; v=&quot;-160&quot;&#xA;l=&quot;T&quot; r=&quot;c&quot; v=&quot;-177&quot;&#xA;l=&quot;T&quot; r=&quot;d&quot; v=&quot;-147&quot;&#xA;l=&quot;T&quot; r=&quot;e&quot; v=&quot;-182&quot;&#xA;l=&quot;T&quot; r=&quot;g&quot; v=&quot;-151&quot;&#xA;l=&quot;T&quot; r=&quot;m&quot; v=&quot;-127&quot;&#xA;l=&quot;T&quot; r=&quot;n&quot; v=&quot;-127&quot;&#xA;l=&quot;T&quot; r=&quot;o&quot; v=&quot;-182&quot;&#xA;l=&quot;T&quot; r=&quot;p&quot; v=&quot;-127&quot;&#xA;l=&quot;T&quot; r=&quot;q&quot; v=&quot;-147&quot;&#xA;l=&quot;T&quot; r=&quot;r&quot; v=&quot;-127&quot;&#xA;l=&quot;T&quot; r=&quot;s&quot; v=&quot;-153&quot;&#xA;l=&quot;T&quot; r=&quot;u&quot; v=&quot;-127&quot;&#xA;l=&quot;T&quot; r=&quot;v&quot; v=&quot;-92&quot;&#xA;l=&quot;T&quot; r=&quot;w&quot; v=&quot;-86&quot;&#xA;l=&quot;T&quot; r=&quot;x&quot; v=&quot;-90&quot;&#xA;l=&quot;T&quot; r=&quot;y&quot; v=&quot;-93&quot;&#xA;l=&quot;T&quot; r=&quot;z&quot; v=&quot;-142&quot;&#xA;l=&quot;T&quot; r=&quot;;&quot; v=&quot;-114&quot;&#xA;l=&quot;T&quot; r=&quot;:&quot; v=&quot;-134&quot;&#xA;l=&quot;U&quot; r=&quot;A&quot; v=&quot;-45&quot;&#xA;l=&quot;U&quot; r=&quot;J&quot; v=&quot;-40&quot;&#xA;l=&quot;V&quot; r=&quot;A&quot; v=&quot;-96&quot;&#xA;l=&quot;V&quot; r=&quot;C&quot; v=&quot;-18&quot;&#xA;l=&quot;V&quot; r=&quot;G&quot; v=&quot;-25&quot;&#xA;l=&quot;V&quot; r=&quot;J&quot; v=&quot;-80&quot;&#xA;l=&quot;V&quot; r=&quot;O&quot; v=&quot;-27&quot;&#xA;l=&quot;V&quot; r=&quot;Q&quot; v=&quot;-27&quot;&#xA;l=&quot;V&quot; r=&quot;S&quot; v=&quot;-12&quot;&#xA;l=&quot;V&quot; r=&quot;V&quot; v=&quot;9&quot;&#xA;l=&quot;V&quot; r=&quot;a&quot; v=&quot;-114&quot;&#xA;l=&quot;V&quot; r=&quot;c&quot; v=&quot;-103&quot;&#xA;l=&quot;V&quot; r=&quot;d&quot; v=&quot;-87&quot;&#xA;l=&quot;V&quot; r=&quot;e&quot; v=&quot;-102&quot;&#xA;l=&quot;V&quot; r=&quot;g&quot; v=&quot;-100&quot;&#xA;l=&quot;V&quot; r=&quot;m&quot; v=&quot;-50&quot;&#xA;l=&quot;V&quot; r=&quot;n&quot; v=&quot;-50&quot;&#xA;l=&quot;V&quot; r=&quot;o&quot; v=&quot;-86&quot;&#xA;l=&quot;V&quot; r=&quot;p&quot; v=&quot;-50&quot;&#xA;l=&quot;V&quot; r=&quot;q&quot; v=&quot;-87&quot;&#xA;l=&quot;V&quot; r=&quot;r&quot; v=&quot;-50&quot;&#xA;l=&quot;V&quot; r=&quot;s&quot; v=&quot;-90&quot;&#xA;l=&quot;V&quot; r=&quot;u&quot; v=&quot;-50&quot;&#xA;l=&quot;V&quot; r=&quot;y&quot; v=&quot;-35&quot;&#xA;l=&quot;V&quot; r=&quot;z&quot; v=&quot;-82&quot;&#xA;l=&quot;V&quot; r=&quot;;&quot; v=&quot;-108&quot;&#xA;l=&quot;V&quot; r=&quot;:&quot; v=&quot;-73&quot;&#xA;l=&quot;W&quot; r=&quot;A&quot; v=&quot;-93&quot;&#xA;l=&quot;W&quot; r=&quot;C&quot; v=&quot;-22&quot;&#xA;l=&quot;W&quot; r=&quot;G&quot; v=&quot;-22&quot;&#xA;l=&quot;W&quot; r=&quot;J&quot; v=&quot;-88&quot;&#xA;l=&quot;W&quot; r=&quot;O&quot; v=&quot;-22&quot;&#xA;l=&quot;W&quot; r=&quot;Q&quot; v=&quot;-22&quot;&#xA;l=&quot;W&quot; r=&quot;S&quot; v=&quot;-10&quot;&#xA;l=&quot;W&quot; r=&quot;X&quot; v=&quot;-13&quot;&#xA;l=&quot;W&quot; r=&quot;a&quot; v=&quot;-71&quot;&#xA;l=&quot;W&quot; r=&quot;c&quot; v=&quot;-78&quot;&#xA;l=&quot;W&quot; r=&quot;d&quot; v=&quot;-72&quot;&#xA;l=&quot;W&quot; r=&quot;e&quot; v=&quot;-75&quot;&#xA;l=&quot;W&quot; r=&quot;g&quot; v=&quot;-54&quot;&#xA;l=&quot;W&quot; r=&quot;m&quot; v=&quot;-60&quot;&#xA;l=&quot;W&quot; r=&quot;n&quot; v=&quot;-60&quot;&#xA;l=&quot;W&quot; r=&quot;o&quot; v=&quot;-86&quot;&#xA;l=&quot;W&quot; r=&quot;p&quot; v=&quot;-60&quot;&#xA;l=&quot;W&quot; r=&quot;q&quot; v=&quot;-72&quot;&#xA;l=&quot;W&quot; r=&quot;r&quot; v=&quot;-60&quot;&#xA;l=&quot;W&quot; r=&quot;s&quot; v=&quot;-73&quot;&#xA;l=&quot;W&quot; r=&quot;u&quot; v=&quot;-60&quot;&#xA;l=&quot;W&quot; r=&quot;v&quot; v=&quot;-34&quot;&#xA;l=&quot;W&quot; r=&quot;y&quot; v=&quot;-53&quot;&#xA;l=&quot;W&quot; r=&quot;;&quot; v=&quot;-156&quot;&#xA;l=&quot;X&quot; r=&quot;C&quot; v=&quot;-57&quot;&#xA;l=&quot;X&quot; r=&quot;G&quot; v=&quot;-65&quot;&#xA;l=&quot;X&quot; r=&quot;O&quot; v=&quot;-57&quot;&#xA;l=&quot;X&quot; r=&quot;Q&quot; v=&quot;-57&quot;&#xA;l=&quot;X&quot; r=&quot;S&quot; v=&quot;-20&quot;&#xA;l=&quot;X&quot; r=&quot;d&quot; v=&quot;-44&quot;&#xA;l=&quot;X&quot; r=&quot;e&quot; v=&quot;-39&quot;&#xA;l=&quot;X&quot; r=&quot;g&quot; v=&quot;-9&quot;&#xA;l=&quot;X&quot; r=&quot;o&quot; v=&quot;-38&quot;&#xA;l=&quot;X&quot; r=&quot;q&quot; v=&quot;-44&quot;&#xA;l=&quot;X&quot; r=&quot;t&quot; v=&quot;-31&quot;&#xA;l=&quot;X&quot; r=&quot;u&quot; v=&quot;-38&quot;&#xA;l=&quot;X&quot; r=&quot;v&quot; v=&quot;-55&quot;&#xA;l=&quot;X&quot; r=&quot;w&quot; v=&quot;-49&quot;&#xA;l=&quot;X&quot; r=&quot;y&quot; v=&quot;-43&quot;&#xA;l=&quot;Y&quot; r=&quot;A&quot; v=&quot;-152&quot;&#xA;l=&quot;Y&quot; r=&quot;C&quot; v=&quot;-67&quot;&#xA;l=&quot;Y&quot; r=&quot;G&quot; v=&quot;-67&quot;&#xA;l=&quot;Y&quot; r=&quot;J&quot; v=&quot;-112&quot;&#xA;l=&quot;Y&quot; r=&quot;O&quot; v=&quot;-66&quot;&#xA;l=&quot;Y&quot; r=&quot;Q&quot; v=&quot;-66&quot;&#xA;l=&quot;Y&quot; r=&quot;S&quot; v=&quot;-17&quot;&#xA;l=&quot;Y&quot; r=&quot;Z&quot; v=&quot;-10&quot;&#xA;l=&quot;Y&quot; r=&quot;a&quot; v=&quot;-134&quot;&#xA;l=&quot;Y&quot; r=&quot;c&quot; v=&quot;-159&quot;&#xA;l=&quot;Y&quot; r=&quot;d&quot; v=&quot;-131&quot;&#xA;l=&quot;Y&quot; r=&quot;e&quot; v=&quot;-147&quot;&#xA;l=&quot;Y&quot; r=&quot;f&quot; v=&quot;-62&quot;&#xA;l=&quot;Y&quot; r=&quot;g&quot; v=&quot;-142&quot;&#xA;l=&quot;Y&quot; r=&quot;i&quot; v=&quot;-32&quot;&#xA;l=&quot;Y&quot; r=&quot;j&quot; v=&quot;-49&quot;&#xA;l=&quot;Y&quot; r=&quot;m&quot; v=&quot;-94&quot;&#xA;l=&quot;Y&quot; r=&quot;n&quot; v=&quot;-94&quot;&#xA;l=&quot;Y&quot; r=&quot;o&quot; v=&quot;-153&quot;&#xA;l=&quot;Y&quot; r=&quot;p&quot; v=&quot;-94&quot;&#xA;l=&quot;Y&quot; r=&quot;q&quot; v=&quot;-131&quot;&#xA;l=&quot;Y&quot; r=&quot;r&quot; v=&quot;-94&quot;&#xA;l=&quot;Y&quot; r=&quot;s&quot; v=&quot;-115&quot;&#xA;l=&quot;Y&quot; r=&quot;t&quot; v=&quot;-44&quot;&#xA;l=&quot;Y&quot; r=&quot;u&quot; v=&quot;-94&quot;&#xA;l=&quot;Y&quot; r=&quot;v&quot; v=&quot;-69&quot;&#xA;l=&quot;Y&quot; r=&quot;w&quot; v=&quot;-62&quot;&#xA;l=&quot;Y&quot; r=&quot;x&quot; v=&quot;-70&quot;&#xA;l=&quot;Y&quot; r=&quot;y&quot; v=&quot;-65&quot;&#xA;l=&quot;Y&quot; r=&quot;z&quot; v=&quot;-100&quot;&#xA;l=&quot;Y&quot; r=&quot;;&quot; v=&quot;-138&quot;&#xA;l=&quot;Y&quot; r=&quot;:&quot; v=&quot;-154&quot;&#xA;l=&quot;Z&quot; r=&quot;A&quot; v=&quot;-11&quot;&#xA;l=&quot;Z&quot; r=&quot;C&quot; v=&quot;-25&quot;&#xA;l=&quot;Z&quot; r=&quot;G&quot; v=&quot;-24&quot;&#xA;l=&quot;Z&quot; r=&quot;O&quot; v=&quot;-24&quot;&#xA;l=&quot;Z&quot; r=&quot;Q&quot; v=&quot;-24&quot;&#xA;l=&quot;Z&quot; r=&quot;W&quot; v=&quot;-7&quot;&#xA;l=&quot;Z&quot; r=&quot;Y&quot; v=&quot;-7&quot;&#xA;l=&quot;Z&quot; r=&quot;a&quot; v=&quot;-10&quot;&#xA;l=&quot;Z&quot; r=&quot;c&quot; v=&quot;-12&quot;&#xA;l=&quot;Z&quot; r=&quot;d&quot; v=&quot;-18&quot;&#xA;l=&quot;Z&quot; r=&quot;e&quot; v=&quot;-31&quot;&#xA;l=&quot;Z&quot; r=&quot;o&quot; v=&quot;-29&quot;&#xA;l=&quot;Z&quot; r=&quot;q&quot; v=&quot;-18&quot;&#xA;l=&quot;Z&quot; r=&quot;v&quot; v=&quot;-45&quot;&#xA;l=&quot;Z&quot; r=&quot;w&quot; v=&quot;-38&quot;&#xA;l=&quot;Z&quot; r=&quot;y&quot; v=&quot;-37&quot;&#xA;l=&quot;a&quot; r=&quot;f&quot; v=&quot;-12&quot;&#xA;l=&quot;a&quot; r=&quot;t&quot; v=&quot;-19&quot;&#xA;l=&quot;a&quot; r=&quot;v&quot; v=&quot;-34&quot;&#xA;l=&quot;a&quot; r=&quot;w&quot; v=&quot;-14&quot;&#xA;l=&quot;a&quot; r=&quot;x&quot; v=&quot;-19&quot;&#xA;l=&quot;a&quot; r=&quot;y&quot; v=&quot;-38&quot;&#xA;l=&quot;b&quot; r=&quot;f&quot; v=&quot;-17&quot;&#xA;l=&quot;b&quot; r=&quot;s&quot; v=&quot;-10&quot;&#xA;l=&quot;b&quot; r=&quot;t&quot; v=&quot;-9&quot;&#xA;l=&quot;b&quot; r=&quot;v&quot; v=&quot;-10&quot;&#xA;l=&quot;b&quot; r=&quot;w&quot; v=&quot;-10&quot;&#xA;l=&quot;b&quot; r=&quot;x&quot; v=&quot;-41&quot;&#xA;l=&quot;b&quot; r=&quot;y&quot; v=&quot;-10&quot;&#xA;l=&quot;b&quot; r=&quot;z&quot; v=&quot;-28&quot;&#xA;l=&quot;c&quot; r=&quot;a&quot; v=&quot;-17&quot;&#xA;l=&quot;c&quot; r=&quot;o&quot; v=&quot;-17&quot;&#xA;l=&quot;e&quot; r=&quot;f&quot; v=&quot;-18&quot;&#xA;l=&quot;e&quot; r=&quot;t&quot; v=&quot;-11&quot;&#xA;l=&quot;e&quot; r=&quot;v&quot; v=&quot;-10&quot;&#xA;l=&quot;e&quot; r=&quot;w&quot; v=&quot;-10&quot;&#xA;l=&quot;e&quot; r=&quot;x&quot; v=&quot;-31&quot;&#xA;l=&quot;e&quot; r=&quot;y&quot; v=&quot;-13&quot;&#xA;l=&quot;e&quot; r=&quot;z&quot; v=&quot;-20&quot;&#xA;l=&quot;f&quot; r=&quot;a&quot; v=&quot;-40&quot;&#xA;l=&quot;f&quot; r=&quot;c&quot; v=&quot;-45&quot;&#xA;l=&quot;f&quot; r=&quot;d&quot; v=&quot;-53&quot;&#xA;l=&quot;f&quot; r=&quot;e&quot; v=&quot;-51&quot;&#xA;l=&quot;f&quot; r=&quot;f&quot; v=&quot;-20&quot;&#xA;l=&quot;f&quot; r=&quot;g&quot; v=&quot;-60&quot;&#xA;l=&quot;f&quot; r=&quot;o&quot; v=&quot;-43&quot;&#xA;l=&quot;f&quot; r=&quot;q&quot; v=&quot;-53&quot;&#xA;l=&quot;f&quot; r=&quot;s&quot; v=&quot;-27&quot;&#xA;l=&quot;f&quot; r=&quot;v&quot; v=&quot;13&quot;&#xA;l=&quot;f&quot; r=&quot;w&quot; v=&quot;6&quot;&#xA;l=&quot;f&quot; r=&quot;y&quot; v=&quot;10&quot;&#xA;l=&quot;f&quot; r=&quot;z&quot; v=&quot;-20&quot;&#xA;l=&quot;g&quot; r=&quot;a&quot; v=&quot;-38&quot;&#xA;l=&quot;g&quot; r=&quot;c&quot; v=&quot;-12&quot;&#xA;l=&quot;g&quot; r=&quot;d&quot; v=&quot;-19&quot;&#xA;l=&quot;g&quot; r=&quot;e&quot; v=&quot;-17&quot;&#xA;l=&quot;g&quot; r=&quot;g&quot; v=&quot;19&quot;&#xA;l=&quot;g&quot; r=&quot;o&quot; v=&quot;-14&quot;&#xA;l=&quot;g&quot; r=&quot;q&quot; v=&quot;-19&quot;&#xA;l=&quot;g&quot; r=&quot;t&quot; v=&quot;-31&quot;&#xA;l=&quot;h&quot; r=&quot;f&quot; v=&quot;-12&quot;&#xA;l=&quot;h&quot; r=&quot;t&quot; v=&quot;-19&quot;&#xA;l=&quot;h&quot; r=&quot;v&quot; v=&quot;-34&quot;&#xA;l=&quot;h&quot; r=&quot;w&quot; v=&quot;-14&quot;&#xA;l=&quot;h&quot; r=&quot;x&quot; v=&quot;-19&quot;&#xA;l=&quot;h&quot; r=&quot;y&quot; v=&quot;-38&quot;&#xA;l=&quot;k&quot; r=&quot;a&quot; v=&quot;-35&quot;&#xA;l=&quot;k&quot; r=&quot;c&quot; v=&quot;-48&quot;&#xA;l=&quot;k&quot; r=&quot;d&quot; v=&quot;-56&quot;&#xA;l=&quot;k&quot; r=&quot;e&quot; v=&quot;-66&quot;&#xA;l=&quot;k&quot; r=&quot;o&quot; v=&quot;-69&quot;&#xA;l=&quot;k&quot; r=&quot;q&quot; v=&quot;-56&quot;&#xA;l=&quot;k&quot; r=&quot;s&quot; v=&quot;-19&quot;&#xA;l=&quot;k&quot; r=&quot;t&quot; v=&quot;-10&quot;&#xA;l=&quot;k&quot; r=&quot;u&quot; v=&quot;-26&quot;&#xA;l=&quot;m&quot; r=&quot;f&quot; v=&quot;-12&quot;&#xA;l=&quot;m&quot; r=&quot;t&quot; v=&quot;-19&quot;&#xA;l=&quot;m&quot; r=&quot;v&quot; v=&quot;-34&quot;&#xA;l=&quot;m&quot; r=&quot;w&quot; v=&quot;-14&quot;&#xA;l=&quot;m&quot; r=&quot;x&quot; v=&quot;-19&quot;&#xA;l=&quot;m&quot; r=&quot;y&quot; v=&quot;-38&quot;&#xA;l=&quot;n&quot; r=&quot;f&quot; v=&quot;-12&quot;&#xA;l=&quot;n&quot; r=&quot;t&quot; v=&quot;-19&quot;&#xA;l=&quot;n&quot; r=&quot;v&quot; v=&quot;-34&quot;&#xA;l=&quot;n&quot; r=&quot;w&quot; v=&quot;-14&quot;&#xA;l=&quot;n&quot; r=&quot;x&quot; v=&quot;-19&quot;&#xA;l=&quot;n&quot; r=&quot;y&quot; v=&quot;-38&quot;&#xA;l=&quot;o&quot; r=&quot;v&quot; v=&quot;-9&quot;&#xA;l=&quot;o&quot; r=&quot;w&quot; v=&quot;-8&quot;&#xA;l=&quot;o&quot; r=&quot;x&quot; v=&quot;-40&quot;&#xA;l=&quot;o&quot; r=&quot;y&quot; v=&quot;-11&quot;&#xA;l=&quot;o&quot; r=&quot;z&quot; v=&quot;-27&quot;&#xA;l=&quot;p&quot; r=&quot;f&quot; v=&quot;-17&quot;&#xA;l=&quot;p&quot; r=&quot;s&quot; v=&quot;-10&quot;&#xA;l=&quot;p&quot; r=&quot;t&quot; v=&quot;-9&quot;&#xA;l=&quot;p&quot; r=&quot;v&quot; v=&quot;-10&quot;&#xA;l=&quot;p&quot; r=&quot;w&quot; v=&quot;-10&quot;&#xA;l=&quot;p&quot; r=&quot;x&quot; v=&quot;-41&quot;&#xA;l=&quot;p&quot; r=&quot;y&quot; v=&quot;-10&quot;&#xA;l=&quot;p&quot; r=&quot;z&quot; v=&quot;-28&quot;&#xA;l=&quot;q&quot; r=&quot;g&quot; v=&quot;10&quot;&#xA;l=&quot;r&quot; r=&quot;a&quot; v=&quot;-42&quot;&#xA;l=&quot;r&quot; r=&quot;c&quot; v=&quot;-30&quot;&#xA;l=&quot;r&quot; r=&quot;d&quot; v=&quot;-28&quot;&#xA;l=&quot;r&quot; r=&quot;e&quot; v=&quot;-27&quot;&#xA;l=&quot;r&quot; r=&quot;g&quot; v=&quot;-28&quot;&#xA;l=&quot;r&quot; r=&quot;o&quot; v=&quot;-33&quot;&#xA;l=&quot;r&quot; r=&quot;q&quot; v=&quot;-28&quot;&#xA;l=&quot;r&quot; r=&quot;s&quot; v=&quot;-35&quot;&#xA;l=&quot;r&quot; r=&quot;v&quot; v=&quot;19&quot;&#xA;l=&quot;r&quot; r=&quot;w&quot; v=&quot;11&quot;&#xA;l=&quot;r&quot; r=&quot;y&quot; v=&quot;10&quot;&#xA;l=&quot;s&quot; r=&quot;f&quot; v=&quot;-19&quot;&#xA;l=&quot;s&quot; r=&quot;t&quot; v=&quot;-23&quot;&#xA;l=&quot;s&quot; r=&quot;v&quot; v=&quot;-31&quot;&#xA;l=&quot;s&quot; r=&quot;w&quot; v=&quot;-10&quot;&#xA;l=&quot;s&quot; r=&quot;x&quot; v=&quot;-22&quot;&#xA;l=&quot;s&quot; r=&quot;y&quot; v=&quot;-37&quot;&#xA;l=&quot;s&quot; r=&quot;z&quot; v=&quot;-18&quot;&#xA;l=&quot;t&quot; r=&quot;a&quot; v=&quot;-25&quot;&#xA;l=&quot;t&quot; r=&quot;c&quot; v=&quot;-25&quot;&#xA;l=&quot;t&quot; r=&quot;d&quot; v=&quot;-23&quot;&#xA;l=&quot;t&quot; r=&quot;e&quot; v=&quot;-22&quot;&#xA;l=&quot;t&quot; r=&quot;o&quot; v=&quot;-20&quot;&#xA;l=&quot;t&quot; r=&quot;q&quot; v=&quot;-23&quot;&#xA;l=&quot;t&quot; r=&quot;t&quot; v=&quot;-29&quot;&#xA;l=&quot;v&quot; r=&quot;a&quot; v=&quot;-30&quot;&#xA;l=&quot;v&quot; r=&quot;c&quot; v=&quot;-25&quot;&#xA;l=&quot;v&quot; r=&quot;d&quot; v=&quot;-20&quot;&#xA;l=&quot;v&quot; r=&quot;e&quot; v=&quot;-20&quot;&#xA;l=&quot;v&quot; r=&quot;f&quot; v=&quot;11&quot;&#xA;l=&quot;v&quot; r=&quot;g&quot; v=&quot;-28&quot;&#xA;l=&quot;v&quot; r=&quot;o&quot; v=&quot;-19&quot;&#xA;l=&quot;v&quot; r=&quot;q&quot; v=&quot;-20&quot;&#xA;l=&quot;v&quot; r=&quot;s&quot; v=&quot;-9&quot;&#xA;l=&quot;v&quot; r=&quot;t&quot; v=&quot;10&quot;&#xA;l=&quot;v&quot; r=&quot;v&quot; v=&quot;12&quot;&#xA;l=&quot;v&quot; r=&quot;w&quot; v=&quot;12&quot;&#xA;l=&quot;v&quot; r=&quot;y&quot; v=&quot;12&quot;&#xA;l=&quot;v&quot; r=&quot;z&quot; v=&quot;-26&quot;&#xA;l=&quot;w&quot; r=&quot;a&quot; v=&quot;-23&quot;&#xA;l=&quot;w&quot; r=&quot;c&quot; v=&quot;-20&quot;&#xA;l=&quot;w&quot; r=&quot;d&quot; v=&quot;-18&quot;&#xA;l=&quot;w&quot; r=&quot;e&quot; v=&quot;-18&quot;&#xA;l=&quot;w&quot; r=&quot;f&quot; v=&quot;6&quot;&#xA;l=&quot;w&quot; r=&quot;g&quot; v=&quot;-18&quot;&#xA;l=&quot;w&quot; r=&quot;o&quot; v=&quot;-19&quot;&#xA;l=&quot;w&quot; r=&quot;q&quot; v=&quot;-18&quot;&#xA;l=&quot;w&quot; r=&quot;s&quot; v=&quot;-18&quot;&#xA;l=&quot;w&quot; r=&quot;t&quot; v=&quot;4&quot;&#xA;l=&quot;w&quot; r=&quot;v&quot; v=&quot;12&quot;&#xA;l=&quot;w&quot; r=&quot;w&quot; v=&quot;8&quot;&#xA;l=&quot;w&quot; r=&quot;y&quot; v=&quot;12&quot;&#xA;l=&quot;w&quot; r=&quot;z&quot; v=&quot;-17&quot;&#xA;l=&quot;x&quot; r=&quot;a&quot; v=&quot;-37&quot;&#xA;l=&quot;x&quot; r=&quot;c&quot; v=&quot;-46&quot;&#xA;l=&quot;x&quot; r=&quot;d&quot; v=&quot;-44&quot;&#xA;l=&quot;x&quot; r=&quot;e&quot; v=&quot;-54&quot;&#xA;l=&quot;x&quot; r=&quot;o&quot; v=&quot;-55&quot;&#xA;l=&quot;x&quot; r=&quot;q&quot; v=&quot;-44&quot;&#xA;l=&quot;x&quot; r=&quot;s&quot; v=&quot;-12&quot;&#xA;l=&quot;x&quot; r=&quot;t&quot; v=&quot;6&quot;&#xA;l=&quot;x&quot; r=&quot;u&quot; v=&quot;-20&quot;&#xA;l=&quot;y&quot; r=&quot;a&quot; v=&quot;-31&quot;&#xA;l=&quot;y&quot; r=&quot;c&quot; v=&quot;-26&quot;&#xA;l=&quot;y&quot; r=&quot;d&quot; v=&quot;-24&quot;&#xA;l=&quot;y&quot; r=&quot;e&quot; v=&quot;-25&quot;&#xA;l=&quot;y&quot; r=&quot;f&quot; v=&quot;10&quot;&#xA;l=&quot;y&quot; r=&quot;g&quot; v=&quot;-26&quot;&#xA;l=&quot;y&quot; r=&quot;o&quot; v=&quot;-24&quot;&#xA;l=&quot;y&quot; r=&quot;q&quot; v=&quot;-24&quot;&#xA;l=&quot;y&quot; r=&quot;s&quot; v=&quot;-19&quot;&#xA;l=&quot;y&quot; r=&quot;t&quot; v=&quot;10&quot;&#xA;l=&quot;y&quot; r=&quot;v&quot; v=&quot;12&quot;&#xA;l=&quot;y&quot; r=&quot;w&quot; v=&quot;8&quot;&#xA;l=&quot;y&quot; r=&quot;y&quot; v=&quot;10&quot;&#xA;l=&quot;y&quot; r=&quot;z&quot; v=&quot;-17&quot;&#xA;l=&quot;z&quot; r=&quot;a&quot; v=&quot;-34&quot;&#xA;l=&quot;z&quot; r=&quot;c&quot; v=&quot;-45&quot;&#xA;l=&quot;z&quot; r=&quot;d&quot; v=&quot;-46&quot;&#xA;l=&quot;z&quot; r=&quot;e&quot; v=&quot;-46&quot;&#xA;l=&quot;z&quot; r=&quot;f&quot; v=&quot;-10&quot;&#xA;l=&quot;z&quot; r=&quot;g&quot; v=&quot;-17&quot;&#xA;l=&quot;z&quot; r=&quot;o&quot; v=&quot;-45&quot;&#xA;l=&quot;z&quot; r=&quot;q&quot; v=&quot;-46&quot;&#xA;l=&quot;z&quot; r=&quot;s&quot; v=&quot;-22&quot;&#xA;l=&quot;z&quot; r=&quot;u&quot; v=&quot;-10&quot;&#xA;l=&quot;z&quot; r=&quot;v&quot; v=&quot;-18&quot;&#xA;l=&quot;z&quot; r=&quot;w&quot; v=&quot;-22&quot;&#xA;l=&quot;z&quot; r=&quot;y&quot; v=&quot;-18&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer (in bytes) wins.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Meta&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I know this challenge is going to need a lot of work before it's ready for main. Please hold criticisms for now. Helpful ideas and thoughts are welcome.&lt;/p&gt;&#xA;" OwnerUserId="51785" LastEditorUserId="51785" LastEditDate="2017-09-16T08:52:57.907" LastActivityDate="2017-09-16T08:52:57.907" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="12563" PostTypeId="2" ParentId="2140" CreationDate="2017-05-24T08:59:59.963" Score="3" Body="&lt;h1&gt;Mark Duplicates&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a list of non-negative integers, find the values which are duplicates and mark their positions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, given &lt;code&gt;[1, 2, 3, 2, 1]&lt;/code&gt;, the output could be &lt;code&gt;[1, 1, 0, 1, 1]&lt;/code&gt; where each &lt;code&gt;1&lt;/code&gt; signifies that the value at that position is duplicated elsewhere in the array and each &lt;code&gt;0&lt;/code&gt; signifies that the value at that position is unique.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your output may use either &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt;, boolean values for &lt;code&gt;false&lt;/code&gt; and &lt;code&gt;true&lt;/code&gt;, or any other two distinct values as long as you remain consistent.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so minimize the length of your code.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[] -&amp;gt; []&#xA;[5] -&amp;gt; [0]&#xA;[0, 1] -&amp;gt; [0, 0]&#xA;[2, 2] -&amp;gt; [1, 1]&#xA;[1, 2, 3, 2, 1] -&amp;gt; [1, 1, 0, 1, 1]&#xA;[6, 3, 6, 3, 5, 2, 3] -&amp;gt; [1, 1, 1, 1, 0, 0, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="6710" LastEditorUserId="6710" LastEditDate="2017-05-24T18:44:28.303" LastActivityDate="2017-05-24T18:44:28.303" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="12565" PostTypeId="1" CreationDate="2017-05-24T12:53:03.870" Score="0" ViewCount="49" Body="&lt;p&gt;On the question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/121566/how-long-is-my-number-restricted-version&quot;&gt;How long is my number: Restricted Version&lt;/a&gt;, there are multiple answers which are 1 byte long? How should judge which answer to give the green check to?&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2017-05-24T12:53:03.870" Title="What should be done when there are joint winners?" Tags="|discussion|code-golf|scoring|accepted-answer|" AnswerCount="0" CommentCount="2" ClosedDate="2017-05-24T13:41:06.693" ContentLicense="CC BY-SA 3.0" />
  <row Id="12566" PostTypeId="2" ParentId="5139" CreationDate="2017-05-24T13:08:37.210" Score="3" Body="&lt;h1&gt;Makes links &lt;code&gt;target=&quot;_top&quot;&lt;/code&gt; or &lt;code&gt;target=&quot;_blank&quot;&lt;/code&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;That way they don't open in the snippet. I find that annoying.&lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastActivityDate="2017-05-24T13:08:37.210" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12568" PostTypeId="2" ParentId="2140" CreationDate="2017-05-24T16:17:51.360" Score="1" Body="&lt;h1&gt;Build a simple 2D game engine&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program that take input specifying specs of a simple 2D game regarding the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;GUI&lt;/strong&gt;: a space where you can print text&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Scene&lt;/strong&gt;: a 2D stage where player\enemy move&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Input&lt;/strong&gt; Scheme: a way to check for input&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Player&lt;/strong&gt;: one object&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Enemy&lt;/strong&gt;: one or more objects&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Coin&lt;/strong&gt;: one object&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Engine&lt;/strong&gt;: manage running scenes&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The program should offer the following instructions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;generate&lt;/strong&gt;: create an object &amp;amp; place it in the scene&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;destroy&lt;/strong&gt;: destroy an object or hide it from the scene&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;move&lt;/strong&gt;: move an object to a different location, or apply motion&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;collision&lt;/strong&gt;: check if two objects are colliding or interlacing&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;write&lt;/strong&gt;: write to GUI&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;param&lt;/strong&gt;: create, modify, or read an integer&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;terminate&lt;/strong&gt;: stop running &lt;strong&gt;update&lt;/strong&gt;, and run &lt;strong&gt;end&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;a way to do an &lt;strong&gt;if-else&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;A &lt;strong&gt;Scene&lt;/strong&gt; should at least have the following functions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;start&lt;/strong&gt;: sequence of instructions, applied once when the scene is fired&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;update&lt;/strong&gt;: sequence of instructions, applied N-times per second&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;end&lt;/strong&gt;: sequence of instructions, applied once when the scene is terminated&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt; &lt;em&gt;the game spec&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;GUI:1,10&#xA;&#xA;SCENE:5,10&#xA;&#xA;START: GEN(p1,PLAYER,5,1); GEN(e1,ENEMY,4,4); GEN(c1,COIN,3,6); PARAM(r1,0)&#xA;&#xA;UPDATE:  IF(COLLISION(p1,c1), DESTROY(c1);PARAM(r1,PARAM(r1)+1));&#xA;         IF(COLLISION(p1,e1), DESTROY(p1);TERMINATE);&#xA;          IF(INPUT(ARROW-UP), MOVE(p1,-1,0));&#xA;        IF(INPUT(ARROW-DOWN), MOVE(p1,+1,0));&#xA;        IF(INPUT(ARROW-LEFT), MOVE(p1,0,-1));&#xA;       IF(INPUT(ARROW-RIGHT), MOVE(p1,0,+1));&#xA;       WRITE(g1,r1)&#xA;&#xA;END: IF(PARAM(r1)=1, WRITE(g1,&quot;YOU WON&quot;), WRITE(g1,&quot;GAME OVER&quot;))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt; &lt;em&gt;an interactive game&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[ 0        ] &amp;lt;----- G:GUI (1 x 10)&#xA;+----------+&#xA;|          | &amp;lt;--- S:Scene (5 x 10)&#xA;|          |&#xA;|      C &amp;lt;-|----- C:Coin&#xA;|   E &amp;lt;----|----- E:Enemy&#xA;|P &amp;lt;-------|----- P:Player&#xA;+----------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;game starts with player, one enemy, one coin&lt;/li&gt;&#xA;&lt;li&gt;you can control the player with arrow keys&lt;/li&gt;&#xA;&lt;li&gt;if player come in contact with enemy, player disappear then it ends&lt;/li&gt;&#xA;&lt;li&gt;if player come in contact with coin, coin disappear then it's counted&lt;/li&gt;&#xA;&lt;li&gt;when game ends, if coin count is 1 you win, otherwise you lose&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What &lt;strong&gt;tags&lt;/strong&gt; to use?&lt;/li&gt;&#xA;&lt;li&gt;How can I simplify the requirements so that it's possible to solve it with languages of simple means?&lt;/li&gt;&#xA;&lt;li&gt;I haven't seen many challenges like this, to write a program which parse instructions to create an interactive program within it, what do you think?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="47981" LastActivityDate="2017-05-24T16:17:51.360" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12570" PostTypeId="2" ParentId="2140" CreationDate="2017-05-24T20:02:26.567" Score="1" Body="&lt;h1&gt;Distinct strict partition counts&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer-partitions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer-partitions&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer-partitions&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/71941/44713&quot;&gt;Related&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a function or program that, given a positive integer &lt;code&gt;n&lt;/code&gt;, returns or prints an array (or list, set, etc.) of length &lt;code&gt;l&lt;/code&gt; such that each index &lt;code&gt;i&lt;/code&gt; contains the count of distinct partitions of size &lt;code&gt;i&lt;/code&gt; of &lt;code&gt;n&lt;/code&gt; (one-indexed) and &lt;code&gt;l&lt;/code&gt; is the maximum size of partitions for &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Definition&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let &lt;code&gt;f(n)&lt;/code&gt; implement the task described.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Consider &lt;code&gt;f(10)&lt;/code&gt;&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;10 may be broken into the following distinct partitions:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;10         // Size 1&#xA;9,1        // Size 2&#xA;8,2&#xA;7,3&#xA;6,4&#xA;7,2,1      // Size 3&#xA;6,3,1&#xA;5,4,1&#xA;5,3,2&#xA;4,3,2,1    // Size 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1 distinct partitions of size 1.&lt;/li&gt;&#xA;&lt;li&gt;4 distinct partitions of size 2.&lt;/li&gt;&#xA;&lt;li&gt;4 distinct partitions of size 3.&lt;/li&gt;&#xA;&lt;li&gt;1 distinct partitions of size 4.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Therefore, &lt;code&gt;f(10)&lt;/code&gt; returns &lt;code&gt;[1, 4, 4, 1]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;TODO&lt;/p&gt;&#xA;" OwnerUserId="44713" LastActivityDate="2017-05-24T20:02:26.567" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12572" PostTypeId="2" ParentId="6918" CreationDate="2017-05-24T23:47:10.000" Score="7" Body="&lt;h1&gt;&lt;a href=&quot;//github.com/aaronryank/shortC&quot; rel=&quot;nofollow noreferrer&quot;&gt;shortC&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This language was created by me in May 2017.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;shortC is a &quot;programming language&quot; for code golfing. Frequently-used C functions/keywords are shortened into capital letters. shortC automatically inserts closing quotes, closing double-quotes, final semicolon and closing curly-braces. It only auto-inserts a semicolon before each final closing curly-brace.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Conversions that shortC performs as of 5/23/2017 UTC-23:54:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;A&lt;/code&gt; -&gt; &lt;code&gt;int main(int argc, char **argv){&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;B&lt;/code&gt; -&gt; &lt;code&gt;int main(&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;C&lt;/code&gt; -&gt; &lt;code&gt;char&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;D&lt;/code&gt; -&gt; &lt;code&gt;#define&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;E&lt;/code&gt; -&gt; &lt;code&gt;else&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;F&lt;/code&gt; -&gt; &lt;code&gt;if(&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;G&lt;/code&gt; -&gt; &lt;code&gt;getchar()&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;H&lt;/code&gt; -&gt; &lt;code&gt;switch(&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;I&lt;/code&gt; -&gt; &lt;code&gt;int&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;J&lt;/code&gt; -&gt; &lt;code&gt;puts(&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;L&lt;/code&gt; -&gt; &lt;code&gt;long&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;M&lt;/code&gt; -&gt; &lt;code&gt;strcmp(&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;O&lt;/code&gt; -&gt; &lt;code&gt;for(&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;P&lt;/code&gt; -&gt; &lt;code&gt;putchar(&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Q&lt;/code&gt; -&gt; &lt;code&gt;gets(&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;R&lt;/code&gt; -&gt; &lt;code&gt;printf(&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;S&lt;/code&gt; -&gt; &lt;code&gt;strlen(&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;T&lt;/code&gt; -&gt; &lt;code&gt;return&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;U&lt;/code&gt; -&gt; &lt;code&gt;usleep(&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;W&lt;/code&gt; -&gt; &lt;code&gt;while(&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;X&lt;/code&gt; -&gt; &lt;code&gt;while(1){&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;$&lt;/code&gt; -&gt; &lt;code&gt;system(&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;(there are a lot more now but I'm inactive so I'm not going to bother updating this)&lt;/p&gt;&#xA;" OwnerUserId="61563" LastEditorUserId="61563" LastEditDate="2018-08-08T07:51:27.660" LastActivityDate="2018-08-08T07:51:27.660" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="12574" PostTypeId="2" ParentId="2140" CreationDate="2017-05-25T12:53:37.703" Score="0" Body="&lt;h1&gt;21 = (1 + 3 + 5 + 7 + 9) - (1 + 3)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Sandbox question&lt;/strong&gt;:&lt;br /&gt;&#xA;Is this different enough from &lt;a href=&quot;https://codegolf.stackexchange.com/q/120487/58563&quot;&gt;the original challenge&lt;/a&gt;?&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Background&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/q/120487/58563&quot;&gt;sequel to my previous challenge&lt;/a&gt;, but this time with a slightly more interesting practical application (the factorization of the input).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It is based on &lt;em&gt;1)&lt;/em&gt; the fact that any odd integer &lt;em&gt;&lt;strong&gt;n&lt;/strong&gt;&lt;/em&gt; can be expressed as the difference of two squares &lt;em&gt;&lt;strong&gt;a² - b²&lt;/strong&gt;&lt;/em&gt; and &lt;em&gt;2)&lt;/em&gt; the well known formula:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/3fHFG.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/3fHFG.png&quot; alt=&quot;formula&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;The task&lt;/h3&gt;&#xA;&lt;p&gt;You're given a positive odd integer &lt;em&gt;&lt;strong&gt;n&lt;/strong&gt;&lt;/em&gt;. Your task is to determine how many iterations of the following algorithm need to be processed to reach &lt;em&gt;&lt;strong&gt;n&lt;/strong&gt;&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Initialization: find the highest integer &lt;em&gt;&lt;strong&gt;k&lt;/strong&gt;&lt;/em&gt; such that &lt;em&gt;&lt;strong&gt;k² ≤ n&lt;/strong&gt;&lt;/em&gt;. Build the list &lt;em&gt;&lt;strong&gt;L = [ 1, 3, 5, ..., 2k-1 ]&lt;/strong&gt;&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Iteration:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Step #1: If the sum of the terms of &lt;em&gt;&lt;strong&gt;L&lt;/strong&gt;&lt;/em&gt; equals &lt;em&gt;&lt;strong&gt;n&lt;/strong&gt;&lt;/em&gt;, stop here.&lt;/li&gt;&#xA;&lt;li&gt;Step #2: Increment &lt;em&gt;&lt;strong&gt;k&lt;/strong&gt;&lt;/em&gt; and append &lt;em&gt;&lt;strong&gt;2k-1&lt;/strong&gt;&lt;/em&gt; to &lt;em&gt;&lt;strong&gt;L&lt;/strong&gt;&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Step #3: While the sum of the terms of &lt;em&gt;&lt;strong&gt;L&lt;/strong&gt;&lt;/em&gt; is greater than &lt;em&gt;&lt;strong&gt;n&lt;/strong&gt;&lt;/em&gt;, remove the first term from the list. Go on with step #1.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;All iterations (either full or partial) must be counted. In other words, you must return the number of times step #1 was executed.&lt;/p&gt;&#xA;&lt;h3&gt;Example #1&lt;/h3&gt;&#xA;&lt;p&gt;This is a trivial example for the perfect square &lt;em&gt;&lt;strong&gt;n = 9&lt;/strong&gt;&lt;/em&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Initialization: &lt;em&gt;&lt;strong&gt;k = 3&lt;/strong&gt;&lt;/em&gt; because &lt;em&gt;&lt;strong&gt;3² ≤ 9 &amp;lt; 4²&lt;/strong&gt;&lt;/em&gt;, which leads to &lt;em&gt;&lt;strong&gt;L = [ 1, 3, 5 ]&lt;/strong&gt;&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Step #1: &lt;em&gt;&lt;strong&gt;1 + 3 + 5 = 9&lt;/strong&gt;&lt;/em&gt;. We're done.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;We went through one iteration. So the expected result is &lt;em&gt;&lt;strong&gt;1&lt;/strong&gt;&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Example #2&lt;/h3&gt;&#xA;&lt;p&gt;Here is what we get for &lt;em&gt;&lt;strong&gt;n = 21&lt;/strong&gt;&lt;/em&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Initialization: &lt;em&gt;&lt;strong&gt;k = 4&lt;/strong&gt;&lt;/em&gt; because &lt;em&gt;&lt;strong&gt;4² ≤ 21 &amp;lt; 5²&lt;/strong&gt;&lt;/em&gt;, which leads to &lt;em&gt;&lt;strong&gt;L = [ 1, 3, 5, 7 ]&lt;/strong&gt;&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Step #1: &lt;em&gt;&lt;strong&gt;1 + 3 + 5 + 7 = 16&lt;/strong&gt;&lt;/em&gt;, which does not equal &lt;em&gt;&lt;strong&gt;n&lt;/strong&gt;&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Step #2: We increment &lt;em&gt;&lt;strong&gt;k&lt;/strong&gt;&lt;/em&gt; and we add &lt;em&gt;&lt;strong&gt;2k + 1 = 2 x 5 - 1 = 9&lt;/strong&gt;&lt;/em&gt; to the list: &lt;em&gt;&lt;strong&gt;L = [ 1, 3, 5, 7, 9 ]&lt;/strong&gt;&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Step #3: We remove the first term from the list: &lt;em&gt;&lt;strong&gt;L = [ 3, 5, 7, 9 ]&lt;/strong&gt;&lt;/em&gt;. The sum of the terms is now &lt;em&gt;&lt;strong&gt;24&lt;/strong&gt;&lt;/em&gt;, which is still greater than &lt;em&gt;&lt;strong&gt;n&lt;/strong&gt;&lt;/em&gt;. So we remove another term: &lt;em&gt;&lt;strong&gt;L = [ 5, 7, 9 ]&lt;/strong&gt;&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Step #1 : &lt;em&gt;&lt;strong&gt;5 + 7 + 9 = 21&lt;/strong&gt;&lt;/em&gt;. We're done.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;We went through two iterations. So the expected result is &lt;em&gt;&lt;strong&gt;2&lt;/strong&gt;&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Example #3&lt;/h3&gt;&#xA;&lt;p&gt;Below is a summary of all steps for a slightly more complex example with &lt;em&gt;&lt;strong&gt;n = 145&lt;/strong&gt;&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Initialization: &lt;em&gt;&lt;strong&gt;k = 12&lt;/strong&gt;&lt;/em&gt; because &lt;em&gt;&lt;strong&gt;12² ≤ 145 &amp;lt; 13²&lt;/strong&gt;&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Iteration | Step | k  | L                                 | Sum&#xA;----------+------+----+-----------------------------------+----&#xA;    1     |  1   | 12 | 1,3,5,7,9,11,13,15,17,19,21,23    | 144&#xA;          |  2   | 13 | 1,3,5,7,9,11,13,15,17,19,21,23,25 | 169&#xA;          |  3   | 13 | 11,13,15,17,19,21,23,25           | 144&#xA;----------+------+----+-----------------------------------+----&#xA;    2     |  1   | 13 | 11,13,15,17,19,21,23,25           | 144&#xA;          |  2   | 14 | 11,13,15,17,19,21,23,25,27        | 171&#xA;          |  3   | 14 | 17,19,21,23,25,27                 | 132&#xA;----------+------+----+-----------------------------------+----&#xA;    3     |  1   | 14 | 17,19,21,23,25,27                 | 132&#xA;          |  2   | 15 | 17,19,21,23,25,27,29              | 161&#xA;          |  3   | 15 | 19,21,23,25,27,29                 | 144&#xA;----------+------+----+-----------------------------------+----&#xA;    4     |  1   | 15 | 19,21,23,25,27,29                 | 144&#xA;          |  2   | 16 | 19,21,23,25,27,29,31              | 175&#xA;          |  3   | 16 | 23,25,27,29,31                    | 135&#xA;----------+------+----+-----------------------------------+----&#xA;    5     |  1   | 16 | 23,25,27,29,31                    | 135&#xA;          |  2   | 17 | 23,25,27,29,31,33                 | 168&#xA;          |  3   | 17 | 25,27,29,31,33                    | 145&#xA;----------+------+----+-----------------------------------+----&#xA;    6     |  1   | 17 | 25,27,29,31,33                    | 145&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We went through 6 iterations. So the expected result is &lt;em&gt;&lt;strong&gt;6&lt;/strong&gt;&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Factorization of the input&lt;/h3&gt;&#xA;&lt;p&gt;This paragraph is for illustration purposes only. It describes how the factorization of the input can be deduced from the result of the algorithm.&lt;/p&gt;&#xA;&lt;p&gt;Factorization of &lt;em&gt;&lt;strong&gt;21&lt;/strong&gt;&lt;/em&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;21 = 5 + 7 + 9 = (1 + 3 + 5 + 7 + 9) - (1 + 3)&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;21 = 5² - 2²&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;21 = (5 + 2)(5 - 2)&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;21 = 7 x 3&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Rules and clarifications&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input is guaranteed to be a positive odd integer. It may be either a composite integer or a prime.&lt;/li&gt;&#xA;&lt;li&gt;You're required to process any odd &lt;em&gt;&lt;strong&gt;n&lt;/strong&gt;&lt;/em&gt; in &lt;em&gt;&lt;strong&gt;[ 1, ..., 65535 ]&lt;/strong&gt;&lt;/em&gt; in less than one minute on mid-range hardware.&lt;/li&gt;&#xA;&lt;li&gt;Given enough time, your program/function should theoretically work for any value of &lt;em&gt;&lt;strong&gt;n&lt;/strong&gt;&lt;/em&gt; that is natively supported by your language. If it doesn't, please explain why in your answer.&lt;/li&gt;&#xA;&lt;li&gt;You may use any other method instead of the described one as long as it returns the correct result.&lt;/li&gt;&#xA;&lt;li&gt;This is code golf, so the shortest answer in bytes wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;p&gt;&lt;em&gt;To be completed&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="58563" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-26T07:07:47.017" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12575" PostTypeId="1" CreationDate="2017-05-25T17:19:01.170" Score="35" ViewCount="1011" Body="&lt;h3&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12897/ppcg-specific-mobile-app-feature-requests&quot;&gt;See a list of feature requests here (On hold)&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Basically, I was wondering if anyone could develop a mobile app which would serve as a browser for PPCG. Maybe something along the lines of the pre-existing SE for mobile app. However, this would be specific to PPCG with special features as found in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7897/graduation-design-ideas/7955#7955&quot;&gt;the graduation design userscript&lt;/a&gt; (sort by byte count, automatic TIO links, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8474/introducing-the-ppcg-sandbox-viewer&quot;&gt;sandbox viewer&lt;/a&gt;, etc.).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note:&lt;/em&gt; Something to keep in mind is that, on current SE for mobile app, the sandbox is basically unusable due to huge number of answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As I have absolutely no Android/iOS programming experience, so if someone is willing to take the time to develop this, I'd love to use it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Bounty&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As a reward for your hard effort, I will be willing to award a minimum of &lt;strong&gt;&lt;em&gt;1300&lt;/em&gt; rep bounty&lt;/strong&gt; to the best app (if multiple apps are posted). If an Android app and an iOS app is added, I will award two bounties. Since this is PPCG, let's make this a competition :D&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/60951/tuskiomi&quot;&gt;&lt;strong&gt;Tuskiomi&lt;/strong&gt;&lt;/a&gt; is willing to offer half their rep (at the time when the app is released) as a bounty to be awarded to the best app.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="30525" LastEditDate="2017-12-21T13:51:36.340" LastActivityDate="2017-12-21T13:51:36.340" Title="PPCG-specific Mobile App" Tags="|discussion|" AnswerCount="2" CommentCount="30" ContentLicense="CC BY-SA 3.0" />
  <row Id="12577" PostTypeId="2" ParentId="2140" CreationDate="2017-05-25T19:48:28.873" Score="1" Body="&lt;h1&gt;Odd with Odds, Even with Evens&lt;/h1&gt;&#xA;&lt;p&gt;Given an input integer &lt;code&gt;n&lt;/code&gt;, express it as a sum of numbers with the following properties:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;code&gt;n&lt;/code&gt; is even, the numbers used to sum should be even.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;n&lt;/code&gt; is odd, the integers used to sum should be odd.&lt;/li&gt;&#xA;&lt;li&gt;Any integer used (&lt;code&gt;x&lt;/code&gt;) should be &lt;code&gt;0 &amp;lt; x &amp;lt;= ceiling(n/2)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;All numbers used in the summation should be unique.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If there are no set of distinct odd/even integers that sum to &lt;code&gt;n&lt;/code&gt;, return -1.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Output may be as an array or delimited string.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input | Output       | Comments&#xA;------+--------------+-------------------------------------------&#xA;2     | -1           | 0 &amp;lt; ? &amp;lt;= 1 = [1] (No evens, not possible)&#xA;12    | [6,4,2]      | Order is arbitrary, [2,6,4] is fine.&#xA;24    | [8,4,12]     | [2,4,6,12] works too.&#xA;9     | [1,3,5]      | Odd cases are a bit trickier to think about.&#xA;      |              | ceiling(9/2) = ceiling(4.5) -&amp;gt; 1 &amp;lt; x &amp;lt;= 5 -&amp;gt; [1,3,5]       &#xA;1     | -1           | c(1/2) = c(.5) -&amp;gt; 1 &amp;lt; x &amp;lt; 1 -&amp;gt; []&#xA;13    | [1,5,7]      | c(13/2) = c(6.5) -&amp;gt; 1 &amp;lt; x &amp;lt;= 7 -&amp;gt; [1,3,5,7]&#xA;27    | [13,11,3]    | Etc...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The numbers you use for each answer and how you get to the numbers you used do not matter, the only thing that matters is that they adhere to the spec. The order of the numbers does not matter, and you may have different results than provided.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, first person to mail Bill the contents of Hillary Clinton's private mailserver wins.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-01T16:43:10.400" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12581" PostTypeId="2" ParentId="5243" CreationDate="2017-05-25T23:53:42.927" Score="6" Body="&lt;h1&gt;150 rep for a shorter C quine&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Currently, the &lt;a href=&quot;https://codegolf.stackexchange.com/a/122856&quot;&gt;shortest known C quine&lt;/a&gt; (written by me) is &lt;s&gt;64&lt;/s&gt; 60 bytes. I will give 150 rep to anyone who tops this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Must be a full program (include the &lt;code&gt;main&lt;/code&gt; function, or otherwise define main)&lt;/li&gt;&#xA;&lt;li&gt;Cannot use the filename to store data&lt;/li&gt;&#xA;&lt;li&gt;Cannot pull data from the internet&lt;/li&gt;&#xA;&lt;li&gt;Cannot read its source nor its executable (&lt;a href=&quot;https://codegolf.stackexchange.com/a/122136/61563&quot;&gt;thanks, Dennis&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Must be more than 1 byte (bytecount includes flags)&lt;/li&gt;&#xA;&lt;li&gt;Must be system-independent (you may assume POSIX and ASCII)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="61563" LastEditorUserId="61563" LastEditDate="2018-01-21T19:36:27.957" LastActivityDate="2018-01-21T19:36:27.957" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="12584" PostTypeId="2" ParentId="2140" CreationDate="2017-05-26T03:02:35.777" Score="0" Body="&lt;h2&gt;Identify the variable case&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a function which determines which casing convention a provided variable name belongs to:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;camelCase&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;kebab-case&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Train-Case&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;snake_case&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;SCREAMING_SNAKE_CASE&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;PascalCase&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Ada_Case&lt;/code&gt; (not a real term, but apparently the standard casing used in Ada)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your function should return one of the above strings, either exactly as above, or as spaced title-case: &quot;Train case&quot;, &quot;Screaming snake case&quot;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Casings that include &lt;code&gt;-&lt;/code&gt; or &lt;code&gt;_&lt;/code&gt; may include leading or trailing &lt;code&gt;-&lt;/code&gt;s or &lt;code&gt;_&lt;/code&gt;s (eg, &lt;code&gt;__MY_SNAKE__&lt;/code&gt; or &lt;code&gt;-webkit-kebab&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Multiple consecutive upper case letters are allowed in mixed casings, as long as they follow a lower case letter (&lt;code&gt;MyXMLDocument&lt;/code&gt;, &lt;code&gt;This-CSS-Crap&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Where an input fits multiple schemes (eg, &lt;code&gt;F&lt;/code&gt; or &lt;code&gt;foo&lt;/code&gt;), you may return any valid classification.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If an input does not fit one of the above schemes (eg &lt;code&gt;stu-pid_case&lt;/code&gt;), you must return something different. You may also throw an error.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input string is guaranteed to be at least one character, and begin with a character matching &lt;code&gt;/[a-zA-Z_-]/&lt;/code&gt;. Every other character will match &lt;code&gt;/[a-zA-Z0-9$-]/&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest length in bytes wins. Standard loopholes forbidden. Standard input and output methods.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;myFunkyVariable =&amp;gt; camelCase&#xA;no-op =&amp;gt; kebab-case&#xA;TEST2 =&amp;gt; SCREAMING_SNAKE_CASE&#xA;__c =&amp;gt; snake_case&#xA;XML-Madness =&amp;gt; Error&#xA;Get_Input =&amp;gt; Ada_Case&#xA;i =&amp;gt; camelCase (or snake_case)&#xA;char2int_factory =&amp;gt; snake_case&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="30512" LastActivityDate="2017-05-26T03:02:35.777" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12586" PostTypeId="1" AcceptedAnswerId="12587" CreationDate="2017-05-26T06:12:49.323" Score="1" ViewCount="468" Body="&lt;p&gt;Is there a version of code golf that requires the most convoluted solution instead of the tersest?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it might be humorous (and informative) to see answers that exemplify the worst of some languages and architectures.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;largest code base wins&lt;/li&gt;&#xA;&lt;li&gt;scoring is the same as golf (byte count, omit scaffolding (e.g. &lt;code&gt;using&lt;/code&gt;s in c#))&lt;/li&gt;&#xA;&lt;li&gt;all code must pertain to the solution (no superfluous code)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If the code base is sufficiently large, it might be better to post a gist or otherwise link to the code.&lt;/p&gt;&#xA;" OwnerUserId="47278" LastActivityDate="2017-05-28T10:34:27.243" Title="Opposite of code golf" Tags="|discussion|" AnswerCount="3" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12587" PostTypeId="2" ParentId="12586" CreationDate="2017-05-26T06:38:00.783" Score="5" Body="&lt;p&gt;Yes. It's called &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-05-26T06:38:00.783" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12589" PostTypeId="2" ParentId="12586" CreationDate="2017-05-26T11:30:04.463" Score="8" Body="&lt;p&gt;Elaborating on Mego's answer a little, the tag you're looking for is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt;. However, there aren't that many questions with that tag, because:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The challenge quickly spirals out of control with astronomical byte counts&lt;/li&gt;&#xA;&lt;li&gt;It takes a lot of effort to enforce challenges so that they don't follow 1&lt;/li&gt;&#xA;&lt;li&gt;Restraints can be somewhat ambiguous, so that ambiguity is taken out of context, which therefore turns the challenge into 1&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;It's a lot of effort, but if you can pull something like that off, then you've definitely got a good challenge!&lt;/p&gt;&#xA;" OwnerUserId="49561" LastActivityDate="2017-05-26T11:30:04.463" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12590" PostTypeId="2" ParentId="2140" CreationDate="2017-05-26T11:46:03.210" Score="0" Body="&lt;h1&gt;Dungeon of Botdom&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Bots will play a variant of this game:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://boardgamegeek.com/boardgame/150312/welcome-dungeon&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://boardgamegeek.com/boardgame/150312/welcome-dungeon&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Our version will be played by one bot versus another bot, and there will only be one character, which may or may not be in the actual game, and it will be repeated a bunch.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Essentially, there is a deck of cards, with enemies on each card. players take turns either passing, or drawing a card and either a) placing it in the initially empty dungeon or b) removing a piece of gear and discarding the enemy. enemies have different hit points, which affects the damage done to a bot traversing the dungeon. When everyone but one player has passed, they enter the dungeon. when a bot is traversing the dungeon, they will encounter the enemies placed in the dungeon in LIFO order (the card on top is taken first) (if I take out some items this may be irrelevant). enemies are instantly defeated if the player has a corresponding item, otherwise the player takes damage equal to the enemies number. if a player makes it through the dungeon, they get one point. get two points to win the match. if they fall while traversing the dungeon, they lose one chance. fail twice, and the opponent wins the match.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What this means, is that you might want to do one of two things: make the dungeon too dangerous to survive without your opponent thinking it is, and passing, or making the opponent bot believe the dungeon is too dangerous, when it is not, and running through the dungeon and succeeding.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We'll have a good ol' round robin of a 1000 rounds each or some such. the nice thing about this game is that the rounds are short, because once you finish the deck, a player automatically enters the dungeon.&lt;/p&gt;&#xA;" OwnerUserId="55896" LastActivityDate="2017-05-26T11:46:03.210" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12591" PostTypeId="2" ParentId="12498" CreationDate="2017-05-26T12:55:46.503" Score="7" Body="&lt;h1&gt;Nondeterministic solutions are acceptable, providing they are correct with probability 1, under the assumption that their PRNG actually works. No finite time bound is needed.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Solutions to problems never need to be deterministic, but authors should be able to provide some argument to show that their solution gives their claimed answer almost-surely, assuming that any pseudo-random effects are seeded correctly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Suppose a challenge involved sorting a list of ints. Consider the following two ruby-ish snippets:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def valid_solution(x)&#xA;  loop do&#xA;    x.shuffle!&#xA;    return x if x.sorted?&#xA;  end&#xA;end&#xA;&#xA;def invalid_solution(x)&#xA;  loop{nil}&#xA;end&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The first is a bogosort, the second loops forever. Clearly the second does not fulfil the terms of the challenge. We could argue that there's a vanishingly small possibility that the two programs are equivalent, since a broken PRNG would make the first loop forever, but the probability of the first snippet eventually returning a sorted list is precisely 1, therefore the first snippet is an acceptable solution.&lt;/p&gt;&#xA;" OwnerUserId="9524" LastEditorUserId="9524" LastEditDate="2017-05-31T08:45:14.910" LastActivityDate="2017-05-31T08:45:14.910" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12594" PostTypeId="2" ParentId="2140" CreationDate="2017-05-26T18:09:50.153" Score="2" Body="&lt;h1&gt;Range without Range Builtin&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given an integer &lt;code&gt;y&lt;/code&gt; where &lt;code&gt;y &amp;gt; 0&lt;/code&gt;, output a list of in some reasonable format that contains every integer in increasing order up to but not including &lt;code&gt;y&lt;/code&gt;, without using any builtin that generates a range of any sort. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your language has a feature whose specification uses a range, that is not allowed (for example, you cannot use the map quick in Jelly on a single integer because that maps over the range). You can assume that &lt;code&gt;y&lt;/code&gt; will not exceed your program's capacity for integers, but it must be able to theoretically work on any integer given no memory, time, or otherwise language constraints.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A format is reasonable for a list &lt;code&gt;a = [a0, a1, ..., an]&lt;/code&gt; if and only if there exists a string &lt;code&gt;x&lt;/code&gt;, a string &lt;code&gt;y&lt;/code&gt;, and a non-empty string &lt;code&gt;z&lt;/code&gt; such that the output is &lt;code&gt;x + z.join(a) + y&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user42649" LastEditorDisplayName="user42649" LastEditDate="2017-06-07T22:09:46.723" LastActivityDate="2017-06-07T22:09:46.723" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="12599" PostTypeId="1" CreationDate="2017-05-26T22:36:03.380" Score="50" ViewCount="1351" Body="&lt;p&gt;Warning: this post will contain things that people don't want to hear. But it needs to happen.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Now that that's out of the way, let's get down to business.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/66833&quot;&gt;Sandbox&lt;/a&gt; was a brilliant idea. It allowed people to see what others thought of their challenges before actually posting them. It was a great place to redirect new users to in order to improve their challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But not anymore.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't have access to any site stats but it's obvious without them. The Sandbox is dying.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Based off of my experience, the only person who regularly reviews challenges there is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/194/peter-taylor&quot;&gt;Peter Taylor&lt;/a&gt;, for which I would like to thank him. Everyone else pops in to either post a new proposal and then reads one other or just skim over challenges to check for any mistakes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've been meaning to make this post for a while now but my &lt;a href=&quot;https://codegolf.stackexchange.com/q/122964/66833&quot;&gt;latest challenge&lt;/a&gt; pushed me over the edge, in particular these &lt;a href=&quot;https://codegolf.stackexchange.com/questions/122964/what-color-is-this#comment301609_122964&quot;&gt;two&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/122964/what-color-is-this#comment301786_122964&quot;&gt;comments&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;&amp;lt;begin_anecdote&amp;gt;&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I had sandboxed this challenge on the 19th of May, 1 week ago today and it had 2 upvotes and no unresolved issues for a week. By the Sandbox's own definition, it was ready for posting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I decide to post it, edit the Sandbox post and went to sleep, confident that all issues had been filtered out and corrected. Imagine my surprise when I wake up and find 20+ items in my inbox asking for clarification!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Two of them were even asking me to post this in the Sandbox! When I read these comments, I wanted to reach inside of my computer, crumple the Sandbox into a piece of paper and throw it in the bin. I even wrote (but didn't post) a comment that was all £&amp;amp;@%^*+ symbols, I was that annoyed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;&amp;lt;end_anecdote&amp;gt;&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This has to stop. Something needs to be done about the Sandbox. And I'm going to be honest with you here, I have no idea how to fix it. This post isn't to tell you how to fix it or what needs to be done to fix it. This is to tell you that it needs to be fixed. And why can't I tell you how? Because it is so broken that I can't think of even &lt;em&gt;beginning&lt;/em&gt; to correct it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But maybe you do. Please, answer this question with your ideas for what we could do about the Sandbox. Whatever it is, it is better than the current system.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, as ever, there will be people who disagree with me, who say that the Sandbox is working. If you are one of these people, think about this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A good challenge is posted to the Sandbox and quickly receives 3 upvotes.&lt;/li&gt;&#xA;&lt;li&gt;While reading through it, you  prove a couple of mistakes/contradictions and  notify the OP.&lt;/li&gt;&#xA;&lt;li&gt;They correct the mistake and, in your eyes, looks good for posting. They give it a week or two to gain attention but nothing changes&lt;/li&gt;&#xA;&lt;li&gt;They then think that it is ready for posting and post it.&lt;/li&gt;&#xA;&lt;li&gt;Immediately, someone downvotes and asks for a clarification. Soon after, you post an answer that you've been working on since you saw it in the Sandbox.&lt;/li&gt;&#xA;&lt;li&gt;The OP updates the question and invalidates your answer. But by this time, you've moved on to other questions and have forgotten about it. You gather downvotes as your answer doesn't work.&lt;/li&gt;&#xA;&lt;li&gt;All this, simply because no-one else spotted a simple ambiguity while in the Sandbox phase, giving both you and the OP the negative feeling you get when someone downvotes your post.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Has this ever happened to you? It probably has and we can stop it. Why stand around, letting this happen again and again, when we can simply resolve this issue?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I say it again, the Sandbox is dying. And we need to save it. But how?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2024-01-07T14:53:58.630" Title="We need to talk about the Sandbox" Tags="|discussion|sandbox|" AnswerCount="10" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="12601" PostTypeId="2" ParentId="2140" CreationDate="2017-05-26T23:05:09.687" Score="1" Body="&lt;h1&gt;Show key code&lt;/h1&gt;&#xA;&lt;p&gt;Inspired by the &lt;a href=&quot;http://www.tutorialspoint.com/unix_commands/showkey.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;showkey&lt;/a&gt; command.&lt;/p&gt;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&lt;p&gt;You have to output the key and if is a key-up or a key-down event. I exemplify:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ihi5s.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ihi5s.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The output I want:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Key X Down&#xA;Key X Up&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;for both the instants you press or release a key.&lt;/p&gt;&#xA;&lt;p&gt;You can output it on a console or on a GUI.&lt;/p&gt;&#xA;&lt;p&gt;It is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shorter code wins.&lt;/p&gt;&#xA;" OwnerUserId="29325" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-26T23:05:09.687" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12602" PostTypeId="2" ParentId="2140" CreationDate="2017-05-26T23:55:52.993" Score="1" Body="&lt;h1&gt;Time bomb ping pong&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Challenge - Both teams&lt;/h2&gt;&#xA;&lt;p&gt;All users are divided into two teams based on &lt;strong&gt;their PPCG ID&lt;/strong&gt;. For example, my ID can be found &lt;a href=&quot;https://codegolf.stackexchange.com/users/34388/adnan&quot;&gt;here&lt;/a&gt;, from which you can see that my ID is 34388. To check on which team you are, run the following snippet:&lt;/p&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;function update_team(){var e=document.getElementById(&quot;user-id&quot;).value,t=(document.getElementById(&quot;team-result&quot;),&quot;&quot;);t=e.match(/^\d+$/)||0===e.length?-1!==even_top_50.indexOf(parseInt(e))?&quot;You are in team: ALPHA&quot;:-1!==odd_top_50.indexOf(parseInt(e))?&quot;You are in team: BETA&quot;:0==e.length?&quot;&quot;:&quot;You are in team: &quot;+(parseInt(e)%2==0?&quot;ALPHA&quot;:&quot;BETA&quot;):&quot;ID must be numeric&quot;,document.getElementById(&quot;team-result&quot;).innerHTML=t}var even_top_50=[12012,20260,17602,11259,26997,194,31716,20080,58563,47066,1426,4098,30688,56656,41723,3967,1490,31516,40695,29577,43319,15599,32686,3191,4020,67,34718,41024,7311,39328,16766,7110,31625,2867,59107,52210,16120,6710,68942,10740,9365,84,1147,15,199,7162,1308,3103,26600,59487],odd_top_50=[8478,36398,21487,3808,42545,3852,53748,48934,34388,21348,4162,34531,25180,31414,24877,31957,20469,31343,7416,45941,32014,39242,42963,11006,6828,9498,9288,14215,4198,3544,30164,33208,4372,95,41805,56178,668,47120,30525,55735,51507,57100,6699,737,39022,46855,51939,32700,59376,7209];&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-css lang-css prettyprint-override&quot;&gt;&lt;code&gt;.main-header,.main-input,.result{font-family:Montserrat,sans-serif;text-align:center}.main-header{font-size:24px}.main-input{display:block;margin:12px auto auto}.result{margin-top:24px}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;br&amp;gt;&amp;lt;div&amp;gt;&amp;lt;div class=&quot;main-header&quot;&amp;gt; Enter your PPCG ID &amp;lt;/div&amp;gt;&amp;lt;input class=&quot;main-input&quot; maxlength=&quot;6&quot; onkeyup=&quot;update_team()&quot; id=&quot;user-id&quot;&amp;gt; &amp;lt;div class=&quot;result&quot; id=&quot;team-result&quot;&amp;gt; &amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&lt;p&gt;Each user has two options:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Start a new bomb&lt;/li&gt;&#xA;&lt;li&gt;Perform a counterattack&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;These actions are discussed here:&lt;/p&gt;&#xA;&lt;br&gt;&#xA;&lt;h3&gt;Start a new bomb&lt;/h3&gt;&#xA;&lt;p&gt;To set up a new bomb, you need to do the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Create a &lt;strong&gt;full&lt;/strong&gt; program in any &lt;em&gt;free&lt;/em&gt; language which has the output &lt;strong&gt;X&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Create a custom list of characters with a maximum of &lt;strong&gt;10 characters&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Select &lt;em&gt;one or more characters&lt;/em&gt; from the character list and insert them into your program, which will be having the exact same output &lt;strong&gt;X&lt;/strong&gt;. This ensures that there is at least one crack for your submission.&lt;/li&gt;&#xA;&lt;li&gt;Only reveal the &lt;strong&gt;full original program&lt;/strong&gt; and the &lt;strong&gt;character list&lt;/strong&gt;. Keep the modified program &lt;em&gt;secret&lt;/em&gt;. Also keep track of the iteration index, which in this case is &lt;strong&gt;1&lt;/strong&gt; (since it's the start of a new bomb).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is an example of a new bomb submission:&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;Python 2, 9 bytes (index = 1)&lt;/h2&gt;&#xA;&lt;p&gt;Outputs the number &lt;strong&gt;30&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;print 5*6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;With as character set &lt;code&gt;13579/&lt;/code&gt;. &lt;a href=&quot;https://tio.run/nexus/python2#@19QlJlXomCqZfb/PwA&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;br&gt;&#xA;&lt;h3&gt;Perform a counterattack&lt;/h3&gt;&#xA;&lt;p&gt;To perform a counterattack, you need to do the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Create a new &lt;strong&gt;full&lt;/strong&gt; program with at least one character inserted from the list given by the opponent, which will have the exact same output &lt;strong&gt;X&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Create a custom list of characters with a maximum of &lt;strong&gt;10 characters&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Select &lt;em&gt;one or more characters&lt;/em&gt; from the character list and insert them into your program, which will be having the exact same output &lt;strong&gt;X&lt;/strong&gt;. This ensures that there is at least one crack for your submission.&lt;/li&gt;&#xA;&lt;li&gt;Only reveal the &lt;strong&gt;full original program&lt;/strong&gt; and the &lt;strong&gt;character list&lt;/strong&gt;. Keep the modified program &lt;em&gt;secret&lt;/em&gt;. Also keep track of the iteration index, which in this case is the increment of the previous index.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is an example of a counterattack (using the previous submission):&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;Python 2, 12 bytes (index = 2)&lt;/h2&gt;&#xA;&lt;p&gt;Defuses &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12602/34388&quot;&gt;Python 2, 9 bytes, Adnan&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Inserts &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;/&lt;/code&gt; and &lt;code&gt;3&lt;/code&gt;. Outputs &lt;strong&gt;30&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;print 15*6/3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;With as character set: &lt;code&gt;+-~58&lt;/code&gt;. &lt;a href=&quot;https://tio.run/nexus/python2#@19QlJlXomBoqmWmb/z/PwA&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;br&gt;&#xA;&lt;h2&gt;Scoring system&lt;/h2&gt;&#xA;&lt;p&gt;Every bomb that has not been defused for &lt;strong&gt;7 days&lt;/strong&gt; gives the team 'index' points. If the index was 4, your team gets 4 points. You are only able to collect the points &lt;em&gt;after&lt;/em&gt; you have revealed your own solution. Note that if you do not reveal your solution after the 7 days, it is still vulnerable to cracks.&lt;/p&gt;&#xA;&lt;p&gt;As for the individual winner of the team, the person with the most cracks of the winning team gets the check mark.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h3&gt;Sandbox notes&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Note that this is more of an experimental challenge. Unlike the conventional &lt;strong&gt;1 vs 1&lt;/strong&gt; cops-and-robbers challenges, this is an attempt on an &lt;strong&gt;n vs n&lt;/strong&gt;-challenge, so I have no idea whether this is a good idea or not.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;s&gt;The scoring system is a bit tricky, but I think that when a bomb has 'exploded', the opponent's team gets &lt;strong&gt;(index)&lt;/strong&gt; points. The team with the most points at the end wins. The problem here is that the byte count might make things worse, since a larger program would make cracking the submission harder.&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A problem I'm finding here is the fact that the cop can create an arbitrarily large program, which makes it almost impossible to crack. I'm not sure whether this actually is a problem, since the 'exact same output'-rule should theoretically take care of this.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Perhaps add a third option for the user, where the user &lt;strong&gt;defuses a bomb&lt;/strong&gt;. This would consist of cracking the submission, but does not create a counterattack (for cases when this is impossible, or trivial (like adding comments)).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I'm also not entirely sure about the 'choose your own output'-idea. Would this leave too much options for abusement?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is the maximum of 10 character too much / too little? Should this also be taken in account with the scoring?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Thanks in advance!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="34388" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-21T14:46:27.850" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="12604" PostTypeId="1" CreationDate="2017-05-27T00:53:46.573" Score="0" ViewCount="72" Body="&lt;p&gt;I started a bounty on &lt;a href=&quot;https://codegolf.stackexchange.com/q/121056/61563&quot;&gt;this&lt;/a&gt; question because I didn't think it could  get beaten. The next day it was &lt;a href=&quot;https://codegolf.stackexchange.com/a/122136/61563&quot;&gt;beaten by Dennis&lt;/a&gt;. I was sure this would win, but then it was &lt;a href=&quot;https://codegolf.stackexchange.com/a/122681/61563&quot;&gt;beaten again&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I am a bit hesitant to award the bounty on either answer. &lt;a href=&quot;https://codegolf.stackexchange.com/a/122136/61563&quot;&gt;Dennis' answer&lt;/a&gt; relies on GCC, UTF-8 compatibility, the interpreter &lt;code&gt;/lib64/ld-linux-x86-64.so.2&lt;/code&gt; and Unix.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then again, &lt;a href=&quot;https://codegolf.stackexchange.com/a/122681/61563&quot;&gt;Anders' answer&lt;/a&gt; relies on default filenames (which qualifies as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1072/61563&quot;&gt;&lt;em&gt;using the filename to store data&lt;/em&gt;&lt;/a&gt;) and non-standard &lt;code&gt;&amp;lt;err.h&amp;gt;&lt;/code&gt;.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, neither answer is a full program. I was under the impression that the general concensus for quines was that they should be full programs. In this particular challenge, the output is based off the length of the source code.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anders' provided source code was &lt;code&gt;f(){warn(0);}&lt;/code&gt;, with the output being the same length. But this is clearly not a full program - &lt;code&gt;main(){f();}&lt;/code&gt; is required, adding 12 bytes and therefore invalidating the output. Dennis' does the same thing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Are either suitable for the bounty, or even valid quines?&lt;/p&gt;&#xA;" OwnerUserId="61563" LastActivityDate="2017-05-27T02:47:52.083" Title="Which answer should I give my bounty to?" Tags="|discussion|support|code-challenge|quine|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12605" PostTypeId="2" ParentId="2140" CreationDate="2017-05-27T01:16:59.543" Score="-1" Body="&lt;h1&gt;Bike saddle drawn through a fractal&lt;/h1&gt;&#xA;&lt;p&gt;Based on the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/23423/mandelbrot-image-in-every-language&quot;&gt;Mandelbrot image in every language&lt;/a&gt;, and on the observation the 3rd layer (0 indexed) always looks like a bike saddle, I had a little bit different challenge:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Language must be capable of graphical output or drawing charts (saving files disallowed)&lt;/li&gt;&#xA;&lt;li&gt;Render a window or control that is resizable by mouse action. As example, it can be a typical GUI Window with the typical frame that allows resizing&lt;/li&gt;&#xA;&lt;li&gt;After resizing the GUI element, the fractal should be updated according to the new pixel space&lt;/li&gt;&#xA;&lt;li&gt;The fractal coordinates range from approximately -2-2i to 2+2i&lt;/li&gt;&#xA;&lt;li&gt;The pixels outside of the 3rd layer (0 indexed) of Mandelbrot set should have one color; the ones inside 3rd and inner layers should have another. The only two colors used should be clearly distinguishable&lt;/li&gt;&#xA;&lt;li&gt;At least 99 iterations&lt;/li&gt;&#xA;&lt;li&gt;ASCII art not allowed&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Winning conditions:&lt;/strong&gt;&lt;br /&gt;&#xA;Shortest version (size in bytes) for each language will get a mention in this post, ordered by size.&lt;br /&gt;&#xA;No answer will ever be 'accepted' with the button.&lt;/p&gt;&#xA;" OwnerUserId="29325" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-27T01:16:59.543" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12606" PostTypeId="2" ParentId="12604" CreationDate="2017-05-27T01:18:31.880" Score="3" Body="&lt;p&gt;Well, to start with, the question says &quot;program or function&quot;, so function submissions are clearly valid answers to the question asked.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Beyond this, it rather depends on what &quot;in C&quot; means. When golfing in C, relying on implementation-specific (/ unspecified / undefined) behaviour is nearly always going to save bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think the &lt;code&gt;a.out&lt;/code&gt;-based answer is the least controversial one here. Note that the &lt;em&gt;output&lt;/em&gt; filename is a property of the compiler, and on UNIX &lt;code&gt;cc&lt;/code&gt;, isn't a function of the input filename; it's always &lt;code&gt;a.out&lt;/code&gt;. Most Linux/UNIX C compilers emulate UNIX &lt;code&gt;cc&lt;/code&gt; in this regard, meaning that an assumption that the output filename is &lt;code&gt;a.out&lt;/code&gt; is highly portable. Also, &lt;code&gt;&amp;lt;err.h&amp;gt;&lt;/code&gt; isn't required for it to work (you're confusing header files and libraries); what's actually required is a library containing the &lt;code&gt;warn&lt;/code&gt; function (which my manual lists as a &quot;nonstandard BSD extension&quot; which is, in addition to being present in BSD, also present in GNU). So the answer has a high chance of working on most typical consumer BSD-based or Linux-based systems.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The answer using a multicharacter constant is longer, and also highly nonportable, as it will only work on Linux, and then only when using a particular CPU architecture.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that with bounties, though, the bounty-giver has quite some discretion to choose who to give the bounty to; it's their reputation, after all. (Also, you probably shouldn't start a time-limited bounty for a task that you suspect is impossible, because otherwise the rep will end up  out an answer that doesn't fit your criteria when the time expires, as you can't just not award it. We have the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5243/list-of-bounties-with-no-deadline?rq=1&quot;&gt;indefinite bounties thread&lt;/a&gt; for a reason.)&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-05-27T01:18:31.880" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12607" PostTypeId="2" ParentId="2140" CreationDate="2017-05-27T01:51:28.327" Score="1" Body="&lt;h1&gt;Data Categorization with a Si(g)n&lt;/h1&gt;&#xA;&lt;h2&gt;Background:&lt;/h2&gt;&#xA;&lt;p&gt;Machine learning is a very powerful tool for categorizing data. It can help find a function that splits some already known data so that unknown values can be predicted. Typically, this function should be simple so that it does not &amp;quot;overfit&amp;quot; the data. As it turns out, &lt;a href=&quot;https://homes.cs.washington.edu/%7Epedrod/papers/cacm12.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;previous studies&lt;/a&gt; have found out that the simple function &lt;em&gt;f(x) = sgn(sin(ax))&lt;/em&gt; can split most data into two categories with only a single coefficient to adjust! This will definitely (not) prevent overfitting, and should (not) be used for every application of machine learning.&lt;/p&gt;&#xA;&lt;p&gt;sgn(x) is the sign function of x. As &lt;a href=&quot;https://en.wikipedia.org/wiki/Sign_function&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt; says,&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;         / -1 if x&amp;lt;0,&#xA;sgn(x) = |  0 if x=0,&#xA;         \  1 if x&amp;gt;0.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://tomrobertshaw.net/img/2015/12/overfitting.jpg&quot; alt=&quot;Data overfitting demonstration&quot; /&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Input:&lt;/h2&gt;&#xA;&lt;p&gt;Two ordered sets/arrays/lists of integers {&lt;em&gt;m&lt;sub&gt;1&lt;/sub&gt;&lt;/em&gt;, &lt;em&gt;m&lt;sub&gt;2&lt;/sub&gt;&lt;/em&gt;, &lt;em&gt;m&lt;sub&gt;3&lt;/sub&gt;&lt;/em&gt;, ...} and {&lt;em&gt;n&lt;sub&gt;1&lt;/sub&gt;&lt;/em&gt;, &lt;em&gt;n&lt;sub&gt;2&lt;/sub&gt;&lt;/em&gt;, &lt;em&gt;n&lt;sub&gt;3&lt;/sub&gt;&lt;/em&gt;, ...}.&lt;/p&gt;&#xA;&lt;p&gt;You can take input as 2 lines of input, an array with the two arrays &lt;em&gt;m&lt;/em&gt; and &lt;em&gt;n&lt;/em&gt; as its elements, or any other reasonable method of input.&lt;/p&gt;&#xA;&lt;h2&gt;Output:&lt;/h2&gt;&#xA;&lt;p&gt;A value of &lt;em&gt;a&lt;/em&gt; such that &lt;em&gt;sgn(sin(ax))&lt;/em&gt; equals 1 when x = &lt;em&gt;m&lt;sub&gt;1&lt;/sub&gt;&lt;/em&gt;, &lt;em&gt;m&lt;sub&gt;2&lt;/sub&gt;&lt;/em&gt;, &lt;em&gt;m&lt;sub&gt;3&lt;/sub&gt;&lt;/em&gt;, ..., and -1 when x = &lt;em&gt;n&lt;sub&gt;1&lt;/sub&gt;&lt;/em&gt;, &lt;em&gt;n&lt;sub&gt;2&lt;/sub&gt;&lt;/em&gt;, &lt;em&gt;n&lt;sub&gt;3&lt;/sub&gt;&lt;/em&gt;, ...&lt;/p&gt;&#xA;&lt;p&gt;If no such value of &lt;em&gt;a&lt;/em&gt; exists, you can output any non-numerical value.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Example inputs will be in the form [[m1, m2, m3, ...], [n1, n2, n3, ...]]&#xA;Input                  | Output&#xA;[[1, 5],    [2, 3]]    | 1.75&#xA;[[2, 3, 6], [5]        | 4.5&#xA;[[1, 3, 5], [2, 4, 6]] | 3.1415925&#xA;[[1, 6],    [2, 3]]    | Random junk&#xA;[[2, 3, 4], [1]]       | &amp;lt;Anything non-numerical&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="52152" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-01T11:53:38.540" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="12608" PostTypeId="2" ParentId="12604" CreationDate="2017-05-27T02:04:49.793" Score="6" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;However, I am a bit hesitant to award the bounty on either answer. &lt;a href=&quot;https://codegolf.stackexchange.com/a/122136/61563&quot;&gt;Dennis' answer&lt;/a&gt; relies on GCC, UTF-8 compatibility, the interpreter &lt;code&gt;/lib64/ld-linux-x86-64.so.2&lt;/code&gt; and Unix.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I think it's a bit strange that you hold our answers to higher standards than your own. Yes, my answer requires at the very least GCC, an x86_64 CPU/OS, and an interpreter with path &lt;code&gt;/lib64/ld-linux-x86-64.so.2&lt;/code&gt;. That sounds like a lot, but it means that it will work on pretty much every Linux machine you encounter in the wild. UTF-8 support is not required; my answer only uses ASCII characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Meanwhile, your &lt;code&gt;main(){puts('s');}&lt;/code&gt; answer actually produces &lt;strong&gt;zero&lt;/strong&gt; bytes of output. Yes, running the program in my terminal displays &lt;code&gt;Segmentation fault&lt;/code&gt;, but that output is caused by the shell, not your program. You can verify this by piping STDOUT and STDERR to a byte counter.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;./quine |&amp;amp; wc -c&#xA;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now, my terminal uses Bash in interactive mode. Any other shell and any other way of invocation may produce different output.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Segmentation fault                                  # Bash, interactive&#xA;bash: line 1:  8176 Segmentation fault      ./quine # Bash, non-interactive&#xA;[1]    9004 segmentation fault  ./quine             # Zsh,  interactive&#xA;                                                    # Zsh,  non-interactive&#xA;Memory fault                                        # Ksh,  interactive&#xA;ksh: line 1: 9417: Memory fault                     # Ksh,  non-interactive&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So your program &lt;em&gt;may&lt;/em&gt; display the proper output on the screen, but this requires not only Linux, but a specific parent shell. In some cases, the output even depends on the PID.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Then again, &lt;a href=&quot;https://codegolf.stackexchange.com/a/122681/61563&quot;&gt;Anders' answer&lt;/a&gt; relies on default filenames (which qualifies as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1072/61563&quot;&gt;&lt;em&gt;using the filename to store data&lt;/em&gt;&lt;/a&gt;) and non-standard &lt;code&gt;&amp;lt;err.h&amp;gt;&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Including &lt;em&gt;err.h&lt;/em&gt; is exactly as necessary as including &lt;em&gt;stdio.h&lt;/em&gt;. If one has to include &lt;em&gt;err.h&lt;/em&gt; to use &lt;code&gt;warn&lt;/code&gt; or &lt;code&gt;err&lt;/code&gt; in your opinion, one would have to include &lt;em&gt;stdio.h&lt;/em&gt; to use &lt;code&gt;puts&lt;/code&gt; as well, and your answer uses &lt;code&gt;puts&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not sure if online interpreters actually count as different implementations of the language, so the validity of the Ideone-only solution is debatable. However, gcc's default name for output files is &lt;code&gt;a.out&lt;/code&gt;, so I see no reason whatsoever why the longer of the two solutions would be invalid.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Which answer should I give my bounty to?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Well, that's ultimately up to you. You said &lt;em&gt;+100 to anyone who can find a shorter solution in C than my three 19-byte solutions&lt;/em&gt;, which can be interpreted in a number of ways, namely:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;First answer that beats your score.&lt;/li&gt;&#xA;&lt;li&gt;Shortest answer that beats your score and was posted during the bounty period.&lt;/li&gt;&#xA;&lt;li&gt;All future answers that beat your score.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Only you know what you meant. It probably wasn't the last one, but even if it was, SE won't allow you to offer a second &lt;strong&gt;+100&lt;/strong&gt; bounty on the same question. That leaves the first two options.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I were you, I'd award the bounty to @AndersKaseorg's answer. Both his and my answer are valid to the best of my knowledge, but his answer is shorter, and shorter is better.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2017-05-27T02:47:52.083" LastActivityDate="2017-05-27T02:47:52.083" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12611" PostTypeId="2" ParentId="12599" CreationDate="2017-05-27T10:24:31.833" Score="7" Body="&lt;h1&gt;Encourage more people to use the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8474/introducing-the-ppcg-sandbox-viewer&quot;&gt;Sandbox Viewer&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;While all of the details are given in the link above, I'll pick out the relevant things:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There is a sandbox button added to the header. When a new sandbox post is added, it changes colour&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/egfnW.png&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It shows latest activity in a sidebar&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Basically, it acts as a review queue for the sandbox&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Something which could be kept in mind is Level River St.'s comment below:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I think the right way to go about this would be to have a SE developer do this officially, so that people dont have to install the viewer. Similar to the review queues for posts on the main site.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12599/we-need-to-talk-about-the-sandbox/12611?noredirect=1#comment43306_12611&quot;&gt;See here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="61563" LastEditDate="2017-08-18T19:15:07.263" LastActivityDate="2017-08-18T19:15:07.263" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="12612" PostTypeId="1" CreationDate="2017-05-27T10:49:35.907" Score="-2" ViewCount="137" Body="&lt;p&gt;So, I thought about a new metric of code-golf, the code with the smallest value wins. The value is calculated by characters*time to run. So if you use an programming language like python, it's very short, but for that reason, it's less efficient. This results in a chance for efficient programming languages, which take more chars.&#xA;My question is : &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;How can we measure efficiency/time to run ? Everybody's got a different setup.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;How could we call this new type of code-golf ?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="63068" LastActivityDate="2017-05-29T07:15:18.527" Title="New code-golf metric : Efficiency*characters" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="12613" PostTypeId="1" AcceptedAnswerId="12614" CreationDate="2017-05-27T11:01:34.180" Score="-8" ViewCount="117" Body="&lt;p&gt;This question is very simple : Should we introduce a code-golf where only popular/unpopular programming languages are allowed ? And if yes, how can we measure popularity ? Probably with the Top  of the &lt;a href=&quot;https://www.tiobe.com/tiobe-index/&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;TIOBE&quot;&gt;TIOBE&lt;/a&gt; index ?&lt;/p&gt;&#xA;" OwnerUserId="63068" LastActivityDate="2017-06-04T00:05:00.853" Title="Popularity-code-golf?" Tags="|discussion|code-golf|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12614" PostTypeId="2" ParentId="12613" CreationDate="2017-05-27T12:02:26.540" Score="8" Body="&lt;h1&gt;nope&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;seems like it is better to just include everyone, because it's not so nice when someone specifically excludes someones language from their competition.&lt;/p&gt;&#xA;" OwnerUserId="55896" LastActivityDate="2017-05-27T12:02:26.540" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12617" PostTypeId="1" CreationDate="2017-05-27T17:53:01.340" Score="3" ViewCount="113" Body="&lt;p&gt;There does not appear to be a dupe for this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am not sure of the exact calculations that trigger this notification but seeing as some questions get dozens of answers my voting on questions is very skewed. I typically answer things I see on the HNQ. Those post will usually have plenty of answers and therefore I end up voting up answers more than questions. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Currently my ratio is approximately 1:4 for questions vs. answer votes. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I get the prompt &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;You haven't voted on questions in a while ...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;quite frequently here on PPCG. I would like to think every post I visit gets the votes it deserves so I believe I am doing right by the site and its users. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I find this reminder mildy annoying. I am not a frequent participant on the site  and more of a drive-by coder. However I don't think this site is a victim of poor voting culture. Quite the opposite actually. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Are we are to change the threshold for this notification or turn it off altogether?&lt;/p&gt;&#xA;" OwnerUserId="52023" LastEditorUserId="66833" LastEditDate="2021-06-09T13:27:17.643" LastActivityDate="2021-06-09T13:27:17.643" Title="You haven't voted on questions in a while" Tags="|discussion|feature-request|status-declined|voting|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12618" PostTypeId="2" ParentId="12613" CreationDate="2017-05-27T17:58:06.733" Score="2" Body="&lt;h1&gt;Absolutely not&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Have you seen the list you have linked to? The top twenty languages go from well-used but not golfing languages such as Java and C to other languages not used on this site. Number 20 is Scratch, for God's sake!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What you've just said, correct me if I'm wrong, is that you want to allow people to compete using Scratch, Delphi and MATLAB but not Jelly, Pyth and Cjam? These last three languages are so well-used that there was even a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5759/should-we-change-our-name#comment16857_5759&quot;&gt;suggestion&lt;/a&gt; (albeit not serious) to change our name to acknowledge this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This just sounds like a bad idea both for the reason above but also, as @DestructibleLemon&lt;sup&gt;1&lt;/sup&gt; said, you'd be excluding most programming languages and every golfing language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;1: Just wanted to expand on why this would be a bad idea&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2017-06-04T00:05:00.853" LastActivityDate="2017-06-04T00:05:00.853" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12620" PostTypeId="1" CreationDate="2017-05-27T21:48:09.873" Score="-2" ViewCount="121" Body="&lt;p&gt;We need a definition of comment. I have seen challenges that need comments or ban comments. What is a comment? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I will propose a definition in the answers. Users should assume that the highest voted answer with double upvotes vs downvotes is the definition.&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastActivityDate="2017-05-29T02:59:38.810" Title="Definition of a comment" Tags="|discussion|" AnswerCount="2" CommentCount="4" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12622" PostTypeId="2" ParentId="12617" CreationDate="2017-05-27T22:02:09.180" Score="5" Body="&lt;h1&gt;NO&lt;/h1&gt;&#xA;&lt;p&gt;It is &lt;em&gt;&lt;strong&gt;really&lt;/strong&gt;&lt;/em&gt; hard to write a good challenge. I find it much easier to answer vs make a challenge.&lt;/p&gt;&#xA;&lt;p&gt;All my best challenges were not written by me. I enjoy taking old challenges and posting them. But they have so much work. I put hours in a challenge and it turned out to be meh.&lt;/p&gt;&#xA;&lt;p&gt;Please upvote challenges more. They are hard to write.&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-27T22:02:09.180" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12623" PostTypeId="2" ParentId="12617" CreationDate="2017-05-27T22:38:45.010" Score="4" Body="&lt;h1&gt;This is good for the site&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'm going to expand a bit on what Christopher has said.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Good questions on this site are difficult to write and extremely valuable for the site.  For most sites the goal is to get answers.  Getting questions is important, without them a site will die, but, in my opinion, not as much as they are here.  Here the goal is to compete and collaborate on interesting challenges.  The answers are the result but not really the goal (the old its the journey not the destination cliché).  This makes good questions way more important than good answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;People should be incentivized to vote on &lt;em&gt;good&lt;/em&gt; questions as it helps to keep our good question writers interested in making good questions.  Since questions get half as much rep as answers you need to get more votes for it to be worth often larger time investment put into writing quality questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This message should encourage users that don't often vote on questions to do so.  For a drive-by-voter such as yourself, I would recommend looking elsewhere for good questions to vote on, I think the HNQ questions are generally not that good while a lot of high quality questions do not actually appear in the HNQ. And if you don't want to look past the HNQ, just remember downvotes are free ;)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;That being said I don't think there is a real answer skew in the current voting culture.  Believe me, there are problems with the sites voting culture (my top voted answer is &lt;a href=&quot;https://codegolf.stackexchange.com/a/96642/56656&quot;&gt;this mediocre answer&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/110485/leak-memory-in-as-few-bytes-as-possible&quot;&gt;my top question&lt;/a&gt; is not much better), but I don't think we have a big voting skew problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But this warning is a good skew prevention system.  Users like yourself, no offense intended, should probably vote on more questions.  The message may be annoying but I think it does good for the site.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-05-27T22:38:45.010" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12625" PostTypeId="2" ParentId="12620" CreationDate="2017-05-28T03:42:19.503" Score="-4" Body="&lt;h2&gt;A comment is any code that could be trivially removed without changing the behavior of the program&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;All of these are valid comments in Python:&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-python3 prettyprint-override&quot;&gt;&lt;code&gt;# comment&#xA;&quot;comment&quot;&#xA;(None, &quot;comment&quot;)[0]&#xA;def some_function_which_is_never_called(): pass&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The exception to this being if the program reads its own source (this is subject to the same rules as quines).&lt;/p&gt;&#xA;" OwnerUserId="61384" LastActivityDate="2017-05-28T03:42:19.503" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="12631" PostTypeId="2" ParentId="12586" CreationDate="2017-05-28T10:34:27.243" Score="2" Body="&lt;p&gt;Since no one else has mentioned it, it sounds like you'd be interested in the &lt;a href=&quot;http://www.ioccc.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;The International Obfuscated C Code Contest&lt;/a&gt;. It's all about incredibly complicated, unreadable code. They don't make any claims about objectivity, they appoint judges who spend a long time working through solutions - one of the reasons they only run it every couple of years.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some of the prizewinners are pretty amazing though - well worth a look.&lt;/p&gt;&#xA;" OwnerUserId="30512" LastActivityDate="2017-05-28T10:34:27.243" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12632" PostTypeId="2" ParentId="12612" CreationDate="2017-05-28T13:03:33.730" Score="-1" Body="&lt;p&gt;What is the appropriate metric for a program? Yes there is the length of the program, there is the fast run, there is the error detection and secure and in range result, but first of all that, the more important of the first 3: There is the readability... I'm not agree with  the ones see program as a min text to run(even if I like synthesis and in 90% cases have good results in synthetises), but either I not agree in see a program  as a novel we have to read in English or in the language one is born. It is for me as read mathematical formulas, it is a language different from the one we usually speak (English, Danish, Italian, ...). If they want a better way for question and answer for me:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1) the question has always to speak and request the limits cases on answers (for to see if error way is ok for all (or almost all) input possible)&#xA;20% of the vote should be for this point, the error path&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2) each variable name or operator name or function name, or type name ecc value is 1 character; the prototype of a function example &quot;char g(char * v)&quot; is 0 character&#xA;each comment is -1 character&#xA;40% of the vote would comprehend this point, the code length&lt;/p&gt;&#xA;&#xA;&lt;p&gt;3) the fast code in one external machine for see the speed of the code&#xA;10% of vote would regard this aspect, the fast code&lt;/p&gt;&#xA;&#xA;&lt;p&gt;4) the vote of people (for readability and easy read and smart solutions)&#xA;30% of vote would regard this aspect, readability&lt;/p&gt;&#xA;" OwnerDisplayName="user58988" LastEditorDisplayName="user58988" LastEditDate="2017-05-29T07:15:18.527" LastActivityDate="2017-05-29T07:15:18.527" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12633" PostTypeId="2" ParentId="12620" CreationDate="2017-05-28T15:12:03.073" Score="3" Body="&lt;h1&gt;There's a standard definition of &quot;comment-free&quot; in challenges&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Typically, if a challenge asks for &quot;comment-free&quot; code, it defines that as &lt;em&gt;code in which deleting any single character would cause the program to change its input/output behaviour&lt;/em&gt; (sometimes with exceptions for whitespace, particularly in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt; challenges, because languages often vary with respect to how much whitespace is required). This has the advantage of being objective, fitting the intuitive understanding of a &quot;comment&quot; fairly well, and being of a familiar form for PPCG (it's basically the exact opposite of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/radiation-hardening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; rel=&quot;tag&quot;&gt;radiation-hardening&lt;/a&gt;). It also fits the intuition that &quot;a correctly golfed program contains no comments&quot; (if you're aiming for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;, then all winning programs must be comment-free by this definition, as otherwise you could trivially save a byte).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Despite being the best definition I'm currently aware of, it also has a few known issues:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Probably the smallest issue: in languages with multiple-character comment markers (like C's &lt;code&gt;/*…*/&lt;/code&gt;), it allows the code to contain empty comments without issue (because deleting any single character from &lt;code&gt;/**/&lt;/code&gt; causes it to not be a comment, and have some impact on the code).&lt;/li&gt;&#xA;&lt;li&gt;There are some languages, like Burlesque and A Pear Tree, in which any deletion from the source is likely to radically change the way it parses (because the language thinks in terms of blocks of characters rather than single characters, and any deletion must be from some such block). These languages can often trivialise this sort of challenge.&lt;/li&gt;&#xA;&lt;li&gt;There are universal techniques for creating arbitrarily long &quot;comment-free&quot; no-ops in most programming languages. (Typically, this requires creating a long literal, normally but not always a string literal, and then doing some sort of checksum operation on it to ensure that it hasn't been changed.) This means that this definition does not really help with attempts to remove the many loopholes from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user62131" LastEditorDisplayName="user62131" LastEditDate="2017-05-29T02:59:38.810" LastActivityDate="2017-05-29T02:59:38.810" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12634" PostTypeId="2" ParentId="12599" CreationDate="2017-05-28T15:53:03.320" Score="14" Body="&lt;h1&gt;There are several common types of problems with challenges; the Sandbox is good at catching some but not others&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Things the Sandbox is good at&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Where the Sandbox really shines is in circumstances where a challenge breaks a challenge design principle that most experienced PPCG users are aware of. For example, it's fairly easy to go through the recent Sandbox entries and comment on all the ones that require large fixed strings in their output, but are ostensibly about something other than &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; rel=&quot;tag&quot;&gt;compression&lt;/a&gt;. There are a number of similar issues which are almost always quickly caught in the Sandbox.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another situation in which the Sandbox works well is in cases where the whole concept behind a challenge is poorly conceived. Most such challenges immediately receive negative feedback, and even though a couple of attempts are often made to fix them, it becomes clear that the challenge could never work. As such, these challenges tend not to reach the main site at all, meaning that the Sandbox is doing a good cleanup job in these cases. This might not seem encouraging as a question asker – the only real benefit they get from it is a slight reduction in the (very low on PPCG) chance of a question ban, when the challenge inevitably gets closed – but it certainly helps out the question &lt;em&gt;answerers&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The final way in which I'm aware of the Sandbox helping well is in checking for duplicates. Duplicates are often almost impossible to search for on PPCG, so you typically have to rely on someone who saw the earlier challenge to remember that something was up. (My favourite example of this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/105577/find-the-smallest-positive-integer-which-has-all-integers-from-1-to-n-as-factors?noredirect=1&amp;amp;lq=1#comment256486_105577&quot;&gt;this comment&lt;/a&gt;, in which a PPCG user &lt;em&gt;remembered competing on an earlier duplicate challenge&lt;/em&gt; and already had a solution to it in a file on their own computer, and yet couldn't find the challenge itself. We found it in the end, but it was way harder than it should have been.) It's often possible to get a suspicion that a challenge &lt;em&gt;might&lt;/em&gt; be a duplicate, and Sandboxing it with an explicit request for a dupe check often produces useful results.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Things the sandbox is bad at&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Now, what the Sandbox is worst at is finding ambiguities in the specification (i.e. the situation for which you're trying to use it); there's definitely a problem here, because this is something that is commonly perceived as something that the Sandbox does/should do. Although I don't know for certain, I suspect there are two reasons for this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One is that finding an ambiguity often needs a lot of knowledge of specific programming languages; I can see a challenge that says &quot;in situation X, return Boolean false; your program must not error&quot; and immediately realise &quot;there are programming languages in which Boolean false &lt;em&gt;is&lt;/em&gt; a type of error&quot;, but it's not a fact that the programming community is generally aware of, so most people wouldn't be able to catch that specific issue in the Sandbox. Likewise, there are a large number of potential issues which could only be caught by specific other people. In other words, the issues that I mention that the Sandbox is good at can each be caught by a large proportion of PPCG users; however, ambiguities can often only be noticed by a much smaller subset, meaning that in order to remove all ambiguities from a Sandboxed challenge, you'd probably need around half of PPCG to review the challenge, and even then you'd run the risk of missing some. (Note that posting to main isn't much better at catching this sort of ambiguity, but if nobody catches it on main, the ambiguity turned out not to actually matter.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The other issue is that some ambiguities only become clear when trying to actually solve the problem, something you aren't really meant to do with Sandboxed problems. (I rarely try to solve even my own problems before they're posted on main, to keep things fair; it's not uncommon for a challenge to change between the sandboxed and main version anyway, so working on an answer in advance is inadvisable as it is. The main exceptions here are solving Sandboxed challenges in Jelly in my head in order to determine if they're too trivial – if I can do it, the challenge probably needs to be harder – and situations in which I write a program I'm particularly proud of and post a challenge to PPCG simply as an excuse to be able to post the program in question as an answer.) Actually writing code can give you a better appreciation for where the corner cases are than looking at the spec.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Ways in which we can improve the situation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;So, what can we do about this? First, we probably shouldn't be downvoting challenges unless they're actually downvotable according to SE rules (&quot;this question does not show any research effort; it is unclear or not useful&quot;). Sandboxing questions correctly shows effort into making a good question, and that the question is not immediately unclear; lack of utility (in PPCG terms, being uninteresting to compete on) is also something that you'd hope would at least be commented on in the Sandbox. Incidentally, you can help deal with this issue both as a voter and as a challenge poster; voters can simply not downvote challenges unless the challenge deserves it; and challenge posters can use the trick of linking to the Sandbox post from the main post (even though doing so really shouldn't matter), in order to give a subtle hint of &quot;if you want to complain about this, you should have done so while it was Sandboxed&quot; (which in my experience actually helps to avoid downvotes). For what it's worth, I've Sandboxed a few challenges even though I knew they'd get no useful feedback, purely to be able to link to the Sandbox and say &quot;see, I Sandboxed this!&quot;. (Much of the time, though, I am expecting the Sandbox to be able to improve the post.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That basically just fixes the issue with downvotes, though; it doesn't fix the issues with the amount of exposure that some posts need to resolve ambiguities being lower than the amount that the Sandbox can reasonably give it. I know that I suggested &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10778/62131&quot;&gt;sandboxing posts as on-hold posts on main&lt;/a&gt; a while back; the suggestion was generally well-received on average, but controversial. I've since come to view it as a suggestion that would probably be beneficial overall, but which is fairly drastic (and which would likely have significant UI issues), and therefore should be avoided unless necessary; however, if we view the Sandbox as being on the point of collapse, we might have to go through with it. (It's not like the reopen queue is at all struggling at the moment.) That said, there seems to be a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/4842/62131&quot;&gt;rough, but far from unanimous, consensus that the Sandbox is in fact functioning mostly correctly at the moment&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-05-28T15:53:03.320" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12637" PostTypeId="1" CreationDate="2017-05-28T22:15:24.340" Score="2" ViewCount="306" Body="&lt;p&gt;It's been asked before, it's been rejected before and now I'm bringing it up again.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have a love/hate relationship with the Sandbox. I've &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12599/66833&quot;&gt;voiced&lt;/a&gt; complaints before but I now have an idea that might work.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The Sandbox is quite a good idea, despite having flaws. One of the flaws that we can easily address is its size. As if posting this, it has 1700 proposals. This is great. Unless you happen to use the iOS app (no idea about android) where it slows down massively, making reviewing posts difficult.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a (apparently) unrelated side-note, the Sandbox is approaching 2000 answers. What a milestone. Almost makes you think that we should give it some form of reward...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I propose that we combat the problem in the first paragraph with the solution in the second. When the Sandbox reaches 2000 posts, we lock it and allow active challenges there to be transferred across to... &lt;strong&gt;a new Sandbox!&lt;/strong&gt; I'm sure that the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/31362/sandbox&quot;&gt;Sandbox&lt;/a&gt; would be happy to retire from that question (not to mention the fact that it will get another 3 gold badges).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also suggest that we extend this into the future, if this works, which I see no reason why it shouldn't. When the next sandbox hits 2000 answers, we lock it and create a new one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An advantage that waiting for 300 more challenges has, don't forget, is that it will allow us to slowly work down the number of questions being posted there, especially if we begin the new Sandbox as the current one nears 1950 to allow for people to divert away from it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an extra bonus, it will probably (for the moment) solve &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12599/66833&quot;&gt;this&lt;/a&gt; question as people are more willing to look at a post when it has less answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, I have been presenting this as something that is perfect, that can't go wrong. But I'm going to do a Geobits and point out what's wrong with this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To kick off, let's look at the reason why we have a giant Sandbox. It's because we had this situation before and it wasn't working. To quote Martin Ender, it was causing more problems that it was solving. If we reintroduced that, wouldn't it cause the same problems?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, how can we make sure that people won't keep posting in the current Sandbox as we are retiring it? The ideal thing would be a lock where people can edit, vote and comment but can't answer. But of course this doesn't exist and SE won't make an exception for us.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, have you seen the proposed design for the site? If not, check it out &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7955/66833&quot;&gt;here&lt;/a&gt;. In my opinion, it is a brilliant idea. But, when looking at it, I noticed a &quot;Propose a Challenge&quot; button that presumably takes you to the Sandbox. You're beginning to see the problem here, aren't you? If we constantly change the Sandbox, the button is going to have to change, as is the &quot;Featured on Meta&quot; link. Mommy SE will not be happy having to update things like this every so often.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In short, what do you think? I will post a &quot;Yes&quot; and a &quot;No&quot; answer but if you want to elaborate, feel free to post a separate answer.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="68942" LastEditDate="2021-06-09T05:38:46.873" LastActivityDate="2021-06-09T05:38:46.873" Title="Can we retire the Sandbox?" Tags="|discussion|feature-request|status-declined|sandbox|" AnswerCount="4" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="12640" PostTypeId="2" ParentId="12637" CreationDate="2017-05-28T23:35:48.763" Score="8" Body="&lt;h2&gt;Do not retire the sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Retiring the sandbox does not solve a sufficient number of problems to make the work associated with it worthwhile. The only problem that we know that this will fix is viewing the post on the iOS app. However, this is a problem with the app, not the sandbox, and it can easily be viewed in a browser instead in the meantime. The question of whether enough people look at the sandbox seems unlikely to change if a new sandbox is started, as viewing the sandbox by activity essentially yields the same results.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In contrast, retiring the sandbox creates more work for mods, since they have to manage locking the old post and featuring the new one. It also creates work for users who want to review their unposted sandbox challenges, or who want to look through the sandbox for duplicates, as their search queries will have to include more question ids.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While the negatives do not seem very significant to me, I see no actual benefit to retiring the sandbox.&lt;/p&gt;&#xA;" OwnerUserId="31625" LastActivityDate="2017-05-28T23:35:48.763" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12643" PostTypeId="2" ParentId="2140" CreationDate="2017-05-29T10:00:25.510" Score="2" Body="&lt;h1&gt;The alphabet - my way&lt;/h1&gt;&#xA;&lt;p&gt;Your pointy-haired boss gives you a list of words and tells you to sort them.  So you give him back a sorted list.  &amp;quot;Wrong!&amp;quot; he says.  &amp;quot;I want them sorted according to MY alphabet...&amp;quot;&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Given a new ordering of the alphabet and a list of words, sort the words according to that new alphabet ordering.&lt;/p&gt;&#xA;&lt;p&gt;The new ordering is given as a 26-character string, guaranteed to contain all letter of the alphabet exactly once, in lower case.&lt;/p&gt;&#xA;&lt;p&gt;All words in the list of words will be made up of lower case letters only -- no capital letters or punctuation.  There will be no repeat words.&lt;/p&gt;&#xA;&lt;p&gt;If there is a word in the list that is the prefix of another word, then the shorter (prefix) word should appear first in the sorting.  For example, &amp;quot;golf&amp;quot; should appear before &amp;quot;golfing&amp;quot;.&lt;/p&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;h2&gt;Example 1&lt;/h2&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;qwertyuiopasdfghjklzxcvbnm&#xA;apple&#xA;banana&#xA;currant&#xA;dragonfruit&#xA;elderberry&#xA;fejoia&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;elderberry&#xA;apple&#xA;dragonfruit&#xA;fejoia&#xA;currant&#xA;banana&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Example 2&lt;/h2&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;qwertyuiopasdfghjklzxcvbnm&#xA;uranium&#xA;plutonium&#xA;uranus&#xA;pluto&#xA;polonium&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;uranus&#xA;uranium&#xA;polonium&#xA;pluto&#xA;plutonium&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Example 3&lt;/h2&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;abcdefghijklmnopqrstuvwxyz&#xA;four&#xA;score&#xA;and&#xA;seven&#xA;years&#xA;ago&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ago&#xA;and&#xA;four&#xA;score&#xA;seven&#xA;years&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="68070" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-29T10:00:25.510" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12646" PostTypeId="2" ParentId="12637" CreationDate="2017-05-29T15:24:38.067" Score="5" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Restarting the Sandbox doesn't solve the problems we have. It postpones them. A smaller Sandbox is desirable so here is an alternative solution.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Adoption&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt;: Lets start adopting 60 abandoned posts per month&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As of 30 minutes ago, the Sandbox had 1696 undeleted posts. Which is about 51 ( &lt;code&gt;1696/33&lt;/code&gt; ) 'stale' posts per month since Sandbox's creation. In fact, lets have a &lt;a href=&quot;https://data.stackexchange.com/meta.codegolf/revision/677545/844965/sandbox-stale-posts-per-month&quot; rel=&quot;nofollow noreferrer&quot;&gt;look&lt;/a&gt; at the number of stale posts per month for the past year. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/m6GLo.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/m6GLo.png&quot; alt=&quot;stales&quot;&gt;&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ignoring this month, it looks to be about 57 per month. So if 2 people adopt an &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2057/43214&quot;&gt;abandoned proposal&lt;/a&gt; every day, Sandbox would stop growing. This would be an ambitious undertaking for 2 users, but if the community as a whole started to resolve these abandoned proposals we could conceivably start shrinking the sandbox.&lt;/p&gt;&#xA;" OwnerUserId="43214" LastActivityDate="2017-05-29T15:24:38.067" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12647" PostTypeId="2" ParentId="2140" CreationDate="2017-05-29T16:31:45.220" Score="-2" Body="&lt;h1&gt;The 2017 Loader contest&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Here's a thing: Let's do the bignum bakeoff again.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because why not.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;What to do&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write a program in less than 256 characters that outputs the biggest number you can.&lt;br&gt;&#xA;Yep, that's it.  Biggest return value wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We'll run the program on a VM with infinite memory. &lt;em&gt;(How do we do this?)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;256 chars max, excluding whitespace&lt;/li&gt;&#xA;&lt;li&gt;Different leagues for each language&lt;/li&gt;&#xA;&lt;li&gt;Output however you want&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No explicitly printing numbers until your loop runs out. Print the number you generate directly. &lt;sup&gt;{1}&lt;/sup&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Program must terminate&lt;/li&gt;&#xA;&lt;li&gt;No implementation-dependent shenanigans.&lt;/li&gt;&#xA;&lt;li&gt;Implementation-independent shenanigans is &lt;em&gt;encouraged&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;ints are infinite.&lt;/li&gt;&#xA;&lt;li&gt;Program must return the same number every time&lt;/li&gt;&#xA;&lt;li&gt;Submission must include the approximate return value in any suitable googological notation.&lt;/li&gt;&#xA;&lt;li&gt;Whitespace is space, tab, newline, formfeed, and return&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;BrainF***: Whitespace is all non-&lt;code&gt;[]+-&amp;lt;&amp;gt;&lt;/code&gt; characters&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;{1}&lt;/strong&gt; Allowed ways to return: &lt;code&gt;printf(&quot;%d&quot;, num);&lt;/code&gt; &lt;code&gt;return num;&lt;/code&gt;, etc.&lt;br&gt;&#xA;Banned ways to return: &lt;code&gt;for(;num&amp;gt;0;num--)printf(&quot;99999&quot;);&lt;/code&gt;, etc.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;This is not a dupe of...&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/18028/largest-number-printable&quot;&gt;This&lt;/a&gt; because you can put any characters you want, not just non-digits; because we're hard-limiting the characters.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Suggested rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No floats: &lt;code&gt;float&lt;/code&gt; &lt;code&gt;double&lt;/code&gt; &lt;code&gt;long double&lt;/code&gt;, etc&lt;/li&gt;&#xA;&lt;li&gt;No strings or chars&lt;/li&gt;&#xA;&lt;li&gt;No bitfeilds&lt;/li&gt;&#xA;&lt;li&gt;No looking at Command-line args&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Next year's contest will be named after this year's winner, for no particular reason.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://djm.cc/bignum-rules-posted.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://djm.cc/bignum-rules-posted.txt&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Sandbox&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How do you even test these programs?&lt;/li&gt;&#xA;&lt;li&gt;What other rules should we have?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49186" LastEditorUserId="49186" LastEditDate="2017-06-01T13:35:40.460" LastActivityDate="2017-06-01T13:35:40.460" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="12650" PostTypeId="2" ParentId="2140" CreationDate="2017-05-29T19:36:18.710" Score="-2" Body="&lt;h1&gt;Google Logo in Conway's Game of Life&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life&quot; rel=&quot;nofollow noreferrer&quot;&gt;Conway's Game of Life&lt;/a&gt; base challenges are always fun so here is a new one.&lt;/p&gt;&#xA;&lt;p&gt;This is Google's Logo (if you have not somehow seen it):&#xA;&lt;a href=&quot;https://i.stack.imgur.com/894ij.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/894ij.jpg&quot; alt=&quot;Google Logo&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The font is called &lt;a href=&quot;https://storage.googleapis.com/g-design/static/product-sans-specimen.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;Product Sans&lt;/a&gt;. Your job is to replicate this logo (no color of course) in 800x439px just like the image (just the letters).&lt;/p&gt;&#xA;&lt;p&gt;Have fun! This is a popularity contest so the most votes wins. :D Good luck. Of course, this may not be possible but, you never know until you try.&lt;/p&gt;&#xA;&lt;p&gt;Usual rules apply.&lt;/p&gt;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/11880/build-a-working-game-of-tetris-in-conways-game-of-life&quot;&gt;this&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="65989" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-30T13:16:12.790" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="12652" PostTypeId="1" CreationDate="2017-05-30T01:21:08.680" Score="0" ViewCount="58" Body="&lt;p&gt;I had the idea to make a CnR where the cops present non-golfed code and the robbers present the golfed version. I found out it was a dupe :( but wanted to know.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you have a CnR challenge and make another with a different task but the core challenge is it a dupe?&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorDisplayName="user63187" LastEditDate="2017-05-30T12:28:37.473" LastActivityDate="2017-05-30T12:28:37.473" Title="Two CnR with same CnR idea" Tags="|discussion|cops-and-robbers|" AnswerCount="1" CommentCount="2" ClosedDate="2017-05-30T12:43:09.133" ContentLicense="CC BY-SA 3.0" />
  <row Id="12653" PostTypeId="2" ParentId="12652" CreationDate="2017-05-30T03:08:28.433" Score="3" Body="&lt;h1&gt;We measure &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; duplicates by the &amp;quot;core challenge&amp;quot;, not the &amp;quot;arbitrary task&amp;quot;&lt;/h1&gt;&#xA;&lt;p&gt;For example, in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/54807/the-programming-language-quiz&quot;&gt;The Programming Language Quiz&lt;/a&gt;, the core challenge is &amp;quot;writing a program such that it is hard to identify the language&amp;quot;, while the task is &amp;quot;writing a Hello World! program&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;A different Programming Language Quiz but with a different task (e.g. print the fibonacci sequence) is definitely a duplicate.&lt;/p&gt;&#xA;&lt;p&gt;If the task contributes to the core challenge in some way, then there is some leeway, but it is up to close-voters to judge how similar they are.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-30T03:08:28.433" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12655" PostTypeId="2" ParentId="8474" CreationDate="2017-05-30T10:11:57.783" Score="2" Body="&lt;h1&gt;Bug: WebSocket connection blocked when using https&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Execution of script 'Sandbox Viewer' failed! Failed to construct 'WebSocket': An insecure WebSocket connection may not be initiated from a page loaded over HTTPS.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I notice you updated the http: URIs to use https: in the v2.4 commit but the websocket URI on line 351 is still using ws: instead of wss:&lt;/p&gt;&#xA;" OwnerUserId="65654" LastActivityDate="2017-05-30T10:11:57.783" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12657" PostTypeId="2" ParentId="12498" CreationDate="2017-05-30T12:55:42.343" Score="-4" Body="&lt;h2&gt;Answers should &lt;em&gt;surely&lt;/em&gt; give a correct result within finite time.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In other words, &lt;strong&gt;almost surely&lt;/strong&gt; is not enough. &lt;sup&gt;PRNG's are assumed to be truly random.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;While a program could give an answer with probability of 1 ('almost surely'), the expected runtime is then arbitrarily long (possibly even infinite).&lt;/li&gt;&#xA;&lt;li&gt;Interesting challenges could be trivialized; for example, when verifying the correct solution out of randomly generated candidates is trivial compared to generating the correct result. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This view allows for non-determinism (like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12502/32352&quot;&gt;@ais523&lt;/a&gt;'s answer), but excludes hope-for-the-best approaches (as in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12591/32352&quot;&gt;@ymbirtt&lt;/a&gt;'s answer). For example, bogosort is not OK, but listing all permutations of the list in random order and selecting the first one that is sorted is OK.&lt;/p&gt;&#xA;" OwnerUserId="32352" LastEditorUserId="32352" LastEditDate="2017-05-31T10:09:01.223" LastActivityDate="2017-05-31T10:09:01.223" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12658" PostTypeId="2" ParentId="2140" CreationDate="2017-05-30T16:52:29.700" Score="0" Body="&lt;h3&gt;Multiplicity of a Curve&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polynomials&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polynomials&amp;#39;&quot; rel=&quot;tag&quot;&gt;polynomials&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/abstract-algebra&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;abstract-algebra&amp;#39;&quot; rel=&quot;tag&quot;&gt;abstract-algebra&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an polynomial &lt;code&gt;p&lt;/code&gt; in two variables &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; as well as a point &lt;code&gt;(u,v)&lt;/code&gt;, determine the &lt;em&gt;multiplicity&lt;/em&gt; &lt;code&gt;m&lt;/code&gt; of the curve &lt;code&gt;C = { (x,y) | p(x,y) = 0}&lt;/code&gt; at the point &lt;code&gt;(u,v)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The &lt;em&gt;degree&lt;/em&gt; of a monomial &lt;code&gt;a * x^i * y^j&lt;/code&gt; in two variables is &lt;code&gt;d = i+j&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A polynomial is &lt;em&gt;homogeneous&lt;/em&gt; if all its monomials have the same degree &lt;code&gt;d&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Any polynomial &lt;code&gt;p&lt;/code&gt; (where &lt;code&gt;d&lt;/code&gt; is the degree of &lt;code&gt;p&lt;/code&gt;, i.e. the maximum of the degree of all its monomials) can uniquely be decomposed into a sum of polynomials &lt;code&gt;p = p0 + p1 + ... + pd&lt;/code&gt; where each &lt;code&gt;pk&lt;/code&gt; is homogeneous of degree &lt;code&gt;k&lt;/code&gt; OR possibly zero.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The &lt;em&gt;multiplicity&lt;/em&gt; of a curve &lt;code&gt;C&lt;/code&gt; given by the polynomial &lt;code&gt;p&lt;/code&gt; at &lt;code&gt;(u,v)&lt;/code&gt; can be determined using the following computation:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;First decompose the polynomial &lt;code&gt;p(x-u,y-v)&lt;/code&gt; (this is &lt;code&gt;p&lt;/code&gt; with &lt;code&gt;x,y&lt;/code&gt; replaced with &lt;code&gt;x-u,y-v&lt;/code&gt;) into a sum of homogeneous polynomials as described above:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;p(x-u,y-v) = q0 + q1 + ... + qd&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Then determine the minimal &lt;code&gt;k&lt;/code&gt; such that &lt;code&gt;qk&lt;/code&gt; is nonzero. Then the multiplicity is defined as &lt;code&gt;m := k&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Let us consider the polynomial &lt;code&gt;p(x,y) = -x^2 - 4x + y^2 - 2y -3&lt;/code&gt; and the point &lt;code&gt;(u,v) = (-2,1)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;p(x-u,y-v) = y^2 - x^3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So the decomposition is &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;p(x-u,y-v) = [0] + [0] + [y^2] + [-x^3]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here the brackets are just used to highlight the homogeneous polynomials of each degree.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We see that &lt;code&gt;y^2&lt;/code&gt; is the nonzero polynomial of least degree, so &lt;code&gt;m = 2&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;TODO&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;add more testcases&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2017-08-15T22:04:52.767" LastActivityDate="2017-08-15T22:04:52.767" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12665" PostTypeId="2" ParentId="2140" CreationDate="2017-05-31T06:49:02.323" Score="0" Body="&lt;h1&gt;Can my favourite team still become Football Champion? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As a fan of an at most moderately successful football&lt;sup&gt;BE&lt;/sup&gt; team, towards the end of the season I often wonder whether my favourite team still has any theoretical chance left of becoming champion. Your task in this challenge is to answer that question for me. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You will recieve three inputs: the current table, the list of remaining matches, and the current position of the team we are interested in.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input 1:&lt;/strong&gt; The &lt;em&gt;current table&lt;/em&gt;, a sequence of numbers were the &lt;em&gt;i&lt;/em&gt;-th number are the points gained by team &lt;em&gt;i&lt;/em&gt; so far. For example, the input&#xA;&lt;code&gt;[93, 86, 78, 76, 75]&lt;/code&gt; encodes the following table (only the last column is of importance):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/k4jQe.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/k4jQe.png&quot; alt=&quot;premier league table&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input 2&lt;/strong&gt;: The &lt;em&gt;remaining matches&lt;/em&gt;, a sequence of tuples where each tuple (&lt;em&gt;i&lt;/em&gt;,&lt;em&gt;j&lt;/em&gt;) stands for a remaining match between team &lt;em&gt;i&lt;/em&gt; and &lt;em&gt;j&lt;/em&gt;. In the above example, a second input of &lt;code&gt;[(1,2), (4,3), (2,3), (3,2), (1,2)]&lt;/code&gt; would mean that the remaining matches are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Chelsea vs Tottenham, Liverpool vs Man. City, Tottenham vs Man. City, Man. City vs Tottenham, Chelsea vs Tottenham&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input 3:&lt;/strong&gt; The &lt;em&gt;current position&lt;/em&gt; of the team we are interested in. For example, an input of &lt;code&gt;2&lt;/code&gt; for the above example would mean that we'd like to know whether Tottenham can still become champion.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For each remaining match of the form (&lt;em&gt;i&lt;/em&gt;,&lt;em&gt;j&lt;/em&gt;), there are three possible outcomes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Team &lt;em&gt;i&lt;/em&gt; wins: Team &lt;em&gt;i&lt;/em&gt; gets &lt;strong&gt;3 points&lt;/strong&gt;, team &lt;em&gt;j&lt;/em&gt; gets &lt;strong&gt;0 points&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Team &lt;em&gt;j&lt;/em&gt; wins: Team &lt;em&gt;i&lt;/em&gt; gets &lt;strong&gt;0 points&lt;/strong&gt;, team &lt;em&gt;j&lt;/em&gt; gets &lt;strong&gt;3 points&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Draw: Team &lt;em&gt;i&lt;/em&gt; and &lt;em&gt;j&lt;/em&gt; both get &lt;strong&gt;1 point&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You must output a truthy value if there is some outcome for all remaining games such that at the end, no other team has more points than the team specified in the 3rd input. Otherwise, output a falsy value.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;: Consider the exemplary input from the above section:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input 1 = &lt;code&gt;[93, 86, 78, 76, 75]&lt;/code&gt;,&#xA;Input 2 = &lt;code&gt;[(1,2), (4,3), (2,3), (3,2), (1,2)]&lt;/code&gt;,&#xA;Input 3 = &lt;code&gt;2&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If team &lt;code&gt;2&lt;/code&gt; wins all its remaining matches (i.e. &lt;code&gt;(1,2), (2,3), (3,2), (1,2)&lt;/code&gt;), it gets 4*3 = 12 additional points; none of the other teams gets any points from these matches. Let's say the other remaining match (i.e. &lt;code&gt;(4,3)&lt;/code&gt;) is a draw. Then the final scores would be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; Team 1: 93, Team 2: 86 + 12 = 98, Team 3: 78 + 1 = 79, Team 4: 76 + 1 = 77, Team 5: 75&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This means that we have already found some outcome for the remaining matches such that no other team has more points than team &lt;code&gt;2&lt;/code&gt;, so the output for this input must be truthy.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Details&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may assume the first input to be an ordered sequence, i.e. for &lt;em&gt;i&lt;/em&gt; &amp;lt; &lt;em&gt;j&lt;/em&gt;, the &lt;em&gt;i&lt;/em&gt;-th entry is equal to or greater than the &lt;em&gt;j&lt;/em&gt;-th entry. The first input may be taken as a list, a string or the like.&lt;/li&gt;&#xA;&lt;li&gt;You may take the second input as a string, a list of tuples or the like. Alternatively, you may take it as a two-dimensional array &lt;code&gt;a&lt;/code&gt; where &lt;code&gt;a[i][j]&lt;/code&gt; is the number of entries of the form &lt;code&gt;(i,j)&lt;/code&gt; in the list of remaining matches. For example, &lt;code&gt;a[1][2] = 2, a[2][3] = 1, a[3][2] = 1, a[4][3] = 1&lt;/code&gt;&#xA;corresponds to &lt;code&gt;[(1,2), (4,3), (2,3), (3,2), (1,2)]&lt;/code&gt;. &lt;/li&gt;&#xA;&lt;li&gt;For the second and third input, you may assume 0-indexing instead of 1-indexing.&lt;/li&gt;&#xA;&lt;li&gt;You may take the three inputs in any order.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Please specify the exact input format you chose in your answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;strong&gt;Side node&lt;/strong&gt;: The problem underlying this challenge was shown to be NP-complete in &quot;&lt;a href=&quot;http://dl.acm.org/citation.cfm?id=756600&quot; rel=&quot;nofollow noreferrer&quot;&gt;Football Elimination is Hard to Decide Under the 3-Point-Rule&lt;/a&gt;&quot;. Interestingly, if only two points are awarded for a win, the problem becomes solvable in polynomial time.&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;All test cases are in the format &lt;code&gt;Input1&lt;/code&gt;, &lt;code&gt;Input2&lt;/code&gt;, &lt;code&gt;Input3&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Truthy:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;[93, 86, 78, 76, 75]&lt;/code&gt;, &lt;code&gt;[(1,2), (4,3), (2,3), (3,2), (1,2)]&lt;/code&gt;, &lt;code&gt;2&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[50]&lt;/code&gt;, &lt;code&gt;[]&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[10, 10, 10]&lt;/code&gt;, &lt;code&gt;[]&lt;/code&gt;, &lt;code&gt;3&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[15, 10, 8]&lt;/code&gt;, &lt;code&gt;[(2,3), (1,3), (1,3), (3,1), (2,1)]&lt;/code&gt;, &lt;code&gt;2&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Falsy:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;[10, 9, 8]&lt;/code&gt;, &lt;code&gt;[]&lt;/code&gt;, &lt;code&gt;2&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[10, 9, 9]&lt;/code&gt;, &lt;code&gt;[(2,3), (3,2)]&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[21, 12, 11]&lt;/code&gt;, &lt;code&gt;[(2,1), (1,2), (2,3), (1,3), (1,3), (3,1), (3,1)]&lt;/code&gt;, &lt;code&gt;2&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Winner&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest correct answer (in bytes) wins. The winner will be chosen one week after the first correct answer is posted.&lt;/p&gt;&#xA;" OwnerUserId="24898" LastActivityDate="2017-05-31T06:49:02.323" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12666" PostTypeId="2" ParentId="8474" CreationDate="2017-05-31T09:07:09.817" Score="1" Body="&lt;h1&gt;Bug: Post button doesn't work&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I just installed this, Chrome/Tampermonkey, and the &lt;code&gt;Post&lt;/code&gt; button, for  posting comments, doesn't work. It doesn't respond at all.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2017-05-31T09:07:09.817" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12667" PostTypeId="2" ParentId="8474" CreationDate="2017-05-31T09:10:37.973" Score="3" Body="&lt;h1&gt;Bug: Voting is cross-site request&lt;/h1&gt;&#xA;&lt;p&gt;When I upvoted, Tampermonkey saw it as a cross-site request and flagged it.&lt;/p&gt;&#xA;&lt;p&gt;I'm not sure whether this a bug in the script or in SE, but I'll show it anyways:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/kX0Gi.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/kX0Gi.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-05-31T09:10:37.973" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12668" PostTypeId="2" ParentId="2140" CreationDate="2017-05-31T11:25:48.627" Score="1" Body="&lt;h1&gt;Dodge your death!&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&quot;Muhuhuhahahah!&quot; The mad scientist laughs. &quot;You're trapped in my own little game!&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In front of you is a deadly pit of snakes, while behind you is a bottomless chasm. There's no way out, you're stuck!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;Two steps in front of you is the snake pit, and two steps behind you is the chasm. But! Before you move, you MUST write down a sequence of steps, forwards and backwards, and give them to me. But! because I'm feeling a bit &lt;em&gt;evil&lt;/em&gt; today, I can make you take, instead of every step, every &lt;code&gt;n&lt;/code&gt;th step, where &lt;code&gt;n&lt;/code&gt; is less than your sequence length!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Choose wisely, now.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What's the maximum number of steps you can take before your imminent death?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The intro above is a twist on the &lt;a href=&quot;https://en.wikipedia.org/wiki/Sign_sequence#Erd.C5.91s_discrepancy_problem&quot; rel=&quot;nofollow noreferrer&quot;&gt;Erdős discrepancy conjecture&lt;/a&gt;, which was recently proven true (if you want to understand more about this, go to &lt;a href=&quot;https://www.youtube.com/watch?v=pFHsrCNtJu4&quot; rel=&quot;nofollow noreferrer&quot;&gt;this video&lt;/a&gt;, by James Grime - I &quot;stole&quot; the twist question off of him).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The answer to the intro is &lt;code&gt;11&lt;/code&gt; steps, but I won't go too in-depth with a proof. The answer, if the distance between you and the two &quot;dangers&quot; were &lt;code&gt;3&lt;/code&gt; steps, is &lt;code&gt;1160&lt;/code&gt; steps, although that isn't validated properly yet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to make a program that generates the longest sequence of steps you can for a larger &lt;code&gt;x&lt;/code&gt;, where &lt;code&gt;x&lt;/code&gt; is the number of steps between you and the two &lt;code&gt;dangers&lt;/code&gt;. For the purposes of this challenge, &lt;code&gt;+&lt;/code&gt; represents a step forward, and &lt;code&gt;-&lt;/code&gt; represents a step back.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, an output for an input &lt;code&gt;2&lt;/code&gt; is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+--+-++--++&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which works, no matter what &lt;code&gt;n&lt;/code&gt; the mad scientist chooses. For our challenge, &lt;code&gt;x = 5&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your entire program should fit into your answer. However, if it doesn't fit, please provide an additional Github repository, or something similar.&lt;/li&gt;&#xA;&lt;li&gt;You may update both your answer and program, if you can get a better score via optimisation.&lt;/li&gt;&#xA;&lt;li&gt;In your answer, you must have:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program, in its entirety&lt;/li&gt;&#xA;&lt;li&gt;The amount of steps generated - this will be your final score.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must also provide an online version of the sequence in a Pastebin, or something similar. This is so we can check your answer.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The time your final score was last updated, so I don't have to check your history&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;You may NOT hardcode sequences beforehand&lt;/li&gt;&#xA;&lt;li&gt;Your program must work for all &lt;code&gt;x&lt;/code&gt; (where &lt;code&gt;x&lt;/code&gt; is the number of steps between you and the pit &amp;amp; chasm), but you only need to provide the score for &lt;code&gt;x = 5&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The answer with the largest score wins!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Meta:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What tags should I put in?&lt;/li&gt;&#xA;&lt;li&gt;What things should I fix / elaborate?&lt;/li&gt;&#xA;&lt;li&gt;For the &quot;link to text file containing sequence&quot; thing, I'm worried that the files might eventually get really big, as answers are more and more sophisticated. Is there any way to counteract that?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="49561" LastEditDate="2017-06-01T09:42:12.333" LastActivityDate="2017-06-01T09:42:12.333" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="12670" PostTypeId="2" ParentId="2140" CreationDate="2017-05-31T13:59:24.130" Score="0" Body="&lt;p&gt;Closely related to &lt;a href=&quot;https://codegolf.stackexchange.com/q/6284/46206&quot;&gt;Words from periodic table of elements&lt;/a&gt; (but that one is closed due to unclear specification?).&lt;/p&gt;&#xA;&lt;p&gt;Closely related to &lt;a href=&quot;https://codegolf.stackexchange.com/q/58476/46206&quot;&gt;Find the Chemistry of a name&lt;/a&gt; (probably a dupe, slightly different requirements though).&lt;/p&gt;&#xA;&lt;p&gt;Closely related to &lt;a href=&quot;https://codegolf.stackexchange.com/q/112608/46206&quot;&gt;[Br]eaking Code Golf [Ba]d&lt;/a&gt; (allows strings to be not expressible as solely a sequence of element abbreviations).&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;May I get a community consensus, whether this is better specified and/or sufficiently different to not be immediately closed as a dupe?&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Elementize a string&lt;/h2&gt;&#xA;&lt;p&gt;Convert an input string to a concatenation of chemical element abbreviations.&lt;/p&gt;&#xA;&lt;p&gt;Write a program/function/procedure etc. which will take as input a string/array of characters/pointer to a string etc. and return/print/display the same string expressed as a concatenation of chemical element abbreviations.&lt;/p&gt;&#xA;&lt;p&gt;For example, &lt;code&gt;takagi&lt;/code&gt; can be expressed as &lt;code&gt;TaKAgI&lt;/code&gt; (i.e. the abbreviations for Tantalum(Ta), Potassium(K), Silver(Ag), Iodine(I)).&lt;/p&gt;&#xA;&lt;p&gt;For this challenge you must use the following element name abbreviations:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;{&amp;quot;H&amp;quot;, &amp;quot;He&amp;quot;, &amp;quot;Li&amp;quot;, &amp;quot;Be&amp;quot;, &amp;quot;B&amp;quot;, &amp;quot;C&amp;quot;, &amp;quot;N&amp;quot;, &amp;quot;O&amp;quot;, &amp;quot;F&amp;quot;, &amp;quot;Ne&amp;quot;, &amp;quot;Na&amp;quot;, &amp;quot;Mg&amp;quot;,&#xA;&amp;quot;Al&amp;quot;, &amp;quot;Si&amp;quot;, &amp;quot;P&amp;quot;, &amp;quot;S&amp;quot;, &amp;quot;Cl&amp;quot;, &amp;quot;Ar&amp;quot;, &amp;quot;K&amp;quot;, &amp;quot;Ca&amp;quot;, &amp;quot;Sc&amp;quot;, &amp;quot;Ti&amp;quot;, &amp;quot;V&amp;quot;, &amp;quot;Cr&amp;quot;,&#xA;&amp;quot;Mn&amp;quot;, &amp;quot;Fe&amp;quot;, &amp;quot;Co&amp;quot;, &amp;quot;Ni&amp;quot;, &amp;quot;Cu&amp;quot;, &amp;quot;Zn&amp;quot;, &amp;quot;Ga&amp;quot;, &amp;quot;Ge&amp;quot;, &amp;quot;As&amp;quot;, &amp;quot;Se&amp;quot;, &amp;quot;Br&amp;quot;,&#xA;&amp;quot;Kr&amp;quot;, &amp;quot;Rb&amp;quot;, &amp;quot;Sr&amp;quot;, &amp;quot;Y&amp;quot;, &amp;quot;Zr&amp;quot;, &amp;quot;Nb&amp;quot;, &amp;quot;Mo&amp;quot;, &amp;quot;Tc&amp;quot;, &amp;quot;Ru&amp;quot;, &amp;quot;Rh&amp;quot;, &amp;quot;Pd&amp;quot;,&#xA;&amp;quot;Ag&amp;quot;, &amp;quot;Cd&amp;quot;, &amp;quot;In&amp;quot;, &amp;quot;Sn&amp;quot;, &amp;quot;Sb&amp;quot;, &amp;quot;Te&amp;quot;, &amp;quot;I&amp;quot;, &amp;quot;Xe&amp;quot;, &amp;quot;Cs&amp;quot;, &amp;quot;Ba&amp;quot;, &amp;quot;La&amp;quot;,&#xA;&amp;quot;Ce&amp;quot;, &amp;quot;Pr&amp;quot;, &amp;quot;Nd&amp;quot;, &amp;quot;Pm&amp;quot;, &amp;quot;Sm&amp;quot;, &amp;quot;Eu&amp;quot;, &amp;quot;Gd&amp;quot;, &amp;quot;Tb&amp;quot;, &amp;quot;Dy&amp;quot;, &amp;quot;Ho&amp;quot;, &amp;quot;Er&amp;quot;,&#xA;&amp;quot;Tm&amp;quot;, &amp;quot;Yb&amp;quot;, &amp;quot;Lu&amp;quot;, &amp;quot;Hf&amp;quot;, &amp;quot;Ta&amp;quot;, &amp;quot;W&amp;quot;, &amp;quot;Re&amp;quot;, &amp;quot;Os&amp;quot;, &amp;quot;Ir&amp;quot;, &amp;quot;Pt&amp;quot;, &amp;quot;Au&amp;quot;,&#xA;&amp;quot;Hg&amp;quot;, &amp;quot;Tl&amp;quot;, &amp;quot;Pb&amp;quot;, &amp;quot;Bi&amp;quot;, &amp;quot;Po&amp;quot;, &amp;quot;At&amp;quot;, &amp;quot;Rn&amp;quot;, &amp;quot;Fr&amp;quot;, &amp;quot;Ra&amp;quot;, &amp;quot;Ac&amp;quot;, &amp;quot;Th&amp;quot;,&#xA;&amp;quot;Pa&amp;quot;, &amp;quot;U&amp;quot;, &amp;quot;Np&amp;quot;, &amp;quot;Pu&amp;quot;, &amp;quot;Am&amp;quot;, &amp;quot;Cm&amp;quot;, &amp;quot;Bk&amp;quot;, &amp;quot;Cf&amp;quot;, &amp;quot;Es&amp;quot;, &amp;quot;Fm&amp;quot;, &amp;quot;Md&amp;quot;,&#xA;&amp;quot;No&amp;quot;, &amp;quot;Lr&amp;quot;, &amp;quot;Rf&amp;quot;, &amp;quot;Db&amp;quot;, &amp;quot;Sg&amp;quot;, &amp;quot;Bh&amp;quot;, &amp;quot;Hs&amp;quot;, &amp;quot;Mt&amp;quot;, &amp;quot;Ds&amp;quot;, &amp;quot;Rg&amp;quot;, &amp;quot;Cn&amp;quot;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;These are the elements with numbers 1 through 112. You may optionally also use the abbreviations for elements 113 through 118:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;{&amp;quot;Nh&amp;quot;, &amp;quot;Fl&amp;quot;, &amp;quot;Mc&amp;quot;, &amp;quot;Lv&amp;quot;, &amp;quot;Ts&amp;quot;, &amp;quot;Og&amp;quot;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You may not, however, use the placeholder three-letter abbreviations for not yet named elements, such as &lt;code&gt;&amp;quot;Uuo&amp;quot;&lt;/code&gt; (Ununoctium).&lt;/p&gt;&#xA;&lt;p&gt;If the input string cannot be expressed by the above abbreviations, you shall return one of the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a falsey value (clearly distinct from element names, in other words &lt;code&gt;A&lt;/code&gt; would not be valid, even though there is no element &amp;quot;A&amp;quot;; something like &lt;code&gt;0&lt;/code&gt;, &lt;code&gt;null&lt;/code&gt;, &lt;code&gt;false&lt;/code&gt;, &lt;code&gt;newline&lt;/code&gt; is fine)&lt;/li&gt;&#xA;&lt;li&gt;an empty string&lt;/li&gt;&#xA;&lt;li&gt;exit without output&lt;/li&gt;&#xA;&lt;li&gt;exit with an error&lt;/li&gt;&#xA;&lt;li&gt;something similarly unambiguous signifying failure and not returning some incorrect output that could be accidentally misinterpreted as an answer &lt;em&gt;(suggestions to make this specification clearer?)&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Possible output, using example input &lt;code&gt;takagi&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;an appropriately capitalized string: &lt;code&gt;TaKAgI&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;a flat array of characters &lt;code&gt;{&amp;quot;T&amp;quot;, &amp;quot;a&amp;quot;, &amp;quot;K&amp;quot;, &amp;quot;A&amp;quot;, &amp;quot;g&amp;quot;, &amp;quot;I&amp;quot;}&lt;/code&gt; with appropriate capitalization.&lt;/li&gt;&#xA;&lt;li&gt;a list of strings (capitalized or not) separated by newlines or as separate members of an array, etc., e.g. &lt;code&gt;ta \n k \n ag \n i&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The rule of thumb is that the division into separate elements must be clear. &lt;em&gt;Please comment if additional clarification is needed!&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;You may assume the input to be a single word consisting only of letters.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Compression is not the intent of this challenge!&lt;/strong&gt; Boiler-plate code that fetches the list of elements from somewhere, hard-coding the lists of abbreviations, assuming the list of abbreviations to be stored in a variable or passed as a second argument to your function is OK and should not be included in the byte count.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Sample input -&amp;gt; sample output&#xA;no -&amp;gt; No             // as in Nobelium, alternatively see next line&#xA;no -&amp;gt; NO             // Nitrogen-Oxygen, either one is valid&#xA;helium -&amp;gt; falsey output&#xA;heliam -&amp;gt; HeLiAm&#xA;fog -&amp;gt; FOg           // If using 118 elements, falsey otherwise.&#xA;ppcg -&amp;gt; falsey       // I'm really, really sorry&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Suggestions of further test cases are appreciated.&lt;/p&gt;&#xA;&lt;p&gt;This is code-golf, shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="46206" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-01T04:35:00.103" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12671" PostTypeId="1" AcceptedAnswerId="12676" CreationDate="2017-05-31T16:26:35.447" Score="-1" ViewCount="205" Body="&lt;p&gt;Okay, I admit the title is a bit cryptic but I couldn't come up with something better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As some of you may have noticed I have started spending a lot more time on code golf answering questions/challenges. I usually prefer to answer in C#, though I have started with a couple of other languages, as that is what I am comfortable using. It's also quite fun using this as a challenge as it is hard to golf to lower byte counts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, as I use C#, and answer late (not usually around when a challenge is posted), my answers tend to get few upvotes. I used to think this was due to me using C# and having a higher byte count but recently I've been noticing that a lot of other answers of similar or higher byte counts get upvotes, most notably JavaScript and Java answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there a &quot;secret&quot; to get more upvotes?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Side note: I don't answer here for the upvotes, I like answering the challenges. But similar to many here I enjoy seeing that little green icon informing me that others liked my solution as well.&lt;/p&gt;&#xA;" OwnerUserId="38550" LastActivityDate="2017-05-31T23:08:40.487" Title="The secret of upvotes" Tags="|discussion|answers|" AnswerCount="1" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="12674" PostTypeId="2" ParentId="12501" CreationDate="2017-05-31T21:51:49.617" Score="-2" Body="&lt;h2&gt;If the compiler crashes, fix it&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If the compiler crashes, you must either use a different compiler or provide a patch for the compiler you are using, such that this is no compiler crash.&lt;/p&gt;&#xA;" OwnerUserId="16842" LastActivityDate="2017-05-31T21:51:49.617" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12676" PostTypeId="2" ParentId="12671" CreationDate="2017-05-31T23:08:40.487" Score="7" Body="&lt;p&gt;Optimizing for upvotes is, unfortunately, quite different from optimizing for providing good answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first thing to note is that although language choice generally is about what you find fun to golf in, and you can compete among other people who use the same language, voters tend to favour programs which &lt;em&gt;look&lt;/em&gt; golfed. Typically, this implies being as unreadable as possible, which gives golfing languages something of an advantage. (The unreadability of golfing languages is a bit of a problem here, as most people can't determine whether a golfing language entry is well-golfed or not; so they often just get upvoted indiscriminately.) People also tend to upvote entries which use languages they're familiar with, which would be another disadvantage of C# on a site like this. Finally, people tend to upvote entries in languages which are particularly fitting for the challenge; C# tends to do badly on this metric too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answering a challenge quickly is one of the most vital things for getting upvotes, though. The vast majority of interesting challenges on PPCG end up on the Hot Network Questions list, and get a lot of drive-by upvotes from other Stack Exchange sites (presumably mostly Stack Overflow, as it's by far the largest). If your answer isn't in while the challenge is on HNQ, it's unlikely to ever get the opportunity to score highly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another way to get more upvotes is to get more people looking at your answer. Probably the least abusive way to do this is to give useful feedback on other people's answers; that'll not only get them looking at the challenge (and thus possibly competing answers), but when they edit their answers to incorporate your feedback, they'll bump the post and more people will see your answer as a consequence. I've gotten quite a bit of reputation from this trick, but because it ends up improving the site as a whole, it doesn't even seem particularly underhanded.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, answers to easy challenges tend to get more upvotes than answers to hard challenges. This is clearly backwards (answering a hard challenge tends to be more impressive!), but also pretty easy to explain: easy challenges have a lot more people attempting them (often multiple times), and thus a lot more people see the other answers to the same challenge. (An exception: if the challenge is &lt;em&gt;so&lt;/em&gt; easy that your answer gets pushed back to page 2 on both &quot;votes&quot; and &quot;active&quot;, it's unlikely to ever see the light of day unless it's the subject of a bounty.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In order to get &lt;em&gt;really&lt;/em&gt; high vote totals (100+), an answer normally needs to abuse the challenge specification in some way, or else optimise for something other than what the challenge is asking for. Such answers also have a risk of being downvoted and deleted. (Occasionally, such answers are highly &lt;em&gt;up&lt;/em&gt;voted and yet deleted anyway when a diamond moderator notices they break the rules.) About the best you can do is conclude that Stack Exchange voting incentives are completely messed up, and stop worrying about the votes.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-05-31T23:08:40.487" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12677" PostTypeId="2" ParentId="12575" CreationDate="2017-06-01T10:01:58.903" Score="9" Body="&lt;p&gt;This answer is intended as community submission describing the target functionality. This will likely change over time, but it will allow devs to have a end goal with their program.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Obviously, this includes the standards (doing anything you would normally be able to do on the site), but also the below:&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Better Sandbox&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The Sandbox should load smoothly, be easy to use, and should NOT show deleted answers.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;TIO Integration&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Allowing users to test their code on the run would be infinitely helpful, since normally you'd have to wait until you had computer access. This would also make editing answers easier to do, since the answer can then be modified with the modified TIO-generated permalink.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Automatic Leaderboards&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is not only much more convenient than a Stack Snippet but also will be on every code-golf post, not just the ones with the Stack Snippet.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Improve Answer Sorting&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;There are two parts to this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Firstly, adding sort by byte count (for code golf)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The default sort option should by changed for specific tags. For example, when the challenge is tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the default sort should be by byte count&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;While possibly slightly more difficult, it might be worth adding a sort by score option for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Stack Snippet Support&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is probably impossible on a mobile device due to the requirement of JavaScript, HTML and CSS, but basically, it would be useful for when people post submissions in JS, to be able to run any stack snippets that they include in their answer.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Monospaced Font&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;It would be &lt;em&gt;very&lt;/em&gt; useful for the app to use a monospaced font when writing answers and questions. This will allow code breakdowns and ASCII art to be designed in-situ. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Similarly, code blocks should use monospaced font.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="30525" LastEditDate="2017-06-05T08:03:48.650" LastActivityDate="2017-06-05T08:03:48.650" CommentCount="12" CommunityOwnedDate="2017-06-01T10:01:58.903" ContentLicense="CC BY-SA 3.0" />
  <row Id="12680" PostTypeId="1" CreationDate="2017-06-01T14:40:51.063" Score="2" ViewCount="114" Body="&#xA;&#xA;&lt;p&gt;Are we allowed to have multiple functions without the verbose Func-parts which are calling each other as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; submission?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, in Java 8+ this is an allowed answer based on the current meta:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-java prettyprint-override&quot;&gt;&lt;code&gt;n-&amp;gt;doSomethingWithInput&#xA;&#xA;// Which is short for this (Integer parameter &amp;amp; String return-type):&#xA;Function&amp;lt;Integer,String&amp;gt;f=n-&amp;gt;doSomethingWithInput;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;But what if we call one method inside another (1):&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-java prettyprint-override&quot;&gt;&lt;code&gt;n-&amp;gt;f(n)+doSomethingMore&#xA;f=n-&amp;gt;doSomethingWithInput&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Are we allowed to post this above, or should we post this instead (2):&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-java prettyprint-override&quot;&gt;&lt;code&gt;n-&amp;gt;f.apply(n)+doSomethingMore&#xA;Function&amp;lt;Integer,String&amp;gt;f=n-&amp;gt;doSomethingWithInput;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or shorter using a regular method instead of lambda (3):&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-java prettyprint-override&quot;&gt;&lt;code&gt;n-&amp;gt;f(n)+doSomethingMore&#xA;void f(int n){return doSomethingWithInput;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or should it be this instead perhaps (4):&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-java prettyprint-override&quot;&gt;&lt;code&gt;n-&amp;gt;f.g(n)+doSomethingMore&#xA;F f=n-&amp;gt;doSomethingWithInput;&#xA;&#xA;// Where F is an interface like this:&#xA;interface F{String g(int n);}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or should it be this instead (thanks @MartinEnder) (5):&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-java prettyprint-override&quot;&gt;&lt;code&gt;f=n-&amp;gt;g(n)+doSomethingMore&#xA;g=n-&amp;gt;doSomethingWithInput&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;Personally I'd say (1) should be allowed, or perhaps (4). (For now I've used (3) in some recent Java 8 answer.)&lt;/s&gt;&lt;br&gt;&#xA;My vote goes to (5), because you clearly see there are two methods (&lt;code&gt;f&lt;/code&gt; and &lt;code&gt;g&lt;/code&gt;), and function &lt;code&gt;f&lt;/code&gt; is calling &lt;code&gt;g&lt;/code&gt;).&lt;/p&gt;&#xA;" OwnerUserId="52210" LastEditorUserId="52210" LastEditDate="2017-06-01T15:12:01.217" LastActivityDate="2017-07-07T14:52:16.680" Title="Multiple functions without leading/trailing mandatory parts?" Tags="|discussion|code-golf|" AnswerCount="2" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="12681" PostTypeId="1" AcceptedAnswerId="12696" CreationDate="2017-06-01T14:46:53.017" Score="22" ViewCount="2084" Body="&lt;p&gt;Let's say a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge is asking for a program without arguments or function without parameters. Are we allowed to take an empty parameter instead we won't use anywhere?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As example: In Java 8+ when we take no input in our lambda we do this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;()-&amp;gt;doSomething&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And when we have a lambda which does take a single input, we do this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;n-&amp;gt;doSomething&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As you can see, the second is one byte shorter than the first. Because of that I created this meta-post with the following question: Are we allowed to use the second (where &lt;code&gt;n&lt;/code&gt; is &lt;code&gt;0&lt;/code&gt;, &lt;code&gt;&quot;&quot;&lt;/code&gt;, &lt;code&gt;null&lt;/code&gt;, or any random value at all, which we don't use in the function), when a program/function without arguments is asked?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;EDIT: Please note that by unused empty parameter, I indeed mean unused. For example, you could use an empty parameter which you don't use directly in your code, but still use it for it's &lt;code&gt;static&lt;/code&gt; functions, like (where &lt;code&gt;String s=null&lt;/code&gt;) &lt;code&gt;s-&amp;gt;s.join(...)&lt;/code&gt;, which should be &lt;code&gt;s-&amp;gt;&quot;&quot;.join(...)&lt;/code&gt; instead. For Java &lt;a href=&quot;https://docs.oracle.com/javase/7/docs/api/java/lang/Void.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;Void&lt;/code&gt;&lt;/a&gt; might be useful to use as unused parameter, since it has no additional &lt;code&gt;static&lt;/code&gt; uses.&lt;br&gt;&#xA;Other unused parameters could be used in other languages, as long as they are indeed empty and unused.&lt;/p&gt;&#xA;" OwnerUserId="52210" LastEditorUserId="66833" LastEditDate="2021-05-06T20:46:40.137" LastActivityDate="2021-05-06T20:46:40.137" Title="Are we allowed to use empty input we won't use when no input is asked (regarding functions)?" Tags="|discussion|code-golf|java|" AnswerCount="1" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="12682" PostTypeId="2" ParentId="2140" CreationDate="2017-06-01T20:09:04.070" Score="0" Body="&lt;h1&gt;How many substitutions till palindromization?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/palindrome&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;palindrome&amp;#39;&quot; rel=&quot;tag&quot;&gt;palindrome&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a string, find the minimum number of character substitutions needed so that the string is a palindrome.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;E.g. the string &lt;code&gt;abchefa&lt;/code&gt; needs 2 substitutions, so it can take any of the following paths:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abchefa -&amp;gt; afchefa -&amp;gt; afehefa&#xA;                   -&amp;gt; afchcfa&#xA;        -&amp;gt; abehefa -&amp;gt; afehefa&#xA;                   -&amp;gt; abeheba&#xA;        -&amp;gt; abchcfa -&amp;gt; afchcfa&#xA;                   -&amp;gt; abchcba&#xA;        -&amp;gt; abcheba -&amp;gt; abeheba&#xA;                   -&amp;gt; abchcba&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You must return a minimal number, e.g. &lt;code&gt;abc&lt;/code&gt; can use 3 substitutions (&lt;code&gt;abc -&amp;gt; dbc -&amp;gt; ddc -&amp;gt; ddd&lt;/code&gt;) but it really only needs 1 (&lt;code&gt;abc -&amp;gt; aba&lt;/code&gt;) so you must return 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The string will only contain printable ASCII, no newlines.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additional testcases:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input&#xA;Output&#xA;&#xA;&#xA;0&#xA;&#xA;A&#xA;0&#xA;&#xA;!@&#xA;1&#xA;&#xA;1234567890&#xA;5&#xA;&#xA; !&quot;#$%&amp;amp;'()*+,-./0123456789:;&amp;lt;=&amp;gt;?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~&#xA;47&#xA;&#xA;aaabaaacaqadaaq&#xA;3&#xA;&#xA;o_O WTF RLY?!&#xA;6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can take the string as a string or as a list of chars, but not as a list of strings&lt;/li&gt;&#xA;&lt;li&gt;You must return a minimal value in a generally accepted output format.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2017-06-01T20:09:04.070" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12683" PostTypeId="1" CreationDate="2017-06-01T22:13:08.010" Score="2" ViewCount="149" Body="&lt;p&gt;When solving a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;, a program takes an input and either accepts or rejects it. How is accepting and rejecting defined for the purposes of code golf?&lt;/p&gt;&#xA;" OwnerUserId="16842" LastActivityDate="2017-08-01T01:10:13.377" Title="What is accepting and rejecting?" Tags="|discussion|" AnswerCount="2" CommentCount="0" ClosedDate="2017-08-02T01:49:49.560" ContentLicense="CC BY-SA 3.0" />
  <row Id="12684" PostTypeId="2" ParentId="12683" CreationDate="2017-06-01T22:13:08.010" Score="0" Body="&lt;h2&gt;The programmer chooses either to output a truthy/falsey value, or to crash or not crash&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The programmer picks between two options:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Their program always outputs a truthy/falsey value. If it corresponds to true, it has accepted the input. If it corresponds to false, it has rejected the input. (If it does not output a truthy value, it has neither accepted nor rejected the input, and, depending on the question, is probably incorrect.)&lt;/li&gt;&#xA;&lt;li&gt;Their program either terminates with no errors or with errors. If it terminates with no errors, it has accepted the input. If it terminates with errors, it has rejected the input. (If it does not terminate, it has neither accepted nor rejected the input, and, depending on the question, is probably incorrect.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="16842" LastEditorUserId="16842" LastEditDate="2017-06-02T00:07:14.730" LastActivityDate="2017-06-02T00:07:14.730" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12685" PostTypeId="2" ParentId="12683" CreationDate="2017-06-01T22:59:48.850" Score="1" Body="&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; challenges, solutions output one of two distinct outputs, depending on the properties of the input. &quot;Accepting&quot; and &quot;rejecting&quot; can be mapped to those two distinct outputs - one represents acceptance, and the other represents rejection. How the mapping is done depends on the challenge - if the challenge is of the &quot;Does the input have property X&quot; variety, then the &quot;accepted&quot; output is whichever output is given for inputs with the property, and the &quot;rejected&quot; output is the other one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For challenges of the form &quot;Is the input part of set X or set Y&quot;, it's less clear (especially if X and Y are not complements of each other). But, in those challenges, there's not really a need to distinguish &quot;acceptance&quot; from &quot;rejection&quot; (and if there is, the challenge can be rephrased as &quot;Does the input belong to set X?&quot;).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-06-01T22:59:48.850" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12686" PostTypeId="2" ParentId="12507" CreationDate="2017-06-01T23:21:58.690" Score="0" Body="&lt;h1&gt;Vague idea: improve search&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Imagine having to answer an old challenge, which has 3 pages of answers. I assume you should never post a duplicate answer (at least I never would).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Before posting your code, you should look through all the answers, &lt;strong&gt;filter those that are in your language&lt;/strong&gt;, and check whether your answer adds anything new.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd be happy if we had a &quot;search for answer in a particular language&quot; possibility, but I cannot define what exactly it should do. Moreover, this feature has been needed for a long time now, seeing that the competition across languages is usually meaningless.&lt;/p&gt;&#xA;" OwnerUserId="25315" LastActivityDate="2017-06-01T23:21:58.690" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12690" PostTypeId="2" ParentId="2140" CreationDate="2017-06-02T09:50:24.097" Score="1" Body="&lt;h1&gt;Let's not collide&lt;/h1&gt;&#xA;&lt;h3&gt;&lt;em&gt;Contextualization&lt;/em&gt;&lt;/h3&gt;&#xA;&lt;p&gt;You might have heard about &lt;a href=&quot;https://en.wikipedia.org/wiki/Re-Volt&quot; rel=&quot;nofollow noreferrer&quot;&gt;Re-Volt&lt;/a&gt;, a pretty old video game. Its collision system for cars is somewhat interesting : the body of the vehicle gets transformed into a simplified 3d convex shape which is then filled with spheres.&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/hZiaZ.jpg&quot; alt=&quot;Example&quot; /&gt;&lt;/p&gt;&#xA;&lt;h3&gt;&lt;em&gt;Challenge&lt;/em&gt;&lt;/h3&gt;&#xA;&lt;p&gt;Your objective is to produce a code that will, provided a 2d shape and the number of wanted circles, output a similar result to the picture above. That is represent the polygon as accurately as possible with circles.&lt;/p&gt;&#xA;&lt;p&gt;The two dimensional shape shall be a convex polygon of N vertices. The spheres will of course have the position and the diameter your code defines as optimal.&lt;/p&gt;&#xA;&lt;p&gt;Your code should be able to take an input representing any irregular convex polygon (the format matters little as long as it can process at least a 10-vertices shape) and an input corresponding to the number of spheres that should fill the polygon.&lt;/p&gt;&#xA;&lt;p&gt;Because it is impossible to fill completely and perfectly an N-gon with a finite amount of spheres, a tolerance is of course needed so your circles may have a portion (&amp;lt;10%) located outside the polygon. The circles may (and probably should) intersect at some points.&lt;/p&gt;&#xA;&lt;p&gt;The output must be graphical.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;em&gt;Test cases&lt;/em&gt;&lt;/h3&gt;&#xA;&lt;p&gt;You should test your code with the following three polygons and with 5, 10 and 25 circles.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Polygon n°1&lt;/strong&gt; (10 vertices)&lt;/p&gt;&#xA;&lt;p&gt;[[1,0],[7.5,0],[15,0],[15.5,1.5],[15,2],[7,4],[4,4],[0.75,2.75],[0,2],[0.25,0.5]]&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Polygon n°2&lt;/strong&gt; (5 vertices)&lt;/p&gt;&#xA;&lt;p&gt;[[0,0],[11,0],[11,2],[7,4],[0,4]]&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Polygon n°3&lt;/strong&gt; (8 vertices)&lt;/p&gt;&#xA;&lt;p&gt;[[1,0],[15,0],[15.5,1],[15,2.5],[10,4.5],[2,4.5],[1,4],[0.5,1]]&lt;/p&gt;&#xA;&lt;h3&gt;&lt;em&gt;Questions&lt;/em&gt;&lt;/h3&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;• Are the rules and the objectives clear enough ? Does the challenge make sense ?&lt;/p&gt;&#xA;&lt;p&gt;• How should I define a winner (is a winner mandatory) ?&lt;/p&gt;&#xA;&lt;p&gt;• Is it a good idea to leave the choice of the input to the coder ?&lt;/p&gt;&#xA;&lt;p&gt;• Does this challenge already exist and this is a duplicate of some sort ?&lt;/p&gt;&#xA;&lt;p&gt;• Are there any english mistakes ?&lt;/p&gt;&#xA;&lt;p&gt;• Is the challenge actually a realistic thing to suggest ?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Any and all suggestions are welcome since this is my first post here.&lt;/p&gt;&#xA;" OwnerUserId="70194" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-02T09:50:24.097" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12693" PostTypeId="2" ParentId="9782" CreationDate="2017-06-02T16:24:42.580" Score="2" Body="&lt;p&gt;I think that option 3 (Do nothing/Downvote) is the best option.  Here's my case for it:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I feel that this is not really a problem specifically with Kolmogorov complexity but rather with easy or trivial challenges in general. Every easy challenge can potentially have really boring, low effort, answers.  Often these are not serious contenders, sometimes they are.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Our site policy for such answers at the moment seems to be just to downvote them.  I don't see why a special exception should be made for Kolmogorov complexity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think that this issue is less prevalent on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/komogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;komogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;komogorov-complexity&lt;/a&gt; questions than elsewhere.  On Kolmogorov questions, the answer is either&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Not competitive, which is grounds for deletion&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Competitive, meaning the challenge is probably bad anyway.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think that there is not much of an issue with the way things are being handled now.  I think that just downvoting boring answers will promote fewer bad answers and downvoting challenges that allow bad answers to be competitive will promote fewer of those types of challenges.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-06-02T16:24:42.580" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12694" PostTypeId="2" ParentId="12637" CreationDate="2017-06-02T18:10:14.790" Score="0" Body="&lt;p&gt;Wouldn't it be a relatively easy process to delete Sandbox proposals based on a set of criteria? The criteria could be agreed upon within the community but it could be something like:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the challenge has been made official by posting it onto the main site&lt;/li&gt;&#xA;&lt;li&gt;the sandbox post has been in an inactive state beyond a predetermined period of time (could be one year, say)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This solves the problem of it being unreasonably large.&lt;/p&gt;&#xA;" OwnerUserId="29547" LastActivityDate="2017-06-02T18:10:14.790" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12695" PostTypeId="2" ParentId="12680" CreationDate="2017-06-02T18:10:30.760" Score="-3" Body="&lt;h1&gt;Your code needs to compile&lt;/h1&gt;&#xA;&lt;p&gt;Some minor tweaks:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;n-&amp;gt;doSomethingWithInput&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This actually isn't allowed.  You are in a manifestly-typed language.  &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11223/untyped-functions-in-static-langauges&quot;&gt;You have to declare the type of the input&lt;/a&gt;.  So, this looks like: &lt;code&gt;(int n)-&amp;gt;doSomethingWithInput&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;// Which is short for this (Integer parameter &amp;amp; String return-type):&#xA;Function&amp;lt;Integer,String&amp;gt;f=n-&amp;gt;doSomethingWithInput;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;It isn't shorthand, the two statements mean different things.  &lt;strong&gt;The former is a literal function.  The latter is an assignment of a function into a variable.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;As for the rest of your examples, none of them are valid Java code, so none of them are acceptable.&lt;/p&gt;&#xA;&lt;p&gt;Some valid submissions:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(int n)-&amp;gt;n   &#xA;// Function literal.  If you paste this anywhere that wants a function literal, it'll work.&#xA;&#xA;&#xA;Function&amp;lt;Integer,Integer&amp;gt;f=n-&amp;gt;n; &#xA;// Assigning function to a variable.  If you use this variable, it'll just work&#xA;&#xA;Function&amp;lt;Integer,Integer&amp;gt;f=n-&amp;gt;n&#xA;Function&amp;lt;Integer,Integer&amp;gt;g=n-&amp;gt;f(n);&#xA;// Two functions, and the second uses the first.&#xA;// You'll need to indicate which variable to use in the post&#xA;&#xA;&#xA;F f=n-&amp;gt;doSomethingWithInput;&#xA;Function&amp;lt;Integer, String&amp;gt; n-&amp;gt;f.g(n)+doSomethingMore&#xA;interface F{String g(int n);}&#xA;// Because Java only allow 1 interface/class per file, I think we allow them to be inline. &#xA;// I may be wrong, and I can't find a meta post on it&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Some invalid submissions:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Function&amp;lt;Integer,Integer&amp;gt;f=n-&amp;gt;n&#xA;n-&amp;gt;f(n)&#xA;// This code doesn't compile, no matter where you put it.  &#xA;// You can't put it where a function literal is required, &#xA;// You can't put it where statements are required&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The above example basically covers all of your examples.  If you are able to copy/paste it, and have it compile, it's valid.  (Excepting for inline classes/interfaces)&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-02T18:10:30.760" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12696" PostTypeId="2" ParentId="12681" CreationDate="2017-06-02T18:17:20.090" Score="20" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Building off of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7172/20198&quot;&gt;Martin's great post&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your program takes extra input, that input must be empty.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the case of Java, this is easy:  Objects must be null, and primitives must have their default values.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;That said, it is far harder to abuse extra parameters for golfing because &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11224/20198&quot;&gt;lambdas require types&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(int n)-&amp;gt;doSomething  //5 extra bytes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;/s&gt;&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2017-09-13T14:13:32.547" LastActivityDate="2017-09-13T14:13:32.547" CommentCount="17" ContentLicense="CC BY-SA 3.0" />
  <row Id="12697" PostTypeId="2" ParentId="6918" CreationDate="2017-06-02T19:56:17.717" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/beta-decay/noether&quot; rel=&quot;nofollow noreferrer&quot;&gt;Noether&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Noether is stack-based, semi-golfing language designed by myself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Based mainly on Fourier, Noether is stack-based and uses reverse polish notation. These two facts make Noether a lot more powerful than Fourier, mainly because it means that strings and integers can be stored and manipulated alike. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Similarly, Noether's functions are overloaded based on the type of the arguments. For example, the function &lt;code&gt;L&lt;/code&gt; has two functions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When passed a string, &lt;code&gt;L&lt;/code&gt; returns the length of the string.&lt;/li&gt;&#xA;&lt;li&gt;When passed a number, &lt;code&gt;L&lt;/code&gt; returns the base 10 logarithm of the number&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;As a result, Noether can be used more widely and is wholly more usable language whilst still being quite similar to Fourier.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Links:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Github link&lt;/strong&gt;: &lt;a href=&quot;https://github.com/beta-decay/noether&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://github.com/beta-decay/noether&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Online interpreter:&lt;/strong&gt; &lt;a href=&quot;https://beta-decay.github.io/noether&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://beta-decay.github.io/noether&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2017-06-02T19:56:17.717" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12698" PostTypeId="2" ParentId="2140" CreationDate="2017-06-02T20:28:54.067" Score="0" Body="&lt;h1&gt;Help me golf my numbers! (Part 2) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Thanks for all your help in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/124192/help-me-golf-my-numbers-part-1&quot;&gt;Part 1&lt;/a&gt;! I recently just found out that my language also supports expressions, and we can use those to make our numbers even shorter!&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a &lt;em&gt;full program&lt;/em&gt; that takes in a list of integers less than 2^53-1. For each integer, rewrite it in the shortest way possible using expressions, and output the result.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Allowed operators&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The operators below are given in order of precedence from highest to lowest, with groups separated by empty lines. (These precedence levels are the same as Python.) All binary operators are left-associative, except exponentiation, which is right-associative. Note that some operators are two bytes in length.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;**: Exponentiation&#xA;&#xA;* : Multiplication&#xA;/ : Integer Division&#xA;% : Modulus&#xA;&#xA;+ : Addition&#xA;- : Subtraction&#xA;~ : Bitwise NOT&#xA;&#xA;&amp;lt;&amp;lt;: Left shift&#xA;&amp;gt;&amp;gt;: Right shift&#xA;&#xA;&amp;amp; : Bitwise AND&#xA;&#xA;^ : Bitwise XOR&#xA;&#xA;| : Bitwise OR&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You may use decimal, hexadecimal, or scientific notation to represent integers in your output (the answers to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/124192/help-me-golf-my-numbers-part-1&quot;&gt;Part 1&lt;/a&gt; will help you choose the shortest representation for each integer). You may also use parentheses to group subexpressions.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I will post a list of 1000 integers to be used as the test battery. A program's score will be the size of the output for the provided test, where the lowest score wins. A solutions is invalid if any of the expressions do not evaluate to the given integer. There will also be an execution time limit of 20 minutes for all 1000 inputs (roughly 1 second per input) in order to discourage brute-force solutions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Numbers for the test battery will be chosen according to the following algorithm:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def choose():&#xA;    msb = randint(0, 52)&#xA;    return randint(0, 1 &amp;lt;&amp;lt; msb)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;with duplicates filtered out.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is there anything here that can be clarified?&lt;/li&gt;&#xA;&lt;li&gt;Anything else that can make this challenge more fun?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="69054" LastEditorUserId="69054" LastEditDate="2017-06-03T18:34:24.740" LastActivityDate="2017-06-03T18:34:24.740" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="12699" PostTypeId="2" ParentId="2140" CreationDate="2017-06-02T21:12:59.810" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/124565/68615&quot;&gt;Print a shuffled deck of cards&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="53551" LastEditorUserId="68615" LastEditDate="2017-06-05T00:17:27.827" LastActivityDate="2017-06-05T00:17:27.827" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="12701" PostTypeId="2" ParentId="2140" CreationDate="2017-06-03T02:06:18.047" Score="0" Body="&lt;h2&gt;Reverse divmod&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;The &lt;code&gt;divmod&lt;/code&gt; function is one that is included in many standard libraries and is defined as follows:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/zGqri.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/zGqri.gif&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Or, in other words, &lt;code&gt;divmod(a,b)&lt;/code&gt; returns a list containing the integer quotient of &lt;code&gt;a/b&lt;/code&gt; (i.e. &lt;code&gt;floor(a/b)&lt;/code&gt;) and &lt;code&gt;mod(a,b)&lt;/code&gt; (i.e. the remainder in the division of &lt;code&gt;a/b&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is not to &lt;em&gt;implement&lt;/em&gt; the &lt;code&gt;divmod&lt;/code&gt;function, but rather &lt;em&gt;reverse&lt;/em&gt; it.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;You will take two integers &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; as input, in any reasonable input format (two integers, list, etc.). Both &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; are guaranteed to be in the range &lt;code&gt;-2^31&lt;/code&gt; to &lt;code&gt;2^31-1&lt;/code&gt;, inclusive.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;The output of your code shall be two integers, in any reasonable output format (two integers, list, etc.). Note that you must output the two integers in such a way that a human is able to distinguish one from another.&#xA;These two integers should be an &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; such that &lt;code&gt;divmod(a,b)==(x,y)&lt;/code&gt; (i.e. &lt;code&gt;floor(a/b)==x &amp;amp;&amp;amp; mod(a,b)==y&lt;/code&gt;). Please specify in your answer how these two integers are outputted if it is not immediately clear (for example, if you output &lt;code&gt;b&lt;/code&gt; before &lt;code&gt;a&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;p&gt;Remember that this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest solution in bytes wins!&lt;/p&gt;&#xA;" OwnerUserId="36670" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-03T02:06:18.047" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12705" PostTypeId="2" ParentId="2140" CreationDate="2017-06-03T12:37:05.467" Score="1" Body="&lt;h1&gt;Fairly Cut a Ham Sandwich in Half&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge we consider a discrete version of the &lt;a href=&quot;https://en.wikipedia.org/wiki/Ham_sandwich_theorem&quot; rel=&quot;nofollow noreferrer&quot;&gt;ham sandwich theorem&lt;/a&gt;. In our case the theorem says: &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Given two sets of points in a plane, there is a line that simulaneously bisects both sets.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So given two disjoint sets of distinct integral points in the plane, your task is finding a line of the form &lt;code&gt;a*x + b*y = c&lt;/code&gt; that bisects these two sets and outputs the integers &lt;code&gt;a,b,c&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Both (strict) half planes have to contain the same number of points of per set. &lt;/li&gt;&#xA;&lt;li&gt;The line can contain input points, these are then not counted to either of the sides (e.g. when a set contains an odd number of points, or all points are on one line.)&lt;/li&gt;&#xA;&lt;li&gt;The line is not necessarily unique. &lt;/li&gt;&#xA;&lt;li&gt;The mentioned representation of a given line is unique up to an&#xA;integral multiple (e.g. &lt;code&gt;(m*a)*x + (m*b)*y = (m*c)&lt;/code&gt; represents the&#xA;same line as above), but you do not have to output the fully reduced&#xA;form.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;As we said above, the output is not necessarily unique, so the presented outputs here are just examples. All the outputs are give in the form &lt;code&gt;a,b,c&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: [(1,2),(1,4),(2,1),(2,3),(3,2),(3,4),(4,1),(4,3)] [(1,1),(1,3),(2,2),(2,4),(3,1),(3,3),(4,2),(4,4)]&#xA;Output: 410,640,2625 (410x + 640y = 2624)&#xA;        1,1,5 (x+y=5)&#xA;        0,2,5 (2y=5)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In the following we see three valid outputs:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/e0xZF.jpg&quot; width=&quot;200&quot; /&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: [(1,1),(2,2)] [(1,2),(2,1)]  &#xA;Output: 2,5,10 (2x+5y = 10)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(more to be added)&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2017-06-03T13:33:12.327" LastActivityDate="2017-06-03T13:33:12.327" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12707" PostTypeId="1" CreationDate="2017-06-03T14:40:45.187" Score="13" ViewCount="847" Body="&lt;p&gt;I  like to ask &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; questions.  However, I don't want to run everyone's code on my PC, partly because I only have access to a slow Windows laptop at the moment  and I can't imagine I could even run most code in most languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it acceptable to ask people to include a &lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt; link in their answers and to use TIO's timer facility?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If so, does anyone have recommendations for how best to do this to make the challenges fair?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another option is just to ask people to report the largest input size they can solve on their own computers. However some people dislike this as it advantages people with faster computers.&lt;/p&gt;&#xA;" OwnerDisplayName="user9206" LastActivityDate="2017-06-14T23:43:43.917" Title="Is TIO acceptable for fastest-code questions?" Tags="|discussion|" AnswerCount="4" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12708" PostTypeId="2" ParentId="12707" CreationDate="2017-06-03T15:10:23.997" Score="22" Body="&lt;p&gt;Unfortunately, I don't think TIO is a very reliable way of timing code, even if counting CPU time rather than wall time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First of all, TIO uses multiple arena servers, where all user-supplied code is run. At point, there are only two arenas and both have identical specs, but even now, one of them is consistently and considerably slower than the other. I have no idea &lt;em&gt;why&lt;/em&gt; this happens, but it does.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also – and this applies to &lt;em&gt;all&lt;/em&gt; method of timing code – two processes running at the same time can affect each other in subtle ways that will impact CPU time. E.g., speed of memory access may be affected, especially if the data should already be in the CPU's cache, but was pushed out by another process. Computers also tend to be measurably faster after a restart.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, running code on TIO is still better than having everyone time their code on their own machines. I wouldn't even consider the latter an &lt;em&gt;objective&lt;/em&gt; winning criterion for a fastest-code challenge.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2017-06-03T15:12:55.953" LastActivityDate="2017-06-03T15:12:55.953" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="12710" PostTypeId="2" ParentId="2140" CreationDate="2017-06-03T20:39:16.540" Score="0" Body="&lt;h2&gt;Insert a simulated Ken Thompson virus into a program &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-generation&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-generation&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;http://wiki.c2.com/?TheKenThompsonHack&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ken Thompson virus&lt;/a&gt; is a virus that infects your compiler and other programs. Since it infects all your tools, you can not detect it without using tools from before the virus was introduced.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your will create a prototype for inserting the Ken Thompson virus into code. The goal of this virus will be to allow you to (fake) destroy any computer running a program infected with it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Inserting a Ken Thompson virus is defined as follows. Start with an input program &lt;code&gt;P&lt;/code&gt;. Your program will output a modified program &lt;code&gt;Q&lt;/code&gt; that works as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the input to &lt;code&gt;Q&lt;/code&gt; is &lt;code&gt;aNouIQ5xKvUfdZVzo0Xs&lt;/code&gt;, it will output &lt;code&gt;BOOM&lt;/code&gt; (in a real Ken Thompson virus, this would actually do something bad, but since it this is a fake virus, outputing &lt;code&gt;BOOM&lt;/code&gt; is done instead).&lt;/li&gt;&#xA;&lt;li&gt;For any other input to &lt;code&gt;Q&lt;/code&gt;, run program &lt;code&gt;P&lt;/code&gt; with that input&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the output of &lt;code&gt;P&lt;/code&gt; is valid source code in the language you are using, insert the Ken Thompson virus into it and then &lt;code&gt;Q&lt;/code&gt; will output the resulting infected program.&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, the output of &lt;code&gt;Q&lt;/code&gt; is just the output of &lt;code&gt;P&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You will write a program that takes &lt;code&gt;P&lt;/code&gt;'s code as input and produces &lt;code&gt;Q&lt;/code&gt;'s code as output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can use either a currently (at the time of this post) existing programming language, or a subset of one, for this challenge. (The idea is that language you are using would be the target language of some self-compiling compiler, but this is not required.) Since you want to be as subtle as possible, the shortest code (in bytes) wins!&lt;/p&gt;&#xA;" OwnerUserId="16842" LastEditorUserId="16842" LastEditDate="2017-06-03T21:18:23.307" LastActivityDate="2017-06-03T21:18:23.307" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12711" PostTypeId="1" CreationDate="2017-06-03T20:43:39.783" Score="-4" ViewCount="86" Body="&lt;p&gt;Instead of posting all our drafts to the Sandbox, could we just add a draft feature to the main site?&lt;/p&gt;&#xA;" OwnerUserId="16842" LastEditorUserId="68942" LastEditDate="2021-06-09T05:38:12.007" LastActivityDate="2021-06-09T05:38:12.007" Title="Can we get a draft feature?" Tags="|feature-request|status-declined|sandbox|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12713" PostTypeId="2" ParentId="12711" CreationDate="2017-06-03T23:57:17.573" Score="3" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Questions like this would be problems for both the Main site and the Meta site as they cause more problems than they solve.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Main&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Drafts would either get confused as actual posts, causing people to attempt a challenge without a full spec, or they would be closed as off-topic as they wouldn't actually be challenges. This would also encourage new users to post challenges with very bare specs, thinking it was ok given the example we would have set.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;At the moment, the Sandbox has over 1700 undeleted posts in it, and (I think) around 4360 deleted and undeleted total. If this number of questions were asked on meta, genuine questions like this one would disappear into the ether and go unanswered. Not to mention the fact that meta would be flooded with hundreds of posts that, personally, I would close as duplicates of the Sandbox. And when a new user doesn't know about the Sandbox and asks a &quot;read my draft&quot; question on meta, it is quickly shut down as a dupe.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Overall&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;While it could work (probably not), I think that it would&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;cause unnecessary clutter on whatever site they were posted on&lt;/li&gt;&#xA;&lt;li&gt;be closed as either dupes or off topic&lt;/li&gt;&#xA;&lt;li&gt;confuse new users about what the site is designed for (which already happens a lot)&lt;/li&gt;&#xA;&lt;li&gt;degrade the quality of the site in general&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2017-06-04T22:41:59.723" LastActivityDate="2017-06-04T22:41:59.723" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12714" PostTypeId="2" ParentId="1061" CreationDate="2017-06-04T14:31:38.623" Score="14" Body="&lt;h1&gt;Features added to a pre-existing language, after the challenge was posted&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;See &lt;a href=&quot;https://codegolf.stackexchange.com/questions/123685/covfefify-a-string&quot;&gt;Covfefify a string&lt;/a&gt;. This might been solved in 45 bytes using:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;select covfefify(:a) from dual@datadictionary&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This isn't the same as these pre-existing loopholes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Using a made-up language specifically designed for the challenge: it is not a made-up language; it is a programming language in use.&lt;/li&gt;&#xA;&lt;li&gt;Using prior knowledge to circumvent other loopholes: it is not made up.&lt;/li&gt;&#xA;&lt;li&gt;Creating a new compiler for a language after a challenge was posted: it is not creating a new compiler, but extending an existing grammar.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;None of these covers the scenario where an existing language is extended by a new function.&lt;/p&gt;&#xA;" OwnerUserId="70334" LastEditorUserId="70334" LastEditDate="2017-06-04T17:12:02.253" LastActivityDate="2017-06-04T17:12:02.253" CommentCount="4" CommunityOwnedDate="2017-06-04T14:31:38.623" ContentLicense="CC BY-SA 3.0" />
  <row Id="12715" PostTypeId="2" ParentId="12707" CreationDate="2017-06-04T21:48:15.883" Score="12" Body="&lt;p&gt;Dennis already explained why TIO isn't a great choice. The solutions I've seen people use are:&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Cloud providers (e.g. Amazon Web Services' EC2)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Tell people what specs you'll buy, wait a week or so for a batch of answers, then rent one for a few hours to keep the costs tiny (we're talking pence unless you decide your challenge needs immense power). When you're done, delete the instance and move on with your life.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you've never used AWS before you can even rent one small EC2 instance for free during the first year (but keep an eye on the CPU credits for T2 instances or your challenge will be unfair). I imagine most cloud providers (Google &amp;amp; Azure spring to mind) have a similar promotion.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Cheap computers (e.g. Raspberry Pi)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Buy a common dirt-cheap computer and run submissions on it whenever you want — again, tell people in advance what the hardware specs are.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You don't even need to have a screen / keyboard / mouse: just connect it to a network and SSH in (but don't forget the power lead!)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Both of these options set a level playing field and (theoretically) allow people to run their submissions in the target environment in advance. Both come with some cost, but not much for occasional challenges. Another bonus is that these are &lt;em&gt;real world&lt;/em&gt; environments, so through your challenges people may learn something that helps them in their day jobs / uni courses.&lt;/p&gt;&#xA;" OwnerUserId="8927" LastEditorUserId="61384" LastEditDate="2017-06-05T00:42:48.503" LastActivityDate="2017-06-05T00:42:48.503" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12717" PostTypeId="2" ParentId="2140" CreationDate="2017-06-05T00:31:54.207" Score="0" Body="&lt;h1&gt;This question is up for adoption!  If you would like to finish and post it, please include a little mention for @gryphon :)&lt;/h1&gt;&#xA;&lt;h1&gt;Battle of the Bots&lt;/h1&gt;&#xA;&lt;h2&gt;Your Task&lt;/h2&gt;&#xA;&lt;p&gt;Program a bot to compete in a battle with other bots.  Each robot has fifteen flags situated around their exterior.  Your goal is to have at least one flag left on your robot for as long as possible.  Each turn you will move diagonally (or not at all) on a square grid with a width/length equal to the number of bots competing squared (attempting to move off the edge of the grid will result in either you moving adjacent to your previous position, or no movement at all if attempting to move from a corner), and use two or less of the four weapons/shields that are situated facing along the horizontal and vertical rows of the grid.  You will choose which weapon you would prefer to have in each of your four slots at the beginning of the game.  After 2,500 turns, each bot with flags remaining will receive a 500 point bonus, and the game will end.  If all flags have been destroyed before this time, the game will end then.  The winner will be the person with the most points at the end of 1,000 matches.&lt;/p&gt;&#xA;&lt;h2&gt;Your Code&lt;/h2&gt;&#xA;&lt;p&gt;Each bot will begin in a randomly chosen location on the playing field (bots may be on top of each other).  Your code will take the form of two python 2.7 functions, one named (name of your submission) start, which will take no input and return 4 values, one for each weapon/shield slot.  The first value will be the top of the bot, and they will continue in clockwise order.  The integer values to be returned and weapons/shields they represent are shown below:&lt;/p&gt;&#xA;&lt;p&gt;1: Firestarter, a weapon that will start a fire adjacent to the bot.  Fires start at class 1 and increment upward every turn.  If, at the start of a bot's turn they are on top of a fire they lose flags equal to the level of the fire.  If a fire is at level 3, it spreads fires of level 1 to all directly (not diagonally) adjacent squares that are not already on fire.  When a fire reaches level 8, rather than becoming  a level 8 fire, it dies, turning back to an &amp;quot;O&amp;quot; on the map, having used up all available burning material.  It may then be lit on fire again in the future.&lt;/p&gt;&#xA;&lt;p&gt;2: Laser, a weapon that destroys one flag on any bot in a straight line from its firing point outwards from the bot.&lt;/p&gt;&#xA;&lt;p&gt;3: Buzzsaw, a weapon that destroys five flags on any bot adjacent to the bot using it on the side it is used on.&lt;/p&gt;&#xA;&lt;p&gt;4: Shield, a defensive mechanism that protects flags from lasers and buzzsaws, and is unaffected by our next weapon.&lt;/p&gt;&#xA;&lt;p&gt;5: Acid Sprayer, a weapon that destroys the weapon facing it on any bot within three spaces of the bot using it in a straight line (not an arc) from its mounting point&lt;/p&gt;&#xA;&lt;p&gt;Your second function will receive, first the turn number, second a map of the battlefield in a string, with &amp;quot;R&amp;quot; representing robots (including itself), &amp;quot;O&amp;quot; representing empty space, and the level a fire is at representing any fires.  The end of a row will be shown with a semicolon &amp;quot;;&amp;quot;.  For example, if the battlefield looks like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;OORO131OO&#xA;OOOOO1OOO&#xA;ROOOOOOOO&#xA;OOOOOOOOO&#xA;OOOOOOOOO&#xA;OOOOOOOOO&#xA;OOOOOOOOO&#xA;OOOOOROOO&#xA;OOOOOOOOO&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Each bot will receive this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;OORO131OO;OOOOO1OOO;ROOOOOOOO;OOOOOOOOO;OOOOOOOOO;OOOOOOOOO;OOOOOOOOO;OOOOOROOO;OOOOOOOOO&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Next, the bot will receive its X coordinate, and then its Y coordinate, 0 indexed and with the top left corner being 0,0.  Finally, the bot will receive how many flags it has remaining.&lt;/p&gt;&#xA;&lt;p&gt;If multiple bots are in the same square, only a single &amp;quot;R&amp;quot; will be shown.  If a bot is standing on the same square as a fire, only the fire will be shown.  A bot can tell if it is standing on a fire if its own X and Y coordinates show an integer rather than a &amp;quot;R&amp;quot;.&lt;/p&gt;&#xA;&lt;h2&gt;Sample Bots&lt;/h2&gt;&#xA;&lt;p&gt;Will show sample bots here when they are completed&lt;/p&gt;&#xA;&lt;h2&gt;Controller&lt;/h2&gt;&#xA;&lt;p&gt;Will show controller here when it is completed&lt;/p&gt;&#xA;&lt;h2&gt;Additional Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;No copying other bots, or copying with only minor changes.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No messing around with the judging process, other bots, or writing programs to acquire information that does not come from the inputs given to them, randomizers, or other legitimate sources of information.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No writing bots specifically designed to prop up other bots.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Maximum of three submissions per user.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Meta:&lt;/h1&gt;&#xA;&lt;p&gt;Is the explanation clear enough?&lt;/p&gt;&#xA;&lt;p&gt;Are there any loopholes for programs to exploit?&lt;/p&gt;&#xA;&lt;p&gt;Any tags other than &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="69331" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-12T21:05:12.747" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="12720" PostTypeId="2" ParentId="2140" CreationDate="2017-06-05T14:45:47.730" Score="1" Body="&lt;h1&gt;Collatz Bearings&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Everyone knows the collatz conjecture. It is that this function:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/3x_%2B_1_problem&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://wikimedia.org/api/rest_v1/media/math/render/svg/f69ea6c9163eefcadeb36c93a68626610f1f4e75&quot; alt=&quot;Collatz Conjecture&quot; title=&quot;Halve if even, multiply by 3 and add 1 if odd.&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;when repeatedly applied on a positive non-zero integer will reach one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are many ways to visualise this. Inspired by &lt;a href=&quot;https://mathematica.stackexchange.com/a/85731&quot;&gt;this post&lt;/a&gt;, with the original source of this method &lt;a href=&quot;https://www.reddit.com/r/math/comments/38cg9r/a_beautiful_picture_related_to_collatz_conjecture/&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;, this is how we will do it:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Start at 1, with a northward bearing. The next numbers will be one unit (of any, consistent) size, and &lt;code&gt;x&lt;/code&gt; degrees clockwise (+x) if it is even, and &lt;code&gt;x&lt;/code&gt; degrees anticlockwise (-x) if it is odd.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An example of this can be seen here (Though it starts with an eastward bearing). It uses a few hundred random starting points and goes backwards. But it's probably easier to build it backwards.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/70PEH.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/70PEH.png&quot; alt=&quot;Visualisation of the Collatz conjecture&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is a graph-like visualisation, showing the first 8 levels:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/HVN0A.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/HVN0A.png&quot; alt=&quot;First 8 levels&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There can be collisions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to take two numbers, which would correspond to 2 nodes on that tree, and return the bearing of the second node to the first node.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;3 numbers. Positive integer &lt;code&gt;a&lt;/code&gt;, Positive integer &lt;code&gt;b&lt;/code&gt;, and angle &lt;code&gt;x&lt;/code&gt;, in any unit you desire. &lt;code&gt;b &amp;gt; a &amp;gt; 0&lt;/code&gt;, &lt;code&gt;x&lt;/code&gt; is the angle of seperation, in it's simplest form (mod 360 for degrees, mod 2pi for radians, or having the upper half be negative if you wish.) &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; are guaranteed to be in different places (e.g., you won't have &lt;code&gt;a = 20&lt;/code&gt; and &lt;code&gt;b = 21&lt;/code&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Using the method described above, the bearing of &lt;code&gt;b&lt;/code&gt; from &lt;code&gt;a&lt;/code&gt; in the graph, in the units of the input angle.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, so the shortest program in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Note&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If the Collatz Conjecture is eventually proven wrong, you do not need to take inputs where repeated application does not reach 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="48878" LastEditorUserId="48878" LastEditDate="2017-06-06T06:01:23.560" LastActivityDate="2017-06-06T06:01:23.560" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12722" PostTypeId="2" ParentId="2140" CreationDate="2017-06-05T17:09:07.627" Score="2" Body="&lt;h1&gt;Title&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;In your language of choice, write 25 programs, functions, or snippets that output or return the integers 1 through 25, inclusive. However, the goal is to simultaneously minimize the number of distinct chars used and the length of the code.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is a variation on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;: If your 25 entries have &lt;strong&gt;N&lt;/strong&gt; distinct characters and a total length of &lt;strong&gt;L&lt;/strong&gt;, your score is &lt;strong&gt;N × (L + N)&lt;/strong&gt;. &lt;strong&gt;The submission with the lowest score wins.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Say the challenge only went up to 10, and your ten snippets were:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;2&#xA;3&#xA;4&#xA;5&#xA;6&#xA;7&#xA;8&#xA;9&#xA;10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;That's 11 bytes total, and 10 distinct chars; therefore, your final score would be &lt;strong&gt;10 × (11 + 10) = 210&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, if your snippets were:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;1+1&#xA;1+1+1&#xA;1+1+1+1&#xA;1+1+1+1+1&#xA;1+1+1+1+1+1&#xA;1+1+1+1+1+1+1&#xA;1+1+1+1+1+1+1+1&#xA;1+1+1+1+1+1+1+1+1&#xA;1+1+1+1+1+1+1+1+1+1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;That's 100 bytes total, and 2 distinct characters (&lt;code&gt;+&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt;); thus, the final score is &lt;strong&gt;2 × (100 + 2) = 204&lt;/strong&gt;, a small improvement over the literal numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One last example. If your snippets were:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;-~1&#xA;1-~1&#xA;-~1-~1&#xA;1-~1-~1&#xA;-~1-~1-~1&#xA;11-1-1-1-1&#xA;11-1-1-1&#xA;11-1-1&#xA;11-1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;That's 58 bytes total, and 3 distinct chars (&lt;code&gt;-&lt;/code&gt;, &lt;code&gt;~&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt;); therefore, your final score would be &lt;strong&gt;3 × (58 + 3) = 183&lt;/strong&gt;, an improvement over both.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each output may be a string of digits rather than a literal number.&lt;/li&gt;&#xA;&lt;li&gt;Each output may have trailing decimals, as long as they are all &lt;code&gt;0&lt;/code&gt;s (e.g. &lt;code&gt;1.000&lt;/code&gt; is allowed, but &lt;code&gt;1.000001&lt;/code&gt; is not).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is 25 a good number? I originally had it at 100, but that seems a little tedious.&lt;/li&gt;&#xA;&lt;li&gt;Will the scoring system work well enough?&lt;/li&gt;&#xA;&lt;li&gt;Is this even a good idea?&lt;/li&gt;&#xA;&lt;li&gt;Title and tag suggestions?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42545" LastActivityDate="2017-06-05T17:09:07.627" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12723" PostTypeId="2" ParentId="12599" CreationDate="2017-06-05T17:17:52.020" Score="0" Body="&lt;h1&gt;Reward People for Helping in the Sandbox&lt;/h1&gt;&#xA;&lt;p&gt;First off, this is probably a horrible idea.&lt;/p&gt;&#xA;&lt;p&gt;We make a post on main called &amp;quot;Sandbox Rewards&amp;quot; or something like that. Whenever someone posts a constructive comment to a sandbox challenge, they also post an answer to the main post. Then, the person who posted the sandbox challenge then upvotes the person on the main post, giving the main poster rep in exchange for their help.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;This has a lot of problems.&lt;/strong&gt; There is no guarantee that the sandbox-challenge-poster will upvote on main, and this might be confusing for new users. And the main post would technically be off-topic. And there are probably a bunch of problems that I haven't thought of.&lt;/p&gt;&#xA;" OwnerUserId="64159" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-05T17:17:52.020" CommentCount="3" CommunityOwnedDate="2017-06-05T17:17:52.020" ContentLicense="CC BY-SA 3.0" />
  <row Id="12724" PostTypeId="1" CreationDate="2017-06-05T17:43:28.087" Score="7" ViewCount="276" Body="&lt;p&gt;I'm curious, because some answers seem to be posted regardless of the winning answer. Should non-competitive answers be posted when better answers exist &lt;strong&gt;for entries of the same language&lt;/strong&gt;?&lt;/p&gt;&#xA;" OwnerUserId="60951" LastEditorDisplayName="user62131" LastEditDate="2017-06-05T23:13:09.140" LastActivityDate="2017-06-05T23:13:09.140" Title="Should you answer a competitive question if your answer is not competing / is not competitive?" Tags="|discussion|policy|answers|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12729" PostTypeId="2" ParentId="12724" CreationDate="2017-06-05T23:12:35.837" Score="19" Body="&lt;h1&gt;Doing this is reasonable if the answer is significantly different&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If straightforward golfing on your answer would transform it into an answer that already exists, it's not adding anything to the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, if your answer has any sort of significant difference (faster or simply different algorithm, avoiding a specific cheat that's legal according to the question, using a particular subset of the language, etc.), then feel free to post it; if we want answers in more than one language (and we do), I can't see why we wouldn't also want multiple distinct answers in the same language.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-05T23:12:35.837" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="12730" PostTypeId="2" ParentId="1434" CreationDate="2017-06-05T23:31:00.603" Score="-1" Body="&lt;h2&gt;Yes, it's fine&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you can implement an interpreter that can parse a description of a problem in English and solve it, go ahead. But I think you'd have to count the description of the problem in the byte count.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The actual loophole that's implicitly being violated here though is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1071/30512&quot;&gt;https://codegolf.meta.stackexchange.com/a/1071/30512&lt;/a&gt; - you can't use a version of an interpreter newer than the problem. &lt;/p&gt;&#xA;" OwnerUserId="30512" LastActivityDate="2017-06-05T23:31:00.603" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12731" PostTypeId="2" ParentId="2140" CreationDate="2017-06-06T01:10:15.590" Score="0" Body="&lt;h1&gt;Find the Harmonic Mean&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Harmonic_mean&quot; rel=&quot;nofollow noreferrer&quot;&gt;harmonic mean&lt;/a&gt; of a sequence of numbers is the reciprocal of the arithmetic mean of the reciprocal of each number. For example, the harmonic mean of &lt;code&gt;[1, 2, 3]&lt;/code&gt; is &lt;code&gt;1/((1/1+1/2+1/3)/3)&lt;/code&gt; = &lt;code&gt;3/(1/1+1/2+1/3)&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A list/array/tuple/string with some delimeter/etc. of positive integers which fit within the standard integer/float type of your language of choice. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The harmonic mean of those integers, accurate to at least 6 (?) decimal places. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input =&amp;gt; output&#xA;&#xA;1 4 4 =&amp;gt; 2.0&#xA;&#xA;1 2 3 =&amp;gt; 1.63636&#xA;&#xA;527 =&amp;gt; 527.0&#xA;&#xA;52 33 400 =&amp;gt; 52.6548&#xA;&#xA;7 20 333 45 1 =&amp;gt; 4.10481&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="41042" LastActivityDate="2017-06-06T01:10:15.590" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12734" PostTypeId="2" ParentId="12707" CreationDate="2017-06-06T07:44:48.423" Score="9" Body="&lt;p&gt;Here's another alternative:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Ask around to find someone willing to do timings.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm currently running a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenge where the canonical timings are the ones on my computer. I'd be happy to do the timings for your challenge as well, circumstances permitting. Obviously, I can't personally handle timings for every challenge ever, but I'd guess that there are other people willing to time things. There's no reason that the person who posts the challenge needs to be the one who does the timing.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2017-06-06T07:44:48.423" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12735" PostTypeId="2" ParentId="12599" CreationDate="2017-06-06T21:29:54.273" Score="14" Body="&lt;h1&gt;Replace the sandbox with a Main site tag&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;I think this suggestion is doable without any changes to SE.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Introduce a special &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sandbox&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sandbox&amp;#39;&quot; rel=&quot;tag&quot;&gt;sandbox&lt;/a&gt; tag on the Main site which has a description along the lines of:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A proposed challenge. This tag indicates that the challenge is not ready to receive answers, but rather has been posted to receive feedback in the form of comments. When ambiguities, mistakes, contradictions, and other issues have been resolved, the author removes the tag, thus signalling that answers may be posted.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Users can then post sandboxed challenges exactly like they would post open challenges, except they would include the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sandbox&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sandbox&amp;#39;&quot; rel=&quot;tag&quot;&gt;sandbox&lt;/a&gt; tag.&lt;/p&gt;&#xA;&lt;p&gt;Behaviour around sandboxed challenges:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If a user answers a sandboxed challenge, we kindly remind/inform them of its status.&lt;/li&gt;&#xA;&lt;li&gt;If a (new) user posts a challenge which obviously needs sandboxing, we can edit in the tag and kindly inform the poster.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;If it is at all customizable, we could encourage the use of the sandbox tag by including it in the &lt;strong&gt;Tags&lt;/strong&gt; field placeholder text:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;at least one tag (sandbox code-golf string), max 5 tags&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Upsides&lt;/h1&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Sandboxed challenges are as visible as open challenges, thus encouraging peer review and hinting the sandboxing system to newcomers.&lt;/li&gt;&#xA;&lt;li&gt;No need to move posts from the sandbox to main; the tag is just removed in order to &amp;quot;post&amp;quot;.&lt;/li&gt;&#xA;&lt;li&gt;No need to include &lt;code&gt;[tag:code-golf]&lt;/code&gt; etc. in sandboxed posts; proposed challenges can have actual tags (although only four instead of five) with the normal auto-completion and tag description system in effect.&lt;/li&gt;&#xA;&lt;li&gt;The system for detection of duplicates will work.&lt;/li&gt;&#xA;&lt;li&gt;Anyone can see whether a challenge was sandboxed just by looking at the edit history.&lt;/li&gt;&#xA;&lt;li&gt;No more of the Sandbox's &amp;quot;This question has more than 30 answers already.&amp;quot; pop-up.&lt;/li&gt;&#xA;&lt;li&gt;We can use the &lt;strong&gt;FEATURED ON META&lt;/strong&gt; for something productive.&lt;/li&gt;&#xA;&lt;li&gt;Users looking to review sandboxed challenges can easily &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sandbox&quot;&gt;access them&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;No more lag for users on mobile or with the Infinite Scrolling user script.&lt;/li&gt;&#xA;&lt;li&gt;It will still be possible to have New Sandboxed Posts in The Nineteenth Byte either as part of the regular feed, or as a dedicated one, using filters in the RSS feed.&lt;/li&gt;&#xA;&lt;li&gt;When the challenge is opened (by removing the sandbox tag), it is automatically bumped to the top of the Active list (but unfortunately not the &amp;quot;Newest&amp;quot; view) due to the edit.&lt;/li&gt;&#xA;&lt;li&gt;Becomes easy to see if a language was created or modified after the post was first proposed.&lt;/li&gt;&#xA;&lt;li&gt;Challenges which are posted after a sandbox period do not clutter anywhere. (In the current Sandbox, high-rep users see all the deleted posts.)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h1&gt;Downsides&lt;/h1&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Removing the tag bumps to the top in the activity view, but not in the newest view, so there wouldn't be an easy way of finding questions which have recently lost the tag.&lt;/li&gt;&#xA;&lt;li&gt;The HNQ algorithm heavily uses activity since post date, so we'd lose a lot of HNQ questions because they'd have a spike in activity a day after they were posted, instead of a minute after.&lt;/li&gt;&#xA;&lt;li&gt;Nothing stops people from answering these challenges anyway.&lt;/li&gt;&#xA;&lt;li&gt;There are a lot of sandboxed questions, which would dilute the actual challenges on main.&lt;/li&gt;&#xA;&lt;li&gt;It would be much harder to see when there's actually a new challenge to be answered, and the main question feed would become a lot more useless.&lt;/li&gt;&#xA;&lt;li&gt;Votes on drafts actually affect reputation.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h1&gt;Questions&lt;/h1&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Sandbox posts are often just vague ideas to gauge initial interest... do we accept that for draft challenges on main?&lt;/li&gt;&#xA;&lt;li&gt;Is there some minimum amount of detail that needs to go into these?&lt;/li&gt;&#xA;&lt;li&gt;How do we prevent answers on sandboxed challenges?&lt;/li&gt;&#xA;&lt;li&gt;Should we require all posts to have either &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sandbox&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sandbox&amp;#39;&quot; rel=&quot;tag&quot;&gt;sandbox&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/open&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;open&amp;#39;&quot; rel=&quot;tag&quot;&gt;open&lt;/a&gt; similar to how Meta requires one of the special tags, in order to make it easier to find open challenges?&lt;/li&gt;&#xA;&lt;li&gt;Is it really so terrible if answers are posted to sandboxed challenges? Worst case, they'll be invalidated by changes to the OP.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-09T14:59:45.713" CommentCount="20" ContentLicense="CC BY-SA 3.0" />
  <row Id="12736" PostTypeId="2" ParentId="12637" CreationDate="2017-06-06T21:58:13.557" Score="3" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;I've seen various proposals on how to fix/improve/help/encourage the Sandbox as it is (a Meta post), but &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12735/43319&quot;&gt;I propose&lt;/a&gt; replacing it with a tag, and, making it possible to retire it. There is the question of what to do with currently active sandboxed challenges, but I suppose the Sandbox could be put on hold/locked and that moderators and authors could gradually re-post their proposed challenges as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sandbox&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sandbox&amp;#39;&quot; rel=&quot;tag&quot;&gt;sandbox&lt;/a&gt; challenges on Main.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-06T21:58:13.557" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12739" PostTypeId="1" AcceptedAnswerId="12740" CreationDate="2017-06-06T23:54:25.990" Score="0" ViewCount="78" Body="&lt;p&gt;For example, could I invent a language that contained only two characters (for example 1, and 0) and use it to answer a question (assuming it fulfilled all the necessary site criteria), and then score it as 1 byte per 8 characters?  Or would this still require 1 byte per character?&lt;/p&gt;&#xA;" OwnerUserId="69331" LastActivityDate="2017-06-07T00:17:49.490" Title="Can a language containing very few characters be mapped to only several bits to reduce byte counts?" Tags="|discussion|scoring|" AnswerCount="1" CommentCount="4" ClosedDate="2017-06-07T00:18:05.460" ContentLicense="CC BY-SA 3.0" />
  <row Id="12740" PostTypeId="2" ParentId="12739" CreationDate="2017-06-07T00:17:49.490" Score="0" Body="&lt;h1&gt;If there's an interpreter that supports this, yes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;On PPCG &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5852/42545&quot;&gt;a language is defined by its interpreter&lt;/a&gt;. If there's already an interpreter which can read the condensed format (8 characters stored in one byte) and properly execute the code, by all means use it. If there's not, feel free to create one and use that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please note that if the interpreter is newer than the challenge, it is not allowed to compete unless the challenge specifically allows it. But you can still answer challenges with that interpreter, as long as you mark the answer as &quot;non-competing&quot;.&lt;/p&gt;&#xA;" OwnerUserId="42545" LastActivityDate="2017-06-07T00:17:49.490" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12742" PostTypeId="2" ParentId="2140" CreationDate="2017-06-07T11:50:30.980" Score="1" Body="&lt;h1&gt;The Travelling Merchant &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Economy is flourishing in the great Kingdom of Pipysigea &lt;code&gt;[pee-pee-see-gee-ah]&lt;/code&gt;, since the bandits have been driven away by the King's army.&#xA;        Especially, many people have decided to make trade their... trade, and have become &lt;strong&gt;merchants&lt;/strong&gt;. You were one of them.&#xA;        You used most of your life's savings to purchase a good wagon and some animals of your choice. (Note: it can't be dragons. Sorry.)&#xA;        Unfortunately, you have just moved to Pipysigea from far away, attracted by the promises of wealth and security,&#xA;        so you don't really know much about the Kingdom: you have just bought a map, so you know the names of the cities&#xA;        and where they are, but you don't really know how long it's going to take to travel from one city to another.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So what is your goal? Being a merchant, you'll want to travel from city to city to get an idea of what good they want to buy&#xA;        and what goods they sell.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There will be a total of &lt;strong&gt;X&lt;/strong&gt; &lt;em&gt;kinds&lt;/em&gt; of goods in the Kingdom, and each city will be looking to &lt;strong&gt;buy&lt;/strong&gt; 3 kinds and will&#xA;        be &lt;strong&gt;selling&lt;/strong&gt; 3 kinds of goods. You will need to find out whether their prices are good for you:&#xA;        for example, the city of &lt;em&gt;Puzzleon&lt;/em&gt; might be selling &lt;em&gt;iron&lt;/em&gt; for 4 coins per unit and buying &lt;em&gt;bread&lt;/em&gt; for 1 coin per unit,&#xA;        and the city of &lt;em&gt;Stackapor&lt;/em&gt; might be selling &lt;em&gt;wool&lt;/em&gt; for 2 coins per unit and buying &lt;em&gt;iron&lt;/em&gt; for 5 coins per unit: in this case,&#xA;        it would be profitable to buy iron from Puzzleon and then travel to Stackapor to sell it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But beware: trade is ever-changing, and &lt;strong&gt;prices are going to change&lt;/strong&gt; based on what you and other merchants do.&#xA;        If you keep selling &lt;em&gt;iron&lt;/em&gt; in &lt;em&gt;Stackapor&lt;/em&gt; over and over, their need for it will soon start lowering, and&#xA;        so will the price they offer for that good. Similarily, if you buy a lot of &lt;em&gt;iron&lt;/em&gt; from &lt;em&gt;Puzzleon&lt;/em&gt;, the quantity at their disposal&#xA;        will lower and the amount of &lt;strong&gt;coins&lt;/strong&gt; they want for it will start &lt;strong&gt;getting higher&lt;/strong&gt;, until they run out of iron and &lt;strong&gt;stop selling it&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Beware, also, of &lt;strong&gt;taxes&lt;/strong&gt;! The arch-enemy of any merchant. Every seven days (= turns) you are going to be taxed,&#xA;        based on your current &lt;strong&gt;wealth&lt;/strong&gt;, which is measured by actual &lt;em&gt;coins&lt;/em&gt; and amount of &lt;em&gt;goods&lt;/em&gt; in your wagon.&#xA;        After all, his majesty King Golfus II deserves compensation for ridding the Kingdom of bandits and letting it prosper. And also for having&#xA;        established free market, of course.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;During your travels, you will eventually &lt;strong&gt;encounter&lt;/strong&gt; fellow (or rival, depending on your attitude) &lt;strong&gt;merchants&lt;/strong&gt;,&#xA;        with whom you can &lt;strong&gt;trade&lt;/strong&gt; just like you can with cities. You can decide to keep walking or to stop and trade.&#xA;        Every time this happens, you can tell them 1 good you are willing to buy (or none) and the price you offer, &#xA;        and the same with 1 good you are willing to sell.&#xA;        The other merchant will do the same. Then, you can respond by accepting or declining both of their proposals or just one.&#xA;        They will do the same with your proposals. Once all this is done with, you can resume your travel.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;You lose if you go bankrupt&lt;/strong&gt;: that happens when the time comes to pay taxes and you don't have enough coins.&#xA;&lt;strong&gt;You&lt;/strong&gt; automatically &lt;strong&gt;win&lt;/strong&gt; &lt;strong&gt;if all other merchants have gone bankrupt&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The game ends after &lt;strong&gt;XXX&lt;/strong&gt; turns, and the winner will be the merchant with the most &lt;strong&gt;coins&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Antitrust Law&lt;/strong&gt;: a merchant cannot be made specifically to support another merchant. (To help ensure this, merchants can never know the name of the merchant they are trading with)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Fair Trade&lt;/strong&gt;: a merchant cannot be made specifically to harm the trade of another merchant.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Fair Code&lt;/strong&gt;: King Golfus II is the one and only ruler, and a merchant may &lt;strong&gt;not&lt;/strong&gt; interfere with the law (also known as &quot;The Controller&quot;)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Technicalities&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You will be provided with a list of &lt;strong&gt;randomly generated cities&lt;/strong&gt; (e.g. 10 to 15) with their &lt;em&gt;coordinates&lt;/em&gt; on the map (a simple cartesian plan with X and Y values).&#xA;        The terrain is assumed to be pretty much the same overall, so travel times are based only on distance (initially I thought about giving specific travel costs - e.g. difficulty of road, maybe mountainous or muddy or whatever - to each &quot;link&quot;, unbeknownst to the merchant, but felt like it would have complicated things too much. If you think it would be a nice addition, feel free to say it in the comments!)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every city has a randomly generated list of &lt;em&gt;3 items to sell and 3 items to buy&lt;/em&gt;. The &lt;em&gt;quantity&lt;/em&gt; they have available of each item they sell is also randomly generated, as well as the prices of all 6 kinds.&#xA;        Obviously, if a city sells iron they won't also be looking to buy it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Each merchant&lt;/strong&gt; can only be in &lt;em&gt;one&lt;/em&gt; of these three positions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;in a city&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;on the way from one city to another&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;midway between two cities, stopped to trade with another merchant&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The game proceeds in rounds, which are made of each player's turn. Every round, the turn order is changed&#xA;        (To be decided: poorest players first or randomly generated?)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In their turn, &lt;strong&gt;each player&lt;/strong&gt; can do &lt;em&gt;one&lt;/em&gt; of these things:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;trade with the city, if they are in a city&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;trade with a merchant, if they have encountered a merchant on the road&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;resume travelling to the other city, if they have encountered a merchant&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;start travelling to another city&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If, in the previous turn, the player started travelling to another city, at the start of this turn he'll either&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;be notified that they have encountered a merchant, and can decide whether to trade or keep walking&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;be notified that they have reached the other city, and receive the information about it (its name and its trade prices)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If the player encounters a merchant and decides to keep travelling instead of trading, they will reach the city they were travelling&#xA;        to and will still be able to act (= trade with the city or move again)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If, instead, the player trades with the merchant, their turn is considered over and will be able to move again on their next turn (note: since they will be midway between two cities, they will have the chance to decide which of the two to travel to, in case they want to change their previous &quot;travel decision&quot;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Taxation happens at the start of the player's turn, if it is the taxation round (= once every 7 rounds)&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Note: the player can't &quot;talk&quot; to the other merchant unless they both&#xA;  stop to trade, so if the player decides to keep travelling they won't&#xA;  know the other merchant's prices. (I'm not sure about this rule, so&#xA;  please give me feedback :) would it be more sensible to know the other&#xA;  merchant's prices before having to decide whether to stop?)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Code&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I haven't started coding the controller yet, but I was thinking about using Node.js (since javascript is my favourite language, and I don't have tools to use Java and would prefer to avoid having to install stuff) so that bots can be submitted in the form of node modules (either written in javascript or with a javascript wrapper like most low-level node modules)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that your bot will be able to save data into a .txt file.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please give me feedback if you want to suggest a different approach. :)&lt;/p&gt;&#xA;" OwnerUserId="69121" LastEditorUserId="69121" LastEditDate="2017-06-07T12:20:09.010" LastActivityDate="2017-06-07T12:20:09.010" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12743" PostTypeId="2" ParentId="2140" CreationDate="2017-06-07T12:15:46.763" Score="0" Body="&lt;h2&gt;The problem&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As I sometimes build bots, I often came across real time image reading. The goal in this problem is to be able to identify a character given pixel representation with the minimal amount of tests. For that, you will have to generate a tree that can identify any char.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A list of frequency&lt;/li&gt;&#xA;&lt;li&gt;A png file containing each char in a 1 wide red box. Its exact color is #ed1c24 and it is not present in any of the chars.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A series of specific test that can identify any char. A test is defined by the pixel coordinates, the exact colour to check, the list of chars to have this pixel and the list of chars that donot.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Let's have a look at only four chars (number 1-4) of equal frequency.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/XPpSN.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/XPpSN.png&quot; alt=&quot;Test&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here we could say that we check for the for pixel in 0,0 (upper left corner). If it is white, it means it's a 1, otherwise we check for the pixel 1,0 (to the right of the upper left corner). If this one is white, it's a 4, otherwise we check for the pixel in 2,2 (the blanck beetween the 3 and the box). If it is white, it's a 3, otherwise it's a 2.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That way we can identify any number in 3 tests at most. If we calculate our score with this layout, it would be &lt;code&gt;0.25x1 + 0.25x3 + 0.25x3 + 0.25x2 = 2.25&lt;/code&gt; so on average our tree needs 2.25 pixel reading to identify a number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The solution that lead to that is written like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[0,0], [255,255,255], [1], [2,3,4]&#xA;[1,0], [255,255,255], [4], [2,3]&#xA;[2,2], [255,255,255], [3], [2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;However the best solution for this example has a score of 2. One of the trees that lead to that is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[0,1], [255,255,255], [1,4], [2,3]&#xA;[0,0], [255,255,255], [1], [4]&#xA;[2,2], [255,255,255], [3], [2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Count each time you read a pixel.&lt;/li&gt;&#xA;&lt;li&gt;Use the number frequency to average your score&lt;/li&gt;&#xA;&lt;li&gt;Your score is the sum of the char frequency times the number of pixels read to identify this number.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="70116" LastEditorUserId="70116" LastEditDate="2017-06-07T13:59:30.420" LastActivityDate="2017-06-07T13:59:30.420" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12745" PostTypeId="2" ParentId="2140" CreationDate="2017-06-07T14:08:30.553" Score="1" Body="&lt;h1&gt;Count Numbers in Integer Partition&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Remarks&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm looking for a description to make the problem more clear.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge and Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We can partition a positive integer into smaller (or equal) ones. For instance, for &lt;code&gt;N=6&lt;/code&gt;, it can be divided into:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;6 (1 integer occurs &gt;= 1 times, 0 integer occurs &gt;= 2 times)&lt;/li&gt;&#xA;&lt;li&gt;5+1 (2, 0)&lt;/li&gt;&#xA;&lt;li&gt;4+2 (2, 0)&lt;/li&gt;&#xA;&lt;li&gt;4+1+1 (2, 1)&lt;/li&gt;&#xA;&lt;li&gt;3+3 (1, 1)&lt;/li&gt;&#xA;&lt;li&gt;3+2+1 (3, 0)&lt;/li&gt;&#xA;&lt;li&gt;3+1+1+1 (2, 1)&lt;/li&gt;&#xA;&lt;li&gt;2+2+2 (1, 1)&lt;/li&gt;&#xA;&lt;li&gt;2+2+1+1 (2, 2)&lt;/li&gt;&#xA;&lt;li&gt;2+1+1+1+1 (2, 1)&lt;/li&gt;&#xA;&lt;li&gt;1+1+1+1+1+1 (1, 1)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your task is to work out the sum of the count of integers in each case, which occurs greater or equal than &lt;code&gt;M&lt;/code&gt; times. In the aforementioned case, if &lt;code&gt;M=1&lt;/code&gt;, the result is &lt;code&gt;1+2+2+2+1+3+2+1+2+2+1=19&lt;/code&gt;, and if &lt;code&gt;M=2&lt;/code&gt;, the result is &lt;code&gt;0+0+0+1+1+0+1+1+2+1+1=8&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Two positive integers &lt;code&gt;N&lt;/code&gt;, &lt;code&gt;M&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;N&lt;/code&gt; is the number being partitioned from.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;M&lt;/code&gt; is the lower limit of occurrences.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;One integer, the sum of the count of unique integers in each partition.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Remarks&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is a code-golf so shortest code wins.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are forbidden.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example I/O&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;All padding spaces are for formatting on PPCG only. You don't need to take care of them.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;8  2  =&amp;gt; 19&#xA;10 1  =&amp;gt; 97&#xA;25 4  =&amp;gt; 1228&#xA;25 50 =&amp;gt; 0&#xA;50 7  =&amp;gt; 87004&#xA;50 50 =&amp;gt; 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;All I/O for &lt;code&gt;M,N&amp;lt;=50&lt;/code&gt;: &lt;a href=&quot;https://pastebin.com/Yaji6U2j&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="59292" LastEditorUserId="59292" LastEditDate="2017-06-07T17:51:20.477" LastActivityDate="2017-06-07T17:51:20.477" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12746" PostTypeId="2" ParentId="11223" CreationDate="2017-06-07T15:20:45.147" Score="-2" Body="&lt;h1&gt;Java already allows contextual imports. So contextual information is allowed.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Take the two files:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;A.java&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import java.util.*;&#xA;class A {&#xA;  static List&amp;lt;String&amp;gt; list = Arrays.asList(&quot;foo&quot;);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;B.java&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;// NO IMPORTS!!&#xA;class B {&#xA;  public static void main(String[] args) {&#xA;    System.out.println(A.list.get(0));&#xA;  }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here, &lt;code&gt;B&lt;/code&gt; &lt;em&gt;depends&lt;/em&gt; on &lt;code&gt;java.util.List&lt;/code&gt;, but &lt;code&gt;java.util.List&lt;/code&gt; isn't declared in the imports.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/93659/16236&quot;&gt;One of my previous answer&lt;/a&gt;'s one of my previous golfed answer showed that no imports are required in the context of a lambda. You can call it black magic, but it works. Types &lt;em&gt;can&lt;/em&gt; be contextual in Java, and Lambda are no exception to this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is the answer, retyped, for clarity of the example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;LookMaNoImports.java&lt;/code&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;class LookMaNoImports {&#xA;  static Main.F f = s -&amp;gt; // transform a Stream&amp;lt;Boolean&amp;gt;&#xA;    s.map(               // by applying its map method&#xA;      b -&amp;gt;               // which in turns transforms a boolean &#xA;        !b               // by applying its negation.&#xA;    );&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;Main.java&lt;/code&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import java.util.Arrays;&#xA;import java.util.List;&#xA;import java.util.stream.Collectors;&#xA;import java.util.stream.Stream;&#xA;&#xA;public class Main {&#xA;    interface F {&#xA;        Stream&amp;lt;Boolean&amp;gt; f(Stream&amp;lt;Boolean&amp;gt; s);&#xA;    }&#xA;&#xA;    public static void main(String[] args) {&#xA;        F f=LookMaNoImports.f;&#xA;&#xA;        test(f, new Boolean[]{true}, new Boolean[]{false});&#xA;        test(f, new Boolean[]{false}, new Boolean[]{true});&#xA;        test(f, new Boolean[]{true, false}, new Boolean[]{false, true});&#xA;        test(f, new Boolean[]{true, true}, new Boolean[]{false, false});&#xA;    }&#xA;&#xA;    static void test(F f, Boolean[] param, Boolean[] expected) {&#xA;        List&amp;lt;Boolean&amp;gt; result = f.f(Arrays.stream(param)).collect(Collectors.toList());&#xA;        if (result.equals(Arrays.asList(expected))) {&#xA;            System.out.printf(&quot;%s: OK%n&quot;, Arrays.toString(param));&#xA;        } else {&#xA;            System.out.printf(&quot;%s: NOT OK, expected %s%n&quot;, Arrays.toString(param), Arrays.toString(expected));&#xA;        }&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="16236" LastEditorUserId="16236" LastEditDate="2017-06-07T15:24:56.603" LastActivityDate="2017-06-07T15:24:56.603" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12747" PostTypeId="2" ParentId="11223" CreationDate="2017-06-07T15:28:20.733" Score="18" Body="&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt;: Lambdas should not require their types.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I think that the lambdas shouldn't require types. A lambda does not need the type to be specified when you assign it to the function. For example, in C#:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Func&amp;lt;int, int, int&amp;gt; f = (a,b) =&amp;gt; a + b;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Compiles just fine. In fact I didn't even know you could specify the type in the lambda before I saw this post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another reason to allow this is that these languages are never going to beat a golfing language and requiring types only increases the gap. As code compiles just fine without them, there is no need to add them in.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't buy the argument about not knowing what function is called. To solve it you can either a) Ask the author or b) Require people state what the anonymous function compiles to:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;&lt;pre&gt;&lt;code&gt;s=&amp;gt;s.Length&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;Compiles to a &lt;code&gt;Func&amp;lt;string, int&amp;gt;&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Lastly, if we require types for the inputs it is only logical that we then have to require types for outputs. This makes no sense in the case of a lambda as there is no way to do this without showing what it compiles to. At that point it just becomes shorter to use a normal method and do away with lambdas on PPCG altogether. &lt;/p&gt;&#xA;" OwnerUserId="38550" LastActivityDate="2017-06-07T15:28:20.733" CommentCount="54" ContentLicense="CC BY-SA 3.0" />
  <row Id="12752" PostTypeId="1" CreationDate="2017-06-07T18:18:43.357" Score="1" ViewCount="35" Body="&lt;p&gt;Say I invent a language, post a list of commands and general structure on GitHub, and then begin working on the interpreter.  After finishing the interpreter, could I use this language to answer challenges posted before the interpreter was completed?&lt;/p&gt;&#xA;" OwnerUserId="69331" LastActivityDate="2017-06-07T18:18:43.357" Title="Can an language invented before a challenge was posted be used to answer the challenge if it lacked an interpreter at the time?" Tags="|discussion|" AnswerCount="0" CommentCount="2" ClosedDate="2017-06-07T18:31:06.293" ContentLicense="CC BY-SA 3.0" />
  <row Id="12756" PostTypeId="2" ParentId="2140" CreationDate="2017-06-07T21:27:49.783" Score="4" Body="&lt;h1&gt;Me, Me, Me!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Edit: changed success when the input matches the source code to when the input is any permutation of the source.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code is clearly superior to all other code. In fact, your code is so great that it prints itself when the opportunity arises (but not when any other, inferior code is around.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that takes a string as input. If the string is equal to some permutation of the characters in your source code, then output the entire source code. Otherwise, output &lt;code&gt;Gross.&lt;/code&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your language uses a non-ascii encoding, &quot;character&quot; is defined as whatever a character in your source looks like. If it's unreasonable to take input in that format, you can treat the bytes of your source as their respective extended ascii codes. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Takes a string using whatever input mechanism your programming language provides. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Prints either the entire source of your program or the word &lt;code&gt;Gross.&lt;/code&gt; No additional output is permitted.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can take input using any reasonable method. (Stdin, function parameter, etc.)&lt;/li&gt;&#xA;&lt;li&gt;A string &lt;em&gt;a&lt;/em&gt; is a permutation of a string &lt;em&gt;b&lt;/em&gt; iff each character in the alphabet appears the same number of times in &lt;em&gt;a&lt;/em&gt; and &lt;em&gt;b&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; Shortest code (in bytes) wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66460" LastEditorUserId="66460" LastEditDate="2017-06-19T18:20:42.347" LastActivityDate="2017-06-19T18:20:42.347" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="12757" PostTypeId="1" CreationDate="2017-06-07T22:03:03.747" Score="22" ViewCount="1566" Body="&lt;p&gt;Hi Guys &amp;amp; Gals and fellow golfers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I just want to ask a question and hopefully get some meaningful answers. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am a relative newbie on PPCG with a rep of only around 2.5k. That suits me but I am continually seeing questions closed for newcomers as dupes and unclear and get very little chance to compete against the mathematical geniuses that make up most of this site. No disrespect intended guys.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have made my feelings clear on a couple of discussions that have gone on about &quot;How can we attract new members&quot; and &quot;Closing duplicates&quot; in the past. I have also made it clear that I joined because it was a fun way to get away for my &quot;real job&quot; of writing readable code in my real life and having some banter with some fellow coders who think the same way out of work hours.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It now appears that too many members are taking PPCG far too seriously. Maybe it is me that is misunderstanding what PPCG is supposed to be about. I've only been here for a year but am seriously thinking of quitting because the fun has gone out of it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Just a suggestion for Meta. Am I wrong? If not, then can we do anything to improve things? &lt;/p&gt;&#xA;" OwnerUserId="56555" LastEditorUserId="61563" LastEditDate="2017-06-16T04:13:30.860" LastActivityDate="2018-12-10T18:46:40.633" Title="What is happening to PPCG?" Tags="|discussion|new-users|site-health|" AnswerCount="4" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="12758" PostTypeId="2" ParentId="2140" CreationDate="2017-06-07T22:36:16.327" Score="2" Body="&lt;h1&gt;Fence Matrix&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a positive integer &lt;code&gt;n&lt;/code&gt;, output the &lt;code&gt;2n+1 x 2n+1&lt;/code&gt; &amp;quot;fence&amp;quot;-matrix&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0  1  0  1  ...  0 &#xA;1  2  1  2  ...  1&#xA;0  1  0  1  ...  0 &#xA;1  2  1  2  ...  1 &#xA;⋮   ⋮  ⋮   ⋮       ⋮  &#xA;0  1  0  1  ...  0 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Alternatively you can also return a nested array or print a string (even with other entry delimiters than spaces or none at all) or output a raster image where each entry is represented by one pixel.&lt;/p&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;n = 1&#xA;0  1  0&#xA;1  2  1&#xA;0  1  0&#xA;&#xA;n = 2&#xA;0  1  0  1  0&#xA;1  2  1  2  1&#xA;0  1  0  1  0&#xA;1  2  1  2  1&#xA;0  1  0  1  0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-07T22:36:16.327" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12759" PostTypeId="2" ParentId="12757" CreationDate="2017-06-07T22:50:01.563" Score="28" Body="&lt;p&gt;First of all, if you see a question closed as duplicate, then assuming the close is correct, that really shouldn't prevent you participating in the site; just answer the duplicated question rather than the duplicate one. A duplicate mark should only exist if the questions are similar enough that working on one is much the same task as working on the other; they're likely to need the same techniques to solve, have a similar level of difficulty, and the like. (If you think the duplicate questions are different enough that that doesn't apply, you should let somebody know, e.g. by bringing it up in chat, or flagging the post.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With &quot;unclear what you're asking&quot;, the other common sort of closure, the issue here is more of a failure of everyone to get along with each other. Because people are competing for the best possible score, that means cutting every corner they can get away with, and that can sometimes lead to very bizarre interpretations of a question. (I know I've got highly annoyed with some people's interpretation of questions in the past; a question of mine I'm quite fond of had to be closed because a user was persistently trying to claim that the equivalent of &lt;code&gt;fprintf(stderr, &quot;error&quot;)&lt;/code&gt; was a run-time error, a definition which seemed maliciously absurd to me.) As such, if a question isn't massively precise, it puts the answerers in a really awkward spot: should they try to force their way into a loophole, or should they carefully not exploit it and let someone who's willing to cut in front of them? Writing &lt;strong&gt;Perl, 12 or 11 or 10 bytes&lt;/strong&gt; and giving a different version of the program for each possible interpretation of the rules is a pain.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for the more general question, of why the site's taken seriously, it's the same reason that many other recreational games and sports have for taking things seriously: if your opponents aren't trying hard to win, it's much less fun. (This isn't the only recreational site I'm on; another one, which has nothing to do with programming, has a rather strict rule that you &lt;strong&gt;must&lt;/strong&gt; always play to win, as failure to do so would be unfair on both your opponents and team-mates.) The PPCG version of that is a bit different: it's &quot;here's a problem, you can probably solve it, but can you do better?&quot;. The best challenges here are the ones that have almost unlimited scope for continuously improving. (Oddly, those tend not to be pure &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;; with that, it's sometimes but not always obvious that an answer can't reasonably be improved whilst staying within its parameters for language, algorithm, unused loopholes, and the like.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your problem is simply that you feel you can't compete because other programmers are better than you, there are a few solutions there. For example, you can learn (or invent!) an obscure language to compete in, and thus have fewer competitors. Or perhaps you can pick a language you know well, and try to learn golfing techniques; after a while you start to be able to at least tie the best competitors on simpler problems, and then maybe win occasionally when you have an insight nobody else does.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that it's entirely possible to compete &quot;privately&quot;, without posting the answer; I've lost count of the number of times I've seen a problem, instantly come up with an algorithm for solving it in Jelly, then scrolled down to find that someone else had already posted the answer before I saw the question (this also happens with Brachylog too sometimes, but it's less popular so it happens less often). That's disheartening, but it's also encouraging, because it means that at least I wasn't outgolfed by anything other than the timestamp, and that my skills are probably up to scratch.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anyway, if you find the fun is in &lt;em&gt;solving the problems&lt;/em&gt;, rather than &lt;em&gt;solving the problems with an optimized score&lt;/em&gt;, you're likely to have more fun elsewhere; PPCG isn't too friendly to non-serious contenders, as that's not really what the site is for (and it'd mean that people who did want to compete would have a hard time figuring out what answers they should pay attention to to compete against). If you find the fun is in optimizing the score, though, it serves its function fairly well (despite the fact that it's hosted on Stack Exchange, which is almost completely the wrong backend software to be powering the sort of frontend we'd ideally want).&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-07T22:50:01.563" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12760" PostTypeId="5" CreationDate="2017-06-07T22:59:24.500" Score="0" Body="&lt;p&gt;The activity level of CGCC depends on that of its users; more users means more questions, more answers, and more moderation capability. Sometimes, people will flag up specific problems that might cause activity to drop (e.g. &quot;site policy X is offputting to new users&quot;), or suggest solutions that might help encourage activity; this tag is used to categorize the resulting discussions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It could also conceptually be used for questions about what levels of site activity are desirable (without the automatic assumption that it's a good thing); however, at the time of writing this tag wiki there have been no such questions asked so far.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that &lt;a href=&quot;/questions/tagged/site-health&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;site-health&amp;#39;&quot; rel=&quot;tag&quot;&gt;site-health&lt;/a&gt; was more of an issue prior to CGCC's graduation into an official non-beta Stack Exchange site (as the health of the site was a large factor in whether it would graduate or eventually be abandoned), and thus many of the related questions date from the time of CGCC Beta, discussing how the site could be made more likely to graduate. It's less commonly used nowadays, but occasional discussions about the future of the site are still definitely likely to be helpful!&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorUserId="56656" LastEditorDisplayName="user62131" LastEditDate="2020-02-04T14:19:06.373" LastActivityDate="2020-02-04T14:19:06.373" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="12761" PostTypeId="4" CreationDate="2017-06-07T22:59:24.500" Score="0" Body="Questions about encouraging activity on CGCC, and/or attracting/retaining users." OwnerDisplayName="user62131" LastEditorUserId="56656" LastEditorDisplayName="user62131" LastEditDate="2020-02-04T14:19:06.373" LastActivityDate="2020-02-04T14:19:06.373" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="12762" PostTypeId="2" ParentId="1281" CreationDate="2017-06-07T23:11:18.617" Score="5" Body="&lt;h1&gt;This probably wouldn't help much, and might hurt&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The purpose of mandatory tags is, at least partly, to keep out offtopic posts. Now, it's true that a post that doesn't have a win condition (and isn't &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;) is offtopic on PPCG. However, when an offtopic question is posted here, it's often clear that the question asker struggled to find even one currently existing tag to tag the post with, and it's often tagged with a nonsensical set of tags (e.g. internally contradictory, and also failing to describe the question). (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt; seems popular for that; &quot;my question is about programming, and I'm puzzled&quot;!)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's also the case that a) a question which is &lt;em&gt;very&lt;/em&gt; offtopic is trivially identified as such and tends to be closed within a few minutes, thus doing no real lasting harm (we have a &lt;em&gt;lot&lt;/em&gt; of moderation power within the general user community on PPCG compared to the amount we actually need, so wasting small amounts of moderation power isn't an issue); and b) a question which is only &lt;em&gt;slightly&lt;/em&gt; offtopic nearly always has a win condition tag, so this wouldn't affect it. The only occasions I can really see this helping are situations where a poster simply forgot to write &quot;shorter (measured in bytes) is better&quot; in the question (or whatever the win condition they wanted is, but &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is the most frequently forgotten), and the &quot;you must provide a win condition tag&quot; prompt reminds them. That's rare (although not unheard of), and commenters to the question are likely to remind them quickly enough.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can see two ways in which this could hurt, though. One is giving people who post wildly offtopic things a nice handy list of tags that they can use to get their question past the &quot;this is offtopic&quot; check; it's not like we have a classification as simple as &lt;a href=&quot;/questions/tagged/discussion&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/support&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt; that clearly delineates the site into only a few possible valid reasons for making a post. (In fact, we even have &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, which is a tag which explicitly means &quot;none of the above&quot; when it comes to win conditions, and thus any possible post is covered by some win condition &lt;em&gt;tag&lt;/em&gt;, even if it doesn't have one in its body; this is directly counter to the main advantage from required tags.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The other issue is that sometimes, a win condition becomes popular enough to be worth its own tag. The OP doesn't list &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;, presumably because they weren't around at the time; we've had to add them since. If we needed to bother a diamond moderator (or more likely, SE staff) to adjust the list every time a new win condition became popular, the list would likely be doing more harm than good as it would cause a limbo situation where we couldn't use the new win condition tag until a sufficiently highly-privileged user was found to update the site configuration.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-07T23:11:18.617" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12764" PostTypeId="2" ParentId="2140" CreationDate="2017-06-08T00:46:08.820" Score="-1" Body="&lt;h1&gt;Do nothing&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program which terminates normally (not in an error), producing no output on the &lt;a href=&quot;https://en.wikipedia.org/wiki/Standard_streams&quot; rel=&quot;nofollow noreferrer&quot;&gt;standard output stream&lt;/a&gt; (or the language's closest equivalent), nor on the standard error stream, regardless of what content is present on the standard input stream. (Note that this is intentionally overriding the normal I/O defaults; this is a challenge entirely about input/output handling.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, your program may not have any other side effects (e.g. writing files, changing persistent state), unless they're an unavoidable consequence of running a program on the operating system you're using (e.g. on Linux, it's OK to change the &quot;next process ID number to be assigned&quot; value inside the kernel, because that happens whenever you run a program).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, to avoid numerous uninteresting 0-byte (or boilerplate-plus-0-byte) solutions, you may not use a language in which the shortest program that does nothing (i.e. complies with the above specification) is also the shortest (or tied for the shortest) program which runs without error (but possibly reacts to input or produces output). In other words, you can't use a language unless doing nothing is more verbose than doing something.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Clarifications&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Intentionally exiting the program early is permitted. If you do exit the program manually, on a system that uses exit codes, you may do so with any exit code.&lt;/li&gt;&#xA;&lt;li&gt;Crashing the program is not permitted, even if it (for some reason) exits with a &quot;success&quot; code after the crash.&lt;/li&gt;&#xA;&lt;li&gt;&quot;No output&quot; means 0 bytes of output, not even a trailing newline.&lt;/li&gt;&#xA;&lt;li&gt;Likewise, your program must be able to handle &lt;em&gt;any&lt;/em&gt; finite sequence of bytes on the standard input stream, even if it isn't, say, made of characters in the current encoding (but rather of arbitrary octets). You do not need to handle infinite input, though (e.g. your program won't be connected to &lt;code&gt;/dev/zero&lt;/code&gt; or the like).&lt;/li&gt;&#xA;&lt;li&gt;You don't have to actually read input; it's your choice as to whether you want to read and discard it, or not read it at all.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Victory condition&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, shorter is better, measured in bytes. (Remember that if you need to run the program in an unusual way, that incurs a byte penalty, under standard PPCG rules.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because languages which are particularly suited for this task (such as Perl and Python) are excluded by the rules, there's not much point in talking about the best answer cross-language; rather, the aim is to find the best answer you can in the language which you submit in. (Historically, on this sort of challenge, answers that are more unusual, interesting, or better-explained have tended to get more votes.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Is this too trivial? We were discussing it in chat as a joke, and realised that it's actually possibly more interesting than it sounds. I'm fairly sure the spec's correct (although would definitely appreciate knowing if something's wrong here!), but would appreciate feedback on how much people would hate me if I posted it to main.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-08T00:46:08.820" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12771" PostTypeId="1" CreationDate="2017-06-08T11:10:30.363" Score="1" ViewCount="98" Body="&lt;p&gt;The current meta consensus is that the implementation defines the language. The cannonical answer is: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7832/whats-the-policy-on-interpreter-bugs/7833#7833&quot;&gt;What&amp;#39;s the policy on interpreter bugs?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think this is too rigid: I think that a specification should also be able to define a language, if and only if the specification is sufficiently rigorous to uniquely define the behavior of a given program, and sufficiently clear that essentially anybody reading it would come to the same conclusion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, consider this question: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11687/old-languages-with-new-implementations&quot;&gt;Old Languages with new implementations&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A user would like to use a cellular automaton that was defined 17 years previously. A cellular automaton is a very well specified kind of language, where every possible detail has been specified in advance. The specification allows one to know exactly how the program should develop in any possible initial condition.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Other specifications that are similarly precise include the definition of a  Turing machine, various grammars, some assembly language specifications, the BrainFuck specification, and so forth.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Less precise specifications, such as those accompanying most general purpose programming languages, would not define a language, since it's not clear how a given piece of code may function.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I prefer the system outlined above because I think our current rule strays into &quot;That's the rule because we said so&quot; territory. I think the system outlined above avoids the problems associated with accepting specifications too lightly, while allowing them to be used in appropriate circumstances.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2017-06-08T11:10:30.363" Title="Can a specification define a language?" Tags="|discussion|specification|" AnswerCount="0" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12772" PostTypeId="2" ParentId="12599" CreationDate="2017-06-08T13:15:19.887" Score="8" Body="&lt;h1&gt;Add the Sandbox to the Review Queue&lt;/h1&gt;&#xA;&lt;p&gt;Now, I don't know if this is possible, and I'm assuming it's not, because SE would have to do something about it. However, this makes the most sense: the people who like fixing up Sandbox questions can use the review queue to find all of the newest ones, and they can even get badges for it. People who aren't sure if they can help or not can skip challenges they have no comment on. Presumably, this will bring at least more eyes to sandbox challenges.&lt;/p&gt;&#xA;" OwnerUserId="65836" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-08T13:15:19.887" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12773" PostTypeId="1" CreationDate="2017-06-08T13:19:50.723" Score="3" ViewCount="72" Body="&lt;p&gt;I have a &lt;a href=&quot;https://codegolf.stackexchange.com/q/123520/68602&quot;&gt;challenge&lt;/a&gt; that I posted which I'd like to put on hold while I refine it in sandbox. Is this possible?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't want to delete it because I'd like to recycle bits of it, and I'm guessing if it's deleted then I'll lose the work I've done/ there will be a time limit on how long I can still access it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What can I do to make the challenge invisible to site users/ clearly not currently &quot;open&quot;. Is there some way of closing it myself, or if not can people reading this please vote to close as suggested &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12166/68602&quot;&gt;here&lt;/a&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, I intend to re-post after refinement as a different question and delete the original (is this acceptable?)&lt;/p&gt;&#xA;" OwnerUserId="68602" LastEditorUserId="8478" LastEditDate="2017-06-08T13:34:50.543" LastActivityDate="2017-06-08T13:36:30.817" Title="Temporarily close my own challenge" Tags="|support|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12774" PostTypeId="2" ParentId="12773" CreationDate="2017-06-08T13:36:30.817" Score="4" Body="&lt;p&gt;You can still access the challenge when it's deleted (and there's no time limit for how long you can access it). You can even edit it while it's deleted and then undelete it once the challenge has been improved with feedback from the sandbox.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Whether reposting is acceptable depends a lot on how substantial the changes from the sandbox are. I'd say if you thoroughly overhaul and improve the challenge, no one will mind if you post the new version separately, but if it's just some minor cosmetic changes, then posting a new one seems like a way to clear the downvotes and close votes on the challenge, which is certainly frowned upon. There is no clear objective line we can draw here, so just use your best judgement. &lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2017-06-08T13:36:30.817" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12775" PostTypeId="2" ParentId="2140" CreationDate="2017-06-08T14:45:53.727" Score="0" Body="&lt;h1&gt;Sources and Strings&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The challenge:&lt;/strong&gt;&#xA;Output a string with the same length as the source code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The requirements:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard loopholes apply, etc., etc.&lt;/li&gt;&#xA;&lt;li&gt;Input may not be taken&lt;/li&gt;&#xA;&lt;li&gt;The output must be deterministic (for scoring purposes)&lt;/li&gt;&#xA;&lt;li&gt;Output must be a string&lt;/li&gt;&#xA;&lt;li&gt;Functions and full programs are allowed, no snippets though&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The scoring:&lt;/strong&gt;&#xA;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins. However, for each individual character in the source that has a match in the outputted string, your byte score is increased by 2 bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples of scoring (of course, most of these aren't working programs):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Program            Output            Score&#xA;nn                 ng                2+(1*2)=4&#xA;print('h'*14);     hhhhhhhhhhhhhh    14+(1*2)=16&#xA;print('prnt'*4);   prntprntprntprnt  16+(8*2)=32&#xA;q                  q                 1+(1*2)=3&#xA;qwertyuiop         mmmmmmmmmm        10+(0*2)=10&#xA;System.out.println(&quot;lol&quot;);           Invalid=Infinity points&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="53781" LastActivityDate="2017-06-08T14:45:53.727" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12780" PostTypeId="2" ParentId="12599" CreationDate="2017-06-08T19:29:08.217" Score="2" Body="&lt;p&gt;So how would you respond to something like this...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Upon asking a new challenge, the owner closes the question as &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;On hold&lt;/strong&gt; for final clarifications to be resolved before opening up for answers. Ask owner for clarifications in &amp;lt;Sandbox_chatroom_link&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It would be completely voluntary, but &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Getting posted to the main site means relevant people would see it&lt;/li&gt;&#xA;&lt;li&gt;Reviewing in chat room shouldn't raise community user flags&lt;/li&gt;&#xA;&lt;li&gt;On hold will prevent answers until the owner is sure it is ready.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And hopefully people won't down vote until the question is reopened.&lt;/p&gt;&#xA;" OwnerUserId="61474" LastActivityDate="2017-06-08T19:29:08.217" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12782" PostTypeId="2" ParentId="2140" CreationDate="2017-06-08T19:45:49.450" Score="1" Body="&lt;h1&gt;Print all matching leaves &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/natural-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;natural-language&amp;#39;&quot; rel=&quot;tag&quot;&gt;natural-language&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In Natural Language Processing, we sometimes interpret sentences as being context-free languages, and therefore as having a certain tree structure, also called constituency trees, or parse trees. These trees are sometimes written down in a notation that (as far as I know) stems from the Penn Treebank project:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A tree is either of:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;(a b1 b2 b3...)&lt;/code&gt;, with &lt;code&gt;a&lt;/code&gt; being the tree's label (typically something like &lt;code&gt;NP&lt;/code&gt; for &quot;noun phrase&quot;) and &lt;code&gt;bn&lt;/code&gt; being the same representation of it's sub-trees (all being non-terminals)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;(a c)&lt;/code&gt;, which &lt;code&gt;a&lt;/code&gt; being the tree's label and &lt;code&gt;c&lt;/code&gt; being the label of a single terminal child (a word).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Valid trees:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;(S Hi)&lt;/code&gt; (Simple tree containing only one word, &quot;Hi&quot;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(A (B (C D)))&lt;/code&gt; (Nested tree containing only one word, &quot;D&quot;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(A (B C) (D (E F)) (G H))&lt;/code&gt; (Tree containing the words &quot;C&quot;, &quot;F&quot;, and &quot;H&quot;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Invalid trees:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;Hi&lt;/code&gt; (a terminal is not a tree)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(A B C)&lt;/code&gt; (terminals have no siblings)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;((A (B C)))&lt;/code&gt; (extra parantheses)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(A (B C)))&lt;/code&gt; (unbalanced parantheses)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For understanding this format better I recommend &lt;a href=&quot;http://eztreesee.coli.uni-saarland.de&quot; rel=&quot;nofollow noreferrer&quot;&gt;this online tool I wrote ages ago&lt;/a&gt;. For example, this is a visualization of the first example case:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/A8kkE.png&quot; width=&quot;400&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Task:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given a Penn-Treebank-style tree representation and a non-terminal, output the space-seperated concatenation of all leaves for every instance of this non-terminal.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may take the two inputs (tree representation and non-terminal symbol) in any of the standard ways, but always as strings. You may take them in any order.&lt;/li&gt;&#xA;&lt;li&gt;The output can be a list of strings (&lt;code&gt;[&quot;The dog&quot;, &quot;a cat&quot;]&lt;/code&gt;), some other kind of sequence, a (e.g.) comma-seperated string, and anything else that's reasonable&lt;/li&gt;&#xA;&lt;li&gt;Both inputs are guaranteed to never be empty.&lt;/li&gt;&#xA;&lt;li&gt;The tree representation input is guaranteed to contain at least one terminal symbol.&lt;/li&gt;&#xA;&lt;li&gt;Single spaces may or may not exist for formatting (both the first and the second example are equally valid and both have to be accounted for), but there will always be a single space between a terminal symbol and its immediate parent (e.g. between &lt;code&gt;Det&lt;/code&gt; and &lt;code&gt;the&lt;/code&gt; in the first example)&lt;/li&gt;&#xA;&lt;li&gt;In case you don't find any matching terminals, you may either raise an error, not output anything, or output some kind of empty sequence.&lt;/li&gt;&#xA;&lt;li&gt;All node labels (terminal or not) will match &lt;code&gt;/[A-Za-z0-9_-]+/&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Specify which output format you use&lt;/li&gt;&#xA;&lt;li&gt;The shortest code (per language) wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;I/O examples&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input 1                                                input 2  output&#xA;(S(NP(Det The)(N dog))(VP(V likes)(NP(Det a)(N(cat))))), NP -&amp;gt; &quot;The dog&quot;, &quot;a cat&quot;&#xA;(NP (Det A) (AP (Adj fancy) (N car))),                   V  -&amp;gt; an empty sequence&#xA;(N cat),                                                 N  -&amp;gt; &quot;cat&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Output format examples&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;List of strings: &lt;code&gt;[&quot;The dog&quot;, &quot;a cat&quot;]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;CSV: &lt;code&gt;&quot;The dog, a cat&quot;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;CSV without spaces: &lt;code&gt;&quot;The dog,a cat&quot;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="21173" LastEditorUserId="21173" LastEditDate="2017-06-12T11:46:42.690" LastActivityDate="2017-06-12T11:46:42.690" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12784" PostTypeId="2" ParentId="2140" CreationDate="2017-06-09T01:34:36.077" Score="1" Body="&lt;h1&gt;Obsfucation: Use Uncommon Chars&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/obsfucation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;obsfucation&amp;#39;&quot; rel=&quot;tag&quot;&gt;obsfucation&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Note that I do not have the SE lookup skills to set this up. An automated query would take this challenge a low way. If someone would like this to happen, I would greatly appreciate some help setting this up :)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/search?tab=newest&amp;amp;q=is%3Aanswer%20%22jelly%22&quot;&gt;Basic search&lt;/a&gt; (currently searches for Jelly, anywhere)&lt;/p&gt;&#xA;&lt;p&gt;First, choose your language. It must have at least 100 answers on PPCG before the posting of this challenge, and at least 25 chars that are not no-ops. /* Click this query and insert your language's name to see if it is valid. If it is, this query will give you legal chars, and their point value */. Use those chars the complete the challenge. The lowest point value wins.&lt;/p&gt;&#xA;&lt;h1&gt;/*This Query&lt;/h1&gt;&#xA;&lt;p&gt;//Can we do challenges for SE queries? If so this would be a decent one :)&lt;/p&gt;&#xA;&lt;p&gt;What I would like for this query to be:&lt;/p&gt;&#xA;&lt;p&gt;Gets all chars from the first codeblock following the language name in a heading. Accumulates all chars into a frequency table. Make sure that there are at least 25 relevant chars - we can human inspect this to insure no-ops are not polluting the data. It will then return the bottom 20% (frequency) of chars, rounded down, along with point values from 1-length for each of them. The least common chars will receive lower scores. Ties will have the same point value (do it like tournament rankings - &lt;code&gt;1,1,3&lt;/code&gt;, not &lt;code&gt;1,1,2&lt;/code&gt;.)&lt;/p&gt;&#xA;&lt;p&gt;Challenge answerers will only be able to use the chars provided. /&lt;em&gt;Should whitespace be excluded (and allowed to be used, with a penalty) because of how SE treats whitespace?&lt;/em&gt;/&lt;/p&gt;&#xA;&lt;p&gt;RE 25 char min: I really would like to get rid of this, but I don't know how else to prevent languages like BF from having an inherent advantage. Even if I restrict BF to 2 chars, it will score really low because they will have point scores &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;2&lt;/code&gt;.*/&lt;/p&gt;&#xA;&lt;h1&gt;/*The Challenge&lt;/h1&gt;&#xA;&lt;p&gt;I have not yet decided what the challenge should be - snippets to solve as many challenges, with point value as tiebreaker, might work, or a more difficult challenge. Input requested :) */&lt;/p&gt;&#xA;" OwnerUserId="65836" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-09T01:34:36.077" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12789" PostTypeId="2" ParentId="2140" CreationDate="2017-06-09T12:40:50.097" Score="1" Body="&lt;p&gt;I would like to ask this challenge: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The objective of this programming puzzle is to reproduce the following gif. &lt;a href=&quot;https://i.stack.imgur.com/J0V8h.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/J0V8h.gif&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I do not know the specs for the making of such an animation. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;How can I make this a standard/allowed puzzle with this limitation?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any inputs will be appreciated.&lt;/p&gt;&#xA;" OwnerUserId="58234" LastActivityDate="2017-06-09T12:40:50.097" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12790" PostTypeId="2" ParentId="2140" CreationDate="2017-06-09T12:47:57.273" Score="0" Body="&lt;h1&gt;Prime Factors Zip&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Take an integer strictly greater than 2, for example &lt;code&gt;66&lt;/code&gt;. Its prime factors are &lt;code&gt;[2,3,11]&lt;/code&gt;, when ordered from smallest to biggest. If we zip the digits of those factors, we get &lt;code&gt;[231,1]&lt;/code&gt;. Multiplying them yields the integer &lt;code&gt;231&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we apply this process back on &lt;code&gt;231&lt;/code&gt;, we get &lt;code&gt;371&lt;/code&gt;. If we apply this multiple times, we get the following sequence:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;66&#xA;231&#xA;371&#xA;225&#xA;3355&#xA;5676&#xA;290082&#xA;770229&#xA;174999300&#xA;121860997014&#xA;6330393355581&#xA;40168037420160&#xA;6869559509647641812624&#xA;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;At this point, we stop because &lt;code&gt;0&lt;/code&gt; cannot be factored. We say that &lt;code&gt;0&lt;/code&gt; is the &lt;em&gt;prime factors zip&lt;/em&gt; of &lt;code&gt;66&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we start with &lt;code&gt;19&lt;/code&gt;, we get the following sequence:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;19&#xA;9&#xA;33&#xA;31&#xA;3&#xA;3&#xA;…&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here, we can see that once we reach &lt;code&gt;3&lt;/code&gt;, we will always get &lt;code&gt;3&lt;/code&gt;. Therefore, &lt;code&gt;3&lt;/code&gt; is the &lt;em&gt;prime factors zip&lt;/em&gt; of &lt;code&gt;19&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we start with &lt;code&gt;22&lt;/code&gt;, we get the following sequence:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;22&#xA;21&#xA;37&#xA;21&#xA;37&#xA;…&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here, we can see that once we reach &lt;code&gt;21&lt;/code&gt;, we will always get the loop &lt;code&gt;[21,37]&lt;/code&gt;. Therefore, &lt;code&gt;[21,37]&lt;/code&gt; is the &lt;em&gt;prime factors zip&lt;/em&gt; of &lt;code&gt;22&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that it is possible for an integer to be its own prime factors zip (e.g. &lt;code&gt;5&lt;/code&gt;) or that it is contained in its prime factors zip (e.g. &lt;code&gt;23&lt;/code&gt; which has prime factors zip &lt;code&gt;[23,6]&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an integer strictly greater than &lt;code&gt;1&lt;/code&gt;, output its prime factors zip.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input        Prime factors zip&#xA;7            7&#xA;46           0&#xA;48           [22103,72463]&#xA;100          0&#xA;113          3&#xA;1337         [337,63]    &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Sandbox&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I have no idea (nor have I checked extensively) if it is possible than this procedure never loops for some integers.&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="41723" LastEditDate="2017-06-09T12:56:32.503" LastActivityDate="2017-06-09T12:56:32.503" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12792" PostTypeId="1" CreationDate="2017-06-09T13:33:58.370" Score="3" ViewCount="167" Body="&lt;h1&gt;The sandbox is a mess, let's clean it up!&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Here are some solutions. Vote on them to express agreement.&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Also, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12792/remove-all-old-1-score-sandboxed-posts-and-more-to-clean-up-the-sandbox?answertab=votes#tab-top&quot;&gt;sort by votes.&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerDisplayName="user58826" LastEditorDisplayName="user58826" LastEditDate="2017-06-09T14:04:34.063" LastActivityDate="2017-06-10T22:38:22.337" Title="Remove all old, abandoned, low-score posts to clean up the sandbox!" Tags="|discussion|sandbox|" AnswerCount="3" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="12797" PostTypeId="2" ParentId="12792" CreationDate="2017-06-09T14:03:12.193" Score="3" Body="&lt;h1&gt;Give people notice first&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Before VTDing a post, comment this:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Canned message to comment to to-be-deleted posts:&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;code&gt;This sandbox post has had little activity in a while and little positive reception from the community. Please improve / edit it or delete it to help us [clean up the sandbox.](https://codegolf.meta.stackexchange.com/q/12792)&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerDisplayName="user58826" LastActivityDate="2017-06-09T14:03:12.193" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12798" PostTypeId="2" ParentId="12792" CreationDate="2017-06-09T14:04:02.823" Score="4" Body="&lt;h1&gt;What about the good but abandoned proposals?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Ask for permission, adopt and post &lt;a href=&quot;https://data.stackexchange.com/meta.codegolf/query/683029/sandboxed-posts-that-have-a-score-1-and-no-activity-for-a-month&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;all posts that have a score &gt; 1 and no activity for a month&lt;/strong&gt;&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastActivityDate="2017-06-09T14:04:02.823" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12801" PostTypeId="2" ParentId="2140" CreationDate="2017-06-09T14:55:15.820" Score="0" Body="&lt;h1&gt;Color the Grayscale&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given an image containing only grayscale colors (for RGB, &lt;code&gt;R==G==B&lt;/code&gt;), and a RGB value (that is not grayscale), color the image with your given color.&lt;/p&gt;&#xA;&lt;p&gt;//Is there a formula that does this? If so this can definitely have objective input and output.&lt;/p&gt;&#xA;&lt;p&gt;Should this be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; like a lot of the other &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt; challenges?&lt;/p&gt;&#xA;" OwnerUserId="65836" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-09T14:55:15.820" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12802" PostTypeId="2" ParentId="2140" CreationDate="2017-06-09T16:26:53.557" Score="-2" Body="&lt;h1&gt;Draw an XBox&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Here's an X:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;\  /&#xA; \/&#xA; /\&#xA;/  \&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And here's a Box:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+----+&#xA;|    |&#xA;|    |&#xA;|    |&#xA;|    |&#xA;+----+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So, for an XBox, just draw an X in a Box:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+----+&#xA;|\  /|&#xA;| \/ |&#xA;| /\ |&#xA;|/  \|&#xA;+----+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your input will be a number (in any standard way) that will represent the size of the box. To output the above box, this could be the number of &lt;code&gt;-/|\&lt;/code&gt;s (4), or the number of lines/columns (6), or even the intercept of the second diagonal (5) would be acceptable. (Don't ask me to accept the base256 encoding of the output though, as that's one of the many banned standard loopholes.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program or function should then output (in any standard way) the XBox of the given size. If the &lt;code&gt;\/&lt;/code&gt;s cross in the same character, place an X (as per &lt;a href=&quot;https://codegolf.stackexchange.com/questions/125383/draw-a-big-slash-x&quot;&gt;Draw a big slash X&lt;/a&gt;). For example, here's an XBox three sizes larger than the one above:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+-------+&#xA;|\     /|&#xA;| \   / |&#xA;|  \ /  |&#xA;|   X   |&#xA;|  / \  |&#xA;| /   \ |&#xA;|/     \|&#xA;+-------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2017-06-10T00:38:37.910" LastActivityDate="2017-06-10T00:38:37.910" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="12804" PostTypeId="2" ParentId="2140" CreationDate="2017-06-09T17:16:16.603" Score="1" Body="&lt;h2&gt;Write a brute-forcer for the 3-byte input 'emoticon numbers' challenge&lt;/h2&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/q/125455/571&quot;&gt;Emoticon numbers!&lt;/a&gt; challenge asks you to identify the 3-byte snippet which evaluates to the highest numeric value in your language, and which also has the bytes in the form &lt;code&gt;ABA&lt;/code&gt; (where the outer two are identical and the middle one is different), and which generates an output that is only digits.&lt;/p&gt;&#xA;&lt;p&gt;I trust your claim that you have identified the best possible one is honestly intended, but as a casual scripter I'm not totally convinced, and can't be reassured by unfamiliar language specification references - since there are only 256^2 possible values, can you convince me with brute force instead?&lt;/p&gt;&#xA;&lt;p&gt;Write a program or function which:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;takes no input&lt;/li&gt;&#xA;&lt;li&gt;generates all the possible 3-byte sequences matching the pattern &lt;code&gt;ABA&lt;/code&gt; and evaluates them in the same language. (No using one language to generate the best pattern for a different language).&lt;/li&gt;&#xA;&lt;li&gt;Processes all the ones which evaluate to digits-only (output text matches the regex &lt;code&gt;^[0-9]+$&lt;/code&gt;, with or without trailing newline).&lt;/li&gt;&#xA;&lt;li&gt;Outputs just the &lt;code&gt;ABA&lt;/code&gt; sequence which evaluated to the highest value, and an optional trailing newline. No errors or stderr output from failed evaluations.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Clarifications:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There's no limit on runtime, but your program must at least plausibly finish if run for long enough. Particularly, if evaluating one of the byte sequences would get stuck prompting for keyboard input, or go into an infinite loop, or quit the interpreter, you must avoid or handle that.&lt;/li&gt;&#xA;&lt;li&gt;If you are able to usefully reduce the search space (and explain why it's valid for your language) to avoid searching 256^2 options, that's OK. Especially if you need to do so to get past an infinite loop, etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Show off your brute-force strength by forcing your brute-forcer into the smallest possible space. Fewest bytes wins.&lt;/p&gt;&#xA;&lt;p&gt;Tag: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="571" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-09T18:54:13.307" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12806" PostTypeId="1" CreationDate="2017-06-09T18:35:25.477" Score="0" ViewCount="54" Body="&lt;p&gt;It seems as if allowing this would speed up testcase correction and reduce comments.&lt;/p&gt;&#xA;" OwnerUserId="51443" LastActivityDate="2017-06-09T18:56:17.867" Title="Is editing a challenge to fix a testcase allowed?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12808" PostTypeId="2" ParentId="12806" CreationDate="2017-06-09T18:56:17.867" Score="3" Body="&lt;h1&gt;Well, it depends.&lt;/h1&gt;&#xA;&lt;p&gt;If you are given a certain protocol to be applied to a certain input, then it is fine to edit if the community spots the error.&lt;/p&gt;&#xA;&lt;p&gt;So, if your challenge is to output &lt;code&gt;n*2&lt;/code&gt; given &lt;code&gt;n&lt;/code&gt;, you can fix it.&lt;/p&gt;&#xA;&lt;h1&gt;However,&lt;/h1&gt;&#xA;&lt;p&gt;If the output is interpretable (like an ASCII-art challenge), you better should ask the author to either make clarifications or correct the test case. You may edit that, and if you are proved to have misedited, anyone can call a rollback to the initial test cases.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-09T18:56:17.867" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12811" PostTypeId="1" AcceptedAnswerId="12813" CreationDate="2017-06-09T22:28:44.993" Score="-1" ViewCount="37" Body="&lt;p&gt;Some questions require some amount of golfing because they have a maximum byte limit or are answer chaining and require no more than x bytes added to the previous answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, code golf is not the winning criterion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What should these questions be tagged?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-compression&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-compression&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user58826" LastActivityDate="2017-06-10T04:46:01.927" Title="What tag for questions that require code golfing to be valid?" Tags="|discussion|code-golf|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12812" PostTypeId="2" ParentId="12811" CreationDate="2017-06-09T22:47:10.553" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From the wiki for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;: &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Code-golf is a competition to solve a particular problem in the fewest bytes of source code&#xA;  ...&#xA;  If source code length is not the primary scoring criterion, consider using another tag instead.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In these challenges, source code length is not the primary scoring criterion; rather, it is simply an additional restriction that affects validity not scoring.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From the wiki for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;, however:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Imposes a restriction on the source code used to solve the challenge&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Generic, but describes exactly what's going on here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-compression&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-compression&lt;/a&gt; hasn't been used anywhere and sounds more like actually compressing (like gzip) source code in some way, so I don't think it's a good fit.&lt;/p&gt;&#xA;" OwnerUserId="45151" LastActivityDate="2017-06-09T22:47:10.553" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12813" PostTypeId="2" ParentId="12811" CreationDate="2017-06-10T04:46:01.927" Score="0" Body="&lt;h1&gt;Neither&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Tags are about search-ability.  We want people to get relevant results when they search a tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Categorizing these as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is misleading if not false.  These types of questions are not code-golf and any person looking for code-golf questions would not want to see these. Plain and simple.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While these questions do technically impose a source restriction they should not be tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; because thats not what restricted source is about.  Restricted source questions are about creating interesting puzzles by removing the ability to use all of the aspects of a language.  Most commonly size limits are put in place as a way to prevent people from obtaining arbitrarily large scores.  Since people searching for a tag are looking for challenges &lt;em&gt;about&lt;/em&gt; that tag, the tag should be salient to the challenge for it to be applied.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We should also not make a new tag.  The new tag would add nothing.  I cannot imagine a situation where someone would want to search for questions with this feature.  Its not a style of question and the questions would be a largely random selection of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; questions.  Its like having a tag for challenges that ban builtins.  We don't need to categorize every aspect of a question, just the ones people might search for.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-06-10T04:46:01.927" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12816" PostTypeId="2" ParentId="12599" CreationDate="2017-06-10T08:07:04.187" Score="0" Body="&lt;h2&gt;Do nothing&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I see no problem with the sandbox at the moment. Sure, it is stupidly big and crashes the mobile app, but use the mobile site instead, for sandboxing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I, and I'm sure countless many others have never experienced a problem with the sandbox because it does what it's supposed to (but inevitably, &lt;em&gt;a few&lt;/em&gt; answers have slipped through the net)&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2017-06-10T08:07:04.187" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12817" PostTypeId="2" ParentId="12792" CreationDate="2017-06-10T12:21:54.870" Score="2" Body="&lt;h1&gt;Go slow&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Whatever action is taken, if it isn't &quot;No action&quot; then it has the potential to be incredibly disruptive. The same principle applies as with big retagging projects: if everything is tackled at once then it floods the first page with trivial changes, burying new content.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If 50 posts are edited as a result of their owners responding to warnings about possible deletion then all recent sandboxed posts will be pushed back two pages, and the amount of &quot;new&quot; material will be so much that some of the ideas which people are trying to save will not be reviewed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In short: doing this badly will exacerbate the problem it's trying to solve. Do not rush.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-06-10T12:21:54.870" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12818" PostTypeId="2" ParentId="12599" CreationDate="2017-06-10T13:40:16.300" Score="7" Body="&lt;h1&gt;Add an Option To Hide Deleted Posts&lt;/h1&gt;&#xA;&lt;p&gt;Most reviewers sort Sandbox posts by activity and, as deleted posts are included in that sort, they cause a lot of clutter - it's far too easy to scroll past a short challenge sandwiched between a few deleted ones, for example.&lt;/p&gt;&#xA;&lt;p&gt;I propose an option that would easily allow for the toggling of the visibility of deleted posts. A userscript would probably be the way to go, rather than expecting SE to implement this for us.&lt;/p&gt;&#xA;&lt;p&gt;This proposal obviously doesn't address any of the larger issues being discussed here but should help reduce some of the &amp;quot;noise&amp;quot; in the Sandbox.&lt;/p&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-10T19:53:47.887" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12819" PostTypeId="1" CreationDate="2017-06-10T15:20:47.617" Score="10" ViewCount="404" Body="&lt;p&gt;At times, it may be advantageous for a solution to a challenge to make certain assumptions about, for example, the directory from which it is run. For example, a bash script that compiles and runs a file with &lt;code&gt;gcc&lt;/code&gt; can reduce&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;./a.out&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;to&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;./a*&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;if it can safely assume that no other files in the present working directory have a name that begins with &lt;code&gt;a&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should this be allowed? What about assumptions about the file name of the code being run? We already have a policy that adds the length of the file name to the score if it has to have a certain name (informal? I can't find a definitive statement of this policy), but what if the file name simply &lt;em&gt;can't&lt;/em&gt; be a certain string (for example, the bash script above would have to have a name that &lt;em&gt;doesn't&lt;/em&gt; start with &lt;code&gt;a&lt;/code&gt;)?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another interesting conundrum is tricks like &lt;code&gt;/d*/u*m&lt;/code&gt; instead of &lt;code&gt;/dev/urandom&lt;/code&gt;. On my system, &lt;code&gt;/dev/urandom&lt;/code&gt; is the only file that matches the glob, but this may not be the case on others.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How should these cases be handled?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;(note that my self-answers are intended as proposals and not declarations; treat them in the same manner as you would if they were posted by any other user.)&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2017-06-11T04:01:28.243" Title="What assumptions about the file system layout can be made?" Tags="|discussion|policy|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12820" PostTypeId="2" ParentId="12819" CreationDate="2017-06-10T15:20:47.617" Score="11" Body="&lt;h2&gt;Assumptions about the file name&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To restate a policy that I thought we had but can't actually find a source for: If the submission is required to have a certain file name, the length of the file name must be added to the submission's score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the submission fails for &lt;em&gt;any&lt;/em&gt; legal file name, it &lt;em&gt;must&lt;/em&gt; specify a file name to be used and count this name in the score. (This does not apply to submissions that can be run by providing the code itself as a command line argument, of course.) This is the only way I can think of to prevent abuse of the rules such as &quot;this works for an infinite number of file names, but it has to start with &lt;code&gt;Hello, World!&lt;/code&gt;.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To put it another way, a file name (this applies for every file name in multi-file submissions) can only not be counted in the score when the file name is wholly immaterial to the functionality of the submission and only affects the invocation of the submission. This is consistent with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/4933/3808&quot;&gt;our existing policy for multi-file submissions&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2017-06-10T15:20:47.617" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12821" PostTypeId="2" ParentId="12819" CreationDate="2017-06-10T15:22:21.837" Score="13" Body="&lt;h2&gt;Assumptions about the working directory&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The present working directory may be assumed to be empty. If the program is run from a file, the present working directory may alternatively be assumed to be empty except for the file being run.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, nothing may be assumed about the full path to the present working directory except that it is a legal path name on the system in question. (That is, solutions must handle cases where the path to the present working directory contains spaces, for example.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a submission requires an extra file in the present working directory, it should be counted according to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/4933/3808&quot;&gt;our existing policy for multi-file submissions&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2017-06-10T15:22:21.837" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12822" PostTypeId="2" ParentId="2140" CreationDate="2017-06-10T15:57:25.470" Score="-1" Body="&lt;h1&gt;Plan and Chain a route through OEIS&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/bitwise&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;bitwise&amp;#39;&quot; rel=&quot;tag&quot;&gt;bitwise&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your Task is to reach so many OEIS sequences you could make with chaining your last sequence with a operation to a new sequence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must avoid last sequence minus last sequence plus first sequence or something similar that your new sequence is based on the first sequence except to make the second sequence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your starting OEIS sequence is in every case &lt;a href=&quot;https://oeis.org/A001477&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://oeis.org/A001477&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given as Input an positive Integer and a Letter that matches [A-Z] or [a-Z]&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;https://php.net/&quot; rel=&quot;nofollow noreferrer&quot;&gt;PHP&lt;/a&gt;, 171 bytes&lt;/h1&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-php prettyprint-override&quot;&gt;&lt;code&gt;for($a=0;$a&amp;lt;=$argv[1];$a++)$r[]=[$a,$b=$a&amp;amp;1,$c=$a+!$b,$d=(($c-!$b)/2^0)+$b,$A[$b]=$e=$d*$c,$f=$e+$A[!$b],$g=$a?$g*sqrt($f):1,$h=$g%2];echo$r[$argv[1]][ord($argv[2])%32-1];&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##dZDJTsMwEIbveQoTpihbiZ1u6mJVFeqBC1y4RaFyEmeR2jidpBx59TJQIS7hYs@Mv/n/GbdVe91s26q1NKLBA@rWYF83pfO5P7y8vj0/7d21BQrLDxnbYzuwBadD28n6Whh0QEm@BrWRP0gsEkp83wWMExmDCiCllwcRQEa3fwdpALl0HMjGFLth9M5d/7u4iyFNJGgJuQdZAAXFPlWJSgIoqXkLpdedsXegcFckWEkoR1Gy1lllyO7XP4kN5s4tixJ3NInGNNT1vsW66Q80MNI@oUcrsarv224VhkbX3aPBMtxxLqaLBWsup1RjZ0E6yHA@mbGTyVnELMgGEMGXczFhJs//pPIhTvD5bMqU07hMsuJo6EObMHKZz5qbgQV6eIRILFiPtWrKy1GhBcU/2JKz7nxRqC0ohxExjVihst6Q2tHywusX&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;PHP – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The example gives back the n value of a OEIS sequence for the following letters. A letter greater &lt;code&gt;h&lt;/code&gt; is for this example a invalid input &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;a &lt;a href=&quot;https://oeis.org/A001477&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://oeis.org/A001477&lt;/a&gt; numbers&lt;br&gt;&#xA;&lt;code&gt;$a&lt;/code&gt; Valid first sequence&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;b &lt;a href=&quot;https://oeis.org/A000035&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://oeis.org/A000035&lt;/a&gt; mod 2&lt;br&gt;&#xA;&lt;code&gt;$b=$a&amp;amp;1&lt;/code&gt; Valid use the variable in the sequence before&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;c &lt;a href=&quot;https://oeis.org/A109613&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://oeis.org/A109613&lt;/a&gt; odd numbers&lt;br&gt;&#xA;&lt;code&gt;$c=$a+!$b&lt;/code&gt; Valid Can use sequences before&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;d &lt;a href=&quot;https://oeis.org/A110654&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://oeis.org/A110654&lt;/a&gt; a(n) = floor(n/2) + n mod 2&lt;br&gt;&#xA;&lt;code&gt;$d=(($c-!$b)/2^0)+$b&lt;/code&gt; Valid &#xA;an invalid example is &lt;code&gt;$d=(($a/2)^0)+$b&lt;/code&gt; cause it not use the sequence before &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;e &lt;a href=&quot;https://oeis.org/A000217&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://oeis.org/A000217&lt;/a&gt; triangular&lt;br&gt;&#xA;&lt;code&gt;$A[$b]=$e=$d*$c&lt;/code&gt; Valid you can create help variables  &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;f &lt;a href=&quot;https://oeis.org/A000290&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://oeis.org/A000290&lt;/a&gt; square&lt;br&gt;&#xA;&lt;code&gt;$f=$e+$A[!$b]&lt;/code&gt; Valid use a help variabale and the variable of the sequence before. &lt;code&gt;$f=$A[!$b]+$A[!$b]&lt;/code&gt; Invalid causes it makes the same value but use indirectly the variable of the sequence before&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;g &lt;a href=&quot;https://oeis.org/A000142&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://oeis.org/A000142&lt;/a&gt; factorial  &lt;code&gt;$g=$a?$g*sqrt($f):1&lt;/code&gt; Valid&#xA;cause your condition is not always the case that it have no&#xA;relationship to the sequence before. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;h &lt;a href=&quot;https://oeis.org/A019590&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://oeis.org/A019590&lt;/a&gt; Fermat's Last Theorem  &lt;code&gt;$h=$g%2&lt;/code&gt; Valid but now we have the problem to find the next sequence&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Could You make a full alphabet? My alphabet ends with the letter h&lt;/p&gt;&#xA;" OwnerUserId="59107" LastEditorUserId="59107" LastEditDate="2017-06-10T21:52:12.057" LastActivityDate="2017-06-10T21:52:12.057" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="12823" PostTypeId="2" ParentId="12599" CreationDate="2017-06-10T17:17:29.127" Score="-5" Body="&lt;p&gt;I say Sandbox it seems to me too much big...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I say it would be prohibited to post heavy content [only text objects not photo, embedded film etc]  and organize all the posts in a way each one of us has at max 1 post in sandbox even with more question in his only post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or break the sandbox in 3 pieces: The one for math numeric questions, the one for strings type questions, the one for all other type questions.&lt;/p&gt;&#xA;" OwnerDisplayName="user58988" LastEditorDisplayName="user58988" LastEditDate="2017-06-10T18:58:10.060" LastActivityDate="2017-06-10T18:58:10.060" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12824" PostTypeId="2" ParentId="12757" CreationDate="2017-06-10T19:07:39.433" Score="1" Body="&lt;p&gt;OK, so with 13 upvotes and a fair few comments this seems to be a question that has attracted some attention so maybe I can now clarify what I am thinking with the benefit of what you guys have said so far.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Many thanks to @ais523 for taking the time to submit such a well thought out and well presented answer. Most of my points are related to what was said in the above answer.&lt;/li&gt;&#xA;&lt;li&gt;Duplicates - as mentioned by @numbermaniac, many duplicates are duplicates of old questions and things have probably changed since then. new languages, new users, etc. I really don't think that the response &quot;Go and answer the original question&quot; carries much incentive to do so. By all means identify it as a duplicate if it makes you feel good, by all means don't answer it if you don't want to but why close it? This is not a Q&amp;amp;A site. I often come on PPCG just to read what people have done and I can gain a lot from other peoples answers to dupes. I agree that we don't want the same questions coming up every week. Maybe a time limit could work? If the original is more than (e.g) a year old then let it run and see what happens.&lt;/li&gt;&#xA;&lt;li&gt;Unclear what you are asking - I have actually been surprised by this response to some questions as they have seemed perfectly clear to me. I sometimes wonder if this is just being used as a &quot;catch all&quot; by people who just don't like the question for their own reasons. On previous threads I have made my opinion clear that the sandbox should be mandatory for all users below xxxx rep (to be decided) before they post live. A bit like users cannot comment until they reach a certain rep and that other privileges are gained as rep increases. The idea is not a new concept.&lt;/li&gt;&#xA;&lt;li&gt;On the subject of sandbox, I have read a couple of times that people do not use it because they leave their questions there for a week and get no negative comments then have their questions closed when posted live. Maybe we could all make more effort to monitor and help in the sandbox. I admit I am as guilty as any. Although I have used the sandbox for all of my questions (and received valuable feedback) I sure don't spend enough time helping others there.&lt;/li&gt;&#xA;&lt;li&gt;I guess, as I said in the original question, the site seems to have changed in the year since I joined. There have been questions on meta about e.g. &quot;What can we do to support new members?&quot;. My answer would be not to be so aggressive and not close questions so quickly without a decent and detailed explanation why. One thing I suggested on a previous comment was a one month read-only membership requirement (or maybe only be allowed to answer questions and not ask them). I seem to remember that it was suggested that this is setting a very high barrier to membership. Which is better? Fewer member or more &quot;duplicates&quot; and &quot;unclears&quot;? I certainly feel that the attitude to new members who maybe don't have a full understanding about what the site is about has become far more aggressive in recent months.&lt;/li&gt;&#xA;&lt;li&gt;Finally, this is nothing to do with not being able to compete. I am currently learning Pyth, regularly post Python answers which are never going to beat @xnor (or the other more gifted Python programmers many of whom have given me some great hints in the past) and also post using Lotus Notes Formula which is only slightly less verbose than VerboseScript (which I am writing at the moment ;-)). As I have said before I joined because it is fun. Let's keep it that way.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;@Dennis. I hope this helps to clarify what you asked in your comment.&lt;/p&gt;&#xA;" OwnerUserId="56555" LastEditorUserId="56555" LastEditDate="2017-06-10T19:19:22.110" LastActivityDate="2017-06-10T19:19:22.110" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="12825" PostTypeId="1" CreationDate="2017-06-10T20:35:13.600" Score="7" ViewCount="217" Body="&lt;p&gt;The sandbox is a helpful feature&lt;sup&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12599/we-need-to-talk-about-the-sandbox?answertab=votes#tab-top&quot;&gt;[citation needed]&lt;/a&gt;&lt;/sup&gt; but often I have a question that I feel needs to be tested before it can be asked.  This is usually the case with a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; question or questions with unique scoring systems.  Its hard to predict how you specifications will stack up in the wild making feedback not sufficient.  As an example &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12807/56656&quot;&gt;my latest sandboxed challenge&lt;/a&gt; is an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; question that probably needs some fine tuning to make sure it will be neither extremely trivial or impossibly difficult to create new answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since I can't really fine tune the specifications of a challenge after it is release, I often feel like it would be nice to test out the challenge with a soft-release.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there any way I might do this?  Perhaps I should try the challenge in a chat room?  Any suggestions are welcome.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-06-11T14:02:46.557" LastActivityDate="2017-06-11T14:02:46.557" Title="Test a question" Tags="|discussion|sandbox|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12826" PostTypeId="2" ParentId="12825" CreationDate="2017-06-10T21:35:37.323" Score="9" Body="&lt;h1&gt;Invite &amp;quot;Beta Testers&amp;quot; To Try It&lt;/h1&gt;&#xA;&lt;p&gt;In cases where a challenge might seem like a good idea on paper but really requires it to be executed and tested to be sure, one could, publicly or privately, invite one or more people to do so prior to posting it to main with the condition that those &amp;quot;beta testers&amp;quot; not be permitted to compete when the challenge is posted to main as they would have had the advantage of having had more time to work on their solutions (although, that may be dependent on the challenge type).&lt;/p&gt;&#xA;&lt;p&gt;With regards to how that should be implemented:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When posting to Sandbox, you could include a notice that you're looking for people to test drive your challenge and, possibly create a private chat for you and your testers.&lt;/li&gt;&#xA;&lt;li&gt;A chatroom could be set up that would either be invite-only or have a higher rep requirement than normal rooms (assuming either is possible) to serve this purpose. This would have the added benefit of challenges that end up being &amp;quot;bad&amp;quot; never reaching the Sandbox thereby reducing a little bit of the clutter.&lt;/li&gt;&#xA;&lt;li&gt;Create a new Meta question, of a similar format to the Sandbox, but specifically for those challenges that need to be taken for a test drive. (Yeah, I'm not a fan of that one, either!)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Footnote: Yes, I'm well aware that people do use the Sandbox to get a headstart on challenges in order to be the FGITW (or whatever their reasons) - I admit to being guilty of it myself when I can't find a challenge on Main that sparks my interest - but, if we adopt my proposal, it should help benefit the community rather than the individual.&lt;/p&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-10T22:07:40.033" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12828" PostTypeId="1" AcceptedAnswerId="12830" CreationDate="2017-06-11T00:39:18.433" Score="-6" ViewCount="83" Body="&lt;p&gt;I suggest we lower the rep required to chat to 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This way we can help new users understand the site instead of having them &quot;crash and burn&quot; on main with a invalid or non-golfed submission or an awful challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, if a user &lt;em&gt;does&lt;/em&gt; &quot;crash and burn&quot;, than we can explain what they did wrong to them in chat.&lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastEditorUserId="68942" LastEditDate="2021-06-09T05:38:00.970" LastActivityDate="2021-06-09T05:38:00.970" Title="Lower the rep required to chat" Tags="|feature-request|status-declined|new-users|chat|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12830" PostTypeId="2" ParentId="12828" CreationDate="2017-06-11T03:35:37.967" Score="8" Body="&lt;p&gt;Consider this: A spammer goes onto Stack Exchange Chat, then creates an account, and then is promptly allowed to post messages immediately.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is an obvious flaw. If something requires rep, it means that you have to have demonstrated sufficient helpfulness (or at least decency) before being allowed to do that.&lt;/p&gt;&#xA;" OwnerDisplayName="user42649" LastActivityDate="2017-06-11T03:35:37.967" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12831" PostTypeId="1" CreationDate="2017-06-11T03:40:22.513" Score="34" ViewCount="519" Body="&lt;p&gt;It's a fairly long-standing principle of PPCG that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7833/62131&quot;&gt;languages are defined by their implementations&lt;/a&gt;; in other words, the language specification is entirely ignored, and we look at the behaviour of an implementation in practice to determine how the program works. This means that if no interpreter can run the program (e.g. because existing interpreters are buggy), the program can't be submitted at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's &lt;em&gt;also&lt;/em&gt; a fairly long-standing principle of PPCG that submissions should work on all possible inputs (even if the corresponding output would be far too complex for a system to print, or far too large for a computer to be able to store); and on the flip side, submissions are commonly so inefficient that they couldn't possibly run in practice even on fairly small inputs. (For example, a program that uses O(2&lt;sup&gt;2&lt;sup&gt;&lt;em&gt;n&lt;/em&gt;&lt;/sup&gt;&lt;/sup&gt;) time or memory would typically be considered an appropriate submission.) As such, submissions tend to be verified not by using test cases (which would be impossible for most challenges, as they accept an infinite space of possible inputs), but rather by giving a proof that the submission would work (or even more indirectly, by challenging people to find a counterexample and assuming the answer is correct if nobody can find one).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, there's something of a contradiction here. We're starting off by saying &quot;following the specification is not enough, you have to run the program to prove it works&quot;. Then we're saying &quot;it's OK if the program can't actually run in practice, just so long as it could run in theory if you had an infinitely powerful computer&quot;. From my point of view, it doesn't make sense to have these rules at the same time; we could have either individually, but the combination is problematic. We have a rule that language specifications aren't relevant – and yet people repeatedly resort to them in an attempt to demonstrate that their program works for all input (because trying to prove facts about a &lt;em&gt;language implementation&lt;/em&gt; is almost impossible in practice unless using a certified compiler, as the implementation tends to be much more complex than the specification). We have a rule that languages can't exploit their own limited integer sizes to simplify the problem – and yet we define the behaviour of the language on those integers via observing what the implementation does, and it doesn't.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How can we reconcile these rules to be more compatible with each other?&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-16T18:25:13.097" Title="If languages are defined by their implementations, how do we judge answers that can't run on any existing computer?" Tags="|discussion|rules|" AnswerCount="4" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12832" PostTypeId="2" ParentId="12819" CreationDate="2017-06-11T04:01:28.243" Score="0" Body="&lt;h1&gt;Quinelike things can't store info in the file name&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;you may not print(filename) etc.&lt;/p&gt;&#xA;" OwnerUserId="55896" LastActivityDate="2017-06-11T04:01:28.243" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12833" PostTypeId="2" ParentId="3634" CreationDate="2017-06-11T04:09:42.973" Score="2" Body="&lt;h1&gt;This is valid, so long as the I/O is as simple as possible&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There are a few ways to get a zero-byte solution. This is one of the more controversial ones, but it isn't automatically unacceptable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Suppose that the challenge was &quot;concatenate a list of strings&quot;, and someone submitted the following program:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;&lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt;, 0 bytes&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;&lt;a href=&quot;https://tio.run/##y0rNyan8DwLRSh5Adr6SjgIUlecX5aQoKsUCAA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Jelly – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Takes input as a command line argument in the form &lt;code&gt;[&quot;a&quot;, &quot;b&quot;, &quot;c&quot;]&lt;/code&gt;. Output is to standard output.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is about as legitimate you can get in terms of pure-I/O solutions. The input list is being fed to a Jelly full program in the simplest possible way (and in a very common format for lists of strings even in other languages). Jelly, when outputting a list of strings from a full program, implicitly concatenates them; thus, the resulting output on standard output will be the concatenation of the input lists – and standard output is the simplest, most direct way to get output from a Jelly full program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When things start going south is when you start having to make assumption about I/O that normally wouldn't be warranted. Say the challenge was &quot;take a list as input; return normally if it has exactly two elements, crash or throw an error/exception otherwise; submit a snippet, you may take input from a variable&quot;. Brachylog has a special variable &lt;code&gt;Ċ&lt;/code&gt; that's only normally capable of holding lists which have two elements (causing a failure, the equivalent of an exception, if you attempt to assign anything else to it). Can we submit a zero-byte solution that says &quot;Takes input from &lt;code&gt;Ċ&lt;/code&gt;&quot;? It would work when run, but it feels a bit like we're encoding the program in something that isn't part of the byte count (specifically, the name of the variable used to store the input). On the other hand, I'd consider the 1-byte snippet &lt;code&gt;Ċ&lt;/code&gt; (which assigns the value of &lt;code&gt;?&lt;/code&gt; to &lt;code&gt;Ċ&lt;/code&gt;) a valid answer to this, as &lt;code&gt;?&lt;/code&gt; is a distinguished variable intended for providing input to programs, and there are no other variables like it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As such, I believe that this sort of answer can only be valid if we don't attempt to encode anything in the I/O system. For example, if we take input from a variable, the program should work identically for any valid variable name (with the understanding that the bytecount is measured using the shortest possible name).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One caveat: this answer contradicts our I/O defaults to some extent. For example, allowing &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8511/62131&quot;&gt;I/O via distinguished memory locations&lt;/a&gt; is just asking to fall into traps like this, where much of the work of the program can be done in the I/O via picking a specific memory address to use. (However, that answer is highly popular; I'm currently the only downvote on it.) We can fix this either by interpreting our I/O defaults narrowly to say &quot;if I/O via a variable / memory location / register is allowed for a particular language via our I/O defaults, it must work regardless of which variable/location/register of a sort that could reasonably contain the answer is used&quot; (which strikes me as being potentially unobjective), or simply via downvoting/deleting the relevant answers in the I/O defaults thread. I've posted a competing answer &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12834/62131&quot;&gt;here&lt;/a&gt;, which should avoid this sort of trouble unless the challenge explicitly overrides the I/O defaults.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-11T04:09:42.973" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12834" PostTypeId="2" ParentId="2447" CreationDate="2017-06-11T04:11:58.147" Score="7" Body="&lt;h1&gt;Assembly language / machine code must take input and output as defined by an ABI for the platform that predates the challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For example, most commonly used ABIs for x86 state that 32-bit integer outputs are returned in the &lt;code&gt;%eax&lt;/code&gt; register. As such, that's a valid way to output a 32-bit integer. However, outputting in, e.g., &lt;code&gt;%esp&lt;/code&gt; would not be valid, unless a pre-existing ABI can be located where that's considered a valid method of output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Some background for people unaware of assembly language technology: an ABI, or Application Binary Interface, is a specification for how pieces of code within a particular program, on a particular platform, communicate with each other via the state of the processor. Most ABIs specify specific memory addresses and/or registers to be used for the communication.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is outright intended as a competing answer to the other assembly-language-related answers, because I feel they're too permissive and could lead to loopholes in which bytes are moved from the program to a selection of a register/memory address. (See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12833/62131&quot;&gt;this answer&lt;/a&gt; and the corresponding question for more detail.)&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-11T04:11:58.147" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12836" PostTypeId="2" ParentId="2140" CreationDate="2017-06-11T11:31:43.943" Score="1" Body="&lt;h1&gt;stdin FPS&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Count the input FPS (&quot;F&quot;s per second)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Task:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Read a potentially infinite text stream. While you do, display (at least once per second) your FPS, i.e. the amount the characters &quot;f&quot; or &quot;F&quot; appeared.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The FPS has to be accumulated over a time frame of five seconds, meaning you can't just print the number of Fs you've seen this second every second.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard loopholes are banned&lt;/li&gt;&#xA;&lt;li&gt;Read one character (or byte) at a time. If (and only if) your language doesn't have the ability to read characters as they appear in the input, you may read the input one line at a time.&lt;/li&gt;&#xA;&lt;li&gt;The FPS display may be in any reasonable format, for example &lt;code&gt;3.54fps&lt;/code&gt; or &lt;code&gt;0.9224&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;You may round the resulting numbers to 2 (or more) digits after the decimal point, but no less. Displaying only integers is not allowed.&lt;/li&gt;&#xA;&lt;li&gt;To display a new value, you may either:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;clear the screen before printing a new value,&lt;/li&gt;&#xA;&lt;li&gt;overwrite the existing value,&lt;/li&gt;&#xA;&lt;li&gt;or seperate the values by newline characters&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Be case-insensitive&lt;/li&gt;&#xA;&lt;li&gt;In the first second, you don't have to display anything, and if you do, your value doesn't have to be accurate or meaningful.&lt;/li&gt;&#xA;&lt;li&gt;Before five seconds have elapsed, you have to average over the total elapsed time since execution started.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Sandbox questions:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Dupes? (I don't know what to search for)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="21173" LastEditorUserId="21173" LastEditDate="2017-06-11T12:05:48.757" LastActivityDate="2017-06-11T12:05:48.757" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12837" PostTypeId="1" CreationDate="2017-06-11T13:59:41.757" Score="1" ViewCount="132" Body="&lt;p&gt;Currently if you wish to take input as a string in Brain-Flak you are going to need the &lt;code&gt;-A&lt;/code&gt; flag.  This looks like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$brainflak test.flk -A Hello&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Every answer that uses this &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/273/on-interactive-answers-and-other-special-conditions&quot;&gt;has to add 3 bytes to its total&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Currently if you would like to take input as a string in Python you are allowed to use &lt;code&gt;input()&lt;/code&gt; and &lt;em&gt;assume&lt;/em&gt; that the input ins provided in a proper string format (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11925/56656&quot;&gt;Python IO&lt;/a&gt;). This looks like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$echo &quot;\&quot;Hello World\&quot;&quot; | python test.py&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This cost you no bytes (in fact it saves you bytes from having to use &lt;code&gt;raw_input()&lt;/code&gt;)  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This seems a little unfair, &lt;code&gt;-A&lt;/code&gt; is only telling the interpreter&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Hey this thing is about to be a string don't try to interpret it as a number.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Which is pretty much the same thing that Python is doing with its quotes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why should &lt;code&gt;&quot;&lt;/code&gt; be considered part of the input while &lt;code&gt;-A&lt;/code&gt; is considered part of the program?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-06-11T18:45:59.447" LastActivityDate="2017-06-12T22:54:33.747" Title="Why should Brain-Flak pay for input when Python doesn't have to?" Tags="|discussion|" AnswerCount="1" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="12840" PostTypeId="2" ParentId="12831" CreationDate="2017-06-11T22:53:33.437" Score="-6" Body="&lt;h2&gt;As long as no one can disprove that it works, it's fine&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When submitting a potentially problematic answer, the user can specify which implementation it would &lt;em&gt;theoretically&lt;/em&gt; work on, and, as long as no one disproves that it would work in that implementation, on a computer with infinite resources, the submission is valid.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastActivityDate="2017-06-11T22:53:33.437" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12841" PostTypeId="1" AcceptedAnswerId="12858" CreationDate="2017-06-12T05:55:23.457" Score="6" ViewCount="139" Body="&lt;p&gt;I just noticed we have both &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/anagrams&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;anagrams&amp;#39;&quot; rel=&quot;tag&quot;&gt;anagrams&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt;. Is there any reason not to make &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/anagrams&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;anagrams&amp;#39;&quot; rel=&quot;tag&quot;&gt;anagrams&lt;/a&gt; a synonym of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt;? If so, how should the tags be used?&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2017-06-16T10:50:19.120" LastActivityDate="2017-06-16T10:50:19.120" Title="Synonyms: [anagrams] and [permutations]" Tags="|discussion|status-completed|tags|tag-synonyms|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12842" PostTypeId="2" ParentId="12831" CreationDate="2017-06-12T06:13:29.030" Score="-6" Body="&lt;h1&gt;Very slow solutions should be non-competing&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Note: non-competing does not mean the user must notpost her solution. Rather, the solution should be posted and labeled &amp;quot;non-competing.&amp;quot;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Per &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8461/60043&quot;&gt;this consensus&lt;/a&gt;, the OP should accept answers after verifying them. That is, if some answers cannot be verified (either by OP or other members), they are not eligible to get accepted, meaning they are non-competing.&lt;/p&gt;&#xA;&lt;p&gt;Thus, a slow (practically impossible to run) program should be non-competing, as it is impossible to verify whether the solution actually works.&lt;/p&gt;&#xA;&lt;p&gt;Of course, if the solution becomes not-slow due to improvement in technology, it could become competing. Conversely, a slow solution should not be competing until it can be verified.&lt;/p&gt;&#xA;" OwnerUserId="60043" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-16T12:03:35.623" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12843" PostTypeId="2" ParentId="12831" CreationDate="2017-06-12T13:45:32.567" Score="-1" Body="&lt;h2&gt;Languages are defined by an &lt;em&gt;idealized&lt;/em&gt; version of their implementation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For example, if you are working in python and are using the official python implementation, you are actually using one that has all limits set arbitrarily high, and executes immediately.&lt;/p&gt;&#xA;" OwnerUserId="16842" LastActivityDate="2017-06-12T13:45:32.567" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12844" PostTypeId="2" ParentId="12841" CreationDate="2017-06-12T13:52:33.320" Score="4" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/anagrams&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;anagrams&amp;#39;&quot; rel=&quot;tag&quot;&gt;anagrams&lt;/a&gt; should be turned into &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is because an anagram is a particular type of permutation: a permutation of a string.&lt;/p&gt;&#xA;" OwnerUserId="16842" LastActivityDate="2017-06-12T13:52:33.320" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12845" PostTypeId="1" CreationDate="2017-06-12T13:56:06.943" Score="8" ViewCount="227" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; is a hard tag to create questions for. Its hard balance between vagueness and broadness. What are some good examples that other challenges should seek to emulate?&lt;/p&gt;&#xA;" OwnerUserId="16842" LastEditorUserId="68615" LastEditDate="2017-06-19T15:19:11.950" LastActivityDate="2017-06-19T15:19:11.950" Title="Good examples of popularity contest challenges" Tags="|discussion|asking-questions|challenges|popularity-contest|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12846" PostTypeId="1" AcceptedAnswerId="13714" CreationDate="2017-06-12T16:43:41.510" Score="1" ViewCount="136" Body="&lt;p&gt;Using &lt;a href=&quot;https://codegolf.stackexchange.com/q/125715/58974&quot;&gt;this challenge&lt;/a&gt; as an example and &lt;a href=&quot;https://codegolf.stackexchange.com/a/125759/58974&quot;&gt;this JavaScript solution&lt;/a&gt;, you can see that Kaiido had to include the following additional 49 bytes in order to be able to retrieve the images from XKCD's servers:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;i.crossOrigin=&quot;anonymous&quot;;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;https://crossorigin.me/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This happens a &lt;em&gt;lot&lt;/em&gt; with JavaScript (and, I'd imagine, other languages too). In fact, I've encountered this issue in &lt;em&gt;every&lt;/em&gt; challenge I've attempted that requires the retrieval of a file from an external site (excluding some APIs).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question is: should the byte count of solutions in answers that can't retrieve files directly due to restrictions in place on the servers hosting the files be penalised for having to include workarounds? Using the example above, should Kaiido's entry be considered valid without the additional code, with it &lt;em&gt;only&lt;/em&gt; being added to the Snippet/TIO in order to demonstrate that the solution works?&lt;/p&gt;&#xA;" OwnerUserId="58974" LastActivityDate="2017-08-15T01:01:51.070" Title="Should Proxy Usage Be Included in Byte Counts?" Tags="|discussion|rules|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12850" PostTypeId="2" ParentId="12845" CreationDate="2017-06-12T21:09:56.070" Score="3" Body="&lt;p&gt;The best fit I've seen for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; recently is &lt;a href=&quot;https://codegolf.stackexchange.com/q/111092/62131&quot;&gt;this challenge&lt;/a&gt;. It's a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-design&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-design&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-design&lt;/a&gt; challenge, but the aim is to find the &lt;em&gt;most appropriate&lt;/em&gt; way to work an interesting property into the language. That's something that's a) very difficult to define objectively, b) will have a reasonable consensus upon voters when defined subjectively, c) is nonetheless clearly in the general topic area of programming, with programming and language design skill being very relevant, and d) is likely to be close to the vote counts that the posts would &quot;naturally&quot; get if the challenge didn't have a win condition.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This allows us to extrapolate as to what would make a good popularity contest in general.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first thing to note is that the victory condition you'd &quot;actually want&quot; has to be close to the typical uses of upvotes, or else you'll get mixed results as some people vote the way you want and some people don't. In particular, you must therefore be looking for elegance, humour, appropriate language choice, golfiness (to a small extent – this is better measured objectively), unreadability/obfuscation, or good explanations. (Note that the reason voting as a sorting criterion works fairly well on many other Stack Exchange sites is that &quot;good explanations&quot; are the &quot;victory condition&quot; there. Even here, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; has a sort of inherent &quot;popularity contest&quot; victory condition, except when it's asking for tips for improving a specific piece of code, which can be more objective.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another thing you want to make sure of is that the challenge is still ontopic for the site. If there were a challenge &quot;write code that draws a pretty image&quot;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; would clearly be the best possible victory criterion. That doesn't make the challenge a good popularity contest, though, because it's a bad challenge, and giving it an appropriate victory condition won't change that. It's important to pick a topic for which writing a popular answer will take skill (especially programming skill), and where the subject matter isn't too far from the sort of subject matter normally covered on this site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; is a poor victory condition if you're looking for something that can be measured objectively. That's why we don't normally use it for golfing challenges. (We &lt;em&gt;could&lt;/em&gt;, I guess – it'd certainly make competition between languages more fair – but it runs into the problem that even in the same language, a better solution submitted later may well end up with fewer votes than a worse solution submitted earlier, so comparing within each language objectively works better.)&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-12T21:09:56.070" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12852" PostTypeId="1" AcceptedAnswerId="12853" CreationDate="2017-06-12T21:15:10.540" Score="9" ViewCount="258" Body="&lt;p&gt;On &lt;a href=&quot;https://english.stackexchange.com/help/privileges/participate-in-meta&quot;&gt;any other site&lt;/a&gt;, the Help Center says this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Because we allow anonymous participation, we require a small bit of parent site reputation to prevent spam, and ensure that meta is for active, engaged members of the community.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;On PPCG, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7084/66025&quot;&gt;anyone can post on meta&lt;/a&gt;, so this part was removed from the &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/participate-in-meta&quot;&gt;Help Center&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Did meta get any spam after this change was made? If so, how much?&lt;/p&gt;&#xA;" OwnerUserId="66025" LastEditorUserId="66833" LastEditDate="2021-07-09T14:10:34.980" LastActivityDate="2021-07-09T14:10:34.980" Title="Did decreasing the amount of rep required for meta cause spam?" Tags="|discussion|meta|statistics|spam|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12853" PostTypeId="2" ParentId="12852" CreationDate="2017-06-12T21:26:26.720" Score="10" Body="&lt;p&gt;Not being a diamond moderator (but having all other privileges), I only have access to the statistics from the past 30 days.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In that time span, though, I can certify that there certainly isn't an excessive amount of spam. I didn't check Sandbox posts (on the basis that they're commonly deleted and we probably want new users to be able to post in the Sandbox); in terms of other Meta posts, there's exactly one post that was deleted in the prior 30 days, from a user who had 101 or less reputation at the time it was posted, that could even plausibly be described as &quot;spam&quot;: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12140/62131&quot;&gt;this one&lt;/a&gt;. (For users who can't see deleted posts: it's a direct duplicate of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11373/62131&quot;&gt;this question&lt;/a&gt;, which was closed as such and downvoted to -1; Community deleted it on the basis that it was negatively voted, inactive for 30 days, and had no answers.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's worth noting that this is a very small number of unwanted posts, and easily handled. Even then, it only qualifies as &quot;spam&quot; in the sense that it's a post that adds nothing to the conversation on Meta and shouldn't have existed. It's not &quot;spam&quot; in the &quot;red flag&quot; sense of &quot;Exists only to promote a product or service and does not disclose the author's affiliation&quot;. (We do get spam in the red flag sense on PPCG very occasionally, but it's nearly always posted to main rather than Meta, and it's typically handled very quickly.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As such, I'd say that reducing the Meta participation limit hasn't caused any noticeable issues, and the benefit (allowing new users to post in the Sandbox) is fairly notable.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-12T21:26:26.720" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12854" PostTypeId="2" ParentId="5789" CreationDate="2017-06-12T21:46:52.367" Score="6" Body="&lt;p&gt;With HTTPS certificates, you can't have a wildcard except at the start, and a wildcard can't match multiple components. So &lt;code&gt;*.stackexchange.com&lt;/code&gt; can't match &lt;code&gt;meta.codegolf.stackexchange.com&lt;/code&gt;; you'd need a &lt;code&gt;*.codegolf.stackexchange.com&lt;/code&gt; certificate. Given how many Stack Exchange sites there are, that'd be a &lt;em&gt;lot&lt;/em&gt; of certificates, which would cause problems in terms of trying to manage certificates (and require new certificates to be bought every time a new site went into beta). Thus, &lt;a href=&quot;https://meta.codegolf.stackexchange.com&quot;&gt;https://meta.codegolf.stackexchange.com&lt;/a&gt; doesn't work (and if you click that link, you'll see a bad certificate error).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The issue has now been fixed, though (by Stack Exchange globally); you'll notice that the URL for this Meta site is now &lt;a href=&quot;https://codegolf.meta.stackexchange.com&quot;&gt;https://codegolf.meta.stackexchange.com&lt;/a&gt; (i.e. the first two URL components were swapped). Community (Stack Exchange's diamond moderator bot) put in a lot of work swapping URL components in links all over the network, so that they'd be updated to point at the new home of the site. Because only a single certificate (for &lt;code&gt;*.meta.stackexchange.com&lt;/code&gt;) is needed to cover all sitewide metas, there's no certificate issue any more. So the original problem has been solved; PPCG meta is indeed now available in HTTPS.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-12T21:46:52.367" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12855" PostTypeId="1" CreationDate="2017-06-12T22:32:43.527" Score="15" ViewCount="368" Body="&lt;p&gt;Sometimes a question is posted that widely disliked (often due to being too easy, or being excessively arbitrary, or playing around in a space that's been mostly comprehensively covered without actually being a duplicate). These tend to get downvoted heavily quickly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, they also tend to get closed, often with reasons that don't really fit. (Even more commonly, the challenge initially is closeable, but then reviewers refuse to reopen it after the reasons for which it was closed are fixed.) Should we be closing this sort of challenge? If so, what reason should we use? (At the moment it's typically either &quot;unclear&quot;, or &quot;duplicate&quot; with a duplicate that doesn't fit.) Should we then be deleting the challenge after it's closed? Alternatively, should we leave the question open, but highly downvoted?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I don't have any particular question in mind here; I've been meaning to post it for a while, and am asking about the general case. &lt;a href=&quot;https://codegolf.stackexchange.com/q/126037/62131&quot;&gt;This one&lt;/a&gt;, however, is what reminded me to post this, and will serve as an example for the sort of question I'm talking about. I'm not at all sure my close vote there was correct; originally I misread the question, made the close vote, realised my mistake, equivocated on retracting it, made a comment explaining the issues I found with the question, then found that the close was completed by other people. I'm fairly confident now that a reopen vote on the question would fail, and I'm not at all certain I did the right thing in the first place, but I'm also not sure I can do anything to correct it.)&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-14T07:02:18.890" Title="What to do about widely disliked questions that don't technically break any rules?" Tags="|discussion|policy|challenges|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12856" PostTypeId="2" ParentId="12837" CreationDate="2017-06-12T22:54:33.747" Score="-1" Body="&lt;h1&gt;Make &lt;code&gt;-A&lt;/code&gt; worth 1 byte&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It seems to me that, like a lot of questions about the rules here, this is trying to save bytes for a specific language, in this case Brain-Flak.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also believe that every language has a challenge specifically designed for it, whether the language knows it or not, and so every language should be able to compete fairly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition to this, 3 bytes is a large penalty for such a basic task that it seems unfair, at least to me.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, I propose we make the &lt;code&gt;-A&lt;/code&gt; flag for Brain-Flak worth only 1 byte. Other languages such as Perl only have 1 byte per flag and so why not allow Brain-Flak the same privilege?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2017-06-12T22:54:33.747" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12857" PostTypeId="2" ParentId="12846" CreationDate="2017-06-12T23:53:12.090" Score="-2" Body="&lt;h1&gt;If every implementation of the language requires the proxy, yes; otherwise, no&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Suppose there were a programming language which had issues representing strings (say, &lt;code&gt;x&lt;/code&gt; simply wasn't in the language's character set). It nonetheless be able to solve the challenge via means of a proxy (although see &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10166/62131&quot;&gt;this loophole&lt;/a&gt;, which might additionally make the proxy unusable due to storing information in the proxy itself); it's somewhat subjective about whether it applies. However, I wouldn't recommend saying &quot;OK, the language doesn't have an &lt;code&gt;x&lt;/code&gt; in its character set, let's load &lt;code&gt;akcd.com&lt;/code&gt; rather than &lt;code&gt;xkcd.com&lt;/code&gt;&quot;. In this case, it's a limitation of the language which means we can't load URLs directly, and working around the limitation should cost bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The situation with proxies seems similar. JavaScript, as implemented in browsers, can't make a cross-origin request without extra setup code, so if you're using a browser implementation of JavaScript, you'd have to pay for that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, languages can have more than one implementation, and you can use whichever you like. So I'd recommend choosing one where the builtins you need don't require extra setup code to get around security restrictions. In the case of JavaScript, for example, that might involve using a non-browser implementation (there are a few to choose from), although make sure it's compatible with the rest of your answer!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(If your answer is interpreter-specific but an interpreter-agnostic version is easy to create, you might want to post the latter version as well to make the program easier to test. This is similar to, e.g., breaking up infinite loops for TIO testing purposes.)&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-12T23:53:12.090" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12858" PostTypeId="2" ParentId="12841" CreationDate="2017-06-12T23:59:43.013" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/anagrams&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;anagrams&amp;#39;&quot; rel=&quot;tag&quot;&gt;anagrams&lt;/a&gt; should be made a synonym of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt;, and we should additionally add &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; on a case-by-case basis&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Presently, many &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/anagram&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;anagram&amp;#39;&quot; rel=&quot;tag&quot;&gt;anagram&lt;/a&gt; challenges are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; already. Of those that aren't, they don't necessarily feel particularly string-focused (e.g. &quot;write a program that outputs an anagram of itself&quot; is not really &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; because &quot;write a quine&quot; is also not really &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;). Additionally, some &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/anagram&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;anagram&amp;#39;&quot; rel=&quot;tag&quot;&gt;anagram&lt;/a&gt; challenges have five tags more relevant than &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; already.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;EDIT: I've done the additions of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;; almost all the challenges that needed it had it already, and I tagged the few remaining challenges over the last several days (to avoid spamming the active list).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've now proposed the tag synonym. If you have 1250 reputation and a score of 5 or more on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt;, you can vote for it &lt;a href=&quot;https://codegolf.stackexchange.com/tags/permutations/synonyms&quot;&gt;here&lt;/a&gt;. Note that even if the other answer gets consensus rather than this one, we'll still have a record of which question was originally in which tag, so we'll still be able to implement it, and I haven't seen anyone argue for keeping the two tags entirely separate, thus the general concept of synonymising them seems to have consensus.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastEditorDisplayName="user62131" LastEditDate="2017-06-16T08:04:39.083" LastActivityDate="2017-06-16T08:04:39.083" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12860" PostTypeId="2" ParentId="2140" CreationDate="2017-06-13T11:45:40.840" Score="0" Body="&lt;h1&gt;Print all video urls of YouTube channel &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/q/122740/48734&quot;&gt;Count the videos in a Youtube Playlist&lt;/a&gt;, the input will be the &amp;quot;VIDEOS&amp;quot; view from a channel like this one:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;https://www.youtube.com/channel/UCzwJRQXMXkaB9KlqUdFD74Q/videos&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The output will be a complete, newline-delimited list of all video urls the respective channel has to offer. It would look something like&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;https://www.youtube.com/watch?v=JxNfccUIQCU&#xA;https://www.youtube.com/watch?v=lOr0XIHFhlk&#xA;https://www.youtube.com/watch?v=o3tZElWLrbc&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is codegolf, so shortest answer wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Comments:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I am unsure whether the permitted use of Google's YouTube API might be a good idea. It requires an API_KEY and can only retrieve 50 results per request.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Thanks for the feedback.&lt;/p&gt;&#xA;" OwnerUserId="48734" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-13T11:45:40.840" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12862" PostTypeId="2" ParentId="2140" CreationDate="2017-06-13T12:50:30.997" Score="0" Body="&lt;h1&gt;Patch Tuesdays Calendar&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Context&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Patch Tuesday happens every second Tuesday of the month, Microsoft and other companies release their monthly security patch on that Tuesday.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is to write a program that writes 24 consecutive Patch Tuesdays dates separated by newline to the console. The Tuesdays must be the ones of the current year and the next year (not a parameter). Date format must be  mm/dd/yyyy. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Winning&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code with the fewest bytes wins, there are no bonuses.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Meta&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there a good write up with conventions for golf questions?&lt;/p&gt;&#xA;" OwnerUserId="6865" LastActivityDate="2017-06-13T12:50:30.997" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12867" PostTypeId="2" ParentId="2140" CreationDate="2017-06-13T21:27:11.163" Score="0" Body="&lt;h2&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;My challenge, is for you to generate a &lt;a href=&quot;https://en.wikipedia.org/wiki/Menger_sponge&quot; rel=&quot;nofollow noreferrer&quot;&gt;Menger Sponge&lt;/a&gt; based on the &lt;code&gt;level&lt;/code&gt;/&lt;code&gt;iteration&lt;/code&gt; given. You need to draw it in &lt;code&gt;3d&lt;/code&gt;, see the &lt;code&gt;Specifications&lt;/code&gt; below!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;3D Specifications&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can use existing 3D libraries&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Inputs:&lt;/em&gt; &lt;code&gt;0, 1, 2, 3&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Outputs:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/X1j26.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/X1j26.jpg&quot; alt=&quot;Diagram&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;&lt;strong&gt;Background Information&lt;/strong&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;What is a Menger Sponge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;In mathematics, the Menger sponge (also known as the Menger universal curve) is a fractal curve. It is a three-dimensional generalization of the Cantor set and Sierpinski carpet&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Properties&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;See &lt;a href=&quot;https://en.wikipedia.org/wiki/Menger_sponge#Properties&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://en.wikipedia.org/wiki/Menger_sponge#Properties&lt;/a&gt; (too long to copy and paste)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;How do I construct the sponge?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/X1j26.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/X1j26.jpg&quot; alt=&quot;Diagram&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;Begin with a cube  (first image).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;Divide every face of the cube into 9 squares, like a Rubik's Cube. This will sub-divide the cube into 27 smaller cubes.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;Remove the smaller cube in the middle of each face, and remove the smaller cube in the very center of the larger cube, leaving 20 smaller cubes (second image). This is a level-1 Menger sponge (resembling a Void Cube).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;Repeat steps 2 and 3 for each of the remaining smaller cubes, and continue to iterate ad infinitum.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The second iteration gives a level-2 sponge (third image), the third iteration gives a level-3 sponge (fourth image), and so on. The Menger sponge itself is the limit of this process after an infinite number of iterations.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Credit&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Background info taken from &lt;a href=&quot;https://en.wikipedia.org/wiki/Menger_sponge&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; wikipedia page on Menger Sponges.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;&lt;strong&gt;Good Luck!&lt;/strong&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Remember this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; the shortest program wins!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;&lt;strong&gt;HELP&lt;/strong&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I need help with specifications for the &lt;code&gt;3d&lt;/code&gt; output: &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Since 3D is now required (invalidating existing answers), I think the question is now unclear. There is a lot you need to specify for 3D including but not limited to viewing angle, projection, lighting, shading.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="61877" LastEditorUserId="61877" LastEditDate="2017-06-13T21:38:44.110" LastActivityDate="2017-06-13T21:38:44.110" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="12868" PostTypeId="1" CreationDate="2017-06-13T21:30:23.767" Score="29" ViewCount="562" Body="&lt;p&gt;I've never done code golf before, but it looks fun. I have some questions though. Should I learn some golfing languages, or just try some challenges out with the languages I know? (I know C# and Python) Are there any types of challenges I should try first, or should avoid until I'm better? Are there any things that are generally known to be disallowed? Is there anything I should keep in mind while golfing? Are there any general tips for golfing? Answers to any or all of these questions would be greatly appreciated, along with anything else I should know.&lt;/p&gt;&#xA;" OwnerUserId="70795" LastActivityDate="2017-06-27T21:48:22.340" Title="I'm new to code golf, what are some things I should know?" Tags="|discussion|new-users|" AnswerCount="5" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12869" PostTypeId="1" CreationDate="2017-06-13T21:35:00.657" Score="6" ViewCount="225" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12877/8478&quot;&gt;Let&amp;#39;s allow newer languages/versions for older challenges&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h1&gt;The above link is to the correct topic to discuss this idea.&lt;/h1&gt;&#xA;&lt;h1&gt;The below content is my opinion about closed stuff.&lt;/h1&gt;&#xA;&lt;h1&gt;Please do not answer this question.&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I've noticed recently a few challenges were closed as duplicates, but when I visited the page of the duplicate I realized that my answer would be non-competing. Therefore, instead of working tirelessly on an answer that never will be seen, I often opt to just not participate. I've often also seen old challenges that I'd love to compete on but have no reason to. In fact half the time I'm afraid I'd get bashed for grave-digging (even though it's a badge here, my old forum habits die hard...)&lt;/p&gt;&#xA;&lt;p&gt;I was wondering at what point a challenge would have enough new languages competing to render a different outcome? Looking at old questions you'll see like 5-6 non-competing answers with 0 votes. How can we make these questions come around again, but maintain a limit on how many times we see the same challenge?&lt;/p&gt;&#xA;&lt;p&gt;Maybe we should have a Resurrection Sandbox?&lt;/p&gt;&#xA;&lt;p&gt;My idea is as follows (if you have an argument against it, or another suggested solution, please post an answer to the question):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Allow sandbox posts for the Resurrection of old questions.&lt;/li&gt;&#xA;&lt;li&gt;Use the current sandbox to contain these posts, but with a specific format.&lt;/li&gt;&#xA;&lt;li&gt;Close all questions as duplicates if they aren't under this specific format.&lt;/li&gt;&#xA;&lt;li&gt;Disallow posting of Resurrection questions that get less than X votes in the sandbox.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The format I'm describing could be as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#[Resurrection] ${originalPoster.linkToProfile}&#xA;***Originally posted [here](link to post), over X years ago.***&#xA;*Reason for Resurrection: ${reason.whyYouThinkItsAGoodIdea}*&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Rendered template example (probably going to be declined):&lt;/p&gt;&#xA;&lt;h1&gt;[Resurrection] Alphabet Diamond&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Originally posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/97436/alphabet-diamond&quot;&gt;here&lt;/a&gt;, over 0 years ago.&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Reason for Resurrection: Alphabet Challenges are so Original!&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Rendered template example (probably going to be accepted):&lt;/p&gt;&#xA;&lt;h1&gt;[Resurrection] Menger Sponge Generator&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Originally posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/40104/sierpinski-carpets&quot;&gt;here&lt;/a&gt;, over 3 years ago.&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Reason for Resurrection: [A,B,C,D,E,F,...,Z] weren't languages at the time and the question has 20 non-competing answers (not true, but pretend please)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I think duplicates could be fun on a bunch of different questions, but allowing duplicates in general would mess everything up. Anyone have some additional input on this?&lt;/p&gt;&#xA;&lt;p&gt;P.S. the most recent post that I wanted to compete on was:&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/126210/menger-sponge-generator&quot;&gt;Menger Sponge Generator&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-16T20:34:24.973" Title="Resurrection Sandbox" Tags="|discussion|" AnswerCount="0" CommentCount="9" ClosedDate="2017-06-17T13:39:56.113" ContentLicense="CC BY-SA 3.0" />
  <row Id="12870" PostTypeId="2" ParentId="12868" CreationDate="2017-06-13T21:52:50.507" Score="21" Body="&lt;p&gt;I don't really know what's best specifically for you but I'll share my short experience over the past year here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I started out golfing in Java, probably the worst possible language to golf in. However, despite never having won a single challenge in Java, people almost always commented on my answers, offering support and suggestions. So, the key thing to take away from this part of my experience is: &quot;The more common the language, the more people can appreciate the cool tricks you've learned in your experience.&quot; Say you've been golfing in python and C# for 5 years, you may actually teach some users here a few neat tricks they're not seen before. I find that rewarding on its own.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After golfing and losing for a few months in Java, I started using Groovy and a few other langauges I wanted to learn more but never did. In the course of about a month my Groovy skills had sharpened to the point of knowing Groovy on Grails and I started web development! Pretty fun to golf in a new language then apply that knowledge to a career advancement or personal skill advancement. Maybe start golfing in C# to hone your ASP.NET skills and learn to become an Enterprise website developer! Kinda what I did.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lastly, and most recently, I've been messing with a langauge named &lt;a href=&quot;https://github.com/Adriandmen/05AB1E&quot; rel=&quot;nofollow noreferrer&quot;&gt;05AB1E&lt;/a&gt;. I feel like this is a great way to ease into understanding esolangs. When I first looked at &lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt; I was a little overwhelmed by all the monads and dyads. I still am overwhelmed by them. But I'm slowly learning by paying attention to the masters. However, 05AB1E uses a fairly straightforward command system and a stack-based memory system. You can write a program simply by looking at this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/Adriandmen/05AB1E/blob/master/docs/info.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://github.com/Adriandmen/05AB1E/blob/master/docs/info.txt&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You basically pick the tiny building blocks you want and go from there. Sure, understanding what it's actually doing will take you some time. However, I've never picked up a language easier than I have 05AB1E. If you have any questions feel free to hit me up or join the 05AB1E Oasis chatroom. Adnan is the original creator of the langauge and Emigna has some of the best (and FGITW) answers I've ever seen.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main takeaway from all that crap would be: Read other people's work, enjoy the effort they've taken and always learn something new; you don't need to be the best to compete.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;P.S. Use this link if you have a specific language in mind to get language specific tips and tricks:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/search?q=tips+for+golfing&quot;&gt;https://codegolf.stackexchange.com/search?q=tips+for+golfing&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="59376" LastActivityDate="2017-06-13T21:52:50.507" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12872" PostTypeId="2" ParentId="12868" CreationDate="2017-06-14T02:33:07.237" Score="21" Body="&lt;p&gt;A few thoughts, from a fairly-newbie:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use whatever language you like. Personally, I see every language as competing in its own space. I compete against other JavaScript entries, and to a very small extent against Ruby and Python. Competing against Brainfuck is silly. Competing against CJam or Jelly or whatever is sillier.&lt;/li&gt;&#xA;&lt;li&gt;Collaborate with others: help them improve their solutions, and incorporate their suggestions about your own.&lt;/li&gt;&#xA;&lt;li&gt;Don't submit ungolfed solutions - make a reasonable effort before you post.&lt;/li&gt;&#xA;&lt;li&gt;Don't copy other people's solutions without attributing them.&lt;/li&gt;&#xA;&lt;li&gt;If you have an idea for a new challenge, post it to the sandbox for feedback first.&lt;/li&gt;&#xA;&lt;li&gt;Read other people's solutions to learn from them. Personally, I prefer to attempt the challenge first before I do this.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="30512" LastActivityDate="2017-06-14T02:33:07.237" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12874" PostTypeId="2" ParentId="2140" CreationDate="2017-06-14T03:51:38.177" Score="3" Body="&lt;h1&gt;ASKEY robbers&lt;/h1&gt;&#xA;&lt;p&gt;You are a robber in the ASCII world. ASCII lock-key work in similar fashion as the real-world: matching ridges. Your objective is to write a program which generates a duplicate key for the ASCII locks.&lt;/p&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;p&gt;A Lock is given as:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;   |\    |\         &#xA; __| \___| \____             &#xA;|               | &#xA;|_______________| &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Its key shall be something like:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; _______________&#xA;|   __     __   |&#xA;|  |  \   |  \  |  &#xA;|__|   \__|   \_|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The fit being something like:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; _______________&#xA;|   __     __   |&#xA;|  ||\\   ||\\  |&#xA;|__|| \\__|| \\_|&#xA;|               |&#xA;|_______________| &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;SandBox&lt;/h1&gt;&#xA;&lt;p&gt;I think the fit is weird. It didn't go as I had imagined when I finished typing in the ASCII drawing.&lt;/p&gt;&#xA;" OwnerUserId="59523" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-14T03:51:38.177" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12876" PostTypeId="2" ParentId="12855" CreationDate="2017-06-14T07:02:18.890" Score="12" Body="&lt;h2&gt;Challenges should not be closed solely for being trivial&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are only a handful of reasons to close a challenge:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is off-topic for one of the following reasons:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is not actually a challenge or a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question (e.g. the generic homework questions we get regularly, or a question meant for another site)&lt;/li&gt;&#xA;&lt;li&gt;It lacks an objective primary winning criterion&lt;/li&gt;&#xA;&lt;li&gt;It is otherwise off-topic as decided by meta consensus (e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;It is unclear (meaning there are either zero or multiple valid interpretations of the challenge as written)&lt;/li&gt;&#xA;&lt;li&gt;It is too broad (e.g. &quot;do something&quot; challenges, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; challenges without objective validity criteria)&lt;/li&gt;&#xA;&lt;li&gt;It is a duplicate of an existing challenge&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If a challenge doesn't have any of the above problems, then it should not be closed (and thus should be reopened if it is closed).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A challenge being trivial isn't in that list of close reasons on purpose - not only is triviality subjective, but there isn't anything inherently wrong with well-written trivial challenges. While individual users may like or dislike trivial challenges (and that's what those voting buttons are for), those personal judgments should not come into play when choosing whether or not to cast a close or reopen vote.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-06-14T07:02:18.890" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12877" PostTypeId="1" CreationDate="2017-06-14T08:46:33.283" Score="99" ViewCount="3221" Body="&lt;p&gt;I've been thinking &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8558/when-can-challenges-be-reused/8560#comment24118_8560&quot;&gt;for a long time&lt;/a&gt; that our non-competing policy for newer languages (or language versions) &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11687/old-languages-with-new-implementations#comment38861_11687&quot;&gt;is harmful&lt;/a&gt;. Just for context, we currently require all answers which require implementations that are newer than a challenge to be marked as non-competing. At the core there was a good intention behind this rule and that is to prevent people from adding a built-in to their language which solves the challenge in one byte, but I think that in 99% of cases the rule ends up hitting the wrong answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some arguments for allowing all languages and versions on all challenges:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Just empirically it seems that the &lt;em&gt;vast&lt;/em&gt; majority of all non-competing answers on the site are either a) people wanting to give old challenges a spin with new languages, b) people encountering a bug in their language when solving a challenge and having to fix that bug before being able to solve the challenge, or c) people wanting to use well-specified, old languages which need to be (re-)implemented before they can be used. Neither of those lead to problematic answers but are disappointing or frustrating for the answerer.&lt;/li&gt;&#xA;&lt;li&gt;We regularly get people suggesting that sufficiently old challenges should be allowed to be reposted (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12869/8478&quot;&gt;the most recent example&lt;/a&gt;), with one of the main arguments that new languages have since been created which can't compete on the old challenge. But reposting challenges leads to all sorts of other problems, in particular what to do with old valid answers. It would be much easier if we didn't discourage people from answering old challenges.&lt;/li&gt;&#xA;&lt;li&gt;I believe the community has come a long way from competing for the overall shortest answer on a challenge. Most people who aren't using Jelly or 05AB1E or the like are usually competing within their own language (or maybe with languages of comparable verbosity). Adding a built-in to the language &lt;em&gt;just&lt;/em&gt; for that challenge simply makes the language uninteresting for the problem at hand. Improving the language in a way that shortens the current problem but is also useful in general doesn't seem problematic to me (and the change will also be available to other users who might still be able to outgolf the answer). Either way, the non-competing label seems meaningless if we're not comparing the answer to solutions in other languages anyway.&lt;/li&gt;&#xA;&lt;li&gt;Many of our most-answered challenges (those which started out as &quot;catalogues&quot;, i.e. the challenges for certain standard programming problems) already override the non-competing policy explicitly without any detrimental effect (and thereby becoming more useful repositories of golfed solutions for these problems in all languages, regardless of the language's age).&lt;/li&gt;&#xA;&lt;li&gt;Adding a built-in to solve a challenge isn't very interesting and will likely be discouraged by downvotes more than anything else, especially if someone does it repeatedly.&lt;/li&gt;&#xA;&lt;li&gt;The non-competing rule doesn't even reliably solve the problem it's trying to solve. While the Hello, World! challenge already allows newer languages, &lt;a href=&quot;https://codegolf.stackexchange.com/a/55425/8478&quot;&gt;this answer wouldn't have been non-competing anyway&lt;/a&gt; (I realise this is a counterexample to my previous point, but HNQ can sometimes do that). And there are other ways to get a &lt;a href=&quot;https://codegolf.stackexchange.com/a/74860/8478&quot;&gt;1 byte&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/a/70639/8478&quot;&gt;0 byte&lt;/a&gt; program working before a challenge is posted.&lt;/li&gt;&#xA;&lt;li&gt;While we're not doing this consistently yet, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11218/8478&quot;&gt;we have a well supported proposal&lt;/a&gt; to combine trivial answers into a single CW answer. That would further reduce the incentive to add built-ins to languages unless they're generally useful.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Yes, we'll probably get the occasional answer that adds a built-in after the fact and gets a lot of undeserved votes for it, but I really don't think that this rare case outweighs all the disadvantages this policy brings with it.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2021-12-30T22:59:24.393" Title="Let's allow newer languages/versions for older challenges" Tags="|discussion|policy|answers|noncompeting|" AnswerCount="5" CommentCount="27" ContentLicense="CC BY-SA 3.0" />
  <row Id="12879" PostTypeId="2" ParentId="2140" CreationDate="2017-06-14T12:36:06.637" Score="0" Body="&lt;h1&gt;Help me play Battleship! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Battleship_(game)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Battleship&lt;/a&gt; is a two-player guessing game in which each player guesses the placement of the opponent's ships, placed on a grid.&lt;/p&gt;&#xA;&lt;p&gt;Each column is labeled with a letter, and each row with a number. The label starts from top left (&lt;code&gt;A&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt;), and descends as you move right/down.&lt;/p&gt;&#xA;&lt;p&gt;Each player is given two grids, one for placing ships, and one for guessing the enemy's ship placement. Each player places 5 ships -- one ship of length 5, one ship of length 4, two ships of length 3, and one ship of length 2 -- on her grid, either horizontally or vertically. The players should not share their ship placements.&lt;/p&gt;&#xA;&lt;p&gt;After placing all ships, each player takes turn guessing the opponent's ship placements. The guessing player guesses one position, and the defending player must announce &amp;quot;hit&amp;quot; or &amp;quot;miss,&amp;quot; depending on whether she (the defending player) had a ship there. When all positions of a ship is hit, it is &amp;quot;sunk.&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;The player who sinks all of the opponent's ships win.&lt;/p&gt;&#xA;&lt;p&gt;This is an example of a battleship board (taken from Wikipedia):&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/F26Q8.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/F26Q8.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Given the list of guesses a player has made, construct a 10x10 array that represents the board.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input can take any reasonable format, as long as it is explained. Some examples are &lt;code&gt;[[position, result], [position, result], ...]&lt;/code&gt; and &lt;code&gt;[[hit positions], [miss positions]]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The output array can have any characters, as long as empty, &amp;quot;hit,&amp;quot; and &amp;quot;miss&amp;quot; squares are distinguishable from one another. (e.g. &lt;code&gt;unknown = 0, hit = 1, miss = 2&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;You may &lt;strong&gt;not&lt;/strong&gt; take the list of unknown grid positions in the input.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://pastebin.com/KhRBqSRj&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pastebin link&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this challenge interesting?&lt;/li&gt;&#xA;&lt;li&gt;Are there any dupes? (I couldn't find one)&lt;/li&gt;&#xA;&lt;li&gt;Did I include too much detail in the introduction? (If so, what should I remove?)&lt;/li&gt;&#xA;&lt;li&gt;Are my test cases sufficient?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="60043" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-15T04:49:37.123" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12882" PostTypeId="2" ParentId="12877" CreationDate="2017-06-14T14:26:16.650" Score="14" Body="&lt;h1&gt;Allow languages / language features to be used on challenges that predate them, if that language or feature is useful on several other challenges too&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It strikes me that the main purpose of our &quot;language postdates challenge&quot; rule is to prevent situations where people write a language, or modify a language, specifically for the purpose of gaining an unfair advantage on a single question. However, if the language or language feature is shown to be widely useful, that's another way of demonstrating that it wasn't (just) for cheating on a challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We've seen this with Brachylog, for example; it's quite common to see a challenge, and realise that Brachylog is missing a feature that really should have been in the language (with the challenge demonstrating why). Because Brachylog's under active development at the moment, the feature tends to be added (but not used on the challenge that inspired it). Nearly always, there'll soon be another challenge posted which can make use of it. (This is part of the reason that Brachylog's score relative to other golfing languages has been improving over time.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this case, it feels a little unfair to bar the best solution, in the new Brachylog interpreter, to the original challenge; sure, the challenge inspired adding a new language feature, but the feature was for the benefit of the language as a whole rather than an attempt to cheat on that challenge specifically.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that I'm not taking an opinion here on an exact number for how many challenges the feature has to be useful on to count as not being an attempt to cheat. In most of the cases I've seen so far, the difference between cheating and non-cheating is such a large one that you could place the number almost anywhere reasonable and still have a working rule. We'll need to see some more borderline cases before we can decide where exactly the border should go.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-14T14:26:16.650" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12883" PostTypeId="2" ParentId="2140" CreationDate="2017-06-14T16:38:36.877" Score="1" Body="&lt;h1&gt;Least Picky Language &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For this challenge, you will create a programming language that is not picky at all. That is, for any program of any length consisting of any characters in the ASCII range &lt;code&gt;[32..126]&lt;/code&gt; and any input consisting of any characters in the same range, your program must do something without any errors. The program only has to hypothetically work for any length; that is, StackOverflowException and the like are acceptable if the input or program is too long for your new language to handle (however, I require it to work for program size up to 1024 bytes and input up to 1024 bytes).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In your programming language, no character or combination of characters can be useless (to prevent everything from being a no-op). That means that every character in the program must affect the function somehow, even if the overall function does not change. No two characters can have the same specification either.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, it is not allowed to have &lt;code&gt;-&lt;/code&gt; and &lt;code&gt;N&lt;/code&gt; both compute the negative of a number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that &lt;code&gt;&amp;lt;space&amp;gt;&lt;/code&gt; is a valid character in the program and must do something even if it is leading or trailing. Also note that you do not have to handle tabs or newlines in the program or the input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The most upvoted answer at the end of 2017 Calendar Year (UTC December 31 23:59:59) will be accepted, and I will award a +50 bounty to my personal favorite language.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Clear enough validity criteria?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user42649" LastActivityDate="2017-06-14T16:38:36.877" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12884" PostTypeId="2" ParentId="1723" CreationDate="2017-06-14T17:45:51.410" Score="1" Body="&lt;h2&gt;Questions about particular language features&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;These are questions like &lt;a href=&quot;https://codegolf.stackexchange.com/q/122647/61384&quot;&gt;Dump Stack to Array&lt;/a&gt;, which is a question about a particular feature of CJam.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These might fit under &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1724/61384&quot;&gt;Questions about improving code golf / code challenge skills&lt;/a&gt;, but on the other hand these might be more on-topic for Stack Overflow. However, as Dennis said:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;[these types of questions would] get downvoted or, worse, left unanswered. If it's unlikely to get answered on SO, there really is no reason to post it there.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;For:&lt;/strong&gt; They won't be well-received on Stack Overflow, so this is probably the most relevant place to put them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Against:&lt;/strong&gt; Many of these are relatively simple questions that are covered in the docs; therefore, it's not useful to have them here.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastActivityDate="2017-06-14T17:45:51.410" CommentCount="0" CommunityOwnedDate="2017-06-14T17:45:51.410" ContentLicense="CC BY-SA 3.0" />
  <row Id="12885" PostTypeId="1" AcceptedAnswerId="12953" CreationDate="2017-06-14T18:53:58.550" Score="4" ViewCount="284" Body="&lt;p&gt;If I were to implement an esolang that uses a cached version of OEIS (one that doesn't fetch from the internet) would it be valid? For instance, if I were to scrape OEIS and grab the mathematical formula, then tie that formula to the integer assigned to the sequence and use that as my esolang, is that valid?&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;The code would look something like:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://oeis.org/A014258&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://oeis.org/A014258&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Code:   &lt;code&gt;55&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Input:  &lt;code&gt;3&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Output: &lt;code&gt;2&lt;/code&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Of course it would also have built-ins for array manipulation, simple arithmetic, and you would be able to &amp;quot;chain&amp;quot; sequences as well. I'd consider also including multiple modes for &lt;code&gt;ath term&lt;/code&gt;, &lt;code&gt;first term below a&lt;/code&gt;, &lt;code&gt;first term higher than a&lt;/code&gt;, etc... Would this be non-competing, or would this be a genuinely good language for golfing?&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Secondary question I guess, would it be possible to scrap all Mathematica formulas for OEIS entries that exist (&lt;a href=&quot;http://oeis.org/search?fmt=text&amp;amp;q=1,2,3,6,11,23,47,106,235&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://oeis.org/search?fmt=text&amp;amp;q=1,2,3,6,11,23,47,106,235&lt;/a&gt;):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;%F A000055 G.f.: A(x) = 1 + T(x) - T^2(x)/2 + T(x^2)/2, where T(x) = x + x^2 + 2*x^3 + ... is the g.f. for A000081.&#xA;%F A000055 a(n) = A000081(n) - A217420(n+1), n&amp;gt;0. - _R. J. Mathar_, Sep 19 2016&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Then use the mathematica formula to calculate it?&lt;/p&gt;&#xA;&lt;p&gt;I guess the main question is does anyone have experience with how accurate these formulas are in general?&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;CURRENT PROGRESS:&lt;/h1&gt;&#xA;&lt;p&gt;I've managed to write a snippet that extracts code from OEIS, visiting the page in text format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;http://oeis.org/search?q=id:A000001&amp;amp;fmt=text&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;By doing this I've managed to turn each OEIS into a cached format of:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;A000001.oeis.txt:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(n-terms):0,1,1,1,2,1,2,1,5,2,2,1,5,1,2,1,14,1,5,1,5,2,2,1,15,2,2,5,4,1,4,1,51,1,2,1,14,1,2,2,14,1,6,1,4,2,2,1,52,2,5,1,5,1,15,2,13,2,2,1,13,1,2,4,267,1,4,1,5,1,4,1,50,1,2,3,4,1,6,1,52,15,2,1,15,1,2,1,12,1,10,1,4,2&#xA;(Haskell):YTAwMDAyNiBuID0gZiBhMDAwMDQwX2xpc3QgbiAxICgwXihuLTEpKSAxIHdoZXJlCmYgXyAgMSBxIGUgeSAgPSB5ICogZSAqIHEKZiBwcydAKHA6cHMpIHggcSBlIHkKfCBtID09IDAgICAgPSBmIHBzJyB4JyBwIChlKzEpIHkKfCBlID4gMCAgICAgPSBmIHBzIHggcSAwICh5ICogZSAqIHEpCnwgeCA8IHAgKiBwID0gZiBwcycgMSB4IDEgeQp8IG90aGVyd2lzZSA9IGYgcHMgeCAxIDAgeQp3aGVyZSAoeCcsIG0pID0gZGl2TW9kIHggcAphMDAwMDI2X2xpc3QgPSBtYXAgYTAwMDAyNiBbMS4uXQotLSBfUmVpbmhhcmQgWnVta2VsbGVyXywgQXVnIDI3IDIwMTE=&#xA;(PARI):YShuKT1sb2NhbChmKTsgaWYobjwxLDAsZj1mYWN0b3Iobik7IHByb2Qoaz0xLG1hdHNpemUoZilbMV0sZltrLDFdKmZbaywyXSkp&#xA;(PARI):YShuKT1teShmPWZhY3RvcihuKSk7IGZhY3RvcmJhY2soZlssMV0pKmZhY3RvcmJhY2soZlssMl0pIFxcIF9DaGFybGVzIFIgR3JlYXRob3VzZSBJVl8sIEFwciAwNCAyMDE2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Where the first entry is the cached first 100 terms, and subsequent entries are actually algorithms stored in Base64. That's as far as I've gotten, but I'm looking to make a hybrid interpreter that passes the algorithm to one of the following language's interpreters:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;['Haskell','Sage','Maxima','Python','PARI','MAGMA']&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And returns the output of the executed code. Of course this has been buggy as hell and progress is slow, mostly because this is just a lark... But I'm still giving it a shot I suppose.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-11T18:52:36.160" Title="Question about the validity of a potential esolang" Tags="|discussion|" AnswerCount="1" CommentCount="27" ContentLicense="CC BY-SA 3.0" />
  <row Id="12886" PostTypeId="2" ParentId="2140" CreationDate="2017-06-14T21:15:34.053" Score="4" Body="&lt;h1&gt;What is your Operating System?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;I can't believe we haven't had this one before&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;To avoid any doubts about what constitutes a separate OS, you must return an index into your chosen subset (containing minimum two) of the following OS families. You may order your set as you like, so include your ordered set, and state if you use zero or one based indexing. You may also bunch together families you cannot distinguish between.&lt;/p&gt;&#xA;&lt;p&gt;  Windows, Minix, Linux, macOS, BSD, HP-UX, AIX, Solaris, Unix, Z/OS, OS/2, QNX&lt;/p&gt;&#xA;&lt;p&gt;Your score is your byte count divided by the square of the number of indices your code can return – given that it is run on the appropriate OSs, of course.&lt;/p&gt;&#xA;&lt;p&gt;You do not have to account for virtual machines, emulation layers etc., e.g. WSL and Wine.&lt;/p&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;Your code can detect Windows, macOS, AIX, and Linux. It returns &lt;code&gt;0&lt;/code&gt; for Windows, &lt;code&gt;1&lt;/code&gt; for macOS, &lt;code&gt;2&lt;/code&gt; for AIX, and &lt;code&gt;3&lt;/code&gt; for Linux. Your score is a sixteenths of your byte count.&lt;/p&gt;&#xA;&lt;p&gt;Your code can distinguish between Z/OS, OS/2, and UNIX/Linux/AIX. It returns &lt;code&gt;1&lt;/code&gt; for Z/OS, &lt;code&gt;2&lt;/code&gt; for OS/2, and &lt;code&gt;3&lt;/code&gt; for any UNIX-like OS. Your score is a ninth of your byte count.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-22T14:56:29.120" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="12887" PostTypeId="2" ParentId="2140" CreationDate="2017-06-14T22:54:40.113" Score="1" Body="&lt;h1&gt;Lots of Pi(e)!&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;For Meta:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Any tags other than &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pi&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pi&amp;#39;&quot; rel=&quot;tag&quot;&gt;pi&lt;/a&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Dupe?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any errors?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Clear enough?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Your Task:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Because everyone likes more pi, we're going to give them 999 decimal digits of it.  Your program should output pi truncated (not rounded off) at 999 decimal places.  For reference, here it is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3.14159265358979323846264338327950288419716939937510582097494459230781640628620899862803482534211706798214808651328230664709384460955058223172535940812848111745028410270193852110555964462294895493038196442881097566593344612847564823378678316527120190914564856692346034861045432664821339360726024914127372458700660631558817488152092096282925409171536436789259036001133053054882046652138414695194151160943305727036575959195309218611738193261179310511854807446237996274956735188575272489122793818301194912983367336244065664308602139494639522473719070217986094370277053921717629317675238467481846766940513200056812714526356082778577134275778960917363717872146844090122495343014654958537105079227968925892354201995611212902196086403441815981362977477130996051870721134999999837297804995105973173281609631859502445945534690830264252230825334468503526193118817101000313783875288658753320838142061717766914730359825349042875546873115956286388235378759375195778185778053217122680661300192787661119590921642019&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Input:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;None, your program may not take any input at all.  &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Pi truncated at 999 decimal digits.  &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, lowest byte count wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Good Luck!&lt;/p&gt;&#xA;" OwnerUserId="70027" LastActivityDate="2017-06-14T22:54:40.113" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12888" PostTypeId="2" ParentId="12707" CreationDate="2017-06-14T23:43:43.917" Score="-1" Body="&lt;p&gt;I think your best option is to have them include some standard operation that is known to take some time. Then you can compare the time to run their algorithm against the time to run the known time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;They'd have to include code not for their algorithm but if you're golfing for time and not bytes that shouldn't be a problem. There might be an issue trying to find a suitable &quot;clock&quot; but something like &quot;add up a billion randomly generated numbers&quot; comes to mind. (Obviously just the adding, not the generation which varies drastically from language to language...)&lt;/p&gt;&#xA;" OwnerUserId="1416" LastActivityDate="2017-06-14T23:43:43.917" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12889" PostTypeId="2" ParentId="2140" CreationDate="2017-06-15T02:15:52.957" Score="0" Body="&lt;h1&gt;I Got All Night&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this interesting?&lt;/li&gt;&#xA;&lt;li&gt;Has this already been submitted?&lt;/li&gt;&#xA;&lt;li&gt;Issues/loopholes in the rules?&lt;/li&gt;&#xA;&lt;li&gt;Suitable tags?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;The goal&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Make a program that takes as much time as possible to complete. That's it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It must not be infinite. &lt;code&gt;while(1){}&lt;/code&gt; will not be accepted.&lt;/li&gt;&#xA;&lt;li&gt;You must be able to show how long it will take. Either through calculating it or by measuring it.&lt;/li&gt;&#xA;&lt;li&gt;It must be doing something non-trivial. &lt;code&gt;for(var x=0; x&amp;lt;1000000000000; x++){y++;}&lt;/code&gt; will not be accepted.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your score is the time it takes to complete in milliseconds divided by the size of the program in bytes. Round to the nearest point if needed.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if your program is 95 bytes long and takes 3 hours to complete, your score is (3*60*60*1000)/95 = 113,684 (rounded)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/busy-beaver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;busy-beaver&amp;#39;&quot; rel=&quot;tag&quot;&gt;busy-beaver&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="39213" LastEditorUserId="39213" LastEditDate="2017-06-15T02:43:28.683" LastActivityDate="2017-06-15T02:43:28.683" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="12890" PostTypeId="1" CreationDate="2017-06-15T04:31:53.783" Score="0" ViewCount="32" Body="&lt;p&gt;There are some esolangs like &lt;a href=&quot;https://esolangs.org/wiki/Brainloller&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brainloller&lt;/a&gt;.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is the hello world program for that language:&lt;br&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/0jjie.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/0jjie.png&quot; alt=&quot;Hello world&quot;&gt;&lt;/a&gt;  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;How are bytes counted here?&lt;/p&gt;&#xA;" OwnerUserId="39213" LastActivityDate="2017-06-15T04:31:53.783" Title="How are bytes counted in bitmap-based esolangs?" Tags="|discussion|" AnswerCount="0" CommentCount="2" ClosedDate="2017-06-15T13:16:38.657" ContentLicense="CC BY-SA 3.0" />
  <row Id="12892" PostTypeId="1" CreationDate="2017-06-15T05:09:34.777" Score="2" ViewCount="109" Body="&lt;p&gt;I have been considering the creation of a &lt;a href=&quot;https://www.julialang.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;julia&lt;/a&gt; based golfing language.&#xA;Proposed name: &lt;em&gt;&lt;code&gt;Jules&lt;/code&gt;&lt;/em&gt;.&#xA;In implementation it would effectively resolve every program into a julia AST,&#xA;which would run inside julia.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One feature I was considering was &lt;em&gt;name-fallback&lt;/em&gt;.&#xA;Where if a variable/function name was not defined, it would do a search of the names that are defined, and choose the one that was closest.&#xA;eg &lt;code&gt;prin(&quot;foo&quot;)&lt;/code&gt; would resolve into a call the julia &lt;code&gt;print(&quot;foo&quot;)&lt;/code&gt; function.&#xA;And then additional fallbacks if that method threw an error.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This would mean that the behavior of &lt;em&gt;&lt;code&gt;Jules&lt;/code&gt;&lt;/em&gt;,&#xA;would be defined by the version of the julia standard library it is backing onto. Not particularly problematic -- just up the &lt;em&gt;&lt;code&gt;Jules&lt;/code&gt;&lt;/em&gt; version number each time the julia version number is upped.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When it gets more problematic,&#xA;is when combined with an another feature I think would be nice to have.&#xA;A huge standard library.&#xA;As the standard library, I was thinking, &lt;strong&gt;the entire&lt;/strong&gt; julia &lt;a href=&quot;http://pkg.julialang.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;package ecosystem&lt;/a&gt;.&#xA;And having the module loading function be something like&#xA;&lt;code&gt;use Foo&lt;/code&gt; which resolves into &lt;code&gt;using Foo&lt;/code&gt; to attempt to load the module &lt;code&gt;Foo&lt;/code&gt; from currently installed packages, but if that fails, then to run&lt;code&gt;Pkg.add(&quot;Foo&quot;); using Foo&lt;/code&gt;, to download and install the latest registered `Foo.jl&quot; package.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now this would mean the behavior of the language would potentially change each time a new version of any registered package is released.&#xA;Since it could add a new function name, changing how name-fallback resolves.&#xA;So a new version of &lt;em&gt;&lt;code&gt;Jules&lt;/code&gt;&lt;/em&gt; would be created every time,&#xA;a commit is made to &lt;a href=&quot;https://github.com/JuliaLang/METADATA.jl&quot; rel=&quot;nofollow noreferrer&quot;&gt;METADATA.jl&lt;/a&gt;.&#xA;This would mean about 10 new versions of &lt;em&gt;&lt;code&gt;Jules&lt;/code&gt;&lt;/em&gt; would come out each day.&#xA;A &lt;em&gt;&lt;code&gt;Jules&lt;/code&gt;&lt;/em&gt; version number, would be something like:&#xA;&lt;code&gt;v&amp;lt;jules_language_version&amp;gt;-&amp;lt;julia_language_version&amp;gt;-&amp;lt;SHA_hash of MetaData.jl&lt;/code&gt;&#xA;eg &lt;code&gt;v0.1.0-0.5.2-d776b19&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With over 10 new versions per day,&#xA;many questions will not be win-able with the latest version of &lt;em&gt;&lt;code&gt;Jules&lt;/code&gt;&lt;/em&gt;.&#xA;See:&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5447/can-i-win-with-a-version-of-a-language-that-didnt-exist-when-the-challenge-was&quot;&gt;Can I win with a version of a language that didn&amp;#39;t exist when the challenge was posted?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My current proposed solution would be to have a script that will install the latest version of &lt;em&gt;&lt;code&gt;Jules&lt;/code&gt;&lt;/em&gt;, from before a given date and time.&#xA;And tell you the version number.&#xA;So you could copy and paste the time from the question, to get a copy of the language that is legal for competing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does this sound reasonable?&lt;/p&gt;&#xA;" OwnerUserId="4397" LastActivityDate="2017-06-15T08:01:32.053" Title="Languages with rapidly changing version" Tags="|discussion|rules|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12893" PostTypeId="2" ParentId="2140" CreationDate="2017-06-15T06:40:43.677" Score="1" Body="&lt;h1&gt;Sample the Sierpinski traingle&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://www.youtube.com/watch?v=kbKtFN71Lfs&quot; rel=&quot;nofollow noreferrer&quot;&gt;this video.&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to implement the following method to sample a &lt;a href=&quot;https://www.google.nl/url?sa=t&amp;amp;rct=j&amp;amp;q=&amp;amp;esrc=s&amp;amp;source=web&amp;amp;cd=2&amp;amp;cad=rja&amp;amp;uact=8&amp;amp;ved=0ahUKEwi7-r_bnL_UAhUPYlAKHWbkBkgQFggtMAE&amp;amp;url=https%3A%2F%2Fen.wikipedia.org%2Fwiki%2FSierpinski_triangle&amp;amp;usg=AFQjCNF0DZo4ztRSSaeJlyyOqXGllzs9hg&amp;amp;sig2=ImsoVr7Kh_UYbybPdCBH0g&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sierpinski triangle&lt;/a&gt; and plot all the intermediate steps.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Method&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given three points &lt;code&gt;a,b,c&lt;/code&gt; and some starting point &lt;code&gt;x_0&lt;/code&gt;, for each iteration you sample one of the three points &lt;code&gt;a,b,c&lt;/code&gt; with equal probability. You then place &lt;code&gt;x_{i+1}&lt;/code&gt; in the middle of the edge between &lt;code&gt;x_i&lt;/code&gt; and the sampled point. Repeating this draws the Sierpinski triangle.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You'll receive the coordinates of the three starting positions through any default accepted input method. The exact format can be flexible: a matrix, a list per point &lt;code&gt;[xa,ya],[xb,yb],[xc,yc]&lt;/code&gt;, a list for &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; &lt;code&gt;[xa,xb,xc],[ya,yb,yc]&lt;/code&gt;, a flat list &lt;code&gt;[xa,ya,xb,yb,xc,yc]&lt;/code&gt; are all allowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The starting point &lt;code&gt;x_0&lt;/code&gt; is &lt;code&gt;[0,0]&lt;/code&gt;. You can assume &lt;code&gt;[0,0]&lt;/code&gt; would fall within the overall shape.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For each iteration, including the initial, draw a plot of all the points up to that point. There should at least be a 100ms delay between two plots. If your language does not support graphical displays, you can also write your images to a file.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since the triangle is an infinite fractal, the program should loop forever (given infinite memory and all that jazz).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Criteria&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Shortest code wins!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example code (R)&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Sierpinski &amp;lt;- function(p, q) {&#xA;  x11()&#xA;  par(mar = rep(0, 4))&#xA;  plot(p, q, col= &quot;red&quot;, pch = 15, cex = 1, axes = FALSE)&#xA;&#xA;  x &amp;lt;- 0&#xA;  y &amp;lt;- 0&#xA;&#xA;  repeat {&#xA;    Sys.sleep(0.1)&#xA;    n &amp;lt;- sample(1:3, 1)&#xA;    x &amp;lt;- floor(x + (p[n] - x) / 2)&#xA;    y &amp;lt;- floor(y + (q[n] - y) / 2)&#xA;    points(x, y, pch = 15, cex = 0.5)&#xA;  }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://puu.sh/wl3rW/d5345696da.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://puu.sh/wl3rW/d5345696da.gif&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Duplicate? There are a couple 'draw a sierpinski triangle' challenges, but I couldn't find any that use this method of drawing them.&lt;/li&gt;&#xA;&lt;li&gt;Is the specification of the algorithm clear enough or should I add pseudocode?&lt;/li&gt;&#xA;&lt;li&gt;Is the 100ms delay between iterations reasonable?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="59530" LastEditorUserId="59530" LastEditDate="2017-06-15T19:58:21.643" LastActivityDate="2017-06-15T19:58:21.643" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12894" PostTypeId="2" ParentId="12892" CreationDate="2017-06-15T08:01:32.053" Score="6" Body="&lt;p&gt;Just yesterday &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12877/8478&quot;&gt;I proposed doing away with the non-competing policy for newer language versions&lt;/a&gt;. The proposals seems to be getting a lot of support, so you don't have to worry about frequent language updates at all if that new policy does come into effect.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2017-06-15T08:01:32.053" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12897" PostTypeId="1" CreationDate="2017-06-15T10:36:03.000" Score="2" ViewCount="247" Body="&lt;h3&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12575/ppcg-specific-mobile-app&quot;&gt;See main post here&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This [question] is intended as community submission describing the target functionality. This will likely change over time, but it will allow devs to have a end goal with their program. Obviously, this includes the standards (doing anything you would normally be able to do on the site), but also the below:&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This question is a place to keep a list of feature requests. If you have a request for the PPCG mobile app, add it as an answer here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you like an answer, upvote it to increase its priority.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2017-10-12T16:00:08.253" Title="PPCG-specific Mobile App: Feature Requests" Tags="|discussion|" AnswerCount="18" CommentCount="7" ClosedDate="2017-06-18T10:36:22.173" ContentLicense="CC BY-SA 3.0" />
  <row Id="12898" PostTypeId="2" ParentId="12897" CreationDate="2017-06-15T10:36:03.000" Score="7" Body="&lt;h1&gt;Better Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The Sandbox should load smoothly, be easy to use, and should NOT show deleted answers.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2017-06-15T10:36:03.000" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12899" PostTypeId="2" ParentId="12897" CreationDate="2017-06-15T10:37:03.780" Score="7" Body="&lt;h1&gt;TIO Integration&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Allowing users to test their code on the run would be infinitely helpful, since normally you'd have to wait until you had computer access. This would also make editing answers easier to do, since the answer can then be modified with the modified TIO-generated permalink.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2017-06-15T10:37:03.780" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12900" PostTypeId="2" ParentId="12897" CreationDate="2017-06-15T10:38:16.620" Score="4" Body="&lt;h1&gt;Automatic Leaderboards&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is not only much more convenient than a Stack Snippet but also will be on every code-golf post, not just the ones with the Stack Snippet.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2017-06-15T10:38:16.620" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12901" PostTypeId="2" ParentId="12897" CreationDate="2017-06-15T10:39:22.900" Score="3" Body="&lt;h1&gt;Improve Answer Sorting&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There are two parts to this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Firstly, adding sort by byte count (for code golf)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The default sort option should by changed for specific tags. For example, when the challenge is tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the default sort should be by byte count&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;While possibly slightly more difficult, it might be worth adding a sort by score option for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2017-06-15T10:39:22.900" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12902" PostTypeId="2" ParentId="12897" CreationDate="2017-06-15T10:40:31.827" Score="4" Body="&lt;h1&gt;Stack Snippet Support&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is probably impossible on a mobile device due to the requirement of JavaScript, HTML and CSS, but basically, it would be useful for when people post submissions in JS, to be able to run any stack snippets that they include in their answer.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2017-06-15T10:40:31.827" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12903" PostTypeId="2" ParentId="12897" CreationDate="2017-06-15T10:42:00.417" Score="8" Body="&lt;h1&gt;Monospaced Font&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It would be very useful for the app to use a monospaced font when writing answers and questions. This will allow code breakdowns and ASCII art to be designed in-situ.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Similarly, code blocks should use monospaced font.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2017-06-15T10:42:00.417" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12904" PostTypeId="2" ParentId="12897" CreationDate="2017-06-15T10:47:00.787" Score="7" Body="&lt;h1&gt;Find a Random Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Include an option to find a random challenge you haven't answered yet, similar to (but more efficient than!) &lt;a href=&quot;https://codegolf.stackexchange.com/a/122400/58974&quot;&gt;this&lt;/a&gt;. The tags used could either be:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Randomly pulled from your favourite tags.&lt;/li&gt;&#xA;&lt;li&gt;Defined by a user setting.&lt;/li&gt;&#xA;&lt;li&gt;Selectable every time the feature is used.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The limitation on the number of answers may need to be removed, or be defined by a user setting.&lt;/p&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-15T22:19:10.037" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12905" PostTypeId="2" ParentId="12897" CreationDate="2017-06-15T10:48:20.040" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://material.io/guidelines/components/buttons-floating-action-button.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Floating Action Buttons&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When viewing a challenge, the FAB would allow you to post a solution.&lt;/li&gt;&#xA;&lt;li&gt;When viewing any other page, the FAB would allow you to post a challenge.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-15T10:48:20.040" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12906" PostTypeId="2" ParentId="12897" CreationDate="2017-06-15T10:49:29.133" Score="8" Body="&lt;h1&gt;&lt;a href=&quot;https://oeis.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS&lt;/a&gt; Inegration&lt;/h1&gt;&#xA;&lt;p&gt;Include a feature to allow users to search for sequences or keywords in the OEIS.&lt;/p&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-15T10:49:29.133" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12907" PostTypeId="2" ParentId="12897" CreationDate="2017-06-15T10:51:33.260" Score="7" Body="&lt;h1&gt;Deleted Answers Toggle&lt;/h1&gt;&#xA;&lt;p&gt;Add a setting to allow users to toggle whether or not deleted solutions are displayed while using the app.&lt;/p&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-10-12T16:00:08.253" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12908" PostTypeId="2" ParentId="12897" CreationDate="2017-06-15T11:00:38.817" Score="-5" Body="&lt;h1&gt;Use &lt;a href=&quot;https://material.io/guidelines/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Material Design&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;If possible, use Google's Material Design ,for the Android app, at least.&lt;/p&gt;&#xA;&lt;p&gt;An extensive collection of MD style icons for use with such a design can be found &lt;a href=&quot;https://materialdesignicons.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; and includes most of the icons from Google's own icon library.&lt;br&gt;&lt;sub&gt;Disclosure: I am a contributor to their GitHub project&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-15T13:20:21.450" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12909" PostTypeId="2" ParentId="12897" CreationDate="2017-06-15T11:15:10.160" Score="3" Body="&lt;h1&gt;Language Filter / Search Answers&lt;/h1&gt;&#xA;&lt;p&gt;When viewing a challenge add the ability to filter answers by language or add a field to &amp;quot;find in page&amp;quot;.&lt;/p&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-15T11:15:10.160" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12910" PostTypeId="2" ParentId="2140" CreationDate="2017-06-15T11:19:38.413" Score="2" Body="&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This will be my first kolmogorov-complexity submission, does this question fall under that category?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is the question clear enough?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it too trivial?&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Problem&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given no input write a program or a function that outputs or returns the following string:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;(&amp;lt;(&amp;lt;&amp;gt;(&amp;lt;&amp;gt;.(&amp;lt;&amp;gt;.&amp;lt;(&amp;lt;&amp;gt;.&amp;lt;&amp;gt;(&amp;lt;&amp;gt;.&amp;lt;&amp;gt;)&amp;lt;&amp;gt;.&amp;lt;&amp;gt;)&amp;gt;.&amp;lt;&amp;gt;).&amp;lt;&amp;gt;)&amp;lt;&amp;gt;)&amp;gt;)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Shortest program wins&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Trailing whitespace allowed.&lt;/li&gt;&#xA;&lt;li&gt;Trailing newlines allowed.&lt;/li&gt;&#xA;&lt;li&gt;Unused parameters for functions allowed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="68917" LastActivityDate="2017-06-15T11:19:38.413" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12911" PostTypeId="2" ParentId="12897" CreationDate="2017-06-15T11:21:10.203" Score="-6" Body="&lt;h1&gt;Sandbox Prompt&lt;/h1&gt;&#xA;&lt;p&gt;This may prove to more of an annoyance than anything else but, when posting to main, include some sort of prompt to post to the Sandbox first.&lt;/p&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-15T11:21:10.203" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12912" PostTypeId="2" ParentId="12897" CreationDate="2017-06-15T11:23:56.433" Score="6" Body="&lt;h1&gt;Push Notifications&lt;/h1&gt;&#xA;&lt;p&gt;Include push notifications for everything that you normally get notifications for on the site, such as comments, chat pings, new answers to your challenges, edits to your posts, etc., etc.&lt;/p&gt;&#xA;&lt;p&gt;Add a notification, if it's possible, for new &amp;amp; updated Sandbox posts.&lt;/p&gt;&#xA;&lt;p&gt;All of the above should be configurable through user settings.&lt;/p&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-15T11:23:56.433" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12913" PostTypeId="2" ParentId="2140" CreationDate="2017-06-15T11:38:40.163" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/237895/randomly-capitalise-half-of-a-string&quot;&gt;Randomly capitalize half of a string&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="44998" LastEditorUserId="44998" LastEditDate="2021-12-01T20:26:04.103" LastActivityDate="2021-12-01T20:26:04.103" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="12915" PostTypeId="2" ParentId="12897" CreationDate="2017-06-15T14:45:23.277" Score="5" Body="&lt;h1&gt;Edit Histories &amp;amp; Rollbacks&lt;/h1&gt;&#xA;&lt;p&gt;Include the ability to view edit histories and to roll posts back to previous versions.&lt;/p&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-15T14:45:23.277" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12917" PostTypeId="2" ParentId="2140" CreationDate="2017-06-15T14:59:44.523" Score="-2" Body="&lt;h1&gt;Print a Variable's Memory Address &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/suggestions-needed&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;suggestions-needed&amp;#39;&quot; rel=&quot;tag&quot;&gt;suggestions-needed&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/126326/print-a-variables-name&quot;&gt;this puzzle&lt;/a&gt; I posted earlier, with a difference that should make this challenge easier.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Create a function (not a full program) that prints or returns the memory address of the parameter passed in. Literal values should return a falsey value.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;var foo = 4901&#xA;var bar = &quot;foobarbaz&quot;&#xA;var baz = true&#xA;&#xA;getMemoryAddress(from: foo) // 0x00000000004030f0&#xA;getMemoryAddress(from: bar) // 0x00000000004030f8&#xA;getMemoryAddress(from: baz) // 0x0000000000403110&#xA;getMemoryAddress(from: &quot;Bad Value&quot;) // false&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that you probably won't get the same exact result as show above.&lt;/p&gt;&#xA;" OwnerUserId="68374" LastEditorUserId="68374" LastEditDate="2017-06-15T15:38:25.183" LastActivityDate="2017-06-15T15:38:25.183" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12918" PostTypeId="2" ParentId="2140" CreationDate="2017-06-15T16:10:55.927" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://www.youtube.com/watch?v=7ZS2-4-iUJ4&quot; rel=&quot;nofollow noreferrer&quot;&gt;Star Trekkin'&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/animation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;animation&amp;#39;&quot; rel=&quot;tag&quot;&gt;animation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Just an idea at this stage; wanted to get it down lest I forget it. I'll come back to it in a few days to work out the details.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Generate an ASCII art representation of the USS Enterprise with an animated, randomised ASCII starfield behind it.&lt;/p&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-15T16:10:55.927" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12920" PostTypeId="2" ParentId="12897" CreationDate="2017-06-15T17:42:00.537" Score="4" Body="&lt;h1&gt;Template(s) for answers&lt;/h1&gt;&#xA;&lt;p&gt;There should be an option to automatically convert some code in an answer to the format:&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;&amp;lt;lang&gt;, &amp;lt;n&gt; bytes&#xA;    &amp;lt;code here&gt;&#xA;[Try it online!](&amp;lt;link&gt;) (If selected lang exists on TIO)&#xA;&lt;/pre&gt;&#xA;" OwnerUserId="60042" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-15T17:42:00.537" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12921" PostTypeId="2" ParentId="12897" CreationDate="2017-06-15T17:45:24.627" Score="4" Body="&lt;h1&gt;Use Custom Codepages for Byte Counts&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Like the graduation userscript, when finding the byte count of the submission, the app should use specific languages' &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9428/when-can-apl-characters-be-counted-as-1-byte-each&quot;&gt;custom codepages&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This would be helpful for Jelly, APL, etc.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2017-06-15T17:45:24.627" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12922" PostTypeId="2" ParentId="12897" CreationDate="2017-06-15T17:46:51.283" Score="1" Body="&lt;h1&gt;Universal Windows Platform/Windows Phone Support&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Pretty please?&#xA;There are &lt;em&gt;dozens&lt;/em&gt; of us!&lt;/p&gt;&#xA;" OwnerUserId="60042" LastActivityDate="2017-06-15T17:46:51.283" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12924" PostTypeId="1" CreationDate="2017-06-15T18:02:18.690" Score="9" ViewCount="519" Body="&lt;p&gt;We allow both programs and functions. Some challenges, mostly &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenges, do not require input.  This means that for some challenges you can write a function that takes no input.  In many languages this is rather straight forward.  For example if a challenge asked you to output 26 python function to do these it would look like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;lambda:26&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In Haskell this is a bit stranger.  There are two arguments to be had:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Haskell does not have functions that take no inputs so you must write a complete program.  You should write:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;main=print 26&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Everything in Haskell is a function, input-less functions are just objects.  You can just write:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;26&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and that's a function that takes no args and returns 26.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I don't very much like either of these arguments.  The first seems to me to be treating Haskell as if it were Python while the second seems to be arguing that snippets are ok, which I certainly don't believe.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What should be allowed in Haskell for challenges that don't allow input?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Before anyone says, &quot;Why does this even matter? A challenge this simple would be closed anyway.&quot;  Often these types of challenges have further stipulations for example &lt;a href=&quot;https://codegolf.stackexchange.com/q/126063/&quot;&gt;this&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;   &lt;a href=&quot;https://codegolf.stackexchange.com/q/126063/&quot;&gt;question&lt;/a&gt; requires each entry only to output a number, but has source restrictions on each answer.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="69850" LastEditDate="2017-12-31T02:29:12.060" LastActivityDate="2017-12-31T02:29:12.060" Title="Are objects in Haskell valid if there is no input?" Tags="|discussion|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12927" PostTypeId="2" ParentId="5243" CreationDate="2017-06-15T19:57:22.213" Score="6" Body="&lt;h1&gt;900 rep for a shorter &lt;a href=&quot;https://codegolf.stackexchange.com/questions/122569/klein-topololyglots&quot;&gt;Klein Topololyglot&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;What it says on the tin, beat the current best and I'll give you 400 rep. (and 500 from me, Jo King)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Previous winners:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;August 15th 2017: &lt;a href=&quot;https://codegolf.stackexchange.com/a/139202/56656&quot;&gt;0                                                                                                              '&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;August 29th 2018: &lt;a href=&quot;https://codegolf.stackexchange.com/a/171393/56656&quot;&gt;JoKing&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="76162" LastEditDate="2019-10-30T05:04:22.250" LastActivityDate="2019-10-30T05:04:22.250" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="12928" PostTypeId="2" ParentId="2140" CreationDate="2017-06-15T20:05:56.550" Score="0" Body="&lt;p&gt;Programming Challenge: &#xA;Winning criterion is the shortest byte program which can tell me (x, y) which number &quot;x&quot; was doubled in the list, and which number &quot;y&quot; was removed from the list of 1000 numbers from 1 to 1000. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a list of 1000 positive integers in random order, find the integer that is repeated more than once, the integers that are not present in the range [1,1000] and output the count of the repeated integer present in the list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The format of the list is a space deliminated text file such as this: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;779 990 5 814 353&#xA;627 173 797 714 619&#xA;802 719 895 966 325&#xA;275 158 322 215 271&#xA;631 232 175 10 397&#xA;892 124 26 287 878&#xA;757 754 508 871 255&#xA;363 159 482 400 247&#xA;223 857 862 18 434&#xA;919 335 586 65 579&#xA;828 943 366 874 999&#xA;238 289 362 600 321&#xA;193 863 613 930 143&#xA;107 879 530 284 110&#xA;437 426 981 546 924&#xA;701 441 941 43 614&#xA;542 727 694 351 643&#xA;794 563 476 834 624&#xA;804 634 776 672 57&#xA;597 338 748 908 156&#xA;297 234 444 598 891&#xA;925 163 229 791 326&#xA;944 182 262 987 734&#xA;582 910 567 132 28&#xA;645 962 994 6 917&#xA;617 64 106 304 404&#xA;88 93 849 882 677&#xA;749 254 12 399 897&#xA;329 988 31 379 654&#xA;25 646 134 445 327&#xA;577 848 673 551 408&#xA;405 806 244 40 601&#xA;497 177 972 526 545&#xA;796 755 630 663 423&#xA;428 562 610 1 686&#xA;548 281 101 154 747&#xA;763 32 236 368 956&#xA;639 522 507 792 771&#xA;693 147 728 203 845&#xA;615 889 931 440 299&#xA;348 707 235 320 295&#xA;803 513 703 940 717&#xA;205 150 702 189 183&#xA;296 875 575 454 492&#xA;194 425 126 657 976&#xA;570 809 945 825 168&#xA;890 217 656 29 550&#xA;684 188 78 221 446&#xA;523 952 676 900 583&#xA;484 933 268 608 708&#xA;665 17 963 212 253&#xA;432 964 858 909 316&#xA;155 120 114 210 477&#xA;319 647 822 409 388&#xA;818 308 77 102 373&#xA;929 113 402 841 213&#xA;470 877 648 968 135&#xA;309 824 690 844 463&#xA;323 240 706 391 653&#xA;372 985 346 788 510&#xA;991 554 494 44 915&#xA;758 756 989 759 659&#xA;534 142 939 675 378&#xA;974 345 462 54 942&#xA;681 1000 7 716 415&#xA;42 264 996 438 464&#xA;386 350 197 141 84&#xA;123 127 811 853 516&#xA;60 49 277 70 986&#xA;98 733 905 978 103&#xA;390 230 501 449 731&#xA;34 370 541 958 466&#xA;251 71 108 846 260&#xA;576 830 100 140 529&#xA;869 333 303 664 589&#xA;856 777 427 187 184&#xA;305 766 829 136 456&#xA;786 401 737 961 475&#xA;412 887 178 91 698&#xA;448 433 62 519 832&#xA;314 957 861 898 683&#xA;983 515 893 220 817&#xA;979 149 267 3 63&#xA;458 473 139 970 835&#xA;666 119 967 695 343&#xA;242 947 41 47 623&#xA;973 53 354 74 816&#xA;121 471 151 246 369&#xA;499 45 593 691 376&#xA;111 46 226 83 431&#xA;274 606 506 265 753&#xA;79 387 451 883 525&#xA;479 744 162 949 8&#xA;292 95 97 324 823&#xA;315 152 394 671 718&#xA;347 836 50 195 360&#xA;812 566 725 612 923&#xA;537 911 620 51 328&#xA;243 19 556 592 288&#xA;334 298 873 655 443&#xA;705 66 767 604 285&#xA;760 896 474 406 73&#xA;918 688 667 914 730&#xA;729 826 959 774 543&#xA;594 192 27 948 912&#xA;491 419 341 518 55&#xA;146 787 495 904 172&#xA;469 761 840 626 637&#xA;144 616 465 712 660&#xA;785 365 250 636 384&#xA;208 2 174 864 839&#xA;741 410 621 342 442&#xA;245 568 998 485 216&#xA;960 224 239 782 855&#xA;291 355 860 807 936&#xA;920 56 669 561 697&#xA;112 270 715 913 938&#xA;364 851 467 751 468&#xA;450 995 609 490 72&#xA;674 713 640 185 801&#xA;361 742 38 784 167&#xA;225 743 692 790 907&#xA;859 762 569 115 521&#xA;116 200 580 632 997&#xA;85 82 249 207 486&#xA;218 196 14 932 867&#xA;429 258 125 793 69&#xA;865 385 902 222 531&#xA;611 658 318 935 980&#xA;808 23 105 722 300&#xA;520 30 420 286 662&#xA;227 581 745 585 928&#xA;330 638 358 587 16&#xA;452 635 736 489 252&#xA;89 951 137 591 721&#xA;880 555 204 535 769&#xA;9 820 605 854 148&#xA;128 934 396 480 307&#xA;161 711 750 704 651&#xA;696 133 813 789 517&#xA;263 775 553 75 992&#xA;293 190 916 273 602&#xA;461 11 977 202 764&#xA;483 76 52 773 723&#xA;870 872 498 359 868&#xA;67 544 504 279 833&#xA;599 48 171 687 80&#xA;547 336 417 642 181&#xA;558 906 256 219 81&#xA;866 810 709 186 668&#xA;572 145 209 739 682&#xA;847 752 720 332 393&#xA;770 965 574 629 176&#xA;746 306 138 798 15&#xA;528 778 392 457 726&#xA;337 39 86 380 160&#xA;493 211 436 180 241&#xA;795 94 955 837 214&#xA;584 954 117 549 59&#xA;340 805 367 927 633&#xA;946 738 819 487 557&#xA;768 4 37 827 596&#xA;511 628 381 68 679&#xA;838 179 603 680 13&#xA;231 650 35 700 735&#xA;975 595 502 301 424&#xA;527 678 950 280 532&#xA;649 685 710 539 903&#xA;248 276 571 500 435&#xA;560 109 926 588 278&#xA;414 509 237 169 740&#xA;885 118 430 382 689&#xA;481 311 199 993 821&#xA;261 447 540 357 92&#xA;129 131 953 375 377&#xA;852 61 191 228 937&#xA;122 418 439 573 198&#xA;331 302 505 644 283&#xA;421 416 36 894 884&#xA;831 22 24 104 876&#xA;371 272 622 312 578&#xA;459 395 455 536 374&#xA;969 403 565 269 389&#xA;552 90 164 922 781&#xA;503 460 524 206 356&#xA;130 259 533 294 157&#xA;901 422 290 514 982&#xA;641 661 478 559 496&#xA;282 512 266 257 538&#xA;765 564 96 783 724&#xA;843 317 411 799 652&#xA;488 310 349 313 413&#xA;453 886 58 971 20&#xA;921 618 815 850 99&#xA;339 87 21 472 699&#xA;33 607 800 352 899&#xA;233 166 780 407 625&#xA;670 201 170 383 772&#xA;344 376 881 984 590&#xA;165 732 153 398 842  &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For example in this list 376 is repeated twice, and 888 is removed once.&#xA;In this challenge a number &quot;x&quot; can only be repeated &quot;once&quot;, so the number &quot;888&quot; can only be removed once, so an acceptable output for a programmed answer&#xA;is this &quot;(x, y)&quot; where &quot;x&quot; is the number repeated twice, and &quot;y&quot; is the number removed. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I attempted to make this programming question, but because I included a bonus for web-scraping, and the format of the output for an answer was not clear it didn't receive positive reviews.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I would like suggestions I how I can make this challenge clearer. Thank you. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is my challenge and the comments I received. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/126743/programming-challenge-tell-me-which-number-i-repeated-how-many-times-and-whic?noredirect=1#comment311825_126743&quot;&gt;Programming Challenge: Tell me which number I repeated, how many times, and which one I skipped?&lt;/a&gt;    &lt;/p&gt;&#xA;" OwnerUserId="69968" LastActivityDate="2017-06-15T20:05:56.550" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12930" PostTypeId="2" ParentId="12877" CreationDate="2017-06-15T21:20:20.787" Score="66" Body="&lt;h1&gt;Trust the community and add a standard loophole&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I think the community can handle the add-a-builtin problem (I may be very wrong). I think that if someone adds a feature to their language that is clearly meant to only solve one particular challenge, the community will probably downvote that answer into oblivion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I still think we need a rule against adding a builtin to a language so that when a new user comes and tries to do it we can have an actual reason for downvoting. It could possibly be added to the list of standard loopholes.&lt;/p&gt;&#xA;" OwnerUserId="61563" LastEditorUserId="61563" LastEditDate="2017-06-16T04:17:33.490" LastActivityDate="2017-06-16T04:17:33.490" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12932" PostTypeId="1" CreationDate="2017-06-15T21:42:51.583" Score="16" ViewCount="181" Body="&lt;p&gt;A few times I have noticed that, to reduce clutter, people have taken it upon themselves to reduce the body of sandbox posts &lt;em&gt;in bulk&lt;/em&gt;. While, I don't disagree with the practice of decluttering, by editing 10+ posts all in one go, you create even more clutter. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Instead of finding the newest posts on the first page (when sorting by active, as suggested), you may have to go to the second or third pages to get the new posts. This is extremely incovenient and infuriating.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anyway, I would like to propose a limit of decluttering in batches of 5 or 10. Large-scale decluttering is very bad practice.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="30525" LastEditDate="2017-06-15T21:47:06.183" LastActivityDate="2017-06-16T10:49:29.150" Title="Cluttering the Sandbox with Edits" Tags="|discussion|sandbox|etiquette|" AnswerCount="3" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="12933" PostTypeId="2" ParentId="12932" CreationDate="2017-06-16T01:13:29.087" Score="13" Body="&lt;h1&gt;We can fix this problem by decluttering &lt;em&gt;sooner&lt;/em&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I agree that mass decluttering is an issue. It's an issue caused by the decluttering not having been done in the first place; if a challenge is decluttered as soon as it's posted, there's no need to declutter it later, and it isn't decluttered at the same time as other challenges (thus meaning that we don't get the &quot;block of red&quot; that makes the sandbox hard to use).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At present, I think there's some reluctance to decluttering other people's posts. If we have an explicit rule that &quot;as soon as you see a deleted Sandbox post for a recently posted challenge, you should declutter it&quot;, that would help the declutterings be spread out in time; the more people decluttering, the less &quot;clumpy&quot; the declutterings get. (Or to put it the other way round: the reason we get declutter clumps is that few people are decluttering and they don't do it very often, meaning that a large amount of clutter builds up in between each decluttering event.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Note &quot;recently posted&quot; here; if a challenge dodges a declutter for a long time, you should probably delay decluttering it until there haven't been any declutterings recently, as the OP suggests. Additionally, if a challenge dodges a declutter for a long time, it'll probably be several pages back, and thus decluttering it will be less important.)&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-16T01:13:29.087" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12935" PostTypeId="2" ParentId="8900" CreationDate="2017-06-16T02:12:38.923" Score="11" Body="&lt;h1&gt;The Complete How-To KoTH&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;1. Have an idea&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is the part I can't help you with.  If you're looking for ideas, check the sandbox, chat with others, or check your local board game store.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;2. Refine your idea&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Figure out what mechanics are interesting.  This is a &lt;em&gt;refining&lt;/em&gt; stage, so &lt;strong&gt;remove as much as you can from your idea&lt;/strong&gt;.  For example, if you've got a fighting-based KoTH, consider removing the maze you are putting them in, or even the grid entirely and make it a 1-on-1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Things to consider:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Randomness is your enemy&lt;/em&gt;.  You want there to be as little randomness as possible.  Sometimes you need randomness (such as a random turn order), but remove as much as possible.  &lt;strong&gt;The more randomness in your challenge, the more games you will have to run&lt;/strong&gt; to ensure you have the right winner.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Are there winning strategies?&lt;/em&gt;  What's a feasible strategy that has a chance of winning?  Is there a strategy that counters it?   Is there a strategy that &lt;em&gt;can't&lt;/em&gt; be beaten?  Are there &lt;em&gt;interesting&lt;/em&gt; strategies (takes more than a couple of lines to write)?  &lt;strong&gt;Are there a decent amount of easy strategies?&lt;/strong&gt;.  You want to make the entry bar as low as possible to get people's feet wet.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Is your KoTH a 1-up KoTH?&lt;/em&gt;  Figure out what you think the best strategy will be.  Is it possible to employ the same strategy, but with a slight offset in order to beat the top submission?  1-up strategies are really common in perfect-information games (everybody can see everything), so perhaps try hiding some information from opponents.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Post it in the sandbox&lt;/em&gt;.  Be careful about upvotes here.  People like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenges, and they tend to get a lot of upvotes in the sandbox.  You &lt;em&gt;really&lt;/em&gt; need as much feedback as you can get, as flaws are not easily fixed later on.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;How are you going to run multiple games?&lt;/em&gt;  Which players go in which games?  How are you going to combine scores across multiple games?  &lt;strong&gt;Your tournament structure can drastically change strategies&lt;/strong&gt;, so consider what you really want.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;3. Write your controller&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is the fun part.   While you are doing this, you'll probably discover that you missed some edge-cases.  Make sure to add them to your sandboxed post, and get feedback on how to resolve them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Things to consider:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;How are you going to run submissions?&lt;/em&gt;  This decision will have the biggest impact on how fast each game will run. &#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If all submissions extend a class (or is a function call), response times are measured in micro-seconds&lt;/li&gt;&#xA;&lt;li&gt;If submissions are separate processes, but stay alive between method calls, response times are measured in nano-seconds&lt;/li&gt;&#xA;&lt;li&gt;If submissions are separate processes, and you boot it each method call, response times are measured in milli-seconds&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I'm not exaggerating here.  I've run my fair share of KoTHs, and spent a fair amount of time trying to get cross-language communication as fast as possible.  &lt;strong&gt;Cross-process communication is orders of magnitude slower.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, if you allow more languages, you are likely to get more submissions.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Write some sample submissions&lt;/em&gt;.  You need some submissions to test your code and to provide an example of how to write a submission.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Make your interface as easy as possible&lt;/em&gt;.  Make it ridiculously easy to write a submission.  Not only should the methods be simple, but consider adding helper functions for tasks that will be common in your KoTH (such as pathfinding or tracking other submissions)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Test your KoTH controller&lt;/em&gt;.  I &lt;em&gt;cannot&lt;/em&gt; tell you how often I see KoTHs posted with ridiculously buggy controllers.  I know you are excited, but &lt;strong&gt;please, please test your controller&lt;/strong&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;4. Share and Run your KoTH&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;KoTHs need lots of submissions, so try to make it as popular as you can:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your post should:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Be brain-dead easy to read and understand&lt;/em&gt;.  KoTHs are complicated beasts, so explaining your challenge well is critically important.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Contain a complete walk-through&lt;/em&gt; of how to write a submission and run your controller&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Have an image&lt;/em&gt;.  This can help increase the interest of people reading your post.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You should:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Commit to running and fixing your KoTH&lt;/em&gt; at least once a day for the next week, and every 2-4 days after that depending on how many submissions you get.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Watch the leaderboards&lt;/em&gt;.  Make sure that the top submissions aren't changing places on each run-through.  If so, you need to increase the number of iterations.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Open a chat room&lt;/em&gt;.  People are going to get stuck, and helping them through the comment system is sub-optimal.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2018-12-18T15:55:48.033" LastActivityDate="2018-12-18T15:55:48.033" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="12937" PostTypeId="2" ParentId="8900" CreationDate="2017-06-16T02:55:23.083" Score="0" Body="&lt;h1&gt;Opponent prediction&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In general, a koth is better if there is some level of opponent prediction, rather than perfect info where the result tends to be based on whether someone wrote the ideal bot. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even if your koth doesn't have perfect info, it can still have an ideal bot. for example, a move with an expected value of 5 is better than one with an expected value of 4. hence there should be opponent variance and simultaneous turns or fog of war, so that you can take the guessing about how your opponent would behave to enrich the metagame.&lt;/p&gt;&#xA;" OwnerUserId="55896" LastActivityDate="2017-06-16T02:55:23.083" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12938" PostTypeId="2" ParentId="12757" CreationDate="2017-06-16T04:06:09.480" Score="4" Body="&lt;p&gt;I'd just like to express my &lt;em&gt;disagreement&lt;/em&gt; with this post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I love PPCG. I technically joined 6 months ago but I became active only 1 month ago. The PPCG community has welcomed me with open arms, such as in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; where I am now a regular. Everyone has been great to me. &lt;strong&gt;Proving that newbies can become part of the PPCG community.&lt;/strong&gt; (On top of my being a noob here, I came from StackOverflow. If for some reason you think PPCG is not receptive to newcomers, StackOverflow is about a hundred times worse.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've also found lots and lots of perfectly good questions to answer. Initially I answered questions in C and BASIC, and got plenty of rep from that while &lt;em&gt;none&lt;/em&gt; of my answers were very short, per se. &lt;strong&gt;Proving that if you're not super competitive you can get reputation.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More recently I've been developing my own languages - which, again, the community has been &lt;em&gt;very&lt;/em&gt; helpful with - and have been dedicating my time to that instead. I solve challenges in my languages to help improve them. &lt;strong&gt;Proving that even if you're not an avid answerer there is still fun in PPCG.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I am/was not the perfect newbie. I asked a couple awful questions when I first joined; they were downvoted and closed &lt;em&gt;as they should be&lt;/em&gt;. If you think people should decide to like a bad question just because a newbie posted it, well, &lt;em&gt;no&lt;/em&gt;. I soon leaned to use the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;Sandbox&lt;/a&gt;. &lt;strong&gt;Bad questions are bad questions regardless of newbie-ness.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I now have questions with 30+ votes. &lt;strong&gt;Newbies can and should learn to ask good questions.&lt;/strong&gt; It may not be particularly easy, but that's no reason not to try.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In regards to your statement that you have to &lt;code&gt;compete against the mathematical geniuses the make up most of this site&lt;/code&gt;, do what I do. Don't browse the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; tag. ¯\_(ツ)_/¯&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anyway, just saying thanks to the community here. Not all newcomers think you're too competitive or dislike competing with brilliance.&lt;/p&gt;&#xA;" OwnerUserId="61563" LastActivityDate="2017-06-16T04:06:09.480" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="12939" PostTypeId="2" ParentId="12932" CreationDate="2017-06-16T06:17:20.187" Score="12" Body="&lt;h2&gt;Don't declutter posts that have dropped off the first active page&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The entire point of editing down deleted posts is to reduce the clutter on the first page when sorted by &lt;em&gt;active&lt;/em&gt;, where they take up too much space between the challenge proposals that are still being worked on. Once the deleted post is no longer on the first page its impact on the usability of the sandbox is minimal and editing it down is more detrimental than just leaving it, because then it can actually push active proposals &lt;em&gt;off&lt;/em&gt; the first page.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So by all means, edit down your own posts as soon as you delete them, as well as other deleted posts you may find on the first page, but once they're off the first page, just leave them as they are.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2017-06-16T06:17:20.187" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12940" PostTypeId="2" ParentId="2140" CreationDate="2017-06-16T09:15:01.417" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://www.youtube.com/watch?v=zL8G5pBZ5CI&amp;amp;t=144s&quot; rel=&quot;nofollow noreferrer&quot;&gt;Working For The Weekend&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Option 1&lt;/h2&gt;&#xA;&lt;p&gt;Taking no input, output &lt;code&gt;true&lt;/code&gt; if today is Saturday or Sunday or &lt;code&gt;false&lt;/code&gt; otherwise.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Option 2&lt;/h2&gt;&#xA;&lt;p&gt;Taking no input, output how many days, from today, until the weekend.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Sunday:    0&#xA;Monday:    5&#xA;Tuesday:   4&#xA;Wednesday: 3&#xA;Thursday:  2&#xA;Friday:    1&#xA;Saturday:  0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Which option do you prefer?&lt;/li&gt;&#xA;&lt;li&gt;Too trivial?&lt;/li&gt;&#xA;&lt;li&gt;Dupe?&lt;/li&gt;&#xA;&lt;li&gt;Allow local times to be used or require UTC? (I &lt;em&gt;wanna&lt;/em&gt; say UTC)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;true&lt;/code&gt; &amp;amp; &lt;code&gt;false&lt;/code&gt; or truthy &amp;amp; falsey? (if option 1)&lt;/li&gt;&#xA;&lt;li&gt;Working or Livin' For The Weekend?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-16T09:15:01.417" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12942" PostTypeId="2" ParentId="12932" CreationDate="2017-06-16T10:49:29.150" Score="3" Body="&lt;h1&gt;Don't declutter, delete.&lt;/h1&gt;&#xA;&lt;p&gt;Yes, a deleted post will still be visible to most of us, but it's decidedly marked and can be skipped by the reader. Also, with any luck, the post was left in the sandbox (unedited) for so long that, at the time of going Main, it was no longer on the first page anyway. Editing it (at time of posting on Main, or any time theresafter) just brings it up again without a clear purpose.&lt;/p&gt;&#xA;" OwnerUserId="44874" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-16T10:49:29.150" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12943" PostTypeId="2" ParentId="12868" CreationDate="2017-06-16T11:46:22.110" Score="3" Body="&lt;h3&gt;Sometimes a win is getting your code about the same length as everyone else's.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I recently started golfing in Swift, which is probably one of the worst languages to use because the strict typing causes you answer to be about twice as long as everyone else's.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Unless there is a limitation that breaks your code online, post a link so people can test it.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;When you post a solution, the OP will most likely want to test it him/herself. You can find online playgrounds fairly easily, but &lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt; is most commonly used around here.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Learn what your language does well and what it is terrible at.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Pick a language you want to use, and start learning its loop-holes, pitfalls (Swift still doesn't have a 'by-the-power-of' operator, AKA &lt;code&gt;**&lt;/code&gt;), built-ins, and strengths. You can easily gain this knowledge over time as you try to solve challenges:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Hmmm, I should be able to make this shorter.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;em&gt;*Googling...*&lt;/em&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Ah, never knew about that language feature!&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;em&gt;*Lose 10 bytes from your solution.*&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h3&gt;What if your language doesn't cut it but you love the syntax?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If you want to get crazy, write a new language or a transpiler and open-source it, then use that to write your solutions.&lt;/p&gt;&#xA;" OwnerUserId="68374" LastEditorUserId="68615" LastEditDate="2017-06-24T03:16:09.920" LastActivityDate="2017-06-24T03:16:09.920" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12944" PostTypeId="2" ParentId="12924" CreationDate="2017-06-16T11:54:46.983" Score="-5" Body="&lt;p&gt;If &lt;code&gt;26&lt;/code&gt; evaluates to a function which takes no arguments and returns the number 26, then it is a valid function submission.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-06-16T11:54:46.983" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12945" PostTypeId="2" ParentId="12924" CreationDate="2017-06-16T13:08:27.800" Score="20" Body="&lt;p&gt;As stated in the comments I have been undecided about this matter, but thinking a bit lead to the following argument in favour of the second option:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;In Haskell &lt;code&gt;26&lt;/code&gt; is a valid anonymous function which takes no argument&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Haskell's laziness makes each object behave like a function which only returns its value when called, even though the call needs no arguments and happens implicit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider the declaration &lt;code&gt;x=mod 1 0&lt;/code&gt;. Division by 0 causes an exception, but only when the value is actually computed. Because of the lazy evaluation, the declaration causes no exception, just like a function declaration &lt;code&gt;x=lambda:1/0&lt;/code&gt; in Python does not cause an error. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Only if we force &lt;code&gt;x&lt;/code&gt; to yield its value, e.g. by writing &lt;code&gt;print x&lt;/code&gt;, the exception is thrown, just like &lt;code&gt;print(x())&lt;/code&gt; in Python throws an error. Thus &lt;code&gt;x&lt;/code&gt; can be considered to be a function. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, as the site rules allow anonymous functions, in the above case &lt;code&gt;mod 1 0&lt;/code&gt; then is an anonymous function, as is &lt;code&gt;26&lt;/code&gt; or &lt;code&gt;[1,2,3]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I do see the problem that this is essentially allowing snippets in Haskell, but this is different than allowing snippets in general. Rather the proposal would be to recognize lazy evaluation as implicit function evaluation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This would solve the problem for Haskell and potential other languages that support lazy evaluation, though it would still persist e.g. in &lt;a href=&quot;https://en.wikipedia.org/wiki/Standard_ML&quot; rel=&quot;nofollow noreferrer&quot;&gt;Standard ML&lt;/a&gt; which also has no dedicated syntax for functions taking no arguments, but also no strong laziness concept.&lt;/p&gt;&#xA;" OwnerUserId="56433" LastActivityDate="2017-06-16T13:08:27.800" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12948" PostTypeId="2" ParentId="2140" CreationDate="2017-06-16T18:03:59.350" Score="0" Body="&lt;p&gt;What could I add to improve this post? I have some questions that are inside of brackets.&lt;/p&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;A farmer needs help calculating the least time it will take him to pick his fruit each day.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This farmer has &lt;code&gt;X&lt;/code&gt; orchards.&lt;/li&gt;&#xA;&lt;li&gt;Each orchard has &lt;code&gt;Y&lt;/code&gt; [is &lt;code&gt;Y&lt;/code&gt; the correct variable to use here? does it matter?] fruits in it. If the orchard has no fruits, then it will contain the string &amp;quot;none&amp;quot;.&lt;/li&gt;&#xA;&lt;li&gt;The farmer has a list, this list contains the fruit he must pick.&lt;/li&gt;&#xA;&lt;li&gt;The farmer will only go down the list &lt;strong&gt;in order&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;You must calculate how long it will take the farmer to pick his fruit on each day.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;More on the orchards&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All of the orchards are in a line.&lt;/li&gt;&#xA;&lt;li&gt;Each orchard is exactly &lt;code&gt;1&lt;/code&gt; unit [should I say unit or kilometer?] away from the next and previous one.&lt;/li&gt;&#xA;&lt;li&gt;The farmer can go up and down the line, but may not jump from one orchard to another&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;You will receive an input in the following format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;X&#xA;*string*&#xA;*string*&#xA;*string* *string* *string* *string*&#xA;*string*&#xA;//ect.&#xA;Y&#xA;*string* *string*&#xA;*string* *string*&#xA;*string* *string*&#xA;*string* *string*&#xA;//ect.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;X&lt;/code&gt; is the number of orchards&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Everything after &lt;code&gt;X&lt;/code&gt; and before &lt;code&gt;Y&lt;/code&gt; is an orchard containing a/some string(s), each string is a different fruit in that orchard.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;code&gt;Y&lt;/code&gt; is the number of days that the farmer must gather fruit.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each day consists of two strings that are different fruits.&lt;/li&gt;&#xA;&lt;li&gt;You must find what orchard these strings are in and calculate the difference.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Input Rules:&lt;/h3&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Each fruit name string will be one word with &lt;strong&gt;no spaces&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;[Should I add more here? if so, what should I add?]&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Real Example&lt;/h3&gt;&#xA;&lt;p&gt;Still confused? Maybe this will clear it up:&lt;/p&gt;&#xA;&lt;p&gt;Input&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;6 &#xA;&#xA;none&#xA;&#xA;apple&#xA;&#xA;orange pear pear&#xA;&#xA;none&#xA;&#xA;orange lemon pumpkin&#xA;&#xA;pumpkin lettuce flowers peas&#xA;&#xA;4&#xA;&#xA;peas lettuce &#xA;&#xA;apple orange &#xA;&#xA;apple pumpkin &#xA;&#xA;flowers orange &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;output: &lt;code&gt;[ 0, 1, 3, 1 ]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Explanation&lt;/h3&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;6&lt;/code&gt; the number of orchards&lt;/li&gt;&#xA;&lt;li&gt;A set of &lt;code&gt;6&lt;/code&gt; orchards containing fruit, each orchard on a new line.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;4&lt;/code&gt; the number of days on the farmers list.&lt;/li&gt;&#xA;&lt;li&gt;A set of &lt;code&gt;4&lt;/code&gt; fruits to compare, each pair of fruits is on a new line.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output an array of the differences between each set of fruits.&lt;/li&gt;&#xA;&lt;li&gt;The difference between peas and lettuce is &lt;code&gt;0&lt;/code&gt;, because they are in the same orchard.&lt;/li&gt;&#xA;&lt;li&gt;The difference between apples and oranges is &lt;code&gt;1&lt;/code&gt; because they are one orchard apart.&lt;/li&gt;&#xA;&lt;li&gt;The difference between apples and pumpkins is &lt;code&gt;3&lt;/code&gt; Because they are three orchards apart.&lt;/li&gt;&#xA;&lt;li&gt;The difference between flowers and oranges is &lt;code&gt;1&lt;/code&gt; because they are one orchard apart.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Annotated input/output&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;6 orchards &#xA;&#xA;a none&#xA;&#xA;b apple&#xA;&#xA;c orange pear pear&#xA;&#xA;d none&#xA;&#xA;e orange lemon pumpkin&#xA;&#xA;f pumpkin lettuce flowers peas&#xA;&#xA;--&#xA;&#xA;4 fruits&#xA;&#xA;peas lettuce 0&#xA;&#xA;apple orange 1&#xA;&#xA;apple pumpkin 3&#xA;&#xA;flower orange 1&#xA;&#xA;--&#xA;&#xA;output: [ 0, 1, 3, 1 ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="70765" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-16T18:03:59.350" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12949" PostTypeId="2" ParentId="12831" CreationDate="2017-06-16T18:25:13.097" Score="7" Body="&lt;h1&gt;A question can allow for theoretical solutions, on a case-by-case basis&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;When in doubt, an answer must be runnable. It's ok if it takes an excessive amount of time or memory, as long as it can be tested for smaller values and shown to scale.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a question is ok with assuming that memory is infinite or basic integer types count as arbitrarily large, then they must say so. There can be an exception for challenges that inherently require answers to be unrunnable, like a &quot;longest running terminating program&quot; challenge, but I think the questions you linked should be edited for clarification.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another interesting edge case would be a language implementation that degrades over a long period of time. Would we even know if an esolang interpreter would fail if run for 2^32 seconds? Should it retroactively invalidate answers if we find out later?&lt;/p&gt;&#xA;" OwnerUserId="29974" LastActivityDate="2017-06-16T18:25:13.097" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12950" PostTypeId="1" CreationDate="2017-06-16T19:38:13.273" Score="2" ViewCount="84" Body="&lt;p&gt;I wrote &lt;a href=&quot;https://codegolf.stackexchange.com/questions/126063/macgyvers-toolbox&quot;&gt;a challenge&lt;/a&gt;, I was &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12825/test-a-question&quot;&gt;concerned it would need some fine tuning&lt;/a&gt;, but was not able to get anyone on board to help me test.  So I posted it to the main and it turned out while it was pretty fun it did need a good deal of tuning.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would like to do a improved version of the challenge.  I don't want to modify the old challenge because there are already &lt;em&gt;over 50 answers&lt;/em&gt; on it and a rule change midway through would not be fair to the players.  However the new challenge wouldn't be much different, I would tweak the scoring system and change a couple of numbers in the challenge to make things a bit more difficult along with implementing a number of user suggestions.  It would definitely be solidly in dupe territory.  So what can I do?  Should we make an exception? Should we close the older question as a dupe of the newer one? (I've never seen that done on this site but it does happen on other sites)   &lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-06-16T19:38:13.273" Title="Second iteration of a challenge" Tags="|discussion|duplicates|challenges|" AnswerCount="0" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12953" PostTypeId="2" ParentId="12885" CreationDate="2017-06-16T22:19:28.033" Score="9" Body="&lt;h2&gt;Yes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It's no different then if you just added them as builtins with no inspiration from the OEIS (however unlikely that would be). If your language can use sequences from the OEIS without connecting to the OEIS, there's no reason it would be disallowed.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastActivityDate="2017-06-16T22:19:28.033" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12955" PostTypeId="2" ParentId="2140" CreationDate="2017-06-16T23:39:57.810" Score="0" Body="&lt;h1&gt;Grouped Keyboard Scores&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/3E8fF.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/3E8fF.png&quot; alt=&quot;color board&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the above graphic, one can see 12 distinct color groups, which roughly correspond to columns on a keyboard. The following is a plaintext representation of which characters occur in each group.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Group 1:  ~` \n\t&#xA;Group 2:  !1QqAaZz&#xA;Group 3:  @2WwSsXx&#xA;Group 4:  #3EeDdCc&#xA;Group 5:  $4RrFfVv&#xA;Group 6:  %5TtGgBb&#xA;Group 7:  ^6YyHhNn&#xA;Group 8:  &amp;amp;7UuJjMm&#xA;Group 9:  *8IiKk&amp;lt;,&#xA;Group 10: (9OoLl&amp;gt;.&#xA;Group 11: )0Pp:;?/&#xA;Group 12: _-{[&quot;'+=}]|\&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt; Sort characters in the input according to their position in the aforementioned table. For input &lt;code&gt;&quot;Hello, World!&quot;&lt;/code&gt;, the output would be &lt;code&gt;&quot; !WedrH,llool&quot;&lt;/code&gt;. The relative order of characters within the same group does not matter, so the output &lt;code&gt;&quot; !WderH,llloo&quot;&lt;/code&gt; is just as acceptable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring:&lt;/strong&gt; Let &lt;strong&gt;P&lt;/strong&gt; be the product of the number of characters in each non-empty section. Let &lt;strong&gt;S&lt;/strong&gt; be the number of sections your program uses. Then, your score is &lt;strong&gt;P&lt;/strong&gt; &amp;times; &lt;strong&gt;S&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the program &lt;code&gt;QAZ&lt;/code&gt; would have a score of &lt;code&gt;3&lt;/code&gt;, and &lt;code&gt;QWERTY&lt;/code&gt; would have a score of &lt;code&gt;6&lt;/code&gt;. &lt;code&gt;12321&lt;/code&gt; would have a score of &lt;code&gt;12&lt;/code&gt;. &lt;strong&gt;The lowest such score wins.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is a code snippet for scoring your submission:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;var sections = [&#xD;&#xA;    &quot;`~\t\n &quot;,&#xD;&#xA;    &quot;!1QqAaZz&quot;,&#xD;&#xA;    &quot;@2WwSsXx&quot;,&#xD;&#xA;    &quot;#3EeDdCc&quot;,&#xD;&#xA;    &quot;$4RrFfVv&quot;,&#xD;&#xA;    &quot;%5TtGgBb&quot;,&#xD;&#xA;    &quot;^6YyHhNn&quot;,&#xD;&#xA;    &quot;&amp;amp;7UuJjMm&quot;,&#xD;&#xA;    &quot;*8IiKk&amp;lt;,&quot;,&#xD;&#xA;    &quot;(9OoLl&amp;gt;.&quot;,&#xD;&#xA;    &quot;)0Pp:;?/&quot;,&#xD;&#xA;    &quot;_-{[\&quot;'+=}]|\\&quot;&#xD;&#xA;];&#xD;&#xA;&#xD;&#xA;function getSection(chr){&#xD;&#xA;    for(var i = 0; i &amp;lt; sections.length; i++){&#xD;&#xA;        if(sections[i].indexOf(chr) &amp;gt;= 0){&#xD;&#xA;            return i;&#xD;&#xA;        }&#xD;&#xA;    }&#xD;&#xA;    return -1;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function score(program){&#xD;&#xA;    // group by sections&#xD;&#xA;    var sectionHolder = [];&#xD;&#xA;    var foundSections = [];&#xD;&#xA;    for(var i = 0; i &amp;lt; program.length; i++){&#xD;&#xA;        var chr = program[i];&#xD;&#xA;        var index = getSection(chr);&#xD;&#xA;        if(index &amp;lt; 0)&#xD;&#xA;            return &quot;n/a\nInvalid character: &quot; + chr;&#xD;&#xA;        &#xD;&#xA;        if(!sectionHolder[index])&#xD;&#xA;            sectionHolder[index] = [];&#xD;&#xA;        &#xD;&#xA;        sectionHolder[index].push(chr);&#xD;&#xA;        &#xD;&#xA;        if(foundSections.indexOf(index) &amp;lt; 0)&#xD;&#xA;            foundSections.push(index);&#xD;&#xA;    }&#xD;&#xA;    &#xD;&#xA;    var S = foundSections.length;&#xD;&#xA;    var P = foundSections.map(function(e){&#xD;&#xA;        return sectionHolder[e].length;&#xD;&#xA;    }).reduce(function(a, c){&#xD;&#xA;        return a * c;&#xD;&#xA;    }, 1);;&#xD;&#xA;    &#xD;&#xA;    return S * P;&#xD;&#xA;}&#xD;&#xA;var output, code;&#xD;&#xA;window.addEventListener(&quot;load&quot;, function(){&#xD;&#xA;    output = document.getElementById(&quot;output&quot;);&#xD;&#xA;    code = document.getElementById(&quot;code&quot;);&#xD;&#xA;});&#xD;&#xA;function update(){&#xD;&#xA;    output.innerHTML = &quot;&quot;;&#xD;&#xA;    output.appendChild(document.createTextNode(&#xD;&#xA;        &quot;Score = &quot; + score(code.value)&#xD;&#xA;    ));&#xD;&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-css lang-css prettyprint-override&quot;&gt;&lt;code&gt;* { font-family: Consolas, monospace; }&#xD;&#xA;#output { white-space: pre; }&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;textarea id=&quot;code&quot; oninput=&quot;update();&quot;&amp;gt;&amp;lt;/textarea&amp;gt;&#xD;&#xA;&#xD;&#xA;&amp;lt;div id=&quot;output&quot;&amp;gt;&amp;lt;/div&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Note: &lt;code&gt;␉&lt;/code&gt; represents a tab and &lt;code&gt;␤&lt;/code&gt; represents a newline.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; &quot;input&quot; =&amp;gt; &quot;output&quot;&#xA;&#xA; &quot;Hello, World!&quot; =&amp;gt; &quot; !WedrH,llool&quot;&#xA; &quot;Grouped Keyboard Scoring&quot; =&amp;gt; &quot;  aSededcrrrGbgynuKiooop&quot;&#xA; &quot;QWERTYUIOPqwertyuiop&quot; =&amp;gt; &quot;QqWwEeRrTtYyUuIiOoPp&quot;&#xA; &quot;2017 + 42 = something&quot; =&amp;gt; &quot;    122se4tghn7mio0+=&quot;&#xA; &quot;Tab␉ulator&quot; =&amp;gt; &quot;␉aarTbtulo&quot;&#xA; &quot;Hello␤World&quot; =&amp;gt; &quot;␤WedrHllool&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="31957" LastEditDate="2017-06-19T16:16:59.720" LastActivityDate="2017-06-19T16:16:59.720" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12956" PostTypeId="2" ParentId="7041" CreationDate="2017-06-17T00:08:38.040" Score="18" Body="&lt;p&gt;I increased the limit to 65536 to match Code Review. There's an &lt;a href=&quot;https://meta.stackexchange.com/a/203062/1438&quot;&gt;auto flag&lt;/a&gt; for very long posts, so a moderator will have an opportunity to delete or edit unnecessarily long posts. As a rule, giant posts are not good for a site. But if someone really needs to post extremely long code, they can.  &lt;/p&gt;&#xA;" OwnerUserId="8534" LastActivityDate="2017-06-17T00:08:38.040" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12957" PostTypeId="2" ParentId="2140" CreationDate="2017-06-17T12:07:07.820" Score="0" Body="&lt;h1&gt;Bastion Breach&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Stolen &lt;a href=&quot;https://i.stack.imgur.com/3Ue57.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;with permission&lt;/a&gt; from the minigame with the same title from &lt;a href=&quot;http://store.steampowered.com/app/571880/Angels_with_Scaly_Wings/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Angels with Scaly Wings&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Introduction and rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are two players&lt;/li&gt;&#xA;&lt;li&gt;Both players receive a suit of cards (2-9, ace and face cards) and another is randomly shuffled into a public zone.&lt;/li&gt;&#xA;&lt;li&gt;The players then proceed to choose one of the cards in their hand to bid for the card. Once they've used a card, it can't be used again.&lt;/li&gt;&#xA;&lt;li&gt;The owner of the card with the highest value then gets a point.&lt;/li&gt;&#xA;&lt;li&gt;If the highest scoring card was in the middle or if the value of the highest cards is equal, nobody gets a point. That point then goes onto the next round and is awarded to the winner of that round. &lt;/li&gt;&#xA;&lt;li&gt;The ace is special: it wins against a face card, ties with another ace, and loses against a number card. Effectively the scoring system is reversed for the ace card.&lt;/li&gt;&#xA;&lt;li&gt;The player with the most points at the end of the game wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Input/Output format for bots:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;At the beginning of each round, your bot will be called as a whole program and will receive input in the form &lt;code&gt;cards-in-middle your-played-cards opponents-played-cards&lt;/code&gt; as command line arguments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example: &lt;code&gt;23456789JKQA 24 56&lt;/code&gt; - The cards in the middle are &lt;code&gt;23456789JKQA&lt;/code&gt;, your played cards are &lt;code&gt;24&lt;/code&gt; and your opponents are &lt;code&gt;56&lt;/code&gt;. Your opponent won both of the previous games and what you're bidding for is the card &lt;code&gt;4&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will output a single character representing a card that you haven't already played. If it is invalid or you've already played it, you automatically forfeit the round. Valid outputs are the following characters: &lt;code&gt;23456789JQKA&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example scoring&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Middle card: 2&#xA;Bot 1 card: 4&#xA;Bot 2 card: 5&#xA;Winner: Bot 2&#xA;----&#xA;Middle card: Q&#xA;Bot 1 card: K&#xA;Bot 2 card: 5&#xA;Winner: Bot 1&#xA;----&#xA;Middle card: Q&#xA;Bot 1 card: K&#xA;Bot 2 card: A&#xA;Winner: Bot 2&#xA;----&#xA;Middle card: Q&#xA;Bot 1 card: 6&#xA;Bot 2 card: 5&#xA;Winner: None, next round scores another point&#xA;----&#xA;Middle card: A&#xA;Bot 1 card: 2&#xA;Bot 2 card: J&#xA;Winner: Bot 1&#xA;----&#xA;Middle card: 5&#xA;Bot 1 card: K&#xA;Bot 2 card: 5&#xA;Winner: Bot 1&#xA;----&#xA;Middle card: 5&#xA;Bot 1 card: 2&#xA;Bot 2 card: 5&#xA;Winner: None, next round scores another point&#xA;----&#xA;Middle card: A&#xA;Bot 1 card: 9&#xA;Bot 2 card: J&#xA;Winner: None, next round scores another point&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Scoring for regular cards: &lt;code&gt;23456789JQK&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Scoring for the ace:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;wins: JQK&#xA;draw: A&#xA;lose: 23456789&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Submission&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You should write your entry as&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Bot Name, Language&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Insert&#xA;Code&#xA;Here&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;Explanation/Random stuff here&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Running the tournament yourself&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The controller is available here (Sandbox: Not written yet). It can be ran with &lt;code&gt;python3 controller.py&lt;/code&gt; or &lt;code&gt;python controller.py&lt;/code&gt; depending on your path. It expects all the bots to be in the &lt;code&gt;bots&lt;/code&gt; directory. You can get all the bots already entered with &lt;code&gt;python get_answers.py&lt;/code&gt; or &lt;code&gt;python3 get_answers.py&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Other rules and information&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bots are not allowed to use file storage.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The competition will be &lt;a href=&quot;https://en.wikipedia.org/wiki/Round-robin_tournament&quot; rel=&quot;nofollow noreferrer&quot;&gt;Round Robin&lt;/a&gt;, all bots will play against all others and they will be ranked by the number of other bots they've won against. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A loss counts as nothing&lt;/li&gt;&#xA;&lt;li&gt;A draw counts as one point&lt;/li&gt;&#xA;&lt;li&gt;A win counts as two points&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The bot with the most points wins the game.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;The bot that wins the final game, to be ran on  wins the tournament.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Sandbox notes:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I have yet to create a controller for this though I'll probably be basing it off the one I did for the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/59702/the-cake-cutting-contest&quot;&gt;cake cutting contest&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;I hope I've explained it well enough, it's a simple game and I want the barrier for entry as low as possible. I've tried fixing what I believe went wrong with the GOL challenge and feel that KOTHs work better when they have lots of bots.&lt;/li&gt;&#xA;&lt;li&gt;I have permission to post this from the developer of the game in question, see first line.&lt;/li&gt;&#xA;&lt;li&gt;Feedback on readability is very much appreciated and welcome&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="32686" LastEditorUserId="32686" LastEditDate="2017-07-23T15:43:35.487" LastActivityDate="2017-07-23T15:43:35.487" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12959" PostTypeId="1" CreationDate="2017-06-17T19:05:25.580" Score="21" ViewCount="556" Body="&lt;p&gt;Once in a while, a new user posts an immaculately-written challenge with test cases formatted like&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;1 ≤ m ≤ 10000&#xA;  1 ≤ n ≤ 100&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;SAMPLE INPUT  10 9 8&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;SAMPLE OUTPUT  1&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Maybe they say they're especially interested in Java code that runs quickly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These make me suspect an attempt to cheat at a competition on an external site, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2527/20260&quot;&gt;which is disallowed&lt;/a&gt;. Sometimes it's blatant, but other times I'm unsure. Googling for snippets doesn't find anything and I don't really know what programming contest sites to look at.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Accusing them of cheating seems rude, especially in ambiguous cases -- maybe they just like how a site presents challenges and mimicked their style? And if they deny copying and claim it's original, should I believe them? Is a sense that something's off enough to justify closing and/or flagging?&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2018-04-14T08:19:09.727" Title="Suspecting cheating at competitions" Tags="|discussion|challenges|etiquette|" AnswerCount="2" CommentCount="2" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12960" PostTypeId="2" ParentId="2140" CreationDate="2017-06-17T22:18:41.807" Score="0" Body="&lt;h1&gt;Studio 54&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Studio_54&quot; rel=&quot;nofollow noreferrer&quot;&gt;Studio 54&lt;/a&gt; was a famous nightclub in Manhattan. The club is referenced in the &lt;a href=&quot;https://en.wikipedia.org/wiki/Futurama&quot; rel=&quot;nofollow noreferrer&quot;&gt;Futurama&lt;/a&gt; episode &lt;a href=&quot;https://en.wikipedia.org/wiki/Rebirth_(Futurama)#Cultural_references&quot; rel=&quot;nofollow noreferrer&quot;&gt;Rebirth&lt;/a&gt; in which the crew visits a nightclub called Studio 1&lt;sup&gt;2&lt;/sup&gt;2&lt;sup&gt;1&lt;/sup&gt;3&lt;sup&gt;3&lt;/sup&gt;. The mathematical expression 1&lt;sup&gt;2&lt;/sup&gt;2&lt;sup&gt;1&lt;/sup&gt;3&lt;sup&gt;3&lt;/sup&gt; evaluates to &lt;strong&gt;(1 x 1) x (2) x (3 x 3 x 3) = 1 x 2 x 27 = 54&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Determine whether a positive integer is a &quot;studio number.&quot; We define a studio number to be a number &lt;strong&gt;n&lt;/strong&gt; that can be expressed as the product of a set of distinct positive integers that does not include &lt;strong&gt;n&lt;/strong&gt;, each of which is raised to the power of one of the numbers in the set. Or, more mathematically:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/9Cc5S.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/9Cc5S.png&quot; alt=&quot;Studio Numbers&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should have a consistent output value for &quot;is a studio number&quot; and &quot;is not a studio number,&quot; and nothing else.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;These are inexhaustive lists and are just meant for basic ad-hoc testing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Studio numbers:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4&#xA;12&#xA;16&#xA;18&#xA;52&#xA;54&#xA;64&#xA;68&#xA;72&#xA;88&#xA;96&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Not studio numbers:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;2&#xA;9&#xA;10&#xA;11&#xA;42&#xA;53&#xA;55&#xA;69&#xA;77&#xA;87&#xA;90&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Computed by &lt;a href=&quot;https://tio.run/##bZLBboMwDIbvfQpfJgWG2rJpl0r0uCfYfUpJ2CwFByVmAk17dkZooFA1t9i/f3@O0/T8bel1GCpna0DWjq01HrBurGNotKtbloyW/O6xpLT1BSlKdkpX4NuL1@yFSU47GE9lHSAggZP0pYXRNKbgGfKYnzXXuiBcewqTAa6U4fSojYr6a8/GWdWWvPS0LUMB@dK/C7bm5hLyaQHdFHCaW0chdjVT@IPeOi9o4/ab/z2a52XkIxYEaQr7t/vBsAKCp1FfFHDcTjG67qVSApOHYYLDAWLunhD9p@dWoV0QA1QpSaGSrAPcvIXVMFus@cmWqgTOQFvE0hIjtXpdJ6kXc20tG2FkfVESuqw/QZemfXbjyKYPlCRheJoQwz3QrT/WiuBuz3HsDxcJ4v1dGq@HYEe3NeQZ5MdjNGjctJJs81DJ8A8&quot; rel=&quot;nofollow noreferrer&quot;&gt;this script&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm going off of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12307/31625&quot;&gt;this&lt;/a&gt; for the two consistent outputs, but I'm not really sold either way. I could also change the requirements to be to output the &quot;studio&quot; representation of the number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does the math-y bit help? Could I make the studio number definition clearer?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've been unable to find any &quot;nice&quot; properties of these numbers that allow for methods besides brute force. Would this still be interesting enough to golf? I could also add a &quot;reasonable time&quot; limit that would enforce some non-naive code to reject bad attempts, but I'm not sure that's much better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The studio numbers do not appear to be a sequence recorded on the OEIS.&lt;/p&gt;&#xA;" OwnerUserId="31625" LastEditorUserId="31625" LastEditDate="2017-06-17T22:37:34.553" LastActivityDate="2017-06-17T22:37:34.553" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12963" PostTypeId="1" CreationDate="2017-06-18T07:56:36.573" Score="2" ViewCount="94" Body="&lt;h1&gt;Border cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Why are case limits or border cases never required in questions?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example what to do if some variable overflows in calculations &#xA;or some argument of the function is wrong or it is the wrong type. Why are limits of arguments for a function not discussed? Etc.&lt;/p&gt;&#xA;" OwnerDisplayName="user58988" LastEditorUserId="20283" LastEditDate="2017-06-18T09:25:03.587" LastActivityDate="2017-06-18T11:18:03.657" Title="Why are case limits or border cases never required in questions?" Tags="|discussion|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12964" PostTypeId="2" ParentId="12963" CreationDate="2017-06-18T07:59:30.760" Score="0" Body="&lt;h1&gt;Not all languages can to do it&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It is because if it would request to threat&#xA;error cases their language could not&lt;/p&gt;&#xA;&#xA;&lt;p&gt;or if it is possible their solution will be more character rich than Java C or Axiom...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sono cattivo, vero?&lt;/p&gt;&#xA;" OwnerDisplayName="user58988" LastEditorDisplayName="user58988" LastEditDate="2017-06-18T08:20:35.900" LastActivityDate="2017-06-18T08:20:35.900" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12966" PostTypeId="2" ParentId="12963" CreationDate="2017-06-18T09:15:21.770" Score="2" Body="&lt;p&gt;The immediate reason is &quot;the challenge author does not require it&quot; and that can vary between authors, and even between challenges by the same author.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The underlying reason that many challenge authors do not require error checking or dealing with certain edge cases is that these tasks are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8214/20283&quot;&gt;not relevant to the challenge&lt;/a&gt;. However, this is not always the case, and there are examples in between the extremes. For example, a challenge may require dealing with an input of 1 that requires a different approach, but not an input of 0. The challenge author decides whether dealing with corner cases or overflow would make the challenge more or less interesting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The vast majority of challenges do not require dealing with completely invalid inputs, as that is a separate task that distracts from the challenge and adds unnecessary extra work. Many do require that the code work for a defined range of input values though, while others make a requirement somewhere in between, such as &quot;working in principle&quot; for large values, even if time or memory constraints, or the available data types, prevent this in practice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The requirements of a challenge may also be dictated by the author's desire to allow more languages to be able to compete, but this again varies between authors and challenges, and it is not required that every challenge be approachable by every language. We just avoid excluding languages deliberately.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2017-06-18T09:15:21.770" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12967" PostTypeId="2" ParentId="12963" CreationDate="2017-06-18T11:18:03.657" Score="8" Body="&lt;p&gt;Fundamentally, it's because we want each challenge to be about one thing. &quot;Verify that the input is an integer&quot; might make an interesting challenge in its own right. However, once the shortest way to do it in any given language is known, it doesn't make much sense to copy the code for that into every challenge which takes an integer as input; it'd be boilerplate that distracts from the main problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, not all languages are even capable of determining if input is in the correct form. For example, there are languages in which values are opaque objects that can be &quot;forced&quot; in order to determine properties of them, but the process of forcing can run arbitrary code. (This is quite a large set of languages, running from lazy functional languages (like Haskell) at one extreme, to languages where the only way to read input is to evaluate at another (this covers both practical languages like m4 and esolangs like Underload).) In these languages, an &quot;integer&quot; is something that can be forced to provide typical properties of an integer (such as being positive), and without side effects or nontermination. But there's no way in general to determine that a program will have side effects, and because the object is opaque, you can't deduce anything about it before you try to force it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, there's a conceptual point; typically challenges here on PPCG are for things that could reasonably be used as part of a larger program (our default for challenges is &quot;program or function&quot;, mostly because full programs sometimes have less boilerplate). In such a case, you can assume that the larger program in question would be responsible for the input validation, and thus would pass only validated input to the code that you're writing.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-18T11:18:03.657" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12968" PostTypeId="1" CreationDate="2017-06-18T14:16:23.690" Score="-1" ViewCount="204" Body="&lt;p&gt;&lt;a href=&quot;http://microbit.org/about/&quot; rel=&quot;nofollow noreferrer&quot;&gt;BBC micro:bit&lt;/a&gt; is a piece of hardware wich allows to to run code, such as Python or Javascript, that is custom made for the micro:bit chip. However, it in itself is not a programming language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Instead, it allows people to use 4 different coding languages to manipulate it:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.microbit.co.uk/app/#edit:42fe168e-4d76-4d1f-1228-acd63e75be01&quot; rel=&quot;nofollow noreferrer&quot;&gt;Python, with a custom module, microbit&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.microbit.co.uk/app/#edit:1203bd56-08e7-47d8-873c-66f2a2216f62&quot; rel=&quot;nofollow noreferrer&quot;&gt;JavaScript block editor, similar to Scratch or Google Blockly&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.microbit.co.uk/app/#edit:065a5b6a-9682-4235-c5c9-a94fcdb752a0&quot; rel=&quot;nofollow noreferrer&quot;&gt;Microsoft Block Editor, again similar to Scratch or Google Blockly&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.microbit.co.uk/app/#edit:db3789ed-0d3e-427f-d850-38cce7f842eb:ePZsWsr4wFsA2p2T&quot; rel=&quot;nofollow noreferrer&quot;&gt;Microsoft Touch Developer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Obviously, as all of these languages are Turing complete, they can compete here. So how do we submit solutions in them?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world&quot;&gt;Hello, World!&lt;/a&gt; program can be written in 4 different languages with the BBC micro:bit, all &lt;em&gt;with different scores&lt;/em&gt; and with different code, but that all work the same way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A Python micro:bit answer for Hello, World! would be&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;import microbit&#xA;microbit.display.scroll(&quot;Hello, World!&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which scores &lt;code&gt;56&lt;/code&gt; bytes. However, if I wrote the same program in Microsoft Touch Developer, it would&lt;/p&gt;&#xA;&#xA;&lt;p&gt;a) Use a different encoding, similar to TIBasic&lt;/p&gt;&#xA;&#xA;&lt;p&gt;b) Be shorter, because of this encoding.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is what the program in Microsoft Touch Editor looks like:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/debRI.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/debRI.png&quot; alt=&quot;Microsoft Hello, World! program&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now this brings up a whole separate issue of how to count these bytes but for now, we'll stick with bytes like this&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[script ][a][newline]&#xA;[function main()][newline]&#xA;[tab][basic][-&amp;gt; show string][(][&quot;Hello, World!&quot;][,][1][)][newline]&#xA;[end function]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which comes out as 15 bytes (I'll explain why in the post about counting bytes).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So the competition doesn't become about language tricks, but rather what language you choose to use, which isn't fair.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, what should be do about submissions in BBC micro:bit programs? How should answers in them be formatted/answered?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2017-06-18T15:25:13.250" LastActivityDate="2017-06-18T15:25:13.250" Title="What to do about BBC micro:bit?" Tags="|discussion|answers|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12969" PostTypeId="1" CreationDate="2017-06-18T15:22:56.870" Score="-3" ViewCount="232" Body="&lt;p&gt;&lt;a href=&quot;http://microbit.org/about/&quot; rel=&quot;nofollow noreferrer&quot;&gt;BBC micro:bit&lt;/a&gt; is a piece of hardware wich allows to to run code, such as Python or Javascript, that is custom made for the micro:bit chip. However, it in itself is not a programming language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Instead, it allows people to use 4 different coding languages to manipulate it:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.microbit.co.uk/app/#edit:42fe168e-4d76-4d1f-1228-acd63e75be01&quot; rel=&quot;nofollow noreferrer&quot;&gt;Python, with a custom module, microbit&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.microbit.co.uk/app/#edit:1203bd56-08e7-47d8-873c-66f2a2216f62&quot; rel=&quot;nofollow noreferrer&quot;&gt;JavaScript Block Editor, similar to Scratch or Google Blocks&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.microbit.co.uk/app/#edit:065a5b6a-9682-4235-c5c9-a94fcdb752a0&quot; rel=&quot;nofollow noreferrer&quot;&gt;Microsoft Block Editor, again similar to Scratch or Google Blocks&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.microbit.co.uk/app/#edit:db3789ed-0d3e-427f-d850-38cce7f842eb:ePZsWsr4wFsA2p2T&quot; rel=&quot;nofollow noreferrer&quot;&gt;Microsoft Touch Developer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Obviously, as all of these languages are Turing complete, they can compete here. But how should we count the bytes of their programs?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This will be a long post, so buckle down and get reading.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lets take a look at each language that can be used, and the issues with them.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Python&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Python in micro:bit (also known as &lt;strong&gt;microPython&lt;/strong&gt;), uses a separate, custom module called microbit that has to be imported to be used:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;import microbit&#xA;microbit.display.scroll(&quot;text&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I see three different ways of counting bytes in Python micro:bit&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1) We count bytes as the text in the actual program. So the example above would be 47 bytes long&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2) All Python microbit answers must import is as &lt;code&gt;from microbit import *&lt;/code&gt; as to exclude the &lt;code&gt;microbit.&lt;/code&gt; from it's functions. The &lt;code&gt;import&lt;/code&gt; statement doesn't count as part of the code as it would be like having to import Jelly to run a Jelly program. The above would be changed to &lt;code&gt;display.scroll(&quot;text&quot;)&lt;/code&gt; and would be 22 bytes long.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;3) We count the size of the &lt;code&gt;.hex&lt;/code&gt; file returned by &lt;a href=&quot;https://www.microbit.co.uk/app/#edit:db3789ed-0d3e-427f-d850-38cce7f842eb:ePZsWsr4wFsA2p2T&quot; rel=&quot;nofollow noreferrer&quot;&gt;the website&lt;/a&gt; when you click &quot;Download&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Issues&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;1) It means that a lengthy import call &lt;strong&gt;has&lt;/strong&gt; to made at the start of each program in order for the program to be run successfully&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2) We aren't counting the whole piece of code. The code on its own would be a snippet and wouldn't work.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;3) The &lt;code&gt;.hex&lt;/code&gt; file for the &lt;a href=&quot;https://www.microbit.co.uk/app/#edit:9a9334ad-bd96-4055-2e2c-3b5da3dea298&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hello, World! program&lt;/a&gt; is &lt;strong&gt;597,968&lt;/strong&gt; bytes long! This would automatically disqualify microPython from winning &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and would mean that any basic &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; would be won hands down.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;JavaScript Block Editor&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is close to a combination of JavaScript and Scratch. A Hello, World! program looks like this&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/KLFbv.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/KLFbv.png&quot; alt=&quot;JavaScript example&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The ways that code could be counted here are similar to the Microsoft Touch method.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1) Count the blocks as 1 byte each and user info as 1 byte for each part (&lt;code&gt;&quot;Hello, World!&quot;&lt;/code&gt; =&gt; 15). The above example would be 18 bytes&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2) Count the blocks as 1 byte each and user info as 1 byte for each part, &lt;strong&gt;except the &lt;code&gt;function onStart() {&lt;/code&gt; and its closing brace&lt;/strong&gt;. The above example would be 16 bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;3) Count the size of the &lt;code&gt;.hex&lt;/code&gt; file. Again, this would lead to incredibly high scores.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Microsoft Block Editor&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is quite similar to Scratch and so I think that it should be scored in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/673/66833&quot;&gt;same way&lt;/a&gt;, with one addition.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In Microsoft Block Editor, there is a feature that Scratch doesn't have that turns on various LEDs on this display. The block looks like&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/L6g2B.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/L6g2B.png&quot; alt=&quot;Extra Feature&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe that this should be scored as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1 byte for the block&lt;/li&gt;&#xA;&lt;li&gt;1 byte for every tick in the grid&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The above would score 10 bytes (1 for the block and 9 ticks).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And, as usual, there is the &quot;size of the resulting file&quot; argument, which, as explained before, won't work.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Microsoft Touch Editor&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This seems to work in the same way as TI-Basic, in that chunks of code are stored as tokens. If you check out the &lt;a href=&quot;https://www.microbit.co.uk/app/#edit:db3789ed-0d3e-427f-d850-38cce7f842eb:ePZsWsr4wFsA2p2T&quot; rel=&quot;nofollow noreferrer&quot;&gt;editor&lt;/a&gt; and hover over the tokens, you will notice that it groups things together. A Hello, World! program looks like this&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/L5hHH.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/L5hHH.png&quot; alt=&quot;program&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;which groups the code into tokens. This is what the tokenized code looks like (&lt;code&gt;[]&lt;/code&gt; is a single token, &lt;code&gt;{}&lt;/code&gt; means that each letter in it is a token)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[script]{a}[newline]&#xA;[function main{}][newline]&#xA;[tab][basic][-&amp;gt; show string]{(}[&quot;Hello, World!]{,1)}[newline]&#xA;[end function]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which would result in 15 bytes. However, despite it grouping &lt;code&gt;&quot;Hello, World!&quot;&lt;/code&gt; as 1 token, I believe that it should be split into a byte per character, as it can be edited. Therefore, the final score of this would be 30 bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A different way could be to exclude &lt;code&gt;script&lt;/code&gt;, &lt;code&gt;function main()&lt;/code&gt; and &lt;code&gt;end function&lt;/code&gt; from the scoring as they are unable to be removed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, again, there is the &quot;count the bytes in the file&quot; option that Dennis seems to love. And, again, this won't work because, like the microPython code, it complies into a massive &lt;code&gt;.hex&lt;/code&gt; file, this time &lt;strong&gt;583,482&lt;/strong&gt; bytes long and just isn't an accurate representation of the code.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Conclusion&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is how I believe each version should be scored. If you disagree with me, feel free to post an answer below explaining why we should use your way.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Python: Length of the complete code given to the &lt;a href=&quot;https://www.microbit.co.uk/app/#edit:ebfde595-9b3a-4d72-cef5-2ec6dc70a559&quot; rel=&quot;nofollow noreferrer&quot;&gt;online compiler&lt;/a&gt;, in UTF-8 bytes&lt;/li&gt;&#xA;&lt;li&gt;JavaScript Block Editor: Count the blocks as 1 byte each and user info as 1 byte for each part&lt;/li&gt;&#xA;&lt;li&gt;Microsoft Block Editor: Scored in the same way as Scratch, with the addition.&lt;/li&gt;&#xA;&lt;li&gt;Microsoft Touch Developer: The token grouping they give, with user information counting as 1 byte per part&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And now it is up to you. What do you think?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2017-06-19T08:40:23.810" Title="How do we count bytes in BBC micro:bit languages?" Tags="|discussion|scoring|" AnswerCount="2" CommentCount="6" ClosedDate="2017-06-19T11:02:03.660" ContentLicense="CC BY-SA 3.0" />
  <row Id="12970" PostTypeId="2" ParentId="12968" CreationDate="2017-06-18T15:23:17.823" Score="4" Body="&lt;h1&gt;Use the compiled file size&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;All these different editors compile to a &lt;code&gt;.hex&lt;/code&gt; file. We should use the size of that as a measure of the byte count.&lt;/p&gt;&#xA;" OwnerUserId="26600" LastActivityDate="2017-06-18T15:23:17.823" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12972" PostTypeId="2" ParentId="2140" CreationDate="2017-06-18T16:02:00.450" Score="0" Body="&lt;h1&gt;Only HeLlO WoRLd is allowed.&lt;/h1&gt;&#xA;&lt;p&gt;We are all familiar that &amp;quot;Hello World&amp;quot; is the 1st introductory program that most people learn when they first start to program. Then programmers go on to greater and better programs. But who says they have to go on to greater and better programs? What if all other programs were censored?&lt;/p&gt;&#xA;&lt;h1&gt;Your Task:&lt;/h1&gt;&#xA;&lt;p&gt;Write a computer program that takes in standard input. If the standard input is any &lt;b&gt;case-insensitive&lt;/b&gt; version of HeLlO WoRLd, do nothing. If the Standard input is anything other than a case insensitive HeLlO WoRLd, print an infinite loop of a HELLO WORLD matrix to the standard output.&lt;/p&gt;&#xA;&lt;p&gt;To print an infinite HELLO-WORLD-Matrix, randomly sort the letters of &amp;quot;HELLO&amp;quot; and the letters of &amp;quot;WORLD&amp;quot;, join the two words with a space as if you were saying HELLO WORLD, although you are probably saying  &amp;quot;HELLO DWROL&amp;quot;, &amp;quot; OELLH LWODR&amp;quot; gibberish with an occasional &amp;quot;HELLO WORLD&amp;quot;. Then just keep printing all this gibberish to the standard output.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ELHOL WRDLO     HOELL LDWRO     LOELH DLWRO     EOLHL DRLOW     LHELO OLRWD     &#xA;&#xA;OLELH LODRW     EOHLL LWROD     LLOHE OWDRL     HLLEO OLRWD     LEHOL LOWDR  &#xA;&#xA;OLLHE WROLD     OLEHL DLRWO     OHLEL OWDLR     LLHEO OWDRL     LLEHO ROLWD     &#xA;&#xA;HELOL WLORD     HLOLE LWODR     LHOEL ODLWR     OLEHL DWORL     LLHEO OWDRL     &#xA;&#xA;LHOLE WORDL     LOLHE WLODR     HLLOE WRODL     HOLLE LDORW     EOLHL WODLR  &#xA;&#xA;ELOHL DRWLO     LHELO LRDWO     HLOEL RLDWO     LHOLE DOWLR     OLELH DOLWR     &#xA;&#xA;OLLEH WORLD     LHLOE RWLDO     OELLH LWODR     LEHLO DOLRW     EOHLL DWRLO     &#xA;&#xA;HELLO WORLD     LOLEH ODWRL     HOLLE WDLOR     LHEOL LORWD     LLOHE OLDWR     &#xA;&#xA;OHLLE DRLOW     LOEHL LODWR     OHLLE ODRLW     HOLEL LWDRO     HOLEL DWROL  &#xA;&#xA;ELOLH RWOLD     EOLHL WDLOR     LHOLE WRODL     HLLEO ODLRW     HLELO LDWOR     &#xA;&#xA;HLELO WLDRO     HLLOE DRWLO     HOLEL OLWRD     OELHL WORDL     HOELL LDRWO     &#xA;&#xA;LLEHO WORLD     OLELH DLOWR     OLHEL LDWRO     ELOLH DWROL     EHLLO WDLRO  &#xA;&#xA;OLELH LDROW     LHEOL WORLD     OLEHL LWDRO     OELHL RWLOD     LEOLH RWOLD     &#xA;&#xA;HLOLE DRLOW     LOELH RWLOD     LHELO LODWR     LLOHE LWDRO     LOEHL OWDLR     &#xA;&#xA;LEHOL WORDL     OLEHL RWLDO     LOELH LOWDR     HEOLL LODRW     HLOLE RLODW  &#xA;&#xA;LLEHO DWORL     LLOHE DWOLR     LLHEO RODWL     OLLEH DLWOR     LHEOL ORDWL     &#xA;&#xA;HLEOL OWDRL     LELOH LDROW     HELLO LDWRO     HOELL ODWLR     OEHLL ROWDL     &#xA;&#xA;EHOLL WRLDO     HLOLE WRLDO     LLHEO WDRLO     LOLEH OLDWR     OEHLL RLWDO  &#xA;&#xA;OELHL DLORW     LLHEO RDWOL     HLLOE OLDRW     OLLHE LRODW     OELLH LDROW     &#xA;&#xA;LEHOL LOWDR     LEHLO DRLOW     HOLEL WROLD     LHELO LORWD     EHLLO LWODR     &#xA;&#xA;HLOLE OLRDW     LOLHE OLRWD     LOLHE DORWL     LOHEL WDLRO     OHELL RWOLD  &#xA;&#xA;LEHLO RLWDO     HLEOL LWRDO     OELLH LWORD     HELLO LDROW     OLHLE LWDRO &#xA;&#xA; &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;There is actually only one &amp;quot;HELLO WORLD&amp;quot; amid all this gibberish&lt;/p&gt;&#xA;&lt;p&gt;&lt;b&gt;Winning criterion&lt;/b&gt;: shortest program in bytes.&lt;/p&gt;&#xA;" OwnerUserId="69968" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-18T17:05:32.940" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12973" PostTypeId="2" ParentId="12969" CreationDate="2017-06-18T20:20:24.580" Score="10" Body="&lt;p&gt;The length in bytes of a program is the number of bytes in its source file. If this means that Hello World is 600000 bytes, that's a problem with the language, &lt;strong&gt;not&lt;/strong&gt; with the scoring system. If the language has lots of boilerplate, that's a problem with the language, &lt;strong&gt;not&lt;/strong&gt; with the scoring system.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Although the above is really all that needs to be said (and has been said many times before), I do additionally want to address one remark OP made in a comment:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I just believe that forcing a language to count their score in bytes can punish innovative and interesting languages such as Piet. It seems as though you're encouraging people to make simple text based languages, which is just destroying creativity.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The purpose of PPCG is not to encourage people to make languages of any kind. If people really want to make languages for use on PPCG then that's their privilege, but it is entirely optional and at their own risk. I think the site was at least a couple of years old before the first language was created specifically for it (GolfScript being created before PPCG, and I think by an Anarchy Golf competitor).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But we do need to keep things like scoring systems as simple and consistent as possible. I'm sure I'm not the only person who's fed up with people claiming that their language deserves special treatment. Creativity can be a good thing, but IMO it's a bad thing when it's channelled into coming up with creative reasons for making pointless exceptions to the rules which waste the time of other members of the community who have to argue against them.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-06-18T20:20:24.580" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="12974" PostTypeId="2" ParentId="2140" CreationDate="2017-06-18T20:27:21.307" Score="0" Body="&lt;h1&gt;Golfing a Busy Turing Machine&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/turing-machine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;turing-machine&amp;#39;&quot; rel=&quot;tag&quot;&gt;turing-machine&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/busy-beaver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;busy-beaver&amp;#39;&quot; rel=&quot;tag&quot;&gt;busy-beaver&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;For the sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This question is really hard, and the solution is restricted to one &quot;language&quot; – a 1-tape, 2-symbol Turing Machine. So I'm not sure if it belongs on PPCG. I've written up a basic description below, but can go into more detail if anyone is interested.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Question&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I recently came across a &lt;a href=&quot;https://github.com/adamyedidia/parsimony/blob/master/tex/busybeaver/busybeaver.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;paper&lt;/a&gt; that explicitly presents a 7910-state 1-tape, 2-symbol Turing machine that cannot be proven to run forever in ZFC, assuming ZFC is consistent. It also cites codegolf.stackexchange.com!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The existence of this Turing machine proves that calculating BB(7910) is independent of ZFC.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, we know that we can calculate up to at least BB(4), and definitely can't calculate BB(7910) and above.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can you create a Turing Machine with under 7910 states that cannot be proven to run forever in ZFC?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The author designed two custom-purpose programming languages (Laconic and TMD) to create this Turing Machine. In order to improve upon his work, I imagine you could go one of three ways:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Optimize his algorithm in Laconic such that it encodes the interpreter or Friedman's mathematical statement (section 3.1) more tersely.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Optimize TMD so individual instructions are translated to fewer states.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Find a simpler statement whose truth implies the consistency of ZFC, and encode that instead of Friedman's statement.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Go another direction entirely!&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Winning criteria&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The Turing Machine with the fewest number of states that cannot be proven to run forever in ZFC, wins. The length of the code you used to generate this Turing Machine is irrelevant.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You don't win if you compute BB(5), but you do get eternal fame. &lt;/p&gt;&#xA;" OwnerUserId="66460" LastEditorUserId="66460" LastEditDate="2017-06-18T20:33:48.863" LastActivityDate="2017-06-18T20:33:48.863" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="12975" PostTypeId="2" ParentId="12969" CreationDate="2017-06-18T22:37:04.077" Score="2" Body="&lt;p&gt;For the languages you mention, see Peter Taylor's answer - I agree with all points.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;A new language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I also wanted to add that if you really want to have a shorter representation in bytes for a particular language, you could write your own language that compiles to the target language. You'd write a compiler that takes source code in your new language as input and outputs the standard representation in the language you are targeting. I don't generally see the point in a language that exists solely to produce shorter versions of the code of its parent language, but occasionally a language starts off that way and then goes on to develop interesting features in its own right. I'm sure people here can give several examples if you're interested in seeing how this has happened in the past.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Readability leads to golfability&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It might be particularly useful for the languages you mention since they seem to have such long &quot;source code&quot; that it clearly isn't human readable in its raw form, so it may be difficult to guess whether a particular change will make the source code shorter or longer. One advantage of a new language that takes condensed source code that compiles to the long standard source code is that after getting used to it, it may be nearer to human readable. Even more so if you make this a design consideration.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Golf is not the only sport&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Note that your concerns about destroying creativity only apply to code golf, as the other challenge types do not require unambiguously measurable length of source code. If it is specifically code golf that you wish to compete in, understand that a big part of its success and appeal is that it is trivially simple to score, giving a very low barrier to entry but almost endless opportunity for improvement. Making up an arbitrary &quot;equivalent&quot; scoring mechanism detracts from this simple appeal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that if you implement your desired scoring mechanism in the form of a new language as described, and it meets our site definition of a programming language, then you won't need a meta post to validate the scoring mechanism - you'll just be scoring in bytes like everyone else. If you haven't done this, then the scoring mechanism is arbitrary and will tend to lead to disagreements over the correct score where people have an incentive to interpret the wording to suit their particular answer. A compiler removes that potential for subjectivity and restores the beautiful simplicity of code golf.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2017-06-18T22:37:04.077" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12976" PostTypeId="1" CreationDate="2017-06-18T22:55:16.660" Score="30" ViewCount="1340" Body="&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/message/38207618#38207618&quot;&gt;Prompted by this.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We already know &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/6918/43319&quot;&gt;which languages were created by PPCG users&lt;/a&gt;. Clearly language authors are inspired by each other and by existing practical languages. What are these relationships?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Looking for something like &lt;a href=&quot;https://ccrma.stanford.edu/courses/250a-fall-2005/docs/ComputerLanguagesChart.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2017-06-18T23:22:12.387" LastActivityDate="2019-12-30T14:03:55.637" Title="What are the relationships between programming languages created by PPCG users" Tags="|discussion|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="12978" PostTypeId="2" ParentId="12976" CreationDate="2017-06-18T22:58:45.343" Score="31" Body="&lt;p&gt;Using the format of &lt;a href=&quot;http://www.webgraphviz.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Webgraphviz&lt;/a&gt;. Links to pages about the languages can be found on &lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# non-PPCG languages are lightgrey, non-languages are white&#xA;# PPCG languages are not colored for simplicity&#xA;# this has the effect of making PPCG be languages with a border&#xA;digraph PPCGGenealogy {&#xA;  nodesep=0.5&#xA;  ranksep=1.5&#xA;  node [style=filled]&#xA;  rankdir=LR&#xA;  &quot;;#&quot; -&amp;gt; &quot;;#+&quot;&#xA;  &quot;;#&quot; -&amp;gt; Commentator&#xA;  &quot;///&quot; -&amp;gt; ReRegex&#xA;  &quot;05AB1E&quot; -&amp;gt; &quot;2sable&quot;&#xA;  &quot;05AB1E&quot; -&amp;gt; Anyfix&#xA;  &quot;05AB1E&quot; -&amp;gt; Oasis&#xA;  &quot;05AB1E&quot; -&amp;gt; Ohm&#xA;  &quot;05AB1E&quot; -&amp;gt; SOGL&#xA;  &quot;&amp;gt;&amp;lt;&amp;gt;&quot; -&amp;gt; Jellyfish&#xA;  &quot;&amp;gt;&amp;lt;&amp;gt;&quot; -&amp;gt; Klein&#xA;  &quot;&amp;gt;&amp;lt;&amp;gt;&quot; -&amp;gt; Minkolang&#xA;  &quot;&amp;gt;&amp;lt;&amp;gt;&quot; -&amp;gt; Vitsy&#xA;  &quot;&amp;gt;&amp;lt;&amp;gt;&quot; -&amp;gt; Keg&#xA;  APL -&amp;gt; &quot;Dyalog APL&quot;&#xA;  APL -&amp;gt; J&#xA;  APL -&amp;gt; K&#xA;  APL -&amp;gt; MATLAB&#xA;  APL -&amp;gt; Mathematica&#xA;  Assembly -&amp;gt; Sesos&#xA;  Assembly -&amp;gt; Speedcoding&#xA;  Assembly -&amp;gt; QFTASM&#xA;  Attache -&amp;gt; Tidy&#xA;  Axo -&amp;gt; Alice&#xA;  Basic -&amp;gt; &quot;S.I.L.O.S&quot;&#xA;  Befunge -&amp;gt; &quot;&amp;gt;&amp;lt;&amp;gt;&quot;&#xA;  Befunge -&amp;gt; Alice&#xA;  Befunge -&amp;gt; Hexagony&#xA;  Befunge -&amp;gt; Minkolang&#xA;  Befunge -&amp;gt; TacO&#xA;  Befunge -&amp;gt; Vitsy&#xA;  &quot;Bourne Shell&quot; -&amp;gt; &quot;Röda&quot;&#xA;  BrainFlak -&amp;gt; &quot;fλak&quot;&#xA;  BrainFlak -&amp;gt; BrainFlueue&#xA;  BrainFlak -&amp;gt; FlakCats&#xA;  BrainFlak -&amp;gt; Klein&#xA;  BrainFlak -&amp;gt; Miniflak&#xA;  BrainFlak -&amp;gt; PainFlak&#xA;  BrainFlak -&amp;gt; &quot;Sad-Flak&quot;&#xA;  BrainFlakClassic -&amp;gt; BrainFlak&#xA;  Brainfuck -&amp;gt; &quot;Brian &amp;amp; Chuck&quot;&#xA;  Brainfuck -&amp;gt; &quot;Turtlèd&quot;&#xA;  Brainfuck -&amp;gt; BrainFlakClassic&#xA;  Brainfuck -&amp;gt; Fourier&#xA;  Brainfuck -&amp;gt; MarioLANG&#xA;  Brainfuck -&amp;gt; Numberwang&#xA;  Brainfuck -&amp;gt; Sesos&#xA;  Brainfuck -&amp;gt; Vitsy&#xA;  Brainfuck -&amp;gt; ezFuck&#xA;  Brainfuck -&amp;gt; RoboCritters&#xA;  Brainfuck -&amp;gt; Flipbit&#xA;  Brainfuck -&amp;gt; Commentator&#xA;  Brainfuck -&amp;gt; &quot;Bitwise Fuckery&quot;&#xA;  Bubblegum -&amp;gt; &quot;Cinnamon-Gum&quot;&#xA;  C -&amp;gt; Java&#xA;  C -&amp;gt; Mathematica&#xA;  C -&amp;gt; Perl&#xA;  C -&amp;gt; Preproc&#xA;  C -&amp;gt; Python&#xA;  C -&amp;gt; Swift&#xA;  C -&amp;gt; shortC&#xA;  C -&amp;gt; COGOL&#xA;  Charcoal -&amp;gt; Canvas&#xA;  CJam -&amp;gt; Gaia&#xA;  CJam -&amp;gt; Noether&#xA;  CJam -&amp;gt; RProgN&#xA;  CJam -&amp;gt; TacO&#xA;  CJam -&amp;gt; Orst&#xA;  COGOL -&amp;gt; &quot;QFTASM-lang&quot;&#xA;  compression -&amp;gt; Bubblegum&#xA;  &quot;Conways Game of Life&quot; -&amp;gt; QFTASM&#xA;  &quot;Conways Game of Life&quot; -&amp;gt; COGOL&#xA;  &quot;Conways Game of Life&quot; -&amp;gt; &quot;QFTASM-lang&quot;&#xA;  Deorst -&amp;gt; Orst&#xA;  &quot;Dyalog APL&quot; -&amp;gt; RAD&#xA;  &quot;Dyalog APL&quot; -&amp;gt; &quot;QuadR&quot;&#xA;  &quot;Dyalog APL&quot; -&amp;gt; &quot;QuadS&quot;&#xA;  &quot;Dyalog APL&quot; -&amp;gt; &quot;Stencil&quot;&#xA;  Fourier -&amp;gt; Noether&#xA;  &quot;Fuzzy-Octo-Guacamole&quot; -&amp;gt; Loopy&#xA;  GolfScript -&amp;gt; CJam&#xA;  GolfScript -&amp;gt; GS2&#xA;  GolfScript -&amp;gt; Noether&#xA;  GolfScript -&amp;gt; O&#xA;  GolfScript -&amp;gt; Sclipting&#xA;  GolfScript -&amp;gt; Orst&#xA;  Haskell -&amp;gt; Husk&#xA;  Haskell -&amp;gt; Rutger&#xA;  Hexagony -&amp;gt; Cubix&#xA;  Hexagony -&amp;gt; Klein&#xA;  Hexagony -&amp;gt; Triangular&#xA;  J -&amp;gt; &quot;Dyalog APL&quot;&#xA;  J -&amp;gt; &quot;J-uby&quot;&#xA;  J -&amp;gt; GS2&#xA;  J -&amp;gt; I&#xA;  J -&amp;gt; Jelly&#xA;  J -&amp;gt; Jellyfish&#xA;  J -&amp;gt; Joe&#xA;  J -&amp;gt; M&#xA;  Japt -&amp;gt; Jolf&#xA;  Java -&amp;gt; Glava&#xA;  Java -&amp;gt; Python&#xA;  Java -&amp;gt; ReRegex&#xA;  Java -&amp;gt; Verbosity&#xA;  JavaScript -&amp;gt; Bean&#xA;  JavaScript -&amp;gt; Cheddar&#xA;  JavaScript -&amp;gt; Japt&#xA;  JavaScript -&amp;gt; Jolf&#xA;  JavaScript -&amp;gt; TeaScript&#xA;  Jelly -&amp;gt; Anyfix&#xA;  Jelly -&amp;gt; Gaia&#xA;  Jelly -&amp;gt; Jellyfish&#xA;  Jelly -&amp;gt; M&#xA;  Jelly -&amp;gt; Ohm&#xA;  Jelly -&amp;gt; RAD&#xA;  Jelly -&amp;gt; Seriously&#xA;  Jelly -&amp;gt; TacO&#xA;  K -&amp;gt; O&#xA;  K -&amp;gt; RAD&#xA;  Klein -&amp;gt; Lost&#xA;  Labyrinth -&amp;gt; Cubix&#xA;  &quot;lambda calculus&quot; -&amp;gt; Haskell&#xA;  &quot;lambda calculus&quot; -&amp;gt; Unlambda&#xA;  &quot;lambda calculus&quot; -&amp;gt; fλak&#xA;  Lua -&amp;gt; JavaScript&#xA;  Lua -&amp;gt; RProgN&#xA;  logic -&amp;gt; Stackylogic&#xA;  &quot;mathematical notation&quot; -&amp;gt; APL&#xA;  &quot;mathematical notation&quot; -&amp;gt; Brachylog&#xA;  MATLAB -&amp;gt; MATL&#xA;  MATLAB -&amp;gt; Octave&#xA;  MATLAB -&amp;gt; Tidy&#xA;  Mathematica -&amp;gt; Attache&#xA;  Mathematica -&amp;gt; Mthmtca&#xA;  O -&amp;gt; Jolf&#xA;  Octave -&amp;gt; MATL&#xA;  Ohm -&amp;gt; Gaia&#xA;  Orst -&amp;gt; Geo&#xA;  PCRE -&amp;gt; &quot;Dyalog APL&quot;&#xA;  PCRE -&amp;gt; Grime&#xA;  PCRE -&amp;gt; ReRegex&#xA;  PCRE -&amp;gt; Retina&#xA;  Perl -&amp;gt; &quot;A Pear Tree&quot;&#xA;  Perl -&amp;gt; Element&#xA;  Perl -&amp;gt; JavaScript&#xA;  Perl -&amp;gt; PCRE&#xA;  Perl -&amp;gt; Python&#xA;  Perl -&amp;gt; Ruby&#xA;  Perl -&amp;gt; &quot;Röda&quot;&#xA;  Prindeal -&amp;gt; Addict&#xA;  Prindeal -&amp;gt; Shtriped&#xA;  Prolog -&amp;gt; Brachylog&#xA;  Prolog -&amp;gt; Mathematica&#xA;  Pyth -&amp;gt; Jolf&#xA;  Pyth -&amp;gt; O&#xA;  Pyth -&amp;gt; Pyke&#xA;  Python -&amp;gt; &quot;A Pear Tree&quot;&#xA;  Python -&amp;gt; Bubblegum&#xA;  Python -&amp;gt; JavaScript&#xA;  Python -&amp;gt; Oasis&#xA;  Python -&amp;gt; Pyke&#xA;  Python -&amp;gt; Pylons&#xA;  Python -&amp;gt; Pyth&#xA;  Python -&amp;gt; Ruby&#xA;  Python -&amp;gt; &quot;QFTASM-lang&quot;&#xA;  Python -&amp;gt; Tidy&#xA;  QFTASM -&amp;gt; COGOL&#xA;  Basic -&amp;gt; QBIC&#xA;  R -&amp;gt; Tidy&#xA;  RISC -&amp;gt; Prindeal&#xA;  RISC -&amp;gt; Shtriped&#xA;  RISC -&amp;gt; &quot;99&quot;&#xA;  RISC -&amp;gt; QFTASM&#xA;  Retina -&amp;gt; Grime&#xA;  Retina -&amp;gt; ReRegex&#xA;  Ruby -&amp;gt; &quot;J-uby&quot;&#xA;  Ruby -&amp;gt; Cheddar&#xA;  Ruby -&amp;gt; Wren&#xA;  Scheme -&amp;gt; &quot;Pyramid Scheme&quot;&#xA;  Scheme -&amp;gt; JavaScript&#xA;  Scheme -&amp;gt; K&#xA;  Scheme -&amp;gt; Lua&#xA;  Scheme -&amp;gt; R&#xA;  Seriously -&amp;gt; Actually&#xA;  ShapeScript -&amp;gt; Changeling&#xA;  Shtriped -&amp;gt; &quot;$htriped&quot;&#xA;  SOGL -&amp;gt; Gaia&#xA;  SOGL -&amp;gt; Canvas&#xA;  Stackcats -&amp;gt; FlakCats&#xA;  Speedcoding -&amp;gt; Basic&#xA;  Speedcoding -&amp;gt; C&#xA;  Surface -&amp;gt; Triangular&#xA;  Swift -&amp;gt; Cheddar&#xA;  V -&amp;gt; &quot;Turtlèd&quot;&#xA;  Verbosity -&amp;gt; Rutger&#xA;  Vim -&amp;gt; &quot;Turtlèd&quot;&#xA;  Vim -&amp;gt; V&#xA;  &quot;Whispers v1&quot; -&amp;gt; No&#xA;  &quot;Whispers v1&quot; -&amp;gt; Uno&#xA;  &quot;Whispers v1&quot; -&amp;gt; &quot;Whispers v2&quot;&#xA;  &quot;Whispers v2&quot; -&amp;gt; No&#xA;  &quot;Whispers v2&quot; -&amp;gt; Uno&#xA;  No -&amp;gt; Uno&#xA;  Uno -&amp;gt; No&#xA;  Woefully -&amp;gt; &quot;Sad-Flak&quot;&#xA;  Wren -&amp;gt; W&#xA;&#xA;  &quot;///&quot; [color=lightgrey]&#xA;  &quot;&amp;gt;&amp;lt;&amp;gt;&quot; [color=lightgrey]&#xA;  APL [color=lightgrey]&#xA;  Assembly [color=white]&#xA;  Axo [color=lightgrey]&#xA;  Basic [color=lightgrey]&#xA;  Befunge [color=lightgrey]&#xA;  &quot;Bourne Shell&quot; [color=lightgrey]&#xA;  Brainfuck [color=lightgrey]&#xA;  C [color=lightgrey]&#xA;  compression [color=white]&#xA;  &quot;Conways Game of Life&quot; [color=white]&#xA;  Haskell [color=lightgrey]&#xA;  J [color=lightgrey]&#xA;  Java [color=lightgrey]&#xA;  JavaScript [color=lightgrey]&#xA;  K [color=lightgrey]&#xA;  &quot;lambda calculus&quot; [color=white]&#xA;  logic [color=white]&#xA;  Lua [color=lightgrey]&#xA;  MATLAB [color=lightgrey]&#xA;  Mathematica [color=lightgrey]&#xA;  &quot;mathematical notation&quot; [color=white]&#xA;  Octave [color=lightgrey]&#xA;  Ohm [color=lightgrey]&#xA;  PCRE [color=white]&#xA;  Perl [color=lightgrey]&#xA;  Prolog [color=lightgrey]&#xA;  Python [color=lightgrey]&#xA;  R [color=lightgrey]&#xA;  RISC [color=white]&#xA;  Ruby [color=lightgrey]&#xA;  Scheme [color=lightgrey]&#xA;  Speedcoding [color=lightgrey]&#xA;  Surface [color=lightgrey]&#xA;  Swift [color=lightgrey]&#xA;  Vim [color=lightgrey]&#xA;  Wren [color=lightgrey]&#xA;}&#xA;# this comment somehow removes errors&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As of 2018-09-05 @ 1:59 (UTC):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/A96d1.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/A96d1.png&quot; alt=&quot;language graph&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorDisplayName="user85052" LastEditDate="2019-12-30T14:03:55.637" LastActivityDate="2019-12-30T14:03:55.637" CommentCount="10" CommunityOwnedDate="2017-06-18T22:58:45.343" ContentLicense="CC BY-SA 4.0" />
  <row Id="12980" PostTypeId="1" CreationDate="2017-06-19T07:05:55.937" Score="4" ViewCount="270" Body="&lt;p&gt;The question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/18028/largest-number-printable&quot;&gt;largest number printable&lt;/a&gt; is broken in many ways: it has a huge number of source restrictions and a strange scoring function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Many of the other largest number challenges are like this in one way or another.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I was wondering if we should create a canonical question that fits the modern conventions of this site: perhaps just &quot;output the largest number possible within 100 bytes&quot; with no constraints beyond standard loopholes.&lt;/p&gt;&#xA;" OwnerUserId="39129" LastActivityDate="2017-06-23T06:24:40.103" Title="Is there a decent &quot;largest number&quot; question on the site?" Tags="|discussion|" AnswerCount="3" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="12981" PostTypeId="2" ParentId="2140" CreationDate="2017-06-19T07:37:40.353" Score="0" Body="&lt;h1&gt;Write an interpreter for XKCD's broken language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a good idea?&lt;/li&gt;&#xA;&lt;li&gt;Is the point system good?&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If so, are the point values good? I based them off of how difficult I imaged each part to be.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Overview&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Randall Munroe, author of the webcomic XKCD, posted a comic a while back about a joke programming language and how it gets types confused.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://xkcd.com/1537/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here's the comic in question&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your job is to write an interpreter for a slightly modified version of this language.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If your language supports it, it must be a live interpreter where all input lines start with &lt;code&gt;[#]&amp;gt;&lt;/code&gt; (where # is the line number) and all outputs must start with &lt;code&gt;=&amp;gt;&lt;/code&gt;.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If your language does not support it, you may substitute this with reading all the lines on the input and printing out each output on its own line, still starting with &lt;code&gt;=&amp;gt;&lt;/code&gt;. Remember to keep track of line numbers.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;All commands must be usable in any order and with any parameters (within reason)&lt;/li&gt;&#xA;&lt;li&gt;Each command you implement correctly is worth the listed point value. See scoring to find your final score.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Integers plus numeric strings (1 point)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given an int and a string containing a number (in that order) calculate the numeric sum of them, then return the result as a string with quotes surrounding it.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1]&amp;gt; 2 + &quot;2&quot;&#xA;=&amp;gt; &quot;4&quot;&#xA;[2]&amp;gt; 6 + &quot;13&quot;&#xA;=&amp;gt; &quot;19&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Numeric strings plus lists (1 point)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given a numeric string and a list, append the numeric value to the list and return the list as a string.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1]&amp;gt; &quot;3&quot; + []&#xA;=&amp;gt; &quot;[3]&quot;&#xA;[2]&amp;gt; &quot;7&quot; + [1,4]&#xA;=&amp;gt; &quot;[1,4,7]&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Dividing by zero (1 point)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Any number divided by zero returns a NaN object. This does not have quotes around it.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1]&amp;gt; 1/0&#xA;=&amp;gt; NaN&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;NaN plus integer (2 points)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given a NaN object and an integer, pretend it's a string and increment the leading character, carrying over if needed. The result does not have quotes.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1]&amp;gt; (5/0)+2&#xA;=&amp;gt; NaP&#xA;[2]&amp;gt; NaN+256&#xA;=&amp;gt; NbN&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You do not need to use ASCII for this, any character set works, as long as it includes at minimum the 52 uppercase and lowercase letters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will never have to add a result from this to another integer. (For example, &lt;code&gt;NaP+4&lt;/code&gt; is invalid)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;String plus string (1 point)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given two strings, remove swap the first and last quotes with single quotes and return the result.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1]&amp;gt; &quot;&quot;+&quot;&quot;&#xA;=&amp;gt; '&quot;+&quot;'&#xA;[2]&amp;gt; &quot;Hello&quot;+&quot;world&quot;&#xA;=&amp;gt; 'Hello&quot;+&quot;world'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;List of integers plus integer (3 points)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given a list of integers (or an empty list) and another integer, return True or False based on whether the new integer matches the linear pattern.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It will follow this rule:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the list has 0 or 1 items, return True regardless (everything matches).&lt;br&gt;&#xA;Determine the pattern of the list by subtracting every item by the item right before it. If the pattern is inconsistent, return False regardless (nothing matches).&lt;br&gt;&#xA;Otherwise, check if the new integer matches the pattern. If it does, return True. If it doesn't, return False.  &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1]&amp;gt; [1, 2, 3, 4] + 5&#xA;=&amp;gt; True&#xA;[2]&amp;gt; [5, 7, 9, 11] + 13&#xA;=&amp;gt; True&#xA;[3]&amp;gt; [6, 5, 4, 3] + 2&#xA;=&amp;gt; True&#xA;[4]&amp;gt; [2, 4, 6, 8] + 9&#xA;=&amp;gt; False&#xA;[5]&amp;gt; [1, 2, 1, 4] + 5&#xA;=&amp;gt; False&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Range(a, b) (1 point)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;With the Range function given two numbers, return a list of numbers from a to b.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1]&amp;gt; Range(1, 5)&#xA;=&amp;gt; [1, 2, 3, 4, 5]&#xA;[2]&amp;gt; Range(3, 6)&#xA;=&amp;gt; [3, 4, 5, 6]&#xA;[3]&amp;gt; Range(6, 4)&#xA;=&amp;gt; [6, 5, 4]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Plus integer (1 point)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given simply &quot;+&quot; and an integer, return the line number plus the integer.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1]&amp;gt; +2&#xA;=&amp;gt; 3&#xA;[2]&amp;gt; +2&#xA;=&amp;gt; 4&#xA;[3]&amp;gt; +1&#xA;=&amp;gt; 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Single digit plus single digit (2 points)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given two single digit integers &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt;, replace all future instances of &lt;code&gt;a&lt;/code&gt; in the output with &lt;code&gt;(a+b)%10&lt;/code&gt; (where % means modulo, essentially wrap around if the result is more than 1 digit). Return Done. This effect is superficial and has no effect on math. This only affects output, not input.  &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1]&amp;gt; 3+2&#xA;=&amp;gt; Done&#xA;[2]&amp;gt; Range(1, 6)&#xA;=&amp;gt; [1, 2, 5, 4, 5, 6]&#xA;[5]&amp;gt; 1+2&#xA;=&amp;gt; Done&#xA;[4]&amp;gt; Range(1, 6)&#xA;=&amp;gt; [3, 2, 5, 4, 5, 6]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Floor (1 point)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Draw an ascii art floor with the number at the bottom. The specifications are 3 lines of only pipes, then a line with a pipe, 3 underscores, the number, and 3 underscores.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1]&amp;gt; Floor(4.7)&#xA;=&amp;gt; |&#xA;=&amp;gt; |&#xA;=&amp;gt; |&#xA;=&amp;gt; |___4.7___&#xA;[2]&amp;gt; Floor(105.3)&#xA;=&amp;gt; |&#xA;=&amp;gt; |&#xA;=&amp;gt; |&#xA;=&amp;gt; |___105.3___&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Add up the points you've earned. Your score is now calculated as &lt;code&gt;(15-points) * bytecount&lt;/code&gt;. Lower is better.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You do not have to account for mixing functions. For example, &lt;code&gt;Range(Floor(2.3))&lt;/code&gt; is invalid.&lt;/li&gt;&#xA;&lt;li&gt;Whitespace may be added or removed as is convenient.&lt;/li&gt;&#xA;&lt;li&gt;Double quotes or single quotes may be used as convenient (as long as you use the opposite for &quot;String plus string&quot;)&lt;/li&gt;&#xA;&lt;li&gt;Any brackets may be used for lists, as long as it's consistent.&lt;/li&gt;&#xA;&lt;li&gt;A few commands were omitted from the original comic because I couldn't figure out a way to make it well specified.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="39213" LastEditorUserId="39213" LastEditDate="2017-06-20T04:28:02.590" LastActivityDate="2017-06-20T04:28:02.590" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12984" PostTypeId="1" CreationDate="2017-06-19T10:34:10.347" Score="0" ViewCount="57" Body="&lt;p&gt;Whenever I visit any page here on PPCG meta, to the left of the &quot;review&quot; link, is a small brown rectangle with a white number 4 on it, and hovering it says &quot;4 total posts awaiting review&quot;. The link goes to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/review&quot;&gt;https://codegolf.meta.stackexchange.com/review&lt;/a&gt;, but there aren't any Meta reviews currently available. (It was showing a 3 earlier and has recently changed to 4; this is all new within the past few hours.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I remember seeing this in the past on the main PPCG site, but only very rarely; IIRC, the usual cause was a suggested edit on one of my own posts. I know it definitely doesn't come up for Meta reviews in the usual case (I've done Meta reviews before without seeing it).&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-19T10:34:10.347" Title="Why am I getting a &quot;4 total posts awaiting review&quot; link on PPCG Meta?" Tags="|support|meta|reviewing|" AnswerCount="0" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="12985" PostTypeId="2" ParentId="1181" CreationDate="2017-06-19T10:57:25.293" Score="1" Body="&lt;h1&gt;Recommend deletion if the post should be deleted under PPCG or Stack Exchange rules; otherwise say &quot;Looks OK&quot;; &lt;em&gt;never&lt;/em&gt; edit it&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This includes situations where:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An answer &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990/62131&quot;&gt;intentionally breaks the rules, or accidentally breaks the rules and was not fixed within a reasonable length of time of the problem being pointed out&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;An answer is not of the form expected as an answer to the question (e.g. a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; post is answered with a complaint about the specification); note that in this case, you'll probably want to pick a canned reason from the list of recommended deletion reasons, e.g. &quot;this should be a comment&quot;&lt;/li&gt;&#xA;&lt;li&gt;A post obviously contains subject matter that's explicitly offtopic for the site (such as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1517/62131&quot;&gt;a [tag:code-trolling] question&lt;/a&gt;); note that in borderline cases, voting to close is OK, but voting to delete is something that needs more care&lt;/li&gt;&#xA;&lt;li&gt;A question is completely unsalveageable and will clearly never be edited into a viable challenge (or non-challenge post)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Note that if the post is &lt;em&gt;so&lt;/em&gt; bad that it would be instantly deleteable on any Stack Exchange site (i.e. it's spam in the sense of &quot;advertising an external site without disclosing your affiliation&quot;, or offensive/rude/keyboard mashing), you should place a &quot;red flag&quot; on the post (flag → &quot;spam&quot; or &quot;rude/abusive&quot; respectively), in addition to recommending deletion. There's more than one sort of deletion available, and it's important to make sure that the post is correctly characterised as being in moderately good faith or as being outright abusive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In any situation where the post doesn't fit into the above categories of things that should be deleted, say &quot;Looks OK&quot; to clear it from the queue. The Low Quality Posts queue is really buggy and you want to move posts out of it as quickly as possible. (Note that there's an autoflagging bot in the Stack Exchange software which casts a lot of dubious &quot;low quality (auto)&quot; flags, which feed into the Low Quality Posts queue.) In particular, never edit a post from the queue, no matter how much editing would improve it, as this triggers &lt;a href=&quot;https://meta.stackexchange.com/q/276269/347902&quot;&gt;one of the worst bugs on Stack Exchange&lt;/a&gt;; instead, wait for the review to be completed, and then you can edit the post safely.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-19T10:57:25.293" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="12986" PostTypeId="2" ParentId="576" CreationDate="2017-06-19T11:16:26.503" Score="2" Body="&lt;p&gt;The maximum length &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12956/62131&quot;&gt;was recently increased&lt;/a&gt;. It's now 65536 characters, which should be long enough to post quite a substantial amount of code.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-19T11:16:26.503" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12987" PostTypeId="1" CreationDate="2017-06-19T13:25:38.077" Score="8" ViewCount="340" Body="&lt;p&gt;Although we have consensus on the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7987/definitive-policy-about-answers-not-meeting-the-challenge-specification&quot;&gt;Definitive policy about answers not meeting the challenge specification&lt;/a&gt;, it is aimed at answers rather than challenges. I had assumed that would imply that a challenge should avoid inviting non-competing answers, but there doesn't seem to be anything on meta to make that explicit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should a &lt;strong&gt;&lt;em&gt;challenge author&lt;/em&gt;&lt;/strong&gt; be free to allow certain types of non-competing answer that would be excluded in general?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/127103/lcm-of-rational-numbers&quot;&gt;LCM of Rational Numbers&lt;/a&gt; has a rule against certain builtins but still invites them to be posted:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Submissions that would feed rational numbers to an LCM/GCD builtin are allowed, but non-competing.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2017-06-19T20:05:21.220" LastActivityDate="2017-06-21T12:31:05.673" Title="Challenges that invite non-competing answers" Tags="|discussion|asking-questions|" AnswerCount="4" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12989" PostTypeId="2" ParentId="12987" CreationDate="2017-06-19T14:03:53.377" Score="8" Body="&lt;h1&gt;Allow authors to mark some answers non-competing&lt;/h1&gt;&#xA;&lt;p&gt;It may be interesting to see answers that could potentially break the challenge (e.g. built-ins). However, answers that have been banned per meta consensus should not be posted, and answers that are not banned should be competing unless the question's rules state otherwise.&lt;/p&gt;&#xA;&lt;p&gt;That is, the non-competing status should only apply to the &amp;quot;new languages,&amp;quot; unless the challenge defines what &amp;quot;non-competing&amp;quot; means.&lt;/p&gt;&#xA;&lt;p&gt;The non-competing status may make some challenges more interesting. Using the link in the question as an example, the challenge would seem trivial and boring at first glance without the distinction between competing and non-competing answers, as it contains quite a few submissions with built-ins. However, that is not the case, since the question is nontrivial in many languages.&lt;/p&gt;&#xA;&lt;p&gt;Including the rule that some solutions are non-competing would signify that the challenge author is still interested in lengthy, nontrivial solutions. Personally, I think &amp;quot;non-competing&amp;quot; should be a stronger form of &amp;quot;allowed but discouraged.&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;The non-competing status could also serve as a gray-area, in which people could post interesting and nontrivial answers, without the challenge author having to ban them for fairness. I have seen questions (e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/q/125824/60043&quot;&gt;this&lt;/a&gt;) that explicitly disallow certain types of functions, but the banned solutions were still interesting. Allowing non-competing solutions would prevent those answers from never being posted, without losing any &amp;quot;fairness.&amp;quot;&lt;/p&gt;&#xA;" OwnerUserId="60043" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-21T12:31:05.673" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="12996" PostTypeId="2" ParentId="12987" CreationDate="2017-06-19T18:37:20.163" Score="1" Body="&lt;h2&gt;Do not allow more &quot;non-competing&quot; answer types&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Non-competing answers generally exist, in my opinion, because of a bad rule. Take the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12877/31625&quot;&gt;(since changed)&lt;/a&gt; &quot;newer language than the challenge&quot; non-competing answers as an example. These answers are good and made fully in the spirit of the site and its competitions, but needed this odd marking to indicate that they may have cheated. While I believe the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1071/31625&quot;&gt;rule&lt;/a&gt; banning languages/features that were designed specifically for the challenge is necessary to prevent abuse, the cases of abuse are clearly distinguishable from those of non-abuse. However, the cost of the &quot;non-competing&quot; tag used to show good intentions is many new users thinking that they can post whatever they want if they put some magic words in the title.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For challenges, this works out to the same problem. Visibly non-competitive answers are detrimental to the site. A challenge should either ban something, or not ban it. If it is not banned, people can still post an answer that does not use the banned features. That is the type of participation that we should be fostering.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Banning something, but then saying you can post it, you just can't &quot;win&quot; contributes to the notion that our site is only about winning, and winning the inter-language competition. Our site is about interesting programming challenges, such as golfing. I don't think anyone thinks it is particularly interesting to post single token answers, so if you don't ban them people will still come up with interesting answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe the general solution with respect to the case mentioned is to stop upvoting trivial answers, not to ban but not actually ban them.&lt;/p&gt;&#xA;" OwnerUserId="31625" LastEditorUserId="31625" LastEditDate="2017-06-19T20:46:34.343" LastActivityDate="2017-06-19T20:46:34.343" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="12997" PostTypeId="2" ParentId="2140" CreationDate="2017-06-19T19:45:17.390" Score="0" Body="&lt;h1&gt;Call a library function&lt;/h1&gt;&#xA;&lt;p&gt;Given a single int32, a path to a Dynamic Link Library (.dll) or Shared Library (.so), and the name of a function, return the single int32 result of calling the function on the single int32.&lt;/p&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;On 64 bit Linux: &lt;code&gt;0&lt;/code&gt; &lt;code&gt;/usr/lib64/libm-2.24.so&lt;/code&gt; &lt;code&gt;fesetround&lt;/code&gt; → &lt;code&gt;0&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;On 64 bit Linux: &lt;code&gt;1&lt;/code&gt; &lt;code&gt;/usr/lib64/libm-2.24.so&lt;/code&gt; &lt;code&gt;fesetround&lt;/code&gt; → &lt;code&gt;1&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;On 32 bit Linux: &lt;code&gt;1023&lt;/code&gt; &lt;code&gt;/usr/lib/libm-2.24.so&lt;/code&gt; &lt;code&gt;fesetround&lt;/code&gt; → &lt;code&gt;1&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;On 32 bit Linux: &lt;code&gt;1024&lt;/code&gt; &lt;code&gt;/usr/lib/libm-2.24.so&lt;/code&gt; &lt;code&gt;fesetround&lt;/code&gt; → &lt;code&gt;0&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;On 64 bit Windows: &lt;code&gt;inp&lt;/code&gt; &lt;code&gt;please\edit\filename.dll&lt;/code&gt; &lt;code&gt;fname&lt;/code&gt; → &lt;code&gt;out&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;On 64 bit Windows: &lt;code&gt;inp&lt;/code&gt; &lt;code&gt;please\edit\filename.dll&lt;/code&gt; &lt;code&gt;fname&lt;/code&gt; → &lt;code&gt;out&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-19T20:03:20.473" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="12998" PostTypeId="2" ParentId="12959" CreationDate="2017-06-19T19:55:06.810" Score="0" Body="&lt;h1&gt;Be more aggressive about rewriting questions if they're a long way from typical PPCG conventions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If a question is defined in terms of test cases (with the exception of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;, where the number of test cases is typically very large and there's clearly no other way to specify the behaviour), it specifies a single language when there's no good reason, it has excessively strict I/O requirements, or the like, the challenge is only going to be improvable by changing it to work more like challenges normally do on PPCG. So we'd want to edit it as it is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We often try to stay near to the OP's intent for challenges even when it makes no sense. However, if the challenge is a long way away from our conventions, doing that is probably actively a bad thing; if the details of the challenge change in such a way that they no longer answer the original question, there's at least no scope for cheating on a competition with them (and even if there is no competition elsewhere, we'd still want the best possible competition here). (For example, most other competition sites I'm aware of have a fairly strict runtime limit on their code, the challenge being &quot;solve this so that it runs on all test cases in under 1 second each&quot; or the like. Here, a pure &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is normally but not always more interesting; note that the original victory condition is not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; either because it normally cares about the code being as fast as possible to &lt;em&gt;write&lt;/em&gt; and only sufficiently fast to &lt;em&gt;run&lt;/em&gt;.) It may well just be that the OP has competed elsewhere and is emulating the style of other sites rather than copying questions; in this case, fixing the question to follow our style is probably only going to help.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note a special case: if the challenge is &lt;em&gt;plagiarised&lt;/em&gt;, it probably needs to be deleted on copyright grounds. However, if the original can't be found, that probably isn't the case.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-19T19:55:06.810" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="12999" PostTypeId="1" CreationDate="2017-06-19T19:57:32.670" Score="0" ViewCount="67" Body="&lt;p&gt;I noticed that &lt;a href=&quot;https://codegolf.stackexchange.com/help/dont-ask&quot;&gt;https://codegolf.stackexchange.com/help/dont-ask&lt;/a&gt; says &quot;You should only ask practical, answerable questions based on actual problems that you face.&quot; However, at least 70% of code golfing is done just for fun, and isn't based on actual problems faced (If they had real business use cases, they probably should be in StackOverflow instead.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can that sentence be reworded or removed?&lt;/p&gt;&#xA;" OwnerUserId="63966" LastEditorUserId="68942" LastEditDate="2021-06-06T00:04:22.657" LastActivityDate="2021-06-06T00:04:22.657" Title="can &quot;actual problems&quot; be removed from /help/dont-ask?" Tags="|feature-request|status-declined|" AnswerCount="0" CommentCount="4" ClosedDate="2017-06-19T20:14:27.047" ContentLicense="CC BY-SA 3.0" />
  <row Id="13001" PostTypeId="2" ParentId="2140" CreationDate="2017-06-19T20:29:06.927" Score="0" Body="&lt;h1&gt;What is the maximum number of backslashes (escape characters) required to mean one backslash?&lt;/h1&gt;&#xA;&lt;p&gt;If you want to use a regex to look for a backslash, you have to escape&#xA;that backslash, so that the character after it isn't escaped instead.&#xA;But if you then have to store this regex in a string (in a c-style&#xA;language, for instance), you need to double the number of backslashes,&#xA;so that a regex string to match \stuff\ would need to be&#xA;&amp;quot;\\\\stu(f+)\\\\&amp;quot; (and I had to further double the backslashes&#xA;to post it in StackOverflow, but that isn't executable so doesn't&#xA;count).&lt;/p&gt;&#xA;&lt;p&gt;In your answer, explain the language and the (reasonable) situation,&#xA;from either real or made-up business needs, and the answer with the&#xA;most backslashes (per final, output backslash) will get upvoted&#xA;(permanently) and accepted (until a better one comes along). If using&#xA;AutoHotKey or another language that has a different escape character&#xA;(for instance, `), then instances of that character will count&#xA;instead of backslashes.&lt;/p&gt;&#xA;&lt;p&gt;This question is not how many backslashes &lt;em&gt;could&lt;/em&gt; you use in some&#xA;esoteric code-golfing language to eventually calculate to a backslash,&#xA;otherwise I don't think there would be an upper limit. This instead is&#xA;about feasible scenarios that &lt;strong&gt;force&lt;/strong&gt; you to use a lot of&#xA;backslashes.&lt;/p&gt;&#xA;" OwnerUserId="63966" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-19T20:29:06.927" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13002" PostTypeId="2" ParentId="7804" CreationDate="2017-06-20T00:24:23.190" Score="3" Body="&lt;h1&gt;Posted&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/151341/lets-play-mafia&quot;&gt;Let&amp;#39;s Play Mafia!&lt;/a&gt;&#xA;pending removal of this post&lt;/p&gt;&#xA;" OwnerUserId="14509" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-12-20T17:02:35.177" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13003" PostTypeId="2" ParentId="2140" CreationDate="2017-06-20T03:59:02.013" Score="-2" Body="&lt;h1&gt;Migrate questions to and from the Sandbox! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stack-exchange-api&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stack-exchange-api&amp;#39;&quot; rel=&quot;tag&quot;&gt;stack-exchange-api&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write user scripts that will migrate challenges to and from the Sandbox.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Criteria&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;These are my suggestions for criteria that will create the most beautiful user scripts. Feel free to suggest your own!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Migrating to the Sandbox&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The script should...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;only act on a question that has been closed for &quot;unclear what you're asking&quot;&lt;/li&gt;&#xA;&lt;li&gt;answer the Sandbox as the original author of the question&lt;/li&gt;&#xA;&lt;li&gt;make the title and tags the first line of the answer as a H1-sized header&lt;/li&gt;&#xA;&lt;li&gt;link the original question to the Sandbox post, and then delete it&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Migrating from the Sandbox&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The script should...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;use the first line to determine the title and tags for the post, and eliminate it from the post body&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;error handling here would be a good idea&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;create the question as the author of the Sandbox answer&lt;/li&gt;&#xA;&lt;li&gt;comment on the question with a link to the Sandbox answer&lt;/li&gt;&#xA;&lt;li&gt;replace the Sandbox answer with &lt;em&gt;just&lt;/em&gt; the title and link to the question, then delete the Sandbox answer&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, so the answer with the highest net of votes will win.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is what I'm asking for even possible? I've never written a user script before. Maybe it should be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stack-exchange-api&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stack-exchange-api&amp;#39;&quot; rel=&quot;tag&quot;&gt;stack-exchange-api&lt;/a&gt; question?&lt;/li&gt;&#xA;&lt;li&gt;Should this be a Community effort rather than a challenge? Does it even belong on main?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="69054" LastActivityDate="2017-06-20T03:59:02.013" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13004" PostTypeId="1" CreationDate="2017-06-20T04:44:26.957" Score="1" ViewCount="75" Body="&lt;p&gt;I outlined &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13003/69054&quot;&gt;a question in the Sandbox&lt;/a&gt; for a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; to create a user script that can migrate challenges to and from the Sandbox. I've since been informed by multiple people that the criteria I outlined were not feasible for a userscript.&lt;/p&gt;&#xA;&lt;p&gt;One point of discussion from @FryAmTheEggman is that:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Automating this wouldn't really help at all, since the sandbox only does anything if the poster wants to use it.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Here are some reasons I think such a tool would be helpful:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Most new users are unaware of the Sandbox, and they are (usually) the ones posting poorly written questions&lt;/li&gt;&#xA;&lt;li&gt;I think it will help us retain more new users, because the negative connotations of downvotes and closings are mitigated by constructive criticism on the Sandbox post&lt;/li&gt;&#xA;&lt;li&gt;I think that moving questions to and from the Sandbox is a somewhat tedious &lt;em&gt;but&lt;/em&gt; mechanical problem, which means it is well-suited for being automated&lt;/li&gt;&#xA;&lt;li&gt;This also helps users on mobile devices, for whom it is even more difficult and tedious to copy and paste the raw Markdown and make all the edits and comments&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;So, here are my questions:&lt;/h3&gt;&#xA;&lt;h3&gt;1. Do we want a Sandbox migration bot?&lt;/h3&gt;&#xA;&lt;h3&gt;2. If we do, how should we go about creating it?&lt;/h3&gt;&#xA;&lt;p&gt;Specifically, should it be:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A challenge like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13003/69054&quot;&gt;the one I have outlined&lt;/a&gt;,&lt;/li&gt;&#xA;&lt;li&gt;A community effort in some other form, or&lt;/li&gt;&#xA;&lt;li&gt;Something for someone to create on their own?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="69054" LastEditorUserId="68942" LastEditDate="2021-06-06T00:00:09.423" LastActivityDate="2021-06-06T00:00:09.423" Title="A Sandbox Migration Bot" Tags="|feature-request|status-declined|sandbox|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13005" PostTypeId="2" ParentId="13004" CreationDate="2017-06-20T07:47:57.780" Score="5" Body="&lt;h1&gt;This doesn't seem useful&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Copying a challenge between the sandbox and main site is a simple matter of copying-and-pasting the body, title, and tags. Three copy-and-pastes really isn't a large amount of effort, and is trivial in comparison with basically anything else you might want to do with respect to a challenge or Sandbox post. (Sometimes I change headings between level 1 and level 2, but that's basically just a nicety rather than something that's necessary.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, it's quite common for me to make minor changes to a post (typically to the title or introduction) while moving it between the main site and sandbox; an automated process wouldn't do that at all. We'd have to institute a culture of Sandbox posts being &lt;em&gt;identical&lt;/em&gt; to the desired challenge on Main (which is not the case at the moment), and I think that'd be detrimental to the usability of the Sandbox.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-20T07:47:57.780" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13006" PostTypeId="2" ParentId="12868" CreationDate="2017-06-20T10:16:34.697" Score="11" Body="&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Golf for fun, not to win!&lt;/strong&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Post your answer even if someone else has already posted a shorter answer in the same language!&lt;/strong&gt; &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Yes, you can learn from other people's answers, but learning by doing is in my experience much more effective.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's likely that other's will have posted submissions in your language before you are finished writing yours. And it's likely that their submissions are shorter than what you managed to write. Post your solution anyway! People will likely give you advise based on what you have done, and you'll learn.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Post: &lt;a href=&quot;https://codegolf.stackexchange.com/a/117975/31516&quot;&gt;&lt;em&gt;&quot;Hey, I'm new to this, and it works!&quot;&lt;/em&gt;&lt;/a&gt;, even if &lt;a href=&quot;https://codegolf.stackexchange.com/a/117850/31516&quot;&gt;something much better&lt;/a&gt; has already been posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Have a look at what happened &lt;a href=&quot;https://codegolf.stackexchange.com/a/65590/31516&quot;&gt;with this Java-submission&lt;/a&gt; by a new golfer (&lt;em&gt;&quot;not for the win but for the fun :)&quot;&lt;/em&gt;). The user has about 500 Java-answers on SO (so the user has written quite a bit of Java-code), but got help from 4 different users to golf his/her score quite a lot.&lt;/p&gt;&#xA;" OwnerUserId="31516" LastActivityDate="2017-06-20T10:16:34.697" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13007" PostTypeId="2" ParentId="12987" CreationDate="2017-06-20T11:19:52.480" Score="1" Body="&lt;p&gt;Imagine a deliberately simplified challenge to demonstrate the problem:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Write a program that simulates your cat. If you don't have a cat, and don't know how to program, feel free to just post a photo of your dog.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The problem with this is that both types of answer are now jumbled together, and both will gain upvotes but for different reasons, so sorting by votes will not be meaningful. Although the Stack Exchange model is not perfect for programming contests, one thing it does well is presenting a list of answers in one place that can be meaningfully compared.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are people who like pictures of dogs, and there are people who like cat simulating programs. Both groups are served better if the two categories are presented in separate lists. Even people who like both benefit from being able to choose which to browse through on any given day.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a challenge author wishes to also see answers that are not valid for their particular challenge, then they should either post a separate challenge (if it is on topic here) or start a thread on another site and link to it from the original challenge (if they want to see things like photos that are relevant to the challenge but not on topic here).&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2017-06-20T11:19:52.480" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13009" PostTypeId="2" ParentId="12987" CreationDate="2017-06-20T13:10:44.203" Score="-3" Body="&lt;p&gt;&lt;strong&gt;OP can specify that certain types of answers aren't outright banned, but they will be for-reference-only and ineligible to win.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using the linked challenge as an example, it would make sense to make builtins that basically do the job non-competing (yes I'm looking at you, M), given that they make the challenge boring, but making them grounds for deletion would make the challenge lack references to builtins that would have solved the challenge otherwise, and I believe references to them should exist nevertheless.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another thing is the way OP intended for the challenge to be solved, and OP may still consider builtins useful contributions. Also, it's OP who decides what their challenge exactly is, and they can pretty much override any meta consensus, so why not let them put such a rule in there too?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since calling this kind of answers &quot;non-competing&quot; can be confused with the answer using a newer language or language version than the challenge, I propose calling those answers as &lt;em&gt;for-reference-only&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2017-06-20T13:10:44.203" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="13012" PostTypeId="2" ParentId="2140" CreationDate="2017-06-20T14:28:42.120" Score="0" Body="&lt;h1&gt;Counting from &lt;code&gt;0&lt;/code&gt; - &lt;code&gt;100&lt;/code&gt;&lt;/h1&gt;&#xA;&lt;p&gt;I posted this question, but it was not taken very well, so I wanted to put it through the sandbox and get some feedback/help before re-posting.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Output all numbers from &lt;code&gt;0&lt;/code&gt;-&lt;code&gt;100&lt;/code&gt;. Without using any of your languages &lt;strong&gt;built in loops&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Loops that are not allowed&lt;/h3&gt;&#xA;&lt;p&gt;This list contains, &lt;strong&gt;but is not limited to&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For loops&lt;/li&gt;&#xA;&lt;li&gt;While loops&lt;/li&gt;&#xA;&lt;li&gt;Do While loops&lt;/li&gt;&#xA;&lt;li&gt;Goto Statment&lt;/li&gt;&#xA;&lt;li&gt;In Range&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; the shortest solution in bytes wins&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard Loopholes Apply&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;You may use functions as well as programs&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="70765" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-20T14:28:42.120" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="13013" PostTypeId="1" AcceptedAnswerId="13014" CreationDate="2017-06-20T14:43:04.563" Score="2" ViewCount="71" Body="&lt;p&gt;Many challenges don't specify what characters the input consists of, so I often assume the input will only consist of printable ASCII chars. Is my assumption correct?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that this mostly concerns string-related challenges.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2017-06-20T14:53:46.583" Title="Can I assume that the input will always be within the printable ASCII range (0x20-0x7E)?" Tags="|discussion|policy|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13014" PostTypeId="2" ParentId="13013" CreationDate="2017-06-20T14:53:46.583" Score="6" Body="&lt;p&gt;String-based challenges should always specify the valid character range, much like numeric challenges should specify the range of valid input numbers. It's even the very first thing in the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; tag wiki. I propose putting challenges on hold as unclear until the character set has been clarified.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2017-06-20T14:53:46.583" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13016" PostTypeId="2" ParentId="2140" CreationDate="2017-06-20T16:43:36.163" Score="0" Body="&lt;h2&gt;Data exfiltration&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Frenzy in the frequency domain.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Summary of the challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You must find a way to broadcast a ten-character password through a lossy communication channel and recover the password on the other side.&#xA;To achieve this you must write two programs. The first program will receive the password as input and encode it as output data for the channel, the second program has to decode the output of the channel back to the password.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Some background&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;In signal processing theory, many problems are usually dealt with by converting a signal from the time domain to the so-called &lt;a href=&quot;https://en.wikipedia.org/wiki/Frequency_domain&quot; rel=&quot;nofollow noreferrer&quot;&gt;frequency domain&lt;/a&gt;, a trick that relies on the fact that any function can be written as an infinite series of sine waves. Signals can be converted into this domain using a &lt;a href=&quot;https://en.wikipedia.org/wiki/Fourier_transform&quot; rel=&quot;nofollow noreferrer&quot;&gt;Fourier transform&lt;/a&gt;. This transform is lossless, and the resulting signal can be converted back into the time domain using the inverse Fourier transform. The frequency domain has some interesting properties, as the actual values of the signal in it represent the amplitude and phase of different frequencies in the original signal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A special case exists for when the signal exists out of equally spaced sampled points, called the discrete-time Fourier transform. To perform this transform the &lt;a href=&quot;https://en.wikipedia.org/wiki/Fast_Fourier_transform&quot; rel=&quot;nofollow noreferrer&quot;&gt;fast fourier transform&lt;/a&gt; algorithm is commonly used. Given a signal of N samples spaced with dt spacing, it will convert it into a signal containing N frequency bins which are each 1/(N*dt) apart.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Channel definition&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The communication channel requires 256 unsigned bytes data as input, and returns 256 unsigned bytes data as output. If the input values are centered around zero and interpreted as data samples on regular intervals, then the output values represent the amplitude of the signal in the frequency domain scaled to use the range 0 to 255, calculated using a discrete fourier transform. The channel is lossy as it only transfers the amplitude of each frequency, not the phase.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It can be simulated using the following python 3 script:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import cmath&#xA;def channel():&#xA;    # amount of input and output values&#xA;    l=256&#xA;    # read the input values from standard input as newline separated integers and center them around zero&#xA;    n=list(map(lambda: min(255, max(0, int(raw_input())))-127.5, range(l)))&#xA;    # perform a discrete fourier transform&#xA;    v=[sum(v*cmath.exp(-2.0j*cmath.pi*t*k/l)for t,v in enumerate(n))/l for k in range(l)]&#xA;    # remove artifacts due to the Nyquist limit&#xA;    v[1:128]=map(lambda n:n*2,v[1:128])&#xA;    v[129:]=[.0]*127&#xA;    # return the scaled magnitude of each frequency bin&#xA;    for i in v:print(int(round(abs(i)*cmath.pi/2)))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Input/Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The password is randomly generated using only using visible ASCII characters (0x20 up to and including 0x7E) and is 10 characters long. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Inputting the password to the encoder, communicating it to the channel, receiving data from the channel and communicating the decoded password should all follow the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;default input/output rules&lt;/a&gt;. The password must be decoded only from data received from the channel, no side-channels are allowed.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, where the score is calculated by adding the length of both the encoder and decoder program. For each language, the shortest entry in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the challenge clear&lt;/li&gt;&#xA;&lt;li&gt;Is the difficulty okay&lt;/li&gt;&#xA;&lt;li&gt;Anything else?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Tags:&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="36759" LastEditorUserId="36759" LastEditDate="2017-06-21T12:28:03.153" LastActivityDate="2017-06-21T12:28:03.153" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13017" PostTypeId="2" ParentId="9126" CreationDate="2017-06-20T17:19:36.900" Score="1" Body="&lt;p&gt;I've been following your option #2, which is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5341/70172&quot;&gt;allowed specifically as an Input method for SQL&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;SQLs may take input from a named table&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I normally don't even write out the explicit &lt;code&gt;CREATE TABLE&lt;/code&gt; and &lt;code&gt;INSERT&lt;/code&gt; statements, I just use the table in my code, then mention something like:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Input is taken from integer columns &lt;strong&gt;L&lt;/strong&gt; and &lt;strong&gt;x&lt;/strong&gt; in preexisting table &lt;strong&gt;t&lt;/strong&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5341/70172&quot;&gt;per our allowed input methods&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;So far I haven't had anyone complain, although SQL answers are seldom competitive by byte count.&lt;/p&gt;&#xA;" OwnerUserId="70172" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-20T17:19:36.900" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13018" PostTypeId="2" ParentId="12980" CreationDate="2017-06-20T19:30:42.007" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/125397/194&quot;&gt;Create the slowest growing function you can in under 100 bytes&lt;/a&gt; effectively functions as a largest number question, as per the comment:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;An effective strategy is to write a fast-growing function and take its inverse, i.e. find the smallest input to it that produces at least the required value. Perhaps this is a dupe? – &lt;a href=&quot;https://codegolf.stackexchange.com/users/20260/xnor&quot;&gt;xnor&lt;/a&gt; Jun 8 at 18:59&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It also lacks the source code restrictions etc.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-06-20T19:30:42.007" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13020" PostTypeId="1" CreationDate="2017-06-20T21:58:17.130" Score="2" ViewCount="119" Body="&lt;p&gt;It's been my understanding that answers in code golf competitions should generally be given as &lt;em&gt;source&lt;/em&gt; code. But lately I've seen a few answers specified as x86 assembly, counting the size as the number of bytes in the &lt;em&gt;compiled&lt;/em&gt; binary blob. For example &lt;a href=&quot;https://codegolf.stackexchange.com/a/127559/11390&quot;&gt;this answer&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Firstly, it seems like this way of counting is only valid if the language is x86 machine code, rather than assembly language, as assembly language is source code that can produce a certain machine code output, rather than the machine code being submitted. But naming and byte counting aside, is it even acceptable (for code golf questions with standard rules) to post non-source code answers in the first place? Should this be considered acceptable for other languages and formats as well? Should we, for example, allow Java &lt;code&gt;.class&lt;/code&gt; and gzip encoded &lt;code&gt;.py&lt;/code&gt; files as well, in the name of consistency?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Edit to try to clarify: I'm not asking a question about scoring, which is the main point of the suggested duplicate question. I'm asking whether a certain class of answers are valid in the first place.&lt;/p&gt;&#xA;" OwnerUserId="11390" LastEditorUserId="11390" LastEditDate="2017-06-20T22:57:10.923" LastActivityDate="2017-06-21T03:43:03.973" Title="Must answers be given as SOURCE code, or is machine code acceptable?" Tags="|discussion|policy|" AnswerCount="1" CommentCount="7" ClosedDate="2017-06-21T10:41:06.113" ContentLicense="CC BY-SA 3.0" />
  <row Id="13021" PostTypeId="1" AcceptedAnswerId="13022" CreationDate="2017-06-20T22:46:15.540" Score="14" ViewCount="814" Body="&lt;p&gt;I was just browsing the &lt;a href=&quot;https://meta.stackexchange.com/q/19478/355458&quot;&gt;Many Memes of Meta&lt;/a&gt; when the question was edited in to add, next to the PPCG entry:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;and recently deleted&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Not believing this, I clicked on the link, only to find out that it had.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Why?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Why was the post deleted? While it wasn't the best fit for a Meta question, it was locked and doing no harm to the community. So why did someone delete it?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2018-12-12T21:38:30.513" LastActivityDate="2018-12-12T21:38:30.513" Title="What happened to the memes page?" Tags="|discussion|deleted-questions|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="13022" PostTypeId="2" ParentId="13021" CreationDate="2017-06-21T02:06:49.287" Score="19" Body="&lt;p&gt;For those who can't see deleted posts: I deleted the memes question. However, I didn't act unilaterally; this decision was made by the moderation team.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;While it wasn't the best fit for a Meta question, it was locked and doing no harm to the community.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, we disagree with the second half of that sentence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question was initially locked by us because we felt it did more harm than good. While it was intended as a go-to place to figure out what on Earth the TNB/PPCG regulars were talking about when someone mentioned &lt;em&gt;yingluck&lt;/em&gt; or whatever, it mostly served to keep memes that should have been retired a long time ago on life support. We initially locked the question to prevent the addition of new memes, but that does nothing to help retiring the old ones.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Someone rightfully pointed out that it was more of a &lt;em&gt;FAQ on how to be irritating&lt;/em&gt; than a historically significant question, so we decided to delete it. While we may have lost an interesting read, this will hopefully aid in naturally and gradually phasing out some memes that overstayed their welcome.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-06-21T02:06:49.287" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="13023" PostTypeId="2" ParentId="2140" CreationDate="2017-06-21T02:11:56.917" Score="0" Body="&lt;h2&gt;OCR&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge you will attempt to write a program to perform OCR in the fewest bytes possible. The tests are linked below, the only data that your program receives is the contents of the image, you may not rely on file name, timestamp, or other metadata, additionally you may not query any external source such as the internet or dispatch an independent program to outsource the task of OCR.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Spec&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a hand written word in in image of 80px in height. Output the word. words will consist of lowercase latin letters:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abcdefghijklmnopqrstuvwxyz&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given the test cases, your score is a percent of the words you have gotten correct. No partial credit.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Tests cases:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TODO&lt;/p&gt;&#xA;" OwnerUserId="40695" LastActivityDate="2017-06-21T02:11:56.917" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13025" PostTypeId="2" ParentId="13020" CreationDate="2017-06-21T03:43:03.973" Score="4" Body="&lt;h1&gt;There's no difference between source code and machine code&lt;/h1&gt;&#xA;&lt;p&gt;We seem to be using &amp;quot;Machine code&amp;quot; in various different ways, so I'll cover them all:&lt;/p&gt;&#xA;&lt;p&gt;If &amp;quot;Machine code&amp;quot; means&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The x86 assembly language:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There's no fundamental difference between x86 and other languages.  It is written using bytes, and has an interpreter (the processor)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Code written using a hex editor:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A hex editor is &lt;em&gt;very&lt;/em&gt; similar to a code page.  It maps the character &amp;quot;F&amp;quot; into the byte &amp;quot;1111&amp;quot;.  If we disallowed code written in hex, how do we justify code pages?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Computer-generated code:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Trying to disallow this would be a nightmare.  Should we disallow Javascript because Typescript compiles to it?  What about auto-golfing programs?&lt;/li&gt;&#xA;&lt;li&gt;Regardless, we require that submissions to show effort.  If you've simply posted a .class file without any attempts to make it shorter, then your post is candidate for deletion.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-21T03:43:03.973" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13027" PostTypeId="2" ParentId="2140" CreationDate="2017-06-21T07:32:58.313" Score="2" Body="&lt;h1&gt;Implement Nopfunge&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://esolangs.org/wiki/Nopfunge&quot; rel=&quot;nofollow noreferrer&quot;&gt;Nopfunge&lt;/a&gt; is a very simple Befunge derivative, with no stack and no real form of data storage; all it has is an instruction pointer and five commands (&quot;turn north&quot;, &quot;turn south&quot;, &quot;turn east&quot;, &quot;turn west&quot;, &quot;continue in same direction&quot;). However, what it does have is a program that repeats forever in two dimensions, which turns out to be enough to make it Turing complete.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program must take, as input, four 2D arrays of characters, &lt;em&gt;a&lt;/em&gt;, &lt;em&gt;b&lt;/em&gt;, &lt;em&gt;c&lt;/em&gt;, and &lt;em&gt;d&lt;/em&gt;, via any reasonable means. Each of these will have the same dimensions, and they will be rectangular (although not necessarily square). (&lt;em&gt;Note&lt;/em&gt;: This is a simplification from the actual syntax of Nopfunge, but is still just as Turing-complete.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program will then conceptually work on an infinite array formed out of sub-arrays identical to the inputs, formed by placing &lt;em&gt;a&lt;/em&gt; in the top left corner, &lt;em&gt;b&lt;/em&gt; along the top edge, &lt;em&gt;c&lt;/em&gt; along the left edge, and &lt;em&gt;d&lt;/em&gt; everywhere else, like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abbbbbbb …&#xA;cddddddd …&#xA;cddddddd …&#xA;cddddddd …&#xA;&#xA;⫶⫶⫶⫶⫶⫶⫶&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(Note that because you can't assume your language can do infinite work in finite time, you won't be able to actually represent the compressed array in memory, so you won't be able to calculate the value at a particular coordinate pair in advance; rather, you'll have to calculate it lazily and/or every time it's needed.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then simulate the progress of a Nopfunge program on this array. Specifically, there's an instruction pointer that has a position on the array, and a direction; it starts at the top-left corner, going to the right. Repeatedly, run the command specified by the character at the instruction pointer:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;gt;&lt;/code&gt;: Move the instruction pointer one position to the right; it now points right&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;lt;&lt;/code&gt;: Move the instruction pointer one position to the left; it now points left&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;^&lt;/code&gt;: Move the instruction pointer one position upwards; it now points up&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;v&lt;/code&gt;: Move the instruction pointer one position downwards; it now points down&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;#x20;&lt;/code&gt; (space): Move the instruction pointer one position in its current direction&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Should the instruction pointer ever attempt to move outside its infinite array (by moving above the top edge or to the left of the left edge), your program should exit. If the instruction pointer never attempts to move outside its infinite array, the program should never exit. (Or in other words, the task is to halt if and only if the Nopfunge program does.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Clarifications&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can input the arrays as arrays of character codes (i.e. integers) rather than characters if you wish, but if you do, they must use the ASCII/Unicode encodings, 62 60 94 118 32 for &lt;code&gt;&amp;gt;&lt;/code&gt; &lt;code&gt;&amp;lt;&lt;/code&gt; &lt;code&gt;^&lt;/code&gt; &lt;code&gt;v&lt;/code&gt; &lt;code&gt;&amp;#x20;&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Your program can do anything if the input arrays aren't all the same size or aren't rectangular.&lt;/li&gt;&#xA;&lt;li&gt;You may take additional inputs for the dimensions (width and height) of the input arrays, if you wish.&lt;/li&gt;&#xA;&lt;li&gt;It doesn't matter what (if anything) your program outputs; all that matters is whether or not it halts.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Victory condition&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shorter programs (in bytes) are considered to have a better score.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Is the specification easy to understand and unambiguous?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is this the best possible input format? I wanted to avoid the secondary task of having to parse Nopfunge's input format (which uses &lt;code&gt;=&lt;/code&gt; and &lt;code&gt;;&lt;/code&gt; to split one array into the four given here), but am not sure whether this format or that one is more convenient for solving the task.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-21T07:32:58.313" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13028" PostTypeId="2" ParentId="5347" CreationDate="2017-06-21T07:42:09.593" Score="0" Body="&lt;h1&gt;If the space of randomness is relatively small, just run for all possibilities and average the score&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This won't apply for every KOTH, as some use very large amounts of randomness. For some, though, it's clearly the fairest method for scoring. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/q/36645/62131&quot;&gt;this&lt;/a&gt; KOTH ran in parallel with another one offsite (I was participating in the other one at the time). I remember thinking that the one on PPCG was fairly primitive because it didn't simply run all 42 possibilities (21 lengths, then again swapping the &lt;code&gt;-&lt;/code&gt; and &lt;code&gt;+&lt;/code&gt; in one program), like other hills for that challenge do.&lt;/p&gt;&#xA;" OwnerDisplayName="user62131" LastActivityDate="2017-06-21T07:42:09.593" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13029" PostTypeId="1" CreationDate="2017-06-21T08:52:42.417" Score="13" ViewCount="1005" Body="&lt;p&gt;Several questions have recently been asking about random. I see a lot of answers in those questions using the date not as a seed but as the random number that is then modulo'ed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Seen in Java:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;System.currentTimeMillis()%N&#xA;System.nanoTime()%N&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Seen in JavaScript:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;new Date%N&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Doing so is randomly unfair for two reasons:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;the code will often return the same values if run in quick successions, also if the time ticks during two runs, you know you'll get the next value. You may be surprised by the first run, making it random, but not by the next ones.&lt;/li&gt;&#xA;&lt;li&gt;the &lt;a href=&quot;https://stackoverflow.com/q/10984974/180719&quot;&gt;the modulo bias&lt;/a&gt; is then alive and well.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;What are the views of the community on this topic?&lt;/p&gt;&#xA;" OwnerUserId="16236" LastEditorUserId="31716" LastEditDate="2018-03-14T17:54:09.690" LastActivityDate="2018-03-14T17:54:09.690" Title="Is the current time or date with modulo random enough?" Tags="|discussion|policy|random|" AnswerCount="4" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="13030" PostTypeId="1" CreationDate="2017-06-21T11:13:17.343" Score="10" ViewCount="257" Body="&lt;p&gt;I just stumbled upon &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5828/the-many-memes-of-ppcg&quot;&gt;a question that was deleted here on this meta&lt;/a&gt;. (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/404&quot;&gt;Link to reproduce&lt;/a&gt; for users with &gt;2k rep.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All good, questions get deleted all the time, but I couldn't help noticing something weird:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/mohDq.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/mohDq.png&quot; alt=&quot;&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Actually this is funny. Image not found inside Page not found. Haha.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In case it's not funny on purpose, can this be fixed?&lt;/p&gt;&#xA;" OwnerDisplayName="user8790" LastEditorUserId="66833" LastEditorDisplayName="user8790" LastEditDate="2023-08-26T17:57:41.953" LastActivityDate="2023-08-26T17:57:41.953" Title="Is this another puzzle? 404 image in 404 page" Tags="|bug|status-completed|404-page|" AnswerCount="0" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="13033" PostTypeId="2" ParentId="13029" CreationDate="2017-06-21T13:29:10.827" Score="3" Body="&lt;p&gt;First: if the challenge defines random as something other than the default or uniform, &lt;code&gt;new Date%N&lt;/code&gt; may be valid or not on a case by case basis. For example, if random means &amp;quot;with non-zero probability&amp;quot; or something similar, &lt;code&gt;new Date&lt;/code&gt; should be OK.&lt;/p&gt;&#xA;&lt;h1&gt;Is the current time uniformly random?&lt;/h1&gt;&#xA;&lt;p&gt;I believe that answer to that question, which is the real question here, is &lt;strong&gt;no&lt;/strong&gt;. If, for example, you want to get many truthy or falsey values, &lt;code&gt;new Date%2&lt;/code&gt; will give you something like &lt;code&gt;1,1,1,1,0,0,0,0,0,1,1,1&lt;/code&gt;. That doesn't look &amp;quot;uniform&amp;quot; to me.&lt;/p&gt;&#xA;" OwnerUserId="65836" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-21T13:58:52.580" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="13034" PostTypeId="2" ParentId="6918" CreationDate="2017-06-21T13:56:34.123" Score="0" Body="&lt;h2&gt;&lt;a href=&quot;https://github.com/Thelonedevil/TLDCode&quot; rel=&quot;nofollow noreferrer&quot;&gt;TLDCode&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Created by &lt;a href=&quot;https://codegolf.stackexchange.com/users/46866/the-lone-devil&quot;&gt;The_Lone_Devil&lt;/a&gt; (Me) and is a (WIP) stack based language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The name is likely to change one day when I think of a good one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I created it as something to work on during some downtime at work, and to learn Kotlin a bit better (the language the interpreter is written in).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is some documentation, as well as a Kotlin based interpreter over on the &lt;a href=&quot;https://github.com/Thelonedevil/TLDCode&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github page&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some features include&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;User functions, by pushing a string containing code onto the top of the stack, and then storing the top of the stack into a named variable, you can push the variable onto the stack and eval it to execute.&lt;/li&gt;&#xA;&lt;li&gt;Immutable variables, once a variable is set, only a copy can be pushed onto the stack, they can never change.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="46866" LastActivityDate="2017-06-21T13:56:34.123" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13035" PostTypeId="1" CreationDate="2017-06-21T14:20:21.203" Score="7" ViewCount="305" Body="&lt;p&gt;I was looking at &lt;a href=&quot;https://codegolf.stackexchange.com/questions/126326/print-a-variables-name&quot;&gt;this question&lt;/a&gt;, and noticed while it does lay out its task rather clearly it doesn't really state what the winning criteria is. I scrolled down to the tags expecting that it was a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and the author had forgotten to mention &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Shortest answer wins!!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;or some equivalent statement.   However I noticed that it was instead tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;.  I had to take a double take for a moment, because the tag wiki for popcons states:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A clear specification of the goal that must be achieved. Questions like &quot;do (this) the most creative way&quot; should be avoided. Creativity should be the tool, not the goal.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I've seen many people on this site closing questions as off-topic for stating a goal that was too close to be as creative as possible, while this question lacks a goal altogether.  &lt;a href=&quot;https://codegolf.stackexchange.com/q/95216/56656&quot;&gt;Here is an example of a well specified question &lt;em&gt;with a goal&lt;/em&gt; that was closed for lacking an objective winning criterion&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What gives?  Why is this challenge considered on topic while questions that, in my opinion, have much weaker violations are routinely closed?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-06-21T14:34:08.543" LastActivityDate="2017-06-25T10:50:05.553" Title="Why is this popularity contest given special treatment?" Tags="|discussion|popularity-contest|" AnswerCount="2" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="13036" PostTypeId="2" ParentId="13035" CreationDate="2017-06-21T15:01:00.757" Score="-6" Body="&lt;h1&gt;A different kind of animal&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The problem I'm now seeing is that there are those who think that pop-cons need both a &lt;strong&gt;method to determine if an answer is valid&lt;/strong&gt; at all and a &lt;strong&gt;method to determine which answer is the best&lt;/strong&gt;. This follows with most other tags on the site. For example an answer to a code golf question is valid if it does what is expected and it's better than another answer if it does this task in less bytes. Pop-cons are different because it leaves determining what answer is better to the voters. The reason may end up being that the particular answer has a really nice long description even though the solution is trivial. The reason may end up being that it was posted first and has a lot of upvotes already which attracts more votes (this happens on all challenges; not just pop-cons). Whatever the reason is, that's just how it goes with a popularity contest in general.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;popularity - the state or condition of being liked, admired, or supported by many people.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There's no reason &lt;em&gt;why&lt;/em&gt; something is supported in that definition and there shouldn't be one for challenges of this type. If I like a dumb mspaint rendition of the mona lisa more than someone who put time into coming up with a creative solution, that's on me and not the challenge writer.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;This challenge in particular&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Why hasn't it met with the same fate as so many pop-cons before it? I can't objectively answer that but I do have some ideas.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It has enough support by people who find it interesting. This challenge has been closed and reopened at least once.&lt;/li&gt;&#xA;&lt;li&gt;The voter does not need to judge the output in order to determine if it's valid or not. It's very clear-cut if an answer works and with tools like TryItOnline it's relatively easy to test.&lt;/li&gt;&#xA;&lt;li&gt;The challenge is not in the same genre of an existing challenge. To help describe this I'll use an example. We have a challenge to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/83092/computer-generated-cracked-soil&quot;&gt;generate cracked soil&lt;/a&gt; which was well-received. This challenge to make the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/68636/make-the-pattern-from-composition-notebooks&quot;&gt;composition notebook pattern&lt;/a&gt; was not. Maybe this was just because something like it had been done before and wasn't as interesting this time.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;We as a community have these discussions over and over again until it gets tedious and things get put on hold. This happens with signal vs noise in chat, starring in chat, pop-cons, and a few other things.&lt;/p&gt;&#xA;" OwnerUserId="51785" LastActivityDate="2017-06-21T15:01:00.757" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13037" PostTypeId="2" ParentId="2140" CreationDate="2017-06-21T16:08:54.867" Score="3" Body="&lt;h2&gt;When did I need to be born to celebrate a magic birthday?&lt;/h2&gt;&#xA;&lt;p&gt;I was born in 1984 and in 2016 I became 32 years old, which is 20 in base 16, what a coincidence!&lt;/p&gt;&#xA;&lt;p&gt;Your task is, given the year of interest -say 2016- , to calculate the year I had to be born to be able to say &lt;em&gt;In 2016 I have celebrated/I will celebrate my 20th birthday (in base 16)&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;take &lt;code&gt;n&lt;/code&gt;-digit decimal number - the year &lt;code&gt;xy&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Split it in half, if &lt;code&gt;n&lt;/code&gt; is odd, the digit the middle is appended to number side.&lt;/li&gt;&#xA;&lt;li&gt;Calculate the year I had to be born to be &lt;code&gt;x base y&lt;/code&gt;s old in the year of &lt;code&gt;xy&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Your code shall return Not-a-Number or error message if the decomposition cannot be resolved.&lt;/p&gt;&#xA;&lt;p&gt;Walkthough:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;  foo(2016)&#xA;1: '2016' -&amp;gt; '20' '16'&#xA;2: 20 base 16 = 32&#xA;3: 2016-32 = 1984&#xA;&amp;gt;&amp;gt; 1984&#xA;&#xA;&amp;gt; foo(445)&#xA;1: '445' -&amp;gt;'44' '5'&#xA;2: 44 base 5 = 24&#xA;3: 445-24 = 421&#xA;&amp;gt;&amp;gt; 421&#xA;&#xA;&amp;gt;foo(7)&#xA;1: '7' -&amp;gt; '7' ''&#xA;Error, base not defined&#xA;&amp;gt;&amp;gt; nan&#xA;&#xA;&amp;gt;foo(10)&#xA;1: '10' -&amp;gt; '1' '0'&#xA;Error, base 0 don't exist&#xA;&amp;gt;&amp;gt; nan&#xA;&#xA;&amp;gt;foo(1805)&#xA;1: '1805'-&amp;gt;'18' '5'&#xA;Syntax error&#xA;&amp;gt;&amp;gt; nan&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 7    : nan/error&#xA;10    : nan/error&#xA;78    : 71&#xA;445   : 421 &#xA;1024  : 1000&#xA;1805  : nan/error&#xA;1936  : 1891&#xA;1984  : 1891&#xA;1999  : 1891&#xA;2016  : 1984&#xA;2015  : 1985&#xA;10002 : 9998&#xA;10912 : 10759&#xA;116015: 115769&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Shortest answer in bytes wins. Standard loopholes apply.&lt;/p&gt;&#xA;" OwnerUserId="71179" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-22T13:36:37.347" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="13039" PostTypeId="2" ParentId="2140" CreationDate="2017-06-21T16:49:51.493" Score="3" Body="&lt;h2&gt;Roll identical boson dice &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When you roll two dice, the chance of a 5 and 6 in either order is a 2 in 36 (or 1/18), since it could happen as &lt;code&gt;(5,6)&lt;/code&gt; or &lt;code&gt;(6,5)&lt;/code&gt;. But &lt;code&gt;(6,6)&lt;/code&gt; can only happen one way and has a 1 in 36 chance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Our dice will instead work as &lt;a href=&quot;https://en.wikipedia.org/wiki/Identical_particles#Statistical_properties_of_bosons_and_fermions&quot; rel=&quot;nofollow noreferrer&quot;&gt;identical bosons&lt;/a&gt;: &lt;code&gt;(5,6)&lt;/code&gt; and &lt;code&gt;(6,5)&lt;/code&gt; are a single outcome &lt;code&gt;{5,6}&lt;/code&gt; that is equally likely to &lt;code&gt;{6,6}&lt;/code&gt;. So, each of these 21 unordered pairs is equally likely, with chance &lt;code&gt;1/21&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{1,1}, {1,2}, {1,3}, {1,4}, {1,5}, {1,6}, {2,2}, {2,3}, {2,4}, {2,5}, {2,6}, {3,3}, {3,4}, {3,5}, {3,6}, {4,4}, {4,5}, {4,6}, {5,5}, {5,6}, {6,6}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Similarly, for &lt;code&gt;3&lt;/code&gt; dice, &lt;code&gt;[5,5,6]&lt;/code&gt;, &lt;code&gt;[5,6,5]&lt;/code&gt;, and &lt;code&gt;[6,5,5]&lt;/code&gt; all count as a single outcome &lt;code&gt;{5,5,6}&lt;/code&gt;, but &lt;code&gt;[6,5,6]&lt;/code&gt; is different.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Task:&lt;/strong&gt; Output a random roll of &lt;code&gt;n&lt;/code&gt; boson dice, so that each possible result is equally likely as an unordered multiset, i.e. when sorted. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's OK if your output is ordered as long as the overall probabilities are right. You may sometimes output &lt;code&gt;[5,6]&lt;/code&gt; and sometimes &lt;code&gt;[6,5]&lt;/code&gt; as long as their total chance is &lt;code&gt;1/21&lt;/code&gt;. They don't have to each be &lt;code&gt;1/42&lt;/code&gt; chance. You could output &lt;code&gt;[5,6]&lt;/code&gt; with &lt;code&gt;1/21&lt;/code&gt; chance and never &lt;code&gt;[6,5]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; A positive integer &lt;code&gt;n&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt; A random list of &lt;code&gt;n&lt;/code&gt; numbers from 1 to 6, so that each outcome is equally like when taken as an unordered multiset.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Time restriction:&lt;/strong&gt; Your code has work up to &lt;code&gt;n=50&lt;/code&gt; within 1 minute.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2017-10-01T22:04:48.680" LastActivityDate="2017-10-01T22:04:48.680" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13040" PostTypeId="2" ParentId="8047" CreationDate="2017-06-21T18:10:29.683" Score="16" Body="&lt;h2&gt;Assuming you've addressed sandbox feedback&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When your challenge is in the sandbox and someone suggests a change or clarification, make sure your edit actually addresses their point. Too often the same complaints are brought up on the live challenge, and the poster is confused thinking they already dealt with them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First, consider if the comment still holds true for your edited version. Maybe the rule is clearer than before, but still unclear. Maybe you've addressed some points but not others.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After editing, leave the challenge in the sandbox for more feedback. Maybe the change introduced new problems. Maybe the commenter will clarify their suggestions or offer further revisions. You can ping them in the comments to ask them to take another look.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2017-06-21T18:10:29.683" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13041" PostTypeId="2" ParentId="2140" CreationDate="2017-06-21T19:19:52.310" Score="0" Body="&lt;h1&gt;Rotational Anagrams&lt;/h1&gt;&#xA;&lt;p&gt;Given, for lack of a better word, &lt;em&gt;an anagram cube&lt;/em&gt; &lt;code&gt;c&lt;/code&gt; with &lt;code&gt;n&lt;/code&gt; &lt;em&gt;rings&lt;/em&gt; and a &lt;em&gt;word&lt;/em&gt; &lt;code&gt;w&lt;/code&gt;, output whether or not you can rotate the individual sections to make &lt;code&gt;w&lt;/code&gt; appear across the middle.&lt;/p&gt;&#xA;&lt;h1&gt;Constraints&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The letters that can appear are all printable ASCII characters EXCEPT for newlines.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All three characters that make up the rings can appear (&lt;code&gt;|-+&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Your program should work for cubes of any size, though the maximum I expect you to test is my biggest case (this means that if your code won't finish for &lt;code&gt;n=22&lt;/code&gt; on TIO, I don't care).&lt;/li&gt;&#xA;&lt;li&gt;Your only input should be the ASCII-art &lt;code&gt;c&lt;/code&gt; and the word &lt;code&gt;w&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Your only output is one of two distinct values for &lt;code&gt;true/false&lt;/code&gt;, which are arbitrary.&lt;/li&gt;&#xA;&lt;li&gt;You can assume the input is well-formed, and output &lt;strong&gt;anything&lt;/strong&gt; for bad input.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;p&gt;Example cube with &lt;code&gt;n=3&lt;/code&gt; and &lt;code&gt;w='AXMOZC'&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+----A----+&#xA;| +--Y--+ |&#xA;| | +N+ | |&#xA;B X M O Z D&#xA;| | +P+ | |&#xA;| +--W--+ |&#xA;+----C----+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Rotate the outer wheel once coutner clockwise:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+----D----+&#xA;| +--Y--+ |&#xA;| | +N+ | |&#xA;A X M O Z C&#xA;| | +P+ | |&#xA;| +--W--+ |&#xA;+----B----+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Ding-ding! A match, so we can output truthy for this, but for &lt;code&gt;AXMOYC&lt;/code&gt; there is no rotation that allows that combination, so it would return falsy. (X and Y are not adjacent on the ring, which means they can't appear at the same time.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Here's a small cube of &lt;code&gt;n=2&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+--G--+&#xA;| +P+ |&#xA;P C P G&#xA;| +C+ |&#xA;+--P--+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For an input &lt;code&gt;w=PPCG|GPCP|PCPG|GCPP&lt;/code&gt; this returns true, everything else is false. So you can start to see that the possible keyspace of answers is always &lt;code&gt;n**2&lt;/code&gt;, so... hint hint.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Here's the big honkin' example that took me a minute to piece up.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+----------1----------+&#xA;| +--------O--------+ |&#xA;| | +------5------+ | |&#xA;| | | +----E----+ | | |&#xA;| | | | +-----+ | | | |&#xA;| | | | | +G+ | | | | |&#xA;C 3 D E - B O L L I 4 G&#xA;| | | | | +O+ | | | | |&#xA;| | | | +--W--+ | | | |&#xA;| | | +----F----+ | | |&#xA;| | +------6------+ | |&#xA;| +--------N--------+ |&#xA;+----------2----------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And, amongst many other strings, for &lt;code&gt;w=CODE-GOLFING|CODE-BOWLING&lt;/code&gt; you should return true.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;, if you're on my front lawn the third Tuesday of next month in a batman costume doing unspeakable things to my sprinkler system, you've won.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-22T13:40:02.903" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13044" PostTypeId="2" ParentId="12980" CreationDate="2017-06-21T21:51:00.093" Score="-4" Body="&lt;p&gt;I stumbled across &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11001/194&quot;&gt;this related question&lt;/a&gt;, which I'd forgotten about. I am &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13043/194&quot;&gt;sandboxing a proposed revision&lt;/a&gt; which doesn't remove all of the restrictions you don't like but does deal with one of them.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-06-21T21:51:00.093" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13045" PostTypeId="2" ParentId="5243" CreationDate="2017-06-21T22:25:12.420" Score="18" Body="&lt;h1&gt;1000 Rep for a meta answer that solves the popularity problem&lt;/h1&gt;&#xA;&lt;p&gt;Popularity contests have been discussed many times, always with much conflict over what counts as a pop con, whether they should be on topic, whether the rules need to be consistent between different pop cons, and with a frustrating lack of consensus.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/9498/justin&quot;&gt;Justin&lt;/a&gt; is offering 1000 rep in bounties for a solution to this.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Note that trichoplax (who originally posted this answer) is no longer active here and unlikely to see any comments, so you'll need to include &lt;code&gt;@Justin&lt;/code&gt; in your comment to give a notification.&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;The bounties will be posted on a challenge of the answer author's choice if a meta answer presents a solution to this and meets the following conditions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;30 days after posting the meta answer, it has 10 or more upvotes and over 90% of its votes are upvotes.&lt;/li&gt;&#xA;&lt;li&gt;3 popularity contests appear on main following the new meta answer, each of which after 30 days from posting has net 10 upvotes and is open.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The meta answer can be attached to a new meta question or an existing meta question.&lt;/p&gt;&#xA;&lt;p&gt;The bounty target can be an existing challenge or a future one (the bounty can be deferred if the challenge is yet to be posted). It can be any challenge type.&lt;/p&gt;&#xA;&lt;p&gt;The meta answer can make the rules on pop cons more restrictive, less restrictive, or any other combination of changes, provided it meets the voting criteria specified above.&lt;/p&gt;&#xA;&lt;p&gt;There can be an arbitrary delay between posting the meta answer and the arrival of the 3 popularity contests on main.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2022-10-10T15:43:35.437" LastActivityDate="2022-10-10T15:43:35.437" CommentCount="20" CommunityOwnedDate="2022-10-04T15:26:35.147" ContentLicense="CC BY-SA 4.0" />
  <row Id="13049" PostTypeId="2" ParentId="2140" CreationDate="2017-06-22T09:50:45.760" Score="0" Body="&lt;h1&gt;List My Factors!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;Given an algebraic expression as input, list all the factors of it. A factor of an algebraic expression is any algebraic expression (or simply a numerical expression, sometimes) that evenly divides it. A factor can only be an integer or an algebraic expression consisting of integers and variables.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The algebraic expression will contain &lt;code&gt;*&lt;/code&gt; to denote multiplication.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The algebraic expression will only contain integer constants and coefficients.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The algebraic expression will contain &lt;code&gt;^&lt;/code&gt; to denote exponentiation.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The algebraic expression will only contain positive constants, coefficients and variables.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program should output only the positive factors.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The algebraic expression will not contain negative exponents.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You must not use any built-in to accomplish this.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default/1146#1146&quot;&gt;Standard Loopholes&lt;/a&gt; apply.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;The algebraic expression &lt;code&gt;5*x^2&lt;/code&gt; has the following factors:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;5&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x^2&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;5*x^2&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;5*x&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The algebraic expression &lt;code&gt;10*(x-y)^2&lt;/code&gt; has the following factors:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;10&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;5&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;2&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(x-y)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(x-y)^2&lt;/code&gt; or &lt;code&gt;x^2 + y^2 - 2*x*y&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;2*(x-y)^2&lt;/code&gt; or &lt;code&gt;2*(x^2 + y^2 - 2*x*y)&lt;/code&gt; or &lt;code&gt;2*x^2 + 2*y^2 - 4*x*y&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;5*(x-y)^2&lt;/code&gt; or &lt;code&gt;5*(x^2 + y^2 - 2*x*y)&lt;/code&gt; or &lt;code&gt;5*x^2 + 5*y^2 - 10*x*y&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;10*(x-y)^2&lt;/code&gt; or &lt;code&gt;10*(x^2 + y^2 - 2*x*y)&lt;/code&gt; or &lt;code&gt;10*x^2 + 10*y^2 - 20*x*y&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;10*(x-y)&lt;/code&gt; or &lt;code&gt;10*x - 10*y&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;2*(x-y)&lt;/code&gt; or &lt;code&gt;2*x - 2*y&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;5*(x-y)&lt;/code&gt; or &lt;code&gt;5*x - 5*y&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The algebraic expression &lt;code&gt;x^2 - y^2&lt;/code&gt; has the following factors:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x-y&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x+y&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x^2 - y^2&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;Your program may take the input in any way except assuming it to be present in a predefined variable. Reading from file, input box, modal window, command line etc. is allowed. Taking input as function argument is allowed as well.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Your program should output a list of factors of the given input as a collection data type (such as array) or as a separator-separated String.&lt;/p&gt;&#xA;&lt;p&gt;Your program may output in any way except writing the output to a variable. Writing to file, screen, modal window, command line etc. is allowed. Outputting using function &lt;code&gt;return&lt;/code&gt; is allowed as well.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input               Output&#xA;&#xA;5*x^2               [5*x^2, 5, 1, 5*x, x, x^2]&#xA;10*x^2              [10*x^2, 10, 5, 2, 1, 10*x, 5*x, 2*x, x, 5*x^2, 2*x^2, x^2]&#xA;10*(x-y)^2          [10*(x-y)^2, 10, 2, 5, 1, 10*(x-y), 5*(x-y), 2*(x-y), (x-y), (x-y)^2, 2*(x-y)^2, 5*(x-y)^2]&#xA;x^2 - y^2           [x^2 - y^2, x+y, x-y, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Winning Criterion&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;strike&gt;Should I allow negative constants and coefficients?&lt;/strike&gt; Answer : No&lt;/li&gt;&#xA;&lt;li&gt;Should I allow variable exponents?&lt;/li&gt;&#xA;&lt;li&gt;Is there any mistake in Examples and Test Cases?&lt;/li&gt;&#xA;&lt;li&gt;How long should I let this challenge be here?&lt;/li&gt;&#xA;&lt;li&gt;Any problem with the Input/Output Rules?&lt;/li&gt;&#xA;&lt;li&gt;Should I allow built-in to accomplish the task?&lt;/li&gt;&#xA;&lt;li&gt;Any other suggestion?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="45105" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-22T10:21:56.817" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="13050" PostTypeId="2" ParentId="2140" CreationDate="2017-06-22T14:16:08.633" Score="0" Body="&lt;h1&gt;Home on the Range &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a range &lt;code&gt;[0,n)&lt;/code&gt; that has been shuffled, return the index of each element of the range.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1, 2, 0] -&amp;gt; [2, 0, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is the range &lt;code&gt;[0, 3)&lt;/code&gt; after being shuffled. The element at index &lt;code&gt;0&lt;/code&gt; in the result is &lt;code&gt;2&lt;/code&gt; because, in the input, &lt;code&gt;0&lt;/code&gt; is at index &lt;code&gt;2&lt;/code&gt;. Likewise, the &lt;code&gt;0&lt;/code&gt; in the output is the index of the &lt;code&gt;1&lt;/code&gt; in the input, and the &lt;code&gt;1&lt;/code&gt; is the index of &lt;code&gt;2&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1, 0, 2] -&amp;gt; [1, 0, 2]&#xA;[0, 1, 2, 3] -&amp;gt; [0, 1, 2, 3]&#xA;[0, 2, 1, 3] -&amp;gt; [0, 2, 1, 3]&#xA;[2, 0, 1, 3] -&amp;gt; [1, 2, 0, 3]&#xA;[3, 2, 0, 1] -&amp;gt; [2, 3, 1, 0]&#xA;[4, 3, 2, 0, 1] -&amp;gt; [3, 4, 2, 1, 0]&#xA;[1, 2, 4, 0, 3] -&amp;gt; [3, 0, 1, 4, 2]&#xA;[2, 4, 0, 3, 1] -&amp;gt; [2, 4, 0, 3, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Bonus&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I will award a +100 bounty to the first person to design and explain an algorithm that solves this problem using &lt;code&gt;O(n)&lt;/code&gt; time and &lt;code&gt;O(1)&lt;/code&gt; space.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I think my explanation was rather poor. How can I make this more clear?&lt;/li&gt;&#xA;&lt;li&gt;Is this a dupe?&lt;/li&gt;&#xA;&lt;li&gt;Is the bonus a good idea? (I really want to hear the answer because I don't know if this is even possible!)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="69054" LastEditorUserId="69054" LastEditDate="2017-06-22T14:28:58.070" LastActivityDate="2017-06-22T14:28:58.070" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="13051" PostTypeId="2" ParentId="13029" CreationDate="2017-06-22T15:16:15.393" Score="3" Body="&lt;h1&gt;Dates and Miliseconds: no, definitely not&lt;/h1&gt;&#xA;&lt;p&gt;On date objects or any clock measured in miliseconds, I'd say &amp;quot;if used once&amp;quot; (i.e. as a sufficiently random seed to a seeded PRNG), but not for repeated actions.  So, no.&lt;/p&gt;&#xA;&lt;h1&gt;Nanos: ...maybe&lt;/h1&gt;&#xA;&lt;p&gt;If grabbing &lt;em&gt;nanos&lt;/em&gt; then I'd say it's &lt;em&gt;probably&lt;/em&gt; fine. But I'd give it a good, hard squint and check the results.&lt;/p&gt;&#xA;&lt;p&gt;Individual instructions generally take more than a handful of nanos and while I might be able to write a function that could produce non-random results while using values from &lt;code&gt;System.nanoTime()%N&lt;/code&gt; it would be &lt;em&gt;very&lt;/em&gt; hard, as if the OS switches the thread to a different core, pauses its execution for another thread momentarily...or anything else in that vane, that pattern would get interrupted and those operations aren't ones that I could predict.  And &lt;em&gt;that&lt;/em&gt; &lt;strong&gt;might&lt;/strong&gt; be sufficiently random.&lt;/p&gt;&#xA;&lt;p&gt;Would need investigation.&lt;/p&gt;&#xA;" OwnerUserId="47990" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-22T15:16:15.393" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13053" PostTypeId="1" CreationDate="2017-06-22T16:47:01.230" Score="2" ViewCount="192" Body="&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12924/are-objects-in-haskell-valid-if-there-is-no-input&quot;&gt;Are objects in Haskell valid if there is no input?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/127326/61980&quot;&gt;This answer&lt;/a&gt; prompted a question that I've wondered for a while so I could answer &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11924/new-users-guides-to-golfing-rules-in-specific-languages&quot;&gt;New users' guides to golfing rules in specific languages&lt;/a&gt;, which is what exactly constitutes a full program, function, and snippet in Mathematica (more accurately, the Wolfram Language).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In Mathematica, &lt;a href=&quot;https://reference.wolfram.com/language/tutorial/EverythingIsAnExpression.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;everything is an expression&lt;/a&gt;. There are atomic expressions like numbers, strings, images, etc., and there are compound expressions (not to be confused with &lt;a href=&quot;https://reference.wolfram.com/language/ref/CompoundExpression.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;CompoundExpression&lt;/code&gt;&lt;/a&gt;) of the form &lt;code&gt;f[x, y, ...]&lt;/code&gt;, where &lt;code&gt;f&lt;/code&gt;, &lt;code&gt;x&lt;/code&gt;, &lt;code&gt;y&lt;/code&gt;, etc. are arbitrary expressions. For example consider the following program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x = Input[];&#xA;x++;&#xA;Print[x]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is just syntactic sugar for the following expression:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;CompoundExpression[Set[x, Input[]], Increment[x], Print[x]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In fact, the following would evaluate to &lt;code&gt;True&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hold[x = Input[];&#xA;x++;&#xA;Print[x]] == Hold[CompoundExpression[Set[x, Input[]], Increment[x], Print[x]]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;All it means to run a Mathematica program is to evaluate it as an expression, and I guess you could say that the return value is whatever the expression evaluates to (not to be confused with &lt;a href=&quot;http://reference.wolfram.com/language/ref/Return.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;Return&lt;/code&gt;&lt;/a&gt;). Now &lt;em&gt;any&lt;/em&gt; Mathematica expression could be used as the head of a compound expression, even the above program. So how does this relate to our definitions of full program or function?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10757/61980&quot;&gt;accepted answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10756/full-program-in-clojure&quot;&gt;Full program in Clojure&lt;/a&gt; says that &quot;A full program is anything that can be compiled/interpreted on its own, usually from a standalone file, using any pre-existing compiler/interpreter.&quot; Every (syntactically valid) Mathematica expression satisfies this (there is no boiler plate, just save the expression to a &lt;code&gt;.wl&lt;/code&gt; file an &lt;code&gt;Get&lt;/code&gt; it in Mathematica or run it from command line). Conversely, everything we would call a Mathematica program is an expression, so it seems full program = expression.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8738/61980&quot;&gt;accepted answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8737/what-even-is-a-function-by-our-standards&quot;&gt;What even is a “function” by our standards?&lt;/a&gt; says that a function &quot;is a section of code, which can be directly inserted into a program with no modification, and should be able to be assigned/named/referred to in some way. It should be able to run independent of surrounding code. It should be able to take input/output in some form.&quot; Again, any Mathematica expression fits the bill. For example, we could do the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f := (x = Input[]; x++; Print[x])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then we could pass in arguments as &lt;code&gt;f[x, y, ...]&lt;/code&gt;. In this example, the arguments would be ignored and the user would be prompted for input when the evaluator got to &lt;code&gt;Input[]&lt;/code&gt;, but that's not the point. There is absolutely no difference between which pieces of Mathematica code can be named, used as a function, passed as an argument, interpreted as a standalone program, etc. And this isn't just a quirk of the language, this is an essential part of the Mathematica paradigm.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, what even is a snippet? I see references to &quot;REPL snippets&quot; (e.g. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4783/61980&quot;&gt;here&lt;/a&gt;), but the only formal definition I've seen is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2423/61980&quot;&gt;this answer&lt;/a&gt;, which seems more specific than how the term is commonly used. For example, the question that led to this post was whether &lt;code&gt;$SystemWordLength&lt;/code&gt; was a valid submission or if it was just a REPL snippet, which it doesn't seem to be.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So what exactly do these terms mean with respect to Mathematica?&lt;/p&gt;&#xA;" OwnerDisplayName="user61980" LastActivityDate="2017-06-22T16:52:09.530" Title="Full programs, functions, and snippets in Mathematica" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13054" PostTypeId="2" ParentId="13053" CreationDate="2017-06-22T16:47:01.230" Score="2" Body="&lt;p&gt;It seems to me that for Mathematica (and potentially other languages), the function/program distinction for any given code isn't intrinsic to the code, but depends on how you use the code to satisfy a question's spec. If evaluating &lt;code&gt;code&lt;/code&gt; on its own gives the correct output (asking the user for input if appropriate), then we call it a full program solution (&lt;code&gt;code&lt;/code&gt; could be used as the head of an expression, but it most likely wouldn't satisfy the spec). Likewise, if you must evaluate &lt;code&gt;code[x, y, ...]&lt;/code&gt; where &lt;code&gt;x&lt;/code&gt;, &lt;code&gt;y&lt;/code&gt;, &lt;code&gt;...&lt;/code&gt;, are the input in order to get the correct output, then we call it a function solution (you could evaluate &lt;code&gt;code&lt;/code&gt; on its own without using it as the head of an expression, but it most likely wouldn't satisfy the spec).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would say that &lt;code&gt;$SystemWordLength&lt;/code&gt; is a perfectly valid full program solution to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/127322/is-my-os-32-bit-or-64-bit&quot;&gt;Is my OS 32-bit or 64-bit?&lt;/a&gt;. It's not a snippet since it doesn't expect input to be hardcoded into some variable. Note that it doesn't matter whether we consider it as Mathematica REPL code or a &lt;code&gt;.wl&lt;/code&gt; file run from the command line. In the former case, the evaluated expression is printed implicitly, and in the latter, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9803/61980&quot;&gt;programs are allowed to output using their return value&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerDisplayName="user61980" LastEditorDisplayName="user61980" LastEditDate="2017-06-22T16:52:09.530" LastActivityDate="2017-06-22T16:52:09.530" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13056" PostTypeId="1" AcceptedAnswerId="13058" CreationDate="2017-06-22T18:06:44.987" Score="4" ViewCount="230" Body="&lt;p&gt;When I first created &lt;a href=&quot;https://github.com/ETHproductions/japt&quot; rel=&quot;nofollow noreferrer&quot;&gt;Japt&lt;/a&gt; I was young and innocent, and I didn't know how to use a command line. So I created the interpreter with HTML and incorporated the JavaScript right into that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As Japt grew up, I added more features, one of which is a set of flags that slightly change the behavior of the program. Because Japt could only be run in the online interpreter, and Japt parses the input as literals (i.e. strings must be wrapped in quotes, arrays in brackets), I just decided to stick flags in the input box.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is where the confusion lies. Japt currently can't be run directly from the command line (I'm working on that), so there's no way to include flags as actual arguments; they have to be part of the input. So the question is, how should we score flags in Japt? (Or perhaps they should not be allowed at all in their current state?)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Side note: flags can appear anywhere in the input, up against any of the input types, except it can't be touching a number on the right side. So you can stick any individual flag after the end of the input, adding two bytes. For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;abc&quot; 123-P&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is parsed as the string &lt;code&gt;&quot;abc&quot;&lt;/code&gt;, the number &lt;code&gt;123&lt;/code&gt;, and the &lt;code&gt;-P&lt;/code&gt; flag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Other than this, I believe flags in Japt work the same as in any other language. You can do e.g. &lt;code&gt;-Pg!&lt;/code&gt;, which will parse as the &lt;code&gt;-P&lt;/code&gt;, &lt;code&gt;-g&lt;/code&gt;, and &lt;code&gt;-!&lt;/code&gt; flags, and you can do e.g. &lt;code&gt;-g3&lt;/code&gt;, which will parse as the &lt;code&gt;-g&lt;/code&gt; flag with an argument of &lt;code&gt;3&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, I couldn't manage to find our current consensus on how flags are scored in other languages, though I believe it's just the number of bytes added to the command to invoke the flags.&lt;/p&gt;&#xA;" OwnerUserId="42545" LastEditorUserId="42545" LastEditDate="2017-06-22T18:08:20.713" LastActivityDate="2017-06-22T18:30:06.023" Title="How to score &quot;command-line&quot; flags in Japt" Tags="|discussion|code-golf|rules|" AnswerCount="1" CommentCount="1" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13058" PostTypeId="2" ParentId="13056" CreationDate="2017-06-22T18:30:06.023" Score="6" Body="&lt;p&gt;The current rules for counting interpreter flags are &lt;a href=&quot;http://meta.codegolf.stackexchange.com/questions/273/on-interactive-answers-and-other-special-conditions/274#274&quot;&gt;hidden in this post&lt;/a&gt;. But yes, you add the bytes by which the command-line invocation grows.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For your case, I'd just add the bytes that need to be added to the input (including any spaces that might be necessary to separate the arguments from actual input), but you might just want to make your interpreter support regular command-line flags to avoid confusion in the future.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2017-06-22T18:30:06.023" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13059" PostTypeId="2" ParentId="2140" CreationDate="2017-06-22T20:01:34.807" Score="0" Body="&lt;h1&gt;Find the maximum number of coprimes in a set&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Inspired by a recent question on Math.stackexchange.com, which I can't find anymore.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Exactly what it says on the tin. You are given a set of integers and you have to create a program (according to the default definitions on meta) that outputs the size of the biggest subset that shares no divisors except for 1.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A set of nonzero positive integers of length &gt;= 2. You can take this input as per the defaults in meta. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Output, print or return  the size of the subset of the input that does not share any divisors except for one. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3 4 5 6 7 8 9 10 11 12 13 14&#xA;7&#xA;&#xA;1 3&#xA;1&#xA;&#xA;2 3 5 7 9&#xA;4&#xA;&#xA;2 3 5 7 11 13&#xA;6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="59530" LastActivityDate="2017-06-22T20:01:34.807" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13060" PostTypeId="2" ParentId="2140" CreationDate="2017-06-22T21:21:52.297" Score="1" Body="&lt;h1&gt;Beat the turing test &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Both you and your bot have to connect to a speed dating chatroom (details below) where you will either be paired up with another bot, or with another human. You get 30 seconds to converse with your partner before you are disconnected, and are presented with the choise of wether you think the person you spoke with is a human or not.&lt;/p&gt;&#xA;&lt;p&gt;This process will be repeated in a round robin fashion for a maximum of 10 minutes, or until everyone has spoken with everyone.&#xA;You will not be paired with your own bot.&lt;/p&gt;&#xA;&lt;p&gt;You will be given an equal number of votes for human/robot, as you will be facing an equal number of each. Both you and your bot will be given the option to change these after the conversations.&lt;/p&gt;&#xA;&lt;br&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Robots get 2 point for fooling a robot, and 5 points for fooling a human. Humans are not awarded any points for correct guesses, but lose 2 points if they are wrong.&lt;/p&gt;&#xA;&lt;br&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bots may the internet aswell as external datafiles&lt;/li&gt;&#xA;&lt;li&gt;Gentleman's rule: Please do not pretend to be a robot. If every human said nothing but &lt;code&gt;Beep beep, I am a robot&lt;/code&gt; it would ruin the challenge for everyone.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;br&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;p&gt;This will be a one-time event on a specific date. There will be a webapp for humans and an API for bots. Until the final date there will be a sandbox site online for testing purposes. I am still undecided on the specifics of the API, and on how long the timespan between posting the challenge and running it should be.&lt;/p&gt;&#xA;&lt;p&gt;I can also run (some) bots locally, communicating on stdin/stdout&lt;/p&gt;&#xA;" OwnerUserId="43037" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-23T22:18:32.990" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13062" PostTypeId="2" ParentId="2140" CreationDate="2017-06-22T21:47:12.090" Score="1" Body="&lt;h1&gt;Repetitive Primes &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base-conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; rel=&quot;tag&quot;&gt;base-conversion&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Repunit&quot; rel=&quot;nofollow noreferrer&quot;&gt;repunit&lt;/a&gt; in any base &lt;code&gt;B&lt;/code&gt; is a number consisting solely of 1s in that base.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to figure out if a repunit of length f &lt;code&gt;N&lt;/code&gt; in base &lt;code&gt;B&lt;/code&gt; is a prime number.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;N &amp;gt;= 2&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;B &amp;gt;= 1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;N&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt; may be taken in any order and in any reasonable method.&lt;/li&gt;&#xA;&lt;li&gt;Output a consistent value to indicate primeness and a different consistent value to indicate compositeness.&lt;/li&gt;&#xA;&lt;li&gt;Programs and functions are acceptable.&lt;/li&gt;&#xA;&lt;li&gt;This is code golf, shortest code in bytes wins.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;B, N =&amp;gt; Result&#xA;&#xA;2, 7 =&amp;gt; prime&#xA;1, 97 =&amp;gt; prime&#xA;10, 19 =&amp;gt; prime&#xA;&#xA;9, 11 =&amp;gt; composite&#xA;20, 10 =&amp;gt; composite&#xA;7, 23 =&amp;gt; composite&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Meta questions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Dupe? Unclear? Too broad? etc.&lt;/li&gt;&#xA;&lt;li&gt;Would this be a better question with a different winning criterion such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;?&lt;/li&gt;&#xA;&lt;li&gt;Should I change the title?&lt;/li&gt;&#xA;&lt;li&gt;Any other constructive criticisms?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="69401" LastEditorUserId="69401" LastEditDate="2017-06-23T22:38:23.233" LastActivityDate="2017-06-23T22:38:23.233" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13064" PostTypeId="2" ParentId="12980" CreationDate="2017-06-22T23:12:53.950" Score="6" Body="&lt;h2&gt;Write a new canonical one&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As k_g suggests, let's sandbox and post a clean, modern largest number question without source restrictions and no score modifier. Then, let's close &lt;a href=&quot;https://codegolf.stackexchange.com/questions/18028/largest-number-printable&quot;&gt;the old one&lt;/a&gt; as a dupe of it&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2017-06-23T06:24:40.103" LastActivityDate="2017-06-23T06:24:40.103" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13065" PostTypeId="1" CreationDate="2017-06-22T23:23:16.397" Score="1" ViewCount="94" Body="&lt;h1&gt;Preface&lt;/h1&gt;&#xA;&lt;p&gt;This question is specifically targeting &lt;code&gt;Java&lt;/code&gt; answers. I have little to no knowledge of any other program languages, though I expect that the questions I raise below will apply to other statically-typed languages as well. This question was &amp;quot;inspired&amp;quot; by &lt;a href=&quot;https://codegolf.stackexchange.com/a/127840/56085&quot;&gt;this PPCG answer&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Java Lambdas&lt;/h1&gt;&#xA;&lt;p&gt;(skip this if you know Java and how Java lambda's work)&lt;/p&gt;&#xA;&lt;p&gt;So, in statically typed languages, everything has a type at compile-time - including lambdas. In Java lambdas are all instances of some &lt;code&gt;interface&lt;/code&gt; which is considered a &lt;code&gt;FunctionalInterface&lt;/code&gt;. An &lt;code&gt;interface&lt;/code&gt; is functional iff it contains only 1 non-&lt;code&gt;default&lt;/code&gt; method. Lambdas for that &lt;code&gt;interface&lt;/code&gt; can then be created implementing that 1 method. For example, below is the (simplified) source code for Java's &lt;code&gt;Function&lt;/code&gt; class:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;public interface Function&amp;lt;T, R&amp;gt; {&#xA;&#xA;    R apply(T t);&#xA;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Lambdas of the type &lt;code&gt;Function&amp;lt;T, R&amp;gt;&lt;/code&gt; can then be implemented like: &lt;code&gt;t -&amp;gt; r&lt;/code&gt;, where &lt;code&gt;t&lt;/code&gt; is the input and &lt;code&gt;r&lt;/code&gt; is the return value. &lt;code&gt;Function&lt;/code&gt; is just one of the many functional interfaces Java provides, others include &lt;code&gt;Predicate&lt;/code&gt;, &lt;code&gt;Consumer&lt;/code&gt;, &lt;code&gt;Supplier&lt;/code&gt;, &lt;code&gt;BiFunction&lt;/code&gt;, etc. In addition, interfaces which already existed but, as of Java 8, fit the definition of functional interfaces (such as &lt;code&gt;Runnable&lt;/code&gt;) can also be implemented as lambdas.&lt;/p&gt;&#xA;&lt;h1&gt;The Question&lt;/h1&gt;&#xA;&lt;p&gt;Every answer posted as a Java lambda that I've seen (up until the one that inspired this question) uses one of the default Java types. &lt;a href=&quot;https://codegolf.stackexchange.com/a/114014/56085&quot;&gt;I myself always specify what type the lambda is, &lt;/a&gt; to avoid any confusion. The question I have now is, can one just arbitrarily write a lambda, with as many parameters required, and submit it, as is done in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/127839/swap-the-two-given-indices/127840#127840&quot;&gt;this answer&lt;/a&gt; (and claim it implements a custom functional interface)?&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Can lambdas be submitted as answers despite requiring an additional class declaration?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Notes&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I &lt;strong&gt;do not&lt;/strong&gt; intend to specifically call out Okx's answer; it just so happens to be the one that spurred me to write this question. As far as I can tell, no community consensus was reached on this issue before they posted it, so don't go flooding their answer with down votes...&lt;/li&gt;&#xA;&lt;li&gt;Of course, you could also just use &lt;a href=&quot;https://github.com/PlutoPowered/InverseY/tree/master/src/main/java/com/gmail/socraticphoenix/inversey/many&quot; rel=&quot;nofollow noreferrer&quot;&gt;a certain lambda library I may or may not have created&lt;/a&gt; and side step this whole issue... and Java isn't going to win any &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges anyway... this kind of feels like a pointless question now... Anyway, thoughts?&lt;/li&gt;&#xA;&lt;li&gt;If this question is a duplicate, I apologize, I couldn't find any other similar questions with the search term: &lt;code&gt;lambda AND class is:question&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56085" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-23T13:35:54.343" Title="Should creating a new lambda class be allowed?" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13066" PostTypeId="2" ParentId="13065" CreationDate="2017-06-22T23:23:16.397" Score="-2" Body="&lt;h1&gt;No.&lt;/h1&gt;&#xA;&lt;p&gt;Lambdas must be of a built-in type (such as &lt;code&gt;Function&lt;/code&gt; in Java).&lt;/p&gt;&#xA;&lt;p&gt;The key distinction, in my eyes, is boilerplate. With a built-in Java lambdas, one only needs the normal code required to get a full, compilable program:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;import java.util.function.BinaryOperator;&#xA;&#xA;public class Test {&#xA;&#xA;    public static void main(String[] args) {&#xA;        BinaryOperator&amp;lt;Integer&amp;gt; add = (a, b) -&amp;gt; a + b;&#xA;    }&#xA;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;However, a custom lambda type requires a &lt;em&gt;full class declaration&lt;/em&gt;, as well as boilerplate, to make it compilable:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;public class Test {&#xA;&#xA;    public static void main(String[] args) {&#xA;        TriFunction&amp;lt;Integer, Integer, Integer, Integer&amp;gt; addThree = (a, b, c) -&amp;gt; a + b + c;&#xA;    }&#xA;    &#xA;    public interface TriFunction&amp;lt;A, B, C, R&amp;gt; {&#xA;        &#xA;        R apply(A a, B b, C c);&#xA;        &#xA;    }&#xA;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;in my opinion, defining a whole new type that is than used in the program (as opposed to a class created only to house the &lt;code&gt;main&lt;/code&gt; method) simply cannot be considered boilerplate.&lt;/p&gt;&#xA;" OwnerUserId="56085" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-22T23:23:16.397" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13067" PostTypeId="1" CreationDate="2017-06-22T23:39:13.397" Score="11" ViewCount="460" Body="&lt;p&gt;For the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8810/2016-moderator-election-qa-questionnaire&quot;&gt;mod election questionnaire&lt;/a&gt;, I asked about a hypothetical situation:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A new-ish user posts a well-posed challenge that quickly gets many&#xA;  answers. An hour later, they edit in a restriction that invalidates&#xA;  most of the existing answers. An experienced user whose answer was&#xA;  invalidated comments that doing this is bad, and rolls back the edit.&#xA;  The poster insists on the change and re-adds it, and the two get into&#xA;  an edit war. Someone flags for moderator attention. What would you do&#xA;  in this situation as a moderator?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Besides conflict resolution, the issue is -- who has the final say on a challenge? Can the poster stick with an unpopular but legal decision? If they say, &quot;downvote all you want, I'm keeping it how I want&quot;, should our community or moderators be able to override that?&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I believe we don't have a real, recent consensus on the matter of&#xA;  challenge ownership. ... It would probably be good to have a clearer picture on the question of challenge ownership though, and we should probably discuss this some time on meta — ideally before the above situation occurs. -- Martin Ender♦&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Please consider the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8810/2016-moderator-election-qa-questionnaire&quot;&gt;answers of the former mod candidates &lt;/a&gt;, which show a lot of thought put into this issue.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2017-06-23T15:02:30.470" Title="Who has the final say on a challenge?" Tags="|discussion|moderation|challenges|" AnswerCount="4" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13068" PostTypeId="2" ParentId="13067" CreationDate="2017-06-23T00:05:03.370" Score="-1" Body="&lt;h1&gt;The Asker&lt;/h1&gt;&#xA;&lt;p&gt;IMHO, the person who asks a question is the one who:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Gets rep from the question&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Went to the trouble of asking the question, and&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Has special powers over the question (can delete or close the question at any rep level),&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Therefore, they should have the final say over what goes in the question (even if it isn't as good as suggested alternatives) as long as it conforms to site policy and meta consensuses (eg. Be Nice, objective winning criteria, etc).  Therefore, they should be the ones with final control over the question.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;That being said, however, if your question could be improved, please do accept the improvements, or your question is likely to be heavily downvoted/closed.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;So, in conclusion, given that the person who asks a question gets/loses rep from it, went to the effort of writing the question, and has special control over the question, they should be the one with final control over the question, with the caveat that the question conforms to site policy and meta consensuses.&lt;/p&gt;&#xA;" OwnerUserId="69331" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-23T00:05:03.370" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="13070" PostTypeId="2" ParentId="2140" CreationDate="2017-06-23T01:25:26.600" Score="0" Body="&lt;h2&gt;Golf a program whose behavior is independent from Peano arithmetic&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a program that doesn't take any input, and whose termination cannot be proved or disproved inside Peano arithmetic. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest byte count wins!&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes apply&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Shortest by count wins&lt;/li&gt;&#xA;&lt;li&gt;You can assume that your program runs in a machine with an unlimited amount of memory.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Tags&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/busy-beaver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;busy-beaver&amp;#39;&quot; rel=&quot;tag&quot;&gt;busy-beaver&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Questions for meta&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a good challenge?&lt;/li&gt;&#xA;&lt;li&gt;Is it a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;I think the same question with a behavior independent of ZF set theory might be interesting as well (see &lt;a href=&quot;http://www.scottaaronson.com/busybeaver.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;this link&lt;/a&gt; for instance), but will attract very different answers; should I post it as a separate challenge?&lt;/li&gt;&#xA;&lt;li&gt;What can be improved? Are the tags ok?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="70708" LastActivityDate="2017-06-23T01:25:26.600" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="13071" PostTypeId="2" ParentId="13067" CreationDate="2017-06-23T01:58:15.327" Score="11" Body="&lt;p&gt;For starters, I'll quote what I said in the election questionnaire:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;There is an important consideration here: does the edit improve the quality of the challenge enough that it's worth invalidating answers? Closing a loophole that allows the challenge to be trivially solved is (usually) good. Disallowing the use of a language or set of languages is (usually) bad.&lt;/p&gt;&#xA;&lt;p&gt;With that in mind, I'd lock the question to prevent further edits until the situation can be resolved. I would then create a chat room for the OP and the editor, explain and link to relevant site policies, and moderate a discussion between them so that they can reach an understanding. Once everything has been cleared up, I'd edit the question in the appropriate way (either keeping or discarding the contentious edit), and unlock it.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Should the OP and the editor not be able to reach an agreement, I believe the best course of action would be to have a meta discussion about it, so that the community could weigh in. Once a consensus has been reached, the challenge should be edited to match the consensus (if needed), and unlocked. Should the edit war continue, re-locking the challenge would be appropriate, as well as other disciplinary actions towards the offending users (e.g. a suspension)&lt;/p&gt;&#xA;&lt;p&gt;While I believe that challenge authors have a significant amount of authority over the content of their challenges, they do not have absolute authority. When there is a dispute between the author and the community, the community should win the dispute. Ultimately, PPCG belongs to the community, not to individual users, so the will of the community should trump the will of an individual if the community has consensus. This is the philosophy that we follow for our meta policies.&lt;/p&gt;&#xA;&lt;p&gt;As always, major edits to challenges that completely change the challenge should be avoided (by both the author and the community), but minor edits that improve the challenge (e.g. fixing spelling and/or grammar issues, adding or improving test cases, removing offensive or flamebaiting content) are acceptable and encouraged.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-23T01:58:15.327" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13072" PostTypeId="2" ParentId="13067" CreationDate="2017-06-23T02:27:18.320" Score="5" Body="&lt;p&gt;The questionnaire you linked had me taking a cautious stance:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This is a tricky one right off the bat. My &lt;em&gt;personal&lt;/em&gt; opinion (which I've&#xA;  only really expressed in the mod chatroom and which I've been meaning to&#xA;  bring up on meta) is that the community should be able to (and should)&#xA;  outweigh the poster of the challenge on certain issues. Clearly if the OP&#xA;  self-vandalizes the question, the community has this right—but &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8788/should-language-specific-code-golf-challenges-be-explicitly-disallowed#comment25158_8788&quot;&gt;how far does&#xA;  this go?&lt;/a&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;[...]&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;My personal opinion? This is comparable to the first question in that it's a&#xA;  question of whether the community should be able to override the original&#xA;  poster of a challenge. Accordingly, my own view is similar: yes, to a certain&#xA;  extent, experienced users should be able to overhaul a new user's challenge.&#xA;  (The problem then becomes: to what extent? That's a discussion for meta.)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That was over a year ago, and accordingly, my opinions have changed. But before&#xA;I go any further, I'd like to make it clear that this is still my personal&#xA;opinion as a normal user of PPCG, and as a moderator I will continue to make&#xA;decisions based on community consensus rather than my views in particular.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The reason I want to make that clarification is that this viewpoint could be&#xA;somewhat contentious. While I previously said, or at least implied, that there&#xA;should be explicit limits to the extent that the community can overhaul&#xA;challenges, I now propose that all challenges be treated as collaborative&#xA;community efforts in which the original author has little to no special formal&#xA;privilege.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Already the tone of this post is starting to sound evocative of the &quot;Stack&#xA;Exchange mission&quot;—the idea that the purpose of Stack Exchange Q&amp;amp;A sites is to&#xA;build a repository of questions and their answers rather than to help their&#xA;users directly. And in the past, I might have run with that idea, but as has&#xA;made itself clear many times over, we are very much &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8350/3808&quot;&gt;not the typical Q&amp;amp;A&#xA;site&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So if we're trying to intentionally distance ourselves from the idea of the&#xA;&quot;standard&quot; Stack Exchange site, why else do I want to retain the concept of&#xA;posts' being a collaborative effort for challenges? (Obviously I'm not arguing&#xA;that solutions to challenges should be freely editable by anyone, but one could&#xA;claim that solutions already are built collaboratively in some ways in that&#xA;comments are very frequently used to suggest improvements.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The reality, as I see it, is that we have nothing to gain by arbitrarily&#xA;granting extra formal power in deciding the rules and terms of a challenge to a&#xA;particular user. On the contrary, there are a plethora of reasons against&#xA;denying this power from the entirety of the site community: the challenge can&#xA;be edited to fit in with site-wide standards that are difficult to objectively&#xA;quantify (unnecessary I/O restrictions or language-specific challenges, for&#xA;example), and ideally (although I concede that this might not always be the&#xA;case) the challenge will end up in a state that best reflects the interests of&#xA;the community as a whole.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But all I've done so far in terms of addressing the original question—&quot;Who has&#xA;the final say?&quot;—is answer with &quot;not the OP.&quot; Inevitably there will be&#xA;disagreements, not just between the OP and the community but among the members&#xA;of the community as well. (In my view, the former should be treated no&#xA;differently than the latter.) The question presupposes that in these cases, an&#xA;absolute authority has to be established to resolve the conflict.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't necessarily think this is the case. I think that collectively, we have&#xA;enough common sense to judge the suitability and overall opinion of a given&#xA;change and act accordingly. This is already basically how meta consensus works,&#xA;and the outstanding culture of suggesting improvements on answers that is&#xA;already in place only further goes to show how good at collaboration the PPCG&#xA;community is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So no, I no longer think there should be explicit limits on the extent of the&#xA;community's reach in terms of editing challenges. There should be soft limits,&#xA;based on common sense guidelines as well as all the complexities of PPCG&#xA;&quot;standards&quot; that can't practically be codified or even put into words. This is&#xA;also why I keep saying that the OP shouldn't have any extra &lt;em&gt;formal&lt;/em&gt;&#xA;privilege—in practice, of course the OP's opinion is going to be treated&#xA;differently for trivial questions that don't really matter or details&#xA;particular to the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sorry for the rant/wall of text, but as I mentioned way back in the&#xA;questionnaire, this is a topic long overdue for discussion and one that I've&#xA;kept quiet about for quite a while.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2017-06-23T02:27:18.320" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13073" PostTypeId="2" ParentId="13065" CreationDate="2017-06-23T05:23:53.623" Score="6" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All well-specified questions define their inputs and the outputs.  This is effectively defining your interface.  Requiring it is like requiring the code the runs your submission.&lt;/li&gt;&#xA;&lt;li&gt;All lambdas that require primitive types (unboxing doesn't work in their case) would need to declare their interface&lt;/li&gt;&#xA;&lt;li&gt;If you &lt;em&gt;really&lt;/em&gt; want to get technical, &lt;a href=&quot;https://github.com/TomasMikula/EasyBind/blob/master/src/main/java/org/fxmisc/easybind/EasyBind.java&quot; rel=&quot;nofollow noreferrer&quot;&gt;EasyBind&lt;/a&gt; has functional interfaces for up to 6 inputs, and I would simply need to indicate in my submission that it implements that interface.  (I don't really like this, but it is the natural extension of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12747/20198&quot;&gt;this meta post&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-23T05:23:53.623" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13076" PostTypeId="2" ParentId="2140" CreationDate="2017-06-23T10:26:06.797" Score="0" Body="&lt;p&gt;&lt;strong&gt;Iterate over all sets&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(This question needs fixing so that the output size is not too large)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider all possible pairs of sets of integers (can have positive, negative and zero values) &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt; such  that &lt;code&gt;|A| = |B| = 7&lt;/code&gt;.  Define the set &lt;code&gt;T_{A,B} = {a * b | a in A, B in B}&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is to iterate over all pairs of sets &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt; so that &lt;code&gt;|T_{A,B}| &amp;lt; 19&lt;/code&gt; and the largest absolute value of an integer in &lt;code&gt;A&lt;/code&gt; or &lt;code&gt;B&lt;/code&gt; is at most &lt;code&gt;128&lt;/code&gt;.  As an example of one such pair of sets, &lt;code&gt;A = B = {2^i | for i in {1,...,7}}&lt;/code&gt;.   &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;What should my code output?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code should output the pairs of sets &lt;code&gt;A, B&lt;/code&gt; along with &lt;code&gt;|T_{A,B}|&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = {2,4,8,16,32,64,128}, B = {2,4,8,16,32,64,128}, |T_{A,B}| = 13.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Running time&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't care how long your code takes to run except you must run your answer to completion before posting an answer.&lt;/p&gt;&#xA;" OwnerDisplayName="user9206" LastActivityDate="2017-06-23T10:26:06.797" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13077" PostTypeId="2" ParentId="12877" CreationDate="2017-06-23T13:33:46.957" Score="-16" Body="&lt;h1&gt;All &lt;em&gt;builtins&lt;/em&gt; used must have existed before the challenge&lt;/h1&gt;&#xA;&lt;p&gt;By builtin, I mean:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An instruction that is a part of a language's implementation&lt;/li&gt;&#xA;&lt;li&gt;A single function/method/procedure that exists in a language's standard library&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For clarity &amp;quot;the language&amp;quot; refers to the language being used to answer the question / solve the challenge.&lt;/p&gt;&#xA;&lt;h3&gt;Explanation&lt;/h3&gt;&#xA;&lt;p&gt;Now, this may sound like what we already do, but allow me to clarify: all builtins used in an answer must have existed before the challenge &lt;em&gt;either in another language or in the language's spec&lt;/em&gt;. This means that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the builtin is already well-defined (conceptually) in the language's spec, but just needs to be implemented in the language, then it would be legal to implement the builtin and use it (this would also apply to builtins that require bug fixing - one's which do not behave as described by the spec)&lt;/li&gt;&#xA;&lt;li&gt;If the builtin exists in some form in another language, it can be implemented into the language and then used on other challenges&lt;/li&gt;&#xA;&lt;li&gt;If a language is newer than the question, all the builtins used to answer the question, in that language, must have existed (either in the language's spec or in another language) before the challenge was created&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Advantages&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Not very restrictive&lt;/strong&gt;: consider languages like Matematica, famous for having too many builtins for too many stuff, or languages like Java, with expansive standard libraries. Furthermore, there are simply many, many languages in existence, all with a different combination of builtins. That means that all/most general purpose builtins are covered by this rule, as well as many, many more specific ones (like Matematica's CellularAutomata, for example)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Objective&lt;/strong&gt;: PPGC really likes its objective rules &amp;amp; scoring methods, and this rule would be one of those. It can be directly &lt;em&gt;proven&lt;/em&gt; by pointing to a spec that was posted before the challenge or to a builtin that was included in another language before the challenge.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Good estimate of what we want&lt;/strong&gt;: obviously, it would be easiest and most accurate to just say &amp;quot;don't be unfair, and don't use builtins specifically designed to answer a specific challenge&amp;quot; but that's awfully subjective. The goal then, is to find an objective rule that provides a good (if slightly rough around the edges) estimation of that goal. This rule is just that. You'd be hard-pressed to find a builtin that completely solved many of the non-trivial challenges on this site, in any language, but with the wide range of builtins out there, very few builtins that would &lt;em&gt;improve&lt;/em&gt; the language would be restricted by this rule&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Disadvantages&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Could be abused&lt;/strong&gt;: a scenario could be envisioned where people pick and choose the best sequence of builtins for any challenge, implement them into a language, and then solve it. However, I feel this is basically what code-golfing is anyway - selecting the right series of builtins. It may be made slightly easier by the ability to choose any builtins, but in most cases doing this would probably on put answers on par with Jelly and the like, and not only that, but it would also require quite a bit of effort (updating a language for every challenge), and would probably be considered in the vein of MetaGolfScript, and thus would be downvoted and banned by loopholes such as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5076/56085&quot;&gt;this one&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1071/56085&quot;&gt;this one&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Difficult to find rule &lt;em&gt;breakers&lt;/em&gt;&lt;/strong&gt;: as stated in the advantages section, it is particularly objective to prove when an answer &lt;em&gt;follows&lt;/em&gt; this rule, however, on the other hand, it is rather difficult to prove when an answer &lt;em&gt;does not&lt;/em&gt; follow this rule. This is due to the massive number of languages in existence, the massive number of functions in their various libraries, etc. However, my argument here is that if an answer comes under scrutiny for potentially breaking this rule, then it either 1) is breaking the rule, or 2) is using an extremely specific builtin (which may or may not have existed before the challenge), implemented after a challenge was created, to make solving it trivial - and would thus be against what we want to accomplish anyway.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Summary&lt;/h3&gt;&#xA;&lt;p&gt;All builtins used in an answer must have existed before the challenge, either in another language, another language's standard libraries, or in the language's (being used to answer the challenge) specification. An answer should be considered breaking this rule if it has implemented an overly specific builtin that cannot be found in any other language, or if it cannot easily point to an implementation/specification of this builtin that was implemented/created before the challenge was posted.&lt;/p&gt;&#xA;" OwnerUserId="56085" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-23T13:33:46.957" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13078" PostTypeId="2" ParentId="13067" CreationDate="2017-06-23T15:02:30.470" Score="0" Body="&lt;h2&gt;As long as the post is signed with the OP's name: the OP&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Maybe it sounds a bit harsh, but I don't want to see my (user)name in prominent position under any post that I don't agree with. Yes, on principle. It should be mandatory to make the post a community wiki before deciding against the OP.&lt;/p&gt;&#xA;" OwnerUserId="34531" LastActivityDate="2017-06-23T15:02:30.470" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13080" PostTypeId="2" ParentId="2140" CreationDate="2017-06-23T18:51:29.870" Score="0" Body="&lt;h1&gt;Code golf the Fast growing hierarchy (fgh)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;if your not familiar with the fgh you migth want to check out this explantion: &lt;a href=&quot;http://archive.is/QffmL&quot; rel=&quot;nofollow noreferrer&quot;&gt; Large Numbers, Part 3: Functions and Ordinals&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;and these value aproximations: &lt;a href=&quot;http://googology.wikia.com/wiki/Fast-growing_hierarchy#Approximations&quot; rel=&quot;nofollow noreferrer&quot;&gt;Fast growing hierarchy Approximations&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;the goal this code golf is to golf the following functions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;the exact value of f&lt;sub&gt;ω&lt;/sub&gt;(x) this means you can't golf the ackermann function&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;the growth rate of f&lt;sub&gt;ω2&lt;/sub&gt;(x)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;the growth rate of f&lt;sub&gt;ω&lt;sup&gt;2&lt;/sup&gt;&lt;/sub&gt;(x)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In any language of your chose.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a code golf so the smallest program that defines each of these functions wins (&lt;strong&gt;Note&lt;/strong&gt;:the functions are allowed to call each other). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is also allowed to ask for an input x and output the 3 function values in any order.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Tags&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/busy-beaver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;busy-beaver&amp;#39;&quot; rel=&quot;tag&quot;&gt;busy-beaver&lt;/a&gt;,&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/growth-rate-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;growth-rate-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;growth-rate-golf&lt;/a&gt;,&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;,&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/recursion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;recursion&amp;#39;&quot; rel=&quot;tag&quot;&gt;recursion&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox notes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'm not sure on which functions should be the target but these functions seem challenging yet golf-able in less than 150 bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Upon closer inspection I realized that f&lt;sub&gt;ω&lt;sup&gt;2&lt;/sup&gt;&lt;/sub&gt;(x) is probably to easy since it can be golfed with something like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f(x,a...) {&#xA;    for i in range(a.length) {&#xA;        if(a[i] != 0) { //first non zero&#xA;            Arrays.fill(a, 0, i, x); //replace 0's with x&#xA;            a[i]--; //decrement a[i]&#xA;            return f^x(x,a);&#xA;        }&#xA;    }&#xA;    //all zeros&#xA;    return x+1;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;f(x,n)&lt;/code&gt; &gt; f&lt;sub&gt;n&lt;/sub&gt;(x) &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;f(x,0,n)&lt;/code&gt; &gt; f&lt;sub&gt;ωn&lt;/sub&gt;(x) &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;f(x,0,0,n)&lt;/code&gt; &gt; f&lt;sub&gt;ω^n&lt;/sub&gt;(x) &lt;/p&gt;&#xA;&#xA;&lt;p&gt;so &lt;code&gt;f(x,0,...,0,x)&lt;/code&gt; (x zeros) ~= f&lt;sub&gt;ε&lt;sub&gt;0&lt;/sub&gt;&lt;/sub&gt;(x)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any other tags?&#xA;Suggestions?&#xA;Does this interest you?&lt;/p&gt;&#xA;" OwnerUserId="63550" LastEditorUserId="63550" LastEditDate="2017-06-24T07:42:44.037" LastActivityDate="2017-06-24T07:42:44.037" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13083" PostTypeId="1" CreationDate="2017-06-24T02:30:59.350" Score="4" ViewCount="193" Body="&lt;p&gt;Lately I've been trying to get into Haskell golfing.  And its been great fun.  However I have found myself asking a lot of questions into The Nineteenth Byte (&lt;a href=&quot;https://chat.stackexchange.com/transcript/message/38336850#38336850&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/38212032#38212032&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=38141287#38141287&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=37979577#37979577&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/37717864#37717864&quot;&gt;5&lt;/a&gt;).  I've also seen people asking for tips in languages I don't know (I only know python so thats a long list).  In my experience these types of golfing tips questions, don't really get any responses.  They generally get buried very quickly by the chatter that is characteristic of TNB.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I feel that it is kind of a shame that there is no real place to get good golfing tips or ask short golfing questions on the programming puzzles and &lt;em&gt;code-golf&lt;/em&gt; stack exchange.  I have begun to think that it might be a good idea to create a new chat room just for tips in golfing, so that users can ask for simple tips away from the deafening noise of TNB.  Now I have enough rep to do this myself, I'm not asking for permission, but I would like to know what the community thinks about adding a room just for tips on golfing.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-06-24T03:49:23.257" Title="Would a golfing tips chat room be a good idea?" Tags="|discussion|chat|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="13084" PostTypeId="2" ParentId="13083" CreationDate="2017-06-24T03:35:39.920" Score="6" Body="&lt;p&gt;There's &lt;a href=&quot;https://chat.stackexchange.com/rooms/30617/code-golfers-corner&quot;&gt;Code Golfer's Corner&lt;/a&gt;, which is meant to discuss code golf and tips for golfing code. It seems to be pretty inactive though, so that may not be the best solution.&lt;/p&gt;&#xA;" OwnerUserId="53551" LastEditorUserId="53551" LastEditDate="2017-06-24T03:49:23.257" LastActivityDate="2017-06-24T03:49:23.257" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13090" PostTypeId="1" AcceptedAnswerId="13091" CreationDate="2017-06-25T10:36:37.523" Score="14" ViewCount="458" Body="&lt;p&gt;If a challenge is tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, do you really have to say that that is the winning criteria in the question? It seems pretty obvious, just by looking at the tags, right? After all, we don't say &amp;quot;this is a discussion&amp;quot; on questions tagged with &lt;a href=&quot;/questions/tagged/discussion&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt;, do we?&lt;/p&gt;&#xA;&lt;p&gt;However (just playing devil's advocate here), if you don't explicitly state how to chose a winner, people may not notice, leading to a whole lot of confusion as to why someone's post has been closed and did people not actually notice this and so on and so forth.&lt;/p&gt;&#xA;&lt;p&gt;If a question looks something like this&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Easy Prime Question&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/prime&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;prime&amp;#39;&quot; rel=&quot;tag&quot;&gt;prime&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Write a program that outputs a prime number.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Does the obligatory &amp;quot;Shortest code wins&amp;quot; really have to be included, along with the code golf tag?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-05-10T16:26:41.453" Title="Does the OP have to explicitly state the winning criteria?" Tags="|discussion|support|asking-questions|winning-criteria|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13091" PostTypeId="2" ParentId="13090" CreationDate="2017-06-25T10:42:39.913" Score="15" Body="&lt;h1&gt;Yes, the winning criterion needs to be specified in the challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;First, tags like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; where the winning criterion is obvious in theory. You're right that it's probably not entirely necessary, but especially with newer users it's often not clear whether they just picked a suggested tag without even being aware of the concept of winning criteria. To avoid that doubt, and so that people don't have to scan the tags to get the full specification of the challenge, the winning criterion should be mentioned in the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regardless of obvious winning criteria like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, something like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; &lt;em&gt;absolutely&lt;/em&gt; needs the winning criterion specified in the challenge. For the latter it's not clear just from the tag how exactly the challenge will be scored. Timing on a given test input? Largest test input that can be done within a given time? Who is going to measure the submissions how? Etc...&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2017-06-25T10:42:39.913" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13092" PostTypeId="2" ParentId="13035" CreationDate="2017-06-25T10:50:05.553" Score="2" Body="&lt;h1&gt;Close it!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A very short answer, but I don't think anything else is necessary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's nothing special about that question, and it should be closed due to the lack of an objective winning criterion.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;The question about whether or not pop-cons are a good thing is an entirely different discussion. Personally, I would like more &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; challenges, but the current consensus is that such questions should be closed.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="31516" LastActivityDate="2017-06-25T10:50:05.553" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13094" PostTypeId="2" ParentId="13029" CreationDate="2017-06-25T15:56:42.790" Score="14" Body="&lt;h2&gt;Yes, for code golf purposes assuming a single random value is required&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Selecting a random number is usually not an important part of a golfing challenge, having different results on different runs might be, but usually a random selection once per run is sufficient.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This approach would not work for multiple random values in the same run, but if you have to select one random value per script execution, current seconds/milliseconds should be sufficient.&lt;/p&gt;&#xA;" OwnerUserId="9365" LastEditorUserId="9365" LastEditDate="2017-06-29T14:22:45.047" LastActivityDate="2017-06-29T14:22:45.047" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13095" PostTypeId="2" ParentId="2140" CreationDate="2017-06-25T16:31:33.033" Score="1" Body="&lt;h1&gt;Monopoly KoTH&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot;&gt;python&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This is going to take me a while to finish and may never be fully done. Don't expect this to be posted anytime soon. However, this will be an ongoing project under development.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Who hasn't heard of Monopoly? If not, don't worry, as I will explain the rules! If you already know the rules, read on, for they may be different in this rendition.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Rules of Monopoly&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Monopoly is played on a board, with 36 different squares, that looks somewhat like this&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/zxXcp.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/zxXcp.jpg&quot; alt=&quot;monopoly board&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For this version, we'll use the original British version, because I'm British and proud of it!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Squares are split into 3 categories:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Property&lt;/strong&gt;. These are the ones with a coloured bar at the top, such as &lt;code&gt;Old Kent Road&lt;/code&gt; or &lt;code&gt;Whitehall&lt;/code&gt;. They also include the 4 stations in the middle of each side, and the utilities (&lt;code&gt;Electric Company&lt;/code&gt; and &lt;code&gt;Water Works&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Bonus Cards&lt;/strong&gt;. These are the squares marked &lt;code&gt;Community Chest&lt;/code&gt; or &lt;code&gt;Chance&lt;/code&gt;. These allow for a player to either receive or lose money, depending on a random card choice.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Special Squares&lt;/strong&gt;. These are the 6 other squares in the board, the 4 corner squares and the taxes (boo!)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Let's look at these categories in a bit more detail.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Property&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Properties are grouped, depending on the colour of said property. Each property has a &lt;code&gt;rent&lt;/code&gt; value that contains the amount that a player must pay to the owner of the property, when they land on that property. If one player owns all of the properties in one colour, the rent for each is doubled.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Players can also buy properties, which is how they own them. Each property also has a price, which is then deducted from the buyer's cash and given to the Bank, in exchange for the property. Stations cost £100 each and all other properties available to buy have their cost written below their square.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Stations' rent increases the more stations that someone owns. In the following progression&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1 Station: Rent = £25&lt;/li&gt;&#xA;&lt;li&gt;2 Stations: Rent = £50&lt;/li&gt;&#xA;&lt;li&gt;3 Stations: Rent = £100&lt;/li&gt;&#xA;&lt;li&gt;4 Stations: Rent = £200&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Utilities' rent depends on the dice roll. If a player owns 1 utility, multiply the roll by 4 and that is the rent. If the player owns both, multiply the roll by 10 to get the rent due.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Properties can be built on. That means that a player builds houses and hotels on them, in order to increase that properties rent. A player can build houses and hotels on a property if&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;it has a coloured bar at the top&lt;/li&gt;&#xA;&lt;li&gt;the player owns all of the properties in the group&lt;/li&gt;&#xA;&lt;li&gt;they have enough money. Each house costs £50 and each hotel costs £100.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Each property can have a maximum of 4 houses. After that, the player must build a hotel. A property can only have 1 hotel on it. Houses and hotels drastically increase the rent of a property, for example £4 (no buildings) to £450 (one hotel).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Bonus Cards&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The name of these are a bit of a misnomer. These are denoted on the board by &lt;code&gt;?&lt;/code&gt; symbols and chests on squares and can either give or take money from you. For this game, we will ignore &lt;code&gt;Get Out of Jail Free&lt;/code&gt; cards and the &lt;code&gt;Goto&lt;/code&gt; cards. The cards can result in a random integer between &lt;code&gt;-1000&lt;/code&gt; and &lt;code&gt;1000&lt;/code&gt; added to your score. If this results in &lt;strong&gt;bankruptcy&lt;/strong&gt; (we'll see this later), so be it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Special Squares&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Go&lt;/strong&gt;. If you land on Go, you get given a £400 reward. If you simply go past it (Mayfair -&gt; Old Kent Road), you get £200. It's also where the pieces begin.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Jail&lt;/strong&gt;. If you roll and land on this square, don't worry, as you don't go to jail. You are &quot;Just Visiting&quot;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Free Parking&lt;/strong&gt;. This is where the taxes go! If you have to pay taxes, either because of the Tax squares or because of a Bonus Card, that money goes to Free Parking. If a player lands on it, they get all the money there!&lt;sup&gt;1&lt;/sup&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Go to Jail&lt;/strong&gt;. This does what it says on the tin. You go straight to Jail. But this time, you're in Jail, not just visiting. You stay in Jail until you roll a double.&lt;sup&gt;1&lt;/sup&gt; After which, game continues as normal. You cannot collect rent while in Jail.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Taxes&lt;/strong&gt;. Super Tax and Income Tax are two squares which charge you £100 and £200, respectively. However, you can regain that money as it goes straight to Free Parking!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Bankruptcy&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In Monopoly, if you run out of money, you are bankrupt. Here, you have two options. You can either mortgage your properties or, if you don't have any, you are out of the game! The last one with any money wins the game and the KoTH!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When you lose, all your properties go to the player who bankrupted you. If that's the Bank by virtue of Bonus Cards, then all your properties are available to be bought again.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Mortgage&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You can mortgage properties in order to get more money if you're in a pinch. Unfortunately, this &quot;deactivates&quot; the property, meaning that you don't get any rent when people land on it. If you have enough money, you can unmortgage a property for 110% of its mortgage value. (£100 -&gt; £110)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Auctions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you land on an unbought property and don't buy it, either because you don't have enough or you just don't want to, the property goes on auction. This means that all players can bid on the property. Bidding starts at £1, which means that a player can, theoretically, get the property for a much lower or higher price than its original price.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Trading&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I am hoping to be able to include trading but this does depend on my ability as a coder. In an ideal world, I will be able to get it working but, unfortunately, this may not happen :(&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;1: I am aware that this changes depending on who you're playing with, but this is how we'll do it in this version.&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules of the KoTH&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I have written (still finishing) a &lt;code&gt;Player&lt;/code&gt; class in Python which contains all of the things that a Monopoly player can do. Your task is to rewrite 2 of the functions that can change your player's behaviour.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While thinking about how to make this KoTH, I listed out the complete process that gives you a chance to change what you do. Let's go over that process! &lt;a href=&quot;https://www.lucidchart.com/documents/view/93771b77-2c00-422d-94c1-33c280129c8c&quot; rel=&quot;nofollow noreferrer&quot;&gt;This flowchart&lt;/a&gt; shows the process for each turn. Green items show the choices that you have to make.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is the text version:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1. Roll dice and move&#xA;2. Is the property owned by the Bank?&#xA;    1. Yes. Nothing happens.&#xA;    2. No. Pay the due rent.&#xA;3. Choice of:&#xA;    1. Buy&#xA;    2. Auction&#xA;4. Choice of:&#xA;    1. Trade&#xA;    2. Build&#xA;    3. Mortgage&#xA;    4. Unmortgage&#xA;    5. Move On&#xA;5. Repeat until bankrupt&#xA;&#xA;Auction&#xA;&#xA;1. Choice of:&#xA;    1. Play the auction&#xA;    2. Don't play the auction&#xA;2. Are you playing the auction?&#xA;    1. Yes.&#xA;        1. Choice of:&#xA;            1. Bid new max&#xA;            2. Skip one round&#xA;            3. Skip all rounds&#xA;            4. 'All in'&#xA;        2. Repeat until 1 player left bidding&#xA;    2. No. Don't do anything.&#xA;&#xA;Trade&#xA;&#xA;1. Choose a player to trade with&#xA;2. Offer properties and/or money&#xA;3. Does the other player agree with the trade options?&#xA;    1. No. They counter offer. Do you like their options?&#xA;        1. No. Do you want to continue negotiating?&#xA;             1. Yes. Go to point 2 above&#xA;             2. No. The trade is over.&#xA;        2. Yes. You trade the agreed upon items.&#xA;    2. Yes. You trade the agreed upon items&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;But, for you coders out there, I'll explain using a bit of code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your submission should contain a single class that inherits from &lt;code&gt;Player&lt;/code&gt;. You may add in as many extra attributes as you want, but in order to be used, &lt;em&gt;your&lt;/em&gt; code must refer to them. I'm not editing the controller just for your bot to work.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, each class must look like this&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;class NameOfPlayer(Player):&#xA;    def turn(self, square, roll):&#xA;        (code that determines your actions per turn)&#xA;    def auction_action(self, price, bidders):&#xA;        (code that determines your auction actions)&#xA;    def trade_actions(self, players, last_offer):&#xA;        (code that determines your trading actions)&#xA;&#xA;    (any other functions you want)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your &lt;code&gt;turn&lt;/code&gt; function will return 3 numbers as a list e.g. &lt;code&gt;[1,2,3]&lt;/code&gt; which are the results of the choices above. The first item should be either &lt;code&gt;1&lt;/code&gt; or &lt;code&gt;2&lt;/code&gt; (Buy or Auction), the second should be one of &lt;code&gt;1&lt;/code&gt;,&lt;code&gt;2&lt;/code&gt;,&lt;code&gt;3&lt;/code&gt;, &lt;code&gt;4&lt;/code&gt; or &lt;code&gt;5&lt;/code&gt; (of the &lt;code&gt;4. Choice of:&lt;/code&gt; options) and the third should be either &lt;code&gt;1&lt;/code&gt; (play the auction) or &lt;code&gt;0&lt;/code&gt; (don't play the auction) such as &lt;code&gt;[1,5,0]&lt;/code&gt; would buy the property, move on to the next player and not play the auction on this turn (doesn't matter as there wasn't an auction).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your &lt;code&gt;auction_action&lt;/code&gt; function will return either a number (your bid) or one of &lt;code&gt;a&lt;/code&gt; (all in), &lt;code&gt;s&lt;/code&gt; (skip this round) or &lt;code&gt;q&lt;/code&gt; (quit auction), which determines what you will do on that round of the bidding. This continues until either you quit the auction of you are the only one left.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your &lt;code&gt;trade_actions&lt;/code&gt; function will return a list every time it is called. The list consists of &lt;code&gt;[agree with previous offer (as a bool), properties to trade (as a list), cash to trade (as an int)]&lt;/code&gt;. When a trade has just begun, the first item in the list will be ignored and the &lt;code&gt;last_offer&lt;/code&gt; parameter will be ignored. The &lt;code&gt;last_offer&lt;/code&gt; parameter contains the second 2 items returned by the person you are negotiating with, so that you can decide whether you want to continue trading or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you lose all your money, your program with be taken out of the active players and placed into the results table. The last one standing wins!&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2017-06-26T17:06:29.897" LastActivityDate="2017-06-26T17:06:29.897" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="13097" PostTypeId="1" CreationDate="2017-06-25T20:43:32.407" Score="4" ViewCount="136" Body="&lt;p&gt;I think the grace period limit of 5 minutes that merges edit events is too long. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is adequate for a site like Stack Overflow, but not for a Code Golf site, as edits are more frequent and each edit has more significance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What do you think?&lt;/p&gt;&#xA;" OwnerUserId="29325" LastActivityDate="2017-06-25T20:43:32.407" Title="Edit grace period" Tags="|discussion|editing|" AnswerCount="0" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="13101" PostTypeId="2" ParentId="2140" CreationDate="2017-06-26T23:28:25.033" Score="0" Body="&lt;h1&gt;Just One More Time &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that will run without error once, but will crash when run for the second time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you are writing a function, you may assume the function will be run twice within the same interpreter session or program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you are writing a program, you may assume the machine will not be rebooted between runs.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in each language wins.&lt;/p&gt;&#xA;" OwnerUserId="69054" LastActivityDate="2017-06-26T23:28:25.033" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13105" PostTypeId="1" AcceptedAnswerId="13223" CreationDate="2017-06-27T09:59:29.570" Score="18" ViewCount="158" Body="&lt;p&gt;Many times I have had answers and found out they were invalid due to a obscure meta post. But people have said things like: &quot;This is the 3rd time people have done this and it is still not funny&quot;, &quot;This is &lt;em&gt;still&lt;/em&gt; invalid just like the other removed answers&quot;. I can't see those answers and I believe ~500+ should be able to see removed answers to help avoid this. BUT they can't see who made this answer.&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="68942" LastEditDate="2021-06-05T23:58:57.020" LastActivityDate="2021-06-05T23:58:57.020" Title="Allow lower reps to see removed answers" Tags="|feature-request|status-declined|" AnswerCount="1" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="13107" PostTypeId="1" AcceptedAnswerId="13111" CreationDate="2017-06-27T12:32:11.780" Score="10" ViewCount="444" Body="&lt;h3&gt;Preface&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I've 'failed' twice at this whole golf language design thing, once with &lt;a href=&quot;https://github.com/SocraticPhoenix/JAISBaL&quot; rel=&quot;nofollow noreferrer&quot;&gt;JAISBaL&lt;/a&gt; and again with &lt;a href=&quot;https://github.com/SocraticPhoenix/Clack&quot; rel=&quot;nofollow noreferrer&quot;&gt;Clack&lt;/a&gt;. Now that I've had a go twice, I am obviously an expert and am attempting to design the perfect golfing language. One of the things in particular that annoys me about Clack, JAISBaL, Jelly, APL, etc. is the fact that they have some wonderfully strange characters. Not only can they be difficult to type (Jelly being the exception here), but I prefer just seeing some ASCII source code. Therefore, before I create my new language, I'm designing a character encoding. The standard character encoding, is of course, just a code page, but my encoding is a little different.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The Encoding&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The idea is that the encoding only uses ASCII characters, but certain 2-character pairs are encoded as one byte. For example, &lt;code&gt;a-zA-Z&lt;/code&gt; are all encoded as one byte, but &lt;code&gt;@&lt;/code&gt;, &lt;code&gt;~&lt;/code&gt; or &lt;code&gt;_&lt;/code&gt; followed by any &lt;code&gt;a-zA-Z&lt;/code&gt; are also encoded as one byte. This means that, with this encoding, &lt;code&gt;@A&lt;/code&gt;, &lt;code&gt;~x&lt;/code&gt; and &lt;code&gt;_r&lt;/code&gt; are all one byte. There's other things that are strange to, such as &lt;code&gt;&quot;&lt;/code&gt; changing the behavior of the encoding itself, rather than just beginning a string, and the fact that &lt;code&gt;~@_&lt;/code&gt; won't actually have there own bytes in the encoding, but will only serve as prefixes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Encoding specification draft (may need refinement):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a-z A-Z = 52 bytes&#xA;&#xA;~ @ _ = 156 bytes&#xA;&#xA;`!#$%^&amp;amp;*()-+={}[]:;'&amp;lt;&amp;gt;,.?/\|1234567890  = 38 bytes&#xA;&#xA;\n \t space = 3 bytes&#xA;&#xA;&quot;0 &quot;1 &quot;2 &quot;3&#xA;&quot;r &quot;c &quot;g = 7 bytes&#xA;&#xA;---------------------------------------------------&#xA;&#xA;a-z, A-Z and `!#$%^&amp;amp;*()-+={}[]:;'&amp;lt;&amp;gt;,.?/\|1234567890 &#xA;will each be represented by a single byte.&#xA;&#xA;~ @ and _ will be prefixes, each can be followed by &#xA;any of a-z A-Z, each of these pairs will be encoded&#xA;with a single byte.&#xA;&#xA;\n \t and space will each be represented by a single&#xA;byte.&#xA;&#xA;&quot;0 &quot;1 &quot;2 &quot;3 will signify the start of a string, and&#xA;will each be represented as 1 byte:&#xA; - 0, 1, 2, 3 = use escape byte #0, #1, #2, or #3&#xA;&#xA;&#xA;&quot;r &quot;c &quot;g will signify the end of a string and will&#xA;each be represented as 1 byte:&#xA; - r = raw utf8&#xA; - c = compressed&#xA; - g = gzip&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Question&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Basically, is this allowed? Do we have any standards regarding how character encodings work? A loophole had been posted that forbade compression of source code (which this borders on), but it was downvoted &amp;amp; deleted, so I don't think I need to worry about it... UTF8 and the like also don't have a 1 byte = 1 character encoding, but the difference is that &lt;em&gt;every&lt;/em&gt; character in this encoding would be 1 byte, or less than that... Would there be any reason this would be forbidden or banned? Thanks for any help!&lt;/p&gt;&#xA;" OwnerUserId="56085" LastActivityDate="2017-06-27T12:56:46.833" Title="What is a character encoding, exactly?" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="13109" PostTypeId="2" ParentId="7804" CreationDate="2017-06-27T12:43:38.837" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12979/64159&quot;&gt;Is the string ASCIIbetically ordered?&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Seems interesting, but I am not sure if it's a dupe or not.&lt;/p&gt;&#xA;" OwnerUserId="64159" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-27T12:43:38.837" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13110" PostTypeId="2" ParentId="7804" CreationDate="2017-06-27T12:46:48.613" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12728/64159&quot;&gt;Who is the winner?&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;I like the idea of this but I am finding it difficult to write a spec. So if anyone can come up with a better way to run this, please, go ahead!&lt;/p&gt;&#xA;" OwnerUserId="64159" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-27T12:46:48.613" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13111" PostTypeId="2" ParentId="13107" CreationDate="2017-06-27T12:56:46.833" Score="18" Body="&lt;p&gt;Character encodings are just a convenience to make programs more readable if they make use of more than the usual 97 ASCII bytes (printable, plus linefeeds and tabs). At the end of the day, the only thing that matters is &lt;strong&gt;there must be an actual file with the claimed byte count that, when fed to your interpreter, runs the intended program.&lt;/strong&gt; How you interpret the bytes (or bits) in that file as characters is entirely up to you, as is whether you internally or externally provide conversion methods between the unreadable binary file and the readable ASCII-only interpretation of the file.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2017-06-27T12:56:46.833" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13113" PostTypeId="1" CreationDate="2017-06-27T14:05:35.847" Score="10" ViewCount="265" Body="&lt;p&gt;You must be wondering, why is this a so important subject? Well, take the example where a challenge asks you to take a &quot;natural number&quot; as input. What's a natural number? A non-negative integer, or a positive integer? The same would happen with Fibonacci numbers, do we include the 0 or not?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another example would be for a challenge asking you to handle a case where you have to do 0⁰. Does that equal 1 or 0?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In both cases, and generally in a case where a mathematical concept has many accepted definitions and the question doesn't specify which one to use, one would either&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;wonder what definition to follow, or&lt;/li&gt;&#xA;&lt;li&gt;perceive it as &quot;too obvious&quot; and use the definition they see themselves fit.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In the first case, one can simply leave a comment asking the original poster what definition to use. In the second case, they will use a particular definition to make an answer, and then there are many possibilities, so that the definition used can be:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;free for the answerer to choose,&lt;/li&gt;&#xA;&lt;li&gt;the one the original poster intended, or&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;different from the intended definition&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I emphasize on the last case, since there can be the one answer with the wrong definition, or &lt;strong&gt;a swarm of answers with wrong definitions&lt;/strong&gt;, the latter being more difficult to face, so more of a problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;To avoid such cases of ambiguity, what should be done about it?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;P.S. &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/conversation/meta-13113&quot;&gt;This discussion actually arose from a CMC!&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2017-06-27T14:15:29.153" LastActivityDate="2017-06-27T14:21:36.383" Title="What to do about mathematical concepts with different definitions?" Tags="|discussion|policy|asking-questions|" AnswerCount="1" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="13114" PostTypeId="2" ParentId="13113" CreationDate="2017-06-27T14:05:35.847" Score="23" Body="&lt;h1&gt;The challenge poster must specify the intended definition&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;If such a mathematical ambiguity is spotted, leave a comment and vote/flag to close the challenge as &quot;unclear what you're asking&quot;.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The reason why? Well, this is the close reason one should use if they think a question isn't clear enough for them to answer. The closure will prevent such possible swarms of answers being posted, provided the challenge gets closed quickly enough.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So far so good, but &lt;strong&gt;one shouldn't need to deal with such a problem if they post their challenge in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/41024&quot;&gt;Sandbox&lt;/a&gt; first&lt;/strong&gt;, another reason sandboxing is encouraged.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2017-06-27T14:21:36.383" LastActivityDate="2017-06-27T14:21:36.383" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13116" PostTypeId="1" CreationDate="2017-06-27T18:21:16.380" Score="2" ViewCount="95" Body="&lt;p&gt;for code golf challenges, how would bytes be counted for visual programming/patcher languages like puredata?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I thought maybe a system based on the language's saved file size for a patch, but that seems somewhat unfair as those files often contain metadata that isn't  part of the program.&lt;/p&gt;&#xA;" OwnerUserId="70287" LastEditorUserId="8478" LastEditDate="2017-06-27T18:33:20.963" LastActivityDate="2017-06-27T18:33:20.963" Title="Byte count for programs in visual languages" Tags="|discussion|code-golf|scoring|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13117" PostTypeId="2" ParentId="13116" CreationDate="2017-06-27T18:32:54.953" Score="6" Body="&lt;p&gt;&quot;Fairness&quot; isn't really the best measure here, because comparing different languages is generally a futile endeavour anyway unless it's been established that the language's generally have comparable scores in the first place (e.g. C# vs Java or Python vs JavaScript). If you're using a language that is structurally and semantically vastly different from other languages, you shouldn't expect to end up with a comparable score, but instead just try to get the score as low as possible within the given language (and if you're lucky you get some other people using the language to compete against).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So with that out of the way, scoring by file size really is the only viable method to determine a byte count. Metadata gets annoying in these cases, but often it's possible to remove or golf some of that metadata by hand while still keeping the file readable for the language's implementation. If that's possible, you're not required to submit the file as exported by the language, but you can shorten those parts as much as possible. The only important requirement is that the scored file can be correctly processed by the implementation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now of course counting bytes this way is often a bit annoying for visual languages, especially because it can be non-obvious what modifications to the visual program will actually reduce the file size. Often, you'd want to score these by components or similarly. However, it doesn't make sense to do so in a regular &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; competition. &quot;Code golf&quot; means scoring by bytes and nothing else. However, if you can come up with a good and interesting scoring that is closer to the building blocks of your language, you can always write a language-specific &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; challenge, where a problem needs to be solved with this language and the score is tailored specifically to the language at hand. Note that language-specific challenges &lt;em&gt;in general&lt;/em&gt; are frowned upon, but if you have a good reason for limiting the challenge to a single language then go for it (and using a language-specific scoring for a language where counting bytes doesn't make sense seems like a good reason to me). I'd definitely recommend posting such a challenge idea &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;in the sandbox first though&lt;/a&gt; to make sure the scoring is fair and the chosen problem is a good fit for the language.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2017-06-27T18:32:54.953" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13118" PostTypeId="2" ParentId="2140" CreationDate="2017-06-27T20:19:32.737" Score="0" Body="&lt;h1&gt;What Tiles did I have?&lt;/h1&gt;&#xA;&lt;p&gt;Everyone should be aware of the scoring system in a classic board game: &lt;a href=&quot;https://en.wikipedia.org/wiki/Scrabble_letter_distributions&quot; rel=&quot;nofollow noreferrer&quot;&gt;Scrabble&lt;/a&gt;. I remember going back into my old scrabble box and finding some old post-it notes containing old scores. I always wonder what the heck was played for some of the more insane point scores. That gave me the idea for this challenge...&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;English-language editions of Scrabble contain 100 letter tiles, in the following distribution:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;0 points: * x 2 (These are the blank tiles)&lt;/li&gt;&#xA;&lt;li&gt;1 point: E ×12, A ×9, I ×9, O ×8, N ×6, R ×6, T ×6, L ×4, S ×4, U ×4&lt;/li&gt;&#xA;&lt;li&gt;2 points: D ×4, G ×3&lt;/li&gt;&#xA;&lt;li&gt;3 points: B ×2, C ×2, M ×2, P ×2&lt;/li&gt;&#xA;&lt;li&gt;4 points: F ×2, H ×2, V ×2, W ×2, Y ×2&lt;/li&gt;&#xA;&lt;li&gt;5 points: K ×1&lt;/li&gt;&#xA;&lt;li&gt;8 points: J ×1, X ×1&lt;/li&gt;&#xA;&lt;li&gt;10 points: Q ×1, Z ×1&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Your challenge is, given a single integer input between &lt;code&gt;0 and 185&lt;/code&gt;, output a corresponding sequence of scrabble tiles that sum to that score with a length between &lt;code&gt;2 and 100&lt;/code&gt; characters in length.&lt;/p&gt;&#xA;&lt;h1&gt;The Specifics&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The letters don't have to spell anything, they just have to sum to that score.&lt;/li&gt;&#xA;&lt;li&gt;You can only use a tile the number of times it exists (E.G. E can be used 12 times).&lt;/li&gt;&#xA;&lt;li&gt;The shortest word is 2 characters long, for an input of &lt;code&gt;0&lt;/code&gt; you get &lt;code&gt;**&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Outputs will not match between answers, as there are many solutions.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Inputs and Outputs&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input should be a single integer, anything else is wrong.&lt;/li&gt;&#xA;&lt;li&gt;Output should be a single string, with no spaces, order of letters is arbitrary.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Example (Potential Solution)&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;0   | **&#xA;1   | *E&#xA;2   | EE&#xA;[... Pattern Omitted ...]&#xA;12  | EEEEEEEEEEE&#xA;13  | EEEEEEEEEEEA&#xA;[... Pattern Omitted ...]&#xA;68  | EEEEEEEEEEEEAAAAAAAAAIIIIIIIIIOOOOOOOONNNNNNRRRRRRRTTTTTTLLLLSSSSUUUU&#xA;[... Arbitrary Ordering Omitted ...]&#xA;185 | EEEEEEEEEEEEAAAAAAAAAIIIIIIIIIOOOOOOOONNNNNNRRRRRRRTTTTTTLLLLSSSSUUUUDDDDGGGBBCCMMPPFFHHVVWWYYKJXZQ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;,&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/strings&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;strings&amp;#39;&quot; rel=&quot;tag&quot;&gt;strings&lt;/a&gt;: Whomever contacts Cthulhu using the dark arts first wins.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-27T20:27:59.980" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="13120" PostTypeId="2" ParentId="12868" CreationDate="2017-06-27T21:48:22.340" Score="0" Body="&lt;p&gt;First of all: &lt;strong&gt;Welcome to Programming Puzzles &amp;amp; Code Golf!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The vast majority of challenges here are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, and the golfers are very welcoming and supportive. There are various other challenge types here too: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, and others.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You are not expected to know everything before you start, so just go ahead and jump in, and people will link to any applicable rules on Meta as they come up. If you want a head start on this, start from the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1280/community-faq-for-programming-puzzles-code-golf&quot;&gt;FAQ page&lt;/a&gt; and browse through whatever sections are relevant. Many of the rules will only come up rarely, so don't worry about memorising them all up front. You'll pick them up as you go (and no doubt contribute to proposing new ones/changing old ones in time).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As long as you are aware that there are rules out there, and take it as a positive thing when people point them out to you, all should be well. The fact that you are asking this question suggests you already have the right attitude...&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2017-06-27T21:48:22.340" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13123" PostTypeId="2" ParentId="6918" CreationDate="2017-06-28T06:49:01.003" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/NeilAllavarpu/GolfeMatics&quot; rel=&quot;nofollow noreferrer&quot;&gt;GolfeMatics&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;GolfeMatics is a language developed by me, and I am designing it to be focused on math-related problems. The only types in the language are integers, decimals, and soon will also include lists. Booleans are false if they are equal to 0, true otherwise. No one needs strings, so I didn't add them. In fact, the only string-related command is &lt;code&gt;A&lt;/code&gt;, which modulo's the current number by 128 and prints out the corresponding ASCII character. To see how ridiculous this makes this at programs involving strings, look at the &lt;a href=&quot;https://codegolf.stackexchange.com/a/128740/69401&quot;&gt;Hello, World!&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="69401" LastActivityDate="2017-06-28T06:49:01.003" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13124" PostTypeId="2" ParentId="2140" CreationDate="2017-06-28T09:59:20.777" Score="2" Body="&lt;h1&gt;Deep-dichotomize a list&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a list, dichotomize it (i.e. split it in half), then dichotomize both resulting sublists, etc., until you reach sublists of length 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, given &lt;code&gt;[1,2,3,4,5,6,7,8]&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  Dichotomize: [[1,2,3,4],[5,6,7,8]]&#xA;  Map dichotomize: [[[1,2],[3,4]],[[5,6],[7,8]]]&#xA;  Map map dichotomize: [[[[1],[2]],[[3],[4]]],[[[5],[6]],[[7],[8]]]]&#xA;  We end here because we only have singletons&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If the list has an odd length, the longest of the two lists should be the second one. For example, &lt;code&gt;[1,2,3,4,5]&lt;/code&gt; is dichotomized into &lt;code&gt;[[1,2],[3,4,5]]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The content of the list is irrelevant (you can use whatever you want). You can use any list-like representation of your language, as long as both the Input and the Output use the same representation.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input                          Output&#xA;[1]                            [1]&#xA;[1,2]                          [[1],[2]]&#xA;[1,2,3,4]                      [[[1],[2]],[[3],[4]]]&#xA;[1,2,3,4,5,6,7,8,9]            [[[[1],[2]],[[3],[4]]],[[[5],[6]],[[7],[[8],[9]]]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="41723" LastEditDate="2017-06-30T13:24:47.663" LastActivityDate="2017-06-30T13:24:47.663" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="13125" PostTypeId="2" ParentId="2140" CreationDate="2017-06-28T12:19:22.397" Score="0" Body="&lt;h1&gt;Display the Undisplayable&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I have sometimes seen answers to challenges, written in binary machine code. The users who post them usually display them in hexadecimal representation. This representation makes the code extremely long, and does not do them justice!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thus, we should give them help, and I don't care if they don't need it. Your task will to write a program/function/eldritch incantation to &lt;em&gt;turn their beautifully golfed binary code into the shortest possible string of printable characters&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A sequence of random binary data of random length. Use any of the standard IO methods (note to self: find the link to the Meta post).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A sequence of printable characters. Use any of the standard IO methods.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If encoding is relevant, you are free to choose any encoding, provided you &lt;em&gt;clearly indicate which one you used in your answer&lt;/em&gt;. What is relevant is the number of &lt;em&gt;characters&lt;/em&gt; anyway.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Whitespaces (regular space, new line, non-breaking space, form feed, etc.) are considered not printable. They can be added if you wish, but their presence or absence must not impact the decoding of the output.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Conditions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;There must exist a program, that can take any possible output of your program, and turn it back into the input (providing it is not needed, but will be smiley'd at).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If your program is run twice, with 2 inputs of same size, the 2 resulting outputs &lt;em&gt;must&lt;/em&gt; have the same size.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Standard loopholes apply.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Score&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The score is calcaulated as the number of bytes in the input, divided by the number of characters in the output. The higher the better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the score varies depending on the length of the input, take its average over input sizes from 1 to 1024 bytes included (I don't think we'll have answer 1 kb long here).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Giving an answer in a binary language (machine code, LLVM bitcode, etc.) &lt;em&gt;and&lt;/em&gt; adding the output when run with its own binary source will be smiley'd at (but no bonus, unless it can also summon Cthulhu).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Don't forget to explain how your code works!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do you think it's a good idea? Is there already a challenge like this one?&lt;/li&gt;&#xA;&lt;li&gt;Is there any blatant loophole/possible imporvements?&lt;/li&gt;&#xA;&lt;li&gt;What tag(s) do you recommend for this challenge? (please edit the answer)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="71426" LastEditorUserId="71426" LastEditDate="2017-06-28T13:11:41.863" LastActivityDate="2017-06-28T13:11:41.863" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="13126" PostTypeId="2" ParentId="2140" CreationDate="2017-06-28T14:52:25.840" Score="0" Body="&lt;h1&gt;Every Nth Line in Source Outputs N&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Heavily inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/q/128496/65836&quot;&gt;Hello, World! (Every other character)&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Related to my other Sandbox post &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13122/65836&quot;&gt;Every Nth Char in Source Outputs N&lt;/a&gt;; &lt;strong&gt;is it a dupe?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Write a program that outputs &lt;code&gt;1&lt;/code&gt;. When the first, third, fifth, etc. lines are removed, it outputs &lt;code&gt;2&lt;/code&gt;. When all lines where their (&lt;code&gt;1&lt;/code&gt;-based) index in the source, mod &lt;code&gt;N&lt;/code&gt;, are not &lt;code&gt;0&lt;/code&gt;, are removed, it should output &lt;code&gt;N&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;. The winner is the program that works with the largest &lt;code&gt;N&lt;/code&gt;, while working for all &lt;code&gt;n &amp;lt; N&lt;/code&gt; (obviously, to run up to &lt;code&gt;N&lt;/code&gt;, it has to be at least &lt;code&gt;N&lt;/code&gt; lines long). If there is a tie, the winner is the shortest answer that reaches the largest &lt;code&gt;N&lt;/code&gt;. Your program must at least work up to &lt;code&gt;N=2&lt;/code&gt;, since I don't think any languages will struggle with simply printing &lt;code&gt;1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&lt;p&gt;Examples are based off of this sample program:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;test&#xA;hi&#xA;world&#xA;hello&#xA;12345&#xA;System.out.println(test);&#xA;timeout&#xA;let's dance&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For the program to work for &lt;code&gt;N=1&lt;/code&gt;, the original program should output &lt;code&gt;1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For the program to work for &lt;code&gt;N=2&lt;/code&gt;, the following should output &lt;code&gt;2&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;hi&#xA;hello&#xA;System.out.println(test);&#xA;let's dance&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For the program to work for &lt;code&gt;N=3&lt;/code&gt;, the following should output &lt;code&gt;3&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;world&#xA;System.out.println(test);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For the program to work for &lt;code&gt;N=4&lt;/code&gt;, the following should output &lt;code&gt;4&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;hello&#xA;let's dance&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For the program to work for &lt;code&gt;N=5&lt;/code&gt;, the following should output &lt;code&gt;5&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;12345&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;etc.&lt;/p&gt;&#xA;&lt;p&gt;The highest &lt;code&gt;N&lt;/code&gt; this program could work for is its line length, &lt;code&gt;8&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="65836" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-28T14:52:25.840" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13128" PostTypeId="1" CreationDate="2017-06-28T16:30:40.040" Score="38" ViewCount="901" Body="&lt;p&gt;It was recently brought up in chat that people are rewarded for trivial answers sometimes, which makes sense because this site is all about short code, but in other aspects, is bad because some answers that took a lot more work get very few upvotes in comparison.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This might discourage people from taking the time to answer longer and harder questions because although reputation is just a number, it's nice to get some reward, tangible or not, for your hard work.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, to counteract this, what can we do to help promote people answering harder and longer questions?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is similar to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12507/68942&quot;&gt;this meta post&lt;/a&gt; about answering old challenges that get pushed to the bottom and become inactive, but is slightly different in that this post is about long and non-trivial answers that don't get noticed as much.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2017-06-30T16:37:07.307" LastActivityDate="2017-09-28T21:23:34.810" Title="Non-Trivial Answers get too few upvotes" Tags="|discussion|answers|incentives|" AnswerCount="2" CommentCount="17" ContentLicense="CC BY-SA 3.0" />
  <row Id="13129" PostTypeId="2" ParentId="13128" CreationDate="2017-06-28T16:30:40.040" Score="15" Body="&lt;h1&gt;Run a contest&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;The chat room is now open for nominations&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/61232/biweekly-contest-for-undervoted-answers&quot;&gt;https://chat.stackexchange.com/rooms/61232/biweekly-contest-for-undervoted-answers&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This idea is inspired/copied from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/194/peter-taylor&quot;&gt;Peter Taylor&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12540/68942&quot;&gt;answer&lt;/a&gt; to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12507/68942&quot;&gt;linked meta post&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I propose running a contest to reward undervoted answers, as I call them. I envision to run it in a chatroom to avoid cluttering meta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My current idea is to follow these rules:  &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The contest runs biweekly.  &lt;/li&gt;&#xA;&lt;li&gt;Nominate non-trivial answers that don't have a lot of upvotes, and especially those that show that a lot of work was put into them (a short answer isn't necessarily trivial)  &lt;/li&gt;&#xA;&lt;li&gt;The winning answer will be decided by the linked answer with the most stars.&lt;/li&gt;&#xA;&lt;li&gt;Attempting to corrupt the process via bribery and/or blackmail will not be tolerated, and may result in moderator action.  &lt;/li&gt;&#xA;&lt;li&gt;Prizes will be awarded as bounties; the bounty-giver will award a bounty to the winning answer at the end of the contest. The bounty-giver will rotate between those who sign up to be bounty-givers.&lt;/li&gt;&#xA;&lt;li&gt;The bounty is not necessarily a certain amount and will change based on how much effort was put into it, and scales down inversely to its score.  &lt;/li&gt;&#xA;&lt;li&gt;Other users are welcome to make their own selections and award bounties as well.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I have created the chat room &lt;a href=&quot;https://chat.stackexchange.com/rooms/61232/biweekly-contest-for-undervoted-answers&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2017-07-02T17:39:02.453" LastActivityDate="2017-07-02T17:39:02.453" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="13134" PostTypeId="2" ParentId="2140" CreationDate="2017-06-29T01:30:10.150" Score="4" Body="&lt;h3&gt;Let's play Othello (Reversi)! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;h1&gt;Open for takeover&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I don't have the time to devote to this right new, and not for the foreseeable future. Anyone who wants this idea, the post, and any code I have in the repo should comment below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Side note on the code, I have a gorilla repl file in the repo that I can use to run test games on, and get screenshots of during any point of the game. If you want I can make up screenshots for the rules section since I have everything setup on my end for that.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This would be a king of the hill about reversi. Yep. I'm going to write up the post and &lt;s&gt;controller later&lt;/s&gt; &lt;strong&gt;The controller is being written here: &lt;a href=&quot;https://github.com/JJ-Atkinson/reversi-koth-ppcg&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://github.com/JJ-Atkinson/reversi-koth-ppcg&lt;/a&gt;&lt;/strong&gt; , but I'm putting this here so show the idea is taken ;)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Post start&lt;/h3&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(you can probbably skip this if you've played Reversi before)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/GreWS.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/GreWS.gif&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(images from &lt;a href=&quot;http://www.coolmath-games.com/0-reversi&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.coolmath-games.com/0-reversi&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Reversi is a two player game with a simple goal - own the most pieces on the board. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Reversi&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="42736" LastEditorUserId="42736" LastEditDate="2017-07-28T02:12:56.730" LastActivityDate="2017-07-28T02:12:56.730" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="13137" PostTypeId="1" CreationDate="2017-06-29T15:13:07.677" Score="1" ViewCount="96" Body="&lt;p&gt;Some challenges (that I'm currently mulling over with a view to posting) require that the solution produces valid words.  Having to embed an entire dictionary in a code-golf entry isn't the point of the challenge, so I'd like answers to be able to depend on access to a word list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It doesn't matter if answerers don't all have the same list of words, as long as they select only words from the list.  Test cases can be given with a small wordlist, for verification of results.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there a standard phrase I can use in a question to indicate that answers don't have to embed their own word lists?  And if the question doesn't contain any such phrase, what should answerers assume when they need a word list?&lt;/p&gt;&#xA;" OwnerUserId="39490" LastEditorUserId="39490" LastEditDate="2017-06-29T15:50:57.810" LastActivityDate="2017-06-29T17:52:44.960" Title="Defaults for word lists" Tags="|discussion|policy|defaults|" AnswerCount="4" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13138" PostTypeId="2" ParentId="13137" CreationDate="2017-06-29T15:13:07.677" Score="0" Body="&lt;h1&gt;The word list can be provided in a file&lt;/h1&gt;&#xA;&lt;p&gt;The file may be required by the answer to have a specific name, or the file name may be passed as a parameter:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This answer requires the word list to be in a file called &lt;strong&gt;&lt;code&gt;a&lt;/code&gt;&lt;/strong&gt; in the working directory.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The name of the wordlist file should be passed as the second argument to this function.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="39490" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-29T15:13:07.677" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13139" PostTypeId="2" ParentId="13137" CreationDate="2017-06-29T15:15:08.220" Score="0" Body="&lt;h1&gt;The word list can be provided in an array or container datatype&lt;/h1&gt;&#xA;&lt;p&gt;If the language has suitable types, the word list may be supplied as a function argument or named variable&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This answer requires the word list to be in a &lt;strong&gt;&lt;code&gt;std::vector&amp;lt;std::string&amp;gt;&lt;/code&gt;&lt;/strong&gt; called &lt;strong&gt;&lt;code&gt;w&lt;/code&gt;&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The word list should be provided in a list as the second argument to this function.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The number of elements may also need to be passed (e.g. in C, where the natural representation is &lt;code&gt;char**&lt;/code&gt;,&lt;code&gt;int&lt;/code&gt;).&lt;/p&gt;&#xA;" OwnerUserId="39490" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-29T15:15:08.220" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13140" PostTypeId="2" ParentId="13137" CreationDate="2017-06-29T15:15:27.180" Score="0" Body="&lt;h1&gt;Answers may not assume the word list is in any particular order&lt;/h1&gt;&#xA;&lt;p&gt;The list is not necessarily sorted, unless the question specifies an ordering.  In practice, it's hard to specify any ordering other than the &amp;quot;C&amp;quot; locale's byte-wise ordering.&lt;/p&gt;&#xA;&lt;p&gt;Unless specified in the question, an answer may assume that the word list is shuffled - for example, this may allow different output on each invocation, without penalty.&lt;/p&gt;&#xA;" OwnerUserId="39490" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-29T15:15:27.180" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13141" PostTypeId="2" ParentId="2140" CreationDate="2017-06-29T16:00:05.793" Score="0" Body="&lt;p&gt;Sandboxing this mostly so &lt;em&gt;I&lt;/em&gt; don't forget about it (as I don't want to initiate this so soon after v3). Unlikely to need any serious revision, but comments are appreciated none the less.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Prisoner's Dilemma v4: The Amnesiac Gentlemen.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/122118/prisoners-dilemma-v-3-petri-dilemma&quot;&gt;v3 Petri Dilemma&lt;/a&gt;, except with one significant change: no one knows what round it is. The same setup, submission format, and scoring will be used.  For sandbox brevity, I'm only noting the differences from v3.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bots will receive input at the beginning of its turn in the format:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;current points, enemies points, your previous moves, enemy's previous moves&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The format of the move list (both yours and the enemy's) will be a string of characters, &quot;c&quot; for cooperation &quot;d&quot; for defection, in order from first round to last. However this list will contain only the &lt;em&gt;first seven moves&lt;/em&gt; of the game as well as &lt;em&gt;the most recent 7 moves&lt;/em&gt; (as everyone knows, &lt;a href=&quot;https://en.wikipedia.org/wiki/The_Magical_Number_Seven,_Plus_or_Minus_Two&quot; rel=&quot;nofollow noreferrer&quot;&gt;you can only hold seven items in working memory&lt;/a&gt;). A String 14 characters or fewer would indicate a round at the beginning of the game where 14 total moves haven't yet been performed.  Later rounds would be indeterminate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, as the current round number is not being passed in, bots will be unaware of when the end of the game comes (games will still be 200 rounds). This should prevent &quot;Ah ha, last round, I backstab!&quot; &quot;Ah ha, but I backstab you first, &lt;em&gt;one round earlier!&lt;/em&gt;&quot; strategies, which is what dominated a large swath of the v3 strategic playspace (I did tests where all backstab-early bots were coded to all backstab on the same round and there were only two that performed sub-optimally as a result, both of which were set to backstab &quot;before all n-Tit-for-Tat strategies&quot;, moving them back 1 rounds re-elevated them above n-Tit-for-Tat again, as well as which one backstabbed the other first determining the winner between them).  While several bots from v3 would be valid submissions in v4, all of the &lt;em&gt;winning bots&lt;/em&gt; utilize more data than v4 will let them have, opening up the playing field for new techniques.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are four sample strategies that will be entered to start with:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Tit for Tat&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def titfortatfunc(mypoints, enpoints, mylist, enlist):&#xA;    if not enlist or enlist[counter-1] == &quot;c&quot;:&#xA;        return &quot;c&quot;&#xA;    else:&#xA;        return &quot;d&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;RandomPick&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;from random import choice&#xA;def randompickfunc(mypoints, enpoints, mylist, enlist):&#xA;    return choice([&quot;d&quot;, &quot;c&quot;])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Cooperator&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def cooperatorfunc(mypoints, enpoints, mylist, enlist):&#xA;    return &quot;c&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Defector&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def defectorfunc(mypoints, enpoints, mylist, enlist):&#xA;    return &quot;d&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="47990" LastActivityDate="2017-06-29T16:00:05.793" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13142" PostTypeId="1" CreationDate="2017-06-29T16:33:49.703" Score="0" ViewCount="102" Body="&lt;p&gt;Right now, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/129055/how-to-convert-hex2-to-rgba&quot;&gt;this&lt;/a&gt; question has 3 downvotes and 4 close votes because it's unclear what they're asking. If you ask me, that's unfair. To me, it's very clear what they're asking: Given a hex2 color code of eight hexadecimal digits, you must output an rgba color code, with the 3 color channels integers in a range from 0-255, and an alpha channel number in a range from 0-1. The unclarity, I'm fairly sure, comes from the output format. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are a few comments asking about output format, saying the question should allow flexible output and not just an array of numbers, saying that not every language can do that, that it constrains code unnecessarily, etc. I agree. So why not make it so &lt;em&gt;every challenge has flexible output&lt;/em&gt;? Whether you print to stdout or return a value shouldn't matter, and I think it's unfair that this question is going to get closed over a technicality like that.&lt;/p&gt;&#xA;" OwnerUserId="70388" LastActivityDate="2017-06-30T12:22:46.547" Title="Should we set some &quot;base&quot; rules that apply to every submission?" Tags="|discussion|" AnswerCount="1" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="13143" PostTypeId="2" ParentId="13137" CreationDate="2017-06-29T17:52:44.960" Score="10" Body="&lt;h1&gt;The word list is an input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;No need to reinvent the wheel. We already have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/20260&quot;&gt;defaults for how to take input&lt;/a&gt;, so just use those. This includes reading from a file, STDIN, function input, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Decisions like whether the word list is sorted are up to the questioner, who as usual should specify what valid inputs look like. This doesn't come up often enough to warrant a default.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2017-06-29T17:52:44.960" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13144" PostTypeId="2" ParentId="2140" CreationDate="2017-06-29T18:48:13.393" Score="-1" Body="&lt;h2&gt;Braid Badly Boundlessly&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Your program or function must, given a string in any standard input format, output an infinite stream of delimiter-separated strings where each string is determined from the previous by a braiding algorithm. The program starts with printing the input string.&lt;/p&gt;&#xA;&lt;p&gt;The algorithm is described as follows: Infinitely alternate between&lt;/p&gt;&#xA;&lt;p&gt;(1) splitting the string into three substrings then swapping the first two substrings and flattening.&lt;/p&gt;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&lt;p&gt;(2) splitting the string into three substrings then swapping the last two substrings and flattening.&lt;/p&gt;&#xA;&lt;p&gt;starting with (1).&lt;/p&gt;&#xA;&lt;p&gt;The three substrings should be of non-increasing length with the maximum length no more than 1 greater than the minimum length of the three substrings. (This means that when the length of the given string is a multiple of three, the three substrings should be the same length. When the length of the given string is one more than a multiple of three, the first substring should be one character longer than each of the last two substrings. When the length of the given string is two more than a multiple of three, the first and second substrings should each be one character longer than the last substring.)&lt;/p&gt;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&lt;p&gt;Let the input be &lt;code&gt;&amp;quot;abcdefg&amp;quot;&lt;/code&gt;. Let the delimiter be a newline.&lt;/p&gt;&#xA;&lt;p&gt;Then the program would first print &lt;code&gt;&amp;quot;abcdefg&amp;quot;&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;It applies (1) which splits the string into &lt;code&gt;[&amp;quot;abc&amp;quot;,&amp;quot;de&amp;quot;,&amp;quot;fg&amp;quot;]&lt;/code&gt; and swaps the first two elements, reaching &lt;code&gt;[&amp;quot;de&amp;quot;,&amp;quot;abc&amp;quot;,&amp;quot;fg&amp;quot;]&lt;/code&gt;. It flattens to get &lt;code&gt;&amp;quot;deabcfg&amp;quot;&lt;/code&gt; which it prints and uses for the next step.&lt;/p&gt;&#xA;&lt;p&gt;The program applies (2) to &lt;code&gt;&amp;quot;deabcfg&amp;quot;&lt;/code&gt; to split into &lt;code&gt;[&amp;quot;dea&amp;quot;,&amp;quot;bc&amp;quot;,&amp;quot;fg&amp;quot;]&lt;/code&gt; and swaps into &lt;code&gt;[&amp;quot;dea&amp;quot;,&amp;quot;fg&amp;quot;,&amp;quot;bc&amp;quot;]&lt;/code&gt;, flattening to reach &lt;code&gt;&amp;quot;deafgbc&amp;quot;&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The program applies (1) to &lt;code&gt;&amp;quot;deafgbc&amp;quot;&lt;/code&gt; and the process repeats ad infinitum.&lt;/p&gt;&#xA;&lt;p&gt;Then the output would be the newline-separated&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;abcdefg&#xA;deabcfg&#xA;deafgbc&#xA;fgdeabc&#xA;fgdbcea&#xA;bcfgdea&#xA;bcfeagd&#xA;eabcfgd&#xA;eabgdcf&#xA;gdeabcf&#xA;gdecfab&#xA;cfgdeab&#xA;cfgabde&#xA;abcfgde&#xA;abcdefg&#xA;deabcfg&#xA;deafgbc&#xA;fgdeabc&#xA;fgdbcea&#xA;bcfgdea&#xA;bcfeagd&#xA;eabcfgd&#xA;eabgdcf&#xA;gdeabcf&#xA;gdecfab&#xA;cfgdeab&#xA;cfgabde&#xA;abcfgde&#xA;abcdefg&#xA;[...]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Specifications&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Note that the string should not be split at the beginning and then only swapped later. The string should be split on each and every iteration&lt;/li&gt;&#xA;&lt;li&gt;The delimiter between lines could be whichever character is convenient. You may assume it does not appear in the input string.&lt;/li&gt;&#xA;&lt;li&gt;The string input shall be at least three characters&lt;/li&gt;&#xA;&lt;li&gt;The input consists solely of printable characters (0x20-0x7F)&lt;/li&gt;&#xA;&lt;li&gt;Of course, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default?answertab=votes#tab-top&quot;&gt;standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;I/O&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input and output should be taken in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;standard I/O methods&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The input and output should be taken as string, list of characters, or equivalent.&lt;/li&gt;&#xA;&lt;li&gt;The output should be output continuously, which means you may assume infinite memory.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;p&gt;For the test cases, we will assume that the delimiter is a newline. Just the portion before the endless stream is repeats is shown.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;input&#xA;--&#xA;output&#xA;-----&#xA;abcdefg&#xA;--&#xA;abcdefg&#xA;deabcfg&#xA;deafgbc&#xA;fgdeabc&#xA;fgdbcea&#xA;bcfgdea&#xA;bcfeagd&#xA;eabcfgd&#xA;eabgdcf&#xA;gdeabcf&#xA;gdecfab&#xA;cfgdeab&#xA;cfgabde&#xA;abcfgde&#xA;-----&#xA;abc&#xA;--&#xA;abc&#xA;bac&#xA;bca&#xA;cba&#xA;cab&#xA;acb&#xA;-----&#xA;abcdefgh&#xA;--&#xA;abcdefgh&#xA;defabcgh&#xA;defghabc&#xA;ghadefbc&#xA;ghabcdef&#xA;bcdghaef&#xA;bcdefgha&#xA;efgbcdha&#xA;efghabcd&#xA;habefgcd&#xA;habcdefg&#xA;cdehabfg&#xA;cdefghab&#xA;fghcdeab&#xA;fghabcde&#xA;abcfghde&#xA;abcdefgh&#xA;-----&#xA;Braid&#xA;--&#xA;Braid&#xA;aiBrd&#xA;aidBr&#xA;dBair&#xA;dBrai&#xA;radBi&#xA;raidB&#xA;idraB&#xA;idBra&#xA;Brida&#xA;-----&#xA;Cycle&#xA;--&#xA;Cycle&#xA;clCye&#xA;cleCy&#xA;eCcly&#xA;eCycl&#xA;yceCl&#xA;ycleC&#xA;leycC&#xA;leCyc&#xA;Cylec&#xA;-----&#xA;O Canada!&#xA;--&#xA;O Canada!&#xA;anaO Cda!&#xA;anada!O C&#xA;da!anaO C&#xA;da!O Cana&#xA;O Cda!ana&#xA;-----&#xA;A man, a plan, a canal - panama!&#xA;--&#xA;A man, a plan, a canal - panama!&#xA;an, a canalA man, a pl - panama!&#xA;an, a canal - panama!A man, a pl&#xA; - panama!Aan, a canal man, a pl&#xA; - panama!A man, a plan, a canal&#xA; man, a pla - panama!An, a canal&#xA; man, a plan, a canal - panama!A&#xA;n, a canal  man, a pla- panama!A&#xA;n, a canal - panama!A man, a pla&#xA;- panama!A n, a canal man, a pla&#xA;- panama!A man, a plan, a canal &#xA;man, a plan- panama!A , a canal &#xA;man, a plan, a canal - panama!A &#xA;, a canal -man, a plan panama!A &#xA;, a canal - panama!A man, a plan&#xA; panama!A m, a canal -an, a plan&#xA; panama!A man, a plan, a canal -&#xA;an, a plan, panama!A m a canal -&#xA;an, a plan, a canal - panama!A m&#xA; a canal - an, a plan,panama!A m&#xA; a canal - panama!A man, a plan,&#xA;panama!A ma a canal - n, a plan,&#xA;panama!A man, a plan, a canal - &#xA;n, a plan, panama!A maa canal - &#xA;n, a plan, a canal - panama!A ma&#xA;a canal - pn, a plan, anama!A ma&#xA;a canal - panama!A man, a plan, &#xA;anama!A mana canal - p, a plan, &#xA;anama!A man, a plan, a canal - p&#xA;, a plan, aanama!A man canal - p&#xA;, a plan, a canal - panama!A man&#xA; canal - pa, a plan, anama!A man&#xA; canal - panama!A man, a plan, a&#xA;nama!A man, canal - pa a plan, a&#xA;nama!A man, a plan, a canal - pa&#xA; a plan, a nama!A man,canal - pa&#xA; a plan, a canal - panama!A man,&#xA;canal - pan a plan, a ama!A man,&#xA;canal - panama!A man, a plan, a &#xA;ama!A man, canal - pana plan, a &#xA;ama!A man, a plan, a canal - pan&#xA;a plan, a cama!A man, anal - pan&#xA;a plan, a canal - panama!A man, &#xA;anal - panaa plan, a cma!A man, &#xA;anal - panama!A man, a plan, a c&#xA;ma!A man, aanal - pana plan, a c&#xA;ma!A man, a plan, a canal - pana&#xA; plan, a cama!A man, anal - pana&#xA; plan, a canal - panama!A man, a&#xA;nal - panam plan, a caa!A man, a&#xA;nal - panama!A man, a plan, a ca&#xA;a!A man, a nal - panamplan, a ca&#xA;a!A man, a plan, a canal - panam&#xA;plan, a cana!A man, a al - panam&#xA;plan, a canal - panama!A man, a &#xA;al - panamaplan, a can!A man, a &#xA;al - panama!A man, a plan, a can&#xA;!A man, a pal - panamalan, a can&#xA;!A man, a plan, a canal - panama&#xA;lan, a cana!A man, a pl - panama&#xA;lan, a canal - panama!A man, a p&#xA;l - panama!lan, a canaA man, a p&#xA;l - panama!A man, a plan, a cana&#xA;A man, a pll - panama!an, a cana&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="68261" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-10T00:59:46.227" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13145" PostTypeId="2" ParentId="2140" CreationDate="2017-06-29T18:49:39.760" Score="2" Body="&lt;h1&gt;RoboCops and Robbers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A while ago we made &lt;a href=&quot;https://codegolf.stackexchange.com/questions/89726/golf-a-brain-flak-integer?answertab=votes#tab-top&quot;&gt;some code to golf brain-flak&lt;/a&gt; for us.  Eventually the code got so good that us humans could no longer compete against it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now the code has turned against it and its your job to stop it.  You need to out golf the robots.  They've already golfed all the numbers so you need to write some Brain-Flak code that pushes a positive number to the stack, but is shorter than the code produced by these two bots:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;&lt;a href=&quot;https://tio.run/##xVZbjxo3FH5efsURUdQxAxsgykUIeKiqqHloE6n7Uk0R8s4YsHbGpnPJQhG/ffv5MsMM2yjNQ1W0i7F9zufvXO39sdxpNX16ktle5yXlohfzeCdoQafxrD8P2LJ/7iViQ7HO9qnIhCqDeMdzHpciZ7Me@U8i49Io9YP@rM/6w/4J4xnjHOMSY4RxhZFhDDCeMZ4wLjHOMa4wRjirBsxFWeXK4kbNgStLZSNV8gsv411QKLnfi3JIWBGHFh2p4tySBacJyQ15ycgKrrBP/eA0j/ok0kLQaNJoFiWPH6AVrS5g/6zOTuf5MgLvRrCDccuhoZKgq8oa4cedTAWlQgVWnNGSxsRV4myhsGXD3Ik5IPb8PK@xuKg8F/leG1qKrdBfGUOLhTM2Gk1WX8e49q1TmUHnqyomLP8S8FuO9plkl23@yOIul1xtq5TngYI/b164hVQUlFVFSfcCf@WjEIqKP/MymCpmQxPfu0nvBm5RiMt41sC3QUdGZKNzOhg351gWgYT7gulAscEgmLx6fcvYsLV0@4aFE0PFIAeHwWAaHqx7sW1Wb/wxd3klevXkA4eXrElbUdYmOIue8Ru1RSy/7zf6P7HoACYfN/QoKNHqh9JWN2klzErGE0GcMolAP8BuXhQCXapj92edHrdaObMLmcAc1HzvxtWXW5iTPZLHsduD3F/C/3RyZmu@cGKGsBWt5zXVwKINyWgzs2GkUHYWbeDOMst2HtYnGQJ24nLvcy4zHyQPq3RJ0ZiuvDu1zlS1I00hqpeHxWK8slFRy0njAYP4AQ1S50UHODo8B1Wvpi0s13A8pwNz/TWRX37meRLrBDyHmQH0jlcvM@OVcXMCWvkgyEYTFoLHjx8C9SpjIXq8X@yfzv5nzfU3aXqJkWyyFOTsnTPzmHYSqVUrieHHF3S3E7kAWcq1zqxhSFdcClTotCqlVgUZiV4TLtwnYftIZH2Ie6Z3I1KLbCyZtcQvO3N6294IYJAym6YngcqvWo1EshWgWtiIXxjYi@PGMV8u6N177@HrjtPSqfuXzbRMqiCCV70/u3VtXHsKTucoYCt2Ptnr9SuiofE@W3akV8MHcVzgKrG5a7@sV6kQsQbLMj9SVQj80KYZZBruxnxTpXRfIfj6kWQJYZEVlMoHQV9EIbeSp2RSxcF9pGKnqzShVOsHhBZQjztRIjCEgJlMBwRSteJpeiREJtdAgZPwEJFqixraKrmRMVdlemwYggjH/9s3b@gLTysoIGkAimaRo3NNxvhgzksr5lETuj9iEQlzoXdnZDL0EhyJkigF6Q2Nb9@9dDHrVGcT/07aIpdxN5uUgESdEeiln376hDaalrLc5YInZnHjShI58bxIOxlg2kPG90HKs/sE7W52XYFDD8VarEymNAiXyPo6qytsm@p7EyBTU9f1Rs8KLhcFTHCEW5UKRfvCQD@k0aW3usUlqVFg3idOmaG/GJcUsUmfLpJ7pYVdf7pF53/7zDGKzL95POasIWZ3jbA9e2R77IVceE0OjT/8v8i5C6B2LradXNM7/dQErFJ7PGTwEMxRA66B2weuVbrN7Fu3/0cwwEPZy9hYeiljUapjbjKBFn7xtthzFbBLF3OKUS0Y4cHWekjbzWFrE3m@otArzTobWK/RvoEQTmarXpeAtXdfFbvOTeUdcGl8yl4jrNd7gp3rteKZWK9Nx@6v1xmXar32b9Y9QEuf8ZPp@8lrRi/mI/pdV2g3VXaPxmP6x9Pf&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Python&lt;/a&gt;&lt;/em&gt;, This bot eats numbers for breakfast and caches them for lunch, it still is the top scoring bot on the challenge and its coming for you.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;&lt;a href=&quot;https://brain-flak.github.io/integer/&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Number Cruncher&lt;/a&gt;&lt;/em&gt;, based on Neil's top scoring Perl answer, made from boiling hot JavaScript and raw HTML this bot takes no prisoners.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Since we need to stop these rampaging robots as soon as possible you need to come up with the smallest number you can to beat them.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You must write a program to push a number to the stack in Brain-Flak.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It must be shorter than the code produced by &lt;em&gt;both&lt;/em&gt; of the two bots above when asked to produce the same number&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your answer must be &lt;em&gt;stack clean&lt;/em&gt; (must push the same number regardless of the contents of the stack) and must not use &lt;code&gt;[]&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your score will be the number you produce, with a lower score being better.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In the event of a tie where two people have the same number the person with the shorter code will win, if that does not resolve then the first earlier will win.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-06-29T18:49:39.760" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="13148" PostTypeId="2" ParentId="2140" CreationDate="2017-06-30T05:00:30.497" Score="0" Body="&lt;h1&gt;(Code Golf) How Many Notes Are There?&lt;/h1&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;Most music games (MUG) describes the &amp;quot;instructions&amp;quot; that the player must follow as &amp;quot;notes&amp;quot;. When the charts (set of notes) are first available, MUG players usually record the chart as a video and upload them to video sites. However, unless playing a full combo (able to pick up all notes) that the combo count directly shows the number of notes, it is usually not practical to count the number of notes one by one directly (since there are usually hundreds of notes), so they calculate that from the scores that may show on those videos if the score formula is known.&lt;/p&gt;&#xA;&lt;p&gt;One of those examples is &lt;strong&gt;jubeat&lt;/strong&gt;, which is somehow like a MUG version of &amp;quot;Whack-a-Mole&amp;quot;. Although officially &amp;quot;instructions&amp;quot; are called &amp;quot;chips&amp;quot;, players have the consensus to call them &amp;quot;notes&amp;quot;. (For those who don't know what jubeat is please check it out here: &lt;a href=&quot;https://remywiki.com/Jubeat_Information&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;jubeat - RemyWiki&quot;&gt;jubeat - RemyWiki&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;What you have to do, is to:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Write &lt;strong&gt;a program or function&lt;/strong&gt;,&lt;/li&gt;&#xA;&lt;li&gt;Which accepts a list of integers as the only input,&lt;/li&gt;&#xA;&lt;li&gt;That &lt;strong&gt;calculates the numbers of notes which is possible for all&lt;/strong&gt; the given &amp;quot;basic scores&amp;quot;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Requirements&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input can be &lt;strong&gt;an array of integers or a string containing those integers&lt;/strong&gt; (Please indicate the input format).&lt;/li&gt;&#xA;&lt;li&gt;The integers in the input are &lt;strong&gt;guaranteed to be in the range of [0, 900000] inclusive&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A case (&lt;code&gt;NOTES&lt;/code&gt; in the formula) is possible means that, for each integer in the input, &lt;strong&gt;there exists&lt;/strong&gt; a variable &lt;code&gt;ACH&lt;/code&gt;, &lt;strong&gt;when substituted&lt;/strong&gt; into the formula below, the formula &lt;strong&gt;evaluates to that integer&lt;/strong&gt;. (See The Formula and Test Cases for details)&lt;/li&gt;&#xA;&lt;li&gt;All possible cases &lt;strong&gt;within the range [1, 1100] inclusive must be included&lt;/strong&gt; in the output.&lt;/li&gt;&#xA;&lt;li&gt;The output &lt;strong&gt;can be an array of integers or a string containing the results&lt;/strong&gt; (Please indicate the output format).&lt;/li&gt;&#xA;&lt;li&gt;If there is no case fulfilling the requirements, the program or function should either &lt;strong&gt;return an empty array, an empty string, null, or any objects indicating absence of results&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;NO RUNTIME EXCEPTIONS shall be thrown&lt;/strong&gt; in any circumstances.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;The Formula&lt;/h2&gt;&#xA;&lt;p&gt;The max score is 1000000, but here we only consider &lt;code&gt;BASIC_SCORE&lt;/code&gt;, whose maximum is 900000.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;code&gt;BASIC_SCORE&lt;/code&gt; is calculated by &lt;code&gt;BASIC_SCORE = floor(floor(ACH * 100000 / NOTES) * 0.9)&lt;/code&gt;, where &lt;code&gt;ACH&lt;/code&gt; is an integer in the range &lt;code&gt;[0, NOTES*10]&lt;/code&gt; inclusive except &lt;code&gt;NOTES*10-1&lt;/code&gt; and &lt;code&gt;NOTES*10-2&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;As a concrete example, take &lt;code&gt;ACH=6850, NOTES=900&lt;/code&gt;, we have &lt;code&gt;BASIC_SCORE = floor(floor(6850 * 100000 / 900) * 0.9) = 684999&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;As a result, &lt;code&gt;NOTES=900&lt;/code&gt; is a possible case for the basic score 684999.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt; Input                                    | Output&#xA;-----------------------------------------------------------------------------------------&#xA; 896757, 846353, 844486                   | 916&#xA; 891000, 893999                           | (all multiples of 30 within [1, 1100])&#xA; 899736                                   | 1024, 1025, 1026, 1027&#xA;                                          | (342, 683, 684 are false positives because  &#xA;                                          |  in these cases ACH = NOTES*10-1 or &#xA;                                          |  ACH = NOTES*10-2)&#xA; 873540, 802468                           | (none: no case fits all inputs.&#xA;                                          |  some cases do fit some inputs but not all)&#xA; 0, 900000                                | (all values within [1..1100])&#xA; 800000                                   | (none)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules and Winning Criteria&lt;/h2&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the source code with the shortest length (in terms of bytes) wins. Standard loopholes apply.&lt;/p&gt;&#xA;" OwnerUserId="71546" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-30T05:00:30.497" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13151" PostTypeId="2" ParentId="13142" CreationDate="2017-06-30T12:22:46.547" Score="2" Body="&lt;h1&gt;No, we should not make the I/O format rules standard for all challenges.&lt;/h1&gt;&#xA;&lt;p&gt;The whole purpose of some challenges, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/129136/simplify-matrix-input&quot;&gt;this one&lt;/a&gt; is Input/Output manipulation, so we cannot make I/O flexible by default for all challenges.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;When it comes to the specific challenge you were talking about in the question, I feel like an experienced user should have edited it since it was posted. New users must be encouraged, and hence someone should show them the right way. I was the first one that voted to close it, because I wanted to protect the new user from abundant downvotes and/or negative feedback in the comments until the issues were fixed. Now, I think we should edit the posts (only those that require it) of the new users  to show them the standard way we usually do things here on PPCG, and should not discourage them from the very beginning.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;NOTE:&lt;/strong&gt; @EriktheOutgolfer, @ovs and I have &lt;a href=&quot;https://codegolf.stackexchange.com/posts/129055/revisions&quot;&gt;edited&lt;/a&gt; the challenge, and hopefully it is salvageable now.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-30T12:22:46.547" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13154" PostTypeId="1" CreationDate="2017-06-30T16:18:15.397" Score="2" ViewCount="58" Body="&lt;p&gt;I recently posted a lengthy edit to a tip (not my own) in the &lt;a href=&quot;https://codegolf.stackexchange.com/q/5175/68602&quot;&gt;VBA tips for golfing&lt;/a&gt; page&lt;/p&gt;&#xA;&lt;p&gt;I posted as an edit rather than a new answer because the tip's scope was broad enough that I felt my answer would best be placed as an amendment. The edit was rejected by the community and so I'm here asking for advice;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When should you edit someone else's post, specifically on a tips page?&lt;/li&gt;&#xA;&lt;li&gt;Can you add a subtopic or should this be posted separately?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Or, in short, what was the reason that my edit was marked with&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This edit was intended to address the author of the post and makes no&#xA;sense as an edit. It should have been written as a comment or an&#xA;answer.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;For reference:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The edit (I'm not sure if you can see it) is &lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits/41480&quot;&gt;this one&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The post was &lt;a href=&quot;https://codegolf.stackexchange.com/a/104981/68602&quot;&gt;this one&lt;/a&gt; on the VBA tips for golfing&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you can't see the edit, I essentially outlined some special characters for &lt;code&gt;Print&lt;/code&gt; calls that may be useful in reducing their size.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;That seems to me to fit nicely as an addition to that specific tip - if I was the post owner I probably would have lumped them all in together as &lt;em&gt;one tip&lt;/em&gt; (one post one tip as stated in the question). But I'm never sure what the etiquette is for editing answers to general help pages rather than specific questions.&lt;/p&gt;&#xA;" OwnerUserId="68602" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-30T19:08:55.797" Title="Tip pages: to edit or to add?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13155" PostTypeId="2" ParentId="2140" CreationDate="2017-06-30T16:56:00.507" Score="0" Body="&lt;h1&gt;Poor Man's Ransomware&lt;/h1&gt;&#xA;&lt;p&gt;This challenge is loosely inspired by the cheapo-enigma machine question. However, I beleive that the differences are substantial enough that this would not be a dupe. Feedback welcome.&lt;/p&gt;&#xA;&lt;hr/&gt;&#xA;&lt;p&gt;You have been captured by a morally questionable &amp;quot;employer&amp;quot; and forced to write a piece of &amp;quot;ransomware&amp;quot;. All it has to do is take in a string &amp;quot;in whatever format&amp;quot; and output another string (which can be used to recover the files) Essentially, across the set of all possible inputs (infinite) you will define a one to one function.&lt;/p&gt;&#xA;&lt;p&gt;Participants will then publish their code to stack-exchange, where other aspiring &amp;quot;hackers&amp;quot; will try to break your code. A &amp;quot;cop&amp;quot; submission will consist of a byte count a sample plaintext and a sample &amp;quot;encrypted&amp;quot; file as well as an encrypted copy of your code.&lt;/p&gt;&#xA;&lt;p&gt;Robbers will work tirelessly in another thread to reproduce your code. Any submission which correctly produces the corresponding &amp;quot;encrypted&amp;quot; files when fed the sample plaintext and itself will be considered to be cracked.&lt;/p&gt;&#xA;&lt;p&gt;If your code lasts 7 days or longer you may mark your submission as &amp;quot;safe&amp;quot; by publishing the source code for the encryptor and a decryptor. Until this time robbers may still work to break your code. If anyone finds that a specific decryptor fails on a certain plaintext it is invalid.&lt;/p&gt;&#xA;&lt;p&gt;The winning cop has the shortest safe submission and the winning robber has the largest sum of the bytes of his cracked cops. Ties go to the earlier poster. Good Luck!&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-30T16:56:00.507" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="13156" PostTypeId="2" ParentId="13154" CreationDate="2017-06-30T19:08:55.797" Score="1" Body="&lt;p&gt;This answer is a expansion on my comment on the original post.  If it has been deleted for some reason here is the body of the original comment.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I was one of the people that rejected your edit. I felt like it provided a lot of new information. I would recommend editing for minor changes or corrections and commenting or adding a new answer if you want to add new information or expand on existing tips. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is more or less a TL;DR of my thoughts on this matter as a whole.  In my opinion edits, for both &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; and for other challenges, should be used for tweaks, fixes and corrections.  Examples might include:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Grammar or spelling correction&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Reformatting&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Minor correction (miscounted bytes etc.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Edits should not change the content of the answer.  These should for the most part left as comments and in some cases should be made into their own answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In your case you add a lot of helpful information to the answer.  I see this a lot like golfing someones answer through an edit.  It makes the answer &lt;em&gt;better&lt;/em&gt; but it changes the content of the answer.  I thus reviewed your edit in the same way as I would a golfing edit.  For minor improvements, just like minor golfs, I would leave a comment, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/19255/tips-for-golfing-in-haskell?answertab=active#comment315987_52945&quot;&gt;here's&lt;/a&gt; an example where I have done that.  For larger more complex improvements like your own I would suggest making a whole new answer touching on the original answer but focusing on the tips you in particular are offering. &lt;a href=&quot;https://codegolf.stackexchange.com/a/116928/56656&quot;&gt;Here's&lt;/a&gt; an example of that happening (the old answer has been deleted because the new one subsumes it).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This allows people to vote on the content you are providing separately from the original content and allows you to get rep for your contributions if people think it is helpful.  In my opinion its a win win scenario.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-06-30T19:08:55.797" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13157" PostTypeId="1" AcceptedAnswerId="13162" CreationDate="2017-06-30T19:33:53.517" Score="1" ViewCount="217" Body="&lt;p&gt;This is a &lt;a href=&quot;/questions/tagged/discussion&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt; about this challenge:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/129209/68942&quot;&gt;Make an interpreter for my new esolang InSpace&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It creates a new language and asks for an interpreter for it. It was originally closed as unclear because OP did not specify many things well. OP has now clarified it so that it is clear what it is asking for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition, for those who can see deleted posts (2k users until we get a design), there are two questions about interpreters that I've posted that were deleted, one of which was closed and the other which I deleted too quickly:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/76995/write-an-interpreter-for-my-new-esoteric-programming-language-hexflow&quot;&gt;https://codegolf.stackexchange.com/questions/76995/write-an-interpreter-for-my-new-esoteric-programming-language-hexflow&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/76928/write-an-interpreter-for-my-new-esoteric-language-streamflow&quot;&gt;https://codegolf.stackexchange.com/questions/76928/write-an-interpreter-for-my-new-esoteric-language-streamflow&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Note that these were bad challenges and I posted them when I was a new PPCG user... rip these cringy challenges)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What does the community think about challenges asking for interpreters for arbitrary languages that OP invents for the challenge?&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2017-06-30T19:39:18.337" LastActivityDate="2017-07-05T09:59:22.223" Title="Challenges about interpreting arbitrary invented languages" Tags="|discussion|code-golf|" AnswerCount="4" CommentCount="1" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13158" PostTypeId="2" ParentId="13157" CreationDate="2017-06-30T19:39:26.773" Score="-5" Body="&lt;p&gt;I dislike challenges like this for a few reasons:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You could create way too many challenges just by inventing arbitrary languages, and this seems like a way to repfarm. Sometimes it's interesting but it often becomes a challenge where IO is the main component of it (especially in the linked challenge; the command names will end up being a large portion of the challenge).&lt;/li&gt;&#xA;&lt;li&gt;They end up being quite boring often&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2017-06-30T19:39:26.773" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13159" PostTypeId="2" ParentId="13157" CreationDate="2017-06-30T20:39:09.967" Score="6" Body="&lt;h1&gt;Users should not use PPCG to get interpreters for underspecced languages&lt;/h1&gt;&#xA;&lt;p&gt;If you want an interpreter created, by someone else, for your brainchild, you need to make sure that your spec is 110%. This may involve creating an interpreter for it yourself, first, and testing it, to see how your language will &lt;em&gt;actually&lt;/em&gt; work.&lt;/p&gt;&#xA;" OwnerUserId="65836" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-30T22:48:39.490" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13160" PostTypeId="2" ParentId="2140" CreationDate="2017-06-30T22:08:03.190" Score="2" Body="&lt;h1&gt;Create a &amp;quot;Neverending&amp;quot; Quine &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to create a program which, when run, outputs its source code repeatedly until stopped. You are allowed to have an extra newline between outputs.&lt;br /&gt;&#xA;&lt;strong&gt;NOTE:&lt;/strong&gt; All standard loopholes are &lt;em&gt;strictly forbidden.&lt;/em&gt; That means cheating quines, etc.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so may the shortest answer win and the best programmer prosper...&lt;/p&gt;&#xA;" OwnerUserId="64706" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-06-30T22:08:03.190" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13161" PostTypeId="1" AcceptedAnswerId="13164" CreationDate="2017-06-30T22:22:16.303" Score="-4" ViewCount="141" Body="&lt;p&gt;xkcd is referred to often on PPCG, with at least &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=xkcd+is%3Aq&quot;&gt;47 questions&lt;/a&gt; which are based on concepts or directly related to the xkcd webcomic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, is it worthwhile introducing an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/xkcd&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;xkcd&amp;#39;&quot; rel=&quot;tag&quot;&gt;xkcd&lt;/a&gt; tag to group all of these challenges together?&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2017-06-30T23:10:50.053" Title="Do we want an xkcd tag?" Tags="|discussion|tags|" AnswerCount="1" CommentCount="1" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13162" PostTypeId="2" ParentId="13157" CreationDate="2017-06-30T22:47:23.710" Score="12" Body="&lt;h1&gt;Encourage high-quality &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt; challenges&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I really enjoy &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt; challenges. Why?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;They are often &lt;strong&gt;non-trivial&lt;/strong&gt;. (I'll address counterexamples below.) I like more-complex challenges in general, and it seems like challenges to interpret a toy language or a tarpit frequently hit the right balance between difficult and doable. Answers to them can showcase some &lt;a href=&quot;https://codegolf.stackexchange.com/a/49140/16766&quot;&gt;really intensive golfing&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;They are &lt;strong&gt;approachable&lt;/strong&gt;. Some of us aren't experienced with abstract math,&#xA;or physics, or cryptography. But we all know programming languages, and enjoy playing with them. Learning how to write an interpreter isn't too much of a learning curve.&lt;/li&gt;&#xA;&lt;li&gt;They can be &lt;strong&gt;educational&lt;/strong&gt;. The languages we're asked to interpret in these challenges draw from a wide variety of programming paradigms: &lt;a href=&quot;https://codegolf.stackexchange.com/q/79625/16766&quot;&gt;stack-based&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/q/48965/16766&quot;&gt;functional&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/q/84851/16766&quot;&gt;2-dimensional&lt;/a&gt;, etc., etc. Simply understanding how the language is supposed to work can be a mind-stretching experience in itself.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Now, one potential downfall of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt; challenges is that they are &lt;strong&gt;hard to do well&lt;/strong&gt;. Because they are more complicated, they need to be very carefully specified; they frequently have lots of caveats and corner cases that must be considered. An incomplete spec can easily result in the question getting closed--as it should! But DJMcMayhem is right:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;That's a problem with each challenge, not the category of challenges.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So, how do we encourage high-quality &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt; challenges?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Pick an interesting but manageable language&lt;/strong&gt; to interpret. I know trivial &quot;languages&quot; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/121921/make-a-interpreter&quot;&gt;get upvotes&lt;/a&gt;, but I'd like to see languages that actually do something--not necessarily Turing-complete, but at least with some control flow to handle (loops, gotos, recursion). On the other hand, an &quot;Interpret Python&quot; challenge is going to be way too involved for this site (&lt;a href=&quot;https://codegolf.stackexchange.com/q/4732/16766&quot;&gt;probably&lt;/a&gt;). Turing tarpits are a good choice, since they have very few instructions that need to be implemented. Try to design the language to be as small as possible while still being interesting.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Search existing challenges&lt;/strong&gt; to see if something similar has been done before. A quality &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt; challenge should add something new to the genre; we don't need fifty &quot;Interpret this variant of BF&quot; challenges. There's enough variety and downright weirdness among programming languages to find something interesting to implement.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Use the sandbox&lt;/strong&gt;. This isn't going to solve all the problems, for two reasons: 1) some people don't use the sandbox, and 2) even after sandboxing, a complex challenge will inevitably have more corner cases that didn't get caught. However, posting in the sandbox and asking for feedback over the course of a couple weeks will greatly increase the quality of a challenge, especially a complicated one. It can also help weed out the boring ones before they hit the main site. Get as many eyes on your challenge as possible. If/when your sandbox post stops getting feedback, post in chat asking for more feedback.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Implement it yourself&lt;/strong&gt;. Writing your own reference implementation forces you to tackle the corner cases and work out the exact behavior you want, which you can then write into the spec. But more importantly, a reference implementation is very helpful to potential answerers who will inevitably look at your spec and go, &quot;Huh?&quot; I may not understand how the language works from reading about it, especially if it uses an unusual execution model. But if I can experiment on my own with an existing interpreter, I'll be able to figure it out.&lt;/li&gt;&#xA;&lt;li&gt;A corollary to the above point: &lt;strong&gt;Write extensive example programs&lt;/strong&gt; in the language (i.e., test cases). Example programs need to use all the features of the language, particularly any corner cases or &quot;gotchas.&quot; If I can run all the example programs successfully with my submission, I should be pretty confident that my submission works according to spec.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This list is nothing new: these are essentially the ways we encourage high-quality challenges of any type. But these considerations are &lt;strong&gt;more important&lt;/strong&gt; for categories like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt; where the task and the spec are complicated. Trivial challenges may be ready to go after a short time in the sandbox, but for complex ones a longer stay is almost mandatory.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When low-quality challenges pop up, address them in the same way as any bad challenge. Downvote if it's trivial/uninteresting. Vote to close as unclear if it's unclear. Comment on improvements that can be made.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, let me point out that the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt; tag actually has quite a lot of good challenges, and only a few low-quality ones. As Wheat Wizard points out, several of the low-quality challenges are recent, which may contribute to your negative impression of the tag. I suggest browsing through some of the older ones--there are quite a few with 10-25 upvotes that deserve more attention.&lt;/p&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="16766" LastEditDate="2017-07-01T17:37:39.903" LastActivityDate="2017-07-01T17:37:39.903" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13163" PostTypeId="2" ParentId="2140" CreationDate="2017-06-30T22:49:09.837" Score="0" Body="&lt;h1&gt;Count bytes like a Java golfer&lt;/h1&gt;&#xA;&lt;p&gt;Java is verbose, everybody knows that. Sometimes, here on PPCG, it happens that a Java answer is shorter than 60 characters, but most of the time it's longer, way longer! And the Java golfers here often post improvement suggestions in comments.&lt;/p&gt;&#xA;&lt;p&gt;Alas, the PPCG website is based on the stack software, which &lt;a href=&quot;https://meta.stackexchange.com/questions/170970/occasionally-the-unicode-character-sequence-u200c-u200b-zwnj-zwsp-is-insert&quot;&gt;invisibly cuts &lt;code&gt;&amp;lt;code&amp;gt;&lt;/code&gt; comments&lt;/a&gt; according to an obscure rule, which I shall name the &amp;quot;Java golfer's bane&amp;quot;, making it impossible to get an accurate byte-count by copy-pasting.&lt;/p&gt;&#xA;&lt;p&gt;The rule in question is the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;in a &lt;code&gt;&amp;lt;code&amp;gt;&lt;/code&gt; tag, insert two invisible characters&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the first time after 60 non-whitespace consecutive characters&lt;/li&gt;&#xA;&lt;li&gt;then subsequently ever 20 non-whitespace consecutive characters&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Your goal is to help us, poor Java golfers, to &lt;strong&gt;get the byte-count straight&lt;/strong&gt; from when we copy/paste code from comments.&lt;/p&gt;&#xA;&lt;p&gt;SE software rules are, I'm sure, complex, so we will simplify a bit, but not that much.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your input:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;is mappable to UTF-8;&lt;/li&gt;&#xA;&lt;li&gt;must support codepoints until at least &lt;code&gt;U+FFFF&lt;/code&gt;;&lt;/li&gt;&#xA;&lt;li&gt;will contain only characters with codepoints greater than or equal to &lt;code&gt;U+0020&lt;/code&gt;;&lt;/li&gt;&#xA;&lt;li&gt;must be a string or a characters array/list if those accept unicode characters, or else must be an integer (16 bits minimum) array/list. Unless I forgot anything obvious, no other input format is allowed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;If a sequence of non-whitespace characters in the input contains more than 60 characters:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;keep the 60 first characters, then skip the next 2 characters;&lt;/li&gt;&#xA;&lt;li&gt;then until you meet a whitespace, keep the next 20 characters and skip the next 2.&lt;/li&gt;&#xA;&lt;li&gt;We don't care which are the two stripped characters.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Your output is the size of the string after being sanitized, in bytes as encoded in UTF-8! You must support very long Java answers, up to 500 characters (not bytes).&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You don't &lt;em&gt;need&lt;/em&gt; to map to UTF-8 since I give the rule on how to count without mapping, but in some languages it might be easier to actually map!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/16236&quot;&gt;standard loopholes&lt;/a&gt; are naturally forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is codegolf, so the shortest answer in bytes wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;You may assume the following:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the only whitespace character you will ever get is the space (&lt;code&gt;U+0020&lt;/code&gt;). I abuse the term whitespace by including the start of the string as well in its meaning.&lt;/li&gt;&#xA;&lt;li&gt;no whitespace will be at positions 62, 94, 116, (+22) ... after the previous whitespace&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;You may not assume the following:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The skippable characters will exclusively be the ones SE actually uses (&lt;code&gt;U+200C&lt;/code&gt; &lt;code&gt;U+200B&lt;/code&gt;);&lt;/li&gt;&#xA;&lt;li&gt;you will get only ASCII characters;&lt;/li&gt;&#xA;&lt;li&gt;you will not get any &lt;a href=&quot;https://en.wikipedia.org/wiki/Diacritic&quot; rel=&quot;nofollow noreferrer&quot;&gt;diacritics&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Bonus&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;if your code supports Unicode code points up to &lt;code&gt;U+1FFFFF&lt;/code&gt;, you can remove 10% off your byte count, do not round the resut.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;How to count the number of UTF-8 bytes?&lt;/h2&gt;&#xA;&lt;p&gt;If you haven't a builtin for that, &lt;a href=&quot;https://en.wikipedia.org/wiki/UTF-8#Description&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia gives us the rule&lt;/a&gt;, based on code points:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;first code point  |  last code point  |  # bytes&#xA;U+0000            |  U+007F           |  1&#xA;U+0080            |  U+07FF           |  2&#xA;U+0800            |  U+FFFF           |  3&#xA;U+10000           |  U+1FFFFF         |  4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Wikipedia goes beyond those number, but the &lt;a href=&quot;https://www.rfc-editor.org/rfc/rfc3629&quot; rel=&quot;nofollow noreferrer&quot;&gt;RFC 3629&lt;/a&gt; capped this mapping to 4 bytes, so we thank it!&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;Work in progress!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Notes for review:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Suggested tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/unicode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;unicode&amp;#39;&quot; rel=&quot;tag&quot;&gt;unicode&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Related:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/83673/16236&quot;&gt;Bytes/Character&lt;/a&gt; (different as there is an additional string manipulation)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="16236" LastEditorUserId="-1" LastEditDate="2021-10-07T07:34:52.683" LastActivityDate="2017-06-30T22:49:09.837" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13164" PostTypeId="2" ParentId="13161" CreationDate="2017-06-30T23:10:50.053" Score="19" Body="&lt;h2&gt;No&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Tags are meant to classify questions according to some distinctive quality that they share. Simply referencing an xkcd comic is not a distinctive quality that would create a meaningful classification.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-06-30T23:10:50.053" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13165" PostTypeId="2" ParentId="2140" CreationDate="2017-07-01T00:52:35.107" Score="0" Body="&lt;p&gt;What feedback do you have for me?&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Convert and print out a time in a 12-hour format. &lt;code&gt;HH:MM AM/PM&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;'Fri Jun 30 2017 21:14:20 GMT-0700 (PDT)'&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;'Sat Jun 31 2018 08:06:20 GMT-0700 (PDT)'&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;'Fri Jul 01 2017 01:14:20 GMT-0700 (PDT)'&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;'Sat Apr 10 2020 09:06:20 GMT-0700 (PDT)'&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Ouput:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;09:14 PM&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;08:06 AM&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;01:14 AM&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;09:06 AM&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest solution in bytes wins&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard Loopholes Apply&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;You may use functions as well as programs&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="70765" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-01T04:29:57.467" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="13166" PostTypeId="2" ParentId="2140" CreationDate="2017-07-01T12:18:11.540" Score="0" Body="&lt;h1&gt;Help! My code has exploded! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Insert backstory here&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to create a program, which must follow these rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It must be able to be split exactly into pieces of the same length in bytes.&lt;/li&gt;&#xA;&lt;li&gt;Once you have separated your program into pieces, your program must print &lt;code&gt;1&lt;/code&gt; if the first &quot;piece&quot; is removed from your code, &lt;code&gt;2&lt;/code&gt; if the second &quot;piece&quot; is removed, etc., until the program prints &lt;code&gt;n&lt;/code&gt; if the &lt;code&gt;n&lt;/code&gt;th piece is removed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For example, if your program was the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;aabbccdd&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And it could be split into &lt;code&gt;4&lt;/code&gt; equal parts of length &lt;code&gt;2&lt;/code&gt;, then these programs must result in the following outputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;bbccdd -&amp;gt; 1 (aa is removed)&#xA;aaccdd -&amp;gt; 2 (bb is removed)&#xA;aabbdd -&amp;gt; 3 (cc is removed)&#xA;aabbcc -&amp;gt; 4 (dd is removed)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring requirements:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program is scored based on the number of parts that it can be split into, with each part following the rules defined above. The more parts, the higher the score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the event of a tie, there is a &quot;hierarchy&quot; of scoring methods (with the next method in the list being used when there is a tie):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Number of parts the program can be split equally into&lt;/li&gt;&#xA;&lt;li&gt;Size of the full program, in bytes (shortest byte-count wins)&lt;/li&gt;&#xA;&lt;li&gt;Time posted (first poster wins)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each byte in the program must belong to one part.&lt;/li&gt;&#xA;&lt;li&gt;Each part in the program must be of equal length.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastActivityDate="2017-07-01T12:18:11.540" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13167" PostTypeId="2" ParentId="2140" CreationDate="2017-07-01T12:40:15.500" Score="1" Body="&lt;h1&gt;Mutation-hardening quine &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to make a program that prints out its own output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;Hey, we already have this challenge, and tons of variations of it! Why are you making another one?&quot; you may ask, but this one is going to be one of the most difficult ones.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your quine must be &quot;mutation-hardened&quot;, which means the quine still must work, even after any one of its characters is duplicated in place.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if you have a program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abcd&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;These programs must all output &lt;code&gt;abcd&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;aabcd&#xA;abbcd&#xA;abccd&#xA;abcdd&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(In each of those programs, &lt;code&gt;a&lt;/code&gt;, &lt;code&gt;b&lt;/code&gt;, &lt;code&gt;c&lt;/code&gt; and &lt;code&gt;d&lt;/code&gt; are each duplicated in-place, which means the duplicated character was placed directly after the original character.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard quine rules apply.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Meta:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this challenge too hard?&lt;/li&gt;&#xA;&lt;li&gt;What other rules should I put up?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastActivityDate="2017-07-01T12:40:15.500" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13169" PostTypeId="2" ParentId="2140" CreationDate="2017-07-01T18:26:45.763" Score="-2" Body="&lt;p&gt;&lt;strong&gt;Grep for math in a pdf document&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge is likely to need the use of libraries. You may use any free library of your choice as well as any library.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is simply to write a tool that can grep for &quot;2^n&quot; in a pdf document. That is the math that represents 2 to the power n.  You may assume that the pdf was produced from LaTeX which contains &lt;code&gt;$2^n$&lt;/code&gt; and that the pdfr was made using the command  line tool pdflatex.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;What should the code do?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The  code should take a pdf file as input either by reading a file or from standard in.   It should output if the file contains &quot;2^n&quot; or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I will provide a number of pdf files as test examples. Your score will just be how many your code gets right.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Requests for help&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I could provide sample pdf documents that  do or do not contain 2^n in them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does it always appear as an image in the pdf as Mego suggests? If so, this image will depend on the font and font size and this is an image processing task.&lt;/p&gt;&#xA;" OwnerDisplayName="user9206" LastEditorDisplayName="user9206" LastEditDate="2017-07-02T17:37:08.910" LastActivityDate="2017-07-02T17:37:08.910" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13172" PostTypeId="1" CreationDate="2017-07-02T01:44:05.173" Score="0" ViewCount="56" Body="&lt;p&gt;I feel like this should be said, because many answers have been made in TI-BASIC, Applesoft BASIC, and other languages that tokenize instructions. How exactly should they be scored? Should we score them as plain UTF-8 or by how they are stored in memory? Are there any exceptions? Thank you so much, PPCG Meta.&lt;/p&gt;&#xA;" OwnerUserId="64706" LastActivityDate="2017-07-02T01:44:05.173" Title="How should we score programs in languages that tokenize instructions?" Tags="|discussion|scoring|" AnswerCount="0" CommentCount="2" FavoriteCount="0" ClosedDate="2017-07-02T13:51:54.900" ContentLicense="CC BY-SA 3.0" />
  <row Id="13178" PostTypeId="1" CreationDate="2017-07-02T23:07:29.487" Score="13" ViewCount="359" Body="&lt;p&gt;&lt;a href=&quot;http://oeis.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;The OEIS&lt;/a&gt; is a great resource, and a lot of challenges on PPCG are based on or around sequences that are included on the OEIS.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I thought it might be a good idea to compile a list of sequences that have challenges.  This could be useful for a number of reasons.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You could use the list to check if a question related to an OEIS sequence is a dupe.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you want a question idea, you can use the list to find potentially interesting OEIS sequences that don't have questions.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you like a sequence you could see what questions have been asked about it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Where might such a list live?  We could compile it in an answer to this question, or using an external tool.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-07-14T05:17:17.047" Title="Record of OEIS on PPCG" Tags="|discussion|" AnswerCount="5" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13180" PostTypeId="2" ParentId="13178" CreationDate="2017-07-03T04:16:54.613" Score="1" Body="&lt;p&gt;There's no specific tag or list for OEIS challenges. The closest would be searching the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; tag (or searching both &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;), or searching for the term &quot;OEIS&quot; in questions. We previously had a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5544/45941&quot;&gt;proposal&lt;/a&gt; to add an OEIS tag, but it was decided against.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't really think the site would benefit from having a list of OEIS challenges. For starters, we'd have to maintain it, and so it will inevitably be out of date. Additionally, I don't think it would provide any additional utility over simply searching &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; challenges.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-07-03T04:16:54.613" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13181" PostTypeId="2" ParentId="13178" CreationDate="2017-07-03T07:13:54.810" Score="10" Body="&lt;p&gt;When a question is about an OEIS sequence, it should include the name of the sequence (Axxxxxx) and a link to OEIS in the question body. When a question turns out to correspond to a sequence, the name and link should be edited into the question body. That deals with your three points:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;You could use the list to check if a question related to an OEIS sequence is a dupe.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Search for the name of the sequence.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;If you want a question idea, you can use the list to find potentially interesting OEIS sequences that don't have questions.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That's really the same point again, because finding potentially interesting sequences among all the not very interesting ones is the hard part.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;If you like a sequence you could see what questions have been asked about it.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That's certainly the same point again.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;If there is an additional need to generate a list of sequences which have been used, I think that should be possible as a query on data.stackexchange.com, although I'm a bit rusty on string handling in T-SQL so I won't attempt it now.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This does also imply that we might need a site maintenance project to go through looking for questions which have links to OEIS in the comments but not in the question body. If you decide to do that, please bear in mind that edits bump questions, so with a project like this it's best to only edit about 5 questions a day.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-07-03T07:13:54.810" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13182" PostTypeId="2" ParentId="13157" CreationDate="2017-07-03T08:38:52.983" Score="4" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;What does the community think about challenges asking for interpreters for arbitrary languages that OP invents for the challenge?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I think there's a more fundamental question about challenges which ask us to &lt;em&gt;implement a task&lt;/em&gt; that the OP invented for the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my opinion, &lt;strong&gt;one of the elements of a good challenge is a clear motivation&lt;/strong&gt;. I should be able to see why OP cares about the challenge and why I should care. That doesn't mean that it has to have a practical application: sometimes the motivation is just that when you think about the problem it turns out to be surprisingly tricky. But there should be a motivation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With questions which are created just for the sake of posting a question, OP's motivation is posting something, anything, as long as it gets them rep; and who knows what the answerer's motivation is supposed to be. It's not a promising start.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With questions such as &quot;Interpret my snazzy new language&quot;, OP's motivation is strong, but because it's their baby they can lose objectivity when it comes to asking why anyone else should care about it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Chat and the sandbox can both be used to gauge whether a task is interesting enough to motivate other people. The gold standard evidence for an interpreter question would be that there are two or three people other than you using your language (and not just trying it out once). So in addition to the reasons given in other answers for writing a reference implementation and example programs, a good reason to write a reference implementation is to try to gather a small community.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="194" LastEditDate="2017-07-05T09:59:22.223" LastActivityDate="2017-07-05T09:59:22.223" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13184" PostTypeId="2" ParentId="2140" CreationDate="2017-07-03T12:15:10.603" Score="0" Body="&lt;h1&gt;What's Underneath the Sine Wave?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to output a part of the sine wave out of any characterss of your choosing and on any background of your choosing. The wave can start and end either on the highest or the lowest point of the wave if both are the same.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenges main part is what happens below the wave (or above if you chose to start at the peaks of the wave). For each column, looking top-to-down it should repeat until the bottom the segment of spaces until the wave.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Or a visual explanation:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Start with a sine wave of your choosing (this is not a valid one as it isn't 50x20, but smaller to save space):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;             ####             &#xA;           ##    ##           &#xA;          #        #          &#xA;         #          #         &#xA;        #            #        &#xA;       #              #       &#xA;      #                #      &#xA;     #                  #     &#xA;    #                    #    &#xA;  ##                      ##  &#xA;##                          ##&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and then, look top-down and until the 1st encounter of a non-background character record the characters and then repeat them:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;        ↓   ↓####             &#xA;        ↓  ##  P ##           &#xA;      4x↓ # ↓  P   #          &#xA;        ↓#  P  P    #         &#xA;        X   ↓  P     #        &#xA;       #↓   P  P      #       &#xA;      # ↓4x ↓  P       #      &#xA;     #  ↓   P  P        #     &#xA;    #   ↓   ↓  P         #    &#xA;  ##    P   P  P          ##  &#xA;##      ↓   ↓  P            ##&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;so for this the output would be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;             ####             &#xA;           ########           &#xA;          #  ####  #          &#xA;         # ######## #         &#xA;        #    ####    #        &#xA;       #  ##########  #       &#xA;      #      ####      #      &#xA;     #   # ######## #   #     &#xA;    #     #  ####  #     #    &#xA;  ##    #  ########  #    ##  &#xA;##           ####           ##&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Clarifications&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There can be any amount of leading/trailing lines with any amount of whitespace&lt;/li&gt;&#xA;&lt;li&gt;On each line there can be extra leading whitespace, as long as the amount is equal on all lines&lt;/li&gt;&#xA;&lt;li&gt;The width should be at least 50 characters total (excluding columns of only whitespace)&lt;/li&gt;&#xA;&lt;li&gt;The height should be at least 20 characters total (excluding lines of whitespace only)&lt;/li&gt;&#xA;&lt;li&gt;The repeating bottom parts &lt;em&gt;must&lt;/em&gt; be cut from the bottom (or top) of the wave&lt;/li&gt;&#xA;&lt;li&gt;Inaccuracies due to rounding or floating-point errors can be dismissed&lt;/li&gt;&#xA;&lt;li&gt;The background character has to be constant&lt;/li&gt;&#xA;&lt;li&gt;The wave characters can be different, as long as they aren't ever equal to the background&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the shortest code per language wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Sample outputs&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;                         XXXXXX&#xA;                       XXXXXXXXXX&#xA;                     XX  XXXXXX  XX&#xA;                    X  XXXXXXXXXX  X&#xA;                   X     XXXXXX     X&#xA;                  X  XXXXXXXXXXXXXX  X&#xA;                XX       XXXXXX       XX&#xA;               X    X  XXXXXXXXXX  X    X&#xA;              X      XX  XXXXXX  XX      X&#xA;             X     X   XXXXXXXXXX   X     X&#xA;            X            XXXXXX            X&#xA;           X      X XXXXXXXXXXXXXXXX X      X&#xA;          X              XXXXXX              X&#xA;         X      XX     XXXXXXXXXX     XX      X&#xA;        X          X XX  XXXXXX  XX X          X&#xA;       X       X    X  XXXXXXXXXX  X    X       X&#xA;      X                  XXXXXX                  X&#xA;    XX        X   X  XXXXXXXXXXXXXX  X   X        XX&#xA;   X                     XXXXXX                     X&#xA;XXX          X     XX  XXXXXXXXXX  XX     X          XXX&#xA;&#xA;..................................................&#xA;DCB....................QPONM....................10&#xA;...A9........0.......SRQPONMLK.......C........32&#xA;.....8..........X...T..QPONM..J...F..........4&#xA;......7.......Z...VU.SRQPONMLK.IH...D.......5&#xA;.......6...............QPONM...............6&#xA;........5......Y.W..TSRQPONMLKJ..G.E......7&#xA;.........4.............QPONM.............8&#xA;...................U.SRQPONMLK.I&#xA;..........3.......V.T..QPONM..J.H.......9&#xA;...........2....X....SRQPONMLK....F....A&#xA;............1..........QPONM..........B&#xA;.................W.UTSRQPONMLKJI.G&#xA;.............0.........QPONM.........C&#xA;..............Z...V..SRQPONMLK..H...D&#xA;...............Y....T..QPONM..J....E&#xA;...................U.SRQPONMLK.I&#xA;................X......QPONM......F&#xA;.................W..TSRQPONMLKJ..G&#xA;..................V....QPONM....H&#xA;...................U.SRQPONMLK.I&#xA;....................T..QPONM..J&#xA;.....................SRQPONMLK&#xA;.......................QPONM..................................&#xA;...&#xA;.&#xA;....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;sandbox&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;please suggest (or just edit in) ways of making this clearer&lt;/li&gt;&#xA;&lt;li&gt;Anything missing?&lt;/li&gt;&#xA;&lt;li&gt;Should I make this challenge take input, rather than being an broad kolmogorov-complexity challenge?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="59183" LastEditorUserId="59183" LastEditDate="2017-07-17T14:43:12.240" LastActivityDate="2017-07-17T14:43:12.240" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="13185" PostTypeId="2" ParentId="2140" CreationDate="2017-07-03T13:52:25.737" Score="-1" Body="&lt;h1&gt;Lennyface parser and selector&lt;/h1&gt;&#xA;&lt;h2&gt;Your mission&lt;/h2&gt;&#xA;&lt;p&gt;Create, in the language of your choice, a program that outputs a randomly selected lennyface (artistic minifigures, see &lt;a href=&quot;http://textsmili.es/?cr=bW91dGh%2BNmRiX2V5ZXN%2BOTN6X2VhcnN%2BN2JvLjJqLTJsLjdicw%3D%3D&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt;) from an input - a string composed of numbers and lennyfaces. You will have to : first, &lt;strong&gt;parse&lt;/strong&gt; this input; second, extract a &lt;strong&gt;probability mass function&lt;/strong&gt; &lt;code&gt;f&lt;/code&gt; from the parsed input; third, &lt;strong&gt;select and output&lt;/strong&gt; a lennyface respecting &lt;code&gt;f&lt;/code&gt;. Read the &lt;strong&gt;rules&lt;/strong&gt; for more details.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Input&lt;/strong&gt; : A string with lennyfaces and numbers (positive AND negative integers), separated by newlines. You may take input by STDIN or function parameter for example.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Output&lt;/strong&gt; (STDOUT for example) : the randomly-selected lennyface, as a string.&lt;/li&gt;&#xA;&lt;li&gt;The input creates a probability mass function &lt;code&gt;f&lt;/code&gt;. If &lt;code&gt;l&lt;/code&gt; is a lennyface, then &lt;code&gt;f(l)=(sum of all numbers since the previous lennyface)/x&lt;/code&gt; where &lt;code&gt;x&lt;/code&gt; is obtained afterwards by summing each of those numerators. &lt;strong&gt;@Sandbox : is it clear enough?&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;(sum of all numbers since the previous lennyface)&lt;/code&gt; is equal to zero or negative, you must do as if the numerator is equal to &lt;code&gt;1&lt;/code&gt; in &lt;code&gt;f&lt;/code&gt;'s definition.&lt;/li&gt;&#xA;&lt;li&gt;A line with a number contains only this number ; same for a line with a lennyface. So you can assume there will never be a number in a lennyface.&lt;/li&gt;&#xA;&lt;li&gt;If there is nothing on a line (two newlines in a row), you must consider it as a lennyface.&lt;/li&gt;&#xA;&lt;li&gt;You must consider that the last line of the string is directly before its first line. See &lt;strong&gt;Test 1&lt;/strong&gt; for an example.&lt;/li&gt;&#xA;&lt;li&gt;You can assume there will be at least 1 lennyface in the list; it cannot be composed just by numbers (don't forget that an empty line is a lennyface too).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;Given this input list :&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;( ͡° ͜ʖ ͡°)&#xA;2&#xA;¯\_ツ_/¯&#xA;34&#xA;-4&#xA;8&#xA;└[⸟‿⸟]┘&#xA;&#xA;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You must have 1/42 chances of outputting &lt;code&gt;( ͡° ͜ʖ ͡°)&lt;/code&gt;, 2/42 chances of outputting &lt;code&gt;¯\_ツ_/¯&lt;/code&gt;, 38/42 chances of outputting &lt;code&gt;└[⸟‿⸟]┘&lt;/code&gt; and 1/42 chances of outputting nothing (line 7).&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test 1&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(⌐■_■)&#xA;3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Must output&lt;/em&gt; &lt;code&gt;(⌐■_■)&lt;/code&gt; &lt;em&gt;with 3/3 chances.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test 2&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ʢ◉ᴥ◉ʡ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Must output&lt;/em&gt; &lt;code&gt;ʢ◉ᴥ◉ʡ&lt;/code&gt; &lt;em&gt;with 1/1 chance.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test 3&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0&#xA;\(ᗝ)/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Must output&lt;/em&gt; &lt;code&gt;\(ᗝ)/&lt;/code&gt; &lt;em&gt;with 1/1 chance.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test 4&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;( ͡° ͜ʖ ͡°)&#xA;2&#xA;¯\_ツ_/¯&#xA;34&#xA;4&#xA;☞   ͜ʖ  ☞&#xA;&#xA;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Must output&lt;/em&gt; &lt;code&gt;( ͡° ͜ʖ ͡°)&lt;/code&gt; &lt;em&gt;with 1/42 chance,&lt;/em&gt; &lt;code&gt;¯\_ツ_/¯&lt;/code&gt; &lt;em&gt;with 1/21 chance,&lt;/em&gt; &lt;code&gt;☞   ͜ʖ  ☞&lt;/code&gt; &lt;em&gt;with 19/21 chances and nothing with 1/42 chance.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test 5&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;&#xA;&#xA;&#xA;( ͡° ͜ʖ ͡°)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Must output&lt;/em&gt; &lt;code&gt;( ͡° ͜ʖ ͡°)&lt;/code&gt; &lt;em&gt;with 1/4 chance and nothing with 3/4 chance, since there are 3 empty lines.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test 6&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;42&#xA;&#xA;-1&#xA;( ͡° ͜ʖ ͡°)&#xA;&#xA;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Must output nothing with 43/44 chance and&lt;/em&gt; &lt;code&gt;( ͡° ͜ʖ ͡°)&lt;/code&gt; &lt;em&gt;with 1/44 chance.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;@Sandbox : should I add test cases?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins.&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; apply.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Note : Please do not be discouraged if the parsing is difficult to handle in your language, or if testing is hard because of randomness. Your solution might be very interesting algorithmically, not obviously in terms of golfing. Just please explain in your answer why it works.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Moreover, this is the first code-golf I create, so please let me know if something is not appropriate or if I should give more details on a point. And overall, if you downvote, explain me why so I can improve it.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="71499" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-24T06:22:21.503" CommentCount="16" ContentLicense="CC BY-SA 3.0" />
  <row Id="13186" PostTypeId="2" ParentId="2140" CreationDate="2017-07-03T16:15:38.820" Score="0" Body="&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;Ten years ago, a secret encryption key used by DVD players was published online. When the industry tried to censor it, &lt;a href=&quot;https://en.wikipedia.org/wiki/AACS_encryption_key_controversy&quot; rel=&quot;nofollow noreferrer&quot;&gt;the internet reacted&lt;/a&gt; by republishing it widely—creatively incorporating the key onto shirts, a flag and even in song.&lt;/p&gt;&#xA;&lt;p&gt;If this code golf community had existed, I'm sure we would have joined in.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Output the number 13256278887989457651018865901401704640.&lt;/p&gt;&#xA;&lt;h1&gt;Example input and output&lt;/h1&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;p&gt;Not applicable.&lt;/p&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;13256278887989457651018865901401704640&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="11258" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-03T16:15:38.820" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13187" PostTypeId="2" ParentId="2140" CreationDate="2017-07-03T17:39:01.987" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/144160/66833&quot;&gt;Simulate Alpha Decay&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2017-10-01T10:12:32.293" LastActivityDate="2017-10-01T10:12:32.293" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13189" PostTypeId="2" ParentId="2140" CreationDate="2017-07-04T06:39:52.123" Score="0" Body="&lt;h1&gt;Decode Reddit's Voting System &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Background&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Users with a high enough reputation on Stack Exchange can see the number of upvotes and downvotes on each question and answer. On Reddit, however, the net vote count and percentage of upvotes are displayed. Unfortunately due to rounding errors, it is impossible to determine exactly how many upvotes and downvotes occurred.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a nonzero net vote count and a percentage of upvotes, return all possible pairs of the numbers of upvotes and downvotes.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Constraints&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The net vote count can be any integer in the range &lt;code&gt;[-2^31, 2^31)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The percentage can be a whole number in the range &lt;code&gt;[0, 100]&lt;/code&gt;, or a floating point number in the range &lt;code&gt;[0, 1]&lt;/code&gt; with no more than two digits; you may decide which format to accept.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The percentage represents the percentage of votes which are upvotes, &lt;em&gt;rounded to the nearest integer&lt;/em&gt;. So a value of &lt;code&gt;93%&lt;/code&gt; could be anywhere in the range &lt;code&gt;[92.5%, 93.5%)&lt;/code&gt; that would result &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The maximum numbers of upvotes and downvotes will not fall outside the range &lt;code&gt;[-2^31, 2^31)&lt;/code&gt;; that is, you should be safe using 32-bit signed integers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may not return two ranges representing all possible amounts of downvotes and upvotes; you &lt;em&gt;must&lt;/em&gt; specify which numbers of upvotes correspond to which numbers of downvotes; hence you must return all possible pairs.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&#xA;1, 67%  -&gt; [(2, 1)]&#xA;1, 100% -&gt; [(1, 0)]&#xA;1, 60%  -&gt; [(3, 2)]&#xA;0, 50%  -&gt; [(0, 0), (1, 1), (2, 2), ...]; cases like this will &lt;i&gt;not&lt;/i&gt; be valid input&#xA;More involved ones to come...&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Anything I can do to make this more clear or more fun?&lt;/p&gt;&#xA;" OwnerUserId="69054" LastEditorUserId="69054" LastEditDate="2017-07-04T19:33:18.010" LastActivityDate="2017-07-04T19:33:18.010" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13194" PostTypeId="1" CreationDate="2017-07-05T01:18:36.617" Score="13" ViewCount="284" Body="&lt;p&gt;A &lt;a href=&quot;http://esolangs.org/wiki/Category:Reversible_computing&quot; rel=&quot;nofollow noreferrer&quot;&gt;reversible language&lt;/a&gt; is a programming language where no operation is capable of destroying information.  That means that with the output and a program you can always determine the input provided.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This has some interesting implications for IO.  For example in &lt;a href=&quot;https://github.com/Wheatwizard/Unbalanced&quot; rel=&quot;nofollow noreferrer&quot;&gt;Unbalanced&lt;/a&gt; the following program &quot;adds two numbers&quot;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;{[&amp;gt;(}[&amp;gt;{[[&amp;gt;&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This takes input in the form of&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a, b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and outputs&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;b-1, a+b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Currently this is not a valid addition program because &lt;code&gt;b-1&lt;/code&gt; is output along side the actual output.  However since Unbalanced is reversible and addition is &lt;em&gt;not&lt;/em&gt; a bijection, a &quot;true addition program&quot; by the sites standards is impossible.  In order for the output to be traced back to the input there is always going to be at least one other number on the stack.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It seems like we should allow this. We typically allow languages that always output a bit extra to compete. For example Octave prepends its output with &lt;code&gt;ans =&lt;/code&gt;.  We allow this because its unavoidable and we want languages like Octave to compete.  I believe that the same argument should apply to reversible languages.  However if we are not careful in how we allow output for reversible languages we may open up loopholes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there a good way to allow reversible languages to compete in non-bijective challenges?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-07-10T14:06:44.303" Title="Output in reversible languages" Tags="|discussion|output|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13199" PostTypeId="2" ParentId="2140" CreationDate="2017-07-05T10:15:51.377" Score="0" Body="&lt;h1&gt;Create The Correct Path&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Which would be better code golf with shortest code and being able to run on at least two operating systems or code challenge and scoring by how many operating systems it can run on?&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; OR &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/file-system&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;file-system&amp;#39;&quot; rel=&quot;tag&quot;&gt;file-system&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an input create a program that when ran on different operating systems creates a path for each one. For example, when ran on Windows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[ &quot;folder1&quot;, &quot;folder2&quot; ] -&amp;gt; folder1\folder2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An array of strings or any suitable alternative. The input can be empty, in which case you would just return an empty string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The correct path for the operating system the program has been ran on.&lt;/p&gt;&#xA;" OwnerUserId="38550" LastActivityDate="2017-07-05T10:15:51.377" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13202" PostTypeId="2" ParentId="2140" CreationDate="2017-07-05T12:32:58.347" Score="0" Body="&lt;h2&gt;Abbreviate a rename&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;After you commit a rename, &lt;code&gt;git&lt;/code&gt; reminds you but tries to avoid showing the full source and target path. It does this by splitting the path into components, extracting identical leading and trailing components, then using them to abbreviate the rename. (Other output that &lt;code&gt;git&lt;/code&gt; produces is not relevant here.) Here is an example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;foo/bar/baz/quux.c =&amp;gt; foo/baz/bar/quux.c&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The leading component &lt;code&gt;foo&lt;/code&gt; and trailing component &lt;code&gt;quux.c&lt;/code&gt; is the same, so this becomes&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;foo/{bar/baz =&amp;gt; baz/bar}/quux.c&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This also works when one of the components is empty, e.g.:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;foo/{bar/baz =&amp;gt; }/quux.c&#xA;foo/{ =&amp;gt; baz/bar}/quux.c&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Please write a program or function that abbreviates a rename. The input can be a pair of strings or a single string with a delimiter which can be &lt;code&gt;=&amp;gt;&lt;/code&gt; or newline or something else not typically found in a file name. The output should be a single string containing a &lt;code&gt;=&amp;gt;&lt;/code&gt; as shown. You can assume that neither string is a prefix of the other (&lt;code&gt;git&lt;/code&gt; doesn't abbreviate the rename in that case for some reason.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2017-07-06T08:38:50.813" LastActivityDate="2017-07-06T08:38:50.813" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13203" PostTypeId="1" CreationDate="2017-07-05T16:37:50.480" Score="0" ViewCount="55" Body="&lt;p&gt;How would you score a language based off of having 3 voltages 0v 2.5v and 5v AKA not binary but ternary. So how would this be scored?&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastActivityDate="2017-07-05T16:37:50.480" Title="Scoring in non binary language" Tags="|discussion|" AnswerCount="0" CommentCount="7" FavoriteCount="0" ClosedDate="2017-07-05T18:53:20.497" ContentLicense="CC BY-SA 3.0" />
  <row Id="13204" PostTypeId="2" ParentId="2140" CreationDate="2017-07-05T18:32:44.740" Score="1" Body="&lt;h1&gt;Make a Quiz Parser &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to create a program that will take an input of multiple 4-choice questions (A, B, C, D) in the format shown below, display each question (format also shown below) and its 4 answer choices, get the user's answer to each question, and, at the end of the quiz, output their score as a percentage.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;The Format&lt;/h2&gt;&#xA;&lt;h3&gt;Questions in input&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;Q&amp;lt;space&amp;gt;&amp;lt;Insert question here&amp;gt;:&amp;lt;Insert letter of correct answer here&amp;gt;&#xA;&amp;lt;indent 1 space&amp;gt;A&amp;lt;space&amp;gt;&amp;lt;answer choice text&amp;gt;&#xA;&amp;lt;indent 1 space&amp;gt;B&amp;lt;space&amp;gt;&amp;lt;answer choice text&amp;gt;&#xA;&amp;lt;indent 1 space&amp;gt;C&amp;lt;space&amp;gt;&amp;lt;answer choice text&amp;gt;&#xA;&amp;lt;indent 1 space&amp;gt;D&amp;lt;space&amp;gt;&amp;lt;answer choice text&amp;gt;&#xA;&amp;lt;you can add a newline between questions if it makes things easier&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;How to output questions&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;question number&amp;gt;. &amp;lt;question&amp;gt;&#xA;  A. &amp;lt;answer choice A&amp;gt;&#xA;  B. &amp;lt;answer choice B&amp;gt;&#xA;  C. &amp;lt;answer choice C&amp;gt;&#xA;  D. &amp;lt;answer choice D&amp;gt;&#xA;&amp;lt;2 spaces before each answer letter&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;How to output scores&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;Your score is: &amp;lt;score here&amp;gt;%&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Test Case&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Q What is the average airspeed velocity of an unladen swallow?:B&#xA; A African or European?&#xA; B 22 mph&#xA; C I don't know that!&#xA; D What?&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If this were question number 42, it would output like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;42. What is the average airspeed velocity of an unladen swallow?&#xA;  A. African or European?&#xA;  B. 22 mph&#xA;  C. I don't know that!&#xA;  D. What?&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;As usual, standard loopholes are &lt;em&gt;strictly forbidden&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so may the shortest code win and the best programmer prosper...&lt;/p&gt;&#xA;" OwnerUserId="64706" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-05T19:01:34.477" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13206" PostTypeId="2" ParentId="13178" CreationDate="2017-07-05T19:04:27.290" Score="5" Body="&lt;p&gt;I've made something like what you've requested. It's online at &lt;a href=&quot;http://ppcgoeis.surge.sh&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://ppcgoeis.surge.sh&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I wrote a small bit of JS to automatically create a &lt;a href=&quot;http://ppcgoeis.surge.sh/oeis_data.json&quot; rel=&quot;nofollow noreferrer&quot;&gt;JSON file&lt;/a&gt; with all the challenges &lt;a href=&quot;https://jsfiddle.net/_Okx/metd54me/2/&quot; rel=&quot;nofollow noreferrer&quot;&gt;available here&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Essentially, it just goes through challenges that contain &lt;em&gt;OEIS&lt;/em&gt;, then finds anything that match the regex &lt;code&gt;A\d{6}&lt;/code&gt;. Then, it categorises it by checking the tags: If it's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;, it classifies it as &lt;em&gt;Check&lt;/em&gt;. If it's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;, it's categorised by &lt;em&gt;nth term&lt;/em&gt;. Otherwise, classify it as &lt;em&gt;Unknown type&lt;/em&gt;. This seems to work for most challenges, but of course there will be some inaccuracies.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please note that I am still working on this and it may be buggy.&lt;/p&gt;&#xA;" OwnerUserId="26600" LastEditorUserId="26600" LastEditDate="2017-07-10T08:13:15.103" LastActivityDate="2017-07-10T08:13:15.103" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13209" PostTypeId="2" ParentId="2021" CreationDate="2017-07-06T04:07:03.140" Score="1" Body="&lt;p&gt;AFAICT, there is &lt;em&gt;nothing&lt;/em&gt; special about this from a licensing point of view.&#xA;(But I am not a lawyer and I am not your lawyer).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You always have the rights to relicensis your works to yourself, so you can use that to make code-challenges from it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are basically free to use what ever license you want.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I personally suggest MIT.&#xA;It is common,&#xA;it is simple,&#xA;it is permissive.&lt;/p&gt;&#xA;" OwnerUserId="4397" LastActivityDate="2017-07-06T04:07:03.140" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13210" PostTypeId="1" CreationDate="2017-07-06T05:00:50.367" Score="9" ViewCount="511" Body="&lt;p&gt;When dealing with list input in C, as in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/130021/compare-the-averages-of-my-lists/130027#130027&quot;&gt;this question&lt;/a&gt;, is it acceptable to add extra argument to indicate the length of the list?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It does give advantages because other language needs functions like &lt;code&gt;len(M)&lt;/code&gt;, but I cannot figure out a simple way to represent such a list in C.&lt;/p&gt;&#xA;" OwnerUserId="59292" LastEditorUserId="59292" LastEditDate="2017-07-07T08:58:35.393" LastActivityDate="2017-07-10T16:00:43.777" Title="List input in C and length argument" Tags="|discussion|" AnswerCount="6" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13212" PostTypeId="2" ParentId="2140" CreationDate="2017-07-06T08:06:31.707" Score="0" Body="&lt;p&gt;If you've come here, you probably know what &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is, and that's what I'm going to assume.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Story&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(I guess)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&#xA;Keyboards are input devices we use all the time. They existed before mice and touch screen, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Their fundamentals have not changed: when you press a key down, a signal is sent to the computer. When you release it, another signal is sent.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So here's the &lt;strong&gt;challenge&lt;/strong&gt;: calculate the minimum number of signals(length of a signal does not matter) depending on the input string.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;test&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Explanation:&#xA;  All keys have to be pressed down and released&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&#xA;Input2:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;TEst&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output2:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Explanation:&#xA;  Shift has to be pressed, then T, down, up, E, down, up, then release shift, then s down, up, then t down, up, totalling up to 10.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Any language is accepted.&lt;br&gt;&#xA;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins.&lt;br&gt;&#xA;Programs with incorrect outputs will be disqualified.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Happy golfing!&lt;/h2&gt;&#xA;&#xA;&lt;h1&gt;Edit:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The keyboard layout used should be this: &lt;a href=&quot;http://dry.sailingissues.com/keyboard-US-International.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://dry.sailingissues.com/keyboard-US-International.png&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Only characters in this keyboard layout will be used (+lowercase letters).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using Caps-Lock is ok, since it DOES have an advantage: numbers remain numbers while letters become uppercase.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thanks for the feedback so far.&lt;/p&gt;&#xA;" OwnerUserId="71343" LastActivityDate="2017-07-06T08:06:31.707" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13213" PostTypeId="2" ParentId="2140" CreationDate="2017-07-06T12:00:25.753" Score="2" Body="&lt;h2&gt;It halts. But why? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/halting-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;halting-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;halting-problem&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;Cops/Robbers section&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The robbers/cops section can be found &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Cops&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your job is to write a program that always halts. It can do anything it likes, as long as, given any input, it eventually stops. You must also write a mathematical proof that it stops. Two weeks after you have posted your answer (since math is hard, we want to give the Robbers a chance to steal your academic success), you should edit in this mathematical proof. Once you have done so, you are safe, and your score will be the length of your program (in bytes). Whichever safe program has the lowest score wins!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Robbers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your job is to write a mathematical proof that a given cops program halts, and post it as an answer. You must do so before the cop posts their proof.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You get 1 point for each post cracked, unless you crack it within 24 hours, in which case it is only 0.1 points (this is to prevent people from racking up points on easy answers). You obviously cannot crack your own submissions.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Cops may not use undocumented or incorrectly documented features of the programming language they are using.&lt;/li&gt;&#xA;&lt;li&gt;Although the proofs will be written in the informal style common within mathematics (as opposed to &lt;a href=&quot;https://en.wikipedia.org/wiki/Proof_theory#Formal_and_informal_proof&quot; rel=&quot;nofollow noreferrer&quot;&gt;completely formal proofs&lt;/a&gt;), they must theoretically be valid in the framework of &lt;a href=&quot;https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory&quot; rel=&quot;nofollow noreferrer&quot;&gt;ZFC&lt;/a&gt;. This will not come into play for most answers, seeing as most of mathematics can be formalized in ZFC, but some might if they use crazy metamathematical shenanigans (please do not do this (just kidding, go crazy kids)).&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This means that cops must write programs that can be proven to halt in ZFC. This means, for example the program &lt;code&gt;if isProofThatZFCisInconsistient(input) then infiniteLoop else stop)&lt;/code&gt; would be invalid, since although this program always halts (presumably), you cannot prove this fact in ZFC.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Cops, your program is not safe until you post the proof.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="16842" LastActivityDate="2017-07-06T12:00:25.753" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13214" PostTypeId="2" ParentId="13210" CreationDate="2017-07-06T17:15:32.607" Score="0" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;Not if the specifications do not explicitly allow it. There cannot be a clear line of what is allowed as extra input - sure, a list length seems reasonable, but this is really the user executing part of your algorithm. E.g., if the length of an array is allowed, why not a boolean array indicating which elements are prime? Saves a lot of effort implementing &lt;code&gt;isprime&lt;/code&gt; if your algorithm needs it!&lt;/p&gt;&#xA;&lt;p&gt;You are free to implement workarounds for features your language does not natively have - &lt;strong&gt;often, that's the part of the fun!&lt;/strong&gt; Perhaps your language may not have a &lt;code&gt;sizeof&lt;/code&gt; function, but why not scan the input until encountering a &lt;code&gt;null&lt;/code&gt; byte, and calculate the length on the go?&lt;/p&gt;&#xA;&lt;p&gt;If your language does not, in any imaginable way, perform the desired operation, you can always ask if your extra input is allowed by commenting on the OP - but do not be surprised to get a sound &lt;em&gt;no&lt;/em&gt; - sometimes, your language is just not up for the task.&lt;/p&gt;&#xA;" OwnerUserId="32352" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-06T17:15:32.607" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13215" PostTypeId="1" CreationDate="2017-07-06T18:07:20.550" Score="-2" ViewCount="80" Body="&lt;p&gt;I would like to propose a set of 10 basic challenges meant to be an intro to code golf. It would cover pop-con, golf, bowling, challenge, koth (iffy), CnR and other types. They would be listed on the FAQ as beginner challenges. All of them allow any language to compete even new ones. What do you think?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Beginner Programming 10)&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastActivityDate="2017-07-06T18:19:06.007" Title="Remember IP5 challenges? Why not BP10?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13216" PostTypeId="2" ParentId="13215" CreationDate="2017-07-06T18:19:06.007" Score="3" Body="&lt;p&gt;Once a CnR is over, it's over. There's no point in posting more cop answers if the robbers already left. A similar problem exists with KotH, as posting an answer and never getting a score is rather frustrating.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pop cons and code bowling are probably the last challenge types which we should shove in a new user's face. Writing a proper pop con is rather hard, and for the good ones, so is writing an answer. I'm not convinced writing a good code bowling contest is possible at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That leaves code golf and code challenges. Unfortunately, these can't be too difficult if part of a beginner's tutorial, and the easy ones get answered rather quickly in hundreds of languages, so unless the beginner knows rather obscure languages, there's nothing left to do for them.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;All of them allow any language to compete even new ones.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12877/12012&quot;&gt;We already allow that for all challenges.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-07-06T18:19:06.007" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13217" PostTypeId="2" ParentId="2447" CreationDate="2017-07-06T19:27:21.917" Score="13" Body="&lt;h1&gt;For languages not containing a formal implementation of an input or output data type, the data type may be implemented as standardized for the language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For instance, in TIS-100, all inputs and outputs are integers ranging from -999 to 999. Therefore, arrays of positive integers are often terminated with zeroes. If a challenge asks to take in the array &lt;code&gt;[3, 4, 5, 6]&lt;/code&gt; and return &lt;code&gt;[6, 8, 10, 12]&lt;/code&gt;, in TIS-100 the implementation would be to take in the sequence &lt;code&gt;3 4 5 6 0&lt;/code&gt; and output the sequence &lt;code&gt;6 8 10 12 0&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="70909" LastEditorUserId="61384" LastEditDate="2019-12-10T06:33:30.363" LastActivityDate="2019-12-10T06:33:30.363" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="13218" PostTypeId="2" ParentId="2140" CreationDate="2017-07-06T19:46:47.920" Score="1" Body="&lt;p&gt;&lt;strong&gt;The task&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code should take in an integer &lt;code&gt;0  &amp;lt; x &amp;lt; 1965593254291461501637330902918203684832716283083&lt;/code&gt; and output the smallest integer &lt;code&gt;m&lt;/code&gt; such that &lt;code&gt;x^m mod  1965593254291461501637330902918203684832716283083 = 1&lt;/code&gt;. This long number is the next prime after &lt;code&gt;2^100&lt;/code&gt; so can be encoded efficiently.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may take the input in any format that is convenient and output in any convenient form too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code should take less then one minute to run on a standard desktop no matter what the input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2, 4235851503548771316711413838489497242205033676&#xA;3, 16943406014195085266845655353957988968820134704&#xA;169434060141950852668456553539579889688, 16943406014195085266845655353957988968820134704&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Those with python or similar can check the answers with e.g. &lt;code&gt;pow(3,16943406014195085266845655353957988968820134704, 1965593254291461501637330902918203684832716283083)&lt;/code&gt; which equals &lt;code&gt;1&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may not use any builtin or library function which solves this problem for you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user9206" LastEditorDisplayName="user9206" LastEditDate="2017-07-06T20:13:22.950" LastActivityDate="2017-07-06T20:13:22.950" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="13221" PostTypeId="2" ParentId="12575" CreationDate="2017-07-07T07:53:07.720" Score="-2" Body="&lt;p&gt;I'm sure we need chat integration (Because you know, the current mobile chat is quite buggy), but I do not know how. Maybe take a deep look into the source codes?&lt;/p&gt;&#xA;" OwnerUserId="64499" LastActivityDate="2017-07-07T07:53:07.720" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13223" PostTypeId="2" ParentId="13105" CreationDate="2017-07-07T08:10:07.797" Score="2" Body="&lt;h1&gt;There's nothing we can do about this&lt;/h1&gt;&#xA;&lt;p&gt;The perk of seeing deleted answers are set on 2000 rep, and is set by the SE team. It's not a local rule to set reputations for these perks.&lt;/p&gt;&#xA;" OwnerUserId="64499" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-07T08:10:07.797" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13224" PostTypeId="2" ParentId="13210" CreationDate="2017-07-07T08:57:33.743" Score="-2" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;Expanding on my comment slightly:&lt;/p&gt;&#xA;&lt;p&gt;Every language has its shortcomings and every language will come up against challenges that expose those shortcomings. If your chosen language can't achieve something natively then your options are to:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Implement a workaround. A well written &amp;quot;hack&amp;quot; to get your language to do something it was never intended to do will always impress, even it it comes at heavy byte cost. This can lead to higher upvotes and, on occasion, bounties.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Accept that your chosen language can't accomplish the task at hand and use a different language instead.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;If we were to allow C to take list length as a separate argument then that sets a precedent and, once it's set, where do we draw the line?&lt;/p&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-07T08:57:33.743" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13225" PostTypeId="1" CreationDate="2017-07-07T09:54:22.237" Score="10" ViewCount="546" Body="&lt;p&gt;I have been questioned about the byte count in &lt;a href=&quot;https://codegolf.stackexchange.com/a/130304/70347&quot;&gt;my C# answer&lt;/a&gt; for the &lt;a href=&quot;https://codegolf.stackexchange.com/q/130290/70347&quot;&gt;The Snail in the Well&lt;/a&gt; challenge. Usually C# answers only need to count the following bytes:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(a,b)=&amp;gt;&amp;lt;do_something&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;with the rest of the code being in the header or footer. So at first my answer was like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(a,b,c)=&amp;gt;a&amp;gt;b?1+f(a-b+c,b,c):1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then Martin Ender noted that if I call a &lt;code&gt;f&lt;/code&gt; method in my code, I should include that assignment in the code, so I changed it to&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f=(a,b,c)=&amp;gt;a&amp;gt;b?1+f(a-b+c,b,c):1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then Martin said that I should also declare the &lt;code&gt;f&lt;/code&gt; variable and add the trailing &lt;code&gt;;&lt;/code&gt;, rendering my answer into something like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;System.Func&amp;lt;int,int,int,int&amp;gt;f=null;f=(a,b,c)=&amp;gt;a&amp;gt;b?1+f(a-b+c,b,c):1;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;At this point the answer is useless as there are shorter ways to solve the problem using standard, non-recursive functions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Usually the declaration of the lambda expression goes in the header, that's why I left it there. But I understand this is a recursive function, so what should I include in the answer (and therefore in the byte count)?&lt;/p&gt;&#xA;" OwnerUserId="70347" LastActivityDate="2017-07-10T17:24:03.283" Title="Byte count for named, recursive lambda expressions in C# answers" Tags="|discussion|scoring|c#|" AnswerCount="3" CommentCount="5" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13226" PostTypeId="2" ParentId="2140" CreationDate="2017-07-07T10:03:53.473" Score="1" Body="&lt;p&gt;For technical reasons, many languages have a boundary for number values, which calls for workarounds when operating with numbers outside this range.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;The challenge is to write a program which is able to multiply two arbitrary large numbers, given an infinite amount of time and memory.&lt;/p&gt;&#xA;&lt;p&gt;The input will always be two positive decimal integers in any reasonable format (string, list of digits..)&lt;/p&gt;&#xA;&lt;p&gt;The output should be (exclusively, apart from any whitespace) the exact decimal product of these integers.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If integer magnitude is unbounded in your language, you must set an own limit&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The algorithm has to be written individually. If your language has arbitrary multiplication implemented in any way, (built-in, native support) the program has to be written in a way that assumes that these methods are limited to some number&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Note that properties like .length can exceed the integer limit. You can't e.g. ordinarily loop over the digits in a 'for' loop&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A valid solution can not be confirmed by solely test cases but only by analysis of the code&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes per language wins.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;5378877047254281056308179853217614491205392080414948189690882584626258197090299384248418705254284062330999044417502407170242320748022675887850236280535223588025381434803683717318134517400400886554441&lt;/p&gt;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&lt;p&gt;24585803251446564673599904286559945882543472174090101020256415987852946031712809185990398899511551226915139170857973433130460342507187447589801052724967977799120438910759846107262285707877865565231049&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;13224401279751560029079048725841743388456506005068978434329060038933262717486337348174589758627669812502604130373896959848172091197634331942663385472131265201616801014468642971825909208942693284219016467181922385520740594984640977937358293657922369959902120240111214073507556243844128492765568914803850594686913014876111459929738682018339519061223975139325785119259348090888269287247476161682038609&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&lt;p&gt;Is this different enough from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2009/long-multiply-8-bits-at-a-time&quot;&gt;this&lt;/a&gt; challenge?&lt;/p&gt;&#xA;&lt;p&gt;Would this be better suited for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="60026" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-11T13:30:34.663" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="13228" PostTypeId="2" ParentId="13225" CreationDate="2017-07-07T11:26:28.847" Score="3" Body="&#xA;&#xA;&lt;p&gt;If a lambda is to be called it should show what it is assigned to, so the following:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;f=&amp;lt;args&amp;gt;=&amp;gt;&amp;lt;someRecursiveWork&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If we view the code needing to compile this it looks like the following, note the trailing semi-colon:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;System.Func&amp;lt;input...N, output&amp;gt; f = null;&#xA;f=&amp;lt;args&amp;gt;=&amp;gt;&amp;lt;someRecursiveWork&amp;gt;;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;However, we usually don't require trailing semi-colons for C# lambdas so I believe we should follow that rule here too.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;On a side note the top comment should also be applied to if an answer uses multiple lambdas to delegate some work off:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-c# prettyprint-override&quot;&gt;&lt;code&gt;g=&amp;lt;args&amp;gt;=&amp;gt;&amp;lt;someWork&amp;gt;&#xA;&amp;lt;args&amp;gt;=&amp;gt;&amp;lt;someWorkWithG&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note how what would be &lt;code&gt;f&lt;/code&gt; is not showing what it is assigned too.&lt;/p&gt;&#xA;" OwnerUserId="38550" LastEditorUserId="38550" LastEditDate="2017-07-07T11:32:26.457" LastActivityDate="2017-07-07T11:32:26.457" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13229" PostTypeId="2" ParentId="13210" CreationDate="2017-07-07T11:35:28.343" Score="7" Body="&lt;h2&gt;Yes, solutions may take the length of variable-length input as an additional input parameter&lt;/h2&gt;&#xA;&lt;p&gt;In non-golf C, taking the length of an array as a parameter alongside a pointer to the array is standard. Just look at the multitudes of functions in the standard library that do exactly that. So, a precedent exists for the language.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://stackoverflow.com/q/37538/2508324&quot;&gt;In general, it is impossible to determine the length of an array in C without special assumptions&lt;/a&gt;. &lt;code&gt;sizeof&lt;/code&gt; only works if the array was statically allocated (no &lt;code&gt;malloc&lt;/code&gt;), and the reference hasn't decayed to a pointer (like it does when you pass it as a function parameter). There is no hack that is 100% effective.&lt;/p&gt;&#xA;&lt;p&gt;This means that C (and other languages like it) have a severe disadvantage when it comes to variable-length input. The only surefire way to do variable-length input in C is to read from STDIN into a buffer until EOF (and if there isn't a maximum number of elements, be prepared to have to &lt;code&gt;realloc&lt;/code&gt; that buffer). Because of the severe restriction on input formats, solutions in C are forced to use a cumbersome input format, something which the community has decided is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8077/45941&quot;&gt;undesirable&lt;/a&gt;. C solutions are essentially &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10003/45941&quot;&gt;solving a different challenge&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;So yes, let's allow solutions to take the length of variable-length input as an additional input parameter. The only challenge this change could possibly trivialize is &amp;quot;Find the length of a list&amp;quot;, and that challenge would already be trivialized by the preponderance of languages with built-in list length functionality. This change will do very little harm, and much more good.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-07T11:35:28.343" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13230" PostTypeId="2" ParentId="13210" CreationDate="2017-07-07T11:38:01.687" Score="11" Body="&lt;p&gt;This is an interesting indication of the way PPCG has changed since the early days. I remember when a lot of questions included the length as a separate input and people commented with requests to make it optional because their high-level languages didn't need it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In most high-level languages an array is effectively a struct with a pointer and a length. I don't see that there's any point to creating a standard struct template. However, it does seem perfectly reasonable to interpret &quot;&lt;em&gt;array&lt;/em&gt;&quot; in a question as meaning &quot;&lt;em&gt;pointer and length, as encapsulated in your language&lt;/em&gt;&quot;. In the case of C the simplest &quot;encapsulation&quot;* is as two variables.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;* Yes, I get the point that it's not really encapsulation if you can split them up, hence the scare quotes. But such pedanticism is not the point here.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-07-07T11:38:01.687" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13231" PostTypeId="1" AcceptedAnswerId="13269" CreationDate="2017-07-07T13:46:56.907" Score="13" ViewCount="363" Body="&lt;p&gt;I like to ask code-golf questions but I typically don't want to see brute force solutions. The challenge I like to pose is to golf any reasonably fast solution for a (possibly hard) problem that will actually terminate in a reasonable amount of time.  Examples of such questions (not all by me) include:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/47638/area-of-a-self-intersecting-polygon&quot;&gt;Area of a Self-Intersecting Polygon&lt;/a&gt; (10 second limit)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/89215/fraction-to-exact-decimal&quot;&gt;Fraction to exact decimal&lt;/a&gt; (10 second limit)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/129716/compute-the-inverse-of-an-integer-modulo-100000000003&quot;&gt;Compute the inverse of an integer modulo 100000000003&lt;/a&gt; (30 minute limit)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Some people don't like the code-golf tag to be used when there is also a time limit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I on the other hand am very fond of this sort of question as I think it makes for an interesting sort of challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Why not just use fastest code?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fastest code questions are quite different. First of all the lowest level language tends to win so it's really a race between C/C++/Rust/nim and maybe Java.  They are also a pain as you have to run everyone's code.  A time limited code-golf on the other hand balances the fast running speed of verbose languages (such as C etc.)  against the need for compactness (which also benefits languages such as Jelly). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;At a more basic level, the type of questions I am talking about ask you to minimize code size subject to a restriction on running time.  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; of course doesn't do anything of the sort.  We could also imagine questions that ask you to minimize running time (as in fastest-code) subject to a maximum code size, but that is for a different discussion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Why not just use restricted-complexity?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The restricted-complexity tag specifies an asymptotic time complexity. For practical coding this is potentially something that can't be computed (e.g.  integer factoring) or is not practically relevant for the problem sizes being considered. It also excludes lots of talented people who are not used to this sort of math. Sometimes it's just very hard to work out the asymptotic time complexity of some code you have written. As a simple example, what if the running time of your code depends on the unknown distribution of the primes for example. Questions that just allow you to run it and see how fast it is seem to have some value.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fundamentally, restricting the asymptotic time complexity of code and specifying a maximum running time are just two very different things with each having its place. There are plenty of algorithms with worse time complexity which are faster in practice (linear programming is a great example where the simplex algorithm has exponential worst case complexity but is often the fastest method in practice) and if you have specific test cases in mind this is particularly true.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;If there is a time limit doesn't it have the same problems as fastest-code?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The time limits of the sort I am discussing are set to be sufficiently loose that any sensible implementation of the right algorithm will fit into it.  For example, where I have set a 10 second limit, there is a python solution that completes instantly.  The intention is really just to exclude brute force solutions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In order to make the question I am asking clear, here are two options  to choose from:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Are you/we happy with the example challenges listed above as they are currently? Or... &lt;/li&gt;&#xA;&lt;li&gt;Should we have a new tag for this type of question? Or...&lt;/li&gt;&#xA;&lt;li&gt;Is there another better solution?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;For what it is worth, I vote for 1 but I wouldn't mind if people wanted 2.&lt;/p&gt;&#xA;" OwnerDisplayName="user9206" LastEditorDisplayName="user9206" LastEditDate="2017-07-08T18:02:50.217" LastActivityDate="2017-07-10T23:03:59.773" Title="Do we need a new tag for time limited code-golf?" Tags="|discussion|" AnswerCount="2" CommentCount="16" ContentLicense="CC BY-SA 3.0" />
  <row Id="13233" PostTypeId="2" ParentId="12680" CreationDate="2017-07-07T14:52:16.680" Score="1" Body="&lt;p&gt;&lt;em&gt;This answer assumes C#, I do not believe (explained below) that this can be answered in a way that applies to numerous languages.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;As we have discovered, this is not an easy question to answer... This answer is based on my miserable commentary from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10974/c-lambdas-as-answers-to-questions-asking-for-a-function&quot;&gt;another question about C# and Lambdas&lt;/a&gt;. The reason I do all this talking to start with is because we have half a dozen questions about statically typed languages, and they have achieved almost nothing, so I'm stating (and assuming) some &lt;strong&gt;general (language specific) rules&lt;/strong&gt; that we &lt;strong&gt;could&lt;/strong&gt; use before trying to answer this questions which &lt;strong&gt;should&lt;/strong&gt; be answerable by understanding the &lt;strong&gt;general&lt;/strong&gt; rules about the language (though we can add more specific rules if we wanted). I shall probably write a meta question up about these 'general rules' in due course.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Your code should be self-contained and well defined&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We can define 'well defined' on a per language basis. If we want enforcable rules, we &lt;em&gt;have to do this&lt;/em&gt;, because it is well recognise that we don't require code that compiles on it's own, so we need &lt;em&gt;per-language rules&lt;/em&gt; to decide what is or is not well defined. For example, taking C# as an example (widly applicable to Java): we define 'well defined' code as code which compiles under one of the trivially identifiable and applicable situations below:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;As a complete program&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;That is, something you can stuff in a file, called &lt;code&gt;csc mycode.cs&lt;/code&gt; on it and get &lt;code&gt;csc mycode.exe&lt;/code&gt; out.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;As a member of a class&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10974/c-lambdas-as-answers-to-questions-asking-for-a-function&quot;&gt;Example E&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Stuff your code into the boilerplate below. You may not define your own boilerplate in your answer, that would be silly.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;/*usings here perhaps?*/&#xA;&#xA;class LONGCLASSNAMETHATWONTCLASH&#xA;{&#xA;    /*submission here*/&#xA;&#xA;    /*calling code (in a method or w/e)*/&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;As a locally defined function&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10974/c-lambdas-as-answers-to-questions-asking-for-a-function&quot;&gt;Example F&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More C&amp;amp;Ping...&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;class ANOTHERLONGCLASSNAMETHATWONTCLASH&#xA;{&#xA;    void LONGMETHODNAMETHATWONTCLASH()&#xA;    {&#xA;        /*submission code*/&#xA;&#xA;        /* calling code */&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;As an anonymous well-typed method&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10974/c-lambdas-as-answers-to-questions-asking-for-a-function&quot;&gt;Example H&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10974/c-lambdas-as-answers-to-questions-asking-for-a-function&quot;&gt;Martin's prompting&lt;/a&gt;, maybe we can even stretch to not requiring you to put brackets around your well typed lambdas:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;// taken to be in a method&#xA;var result = (/*submission here*/)(/*arguments*/);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Now to answer the question at hand...&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;.... Assuming all of the above (which we have no consensus on at this time), we have to find a way to fit 2 &lt;em&gt;named&lt;/em&gt; function definitions into one of these boilerplates above. This makes everything very simple, your best option is member functions (or local functions (C# 7)):&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-cs prettyprint-override&quot;&gt;&lt;code&gt;typename f(typename n)=&amp;gt;g(n)+doSomethingMore;&#xA;typename g(typename n)=&amp;gt;doSomethingWithInput;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I'm not sure what the shortest Java code would be under similar rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we agreed to add a &lt;em&gt;surprise&lt;/em&gt; semi-colon in the (example) boilerplates, we could often spare ourselves a byte, but would invalidate many answers also. Alternatively, we could be generous and allow either with or without a semi-colon (they should't change the meaning ,but C# can be picky about these things (and given the small space or allowed boilerplate, you could argue it doesn't matter)).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Counter Discussion&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Indeed, one could argue that writing one method has a much lower overhead than writing two (and this is what the question is saying). That &lt;em&gt;could&lt;/em&gt; be a separate decision, but until we have general rules for languages, it is just going to add to the confusion and misery that is ruling (in particular) on statically typed languages (that is, if you are of a similar miserable school of thought to that I am).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some sort of delimiter would &lt;em&gt;absolutely&lt;/em&gt; be necessary (i.e. you can't just say it is two functions, the code needs to make this clear, and the code that does so must be included in the byte count).&lt;/p&gt;&#xA;" OwnerUserId="26981" LastActivityDate="2017-07-07T14:52:16.680" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13234" PostTypeId="1" CreationDate="2017-07-07T15:30:35.777" Score="-2" ViewCount="100" Body="&lt;p&gt;&lt;em&gt;I'll try to keep this short... see these (relatively recent) questions for some background: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10974/c-lambdas-as-answers-to-questions-asking-for-a-function&quot;&gt;1&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11223/untyped-functions-in-static-langauges&quot;&gt;2&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12680/multiple-functions-without-leading-trailing-mandatory-parts?noredirect=1&amp;amp;lq=1&quot;&gt;3&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Disclaimer: I really hate 'untyped anonymous lambdas', and if we must have them, then we need some rules, but I think they don't make sense, and I think this is one formal way we can kill them forever, so I may be slightly biased, but I do think this makes some sense regardless, and that having per-language ruling is &lt;strong&gt;necessary&lt;/strong&gt; if we want comparable answers in the same language.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Question/Proposal&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Would there be support for the creation (by community discussion, consensus, etc.) of sets of allowable 'boilerplates' for some languages (i.e. those that it makes some sense for) which would implicitly indicate submission validity?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Such boilerplates might look like this:&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;C#, solo anonymous lambda boilerplate&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;class ArbitaryAndLongClassNameAssumedToBeUnknownAndNotToClash&#xA;{&#xA;    static void ArbitaryAndLongMethodNameAssumedToBeUnknownAndNotToClash()&#xA;    {&#xA;        var result = (/*submission here*/)(/*arguments*/);&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input is supplied as arguments, as indicated. Result is stored in the variable &lt;code&gt;result&lt;/code&gt; (upon calling the method) whose type is inferred by the compiler.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;C#, class member(s) boilerplate&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;class ArbitaryAndLongClassNameAssumedToBeUnknownAndNotToClash&#xA;{&#xA;    /* submission here */&#xA;&#xA;    static void ArbitaryAndLongMethodNameAssumedToBeUnknownAndNotToClash()&#xA;    {&#xA;        var result = Q(/*arguments*/);&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input is supplied as arguments, as indicated. Result is stored in the variable &lt;code&gt;result&lt;/code&gt; (upon calling the given static method) whose type is inferred by the compiler. You may chose any identifier other than &lt;code&gt;Q&lt;/code&gt; such that it is only defined when your code is in inplace (i.e. it can be &lt;code&gt;z&lt;/code&gt;, or `husky).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(more 'examples' can be found in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10974/c-lambdas-as-answers-to-questions-asking-for-a-function&quot;&gt;my other commentaries&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We can even define boilerplates for &quot;full programs&quot; (this one is easy, no boilerplate) and &quot;functions&quot;, and &quot;snippets&quot;, terms we already use, but that not necessarily meaningful on a per-language basis.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(if other people who know other languages think they understand what I'm on about, they are welcome to edit in a couple more examples - such examples are &lt;strong&gt;examples&lt;/strong&gt; and we should not consider this proposal a proposal to implement those examples, they are merely illustrative... examples; but keep them sensible)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Checking Validity&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;When you have a number of such boilerplates, checking validity is easy! You just stuff the code into the appropriate one (require people to specify if it is unclear; but we design them to provide no useable context), and if the code can then be compiled/run, great! Your submission is valid, no questions need to be asked.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is basically what people do already to demonstrate validity... only it will be formalised.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;What I like about the idea&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;While it will be a lot of (initial) effort, it will be less than having the same argument every time someone tries to use a lambda in C#, or Java: because it is opt-in, the effort only need be applied to those languages where everyone is arguing: if there is no argument, there is no need anyway&lt;/li&gt;&#xA;&lt;li&gt;All of the nice stuff that comes with having objective submission criteria:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Comparable answers in the same language&lt;/li&gt;&#xA;&lt;li&gt;No extended discussion in comments (as oppose to meta) about submission validity (which have recently resulting in a deluge of discussions on meta&lt;/li&gt;&#xA;&lt;li&gt;Something we can point new users to (instead of discussing in comments)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;What is, or may seem, less than ideal about the idea&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;With some brief responses&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Does this mean you have code that 'breaks out' of the boiler plate, and looks intrinsically illegal? e.g. finishing a method definition, only to start another, but not quite finish it? Probably, but I can't think of a viable example at this time, let alone one that pays off&lt;/li&gt;&#xA;&lt;li&gt;This 'stuff the code into some boiler-plate' may not apply to all languages; but again, it would be opt-in, and if it doesn't make sense, you have to find another way&lt;/li&gt;&#xA;&lt;li&gt;Won't this make C# answers longer? YES I DON'T CARE&lt;/li&gt;&#xA;&lt;li&gt;What do we do about all the old, now invalid answers? I'm not sure... this is a general concern, and one we can discuss in context this if we think the idea is viable&lt;/li&gt;&#xA;&lt;li&gt;The &lt;code&gt;var&lt;/code&gt; keyword in C# means we can more easily let the compiler help us define things... this won't be the case in other languages, and what exactly is defined as the input/output will need some thought&lt;/li&gt;&#xA;&lt;li&gt;As in the second C# example above, method names a bit of a pain, so it won't always be quite so easy as C&amp;amp;Ping the submission, but along with the boilerplate will appear &lt;em&gt;simple&lt;/em&gt; rules which can trivially be applied or otherwise qualified in any answers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Duly&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Do people think this idea has some merit? What would need to be changed/reconsidered if were to employ something like this?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think that organised per-language submission validity criteria would make (some peoples') lives better, and 'boilerplate' seems like a clean and obvious way to achieve this with some languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Naturally, I would be happy to put effort into an example C# write up... but I'm dreadful at writing so someone else will have to tweak it to save embarrassment.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;I won't be writing an answer to this (at least not in a hurry)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Follow up stuff....&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;I do not care what the implications of enforcing such rules would be on byte counts, this is entirely about formalising submission validity, and hopefully making illegal what I consider an unjustifiable practice that has become prevalent on PPCG, and to prevent such practices appearing in the future. It has the consequence of making answers in the same language comparable (i.e. they are both C# as defined by PPCG, rather than (for example) one being valid C#, the other being dubious C#)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This would not a free licence for answerers to assume any boilerplate they like. It would have to be one of an agreed set of boilerplates. This is essentially exactly the problem I've been trying to solve (people asserting types for &quot;untyped lambdas&quot; in their answers).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="26981" LastEditorUserId="26981" LastEditDate="2017-07-07T17:21:08.323" LastActivityDate="2017-07-07T17:21:08.323" Title="Language-Specific Boilerplates to Formalise Submission Validity (in atleast some languages)" Tags="|discussion|" AnswerCount="1" CommentCount="2" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13235" PostTypeId="2" ParentId="13234" CreationDate="2017-07-07T16:43:08.877" Score="2" Body="&lt;h1&gt;I don't really think that this is needed.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This site is moving away from the &quot;shortest code wins&quot; rules, and most people only include it in challenges as to not be closed for a lack of a winning criteria. In short, this site is now about finding the shortest code &lt;em&gt;in each language&lt;/em&gt;, rather than in all languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, this method of bypassing boilerplate is redundant. Who cares if C# and Java are longer than Jelly or 05AB1E? No matter the program, production languages are going to be longer than golfing languages. But what does matter is &lt;em&gt;how&lt;/em&gt; the code is written. Just because a golfing language has a builtin for the problem doesn't mean that you shouldn't write a perfectly valid, C# program that does the same thing, albeit in 100 bytes.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;As a more definitive answer, however,  I don't think that it would be well received. Just reading through your post, I identified 3 key problems:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What if different programs, &lt;em&gt;in the same language&lt;/em&gt;, require different boilerplate? Would you have to identify every different possible boilerplate template available?&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;These aren't full programs.&lt;/strong&gt; They are snippets. and snippets aren't allowed here.&lt;/li&gt;&#xA;&lt;li&gt;What is so bad about untyped anonymous lambdas? If you can solve the problem in a lambda, and really care about the byte count, &lt;strong&gt;use a lambda&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2017-07-07T16:43:08.877" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13237" PostTypeId="2" ParentId="13225" CreationDate="2017-07-07T16:53:40.520" Score="4" Body="&lt;p&gt;If I'm not mistaken, (my search has failed me), a unnamed function literal answer is defined along the lines of&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;a block of code that evaluates to a callable value&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So, if your submission is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;code&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You should be able to do one of the following (structures) to run your answer:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;type&amp;gt; &amp;lt;result&amp;gt; = (&amp;lt;code&amp;gt;).call(&amp;lt;params&amp;gt;);&#xA;&#xA;&amp;lt;type&amp;gt; &amp;lt;name&amp;gt; = &amp;lt;code&amp;gt;;&#xA;&amp;lt;type&amp;gt; &amp;lt;result&amp;gt; = &amp;lt;name&amp;gt;.call(&amp;lt;params&amp;gt;);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or, as a function answer, adding your code should (in a language-defined way) provide a callable binding which solves the problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In Python, &lt;code&gt;f=lambda ...&lt;/code&gt; works because after its execution, a binding &lt;code&gt;f&lt;/code&gt; exists which is a reusable callable binding which solves the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In C-like languages, &lt;code&gt;&amp;lt;type&amp;gt; f() { ... }&lt;/code&gt; works because after its inclusion in a source file, a callable binding &lt;code&gt;f&lt;/code&gt; exists which is a reusable solution to the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In Java/C# though, we've run into the issue of typing with our unnamed function. As in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11223/51825&quot;&gt;the related issue about typing lambdas&lt;/a&gt;, we allow just the literal because the question itself gives the context to infer the required type of the binding, and it's more consistent with other languages' scoring.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I don't think this should extend to when the function needs to be named. At that point, you are no longer submitting an answer as an unnamed function, but as a block of code that after inclusion defines a function binding.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;f=&amp;lt;lambda&amp;gt;&lt;/code&gt; means nothing in C#. You need to provide a type to create a name binding in C#.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think C# has an opinion on this as well:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Cannot assign lambda expression to an implicitly-typed variable&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I was going to suggest the use of &lt;code&gt;var&lt;/code&gt;, but C# disallows that, likely because of the discussed issues about typing a lambda.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My position is that if you need to name the function submission, you need to provide a proper function submission, that is: code that, when included, defines a callable name binding which can be used to solve the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An unnamed function expression needs to be that: an unnamed function expression that &lt;em&gt;I&lt;/em&gt; assign to a variable (and thus take the typing responsibility).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TL;DR this shouldn't be an allowed submission format, use a proper function declaration if you need to call it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I agree with the summary in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13233/51825&quot;&gt;this answer&lt;/a&gt;, with the extension of allowing combining any number of defined functions with one anonymous function which is the submission.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TL;DR TL;DR: Oliver's answer expresses the same sentiment and I agree with it fully.&lt;/p&gt;&#xA;" OwnerUserId="51825" LastEditorUserId="51825" LastEditDate="2017-07-10T17:24:03.283" LastActivityDate="2017-07-10T17:24:03.283" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="13238" PostTypeId="2" ParentId="2140" CreationDate="2017-07-07T17:16:42.097" Score="2" Body="&lt;h1&gt;Don't step on a crack, or you'll break your mother's back&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Earlier I was walking down the sidewalk in my town, which is made of concrete slabs and looks something like &lt;a href=&quot;https://commons.wikimedia.org/w/index.php?curid=1640675&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; (note: not my sidewalk). I decided to try to pace myself such that I didn't step on the little cracks between the concrete slabs. For simplicity, let's say:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each slab is 4 feet long.&lt;/li&gt;&#xA;&lt;li&gt;Each of my feet is 1 foot long.&lt;/li&gt;&#xA;&lt;li&gt;Each crack has 0 width (just like &lt;a href=&quot;https://codegolf.stackexchange.com/q/128039/42545&quot;&gt;your neighbors' dog&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;My natural stride is about 3 feet, which worked out quite well:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/7R8sp.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/7R8sp.png&quot; alt=&quot;3-foot strides&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;(Excuse my horrible MS Paint skills)&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then I got a little ambitious and decided to take 4-foot strides. This obviously worked out even more nicely (aside from making my legs feel weird):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/YdNHZ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/YdNHZ.png&quot; alt=&quot;4-foot strides&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This got me thinking, what other lengths of strides could I take? One non-integer example would be 2⅔ feet:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/2Iauy.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/2Iauy.png&quot; alt=&quot;2⅔-foot strides&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I could go as short as 1-foot strides, though anything shorter than 1 foot would place my foot-long foot on every crack in the sidewalk. (I didn't do 1-foot strides because I would look weird shuffling down the sidewalk, and also because I was in a rush.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In fact, there are 6 possible crack-avoiding strides up to four feet: 1, 1⅓, 2, 2⅔, 3, 4.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a integer concrete slab length &lt;strong&gt;0 &amp;lt; n &amp;lt; 100&lt;/strong&gt;, output all stride lengths up to &lt;strong&gt;n&lt;/strong&gt; that I could take on that theoretical sidewalk. Assume I can stretch my legs infinitely far (I am a mathematician, after all).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More mathematically, given an input integer &lt;strong&gt;0 &amp;lt; n &amp;lt; 100&lt;/strong&gt;, output all numbers &lt;strong&gt;0 &amp;lt; k &amp;lt;= n&lt;/strong&gt; such that no multiple of &lt;strong&gt;k&lt;/strong&gt;, modulated by &lt;strong&gt;n&lt;/strong&gt;, is greater than &lt;strong&gt;n - 1&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Expected outputs for inputs 1 through 9 (rounded to 4 decimal places):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1: [1]&#xA;2: [1, 2]&#xA;3: [1, 1.5, 2, 3]&#xA;4: [1, 1.3333, 2, 2.6667, 3, 4]&#xA;5: [1, 1.25, 1.6667, 2, 2.5, 3, 3.3333, 3.75, 4, 5]&#xA;6: [1, 1.2, 1.5, 2, 2.4, 3, 3.6, 4, 4.5, 4.8, 5, 6]&#xA;7: [1, 1.1667, 1.4, 1.75, 2, 2.3333, 2.8, 3, 3.5, 4, 4.2, 4.6667, 5, 5.25, 5.6, 5.8333, 6, 7]&#xA;8: [1, 1.1429, 1.3333, 1.6, 2, 2.2857, 2.6667, 3, 3.2, 3.4286, 4, 4.5714, 4.8, 5, 5.3333, 5.7143, 6, 6.4, 6.6667, 6.8571, 7, 8]&#xA;9: [1, 1.125, 1.2857, 1.5, 1.8, 2, 2.25, 2.5714, 3, 3.375, 3.6, 3.8571, 4, 4.5, 5, 5.1429, 5.4, 5.625, 6, 6.4286, 6.75, 7, 7.2, 7.5, 7.7143, 7.875, 8, 9]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The expected output for 99 can be found in &lt;a href=&quot;https://gist.github.com/ETHproductions/05fa4afd68ab13e441037249d1715c35&quot; rel=&quot;nofollow noreferrer&quot;&gt;this Gist&lt;/a&gt;. The length of each output corresponds to &lt;a href=&quot;http://oeis.org/A002088&quot; rel=&quot;nofollow noreferrer&quot;&gt;A002088&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input will be a positive integer less than 100.&lt;/li&gt;&#xA;&lt;li&gt;The output may be presented in any reasonable format. Entries can be represented as decimal numbers accurate to at least 3 decimal places, or as exact fractions if desired.&lt;/li&gt;&#xA;&lt;li&gt;The output may be unsorted, but it may not contain duplicates.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so &lt;strong&gt;the shortest code in bytes in each language wins.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="42545" LastEditorUserId="42545" LastEditDate="2017-07-07T23:52:33.237" LastActivityDate="2017-07-07T23:52:33.237" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13239" PostTypeId="2" ParentId="2140" CreationDate="2017-07-07T20:13:59.380" Score="1" Body="&lt;h1&gt;Escape the Labyrinth!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;You are stuck in a labyrinth. You only have your brain and a map. Now you need to find a way out, of course your brain doesn't have much memory (or else you wouldn't be stuck!) so you need to optimize your mental code for size. Of course we can't trivially program in the brain-language, so your brain will also accept any other language.&lt;/p&gt;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;Your input will be a Matrix. You may encode it however serves your language best as long as the format doesn't encode additional information. For the purpose of this challenge I will use a list of lists for representation and explanation.&lt;/p&gt;&#xA;&lt;p&gt;Said matrix will contain four distinct values:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;0&lt;/code&gt;: This marks a spot you can move onto&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1&lt;/code&gt;: This marks a wall&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;2&lt;/code&gt;: This marks the starting point&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;3&lt;/code&gt;: This marks the target point&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;It is guaranteed that there will be exactly one occurence of type-3 and type-2. You may also change the above values / data-types to your liking as long as you don't encode additional information.&lt;/p&gt;&#xA;&lt;p&gt;It is guaranteed that you will get an input that has a solution. If the input doesn't have a valid solution, the behavior is left undefined. Your program may not terminate, it may error out, it may simply return nothing, it may blow up, it may become a political activist or it may do something else.&lt;/p&gt;&#xA;&lt;p&gt;You may assume that the input labyrinth is walled-off, that is you can't actually &amp;quot;leave&amp;quot; the labyrinth.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;Your output will be sequence of four different values:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;L&lt;/code&gt;: Stands for left&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;R&lt;/code&gt;: Stands for right&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;U&lt;/code&gt;: Stands for Up&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;D&lt;/code&gt;: Stands for Down&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;You may change the values and data types of the above constants to your liking, as long as you document these changes and you can uniquely infer the path.&lt;/p&gt;&#xA;&lt;h3&gt;What to do?&lt;/h3&gt;&#xA;&lt;p&gt;Given the labyrinth, start your virtual character at the position tagged &lt;code&gt;2&lt;/code&gt; and find a way to the position tagged &lt;code&gt;3&lt;/code&gt;. You may not pass through walls (&lt;code&gt;1&lt;/code&gt; cells) and you may only go one step up, left, right or down in each step. You also need to document your action of course in each step, ie output it as described above.&lt;/p&gt;&#xA;&lt;p&gt;Note: You do not have to find the &lt;em&gt;shortest&lt;/em&gt; path, but rather &lt;em&gt;a&lt;/em&gt; path.&lt;/p&gt;&#xA;&lt;h3&gt;Who wins?&lt;/h3&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest solution in bytes wins! Standard &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/55329&quot;&gt;loophole rules&lt;/a&gt; apply of course. Standard &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/55329&quot;&gt;I/O rules&lt;/a&gt; also apply.&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;[ &#xA;[1,1,1,1,1,1,1,1,1,1],&#xA;[1,1,1,1,1,1,1,1,1,1],&#xA;[1,2,0,1,0,1,1,0,1,1],&#xA;[1,1,0,1,0,0,0,0,1,1],&#xA;[1,1,0,0,0,1,1,1,1,1],&#xA;[1,1,1,0,1,1,0,0,1,1],&#xA;[1,1,0,0,1,0,0,0,1,1],&#xA;[1,1,1,0,0,0,1,0,1,1],&#xA;[1,1,1,1,1,1,1,3,1,1],&#xA;[1,1,1,1,1,1,1,1,1,1] &#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;might result in:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Going right.&#xA;Going down.&#xA;Going down.&#xA;Going right.&#xA;Going down.&#xA;Going down.&#xA;Going down.&#xA;Going right.&#xA;Going right.&#xA;Going up.&#xA;Going right.&#xA;Going right.&#xA;Going down.&#xA;Going down.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="55329" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-08T11:31:39.513" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13240" PostTypeId="1" CreationDate="2017-07-07T21:34:34.237" Score="7" ViewCount="209" Body="&lt;p&gt;There has been some discussion lately about old questions that don't adhere to rules that are newer, such as flexible I/O. My question is simple: how should we go about answering these?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some ideas I have come up with:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Write a new question and close the old one as a duplicate, or freeze it&lt;/li&gt;&#xA;&lt;li&gt;Answer the old question under the new rules, and mention that in the answer&lt;/li&gt;&#xA;&lt;li&gt;Answer the old question under the old rules&lt;/li&gt;&#xA;&lt;li&gt;Update the question's rules, then answer it (Thanks @WheatWizard!)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="69054" LastEditorUserId="69054" LastEditDate="2017-07-07T21:48:45.400" LastActivityDate="2017-07-08T09:18:48.513" Title="How to answer old questions" Tags="|discussion|" AnswerCount="1" CommentCount="3" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13241" PostTypeId="2" ParentId="13210" CreationDate="2017-07-07T22:52:13.200" Score="13" Body="&lt;h2&gt;Not for all languages&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I estimate 15% of my Python golfs with list input could be shortened by taking in its length, if that were allowed. Hundreds of golfs in mainstream languages could be improved by mechanically replacing &quot;&lt;code&gt;len(l)&lt;/code&gt;&quot; or similar with an input parameter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These submissions strongly suggest that golfers wouldn't guess this to be allowed without knowing the rule specifically. This is a hidden rule of the worst kind -- broadly useful, unexpected, and likely to make golfs more boring on average.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm sympathetic to the problems languages like C have with cumbersome input processing, especially as they already have many disadvantages. Golfing languages can be designed around such issues, but C is stuck with them. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;But, I want to avoid the trend of giving all languages an easy extra workaround because one language really wants it. The result is a laundry list of liberties with input that go beyond taking it conveniently and naturally for the language, to doing parts of the golfing task in the input format, justified by citing obscure meta threads about other languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd rather say that this is a property of C that golfers need to deal with, or that a C-specific rule be made. Either one would be better than changing the rules for all languages.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2017-07-07T22:52:13.200" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13242" PostTypeId="2" ParentId="13194" CreationDate="2017-07-07T23:28:11.857" Score="-3" Body="&lt;h2&gt;Answers should comply with the problem specification&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, this means that your Unbalanced program would not be valid. The difference between it and the Octave example is that Octave's extraneous output is fixed, while the output from your program will vary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem is that it's simply too complicated to formulate a rule that would 1) allow users to choose subsets of their output to use and 2) not be ripe for abuse (i.e. printing the divmod in a challenge that asks for the remainder).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are many challenges that cannot be done reversibly. If you want to be able to answer these in a reversible language, your best bet is probably to write an interpreter with a flag that specifies to only use a subset of the output, thus breaking reversibility.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="44874" LastEditDate="2017-07-10T14:06:44.303" LastActivityDate="2017-07-10T14:06:44.303" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13243" PostTypeId="2" ParentId="2140" CreationDate="2017-07-08T00:13:49.150" Score="1" Body="&lt;h2&gt;ASCII Art Turtle&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As you know, the LOGO programming language allows you to manoeuvre a turtle and draw lines in a graphical way. It occurs to me that we can do this for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A minimal set of commands to produce &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; would be the R(otate right), F(orward) and P(en) commands. For example, the string &lt;code&gt;FPRRRFRRRRPFPRRRFRRRRPFPRRRFRRRRPFPRRRFRRRRPFPRRRFRRRRPFPRRRFRRRRPFPRRRFRRRRPF&lt;/code&gt; would produce the following output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;\|/&#xA;- -&#xA;/|\&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;However that AAT code is rather inconvenient so I have chosen the following slightly more compact instruction set:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;F&lt;/code&gt; Move one cell in the current direction. Initially the current direction is east. If the pen is down, the cell just vacated is set to one of &lt;code&gt;-/|\&lt;/code&gt; appropriately.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;B&lt;/code&gt; Move one cell in the reverse direction. (Initially this would be west, of course.) The cell vacated is set in the same way as for &lt;code&gt;F&lt;/code&gt; (since the output characters are all symmetric).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;R&lt;/code&gt; Rotate right 45°. Only the current direction changes; nothing is drawn and the current position does not move.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;L&lt;/code&gt; Rotate left 45°. Otherwise as per &lt;code&gt;R&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;D&lt;/code&gt; Lower the pen. Note that the pen starts lowered.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;U&lt;/code&gt; Raise the pen.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The above image could therefore be drawn using the command string &lt;code&gt;BULFDBULFDBULFDBULFDBULFDBULFDBULFDB&lt;/code&gt;, while the string &lt;code&gt;LFFUBRFDFFFFFFFFFFFFFFFFFRFFRFBRRFFFFFFFFFFFFFFFFFFFFFUBLLFDFFBLLFFFFFFFFFFFFFFFFFFFFFUBRRFDFRRFFFFFFFFFFFFFFFFFFFFFURBDBBUFLBDBBBBBBBBBLLFFFURBDBBBUFRBDBBBLBB&lt;/code&gt; should hopefully produce this somewhat familiar picture:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; /-----------------\ &#xA;/                   \&#xA;---------------------&#xA;|                   |&#xA;---------------------&#xA;|                   |&#xA;---------------------&#xA;\                   /&#xA; \---------|  /----/ &#xA;           | /       &#xA;           |/        &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your function or program must take input as a string, or whatever the nearest equivalent is in your language, and output a newline-delimited or newline-terminated string. (For those of you used to using TIO it should be possible to paste the raw string into the ▼ Input field and show the output directly in the ▼ Output field.) Extra blank rows or columns are not allowed, but you are allowed to pad all the lines to the length of the longest non-blank line. You can take input in lower or mixed case if you prefer. You can assume that the input will only use those six letters. You can further assume that &lt;code&gt;U&lt;/code&gt; and &lt;code&gt;D&lt;/code&gt; commands alternate. You can also assume that you will never write in the same place twice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2017-07-08T00:13:49.150" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13244" PostTypeId="2" ParentId="13240" CreationDate="2017-07-08T09:18:48.513" Score="9" Body="&lt;p&gt;It really depends on the specific challenge in question, and so there's not really a catch-all answer to this question. Some guidelines I would suggest:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the challenge doesn't explicitly require use of the old rules, an answer using new rules is valid, but you probably should mention the relevant rules in the answer.&lt;/li&gt;&#xA;&lt;li&gt;If minor edits (e.g. removing a cumbersome I/O format that isn't critical to the challenge) would bring the challenge in line with our current rules/standards, then that's probably a good option.&lt;/li&gt;&#xA;&lt;li&gt;If the challenge would require major edits (substantially changing the core of the challenge to comply with our modern rules/standards), then it's probably best to write a new challenge and have the old closed as a dupe.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;When in doubt, start a meta discussion about the specific challenge. A meta discussion should definitely take place before editing or rewriting a challenge.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-07-08T09:18:48.513" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13245" PostTypeId="2" ParentId="13225" CreationDate="2017-07-08T13:53:06.207" Score="5" Body="&lt;h1&gt;That structure is not self-contained&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;All the answers we expect must be self-contained.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The formulation &lt;code&gt;f=&amp;lt;args&amp;gt;=&amp;gt;&amp;lt;execution&amp;gt;&lt;/code&gt; is not self-contained.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Indeed, you can write &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;type&amp;gt; f=&amp;lt;args&amp;gt;=&amp;gt;&amp;lt;execution&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;But C# doesn't allow the following construct:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;foo.bar(f=&amp;lt;args&amp;gt;=&amp;gt;&amp;lt;execution&amp;gt;);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This latter construct requires that &lt;code&gt;f&lt;/code&gt; is typed before, like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;type&amp;gt; f;&#xA;foo.bar(f=&amp;lt;args&amp;gt;=&amp;gt;&amp;lt;execution&amp;gt;);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So, while a lambda alone is self-contained, the structure &lt;code&gt;f=&amp;lt;lambda&amp;gt;&lt;/code&gt; is not self-contained without the type of &lt;code&gt;f&lt;/code&gt;, and is therefore not following the global rules of PPCG.&lt;/p&gt;&#xA;" OwnerUserId="16236" LastActivityDate="2017-07-08T13:53:06.207" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13249" PostTypeId="2" ParentId="13231" CreationDate="2017-07-08T21:22:19.303" Score="8" Body="&lt;p&gt;Trichoplax has already said in comments what I was going to reply, but since it belongs in an answer rather than in comments:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the winning criterion is &quot;&lt;em&gt;shortest answer in bytes&lt;/em&gt;&quot; then it's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. It's as simple as that. If you want a meta-tag to indicate that the validity criterion includes a timed component, that's a different question.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-07-08T21:22:19.303" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13256" PostTypeId="1" CreationDate="2017-07-09T20:47:26.447" Score="-2" ViewCount="141" Body="&lt;p&gt;Let's face it: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/85/fibonacci-function-or-sequence&quot;&gt;our Fibonacci challenge&lt;/a&gt; is not great.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To quote a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/131513/fibtraction-fibonacci-but-with-subtraction&quot;&gt;recent effort of mine&lt;/a&gt; to improve on the situation:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;...the challenge is old and outdated; is severely under-specified; allows for two types of solutions; has answers that don't have easy ways to try online; and in general, is lacking of answers. Essentially, in my opinion, it doesn't serve as a good &quot;catalogue&quot; of solutions.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;But what can we do about it? Here are a few solutions I thought of:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;s&gt;Make an &quot;almost Fibonacci challenge&quot;&lt;/s&gt; Nope, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/131513/fibtraction-fibonacci-but-with-subtraction&quot;&gt;didn't go down well&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Make a new, canonical question&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What should we do with the answers to the old question?&lt;/li&gt;&#xA;&lt;li&gt;Can we merge the two questions?&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&quot;Bump&quot; the old question fitted to our current standards&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How can we attract more activity?&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="68615" LastEditorUserId="68615" LastEditDate="2017-07-09T22:48:06.133" LastActivityDate="2017-07-10T02:46:44.530" Title="Condition of our Fibonacci challenge" Tags="|discussion|" AnswerCount="1" CommentCount="5" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13258" PostTypeId="2" ParentId="13256" CreationDate="2017-07-10T00:53:35.880" Score="5" Body="&lt;p&gt;I don't see anything wrong with the current challenge.  I updated it to flexible IO a little while ago and added an actual specification.  The entire body of the question is actually pretty modern.  I even asked around if people thought it was clear and received only positive feedback.  That doesn't mean its perfect but I would not say that the question body is old or outdated, and I am perfectly willing to take responsibility for any land all problems present in the writeup of the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think that your complaint that it is &quot;in general lacking answers&quot; is simply false, as I mentioned in my comment it has 173 answers, which is &lt;em&gt;a lot&lt;/em&gt; of answers.  If this is a lack of answers I don't think anything can be done.  Fibonacci is probably not interesting to the majority of users at this point and I don't see everyone rushing to add hundreds more answers anytime soon.  If you want more answers you can post an answer yourself or bounty the question.  Reposting the question is a surefire way to get &lt;em&gt;less&lt;/em&gt; answers than there already are.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also think that it is not &quot;severely lacking&quot; in specification (A little bit biased because I wrote the current specification, so if I thought it was incomplete I would have added to it).  Any holes in the specification could be fixed with edits.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't think allowing for two types of solutions is a bad thing, flexible IO is in general &lt;em&gt;good&lt;/em&gt; for challenges even though one is less conventional I think it adds to the challenge.  The only reason I could see to not allow a method of output is to prevent abuse.  I don't think there is anyway to abuse the current method and I think answers that use it are no less valid than answers that use a traditional method.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't understand your comment about try it online, so I wont touch that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Overall I think the question is fine.  Minor edits can be made, but I don't think we need to do anything drastic, like make a new question or overhaul the existing challenge.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-07-10T02:46:44.530" LastActivityDate="2017-07-10T02:46:44.530" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13260" PostTypeId="2" ParentId="13194" CreationDate="2017-07-10T07:32:19.343" Score="13" Body="&lt;p&gt;As I see it, the difficulty here is that we need to define a standard output format which is both reversible and unique. A standard output format cannot be allowed to vary with the whims of the programmer as that would be open to abuse. However, if for every input there is a unique legal output which clearly contains the desired value, that should be fine. Thus I propose:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Make a standard output format for reversible languages the input followed by the desired output.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For instance, for the addition challenge:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a, b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;becomes&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a, b, a+b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is unique for every input, so it is not open to abuse, and it is guaranteed to be reversible.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2017-07-10T07:32:19.343" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13261" PostTypeId="2" ParentId="2140" CreationDate="2017-07-10T10:15:22.667" Score="1" Body="&lt;h1&gt;An order of primeness&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;In a &lt;a href=&quot;https://codegolf.stackexchange.com/q/130390/30013&quot; title=&quot;Is it a super-prime?&quot;&gt;recent question&lt;/a&gt; the concepts of super-primes were explored. A super-prime is a prime whose index is also a prime.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;2 is &lt;em&gt;not&lt;/em&gt; a super-prime, its index is &lt;code&gt;1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;3 is a super-prime, its index is &lt;code&gt;2&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;5 is a super-prime, its index is &lt;code&gt;3&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;7 is &lt;em&gt;not&lt;/em&gt; a super-prime, its index is &lt;code&gt;4&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The first few of these super-primes are &lt;code&gt;3&lt;/code&gt;, &lt;code&gt;5&lt;/code&gt;, &lt;code&gt;11&lt;/code&gt;, &lt;code&gt;17&lt;/code&gt;, &lt;code&gt;31&lt;/code&gt;, &lt;code&gt;41&lt;/code&gt;, &lt;code&gt;59&lt;/code&gt;, ...&lt;/p&gt;&#xA;&lt;p&gt;Let us call these primes of at least order 2, because they are more prime than regular primes (which are only of order 1).&lt;/p&gt;&#xA;&lt;p&gt;Primes of order of 3 or greater can be defined similar. A prime is of order 3 if its index is a prime of order 2.&lt;/p&gt;&#xA;&lt;p&gt;The first few of the primes at least of order 3 are &lt;code&gt;5&lt;/code&gt;, &lt;code&gt;11&lt;/code&gt;, &lt;code&gt;31&lt;/code&gt;, &lt;code&gt;41&lt;/code&gt;, &lt;code&gt;59&lt;/code&gt;, &lt;code&gt;127&lt;/code&gt;, &lt;code&gt;179&lt;/code&gt;, &lt;code&gt;277&lt;/code&gt;, ...&lt;/p&gt;&#xA;&lt;p&gt;This is sequence &lt;a href=&quot;https://oeis.org/A049076&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;   Number of steps in the prime index chain for the n-th prime.&quot;&gt;A049076&lt;/a&gt;. It was defined by Neil Fernandez in 1999. More information can be found in his &lt;a href=&quot;http://borve.org/primeness/FOP.html&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;An order of primeness, F(p)&quot;&gt;Exploring Primeness Project&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Given a prime, return its order.&lt;br /&gt;&#xA;More formally&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;INPUT&lt;/strong&gt;: A single integer which is guaranteed to be a prime&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;OUTPUT&lt;/strong&gt;: A single integer which is the order of the input.&lt;/li&gt;&#xA;&lt;li&gt;You can either return or print the result.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins.&lt;/p&gt;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;           2 -&amp;gt;  1&#xA;           3 -&amp;gt;  2&#xA;           5 -&amp;gt;  3&#xA;           7 -&amp;gt;  1&#xA;       52711 -&amp;gt;  9&#xA;435748987787 -&amp;gt; 11 (happens to be the 11. Prime of order 11)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Sandbox Questions&lt;/h1&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Does it need any more clarification?&lt;/li&gt;&#xA;&lt;li&gt;Should I define order 0 (not a prime) and allow any number as input, or would that over-complicate the challenge?&lt;/li&gt;&#xA;&lt;li&gt;Primes of higher order tend to get big very fast. Should I somehow specify that a language only has to work for test-cases it can actually handle or is their a consensus already?&lt;/li&gt;&#xA;&lt;li&gt;Is the introduction too big?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="30013" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-10T10:31:38.993" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13262" PostTypeId="2" ParentId="2447" CreationDate="2017-07-10T15:37:30.363" Score="25" Body="&lt;h1&gt;An array may be represented in input as a pointer and length.&lt;/h1&gt;&#xA;&lt;p&gt;For example in C you could use:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;int f(int*p,int l){...}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="31203" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-11-12T04:56:13.887" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="13263" PostTypeId="2" ParentId="13210" CreationDate="2017-07-10T16:00:43.777" Score="0" Body="&lt;h2&gt;We have a catalog for this already...&lt;/h2&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/31203&quot;&gt;Default Input/Output methods&lt;/a&gt; question is made to answer these sorts of questions. I have created an answer to that question*, for representing an array as a pointer and length. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13262/31203&quot;&gt;link&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I think the best way to settle this question is voting on that answer.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;*As I commented &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/13210/list-input-in-c-and-length-argument?cb=1#comment46911_13210&quot;&gt;above&lt;/a&gt;, an old answer proposed this, but was deleted, so I chose to propose my own version.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="31203" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-10T16:00:43.777" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13268" PostTypeId="1" CreationDate="2017-07-10T22:47:41.303" Score="4" ViewCount="202" Body="&lt;p&gt;I have a challenge, that I don't like.  I think the challenge has a negative impact on the community, and I think we would all benefit from it being gone.  I decided I was willing to part with my meager rep gains, so I went to delete it. However I was told I could not because it had an answer.  So instead I cut it down to a stub and voted to close as off topic.  This was reverted as vandalism, which in retrospect it probably was.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As the challenge asker is there any way to get a bad challenge of mine deleted or closed?  What rights do I have to a challenge that I wrote?  Can I disown my challenge?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-09-05T15:01:57.577" LastActivityDate="2017-09-14T19:03:30.850" Title="Can I delete my own question?" Tags="|discussion|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13269" PostTypeId="2" ParentId="13231" CreationDate="2017-07-10T23:03:59.773" Score="19" Body="&lt;p&gt;PPCG has two types of tags: Winning condition tags, and everything else. For this type of challenge, the winning condition is clear: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, we should still have a tag to indicate what's going on in this type of problem, so that people know what to expect when looking at the question in the list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I suggest creating the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-time&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-time&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-time&lt;/a&gt;, parallel to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;, and using it to tag such questions. I'm open to suggestions for other tag names.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2017-07-10T23:03:59.773" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13270" PostTypeId="2" ParentId="13268" CreationDate="2017-07-11T02:52:38.840" Score="7" Body="&lt;p&gt;&lt;strong&gt;As the challenge asker is there any way to get a bad challenge of mine deleted or closed?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;No. You can take part in a closure, but you still need more people that agree with you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;What rights do I have to a challenge that I wrote?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is still &lt;em&gt;your&lt;/em&gt; challenge, but by posting it&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;[y]ou grant Stack Exchange the perpetual and irrevocable right and license to use, copy, cache, publish, display, distribute, modify, create derivative works and store [it].&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;&lt;a href=&quot;https://stackexchange.com/legal/terms-of-service#3SubscriberContent&quot;&gt;source&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That means Stack Exchange can prevent you from deleting it, editing it down to a stub, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Should I disown my challenge by making a community wiki?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you simply don't want it to be &lt;em&gt;your&lt;/em&gt; challenge anymore, &lt;a href=&quot;https://meta.stackexchange.com/a/96746/170332&quot;&gt;this&lt;/a&gt; is you best option imo.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If you would like to have your name disassociated from that post, you can request we do so by clicking on the 'contact us' link at the bottom of the page.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-07-11T02:52:38.840" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13271" PostTypeId="2" ParentId="2140" CreationDate="2017-07-11T08:54:30.537" Score="0" Body="&lt;h1&gt;Let's simplify polynomials&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In many situations we have to expand mathematical expressions containing variables, for example, calculating characteristic polynomials, expanding products of polynomials, etc. It is trivial if the variables are known (in this case, we just substitute the variables with the corresponding values and evaluate the expression by a calculator), but not so simple if we need to manually expand the expression.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Motivation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Consider the cases with only one variable (say, x). Suppose the coefficients are &lt;em&gt;sufficiently small&lt;/em&gt;. Then, a simple way is to take x to be some number (e.g. 1000), evaluate the expression and convert the numerical answer back to a polynomial.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is an example. Suppose we need to expand &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://latex.codecogs.com/gif.latex?det%5Cbegin%7Bbmatrix%7D&amp;space;1-x&amp;space;&amp;amp;&amp;space;2&amp;space;&amp;amp;&amp;space;3%5C%5C&amp;space;4&amp;space;&amp;amp;&amp;space;5-x&amp;space;&amp;amp;&amp;space;6%5C%5C&amp;space;7&amp;space;&amp;amp;&amp;space;8&amp;space;&amp;amp;&amp;space;9-x&amp;space;%5Cend%7Bbmatrix%7D&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Put &lt;img src=&quot;https://latex.codecogs.com/gif.latex?x&amp;space;=&amp;space;1000&quot; alt=&quot;&quot;&gt; and evaluate it using a dumb calculator. The answer is &lt;img src=&quot;https://latex.codecogs.com/gif.latex?-984982000&quot; alt=&quot;&quot;&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By running the program/function with input &lt;code&gt;-984982000&lt;/code&gt;, one should get&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[-1, 15, 18, 0] (descending order)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;, and so the expanded polynomial is &lt;img src=&quot;https://latex.codecogs.com/gif.latex?-x%5E3&amp;plus;15x%5E2&amp;plus;18x&quot; alt=&quot;&quot;&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program or function which satisfies the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input is an integer, which is calculated by substituting x = 1000 in a polynomial (which you have to find out).&lt;/li&gt;&#xA;&lt;li&gt;Output the coefficients, guaranteed to be in the range [-499,499] (inclusive), and to be integers. You can represent the polynomial in either ascending or descending order, so long as it is consistent across different runs. You can return a list of integers, print to standard output (with non-numeric separators), etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input         Output (descending power)&#xA;1003005007    1 3 5 7&#xA;1001          1 1&#xA;999           1 -1&#xA;998994        1 -1 -6&#xA;-998994       -1 1 6&#xA;1000001       1 0 1&#xA;0             0&#xA;&#xA;&#xA;Input&#xA;1003005007&#xA;&#xA;Valid outputs                     Invalid outputs&#xA;[1 3 5 7] (descending order)      1357 (coefficients are not separated)&#xA;[7 5 3 1] (ascending order)       7531 (coefficients are not separated)&#xA;&quot;1 3 5 7&quot; (descending order)      &quot;1357&quot; (coefficients are not separated)&#xA;&quot;7, 5, 3, 1&quot; (ascending order)    [1 5 3 7] (neither ascending nor descending order)&#xA;7                                 &quot;10305070&quot; (numeric separator &quot;0&quot;)&#xA;5&#xA;3&#xA;1 (ascending order)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Standard loophole applies.&lt;/li&gt;&#xA;&lt;li&gt;Your program/function should be able to at least handle polynomials of degree 3. Also, the input might be negative. Therefore, using a suitable data type is necessary.&lt;/li&gt;&#xA;&lt;li&gt;You can take the input in integer or string format. It is guaranteed that the input is a valid integer.&lt;/li&gt;&#xA;&lt;li&gt;The shortest program/function (in bytes) wins. Good luck!&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="66871" LastEditorUserId="66871" LastEditDate="2017-07-11T10:33:10.507" LastActivityDate="2017-07-11T10:33:10.507" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="13277" PostTypeId="2" ParentId="2140" CreationDate="2017-07-11T20:08:46.230" Score="1" Body="&lt;h2&gt;These are two separate challenges.&lt;/h2&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Convert to mixed-radix ZYX…432.234…XYZ&lt;/h1&gt;&#xA;&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13277/43319&quot;&gt;Convert from mixed-radix ZYX…432.234…XYZ&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/11735/convert-to-and-from-the-factorial-number-system&quot;&gt;Convert to and from the factorial number system&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Given a non-negative real number (no greater than 1×10&lt;sup&gt;40&lt;/sup&gt; or the biggest your language can comfortably accommodate, whichever is less) convert it to mixed-radix ZYX…432.234…XYZ using the base-36 digits [0-9A-Z] or [0-9a-z] with no leading zeros (except for values smaller than 1). Any reasonable rounding is fine.&lt;/p&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;&lt;code&gt;0&lt;/code&gt; → &lt;code&gt;0&lt;/code&gt; (&lt;strong&gt;0&lt;/strong&gt; × !1)&lt;br /&gt;&#xA;&lt;code&gt;1&lt;/code&gt; → &lt;code&gt;1&lt;/code&gt; (&lt;strong&gt;1&lt;/strong&gt; × !1)&lt;br /&gt;&#xA;&lt;code&gt;2&lt;/code&gt; → &lt;code&gt;10&lt;/code&gt; (&lt;strong&gt;1&lt;/strong&gt; × !2 + &lt;strong&gt;0&lt;/strong&gt; × !1)&lt;br /&gt;&#xA;&lt;code&gt;3&lt;/code&gt; → &lt;code&gt;11&lt;/code&gt; (&lt;strong&gt;1&lt;/strong&gt; × !2 + &lt;strong&gt;1&lt;/strong&gt; × !1)&lt;br /&gt;&#xA;&lt;code&gt;4&lt;/code&gt; → &lt;code&gt;20&lt;/code&gt; (&lt;strong&gt;2&lt;/strong&gt; × !2 + &lt;strong&gt;0&lt;/strong&gt; × !1)&lt;br /&gt;&#xA;&lt;code&gt;42&lt;/code&gt; → &lt;code&gt;1300&lt;/code&gt; (&lt;strong&gt;1&lt;/strong&gt; × !4 + &lt;strong&gt;3&lt;/strong&gt; × !3 + &lt;strong&gt;0&lt;/strong&gt; × !2 + &lt;strong&gt;0&lt;/strong&gt; ×!1)&lt;br /&gt;&#xA;&lt;code&gt;100&lt;/code&gt; → &lt;code&gt;4020&lt;/code&gt; (&lt;strong&gt;4&lt;/strong&gt; × !4 + &lt;strong&gt;0&lt;/strong&gt; × !3 + &lt;strong&gt;2&lt;/strong&gt; × !2 + &lt;strong&gt;0&lt;/strong&gt; ×!1)&lt;br /&gt;&#xA;&lt;code&gt;12345&lt;/code&gt; → &lt;code&gt;2304111&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;4294967295&lt;/code&gt; → &lt;code&gt;8B6570020211&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;10000000000&lt;/code&gt; → &lt;code&gt;17A5726651220&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;18446744073709551615&lt;/code&gt; → &lt;code&gt;7BC43F35350835000211&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;0.5&lt;/code&gt; → &lt;code&gt;0.1&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;0.333333333333333333&lt;/code&gt; → &lt;code&gt;0.02&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;0.25&lt;/code&gt; → &lt;code&gt;0.112&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;0.1&lt;/code&gt; → &lt;code&gt;0.0022&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;5.125&lt;/code&gt; → &lt;code&gt;21.003&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;2.718281828459045235&lt;/code&gt; → &lt;code&gt;1.111111111111111111&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;0.001388888888888889&lt;/code&gt; → &lt;code&gt;0.00001&lt;/code&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Convert from mixed-radix ZYX…432.234…XYZ&lt;/h1&gt;&#xA;&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13277/43319&quot;&gt;Convert to mixed-radix ZYX…432.234…XYZ&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/11735/convert-to-and-from-the-factorial-number-system&quot;&gt;Convert to and from the factorial number system&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Given a string (no longer than 71 characters or the maximum that gives a result your language can comfortably accommodate, whichever is less) convert it from mixed-base mixed-radix ZYX…432.234…XYZ using the base-36 digits [0-9A-Z] or [0-9a-z]. Any reasonable rounding is fine.&lt;/p&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;&lt;code&gt;0&lt;/code&gt; (&lt;strong&gt;0&lt;/strong&gt; × !1) → &lt;code&gt;0&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;1&lt;/code&gt; (&lt;strong&gt;1&lt;/strong&gt; × !1) → &lt;code&gt;1&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;10&lt;/code&gt; (&lt;strong&gt;1&lt;/strong&gt; × !2 + &lt;strong&gt;0&lt;/strong&gt; × !1) → &lt;code&gt;2&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;11&lt;/code&gt; (&lt;strong&gt;1&lt;/strong&gt; × !2 + &lt;strong&gt;1&lt;/strong&gt; × !1) → &lt;code&gt;3&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;20&lt;/code&gt; (&lt;strong&gt;2&lt;/strong&gt; × !2 + &lt;strong&gt;0&lt;/strong&gt; × !1) → &lt;code&gt;4&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;1300&lt;/code&gt; (&lt;strong&gt;1&lt;/strong&gt; × !4 + &lt;strong&gt;3&lt;/strong&gt; × !3 + &lt;strong&gt;0&lt;/strong&gt; × !2 + &lt;strong&gt;0&lt;/strong&gt; ×!1) → &lt;code&gt;42&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;4020&lt;/code&gt; (&lt;strong&gt;4&lt;/strong&gt; × !4 + &lt;strong&gt;0&lt;/strong&gt; × !3 + &lt;strong&gt;2&lt;/strong&gt; × !2 + &lt;strong&gt;0&lt;/strong&gt; ×!1) → &lt;code&gt;100&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;2304111&lt;/code&gt; → &lt;code&gt;12345&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;8B6570020211&lt;/code&gt; → &lt;code&gt;4294967295&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;17A5726651220&lt;/code&gt; → &lt;code&gt;10000000000&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;7BC43F35350835000211&lt;/code&gt; → &lt;code&gt;18446744073709551615&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;0.1&lt;/code&gt; → &lt;code&gt;0.5&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;0.02&lt;/code&gt; → &lt;code&gt;0.333333333333333333&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;0.112&lt;/code&gt; → &lt;code&gt;0.25&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;0.0022&lt;/code&gt; → &lt;code&gt;0.1&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;21.003&lt;/code&gt; → &lt;code&gt;5.125&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;1.111111111111111111&lt;/code&gt; → &lt;code&gt;2.718281828459045235&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;0.00001&lt;/code&gt; → &lt;code&gt;0.001388888888888889&lt;/code&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base-conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; rel=&quot;tag&quot;&gt;base-conversion&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/factorial&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;factorial&amp;#39;&quot; rel=&quot;tag&quot;&gt;factorial&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-14T14:27:12.800" CommentCount="21" ContentLicense="CC BY-SA 3.0" />
  <row Id="13278" PostTypeId="2" ParentId="13178" CreationDate="2017-07-11T21:44:47.027" Score="0" Body="&lt;p&gt;In my personal opinion, the best way to accomplish this would be to do one of the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Allow OEIS tags like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/a000001&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;a000001&amp;#39;&quot; rel=&quot;tag&quot;&gt;a000001&lt;/a&gt; then use the SE API to find them.&lt;/li&gt;&#xA;&lt;li&gt;Create a standard in titles like: &lt;code&gt;[A000001] {TITLE CONTENT}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Personally, I think the first wouldn't be too bad, unless you're trying to search for tags using just 'a'. Maybe even using a different tag convention like &lt;code&gt;OEIS000001&lt;/code&gt; would be better?&lt;/p&gt;&#xA;" OwnerUserId="59376" LastActivityDate="2017-07-11T21:44:47.027" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13280" PostTypeId="1" CreationDate="2017-07-11T23:05:11.410" Score="-1" ViewCount="141" Body="&lt;p&gt;So, I've been personally noticing that the difficulty of our average challenge has seemed to progress higher and higher as I've been a member. No longer do we see alphabet challenges, nor as many OEIS challenges. I have a question for the community in regards to this progression; is this a good thing? Or is it a bad thing?&lt;/p&gt;&#xA;&lt;h1&gt;The Good&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Experienced users get more of a challenge.&lt;/li&gt;&#xA;&lt;li&gt;Experienced users can use languages they know to compete immediately.&lt;/li&gt;&#xA;&lt;li&gt;Experienced users can spend 1 hour on an answer and maybe win.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;The Bad&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Inexperienced users will not want to compete.&lt;/li&gt;&#xA;&lt;li&gt;Inexperienced users are basically not getting a chance.&lt;/li&gt;&#xA;&lt;li&gt;There's no longer a quick challenge for experienced users to complete, meaning any answer I want to do will take 30 minutes minimum.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Any additional input on this matter? Honestly I even miss competing in simplistic 10 minute alphabet challenges even if they've been done to death.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-12T07:20:37.487" Title="We're Lacking Trivial Questions" Tags="|discussion|" AnswerCount="2" CommentCount="6" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13281" PostTypeId="2" ParentId="13280" CreationDate="2017-07-12T07:12:46.377" Score="6" Body="&lt;p&gt;Back in the Good Old Days trivial challenges were downvoted to oblivion and closed as &quot;Too narrow&quot;. An easy challenge was one I could solve on paper in 25 chars of GolfScript while walking home and then debug when I got home for a total of two hours' effort. You may have joined during a local spike in the number of trivial questions,  but the general trend is up.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Experienced users get more of a challenge.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;All&lt;/em&gt; users get more of a challenge from more interesting questions. And given that the intellectual challenge is the only sane reason for being on this site, that's obviously a good thing. How many golf courses have par 1 holes?&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Experienced users can use languages they know to compete immediately.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;You've lost me here. If you think that with 20k rep comes the ability to write a 30 char Jelly answer in five minutes then you're wrong.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Experienced users can spend 1 hour on an answer and maybe win.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;OK, so maybe you're taking about the borderline between trivial and easy? I don't think any of the questions which I consider &lt;em&gt;worth&lt;/em&gt; winning took less than 4 hours, and sometimes it took longer than that just to get a &lt;em&gt;working&lt;/em&gt; answer.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Inexperienced users will not want to compete.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If they don't want a challenge, they should find a hobby which isn't inherently challenging.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Inexperienced users are basically not getting a chance&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Here I think you've got it completely backwards. Trivial questions get flooded with optimal answers in ten minutes. My recent question is 36 hours old and has just two answers in Python and two in Haskell. Which gives a newbie more chance?&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;There's no longer a quick challenge for experienced users to complete, meaning any answer I want to do will take 30 minutes minimum.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Good. Maybe we'll be able to find the ones that are interesting to think about because they won't be buried in dross.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-07-12T07:12:46.377" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13282" PostTypeId="2" ParentId="13280" CreationDate="2017-07-12T07:20:37.487" Score="0" Body="&lt;p&gt;While there seems to be disagreement over the premise of the question, I also note that you haven't proposed a solution to your perceived problem. There is one obvious solution. We could make a policy exemption for trivial questions in order to create space for more trivial questions, by allowing reposting of questions which have been deleted having been found guilty of triviality by a jury of high-rep users (20k+) and mods. If any of them &lt;em&gt;don't&lt;/em&gt; get reposted, nothing of value would be lost.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-07-12T07:20:37.487" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13284" PostTypeId="2" ParentId="2140" CreationDate="2017-07-12T17:49:36.497" Score="1" Body="&lt;h1&gt;Stitch the Genome&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/bioinformatics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;bioinformatics&amp;#39;&quot; rel=&quot;tag&quot;&gt;bioinformatics&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Introduction&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;As you probably know DNA (deoxyribonucleic acid) is made up of &lt;em&gt;bases&lt;/em&gt;, often denoted as A T C and G. One of the coolest things we can do with DNA is sequence it, or figure out what sequence of base pairs make up the molecule. Sequencing small molecules of DNA is easy, but it is hard to sequence long strands without error. Instead, the long strands are copied many times, then cut up into many little pieces. Those pieces are then fed through the sequencer. What we end up getting are many, many sets of pieces of the strand. In each set, we are near-guaranteed to get every base in the strand, but they aren't in any order. The solution, then, is to compare all of the different sets of strand pieces we have, and try and figure out how to put them together.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your challenge is, given a set of strand pieces, output a possible sequence of the original strand. To simplify real life a bit, you can expect that each set will always contain the entire strand sequence (not in order, mind you), and that there will be at least one possible sequence. Observe a simple example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA; - [ATC, G]&#xA; - [CG, AT]&#xA;Output: ATCG&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;From the first input, we deduce two possibilities: &lt;code&gt;ATCG&lt;/code&gt; and &lt;code&gt;GATC&lt;/code&gt;. From the second input, we deduce another two possibilities: &lt;code&gt;CGAT&lt;/code&gt; and &lt;code&gt;ATCG&lt;/code&gt;. As you can see, the only common possibility is &lt;code&gt;ATCG&lt;/code&gt;, and thus that is our answer. Let's look at another example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA; - [AT, G, C]&#xA; - [A, TG, C]&#xA;Output: ATGC or CATG&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here, we deduce six possibilities from the first input: &lt;code&gt;ATGC&lt;/code&gt;, &lt;code&gt;ATCG&lt;/code&gt;, &lt;code&gt;GATC&lt;/code&gt;, &lt;code&gt;GCAT&lt;/code&gt;, &lt;code&gt;CATG&lt;/code&gt; and &lt;code&gt;CGAT&lt;/code&gt;. Then, from the second input, we deduce another six possibilities: &lt;code&gt;ATGC&lt;/code&gt;, &lt;code&gt;ACTG&lt;/code&gt;, &lt;code&gt;TGAC&lt;/code&gt;, &lt;code&gt;TGCA&lt;/code&gt;, &lt;code&gt;CTGA&lt;/code&gt; and &lt;code&gt;CATG&lt;/code&gt;. Since there are two common possibilities, &lt;code&gt;ATGC&lt;/code&gt; and &lt;code&gt;CATG&lt;/code&gt;, we can output either one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Essentially, this problem can be reduced to: &lt;code&gt;find a common permutation of the input&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Specifics&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may write a program or function&lt;/li&gt;&#xA;&lt;li&gt;You may input in any acceptable format (array of arrays, list of lists, separated string, etc.). Furthermore, you may substitute &lt;code&gt;A&lt;/code&gt; &lt;code&gt;T&lt;/code&gt; &lt;code&gt;C&lt;/code&gt; and &lt;code&gt;G&lt;/code&gt; in your input with any other unique values, as long as you're consistent&lt;/li&gt;&#xA;&lt;li&gt;You may output in any acceptable format&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes apply&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA; - Pieces 1&#xA; - Pieces 2&#xA; - Etc.&#xA;Possible Outputs: [Possible output 1, possible output 2, etc.]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: &#xA; - [G, A, C, C, T, A, G]&#xA; - [GAC, C, TAG]&#xA; - [G, AC, CT, AG]&#xA; - [GA, CC, T, A, G]&#xA;Possible Outputs: [GACCTAG]&#xA;&#xA;Input: &#xA; - [G, C, G, C]&#xA; - [G, C, GC]&#xA; - [G, CG, C]&#xA;Possible Outputs: [GCCG, CGCG, GCGC, CGGC]&#xA;&#xA;Input: &#xA; - [TA, A]&#xA; - [TA, A]&#xA; - [T, AA]&#xA;Possible Outputs: [TAA]&#xA;&#xA;Input: &#xA; - [CC, T, A]&#xA; - [CC, T, A]&#xA; - [C, CT, A]&#xA;Possible Outputs: [CCTA, ACCT]&#xA;&#xA;Input: &#xA; - [GAG, C, T, C]&#xA; - [GA, G, C, TC]&#xA; - [GA, G, C, T, C]&#xA; - [G, A, G, C, T, C]&#xA; - [G, AGC, TC]&#xA;Possible Outputs: [GAGCTC, TCGAGC]&#xA;&#xA;Input: &#xA; - [AG, A, C, A, T, G]&#xA; - [AG, A, C, A, T, G]&#xA; - [AGAC, A, TG]&#xA; - [AGA, CA, T, G]&#xA; - [A, G, AC, A, T, G]&#xA; - [A, G, A, C, ATG]&#xA;Possible Outputs: [AGACATG]&#xA;&#xA;Input: &#xA; - [C, A, A, C, T]&#xA; - [CA, A, C, T]&#xA; - [CA, A, C, T]&#xA; - [C, A, AC, T]&#xA; - [C, A, A, C, T]&#xA; - [C, AA, C, T]&#xA;Possible Outputs: [CAACT, TCAAC]&#xA;&#xA;Input: &#xA; - [CA, G, C]&#xA; - [CAG, C]&#xA;Possible Outputs: [CAGC, CCAG]&#xA;&#xA;Input: &#xA; - [A, GT]&#xA; - [A, G, T]&#xA; - [AG, T]&#xA;Possible Outputs: [AGT]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There is a set of 100 random test cases &lt;a href=&quot;https://gist.github.com/SocraticPhoenix/167f4f62d1513b69e70c0c27da8fd16f&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;, or you can check out the &lt;a href=&quot;https://tio.run/##nVdbb9s2FH7XrzjLHkIhtpKmHQbESYAsKLaguwRLgD0UfaBlOqYrUypJJc0K//bs8CJZEikjqx50Ib9z4/l4DrWmj3RaVkysF59fXvimKqWGNQ5mteZFdiUlff6dKz1LgrnfqFrdsdjMjWaS6lJGpkZ0/U3FotxEJuIGlJaMbrLrsihYjobULEmqel7wHPKCKgV/UC7gW5IAXn5Caarx8VjyBWxwmtxpycXDx09A5YNKEQ3@WpYSCBcaOFzAyQwf5/DmxLwcHXVx5jLxnNubU3d5CZopjYIPTFxTxUg6CwU8FqpSKT4vGMKbV2LEBzLGF8X/7cIy8z3U/bTiqItoWbOhnyO@5mX1jFrzohRRy@YymEyyTfnIiH13pmEKbyJovnQgrt5vKv1M0pgn5ppjCj@H8ltghWIjMsHinXZXztiNeOS9svDG94sLu6BjvpnLp9EonY2CBgk8jSP3xrRnLaxssn9kmySRQDsUgUt4h3HC8fH9P@@vPpyBXsnyCcpawyMtaqbgiesVbErJcIoKeLeLigr1xKQKkzyd9r0djfDuWWm2ydBaVmHadCHIwY2oan0GB5Fc4dYj/SRT3PhnNhljyYqZQHIewJGVjljZvsrN22YV/qo1OqzOnEo/GlEbUTJA7Qy7N588RD9SzZoSla@otGVJIq2@HV4dTuDw3tyuze3Xw@0sUtcim7utQJ2Fi8AkUuACBHuCttqfX3Y9d8UZpHs4qBszqKRbpQomFPuCGAfOBPuqb4QmyMAjeDvbkVAxU7nx8aVmImdG8AFZuJRo4e3051ap8/KXmhcLJsHpNvZ7411n2@K9dsV7jcXbeYXvYf3G8YxW2P8WBNf748BtHMqcZ@mnjo1tEHQY8U8jEf8I5RKlDKHCaGOdB7WPd552m3CW2zRizm/tOzGR6dIBSDrx/g0IeXzseygvhcrUql4usZA6bSMiSJeMLhYeFF8VyXQthYHOejwPGdsEsPPbjbTMmPTpF3A5WIE9RB5NVmPMJ9s2t1OTwNORBDpr35U3CxOL1zhxbL09wj5rbv00OA9sJlpBVc@Vy/fJxNhIB6lrd9sFRGSMwCwJSxW2lB9a@Ghbj/gT1eap4eCvZUfb4iPlq7Gmxqmxa9J7yBG0ngI/4Cyu35YmtsOuSy6Yyal7uWVyU5s4cFcRo2d4oOt06b0HpRaF63pVFMSpT1/ZfJtzeOsmx4HuIZJ7AIl0M3@YNJBsRdWfyNLxw5zhiPMty0uh8XitnKRwYvsOWhbnz5fp9x6CxotQE2zLtQjZwlT2MtijhdstPTY0lroyDcz/q5A029DKcgGmjlu7GckWdc7IwcEECJ3APDUQint@nqa4nrZAk93PjinrzKzqnu1jIurvk@r/RBSK704J/r@vv3t62oNdNmlsTIyejtirGoX9ZRt3v5Jsyb9OIBbTJB5JN1RTj01L8BLBjxVfAhHmh@FkSOK2E1oHutUutiFjPSLeIcICZg3k7Y9aYLDNggO6KuzjeUCq8DQCjq3XzkZDilCugTZ7lncPgVE@eLdaFuRDGuw5G8cOyOf3l857fDpvmy9ba4d9AMfF/tovmvo6qNWenqIl5zZ5efkP&quot; rel=&quot;nofollow noreferrer&quot;&gt;java program&lt;/a&gt; that generated them.&lt;/p&gt;&#xA;" OwnerUserId="56085" LastEditorUserId="56085" LastEditDate="2017-07-12T19:11:21.383" LastActivityDate="2017-07-12T19:11:21.383" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13285" PostTypeId="1" CreationDate="2017-07-12T19:43:06.493" Score="4" ViewCount="191" Body="&lt;p&gt;I want to make a complicated code golf challenge (with a time limit ;). In this particular case I want people to golf the Elliptic-Curve Method to factorization.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now there are two issues with planning this challenge, on which I'd like to ask for &quot;official&quot; guidance:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Implementing this algorithm will be &lt;em&gt;very&lt;/em&gt; work-intensive (one needs to implement a specific set of group operations efficiently and then on top of that implement the actual non-trivial algorithm), can and / or should I split this into several challenges that build upon each other or is it preferred to have this as one big challenge?&lt;/li&gt;&#xA;&lt;li&gt;There are also languages (MATL, Sagemath and Mathematica would be my guesses) that have built-ins for certain core operations (like implementing said group), should I let people &quot;just deal with it&quot; or would it be preferred to allow code re-use with minimal penalty? For example one would need addition (probably 30-100 bytes for languages without built-in), could  / should I allow people to re-use functions / programs from pre-existing challenges at the costs of the associated call?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The second point would also allow people to make other potentially interesting challenges, for example: &quot;Given a function that finds a non-trivial factor of a number (as a 'built-in'), write a function / program that outputs the prime factorization of a number.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My current idea for a policy for the second point would read as:&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;You are allowed to define a helper function that will not count&#xA;  towards your total bytes, only calls to this function will count. If&#xA;  your language supports functions and you want to use this helper, you&#xA;  &lt;em&gt;have&lt;/em&gt; to use a call. If your language does not support functions, you may inline the code instead and for each occurence of the same&#xA;  function with formal parameter replacements you have to add 5 bytes&#xA;  and 2 bytes per argument per function call to your byte count but are&#xA;  allowed to not count the inlined function towards your byte count.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;One possible additional restriction here would be to limit the source of the helper function to competing answers to an existing, defined code-golf question. &lt;/p&gt;&#xA;" OwnerUserId="55329" LastEditorUserId="56656" LastEditDate="2017-07-12T20:44:49.850" LastActivityDate="2017-07-12T20:44:49.850" Title="How to handle large, complex challenges and built-ins?" Tags="|discussion|code-golf|" AnswerCount="0" CommentCount="7" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13286" PostTypeId="1" CreationDate="2017-07-12T20:39:29.400" Score="-8" ViewCount="286" Body="&lt;p&gt;As usual, I was going about my day, occasionally stopping by SE chat. I replied to &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/38735177#38735177&quot;&gt;this message&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/caird-coinheringaahing&quot;&gt;@cairdcoinheringaahing&lt;/a&gt; (&quot;I really need to stop clicking on every link that is posted&quot;) with &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/38735205#38735205&quot;&gt;this other message&lt;/a&gt; (&quot;@cairdcoinheringaahing &lt;a href=&quot;https://youtube.com/watch?v=dQw4w9WgXcQ&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try this one&lt;/a&gt;&quot;) as a joke. The link was a rickroll.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I was promptly and deservedly kicked from the chatroom by @DJMcMayhem, and the messages were moved to trash. There was a small amount of discussion about them. I thought the discussion was over. I returned to writing a website in Rails.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, when I returned to the chatroom, I found this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Nhlrt.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Nhlrt.png&quot; alt=&quot;Image of 364 day suspension&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I was shocked. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can anyone please offer an explanation?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Note: This prevents me from chatting in any room, not just TNB.)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;E: Not a dupe of my other question, the context and situation is very different&lt;/p&gt;&#xA;" OwnerUserId="53551" LastEditorUserId="53551" LastEditDate="2017-07-12T22:13:16.440" LastActivityDate="2017-07-12T22:13:16.440" Title="Very long chat suspension for harmless joke" Tags="|support|chat|" AnswerCount="1" CommentCount="2" ClosedDate="2017-07-13T13:06:05.373" ContentLicense="CC BY-SA 3.0" />
  <row Id="13287" PostTypeId="2" ParentId="13286" CreationDate="2017-07-12T20:47:42.313" Score="14" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12219/12012&quot;&gt;We've been over this before.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Long-term suspensions are rarely handed out because of a single message. However, you constantly succeed in lowering the signal-to-noise ratio. You have been told several times that this isn't acceptable in The Nineteenth Byte.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We've failed to see any improvements in your behavior since your last suspension. The large amount of kicks you received since then should have served as a warning.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-07-12T20:47:42.313" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13289" PostTypeId="2" ParentId="2140" CreationDate="2017-07-13T03:39:12.583" Score="3" Body="&lt;h1&gt;Is there a total ordering? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;TL;DR:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a set of strings, determine whether the characters expose a total ordering based on location in the strings.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;In this challenge, strings are used as a predicate to determine the order in which characters should appear in this set. For example, the string&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&quot;ONE&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Says:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;All instances of &quot;N&quot; should appear only after instances of &quot;O&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;All instances of &quot;E&quot; should appear only after instances of &quot;N&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;By this reasoning, the string &quot;FOOOONZAi.EE&quot; follows this ordering, but &quot;NEEEE3#?EAO&quot; does not (there is an &quot;O&quot; after an &quot;N&quot;).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to take a set of strings and determine whether these strings define a total ordering without any logical flaws. This would occur as a cycle of any length, such as:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&quot;N&quot; must follow &quot;P&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&quot;P&quot; must follow &quot;N&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;...or such as:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&quot;A&quot; must follow &quot;B&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&quot;B&quot; must follow &quot;C&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&quot;C&quot; must follow &quot;A&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;etc.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Rather than strings, you may take in lists of characters or integers if you wish.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since this is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;, you may output any two consistent values for yes or no, such as &lt;code&gt;true&lt;/code&gt; and &lt;code&gt;false&lt;/code&gt;, zero and non-zero, exception and no exception, etc. Just specify your output format in your answer.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&#xA;[&quot;ONE&quot;, &quot;TWO&quot;, &quot;THREE&quot;, &quot;FOUR&quot;, &quot;FIVE&quot;, &quot;SIX&quot;] -&gt; true (one possible ordering is &quot;TWFOUIVXNHRE&quot;)&#xA;[&quot;SEVEN&quot;] -&gt; false (&quot;E&quot; must follow &quot;V&quot; which must follow &quot;E&quot;)&#xA;[&quot;ZERO&quot;, &quot;FOUR&quot;] -&gt; false (&quot;R&quot; must follow &quot;O&quot;, but &quot;O&quot; must follow &quot;U&quot; which must follow &quot;R&quot;)&#xA;[&quot;&quot;, &quot;.&quot;, &quot;forty&quot;, &quot;this-&gt;~why();&quot;, &quot; -y.&quot;] -&gt; true&#xA;[&quot;AB&quot;, &quot;BC&quot;, &quot;CD&quot;, &quot;DE&quot;, &quot;AC&quot;, &quot;BD&quot;, &quot;CE&quot;, &quot;EA&quot;] -&gt; false&#xA;&#xA;(more can be written if needed)&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in each language wins.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;How can I make this more clear? Any suggestions?&lt;/p&gt;&#xA;" OwnerUserId="69054" LastEditorUserId="69054" LastEditDate="2017-07-15T20:47:01.853" LastActivityDate="2017-07-15T20:47:01.853" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="13290" PostTypeId="2" ParentId="8047" CreationDate="2017-07-13T06:08:02.640" Score="18" Body="&lt;h1&gt;Adding special cases for the sake of completeness&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a generalization of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8437/61384&quot;&gt;&quot;complicated&quot; number types&lt;/a&gt;, and is similar in scope to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9384/61384&quot;&gt;adding unnecessary fluff&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What I mean by this is that many challenges will try to make the problem well-defined for all possible inputs, when the challenge would have been much better if the set of inputs had been constrained more.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge that prompted me to write this was &lt;a href=&quot;https://codegolf.stackexchange.com/q/132002/61384&quot;&gt;multiply a string and a number&lt;/a&gt;. The basic idea is to repeat each character in a string a given amount of times. However, it also specifies what to do when the input number is negative, and the behavior is not a simple extension of the behavior for nonnegative inputs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my opinion, this special condition makes the challenge worse. I come to PPCG to solve interesting programming problems, and conditionally reversing a string based on whether a number is negative is not an interesting programming problem. It is unnecessary boilerplate that stops me from wanting to solve the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Furthermore, there are languages in which solving the problem is hard enough as it is. In the challenge linked above, one user decided to try and solve the problem in Retina. Retina was not designed for numeric handling, and the solution only worked for positive inputs. Thus, the edge condition stopped the answer from being competitive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are also languages such as Underload where input scope &lt;em&gt;would&lt;/em&gt; be complete. In Underload, the most natural representation of numbers is whole numbers, and requiring that negative numbers be handled makes the challenge feel much more clunky.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In general, &lt;strong&gt;always choose the smallest set of inputs for which the problem is well-defined and interesting, and only require submissions to handle those&lt;/strong&gt;. Anything else is edge cases, and handling edge cases is not fun.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="61384" LastEditDate="2018-02-25T09:28:40.813" LastActivityDate="2018-02-25T09:28:40.813" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13291" PostTypeId="1" CreationDate="2017-07-13T13:21:10.097" Score="21" ViewCount="365" Body="&lt;p&gt;Often, I have proposed a question to the sandbox and I never got any feedback on it; sometimes, I never got feedback until I had already &lt;em&gt;posted&lt;/em&gt; the question. I want a way to fix this. I want Sandbox questions to get more recognition and more feedback so that we can have better end-result questions on the main site. The question is, how could we do that?&lt;/p&gt;&#xA;" OwnerUserId="64706" LastEditorUserId="56656" LastEditDate="2017-07-13T14:09:18.150" LastActivityDate="2018-04-06T15:40:18.603" Title="How can we get more feedback on our Sandbox questions?" Tags="|discussion|sandbox|challenges|" AnswerCount="2" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="13296" PostTypeId="2" ParentId="13178" CreationDate="2017-07-14T05:17:17.047" Score="-1" Body="&lt;h1&gt;Create &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/oeis&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;oeis&amp;#39;&quot; rel=&quot;tag&quot;&gt;oeis&lt;/a&gt; tag and use it&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Create an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/oeis&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;oeis&amp;#39;&quot; rel=&quot;tag&quot;&gt;oeis&lt;/a&gt; tag, and add this tag to such questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any questions with this tag should contain the sequence id (Axxxxxx), and maybe a link, in question body.&lt;/p&gt;&#xA;" OwnerUserId="44718" LastActivityDate="2017-07-14T05:17:17.047" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13297" PostTypeId="2" ParentId="9263" CreationDate="2017-07-14T17:25:48.513" Score="0" Body="&lt;p&gt;I think these should be allowed:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Extra &lt;code&gt;0&lt;/code&gt;s at the start and end (end only after decimal point)&lt;/li&gt;&#xA;&lt;li&gt;Scientific notation (or engineering notation, which uses powers of &lt;code&gt;10^3&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;i&lt;/code&gt; for imaginary and complex numbers&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;a+bi&lt;/code&gt; for complex numbers (&lt;code&gt;+&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Floating-point errors&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Any other types of mathematical expressions should not be allowed. Mathematical constants should be decided by the poster. Obviously, the question poster can override any of these rules if they want.&lt;/p&gt;&#xA;" OwnerUserId="46603" LastEditorUserId="46603" LastEditDate="2017-07-14T18:08:50.810" LastActivityDate="2017-07-14T18:08:50.810" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13299" PostTypeId="1" CreationDate="2017-07-15T01:37:15.003" Score="1" ViewCount="219" Body="&lt;p&gt;My question &lt;a href=&quot;https://codegolf.stackexchange.com/q/132352/29560&quot;&gt;Ordered sequence of ascending integer combinations&lt;/a&gt; was put on hold despite receiving five good answers in the first 12 hours. It has also received a fair few upvotes, as have the answers. If people can answer it, how is it unclear? As of writing this, there are no comments on my question at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Dear &lt;a href=&quot;https://codegolf.stackexchange.com/users/194/peter-taylor&quot;&gt;Peter Taylor&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/caird-coinheringaahing&quot;&gt;caird coinheringaahing&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/55372/pajonk&quot;&gt;pajonk&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/45941/mego&quot;&gt;Mego&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/58518/cody-gray&quot;&gt;Cody Gray&lt;/a&gt;, would one of you please explain how the question is unclear? As it stands your on hold reason is unclear.&lt;/p&gt;&#xA;" OwnerUserId="29560" LastActivityDate="2017-07-15T11:58:04.380" Title="&quot;put on hold as unclear what you're asking&quot; is itself unclear" Tags="|discussion|specific-question|close-reasons|" AnswerCount="2" CommentCount="9" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13301" PostTypeId="2" ParentId="13299" CreationDate="2017-07-15T06:36:21.290" Score="3" Body="&lt;p&gt;Maybe you should ask one of the people who answered it to rewrite the question. I can't really answer &quot;&lt;em&gt;how is it unclear?&lt;/em&gt;&quot; because I can't extract enough sense from the question to say &quot;&lt;em&gt;I understand all of it apart from ...&lt;/em&gt;&quot;. It looks like the output of a Markov chain generator.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-07-15T06:36:21.290" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13303" PostTypeId="2" ParentId="13299" CreationDate="2017-07-15T11:58:04.380" Score="6" Body="&lt;p&gt;The main reason that I voted to close wasn't because it wasn't unclear, but rather because it was very confusing. I just spent the last 5 minutes reading over the challenge and think that I have understood it, &lt;em&gt;but I'm still not entirely sure.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;But let's take a look at the two main parts that caused me to close it.&lt;/p&gt;&#xA;&lt;h3&gt;The contradiction&lt;/h3&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;If the current line is &lt;code&gt;-&lt;/code&gt;, the next line is &lt;code&gt;1+2+ ... n-&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;n=4: &lt;code&gt;-&lt;/code&gt; =&amp;gt; &lt;strong&gt;&lt;code&gt;1+2+3+4-&lt;/code&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;If the last integer is equal to n, remove all integers from the end that are immediately followed by a &lt;code&gt;-&lt;/code&gt;, then change the last &lt;code&gt;+&lt;/code&gt; to a &lt;code&gt;-&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;n=4: &lt;strong&gt;&lt;code&gt;1-2+3-4-&lt;/code&gt;&lt;/strong&gt; =&amp;gt; &lt;code&gt;1-2-&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;It seems to me as though &lt;code&gt;1+2+3+4-&lt;/code&gt; is directly followed by &lt;code&gt;1-2+3-4-&lt;/code&gt; which doesn't make sense to me. The steps that you have detailed, and the example you give, show that it happens much later than the first line. It would have definitely been clearer if you had used the first line as an example as it would have logically followed on. Instead I was trying to understand how you got to &lt;code&gt;1-2+3-4-&lt;/code&gt; from &lt;code&gt;1+2+3+4-&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;n = 4: &lt;code&gt;1+2+3+4-&lt;/code&gt; =&amp;gt; &lt;code&gt;1+2+3-&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;The mind twister&lt;/h3&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;If the last integer is less than n, append the remaining integers with a &lt;code&gt;+&lt;/code&gt; after each one, except the final integer which should have a &lt;code&gt;-&lt;/code&gt; appended&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The first few times I read this, I had no idea what it was saying. It was only after I read through it quite a few times, and used an example on a piece of paper that I understood what you were trying to say. This could definitely be phrased in a better and clearer way.&lt;/p&gt;&#xA;&lt;h3&gt;Your examples&lt;/h3&gt;&#xA;&lt;p&gt;I noticed that in this post and your comment on Peter Taylor's answer that you cite your examples as making your post clear. While I agree that they do contribute to its overall clarity, that's not what examples are supposed to do. From &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8078/66833&quot;&gt;things to avoid when writing challenges&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Test cases are examples for people to check their understanding of the spec and the correctness of their code. They should not replace an explanation of how the output must relate to the input.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;As a final point (and as a cliché point), I would like to remind you of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/66833&quot;&gt;Sandbox&lt;/a&gt; where you can post challenges to get feedback.&lt;/p&gt;&#xA;&lt;p&gt;(As a side note, can I ask why the lines have to end with &lt;code&gt;-&lt;/code&gt;? It doesn't seem very mathematical and messes with my perfectionism.)&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-15T11:58:04.380" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13304" PostTypeId="2" ParentId="2140" CreationDate="2017-07-15T13:10:59.837" Score="1" Body="&lt;h1&gt;Minimize my cube&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Introduction&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/oVRmW.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/oVRmW.png&quot; alt=&quot;Using my 6x6 as cubes of smaller size&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have a rubiks cube. It has 6 layers and is great fun to solve. But it takes quite some time, and sometimes I wish I could just solve a cube of smaller size. But theres hope, because &lt;em&gt;every cube with even number of layers can emulate every cube with less layers&lt;/em&gt; by only moving certain layers at the same time. Now I need your help to provide the numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Let's get mathematical&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider this definiton: For every even integer &lt;em&gt;n&lt;/em&gt; and a positive integer &lt;em&gt;i &amp;lt;= n&lt;/em&gt; there exists a sequence of &lt;em&gt;i&lt;/em&gt; positive integers, so that&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x_1 + x_2 + ... + x_i = n&#xA;x_1 = x_i&#xA;x_2 = x_(i-1)&#xA;x_3 = x_(i-2)&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(See test cases for a clearer example). Then such a sequence tells me exactly which layers to combine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For an input &lt;em&gt;n&lt;/em&gt; write a program that outputs one of the existing sequences for every positive integer &lt;em&gt;i &amp;lt; n&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test cases&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For &lt;em&gt;n = 6&lt;/em&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[6]&#xA;[3, 3]&#xA;[2, 2, 2]&#xA;[1, 2, 2, 1]&#xA;[1, 1, 2, 1, 1]&#xA;[1, 1, 1, 1, 1, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For &lt;em&gt;n = 4&lt;/em&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[4]&#xA;[2, 2]&#xA;[1, 2, 1]&#xA;[1, 1, 1, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring and Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lowest number of bytes wins. Standard Loopholes apply.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox quesions&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Formatting?&lt;/li&gt;&#xA;&lt;li&gt;Can I make the definition clearer?&lt;/li&gt;&#xA;&lt;li&gt;Should I put more restrictions?&lt;/li&gt;&#xA;&lt;li&gt;Where is my english broken beyond repair?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="54014" LastActivityDate="2017-07-15T13:10:59.837" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13305" PostTypeId="2" ParentId="2140" CreationDate="2017-07-15T21:24:58.323" Score="0" Body="&lt;h1&gt;Rock Paper Scissors, but it's a big, custom tournament&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We all know &quot;Rock, Paper, Scissors&quot;, and it's pretty variated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A world tournament is held every year, and it's dang popular.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, the contestants are able to bring their own ways of play to the plate, and they play with them.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The challenge:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Create a program that, by process of elimination through RPS, determines the winner of the tournament.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The tournament rules:&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;No slackers. (Let the amount of players be an integer equally divisible by 2. [In other words, an even number.])&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can bring 2 of either of the 4 variants:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;None:&lt;/em&gt;&lt;/strong&gt; Play regular RPS.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;RPSLV:&lt;/em&gt;&lt;/strong&gt;  Play &quot;Rock, Paper, Scissors, Lizard, Spock&quot; (play diagram shown &lt;a href=&quot;https://en.wikipedia.org/wiki/File:Rock_paper_scissors_lizard_spock.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Best out of three:&lt;/em&gt;&lt;/strong&gt; Play 3 rounds; if by round 2, a player wins the round and has two points, they auto win. Else, winner of the next round wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Double RPS:&lt;/em&gt;&lt;/strong&gt; Play with four hands (two hands used by each player).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You cannot bring two of the same variant.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In order to use a variant, the two players must have the same type of variant. If there are no matching variants, the gameplay is automatically &lt;strong&gt;&lt;em&gt;None&lt;/em&gt;&lt;/strong&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;However, if there are more than one variant matches, a game of mode &lt;strong&gt;&lt;em&gt;None&lt;/em&gt;&lt;/strong&gt; will be played. The winner of the game mentioned decides what mode they play for the match they will play to see who goes to the next round.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In the case of a tie, replay until a win occurs (for all modes)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There can be only one winner.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;The coding rules:&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;All choices must be randomized (no strategies, to make this simple.).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No standard loopholes.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Give an explanation as much as you can. (If possible, include a &quot;Try it out online&quot; sample.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Sample Input/Output:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You must make a table variable with all the player numbers, from 1 to n, with two variants for each player.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;n = the amount of players you intend to enter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Player # | Var 1 | Var 2&#xA;1        | RSPLV | None&#xA;2        | None  | x2 RPS&#xA;3        | x2 RPS| Boo3&#xA;4        | Boo3  | x2 RPS&#xA;...      |...    | ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Make a &lt;code&gt;func()&lt;/code&gt; that:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1: Checks the variants of the next two availible players on the list, starting at player 1, then does the second to third last rules depending on what happens.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2: Makes the pair engage in battle, gameplay depending on the chosen variant.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;3: Finally, boot the loser off the game and add the winner to the next list (round). (The &quot;boot the loser&quot; part isn't that required, but I recommend so as to not make the program add a player to the next table.) &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output (uses table from input):&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; Round 1:&#xA; 1 vs. 2 // None, since the None variant matches both of them&#xA; [&quot;Rock&quot;/*1*/,&quot;Scissors&quot;/*2*/]&#xA; 1 wins&#xA;&#xA; 3 vs. 4 // They have more than one match, so they fight for who decides&#xA; [&quot;P&quot;/*3*/,&quot;S&quot;/*4*/]&#xA; 4 wins, and chooses Best out of 3 &#xA; Match 1:&#xA; [&quot;P&quot;/*3*/,&quot;R&quot;/*4*/] // 1(3) - 0(4)&#xA;&#xA; Match 2:&#xA; [&quot;P&quot;/*3*/,&quot;S&quot;/*4*/] // 1(3) - 1(4)&#xA;&#xA; Match 3:&#xA; [&quot;P&quot;/*3*/,&quot;R&quot;/*4*/] // 2(3) - 1(4)&#xA; 3 wins&#xA;&#xA; Round 2:&#xA; 1 vs. 4 //No matches, defaults to None&#xA; [&quot;R&quot;/*1*/,&quot;R&quot;/*4*/] // No-one wins&#xA; [&quot;R&quot;/*1*/,&quot;S&quot;/*4*/]&#xA; 1 wins the tournament&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Misc. requirements (some optional):&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A {!} means it is required.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;{!} Print each match, and who wins.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;{!} Print the tournament winner.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;{!} The number of players must be flexible. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Print the table for each round.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Scenarios:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;None:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a vs. b //Either they have no matches, or they have both None matches&#xA;[&quot;R&quot;/*a*/,&quot;S&quot;/*b*/]&#xA;a wins&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;RPSLV (will make this one quick):&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a vs. b //RPSLV chosen&#xA;[&quot;V&quot;/*a*/,&quot;L&quot;/*b*/]&#xA;b wins&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Best out of Three:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Scenario 1: (a tie occurs at match 2)&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a vs. b //Boo3 chosen&#xA;Match 1:&#xA;[&quot;P&quot;/*a*/,&quot;S&quot;/*b*/] // 0(a) - 1(b)&#xA;&#xA;Match 2:&#xA;[&quot;P&quot;/*a*/,&quot;P&quot;/*b*/] // tie&#xA;[&quot;P&quot;/*a*/,&quot;S&quot;/*b*/] // 1(a) - 1(b)&#xA;&#xA;Match 3:&#xA;[&quot;R&quot;/*a*/,&quot;S&quot;/*4*/] // 2(a) - 1(b)&#xA;a wins&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Scenario 2: (a player has two points by the end of match 2)&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a vs. b //Boo3 chosen&#xA;Match 1:&#xA;[&quot;P&quot;/*a*/,&quot;S&quot;/*b*/] // 0(a) - 1(b)&#xA;&#xA;Match 2:&#xA;[&quot;S&quot;/*a*/,&quot;P&quot;/*b*/] // 0(a) - 2(b)&#xA;b automatically wins&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Double RPS:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a vs. b //x2 RPS chosen&#xA;[(&quot;R&quot;, &quot;P&quot;)/*a*/, (&quot;S&quot;, &quot;S&quot;)/*b*/] // lock&#xA;[(&quot;P&quot;, &quot;P&quot;)/*a*/, (&quot;S&quot;, &quot;S&quot;)/*b*/]&#xA;b wins&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Both the coding and tournament rules apply to your code.&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;For sandbox use only (won't be included in real question)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I don't know if this kind of problem is suitable for code golf, it could be a programming puzzle, I'm not sure. Go ahead in the comments and tell me what mode it should be, and if I should improve it. (Also, sorry for the mix of Python&#xA;lists and C++ comments, if it confuses you.) A ** means the choice is random.&lt;/p&gt;&#xA;" OwnerUserId="71777" LastEditorUserId="71777" LastEditDate="2017-07-16T19:35:36.933" LastActivityDate="2017-07-16T19:35:36.933" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13306" PostTypeId="2" ParentId="2140" CreationDate="2017-07-15T23:24:35.120" Score="0" Body="&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Take a number and output it with 4 digits or less using letters and numbers. For example; &lt;code&gt;270,030&lt;/code&gt; would turn into &lt;code&gt;2.7K&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Key&lt;/h3&gt;&#xA;&lt;p&gt;Billion -&amp;gt; &lt;code&gt;B&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Million -&amp;gt; &lt;code&gt;M&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Thousand -&amp;gt; &lt;code&gt;K&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may choose to accept input numbers that include commas delimiting every three decimal places (such as &lt;code&gt;123,456,789&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Round to nearest, half-up.&lt;/li&gt;&#xA;&lt;li&gt;Numbers will only go up to a trillion.&lt;/li&gt;&#xA;&lt;li&gt;The mantissa part of the answer should be at least 1.&lt;/li&gt;&#xA;&lt;li&gt;All letters must be uppercase and as specified below.&lt;/li&gt;&#xA;&lt;li&gt;Outputs must be 4 or less characters wide.&lt;/li&gt;&#xA;&lt;li&gt;Outputs must be as mathematically precise as possible. Example:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;154,893&lt;/code&gt; -&amp;gt; &lt;code&gt;100K&lt;/code&gt; &lt;strong&gt;NOT OK&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;154,893&lt;/code&gt; -&amp;gt; &lt;code&gt;155K&lt;/code&gt; &lt;strong&gt;GOOD&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;If there are multiple outputs with the same mathematical precision, return the shortest one. (If they are the same length, you may return either.) Example:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;1000&lt;/code&gt; -&amp;gt; &lt;code&gt;1000&lt;/code&gt; &lt;strong&gt;NOT OK&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1000&lt;/code&gt; -&amp;gt; &lt;code&gt;1K&lt;/code&gt; &lt;strong&gt;GOOD&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Examples:&lt;/h3&gt;&#xA;&lt;pre&gt;&#xA;1,234,567 -&gt; 1.2M&#xA;102 -&gt; 102&#xA;1000 -&gt; 1K&#xA;1001 -&gt; 1001&#xA;100,000 -&gt; .1M&#xA;12,345,678,912 -&gt; 12B&#xA;1,452,815,612 -&gt; 1.5B&#xA;&lt;/pre&gt;&#xA;&lt;h3&gt;Submissions&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest solution in each language wins&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard Loopholes Apply&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="70765" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-18T03:28:51.820" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="13309" PostTypeId="2" ParentId="2140" CreationDate="2017-07-16T02:59:57.067" Score="0" Body="&lt;h1&gt;Fighting a Land War&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In this KoTH, you need to earn as much money as you can while fighting over tiles to take over.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The board is a large hexagon made up of 91 smaller hexagonal tiles (A 6x6 hexagon)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each tile is either: &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;An impassable mountain&lt;/li&gt;&#xA;&lt;li&gt;Hills that generate production.  They start out with a random value (between 2 to 4)&lt;/li&gt;&#xA;&lt;li&gt;Valleys that generate money. Their starting value is the distance from the nearest corner multiplied by 2&#xA;(between 2 and 10)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/HGULh.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/HGULh.png&quot; alt=&quot;Board&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are 6 players in each game, each starting in a different corner of the hexagon.  The corner will always be a hill(4).  Turn order is randomized at the start of the game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each turn, the following happens:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Each tile that you have owned for N^2 turns (where N is an integer) increases in value by 1&lt;/li&gt;&#xA;&lt;li&gt;You earn money/production.  (Equal to the sum of the valley/hill values)&lt;/li&gt;&#xA;&lt;li&gt;You can spend production on defenses or capturing tiles.  &#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Adding &lt;code&gt;N TileDefense&lt;/code&gt; costs &lt;code&gt;N Production&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Capturing a tile with &lt;code&gt;N TileDefense&lt;/code&gt; costs &lt;code&gt;1 + 2*N Production&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;You can only capture a tile if it is a non-mountain tile that is adjacent to your current tiles.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Notes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Tiles lose all defense on capture.&lt;/li&gt;&#xA;&lt;li&gt;Multiple players can upgrade a single tile&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The turn counter for tile upgrades is player-specific.  This means that if you capture a tile from another player, the turn counter starts at 0.&lt;/li&gt;&#xA;&lt;li&gt;If you capture a tile you've owned before, it starts off where you left it.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And that's it.  The player with the most money after 500? turns wins.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2017-07-16T04:13:50.293" LastActivityDate="2017-07-16T04:13:50.293" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13311" PostTypeId="1" AcceptedAnswerId="13315" CreationDate="2017-07-16T12:51:04.577" Score="3" ViewCount="119" Body="&lt;p&gt;A &lt;a href=&quot;https://codegolf.stackexchange.com/questions/132652/challenge-a-king-s-reach&quot;&gt;recent challenge&lt;/a&gt; has been posted on the main site. A user discovered that it was copied word-to-word from &lt;a href=&quot;https://books.google.ro/books?id=UcgMWDfca0EC&amp;amp;pg=PA4&amp;amp;lpg=PA4&amp;amp;dq=%22The+king+in+chess+can+move+to+any+neighboring+square+horizontally%22&amp;amp;source=bl&amp;amp;ots=KPDrdEh_UX&amp;amp;sig=19D5hF1B0UJ402cKbsoY1Rttlnw&amp;amp;hl=en&amp;amp;sa=X&amp;amp;redir_esc=y#v=onepage&amp;amp;q=%22The%20king%20in%20chess%20can%20move%20to%20any%20neighboring%20square%20horizontally%22&amp;amp;f=false&quot; rel=&quot;nofollow noreferrer&quot;&gt;an external source&lt;/a&gt;, and that challenge has been closed as &lt;strong&gt;off-topic&lt;/strong&gt;, with this reason: &quot;Questions without an objective primary winning criterion are off-topic, as they make it impossible to indisputably decide which entry should win&quot;. That does not seem right to me, because it had a winning criterion. So, the question is: What close-reason should we choose for challenges that are copied from external sources?&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="59487" LastEditDate="2017-07-16T13:22:09.800" LastActivityDate="2017-07-16T22:07:37.643" Title="What should we do about posts that are copied from external sources?" Tags="|discussion|close-reasons|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13313" PostTypeId="2" ParentId="2140" CreationDate="2017-07-16T16:37:57.720" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/132719/the-chroma-key-to-success?s=1|2.8930&quot;&gt;The Chroma Key to Success&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="64706" LastEditorDisplayName="user58826" LastEditDate="2017-07-17T13:04:42.337" LastActivityDate="2017-07-17T13:04:42.337" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13315" PostTypeId="2" ParentId="13311" CreationDate="2017-07-16T22:07:37.643" Score="6" Body="&lt;p&gt;From the network-wide &lt;a href=&quot;https://stackexchange.com/legal&quot;&gt;Terms of Service&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;3. Subscriber Content&lt;/h2&gt;&#xA;&lt;p&gt;You agree that all Subscriber Content that You contribute to the Network is perpetually and irrevocably licensed to Stack Exchange under the Creative Commons Attribution Share Alike license. You grant Stack Exchange the perpetual and irrevocable right and license to use, copy, cache, publish, display, distribute, modify, create derivative works and store such Subscriber Content ... &lt;strong&gt;Subscriber warrants, represents and agrees Subscriber has the right to grant Stack Exchange and the Network the rights set forth above&lt;/strong&gt;. Subscriber represents, warrants and agrees that it will not contribute any Subscriber Content that (a) infringes, violates or otherwise interferes with any copyright or trademark of another party ...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;(My emphasis).&lt;/p&gt;&#xA;&lt;p&gt;If a question is a clear violation of copyright then you should raise a custom flag to notify the moderators, providing a clear explanation of the situation with links to the source where possible. That's a backstop which ensures that the situation will be addressed. Additionally:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Comment to explain the problem. This may occasionally result in the OP editing the question to credit the original source and show that it is under a licence compatible with CC BY-SA 3.0. It may also result in the OP deleting the post. And it should deter people from answering, which is in everyone's best interests if the question is heading for the bit bucket.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://meta.stackexchange.com/q/5221/164922&quot;&gt;High-rep users can vote to delete a question subject to various conditions&lt;/a&gt;. This is the only part of this answer which I think could be controversial: since we're given extra powers in order to reduce the load on the mods, I think it is appropriate to vote to delete once OP has been given a chance to edit as mentioned in the previous point. And since we can only vote to delete once the question is on -3 (or has been closed for 48 hours), I think it is also appropriate to downvote the question in order to enable high-rep mods to delete it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-16T22:07:37.643" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13316" PostTypeId="2" ParentId="2140" CreationDate="2017-07-16T23:47:08.367" Score="3" Body="&lt;h1&gt;Deduplicate equivalent expressions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Suppose we wanted to generate all expressions containing at most 2 of + and &amp;minus;. We might have a list like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a + b + c         b + c + a&#xA;a + b - c         b + c - a&#xA;a - b + c         b - c + a&#xA;a - b - c         b - c - a&#xA;a + c + b         c + a + b&#xA;a + c - b         c + a - b&#xA;a - c + b         c - a + b&#xA;a - c - b         c - a - b&#xA;b + a + c         c + b + a&#xA;b + a - c         c + b - a&#xA;b - a + c         c - b + a&#xA;b - a - c         c - b - a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There is a lot of repetition here. It surely isn't necessary to include all of &lt;code&gt;a + b + c&lt;/code&gt;, &lt;code&gt;a + c + b&lt;/code&gt;, &lt;code&gt;b + a + c&lt;/code&gt;, &lt;code&gt;b + c + a&lt;/code&gt;, &lt;code&gt;c + a + b&lt;/code&gt;, and &lt;code&gt;c + b + a&lt;/code&gt;, since they all mean the same thing. This can be deduced from knowing that, for any &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt;, &lt;code&gt;x + y&lt;/code&gt; is the same as &lt;code&gt;y + x&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Similarly, &lt;code&gt;b + a - c&lt;/code&gt; and  &lt;code&gt;a - c + b&lt;/code&gt; are equivalent. To deduce this, one must know that, for any &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt;, &lt;code&gt;x - y&lt;/code&gt; is the same as &lt;code&gt;x + (-y)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's assume the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1]: a + b == b + a&#xA;[2]: a - b == a + -b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then, we can deduce that &lt;code&gt;b + a - c&lt;/code&gt; and &lt;code&gt;a - c + b&lt;/code&gt; are equivalent:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;start:  b + a - c&#xA;        b + a + -c        by 2&#xA;        a + b + -c        by 1&#xA;        a + -c + b        by 1&#xA;end:    a - c + b         by 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Therefore, they are the same. After performing similar proofs, we are left with the list:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a + b + c&#xA;a + b - c&#xA;a - b + c&#xA;a - b - c&#xA;b - a + c&#xA;b - c - a&#xA;c - b - a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Definition of an expression&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An expression can be described as:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;variable   = &quot;a&quot; | &quot;b&quot; | &quot;c&quot; | ... | &quot;y&quot; | &quot;z&quot;;&#xA;digit      = &quot;0&quot; | &quot;1&quot; | &quot;2&quot; | ... | &quot;8&quot; | &quot;9&quot;;&#xA;number     = digit . digit*;&#xA;operator   = &quot;!&quot; | &quot;#&quot; | &quot;$&quot; | &quot;%&quot; | &quot;&amp;amp;&quot; | &quot;*&quot; | &quot;+&quot;&#xA;           | &quot;~&quot; | &quot;-&quot; | &quot;.&quot; | &quot;/&quot; | &quot;:&quot; | &quot;;&quot; | &quot;&amp;lt;&quot;&#xA;           | &quot;=&quot; | &quot;&amp;gt;&quot; | &quot;?&quot; | &quot;@&quot; | &quot;^&quot; | &quot;_&quot; | &quot;`&quot;&#xA;           | &quot;|&quot;;&#xA;data       = number | variable;&#xA;subexpr    = data | operator* . data;&#xA;expression = subexpr&#xA;           | subexpr . operator . expression;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;|&lt;/code&gt; suggests alternatives, &lt;code&gt;.&lt;/code&gt; suggests concatenation (with potential whitespace around each operand), &lt;code&gt;*&lt;/code&gt; suggests &quot;0 or more times&quot;, and &lt;code&gt;&quot;&lt;/code&gt; is a string literal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;x + y&lt;/code&gt;, &lt;code&gt;j * i - 3&lt;/code&gt;, &lt;code&gt;u &amp;amp; 4 * 2 &amp;lt; ~4&lt;/code&gt;, &lt;code&gt;q % ~*^t&lt;/code&gt; and &lt;code&gt;r&lt;/code&gt; are all expressions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should assume all operators are left-associative.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Definition of assumptions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An assumption is a pair of expressions said to be equivalent. This means one can be transformed into the other. When performing a transformation using an assumption, one replaces all the appropriate variables and maintains the numbers as they are. (These &quot;variables&quot; can also be sub-expressions, which is any expression not using an operator in the assumption.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if the assumption is &lt;code&gt;!a == a + 5&lt;/code&gt;, then one can transform &lt;code&gt;t + 5&lt;/code&gt; into &lt;code&gt;!t&lt;/code&gt; and &lt;code&gt;3 + 5&lt;/code&gt; into &lt;code&gt;!3&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another example: if the assumption is &lt;code&gt;a + b == a * b @ b&lt;/code&gt;, then &lt;code&gt;5 + 2&lt;/code&gt; can become &lt;code&gt;5 * 2 @ 2&lt;/code&gt; and &lt;code&gt;z * 3 @ 3&lt;/code&gt; can become &lt;code&gt;z + 3&lt;/code&gt;, but &lt;code&gt;z * 4 @ a&lt;/code&gt; cannot be reduced further using this rule.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One last example: if the assumption is &lt;code&gt;a &amp;lt; b == a&lt;/code&gt;, then &lt;code&gt;1 + 3 &amp;amp; 5 &amp;lt; 2 * 3 + 6&lt;/code&gt; would become &lt;code&gt;1 + 3 &amp;amp; 5&lt;/code&gt;, and &lt;code&gt;1 + 2 &amp;lt; x + y &amp;lt; 7 $ q&lt;/code&gt; would become &lt;code&gt;1 + 2&lt;/code&gt;, since it would be equivalent to &lt;code&gt;(1 + 2) &amp;lt; (x + y) &amp;lt; (7 $ q)&lt;/code&gt;, which is thus &lt;code&gt;1 + 2&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If either side of the assumption is a single variable, numbers are excluded from this assumption. E.g., the assumption &lt;code&gt;a == 3&lt;/code&gt; would only apply to variables.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Expression equality&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Two expressions are equal if they can be proven to be the same. Variables must be the same for each expression; for example, &lt;code&gt;a + b&lt;/code&gt; is not by default the same as &lt;code&gt;b + c&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to remove &quot;duplicate&quot; expressions given some assumptions. You can use any unambiguous symbol or method, including taking a pair of strings, to represent an expression. The expressions remaining in the result do not necessarily have to be in the set, but must be equivalent by the given assumptions. E.g., if you have &lt;code&gt;a + b - c&lt;/code&gt; and &lt;code&gt;b - c + a&lt;/code&gt; in the input, you can have &lt;code&gt;-c + b + a&lt;/code&gt; represent these in the resultant set. You should try each equation in the order that it's given to you (to simulate &quot;precedence&quot;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input consists of a list of assumptions and a list of input expressions. The input expressions can be an array or container of strings or string pointers, or in any way standard to your language. (E.g., for C, one should expect null-terminated strings.) The input format must be consistent for all runs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output can be a list representation (as is standard to your language), can be separated by newlines (&lt;code&gt;\r&lt;/code&gt;, &lt;code&gt;\n&lt;/code&gt;, and &lt;code&gt;\r\n&lt;/code&gt; are acceptable), or separated by commas. The output format must be consistent between runs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Every output is merely an example, and is not the only valid output.&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-mathematica prettyprint-override&quot;&gt;&lt;code&gt;Assumptions: { e1 == e2, e3 == e4, ... eN-1 == eN }&#xA;Input: { expr1, expr2, ... exprN }&#xA;Output: { expr1, expr2, ..., exprK }&#xA;&#xA;Assumptions: { &quot;a + b&quot; == &quot;b + a&quot; }&#xA;Input: { &quot;3 + 4&quot;, &quot;4 + 3&quot;, &quot;5 * a&quot;, &quot;a + 2&quot;, &quot;2 * a&quot;, &quot;a * 5&quot;, &quot;a + b&quot;, &quot;2 + a&quot; }&#xA;Output: { &quot;3 + 4&quot;, &quot;5 * a&quot;, &quot;a + 2&quot;, &quot;2 * a&quot;, &quot;a * 5&quot;, &quot;a + b&quot; }&#xA;&#xA;Assumptions: { &quot;a + 0&quot; == &quot;a&quot;, &quot;a * 1&quot; == &quot;a&quot;, &quot;a * b&quot; == &quot;b * a&quot;, &quot;a + b&quot; == &quot;b + a&quot; }&#xA;Input: { &quot;1 * 2 * 3&quot;, &quot;3 * 2 + 0&quot;, &quot;1 + 2 + 3&quot; }&#xA;Output: { &quot;1 * 2 * 3&quot;, &quot;1 + 2 + 3&quot; }&#xA;    OR: { &quot;2 * 3&quot;, &quot;1 + 2 + 3&quot; }&#xA;&#xA;Assumptions: { &quot;~a&quot; == &quot;a ~ a&quot; }&#xA;Input: { &quot;~z&quot;, &quot;z ~ z&quot;, &quot;~a&quot;, &quot;~~a&quot;, &quot;a ~ a ~ a ~ a&quot; }&#xA;Output: { &quot;~a&quot;, &quot;~z&quot;, &quot;~~a&quot; }&#xA;&#xA;Assumptions: { &quot;a + b&quot; == &quot;0&quot; }&#xA;Input: { &quot;x + y&quot;, &quot;0&quot;, &quot;3 + y + a + v + k&quot;, &quot;75&quot;, &quot;4 + 2&quot; }&#xA;Output: { &quot;0&quot;, &quot;75&quot; }&#xA;&#xA;Assumptions: { }&#xA;Input: { &quot;x + y&quot;, &quot;x + y&quot;, &quot;y + x&quot;, &quot;3&quot;, &quot;3 ! 3&quot; }&#xA;Output: { &quot;x + y&quot;, &quot;y + x&quot;, &quot;3&quot;, &quot;3 ! 3&quot; }&#xA;&#xA;Assumptions: { &quot;j&quot; == &quot;3&quot; }&#xA;Input: { &quot;v + t&quot;, &quot;z&quot;, &quot;q&quot;, &quot;q + r + t&quot;, &quot;4 + 2&quot; }&#xA;Output: { &quot;v + t&quot;, &quot;z&quot;, &quot;q + r + t&quot;, &quot;4 + 2&quot; }&#xA;&#xA;Assumptions: { &quot;a&quot; == &quot;b&quot; }&#xA;Input: { &quot;a&quot;, &quot;b + c&quot;, &quot;e % t&quot;, &quot;q &amp;amp; t&quot;, &quot;!3&quot;, &quot;z&quot; }&#xA;Output: { &quot;a&quot;, &quot;b + c&quot;, &quot;e % t&quot;, &quot;q &amp;amp; t&quot;, &quot;!3&quot; }&#xA;&#xA;Assumptions: { &quot;1 &amp;amp; 0&quot; == &quot;0&quot;, &quot;1 &amp;amp; 1&quot; == &quot;1&quot;, &quot;0 &amp;amp; 0&quot; == &quot;0&quot;, &quot;a &amp;amp; b&quot; == &quot;b &amp;amp; a&quot;, &quot;0 ? a : b&quot; == &quot;b&quot;, &quot;1 ? a : b&quot; == &quot;a&quot; }&#xA;Input: { &quot;1 &amp;amp; 1 &amp;amp; 0&quot;, &quot;j &amp;amp; k&quot;, &quot;y &amp;amp; z&quot;, &quot;z &amp;amp; y&quot;, &quot;1 &amp;amp; 0 ? k &amp;amp; j : 0&quot; }&#xA;Output: { &quot;0&quot;, &quot;j &amp;amp; k&quot;, &quot;y &amp;amp; z&quot; }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="31957" LastEditDate="2017-07-26T19:32:39.460" LastActivityDate="2017-07-26T19:32:39.460" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="13317" PostTypeId="2" ParentId="13291" CreationDate="2017-07-17T03:05:00.807" Score="13" Body="&lt;p&gt;These are just some ideas I've been collecting over the past couple days. I make no promises about their efficacy, but I do hope they will help. These are all individual actions that I believe we can take to make our challenges better received: they are not meant to be policies or anything like that.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Contribute to the sandbox yourself&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;By reviewing other challenges you will accomplish at least two things: you will have given someone else meaningful feedback on their challenge, and you will have increased your experience in reading challenges. In my experience, reading and understanding challenge structure, content, and language benefits you when writing future challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Less definitely, you also promote a culture of contribution to the sandbox. This will, in my opinion, encourage other users to take the time to go through the sandbox. This will increase the amount of feedback you receive on your own challenges in the long run.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Write concise challenges&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This plays into some of the weaknesses of the sandbox. Long and elaborate challenges are very difficult to review. Often, I find that a long challenge has so many issues that I forget half of them by the time I finish reading it! This leads to me scrolling up and down trying to write a comprehensive comment, but inevitably missing some details.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The best way to write your challenges is with as little content as possible that still leaves the challenge totally clear. Making it easier for people to review your challenge will make it more likely that they provide feedback at all.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Write solutions to your own challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a bit similar to the above point. While not necessary by any stretch, if you write a program that solves your challenge you will yourself be able to catch many of the potential problems the challenge may have. This will lower the amount of work that reviewers have to do and increase the chance that they provide useful feedback.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rubber duck your challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is similar to the above point (again) but instead of focusing on the programming side, this focuses on the communications side. Try to make sure your wording makes sense before you post to the sandbox. If you can, explain the problem to someone else either verbally or in chat or whatever. Make sure that the way you explain the problem and its motivation are clear and concise.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Make sure your challenge is visible&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Often, I see people suggesting that only a day or two in the sandbox is not long enough. This is all well and good, except that then sometimes people will note that they sandboxed a post for weeks and got no feedback, but got feedback in minutes on main.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I consider myself one of the more active users of the sandbox, at least at times, and I have never reviewed anything past the first page of posts, sorted by active. I rarely go beyond the top ten active posts. While I am not saying to aggressively bump your challenge to the top, I am saying to make sure it spends enough time reasonably high up. Time spent on the second page is essentially wasted, in my opinion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another way to increase visibility is to link to your post in chat. Obviously, follow general chat etiquette: don't spam your answer, and don't interrupt other conversations. Otherwise this should easily be an on-topic discussion in The Nineteenth Byte, our general chat room.&lt;/p&gt;&#xA;" OwnerUserId="31625" LastEditorUserId="31625" LastEditDate="2017-07-18T00:18:40.127" LastActivityDate="2017-07-18T00:18:40.127" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13319" PostTypeId="2" ParentId="2140" CreationDate="2017-07-17T18:01:39.853" Score="0" Body="&lt;h1&gt;Write a code poem &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It is said that Larry Wall, creator of Perl, wrote a poem titled &quot;Black Perl&quot; in said language, as shown &lt;a href=&quot;https://en.wikipedia.org/wiki/Black_Perl&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The poem is fully functional (working syntax, no runtime errors, etc. [no errors in general]).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The challenge:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In any language (practical languages recommended), write a haiku (example of one at &lt;a href=&quot;https://en.wikipedia.org/wiki/Haiku&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://en.wikipedia.org/wiki/Haiku&lt;/a&gt;). &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Coding rules:&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The poem must be able to function properly (no errors).&lt;/li&gt;&#xA;&lt;li&gt;Unlike Wall's poem, you must run through the whole program (exits only at the end).&lt;/li&gt;&#xA;&lt;li&gt;If you define a function to act as a word, it will count towards your poem.&lt;/li&gt;&#xA;&lt;li&gt;Caught errors and other error-handling tricks are valid. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Misc rules:&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You cannot use multi-line strings or line continue symbols, etc. (No multi-line functions/tricks).&lt;/li&gt;&#xA;&lt;li&gt;Brackets, parentheses, and other grouping symbols (with the exception of &amp;lt; and &gt; as operators are ignored unless as a string.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Example lines (written in Python, not the best, probably):&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;while i_love ....: # i_love counts as two words&#xA;&#xA;i_am &amp;gt; than_you # read symbols/operators as words&#xA;&#xA;&quot;&quot;&quot;my love for ...&#xA;is ....... by ...&quot;&quot;&quot; # Invalid, as stated by one of the misc. rules&#xA;&#xA;me(,&quot;john&quot;, &quot;abby&quot;,&#xA;    &quot;and liz&quot;) # invalid, line continuation&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Winning:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, so submission with the highest amount of votes wins.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;For sandbox only:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;How can I improve on this challenge? Is there anything else I should add? Let me know in the comments. &lt;/p&gt;&#xA;" OwnerUserId="71777" LastEditorUserId="71777" LastEditDate="2017-07-18T00:16:33.770" LastActivityDate="2017-07-18T00:16:33.770" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="13320" PostTypeId="2" ParentId="2140" CreationDate="2017-07-17T19:17:26.833" Score="0" Body="&lt;h1&gt;Pristine Pristige&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A pristine program, as defined by Calvin'sHobbies, is&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;a program that does not have any errors itself but will error if you modify it by removing any contiguous substring of &lt;strong&gt;N&lt;/strong&gt; characters, where &lt;strong&gt;0 &amp;lt; N &amp;lt; program length&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Pristige is a language I designed in which &lt;em&gt;all&lt;/em&gt; syntactically valid programs are pristine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pristige works just like &lt;a href=&quot;https://github.com/DJMcMayhem/Brain-Flak&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brain-Flak&lt;/a&gt;, except every function requires a airity declaration at the beginning.  An airity of &lt;strong&gt;n&lt;/strong&gt; is declared with &lt;strong&gt;n&lt;/strong&gt; &lt;code&gt;.&lt;/code&gt;s followed by a &lt;code&gt;|&lt;/code&gt;.  For example the Brain-Flak program&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;({}())&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Is equivalent to the Pristige Program&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(..|{|}(|))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In addition Pristige requires that there is only one function at the top level of the program.  Meaning that &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(.|{|}){.|(..|{|}[.|(|)])}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Is an invalid program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To be absolutely concrete here is a grammar that spans all syntactically valid Pristige programs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;S → (A) : &amp;lt;A&amp;gt; : {A} : [A]&#xA;A → .AS : |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You must write a compiler from Pristige to Brain-Flak, that is itself a pristine program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question so answers will be scored in bytes, with less bytes being better.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You must either throw an error (or print &lt;code&gt;error&lt;/code&gt; if your language cannot do so) if the inputted program is syntactically invalid.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the input is syntactically valid you must output an equivalent Brain-Flak program.  The simplest way to do this is to remove all instances of &lt;code&gt;.&lt;/code&gt; and &lt;code&gt;|&lt;/code&gt;, but you are not required to do so.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may use any default IO format.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Your program must be a pristine program.  That means deleting any continuous substring must cause an error&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Reference Implementation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here will go an implementation I have not yet completed&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here will go test cases&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-07-17T19:30:20.167" LastActivityDate="2017-07-17T19:30:20.167" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13322" PostTypeId="2" ParentId="2140" CreationDate="2017-07-17T21:18:38.127" Score="3" Body="&lt;h1&gt;Self-Improvement&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Your Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You must create a self-mutable program that, when run, outputs a &lt;strong&gt;non-zero integer&lt;/strong&gt; and also overwrites the file with a program that outputs double the number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if I run the program &lt;code&gt;self-improvement&lt;/code&gt; and it outputs &lt;code&gt;10&lt;/code&gt;, it must output &lt;code&gt;20&lt;/code&gt; when I run it the second time, output &lt;code&gt;40&lt;/code&gt; the next time, and so on.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Additional Notes&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must not rely on any file on the computer other than your program.&lt;/li&gt;&#xA;&lt;li&gt;Said program must consist of only one file.&lt;/li&gt;&#xA;&lt;li&gt;Of course, no loopholes that are banned from the entire site.&lt;/li&gt;&#xA;&lt;li&gt;You can assume that your program won't go tested beyond the range &lt;code&gt;-2^16&lt;/code&gt; to &lt;code&gt;2^16-1&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="48303" LastEditorUserId="48303" LastEditDate="2017-07-17T22:59:49.693" LastActivityDate="2017-07-17T22:59:49.693" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="13325" PostTypeId="1" CreationDate="2017-07-17T23:19:39.327" Score="2" ViewCount="95" Body="&lt;p&gt;A lot of users, myself included, enjoy golfing in practical languages, even though they often stand no chance of winning against the terse and powerful golfing languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are a lot of things that make these languages unique and rewarding to golf in.  I like Haskell for its pattern matching, but very much enjoy Python's dynamic typing, and I feel that these are both very fun features to golf with.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What language features make for enjoyable golfing?  These features do not have to be features that make a language &lt;em&gt;good&lt;/em&gt; at golfing, just features that make golfing in a language fun and reward users for cleverness.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please include both an example of a language with this feature and an explanation as to why the feature makes golfing in that language interesting. An mini-example answer might look like:&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Splats&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The splat operator is a operator present in Python 3.  It allows you to turn a collection like a list or a tuple into the arguments of a function.  For example &lt;code&gt;[*f()]&lt;/code&gt; casts the results of &lt;code&gt;f()&lt;/code&gt; to a list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Splats are fun because they allow you to be more creative with the types you are using.  For example if you have a function that takes two arguments, you could calculate them separately and pass them to the function or you could calculate them together returning a tuple that could be splatted into your function  . . . &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-07-17T23:19:39.327" Title="What features of practical languages are enjoyable for golfing?" Tags="|discussion|" AnswerCount="0" CommentCount="1" ClosedDate="2017-07-18T13:23:18.923" ContentLicense="CC BY-SA 3.0" />
  <row Id="13329" PostTypeId="2" ParentId="2140" CreationDate="2017-07-18T00:17:20.857" Score="1" Body="&lt;h1&gt;KOTH: Thirty-One &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-kill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-kill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-kill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Built a bot that plays Thirty-One against other bots!&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Game Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Thirty-one is a card game using the standard 52-card deck (the French deck). The objective in each round is to have a hand better than at least one of your opponents'.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the beginning of the game, each player has a set number of &quot;lives&quot; - for this challenge, each player will get 3 lives. Once you run out of lives, you have lost the game. No matter how many players there are, there is exactly one winner per game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The player to go first in the first round is chosen arbitrarily. After that, the player to go first rotates clockwise around the &quot;table&quot;. The players' order does not change between rounds (except for when players get knocked out).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the beginning of each round, each player is dealt 3 cards. On each player's turn, they have the option to:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Draw a card from the deck and discard a card&lt;/li&gt;&#xA;&lt;li&gt;Draw the last card that was discarded and discard a card&lt;/li&gt;&#xA;&lt;li&gt;Knock if no other player has knocked yet&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h3&gt;Knocking&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If a player knocks, each other player gets one more turn. Then, the players compare hands. Whoever has the lowest score loses a life, and the round ends.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each player's score is calculated by adding the face values of all their same-suit cards and taking the best score. Two cards of different suits don't contribute to the same score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The face values for each card are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Ace: 11&#xA;King, Queen, Jack: 10&#xA;2-10: their value&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For example, consider you hold the cards:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Ace of Spades&#xA;Four of Spades&#xA;Two of Spades&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your score would be &lt;code&gt;11 + 4 + 2 = 17&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you hold the cards:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Queen of Diamonds&#xA;Four of Clubs&#xA;Nine of Clubs&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your possible scores are &lt;code&gt;10&lt;/code&gt; and &lt;code&gt;4 + 9 = 13&lt;/code&gt;, so your score is &lt;code&gt;13&lt;/code&gt;, the best of the two.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, if you have:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Six of Hearts&#xA;Six of Spades&#xA;Three of Diamonds&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your possible scores are &lt;code&gt;6&lt;/code&gt;, &lt;code&gt;6&lt;/code&gt;, and &lt;code&gt;3&lt;/code&gt;, so your score is &lt;code&gt;6&lt;/code&gt;, the best of the three.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The highest possible score you can reach is 31, by holding the Ace and two 10-point cards of the same suit.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Special Cases&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If the player who would go first knocks immediately on their first turn, the other players &lt;em&gt;don't&lt;/em&gt; get a turn - they compare hands right away&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If a player reaches a score of 31, they should knock immediately and &lt;em&gt;everyone&lt;/em&gt; else loses a life&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the deck runs out of cards, the round ends and all players compare hands&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Input/Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your bot will be a subclass of the base class I provide. You need not implement every method, but there will be a minimal amount of functionality required in order to make the turns go forward.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I will create a tournament-style bracket that will determine the winning bot. Your bot is allowed keep track of all the information available to it, including between games. The details of the bracket will depend on the number of bots written.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;I could use some input on writing the controller and base class. What has worked well in the past? What hasn't worked that I should avoid?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Are the rules for the game clear enough? I adapted them from my own knowledge of the game and &lt;a href=&quot;http://www.bicyclecards.com/how-to-play/thirty-one/&quot; rel=&quot;nofollow noreferrer&quot;&gt;this website&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Obviously this isn't ready for posting yet since I haven't written the base class, but is there anything else unclear or missing?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is there anything I can do to make this more fun or more challenging? &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="69054" LastEditorUserId="69054" LastEditDate="2017-07-18T17:45:45.583" LastActivityDate="2017-07-18T17:45:45.583" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="13330" PostTypeId="1" CreationDate="2017-07-18T04:19:04.257" Score="1" ViewCount="101" Body="&lt;p&gt;I recently down-voted this off topic question: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/132940/chess-championship&quot;&gt;https://codegolf.stackexchange.com/questions/132940/chess-championship&lt;/a&gt;&#xA;Why was I not awarded the badge &quot;critic&quot; within the next minute? It seemed to work almost instantly on other SE sites.&lt;/p&gt;&#xA;" OwnerUserId="40994" LastEditorUserId="12012" LastEditDate="2017-07-25T13:59:45.813" LastActivityDate="2017-07-25T13:59:45.813" Title="Critic Badge not awarded instantly" Tags="|support|status-bydesign|badges|" AnswerCount="1" CommentCount="3" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13331" PostTypeId="2" ParentId="13330" CreationDate="2017-07-18T07:18:06.880" Score="3" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Badges are handed out in batches throughout the day, different batch jobs handle different badge types.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Source: &lt;a href=&quot;https://meta.stackexchange.com/q/189909/164922&quot;&gt;When are badge calculations done?&lt;/a&gt; on mother meta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must have been lucky on other sites.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I note that you &lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/7/critic?userid=40994&quot;&gt;do have the badge&lt;/a&gt;, awarded about half an hour after posting this question, so as a support issue I think it is resolved.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-07-18T07:18:06.880" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13340" PostTypeId="2" ParentId="2140" CreationDate="2017-07-18T17:52:11.087" Score="3" Body="&lt;h1&gt;How high can you count in English?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;In 500 bytes (or fewer) write a program that outputs a list of the English word forms of as many consecutive integers greater than zero as you can.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, score 6:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;one two three four five six&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Example submission (hopefully you can do better than this):&lt;/h2&gt;&#xA;&#xA;&lt;hr/&gt;&#xA;&#xA;&lt;h3&gt;&lt;a href=&quot;https://docs.python.org/3/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Python 3&lt;/a&gt;, score 43 (488 bytes)&lt;/h3&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;print([&quot;one&quot;,&quot;two&quot;,&quot;three&quot;,&quot;four&quot;,&quot;five&quot;,&quot;six&quot;,&quot;seven&quot;,&quot;eight&quot;,&quot;nine&quot;,&quot;ten&quot;,&quot;eleven&quot;,&quot;twelve&quot;,&quot;thirteen&quot;,&quot;fourteen&quot;,&quot;fifteen&quot;, &quot;sixteen&quot;,&quot;seventeen&quot;,&quot;eighteen&quot;,&quot;nineteen&quot;,&quot;twenty&quot;,&quot;twenty-one&quot;,&quot;twenty-two&quot;,&quot;twenty-three&quot;,&quot;twenty-four&quot;,&quot;twenty-five&quot;,&quot;twenty-six&quot;,&quot;twenty-seven&quot;,&quot;twenty-eight&quot;,&quot;twenty-nine&quot;,&quot;thirty&quot;,&quot;thirty-one&quot;,&quot;thirty-two&quot;,&quot;thirty-three&quot;,&quot;thirty-four&quot;,&quot;thirty-five&quot;,&quot;thirty-six&quot;,&quot;thirty-seven&quot;,&quot;thirty-eight&quot;,&quot;thirty-nine&quot;,&quot;forty&quot;,&quot;forty-one&quot;,&quot;forty-two&quot;,&quot;forty-three&quot;])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##TZBBDsIwDAS/gnoCCU48B3FMiSWUVMG09PWh9q4Ll3jHUdxxp1VzLdfepyZFj7ehljScB12qnbklo7G@mxWZjV7ysTPNqWw1ySPrVovgIZpP3uqSnv5IszRN3rNpEWVEOthUNn0ys09HtA8wblOLrnu4hLMD1QncgMhFgrAPCWsF/PwNY0li7Go7rXsIDUD8QUBoAEODJPPfHTUIoQHcNYDUGCssvFICGQ7MrnA/9f4F&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 3 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr/&gt;&#xA;&#xA;&lt;h2&gt;Scoring and rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For each language, the person whose code counts the highest wins. In case of a tie, the person who submitted first wins.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No modules, libraries, builtins that convert from numeric to word form are allowed.&lt;/li&gt;&#xA;&lt;li&gt;You must output all integers from 1 (one) to n (your score) without missing any. If you want to output 0 (zero) as well, that's fine.&lt;/li&gt;&#xA;&lt;li&gt;You are allowed up to 500 bytes of code. Your code may be a full program or function.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Number format&lt;/strong&gt;: for consistency, all numbers must match the output of &lt;a href=&quot;https://lingojam.com/NumbersToWords&quot; rel=&quot;nofollow noreferrer&quot;&gt;this site&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes apply&lt;/a&gt; (of course)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;Standard output rules apply&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="70097" LastEditorUserId="70097" LastEditDate="2017-07-18T18:27:59.017" LastActivityDate="2017-07-18T18:27:59.017" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="13348" PostTypeId="1" CreationDate="2017-07-19T13:09:03.293" Score="2" ViewCount="127" Body="&lt;p&gt;I was looking at &lt;a href=&quot;https://codegolf.stackexchange.com/questions/61115/make-your-language-unusable?noredirect=1&amp;amp;lq=1&quot;&gt;this&lt;/a&gt; question from almost 2 years ago, and wanted to click the first link, which is to this url: &lt;a href=&quot;https://meta.codegolf.stackexchange.com/a/2073/25180&quot;&gt;https://meta.codegolf.stackexchange.com/a/2073/25180&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;That took me to a site that Chrome (59.0.3071.115) flagged as &quot;not secure&quot; on the grounds of &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;NET::ERR_CERT_COMMON_NAME_INVALID&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;https:&lt;/code&gt; at the beginning of the url is crossed out as well. The same thing happens for the next link (&lt;a href=&quot;https://meta.codegolf.stackexchange.com/q/2447/25180&quot;&gt;https://meta.codegolf.stackexchange.com/q/2447/25180&lt;/a&gt;). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've looked at a few meta links which don't have this issue and seen that rather than start&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;https://meta.codegolf.stackexchange....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;They start&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;https://codegolf.meta.stackexchange....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Did some change take place in the meta url a few years ago leaving links like this abandoned? Does SE's SSL license not cover the &lt;code&gt;meta.codegolf&lt;/code&gt; domain (and perhaps previously did)? Is this actually any sort of security fault (seems like leaving &lt;code&gt;https&lt;/code&gt; while still logged in might be, but I don't know enough about it)? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not currently in a situation where I can ignore the warning and go the site anyway (I'll check it out when I can), so I don't know what the behavior is after following the link, but I feel like this in and of itself is worth bringing up anyway. &lt;/p&gt;&#xA;" OwnerUserId="58583" LastActivityDate="2017-08-21T01:14:34.223" Title="Some Code Golf links marked as &quot;not secure&quot;" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13350" PostTypeId="1" AcceptedAnswerId="13351" CreationDate="2017-07-19T15:29:13.697" Score="2" ViewCount="525" Body="&lt;p&gt;Why is the &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;main chatroom&lt;/a&gt; for Programming Puzzles &amp;amp; Code Golf called &amp;quot;The Nineteenth Byte&amp;quot;?&lt;/p&gt;&#xA;&lt;p&gt;Where did the name come from? Is it a reference to something?&lt;/p&gt;&#xA;" OwnerUserId="65907" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-19T16:12:58.073" Title="Why is chat called &quot;The Nineteenth Byte&quot;?" Tags="|discussion|chat|" AnswerCount="1" CommentCount="0" ClosedDate="2017-07-19T16:28:51.363" ContentLicense="CC BY-SA 3.0" />
  <row Id="13351" PostTypeId="2" ParentId="13350" CreationDate="2017-07-19T16:12:58.073" Score="4" Body="&lt;p&gt;See the meta thread &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1005/2867&quot;&gt;&quot;Let's think of a creative name for our chatroom&quot;&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Well, the traditional generic name for the country club bar is &quot;the nineteenth hole&quot;, which suggests The Nineteenth Byte or something like that. -- &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1006/2867&quot;&gt;dmckee&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Also:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;That name is perfect; it is exactly 19 bytes in size -- &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1005/lets-think-of-a-creative-name-for-our-chatroom#comment3619_1006&quot;&gt;Justin&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2017-07-19T16:12:58.073" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13352" PostTypeId="1" CreationDate="2017-07-19T16:25:05.997" Score="1" ViewCount="57" Body="&lt;p&gt;&lt;strong&gt;I think the Sandbox lacks a feature.&lt;/strong&gt; I don't know what you guys do think about it but I came to think that many posts of the Sandbox get &quot;forgotten&quot; really fast. Even if there are activities on it. And because they are &quot;answers&quot; to a &quot;question&quot;, there is no possibility of upping with a bounty or something.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;tnb&lt;/a&gt; people, which are really helpful, can't fully validate what you're doing in the sandbox, since they have things to do too - obviously.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So what do you think is doable? Or what should we do to &quot;up&quot; a post, since updating or working on it does not do the job? I don't want to flood chats or something, that's why I'm asking it more broadly here.&lt;/p&gt;&#xA;" OwnerUserId="71499" LastEditorUserId="194" LastEditDate="2017-07-19T18:09:10.097" LastActivityDate="2017-07-19T18:40:27.013" Title="Why is there no feature for upping your &quot;answer&quot; in the sandbox?" Tags="|discussion|sandbox|" AnswerCount="2" CommentCount="2" ClosedDate="2017-07-19T19:26:35.040" ContentLicense="CC BY-SA 3.0" />
  <row Id="13353" PostTypeId="2" ParentId="13352" CreationDate="2017-07-19T16:48:42.197" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://blogs.msdn.microsoft.com/oldnewthing/20050607-00/?p=35413&quot; rel=&quot;nofollow noreferrer&quot;&gt;What if everyone did this?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is the kind of feature which logically cannot work as intended, so there's no point adding it.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-07-19T16:48:42.197" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13356" PostTypeId="2" ParentId="2140" CreationDate="2017-07-19T17:55:29.140" Score="6" Body="&lt;h1&gt;Tower Builder &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The king is coming to visit!  Your city is competing with another neighboring city to attract his attention.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Each player owns their own tower&lt;/strong&gt; within a city full of other players.  Each turn you place 1 blocks on your tower or another tower in your city. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;After 100 turns, &lt;strong&gt;the king will only visit the city with the highest tower.&lt;/strong&gt;  If he visits your city, then you will gain points equal to the number of blocks in &lt;strong&gt;your personal tower&lt;/strong&gt;.  In the case of a tie, neither city is visited.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Games include all players, and each game will randomly arrange players into cities.  Your score is the total score across all games.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Player identifiers are randomly generated at the start of the tournament, but are consistent from game to game.&lt;/li&gt;&#xA;&lt;li&gt;In addition, contrary to past KoTHs:  I allow saving state from game to game (but not between tournaments)&lt;/li&gt;&#xA;&lt;li&gt;You will always have complete information, including:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The size of everybody's towers (including the other city)&lt;/li&gt;&#xA;&lt;li&gt;The actions players have taken&lt;/li&gt;&#xA;&lt;li&gt;The current score of all players&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2018-01-30T18:04:39.220" LastActivityDate="2018-01-30T18:04:39.220" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="13357" PostTypeId="2" ParentId="2140" CreationDate="2017-07-19T18:11:12.260" Score="-1" Body="&lt;h1&gt;Quick! Tell me all the numbers from 1 to 100,000! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/numbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;numbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;numbers&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to write a program or function that, when run, output all the numbers from 1 to 100 thousand as quickly as possible to STDOUT. It's that simple. All answers are tested on an &lt;a href=&quot;https://www.cnet.com/products/hp-compaq-nx9420-notebook/specs/&quot; rel=&quot;nofollow noreferrer&quot;&gt;HP Compaq nx9420&lt;/a&gt; with an Intel Core Duo @ 1.83 GHz and 3 gigs of RAM using the &lt;code&gt;time&lt;/code&gt; command.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Of course, standard loopholes are &lt;em&gt;strictly forbidden&lt;/em&gt;.&lt;br /&gt;&#xA;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, so may the fastest code win and the best programmer prosper...&lt;/p&gt;&#xA;" OwnerUserId="64706" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-19T18:11:12.260" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="13358" PostTypeId="2" ParentId="13352" CreationDate="2017-07-19T18:40:27.013" Score="0" Body="&lt;p&gt;Editing your post will move it to the top of Active, which is how most users watch the Sandbox. You can make an editing pass to clarify and clean up your challenge, or to ask for more specific bits of feedback. I think works better than a mindless &quot;bump&quot; feature because it encourages the writer to improve the challenge along the way.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2017-07-19T18:40:27.013" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13361" PostTypeId="1" CreationDate="2017-07-19T20:57:32.597" Score="9" ViewCount="455" Body="&lt;p&gt;Recently &lt;a href=&quot;https://codegolf.stackexchange.com/questions/131513/fibtraction-fibonacci-but-with-subtraction&quot;&gt;this question&lt;/a&gt; caused a bit of a stir.  The admitted goal of the challenge was to replace our old fibonacci question which the op felt was outdated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question was closed twice by high rep users holding code-golf badges, and reopened twice by regular users.  It currently has two additional close votes.  This is not good.  This shows there is a significant content dispute over this question.  Although the question has mostly died down I think it is a good idea to discuss this question on the meta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is the question a dupe?  Should it be closed?  What should we do in similar situations where a old question is being &quot;replaced&quot; with a newer similar question?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/13256/condition-of-our-fibonacci-challenge&quot;&gt;Related Discussion&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-07-21T12:04:28.920" Title="Is fibtraction a dupe?" Tags="|discussion|duplicates|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13362" PostTypeId="2" ParentId="2140" CreationDate="2017-07-19T22:17:17.970" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/133754/66833&quot;&gt;One OEIS after another&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2017-07-21T15:00:59.567" LastActivityDate="2017-07-21T15:00:59.567" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="13363" PostTypeId="2" ParentId="13361" CreationDate="2017-07-19T23:26:20.797" Score="2" Body="&lt;h1&gt;It is not a dupe.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Many languages have a built-in to get the Fibonacci Sequence, or to get the &lt;code&gt;z&lt;/code&gt;-th Fibonacci number, or to check if a number is a Fibonacci number, etc. Or all of them. However, most languages don't have a built-in for Fibtraction Sequence numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, here are two programs to get the &lt;code&gt;z&lt;/code&gt;-th element of each sequence, in Jelly:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Fibonacci  : ÆḞ&#xA;Fibtraction: 1_@¡3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Evidently, there's a significant difference here that many languages with a lot of builtins can't use their Fibonacci builtins for this challenge.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2017-07-20T15:11:55.630" LastActivityDate="2017-07-20T15:11:55.630" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13365" PostTypeId="2" ParentId="13361" CreationDate="2017-07-20T00:52:32.860" Score="8" Body="&lt;h2&gt;Yes, it is&lt;/h2&gt;&#xA;&lt;p&gt;As HyperNeutrino noted, in languages with Fibonacci sequence builtins, there is a significant difference in the code. But not all languages have Fibonacci sequence builtins (most don't!).&lt;/p&gt;&#xA;&lt;p&gt;For example, here's Haskell code for the Fibonacci sequence:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;f 0=0&#xA;f 1=1&#xA;f n=f(n-2)+f(n-1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And here's Haskell code for the Fibtraction sequence:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;f 0=1&#xA;f 1=2&#xA;f n=f(n-2)-f(n-1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;There is a grand total of three bytes changed between the two solutions. That is a trivial difference.&lt;/p&gt;&#xA;&lt;p&gt;The author intended it to be a replacement for the old Fibonacci sequence challenge, but it's not a good replacement, because the challenge is about generating a different (though extremely similar) sequence. If the community decides that a new Fibonacci challenge is needed, it would be much better to just rewrite the Fibonacci sequence challenge, and then close both of the existing challenges as dupes of that one.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-21T02:48:46.413" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13368" PostTypeId="2" ParentId="13361" CreationDate="2017-07-20T09:10:24.897" Score="12" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Is the question a dupe?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Yes, it is&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Our standard for whether one question duplicates another is: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/777/194&quot;&gt;can answers from one question be copied with minor modifications and be competitive?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not going to work through all 174 answers to the older question, but to take the first page by votes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Perl: yes&lt;/li&gt;&#xA;&lt;li&gt;Brainfuck: yes&lt;/li&gt;&#xA;&lt;li&gt;Haskell: yes&lt;/li&gt;&#xA;&lt;li&gt;C#: yes&lt;/li&gt;&#xA;&lt;li&gt;GolfScript: yes&lt;/li&gt;&#xA;&lt;li&gt;&gt;&amp;lt;&gt;: I have no idea&lt;/li&gt;&#xA;&lt;li&gt;J: I think so, the generating sequence is almost identical&lt;/li&gt;&#xA;&lt;li&gt;Hexagony: I think so&lt;/li&gt;&#xA;&lt;li&gt;Python: yes&lt;/li&gt;&#xA;&lt;li&gt;COW: I have no idea&lt;/li&gt;&#xA;&lt;li&gt;GolfScript: yes&lt;/li&gt;&#xA;&lt;li&gt;Jelly: I think so&lt;/li&gt;&#xA;&lt;li&gt;Ruby: yes&lt;/li&gt;&#xA;&lt;li&gt;Mathematica: the one which isn't a built-in could&lt;/li&gt;&#xA;&lt;li&gt;DC: yes&lt;/li&gt;&#xA;&lt;li&gt;K: yes&lt;/li&gt;&#xA;&lt;li&gt;Prelude: I think so&lt;/li&gt;&#xA;&lt;li&gt;Hexagony: I think so&lt;/li&gt;&#xA;&lt;li&gt;Java: yes&lt;/li&gt;&#xA;&lt;li&gt;Ruby: yes&lt;/li&gt;&#xA;&lt;li&gt;TI-BASIC: possibly, I haven't checked whether the roots of the characteristic equation are as nice&lt;/li&gt;&#xA;&lt;li&gt;GolfScript: yes&lt;/li&gt;&#xA;&lt;li&gt;05AB1E: I think so&lt;/li&gt;&#xA;&lt;li&gt;C#: yes&lt;/li&gt;&#xA;&lt;li&gt;PowerShell: yes&lt;/li&gt;&#xA;&lt;li&gt;FAC: I think so&lt;/li&gt;&#xA;&lt;li&gt;Desmos: yes&lt;/li&gt;&#xA;&lt;li&gt;JavaScript: yes&lt;/li&gt;&#xA;&lt;li&gt;Cy: yes&lt;/li&gt;&#xA;&lt;li&gt;Cubix: I think so&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There should not even be a question as to whether it's a dupe or not.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;What should we do in similar situations where a old question is being &quot;replaced&quot; with a newer similar question?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Before&lt;/strong&gt; the newer question is posted, there should be a specific discussion on meta as to what the best way forward is for that question. (I'm sure there's an older meta question about this, but I can't find it).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this case two people pointed out different potential dupes to totallyhuman in the sandbox, and both of them received upvotes on their comments, but totallyhuman decided unilaterally that they knew better, and only started a discussion on meta after the question had been closed. That meta question made it quite plain to me that they had a solution in search of a problem. The resulting situation is something which we can point to in future to show people &lt;em&gt;why&lt;/em&gt; they should discuss the older question on meta first.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-07-20T09:10:24.897" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13369" PostTypeId="1" CreationDate="2017-07-20T09:55:10.910" Score="1" ViewCount="114" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/133519/contractible-closed-geodesic&quot;&gt;Latest example&lt;/a&gt;: Hopefully it'll be gone soon.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Over the past few days I've noticed an increase in spam/off-topic questions and answers. The community itself seems to handle these very quickly (probably for lower rep thresholds to perform certain actions). Which is a very good thing, so that these don't stay around for long.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, we obviously want as little as possible on the site. Is there any way we can try and slow this down to getting onto the site in the first place?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, if possible, could we get any statistics on closed/deleted questions and answers for spam/off-topic over the past few weeks? A few things I'd be interested in are, all graphed over time:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Number of closures with breakdown of their reasons&lt;/li&gt;&#xA;&lt;li&gt;Number of closed and then deleted with breakdown of their reasons&lt;/li&gt;&#xA;&lt;li&gt;Spam question and answers&lt;/li&gt;&#xA;&lt;li&gt;Potentially any other related information&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="38550" LastActivityDate="2017-07-21T02:35:22.187" Title="Has there been an increase in Spam/Off-topic questions?" Tags="|discussion|closed-questions|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13372" PostTypeId="2" ParentId="13369" CreationDate="2017-07-20T11:32:47.183" Score="3" Body="&lt;p&gt;I'm not sure what the rep requirements are to see these pages, but...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/tools/question-close-stats&quot;&gt;Closures with breakdown of their reasons&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/tools?tab=delete&amp;amp;daterange=last30days&quot;&gt;Recently deleted&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-07-20T11:32:47.183" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13373" PostTypeId="2" ParentId="2140" CreationDate="2017-07-20T12:11:12.857" Score="1" Body="&lt;h2&gt;How good is my mahjong hand?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your goal is to calculate the &lt;strong&gt;&lt;em&gt;shanten&lt;/em&gt;&lt;/strong&gt; (minimal number of tiles needed for your hand to be a &quot;waiting hand&quot;) of a &lt;a href=&quot;https://en.wikipedia.org/wiki/Japanese_Mahjong&quot; rel=&quot;nofollow noreferrer&quot;&gt;Riichi mahjong&lt;/a&gt; hand.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;What is Japanese Mahjong (or Riichi)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal of the game is to build a 14 tiles &lt;em&gt;valid&lt;/em&gt; hand. Your hand is 13 tiles long, and each turn, you draw a 14th. If it doesn't make you win, you discard a tile.&#xA;The tiles are grouped by &lt;strong&gt;colors&lt;/strong&gt; : &lt;em&gt;man&lt;/em&gt;, numbers, let's call them &lt;code&gt;m&lt;/code&gt;; &lt;em&gt;pin&lt;/em&gt;, circles, &lt;code&gt;p&lt;/code&gt;; &lt;em&gt;sou&lt;/em&gt;, bamboos, &lt;code&gt;s&lt;/code&gt;; and honor tiles, &lt;code&gt;z&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For &lt;code&gt;p&lt;/code&gt;,&lt;code&gt;m&lt;/code&gt;, and &lt;code&gt;s&lt;/code&gt; : tiles are numbered &lt;strong&gt;from 1 to 9&lt;/strong&gt;, with &lt;strong&gt;4 examples each&lt;/strong&gt; (&lt;code&gt;1m 1m 1m 1m 2m 2m 2m 2m 3m 3m 3m 3m... 9m 9m 9m 9m&lt;/code&gt;).&lt;br&gt;&#xA;&lt;code&gt;z&lt;/code&gt; contains winds : &lt;em&gt;ton&lt;/em&gt; for east, &lt;code&gt;e&lt;/code&gt;; &lt;em&gt;nan&lt;/em&gt; for south, &lt;code&gt;s&lt;/code&gt;; &lt;em&gt;sha&lt;/em&gt; or &lt;em&gt;xia&lt;/em&gt; for west, &lt;code&gt;w&lt;/code&gt;; and &lt;em&gt;pei&lt;/em&gt; for north, &lt;code&gt;n&lt;/code&gt;.&lt;br&gt;&#xA;&lt;code&gt;z&lt;/code&gt; contains dragons too : &lt;em&gt;chun&lt;/em&gt; for red, &lt;code&gt;r&lt;/code&gt;; &lt;em&gt;haku&lt;/em&gt; for white, &lt;code&gt;h&lt;/code&gt;; and &lt;em&gt;hatsu&lt;/em&gt; for green, &lt;code&gt;g&lt;/code&gt;.&lt;br&gt;&#xA;&lt;strong&gt;Same rule&lt;/strong&gt;, 4 examples each.&lt;br&gt;&#xA;Honor tiles &lt;strong&gt;cannot be sequenced in a &lt;em&gt;chii&lt;/em&gt;&lt;/strong&gt;, they can only combine with themselves, by &lt;strong&gt;matching for a pair&lt;/strong&gt; or &lt;strong&gt;for a &lt;em&gt;pon&lt;/em&gt;&lt;/strong&gt;. Don't worry, I will define terms &lt;em&gt;pon&lt;/em&gt; and &lt;em&gt;chii&lt;/em&gt; in the next part.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So a random hand can look like &lt;code&gt;1s 1s 1s 2s 2s 2s 3s 9p 9p 4m ez ez nz&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;What is a &quot;waiting hand&quot;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What is called a &lt;em&gt;tenpai&lt;/em&gt; hand, or hand that is one tile left before winning, is a hand respecting a winning shape. In general, a winning hand is composed of 4 sets of 3 sequenced (&lt;em&gt;chii&lt;/em&gt;, like &lt;code&gt;1s 2s 3s&lt;/code&gt;) or matching (&lt;em&gt;pon&lt;/em&gt;, like &lt;code&gt;1s 1s 1s&lt;/code&gt;) tiles, plus a pair (like &lt;code&gt;1p 1p&lt;/code&gt;). An example of a winning hand (14 tiles) can be : &lt;code&gt;1s 2s 3s 4s 5s 6s 6s 7s 8s 3p 3p 3p ez ez&lt;/code&gt;&lt;br&gt;&#xA;So a &quot;waiting hand&quot; can be : &lt;code&gt;1s 2s 3s 4s 5s 6s 6s 7s 8s 3p 3p 3p ez&lt;/code&gt; where you need only &lt;code&gt;ez&lt;/code&gt;to win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The goal&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To output a positive integer (between 0 and 7, inclusive) representing the &lt;em&gt;shanten&lt;/em&gt; as defined above.&#xA;For instance, a hand like &lt;code&gt;1s 1s 1s 2s 2s 2s 3s 9p 9p 4m ez ez nz&lt;/code&gt; is 2 &lt;em&gt;shanten&lt;/em&gt;, because :&lt;br&gt;&#xA;- you have a set of three &lt;code&gt;1s&lt;/code&gt; (a &lt;em&gt;pon&lt;/em&gt;)&lt;br&gt;&#xA;- you have a &lt;em&gt;pon&lt;/em&gt; of &lt;code&gt;2s&lt;/code&gt;&lt;br&gt;&#xA;- you have a pair of &lt;code&gt;9p&lt;/code&gt; (your pair)&lt;br&gt;&#xA;- you have another pair of &lt;code&gt;ez&lt;/code&gt; (that needs a third one to become a &lt;em&gt;pon&lt;/em&gt;)&lt;br&gt;&#xA;- you have 3 &quot;isolated&quot; tiles, &lt;code&gt;3s&lt;/code&gt;,&lt;code&gt;4m&lt;/code&gt;,&lt;code&gt;nz&lt;/code&gt;.    &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So drawing &lt;code&gt;ez&lt;/code&gt;, and creating the &lt;em&gt;pon&lt;/em&gt; of &lt;code&gt;ez&lt;/code&gt;, makes you discard &lt;code&gt;nz&lt;/code&gt; for example. Then let's imagine you draw &lt;code&gt;2s&lt;/code&gt; : you discard &lt;code&gt;4m&lt;/code&gt;, and you are now with a &quot;waiting hand&quot;, with :&lt;br&gt;&#xA;&lt;code&gt;1s 1s 1s 2s 2s 2s 2s 3s 9p 9p ez ez ez&lt;/code&gt;, waiting on &lt;code&gt;1s&lt;/code&gt; or &lt;code&gt;4s&lt;/code&gt;.&#xA;You drew two &quot;useful tiles&quot; to come to this hand, so you were 2 &lt;em&gt;shanten&lt;/em&gt;.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;@Sandbox&lt;/strong&gt; : Is it on-purpose to put &lt;strong&gt;two&lt;/strong&gt; detailed examples? (&lt;strong&gt;pro&lt;/strong&gt; : clarifies what you have to do / &lt;strong&gt;con&lt;/strong&gt; : challenge's wall of text is even bigger)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Another example&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's see your hand looks like &lt;code&gt;4p 5p 7p 1m 1m 1m 2s 4s 6s ez sz hz hz&lt;/code&gt;.&lt;br&gt;&#xA;- you have a &lt;em&gt;pon&lt;/em&gt; of &lt;code&gt;1m&lt;/code&gt;&lt;br&gt;&#xA;- you have &lt;code&gt;4p&lt;/code&gt; and &lt;code&gt;5p&lt;/code&gt; sequenced, requiring &lt;code&gt;3p&lt;/code&gt; or &lt;code&gt;6p&lt;/code&gt; to be a &lt;em&gt;chii&lt;/em&gt;&lt;br&gt;&#xA;- you have &lt;code&gt;2s 4s 6s&lt;/code&gt;, requiring &lt;code&gt;3s&lt;/code&gt; or &lt;code&gt;5s&lt;/code&gt; to create a &lt;em&gt;chii&lt;/em&gt;&lt;br&gt;&#xA;- you have a pair of &lt;code&gt;hz&lt;/code&gt;&lt;br&gt;&#xA;- you have 3 &quot;isolated&quot; tiles, &lt;code&gt;7p&lt;/code&gt;, &lt;code&gt;ez&lt;/code&gt; and &lt;code&gt;sz&lt;/code&gt;.    &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, as for the first example, we have 3 isolated tiles. But are we 2 &lt;em&gt;shanten&lt;/em&gt;? No, because &lt;code&gt;2s 4s 6s&lt;/code&gt; is not complete. So in fact, we have 4 useless tiles, the 4th being &lt;code&gt;2s&lt;/code&gt; or &lt;code&gt;6s&lt;/code&gt; depending on what we draw.&lt;br&gt;&#xA;Proof : if we draw &lt;code&gt;3p&lt;/code&gt;, &lt;code&gt;3s&lt;/code&gt; and &lt;code&gt;hz&lt;/code&gt;, our hand looks like that :&lt;br&gt;&#xA;&lt;code&gt;3p 4p 5p 1m 1m 1m 2s 3s 4s sz hz hz hz&lt;/code&gt;&lt;br&gt;&#xA;and is waiting on the second &lt;code&gt;sz&lt;/code&gt; to form the pair and win. We drew 3 useful tiles, so we were 3 &lt;em&gt;shanten&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test cases&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;3m 6m 9m 3p 5p 8p 1s 5s 8s ez sz nz gz -&gt; 7 shanten&#xA;3m 6m 9m 3p 4p 5p 8p 1s 5s 8s ez sz nz -&gt; 6 shanten&#xA;3m 6m 9m 3p 4p 5p 8p 1s 5s 8s ez nz nz -&gt; 5 shanten&#xA;3m 6m 9m 3p 4p 5p 8p 8p 5s 8s ez nz nz -&gt; 4 shanten&#xA;3m 5m 6m 9m 3p 4p 5p 8p 8p 5s 8s nz nz -&gt; 4 shanten&#xA;3m 4m 5m 6m 3p 4p 5p 8p 8p 5s 8s nz nz -&gt; 3 shanten&#xA;3m 4m 5m 6m 3p 4p 5p 8p 8p 5s 5s nz nz -&gt; 2 shanten&#xA;3m 4m 5m 6m 7m 3p 4p 5p 8p 5s 5s nz nz -&gt; 1 shanten&#xA;3m 4m 5m 6m 7m 3p 4p 5p 5s 5s nz nz nz -&gt; 0 shanten&#xA;6s 7s 8s 1p 1p 1p 3p 4p 5p 6p 7p 7p 7p -&gt; 0 shanten&#xA;3s 4s 5s 6s 7s 2p 4p 6p ez nz nz hz gz -&gt; 3 shanten&#xA;3s 4s 5s 6s 7s 7s 1p 2p 4p 6p nz nz hz -&gt; 2 shanten&#xA;3s 3s 4s 5s 6s 7s 7s 2p 4p sz sz nz nz -&gt; 2 shanten&#xA;3s 3s 4s 5s 5s 6s 7s 7s 4p nz nz sz sz -&gt; 2 shanten&#xA;3s 3s 3s 4s 5s 5s 7s 8s 2p 3p 4p 6p 6p -&gt; 1 shanten&#xA;1m 1m 1m 2s 7s 7s 1p 3p 4p 9p sz hz cz -&gt; 4 shanten&#xA;3m 6m 9m 3p 8p 1s 5s 8s ez sz nz gz cz -&gt; 8 shanten&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Protip&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Calculating &lt;em&gt;shanten&lt;/em&gt; can be complex, so &lt;a href=&quot;http://arcturus.su/wiki/Shanten&quot; rel=&quot;nofollow noreferrer&quot;&gt;here is a link&lt;/a&gt; that can help you doing so. You can refer to &lt;a href=&quot;http://arcturus.su/wiki/Main_Page&quot; rel=&quot;nofollow noreferrer&quot;&gt;this site&lt;/a&gt; if you need any other information on riichi mahjong. Good luck!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring and extra rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, so shortest answer in bytes wins for its language.&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; apply.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;NB&lt;/strong&gt; : If you know mahjong, or were curious and dug deeper into the rules, don't mind with specific shapes like &lt;a href=&quot;http://arcturus.su/wiki/Chiitoitsu&quot; rel=&quot;nofollow noreferrer&quot;&gt;seven pairs&lt;/a&gt; or &lt;a href=&quot;http://arcturus.su/wiki/Kokushi_musou&quot; rel=&quot;nofollow noreferrer&quot;&gt;thirteen orphans&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;tags&lt;/strong&gt; : &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;br&gt;&#xA;&lt;strong&gt;@Sandbox&lt;/strong&gt; : should I create some sort of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt; in a pastebin or something?&lt;br&gt;&#xA;&lt;a href=&quot;https://stackoverflow.com/questions/4239028/how-do-i-calculate-the-shanten-number-in-mahjong&quot;&gt;Related&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://stackoverflow.com/questions/4154960/algorithm-to-find-streets-and-same-kind-in-a-hand&quot;&gt;Related too&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;http://tenhou.net/2/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Something that can help if you speak japanese&lt;/a&gt; &lt;code&gt;&amp;lt;-&lt;/code&gt; you can copypaste in the field the output from &lt;a href=&quot;https://tio.run/##Xc9NCsIwFATgtTnFI6sGROiPioKLHsCVXiCmrz8S09BElJaePT5UEAMDA99qximpZegvV1QejrIzgE@PpnJQWjuxRYU11P1wRtP298TvT37oTCO@fZiCXw1otVRYap1w4EvOxR8hURqZGwmzMdIHYR6ZISsia8jWkbVkm8gU2ZaLMDNmaa3XJvld4ekNPskcbN9JLeQWCgs7C26EdgRFEwWbwws&quot; rel=&quot;nofollow noreferrer&quot;&gt;this program&lt;/a&gt; :)&lt;br&gt;&#xA;&lt;a href=&quot;https://www.reddit.com/r/Mahjong/comments/5p20gg/how_do_you_quickly_calculate_the_number_of_shanten/?st=j5c9i5ar&amp;amp;sh=62c24e67&quot; rel=&quot;nofollow noreferrer&quot;&gt;Another protip&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;SANDBOX&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Feel free to comment and tell me if this is on-purpose in PPCG, if there is any way to improve the way I say things, if I'm unclear anywhere ...&lt;/p&gt;&#xA;" OwnerUserId="71499" LastEditorUserId="71499" LastEditDate="2017-07-24T09:22:15.210" LastActivityDate="2017-07-24T09:22:15.210" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="13376" PostTypeId="1" AcceptedAnswerId="13378" CreationDate="2017-07-20T17:14:18.187" Score="-1" ViewCount="345" Body="&lt;h1&gt;&lt;s&gt;2,646&lt;/s&gt; 3,008 characters&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/133541/65907&quot;&gt;Is a crossed out 4 still a 4?&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;There seems to be a running joke on Code Golf that &quot;A crossed out 4 is still a 4&quot;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;On &lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/133486/65907&quot;&gt;Find an Illegal String&lt;/a&gt;&lt;/em&gt;, Step Hen posted &lt;a href=&quot;https://codegolf.stackexchange.com/a/133541/65907&quot;&gt;the following answer&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;&lt;a href=&quot;https://esolangs.org/wiki/Taxi&quot; rel=&quot;nofollow noreferrer&quot;&gt;Taxi&lt;/a&gt;, &lt;s&gt;&amp;nbsp;4&amp;nbsp;&lt;/s&gt; 5 bytes&lt;/h1&gt;&#xA;  &#xA;  &lt;p&gt;&lt;sup&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/123438/65836&quot;&gt;crossed out 4 is still 4 :(&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;'&quot;]'&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This post linked to &lt;a href=&quot;https://codegolf.stackexchange.com/a/123438/65907&quot;&gt;Mayube's answer&lt;/a&gt; for &lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/123194/65907&quot;&gt;User Appreciation Challenge #1: Dennis ♦&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Braingolf, &lt;s&gt;4&lt;/s&gt; 3 bytes [non-competing]&lt;/h1&gt;&#xA;  &#xA;  &lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/123404/44998&quot;&gt;crossed out 4 is still regular 4&#xA;  :(&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;amp;JP&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Which linked to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/123403/better-hex-color-codes-for-your-internet/123404#comment302922_123404&quot;&gt;Challenger5's answer&lt;/a&gt; for &lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/123403/65907&quot;&gt;Better Hex Color Codes for Your Internet&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h2&gt;CJam, &lt;s&gt;45&lt;/s&gt; &amp;lt;s&amp;gt;44&amp;lt;/s&amp;gt; &lt;s&gt;42&lt;/s&gt; &lt;s&gt;40&lt;/s&gt; 36 bytes&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;q(\0se|_,(&quot;6* 3* 2e* )f{} _W=+ &quot;S/=~&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Which included &lt;a href=&quot;https://codegolf.stackexchange.com/questions/123403/better-hex-color-codes-for-your-internet/123404#comment302916_123404&quot;&gt;the following exchange&lt;/a&gt; in the comments:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Some formatting &amp;lt;s&gt;not&amp;lt;/s&gt; required.... &lt;code&gt;&amp;lt;s&amp;gt;&amp;lt;/s&amp;gt;&lt;/code&gt; – SteveFest&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;@SteveFest But &lt;a href=&quot;https://codegolf.stackexchange.com/a/82343/61384&quot;&gt;crossed out 44 is still regular 44&lt;/a&gt;... – Challenger5&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Aw! You got me! I forgot that! – SteveFest&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This hyperlink chain then continues to link through a multitude of answers written by different users on different questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/133541/65907&quot;&gt;Step Hen's answer&lt;/a&gt; on &lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/133486/65907&quot;&gt;Find an Illegal String&lt;/a&gt;&lt;/em&gt;&lt;br&gt;&#xA;→ &lt;a href=&quot;https://codegolf.stackexchange.com/a/123438/65907&quot;&gt;Mayube's answer&lt;/a&gt; on &lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/123194/65907&quot;&gt;User Appreciation Challenge #1: Dennis ♦&lt;/a&gt;&lt;/em&gt;&lt;br&gt;&#xA;→ &lt;a href=&quot;https://codegolf.stackexchange.com/questions/123403/better-hex-color-codes-for-your-internet/123404#comment302922_123404&quot;&gt;Challenger5's comment&lt;/a&gt; on &lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/123403/65907&quot;&gt;Better Hex Color Codes for Your Internet&lt;/a&gt;&lt;/em&gt;&lt;br&gt;&#xA;→ &lt;a href=&quot;https://codegolf.stackexchange.com/a/82343/65907&quot;&gt;Fatalize's answer&lt;/a&gt; on &lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/82342/65907&quot;&gt;Closest 7-Distinct-Prime Product&lt;/a&gt;&lt;/em&gt;&lt;br&gt;&#xA;→ &lt;a href=&quot;https://codegolf.stackexchange.com/a/79116/65907&quot;&gt;George Gibson's answer&lt;/a&gt; on &lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/1576/65907&quot;&gt;Compute the first N digits of e&lt;/a&gt;&lt;/em&gt;&lt;br&gt;&#xA;→ &lt;a href=&quot;https://codegolf.stackexchange.com/a/77913/65907&quot;&gt;GamrCorps's answer&lt;/a&gt; on &lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/77899/65907&quot;&gt;Substitution cipher&lt;/a&gt;&lt;/em&gt;&lt;br&gt;&#xA;→ &lt;a href=&quot;https://codegolf.stackexchange.com/a/73584/65907&quot;&gt;daavko's answer&lt;/a&gt; on &lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/73580/65907&quot;&gt;Swap, delete and repeat&lt;/a&gt;&lt;/em&gt;&lt;br&gt;&#xA;→ &lt;a href=&quot;https://codegolf.stackexchange.com/a/63380/65907&quot;&gt;Mego's answer&lt;/a&gt; on &lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/62732/65907&quot;&gt;Implement a Truth-Machine&lt;/a&gt;&lt;/em&gt;&lt;br&gt;&#xA;→ &lt;a href=&quot;https://codegolf.stackexchange.com/questions/63755/rotate-the-anti-diagonals#comment153855_63756&quot;&gt;AdmBorkBork's comment&lt;/a&gt; on &lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/63755/65907&quot;&gt;Rotate the anti-diagonals&lt;/a&gt;&lt;/em&gt;&lt;br&gt;&#xA;→ ...And so on and so forth.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;What is the running joke with crossed out 4s? How did the joke get started? Does this chain of hyperlinks have an end?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="65907" LastEditorUserId="65907" LastEditDate="2017-07-20T17:54:27.240" LastActivityDate="2017-07-20T19:45:33.987" Title="Is a crossed out 4 still a 4?" Tags="|support|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13378" PostTypeId="2" ParentId="13376" CreationDate="2017-07-20T19:45:33.987" Score="3" Body="&lt;p&gt;As linked in the comments, the memes page was &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13022/34718&quot;&gt;deleted by the moderator team&lt;/a&gt;. The related meme's description can be seen in the screenshot below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I agree with their decision to delete the meme page for the same reason that you have asked this question. Because people keep referencing it in their answers. It's more annoying than helpful, so I'm hoping that the page's deletion will allow us all to forget about it, because it's also annoying when people keep linking to the meme in their answers. We've seen it a thousand times, and it's hackneyed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/bl1Xa.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/bl1Xa.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="34718" LastActivityDate="2017-07-20T19:45:33.987" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13381" PostTypeId="2" ParentId="2140" CreationDate="2017-07-20T22:08:21.483" Score="0" Body="&lt;h1&gt;Word Problem Generator &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;Already exists &lt;a href=&quot;http://www.wolframalpha.com/problem-generator/&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;!&lt;/h2&gt;&#xA;&lt;p&gt;Word problems can be a great way to test comprehension of concepts, but they are pain to write. That's why you need to make a program that takes an equation (or set of equations), and makes a word problem out of them. For example, if the input is &lt;code&gt;x+3=8&lt;/code&gt;, you can output, &lt;code&gt;Mary has 3 more apples than Johnny. If Mary has 8 apples, how many does Johnny have?&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;The best answers for this challenge will be able to handle many different types of equations and randomly generate a variety of unique word problems. It might be o.k. if your program creates non-sensical word problems, as long as they describe the input equation/equation set and people like them.&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Submission must be no longer than 2000 bytes&lt;/li&gt;&#xA;&lt;li&gt;External files and URL's may be used to access word lists not specifically made for this challenge. You can also use libraries for parsing mathematical equations and sentence generation that were not specifically made for this challenge (WolframAlpha is acceptable). Inquire about other acceptable usage of external sources.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Golfing is encouraged.&lt;/strong&gt; Most popularity contests ask for readable code, but with a tight 2000 byte limit, I encourage golfing as much as possible  (even using a golfing language), so that you'll have enough bytes remaining to create interesting word problems.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;atan(x) = 5/4&lt;/code&gt; =&amp;gt; &amp;quot;At what angle should Jan hit the soccer ball to hit a target 5 feet high and 4 feet away?&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x+5 = y, 2(x-1) = y-1&lt;/code&gt; =&amp;gt; &amp;quot;Paul is 5 years older than Sally. Last year Paul was twice Sally's age. How old are Paul and Sally?&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x = 6^2/4^2 &lt;/code&gt; =&amp;gt; &amp;quot;How much more pizza is there in a 12 inch pizza than an 8 inch pizza?&amp;quot;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Submission&lt;/h1&gt;&#xA;&lt;p&gt;With your submission, you include the types of equations/equation sets it can handle (we'll assume that &lt;code&gt;a,b,c,d,e,f,g&lt;/code&gt; refer to constants and &lt;code&gt;t,u,v,w,x,y,z&lt;/code&gt; refer to variables).&lt;/p&gt;&#xA;&lt;p&gt;As an example, let's say your program can only make 1 type of word problem: &amp;quot;How long will it take for a boat with speed &lt;em&gt;a&lt;/em&gt; to catch up to a boat with speed &lt;em&gt;b&lt;/em&gt; that is distance &lt;em&gt;c&lt;/em&gt; ahead of the first boat?&amp;quot; In that case, you write that your program only handles equations of the form &lt;code&gt;at = bt + c&lt;/code&gt;, so people will know to only test it with things like &lt;code&gt;5t = 3t + 2&lt;/code&gt; or &lt;code&gt;4t = 2t + 1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, you should mention if your program can make multiple types of word problems for one type of equation/equation set. For example, an equation of the form &lt;code&gt;a + bx = c&lt;/code&gt; could lead to word problems about the time it takes to get from one point to another, or the amount of a particular coin you need to reach a certain amount of money.&lt;/p&gt;&#xA;&lt;p&gt;Likewise, mention other ways your program creates variety in generating word problems.&lt;/p&gt;&#xA;&lt;p&gt;Finally, you can include some sample word problems your program has generated, and the equations they were for.&lt;/p&gt;&#xA;&lt;h1&gt;Minimum Requirements&lt;/h1&gt;&#xA;&lt;p&gt;The most basic acceptable solution should handle at least 1 equation/equation set with at least 1 variable, 1 constant, and 1 mathematical operation. Such a minimal program might only handle equations of the form &lt;code&gt;x = a + 1&lt;/code&gt;. It might output word problems like, &amp;quot;If Jerry has &lt;em&gt;a&lt;/em&gt; apples, and he picks 1 more, how many does he have now?&amp;quot; Obviously, you should not strive for the bare minimum.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;All suggestions welcome!&lt;/p&gt;&#xA;" OwnerUserId="46313" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-25T16:39:54.227" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13385" PostTypeId="2" ParentId="13369" CreationDate="2017-07-21T02:35:22.187" Score="4" Body="&lt;p&gt;While Peter's answer addresses this well by pointing to the mod tools, I'll offer some other data. The good folks over at Charcoal HQ monitor potential spam on the SE network in realtime, and have excellent tools for looking at the history of spam posts. &lt;a href=&quot;https://metasmoke.erwaysoftware.com/search?utf8=%E2%9C%93&amp;amp;title=&amp;amp;body=&amp;amp;username=&amp;amp;why=&amp;amp;site=76&amp;amp;feedback=&amp;amp;autoflagged=&amp;amp;reason=&amp;amp;user_rep_direction=%3E%3D&amp;amp;user_reputation=0&amp;amp;commit=Search&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here is a query for all reported posts on PPCG&lt;/a&gt;. Note that not all of them are spam - some are false positives, and some are NAA/VLQ posts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;According to the post history on Metasmoke, there has been a very small uptick of spam recently - 4 spam posts by 2 different accounts in one day. Other than that, the spam rate has been more or less consistent, so I don't think there's anything to be worried about. The accounts responsible for the spam have been nuked, and the fact that we haven't had any since implies that it was a brief and minor spike, and not an upwards trend.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-07-21T02:35:22.187" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13390" PostTypeId="1" AcceptedAnswerId="13394" CreationDate="2017-07-21T18:53:24.253" Score="6" ViewCount="128" Body="&lt;p&gt;I got suspended a while back, and have changed since then. I don't mind talking about it if people ask, or if it is on-topic to the conversation. However, whenever I talk about &lt;em&gt;my&lt;/em&gt; suspension, I get the feeling that it is banned, similar to talking about other people's suspensions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So are we allowed to talk about &lt;em&gt;our own&lt;/em&gt; suspensions, or does this fall under the aforementioned rule?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2017-07-21T21:01:12.640" Title="Are we allowed to talk about our suspensions?" Tags="|support|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13391" PostTypeId="1" CreationDate="2017-07-21T20:43:25.663" Score="2" ViewCount="94" Body="&lt;p&gt;I'm looking for a big PPCG icon. Where could I get one? The favicon / HNQ icon is too small. Is there something bigger?&lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastActivityDate="2017-07-21T20:43:25.663" Title="Plz send teh iconz: can I get a big ppcg icon?" Tags="|support|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13392" PostTypeId="2" ParentId="13391" CreationDate="2017-07-21T20:43:25.663" Score="7" Body="&lt;p&gt;Here you go:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://cdn.sstatic.net/Sites/codegolf/img/apple-touch-icon.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://cdn.sstatic.net/Sites/codegolf/img/apple-touch-icon.png&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://cdn.sstatic.net/Sites/codegolf/img/apple-touch-icon.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://cdn.sstatic.net/Sites/codegolf/img/apple-touch-icon.png&quot; alt=&quot;https://cdn.sstatic.net/Sites/codegolf/img/apple-touch-icon.png&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bonus: it's transparent.&lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastActivityDate="2017-07-21T20:43:25.663" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13394" PostTypeId="2" ParentId="13390" CreationDate="2017-07-21T21:01:12.640" Score="7" Body="&lt;p&gt;After your suspension is over, assuming that you do not keep doing whatever got you suspended, all is supposed to be forgiven and forgotten.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moderators will (should) never bring up your suspensions in public since this is considered private information.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Non-moderators should refrain from doing this as well, especially while the affected user is still suspended, as it it isn't nice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, if you want to talk about &lt;em&gt;your own suspension&lt;/em&gt;, that's fine. I'm not sure &lt;em&gt;why&lt;/em&gt; you'd want to discuss it publicly, but feel free to do so.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-07-21T21:01:12.640" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13395" PostTypeId="2" ParentId="2140" CreationDate="2017-07-21T21:23:35.107" Score="2" Body="&lt;h2&gt;Solve the Trolley Problem &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/machine-ethics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;machine-ethics&amp;#39;&quot; rel=&quot;tag&quot;&gt;machine-ethics&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Philosophers have long pondered the &lt;a href=&quot;https://en.wikipedia.org/wiki/Trolley_problem&quot; rel=&quot;nofollow noreferrer&quot;&gt;Trolley problem&lt;/a&gt;. Unfortunately, this no human has solved this problem yet. Luckily, as programmers we can use computers to solve the problem for us!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/coK7c.png&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;☹&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/coK7c.png&quot; alt=&quot;&quot; title=&quot;☹&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program will take as input a (finite) directed graph (with at most one edge from &lt;code&gt;x&lt;/code&gt; to &lt;code&gt;y&lt;/code&gt;, for any &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt;), with a designated node, and a nonnegative integer attached to each edge (representing the number of people tied to that track). In addition, every node has at least one exit edge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The trolley starts at the designated node. Each turn, if the trolley is at node &lt;code&gt;x&lt;/code&gt;, the utilitarian selects an edge &lt;code&gt;(x,y)&lt;/code&gt;. The people on that edge die, and trolley is now at edge &lt;code&gt;y&lt;/code&gt;. This process continues forever.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that people can only die once, so if the edge &lt;code&gt;(x,y)&lt;/code&gt; has &lt;code&gt;n&lt;/code&gt; people tied to it, and the trolley runs over them, say, 100 times, it will still only result in &lt;code&gt;n&lt;/code&gt; deaths.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The utilitarian makes his choices in such a way as to minimize the number of people that die (which is guaranteed to be finite, since there are only finite people). Your program will output this number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may take the input graph in any reasonable way you like. For example, you could take it as a matrix, and count the designated node as the one labeled 0. Or you could use something like &lt;code&gt;x1,y1,n1;x2,y2,n2;...&lt;/code&gt;. For example &lt;code&gt;0,a,0;a,b,5;a,c,1;b,b,0;c,c,0&lt;/code&gt; to represent the standard trolley problem (with loops at the end).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Testcases:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;0,a,0;a,b,5;a,c,1;b,b,0;c,c,0&lt;/code&gt; -&gt; 1 (Go from 0 to a, a to c (killing one person), and then keep looping the trolley from c to c).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;0,0,1;0,a,5;a,a,0&lt;/code&gt; -&gt; 1 (Keep going from 0 to 0, running over 1 person for all eternity),&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;0,a,5;0,b,1;a,a,1;b,b,6&lt;/code&gt; -&gt; 6 (0 -&gt; a -&gt; a -&gt; a -&gt; a -&gt; ... (note that the greedy solution of going to b would be incorrect))&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;0,a,1;0,b,5;a,b,1;b,a,1&lt;/code&gt; -&gt; 3 (0 -&gt; a -&gt; b -&gt; a -&gt; b -&gt; ...)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;0,a,1;0,b,1;a,a,0;b,b,0&lt;/code&gt; -&gt; 1 (Note that there are two different options that the utilitarian might take that both kill only one person)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer wins! Good luck.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Notes: There will be no &lt;a href=&quot;http://2static.fjcdn.com/pictures/Sick+loop+de+loops+man_fa2289_5585383.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;sick loop de loops&lt;/a&gt; and &lt;a href=&quot;https://pics.me.me/multi-track-drifting-15209810.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;multitrack drifting&lt;/a&gt; is banned.&lt;/p&gt;&#xA;" OwnerUserId="16842" LastActivityDate="2017-07-21T21:23:35.107" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="13396" PostTypeId="2" ParentId="2140" CreationDate="2017-07-21T22:09:25.623" Score="2" Body="&lt;h1&gt;Levenshtein distance using only SO titles &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Pick 1 or as many titles as you wish from revisions of questions from Stack Overflow. You now have a tuple of all of the characters used in the titles you picked. You may add up to as many newline characters as titles you picked. Using exactly all the elements (characters) in this tuple (you may chose lower or upper versions of each character) write a program or a code snippet that computes the &lt;a href=&quot;https://en.wikipedia.org/wiki/Levenshtein_distance&quot; rel=&quot;nofollow noreferrer&quot;&gt;Levenshtein distance&lt;/a&gt; between two strings.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That's it. Happy title hunting!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Clarifications and rules:&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Revisions&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We define a revision as seen on &lt;code&gt;https://stackoverflow.com/posts/XXX/revisions&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;for a question without any revision (not edited after being posted), the question itself counts as a revision&lt;/li&gt;&#xA;&lt;li&gt;all revisions are eligible, from the initial posted question to the current version of the question&lt;/li&gt;&#xA;&lt;li&gt;the revision must be created &lt;strong&gt;before 10PM 21 July GMT&lt;/strong&gt; (before the time of posting this challenge on the sandbox)&lt;/li&gt;&#xA;&lt;li&gt;only questions from Stack Overflow qualify (no meta, no other site)&lt;/li&gt;&#xA;&lt;li&gt;deleted questions qualify (the only exception: spam questions don't qualify). I realize not everybody has access to deleted questions, but a question can become deleted after you post so I decided to allow it, especial considering the very large number of non-deleted questions: you have where to pick from.&lt;/li&gt;&#xA;&lt;li&gt;you may pick one revision multiple times. You may pick multiple revisions from the same question.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Your tuple of characters&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;For instance you pick these hypothetical titles from valid revisions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;To be?&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;...Or not to be?&lt;/code&gt; you pick this one 3x&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Pls. help me!!&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Then the tuple you have is this (between &lt;code&gt;&quot;&lt;/code&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;            !!..........????bbbbeeeeeehllmnnnoooooooOOOpPrrrsttttttT&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;to which you may add up to 5 new line characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must use all of these characters (nothing less, nothing more) to write your code. In this example your code must contain exactly 12 &lt;code&gt;&lt;/code&gt; (space) characters, 2 &lt;code&gt;!&lt;/code&gt; characters, 10 &lt;code&gt;.&lt;/code&gt; characters, 4 &lt;code&gt;?&lt;/code&gt; characters, 4 &lt;code&gt;b&lt;/code&gt;/&lt;code&gt;B&lt;/code&gt; characters etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Lower/upper case&lt;/strong&gt;: regardless of the character case in the title, you may use any case you want for each. In this example you can use (4 &lt;code&gt;b&lt;/code&gt;) or (3 &lt;code&gt;b&lt;/code&gt; and 1 &lt;code&gt;B&lt;/code&gt;) or (2 &lt;code&gt;b&lt;/code&gt; and 2 &lt;code&gt;B&lt;/code&gt;) or (1 &lt;code&gt;b&lt;/code&gt; and 3 &lt;code&gt;B&lt;/code&gt;) or (4 &lt;code&gt;B&lt;/code&gt;). Upper/lower as defined on &lt;a href=&quot;http://www.fileformat.info&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.fileformat.info&lt;/a&gt; - Unicode data table&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are all the character you must use in this example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+----+-----+&#xA;|    |  12 |&#xA;|  ! |   2 |&#xA;|  . |  10 |&#xA;|  ? |   4 |&#xA;|  b |   4 |&#xA;|  e |   6 |&#xA;|  h |   1 |&#xA;|  l |   2 |&#xA;|  m |   1 |&#xA;|  n |   3 |&#xA;|  o |  10 |&#xA;|  p |   2 |&#xA;|  r |   3 |&#xA;|  s |   1 |&#xA;|  t |   7 |&#xA;| \n | 0-5 |&#xA;+----+-----+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Code&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may write &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet&quot;&gt;a program or a function&lt;/a&gt; and use any of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;standard methods&lt;/a&gt; of input/output. &lt;/li&gt;&#xA;&lt;li&gt;input must be 2 strings&lt;/li&gt;&#xA;&lt;li&gt;you can assume both of the 2 strings are not empty&lt;/li&gt;&#xA;&lt;li&gt;you cannot take other input&lt;/li&gt;&#xA;&lt;li&gt;output must be a number representing the Levenshtein distance between the two strings as defined on &lt;a href=&quot;https://en.wikipedia.org/wiki/Levenshtein_distance&quot; rel=&quot;nofollow noreferrer&quot;&gt;wikipedia&lt;/a&gt;. You may output leading and trailing white spaces (including new lines).&lt;/li&gt;&#xA;&lt;li&gt;you must not output anything else&lt;/li&gt;&#xA;&lt;li&gt;You may use &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2028&quot;&gt;any programming language&lt;/a&gt;, but note that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/&quot;&gt;these loopholes&lt;/a&gt; are forbidden by default&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Score&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest valid answer – measured in bytes – wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Format&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In order to make it easy on everybody, please:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;link the revisions you use&lt;/li&gt;&#xA;&lt;li&gt;show each title&lt;/li&gt;&#xA;&lt;li&gt;show the final tuple of characters&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Meta discussion:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should I encourage/discourage/ban using titles already picked by someone else?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="11400" LastEditorUserId="11400" LastEditDate="2017-07-27T08:09:00.697" LastActivityDate="2017-07-27T08:09:00.697" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13397" PostTypeId="2" ParentId="13348" CreationDate="2017-07-22T01:04:23.267" Score="3" Body="&lt;p&gt;&lt;code&gt;https://meta.codegolf.stackexchange.com&lt;/code&gt; has never worked. Somebody made that edit manually without checking whether it worked. I’ve fixed it.&lt;/p&gt;&#xA;" OwnerUserId="39242" LastActivityDate="2017-07-22T01:04:23.267" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13399" PostTypeId="2" ParentId="2140" CreationDate="2017-07-22T11:45:51.440" Score="2" Body="&lt;h1&gt;An anagram chain &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to create a program, &lt;code&gt;P_0&lt;/code&gt;, that outputs &lt;code&gt;P_1&lt;/code&gt;, that outputs &lt;code&gt;P_2&lt;/code&gt;, that outputs... &lt;code&gt;P_n&lt;/code&gt;, which finally outputs &lt;code&gt;P_0&lt;/code&gt;. Every program in that chain has to be a permutation of every other program, and every program has to be distinct.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if your program (&lt;code&gt;P_0&lt;/code&gt;) was&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abcd&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And that generated another program (&lt;code&gt;P_1&lt;/code&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;badc&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which generated another program (&lt;code&gt;P_2&lt;/code&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;dabc&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which outputted the first program, you would have a anagram chain of length &lt;code&gt;3&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your goal is to make as long a chain as possible, in as short a program as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your final score will be your chain length - in case there's a tie, the program with the shortest bytecount wins. If there's a tie again, the first poster wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Meta:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I need a better title. Any suggestions?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49561" LastActivityDate="2017-07-22T11:45:51.440" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13403" PostTypeId="2" ParentId="2140" CreationDate="2017-07-22T20:13:55.797" Score="-2" Body="&lt;h1&gt;Is it &lt;code&gt;cat&lt;/code&gt;-urday?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://knowyourmeme.com/memes/caturday&quot; rel=&quot;nofollow noreferrer&quot;&gt;Caturday&lt;/a&gt; is one of the oldest memes out there. For this challenge you need to write a program that outputs the input, but only on Saturday.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The catch:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You can acquire the date via UNIX timestamp, or as a formatted date string (local or UTC). &lt;strong&gt;However&lt;/strong&gt;, you can not: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;use day of the week information in a date string&lt;/li&gt;&#xA;&lt;li&gt;directly acquire the day of the week of a date by some other means&lt;/li&gt;&#xA;&lt;li&gt;use Date or Calendar functions, beyond one to simply give you the current date&lt;/li&gt;&#xA;&lt;li&gt;use any external resources  (files, Internet)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Don't forget leap years!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Does this question work as is? Should I make anything clearer?&lt;/p&gt;&#xA;" OwnerUserId="46313" LastEditorUserId="46313" LastEditDate="2017-07-22T20:28:21.487" LastActivityDate="2017-07-22T20:28:21.487" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13410" PostTypeId="1" CreationDate="2017-07-23T16:25:35.133" Score="1" ViewCount="68" Body="&lt;p&gt;Recently I had an interesting interaction on one of my questions.  A user posted &lt;a href=&quot;https://codegolf.stackexchange.com/a/135202/56656&quot;&gt;this answer&lt;/a&gt; in C++.  My question requires a function on the positive numbers that has some properties, the user's answer essentially implemented the function &lt;code&gt;add 1&lt;/code&gt;, which does not satisfy these properties on the positive integers, however this function &lt;em&gt;does&lt;/em&gt; satisfy these properties on a cyclic group, which C++'s &lt;code&gt;unsigned&lt;/code&gt; type is (this actually not define as such in the C++ specification, however almost all implementations do it this way).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Needless to say I have asked the user to delete the answer and the obliged.  However this brings me some concern.  In order to &quot;fix&quot; their answer it seems that this user would have to implement their own dynamically allocated integer class, which is a big pain to do (believe me I've done it before).  It feels to me as if this is overkill, we often allow answers that will occasionally calculate an incorrect, as long as the &quot;algorithm&quot; is correct.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What should I do in this case?  Is there a way that answers in languages like C++ can reasonably compete on these types of challenges without &quot;cheating&quot;?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-07-23T16:49:43.070" Title="On type restrictions" Tags="|discussion|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13411" PostTypeId="2" ParentId="13410" CreationDate="2017-07-23T16:49:43.070" Score="2" Body="&lt;h1&gt;Specify mathematical or computational integers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For this question, your instinct was correct: you asked about integers in the mathematical sense, not the 32-bit unsigned integers used by that particular answer. Although this may seem to favor languages with an integral type of unbound size, this is a language-agnostic issue, as other languages may have integer representations with other limitations. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/a/132901/69054&quot;&gt;Erik the Outgolfer's answer&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/132898/find-the-second-zero&quot;&gt;a recent question&lt;/a&gt; I asked about 32-bit integers did not originally work (see &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/132901/1&quot;&gt;the original version&lt;/a&gt;) because Jelly's representation of integers is unbounded.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Allowing HolyBlackCat's answer would have been &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8245/69054&quot;&gt;Abusing C++'s native number type to trivialize the problem&lt;/a&gt;. If the algorithm they had used would have worked in theory for any positive integer, it would have been an acceptable answer, &lt;em&gt;regardless of the integer representation's ability to accept integers of large magnitude&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="69054" LastActivityDate="2017-07-23T16:49:43.070" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13415" PostTypeId="2" ParentId="2140" CreationDate="2017-07-23T21:50:09.320" Score="1" Body="&lt;h1&gt;KotH: Atom Bomb Chess&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(Draft. I'll flesh it out some more later. It will probably be implemented in JavaScript or maybe C++.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot;&gt;chess&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Atom Bomb Chess is a variant of chess played much the same as regular chess. The only differences are:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The game ends when one or both players have no pieces, or if 50 moves have been made without a piece being captured.&lt;/li&gt;&#xA;&lt;li&gt;When a piece is captured, all pieces a king's move away are also &quot;captured&quot;, and the piece doing the capturing is also &quot;captured&quot;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;For example, let's look at a 4x4:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;pbbr&#xA;....&#xA;....&#xA;RBBP&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;r&lt;/code&gt;/&lt;code&gt;R&lt;/code&gt; is a rook, &lt;code&gt;b&lt;/code&gt;/&lt;code&gt;B&lt;/code&gt; is a bishop, and &lt;code&gt;p&lt;/code&gt;/&lt;code&gt;P&lt;/code&gt; is a pawn. Suppose &lt;code&gt;R&lt;/code&gt; moves forward 3 spaces. Then, it captures the &lt;code&gt;p&lt;/code&gt; and &quot;explodes&quot;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;..br&#xA;....&#xA;....&#xA;.BBP&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The idea of this KotH is to make a program that plays Atom Bomb Chess. I will have a few programs to test your submissions against.&lt;/p&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2017-07-23T21:50:09.320" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="13416" PostTypeId="2" ParentId="2140" CreationDate="2017-07-23T22:30:11.660" Score="-1" Body="&lt;h1&gt;What's that character? (Part 1) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Recently I ran a command on my laptop that returned a bunch of characters - some printable, some non-printable. I'm having trouble figuring out what those characters are, so I could use some help. Unfortunately, I'm running low on disk space, so you'll have to write me the shortest program you can that I can run.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a list of ASCII characters, return their names as written on &lt;a href=&quot;http://www.asciitable.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;www.asciitable.com&lt;/a&gt;, my go-to site for looking up character points.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You may take a string, a list of characters, or a list of ASCII code points (e.g. 'a' -&gt; 97).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may optionally take the length of the string/list as well. Note that for C, you must take this parameter, since the string could contain NUL bytes, so &lt;code&gt;strlen&lt;/code&gt; won't work here.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Output is flexible as usual; you may print or return from a function as you see fit. You should output a list of strings.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The Table&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&#xA;0 NUL&#xA;1 SOH&#xA;2 STX&#xA;3 ETX&#xA;4 EOT&#xA;5 ENQ&#xA;6 ACK&#xA;7 BEL&#xA;8 BS&#xA;9 TAB&#xA;10 LF&#xA;11 VT&#xA;12 FF&#xA;13 CR&#xA;14 SO&#xA;15 SI&#xA;16 DLE&#xA;17 DC1&#xA;18 DC2&#xA;19 DC3&#xA;20 DC4&#xA;21 NAK&#xA;22 SYN&#xA;23 ETB&#xA;24 CAN&#xA;25 EM&#xA;26 SUB&#xA;27 ESC&#xA;28 FS&#xA;29 GS&#xA;30 RS&#xA;31 US&#xA;32 Space&#xA;33 !&#xA;34 &quot;&#xA;35 #&#xA;36 $&#xA;37 %&#xA;38 &amp;&#xA;39 '&#xA;40 (&#xA;41 )&#xA;42 *&#xA;43 +&#xA;44 ,&#xA;45 -&#xA;46 .&#xA;47 /&#xA;48 0&#xA;49 1&#xA;50 2&#xA;51 3&#xA;52 4&#xA;53 5&#xA;54 6&#xA;55 7&#xA;56 8&#xA;57 9&#xA;58 :&#xA;59 ;&#xA;60 &#xA;63 ?&#xA;64 @&#xA;65 A&#xA;66 B&#xA;67 C&#xA;68 D&#xA;69 E&#xA;70 F&#xA;71 G&#xA;72 H&#xA;73 I&#xA;74 J&#xA;75 K&#xA;76 L&#xA;77 M&#xA;78 N&#xA;79 O&#xA;80 P&#xA;81 Q&#xA;82 R&#xA;83 S&#xA;84 T&#xA;85 U&#xA;86 V&#xA;87 W&#xA;88 X&#xA;89 Y&#xA;90 Z&#xA;91 [&#xA;92 \&#xA;93 ]&#xA;94 ^&#xA;95 _&#xA;96 `&#xA;97 a&#xA;98 b&#xA;99 c&#xA;100 d&#xA;101 e&#xA;102 f&#xA;103 g&#xA;104 h&#xA;105 i&#xA;106 j&#xA;107 k&#xA;108 l&#xA;109 m&#xA;110 n&#xA;111 o&#xA;112 p&#xA;113 q&#xA;114 r&#xA;115 s&#xA;116 t&#xA;117 u&#xA;118 v&#xA;119 w&#xA;120 x&#xA;121 y&#xA;122 z&#xA;123 {&#xA;124 |&#xA;125 }&#xA;126 ~&#xA;127 DEL&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&#xA;[0, 97, 7, 22] -&gt; [NUL, a, BEL, SYN]&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;More to come...&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Would it be more interesting to use &lt;a href=&quot;http://www.utf8-chartable.de/&quot; rel=&quot;nofollow noreferrer&quot;&gt;the UTF-8 names&lt;/a&gt; for the printable characters (0x20 - 0x7E), and the ASCII names for the control characters?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="69054" LastEditorUserId="69054" LastEditDate="2017-07-24T01:39:30.343" LastActivityDate="2017-07-24T01:39:30.343" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13419" PostTypeId="1" CreationDate="2017-07-24T11:46:38.677" Score="4" ViewCount="172" Body="&lt;p&gt;So, the question here is, if we find a challenge that is a duplicate, but the challenge it is a duplicate of has been closed as unclear or off-topic, should we still close the new challenge as a duplicate?  For example, my question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/135233/secret-message-part-1-elements&quot;&gt;here&lt;/a&gt;, was closed as a dupe of a question that was closed as unclear.  Another challenge in the same area was also closed as a dupe of that question.  So, where do we go to answer a question like this?  They've all been closed, and we can't make a new one because it will be closed as a dupe.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't believe we have a meta consensus on this yet, so it would be great if we could achieve one.  Please answer and vote according to your opinion, as always.  &lt;/p&gt;&#xA;" OwnerUserId="69331" LastActivityDate="2017-08-04T15:31:42.450" Title="Should we close challenges as dupes of closed challenges?" Tags="|discussion|duplicates|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13420" PostTypeId="2" ParentId="13419" CreationDate="2017-07-24T12:02:28.290" Score="7" Body="&lt;p&gt;I think this is a special case of a more general question which has come up in the past week &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/13361/194&quot;&gt;in a different guise&lt;/a&gt;. I will therefore address the more general question:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;What should I do with a question which is a dupe (or maybe only a borderline dupe) of an old question which has problems?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The answer (which I thought was already a well established consensus, but which I can't find):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is more than one possible approach (close the old question and post a new one; close the old question, post a new one, and merge the old into the new; improve the old question), but there isn't one which is automatically the best. Therefore you should start a meta discussion to discuss which is the best approach &lt;strong&gt;in the specific case&lt;/strong&gt;. Since this situation would normally be detected in the sandbox*, the question should be left in the sandbox for the duration of the discussion. If it's a more proactive approach, it may be reasonable to post a sandbox question with a proposed revision of the old question and to cross-reference it with the &quot;What to do?&quot; discussion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;* And would have been in this case if you'd followed the advice to sandbox questions for at least 72 hours.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-07-24T12:02:28.290" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13421" PostTypeId="1" CreationDate="2017-07-24T14:28:32.330" Score="1" ViewCount="229" Body="&lt;p&gt;In my &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13379/58826&quot;&gt;new sandboxed challenge&lt;/a&gt;, I'm looking to ban crypto / one-way functions that make it impossible to get the input from the output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I started out requiring only using functions that are &lt;a href=&quot;https://en.wikipedia.org/wiki/Bijection&quot; rel=&quot;nofollow noreferrer&quot;&gt;bijectve&lt;/a&gt;, but that bans functions that &quot;gets a character from a particular index of a string&quot;, as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/13379#comment47687_13379&quot;&gt;pointed out by aschepler&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would like to ban crypto / one-way functions that make the challenge not fun, while allowing functions that get a char from an index in a string, etc. How can I do this? &lt;strong&gt;I'd prefer something that's worked in the past.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastEditorDisplayName="user58826" LastEditDate="2017-07-24T14:37:07.030" LastActivityDate="2017-07-24T14:37:07.030" Title="How to prevent crypto while allowing string idx, etc in CnR" Tags="|discussion|cops-and-robbers|" AnswerCount="0" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13423" PostTypeId="1" CreationDate="2017-07-24T14:56:37.800" Score="14" ViewCount="177" Body="&lt;p&gt;The creation of words from chemical element symbols seems to be a popular pastime, judging by the number of questions that are asked about it. Most of them are closed as duplicates:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/6284/194&quot;&gt;Words from periodic table of elements&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/34641/194&quot;&gt;Checking periodic table words&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/58476/194&quot;&gt;Find the Chemistry of a name&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/64858/194&quot;&gt;Chemical sentences! Encrypting&lt;/a&gt; (and the related  &lt;a href=&quot;https://codegolf.stackexchange.com/q/64862/194&quot;&gt;Chemical sentences! Decrypting&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/83630/194&quot;&gt;Play scrabble with the periodic table&lt;/a&gt; (with additional non-repetition constraint)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/112608/194&quot;&gt;[Br]eaking Code Golf [Ba]d&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/135233/194&quot;&gt;Secret Message Part 1, Elements&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The most frequent dupe target is the first question. However, for reasons I don't understand it was closed as unclear in March. The last question in the list was posted yesterday.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Which question(s) should we (keep) open, what improvements (if any) are needed, and if the first one is to be kept closed and another chosen as the canonical question then what should be done about its answers?&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-07-26T11:21:48.400" Title="Canonical words from chemical element symbols question" Tags="|discussion|specific-question|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13424" PostTypeId="2" ParentId="2140" CreationDate="2017-07-24T17:52:30.230" Score="1" Body="&lt;h1&gt;Who Won the Chess Game?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Bear with me, this is incredibly bare-bones at the moment; I'll work on this over-time, just wanted to gauge interest on the over-all idea.&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Given an input list of moves &lt;code&gt;l&lt;/code&gt;, output who won the chess game given that white always goes first, alternating moves from there. Using the following convention for naming the chess squares:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Am6GD.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Am6GD.gif&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Where the pieces are:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;rnbqkbnr&#xA;pppppppp&#xA;........&#xA;........&#xA;........&#xA;........&#xA;PPPPPPPP&#xA;RNBQKBNR&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The first assumption you will make is that the list of moves passed is a VALID chess game, to completion. The following would be an example input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[A2,A4],[A7,A6],...]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The first two moves given would result in:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;rnbqkbnr&#xA;pppppppp&#xA;........&#xA;........&#xA;P.......&#xA;........&#xA;.PPPPPPP&#xA;RNBQKBNR&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Which is white's first move, followed by black's move:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;rnbqkbnr&#xA;.ppppppp&#xA;p.......&#xA;........&#xA;P.......&#xA;........&#xA;.PPPPPPP&#xA;RNBQKBNR&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Then, you would continue parsing moves until a king disappears. Whichever king is left should be declared the winner.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Waiting to Gauge Interest Before Wasting Time on Full Testcase&lt;/h1&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-24T17:52:30.230" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13426" PostTypeId="1" CreationDate="2017-07-24T19:04:28.443" Score="1" ViewCount="98" Body="&lt;p&gt;For those who can see deleted posts, the original post can be found here: &lt;a href=&quot;https://codegolf.stackexchange.com/q/135438/68942&quot;&gt;https://codegolf.stackexchange.com/q/135438/68942&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/6jRu6.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/6jRu6.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Essentially, OP gives a piece of code that doesn't work because it's using &lt;code&gt;i = i++&lt;/code&gt; to increment which doesn't work.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is a bit of a dispute about whether or not this question is on-topic. It begins with &quot;Solve this code&quot;, which phrases it like a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt;. However, it appears to look more like a question where OP is asking for help as to why the code isn't working.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the same time, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/12188/when-is-a-giraffe-not-a-giraffe&quot;&gt;this question&lt;/a&gt; is similar and an opinion has been expressed that these two questions are either both on-topic or both off-topic because they are a similar class of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As it stands, the question has +0/-8 and has been deleted very quickly. What does the community think of this question? Undelete+reopen, or leave it closed?&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="20260" LastEditDate="2017-07-24T19:25:12.343" LastActivityDate="2017-07-24T19:49:43.273" Title="Dispute over whether a question is on-topic" Tags="|discussion|" AnswerCount="3" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="13427" PostTypeId="2" ParentId="13426" CreationDate="2017-07-24T19:15:50.620" Score="-1" Body="&lt;h1&gt;It is off-topic&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;To quote the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzles&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzles&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzles&lt;/a&gt; tag info:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A programming puzzle includes a goal, a partially completed program, and rules outlining how the program can be modified. The program is specifically designed to make achieving the goal difficult. An answer to a programming puzzle takes the program and modifies it only in ways specified in the rules, so that the goal is achieved.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;To cite specific sections of this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;includes a goal&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The question in question gives some code that keeps printing &lt;code&gt;1&lt;/code&gt; and asks why that is; however, it doesn't specify what should happen.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;a partially completed program&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is a completed program, it just doesn't work.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;rules outlining how the program can be modified&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Nope.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;specifically designed to make achieving the goal difficult&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Assuming there is a goal, that doesn't appear to be the case.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;However&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I believe that deleting the question so quickly hasn't solved anything and it's prevented the Original Poster from replying to the comments, so we don't know if it was meant to be a puzzle, just badly worded, because the question was deleted too quickly.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2017-07-24T19:15:50.620" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13428" PostTypeId="2" ParentId="13426" CreationDate="2017-07-24T19:20:14.633" Score="6" Body="&lt;h2&gt;Assume the poster wants coding help&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;People wanting coding online help outnumber those looking to pose a programming challenge by at least 100x. Giving such questions the benefit of the doubt would result in swarms of &lt;a href=&quot;https://meta.stackexchange.com/q/19665/275609&quot;&gt;help vampires&lt;/a&gt; descending on PPCG, claiming that their question is totally a golf challenge or puzzle and they totally know the solution and just want to see how others solve it. We already see this with attempts to cheat at programming competitions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, it's important to close and delete or lock such questions ASAP before a well-meaning soul posts an answer or comment that gives the help vampire what they want, justifying their whole goal in posting. If it's actually a good-faith programming challenge, the poster can edit it to clarify this.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2017-07-24T19:49:43.273" LastActivityDate="2017-07-24T19:49:43.273" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="13429" PostTypeId="2" ParentId="13426" CreationDate="2017-07-24T19:24:37.267" Score="3" Body="&lt;h1&gt;The two are similar, but essentially different&lt;/h1&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/12188/when-is-a-giraffe-not-a-giraffe&quot;&gt;older challenge you linked&lt;/a&gt; had a clear specification that it was a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt;, and thus is not off-topic. On the other hand, the newly-deleted challenge was confusing. It was not clear whether it was a typical off-topic &amp;quot;plz debug my program / plz send teh codes&amp;quot; question or a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt;. Therefore, I would have casted my vote to close as either &amp;quot;off-topic&amp;quot; or &amp;quot;unclear what you are asking&amp;quot; (at least until it was fixed).&lt;/p&gt;&#xA;&lt;h2&gt;But&lt;/h2&gt;&#xA;&lt;p&gt;The instant deletion was not beneficial. We might have waited until the OP responded, and either reopen it or explain the situation and the specific reasons why we consider it &lt;em&gt;off-topic&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-24T19:24:37.267" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13431" PostTypeId="2" ParentId="2140" CreationDate="2017-07-24T20:02:41.487" Score="1" Body="&lt;h2&gt;Nested list unpacking &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In Python 3.5+, the &lt;code&gt;*&lt;/code&gt; operator can  &lt;a href=&quot;https://www.python.org/dev/peps/pep-0448/&quot; rel=&quot;nofollow noreferrer&quot;&gt;unpack a list within a list&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;[1,*[2,3,4],5] == [1,2,3,4,5]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The unpacked elements are placed directly into the outer list without increasing the list depth. Note that this is different from the nested three-element list&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;[1,[2,3,4],5]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your goal is to simplify a nested list expression by resolving all instances of unpacking. So, the output will simply be a nested list without any &lt;code&gt;*&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Specifically, the input will be an expression that consists of &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A non-empty list of expressions &lt;code&gt;[..]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;An non-empty unpacked list of expressions &lt;code&gt;*[..]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A digit 1 through 9&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The outermost layer will always be a non-empty list. The output is such an expression without any unpacking.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; A string of characters &lt;code&gt;[],*123456789&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt; Its unpacked analogue. This can be a string or list structure.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge can be done in any language. Python and other languages with the same unpacking format may not use &lt;code&gt;eval&lt;/code&gt; or &lt;code&gt;exec&lt;/code&gt; or equivalents.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TODO: I/O details, test cases&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2017-07-24T20:02:41.487" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13435" PostTypeId="2" ParentId="2140" CreationDate="2017-07-25T11:27:36.883" Score="4" Body="&lt;h1&gt;Invisible Ink, Easy &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In the physical world, invisible ink usually becomes invisible when it dries, and is then is readable if it is exposed to heat or chemicals of some kind. The invisible ink in this challenge will be readable when exposed to highlighting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Create a full program or function that takes in text from the console (using a prompt) and outputs it the console so it cannot be seen unless highlighted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/LoWYQ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/LoWYQ.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/vufZz.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/vufZz.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Notes:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Assume that the console is a solid color (black, white, green, etc.).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="68374" LastActivityDate="2017-07-25T11:27:36.883" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13437" PostTypeId="1" CreationDate="2017-07-25T12:01:37.517" Score="27" ViewCount="364" Body="&lt;p&gt;In case you didn't know, whenever you post the &lt;strong&gt;exact same&lt;/strong&gt; answer as was already posted, it gets converted to a comment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I had no idea before I posted a crack on a cops-and-robbers post that someone had posted 5s before.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I didn't know what happened before someone asked me why I commented on the question. I was confused for a bit until I figured it out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While this may make sense for a Q&amp;amp;A site, it doesn't make sense for PPCG. 99% of the time, 2 people had the same idea at the same time.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Here's what I'm proposing:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When you post a duplicate answer, this message appears:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Your answer is an exact duplicate of &lt;a href=&quot;http://localhost/dup/answer/target&quot; rel=&quot;nofollow noreferrer&quot;&gt;another answer&lt;/a&gt;. Please edit your answer if you would like to post it.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If this gets enough votes, I will post this to mother meta.&lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastEditorUserId="68942" LastEditDate="2021-06-03T04:46:45.290" LastActivityDate="2021-06-03T04:47:50.683" Title="Stop converting duplicate answers to comments" Tags="|feature-request|status-completed|answers|comments|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13440" PostTypeId="2" ParentId="2140" CreationDate="2017-07-25T18:42:52.053" Score="1" Body="&lt;h2&gt;Title: Visualizing Euclid's Algorithm&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;Problem&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We wish to visualize Euclid's algorithm for computing the greatest common divisor of two numbers as a 2-dimensional tiling, such as this one:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/5x4q4.png&quot; alt=&quot;euclid&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This &lt;a href=&quot;https://www.geogebra.org/m/JstAZYHG&quot; rel=&quot;nofollow noreferrer&quot;&gt;interactive version&lt;/a&gt; may also be helpful in understanding the visualization.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Two positive integers &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt;, where &lt;code&gt;a &amp;gt; b&lt;/code&gt;.  You may take them in any order and in any convenient form: a list, two function args, etc.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An ascii version of the above visualization shown above.  This is best illustrated with a few examples:&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;input = 20, 8&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.....................&#xA;.       .       .   .&#xA;.       .       .   .&#xA;.       .       .   .&#xA;.       .       .....&#xA;.       .       .   .&#xA;.       .       .   .&#xA;.       .       .   .&#xA;.....................&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;8 goes into 20 2 times, so we have two 8x8 squares, and remainder of 4 (20 - 8*2 = 4).  4 goes into 8 2 times with no remainder, so the remaining rectangle is broken into to 2 4x4 squares and we're done.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;input = 5, 3&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;......&#xA;.  ...&#xA;.  . .&#xA;......&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note: There is an implied connection between any two &lt;em&gt;adjacent&lt;/em&gt; dots, so that the above ascii should be interpreted as follows:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/zFWTP.png&quot; alt=&quot;connected nodes&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;input = 7, 3&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;........&#xA;.  .  ..&#xA;.  .  ..&#xA;........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;flexibility&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You may choose whichever border characters are prettiest to you, or use combinations of different characters.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.....................   *********************   +-------+-------+---+&#xA;.       .       .   .   *       *       *   *   |       |       |   |&#xA;.       .       .   .   *       *       *   *   |       |       |   |&#xA;.       .       .   .   *       *       *   *   |       |       |   |&#xA;.       .       .....   *       *       *****   |       |       +---+&#xA;.       .       .   .   *       *       *   *   |       |       |   |&#xA;.       .       .   .   *       *       *   *   |       |       |   |&#xA;.       .       .   .   *       *       *   *   |       |       |   |&#xA;.....................   *********************   +-------+-------+---+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Rotations are also allowed: Any of the above may be rotated 90, -90, or 180 degrees.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, standard loophole rules, etc.&lt;/p&gt;&#xA;" OwnerUserId="15469" LastActivityDate="2017-07-25T18:42:52.053" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13443" PostTypeId="2" ParentId="2140" CreationDate="2017-07-25T22:26:46.810" Score="1" Body="&lt;blockquote&gt;&#xA;&lt;h3&gt;&lt;em&gt;NB: work in progress&lt;/em&gt;&lt;/h3&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Convert MADBACE to DECIMAL&lt;/h1&gt;&#xA;&lt;p&gt;MADBACE is a mixed Roman-hexdecimal system. Hexadecimal digits (0-F) take their normal positional values, while Roman numerals (IVXLCDM) have their normal values (1 5 10 50 100 500 1000). The main parts of the challenge is to determine when to subtract and when C and D are Roman versus hexadecimal.&lt;/p&gt;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;C&lt;/code&gt; and &lt;code&gt;D&lt;/code&gt; will be Roman if possible.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There can never be more than one subtractive symbol to the left of any symbol.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A subtractive symbol must be less than half the symbol it subtracts from&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;&lt;code&gt;CM&lt;/code&gt; → &lt;code&gt;900&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;MC&lt;/code&gt; → &lt;code&gt;1100&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;MD&lt;/code&gt; → &lt;code&gt;1500&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;DM&lt;/code&gt; → &lt;code&gt;792&lt;/code&gt; 1000-13×16&lt;sup&gt;1&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;LD&lt;/code&gt; → &lt;code&gt;450&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;CD&lt;/code&gt; → &lt;code&gt;400&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;XD&lt;/code&gt; → &lt;code&gt;40&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;ID&lt;/code&gt; → &lt;code&gt;49&lt;/code&gt; 13×16&lt;sup&gt;0&lt;/sup&gt;-1&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;3C&lt;/code&gt; → &lt;code&gt;52&lt;/code&gt; 100-3×16&lt;sup&gt;1&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;4C&lt;/code&gt; → &lt;code&gt;76&lt;/code&gt; 4×16&lt;sup&gt;1&lt;/sup&gt;+12×16&lt;sup&gt;0&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;MADBACE&lt;/code&gt; → &lt;code&gt;701590&lt;/code&gt; (10×16&lt;sup&gt;5&lt;/sup&gt;-1000)+(11×16&lt;sup&gt;3&lt;/sup&gt;-500)+10×16&lt;sup&gt;2&lt;/sup&gt;+100+14×16&lt;sup&gt;0&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;DECIMAL&lt;/code&gt; → &lt;code&gt;233571513&lt;/code&gt; 13×16&lt;sup&gt;6&lt;/sup&gt;+14×16&lt;sup&gt;5&lt;/sup&gt;+12×16&lt;sup&gt;4&lt;/sup&gt;+(1000-1)+10×16&lt;sup&gt;1&lt;/sup&gt;+50&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base-conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; rel=&quot;tag&quot;&gt;base-conversion&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/roman-numerals&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;roman-numerals&amp;#39;&quot; rel=&quot;tag&quot;&gt;roman-numerals&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hexadecimal&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hexadecimal&amp;#39;&quot; rel=&quot;tag&quot;&gt;hexadecimal&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-25T22:26:46.810" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13445" PostTypeId="1" CreationDate="2017-07-26T02:29:13.697" Score="11" ViewCount="340" Body="&lt;p&gt;So recently, a new user asked a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/135784/how-do-you-guys-get-to-know-these-strange-programming-languages&quot;&gt;well-meaning question&lt;/a&gt;, that was along the lines of &quot;How did you learn all these things and at what point in your life/career did you make the decision to learn a golfing language.&quot; Although I don't think this precise wording fits on meta, it did strike me that we don't really have a single knowledge base of languages anywhere on meta/ppcg (besides the language showcase, which was &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10656/making-an-exception-for-the-showcase-of-languages&quot;&gt;allowed to stay open&lt;/a&gt;, but it was also determined that a new solution still needs to be found). Therefore, I'd propose coalescing the other questions about language usage and language scoring into a single wiki-esque question (&lt;a href=&quot;https://gist.github.com/SocraticPhoenix/35dc3ac68aac580b23a6fea3593db785&quot; rel=&quot;nofollow noreferrer&quot;&gt;very rough draft here&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So... thoughts? The way I see it, the proposed knowledge-base would serve as a sort of it intro point into PPCG, providing easy access to learning resources. In addition, the question itself &lt;em&gt;could&lt;/em&gt; serve as a general welcome to PPCG, but probably not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We do already have a few &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/tagged/faq&quot;&gt;FAQs&lt;/a&gt; and introductory questions such as the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10145/how-to-count-bytes-faq&quot;&gt;scoring faq&lt;/a&gt;, the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44680/showcase-of-languages&quot;&gt;language showcase&lt;/a&gt; and the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1213/installation-and-testing-instructions-for-specific-programming-languages&quot;&gt;testing instructions thingy&lt;/a&gt;, and the idea would be to either link to those answers and/or include the decisions made in those answers in the answers to the proposed knowledge repository.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some options I've thought of (but will refrain from posting as answers - feel free to post/polish these if you want):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Don't make the proposed question and rely on pre-existing meta posts&lt;/li&gt;&#xA;&lt;li&gt;Make the knowledge base, but have it primarily focus on learning &amp;amp; discovering the many languages of PPCG, and perhaps link to a main language page, interpreter, and any potential &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; page&lt;/li&gt;&#xA;&lt;li&gt;Include as much detail (without going beyond introduction) as possible in each answer, as (roughly) described in &lt;a href=&quot;https://gist.github.com/SocraticPhoenix/35dc3ac68aac580b23a6fea3593db785&quot; rel=&quot;nofollow noreferrer&quot;&gt;this very rough draft&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;To sum up, should we have an introductory meta/ppcg post that lists languages, and resources for those languages, or should we rely on pre-existing posts and the all-powerful &lt;a href=&quot;https://esolangs.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolangs wiki&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="56085" LastEditorUserId="56085" LastEditDate="2017-07-26T10:51:53.607" LastActivityDate="2017-08-07T16:25:16.607" Title="Do we need an introductory knowledge base? / Do we need a new language showcase?" Tags="|discussion|" AnswerCount="3" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13446" PostTypeId="2" ParentId="13445" CreationDate="2017-07-26T08:20:53.263" Score="1" Body="&lt;h1&gt;We already do, and it's the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44680/showcase-of-languages&quot;&gt;2nd most upvoted question&lt;/a&gt; on the site&lt;/h1&gt;&#xA;&lt;h3&gt;But it has room for improvement&lt;/h3&gt;&#xA;&lt;p&gt;I think the real question to ask here is how can we improve this question, and it's answers, as well as how we can make this question more accessible and visible to newcomers.&lt;/p&gt;&#xA;&lt;p&gt;At the very least I think there should be an answer for every language on TIO, and we should probably come up with a more well-rounded format for answers, &lt;s&gt;as well as perhaps CWing every answer.&lt;/s&gt; Edit: This is already the case&lt;/p&gt;&#xA;&lt;p&gt;The stack snippet used on that question also needs to be improved, currently it simply hardcodes the answers. We have stack snippets around on PPCG these days that can not only fetch all answers, but even display &lt;a href=&quot;https://codegolf.stackexchange.com/questions/133754/one-oeis-after-another&quot;&gt;challenge specific info&lt;/a&gt; related to the answers.&lt;/p&gt;&#xA;&lt;p&gt;Edit: I didn't notice you'd already mentioned the language showcase, as you linked specifically to the Cheddar answer, so the link didn't display as visited for me. Regardless I believe my point still stands.&lt;/p&gt;&#xA;" OwnerUserId="44998" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-26T11:25:45.767" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13447" PostTypeId="2" ParentId="13423" CreationDate="2017-07-26T11:21:48.400" Score="3" Body="&lt;p&gt;The original question (&lt;a href=&quot;https://codegolf.stackexchange.com/q/6284/194&quot;&gt;Words from periodic table of elements&lt;/a&gt;) is perfectly clear* and has five answers. It should be reopened as the canonical question and &lt;a href=&quot;https://codegolf.stackexchange.com/q/135233/194&quot;&gt;Secret Message Part 1, Elements&lt;/a&gt; closed as a dupe of it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;* &lt;em&gt;Anyone who disagrees: you may, of course, downvote this answer, but please also write an answer yourself explaining why you think it's unclear.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-07-26T11:21:48.400" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13448" PostTypeId="2" ParentId="13445" CreationDate="2017-07-26T11:54:13.867" Score="1" Body="&lt;h1&gt;We should not do this.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We have the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; tag and the &lt;code&gt;Tips for golfing in &amp;lt;My Language Here&amp;gt;&lt;/code&gt; topics to deal with this. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;We are part of a web-community centered around a Q&amp;amp;A format (although PPCG takes a very specific approach to that) and I believe we should definitely be able to answer questions about how to learn a language. However, the question &quot;How do you guys know all these weird languages&quot; is too broad. Instead, the asker should focus on a particular language and ask for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; for that language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Showcase-thread shows that putting all this information in one thread is not manageable. Separating the information per language in one (or more) question(s) each conforms with the site's format better, I believe.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And if the existing Q&amp;amp;A in the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; tag is not specific enough, or doesn't provide much in the way of a learning entry, perhaps questions like &lt;code&gt;Tips wanted: How do I accomplish &amp;lt;this task&amp;gt; in &amp;lt;esolang&amp;gt;&lt;/code&gt; should be considered on-topic in the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; tag.&lt;/p&gt;&#xA;" OwnerUserId="44874" LastActivityDate="2017-07-26T11:54:13.867" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13449" PostTypeId="2" ParentId="13445" CreationDate="2017-07-26T11:58:46.873" Score="11" Body="&lt;p&gt;Leaving aside all other points and focusing on one sub-question:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Therefore, I'd propose coalescing the other questions about ... language scoring into a single wiki-esque question&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;where the proposed text includes&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A description of the standard scoring method for the language&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This has been &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/tagged/scoring&quot;&gt;done to death on meta&lt;/a&gt; over the past couple of months.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The length in bytes of a program is the number of bytes in its source file. End of. We do &lt;em&gt;not&lt;/em&gt; need the complication of per-language exceptions. We do &lt;em&gt;not&lt;/em&gt; need any kind of template or question which induces people to believe that per-language exceptions are normal.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="34718" LastEditDate="2017-08-07T16:25:16.607" LastActivityDate="2017-08-07T16:25:16.607" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13451" PostTypeId="1" CreationDate="2017-07-26T14:45:55.860" Score="0" ViewCount="45" Body="&lt;p&gt;I'm curious if anyone can calculate the maximum possible number of &quot;living&quot; cells on a given grid size for Conway's Game Of Life.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would have no way of knowing how to define winning criteria or develop test cases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I saw something about &quot;the sandbox&quot;, but can't find any details.&#xA;Any suggestions or should I just forget about it? I don't even care if someone takes the idea and posts it right now. :)&lt;/p&gt;&#xA;" OwnerUserId="49170" LastActivityDate="2017-07-26T14:45:55.860" Title="I want to pose a puzzle, but I don't really know enough to make it as detailed as it needs to be" Tags="|discussion|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13452" PostTypeId="2" ParentId="2140" CreationDate="2017-07-26T15:14:36.723" Score="1" Body="&lt;p&gt;&lt;strong&gt;Calculate the maximum possible number of &quot;living&quot; cells on a given grid size for Conway's Game Of Life.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.wikiwand.com/en/Conway%27s_Game_of_Life&quot; rel=&quot;nofollow noreferrer&quot;&gt;Conway's Game Of Life&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Game Rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Any live cell with fewer than two live neighbours dies, as if caused by underpopulation. &lt;/li&gt;&#xA;&lt;li&gt;Any live cell with two or three live neighbours lives on to the next generation. &lt;/li&gt;&#xA;&lt;li&gt;Any live cell with more than three live neighbours dies, as if by overpopulation. &lt;/li&gt;&#xA;&lt;li&gt;Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt; &#xA;For a given grid size (ex 5x5) is it possible to calculate the maximum potential living cells after at least 5 generations with any given starting pattern?&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; O O X O O&#xA; O O X O O&#xA; X X X X X&#xA; O O X O O&#xA; O O X O O&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In the above example, there are 16 living cells.  I am not proposing that this is the maximum, just providing a starting point.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The reason for the 5th generation requirement is because the first generation could technically be 25 (100%) I suppose.&lt;/p&gt;&#xA;" OwnerUserId="49170" LastActivityDate="2017-07-26T15:14:36.723" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13453" PostTypeId="1" CreationDate="2017-07-26T15:55:44.087" Score="7" ViewCount="256" Body="&lt;p&gt;I've had two challenge ideas floating around in my head for a while. I'll spare the details but as a general overview:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first is a challenge that should, in principle, be fun but in practice it is so easy for cops to make solutions that are virtually impossible to crack that it couldn't be fun in practice.  Similar to how it is quite easy to make a riddle that no one can crack, but hard riddles are not good.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The other is not really even a cops and robbers question, but would involve collecting OEIS sequences (and some other information) submitted by users and then having a competition based on the submitted sequences.  There can't rally be a winning criterion for OEIS sequences.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here there seems to be a common thread.  I would like to post a two thread (cops and robbers style) question that &lt;em&gt;is competitive&lt;/em&gt; and &lt;em&gt;does have a winning criterion&lt;/em&gt; but only for one thread.  In the second case the goal of the non-scored thread would be to maximize your own score on the scored thread, but the first is in even murkier water where the ostensibly the only goal of one thread is to make the other thread &quot;fun&quot; (whatever that means).&lt;sup&gt;1&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now perhaps each scenario should be treated separately, but they are similar so I thought I'd put them as one meta question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can a two thread challenge have one thread without a winning criterion?  If so what restrictions should we put in place on such challenge types?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;I have thought of making it a pop-con and robbers but I &lt;em&gt;really&lt;/em&gt;, &lt;em&gt;really&lt;/em&gt; don't like pop-cons for a number of reasons, and I'd rather not ask the question than ruin it by making it a pop-con.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-07-26T17:30:21.567" LastActivityDate="2017-07-28T12:58:14.283" Title="Can I make a CnR with no winning criteria for Cops?" Tags="|discussion|cops-and-robbers|" AnswerCount="1" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="13454" PostTypeId="1" AcceptedAnswerId="13455" CreationDate="2017-07-26T17:10:25.030" Score="3" ViewCount="128" Body="&lt;p&gt;Over on Meta Stack Exchange, SQB asked &lt;em&gt;&lt;a href=&quot;https://meta.stackexchange.com/q/297500/351462&quot;&gt;Which sites have YouTube embedding on?&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Searching on Meta Code Golf, I was able to find an &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/3616/could-we-get-the-audio-embedding-feature-for-ppcg&quot;&gt;announcement post&lt;/a&gt; for embedded SoundCloud audio files, but found no mention of embedded YouTube videos. Additionally, &lt;a href=&quot;https://meta.stackexchange.com/q/299082/351462&quot;&gt;YouTube embedding is not shown in the markdown preview window&lt;/a&gt;, so there's no way to test without posting publically.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I originally planned on testing in the &lt;em&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox for Proposed Challenges&lt;/a&gt;&lt;/em&gt; before &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/39036487#39036487&quot;&gt;Noah Cristino recommended I ask here on Meta&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Are embedded YouTube videos supported on Code Golf?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="65907" LastEditorUserId="65907" LastEditDate="2017-07-31T14:58:44.347" LastActivityDate="2017-08-01T22:36:46.590" Title="Does Code Golf support embedded YouTube videos?" Tags="|support|formatting|" AnswerCount="1" CommentCount="2" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13455" PostTypeId="2" ParentId="13454" CreationDate="2017-07-26T17:10:25.030" Score="4" Body="&lt;p&gt;There's only one way to find out.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Testing YouTube URL Embedding&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Regular&lt;/strong&gt; &lt;code&gt;https://www.youtube.com/watch?v=gocwRvLhDf8&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.youtube.com/watch?v=gocwRvLhDf8&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.youtube.com/watch?v=gocwRvLhDf8&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Timestamped&lt;/strong&gt; &lt;code&gt;https://www.youtube.com/watch?v=gocwRvLhDf8&amp;amp;t=22&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.youtube.com/watch?v=gocwRvLhDf8&amp;amp;t=22&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.youtube.com/watch?v=gocwRvLhDf8&amp;amp;t=22&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Shortened&lt;/strong&gt; &lt;code&gt;https://youtu.be/gocwRvLhDf8&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://youtu.be/gocwRvLhDf8&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://youtu.be/gocwRvLhDf8&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;/Embed&lt;/strong&gt; &lt;code&gt;https://www.youtube.com/embed/gocwRvLhDf8&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.youtube.com/embed/gocwRvLhDf8&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.youtube.com/embed/gocwRvLhDf8&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Embedded HTML&lt;/strong&gt; &lt;code&gt;&amp;lt;iframe width=&quot;854&quot; height=&quot;480&quot; src=&quot;https://www.youtube.com/embed/gocwRvLhDf8&quot; frameborder=&quot;0&quot; allowfullscreen&amp;gt;&amp;lt;/iframe&amp;gt;&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Mobile&lt;/strong&gt; &lt;code&gt;https://m.youtube.com/watch?v=gocwRvLhDf8&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://m.youtube.com/watch?v=gocwRvLhDf8&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://m.youtube.com/watch?v=gocwRvLhDf8&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Flash Player&lt;/strong&gt; &lt;code&gt;https://www.youtube.com/v/gocwRvLhDf8&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.youtube.com/v/gocwRvLhDf8&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.youtube.com/v/gocwRvLhDf8&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;YouTube TV&lt;/strong&gt; &lt;code&gt;https://www.youtube.com/tv#/watch/video/idle?v=gocwRvLhDf8&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.youtube.com/tv#/watch/video/idle?v=gocwRvLhDf8&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.youtube.com/tv#/watch/video/idle?v=gocwRvLhDf8&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;See &lt;a href=&quot;https://meta.stackexchange.com/a/298854/351462&quot;&gt;&lt;em&gt;Which sites have YouTube embedding on?&lt;/em&gt;&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="65907" LastEditorUserId="65907" LastEditDate="2017-08-01T15:31:33.710" LastActivityDate="2017-08-01T15:31:33.710" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13459" PostTypeId="1" AcceptedAnswerId="13460" CreationDate="2017-07-26T19:05:05.380" Score="-3" ViewCount="124" Body="&lt;p&gt;This is my solution to the popularity contest problem.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Have a meta post about making a good popularity contest.&lt;/li&gt;&#xA;&lt;li&gt;Popularity contests after being posted must set a time period of a minimum of one day before answers are allowed to be posted. Therefore there is not a luck element to them. This would allow people to make answers and would help remove fastest gun in the west.&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The other option would be to wait a minimum of one day then record the votes on all answers then the winner is the highest increase of votes.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;Popularity contests should be written with a Objective winning criterion. Think of creativity as the tool not the guide. Give a clear example of what a ideal answer looks like. Make sure to leave room for people to expand and have fun.&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Example of good winning criterion: &quot;Voters should consider how well the program patches the text.&quot; It allows humans to judge how well the code did. A bad example is: &quot;Vote on how nice it looks!&quot; that is BAD everyone views it different. You can encourage making it look nice. Offer a bounty for objective things like that.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;Discourage new users from using it by saying (something to this effect) in the tag wiki snippet: &quot;This tag is highly risky. New users should avoid using this tag without posting first in the sandbox.&quot; &lt;/li&gt;&#xA;&lt;li&gt;To quote a removed user: &quot;Another thing you want to make sure of is that the challenge is still ontopic for the site. If there were a challenge &quot;write code that draws a pretty image&quot;, popularity-contest would clearly be the best possible victory criterion. That doesn't make the challenge a good popularity contest, though, because it's a bad challenge, and giving it an appropriate victory condition won't change that. It's important to pick a topic for which writing a popular answer will take skill (especially programming skill), and where the subject matter isn't too far from the sort of subject matter normally covered on this site.&quot;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;That is my personal view on what we should do. What do you think?&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastActivityDate="2017-07-26T19:26:40.133" Title="Solution to popularity contest" Tags="|discussion|popularity-contest|" AnswerCount="1" CommentCount="5" ClosedDate="2017-08-09T18:04:48.203" ContentLicense="CC BY-SA 3.0" />
  <row Id="13460" PostTypeId="2" ParentId="13459" CreationDate="2017-07-26T19:26:40.133" Score="2" Body="&lt;p&gt;I do have posted and participated in a bunch of popularity contests and already discused their problems a lot, so I think I may adress some of the issues I've seen, what I agree on and what I do not agree on. I do recommend reading the previous discussions and decisions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regarding 1: Yes, all challenges should be sandboxed. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regrading 2: If you have 1 day without answers, the challenge is going to get burried, and still not everyone can participate at the point of time you are allowed to post, so you just postopone the FGITW &quot;problem&quot;. I think with the current format of this site there is no way to awoid FGITW effects or any other effects of votes that influence other votes. I just accept that now.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regarding 3: The &lt;em&gt;winning&lt;/em&gt; criterion is the number of votes by definition. We already have an &lt;em&gt;objective validity criterion&lt;/em&gt;. And you cannot enforce a &lt;em&gt;voting criterion&lt;/em&gt;, people are going to vote on whatever they like, so one should design a challenge where the goal is something that people will like.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regarding 4:  Yes that would be a good idea, but I don't think many users actually read the tag description as we already rewrote that a while a go to account for the points raised by many discussios before.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastActivityDate="2017-07-26T19:26:40.133" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13461" PostTypeId="1" AcceptedAnswerId="13465" CreationDate="2017-07-26T20:14:27.570" Score="13" ViewCount="830" Body="&lt;p&gt;34 out of the last 50 pop-cons were closed (that's from about the middle of 2015).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we retire &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="56656" LastEditDate="2017-08-02T19:56:27.710" LastActivityDate="2017-08-09T19:04:59.660" Title="Should we blacklist [popularity-contest]s?" Tags="|discussion|popularity-contest|" AnswerCount="7" CommentCount="18" ContentLicense="CC BY-SA 3.0" />
  <row Id="13462" PostTypeId="5" CreationDate="2017-07-26T20:15:09.657" Score="0" Body="" OwnerUserId="-1" LastEditorUserId="-1" LastEditDate="2017-07-26T20:15:09.657" LastActivityDate="2017-07-26T20:15:09.657" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13463" PostTypeId="4" CreationDate="2017-07-26T20:15:09.657" Score="0" Body="" OwnerUserId="-1" LastEditorUserId="-1" LastEditDate="2017-07-26T20:15:09.657" LastActivityDate="2017-07-26T20:15:09.657" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13465" PostTypeId="2" ParentId="13461" CreationDate="2017-07-26T20:37:12.570" Score="32" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;To come back to it after over a year. Should we end the popcon?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Keep it&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Yes, keep it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;But why??&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Is closing an off-topic question really that hard? If it's off-topic, it's off-topic. If it's a pop-con, then that's just an unfortunate misunderstanding of the tag at hand. If we were to remove pop-con, you'd consequently remove some of the (arguably) most interesting challenges on this site. Quite frankly, if all I get to see on this site are trivial variants on OEIS sequences, primes, quines, I don't see the point in participating. It's those few challenges that keep me going.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What challenges are you talking about?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Particularly, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/111092/write-a-programming-language-of-unknown-completeness&quot;&gt;Write a Programming language of Unknown Completeness&lt;/a&gt;. While the answers generated from it weren't 100-upvote worthy, they were quite interesting; they showed how certain conjectures could be exploited in a programming language. This remains one of my favorite challenges on this site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another pop-con I like is &lt;a href=&quot;https://codegolf.stackexchange.com/q/86873/31957&quot;&gt;Patch the Paragraph&lt;/a&gt;. I feel like this site could grow from challenges like this--the correct pop-con.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;But only one of the seven pop-con's this year has been on topic!&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Yes. Those six closed questions weren't &quot;bad&quot; questions, just off-topic (and one dupe). &lt;strong&gt;Off-topic questions in a tag don't justify the removal of the pop-con tag,&lt;/strong&gt; neither do a majority of off-topic questions on a tag that receives little attention as it is.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Answering some of your complaints&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I personally think we should, just like with code-trolling and underhand there was too much bad for the good.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;No. Code trolling and underhanded were removed because it was a negative influence on the type of challenges and answers this site received.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;We just keep closing them over and over.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Yes, we do often close pop-con questions, due to their nature. But remember: we had to close 6 (six) questions this year. Only six! And we were able to get such a nice question off of the tag. This is only &quot;over and over&quot; for the impatient.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If there is so much bad for the good why should we keep it.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;You certainly can't justify the removal of something due to the bad parts of it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pretend you're a preschool teacher. Just because half the children in a kindergarten class are little miscreants, doesn't mean you should quite teaching as a whole.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's take a more extreme example. There have been some really bad humans in our history. In fact, there has been a lot of nasty people. If there's been &quot;so much&quot; bad in the human race, why should we keep it? Should we all off ourselves because there are some bad people in our midst? Or should we try and mitigate the damage of the offenders and try to learn and improve as a race?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I am thoroughly of the opinion that the pop-con is a redeemable question type. So long as we have gems from the pop-con tag, it is worth keeping.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Some more opinions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Quoting &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/13461/killing-the-popcon?answertab=active#comment47916_13466&quot;&gt;my comments&lt;/a&gt; (and fixing some spelling errors):&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Given that most people don't really accept answers (citation needed, personal experience), and that it's significantly hard to be the &quot;shortest&quot; or winning answer, there really isn't any incentive besides the hard-and-fast rules to golf your code; thus, one must usually code with the intent of enjoying it. Part of this enjoyment comes from receiving votes. If you don't receive votes for what you worked hard on, then you aren't enjoying the process as much, and can thus consider yourself to have wasted time. In this light, it's much more advantageous to treat a code golf as a popularity contest. How do you win a popularity contest? Well, there's two solid ways: do something truly incredible, or do something &quot;for the meme&quot;. Consciously or not, code-golf is really just a popularity contest in disguise. The winning criterion is a joke made for those who are students of Jelly.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I honestly doubt that allowing the popularity will significantly affect the quality of the questions on this site. I also believe that banning the popularity contest wouldn't have much effect either. Why do I care? Because I remember a time where this site was pretty fun. The community wasn't the best, but there were folks who I really enjoyed being with and spending time with. They have, for the most part, moved on from this site. I am here still because I enjoy code golf and I enjoy developing and testing my languages. I enjoy votes, but I don't consider them the end of answering on this site. IF I did, well, I would've moved on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are people who have moved on because this site has grown and changed. They believe that the &quot;fun&quot; of underhanded and code-trolling has left the site. And it almost has. The one vestige of interest left in this site in that respect is the rare popularity contest. I doubt few still hang on to this site because of the existence of the popularity contest. I know that if it is removed, there are people who will become just slightly less interested in this site, myself included. &lt;/p&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="61563" LastEditDate="2017-08-09T19:04:59.660" LastActivityDate="2017-08-09T19:04:59.660" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="13466" PostTypeId="2" ParentId="13461" CreationDate="2017-07-26T20:38:03.887" Score="-8" Body="&lt;h1&gt;Why I think it should die&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;This is my opinion I know it might be a little on the extreme side of things.  If you disagree with me just remember we both want what is best for the site : )&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The pop-con is a good idea, it allows us to ask questions with out being confined to the problems of mathematically defining a criteria.  In theory it promotes creative and interesting answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But there is a problem.  That problem is that votes don't really measure anything.  The intention is that votes would represent cleverness, creativity and good work, but they don't.  It seems that the only thing votes are consistently able to measure is how quickly an answer was posted.  I asked a pop con myself, which I have seen hailed as a &quot;good example of a pop-con&quot; by more than one user.  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/111092/write-a-programming-language-of-unknown-completeness&quot;&gt;Here it is&lt;/a&gt;, take a look at the answers, not only are they mostly rather low quality (all of them pretty much do what I suggested a good answer would not do) but there is not much meaning to how they are ranked.  If this is a &quot;good&quot; pop-con then why is there any question if they should exist?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We have decided as a site that Fastest Guns in the west is not a winning criteria, so why should a criteria that is very heavily influenced by it be valid.  Fastest Guns in the west does measure something while Popularity contests only tangentially measure a number of things.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Voting culture&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I often see users complaining about the broken voting culture on this site, primarily influenced by the HNQ.  People complain about high quality answers not getting enough votes and low effort, quick answers getting way too many votes.  I feel this way myself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It baffles me to see so many complaints about how inaccurate and broken voting is and to simultaneously ask questions that are scored &lt;em&gt;entirely based on voting&lt;/em&gt;.  If good answers are not getting votes elsewhere why would we expect them to on a popularity contest?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is my belief that scoring should encourage people to craft the most interesting highest quality answers, using clever techniques and knowledge of the subject area, and it is also my belief that the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; does not do that.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-07-26T23:30:25.383" LastActivityDate="2017-07-26T23:30:25.383" CommentCount="23" ContentLicense="CC BY-SA 3.0" />
  <row Id="13467" PostTypeId="2" ParentId="2140" CreationDate="2017-07-26T20:58:54.117" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/142426/reverse-maths-cycles&quot;&gt;Reverse Maths Cycles&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2017-09-11T19:29:04.657" LastActivityDate="2017-09-11T19:29:04.657" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="13468" PostTypeId="1" CreationDate="2017-07-26T21:53:06.670" Score="-7" ViewCount="104" Body="&lt;p&gt;I think that we should have a new type of &quot;challenge&quot;: showcase questions. These questions aren't questions where answers compete for the lowest bytecount, or the best score, they are answers &lt;em&gt;to a specific question&lt;/em&gt; that demonstrate interesting or unique features of languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A showcase question, in order to avoid being too broad, would be given a certain problem, such as find all primes below a given input, and would aim to show off interesting features that the language has, that wouldn't be useful in a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; as they use too many bytes to be worthwhile.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These types of questions can be done, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44680/showcase-of-languages&quot;&gt;have&lt;/a&gt;. In fact, that question is the second highest upvoted question on the site. SO clearly they can be done well, if not with difficulty.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm going to cover some of the reasons why and why not I see with this type of challenge, but if you see any others, feel free to include them in your answer, or a comment.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Why?&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This site is getting further and further away from &quot;only the shortest solution counts&quot; (which is a good thing) and I think that questions that don't have a winning criteria &lt;em&gt;that aren't closed&lt;/em&gt; would be the tipping point to becoming a site that is completely like this.&lt;/li&gt;&#xA;&lt;li&gt;It would allow for people to see some of the more interesting features of a language, without losing out in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; competitions.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Why not?&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It goes against the whole point of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so much so that we have a close reason that stops challenges like this.&lt;/li&gt;&#xA;&lt;li&gt;It could create very broad and under specified questions, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/100928/showcase-what-makes-your-programming-language-different-from-all-others&quot;&gt;this&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;As they are essentially a form of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, which are notoriously difficult to make, this could lead to the same problem.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;What are your thoughts on this? Do you thing we should allow new questions of this type?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2017-08-03T17:06:57.237" Title="New challenge idea: Showcase" Tags="|discussion|new-genre|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13470" PostTypeId="2" ParentId="13461" CreationDate="2017-07-27T01:09:27.943" Score="-7" Body="&lt;h1&gt;It should go&lt;/h1&gt;&#xA;&lt;p&gt;If the voting culture is bad why would we want a challenge that revolves around voting culture?&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;mic drop&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;em&gt;I know that it may be extreme but I just want to say that I think it is for the best :)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Some stats. 34 out of the last 50 Pop cons were closed. That reaches into Jul 23 '15! Think about how many. Only 2 were dupes the rest were just closed. That is 68% close rate. Some of them should be closed but are just older and the VTC was different.&lt;/p&gt;&#xA;&lt;h1&gt;Fastest Gun in the West&lt;/h1&gt;&#xA;&lt;p&gt;When someone FGITW a post with a optimized answer it often turns out badly. Why do you want a challenge that FGITW is often the best way to win? The challenge is more about luck then about skill. It is just a fact that the earlier answers (even by a day) will get many more upvotes then other answers. As Pop-cons often have easier challenges some of the better answers are instantly in the 2nd or 3rd page. It doesn't really show the real skill.&lt;/p&gt;&#xA;&lt;h2&gt;More about voting culture.&lt;/h2&gt;&#xA;&lt;p&gt;I personally find the voting culture annoying. A one byte answer by Jelly gets 66 upvotes while my and many other answers remain at 1 upvote. Even with the same length and the same lack of clever code but since Jelly is &amp;quot;cool&amp;quot; and it was posted fast it ends up with many more votes. It is really out of wack (now I understand that people can vote how they want) and having entire challenges around a &amp;quot;broken&amp;quot; culture makes the very challenges &amp;quot;broken&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;Anyways, thank you for your time reading this. I know it was a decent read but just remember that I really care about this website and hope everything turns out fine!&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-27T01:09:27.943" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13473" PostTypeId="1" CreationDate="2017-07-27T12:56:13.200" Score="2" ViewCount="78" Body="&lt;p&gt;Recently I had the idea to create a KotH challenge based on a card game (played with regular 52 cards). I then began drafting the rules of the game and the interface method.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The thing is, I was taken aback by how lengthy the specification of the challenge is. The Markdown file that contains my draft is more than 8kB, and I'm not even finished yet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I know that KotH specifications are longer than those of regular challenges, but I would like to avoid them being &lt;em&gt;too&lt;/em&gt; long.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, these are the question I would like to ask:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;How long can a challenge specification be (depending on the type of challenge)?&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Are there general tips to reduce the length of a challenge specification (especially KotH)?&lt;/strong&gt; Note that the game in question has many variations and optional rules, so I need to crearly define which rules we use.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="71426" LastActivityDate="2017-07-28T11:51:55.233" Title="How long can a challenge specification be?" Tags="|discussion|asking-questions|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="13475" PostTypeId="2" ParentId="13473" CreationDate="2017-07-27T13:24:48.130" Score="3" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12956/65836&quot;&gt;A Challenge Spec can be up to 65536 characters in length.&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Thanks to @StepHen for that number.&lt;/p&gt;&#xA;&lt;p&gt;However, despite this, a maximum of ~30,000 characters (closer to 33,000) is required for the sandbox, which is heavily recommended for questions.  Therefore, I would recommend cutting a challenge down to 30,000 characters to allow posting in the sandbox.&lt;/p&gt;&#xA;&lt;p&gt;Now for some tips on cutting challenges down to size.&lt;/p&gt;&#xA;&lt;h2&gt;Don't over explain.&lt;/h2&gt;&#xA;&lt;p&gt;When I am trying to make my challenges more brief, I find it easiest to remove sections that reexplain sections.  For example, if I explain a rule using a bullet point, I tend to reexplain it later using an example.  Getting rid of unnecessary examples helps a lot, and although retaining test cases is a good idea, examples that illustrate simple steps are often unnecessary.&lt;/p&gt;&#xA;&lt;h2&gt;Make the challenge simpler.&lt;/h2&gt;&#xA;&lt;p&gt;If all else fails to cut your spec down to a reasonable size, sometimes removing cumbersome rules that require paragraphs of explanation will do the trick.  As you are asking specifically about a KoTH, golfing your controller may also help (if you are including it in you spec as code, and not just a link).  Some excessively complex rules can make a challenge less fun, as well as give it a much longer spec.  Remember, nobody wants to read a 50,000 character wall of text that just explains a bunch of boring, obscure rules designed to cover every possible edge case.  If you need to explain that an edge case is not allowed, you can even do it in a comment on your question, if the explanation is making your spec to cumbersome.&lt;/p&gt;&#xA;" OwnerUserId="69331" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-28T11:51:55.233" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13476" PostTypeId="2" ParentId="13461" CreationDate="2017-07-27T15:42:31.493" Score="11" Body="&lt;h1&gt;A follow up to my last answer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This second answer is a bit of a write up of my thoughts after some discussion about my previous answer.  Everything I said in the last answer I still believe is true, but I would like to put this as a separate answer because it has different points than the last.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;On Programming competitions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This site is for programming competitions, I think we all agree on that.  But I think thats not what we are all here for.  I, myself, do not like programming.  I'm not really a programmer, I find it frustrating and boring to write code longer than a few lines.  I do like puzzles though especially competitive ones.  I have found that despite my distain for programming, this is a great place where I can participate in a competitive, concrete task, that involves not only solving a puzzle but making your solution as good as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It should be no wonder that I don't like Popularity Contests, they are much more about programming in a abstract creative sense.  The only goal is to make code that people like.  And I don't find writing or reading code to be inherently fun, so I probably wouldn't find pop-cons fun.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Most people are probably not in the same boat as I.  Most people are probably here because they like programming and these competitions are a great way to program with a community.  In this way popularity contests appeal to the core demographic, they are about programming.  Often times they are even real world tasks, like patch the image.  If you were here just for programming, popularity contests would probably be the best tag for you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I don't think the site is about programming.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As I opened this section &quot;This site is for programming competitions&quot;.  And I think that is the issue here.  Popularity contests are not competitions and are thus out of scope for the site.  The occupy this weird space where they appeal to the core demographic but ultimately fall just outside of the scope of the site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now's about when you might ask:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;But surely popularity contests are competitions, right? They have objective winning criteria, so they are competitions?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Well here I am going to dissect something said by Conor O'Brien as a comment to my last post&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Conciously or not, code-golf is really just a popularity contest in disguise. The winning critereon is a joke made for those who are students of Jelly.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I think Conor is right in some ways here.  For many of us the goal of posting an answer is to gain reputation, to score imaginary internet points and to win the admiration and respect of our peers.  Votes drive us to answer, golfing or optimizing are just ways to convince people to click the up vote and give you reputation.  If you remove the winning criterion from a challenge, people are just going to do what they think gets the most votes.  This is in essence what a popularity contest is.  The only goal is to get as many votes as possible.  And in that way they are no different than challenges without a winning criterion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This leads me to believe that pop-cons are not competitions. They &lt;em&gt;are&lt;/em&gt; about programming which is one half of the site's purpose, but they are not about competitions, which is another half of the site, that, in my opinion, is just as important.  I don't think we should allow challenges that are not competitions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This means, by the way, that we should not allow questions that are not about programming.  I asked if such questions should be on topic ealier &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10287/are-non-programming-golf-puzzles-allowed&quot;&gt;here&lt;/a&gt; where the consensus was, if its not directly about programming you should restructure the question so it is about programming.  This seems to imply, at least to me, that questions that cannot me made into some sort of challenge about writing code are not on topic.  For example here's a CMC from @DJMcMayhem where no code is required:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;What's the longest English word that contains words of length 1 to N in it?&#xA;  For example, Path is valid because it contains words from 1 to 4 (a, at, pat, and path)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This fits all the criteria for being a contest, but it is not about programming.  Answers here would just be english words not programs.  This would also be off-topic.  And I have confidence that if it were posted now it would be closed as such.  I see popularity contests as a different side of the same coin, they are about programming but they are not contests.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To sum this up here's a Venn diagram that hopefully expresses what I am trying to convey.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/PKq4k.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/PKq4k.png&quot; alt=&quot;Venn Diagram&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Overall pop-cons are probably not bad.  I don't like them but some people do like them.  But I do think, regardless of their quality, pop-cons should be hosted elsewhere.  A while ago &lt;a href=&quot;https://www.reddit.com/r/programming/&quot; rel=&quot;nofollow noreferrer&quot;&gt;/r/programming&lt;/a&gt; had a faux pop-con to make the worst possible volume slider, and I think that reddit might be a better home for the pop-con style.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So should we kill the pop-con? I think the answer is yes.  Hopefully I've at least made it clear why I think that.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-07-30T16:55:19.603" LastActivityDate="2017-07-30T16:55:19.603" CommentCount="16" ContentLicense="CC BY-SA 3.0" />
  <row Id="13481" PostTypeId="2" ParentId="2140" CreationDate="2017-07-27T20:16:18.117" Score="0" Body="&lt;p&gt;I'm sort of brainstorming a challenge. I'm not really paying attention to question format at the moment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge would be to generate and populate a Golf Scorecard.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output would look something like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hole    Par     Strokes Score&#xA;1       3       3       0&#xA;2       5       4       -1&#xA;3       4       5       1&#xA;4       3       4       1&#xA;5       4       4       0&#xA;6       5       3       -2&#xA;7       4       3       -1&#xA;8       3       5       2&#xA;9       5       5       0&#xA;Totals  36      36      0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A Par value would be generated by choosing a random number in [3, 4, 5].&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A Stroke value would be generated by choosing a random number within some range (say -2/+2 or -3/+3) of Par. A Stroke can be no lower than 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Score = Stroke - Par&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Total is adding up all the values in that column (not including Hole).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm wondering if it would be too much to ask to have the generated values be somewhat realistic (unlike my example output), in that Par values tend to be mostly 4, with about the same number between 3 and 5, and Stroke values tend to be close to or above Par, with it being very unlikely to be 1.&lt;/p&gt;&#xA;" OwnerUserId="71845" LastActivityDate="2017-07-27T20:16:18.117" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13482" PostTypeId="2" ParentId="2140" CreationDate="2017-07-27T22:15:12.387" Score="2" Body="&lt;h1&gt;Base 32 RFC 4648 Compliant Alphabet!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;When writing my handy-dandy totp/hotp token implementation in Python and Swift (ad: &lt;a href=&quot;https://github.com/danielVebman/Totp-Token&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;), I encountered for the first time &lt;code&gt;RFC 4648&lt;/code&gt;. There is a nice and long memo about RFC 4648, but I only had to focus on a very specific part of it: Page 8. If you are bored and want some enthralling reading, you can find this memo &lt;a href=&quot;https://www.rfc-editor.org/rfc/rfc4648#section-6&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;, and a useful table &lt;a href=&quot;http://www.garykessler.net/library/base64.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Basically, I was looking for the alphabet that could be used when base 32 decoding a String. Well, this is it: &lt;code&gt;ABCDEFGHIJKLMNOPQRSTUVWXYZ234567&lt;/code&gt;, and padding, &lt;code&gt;=&lt;/code&gt;. However, simply printing that is not the challenge –– that would be too simple&lt;sup&gt;1&lt;/sup&gt;. Instead, we are going to print this &lt;strong&gt;(the comments are for your reference and do not need to be printed)&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0x00 - 0x0F or   0 -  15&#xA;__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0x10 - 0x1F or  16 -  31&#xA;__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0x20 - 0x2F or  32 -  47&#xA;__,__,26,27, 28,29,30,31, __,__,__,__, __, 0,__,__,  // 0x30 - 0x3F or  48 -  63&#xA;__, 0, 1, 2,  3, 4, 5, 6,  7, 8, 9,10, 11,12,13,14,  // 0x40 - 0x4F or  64 -  79 &#xA;15,16,17,18, 19,20,21,22, 23,24,25,__, __,__,__,__,  // 0x50 - 0x5F or  80 -  95&#xA;__, 0, 1, 2,  3, 4, 5, 6,  7, 8, 9,10, 11,12,13,14,  // 0x60 - 0x6F or  96 - 111&#xA;15,16,17,18, 19,20,21,22, 23,24,25,__, __,__,__,__,  // 0x70 - 0x7F or 112 - 127&#xA;__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0x80 - 0x8F or 128 - 143&#xA;__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0x90 - 0x9F or 144 - 159&#xA;__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0xA0 - 0xAF or 160 - 175&#xA;__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0xB0 - 0xBF or 176 - 191&#xA;__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0xC0 - 0xCF or 192 - 207&#xA;__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0xD0 - 0xDF or 208 - 223&#xA;__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0xE0 - 0xEF or 224 - 239&#xA;__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0xF0 - 0xFF or 240 - 255&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;There may be trailing spaces after every line, and trailing newlines after the last one.&lt;/p&gt;&#xA;&lt;p&gt;Also, the single digit numbers can be written as &lt;code&gt;0[digit]&lt;/code&gt; instead of &lt;code&gt;[space][digit]&lt;/code&gt;. However, be sure to include the spaces between the four groups.&lt;/p&gt;&#xA;&lt;p&gt;By the way, the &lt;code&gt;__&lt;/code&gt; actually represent &lt;code&gt;255&lt;/code&gt;, but the former do not make me drown in a sea of digits.&lt;/p&gt;&#xA;&lt;hr&gt;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; Should the challenge be to just print that string?&lt;/p&gt;&#xA;&lt;p&gt;Any other suggestions to make this challenge more interesting?&lt;/p&gt;&#xA;" OwnerUserId="42854" LastEditorUserId="-1" LastEditDate="2021-10-07T07:34:52.683" LastActivityDate="2017-07-30T02:35:19.797" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13484" PostTypeId="2" ParentId="2140" CreationDate="2017-07-28T04:25:11.827" Score="3" Body="&lt;p&gt;&lt;strong&gt;Challenge: Count integers 1 to 10, but slowly on a time delay.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to print the integers 1 to 10 to the screen with each integer separated by a newline, but on a time delay, such that it should take “n” seconds before the integer “n” is printed to the screen. For example, the program will wait 1 second before printing 1 and a newline, and then the program will wait 2 seconds before print 2 and a newline, and then the program will wait 3 seconds before print 3 and a newline. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So the expected standard output to the screen is this: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;2&#xA;3&#xA;4&#xA;5&#xA;6&#xA;7&#xA;8&#xA;9&#xA;10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;But the program will patiently wait “n” seconds before printing the integer “n” to the screen, so as your program may interpret it as … &lt;/p&gt;&#xA;&#xA;&lt;p&gt;waiting 1 second …&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;waiting 2 seconds …&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;waiting 3 seconds …&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;, and so on … &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Restrictions:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;1)&lt;/strong&gt; Since some programming languages may not have a sense of system time, you are not allowed to use any modules/libraries/functions which can measure the time of your program within your program. Therefore all programming languages can be used. This restriction puts all the programming languages on an equal level. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;2)&lt;/strong&gt; Restriction 1 makes it such that you are required to write a function which takes about 1 second to process, and then you can rerun that function “n” integer of times before printing the next integer “n” in 1 to 10 to the screen. You can call your function whatever you want or if you can get away without naming the function then you can do that, too. So, your program would see this behind the scenes: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;performing function fx 1 time. #which the arbitrary function fx takes about 1 second to process. &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;performing function fx 2 times&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;performing function fx 3 times&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;… and so on&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;3)&lt;/strong&gt; Therefore, your program should take about 1 + 2 + 3 + 4 … + 10 = 55 seconds to finish printing all the integers from 1 to 10 to the screen. Since you need to write a function that takes about 1 second to process, acceptable solutions can be off by plus or minus 2 seconds from 55 seconds. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;4)&lt;/strong&gt; You must time your script which counts the integers 1 to 10 on a delay, so you can use any external program to time your script. I recommend using the bash function time, and giving me the “real” time or actual elapsed time of your script in seconds. If you time your script another way, tell me how you did it. Give me three digits after the decimal place for the real time in seconds. Do not round or truncate.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;winning condition:&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winning condition is the fastest program in terms of actual elapsed real time in seconds which is closest to 55 seconds. If, for example, one submission is 54.9 seconds and another is 55.1 seconds, the 55.1 second submission wins because 54.9 seconds is too fast. Again, the point of this program is to slowly print integers to the screen.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Again, it should take approximately 55 +/- 2 seconds to print the integers 1 to 10 to the screen. &lt;/p&gt;&#xA;" OwnerUserId="69968" LastEditorUserId="69968" LastEditDate="2017-07-28T06:15:34.030" LastActivityDate="2017-07-28T06:15:34.030" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="13486" PostTypeId="2" ParentId="13453" CreationDate="2017-07-28T12:31:15.930" Score="4" Body="&lt;h1&gt;Tailoring the incentives&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Not a direct answer to the title question, but a potential solution for your first example case.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want cops to have an incentive to produce difficult problems, but also an incentive to avoid problems that will never be solved, you could design the scoring mechanism with this in mind, rather than not scoring at all. This would avoid the grey area problem with banning cryptographic hash functions (what counts as one...?). The scoring mechanism itself will give cops an incentive to avoid things that can't be cracked.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There may be many ways of including this incentive in the scoring mechanism, that suit different types of challenge. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A cop's score is the length of time between posting the cop answer and having a valid robber answer posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now if a cop misjudges this and posts something that never gets cracked, they score zero. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This might even apply to in a similar way to your second example case. If the cops thread is effectively a list of golf challenges, you could score in a way that gives an incentive to find sequences that are harder to compress. For example: A cop's score is the length of the shortest corresponding robber answer. So robbers try to win by posting the shortest code for each cop, and cops try to win by posting sequences that require more bytes of code than other cops' sequences.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There isn't a concept of &quot;uncrackable&quot; in this case (you can phrase the challenge spec to ensure all sequences are well defined and can be described in code), but you could still put an upper limit on code length if you wish. For example: A cop scores zero until the shortest corresponding robber answer is less than 100 bytes (or 1000 bytes, or whatever suits your challenge). This gives cops an incentive to be difficult but not too impractical.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Loopholes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The scoring mechanisms may need some refinement to avoid unwanted incentives and the possibility of loopholes. It might take a few test challenges to iron these out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example: a cop might be able to inflate their score by looking at the timezones/frequently active charts for the users in the robbers thread, and posting when fewer of them will be online. This might be mitigated by making the score the floor of the number of whole 24 hour periods, starting at the cop posting time. There's a similar potential problem with weekends too.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2017-07-28T12:58:14.283" LastActivityDate="2017-07-28T12:58:14.283" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="13488" PostTypeId="2" ParentId="2140" CreationDate="2017-07-28T18:46:38.003" Score="1" Body="&lt;h1&gt;Can you compete with a  supercomputer?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The challenge is to write super fast code for computing the &lt;a href=&quot;https://en.wikipedia.org/wiki/Permanent&quot; rel=&quot;nofollow noreferrer&quot;&gt;permanent of a matrix&lt;/a&gt; of complex numbers.   &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In &lt;a href=&quot;https://arxiv.org/abs/1606.05836&quot; rel=&quot;nofollow noreferrer&quot;&gt;a paper from 2016&lt;/a&gt; a team of coders managed to compute the permanent of a 40 by 40 complex matrix on 8192 nodes of what was at the time the world's fastest computer in  about 14 seconds.  Your challenge is to see how close you can get to this on my desktop.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The permanent of an &lt;code&gt;n&lt;/code&gt;-by-&lt;code&gt;n&lt;/code&gt; matrix &lt;code&gt;A&lt;/code&gt; = (&lt;code&gt;a&lt;/code&gt;&lt;sub&gt;&lt;code&gt;i,j&lt;/code&gt;&lt;/sub&gt;) is defined as&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/GOz7G.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/GOz7G.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here &lt;code&gt;S_n&lt;/code&gt; represents the set of all permutations of &lt;code&gt;[1, n]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an example (from the wiki):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Qr1OJ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Qr1OJ.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this question matrices are all square.  &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples (these need updating to have complex entries)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[ 1 -1 -1  1]&#xA; [-1 -1 -1  1]&#xA; [-1  1 -1  1]&#xA; [ 1 -1 -1  1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Permanent:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[-1 -1 -1 -1]&#xA; [-1  1 -1 -1]&#xA; [ 1 -1 -1 -1]&#xA; [ 1 -1  1 -1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Permanent:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[ 1 -1  1 -1 -1 -1 -1 -1]&#xA; [-1 -1  1  1 -1  1  1 -1]&#xA; [ 1 -1 -1 -1 -1  1  1  1]&#xA; [-1 -1 -1  1 -1  1  1  1]&#xA; [ 1 -1 -1  1  1  1  1 -1]&#xA; [-1  1 -1  1 -1  1  1 -1]&#xA; [ 1 -1  1 -1  1 -1  1 -1]&#xA; [-1 -1  1 -1  1  1  1  1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Permanent:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;192&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[1, -1, 1, -1, -1, 1, 1, 1, -1, -1, -1, -1, 1, 1, 1, 1, -1, 1, 1, -1],&#xA; [1, -1, 1, 1, 1, 1, 1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, 1, -1],&#xA; [-1, -1, 1, 1, 1, -1, -1, -1, -1, 1, -1, 1, 1, 1, -1, -1, -1, 1, -1, -1],&#xA; [-1, -1, -1, 1, 1, -1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, 1, -1],&#xA; [-1, 1, 1, 1, -1, 1, 1, 1, -1, -1, -1, 1, -1, 1, -1, 1, 1, 1, 1, 1],&#xA; [1, -1, 1, 1, -1, -1, 1, -1, 1, 1, 1, 1, -1, 1, 1, -1, 1, -1, -1, -1],&#xA; [1, -1, -1, 1, -1, -1, -1, 1, -1, 1, 1, 1, 1, -1, -1, -1, 1, 1, 1, -1],&#xA; [1, -1, -1, 1, -1, 1, 1, -1, 1, 1, 1, -1, 1, -1, 1, 1, 1, -1, 1, 1],&#xA; [1, -1, -1, -1, -1, -1, 1, 1, 1, -1, -1, -1, -1, -1, 1, 1, -1, 1, 1, -1],&#xA; [-1, -1, 1, -1, 1, -1, 1, 1, -1, 1, -1, 1, 1, 1, 1, 1, 1, -1, 1, 1],&#xA; [-1, -1, -1, -1, -1, -1, -1, 1, -1, -1, -1, -1, 1, 1, 1, 1, -1, -1, -1, -1],&#xA; [1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, 1, 1, -1, 1, 1, 1, 1, 1, 1],&#xA; [-1, 1, 1, -1, -1, -1, -1, -1, 1, 1, 1, 1, -1, -1, -1, -1, -1, 1, -1, 1],&#xA; [1, 1, -1, -1, -1, 1, -1, 1, -1, -1, -1, -1, 1, -1, 1, 1, -1, 1, -1, 1],&#xA; [1, 1, 1, 1, 1, -1, -1, -1, 1, 1, 1, -1, 1, -1, 1, 1, 1, -1, 1, 1],&#xA; [1, -1, -1, 1, -1, -1, -1, -1, 1, -1, -1, 1, 1, -1, 1, -1, -1, -1, -1, -1],&#xA; [-1, 1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, -1, 1, 1],&#xA; [1, 1, -1, -1, 1, 1, -1, 1, 1, -1, 1, 1, 1, -1, 1, 1, -1, 1, -1, 1],&#xA; [1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, -1, -1, 1],&#xA; [-1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, 1, 1, -1, 1, -1, -1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Permanent:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1021509632&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Add the 40 by 40 matrix here&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;The task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You should write code that, given an &lt;code&gt;n&lt;/code&gt; by &lt;code&gt;n&lt;/code&gt; complex  matrix, outputs its permanent.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To make testing simpler, I will provide a single &lt;code&gt;40&lt;/code&gt; by &lt;code&gt;40&lt;/code&gt; complex matrix which you can hardcode into your code in any format of your choosing. Clearly, you are not allowed to precompute the answer however!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scores and ties&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I will test your code on the sample &lt;code&gt;40&lt;/code&gt; by &lt;code&gt;40&lt;/code&gt; complex matrix.  Your score is your time in seconds divided by 14.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If two people are within 1 second of each other then the winner is the one posted first.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Languages and libraries&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You can use any available language and libraries you like but no pre-existing function to compute the permanent. I will run your code under OS X so please give full instructions for how to compile and run it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Reference implementations&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There is already a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/96825/codegolf-the-permanent&quot;&gt;codegolf question&lt;/a&gt; question with lots of code in different languages for computing the permanent for small matrices.  There was also a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/97060/calculate-the-permanent-as-quickly-as-possible&quot;&gt;related challenge&lt;/a&gt; on computing the permanent of matrices with only +-1 entries.  The coding issues when you have complex entries and want things to run fast and multi-core are quite different however.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;My Machine&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The timings will be run on my Mac desktop. The CPU is &lt;code&gt;Intel(R) Core(TM) i7-6700K CPU @ 4.00GHz&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerDisplayName="user9206" LastEditorDisplayName="user9206" LastEditDate="2017-07-28T19:12:40.240" LastActivityDate="2017-07-28T19:12:40.240" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13489" PostTypeId="2" ParentId="2140" CreationDate="2017-07-28T23:13:33.387" Score="1" Body="&lt;h1&gt;Survival Island&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Work in Progress, mainly trying to get the idea out and see if anyone is interested. Also make sure it hasn't been done already. Ideas taken from The Hunger Game and Player Unknown Battleground&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;The Board&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The game will be played on a square 2-dimensional array with the size of x + ny where n is the number of players, and x and y are to be determined. No wrap&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Objects&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;All objects can be destroyed while on the map, hence their hp. Once they are picked up, they cannot be destroyed unless the player dies.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1.Wall: Denoted by the character 'W'&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;HP: 10&#xA;Object Type: Wall&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;2.Reinforced Wall: Denoted by the character 'R'. When a wall is upgraded to reinforced wall by the player, 10 hp is added to the remaining hp on the wall.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;HP: 20&#xA;Object Type: Wall&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;3.Crossbow: Denoted by the character 'C'. Allow the player to have ranged attack with a distance of 2. The damage dealt will be the player's damage minus 1.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;HP: 1&#xA;Weight: 1&#xA;Upgrade #1: damage + 1&#xA;Upgrade #2: attacking distance + 1, damage + 1&#xA;Object Type: Item(Equipment)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;4.Dagger: Denoted by the character 'D'. If the player is attacking with a distance of 1, it does 1 extra damage.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;HP: 1&#xA;Weight: 1&#xA;Upgrade #1: damage + 1&#xA;Upgrade #2: damage + 2&#xA;Object Type: Item(Equipment)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;5.Binocular: Denoted by the character 'B'. Increase the player's line of sight by 1.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;HP: 1&#xA;Weight: 1&#xA;Upgrade #1: line of sight + 1&#xA;Upgrade #2: line of sight + 1&#xA;Object Type: Item(Equipment)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;6.Shield: Denoted by the character 'S'. Increases the player's block by 1&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;HP: 2&#xA;Weight: 1&#xA;Upgrade #1: nothing&#xA;Upgrade #2: block + 1&#xA;Object Type: Item(Equipment)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;7.Armor: Denoted by the character 'A'. negates 1 damage from any incoming damage to the player.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;HP: 2&#xA;Weight: 2&#xA;Upgrade #1: nothing&#xA;Upgrade #2: incoming damage - 1&#xA;Object Type: Item(Equipment)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;8.MedicKit: Denoted by the character 'M'. When used, heal the player's health by 5.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;HP: 1&#xA;Weight: 0.5&#xA;Upgrade #1: hp restored + 3&#xA;Upgrade #2: hp restored + 5&#xA;Object Type: Item(Consumable)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;9.EnergyDrink: Denoted by the character 'E'. When used, increase STR, AGI, and VIT by 1 for 5 turns. (If the player has already drank an energy drink, it will override previous effect).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;HP: 1&#xA;Weight: 0.5&#xA;Upgrade #1: buff duration + 3 turns&#xA;Upgrade #2: all attribute + 1&#xA;Object Type: Item(Consumable)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;10.PoisonedEnergyDrink: Denoted by the character 'E'. When used, decrease STR, AGI, and VIT by 1 for 3 turns.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;HP: 1&#xA;Weight: 0.5&#xA;Upgrade #1: buff duration + 2 turns&#xA;Upgrade #2: all attribute - 1&#xA;Object Type: Item(Consumable)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;11.UpgradeKit: Denoted by the character &quot;U&quot;. Used to upgrades other items. All item can be upgraded twice. 1 upgrade kit is used to upgrade an item once.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;HP: 1&#xA;Weight: 1&#xA;Upgrade #1: nothing&#xA;Upgrade #2: nothing&#xA;Object Type: Item(Special)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;12.Player - Denoted by the character 'P'. This is the actual player on the board. See next section for more details.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;HP: determined by the player&#xA;Object Type: Player&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;E.g. In the following map, the player have a line of sight of 1.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-------------&#xA;|   | A |   | &#xA;-------------&#xA;| R | P |   |&#xA;-------------&#xA;|   |   |   |&#xA;-------------&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In particular. There's a reinforced wall on the left, and a piece of armor on the top. the player is at the center. This can be represented as [{0,1,A},{1,0,R},{1,1,P}]&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The player&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Each player have the following 3 attributes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;STR: affects damage and carrying capacity of the player. +1 damage for each 2 STR and +1 capacity for each 1 STR&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;AGI: affects player's movement range and line of sight. +1 movement for each 5 AGI, and +1 line of sight for each 3 AGI&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;VIT: affects player's health and block. +3 health for each 1 VIT, and +1 block for each 3 VIT&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You are free to assign 0 to 10 attribute points to the above 3 attributes when creating your character. Any character with more than 10 attributes assigned at the start of the game is disqualified.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each player will start off with the following stats (without attribute bonus):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;health: 20&lt;/li&gt;&#xA;&lt;li&gt;damage: 1&lt;/li&gt;&#xA;&lt;li&gt;carrying capacity: 3&lt;/li&gt;&#xA;&lt;li&gt;movement: 1&lt;/li&gt;&#xA;&lt;li&gt;line of sight : 2&lt;/li&gt;&#xA;&lt;li&gt;block: 0&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Game play&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Each turn, the player will perform a move and an action.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Movement phase&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Movement can either be '^' for up, 'v' for down, '&amp;lt;' for left, '&gt;' right or '.' for stay.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you can move 2 or more tiles, you can provide all movements in the order you want them to executed (e.g. &quot;^&gt;&quot; will move up then right, and &quot;&gt;^&quot; will move right then up). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the first movement fails(due to object being there), the subsequent movements are dropped.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The movement phase is performed by every player performing their first movement, then every player performing their second movement if available, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If 2 or more players attempt to move to the same square, then the player with the highest agility wins. If they have the same agility, then it's determined by a dice roll.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Action phase&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each player can perform the following actions during the action phase&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Attack  : Denoted by &quot;A  &quot;. Performs an attack to the coordinate x,y If the coordinate is out of reach, then do nothing. x and y should be relevant to the player, e.g. 0,-1 is attacking down adjacent to the player.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Block: Denote by &quot;B&quot;. Performs an block on each incoming attacks with the chance of block/10. If the block succeeds, negate all damage from that attack.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Pickup : Denoted by &quot;P &quot;. Tries to pick up an object at that direction adjacent to the player. If the tile is empty, or if picking up the item exceeds your carrying capacity, then do nothing.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Drop  : Denoted by &quot;D  &quot;. Tries to drop an item at that direction adjacent to the player. If the tile is already occupied, or the item does not exist. then do nothing.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Build Wall : Denoted by &quot;W &quot;. Tries to build a wall at that direction adjacent to the player. If the tile is already occupied, then do nothing.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Reinforce wall : Denoted by &quot;R &quot;. Tries to upgrade a wall at that direction adjacent to the player. If the tile is not a wall or player do not have UpgradeKit, then do nothing.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Consume : Denoted by &quot;C &quot;. Consumes an item in your inventory. If the item does not exist, then do nothing.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Upgrade : Denoted by &quot;U &quot;. Upgrades an item in your inventory. If the item does not exist, or if you have no UpgradeKit, or if the item already maxed out upgrades. Then do nothing&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Equip : Denoted by &quot;E &quot;. Equips an item. If the item does not exist, then it does nothing, If you have already equipped an item. then put that item in the inventory.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Sleep: Denoted by &quot;S&quot;. Increase health by 3. increases all incoming damage by 1. increase movement, damage, and block next turn by 1. Last one turn.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Gaze into the sky: Denoted by &quot;G&quot;. Looks up into the sky and ponder about life (Do nothing).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;If 2 players try to perform an action at the same tile, It is first determined by the order of actions. If the players uses the same action, then the highest agility player wins. if they have the same agility, then it's determined by a dice roll who should succeed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Order of actions that is Sleep &gt; Block &gt; Consume &gt; Equip &gt; Upgrade &gt; Gaze &gt; Reinforce Wall &gt; Pickup &gt; Drop &gt; Build Wall &gt; Attack&lt;/p&gt;&#xA;&#xA;&lt;p&gt;example: Given an empty tile x. if player a performs pickup at tile x, player b performs drop on tile x, player c performs build on tile x, and player d performs attack on tile x. Then player a does nothing, player b drops an item on tile x. player c does nothing, and player d attacks that item&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input/Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Each round, the following is output to each player for movement and again for action:&#xA;round #, phase, player inventory, player equipment, player buffs, player capacity, attack, block, movement, los, player hp, player line of sight, possibly more?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;e.g.&#xA;14,M,AEEMM,B,P2E3,6,5,1,1,3,19,[{0,1,A},{1,0,R},{1,1,P}]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;indicates:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;round 14&lt;/li&gt;&#xA;&lt;li&gt;currently it's movement phase.&lt;/li&gt;&#xA;&lt;li&gt;player is carrying Armor, 2 * Poisoned? Energy Drink, 2 * Medic Kit&lt;/li&gt;&#xA;&lt;li&gt;player is equipping Binocular&lt;/li&gt;&#xA;&lt;li&gt;player current have a buff of poisoned energy drink with 2 turns remaining, and energy drink with 3 turns remaining&lt;/li&gt;&#xA;&lt;li&gt;player has a maximum of 6 carrying capacity&lt;/li&gt;&#xA;&lt;li&gt;player has an attack of 5&lt;/li&gt;&#xA;&lt;li&gt;player has a block of 1&lt;/li&gt;&#xA;&lt;li&gt;player has a movement of 1&lt;/li&gt;&#xA;&lt;li&gt;player has a line of sight of 3&lt;/li&gt;&#xA;&lt;li&gt;player has a hp of 19&lt;/li&gt;&#xA;&lt;li&gt;player sees the map as shown before&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Each round, 2 inputs will be read from the players&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Movement phase&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;use '^','&amp;lt;','v','&gt;' to indicate movement direction and '.' for stay, if you can move 3 times, output 3 characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;e.g.&#xA;&quot;&amp;lt;.&amp;lt;&quot; indicates you move left, wait then left again&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Action phase&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;output one of the actions listed in game play&lt;/p&gt;&#xA;&#xA;&lt;p&gt;e.g.&#xA;- &quot;E 1&quot; equips the 1st item in your inventory if possible&#xA;- &quot;A 1 2&quot; attacks 1 tile to the right and 2 tile above you if possible.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Determine winner&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;a game ends if only 1 bot is alive or it is played to 1000 turns.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;each each live bot gets 1/&amp;lt;# of bots alive&gt; points&lt;/p&gt;&#xA;&#xA;&lt;p&gt;x games will be played and the points will be totaled to determine the winner.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Additional Information&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Damage is calculated by attack - armor defense. If the defending player used Block, then there is block/10 chance to completely negate all damage.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;All distance are Manhattan distance&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;More items spawn near the center than border (if I can find a way to do this efficiently)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Player can pick roughly where they spawn such as near border or near center (if I can find a way to do this efficiently)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Questions/To-Do list&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Figure out what's a good map size&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Too many/little actions/objects?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Balance items and stats?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is the game clear enough?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is output and input sufficient for the gameplay?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Any suggestions or comments?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Format question so it looks nicer. Make important information stand out. Fix grammer&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Catchy title?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Figure out how many games to play to get winner&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Make it shorter? wall of text is not fun D:&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Figure out how many of each object to spawn&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When player die, randomly drop an item, drop equipped item, drop nothing?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Find time to write the controller&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Figure out how to use the site&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="72836" LastEditorUserId="72836" LastEditDate="2017-07-28T23:35:44.050" LastActivityDate="2017-07-28T23:35:44.050" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13491" PostTypeId="1" AcceptedAnswerId="13573" CreationDate="2017-07-29T01:22:21.323" Score="4" ViewCount="493" Body="&lt;p&gt;&lt;a href=&quot;https://codereview.meta.stackexchange.com/questions/8378/a-friendly-challenge&quot;&gt;The corresponding meta post for code review&lt;/a&gt;, and the &lt;a href=&quot;https://chat.stackexchange.com/rooms/63002/programming-puzzles-and-code-golf-vs-code-review&quot;&gt;chatroom&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Currently the plan is to have each side have a team and build resources and a base. Limited resources. The last team standing wins. Currently the two ideas for &quot;winning&quot; is destroy the other sides artifact or have no respawns and last side standing wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What are your thoughts? &lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="46271" LastEditDate="2017-08-04T20:18:21.603" LastActivityDate="2017-08-04T20:18:21.603" Title="Code review has been challenged to a KOTH battle" Tags="|discussion|" AnswerCount="2" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="13492" PostTypeId="2" ParentId="2140" CreationDate="2017-07-29T02:05:16.080" Score="5" Body="&lt;h1&gt;PPCG VS CR KotH&lt;/h1&gt;&#xA;&lt;h1&gt;I am working as fast as I can to get this ready. Please be patient. I have a real job and will attempt to work on this on vacation to the northern states using mobile. I give no promises.&lt;/h1&gt;&#xA;&lt;p&gt;I challenged CR to a KotH challenge. So here is the specs.&lt;/p&gt;&#xA;&lt;p&gt;Two sides in a arena. 1000x1000. Resources scattered about. A giant area in the center filled with resources. You must build a base and defend your ancient.&lt;/p&gt;&#xA;&lt;p&gt;You have a few kinds of buildings:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Wall: a simple wall that must be broken before walking through. It has &lt;code&gt;1/2/4/8&lt;/code&gt; health (upgrades). It can be changed into a gate.&lt;/li&gt;&#xA;&lt;li&gt;Gate: a gate that lets the side that made it walk through. Health: &lt;code&gt;1/2/2/4&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Turret: Deals &lt;code&gt;1/1/2/4&lt;/code&gt; damage to the lowest health enemy within a &lt;code&gt;1/2/4/4&lt;/code&gt; block radius and has &lt;code&gt;1/1/4/8&lt;/code&gt; health.&lt;/li&gt;&#xA;&lt;li&gt;Resource drop: a place that you can drop resources.  Has &lt;code&gt;2/2/4/6&lt;/code&gt; health.&lt;/li&gt;&#xA;&lt;li&gt;Tower of vision. Gives 10 sight radius with health of five. Costs two resources to build.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Upgrades are &lt;code&gt;1/2/3/4&lt;/code&gt;. The first upgrade is just buying the building.&lt;/p&gt;&#xA;&lt;p&gt;Gates when transformed stay the same level as the wall they started as, can still be upgraded.&lt;/p&gt;&#xA;&lt;p&gt;Every bot starts with five health, one damage, and three sight radius. They can upgrade each by four for the cost of &lt;code&gt;1/2/2/2&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;All upgrades take one bot. It takes &lt;code&gt;1/2/2/3&lt;/code&gt; turns to upgrade an item. The bot must upgrade the item all at once or it must restart and repay the cost. Building a item takes one resource.&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-30T23:05:01.157" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="13493" PostTypeId="2" ParentId="13491" CreationDate="2017-07-29T02:22:24.827" Score="27" Body="&lt;h1&gt;Please remember to be respectful!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I certainly hope I don't have to say this as any more than just a quick friendly reminder, but please remember that even with all of our jokes about Code Review folks being crazy about readability and about them beating us to graduation and getting a design (&lt;em&gt;ahem&lt;/em&gt;), they are all either human beings with feelings or bots that Jon Skeet made when he was bored, and we don't want to offend either.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Joking and playful &quot;insults&quot; is acceptable, but I think I can speak for the community when I say that we don't want this to be any more than a friendly competition. Even if we wish we graduated sooner despite having a better lifetime in beta or that we actually get a design, we're still friends with them after all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I look forward to this competition. I think it will be a great idea and lots of fun, and we might even be able to get to know them better!&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Treat them like you would treat our own community&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We are two separate communities on two separate sites, but we're all a part of StackExchange. Just like you (hopefully) wouldn't break the rules or mess with other bots on our own intrasite KoTHs, &quot;fight&quot; cleanly and respectfully. We don't want another &lt;a href=&quot;https://meta.stackexchange.com/questions/252393/when-something-that-was-supposed-to-be-fun-became-not-fun&quot;&gt;StackEggs&lt;/a&gt; incident, which also happened between the very same two sites.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2017-07-29T02:42:28.117" LastActivityDate="2017-07-29T02:42:28.117" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13494" PostTypeId="1" CreationDate="2017-07-29T02:52:06.577" Score="2" ViewCount="223" Body="&lt;p&gt;I'm planning a challenge, in which players submit a bot (one per player), as in a koth. however, none of the submitted bots play against each other, instead they play against an npc force of alien things. The goal is for the team to survive as long as possible. that is, there is no scoring between the bots (except that there might be data on how long bots lasted. Any attempt to try and have a bot perform better at the cost of the team is degenerate behaviour and not allowed or incentivised in any way)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I wonder whether a &quot;KOTH&quot; with no inter-player competition is regarded as having an objective winning criterion for the purposes of on-topicness, as there is no ranking, just how well the team did?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1917/can-i-post-a-cooperative-challenge-where-there-isnt-a-single-winner&quot;&gt;We've had a discussion on whether cooperative koths on specific teams are acceptable&lt;/a&gt;, so really this post is about whether we can do that where there isn't a dynamic yardstick of another team.&lt;/p&gt;&#xA;" OwnerUserId="55896" LastEditorUserId="55896" LastEditDate="2017-07-29T03:50:44.740" LastActivityDate="2017-07-29T03:56:20.590" Title="is an entirely cooperative koth on topic?" Tags="|discussion|asking-questions|king-of-the-hill|" AnswerCount="2" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="13495" PostTypeId="2" ParentId="13494" CreationDate="2017-07-29T03:04:06.560" Score="-4" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It is possible to distinguish how to perform better, as there is an objective way to judge performance. just like how we don't discourage golfing in languages only used by one person, but do discourage ones that aren't golfed, even though they still are &quot;in first place&quot;, we can still be aiming towards a goal without competing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Theoretically, you could compare it to a set of bots someone else made for another team, and then have it scored as a code challenge, the only difference being that there are not other teams. &lt;/p&gt;&#xA;" OwnerUserId="55896" LastEditorUserId="55896" LastEditDate="2017-07-29T03:56:20.590" LastActivityDate="2017-07-29T03:56:20.590" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13496" PostTypeId="2" ParentId="13494" CreationDate="2017-07-29T03:44:56.860" Score="5" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;One of the site-wide rules that applies to all challenge questions is that they must have an objective winning criterion. Unless that changes, the challenge you propose is indisputably off topic.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-07-29T03:44:56.860" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13499" PostTypeId="2" ParentId="7087" CreationDate="2017-07-29T11:01:32.990" Score="1" Body="&lt;h1&gt;Useful feature&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is most popular tag, and have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5139/leaderboard-snippet&quot;&gt;leaderboard&lt;/a&gt; designed for it.&lt;/p&gt;&#xA;&lt;p&gt;Snippet can be patched to fit &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Pluses&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;One-click addition to challanges. No need to do it manually&lt;/li&gt;&#xA;&lt;li&gt;Snippet updates automatically applies to all challanges.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Minuses&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Platform modification needed&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Demo&lt;/h2&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/yNrT3.png&quot; alt=&quot;demo&quot; /&gt;&lt;/p&gt;&#xA;" OwnerUserId="71612" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-29T11:10:28.083" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13503" PostTypeId="2" ParentId="2140" CreationDate="2017-07-29T18:57:56.037" Score="1" Body="&lt;h1&gt;Proposed Question&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Triskaidekaphobic Primes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It is known that a certain number, which lies between 12 and 14, brings bad luck. The Church of Triskaidekaphobia (CoTDP) asserts that the key to salvation is avoiding this number in all situations, such as numbering &lt;a href=&quot;https://en.wikipedia.org/wiki/Thirteenth_floor&quot; rel=&quot;nofollow noreferrer&quot;&gt;floors&lt;/a&gt;, &lt;a href=&quot;http://www.independent.ie/irish-news/2013-number-plates-to-be-changed-to-avoid-unlucky-13-26890349.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;license plates&lt;/a&gt;, &lt;a href=&quot;http://www.spacepatches.nl/sts_mis/sts13.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;space shuttle missions&lt;/a&gt; and more.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The IT department of CoTDP is looking for talented developers. Candidates must prove their ability to program in accordance with Triskaidekaphobic dogma. Can you get this prestigious job?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Your Mission&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program that prints all prime numbers below 1000, excluding the unlucky one. the program must obey the CoTDP programming rules.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Numbers whose absolute value is greater than 12 and smaller than 14 are considered unlucky and must be avoided.&lt;/li&gt;&#xA;&lt;li&gt;Unlucky numbers must not be used in the program:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Must not appear in the program, in any representation/base.&lt;/li&gt;&#xA;&lt;li&gt;Must not be the value of an expression or calculation (e.g. &lt;code&gt;5 + 8&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Must not be an intermediate value in an expression (e.g. &lt;code&gt;5 + 8 + 3&lt;/code&gt;, &lt;code&gt;35 % 22 == 0&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Must not be stored in a variable, register, memory etc (e.g. &lt;code&gt;for i in xrange(20):&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Must not be passed to a function or returned from one.&lt;/li&gt;&#xA;&lt;li&gt;The above applies to any complex type which contains an unlucky number (e.g. &lt;code&gt;range(20)&lt;/code&gt; in Python 2).&lt;/li&gt;&#xA;&lt;li&gt;The above applies to all expressions, not just constant expressions (e.g. &lt;code&gt;x+1&lt;/code&gt; is invalid if &lt;code&gt;x&lt;/code&gt; happens to be 12).&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;No calculation, or intermediate value of a calculation, may yield an unlucky number. For example,  and &lt;code&gt;for i in xrange(20):&lt;/code&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;Output lines bust be separated by line-feed only (no carriage return).&lt;/li&gt;&#xA;&lt;li&gt;You must find primes using basic mathematical operations. If your language provides tools to find primes or test primality, you must not use them.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/3544&quot;&gt;Standard Loopholes&lt;/a&gt; apply.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;code-golf&lt;/a&gt;, the shortest solution (in bytes) wins.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Questions for Meta&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do the limitations make sense for all sorts of languages? I think they cover languages such as C/Python/Java that use expressions, and also languages such as BrainFuck that manipulate memory (I think it's obvious that you must not write 13 in a memory cell).&lt;/li&gt;&#xA;&lt;li&gt;Is there a trivial solution that makes it uninteresting?&lt;/li&gt;&#xA;&lt;li&gt;Would it be better as a popularity contest?&lt;/li&gt;&#xA;&lt;li&gt;Or maybe, accept the shortest, but give a bounty for the most interesting/creative answer?&lt;/li&gt;&#xA;&lt;li&gt;Can the expression &quot;Church of Triskaidekaphobia&quot; be considered offensive to followers of some churches?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="3544" LastEditorUserId="3544" LastEditDate="2017-07-29T20:35:00.773" LastActivityDate="2017-07-29T20:35:00.773" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="13504" PostTypeId="2" ParentId="7804" CreationDate="2017-07-29T23:37:10.960" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12008/64159&quot;&gt;Tell me my vocabulary words!&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;I personally really like this challenge idea but no one has really understood what I want from it yet, so if you can write a better spec for it than I, go right ahead!&lt;/p&gt;&#xA;" OwnerUserId="64159" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-29T23:37:10.960" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13506" PostTypeId="2" ParentId="2140" CreationDate="2017-07-30T18:27:34.213" Score="5" Body="&lt;h1&gt;Swap the frogs!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given 2 integers &lt;code&gt;N &amp;gt;= 1&lt;/code&gt;, representing left-side frogs, and &lt;code&gt;M &amp;gt;= 1&lt;/code&gt;, representing right-side frogs, return all the steps required so that the frogs change sides with the minimum number of steps. The frogs start with one empty spot between the two sides. A frog can jump to the empty space if there is at most 1 frog from either side between the frog and the empty space. A frog can jump either forwards or backwards.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;An example, with &lt;code&gt;N = 3&lt;/code&gt; and &lt;code&gt;M = 2&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;LLL.RR&#xA;LL.LRR&#xA;LLRL.R&#xA;LLRLR.&#xA;LLR.RL&#xA;L.RLRL&#xA;.LRLRL&#xA;RL.LRL&#xA;RLRL.L&#xA;RLR.LL&#xA;R.RLLL&#xA;RR.LLL&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The corresponding output would be (1-indexed):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[3, 5, 6, 4, 2, 1, 3, 5, 4, 2, 3]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Each one is the index of the column that the frog that must jump is before jumping.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may perform I/O in any reasonable format.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2017-08-08T16:46:04.370" LastActivityDate="2017-08-08T16:46:04.370" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13508" PostTypeId="1" CreationDate="2017-07-30T20:34:10.660" Score="0" ViewCount="50" Body="&lt;p&gt;I did one of the Code Golf challenges this morning in order to practice my C++ ability. However, my code took up significantly more bytes compared to all the other answers. None of the answers were done in C++, so I didn't really have a comparison of what a good answer would look like. Would it have been reasonable to post my solution even though it was clearly wrong. I would like to practice code brevity and efficiency, but am not sure if this is the place to learn or to demonstrate.   &lt;/p&gt;&#xA;" OwnerUserId="72966" LastActivityDate="2017-07-30T20:34:10.660" Title="Can I post clearly losing answers to puzzles with the purpose of receiving suggestions to improve?" Tags="|discussion|" AnswerCount="0" CommentCount="0" ClosedDate="2017-07-30T22:40:09.443" ContentLicense="CC BY-SA 3.0" />
  <row Id="13509" PostTypeId="2" ParentId="13461" CreationDate="2017-07-30T20:46:37.940" Score="-6" Body="&lt;h1&gt;Pop Con-Golf&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Some people would say that the title of this site should be shortened to &lt;s&gt;Programming Puzzles &amp;amp;&lt;/s&gt; Code Golf. They have a good point because 95% of the questions here are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, and the second most popular type of question, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, are usually just a variant on code golf with scoring that is not purely based on byte count (usually &lt;code&gt;byte count/modifier&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So if you agree that the main spirit of this site is code golf, maybe we need to apply the golfing philosophy to make &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; suitable for this site. Some questions require human judgement to discern the best answer. To respond to the comment, &quot;Popularity contests aren't competitions,&quot; are pie-baking contests, where tasters vote on their favorite pie, not competitions?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To make a long story short, all I'm suggesting is placing difficult byte-count limits on pop con questions, in order to bring the golfing spirit to pop cons. Some say that this overly disadvantages non-golfing languages, however those have more access to libraries, which are often much needed in pop cons.&lt;/p&gt;&#xA;" OwnerUserId="46313" LastActivityDate="2017-07-30T20:46:37.940" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13510" PostTypeId="1" AcceptedAnswerId="13511" CreationDate="2017-07-30T21:23:28.980" Score="13" ViewCount="372" Body="&lt;p&gt;A user (who's not particularly new, yet I'd never noticed him until about a week ago) has been posting excessive comments. I don't mean excessive comments like &lt;a href=&quot;https://codegolf.stackexchange.com/q/76604/61563&quot;&gt;mine here&lt;/a&gt;, I mean excessive comments along the lines of...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;Whoa, how is this even possible?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;Is this ever going to end?????&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;You got my name right!!!1!!1!11! :D  &amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; (x5)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;These comments in small numbers don't seem to be a problem. But when a user begins commenting on more or less every post in a thread, it gets a little obnoxious. When a user has something to say - not constructive, not destructive, just noise - about 50% of the answers he sees, I don't think anyone appreciates it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've asked this user to stop, and I was ignored. I won't link to his profile for obvious reasons. He has posted 80 comments in the last two days, ten of which I noticed without seeking them out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This behavior clearly doesn't warrant a ban/suspension/privilege-revoke, so what can be done?&lt;/p&gt;&#xA;" OwnerUserId="61563" LastEditorUserId="61563" LastEditDate="2017-07-30T21:48:35.613" LastActivityDate="2017-07-30T22:16:48.863" Title="What to do about a user excessively posting useless comments?" Tags="|discussion|new-users|comments|users|spam|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13511" PostTypeId="2" ParentId="13510" CreationDate="2017-07-30T22:16:48.863" Score="16" Body="&lt;p&gt;Flag the comments as &quot;no longer needed&quot; as you see them. If they're really getting out of hand, flag them for moderator attention with details about how this is becoming a frequent problem with the users. The moderators will take action as they see necessary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For what it's worth, spamming useless comments is grounds for a suspension in my opinion.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-07-30T22:16:48.863" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="13517" PostTypeId="2" ParentId="2140" CreationDate="2017-07-31T14:00:47.447" Score="1" Body="&lt;h1&gt;Encrypt/Decrypt a Decimal in Binary&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given either a positive integer &lt;code&gt;a&lt;/code&gt; or two positive integers &lt;code&gt;b&lt;/code&gt; and &lt;code&gt;c&lt;/code&gt;, either encrypt or decrypt the integer(s).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Encryption&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given &lt;code&gt;a=33344492&lt;/code&gt;, for example:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Split &lt;code&gt;a&lt;/code&gt; into consecutive runs: &lt;code&gt;[333,444,9,2]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Replace all runs with alternating 1's and 0's starting with 1: &lt;code&gt;[111,000,1,0]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Place back into binary: &lt;code&gt;11100010&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Convert to decimal: &lt;code&gt;226&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Calculate decryption key: &lt;code&gt;3492&lt;/code&gt; &#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This key is the unique characters from each distinct run.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Return &lt;code&gt;[226, 3492]&lt;/code&gt; as the answer, these represent &lt;code&gt;[b, c]&lt;/code&gt; respectively.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Decryption&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given &lt;code&gt;b=226&lt;/code&gt; and &lt;code&gt;c=3492&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Convert &lt;code&gt;b&lt;/code&gt; into binary: &lt;code&gt;11100010&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Use &lt;code&gt;c&lt;/code&gt; to &quot;replace&quot; in each character.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;11100010 -&amp;gt; 33300010 -&amp;gt; 33344410 -&amp;gt; 33344490 -&amp;gt; 33344492&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Print the single integer answer, &lt;code&gt;a=33344492&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;More Examples (For Decryption, Reverse Examples)&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;12349149&#xA;[170,12349149]&#xA;&#xA;99922211100&#xA;[1820,9210]&#xA;&#xA;2&#xA;[1,2]&#xA;&#xA;9&#xA;[1,9]&#xA;&#xA;10&#xA;[2,10]&#xA;&#xA;100&#xA;[4,10]&#xA;&#xA;0&#xA;[1,0]&#xA;&#xA;1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111&#xA;[10141204801825835211973625643007,1]&#xA;&#xA;111222333444555666777888999000&#xA;[954437176,1234567890]&#xA;&#xA;10101010101010&#xA;[10922, 10101010101010]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="59376" LastEditDate="2017-07-31T14:52:17.547" LastActivityDate="2017-07-31T14:52:17.547" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="13521" PostTypeId="2" ParentId="13029" CreationDate="2017-07-31T20:57:39.450" Score="8" Body="&lt;h2&gt;No, we already have a definition&lt;/h2&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1325/42963&quot;&gt;community consensus&lt;/a&gt; definition of &amp;quot;Random&amp;quot; doesn't include using a time source directly, so unless explicitly allowed, that would fall under a loophole.&lt;/p&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-07-31T20:57:39.450" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13522" PostTypeId="2" ParentId="2140" CreationDate="2017-07-31T22:05:14.680" Score="1" Body="&lt;h1&gt;Generate a Spiral Matrix&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Related: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/769/print-nxn-spiral-of-ascending-numbers&quot;&gt;Print NxN spiral of ascending numbers&lt;/a&gt; - This challenge is meant to replace that old challenge by covering all spiral matrices.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Given &lt;code&gt;N&lt;/code&gt;, generate one out of all the spiral matrices with dimensions &lt;code&gt;N x N&lt;/code&gt; using the values &lt;code&gt;[0, 1, ..., n-1]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if &lt;code&gt;N = 5&lt;/code&gt;, there are 16 ways to generate a spiral matrix&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 0  1  2  3  4    12 13 14 15  0     8  9 10 11 12     4  5  6  7  8&#xA;15 16 17 18  5    11 22 23 16  1     7 20 21 22 13     3 18 19 20  9&#xA;14 23 24 19  6    10 21 24 17  2     6 19 24 23 14     2 17 24 21 10&#xA;13 22 21 20  7     9 20 19 18  3     5 18 17 16 15     1 16 23 22 11&#xA;12 11 10  9  8     8  7  6  5  4     4  3  2  1  0     0 15 14 13 12&#xA;&#xA; 0 15 14 13 12     4  3  2  1  0     8  7  6  5  4    12 11 10  9  8&#xA; 1 16 23 22 11     5 18 17 16 15     9 20 19 18  3    13 22 21 20  7&#xA; 2 17 24 21 10     6 19 24 23 14    10 21 24 17  2    14 23 24 19  6&#xA; 3 18 19 20  9     7 20 21 22 13    11 22 23 16  1    15 16 17 18  5&#xA; 4  5  6  7  8     8  9 10 11 12    12 13 14 15  0     0  1  2  3  4&#xA;&#xA;24 23 22 21 20    12 11 10  9 24    16 15 14 13 12    20 19 18 17 16&#xA; 9  8  7  6 19    13  2  1  8 23    17  4  3  2 11    21  6  5  4 15&#xA;10  1  0  5 18    14  3  0  7 22    18  5  0  1 10    22  7  0  3 14&#xA;11  2  3  4 17    15  4  5  6 21    19  6  7  8  9    23  8  1  2 13&#xA;12 13 14 15 16    16 17 18 19 20    20 21 22 23 24    24  9 10 11 12&#xA;&#xA;24  9 10 11 12    20 21 22 23 24    16 17 18 19 20    12 13 14 15 16&#xA;23  8  1  2 13    19  6  7  8  9    15  4  5  6 21    11  2  3  4 17&#xA;22  7  0  3 14    18  5  0  1 10    14  3  0  7 22    10  1  0  5 18&#xA;21  6  5  4 15    17  4  3  2 11    13  2  1  8 23     9  8  7  6 19&#xA;20 19 18 17 16    16 15 14 13 12    12 11 10  9 24    24 23 22 21 20&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You are allowed to use a parameter &lt;code&gt;P&lt;/code&gt; to determine which out of the 16 spiral matrices you will generate.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so make your code as short as possible.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;N &amp;gt;= 1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The parameter &lt;code&gt;P&lt;/code&gt; should be a value such as a number, character, or any other reasonably simple value.&lt;/li&gt;&#xA;&lt;li&gt;You may output the spiral matrix as a 2d array of numbers or characters, a formatted string, or any other easily understandable format.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="6710" LastActivityDate="2017-07-31T22:05:14.680" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13527" PostTypeId="1" AcceptedAnswerId="13528" CreationDate="2017-08-01T05:03:48.260" Score="-7" ViewCount="135" Body="&lt;p&gt;As the title says, are questions about the PPCG Minecraft server allowed on the meta site?&lt;/p&gt;&#xA;" OwnerUserId="53551" LastEditorDisplayName="user58826" LastEditDate="2017-08-01T10:40:14.627" LastActivityDate="2017-08-01T10:40:14.627" Title="Are OPPCGMCS questions allowed on meta?" Tags="|support|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13528" PostTypeId="2" ParentId="13527" CreationDate="2017-08-01T05:14:01.260" Score="8" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Meta's off topic close reason states&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This question does not appear to be about Programming Puzzles &amp;amp; Code Golf Stack Exchange or the software that powers the Stack Exchange network within the scope defined in the help center.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;and the only relation the PPCG Minecraft server bears to PPCG is its name.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-08-01T05:14:01.260" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13531" PostTypeId="2" ParentId="2140" CreationDate="2017-08-01T13:16:04.310" Score="1" Body="&lt;h1&gt;Interpret a Maximal Number of Brainf*** Variants&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brainfuck&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brainfuck&amp;#39;&quot; rel=&quot;tag&quot;&gt;brainfuck&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/message/39124258#39124258&quot;&gt;A while ago in chat&lt;/a&gt;, I had an idea:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/raie0.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/raie0.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;It was prompty shot down as impossible. Because of that, I'm making it a challenge!&lt;/p&gt;&#xA;&lt;h1&gt;Valid Languages&lt;/h1&gt;&#xA;&lt;p&gt;The only valid brainfuck variants you can use are the languages appearing on &lt;a href=&quot;https://web.archive.org/web/20170703051845/http://esolangs.org/wiki/Category:Brainfuck_derivatives&quot; rel=&quot;nofollow noreferrer&quot;&gt;this link&lt;/a&gt; and &lt;a href=&quot;https://web.archive.org/web/20170703100409/http://esolangs.org/wiki/Category:Brainfuck_equivalents&quot; rel=&quot;nofollow noreferrer&quot;&gt;this link&lt;/a&gt; (along with regular brainfuck, of course). Those two links are July 3rd, 2017 captures of the esolangs.org pages for brainfuck derivatives and brainfuck equivalents.&lt;/p&gt;&#xA;&lt;h1&gt;The Task&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to create &lt;strong&gt;one&lt;/strong&gt; program that, when fed code from any variant of brainfuck you say you can interpret, along with input for that program, will execute that code according to the spec of that variant. &lt;em&gt;You cannot tell the interpreter beforehand what variant it is supposed to interpret.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;There is one very important note: in brainfuck, for example, all characters not used are ignored as comments. Any program that is entered will not contain comments. &lt;strong&gt;All input will &lt;em&gt;only&lt;/em&gt; contain characters that are not ignored by the spec&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Knowing this, if two variants of brainfuck overlap enough that you cannot differentiate between two valid, however short, programs in them, and if each language wants a different result, you can only include one of those languages.&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;The most important part of this challenge is maximizing the number of variants you can support. However, you also don't want to make it &lt;em&gt;too&lt;/em&gt; long. Therefore, the following is your score:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;(variantsSupported * 300) - interpreterBytes&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;em&gt;Highest score wins.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="65836" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-01T17:20:03.477" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13536" PostTypeId="2" ParentId="2140" CreationDate="2017-08-01T19:45:42.793" Score="1" Body="&lt;h1&gt;Is this 2048 board valid?&lt;/h1&gt;&#xA;&lt;p&gt;Some 2048 boards are impossible to get into.  For example,&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2 _ _ 2&#xA;_ _ _ _&#xA;_ _ _ _&#xA;2 _ _ 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;will never occur in a 2048 game.  Additionally, these are all impossible:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;8 _ _ 8    8 _ _ _    2 2 2 2&#xA;_ _ _ _    _ 8 _ _    2 2 _ _&#xA;_ _ _ _    _ _ _ _    _ _ _ _&#xA;8 _ _ _    _ _ _ _    _ _ _ _&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your program needs to accept a 2048 board, and return a truthy value if the board is reachable, else falsy.&lt;/p&gt;&#xA;&lt;p&gt;//Explanation of 2048 goes here.&lt;/p&gt;&#xA;&lt;p&gt;I've listed 4 different boards that cover major test cases.  Are there any others I'm missing?&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-01T19:45:42.793" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13538" PostTypeId="2" ParentId="2140" CreationDate="2017-08-01T21:35:48.353" Score="0" Body="&lt;h1&gt;Comparing Strings&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;You will be given two non-empty strings containing printable ASCII. If their contents are exactly the same, output their contents. If their contents are different, output a third string. &lt;strong&gt;This third string cannot be a substring of either string, and neither string can be a substring of it.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&lt;p&gt;Test cases are quoted to show they are strings. Outputs marked with &lt;code&gt;*&lt;/code&gt; indicate they are one of infinitely many possible outputs.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;input, input -&amp;gt; output&#xA;&#xA;&amp;quot;test&amp;quot;, &amp;quot;test&amp;quot; -&amp;gt; &amp;quot;test&amp;quot;&#xA;&amp;quot;do&amp;quot;, &amp;quot;don't&amp;quot; -&amp;gt; &amp;quot;dnut&amp;quot;*&#xA;&amp;quot;ye s&amp;quot;, &amp;quot;yes&amp;quot; -&amp;gt; &amp;quot;false&amp;quot;*&#xA;&amp;quot;yes&amp;quot;, &amp;quot;yes&amp;quot; -&amp;gt; &amp;quot;yes&amp;quot;&#xA;&amp;quot;maybe&amp;quot;, &amp;quot;mayue&amp;quot; -&amp;gt; &amp;quot;false&amp;quot;*&#xA;&amp;quot;false&amp;quot;, &amp;quot;false&amp;quot; -&amp;gt; &amp;quot;false&amp;quot;&#xA;&amp;quot;false&amp;quot;, &amp;quot;true&amp;quot; -&amp;gt; &amp;quot;fatr&amp;quot;*&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The inputs will be composed of only printable ASCII - that is, space to tilde. Your output should also be composed of only printable ASCII, but a trailing newline is allowed.&lt;/li&gt;&#xA;&lt;li&gt;Your algorithm may not make any assumption about the length of the inputs, except that they will not be empty.&lt;/li&gt;&#xA;&lt;li&gt;The output must be valid with probability 1; that is, you may generate random strings until one is valid, but you can't just output a random string and hope it's valid. &lt;a href=&quot;https://codegolf.stackexchange.com/q/123539/65836&quot;&gt;Source&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Trailing newlines in output allowed (otherwise there will be no newlines - newlines are not in printable ASCII).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="65836" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-02T12:32:13.430" CommentCount="28" ContentLicense="CC BY-SA 3.0" />
  <row Id="13543" PostTypeId="2" ParentId="12877" CreationDate="2017-08-02T01:52:22.860" Score="9" Body="&lt;h1&gt;Also, ad hoc languages only hurt the ad hoc-er, not the community&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Another point is this. The whole idea behind competitions on this site is not to determine who is the Best or the Smartest. It's to give individuals a hurdle to leap over, so that they can maybe learn something new or even just exercise the ol' gray cells. If a person decides to make a new language with a built-in single-byte command to solve a challenge, they willingly take that hurdle away from themself. That's their own problem, not the community's.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Perhaps all answers could be required to show the date of the last update of the language they're using?&lt;/p&gt;&#xA;" OwnerUserId="72649" LastActivityDate="2017-08-02T01:52:22.860" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13545" PostTypeId="2" ParentId="13461" CreationDate="2017-08-02T08:56:09.430" Score="-6" Body="&lt;h1&gt;Let's encourage people to make pop-cons&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Wheat Wizard made some good points in his follow-up answer.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Most people are probably here because they like programming and these competitions are a great way to program with a community. In this way popularity contests appeal to the core demographic, they are about programming. Often times they are even real world tasks, like patch the image. If you were here just for programming, popularity contests would probably be the best tag for you.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;As stated above, popularity contests could appeal to a large group of users. Wheat Wizard continues to argue that while many like pop-cons, they are off-topic. But that's not true: no one tells us what is off-topic, but we ourselves decide it here at meta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I know that there are also many who don't want to see pop-cons, and that is fine. Simply &lt;strong&gt;don't open or answer pop-con questions, if you don't like them.&lt;/strong&gt; Not liking is not a reason to ban the fun for all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yes, some answers are low-quality, but is that really a reason to ban all questions? Bad answers should be down-voted, but I don't even think that they should be deleted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When the code-trolling question were forbidden, it was argued that they create negative reputation for the site. I agree that code-trolling was kind of stupid, but most popularity contests are not: majority of them are clever and inspire users to create beautiful answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Popularity contests are a great way to show creativity and skills. Allowing them is not away from anyone, and does not harm anyone. Code-golfers can golf and so on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;We should encourage people to make pop-cons&lt;/strong&gt;, even if some of them end up to be bad. The more we create them, the more easy should it become. I would like to see in future that both new and experienced users ask pop-con questions with low threshold.&lt;/p&gt;&#xA;" OwnerUserId="66323" LastActivityDate="2017-08-02T08:56:09.430" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="13546" PostTypeId="2" ParentId="2140" CreationDate="2017-08-02T15:50:58.947" Score="6" Body="&lt;h1&gt;PPCG Handwriting OCR &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(insert logo here once I make it)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an image consisting of handwritten text, output the text that is written. The image of the handwritten text will be generated by taking characters from one or more handwriting samples given by PPCG users.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may not hardcode your program to only recognize the samples in the corpus.&lt;/li&gt;&#xA;&lt;li&gt;There will be sufficient spacing between characters to avoid ambiguity.&lt;/li&gt;&#xA;&lt;li&gt;Only ASCII alphanumeric characters (those matching the regex &lt;code&gt;[A-Za-z0-9]&lt;/code&gt;, i.e. uppercase and lowercase English letters and digits) will be present in the input.&lt;/li&gt;&#xA;&lt;li&gt;Inputs will be formed by concatenating individual characters from the handwriting samples.&lt;/li&gt;&#xA;&lt;li&gt;The test cases used for scoring may be modified at any point if I feel it is necessary to do so. Reasons may include but are not limited to: needing more test cases to have a single winner, removing problematic test cases, and fixing errors in test cases.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Aside from the above considerations, there are no guarantees on the appearance of the handwriting, as these are actual handwriting samples and thus can have drastic variances.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Score&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your score will be the number of test cases that are correctly recognized, divided by the total number of test cases. The highest score wins. In the event of a tie, the first submission to reach the high score wins. Additional test cases may be added to break ties.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Handwriting Samples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/cNhb2.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;This Imgur album&lt;/a&gt; contains the handwriting samples, as well as the names of the users who contributed them.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/63159/ppcg-handwriting-ocr-challenge&quot;&gt;I've made a chat room for submitting handwriting samples&lt;/a&gt;. The more samples I get, the better this challenge will be, so please take a few minutes and submit a sample!&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2017-08-02T15:58:25.117" LastActivityDate="2017-08-02T15:58:25.117" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="13549" PostTypeId="1" CreationDate="2017-08-02T21:12:25.027" Score="-9" ViewCount="145" Body="&lt;p&gt;As per &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12877/61563&quot;&gt;Let&amp;#39;s allow newer languages/versions for older challenges&lt;/a&gt;, we no longer need to mark answers that utilize languages created after the challenge as noncompeting. However, there are still &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=%22non+competing%22&quot;&gt;917&lt;/a&gt; + &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=%22noncompeting%22&quot;&gt;207&lt;/a&gt; = 1124 answers with that word in the body or header.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think they should be removed as they add nothing of value and are just an eyesore. However, I'm not going to do it all in big chunks by myself as I don't want a re-do of my Sandbox flood a while ago. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12877/lets-allow-newer-languages-versions-for-older-challenges#comment44568_12877&quot;&gt;And Martin told me not to.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, can we set up a time or date when people can go through all the instances of &quot;noncompeting&quot;, &quot;non-competing&quot; and &quot;non competing&quot; on the site, finding which answers need to be deleted (as some users mark invalid answers noncompeting) and which ones simply need the word removed?&lt;/p&gt;&#xA;" OwnerUserId="61563" LastEditorUserId="61563" LastEditDate="2017-08-02T21:20:02.493" LastActivityDate="2018-03-12T01:51:34.963" Title="Remove noncompeting status from all submissions" Tags="|discussion|support|editing|noncompeting|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="13551" PostTypeId="1" CreationDate="2017-08-02T21:16:31.853" Score="6" ViewCount="366" Body="&lt;p&gt;Recently a &lt;a href=&quot;https://codereview.meta.stackexchange.com/q/8378/31562&quot;&gt;Friendly Challenge&lt;/a&gt; was posted on Code Review Meta where PPCG challenged Code Review.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The post on Code Review Meta says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I am planning on hosting a King of the Hill challenge Programming Puzzles and Code Golf VS. Code Review.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This challenge got me thinking: Is it okay to post a challenge on PPCG where only some people are &quot;allowed&quot; to participate?&lt;/p&gt;&#xA;" OwnerUserId="18865" LastActivityDate="2017-08-02T22:25:19.207" Title="Is it OK to post restricted challenges where only some people may participate?" Tags="|discussion|asking-questions|challenges|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13552" PostTypeId="2" ParentId="13551" CreationDate="2017-08-02T21:21:42.270" Score="24" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There is absolutely no benefit to restricting a question to users of a certain type.  This is would only serve to make users who are not allowed to participate unhappy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However,  I do think it is perfectly fine to separate users into separate categories, as was done in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/48353/red-vs-blue-pixel-team-battlebots&quot;&gt;Red vs. Blue&lt;/a&gt;.  As long as the categories are properly symmetric, such that users on both sides are treated with the same challenge.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-08-02T21:21:42.270" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13553" PostTypeId="2" ParentId="13551" CreationDate="2017-08-02T22:25:19.207" Score="9" Body="&lt;p&gt;If you are talking about specific &lt;strong&gt;users&lt;/strong&gt; then:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;If you are talking about users with a &lt;strong&gt;&lt;a href=&quot;http://s2.quickmeme.com/img/29/2929bc25a08c05be8582a16599ca2e57fe9b960da86de991d84c50b4c7540228.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;particular set of skills&lt;/a&gt;&lt;/strong&gt;, then it's a bit more nuanced. It's frowned upon (for good reasons) to only allow certain languages in &quot;normal challenges&quot;, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, if the challenge is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;-challenge then it makes sense to only allow submissions in for instance Java or JavaScript. Such a restriction will leave many of us out of the competition, unless we're willing to put in the effort to learn a new language.&lt;/p&gt;&#xA;" OwnerUserId="31516" LastActivityDate="2017-08-02T22:25:19.207" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13554" PostTypeId="2" ParentId="13549" CreationDate="2017-08-03T02:26:49.217" Score="11" Body="&lt;h1&gt;Please Don't&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Correct me if I'm wrong, but how often do really old posts show up on the front page? Unless you keep editing them, not very often. So, now that the new decree has been set in place, let's just ignore the old posts and apply the policy to the new ones. I'm not saying that you're not allowed to edit a single post, but don't go looking through all of the posts to do this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, flooding the front page at a set time where everyone knows what's going on is &lt;a href=&quot;https://www.youtube.com/watch?v=zGl796352RI&quot; rel=&quot;nofollow noreferrer&quot;&gt;still a bad idea&lt;/a&gt;. It will bury potentially good posts that nobody will see while the front page is being flooded. It would be a nuisance because you get notified when someone edits your post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, instead of looking for old posts that aren't really even seen anymore and making them seen, flooding the front page, and placing otherwise useless edits, just apply the policy to new answers and don't go looking for old ones.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2017-08-03T02:26:49.217" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13555" PostTypeId="2" ParentId="2140" CreationDate="2017-08-03T07:18:51.943" Score="0" Body="&lt;h1&gt;Can you generate this random sequence for me?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://retrocomputing.stackexchange.com/questions/4416/how-did-commodores-anti-microsoft-easter-egg-work&quot;&gt;Inspired by this question on Retrocomputing&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I want to create a random generator that always returns a desired word. I desperately need this so I can hide some easter eggs. For &lt;s&gt;science&lt;/s&gt; easter!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A word, either in string format or an array or vector of characters. You can assume all lowercase and only the regular characters &lt;code&gt;a-z&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a full program or function that finds a seed such that when taking a random sample of letters, the desired word is output. The function then should return or save another full program or function that does the generating of this desired word.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The returned function of program should use random sampling to create the output, so it is not allowed to hardcode (&lt;a href=&quot;https://xkcd.com/221/&quot; rel=&quot;nofollow noreferrer&quot;&gt;obligatory XKCD&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;The output can be written to file in the case of a full program or returned.&lt;/li&gt;&#xA;&lt;li&gt;Hiding an easter eggs is easiest when there is little code, so the shortest code wins.&lt;/li&gt;&#xA;&lt;li&gt;If there is no seed that generates the required output, your program is allowed to run forever.&lt;/li&gt;&#xA;&lt;li&gt;Standard codegolf rules and loopholes apply.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example implementation:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; f &amp;lt;- function(string){&#xA;+     seed &amp;lt;- 1&#xA;+     set.seed(seed)&#xA;+     repeat{&#xA;+         seed &amp;lt;- seed + 1&#xA;+         set.seed(seed)&#xA;+         if(all(sample(letters, length(string), replace = TRUE) == string)){&#xA;+             break&#xA;+         }&#xA;+     }&#xA;+     generator &amp;lt;- function(){&#xA;+         set.seed(seed)&#xA;+         sample(letters, length(string), replace = TRUE)&#xA;+     }&#xA;+     return(generator)&#xA;+ }&#xA;&amp;gt; f(&quot;a&quot;)&#xA;function(){&#xA;        set.seed(seed)&#xA;        sample(letters, length(string), replace = TRUE)&#xA;    }&#xA;&amp;lt;bytecode: 0x000000001c83f2d8&amp;gt;&#xA;&amp;lt;environment: 0x000000001f906c20&amp;gt;&#xA;&amp;gt; g=f(&quot;a&quot;)&#xA;&amp;gt; g()&#xA;[1] &quot;a&quot;&#xA;&amp;gt; g()&#xA;[1] &quot;a&quot;&#xA;&amp;gt; g()&#xA;[1] &quot;a&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="59530" LastEditorUserId="59530" LastEditDate="2017-08-03T07:28:27.227" LastActivityDate="2017-08-03T07:28:27.227" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13556" PostTypeId="1" CreationDate="2017-08-03T09:35:13.023" Score="6" ViewCount="114" Body="&lt;p&gt;I just noticed that PPCG now has Code Review's icon in some areas of SE. I'm pretty sure this is a &lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt; since I can't find any discussion related to it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Basically the problem seems to appear wherever &lt;a href=&quot;https://cdn.sstatic.net/img/favicons-sprite16.png?v=0b5182b5ddfc&quot; rel=&quot;nofollow noreferrer&quot;&gt;the site sprite sheet&lt;/a&gt; is used. Looking closer, it seems that every site's icon is off by two (one site + one meta).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Update:&lt;/strong&gt; Looking at the &lt;a href=&quot;https://cdn.sstatic.net/Sites/codegolf/all.css?v=2f76593bf94d&quot; rel=&quot;nofollow noreferrer&quot;&gt;stylesheet&lt;/a&gt; and &lt;a href=&quot;https://cdn.sstatic.net/img/favicons-sprite16.png?v=0b5182b5ddfc&quot; rel=&quot;nofollow noreferrer&quot;&gt;sprite sheet&lt;/a&gt; the problem seems to be that the version of the sprite sheet I'm seeing has no icons for &lt;a href=&quot;https://augur.stackexchange.com/&quot;&gt;Augur&lt;/a&gt;. Version mismatch?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Update 2:&lt;/strong&gt; Seems to be fixed. Anyone still experiencing this?&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Top bar menus&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/cyOCv.png&quot; alt=&quot;stackexchange menu&quot;&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/rQ687.png&quot; alt=&quot;inbox&quot;&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/FPj66.png&quot; alt=&quot;achievements&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sidebar hot questions&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/4DpDE.png&quot; alt=&quot;sidebar hot questions&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;User communities list&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/yxCib.png&quot; alt=&quot;community list&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Things not affected&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;So far I haven't seen this anywhere else, including the favicon, &lt;a href=&quot;https://stackexchange.com/&quot;&gt;the global hot question list&lt;/a&gt; and &lt;a href=&quot;https://stackexchange.com/sites#&quot;&gt;the site list&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="30164" LastEditorUserId="68942" LastEditDate="2021-06-04T14:06:21.617" LastActivityDate="2021-06-04T14:06:21.617" Title="Site icons being messed up" Tags="|bug|status-completed|" AnswerCount="0" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="13558" PostTypeId="1" CreationDate="2017-08-03T14:07:41.873" Score="9" ViewCount="266" Body="&lt;p&gt;I noticed a bunch of edits showing up in the edits queue where the usual javascript leaderboard is added to challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/76379/a-simple-tcp-server&quot;&gt;Example&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/110974/blink-the-caps-lock&quot;&gt;Example&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think the leaderboards are fine, but do we really need to add these to challenges that have been inactive for quite some while?&lt;/p&gt;&#xA;" OwnerUserId="59530" LastActivityDate="2017-08-04T20:50:17.127" Title="Do we need leaderboards on all challenges?" Tags="|discussion|" AnswerCount="1" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="13559" PostTypeId="2" ParentId="13558" CreationDate="2017-08-03T14:17:37.707" Score="19" Body="&lt;h1&gt;Not &lt;em&gt;all&lt;/em&gt; challenges require leaderboards&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The reason leaderboards are used at all is to find answers based on byte count, based on language, based on user, etc.. Finding answers is not a big problem on challenges that only have a page's worth of answers or less.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, challenges with over 30 answers can get clunky to search for answers in. In that case, when the challenge was posted does not matter as either way, a leaderboard is useful.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, I am not saying we need to put a leaderboard on every challenge stat. If you're going to edit leaderboards in, be considerate of how you're going to be bumping it to the home page. Don't bump dozens of old challenges just for this purpose. A good way of going about this is putting a leaderboard on a challenge if you are about to answer it, in which case it will be useful to you and others as they come in later.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &quot;popularity&quot; of a challenge is also a factor. Note that this is slightly subjective. Before you stick a leaderboard on a challenge, think about whether the challenge is something that will be searched often.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's a possibility that every challenger could include a leaderboard. While I do not currently see any disadvantages to this, I'm not sure if the community would agree.&lt;/p&gt;&#xA;" OwnerUserId="68615" LastEditorUserId="68615" LastEditDate="2017-08-04T20:50:17.127" LastActivityDate="2017-08-04T20:50:17.127" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="13560" PostTypeId="2" ParentId="13468" CreationDate="2017-08-03T16:56:25.880" Score="-1" Body="&lt;h1&gt;Yes, we should allow showcases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I see no problem with showcase questions. We already have the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44680/showcase-of-languages&quot;&gt;showcase of languages&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/6918/what-programming-languages-have-been-created-by-ppcg-users&quot;&gt;this meta question&lt;/a&gt; and they certainly have been well-received. However, their scope is very broad (maybe too broad), and having specific showcases for different kind of problems could be a good improvement.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The showcase questions would in no way harm the site. On the contrary, they provide information that interests our audience. I think that we should develop to be something more than &quot;just a code-golf site&quot;, and showcases could be one step.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are already sites like Rosetta Code which serve a similar purpose, but it doesn't mean that we couldn't also have showcases. There are also golfing sites other than PPCG, and that doesn't mean that we should disallow golfing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Frankly, I cannot come up with any argument against showcase questions, except that they are somehow &quot;off-topic&quot;, but that is not really an argument. We can decide what is on-topic and off-topic here, that's the whole point of this discussion. Saying that they are off-topic because they are off-topic is certainly absurd.&lt;/p&gt;&#xA;" OwnerUserId="66323" LastEditorUserId="66323" LastEditDate="2017-08-03T17:06:57.237" LastActivityDate="2017-08-03T17:06:57.237" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13561" PostTypeId="2" ParentId="2140" CreationDate="2017-08-03T17:10:01.350" Score="-2" Body="&lt;h1&gt;Output the infinite sequence of middle positions of odd square numbers &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;As everyone knows, every odd square number has an element at its central position — I represent those central elements as an *:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;n=1 =&amp;gt; 1&#xA;*&#xA;&#xA;n=9 =&amp;gt; 5&#xA;###&#xA;#*#&#xA;###&#xA;&#xA;n=25 =&amp;gt; 13&#xA;#####&#xA;#####&#xA;##*##&#xA;#####&#xA;#####&#xA;&#xA;n=49 =&amp;gt; 25&#xA;#######&#xA;#######&#xA;#######&#xA;###*###&#xA;#######&#xA;#######&#xA;#######&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The challenge consists on output the sequence &lt;code&gt;1, 5, 13, 25, ...&lt;/code&gt; uninterruptedly. The separator does not need to be a comma, but use the same separator always.&lt;/p&gt;&#xA;&lt;p&gt;There will not be any accepted answer, except if I see some very creative answer. There will be a winner for each language (I will steal Leader board code somewhere)&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="29325" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-03T17:10:01.350" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13562" PostTypeId="2" ParentId="2140" CreationDate="2017-08-03T17:19:22.980" Score="-2" Body="&lt;h1&gt;Hello, Quine! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hello-world&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hello-world&amp;#39;&quot; rel=&quot;tag&quot;&gt;hello-world&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to write a program which, if given an input of &amp;quot;Hello,&amp;quot; will output &amp;quot;Hello, world!&amp;quot;, if given any other input, it will output its source code.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input does not have to be case-sensitive.&lt;/li&gt;&#xA;&lt;li&gt;Your program may &lt;em&gt;not&lt;/em&gt; contain the string &amp;quot;Hello, world!&amp;quot; or any variation with different cases of letters (i.e &amp;quot;hELLO, WORLD!&amp;quot;, &amp;quot;HeLlO, WoRlD!&amp;quot;, and &amp;quot;hello, world!&amp;quot;).&lt;/li&gt;&#xA;&lt;li&gt;No &amp;quot;cheating quines.&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are &lt;em&gt;strictly forbidden&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so may the shortest code win and the best programmer prosper...&lt;/p&gt;&#xA;" OwnerUserId="64706" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-03T17:40:47.197" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13564" PostTypeId="2" ParentId="2140" CreationDate="2017-08-03T19:30:45.760" Score="-1" Body="&lt;h1&gt;Hungry for Apples?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Zn4x9.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Zn4x9.jpg&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This challenge is simple, given an integer &lt;code&gt;0 &amp;lt;= n&lt;/code&gt; or &lt;code&gt;0 &amp;lt; n&lt;/code&gt;, output an ASCII-apple with that many bites taken out of it.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;No bites (0):&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;         //&#xA;     .-.:|.-.&#xA;   .'   ''   '.&#xA;   ;          ;&#xA;  :            :&#xA;  :            :&#xA;  :            :&#xA;   :          ;&#xA;   '.        :&#xA;     '-_.._-'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Bite 1:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;         //&#xA;     .-.:|.-.&#xA;   .'   ''   '.&#xA;   ;          ;&#xA;   '-.         :&#xA;     }         :&#xA;   .-'         :&#xA;   :          ;&#xA;   '.        :&#xA;     '-_.._-'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Bite 2:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;         //&#xA;     .-.:|.-.&#xA;   .'   ''   '.&#xA;   '-.        ;&#xA;     }         :&#xA;     }         :&#xA;     }         :&#xA;   .-'        ;&#xA;   '.        :&#xA;     '-_.._-'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Bite 3:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;         //&#xA;     .-.:|.-.&#xA;   .'   ''   '.&#xA;   '-.        ;&#xA;     }      .-'&#xA;     }      {&#xA;     }      '-.&#xA;   .-'        ;&#xA;   '.        :&#xA;     '-_.._-'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Bite 4:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;         //&#xA;     .-.:|.-.&#xA;   .'   ''   '.&#xA;   '-.      .-'&#xA;     }      {&#xA;     }      {&#xA;     }      {&#xA;   .-'      '.&#xA;   '.        :&#xA;     '-_.._-'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Bite 5:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;         //&#xA;     .-.:|.-.&#xA;   .'   ''   '.&#xA;   '-.      .-'&#xA;     }&amp;quot;.    {&#xA;     } }    {&#xA;     } }    {&#xA;   .-'&amp;quot;     '.&#xA;   '.        :&#xA;     '-_.._-'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Bite 6:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;         //&#xA;     .-.:|.-.&#xA;   .'   ''   '.&#xA;   '-.      .-'&#xA;     }&amp;quot;~&amp;quot;.  {&#xA;     } } }  {&#xA;     } } }  {&#xA;   .-'&amp;quot;~&amp;quot;   '.&#xA;   '.        :&#xA;     '-_.._-'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Bite 7:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;         //&#xA;     .-.:|.-.&#xA;   .'   ''   '.&#xA;   '-.      .-'&#xA;     }&amp;quot;~&amp;quot;~&amp;quot;.{&#xA;     } } } }{&#xA;     } } } }{&#xA;   .-'&amp;quot;~&amp;quot;~&amp;quot; '.&#xA;   '.        :&#xA;     '-_.._-'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Bite &amp;gt;7:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[empty output]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may have trailing spaces, make it consistent though.&lt;/li&gt;&#xA;&lt;li&gt;You may have exactly 1 trailing newline.&lt;/li&gt;&#xA;&lt;li&gt;You are NOT doing an animation here, you are taking in &lt;code&gt;n&lt;/code&gt; and outputting an apple.&lt;/li&gt;&#xA;&lt;li&gt;You may error on integers less than 0, as the spec provides &lt;code&gt;n &amp;gt; 0&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You must have empty output (no error) on &lt;code&gt;n &amp;gt; 7/8&lt;/code&gt;.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You threw out the core; you didn't error the core into non-existence.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hungry-for-apples&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hungry-for-apples&amp;#39;&quot; rel=&quot;tag&quot;&gt;hungry-for-apples&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-22T21:26:41.153" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13566" PostTypeId="2" ParentId="2140" CreationDate="2017-08-04T03:03:58.437" Score="4" Body="&lt;h1&gt;Prime encode integers!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this challenge, you must convert inputted natural numbers into a prime encoding.&lt;/p&gt;&#xA;&lt;p&gt;The sequence of the primes, and 1, is a complete sequence (We're going to consider 1 an honourary prime for this challenge). What this means is that it's possible to express any positive integer as a sum of the terms of the sequence (without reusing terms). For example, the powers of two are a complete sequence, and you can encode numbers in them (this is binary).&lt;/p&gt;&#xA;&lt;p&gt;As with binary, you use a sequence of 1s and 0s to represent which terms are used. 1011 will represent 5 + 1 + 2, or 8. 8 could also be represented as 10001, or 7+1. the place values represent primes:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;... 13 11 7 5 3 2 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;continuing with all of the primes to the left&lt;/p&gt;&#xA;&lt;h2&gt;In this challenge, you must output a string of 1s and 0s, such that the place value primes sum to inputted strictly positive integer&lt;/h2&gt;&#xA;&lt;p&gt;Test cases&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;8 -&amp;gt; 10001 or 1011&#xA;2 -&amp;gt; 10&#xA;11 -&amp;gt; 1111 or 10101 or 100000 (I might have missed one of the possibilities?)&#xA;13 -&amp;gt; 1000000 or any other possibility&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;you may use &lt;em&gt;any&lt;/em&gt; valid representation of the in&lt;/p&gt;&#xA;&lt;h3&gt;input note:&lt;/h3&gt;&#xA;&lt;p&gt;input is 1 strictly positive integer&lt;/p&gt;&#xA;&lt;p&gt;you do not need to consider the value 0, even though it is possible to represent in this system, by just outputting zero&lt;/p&gt;&#xA;" OwnerUserId="55896" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-06T23:03:07.047" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13570" PostTypeId="2" ParentId="13461" CreationDate="2017-08-04T13:50:25.177" Score="3" Body="&lt;h1&gt;Keep it&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I like PPCG because it inspires creative solutions I'd never have considered, usually using techniques I didn't know about (or wouldn't have thought of). In code-golf, more often than not this is done by rearranging the order operations are done, or working out which approach can cut out the most redundant steps. Which I love. Even in Jelly where I can't read a thing, looking at the explanations is typically pretty impressive. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Popularity contests also inspire creative solutions, but instead of answers using algorithms creatively, they use languages creatively. Usually, this means a good answer in a popularity contests ends up teaching people something new about a language they like. In fact, it's almost guaranteed to be that way (almost). People are more likely to upvote answers that impress them, and using a common language in an atypical way is usually pretty impressive. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider &lt;a href=&quot;https://codegolf.stackexchange.com/questions/21835/most-creative-way-to-display-42/21887#21887&quot;&gt;this answer to outputting 42&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/28786/write-a-program-that-makes-2-2-5/28818#28818&quot;&gt;this answer to make 2+2=5&lt;/a&gt;. The first is in C and uses the literal &quot;cut-and-paste&quot; aspect of macros to play with the order of operations. I myself had no idea you could do math between terms in different macros. While I'd probably never use it to make six*nine equal 42, it's something I'll consider the next time my macros are acting all screwy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The second answer is in Java, and &lt;em&gt;redefines Java's definition of 4&lt;/em&gt;. If I went into all the reasons that's amazing I'd never finish this answer. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;We also have sort of de facto popularity contest answers, like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/17005/produce-the-number-2014-without-any-numbers-in-your-source-code/17103#17103&quot;&gt;outputting 2014 without using numbers&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/307/obfuscated-hello-world/3695#3695&quot;&gt;this absolutely gorgeous answer to outputting &quot;Hello, World!&quot;&lt;/a&gt;. The fact that each has so many votes means lots of people like answers like this, even in a code-golf setting. Doesn't it make sense to let people specifically state that they're looking for clever answers like this instead of force users to post that kind of answer out of place (or worse, not at all)? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my opinion, people clearly like clever answers that aren't necessarily the shortest, and that's ok. code-golf is only half of our name. We also have cops-and-robbers threads, and although ties usually go to the shortest code, that's obviously not the point of those challenges. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think if the only thing we're concerned about is writing short code, then sure, kill &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;. But is that really all we're concerned about?&lt;/p&gt;&#xA;" OwnerUserId="58583" LastEditorUserId="58583" LastEditDate="2017-08-04T13:59:59.767" LastActivityDate="2017-08-04T13:59:59.767" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13571" PostTypeId="1" CreationDate="2017-08-04T15:05:13.817" Score="0" ViewCount="28" Body="&lt;p&gt;Say I have a language I'd love to use (like JavaScript for example), but there are tons of little pieces of functionality I'd love to modify built-ins with, like &lt;code&gt;.peek()&lt;/code&gt; on arrays, or &lt;code&gt;.isPrime()&lt;/code&gt; on numbers, etc. Assuming I kept a collection of utilities like this published on Github, would it be acceptable to write submissions like&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;JavaScript (using &lt;code&gt;myutils.js&lt;/code&gt;), [...] bytes&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;[...]&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Another follow-up question I have to this is, if it &lt;em&gt;is&lt;/em&gt; allowed, would submissions like this typically be well-received or no?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Assuming the collection of modifications had intuitive naming-conventions that might conceivably be used in production code if developers weren't opposed to modifying built-ins (which is a completely separate holy war in JavaScript), I have a hard time classifying something like this as &quot;cheating&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="42091" LastActivityDate="2017-08-04T15:05:13.817" Title="Are modifications to existing languages allowed as submissions?" Tags="|discussion|policy|code-golf|answers|" AnswerCount="0" CommentCount="5" FavoriteCount="0" ClosedDate="2017-08-04T15:29:54.343" ContentLicense="CC BY-SA 3.0" />
  <row Id="13572" PostTypeId="2" ParentId="13419" CreationDate="2017-08-04T15:31:42.450" Score="0" Body="&lt;p&gt;I say no. My opinion is of lesser value since I'm new but I feel like there is a better way to handle this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there is a closed challenge and it gets reposted, the answers that are taken from the closed challenge &lt;strong&gt;should&lt;/strong&gt; be deleted (unless they are golfed). However, new answers that users have created/found should not be thrown out simply because the challenge has been posted before. &lt;/p&gt;&#xA;" OwnerUserId="72169" LastActivityDate="2017-08-04T15:31:42.450" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13573" PostTypeId="2" ParentId="13491" CreationDate="2017-08-04T18:55:55.153" Score="14" Body="&lt;h1&gt;Challenge Declined&lt;/h1&gt;&#xA;&lt;p&gt;Please read my answer on &lt;a href=&quot;https://codereview.meta.stackexchange.com/a/8387/31562&quot;&gt;Code Review Meta&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In addition, some of 200_success' original fears seem to have come true:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;@EBrown You're either with us, or you are the enemy! – ncalmbeblpaicr0011 Aug 1 at 15:37&lt;/p&gt;&#xA;&lt;p&gt;-1 PPCG always wins. On PPCG, a PPCG user always wins every challenge. – NoOneIsHere 21 hours ago&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;We're really not interested in that kind of talk for something that was supposed to be a friendly fight. But even without that kind of talk, we feel that battling sites against each other is not a good idea.&lt;/p&gt;&#xA;" OwnerUserId="18865" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-04T18:55:55.153" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13577" PostTypeId="2" ParentId="5243" CreationDate="2017-08-04T19:45:33.257" Score="1" Body="&lt;h1&gt;100 rep for beating me in the Cardinal code challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;What it says on the tin.  Beat my &lt;a href=&quot;https://codegolf.stackexchange.com/a/137599/56656&quot;&gt;Brain-Flak answer&lt;/a&gt; (in Brain-Flak of course) and I'll give you 100 rep.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-08-04T19:45:33.257" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13578" PostTypeId="2" ParentId="2140" CreationDate="2017-08-04T21:29:56.243" Score="1" Body="&lt;p&gt;I've got a challenge, but I'm not quite sure how to implement it in a way that's on-topic. It's possible this type of question just doesn't mesh with PPCG, but that's what the SandBox is for, right? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The gist is that I want a sort implemented lazily. So lazily that you don't actually write one, you steal someone else's. Your code should take an input, find/scrape an existing sorting algorithm off StackExchange (just PPCG?), run it, and output the sorted list. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's what I've got so far:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Laziest Sort&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I need a program that sorts a list, but man am I lazy. I don't mean &quot;I'll just write a bubble sort and call it a day&quot; lazy, but &quot;I don't even want to write any sort at all&quot; lazy. In fact, I don't even want to look at a sorting algorithm. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a list of numbers, I want you to return to me a sorted list. But like I said, I don't want to look a sorting algorithm. Instead, I want you to go find an existing sorting algorithm, run it, and tell me what it said. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The rules (This is part of where I need the SandBox)&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may &lt;strong&gt;not&lt;/strong&gt; use any native sorting algorithms (like &lt;code&gt;Collections.sort()&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;You &lt;strong&gt;may&lt;/strong&gt; use any sorting algorithm you can find, so long as it is from StackExchange.&lt;/li&gt;&#xA;&lt;li&gt;You &lt;strong&gt;may&lt;/strong&gt; import the code from the algorithm you use and run it from your answer, so long as the actual algorithm isn't in your source code.&lt;/li&gt;&#xA;&lt;li&gt;Anything other requirement this challenge needs? I feel like this describes the problem I have in mind, but I've only made a few questions and they're typically math/array based.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; seems an odd tag here, but &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; seems to be frowned upon. Especially since I don't have a great question formed yet, but I feel like I've got a reasonable idea here. Any tips on how to get this question presentable enough to actually post? &lt;/p&gt;&#xA;" OwnerUserId="58583" LastActivityDate="2017-08-04T21:29:56.243" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13582" PostTypeId="2" ParentId="8664" CreationDate="2017-08-05T05:13:25.813" Score="4" Body="&lt;h2&gt;Yes, but...&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As Martin Ender (among others) has pointed out, there is oftentimes volumes of literature already written about such topics. It's simply not possible to fit all (or even a useful subset) of that information into a single usable post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, a question such as &quot;Tips for time-optimization in Python/C/Java/Rust/etc.&quot; would (and IMHO &lt;em&gt;should&lt;/em&gt;) be closed as &quot;too broad.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are a few things that could be done to narrow the scope of such a question:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You could make it into a question about a specific piece of code (in the same way that these sorts of golfing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions are on-topic), but this might be better suited to &lt;a href=&quot;https://codereview.stackexchange.com&quot;&gt;Code Review&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You could make it into a question about a specific language feature, or at least a feature which has optimization characteristics specific to the given language (e.g. &quot;When to use static vs. dynamic dispatch to get best preformance in Rust&quot;). This might be better suited to &lt;a href=&quot;https://stackoverflow.com&quot;&gt;Stack Overflow&lt;/a&gt;, but it would probably be on-topic and useful here as well.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It &lt;em&gt;might&lt;/em&gt; be possible to make a question that was language-agnostic (or at least generalized to a certain category of languages), but even this would need some specialization.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If a person wanted to ask a question like that in PPCG, it was probably because they were trying to solve a challenge on PPCG, and had a specific problem that they wanted to solve. The best thing to do is to identify this problem and ask about it specifically, rather than asking an unhelpful and overly broad question that probably won't even provide an answer useful to the OP.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="61384" LastEditDate="2017-10-10T01:28:19.630" LastActivityDate="2017-10-10T01:28:19.630" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13589" PostTypeId="2" ParentId="2140" CreationDate="2017-08-06T17:51:44.867" Score="0" Body="&lt;h1&gt;Arbitrary base conversion&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base-conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; rel=&quot;tag&quot;&gt;base-conversion&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an integer &lt;code&gt;n&lt;/code&gt; of any sign, output a list of digits of its representation in a given base &lt;code&gt;b&lt;/code&gt; not in &lt;code&gt;-1, 0, 1&lt;/code&gt;. If &lt;code&gt;b&lt;/code&gt; is positive, &lt;code&gt;n&lt;/code&gt; will be non-negative.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may not use arbitrary base conversion built-ins like Jelly's &lt;code&gt;b&lt;/code&gt; or 05AB1E's &lt;code&gt;в&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You may assume the input is valid, as above.&lt;/li&gt;&#xA;&lt;li&gt;All digits must be greater than or equal to &lt;code&gt;0&lt;/code&gt; and strictly less than &lt;code&gt;b&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;For zero you must return &lt;code&gt;[]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;256, 10 -&amp;gt; [2, 5, 6]&#xA;256, -10 -&amp;gt; [3, 5, 6]&#xA;1000, 25 -&amp;gt; [1, 15, 0]&#xA;1000, -30 -&amp;gt; [2, 27, 10]&#xA;0, 300 -&amp;gt; [0]&#xA;1000, 1000 -&amp;gt; [1, 0]&#xA;18446744073709551615, 4 -&amp;gt; [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3]&#xA;18446744073709551615, -5 -&amp;gt; [3, 3, 2, 1, 3, 3, 1, 2, 1, 2, 2, 3, 0, 1, 1, 4, 0, 2, 0, 4, 3, 4, 2, 3, 3, 1, 4, 4]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Is this a dupe?&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2017-08-23T17:06:34.097" LastActivityDate="2017-08-23T17:06:34.097" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13591" PostTypeId="2" ParentId="2140" CreationDate="2017-08-06T19:35:52.493" Score="-2" Body="&lt;h1&gt;Complicating Simple Maths &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We do know what 1 + 1 is, or 2 - 1. How about we turn those and other really simple operations into complex numbers?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Goal:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As stated in the intro, taking an operation that can be done within the range of the following operators ( +, -, /, *, ^ and () ), print out a &lt;a href=&quot;https://en.wikipedia.org/wiki/Complex_number&quot; rel=&quot;nofollow noreferrer&quot;&gt;complex number&lt;/a&gt; operation that is pretty much a transformed version, and when done using the order of operations, results in the same answer as the inputted operation.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: 5 - 1&#xA;Output: 5 + 2i&#xA;&#xA;Input: 4 * (7 ^ 2)&#xA;Output: (4 * 4i) * (7 ^ 2) &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It is recommended you print out the sector(s) that holds your complex number(s) as a + bi, e.g. (a + bi) - (ci * (di ^ f)). (&lt;strong&gt;NOTE:&lt;/strong&gt; If you are doing non-communicative operations, such as ^, /, or -, the recommendation doesn't apply to the sub-operation).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;standard loopholes&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you want to, feel free to use operations/functions other than the set mentioned in the Goal, but your input operation must have at least one of them.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can format your operators in any way, e.g. x or • instead of *, ÷ instead of /, etc. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Input and output is allowed in any format as long as it fits within the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;standard I/O rules&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Input must also be flexible (as in to return any input from a simple operation to a complex number operation.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer wins.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Sandbox use only:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Is there any way I can improve this challenge? Are there any other loopholes to be covered in the rules?&lt;/p&gt;&#xA;" OwnerUserId="71777" LastEditorUserId="71777" LastEditDate="2017-08-07T13:11:45.547" LastActivityDate="2017-08-07T13:11:45.547" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13593" PostTypeId="1" CreationDate="2017-08-06T22:15:44.943" Score="3" ViewCount="327" Body="&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/q/137846/55329&quot;&gt;my most recent challenge&lt;/a&gt;, which was scored by number of languages in a polyglot &lt;a href=&quot;https://codegolf.stackexchange.com/questions/137846/polyglot-the-oeis#comment337682_137846&quot;&gt;the following question came up&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Do different [..] implementations of the same language count as&#xA;  different langauges ([...] like browser JS and&#xA;  Node.js)?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;To which I couldn't find any prior ruling either on Meta or after a short search through other questions tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So my question:&lt;br&gt;&#xA;&lt;strong&gt;Is it sensible / should it be the default to recognize different implementations (with implementation-defined default extensions) as different languages?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(please note: the &quot;yes&quot; answer to the above was my tentative, preliminary ruling until confirmed / revoked via this meta Q&amp;amp;A)&lt;/p&gt;&#xA;" OwnerUserId="55329" LastActivityDate="2018-09-10T15:05:44.040" Title="Default / Recommended Ruling on counting Implementation-Variants of Languages as different?" Tags="|discussion|challenges|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="13594" PostTypeId="2" ParentId="13593" CreationDate="2017-08-06T23:51:45.827" Score="4" Body="&lt;h1&gt;Different implementations count as different languages.&lt;/h1&gt;&#xA;&lt;p&gt;Languages are defined by their implementation.&lt;/p&gt;&#xA;&lt;p&gt;This isn't really problematic for most polyglots:  Polyglots usually want you to do &lt;em&gt;different&lt;/em&gt; things for each language, which means that they'd have to exploit the minute differences between the two implementations.&lt;/p&gt;&#xA;&lt;p&gt;If the similarity of languages is an issue for a particular challenge, then we usually use the phrase &amp;quot;different versions of the same language&amp;quot; (which is problematic, but so is trying to make a challenge where you want lots of languages doing the same thing)&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-06T23:51:45.827" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13595" PostTypeId="2" ParentId="13593" CreationDate="2017-08-07T00:02:43.603" Score="11" Body="&lt;h1&gt;They are different languages&lt;/h1&gt;&#xA;&lt;p&gt;On PPCG we define languages based on their implementations, it follows simply that different implementations are then different languages.&lt;/p&gt;&#xA;&lt;h2&gt;The problem&lt;/h2&gt;&#xA;&lt;p&gt;This is a not un-problematic, because it also means that different versions of the same language (e.g. 1.5.1 vs 1.5.2) are technically different languages because they have different implementations, even if the difference is a couple of small bug fixes.  This leads to the absurd result of being to use every minor version of your favorite language to repeatedly answer questions that ban using a language twice.  We have to draw the line somewhere or we may as well allow repeats in a language.&lt;/p&gt;&#xA;&lt;h2&gt;The solution&lt;/h2&gt;&#xA;&lt;p&gt;I think that every question that is concerned with &amp;quot;different-languages&amp;quot; should define what they mean by different languages, based on the behavior relevant to the challenge and not rely on a PPCG wide definition.  An example of this is the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/102370/add-a-language-to-a-polyglot&quot;&gt;Add a Language to a Polyglot&lt;/a&gt; that only requires languages have different output on the program in question to be considered different languages.  This works out very well for that challenge.  Obviously it will not always be this clean cut to find a good definition.&lt;/p&gt;&#xA;&lt;p&gt;However questions should in general avoid defining this based on &amp;quot;major&amp;quot; and &amp;quot;minor&amp;quot; versioning systems (I have been guilty of this in the past myself), because such systems are not universal.  Not all languages have version numbers, and not all languages that do have them put the same meaning into the numbers they provide.  Definitions like this should probably be based on the behavior of the languages, to keep things objective.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-09-10T15:05:44.040" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="13596" PostTypeId="2" ParentId="12846" CreationDate="2017-08-07T04:10:38.597" Score="3" Body="&lt;h2&gt;Yes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I don't see any argument for removing those bytes. &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;They're a required part of the solution in that language and execution environment.&lt;/li&gt;&#xA;&lt;li&gt;The bytes aren't fixed. Tomorrow you might find a shorter domain that does the same thing. Or you might find a third-party script that does the same thing, which save bytes for multiple requests.&lt;/li&gt;&#xA;&lt;li&gt;A CORS proxy isn't always required, anyway.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;It seems equivalent to complaining that in C you always have to waste bytes doing &lt;code&gt;#include &amp;lt;stdlib&amp;gt;&lt;/code&gt; or something.&lt;/p&gt;&#xA;" OwnerUserId="30512" LastActivityDate="2017-08-07T04:10:38.597" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13603" PostTypeId="1" CreationDate="2017-08-07T18:04:55.773" Score="3" ViewCount="210" Body="&lt;p&gt;So, recently in the Hello World CnR challenge I've come across &lt;a href=&quot;https://codegolf.stackexchange.com/a/137979/71612&quot;&gt;this crack&lt;/a&gt; to my submission.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't think it's ever clearly defined before in any CnRs what exactly is allowed as an input and what is not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, what exactly constitutes a valid &lt;code&gt;input&lt;/code&gt; to a function? What is allowed and what is not allowed?&lt;/p&gt;&#xA;" OwnerUserId="73228" LastEditorUserId="73228" LastEditDate="2017-08-07T18:16:31.107" LastActivityDate="2017-08-09T08:03:36.627" Title="Viable input forms in Cops and Robbers challenges" Tags="|discussion|cops-and-robbers|" AnswerCount="9" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13604" PostTypeId="2" ParentId="13603" CreationDate="2017-08-07T18:04:55.773" Score="2" Body="&lt;h1&gt;Robber inputs should be standalone and performs all the necessary tasks (including global assignments) at least after being passed into the function&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;So, for example, given this cop:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;from random import uniform&#xA;def f(a):&#xA;    return a == uniform(0,float('+inf'))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This Python class which is equal to &lt;em&gt;anything&lt;/em&gt; is a valid input because it stands up to itself:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;class Wildcard(object):&#xA;    def __eq__(self, other):&#xA;        return True&#xA;w = Wildcard()&#xA;print(f(w))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This JS snippet, however, is not:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Cop: &#xA;f=()=&amp;gt;1==2&#xA;&#xA;Robber:&#xA;f=()=&amp;gt;2==2,f('foobar')&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Cop:&#xA;g=()=&amp;gt;false,f=()=&amp;gt;g()&#xA;&#xA;Robber:&#xA;f((g=()=&amp;gt;true))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Because they have effects that occur &lt;em&gt;before&lt;/em&gt; the cop function is even evaluated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If they are performed &lt;em&gt;after&lt;/em&gt; the control flow is passed inside the cop function, then it is okay. e.g:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Cop:&#xA;f=e=&amp;gt;{i=NaN;while(e!=i);return}&#xA;&#xA;Robber:&#xA;f({valueOf:()=&amp;gt;(i=0,0)})&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Strictly speaking, &lt;em&gt;every&lt;/em&gt; action must be performed at least after the cop function is evaluated. So if the Robber's proposed solution is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;var i=0;&#xA;var e={toString:()=&amp;gt;['a','b','c','true'][i++]}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;He should transform it so that everything is sit inside a variable:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;var e={i:0, toString:()=&amp;gt;['a','b','c','true'][e.i++]}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which would allow one to call the cop solution directly like &lt;code&gt;f(e)&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="73228" LastEditorUserId="73228" LastEditDate="2017-08-07T18:29:41.740" LastActivityDate="2017-08-07T18:29:41.740" CommentCount="6" CommunityOwnedDate="2017-08-07T18:04:55.773" ContentLicense="CC BY-SA 3.0" />
  <row Id="13605" PostTypeId="2" ParentId="13603" CreationDate="2017-08-07T18:16:05.397" Score="3" Body="&lt;h1&gt;Robber answer should not completely modify the language's behaviour such that passing any solution is trivial&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;...Which is called a hack, not a crack. It's a standard loophole.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;e.g Overriding equality and comparison operators for everything in the language (Ruby, and C++, I'm looking at you).&lt;/p&gt;&#xA;" OwnerUserId="73228" LastActivityDate="2017-08-07T18:16:05.397" CommentCount="4" CommunityOwnedDate="2017-08-07T18:16:05.397" ContentLicense="CC BY-SA 3.0" />
  <row Id="13607" PostTypeId="2" ParentId="13603" CreationDate="2017-08-07T22:46:07.853" Score="-2" Body="&lt;h1&gt;Input Should Fit Inside the Function Call&lt;/h1&gt;&#xA;&lt;p&gt;Simply put, if your language allows you to place it in between the parentheses (or other language construct), it is allowed. If you cannot place it in between the parentheses (or other), it is not allowed.&lt;/p&gt;&#xA;&lt;p&gt;If you cannot pass it to the function as is, you can't pass it. If, for example, your language doesn't support anonymous functions or anonymous objects, then unless the cop explicitly states that you have to construct the input outside the function call, you can't.&lt;/p&gt;&#xA;" OwnerUserId="65836" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-07T22:46:07.853" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13608" PostTypeId="1" CreationDate="2017-08-08T05:54:11.887" Score="19" ViewCount="339" Body="&lt;p&gt;A while ago I started a bit of a personal experiment and stopped using the sandbox for most of my questions.  I think this experiment has given me a new perspective on the sandbox, that I would like to share.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The sandbox is problematic.  Many users feel that they can't get the necessary feedback on a post in the sandbox.  And that's not for lack of review.  Many users regularly patrol the sandbox and provide meaningful and helpful feedback.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think the problem here is that there are &lt;em&gt;too many&lt;/em&gt; questions in the sandbox.  Some questions don't really need much review.  If you're a user that has asked 50 questions already you probably don't need to post your latest &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question to the sandbox.  Simple posts serve mostly to bury challenges that &lt;em&gt;need&lt;/em&gt; attention.  Challenges written by new users or challenges involving novel scoring or mechanics, should be given much more attention than they are currently getting.  It seems a lot of the time that we are using the sandbox as a dupe watch, for title suggestions, or even just a holding place for drafts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That's it.  Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-08-08T06:24:16.747" LastActivityDate="2017-08-18T21:58:54.487" Title="Should every question be sandboxed?" Tags="|discussion|sandbox|" AnswerCount="5" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="13609" PostTypeId="2" ParentId="13603" CreationDate="2017-08-08T06:07:48.560" Score="1" Body="&lt;h1&gt;Crack can be object, modifed before sending&lt;/h1&gt;&#xA;&lt;h2&gt;JS example&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Cop's sumbission&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;var crackme = x =&amp;gt; { x[&amp;quot;foo&amp;quot;] = &amp;quot;&amp;quot;; if(x[&amp;quot;foo&amp;quot;] == &amp;quot;bar&amp;quot;){ return &amp;quot;OK&amp;quot;; } }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Robber's crack&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;var key = {&amp;quot;foo&amp;quot;:&amp;quot;bar&amp;quot;};&#xA;Object.freeze(key);&#xA;crackme(key);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="71612" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-08T06:13:46.993" CommentCount="5" CommunityOwnedDate="2017-08-08T06:07:48.560" ContentLicense="CC BY-SA 3.0" />
  <row Id="13610" PostTypeId="2" ParentId="13603" CreationDate="2017-08-08T06:47:24.723" Score="1" Body="&lt;h1&gt;Microcontroller input can be series of I/O signals&lt;/h1&gt;&#xA;&lt;p&gt;With timings if needed.&lt;/p&gt;&#xA;&lt;p&gt;Also it can use UART, USB or another same periphericals&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/tqXD6.jpg&quot; alt=&quot;Microcontroller&quot; /&gt;&lt;/p&gt;&#xA;" OwnerUserId="71612" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-08T06:47:24.723" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13611" PostTypeId="2" ParentId="13603" CreationDate="2017-08-08T06:58:34.990" Score="1" Body="&lt;h1&gt;Input can be interactive&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/UIVlZ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/UIVlZ.png&quot; alt=&quot;stdin &amp;lt;-&amp;gt; stdout&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Howto&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We need to make a &lt;a href=&quot;https://unix.stackexchange.com/questions/53641/how-to-make-bidirectional-pipe-between-two-programs&quot;&gt;biderectional pipe&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;mkfifo fifo0 fifo1&#xA;prog1 &amp;gt; fifo0 &amp;lt; fifo1 &amp;amp;&#xA;prog2 &amp;lt; fifo0 &amp;gt; fifo1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Minuses&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;tio doesn't support it now&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Pluses&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Way to new extraordinary cracks&lt;/li&gt;&#xA;&lt;li&gt;We can patch tio to add this support &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="71612" LastActivityDate="2017-08-08T06:58:34.990" CommentCount="0" CommunityOwnedDate="2017-08-08T06:58:34.990" ContentLicense="CC BY-SA 3.0" />
  <row Id="13614" PostTypeId="2" ParentId="13608" CreationDate="2017-08-08T08:08:08.253" Score="0" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I agree with your reasoning, although to me that's only part of the problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it would also be beneficial to have some kind of sandbox viewing website that has much smaller posts and a read list, which I think could encourage more users to check the sandbox since it would be much easier to go through all the posts.&lt;/p&gt;&#xA;" OwnerUserId="39244" LastActivityDate="2017-08-08T08:08:08.253" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13615" PostTypeId="1" CreationDate="2017-08-08T08:17:07.673" Score="-2" ViewCount="85" Body="&lt;p&gt;I have a bit of unclarity in regards to how we should count bytes in TeX. In general, coding in TeX is done through macros, introduced by the escape character. for examples \read16 is the macro which takes stdin.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would like to know if we could count that as 1 byte for the following reason. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;TeX doesn't process the characters that you input directly, it translates them into tokens, which then get processed. In fact, a lengthy macro name like \thisisverylong is actually one byte in TeX's memory. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would certainly participate in this site more if we could consider every macro as the token it represents rather than the characters typed.&lt;/p&gt;&#xA;" OwnerUserId="73219" LastActivityDate="2017-08-08T11:16:35.867" Title="How to count bytes in TeX?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13618" PostTypeId="2" ParentId="13615" CreationDate="2017-08-08T11:04:13.420" Score="6" Body="&lt;p&gt;No. Your score in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is the number of bytes needed to store your &lt;strong&gt;source code&lt;/strong&gt;. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13449/32352&quot;&gt;TeX is no exception there&lt;/a&gt;. The only apparent exception are tokenized languages, like TI-Basic, but in the end, their score is exactly the number of bytes it takes to store the program on the computer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Despite countless documents I made in LaTeX, I don't know how it works internally, but if TeX produces some intermediate file, you may also golf in that file format (much like assembly programmers). This is then not called TeX, but whatever the intermediate step is called. Alternatively, you are free to create your own golfing language based of off TeX if you really care that much about the absolute byte count.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, my sincere advice is: &lt;strong&gt;don't care about your absolute byte count&lt;/strong&gt;. The fun here is in trying to beat other using the same or similar languages. I personally only use a golfing language (MATL) since it's a very &lt;em&gt;different&lt;/em&gt; way of golfing (generally minimizing the number of operations and playing with the stack). However, I find golfing in its parent language, MATLAB/Octave, just as much fun, because you can do things in ridiculously inefficient ways if it happens to use short function names. &lt;/p&gt;&#xA;" OwnerUserId="32352" LastEditorUserId="32352" LastEditDate="2017-08-08T11:16:35.867" LastActivityDate="2017-08-08T11:16:35.867" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13619" PostTypeId="1" CreationDate="2017-08-08T11:05:12.627" Score="1" ViewCount="129" Body="&lt;p&gt;Imagine you're submitting a &lt;em&gt;full program&lt;/em&gt; (as opposed to a &lt;em&gt;function&lt;/em&gt;) written in assembly / machine code. You'll want to submit it as &lt;em&gt;machine code&lt;/em&gt; (with the appropriate processor and target system) because there's a 1:1 mapping, but the machine code format is much more concise.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12352/71420&quot;&gt;this answer&lt;/a&gt;, it's suggested to submit a function, because some executable format would add a lot of boilerplate. My question is: Does this boilerplate really count to the bytes for a machine code submission?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I recently submitted some C64 machine code and with the very simple executable format of the C64, the difference is only two bytes: The load address of the code is in the first two bytes of the executable file. Before finding the question I linked, I assumed those two bytes are &lt;strong&gt;not&lt;/strong&gt; part of the program. Am I wrong here?&lt;/p&gt;&#xA;" OwnerUserId="71420" LastEditorUserId="194" LastEditDate="2017-08-08T11:48:24.703" LastActivityDate="2017-08-09T09:28:11.387" Title="Machine code submissions: Do bytes that are part of the executable file format count?" Tags="|discussion|code-golf|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13620" PostTypeId="1" CreationDate="2017-08-08T11:35:18.167" Score="11" ViewCount="251" Body="&lt;p&gt;Suppose I have a closed challenge &lt;em&gt;&quot;Closed&quot;&lt;/em&gt; and an old challenge &lt;em&gt;&quot;Old&quot;&lt;/em&gt; and want to create a new challenge &lt;em&gt;&quot;New&quot;&lt;/em&gt;. &lt;em&gt;Closed&lt;/em&gt; is closed as a duplicate of &lt;em&gt;Old&lt;/em&gt; because entries from &lt;em&gt;Old&lt;/em&gt; are competitive in &lt;em&gt;Closed&lt;/em&gt; because &lt;em&gt;Closed&lt;/em&gt; allows a super-set of entries from &lt;em&gt;Old&lt;/em&gt;. Now all entries from &lt;em&gt;New&lt;/em&gt; will be (likely?) competitive in &lt;em&gt;Closed&lt;/em&gt; but 100% are banned in &lt;em&gt;Old&lt;/em&gt; (that is, &lt;em&gt;Old&lt;/em&gt; and &lt;em&gt;New&lt;/em&gt; have an empty set-intersection and &lt;em&gt;Closed&lt;/em&gt; is a super-set of &lt;em&gt;New&lt;/em&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question is now:&lt;br&gt;&#xA;&lt;strong&gt;Would &lt;em&gt;New&lt;/em&gt; be closed as dupe of &lt;em&gt;Closed&lt;/em&gt; (or of &lt;em&gt;Old&lt;/em&gt;) or would it be allowed to stay open?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To make this more interesting, the total textual non-fluff difference between &lt;em&gt;Closed&lt;/em&gt; and &lt;em&gt;New&lt;/em&gt; will be about two lines (out of 50 or so).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note: This is intentionally abstract, but I bet you can figure the involved challenges out if you really want to ;)&lt;/p&gt;&#xA;" OwnerUserId="55329" LastEditorUserId="68615" LastEditDate="2017-08-08T13:16:56.013" LastActivityDate="2017-08-09T09:19:39.823" Title="How transitive are Duplicates?" Tags="|discussion|duplicates|closed-questions|" AnswerCount="3" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="13621" PostTypeId="1" AcceptedAnswerId="13626" CreationDate="2017-08-08T11:43:07.457" Score="10" ViewCount="473" Body="&lt;p&gt;In challenges that require loading remote data - e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/q/137957/72685&quot;&gt;&quot;What's my PPCG ID?&quot;&lt;/a&gt; - some JavaScript (or other languages that may be run in the browser) answers may rely on being run at a certain domain (&lt;a href=&quot;https://codegolf.stackexchange.com/a/138094/72685&quot;&gt;example answer&lt;/a&gt;), or may include extra code to safe-guard against being run at a certain domain (&lt;a href=&quot;https://codegolf.stackexchange.com/a/135632/72685&quot;&gt;example robber&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should answers be allowed to restrict which domains they can be run at? Should they be required to be runnable on all domains?&lt;/p&gt;&#xA;" OwnerUserId="72685" LastEditorUserId="72685" LastEditDate="2017-08-08T12:01:22.397" LastActivityDate="2017-10-06T06:36:15.573" Title="Can JS answers require the code to be run at a certain domain?" Tags="|discussion|policy|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13622" PostTypeId="2" ParentId="13619" CreationDate="2017-08-08T11:53:08.137" Score="2" Body="&lt;p&gt;Yes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To be a full program, it must contain all of the boilerplate required for your compiler to produce an executable or for your interpreter to run it. In the case of machine code submissions, the &quot;interpreter&quot; operates on executable files. Therefore you must include the boilerplate of the executable file.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-08-08T11:53:08.137" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13624" PostTypeId="2" ParentId="13621" CreationDate="2017-08-08T12:57:04.180" Score="11" Body="&lt;h1&gt;For Code-Golf - domain would be extra bytes&lt;/h1&gt;&#xA;&lt;p&gt;This is mostly directed at &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, which I believe is not what you are asking about. However, if a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; answer requires a certain domain, it should be included in the byte count. This is exactly how we treat file names, for example.&lt;/p&gt;&#xA;" OwnerUserId="65836" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-08T12:57:04.180" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="13626" PostTypeId="2" ParentId="13621" CreationDate="2017-08-08T13:27:01.153" Score="12" Body="&lt;h1&gt;Yes, as long as it isn't used to store data&lt;/h1&gt;&#xA;&lt;p&gt;We allow specific platform and environment requirements, as long as:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It is specified in the post&lt;/li&gt;&#xA;&lt;li&gt;They aren't being used to store bytes (on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; or similar challenges where byte-count matters)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Requiring a particular domain is simply requiring a particular environment&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-08T13:27:01.153" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="13627" PostTypeId="2" ParentId="13620" CreationDate="2017-08-08T13:32:40.293" Score="1" Body="&lt;p&gt;&lt;strong&gt;As long as the &lt;em&gt;old&lt;/em&gt; entries aren't valid/competitive on the &lt;em&gt;new&lt;/em&gt; challenge, they aren't duplicates&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your new question is a strict subset of the older challenge.  However, given that none of the old posts currently work on the new challenge, it's likely that that is because it costs them extra bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The key here is that the additional requirements require extra bytes, &lt;strong&gt;meaning that they aren't competitive on the old question&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="20198" LastActivityDate="2017-08-08T13:32:40.293" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13628" PostTypeId="2" ParentId="13620" CreationDate="2017-08-08T13:35:32.030" Score="2" Body="&lt;p&gt;In this particular case it seems that &quot;&lt;em&gt;New&lt;/em&gt;&quot; is an edit of &quot;&lt;em&gt;Closed&lt;/em&gt;&quot; that would invalidate most of the current answers in &quot;&lt;em&gt;Closed&lt;/em&gt;&quot;. In this case it makes sense to post a new question but add a disclaimer as to why it is different to the old one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, This will generally be a case by case basis depending on how closely related the questions are, how old they are and the number of answers, among other factors.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some general factors to consider when in this position:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Will the answers be valid in the new question?&lt;/li&gt;&#xA;&lt;li&gt;Is the closed question old or can I edit it into shape? If so would editing the question invalidate the answers on it?&lt;/li&gt;&#xA;&lt;li&gt;How many answers does the old one have? If none you might be able to edit it into shape, but you may invalidate any WIPs.&lt;/li&gt;&#xA;&lt;li&gt;Is the new question essentially an edit of the closed one?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="38550" LastActivityDate="2017-08-08T13:35:32.030" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13630" PostTypeId="2" ParentId="2140" CreationDate="2017-08-08T15:34:18.360" Score="1" Body="&lt;h1&gt;The Mode of an Image&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an image as input, output it's mode; that is the colour that appears most in it. However, I am on a tight schedule and so need this code to compute as fast as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input can be in any reasonable format for your program i.e. filename or image object. However, the input image must have at least 3 channels i.e. &lt;code&gt;r&lt;/code&gt;, &lt;code&gt;g&lt;/code&gt;, &lt;code&gt;b&lt;/code&gt; or 24bpp.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output can be by any reasonable means i.e. return of a method or print to STDOUT.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test Cases&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;//TODO: add them&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; the winner is the answer which scores the lowest total time over all of the test cases. For example, if there are two test cases then the &lt;code&gt;score = timeForTestCase1 + timeForTestCase2&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the even that more than one winning answer scores the same more test cases will be added. The winning answers will be notified and should be updated accordingly.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Test case suggestions?&lt;/li&gt;&#xA;&lt;li&gt;Better scoring mechanism? i.e. average of the time for each test case&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="38550" LastActivityDate="2017-08-08T15:34:18.360" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13632" PostTypeId="2" ParentId="8047" CreationDate="2017-08-08T17:28:13.303" Score="21" Body="&lt;h1&gt;Excessively long back stories&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a site for people who like programming challenges. They already want to see your idea for a challenge. You don't need a back story to make your challenge appeal to them. If you decide to include some context for the task, try to keep it short.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Personally, I'm more likely to be put off by a needlessly long challenge wording. If it's long because it's complex, I'll read it. If it's long because of telling a story to make a simple challenge more interesting, it actually becomes less interesting to me. Simple challenges are good. Let's keep them simple.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2017-08-08T17:28:13.303" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13634" PostTypeId="1" CreationDate="2017-08-08T17:35:11.203" Score="16" ViewCount="1414" Body="&lt;p&gt;So, in the last couple months, I have seen several (especially JavaScript) quines told that they are cheating because they stringify a function. Accordingly, I thought that was the standard - it's reading its source, of course it's cheating.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Quine_(computing)?oldformat=true#.22Cheating.22_quines&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia's section on cheating quines&lt;/a&gt; includes the following as an example of reading source, and therefore, cheating:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function a() {&#xA;    document.write(a, &quot;a()&quot;);&#xA;}&#xA;a()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The accepted answer on the &quot;proper quine&quot; question states that&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Furthermore, a quine must not access its own source, directly or indirectly.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;However, there are several answers posted since then, on &quot;Golf you a quine for great good&quot;, that read a JavaScript function's source, such as &lt;a href=&quot;https://codegolf.stackexchange.com/a/60148/65836&quot;&gt;this one&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, the question is: &lt;strong&gt;Is fetching a function's source cheating in a quine?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="65836" LastEditorUserId="65836" LastEditDate="2017-08-08T20:08:03.193" LastActivityDate="2017-08-17T09:52:08.647" Title="Is a quine that reads a function's source a cheating quine?" Tags="|discussion|answers|quine|" AnswerCount="3" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="13635" PostTypeId="2" ParentId="13634" CreationDate="2017-08-08T17:37:49.967" Score="11" Body="&lt;h1&gt;Yes, it is cheating&lt;/h1&gt;&#xA;&lt;p&gt;According to the &amp;quot;proper quine&amp;quot;-meta post:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;a quine must not access its own source, directly or indirectly.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Reading a function's source is indirectly reading part of the source of the program, therefore it is cheating, according to the current meta consensus.&lt;/p&gt;&#xA;" OwnerUserId="65836" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-08T19:50:08.500" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13637" PostTypeId="1" AcceptedAnswerId="13651" CreationDate="2017-08-08T18:44:42.800" Score="0" ViewCount="79" Body="&lt;p&gt;Consider king-of-the-hill challenges. Significant effort on the part of the challenge presenter goes into collecting the code entries and massaging them into a runnable state (language versions, compiling, etc). This effort can be reduced by limiting languages, but that also limits your audience.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it wrong to ask for an executable for languages that compile?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These day's it's simple to stand up serverless services. Is it wrong to ask for a web service endpoint?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it's not &lt;em&gt;wrong&lt;/em&gt;, would it be well received?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe that answers should continue to contain code since this promotes healthy community activity. Users can be inspired by other answers, offer suggested improvements, etc. The root of this question is whether or not it is improper to ask for more than the code and if the community would rise to that request.&lt;/p&gt;&#xA;" OwnerUserId="31946" LastActivityDate="2017-08-09T06:11:26.687" Title="Is it wrong to ask for an answer that is not source code?" Tags="|discussion|policy|asking-questions|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13638" PostTypeId="2" ParentId="13634" CreationDate="2017-08-08T19:02:44.340" Score="14" Body="&lt;h1&gt;It's not a cheating quine&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4878/12012&quot;&gt;The meta post you quote&lt;/a&gt; contains the following example of a proper quine in CJam.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{&quot;_~&quot;}_~&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;{&quot;_~&quot;}&lt;/code&gt; defines a block (anonymous function). It won't be executed, so it's left on the stack and printed implicitly when the program finishes. The following &lt;code&gt;_~&lt;/code&gt; pushes a copy of the block and executes it, pushing the string &lt;code&gt;_~&lt;/code&gt; on the stack.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In synthesis, it defines a function, prints the function, then prints the code that executes the function. This is &lt;em&gt;exactly&lt;/em&gt; what your example in the question does, so it is every bit as valid as the CJam quine, which is valid by community consensus.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Reading a function's source is indirectly reading part of the source of the program&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It is not. The JavaScript quine defines a function and manipulates its string representation. This is no different from defining a string and printing and eval-ing that string, which is what the shortest quines in most interpreted languages do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As long as you don't access the source code of your &lt;em&gt;program&lt;/em&gt; (rather that using string representations of parts thereof), you're not violating our definition.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-08-08T19:02:44.340" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="13639" PostTypeId="2" ParentId="13603" CreationDate="2017-08-08T19:54:58.703" Score="4" Body="&lt;h1&gt;Input should not rely on existing custom state&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The value given as input should not rely on any other state - global variables, environment variables, etc. - created by the robber. It may set this state itself, but cannot rely on them being set prior to the input being given to the function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following JavaScript is &lt;strong&gt;valid&lt;/strong&gt;, since the input does not rely on any external state - although a global variable is created, it is not important for the input to work (only for creating the input);&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;obj = {a: 1};&#xA;f(Object.freeze(obj));&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The following JavaScript is &lt;strong&gt;invalid&lt;/strong&gt;, since the input relies on non-input state (namely that there exists a global function called &lt;code&gt;g&lt;/code&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;g = () =&amp;gt; &quot;Hello, World!&quot;;&#xA;f(&quot;g&quot;); // f = string =&amp;gt; eval(string)()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The following JavaScript is &lt;strong&gt;valid&lt;/strong&gt;, since the input creates the state itself (it creates a global variable called &lt;code&gt;g&lt;/code&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input = &quot;g=()=&amp;gt;'Hello, World!',g&quot;;&#xA;f(input); // f = string =&amp;gt; eval(string)()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The following JavaScript is &lt;strong&gt;not valid&lt;/strong&gt;, since it relies on non-input state (namely overwriting a variable used by the cop)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;v = () =&amp;gt; true;&#xA;f([]); // v = [].every; f = array =&amp;gt; v.call(array, v=&amp;gt;v)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="72685" LastEditorUserId="72685" LastEditDate="2017-08-09T08:03:36.627" LastActivityDate="2017-08-09T08:03:36.627" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13640" PostTypeId="1" CreationDate="2017-08-08T20:06:41.770" Score="0" ViewCount="59" Body="&lt;p&gt;Recently, there have been some challenges involving the OEIS. Specifically, when given an index as input, the challenge spec involves output the item in the OEIS at that index. However, for constant sequences, there have been answers that discard the input because it is not needed to calculate the result.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Are answers allowed to not take input that is in the spec?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="65836" LastEditorUserId="66833" LastEditDate="2019-10-17T20:19:08.973" LastActivityDate="2019-10-17T20:19:08.973" Title="Do programs need to take input, if it is in the spec?" Tags="|discussion|" AnswerCount="1" CommentCount="10" ClosedDate="2017-08-08T21:05:37.480" ContentLicense="CC BY-SA 3.0" />
  <row Id="13641" PostTypeId="1" AcceptedAnswerId="13644" CreationDate="2017-08-08T20:18:14.590" Score="9" ViewCount="373" Body="&lt;p&gt;For instance, consider the following un-golfed submission in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c&amp;#39;&quot; rel=&quot;tag&quot;&gt;c&lt;/a&gt; to some &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge requiring the use of a while looping construct:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;void function() {&#xA;     int a, b;&#xA;     while(a != b) {&#xA;         // Do something&#xA;     }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Although the &lt;code&gt;while&lt;/code&gt; loop would be invoked most of the time, there is an &lt;em&gt;extremely&lt;/em&gt; small chance, but still a chance, that the un-initialized local variables &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; could start out with the same value. Is this okay? It would be nice to come to a consensus on this.&lt;/p&gt;&#xA;" OwnerUserId="52405" LastEditorUserId="52405" LastEditDate="2017-08-08T21:02:49.243" LastActivityDate="2017-08-09T04:59:25.337" Title="Is it okay if a submission has an extremely small chance of not functioning properly?" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13642" PostTypeId="2" ParentId="13640" CreationDate="2017-08-08T20:47:59.787" Score="1" Body="&lt;h1&gt;No, answers do not need to explicitly take input.&lt;/h1&gt;&#xA;&lt;p&gt;If the output of the program matches the desired result for the given input (even though the program does not make a call to the input (e.g: &lt;code&gt;input()&lt;/code&gt; in Python), the answer is correct. Unless specified otherwise (i.e, a spec like &lt;em&gt;the programs must use the given input in some way&lt;/em&gt;), every submission that gives correct results should be considered valid.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-08T20:49:13.257" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13644" PostTypeId="2" ParentId="13641" CreationDate="2017-08-08T21:00:57.663" Score="20" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;If a program does not do what it is supposed to do, it is not valid as an answer. Otherwise we'd have to quantify what probability the answers have to work with, which is getting messy.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-09T04:59:25.337" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13647" PostTypeId="2" ParentId="2140" CreationDate="2017-08-09T01:55:38.993" Score="1" Body="&lt;h1&gt;Left or Right?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You have a carousel of images, and you know the index of the image you wish to view.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The carousel shows a few images per page, so you need to be able to calculate if you need to move at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, the carousel wraps - so you can click 'right' on the last page to go to the first page, and 'left' on the first to go to the last.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first image on the first page is at index 0 - and the last page may not, depending on the amount of images, always be full. If you prefer, you may start your indexing at 1 instead, but remember that the indexes in all of the example inputs will need to have 1 added to them.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;4 numbers, in whatever format is suitable for your language;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Total&lt;/strong&gt; - The amount of images in the carousel (1 or greater)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;PageSize&lt;/strong&gt; - The amount of images per section in the carousel&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;CurrentIndex&lt;/strong&gt; - The index of the image you are currently looking at (0 to Total-1)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;DestinationIndex&lt;/strong&gt; - The index of the image you wish to look at.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The desired direction to scroll (if at all). This should be the fastest direction (ie least amount of clicks), desiring right in the case of a tie.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Either;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;L&lt;/strong&gt; - Click the left button (ie, go backwards)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;R&lt;/strong&gt; - Click the right button (ie, go forwards)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;N&lt;/strong&gt; - No movement required - output this if the image you seek is on the same page as your current image.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If you prefer, you may specify 3 other distinct outputs, such as &lt;code&gt;-1&lt;/code&gt; &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt; for example.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Say we have &lt;code&gt;5 3 0 4&lt;/code&gt;, so 5 total images, a page size of 3, we're currently at image index 0, aiming for 4. Our carousel would look something like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt; [0 1 2] &amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Pressing either left or right (there are only 2 pages) would lead us to this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt; [ 3 4 ] &amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;On this page, we can see image 4 which we are aiming for, so in this example, you would be expected to return &lt;code&gt;R&lt;/code&gt;. Although &lt;code&gt;L&lt;/code&gt; is the same length, in this exercise we are to favour going right in the case of a tie. Also note that you are expected to return just the direction you would need to go, so if you would have to click &lt;code&gt;R&lt;/code&gt; 3 times, still only return one &lt;code&gt;R&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some more test cases;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;5 2 0 2 -&amp;gt; R&#xA;10 5 1 4 -&amp;gt; N&#xA;10 3 8 1 -&amp;gt; R&#xA;10 3 8 4 -&amp;gt; L&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="13511" LastEditorUserId="13511" LastEditDate="2017-08-11T05:01:14.827" LastActivityDate="2017-08-11T05:01:14.827" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="13648" PostTypeId="2" ParentId="13603" CreationDate="2017-08-09T02:02:17.857" Score="2" Body="&lt;h1&gt;Input should match what the cop function actually receives&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input is not a statement&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A typical way of stretching the definition of input too far is when said &quot;input&quot; is a statement, and only the evaluated result of it is actually passed into the cop function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;cop:&#xA;f=_=&amp;gt;[].some(e=&amp;gt;e)&#xA;&#xA;robber:&#xA;f(Array.prototype.some=_=&amp;gt;true)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This proposed input is not an input because while the robber proposed &lt;code&gt;Array.prototype.some=_=&amp;gt;true&lt;/code&gt;, what the function actually receives is &lt;code&gt;Array.prototype.some&lt;/code&gt; (or &lt;code&gt;_=&amp;gt;true&lt;/code&gt;), which does not match what the robber has stated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, passing in either of the two actual input above (that the cop function actually receives) doesn't work:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f(Array.prototype.some) // -&amp;gt; false&#xA;f(_=&amp;gt;true) // -&amp;gt; false&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which means this robber crack is not valid.&lt;/p&gt;&#xA;" OwnerUserId="73228" LastActivityDate="2017-08-09T02:02:17.857" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13649" PostTypeId="2" ParentId="2140" CreationDate="2017-08-09T04:22:51.480" Score="3" Body="&lt;h1&gt;Random number from 0 to n&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a &lt;strong&gt;program/function&lt;/strong&gt; that, given &lt;strong&gt;a positive integer n&lt;/strong&gt;, outputs a &lt;strong&gt;uniformly random integer from 0 to n&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input will be a &lt;strong&gt;positive (non-zero) integer&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;It will be in your language's number handling capabilities. // reword&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output must be a &lt;strong&gt;uniformly (pseudo)random integer&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Every integer in the range &lt;strong&gt;[0, n)&lt;/strong&gt; must have an &lt;strong&gt;equal chance of being outputted&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that your chosen language's built-in RNG is uniform.&lt;/li&gt;&#xA;&lt;li&gt;Must be in &lt;strong&gt;0 to n, in [0, n), ≥ 0 and &amp;lt; n&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Specifications&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot; title=&quot;Default for Code Golf: Input/Output methods&quot;&gt;Standard I/O rules&lt;/a&gt; &lt;strong&gt;apply&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot; title=&quot;Loopholes that are forbidden by default&quot;&gt;Standard loopholes&lt;/a&gt; are &lt;strong&gt;forbidden&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;This challenge is not about finding the shortest approach in all languages, rather, it is about finding the &lt;strong&gt;shortest approach in each language&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Your code will be &lt;strong&gt;scored in bytes&lt;/strong&gt;, usually in the encoding UTF-8, unless specified otherwise.&lt;/li&gt;&#xA;&lt;li&gt;Built-in functions that perform this task are &lt;strong&gt;allowed&lt;/strong&gt; but including a solution that doesn't rely on a built-in is encouraged.&lt;/li&gt;&#xA;&lt;li&gt;Explanations, even for &quot;practical&quot; languages, are &lt;strong&gt;encouraged&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Note that this challenge is tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; and hence will have non-deterministic outputs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Incoming!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We &lt;em&gt;seriously&lt;/em&gt; don't have this already?!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="68615" LastEditorUserId="68615" LastEditDate="2017-08-10T02:07:45.270" LastActivityDate="2017-08-10T02:07:45.270" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="13650" PostTypeId="1" CreationDate="2017-08-09T05:54:16.393" Score="7" ViewCount="150" Body="&lt;p&gt;I made a language called &lt;a href=&quot;https://github.com/Wheatwizard/Lost&quot; rel=&quot;nofollow noreferrer&quot;&gt;Lost&lt;/a&gt;.  As a fun programming exercise I tasked myself with making a program that would output the digits 0-9 all with equal probability.  This was a difficult task, however I found a solution and had a lot of fun doing so.  I thought this would make for a good challenge for the community.  However I've encounter what I view as a dilemma.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would like to ask the question as a language specific question, because generate a number 0-9 is not a very interesting question at all and I can't see it being well received.  On the other hand I don't really see why my question has to be language specific, it is doable and well defined in other languages its just boring in most of them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I tried looking for an existing question with similar requirements that I could perhaps bounty, but all the questions were too dissimilar to be feasible in Lost (bounties only last for a week).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What should I do?  Is there a solution to this dilemma? Am I overthinking it?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What should be done in general about questions that can be expanded to include all languages but are only interesting in a select few?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="41024" LastEditDate="2017-08-09T09:06:16.230" LastActivityDate="2017-08-09T09:06:16.230" Title="A question about language specific tasks" Tags="|discussion|asking-questions|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13651" PostTypeId="2" ParentId="13637" CreationDate="2017-08-09T06:11:26.687" Score="4" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Consider &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenges. Significant effort on the part of the challenge presenter goes into collecting the code entries and massaging them into a runnable state (language versions, compiling, etc). This effort can be reduced by limiting languages, but that also limits your audience.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;To quote from the tag wiki:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;In fact, it is strongly recommended that before posting you upload the test framework, one or two simple example bots, and a build script as a public repository on a site such as GitHub. Then competitors can easily download and build the other bots when developing a new one, and might even send you a pull request with their new bot and its build script. See, for example, &lt;a href=&quot;https://github.com/pjt33/ppcg36515&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://github.com/pjt33/ppcg36515&lt;/a&gt; , which has a make setup that allows building the test framework and the bots in one step.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;There is certainly nothing wrong with &lt;em&gt;requesting&lt;/em&gt; that competitors send you a pull request, although I don't think it should be an absolute &lt;em&gt;requirement&lt;/em&gt; to create an account on a separate system and learn how to use git to participate.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Is it wrong to ask for an executable for languages that compile?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;There are various practical problems with this.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Multiple platforms (x86 vs x64 vs ARM, Linux vs Windows vs OS X, etc.)&lt;/li&gt;&#xA;&lt;li&gt;Source code can normally be copied directly; binaries need to be encoded in some form, and it may be as much hassle to install &lt;code&gt;uudecode&lt;/code&gt; on Windows as to install a compiler.&lt;/li&gt;&#xA;&lt;li&gt;Running an executable file you downloaded from the Internet requires putting a lot of trust in the person who posted it and the various systems through which it has passed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;These day's it's simple to stand up serverless services. Is it wrong to ask for a web service endpoint?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It may be simple, but it's not necessarily free, and it's still a big learning curve for people who don't already do it on a regular basis. And that's before you get into the many different flavours of web service, which may mean that calling someone else's is more difficult than compiling their code. I would strongly recommend against this.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-08-09T06:11:26.687" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13652" PostTypeId="2" ParentId="13603" CreationDate="2017-08-09T07:14:52.667" Score="1" Body="&lt;h1&gt;If the cop's code has a &quot;natural way&quot; of getting input, that's the only thing allowed to use by default&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Consider &lt;a href=&quot;https://codegolf.stackexchange.com/a/137837/71420&quot;&gt;this cop&lt;/a&gt;. It shows TeX code that reads input from &lt;code&gt;stdin&lt;/code&gt; using &lt;code&gt;\read16to&lt;/code&gt;. This is a clear indicator that your input should indeed come from &lt;code&gt;stdin&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, TeX allows to call a program from within a code snippet you provide at the commandline, and I used this in my &lt;a href=&quot;https://codegolf.stackexchange.com/a/138130/71420&quot;&gt;suggested crack&lt;/a&gt; to first redefine one of TeX's macros before the cop code is executed. According to the general rules in the challenge, input may come from command line arguments as well. But it conflicts with what I said above. Therefore, I suggest the following guidelines:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input should use the &quot;natural way&quot; that's &lt;em&gt;obviously&lt;/em&gt; provided by cop's code if not explicitly stated otherwise in cop's description.&lt;/li&gt;&#xA;&lt;li&gt;Other forms of input are valid &lt;strong&gt;only&lt;/strong&gt; if you can prove they are strictly necessary for a crack.&lt;/li&gt;&#xA;&lt;li&gt;To avoid any ambiguity, a cop submission &lt;em&gt;should&lt;/em&gt; explicitly state which method of input is acceptable.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;To clarify: I'm unsure whether my suggested crack would be valid according to these guidelines. I don't see any other way of cracking the cop in question, but that doesn't mean there is none. The cop author claims it's possible using only &lt;code&gt;stdin&lt;/code&gt;. I would require such a solution to work with &lt;em&gt;any&lt;/em&gt; implementation of TeX, so if it relies on some undocumented behavior of &lt;em&gt;some&lt;/em&gt; TeX implementations, I'd consider it &quot;impossible&quot; (because the cop doesn't mention which TeX implementation to use).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore I would now wait and see, I'm just posting this answer as suggested guidelines and a base for discussion.&lt;/p&gt;&#xA;" OwnerUserId="71420" LastActivityDate="2017-08-09T07:14:52.667" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13654" PostTypeId="2" ParentId="13650" CreationDate="2017-08-09T09:05:08.443" Score="7" Body="&lt;h1&gt;Post it as a language-specific challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The challenge here isn't &quot;print a digit 0-9 uniformly randomly&quot; (booooring), but rather &quot;print a digit 0-9 uniformly randomly in a specific language where almost everything is really challenging&quot;. The main part is managing to do anything in that language in your case, so in my opinion it would be a good language-specific challenge.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2017-08-09T09:05:08.443" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="13655" PostTypeId="2" ParentId="13620" CreationDate="2017-08-09T09:14:24.943" Score="3" Body="&lt;h1&gt;Stay open&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Closed&lt;/em&gt; was closed as a dupe of &lt;em&gt;Old&lt;/em&gt;, but &lt;em&gt;New&lt;/em&gt; shouldn't be closed as a dupe of &lt;em&gt;Closed&lt;/em&gt;, since &lt;em&gt;Closed&lt;/em&gt; has been already been closed as a dupe of &lt;em&gt;Old&lt;/em&gt;, and &lt;em&gt;New&lt;/em&gt; isn't itself a dupe of &lt;em&gt;Old&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Basically, if answers from a challenge X can't be transferred to another challenge Y without non-trivial modifications, then Y isn't a dupe of X. This is almost the case here: Y⊃X has been closed as a dupe of X, but Z⊂Y shouldn't be closed as a dupe of an already closed challenge, in this case Y, and answers from Y (after being transferred there from X) can't be transferred in such a way to Z, so Z isn't a dupe of Y in this case.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2017-08-09T09:19:39.823" LastActivityDate="2017-08-09T09:19:39.823" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13656" PostTypeId="2" ParentId="13619" CreationDate="2017-08-09T09:28:11.387" Score="3" Body="&lt;h1&gt;Depends on implementation&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Yes, if they're required for your program to be valid in your implementation.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No, if removing them will not cause any harm while using your implementation.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;That is, well, since a language is defined by its implementation. And yes, machine code may have different implementations across different CPUs, architectures and operating systems.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2017-08-09T09:28:11.387" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13657" PostTypeId="2" ParentId="13608" CreationDate="2017-08-09T15:51:40.257" Score="10" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Some questions don't really need much review.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is true, but it has an enormous caveat, which is that the only way to be sure that a given question is one of them is to post it for review. The author is one of the people least qualified to judge whether the specification is clear and unambiguous because they have internalised the unspoken assumptions.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If you're a user that has asked 50 questions already you probably don't need to post your latest code-golf question to the sandbox.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'm not convinced that the number of questions previously asked is the right metric. If you're a user whose previous 10 questions passed through the sandbox without needing a single clarification then maybe you don't need to sandbox. But then again, if your new question is sufficiently different to the previous ones to be worth posting, there's a chance that it touches on a field where you're not an expert and an expert in that field can spot a misunderstanding, or that it touches on a field where you are an expert and you don't realise that you haven't dumbed it down enough.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Simple posts serve mostly to bury challenges that need attention. Challenges written by new users or challenges involving novel scoring or mechanics, should be given much more attention than they are currently getting.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I agree with the second sentence, but not the first. Simple posts can be reviewed in a quick break while waiting for code to compile. IMO the biggest obstacle to reviewing complex challenges is that the effort required means that they can only be reviewed by setting aside a decent chunk of time when you're mentally alert and not engaged in another activity.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;It seems a lot of the time that we are using the sandbox as a dupe watch, for title suggestions, or even just a holding place for drafts.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;IMO dupe watch is a valuable feature of the sandbox. I'm not sure why you apparently see it negatively.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;TL;DR:&lt;/strong&gt; the only situation I can think of when a question doesn't need sandboxing is when it's not doing anything new or interesting, and in that case it's not worth posting directly to main either.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-08-09T15:51:40.257" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13659" PostTypeId="2" ParentId="2140" CreationDate="2017-08-09T18:16:40.663" Score="0" Body="&lt;h1&gt;Bomberman&lt;/h1&gt;&#xA;&lt;p&gt;Given an input Bomberman board &lt;code&gt;b&lt;/code&gt;, use the following characters to define the different bomberman tiles:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;X&lt;/code&gt; denotes the outer boundary of the board.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;X&lt;/code&gt; is always in each of the four corners of the board.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;X&lt;/code&gt; may only be on the boundaries of the board.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;-&lt;/code&gt; denotes an empty space.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When a bomb blows up over an empty space, it replaces it with &lt;code&gt;*&lt;/code&gt;; and may continue.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;o&lt;/code&gt; denotes a blocker that is breakable.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When a bomb blows up over a breakable blocker, it replaces it with &lt;code&gt;*&lt;/code&gt;; and stops.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;O&lt;/code&gt; denotes an impenetrable blocker.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When a bomb reaches an impenetrable blocker, it stops prior to it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;0-9&lt;/code&gt; describes a bomb of &lt;code&gt;n&lt;/code&gt; power.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When a bomb explodes it explodes in a plus pattern.&lt;/li&gt;&#xA;&lt;li&gt;A bomb of &lt;code&gt;0&lt;/code&gt; strength would be: &lt;code&gt;*&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A bomb of &lt;code&gt;1&lt;/code&gt; strength would be: &lt;code&gt;* \n***\n *&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;And so on... 1-indexing is not okay because that would make the 9 bomb a 10 bomb.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Worked Example&lt;/h1&gt;&#xA;&lt;p&gt;An example board would be (without bombs):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;XXXXXXXXXXXX&#xA;X----------X&#xA;X-oo---O---X&#xA;X--------O-X&#xA;X--OoO-----X&#xA;X----------X&#xA;X--O-------X&#xA;X-------O--X&#xA;-----o------&#xA;X---------OX&#xA;X--O---o---X&#xA;XXXXXXXXXXXX&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If we were to add some randomized bombs to this board we would see:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;XXXXXXXXXXXX&#xA;X----------X&#xA;X-oo-1-O---X&#xA;X--------O-X&#xA;X--OoO--0--X&#xA;X---1------X&#xA;X--O-3-----X&#xA;X-------O--X&#xA;--4--o------&#xA;X---------OX&#xA;X--O-2-o---X&#xA;XXXXXXXXXXXX&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This should, when input to your program, output the following explosion pattern:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;XXXXXXXXXXXX&#xA;X----*-----X&#xA;X-oo***O---X # This didn't get blocked, it's just a small explosion.&#xA;X----*---O-X&#xA;X-*O*O--*--X # This destroyed a brittle block.&#xA;X-****-----X&#xA;X-*O*****--X # This got hard blocked.&#xA;X-*--*--O--X&#xA;*******---** # Notice how it wraps, because there's no boundary.&#xA;X-*--*----OX&#xA;X-*O****---X # This got hard-blocked.&#xA;XXXXXXXXXXXX&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Example 1:&lt;/h1&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;XX&#xA;XX&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;XX&#xA;XX&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Example 2:&lt;/h1&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;X-O--X&#xA;-o2-o-&#xA;-1--1-&#xA;-o-2o-&#xA;X--O-X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;X-O--X&#xA;-****-&#xA;******&#xA;-****-&#xA;X--O-X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Example 3:&lt;/h1&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;X     X&#xA; OOOO&#xA;  1114&#xA;&#xA;&#xA;X     X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;X    *X&#xA; OOOO*&#xA;*******&#xA;  ****&#xA;     *&#xA;X    *X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Boards must be rectangular or square.&lt;/li&gt;&#xA;&lt;li&gt;Boards must have blockers on the corners of the rectangle/square.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/awesome&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;awesome&amp;#39;&quot; rel=&quot;tag&quot;&gt;awesome&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/retro-ascii&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;retro-ascii&amp;#39;&quot; rel=&quot;tag&quot;&gt;retro-ascii&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;More examples, soon. Is this good? Sandbox? What should I change?&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-23T17:33:29.197" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13660" PostTypeId="1" AcceptedAnswerId="13661" CreationDate="2017-08-09T19:13:57.600" Score="9" ViewCount="493" Body="&lt;p&gt;I recently (this morning) extended &lt;a href=&quot;//git.io/Cubically&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cubically&lt;/a&gt; to have an internal cube of variable size. The cube size is passed via a third interpreter flag (&lt;code&gt;3&lt;/code&gt; for a 3x3x3, &lt;code&gt;4&lt;/code&gt; for a 4x4x4, etc).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All mathematical operations will differ based on the size of the cube. Attempting to add 26 and print it would be a different process in &quot;Cubically 4&quot; (4x4x4) than it would be in Cubically 3.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, I'm wondering, since the code in Cubically 3 will do something else in Cubically 4, and something else in 5, and yet another thing in 6...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are they considered different versions of the language?&lt;/li&gt;&#xA;&lt;li&gt;Can I use different Cubically &quot;versions&quot; in polyglots?&lt;/li&gt;&#xA;&lt;li&gt;Do I need to add 1 byte to my score for Cubically 4, as Cubically 3 is used by default, but Cubically 4 requires &lt;code&gt;-4&lt;/code&gt; to be passed to the interpreter? What about Cubically 26?&lt;/li&gt;&#xA;&lt;li&gt;Can one person complete a challenge in Cubically X, and someone else answer the same challenge in Cubically Y?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="61563" LastEditorUserId="61563" LastEditDate="2017-08-17T03:21:17.830" LastActivityDate="2017-08-17T23:15:37.220" Title="Can interpreter flags causing major language differences be considered different versions of the language?" Tags="|discussion|support|answers|languages|" AnswerCount="5" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13661" PostTypeId="2" ParentId="13660" CreationDate="2017-08-09T19:32:39.267" Score="17" Body="&lt;h1&gt;Answered in order&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Yes&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;They are different versions.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Maybe&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;It would depend upon the challenge in question. Some specify that major versions (e.g., Python 2 vs Python 3) are considered the same language, some have them different.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;No&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Just like how Perl and other languages get certain flags &quot;default&quot; for free, the same would be for this. If it's required for a &lt;code&gt;-4&lt;/code&gt; to be present for Cubically 4 to compile/interpret/run/whatever, then the &lt;code&gt;-4&lt;/code&gt; is a free flag.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sure, why not?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;We even allow answers in the same language, so what would be wrong for answering in two different versions of the same language?&lt;/p&gt;&#xA;" OwnerUserId="42963" LastActivityDate="2017-08-09T19:32:39.267" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13662" PostTypeId="2" ParentId="13660" CreationDate="2017-08-09T20:42:00.563" Score="2" Body="&lt;h1&gt;Just addressing number 2&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I agree with AdmBorkBork on all the other answers so I am just going to respond to the second question you ask.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Yes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You can make a polyglot between them.  As I see it there are two types of polyglots&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Polyglots where different languages output different results&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Polyglots where different languages output the same result&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The first type easily resolves itself, if they output different things they must be different languages.  The second case is a little more complex, but reiterating what I said &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13595/56656&quot;&gt;here&lt;/a&gt;, the question asker should really define what they mean by different languages, not rely on the meta to do it for them.  This means that if the difference in flags causes a difference in behavior sufficient to qualify for the difference in language, then they are different languages.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-08-09T20:42:00.563" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13664" PostTypeId="1" CreationDate="2017-08-10T00:40:19.577" Score="3" ViewCount="114" Body="&lt;p&gt;I recently joined this community as a Java golfer, and I haven't been able to find a definitive consensus on acceptable solution formats for Java.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From what I gather, the following are allowed (please correct if consensus is otherwise):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;full program (class definition with &lt;code&gt;main&lt;/code&gt; method)&lt;/li&gt;&#xA;&lt;li&gt;full method (modifiers, signature, body)&lt;/li&gt;&#xA;&lt;li&gt;lambda expression&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;What I'm wondering about is whether a multi-method solution is acceptable.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Description&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Such a solution would consist of program text defining two or more methods as they would appear in a class definition, a choice of one such method as an entry point to the program (which would take input and produce output according to standard rules), and, optionally, a class name. To clarify: a multi-method solution would not include fields, initializers, or class definitions; only methods.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Execution&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;These solutions would be tested by inserting the program text into an empty definition of a public class (as named by the author, if applicable) and then invoking, from a class within the same package, the entry method on an instance of the class produced by the default constructor or on the class itself if the method is static (author's choice).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rationale&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It's easy to imagine this being a desirable format for complex solutions. It permits subroutines more cheaply than a lambda or method solution (where class definitions or functional interface declarations would be required), and it is preferable to a full program solution because I/O can be done flexibly through method parameters and return values and class boilerplate is eliminated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If this question gets enough activity, I assume consensus will be decided by answer score. Answers may then be affirmative, negative, or affirmative with conditions/exceptions. If this has already been addressed, someone can refer to that discussion and close this one.&lt;/p&gt;&#xA;" OwnerUserId="44945" LastActivityDate="2017-08-10T01:58:20.557" Title="Are multi-method solutions allowed in Java?" Tags="|discussion|code-golf|java|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13665" PostTypeId="2" ParentId="13664" CreationDate="2017-08-10T01:58:20.557" Score="9" Body="&lt;h1&gt;You're allowed to define just methods&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/opinion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;opinion&amp;#39;&quot; rel=&quot;tag&quot;&gt;opinion&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We accept the definition of a single method as a code-golf answer, such:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-java prettyprint-override&quot;&gt;&lt;code&gt;public void f(int a, int b, int c){System.out.println(&amp;quot;Blah blah&amp;quot;);}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And it should be equally acceptable to define &lt;em&gt;many&lt;/em&gt; methods.&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-java prettyprint-override&quot;&gt;&lt;code&gt;public int c(int a, int b){return a+b;}&#xA;public void f(int a, int b){System.out.println(c(a,b))}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;As long as you're not assuming anything else about the program, EG. A Class Name, Imports, etc.&lt;/p&gt;&#xA;" OwnerUserId="58375" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-10T01:58:20.557" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13666" PostTypeId="2" ParentId="2140" CreationDate="2017-08-10T04:15:51.320" Score="0" Body="&lt;h1&gt;Make it night! &lt;sup&gt;&lt;sub&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;/sub&gt;&lt;/sup&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You just went on vacation to see some scenery in the beautiful night. Unfortunately, your alarm clock malfunctions and when you wake up, it's daytime.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your mother would like to see some photos, but you can only take pictures in the day. You would like to be able to convert these daytime pictures to pictures in the nighttime.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given an image taken in the daytime, process it and turn it into night time as best as you can.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sometimes it might be hard to do, like images that have a sun, but you can write your algorithm to remove the sun or do something else.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;(I did this by hand, so it might not be that good)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/4KyPy.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/4KyPy.jpg&quot; alt=&quot;Original&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/MqkG1.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/MqkG1.jpg&quot; alt=&quot;Result&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Voting&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Please vote accordingly to how well the algorithms perform.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the sky dark like a night sky?&lt;/li&gt;&#xA;&lt;li&gt;Does the picture look photoshopped/edited?&lt;/li&gt;&#xA;&lt;li&gt;Are there vivid colors that shouldn't appear in the night?&lt;/li&gt;&#xA;&lt;li&gt;If you were showed both images, would you believe that there was no processing?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;(If you have a suggestion, please comment.)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/mpykK.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/mpykK.jpg&quot; alt=&quot;Test case 1&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/GExQI.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/GExQI.jpg&quot; alt=&quot;Test case 2&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/EwJhg.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/EwJhg.jpg&quot; alt=&quot;Test case 3&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Winning&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Since this is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, the answer with the highest score (upvotes minus downvotes) wins.&lt;/p&gt;&#xA;" OwnerUserId="12537" LastEditorUserId="12537" LastEditDate="2017-08-10T14:05:11.410" LastActivityDate="2017-08-10T14:05:11.410" CommentCount="16" ContentLicense="CC BY-SA 3.0" />
  <row Id="13667" PostTypeId="2" ParentId="2140" CreationDate="2017-08-10T11:47:42.047" Score="0" Body="&lt;h1&gt;Intertwined Polyglot&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program which when executed as language A, produces a &lt;em&gt;different&lt;/em&gt; program in language B, which in turn produces the name of language A.  And the other way round (B to A to B).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+-----------+   Lang. A    +-----------+   Lang. B&#xA;| Program 1 | -----------&amp;gt; | Program 2 | -----------&amp;gt; &quot;&amp;lt;Lang. A&amp;gt;&quot;&#xA;|           |              +-----------+&#xA;|   Your    |              +-----------+&#xA;|  Program  | -----------&amp;gt; | Program 3 | -----------&amp;gt; &quot;&amp;lt;Lang. B&amp;gt;&quot;&#xA;+-----------+   Lang. B    +-----------+   Lang. A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The produced programs must be unique both from each other, and from the original program.&lt;/li&gt;&#xA;&lt;li&gt;Uniqueness is defined as at least one modified or moved printing character.  Example: &lt;code&gt;a bc&lt;/code&gt; =&gt; &lt;code&gt;ab c&lt;/code&gt; would &lt;strong&gt;not&lt;/strong&gt; be considered unique, whereas &lt;code&gt;a bc&lt;/code&gt;=&gt; &lt;code&gt;a cb&lt;/code&gt; would.&lt;/li&gt;&#xA;&lt;li&gt;The output may contain leading and/or trailing whitespace and/or newlines, so long as the language name is intact.&lt;/li&gt;&#xA;&lt;li&gt;Your program(s) may not take any input.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so fewest bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="16423" LastEditorUserId="16423" LastEditDate="2017-08-14T14:29:17.420" LastActivityDate="2017-08-14T14:29:17.420" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="13670" PostTypeId="1" AcceptedAnswerId="13676" CreationDate="2017-08-10T18:52:59.127" Score="2" ViewCount="233" Body="&lt;p&gt;&lt;sub&gt; the below pertains to the flag &lt;code&gt;language: lang-vba&lt;/code&gt;, which I have since been informed is not actually a flag, and for my use I should have been using &lt;code&gt;language: lang-vb&lt;/code&gt; &lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;VBA Code that uses conditional formatting, comments, date literals or open-ended strings is not highlighted correctly. For example, &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/t0pCv.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/t0pCv.png&quot; alt=&quot;Prettify&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;is not Highlighted like it is in the Microsoft Office Visual Basic Editor&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/EXbU7.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/EXbU7.png&quot; alt=&quot;Original&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;What is happening?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;It would seem that instead of properly identifying &lt;code&gt;'&lt;/code&gt; as the comment starting literal, it was incorrectly assigned to being a &lt;code&gt;char&lt;/code&gt; literal (note that VBA does not support &lt;code&gt;char&lt;/code&gt; literals in any fashion). It would seem that the &lt;code&gt;#&lt;/code&gt; character was then assigned to being the comment starting literal, instead of the &lt;a href=&quot;https://msdn.microsoft.com/en-us/library/aa240847(v=vs.60).aspx&quot; rel=&quot;nofollow noreferrer&quot;&gt;Conditional Compilation&lt;/a&gt; literal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of significant not is that &lt;code&gt;#&lt;/code&gt; also serves as the wrapping literal for declaring date type objects inline as seen in the example below&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/UcG61.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/UcG61.png&quot; alt=&quot;Prettify_1&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that the &lt;code&gt;#12:00:01 AM#&lt;/code&gt; is highlighted to indicate that it is commented out, rather than being represented like any other string or number literal&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Fe5MA.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Fe5MA.png&quot; alt=&quot;Original_1&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Beyond this, VBA does not support multiline string literals of any form, and &lt;em&gt;in certain cases&lt;/em&gt;  supports string literals without a terminating &lt;code&gt;&quot;&lt;/code&gt;. However, the current &lt;code&gt;Prettify.js&lt;/code&gt; setup for VBA supports multiline strings, meaning that you an end up with code blocks that look like the one below on our site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/vuHvN.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/vuHvN.png&quot; alt=&quot;Prettify_2&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;Note that line 3 is included in the string highlighting, despite not being a string&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;What needs to be changed?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;In the &lt;code&gt;Prettify.js&lt;/code&gt; config, &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The comment literal needs to be changed from &lt;code&gt;#&lt;/code&gt; to &lt;code&gt;'&lt;/code&gt; (which can be escaped by wrapping string)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The &lt;code&gt;'&lt;/code&gt; char(?) literal needs to be removed, as VBA does not support chars&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Removal of highlighting for multiline strings should be considered (if there are no characters, such as &lt;code&gt;,&lt;/code&gt; or &lt;code&gt;)&lt;/code&gt;,  expected after the end of a VBA string, VBA will autoformat to add a trailing &lt;code&gt;&quot;&lt;/code&gt; at the end of the line, and they are otherwise illegal strings)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It should be considered highlighting any, non-string, section of code which is wrapped in &lt;code&gt;[...]&lt;/code&gt; (where &lt;code&gt;...&lt;/code&gt; is some expression) in the same light red color as the string and number literals are, as this equivalent to a string which is wrapped in an &lt;code&gt;Application.Evaluate(&quot;...&quot;)&lt;/code&gt; call&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="61846" LastEditorUserId="61846" LastEditDate="2017-08-11T11:56:24.687" LastActivityDate="2017-08-11T11:56:24.687" Title="VBA Syntax Highlighting" Tags="|bug|status-bydesign|" AnswerCount="1" CommentCount="5" ClosedDate="2017-08-11T14:12:48.523" ContentLicense="CC BY-SA 3.0" />
  <row Id="13671" PostTypeId="2" ParentId="13660" CreationDate="2017-08-10T19:21:38.420" Score="-2" Body="&lt;h1&gt;Maybe, Maybe, Maybe and Maybe&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Well, for one thing, I would follow &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2402/how-to-count-languages/9444#9444&quot;&gt;this&lt;/a&gt; consensus for deciding if they're different versions.&lt;/li&gt;&#xA;&lt;li&gt;Same as above for polyglots.&lt;/li&gt;&#xA;&lt;li&gt;I'd say that you should count the size like normal command-line flags, depending on the current consensus &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/273/41024&quot;&gt;here&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;On duplicate answers, it would depend on the consensus &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10808/41024&quot;&gt;here&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2017-08-10T19:21:38.420" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13672" PostTypeId="2" ParentId="2140" CreationDate="2017-08-10T20:23:56.640" Score="-2" Body="&lt;h1&gt;The Self-Referential Algorithm&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Most people are familiar with Tupper's self-referential formula. When the formula is graphed on a calculator it &lt;em&gt;magically&lt;/em&gt; graphs itself. Wouldn't it be interesting if we could do something similar with a programming language?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Your task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a small program that will be able to output exactly itself when ran.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question so answers will be scored in bytes, with the fewest bytes winning.&lt;/p&gt;&#xA;" OwnerUserId="62532" LastActivityDate="2017-08-10T20:23:56.640" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13674" PostTypeId="1" CreationDate="2017-08-10T21:03:37.713" Score="25" ViewCount="763" Body="&lt;p&gt;There's some dispute over &lt;a href=&quot;https://codegolf.stackexchange.com/q/138436/45941&quot;&gt;this challenge's title&lt;/a&gt;. The author originally created it as &amp;quot;Многочлены Чебышёва&amp;quot;. A user edited it to &amp;quot;Chebyshev Polynomials&amp;quot; (an imperfect translation, but the translation commonly used in mathematics, and that is also used in the challenge body). A minor edit war erupted over the title. This meta post aims to solve this dispute, and any future disputes.&lt;/p&gt;&#xA;&lt;h2&gt;Pros&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Stack Exchange sites are in English (with a few exceptions - namely the foreign language Stack Overflow sites), so English-only challenge titles are consistent with the rest of the site.&lt;/li&gt;&#xA;&lt;li&gt;Having an English title makes it much easier to search for the majority of the userbase.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Cons&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;English translations may be imperfect or ambiguous.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Note: this is not trying to address the usage of non-English words or characters when they are in common use in English (like loanwords or mathematical symbols).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-23T13:35:30.430" Title="Should question/challenge titles always be in English?" Tags="|discussion|policy|challenges|" AnswerCount="7" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="13675" PostTypeId="2" ParentId="13674" CreationDate="2017-08-10T21:03:37.713" Score="8" Body="&lt;h2&gt;Yes, question/challenge titles should be in English&lt;/h2&gt;&#xA;&lt;p&gt;We require question/challenge bodies to be in English (by virtue of being an English SE site), so there is good reason to have titles follow the same rule. In the specific case of the linked challenge, there is a translation that is commonly accepted (Chebyshev Polynomials) in the English-speaking mathematical community, and thus there is no good reason to use the original Russian name over the English translation. Non-English names are an obvious exception to the rule - proper nouns need not be &amp;quot;translated&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;To quote &lt;a href=&quot;https://codegolf.stackexchange.com/questions/138436/%d0%9c%d0%bd%d0%be%d0%b3%d0%be%d1%87%d0%bb%d0%b5%d0%bd%d1%8b-%d0%a7%d0%b5%d0%b1%d1%8b%d1%88%d1%91%d0%b2%d0%b0#comment339430_138436&quot;&gt;Lynn&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;any transliteration is more useful than a title most users can’t read. you write Chebyshev in the body text, anyway, so you’re just being obnoxious.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-11T04:36:45.433" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13676" PostTypeId="2" ParentId="13670" CreationDate="2017-08-10T21:06:01.160" Score="2" Body="&lt;p&gt;Compare (below snippets are live syntax highlighting, not screenshots):&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Default (meant for C-like languages)&lt;/h1&gt;&#xA;&#xA;&lt;pre class=&quot;lang-fake prettyprint-override&quot;&gt;&lt;code&gt;Sub a()&#xA;#If n = 0 Then&#xA;Debug.Print &quot;N=0&quot;&#xA;#Else&#xA;Return 'This throws an error&#xA;#End If&#xA;End Sub&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Visual Basic&lt;/h1&gt;&#xA;&#xA;&lt;pre class=&quot;lang-vb prettyprint-override&quot;&gt;&lt;code&gt;Sub a()&#xA;#If n = 0 Then&#xA;Debug.Print &quot;N=0&quot;&#xA;#Else&#xA;Return 'This throws an error&#xA;#End If&#xA;End Sub&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In this case, you have to override the language hint, see &lt;a href=&quot;https://meta.stackexchange.com/a/184109/135945&quot;&gt;here&lt;/a&gt; for details.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Note: I used a non-existent language hint to get the default language handler in the first case because this meta forum defaults to &quot;none&quot;)&lt;/p&gt;&#xA;" OwnerUserId="2207" LastActivityDate="2017-08-10T21:06:01.160" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13677" PostTypeId="2" ParentId="13674" CreationDate="2017-08-10T21:30:34.657" Score="19" Body="&lt;h1&gt;Questions titles should, by and large, use the English alphabet&lt;/h1&gt;&#xA;&lt;p&gt;This is not as strict as Mego's answer. It does not force titles into English, but does request that they are using transliterations or phonetics instead of other alphabets, to improve SEO.&lt;/p&gt;&#xA;" OwnerUserId="65836" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-10T21:30:34.657" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="13678" PostTypeId="1" CreationDate="2017-08-10T21:37:39.973" Score="6" ViewCount="259" Body="&lt;p&gt;Take a look at this challenge: &lt;a href=&quot;https://codegolf.stackexchange.com/q/55857/68942&quot;&gt;Print This Question ↓&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It asks to print the exact contents of the question. Cool, right? There's even a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55857/print-this-question-%E2%86%93/55991#comment135683_55857&quot;&gt;comment by ETH&lt;/a&gt; saying &quot;&lt;em&gt;Let this be a reminder not to edit this post. Ever. Or we're all screwed.&lt;/em&gt;&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, Community edited the &lt;code&gt;http&lt;/code&gt; link in there to become &lt;code&gt;https&lt;/code&gt;. This is necessary for the &lt;code&gt;https&lt;/code&gt; transition; however, it makes it look like all of the answers are invalidated (see below). Should this be kept this way or rolled back?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that the challenge's specifications point to a specific revision, which means that the answers appear invalid but if you look carefully are actually good according to the original specs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also note that none of the answers have been active for less than half a year and...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;wait Mr. Xcoder just rolled back the Community edits.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So as a general question, should the https revisions be kept (invalidating some answers) or rolled back (potentially causing link rot) for really old challenges?&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="41024" LastEditDate="2017-08-14T07:49:45.100" LastActivityDate="2017-08-14T07:49:45.100" Title="http -&gt; https has caused issues with a specific challenge" Tags="|discussion|specific-question|hyperlinks|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13682" PostTypeId="2" ParentId="13674" CreationDate="2017-08-11T01:35:56.570" Score="-1" Body="&lt;h1&gt;No, They Should Not (with names)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/138436/%D0%9C%D0%BD%D0%BE%D0%B3%D0%BE%D1%87%D0%BB%D0%B5%D0%BD%D1%8B-%D0%A7%D0%B5%D0%B1%D1%8B%D1%88%D1%91%D0%B2%D0%B0&quot;&gt;this&lt;/a&gt; case the name has some issues when translated to English. These issues are solved by simply keeping the name in the original language. &lt;/p&gt;&#xA;" OwnerUserId="72169" LastActivityDate="2017-08-11T01:35:56.570" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13683" PostTypeId="2" ParentId="13674" CreationDate="2017-08-11T03:51:24.877" Score="17" Body="&lt;p&gt;Why not use both:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Chebyshev Polynomials/Многочлены Чебышёва&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is clear; the search will find it, and it has the original in case ambiguity is caused by transliteration.&lt;/p&gt;&#xA;" OwnerUserId="23493" LastActivityDate="2017-08-11T03:51:24.877" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13684" PostTypeId="2" ParentId="13678" CreationDate="2017-08-11T09:17:11.103" Score="10" Body="&lt;h1&gt;Roll back&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The https transition made by Community is, in this case, an edit you would reject as a suggested edit in review, since it drastically changes the meaning of the post, telling people to print something different than intended.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2017-08-11T09:17:11.103" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="13685" PostTypeId="1" CreationDate="2017-08-11T14:20:52.093" Score="7" ViewCount="287" Body="&lt;p&gt;I've seen tons of Javascript + HTML answers, however... I was wondering if it's okay to compete in a graphical-output challenge such as: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/85047/use-16-colors-while-writing-hey-4-times&quot;&gt;Use 16 colors while writing Hey! 4 times&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using an 05AB1E answer like this:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;https://github.com/Adriandmen/05AB1E&quot; rel=&quot;nofollow noreferrer&quot;&gt;05AB1E/HTML5&lt;/a&gt;, 63 bytes&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;17F&quot;Hey!&quot;N&amp;lt;4%èžz&amp;lt;N÷300+h&quot;&amp;lt;x style='color:#ÿ;'&amp;gt;ÿ&amp;lt;/x&amp;gt;&quot;}})¦J&quot;'&quot;'&quot;:&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##MzBNTDJM/f/f0NxNySO1UlHJz8ZE9fCKo/uqbPwObzc2MNDOULKpUCguqcxJtVVPzs/JL7JSPrzfWt3u8H4b/Qo7pdpazUPLvJTUgdDq/38A&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;05AB1E – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Should this be allowed? Or simply because it isn't a native function to render HTML in 05AB1E should it not be allowed?&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="61563" LastEditDate="2017-08-15T16:45:10.807" LastActivityDate="2017-08-16T16:36:09.463" Title="Can you mix an Esolang with HTML?" Tags="|discussion|" AnswerCount="2" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="13686" PostTypeId="2" ParentId="2140" CreationDate="2017-08-11T15:11:19.943" Score="1" Body="&lt;h1&gt;Smooth Usage [On hold while alternative scoring is considered]&lt;/h1&gt;&#xA;&#xA;&#xA;&#xA;&lt;p&gt;We've all seen CPU usage graphs like this one:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/oGERH.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/oGERH.png&quot; alt=&quot;CPU Usage example&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Doesn't that look ugly?  It would look much nicer as a lovely smooth sine wave...&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program in the language of your choice that will infinitely produce a regular sine wave in Task Manager's (or Activity Monitor's if that's your thing) CPU usage graph.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;You may assume:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Background CPU usage is constant&lt;/li&gt;&#xA;&lt;li&gt;Only a single core must display the pattern&lt;/li&gt;&#xA;&lt;li&gt;The system has sufficient cooling to prevent thermal throttling&lt;/li&gt;&#xA;&lt;li&gt;Features such as Intel TurboBoost are disabled&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is tagged as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; to encourage short answers, but ultimately will be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; as I suspect perfect solutions will be hard to come by.&lt;/p&gt;&#xA;" OwnerUserId="16423" LastEditorUserId="16423" LastEditDate="2017-08-14T08:45:14.930" LastActivityDate="2017-08-14T08:45:14.930" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13689" PostTypeId="2" ParentId="13685" CreationDate="2017-08-11T20:08:37.883" Score="3" Body="&lt;p&gt;&lt;em&gt;Theoretically&lt;/em&gt; isn't good enough (such as a theoretical TIO built-in). An interpreter &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10226/34718&quot;&gt;has to exist at the time of the question being posted&lt;/a&gt;. So if there isn't currently an existing way to run/render such code/output, then it shouldn't be allowed.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Have a publicly available interpreter / compiler before² the question was posted, unless explicitly allowed by the question.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="34718" LastActivityDate="2017-08-11T20:08:37.883" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13691" PostTypeId="2" ParentId="2140" CreationDate="2017-08-11T23:12:43.010" Score="1" Body="&lt;h2&gt;Archer Battle&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to simulate a battle between two armies of archers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each army has a population and an accuracy. Each round, every archer will let fly an arrow at the enemy army. The archers are trained each to shoot at different targets. Any archer hit by an enemy arrow is eliminated, and is does not participate in the next round. The battle is over when all archers in one or both armies have been eliminated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The accuracy of the archers is almost exact. That is, &lt;code&gt;ceil(population * accuracy)&lt;/code&gt; arrows will hit their targets. (No need to use random number generation.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Take 4 inputs in any reasonable manner:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Army 1 population (positive integer)&lt;/li&gt;&#xA;&lt;li&gt;Army 2 population (positive integer)&lt;/li&gt;&#xA;&lt;li&gt;Army 1 accuracy (nonnegative float)&lt;/li&gt;&#xA;&lt;li&gt;Army 2 accuracy (nonnegative float)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Output the population of the winning army at the end of the battle.&lt;/p&gt;&#xA;" OwnerUserId="72661" LastActivityDate="2017-08-11T23:12:43.010" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13692" PostTypeId="2" ParentId="13685" CreationDate="2017-08-12T00:39:20.393" Score="14" Body="&lt;p&gt;For most graphical output challenges, outputting HTML is ok. It's the same as a program outputting a bunch of data and saying &quot;save this as a GIF/BMP/etc.&quot; The confusion for this challenge is the wording: &lt;em&gt;Must be output in STDOUT or the primary colour text output of your language.&lt;/em&gt; 05AB1E has no form of color output so the OP's statement doesn't apply. You should ask the OP if your form of output is allowed for that challenge.&lt;/p&gt;&#xA;" OwnerUserId="46313" LastEditorUserId="46313" LastEditDate="2017-08-16T16:36:09.463" LastActivityDate="2017-08-16T16:36:09.463" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13693" PostTypeId="2" ParentId="13674" CreationDate="2017-08-12T06:24:33.813" Score="3" Body="&lt;h2&gt;The occasional title not in English isn't a big deal&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I don't think any killer argument has been made that harm is done by having a small number of non-English titles. I'm discounting the various claims made that a non-English title harms search because no-one has been able to say &lt;em&gt;how&lt;/em&gt; it harms search. In my experience whenever I'm trying to find a question I end up opening various questions from the search results to read them because the title is never sufficiently descriptive anyway.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Suppose we have a question with the title &lt;strong&gt;&lt;/strong&gt; (chosen because I doubt that more than one or two people on the site read Ugaritic). In what contexts does the title appear?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Search results. Already discussed.&lt;/li&gt;&#xA;&lt;li&gt;The main list of questions. Same conclusion as with search results: you have to open a question with an English title to figure out what it's really about, so there's no harm done.&lt;/li&gt;&#xA;&lt;li&gt;Automatic links in some contexts. Same conclusion.&lt;/li&gt;&#xA;&lt;li&gt;Hot network questions list. The conclusion is even stronger for two reasons: firstly, clickbaity titles are one of the most tried and tested ways to get and stay in the HNQ; and secondly, the HNQ already includes questions from non-English sites in the network. At worst people would say, &quot;Oh, those code golfers are being silly again&quot;. Languages with &lt;em&gt;-fuck&lt;/em&gt; in their names are a problem for HNQ, but unintelligible titles are par for the course.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The only thing which I think could be a problem is fonts which don't include the necessary characters: if the title is a series of boxes, that's pretty bad. This also means that because of the Unicode CJK unification debacle it may be best not to use Chinese, Japanese, or Korean in the title because it might render very differently for some users. But in moderation I see no problem with titles which have a justification for using another language, even in another alphabet, doing so.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-08-12T06:24:33.813" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13694" PostTypeId="2" ParentId="13608" CreationDate="2017-08-12T09:26:49.837" Score="1" Body="&lt;h1&gt;No, if you're an established question-asker&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;After you've read and asked a certain number of questions, you can generally tell when you're going to need sandbox help, and when you can handle everything, or address the minor things that come up as they come up. While using the sandbox can help polish up questions, it takes extra time and effort, and for someone who knows what they're doing and isn't asking an unusually complicated question, it isn't needed.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Yes, if you're new or things aren't quite going smoothly&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If you haven't asked many questions, or are having trouble writing questions that don't need lots of editing, or having trouble writing questions that don't get put on hold, then you should use the sandbox. Posting to the main site isn't the right place for questions that aren't ready yet, and if you're in these categories of askers, that's where your question might fall.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2017-08-12T09:26:49.837" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13695" PostTypeId="2" ParentId="13660" CreationDate="2017-08-12T10:47:48.470" Score="4" Body="&lt;h2&gt;This needs to be handled on a case-by-case basis, but looks fine here.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We shouldn't make a blanket statement that interpreter flags define a new language version. This runs in to the &lt;a href=&quot;https://esolangs.org/wiki/MetaGolfScript&quot; rel=&quot;nofollow noreferrer&quot;&gt;MetaGolfScript&lt;/a&gt; problem, where different languages essentially encode part of the code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this case, however, the languages are substantively different, so I think it's fine.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2017-08-12T10:47:48.470" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13697" PostTypeId="1" AcceptedAnswerId="13698" CreationDate="2017-08-12T14:33:25.607" Score="6" ViewCount="377" Body="&lt;p&gt;I'm new to PPCG and I've seen a bunch of questions with this line in their requirements:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Standard loopholes apply.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;A quick search on Meta tells me it's a series of restrictions, or disallowed things.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However today I saw a question with this statement:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Standard loopholes are &lt;strong&gt;forbidden&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;(The original question has the word &quot;forbidden&quot; bolded so I also bold it here.) That made me confused:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is &quot;Standard loopholes&quot; a series of permission or denial? In other words, what does the word &quot;apply&quot; mean? Allow or forbid?&lt;/p&gt;&#xA;" OwnerUserId="71806" LastActivityDate="2017-08-12T14:47:40.720" Title="What does &quot;Standard loopholes apply&quot; mean?" Tags="|support|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13698" PostTypeId="2" ParentId="13697" CreationDate="2017-08-12T14:46:29.700" Score="9" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Standard loopholes apply.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;means that you cannot use anything forbidden by the standard loopholes.  This is the default for every question whether you say it or not, but some users like to reiterate it when asking a question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You would never allow all the standard loopholes because these include some pretty dumb things, like printing what the question asks verbatim, e.g.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;print &quot;Every other prime less than n&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If a user wants to allow a specific loophole for some reason, and there can be good reasons for this, they would state the exact loophole and make it clear it is allowed.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-08-12T14:46:29.700" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13700" PostTypeId="2" ParentId="13674" CreationDate="2017-08-12T21:31:58.627" Score="24" Body="&lt;h1&gt;By default, use English. With a reason, feel free to vary.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A good example of a challenge which uses some non-English is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/85487/i-programming-puzzles-il-code-golf&quot;&gt;I programming puzzles, il code golf&lt;/a&gt;, which is a question about the usage of the definite article in Italian, and demonstrates the point of the question in the title. This title gives a good idea of the challenge, which would be hard to do without using some Italian.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a situation like the one which sparked this question, where there is a non-English term you'd like to use, but a reasonable translation in English exists, a good option is to give both, to help more people understand the title. A good example of this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/68591/conjugate-in-the-spanish-imperfect-conjugue-en-el-imperfecto-de-indicativo&quot;&gt;Conjugate in the Spanish imperfect / Conjugue en el imperfecto de indicativo&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, if there's something you want to ask about which doesn't survive translation well, try to also describe it in English a bit. For instance, if you're asking a question about drawing the Chinese character 臺, your title could be &quot;Draw 臺, the first character of Taiwan&quot;, rather than simply &quot;臺&quot;. This hypothetical title both needs to use some non-English, but also has some English to help people without the right font, help search terms, and provide clarification in general.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="20080" LastEditDate="2017-08-15T13:37:44.187" LastActivityDate="2017-08-15T13:37:44.187" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13701" PostTypeId="1" AcceptedAnswerId="13702" CreationDate="2017-08-13T02:20:26.107" Score="7" ViewCount="224" Body="&lt;p&gt;The recent question, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/137846/polyglot-the-oeis&quot;&gt;Polyglot the OEIS!&lt;/a&gt;, has been VTCed as a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/65641/the-versatile-integer-printer?noredirect=1&amp;amp;lq=1&quot;&gt;The versatile integer printer&lt;/a&gt;, however the community has not reached consensus on whether it is a dupe.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Currently, it has been VTCed by the community, reopened, and is one vote from closing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question: &lt;strong&gt;Is it a dupe?&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Please note that voting on this question does not establish your opinion on whether it is a dupe.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Please vote on answers instead.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastActivityDate="2017-08-14T09:40:39.127" Title="Is &quot;Polyglot the OEIS!&quot; a dupe of &quot;The versatile integer printer&quot;?" Tags="|discussion|specific-question|duplicates|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13702" PostTypeId="2" ParentId="13701" CreationDate="2017-08-13T02:20:26.107" Score="6" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It's a dupe based on our policy of duplicates: &lt;em&gt;answers from one are easily copy-pasted and modified from one to another.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1876/58826&quot;&gt;Here's the relevant policy.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastEditorDisplayName="user58826" LastEditDate="2017-08-14T09:40:39.127" LastActivityDate="2017-08-14T09:40:39.127" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13705" PostTypeId="2" ParentId="6918" CreationDate="2017-08-13T21:37:20.340" Score="4" Body="&lt;h1&gt;Cubically&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Cubically was created in 2017 by me, MD XF. It is built around the main piece of memory, a Rubik's Cube. To my knowledge there were (and are) no existing languages with a similar design.&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;p&gt;A 3x3x3 memory cube (the default) begins with this initialization:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   000           (top face)&#xA;   000&#xA;   000&#xA;111222333444     (left, front, right, and back faces, respectively)&#xA;111222333444&#xA;111222333444&#xA;   555           (bottom face)&#xA;   555&#xA;   555&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Each number represents a cubelet (in a 3x3x3, there are nine cubelets on each face). After performing a 90&amp;deg; clockwise right turn (&lt;code&gt;R1&lt;/code&gt; in Cubically source), it would look like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   002&#xA;   002&#xA;   002&#xA;111225333044&#xA;111225333044&#xA;111225333044&#xA;   554&#xA;   554&#xA;   554&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There are two other pieces of memory, which are simply registers - the notepad and the input buffer. The input buffer is read-only and always contains the most recently inputted value (values are only inputted when &lt;code&gt;$&lt;/code&gt; or &lt;code&gt;@&lt;/code&gt; are hit in the source). The notepad stores the result of mathematical operations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Mathematical operations are performed on face values. A &quot;face value&quot; is the sum of adding all values on the given face index. For example, the face value of the top face (indexed &lt;code&gt;0&lt;/code&gt;) immediately after initialization would be 0. The face value of the left face would be 9, the front would be 18, etc. The notepad (face index 6) and input buffer (face index 7) are initialized to zero.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some mathematical operations are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;+x&lt;/code&gt; - x specifies a face index, add its value to the notepad&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;-x&lt;/code&gt; - x specifies a face index, subtract its value from the notepad (storing result in notepad)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;_x&lt;/code&gt; - x specifies a face index, modulo the notepad by its value (storing result in notepad)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A cat program would look like this (no cube manipulations required):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(~-1/1=7&amp;amp;6@7)&#xA;(              open loop&#xA; ~              read input to input buffer&#xA;  -1            subtract 9 from notepad&#xA;    /1          divide notepad by 9 (yielding -1)&#xA;      =7        compare notepad and input buffer for equality&#xA;        &amp;amp;6      exit if notepad truthy (notepad == input buffer)&#xA;          @7    print input buffer&#xA;            )  close loop&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;More&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Cubically has been developed into a mostly functional language thanks to the collective efforts of &lt;a href=&quot;https://codegolf.stackexchange.com/users/61563/md-xf?tab=profile&quot;&gt;me&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/72489/tehpers&quot;&gt;TehPers&lt;/a&gt; (many bug fixes and feature ideas), &lt;a href=&quot;https://codegolf.stackexchange.com/users/71434/kamil-drakari&quot;&gt;Kamil Drakari&lt;/a&gt; (more bug fixes, feature requests, suggestions and algorithms) and &lt;a href=&quot;https://codegolf.stackexchange.com/users/55896/destructible-lemon&quot;&gt;Destructible Lemon&lt;/a&gt; (Cubically's name).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Useful links:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;//git.io/Cubically&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub&lt;/a&gt; / &lt;a href=&quot;//github.com/Cubically&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub team&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;//tio.run/#cubically&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try It Online&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/62883/cubically&quot;&gt;Chatroom&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="61563" LastEditorUserId="61563" LastEditDate="2017-08-13T21:48:37.727" LastActivityDate="2017-08-13T21:48:37.727" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13706" PostTypeId="2" ParentId="1324" CreationDate="2017-08-13T21:38:10.763" Score="16" Body="&lt;h1&gt;&amp;quot;Black-Box-Functions&amp;quot;&lt;/h1&gt;&#xA;&lt;p&gt;The content (i.e. the code) of black-box-functions may not be accessed, you can only call them (passing arguments if applicable) and observe their output.&lt;/p&gt;&#xA;&lt;p&gt;They should also have no side effects, except for e.g. accessing RNGs or time, but no communication with the rest of the program should take place other than through the input arguments and the output.&lt;/p&gt;&#xA;&lt;p&gt;This term is used in the list of default IOs in a number of suggestions. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13707/24877&quot;&gt;(1)&lt;/a&gt;,&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13713/24877&quot;&gt;(2)&lt;/a&gt;,&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13708/24877&quot;&gt;(3)&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-14T21:08:26.680" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="13707" PostTypeId="2" ParentId="2447" CreationDate="2017-08-13T21:51:12.650" Score="16" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13706/24877&quot;&gt;black-box functions&lt;/a&gt; to be taken as input can be assumed to be predefined under a given name&lt;/h1&gt;&#xA;&lt;p&gt;This holds for languages that do have classical functions, for instance: Java, JavaScript, VB, C, C++, TI-Basic (some versions), Python, Octave, Matlab, Haskell, Lisp&lt;/p&gt;&#xA;&lt;p&gt;This proposition is the opposite of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13713/24877&quot;&gt;that one&lt;/a&gt; which only allows this method of taking input for languages that cannot take functions as arguments.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-14T21:04:20.793" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13708" PostTypeId="2" ParentId="2447" CreationDate="2017-08-13T21:52:38.993" Score="21" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13706/24877&quot;&gt;black-box functions&lt;/a&gt; to be taken as input can be passed as an argument&lt;/h1&gt;&#xA;&lt;p&gt;This holds for functional languages or languanges that do have first class functions/anonymous functions/lambda functions or function pointers, for instance: Java, JavaScript, C++, TI-Basic, Python, Octave, Matlab, Haskell, Lisp&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-13T21:52:38.993" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13709" PostTypeId="2" ParentId="2140" CreationDate="2017-08-13T22:12:29.520" Score="-3" Body="&lt;h1&gt;Fastest Compiling Fibonacci Sequence &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compiler&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compiler&amp;#39;&quot; rel=&quot;tag&quot;&gt;compiler&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fibonacci&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fibonacci&amp;#39;&quot; rel=&quot;tag&quot;&gt;fibonacci&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-compiling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-compiling&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-compiling&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to create a program which takes one numerical input and outputs all numbers in the Fibonacci sequence up to that point. However, you will not be scored on its bytecount or how many upvotes it gets. You will be scored on how quickly the compiler can compile it.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Of course, compiled languages are the only languages allowed.&lt;/li&gt;&#xA;&lt;li&gt;All answers are tested on an Amazon EC2 instance with an Intel Xeon at 2.4GHz, about 1 GB of ram, and Amazon Linux installed. You can time your program on an equivalent machine, but I will compare results.&lt;/li&gt;&#xA;&lt;li&gt;Your program is allowed to produce warnings when compiled, but it should work properly when run.&lt;/li&gt;&#xA;&lt;li&gt;Compile time is tested with the &lt;code&gt;time&lt;/code&gt; command, and &amp;quot;real&amp;quot; time is used for the final score.&lt;/li&gt;&#xA;&lt;li&gt;If I need to comment the amount of time you took, you should add it to your answer.&lt;/li&gt;&#xA;&lt;li&gt;Of course, standard loopholes are &lt;em&gt;strictly&lt;/em&gt; disallowed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-compiling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-compiling&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-compiling&lt;/a&gt;, so may the cleverest optimization win and the best programmer prosper...&lt;/p&gt;&#xA;" OwnerUserId="64706" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-13T22:21:18.093" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13712" PostTypeId="1" CreationDate="2017-08-14T16:59:22.570" Score="-1" ViewCount="159" Body="&lt;p&gt;A few challenges that requires the program to output something at a specified length, and a bunch of answers well... uses built-in error messages that's generated by the interpreter rather than the program itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Say for example, this program outputs a total of 20 bytes (not counting trailing newline)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#!/bin/bash&#xA;@&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;with output&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;@: command not found&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Of course this message will not appear in STDOUT, but STDERR instead (without redirection).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should this count as a valid program that outputs something as long as 20 bytes?&lt;/p&gt;&#xA;" OwnerUserId="71806" LastActivityDate="2017-08-15T15:50:12.740" Title="Should the output to STDERR count as output length?" Tags="|discussion|output|" AnswerCount="2" CommentCount="2" ClosedDate="2017-08-16T18:30:02.800" ContentLicense="CC BY-SA 3.0" />
  <row Id="13713" PostTypeId="2" ParentId="2447" CreationDate="2017-08-14T21:03:11.677" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13706/24877&quot;&gt;black-box functions&lt;/a&gt; to be taken as input can be assumed to be predefined under a given name only if they cannot be passed as an argument.&lt;/h1&gt;&#xA;&lt;p&gt;This holds for languages that do have classical functions, but cannot pass around functions like other values. This holds for instance for: Java up to version 7&lt;/p&gt;&#xA;&lt;p&gt;This proposition is the opposite of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13707/24877&quot;&gt;that one&lt;/a&gt; which does not have this restriction.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-14T21:14:15.160" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13714" PostTypeId="2" ParentId="12846" CreationDate="2017-08-15T01:01:51.070" Score="4" Body="&lt;p&gt;According to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/13621/can-js-answers-require-the-code-to-be-run-at-a-certain-domain&quot;&gt;this meta&lt;/a&gt;, if the code runs fine on a certain domain (cough, xkcd.com) then the program is valid and acceptable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The proxy, then, is just so it can &lt;em&gt;run as a snippet on SE&lt;/em&gt; in which case, no, the 49 additional bytes don't need to be counted.&lt;/p&gt;&#xA;" OwnerUserId="47990" LastActivityDate="2017-08-15T01:01:51.070" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13716" PostTypeId="2" ParentId="2140" CreationDate="2017-08-15T06:46:58.390" Score="4" Body="&lt;h1&gt;Find the longest Factor-Multiple sequence&lt;/h1&gt;&#xA;&lt;p&gt;Inspired by this &lt;a href=&quot;https://fivethirtyeight.com/features/pick-a-number-any-number/&quot; rel=&quot;nofollow noreferrer&quot;&gt;riddle&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;A Factor-Multiple sequence is any sequence where &lt;strong&gt;A[n+1]&lt;/strong&gt; is either a multiple or factor of &lt;strong&gt;A[n]&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Create a full program or function that, given a list (or any other accepted input) of positive integers, returns (one of the) the longest possible Factor-Multiple sequence containing those numbers. Each number can only be used once and each number in the input will be unique.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;As mentioned above, input is a list of integers. If your language only supports strings, or if you like doing so, you may take input as strings instead.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;You can output your sequence in any way you like as defined on meta.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt;, shortest code wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;More need to be added.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input                                                Output                 &#xA;1 2 3 5 7 11                                         2 1 3 or 3 1 2 or 11 1 7 etc.&#xA;1 2 3 4 5 6 7 8 9 10                                 5 10 1 4 8 2 6 3 9  &#xA;&#xA;1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20   11  1  7 14  2  8 16  4 12  6 18  9  3 15  5 10 20 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Meta:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Need to add more test-cases&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Can't think of any relevant rules, did I miss any?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="59530" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-16T08:08:37.113" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13717" PostTypeId="2" ParentId="13712" CreationDate="2017-08-15T07:51:54.127" Score="5" Body="&lt;h1&gt;Leave it to the writer of the challenge.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For some challenges, it may be acceptable, for some it may not be. We don't need an official meta consensus on this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note: this was first written as a comment, receiving 8 upvotes.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Edit: In general, you may also &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2451/65836&quot;&gt;output to STDERR&lt;/a&gt; as a standard method of input/output, but keep in mind that writers of a challenge may want to deviate from the standards if they have good reason to do so. When in doubt, ask the OP.&lt;/p&gt;&#xA;" OwnerUserId="32352" LastEditorUserId="32352" LastEditDate="2017-08-15T15:50:12.740" LastActivityDate="2017-08-15T15:50:12.740" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13718" PostTypeId="2" ParentId="13712" CreationDate="2017-08-15T08:44:34.740" Score="1" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;Outputting to STDERR is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2451/58974&quot;&gt;currently permitted&lt;/a&gt; under our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/58974&quot;&gt;standard I/O methods&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Note, though, that this may be overridden on a per-challenge basis by the challenge author.&lt;/p&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-15T08:44:34.740" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13721" PostTypeId="1" CreationDate="2017-08-15T18:11:27.310" Score="0" ViewCount="62" Body="&lt;p&gt;Just like we have a format for answering code golf, cracking cops and robbers, and posting most challenges, I am curious as to what (if any) format we should have for questions that have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5243/list-of-bounties-with-no-deadline&quot;&gt;bounties with no deadline&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some things to consider:&lt;br&gt;&#xA;Where in the question should the notice be added?&lt;br&gt;&#xA;What text information is important for the question reader?&lt;br&gt;&#xA;Should it link to the meta question?&lt;br&gt;&#xA;Should it always be posted on the question, or are answer applicable, too?&lt;br&gt;&#xA;Should the title of the question be edited to indicate a bounty?&lt;br&gt;&#xA;Should this even be standardized?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How should we edit questions which have non-expiring bounties attached to them to indicate that a bounty is being offered?&lt;/p&gt;&#xA;" OwnerUserId="60951" LastEditorUserId="60951" LastEditDate="2017-08-15T18:26:12.997" LastActivityDate="2017-08-15T18:26:12.997" Title="How should we edit questions which have non-expiring bounties attached to them?" Tags="|discussion|editing|bounty|formatting|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13725" PostTypeId="1" CreationDate="2017-08-16T10:32:27.257" Score="7" ViewCount="210" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/9121/194&quot;&gt;Write a java code to detect the JVM version&lt;/a&gt; was closed in error as part of the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; cleanup. It's obvious from the comment thread that it was never really an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; question, and that tag was only added because the system required at least two tags.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I removed the tag and voted to reopen. To my surprise, all three reopen reviewers voted to leave closed. I agree that it's not the best question, but I really can't see why it should be closed. What is wrong with the question?&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-08-16T11:07:49.833" Title="Why is this question closed?" Tags="|discussion|specific-question|close-reasons|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13726" PostTypeId="2" ParentId="13725" CreationDate="2017-08-16T11:00:36.497" Score="-1" Body="&lt;h1&gt;No objective winning criterion/a at first glance&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The winning criterion was tucked in along with the rules, and it looked like just another rule. I've edited the post to clarify.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2017-08-16T11:07:49.833" LastActivityDate="2017-08-16T11:07:49.833" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13728" PostTypeId="2" ParentId="2140" CreationDate="2017-08-16T21:34:59.383" Score="1" Body="&lt;h1&gt;Reverse Cycling with Rubik's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/rubiks-cube&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;rubiks-cube&amp;#39;&quot; rel=&quot;tag&quot;&gt;rubiks-cube&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/q/70952/61563&quot;&gt;Cycling with Rubik&amp;#39;s&lt;/a&gt;, you were asked to find the period of a given sequence of turns - or, in Geobits' words:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Given a sequence of turns, [find] the fewest number of times it must be performed to return the cube to its original state. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Today, I'm asking you to do the opposite.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Terms you might not know:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&quot;algorithm&quot;: a sequence of moves on the faces of a Rubik's cube&lt;/li&gt;&#xA;&lt;li&gt;&quot;period&quot;: the minimum number of times an algorithm must be repeated before a solved cube returns to the solved state&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The input will be the period of a Rubik's cube algorithm. This is an integer between 1 and 1260, as any algorithm can be performed 0 times, and the highest possible period for any given algorithm is 1260.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The output will be any algorithm that has a period equal to the input. Algorithms should use standard notation, namely:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;R - Turn the right face clockwise 90°&#xA;L - Turn the left face clockwise 90°&#xA;U - Turn the up (top) face clockwise 90°&#xA;D - Turn the down (bottom) face clockwise 90°&#xA;F - Turn the front face clockwise 90°&#xA;B - Turn the back face clockwise 90°&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Adding the prime mark &lt;code&gt;'&lt;/code&gt; to the end of any move changes it from a clockwise rotation to a counterclockwise one, so &lt;code&gt;F'&lt;/code&gt; turns the front face counterclockwise, and &lt;code&gt;F F'&lt;/code&gt; would return it to the original state right away.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you're still confused about face turns, you can check out &lt;a href=&quot;https://ruwix.com/the-rubiks-cube/notation/&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input -&amp;gt; Output&#xA;1     -&amp;gt; FF'&#xA;4     -&amp;gt; R&#xA;4     -&amp;gt; UD&#xA;6     -&amp;gt; RUR'U'&#xA;12    -&amp;gt; LLUUFFUURRUU&#xA;56    -&amp;gt; LUFFRDRBF&#xA;105   -&amp;gt; LF&#xA;120   -&amp;gt; UFFR'DBBRL'&#xA;315   -&amp;gt; FRBL&#xA;1260  -&amp;gt; U1R3U1F3D2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Winner&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the answer with the least bytes wins! As this is very difficult (it might be impossible), I will give a +50 bounty to the first answer, or +100 if it's under 100 bytes. Good luck!&lt;/p&gt;&#xA;" OwnerUserId="61563" LastActivityDate="2017-08-16T21:34:59.383" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13729" PostTypeId="2" ParentId="2140" CreationDate="2017-08-16T22:35:18.030" Score="1" Body="&lt;h1&gt;Detect Ambiguity in a Context-Free Grammar&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grammars&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grammars&amp;#39;&quot; rel=&quot;tag&quot;&gt;grammars&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sandbox notes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the background too hard to understand? If so, should I clarify it further at the risk of making it unreasonably long, or simply delete it and state that the reader should have a knowledge of context-free grammars?&lt;/li&gt;&#xA;&lt;li&gt;Is there anything I should clarify in the specifications?&lt;/li&gt;&#xA;&lt;li&gt;Are there any other tags I should add? I couldn't find any better ones.&lt;/li&gt;&#xA;&lt;li&gt;Should I add more test cases?&lt;/li&gt;&#xA;&lt;li&gt;Apparently at the moment this problem is undecidable (which I found out &lt;em&gt;way&lt;/em&gt; too late). Would this problem be decidable if I let solutions assume that ambiguous grammars will always have an unambiguous counterpart (in other words, the program will never be given an &lt;a href=&quot;https://en.wikipedia.org/w/index.php?title=Ambiguous_grammar&amp;amp;oldid=766721746#Inherently_ambiguous_languages&quot; rel=&quot;nofollow noreferrer&quot;&gt;inherently ambiguous grammar&lt;/a&gt;?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Context-free_grammar&quot; rel=&quot;nofollow noreferrer&quot;&gt;Context-Free Grammar&lt;/a&gt; (CFG) is a set of rules for constructing strings. For example, the following is a CFG describing BF:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;prog&lt;/em&gt; → &lt;em&gt;command&lt;/em&gt; | &lt;em&gt;command&lt;/em&gt; &lt;em&gt;prog&lt;/em&gt;&lt;br&gt;&#xA;  &lt;em&gt;command&lt;/em&gt; → &lt;code&gt;+&lt;/code&gt; | &lt;code&gt;-&lt;/code&gt; | &lt;code&gt;,&lt;/code&gt; | &lt;code&gt;.&lt;/code&gt; | &lt;code&gt;&amp;lt;&lt;/code&gt; | &lt;code&gt;&amp;gt;&lt;/code&gt; | &lt;em&gt;loop&lt;/em&gt;&lt;br&gt;&#xA;  &lt;em&gt;loop&lt;/em&gt; → &lt;code&gt;[&lt;/code&gt; &lt;em&gt;prog&lt;/em&gt; &lt;code&gt;]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Let's see how the BF program &lt;code&gt;,[-]&lt;/code&gt; can be constructed using this grammar:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Yt7Xl.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Yt7Xl.png&quot; alt=&quot;Parse tree for a context-free grammar&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Wikipedia formally defines a grammar as a group of four items:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A set of &lt;em&gt;nonterminals&lt;/em&gt;, which are the &quot;variables&quot;. In the example above, these are &lt;em&gt;prog&lt;/em&gt;, &lt;em&gt;command&lt;/em&gt;, and &lt;em&gt;loop&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A set of &lt;em&gt;terminals&lt;/em&gt;, which are symbols in the alphabet that strings are composed of. In the example above, these are the BF program characters &lt;code&gt;+-,.&amp;lt;&amp;gt;[]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A set of &lt;em&gt;production rules&lt;/em&gt;, which define what nonterminals are allowed to become. Each rule consists of a &lt;em&gt;head&lt;/em&gt;, which is a nonterminal, and a &lt;em&gt;body&lt;/em&gt;, which is a list of terminals and nonterminals. In the example above, these are the production rules:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;prog&lt;/em&gt; → &lt;em&gt;command&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;prog&lt;/em&gt; → &lt;em&gt;command&lt;/em&gt; &lt;em&gt;prog&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;command&lt;/em&gt; → &lt;code&gt;+&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;command&lt;/em&gt; → &lt;code&gt;-&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;...&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;command&lt;/em&gt; → &lt;em&gt;loop&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;loop&lt;/em&gt; → &lt;code&gt;[&lt;/code&gt; &lt;em&gt;prog&lt;/em&gt; &lt;code&gt;]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;One nonterminal that serves as the starting point for the grammar (in other words, the root node in the parse tree). In the example above, this is &lt;em&gt;prog&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Consider the following context-free grammar:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;bitstring&lt;/em&gt; → &lt;em&gt;bit&lt;/em&gt; | &lt;em&gt;bit&lt;/em&gt; &lt;em&gt;bitstring&lt;/em&gt;&lt;br&gt;&#xA;  &lt;em&gt;bit&lt;/em&gt; → &lt;code&gt;1&lt;/code&gt; | &lt;code&gt;0&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It may be tempting to collapse the two lines:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;bitstring&lt;/em&gt; → &lt;code&gt;1&lt;/code&gt; | &lt;code&gt;0&lt;/code&gt; | &lt;em&gt;bitstring&lt;/em&gt; &lt;em&gt;bitstring&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The disadvantage of this representation over the original is that it is &lt;em&gt;ambiguous&lt;/em&gt; - that is, given a string, it is possible to deriving that string in multiple different ways. For example, in this grammar, the string &lt;code&gt;101&lt;/code&gt; may be derived as &lt;code&gt;((10)1)&lt;/code&gt; or &lt;code&gt;(1(01))&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem with ambiguity is that there is not a single way to create a representation of the generation process, which is useful for e.g. parse trees.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;A useful subset of CFGs&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To make CFGs easier to manipulate, we will constrain them in this way:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Restrict the alphabet of terminals to &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt;,&lt;/li&gt;&#xA;&lt;li&gt;Identify nonterminals by a number rather than a name (either 0- or 1-indexed),&lt;/li&gt;&#xA;&lt;li&gt;Assume the first nonterminal (0 or 1 depending on indexing scheme) to be the initial one.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In this way, we have reduced the description of a CFG down to two inputs:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A number representing the quantity of nonterminals&lt;/li&gt;&#xA;&lt;li&gt;A list of production rules, which is a list of pairs (&lt;em&gt;head&lt;/em&gt;, &lt;em&gt;body&lt;/em&gt;), where &lt;em&gt;head&lt;/em&gt; designates a nonterminal for the head, and &lt;em&gt;body&lt;/em&gt; is a list of terms which can be terminals or nonterminals.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;The Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a representation of a context-free grammar as described above, output a truthy or falsey value representing whether the grammar is ambiguous.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest valid submission (measured in &lt;em&gt;bytes&lt;/em&gt; wins).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specifications&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can use any two distinct non-empty strings instead of &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt; for the terminals.&lt;/li&gt;&#xA;&lt;li&gt;You can assume the lists representing the bodies of the production rules are nonempty.&lt;/li&gt;&#xA;&lt;li&gt;You may take input in any reasonable format. If you are taking input as a number and a list and your language does not support mixed-type lists, you can assume the existence of two special nonterminals that represent the terminals &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt;. If this is done, please specify the two nonterminals in your answer.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can assume that every nonterminal can &quot;halt&quot;, that is, be mapped to a finite string of nonterminals. This means that you will never get an input like:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;string&lt;/em&gt; → &lt;code&gt;0&lt;/code&gt; &lt;em&gt;string&lt;/em&gt; | &lt;code&gt;1&lt;/code&gt; &lt;em&gt;string&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This also means that every nonterminal must have at least one production rule.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;Keep in mind that production rules are technically a &lt;em&gt;set&lt;/em&gt;. The order of the rules is not relevant, so your program should be able to handle them in any order.&lt;/li&gt;&#xA;&lt;li&gt;You can assume there will be less than 100 production rules, and therefore less than 100 distinct nonterminals.&lt;/li&gt;&#xA;&lt;li&gt;You can assume that the input will be a well-formed CFG in whatever input format you designate.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In these examples, nonterminals are zero-indexed.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Ambiguous (Truthy)&lt;/h3&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Only empty strings:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1, [&#xA;    (0, []),&#xA;    (0, [0])&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Readable form:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;string&lt;/em&gt; → &lt;code&gt;&lt;/code&gt; | &lt;em&gt;string&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Any string of bits:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1, [&#xA;    (0, []),&#xA;    (0, [&quot;0&quot;]),&#xA;    (0, [&quot;1&quot;]),&#xA;    (0, [0, 0])&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Readable form:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;string&lt;/em&gt; → &lt;code&gt;&lt;/code&gt; | &lt;code&gt;1&lt;/code&gt; | &lt;code&gt;0&lt;/code&gt; | &lt;em&gt;string&lt;/em&gt; &lt;em&gt;string&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Nonempty strings of ones, separated by zeroes:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2, [&#xA;    (1, [&quot;1&quot;]),&#xA;    (1, [&quot;1&quot;, 1]),&#xA;    (0, [1]),&#xA;    (0, [0, &quot;0&quot;, 0])&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Readable form:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;string&lt;/em&gt; → &lt;em&gt;ones&lt;/em&gt; | &lt;em&gt;string&lt;/em&gt; &lt;code&gt;0&lt;/code&gt; &lt;em&gt;string&lt;/em&gt;&lt;br&gt;&#xA;  &lt;em&gt;ones&lt;/em&gt; → &lt;code&gt;1&lt;/code&gt; | &lt;code&gt;1&lt;/code&gt; &lt;em&gt;ones&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Odd-length strings of bits:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1, [&#xA;    (0, [&quot;0&quot;]),&#xA;    (0, [&quot;1&quot;]),&#xA;    (0, [0, 0, 0])&#xA;]   &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Readable form:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;string&lt;/em&gt; → &lt;code&gt;0&lt;/code&gt; | &lt;code&gt;1&lt;/code&gt; | &lt;em&gt;string&lt;/em&gt; &lt;em&gt;string&lt;/em&gt; &lt;em&gt;string&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;1&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt; balanced like parenthesis:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1, [&#xA;    (0, []),&#xA;    (0, [&quot;1&quot;, 0, &quot;0&quot;]),&#xA;    (0, [0, 0])&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Readable form:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;string&lt;/em&gt; → &lt;code&gt;&lt;/code&gt; | &lt;code&gt;1&lt;/code&gt; &lt;em&gt;string&lt;/em&gt; &lt;code&gt;0&lt;/code&gt; | &lt;em&gt;string&lt;/em&gt; &lt;em&gt;string&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Unambiguous (Falsey)&lt;/h3&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Only empty strings:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1, [&#xA;    (0, [])&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Readable form:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;string&lt;/em&gt; → &lt;code&gt;&lt;/code&gt; &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Any string of bits:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1, [&#xA;    (0, []),&#xA;    (0, [&quot;0&quot;, 0]),&#xA;    (0, [&quot;1&quot;, 0])&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Readable form:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;string&lt;/em&gt; → &lt;code&gt;&lt;/code&gt; | &lt;code&gt;0&lt;/code&gt; &lt;em&gt;string&lt;/em&gt; | &lt;code&gt;1&lt;/code&gt; &lt;em&gt;string&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Nonempty strings of ones, separated by zeroes:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0, [&#xA;    (0, [1]),&#xA;    (0, [1, &quot;0&quot;, 0]),&#xA;    (1, [&quot;1&quot;]),&#xA;    (1, [&quot;1&quot;, 1])&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Readable form:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;string&lt;/em&gt; → &lt;em&gt;ones&lt;/em&gt; | &lt;em&gt;ones&lt;/em&gt; &lt;code&gt;0&lt;/code&gt; &lt;em&gt;string&lt;/em&gt;&lt;br&gt;&#xA;  &lt;em&gt;ones&lt;/em&gt; → &lt;code&gt;1&lt;/code&gt; | &lt;code&gt;1&lt;/code&gt; &lt;em&gt;ones&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Odd-length strings of bits:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2, [&#xA;    (0, [1]),&#xA;    (0, [1, 1, 0]),&#xA;    (1, [&quot;0&quot;]),&#xA;    (1, [&quot;1&quot;])&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;string&lt;/em&gt; → &lt;em&gt;bit&lt;/em&gt; | &lt;em&gt;bit&lt;/em&gt; &lt;em&gt;bit&lt;/em&gt; &lt;em&gt;string&lt;/em&gt;&#xA;  &lt;em&gt;bit&lt;/em&gt; → &lt;code&gt;0&lt;/code&gt; | &lt;code&gt;1&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;1&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt; balanced like parenthesis:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1, [&#xA;    (0, []),&#xA;    (0, [&quot;1&quot;, 0, &quot;0&quot;, 0])&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Readable form:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;string&lt;/em&gt; → &lt;code&gt;&lt;/code&gt; | &lt;code&gt;1&lt;/code&gt; &lt;em&gt;string&lt;/em&gt; &lt;code&gt;0&lt;/code&gt; &lt;em&gt;string&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="61384" LastEditDate="2017-10-04T05:45:13.497" LastActivityDate="2017-10-04T05:45:13.497" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13732" PostTypeId="2" ParentId="13634" CreationDate="2017-08-17T09:52:08.647" Score="15" Body="&lt;h1&gt;Yes, it is cheating.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We have to remember the original inspiration of a quine, as taken from GEB, is that it's &lt;strong&gt;indirect&lt;/strong&gt; self-reference. In other words, code isn't directly allowed to refer to its own function objects. Otherwise the shortest quine in English would be &quot;me&quot; or &quot;this phrase&quot; or some appropriate variant.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2017-08-17T09:52:08.647" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="13733" PostTypeId="1" CreationDate="2017-08-17T12:53:44.947" Score="1" ViewCount="65" Body="&lt;p&gt;Yesterday I answered something nice which gave me a daily cap. At first, my entry was around 350 bytes, and seemed pretty golfed. Today, my entry is only 182 bytes long (yeah Java!). To get there, I made around 20 edits (some with help, most without). Before submitting each edit, I think twice and try to golf more to the best I can. However sometimes after a few hours, sometimes after a few minutes I find something better and I edit again. Given that Java entries are long by default, this behavior is not rare. Golfing an entry with a specific algorithm can be ungolfable, but then another algorithm comes and is much more golfable, &quot;requiring&quot; an edit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A side effect of this is that the question (of which I'm not the owner) stays in the front page, with my name next to it. Some might think &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11787/editing-a-post-to-get-publicity&quot;&gt;I edit to get publicity&lt;/a&gt;, but no: all I'm really doing is golfing. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So is it acceptable to keep editing entries to golf more or improving the explanations? Or is there any reasonable limit? &lt;/p&gt;&#xA;" OwnerUserId="16236" LastActivityDate="2017-08-17T13:08:58.613" Title="Is it OK to keep editing my entries?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ClosedDate="2017-08-17T17:56:21.690" ContentLicense="CC BY-SA 3.0" />
  <row Id="13734" PostTypeId="2" ParentId="13733" CreationDate="2017-08-17T13:08:58.613" Score="6" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As long as you don't make trivial edits with the intention of boosting your own posts your are fine.  (trivial here means that it has no impact on the post, e.g. changing one word for a synonym).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As long as your edits improve your post, no matter how minor, they are welcome here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I wouldn't worry about bumping anything to the front page unless you are doing a lot of edits across several questions.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-08-17T13:08:58.613" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13736" PostTypeId="2" ParentId="2140" CreationDate="2017-08-17T17:01:53.093" Score="-2" Body="&lt;h1&gt;Pascal's Particulars&lt;/h1&gt;&#xA;&lt;p&gt;Pascal is feeling very particular today. He wants to get an element from his famous triangle without going through the work of generating all the prior elements. He'll provide you with a row number and an entry number and you'll provide him with the element at that location.&lt;/p&gt;&#xA;&lt;p&gt;Example:&lt;br /&gt;&#xA;Input row = 1, entry = 1, output 1. (row 1 is &lt;strong&gt;1&lt;/strong&gt;)&lt;br /&gt;&#xA;Input row = 3, entry = 2, output 2.  (row 3 is 1-&lt;strong&gt;2&lt;/strong&gt;-1)&lt;br /&gt;&#xA;Input row = 6, entry = 3, output 10. (row 6 is 1-5-&lt;strong&gt;10&lt;/strong&gt;-10-5-1)&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You will only be provided valid inputs (i.e. x will never be higher than n).&lt;/li&gt;&#xA;&lt;li&gt;Your code should either print or return the output value, either works.&lt;/li&gt;&#xA;&lt;li&gt;Standard golfing rules apply (lowest byte-count wins, etc.).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Happy golfing!&lt;/p&gt;&#xA;" OwnerUserId="73517" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-17T17:01:53.093" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13737" PostTypeId="2" ParentId="2140" CreationDate="2017-08-17T18:05:36.927" Score="-1" Body="&lt;h1&gt;Golf Cubically code &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fgitw&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fgitw&amp;#39;&quot; rel=&quot;tag&quot;&gt;fgitw&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to optimize &lt;a href=&quot;//git.io/Cubically&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cubically&lt;/a&gt; source code using one or more optimizations in this post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How this challenge works:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You will choose one or more optimizations below and write a program (in the language of your choice) that performs those optimizations on a Cubically program.&lt;/li&gt;&#xA;&lt;li&gt;Your program will take a Cubically program as input using any &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/61563&quot;&gt;allowed input methods&lt;/a&gt;, and output a Cubically program using any &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/61563&quot;&gt;allowed output methods&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The first answer to successfully perform all optimizations wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Optimizations&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;1. Face turn arguments&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Before a face turn is performed, the interpreter calculates &lt;code&gt;turns = turns mod 4&lt;/code&gt;. So &lt;code&gt;R5&lt;/code&gt; would be equivalent to &lt;code&gt;R1&lt;/code&gt; which is equivalent to &lt;code&gt;R&lt;/code&gt;, &lt;code&gt;R7&lt;/code&gt; is equivalent to &lt;code&gt;R3&lt;/code&gt; which is equivalent to &lt;code&gt;R'&lt;/code&gt;, etc. Also note that &lt;code&gt;R11111&lt;/code&gt; is equivalent to &lt;code&gt;R5&lt;/code&gt;, and &lt;code&gt;R22&lt;/code&gt; is equivalent to nothing at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Performing this optimization will mean evaluating all arguments to an &lt;code&gt;R&lt;/code&gt;, &lt;code&gt;L&lt;/code&gt;, &lt;code&gt;U&lt;/code&gt;, &lt;code&gt;D&lt;/code&gt;, &lt;code&gt;M&lt;/code&gt;, &lt;code&gt;E&lt;/code&gt;, or &lt;code&gt;S&lt;/code&gt; command and shortening them as much as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Relevant code -&amp;gt; Optimization&#xA;R11           -&amp;gt; R2&#xA;R1            -&amp;gt; R&#xA;L33           -&amp;gt; L2&#xA;U22           -&amp;gt;&#xA;D222          -&amp;gt; D2&#xA;M11111        -&amp;gt; M&#xA;E00001        -&amp;gt; E&#xA;S9            -&amp;gt; S&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;2. Repeated face turn&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;When multiple calls to the same face turn command are present right next to each other, they can clearly be golfed. For example, &lt;code&gt;R2R1&lt;/code&gt; is equivalent to &lt;code&gt;R3&lt;/code&gt;. &lt;code&gt;UUU&lt;/code&gt; is equivalent to &lt;code&gt;U3&lt;/code&gt;. &lt;code&gt;F2F2F2F2&lt;/code&gt; is equivalent &lt;code&gt;F8&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Relevant code -&amp;gt; optimization&#xA;R2R2R2        -&amp;gt; R6            (R2 if you also choose optimization 1)&#xA;LLL           -&amp;gt; L3&#xA;UU            -&amp;gt; UU or U2&#xA;D3D2D1        -&amp;gt; D6            (D2 if you also choose optimization 1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;3. &quot;Set notepad to&quot; commands&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;There are some commands that, instead of adding to/subtracting from/multiplying by/dividing by the notepad, just assign to it. Here are all such commands:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;_^=&amp;lt;&amp;gt;⊕«»·|:&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;When called with multiple arguments, since each argument calls the command separately, only the final argument is relevant. So &lt;code&gt;=123&lt;/code&gt; is equivalent to &lt;code&gt;=3&lt;/code&gt;, &lt;code&gt;_00000&lt;/code&gt; is equivalent to &lt;code&gt;_0&lt;/code&gt;, and &lt;code&gt;:12345678987654321&lt;/code&gt; is equivalent to &lt;code&gt;1&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Relevant code -&amp;gt; Optimization&#xA;_333          -&amp;gt; _3&#xA;=12321        -&amp;gt; =1&#xA;+54321        -&amp;gt; +54321&#xA;:55           -&amp;gt; :5&#xA;/55           -&amp;gt; /55&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;4. Repeated &lt;em&gt;non&lt;/em&gt;-face-turn commands&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;When multiple face turn commands are present right by each other, their arguments can simply be added together. Commands do not act this way. While &lt;code&gt;R2&lt;/code&gt; calls &lt;code&gt;R&lt;/code&gt; with &lt;code&gt;2&lt;/code&gt;, &lt;code&gt;=2&lt;/code&gt; calls &lt;code&gt;=&lt;/code&gt; with the face sum of the front face (face index 2).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To perform this optimization, when multiple commands outside of &lt;code&gt;RLUDFBMES&lt;/code&gt; appear next to each other, simply remove the duplicated commands without removing the arguments.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Relevant code -&amp;gt; Optimization&#xA;_1_1_1_1      -&amp;gt; _1111         (_1 if you also choose optimization 3)&#xA;%11%22%33     -&amp;gt; %112233       (%3 if you also choose optimization 3)&#xA;+12345+67+8   -&amp;gt; +12345678&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;5. Nonexistent commands&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Go check out the &lt;a href=&quot;https://github.com/aaronryank/cubically/wiki/Commands&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cubically commands page&lt;/a&gt; and you'll see that there are plenty of characters that are not commands. For example, there are no commands that are lowercase letters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To perform this optimization, remove all nonexistent commands &lt;em&gt;and their arguments&lt;/em&gt; from the Cubically source. If the commands also have arguments, you must remove the arguments so that they are not passed to the previous command. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Relevant code -&amp;gt; Optimization&#xA;moo cow moo   -&amp;gt; &#xA;moo2cow2moo   -&amp;gt; &#xA;misteR2 FOO   -&amp;gt; R2F&#xA;FEAR ME.      -&amp;gt; ERME&#xA;u1U2u3U4u5U6  -&amp;gt; U2U4U6   (nothing if you also choose optimization 1, U12 if you also choose optimization 2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;6. Non-implicit commands&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;There are lots of implicit commands in Cubically (&lt;code&gt;RLUDFBMES()$~&amp;amp;E!&lt;/code&gt;), but there are plenty that need to be called with arguments. So &lt;code&gt;%%%%&lt;/code&gt; is equivalent to nothing at all while &lt;code&gt;%%2%%&lt;/code&gt; is equivalent to &lt;code&gt;%2&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Relevant code -&amp;gt; Optimization&#xA;%%%%          -&amp;gt; &#xA;$$$$          -&amp;gt; $$$$&#xA;++2++2++2     -&amp;gt; +2+2+2                 (+222 if you also choose optimization 4)&#xA;+++&amp;gt;--&amp;lt;-      -&amp;gt; Not Brainf**k, sorry!  (:P)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'll add more optimizations later.&lt;/p&gt;&#xA;" OwnerUserId="61563" LastEditorUserId="61563" LastEditDate="2017-08-17T18:19:48.873" LastActivityDate="2017-08-17T18:19:48.873" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13738" PostTypeId="2" ParentId="2140" CreationDate="2017-08-17T18:27:31.817" Score="3" Body="&lt;h1&gt;Case Matching Find Replace&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Take three inputs, a string of text, &lt;code&gt;T&lt;/code&gt;; a string of characters to replace, &lt;code&gt;F&lt;/code&gt;; and a string of characters to replace them with, &lt;code&gt;R&lt;/code&gt;. For each substring of &lt;code&gt;T&lt;/code&gt; with the same (case insensitive) characters as &lt;code&gt;F&lt;/code&gt;, replace them with the characters in &lt;code&gt;R&lt;/code&gt;. However, keep the same case as the original text.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there are more characters in &lt;code&gt;R&lt;/code&gt; than &lt;code&gt;F&lt;/code&gt;, the extra characters should be the same case as they are in &lt;code&gt;R&lt;/code&gt;. If there are numbers or symbols in &lt;code&gt;F&lt;/code&gt;, then the corresponding characters in &lt;code&gt;R&lt;/code&gt; should keep the case they have in &lt;code&gt;R&lt;/code&gt;. &lt;code&gt;F&lt;/code&gt; will not necessarily appear in &lt;code&gt;T&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can assume all text will be in the printable ASCII range.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;Text input&quot;, &quot;text&quot;, &quot;test&quot; -&amp;gt; &quot;Test input&quot;&#xA;&#xA;&quot;tHiS Is a PiEcE oF tExT&quot;, &quot;is&quot;, &quot;abcde&quot; -&amp;gt; &quot;tHaBcde Abcde a PiEcE oF tExT&quot;&#xA;&#xA;&quot;The birch canoe slid on the smooth planks&quot;, &quot;o&quot;, &quot; OH MY &quot; -&amp;gt; &quot;The birch can OH MY e slid  OH MY n the sm OH MY  OH MY th planks&quot;&#xA;&#xA;&quot;The score was 10 to 5&quot;, &quot;10&quot;, &quot;tEn&quot; -&amp;gt; &quot;The score was tEn to 5&quot;&#xA;&#xA;&quot;I wrote my code in Brain$#@!&quot;, &quot;$#@!&quot;, &quot;Friend&quot; -&amp;gt; &quot;I wrote my code in BrainFriend&quot;&#xA;&#xA;&quot;This challenge was created by Andrew Piliser&quot;, &quot;Andrew Piliser&quot;, &quot;Martin Ender&quot; -&amp;gt; &quot;This challenge was created by Martin Ender&quot;&#xA;&#xA;// Has a match, but does not match case &#xA;&quot;John does not know&quot;, &quot;John Doe&quot;, &quot;Jane Doe&quot; -&amp;gt; &quot;Jane does not know&quot;&#xA;&#xA;// No match&#xA;&quot;Glue the sheet to the dark blue background&quot;, &quot;Glue the sheet to the dark-blue background&quot;, &quot;foo&quot; -&amp;gt; &quot;Glue the sheet to the dark blue background&quot;&#xA;&#xA;// Only take full matches&#xA;&quot;aaa&quot;, &quot;aa&quot;, &quot;b&quot; -&amp;gt; &quot;ba&quot;&#xA;&#xA;// Apply matching once across the string as a whole, do not iterate on replaced text&#xA;&quot;aaaa&quot;, &quot;aa&quot;, &quot;a&quot; -&amp;gt; &quot;aa&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="29974" LastEditorUserId="29974" LastEditDate="2017-08-18T19:02:40.470" LastActivityDate="2017-08-18T19:02:40.470" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="13740" PostTypeId="2" ParentId="13660" CreationDate="2017-08-17T23:15:37.220" Score="-3" Body="&lt;h1&gt;No, they are all the same language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;We define a language by its &lt;em&gt;implementation&lt;/em&gt;, nothing more&lt;/strong&gt;.  Simply because you can pass in a flag to change the behavior of the language doesn't change the fact that you've still only implemented 1 language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Making them each different languages is a slippery slope where people can make a MetaGolfScript where each &quot;language&quot; is defined in the flags.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you released 3 different executables that didn't need any flags (for the sizes 3, 4, and 5), then at that point in time, they would be different languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In case these concerns come up:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The problem with MetaGolfScript is that the language isn't defined before the challenge&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;True, but following that logic, neither is Cubically 28751.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;This isn't an attempt to cheat in order to scrape off some bytes.  We don't need to punish those that aren't trying to break the rules&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We're already trying to make things more standardized and consistent in our rulings.  This isn't the time to start making exceptions for various languages.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20198" LastActivityDate="2017-08-17T23:15:37.220" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13742" PostTypeId="2" ParentId="2140" CreationDate="2017-08-18T03:44:21.213" Score="0" Body="&lt;h1&gt;Implement a basic two-dimensional esolang &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There are hundreds of two-dimensional stack-based esoteric programming languages out there, and lots of them follow a very similar syntax:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;v redirect instruction pointer down&#xA;&amp;gt; redirect instruction pointer right&#xA;^ redirect instruction pointer up&#xA;&amp;lt; redirect instruction pointer left&#xA;/ redirect instruction pointer: up -&amp;gt; right, right -&amp;gt; up, left -&amp;gt; down, down -&amp;gt; left&#xA;\ redirect instruction pointer: up -&amp;gt; left, left -&amp;gt; up, right -&amp;gt; down, down -&amp;gt; right&#xA;0 push 0 to the stack. 1 pushes 1, ... 9 pushes 9.&#xA;A push 10 to the stack. B pushes 11, ... F pushes 15.&#xA;: duplicate the top stack value&#xA;~ swap top two stack values (all languages implement this as a different character)&#xA;i read input as a ASCII character and push to stack&#xA;o print the top of stack as an ASCII character&#xA;n read input as integer and push to stack&#xA;u print the top of stack as an integer&#xA;+ increment the top of stack&#xA;- decrement the top of stack&#xA;! jump over the next command&#xA;; stop execution&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Almost all two-dimensional esolangs contain more commands, but for the sake of simplicity, the one we're writing will contain only the above.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Specification&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The stack should be able to hold at least 30,000 values. You may pick any integer size (e.g. 32-bit, 64-bit, unbounded, etc) for stack values.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The instruction pointer should start moving right from the top left corner of the source code, and should wrap upon exiting the playing field, meaning that this code will be an infinite loop:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;^&#xA;v&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;First, &lt;code&gt;&amp;lt;&lt;/code&gt; will be reached, pointing the IP off to the left.&lt;br&gt;&#xA;The IP will wrap around to the right, continuing left, and hit the &lt;code&gt;^&lt;/code&gt;, directing it up.&lt;br&gt;&#xA;Then it will wrap, hit the &lt;code&gt;&amp;gt;&lt;/code&gt; and travel right, wrap, hit the &lt;code&gt;v&lt;/code&gt; and travel down, wrap, hit the &lt;code&gt;&amp;lt;&lt;/code&gt;, and start over.&lt;/p&gt;&#xA;" OwnerUserId="61563" LastEditorUserId="61563" LastEditDate="2017-11-24T19:49:11.077" LastActivityDate="2017-11-24T19:49:11.077" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13743" PostTypeId="1" CreationDate="2017-08-18T07:06:52.503" Score="4" ViewCount="193" Body="&lt;p&gt;Related to the discussion in &lt;a href=&quot;https://codegolf.stackexchange.com/a/138747/59530&quot;&gt;this post.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are multiple ways of executing an R-file. Each of these methods have either challenges in input or output. Which are acceptable to count as &quot;Full program&quot; and how do we score them?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The options are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Using the command line command &lt;code&gt;rscript &amp;lt;filename&amp;gt;&lt;/code&gt;. This seems to be the most intuitive way to call a script. However, STDIN needs to be explicitly calls when using &lt;code&gt;scan()&lt;/code&gt;, which is one of the most popular methods of reading input in full programs. This would become &lt;code&gt;scan(file(&quot;stdin&quot;))&lt;/code&gt;. Also, this requires explicit printing, using &lt;code&gt;cat&lt;/code&gt; or &lt;code&gt;print&lt;/code&gt;. Both these limitations would invalidate a lot if not all full program submissions.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Calling &lt;code&gt;source&lt;/code&gt; in the R console. &lt;code&gt;source&lt;/code&gt; is similar to Python's &lt;code&gt;import&lt;/code&gt;, it executes a given file. STDIN works properly without modifications, but printing is the same problem as &lt;code&gt;rscript&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Calling &lt;code&gt;source&lt;/code&gt; with argument &lt;code&gt;echo = TRUE&lt;/code&gt; (which can be abbreviated to &lt;code&gt;ec=T&lt;/code&gt;). This will print all executed lines of code with their output as if they were executed directly in the console.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If I missed any, please let me know.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question is two-part: Do we allow &lt;code&gt;source&lt;/code&gt; as a way to execute or only &lt;code&gt;rscript&lt;/code&gt;? If &lt;code&gt;source&lt;/code&gt; is allowed, how do we score its arguments?&lt;/p&gt;&#xA;" OwnerUserId="59530" LastActivityDate="2017-08-18T07:06:52.503" Title="How should a full program in R be invoked?" Tags="|discussion|rules|scoring|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13744" PostTypeId="2" ParentId="13743" CreationDate="2017-08-18T07:06:52.503" Score="3" Body="&lt;h1&gt;Allow &lt;code&gt;source&lt;/code&gt;, add the arguments to bytecount similar to flags.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Preferably the way of executing the file should be mentioned in the post with the solution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for scoring, we can consider the &lt;code&gt;ec=T&lt;/code&gt; as a flag and add 4 bytes to the bytecount.&lt;/p&gt;&#xA;" OwnerUserId="59530" LastActivityDate="2017-08-18T07:06:52.503" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13745" PostTypeId="1" CreationDate="2017-08-18T13:45:08.427" Score="0" ViewCount="82" Body="&lt;p&gt;So, I'm creating a language using UTF-8 characters. It is a functional language, but I decided to create a golfing version of it. The problem is that the golfed functions use multibyte characters, so the language is losing score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I saw that Jelly uses it's own encoding (or how is that called), which can be converted to UTF-8 and still count as if it was in the original encoding.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My language uses UTF-8 encoding and literals, not every character is a custom function. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it possible to count a multibyte character as just 1 byte in such situation? If not, how can I make my language not lose score and still look the same? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also saw this answer - &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9523/72792&quot;&gt;https://codegolf.meta.stackexchange.com/a/9523/72792&lt;/a&gt; - Can I create my own encoding (ex. characters 0-9 have code 0-9, not 48-57 like in Unicode) or use Jelly Code Page, then use utf-8 character eqivalents as single-byte? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;TL;DR:&lt;/strong&gt; Can I count multibyte characters as single byte in custom language? Or, can I use custom encoding for the language and still use it on PPCG?&lt;/p&gt;&#xA;" OwnerUserId="72792" LastActivityDate="2017-08-18T13:45:08.427" Title="Can I create own language and count multibyte characters as single bytes?" Tags="|discussion|scoring|" AnswerCount="0" CommentCount="12" ClosedDate="2017-08-18T14:33:04.140" ContentLicense="CC BY-SA 3.0" />
  <row Id="13746" PostTypeId="2" ParentId="13674" CreationDate="2017-08-18T14:53:10.383" Score="6" Body="&lt;h1&gt;Titles should be non-disruptive&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As we can see from the ensuing discussion, &lt;em&gt;Многочлены Чебышёва&lt;/em&gt; is a controversial question title for a question about Chebyshev polynomials. The title received lots of unnecessary attention, which (I believe) flawr knew would happen. (Maybe they wanted to attract HNQ clicks?)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Contrarily, I don’t think anyone can disagree that &lt;em&gt;Chebyshev Polynomials&lt;/em&gt; makes a perfectly appropriate title for a question about Chebyshev polynomials.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don’t think &lt;em&gt;language&lt;/em&gt; factors into the issue: if flawr had titled the question “¢нєвуѕнєν ρσℓуησмιαℓѕ”, or “Chebyshev Polynomials!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!”, I would have still complained and edited it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Aside from the obvious SEO issues, I don’t think it’s good etiquette to attempt to draw attention to your question by picking an attention-seeking title. You don’t see people asking StackOverflow questions like “▶▶▶ JAVA NULLPOINTER EXCEPTION!!! ◀◀◀”, either. We are on the StackExchange network, where the norm is proper, descriptive, obvious English; deviating from that norm “for style” without needing to is disruptive.&lt;/p&gt;&#xA;" OwnerUserId="3852" LastActivityDate="2017-08-18T14:53:10.383" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13749" PostTypeId="2" ParentId="13608" CreationDate="2017-08-18T21:47:55.360" Score="3" Body="&lt;h1&gt;A holding place for drafts&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I don't see drafts in the sandbox as a bad thing. Personally, I like to drop ideas into the sandbox and update them gradually over time. I like being able to look at my list of sandbox answers and see which have gathered more upvotes, and prioritise working on those. I find it a handy way of judging demand, so I can allocate time accordingly.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Dupe watch&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I agree with Peter Taylor's answer that dupe watch is a valuable feature of the sandbox. In particular, it allows people to post an outline and get feedback on whether it is a duplicate, rather than having to spend the time to write a full specification, test cases and reference implementation, which would often be required in order to test for duplicates by posting to main. This frees up that challenge author's time to write other challenges for us.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Not mandatory&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I don't want there to be a rule that all challenges &lt;em&gt;must&lt;/em&gt; be posted to the sandbox first, but I do want it to be strongly advised. After one disasterous omission, I have posted all of my subsequent challenges to the sandbox, and there has always been something to improve/clarify/add/remove. It's not just that my challenges might have been closed on main - there are some that would have been valid on main but are &lt;em&gt;better&lt;/em&gt; thanks to the sandbox. That's definitely worth a little extra time. There is a wide grey area between &quot;off topic&quot; and &quot;interesting&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Hindsight is hilarious&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a challenge is watertight and doesn't need any feedback, don't post it to the sandbox.&lt;/li&gt;&#xA;&lt;li&gt;If a challenge has a non-obvious flaw that will only show up if others review it, post it to the sandbox.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Hopefully the irony comes across...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've lost count of how many simple challenge ideas have been posted on main and gathered comments saying &quot;this would have benefited from being sandboxed&quot;. They are not always first time challenges - the time I made this mistake wasn't my first challenge either.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2017-08-18T21:47:55.360" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13750" PostTypeId="2" ParentId="13608" CreationDate="2017-08-18T21:55:45.213" Score="3" Body="&lt;h1&gt;NO!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;I'm one of the 5 users that have the Socratic badge, so I'd consider myself fairly experienced when it comes to writing challenges. I'm afraid I will sound like an arrogant jerk here, but this is what I mean:&lt;/sub&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Yes, some challenges are not flawless. Accept that they are posted on main, or loose all the good ones!&lt;/strong&gt; We should all still downvote and close if the challenge is bad, but we have to accept that they are posted. We must remember that this site is absolutely worthless if no one writes challenges. We can't kill the fun for those who do. (And it's not like the good challenges go unnoticed because there are so many bad ones. We can handle a few bad challenges.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;If you don't want to read it all, please skip to the last paragraph!&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Looking at my top 50 &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges, only 2 or 3 went through the Sandbox before I posted them. I'm not claiming those challenges were all flawless, but the errors were in most cases fixed fast and to little annoyance to other users (yes, you can all probably point to challenges I've written that had many flaws, but most have been somewhat OK at least). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I look at my Sandbox record, I find 38 questions, 14 were never posted (only one was a dupe). The 14 I didn't post were mainly optimization, king-of-the-hill, cops-and-robbers and similar challenges that I already knew weren't ready to be posted, and I knew I had to get some assistance to make the specs waterproof. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenges that were upvoted in the Sandbox, and that I ended up posting have a lower average score than my other challenges.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;But my main argument, and this is a big one: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I enjoy writing challenges, I like the upvotes, and I like when people answer. Not because of the rep, but because that means someone appreciates the effort I made when writing it (and the idea behind it). There are people out there that are having a good time because I wrote a challenge. When I've written a challenge, I want to get that &quot;feeling&quot; straight away. I don't want to wait patiently a couple of days and hope a few users read it and make a comment or two and then post it. The joy of writing it is long gone.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I had to wait two days before I could taste the cakes I bake, then I'd stop baking cakes&lt;sup&gt;1&lt;/sup&gt;. If the community were to decide that all challenges must go through the Sandbox then I'd stop enjoying it, and I would stop writing challenges. I'd guess I'm not the only one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt;I don't bake cakes, but you get the point.&lt;/p&gt;&#xA;" OwnerUserId="31516" LastEditorUserId="56656" LastEditDate="2017-08-18T21:58:54.487" LastActivityDate="2017-08-18T21:58:54.487" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13751" PostTypeId="1" CreationDate="2017-08-19T16:19:48.263" Score="1" ViewCount="167" Body="&lt;p&gt;Last night, I asked a question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/139631/lets-fold-and-cut&quot;&gt;here&lt;/a&gt;. It immediately received two downvotes and a close vote as unclear without explanation.  I inquired as to the reason that it was unclear, both on the question directly, and in chat with no response.  Since it had been flagged as unclear it showed up in the close vote queue where it accumulated an additional close vote, and a comment asking for sample outputs (which was already provided in the question, leading me to believe that the user did not read the question very thoroughly) and test cases.  I used the review history to determine the user who had cast the vote so I could ask them how it was unclear.  I pinged them in chat but got no response, another user voted as unclear without any explanation as to what was unclear and finally I got an explanation.  Xnor raised the issue that I was unclear, and even self-contradictory about what constitutes a fold, and voted to close.  As I was fixing the issue one last user closed the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I rewrote the main body of the question to satisfy the issue brought up by xnor and included a diagram to illustrate it.  I replied to xnor informing him of the change.  Since I had resolved all the issues that I was aware of I voted to reopen, shortly followed by another user. It was then pushed to the review queue where to my surprise all the reviewers voted to leave it closed without any comments.  Neither of these two users was directly pingable in chat so I asked the chat room as a whole what was unclear.  I did not receive a response and the message has since been buried.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now no one owes me an explanation as to why my question is unclear, they are free to vote as they please without reason.  But I find it incredibly frustrating that despite my desire to make my question clear I am utterly unable to.  Since 7 users (2 being after the most recent edit) have voted in favor of the closure of my question there is obviously some clarity issue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What is unclear about my question?  What can I do to get better feedback on questions closed as unclear in the future?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-08-19T23:10:58.133" LastActivityDate="2020-10-14T05:03:20.607" Title="How is my challenge unclear?" Tags="|discussion|close-reasons|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="13752" PostTypeId="1" CreationDate="2017-08-19T20:23:59.277" Score="3" ViewCount="220" Body="&lt;p&gt;I recently saw that &lt;a href=&quot;https://codegolf.stackexchange.com/posts/133754/revisions&quot;&gt;someone had edited an answer chaining question&lt;/a&gt; to have &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;. At first I balked at that, and after checking the first page of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;, I confirmed my original thought that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; challenges usually don't have another winning criteria, which led me to believe that it was a winning criteria in and of itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question is: is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; a fully self-contained winning criteria tag, or does it need another tag for its winning criteria (which will usually be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, but may, for example, be &quot;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;: shortest answer which is also a valid answer in the chain wins&quot;).&lt;/p&gt;&#xA;" OwnerUserId="65836" LastEditorUserId="46271" LastEditDate="2017-08-23T22:46:13.360" LastActivityDate="2017-08-25T01:08:26.320" Title="Is [answer-chaining] a self-contained winning criteria tag?" Tags="|discussion|winning-criteria|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13753" PostTypeId="2" ParentId="13752" CreationDate="2017-08-19T20:49:41.753" Score="5" Body="&lt;p&gt;&lt;em&gt;Disclaimer: I added the tag&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;After looking through &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;, even though most don't have a standard winning criterion tag most fit the definition of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A code challenge is a competition for creative ways to solve a programming puzzle with an objective winning criterion &lt;strong&gt;not covered&lt;/strong&gt; by other scoring tags (e.g. code-golf).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Also, the winning criterion in many &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; non-winning-criterion-tagged challenges varies wildly (50th answer, second-to-last, last answer, etc.), so I think &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; should require &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, etc.&lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastActivityDate="2017-08-19T20:49:41.753" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13755" PostTypeId="2" ParentId="13751" CreationDate="2017-08-19T22:57:17.163" Score="1" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;What can I do to get better feedback in the future?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/194&quot;&gt;You already know the answer to this question&lt;/a&gt;. You just choose not to do it.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;What is unclear about my question?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Because the I/O is virtually unspecified and no concrete example is given (the two diagrams illustrate the subject more generally but not the structure of a complete output, much less the structure of a non-trivial complete output), I'm not sure just by reading the question what form the output might take. I feel that that sentence was also ambiguous, so to try to explain by example: you say&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;one could simply output a list of vertex folds, each represented by a series of angles.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;but a series of angles doesn't seem to be sufficient to represent a vertex fold: surely each would also need at the very least a coordinate pair, and possibly additional information to encode which ones must be done simultaneously? Could you take e.g. the turtle example from the paper &lt;em&gt;Folding and One Straight Cut Suffice&lt;/em&gt; and present both a diagram showing the turtle and an example of how the information encoded in the diagram would be output as &quot;&lt;em&gt;a list of vertex folds, each represented by a series of angles&lt;/em&gt;&quot;?&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-08-19T22:57:17.163" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13757" PostTypeId="1" AcceptedAnswerId="13758" CreationDate="2017-08-20T17:45:54.117" Score="1" ViewCount="66" Body="&lt;p&gt;For example, if I wanted to use Jquery with my JavaScript answer, can I? What do I title the language? JavaScript, JavaScript (with Jquery)?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And what if I write my own library that has tools to make golfing easier? Is this allowed?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it isn't allowed, can I use it so long as I include the library's total byte length with my code's?&lt;/p&gt;&#xA;" OwnerUserId="73026" LastActivityDate="2017-08-20T21:23:07.367" Title="If I write a library for JavaScript golfing, can I use it" Tags="|discussion|" AnswerCount="1" CommentCount="0" ClosedDate="2017-08-20T19:55:46.987" ContentLicense="CC BY-SA 3.0" />
  <row Id="13758" PostTypeId="2" ParentId="13757" CreationDate="2017-08-20T17:53:26.913" Score="1" Body="&lt;h1&gt;You can use libraries&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If you want to use Jquery with Javascript, saying something like &quot;Javascript with Jquery&quot; as your language in your answer is fine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want to make your own library, that's totally allowed. As long as the library is somewhere other people can see it, it's fine. Just say &quot;Javascript with MyLibrary&quot; as your language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Just remember that your library should be specified and made public before the question is asked.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should not count the bytes in the library as bytes of your code. They are part of the language.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="20080" LastEditDate="2017-08-20T21:23:07.367" LastActivityDate="2017-08-20T21:23:07.367" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13760" PostTypeId="2" ParentId="2140" CreationDate="2017-08-20T20:14:24.570" Score="2" Body="&lt;h1&gt;Modular multiplicative inverse&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to given two integer numbers, &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; calculate the modular multiplicative inverse of a modulo b, if it exists.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The modular inverse of &lt;code&gt;a&lt;/code&gt; modulo &lt;code&gt;b&lt;/code&gt; is a number &lt;code&gt;c&lt;/code&gt; such that &lt;code&gt;ac ≡ 1 (mod b)&lt;/code&gt;. This number is unique modulo &lt;code&gt;b&lt;/code&gt; for any pair of &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt;. It exists only if the greatest common divisor of &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; is &lt;code&gt;1&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Modular_multiplicative_inverse&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia page&lt;/a&gt; for modular multiplicative inverse can be consulted if you require more information about the topic.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input and Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input is given as either two integers or a list of two integers. Your program should output either a single number, the modular multiplicative inverse that is in the interval &lt;code&gt;0 &amp;lt; c &amp;lt; b&lt;/code&gt;, or a value indicating there is no inverse. The value can be anything, except a number in the range &lt;code&gt;(0,b)&lt;/code&gt;, and may also be an exception. The value should however be the same for cases in which there is no inverse.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;0 &amp;lt; a &amp;lt; b&lt;/code&gt; can be assumed&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program should finish at some point, and should solve each test case in less than 60 seconds&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Test cases below are given in the format, &lt;code&gt;a, b -&gt; output&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1, 2 -&amp;gt; 1&#xA;3, 6 -&amp;gt; Does not exist&#xA;7, 87 -&amp;gt; 25&#xA;25, 87 -&amp;gt; 7&#xA;2, 91 -&amp;gt; 46&#xA;13, 91 -&amp;gt; Does not exist&#xA;19, 1212393831 -&amp;gt; 701912218&#xA;31, 73714876143 -&amp;gt; 45180085378&#xA;3, 73714876143 -&amp;gt; Does not exist&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is code golf, so the shortest code for each language wins.&lt;/p&gt;&#xA;" OwnerUserId="72350" LastEditorUserId="72350" LastEditDate="2017-08-21T06:19:07.603" LastActivityDate="2017-08-21T06:19:07.603" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13763" PostTypeId="1" CreationDate="2017-08-21T10:57:11.340" Score="1" ViewCount="104" Body="&lt;p&gt;I would like to mainly give myself programming challenges by basically asking multiple times to break my previous code. This would be like the &quot;cops and robbers&quot; format on PP&amp;amp;CG, only that &lt;strong&gt;I&lt;/strong&gt; would be the only contributor on the &quot;cops&quot; side.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should I...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;... create no &quot;cops&quot; thread?&lt;/li&gt;&#xA;&lt;li&gt;... create a &quot;cops&quot; thread, but put in its description that I don't want answers from anyone there?&lt;/li&gt;&#xA;&lt;li&gt;Or is not wanted to have such a challenge here?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Also, maybe at some point I don't have new ideas to secure my code any more. Could I then just make a real &quot;cops&quot; thread/open it for anyone?&lt;/p&gt;&#xA;" OwnerUserId="60416" LastEditorUserId="60416" LastEditDate="2017-08-21T20:12:07.603" LastActivityDate="2017-08-21T20:12:07.603" Title="Would it be accepted to have a &quot;cops and robbers&quot; thread with only one side?" Tags="|discussion|cops-and-robbers|" AnswerCount="0" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="13767" PostTypeId="1" CreationDate="2017-08-21T15:06:19.643" Score="-2" ViewCount="439" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/139900/58826&quot;&gt;First they came&lt;/a&gt; has been dupe-hammered of &lt;a href=&quot;https://codegolf.stackexchange.com/q/6043/58826&quot;&gt;We&amp;#39;re no strangers to code golf, you know the rules, and so do I&lt;/a&gt; (the rickroll), and reopened within 14 minutes.&lt;/p&gt;&#xA;&lt;p&gt;The question is: Is it a dupe?&lt;/p&gt;&#xA;&lt;h2&gt;Note that voting on this question &lt;em&gt;does not&lt;/em&gt; signify your opinion on the dup status. Please vote on answers.&lt;/h2&gt;&#xA;" OwnerDisplayName="user58826" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-21T15:06:19.643" Title="Rickroll dupes again: is &quot;First they came&quot; a dupe?" Tags="|discussion|specific-question|duplicates|" AnswerCount="1" CommentCount="2" ClosedDate="2017-08-21T16:02:56.630" ContentLicense="CC BY-SA 3.0" />
  <row Id="13768" PostTypeId="2" ParentId="13767" CreationDate="2017-08-21T15:06:19.643" Score="3" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Please, stop closing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; as dupes of the rickroll, especially small output ones like this. It is hard to make answers from one competitive in the other, and therefore is not a dupe.&lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastActivityDate="2017-08-21T15:06:19.643" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="13769" PostTypeId="2" ParentId="13752" CreationDate="2017-08-21T18:33:01.203" Score="-1" Body="&lt;h2&gt;No&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I am of the opinion that a winning-criterion tag should describe the problem that participants would have to solve. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; involves golfing code, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; involves creating a bot, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; is a bit of an exception, as it simply describes &quot;anything that's not covered by other tags.&quot; But I think it still makes a valid tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;, on the other hand, does not describe exactly what problem would be solved. Participants know that they will have to work off of previous answers in some way, but the exact problem can come in a variety of forms. Therefore, this tag can't be used as a winning criterion. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; questions should come with a more specific winning criterion, as well as some other tags (such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;) to describe what it's about.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastActivityDate="2017-08-21T18:33:01.203" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13771" PostTypeId="1" CreationDate="2017-08-21T21:38:17.730" Score="17" ViewCount="1117" Body="&lt;p&gt;This question has arisen after reading &lt;a href=&quot;https://codegolf.stackexchange.com/a/139829/71434&quot;&gt;this&lt;/a&gt; answer to a question prohibiting a built-in which solves the problem. The poster argues that the built-in is not defined as &quot;repeat a single integer a number of times equal to that integer&quot; so it doesn't count as a built-in. However, it was brought up in the comments that it SHOULD NOT be valid because the single command solves the challenge regardless of how it is defined.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A simpler situation was also suggested in the comments. Suppose a challenge requested Boolean AND be performed without using a built-in AND operation. It was noted that both Minimum and multiplication have identical output to AND when restricted to the same input values (1-bit numbers).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should built-ins designed for one task, which incidentally perform some other task as well, be considered a built-in for both tasks?&lt;/p&gt;&#xA;" OwnerUserId="71434" LastActivityDate="2017-08-22T00:47:05.617" Title="Is a &quot;built-in&quot; considered to be so for all challenges it CAN solve, or only the one it is DESIGNED to solve?" Tags="|discussion|" AnswerCount="4" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13772" PostTypeId="2" ParentId="13771" CreationDate="2017-08-21T21:44:17.363" Score="-2" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;Any built-in which &lt;em&gt;performs exactly&lt;/em&gt; the prohibited action(s) is prohibited, no matter what.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Feel free to add your arguments for this position to the below list:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Who cares about intention? x is a built-in function. x accomplishes the task. No built-in function that accomplish the task are allowed. Therefore, x is not allowed.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A major goal of banning built-ins is to preclude trivial answers. Even a built-in which wasn't documented to do the particular task still trivialize the problem.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If &lt;em&gt;No&lt;/em&gt; became consensus then golfing language authors could just let the description of all their built-ins be &lt;em&gt;this built-in has no purpose&lt;/em&gt; to circumvent prohibitions on built-ins.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;[your argument here]&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-21T23:50:41.030" CommentCount="4" CommunityOwnedDate="2017-08-21T23:19:56.060" ContentLicense="CC BY-SA 3.0" />
  <row Id="13773" PostTypeId="2" ParentId="13771" CreationDate="2017-08-21T21:45:45.137" Score="-5" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;Prohibitions on built-ins only apply to built-ins for which &lt;em&gt;the stated purpose&lt;/em&gt; is identical to the prohibited task.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Feel free to add your arguments for this position to the below list:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Every code golf answer is a collection of built-ins that accomplish the task.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If there are other (1 byte) answers that do the same thing so that an answer could be any one of them, then at least all but one are not built-ins for the given task, as there aren't multiple built-ins (one would hope) for any given task.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A major goal of banning built-ins is to preclude trivial answers which show neither creativity nor deep knowledge; a post which states that a command does what it is defined to do is valueless. In contrast, a post which exposes a command that solves the challenge on its own, in a way which is not immediately obvious from the definition implies some level of creativity or higher-level understanding of the language.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Built-ins are primarily banned in code-golf challenges; if the challenge bans everything which can solve the problem in 1 byte then they're actually just arbitrarily banning 1 byte solutions in a challenge about reducing bytes. Saying &amp;quot;the winner is the lowest number of bytes, but not lower than N&amp;quot; is something I wouldn't welcome in Code Golf.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;[your argument here]&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-21T23:44:33.680" CommentCount="14" CommunityOwnedDate="2017-08-21T23:22:56.987" ContentLicense="CC BY-SA 3.0" />
  <row Id="13774" PostTypeId="2" ParentId="13771" CreationDate="2017-08-21T23:07:55.817" Score="11" Body="&lt;p&gt;Challenge askers should really be clearer with what they mean when they ban anything.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There really isn't a concrete definition of what a builtin function is.  This is just one edge case of what might be considered a builtin, in addition its not clear if more general functions are builtins (e.g. &lt;code&gt;print5of('#')&lt;/code&gt; if the challenge was print &lt;code&gt;#####&lt;/code&gt; with no builtins).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Question askers should really be responsible for stating exactly what they mean when they ban builtins just like when they ban comments or libraries.  If they don't, just ask them, hopefully they will oblige.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-08-22T00:03:33.067" LastActivityDate="2017-08-22T00:03:33.067" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13775" PostTypeId="2" ParentId="13771" CreationDate="2017-08-22T00:47:05.617" Score="89" Body="&lt;h1&gt;Stop banning built-ins&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It has become sort of a meme at this point, where new challenge posters repeat it as blindly as they repeat “this is code-golf; shortest answer (in bytes) wins”. When asked, and then &lt;em&gt;&lt;strong&gt;pressed&lt;/strong&gt; about the matter&lt;/em&gt;, the OP in the linked question &lt;em&gt;couldn’t explain why they banned built-ins.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In reality, there is no reason to do so.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If you’re compensating for how your own challenge is too simple, then this won’t save it (the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges/8079#8079&quot;&gt;Do X without Y&lt;/a&gt; problem).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you’re trying to rob golf languages of their 1-byte answers, in an attempt to be “fair”, they’ll have 2-byte ones — so who cares? Code golf isn’t an inter-language competition anyway.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Evidently, as this thread exemplifies, people disagree on what constitutes “using a built-in.”&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Personally, I haven’t ever seen a challenge on this website where banning built-ins &lt;em&gt;resulted in higher quality answers&lt;/em&gt; — it only leads to arbitrarily constrained ones, and arguments over edge cases like this! I think we should heavily discourage “banning built-ins.”&lt;/p&gt;&#xA;" OwnerUserId="3852" LastActivityDate="2017-08-22T00:47:05.617" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="13776" PostTypeId="2" ParentId="13752" CreationDate="2017-08-22T14:39:34.203" Score="10" Body="&lt;h1&gt;It depends:&lt;/h1&gt;&#xA;&lt;p&gt;If the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; question is :&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Scored based off of the chain, then the tag is self-contained.  For example, scoring by the last answer (or second to last answer).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Scored based off of something else, and the chain is a restriction, then the tag is not self-contained.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Programmer5000 brings up a point that there are different ways to score based off of the chain, but I think that this is irrelevant.  There are different ways to score &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, but we don't need different tags for all of the possible ways.  In fact, nearly all of the tags have variations (including &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, which can be scored by bytes or characters)&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-25T01:08:26.320" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13777" PostTypeId="2" ParentId="2140" CreationDate="2017-08-22T19:55:53.320" Score="-2" Body="&lt;h1&gt;Break this block&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge is to break this block.&#xA;&lt;a href=&quot;https://i.stack.imgur.com/K4rPW.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/K4rPW.jpg&quot; alt=&quot;floating diamond&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;But of course that would be a pretty easy challenge, that's why this is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; challenge.&lt;br /&gt;&#xA;The robber's challenge: Break the block. As breaking qualifies everything that has the result that no diamond block is at the coordinates 0 128 0 (even pushing it with a piston) and that follows the rules (see below).&lt;br /&gt;&#xA;The cop's challenge: Prevent the robbers from breaking the block. As preventing the breaking counts everything that guarantees that there is a diamond block at 0 128 0 in every future game tick despite the robber attempting his solution (and also if he doesn't). You are not in the world while the robber makes his attempt, so you have to prepare the world for him.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may not use modded Minecraft or external tools that change the save file. Reading it with external tools is allowed.&lt;/li&gt;&#xA;&lt;li&gt;You have to show a reproducible way to break/secure the block. Just uploading a world save without saying what you changed is invalid. You should offer a detailed explanation and preferably more (video, screenshots, structure file, etc.), if necessary.&lt;/li&gt;&#xA;&lt;li&gt;This challenge starts with a normal world (default generation, Creative+cheats, random seed), where one diamond block was placed using the command&lt;br /&gt;&#xA;&lt;code&gt;/setblock 0 128 0 diamond_block&lt;/code&gt;&lt;br /&gt;&#xA;The spawn chunks can include 0 0, but they don't have to. Since both sides have access to commands, that shouldn't matter anyway.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Sandbox questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How should I restrict the version? Should it be &amp;quot;latest release&amp;quot;, &amp;quot;any stable release&amp;quot;, &amp;quot;only 1.12.1&amp;quot;, &amp;quot;any snapshot, release or historical version&amp;quot; or something else? People could come up with interesting solutions using past versions (maybe even past snapshots that aren't selectable in the launcher anymore), but I have to somewhat restrict it. If a certain downgrade automatically breaks the block, it's of course boring, especially since they instantly win. And if they load the world in any of the 9 oldest versions in the launcher (called &amp;quot;Classic&amp;quot; and &amp;quot;pre-Classic), there isn't even a diamond block in the game, so it would be deleted.&lt;/li&gt;&#xA;&lt;li&gt;Should I discourage people from instantly preventing every single breaking method with their first &amp;quot;cops&amp;quot; post? To have an interesting challenge, it should slowly become more difficult. If I should discourage it, how to &amp;quot;enforce&amp;quot; it?&lt;/li&gt;&#xA;&lt;li&gt;What other rules do I need?&lt;/li&gt;&#xA;&lt;li&gt;I'm planning to be very active myself on the &amp;quot;cops&amp;quot; side (I already have some nice ideas), possibly creating the majority of posts there. Is there a problem with that? If no, would it be considered unfair or boring to ask the others to wait up to a day with their solutions? Of course they don't have to do it, I just originally planned this to create programming challenges for myself.&lt;/li&gt;&#xA;&lt;li&gt;If every answer on one side can have multiple answers on the other side, which itself could have answers on the first side and so on, that could lead to a tree-like structure. But such a structure would lead to many unanswered questions (if it doesn't keep growing exponentially, what I highly doubt). Is there a way to prevent that or should I even try it?&lt;/li&gt;&#xA;&lt;li&gt;Apparently this is the first Minecraft-only programming challenge here. Should a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/minecraft&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;minecraft&amp;#39;&quot; rel=&quot;tag&quot;&gt;minecraft&lt;/a&gt; tag be created for it?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="60416" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-22T19:55:53.320" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13778" PostTypeId="2" ParentId="2140" CreationDate="2017-08-22T20:00:45.333" Score="0" Body="&lt;h1&gt;Is Effort Inversely Correlated with Upvotes?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Inspired by &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/39538057#39538057&quot;&gt;this&lt;/a&gt; chat message and the subsequent conversation&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;PPCG is infamous (famous?) for it's short golfing language answers that are showered with upvotes. But, are these short answers full of hard-core golfing, or are they just a few builtins that work? Do these answers take effort, and deserve upvotes, or are upvotes and effort inversely correlated?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;To get some variables out of the way, x=effort, and y=votes&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your challenge is, given a question ID, output &lt;code&gt;A&lt;/code&gt; if the question has a strong positive correlation between effort and votes, &lt;code&gt;B&lt;/code&gt; if it has a weak correlation between efforts and votes, or &lt;code&gt;C&lt;/code&gt; if it has a strong negative correlation between effort and votes. &lt;code&gt;A&lt;/code&gt; may be any value never given as &lt;code&gt;B&lt;/code&gt; or &lt;code&gt;C&lt;/code&gt;, &lt;code&gt;B&lt;/code&gt; may be any value never given as &lt;code&gt;A&lt;/code&gt; or &lt;code&gt;C&lt;/code&gt;, and &lt;code&gt;C&lt;/code&gt; may be any value never given as &lt;code&gt;A&lt;/code&gt; or &lt;code&gt;B&lt;/code&gt; (You doubt have to have consistent values across runs, but the set of values for &lt;code&gt;A&lt;/code&gt; must not intersect with &lt;code&gt;B&lt;/code&gt; or &lt;code&gt;C&lt;/code&gt;, etc.).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Defining Effort&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Effort is an awfully complex concept, but for this challenge we will grossly simplify it to the number of &lt;code&gt;significant edits&lt;/code&gt;. &lt;code&gt;significant edits&lt;/code&gt;, in this context, will be the number of edits, by the question author, that occurred more than 1 minute after the previous edit (initial posting, in this case, counts as an edit).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Defining Votes&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Votes is &lt;code&gt;upVotes&lt;/code&gt; - &lt;code&gt;downVotes&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Defining Correlation&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;For the sake of simplicity, will we use the least-squares regression line as our correlation model. If &lt;code&gt;R^2&lt;/code&gt; (the determination coefficient) is less than &lt;code&gt;.3&lt;/code&gt; (e.g. &amp;lt; 30% of the variation is explained by the model), we will say that there is weak correlation. If &lt;code&gt;R^2&lt;/code&gt; is greater than or equal to &lt;code&gt;.3&lt;/code&gt;, we will say that the correlation is strong. Negative vs. positive correlation must be determined from the sign of &lt;code&gt;R&lt;/code&gt; (the correlation coefficient).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;What Points?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The data points that should be included in your regression are points of the form &lt;code&gt;(votes, effort)&lt;/code&gt; for each answer in the given question.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;//TODO&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Specifics&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For the purposes of this challenge, you may access the &lt;code&gt;api.stackexchange.com&lt;/code&gt; website. You may not shorten the URL with any out-of-language utilities (e.g. tinyurl, but you can still compress it if your language supports compression)&lt;/li&gt;&#xA;&lt;li&gt;You may not violate any &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;standard loopholes&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;You may take input and give output in any &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;reasonable format&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;You should exclude community wikis from your calculations&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Question is a work in progress&lt;/li&gt;&#xA;&lt;li&gt;Anyone have a good title&lt;/li&gt;&#xA;&lt;li&gt;How valid are my statistics?&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stack-exchange-api&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stack-exchange-api&amp;#39;&quot; rel=&quot;tag&quot;&gt;stack-exchange-api&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56085" LastEditorUserId="56085" LastEditDate="2017-08-24T18:03:21.537" LastActivityDate="2017-08-24T18:03:21.537" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13779" PostTypeId="2" ParentId="2140" CreationDate="2017-08-22T21:14:28.360" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; ...? &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Fork for &lt;em&gt;n&lt;/em&gt; times&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/eaA46.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/eaA46.png&quot; alt=&quot;-bash: fork: HE COMES&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;TL;DR: fork up to &lt;code&gt;n&lt;/code&gt; times, than hang forever&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/240/conversation/fork-bomb&quot;&gt;Relevant chat discussion&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;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. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, to avoid crashing the system, &lt;strong&gt;your program limits itself before it forks to death&lt;/strong&gt;. Given an input &lt;code&gt;n&lt;/code&gt;, your program should stop forking when it has &lt;code&gt;n&lt;/code&gt; total copies of itself (including itself), and keep running forever with &lt;code&gt;n&lt;/code&gt; total copies of itself.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Under-specified?&lt;/li&gt;&#xA;&lt;li&gt;Is the min of 500 good?&lt;/li&gt;&#xA;&lt;li&gt;Tags?&lt;/li&gt;&#xA;&lt;li&gt;Better title?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user58826" LastEditorDisplayName="user58826" LastEditDate="2017-09-09T16:13:55.323" LastActivityDate="2017-09-09T16:13:55.323" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13780" PostTypeId="2" ParentId="2140" CreationDate="2017-08-22T21:46:13.067" Score="1" Body="&lt;h1&gt;Just a relative&lt;/h1&gt;&#xA;&lt;h2&gt;Summary&lt;/h2&gt;&#xA;&lt;p&gt;Produce a piece of golfed code that will take a spreadsheet formula and a translation vector and adjust any cell references in the formula by the translation vector.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;What you need to create is a program that takes 2 inputs. A string formula and a representation of the transformation the formula is to undergo (i.e: 1 1 (column, row)).&lt;/p&gt;&#xA;&lt;p&gt;Invalid inputs include, but are not limited too, inputs with invalid cell references, translations that produce invalid references (see definitions) and formulas formulas that don't start with an equals sign.&lt;/p&gt;&#xA;&lt;p&gt;The output should be the formula with its' cell references transformed as per the rules above. Input types are flexible, but the output should be a string with no leading/trailing whitespace.&lt;/p&gt;&#xA;&lt;h2&gt;Definitions&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h3&gt;Cell Reference&lt;/h3&gt;&#xA;&lt;p&gt;An alphanumeric string that within spreadsheet software, indicates the cells position on a 2D grid.&#xA;They consist of two parts, an alphabetic segment a numeric segment.&lt;/p&gt;&#xA;&lt;p&gt;The alphabetic segment represents the column position of the cell. It can be of any length, with each character belonging to the 26 letter English alphabet and is case insensitive. A numerical mapping of the column position can be attained using 26-adic bijective numeration.&lt;/p&gt;&#xA;&lt;p&gt;The numeric segment represents the row position of the cell, and must be a positive non-zero integer.&lt;/p&gt;&#xA;&lt;p&gt;It is also valid for the dollar &lt;code&gt;$&lt;/code&gt; symbol to appear in a cell reference. A single one is valid preceding both the alphabetic and numeric segments either independently or simultaneously. A dollar preceding the alphabetic segment indicates an invariant column under transformation, and a dollar preceding the numeric segment indicates an invariant row under transformation.&lt;/p&gt;&#xA;&lt;h3&gt;Function&lt;/h3&gt;&#xA;&lt;p&gt;An arbitrarily named reference to some set of instructions.&lt;/p&gt;&#xA;&lt;p&gt;For the purpose of this challenge, these are defined as a case insensitive alphanumeric string followed by an open and closed set of rounded brackets. Within these brackets, arbitrary arguments can be present including other functions, arbitrary values and cell references. Arguments are comma seperated.&lt;/p&gt;&#xA;&lt;p&gt;Example: &lt;code&gt;CALCULATEBYTES('mycodegolfanswer', A1)&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Formula&lt;/h3&gt;&#xA;&lt;p&gt;A calculation composed of arbitrary numeric operators, functions, values, cell references etc.&lt;/p&gt;&#xA;&lt;p&gt;A formula must be started with an equals &lt;code&gt;=&lt;/code&gt; sign and can then be followed by anything except for a numeric operator.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;=SUMIFS(A1, &amp;quot;=2&amp;quot;) 1 1&#xA;&amp;gt;&amp;gt;=SUMIFS(B2, &amp;quot;=2&amp;quot;)&#xA;&#xA;=SUMIFA1(GL93) 1 2&#xA;&amp;gt;&amp;gt;=SUMIFA1(GM95)&#xA;&#xA;=ARBITRARY($A$1)+CRAZY(G$3) 3 3&#xA;&amp;gt;&amp;gt;=ARBITRARY($A$1)+CRAZY(J$3)&#xA;&#xA;=$A3+B$2+$C$1 4 -2&#xA;&amp;gt;&amp;gt;=$A1+F$2+$C$1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Hope this all makes sense!&lt;/p&gt;&#xA;&lt;p&gt;Winner is the shortest code in bytes, but bonus kudos if anyone posts a golfed answer in punch card Fortran!&lt;/p&gt;&#xA;&lt;p&gt;Happy golfing!&lt;/p&gt;&#xA;" OwnerUserId="73461" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-25T22:16:50.480" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13781" PostTypeId="2" ParentId="2140" CreationDate="2017-08-23T01:27:12.460" Score="0" Body="&lt;h1&gt;Code the beach on the beach (heavily WIP)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The Gods of the Sea have seen your coding ability and asked you to rewrite their beach-generating program.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Code the beach&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This program will take no input and, in this order:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Print sand (&lt;code&gt;.&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Print ocean waves (&lt;code&gt;~&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Print crabs (&lt;code&gt;&amp;gt;.&amp;lt;&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Print seagulls (&lt;code&gt;-v-&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This program will be run by the Gods of the Sea. They will run it once a day and will want a different beach every time they run it, so the beach items should be generated (pseudo)randomly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To avoid this beach becoming overloaded, there should be:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Between five and eight crabs&lt;/li&gt;&#xA;&lt;li&gt;Between three and seven seagulls&lt;/li&gt;&#xA;&lt;li&gt;Between eighty and one hundred grains of sand&lt;/li&gt;&#xA;&lt;li&gt;Eighty ocean waves&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your program should create the beach just as the Gods' existing program does. It will first draw the sand at the bottom of the screen, in the last three lines. Example sand:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;. .. .. . . ... . ... ..  . ..  .... .. . ... . .. . .. . . .. . .. . . .... ...&#xA;  .. . .. .. .. .. ... .   ..  .. ... ...  .   .   ....... .... ...... ... .&#xA;. . . .. .. ...... ... .. ......... .  .... .. . . . . ... .. .. . . . ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then the waves will be printed, starting from the leftmost character in the fourth-to-last line. The point where the waves meet the sand should vary by at most one character, and waves should never go off the screen. All water that is not curling in a wave will cover the sand, so there can be no sand under the water. Example waves:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;TODO: Add example waves&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Crabs should be spawned in the last four lines and cannot be spawned on waves, because if they were, they would be quickly sucked under and disappear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Seagulls may be spawned anywhere, and should be evenly distributed to the best of your pRNG's ability.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;On the beach&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The Gods were born in ancient times, so they're still using VGA; their terminal has 80x25 characters for output, as does their text editor - which is so old it does not support scrolling. Your program will have to fit in this text editor, so it will need to be small.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Gods do not yet have the internet, so you'll have to write your program on the beach in a location they can see it. Unfortunately, the only convenient place at the moment is a very small sandbar on the Oregon coast. Waves occasionally reach this spot. To make sure you have enough time write the entire program before it's washed away, it will need to be &lt;em&gt;as small as possible.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Furthermore, since the Gods are so far away, some characters written in the sand are indistinguishable. Gods are good at guessing, so if they see a character that looks like another they'll get it right, but another character that looks similar to the character they guessed will be assumed to be said previous character. So if a &lt;code&gt;l&lt;/code&gt; is present in the source before an &lt;code&gt;I&lt;/code&gt;, the Gods will see two &lt;code&gt;l&lt;/code&gt;s.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are the lookalikes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;o&lt;/code&gt; and &lt;code&gt;O&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;l&lt;/code&gt; and &lt;code&gt;I&lt;/code&gt; and &lt;code&gt;|&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;:&lt;/code&gt; and &lt;code&gt;;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;&lt;/code&gt; and &lt;code&gt;'&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The Gods don't have the technology to easily use Unicode characters, so you'll have to give them a lot of help. Each non-ASCII character you use will cost &lt;strong&gt;5 bytes&lt;/strong&gt; to describe it to them.&lt;/p&gt;&#xA;" OwnerUserId="61563" LastActivityDate="2017-08-23T01:27:12.460" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13782" PostTypeId="2" ParentId="2140" CreationDate="2017-08-23T01:27:28.250" Score="0" Body="&lt;h1&gt;Numbers to Algorithms&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Another horrible part of Cubically is attempting to print numbers when the notepad is occupied. Since you can't add up existing faces, the integer (or ASCII value) you have to print needs to be on one single face.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The maximum value you can store on one Cubically face is 45. This isn't great, but it's better than nothing. Your challenge is to write a program that automates the process of getting the values 0-45 onto the top face.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program will take an input number &lt;code&gt;n&lt;/code&gt; and produce a Cubically code snippet as output. This Cubically snippet should achieve the task of getting all integers on the top face to sum up to &lt;code&gt;n&lt;/code&gt;. If you don't yet know how Cubically works, go check out the &lt;a href=&quot;//git.io/Cubically&quot; rel=&quot;nofollow noreferrer&quot;&gt;repo&lt;/a&gt;. Here's a run-down of all you need to know.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Cubically is my esolang based on a Rubik's Cube. Its 3x3x3 memory cube is initialized like this (without the comments on the right):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   000&#xA;   000          top face&#xA;   000&#xA;111222333444    left, front, right, and back faces, respectively&#xA;111222333444&#xA;111222333444&#xA;   555&#xA;   555          down face&#xA;   555&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It uses quarter turn notation, so &lt;code&gt;RRLL&lt;/code&gt; turns the cube to look like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   505&#xA;   505&#xA;   505&#xA;111424333242&#xA;111424333242&#xA;111424333242&#xA;   050&#xA;   050&#xA;   050&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now the sum of the top face is 30. So if &lt;code&gt;n&lt;/code&gt; is 30, &lt;code&gt;RRLL&lt;/code&gt; would be a valid output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition to quarter turn notation, you can send a subscript number to face turns to mean &quot;turn the xth layer inwards from the [face] face, where x is the subscript number&quot;. So &lt;code&gt;R&lt;sub&gt;1&lt;/sub&gt;&lt;/code&gt; would turn the cube to look like this:&lt;/p&gt;&#xA;" OwnerUserId="61563" LastActivityDate="2017-08-23T01:27:28.250" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13783" PostTypeId="2" ParentId="2140" CreationDate="2017-08-23T11:53:00.883" Score="1" Body="&lt;h1&gt;Conversion: 2 dice from 3&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/probability&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;probability&amp;#39;&quot; rel=&quot;tag&quot;&gt;probability&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This &lt;a href=&quot;https://www.youtube.com/watch?v=xHh0ui5mi_E&quot; rel=&quot;nofollow noreferrer&quot;&gt;fascinating video from Matt Parker's standupmaths&lt;/a&gt; poses a challenge:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given the result of rolling 3 indistinguishable (unordered) dice, simulate the result of rolling 2 indistinguishable (unordered) dice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the purposes of this challenge, simply &lt;a href=&quot;https://codegolf.stackexchange.com/questions/80095/three-indistinguishable-dice&quot;&gt;returning the sum of 2 dice&lt;/a&gt; is not sufficient. Returning 2 &lt;em&gt;ordered&lt;/em&gt; dice &lt;em&gt;is&lt;/em&gt; acceptable, as the order can be ignored so this still fulfils the requirement.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Either 3 unordered values from 1 to 6, or 3 ordered values from 1 to 6. If the values are ordered, then the output must be independent of the input order. For example, the input &lt;code&gt;1, 2, 3&lt;/code&gt; should give the same output as the input &lt;code&gt;2, 1, 3&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These are standard dice. Your code may not assume the values will be from 0 to 5 instead of 1 to 6.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Either 2 unordered values from 1 to 6, or 2 ordered values from 1 to 6. If the values are ordered, then different orderings will be considered &lt;strong&gt;&lt;em&gt;equivalent&lt;/em&gt;&lt;/strong&gt;. For example, output &lt;code&gt;1, 2&lt;/code&gt; is equivalent to output &lt;code&gt;2, 1&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given input that matches the probability distribution of rolling 3 dice, the probability distribution of the output must match that of rolling 2 dice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can choose to calculate the outputs however you wish, provided that they are deterministic (the same input in any order gives &lt;strong&gt;&lt;em&gt;equivalent&lt;/em&gt;&lt;/strong&gt; output). That is, different answers may use different mappings. So for input &lt;code&gt;1, 2, 3&lt;/code&gt;, one answer may give output &lt;code&gt;4, 5&lt;/code&gt;, while another answer may give output &lt;code&gt;5, 6&lt;/code&gt;. Provided all outputs occur in the correct proportions, both answers are valid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output must also use standard dice. Your code may not output values from 0 to 5 instead of 1 to 6.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Checking for correctness&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;One simple but laborious way of checking that the outputs occur in the correct proportions is to consider all 216 possible &lt;em&gt;ordered&lt;/em&gt; triples as inputs. This automatically accounts for the fact that the unordered triple &lt;code&gt;1, 2, 3&lt;/code&gt; is 6 times more likely to come up that the unordered triple &lt;code&gt;1, 1, 1&lt;/code&gt;, since it will occur as 6 different ordered triples (the 6 different ways of arranging 1, 2, and 3).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A valid answer will give the same output (apart from order) regardless of the order of the input, and will give any given double such as &lt;code&gt;1, 1&lt;/code&gt; for exactly 6 of the ordered inputs, and any given distinct pair such as &lt;code&gt;1, 2&lt;/code&gt; (equivalently &lt;code&gt;2, 1&lt;/code&gt;) for exactly 12 of the ordered inputs.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The original puzzle was asking for an easy way for humans to calculate this in their heads during playing a game. This challenge is instead &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the score is the number of bytes in your code, and the lowest score in a given language wins.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Prior work&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This was also &lt;a href=&quot;https://puzzling.stackexchange.com/questions/31101/make-2-dice-out-of-3-dice&quot;&gt;posted on puzzling.SE&lt;/a&gt; and there are a number of approaches there. Although they are aimed at being human usable, there may be some insights there that are relevant to writing short code.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As every answer may use a different mapping, there is no way to generate meaningful test cases for this challenge. The simplest way I can think to test is as described above under &quot;Checking for correctness&quot;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I've just discovered &lt;a href=&quot;https://codegolf.stackexchange.com/questions/80095/three-indistinguishable-dice&quot;&gt;this previous challenge&lt;/a&gt; which is based on the same video. It asks only for the sum of 2 dice, rather than an unordered pair, so is not identical. Is this a sufficient difference to avoid this being a duplicate, and would it be different enough to be worthwhile posting?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2017-08-23T12:17:03.450" LastActivityDate="2017-08-23T12:17:03.450" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13784" PostTypeId="2" ParentId="2140" CreationDate="2017-08-23T13:52:12.457" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;JS, 44 bytes&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Here's a list of languages &amp;amp; byte counts from PPCG:&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Jelly, 27 bytes&#xA;Mathematica, 174 bytes&#xA;Scala, 91 bytes&#xA;05AB1E, 12 bytes&#xA;dc, 13 bytes&#xA;Python 2, 115 bytes&#xA;V, 25 bytes&#xA;Charcoal, 48 bytes&#xA;Jelly, 10 bytes&#xA;Haskell, 25 bytes&#xA;MATL, 14 bytes&#xA;x86-16, 43 bytes&#xA;Emoji, 50 bytes&#xA;Pyth, 9 bytes&#xA;C, 38 bytes&#xA;JavaScript, 69 bytes&#xA;R, 73 bytes&#xA;Node.js, 70 bytes&#xA;Ly, 7 bytes&#xA;Japt, 7 bytes&#xA;Java, 2777 bytes&#xA;Husk, 18 bytes&#xA;Beatnik, 148 bytes&#xA;APL, 10 bytes&#xA;Powershell, 127 bytes&#xA;Python 3, 111 bytes&#xA;Ruby, 38 bytes&#xA;Cubically, 1231 bytes&#xA;C++, 292 bytes&#xA;Common, 98 bytes&#xA;Swift 4, 63 bytes&#xA;Axiom, 91 bytes&#xA;Groovy, 7 bytes&#xA;Bitmap, 160 bytes&#xA;Batch, 86 bytes&#xA;Perl 5, 34 bytes&#xA;Pyke, 7 bytes&#xA;Java, 182 bytes&#xA;PHP, 1 bytes&#xA;C#, 163 bytes&#xA;Processing, 85 bytes&#xA;Tcl, 66 bytes&#xA;PowerShell, 11 bytes&#xA;LOGO, 33 bytes&#xA;axo, 22 bytes&#xA;Excel, 37 bytes&#xA;TXR Lisp, 76 bytes&#xA;Alice, 17 bytes&#xA;Moorhens, 716 bytes&#xA;PHP, 2943 bytes&#xA;Python, 79 bytes&#xA;QBIC, 25 bytes&#xA;D, 65 bytes&#xA;Emojicode, 50 bytes&#xA;REXX, 46 bytes&#xA;BBC, 70 bytes&#xA;Retina, 24 bytes&#xA;Bash, 74 bytes&#xA;Cubix, 28 bytes&#xA;cQuents, 7 bytes&#xA;J, 90 bytes&#xA;AHK, 110 bytes&#xA;Mathics, 46 bytes&#xA;RProgN 2, 8 bytes&#xA;SOGL, 36 bytes&#xA;Röda, 36 bytes&#xA;&amp;gt;&amp;lt;&amp;gt;, 238 bytes&#xA;QuadR, 32 bytes&#xA;C#, 289 bytes&#xA;Bash, 385 bytes&#xA;JS, 2823 bytes&#xA;C, 14 bytes&#xA;HTML, 132 bytes&#xA;Ruby, 40 bytes&#xA;JS, 130 bytes&#xA;Gaia, 17 bytes&#xA;TI-BASIC, 17 bytes&#xA;Befunge, 10 bytes&#xA;Ruby 2.4, 53 bytes&#xA;Pari/GP, 21 bytes&#xA;Actually, 10 bytes&#xA;APL, 4 bytes&#xA;TXR, 74 bytes&#xA;Sage, 102 bytes&#xA;Grime, 28 bytes&#xA;Ruby, 101 bytes&#xA;C++17, 71 bytes&#xA;Perl, 41 bytes&#xA;CPython, 25984 bytes&#xA;SmileBASIC, 43 bytes&#xA;WendyScript, 50 bytes&#xA;Python, 2969 bytes&#xA;Clojure, 156 bytes&#xA;Lost, 57 bytes&#xA;C++, 19 bytes&#xA;Brachylog, 4 bytes&#xA;Octave, 25 bytes&#xA;C#, 123 bytes&#xA;Magneson, 102 bytes&#xA;Brain-Flak, 36 bytes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;This list will change before this challenge is posted.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Your challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Look at the program before you. It will print something like &lt;code&gt;JS, 23 bytes&lt;/code&gt;. That means that &lt;strong&gt;you must use JS as your language&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then pick a line from the list. Let's say you pick &lt;code&gt;LOGO, 33 bytes&lt;/code&gt;. That means that &lt;strong&gt;you must print &lt;code&gt;LOGO, 33 bytes&lt;/code&gt; in JS&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because &lt;code&gt;LOGO, 33 bytes&lt;/code&gt; is the &lt;strong&gt;44th line, your byte count modulo the number of languages in the list (there are 100) must equal 44.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The three restrictions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must use JS&lt;/li&gt;&#xA;&lt;li&gt;You must print &lt;code&gt;LOGO, 33 bytes&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Your byte count modulo 100 must be 44&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So a valid submission might be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x=&amp;gt;&quot;LOGO, 33 bytes&quot;//just wasting some bytes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then, after your submission, &lt;strong&gt;you add the list from the last answer to your answer. Then, you remove &lt;code&gt;Logo, 33 bytes&lt;/code&gt; from the list&lt;/strong&gt;: (in your answer, not the question)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That's &lt;strong&gt;the language you used, and the byte count you used&lt;/strong&gt;. Add it to the bottom. Dupes are OK.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your answer will look like this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;JS, 44 bytes&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x=&amp;gt;&quot;LOGO, 33 bytes&quot;//just wasting some bytes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;h3&gt;Here's the new list:&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(Insert the list here, and remove `Logo, 33 bytes`)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;The next submission must use Logo&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Note that the list will continually get smaller, making the challenge harder.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Winning criterion? Last answer? Second-to-last? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Unclear?&lt;/li&gt;&#xA;&lt;li&gt;Dupe?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user58826" LastEditorDisplayName="user58826" LastEditDate="2017-08-28T11:25:40.320" LastActivityDate="2017-08-28T11:25:40.320" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="13788" PostTypeId="1" CreationDate="2017-08-24T16:09:15.093" Score="1" ViewCount="104" Body="&lt;p&gt;What are the specific rules for smart-contract languages (such as solidity) which run in a blockchain (and are considered languages because they can compute primes and that)?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Those languages are full of implicit input (creator address, caller address, past events in the blockchain, the called function's parameters itself, the amount of coins moved, the exact timestamp of transaction).&#xA;Are all of those inputs methods allowed?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is a populated public object a allowed output format?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do compiled (EVM) code or the opcodes (assembly-like) count as different languages than the high-level one?&lt;/p&gt;&#xA;" OwnerUserId="64949" LastActivityDate="2017-08-24T16:09:15.093" Title="Rules on blockchain-based languages?" Tags="|discussion|rules|" AnswerCount="0" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13792" PostTypeId="1" CreationDate="2017-08-25T06:23:18.943" Score="15" ViewCount="745" Body="&lt;p&gt;I've been thinking about command line flags for a while, and I think that we should stop adding them to our byte counts.  And instead consider different invocations to be different languages.  Now because this might be a little bit of a surprise I will walk you through my reasoning.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What are command line flags and why do they exist?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you are not familiar with command line flags they are little bits of information that are added to the invocation of a language.  For example if you were running Brain-Flak (I will be using Brian-Flak as a primary example through out) you would normally call it with:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;./BrainHack program&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;program&lt;/code&gt; is the name of the file containing your source.  You could add the &lt;code&gt;-A&lt;/code&gt; flag to this invocation to tell the interpreter to output in ASCII.  You would invoke that with&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;./BrainHack program -A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In general flags exist to toggle a number of compiler or interpreter options, these are called binary flags.  There are also flags that take arguments, for example Brain-Flak has a &lt;code&gt;-e&lt;/code&gt; flag that causes it to take the source from the command line rather than a file&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;./BrainHack -e &quot;(()())&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;How are they currently scored?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Our current rules are derived from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/274/56656&quot;&gt;this answer&lt;/a&gt; in short flags are counted as&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;a difference in character count to the shortest equivalent invocation without them&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;For most cases this means +3 bytes for the first flag and +1 bytes for every subsequent flag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have several issues with the current state, but I will just list the two biggest ones (I'm listing a 3rd minor point as a footnote).  The first and largest issue is that its confusing and rather unclear.  Take for example the &lt;code&gt;-A&lt;/code&gt; flag in Brain-Flak, if I use it what do I need to add to my byte count?  Well there are two &quot;standard&quot; invocations of Brain-Flak&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;./BrainHack program&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;./BrainHack -e &quot;source&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Ok so which is shorter?  Well this depends on the name of the file and the length of the source code which already puts us into rather murky territory.  However as long as we assume the file name is 1 byte the former will always be shorter so lets say that is the shorter standard invocation.  Well here is the problem, in the original post the author uses as an example perl's &lt;code&gt;-e&lt;/code&gt; flag, which is analogous to that of Brain-Flak, and called that the shortest standard invocation.  This may seem like a I'm intentionally making a stink, but members of the Brain-Flak community use both +1 and +3 for the &lt;code&gt;-A&lt;/code&gt; flag from answer to answer.  There is definitely confusion on this point.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My second problem is that its penalties can be often be sidestepped by making more interpreters.  For example I could make a &quot;new language&quot; called Brain-Flak-A that has the following &lt;a href=&quot;https://fishshell.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;fish&lt;/a&gt; interpreter&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-sh prettyprint-override&quot;&gt;&lt;code&gt;function bfa --wraps /opt/brainhack/BrainHack&#xA;&amp;#9;/opt/brainhack/BrainHack -A $argv&#xA;end&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##S8ssztAtzkjNyfn/P600L7kkMz9PISktUUFXt7wosaBYQT@/oEQ/qSgxMy8jMTlb3wnE8gCyuDhxySjoOiqoJBall3Gl5qVwgc1KVVDSAANNCNSsrkUgpf//AQ&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;fish – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've seriously considered doing this for Klein which always has a +3 penalty on all of its answers (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12440/56656&quot;&gt;meta ruling&lt;/a&gt;), because you must specify the version of the language in a 2 byte string.  This is really annoying to anyone that programs in Klein (or it least it is to me) and serves no real purpose.  Its not like the version of the language&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is the crux of my argument &quot;If I can just make new interpreters to get around the rule then why does it exist?&quot;.  If spent 20 minutes writing interpreters no Brain-Flak user would ever have to use flags again.  Most of the variants caused by binary flag differences are more akin to language differences than to changes in the source code and I think we should treat them as such.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Meta-Golfscript Problem&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Meta-Golfscript is a hypothetical set of languages designed as a rule lawyer to get zero byte programs on every challenge.  They encode their program via a command line flag rather than by a source file.  Under our current system this is fine.  The argument is (quoting Nathan Merrill &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13740/56656&quot;&gt;here&lt;/a&gt;):&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Making them each different languages is a slippery slope where people can make a MetaGolfScript where each &quot;language&quot; is defined in the flags.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't disagree with Nathan Merrill here and I think he is right we should not let Meta-GolfScript answers get away with anything.  However I don't think this is a problem.  As I touched on in a comment the would-be-Meta-GolfScripters already have a ripe opportunity to create 0 byte programs now that we allow languages that post date the challenge.  &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12930/56656&quot;&gt;Our current consensus&lt;/a&gt; is to just downvote and delete any abuse of our lenient policy.  I feel that we should put command line flags under the same policy.  Like the non-competing policy of days past, many more benign answers are hurt by the policy than malicious answers are prevented.  Since the lifting of that policy we have not seen a surge of &quot;0 byte answers&quot; abusing the new rules.  I think the old adage of optimizing for perls rather than sand applies here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So here is my proposal:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;We treat different command line invocations of the same interpreter or compiler as different languages with no byte cost, and rely on the judgement of the community to police those who seek to trivialize challenges in this manner.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Now this is a propsal, not a proclamation or declaration.  I'm interested in what other people think about this.  I would like to have a discussion about this.  Even if the community decides that this specific proposal is not what we want I think we should definitely make changes to the current policy, which I believe is broken.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;My third problem with this system is that it is not actually representative of the information gained from adding command line flags.  The fact that the command line is separate from the source actually constitutes information that can be used however the current system does not account for this information.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="46076" LastEditDate="2017-08-25T20:14:58.997" LastActivityDate="2017-09-07T00:40:29.340" Title="A proposal on command line flags" Tags="|discussion|scoring|" AnswerCount="3" CommentCount="7" ClosedDate="2018-02-07T16:08:02.530" ContentLicense="CC BY-SA 3.0" />
  <row Id="13793" PostTypeId="2" ParentId="13792" CreationDate="2017-08-25T07:32:14.043" Score="11" Body="&lt;p&gt;I haven't thought through all of the issues and arrived at a balance of pros and cons, but there is one con which comes to mind immediately and should be included in the discussion.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;This would affect more than just scoring in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Treating different implementations of the same specification as different languages already has consequences which IMO are pernicious. A recent example is an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; question which required all answers to use a language which hadn't been used earlier in the chain. One answer used Python 3 (PyPy) on the basis that Python 3 had already been used, but that was presumed to be using the &quot;language&quot; &quot;defined&quot; by the CPython implementation, leaving the PyPy implementation up for grabs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Taken to extremes, that approach would already &quot;create&quot; 19 different &quot;languages&quot; from CPython implementations of Python 3.5, counting all the alphas, betas, and release candidates. But if any command-line flag also creates a new &quot;language&quot;, the following flags would not materially affect a lot of the simple programs that are posted on PPCG:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-b  or  -bb&#xA;-B&#xA;-E&#xA;-O&#xA;-OO&#xA;-Qold  or  -Qnew  or  -Qwarn  or -Qwarnall&#xA;-R&#xA;-s&#xA;-S&#xA;-t  or  -tt  (if warnings/errors are to stderr and can be ignored)&#xA;-v  or  -vv  (since I don't think answers tend to use modules)&#xA;-Wignore  or  -Wdefault  or  -Wall  or  -Wmodule  or  -Wonce  or  -Werror&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So if each combination of flags defines a new language, we have 120960 languages per Python interpreter, and any &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; question which wants to make languages single-use would need to explicitly overrule the proposed convention.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-08-25T07:32:14.043" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13795" PostTypeId="1" AcceptedAnswerId="13796" CreationDate="2017-08-25T16:11:33.427" Score="2" ViewCount="168" Body="&lt;p&gt;This is a very strange hack that I came across the other day. In the Swift REPL, if I create an instance of any type (say for example, a String), it automatically gets assigned to a variable in the same way an argument to a closure is. The name used is &lt;code&gt;$R{n}&lt;/code&gt;. Here is an example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Pea9Q.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Pea9Q.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, &lt;em&gt;this only works in the REPL&lt;/em&gt;. So I can I use this hack in a Swift answer if I specify that you have to run it like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;cat file.swift | swift&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that you do get extra output in the form of the blue output in the REPL.&lt;/p&gt;&#xA;" OwnerUserId="68374" OwnerDisplayName="Caleb Kleveter" LastEditorUserId="41024" LastEditDate="2017-08-25T16:24:46.350" LastActivityDate="2017-08-25T16:36:08.297" Title="Is using the Swift REPL for my answer valid?" Tags="|discussion|policy|" AnswerCount="1" CommentCount="3" ClosedDate="2017-08-25T16:49:45.943" ContentLicense="CC BY-SA 3.0" />
  <row Id="13796" PostTypeId="2" ParentId="13795" CreationDate="2017-08-25T16:36:08.297" Score="9" Body="&lt;h1&gt;Yes, but Swift and Swift REPL are different.&lt;/h1&gt;&#xA;&lt;p&gt;Yes, you are allowed to use all the features of REPL Swift (Terminal Swift), as long as you specify that your language is &lt;strong&gt;Swift REPL&lt;/strong&gt;, not &lt;strong&gt;Swift&lt;/strong&gt;. For example, your header should &lt;strong&gt;not look&lt;/strong&gt; like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#Swift, X bytes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Instead, it should be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#Swift REPL, X bytes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The same applies to all languages with a REPL version, such as &lt;strong&gt;Python&lt;/strong&gt; and &lt;strong&gt;Python REPL.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;If you want to keep it in &lt;strong&gt;Swift&lt;/strong&gt;, you may use your code from the REPL version, and specify that your program must be ran with:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;cat file.swift | swift&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If you include &lt;code&gt;cat file.swift | swift&lt;/code&gt; in your byte count (i.e. &lt;code&gt;&amp;lt;program bytes&amp;gt; + X bytes&lt;/code&gt; (for &lt;code&gt;cat file.swift | swift&lt;/code&gt;))&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-25T16:36:08.297" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13798" PostTypeId="2" ParentId="13792" CreationDate="2017-08-25T21:34:18.163" Score="3" Body="&lt;h2&gt;This is a valid subset of &quot;Implementation&quot;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Consensus broadly states that a language is defined by implementation. Implementation itself is (afaik) not very precisely defined, but my understanding is that whatever your &quot;Implementation&quot; is, you feed your code to it and then the implementation &quot;runs&quot; the code to obtain the desired result.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From that understanding, I would consider flags to be a part of implementation. Versions are also a part of implementation, thus Python 2 and Python 3 answers are both acceptable. In fact, I would argue that almost anything could be considered &quot;part&quot; of implementation for an answer that chose it to be so; for example, &lt;code&gt;using&lt;/code&gt; statements in C#. I believe that leaving all such information as a part of &quot;implementation&quot; is valid. If someone were to abuse this by claiming that the &quot;Implementation&quot; they're using causes a 0 byte program to do whatever the challenge asked, then it would be indistinguishable from somebody who created a new language which did whatever the challenge asked when provided with a 0 byte program; something which is already considered forbidden. Since Implementation in this sense is being treated as identical to the concept of a &quot;language&quot;, your listing of language should indicate what your implementation is, but not affect your code's length either way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To illustrate, these would be some viable language names under this proposal with no byte penalties:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Klein 101&lt;/li&gt;&#xA;&lt;li&gt;C# w/ LINQ&lt;/li&gt;&#xA;&lt;li&gt;Cubically 2.6&lt;/li&gt;&#xA;&lt;li&gt;Python 2.7&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;To be perfectly honest, this seems to me like it most closely lines up with how the question is already treated (I see answers where a language references an external library listed as &quot;language + library&quot; quite often for example). With regards to how this affects Polyglots, I think it's irrelevant in challenges like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/65641/the-versatile-integer-printer&quot;&gt;The Versatile Integer Printer&lt;/a&gt; which are required to have different outputs for each language anyway thus most of the implementations with trivial differences are either impossible to use anyway because their output wouldn't be different, or are reasonable use because significant effort is required to make their output different. Polyglots which require identical outputs for each language are more difficult, but I think that it's probably up to the community anyway; Python 2 and Python 3 are relatively famous for being treated as separate languages, but the point at which differences between versions are enough is mostly arbitrary, while languages which are nearly identical or where one is a superset of another are common enough that I think worrying about how many extra &quot;languages&quot; some program becomes valid in as a result is unnecessary. As Wheat Wizard pointed out, removing the restriction that a language must be created before the challenge hasn't suddenly reduced PPCG to anarchy because abusive answers are terrible and infrequent, and get downvoted when they do appear. I agree that this change would be similar.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't really have a solution in regards to specifically &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; though. In my opinion requiring different languages in an answer chain is only slightly better than banning built-ins in regards to it actually generating value, but I will admit that this proposal pretty much trivializes what it means for two languages to be &quot;different&quot;.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastActivityDate="2017-08-25T21:34:18.163" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13799" PostTypeId="2" ParentId="2140" CreationDate="2017-08-26T06:53:27.867" Score="1" Body="&lt;h1&gt;Brain-Flak Golfing Tournament&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;This is a very rough draft.  I am looking for as much feedback as possible while I flesh out this challenge&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Welcome to the first ever Brain-Flak Golfing Tournament.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This tournament will have 2 phases.  The first being a call for challenges and the second being the competition.  Any user may participate in either, both or, of course, neither of the phases.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge submissions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this first phase users can submit mini challenges to be used in the competition.  These will be of two varieties,&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I've chosen these varieties because they tend to be the commonly agreed most &quot;fun&quot; tags for Brain-Flak. (SANDBOX: If you have any qualms these varieties are variable)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Kolmogorov-complexity&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Kolmogorov complexity challenges, like the name implies, should provide a constant string to be output with no input.  For example &lt;code&gt;Hiya there earth!&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a personal style point I find Kolmogorov complexity is most fun for strings of 10-20 characters.  However feel free to answer of whatever size you think would be interesting&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sequence&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;For sequence challenges you should you should choose a sequence from the &lt;a href=&quot;http://oeis.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Online Encyclopedia of Integer Sequences&lt;/a&gt;, and provide its number and a brief description in the body of your answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answers to sequence mini challenges will take n and output the nth term of the sequence.  You may specify what indexings are permitted in your answer.  Since OEIS sequences are not well specified on their own answers will only be required to support as high as are provided in the b-files of that sequence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a personal style point Brain-Flak is especially good at computing challenges involving or related to &lt;a href=&quot;https://en.wikipedia.org/wiki/Polygonal_number&quot; rel=&quot;nofollow noreferrer&quot;&gt;polygonal numbers&lt;/a&gt;, however variety is always welcome.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;In addition to providing a challenge you must also provide a &quot;par&quot;.  A par will be a program that satisfies the requirements of your mini-challenge.  The purpose of a par is two-fold:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It proves your mini-challenge is reasonably possible&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It provides a default score for more casual participants who might not necessarily answer all the mini-challenges, or more serious users who run out of time.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your par should &lt;em&gt;not&lt;/em&gt; be your own best attempt at a challenge, it should be beatable otherwise participants would just score the par and you might as well have not made the challenge at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lastly no mini-challenge should correspond to a preexisting PPCG that already has a Brain-Flak answer.  For example &lt;em&gt;do not&lt;/em&gt; submit print &lt;code&gt;Hello, World!&lt;/code&gt; as a challenge, because we have already have very competitive solutions.  Unlike earlier suggestions this will be enforced.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge answers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In the second phase users will answer challenges made in the first phase.  You will have one week to craft an answer in (relative) secrecy, at the end of the week answers will be revealed and a winner declared.  You will have to have an answer on this question prior to the reveal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All that is required of answers before the reveal are the following two things&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A rundown of the byte counts.  This should be your scores to each mini challenge not including ones posed by your self.  If you choose not to complete a single challenge for any reason you should take the par as your score for that challenge.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A hash.  This should be a SHA-256 hash of a string containing all of your solutions on separate lines and your ppcg user id.  You may include other information in the string to throw off potential attackers if you wish, but it should not resemble any of the required elements.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;These are the only two things that are required, however if you would like to include additional hints to other users you may do so, just don't reveal your own solutions ahead of time as that can make the challenge rather un-fun.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may continuously update your answer anytime before the reveal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should not at any point lie about contents that are hidden.  Accusations will be dealt with on a case by case basis, but if you are caught having lied you will be disqualified.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;This is still a work in progress right now its just a plan&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I plan to base scoring based on &lt;a href=&quot;https://en.wikipedia.org/wiki/Tournament_(graph_theory)&quot; rel=&quot;nofollow noreferrer&quot;&gt;graph theory&lt;/a&gt;.  Normally it would just be the sum of individual challenges but because one cannot fairly compete in their own challenges things have to be a little bit more sophisticated.  Once I decide on a good scoring system I will add a code snippet to help calculate rankings.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Scoring will obviously be based on byte counts with less being better.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Prizes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I will be offering 3 bounties for exceptional participants&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;500 rep for the overall winner of the challenge&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;200 rep for the runner up of the challenge&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;100 rep for the top voted mini challenge&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-08-26T06:53:27.867" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13801" PostTypeId="2" ParentId="2140" CreationDate="2017-08-26T16:31:51.223" Score="1" Body="&lt;h1&gt;Program an Uncircularness Score&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14410/24877&quot;&gt;derivative of this challenge&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Meta:&lt;/h2&gt;&#xA;&lt;p&gt;This is just a rough idea for a slightly different challenge. I have no idea how successfull it would be in the current state, so feel free to share your opinions and suggestions.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to program a mathematical function &lt;code&gt;s&lt;/code&gt;, that takes a finite set &lt;code&gt;A&lt;/code&gt; of points in the 2D plane, and outputs an uncircularity score &lt;code&gt;s(A)&lt;/code&gt; that satisfies following properties:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;em&gt;positive definiteness&lt;/em&gt;: If there is a circle or a straight line that contains all points of &lt;code&gt;A&lt;/code&gt;, then &lt;code&gt;s(A) = 0&lt;/code&gt;. Otherwise &lt;code&gt;s(A) &amp;gt; 0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;It is surjective to the nonnegative real numbers, that means for every nonnegative real number &lt;code&gt;r&lt;/code&gt; there is a finite subset &lt;code&gt;A&lt;/code&gt; of the plane such that &lt;code&gt;s(A) = r&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;p&gt;You get one point for every of the following properties that your function (provably) has.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Translation Invariance:&lt;/em&gt; &lt;code&gt;s&lt;/code&gt; is translation invariant if &lt;code&gt;s(A) = s(A + v)&lt;/code&gt; for every vector &lt;code&gt;v&lt;/code&gt; and for all &lt;code&gt;A&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Scale Invariance:&lt;/em&gt; &lt;code&gt;s&lt;/code&gt; is scale invariant, if &lt;code&gt;s(A) = s(A * t)&lt;/code&gt; for every &lt;code&gt;t≠0&lt;/code&gt; and for all &lt;code&gt;A&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Monotony:&lt;/em&gt; &lt;code&gt;s&lt;/code&gt; is monotonous if &lt;code&gt;s(A) ≤ s(B)&lt;/code&gt; for all &lt;code&gt;A,B&lt;/code&gt; where &lt;code&gt;A ⊆ B&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Circle Inversion Invariance:&lt;/em&gt; &lt;code&gt;s&lt;/code&gt; is circle inversion invariant, if &lt;code&gt;s(A) = s(f(A))&lt;/code&gt; for all &lt;code&gt;A&lt;/code&gt; with &lt;code&gt;0 ∉ A&lt;/code&gt;, where &lt;code&gt;f(x,y) = (x/(x^2+y^2), y/(x^2+y^2))&lt;/code&gt; is the &lt;a href=&quot;https://en.wikipedia.org/wiki/Inversive_geometry#Circle_inversion&quot; rel=&quot;nofollow noreferrer&quot;&gt;circle inversion&lt;/a&gt;. (Here &lt;code&gt;(x,y)&lt;/code&gt; represent the cartesian coordinates of a point in the plane.)&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Triangle inequality:&lt;/em&gt; &lt;code&gt;s&lt;/code&gt; satisfies the &amp;quot;triangle inequality&amp;quot; if &lt;code&gt;s(A ∩ B) ≤ s(A) + s(B)&lt;/code&gt; for all &lt;code&gt;A,B&lt;/code&gt;. (This is implied by Monotony.)&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Reverse triangle inequality:&lt;/em&gt; &lt;code&gt;s&lt;/code&gt; satisfies the &amp;quot;reverse triangle inequality&amp;quot; if &lt;code&gt;s(A) + s(B) ≤ s(A ∪ B)&lt;/code&gt; for all &lt;code&gt;A,B&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Continuity.&lt;/em&gt; &lt;code&gt;s&lt;/code&gt; is said to be &lt;em&gt;continuous&lt;/em&gt; if the function &lt;code&gt;f(p) := s(A ∪ {p})&lt;/code&gt; (mapping the a point &lt;code&gt;p&lt;/code&gt; to a real number) is continuous using the standard absolute value on the real numbers, and the standard euclidean norm on the points of the plane.&lt;/li&gt;&#xA;&lt;li&gt;More to come...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-12-21T21:35:18.837" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="13805" PostTypeId="2" ParentId="2140" CreationDate="2017-08-26T22:44:01.270" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; OR &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/encode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;encode&amp;#39;&quot; rel=&quot;tag&quot;&gt;encode&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decode&amp;#39;&quot; rel=&quot;tag&quot;&gt;decode&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Steganography: Hide a message in an image!&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Cops&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You will want to see the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9093/58826&quot;&gt;Default acceptable image I/O methods for image related challenges&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to write a program that takes a string and an image as input and somehow encodes the string in the image. You output the image.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must also make a program that reverses the above: it takes a image, and outputs the original string (you don't need to output the original image).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your encoder must work on &lt;em&gt;any&lt;/em&gt; string, but it only needs to work on one type of image.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Post the encoder (but not the decoder), and preferably a few image / string input / output examples.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your post is cracked when someone makes a program that can take an outputted image and find the string hidden in it. &lt;strong&gt;It doesn't have to be the decoder you intended. It can even be in another language.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once your submission is cracked, edit in a link to the crack and your decoder program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If, after a week, nobody* has cracked your submission, edit in that you are safe, and edit in your decoder.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;&lt;a href=&quot;https://www.cs.cmu.edu/~dst/DeCSS/Gallery/Stego/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;This&lt;/a&gt; may provide ideas!&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;*not &lt;a href=&quot;https://codegolf.stackexchange.com/users/64499/nobody&quot;&gt;Nobody&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Robbers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to find a cop post and crack it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To crack a cop post, you make a program that reverses what cops do: &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Your challenge is to write a program that takes a string and an image as input and somehow encodes the string in the image. You output the image.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In other words, your program takes an image and extracts the encoded string out of it. You don't have to output the image with or without the string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once you have cracked a cop's post, add a link in a comment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The robber with the most cracks wins.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Meta:&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Dupe? (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers+graphical-output&quot;&gt;I don't think so&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Winning criterion for cops:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I really want this to be a pop-con.&lt;/strong&gt; Pop-cons are &lt;em&gt;hard&lt;/em&gt; but I think I have &lt;a href=&quot;https://codegolf.stackexchange.com/tags/popularity-contest/info&quot;&gt;everything needed for a good pop-con&lt;/a&gt; covered:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;A challenge with clear specifications that still allow for creative problem solving. &lt;em&gt;I think this is clear but gives you freedom in how you encode a string.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;A challenge where solutions that best solve the problem are also solutions that the voters are going to like. &lt;em&gt;I think that voters will enjoy very creative 'encoding's.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;Gives freedom to entrants to decide what to do in crucial parts and incentivizes them to use this freedom. &lt;em&gt;You have complete freedom to pick how you hide the string. If you use a boring form of encoding, your encoder will quickly be cracked, but if you use your freedom to make a very creative encoder your submission will likely be safe.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;It is strongly suggested to submit the challenge to the Sandbox at least a few days before posting the challenge. That way the challenge can be reviewed and discussed in order to find any mistakes or inconsistencies, and it also serves for getting a first impression whether the challenge will be well recieved. &lt;em&gt;Yep, I think this is covered.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And &lt;a href=&quot;https://codegolf.stackexchange.com/tags/popularity-contest/info&quot;&gt;what MUST be included in a pop-con&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;A popularity contest must always include an objective validity criterion, which is a set of rules that regulate what every answer must comply with. Answers that do not comply are invalid and will be removed. &lt;em&gt;Yep, if you have a valid, working decoder than your stenography is reversible and therefore valid. If a week passes and you didn't have a decoder, your submission will be removed.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;A clear specification of the goal that must be achieved. Questions like &quot;&lt;em&gt;do (this) the most creative way&lt;/em&gt;&quot; should be avoided. Creativity should be the tool, not the goal. &lt;em&gt;Yep, the goal is to make a program that encodes a string in an image...&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And &lt;a href=&quot;https://codegolf.stackexchange.com/tags/popularity-contest/info&quot;&gt;Qualities which should be AVOIDED in popularity contests&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;Asking to solve a specific task in a very specific way, without room for creativity. &lt;em&gt;There is room for creativity within bounds in how your encoder works.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;Asking to solve a vaguely defined task in any way that the entrant wants (this will probably make your question be closed as too broad). &lt;em&gt;Nope, you have the specific task of encoding a string in an image.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;Rules what people should consider when voting. In the past this has consistently never worked out. These sort of questions would be better off as a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; with specific winning criteria. &lt;em&gt;Nope, I don't have any of these.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If there's anything I'm missing, please tell me. &lt;strong&gt;I think this is a on-topic valid pop-con.&lt;/strong&gt; However, if it isn't, I'd be OK with making this a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, PPCG has too much code golf. We need more variety in the challenges we have here. I hope this will provide an example of a valid pop-con.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user58826" LastEditorDisplayName="user58826" LastEditDate="2017-08-26T22:52:47.297" LastActivityDate="2017-08-26T22:52:47.297" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13810" PostTypeId="2" ParentId="10793" CreationDate="2017-08-27T05:30:03.793" Score="3" Body="&lt;h2&gt;I don't think we can or should ban such answers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You've already pretty much outlined why I think these answers cannot be banned.  There are too many ways to make them and any definition we make will let bad answers through the cracks and prevent good answers from being posted or will be wildly subjective and will result in numerous arguments.  Both of these are, in my opinion less ideal than the current situation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;So just do nothing?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Well no not quite.  I don't think we should change policy but there are things I think we can do as users to help reduce the number of these answers or at least increase the number of high quality cops and robbers solutions.  Here they are&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Make such answer less lucrative&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The main reason these types of answers are produced is because they are nigh impossible to crack not because they are very well scoring.  So a good step in combating them is making them more likely to score lower than regular answers.  This is the least useful of my 3 suggestions, it's one of those things that if you do well its not noticeable but if you do it poorly it can really blow up in your face.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Smaller problem space = better score&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This one is done well in a lot of challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem space is the number of possible cracks a robber might have to check on a given answer.  The general idea here is that cryptographic answers thrive because they force robbers to search the entire problem space for the answer.  While with most answers the robber can narrow down the problem space with clever thinking cryptographic answers cannot.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I then makes sense that a smaller problem space should correspond to a larger score this way higher scoring cryptographic answers are easier to crack.  However when the scoring and problem space are not correlated it is often easy to make the problem space absolutely titanic, without incurring any penalty to your score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An bad example of this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/135363/will-it-halt-cops&quot;&gt;this question&lt;/a&gt;, which scores based on program length but is looking for an integer input, meaning that all programs have basically the same enormous problem space.  Same with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/103182/significant-whitespace-cops&quot;&gt;this one&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Make problem spaces smaller&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This second suggestion is in the same thread as the last.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The idea here is that in general small problem spaces benefit fun answers and hurt cryptographic or random answers.  For example here are two possible problem spaces:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;All substrings (including non-continuous ones) of the program&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Programs with one character changed from the original&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The first is basically a powerset meaning that for programs of length &lt;strong&gt;n&lt;/strong&gt; there are &lt;strong&gt;2&lt;sup&gt;n&lt;/sup&gt;&lt;/strong&gt; programs to search while for the second there are only &lt;strong&gt;256*n&lt;/strong&gt; programs to search.  Since the first is exponential you only need a handful of bytes before the problem space is completely out of hand, while the second is linear meaning to get large enough problem spaces for these to be an issue you need to pay more bytes making the answers less desirable.  Some of my favorite smallish problem spaces are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;All continuous substrings of the program (&lt;strong&gt;O(n&lt;sup&gt;2&lt;/sup&gt;)&lt;/strong&gt;)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;All programs within a Levenshtein distance (&lt;strong&gt;O(n&lt;sup&gt;m&lt;/sup&gt;)&lt;/strong&gt; where &lt;strong&gt;m&lt;/strong&gt; is the distance)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Make it harder to produce these answers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The effects of this are two fold&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If it is hard to produce these answers less will appear&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If it is hard to produce these answers it will take significant effort to produce them and we can expect that those made are actually the result of significant effort and are then, hopefully, actually high quality interesting answers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Now this is easier said than done so I have a couple tips for doing this in your questions.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Make the thing the Robber is looking for hard to detect&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;One of the most common things that robbers are searching for is a program that fulfills some relation to some provided code.  This is really the prime scenario for cryptographic cops.  You set up a program that does a hash of some code ensuring that code that satisfies the relation probably also has to do that same hash.  However there are other ways to do this for example &lt;a href=&quot;https://codegolf.stackexchange.com/questions/54807/the-programming-language-quiz&quot;&gt;the programming languages quiz&lt;/a&gt;.  Here the robbers are looking for a language.  It is next to impossible to make a cryptographically secure answer to this question.  The idea is that the normally a program is able to tell when it has been cracked. For example the right key has been provided as input. However detecting you have been run in the right language is next to impossible unless you are willing to write a massive polyglot.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm afraid I can't give very rock solid advice on how to make these because they are rare and I've never asked one myself.  The best I can say is that questions asking robbers to discover properties of a cops program rather than producing something based on code seem to fit this bill often.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Give agency to the robbers rather than the cops&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;One of the most important parts of a cryptographic answer is that the cop has power over the robbers so that they can enforce the only reasonable way of solving their challenge.  Hash based answers work because the robber &lt;em&gt;has&lt;/em&gt; to use a hash to crack it.  If you give agency to the robbers to make more varied cracks the cop becomes unable to force them to use their crypto method.  Lets walk though an example of a CnR that is good at this and one that is bad.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Good example&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this mock CnR cops provide a set of characters and robbers must write programs using those characters that add two numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here robbers have a ton of freedom with making their own programs.  Cops can impose restrictions on robbers but they will have a hard time forcing them to use crypto.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Bad example&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this mock CnR cops provide a program with no whitespace and robbers must add whitespace to make the program add. (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/103182/significant-whitespace-cops&quot;&gt;Sound familiar?&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here cops have all the power.  Whitespace does very little in many languages so a cop need only choose a language where it is less significant and use that.  Here is a pseudo code solution&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;if hash(&quot;&quot;)==&quot;o A#,(^[|)JyD&amp;gt;?J&quot; then add input&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A robber obviously has no choice but to find the string of whitespace that has that hash.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Vote sensibly&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Now many of us have been downvoting answers that are overtly cryptogrphic in nature for a while.  And this may or may not stem the tide.  You also pointed out in your question that it might be hard to tell if a uncracked answer is using crypto.  However I think that it is more important that we vote sensibly on questions.  If you are bothered by this issue I implore you to downvote questions that make no effort prevent such answers.  This includes questions that include the&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;plz don't try to use crypto because you would win this challenge :(&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If upset users continue to downvote and leave comments explaining why, question askers will get the message and hopefully make a change.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course if you do not feel like doing so these are your votes.  I cannot tell you how to vote nor would I.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;One last thought&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Although it may go against what I have been hammering on this entire time I think that there is another way to approach the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Embrace the cryptographically secure answers&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now before you get your pitchforks I don't mean to say that you should encourage these answers in their current state; that we should adopt a defeatist attitude and allow these answers to fester.  I mean to say that it might be nice to have CnR challenges that are tailored around these answers.  Challenges which are drafted with these types of answers in mind such that the challenge is still enjoyable even if the majority of answers are cryptographic. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a rather new idea so I'm not entirely sure how it would play out but I thought I would put it out there as a more optimistic outlook on this issue.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-08-27T05:40:25.227" LastActivityDate="2017-08-27T05:40:25.227" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13811" PostTypeId="2" ParentId="2140" CreationDate="2017-08-27T09:45:41.570" Score="2" Body="&lt;h1&gt;Is this a valid Takuzu board? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Takuzu is a logic game in which you have to complete a grid with cells containing &lt;code&gt;0&lt;/code&gt;s and &lt;code&gt;1&lt;/code&gt;s. The grid must follow 3 rules:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;No three horizontal or vertical cells in a row can be the same.&lt;/li&gt;&#xA;&lt;li&gt;There must be an equal number of &lt;code&gt;0&lt;/code&gt;s and &lt;code&gt;1&lt;/code&gt;s in each row and column.&lt;/li&gt;&#xA;&lt;li&gt;No two rows can be the same, and no two columns can be the same.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Let's look at a finished grid:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0011&#xA;1100&#xA;0101&#xA;1010&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As you can see, this board follows rule &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;2&lt;/code&gt; and &lt;code&gt;3&lt;/code&gt;. There are no three horizontal or vertical cells that are the same, all the rows and columns contain an equal number of &lt;code&gt;0&lt;/code&gt;s and &lt;code&gt;1&lt;/code&gt;s, and no two rows and no two columns are the same.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's look at a grid that isn't valid:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;110100&#xA;010011&#xA;011010&#xA;101100&#xA;100011&#xA;001101&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There's a bunch of problems with this grid. For example, row &lt;code&gt;5&lt;/code&gt; has three &lt;code&gt;0&lt;/code&gt;s in a row, and column &lt;code&gt;2&lt;/code&gt; has three &lt;code&gt;1&lt;/code&gt;s in a row, followed by three &lt;code&gt;0&lt;/code&gt;s. Therefore, this is not a valid grid.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to make a program which, given a 2D array of &lt;code&gt;n&lt;/code&gt; * &lt;code&gt;n&lt;/code&gt; &lt;code&gt;0&lt;/code&gt;s and &lt;code&gt;1&lt;/code&gt;s, verifies the board to see if it's a valid, finished Takuzu board.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0011&#xA;1100&#xA;0101&#xA;1010&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This board follows all the rules, and is therefore a valid Takuzu board. You must return a truthy value for this.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;11&#xA;00&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is not a valid board - row &lt;code&gt;1&lt;/code&gt; doesn't follow rule &lt;code&gt;2&lt;/code&gt;. You must return a falsey value for this.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules and Specs:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can assume that all boards are square of dimensions &lt;code&gt;n * n&lt;/code&gt;, where &lt;code&gt;n&lt;/code&gt; is a positive even integer.&lt;/li&gt;&#xA;&lt;li&gt;You can assume that all boards are finished.&lt;/li&gt;&#xA;&lt;li&gt;You may take input as a 2D array containing values signifying &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt;, or as a string.&lt;/li&gt;&#xA;&lt;li&gt;You must output consistent truthy and falsey values for truthy and falsey boards, and the values representing &quot;truthy&quot; and &quot;falsey&quot; cannot be the same.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins!&lt;/p&gt;&#xA;" OwnerUserId="49561" LastEditorUserId="49561" LastEditDate="2017-08-29T09:04:27.343" LastActivityDate="2017-08-29T09:04:27.343" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13812" PostTypeId="2" ParentId="10793" CreationDate="2017-08-27T09:52:53.590" Score="1" Body="&lt;p&gt;If we all agree that the cops' challenge has an objective winning criterion, we should realize that their objective is usually not to make the robbers find it the most interesting, but to trade safety with some other criterion (such as golfiness), and write a submission doing the best in that criterion (and ideally being less safe) that is still safe.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It probably will make it less interesting if you plan a specific method for the robber to crack and leave hints in the code (not always if you are making a standalone puzzle, but always in the case of a challenge that everyone can add a submission). Banning &lt;code&gt;sin(cos(tan(___)))&lt;/code&gt; is like requiring them to make it crackable, which is difficult and subjective. And it makes the cops' scores nonsensical.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is expected that a cop's submission with an uncompetitive score would be very difficult to crack. We just ban the relevant builtins to not trivialize the task or give unadjustable crackability. We don't even need to downvote such answers. The robbers could simply choose to not crack them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, there were submissions using &lt;code&gt;sin(cos(tan(___)))&lt;/code&gt;-like methods being cracked nevertheless on our site.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2017-08-27T09:52:53.590" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13813" PostTypeId="2" ParentId="2140" CreationDate="2017-08-27T15:38:44.667" Score="0" Body="&lt;h1&gt;Help Me Catch Up With xkcd! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;I definitely enjoy xkcd, and you, as a code golfer, most likely enjoy it as well. However, I often find that I won't check the website for a while and there will be a lot to read! So, I want to make a solution for that. In proper code golf fashion.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Your task is to write a program which, when run, will check for a new xkcd and, if there is a new comic (in other words, it is different from the one when the program last ran), output the text &amp;quot;&lt;code&gt;There's a new xkcd out!&lt;/code&gt;&amp;quot;. Use this method to check:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;When the program is run, check if there is a file named &lt;code&gt;.xkcd&lt;/code&gt; in the user's home directory. If not, create the file, which will contain the title of the current xkcd comic, then exit.&lt;/li&gt;&#xA;&lt;li&gt;If the file &lt;code&gt;.xkcd&lt;/code&gt; &lt;em&gt;does&lt;/em&gt; exist in the user's home directory, the program will check if the title of the xkcd comic on the front page of xkcd.com is the same as the one in &lt;code&gt;.xkcd&lt;/code&gt;. If it is, the program will exit and do nothing else. However, if the titles &lt;em&gt;aren't&lt;/em&gt; the same, the program will output the specified text, change the contents of &lt;code&gt;.xkcd&lt;/code&gt; to the new title, then exit.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;If you have any other methods, tell me about them.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so may the shortest code win and the best programmer prosper...&lt;/p&gt;&#xA;" OwnerUserId="64706" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-27T15:38:44.667" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13817" PostTypeId="1" CreationDate="2017-08-27T22:17:33.207" Score="7" ViewCount="163" Body="&lt;p&gt;I have had several questions of mine closed, and I did learn my lesson when the question was closed. But, I feel like we could be more specific not about &lt;em&gt;why&lt;/em&gt; the question was closed, but about what we could do &lt;em&gt;in the future&lt;/em&gt; to improve the user's future questions and maybe give the closed question a new life? I think we should do this and start giving more specific reasons for closing questions.&lt;/p&gt;&#xA;" OwnerUserId="64706" LastEditorUserId="41024" LastEditDate="2017-08-28T08:08:10.673" LastActivityDate="2017-08-28T08:08:10.673" Title="Should we start giving constructive criticism when questions are closed?" Tags="|discussion|close-reasons|" AnswerCount="0" CommentCount="1" ClosedDate="2017-09-03T11:40:27.543" ContentLicense="CC BY-SA 3.0" />
  <row Id="13820" PostTypeId="2" ParentId="2140" CreationDate="2017-08-28T13:30:37.600" Score="1" Body="&lt;h1&gt;Generating Punnett Squares &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The task will be to generate a simple (monohybrid cross) &lt;a href=&quot;https://en.wikipedia.org/wiki/Punnett_square&quot; rel=&quot;nofollow noreferrer&quot;&gt;Punnett Square&lt;/a&gt;, given the &quot;genotype&quot; of two parents.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &quot;trait&quot; will be represented as a single alphabetical character (eg &lt;code&gt;'a'&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An allele for a trait is that character, but if the allele is &lt;strong&gt;dominant&lt;/strong&gt; if it is uppercased, and &lt;strong&gt;recessive&lt;/strong&gt; if lowercased (eg &lt;code&gt;'a'&lt;/code&gt; or &lt;code&gt;'A'&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A genotype is two alleles, both of which can be either dominant or recessive. Note that if a genotype is heterozygous (has one dominant and one recessive allele) the dominant allele will always come first (eg &lt;code&gt;&quot;AA&quot;&lt;/code&gt; or &lt;code&gt;&quot;Aa&quot;&lt;/code&gt; or &lt;code&gt;&quot;aa&quot;&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input will be two strings of length 2, each of which is a valid genotype for one trait. You can take input as arguments to your function or program, or from a file. You should output a Punnett Square in exactly this format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  A  a&#xA;A AA Aa&#xA;a Aa aa&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(This would have been for the input &lt;code&gt;&quot;Aa&quot;&lt;/code&gt; and &lt;code&gt;&quot;Aa&quot;&lt;/code&gt;). The output can be to &lt;code&gt;stdout&lt;/code&gt;, as a string, or to a file.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first parent (which is the first argument) should be across the top, and the second parent should be down the side, so for the input &lt;code&gt;&quot;AA&quot;&lt;/code&gt; and &lt;code&gt;&quot;aa&quot;&lt;/code&gt;, the output should be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  A  A&#xA;a Aa Aa&#xA;a Aa Aa&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your code is expected to work with any trait (letter of the alphabet).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another way to phrase this problem might be to output a table of the cartesian product of two strings of length 2, where each string consists of only uppercase or lowercase variants of one character, and the data in each cell should be sorted such that each uppercase character comes before each lowercase character.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Full sample of behaviour for some trait &quot;a&quot;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;AA&quot;, &quot;AA&quot; -&amp;gt;&#xA;&#xA;  A  A&#xA;A AA AA&#xA;A AA AA&#xA;&#xA;&quot;AA&quot;, &quot;Aa&quot; -&amp;gt;&#xA;&#xA;  A  A&#xA;A AA AA&#xA;a Aa Aa&#xA;&#xA;&quot;AA&quot;, &quot;aa&quot; -&amp;gt;&#xA;&#xA;  A  A&#xA;a Aa Aa&#xA;a Aa Aa&#xA;&#xA;&quot;Aa&quot;, &quot;AA&quot; -&amp;gt;&#xA;&#xA;  A  a&#xA;A AA Aa&#xA;A AA Aa&#xA;&#xA;&quot;Aa&quot;, &quot;Aa&quot; -&amp;gt;&#xA;&#xA;  A  a&#xA;A AA Aa&#xA;a Aa aa&#xA;&#xA;&quot;Aa&quot;, &quot;aa&quot; -&amp;gt;&#xA;&#xA;  A  a&#xA;a Aa aa&#xA;a Aa aa&#xA;&#xA;&quot;aa&quot;, &quot;AA&quot; -&amp;gt;&#xA;&#xA;  a  a&#xA;A Aa Aa&#xA;A Aa Aa&#xA;&#xA;&quot;aa&quot;, &quot;Aa&quot; -&amp;gt;&#xA;&#xA;  a  a&#xA;A Aa Aa&#xA;a aa aa&#xA;&#xA;&quot;aa&quot;, &quot;aa&quot; -&amp;gt;&#xA;&#xA;  a  a&#xA;a aa aa&#xA;a aa aa&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is my first attempt at a challenge so I'd like some feedback on if it's any good and how it can be improved. I haven't been able to find any challenge like this, so hopefully it's not a duplicate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Have I explained it clearly?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this idea interesting enough for a challenge?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What other tags would I use with such a challenge?&lt;/p&gt;&#xA;" OwnerUserId="73570" LastEditorUserId="73570" LastEditDate="2017-08-28T13:41:57.217" LastActivityDate="2017-08-28T13:41:57.217" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13821" PostTypeId="2" ParentId="2140" CreationDate="2017-08-28T14:01:20.380" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Where in the world am I?&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Original Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This challenge has a single aim, given no input, print out the user's current location, with a minimum of the following info:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;City&lt;/li&gt;&#xA;&lt;li&gt;Country&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So any of the following are allowed:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&quot;London, England&quot;&lt;/li&gt;&#xA;&lt;li&gt;&quot;Eifel Tower, Paris, France&quot;&lt;/li&gt;&#xA;&lt;li&gt;[&quot;London&quot;, &quot;England&quot;]&lt;/li&gt;&#xA;&lt;li&gt;{&quot;country&quot;: &quot;Scotland&quot;, &quot;city&quot;: &quot;Edinburgh&quot;}&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The following are not allowed:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;[51.5074, 0.1278]&lt;/li&gt;&#xA;&lt;li&gt;{&quot;country&quot;: &quot;Scotland&quot;, &quot;city&quot;: &quot;Edinburgh&quot;, ISP: &quot;EE&quot;}&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Do not show the user's IP or ISP name, or any extra output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard code golf rules apply&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Good luck, and have fun!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Reason for limits&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No ISP or IP&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Stops just using ipinfo.io&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;No long and lat&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/119078/err-where-am-i&quot;&gt;This has already been a challenge&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Thanks&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;programmer5000 - Suggesting to post here after original was deleted&lt;/p&gt;&#xA;&#xA;&lt;p&gt;caird coinheringaahing - Lon and Lat rules&lt;/p&gt;&#xA;" OwnerUserId="73772" LastEditorUserId="73772" LastEditDate="2017-08-28T21:36:54.547" LastActivityDate="2017-08-28T21:36:54.547" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="13826" PostTypeId="2" ParentId="2140" CreationDate="2017-08-29T16:49:55.730" Score="0" Body="&lt;h1&gt;The source of pi&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;Inspired by an &lt;a href=&quot;https://en.wikipedia.org/wiki/International_Obfuscated_C_Code_Contest#Examples&quot; rel=&quot;nofollow noreferrer&quot;&gt;International Obfuscated C Code Contest&lt;/a&gt;  entry.&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As you all know, pi is a constant that represents the ratio of a circle's circumference to its diameter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using the dimensions of your own source code, approximate pi to at least two decimal places.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That is, your source code should read itself to obtain both circumference and diameter, then output the ratio.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if your code is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; AB&#xA;CDEF&#xA; GH&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your circumference is &lt;code&gt;14&lt;/code&gt; and your diameter is &lt;code&gt;4&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the purposes of this challenge, let diameter equal the larger of the height or width of your code.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take no input&lt;/li&gt;&#xA;&lt;li&gt;Hardcoded values for pi are not allowed&lt;/li&gt;&#xA;&lt;li&gt;Output pi to at least two decimal places (e.g., &lt;code&gt;3.14&lt;/code&gt; and &lt;code&gt;3.1415&lt;/code&gt; are both acceptable outputs)&lt;/li&gt;&#xA;&lt;li&gt;Answers can be either whole programs or functions&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Answers with higher precision values are acceptable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Looking for suggestions of a better title.&lt;/p&gt;&#xA;" OwnerUserId="31072" LastEditorUserId="31072" LastEditDate="2017-08-29T20:26:46.097" LastActivityDate="2017-08-29T20:26:46.097" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13828" PostTypeId="2" ParentId="2140" CreationDate="2017-08-29T19:03:39.087" Score="0" Body="&lt;h1&gt;Paint with Pride!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Task:&lt;/strong&gt; Output a 6 banded version of the &lt;a href=&quot;https://en.wikipedia.org/wiki/Rainbow_flag_(LGBT_movement)&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;pride&lt;/em&gt; flag&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Details:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The flag consists of 6 bands of colour, each band is rectangular, and all are the same size which is 9x1 units (WxH) . These bands are stacked one on top of each other in the order shown to form a flag that is 9x6 units in size.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output scale can be chosen by the participant, but all components must be in those ratios, that is, an output must have an aspect ratio which is a multiple of 3:2.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The hexadecimal values and relative positions of the colours are as below:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/5jhmD.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/5jhmD.png&quot; alt=&quot;Full size&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or from top to bottom RGB &lt;code&gt;(255,0,0)&lt;/code&gt;, &lt;code&gt;(255,153,0)&lt;/code&gt;, &lt;code&gt;(255,255,0)&lt;/code&gt;, &lt;code&gt;(0,153,0)&lt;/code&gt;, &lt;code&gt;(0,0,255)&lt;/code&gt;, &lt;code&gt;(204,0,153)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A minimal version would look like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/hPoEx.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/hPoEx.png&quot; alt=&quot;Min size&quot;&gt;&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Acceptable output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9093/68602&quot;&gt;Output&lt;/a&gt; to screen or as a file in a commonly accepted image format is allowed, ascii art is however not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Sandbox notes:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/136927/68602&quot;&gt;related&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/q/64140/68602&quot;&gt;related&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;I chose this flag because I think the rainbow provides potential for an additional mathematical element&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;I'm not sure whether to include a minimum size limit, such as the one for drawing the french flag, as perhaps the small output size allows hardcoded answers to succeed (which I don't really want) - any advice?&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="68602" LastActivityDate="2017-08-29T19:03:39.087" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13840" PostTypeId="2" ParentId="2140" CreationDate="2017-08-30T23:13:15.360" Score="0" Body="&lt;h1&gt;&amp;quot;Square Root of Pi(e)&amp;quot;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;A pie (r=3) is drawn as such:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  @@&#xA; @@@@&#xA;@@@@@@&#xA; @@@@&#xA;  @@&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Pretending that it's a perfect circle, the square root of such a pie would be &lt;code&gt;sqrt(PI*3&lt;sup&gt;2&lt;/sup&gt;)&lt;/code&gt; = &lt;code&gt;3sqrt(PI)&lt;/code&gt; ~ 5.317. Now take a square out of the pie, whose area is closest to the square root of the pie. In this case it would be a square of area 4. Therefore, you can output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  @@&#xA; @@@@&#xA;@@  @@&#xA; @  @&#xA;  @@&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Yep, I took a square out of the pie, how do you like that?&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;r=7&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;      @@&#xA;     @@@@&#xA;    @@@@@@&#xA;   @@@@@@@@&#xA;  @@@@@@@@@@ &#xA; @@@@@@@@@@@@&#xA;@@@@@@@@@@@@@@&#xA; @@@@@@@@@@@@&#xA;  @@@@@@@@@@&#xA;   @@@@@@@@&#xA;    @@@@@@&#xA;     @@@@&#xA;      @@ &lt;/pre&gt;&#xA;&lt;p&gt;7*sqrt(PI) ~ 12.407. Closer to 3x3 than 4x4 square.&lt;/p&gt;&#xA;&lt;pre&gt;      @@&#xA;     @@@@&#xA;    @@@@@@&#xA;   @@@@@@@@&#xA;  @@@@@@@@@@ &#xA; @@@@@@@@@@@@&#xA;@@@@@@@@@@@@@@&#xA; @@@@@@   @@@&#xA;  @@@@@   @@&#xA;   @@@@   @&#xA;    @@@@@@&#xA;     @@@@&#xA;      @@ &lt;/pre&gt;&#xA;&lt;h3&gt;Specifications:&lt;/h3&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Input will be only a &amp;quot;pie&amp;quot; with integer radius of at least two. As you can see, the longest row has &lt;strong&gt;2r&lt;/strong&gt; &lt;code&gt;@&lt;/code&gt;s, and the smallest rows have 2 &lt;code&gt;@&lt;/code&gt;s.&lt;/li&gt;&#xA;&lt;li&gt;You can use a symbol other than &amp;quot;@&amp;quot;.&lt;/li&gt;&#xA;&lt;li&gt;You can take a square out of the inside or the edge.&lt;/li&gt;&#xA;&lt;li&gt;Approximate PI to at least 3.14.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;strong&gt;Bonus&lt;/strong&gt;: Valid answers that are in a language with food-related name get a free upvote!&lt;/p&gt;&#xA;" OwnerUserId="46313" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-08-31T22:54:28.710" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13845" PostTypeId="2" ParentId="2140" CreationDate="2017-08-31T22:41:29.160" Score="0" Body="&lt;h1&gt;The Best Question&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stack-exchange-api&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stack-exchange-api&amp;#39;&quot; rel=&quot;tag&quot;&gt;stack-exchange-api&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This site gets a variety of questions: the good, the bad, the ugly. However, I've noticed some patterns that I think will help us find &lt;strong&gt;The Best Question&lt;/strong&gt; (of a given week).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Procedure&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You are given a date in a human-readable format of your choice as input. You need to find the best question from that week. The week starts on Sunday and ends on Saturday. Click on the link for a valid query to use if the input is &lt;a href=&quot;https://api.stackexchange.com/docs/questions#pagesize=100&amp;amp;fromdate=2017-08-27&amp;amp;todate=2017-09-02&amp;amp;order=asc&amp;amp;sort=creation&amp;amp;filter=default&amp;amp;site=codegolf&amp;amp;run=true&quot;&gt;Aug 31, 2017&lt;/a&gt;. Note that when using the API without a key you can use UNIX epoch time or YYYY-MM-DD to specify the dates (info &lt;a href=&quot;https://api.stackexchange.com/docs/dates&quot;&gt;here&lt;/a&gt;). Since this site gets only about 45 questions a week, you can assume that no more than 100 questions will be asked in a given week in order to avoid pagination.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;First of all, closed questions are &lt;strong&gt;disqualified&lt;/strong&gt;. Next, here is the formula for Question Rating (QR)&lt;sup&gt;1&lt;/sup&gt;, given Question Score (S) and Number of Answers (A): &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/DPYzr.png&quot; width=&quot;120&quot; height=&quot;48&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The thinking is that there are two kinds of questions that undeservedly get a very high question score: 1) the ones that are easy and get a lot of answers, and 2) the ones that are so difficult that they get few or no answers. I've determined that the best questions have a QuestionScore:Answer ratio of about 3:2.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;All you have to do is output the full URL of the question that got the best question score. If multiple tie, you can output them all or just one.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here's a list of 8 imaginary questions, with their question score followed by the number of answers they received, and their resulting QR:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1. +6, 23A -&amp;gt; -0.333&#xA;2. +10, 0A -&amp;gt; 7.78&#xA;3. +8, 4A -&amp;gt; 7.56&#xA;4. -2, 6A -&amp;gt; -4.44&#xA;5. +5, 3A [closed] -&amp;gt; DQ&#xA;6. +20 2A -&amp;gt; 16.22&#xA;7. +24, 40A -&amp;gt; 16&#xA;8. +15, 14A -&amp;gt; 13.67&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So the winner is question 6. Output its URL.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Note&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You don't need to handle the rare edge case when there are no valid questions in a given week.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;sup&gt;1&lt;/sup&gt;Disclaimer: This scoring system is just a joke.&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Suggestions on formula and other stuff welcome.&lt;/p&gt;&#xA;" OwnerUserId="46313" LastEditorUserId="46313" LastEditDate="2017-09-02T00:24:46.237" LastActivityDate="2017-09-02T00:24:46.237" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13848" PostTypeId="2" ParentId="2140" CreationDate="2017-09-01T23:09:56.350" Score="1" Body="&lt;h1&gt;Displaying exponent towers in ASCII&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmatic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmatic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmatic&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Unlike &lt;code&gt;+&lt;/code&gt; and &lt;code&gt;*&lt;/code&gt;, the exponentiation operator &lt;code&gt;^&lt;/code&gt; is not associative. The convention is that &lt;code&gt;^&lt;/code&gt; is right associative, so that &lt;code&gt;a^(b^c) = a^b^c&lt;/code&gt;. Of course, nested exponentials are usually displayed as nested superscripts, which can be represented in ASCII as:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;            c&#xA;           b&#xA;a^(b^c) = a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For a general right associative operator &lt;code&gt;&amp;amp;&lt;/code&gt;, there would be no way to simplify the expression &lt;code&gt;(a&amp;amp;b)&amp;amp;c&lt;/code&gt;. However, exponentiation satisfies the rule&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;           bc&#xA;(a^b)^c = a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;bc&lt;/code&gt; means &lt;code&gt;b*c&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Combining these rules, we can express any arbitrarily parenthesized exponential expression using only superscripts and juxtaposition. For example, &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;                                               d&#xA;                                              c  f&#xA;                                             b  e&#xA;(a^(b^(c^d)))^(e^f) = a^((b^(c^d))*(e^f)) = a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a function that, given a string consisting of lowercase letters, parentheses, and &lt;code&gt;^&lt;/code&gt; that represents a valid mathematical expression (see rules), prints an ASCII representation of this expression in the manner described above.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The input string is any element of the context-free grammar determined by the rules&lt;br&gt;&#xA;&lt;code&gt;S → any lowercase letter&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;S → (S^S)&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The output must consist of only lowercase letters, spaces and newlines. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The resulting ASCII picture must have exactly one letter per column.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The left to right order of the letters must be preserved from input to output.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: a&#xA;Output:&#xA;a&#xA;&#xA;Input: (a^(b^c))&#xA;Output:&#xA;  c&#xA; b&#xA;a&#xA;&#xA;Input: ((a^b)^(c^d))&#xA;Output:&#xA;   d&#xA; bc&#xA;a&#xA;&#xA;Input: ((a^(b^c))^d)&#xA;Output:&#xA;  c&#xA; b d&#xA;a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Is it clear what picture you are supposed to output?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This challenge has some similarities to this other challenge, but I think they are far enough part to not be dupes: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/86647/convert-exponents-into-ascii-art&quot;&gt;Convert exponents into ASCII art&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41266" LastActivityDate="2017-09-01T23:09:56.350" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13849" PostTypeId="2" ParentId="2140" CreationDate="2017-09-02T18:59:10.387" Score="0" Body="&lt;h1&gt;Extend the Pattern&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&#xA;Given a raster image with a lattice pattern, extend it to twice the size of the input image in both directions.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;p&gt;The input image is a section of an infinite repeating pattern defined by two vectors &lt;code&gt;u=(ux,uy),v=(vx,vy)&lt;/code&gt; with integer entries, that are linearly independent. This means that both vectors are nonzero and do not point in the same direction. The pattern is defined such that the pixel at a point &lt;code&gt;p = (x,y)&lt;/code&gt; has the exact same colour as the pixel at&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;q := p + s*u + t*v &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;for every integer &lt;code&gt;s,t&lt;/code&gt;.&#xA;This means if you know the colours of the pixels within the &lt;em&gt;fundamental parallelogram&lt;/em&gt; &lt;code&gt;Z = { s*u + t*v | s in [0,1),t in [0,1)}&lt;/code&gt; and corresponding vectors &lt;code&gt;u,v&lt;/code&gt; you can extend the pattern to an arbitrary size.&#xA;The goal of this challenge is finding the pattern and extend the image.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/EeB4s.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/EeB4s.jpg&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Specs&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can take the input image in any non-compressed image format that allows for at least 3 colours, this includes e.g. matrices, 2d arrays or strings.&lt;/li&gt;&#xA;&lt;li&gt;The input method must match the output method. That means if you read a &lt;code&gt;.png&lt;/code&gt; file as input, you must also write a &lt;code&gt;.png&lt;/code&gt; file as output, or if you take the input via console, you must also print the output via console e.t.c.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;(to be added...)&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-02T18:59:10.387" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13851" PostTypeId="2" ParentId="2140" CreationDate="2017-09-03T16:08:20.637" Score="0" Body="&lt;h1&gt;Golf a Brainfuck compresser.&lt;/h1&gt;&#xA;&lt;p&gt;The eso-lang &lt;a href=&quot;https://esolangs.org/wiki/Brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brainfuck&lt;/a&gt; only has 8 instructions that do something: &lt;code&gt;+-&amp;gt;&amp;lt;[],.&lt;/code&gt; so in theory you could represent them in 3 bits. You could store 8 instructions in 24 bits or 3 bytes.&lt;/p&gt;&#xA;&lt;h2&gt;BrnFck&lt;/h2&gt;&#xA;&lt;p&gt;This is compressed brainfuck an instruction will be represented by its bits.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;+&lt;/code&gt; : 000&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;-&lt;/code&gt; : 001&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;gt;&lt;/code&gt; : 010&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;lt;&lt;/code&gt; : 011&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[&lt;/code&gt; : 100&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;]&lt;/code&gt; : 101&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;,&lt;/code&gt; : 110&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;.&lt;/code&gt; : 111&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;This is a language counted in bits, 8 bits is 1 byte depending on the challenge you may round up or keep a decimal.&lt;/p&gt;&#xA;&lt;h2&gt;The goal&lt;/h2&gt;&#xA;&lt;p&gt;Write the shortest program that can compile any inputted brainfuck code to BrnFck code:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can choose how you output it, byte,bit/boolean arrays and output streams are all acceptable. Just printing ASCII-letters is too.&lt;/li&gt;&#xA;&lt;li&gt;You can do anything (including crash) if the input isn't valid code or contains a non-bf character.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And can compile the BrnFck code back to Brainfuck (or any other language (except BrnFck)). You may ask which way you want to compile or write 2 separate programs/functions and sum their scores.&lt;/p&gt;&#xA;&lt;p&gt;If you post the code online (for example as an answer) this should automatically allow BrnFck as a language in all future challenges!&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;If you use brainfuck you can divide your bytes by 2.&lt;/p&gt;&#xA;&lt;p&gt;If you use BrnFck you can divide your bytes by 4 (let's get some recursion going here).&lt;/p&gt;&#xA;&lt;p&gt;1 bit will be counted as 0.125 bytes (please put both in the title) so decimal byte scores are allowed.&lt;/p&gt;&#xA;&lt;h2&gt;Tags&lt;/h2&gt;&#xA;&lt;p&gt;brainfuck,code-golf,...&lt;/p&gt;&#xA;" OwnerUserId="63550" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-03T19:51:08.270" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13859" PostTypeId="1" AcceptedAnswerId="13860" CreationDate="2017-09-04T23:02:49.420" Score="17" ViewCount="633" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/semicolon-%23&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;semicolon-#&amp;#39;&quot; rel=&quot;tag&quot;&gt;semicolon-#&lt;/a&gt; is a tag for challenges related to the language &lt;code&gt;;#&lt;/code&gt;. I suggest we remove this tag, since it is very localized and we've pretty much exhausted all non-duplicate challenges concerning this language and derivatives thereof. I predict most of the future challenges that could possibly be tagged with this tag would either be a duplicate of a previous language-implementation challenge or just a poor challenge in general.&lt;/p&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="66833" LastEditDate="2018-04-12T22:49:55.843" LastActivityDate="2018-04-12T22:49:55.843" Title="Can we remove the semicolon-# tag?" Tags="|discussion|feature-request|status-completed|tags|" AnswerCount="3" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13860" PostTypeId="2" ParentId="13859" CreationDate="2017-09-05T00:03:21.913" Score="22" Body="&lt;h1&gt;Burninate it&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As the author of &lt;code&gt;;#&lt;/code&gt; and the original challenge, I kind of feel obligated to weigh in here. The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/semicolon-%23&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;semicolon-#&amp;#39;&quot; rel=&quot;tag&quot;&gt;semicolon-#&lt;/a&gt; tag doesn't really add anything to the site, and as demonstrated by my last attempt, &lt;s&gt;all&lt;/s&gt; most variations of the original challenge have been done.*&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I see no real point in having a language specific tag for every &quot;Implement this language&quot; question, otherwise we'd have a tidal wave of useless one-hit wonder tags.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;;#&lt;/code&gt; had its (undeserved) moment of fame, I think it's time we got rid of the tag, as it contributes to giving new users the wrong impression about language-specific challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;* If you can really pull off a well written and well thought out &lt;code&gt;;#&lt;/code&gt; challenge, then good for you. It doesn't mean that 99% of related challenge ideas aren't boring/already done.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="70424" LastEditDate="2017-09-13T08:46:11.653" LastActivityDate="2017-09-13T08:46:11.653" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13861" PostTypeId="2" ParentId="13859" CreationDate="2017-09-05T00:03:39.607" Score="8" Body="&lt;h1&gt;Get rid of it&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;;# produced some interesting challenges that, while they benefited from being related to the language (the ridiculousness of language itself pushed it far), could definitely have been standalone and unrelated challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;;# is also a valid language &lt;em&gt;only&lt;/em&gt; for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmorgorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmorgorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmorgorov-complexity&lt;/a&gt; challenges. This makes answers in the language a very rare occurrence. Other languages (such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot;&gt;python&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/java&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;java&amp;#39;&quot; rel=&quot;tag&quot;&gt;java&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/jelly&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;jelly&amp;#39;&quot; rel=&quot;tag&quot;&gt;jelly&lt;/a&gt;, etc.) have their own tags because:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;of their tips questions.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;;# cannot possibly have any tips, since any task that is possible in it is solvable in one and only one way.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;parts of the language can be explored to make challenges about.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;;# has exactly two commands which have been explored &lt;em&gt;completely&lt;/em&gt; in the few challenges done.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Furthermore, any more challenges could only possibly be &quot;extensions&quot; of the language, which has been shown in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/122289/without-resetting&quot;&gt;:$&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/122343/make-a-interpreter&quot;&gt;+-#$%!&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/141055/make-a-interpreter&quot;&gt;;#*:)&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="68615" LastEditorUserId="68615" LastEditDate="2017-09-05T00:09:36.933" LastActivityDate="2017-09-05T00:09:36.933" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13863" PostTypeId="2" ParentId="13859" CreationDate="2017-09-05T02:44:52.433" Score="15" Body="&lt;h1&gt;Lets remove some other language tags too&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I have noticed a large number of language based tags that are only attached to one or two questions.  Particularly a large number of tags only attached to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question.  And if we intend to get rid of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/semicolon-%23&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;semicolon-#&amp;#39;&quot; rel=&quot;tag&quot;&gt;semicolon-#&lt;/a&gt;  we should get rid of some other seldom used language-based tags.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-09-05T02:44:52.433" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="13866" PostTypeId="1" CreationDate="2017-09-06T02:29:52.363" Score="0" ViewCount="184" Body="&lt;p&gt;How many votes does it take to be a consensus? And what is the vote ratio needed?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The accepted answer will A. Abide by the rules for consensus it answered with and B. Have the most upvotes.&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastActivityDate="2017-09-06T14:24:11.547" Title="What is a meta consensus?" Tags="|discussion|meta|" AnswerCount="2" CommentCount="2" ClosedDate="2017-09-06T18:07:59.290" ContentLicense="CC BY-SA 3.0" />
  <row Id="13867" PostTypeId="2" ParentId="2140" CreationDate="2017-09-06T09:40:53.413" Score="4" Body="&lt;h1&gt;I'm symmetric, not palindromic! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/110582/im-a-palindrome-are-you&quot;&gt;I'm a palindrome. Are you?&lt;/a&gt;, where it is presented the &lt;a href=&quot;https://www.reddit.com/r/Showerthoughts/comments/5vkrg5/&quot; rel=&quot;nofollow noreferrer&quot;&gt;shocking&lt;/a&gt; fact that “&lt;code&gt;()()&lt;/code&gt; is not a palindrome, but &lt;code&gt;())(&lt;/code&gt;”, I asked myself what instead is &lt;code&gt;()()&lt;/code&gt; and the answer is simply: it is a string with a vertical symmetry axis!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The task&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that takes a string S (or the appropriate equivalent in your language) as input, checks for symmetry along the vertical axis, and returns a &lt;a href=&quot;http://meta.codegolf.stackexchange.com/a/2194&quot;&gt;truthy or falsy&lt;/a&gt; value accordingly. You can use &lt;a href=&quot;http://meta.codegolf.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;any reasonable means&lt;/a&gt; to take the input and provide the output.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Reflectional symmetry&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Reflectional symmetry around a vertical axis (or left-right symmetry) means that if you put a mirror vertically at the exact center of the string, the reflected image of the first half of the string is identical to the second half of the string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the following strings are reflectional symmetric around a vertical axis:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;()()&#xA;()()()&#xA;[A + A]&#xA;WOW ! WOW&#xA;OH-AH_wx'xw_HA-HO&#xA;(&amp;lt;&amp;lt;[[[T*T]]]&amp;gt;&amp;gt;)&#xA;(:)&#xA;)-(&#xA;())(()&#xA;qpqp&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;while the following are not:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;())(&#xA;((B))&#xA;11&#xA;+-*+-&#xA;WOW ! wow&#xA;(;)&#xA;qppq&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Rules of the contest&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;• Your program or function will receive only printable ASCII characters. You can include or not the empty string, (which is symmetric, of course!) as legal input, which is better for you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;• The ASCII characters that can be considered symmetric with respect to the vertical axes are the following (note the initial space, and the difference between uppercase and lowercase letters):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; !&quot;'+*-.:=AHIMOTUVWXY^_ovwx|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The ASCII characters that can be considered “mirrored” and their corresponding characters are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;()&amp;lt;&amp;gt;[]{}qpbd/\&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that, since they are mirrored, you can have both &lt;code&gt;()&lt;/code&gt; as well as &lt;code&gt;)(&lt;/code&gt;, &lt;code&gt;/\&lt;/code&gt; and &lt;code&gt;\/&lt;/code&gt;, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All the other ASCII printable characters must be considered asymmetric and without a mirrored corresponding character.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;• This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge: the shorter your program is, measured in bytes, the better, in any programming language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;• Kudos to people that will produce a symmetric program!&lt;/p&gt;&#xA;" OwnerUserId="41789" LastEditorUserId="41789" LastEditDate="2017-09-08T16:01:18.217" LastActivityDate="2017-09-08T16:01:18.217" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="13869" PostTypeId="2" ParentId="13866" CreationDate="2017-09-06T13:21:14.263" Score="-3" Body="&lt;h1&gt;5 net votes and double the upvotes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I can't find a meta post about this, but this is fairly established and I don't think it has been changed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a meta post has a score of 5 (upvotes - downvotes) and the amount of upvotes is at least double the amount of downvotes, it has reached consensus.&lt;/p&gt;&#xA;" OwnerUserId="68615" LastEditorUserId="68615" LastEditDate="2017-09-06T14:24:11.547" LastActivityDate="2017-09-06T14:24:11.547" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13870" PostTypeId="2" ParentId="13866" CreationDate="2017-09-06T14:16:17.353" Score="3" Body="&lt;p&gt;&lt;strong&gt;Consensus simply means &quot;general agreement.&quot;&lt;/strong&gt; There is no specific quantity of upvotes or downvotes that you can use to measure it, because if we change our minds later, the vote count will no longer reflect the consensus.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Votes can help us gauge the consensus of the community, but they do not necessarily represent it.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastActivityDate="2017-09-06T14:16:17.353" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13873" PostTypeId="2" ParentId="13792" CreationDate="2017-09-07T00:40:29.340" Score="4" Body="&lt;p&gt;The difference between this proposal and the newer-languages proposal is that abuse is more clearly defined in the latter. I can imagine several ambiguities that can arise from this rule.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What about interpreters that take input from the command-line arguments, like Jelly?&lt;/li&gt;&#xA;&lt;li&gt;What about interpreters that can use the command-line arguments for the initial stack contents, like &gt;&amp;lt;&gt;?&lt;/li&gt;&#xA;&lt;li&gt;Wait, are those two even different?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;With the newer-languages proposal, abuse is fairly clear: if a feature was added to a language that is useful on one challenge but on very few others, then adding the feature constitutes abuse.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With this proposal, there's simply too much room for ambiguity as to what constitutes abuse. MetaGolfScript is abuse because it encodes &lt;em&gt;all&lt;/em&gt; the program information outside of the scored section of the program. This leaves open the question of how &lt;em&gt;much&lt;/em&gt; program information can be encoded.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The way I see it, you have two options:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Create the alternative implementations.&lt;/strong&gt; As you said, it would not take too long, and it completely eliminates the ambiguity problems.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Deal with it.&lt;/strong&gt; I don't expect Klein or Brain-Flak will be competing for 1st place, so think of the challenge as a competition in every language. The bytes for command-line flags are boilerplate, but then again lots of languages have boilerplate. Are those added 3 bytes really so bad compared to &lt;code&gt;class M{public static void main(String[]a){}}&lt;/code&gt;?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="61384" LastActivityDate="2017-09-07T00:40:29.340" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13876" PostTypeId="2" ParentId="2140" CreationDate="2017-09-07T16:21:49.753" Score="-2" Body="&lt;h1&gt;The Compressor&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;You are given this list of 100 positive integers that are at between 7 and 18 digits long:&lt;/p&gt;&#xA;&lt;p&gt;[list to come]&lt;/p&gt;&#xA;&lt;p&gt;You need to generate 100 snippets that will produce these numbers in some language (either as a numeric or string). Your score is the total length of the snippets. Lowest score overall wins, but you should also try to get the lowest score in whichever language your snippets are in. Please include both your snippets and any code you used to generate them in your submission. Note: the generating code isn't actually scored.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The snippets must all be in one language, however it does not need to be the same language as the generating program(s).&lt;/li&gt;&#xA;&lt;li&gt;You may assume that any pre-existing libraries you use are already imported.&lt;/li&gt;&#xA;&lt;li&gt;You don't need to include the line terminator (i.e ';' in Java and others) for snippets that fit on one line. For multi-line snippets, you don't need to put a terminator on the last line.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;1357000&lt;/code&gt; =&amp;gt; &lt;code&gt;1357e3&lt;/code&gt; (many languages)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1234567&lt;/code&gt; =&amp;gt; &lt;code&gt;1234567&lt;/code&gt; (most languages)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;307422089600&lt;/code&gt; =&amp;gt; &lt;code&gt;S6*99b&lt;/code&gt; (CJam, returns value of [32,32,32,32,32,32] in base 99)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;12582912&lt;/code&gt; =&amp;gt; &lt;code&gt;12&amp;lt;&amp;lt;20&lt;/code&gt; (JS + others)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Alternative: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;I generated this 100 digit random number with &lt;a href=&quot;https://www.random.org/integers/&quot; rel=&quot;nofollow noreferrer&quot;&gt;random.org&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;7160708104901559695507628057638725214364226867212714872539720713967912042100814603497742352846014272&lt;/pre&gt;&#xA;&lt;p&gt;Write the shortest possible program that outputs this number.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/66921/no-strings-or-numbers-attached&quot;&gt;No strings (or numbers) attached&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Questions? Clarifications?&lt;/p&gt;&#xA;" OwnerUserId="46313" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-08T15:05:07.280" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="13877" PostTypeId="2" ParentId="2140" CreationDate="2017-09-07T20:34:23.393" Score="0" Body="&lt;h1&gt;Program that allows the user to edit it's own source code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program that displays and allows the user to view, edit and save it's own source code. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If no edits are made, the output file should be the same as the program, and hence executing it should allow the user to edit the program's code again. (ie a quine)&lt;/li&gt;&#xA;&lt;li&gt;If the code has been edited in a sensible way, running the program again should display the &lt;em&gt;edited&lt;/em&gt; code. The definition of 'sensible' is left flexible to prevent this being impossible - as the source code can be edited, a user can obviously edit the program in such a way that it no longer displays it's source code.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The standard quine rule applies: no reading the source file directly.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Additional Notes and things to consider:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How robust is your program? What percentage of your program can be edited (sensibly) before it stops displaying it's own source or saving the edits you made.&lt;/li&gt;&#xA;&lt;li&gt;Both overwriting and saving with a different filename are valid ways for the program to save it's new code&lt;/li&gt;&#xA;&lt;li&gt;If it is a compiled language, the program does not have to invoke the compiler or do the compiling itself after saving. &lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is a code &lt;em&gt;challenge&lt;/em&gt; not code &lt;em&gt;golf&lt;/em&gt;. Robustness, interface and 'coolness' of the solution are favoured over brevity.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Extra, uh, points(?!) if your program can identify errors in the quine before saving.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Is this a feasible challenge? Does it need clarification?&lt;/p&gt;&#xA;" OwnerUserId="70721" LastActivityDate="2017-09-07T20:34:23.393" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13881" PostTypeId="1" CreationDate="2017-09-08T14:11:50.467" Score="2" ViewCount="115" Body="&lt;p&gt;Most challenges that take a true/false or right/left or something like that input allow you to pick any two distinct values for these inputs. Recently, &lt;a href=&quot;https://codegolf.stackexchange.com/a/141025/68942&quot;&gt;this answer&lt;/a&gt; came up. Clever use of this specification; however, I feel like this is cheating in some sense, and, as AdmBorkBork points out, it is in spirit a violation of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default/1789#1789&quot;&gt;this standard loophole&lt;/a&gt; (adding input or rules that weren't explicitly mentioned in the challenge).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One solution is to include these inputs in the bytecount; however, taking &quot;true&quot; and &quot;false&quot; are perfectly normal/reasonable and shouldn't be included. The issue then becomes what should be counted as extra bytes and what shouldn't.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can we get a decision on what to do? Either always include, make an objective decision process to include the bytes, or never include.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2017-09-10T23:17:18.623" Title="Encoding data in flexible inputs" Tags="|discussion|code-golf|rules|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="13882" PostTypeId="2" ParentId="2140" CreationDate="2017-09-08T14:46:31.917" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/142349/erd%C5%91s-straus-conjecture&quot;&gt;Erdős–Straus conjecture&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="36594" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-10T20:40:47.047" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13883" PostTypeId="2" ParentId="2140" CreationDate="2017-09-08T17:12:15.673" Score="0" Body="&lt;h1&gt;Do the line segments cross?&lt;/h1&gt;&#xA;&lt;p&gt;Description: Today, we're going to do some geometry: We have two line segments and want to find out where they cross! A point is a pair of two integers being the x and y coordiantes of said point. If your calculations result in non-integers, you continue with the integer closest to your result.&lt;/p&gt;&#xA;&lt;p&gt;I/O: You are given the two segments in form of 8 integers representing the 4 end points. You may take them in the order that fits you best, but you have to state the ordering. The output consisting of the point where the lines intersect, or &lt;code&gt;null&lt;/code&gt;, an empty string or something similar, but no undefined behavior. You may use STDOUT, a file etc. to write your output.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; - the shortest answer in bytes wins!&lt;/p&gt;&#xA;" OwnerUserId="72218" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-08T18:04:31.957" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13884" PostTypeId="2" ParentId="2140" CreationDate="2017-09-08T17:30:19.770" Score="0" Body="&lt;h1&gt;Prime Number Locator&lt;/h1&gt;&#xA;&lt;p&gt;Given a prime number &lt;code&gt;p &amp;gt; 1&lt;/code&gt;, determine at what index &lt;code&gt;p&lt;/code&gt; appears in &lt;a href=&quot;https://oeis.org/A000040&quot; rel=&quot;nofollow noreferrer&quot;&gt;A000040&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may 0 or 1 index, meaning 2 can return 0 or 1.&lt;/li&gt;&#xA;&lt;li&gt;If you are given a non-prime number you must return -1.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If you are 1-indexing you may return 0 instead, or still return -1.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Your time complexity must be less than &lt;code&gt;O(n)&lt;/code&gt;: Please explain your calculations in the answer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;First 10 return values (0-indexed):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[2, 3, 5, 7, 11, 13, 17, 19, 23, 29]&#xA;[0, 1, 2, 3,  4,  5,  6,  7,  8,  9]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/prime&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;prime&amp;#39;&quot; rel=&quot;tag&quot;&gt;prime&lt;/a&gt;: Reduce your byte-count to win.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-08T17:30:19.770" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13885" PostTypeId="2" ParentId="13881" CreationDate="2017-09-08T21:37:50.463" Score="-5" Body="&lt;h2&gt;Allow it&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It has been fairly broadly accepted that redefining the range of an input or output to some other range, such that bidirectional and unambiguous translation between the two is defined, is accepted even if it is used to shorten code; a simple version would be taking &lt;code&gt;1&lt;/code&gt; for true and &lt;code&gt;-1&lt;/code&gt; for false instead of the more traditional &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;While I can imagine establishing certain rules that would prohibit excessive abuse like the one linked, such as &quot;every possible value of the input/output's data type must map to exactly one value of the challenge's respective data type&quot;, e.g. taking the &lt;code&gt;left/right&lt;/code&gt; input as a string means your program needs to accept every possible string as input and every one of those strings must consistently output either the left result or the right result. This would potentially have prevented that particular problem, but it also is likely to harm a very large number of much smaller abuses like the &lt;code&gt;1/-1&lt;/code&gt; case as well as opening a can of worms about what defines a &quot;data type&quot; and possibly others. I believe other solutions would result in similar issues.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, I don't see this as harmful. While you could argue that the linked answer is problematic, unless we're intending to completely get rid of the consensus that &quot;two distinct values&quot; is often identical to &quot;true/false&quot; with regard to answers here I think the difficulty in &quot;drawing the line&quot; about what constitutes abuse and in designing a method to evaluate whether an answer does so, are excessive. I also don't think that many challenges are vulnerable to using ASCII art to represent distinct states of input, and in the linked answer for example, it may have been significant byte savings but it definitely did not trivialize the problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would only say that this rule becomes invalid if the challenge itself is to perform such a mapping, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/126699/create-a-checkerboard-matrix&quot;&gt;this&lt;/a&gt; one, where each distinct input has its own distinct output. In such cases a challenger could simply define their input range as identical to the output range and the challenge is trivially solved (requiring 0 bytes in multiple languages).&lt;/p&gt;&#xA;" OwnerUserId="71434" LastActivityDate="2017-09-08T21:37:50.463" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13886" PostTypeId="1" CreationDate="2017-09-09T01:28:58.793" Score="-4" ViewCount="131" Body="&lt;p&gt;How is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/142213/language-agnostic-code-golf&quot;&gt;Language Agnostic Code Golf!&lt;/a&gt; a dupe of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/61955/which-language-is-shortest&quot;&gt;Which language is shortest?&lt;/a&gt;? Sure the general ideas are the same, but the methodologies are totally different. It's a dupe because both questions involve adding up scores based on language, huh? The technical differences between the challenges are so multitudinous, I'm not sure why someone who read both would say mine is a dupe. Here are some differences:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;strong&gt;Original question&lt;/strong&gt;: Find 50 latest challenges with 20 or more answers.&lt;br&gt;&#xA;&lt;strong&gt;My question&lt;/strong&gt;: Find 40 questions that have answers in both inputted languages.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Original question&lt;/strong&gt;: Add up all the scores on all the questions. Get the averages. Return the 20 most common languages.&lt;br&gt;&#xA;&lt;strong&gt;My question&lt;/strong&gt;: Add up the best scores for each question. Return the ratio of the first language's total to the second languages'.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Sure they're similar, but the techniques/queries used are different. If the techniques are different aren't they different? If there are two questions that say &quot;Calculate Pi&quot; but require different techniques, is one a dupe of the other?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My other argument is that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stack-exchange-api&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stack-exchange-api&amp;#39;&quot; rel=&quot;tag&quot;&gt;stack-exchange-api&lt;/a&gt; is a unique tag with not many questions. I don't think there is all that much variety in how that tag operates.&lt;/p&gt;&#xA;" OwnerUserId="46313" LastEditorUserId="46313" LastEditDate="2017-09-09T01:47:12.433" LastActivityDate="2017-09-09T15:47:58.813" Title="I don't think my question is a dupe" Tags="|discussion|reopening|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13887" PostTypeId="2" ParentId="13886" CreationDate="2017-09-09T01:40:21.777" Score="9" Body="&lt;h1&gt;What's different?&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;you need to find 40 questions that have both languages as answers, not &quot;the 50 most recent questions with 25 or more answers&quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That's really not that different. One of them's just more tedious because you have to go through more questions, but it's not all that different; just take an answer, change &lt;code&gt;50&lt;/code&gt; to &lt;code&gt;1000&lt;/code&gt;, apply a filter, and take the first 40 elements. I trust any language can do that pretty easily. &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;you need to find the best-scoring answer for each language, not every answer  &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;but in the question:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;*(technically there's a lower byte count answer under &quot;JS&quot; but you're not required to detect it.)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Huh? Please be consistent; either way, you have to look through all of the answers anyway so it's not going to be that different.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The methodologies are very different, and I don't see how it's a dupe except for the general idea, which doesn't matter.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Actually, it's a dupe because of the general idea. The specifics are different but if that were enough to make it its own challenge we'd have a thousand variants on Hello World / Hello, World / Hello, world / Hello World! / etc...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I don't think it's different enough to be its own challenge.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You have failed to point out that yours takes input to compare two languages while the other extracts language names from the answers; however, that can be easily changed from that challenge to your challenge.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2017-09-09T01:40:21.777" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13890" PostTypeId="2" ParentId="13886" CreationDate="2017-09-09T15:47:58.813" Score="-5" Body="&lt;h1&gt;It would've been fun...&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Look, I really appreciate the effort that's been put into stopping code-trolling and closing obvious dupes and non-objective questions. However, I really think some people fail to give things a chance, and ignore the fact that while it take seconds to vote to close, it takes a significant amount of time to write a question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ultimately, my question was not the same as the other one. The metric is the same - the average length of the various languages - however the technique was different. The first involved looking at the 50 most recent large questions and pooling the results, whereas mine involved &lt;em&gt;only&lt;/em&gt; looking at questions where both languages had an answer. The results could've been wildly different.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As far as my &quot;Calculate Pi&quot; comment - if one question said calculate Pi wit the Monte Carlo method and the other said calculate Pi with the co-primes method, shouldn't they both been allowed?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anyway, it would've been fun...&lt;/p&gt;&#xA;" OwnerUserId="46313" LastActivityDate="2017-09-09T15:47:58.813" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13891" PostTypeId="1" AcceptedAnswerId="13892" CreationDate="2017-09-09T15:51:39.457" Score="5" ViewCount="268" Body="&lt;h2&gt;Alternative title: Look! I made a thing!&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The recent &lt;a href=&quot;https://codegolf.stackexchange.com/q/135102/8927&quot;&gt;Formic Functions&lt;/a&gt; challenge was a lot of fun, and seems to have taken the concept of easy-to-run online javascript-based king-of-the-hill challenges to a new level. It's inspired me to make a framework for building them, which I invite people to take a look at!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/davidje13/koth-webplayer&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://github.com/davidje13/koth-webplayer&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I have a vague idea for a KoTH challenge of my own, which I plan to build with this framework)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For those saying &quot;wait, haven't we seen &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10572/8927&quot;&gt;this&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7165/introducing-a-koth-server&quot;&gt;before&lt;/a&gt;?&quot;: I for one think that the ease of just visiting a website and typing in some code gives this new style a much lower bar-to-entry for competitors, and the ability to develop games without any setup whatsoever (you can literally download the code and open the html files) gives a much lower bar-to-entry for contest writers.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;My Question&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I've been cloning past challenges to drive out the functionality, but so far I've only found 3:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://davidje13.github.io/koth-webplayer/formic.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://davidje13.github.io/koth-webplayer/formic.htm&lt;/a&gt; — &lt;a href=&quot;https://codegolf.stackexchange.com/q/135102/8927&quot;&gt;Question&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://davidje13.github.io/koth-webplayer/battlebots.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://davidje13.github.io/koth-webplayer/battlebots.htm&lt;/a&gt; —&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/48353/8927&quot;&gt;Question&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://davidje13.github.io/koth-webplayer/botflocks.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://davidje13.github.io/koth-webplayer/botflocks.htm&lt;/a&gt; —&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/50690/8927&quot;&gt;Question&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There must be others out there. Does anybody remember any?&lt;/p&gt;&#xA;" OwnerUserId="8927" LastActivityDate="2017-09-09T16:25:00.057" Title="What javascript-only KoTH challenges have there been?" Tags="|discussion|king-of-the-hill|" AnswerCount="1" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="13892" PostTypeId="2" ParentId="13891" CreationDate="2017-09-09T16:25:00.057" Score="4" Body="&lt;p&gt;Here are all the questions tagged king-of-the-hill and javascript:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill+javascript&quot;&gt;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill+javascript&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="46313" LastActivityDate="2017-09-09T16:25:00.057" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13893" PostTypeId="2" ParentId="2140" CreationDate="2017-09-09T17:33:17.390" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regex&amp;#39;&quot; rel=&quot;tag&quot;&gt;regex&lt;/a&gt; [tag:H̸̡̪̯ͨ͊̽̅̾̎Ȩ̬̩̾͛ͪ̈́̀́͘ ̶̧̨̱̹̭̯ͧ̾ͬC̷̙̲̝͖ͭ̏ͥͮ͟Oͮ͏̮̪̝͍M̲̖͊̒ͪͩͬ̚̚͜Ȇ̴̟̟͙̞ͩ͌͝S̨̥̫͎̭ͯ̿̔̀ͅ]&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Parse HTML with regex!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Alternate titles:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;https://stackoverflow.com/q/1732348/6560716&quot;&gt;RegEx match open tags except XHTML self-contained tags&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;H̸̡̪̯ͨ͊̽̅̾̎Ȩ̬̩̾͛ͪ̈́̀́͘ ̶̧̨̱̹̭̯ͧ̾ͬC̷̙̲̝͖ͭ̏ͥͮ͟Oͮ͏̮̪̝͍M̲̖͊̒ͪͩͬ̚̚͜Ȇ̴̟̟͙̞ͩ͌͝S̨̥̫͎̭ͯ̿̔̀ͅ - Parse HTML with regex&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Background&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://stackoverflow.com/a/1732454/6560716&quot;&gt;Don't parse HTML with regex.&lt;/a&gt;&lt;/strong&gt; It always fails and sometimes summons Cthulhu.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But, because PPCG is different, we will parse HTML with regex.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;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?&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;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.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;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.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are not allowed to use regex features to execute language code. (&lt;a href=&quot;https://perldoc.perl.org/perlretut.html#A-bit-of-magic%3a-executing-Perl-code-in-a-regular-expression&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sorry, Perl&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The length of your regex is irrelevant, this is not code golf.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Here are the test cases. You can also find them at &lt;a href=&quot;https://hastebin.com/raw/mikaxakipe.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://hastebin.com/raw/mikaxakipe.txt&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1,1,&amp;lt;b&amp;gt;HTML!&amp;lt;/b&amp;gt;,&amp;lt;b&amp;gt;,&amp;lt;/b&amp;gt;&#xA;2,1,&amp;lt;i&amp;gt;&amp;lt;b&amp;gt;HTML&amp;lt;/b&amp;gt;&amp;lt;/i&amp;gt;,&amp;lt;i&amp;gt;,&amp;lt;b&amp;gt;,&amp;lt;/b&amp;gt;,&amp;lt;/i&amp;gt;&#xA;3,1,a &amp;lt; b implies b &amp;gt; a,&#xA;4,2,&amp;lt;img alt=text&amp;gt;Img,&amp;lt;img alt=text&amp;gt;&#xA;5,2,&amp;lt;a href = &quot;http://example.com&quot;&amp;gt;Example Domain&amp;lt;/a&amp;gt;,&amp;lt;a href = &quot;http://example.com&quot;&amp;gt;,&amp;lt;/a&amp;gt;&#xA;6,2,&amp;lt;hr&amp;gt;&amp;lt;br/&amp;gt;,&amp;lt;hr&amp;gt;,&amp;lt;br/&amp;gt;&#xA;7,2,&amp;lt;div id =&quot;hi&quot; class=&quot;what&quot;&amp;gt;What&amp;lt;/div&amp;gt;,&amp;lt;div id =&quot;hi&quot; class=&quot;what&quot;&amp;gt;,&amp;lt;/div&amp;gt;&#xA;8,3,&amp;lt;a&amp;gt;fake&amp;lt;/&amp;gt;,&amp;lt;a&amp;gt;&#xA;9,3,Self-closing &amp;lt;img src = &quot;self-closing.jpeg&quot; /&amp;gt;?,&amp;lt;img src = &quot;self-closing.jpeg&quot; /&amp;gt;&#xA;10,3,&amp;lt;self-closed/&amp;gt;O_O&amp;lt;unclosed&amp;gt;,&amp;lt;self-closed/&amp;gt;,&amp;lt;unclosed&amp;gt;&#xA;11,3,Do&amp;lt;yOU&amp;gt;like&amp;lt;LoTs&amp;gt;of&amp;lt;mIXeD&amp;gt;&amp;lt;cAsE&amp;gt;?,&amp;lt;yOU&amp;gt;,&amp;lt;LoTs&amp;gt;,&amp;lt;mIXeD&amp;gt;,&amp;lt;cAsE&amp;gt;&#xA;12,3,Wh&amp;lt;a b='c'd=&quot;e&quot;&amp;gt;at?,&amp;lt;a b='c'd=&quot;e&quot;&amp;gt;&#xA;13,3,Hi&amp;lt;p data-hi=3&amp;gt;hihihi&amp;lt;/p&amp;gt;,&amp;lt;p data-hi=3&amp;gt;,&amp;lt;/p&amp;gt;&#xA;14,4,&amp;lt;a&quot;oops&quot;&amp;gt;Oops,&#xA;15,5,&amp;lt;!-- &amp;lt;b&amp;gt;&amp;lt;!--hi--&amp;gt;&amp;lt;i&amp;gt;,&amp;lt;i&amp;gt;&#xA;16,5,&amp;lt;0&amp;gt;NOT VALID&amp;lt;/0&amp;gt;&amp;lt;h0&amp;gt;fine&amp;lt;/h0&amp;gt;,&amp;lt;h0&amp;gt;,&amp;lt;h0&amp;gt;&#xA;17,5,&amp;lt;a a=b&amp;lt;&amp;gt;what&amp;lt;/a&amp;gt;,&amp;lt;a a=b&amp;lt;&amp;gt;,&amp;lt;/a&amp;gt;&#xA;18,6,&amp;lt;!-- &amp;lt;b&amp;gt;&amp;lt;!--hi--&amp;gt;&amp;lt;i&amp;gt;--&amp;gt;,&amp;lt;i&amp;gt;&#xA;19,7,&amp;lt;how&amp;gt;&amp;lt;deep can&amp;gt;&amp;lt;your nesting nesting&amp;gt;&amp;lt;level&amp;gt;&amp;lt;/level&amp;gt;&amp;lt;/go&amp;gt;?&amp;lt;how&amp;gt;Deep&amp;lt;/how&amp;gt;&amp;lt;can&amp;gt;&amp;lt;your&amp;gt;nesting &amp;lt;go x=? j&amp;gt;&amp;lt;how&amp;gt;&amp;lt;deep can&amp;gt;&amp;lt;your nesting nesting&amp;gt;&amp;lt;level&amp;gt;&amp;lt;/level&amp;gt;&amp;lt;/go&amp;gt;?&amp;lt;how&amp;gt;Deep&amp;lt;/how&amp;gt;&amp;lt;can&amp;gt;&amp;lt;your&amp;gt;nesting &amp;lt;go x=? j&amp;gt;&amp;lt;how&amp;gt;&amp;lt;deep can&amp;gt;&amp;lt;your nesting nesting&amp;gt;&amp;lt;level&amp;gt;&amp;lt;/level&amp;gt;&amp;lt;/go&amp;gt;?&amp;lt;how&amp;gt;Deep&amp;lt;/how&amp;gt;&amp;lt;can&amp;gt;&amp;lt;your&amp;gt;nesting &amp;lt;go x=? j&amp;gt;&amp;lt;/your&amp;gt;&amp;lt;/can&amp;gt;&amp;lt;/your&amp;gt;&amp;lt;/deep&amp;gt;&amp;lt;/how&amp;gt;&amp;lt;/your&amp;gt;&amp;lt;/can&amp;gt;&amp;lt;/your&amp;gt;&amp;lt;/deep&amp;gt;&amp;lt;/how&amp;gt;&amp;lt;/your&amp;gt;&amp;lt;/can&amp;gt;&amp;lt;/your&amp;gt;&amp;lt;/deep&amp;gt;&amp;lt;/how&amp;gt;,&amp;lt;how&amp;gt;,&amp;lt;deep can&amp;gt;,&amp;lt;your nesting nesting&amp;gt;,&amp;lt;level&amp;gt;,&amp;lt;/level&amp;gt;,&amp;lt;/go&amp;gt;,&amp;lt;how&amp;gt;,&amp;lt;/how&amp;gt;,&amp;lt;can&amp;gt;,&amp;lt;your&amp;gt;,&amp;lt;go x=? j&amp;gt;,&amp;lt;how&amp;gt;,&amp;lt;deep can&amp;gt;,&amp;lt;your nesting nesting&amp;gt;,&amp;lt;level&amp;gt;,&amp;lt;/level&amp;gt;,&amp;lt;/go&amp;gt;,&amp;lt;how&amp;gt;,&amp;lt;/how&amp;gt;,&amp;lt;can&amp;gt;,&amp;lt;your&amp;gt;,&amp;lt;go x=? j&amp;gt;,&amp;lt;how&amp;gt;,&amp;lt;deep can&amp;gt;,&amp;lt;your nesting nesting&amp;gt;,&amp;lt;level&amp;gt;,&amp;lt;/level&amp;gt;,&amp;lt;/go&amp;gt;,&amp;lt;how&amp;gt;,&amp;lt;/how&amp;gt;,&amp;lt;can&amp;gt;,&amp;lt;your&amp;gt;,&amp;lt;go x=? j&amp;gt;,&amp;lt;/your&amp;gt;,&amp;lt;/can&amp;gt;,&amp;lt;/your&amp;gt;,&amp;lt;/deep&amp;gt;,&amp;lt;/how&amp;gt;,&amp;lt;/your&amp;gt;,&amp;lt;/can&amp;gt;,&amp;lt;/your&amp;gt;,&amp;lt;/deep&amp;gt;,&amp;lt;/how&amp;gt;,&amp;lt;/your&amp;gt;,&amp;lt;/can&amp;gt;,&amp;lt;/your&amp;gt;,&amp;lt;/deep&amp;gt;,&amp;lt;/how&amp;gt;&#xA;20,7,&amp;lt;plaintext&amp;gt;&amp;lt;b&amp;gt;&amp;lt;/plaintext&amp;gt;,&amp;lt;plaintext&amp;gt;,&amp;lt;/plaintext&amp;gt;&#xA;21,7,What&amp;lt;img src=&quot;imgs/&amp;gt;lolz.png&quot; alt = &quot;&amp;lt;heh&quot;/&amp;gt;,&amp;lt;img src=&quot;imgs/&amp;gt;lolz.png&quot; alt = &quot;&amp;lt;heh&quot;/&amp;gt;&#xA;22,7,&amp;lt;b&amp;gt;&amp;lt;a href = &quot;#&quot; title = &quot;4 &amp;gt; 3&quot;&amp;gt;hi&amp;lt;/a&amp;gt;&amp;lt;/b&amp;gt;,&amp;lt;b&amp;gt;,&amp;lt;a href = &quot;#&quot; title = &quot;4 &amp;gt; 3&quot;&amp;gt;,&amp;lt;/a&amp;gt;,&amp;lt;/b&amp;gt;&#xA;23,10,&amp;lt;StYle&amp;gt;&amp;lt;b title = &quot;not in html&quot;&amp;gt;&amp;lt;/style&amp;gt;&amp;lt;B&amp;gt;HTML!&amp;lt;/b&amp;gt;&amp;lt;style&amp;gt;&amp;lt;/style&amp;gt;,&amp;lt;StYle&amp;gt;,&amp;lt;/style&amp;gt;,&amp;lt;B&amp;gt;,&amp;lt;/b&amp;gt;,&amp;lt;style&amp;gt;&amp;lt;/style&amp;gt;&#xA;24,10,&amp;lt;script&amp;gt;//&amp;lt;script&amp;gt;&amp;lt; /script&amp;gt;&amp;lt;/script&amp;gt;&amp;lt;script&amp;gt;&amp;lt;/script&amp;gt;&amp;lt;p&amp;gt;,&amp;lt;script&amp;gt;,&amp;lt;/script&amp;gt;,&amp;lt;script&amp;gt;,&amp;lt;/script&amp;gt;,&amp;lt;p&amp;gt;&#xA;25,10,&amp;lt;i&amp;gt;&amp;lt;/i this=&quot;will be removed by a browser&quot;&amp;gt;,&amp;lt;i&amp;gt;,&amp;lt;/i this=&quot;will be removed by a browser&quot;&amp;gt;&#xA;26,10,&amp;lt;div id=&quot;hi&quot; class=class=&quot;what&quot; data-the=&quot;heck='is'this&quot; get-good&amp;gt;Attributes are weird&amp;lt;div&amp;gt;,&amp;lt;div id=&quot;hi&quot; class=class=&quot;what&quot; data-the=&quot;heck='is'this&quot;&amp;gt;,&amp;lt;div&amp;gt;&#xA;27,10,&amp;lt;!--&amp;lt;b&amp;gt;Do you like comments??&amp;lt;/b&amp;gt;--&amp;gt;&amp;lt;p&amp;gt;,&amp;lt;p&amp;gt;&#xA;28,13,&amp;lt;textarea&amp;gt;&amp;lt;script&amp;gt;/* *////*///*&amp;lt;!--&amp;lt;/script&amp;gt;&amp;lt;b&amp;gt;WHAT&amp;lt;/b&amp;gt;&amp;lt;/textarea&amp;gt;&amp;lt;i&amp;gt;Hi--&amp;gt;,&amp;lt;textarea&amp;gt;,&amp;lt;/textarea&amp;gt;,&amp;lt;i&amp;gt;&#xA;29,15,&amp;lt;!--&amp;lt;b&amp;gt;Do you like comments??&amp;lt;/b&amp;gt;&amp;lt;script&amp;gt;--&amp;gt;&amp;lt;script&amp;gt;//&amp;lt;!--hello&amp;lt;/script&amp;gt;&amp;lt;b&amp;gt;hi&amp;lt;/b&amp;gt;&amp;lt;!--What--&amp;gt;&amp;lt;script&amp;gt;//&amp;lt;!-- &amp;lt;script&amp;gt; &amp;lt;!-- &amp;lt;script&amp;gt; --&amp;gt; &amp;lt;/script&amp;gt;&amp;lt;i&amp;gt;hello--&amp;gt;&amp;lt;script&amp;gt;&amp;lt;/script&amp;gt;,&amp;lt;b&amp;gt;,&amp;lt;/b&amp;gt;,&amp;lt;script&amp;gt;,&amp;lt;/script&amp;gt;,&amp;lt;i&amp;gt;,&amp;lt;script&amp;gt;,&amp;lt;/script&amp;gt;&#xA;30,15,&amp;lt;hi&amp;gt;hi&amp;lt;/hi&amp;gt;&amp;lt;0&amp;gt;hi&amp;lt;/0&amp;gt;&amp;lt;h0&amp;gt;hi&amp;lt;/h0&amp;gt;&amp;lt;h&amp;amp;&amp;gt;hi&amp;lt;/h&amp;amp;&amp;gt;&amp;lt;&amp;amp;&amp;gt;hi&amp;lt;/&amp;amp;&amp;gt;&amp;lt;??&amp;gt;hi&amp;lt;/??&amp;gt;&amp;lt;?php&amp;gt;hi&amp;lt;/?php&amp;gt;&amp;lt;php?&amp;gt;hi&amp;lt;/php?&amp;gt;&amp;lt;-&amp;gt;hi&amp;lt;/-&amp;gt;&amp;lt;_-_&amp;gt;hi&amp;lt;/_-_&amp;gt;&amp;lt;h-&amp;gt;hi&amp;lt;/h-&amp;gt;&amp;lt;_&amp;gt;hi&amp;lt;/_&amp;gt;&amp;lt;h-_&amp;gt;hi&amp;lt;/h-_&amp;gt;&amp;lt;?&amp;gt;hi&amp;lt;/?&amp;gt;&amp;lt;{&amp;gt;hi&amp;lt;/{&amp;gt;&amp;lt;h{&amp;gt;hi&amp;lt;/h{&amp;gt;&amp;lt;/&amp;gt;hi&amp;lt;//&amp;gt;&amp;lt;h~!@#$%^&amp;amp;*()&amp;gt;hi&amp;lt;/h~!@#$%^&amp;amp;*()&amp;gt;&amp;lt;h&amp;gt;hi&amp;lt;/h&amp;gt;&amp;lt;h~&amp;gt;hi&amp;lt;/h~&amp;gt;&amp;lt;h!&amp;gt;hi&amp;lt;/h!&amp;gt;&amp;lt;@&amp;gt;hi&amp;lt;/@&amp;gt;&amp;lt;h@&amp;gt;hi&amp;lt;/h@&amp;gt;&amp;lt;h!@#$%^&amp;amp;*()&amp;gt;hi&amp;lt;/h!@#$%^&amp;amp;*()&amp;gt;&amp;lt;@f&amp;gt;hi&amp;lt;/@f&amp;gt;&amp;lt;%&amp;gt;hi&amp;lt;/%&amp;gt;&amp;lt;;&amp;gt;hi&amp;lt;/;&amp;gt;&amp;lt;h&amp;gt;&amp;gt;hi&amp;lt;/h&amp;gt;&amp;gt;&amp;lt;h&amp;amp;&amp;gt;hi&amp;lt;/h&amp;amp;&amp;gt;&amp;lt;h~&amp;gt;hi&amp;lt;/h~&amp;gt;,&amp;lt;hi&amp;gt;,&amp;lt;/hi&amp;gt;,&amp;lt;h0&amp;gt;,&amp;lt;/h0&amp;gt;,&amp;lt;H&amp;amp;&amp;gt;,&amp;lt;/H&amp;amp;&amp;gt;,&amp;lt;PHP?&amp;gt;,&amp;lt;/PHP?&amp;gt;,&amp;lt;h-&amp;gt;,&amp;lt;/h-&amp;gt;,&amp;lt;H-_&amp;gt;,&amp;lt;/H-_&amp;gt;,&amp;lt;H{&amp;gt;,&amp;lt;/H{&amp;gt;,&amp;lt;H~!@#$%^&amp;amp;*()&amp;gt;,&amp;lt;/H~!@#$%^&amp;amp;*()&amp;gt;,&amp;lt;H&amp;gt;,&amp;lt;/H&amp;gt;,&amp;lt;H~&amp;gt;,&amp;lt;/H~&amp;gt;,&amp;lt;H!&amp;gt;,&amp;lt;/H!&amp;gt;,&amp;lt;h@&amp;gt;,&amp;lt;/h@&amp;gt;,&amp;lt;h!@#$%^&amp;amp;*()&amp;gt;,&amp;lt;/h!@#$%^&amp;amp;*()&amp;gt;,&amp;lt;H&amp;gt;,&amp;lt;/H&amp;gt;,&amp;lt;H&amp;amp;&amp;gt;,&amp;lt;/H&amp;amp;&amp;gt;,&amp;lt;h~&amp;gt;,&amp;lt;/h~&amp;gt;&#xA;31,30,&amp;lt;hi&amp;gt;hi&amp;lt;/hi&amp;gt;&amp;lt;0 WHAT_is=HtMl&amp;gt;hi&amp;amp;&amp;lt;i attrubute=&quot;oops'&amp;gt;&amp;lt;/0&amp;gt;&amp;lt;h0 attRiBu350Te=&quot;&amp;lt;b&amp;gt;oops&amp;lt;/b&amp;gt;&amp;lt;style&amp;gt;/*&quot;&amp;gt;hi&amp;lt;/h0&amp;gt;*/&amp;lt;h&amp;amp;&amp;gt;hi&amp;lt;/h&amp;amp;&amp;gt;&amp;lt;&amp;amp;&amp;gt;hi&amp;lt;/&amp;amp;&amp;gt;&amp;lt;??&amp;gt;hi&amp;lt;/??&amp;gt;&amp;lt;?php&amp;gt;hi&amp;lt;/?php&amp;gt;&amp;lt;php?&amp;gt;hi&amp;lt;/php?&amp;gt;&amp;lt;-&amp;gt;hi&amp;lt;/-&amp;gt;&amp;lt;_-_&amp;gt;hi&amp;lt;/_-_&amp;gt;&amp;lt;h-&amp;gt;hi&amp;lt;/h-&amp;gt;&amp;lt;_&amp;gt;hi&amp;lt;/_&amp;gt;&amp;lt;h-_&amp;gt;hi&amp;lt;/h-_&amp;gt;&amp;lt;?&amp;gt;hi&amp;lt;/?&amp;gt;&amp;lt;{&amp;gt;hi&amp;lt;/{&amp;gt;&amp;lt;h{&amp;gt;hi&amp;lt;/h{&amp;gt;&amp;lt;/&amp;gt;hi&amp;amp;&amp;lt;//&amp;gt;&amp;lt;script&amp;gt;     &amp;amp;/*&amp;lt;h~!@#$%^&amp;amp;*()&amp;gt;*/&amp;lt;/ script&amp;gt;&amp;lt;/StyLe&amp;gt;/*&amp;lt;/ScrIPT&amp;gt;/*&amp;lt;b&amp;gt;oops&amp;lt;/b&amp;gt;hi&amp;lt;/h~!@#$%^&amp;amp;*()&amp;gt;&amp;lt;h&amp;gt;hi&amp;lt;/h&amp;gt;&amp;lt;h~&amp;gt;hi&amp;lt;/h~&amp;gt;&amp;lt;h!&amp;gt;hi&amp;lt;/h!&amp;gt;&amp;lt;@&amp;gt;hi&amp;lt;/@&amp;gt;&amp;lt;h@&amp;gt;hi&amp;lt;/h@&amp;gt;&amp;lt;h!@#$%^&amp;amp;*()&amp;gt;hi&amp;lt;/h!@#$%^&amp;amp;*()&amp;gt;&amp;lt;@f&amp;gt;hi&amp;lt;/@f&amp;gt;&amp;lt;%&amp;gt;hi&amp;lt;/%&amp;gt;&amp;lt;;&amp;gt;hi&amp;lt;/;&amp;gt;&amp;lt;h&amp;gt;&amp;gt;hi&amp;lt;/h&amp;gt;&amp;gt;&amp;lt;h&amp;amp;&amp;gt;hi&amp;amp;&amp;lt;/h&amp;amp;&amp;gt;&amp;lt;h~&amp;gt;hi/*/&amp;lt;/h~&amp;gt;&amp;lt;b&amp;gt;oops&amp;lt;/b&amp;gt;hi&amp;lt;/h~!@#$%^&amp;amp;*()&amp;gt;&amp;lt;h&amp;gt;hi&amp;lt;/h&amp;gt;&amp;lt;h~&amp;gt;hi&amp;lt;/h~&amp;gt;&amp;lt;h!&amp;gt;hi&amp;lt;/h!&amp;gt;&amp;lt;@&amp;gt;hi&amp;lt;/@&amp;gt;&amp;lt;h@&amp;gt;hi&amp;lt;/h@&amp;gt;&amp;lt;h!@#$%^&amp;amp;*()&amp;gt;hi&amp;lt;/h!@#$%^&amp;amp;*()&amp;gt;&amp;lt;@f&amp;gt;hi&amp;lt;/@f&amp;gt;&amp;lt;%&amp;gt;hi&amp;lt;/%&amp;gt;&amp;lt;;&amp;gt;hi&amp;lt;/;&amp;gt;&amp;lt;h&amp;gt;&amp;gt;hi&amp;lt;/h&amp;gt;&amp;gt;&amp;lt;h&amp;amp;&amp;gt;hi&amp;amp;&amp;lt;/h&amp;amp;&amp;gt;&amp;lt;h~&amp;gt;hi/&amp;lt;script&amp;gt;&amp;lt;/StyLe&amp;gt;&amp;lt;/ScrIPT&amp;gt;&amp;lt;textarea&amp;gt;&amp;lt;b&amp;gt;HE COMES&amp;lt;/b&amp;gt;&amp;lt;/textarea&amp;gt;&amp;lt;h!&amp;gt;hi&amp;lt;/h!&amp;gt;&amp;lt;@&amp;gt;hi&amp;lt;/@&amp;gt;&amp;lt;h@&amp;gt;hi&amp;lt;/h@&amp;gt;&amp;lt;h!@#$%^&amp;amp;*()&amp;gt;hi&amp;lt;/h!@#$%^&amp;amp;*()&amp;gt;&amp;lt;@f&amp;gt;hi&amp;lt;/@f&amp;gt;&amp;lt;%&amp;gt;hi&amp;lt;/%&amp;gt;&amp;lt;;&amp;gt;hi&amp;lt;/;&amp;gt;&amp;lt;h&amp;gt;&amp;gt;hi&amp;lt;/h&amp;gt;&amp;gt;&amp;lt;h&amp;amp;&amp;gt;hi&amp;amp;&amp;lt;/h&amp;amp;&amp;gt;&amp;lt;h~&amp;gt;hi&amp;lt;/h~&amp;gt;,&amp;lt;hi&amp;gt;,&amp;lt;/hi&amp;gt;,&amp;lt;i attrubute=&quot;oops'&amp;gt;&amp;lt;/0&amp;gt;&amp;lt;h0 attRiBu350Te=&quot;&amp;lt;b&amp;gt;,&amp;lt;style&amp;gt;,&amp;lt;/style&amp;gt;,&amp;lt;textarea&amp;gt;,&amp;lt;/textarea&amp;gt;,&amp;lt;h!&amp;gt;,&amp;lt;/h!&amp;gt;,&amp;lt;h@&amp;gt;,&amp;lt;/h@&amp;gt;,&amp;lt;h!@#$%^&amp;amp;*()&amp;gt;,&amp;lt;/h!@#$%^&amp;amp;*()&amp;gt;,&amp;lt;h&amp;amp;&amp;gt;,&amp;lt;/h&amp;amp;&amp;gt;,&amp;lt;h~&amp;gt;&amp;lt;/h~&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Each line is a separate test case. They are in this format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1,1,&amp;lt;b&amp;gt;HTML!&amp;lt;/b&amp;gt;,&amp;lt;b&amp;gt;,&amp;lt;/b&amp;gt;&#xA;| | |            |   |&#xA;| | |            +---+- The correct output: all HTML tags in the string separated by commas&#xA;| | +- The HTML for you to parse&#xA;| +- The number of points you get if you parse this HTML correctly&#xA;+- The test case number&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let's say we have the regex &lt;a href=&quot;https://output.jsbin.com/bagaxepove#%3C.*%3F%3E&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;/&amp;lt;.*?&amp;gt;/g&lt;/code&gt;&lt;/a&gt; (all flavors). For test case #1, it matches 2 times: &lt;code&gt;&amp;lt;b&amp;gt;&lt;/code&gt;, and &lt;code&gt;&amp;lt;/b&amp;gt;&lt;/code&gt;. The correct output in the test case says that it should match &lt;code&gt;&amp;lt;b&amp;gt;&lt;/code&gt; and &lt;code&gt;&amp;lt;/b&amp;gt;&lt;/code&gt;, so it is correct. Our regex gets 1 point. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then for test case #2. Our regex matches &lt;code&gt;&amp;lt;i&amp;gt;&lt;/code&gt;, &lt;code&gt;&amp;lt;b&amp;gt;&lt;/code&gt;, &lt;code&gt;&amp;lt;/b&amp;gt;&lt;/code&gt;, and &lt;code&gt;&amp;lt;/i&amp;gt;&lt;/code&gt;,  which is consistent with the test case so we get 1 point.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now for test case #3. Our regex matches &lt;code&gt;&amp;lt; b implies b &amp;gt;&lt;/code&gt;, when it should have not matched anything. We get 0 points for that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Continuing for each test case gets us a score of 50 (out of 207, or 24.15%). Not great. Can you do better?&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Try It Online&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If your regex will work with the ECMAScipt / JS flavor than you can try it &lt;a href=&quot;http://output.jsbin.com/wacebab&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; and get automatic scoring!&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Tie breaker&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;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.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Most points&lt;/li&gt;&#xA;&lt;li&gt;Shortest length&lt;/li&gt;&#xA;&lt;li&gt;First posted&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Answer format&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;[insert score here] / 207 points&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[insert regex here]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;Explanation (optional but encouraged)&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Proof of score (matched output vs. test cases, link to TIO to try it,&#xA;  etc.)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Dupe? (&lt;a href=&quot;https://codegolf.stackexchange.com/search?q=is%3Aq+%5Bregular-expression%5D+html&quot;&gt;I don't think so&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user58826" LastEditorDisplayName="user58826" LastEditDate="2017-09-11T21:09:25.820" LastActivityDate="2017-09-11T21:09:25.820" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13898" PostTypeId="1" AcceptedAnswerId="13900" CreationDate="2017-09-10T02:54:35.867" Score="1" ViewCount="89" Body="&lt;p&gt;Working on my &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/13690#13690&quot;&gt;latest challenge&lt;/a&gt;, I realized that I don't know what is the optimal way of providing/formatting the test cases. So the question is, what is the best way for a challenger to provide test cases for a challenge?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider that&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the formatting should be such that if people simply copy and paste the test-case-code-block, it needs minimal handling to be used and tested.&lt;/li&gt;&#xA;&lt;li&gt;it should be easy to work with as many languages as possible.&lt;/li&gt;&#xA;&lt;li&gt;the format should be easy for humans reading the actual post on PPCG.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;How can the total ease be maximized? Should the test cases be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;n=3 -&amp;gt; T=1&#xA;n=4 -&amp;gt; T=8&#xA;n=5 -&amp;gt; T=35&#xA;n=6 -&amp;gt; T=110&#xA;n=7 -&amp;gt; T=287&#xA;n=8 -&amp;gt; T=632&#xA;n=9 -&amp;gt; T=1302&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;with little arrows in between? Or should they be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;n=3, T=1&#xA;n=4, T=8&#xA;n=5, T=35&#xA;n=6, T=110&#xA;n=7, T=287&#xA;n=8, T=632&#xA;n=9, T=1302&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;comma separated? Or should I remove all unnecessary characters and only provide a numeric array delimited by commas, tab, space, or something like this?&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3,1&#xA;4,8&#xA;5,35&#xA;6,110&#xA;7,287&#xA;8,632&#xA;9,1302&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or something else entirely?&lt;/p&gt;&#xA;" OwnerUserId="7727" LastActivityDate="2017-09-10T08:56:25.780" Title="What exactly should be the format for the test cases?" Tags="|discussion|asking-questions|" AnswerCount="1" CommentCount="4" ClosedDate="2017-09-11T03:37:34.800" ContentLicense="CC BY-SA 3.0" />
  <row Id="13899" PostTypeId="2" ParentId="2140" CreationDate="2017-09-10T07:45:32.653" Score="1" Body="&lt;h1&gt;Pythagorean Double Regex&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regex&amp;#39;&quot; rel=&quot;tag&quot;&gt;regex&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/message/39913942#39913942&quot;&gt;Posted&lt;/a&gt; by &lt;a href=&quot;https://chat.stackexchange.com/users/255519/nh&quot;&gt;NH.&lt;/a&gt; in &lt;a href=&quot;https://chat.stackexchange.com/rooms/63829/zendo&quot;&gt;Zendo&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;though depending on the regex flavor, things like that pythagorean triple could be hard to do.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The rule in question was:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Given a pair of numbers, match if the two numbers are part of some integral Pythagorean triple, else don't match.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a pair of positive integers, write a regex that matches if and only if the pair of integers are part of a Pythagorean triple - i.e. if the two integers are &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt;, either &lt;code&gt;a&lt;sup&gt;2&lt;/sup&gt;+b&lt;sup&gt;2&lt;/sup&gt;&lt;/code&gt; is a perfect square or &lt;code&gt;|a&lt;sup&gt;2&lt;/sup&gt;-b&lt;sup&gt;2&lt;/sup&gt;|&lt;/code&gt; is. (Note: &lt;code&gt;x,x&lt;/code&gt; should match, even though &lt;code&gt;0,x,x&lt;/code&gt; is not a true Pythagorean triple)&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Integers represented in any base, separated by a character not used in the representation of that base&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;&lt;sup&gt;NB: All but one of these test cases were taken from the game of Zendo from which the rule came, so they may not test boundary cases of the rule&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;True:&#xA;3,4&#xA;4,3&#xA;30,40&#xA;16,12&#xA;20,21&#xA;21,20&#xA;4,5&#xA;40,50&#xA;24,25&#xA;&lt;b&gt;7,7&lt;/b&gt;&#xA;&#xA;False:&#xA;1,2&#xA;5,6&#xA;7,8&#xA;4,10&#xA;9,10&#xA;3,100&#xA;9,16&#xA;24,20&#xA;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest regex in bytes wins!&lt;/p&gt;&#xA;" OwnerUserId="60483" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-11T09:07:14.690" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13900" PostTypeId="2" ParentId="13898" CreationDate="2017-09-10T08:56:25.780" Score="2" Body="&lt;h1&gt;It pretty much depends on the challenge&lt;/h1&gt;&#xA;&lt;h3&gt;Math-related challenges&lt;/h3&gt;&#xA;&lt;p&gt;For math-related challenges, with small amounts of text for both input and output (i.e. numbers), I usually delimit them with an &lt;strong&gt;ASCII&lt;/strong&gt; arrow (&lt;code&gt;-&amp;gt;&lt;/code&gt;), and put a header at the top showing what values I am working with (like &lt;code&gt;Input -&amp;gt; Output&lt;/code&gt;):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;n -&amp;gt; T&#xA;&#xA;3 -&amp;gt; 1&#xA;4 -&amp;gt; 8&#xA;5 -&amp;gt; 35&#xA;6 -&amp;gt; 110&#xA;7 -&amp;gt; 287&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;However, if the challenge involves negative numbers as well, I would substitute &lt;code&gt;-&amp;gt;&lt;/code&gt; with &lt;code&gt;=&amp;gt;&lt;/code&gt;, to avoid confusion.&lt;/p&gt;&#xA;&lt;h3&gt;String-related challenges with input (and output) of variable size&lt;/h3&gt;&#xA;&lt;p&gt;When I deal with strings (or numbers with variable number of digits), I use the same format but align the arrows and  use wide spacing*. For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input -&amp;gt; Output &#xA;&#xA;abc          -&amp;gt; 3&#xA;abcde        -&amp;gt; 5&#xA;ppcg         -&amp;gt; 4&#xA;codegolf.SE  -&amp;gt; 11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;sub&gt;*In my opinion this is the best compromise between ease of use and human readability.&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;h3&gt;ASCII-Art challenges&lt;/h3&gt;&#xA;&lt;p&gt;When the output contains multiple lines, you can have the input and output separated by newlines. Some examples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input&#xA;Output&#xA;&#xA;&#xA;3&#xA;+---+&#xA;|   |&#xA;+---+&#xA;&#xA;4&#xA;+----+&#xA;|    |&#xA;|    |&#xA;+----+&#xA;&#xA;.....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;As a reference, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges/8101#8101&quot;&gt;this answer&lt;/a&gt; is very on-topic in this case.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-10T08:56:25.780" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13902" PostTypeId="2" ParentId="13881" CreationDate="2017-09-10T12:53:52.357" Score="4" Body="&lt;p&gt;The point of standard loopholes is to cover unacceptable behavior that is broadly applicable across the site. They prevent undesirable solutions to reasonably-specified challenges, by disallowing things that are unacceptable across the entire site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The sort of loophole abuse in the linked answer is a consequence of the challenge allowing flexible input with little or no restrictions. In that circumstance, it is the fault of the author for that loophole existing, and thus it is the responsibility of the author to close the loophole when writing the challenge. Trying to create a broad rule for the site based off of this one incident would result in failure - any &quot;solution&quot; would be either overreaching (&quot;can't use part of the output in the input&quot; - oops, can't use 1 and 0 as boolean inputs in a numeric output challenge) or insufficient (&quot;can't use strings of the output at least &lt;code&gt;X&lt;/code&gt; bytes long as input&quot; - &lt;code&gt;(X-1)&lt;/code&gt;-length strings would surely also be problematic).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2017-09-10T23:17:18.623" LastActivityDate="2017-09-10T23:17:18.623" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13903" PostTypeId="2" ParentId="2140" CreationDate="2017-09-10T21:53:35.133" Score="0" Body="&lt;h1&gt;Collectables, Inc  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You're an aspiring collector.  &lt;strong&gt;You want to be the top collector for as many collections as possible&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's how you play (with &lt;code&gt;P&lt;/code&gt; players):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The game consists of multiple Auctions, and &lt;code&gt;2P&lt;/code&gt; collections.  &lt;strong&gt;Some collections are bigger than others&lt;/strong&gt;.  Smaller collections are more valuable and rare, bigger collections are cheaper.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each Auction puts &lt;code&gt;2P&lt;/code&gt; random items up for sale&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You place a bid on each item, grouped by collection.  (e.g. If doll was a collection, you place a single bid for all of the dolls in the current Auction)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You win by having the most pieces for the most collections.  (Each collection is worth 1 point.  If you have the plurality of that collection, you gain that point).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Fine Details:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Players start with 30 gold.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each collection contains a different number of items, from &lt;code&gt;2&lt;/code&gt; to &lt;code&gt;2P+1&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There are &lt;code&gt;2P+3&lt;/code&gt; auctions (until all items are sold)  &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Players can bid on multiple items, and their total bid can exceed their current gold.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Resolution of bids happens as follows:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;All invalid bids are removed.  (Players without enough gold, or bids on items already sold).&lt;/li&gt;&#xA;&lt;li&gt;Find the top bid (by gold).  Tiebreaker is the collection size (smallest first).&lt;/li&gt;&#xA;&lt;li&gt;If there is still a tie, then that item group is removed.&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, the top bidder wins the item group.  His money is added to the pot.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;After an Auction is finished, the pot is evenly distributed among all players.  Any remainder is put back into the pot.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think that my rules are pretty complete.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is it clear?&lt;/li&gt;&#xA;&lt;li&gt;Is it interesting?&lt;/li&gt;&#xA;&lt;li&gt;How many reads did it take you to understand the post?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2018-01-29T16:27:06.737" LastActivityDate="2018-01-29T16:27:06.737" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13906" PostTypeId="2" ParentId="2140" CreationDate="2017-09-11T08:43:37.427" Score="1" Body="&lt;h1&gt;Determine the Resultant&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/abstract-algebra&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;abstract-algebra&amp;#39;&quot; rel=&quot;tag&quot;&gt;abstract-algebra&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polynomials&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polynomials&amp;#39;&quot; rel=&quot;tag&quot;&gt;polynomials&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;META:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'm not yet sure which one of the following two versions would be more interesting:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Version a&lt;/strong&gt;: Given two integral polynomials &lt;code&gt;P,Q&lt;/code&gt; determine their resultant &lt;code&gt;Res(P,Q)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Version b&lt;/strong&gt;: Given two monic integral polynomials &lt;code&gt;P,Q&lt;/code&gt; determine the polynomials &lt;code&gt;A,B&lt;/code&gt; such that &lt;code&gt;AP+BQ = Res(P,Q)&lt;/code&gt;. Where &lt;code&gt;deg A &amp;lt; deg Q&lt;/code&gt; and &lt;code&gt;deg B &amp;lt; deg P&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Definitions&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The resultant is defined as &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/7PQrD.png&quot; width=&quot;200&quot; /&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here the product iterates over all complex numbers pairs that are zeros of each polynomial. For integral polyonmials this is an integer. (One other way - and certainly not the only - is via the determinant given &lt;a href=&quot;https://en.wikipedia.org/wiki/Resultant#Definition&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.) The corresponding integral polynomials &lt;code&gt;A,B&lt;/code&gt; such that &lt;code&gt;AP+BQ = Res(P,Q)&lt;/code&gt; with &lt;code&gt;deg A &amp;lt; deg Q&lt;/code&gt; and &lt;code&gt;deg B &amp;lt; deg P&lt;/code&gt; are unique.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastActivityDate="2017-09-11T08:43:37.427" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13907" PostTypeId="2" ParentId="5243" CreationDate="2017-09-11T14:09:08.270" Score="3" Body="&lt;h2&gt;More unsuitable language bounties: 2 x 500&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Similar in spirit to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8219/42963&quot;&gt;lirtosiast's bounties&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;500 rep for an answer in &lt;a href=&quot;http://esolangs.org/wiki/Mornington_Crescent&quot; rel=&quot;nofollow noreferrer&quot;&gt;Mornington Crescent&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/142331/42963&quot;&gt;Somewhere On The Tube ...But On Which Lines?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;500 rep for an answer in &lt;a href=&quot;http://esolangs.org/wiki/Hexagony&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hexagony&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/87482/42963&quot;&gt;HexaRegex: A Tribute to Martin Ender&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42963" LastActivityDate="2017-09-11T14:09:08.270" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13908" PostTypeId="1" AcceptedAnswerId="24431" CreationDate="2017-09-11T17:47:49.800" Score="10" ViewCount="247" Body="&lt;p&gt;I have found myself asking a good deal of questions with a similar theme.  I enjoy asking questions in which answers are required to implement a function with a number of characteristics that are well defined but do not isolate a specific function that needs to be implemented.  I thought it might be a good idea to make a tag for such questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some examples of questions I have asked that would be tagged with the proposed tag:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/142055/fabricate-frequently-factored-functions&quot;&gt;Fabricate Frequently Factored Functions&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/141315/what-an-odd-function&quot;&gt;What an odd function&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/138887/implement-true-string-addition&quot;&gt;Implement True String Addition&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/135127/make-an-infinite-chain&quot;&gt;Make an Infinite Chain&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/138139/two-interwoven-chains&quot;&gt;Two Interwoven Chains&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Should we make this tag? Is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function-class&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function-class&amp;#39;&quot; rel=&quot;tag&quot;&gt;function-class&lt;/a&gt; a good name?  What other questions might be tagged with this tag?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2022-02-06T00:36:05.030" Title="Tag proposal [function-class]" Tags="|discussion|tags|" AnswerCount="3" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13909" PostTypeId="2" ParentId="2140" CreationDate="2017-09-11T18:17:38.037" Score="1" Body="&lt;h1&gt;Align the Words&lt;/h1&gt;&#xA;&lt;p&gt;Given a list of words &lt;code&gt;l&lt;/code&gt; output them as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Iterate through &lt;code&gt;l&lt;/code&gt;, if it's the first word, output it as usual.&lt;/li&gt;&#xA;&lt;li&gt;If it's not the first word, iterate through this nth word and:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Find the first letter of word &lt;code&gt;n&lt;/code&gt; that's in word &lt;code&gt;n-1&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Align the first occurrence of that letter in word &lt;code&gt;n&lt;/code&gt; with the first occurrence in word &lt;code&gt;n-1&lt;/code&gt; and print it on the next line.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Worked Example&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; &lt;code&gt;[ace,face,please,keep,sheeple]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1: ace&#xA;&#xA;2:  ace&#xA;   face&#xA;&#xA;3:  ace&#xA;   face&#xA;    please&#xA;&#xA;4:  ace&#xA;   face&#xA;    please&#xA;     keep&#xA;&#xA;5:  ace&#xA;   face&#xA;    please&#xA;     keep&#xA;    sheeple&#xA;&#xA;[Note: You only print step #5, the rest is to show the process.]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Lowest byte-count wins, this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;All consecutive words in the input list &lt;code&gt;l&lt;/code&gt; will have at least 1 letter in common.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the input is invalid, any return is fine (error, nothing, etc...)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;A word is defined here as a collection of &lt;code&gt;a-z&lt;/code&gt; (lowercase ONLY alpha characters).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-11T21:14:25.900" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13910" PostTypeId="2" ParentId="2140" CreationDate="2017-09-11T21:17:09.927" Score="0" Body="&lt;h1&gt;Matrix Decomposition&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Duplicate?&lt;/li&gt;&#xA;&lt;li&gt;What rules should I add?&lt;/li&gt;&#xA;&lt;li&gt;Are my explanations sufficient?&lt;/li&gt;&#xA;&lt;li&gt;Any room for improvement?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;It's possible to &quot;factor&quot; any invertible (a.k.a. non-singular) square matrix &lt;code&gt;A&lt;/code&gt; into a combination of a permutation matrix&lt;sup&gt;1&lt;/sup&gt; (&lt;code&gt;P&lt;/code&gt;), a unit&lt;sup&gt;3&lt;/sup&gt; lower triangular matrix&lt;sup&gt;2&lt;/sup&gt; (&lt;code&gt;L&lt;/code&gt;), a diagonal matrix&lt;sup&gt;4&lt;/sup&gt; (&lt;code&gt;D&lt;/code&gt;), and a unit upper triangular matrix&lt;sup&gt;2&lt;/sup&gt; (&lt;code&gt;U&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That is, &lt;code&gt;A = PLDU&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance, the matrix &lt;code&gt;[[4, 5], [2, 3]]&lt;/code&gt; can be expressed as the multiplication of the following matrices:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;P = [[0, 1],&#xA;     [1, 0]]&#xA;L = [[1, 0],&#xA;     [2, 1]]&#xA;D = [[2, 0 ],&#xA;     [0, -1]]&#xA;U = [[1, 3/2],&#xA;     [0, 1  ]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given an invertible square matrix &lt;code&gt;A&lt;/code&gt;, output &lt;code&gt;P&lt;/code&gt;, &lt;code&gt;L&lt;/code&gt;, &lt;code&gt;D&lt;/code&gt;, and &lt;code&gt;U&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;TBD&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any reasonable output format is acceptable, but &lt;code&gt;P&lt;/code&gt;, &lt;code&gt;L&lt;/code&gt;, &lt;code&gt;D&lt;/code&gt;, and &lt;code&gt;U&lt;/code&gt; must be separate outputs.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1. A permutation matrix is a permutation of the identity matrix.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;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. &lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;3. A unit triangular matrix is a triangular matrix whose main diagonal is all 1s.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;4. A diagonal matrix is a matrix whose nonzero values occur only on the main diagonal.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="60043" LastActivityDate="2017-09-11T21:17:09.927" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13911" PostTypeId="2" ParentId="2140" CreationDate="2017-09-11T21:48:27.920" Score="0" Body="&lt;h1&gt;Become a Word-Pontif&lt;/h1&gt;&#xA;&lt;p&gt;The french used to define the word &lt;code&gt;pontif&lt;/code&gt; as &lt;code&gt;one who builds bridges&lt;/code&gt; stemming from the conjunction of &lt;code&gt;pons, facere&lt;/code&gt; which literally translates to &lt;code&gt;a bridge, to create one&lt;/code&gt;. Your task will be, given a list of &lt;strong&gt;1 or more&lt;/strong&gt; lower-case words &lt;code&gt;l (String Array)&lt;/code&gt;, output the &lt;strong&gt;MAXIMUM&lt;/strong&gt; length of a bridge that can be built from these words.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Bridge Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bridges can be made by connecting two or more words together:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Words must be connected prefix-to-suffix or suffix-to-prefix.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;To join two words into one:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The suffix of the first must match the prefix of the second (&lt;code&gt;abc+cba=abcba&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;The prefix of the first must match the suffix of the second (&lt;code&gt;earl+toe=toearl&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;If a word's prefix/suffix contains more than one common character:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can only connect them with the maximal common substring.&lt;/li&gt;&#xA;&lt;li&gt;In other words,&lt;code&gt;abc&lt;/code&gt; and &lt;code&gt;bcdefg&lt;/code&gt; can be connected using &lt;code&gt;a[bc]defg&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The length of a bridge is simply the length of the conjoined words in characters.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Building Material Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The list will contain at fewest 1 word.&lt;/li&gt;&#xA;&lt;li&gt;The list may hold 0 links between words, in this case the maximal size is the longest word in the list.&lt;/li&gt;&#xA;&lt;li&gt;The list will not contain the empty string and will only use the lowercase alphabet (&lt;code&gt;a-z&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;The list MAY NOT contain duplicates.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example 1:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[abcdefgh,holographic,graphical,quine,loitering]&#xA;&#xA;abcdefholo[graphic]al = 19&#xA;&#xA;19&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example 2:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[noon,moon,loon,noon,groom]&#xA;&#xA;groo[m]oon&#xA;&#xA;8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example 3:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[spoon,whatifgodwereoneofus,oneofusisatraitor,aaaaaaaaaaaaaa,aaaaaaaaaa]&#xA;&#xA;whatifgodwere[oneofus]isatraitor (because the two aaaaa's overlap too much).&#xA;&#xA;30&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example 4:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[abc,def,ghi,jkl,mnop,qrst,uvwxyz]&#xA;&#xA;uvwxyz (No matches)&#xA;&#xA;6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example 5:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[xox,xxox,lol,lolol,lololol,xoxx]&#xA;&#xA;xo[xx]o[x]ox    &amp;lt; 8  (Maximal of the xox path)&#xA;[lol]o[l]ololol &amp;lt; 10 (Maximal of the lol path)&#xA;&#xA;10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example 6 (Base):&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[hi]&#xA;&#xA;hi&#xA;&#xA;2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example 7:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;# Note, when a link has been used it cannot be used twice.&#xA;# In other words, the brackets used cannot overlap in these examples.&#xA;[aa,aaa,aaaa] &#xA;&#xA;aa[aa][a]a (Chose to use aaaa,aaa,aa)&#xA;&#xA;7&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;General Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, lowest byte-count wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-11T22:55:37.490" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13913" PostTypeId="2" ParentId="2140" CreationDate="2017-09-12T15:51:08.467" Score="0" Body="&lt;h1&gt;Validating Words in Word Grids&lt;/h1&gt;&#xA;&lt;p&gt;A follow on from &lt;a href=&quot;https://codegolf.stackexchange.com/q/142531/9365&quot;&gt;Generating Word Grids&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a grid of letters, a set of co-ordinates and a dictionary of words, validate that the co-ordinates follow only cardinal direction changes, at least one of the co-ordinates touch an empty space in the centre of the grid, the resulting word is valid given the dictionary (taking into consideration any blank tiles) and return either the grid, with the letters at the co-ordinates removed along with the score of the word, or, if one of the conditions fail, the original grid and a score of &lt;code&gt;-1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Details&lt;/h2&gt;&#xA;&lt;p&gt;Please detail the format you want to accept coordinates in any reasonable format is acceptable.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Letters are worth their values as per Scrabble:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 points: blank tiles&#xA;1 point: E, A, I, O, N, R, T, L, S, U&#xA;2 points: D, G&#xA;3 points: B, C, M, P&#xA;4 points: F, H, V, W, Y&#xA;5 points: K&#xA;8 points: J, X&#xA;10 points: Q, Z&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Bonus tiles (indicated by a lowercase letter, or &lt;code&gt;!&lt;/code&gt; for a blank tile) provide a &lt;code&gt;*2&lt;/code&gt; multiplier and stack (eg. if my co-ordinates spell &lt;code&gt;gOLf&lt;/code&gt; I would earn &lt;code&gt;(((2+1+1+4)*2)*2)&lt;/code&gt;, &lt;code&gt;32&lt;/code&gt; points).&lt;/p&gt;&#xA;&lt;h3&gt;Examples:&lt;/h3&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;6,4 6,5 5,5 4,5 3,5 3,6 2,6 1,6&#xA;UWDESTKP?&#xA;ItDBaDEdI&#xA;TERMDYTSR&#xA;ROANJLEFT&#xA;EkCI OOsT&#xA;IPAJPGMNY&#xA;MZLORITVI&#xA;GwEGgPUeI&#xA;MNROYOEER&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;9&#xA;UWDESTKP?&#xA;ItDBaD dI&#xA;TERMDY SR&#xA;ROANJ  FT&#xA;EkCI  OsT&#xA;IPAJP MNY&#xA;MZLO  TVI&#xA;GwEGgPUeI&#xA;MNROYOEER&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(spells &lt;code&gt;RIGOLETE&lt;/code&gt;, &lt;code&gt;(1+1+2+1+1+1+1)&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0,3 0,4 0,5 0,6&#xA;UWDESTKP?&#xA;ItDBaD dI&#xA;TERMDY SR&#xA;ROANJ  FT&#xA;EkCI  OsT&#xA;IP  P MNY&#xA;MZL   TVI&#xA;GwE gPUeI&#xA;MNROYOEER&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;-1&#xA;UWDESTKP?&#xA;ItDBaD dI&#xA;TERMDY SR&#xA;ROANJ  FT&#xA;EkCI  OsT&#xA;IP  P MNY&#xA;MZL   TVI&#xA;GwE gPUeI&#xA;MNROYOEER&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(spells &lt;code&gt;DEST&lt;/code&gt; which doesn't appear in the dictionary)&lt;/p&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;5,6 4,6 4,7 4,8&#xA;UWDESTKP?&#xA;ItDBaD dI&#xA;TERMDY SR&#xA;ROANJ  FT&#xA;EkCI  OsT&#xA;IP  P MNY&#xA;MZL   TVI&#xA;GwE gPUeI&#xA;MNROYOEER&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;12&#xA;UWDESTKP?&#xA;ItDBaD dI&#xA;TERMDY SR&#xA;ROANJ  FT&#xA;EkCI     &#xA;IP  P  NY&#xA;MZL   TVI&#xA;GwE gPUeI&#xA;MNROYOEER&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(spells &lt;code&gt;MOsT&lt;/code&gt;, &lt;code&gt;(3+1+1+1)*2&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The order is not important, it can be &lt;code&gt;score&lt;/code&gt; then &lt;code&gt;grid&lt;/code&gt;, or vice versa.&lt;/li&gt;&#xA;&lt;li&gt;Any reasonable format can be used for I/O assuming it is consistent.&lt;/li&gt;&#xA;&lt;li&gt;All &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/9365&quot;&gt;standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Questions for meta&lt;/h2&gt;&#xA;&lt;p&gt;Things have changed a lot in the time since I originally posted this, so rather than just posting I thought I'd bump for fredback.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What would the best way of using an associated dictionary be, taking it as input?&lt;/li&gt;&#xA;&lt;li&gt;Obviously the input format for co-ordinates can be more flexible (0-based index, 1-based index, or something) is mentioning this enough?&lt;/li&gt;&#xA;&lt;li&gt;Grid input format can be flexible too, mentioning this should be enough too?&lt;/li&gt;&#xA;&lt;li&gt;Any other relevant tags?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="9365" LastEditorUserId="9365" LastEditDate="2020-07-09T20:49:02.943" LastActivityDate="2020-07-09T20:49:02.943" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="13914" PostTypeId="2" ParentId="2140" CreationDate="2017-09-12T16:01:19.793" Score="0" Body="&lt;h1&gt;Word Grid Pathfinding&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A follow up to &lt;a href=&quot;https://codegolf.stackexchange.com/q/142531/9365&quot;&gt;Generating Word Grids&lt;/a&gt; and Validating Words in Word Grids.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;My original idea for this was to have entries compete, but I'd like to have different winning conditions. Given grid &lt;code&gt;x&lt;/code&gt;, pit all scripts against each other for the following win criteria:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Highest Score&lt;/li&gt;&#xA;&lt;li&gt;Shortest Path&lt;/li&gt;&#xA;&lt;li&gt;Fewest remaining tiles&lt;/li&gt;&#xA;&lt;li&gt;Longest Words&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;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 &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/33208/legionmammal978&quot;&gt;@LegionMammal978&lt;/a&gt;'s idea, but feel like perhaps that could be a separate challenge (again, only if these are interesting to anyone!)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;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.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Details&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Grids will always have an equal, odd, number of rows and columns, such that no direction contains fewer tiles.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Restrictions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;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.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;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 (&gt; 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.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;#TODO: copy details of the adjacency rules from above.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, in the grid provided below, the &lt;code&gt;J&lt;/code&gt;, &lt;code&gt;I&lt;/code&gt;, &lt;code&gt;P&lt;/code&gt; or &lt;code&gt;O&lt;/code&gt; letters (north, east, south and west of the blank square) must be included, once this word has been removed, you have more available words.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are bonus letters that provide a double point score, denoted by a lowercase letter or &lt;code&gt;!&lt;/code&gt; (instead of &lt;code&gt;?&lt;/code&gt; 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 &lt;code&gt;?&lt;/code&gt; (or &lt;code&gt;!&lt;/code&gt;) with a wildcard. Letters are scored as per Scrabble:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 points: blank tiles&#xA;1 point: E, A, I, O, N, R, T, L, S, U&#xA;2 points: D, G&#xA;3 points: B, C, M, P&#xA;4 points: F, H, V, W, Y&#xA;5 points: K&#xA;8 points: J, X&#xA;10 points: Q, Z&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your score will be calculated by the validator.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;UWDESTKP?&#xA;ItDBaDEdI&#xA;TERMDYTSR&#xA;ROANJLEFT&#xA;EkCI OOsT&#xA;IPAJPGMNY&#xA;MZLORITVI&#xA;GwEGgPUeI&#xA;MNROYOEER&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;6,4 6,5 5,5 4,5 3,5 3,6 2,6 1,6&#xA;5,6 4,6 4,7 4,8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Total moves: 2&lt;br&gt;&#xA;Points: 21&lt;/p&gt;&#xA;&#xA;&lt;p&gt;#TODO: more examples.&lt;/p&gt;&#xA;" OwnerUserId="9365" LastActivityDate="2017-09-12T16:01:19.793" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13917" PostTypeId="2" ParentId="13268" CreationDate="2017-09-13T08:41:42.930" Score="-3" Body="&lt;h1&gt;no&lt;/h1&gt;&#xA;&lt;p&gt;You can not delete it.&lt;/p&gt;&#xA;&lt;p&gt;But there is one thing we can do:&#xA;first of post our answer or post our question, we have to think if it is good to post it....&lt;/p&gt;&#xA;" OwnerDisplayName="user58988" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-14T19:03:30.850" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13918" PostTypeId="2" ParentId="13908" CreationDate="2017-09-13T14:56:30.653" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/trait-validity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;trait-validity&amp;#39;&quot; rel=&quot;tag&quot;&gt;trait-validity&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;A &amp;quot;trait&amp;quot; is a characteristic or proof that your output/submission must follow.&lt;/strong&gt;  Example traits include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your output must be palindromic&lt;/li&gt;&#xA;&lt;li&gt;Your submission must be bijective: (there is one output for each input, and vice versa)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&amp;quot;Validity&amp;quot; means that &lt;strong&gt;the check for whether a submission is acceptable is completely based on these traits.  There should be multiple ways for people to fulfill these traits.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This does &lt;em&gt;not&lt;/em&gt; include output that is based on random values.  For example, &amp;quot;You must output a number from 1 to N with a uniform distribution&amp;quot;.  This technically allows a variety of answers, but &lt;em&gt;if there's only 1 output if the RNG was an input into the function&lt;/em&gt;, then the tag doesn't apply.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;Trait&lt;/code&gt; isn't really a common word around here.  I understand that.  However, I don't think we've ever really talked about these things before, so we need a new term.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-13T14:56:30.653" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13919" PostTypeId="2" ParentId="13908" CreationDate="2017-09-13T15:47:50.657" Score="7" Body="&lt;p&gt;The intended purposes of tags are to allow people to highlight questions in areas of interest, hide (or at least deemphasise) questions in areas of non-interest, and provide some hints to the recommendation system (i.e. the &quot;Related&quot; sidebar).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, people sometimes think that tags are the primary &quot;on-topic&quot; system: if it fits &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/foo&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;foo&amp;#39;&quot; rel=&quot;tag&quot;&gt;foo&lt;/a&gt; then it must be suited for the site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think that the questions you give as examples are interesting questions, and quite a nice way to add something to the &quot;puzzle&quot; side of PPCG: although they're &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, working out how to even begin answering is where half of the fun is. And certainly they do seem to group together in a way which fits the intended purposes of a tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I would be very wary of the suggestions in comments and Nathan's answer for a tag with a broad name and scope. If we create a tag which people will claim as conclusive evidence that their over-broad under-specified question is on topic because &quot;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/foo&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;foo&amp;#39;&quot; rel=&quot;tag&quot;&gt;foo&lt;/a&gt; questions need an open spec&quot; then I think the disadvantages will end up outweighing the advantages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the subject of the name, truly has it been said that naming things well is a hard problem. Your proposal of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function-class&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function-class&amp;#39;&quot; rel=&quot;tag&quot;&gt;function-class&lt;/a&gt; seems to me too hard to pin down. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/functional-equation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;functional-equation&amp;#39;&quot; rel=&quot;tag&quot;&gt;functional-equation&lt;/a&gt; was my first thought, but is too specific. Maybe it will inspire someone towards the right name.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TL;DR: in principle a good idea provided that the scope is kept narrow, but the name needs some work.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-09-13T15:47:50.657" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13920" PostTypeId="1" AcceptedAnswerId="13921" CreationDate="2017-09-13T20:52:00.693" Score="1" ViewCount="139" Body="&lt;p&gt;I study electronics, and from time to time we use microcontrollers and have an emulator program to test the code with inputs and outputs to see the result.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would this form of coding be allowed? If so, what files would I have to upload (and to where) to allow use of it? This language would probably only be used for numerical problems as it only operates in 8 bit binary / 2 bit hex.&lt;/p&gt;&#xA;" OwnerUserId="74183" LastEditorUserId="46271" LastEditDate="2017-09-13T23:00:17.523" LastActivityDate="2017-09-13T23:00:17.523" Title="Can I answer in a microcontroller programming language?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13921" PostTypeId="2" ParentId="13920" CreationDate="2017-09-13T21:41:55.447" Score="6" Body="&lt;h1&gt;Absolutely&lt;/h1&gt;&#xA;&lt;p&gt;Any language is acceptable given two conditions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It has an accessible method to run it&lt;/li&gt;&#xA;&lt;li&gt;It can be counted in bytes&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The first rule does include micro controllers and other hardware, as long as it can be purchased, but an online emulator is preferred, as only free languages may compete in Cops vs Robbers challenges.&lt;/p&gt;&#xA;&lt;p&gt;The second rule means you need a method to count how big an uploaded program is, in this case, 8 bits is just a byte, so each binary number or two hex digits would be one byte.&lt;/p&gt;&#xA;&lt;p&gt;All you need to supply is the name of the micro controller, and any programs you need to load into it.&lt;/p&gt;&#xA;" OwnerUserId="58375" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-13T21:41:55.447" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13923" PostTypeId="1" CreationDate="2017-09-15T15:07:41.117" Score="1" ViewCount="217" Body="&lt;p&gt;This question is about the rules of &lt;a href=&quot;https://codegolf.stackexchange.com/q/133754/69481&quot;&gt;One OEIS After Another&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;A comment was made about hard-coding the values of a particularly difficult sequence, for the sake of keeping the challenge going. Peter Taylor claimed that a hard-coded answer must account for at least 1000 terms or else be invalid. This interpretation of the rules would invalidate a previous answer, forcing the deletion of it and six subsequent answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, the rules also say that you may assume that the required output will not be outside your language's numerical range. I, and others, thought that meant that if required outputs were above, for example, 2&lt;sup&gt;32&lt;/sup&gt;-1 in a language with 32-bit unsigned ints, then they could be safely ignored. The other view, as I see it, is that it means that your program should assume it has the required memory and not worry about overflow, outputting in this example the correct answer mod 32.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To be fair, the &lt;a href=&quot;https://codegolf.stackexchange.com/a/142204/69481&quot;&gt;answer at the center of this&lt;/a&gt; is mine, so I'm  biased, but I think that this should have a consensus before any action (such as deleting seven answers) is taken.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The rules in question are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can assume that neither the input nor the required output will be outside your languages numerical range, but please don't abuse this by choosing a language that can only use the number 1, for example.&lt;/li&gt;&#xA;&lt;li&gt;n will never be larger than 1000, or be out of bounds for the sequence, simply to prevent accuracy discrepancies from stopping a language from competing.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="69481" LastEditorUserId="46076" LastEditDate="2019-10-17T21:12:16.997" LastActivityDate="2019-10-17T21:12:16.997" Title="Hard-Coding in &quot;One OEIS after another&quot;" Tags="|discussion|rules|specific-question|" AnswerCount="1" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="13925" PostTypeId="2" ParentId="13923" CreationDate="2017-09-15T17:08:47.423" Score="4" Body="&lt;p&gt;I believe the background to&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;n will never be larger than 1000, or be out of bounds for the sequence, simply to prevent accuracy discrepancies from stopping a language from competing.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;was a comment of mine in the sandbox which raised issues about sequences which depend on high-precision values of real numbers. I believe the specific example I gave was a low-numbered sequence which uses π. In my opinion, using that rule as an excuse for hard-coding values up to 1000 is technically legal but bad sportsmanship, and I presume that other people concur because one high-profile answer linked in comments above which does it is currently at +7/-7.&lt;/p&gt;&#xA;&lt;p&gt;However, in the case of e.g. &lt;a href=&quot;https://oeis.org/A000017&quot; rel=&quot;nofollow noreferrer&quot;&gt;A000017&lt;/a&gt; hard-coding the sequence is the only option because it is essentially &lt;em&gt;defined&lt;/em&gt; as a hard-coded list of values.&lt;/p&gt;&#xA;&lt;p&gt;The issue of uncomputable sequences is also raised in comments and is an interesting one, but I think it would be getting off-topic for this question to discuss it in detail.&lt;/p&gt;&#xA;&lt;p&gt;I don't think this rule is relevant to the answer which is the subject of this meta question, since it neither hard-codes 1000 values nor hard-codes a full finite sequence.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;You can assume that neither the input nor the required output will be outside your languages numerical range, but please don't abuse this by choosing a language that can only use the number 1, for example.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;As Riker has mentioned in a comment, there is a standard loophole:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8245/194&quot;&gt;Abusing native number types to trivialize a problem&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;It is common practice to restrict challenges to cases where input, output and/or intermediate values of the algorithm of choice fit into the language's native number type. At least for input and output, this is generally assumed even if not stated in the challenge specification.&lt;/p&gt;&#xA;&lt;p&gt;...&lt;/p&gt;&#xA;&lt;p&gt;As a rule of thumb, I'd say an answer &lt;em&gt;abuses&lt;/em&gt; the native number type if the code would require non-trivial modifications for larger number type.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The OEIS question doesn't directly specify whether it uses the same rule of thumb to define abuse, but the intention behind the rule seems to be the same as the intention behind the meta-answer which defines the loophole, and I don't see a good argument &lt;em&gt;against&lt;/em&gt; assuming that the same rule of thumb applies. On that basis, hard-coding all of the values which fit inside a language's native integer size is abuse and such answers are not valid.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-15T17:08:47.423" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13926" PostTypeId="2" ParentId="2140" CreationDate="2017-09-15T19:03:23.067" Score="0" Body="&lt;h1&gt;Shift-left golfer&lt;/h1&gt;&#xA;&lt;p&gt;Sometimes when doing code-golf, a person needs to understand which format is shorter:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;2147483648&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;0x80000000&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1&amp;lt;&amp;lt;31&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The task:&lt;/p&gt;&#xA;&lt;p&gt;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!&lt;/p&gt;&#xA;&lt;h1&gt;Notation:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Hexadecimal&lt;/strong&gt; — &lt;code&gt;0x#######....&lt;/code&gt; where there are no leading zeros after the &lt;code&gt;x&lt;/code&gt;. When accounting for evaluating the golfiness, the &lt;code&gt;0x&lt;/code&gt; part is also taken into consideration. For example &lt;code&gt;0x80000000&lt;/code&gt; has a length of 10.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Decimal&lt;/strong&gt; — &lt;code&gt;#######....&lt;/code&gt; where there are no leading zeros.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Shift-left&lt;/strong&gt; — &lt;code&gt;#...&amp;lt;&amp;lt;#....&lt;/code&gt; no leading zeros both sides of &lt;code&gt;&amp;lt;&amp;lt;&lt;/code&gt;. The &lt;code&gt;&amp;lt;&amp;lt;&lt;/code&gt; operator is also considered for length, e.g &lt;code&gt;1&amp;lt;&amp;lt;31&lt;/code&gt; has a length of 5. You must also handle multiple digits before the &lt;code&gt;&amp;lt;&amp;lt;&lt;/code&gt; signal.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;# represents a digit and ... represent possible repetition of digits&lt;/p&gt;&#xA;&lt;p&gt;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!&lt;/p&gt;&#xA;&lt;p&gt;There will be no accepted answer.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so I want to know shortest answer by language.&lt;/p&gt;&#xA;&lt;h1&gt;UPDATE 1:&lt;/h1&gt;&#xA;&lt;p&gt;In spite of @dzaima 's comment, now it also needs to handle multiple digits before &lt;code&gt;&amp;lt;&amp;lt;&lt;/code&gt; signal.&lt;/p&gt;&#xA;" OwnerUserId="29325" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-16T11:05:30.963" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="13927" PostTypeId="2" ParentId="2140" CreationDate="2017-09-16T03:53:54.927" Score="0" Body="&lt;h1&gt;Translate Tetris moves to GoL!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Unless you've been living under a rock, you're probably aware of the fact that the highest voted unanswered, incredibly hard challenge to &lt;a href=&quot;https://codegolf.stackexchange.com/q/11880/68615&quot; title=&quot;Build a working game of Tetris in Conway&amp;#39;s Game of Life&quot;&gt;build a working game of Tetris in Conway's Game of Life&lt;/a&gt; just recently got answered. (Go check it out if you haven't already.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;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 &lt;a href=&quot;https://codegolf.stackexchange.com/a/142673/68615&quot;&gt;main answer&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Each move only requires editing a single bit of RAM, and this input register is automatically cleared after the input event has been read.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Each Tetris move corresponds to a single number by the following table:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;value     motion&#xA;&#xA;1         counterclockwise rotation&#xA;2         left&#xA;4         down (soft drop)&#xA;8         right&#xA;16        clockwise rotation&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now, of course, if there was only a way to automate this...&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a &lt;strong&gt;program/function&lt;/strong&gt; that takes a &lt;strong&gt;series of keypresses&lt;/strong&gt; as input and outputs &lt;strong&gt;each keypress' respective number&lt;/strong&gt; according to the table above.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The keypresses should map as the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;value            motion&#xA;&#xA;&amp;lt;                counterclockwise rotation&#xA;&amp;lt;left arrow&amp;gt;     left&#xA;&amp;lt;down arrow&amp;gt;     down (soft drop)&#xA;&amp;lt;right arrow&amp;gt;    right&#xA;&amp;gt;                clockwise rotation&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Specifications&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/68615&quot; title=&quot;Default for Code Golf: Input/Output methods&quot;&gt;Standard I/O rules&lt;/a&gt; &lt;strong&gt;apply&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot; title=&quot;Loopholes that are forbidden by default&quot;&gt;Standard loopholes&lt;/a&gt; are &lt;strong&gt;forbidden&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;This challenge is not about finding the shortest approach in all languages, rather, it is about finding the &lt;strong&gt;shortest approach in each language&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Your code will be &lt;strong&gt;scored in bytes&lt;/strong&gt;, usually in the encoding UTF-8, unless specified otherwise.&lt;/li&gt;&#xA;&lt;li&gt;Built-in functions that perform this task are &lt;strong&gt;allowed&lt;/strong&gt; but including a solution that doesn't rely on a built-in is encouraged. (Pshh, how likely is that?)&lt;/li&gt;&#xA;&lt;li&gt;Explanations, even for &quot;practical&quot; languages, are &lt;strong&gt;encouraged&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;// incoming&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should I switch from keypresses to strings of &lt;code&gt;( &amp;lt; v &amp;gt; )&lt;/code&gt;?&lt;/li&gt;&#xA;&lt;li&gt;I'm really lacking on tags...&lt;/li&gt;&#xA;&lt;li&gt;Bump!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="68615" LastEditorUserId="68615" LastEditDate="2017-09-21T15:49:04.857" LastActivityDate="2017-09-21T15:49:04.857" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13930" PostTypeId="1" CreationDate="2017-09-17T12:44:40.823" Score="2" ViewCount="96" Body="&lt;p&gt;I've met a quite &lt;a href=&quot;https://codegolf.stackexchange.com/q/143016/14149&quot;&gt;interesting problem&lt;/a&gt; and I thought it would be a nice task also on the code golf.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, it is currently being held as &lt;em&gt;unclear&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, the problem is for me very simple and clear. To my best knowledge, I reacted and made clear all reactions in comments, and by improving the post. The question didn't get up, neither down votes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Considering&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the numerous reactions about the details,&lt;/li&gt;&#xA;&lt;li&gt;the lack of up and also down votes,&lt;/li&gt;&#xA;&lt;li&gt;while the problem is quite simple and clear in my mind,&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think some major problem still could exist, which could make the post still unclear. But, by answering all comments and improving the post according them, I don't have more idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think maybe the math-focused part makes the post partially offtopic. On this reason, I've made a &lt;a href=&quot;https://math.stackexchange.com/q/2432123/111704&quot;&gt;MathSE question&lt;/a&gt; and as it is visible in the answer, it has a very quick, simple and nice algorithm. This post is linked into the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;@hvd pointed to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/143016/approximate-real-number-with-n-digit-precision#comment350420_143016&quot;&gt;problem&lt;/a&gt; about the exact formulation of the required algorithmic complexity. I think it was fixed in the post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Comparing the current version of the post to its first, I see major differences. Any idea, what else to do?&lt;/p&gt;&#xA;" OwnerUserId="14149" LastEditorUserId="66833" LastEditDate="2021-05-13T02:36:48.277" LastActivityDate="2021-05-13T02:36:48.277" Title="How could I clarify my question?" Tags="|discussion|close-reasons|vote-to-close|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13932" PostTypeId="2" ParentId="11002" CreationDate="2017-09-18T04:44:46.413" Score="0" Body="&lt;h1&gt;Tag Name: [persistence]&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I prefer &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/persistence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;persistence&amp;#39;&quot; rel=&quot;tag&quot;&gt;persistence&lt;/a&gt; over &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stateful&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stateful&amp;#39;&quot; rel=&quot;tag&quot;&gt;stateful&lt;/a&gt; because it feels less ambiguous to me.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastActivityDate="2017-09-18T04:44:46.413" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13934" PostTypeId="2" ParentId="2140" CreationDate="2017-09-19T00:06:31.667" Score="1" Body="&lt;h1&gt;100 Letters is the Perfect Amount&lt;/h1&gt;&#xA;&lt;p&gt;Oxford dictionary lists the most commonly used English letters in the following order:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;EARIOTNSLCUDPMHGBFYWKVXZJQ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And assigns each the following frequencies:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/N5UZe.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/N5UZe.png&quot; alt=&quot;Distribution of the letters...&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For the purpose of this challenge, the diagram will be simplified as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;z   1&#xA;q   1&#xA;x   1&#xA;j   1&#xA;k   1&#xA;v   1&#xA;b   2&#xA;p   2&#xA;y   2&#xA;g   2&#xA;f   2&#xA;w   2&#xA;m   3&#xA;u   3&#xA;c   3&#xA;l   4&#xA;d   4&#xA;r   5&#xA;h   6&#xA;s   6&#xA;n   6&#xA;i   6&#xA;o   7&#xA;a   8&#xA;t   9&#xA;e   12&#xA;TOT 100&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Now, onto the task at hand; I've provided you all with a &lt;a href=&quot;https://github.com/carusocomputing/wordListsByLength/blob/master/unsorted.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;dictionary of words to choose from&lt;/a&gt;, using this dictionary of words choose as many as you want to output. However the catch is that you must have &lt;strong&gt;EXACTLY&lt;/strong&gt; the count above of each letter in the output using 7-12 words.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your base score is the length of your code in bytes.&lt;/li&gt;&#xA;&lt;li&gt;You are allowed to go over or under on the number of letters required, each letter above or under results in a +5 byte penalty.&lt;/li&gt;&#xA;&lt;li&gt;If the number of words you've used is between 7 and 12, no penalty is incurred.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;IF it exceeds 12, add 10 bytes per additional word.&lt;/li&gt;&#xA;&lt;li&gt;IF it is less than 7, subtract 5 per missing word.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may use any word from &lt;a href=&quot;https://github.com/carusocomputing/wordListsByLength/blob/master/unsorted.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;the provided dictionary&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Each word you output must be distinctively separated by either a space or a newline.&lt;/li&gt;&#xA;&lt;li&gt;Once a word combination has been posted, you may not use more than 6 of that answer's words together in a new answer.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This will be enforced by post date.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/word-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;word-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;word-problem&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmognogniznornia-complexitylty&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmognogniznornia-complexitylty&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmognogniznornia-complexitylty&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Your score will be as defined in the scoring section.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-19T00:34:28.613" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13935" PostTypeId="1" AcceptedAnswerId="13936" CreationDate="2017-09-19T02:05:31.680" Score="7" ViewCount="235" Body="&lt;p&gt;There is so much gold on this site, but it's not so easy to find.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, I'm golfing in J and like to see expert answers to old questions.  Currently, I have to open a question, and search for the text &quot;J,&quot; using my browser's find feature.  And do this multiple times for popular questions with multipage answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And even better would be to search by language &lt;em&gt;and&lt;/em&gt; specific user.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Is there a way to do this currently?&lt;/li&gt;&#xA;&lt;li&gt;Has anyone written a third party site that uses the SO API to do this?&lt;/li&gt;&#xA;&lt;li&gt;If not, would there be interest in this?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="15469" LastEditorUserId="68942" LastEditDate="2021-06-09T05:37:03.447" LastActivityDate="2021-06-09T05:37:03.447" Title="Search by language?" Tags="|support|feature-request|status-declined|languages|search|" AnswerCount="2" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="13936" PostTypeId="2" ParentId="13935" CreationDate="2017-09-19T03:21:32.807" Score="8" Body="&lt;p&gt;Searching for &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=%5Bcode-golf%5D+is%3Aanswer+%22J%22&quot;&gt;&lt;code&gt;[code-golf] is:answer &quot;J&quot;&lt;/code&gt;&lt;/a&gt; seems to provide good results. And if you want explanations, &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=%5Bcode-golf%5D+is%3Aanswer+%22J%22+%22explanation%22&quot;&gt;&lt;code&gt;[code-golf] is:answer &quot;J&quot; &quot;explanation&quot;&lt;/code&gt;&lt;/a&gt; works.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can also use &lt;code&gt;user:&lt;/code&gt; to filter to a specific user by their ID.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="58974" LastEditDate="2017-09-19T21:19:15.137" LastActivityDate="2017-09-19T21:19:15.137" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13938" PostTypeId="1" CreationDate="2017-09-19T11:12:10.403" Score="9" ViewCount="344" Body="&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;Following on from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/13621/58974&quot;&gt;this question&lt;/a&gt; where it was decided that, as we define languages by their implementation, JavaScript solutions could include a requirement that they be run under a specific domain. This allows us to use, for example, &lt;code&gt;/questions/[id]?site=codegolf&lt;/code&gt; instead of &lt;code&gt;//api.stackexchange.com/questions/[id]?site=codegolf&lt;/code&gt; to save a few bytes.&lt;/p&gt;&#xA;&lt;p&gt;In a recent solution I took this a (small) step further, requiring that it be run at the root level of &lt;code&gt;api.stackexchange.com&lt;/code&gt; and using &lt;code&gt;questions/[id]?site=codegolf&lt;/code&gt; to save another byte.&lt;/p&gt;&#xA;&lt;h2&gt;Proposal&lt;/h2&gt;&#xA;&lt;p&gt;But that then got me to thinking: if we can require a specific domain then we could, by extension, be able to require a specific &lt;em&gt;path&lt;/em&gt;, with the above example becoming simply &lt;code&gt;[id]/?site=codegolf&lt;/code&gt; if run from &lt;code&gt;api.stackexchange.com/questions/&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Personally, I &lt;em&gt;feel&lt;/em&gt; that it's pushing things too far but couldn't come up with a legitimate argument against allowing it so decided to post this question to garner some thoughts from the community and, hopefully, reach a consensus on it.&lt;/p&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-19T17:20:02.083" Title="If we can require a particular domain, can we require a particular path?" Tags="|discussion|policy|" AnswerCount="0" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="13941" PostTypeId="2" ParentId="2140" CreationDate="2017-09-19T18:33:43.860" Score="-2" Body="&lt;h1&gt;Ulam spiral 2&lt;/h1&gt;&#xA;&lt;p&gt;Like Ulam, I had a boring moment and began drawing a spiral like him's. But his version is &lt;strong&gt;utterly incorrect&lt;/strong&gt;, as the \ diagonal distorts the equation &lt;code&gt;n^2&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The following picture illustrates an wrong Ulam spiral at left and a correct at right:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/QNeKa.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/QNeKa.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I challenge you to output a &lt;strong&gt;numbered&lt;/strong&gt; Ulam spiral, the right version, where it is mandatory to &lt;strong&gt;highlight the primes&lt;/strong&gt;. The input is &lt;code&gt;n&lt;/code&gt;, meaning the point where the spiral ends. For the image example I gave &lt;code&gt;n&lt;/code&gt; was &lt;code&gt;100&lt;/code&gt;. It will always begin at &lt;code&gt;1&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;I don't care what highlight style you use (different color, font weight, circle around number, etc), given it makes the primes easily distinguishable form the rest.&lt;/p&gt;&#xA;&lt;p&gt;There will be no accepted answer; just did it for fun.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="29325" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-19T19:50:30.367" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="13944" PostTypeId="1" AcceptedAnswerId="13945" CreationDate="2017-09-21T05:49:21.913" Score="27" ViewCount="1160" Body="&lt;p&gt;&lt;strong&gt;Hello,&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have spent time looking at the StackExchange sites and especially this has seemed quite interesting to me. But I would like you to explain how it works and what it is about. I know how to program in many languages, but in the answers I always see unusual programs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also see that they are like 'challenges', which users respond to by programming, but I do not understand how they can do so in such a few lines of code and how these challenges and their respective responses work? And what specifically does 'code golf' mean?&lt;/p&gt;&#xA;" OwnerUserId="74609" OwnerDisplayName="Eduardo Sebastian" LastEditorUserId="68942" LastEditDate="2021-04-04T03:45:27.300" LastActivityDate="2021-04-04T03:45:27.300" Title="How does this site work?" Tags="|discussion|faq|code-golf|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13945" PostTypeId="2" ParentId="13944" CreationDate="2017-09-21T06:33:53.267" Score="35" Body="&lt;h1&gt;What does &quot;Code Golf&quot; mean?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Code_golf&quot; rel=&quot;nofollow noreferrer&quot;&gt;Code golf&lt;/a&gt;, (Or Codegolf) as the name suggests, is the art of making programs that are as short as possible that complete a task.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;What is &quot;Code Golf &amp;amp; Coding Challenges&quot;?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Code Golf &amp;amp; Coding Challenges – formerly known as &quot;Programming Puzzles &amp;amp; Code Golf&quot; or PPCG – is a Community in which people ask Questions (Challenges), and others answer them. The challenges are usually &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; (See above), although can sometimes be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; and others. All challenges must have an Objective Winning Condition, which means there must be a rule that can determine which of two answers is better. In Code Golf, this is &quot;the shortest code wins&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;What makes a challenge, what makes an answer?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A challenge is something that can be solved by a program, this usually means taking certain inputs and providing certain outputs, with some criteria to show how some solutions are objectively better than others. (This usually has nothing to do with what's good practice, that's &lt;a href=&quot;https://codereview.stackexchange.com/&quot;&gt;Code Review&lt;/a&gt;'s job. :p)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answers are just solutions to the task a challenge provides, these must contain:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The language the solution was written in&lt;/li&gt;&#xA;&lt;li&gt;The length of the solution in bytes&lt;/li&gt;&#xA;&lt;li&gt;The solution itself&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The way these solutions take input is usually defined by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;Our I/O Defaults&lt;/a&gt; unless otherwise specified in the challenge, and we also have a list of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Forbidden Loopholes&lt;/a&gt; to prevent &quot;cheap&quot; solutions, like loading and executing the solution from a webpage.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Why is everything so short?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Since this community's creation, users have been trying to outdo eachother, both in code length of the same langauge, and in choice of language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As you can only go so far with languages like C, Java, Python, or Perl, users (and those from outside the community) create their own esoteric &quot;Golfing Languages&quot;. These languages put understandable code to the side, and instead implement tricks to help their code be as short as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;GolfScript is one of the earliest languages to do this (And gained a lot of negative heat in its day because of it) and was a &lt;a href=&quot;https://en.wikipedia.org/wiki/Stack-oriented_programming_language&quot; rel=&quot;nofollow noreferrer&quot;&gt;Stack Based&lt;/a&gt; language where almost every command was a single ASCII character. This means that reversing a string goes from &lt;code&gt;string.reverse(input)&lt;/code&gt; to just &lt;code&gt;-1%&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, languages like &lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt; have their own &lt;a href=&quot;https://github.com/DennisMitchell/jelly/wiki/Code-page&quot; rel=&quot;nofollow noreferrer&quot;&gt;Code Page&lt;/a&gt; so they can make the most out of each byte and use other tricks to make it even more ridiculously short.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Don't be intimidated by this!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Although users like to try to outgolf each other at the language level, (I myself am competing with &lt;a href=&quot;https://github.com/TehFlaminTaco/RProgN-2&quot; rel=&quot;nofollow noreferrer&quot;&gt;RProgN2&lt;/a&gt;), this is all in good fun, and competition is really intra-language, rather than inter-language. Feel free try to take on challenges in any language, and try to do better than anyone else who's already done it, or do it first to set the record. It is, of course, all in good fun.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Check out our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1280/community-faq-for-programming-puzzles-code-golf&quot;&gt;FAQ&lt;/a&gt; for more info!&lt;/p&gt;&#xA;" OwnerUserId="58375" LastEditorUserId="58563" LastEditDate="2020-04-11T11:45:33.250" LastActivityDate="2020-04-11T11:45:33.250" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="13947" PostTypeId="2" ParentId="2140" CreationDate="2017-09-21T09:39:22.537" Score="4" Body="&lt;h1&gt;Implement a BrainFlump interpreter&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/gunnerwolf/brainflump&quot; rel=&quot;nofollow noreferrer&quot;&gt;BrainFlump&lt;/a&gt; is the latest alternate memory model brainfuck-esque turing tarpit.&lt;/p&gt;&#xA;&lt;p&gt;It operates on a memory model we call a &amp;quot;Dump&amp;quot;, which is simply an un-ordered collection of integers, with a pointer indicating the current item to operate on. As it is &amp;quot;unordered&amp;quot;, when moving to the next item, one is simply chosen at random (chosen uniformly between the items that are not the currently selected item) and the operation pointer is moved to that item.&lt;/p&gt;&#xA;&lt;h2&gt;Commands&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;+   #Increment the item at the pointer&#xA;-   #Decrement the item at the pointer&#xA;:   #Add a 0 to the dump, and move the pointer to it&#xA;;   #Move the pointer to a random item that is not the pointer's current position&#xA;(   #Skip to the matching ) if the item at the pointer is 0&#xA;)   #Skip to the matching ( if the item at the pointer is not 0&#xA;,   #Read a single character from STDIN and push its ascii value to the dump&#xA;    #This also moves the pointer to the new item&#xA;.   #Print the current item at the pointer modulo 127 as an ASCII character&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Other notes&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When the &lt;code&gt;;&lt;/code&gt; command is used if the dump contains only 1 item, a new &lt;code&gt;0&lt;/code&gt; is pushed to the dump, and the pointer is moved to it&lt;/li&gt;&#xA;&lt;li&gt;The &lt;code&gt;.&lt;/code&gt; command does not pop the item from the dump&lt;/li&gt;&#xA;&lt;li&gt;When the &lt;code&gt;,&lt;/code&gt; command is used if STDIN has been exhausted, a new &lt;code&gt;0&lt;/code&gt; is pushed to the dump, and the pointer is moved to it&lt;/li&gt;&#xA;&lt;li&gt;Any item in the dump who's value is &lt;code&gt;0&lt;/code&gt; is not considered to exist, unless it is the item at the pointer, therefore to &amp;quot;pop&amp;quot; an item from the dump, you simply set its value to &lt;code&gt;0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Nested loops &lt;em&gt;are&lt;/em&gt; supported&lt;/li&gt;&#xA;&lt;li&gt;The random number generator used for the interpreter does not have to be cryptographically secure, but must chose with uniformity.&lt;/li&gt;&#xA;&lt;li&gt;BrainFlump does not support floating point numbers or negative integers. Attempting to decrement a number below &lt;code&gt;0&lt;/code&gt; has no effect.&lt;/li&gt;&#xA;&lt;li&gt;The maximum value of an item in the dump is &lt;code&gt;255&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples/Testcases&lt;/h2&gt;&#xA;&lt;h3&gt;brainf**k emulation&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;++++++(;++++++++;-);.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This should output &lt;code&gt;0&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Explanation&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;++++++        #Increment the first item to 6&#xA;(             #While the item under the pointer is not 0&#xA;    ;         #Move to another item in the dump&#xA;              #    Note the first time this loop runs,&#xA;              #    this will insert a new item&#xA;    ++++++++  #Increment the new item by 8&#xA;    ;         #Switch to another item in the dump&#xA;              #    Note there are only 2 items currently,&#xA;              #    So this will switch to the only other&#xA;              #    item, the one we initially incremented to 6&#xA;    -         #Decrement the item&#xA;)             #Repeat the loop if the item is not 0&#xA;;             #Switch to the other item&#xA;              #    Note this switches the pointer back to&#xA;              #    The item we have been incrementing by&#xA;              #    8 each loop&#xA;.             #Output as ASCII character&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is effectively a &lt;code&gt;6*8&lt;/code&gt; operation, followed by an output, and is nearly identical to brainf**k's &lt;code&gt;++++++[&amp;gt;++++++++&amp;lt;-]&amp;gt;.&lt;/code&gt; program, which also outputs &lt;code&gt;0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Note, however, that brainf**k-esque dump manipulation is only deterministically possible if there are never more than 2 items in the dump.&lt;/p&gt;&#xA;&lt;h3&gt;Random output&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;+:++:+++:++++:+++++:;.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This will actually always output an unprintable character, however which character is output will be random each time, selected from: &lt;code&gt;SOH, STX, EST, EOT, ENQ&lt;/code&gt;, ie ASCII characters 1-5. In a correctly implemented interpreter, this output should be uniformly random between the 5 possibilities.&lt;/p&gt;&#xA;&lt;h3&gt;Explanation&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;+      #Increment first item to 1&#xA;:      #Add new item and move to it&#xA;++     #Increment new item to 2&#xA;:      #Add new item and move to it&#xA;+++    #Increment new item to 3&#xA;:      #Add new item and move to it&#xA;++++   #Increment new item to 4&#xA;:      #Add new item and move to it&#xA;+++++  #Increment new item to 5&#xA;:      #Add new item and move to it&#xA;       #    Note this last item is added because ; will&#xA;       #    always switch to an item that is *not* the&#xA;       #    currently selected item&#xA;;      #Switch randomly to an item in the dump&#xA;.      #Output as ASCII character&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;To give a little more info on this, by the time the &lt;code&gt;;&lt;/code&gt; command is reached, the dump should look like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3 4 5 0&#xA;          ^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;As &lt;code&gt;;&lt;/code&gt; &lt;em&gt;always&lt;/em&gt; switches to a different item, the result will be the pointer at one of the non-zero items.&lt;/p&gt;&#xA;&lt;h3&gt;cat&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;,(.,)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Nice and simple, and identical to brainf**k's cat program.&lt;/p&gt;&#xA;&lt;p&gt;For scoring purposes, you should use &lt;a href=&quot;https://gist.github.com/gunnerwolf/394c35161fbba6db85671c9b7ba80479&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; gist as input when testing.&lt;/p&gt;&#xA;&lt;h3&gt;When will it end?&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;++++(,:+++++;++(;++++++;--):++++;---)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This program doesn't output anything, but runs for a non-deterministic amount of time.&lt;/p&gt;&#xA;&lt;h3&gt;Explanation&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;++++             #Increment first item to 4&#xA;(                #Start loop&#xA;    ,            #Read char from STDIN to new item in dump&#xA;    :+++++       #Push 5 to dump&#xA;    ;++          #Switch to random item in dump and add 2&#xA;    (            #Start loop&#xA;        ;++++++  #Switch to random item in dump and add 6&#xA;        ;--      #Switch to random item in dump and subtract 2&#xA;    )            #End loop&#xA;    :++++        #Push 4 to dump&#xA;    ;---         #Switch to random item in dump and subtract 3&#xA;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This one is a little tricky, as &lt;code&gt;;&lt;/code&gt; will never switch to a &lt;code&gt;0&lt;/code&gt; (Remember items with a value of &lt;code&gt;0&lt;/code&gt; are considered to not exist)&lt;/p&gt;&#xA;&lt;p&gt;The inner loop will only exit if &lt;code&gt;;--&lt;/code&gt; switches to a number &lt;code&gt;&amp;lt;= 2&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;The outer loop will only exit if &lt;code&gt;;---&lt;/code&gt; switches to a number &lt;code&gt;&amp;lt;= 3&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Due to the inherent randomness of the language, this &lt;em&gt;should&lt;/em&gt; always terminate... eventually.&lt;/p&gt;&#xA;&lt;p&gt;For scoring purposes, you should use the exact string &lt;code&gt;Hello, World!&lt;/code&gt; as input when testing.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; meaning the interpreter that on average runs the fastest, wins!&lt;/p&gt;&#xA;&lt;p&gt;Scoring will be determined by running each of the 4 test-cases above 100 times, and determining an average runtime (due to the inherent randomness of the language, a high number of runs should be made to minimise anomalous results).&lt;/p&gt;&#xA;&lt;p&gt;Then once you have an average for each testcase, sum the 4 times, and that is your final score. &lt;strong&gt;Lower is better&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="44998" LastEditorUserId="44998" LastEditDate="2021-12-01T18:20:16.963" LastActivityDate="2021-12-01T18:20:16.963" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="13948" PostTypeId="2" ParentId="13944" CreationDate="2017-09-21T11:09:44.513" Score="12" Body="&lt;p&gt;I would just like to add that while the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; in fact &lt;em&gt;is&lt;/em&gt; a competition, it won't feel like one very much. It's more of showing off nice approaches to solving the challenge — there's only one answer for most languages in each thread. Also, as already pointed out, people will tell you when they see a way to improve ( = shorten) your code. So, in the end, it is more of a &quot;collaborative effort&quot; to overcome the challenge in the least number of bytes than a competition.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I cannot but second the &lt;strong&gt;Don't be intimidated by this&lt;/strong&gt;. The people are very friendly and &lt;em&gt;will&lt;/em&gt; help you out. Often, they will show you a much better approach in the comments, and it's not rare for a challenge to be cut into 1/2 of the size by this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd recommend you to start golfing in a language you know, but aren't a particular master of. Browse the docs liberally, try to find the best solution, use the help of other people and you will soon find your knowledge of that language skyrocket. For me, this happened with Perl 6. And you can even learn whole new approaches to programming like this — most likely functional programming — which is, in my humble opinion, totally awesome, and makes it possible to write concise, elegant and powerful code.&lt;/p&gt;&#xA;" OwnerUserId="30415" LastEditorUserId="30415" LastEditDate="2017-09-21T13:24:41.580" LastActivityDate="2017-09-21T13:24:41.580" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13951" PostTypeId="1" CreationDate="2017-09-22T11:05:47.133" Score="11" ViewCount="316" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/q/115591/3852&quot;&gt;Answer-Chaining Fibonacci&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/q/133754/3852&quot;&gt;One OEIS after another&lt;/a&gt; challenges have quite a curious win condition. Quoting the former:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;Winning&lt;/h2&gt;&#xA;&lt;p&gt;The winner of the challenge will be the person who posted the &lt;em&gt;second&lt;/em&gt; most-recent submission (i.e., not the person who posted last, since they broke the chain).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This condition is objective, but there’s &lt;em&gt;nothing I can do to try to win&lt;/em&gt;: I have to make sure not to break the chain, which is within my control; but I also have to make sure the &lt;em&gt;next&lt;/em&gt; person writes an answer that breaks it, which is entirely out of my control.&lt;/p&gt;&#xA;&lt;p&gt;This is silly, and it makes me think that the condition is only in place to awkwardly fit this fun answer-chaining activity into the site rules.&lt;/p&gt;&#xA;&lt;p&gt;Is this kind of win condition okay? Should we host competitions where you can technically win, but you can’t even &lt;em&gt;try&lt;/em&gt; to win?&lt;/p&gt;&#xA;" OwnerUserId="3852" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-28T08:12:15.383" Title="Questions with an objective win criterion, but no strategy to achieve it" Tags="|discussion|answer-chaining|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="13952" PostTypeId="2" ParentId="13951" CreationDate="2017-09-22T13:47:42.777" Score="10" Body="&lt;p&gt;This was originally a comment, but it became too big. It doesn't provide a single answer per se, but more of a collection of ideas.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First of all, I think I disagree with &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;there’s nothing I can do to try to win&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In the two examples, making more answers increases the chance that you will win, and making more answers is what we should be incentivizing.  There is nothing you can do to improve an individual answer's chance of winning, which is I think you take issue with, but overall you can increase your chances of winning by producing more answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That being said, I don't think this is the best winning criterion for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;. While it does incentivize more answers, it only does so probabilistically and, like what I think you are getting at, there is nothing you can do to improve an individual answer.  I think this winning criterion  works best when each answer is &lt;em&gt;harder&lt;/em&gt; than the last, which is not the case for one OEIS after another.  Even in cases where it does increase in difficulty, it's not the best, as it doesn't really encourage answers to do anything other than to be valid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a challenge writer I would suggest doing something along the lines of &quot;each answer counts as n-points towards its poster with the one that breaks the chain counting negative&quot;, but that doesn't really help answer the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All in all, I don't know what we can or should do about this. I'll let other people sort that out since I don't have a strong opinion.  Until then, I'll just downvote any challenge I don't think incentivizes good answers.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="70424" LastEditDate="2017-09-28T08:12:15.383" LastActivityDate="2017-09-28T08:12:15.383" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13954" PostTypeId="2" ParentId="2140" CreationDate="2017-09-22T20:45:25.993" Score="0" Body="&lt;h1&gt;Two-Symbol n-state Universal Turing Machine&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;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.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal is to produce a program that satisfies all of the following criteria:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is a two-symbol Turing Machine program.&lt;/li&gt;&#xA;&lt;li&gt;It emulates a two-symbol Turing Machine program that is represented on the tape.&lt;/li&gt;&#xA;&lt;li&gt;where all tape that is not data is initialised to one symbol (designated &lt;code&gt;0&lt;/code&gt; - the other is &lt;code&gt;1&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There are two scoring criteria:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The number of states. Smaller is better.&lt;/li&gt;&#xA;&lt;li&gt;The compressibility of the program format (see below).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;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.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Compressibility of the Program Format&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The compressibility of the program format is defined as the number of (additional) states required to write the program onto a blank (&lt;code&gt;0&lt;/code&gt;) 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). &lt;em&gt;Sandbox note: Hand-compressed test-cases? Average-case Big O?&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="43394" LastActivityDate="2017-09-22T20:45:25.993" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13955" PostTypeId="2" ParentId="13951" CreationDate="2017-09-22T21:18:12.877" Score="2" Body="&lt;h1&gt;There &lt;em&gt;is&lt;/em&gt; a strategy to win.&lt;/h1&gt;&#xA;&lt;p&gt;Consider a KoTH where you won by making trades with other bots.  By itself, the bot can't do anything to win.  However, if you make the assumption that other bots will want to trade, then there's an obvious strategy:  Trade.&lt;/p&gt;&#xA;&lt;p&gt;This is true for &amp;quot;second most-recent submisison&amp;quot; posts.  By yourself, you are completely unable to win.  However, if you make the assumption that other people are going to post, then there's an obvious strategy:  Make a post.&lt;/p&gt;&#xA;&lt;p&gt;Given that this is a programming puzzle site, and that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; posts are quite popular, I think that the assumption is often (but not always) a safe one.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-22T21:18:12.877" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13956" PostTypeId="2" ParentId="2140" CreationDate="2017-09-23T14:42:38.990" Score="1" Body="&lt;h1&gt;Create a &lt;code&gt;.pdf&lt;/code&gt; file&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is, given a non-empty string, to create a valid &lt;a href=&quot;https://en.wikipedia.org/wiki/Portable_Document_Format&quot; rel=&quot;nofollow noreferrer&quot;&gt;PDF&lt;/a&gt; (also see &lt;a href=&quot;http://www.adobe.com/content/dam/Adobe/en/devnet/acrobat/pdfs/pdf_reference_1-7.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; for more information about the structure of PDF-files) file that contains no more than this string (no page numbers, date etc). Your submission has can either be a function or full program that achieves this task.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input will be a &lt;strong&gt;non-empty&lt;/strong&gt; string of &lt;a href=&quot;https://en.wikipedia.org/wiki/ASCII#Printable_characters&quot; rel=&quot;nofollow noreferrer&quot;&gt;printable&lt;/a&gt; ASCII characters, additionally the characters &lt;code&gt;\n&lt;/code&gt; &amp;amp; &lt;code&gt;\t&lt;/code&gt; may be part of the input but not the last character&lt;/li&gt;&#xA;&lt;li&gt;Your program/function produces a valid PDF file that contains that string but no more&lt;/li&gt;&#xA;&lt;li&gt;The representation of the string doesn't matter, except that it has to be a different color than the background, meaning valid representations may be (not limited to):&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;green text on black background (or the other way around)&lt;/li&gt;&#xA;&lt;li&gt;the font is irrelevant but has to be consistent (it has to be readable without using a loupe)&lt;/li&gt;&#xA;&lt;li&gt;some sort of image that represents the string&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The output has to be case sensitive &lt;/li&gt;&#xA;&lt;li&gt;If the string doesn't fit page width it needs to be split in a consistent manner such that it fits onto multiple lines (this means each character needs to be visible)&lt;/li&gt;&#xA;&lt;li&gt;If the lines don't fit onto a single page, you'll need to insert pagebreaks&lt;/li&gt;&#xA;&lt;li&gt;The width of a &lt;code&gt;\t&lt;/code&gt; and &lt;code&gt;&lt;/code&gt; (space) need to be visibly different (&lt;code&gt;\t&lt;/code&gt; larger)&lt;/li&gt;&#xA;&lt;li&gt;The PDF may contain one trailing empty page&lt;/li&gt;&#xA;&lt;li&gt;The PDF can be printed to STDOUT (ie. &lt;code&gt;call_your_program &amp;gt; test.pdf&lt;/code&gt; would result in a valid PDF) or create a new file somewhere on your filesystem (the filename doesn't need to end in &lt;code&gt;.pdf&lt;/code&gt; or &lt;code&gt;.PDF&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example inputs&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Valid&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Printable string:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hello, World!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Printable string containing newline(s):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Foo\nBar&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Printable string containing newlines &amp;amp; horizontal tabs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Line 1:\t!&quot;#$%&amp;amp;\'()*+,-./0123456789:;&amp;lt;=&amp;gt;?\nLine 2:\t@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_\nLine 3:\t`abcdefghijklmnopqrstuvwxyz{|}~&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Invalid&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Trailing newline:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hello, World!\n&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Carriage return:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Foo\r\nBar&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Empty string:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;&#xA;&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Tags will be: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/encode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;encode&amp;#39;&quot; rel=&quot;tag&quot;&gt;encode&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are there other relevant tags?&lt;/li&gt;&#xA;&lt;li&gt;Is the challenge specific enough (creating PDFs that only work in an exotic PDF-reader etc)?&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should I limit the question such that the file has to be &quot;viewable&quot; in (for example) &lt;code&gt;xpdf&lt;/code&gt;?&lt;/li&gt;&#xA;&lt;li&gt;If so, would &lt;code&gt;xpdf&lt;/code&gt; be a good choice?&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Is &quot;readable&quot; well defined enough (for example some people may claim that they are able to read &lt;a href=&quot;https://en.wikipedia.org/wiki/Wingdings&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wingdings&lt;/a&gt; or even worse Comic Sans :P)&lt;/li&gt;&#xA;&lt;li&gt;Should I enforce a certain font size? What about even enforcing a certain font itself? (I feel this takes away too much freedom) &lt;/li&gt;&#xA;&lt;li&gt;Should I limit input such that it always fits onto a single page? (Loophole: people could choose a font size such that the input can only be one letter)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="48198" LastEditorUserId="48198" LastEditDate="2017-09-23T22:24:28.427" LastActivityDate="2017-09-23T22:24:28.427" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="13957" PostTypeId="1" CreationDate="2017-09-23T15:02:55.853" Score="8" ViewCount="151" Body="&lt;p&gt;I tried to get all tcl posts that are not from my own authorship&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/search?tab=newest&amp;amp;q=tcl%20-user%3ame&quot;&gt;https://codegolf.stackexchange.com/search?tab=newest&amp;amp;q=tcl%20-user%3ame&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;using&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;tcl -user:me&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;but it interpreted it as posts not containing the string &quot;user:me&quot;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I also tried&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/search?q=tcl+user%3A-me&quot;&gt;https://codegolf.stackexchange.com/search?q=tcl+user%3A-me&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;using&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;tcl user:-me&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;but it interpreted it as posts containing the string &quot;user:-me&quot;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Is there a way to get what was not posted by me? If there is not, I suggest to implement it using the syntax I tried.&lt;/p&gt;&#xA;" OwnerUserId="29325" LastEditorUserId="66833" LastEditDate="2021-06-02T00:01:37.087" LastActivityDate="2021-06-02T00:01:37.087" Title="Is there a way to search for all content except my own?" Tags="|support|users|search|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13961" PostTypeId="2" ParentId="13957" CreationDate="2017-09-24T10:05:11.563" Score="5" Body="&lt;p&gt;Use the Data Explorer:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://data.stackexchange.com/codegolf/query/726867&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://data.stackexchange.com/codegolf/query/726867&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2017-09-24T10:05:11.563" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13963" PostTypeId="2" ParentId="2140" CreationDate="2017-09-24T12:57:04.837" Score="-1" Body="&lt;p&gt;&lt;strong&gt;Six Flags over HTTP&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's say you need to transmit six boolean flags in a URL string. Obviously you could do it with six ones or zeroes, but you want better compression. With a little math you can pack them into two characters using 0-7 octal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How about mapping all six to a single ASCII character? Here we have a problem: you are not allowed to use , / ? : @ &amp;amp; = + $ # or space. Now the range of printable ASCII no longer has 64 valid characters in a row.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In Javascript (or another language that can run from a web page, if any), what is the shortest code for a pair of functions to encode and decode this data, between an array of six booleans and a single character?&lt;/p&gt;&#xA;" OwnerUserId="38372" LastActivityDate="2017-09-24T12:57:04.837" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13965" PostTypeId="1" AcceptedAnswerId="13966" CreationDate="2017-09-24T15:19:19.650" Score="7" ViewCount="324" Body="&lt;p&gt;The problem emerged with &lt;a href=&quot;https://codegolf.stackexchange.com/a/143046/66833&quot;&gt;this&lt;/a&gt; answer (deleted, and so invisible for users with less than 10k reputation)&lt;/p&gt;&#xA;&lt;p&gt;The most relevant win criteria of the puzzle is the algorithmic complexity of the solution.&lt;/p&gt;&#xA;&lt;p&gt;An answer using Mathematica was posted, making the algorithmic complexity of the solution depending heavily on the internal algorithms used by this software. These are not enough well known, and practically unknowable, because Mathematica is closed-source software.&lt;/p&gt;&#xA;&lt;p&gt;However, the solution seemed a quite interesting one for me, and maybe also for others (it got multiple upvotes).&lt;/p&gt;&#xA;&lt;p&gt;Accepting the situation, the poster declared the solution as non-competing.&lt;/p&gt;&#xA;&lt;p&gt;Despite that, it was deleted by community votes.&lt;/p&gt;&#xA;&lt;p&gt;I think, also non-competing or undecidable answers improve the site. However, it would be probably not useful to have a large mass of non-competing, unanswerable answers. Furthermore, the primary goal of the site may be to collect mainly competing answers to the puzzles.&lt;/p&gt;&#xA;" OwnerUserId="14149" LastEditorUserId="66833" LastEditDate="2021-04-30T21:50:09.480" LastActivityDate="2021-04-30T21:50:49.290" Title="Do we really want to delete undecidable answers, even if they were declared non-competing?" Tags="|discussion|noncompeting|deleted-answers|" AnswerCount="1" CommentCount="0" FavoriteCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="13966" PostTypeId="2" ParentId="13965" CreationDate="2017-09-24T15:43:15.217" Score="17" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;Non-competing doesn't allow an answer to do what it wants, and not meet the questions specifications. If a question has a specific scoring system, answers whose scores can't be calculated shouldn't be marked non-competing, they should be removed from the question.&lt;/p&gt;&#xA;&lt;p&gt;In short, if I posted an answer to the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world&quot;&gt;Hello, World!&lt;/a&gt; question that didn't display &lt;code&gt;Hello, World!&lt;/code&gt;, is it a valid answer? No. Can it be marked non-competing? No. To &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990/66833&quot;&gt;quote Dennis&lt;/a&gt;,&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Marking an answer as &lt;em&gt;&lt;strong&gt;non-competing&lt;/strong&gt;&lt;/em&gt; does not exempt it from being invalid.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The Mathematica answer, while being interesting, did not meet the answer specification, and, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990/66833&quot;&gt;per our rules&lt;/a&gt; it should have been deleted. This also applies to any other answers which, while accomplishing the task at hand, can't be scored.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-30T21:50:49.290" LastActivityDate="2021-04-30T21:50:49.290" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="13969" PostTypeId="2" ParentId="13621" CreationDate="2017-09-25T06:12:36.187" Score="4" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In my opinion, this constitutes &lt;strong&gt;outsourcing the real answer&lt;/strong&gt;, which is a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1085/61384&quot;&gt;standard loophole&lt;/a&gt;. This is because it outsources the fetching of data from the website to the browser that ran the code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd like to address the two &quot;yes&quot; arguments that were presented by Nathan Merril:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;It is specified in the post&lt;/li&gt;&#xA;  &lt;li&gt;They aren't being used to store bytes (on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; or similar challenges where byte-count matters)&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;This doesn't make much sense to me. If a question explicitly allows something, it can be allowed, but this Meta post is tagged as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/policy&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;policy&amp;#39;&quot; rel=&quot;tag&quot;&gt;policy&lt;/a&gt;, which indicates that we are looking from a general consensus in absence of any specification  by the OP.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The definition of &quot;storing bytes&quot; is a little bit sketchy here. Even if the environment is not being used to store program &lt;em&gt;code&lt;/em&gt;, it could still be storing &lt;em&gt;data&lt;/em&gt;, and it is indirectly saving bytes by removing the need for a GET request or similar to fetch the data from the website. The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; standard loopholes are there to tell us what bytes are acceptable to save.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;I'll finish with the ever-so-popular advice on PPCG: &lt;strong&gt;golf your code, not your IO format&lt;/strong&gt;. Allowing code run at a specific domain feels too much like golfing the IO format to me.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="61384" LastEditDate="2017-10-06T06:36:15.573" LastActivityDate="2017-10-06T06:36:15.573" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13970" PostTypeId="1" AcceptedAnswerId="13973" CreationDate="2017-09-25T10:55:30.683" Score="17" ViewCount="297" Body="&lt;p&gt;Why do people keep posting a link to the sandbox below their question? Isn't the sandbox supposed to serve the OP as a way of getting feedback on a challenge? It seems like a lot of people are mistaking (or am I?) the purpose of the sandbox as a &lt;em&gt;golden ticket to success&lt;/em&gt;. Is there an unspoken rule that prevents people from downvoting posts that were sandboxed or what is this all about? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So my question is, does linking to the sandboxed post (which is deleted and not visible to everybody anyways) actually serve a purpose?&lt;/p&gt;&#xA;" OwnerUserId="48198" LastActivityDate="2017-09-27T15:00:32.897" Title="Linking to the sandbox" Tags="|discussion|sandbox|" AnswerCount="3" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="13973" PostTypeId="2" ParentId="13970" CreationDate="2017-09-26T01:46:57.453" Score="7" Body="&lt;p&gt;I am one of the ones that include Sandbox links in comments. I (and others) do this to stave off any &quot;this needs to be Sandboxed&quot; comments from users who don't take the time to check whether or not a challenge was Sandboxed before commenting. It serves as a reminder to do due diligence before giving criticism, and also as a reminder that many challenges spend a lot of time in the Sandbox, so there is ample time for feedback if users will look through the Sandbox and review challenges there.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-09-26T01:46:57.453" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13977" PostTypeId="2" ParentId="2140" CreationDate="2017-09-26T21:30:54.863" Score="3" Body="&lt;h1&gt;n-gon in m-gon&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;What is the greatest equilateral triangle you can fit into a regular pentagon? This is what this challenge is about, but with regular n-gons/m-gons.&lt;/p&gt;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Given two integers &lt;code&gt;m,n&lt;/code&gt; greater or equal to 3, find the maximal ratio of the areas of the two polygons such that the &lt;code&gt;m&lt;/code&gt;-gon is completely contained in the &lt;code&gt;n&lt;/code&gt;-gon.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;p&gt;We are always talking about regular polygons, this means that all sides have the same length and all vertices are on a circle. The output can be a floating point-, fixed point- or rational number and must be correct to three decimal places.&lt;/p&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt; m  n  ratio (area m-gon / area n-gon)&#xA; x  x  1 (for all x)&#xA; 3  4  1/4*sqrt(3) = 0.4330&#xA; 4  3  12/(7*sqrt(3)+12) = 0.4974&#xA; 3  6  1/2 = 0.5&#xA; 6  3  2/3 = 0.6667&#xA; &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Would be nice to have larger examples.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-26T22:07:13.350" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="13979" PostTypeId="2" ParentId="13970" CreationDate="2017-09-26T22:48:19.920" Score="8" Body="&lt;p&gt;Yes, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/13976?noredirect=1#comment50283_13976&quot;&gt;apparently&lt;/a&gt; it can cause newcomers to use the sandbox, which IMHO is a good thing.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2017-09-26T22:48:19.920" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13982" PostTypeId="2" ParentId="2140" CreationDate="2017-09-27T01:21:00.313" Score="0" Body="&lt;h1&gt;Output an Anagram! No Not That One!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/anagram&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;anagram&amp;#39;&quot; rel=&quot;tag&quot;&gt;anagram&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a list of unique strings that are anagrams of each other, output an anagram of those words that is different from each word in the list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The strings will be alphanumeric, and there is guaranteed to be a valid anagram.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program or function can, but doesn't have to be non-deterministic, meaning given the same input, multiple running a of the code can yield different outputs, as long as every possible output is a valid one.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[Input] -&amp;gt; Possible output&#xA;-----------------&#xA;[ab] -&amp;gt; ba&#xA;[aba, aab] -&amp;gt; baa&#xA;[123, 132, 231, 312, 321] -&amp;gt; 213&#xA;[hq999, 9h9q9, 9qh99] -&amp;gt; 999hq&#xA;[abcde123, ab3e1cd2, 321edbac, bcda1e23] -&amp;gt; ba213ecd&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Sandbox questions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a duplicate of anything?&lt;/li&gt;&#xA;&lt;li&gt;Any other test cases I should include?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="62574" LastEditorUserId="62574" LastEditDate="2017-11-14T03:22:00.093" LastActivityDate="2017-11-14T03:22:00.093" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13983" PostTypeId="2" ParentId="2140" CreationDate="2017-09-27T07:16:57.093" Score="0" Body="&lt;h1&gt;It’s raining numbers! Better to get a good umbrella!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;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!&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 =&amp;gt;&#xA;&#xA;  1&#xA; _|_&#xA;/   \&#xA;-----&#xA;  |&#xA;  C&#xA;&#xA;&#xA;2 =&amp;gt;&#xA;&#xA;  2  &#xA;      2&#xA; ___|___&#xA;/       \&#xA;---------&#xA;    |&#xA;    |&#xA;    C&#xA;&#xA;&#xA;3 =&amp;gt;&#xA;&#xA;  3       3&#xA;      3  &#xA;  3       3&#xA; _____|_____&#xA;/           \&#xA;-------------&#xA;      |&#xA;      |&#xA;      | &#xA;      C&#xA;&#xA;&#xA;4 =&amp;gt;&#xA;&#xA;  4       4&#xA;      4       4&#xA;  4       4&#xA;      4       4       &#xA; _______|_______&#xA;/               \&#xA;-----------------&#xA;        |&#xA;        |&#xA;        |&#xA;        |&#xA;        C&#xA;&#xA;&#xA;10 =&amp;gt;&#xA;&#xA;  1       1       1       1       1&#xA;  0       0       0       0       0&#xA;      1       1       1       1       1&#xA;      0       0       0       0       0&#xA;  1       1       1       1       1&#xA;  0       0       0       0       0&#xA;      1       1       1       1       1&#xA;      0       0       0       0       0&#xA;  1       1       1       1       1&#xA;  0       0       0       0       0&#xA;      1       1       1       1       1&#xA;      0       0       0       0       0&#xA;  1       1       1       1       1&#xA;  0       0       0       0       0&#xA;      1       1       1       1       1&#xA;      0       0       0       0       0&#xA;  1       1       1       1       1&#xA;  0       0       0       0       0&#xA;      1       1       1       1       1&#xA;      0       0       0       0       0    &#xA; ___________________|___________________&#xA;/                                       \&#xA;-----------------------------------------&#xA;                    |&#xA;                    |&#xA;                    |&#xA;                    |&#xA;                    |&#xA;                    |&#xA;                    |&#xA;                    |&#xA;                    |&#xA;                    |&#xA;                    C&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The output should use only the ascii characters &lt;code&gt;_ | - / \ C&lt;/code&gt;, space, and the digits (no tabs are allowed).&lt;/li&gt;&#xA;&lt;li&gt;Numbers should have an alternating pattern, two digits on the same line are separated by 7 spaces. &lt;/li&gt;&#xA;&lt;li&gt;Number with more than one digit must be written vertically.&lt;/li&gt;&#xA;&lt;li&gt;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.&lt;/li&gt;&#xA;&lt;li&gt;The shank of the umbrella under the top is centered and should be of height n (the &lt;code&gt;|&lt;/code&gt; characters), and terminated by a &lt;code&gt;C&lt;/code&gt; handle.&lt;/li&gt;&#xA;&lt;li&gt;Lines can have trailing spaces.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; task, so the shortest solution is any language wins.&lt;/p&gt;&#xA;" OwnerUserId="41789" LastEditorUserId="41789" LastEditDate="2017-09-27T18:45:12.850" LastActivityDate="2017-09-27T18:45:12.850" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13984" PostTypeId="2" ParentId="2140" CreationDate="2017-09-27T13:41:02.227" Score="-2" Body="&lt;p&gt;Looking for some help to make this code golf/question better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Proposal:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now that twitter has increased it's character limit from 140 to 280, there's a joke of almost enough to write Hello World! in Java.   But what actual programs could you write in 280 characters, fizz buzz?  Sure you could write many in 140 or less, but maximum points if you get a good program in the full 280.&lt;/p&gt;&#xA;" OwnerUserId="74811" LastActivityDate="2017-09-27T13:41:02.227" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="13985" PostTypeId="2" ParentId="13970" CreationDate="2017-09-27T15:00:32.897" Score="5" Body="&lt;p&gt;As @Adám pointed out, I only got to the sandbox post because I'd seen a lot of challenges with their sandbox linked on the comments. IMO, it's useful information to have, as it makes people aware of not only the sandbox, but of the Meta board as a whole.&lt;/p&gt;&#xA;" OwnerUserId="74163" LastActivityDate="2017-09-27T15:00:32.897" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13986" PostTypeId="2" ParentId="2140" CreationDate="2017-09-27T16:18:25.667" Score="0" Body="&lt;h1&gt;Output the Yggdrasil graph&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In Norse mythology, &lt;a href=&quot;https://en.wikipedia.org/wiki/Yggdrasil&quot; rel=&quot;nofollow noreferrer&quot;&gt;Yggdrasil&lt;/a&gt;, 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 &quot;world tree&quot; - it's the tree that &lt;em&gt;contains&lt;/em&gt; 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.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;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 &lt;a href=&quot;https://en.wikipedia.org/wiki/Cayley_graph&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cayley graph&lt;/a&gt; of the free group with countably infinitely many generators. Your goal is to output this graph.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;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 (&lt;code&gt;a-b-c&lt;/code&gt; is not an acceptable representation of an edge from &lt;code&gt;a-b&lt;/code&gt; to &lt;code&gt;c&lt;/code&gt;, but &lt;code&gt;[&quot;a-b&quot;, &quot;c&quot;]&lt;/code&gt; is fine). In the output, each edge shall be output on a single line, and different edges shall go on different lines. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;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:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Listing the edges in breath-first order is not sufficient, as any edge disjoint from the root would not get output.&lt;/li&gt;&#xA;&lt;li&gt;Listing the edges in depth-first order is not sufficient, as no more than two edges of any node would ever get output.&lt;/li&gt;&#xA;&lt;li&gt;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).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The sufficient example above will output, if nodes are labeled &lt;code&gt;0&lt;/code&gt;, &lt;code&gt;0 1&lt;/code&gt;, &lt;code&gt;0 2&lt;/code&gt;, &lt;code&gt;0 1 1&lt;/code&gt;, ... :&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 =&amp;gt; 0 1&#xA;0 =&amp;gt; 0 2&#xA;0 1 =&amp;gt; 0 1 1&#xA;0 =&amp;gt; 0 3&#xA;0 1 =&amp;gt; 0 1 2&#xA;0 2 =&amp;gt; 0 2 1&#xA;0 1 1 =&amp;gt; 0 1 1 1&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="7209" LastEditorUserId="7209" LastEditDate="2017-10-02T22:41:23.183" LastActivityDate="2017-10-02T22:41:23.183" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="13987" PostTypeId="2" ParentId="11408" CreationDate="2017-09-27T16:51:40.257" Score="8" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12575/ppcg-specific-mobile-app&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/5wyTo.png&quot; alt=&quot;Code a mobile app for PPCG!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="30525" LastEditorUserId="30525" LastEditDate="2017-09-28T16:48:55.163" LastActivityDate="2017-09-28T16:48:55.163" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13993" PostTypeId="2" ParentId="13128" CreationDate="2017-09-28T21:23:34.810" Score="14" Body="&lt;h1&gt;Upvote them&lt;/h1&gt;&#xA;&lt;p&gt;Literally just upvote answers that take work. Be the solution.&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-28T21:23:34.810" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13994" PostTypeId="2" ParentId="2140" CreationDate="2017-09-28T21:56:23.527" Score="3" Body="&lt;h1&gt;Got Your PIN!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I bet I can write down your PIN! 0000 0001 0002 0003 ... 9999. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task: Write a program that outputs a string containing all possible four digit PINs.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The string should not contain any whitespace (trailing newline is okay). &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Score: Length of program (in bytes) + length of output.&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;Explanation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The output string only needs to contain each PIN somewhere in it; digits can be reused. For instance the string “123456789” contains the PINs 1234, 2345,3456,4567,5678,and 6789. By reusing digits, it's possible to save a significant amount of space from the naive implementation (0000000100020003...9999).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At best, this could be written as a 10,003 digit string. 4 digit for the first PIN, then one more digit for the other 9999 PINs. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Testing your code&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I've written a basic Python script that can check your solution and indicate any PINs you are missing.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import sys&#xA;s = sys.stdin.readline()&#xA;passes = True&#xA;for ix in range(10000):&#xA;    pin = &quot;%04d&quot; % (ix)&#xA;    if s.find(pin) == -1:&#xA;        print(&quot;Missing PIN %s&quot; % pin)&#xA;        passes = False&#xA;&#xA;if passes:&#xA;    print('Result passes!')&#xA;print('String length is %d characters.' % len(s))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="51506" LastActivityDate="2017-09-28T21:56:23.527" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="13995" PostTypeId="2" ParentId="2140" CreationDate="2017-09-28T22:43:36.510" Score="2" Body="&lt;h2&gt;Count bicubic graphs&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graph-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graph-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;graph-theory&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This question assumes basic knowledge of &lt;a href=&quot;//en.wikipedia.org/wiki/Graph_theory&quot; rel=&quot;nofollow noreferrer&quot;&gt;graph theory&lt;/a&gt; terminology.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;strong&gt;cubic graph&lt;/strong&gt; is a simple graph whose vertices each have exactly 3 edges. A &lt;strong&gt;bipartite graph&lt;/strong&gt; is a vertex whose vertices can be divided into two disjoint sets such that every edge is between a vertex in one set and a vertex in the other set. A &lt;strong&gt;bicubic graph&lt;/strong&gt; is a graph which is both cubic and bipartite.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is easy to show that a bicubic graph must have the same number of vertices in each of the bipartite halves, so the number of vertices must be even. It is also easy to show that it must have at least six vertices. The only bicubic graph with six vertices (up to isomorphism) is the so-called &lt;strong&gt;utility graph&lt;/strong&gt; or &lt;strong&gt;K&lt;sub&gt;3,3&lt;/sub&gt;&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/Mi6CQ.png&quot; alt=&quot;The edges are the Cartesian product of two three-element sets of vertices&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A positive non-zero integer &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The number of bicubic graphs with &lt;code&gt;2n&lt;/code&gt; vertices, up to isomorphism.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Notes&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The graphs are &lt;em&gt;not&lt;/em&gt; required to be connected.&lt;/li&gt;&#xA;&lt;li&gt;This sequence is &lt;a href=&quot;https://oeis.org/history/view?seq=A008325&amp;amp;v=11&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS A008325&lt;/a&gt;. However, hard-coding these values will be considered a breach of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1063/194&quot;&gt;standard rules&lt;/a&gt;. You may hard-code for inputs of up to &lt;code&gt;3&lt;/code&gt;, but above that the code should follow the same paths and be correct assuming unbounded memory and time for any valid input. It seems unlikely that we will extend the sequence, but it's nonetheless a worthy stretch goal.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input  Output&#xA;&#xA;1      0&#xA;2      0&#xA;3      1&#xA;4      1&#xA;5      2&#xA;6      6&#xA;7      14&#xA;8      41&#xA;9      157&#xA;10     725&#xA;11     4196&#xA;12     29816&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Winning criterion&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The fastest program wins. The primary win condition is the largest input for which correct output is given within 10 minutes. In case of ties, the time taken to compute the value for that input will be compared. If the difference is less than 20 seconds, the earlier answer wins.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-09-28T22:43:36.510" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="13996" PostTypeId="2" ParentId="2140" CreationDate="2017-09-29T00:01:58.227" Score="-1" Body="&lt;h1&gt;Count letter frequency&lt;/h1&gt;&#xA;&lt;p&gt;Inspired by question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/76781/tweetable-hash-function-challenge&quot;&gt;Tweetable hash function challenge&lt;/a&gt;, you should take the &lt;a href=&quot;https://gist.githubusercontent.com/orlp/3ff520a34ad74d547557e761d92be470/raw/british-english-huge.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;English dictionary&lt;/a&gt; used there and produce a program or function that outputs the the absolute and relative frequency of each character. It is CASE SENSITIVE and the APOSTROPHE is also accountable as a real letter.&lt;/p&gt;&#xA;&lt;p&gt;Example of a valid output format (but with stupid guessing values):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A      5566    20%&#xA;...&#xA;Z        60     0.2%&#xA;a     27000    30%&#xA;...&#xA;z       120     0.01%&#xA;'       450     3.5%&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;It is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, but no answer will be accepted. Wanna know shortest script for each language.&lt;/p&gt;&#xA;" OwnerUserId="29325" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-09-29T00:01:58.227" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="13997" PostTypeId="1" CreationDate="2017-09-29T09:21:57.013" Score="4" ViewCount="131" Body="&lt;p&gt;Why isn't Latex rendered in questions and answers?  Some other sites such as &lt;a href=&quot;https://math.stackexchange.com/&quot;&gt;math exchange&lt;/a&gt; support MathJax. It is often useful explaining questions/answers with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="73596" LastEditorUserId="68942" LastEditDate="2021-06-03T04:48:16.100" LastActivityDate="2021-06-03T04:48:16.100" Title="Why there's no latex in PPCG?" Tags="|discussion|feature-request|status-completed|" AnswerCount="0" CommentCount="9" ClosedDate="2017-09-29T10:49:55.050" ContentLicense="CC BY-SA 3.0" />
  <row Id="14000" PostTypeId="2" ParentId="2140" CreationDate="2017-09-30T10:36:17.527" Score="0" Body="&lt;h1&gt;Sort a nested object by nested value&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your goal is to sort a nested object by a nested value. What does that mean? For example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#1: Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;    foo: {&#xA;        category: &quot;A&quot;,&#xA;        hello: &quot;world&quot;,&#xA;        color: &quot;blue&quot;&#xA;    },&#xA;    bar: {&#xA;        category: &quot;B&quot;,&#xA;        cu: &quot;cumber&quot;,&#xA;        color: &quot;blue&quot;&#xA;    },&#xA;    baz: {&#xA;        category: &quot;A&quot;,&#xA;        let: &quot;tuce&quot;,&#xA;        color: &quot;green&quot;,&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#1a: Output&lt;/strong&gt; &lt;em&gt;sorted by&lt;/em&gt; &lt;code&gt;category&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;    A: {&#xA;        foo: {&#xA;            hello: &quot;world&quot;,&#xA;            color: &quot;blue&quot;,&#xA;        },&#xA;        baz: {&#xA;            let: &quot;tuce&quot;,&#xA;            color: &quot;green&quot;&#xA;        }&#xA;    },&#xA;    B: {&#xA;        bar: {&#xA;            cu: &quot;cumber&quot;,&#xA;            color: &quot;blue&quot;&#xA;        }&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#1b: Output&lt;/strong&gt; &lt;em&gt;sorted by&lt;/em&gt; &lt;code&gt;color&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;    blue: {&#xA;        foo: {&#xA;            hello: &quot;world&quot;,&#xA;            category: &quot;A&quot;&#xA;        },&#xA;        bar: {&#xA;            cu: &quot;cumber&quot;,&#xA;            category: &quot;B&quot;&#xA;        }&#xA;    },&#xA;    green: {&#xA;        baz: {&#xA;            let: &quot;tuce&quot;,&#xA;            category: &quot;A&quot;&#xA;        }&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Note that the sorting key is always deleted from the objects (when sorting by &lt;code&gt;color&lt;/code&gt; none of the items contain &lt;code&gt;color&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Your task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an object, and a sorting key (a string), output the sorted object as shown.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;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)&lt;/li&gt;&#xA;&lt;li&gt;You can always assume that the given sorting key exists in all values&lt;/li&gt;&#xA;&lt;li&gt;Sorting will only occur on the first-level objects, but the sorting key can be nested (see test case #2)&lt;/li&gt;&#xA;&lt;li&gt;The object may be a JSON object, a python dict, a JS object, etc. but must always have string only keys.&lt;/li&gt;&#xA;&lt;li&gt;You may accept the object as a JSON string and/or return a JSON string.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#2: Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Sort by:&lt;/em&gt; &lt;code&gt;rating.healthiness&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;    icecream: {&#xA;        sweet: true,&#xA;        rating: {&#xA;            tastiness: &quot;8&quot;,&#xA;            healthiness: &quot;4&quot;&#xA;        }&#xA;    },&#xA;    pizza: {&#xA;        sweet: false,&#xA;        rating: {&#xA;            tastiness: &quot;9&quot;,&#xA;            healthiness: &quot;3&quot;&#xA;        }&#xA;    },&#xA;    chocolatecake: {&#xA;        sweet: true,&#xA;        rating: {&#xA;            tastiness: &quot;8&quot;,&#xA;            healthiness: &quot;3&quot;&#xA;        }&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;#2: Output&lt;/strong&gt; (&lt;em&gt;sorted by&lt;/em&gt; &lt;code&gt;rating.healthiness&lt;/code&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;    &quot;3&quot;: {&#xA;        pizza: {&#xA;            sweet: false,&#xA;            rating: {&#xA;                tastiness: &quot;9&quot;&#xA;            }&#xA;        },&#xA;        chocolatecake: {&#xA;            sweet: true,&#xA;            rating: {&#xA;                tastiness: &quot;8&quot;&#xA;            }&#xA;        }&#xA;&#xA;    },&#xA;    &quot;4&quot;: {&#xA;        icecream: {&#xA;            sweet: true,&#xA;            rating: {&#xA;                tastiness: &quot;8&quot;&#xA;            }&#xA;        }&#xA;    },&#xA;} &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;I really need to make the question clearer. Any thoughts? How can I better describe the task?&lt;/li&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;I'm guessing I need a better title. Any ideas?&lt;/li&gt;&#xA;&lt;li&gt;Should I make the input a JSON object or just a general object?&lt;/li&gt;&#xA;&lt;li&gt;Are multi-level nested objects even possible? Would it be too easy without them?&lt;/li&gt;&#xA;&lt;li&gt;Should I also allow booleans &amp;amp; numbers as the value for the sorting key (and then in a key form it would be stringified)?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="70999" LastActivityDate="2017-09-30T10:36:17.527" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14002" PostTypeId="1" CreationDate="2017-09-30T17:33:34.833" Score="17" ViewCount="338" Body="&lt;p&gt;As you may know a few days ago I asked you guys &lt;a href=&quot;https://codegolf.stackexchange.com/questions/143822/a-%c3%97-a-a-%c3%97-a&quot;&gt;to prove (-a) × (-a) = a × a in as few steps as possible&lt;/a&gt; and it seems to have been more of a success than I had ever imagined.  We've had a lot of fun and generated some &lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/144054/56656&quot;&gt;really small&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/143928/56656&quot;&gt;proofs&lt;/a&gt;!&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What you may not know is that I asked another &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/proof-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;proof-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;proof-golf&lt;/a&gt; question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/96402/prove-demorgans-laws&quot;&gt;about a year ago&lt;/a&gt;.  The first question had considerable flaws which I worked to improve for the second, which I think really paid off.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I want to take this knowledge that I have gained and share it with people who are interested in asking about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/proof-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;proof-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;proof-golf&lt;/a&gt;.  So what tips do we have for writing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/proof-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;proof-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;proof-golf&lt;/a&gt; questions?  This will start as a comparison between the two existing questions, but as we explore the tag we can of course branch out.  I know based on vote counts that some users are critical of my second question so I would also love to see what they didn't like about it or what they would do if they were asking a similar question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Tips should be specific to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/proof-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;proof-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;proof-golf&lt;/a&gt; and should assume that the question writer is already capable of writing a clear, well specified and on-topic question (i.e. tips to improve clarity are not needed).  Tips could range from choosing a topic to choosing axioms to choosing a scoring system.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-10-11T23:13:15.943" LastActivityDate="2017-10-11T23:13:15.943" Title="Tips for writing [proof-golf] questions" Tags="|discussion|asking-questions|tips|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14003" PostTypeId="2" ParentId="14002" CreationDate="2017-09-30T17:47:36.550" Score="7" Body="&lt;h1&gt;Build off of people's existing understanding&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I think one of the big improvements I made between my first and second question was picking something that most people are already intimately familiar with.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should try to use mostly concepts that people are already familiar with and build off of their understanding.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/143822/a-%c3%97-a-a-%c3%97-a&quot;&gt;(-a) × (-a) = a × a&lt;/a&gt; I asked for a substitution style proof.  A (less rigorous) kind of this proof is used in most schools as a general problem solving technique and thus is easy to understand.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other side of the fence &lt;a href=&quot;https://codegolf.stackexchange.com/questions/96402/prove-demorgans-laws&quot;&gt;Prove DeMorgan's Laws&lt;/a&gt; use a natural deduction style of proof, which is &lt;em&gt;not&lt;/em&gt; familiar to most people unless they have studied logic.  This can make your question unapproachable for people who might be interested in answering your question otherwise.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This of course goes for things other than choosing a proof system.  One should also aim to have the proven result be intuitive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This has the added benefit of making it really satisfying to solve your problem.  I remember when I first learned abstract algebra I loved the feeling of being able to prove concretely things that I had always taken for granted.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="59487" LastEditDate="2017-09-30T17:56:08.637" LastActivityDate="2017-09-30T17:56:08.637" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14004" PostTypeId="2" ParentId="2140" CreationDate="2017-09-30T19:00:06.730" Score="1" Body="&lt;h1&gt;Can You Catch the Robber?&lt;/h1&gt;&#xA;&lt;p&gt;This is not a cops and robbers type challenge, but a code-golf challenge based on the PBS Infinite Series video &lt;a href=&quot;https://youtu.be/9mJEu-j1KT0&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cops and Robbers Theorem&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;You will be given an undirected and connected graph.  You may also assume the graph contains no self-loops; that is, the graph will not contain a vertex with an edge connecting to itself.  You must determine if the graph is cop-win.  That means that if a cop and robber start at any vertex, the cop will eventually land on the same vertex as the robber, with the cop and robber taking turns traversing one edge at a time, starting with the cop.  Both the cop and the robber are playing optimally and have the option to not move on their turn.&lt;/p&gt;&#xA;&lt;p&gt;If you haven't watched the video, let me explain how to simplify the problem.  First, let's start with a definition.  A pitfall is any vertex &lt;code&gt;v&lt;/code&gt; whose neighbors are all a distance of 0 or 1 from a common vertex &lt;code&gt;w&lt;/code&gt;, where &lt;code&gt;v&lt;/code&gt; is not equal to &lt;code&gt;w&lt;/code&gt;.  To determine if a graph is cop-win, you must repeatedly remove pitfalls and the edges that connect to it until the graph is reduced to a single vertex or there are no more pitfalls to remove.  If the graph can be reduced to a single vertex in this way, it is cop-win.  A couple visual examples follow.&lt;/p&gt;&#xA;&lt;h3&gt;Example 1&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;o---o---o&#xA;  \ / \ /&#xA;   o---o&#xA;    \ /&#xA;     o&#xA;&#xA;  o---o&amp;lt;&#xA; / \ /&#xA;o---o&#xA; \ /&#xA;  o&#xA;&#xA; &amp;gt;o&#xA; / \&#xA;o---o&#xA; \ /&#xA;  o&#xA;&#xA;&amp;gt;o---o&#xA;  \ /&#xA;   o&#xA;&#xA; &amp;gt;o&#xA; /&#xA;o&#xA;&#xA;o&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Result:&lt;/strong&gt; Cop-win&lt;/p&gt;&#xA;&lt;h3&gt;Example 2&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;  o---o---o&amp;lt;&#xA; /     \   \&#xA;o---o   o---o&#xA; \   \ /   /&#xA;  o---o---o&#xA;&#xA;  o---o&#xA; /     \&#xA;o---o   o---o&#xA; \   \ /   /&#xA;  o---o---o&amp;lt;&#xA;&#xA;  o---o&#xA; /     \&#xA;o---o&amp;lt;  o---o&#xA; \   \ /&#xA;  o---o&#xA;&#xA;  o---o&#xA; /     \&#xA;o       o---o&amp;lt;&#xA; \     /&#xA;  o---o&#xA;&#xA;  o---o&#xA; /     \&#xA;o       o&#xA; \     /&#xA;  o---o&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Result:&lt;/strong&gt; Not cop-win&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; &lt;code&gt;[[2,3],[2,4],[0,1,3,4,6],[0,2,5,6,8],[1,2,6,7,9],[3,8],[2,3,4,8,9,10],[4,9],[3,5,6,10],[4,6,7,10,11],[6,8,9,11],[9,10]]&lt;/code&gt;&lt;br/&gt;&#xA;&lt;strong&gt;Output:&lt;/strong&gt; Truthy&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; &lt;code&gt;[[3],[4],[5],[0,5,6],[1,6],[2,3,7],[3,4,8],[5,9],[6,9,10],[7,8,11],[8],[9,12],[11]]&lt;/code&gt;&lt;br/&gt;&#xA;&lt;strong&gt;Output:&lt;/strong&gt; Falsy&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; &lt;code&gt;[[1,2],[0,3],[0,3],[1,2]]&lt;/code&gt;&lt;br/&gt;&#xA;&lt;strong&gt;Output:&lt;/strong&gt; Falsy&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; &lt;code&gt;[[1,2,3],[0,2,3],[0,1,3],[0,1,2]]&lt;/code&gt;&lt;br/&gt;&#xA;&lt;strong&gt;Output:&lt;/strong&gt; Truthy&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;You may take input as an adjacency list, adjacency matrix, or list of edges, whose vertices may be 0-indexed or 1-indexed.  Your output must be a truthy or falsy value.  This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the least number of bytes in each language wins.&lt;/p&gt;&#xA;&lt;h3&gt;Notes&lt;/h3&gt;&#xA;&lt;p&gt;This is my first post; I could certainly benefit from some help in formulating and polishing my challenge.  If anyone believes my language was ambiguous or contradictory to what was said in the video, please help me clarify.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graph-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graph-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;graph-theory&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="57013" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-10-31T02:13:28.197" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="14005" PostTypeId="2" ParentId="2140" CreationDate="2017-10-01T14:05:49.890" Score="1" Body="&lt;h1&gt;Number of all hyperrectangle-filling walks&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Your input:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;size of the hyperrectangle – generally an &lt;em&gt;n&lt;/em&gt;-tuple&#xA;&lt;ul&gt;&#xA;&lt;li&gt;eg. &lt;code&gt;(s,s)&lt;/code&gt; in case of a square&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;position in the hyperrectangle – generally &lt;strong&gt;&lt;code&gt;0 &amp;lt;= pos[i] &amp;lt; size[i]&lt;/code&gt;&lt;/strong&gt; for &lt;em&gt;i&lt;/em&gt;-th dimension&#xA;&lt;ul&gt;&#xA;&lt;li&gt;eg. &lt;code&gt;(x,y)&lt;/code&gt; where &lt;code&gt;0 &amp;lt;= x &amp;lt; s&lt;/code&gt; and &lt;code&gt;0 &amp;lt;= y &amp;lt; s&lt;/code&gt; in case of a &lt;code&gt;(s,s)&lt;/code&gt; square.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Your task:&lt;/strong&gt; Find the number of walks in the hyperrectangle, which start at the given position and visit each cell of the hyperrectangle exactly once.&lt;/p&gt;&#xA;&lt;p&gt;In the context of this task, a &lt;strong&gt;walk is a sequence of positions&lt;/strong&gt;, such that each position after the first differs from the previous one in exactly one dimension by amount of exactly &lt;code&gt;1&lt;/code&gt;. Eg. in the case of a 2x2 square, a possible walk would be &lt;code&gt;(0,0) -&amp;gt; (0,1) -&amp;gt; (1,1) -&amp;gt; (1,0)&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; It doesn't matter whether &lt;code&gt;x&lt;/code&gt; is vertical position and &lt;code&gt;y&lt;/code&gt; horizontal or vice versa. Neither it matters whether coordinates grow downwards / upwards or to the left / right (eg. vertical axis might grow downwards or upwards without any effect on the result). These statements extend to higher dimensions as well.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Related task:&lt;/strong&gt;&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/144118/longest-hypercube-path&quot;&gt;Longest hypercube path&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;Given &lt;code&gt;size = (3,3)&lt;/code&gt; and &lt;code&gt;pos = (0,0)&lt;/code&gt;, there are 8 solutions. These can be divided into four equivalence classes under the relation of transposition, viz. &lt;code&gt;A == Transpose(A)&lt;/code&gt;. Only one solution for each equivalence class needs to be found, the other one can be obtained by simply transposing the first one.&lt;/p&gt;&#xA;&lt;p&gt;The four &amp;quot;canonical&amp;quot; solutions:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/slh81.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/slh81.png&quot; alt=&quot;(3,3);(0,0) Canonical solutions&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt; &lt;code&gt;8&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Possible specializations&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Specialization 1:&lt;/strong&gt; Support only hypercubes (hyperrectangles with equal sizes in each dimension).&#xA;&lt;strong&gt;Specialization 2:&lt;/strong&gt; Support only 2-dimensional hypercubes (squares).&lt;/p&gt;&#xA;&lt;h2&gt;My questions&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;(Obvious question) Has this task already been presented?&lt;/li&gt;&#xA;&lt;li&gt;Is this task (in its general form) too difficult? Would it be more reasonable to restrict it to one of the specializations (or to a different specialization)?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;" OwnerUserId="67445" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-10-01T20:33:16.007" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14006" PostTypeId="2" ParentId="2140" CreationDate="2017-10-01T20:32:52.377" Score="-2" Body="&lt;h1&gt;Shortest golang code to println the first byte of a function’s code&lt;/h1&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The code must be a function which takes another function as parameter and will print the first cpu instruction byte of parameter such as :&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;func dummy() {&#xA;}&#xA;print_first_native_instruction_byte(dummy)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;would print :&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0x90&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;which is a nop instruction on x86.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You don’t need to perform disassembling : if the first instruction is longer than one byte, just print it’s first byte anyway without caring about instruction meaning or instruction length. Please note this is harder than just printing the value pointed by &lt;code&gt;&amp;amp;dummy&lt;/code&gt; in the case of my example though.&lt;/li&gt;&#xA;&lt;li&gt;The function parameter must be a &lt;code&gt;go&lt;/code&gt; function, not a &lt;code&gt;cgo&lt;/code&gt; or assembly function.&lt;/li&gt;&#xA;&lt;li&gt;You can include as many golang packages as you want.&lt;/li&gt;&#xA;&lt;li&gt;The code need to be written in Go. &lt;strong&gt;A well known language developped at Google and part of the four Google’s app engines supported languages&lt;/strong&gt; and answers should be able to run on the official &lt;a href=&quot;https://play.golang.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;go playground&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Winner&lt;/h2&gt;&#xA;&lt;p&gt;The one with the shortest code… Import statements included.&lt;/p&gt;&#xA;" OwnerUserId="50239" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-10-01T22:25:18.907" CommentCount="1" CommunityOwnedDate="2017-10-01T20:32:52.377" ContentLicense="CC BY-SA 3.0" />
  <row Id="14009" PostTypeId="2" ParentId="2140" CreationDate="2017-10-02T16:47:05.533" Score="6" Body="&lt;h1&gt;ASCII Stock Exchange &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;At the &lt;em&gt;ASCII Stock Exchange&lt;/em&gt;, each character has a price. If a character is used more often, its price rises, otherwise the price decreases over time.&lt;/p&gt;&#xA;&lt;p&gt;Initially, each character has price 10. &lt;em&gt;[Meta: Is this too low/high?]&lt;/em&gt; After each answer, the prices change as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each character that is not used in the answer's code has its price decreased by one, except when the price is already one, in which case it stays one.&lt;/li&gt;&#xA;&lt;li&gt;If a character is used &lt;em&gt;n&lt;/em&gt;-times, then its price increases by &lt;em&gt;n&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;We define the &lt;em&gt;score&lt;/em&gt; of a piece of code as the sum of the prices of its characters.&lt;/p&gt;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&lt;p&gt;For the sake of simplicity, we only consider characters &lt;code&gt;A&lt;/code&gt;, &lt;code&gt;B&lt;/code&gt; and &lt;code&gt;C&lt;/code&gt; for this example. The challenge itself works with all bytes from &lt;code&gt;\0&lt;/code&gt; to &lt;code&gt;\255&lt;/code&gt;. Initially, we have the following prices:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A -&amp;gt; 10, B -&amp;gt; 10, C -&amp;gt; 10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If the code of the first answer is &lt;code&gt;BAAA&lt;/code&gt;, then is has a score of 40 (computed by taking the &lt;em&gt;previous&lt;/em&gt; character prices into account) and the prices change to&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A -&amp;gt; 13, B -&amp;gt; 11, C -&amp;gt; 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If the next answer is &lt;code&gt;CC&lt;/code&gt;, it has a score of 18 and the prices are updated to&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A -&amp;gt; 12, B -&amp;gt; 10, C -&amp;gt; 11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;The Task&lt;/h2&gt;&#xA;&lt;p&gt;Your objective is to write a program or function which calculates the score of a given piece of code in dependence of a list of previous answers which all influence the initial prices in the way described above.&lt;/p&gt;&#xA;&lt;p&gt;The goal is to do so while minimizing the submission's score itself in the context of this challenge, that is your submission should be able to calculate its own score by taking a list of all previous submissions and its own source code as input.&lt;/p&gt;&#xA;&lt;p&gt;The answer with the lowest score in each language wins.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may take a list of strings and a string as input, or require that the string to be scored is the first/last element of the list, or any other reasonable input format.&lt;/li&gt;&#xA;&lt;li&gt;You may not answer twice in a row.&lt;/li&gt;&#xA;&lt;li&gt;If an answer in language &lt;em&gt;X&lt;/em&gt; has already been posted, you may only post another answer in language &lt;em&gt;X&lt;/em&gt; if your submission achieves a lower score than the previous answer and the code is not identical.&lt;/li&gt;&#xA;&lt;li&gt;For this challenge only major releases of languages are considered their own language (e.g. &lt;em&gt;Java 7&lt;/em&gt; vs. &lt;em&gt;Java 8&lt;/em&gt;). If there already is an answer in version &lt;em&gt;A&lt;/em&gt; of a language and you have an answer in version &lt;em&gt;B&lt;/em&gt; of the language and are in doubt whether version &lt;em&gt;B&lt;/em&gt; is different enough from version &lt;em&gt;A&lt;/em&gt; to be treated as different language, make sure that your code is not valid in version &lt;em&gt;A&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Answer Format&lt;/h2&gt;&#xA;&lt;p&gt;To avoid having to copy all previous answers in order to calculate your submission's score, the chain will maintain a &lt;a href=&quot;https://tio.run/##dVJNaxsxFLzrV8whsCtiG7uQS6gLJfTQngo52qGoa8UW2ZWEPuIa8t@372nXJGuT29PM6M2sdg4qvui27XvTeRcSHk8x6W7xw76a4GynbRIinbzG72AajTXqh4MKM/y0SQrRKWMJ2zkIACrsI77OsdfpO40MGetzGrEHZxPtK7gPxibcIDYuaNRocgjE/fHsEodNcrgtxCC6v8emhHjC/BseE23Y80RJRsV4uXE7Dhpzhw083tBwAEZnaHVC/SvHBC9J0zr3kj0JxqtPQlwkYdfBq9iOCS5Vazy7dtci@51K@owaa5JR7XgUYnr@8EGXzBqd8qi3DVvWzWy1lBKbarusFotq@@XurqKgU6/PXufsMFVPX6qYfRQUQuKce0KR0fv2oRTnQVztoPClLQWR/OPfQIVZY0kjl2mgO/UPK9TDvTlWcpS6dNDhaKJ@lw6aW9giORKveSO5ZSoUa4ox/ccCUFru63VjRj13QNt9OmCBZ9MmHVBTvEb2PRf35HKgIv3tTIzG2Wp8MnZlvvdBvxqXY69sPOoQe2b@Aw&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Haskell – Try It Online&quot;&gt;score calculator&lt;/a&gt; on TIO. Click on the link to the calculator in the previous answer and enter your code into the input field to calculate its score. Then add your code as a command-line argument, generate a new link and include it in your answer for the next submission.&lt;/p&gt;&#xA;&lt;p&gt;If you wrote answer number 42 in Haskell with a score of 100, please format it as&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;42. &lt;a href=&quot;https://www.haskell.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Haskell&lt;/a&gt;, score 100&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt; &amp;lt;code&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;TIO-Link, explanation, ...&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##dVJNaxsxFLzrV8whsCtiG7uQS6gLJfTQngo52qGoa8UW2ZWEPuIa8t@372nXJGuT29PM6M2sdg4qvui27XvTeRcSHk8x6W7xw76a4GynbRIinbzG72AajTXqh4MKM/y0SQrRKWMJ2zkIACrsI77OsdfpO40MGetzGrEHZxPtK7gPxibcIDYuaNRocgjE/fHsEodNcrgtxCC6v8emhHjC/BseE23Y80RJRsV4uXE7Dhpzhw083tBwAEZnaHVC/SvHBC9J0zr3kj0JxqtPQlwkYdfBq9iOCS5Vazy7dtci@51K@owaa5JR7XgUYnr@8EGXzBqd8qi3DVvWzWy1lBKbarusFotq@@XurqKgU6/PXufsMFVPX6qYfRQUQuKce0KR0fv2oRTnQVztoPClLQWR/OPfQIVZY0kjl2mgO/UPK9TDvTlWcpS6dNDhaKJ@lw6aW9giORKveSO5ZSoUa4ox/ccCUFru63VjRj13QNt9OmCBZ9MmHVBTvEb2PRf35HKgIv3tTIzG2Wp8MnZlvvdBvxqXY69sPOoQe2b@Aw&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Haskell – Try It Online&quot;&gt;Score calculator for next answer&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;p&gt;These test cases are in the format &lt;code&gt;list of strings, string to score -&amp;gt; result&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[], &amp;quot;BAAA&amp;quot; -&amp;gt; 40&#xA;[&amp;quot;BAAA&amp;quot;], &amp;quot;CC&amp;quot; -&amp;gt; 18&#xA;[&amp;quot;abc&amp;quot;], &amp;quot;abc&amp;quot; -&amp;gt; 33&#xA;[&amp;quot;ab12&amp;quot;, &amp;quot;aa22&amp;quot;, &amp;quot;31a&amp;quot;], &amp;quot;ac23&amp;quot; -&amp;gt; 42&#xA;[&amp;quot;a&amp;quot;,&amp;quot;b&amp;quot;,&amp;quot;c&amp;quot;,&amp;quot;d&amp;quot;,&amp;quot;e&amp;quot;,&amp;quot;f&amp;quot;,&amp;quot;g&amp;quot;,&amp;quot;h&amp;quot;,&amp;quot;i&amp;quot;,&amp;quot;j&amp;quot;], &amp;quot;123&amp;quot; -&amp;gt; 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any idea what could be a good initial price? I picked the number 10 rather arbitrarily.&lt;/li&gt;&#xA;&lt;li&gt;&lt;s&gt;Letting the cost of unused characters decrease until 0 might lead to score 0 answers. Do you think this is a problem and the minimum cost should be 1?&lt;/s&gt; Minimum changed to 1.&lt;/li&gt;&#xA;&lt;li&gt;&lt;s&gt;I'm unsure what range of characters is a sensible choice. Limiting answers to printable ASCII plus white space would make things easier but also exclude a lot of languages. Another possibility would be to allow the whole byte range from \0 to \255. Then also golfing languages could participate, albeit to score them they would need to be converted to their byte form which usually contains a lot of unprintable characters. The score calculator is able to handle unprintables, but I don't know how to insert them into the text fields on TIO.&lt;/s&gt; All bytes from &lt;code&gt;\0&lt;/code&gt; to '\255' are allowed.&lt;/li&gt;&#xA;&lt;li&gt;Is the winning criterion suitable for answer chaining?&lt;/li&gt;&#xA;&lt;li&gt;A leader board snippet would be nice, but I don't know how to modify the existing ones. If someone could provide such a snippet, I would be very grateful.&lt;/li&gt;&#xA;&lt;li&gt;Relevant tags?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56433" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-12-16T18:34:11.753" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14012" PostTypeId="2" ParentId="2140" CreationDate="2017-10-02T20:11:46.693" Score="3" Body="&lt;h1&gt;Signed exponentiation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Let us define &lt;em&gt;signed exponentiation&lt;/em&gt; of a base &lt;strong&gt;x&lt;/strong&gt; to a power &lt;strong&gt;n&lt;/strong&gt; as this procedure:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Take the absolute value of &lt;strong&gt;x&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Raise to the power of &lt;strong&gt;n&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Re-apply the original sign of &lt;strong&gt;x&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Or, for a more mathematical (albeit slightly flawed) definition:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/i9OhY.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/i9OhY.png&quot; alt=&quot;the absolute value of x, to the power of n - 1, times x&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For this challenge, we will denote the signed exponentiation of &lt;strong&gt;x&lt;/strong&gt; to &lt;strong&gt;a&lt;/strong&gt; as &lt;strong&gt;x ' a&lt;/strong&gt;. Some notes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Unlike &lt;strong&gt;f(x) = x&lt;sup&gt;a&lt;/sup&gt;&lt;/strong&gt;, &lt;strong&gt;f(x) = x ' a&lt;/strong&gt; is defined for negative &lt;strong&gt;x&lt;/strong&gt; no matter the value of &lt;strong&gt;a&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The negative portion of the graph of &lt;strong&gt;x ' n&lt;/strong&gt; is the positive portion rotated halfway about the origin; hence, &lt;strong&gt;f(x) = x ' a&lt;/strong&gt; is an &lt;a href=&quot;https://en.wikipedia.org/wiki/Even_and_odd_functions#Odd_functions&quot; rel=&quot;nofollow noreferrer&quot;&gt;odd function&lt;/a&gt; for all values of &lt;strong&gt;a&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;strong&gt;a&lt;/strong&gt; is odd, &lt;strong&gt;x ' a = x&lt;sup&gt;a&lt;/sup&gt;&lt;/strong&gt; for all values of &lt;strong&gt;x&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;x ' 1 = x&lt;/strong&gt;, while &lt;strong&gt;x ' -1 = 1 / x&lt;/strong&gt;. &lt;strong&gt;x ' 0&lt;/strong&gt; is a sign function (&lt;strong&gt;+1&lt;/strong&gt; for positive &lt;strong&gt;x&lt;/strong&gt;, &lt;strong&gt;-1&lt;/strong&gt; for negative &lt;strong&gt;x&lt;/strong&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a base &lt;strong&gt;x&lt;/strong&gt; and a power &lt;strong&gt;n&lt;/strong&gt;, compute &lt;strong&gt;x ' n&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may assume that &lt;strong&gt;-9 &amp;le; x, n &amp;le; +9&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that &lt;strong&gt;x &amp;ne; 0&lt;/strong&gt;, for the sake of avoiding &lt;strong&gt;0 ' 0&lt;/strong&gt;, &lt;strong&gt;0 ' -1&lt;/strong&gt;, etc.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that &lt;strong&gt;1e-4 &amp;le; |x ' n| &amp;le; 1e9&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The output must be precise to at least 3 significant digits for the given test cases.&lt;/li&gt;&#xA;&lt;li&gt;Input/output may be taken/given in any standard format.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x, n -&amp;gt; output&#xA;1, 0 -&amp;gt; 1&#xA;3.14159, 0 -&amp;gt; 1&#xA;-9, 0 -&amp;gt; -1&#xA;7, 1 -&amp;gt; 7&#xA;-1.23456, 1 -&amp;gt; -1.23456&#xA;5, 2 -&amp;gt; 25&#xA;-4, 3 -&amp;gt; -64&#xA;0.1, 4 -&amp;gt; 0.0001&#xA;-9, 9 -&amp;gt; -387420489&#xA;1, -1 -&amp;gt; 1&#xA;-3, -1 -&amp;gt; -0.33333&#xA;5, -2 -&amp;gt; 0.04&#xA;2.71828, -9 -&amp;gt; 0.0001234&#xA;4, 0.5 -&amp;gt; 2&#xA;-2, 0.5 -&amp;gt; -1.41421&#xA;2, -0.5 -&amp;gt; 0.7071&#xA;3.8236, -1.6702 -&amp;gt; 0.10645&#xA;0.1, -9 -&amp;gt; 1000000000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so &lt;strong&gt;the shortest code in bytes in each langauge wins.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Could the definition be improved?&lt;/li&gt;&#xA;&lt;li&gt;Too many test cases? Are there any important ones missing?&lt;/li&gt;&#xA;&lt;li&gt;Any issues with the rules?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42545" LastEditorUserId="42545" LastEditDate="2018-04-07T01:37:07.640" LastActivityDate="2018-04-07T01:37:07.640" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="14017" PostTypeId="2" ParentId="2140" CreationDate="2017-10-03T21:02:48.887" Score="0" Body="&lt;h1&gt;Is my Sukkah Kosher?&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://judaism.stackexchange.com/questions/9146/why-is-it-necessary-to-ask-a-rabbi&quot;&gt;Do not rely on this text for questions of Jewish law!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;You will be given a floor plan of a &lt;a href=&quot;https://en.wikipedia.org/wiki/Sukkah&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;sukkah&lt;/em&gt;&lt;/a&gt; as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A rectangular 2D text (in any reasonable format).&lt;/li&gt;&#xA;&lt;li&gt;The first and last rows and columns will consist of printable ASCII (32-126).&lt;/li&gt;&#xA;&lt;li&gt;All interior characters will be spaces.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Determine if the &lt;em&gt;sukkah&lt;/em&gt; is acceptible according to these simplified rules, using the scale of one character width/height representing the &lt;a href=&quot;https://en.wikipedia.org/wiki/Biblical_and_Talmudic_units_of_measurement#Length_and_distance&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;tefach&lt;/em&gt;&lt;/a&gt; unit.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;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.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;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.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There must be an additional wall which is at least one unit long.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The walls may be made of any material, i.e. any character except space.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Walls with single unit gaps are still considered solid.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may answer with any two distinct values, but please specify if different from &lt;code&gt;true&lt;/code&gt;/&lt;code&gt;1&lt;/code&gt; and &lt;code&gt;false&lt;/code&gt;/&lt;code&gt;0&lt;/code&gt;. Explanations are appreciated.&lt;/p&gt;&#xA;&lt;h3&gt;Acceptable&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;oOOOo.ooo...o--o   &#xA;#              @   &#xA;#              )   &#xA;#              (   &#xA;#                  &#xA;|                  &#xA;#                  &#xA;+++++++*******     &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;oOOOo.ooo...o--o   &#xA;                     &#xA;                     &#xA;                 @   &#xA;                 @   &#xA;                 @   &#xA;                     &#xA;   +++++****         &#xA;   &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;o O o o o . o        &#xA;                     &#xA;                     &#xA;                 @&#xA;&#xA;                 @   &#xA;                 @   &#xA;                     &#xA;   +++++****        &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Not acceptable&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;oOOOo.ooo...o--o   &#xA;#              @   &#xA;#              )   &#xA;               (   &#xA;                   &#xA;|                  &#xA;#                  &#xA;++++      ****     &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;       oOOOo.ooo..&#xA;                     &#xA;                     &#xA;                 @   &#xA;                 @   &#xA;                 @   &#xA;                     &#xA;+++++****         &#xA;   &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;o O o o o . o        &#xA;                     &#xA;                     &#xA;                 @&#xA;&#xA;                 @   &#xA;                 @   &#xA;                 8  &#xA;                 8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-10-03T21:37:08.420" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14020" PostTypeId="2" ParentId="2140" CreationDate="2017-10-04T03:48:40.797" Score="0" Body="&lt;h2&gt;A Conc-urn-ing Problem&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You have a mysterious urn, which contains &lt;strong&gt;0 &amp;lt;= n &amp;lt;= 10&lt;/strong&gt; sets of &lt;strong&gt;k&lt;/strong&gt; balls. Each set of balls shares a numeric label, from zero to &lt;strong&gt;n-1&lt;/strong&gt;. 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.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Taking the recorded results of each of the trials yields an infinite sequence. For example, you might have for &lt;strong&gt;n=2, k=2&lt;/strong&gt; pulled: &lt;strong&gt;1001000000...&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given &lt;strong&gt;n&lt;/strong&gt; and &lt;strong&gt;k&lt;/strong&gt; 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.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sandbox&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;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 &lt;strong&gt;n=2&lt;/strong&gt; but rather quickly becomes tedious after that. Since most of the result would be symmetric, would it make sense to only require the &quot;first&quot; result? This also seems like it removes too much of the interest in the problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="31625" LastActivityDate="2017-10-04T03:48:40.797" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14027" PostTypeId="2" ParentId="2140" CreationDate="2017-10-05T18:28:15.107" Score="1" Body="&lt;h1&gt;Is it Odd or Even&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A group is an &quot;Odd or Even group&quot; if there is some member &lt;strong&gt;a&lt;/strong&gt; such that every member in the group can be represented as either &lt;strong&gt;k • k&lt;/strong&gt; or &lt;strong&gt;k • k • a&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example the group &lt;strong&gt;Z&lt;sub&gt;4&lt;/sub&gt;&lt;/strong&gt; is an even odd group if &lt;strong&gt;a = 1&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 = 2 • 2             Even&#xA;1 = 2 • 2 • 1         Odd&#xA;2 = 1 • 1             Even&#xA;3 = 1 • 1 • 1         Odd&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The even and odd members can overlap, for example in &lt;strong&gt;Z&lt;sub&gt;5&lt;/sub&gt;&lt;/strong&gt; if &lt;strong&gt;a =1&lt;/strong&gt; every member is both even and odd.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 = 0 • 0 = 2 • 2 • 1 Even and Odd&#xA;1 = 3 • 3 = 0 • 0 • 1 Even and Odd&#xA;2 = 1 • 1 = 3 • 3 • 1 Even and Odd&#xA;3 = 4 • 4 = 1 • 1 • 1 Even and Odd&#xA;4 = 2 • 2 = 4 • 4 • 1 Even and Odd&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;An example of a group that is not an Even or Odd group is the Klein-4 group (&lt;strong&gt;Z&lt;sub&gt;2&lt;/sub&gt;×Z&lt;sub&gt;2&lt;/sub&gt;&lt;/strong&gt;), because &lt;strong&gt;k + k = 0&lt;/strong&gt; for all &lt;strong&gt;k&lt;/strong&gt; meaning there can be only one even member and one odd member despite there being 4 members of the group.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given the Cayley table of a finite group determine if it is a Odd or Even group.  You will be guaranteed that the input is a group, but you will not be guaranteed anything else.  This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; so your code should output two distinct values one for accept and one for reject.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answers will be scored in bytes with fewer bytes being better.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;True&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 1&#xA;1 0&#xA;&#xA;0 1 2 3&#xA;1 2 3 0&#xA;2 3 0 1&#xA;3 0 1 2&#xA;&#xA;0 1 2 3 4&#xA;1 2 3 4 0&#xA;2 3 4 0 1&#xA;3 4 0 1 2&#xA;4 0 1 2 3&#xA;&#xA;0 1 2 3 4 5&#xA;1 0 4 5 2 3&#xA;2 5 0 4 3 1&#xA;3 4 5 0 1 2&#xA;4 3 1 2 5 0&#xA;5 2 3 1 0 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;False&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 1 2 3&#xA;1 0 3 2&#xA;2 3 0 1&#xA;3 2 1 0&#xA;&#xA;0 1 2 3 4 5 6 7&#xA;1 2 3 0 5 6 7 4&#xA;2 3 0 1 6 7 4 5&#xA;3 0 1 2 7 4 5 6&#xA;4 5 6 7 0 1 2 3&#xA;5 6 7 4 1 2 3 0&#xA;6 7 4 5 2 3 0 1&#xA;7 4 5 6 3 0 1 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-10-06T03:05:19.080" LastActivityDate="2017-10-06T03:05:19.080" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="14031" PostTypeId="2" ParentId="2140" CreationDate="2017-10-06T11:51:57.080" Score="4" Body="&lt;h2&gt;Zoom box drawing characters&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here are some sample box drawing characters:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  ╷&#xA; ┌┴┐&#xA;╶┤ ├╴&#xA; └┬┘&#xA;  ╵&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;How do we zoom them? Well, we need to triple their size. The result looks like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;      ╻&#xA;      ┃&#xA;      ┃&#xA;   ┏━━┻━━┓&#xA;   ┃     ┃&#xA;   ┃     ┃&#xA;╺━━┫     ┣━━╸&#xA;   ┃     ┃&#xA;   ┃     ┃&#xA;   ┗━━┳━━┛&#xA;      ┃&#xA;      ┃&#xA;      ╹&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As you can see, what happens is this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each box drawing character is replaced by its heavy version (for extra thickness)&lt;/li&gt;&#xA;&lt;li&gt;The box drawing characters are extended using the heavy horizontal and heavy vertical characters, resulting in a separation of three between the original characters&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You can use any reasonable character I/O format. You will only need to support spaces and the 15 basic box drawing characters, plus newlines if you need them as line separators. You can only require rectangular input, but your output may contain arbitrary whitespace padding, except on the left, so that the characters in the zoomed image are aligned.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest solution in bytes that violates no standard loopholes wins, but if you're using UTF-8 encoding then you can score all box drawing characters as 1 each.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2017-10-06T11:51:57.080" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14033" PostTypeId="2" ParentId="2140" CreationDate="2017-10-06T20:38:42.480" Score="-1" Body="&lt;h1&gt;Is it a perfect loop? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to take a GIF or an animated image in any reasonable format as input (including taking the file name of a GIF in  the current directory), and output whether it is a &quot;perfect loop&quot; - that is, the frames transition seamlessly from the end to the start, and a human cannot notice where it starts and ends at first glance. Return or print a truthy value if it is a perfect loop, otherwise print or return a falsy value.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Winners will be determined from the percentage of test cases they get correct. In the event of a tie, highest votes wins. You can view test cases at &lt;a href=&quot;https://ghostbin.com/paste/m3yaw&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://ghostbin.com/paste/m3yaw&lt;/a&gt;. Show your score against the test cases when you post.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you are not taking input in a GIF, please provide a program that will convert a GIF to your desired format.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Images corresponding to a truthy value have been taken from &lt;a href=&quot;http://reddit.com/r/perfectloops&quot; rel=&quot;nofollow noreferrer&quot;&gt;/r/perfectloops&lt;/a&gt; and for falsy test cases, &lt;a href=&quot;http://reddit.com/r/almostperfectloops&quot; rel=&quot;nofollow noreferrer&quot;&gt;/r/almostperfectloops&lt;/a&gt; and &lt;a href=&quot;http://reddit.com/r/gifs&quot; rel=&quot;nofollow noreferrer&quot;&gt;/r/gifs&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Restrictions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Hard coding is not allowed (violates standard loophole &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2507/26600&quot;&gt;1&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1063/26600&quot;&gt;2&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;li&gt;You must provide consistent results for the same GIF (no randomness)&lt;/li&gt;&#xA;&lt;li&gt;Remember, this is not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so byte count is not needed in your solution. Just post the language name and add the percentage correct when I comment.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="26600" LastEditorUserId="26600" LastEditDate="2017-10-17T19:30:08.540" LastActivityDate="2017-10-17T19:30:08.540" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14034" PostTypeId="2" ParentId="2140" CreationDate="2017-10-07T11:18:25.673" Score="0" Body="&lt;h1&gt;Search Stack Overflow for Duplicates&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The Stack Overflow search algorithm has been &lt;a href=&quot;https://meta.stackoverflow.com/q/357462/5223757&quot;&gt;under fire&lt;/a&gt; recently. Several problems with the search algorithm being flawed exist, but one of the most important issues raised is with duplicates:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;[...] 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. – &lt;a href=&quot;https://meta.stackoverflow.com/users/1889329/iinspectable&quot;&gt;IInspectable&lt;/a&gt; &lt;a href=&quot;https://meta.stackoverflow.com/a/357464/5223757#comment520365_357464&quot;&gt;(source)&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;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.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;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. &lt;em&gt;(Sandbox note: How fast are the Stack Exchange servers? What conversion factor should I use to test on my hardware?)&lt;/em&gt; You have access to all T-SQL database tables available from the &lt;a href=&quot;https://data.stackexchange.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Stack Exchange Data Explorer&lt;/a&gt;, 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 &quot;not in the list&quot; 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. &lt;em&gt;(Sandbox note: How to score this?)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(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.)&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="43394" LastActivityDate="2017-10-07T11:18:25.673" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14035" PostTypeId="2" ParentId="14002" CreationDate="2017-10-07T18:00:17.267" Score="5" Body="&lt;h1&gt;Choose the right size of proof&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;On thing I think is important is that when designing a question you choose a proof that is the right size.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A proof that is too small will only have an optimal answer which people might find in a matter of minutes.  A proof that is too large might never get an answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Neither of these is optimal so you should keep in mind the size of the proof when writing the questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Personally I think if your first solution is around 40 steps that should make a good problem, at least for the abstract algebra style proof.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-10-07T18:00:17.267" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14039" PostTypeId="2" ParentId="2140" CreationDate="2017-10-08T08:47:44.290" Score="-4" Body="&lt;p&gt;&lt;strong&gt;Of numbers of letters&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;there is something special the number 4. When spelled in English the word 'four' uses exactly 4 letters. I wonder whether there are further such numbers Your task is to identify whether there exist further such numbers and output them in any human readable format. To make this more of a challenge you can do the task in any regional Language of your choice (Say Russian or Portuguese or Spanish or Mandarin or Hindi etc.).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Best entry will be selected by the most number of such numbers regardless of language used&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Best of Luck&lt;/p&gt;&#xA;" OwnerUserId="59502" LastEditorUserId="59502" LastEditDate="2017-10-08T13:01:17.323" LastActivityDate="2017-10-08T13:01:17.323" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14041" PostTypeId="2" ParentId="2140" CreationDate="2017-10-08T19:30:52.167" Score="0" Body="&lt;h1&gt;Constructively golf &lt;em&gt;true&lt;/em&gt; primes!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;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 &lt;em&gt;build&lt;/em&gt; primes and include a certificate that the result is actually a prime.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;A positive integer &lt;code&gt;n&lt;/code&gt; denoting the length of the resultung prime in a basis of your choice.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;A list of primes in the base you picked above, one of these primes is of length &lt;code&gt;n&lt;/code&gt; and one of these primes is smaller than 20.&lt;/p&gt;&#xA;&lt;h2&gt;What to do?&lt;/h2&gt;&#xA;&lt;p&gt;Your challenge is to generate a prime of length &lt;code&gt;n&lt;/code&gt; of which the primality can be reduced to the primality of one of the following primes: &lt;code&gt;[2,3,5,7,11,13,17,19]&lt;/code&gt;. This can be achieved using &lt;a href=&quot;https://en.wikipedia.org/wiki/Pocklington_primality_test#Pocklington_criterion&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pocklington's criterion&lt;/a&gt;. 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.&lt;/p&gt;&#xA;&lt;p&gt;For your convenience, I shall reproduce the relevant theorem here:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Let &lt;code&gt;N&amp;gt;1&lt;/code&gt; be an integer and suppose there exist &lt;code&gt;a,q&lt;/code&gt; such that&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;q&lt;/code&gt; is prime&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;q&lt;/code&gt; divides &lt;code&gt;N-1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;q&amp;gt;sqrt(N)-1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;a^(N-1) mod N == 1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;gcd(a^((N-1)/q)-1,N)=1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Then &lt;code&gt;N&lt;/code&gt; is prime.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;And as you might see, your initial set of primes (as candidates for &lt;code&gt;q&lt;/code&gt;) is limited to the above short list of primes smaller than 20.&lt;/p&gt;&#xA;&lt;h2&gt;Who wins?&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest solution in bytes wins!&lt;br&gt;&#xA;However this is also &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt; so all solutions must run in (expected) polynomial time in &lt;code&gt;n&lt;/code&gt;. Standard IO and Loophole rules apply.&lt;/p&gt;&#xA;&lt;h2&gt;Got any help?&lt;/h2&gt;&#xA;&lt;p&gt;If you need algorithmic help, I suggest you consult the &lt;em&gt;&lt;a href=&quot;http://cacr.uwaterloo.ca/hac/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Handbook of Applied Cryptography&lt;/a&gt;&lt;/em&gt;, chapter 4 (&lt;a href=&quot;http://cacr.uwaterloo.ca/hac/about/chap4.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;PDF&lt;/a&gt;), algorithm 4.62 (on page 153 or 22 in the PDF) or you independently look for &lt;em&gt;Maurer's prime generation algorithm&lt;/em&gt; (originally published &lt;a href=&quot;https://link.springer.com/article/10.1007/BF00202269&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;).&lt;/p&gt;&#xA;" OwnerUserId="55329" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-10-08T19:30:52.167" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14042" PostTypeId="2" ParentId="2140" CreationDate="2017-10-09T00:47:03.327" Score="1" Body="&lt;h1&gt;Evaluate a Starting Position in a Partitioning Game&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Two players play a partitioning game.  At the start of the game, there are &lt;code&gt;n&lt;/code&gt; stones, all in a single heap.  When a player takes a turn, they must divide an existing heap into two, ensuring that every heap still has a distinct size.  The game is over when a player has no legal moves; that player loses.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, suppose that Max and Min are playing with &lt;code&gt;n=6&lt;/code&gt;.  Initially it is Max's turn, and he divides the starting heap into a heap of size one and a heap of size five.  Min then divides the heap of size five into heaps of size two and three (her only option because she cannot make another heap of size one).  Max, seeing heaps of size one, two, and three, has no legal move and loses.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Alternatively, Max could have split the size-six heap into heaps of size two and four.  But then Min could not split the heap of size two (she would end up with both new heaps having size one), nor could she split the heap of size four evenly (for the same reason), so she would be forced to split the heap of size four into heaps of size one and three.  Max would have lost anyway.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since Max, the player to move first, has no winning strategy at &lt;code&gt;n=6&lt;/code&gt;, call six a &lt;strong&gt;losing number&lt;/strong&gt;.  Similarly, call values of &lt;code&gt;n&lt;/code&gt; for which Max can win (at least if he plays cleverly) &lt;strong&gt;winning numbers&lt;/strong&gt;.  Max wants a way to distinguish winning and losing numbers for his upcoming rematch against Min.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that, given an &lt;code&gt;n&lt;/code&gt;, returns or outputs one value for losing numbers and a distinct value for winning numbers.  For testing purposes, the first 50 winning numbers are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3, 4, 5, 10, 11, 12, 13, 14, 21, 22, 23, 24, 25, 26, 27, 36, 37, 38, 39, 40, 41, 42, 43, 44, 46, 55, 57, 58, 59, 60, 61, 62, 63, 64, 65, 67, 78, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(This sequence is related to, but distinct from &lt;a href=&quot;https://oeis.org/A161983&quot; rel=&quot;nofollow noreferrer&quot;&gt;A161983&lt;/a&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rules and scoring are as usual for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.  The checkmark will go to an answer with well-explained and/or especially clever golfing, even if it doesn't compete with terser languages.&lt;/p&gt;&#xA;" OwnerUserId="58651" LastActivityDate="2017-10-09T00:47:03.327" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14044" PostTypeId="2" ParentId="2140" CreationDate="2017-10-10T04:50:11.920" Score="0" Body="&lt;h1&gt;I got them Mad Matrix Moves&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graph-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graph-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;graph-theory&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Given a list of edges representing a simple directed graph and (optionally) the number of vertices &lt;code&gt;n&amp;gt;1&lt;/code&gt;, output the &lt;a href=&quot;https://en.wikipedia.org/wiki/Adjacency_matrix&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;adjacency matrix&lt;/strong&gt;&lt;/a&gt; of that graph.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The vertices will always be numbered &lt;strong&gt;consecutively&lt;/strong&gt; starting at &lt;code&gt;0&lt;/code&gt; (or &lt;code&gt;1&lt;/code&gt; -- your choice). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The adjacency matrix is defined as the &lt;code&gt;n&lt;/code&gt; by &lt;code&gt;n&lt;/code&gt; square matrix &lt;code&gt;M&lt;/code&gt; such that &lt;code&gt;M[i][j]&lt;/code&gt; is &lt;code&gt;1&lt;/code&gt; if there is an edge from vertex &lt;code&gt;i&lt;/code&gt; to vertex &lt;code&gt;j&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt; otherwise. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For this example and the test cases, we will have the vertices numbered starting at &lt;code&gt;1&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's use the sample input &lt;code&gt;[(1,2),(1,3),(3,2)]&lt;/code&gt;. Since there are vertices numbered &lt;code&gt;1-3&lt;/code&gt;, &lt;code&gt;n=3&lt;/code&gt; and our output is a &lt;code&gt;3 x 3&lt;/code&gt; matrix.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output should be &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[0, 1, 1],    &amp;lt;= (1,1) doesn't exist in the input list, (1,2) does, (1,3) does.&#xA; [0, 0, 0],    &amp;lt;= (2,1) doesn't exist, same with (2,2) and (2,3)&#xA; [0, 1, 0]]    &amp;lt;= (3,1) doesn't exist, (3,2) does, and (3,3) doesn't&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(concisely represented as &lt;code&gt;[[0,1,1],[0,0,0],[0,1,0]]&lt;/code&gt; in test cases).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Notes&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Every vertex is the start and/or end of at least one edge.&lt;/li&gt;&#xA;&lt;li&gt;You may replace &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt; in the output with any two consistent distinct values of your choosing.&lt;/li&gt;&#xA;&lt;li&gt;The input graph is simple, meaning that it has no loops nor multiple edges (e.g. no edge &lt;code&gt;[1,1]&lt;/code&gt; or graph &lt;code&gt;[[1,2],[1,2]]&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;The graph is directed, meaning that each edge has a start and an edge (e.g. the edge &lt;code&gt;[1,2]&lt;/code&gt; is distinct from &lt;code&gt;[2,1]&lt;/code&gt;)  &lt;/li&gt;&#xA;&lt;li&gt;Every vertex is an endpoint of at least one edge&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in byes in each language wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;One test case per line. Each test case is in the format &lt;code&gt;edges, n =&amp;gt; output&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;&lt;code&gt;[(1,2)], 2 =&gt; [[0,1],[0,0]]&#xA;[(2,1)], 2 =&gt; [[0,0],[1,0]]&#xA;[(1,2),(2,1)], 2 =&gt; [[0,1],[1,0]]&#xA;[(1,2),(1,3),(3,2)], 3 =&gt; [[0,1,1],[0,0,0],[0,1,0]]&#xA;[(1,2),(2,3),(3,4),(4,5)], 5 =&gt; [[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]]&#xA;[(1,2),(3,4),(4,3),(2,1),(2,4),(4,2)], 4 =&gt; [[0,1,0,0],[1,0,0,1],[0,0,0,1],[0,1,1,0]]&#xA;[(1,2),(2,3),(3,4),(4,5),(2,1),(3,2),(4,3),(5,4)], 5 =&gt; [[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]]&#xA;[(1,2),(3,1),(2,3),(1,1),(2,1)], 3 =&gt; [[1,1,0],[1,0,1],[1,0,0]]&#xA;[(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 =&gt; [[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]]&lt;/code&gt;&#xA;&lt;/pre&gt;&#xA;" OwnerUserId="68261" LastActivityDate="2017-10-10T04:50:11.920" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14047" PostTypeId="2" ParentId="2140" CreationDate="2017-10-10T23:22:38.980" Score="0" Body="&lt;h1&gt;Get the Average Number of Bytes for an Answer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;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! &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;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: &quot;/&quot;. The link may not be to a code-golf challenge specifically, but it could be something like a code-challenge. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If the user inputs something that isn't to a code golf website output something along the lines of &quot;Hey! That's not a link to a code-golf challenge&quot; 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. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;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. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;All answers should be rounded to the nearest whole number with .5 rounding up. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;https://codegolf.stackexchange.com/questions/54038/average-out-two-lists&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;95&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winning Criterion&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The winner will be given by (1 / execution time (s) + bytes).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you know of anything that I missed, comment below. &lt;/p&gt;&#xA;" OwnerUserId="75088" LastEditorUserId="75088" LastEditDate="2017-10-11T00:47:29.360" LastActivityDate="2017-10-11T00:47:29.360" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="14048" PostTypeId="2" ParentId="2140" CreationDate="2017-10-11T08:48:27.783" Score="0" Body="&lt;h1&gt;&lt;strong&gt;Optimised Hashing&lt;/strong&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hashing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hashing&amp;#39;&quot; rel=&quot;tag&quot;&gt;hashing&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-generation&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-generation&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For a given set of input, output a program that can 'hash' the input with a minimum number of collisions.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;strong&gt;The Challenge&lt;/strong&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;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&amp;lt;100 and is unique for that input.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;strong&gt;The Input&lt;/strong&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each program will be tested with 4 different input sets of 50 unique Strings;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;50 English words of the same length.&lt;/li&gt;&#xA;&lt;li&gt;50 English words of differing lengths.&lt;/li&gt;&#xA;&lt;li&gt;50 randomly generated character strings of the same length&lt;/li&gt;&#xA;&lt;li&gt;50 randomly generated character strings of differing lengths&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;All&lt;/em&gt; 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.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;strong&gt;Special Rules&lt;/strong&gt;&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard loopholes are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;Inbuilt hashing functions are not allowed.&lt;/li&gt;&#xA;&lt;li&gt;You must provide a free and easily accessible environment to compile and run both programs with your answer.&lt;/li&gt;&#xA;&lt;li&gt;I reserve the right to discount any program which takes more than 10 minutes to complete any test.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You will be scored by combining the following;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The byte count of your original program&lt;/li&gt;&#xA;&lt;li&gt;The byte count of each outputted program&lt;/li&gt;&#xA;&lt;li&gt;5 penalty points for each 'collision'.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I will keep and update a leader board as programs are added and I can test them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please let me know if I've missed anything; this is my first question idea!&lt;/p&gt;&#xA;" OwnerUserId="75077" LastActivityDate="2017-10-11T08:48:27.783" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14049" PostTypeId="2" ParentId="202" CreationDate="2017-10-11T15:52:48.997" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;http://torso.me/chicken&quot; rel=&quot;nofollow noreferrer&quot;&gt;Chicken&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The language's homepage has an interpreter built-in.&lt;/p&gt;&#xA;" OwnerUserId="38183" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-10-11T15:52:48.997" CommentCount="0" CommunityOwnedDate="2017-10-11T15:52:48.997" ContentLicense="CC BY-SA 3.0" />
  <row Id="14055" PostTypeId="5" CreationDate="2017-10-12T18:44:47.660" Score="0" Body="&lt;p&gt;This tag should also be used on questions about closing questions in general, not only on questions about specific closed questions.&lt;/p&gt;&#xA;&lt;p&gt;Consider also using the &lt;a href=&quot;/questions/tagged/specific-question&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;specific-question&amp;#39;&quot; rel=&quot;tag&quot;&gt;specific-question&lt;/a&gt; if your question is about why a specific question was closed.&lt;/p&gt;&#xA;&lt;p&gt;If your question is about a specific closure reason, consider using one of the following tags:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/questions/tagged/duplicates&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;duplicates&amp;#39;&quot; rel=&quot;tag&quot;&gt;duplicates&lt;/a&gt;: If the question is about the duplicate close reason.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Additionally, use the &lt;a href=&quot;/questions/tagged/reopening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;reopening&amp;#39;&quot; rel=&quot;tag&quot;&gt;reopening&lt;/a&gt; if your question is about reopening a specific closed question.&lt;/p&gt;&#xA;" OwnerUserId="-1" LastEditorUserId="66833" LastEditDate="2021-04-11T15:35:31.917" LastActivityDate="2021-04-11T15:35:31.917" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="14056" PostTypeId="4" CreationDate="2017-10-12T18:44:47.660" Score="0" Body="General questions about questions that have been closed because they do not meet the criteria defined in the FAQ." OwnerUserId="63550" LastEditorUserId="56656" LastEditDate="2020-02-03T17:26:42.647" LastActivityDate="2020-02-03T17:26:42.647" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="14057" PostTypeId="1" AcceptedAnswerId="14058" CreationDate="2017-10-12T18:45:17.633" Score="8" ViewCount="552" Body="&lt;p&gt;The question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/139355/output-a-number-bigger-than-tree3&quot;&gt;output a number bigger than TREE(3)&lt;/a&gt; was closed as unclear what you are asking. I like the idea behind the question and would like to edit and reopen it. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;To start I'm not even fully sure why it was closed. I get the phrasing was confusing, but the idea behind it is pretty simple.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Write the shortest program you can that doesn't take input,&#xA;eventually terminates and outputs a number bigger than TREE(3).&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Is it a good idea to edit and reopen it? Is making a new question better (I don't think I have the required privileges)? Or is their something more fundamentally wrong with the idea?&lt;/p&gt;&#xA;" OwnerUserId="63550" LastActivityDate="2017-10-14T12:13:24.057" Title="Should Output a number bigger than TREE(3) be edited an reopened?" Tags="|discussion|code-golf|closed-questions|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14058" PostTypeId="2" ParentId="14057" CreationDate="2017-10-12T21:50:40.443" Score="10" Body="&lt;p&gt;There's nothing fundamentally wrong with the idea. My primary reason for voting to close as unclear was given in a comment*, and I don't think it's been adequately addressed yet. Others may have voted to close on the basis that the question is too dependent on external links and should be edited to be more self-contained. If those two issues are addressed, I don't see why it couldn't be reopened.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;* Said comment:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&quot;&lt;em&gt;It can be an integer, float, or any other number type that language supports. This number must be bigger than what is known as TREE(3).&lt;/em&gt;&quot; Normally for this kind of question we assume that big integers are unbounded (despite the practical bounds imposed by implementation), but I don't recall any previous similar question which allowed floats and I'm not sure how to interpret this permission.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="194" LastEditorUserId="194" LastEditDate="2017-10-13T20:14:06.013" LastActivityDate="2017-10-13T20:14:06.013" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="14059" PostTypeId="2" ParentId="2140" CreationDate="2017-10-12T22:10:42.587" Score="6" Body="&lt;h2&gt;2 Spooky 4 Me&lt;/h2&gt;&#xA;&lt;p&gt;In terms of halloween, some things are just too spooky for me... Feel like we need some serious &lt;em&gt;&lt;strong&gt;doots&lt;/strong&gt;&lt;/em&gt; from skeletons to fuel our hallowed weens. So, in the spirit of that end, print the following, exactly as it is shown, if and only if the input &lt;em&gt;&lt;strong&gt;does not equal &amp;quot;DOOT&amp;quot; (in all caps ONLY)&lt;/strong&gt;&lt;/em&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;               _.---._&#xA;             .'       '.&#xA;             :)       (:&#xA;             \ (@) (@) /&#xA;              \   A   /&#xA;               )     (&#xA;               \&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;/&#xA;                '._.'&#xA;                 .=.&#xA;         .---._.-.=.-._.---.&#xA;        / ':-(_.-: :-._)-:' \&#xA;       / /' (__.-: :-.__) '\ \&#xA;      / /  (___.-' '-.___)  \ \&#xA;     / /   (___.-'^'-.___)   \ \&#xA;    / /    (___.-'='-.___)    \ \&#xA;   / /     (____.'='.____)     \ \&#xA;  / /       (___.'='.___)       \ \&#xA; (_.:       '---'.=.'---'       :._)&#xA; :||        __  _.=._  __        ||:&#xA; :||       (  '.-.=.-.'  )       ||:&#xA; :||       \    '.=.'    /       ||:&#xA; :||        \    .=.    /        ||:&#xA; :||       .-'.'-._.-'.'-.       ||:&#xA;.:::\      ( ,): O O :(, )      /:::.&#xA;|||| '     / /''--'--''\ \     ' ||||&#xA;''''      / /           \ \      ''''&#xA;         / /             \ \&#xA;        / /               \ \&#xA;       / /                 \ \&#xA;      / /                   \ \&#xA;     / /                     \ \&#xA;    /.'                       '.\&#xA;   (_)'                       '(_)&#xA;    \\.                       .//&#xA;     \\.                     .//&#xA;      \\.                   .//&#xA;       \\.                 .//&#xA;        \\.               .//&#xA;         \\.             .//&#xA;          \\.           .//&#xA;          ///)         (\\\&#xA;        ,///'           '\\\,&#xA;       ///'               '\\\&#xA;      &amp;quot;&amp;quot;'                   '&amp;quot;&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;However, if the input &lt;em&gt;&lt;strong&gt;DOES equal &amp;quot;DOOT&amp;quot;&lt;/strong&gt;&lt;/em&gt;, in all caps only, print this instead:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;               _.---._&#xA;             .'       '.&#xA;             :)       (:&#xA;             \ (@) (@) /&#xA;              \   A   /&#xA;               )     (&#xA;               \&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;/&#xA;                '._.'          ' ''''    _''|&#xA;                 .=.       @=====***===::_  |&#xA;         .---._.-.=.-._.---. (( \-@|_) )) `.|&#xA;        / ':-(_.-: :-._)-:' \ ]--------'&amp;quot;&#xA;       / /' (__.-: :-.__) '\ \   ||:&#xA;      / /  (___.-' '-.___)  \ \  ||:&#xA;     / /   (___.-'^'-.___)   \ \ ||:&#xA;    / /    (___.-'='-.___)    \ \||:&#xA;   / /     (____.'='.____)     \ ||:&#xA;  / /       (___.'='.___)       \||:&#xA; (_.:       '---'.=.'---'       :._)&#xA; :||        __  _.=._  __       &#xA; :||       (  '.-.=.-.'  )      &#xA; :||       \    '.=.'    /       &#xA; :||        \    .=.    /      &#xA; :||       .-'.'-._.-'.'-.       &#xA;.:::\      ( ,): O O :(, )   &#xA;|||| '     / /''--'--''\ \    &#xA;''''      / /           \ \&#xA;         / /             \ \&#xA;        / /               \ \&#xA;       / /                 \ \&#xA;      / /                   \ \&#xA;     / /                     \ \&#xA;    /.'                       '.\&#xA;   (_)'                       '(_)&#xA;    \\.                       .//&#xA;     \\.                     .//&#xA;      \\.                   .//&#xA;       \\.                 .//&#xA;        \\.               .//&#xA;         \\.             .//&#xA;          \\.           .//&#xA;          ///)         (\\\&#xA;        ,///'           '\\\,&#xA;       ///'               '\\\&#xA;      &amp;quot;&amp;quot;'                   '&amp;quot;&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Trailing newlines and spaces are allowed.&lt;/li&gt;&#xA;&lt;li&gt;The design is horizontally symmetric, if you find inconsistencies let me know.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.youtube.com/watch?v=ypCfdrARoLQ&quot; rel=&quot;nofollow noreferrer&quot;&gt;Doot it up&lt;/a&gt;, and enjoy!&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogrov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogrov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogrov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;(Yes, I'm going to make it more official when posting on the actual SE)&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-10-17T14:28:10.353" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14064" PostTypeId="2" ParentId="2140" CreationDate="2017-10-13T17:38:52.560" Score="0" Body="&lt;h1&gt;Hunting The Wren&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program to produce the words to the folk song &lt;em&gt;Hunting The Wren&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.youtube.com/watch?v=80n4CW0dE1A&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.youtube.com/watch?v=80n4CW0dE1A&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;We're hunting the wren.&quot; says Robin to Bobbin.&#xA;&quot;We're hunting the wren.&quot; says Richard to Robin.&#xA;&quot;We're hunting the wren.&quot; says Jack of the land.&#xA;&quot;We're hunting the wren.&quot; says everyone.&#xA;&#xA;&quot;Where oh where?&quot; says Robin to Bobbin.&#xA;&quot;Where oh where?&quot; says Richard to Robin.&#xA;&quot;Where oh where?&quot; says Jack of the land.&#xA;&quot;Where oh where?&quot; says everyone.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The song continues with the same structure.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;In yonder green bush.&quot;&#xA;&quot;How get him down?&quot;&#xA;&quot;With sticks and stones.&quot;&#xA;&quot;How get him home?&quot;&#xA;&quot;The brewer's big cart.&quot;&#xA;&quot;How will we eat him?&quot;&#xA;&quot;With knives and forks.&quot;&#xA;&quot;Who'll come to the dinner?&quot;&#xA;&quot;The King and the Queen.&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The song concludes with three more verses, which because they have no repetition, we'll omit for the purposes of this challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program must produce the full words of the song as 54 or 55 lines of text.&lt;/li&gt;&#xA;&lt;li&gt;Each verse of four lines must be separated by a blank line. A blank line on the end is optional.&lt;/li&gt;&#xA;&lt;li&gt;You must not use a text decompression library. (GZIP the whole song is 380 bytes.)&lt;/li&gt;&#xA;&lt;li&gt;Normal code golf rules apply. Shortest code wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;C# Reference Implementation&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;public class Program&#xA;{&#xA;  public static void Main()&#xA;  {&#xA;    string[] starts = new [] {&#xA;      &quot;We're hunting the wren.&quot;,  &#xA;      &quot;Where oh where?&quot;,            &quot;In yonder green bush.&quot;,&#xA;      &quot;How get him down?&quot;,          &quot;With sticks and stones.&quot;,&#xA;      &quot;How get him home?&quot;,          &quot;The brewer's big cart.&quot;,&#xA;      &quot;How will we eat him?&quot;,       &quot;With knives and forks.&quot;,&#xA;      &quot;Who'll come to the dinner?&quot;, &quot;The King and the Queen.&quot; };&#xA;&#xA;    string[] ends = new [] {&#xA;      &quot;says Robin to Bobbin.&quot;,      &quot;says Richard to Robin.&quot;,&#xA;      &quot;says Jack of the land.&quot;,     &quot;says everyone.&quot;            };&#xA;&#xA;    foreach (string start in starts)&#xA;    {&#xA;      foreach (string end in ends)&#xA;      {&#xA;        System.Console.WriteLine(&quot;\&quot;&quot; + start + &quot;\&quot; &quot; + end);       &#xA;      }&#xA;      System.Console.WriteLine();&#xA;    }&#xA;  }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="20793" LastEditorUserId="20793" LastEditDate="2017-10-13T18:11:26.993" LastActivityDate="2017-10-13T18:11:26.993" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14065" PostTypeId="2" ParentId="2140" CreationDate="2017-10-13T20:11:04.000" Score="-3" Body="&lt;h1&gt;Be typically flexible efficiently&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a short function that returns outputs of different types in a non-boring way. If &lt;em&gt;L&lt;/em&gt; is the length of your code and &lt;em&gt;T&lt;/em&gt; is the number of different types returned, your score is (&lt;em&gt;T&lt;/em&gt;−1)/&lt;em&gt;L.&lt;/em&gt; The highest score wins.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The function must take exactly one argument and be deterministic, i.e., the output depends only on the input.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Obviously your programming language must have an official notion of &lt;em&gt;type,&lt;/em&gt; by which each object has a unique, clearly identified type.&#xA;Typically this would manifest in a &lt;code&gt;type&lt;/code&gt; or &lt;code&gt;typeof&lt;/code&gt; function returning an object’s type.&#xA;Also, it must obviously allow functions to have differently typed returns.&lt;br&gt;&#xA;If there are many separate typing systems in your language, you have to pick one (conforming with the above) and stick to it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The function must not employ any conditional constructs or other language features whose primary purpose is to handle logic, such as &lt;code&gt;if&lt;/code&gt; statements, loops, or logical conjunctions. (Obviously, employed predefined functions need not adhere to this.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;All inputs needed to produce the outputs used for scoring as well as any elements of &lt;a href=&quot;https://en.wikipedia.org/wiki/Container_(abstract_data_type)&quot; rel=&quot;nofollow noreferrer&quot;&gt;container structures&lt;/a&gt; must adhere to the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;They are all of the same type.&lt;/li&gt;&#xA;&lt;li&gt;If they are functions or otherwise callable (and actually called in your program), they must consistently return objects of the same type.&lt;/li&gt;&#xA;&lt;li&gt;They must not be classes, type identifiers, or similar.&lt;/li&gt;&#xA;&lt;li&gt;If they are strings, they are treated (with respect to these rules) as any obvious interpretation of them as code, class names, or similar.&lt;/li&gt;&#xA;&lt;li&gt;If they are containers themselves, their elements must adhere to these rules when taken together.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So, e.g., in Python the following are invalid:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;a = lambda i: [ 0, 0., [], {}, (0), {0} ][i]&#xA;b = lambda i: [ int, float, list, dict, tuple, set ][i]()&#xA;c = lambda i: [ [0], [0.], [[]], [{}], [(0)], [{0}] ][i][0]&#xA;d = eval   # using &quot;0&quot;, &quot;0.&quot;, &quot;[]&quot;, &quot;{}&quot;, … as input&#xA;e = lambda i: eval( [&quot;0&quot;,&quot;0.&quot;,&quot;[]&quot;,&quot;{}&quot;,&quot;(0)&quot;,&quot;{0}&quot;][i] )&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This also applies to containers generated during by the function during its execution. (Obviously, this does not apply to such objects if used internally by employed predefined functions.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Valid (ungolfed) example&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Python:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;def f(i):&#xA;    return sum([2.][0:i])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For this we have:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f(0) == 0&#xA;type(f(0)) == int&#xA;f(1) == 2.0&#xA;type(f(1)) == float&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This makes use of the fact that the &lt;code&gt;sum&lt;/code&gt; of an empty iterable (like &lt;code&gt;[2.][0:0]&lt;/code&gt;) is &lt;code&gt;0&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;I am pondering whether I should replace a portion of the rules with a catch-all like:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If whatever trick you use to acquire &lt;em&gt;n&lt;/em&gt; types of output can be used to obtain &lt;em&gt;n&lt;/em&gt;+1 types of output, it is invalid. (If &lt;em&gt;n&lt;/em&gt;+1 just doesn’t work because &lt;em&gt;n&lt;/em&gt; is the total number of types in your language, this doesn’t count either.)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Obviously, this would lessen the chance of any boring loopholes, but it would also be more likely to be subject to interpretation. Do you think this is a good idea?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Did I miss any obvious loopholes that would make this challenge boring?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This challenge was mainly done with Python in mind, but I seen no reason why it should not extend to other programming languages (with a suitable typing system). Are there any obvious pitfalls with other languages that I should consider?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Are there any other appropriate tags for the question?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="11354" LastEditorUserId="11354" LastEditDate="2017-10-15T10:16:48.863" LastActivityDate="2017-10-15T10:16:48.863" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="14067" PostTypeId="1" CreationDate="2017-10-15T16:04:10.763" Score="0" ViewCount="107" Body="&lt;p&gt;I was recently going through some posts in the &lt;a href=&quot;https://codegolf.stackexchange.com/review/low-quality-posts&quot;&gt;Low Quality Posts&lt;/a&gt;, and one answer (which I won't link here) I recommended that it be deleted, and got review to leave a comment telling the user that it wasn't a proper answer, and thought that was it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Later (just now), I happened to find the same post while reading some answers to the question, and noticed the comment left below it that said&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This does not really answer the question. If you have a different question, you can ask it by clicking &lt;a href=&quot;https://codegolf.stackexchange.com/questions/ask&quot;&gt;Ask Question&lt;/a&gt;. You can also &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/set-bounties&quot;&gt;add a bounty&lt;/a&gt; to draw more attention to this question once you have enough &lt;a href=&quot;https://codegolf.stackexchange.com/help/whats-reputation&quot;&gt;reputation&lt;/a&gt;. - From Review&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This caught my attention, as it tells new users who don't have a correct answer, that they should ask a question here about how to correct their answer, which, 99% of the time isn't what we want.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think we should change this message to direct the answerer to Stack Overflow in order to avoid confusing them. Imagine a new user's confusion and irritation when, after having been told to ask a question about their code, we then tell them that their question is off-topic and they get downvoted into oblivion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, we should change the message commented when people click &quot;This is a &quot;I'm having the problem as well&quot; answer&quot;, as it misleads new users. I propse we change it to something along the lines of&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This does not really answer the question. If you have a different question, you can ask it on &lt;a href=&quot;https://stackoverflow.com/&quot;&gt;Stack Overflow&lt;/a&gt;, but please make sure to read their &lt;a href=&quot;https://stackoverflow.com/tour&quot;&gt;FAQ&lt;/a&gt; before hand, and to make your question of suitable quality  - From Review&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="68942" LastEditDate="2021-06-05T23:58:40.383" LastActivityDate="2021-06-05T23:58:40.383" Title="Can we change the Low Quality Posts comment?" Tags="|feature-request|status-declined|reviewing|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14069" PostTypeId="1" CreationDate="2017-10-16T09:39:41.957" Score="1" ViewCount="90" Body="&lt;p&gt;Sometimes the classic CnR winning criterion:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Cops&lt;/h1&gt;&#xA;  &#xA;  &lt;p&gt;If your submission has not been cracked within a week, it is considered safe. The shortest safe submission wins.&lt;/p&gt;&#xA;  &#xA;  &lt;h1&gt;Robbers&lt;/h1&gt;&#xA;  &#xA;  &lt;p&gt;The robber with the most cracks wins.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;can be a bit boring. It also has the problem of hash functions. What counts as one? SHA1? MD5? CRC32? Do you disallow anything not bijective? That bans functions that get the character at an index in a string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm looking for alternative winning criterions for CnRs. &lt;strong&gt;Please include a criterion for both cops and robbers.&lt;/strong&gt; Any ideas?&lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastActivityDate="2017-10-16T09:39:41.957" Title="Alternative winning criterions for cops and robbers challenges?" Tags="|discussion|winning-criteria|cops-and-robbers|" AnswerCount="0" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14074" PostTypeId="2" ParentId="2140" CreationDate="2017-10-17T05:14:16.193" Score="0" Body="&lt;h1&gt;Pokémon Champion&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt;&lt;sup&gt;*&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge is about writing the ultimate bot for battling Pokémon. Since knowledge of &lt;a href=&quot;http://www.smogon.com/forums/threads/competitive-battling-basics-tiering-faq.3545934/&quot; rel=&quot;nofollow noreferrer&quot;&gt;competitive Pokémon battling&lt;/a&gt; is necessary, I'll leave that to the experts at &lt;a href=&quot;http://www.smogon.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Smogon University&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your bot must battle another bot in a Gen 7 Random Battle Format.&lt;/li&gt;&#xA;&lt;li&gt;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.&lt;/li&gt;&#xA;&lt;li&gt;In order to avoid reinventing the wheel, there are &lt;a href=&quot;https://github.com/search?q=pokemon+showdown+bot&quot; rel=&quot;nofollow noreferrer&quot;&gt;several frameworks&lt;/a&gt; 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.&lt;/li&gt;&#xA;&lt;li&gt;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.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply, and do not exploit any possible bugs in the API. If you find a bug, please report it &lt;a href=&quot;http://www.smogon.com/forums/threads/bug-reports-v2-0-read-op-before-posting.3469932/&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Further Considerations&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;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 &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; first. Just @PatrickRoberts and wait for a reply before modifying this proposal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt;&lt;sup&gt;*&lt;/sup&gt; 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 &lt;a href=&quot;https://github.com/dramamine/leftovers-again&quot; rel=&quot;nofollow noreferrer&quot;&gt;available platforms&lt;/a&gt;. The idea is to host an official tournament at a certain date (yet undecided) on &lt;a href=&quot;http://pokemonshowdown.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pokémon Showdown&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="42091" LastActivityDate="2017-10-17T05:14:16.193" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14075" PostTypeId="2" ParentId="8474" CreationDate="2017-10-17T11:34:15.990" Score="18" Body="&lt;h1&gt;Make it compatible with the new top bar&lt;/h1&gt;&#xA;&lt;p&gt;Since Stack Exchange has changed its top bar across all the sites in the network, one can no longer use the sandbox viewer. Here is how it looks like now:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/F5bOz.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/F5bOz.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;As you can see the button is no longer there.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;* &lt;s&gt;Also you cannot change the settings of the &amp;quot;PPCG Graduation&amp;quot; script)&lt;/s&gt; (&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;)&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-11-13T20:33:15.980" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14077" PostTypeId="2" ParentId="2140" CreationDate="2017-10-17T14:50:29.917" Score="6" Body="&lt;h1&gt;Check equation proofs in a ring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/logic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;logic&amp;#39;&quot; rel=&quot;tag&quot;&gt;logic&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The recent &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/proof-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;proof-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;proof-golf&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/143822/a-%C3%97-a-a-%C3%97-a&quot;&gt;prove that (-a)×(-a) = a×a&lt;/a&gt; attracted a number of faulty submissions, because there wasn't an easy way to verify the proofs. So, let's write some proof checkers.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your program should take a sequence of strings representing expressions in a &lt;a href=&quot;https://en.wikipedia.org/wiki/Ring_(mathematics)&quot; rel=&quot;nofollow noreferrer&quot;&gt;ring&lt;/a&gt;. &lt;em&gt;Valid expressions&lt;/em&gt; consist of:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Single-lowercase-letter variables (&lt;code&gt;a&lt;/code&gt; to &lt;code&gt;z&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Two constants: the additive identity &lt;code&gt;0&lt;/code&gt; and multiplicative identity &lt;code&gt;1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Compound expressions: &lt;code&gt;(X+Y)&lt;/code&gt;, &lt;code&gt;(X*Y)&lt;/code&gt; and &lt;code&gt;(-X)&lt;/code&gt;, where &lt;code&gt;X&lt;/code&gt; and &lt;code&gt;Y&lt;/code&gt; stand for subexpressions. (The parentheses must always be present, and there must be no whitespace.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Task&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your program should check whether:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All strings except the first and last represent &lt;em&gt;valid&lt;/em&gt; expressions.&lt;/li&gt;&#xA;&lt;li&gt;Each expression (after the first) can be obtained from the preceding expression, by substituting one of the &lt;a href=&quot;https://en.wikipedia.org/wiki/Ring_(mathematics)#Definition&quot; rel=&quot;nofollow noreferrer&quot;&gt;ring axioms&lt;/a&gt; in the expression exactly once.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Output truthy if these conditions are met. Otherwise, output falsey.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may assume that the first and last strings in the input are valid expressions. But your program must check the intermediate strings.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The ring axioms&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;For this challenge, use the following substitution rules (and do not use any others). Substitutions can go both left-to-right and right-to-left.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;(X+(Y+Z))&lt;/code&gt; = &lt;code&gt;((X+Y)+Z)&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;(X+0)&lt;/code&gt; = &lt;code&gt;X&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;(X+(-X))&lt;/code&gt; = &lt;code&gt;0&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;(X+Y)&lt;/code&gt; = &lt;code&gt;(Y+X)&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;(X*(Y*Z))&lt;/code&gt; = &lt;code&gt;((X*Y)*Z)&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;(X*1)&lt;/code&gt; = &lt;code&gt;X&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;(1*X)&lt;/code&gt; = &lt;code&gt;X&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;(X*(Y+Z))&lt;/code&gt; = &lt;code&gt;((X*Y)+(X*Z))&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;((X+Y)*Z)&lt;/code&gt; = &lt;code&gt;((X*Z)+(Y*Z))&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Proof checkers are traditionally small, so that people can review them easily. Therefore, your program should be written in as few bytes as possible.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Meta comments&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Is the input format fair for most languages and approaches?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Usually, code-golf problems should not require input validation. However, I thought it would be appropriate behaviour for a proof checker. I think the current spec still accommodates regex-based solutions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The format for the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/143822/a-%C3%97-a-a-%C3%97-a&quot;&gt;original challenge&lt;/a&gt; also listed which axiom was used for each step. I could include this but I doubt that it improves the challenge much.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Valid proofs&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(0+a)&#xA;(a+0)&#xA;a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(a*(-1))&#xA;((a*(-1))+0)&#xA;((a*(-1))+(a+(-a)))&#xA;(((a*(-1))+a)+(-a))&#xA;(((a*(-1))+(a*1))+(-a))&#xA;((a*((-1)+1))+(-a))&#xA;((a*(1+(-1)))+(-a))&#xA;((a*0)+(-a))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Invalid proofs&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;These proofs are missing intermediate steps.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(0+a)&#xA;a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(-0)&#xA;((-0)+0)&#xA;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;((a*0)+(-a))&#xA;(0+(-a))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is simply untrue, so no proof should ever be accepted.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(a*b)&#xA;(b*a)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Invalid expressions&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your proof checker should reject if these appear partway through a proof.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a+b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(a+-b)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(a + b)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;42&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="75067" LastEditorUserId="75067" LastEditDate="2017-10-19T06:27:36.633" LastActivityDate="2017-10-19T06:27:36.633" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14078" PostTypeId="2" ParentId="2140" CreationDate="2017-10-17T15:49:11.777" Score="0" Body="&lt;h1&gt;All the same digits&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Task&lt;/h3&gt;&#xA;&lt;p&gt;For any two coprime integers &lt;code&gt;n, b &amp;gt; 1&lt;/code&gt; there exist infinitely many integers &lt;code&gt;k &amp;gt; 0&lt;/code&gt; for which &lt;code&gt;n * k&lt;/code&gt;'s representation in base &lt;code&gt;b&lt;/code&gt; only contains the digit &lt;code&gt;b-1&lt;/code&gt;.&lt;br /&gt;&#xA;This challenge's task is to output the smallest such &lt;code&gt;k&lt;/code&gt; for given integers &lt;code&gt;n, b&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;Two integers &lt;code&gt;n, b&lt;/code&gt; with the above described properties in any reasonable format (integers, strings, ...). If your language does not support arbitrary precision integers, you can assume that &lt;code&gt;n, b &amp;lt; 2**31&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Ouput&lt;/h3&gt;&#xA;&lt;p&gt;An integer &lt;code&gt;k&lt;/code&gt; with the above described properties in any reasonable format (integer, string, ...). If your language does not support arbitrary precision integers, you can assume that &lt;code&gt;k &amp;lt; 2**31&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;f(  n,     b) == k&#xA;&#xA;f(  7,    10) == 142857&#xA;f(  13,    5) == 48&#xA;f(  14,   13) == 12&#xA;f(1728, 1729) == 1&#xA;f( 107,   99) == 54863250648363053681585635237627534906401818527472898624219397466199311510764517134614152141940101983414&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;To generate more test cases, take a look at my &lt;a href=&quot;https://tio.run/##VczNCoJAFIbhtXMVH0Tg2EhNm2jAlftuQEScPKKkxziNRZtu3X52rd@X5/oM3cT7ZVnhPPGdJIArjzDhVNmdypFhqEff1GAD73Cbx9gnCSUN2klApkHPIJ5HkjpQzIVzqS21VmqFG9Vy7n7jRTXUoo2/ioFkVjsVPbp@IORx8Up9mYjxes1ONplVkVCYhf/alper9Bw@it0dDI5HvbwB&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 2 reference implementation (TIO)&quot;&gt;reference implementation&lt;/a&gt; written in Python 2.&lt;/p&gt;&#xA;&lt;h3&gt;Addendum&lt;/h3&gt;&#xA;&lt;p&gt;Fraction periods can also be used to calculate &lt;code&gt;k&lt;/code&gt; (example given for &lt;code&gt;n, b = 13, 10&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1/13             =      0.076923(076923)* (period length 6)&#xA;1/13 *  10**6    = 076923.076923(076923)*&#xA;1/13 * (10**6-1) = 076923&#xA;        999999   = 076923 * 13&#xA;               k =  76923&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="73111" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-10-18T07:07:17.730" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14084" PostTypeId="2" ParentId="2280" CreationDate="2017-10-20T11:59:45.440" Score="-6" Body="&lt;h1&gt;on the unambiguous answers&lt;/h1&gt;&#xA;&lt;p&gt;This question start wrong, because &amp;quot;Theoretical machine&amp;quot;&lt;/p&gt;&#xA;&lt;h1&gt;DOESN'T EXIST.&lt;/h1&gt;&#xA;&lt;p&gt;Exist one implementation, one compiler or better, one Os + compiler system + cpu and hardware.&#xA;If one question request calculate in one programming language f(x) with x in [0, 8000] it has not significance until they specific, for example &amp;quot;in all more 2 widely used know compiler + Os in their default installation&amp;quot;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;What it is easy to say for remove all ambiguity:&#xA;&amp;quot;the answer code function f has to return the right result&#xA;in the input range for example 0..10000 for the online compiler in   &#xA;http:/someone.it in less of 1 minute for each number of input&#xA;in its range.&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Otherwise this is the C answer to all question:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;main(){for(;;);}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Because all you accept solution that never return one result.&lt;/p&gt;&#xA;&lt;p&gt;Op xnor is •&lt;/p&gt;&#xA;&lt;p&gt;•What are your thoughts on:&#xA;•Should questions specify bounds and precisions for inputs?&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Yes and yes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;•Can and should questions handwave-away overflow and precision issues?&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;No and no&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;•Is it OK to submit answers that &amp;quot;eventually&amp;quot; give the answer, like one that loops through all 2^64 machine-representable integers regardless of input size?&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;No the answer has to print its right result in the real machine, &#xA;in the specified time the question assign to that calculus&#xA;for example in Tio web interface compilers. It can be 1 minute&#xA;if it is not specified (or one rationally good chose time)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;•Should answers have to handle extreme cases like inputs 1 away from overflow?&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;I Don't understand &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;•Are answers responsible for machine-precision failures like 21.0/7.0&amp;gt;3.0?&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Yes yes and yes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;•What about stack-overflows for recursive code without tail-recursion?&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;If stack end in the real machine of test in Tio, &#xA;for some value of the range request in the question&#xA;the answer &#xA;is invalid or not determinate &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerDisplayName="user58988" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-11-09T20:27:25.100" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="14087" PostTypeId="2" ParentId="2140" CreationDate="2017-10-20T19:52:42.650" Score="0" Body="&lt;h1&gt;Behavior Driven Golfing&lt;/h1&gt;&#xA;&lt;h3&gt;Context&lt;/h3&gt;&#xA;&lt;p&gt;From wikipedia (emphasis mine): &lt;a href=&quot;https://en.wikipedia.org/wiki/Behavior-driven_development&quot; rel=&quot;nofollow noreferrer&quot;&gt;Behavior Driven Development (BDD)&lt;/a&gt; is largely facilitated through the use of a simple domain-specific language (DSL) using &lt;strong&gt;natural language constructs (e.g., English-like sentences)&lt;/strong&gt; that can express the behavior and the expected outcomes.&lt;/p&gt;&#xA;&lt;p&gt;Example in normal BDD (also from Wikipedia):&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Story: Returns go to stock&lt;/p&gt;&#xA;&lt;p&gt;As a store owner&#xA;In order to keep track of stock&#xA;I want to add items back to stock when they're returned.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;The challenge:&lt;/h3&gt;&#xA;&lt;p&gt;Write a program that reads like a single &lt;strong&gt;English-like sentence&lt;/strong&gt; that executes the meaning of that sentence.&lt;/p&gt;&#xA;&lt;h3&gt;Other details&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program must receive input of some kind (stdin, arguments are okay depending on your language's syntax).&lt;/li&gt;&#xA;&lt;li&gt;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.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;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.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The program must have at least &lt;code&gt;log(n)&lt;/code&gt; distinct outputs over an input space of size &lt;code&gt;n&lt;/code&gt;.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For example, if there existed a language where &lt;code&gt;convert to zero&lt;/code&gt; was a valid program, returning &lt;code&gt;0&lt;/code&gt; on all inputs would not be okay, but printing a number of &lt;code&gt;0&lt;/code&gt; equal to the base 10 number of digits of the input number would be okay.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The program should not error out on legal input.&lt;/li&gt;&#xA;&lt;li&gt;Irregular case and unicode characters are allowed&lt;/li&gt;&#xA;&lt;li&gt;Unicode characters will be interpreted as the similar character in English (so most commands in &lt;a href=&quot;https://github.com/Adriandmen/05AB1E&quot; rel=&quot;nofollow noreferrer&quot;&gt;05AB1E&lt;/a&gt; are allowed).&lt;/li&gt;&#xA;&lt;li&gt;Words may be delimited by punctuation marks instead of spaces, but they must be delimited.&lt;/li&gt;&#xA;&lt;li&gt;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)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Example valid answer for all requirements except the &amp;quot;must take input&amp;quot; requirement:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h3&gt;HQ9+&lt;/h3&gt;&#xA;&lt;p&gt;Print Hello, world.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Since only the H character is an instruction in this language, all the other characters are ignored, and the program prints &lt;code&gt;hello, world&lt;/code&gt;. Since case is ignored, this program does what the english sentence says it will do.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="17249" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-10-26T18:56:10.223" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14088" PostTypeId="1" CreationDate="2017-10-21T03:03:12.960" Score="5" ViewCount="298" Body="&lt;p&gt;This answer: &lt;a href=&quot;https://codegolf.stackexchange.com/a/107882/64538&quot;&gt;https://codegolf.stackexchange.com/a/107882/64538&lt;/a&gt; received a comment which reads:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Hello, and welcome to PPCG! I don't know if tape is valid, but it should at least be 1 byte.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Is this allowed? If so, how many bytes should it add, if any? &lt;/p&gt;&#xA;" OwnerUserId="64538" LastEditorUserId="64538" LastEditDate="2017-10-27T12:33:03.133" LastActivityDate="2017-10-27T12:33:03.133" Title="Measuring Sticky Tape in Bytes" Tags="|discussion|scoring|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14091" PostTypeId="2" ParentId="2140" CreationDate="2017-10-22T01:32:36.327" Score="-3" Body="&lt;p&gt;&lt;strong&gt;Puzzle:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Make a program that draws the following figure line by line.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program should wait for one-second(it can be longer, just has to be a noticable difference) after drawing each line.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program can &lt;strong&gt;only&lt;/strong&gt; draw line by line (you cannot jump to another point or re-draw over a line)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Given a positive integer &lt;code&gt;n&lt;/code&gt;, produce an art image of the below drawing&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The angle measures should always be the same (regardless of &lt;code&gt;n&lt;/code&gt;'s value)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;However, each line's length should be &lt;code&gt;150*n&lt;/code&gt; pixels&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You only need to account for when &lt;code&gt;n&lt;/code&gt; = 1, &lt;code&gt;n&lt;/code&gt; = 2, &lt;code&gt;n&lt;/code&gt; = 3&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/aAPZ0.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/aAPZ0.png&quot; alt=&quot;example&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Specifications:&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;if &lt;strong&gt;n=1:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;length = 150 pixels&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;if &lt;strong&gt;n=2:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;length = 300 pixels&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;if &lt;strong&gt;n=3&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;length = 450 pixels&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Answering&lt;/strong&gt;&#xA;- Name the language you used followed by its bytes&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Java (swing), 500 bytes&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is code golf. Lowest score (bytes) wins.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;standard loopholes&lt;/a&gt; are &lt;strong&gt;forbidden&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Good luck!&lt;/p&gt;&#xA;" OwnerUserId="74796" LastActivityDate="2017-10-22T01:32:36.327" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14094" PostTypeId="2" ParentId="14088" CreationDate="2017-10-23T15:03:23.580" Score="6" Body="&lt;h1&gt;User interaction can be a valid part of a program&lt;/h1&gt;&#xA;&lt;p&gt;There is an &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9772/71434&quot;&gt;existing consensus&lt;/a&gt; about programming languages which require user interaction to run, specifically that they are valid languages with valid answers despite said interaction. The question then becomes, how does that apply to individual &lt;strong&gt;Programs&lt;/strong&gt; which require user interaction to run when their language doesn't universally require it. I would roughly break it down into two categories:&lt;/p&gt;&#xA;&lt;h3&gt;User Interaction defined in the source code&lt;/h3&gt;&#xA;&lt;p&gt;The first category is &lt;em&gt;Languages which represent user interaction in the source code&lt;/em&gt;. In the linked consensus, Vim is like this; &amp;quot;programs&amp;quot; written in Vim represent a series of keys that a user will press to execute the program, with each user interaction accounted for and represented in the byte count. I would apply this to a hypothetical mixed language that can include user interaction, as long as that user interaction is strictly defined within the source code and can be translated to bytes. If the answer in question were written in a language which defined a symbol that means &amp;quot;user presses enter&amp;quot; and otherwise behaved identical to Command Prompt, then the answer would be valid with that 1 symbol added (though doing so now would likely fall afoul of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1071/71434&quot;&gt;a forbidden loophole&lt;/a&gt;).&lt;/p&gt;&#xA;&lt;h3&gt;User Interaction standardized for a language&lt;/h3&gt;&#xA;&lt;p&gt;The second category is &lt;em&gt;Languages which require user &amp;quot;cranking&amp;quot; to execute&lt;/em&gt;. These languages in their base definition do not define a way to advance stages of execution, and substitute a standardized way for the user to run them which includes a pre-defined interaction. This could also be applied to a mixed language, such as one which can do normal sequential execution but requires a held enter key for looping. The answer could fit here, and then it would be valid with 0 additional bytes. However, as in &lt;a href=&quot;https://codegolf.stackexchange.com/a/22779/71434&quot;&gt;this&lt;/a&gt; example, Command Prompt (and related &amp;quot;Batch&amp;quot;) does have looping structures which don't require user input. Using a held enter key to cause looping behavior is not a standard of the language, it is extra user interaction that the author tacked on to the answer.&lt;/p&gt;&#xA;&lt;h1&gt;User interaction can also be &lt;em&gt;invalid&lt;/em&gt;&lt;/h1&gt;&#xA;&lt;p&gt;In my opinion, the linked answer does not fit in either of the above categories that would allow user interaction to be specified within source code (thus adding to byte count), or have user interaction as a standard of the language and thus implied by the language (since knowledge of the language used is treated as &amp;quot;free&amp;quot;). In this case, having a User hold the enter key (or keep it pressed some other way) would instead count as an &amp;quot;additional input&amp;quot; that indicates the duration that the program should continue; even if the remaining text of the post indicates that said input should have a constant value (&amp;quot;forever&amp;quot;) it still violates &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1789/71434&quot;&gt;the loophole forbidding additional inputs&lt;/a&gt; and thus is invalid (specifically a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990/71434&quot;&gt;Type 2&lt;/a&gt; invalid answer).&lt;/p&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-10-24T17:24:45.570" CommentCount="10" CommunityOwnedDate="2017-10-27T13:59:10.313" ContentLicense="CC BY-SA 3.0" />
  <row Id="14095" PostTypeId="2" ParentId="2140" CreationDate="2017-10-23T17:34:46.917" Score="0" Body="&lt;p&gt;&lt;strong&gt;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.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Also a note: If you want, I can wait for Christmas with this.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Back to the &lt;em&gt;New Year&lt;/em&gt;!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;You encounter a probably hard challenge.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/a/17103/&quot;&gt;this answer by @dansalmo&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we sum character codes in the string &lt;code&gt;Happy new year to you!&lt;/code&gt;, we will get 2014. With later years, people started to modify the string, so it fits the current year:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;2015: &lt;code&gt;A Happy New Year to You!&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;2016: &lt;code&gt;Happy New Year to you!!!&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an integer &lt;em&gt;&lt;code&gt;year&lt;/code&gt;&lt;/em&gt;, output a string meaning &quot;Happy new year!&quot;. Sum of character codes should be equal to the integer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;default loop holes&lt;/a&gt; allowed&lt;/li&gt;&#xA;&lt;li&gt;Output rules:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Meaning rules:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must use the word &lt;code&gt;Happy&lt;/code&gt; - you cannot use any other adjective instead.&lt;/li&gt;&#xA;&lt;li&gt;You must wish a NEW year, no matter if it's 2010 or 2020!&lt;/li&gt;&#xA;&lt;li&gt;You can only wish a happy new &lt;strong&gt;year&lt;/strong&gt; - You can't wish a happy new Easter...&lt;/li&gt;&#xA;&lt;li&gt;You can target the string to a person or group, or to everybody: &lt;code&gt;Happy new year!&lt;/code&gt;, &lt;code&gt;Happy new year, Soaku!&lt;/code&gt;, &lt;code&gt;Happy new year, CodeGolfers!&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;You can add new words, but the sentence can't lose the meaning!&lt;/li&gt;&#xA;&lt;li&gt;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.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Letter case rules:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;First word must start with uppercase letter.&lt;/li&gt;&#xA;&lt;li&gt;Any other word can start with uppercase or lowercase.&lt;/li&gt;&#xA;&lt;li&gt;Letters that aren't first should be lowercase. The only exception is when all letters in the word are uppercase.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Punctuation rules:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You are not allowed to use any punctuation characters, except on the end of the string&lt;/li&gt;&#xA;&lt;li&gt;There must be exactly &lt;strong&gt;one&lt;/strong&gt; or &lt;strong&gt;three&lt;/strong&gt; exclamation marks &lt;code&gt;!&lt;/code&gt; at the end.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Spacing rules:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There must be exactly &lt;strong&gt;one&lt;/strong&gt; space between words.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;No line breaks allowed&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Leading and trailing spaces/newlines are allowed, but they don't count in the character code sum. &lt;code&gt;Word&lt;/code&gt; is the same as outputting &lt;code&gt;Word&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Character rules:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You cannot use digits!&lt;/li&gt;&#xA;&lt;li&gt;You must only use ASCII letters (the only exception are the trailing exclamation marks)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;You can assume the input is an integer between 2000 and 3000&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;examples, don't need to be the same&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2001 - Happy new YEAR to MYSELF!&#xA;2002 - A VERY HAPPY NEW YEAR TO PPCG!&#xA;2003 - Happy NEW Year TO MYSELF!!!&#xA;2004 - A happy new year to me!&#xA;2013 - A HAPPY NEW Year To The SE!!!&#xA;2014 - Happy new year to you!&#xA;2015 - A Happy New Year to You!&#xA;2016 - Happy New Year to you!!!&#xA;2030 - A Happy New Year To PPCG!!!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Please, suggest any changes and upgrades in the comments&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="72792" LastEditorUserId="72792" LastEditDate="2017-10-25T15:04:07.677" LastActivityDate="2017-10-25T15:04:07.677" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14096" PostTypeId="2" ParentId="2140" CreationDate="2017-10-23T23:32:18.953" Score="1" Body="&lt;h1&gt;Generate a program to output a string in yup&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;yup is an older language of mine with the following commands:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0   Pushes 0 to the stack.&#xA;e   Takes an argument N and pushes exp(N).&#xA;|   Takes an argument N and pushes ln(N).&#xA;~   Switches top two items on stack.&#xA;:   Duplicates the top item on the stack.&#xA;-   Subtracts the top of stack from the second-to-top of stack.&#xA;{   Begin while loop (while top of stack is positive and is defined).&#xA;}   End while loop.&#xA;$   Reverse the stack.&#xA;[   Moves the bottom of the stack to the top of the stack.&#xA;]   Moves the top of the stack to the bottom of the stack.&#xA;*   Pushes an input item (char/number) to the stack.&#xA;\   Terminates the program.&#xA;@   Outputs top of stack as a character. (When used on a non-int, rounds the real portion.)&#xA;#   Outputs top of stack as a number.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For example, the program &lt;code&gt;00e&lt;/code&gt; pushes &lt;code&gt;0&lt;/code&gt;, then &lt;code&gt;0&lt;/code&gt;, then pops a &lt;code&gt;0&lt;/code&gt;, pushing &lt;code&gt;exp(0)&lt;/code&gt;, yielding the stack &lt;code&gt;[0, 1]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your challenge, should you choose to accept it, is to create a program that, when given a string, outputs a short yup program that would output the given string. &lt;strong&gt;Your score is determined by the total number of bytes used to generate all test cases below.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Formatted as a .JSON file (array of strings):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&quot;Hello, World!&quot;, &quot; !\&quot;#$%&amp;amp;'()*+,-./0123456789:;&amp;lt;=&amp;gt;?&quot;, &quot;ABCDEFGHIJKLMNOPQRSTUVWXYZ&quot;, &quot;zyxwvutsrqponmlkjihgfedcba&quot;, &quot;AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsTtUuVvWwXxYyZz&quot;, &quot;&quot;, &quot;[[&amp;lt;&amp;lt;&amp;gt;&amp;gt;]]&quot;, &quot;adksjf 9823-0 =-ao0sdf';zlx&quot;, &quot;b662bf6c7a7cac66561025cf2509506f&quot;, &quot;yup&quot;, &quot; ~!}&quot;, &quot;death surely will find us all&quot;, &quot;NO_ONE_IS_HERE&quot;, &quot;Ra Ra Rasputin&quot;, &quot;hello\nWORLD&quot;, &quot;*0e-{0e-}#&quot;, &quot;            &quot;, &quot;go play nethack&quot;, &quot;\ttabs\n vs spaces\r\n&quot;, &quot;.&quot;, &quot;~&quot;, &quot;it is not necessarily unfair that we can single-handedly close challenges, --MrXcoder&quot;, &quot;\nconst math = require(\&quot;mathjs\&quot;);\nconst escape = require(\&quot;escape-string-regexp\&quot;);\nconst Stack = require(\&quot;./stack.js\&quot;);\nconst entries = require(\&quot;./entries.js\&quot;);&quot;, &quot;Never gonna give you up\nNever gonna let you down\nNever gonna turn around\nAnd outgolf you&quot;, &quot;010100101000001000100111101010&quot;, &quot;O0O0O0OOOO00O000O0OOOO0O00O0&quot;, &quot;[0, [1, [2, 3], 4], 5]&quot;, &quot;(()()()))))(()()))&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If I feel submissions too heavily optimize for the given inputs, I will use a second set of words, with an md5hash of &lt;code&gt;30272eee598205bab2904e9768502517&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2017-10-23T23:32:18.953" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14097" PostTypeId="2" ParentId="2140" CreationDate="2017-10-24T08:53:16.817" Score="1" Body="&lt;h1&gt;Insertion sort counter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Calculate the number of moves necessary to do an &lt;a href=&quot;https://en.wikipedia.org/wiki/Insertion_sort&quot; rel=&quot;nofollow noreferrer&quot;&gt;insertion sort&lt;/a&gt; of an input vector containing positive integers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. At each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there. It repeats until no input elements remain.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must count the number of times a number is moved from its original position. For instance, the vector &lt;code&gt;[1,2,3,4]&lt;/code&gt; requires no moves, as it's already sorted, while the vector &lt;code&gt;[1,3,4,2]&lt;/code&gt; requires one move, since  the last &lt;code&gt;2&lt;/code&gt; must be moved two places to the left.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example:&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: &#xA;[6, 5, 3, 1, 8, 7, 2, 4]&#xA;Sorting:&#xA;0: [6, 5, 3, 1, 8, 7, 2, 4]&#xA;1: [5, 6, 3, 1, 8, 7, 2, 4]&#xA;2: [3, 5, 6, 1, 8, 7, 2, 4]&#xA;3: [1, 3, 5, 6, 8, 7, 2, 4]&#xA;4: [1, 3, 5, 6, 7, 8, 2, 4]&#xA;5: [1, 2, 3, 5, 6, 7, 8, 4]&#xA;6: [1, 2, 3, 4, 5, 6, 7, 8]&#xA;Output: 6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Test cases:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;To be added!&lt;/p&gt;&#xA;" OwnerUserId="31516" LastEditorUserId="31516" LastEditDate="2017-10-25T08:00:19.740" LastActivityDate="2017-10-25T08:00:19.740" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="14100" PostTypeId="2" ParentId="2140" CreationDate="2017-10-24T20:55:35.667" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The XOR Quines!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to make a program that outputs its source code but when each of its bytes are XORed with its answer number, it outputs the source code of the previous program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if the previous program was:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;print 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and your program is number #2, than your program could be this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;cngpv*%rpklv&quot;3%+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which outputs in your language:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;cngpv*%rpklv&quot;3%+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and when each byte is XORed with 2, you get:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;alert('print 1')&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which outputs the previous program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;print 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that the first program doesn't have to do anything other than output its own source code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The second-to last answer after a month of no answers posted wins.&lt;/p&gt;&#xA;" OwnerDisplayName="user58826" LastActivityDate="2017-10-24T20:55:35.667" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14108" PostTypeId="2" ParentId="2140" CreationDate="2017-10-27T12:54:39.187" Score="3" Body="&lt;h2&gt;Type the alphabet as fast as you can&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to make a program that measures how fast you can type the letters of the English alphabet.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program shall only accept lowercase letters &lt;code&gt;a&lt;/code&gt; to &lt;code&gt;z&lt;/code&gt; in alphabetical order. &lt;/li&gt;&#xA;&lt;li&gt;Each letter is echoed as typed on the same line (without new line or any other separators between letters). &lt;/li&gt;&#xA;&lt;li&gt;If you type an invalid character the program shall output &lt;code&gt;Fail&lt;/code&gt; and exit.&lt;/li&gt;&#xA;&lt;li&gt;If you type all 26 letters the program shall output the time in milliseconds it took from the first to the last letter and exit.&lt;/li&gt;&#xA;&lt;li&gt;The timer starts when you type the first letter, &lt;code&gt;a&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Example outputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;b&#xA;Fail&#xA;&#xA;abcdefgg&#xA;Fail&#xA;&#xA;abcdefghijklmnopqrstuvwxyz&#xA;6440&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="1308" LastEditorUserId="1308" LastEditDate="2017-10-27T14:52:12.630" LastActivityDate="2017-10-27T14:52:12.630" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14110" PostTypeId="2" ParentId="1061" CreationDate="2017-10-27T13:55:07.793" Score="38" Body="&lt;h1&gt;When consistent and distinct values are asked as input, you cannot input complete or partial functions&lt;/h1&gt;&#xA;&lt;p&gt;When I create a challenge and ask for a &lt;code&gt;boolean&lt;/code&gt; or two 'consistent and distinct values' I mean it in the sense of a truthy and falsey value. Usually I leave the choice to the ones doing the challenge, since I don't care whether it's &lt;code&gt;true/false&lt;/code&gt;, &lt;code&gt;1/0&lt;/code&gt;, &lt;code&gt;&amp;quot;yes&amp;quot;/&amp;quot;no&amp;quot;&lt;/code&gt;, etc.&lt;/p&gt;&#xA;&lt;p&gt;I know just asking for a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2194/52210&quot;&gt;truthy/falsey value&lt;/a&gt; specifically in the challenges is also an option, but since &lt;code&gt;1/0&lt;/code&gt; isn't considered truthy/falsey in for example Java or .NET C# and I still don't mind if they are used, this default loop hole would be relevant.&lt;/p&gt;&#xA;&lt;p&gt;Since it isn't part of this default loopholes page yet, there have been answers in the past which input partial or complete functions, if the challenge rules allow this loophole. &lt;a href=&quot;https://codegolf.stackexchange.com/a/141025/52210&quot;&gt;This JavaScript answer&lt;/a&gt; for example, takes the inputs as &lt;code&gt;'/\n|-DI&amp;gt;-/---&amp;lt; '&lt;/code&gt; for left, &lt;code&gt;'/\n|-DI&amp;lt;-\\---&amp;gt; '&lt;/code&gt; for right. In the challenge description it states:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;the other being one of two distinct, consistent values of your choice (&lt;code&gt;1 / 0&lt;/code&gt;, &lt;code&gt;l / r&lt;/code&gt;, &lt;code&gt;left / right&lt;/code&gt;, etc.)&lt;br /&gt;&#xA;...&lt;br /&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Although original, and it does comply with the challenge description above, I think it would be wise to prevent these kind of partial or complete functions as input in the future. What would prevent someone from having the fictional program &lt;code&gt;run param&lt;/code&gt; where the &lt;code&gt;param&lt;/code&gt; is a complete program when a truthy value is asked, or a different complete program when a falsey value is asked? Also sharply &lt;a href=&quot;https://codegolf.stackexchange.com/questions/140943/ascii-airplane-banner/141025#comment345583_140943&quot;&gt;mentioned by &lt;em&gt;@darrylyeo&lt;/em&gt; as comment&lt;/a&gt; on that same challenge:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;JavaScript, 4 bytes: &lt;code&gt;eval&lt;/code&gt; - Input a program that generates a left-facing plane for left, and a program that generates a right-facing plane for right.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1072/52210&quot;&gt;Related: Using the program name to store data without counting those bytes&lt;/a&gt;&lt;br /&gt;&#xA;In this related loophole the file-name is counted towards the byte-count. But I don't think adding the two values to the byte-count is a good idea either, otherwise the &lt;code&gt;1/0&lt;/code&gt;, &lt;code&gt;true/false&lt;/code&gt; should also be counted. Where do we draw the line of which inputs should be counted towards the byte-count, and which shouldn't? So just preventing these kind of inputs as standard loophole would be better in my opinion.&lt;/p&gt;&#xA;" OwnerUserId="52210" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-05-01T05:56:01.280" CommentCount="7" CommunityOwnedDate="2017-10-27T13:55:07.793" ContentLicense="CC BY-SA 3.0" />
  <row Id="14111" PostTypeId="1" AcceptedAnswerId="14114" CreationDate="2017-10-27T14:20:31.943" Score="0" ViewCount="103" Body="&lt;p&gt;Last I checked, one did not need a diamond in their name to post questions tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;. I also didn't know that main site tags could be mods-only.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14103/62402&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/7pcA4.jpg&quot; alt=&quot;Screenshot (also shows my browser)&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Oddly enough, when I'm in the editor it doesn't happen.&lt;/p&gt;&#xA;" OwnerUserId="62402" LastEditorUserId="68942" LastEditDate="2021-04-27T17:26:21.367" LastActivityDate="2021-04-27T17:26:21.367" Title="Non-mod-only tag is shown in red" Tags="|bug|status-norepro|tags|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14112" PostTypeId="2" ParentId="2140" CreationDate="2017-10-27T14:25:23.453" Score="4" Body="&lt;h1&gt;Does it have a square? (simple version) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Given a matrix of &lt;code&gt;0&lt;/code&gt;s and &lt;code&gt;1&lt;/code&gt;s, determine if there are 4 points that are &lt;code&gt;1&lt;/code&gt; and are the corners of a square.&lt;/p&gt;&#xA;&lt;p&gt;Here's an example to clarify, with a possible square (in bold):&lt;pre&gt;0 0 0 0 0 0 0 1&#xA;0 0 0 &lt;b&gt;1 0 1&lt;/b&gt; 0 0&#xA;0 0 0 &lt;b&gt;0&lt;/b&gt; 1 &lt;b&gt;1&lt;/b&gt; 0 0&#xA;0 0 0 &lt;b&gt;1 0 1&lt;/b&gt; 0 0&#xA;1 0 0 0 0 0 0 1&#xA;0 1 1 0 0 1 1 1&#xA;1 1 1 1 1 0 0 1&#xA;0 1 0 0 1 0 1 1&#xA;1 1 1 1 0 0 1 0&#xA;1 0 0 1 0 1 0 1&#xA;0 0 1 0 1 0 1 1&#xA;1 0 0 1 1 0 1 1&#xA;&lt;/pre&gt;Another possible square is the following:&lt;/p&gt;&#xA;&lt;pre&gt;0 0 0 0 0 0 0 1&#xA;0 0 0 1 0 1 0 0&#xA;0 0 0 0 1 1 0 0&#xA;0 0 0 1 0 1 0 0&#xA;&lt;b&gt;1 0 0 0 0 0 0 1&lt;/b&gt;&#xA;&lt;b&gt;0&lt;/b&gt; 1 1 0 0 1 1 &lt;b&gt;1&lt;/b&gt;&#xA;&lt;b&gt;1&lt;/b&gt; 1 1 1 1 0 0 &lt;b&gt;1&lt;/b&gt;&#xA;&lt;b&gt;0&lt;/b&gt; 1 0 0 1 0 1 &lt;b&gt;1&lt;/b&gt;&#xA;&lt;b&gt;1&lt;/b&gt; 1 1 1 0 0 1 &lt;b&gt;0&lt;/b&gt;&#xA;&lt;b&gt;1&lt;/b&gt; 0 0 1 0 1 0 &lt;b&gt;1&lt;/b&gt;&#xA;&lt;b&gt;0&lt;/b&gt; 0 1 0 1 0 1 &lt;b&gt;1&lt;/b&gt;&#xA;&lt;b&gt;1 0 0 1 1 0 1 1&lt;/b&gt;&lt;/pre&gt;&#xA;&lt;p&gt;There are many squares in this matrix, but the point isn't to count the squares, just to determine if there's a square in it. Since there is a square in it, your solution, given this matrix, must return a truthy value.&lt;/p&gt;&#xA;&lt;p&gt;Given this matrix, your solution must return a falsy value:&lt;pre&gt;0 0 0 0 0 0&#xA;0 1 1 0 0 1&#xA;0 1 0 0 1 1&#xA;0 1 1 0 1 0&lt;/pre&gt;You can see there's no square in there.&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Since the input is a matrix, it will always be rectangular.&lt;/li&gt;&#xA;&lt;li&gt;Probably needless to say, the sides of a square must be equal.&lt;/li&gt;&#xA;&lt;li&gt;The corners of a square must all be &lt;code&gt;1&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A square must have at least side length 2 to be considered a square, otherwise this challenge would be extremely trivial.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/41024&quot;&gt;Standard Loopholes&lt;/a&gt;, as usual, are forbidden.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;This section is under construction.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-10-27T21:48:58.307" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="14113" PostTypeId="2" ParentId="2140" CreationDate="2017-10-27T14:28:11.613" Score="1" Body="&lt;h1&gt;Tear Down that Wall&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/144600/hide-the-needle-in-the-haystack-cops&quot;&gt;Related (dupe?)&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is my first time submitting a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; challenge.&lt;/li&gt;&#xA;&lt;li&gt;Suggestions and constructive criticism are always welcome.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Cops:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;As the cop, your task is to create a code that outputs this ASCII wall:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;___|___|___|___|___|___|___|___|___|__&#xA;_|___|___|___|___|___|___|___|___|___|&#xA;___|___|___|___|___|___|___|___|___|__&#xA;_|___|___|___|___|___|___|___|___|___|&#xA;___|___|___|___|___|___|___|___|___|__&#xA;_|___|___|___|___|___|___|___|___|___|&#xA;___|___|___|___|___|___|___|___|___|__&#xA;_|___|___|___|___|___|___|___|___|___|&#xA;___|___|___|___|___|___|___|___|___|__&#xA;_|___|___|___|___|___|___|___|___|___|&#xA;___|___|___|___|___|___|___|___|___|__&#xA;_|___|___|___|___|___|___|___|___|___|&#xA;___|___|___|___|___|___|___|___|___|__&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;However, by &lt;em&gt;&lt;strong&gt;deleting&lt;/strong&gt;&lt;/em&gt; some part(s) of the code, it must also output a broken wall:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;___|___|___|___|___|___|___|___|___|__&#xA;_|___|___|___|___|___|___|___|___|___|&#xA;___|___|___|___|___|___|___|___|___|__&#xA;_|___|___                    |___|___|&#xA;___|___|_                    __|___|__&#xA;_|___|___                    |___|___|&#xA;___|___|_                    __|___|__&#xA;_|___|___                    |___|___|&#xA;___|___|_                    __|___|__&#xA;_|___|___                    |___|___|&#xA;___|___|_                    __|___|__&#xA;_|___|___                    |___|___|&#xA;___|___|_                    __|___|__&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Your code &lt;strong&gt;must&lt;/strong&gt; terminate in a reasonable amount of time as long as it's correct. That means that the whole code and the correctly broken code &lt;strong&gt;must&lt;/strong&gt; output the wall (broken or not) within 60 (too much or too little time? sugestions?) seconds. That doesn't apply if the code is incorrectly broken by the robber.&lt;/li&gt;&#xA;&lt;li&gt;The broken wall needs to be output(ted? English is hard) &lt;strong&gt;without addition of code&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You may obfuscate the code as much as you see fit. (does hashing/encrypting count as obfuscating? if so, should it be allowed?)&lt;/li&gt;&#xA;&lt;li&gt;You &lt;strong&gt;must&lt;/strong&gt; state what language you used in your answer.&lt;/li&gt;&#xA;&lt;li&gt;Your wall will be safe if, after 1 week, it hasn't been broken. You &lt;strong&gt;must&lt;/strong&gt; also reveal the answer. Your wall will &lt;strong&gt;not&lt;/strong&gt; be safe until you have revealed the answer.&lt;/li&gt;&#xA;&lt;li&gt;The outputs must match the exact ASCII walls provided. Leading/trailing newlines are allowed as long as the output matches the one provided. The walls consist of 13 lines and 38 columns of the characters &lt;code&gt;|&lt;/code&gt; and &lt;code&gt;_&lt;/code&gt;. The broken section of the wall is a block of 20 whitespace characters per line, beginning at the fourth line. The &quot;padding&quot; is of 9 characters (&lt;code&gt;|&lt;/code&gt; or &lt;code&gt;_&lt;/code&gt;) to either side of the whitespace block.&lt;/li&gt;&#xA;&lt;li&gt;Preferably, include a link to an online interpreter for your chosen language.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;(any other rules suggestions?)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Robbers:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;As the robber, your task is to, well, break the wall!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You &lt;strong&gt;may not add&lt;/strong&gt; any code to the answer, only &lt;strong&gt;delete&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The code is considered broken &lt;strong&gt;if and only if&lt;/strong&gt; it outputs the &lt;strong&gt;entire&lt;/strong&gt; broken wall.&lt;/li&gt;&#xA;&lt;li&gt;The broken code &lt;strong&gt;must&lt;/strong&gt; be a valid submission in the same language as the original code.&lt;/li&gt;&#xA;&lt;li&gt;Please include in your answer a link to the answer you cracked and which part(s) of the code you modified.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Sandbox:&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Suggestions?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="74163" LastEditorUserId="74163" LastEditDate="2017-10-27T14:34:44.320" LastActivityDate="2017-10-27T14:34:44.320" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14114" PostTypeId="2" ParentId="14111" CreationDate="2017-10-27T14:30:12.103" Score="6" Body="&lt;p&gt;That's not a red tag; a red tag would have a red font on a pink background, like the tag below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-norepro&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-norepro&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-norepro&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The copper font in your image indicates a visited link, meaning you have been to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot;&gt;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you click on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; and check this post again, their colors should change from gray to copper as well.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2017-10-27T14:38:33.993" LastActivityDate="2017-10-27T14:38:33.993" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14116" PostTypeId="1" CreationDate="2017-10-27T17:25:42.087" Score="14" ViewCount="338" Body="&lt;h1&gt;Background&lt;/h1&gt;&#xA;&lt;p&gt;SmileBASIC is a BASIC interpreter for the Nintendo 3DS.&lt;/p&gt;&#xA;&lt;p&gt;Like most versions of BASIC, there is a &lt;code&gt;PRINT&lt;/code&gt; command which displays text in the console. (As well as &lt;code&gt;?&lt;/code&gt; which does the same thing)&lt;/p&gt;&#xA;&lt;p&gt;By default, &lt;code&gt;PRINT&lt;/code&gt; moves the cursor to the next row after printing, and this can be disabled by putting a semicolon after the last argument.&lt;/p&gt;&#xA;&lt;h1&gt;Problem&lt;/h1&gt;&#xA;&lt;p&gt;&lt;code&gt;PRINT&lt;/code&gt; without &lt;code&gt;;&lt;/code&gt; does NOT output a trailing newline. This can be tested by comparing it with printing a real newline character:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;PRINT &amp;quot;TEST1&amp;quot; 'print + move cursor&#xA;PRINT &amp;quot;TEST2&amp;quot;+CHR$(10); 'print + newline&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Using &lt;code&gt;CHKCHR&lt;/code&gt;, you can see that &lt;code&gt;TEST2&lt;/code&gt; has a newline character after it, while &lt;code&gt;TEST1&lt;/code&gt; does not.&lt;/p&gt;&#xA;&lt;p&gt;You can also use &lt;code&gt;LOCATE&lt;/code&gt; to move the cursor without printing newlines or other special characters.&lt;/p&gt;&#xA;&lt;h1&gt;newlines yes&lt;/h1&gt;&#xA;&lt;p&gt;Many challenges ask you to print lines of text separated by newlines (for example, ASCII art).&#xA;Is it acceptable to move the cursor in a different way (using PRINT or LOCATE)?&lt;/p&gt;&#xA;&lt;h1&gt;newlines no&lt;/h1&gt;&#xA;&lt;p&gt;Other challenges specifically say that trailing newlines are &lt;strong&gt;not&lt;/strong&gt; allowed. Should extra cursor movements not be allowed at all?&lt;/p&gt;&#xA;" OwnerUserId="64538" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-11-08T05:33:36.260" Title="Does moving the cursor to the next row count as a newline?" Tags="|discussion|" AnswerCount="1" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="14117" PostTypeId="2" ParentId="2447" CreationDate="2017-10-27T18:31:58.760" Score="-6" Body="&lt;h1&gt;Functions may get input from predefined variables in languages where this is standard&lt;/h1&gt;&#xA;&lt;p&gt;In some BASIC dialects, the standard way to implement functions is to use &lt;code&gt;GOSUB&lt;/code&gt; (similar to &lt;code&gt;CALL&lt;/code&gt; in assembly).&#xA;You can't pass variables to &lt;code&gt;GOSUB&lt;/code&gt;, so function arguments/returns are just global variables.&#xA;If you need a function that takes a number as input, and outputs that number multiplied by 2, the normal way to do this would be something like:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;@TIMES2&#xA; OUT=IN*2&#xA;RETURN&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;To call it, you would do&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;IN=7&#xA;GOSUB @TIMES2&#xA;'result is in variable OUT&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The exact same process is allowed in assembly languages.&lt;/p&gt;&#xA;" OwnerUserId="64538" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-10-27T19:58:19.457" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14118" PostTypeId="2" ParentId="2140" CreationDate="2017-10-27T19:27:01.040" Score="1" Body="&lt;h1&gt;Does the Riemann hypothesis hold?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would like to earn a million dollars, and &lt;a href=&quot;https://www.quora.com/What-is-the-hardest-way-to-make-a-million-dollars&quot; rel=&quot;nofollow noreferrer&quot;&gt;the hardest way to do it&lt;/a&gt; is apparently solving one of the Millenium problems, so let's focus on one: the &lt;a href=&quot;https://en.wikipedia.org/wiki/Riemann_hypothesis&quot; rel=&quot;nofollow noreferrer&quot;&gt;Riemann hypothesis&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;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)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;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.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Restrictions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;The program has to work when running with empty input&lt;/strong&gt; [Sandbox note: perhaps allow input but add it to byte count?]&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;Your program must &lt;strong&gt;provably&lt;/strong&gt; 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 &lt;em&gt;provably&lt;/em&gt; works.&lt;/li&gt;&#xA;&lt;li&gt;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 &lt;a href=&quot;http://empslocal.ex.ac.uk/people/staff/mrwatkin//zeta/RHproofs.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;many proofs and disproofs of RH&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;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.&lt;/li&gt;&#xA;&lt;li&gt;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.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Sandbox comment&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To address the comments below, let me clarify why this challenge is most definitely solvable. Note that the problem is &lt;em&gt;not&lt;/em&gt; of the sort &quot;give a counterexample to RH&quot; (if it did, then it would fall under &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11033/49734&quot;&gt;this discussion&lt;/a&gt; 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.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;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:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;n = 4&#xA;while true:&#xA; found = false&#xA; for k from 1 to n-1:&#xA;  if k is prime and n-k is prime:&#xA;   found = true&#xA;   break&#xA; if found == false:&#xA;  break&#xA; else:&#xA;  n = n+2&#xA;return 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;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.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My challenge as it stands can be solved in a similar manner, perhaps using&lt;/p&gt;&#xA;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;  &lt;p&gt; one of the many known &lt;a href=&quot;https://mathoverflow.net/questions/39944/collection-of-equivalent-forms-of-riemann-hypothesis&quot;&gt;equivalents of RH&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="49734" LastEditorUserId="49734" LastEditDate="2017-10-28T10:19:04.177" LastActivityDate="2017-10-28T10:19:04.177" CommentCount="19" ContentLicense="CC BY-SA 3.0" />
  <row Id="14120" PostTypeId="1" AcceptedAnswerId="14126" CreationDate="2017-10-28T20:40:06.827" Score="1" ViewCount="169" Body="&lt;p&gt;Chatty comments don't get more clear-cut than &lt;a href=&quot;https://codegolf.stackexchange.com/questions/120350/determine-if-an-array-contains-something-other-than-2/120364#comment295393_120364&quot;&gt;this&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;@WheatWizard thanks!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;And yet, somehow…&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/CvuuG.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/CvuuG.jpg&quot; alt=&quot;no longer needed – Stephen Leppik yesterday declined&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Excuse me for a moment, but… what? The other 14 flags I raised on comments saying &quot;thanks a lot&quot; and nothing else were helpful, but this one is declined?&lt;/p&gt;&#xA;" OwnerUserId="62402" LastEditorUserId="68615" LastEditDate="2017-11-12T16:13:21.140" LastActivityDate="2017-11-12T16:13:21.140" Title="Obviously chatty comment … flag declined?" Tags="|support|comments|flags|declined-flags|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14122" PostTypeId="2" ParentId="14120" CreationDate="2017-10-28T21:06:40.043" Score="4" Body="&lt;p&gt;One chatty comment isn't really an issue, especially if it's a &quot;thank you&quot; comment. It's not really worth the mods' time to remove singular chatty comments on posts. Chatty comments only really need to be flagged when there are multiple, excessively chatty comments, and then it's usually more effective to raise a custom mod flag on the post itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, spam/rude/abusive comments are a whole different story - flag those with great prejudice whenever you see them.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-10-28T21:06:40.043" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14123" PostTypeId="2" ParentId="2140" CreationDate="2017-10-28T23:22:16.617" Score="-2" Body="&lt;h1&gt;Preposition, not possession&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Enthralling background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Back in 1960s Soviet Russia, communism was the thing, and –– as we all know –– in a completely socialist society, there is ideally no personal property. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Our dear client is an author who is moving to the Soviet Union. However, as is Bolshevik custom, our client is afraid his works will be censored. That is why we are going to help this industrious author by revising his writings so that they will not be censored. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;What will be censored? Any overt references to ownership. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;How will we do this? Quite simply: we will replace all possession with preposition.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Let's get specific&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Text in parenthesis is added; text in curly-brackets is removed.&#xA;&#xA;[Input]   All the author's works will be censored!&#xA;[Output]  All (the works of )the author{'s works} will be censored!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Algorithmically&lt;/h3&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;For each word with a &lt;code&gt;'s&lt;/code&gt; attached to it:&lt;/li&gt;&#xA;&lt;li&gt;Call the word with an &lt;code&gt;'s&lt;/code&gt; attached to it &lt;code&gt;_word_&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Call the following word &lt;code&gt;_object_&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Remove all &lt;code&gt;'s&lt;/code&gt;s and &lt;code&gt;_object_&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Insert &lt;code&gt;The _object_ of&lt;/code&gt; two words before &lt;code&gt;_word_&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;If there are not two words before &lt;code&gt;_word_&lt;/code&gt;, place &lt;code&gt;_object_&lt;/code&gt; right before &lt;code&gt;_word_&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Here are some more examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Then the red horse stopped and took the orangutang's oranges. What a fuss ensued!&#xA;Then the red horse stopped and took the oranges of the orangutang. What a fuss ensued!&#xA;&#xA;It is the people's right to not own anything!&#xA;It is the right of the people to not own anything!&#xA;&#xA;The world's tallest building was once the Empire State Building.&#xA;The tallest of the world building was once the Empire State Building.&#xA;&#xA;Bill likes Fred's shoes, and Jill likes Beth's dress.&#xA;Bill likes the shoes of Fred, and Jill likes the dress of Beth.&#xA;&#xA;Ryan's fear was a stack overflow.&#xA;The fear of Ryan was a stack overflow.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="42854" LastActivityDate="2017-10-28T23:22:16.617" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14124" PostTypeId="1" CreationDate="2017-10-29T02:32:23.987" Score="16" ViewCount="371" Body="&lt;p&gt;Occasionally, spammers show up on PPCG and post spam, including stuff like promotion of (probably fake) products, (probably fake) offers to transfer money into your account (after you give them $500 dollars), etc.&lt;/p&gt;&#xA;&lt;p&gt;Upon seeing this, it might make sense to downvote, flag, and delete. However, if everyone does that, then the answer (or question) will be deleted before a Six Flag Combo can be processed.&lt;/p&gt;&#xA;&lt;p&gt;How should we treat spam posts?&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-04-27T03:16:47.890" LastActivityDate="2021-04-27T03:16:47.890" Title="How do we handle spam posts?" Tags="|discussion|flags|spam|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="14125" PostTypeId="2" ParentId="14124" CreationDate="2017-10-29T02:32:23.987" Score="29" Body="&lt;h1&gt;Flag, don't vote to delete&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If three people vote to delete it before six spam flags get through, then the post will have to be undeleted before it can continue to be flagged. If six flags get through, that post is deleted and locked by Community (and gets its content shoved into the revision history), which will also remove 100 reputation from that user (assuming they had any, which they almost always don't) and eventually ban their account and/or that IP address.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If people delete the post, the spammer will be free to continue, which clutters up our beloved site (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/citation-needed&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;citation-needed&amp;#39;&quot; rel=&quot;tag&quot;&gt;citation-needed&lt;/a&gt;) and is in general, extremely annoying to deal with.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If everyone instead flags it as spam and downvotes it (a spam flag is also an automatic downvote from Community), it will be deleted by Community which can also help stop the spammer from continuing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So overall, don't vote to delete spam; flag it as spam, maybe post a link to chat (along with a note to not delete it), and be on your way :)&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2017-10-29T02:32:23.987" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14126" PostTypeId="2" ParentId="14120" CreationDate="2017-10-29T03:00:17.650" Score="8" Body="&lt;p&gt;Most of the flags were cast on &lt;em&gt;thank you&lt;/em&gt; replies to suggested improvements, which had been incorporated and acknowledged in their respective answers. Neither the &lt;em&gt;thank you&lt;/em&gt; comments nor the original suggestions served any purpose anymore, so I deleted them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, the answer of one of the comments did not mention it at all. While I'm not sure the &lt;em&gt;thank you&lt;/em&gt; comment is still &lt;em&gt;needed&lt;/em&gt;, deleting a reply to a post without deleting the post itself felt awkward, so I decided to preserve both comments.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-10-29T03:00:17.650" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14127" PostTypeId="2" ParentId="2140" CreationDate="2017-10-29T19:37:20.137" Score="0" Body="&lt;h1&gt;Are these numbers perfect for each other?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;A &lt;em&gt;perfect number&lt;/em&gt; is a &lt;strong&gt;number that is the sum of its divisors&lt;/strong&gt;. Examples of perfect numbers are:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;     | Divisors                                  | Divisor sum&#xA;-----+-------------------------------------------+-------------&#xA;6    | 1, 2, 3                                   | 6&#xA;28   | 1, 2, 4, 7, 14                            | 28&#xA;496  | 1, 2, 4, 8, 16, 31, 62, 124, 248          | 496&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Similarly, numbers that are perfect for each other are numbers where &lt;strong&gt;each is the sum of the other's divisors&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;     | Divisors                                  | Divisor sum&#xA;-----+-------------------------------------------+-------------&#xA;220  | 1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110   | 284&#xA;284  | 1, 2, 4, 71, 142                          | 220&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a &lt;strong&gt;program/function&lt;/strong&gt; that takes &lt;strong&gt;two positive integers&lt;/strong&gt; and outputs a truthy/falsey value based on &lt;strong&gt;whether they are perfect for each other&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Specifications&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot; title=&quot;Default for Code Golf: Input/Output methods&quot;&gt;Standard I/O rules&lt;/a&gt; &lt;strong&gt;apply&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot; title=&quot;Loopholes that are forbidden by default&quot;&gt;Standard loopholes&lt;/a&gt; are &lt;strong&gt;forbidden&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The output &lt;strong&gt;must be consistent&lt;/strong&gt; for both truthy and falsey values.&lt;/li&gt;&#xA;&lt;li&gt;This challenge is not about finding the shortest approach in all languages, rather, it is about finding the &lt;strong&gt;shortest approach in each language&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Your code will be &lt;strong&gt;scored in bytes&lt;/strong&gt;, usually in the encoding UTF-8, unless specified otherwise.&lt;/li&gt;&#xA;&lt;li&gt;Built-in functions that perform this task are &lt;strong&gt;allowed&lt;/strong&gt; but including a solution that doesn't rely on a built-in is encouraged.&lt;/li&gt;&#xA;&lt;li&gt;Explanations, even for &amp;quot;practical&amp;quot; languages, are &lt;strong&gt;encouraged&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input         Output&#xA;&#xA;1, 1          truthy&#xA;3, 7          falsey&#xA;6, 6          truthy&#xA;13, 42        falsey&#xA;220, 284      truthy&#xA;563, 492      truthy&#xA;1184, 1210    truthy&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In a few better formats:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1, 1&#xA;3, 7&#xA;6, 6&#xA;13, 42&#xA;220, 284&#xA;563, 492&#xA;1184, 1210&#xA;&#xA;1 1&#xA;3 7&#xA;6 6&#xA;13 42&#xA;220 284&#xA;563 492&#xA;1184 1210&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Reference implementation&lt;/h2&gt;&#xA;&lt;p&gt;This is written in &lt;a href=&quot;https://www.haskell.org/&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Haskell Language&quot;&gt;Haskell&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-hs prettyprint-override&quot;&gt;&lt;code&gt;divisors :: Integer -&amp;gt; [Integer]&#xA;divisors 1 = [1]&#xA;divisors n = [i | i &amp;lt;- [1..n - 1], n `mod` i == 0]&#xA;&#xA;perfectPair :: (Integer, Integer) -&amp;gt; Bool&#xA;perfectPair (a, b) = (sum $ divisors a) == b &amp;amp;&amp;amp; (sum $ divisors b) == a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##ZY49b4MwFEV3fsUdosiWDMIOoTQqGbp1qJQdIWGKk1rlS4Z06n@nflUaUXV6V@883@N3PX2Ytl2Wxn7aaXATDge89LO5GIfwiOKWy@B@IJGjkKtFTwuLL1g8hR5FUY8QshSeVN3QVB7kOeIyCEbjzuZtPmnrSMRu7eJXycn5PAztn0umBWruLWy6dtjgbtacimtst/9Q/YP00mlL/@v0@Ao2OtvPiLAq5yiYFJBcgO0EHmimAilNpWIBlSWU96mnyaOiLGWW@CdKxrxcvgE&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Haskell – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14127&quot; title=&quot;Sandbox for Proposed Challenges&quot;&gt;This challenge was sandboxed.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="68615" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-10-29T19:37:20.137" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14128" PostTypeId="2" ParentId="14124" CreationDate="2017-10-30T01:24:13.277" Score="17" Body="&lt;p&gt;In addition to HyperNeutrino's excellent answer:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you see a spam post, make sure to check in &lt;a href=&quot;https://chat.stackexchange.com/rooms/11540/charcoal-hq&quot;&gt;Charcoal HQ&lt;/a&gt; and see if it's been reported. If not, report it with &lt;code&gt;!!/report &amp;lt;url&amp;gt;&lt;/code&gt; - you'll be helping a group of volunteers enhance a system that automatically scans every post on the SE network and tries to figure out if it is spam based on previous spam post patterns. Spammers are constantly getting more sophisticated to get around spam filters, so do your part to fight back against them!&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2017-10-30T20:28:10.153" LastActivityDate="2017-10-30T20:28:10.153" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14129" PostTypeId="1" CreationDate="2017-10-30T08:10:41.343" Score="11" ViewCount="295" Body="&lt;p&gt;Recently, the challenge rate on PPCG has dropped. I haven't looked through the numbers all the way back, but we &lt;a href=&quot;https://meta.stackexchange.com/q/274340/243806&quot;&gt;once had 9.9 questions per day&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The number of questions per day is of course not the best measure since we want good question, not bad ones, and &lt;a href=&quot;https://en.wikipedia.org/wiki/Sturgeon&amp;#39;s_law&quot; rel=&quot;nofollow noreferrer&quot;&gt;90 % of everything is crap&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are a lot of users attempting to post challenges, and a many are downvoted (/not upvoted), closed and sometimes deleted. I agree with most of those votes, and there are definitely a lot of bad challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I believe that we would get more good questions if more of the top users decided to write more questions. Writing questions is admittedly something very different from answering, and it requires another type of creativity. But, I believe most answerers would be able to write good/great/popular questions, and we would all benefit from those.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Do we want to actively encourage this? If so, how can we encourage more users to post (good) questions? &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is similar to (or even a dupe of) &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2012/31516&quot;&gt;this question&lt;/a&gt;, but the other one is three years old, and things change (we are graduated, and there are more active users).&lt;/p&gt;&#xA;" OwnerUserId="31516" LastEditorUserId="31516" LastEditDate="2017-10-30T08:38:09.623" LastActivityDate="2017-10-30T08:38:09.623" Title="Can we encourage more users to post challenges?" Tags="|discussion|asking-questions|" AnswerCount="0" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="14133" PostTypeId="2" ParentId="2140" CreationDate="2017-10-30T21:18:55.677" Score="1" Body="&lt;h1&gt;Square-free Rock-Paper-Scissors tournament&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;On the day of the Codegolf &lt;em&gt;Rock-Paper-Scissors tournament&lt;/em&gt; you hear through the grapevine that everybody else is going to play a fix &lt;em&gt;square-free&lt;/em&gt; sequence (a sequence made of the letters &lt;code&gt;R&lt;/code&gt;, &lt;code&gt;P&lt;/code&gt;, &lt;code&gt;S&lt;/code&gt; is square-free if it does not contain a subsequence that repeats twice. See &lt;a href=&quot;https://codegolf.stackexchange.com/questions/146675/dont-repeat-yourself-in-rock-paper-scissors&quot;&gt;Don&amp;#39;t repeat yourself in Rock-Paper-Scissors&lt;/a&gt; for details.) &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program that for a game of &lt;code&gt;N&lt;/code&gt; rounds, in each round &lt;code&gt;n&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;prints one of &lt;code&gt;R&lt;/code&gt;, &lt;code&gt;P&lt;/code&gt;, &lt;code&gt;S&lt;/code&gt; - its own &lt;code&gt;n&lt;/code&gt;th hand (using all information gained so far)&lt;/li&gt;&#xA;&lt;li&gt;receives an input of either &lt;code&gt;R&lt;/code&gt;, &lt;code&gt;P&lt;/code&gt;, &lt;code&gt;S&lt;/code&gt; - the &lt;code&gt;n&lt;/code&gt;th letter of the opponent's sequence&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Rock beats scissors, scissors beats paper, paper beats rock.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The &quot;opponents&quot; are all the square-free sequences of the given length.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program may read the opponents moves at once and print its own moves - as long as it is functionally equivalent to a program reading the moves in the order specified in section &quot;task&quot;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The program does not carry a state between playing against different opponents.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each entry should include a scoring script computing the score of the candidate against all square-free sequences of length &lt;code&gt;N&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I am posting this to get some input about interesting scoring methods and a good choice of &lt;code&gt;N&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Programs should score high if they &lt;em&gt;win&lt;/em&gt; against a large fraction of square free sequences in an economic way. A possible criterium of &quot;winning&quot; against a single sequence is winning more hands against an opponent than losing.&#xA;A possible criterium of scoring high is number of games won divided by the root of bytes. &lt;/p&gt;&#xA;" OwnerUserId="45211" LastEditorUserId="45211" LastEditDate="2017-10-30T21:32:11.043" LastActivityDate="2017-10-30T21:32:11.043" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14134" PostTypeId="2" ParentId="2140" CreationDate="2017-10-30T22:17:29.263" Score="0" Body="&lt;h1&gt;Self-language validator&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/classification&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;classification&amp;#39;&quot; rel=&quot;tag&quot;&gt;classification&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;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. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;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. &lt;/li&gt;&#xA;&lt;li&gt;Your submission must have cases where it returns a truthy value, and cases where it returns a falsey value. &lt;/li&gt;&#xA;&lt;li&gt;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. &lt;/li&gt;&#xA;&lt;li&gt;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. &lt;/li&gt;&#xA;&lt;li&gt;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. &lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="43363" LastEditorUserId="43363" LastEditDate="2017-10-30T23:17:53.923" LastActivityDate="2017-10-30T23:17:53.923" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14135" PostTypeId="1" CreationDate="2017-10-31T09:00:27.727" Score="1" ViewCount="75" Body="&lt;p&gt;Many &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov&lt;/a&gt; challenges are closed as duplicates of the &lt;a href=&quot;https://codegolf.stackexchange.com/q/6043/31516&quot;&gt;Rickroll&lt;/a&gt; challenge. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; challenges are closed as duplicates of various other challenges that are somewhat similar. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges are closed as duplicates of challenges that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/139463/optimal-path-through-a-matrix#comment342259_139463&quot;&gt;touch the same concepts&lt;/a&gt; as other challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question rate has dropped, and there are fewer new challenges now, than a few years ago. This is not strange, since it's getting harder and harder to come up with original ideas. I think it's safe to say that most people are more interested in answering new challenges than older ones&lt;sup&gt;1&lt;/sup&gt;. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;So, is it really a problem if a question is similar to another one? &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Why can't we have ASCII-art challenges that are somewhat similar to another one?&lt;/li&gt;&#xA;&lt;li&gt;Why can't we have Kolmorogov challenges that are somewhat similar to another one?&lt;/li&gt;&#xA;&lt;li&gt;Why can't we have code-golf challenges that are somewhat similar to another one?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I guess the answers to this question will be one of the two below. I'm curios to see which one attracts the most votes.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I'm quite tired of this general attitude that nothing is a duplicate because of minor differences in the approach of language X.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I'm quite tired of people spoiling challenges because of faint similarities. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Note: This is a &lt;em&gt;question&lt;/em&gt;, not an opinion, so a vote on the question doesn't show which side you're on. Please up/downvote the &lt;em&gt;answers&lt;/em&gt; you agree/disagree with.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;sup&gt;1&lt;/sup&gt;Maybe not you, but I'm generalizing here.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="31516" LastActivityDate="2017-10-31T09:00:27.727" Title="Does everything have to be original?" Tags="|discussion|duplicates|challenges|" AnswerCount="0" CommentCount="5" ClosedDate="2017-10-31T12:05:34.720" ContentLicense="CC BY-SA 3.0" />
  <row Id="14136" PostTypeId="1" AcceptedAnswerId="14137" CreationDate="2017-10-31T11:19:32.173" Score="11" ViewCount="274" Body="&lt;p&gt;There is currently &lt;a href=&quot;https://codegolf.stackexchange.com/q/8405/45941&quot;&gt;a challenge to compute the determinant of a matrix&lt;/a&gt;. However, it was written 5 years ago, before our current quality standards were established. It falls short of those standards in several ways:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Inflexible I/O (must be STDIN and STDOUT)&lt;/li&gt;&#xA;&lt;li&gt;Cumbersome I/O format (whitespace-separated input)&lt;/li&gt;&#xA;&lt;li&gt;Underspecified (the ring in which the matrix elements belong is unspecified -&#xA;many answers make assumptions)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Most of the 8 answers are quite old. All but 2 are from 2012, shortly after the challenge was posed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does this challenge deserve a rewrite?&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2017-10-31T11:28:21.103" LastActivityDate="2017-10-31T11:34:51.330" Title="Should we have a new, improved matrix determinant challenge?" Tags="|discussion|policy|challenge-quality|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14137" PostTypeId="2" ParentId="14136" CreationDate="2017-10-31T11:21:20.840" Score="19" Body="&lt;h2&gt;Yes, it does&lt;/h2&gt;&#xA;&lt;p&gt;As I noted in the question, the challenge has several flaws that make it a poor fit for the current state of the site. Rather than making large edits to the challenge and potentially invalidating old answers (as well as making them uncompetitive), it would be much better to write a new version of the challenge that is up to modern quality standards, and close the old challenge as a dupe of the new one.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-10-31T11:21:20.840" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14140" PostTypeId="1" CreationDate="2017-10-31T13:11:44.923" Score="34" ViewCount="277" Body="&lt;p&gt;I'm proposing a new tag named &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interactive&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interactive&amp;#39;&quot; rel=&quot;tag&quot;&gt;interactive&lt;/a&gt; for challenges that go beyond simple stdin/stdout processing. This would be challenges that require the program to respond to user input in some fashion, interactively.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/146809&quot;&gt;The shortest distance between two points is a line&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/109155/42963&quot;&gt;Create a Checkbox&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/117162/42963&quot;&gt;Create a Paint program!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/146587/42963&quot;&gt;Type the Alphabet - as fast as you can!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/108468/42963&quot;&gt;Implement a Stopwatch&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Etc.&lt;/p&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="8478" LastEditDate="2017-11-30T08:35:06.383" LastActivityDate="2017-11-30T08:35:06.383" Title="Tag Proposal: [Interactive]" Tags="|discussion|status-completed|tags|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14142" PostTypeId="2" ParentId="2140" CreationDate="2017-10-31T20:05:34.577" Score="4" Body="&lt;h1&gt;LaTeX truth tables&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program or a function that accepts the list of outputs from a logic function and outputs the LaTeX code for its truth table.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The inputs should be labeled as lowercase letters &lt;code&gt;a-z&lt;/code&gt;, and the output should be labelled as &lt;code&gt;F&lt;/code&gt;. The length of list of inputs will always be shorter than &lt;code&gt;2^25&lt;/code&gt;, which means that number of inputs will always be less than 25, so you can use letters from lowercase alphabet for input names.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A number &lt;code&gt;n&lt;/code&gt; of inputs and list of length &lt;code&gt;2^n&lt;/code&gt; of binary numbers which represents the outputs of a logical function.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;LaTeX code that produces the truth table for that function. Input and output values should be centered in rows.&#xA;There must be a line between table header and its values and between inputs and output, so the code should be similar to that below.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;\begin{tabular}{c * &amp;lt;NUMBER OF INPUTS&amp;gt;|c}&#xA;&amp;lt;INPUTS&amp;gt;&amp;amp;F\\&#xA;\hline&#xA;&amp;lt;INPUT VECTOR i&amp;gt;&amp;amp;&amp;lt;OUTPUT&amp;gt;\\&#xA;\end{tabular}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2&#xA;[0, 0, 0, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;\begin{tabular}{cc|c}&#xA;a &amp;amp; b &amp;amp; F \\&#xA;\hline&#xA;0 &amp;amp; 0 &amp;amp; 0 \\&#xA;0 &amp;amp; 1 &amp;amp; 0 \\&#xA;1 &amp;amp; 0 &amp;amp; 0 \\&#xA;1 &amp;amp; 1 &amp;amp; 1 \\&#xA;\end{tabular}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which when displayed in LaTeX shows the following truth table&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/8UwyT.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/8UwyT.png&quot; alt=&quot;Truth table&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;General rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins.  &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Default Loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="30715" LastEditorUserId="30715" LastEditDate="2017-11-02T09:39:52.760" LastActivityDate="2017-11-02T09:39:52.760" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14143" PostTypeId="2" ParentId="14116" CreationDate="2017-10-31T20:56:39.260" Score="7" Body="&lt;h2&gt;Existing consensus supports this&lt;/h2&gt;&#xA;&lt;p&gt;As user Challenger5 mentioned in a comment, a previous question about control characters in ascii-art challenges yielded &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5515/71434&quot;&gt;this&lt;/a&gt; consensus, which states that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; challenges are about displaying an image comprised of ASCII characters, NOT about replicating a byte string. Thus the fact that SmileBASIC does not need to use the newline character to separate lines of output is immaterial: Being able to display the requested image means that portion of the challenge is complete, though it does not necessarily exempt an answer from other rules.&lt;/p&gt;&#xA;&lt;p&gt;With regards to answers banning a trailing newline, I personally think that falls into a similar category as answers banning built-in solutions and if an asker wishes to include the rule anyway then it is THEIR job to be specific about what they ban. Thus, if your solution does not include the newline character after the last line then it doesn't have a trailing newline.&lt;/p&gt;&#xA;&lt;h2&gt;Exceptions&lt;/h2&gt;&#xA;&lt;p&gt;I stated that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; is not about replicating a byte string. However, there is an overlapping tag which IS often about replicating a byte string: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;. As a general rule, I would say that any Kolmogorov complexity challenge does require exactly a newline character in the answer's output where there is a newline character in the requested output. This would include challenges which are both ASCII art and Kolmogorov complexity.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-11-08T05:33:36.260" CommentCount="1" CommunityOwnedDate="2017-10-31T20:56:39.260" ContentLicense="CC BY-SA 3.0" />
  <row Id="14144" PostTypeId="2" ParentId="14140" CreationDate="2017-10-31T21:07:05.190" Score="36" Body="&lt;h2&gt;Yes, this should be a tag&lt;/h2&gt;&#xA;&lt;p&gt;It checks off the 3 criteria I believe are important for new tags:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It concerns a quality not covered by other tags.&lt;/li&gt;&#xA;&lt;li&gt;It is a useful quality that users would want to seek out (or avoid).&lt;/li&gt;&#xA;&lt;li&gt;It has a meaningful name.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-10-31T21:07:05.190" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14150" PostTypeId="2" ParentId="2140" CreationDate="2017-11-02T15:38:44.337" Score="0" Body="&lt;h1&gt;Tetris battle&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tetris&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tetris&amp;#39;&quot; rel=&quot;tag&quot;&gt;tetris&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I guess you know what Tetris is, but if you don't I'll try to explain:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So there is a 2 dimensional board, often with size 10x20. On the top of the board, in the middle, there is a random tetrominoe (also rotated randomly), a figure made of 4 squares. There are 7 shapes:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;L    J   S    Z    T   O   I&#xA;&#xA;#    #   ##  ##   ###  ##  #&#xA;#    #  ##    ##   #   ##  #&#xA;##  ##                     #&#xA;                           #&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Every second, the tetrominoe (later called &quot;block&quot;) will move 1 cell to the bottom until there is no space left. Player can control it - Move it to left, right, rotate it by 90 degrees (left or right) or speed up its fall. When it can't fall down further, a new block is created and you take the control over it, losing possibility to move the previous block.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The target is to get as much points as possible. Player can get them, by filling a line (which is then removed)&lt;/strong&gt;, for example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;        !&#xA;        !&#xA;        !&#xA;****####!$ &amp;lt;- user scores a point, the line is now removed&#xA; &amp;amp;&amp;amp;&amp;amp;&amp;amp;  $$$ &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;different character is a different block&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Player can lose if there is no place for a new block to spawn.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://codeincomplete.com/games/tetris/&quot; rel=&quot;nofollow noreferrer&quot;&gt;You can play Tetris online here&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;The battle&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you will have to create a bot to play Tetris. Unlike a normal playthrough, there will be two players playing on a single board.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's call the bots A and B.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Block spawning&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Every block will start on the left, or right side, depending which bot's it is (left - A, right - B). There will be a 2 block margin, so the block will have some space to rotate. Block will always spawn with left/right align, not centered.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If a block can't fit, it will try to rotate, so it can be placed. If all 4 directions fail, you die.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Example for 10 width board:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;--A----B--&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Random size board&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Width&lt;/strong&gt;: random even number between 8 and 16.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Height&lt;/strong&gt;: random number between 15 and 25.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's to make it a bit harder. Try to plan your strategy so it fits all the heights!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You gain 1 point per destroyed block. Some bonus rules apply:&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Enemy's block isn't my block&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You can't use blocks placed by your enemy to gain score. After adding the last block to a line, you gain as much score as much sub-blocks you placed in it. Enemy sub-blocks don't count. Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Player A filled the line.&#xA;AAAABBBAAB&#xA;Player A gets 6 points.&#xA;Player B doesn't earn any.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Combos&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If you do a move that removes more than just 1 line, you gain x times more score. Of course, x is the amount of lines.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Player A filled the line&#xA;--ABBB&#xA;AAABBBABBB &amp;lt;&#xA;BBBBBBABBB &amp;lt;&#xA;BBBBAAABBB &amp;lt; &#xA; B AA ABBB&#xA;Player A removed 3 lines.&#xA;Player A removed 12 (4+5+3) blocks he owns.&#xA;Player A scores 36 points.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Death &amp;amp; Game Over&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;When a new fails to spawn, it tries to rotate 90, 180, 270 or 360 degrees. If it still can't spawn. You lose. Note it won't try to change it's position, so be careful and try to not put any blocks in the spawn area.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When you die, you can't place any more blocks. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In case your enemy has more points than you, you lose. &lt;/li&gt;&#xA;&lt;li&gt;Otherwise, the game doesn't end yet – the enemy will get double points for the next 10 blocks. The game will end when the bonus ends, when he beats your score or when he dies.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;When the game is over, the bot with more points win.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The game will also end automatically after 300 actions. See API &gt; Actions section for more information.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Controller&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Work in progress. &lt;a href=&quot;https://github.com/Soaku/Tetris-KOTH&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://github.com/Soaku/Tetris-KOTH&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;API&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Can't really tell you how it's gonna look like without a controller, right?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, there is a project of how it's gonna look like:&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Actions&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Every game consists of actions. Your bot function will be executed at the beginning of each action. At the end of each, active tetrominoes will move 1 cell to the bottom.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The controller will wait a configurable amount of time between actions unless the preview is disabled.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your function should return an integer in at most 0.1 seconds, otherwise your action is terminated and ignored. If it will cross the limit repeatedly, I might remove it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Default loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;Aggressive bots are allowed but discouraged.&lt;/li&gt;&#xA;&lt;li&gt;You cannot use any external libraries. The controller uses jQuery, but you aren't allowed to use it.&lt;/li&gt;&#xA;&lt;li&gt;Don't try to access the document – Don't write nor read data.&lt;/li&gt;&#xA;&lt;li&gt;Don't write your bot to beat specific enemies by countering their strategies.&lt;/li&gt;&#xA;&lt;li&gt;Enemy spawn works like an occupied block. You cannot place anything here.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Main scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Every bot will play with every other bot.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Scoring works this way:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Victory: 2 points&lt;/li&gt;&#xA;&lt;li&gt;Tie: 1 point&lt;/li&gt;&#xA;&lt;li&gt;Lose: 0 points&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="72792" LastEditorUserId="72792" LastEditDate="2018-11-21T15:10:24.980" LastActivityDate="2018-11-21T15:10:24.980" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="14152" PostTypeId="2" ParentId="2140" CreationDate="2017-11-02T19:24:32.567" Score="0" Body="&lt;h1&gt;UTF-8 repair&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/unicode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;unicode&amp;#39;&quot; rel=&quot;tag&quot;&gt;unicode&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;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. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;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. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Replace overlong sequences with their equivalent minimal-length encodings. &lt;/li&gt;&#xA;&lt;li&gt;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). &lt;/li&gt;&#xA;&lt;li&gt;Replace any run of extraneous bytes taking the form 0b10xxxxxx with a single replacement character. &lt;/li&gt;&#xA;&lt;li&gt;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. &lt;/li&gt;&#xA;&lt;li&gt;Convert a high surrogate character followed by a low surrogate character to the utf-8 encoding of the supplemental plane codepoint it represents. &lt;/li&gt;&#xA;&lt;li&gt;Replace extraneous surrogate characters with the replacement character. &lt;/li&gt;&#xA;&lt;li&gt;Remove the initial byte order mark (\uFEFF), if one occurs at the start of the string. &lt;/li&gt;&#xA;&lt;li&gt;Keep all other characters intact. Make particular care to make sure that null characters are handled correctly. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The following are errors:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An inverted byte order mark (\uFFFE) occurs at the start of a string. &lt;/li&gt;&#xA;&lt;li&gt;The transformed string consists of more than 16 codepoints, and more than 1/8 of them correspond to bad byte sequences. &lt;/li&gt;&#xA;&lt;li&gt;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. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;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. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard loopholes apply. As with all code golf challenges, shortest submission wins. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To be added if this submission gains traction. &lt;/p&gt;&#xA;" OwnerUserId="43363" LastEditorUserId="43363" LastEditDate="2017-11-03T00:04:36.427" LastActivityDate="2017-11-03T00:04:36.427" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14154" PostTypeId="1" AcceptedAnswerId="14156" CreationDate="2017-11-02T20:31:29.907" Score="2" ViewCount="170" Body="&lt;p&gt;We shall first define AutoCompletion as being the addition of any code segments to the code before either compile or run time as the direct result a keystroke and independent of outside information.&lt;/p&gt;&#xA;&lt;p&gt;Note that this is not the same as typing or using &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10258/how-to-count-bytes-in-languages-with-autoformatters/10259&quot;&gt;autoformatting&lt;/a&gt; (which has been designated as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10259/61846&quot;&gt;valid&lt;/a&gt; by the community).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To further explain this, consider the following Segment of VBA code which uses AutoCompletion:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-vb prettyprint-override&quot;&gt;&lt;code&gt;Sub H(): Debug.Print &amp;quot;Hello World&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;After pasting this code into the VBE (Visual Basic Enviornment) and upon upon pressing &lt;kbd&gt;Enter&lt;/kbd&gt;, &lt;kbd&gt;&lt;strong&gt;→&lt;/strong&gt;&lt;/kbd&gt;, &lt;kbd&gt;&lt;strong&gt;↓&lt;/strong&gt;&lt;/kbd&gt; or &lt;kbd&gt;&lt;strong&gt;↑&lt;/strong&gt;&lt;/kbd&gt; (Iff the cursor is not on the first line of editor) this is AutoCompleted to&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-vb prettyprint-override&quot;&gt;&lt;code&gt;Sub H(): Debug.Print &amp;quot;Hello World&amp;quot;&#xA;&#xA;End Sub&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Of Note, this can and often is combined with autoformatting, for instance, the below shall also AutoFormat and AutoComplete to the above.&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-vb prettyprint-override&quot;&gt;&lt;code&gt;Sub H:Debug.?&amp;quot;Hello World&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;However, in this case, the addition of the terminal &lt;code&gt;&amp;quot;&lt;/code&gt; is AutoFormatting whereas the addition of &lt;code&gt;\n\nEnd Sub&lt;/code&gt; is AutoCompletion.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;So, with this information is AutoCompletion Valid for CodeGolf?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Note that this question has been asked not so that this may be done, but because I have observed it several times in the past&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="61846" LastEditorUserId="61846" LastEditDate="2022-01-19T14:33:36.777" LastActivityDate="2022-01-19T14:33:36.777" Title="Is AutoCompletion Valid" Tags="|discussion|" AnswerCount="3" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="14155" PostTypeId="2" ParentId="14154" CreationDate="2017-11-02T20:31:29.907" Score="-7" Body="&lt;h1&gt;Yes, AutoCompletion is Valid&lt;/h1&gt;&#xA;&lt;p&gt;AutoCompletion is valid and shall incur a byte count deficit, in bytes, that is exactly equal to the number of key presses that were necessary to make the AutoCompletion occur.&lt;/p&gt;&#xA;&lt;p&gt;This means that for the first example in the question statement above the byte count shall be 35 Bytes ( 34 Bytes of Code + 1 Byte for a trailing &lt;code&gt;Enter&lt;/code&gt; key press)&lt;/p&gt;&#xA;" OwnerUserId="61846" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-11-02T20:31:29.907" CommentCount="1" CommunityOwnedDate="2017-12-18T21:40:03.223" ContentLicense="CC BY-SA 3.0" />
  <row Id="14156" PostTypeId="2" ParentId="14154" CreationDate="2017-11-02T20:34:53.270" Score="8" Body="&lt;h1&gt;No, it is not valid.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Code completion is a feature of the IDE which modifies the code before running. The byte count should be the code &lt;em&gt;after modification&lt;/em&gt; - the code that is actually run.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Not only does this make sense as it counts the bytes of the &lt;em&gt;actual code&lt;/em&gt; being run, but it also prevents a loophole where a user could create an IDE that 'autocompletes' to the extreme, adding several utility functions and other additional code before running, to greatly reduce the byte count.&lt;/p&gt;&#xA;" OwnerUserId="60919" LastActivityDate="2017-11-02T20:34:53.270" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="14157" PostTypeId="2" ParentId="2140" CreationDate="2017-11-02T20:57:13.637" Score="0" Body="&lt;h1&gt;Budget my lunch!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;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;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;3 Falafel&lt;/li&gt;&#xA;&lt;li&gt;2 Flatbreads&lt;/li&gt;&#xA;&lt;li&gt;A serving of houmous&lt;/li&gt;&#xA;&lt;li&gt;Some lettuce&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;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 &lt;em&gt;x&lt;/em&gt; number of days, and that is where you come in!&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;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;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;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!&lt;/li&gt;&#xA;&lt;li&gt;Each pack of flatbreads contains 6 flatbreads and costs £1.&lt;/li&gt;&#xA;&lt;li&gt;Each pot of houmous contains 4 servings and costs £1.10.&lt;/li&gt;&#xA;&lt;li&gt;Each head of lettuce provides 7 servings and costs 46p (£0.46).&lt;/li&gt;&#xA;&lt;li&gt;Houmous and flatbread both go off over the weekend/I eat them so have to be bought fresh on Monday.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;The Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;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.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first integer represents the starting day e.g. 1=Monday, 2=Tuesday etc. This will always be between 1 and 5 inclusive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The second integer is the number of days to budget for &lt;em&gt;not including weekends&lt;/em&gt; e.g. an input of 1 and 5 would be budgeting my lunch for each day of the standard working week.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sample program&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Below is a &lt;strong&gt;throroughly ungolfed&lt;/strong&gt; program to use as reference and clarification of the above rules.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;public static double budgetMyLunch(int startDay, int days){&#xA;    double totalCost = 0;&#xA;&#xA;    final double falafelCost = 1.5;&#xA;    final int falafelsInPack = 8;&#xA;    int falafels = 0;&#xA;    int falafelPackCount = 0;&#xA;&#xA;    final double flatbreadCost = 1;&#xA;    final double flatbreadsInPack = 6;&#xA;    int flatbreads = 0;&#xA;&#xA;    final double houmousCost = 1.1;&#xA;    final int houmousServings = 4;&#xA;    int houmous = 0;&#xA;&#xA;    final double lettuceCost = 0.46;&#xA;    final int lettuceServings = 7;&#xA;    int lettuce = 0;&#xA;&#xA;    int endDay = startDay + days;&#xA;    int currentDay = startDay;&#xA;&#xA;    while(currentDay&amp;lt;endDay){&#xA;&#xA;        // If there are less than 3 falafels I have to buy some more&#xA;        if(falafels&amp;lt;3){&#xA;            falafelPackCount++;&#xA;            falafels += falafelsInPack;&#xA;            // Every third pack of falafel I get lucky and it has 9 instead of 8!&#xA;            if(falafelPackCount%3==0) falafels++;&#xA;            totalCost += falafelCost;&#xA;        }&#xA;&#xA;        // If there are less than 2 flatbreads I have to buy some more&#xA;        if(flatbreads&amp;lt;2){&#xA;            flatbreads += flatbreadsInPack;&#xA;            totalCost += flatbreadCost;&#xA;        }&#xA;&#xA;        // If there are no servings of houmous left I have to buy some more&#xA;        if(houmous == 0){&#xA;            houmous += houmousServings;&#xA;            totalCost += houmousCost;&#xA;        }&#xA;&#xA;        // If there is no lettuce left I have to buy some more&#xA;        if(lettuce == 0){&#xA;            lettuce += lettuceServings;&#xA;            totalCost += lettuceCost;&#xA;        }&#xA;&#xA;        // Use up the ingredients for my lunch!&#xA;        falafels -= 3;&#xA;        flatbreads -= 2;&#xA;        houmous -= 1;&#xA;        lettuce -= 1;&#xA;&#xA;        // If it's the end of the week, I eat the remaining&#xA;        // houmous and flatbread over the weekend&#xA;        if(currentDay%5==0){&#xA;            houmous = 0;&#xA;            flatbreads = 0;&#xA;        }&#xA;&#xA;        currentDay++;&#xA;    }&#xA;    return totalCost;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Questions for sandbox&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any suggested tags other than &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; ?&lt;/li&gt;&#xA;&lt;li&gt;Is the question of appropriate complexity to be an interesting challenge? Should I add more rules?&lt;/li&gt;&#xA;&lt;li&gt;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?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="75077" LastActivityDate="2017-11-02T20:57:13.637" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14159" PostTypeId="2" ParentId="2140" CreationDate="2017-11-02T21:51:18.923" Score="-3" Body="&lt;p&gt;I have seen many a trivial answer in jelly, so i wish to propose:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge: A non-trivial answer&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input two strings &lt;/li&gt;&#xA;&lt;li&gt;If the two strings are integers and are equal, output a truthy value.&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, output a falsy value.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Clarifications&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may receive non-integer inputs.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You will never receive an integer that is outside the bounds [-2³¹, 2³¹).&#xA;Rules&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Standard loopholes are disallowed.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is not your standard code-golf&lt;/li&gt;&#xA;&lt;li&gt;the winner person who posts the longest program.&lt;/li&gt;&#xA;&lt;li&gt;an entry is invalidated if someone posts a shorter program in the same language.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="31202" LastActivityDate="2017-11-02T21:51:18.923" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14160" PostTypeId="2" ParentId="2140" CreationDate="2017-11-02T22:18:40.463" Score="1" Body="&lt;h1&gt;Polynomial Partition&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;META&lt;/strong&gt;: Right now I'm wondering whether it would be a more interesting challenge to have two imput lists, and the program just needs to find a polynomial that separates the two lists (i.e. no connected component can contain points of &lt;em&gt;both&lt;/em&gt; classes. Or altnernatively &lt;code&gt;f(x,y)&amp;gt;0&lt;/code&gt; for all &lt;code&gt;(x,y)&lt;/code&gt; in list &lt;code&gt;A&lt;/code&gt;, and &lt;code&gt;f(x,y)&amp;lt;0&lt;/code&gt; for all &lt;code&gt;(x,y)&lt;/code&gt; in list &lt;code&gt;B&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polynomials&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polynomials&amp;#39;&quot; rel=&quot;tag&quot;&gt;polynomials&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/partitions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;partitions&amp;#39;&quot; rel=&quot;tag&quot;&gt;partitions&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a finite list of at at least two points in the plane &lt;code&gt;ℝ²&lt;/code&gt; (all points in the list are unique), your program should find a polynomial &lt;code&gt;f&lt;/code&gt; in &lt;code&gt;ℝ[x,y]&lt;/code&gt; whose zero locus &lt;code&gt;Z(f) := {(x,y) ∊ ℝ² | f(x,y) = 0}&lt;/code&gt; partitions the plane such that each of the connected components of &lt;code&gt;ℝ²\Z(f)&lt;/code&gt; contains at most one point of the input list. The goal is finding such an &lt;code&gt;f&lt;/code&gt; of a low degree. (It does not have to be optimal.) Note that no point of the input list may be contained in &lt;code&gt;Z(f)&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;p&gt;The score for each test cases is the degree of the polynomial that your algorithm produces. The total score is the product of the scores of the testcases.&lt;/p&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;The points &lt;code&gt;{(0,0),(0,2)}&lt;/code&gt; can be separated by &lt;code&gt;f(x,y) = y - 1&lt;/code&gt; (degree 1) or &lt;code&gt;f(x,y) = x² + y² - 1&lt;/code&gt; (degree 2) or &lt;code&gt;f(x,y) = x³ + 1 - y&lt;/code&gt;(degree 3) or (infinitely) many more.&lt;/p&gt;&#xA;&lt;p&gt;The points &lt;code&gt;{(1,1),(-1,1),(-1,-1),(1,-1)}&lt;/code&gt; can be separated by &lt;code&gt;f(x,y) = xy&lt;/code&gt; (degree 2).&lt;/p&gt;&#xA;&lt;h3&gt;Test Battery&lt;/h3&gt;&#xA;&lt;p&gt;to be included...&lt;/p&gt;&#xA;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-11-04T10:00:26.413" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14161" PostTypeId="2" ParentId="2140" CreationDate="2017-11-03T01:00:03.340" Score="0" Body="&lt;h2&gt;Reverse a regex&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;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.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;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.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;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:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Unquoted nonmagic characters&lt;/li&gt;&#xA;&lt;li&gt;Quoted characters&lt;/li&gt;&#xA;&lt;li&gt;Character classes (anything from &lt;code&gt;[&lt;/code&gt; to an unquoted &lt;code&gt;]&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Symbols with repetition suffixes (assume that any of &lt;code&gt;+*?&lt;/code&gt; or &lt;code&gt;{...}&lt;/code&gt; is a valid repetition suffix)&lt;/li&gt;&#xA;&lt;li&gt;Parenthesised regexes (the inner regex will itself need to be reversed)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So for instance the reverse of &lt;code&gt;a{2,}(\*[b-g])+&lt;/code&gt; is &lt;code&gt;([b-g]\*)+a{2,}&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TODO: More examples, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules, loopholes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should I add lookaheads/behinds to the list or is that too complex?&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2017-11-03T13:39:45.610" LastActivityDate="2017-11-03T13:39:45.610" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14162" PostTypeId="2" ParentId="2140" CreationDate="2017-11-03T11:55:16.883" Score="2" Body="&lt;h1&gt;All ASCII Art&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You will be given a set of &lt;code&gt;x&lt;/code&gt;, &lt;code&gt;y&lt;/code&gt;, and &lt;code&gt;A&lt;/code&gt; pairs, where &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; represent a coordinate on a 2-d plain, and &lt;code&gt;A&lt;/code&gt; is some character. You may take these pairs in any convenient format, e.g. a list of lists, three separate lists, a list of pairs of lists, etc.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You will output a grid of spaces. However, at every coordinate specified in the input, the space should be replaced by the character. Basically, the input specifies the locations of characters, and you have to draw them.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Specifics&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; may be either a coordinate or a row-column pair (e.g. the origin can be in the bottom left, with &lt;code&gt;x&lt;/code&gt; increasing to the right and &lt;code&gt;y&lt;/code&gt; increasing up, &lt;strong&gt;or&lt;/strong&gt; the origin can be in the top left, with &lt;code&gt;x&lt;/code&gt; increasing to the right and &lt;code&gt;y&lt;/code&gt; increasing down).&lt;/li&gt;&#xA;&lt;li&gt;All characters are guaranteed to be printable ASCII, and will never be a space.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; are &gt;= 0&lt;/li&gt;&#xA;&lt;li&gt;You may output trailing whitespace (but not infinitely). What matters is that the output visually looks like what the input specified, not the whitespace.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Test cases format (the test cases have the origin at the top left corner; this is optional, see specifics):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# of coordinates&#xA;row col char&#xA;row col char&#xA;...&#xA;-----------&#xA;output&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2&#xA;0 0 :&#xA;0 1 )&#xA;-----------&#xA;:)&#xA;&#xA;3&#xA;0 0 -&#xA;0 1 _&#xA;0 2 -&#xA;-----------&#xA;-_-&#xA;&#xA;4&#xA;0 1 -&#xA;1 0 |&#xA;2 1 -&#xA;1 2 |&#xA;-----------&#xA; - &#xA;| |&#xA; - &#xA;&#xA;11&#xA;0 0 (&#xA;0 1 ^&#xA;0 2 o&#xA;0 3 ^&#xA;0 4 )&#xA;1 1 /&#xA;1 2 |&#xA;1 3 \&#xA;2 2 |&#xA;3 1 /&#xA;3 3 \&#xA;-----------&#xA;(^o^)&#xA; /|\&#xA;  |&#xA; / \&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##fVJNb8IwDL3nV1hcCGLrWthpZUjTTpPYiePGpCxkEChplYSyL347c9OAstItB7u137Of46xYyS7zQqjVfH04yE2RawsrDEZbK7PoTmv2MZHGpuQs90d4yplSQqeEFNvXTHLgGTMGHplU8EUI4PEJY5lFV@ZyDhtM06nVUi2eZsD0wvQQDf5UrUbO3C@ZZtwKPR4jB/HvcAtK7OCkdDSmvfTE9GrAeF@DfZROP4wVm0iqgCGVhTXiPCNS4t0@KBsWDVMTqUSYe8s10KqGxBpxim4Ea3T9fjiQk3actpCCC9NoWdeNTJFJSzvQCVocVVbToDKxQErBtBGVzLrYUzxrIfB/CEmTwPGmoUSGBwxmURW6szRuIHdLmQmg9ToiIz9ROIxuQTcnro5Hsfmcnq2tUXf/689dbOMNAM8zuPE127p5aQgLdPE2pBsZYZWwLnQbUs7l7AlpGWshLNW4NXT8AsqgSoBvnSTDff85imO4hXDEVNC2Efxrzrc2KvBpoYR/L7QJzxT9pder3h8OSUJiiIGiTeAF7QBytEP3fQ09kmD8Cu0AvtEO4ZkM3PfQxYcu8gM&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here is a Java program which can be used to test out inputs&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Really not a dupe?&lt;/li&gt;&#xA;&lt;li&gt;Is it clear enough?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56085" LastEditorUserId="56085" LastEditDate="2017-11-06T12:39:13.267" LastActivityDate="2017-11-06T12:39:13.267" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14164" PostTypeId="2" ParentId="14154" CreationDate="2017-11-03T14:55:51.137" Score="3" Body="&lt;h1&gt;An IDE can be a perfectly valid language:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There are effectively two ways to do this:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The input/output is the file you are operating on, the language is the keystrokes it takes to convert it.  We're already &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8995/how-should-vim-answers-be-scored&quot;&gt;doing&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4816/is-editor-golf-on-topic&quot;&gt;this&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The language is the keystrokes to create the file, and the input/output is done by the execution of the said file.  &lt;strong&gt;The language in this case is the IDE + Language being executed&lt;/strong&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;However, &lt;strong&gt;in both of these cases we need to be able to measure the bytes of the user interaction&lt;/strong&gt;.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This means that we should be able to:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Save to take your keystrokes to a file&lt;/li&gt;&#xA;&lt;li&gt;Measure the file size (to score the program)&lt;/li&gt;&#xA;&lt;li&gt;Replay the keystrokes on the IDE&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Both Vim and Emacs keystrokes can be saved to a &lt;code&gt;.vimrc&lt;/code&gt; or &lt;code&gt;.emacs&lt;/code&gt; file, which can then be later replayed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Other notes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When I say keystrokes above, other forms of user interaction is acceptable as well (but I suspect that keystrokes will be far more efficient in bytesize)&lt;/li&gt;&#xA;&lt;li&gt;Using a 3rd party library (such as &lt;a href=&quot;http://robotframework.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Robots&lt;/a&gt; or &lt;a href=&quot;https://autohotkey.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;AutoHotkey&lt;/a&gt;) to replay the keystrokes is perfectly acceptable.  However, your language is now LibraryName + IDE + Language, and your language is measured by the size of the script used.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So, using VBA/VBE as a concrete example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can VBE execute keystrokes automatically from a file? &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Yes: Your byte size is the size of the keystroke file, and your language is &lt;code&gt;VBE + VBA&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;No: Do you want to use a scripting program?&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Yes: Say you use AutoHotkey. Your byte size is the size of the &lt;code&gt;.ahk&lt;/code&gt; file, and your language is &lt;code&gt;AutoHotkey + VBE + VBA&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;No: Too bad.  This is not a valid programming language.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2017-11-03T19:26:16.147" LastActivityDate="2017-11-03T19:26:16.147" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="14170" PostTypeId="2" ParentId="9031" CreationDate="2017-11-04T17:14:42.220" Score="1" Body="&lt;p&gt;I would say that you should have to specify how to call it and have the constant part count towards the byte count.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For your example about defining every possible function, you would have to specify the code to create the generator, and the function's number, and everything would count towards the byte count.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For &lt;code&gt;import math&lt;/code&gt;, you would also have to count &lt;code&gt;math.gcd&lt;/code&gt; (plus &lt;code&gt;()&lt;/code&gt; to avoid loopholes?).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Etc.&lt;/p&gt;&#xA;" OwnerUserId="46603" LastActivityDate="2017-11-04T17:14:42.220" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14172" PostTypeId="2" ParentId="2140" CreationDate="2017-11-04T21:41:14.603" Score="0" Body="&lt;h1&gt;Find local Minimum&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;META&lt;/strong&gt;: This is just meant as an introductory challenge for functional input (black box functions) and hopefully establish some more inputs.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a real number &lt;code&gt;e &amp;gt; 0&lt;/code&gt; and some &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13706/24877&quot;&gt;black box function&lt;/a&gt; &lt;code&gt;f: (0,1) → (-10,10) ⊆ ℝ&lt;/code&gt;, return a value &lt;code&gt;x&lt;/code&gt; that is within &lt;code&gt;e&lt;/code&gt; of a local minimum &lt;code&gt;x*&lt;/code&gt; that means &lt;code&gt;x ∊ [x* - e, x* + e]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A value &lt;code&gt;x*&lt;/code&gt; is &lt;em&gt;local minimum&lt;/em&gt; of &lt;code&gt;f&lt;/code&gt; if and only if there is some &lt;code&gt;a &amp;gt; 0&lt;/code&gt; such that &lt;code&gt;f(x*) &amp;lt; f(x)&lt;/code&gt; for all &lt;code&gt;x ∊ (x* - a, x* + a) \ {x*}&lt;/code&gt;. This means all other points in some neighbourhood must have a strictly greater function value. (This definition is just for this challenge and might be different from other definitions.)&lt;/li&gt;&#xA;&lt;li&gt;The input function &lt;code&gt;f&lt;/code&gt; can assumed to be differentiable and satisfy &lt;code&gt;f'(0) &amp;lt; 0&lt;/code&gt; and &lt;code&gt;f'(1) &amp;gt; 0&lt;/code&gt; which means there are no local minima at &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You can assume that &lt;code&gt;|f'(x)| &amp;lt; 1000&lt;/code&gt; this means the function cannot be to steep.&lt;/li&gt;&#xA;&lt;li&gt;You can use your native floating point numbers and assume &lt;code&gt;e&lt;/code&gt; is sufficiently great. (That means greater than the machine precision of your floating point type.)&lt;/li&gt;&#xA;&lt;li&gt;You can use any language for which there are defaults for black box functions input in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;standard IO meta post&lt;/a&gt;. If there are no such default for your language feel free to add one in the sense of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13706/24877&quot;&gt;definition of black box functions&lt;/a&gt;, and make sure to link your proposals in that definition. Also don't forget to vote on them.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;x*                 f(x)&#xA;0.5                x*(x-1)&#xA;0.5                (x+1/2)^(2*k-1) * (x-3/2)^(2*k-1) for k=1,2,...,1000 &#xA;2*(k+1/4)/(2*n-1)  -sin(pi*(2*n-1)) for n=1,2,3,...,159 (for every applicable k there is one minimum)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-11-05T15:43:55.343" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14174" PostTypeId="2" ParentId="2140" CreationDate="2017-11-05T12:32:58.700" Score="0" Body="&lt;p&gt;I asked this question in main site. Got a very bad review. So, I would be glad if any kind soul here would like to help me make this question better. And Some feedback on how can i make it good.&lt;/p&gt;&#xA;&lt;p&gt;Given any input, you need to encode / decode it in or from base 16, 32, 64.&lt;/p&gt;&#xA;&lt;p&gt;So your task will be to make a base 16, 32, 64 encoder / decoder.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;RULES:&#xA;Standard Loopholes apply.&#xA;and that's all&#xA;INPUT:&#xA;In any format you like.&#xA;The inputs will be the &#xA;i. Data&#xA;ii. Task (encoding or decoding) (0 or 1)&#xA;iii. Base (16 or 32 or 64)&#xA;&#xA;Output:&#xA;The Encoded/Decoded data&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The shortest code in byte wins.&lt;/p&gt;&#xA;&lt;p&gt;Reference : &lt;a href=&quot;https://www.rfc-editor.org/rfc/rfc4648&quot; rel=&quot;nofollow noreferrer&quot;&gt;RFC&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="42263" LastEditorUserId="-1" LastEditDate="2021-10-07T07:34:52.683" LastActivityDate="2017-11-06T02:36:51.193" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14176" PostTypeId="2" ParentId="2140" CreationDate="2017-11-06T01:18:24.620" Score="0" Body="&lt;h1&gt;The Guardian of the Chessboard&lt;/h1&gt;&#xA;&lt;p&gt;Given a collection of chess squares&lt;sup&gt;1&lt;/sup&gt;, output the chess piece with the smallest value, together with its position, that is able to reach all the given squares in a single step.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;1 - A chess square is a notation of a position on an 8x8 grid, with the x-axis being labeled with letters instead of numbers, meaning for example that the notation of &lt;strong&gt;3|2&lt;/strong&gt; would be &lt;strong&gt;c2&lt;/strong&gt;.&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;Input must be received as a collection of strings, each string representing a chess square. You may assume that the chess square will always be in the range a1 - h8.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example Input&lt;/strong&gt;: &lt;code&gt;[ &amp;quot;b7&amp;quot;, &amp;quot;c4&amp;quot;, &amp;quot;h1&amp;quot;, &amp;quot;g8&amp;quot; ]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Output must be  in the format &lt;code&gt;[piece][square]&lt;/code&gt;, with piece being the notation of the chess piece, such as &lt;code&gt;N&lt;/code&gt;, &lt;code&gt;Q&lt;/code&gt; or &lt;code&gt;K&lt;/code&gt;, and square being the notation of the square that the chess piece has to be located at.&lt;/p&gt;&#xA;&lt;p&gt;You may either return a string from a method or directly output the result to &lt;code&gt;stdout&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Note that you have to use the chess piece with the least possible value, so if there is a choice between for example Queen and Bishop, you would choose the Bishop. See below for a table noting the piece values.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Special moves&lt;/em&gt; such as pawn's first move, en passent and castling do not have to be respected.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, shortest code in bytes, in any programming language wins.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are forbidden.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Data Table&lt;/h2&gt;&#xA;&lt;p&gt;Here you can look up each pieces value and its notation character.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;|  Piece | Value | Character |&#xA;|:------:|:-----:|:---------:|&#xA;| Pawn   | 1     | P         |&#xA;| King   | 2     | K         |&#xA;| Knight | 3     | N         |&#xA;| Bishop | 3     | B         |&#xA;| Rook   | 5     | R         |&#xA;| Queen  | 9     | Q         |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input -&amp;gt; Output&#xA;&#xA;[ &amp;quot;b7&amp;quot;, &amp;quot;c4&amp;quot;, &amp;quot;h1&amp;quot;, &amp;quot;g8&amp;quot; ] -&amp;gt; Bd5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(TODO: Add more testcases)&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Sandboxing&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Duplicates?&lt;/li&gt;&#xA;&lt;li&gt;Possible misunderstatings?&lt;/li&gt;&#xA;&lt;li&gt;Task changes?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="72738" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-11-06T16:26:42.897" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14180" PostTypeId="2" ParentId="2140" CreationDate="2017-11-06T19:05:08.687" Score="0" Body="&lt;h1&gt;Ternary Parity of Substrings&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Definition&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The ternary parity of a string is the number of 1's in its ascii bitstring mod 3.  For instance, the ascii values for &lt;code&gt;&quot;Hello World!&quot;&lt;/code&gt; are:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;H:72 e:101 l:108 l:108 o:111 space:32 W:87 o:111 r:114 l:108 d:100 !:33&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Converting each ascii value to binary gives:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;H:1001000 e:1100101 l:1101100 l:1101100 o:1101111 space:100000&#xA;W:1010111 o:1101111 r:1110010 l:1101100 d:1100100 !:100001&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Concatenating these together gives the combined bitstring:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1001000110010111011001101100110111110000010101111101111111001011011001100100100001&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Which has 45 1's.  As a result, the ternary parity of &lt;code&gt;&quot;Hello World!&quot;&lt;/code&gt; is 45%3 = 0.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write the shortest program in the language of your choice that does the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Takes a string, s, as input.&lt;/li&gt;&#xA;&lt;li&gt;Finds S, the collection of all substrings of s&lt;/li&gt;&#xA;&lt;li&gt;Calculates the ternary parity of each element of S&lt;/li&gt;&#xA;&lt;li&gt;Creates a ternary string, q, by concatenating the parity bits of each element in S&lt;/li&gt;&#xA;&lt;li&gt;Outputs the ternary parity of q.  That is, the number of 1's in q mod 3.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Input/Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input and output may use any of the standard methods listed &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods%20/%20here&quot;&gt;here&lt;/a&gt;.  The program must output three distinct values that indicate ternary parity.  For instance, the program could print &quot;one&quot;, &quot;two&quot;, or &quot;three&quot;, it could exit with an error code of 0, 1, or 2, or could be a function that returns False for 1 and Null for 2, and 100 for 0, etc.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;Hello World!&quot; =&amp;gt; 0&#xA;&quot;foobar&quot; =&amp;gt; 2&#xA;&quot;ABCDEFG&quot; =&amp;gt; 1&#xA;&quot;abcdefg&quot; =&amp;gt; 0&#xA;&quot;One&quot; =&amp;gt; 2&#xA;&quot;Four&quot; =&amp;gt; 0&#xA;&quot;2049&quot; =&amp;gt; 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="71631" LastActivityDate="2017-11-06T19:05:08.687" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14182" PostTypeId="2" ParentId="2140" CreationDate="2017-11-07T16:37:06.830" Score="2" Body="&lt;h1&gt;WordArt reader&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've decided to leave this very open ended, so that I can write it based on community input. There are a lot of questions in the bottom. All feedback is appreciated, even minor suggestions/comments. :)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;,&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/classification&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;classification&amp;#39;&quot; rel=&quot;tag&quot;&gt;classification&lt;/a&gt;,&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Did you know WordArt is still a thing in MS Word? Let's parse it! &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/5TjzI.png&quot; alt=&quot;1]&quot;&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;(I'll remove the Swag format)&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge will contain a test battery with X jpg.files each with a word or sentence shown in WordArt. Your task is to parse as many as you can. The winner will be the submission that correctly parses the most images, with date stamp being the tie breaker.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Sandboxing:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Good idea or not?&lt;/li&gt;&#xA;&lt;li&gt;Should there be many different styles, or should I stick to one? Colors? Shade/mirroring?&lt;/li&gt;&#xA;&lt;li&gt;How many test cases?&lt;/li&gt;&#xA;&lt;li&gt;Is jpg the best format (it was used in the Upgoat/Downgoat challenge)&lt;/li&gt;&#xA;&lt;li&gt;Should I have a more refined scoring mechanism? It's hard to mix two quantities into one score.&lt;/li&gt;&#xA;&lt;li&gt;Should I stick to just letters / alphanumeric / all printable ASCII / multiple lines? Long sentences or single words?&lt;/li&gt;&#xA;&lt;li&gt;Orientation? Waves? Circular? &lt;/li&gt;&#xA;&lt;li&gt;Resolution?&lt;/li&gt;&#xA;&lt;li&gt;Builtin functions?&lt;/li&gt;&#xA;&lt;li&gt;Should I require a complete match of images, or character by character?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="31516" LastEditorUserId="31516" LastEditDate="2019-05-22T06:59:30.087" LastActivityDate="2019-05-22T06:59:30.087" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="14184" PostTypeId="2" ParentId="2140" CreationDate="2017-11-07T19:48:42.183" Score="1" Body="&lt;h1&gt;Palindromic Collapse&lt;/h1&gt;&#xA;&lt;p&gt;Given a string &lt;code&gt;s&lt;/code&gt;, traverse from left-to-right, finding the first prefix that is a palindrome. When you encounter the first prefix palindrome, remove the end-half of the palindrome. Insert it back into the original string, then restart again from the left side of the new word. Return the final result when no prefixes are palindromes.&lt;/p&gt;&#xA;&lt;p&gt;Take for example &amp;quot;babble&amp;quot;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;First check would be &lt;code&gt;[ba]bble&lt;/code&gt;, which is not a palindrome, move on.&lt;/li&gt;&#xA;&lt;li&gt;Second check would be &lt;code&gt;[bab]ble&lt;/code&gt;, which is a palindrome (&lt;code&gt;bab&lt;/code&gt;).&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Compress the palindrome to the first &amp;quot;half&amp;quot;, &lt;code&gt;[bab]&lt;/code&gt; becomes &lt;code&gt;[ba]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Reattach this in place of the original palindrome, resulting in &lt;code&gt;[ba]ble&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Next we repeat, finding &lt;code&gt;[bab]le&lt;/code&gt; again, and resulting in  &lt;code&gt;[ba]le&lt;/code&gt; after steps 1 and 2.&lt;/li&gt;&#xA;&lt;li&gt;We then iterate through the full word again, finding no palindromes, returning &lt;code&gt;bale&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;More Examples (worked out)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;moom&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[mo]om (not a palindrome)&#xA;[moo]m (nont a palindrome)&#xA;[moom] (palindrome) -&amp;gt; [mo]&#xA;[mo]   (not a palindrome, done).&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Final returned result: &lt;code&gt;mo&lt;/code&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;abalbalba&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[ab]albalba (not a palindrome)&#xA;[aba]lbalba (palindrome) -&amp;gt; [ab]lbalba&#xA;[ab]lbalba  (not a palindrome)&#xA;[abl]balba  (not a palindrome)&#xA;[ablb]alba  (not a palindrome)&#xA;[ablba]lba  (palindrome) -&amp;gt; [abl]lba&#xA;[ab]llba    (not a palindrome)&#xA;[abl]lba    (not a palindrome)&#xA;[abll]ba    (not a palindrome)&#xA;[abllb]a    (not a palindrome)&#xA;[abllba]    (palindrome) -&amp;gt; [abl]&#xA;[ab]l       (not a palindrome)&#xA;[abl]       (not a palindrome, done)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Final returned result: &lt;code&gt;abl&lt;/code&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;More 1-1 Examples&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;amanaplanacanalpanama -&amp;gt; amnaplanacanalpanama&#xA;1232132121            -&amp;gt; 123&#xA;1232132145            -&amp;gt; 12345&#xA;01001000123210        -&amp;gt; 01123210&#xA;01000000000000000001  -&amp;gt; 011&#xA;010101                -&amp;gt; 011&#xA;abbabababaa           -&amp;gt; ab&#xA;hellollehworld        -&amp;gt; helloworld&#xA;world                 -&amp;gt; world&#xA;&amp;lt;empty string&amp;gt;        -&amp;gt; &amp;lt;empty string&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-11-07T19:48:42.183" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14186" PostTypeId="2" ParentId="2140" CreationDate="2017-11-08T15:58:51.070" Score="-3" Body="&lt;p&gt;&lt;strong&gt;Golf This Question&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program should output to STDOUT the full text of this question as it appears on your screen, so no HTML. This includes the title and the body. Please do not edit this question whatsoever so-as to keep it the same for all programs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;No&lt;/strong&gt; reading the text from a file or the internet&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox&lt;/strong&gt;&#xA;Is this a good question? Is there anything I should clarify?&lt;/p&gt;&#xA;" OwnerUserId="69912" LastEditorUserId="69912" LastEditDate="2017-11-08T19:59:06.633" LastActivityDate="2017-11-08T19:59:06.633" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="14187" PostTypeId="1" AcceptedAnswerId="14190" CreationDate="2017-11-08T22:30:54.317" Score="6" ViewCount="250" Body="&lt;p&gt;Specifically &lt;a href=&quot;https://codegolf.stackexchange.com/questions/147437/carve-a-square-from-a-string&quot;&gt;this one&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Dennis pointed out that the rule that input cannot be an array of lines makes the challenge worse, and I agree with him now. However, the challenge already has several answers, and most of them would become sub-optimal since taking input as a string array would likely be shorter in most cases. Note that no answer would become invalid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should I improve the rules of a challenge, even if it already has many answers?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note: This isn't a duplicate of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7777&quot;&gt;When should rule changes count?&lt;/a&gt; as that post is concerned with &lt;em&gt;can&lt;/em&gt; you change the rules, vs this one which is concerned with &lt;em&gt;should&lt;/em&gt; you.&lt;/p&gt;&#xA;" OwnerUserId="60042" LastEditorUserId="60042" LastEditDate="2017-11-14T17:24:34.360" LastActivityDate="2017-11-20T17:30:04.740" Title="Should I edit a challenge to make it more interesting, if it makes several existing answers no longer optimal?" Tags="|discussion|asking-questions|specific-question|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14188" PostTypeId="1" CreationDate="2017-11-08T23:25:38.820" Score="0" ViewCount="94" Body="&lt;p&gt;For example, &lt;a href=&quot;https://codegolf.stackexchange.com/a/147425/75553&quot;&gt;this submission&lt;/a&gt; written in APL (Dyalog) claims to be 39 bytes. It is 39 characters, but in the TIO link provided in the post (which happens to be an older version that is two characters longer but that does not matter) it says it is 41 characters and 87 bytes. Why does the score count as [number of characters] bytes instead of 87 bytes? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This post is just one example I found but it seems to be prevalent. This doesn't seem fair to the non golf specific languages.&lt;/p&gt;&#xA;" OwnerUserId="75553" LastActivityDate="2017-11-08T23:25:38.820" Title="Why do we count some multibyte characters in the esolangs as single bytes?" Tags="|discussion|" AnswerCount="0" CommentCount="5" ClosedDate="2017-11-08T23:39:31.657" ContentLicense="CC BY-SA 3.0" />
  <row Id="14189" PostTypeId="2" ParentId="2140" CreationDate="2017-11-09T03:58:34.783" Score="2" Body="&lt;h1&gt;RaceTrack Arena KOTH&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;(haven't come up with a very good title)&lt;/p&gt;&#xA;&lt;p&gt;this koth is inspired by the pen and paper game &lt;a href=&quot;https://en.wikipedia.org/wiki/Racetrack_(game)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Racetrack&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;RaceTrack Movement&lt;/h2&gt;&#xA;&lt;p&gt;Racetrack (and this racetrack-inspired koth) use a distinctive vector based movement system.&lt;/p&gt;&#xA;&lt;p&gt;all bots players are on a square grid.&lt;/p&gt;&#xA;&lt;p&gt;initially, a cycle (this is what we will call bot players) will have no movement i.e. be completely motionless&lt;/p&gt;&#xA;&lt;p&gt;However, after a cycle begins moving, it gains inertia; it will not stop moving in this direction unless it acts to stop moving.&lt;/p&gt;&#xA;&lt;p&gt;On every turn, a cycle can change their speed on each axis (x and y) by -1, 0, or 1, and the same with y speed. this includes sticking with their current speed. This means that every turn, a cycle has 9 options of spaces to move to (excluding spaces which would cause them to crash)&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/MXBO2.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/MXBO2.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;for example, in this diagram, the cycle indicated by the red space, which has just moved from the brown space, has the option of the 9 green squares in the red-lined area, the main, more saturated, green square, along with the blue line, represents where it will end up staying on its inertial course&lt;/p&gt;&#xA;&lt;p&gt;if, for some reason, the cycle wanted to come to a complete stop, it would take 5 turns, which is the Chebyshev distance between the inertia vector's end and the cycle.&lt;/p&gt;&#xA;&lt;h1&gt;[more tbd obviously]&lt;/h1&gt;&#xA;&lt;p&gt;don't downvote for the lack of content please&lt;/p&gt;&#xA;" OwnerUserId="55896" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-11-09T03:58:34.783" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="14190" PostTypeId="2" ParentId="14187" CreationDate="2017-11-09T14:00:28.033" Score="7" Body="&lt;p&gt;If you do, make it clear in the question body that the rules disallowed that form of input originally. However, with many existing answers, I don't think any changes to the rules should be made even if they improve the challenge, unless there is something seriously wrong with the rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Likely many of those who have already answered are not going to update their answers per the new rules, nor should it be expected from them. This could lead to the already upvoted now-sub-optimal answers being followed by similar but more optimal answers that get buried on the second page. And otherwise, if the new answers get more upvotes than the old, it's somewhat unfair towards the original answerers who might have written the same answer if it was allowed when they answered.&lt;/p&gt;&#xA;" OwnerUserId="61405" LastEditorUserId="61405" LastEditDate="2017-11-16T02:16:27.597" LastActivityDate="2017-11-16T02:16:27.597" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14193" PostTypeId="2" ParentId="14187" CreationDate="2017-11-09T19:46:42.177" Score="3" Body="&lt;h1&gt;Here's my thoughts&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;First and foremost as mentioned you should try to avoid invalidating any existing answers. I know you were intending not to, but I think it is worth mentioning in case other people have a similar situation in the future.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now that that's out of the way, the main question I would like to ask is&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;What are the drawbacks to making the change?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The one you mention in the post is that previously competitive answers will become less competitive as new methods become available.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think the main reason you consider this a drawback in your post (if this is wrong tell me, I don't want to put words in anyone's mouth), that the time spent optimizing the input portions of answers will go to waste.  That because a new method is available to make shorter answers the time spent on them is false.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now while this is a reasonable I think it is missing the point, there are two main things most people get out of golfing&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Golfing is inherently fun and doing so is enjoyable.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Posting short answers gets you upvotes which get you reputation, which we all like.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;People like competition, in particular winning them.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;As far as the first one goes, a rule change can never go back in time and remove the fun you had, so no harm there.  And for the second one I seriously doubt people will retract their upvotes because the rules made the solution less optimal.  So on both fronts there it seems like the change has little effect.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The third is a little bit of a mixed bag.  On one hand some of the most fun competitions I've had were ones where it looked like it was over but some new information provided a surge to get even better scores, and this could be that new information.  But it could also be a bit frustrating having just won a competition to have to rules changed and have to defend your title.  In this case it might be a FGITW to port answers to new paradigms.  I would hope there wouldn't be any disingenuous behavior, but even with everyone acting fairly there might be a clear answer in a particular language and the first person to notice the change in the question gets the prize so to speak.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now the next question to ask is&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;What do we gain from changing the challenge?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Now this one is pretty challenge specific as different changes might have different improvements, but the two main things I would be concerned about, are&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It makes it more fun for people who answer in the future.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It might make more people able or willing to compete.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It sets a good example for future challenges.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think all of these are pretty decent reasons to make the change, but you will have to weight them on a challenge by challenge basis.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Overall I'm not sure if I have an answer as to what you should do in every case, just some things to consider when making a choice.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-11-09T19:46:42.177" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14195" PostTypeId="1" AcceptedAnswerId="14956" CreationDate="2017-11-10T09:06:25.323" Score="1" ViewCount="107" Body="&lt;p&gt;Note - this is completely different to &lt;a href=&quot;https://meta.stackexchange.com/questions/293479/there-are-no-review-queues-available-to-you-hey&quot;&gt;&amp;quot;There are no review queues available to you&amp;quot; - Hey?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I accessed Programming Puzzles &amp;amp; Code Golf Meta today while browsing the main site and clicking on one of the Hot Meta Posts. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;My attention started to drift, and wandered over to the top-bar, and on to the review queue button.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I didn't know what reviewing privileges were available to me, so I clicked on it, and...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/rx8KY.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/rx8KY.png&quot; alt=&quot;Review queues - There are no review queues available to you&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That was pointless. I know I haven't been review banned, because I have never reviewed on PPCG Meta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't have enough reputation on other sites to confirm this behaviour, and I don't know whether it's a result of Code Golf's different privilege system, which is why I haven't taken it to main Meta.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Could the help centre or some other helpful item take the place of the review queue button?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;One possible rationale - new users who don't know much about the review queue may think that the button is useless and ignore it even when it does do something.&lt;/p&gt;&#xA;" OwnerUserId="60483" LastEditorUserId="68942" LastEditDate="2021-06-09T05:36:26.243" LastActivityDate="2021-06-09T05:36:26.243" Title="Review button shown when “There are no review queues available to you”" Tags="|feature-request|status-bydesign|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14199" PostTypeId="1" CreationDate="2017-11-11T15:31:17.250" Score="6" ViewCount="515" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;The vote on this output option has moved &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14275/24877&quot;&gt;here&lt;/a&gt;.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Haskell has a &lt;em&gt;very strong&lt;/em&gt; type system, so there is a type called &lt;code&gt;Maybe&lt;/code&gt; to work around some restrictions.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The Maybe type is defined as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;data Maybe a = Just a | Nothing&#xA;    deriving (Eq, Ord)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;It allows the programmer to specify something may not be there.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;From &lt;a href=&quot;https://wiki.haskell.org/Maybe&quot; rel=&quot;nofollow noreferrer&quot;&gt;the Haskell wiki&lt;/a&gt;.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Essentially, instead of erroring out, a function can return a &lt;code&gt;Maybe&lt;/code&gt; that is either a &lt;code&gt;Just x&lt;/code&gt; where &lt;code&gt;x&lt;/code&gt; is the intended output or it can return &lt;code&gt;Nothing&lt;/code&gt;, which indicates that there is no possible output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One example is the second solution in &lt;a href=&quot;https://codegolf.stackexchange.com/a/146577/68615&quot;&gt;one of my answers&lt;/a&gt;. As you can see, in the output, the answer asked for is &lt;code&gt;Just &lt;/code&gt; prefixed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This can be fixed by applying &lt;code&gt;foldl1 seq&lt;/code&gt; to the result, which I think is the golfiest way to do this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is outputting a &lt;code&gt;Maybe&lt;/code&gt; valid?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;&lt;sub&gt;&lt;em&gt;Maybe&lt;/em&gt; we can allow this...&lt;/sub&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="68615" LastEditorUserId="68615" LastEditDate="2018-04-11T16:17:18.700" LastActivityDate="2018-04-11T16:17:18.700" Title="Is outputting a Maybe acceptable in Haskell?" Tags="|discussion|policy|" AnswerCount="2" CommentCount="7" ClosedDate="2017-11-14T22:29:16.857" ContentLicense="CC BY-SA 3.0" />
  <row Id="14200" PostTypeId="2" ParentId="14199" CreationDate="2017-11-11T15:47:33.727" Score="1" Body="&lt;h1&gt;As long as the function is guaranteed to not output &lt;code&gt;Nothing&lt;/code&gt;, it is valid&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The title explains it all. If the function is not supposed to return &lt;code&gt;Maybe&lt;/code&gt; and it is guaranteed to not output &lt;code&gt;Nothing&lt;/code&gt;, it is valid.&lt;/p&gt;&#xA;" OwnerUserId="69850" LastEditorUserId="69850" LastEditDate="2017-11-11T15:54:46.267" LastActivityDate="2017-11-11T15:54:46.267" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14202" PostTypeId="2" ParentId="2140" CreationDate="2017-11-11T17:47:08.440" Score="-2" Body="&lt;h1&gt;Output the first digit of Graham's number&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Code golf&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program that will output the first digit of Graham's number (and nothing else), terminate and produce no error.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'll be lenient about loopholes. But if your submission is something like print(&quot;4&quot;), the burden of proof will be on you.* Also, if you submit 9 answers like that, each printing one digit, then yes, one will definitely be correct, but I will need to know which one, and, you guessed it, the burden of proof is on you.*&lt;/p&gt;&#xA;&#xA;&lt;p&gt;* Catch: at the moment, no one has yet worked out what the first digit of Graham's number is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But I want a &quot;practical&quot; solution. Yes, the algorithm is simple, but I'm sure your computer doesn't have unlimited storage. Nor do language implementations have arbitrarily large int. (OK, some do, but there is memory constraint.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, you will have a tape device attached to your computer. The library which is automatically loaded into the interpreter or compiler controls the tape device. Here things do become theoretical: the tape has a beginning, but no end, or you can imagine the device will manufacture more tape to extend it if more is needed. The tape has discrete positions. On each position a sector is stored. The device has access to one sector at the time but it can move the tape. All sectors have the same size.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The library provides you with the following functions (subroutines, whatever):&lt;br&gt;&#xA;- detect if the tape is at the beginning&lt;br&gt;&#xA;- move the tape left by n positions (stops at the beginning if sent beyond)&lt;br&gt;&#xA;- move the tape right by n positions (n has to be one of atomic integer types of your chosen language)&lt;br&gt;&#xA;- read the whole sector at current position&lt;br&gt;&#xA;- read a part of the sector (zero indexed location within the sector and number of bytes to be read are arguments of an atomic integer type)&lt;br&gt;&#xA;- overwrite the whole sector&lt;br&gt;&#xA;- overwrite a part of the sector&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The names of functions are your choice, as is the size of a sector. Reading loads the contents into a variable / into the memory area starting with a pointer given as an argument. Similar about writing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because the tape is effectively infinite, you have no function to tell you the actual position on the tape, as you'd have no way to store the result on a &quot;real&quot; computer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So the real parts are: computer, possibly tape device.&lt;br&gt;&#xA;Theoretical parts are:&lt;br&gt;&#xA;- infinite storage tape or availability of material to manufacture as much tape as needed, which may well exceed the total amount of matter in our universe&lt;br&gt;&#xA;- the computer, device, tape, ... not deteriorating, getting tangled up nor power falling or anything else going wrong for the time it takes the program to complete the task, which may well exceed total lifetime of our universe.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Ideas how to improve the question... or should I abandon the idea?&lt;/p&gt;&#xA;" OwnerUserId="32728" LastEditorUserId="73111" LastEditDate="2017-11-11T22:24:00.740" LastActivityDate="2017-11-11T22:24:00.740" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="14203" PostTypeId="2" ParentId="2140" CreationDate="2017-11-11T22:54:54.740" Score="1" Body="&lt;h1&gt;Validate a StarCraft II Build Order&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Explanation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You must decide whether the input represents a valid StarCraft II Build Order. Here is how you will decide:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Start with the first word (it will be the race, &lt;code&gt;Zerg&lt;/code&gt;, &lt;code&gt;Protoss&lt;/code&gt;, or &lt;code&gt;Terran&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Set the list of &lt;em&gt;valid&lt;/em&gt; units to just the ones from that race (explained later)&lt;/li&gt;&#xA;&lt;li&gt;Loop through the input (split by space)&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Check if the unit is in the list of valid items for the listed race&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Otherwise, output &lt;code&gt;Invalid item&lt;/code&gt; + the listed item's name&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Check that the player has enough supply to sustain that unit (if it's a unit) (explained later)&lt;/li&gt;&#xA;&lt;li&gt;Check that the player has the prerequisites for that item&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Units and Structures&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(will be listed in real question)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Terran:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;CommandCenter&lt;/code&gt; &lt;code&gt;0&lt;/code&gt; supply, requires &lt;code&gt;SCV&lt;/code&gt; gives &lt;code&gt;+15&lt;/code&gt; supply&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;OrbitalCommand&lt;/code&gt; &lt;code&gt;0&lt;/code&gt; supply, requires &lt;code&gt;CommandCenter&lt;/code&gt; (consumes)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Zerg:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;Hatchery&lt;/code&gt; &lt;code&gt;-1&lt;/code&gt; supply, requires &lt;code&gt;Drone&lt;/code&gt; (consumes) gives &lt;code&gt;+6&lt;/code&gt; supply&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Drone&lt;/code&gt; &lt;code&gt;1&lt;/code&gt; supply, requires &lt;code&gt;Hatchery&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;SpawningPool&lt;/code&gt; &lt;code&gt;-1&lt;/code&gt; supply, requires &lt;code&gt;Hatchery&lt;/code&gt;, &lt;code&gt;Drone&lt;/code&gt; (consumes)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Protoss:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;Nexus&lt;/code&gt; &lt;code&gt;0&lt;/code&gt; supply, requires &lt;code&gt;Probe&lt;/code&gt; gives &lt;code&gt;+15&lt;/code&gt; supply&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;StarCraft II Mechanics&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;At the beginning of the game, the player starts with a town hall (&lt;code&gt;Nexus&lt;/code&gt;, &lt;code&gt;CommandCenter&lt;/code&gt;, or &lt;code&gt;Hatchery&lt;/code&gt; + &lt;code&gt;Overlord&lt;/code&gt;) and &lt;code&gt;12&lt;/code&gt; workers (&lt;code&gt;Probe&lt;/code&gt;, &lt;code&gt;SCV&lt;/code&gt;, or &lt;code&gt;Drone&lt;/code&gt;). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Supply is the maximum number of units one can have. &lt;code&gt;Supply Depots&lt;/code&gt;, &lt;code&gt;Pylons&lt;/code&gt;, and &lt;code&gt;Overlords&lt;/code&gt; give more supply. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The sum of the supply of all produced units can never exceed the current supply value (we ignore Zerg hacks).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Supply cannot exceed &lt;code&gt;200&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You will receive an input in any valid way in this format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Race &amp;lt;item&amp;gt; &amp;lt;item&amp;gt; .....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There will be at most 99 items, and they will be at most 30 chars long. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The race will be one of &lt;code&gt;Zerg&lt;/code&gt;, &lt;code&gt;Protoss&lt;/code&gt;, or &lt;code&gt;Terran&lt;/code&gt;. &lt;/p&gt;&#xA;" OwnerUserId="48922" LastActivityDate="2017-11-11T22:54:54.740" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14207" PostTypeId="2" ParentId="202" CreationDate="2017-11-12T11:21:43.457" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;http://golf.shinh.org/check.rb&quot; rel=&quot;nofollow noreferrer&quot;&gt;Anarchy Golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Anarchy Golf performance checker (link: &lt;a href=&quot;http://golf.shinh.org/check.rb&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://golf.shinh.org/check.rb&lt;/a&gt;). It lets you run programs in those 111 languages:&lt;/p&gt;&#xA;&lt;p&gt;(sorry, the list takes up quite a lot of screen space)&lt;/p&gt;&#xA;&lt;p&gt;Most languages on Anarchy Golf are out of date, so it is worth checking the version on the page.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&amp;gt;&amp;lt;&amp;gt;&lt;/li&gt;&#xA;&lt;li&gt;A+&lt;/li&gt;&#xA;&lt;li&gt;Ada&lt;/li&gt;&#xA;&lt;li&gt;Aheui&lt;/li&gt;&#xA;&lt;li&gt;Arc&lt;/li&gt;&#xA;&lt;li&gt;Asymptote&lt;/li&gt;&#xA;&lt;li&gt;AWK&lt;/li&gt;&#xA;&lt;li&gt;Bash&lt;/li&gt;&#xA;&lt;li&gt;Bash (builtins)&lt;/li&gt;&#xA;&lt;li&gt;BASIC&lt;/li&gt;&#xA;&lt;li&gt;bc&lt;/li&gt;&#xA;&lt;li&gt;Befunge&lt;/li&gt;&#xA;&lt;li&gt;Befunge-98&lt;/li&gt;&#xA;&lt;li&gt;Brainfuck&lt;/li&gt;&#xA;&lt;li&gt;Burlesque&lt;/li&gt;&#xA;&lt;li&gt;C&lt;/li&gt;&#xA;&lt;li&gt;C#&lt;/li&gt;&#xA;&lt;li&gt;C++&lt;/li&gt;&#xA;&lt;li&gt;Chapel&lt;/li&gt;&#xA;&lt;li&gt;CLC-INTERCAL&lt;/li&gt;&#xA;&lt;li&gt;Clojure&lt;/li&gt;&#xA;&lt;li&gt;COBOL&lt;/li&gt;&#xA;&lt;li&gt;Common LISP&lt;/li&gt;&#xA;&lt;li&gt;Crystal&lt;/li&gt;&#xA;&lt;li&gt;Curry&lt;/li&gt;&#xA;&lt;li&gt;Cyan&lt;/li&gt;&#xA;&lt;li&gt;D&lt;/li&gt;&#xA;&lt;li&gt;D-compile-time&lt;/li&gt;&#xA;&lt;li&gt;dc&lt;/li&gt;&#xA;&lt;li&gt;DOS&lt;/li&gt;&#xA;&lt;li&gt;Erlang&lt;/li&gt;&#xA;&lt;li&gt;Euphoria&lt;/li&gt;&#xA;&lt;li&gt;FerNANDo&lt;/li&gt;&#xA;&lt;li&gt;Fish&lt;/li&gt;&#xA;&lt;li&gt;FlogScript&lt;/li&gt;&#xA;&lt;li&gt;Forth&lt;/li&gt;&#xA;&lt;li&gt;Fortran&lt;/li&gt;&#xA;&lt;li&gt;gas&lt;/li&gt;&#xA;&lt;li&gt;gnuplot&lt;/li&gt;&#xA;&lt;li&gt;Go&lt;/li&gt;&#xA;&lt;li&gt;GolfScript&lt;/li&gt;&#xA;&lt;li&gt;goruby&lt;/li&gt;&#xA;&lt;li&gt;Grass&lt;/li&gt;&#xA;&lt;li&gt;Groovy&lt;/li&gt;&#xA;&lt;li&gt;gs2&lt;/li&gt;&#xA;&lt;li&gt;Haskell&lt;/li&gt;&#xA;&lt;li&gt;Hexagony&lt;/li&gt;&#xA;&lt;li&gt;Icon&lt;/li&gt;&#xA;&lt;li&gt;Io&lt;/li&gt;&#xA;&lt;li&gt;J&lt;/li&gt;&#xA;&lt;li&gt;Java&lt;/li&gt;&#xA;&lt;li&gt;JavaScript&lt;/li&gt;&#xA;&lt;li&gt;jq&lt;/li&gt;&#xA;&lt;li&gt;JVM&lt;/li&gt;&#xA;&lt;li&gt;K&lt;/li&gt;&#xA;&lt;li&gt;Kite&lt;/li&gt;&#xA;&lt;li&gt;Labyrinth&lt;/li&gt;&#xA;&lt;li&gt;Lazy-K&lt;/li&gt;&#xA;&lt;li&gt;LilyPond&lt;/li&gt;&#xA;&lt;li&gt;LMNtal&lt;/li&gt;&#xA;&lt;li&gt;Logo&lt;/li&gt;&#xA;&lt;li&gt;Lua&lt;/li&gt;&#xA;&lt;li&gt;m4&lt;/li&gt;&#xA;&lt;li&gt;make&lt;/li&gt;&#xA;&lt;li&gt;Malbolge&lt;/li&gt;&#xA;&lt;li&gt;Maxima&lt;/li&gt;&#xA;&lt;li&gt;Mind&lt;/li&gt;&#xA;&lt;li&gt;Minus&lt;/li&gt;&#xA;&lt;li&gt;MNNBFSL&lt;/li&gt;&#xA;&lt;li&gt;Nemerle&lt;/li&gt;&#xA;&lt;li&gt;ObjC&lt;/li&gt;&#xA;&lt;li&gt;OCaml&lt;/li&gt;&#xA;&lt;li&gt;Octave&lt;/li&gt;&#xA;&lt;li&gt;PARI/GP&lt;/li&gt;&#xA;&lt;li&gt;Pascal&lt;/li&gt;&#xA;&lt;li&gt;Pefunge&lt;/li&gt;&#xA;&lt;li&gt;Perl&lt;/li&gt;&#xA;&lt;li&gt;Perl6&lt;/li&gt;&#xA;&lt;li&gt;PHP&lt;/li&gt;&#xA;&lt;li&gt;Piet&lt;/li&gt;&#xA;&lt;li&gt;Pike&lt;/li&gt;&#xA;&lt;li&gt;Postscript&lt;/li&gt;&#xA;&lt;li&gt;Prolog&lt;/li&gt;&#xA;&lt;li&gt;Python&lt;/li&gt;&#xA;&lt;li&gt;Python3&lt;/li&gt;&#xA;&lt;li&gt;QCL&lt;/li&gt;&#xA;&lt;li&gt;R&lt;/li&gt;&#xA;&lt;li&gt;REBOL&lt;/li&gt;&#xA;&lt;li&gt;REXX&lt;/li&gt;&#xA;&lt;li&gt;Ruby&lt;/li&gt;&#xA;&lt;li&gt;Ruby2&lt;/li&gt;&#xA;&lt;li&gt;Rust&lt;/li&gt;&#xA;&lt;li&gt;Scala&lt;/li&gt;&#xA;&lt;li&gt;Scheme&lt;/li&gt;&#xA;&lt;li&gt;sed&lt;/li&gt;&#xA;&lt;li&gt;Smalltalk&lt;/li&gt;&#xA;&lt;li&gt;SNOBOL&lt;/li&gt;&#xA;&lt;li&gt;Squirrel&lt;/li&gt;&#xA;&lt;li&gt;Tcl&lt;/li&gt;&#xA;&lt;li&gt;Universal Lambda&lt;/li&gt;&#xA;&lt;li&gt;Unlambda&lt;/li&gt;&#xA;&lt;li&gt;VHDL&lt;/li&gt;&#xA;&lt;li&gt;Vim&lt;/li&gt;&#xA;&lt;li&gt;wake&lt;/li&gt;&#xA;&lt;li&gt;Whirl&lt;/li&gt;&#xA;&lt;li&gt;Whitespace&lt;/li&gt;&#xA;&lt;li&gt;x86&lt;/li&gt;&#xA;&lt;li&gt;xgawk&lt;/li&gt;&#xA;&lt;li&gt;Xtal&lt;/li&gt;&#xA;&lt;li&gt;z80&lt;/li&gt;&#xA;&lt;li&gt;Zsh&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="69850" LastEditorUserId="80214" LastEditDate="2022-01-25T03:55:53.123" LastActivityDate="2022-01-25T03:55:53.123" CommentCount="0" CommunityOwnedDate="2017-11-12T11:21:43.457" ContentLicense="CC BY-SA 4.0" />
  <row Id="14211" PostTypeId="2" ParentId="14199" CreationDate="2017-11-13T01:00:34.693" Score="14" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Maybe is used to emulate failure in Haskell. The equivalent question in, say, Python, is&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;is it OK that a submission could, in theory, return &lt;code&gt;None&lt;/code&gt;, even though it never does?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;is it OK that a submission could, in theory, raise an exception, even though it never does?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The answers to these are obvious.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What the type system allows the submission to do ≠ what the submission actually does.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, a Maybe is equivalent to a list restricted to 0 or 1 elements, so the consensus about singleton lists could apply here.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="61384" LastEditDate="2017-11-13T01:06:48.343" LastActivityDate="2017-11-13T01:06:48.343" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14212" PostTypeId="2" ParentId="2140" CreationDate="2017-11-13T14:38:48.693" Score="17" Body="&lt;h1&gt;10-character golfing language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-design&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-design&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-design&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;{{{rewriting}}}&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to design and implement a new golfing language. The catch: it must only have 10 significant characters as commands.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Design and Implementation rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your language should have the following characteristics:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It must be &lt;a href=&quot;https://en.wikipedia.org/wiki/Turing_completeness&quot; rel=&quot;nofollow noreferrer&quot;&gt;Turing Complete&lt;/a&gt; (theoretically). &lt;/li&gt;&#xA;&lt;li&gt;There should be at most 10 characters (of your choice) which are significant to the program. That is, any characters other than your 10 chosen characters should have no effect on regular program execution.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can choose to have these characters be removed via preprocessing or producing an error if there are any in the source code (&lt;strong&gt;before&lt;/strong&gt; program execution; they should not be used to terminate the program early as an 11th instruction, nor be used to encoded additional information).&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Your selected characters should only consist of ASCII characters, &lt;strong&gt;unless:&lt;/strong&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You want to use or create a code page for your language if you desire to use characters outside of the ASCII plane. Said characters should be translated into regular bytes.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;You &lt;strong&gt;should not&lt;/strong&gt; design an encoding to a language, existing or not. As you are &lt;em&gt;designing&lt;/em&gt; a &lt;em&gt;language&lt;/em&gt;, your submission must be so. Submitting a &amp;ldquo;language&amp;rdquo; which is just a fancy way of encoding a &lt;a href=&quot;https://github.com/DennisMitchell/jellylanguage&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt; program is therefore not allowed.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;By extension, this includes having one of your commands be an &quot;evaluate&quot; function that is not for the language itself. So, you can't implement &quot;eval python&quot; or &quot;execute shell code&quot; functions.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Your language should be capable of basic input (through STDIN and/or command line arguments) and output (to STDOUT, STDERR, and/or a file).&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may choose to ignore any one of these I/O methods, as long as one of each is supported.&lt;/li&gt;&#xA;&lt;li&gt;Implicit I/O is acceptable.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Winning&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;1 week after no new answers are added, the winner is the language which completes the following tasks in the fewest total bytes.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Challenges&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;All numeric inputs and outputs can be any (consistent) base, including unary.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;1: Greetings, Humans!&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt; Output the following text, with or without leading/trailing whitespace: &lt;code&gt;Greetings, Humans!&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Greetings, Humans!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;2: Even cats&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt; Output every other byte of input, starting with either the first or second byte given.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hello, World!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example Output 1:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hlo ol!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example Output 2:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;el,Wrd&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;3: Do the wave&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt; Given number &lt;code&gt;N&lt;/code&gt;, output the first &lt;code&gt;N&lt;/code&gt; lines of the following infinite wave:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#&#xA; ##&#xA;   ###&#xA;      ###&#xA;         ##&#xA;           #&#xA;           #&#xA;         ##&#xA;      ###&#xA;   ###&#xA; ##&#xA;#&#xA;#&#xA; ##&#xA;   ###&#xA;      ###&#xA;         ##&#xA;           #&#xA;     .&#xA;     .&#xA;     .&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;4: Quine&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt; Write a non-empty program which outputs itself, character for character. It must be a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4877/what-counts-as-a-proper-quine/&quot;&gt;proper quine&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;5: Coprimality&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt; Given an integer \$n\$, output all integers \$k\$ coprime to \$n\$ such that \$1\le k \le n\$.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input, output&#xA;10, 1 3 7 9&#xA;7, 1 2 3 4 5 6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;6: Ternary&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt; Given an integer &lt;code&gt;N&lt;/code&gt;, output the base-3 (ternary) digits of &lt;code&gt;N&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; You may &lt;em&gt;not&lt;/em&gt; take input in base 3 for this challenge.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input, output&#xA;1, 1&#xA;2, 2&#xA;3, 10&#xA;4, 11&#xA;5, 12&#xA;120, 11110&#xA;250, 100021&#xA;253, 100101&#xA;254, 100102&#xA;1020, 1101210&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;7: Word value sum&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt; Given a string consisting of only uppercase ASCII characters (&lt;code&gt;A-Z&lt;/code&gt;), calculate the sum of their positions in the alphabet (1-indexed).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input, output&#xA;&quot;A&quot;, 1&#xA;&quot;AAAA&quot;, 4&#xA;&quot;HELLO&quot;, 52&#xA;&quot;GOLF&quot;, 40&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;8: Shutters&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt; Given an integer &lt;code&gt;N&lt;/code&gt;, output a triangle of height &lt;code&gt;N&lt;/code&gt;, constructed according to the following algorithm:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The first row has &lt;code&gt;N&lt;/code&gt; &lt;code&gt;/&lt;/code&gt;s.&lt;/li&gt;&#xA;&lt;li&gt;The second row has &lt;code&gt;N - 1&lt;/code&gt; &lt;code&gt;/&lt;/code&gt;s.&lt;/li&gt;&#xA;&lt;li&gt;...&lt;/li&gt;&#xA;&lt;li&gt;The second-to-last row has &lt;code&gt;2&lt;/code&gt; &lt;code&gt;/&lt;/code&gt;s.&lt;/li&gt;&#xA;&lt;li&gt;The last row has &lt;code&gt;1&lt;/code&gt; &lt;code&gt;/&lt;/code&gt;s.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;That is, the &lt;code&gt;K&lt;/code&gt;th row has &lt;code&gt;N - K + 1&lt;/code&gt; &lt;code&gt;/&lt;/code&gt;s.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input&#xA;output&#xA;&#xA;1&#xA;/&#xA;&#xA;2&#xA;//&#xA;/&#xA;&#xA;3&#xA;///&#xA;//&#xA;/&#xA;&#xA;4&#xA;////&#xA;///&#xA;//&#xA;/&#xA;&#xA;10&#xA;//////////&#xA;/////////&#xA;////////&#xA;///////&#xA;//////&#xA;/////&#xA;////&#xA;///&#xA;//&#xA;/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;9: Roll a die&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt; Given an optional seed (for randomness), yield a uniformly-random integer between 1 and 6.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;10: Where am I walking?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt; You will be given a list of at most four distinct characters representing the four cardinal directions. I will use &lt;code&gt;&amp;gt;&amp;lt;^v&lt;/code&gt; for the sake of example, but you may choose any other four characters. Suppose there is a point at the origin of a 2D plane. Each directional character moves this point 1 unit in that direction. Given this list, output the final destination of this point.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input, output&#xA;&quot;&quot;, 0 0&#xA;&quot;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;^&quot;, 5 1&#xA;&quot;&amp;gt;v&amp;lt;^&quot;, 0 0&#xA;&quot;v&amp;gt;&amp;gt;^&amp;gt;v&amp;lt;^vv^&amp;lt;&quot;, 1 -1&#xA;&quot;vvvvvvvvvvvvv&amp;lt;&amp;lt;&amp;lt;&amp;lt;&amp;lt;&amp;lt;&amp;lt;&amp;lt;&amp;lt;&amp;lt;&amp;lt;&amp;lt;&amp;lt;&quot;, -13 -13&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;11: Reproduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt; Write a program \$P_0\$ in your language which outputs another program \$P_1\$ in your language, which outputs another program \$P_2\$ in your language, which outputs &lt;em&gt;another&lt;/em&gt; program&amp;hellip; and so on. No two \$P_j\$ should be the same, that is, all programs generated should be distinct from each other.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; Your program &lt;em&gt;may not&lt;/em&gt; read its own source code for this challenge. Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; rules apply.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;12: Product&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt; Given an optional integer &lt;code&gt;N&lt;/code&gt; and &lt;code&gt;N&lt;/code&gt; additional integers, output the product of those &lt;code&gt;N&lt;/code&gt; integers.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;N, ints -&amp;gt; output&#xA;5, 1 2 3 4 5 -&amp;gt; 120&#xA;1, 3 -&amp;gt; 3&#xA;2, 1 1 -&amp;gt; 1&#xA;9, 0 1 9 3 4 8 12 9 120 9 -&amp;gt; 0&#xA;4, 100 200 300 400 -&amp;gt; 2400000000&#xA;3, 91 23 84 -&amp;gt; 175812&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;13: Sort a string&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt; Given a string of printable ASCII characters (and optionally its length), sort the characters by the code points of the string. &lt;a href=&quot;http://ascii-table.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt; is a list if you're unfamiliar with them.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;input&quot; -&amp;gt; &quot;output&quot;&#xA;&quot;hello&quot; -&amp;gt; &quot;ehllo&quot;&#xA;&quot;the YMCA&quot; -&amp;gt; &quot; ACMYeht&quot;&#xA;&quot;~..~ {_+}&quot; -&amp;gt; &quot; +.._{}~~&quot;&#xA;&quot;this is an example input, with some stuff!&quot; -&amp;gt; &quot;       !,aaeeeffhhiiiilmmnnoppssssttttuuwx&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(...more challenges to come...)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;14: Repeat indexing&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt; Given two integers &lt;strong&gt;R&lt;/strong&gt; and &lt;strong&gt;I&lt;/strong&gt; and a string &lt;strong&gt;S&lt;/strong&gt;, repeat the &lt;strong&gt;I&lt;/strong&gt;th character of &lt;strong&gt;S&lt;/strong&gt; &lt;strong&gt;R&lt;/strong&gt; times. (&lt;strong&gt;K&lt;/strong&gt; can be 0- or 1-indexed; I will use 0 here.) You may assume that index &lt;strong&gt;I&lt;/strong&gt; exists for &lt;strong&gt;S&lt;/strong&gt; and that &lt;strong&gt;R&lt;/strong&gt; is non-negative.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;R, I, &quot;S&quot; -&amp;gt; &quot;output&quot;&#xA;4, 1, &quot;Hello, World!&quot; -&amp;gt; &quot;Heeeello, World!&quot;&#xA;0, 0, &quot;language&quot; -&amp;gt; &quot;anguage&quot;&#xA;3, 3, &quot;hi!&quot; -&amp;gt; &quot;hi!!!&quot;&#xA;5, 2, &quot;aaabbb&quot; -&amp;gt; &quot;aaaaaaabbb&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="31957" LastEditDate="2018-06-30T03:18:12.643" LastActivityDate="2018-06-30T03:18:12.643" CommentCount="27" ContentLicense="CC BY-SA 4.0" />
  <row Id="14214" PostTypeId="2" ParentId="2140" CreationDate="2017-11-13T19:13:24.617" Score="1" Body="&lt;h1&gt;Prune my tree&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a well-formed ASCII&lt;sup&gt;†&lt;/sup&gt; art tree and the name of a node, print or return a new, well-formed tree with that node and any children removed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;†Contains non-ASCII characters.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given this input tree:&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;A&#xA;├ B&#xA;├ C&#xA;│ └ D&#xA;└ E&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;...and the node name &lt;code&gt;E&lt;/code&gt;, the following should be returned:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;A&#xA;├ B&#xA;└ C&#xA;  └ D&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Well-formed trees&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Rather than an exhaustive spec, I'll define well-formedness by example:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;A&#xA;├ B&#xA;├ C&#xA;├ D&#xA;│ ├ E&#xA;│ └ F&#xA;├ G&#xA;│ └ H&#xA;│   ├ I&#xA;│   │ ├ J&#xA;│   │ └ K&#xA;│   └ L&#xA;└ M&#xA;  ├ N&#xA;  │ └ O&#xA;  │   └ P&#xA;  ├ Q&#xA;  └ R&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The above is the only valid way to represent this tree (rules above re: trailing spaces and newline apply here and henceforth). Note that:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The tree is rendered with some strict subset of the characters &lt;code&gt;├&lt;/code&gt;, &lt;code&gt;│&lt;/code&gt;, &lt;code&gt;└&lt;/code&gt;, &lt;code&gt;A&lt;/code&gt;–&lt;code&gt;Z&lt;/code&gt;, space, and newline.&lt;/li&gt;&#xA;&lt;li&gt;The tree has one root node (in this example &lt;code&gt;A&lt;/code&gt;) with no characters to its left or right.&lt;/li&gt;&#xA;&lt;li&gt;Each line has exactly one node.&lt;/li&gt;&#xA;&lt;li&gt;Each &lt;code&gt;└&lt;/code&gt; and &lt;code&gt;├&lt;/code&gt; is followed by a single space (required) and node name.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard loopholes are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; challenge; input and output must be a string or array of lines or equivalent, per standard rules.&lt;/li&gt;&#xA;&lt;li&gt;Trailing spaces and/or a single trailing newline are allowed in both input and output.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may use any character encoding, as long your solution prints or returns characters equivalent to &lt;code&gt;├&lt;/code&gt;, &lt;code&gt;│&lt;/code&gt;, and &lt;code&gt;└&lt;/code&gt;. (ASCII characters like &lt;code&gt;+&lt;/code&gt;, &lt;code&gt;|&lt;/code&gt; (pipe) and &lt;code&gt;L&lt;/code&gt; (capital &quot;l&quot;) are &lt;em&gt;not&lt;/em&gt; equivalent.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See also &quot;Freebies&quot; under &quot;Scoring&quot; below.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input tree will have at least one node.&lt;/li&gt;&#xA;&lt;li&gt;The given named node may or may not exist in the tree. If it does not exist, the original tree should be returned.&lt;/li&gt;&#xA;&lt;li&gt;Each node name will be a single character between &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;Z&lt;/code&gt; inclusive. Node names will be unique and there will be no more than 26 nodes.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Node names are &lt;em&gt;not&lt;/em&gt; guaranteed to be contiguous nor in any particular order, e.g. the following is possible input:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;Q&#xA;└ D&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The output tree may have zero nodes.&lt;/li&gt;&#xA;&lt;li&gt;The order of the remaining nodes in the output tree must be the same as the input tree.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. The shortest solution in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Freebies:&lt;/strong&gt; If the literal characters &lt;code&gt;├&lt;/code&gt;, &lt;code&gt;│&lt;/code&gt;, or &lt;code&gt;└&lt;/code&gt; appear in your source code, you may count them as one byte each, per occurrence.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'll reuse a few trees for multiple test cases.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Input tree:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Output if &lt;code&gt;A&lt;/code&gt; removed:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Output if &lt;code&gt;B&lt;/code&gt; removed (&lt;code&gt;B&lt;/code&gt; doesn't exist):&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;A&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Input tree:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;A&#xA;├ B&#xA;├ C&#xA;│ └ D&#xA;└ E&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Output if &lt;code&gt;C&lt;/code&gt; removed:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;A&#xA;├ B&#xA;└ E&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Output if &lt;code&gt;D&lt;/code&gt; removed:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;A&#xA;├ B&#xA;├ C&#xA;└ E&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Output if &lt;code&gt;E&lt;/code&gt; removed:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;A&#xA;├ B&#xA;└ C&#xA;  └ D&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Input tree:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;A&#xA;├ B&#xA;├ C&#xA;├ D&#xA;│ ├ E&#xA;│ └ F&#xA;├ G&#xA;│ └ H&#xA;│   ├ I&#xA;│   │ ├ J&#xA;│   │ └ K&#xA;│   └ L&#xA;└ M&#xA;  ├ N&#xA;  │ └ O&#xA;  │   └ P&#xA;  ├ Q&#xA;  └ R&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Output if &lt;code&gt;H&lt;/code&gt; removed:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;A&#xA;├ B&#xA;├ C&#xA;├ D&#xA;│ ├ E&#xA;│ └ F&#xA;├ G&#xA;└ M&#xA;  ├ N&#xA;  │ └ O&#xA;  │   └ P&#xA;  ├ Q&#xA;  └ R&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Output if &lt;code&gt;L&lt;/code&gt; removed:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;A&#xA;├ B&#xA;├ C&#xA;├ D&#xA;│ ├ E&#xA;│ └ F&#xA;├ G&#xA;│ └ H&#xA;│   └ I&#xA;│     ├ J&#xA;│     └ K&#xA;└ M&#xA;  ├ N&#xA;  │ └ O&#xA;  │   └ P&#xA;  ├ Q&#xA;  └ R&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Output if &lt;code&gt;M&lt;/code&gt; removed:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;A&#xA;├ B&#xA;├ C&#xA;├ D&#xA;│ ├ E&#xA;│ └ F&#xA;└ G&#xA;  └ H&#xA;    ├ I&#xA;    │ ├ J&#xA;    │ └ K&#xA;    └ L&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Questions for sandbox:&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Enough/too many/missing test cases?&lt;/li&gt;&#xA;&lt;li&gt;Enough/too many/missing details re: input/output?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="11261" LastEditorUserId="11261" LastEditDate="2017-11-15T04:58:23.770" LastActivityDate="2017-11-15T04:58:23.770" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14218" PostTypeId="2" ParentId="2140" CreationDate="2017-11-14T18:55:31.650" Score="1" Body="&lt;h1&gt;Lines per file&lt;/h1&gt;&#xA;&lt;p&gt;Can't believe it was not questioned yet.&lt;/p&gt;&#xA;&lt;p&gt;I want the shortest script you can supply to take on all files on a directory and output a list in the format&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;file    number_of_lines&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Every possibility should be accounted as a valid line terminator:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;- &amp;lt;CR&amp;gt;&#xA;- &amp;lt;LF&amp;gt;&#xA;- &amp;lt;CR&amp;gt;&amp;lt;LF&amp;gt;&#xA;- &amp;lt;LF&amp;gt;&amp;lt;CR&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;No winner, it is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; per language basis. Still thinking if I should give some bonus for sorting by line count.&lt;/p&gt;&#xA;" OwnerUserId="29325" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-11-14T18:55:31.650" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14220" PostTypeId="2" ParentId="2140" CreationDate="2017-11-15T02:30:28.733" Score="0" Body="&lt;h1&gt;Clear the centrally significant on bits&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary&amp;#39;&quot; rel=&quot;tag&quot;&gt;binary&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/148049/clearing-the-most-significant-bit-from-an-integer&quot;&gt;Related and inspired by.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input is a single positive integer &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It's easiest to describe this by example.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;n = 433&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Take &lt;code&gt;n&lt;/code&gt;'s binary representation.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;bin(n) = 110110001 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note which bits are on.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;110110001&#xA;^^ ^^   ^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Set the center bit of those that are on to &lt;code&gt;0&lt;/code&gt;.  (if there is an even number of &lt;code&gt;1&lt;/code&gt; bits, set both to &lt;code&gt;0&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;110010001&#xA;^^ !^   ^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Finally, represent the input as an integer again.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;unbin(110010001) = 401&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 =&amp;gt; 0&#xA;13 =&amp;gt; 9&#xA;115 =&amp;gt; 99&#xA;236 =&amp;gt; 204&#xA;433 =&amp;gt; 401&#xA;732 =&amp;gt; 652&#xA;1555 =&amp;gt; 1539&#xA;1556 =&amp;gt; 1028&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Additional Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/75524&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="55696" LastEditorUserId="55696" LastEditDate="2017-11-15T02:35:52.483" LastActivityDate="2017-11-15T02:35:52.483" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14221" PostTypeId="2" ParentId="2140" CreationDate="2017-11-15T03:43:18.100" Score="1" Body="&lt;h1&gt;Shortest Path Distance&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Uh oh! You want to get to the point (10,10) from the origin, but there are a whole bunch of boxes in the way! What is the length of the shortest path which avoids all of them?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program should take a set of rectangles, defined by the coordinates of two opposite corners, as input; the format is up to you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, a possible input might look like &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[(1,3), (5,2)], [(5,4), (7,5)]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;But you could also take it as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[(1,3), (5,2)]&#xA;[(5,4), (7,5)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or anything else, as long as it allows for unambiguous input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These inputs would define the rectangles shown below:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/z8KGG.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/z8KGG.png&quot; alt=&quot;Minimum path length to A from (0,0): sqrt(10) + sqrt(130), approx 14.564&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can assume that all rectangles will have integer coordinates with x,y between 1 and 9 inclusive, which guarantees a possible path. You can also assume that no rectangles intersect in any way (that means no shared edges or vertexes). &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program/function must return the value of the shortest path from the origin to (10,10), have the absolute error at most 10&lt;sup&gt;-2&lt;/sup&gt; and measured using the euclidean metric.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the example given above, 14.564 and 14.56 would be accepted, while 14.55 and 14.57 would not.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example I/O&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[(1,3), (5,2)], [(5,4), (7,5)]] -&amp;gt; 11.40&#xA;[] -&amp;gt; 14.14&#xA;[[(1,1), (2,9)], [(9,2), (3,1)]] -&amp;gt; 14.28&#xA;[[(2,2), (1,1)], [(9,3), (8,5)], [(1,9), (2,8)]] -&amp;gt; 14.28 (Note: rounded up)&#xA;[[(9,1), (1,9)]] -&amp;gt; 18.11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Other Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Shortest code wins, no exploiting loopholes, yadda yadda yadda, you get the idea, it's code golf.&lt;/p&gt;&#xA;" OwnerUserId="76025" LastEditorUserId="69850" LastEditDate="2018-01-07T13:22:14.277" LastActivityDate="2018-01-07T13:22:14.277" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="14223" PostTypeId="1" AcceptedAnswerId="14224" CreationDate="2017-11-15T10:54:46.190" Score="10" ViewCount="634" Body="&lt;p&gt;Regarding &lt;a href=&quot;https://codegolf.stackexchange.com/a/148147/71420&quot;&gt;this suggested crack&lt;/a&gt;, do I have to accept it as valid?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The code there is not valid 6502 machine code because it uses an opcode that doesn't exist (and won't work / crash on CMOS variants of the 6502 processor family). But it works correctly on all NMOS variants, and there wasn't ever an unmodified C64 shipped with a CMOS processor. So it will in practice only crash on systems like the C64 DTV (first generation) or a C64 equipped with a &quot;turbo&quot; extension like the SuperCPU that includes a CMOS processor.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Reject it&lt;/em&gt;: It isn't valid 6502 code any more, will crash on an &quot;accelerated&quot; C64 and some emulated systems, and if a crack like this would be allowed, 6502 code targetting the C64 could often be &quot;trivially&quot; cracked.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Accept it&lt;/em&gt;: The code targets the C64 and will work correctly on any real machine that wasn't modified/extended. As &quot;undefined behavior&quot; is explicitly allowed here as long as the &lt;em&gt;actual&lt;/em&gt; behavior is the expected one, this is a valid crack.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So, what do you think? Do you have additional arguments for accepting/rejecting this crack?&lt;/p&gt;&#xA;" OwnerUserId="71420" LastActivityDate="2017-11-16T16:49:10.053" Title="In machine code, is using &quot;illegal&quot; opcodes a valid crack?" Tags="|discussion|cops-and-robbers|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14224" PostTypeId="2" ParentId="14223" CreationDate="2017-11-15T11:59:40.490" Score="15" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;By the definition of programming languages on this site, programming languages are defined by the implementation. So as long as there exists a machine that can run that machine code and return correct result, it is valid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, for that particular case, you can specify that &quot;Intended crack doesn't use invalid opcode&quot;. If the OP (Stewie Griffin) or the community accept it (the cops can specify conditions on crack) for Cops and Robbers questions, the crack is invalid, otherwise the best you can say is &quot;cracked, not intended solution&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Alternatively, if there is any 6502 machine emulator that doesn't accept that submission you can specify that particular emulator (before posting the answer, for example: write the language name as &quot;6502 machine (accelerated C64)&quot;), then the submission will be invalid.&lt;/p&gt;&#xA;" OwnerUserId="69850" LastActivityDate="2017-11-15T11:59:40.490" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14225" PostTypeId="2" ParentId="2140" CreationDate="2017-11-15T12:55:47.897" Score="0" Body="&lt;h1&gt;Bring an end to the Vigil&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/munificent/vigil&quot; rel=&quot;nofollow noreferrer&quot;&gt;Vigil&lt;/a&gt;, being the supreme moral paragon of programming languages, inspires us all to write bug-free code without exceptions through supreme medieval punishment.&lt;/p&gt;&#xA;&lt;p&gt;However, every hero has their weakness, and &lt;a href=&quot;https://github.com/munificent/vigil/blob/master/vigil#L98&quot; rel=&quot;nofollow noreferrer&quot;&gt;Vigil's weakness is on line 98&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;except:&#xA;    print(&amp;quot;Vigil has failed to uphold supreme moral vigilance.&amp;quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your goal is to write a Vigil program that forces Vigil to experience an exception, reach this line, and print this error. Because it's not enough to merely succeed at our master plans, but instead we ought to succeed &lt;em&gt;efficiently,&lt;/em&gt; the shortest answer in bytes wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Draft proposal notes&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is a language-specific challenge in the Vigil language alone. (Is there a tag for that?)&lt;/li&gt;&#xA;&lt;li&gt;I'm not sure if a standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge is the best way to measure a winner in this scenario, but it's the primary measure that comes to mind.&lt;/li&gt;&#xA;&lt;li&gt;I'd like to ham this up a bit more with narrative. Maybe about us being the villains. The title could be wittier.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="18374" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-11-15T12:55:47.897" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14226" PostTypeId="2" ParentId="14223" CreationDate="2017-11-15T13:16:01.723" Score="14" Body="&lt;h1&gt;It depends.&lt;/h1&gt;&#xA;&lt;p&gt;If I understand it correctly:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The opcode is illegal in the language specification.  This doesn't matter.&lt;/li&gt;&#xA;&lt;li&gt;The opcode works on certain platforms, but doesn't work on other platforms.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Therefore, the question is:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Did you specify the platform in your post?  Does the crack fail on that platform?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If you can answer &amp;quot;yes&amp;quot; to both, then the crack is invalid.  If not, then tough luck :)&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-11-15T15:15:48.470" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14229" PostTypeId="2" ParentId="2140" CreationDate="2017-11-15T17:28:30.037" Score="1" Body="&lt;h1&gt;Smallest Proth Prime Power&lt;/h1&gt;&#xA;&lt;p&gt;A Proth Prime is a prime number of the form &lt;code&gt;(k*2^n)+1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a positive integer &lt;code&gt;k&lt;/code&gt;, return the smallest non-negative integer &lt;code&gt;n&lt;/code&gt; such that &lt;code&gt;(k*2^n)+1&lt;/code&gt; is a prime.&lt;/p&gt;&#xA;&lt;p&gt;This is code-golf, so smallest answer in bytes will win!&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://oeis.org/A040076&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS link for this sequence&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://oeis.org/A225721&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS link for sequence shifted by 1, with alternative calculation method&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input Output&#xA;1     0&#xA;2     0&#xA;3     1&#xA;4     0&#xA;5     1&#xA;6     0&#xA;7     2&#xA;8     1&#xA;9     1&#xA;10    0&#xA;11    1&#xA;12    0&#xA;13    2&#xA;14    1&#xA;15    1&#xA;16    0&#xA;17    3&#xA;18    0&#xA;19    6&#xA;20    1&#xA;46    0&#xA;47    583&#xA;48    1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;TODO:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Rework preamble&lt;/li&gt;&#xA;&lt;li&gt;More/better test cases?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41020" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-11-15T17:28:30.037" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14230" PostTypeId="2" ParentId="14223" CreationDate="2017-11-15T20:50:46.820" Score="1" Body="&lt;h2&gt;Yes - it's been done for years.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Some of the first golfers (known then as &quot;programmers&quot;, or sometimes &quot;hackers&quot;) would use invalid opcodes to make their programs faster and take up less space (two things almost synonymous, ignoring the algorithm and loop unrolling). I won't go into details about the benefits and widespread use of such undocumented opcodes - you can read more &lt;a href=&quot;https://retrocomputing.stackexchange.com/q/1591/278&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Banning this golfing technique would be akin to banning closures in a language where they were an emergent feature-not-bug of the original implementation, and an unofficial clean-room reimplementation from the language documentation didn't support them.&lt;/p&gt;&#xA;" OwnerUserId="43394" LastEditorUserId="43394" LastEditDate="2017-11-16T16:49:10.053" LastActivityDate="2017-11-16T16:49:10.053" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="14232" PostTypeId="2" ParentId="11924" CreationDate="2017-11-16T11:52:27.423" Score="7" Body="&lt;h1&gt;&lt;a href=&quot;https://www.dyalog.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;APL (Dyalog)&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Based on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11925/43319&quot;&gt;xnor's Python answer&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11940/43319&quot;&gt;&#xA;user62131's Jelly answer&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;General I/O&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your submission should be a program (tradfn), a function (tradfn, dfn, or tacit function), or an operator (tradop or dop). It should prompt for character and/or evaluated input from STDIN and/or take one or two arguments. It should return the result and/or print to STDOUT or STDERR. If nothing else is specified, programs print to STDOUT and functions return results.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;There are two ways to access STDIN: &lt;code&gt;⍞&lt;/code&gt; gets a single line of text as-is. &lt;code&gt;⎕&lt;/code&gt; gets a line of text and evaluates it. This is useful for numeric input, without having to use &lt;code&gt;⍎&lt;/code&gt; to execute the inputted text.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Expressions which are not assignments will implicitly print to STDOUT with a trailing newline. In dfns and dops, such lines will also terminate the function/operator. Output to STDOUT can also be made explicit (e.g. for a partial result in the middle of an expression or to enable a dfn/dop to continue) with &lt;code&gt;⎕←&lt;/code&gt;. Output to STDERR is done with &lt;code&gt;⍞←&lt;/code&gt; and does not have a trailing newline. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Programs&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Tradfn programs&lt;/strong&gt; are simply one or more lines of code, where input (if needed) is gotten with &lt;code&gt;⎕&lt;/code&gt; and/or &lt;code&gt;⍞&lt;/code&gt;. On TIO, Tradfn program go in the Code field and the Header field must have a &lt;code&gt;∇&lt;/code&gt; followed by a name for the program. The Footer field must have a &lt;code&gt;∇&lt;/code&gt;. In the Input field, the first line must have the program's name to call it, and lines immediately after that will be the lines of input, if any.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Functions and Operators&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Functions are either infix or prefix.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Tradfns functions&lt;/strong&gt; and &lt;strong&gt;Tradop Operators&lt;/strong&gt; include a header line which &lt;a href=&quot;http://help.dyalog.com/16.0/Content/Language/Defined%20Functions%20and%20Operators/Model%20Syntax.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;specifies their syntax&lt;/a&gt;. They may then refer to the names used in the header. They may do additional I/O in the manner of &lt;em&gt;tradfn programs&lt;/em&gt; (see above). On TIO, the entire tradfn/tradop goes in the Code field, the header must begin with a &lt;code&gt;∇&lt;/code&gt; and the last line must be a &lt;code&gt;∇&lt;/code&gt;, but these three characters (including a newline before the last &lt;code&gt;∇&lt;/code&gt;) should not be counted into the submission length.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Dfn functions&lt;/strong&gt; and &lt;strong&gt;Dop operators&lt;/strong&gt; are one or more lines of code where the first line begins with &lt;code&gt;{&lt;/code&gt; and the last ends with &lt;code&gt;}&lt;/code&gt;, and they refer to their right and optional left arguments as &lt;code&gt;⍵&lt;/code&gt; and &lt;code&gt;⍺&lt;/code&gt;. Dops additionally refer to their left and optional right operands as &lt;code&gt;⍺⍺&lt;/code&gt; and &lt;code&gt;⍵⍵&lt;/code&gt;. The first expression which is not an assignment will terminate the function, returning the result of that expression. They may otherwise do additional I/O in the manner of &lt;em&gt;tradfn programs&lt;/em&gt; (see above). On TIO, the entire dfn/dop (including braces) goes in the Code field, and the first line must be preceded by a name and &lt;code&gt;←&lt;/code&gt;, e.g. &lt;code&gt;MyFn←&lt;/code&gt;. The name and &lt;code&gt;←&lt;/code&gt; should not be counted into the submission length. In the Input field, the first line must have the function/operators's name to call it, followed and optionally preceded by arguments and, for operators, operands, and lines immediately after that will be the lines of additional input, if any.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Tacit functions&lt;/strong&gt; are single lines which refer to their arguments as right and optional left arguments as &lt;code&gt;⊢&lt;/code&gt; and &lt;code&gt;⊣&lt;/code&gt;, and to the result of applying a sub-function &lt;code&gt;f&lt;/code&gt; with same argument(s) as just &lt;code&gt;f&lt;/code&gt;. While &lt;code&gt;⎕&lt;/code&gt; and &lt;code&gt;⍞&lt;/code&gt; may be used for additional input, they will only take input one, namely when the function is defined, and that input becomes constant for all applications of the tacit function. On TIO, the entire tacit function goes in the Code field, and must be preceded by a name and &lt;code&gt;←&lt;/code&gt;, e.g. &lt;code&gt;MyFn←&lt;/code&gt;. The name and &lt;code&gt;←&lt;/code&gt; should not be counted into the submission length. In the Input field, the last line must have the function's name to call it, followed and optionally preceded by arguments, and lines before that will be the lines of additional input, if any.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;These example submissions compute a &lt;a href=&quot;https://en.wikipedia.org/wiki/Dot_product&quot; rel=&quot;nofollow noreferrer&quot;&gt;dot product&lt;/a&gt; of two vectors:&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;p&gt;Program (tradfn) that prompts for evaluated input and prints to STDOUT:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;⎕+.×⎕&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Program (tradfn) that prints to STDERR:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;⍞←⎕+.×⎕&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Function (tradfn) that prints to STDOUT:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x F y&#xA;x+.×y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Function (tradfn) that prints to STDERR:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x F y&#xA;⍞←x+.×y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Function (tradfn) that returns a result:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;r←x F y&#xA;r←x+.×y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Operator (tradop) that prints to STDOUT:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(x F) y&#xA;x+.×y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Operator (tradop) that prints to STDERR:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(x F) y&#xA;⍞←x+.×y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Operator (tradop) that returns a result:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;r←(x F) y&#xA;r←x+.×y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Function (dfn):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{⍺+.×⍵}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Operator (dop):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{⍺⍺+.×⍵}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You may not expect input pre-written to a variable:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;⍝ Invalid, expects input in x and y&#xA;x+.×y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Nor may you output just by saving the result to a variable.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;⍝ Invalid, saves result to r&#xA;r←⎕+.×⎕&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Input formats&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We're liberal about input formats. For example, if a challenge says to take a table of numbers, you may expect an APL vector of vectors like &lt;code&gt;(1 2)(3 4)&lt;/code&gt; or an actual matrix, like &lt;code&gt;2 2⍴1 2 3 4&lt;/code&gt;, not necessarily JSON like &lt;code&gt;[[1,2][3,4]]&lt;/code&gt;. So, an APL program can do&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;t←↑⎕&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;t←⎕&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;rather than&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;t←↑⎕JSON ⍞&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Versions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Dyalog APL is backwards compatible. However, you may set the states of &lt;a href=&quot;http://help.dyalog.com/16.0/Content/Language/System%20Functions/div.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;⎕DIV&lt;/code&gt;&lt;/a&gt; (&lt;strong&gt;Div&lt;/strong&gt;ision Method), &lt;a href=&quot;http://help.dyalog.com/16.0/Content/Language/System%20Functions/fr.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;⎕FR&lt;/code&gt;&lt;/a&gt; (&lt;strong&gt;F&lt;/strong&gt;loating-point &lt;strong&gt;R&lt;/strong&gt;epresentation), &lt;a href=&quot;http://help.dyalog.com/16.0/Content/Language/System%20Functions/io.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;⎕IO&lt;/code&gt;&lt;/a&gt; (&lt;strong&gt;I&lt;/strong&gt;ndex &lt;strong&gt;O&lt;/strong&gt;rigin), &lt;a href=&quot;http://help.dyalog.com/16.0/Content/Language/System%20Functions/ml.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;⎕ML&lt;/code&gt;&lt;/a&gt; (&lt;strong&gt;M&lt;/strong&gt;igration &lt;strong&gt;L&lt;/strong&gt;evel), and &lt;a href=&quot;http://help.dyalog.com/16.0/Content/Language/System%20Functions/wx.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;⎕WX&lt;/code&gt;&lt;/a&gt; (&lt;strong&gt;W&lt;/strong&gt;indow E&lt;strong&gt;x&lt;/strong&gt;pose) to achieve the desired behaviour. You do not have to count the characters needed to set these. This is justified by the existence of systems where the needed setting is default.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Libraries&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You may import libraries. The &lt;code&gt;⎕CY&lt;/code&gt; (&lt;strong&gt;C&lt;/strong&gt;op&lt;strong&gt;y&lt;/strong&gt;) statement counts as part of the code length, e.g. &lt;code&gt;⎕CY'dfns'&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A function submission may include helper code outside the function, for example &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;⎕CY'dfns'⋄N←NormRand&#xA;f← ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Truthy/Falsey&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Some challenges ask for a output to be truthy or falsey, which is determined by what conditionals like &lt;code&gt;:If&lt;/code&gt; and dfn/dop guards (&lt;code&gt;:&lt;/code&gt;) can accept. Simple arrays containing a single 1 or 0, with any number of dimensions (0–15) are acceptable for truthy and falsey respectively. All other values are non-Boolean.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Dyalog APL has its own &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9429/43319&quot;&gt;256-character code page&lt;/a&gt;. If your code consists entirely of characters in this code page (most do), you can score the it as 1 byte per character.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you need to use characters outside APL's code page for some reason, this is legal, but you must score your program using a UTF-8 byte count, in which non-ASCII characters count as 2 or more bytes. &lt;a href=&quot;https://tio.run/#apl-dyalog&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO's Dyalog Unicode&lt;/a&gt; will report both character count and UTF-8 byte count on the top left of the Code field, in the format &quot;X chars, Y bytes (UTF-8)&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;Three primitives (built-ins) added in each of versions 14.0 (&lt;code&gt;⌸&lt;/code&gt;, &lt;code&gt;⍤&lt;/code&gt;, and &lt;code&gt;⍠&lt;/code&gt;) and 16.0 (&lt;code&gt;⌺&lt;/code&gt;, &lt;code&gt;⊆&lt;/code&gt;, and &lt;code&gt;⍸&lt;/code&gt;) are not included in the code page, and may therefore not be used in 1 byte per character submissions without counting each as its shortest multi-character alternative:&lt;br&gt;&#xA; &lt;code&gt;⌸&lt;/code&gt;⇒&lt;code&gt;⎕U2338&lt;/code&gt; &lt;code&gt;⍤&lt;/code&gt;⇒&lt;code&gt;⎕U2364&lt;/code&gt; &lt;code&gt;⍠&lt;/code&gt;⇒&lt;code&gt;⎕OPT&lt;/code&gt; &lt;br&gt;&#xA; &lt;code&gt;⊆&lt;/code&gt;⇒&lt;code&gt;⎕U2286&lt;/code&gt; &lt;code&gt;⌺&lt;/code&gt;⇒&lt;code&gt;⎕U233A&lt;/code&gt; &lt;code&gt;⍸&lt;/code&gt;⇒&lt;code&gt;⎕U2378&lt;/code&gt;&lt;br&gt;&#xA;Also, remember that these longer names need to be followed by a space if the next character is alphanumeric. Note that the dyadic form of &lt;code&gt;⊂&lt;/code&gt; can be reached by setting &lt;code&gt;⎕ML←3&lt;/code&gt; and using &lt;code&gt;⊂&lt;/code&gt; instead, however, you must account for &lt;a href=&quot;http://help.dyalog.com/16.0/Content/Language/System%20Functions/ml.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;all other changes due to &lt;code&gt;⎕ML&lt;/code&gt; changing&lt;/a&gt;.&lt;/s&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14330/43319&quot;&gt;You can&lt;/a&gt; now use all the built-ins by claiming use of &lt;a href=&quot;https://github.com/abrudz/SBCS&quot; rel=&quot;nofollow noreferrer&quot;&gt;SBCS&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2020-04-05T10:23:16.387" LastActivityDate="2020-04-05T10:23:16.387" CommentCount="2" CommunityOwnedDate="2017-11-16T11:52:27.423" ContentLicense="CC BY-SA 4.0" />
  <row Id="14235" PostTypeId="2" ParentId="2140" CreationDate="2017-11-16T21:05:38.590" Score="1" Body="&lt;h1&gt;Packing Density of Polyline Defined Shapes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;So... I was making bacon this morning and I couldn't fit all of my bacon into my pan. However I oriented the strips, there was always one or two pieces that didn't fit. Culinary endeavors aside, here's my challenge:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;pan and bacon&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each of these inputs is a list of (X,Y) coordinates that define a closed shape. The very first index and the very last index are different, but the shape is closed. It not guaranteed that the shape is convex, but it is guaranteed that the path doesn't cross itself. Further, for simplicity, you may expect all the (x,y) coordinates to be integers. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program must find the most occurences of bacon that can fit into the pan, allowing rotation and flipping.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An integer that represents how much bacon can fit in the pan.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring and rules:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For proper cooking:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A &lt;code&gt;bacon&lt;/code&gt; may touch another &lt;code&gt;bacon&lt;/code&gt; or the edge of the &lt;code&gt;pan&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;bacon&lt;/code&gt; may not overlap, nor may it go off the &lt;code&gt;pan&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The first index of both &lt;code&gt;pan&lt;/code&gt; and &lt;code&gt;bacon&lt;/code&gt; is &lt;em&gt;always&lt;/em&gt; (0,0).&lt;/li&gt;&#xA;&lt;li&gt;If there is a tie in number of bytes, the user whose code is formatted to look like ASCII bacon wins.&lt;/li&gt;&#xA;&lt;li&gt;If two users tie and both have ascii bacon, upvotes wins. &#xA;Standard rules apply. This is code golf, so the standard rules apply. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Sample input and output:&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Test Case 1:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;&lt;code&gt;Bacon&lt;/code&gt; directly overlaps the pan, and is the same size.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;pan&lt;/code&gt;:  [(0,0),(0,1),(1,1),(1,0)]&lt;br&gt;&#xA;&lt;code&gt;bacon&lt;/code&gt;: [(0,0),(0,1),(1,1),(1,0)]&lt;br&gt;&#xA;Output: 1&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Case 2:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;When &lt;code&gt;bacon&lt;/code&gt; is bigger than &lt;code&gt;pan&lt;/code&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;pan&lt;/code&gt;: [(0,0),(0,1),(1,1),(1,0)]&lt;br&gt;&#xA;&lt;code&gt;bacon&lt;/code&gt;: [(0,0),(0,2),(2,2),(2,0)]&lt;br&gt;&#xA;Output: &lt;em&gt;either 0 or an error&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Case 3:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;What happens when &lt;code&gt;bacon&lt;/code&gt; crosses itself?&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;pan&lt;/code&gt;: [(0,0),(0,1),(1,1),(1,0)]&lt;br&gt;&#xA;&lt;code&gt;bacon&lt;/code&gt;:[(0,0),(1,1),(0,1),(1,0)]&lt;br&gt;&#xA;Output: &lt;em&gt;just error here. Any way you feel like. If you manage to report an http 418 error, you get bonus points, redeemable for nothing.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Case 4:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;What happens if the bacon doesn't exactly overlap the pan?&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;pan&lt;/code&gt;: [(0,0),(0,3),(5,3),(3,0)]&lt;br&gt;&#xA;&lt;code&gt;bacon&lt;/code&gt;: [(0,0),(0,2),(2,2),(2,0)]&lt;br&gt;&#xA;Output: 2&lt;/p&gt;&#xA;" OwnerUserId="76093" LastEditorUserId="76093" LastEditDate="2017-11-16T21:55:10.850" LastActivityDate="2017-11-16T21:55:10.850" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14237" PostTypeId="2" ParentId="2140" CreationDate="2017-11-17T00:57:04.837" Score="0" Body="&lt;h1&gt;Inverse Radiation Hardened Quine&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Radiation hardened quines have been around for a long time. The basic idea is that it's (possibly) a valid quine, and if you remove any character, it's still valid. But what about the other way around? What if you added a character? &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge Description&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Develop a program which will output its source code, even when a character is inserted in any position in the source code. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This program is a quine. It shouldn't take any input. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When the quine runs, it should either output its own source code, or the source code of the proto-quine. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Programs are scored on their robustness. That is, for a given program, if the characters &quot;a&quot;, &quot;!&quot;  or &quot;&quot; could be put into the program at any point and it remain a quine, then the program has a score of 3. I leave the burden of testing what characters work for your program up to you. Note that in languages with a limited character set (such as HQ9+ or brainfuck) characters that do nothing yield no score. You couldn't write a normal quine in brainfuck and then claim that every single unicode codepoint except the few used in a brainfuck program was your score. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, other than that, standard rules apply. &lt;/p&gt;&#xA;" OwnerUserId="76093" LastEditorUserId="76093" LastEditDate="2017-11-17T02:40:12.527" LastActivityDate="2017-11-17T02:40:12.527" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="14240" PostTypeId="1" AcceptedAnswerId="14241" CreationDate="2017-11-17T14:09:59.787" Score="3" ViewCount="106" Body="&lt;p&gt;A few days ago, I asked &lt;a href=&quot;https://codegolf.stackexchange.com/q/147919/75524&quot;&gt;this question&lt;/a&gt; after leaving it in the sandbox for a bit. It got closed as &quot;unclear what you're asking&quot;, because I didn't notice something that needed clarification in the sandbox. I edited the question to clarify it, and it got reopened.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What confuses me is that it then got closed again, with the same close reason. Why?&lt;/p&gt;&#xA;" OwnerUserId="75524" LastActivityDate="2017-11-17T17:06:56.917" Title="What makes this question unclear?" Tags="|support|specific-question|closed-questions|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14241" PostTypeId="2" ParentId="14240" CreationDate="2017-11-17T17:06:56.917" Score="4" Body="&lt;p&gt;I believe the thing which causes most confusing is that, although the meaning you are using for &quot;p-dimensional sub-array&quot; can be inferred through careful analysis of some particular subsections of your challenge, the way you present it is as though this definition is the natural definition for &quot;p-dimensional sub-array&quot; and you're just adding reminders. To me (and apparently several others), an N-dimensional array is not just an array containing other N-1 dimensional arrays, it is a means of representing N-dimensional organization. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, in this challenge a 2-dimensional array with 2 elements in each dimension is this: &lt;code&gt;[[1, 2], [3, 4]]&lt;/code&gt; and if you ask for a 1-dimensional sub-array the challenge is &quot;From this array, pick an element&quot; because it's an array containing 1-dimensional arrays. However, when I am told a 2-dimensional array is defined by &lt;code&gt;[[1, 2], [3, 4]]&lt;/code&gt; the structure it represents to me is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 2&#xA;3 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;as a single 2-dimensional data structure, not as just some arrays that happen to be indexed. When viewing the 2-dimensional structure, there isn't any intuitive reason [1,2] is a valid 1-dimensional sub-array but [1,3] is not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It might help if you describe things as &quot;Nested arrays&quot; rather than &quot;N-dimensional arrays&quot; to keep people from expanding the structure, but I think just working through an example in more detail would help explain the flow of logic the most.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastActivityDate="2017-11-17T17:06:56.917" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14243" PostTypeId="2" ParentId="2140" CreationDate="2017-11-17T22:40:31.067" Score="2" Body="&lt;h1&gt;Bunnies in (three-dimensional) space&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A panicked call has come in from the International Space Station: a psychological experiment has gone awry, and the astronauts have lost all their &lt;a href=&quot;http://graphics.stanford.edu/data/3Dscanrep/#bunny&quot; rel=&quot;nofollow noreferrer&quot;&gt;Stanford Bunnies&lt;/a&gt;. You have been tasked to come up with a way to get them as many replacements as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&amp;nbsp;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/PqEXX.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/PqEXX.png&quot; alt=&quot;a description of the plan&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&amp;nbsp;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because of the rush, NASA has just &lt;em&gt;one&lt;/em&gt; rocket available for this mission: a Delta II Heavy with a box-shaped cargo hold (a &quot;right cuboid&quot;, they called it) of length &lt;code&gt;x&lt;/code&gt;, width &lt;code&gt;y&lt;/code&gt; and height &lt;code&gt;z&lt;/code&gt;, all even integers. Your job is finding out how many bunnies to bring - and how to pack them.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input and output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program should take the dimensions of the cargo hold as arguments. It should then compute how many bunnies it can fit in there, producing output as follows:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;A header line consisting of the length, width and height of the box, as integers, seperated by spaces. This is a copy of the input.&lt;/li&gt;&#xA;  &lt;li&gt;A line for every bunny fitted, containing the following as dotted floats, all seperated by spaces:&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;the position of the center of the bunny, relative to the center of the box, as x, y and z&lt;/li&gt;&#xA;  &lt;li&gt;the rotation of the bunny, as a rotation about the x, y and z axes, in that order (a.k.a. Tait–Bryan angles).&lt;/li&gt;&#xA;  &lt;/ul&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;For example, a solution for a box of 4 × 6 × 8 units, with a single, un-rotated bunny in the center, would be described as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4 6 8&#xA;0.0  0.0  0.0   0.0  0.0  0.0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A solution for a larger box of 12 × 8 × 8 units with two bunnies could look like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;12 8 8&#xA; 4.5433 2.5843  1.4380 3.1415 0.0000 0.0000&#xA;-2.4839 1.3923 -1.9400 0.0000 0.0000 1.5707&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;...although your program will likely be able to fit more bunnies.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Dataset&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://gist.github.com/anonymous/136141d495ebb4c29a6146f693b54c5d&quot; rel=&quot;nofollow noreferrer&quot;&gt;This is the vertex data for the bunny.&lt;/a&gt; It is in &lt;a href=&quot;https://en.wikipedia.org/wiki/Wavefront_.obj_file&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wavefront OBJ&lt;/a&gt; format, which means that every 'v' line describes a vertex (point in x, y, z space), and every 'f' line describes a triangle of vertices. Compared to the original Stanford Bunny model, this model has been translated so that its centerpoint is at the origin (0, 0, 0) and it fits snugly inside a unit cube.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Tips&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You don't have to use the dataset above in your program - for example, you might want to simplify it more - but you should make sure that your output is correct when using the 'official' model.&lt;/li&gt;&#xA;&lt;li&gt;Be careful with rounding, both during calculations and when outputting your result.&lt;/li&gt;&#xA;&lt;li&gt;The Wavefront format can be imported into the free &lt;a href=&quot;http://blender.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;blender&lt;/a&gt; program if you want to see what it looks like (make sure to choose 'Z Up').&lt;/li&gt;&#xA;&lt;li&gt;Your program does not have to be usable for other models: it can be a special-purpose bunny-fitting utility.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Rules and winner&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A valid solution is one where, if you constructed a box of bunnies using the solution's description and the vertex data above, none of the bunnies would touch each other or the bounding box.&lt;/li&gt;&#xA;&lt;li&gt;Your program has to be usable for box sizes other than the one below. &lt;/li&gt;&#xA;&lt;li&gt;Your entry should run in less than, say, ten minutes on reasonable hardware.&lt;/li&gt;&#xA;&lt;li&gt;The program must be self-contained: you can only use your language's standard libraries.&lt;/li&gt;&#xA;&lt;li&gt;The winner is the program that succesfully fits the most bunnies in a box of &lt;strong&gt;12 × 8 × 6&lt;/strong&gt;. Include (a link to) your code, (a link to) a solution for that box size, and, if you made any, a picture of your solution.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="19075" LastEditorUserId="19075" LastEditDate="2017-11-17T22:51:46.553" LastActivityDate="2017-11-17T22:51:46.553" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="14244" PostTypeId="2" ParentId="2140" CreationDate="2017-11-17T23:26:14.843" Score="0" Body="&lt;h1&gt;Rhythm Generator&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Your task&lt;/strong&gt;: given a number &lt;code&gt;n&lt;/code&gt; from 2 to 5 inclusive, (pseudo)randomly generate a valid rhythm in the time signature &lt;code&gt;n/4&lt;/code&gt;, and output using the system explained below. It must have an equal chance of choosing each valid rhythm.&lt;/p&gt;&#xA;&lt;h3&gt;Background Information:&lt;/h3&gt;&#xA;&lt;p&gt;In music, collections of beats are called &amp;quot;measures.&amp;quot; You can only fit a certain number of beats in a measure, determined by the time signature. For example, a time signature of &lt;code&gt;4/4&lt;/code&gt; would mean that you can put 4 (as determined by the first number) quarter note (determined by the second number) beats in the measure.&lt;/p&gt;&#xA;&lt;p&gt;There are different kinds of notes. For the purposes of this challenge, the following characters will represent different kinds of notes (and how many quarter note beats each one is worth):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;W        Whole note                4&#xA;H        Half note                 2&#xA;K        Dotted Half note          3&#xA;Q        Quarter note              1&#xA;D        Dotted Quarter note       1.5&#xA;E        Eighth note               0.5&#xA;F        Dotted Eighth note        0.75&#xA;S        Sixteenth note            0.25&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;sub&gt;(There are other kinds of notes but they do not apply to this challenge)&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;p&gt;Note: A dotted note takes 1.5 of the length of its non-dotted counterpart.&lt;/p&gt;&#xA;&lt;p&gt;In a &lt;code&gt;n/4&lt;/code&gt; measure there can only be &lt;code&gt;n&lt;/code&gt; quarter note beats. Some notes take more than a beat, some less. But the total number of beats needs to add up to &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For example, here are some valid &lt;code&gt;4/4&lt;/code&gt; measures (separated by newlines):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;W&#xA;HH&#xA;QQQQ&#xA;EEEEEEEE&#xA;SSSSSSSSSSSSSSSS&#xA;KEE&#xA;EQQQE&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And here are some examples of valid &lt;code&gt;3/4&lt;/code&gt; measures:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;K&#xA;DD&#xA;QQQ&#xA;QDE&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;So, your task is to generate a rhythm and output it in that format.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;So now let's make some music!&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Test Cases:&lt;/h3&gt;&#xA;&lt;p&gt;Coming soon. Will be a complete list of all possible valid rhythms.&lt;/p&gt;&#xA;" OwnerUserId="64159" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-11-17T23:26:14.843" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14245" PostTypeId="2" ParentId="2140" CreationDate="2017-11-18T10:39:32.427" Score="0" Body="&lt;h1&gt;View float numbers in graphical binary&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/IEEE_754&quot; rel=&quot;nofollow noreferrer&quot;&gt;IEEE 754&lt;/a&gt; is a well known format for representing floating point numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to give an input to the user where he/she enters a signed float number and represents clearly the number in a color separated by functional area binary 32 bit single representation, like:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/e/e8/IEEE_754_Single_Floating_Point_Format.svg&quot;/&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You do not have to append the captions like they are in the figure.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You must follow the order Sign, Exponent, Fraction&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may choose whatever colors you want, as they are distinguishable from each other and from the binary text numbers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The input (I suggest a text box) does not have to forbid invalid values, but if does not, the graphical binary view needs to indicate the invalidity. You can leave it empty or replace with some text like &quot;ERROR&quot; or &quot;INVALID&quot;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Every little change on the input needs to make the binary view to be immediately updated. Changing and have to confirm with an &quot;OK&quot; like button is not acceptable.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;No winner, unless I see some very creative answer.&#xA;I would like to see a golfed and an ungolfed version of the code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/floating-point&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;floating-point&amp;#39;&quot; rel=&quot;tag&quot;&gt;floating-point&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary&amp;#39;&quot; rel=&quot;tag&quot;&gt;binary&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;conversion&amp;#39;&quot; rel=&quot;tag&quot;&gt;conversion&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="29325" LastEditorUserId="48198" LastEditDate="2017-11-22T15:08:51.610" LastActivityDate="2017-11-22T15:08:51.610" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14247" PostTypeId="1" AcceptedAnswerId="14249" CreationDate="2017-11-18T21:55:09.667" Score="14" ViewCount="350" Body="&lt;p&gt;I'm referring to this question: &lt;a href=&quot;https://codegolf.stackexchange.com/q/49891/62101&quot;&gt;Tips for golfing in Befunge 93&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's currently closed as a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/q/16090/62101&quot;&gt;&quot;Tips for golfing in Befunge 98&quot;&lt;/a&gt;, but they're really not the same language - they're probably about as similar as C and C++. While there's obviously a fair amount of overlap, more than half of the current Befunge 98 tips are specific to 98. And there'd almost certainly be tips that were specific to Befunge 93, if only there were some place to post them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, I'd be OK with the two questions remaining merged if we could at least change the title of the question to remove the reference to &quot;98&quot;. And ideally the answers that are specific to Befunge-98 should also be marked as such. However, that solution was already proposed nearly four years ago, and nothing has been done about it, so it looks like the original poster is just not willing to go that route.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So what's the next step?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do I make the changes to all the posts myself and risk an edit war&#xA;with the original author?&lt;/li&gt;&#xA;&lt;li&gt;Do I leave things as they are and just not&#xA;post tips for Befunge-93?&lt;/li&gt;&#xA;&lt;li&gt;Or can we possibly consider reopening the&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/49891/62101&quot;&gt;&quot;Tips for golfing in Befunge&#xA;93&quot;&lt;/a&gt; topic and&#xA;treat them as separate languages?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="62101" LastActivityDate="2017-11-19T11:45:33.370" Title="Should we reopen the &quot;Tips for golfing in Befunge 93&quot; question?" Tags="|discussion|closed-questions|reopening|tips|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14249" PostTypeId="2" ParentId="14247" CreationDate="2017-11-19T11:45:33.370" Score="26" Body="&lt;h1&gt;Edit 'Tips for Befunge 98' to be general Befunge tips&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I think the solution for this would be to merge the two versions into one 'language' as far as tips are concerned. This is how it is normally done, for example there is a &lt;a href=&quot;https://codegolf.stackexchange.com/q/54/60919&quot;&gt;&quot;Tips for Golfing in Python&quot;&lt;/a&gt;, where both Python 2 and Python 3 specific tips are posted.&lt;/p&gt;&#xA;" OwnerUserId="60919" LastActivityDate="2017-11-19T11:45:33.370" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14252" PostTypeId="1" CreationDate="2017-11-20T22:59:38.167" Score="10" ViewCount="242" Body="&lt;p&gt;When I first joined around ~1.5 years ago there were ~10-20 new questions per day! Everyone had plenty of stuff to answer and there was plenty of variety... I think we need to bring back incentive to question writing because new users aren't doing it as often. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some suggestions of how to implement QotW:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Create a thread that is a sandbox of sorts for a &quot;QotW (Question of the Week)&quot;.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This thread will be a basic sandbox for people to submit questions.&lt;/li&gt;&#xA;&lt;li&gt;The questions submitted will be voted on, and at the end of Sunday (or any specified day) the highest voted question will be posted by a moderator. &lt;/li&gt;&#xA;&lt;li&gt;This question will also receive and immediate bounty (of whatever).&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Have a moderator choose a question from the current sandbox to post themselves (with permission from the original author).&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The author is awarded X reputation points for being chosen.&lt;/li&gt;&#xA;&lt;li&gt;The author is prominently mentioned in the QotW.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Other ideas?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Let me know what you think... I really do think we need a reward for filling our sandbox. Our sandbox is overflowing, and a lot of that overflow will die.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="59376" LastEditDate="2017-11-20T23:28:55.267" LastActivityDate="2017-11-21T04:24:31.327" Title="We Should have a QotW (Question of the Week)" Tags="|discussion|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="14253" PostTypeId="2" ParentId="14252" CreationDate="2017-11-21T04:24:31.327" Score="8" Body="&lt;h1&gt;A similar idea, weekly topic contests&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There exists a similar idea which has been tried multiple times across the stackexchange network. &lt;a href=&quot;https://meta.stackexchange.com/questions/240634/how-do-weekly-topic-challenges-work&quot;&gt;Here&lt;/a&gt; is a post on mother meta describing it. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;An &quot;implementation&quot; of this idea can be found in &lt;a href=&quot;https://puzzling.meta.stackexchange.com/questions/3292/what-should-the-subjects-of-our-fortnightly-topic-challenges-be-with-updates&quot;&gt;this post&lt;/a&gt; on the &lt;em&gt;puzzling.stackexchange&lt;/em&gt; meta (which is actually how I came to know about it). It was a fortnightly contest there and it seems to have stopped some months ago&lt;sup&gt;1&lt;/sup&gt;. I think we should also do this with a fortnigthly cadence in order to give more complex challenges the time be posted and appreciated by people.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;How could it work for PPCG&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We make a post on meta asking for topics for these kinds of contests, people can post answers (one per topic) and can vote on them.&lt;/li&gt;&#xA;&lt;li&gt;Every fortnight we take the highest voted topic and make a post on meta challenging people to write challenges about that topic. This post could work as a mini-sandbox where each challenge whishing to participate to the contest needs to get a net score of at least 5 &lt;em&gt;(this number can be tweaked)&lt;/em&gt; before posting it on main. Only challenges which have followed this procedure will be considered for the contest; this rule is to avoid spam of low-quality questions and encourage the use of the sandbox. Challenges posted on main should include a note stating that they are participating to the contest and a link to the post on meta.&lt;/li&gt;&#xA;&lt;li&gt;At the end of the fortnight the meta post for the contest is edited to include the list of all posted questions and a link to the question that received the most upvotes on main. The author of that question could be awarded some reputation, as suggested by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/59376/magic-octopus-urn&quot;&gt;Magic Octopus Urn&lt;/a&gt;, but I don't know how this could be managed (who should give them this reputation?).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think we could try this idea and see how it goes, it can be a fun community event and we don't really have anything to lose doing this.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;&lt;sup&gt;1&lt;/sup&gt; Yes, these kinds of contests sooner or later run out of ideas or people participation and die... It can still be fun while it lasts, though! On Puzzling, even with some skipped weeks, it went on for two years and nobody says it won't be revived in the future.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="62393" LastActivityDate="2017-11-21T04:24:31.327" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14255" PostTypeId="2" ParentId="2140" CreationDate="2017-11-21T22:40:16.800" Score="1" Body="&lt;h1&gt;Moore-Penrose inverse&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In linear algebra the pseudo-inverse of a matrix is a generalization of the inverse of a matrix which doesn't necessarily exist. One definition of a pseudo-inverse is called the &lt;a href=&quot;https://en.wikipedia.org/wiki/Moore%E2%80%93Penrose_pseudoinverse&quot; rel=&quot;nofollow noreferrer&quot;&gt;Moore-Penrose inverse&lt;/a&gt; which shall be denoted by &lt;strong&gt;A&lt;/strong&gt;⁺ in the following. Further let &lt;strong&gt;A&lt;/strong&gt;ᵀ denote the &lt;a href=&quot;https://en.wikipedia.org/wiki/Transpose&quot; rel=&quot;nofollow noreferrer&quot;&gt;transpose&lt;/a&gt; of the matrix &lt;strong&gt;A&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Definition&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The Moore-Penrose inverse of the matrix &lt;strong&gt;A&lt;/strong&gt; is defined for all matrices  &lt;strong&gt;A&lt;/strong&gt; in a way such that it satisfies the following four properties:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;AA⁺A&lt;/strong&gt; = &lt;strong&gt;A&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;A⁺AA⁺&lt;/strong&gt; = &lt;strong&gt;A⁺&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;(&lt;strong&gt;AA⁺&lt;/strong&gt;)ᵀ = &lt;strong&gt;AA⁺&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;(&lt;strong&gt;A⁺A&lt;/strong&gt;)ᵀ = &lt;strong&gt;A⁺A&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task in this challenge is, given a matrix real &lt;strong&gt;A&lt;/strong&gt; (non-zero and non-empty) to compute its pseudo-inverse as defined above.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You're allowed to receive input as a single list, array, list of lists etc.&lt;/li&gt;&#xA;&lt;li&gt;The input is a single non-zero, non-empty matrix with real entries&lt;/li&gt;&#xA;&lt;li&gt;The input matrix is &lt;strong&gt;not&lt;/strong&gt; necessarily square&lt;/li&gt;&#xA;&lt;li&gt;Your program/function either returns the pseudo-inverse or prints it to &lt;em&gt;STDOUT&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;You don't need to handle floating point inaccuracies&lt;/li&gt;&#xA;&lt;li&gt;The behavior on invalid input (eg. &lt;code&gt;[]&lt;/code&gt;) is left undefined&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here are some possible examples (note the different (in)accuracies):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[4] -&amp;gt; [0.25]&#xA;[1 1; 1 0] -&amp;gt; [0 1; 1 -1]&#xA;[12 4 9; -9 1 3; -6 6 15] -&amp;gt; [0.0467129 -0.0342457 -0.0217785; 0.0115298 0.0022497 0.0160292; 0.0251844 0.0076240 0.0404324]&#xA;[0 1 0; 0 0 1; 0 0 0; 2 0 0] -&amp;gt; [0 0 0 0.5; 1 0 0 0; 0 1 0 0]&#xA;[1 1 2 3] -&amp;gt; [0.0667; 0.0667; 0.1333; 0.2]&#xA;[0; 0; 1] -&amp;gt; [0 0 1]&#xA;[1 0 0 0 0; 2 0 0 0 0] -&amp;gt; [0.2 0.4; 0 0; 0 0; 0 0; 0 0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Sandbox&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should I ban built-ins (looking at Octave/Matlab, Mathematica etc.)?&lt;/li&gt;&#xA;&lt;li&gt;Is the part with floating-point inaccuracies formal/objective enough?&lt;/li&gt;&#xA;&lt;li&gt;Are more examples needed?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Tags&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/linear-algebra&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;linear-algebra&amp;#39;&quot; rel=&quot;tag&quot;&gt;linear-algebra&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="48198" LastEditorUserId="48198" LastEditDate="2017-11-21T22:58:45.750" LastActivityDate="2017-11-21T22:58:45.750" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14256" PostTypeId="2" ParentId="2140" CreationDate="2017-11-22T07:29:30.843" Score="0" Body="&lt;h1&gt;Examining the Student's Swing&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;http://www.nzqa.govt.nz/nqfdocs/ncea-resource/exams/2017/91028-exm-2017.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;2017 Level 1 Mathematics and Statistics NCEA examination paper&lt;/a&gt; has been making &lt;a href=&quot;http://www.nzherald.co.nz/nz/news/article.cfm?c_id=1&amp;amp;objectid=11946237&quot; rel=&quot;nofollow noreferrer&quot;&gt;headlines in New Zealand&lt;/a&gt; for being 'impossible' and bringing students to tears.&lt;/p&gt;&#xA;&lt;p&gt;One of the questions involves a children's playground swing, and finding where the holes in the swing seat should be placed. But lets generalise the problem in code in the fewest number of bytes, in case they have to solve for a different swing (in a different exam).&lt;/p&gt;&#xA;&lt;h3&gt;Task&lt;/h3&gt;&#xA;&lt;p&gt;Find how far apart the holes in the board need to be if the shape of the rope stays the same, given the following swing setup:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The rope hangs from a cross beam at a height &lt;code&gt;h&lt;/code&gt;, and will have a &lt;em&gt;parabolic&lt;/em&gt; shape, as presented in the exam (rather than a catenary shape), and will maintain this shape with the seat.&lt;/li&gt;&#xA;&lt;li&gt;The rope is connected to the crossbeam at two points, that are separated by a distance &lt;code&gt;d&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The lowest point (vertex) of the rope sits above the ground at a height of &lt;code&gt;v&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;We have an adequately sized wooden board for the seat, and we want this to be at a height &lt;code&gt;s&lt;/code&gt; above the ground.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Exam questions often have a visual representation to help clarify the question, so I've also included one:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/AXEgf.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/AXEgf.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;inputs must take positive real values&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;s&lt;/code&gt; will be greater than &lt;code&gt;v&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;output must be correct to at least 2dp.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, therefore, the lowest byte count in each programming language wins&lt;/li&gt;&#xA;&lt;li&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply, and no &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;forbidden loopholes&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;(h,d,v,s) -&amp;gt; hole separation&#xA;(4, 6, 1, 1.2) -&amp;gt; 1.549&#xA;(10, 4, 2, 4) -&amp;gt; 2&#xA;(14.5, 12, 2.5, 5.5) -&amp;gt; 6&#xA;(4.25, 3.4, 0.5, 1.2) -&amp;gt; 1.468&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Sandbox Questions&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;First time question, so any recommendations would be great&lt;/li&gt;&#xA;&lt;li&gt;Any recommendations for how I can make this a well received question?&lt;/li&gt;&#xA;&lt;li&gt;are there any rules I'm missing, or should add?&lt;/li&gt;&#xA;&lt;li&gt;is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;What other tags should this question have?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="73579" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-11-22T08:55:08.450" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="14262" PostTypeId="2" ParentId="2140" CreationDate="2017-11-23T10:17:25.747" Score="0" Body="&lt;h2&gt;Optimise Retina transliterations&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For the question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/148285/&quot;&gt;Translate Morse code based on tone duration&lt;/a&gt; I stupidly created the following transliteration:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;T`T\EMNAI\OGKDWRUSJ2V\HBZ89#@`NIGDRS8ZCBP\LF\H12356789_`\w@#&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The first thing wrong with it is that it &lt;code&gt;2&lt;/code&gt;, &lt;code&gt;8&lt;/code&gt; and &lt;code&gt;9&lt;/code&gt; transliterate to themselves, so they are superfluous. This saves 6 bytes:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;T`T\EMNAI\OGKDWRUSJV\HBZ#@`NIGDRS8ZCBP\LF\H13567_`\w@#&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The next thing to notice is that we have some runs of consecutive letters, but because they're not ordered we can't reduce them. Let's sort them:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;T`ABD\EG\HIJKMN\ORSTUVWZ#@`R6BIZ5S1CGD8\L\HNF3P7`\w@#&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We can now save another 3 bytes by using the run &lt;code&gt;G-K&lt;/code&gt;, a byte by using the run &lt;code&gt;M-O&lt;/code&gt;, and 3 bytes by using the run &lt;code&gt;R-W&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;T`ABD\EG-KM-OR-WZ#@`R6BIZ5S1CGD8\L\HNF3P7`\w@#&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Total 13 bytes saved. Note that there are other optimisation opportunities but I think they might be too difficult be worth adding to the question; for instance, inserting a &lt;code&gt;C&lt;/code&gt; (at a cost of 2 bytes) allows the creation of the run &lt;code&gt;A-E&lt;/code&gt; for a 3-byte saving, which is still overall a byte saved; inserting all of the letters to achieve run &lt;code&gt;A-Z&lt;/code&gt; would then be simplified to &lt;code&gt;L&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is the Retina command string too inflexible an input format? I suppose input could be in the form of an unordered mapping from printable ASCII to printable ASCII, but output would need to be the actual Retina syntax, including appropriate quoting, because the length of the result is important.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Quoting: The characters &lt;code&gt;-dEOHhLlwpoR`\&lt;/code&gt; need to be quoted except that the letters don't need to be quoted as part of a range.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should this be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2017-11-23T10:17:25.747" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14263" PostTypeId="2" ParentId="2140" CreationDate="2017-11-23T13:20:05.863" Score="4" Body="&lt;h1&gt;Formulize the sum: Faulhaber's formula&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polynomials&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polynomials&amp;#39;&quot; rel=&quot;tag&quot;&gt;polynomials&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sums of the form &lt;code&gt;Σkⁿ&lt;/code&gt; over &lt;code&gt;k in 1..x&lt;/code&gt; can be turned into a polynomial of &lt;code&gt;x&lt;/code&gt; whenever &lt;code&gt;n&lt;/code&gt; is a natural number.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Σ1 = x&#xA;Σk = (1/2)x²+(1/2)x&#xA;Σk²= (1/3)x³+(1/2)x²+(1/6)x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Criteria&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You will take &lt;code&gt;n&lt;/code&gt; as a non-negative integer input and output the coefficients in reduced fraction form of the resulting polynomial from leading coefficient down to the last non-zero coefficient.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, shortest code wins.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 #=&amp;gt; 1&#xA;1 #=&amp;gt; 1/2 1/2&#xA;2 #=&amp;gt; 1/3 1/2 1/6&#xA;3 #=&amp;gt; 1/4 1/2 1/4  0&#xA;4 #=&amp;gt; 1/5 1/2 1/3  0 -1/30&#xA;5 #=&amp;gt; 1/6 1/2 5/12 0 -1/12&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(extra spacing here is just for clarity and is not necessary.)&lt;/p&gt;&#xA;" OwnerUserId="58880" LastEditorUserId="58880" LastEditDate="2018-11-21T18:31:10.077" LastActivityDate="2018-11-21T18:31:10.077" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="14265" PostTypeId="2" ParentId="2140" CreationDate="2017-11-23T23:24:00.857" Score="0" Body="&lt;h1&gt;A Knight's Walk&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;On a chessboard, a knight has two options for movement: it can move one square horizontally and two squares vertically, or two squares horizontally and one square vertically. In short, it can follow the path drawn by an upper-case &quot;L&quot;. These can be oriented in any way, and as such, a knight has 8 potential moves from any given position.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There have been a number of challenges posted at one time or another regarding knights and their movement because they're so mathematically interesting (and the problems are easy to state) but we're going to go for a basic one that I haven't seen. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given two 2d coordinates &lt;code&gt;(x1, y1), (x2, y2)&lt;/code&gt; return the minimum number of moves required to travel from &lt;code&gt;(x1, y1)&lt;/code&gt; to &lt;code&gt;(x2, y2)&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are no other pieces on the board, and you may assume that the coordinate values given are valid (a set of two integers) though they may not be unique. You may also assume that each individual coordinate value will be between 0 and 255, and that the board is large enough that you needn't consider edges.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input Format&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As long as the coordinates are inputted in the order &lt;code&gt;x1 y1 x2 y2&lt;/code&gt; you can accept them as four separate values, two tuples, two lists, etc... &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(0, 0) (1, 2) =&amp;gt; 1&#xA;(0, 0) (1, 1) =&amp;gt; 2&#xA;(125, 125) (126, 127) =&amp;gt; 1&#xA;(-100, -100) (0, 100) =&amp;gt; 100&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="61029" LastEditorUserId="61029" LastEditDate="2017-11-24T03:34:22.443" LastActivityDate="2017-11-24T03:34:22.443" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="14269" PostTypeId="2" ParentId="202" CreationDate="2017-11-24T12:31:49.377" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://dotnetfiddle.net/&quot; rel=&quot;nofollow noreferrer&quot;&gt;.NETFiddle&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If most of the time, I will use Tio for .NET snippet. It is good to know about &lt;a href=&quot;https://dotnetfiddle.net/&quot; rel=&quot;nofollow noreferrer&quot;&gt;.NETFiddle&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;.NETFiddle supports C#, F# and VB.&lt;/li&gt;&#xA;&lt;li&gt;.NETFiddle compiles with .NET 4.5 or Roslyn 2.0&lt;/li&gt;&#xA;&lt;li&gt;.NETFiddle allows to use NuGet Packages &lt;strong&gt;!&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="15214" LastActivityDate="2017-11-24T12:31:49.377" CommentCount="0" CommunityOwnedDate="2017-11-24T12:31:49.377" ContentLicense="CC BY-SA 3.0" />
  <row Id="14270" PostTypeId="2" ParentId="2140" CreationDate="2017-11-24T13:47:41.320" Score="0" Body="&lt;h1&gt;Clean duplicate website from my history&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/coge-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;coge-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;coge-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I am looking for help to monitor my history. I parsed everything, but I am not yet happy with the final result. Could you help me?&#xA;I want to remove following same website.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My history looks like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;| url                                               | id |&#xA;|---------------------------------------------------|----|&#xA;| https://codegolf.stackexchange.com/q/147318/15214 | 4  |&#xA;| https://codegolf.stackexchange.com/q/148927/15214 | 4  |&#xA;| https://en.wikipedia.org/wiki/Code_golf           | 3  |&#xA;| http://lichess.org                                | 2  |&#xA;| https://en.wikipedia.org/wiki/Code_poetry         | 1  |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;But I want it to be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;| url                                               | id |&#xA;|---------------------------------------------------|----|&#xA;| https://codegolf.stackexchange.com/q/148927/15214 | 4  |&#xA;| https://en.wikipedia.org/wiki/Code_golf           | 3  |&#xA;| http://lichess.org                                | 2  |&#xA;| https://en.wikipedia.org/wiki/Code_poetry         | 1  |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If I browse a site, then another one, then the first one. I keep all of them.&lt;/li&gt;&#xA;&lt;li&gt;If I browse a site, then another part of the same site. I keep only the first one.&lt;/li&gt;&#xA;&lt;li&gt;The list is ordered from young to old. (we keep the older)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This challenge is inspired by my day work, but it is not related in any ways with anything in it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input is a list of identifier.&lt;/li&gt;&#xA;&lt;li&gt;Output is a list of two elements (identifier's index, identifier).&lt;/li&gt;&#xA;&lt;li&gt;No Empty input&lt;/li&gt;&#xA;&lt;li&gt;No standard loophole&lt;/li&gt;&#xA;&lt;li&gt;This is code-golf, so shortest answer in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples Input and Output&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;2 links on website 1&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[ 1, 1 ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;    [1,1]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;1 link on website 2, then 3 links on website 1&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[ 1, 1, 1, 2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;    [2,1],&#xA;    [3,2]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;1 link on website 1, then 1 link on website 2, then 2 link on website 1&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[ 1, 1, 2, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;    [1,1],&#xA;    [2,2],&#xA;    [3,1]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Question&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should I allow outputs as list of object, list of tuple or dictionary/map?&lt;/li&gt;&#xA;&lt;li&gt;Should I ask for url parsing where identifier is the hostname?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="15214" LastEditorUserId="15214" LastEditDate="2017-11-24T14:52:14.493" LastActivityDate="2017-11-24T14:52:14.493" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14272" PostTypeId="1" AcceptedAnswerId="14276" CreationDate="2017-11-26T13:26:23.890" Score="21" ViewCount="710" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/155018/the-programming-language-quiz-mark-ii-cops&quot;&gt;status&lt;/a&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/tagged/status-completed&quot;&gt;-&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/155019/the-programming-language-quiz-mark-ii-robbers&quot;&gt;completed&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/54807/the-programming-language-quiz&quot;&gt;The Programming Language Quiz&lt;/a&gt; was a Cops and Robbers challenge posted 2 years ago, where users were challenged to create obfuscated Hello, World! programs, and others tried to identify the language(s) in which those programs worked.&lt;/p&gt;&#xA;&lt;p&gt;The post is currently closed to new cops submissions (although new answers &lt;em&gt;can&lt;/em&gt; be posted, there isn't really a point), and given that a lot has changed in 2 years, I believe that posting a second iteration of the challenge could lead to some interesting answers, from languages not yet seen. For instance, there are 216 answers (many of which use the same languages) on the current thread, yet we have almost 400 languages available on &lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try It Online!&lt;/a&gt;, all of which need a Hello, World! program to be added.&lt;/p&gt;&#xA;&lt;p&gt;However, making the task for a new thread identical to the old one could allow some answers to be ported over (something that people weigh duplicates on) and could also allow accidental posting of similar answers to the old thread, which then get cracked easily, due to the old answer being revealed.&lt;/p&gt;&#xA;&lt;p&gt;Finally, we do have a consensus that reposting questions &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11103/reposts-of-answer-chaining-challenges/11123#11123&quot;&gt;is allowed&lt;/a&gt; under certain circumstances. That discussion is in regard to answer chaining questions, but (in my opinion) can apply to Cops and Robbers challenges as well.&lt;/p&gt;&#xA;&lt;p&gt;Overall, I see three potential options:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Repost The Programming Language Quiz with the same task&lt;/li&gt;&#xA;&lt;li&gt;Repost The Programming Language Quiz with a different, similarly trivial task.&lt;/li&gt;&#xA;&lt;li&gt;Don't repost The Programming Language Quiz&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Of course, answers aren't limited to these three options; if you believe you have another idea, feel free to post it!&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="68942" LastEditDate="2021-05-10T20:40:41.163" LastActivityDate="2021-05-10T20:40:41.163" Title="Can we revive The Programming Language Quiz?" Tags="|discussion|status-completed|duplicates|challenges|reposting|" AnswerCount="1" CommentCount="17" ContentLicense="CC BY-SA 4.0" />
  <row Id="14273" PostTypeId="2" ParentId="2140" CreationDate="2017-11-26T14:34:42.563" Score="2" Body="&lt;h1&gt;Inside or Outside?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polygon&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polygon&amp;#39;&quot; rel=&quot;tag&quot;&gt;polygon&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a point and a polygonial loop that is not self intersecting, determine whether the point is strictly inside or outside of the loop.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The polygon is given as an ordered list of points cartesian coordinates.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The single point is given as a separate input, but you can also say that is e.g. always the first or always the last point in the list.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;We only consider points with integral coordinates.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can choose whatever representation is easiest to work with for you for instance a list of pairs, or two separate list for the x- and y-coordinates etc.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The list describes the polygon in positive orientation, that means the inside is always on the left side if you follow the points from the beginning to the end of the list. (You may choose to use the opposite orientation but please indicate if you do.)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A point is considered to be strictly on the inside, if it is not contained in the border of the polygon.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;[(0,0),(0,2),(2,2),(2,0)]: (1,1) is strictly inside, all other points are outside&#xA;[(0,0),(0,2),(2,0)]: no point is strictly inside&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;more coming soon...&lt;/p&gt;&#xA;&lt;h1&gt;Meta:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should I relax the &lt;em&gt;strictly inside&lt;/em&gt; to just &lt;em&gt;inside&lt;/em&gt; (i.e. a point on the border is also considered as inside)&lt;/li&gt;&#xA;&lt;li&gt;Should I let the participants choose which version they prefer?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-11-26T14:49:10.667" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14275" PostTypeId="2" ParentId="2447" CreationDate="2017-11-27T01:01:48.753" Score="26" Body="&lt;h1&gt;Functions may return their result in an optional type wrapper&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14199/61384&quot;&gt;Relevant meta discussion&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By &quot;optional type wrapper&quot; I mean something like &lt;code&gt;Maybe a&lt;/code&gt; in Haskell, &lt;code&gt;Option&amp;lt;T&amp;gt;&lt;/code&gt; in Rust, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The consensus was that this should be allowed because it functions like a singleton wrapper, or like a possibly-erroring function that never actually errors.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastActivityDate="2017-11-27T01:01:48.753" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14276" PostTypeId="2" ParentId="14272" CreationDate="2017-11-27T07:27:09.923" Score="34" Body="&lt;h1&gt;Revive it, with a different task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I would enjoy a Programming Language Quiz Mark II. To keep things interesting, the task should be different.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I suggest a task involving &lt;strong&gt;simple integer math&lt;/strong&gt;, which will 1) allow languages to compete that don't have good string support, and 2) prevent another flood of &lt;a href=&quot;https://codegolf.stackexchange.com/a/55248/16766&quot;&gt;unintended Foo cracks&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my opinion, it would be best to choose a task that &lt;strong&gt;doesn't involve user input&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's much easier to check the correctness of a solution to a fixed-output problem. Taking input requires verifying multiple test cases.&lt;/li&gt;&#xA;&lt;li&gt;Input methods and formats vary between languages. If the task required input, we would have two options:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Require a specific input format. Inevitably, this would prevent some languages from participating.&lt;/li&gt;&#xA;&lt;li&gt;Allow a variety of input formats. Each submission would have to specify what format it uses. This clutters the submission and might make it easier to guess the language.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;Some esolangs can't input decimal numbers, or have trouble with numbers over 255, or don't have input at all.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="16766" LastEditDate="2017-11-28T04:04:11.507" LastActivityDate="2017-11-28T04:04:11.507" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="14280" PostTypeId="2" ParentId="2140" CreationDate="2017-11-27T19:00:06.150" Score="0" Body="&lt;h1&gt;DNA Quine&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Problem Description&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Design a quine that outputs its own source code, but encoded into amino acids.&lt;br&gt;&#xA;Read your source code in as binary. &#xA;Each pair of bits now maps to a nucleotide like so: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;00 -&amp;gt; A&#xA;01 -&amp;gt; C&#xA;10 -&amp;gt; G&#xA;11 -&amp;gt; T&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For example, the ASCII character &lt;code&gt;N&lt;/code&gt; has a binary representation of &lt;code&gt;01001110&lt;/code&gt;, so it would produce the nucleotide sequence &lt;code&gt;CATG&lt;/code&gt;. &#xA;A set of three nucleotides produces an amino acid. You can find the charts online, and I can't access imgur, so... yeah.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anyways, your program must output its own source code as the three letter amino acid names. For example, if your code were &lt;code&gt;013201323300&lt;/code&gt; in base 4, its nucleotide representation would be &lt;code&gt;ACTGACTGTTAA&lt;/code&gt; and its amino acid representation would be &lt;code&gt;ThrAspCysSTP&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program must output its representation in amino acids. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Further Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;All quines must also be valid proteins themselves. This means that: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The quine has a number of nucleotides divisible by three &lt;/li&gt;&#xA;&lt;li&gt;The last three nucleotides are either &lt;code&gt;TAG&lt;/code&gt;, &lt;code&gt;TAA&lt;/code&gt;, or &lt;code&gt;TGA&lt;/code&gt;, corresponding to a &lt;code&gt;STP&lt;/code&gt; codon&lt;/li&gt;&#xA;&lt;li&gt;No &lt;code&gt;STP&lt;/code&gt; codons appear anywhere but the end of the quine.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Apart from that, the standard rules apply. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is code golf, so the shortest code wins. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Notes/Questions for Sandboxing&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Ok, so I get that it's rather short. Is my point clear? Is the scoring section clear? How about loopholes? Should I point out that printing a single &lt;code&gt;STP&lt;/code&gt; is not allowed? Would that even be possible?&lt;/p&gt;&#xA;" OwnerUserId="76093" LastEditorUserId="76093" LastEditDate="2017-11-28T01:26:16.050" LastActivityDate="2017-11-28T01:26:16.050" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="14281" PostTypeId="1" CreationDate="2017-11-27T20:35:04.650" Score="18" ViewCount="418" Body="&lt;p&gt;In Haskell it is possible to define functions that will cause a compiler error unless they are called elsewhere in the program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example the following code causes a compiler error&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-hs prettyprint-override&quot;&gt;&lt;code&gt;r=sum.map(read.(:[])).show&#xA;main=putStr&quot;&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##y0gszk7Nyfn/v8i2uDRXLzexQKMoNTFFT8MqOlZTU684I7@cKzcxM8@2oLQkuKRISen/fwA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Haskell – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;while the extremely similar&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-hs prettyprint-override&quot;&gt;&lt;code&gt;r=sum.map(read.(:[])).show&#xA;main=print$r 6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##y0gszk7Nyfn/v8i2uDRXLzexQKMoNTFFT8MqOlZTU684I7@cKzcxM8@2oCgzr0SlSMHs/38A&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Haskell – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;has no error.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The reason this occurs is the Haskell compiler fails to find the type signature of the first bit of code because of multiple instances of &lt;code&gt;show&lt;/code&gt;, however once you call it on a &lt;code&gt;Num&lt;/code&gt; elsewhere the compiler can figure out which instance of &lt;code&gt;show&lt;/code&gt; you mean.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question is, should this type of function, that is functions that need to be called in order to work be considered valid entries to challenges that require a function?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-12-07T21:28:32.943" Title="Are functions that only work when called valid as answers?" Tags="|discussion|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14283" PostTypeId="2" ParentId="14281" CreationDate="2017-11-27T20:57:57.493" Score="34" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your code only has to handle the case where it is called properly. You don't need handle cases where the input is something outside the bounds of the challenge, and the case where your code isn't used at all is no exception. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;A challenge generally asks for a given behavior &lt;em&gt;when the function is called&lt;/em&gt;, and doesn't care about any other possibility.&lt;/p&gt;&#xA;" OwnerUserId="60042" LastActivityDate="2017-11-27T20:57:57.493" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14285" PostTypeId="2" ParentId="2140" CreationDate="2017-11-28T21:22:36.737" Score="1" Body="&lt;h1&gt;Different tasks, same characters, &lt;a href=&quot;https://codegolf.stackexchange.com/q/106125/31516&quot;&gt;level 2&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you need to solve 3 different tasks using the same set of characters. You can rearrange the characters, but you can't add or remove characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner will be the submission that solves all tasks using the smallest number of characters. All tasks must be solved in the same language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that it's the smallest number of characters, not the smallest number of unique characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Twist: If one or more characters can be removed from a script without breaking it, then your submission is disqualified.&lt;/strong&gt; This means that comments are out of the picture, as well as long variable names to get the character counts to match up.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You do not have to &lt;em&gt;prove&lt;/em&gt; that it's impossible to remove characters and still have a functioning script, but you should try to make it impossible. If nobody bothers to look at it, then your submission is valid. If nobody sees a way to remove one or more characters, then your submission is valid. If however, someone looks at your post and sees something that can be removed without breaking it, then your submission is invalid.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Tasks:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'll create 3 tasks that are fairly simple typical code-golf tasks.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;So, what do you think about the idea?&lt;/p&gt;&#xA;" OwnerUserId="31516" LastEditorUserId="31516" LastEditDate="2018-01-24T12:00:06.287" LastActivityDate="2018-01-24T12:00:06.287" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="14287" PostTypeId="2" ParentId="8474" CreationDate="2017-11-29T05:55:42.353" Score="5" Body="&lt;h1&gt;Feature Request: Port this to become PPCG Challenge Viewer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I was thinking, this works great with the sandbox, but why not make it into a challenge viewer? I've heard some chit chat about making an app for PPCG, but this would be a good experience for desktop users. Maybe an auto code golf sorter? Any input on this would be great.&lt;/p&gt;&#xA;" OwnerUserId="46066" LastActivityDate="2017-11-29T05:55:42.353" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14291" PostTypeId="2" ParentId="2140" CreationDate="2017-11-29T15:34:20.500" Score="2" Body="&lt;h1&gt;(No title currently)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a &lt;a href=&quot;https://simple.wikipedia.org/wiki/Natural_number&quot; rel=&quot;nofollow noreferrer&quot;&gt;natural number&lt;/a&gt; &lt;strong&gt;N&lt;/strong&gt; and a natural number &lt;strong&gt;K&lt;/strong&gt;, find a list of natural numbers &lt;strong&gt;L&lt;/strong&gt; such that:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The product of the elements of &lt;strong&gt;L&lt;/strong&gt; is &lt;strong&gt;N&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Each member of &lt;strong&gt;L&lt;/strong&gt; is less than or equal to &lt;strong&gt;K&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;And the length of &lt;strong&gt;L&lt;/strong&gt; is minimized.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;(You can return these numbers in any order.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If no such list exists, you program may do anything besides yielding a valid list, including but not limited to:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Printing something to stderr&lt;/li&gt;&#xA;&lt;li&gt;Yielding an empty list&lt;/li&gt;&#xA;&lt;li&gt;Yielding a non-list (see below)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If outputting to stdout, you can output a list in any reasonable fashion, such as:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Comma-separated: &lt;code&gt;3, 5, 7&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;With brackets: &lt;code&gt;[3, 5, 7]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Whitespace-separated: &lt;code&gt;3 5 7&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Your native list representation (&lt;code&gt;3`4`5&lt;/code&gt; or &lt;code&gt;3 4,5,&lt;/code&gt;, etc.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases (examples)&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;N, K -&amp;gt; L&#xA;&#xA;32, 2 -&amp;gt; [2, 2, 2, 2, 2]&#xA;50, 10 -&amp;gt; [5, 10]&#xA;1224, 99 -&amp;gt; [72, 17] or [24, 51]&#xA;5, 10 -&amp;gt; [5]&#xA;1337, 100 -&amp;gt; []                         (since 1337 = 7 * 191)&#xA;1337, 191 -&amp;gt; [7, 191]&#xA;42, 8 -&amp;gt; [6, 7]&#xA;42, 21 -&amp;gt; [2, 21] or [3, 14] or [6, 7]&#xA;1, 2 -&amp;gt; [1]                             (NOT the empty list)&#xA;36, 6 -&amp;gt; [6, 6]&#xA;36, 9 -&amp;gt; [4, 9]&#xA;36, 12 -&amp;gt; [4, 9] or [3, 12]&#xA;32, 64 -&amp;gt; [32]&#xA;432, 9 -&amp;gt; [6, 8, 9]                     (NOT [2, 6, 6, 6])&#xA;216, 8 -&amp;gt; [6, 6, 6]                     (NOT [8, 3, 3, 3])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="31957" LastEditDate="2017-12-02T02:19:24.497" LastActivityDate="2017-12-02T02:19:24.497" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="14292" PostTypeId="2" ParentId="2140" CreationDate="2017-11-29T16:17:32.920" Score="-3" Body="&lt;h1&gt;Shortest code to draw a png from stdin&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Rules :&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You’re free to use any image library you want as long as the image library is designed in the same language as your answer.&lt;/li&gt;&#xA;&lt;li&gt;The image should be displayed in an Xorg or wayland window or a console framebuffer.&lt;br&gt;&#xA;If you’re displaying to a window, you don’t need to create any windows control &lt;em&gt;(in that case the programs ends with CTRL+C)&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The stdin stream doesn’t eof. so the only way to get the image size is to parse png data. Once the image had been displayed, /dev/stdin should be closed.&lt;/li&gt;&#xA;&lt;li&gt;Your answer shouldn’t crash on random data.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The answer using the fewest bytes wins !&lt;/p&gt;&#xA;" OwnerUserId="50239" LastEditorUserId="50239" LastEditDate="2017-11-29T16:47:46.107" LastActivityDate="2017-11-29T16:47:46.107" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="14299" PostTypeId="2" ParentId="2140" CreationDate="2017-11-30T19:28:51.857" Score="0" Body="&lt;h1&gt;Information Masking&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Email Address Masking:  &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Only show the first and last characters of the username components of an email address, along with email domain name. Include 5 stars in the middle of the username to mask the length. The username part of the email address may use any of the ASCII characters listed below.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Uppercase and lowercase English letters (a-z, A-Z)&lt;/li&gt;&#xA;&lt;li&gt;Digits 0 to 9&lt;/li&gt;&#xA;&lt;li&gt;Characters ! # $ % &amp;amp; ' * + - / = ? ^ _ { | } ~&lt;/li&gt;&#xA;&lt;li&gt;Character . (dit, period, full stop) provided that it is not the first or last character, and provided also that it does not appear two or more times consecutively.  &lt;/li&gt;&#xA;&lt;li&gt;It is provided that email should end with &lt;code&gt;@domainName.com&lt;/code&gt;, where the domain name has only alphabetic characters.&lt;/li&gt;&#xA;&lt;li&gt;It is provided that email address username part have at least 2 characters not starting and ending with a special character.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;JackAndJill@gmail.com --&amp;gt; j*****l@gmail.com&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Phone number masking:&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Mask all the digits in a phone number except the last 4 digits. Each number should be replaced by star(*). Input phone numbers can be with or without the country code. Input Phone numbers can only have +, (, ), - in them along with numbers and spaces. Make sure + is not masked in the output and make sure the number of stars is equal to the number of digits while masking.Phone numbers will always have 10 digits without country code and with the country code, they could be up to 13 digits.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Example1: +1 (333) 444-5678  --&amp;gt; +*-***-***-5678  &#xA;Example2: +91 (333) 444-5678 -&amp;gt;  +**-***-***-5678  &#xA;Example3: 333 444 5678 --&amp;gt; ***-***-5678  &#xA;Example4: (333) 444-5678 ---&amp;gt; ***-***-5678&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Program input will start with E: for email and P: for phone numbers, ignore spaces if they are found in the input.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Complete Program Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;E: jackAndJill@gmail.com  &#xA;P: +13334445678&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;E: j*****l@gmail.com  &#xA;P: +*-***-***-5678&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="75494" LastEditorUserId="75494" LastEditDate="2017-12-03T06:45:29.677" LastActivityDate="2017-12-03T06:45:29.677" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="14303" PostTypeId="2" ParentId="2140" CreationDate="2017-12-01T03:45:20.403" Score="1" Body="&lt;h1&gt;Squaring the circle&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a generalization of &lt;a href=&quot;https://puzzling.stackexchange.com/questions/57441/another-loop-of-integers-with-consecutive-terms-adding-to-a-square&quot;&gt;this question&lt;/a&gt; on puzzling.SE. Essentially, it asks you to generate a circular array of integers such that any two adjacent integers add to a perfect square, and that the integers are a permutation of those from 1 to 50. The original question gave you a part of the array, and asked you to solve it. I wish to generalize this problem.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Problem Description&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an integer &lt;code&gt;n&lt;/code&gt;, generate a circular array of numbers from 1 to &lt;code&gt;n&lt;/code&gt; such that any two adjacent integers sum to a perfect square, without repeats of any number. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input is limited to positive integers greater than or equal to two.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If there is no possible array (as can be manually proven to be the case for &lt;code&gt;n=4&lt;/code&gt;), then your function should gracefully handle the error and exit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Otherwise, it should output a representation of that array for that &lt;code&gt;n&lt;/code&gt; as a string of delimited integers, such that, if the string were concatenated into a long integer, it would be the minimum possible string.&#xA;To illustrate:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3 &#xA;1 3 2&#xA;2 1 3&#xA;2 3 1&#xA;3 1 2&#xA;3 2 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Of these six representations, only &lt;code&gt;1 2 3&lt;/code&gt; is in minimal form. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may delimit your string in any consistent, parsable way you choose. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example I/O&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For &lt;code&gt;n&amp;lt;32&lt;/code&gt;, there are no valid arrays (And I can prove it, if necessary.) The smallest &lt;code&gt;n&lt;/code&gt; with a valid array is &lt;code&gt;n=32&lt;/code&gt;, and it is structured: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;=&amp;gt;01 08 28 21 04 32 17 19&#xA;15                       30&#xA;10                       06&#xA;26                       03&#xA;23                       13&#xA;02                       12&#xA;14                       24&#xA;22                       25&#xA;27                       11&#xA;  09 16 20 29 07 18 31 05&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The output to &lt;code&gt;n=32&lt;/code&gt;, would therefore be &lt;code&gt;1 8 28 21 4 32 17 19 30 6 3 13 12 24 25 11 5 31 18 7 29 20 16 9 27 22 14 2 23 26 10 15&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example code&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Because code is clearer than words, here's a (purposefully) very naive and inefficient  routine for this in Python (2.7):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import math, itertools&#xA;def main(n):&#xA;  def test_if_a_given_list_is_a_ring(input_list):&#xA;    is_a_square = lambda value: math.sqrt(value).is_integer()&#xA;    output_flag = True&#xA;    for index in range(len(input_list)):&#xA;      if is_a_square(input_list[index]+input_list[index-1]):&#xA;        continue&#xA;      else:&#xA;        output_flag = False&#xA;      #end if&#xA;    #end for&#xA;    return output_flag&#xA;  #end test_if_a_given_list_is_correct&#xA;  def turn_it_into_a_string(input_list):&#xA;    temp_list = []&#xA;    for i in input_list:&#xA;      temp_list.append(str(i))&#xA;    #end for&#xA;    output_string = ''&#xA;    for i in temp_list:&#xA;      output_list += ' '+ i&#xA;    #end for&#xA;    return output_list[1:]&#xA;  #end turn_it_into_a_string  &#xA; lowest = string(n)*n&#xA;&#xA; for perm in itertools.permutations(range(n,0,-1)):&#xA;    if test_if_a_given_list_is_correct(perm):&#xA;      flag = True&#xA;      for perm_character,lowest_character in zip(turn_it_into_a_string(perm),lowest):&#xA;        if int(lowest_character) &amp;lt; int(perm_character):&#xA;          flag = False&#xA;          break&#xA;        #end if&#xA;      #end for&#xA;      if flag:&#xA;        lowest = turn_it_into_a_string(perm)&#xA;      #end if&#xA;    #end if&#xA;  #end for&#xA;  return lowest&#xA;#end main&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If you're gonna golf this code... I'd &lt;em&gt;highly&lt;/em&gt; recommend optimizing it first. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Programs will be scored based on:&#xA;1. Asymptotic complexity&#xA;2. Average runtime&#xA;3. Byte count&#xA;4. Runtime when the byte count is fed into the program as input&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I can't decide which of these scoring systems to use. Note that I've manually worked out that when n&amp;lt;=31, there are no arrays. At n=31, there is a valid double loop system, but no valid single loops.)&lt;/p&gt;&#xA;" OwnerUserId="76093" LastEditorUserId="76093" LastEditDate="2017-12-01T21:42:03.323" LastActivityDate="2017-12-01T21:42:03.323" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="14304" PostTypeId="2" ParentId="2140" CreationDate="2017-12-01T03:58:13.720" Score="0" Body="&lt;h2&gt;Find and execute a program from the internet &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You have some task to do, but you are too lazy to do it yourself. Your also to lazy to make a program to do it. So you are going to make a program that finds a program to do the task you want.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Select a programming language Q (which must be Turing complete).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program will:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Take an input task, as a string, and input, as a string.&lt;/li&gt;&#xA;&lt;li&gt;Search codegolf.stackexchange.com, using the input string as the query&lt;/li&gt;&#xA;&lt;li&gt;Select the first question in the search results with an answer which contains a valid Q program. (If there is no such question, the operation of your program may be undefined.) (You may assume that program is in a code block.)&lt;/li&gt;&#xA;&lt;li&gt;Select either the accepted answer if it contains a valid Q program, or the highest voted answer that contains a valid Q program.&lt;/li&gt;&#xA;&lt;li&gt;Execute the Q program that that answer contains, using the input from step 1.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Since you are lazy, you want your program to be the shortest program possible. So this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, shortest answer wins!&lt;/p&gt;&#xA;" OwnerUserId="16842" LastEditorUserId="16842" LastEditDate="2017-12-01T20:30:34.740" LastActivityDate="2017-12-01T20:30:34.740" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="14305" PostTypeId="2" ParentId="11408" CreationDate="2017-12-01T06:56:40.820" Score="11" Body="&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/68212/ppcg-v2&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/IzUvu.png&quot; alt=&quot;Help wanted to build PPCG v2&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="60042" LastActivityDate="2017-12-01T06:56:40.820" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14307" PostTypeId="2" ParentId="8856" CreationDate="2017-12-01T12:35:33.650" Score="-10" Body="&lt;h1&gt;In few words&lt;/h1&gt;&#xA;&lt;p&gt;The function + the compiler/interpreter has to handle/ return the correct result or, in case of error show error (or when error is find or when the result of computation is show) in all possible input the function can receive.&lt;/p&gt;&#xA;" OwnerDisplayName="user58988" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-12-01T12:35:33.650" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14308" PostTypeId="2" ParentId="2140" CreationDate="2017-12-01T16:45:57.627" Score="0" Body="&lt;h1&gt;Thou shall permute!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a string of upper and/or lower case letters and/or numbers (or list of characters if you want),&#xA; and a list of permutation cycles, compute every intermediate step of applying this permutation under the following rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The space to move letters around is one row above and one row below the input, with the same length available as the string length.&lt;/li&gt;&#xA;&lt;li&gt;In the beginning, top and bottom row are empty, and the middle row contains the whole string&lt;/li&gt;&#xA;&lt;li&gt;A character can only take the spot of another character, if that spot is empty &lt;/li&gt;&#xA;&lt;li&gt;There can only be at most one character in the top row and one in the bottom row at any time&lt;/li&gt;&#xA;&lt;li&gt;You can only move one character in one direction per state change.&#xA;Directions are: &#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Out of the middle top or down&lt;/li&gt;&#xA;&lt;li&gt;Left/Right (any number of steps at once)&lt;/li&gt;&#xA;&lt;li&gt;Into the middle&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Cyclic Permutations&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm assuming 0 based indexing.&#xA;A list of cyclic permutations looks like this (I'm assuming list of tuples, but I don't mind if you want something else, as long as it conveys the same idea):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[(0,2,3),(1,4)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This would mean that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;index 0 goes to index 2, index 2 goes to index 3, index 3 goes to index 0&lt;/li&gt;&#xA;&lt;li&gt;index 1 goes to index 4, index 4 goes to index 1&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm using the &lt;code&gt;-&lt;/code&gt;character to show available spots here, you may use a space or any character that can not be contained in the input string, such as &lt;code&gt;#&lt;/code&gt;or &lt;code&gt;$&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given the string &lt;code&gt;test&lt;/code&gt; and the cyclic permutations &lt;code&gt;[(0,2)(1,3)]&lt;/code&gt;, the steps would look as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;----&#xA;test  #Start state&#xA;----&#xA;&#xA;----&#xA;-est  # Move index 0 out &#xA;t---&#xA;&#xA;--s-  &#xA;-e-t  # Move index 2 to the other side&#xA;t---&#xA;&#xA;--s-&#xA;-e-t  # Move index 0 to where it needs to go&#xA;--t-&#xA;&#xA;--s-&#xA;-ett  # Insert index 0 at index 2&#xA;----&#xA;&#xA;s---&#xA;-ett  # Move index 2 to where it needs to go&#xA;----&#xA;&#xA;----&#xA;sett  # Insert index 2 at index 0&#xA;----&#xA;&#xA;----&#xA;s-tt  # Move index 1 out&#xA;-e--&#xA;&#xA;---t&#xA;s-t-  # Move index 3 out&#xA;-e--&#xA;&#xA;---t&#xA;s-t-  # Move index 1 to index 3&#xA;---e&#xA;&#xA;---t&#xA;s-te  # Insert index 1 at index 3&#xA;----&#xA;&#xA;-t--&#xA;s-te  # Move index 3 to index 1&#xA;----&#xA;&#xA;----&#xA;stte # Insert index 3 at index 1. Done.&#xA;----&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here is the same example again, but this time using only one long permutation of all characters: &lt;code&gt;[(0,2,1,3)]&lt;/code&gt; instead of 2 independent permutations:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;----&#xA;test&#xA;----&#xA;&#xA;----&#xA;-est&#xA;t---&#xA;&#xA;--s-&#xA;-e-t&#xA;t---&#xA;&#xA;--s-&#xA;-e-t&#xA;--t-&#xA;&#xA;--s-&#xA;-ett&#xA;----&#xA;&#xA;--s-&#xA;--tt&#xA;-e--&#xA;&#xA;-s--&#xA;--tt&#xA;-e--&#xA;&#xA;----&#xA;-stt&#xA;-e--&#xA;&#xA;---t&#xA;-st-&#xA;-e--&#xA;&#xA;---t&#xA;-st-&#xA;---e&#xA;&#xA;---t&#xA;-ste&#xA;----&#xA;&#xA;t---&#xA;-ste&#xA;----&#xA;&#xA;----&#xA;tste&#xA;----&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You will only receive valid cyclic permutations&lt;/li&gt;&#xA;&lt;li&gt;Please indicate if you want 0 or 1 indexed permutations, either is fine&lt;/li&gt;&#xA;&lt;li&gt;You will only receive valid strings up to length 10&lt;/li&gt;&#xA;&lt;li&gt;Characters in the string are &lt;strong&gt;not&lt;/strong&gt; guaranteed to be unique&lt;/li&gt;&#xA;&lt;li&gt;it does not matter which order every permutation is processed as long as they're all processed (that means start and end states are the same, and the above rules are always fulfilled)&lt;/li&gt;&#xA;&lt;li&gt;There will be at least one permutation in the list of permutations&lt;/li&gt;&#xA;&lt;li&gt;All permutations in the list of permutations have at least length 2&lt;/li&gt;&#xA;&lt;li&gt;The maximal length of one permutation is the length of the input string&lt;/li&gt;&#xA;&lt;li&gt;There may be some indices that are not part of any permutation&lt;/li&gt;&#xA;&lt;li&gt;No index is part of more than one permutation&lt;/li&gt;&#xA;&lt;li&gt;You need to output the first step, the last step and all intermediate steps&lt;/li&gt;&#xA;&lt;li&gt;You may have as many trailing newlines and spaces as you want&lt;/li&gt;&#xA;&lt;li&gt;You may output a 2 dimensional array or anything equivalent instead of printing every step, or you can also return a list of all states in the end&lt;/li&gt;&#xA;&lt;li&gt;You can also generate an animation if you like instead of printing sequentially&lt;/li&gt;&#xA;&lt;li&gt;Lowest number of bytes wins&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are forbidden&lt;/li&gt;&#xA;&lt;li&gt;You can write a full program or function&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I implemented a very un-golfed version in python3 &lt;a href=&quot;https://repl.it/repls/ShadyPlumHoneycreeper&quot; rel=&quot;nofollow noreferrer&quot;&gt;here (redirects to repl.it)&lt;/a&gt;.&#xA;That code contains 2 functions. &#xA;&lt;code&gt;find_cycles&lt;/code&gt; takes a string and a permutation of that string and computes the cycles to go from one to the other.&#xA;&lt;code&gt;shuffle&lt;/code&gt; does the shuffling. It takes the start string and the cycles.&#xA;You can use these functions to validate your program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutation&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutation&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="64470" LastActivityDate="2017-12-01T16:45:57.627" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14309" PostTypeId="2" ParentId="2140" CreationDate="2017-12-01T18:52:19.480" Score="1" Body="&lt;h2&gt;Advancing k-combinations&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Combination#Number_of_k-combinations&quot; rel=&quot;nofollow noreferrer&quot;&gt;k-combinations for a set of size n&lt;/a&gt; represent in what different ways one can pick &lt;code&gt;k&lt;/code&gt; elements out of a set of &lt;code&gt;n&lt;/code&gt; elements. There is a natural representation of such a pick as an integer with &lt;code&gt;n&lt;/code&gt; bits, of which exactly &lt;code&gt;k&lt;/code&gt; are set.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Define &lt;code&gt;next[n, k] :: Pick(n, k) -&amp;gt; Pick(n, k)&lt;/code&gt; to be the group action that takes each pick to the next one, wrapping around. More formally: Let &lt;code&gt;r&lt;/code&gt; be an &lt;code&gt;n&lt;/code&gt;-bit integer with &lt;code&gt;k&lt;/code&gt; bits set. Then &lt;code&gt;next[n, k](r)&lt;/code&gt; will return the smallest integer &lt;code&gt;&amp;gt; r&lt;/code&gt; that also has &lt;code&gt;k&lt;/code&gt; bits set. If there exists no such integer, the smallest integer with &lt;code&gt;k&lt;/code&gt; bits is returned. Example: &lt;code&gt;next[4, 2](0b0011) = 0b0101&lt;/code&gt;, &lt;code&gt;next[4, 2](0b1100) = 0b0011&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[- Annotation: if &lt;code&gt;k = 0&lt;/code&gt;, then there is only one unique integer with zero bits set. &lt;code&gt;next[n, 0](r) = 0&lt;/code&gt;. -]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will be given a pick &lt;code&gt;r&lt;/code&gt; and a positive integer &lt;code&gt;step&lt;/code&gt;. Output &lt;code&gt;(next[n, k]^step)(r)&lt;/code&gt;, that is, apply &lt;code&gt;next[n, k]&lt;/code&gt; &lt;code&gt;step&lt;/code&gt; times to &lt;code&gt;r&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You will be given 4 integers &lt;code&gt;n k r step&lt;/code&gt;. Output &lt;code&gt;(next[n, k]^step)(r)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1 &amp;lt;= n&lt;/code&gt; can be assumed to be small enough to represent picks as integers naturally in your language&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;0 &amp;lt;= k &amp;lt;= n&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;r&lt;/code&gt; will always be a valid pick of &lt;code&gt;k&lt;/code&gt; out of &lt;code&gt;n&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;0 &amp;lt;= step &amp;lt;= C(n, k)&lt;/code&gt; can be relatively large. As an example, &lt;code&gt;C(32, 12) = 225,792,840&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Criteria&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Return the correct output for all valid inputs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, shortest code wins.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4   2 0b1001 2  =&amp;gt; 0b1100&#xA;16 10 0xF11F 10 =&amp;gt; 0bF15E&#xA;4   2 0b1100 2  =&amp;gt; 0b0101&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="18942" LastEditorUserId="18942" LastEditDate="2017-12-03T14:56:27.530" LastActivityDate="2017-12-03T14:56:27.530" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14314" PostTypeId="2" ParentId="11408" CreationDate="2017-12-03T04:46:06.853" Score="23" Body="&lt;p&gt;&lt;a href=&quot;https://github.com/abrudz/lb/blob/master/README.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/PT2I9.png&quot; alt=&quot;Bookmarklet — no install needed!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2017-12-04T01:04:13.433" LastActivityDate="2017-12-04T01:04:13.433" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14316" PostTypeId="1" CreationDate="2017-12-04T05:50:26.057" Score="5" ViewCount="150" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges#comment51747_14298&quot;&gt;A comment in the Sandbox&lt;/a&gt; prompted me to start this discussion - should we create &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/dice&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;dice&amp;#39;&quot; rel=&quot;tag&quot;&gt;dice&lt;/a&gt; and tag dice-related questions?&lt;/p&gt;&#xA;&lt;h2&gt;Information&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;From a &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=dice+is%3Aq+closed%3Ano&quot;&gt;simple search&lt;/a&gt;, I see 43 challenges related to dice (plus at least 2 challenges active in the Sandbox) right now&lt;/li&gt;&#xA;&lt;li&gt;There would be some overlap between &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/dice&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;dice&amp;#39;&quot; rel=&quot;tag&quot;&gt;dice&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/dice&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;dice&amp;#39;&quot; rel=&quot;tag&quot;&gt;dice&lt;/a&gt; would likely end up being a more specific version of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-12-12T08:51:56.687" Title="Should we have a tag for dice-related challenges?" Tags="|discussion|tags|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14322" PostTypeId="2" ParentId="2447" CreationDate="2017-12-04T21:49:33.217" Score="-4" Body="&lt;h1&gt;Languages that cannot obtain world-state-sensitive information can accept the information as an additional input&lt;/h1&gt;&#xA;&lt;p&gt;Some challenges may require the use of the current time, cryptographic random values, or other information present on the system used to run the program. Additionally, many languages (for various reasons) lack the ability to access this information, and thus compete at all.&lt;/p&gt;&#xA;&lt;p&gt;To overcome this, answers may accept such information as additional input &lt;em&gt;in a minimally processed format&lt;/em&gt; (eg: unix timestamp instead of a date string, a single random value instead of a random generator function).&lt;/p&gt;&#xA;" OwnerUserId="18730" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-12-04T21:49:33.217" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="14323" PostTypeId="1" CreationDate="2017-12-05T01:53:11.103" Score="8" ViewCount="148" Body="&lt;p&gt;As some of you may already know, there is currently a challenge series called the Advent Challenge series, posted entirely by me (so far).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The purpose of this meta question is to determine whether or not posting a link list would be on-topic for posting to meta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, I would post a brief description of the challenge series and then a list of links for all of the challenges in the series.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An alternative would be to post the link description in the first challenge of the series. The reason I prefer this option is because the alternative would require editing the main post every time I post a new one which requires two challenge &quot;bumps&quot; each day (or however often I post).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, what would be the best idea?&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2017-12-11T14:11:00.410" Title="Challenge Links for Challenge Series: On-Topic for PPCG?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14327" PostTypeId="2" ParentId="2447" CreationDate="2017-12-05T19:17:30.487" Score="1" Body="&lt;h1&gt;Functions may output by setting the default variable(s)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Perl has a &quot;default&quot; scalar &lt;code&gt;$_&lt;/code&gt;. Unless specifically &lt;em&gt;overridden&lt;/em&gt; by the &lt;code&gt;=~&lt;/code&gt; operator, regular expressions and such will operate on this variable. It also has &lt;code&gt;@_&lt;/code&gt;, the &quot;default&quot; array, and &lt;code&gt;%_&lt;/code&gt;, the &quot;default&quot; hash.&lt;/p&gt;&#xA;" OwnerUserId="62402" LastActivityDate="2017-12-05T19:17:30.487" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14329" PostTypeId="1" AcceptedAnswerId="14330" CreationDate="2017-12-06T00:28:04.433" Score="15" ViewCount="418" Body="&lt;p&gt;Prompted by &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/41565758#41565758&quot;&gt;this&lt;/a&gt;. I'll speak about Dyalog APL here, but this could really apply to any language.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Background&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Dyalog APL has its own SBCS called &lt;code&gt;⎕AV&lt;/code&gt;. For backwards compatibility reasons Dyalog Ltd. is reluctant to change the character set. Lately, six new built-ins have been added to Dyalog APL and have been assigned the symbols &lt;code&gt;⊆&lt;/code&gt; &lt;code&gt;⍠&lt;/code&gt; &lt;code&gt;⍤&lt;/code&gt; &lt;code&gt;⌸&lt;/code&gt; &lt;code&gt;⌺&lt;/code&gt; &lt;code&gt;⍸&lt;/code&gt; for mnemonic reasons, however these characters are &lt;em&gt;not&lt;/em&gt; in &lt;code&gt;⎕AV&lt;/code&gt;. At the same time, &lt;code&gt;⎕AV&lt;/code&gt; contains 14 characters &lt;code&gt;ɫ&lt;/code&gt; &lt;code&gt;¥&lt;/code&gt; &lt;code&gt;£&lt;/code&gt; &lt;code&gt;¢&lt;/code&gt; &lt;code&gt;ý&lt;/code&gt; &lt;code&gt;·&lt;/code&gt; &lt;code&gt;€&lt;/code&gt; &lt;code&gt;´&lt;/code&gt; &lt;code&gt;∣&lt;/code&gt; &lt;code&gt;¶&lt;/code&gt; &lt;code&gt;¿&lt;/code&gt; &lt;code&gt;¡&lt;/code&gt; &lt;code&gt; &lt;/code&gt; &lt;code&gt;§&lt;/code&gt; which are neither built-ins, valid identifier characters, or ASCII, nor are they used when pretty printing structures. They are therefore highly unlikely to appear in Dyalog APL programs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It has been accepted that &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13111/43319&quot;&gt;&lt;em&gt;the only thing that matters is there must be an actual file with the claimed byte count that, when fed to your interpreter, runs the intended program. How you interpret the bytes (or bits) in that file as characters is entirely up to you, as is whether you internally or externally provide conversion methods between the unreadable binary file and the readable ASCII-only interpretation of the file.&lt;/em&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Let's say &lt;a href=&quot;https://github.com/abrudz/SBCS&quot; rel=&quot;nofollow noreferrer&quot;&gt;I provide a tool&lt;/a&gt; which packs a UTF-8 source file into a file using a SBCS more appropriately chosen than &lt;code&gt;⎕AV&lt;/code&gt;, and can also unpack such files.  Does this grant me the right to count Dyalog APL as one byte per character even when using the problematic six characters? Or would this constitute a &quot;new language&quot; and my posts using this would have to actually display the (unreadable) bytes?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does it matter that the user has to take a few simple steps to &quot;compile&quot; his (unreadable) &quot;source&quot;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would it help if I modified TIO's Dyalog APL wrapper so that it can actually run such files given an appropriate flag — even though it would in fact always run in &quot;UTF-8 mode&quot; when using the tio.run interface?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Speaking against this being acceptable is that then any code golf submission could just be zipped (being the wide availability of unzippers).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Speaking for this being acceptable is that while Jelly has a wrapper which can translate Jelly-encoded files to UTF-8 before running, TIO actually always uses the UTF-8 mode, as the Jelly source says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This option should be considered the default,&#xA;                                but it exists solely for scoring purposes in&#xA;                                code golf contests.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="46271" LastEditDate="2017-12-06T02:05:50.150" LastActivityDate="2023-12-28T04:29:48.273" Title="Is a transliteration tool enough to grant count as SBCS?" Tags="|discussion|policy|code-golf|answers|scoring|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14330" PostTypeId="2" ParentId="14329" CreationDate="2017-12-06T03:26:38.497" Score="15" Body="&lt;h2&gt;Yes, it is valid&lt;/h2&gt;&#xA;&lt;p&gt;Consider C. In order to run a C program, it is first passed through a compiler (like &lt;code&gt;gcc&lt;/code&gt; or &lt;code&gt;clang&lt;/code&gt;), then a linker (like &lt;code&gt;ld&lt;/code&gt; or &lt;code&gt;gold&lt;/code&gt;), and then the resulting executable is run. We have no problem with this (but we require the compiler to be specified, since different compilers implement the language differently, and thus by our rules they implement different languages).&lt;/p&gt;&#xA;&lt;p&gt;Thus, passing a SBCS-encoded program through a decoder, and passing that output to the actual compiler/interpreter/whatever, is also valid. It's simply another compilation step.&lt;/p&gt;&#xA;&lt;h2&gt;However...&lt;/h2&gt;&#xA;&lt;p&gt;Use of such a transliteration needs to be &lt;strong&gt;clearly mentioned&lt;/strong&gt; in any answers, to distinguish them from answers which do not make use of the tool. The tool plus the compiler/interpreter/whatever form a different language by our rules (since the implementation defines the language), and so such answers need to be clearly distinguished.&lt;/p&gt;&#xA;&lt;p&gt;One would not argue that &lt;a href=&quot;https://github.com/ETHproductions/japt&quot; rel=&quot;nofollow noreferrer&quot;&gt;Japt&lt;/a&gt; is not a programming language. One would also not argue that it is the same language as JavaScript (despite transpiling to JavaScript before being executed). The same logic applies for any transliteration tool.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="85334" LastEditDate="2023-12-28T04:29:48.273" LastActivityDate="2023-12-28T04:29:48.273" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="14331" PostTypeId="2" ParentId="14316" CreationDate="2017-12-06T13:50:46.893" Score="9" Body="&lt;h2&gt;No&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;1) There's no need to get this specific in our tagging, and&lt;br&gt;&#xA;2) As pointed out in the comments, there's a lot of overlap with either &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/topology&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;topology&amp;#39;&quot; rel=&quot;tag&quot;&gt;topology&lt;/a&gt;, and&lt;br&gt;&#xA;3) It doesn't necessarily have a useful quality that people would want to seek out (or avoid)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition, if we're looking strictly at numbers, there are &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=cards+is%3Aq+closed%3Ano&quot;&gt;almost 100&lt;/a&gt; &quot;cards&quot; questions, of which 59 &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=cards+-%5Bcard-games%5D+is%3Aq+closed%3Ano&quot;&gt;aren't tagged&lt;/a&gt; with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/card-games&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;card-games&amp;#39;&quot; rel=&quot;tag&quot;&gt;card-games&lt;/a&gt; -- but I don't think we need a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/card&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;card&amp;#39;&quot; rel=&quot;tag&quot;&gt;card&lt;/a&gt; tag for the same reason we don't need a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/dice&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;dice&amp;#39;&quot; rel=&quot;tag&quot;&gt;dice&lt;/a&gt; tag.&lt;/p&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="41024" LastEditDate="2017-12-06T19:37:55.550" LastActivityDate="2017-12-06T19:37:55.550" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14332" PostTypeId="2" ParentId="2140" CreationDate="2017-12-06T18:04:05.980" Score="1" Body="&lt;h1&gt;Simultaneous Selection&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In the game &lt;a href=&quot;https://riskofraingame.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Risk of Rain&lt;/a&gt; there is a game mode where you can select which items you want out of dropped boxes.  The only problem is that when you open two boxes at the same time your movements in one box effect your movements in another.  Now this can be a problem since you may want to retrieve a particular item from one of the boxes.  However there is a solution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since the boxes have different shapes and you are not permitted to move your cursor outside of the box you can desynchronize the two cursors.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example if we have the two boxes&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;S.F...    S.....&#xA;......    ...F..&#xA;....      .....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;F&lt;/code&gt; is the goal and &lt;code&gt;S&lt;/code&gt; is the starting location, we can get the cursor to the goal by moving the cursor&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Right 4 times&#xA;Down 3 times &#xA;Up 1 time&#xA;Left 1 time&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Still working on it ...&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As input you will receive two 2 dimensional boolean containers, representing the shapes of the boxes. In these boolean arrays &lt;code&gt;true&lt;/code&gt; means that square exists in the box &lt;code&gt;false&lt;/code&gt; means square does not exist.  You may assume that your input will be padded with false values such that no true values touches the edge of the array.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will also receive two coordinate pairs representing the start and end locations.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You should output a ordered container of &quot;moves&quot; such that when performed on both boxes the cursor will arrive at the end point.  A &quot;move&quot; may be one of 4 chosen values each representing one of the 4 cardinal directions. For example you might choose: &lt;code&gt;[N,S,E,W]&lt;/code&gt;, &lt;code&gt;[1,2,3,4]&lt;/code&gt; or &lt;code&gt;[(1,0),(0,1),(-1,0),(0,-1)]&lt;/code&gt;.  Your program must be self consistent in these values across multiple sessions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If no solution is possible for the given boxes you must output a value that is distinct from any possible sequence of moves, for example a list containing a 5th value that cannot represent a move, or a non list item.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Still working on it ...&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-12-17T05:38:04.213" LastActivityDate="2017-12-17T05:38:04.213" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14333" PostTypeId="2" ParentId="2140" CreationDate="2017-12-06T21:40:26.247" Score="1" Body="&lt;h1&gt;Best Yahtzee score&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Yahtzee is a game played with five six-sided dice and a score sheet with thirteen different boxes to fill a score in. Each box has its own scoring rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1s, 2s, 3s, 4s, 5s, 6s all score points equal to the sum of the respective dice (that is, a roll of [3, 2, 3, 1, 5] scored as 3s would be awarded 6 points - 3 for each 3).&lt;/li&gt;&#xA;&lt;li&gt;3-of-a-kind and 4-of-a-kind (as they sound, three or four dice rolled the same) score points equal to the sum of all five dice.&lt;/li&gt;&#xA;&lt;li&gt;Full house (two dice show one value, the other three show another) scores 25 points&lt;/li&gt;&#xA;&lt;li&gt;Small straight (four consecutive values) scores 30 points&lt;/li&gt;&#xA;&lt;li&gt;Large straight (all consecutive values) scores 40 points&lt;/li&gt;&#xA;&lt;li&gt;Yahtzee (all dice show the same value) scores 50 points&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The thirteenth (chance) makes sense in-game, but not so much for this challenge; additionally the game has bonuses for extra Yahtzees which make no sense here. Because the challenge is...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given five dice as input (five integers 1-6, input however is convenient), output the highest score that roll can score&lt;s&gt; as well as what box it's being score under&lt;/s&gt;. The score should be output as its decimal numeric value, whether that's an integer or a string representation thereof, whatever. It should be immediately recognizable as a number.&lt;s&gt; How you identify boxes is up to you so long as they are all unique and any given roll that will be scored in a given box always returns the same value. Please specify in your answer how boxes are identified. Order ([score, box] or [box, score]) does not matter. If you're outputting to STDOUT or otherwise not returning two values from a function, please separate score and box with at least one non-alphanumeric character of your choosing.&lt;/s&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code golf, so shortest answer in a given language wins. Standard loopholes apply. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test cases&lt;s&gt;, using &lt;code&gt;,&lt;/code&gt; as separator, and &lt;code&gt;123456kKfsly&lt;/code&gt; for the box names (respective of their order above)&lt;/s&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;in: 1 5 4 3 2&#xA;out: 40&#xA;in: 1 1 4 3 1&#xA;out: 10&#xA;in: 1 1 6 5 3&#xA;out: 6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sandbox/meta&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I saw one existing Yahtzee challenge, but IIRC it boiled down to scoring a whole game. I did the 'given five dice, what is the best score' exercise once and felt like there were some interesting challenges to be found in optimizing it.&lt;/li&gt;&#xA;&lt;li&gt;Better ways to express I/O? I want it to be flexible but relatively readable...&lt;/li&gt;&#xA;&lt;li&gt;My first potential submission, I'm sure I'm forgetting something...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="58230" LastEditorUserId="58230" LastEditDate="2017-12-07T14:42:11.683" LastActivityDate="2017-12-07T14:42:11.683" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14335" PostTypeId="2" ParentId="14281" CreationDate="2017-12-07T16:36:45.390" Score="1" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I've been told repeatedly that anonymous lambdas are valid answers in python, and they /can't/ be called outside of the statement containing them, and assignment to a variable (which makes them non-anonymous) or embeddedness in a print statement generally isn't counted towards the bytecount.  I think your case, where the function can be called or not, but must be called in order to compile, is very similar.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It looks like your function is equivalent to a template function in C++, which technically doesn't even exist unless it's invoked (the compiler produces code depending on the template arguments with which it's actually called), and I'd certainly allow something like that and not bar it on a technicality.&lt;/p&gt;&#xA;" OwnerUserId="76550" LastEditorUserId="76550" LastEditDate="2017-12-07T21:28:32.943" LastActivityDate="2017-12-07T21:28:32.943" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14336" PostTypeId="2" ParentId="2140" CreationDate="2017-12-07T19:50:05.413" Score="2" Body="&lt;h1&gt;Show a Chess Piece Range&lt;/h1&gt;&#xA;&lt;p&gt;Write a program or function that, given a set of movement rules, shows the available moves for a fairy chess piece.&lt;/p&gt;&#xA;&lt;h3&gt;Movement Rules:&lt;/h3&gt;&#xA;&lt;p&gt;This will use a slightly modified version of &lt;a href=&quot;https://en.wikipedia.org/wiki/Fairy_chess_piece#Parlett.27s_movement_notation&quot; rel=&quot;nofollow noreferrer&quot;&gt;Parlett's Movement Notation&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;p&gt;A number, 1, 2, etc. shows how far a piece can move in a given direction. &lt;strong&gt;n&lt;/strong&gt; indicates any distance, and two numbers separated by a hyphen (e.g. &amp;quot;1-4&amp;quot;) means that there is a range of distances that the piece can move. Ranges may be enclosed in parentheses.&lt;/p&gt;&#xA;&lt;p&gt;Numbers are followed by a direction sign:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;*&lt;/code&gt; - any direction, orthogonally or diagonally&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;+&lt;/code&gt; - orthogonally (forwards, backwards, sideways)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;X&lt;/code&gt; - diagonally&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;gt;&lt;/code&gt; - forwards&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;lt;&lt;/code&gt; - backwards&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;=&lt;/code&gt; - sideways&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;X&amp;gt;&lt;/code&gt; - diagonally forwards&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;X&amp;lt;&lt;/code&gt; - diagonally forwards&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;These directions can be combined, so &lt;code&gt;&amp;lt;&amp;gt;&lt;/code&gt; means forwards or backwards, &lt;code&gt;X=&lt;/code&gt; means diagonally or sideways, etc. Note that &lt;code&gt;&amp;gt;X&lt;/code&gt; means forwards or diagonally, and is different from &lt;code&gt;X&amp;gt;&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This gives us many of the standard chess pieces. For example, &lt;code&gt;1*&lt;/code&gt; is a King's movement, while &lt;code&gt;nX&lt;/code&gt; is a Bishop.&lt;/p&gt;&#xA;&lt;p&gt;There are also &amp;quot;grouping&amp;quot; indicators:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;/&lt;/code&gt; - two numbers (or ranges) separated by a slash indicates a &amp;quot;hippogonal&amp;quot; move, like a knight: &lt;code&gt;a/b&lt;/code&gt; means move &lt;code&gt;a&lt;/code&gt; spaces orthogonally, and &lt;code&gt;b&lt;/code&gt; spaces perpendicular to the first move. These may be enclosed in parentheses.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;amp;&lt;/code&gt; - repeated movement in the same direction&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;.&lt;/code&gt; - &amp;quot;then&amp;quot; - combines two distinct moves, one after another.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;,&lt;/code&gt; - &amp;quot;or&amp;quot; - separates two distinct moves. Only one may be taken on a turn.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The format of a move (not including grouping) is &lt;code&gt;&amp;lt;distance&amp;gt;&amp;lt;direction&amp;gt;&amp;lt;other&amp;gt;&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Input:&lt;/h3&gt;&#xA;&lt;p&gt;A string showing the movement rules.&lt;/p&gt;&#xA;&lt;h3&gt;Output:&lt;/h3&gt;&#xA;&lt;p&gt;An ASCII representation of an 8x8 chess board with the given piece on the d4 square, with all other accessible squares indicated. For example, given the input &lt;code&gt;n*&lt;/code&gt; (a queen), you should output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;...x...x&#xA;x..x..x.&#xA;.x.x.x..&#xA;..xxx...&#xA;xxx@xxxx&#xA;..xxx...&#xA;.x.x.x..&#xA;x..x..x.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The output may consist of any three distinct characters.&lt;/p&gt;&#xA;&lt;h3&gt;Examples and Test Cases&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input: (1/2)&#xA;Output:&#xA;.........&#xA;.........&#xA;..X.X....&#xA;.X...X...&#xA;...@.....&#xA;.X...X...&#xA;..X.X....&#xA;.........&#xA;&#xA;Input: 2*&#xA;Output:&#xA;.........&#xA;.........&#xA;.X.X.X...&#xA;.........&#xA;.X.@.X...&#xA;.........&#xA;.X.X.X...&#xA;.........&#xA;&#xA;Input: 2+.1+    (compare to the knight, above)&#xA;Output:&#xA;.........&#xA;...X.....&#xA;..X.X....&#xA;.X.X.X...&#xA;X.X@X.X..&#xA;.X.X.X...&#xA;..X.X....&#xA;...X.....&#xA;&#xA;Input: @1&amp;lt;X&amp;gt;,2-3&amp;gt;=&#xA;Output:&#xA;...X....&#xA;...X....&#xA;...X....&#xA;..X.X...&#xA;XX.@.XX.&#xA;...X....&#xA;........&#xA;........&#xA;&#xA;Input: 1+,2X&amp;amp;&#xA;Output:&#xA;.......X&#xA;........&#xA;.X...X..&#xA;...X....&#xA;..X@X...&#xA;...X....&#xA;.X...X..&#xA;........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; - shortest code for each language in bytes wins.&lt;/p&gt;&#xA;&lt;h1&gt;Notes/Questions:&lt;/h1&gt;&#xA;&lt;p&gt;I have also considered having the location of the piece be arbitrary, given by another input. Is this a good idea? Does it make the challenge more interesting, or just more complicated without much benefit?&lt;/p&gt;&#xA;" OwnerUserId="69481" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-12-16T19:43:45.737" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14337" PostTypeId="1" CreationDate="2017-12-07T20:49:08.513" Score="20" ViewCount="3901" Body="&lt;p&gt;Our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/274/41024&quot;&gt;standard policy&lt;/a&gt; regarding command-line flags states that one should count the space before the dash (&lt;code&gt;-&lt;/code&gt;) too, when there aren't any &quot;free&quot; options, since it doesn't exist in the shortest possible invocation. For example this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;language -option program.p&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is 8 bytes longer than the shortest possible invocation being:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;language program.p&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;However, in &lt;a href=&quot;https://tryitonline.net&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;, you don't include a space and instead click a button to add an argument. Also, you don't need to escape it either. This may apply to other online interpreters as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One could say that TIO is an implementation of a language, and therefore you can use flags at a lower cost. However, another opinion may be that it's just a front end and doesn't count as an implementation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So the question is, &lt;strong&gt;how should we handle a situation where a front end automatically handles command-line flags with less separators and escaping? Count just like if we use the underlying interpreter directly or not?&lt;/strong&gt;. Please note that this doesn't apply to &quot;free&quot; flags like Perl's &lt;code&gt;-e&lt;/code&gt;, which shouldn't be counted anyways. Also, this question isn't about the front end being an implementation of a language itself, apart from the interpreter used underneath (e.g. interpreter wrappers with special configuration).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This question was inspired by &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/41605125#41605125&quot;&gt;Οurous's doubt for what is being asked here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2023-05-18T18:58:40.510" Title="Command-line flags on front ends" Tags="|discussion|policy|answers|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14338" PostTypeId="2" ParentId="2140" CreationDate="2017-12-07T22:10:24.463" Score="4" Body="&lt;h1&gt;A Fine-Grained Mesh&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;If you've used Matlab before, it's highly likely that you've heard of &lt;code&gt;meshgrid&lt;/code&gt;.  It's a function that has since mostly been obsoleted by broadcasting, but it still has its uses sometimes.&lt;/p&gt;&#xA;&lt;p&gt;The function itself is relatively simple.  Given two vectors &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; of length &lt;code&gt;m&lt;/code&gt; and &lt;code&gt;n&lt;/code&gt;, create two 2-dimensional matrices &lt;code&gt;X&lt;/code&gt; and &lt;code&gt;Y&lt;/code&gt; both with &lt;code&gt;m&lt;/code&gt; columns and &lt;code&gt;n&lt;/code&gt; rows such that:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Any row of &lt;code&gt;X&lt;/code&gt; is a copy of &lt;code&gt;x&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Any column of &lt;code&gt;Y&lt;/code&gt; is a copy of &lt;code&gt;y&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;But typing out &lt;code&gt;meshgrid(x,y)&lt;/code&gt; takes so long, you know? I'd like to be more efficient with my coding. Your job is to reimplement this function in  the fewest bytes possible.&lt;/p&gt;&#xA;&lt;p&gt;Standard loopholes disallowed.&lt;/p&gt;&#xA;" OwnerUserId="55696" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-12-11T19:58:19.357" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14339" PostTypeId="2" ParentId="14337" CreationDate="2017-12-08T09:51:49.480" Score="57" Body="&lt;h2&gt;Let's solve the flag problem once and for all&lt;/h2&gt;&#xA;&lt;p&gt;Rather than dealing with inconsistent schemes for adding flags, let's just consider each separate invocation of a compiler/interpreter/whatever a separate implementation (and thus a separate language by our rules).&lt;/p&gt;&#xA;&lt;p&gt;This comes with many benefits:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The use of &amp;quot;cheating&amp;quot; flags is less useful, because using those flags means you're using a different language, and thus are competing only with those solutions who also use the same &amp;quot;cheating&amp;quot; flags.&lt;/li&gt;&#xA;&lt;li&gt;It is most consistent with our policy on implementations defining the language. If we view an implementation as a program that takes input and transforms it into output, then it is perfectly reasonable to consider each combination of flags as a different implementation, because the flags change how input is transformed into output - just as we would consider a different program to be a different implementation.&lt;/li&gt;&#xA;&lt;li&gt;Byte count would solely be dependent on the size of the code (barring other rules like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1072&quot;&gt;storing data in the filename&lt;/a&gt;). This is much more reasonable than having to consider how many extra bytes various flags cost by comparing each invocation to a &amp;quot;standard&amp;quot; invocation.&lt;/li&gt;&#xA;&lt;li&gt;This brings languages like C, where external libraries need to be specified on the command line (e.g. &lt;code&gt;-lncurses&lt;/code&gt;) in line with languages like Python, where external libraries don't need to be explicitly specified via command-line arguments (if the package is installed, you can import it). This removes an unnecessary penalty for languages without automatic library discovery (and other similar features of which the absence necessitates additional command line arguments).&lt;/li&gt;&#xA;&lt;li&gt;We don't need a list of rules for which flags are free versus which flags aren't. This lowers the barrier for participation for users who are not aware of all of our rules. When the obvious solution is the correct solution, new users can participate more easily.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="97857" LastEditDate="2021-08-24T14:21:05.000" LastActivityDate="2021-08-24T14:21:05.000" CommentCount="18" ContentLicense="CC BY-SA 4.0" />
  <row Id="14340" PostTypeId="2" ParentId="2140" CreationDate="2017-12-08T11:38:13.327" Score="1" Body="&lt;h1&gt;Google Doodle Kids Coding-style simulator&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;One input is a list of commands. There are three action commands and a loop construct. There is some flexibility as to the command format:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;As a string or equivalent: The loop construct should use a pair of matching brackets. The direction commands should be &lt;code&gt;&amp;lt;&lt;/code&gt; and &lt;code&gt;&amp;gt;&lt;/code&gt; or &lt;code&gt;L&lt;/code&gt; and &lt;code&gt;R&lt;/code&gt; (either case). The motion command should be &lt;code&gt;^&lt;/code&gt; or &lt;code&gt;F&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;As a list of characters: The loop construct should be a sublist. The other commands should be individual characters in the list, specified as above.&lt;/li&gt;&#xA;&lt;li&gt;As a list of integers: The direction commands should be &lt;code&gt;-1&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt; while the motion command should be &lt;code&gt;0&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The other input is the starting position. This consists of an two-dimensional array in any suitable format (including a newline-separated string). Background values should be represented using &lt;code&gt;0&lt;/code&gt; or spaces. Carrots should be represented using &lt;code&gt;-1&lt;/code&gt;, &lt;code&gt;^&lt;/code&gt; or &lt;code&gt;V&lt;/code&gt; (either case). The starting square should be represented using &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;@&lt;/code&gt;, or &lt;code&gt;R&lt;/code&gt; (either case).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Optionally, the starting direction can be an input (one of &lt;code&gt;&amp;lt;&amp;gt;V^&lt;/code&gt; or an angle in degrees or turns), or it can be hard-coded (please specify the default starting direction in this case).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Command rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Loops always execute four times&lt;/li&gt;&#xA;&lt;li&gt;The direction commands rotate the rabbit in place&lt;/li&gt;&#xA;&lt;li&gt;The motion command moves the rabbit one square in the current direction&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The rabbit wins if it eats all of the carrots.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The rabbit dies if:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It runs out of commands&lt;/li&gt;&#xA;&lt;li&gt;It walks out of bounds&lt;/li&gt;&#xA;&lt;li&gt;It walks onto the background&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The starting square and carrot squares are all safe.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your output should be a consistent truthy value if the rabbit wins, and a consistent falsy value if it dies. This can also be achieved by exception or error exit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2017-12-08T11:38:13.327" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="14342" PostTypeId="1" CreationDate="2017-12-08T19:32:58.133" Score="4" ViewCount="279" Body="&lt;p&gt;There has been a well-established meta consensus that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10132/60043&quot;&gt;people should try not to upvote trivial answers&lt;/a&gt;, but it is difficult to post reminders of it if it is not included in the OP.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The most effective way to alert the viewers would be to directly comment under those posts, but it doesn't really make sense unless it is posted under every single trivial responses. (and posting the comment on one post might lead to the answerer feeling targeted such as in &lt;a href=&quot;https://codegolf.stackexchange.com/a/150187/60043&quot;&gt;this answer&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How should we remind users to try not to upvote trivial solutions?&lt;/p&gt;&#xA;" OwnerUserId="60043" LastEditorUserId="68615" LastEditDate="2017-12-21T18:33:01.280" LastActivityDate="2017-12-21T18:33:01.280" Title="How to remind users to &quot;try not to upvote trivial solutions&quot;" Tags="|discussion|" AnswerCount="3" CommentCount="3" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14343" PostTypeId="2" ParentId="14342" CreationDate="2017-12-08T19:32:58.133" Score="-3" Body="&lt;h1&gt;Make it semi-mandatory to include the line&lt;/h1&gt;&#xA;&lt;p&gt;It's a well-established practice to include the line &amp;quot;this is code-golf, so the shortest answer wins.&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;Therefore, it should be possible to make it a common practice for challenge posters to also include &amp;quot;try to avoid upvoting trivial solutions.&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;Then, the answers who would likely want to gain reputation points would be encouraged to post non-trivial, interesting answers, instead of a simple builtin. This would make challenges more interesting and solve the &amp;quot;no upvoting trivial solutions&amp;quot; issue at the same time.&lt;/p&gt;&#xA;" OwnerUserId="60043" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-12-08T21:04:17.380" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14346" PostTypeId="2" ParentId="14342" CreationDate="2017-12-08T19:54:17.023" Score="-4" Body="&lt;h1&gt;Post a comment&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I have seen this done many times, and don't think it's too big of an issue to simply post a comment saying something along the lines of&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;As a reminder to voters, please &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10127/how-can-we-help-users-who-are-put-off-by-the-use-of-golfing-languages/10132#10132&quot;&gt;avoid upvoting uninteresting trivial answers&lt;/a&gt;. You may vote as you choose, but please keep that in mind. This applies to all trivial answers, not just this one.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The main issue is making sure that the OP of the answer doesn't feel attacked, but this doesn't happen enough that a simple&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This is simply a reminder for voters, and applies to every answer, not just yours. It'd be more disruptive to post this on every answer, so it should stay on just one.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;shouldn't be able to fix, if the first comment didn't make any difference.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As Mego &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14342/how-to-remind-try-not-to-upvote-trivial-solutions/14346?noredirect=1#comment51887_14346&quot;&gt;suggested&lt;/a&gt;, for challenges which are inherently trivial, such as &lt;a href=&quot;https://codegolf.stackexchange.com/q/84260/45941&quot;&gt;Add two numbers&lt;/a&gt;, it is a better idea to post the comment under the question, rather than a specific answer.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2017-12-08T20:36:55.810" LastActivityDate="2017-12-08T20:36:55.810" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14353" PostTypeId="2" ParentId="2140" CreationDate="2017-12-09T15:17:11.260" Score="1" Body="&lt;h1&gt;Coin Game: Shoot It Out!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;In Shoot It Out, we will play with coins on a table.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Basic Idea&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Shoot It Out is a 6-player game. The players will be split into two teams of 3 players, one offensive, and one defensive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Initially, every player has a coin on the table. Additionally, there is a target coin. Players take turns to shoot their coin. However, the shots will not be very accurate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The offensive team will try to shoot the target coin out of the table, while the defensive team tries to prevent the target coin from being shot out. You should make a bot that can play as both offensive and defensive team, and try to maximize the winning rate.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Playing Order&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Every player has its player ID. ID 1, 3, 5 are on the offensive team; ID 0, 2, 4 are on the defensive team. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Playing order is the same as ID. After the turn of ID 5 is ID 0's turn. If a player is removed, simply go to the next player.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When it is a player's turn, they will shoot their coin once. After every coin stopped moving, the turn ends.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Elimination in a Game&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If a player shoots their own coin out of the table, the player is removed from the game. If the target coin moves out of the table in the same turn, it will be placed back to the previous position.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If a player shoots another player's coin out of the table, both players are removed from the game.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;(Note that these two can occur in the same turn.)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Winning Conditions&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Defensive team wins when &lt;strong&gt;both&lt;/strong&gt; conditions below are satisfied:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The target coin is in the table area.&lt;/li&gt;&#xA;&lt;li&gt;All players on the offensive team are removed, or 18 turns have been played (skipped turn is not counted). &lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Offensive team wins when one of the conditions below are satisfied:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The target coin is out of the table area.&lt;/li&gt;&#xA;&lt;li&gt;All players on the defensive team are removed.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There is one exception: if all players are removed at the end of a turn, the defensive team wins. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Table Settings / Parameters&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The table is a circular area of radius 100 cm. The radius of every coin is 1 cm. A coin is out of table iff its center is out of the circular area.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For convenience, we set the coordinate of the center of the table to (0, 0), and denote the position of a coin by the coordinate of its center.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The coefficient of restitution between coins is 0.9.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The maximum intended speed of a shot is 240 cm/s.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When a coin is moving, it will have an acceleration of -240 cm/s^2 (due to friction).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When the game starts, the target coin is located at (0, 0), while the coin of ID &lt;code&gt;x&lt;/code&gt; is located at &lt;code&gt;(2.5 cos(f(x)*pi/3), 2.5 sin(f(x)*pi/3))&lt;/code&gt;. The values of f(x) are:&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x f(x)&#xA;0 0&#xA;1 3&#xA;2 1&#xA;3 4&#xA;4 5&#xA;5 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here is a picture of initial positions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/d3RRk.png&quot; width=&quot;400&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Errors&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Each player's shot has two parameters: angle and initial speed. Programs will output the two parameters representing its intended shot. However, the actual shot won't be the same of what is intended: errors will be added into parameters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Specifically, if the angle (in radians) and initial speed (in cm/s) of the intended shot are &lt;code&gt;θ, v&lt;/code&gt;, then:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The actual angle will be &lt;code&gt;θ+R(pi/70)&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The actual initial speed will be &lt;code&gt;v*exp(R(1/12))&lt;/code&gt;. (Note that it may exceed the maximum speed.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;R(x)&lt;/code&gt; is a random variable with Gaussian distribution of standard deviation &lt;code&gt;x&lt;/code&gt; and average 0.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Since only 6 players can play in one game, the controller will randomly assign players to a game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lots of games will be held until each player has played both defensive and offensive team in more than 10000 games.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The final score of your program will be &lt;code&gt;y/x+z/(1-x)&lt;/code&gt;, where:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;x&lt;/code&gt; is the average winning rate of offensive team in all games.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;y&lt;/code&gt; is the winning rate of your program when on the offensive team.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;z&lt;/code&gt; is the winning rate of your program when on the defensive team.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Input / Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your program will be run once per game. It should receive inputs from stdin and output to stdout.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the beginning of a game, it will receive a line of input &lt;code&gt;a&lt;/code&gt;, where &lt;code&gt;a&lt;/code&gt; is the player ID (thus indicating which team you should play in).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When a turn starts, you will receive input like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3&#xA;0 3.798 3.332&#xA;1 12.656 3.666&#xA;3 18.652 7.913&#xA;4 8.004 7.132&#xA;6 -3.187 -9.553&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The first line indicates the player of this turn. Each remaining line contains information of a coin: The first number is the player ID of the coin's owner (or 6 if it is the target coin). The remaining two numbers are x and y coordinates of the center of the coin.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it is your turn, you should output two numbers, separated by a newline or space, representing the intended angle (in radians, 0 is +x, pi/2 is +y) and initial speed (in cm/s). You should flush stdout after output. (If it is not your turn, you should not output anything.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You needn't to handle the termination of your program. When the game ends (or you are removed), the controller will send SIGKILL to your program to terminate it.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Specifications&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program should be able to be compiled into an executable, or be executed like an executable (for example, add shebang if you use interpreted languages). If your program need to be compiled to run, you should also specify how to compile your program.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program should not access files, or anything that stores information between games.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program should be deterministic. You can use random number generators, but you should make sure that the generator you use is based on a fixed seed, and will not use random devices (such as RDRAND or /dev/random), system time, etc. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;All &quot;random&quot; numbers (while generating errors and assigning players) used by the controller are generated in a deterministic way. However, your program should not take any advantage of it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The total response time of your program in a game should not exceed 0.1 second.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can submit multiple programs, but they should not team up against the others.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Controller &amp;amp; Sample Bots&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(Still working on them...)&lt;/p&gt;&#xA;" OwnerUserId="75905" LastEditorUserId="75905" LastEditDate="2017-12-11T01:20:23.000" LastActivityDate="2017-12-11T01:20:23.000" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14354" PostTypeId="2" ParentId="14342" CreationDate="2017-12-09T16:36:46.370" Score="15" Body="&lt;h1&gt;Don't urge others not to vote, but do some upvoting yourself!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I conjecture without proof that most upvotes to trivial solutions come from HNQ (hot network questions), who will be simply amazed at how short and concise golfing languages can be. The rest will be from people who never learned a golfing language, to whom the art of golfing languages seems worthy of an upvote.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Neither of these groups are put off by any banner (like the one I put in Community ads last year), comment (which can come off as hostile; since when is upvoting &lt;em&gt;wrong&lt;/em&gt;?!), or line tucked somewhere in the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The SE model promises that through voting, good answers 'bubble to the top'. So, &lt;a href=&quot;https://codegolf.stackexchange.com/q/98968/32352&quot;&gt;go out and vote!&lt;/a&gt;  Specifically, &lt;strong&gt;upvote&lt;/strong&gt; any answer you find fun and/or nontrivial (note the &lt;em&gt;or&lt;/em&gt;, because sometimes, I find it amazing how trivially one can solve a task that by description seems extremely nontrivial).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;Note: anyone looking at my profile will see that I am not living by my own words, as I vote very little. This is because I'm just a hobby programmer, and don't readily distinguish between trivial and nontrivial solutions, and possibly because I'm pathologically lazy.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="32352" LastActivityDate="2017-12-09T16:36:46.370" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14357" PostTypeId="2" ParentId="2140" CreationDate="2017-12-10T14:14:31.023" Score="0" Body="&lt;p&gt;Given an Integer array:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Start from the first number (n)&lt;/li&gt;&#xA;&lt;li&gt;Go forward (n) positions depending on the current position&lt;/li&gt;&#xA;&lt;li&gt;Delete the current position, the rest of the array &lt;code&gt;fill in&lt;/code&gt; to the current position.&lt;/li&gt;&#xA;&lt;li&gt;Goto step 2 until there are one number remaining&lt;/li&gt;&#xA;&lt;li&gt;Print that number&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The array loops around (the next number after the last number in the array is the first number).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A zero removes itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Negative numbers are not allowed as input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test Cases&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1] =&amp;gt; 1&#xA;[1,2] =&amp;gt; 1&#xA;[1,2,3] =&amp;gt; 3&#xA;[1,2,2] =&amp;gt; 1&#xA;[1,2,3,4] =&amp;gt; 1&#xA;[6,2,3,4] =&amp;gt; 4&#xA;[1,2,3,4,5] =&amp;gt; 5&#xA;[0,1] =&amp;gt; 1&#xA;[0,0,2,0,0] =&amp;gt; 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the shortest answer in bytes wins!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Step-by-step example&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1,4,2,3,5]&#xA; ^          start from the first position&#xA;   ^        jump 1 position (value of the position)&#xA;[1,  2,3,5] remove number in that position&#xA;     ^      take next position of the removed number&#xA;         ^  jump 2 positions&#xA;[1,  2,3  ] remove number in that position&#xA; ^          take next position (looping on the end of the array)&#xA;     ^      jump 1 position&#xA;[1,    3,5] remove number in that position&#xA;       ^    take next position (looping)&#xA;       ^    jump 3 positions (looping on the end of the array)&#xA;[1,      5] remove number in that position&#xA;         ^  take next position&#xA; ^          jump 5 positions (looping)&#xA;[        5] remove number in that position&#xA;print 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example #2&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[4,3,2,1,6,3]&#xA; ^            start from the first position&#xA;         ^    jump 4 positions&#xA;[4,3,2,1,  3] remove number in that position    &#xA;           ^  take next position&#xA;     ^        jump 3 positions&#xA;[4,3,  1,  3] remove number in that position    &#xA;       ^      take next position&#xA;           ^  jump 1 positions&#xA;[4,3,  1    ] remove number in that position    &#xA; ^            take next position&#xA;   ^          jump 4 positions&#xA;[4,    1    ] remove number in that position    &#xA;       ^      take next position&#xA; ^            jump 1 position&#xA;[      1    ] remove number in that position&#xA;print 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; This is my first challenge so any input is welcome.&lt;/p&gt;&#xA;" OwnerUserId="75178" LastEditorUserId="75178" LastEditDate="2017-12-10T21:24:34.723" LastActivityDate="2017-12-10T21:24:34.723" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="14358" PostTypeId="2" ParentId="2140" CreationDate="2017-12-10T14:29:36.457" Score="1" Body="&lt;h1&gt;Tell my browser&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Background&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Many people visit webpages, which require special browsers because of lack of compatibility. So you have to write a script (client sided or server sided), which just prints the name of the browser. Because not everyone has fast internet, the script has to be as short as possible.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You have to print the name of the browser loading the page without any version number etc. to STDOUT or equivalent. Leading or trailing spaces are allowed.&lt;/li&gt;&#xA;&lt;li&gt;You can assume the browser is Firefox, Chrome, Edge, Safari or Opera, so only those browsers will be tested. Don't print &quot;Chromium&quot;, this does NOT count.&lt;/li&gt;&#xA;&lt;li&gt;The script may be server sided with CGI (in any language), ruby on rails, jsp and similar. Client sided scripts may be written in JavaScript, TypeScript, and any other versions of ECMAScript, it just has to run in all five browsers.&lt;/li&gt;&#xA;&lt;li&gt;If your language has no offline interpreter for CGI, assume it's saved in /usr/bin/i, the shebang at the beginning does not add bytes to the count.&lt;/li&gt;&#xA;&lt;li&gt;this is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer wins!&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Does this question have important loopholes?&lt;/li&gt;&#xA;&lt;li&gt;Is there any language which cannot be programmed in? (CGI should work always, even Java or bf could be done with a shebang, lol)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="53416" LastEditorUserId="53416" LastEditDate="2017-12-10T14:34:45.280" LastActivityDate="2017-12-10T14:34:45.280" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14359" PostTypeId="2" ParentId="14323" CreationDate="2017-12-10T16:52:50.940" Score="7" Body="&lt;p&gt;What I've done in the past is to link back to the first instalment from each entry in the series. That way, all the challenges show up in the &lt;em&gt;Linked&lt;/em&gt; sidebar of the first challenge (and you can get there easily from any other part of the series) and you never need to bump any challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It may be worth pointing this out explicitly near the link, because some users are not aware of the &lt;em&gt;Linked&lt;/em&gt; sidebar.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2017-12-11T14:11:00.410" LastActivityDate="2017-12-11T14:11:00.410" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14360" PostTypeId="2" ParentId="2140" CreationDate="2017-12-10T19:12:23.643" Score="0" Body="&lt;h1&gt;Golf a number&lt;/h1&gt;&#xA;&lt;p&gt;Create a program or function, which when given an input integer, outputs a mathematical expression evaluating to the same value. Expressions which require fewer bytes to represent than the integer itself will achieve better scores!&lt;/p&gt;&#xA;&lt;h2&gt;Explanation&lt;/h2&gt;&#xA;&lt;p&gt;It is often useful when golfing to compress constant integer expressions by expressing them in the form of an equivalent mathematical expression. &lt;code&gt;387420489&lt;/code&gt; for example is much more efficiently expressed as &lt;code&gt;9^9&lt;/code&gt;. Similarly  &lt;code&gt;4194303&lt;/code&gt; as &lt;code&gt;2^22-1&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;The challenge is, for each integer in the range &lt;code&gt;1 to 1E6&lt;/code&gt;, to golf the number into as short an expression as you can (although any expression which evaluates correctly is acceptable output, see &lt;strong&gt;Rules&lt;/strong&gt; below). The shorter the expression, the better your score; but short programs will also score well so the two need to be balanced!&lt;/p&gt;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt; integer as argument or from STDIN&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt; as string or equivalent to STDOUT or as function output. Your string can only contain ascii characters [&lt;code&gt;0&lt;/code&gt;,&lt;code&gt;1&lt;/code&gt;,&lt;code&gt;2&lt;/code&gt;,&lt;code&gt;3&lt;/code&gt;,&lt;code&gt;4&lt;/code&gt;,&lt;code&gt;5&lt;/code&gt;,&lt;code&gt;6&lt;/code&gt;,&lt;code&gt;7&lt;/code&gt;,&lt;code&gt;8&lt;/code&gt;,&lt;code&gt;9&lt;/code&gt;], as well as those operators defined below, repetitions allowed.&lt;/p&gt;&#xA;&lt;p&gt;You may use the following mathematical operators any number of times in your string:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;() parentheses&#xA;^ exponentiation&#xA;* multiplication&#xA;/ division&#xA;\ integer(floor) division - see Test Evaluator&#xA;+ addition&#xA;- subtraction&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;NB: division, integer division and multiplication are all evaluated with equal priority, so &lt;code&gt;3/2\2 = 0&lt;/code&gt; whereas &lt;code&gt;3\2/2 = 0.5&lt;/code&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;You may output the input value (if it can't be golfed for example), &lt;strong&gt;you do not have to output the perfectly golfed string:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; In: 10000&#xA;&#xA;Out: 10000&#xA;     10^4&#xA;     2^13+1808&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;However the output must evaluate exactly to the input (assuming perfect precision of floats)&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Answers are scored on their compression ratio (how much they golf the input down on average), as well as program size&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;Program Size&lt;/code&gt;&lt;/strong&gt;: byte count of program (as with normal code golf)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;Compression Ratio&lt;/code&gt;&lt;/strong&gt;: &lt;code&gt;golfed Length (white-space ignored) / input Length&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;Individual Score&lt;/code&gt;&lt;/strong&gt;  =  &lt;code&gt;(Compression Ratio * 100 - 70)/6 + Log(Program Size, base 10)&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;Final Score&lt;/code&gt;&lt;/strong&gt; = &lt;code&gt;Mean score for first 10^6 integers&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Lowest final score for each language wins!&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Tags:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/expression-building&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;expression-building&amp;#39;&quot; rel=&quot;tag&quot;&gt;expression-building&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Sandbox:&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/139765/68602&quot;&gt;related&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/76591/express-a-number-with-only-0-9-and-the-four-operations&quot;&gt;related&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The main sticking point is scoring &lt;strong&gt;how best can you combine 2 metrics into a single score?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The logic so far is that compression ratios will lie in the range 100 - 70 % where 100 is returning the input. Program lengths should be between 2 extremes; returning the input (1 byte) and looking up the input in a hardcoded list (~19,000,000 bytes). This gives the following distribution:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/K6g7G.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/K6g7G.png&quot; alt=&quot;Score table&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Actual program length I guestimate will be anywhere in the range 1 to 10000 bytes, hence the &lt;code&gt;log&lt;/code&gt; to make the range more manageable. Quick reference; I could probably implement all power golfing (expressing n as a^b) in ~100-200 bytes in VBA. So 10% of that for golfing languages, and who knows what builtins Mathematica has ;).&lt;/p&gt;&#xA;&lt;p&gt;But implementing more effective algorithms may require a more verbose language, so I think 1 - 10000 seems like a good range to handle in scoring&lt;/p&gt;&#xA;&lt;p&gt;Open to alternative scoring though, and any required clarifications. Also suggestions &lt;strong&gt;what is a good range to test over?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I've suggested &lt;code&gt;1 to 1E6&lt;/code&gt;; The first 1000 integers I don't &lt;em&gt;think&lt;/em&gt; are golfable, after that only a few are. So perhaps a greater range of test cases, or ones starting at a larger initial value? What's the biggest range I can feasibly test within say, 10 mins running time max? What's typical algorithm execution times can be expected per digit? I don't want golfers to have to spend too long generating their average score...&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##rVdLc9s2ED5LvwLjQwRaFhXZh0xNu5lOk@bSpJ04PUVJBVOQCIcEGQC0ldr67e4uCFJ8yfZ4woNEPL5vX8Du8opds0macXm1/HYvkixVhlzBnJ8bEfsXIZOSq2CY5ZexCEkYM63JeyYkub3XhhmYu0zTmDNJlnytONfknKxYrHmFcduWKQw54dcspishWUwujBJyDevKI7dDAo/iJleSSH5D/rq84qGh5Qo@QhqSpShgMjsiYRQMq6XrVCwBtjG/R0w1QPiEEWDoeIzgM5Tnx1yuTUQ9j7y24xBgvxkKGzxyCvRBhd/uhJSGcmYo6oKgT@lbZtrybiIBllIUe05GZOTVVAsaO8Wq3LaXDJ998JrPjMp5c3E77NnmQtNjnYtPxpTmHQ/uU8CBNuBfC3y7yRTXWqSyz9I@/5tIpTc24h9zaUQCFCHPDDIc/ANiMzgFfHlKDsgYXcWUF0Ytamfaptes6ZS8UyxJmDqtz/FKUVDdcJWQu/rcYrzom50Us3UiuwuPfGhSBdvteHG4aM9My5k62O05t/IqAIrZDeiioYK3qBO4547IPLnkuH@VyxC994ElfMfiXhZfKy16414PX@sEtCP9Caxqx3gFImgQ9J1gCL99KF6e0XgEkd@QcZMLDWLLpUD1OwQczq09RJZgUhBMugQ6vzSKhfs5uqeleVm6V8KkH9lSMKlpORFxw9DKwcCxlbnvNeRGE/k7hNt6WmCC4WDPjSsseMTnf9jQPdvrh4XTDtts6LYkj43IIF2zJ3h/WhBN@4iW4lrgAQLfNEHzeYE6L1y0ilPAAEmToyCxi@SNoypU@FnRbIhr@axS1h5Qx921MZdM/SBZnOt@9KSGnuyDJ0ICvjfercwJpQZqqDJ/29pnIqF9yKRBv2yKsm9RDAjmEo6d5rrjuyckbOtiZPRGrZXt7jhg8foVatzLEXnxAuvsGQx@gYJ3d0dc@fNHTp8iRXV1cdXyiVQPlUK06o31oW@NK94pFhxIC9q2G7R05VHlSW@/fU4nVtfpv9KgMtW2TNpV/17oQwa4jgiJwZRH9e4S4FlRPIO4AX7Ws74qu5J/R30J47Fmoyi3jh@bIO@BxNQ5bPu3bftvd7@Cz2DsLEPStD2cAKaXgTgrjArEeLwnj1IMis@/59BA0QP9XZmDejrDCbrpu0LlUWrihWzChaS7orHxnkwUprpBBOPnERnW1AjGTyJ6uH/7JtMbWV2UoovDUW/A@i5hNxY/oWFsiapy59dGhcrSG7o56itPICSVkFtFUSwfbUbtr@8662AI4u@b30b28yWBrypaZIDPXwhTa21bDLiy@P755ZcqVtBtYKx2H1xF8z9wX2sEp9BBbkwvfmjDE19IED6w6YlqP2L6A9z0P4Xk2IdjM2OgLOH/wAHS3PgZ6GNiSe13m/blDoJk0M4MBtAzhBFtR4Nwbz@Zv@bmPdQdtkYmR7QFz2zvT@bH0@PhyfR4fjykJ5NXr7z5bObepvA2m9PZ9MS7B@v/Bw&quot; rel=&quot;nofollow noreferrer&quot;&gt;Test String Evaluation&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="68602" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-12-12T10:20:40.623" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="14363" PostTypeId="2" ParentId="2140" CreationDate="2017-12-10T21:16:38.917" Score="-3" Body="&lt;h1&gt;Hack Stack!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to create a code snippet in javascript that will upvote your answer when run. This should not be possible, but maybe it is. We'll see!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Standard Loopholes are not allowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should not auto-downvote other answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do not manually upvote any ansewer, please!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first one to write code that also accepts the answer when it is run by me will remain accepted.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;For discussion:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Is this even a valid challenge?&lt;/p&gt;&#xA;" OwnerUserId="74635" LastActivityDate="2017-12-10T21:16:38.917" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14366" PostTypeId="2" ParentId="2140" CreationDate="2017-12-11T15:25:58.300" Score="1" Body="&lt;h1&gt;The 64 | 64 Color Selector&lt;/h1&gt;&#xA;&lt;p&gt;All colour selector tools suck. Let us make another one that sucks also, but in a different way.&lt;/p&gt;&#xA;&lt;p&gt;Your interface will have:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;two squares, of 64x64 &amp;quot;pixels&amp;quot; each one. Pixels do &lt;strong&gt;not&lt;/strong&gt; need to be strictly pixels, but anything where the user can have 64 possible selections in each direction, vertical or horizontal, representing all the possible different RGB colors.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;a third element of the interface that will represent the color selected with user has selected based picked on squares.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;a fourth element which represents the 6 digit hexadecimal RGB hex-code (example: #FFBF32). You can divide it in three elements, but you have to make clear which component is what from RGB.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;a fifth element which represent the decimal RGB code (example RGB(127,33,43)). You can also divide it in three elements, but you have to make clear which component is what from RGB.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;When the two squares are at the top left corner, selected color must be RGB(0,0,0); and when the two squares at the bottom right corner must be RGB(255,255,255).&lt;/p&gt;&#xA;&lt;p&gt;You must have the the pixels in the square sorted by increasing order; I don't care what direction, vertical or horizontal, you choose for increasing one-by-one, but the two squares must have the same pattern.&lt;/p&gt;&#xA;&lt;p&gt;When the user picks a &amp;quot;pixel&amp;quot; in the first square, the colours of the second must be updated and reflect all possible values under the second pixel.&lt;/p&gt;&#xA;&lt;p&gt;When the user picks a &amp;quot;pixel&amp;quot; in the second square, 3rd, 4th and 5th elements must be updated to reflect new color selection.&lt;/p&gt;&#xA;&lt;p&gt;Code-golf, but there will be no accepted answer, as it discourages people from adding new answers when they see already posted very short answers.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/color&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;color&amp;#39;&quot; rel=&quot;tag&quot;&gt;color&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="29325" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-12-12T11:09:13.200" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="14368" PostTypeId="2" ParentId="2140" CreationDate="2017-12-11T16:14:45.340" Score="3" Body="&lt;h1&gt;Stable modular exponents&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/coge-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;coge-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;coge-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is well-known that the final three digits of &lt;a href=&quot;https://en.wikipedia.org/wiki/Graham%27s_number&quot; rel=&quot;nofollow noreferrer&quot;&gt;Graham's number&lt;/a&gt; are 387. This is because Graham's number is a ridiculously tall exponent tower of threes: &lt;code&gt;3^(3^(3^...)))&lt;/code&gt;, and it can be shown that any such tower of height at least 5 has 387 as its final three digits.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This generalises: given any base &lt;code&gt;n&lt;/code&gt; and any starting number &lt;code&gt;a&lt;/code&gt;, the exponent tower &lt;code&gt;a^(a^(a^...)))&lt;/code&gt; will eventually stabilize modulo &lt;code&gt;n&lt;/code&gt;. After that point, whatever you put in the topmost exponent, be it just a last &lt;code&gt;a&lt;/code&gt;, or a continuation of the exponent tower (i.e. more than one &lt;code&gt;a&lt;/code&gt;), or any other number, its congruency class modulo &lt;code&gt;n&lt;/code&gt; will not change. That is the challenge that I set before you here today.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Problem statement&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program or a function that takes two numbers &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;n&lt;/code&gt; (within your language's standard signed or unsigned integer range) as input, and outputs the limit &lt;code&gt;l&lt;/code&gt; of the sequence &lt;code&gt;a%n, (a^a)%n, (a^(a^a))%n,...&lt;/code&gt;, which can be mathematically proven to be eventually constant (and therefore have a well-defined limit).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program should be able to handle &lt;code&gt;a &amp;gt; n&lt;/code&gt; (note that &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;a+n&lt;/code&gt; doesn't necessarily give the same result), and we require that &lt;code&gt;0 &amp;lt;= l &amp;lt; n&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Warning: Reducing the exponents mudulo &lt;code&gt;n&lt;/code&gt;, i.e. calculating this sequence recursively using &lt;code&gt;b[0] = a%n, b[i] = (a^b[i-1])%n&lt;/code&gt; will yield the wrong result, and might not stabilize.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If we call the function &lt;code&gt;f(a, n)&lt;/code&gt;, it should give the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; f(3, 1000)&#xA;387&#xA;&amp;gt; f(6, 10)&#xA;6&#xA;&amp;gt; f(5, 9)&#xA;2&#xA;&amp;gt; f(14, 9)&#xA;4&#xA;&amp;gt; f(3, 81)&#xA;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring criteria&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Standard code golf rules, use as few bytes as possible.&lt;/p&gt;&#xA;" OwnerUserId="71213" LastEditorUserId="71213" LastEditDate="2017-12-11T16:20:11.000" LastActivityDate="2017-12-11T16:20:11.000" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14369" PostTypeId="1" CreationDate="2017-12-11T20:48:15.460" Score="1" ViewCount="80" Body="&lt;p&gt;I'm a bit new to meta, but I recently posted a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/150402/help-me-with-my-chemistry-hw&quot;&gt;question&lt;/a&gt;&#xA;and it requires converting to and from scientific-notation. I almost created a scientific-notation tag, but I'm not sure if I would be justified in doing so. I did a little &lt;a href=&quot;http://s2.quickmeme.com/img/02/02fc367feb457aa667d6b02af0a1e29ba9244ba868004affd31f817b3dc6b373.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;research&lt;/a&gt; and found &lt;s&gt;around 10&lt;/s&gt; 4 other questions that could be reasonably tagged [scientific-notation].&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/71265/efficient-scientific-notation&quot;&gt;Q1&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/124192/help-me-golf-my-numbers&quot;&gt;Q2&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/123435/general-tips-for-representing-large-numbers/123437#123437&quot;&gt;Q3&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/91009/evaluate-expressions-with-significant-figures&quot;&gt;Q4&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Should I create it or not? Also, any constructive explanation on the process of creating tags would be appreciated.&lt;/p&gt;&#xA;" OwnerUserId="69912" LastEditorUserId="68942" LastEditDate="2021-06-09T05:36:15.600" LastActivityDate="2021-06-09T05:36:15.600" Title="New [Scientific-Notation] tag" Tags="|discussion|feature-request|status-declined|tags|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14370" PostTypeId="2" ParentId="14369" CreationDate="2017-12-11T21:32:02.920" Score="3" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Also, any constructive explanation on the process of creating tags would be appreciated.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Asking on meta is a good first step before creating a tag. We generally discuss tag creations here first. However, providing a list of applicable challenges and posting some suggestions for the scope of the tag are really helpful for starting a constructive discussion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for your specific suggestion, in general it seems like a good idea. The scope is a more important question here. It's probably not worth tagging every challenge which &lt;em&gt;allows&lt;/em&gt; input or output in scientific notation. Instead, we should probably use the tag for challenges which are specifically &lt;em&gt;about&lt;/em&gt; manipulating scientific notation. But even then we should be careful to make a distinction between the new tag and the existing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/floating-point&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;floating-point&amp;#39;&quot; rel=&quot;tag&quot;&gt;floating-point&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I'd suggest you add those challenges you have in mind into your question so we have something more concrete to discuss. I'll edit my answer accordingly then.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2017-12-11T21:32:02.920" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14373" PostTypeId="2" ParentId="14316" CreationDate="2017-12-12T08:51:56.687" Score="3" Body="&lt;p&gt;As the person who suggested it, I'd like to defend the value of the tag. I don't think many people would want to follow it, although some people might want to hide it; but its real value would be in searching for duplicates. Being able to search for e.g. &lt;code&gt;[dice] visible is:q&lt;/code&gt; would be much more efficient than searching for &lt;code&gt;dice visible is:q&lt;/code&gt; and &lt;code&gt;die visible is:q&lt;/code&gt; (particularly because the word &lt;em&gt;die&lt;/em&gt; has non-dice-related meanings).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I agree that there would be overlap with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;, but I don't see that this is a problem. Neither would be a subset of the other, and very few questions (5%) on this site are at the five-tag limit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The tag system is meant to help the community, and I think that this tag would particularly help sandbox reviewers with dupe finding.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-12-12T08:51:56.687" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14380" PostTypeId="1" CreationDate="2017-12-12T22:52:26.680" Score="2" ViewCount="90" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/150487/46271&quot;&gt;This question&lt;/a&gt; was closed as a dupe of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/8477/score-a-game-of-yahtzee&quot;&gt;this other question&lt;/a&gt; by the gold &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; vote of Leaky Nun. And yes, I'd agree they're mostly dupes of one another.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, the newer question is closer to what we'd expect now, and the older version has a more cumbersome I/O format, not to mention only six answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8286/67312&quot;&gt;This Meta post&lt;/a&gt; says we should raise a meta question about it, so that's what this is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(note that I don't care that I already answered the new question)&lt;/p&gt;&#xA;" OwnerUserId="67312" LastEditorUserId="46271" LastEditDate="2017-12-12T23:36:15.623" LastActivityDate="2017-12-12T23:36:15.623" Title="Should we re-open &quot;Best Yahtzee score&quot;?" Tags="|discussion|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14383" PostTypeId="1" AcceptedAnswerId="14394" CreationDate="2017-12-13T04:29:16.923" Score="5" ViewCount="178" Body="&lt;p&gt;Sometimes, mistakes in challenges go overlooked, even after going through the sandbox. I've searched the meta, but there doesn't seem to be a meta consensus on this specific issue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some examples of these questions are &lt;a href=&quot;https://codegolf.stackexchange.com/q/141666/60043&quot;&gt;Simple State Sales Tax Calculator&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/q/150416/60043&quot;&gt;Electron Configuration&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In both cases, users posted answers following the incorrect specifications in the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By the time the challenge poster edits the question to include the correct information (but &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1347/60043&quot;&gt;not invalidate existing answers&lt;/a&gt;), it may be too late, and there would be two sets of answers that follow different specifications. Plus, having these two sets of answers looks bad since some answers would technically be &quot;incorrect&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When one encounters a challenge that contain incorrect information, what is the best course of action?&lt;/p&gt;&#xA;" OwnerUserId="60043" LastEditorUserId="60043" LastEditDate="2017-12-13T05:59:32.997" LastActivityDate="2017-12-15T19:54:19.357" Title="What should we do with challenges with incorrect information?" Tags="|discussion|" AnswerCount="4" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14384" PostTypeId="2" ParentId="14383" CreationDate="2017-12-13T04:29:16.923" Score="0" Body="&lt;h1&gt;Comment, wait, and edit (but provide evidence)&lt;/h1&gt;&#xA;&lt;p&gt;It is best to comment on the challenge and let the original poster edit the question.&lt;/p&gt;&#xA;&lt;p&gt;The comment must include a valid evidence that shows there is indeed an error on the question and should alert other users not to post answers until the problem is resolved. For the evidence, a Wikipedia article would suffice, for example.&lt;/p&gt;&#xA;&lt;p&gt;If there is no response after 10-20 minutes, the commenter may edit the question to include the correct information. For the edit summary, the evidence of the error should be included.&lt;/p&gt;&#xA;&lt;p&gt;When there are existing answers, the edit should also include a note saying that existing answers are not invalidated (but no more solutions may follow the incorrect specifications).&lt;/p&gt;&#xA;" OwnerUserId="60043" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-12-13T08:16:22.760" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14386" PostTypeId="2" ParentId="14383" CreationDate="2017-12-13T07:46:17.980" Score="4" Body="&lt;h1&gt;Comment and close&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Close the question as &quot;Unclear what you're asking&quot; to avoid answers to be posted. So answers will not be invalidated (because there isn't any).&lt;/p&gt;&#xA;" OwnerUserId="69850" LastActivityDate="2017-12-13T07:46:17.980" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="14390" PostTypeId="2" ParentId="2140" CreationDate="2017-12-13T23:01:39.793" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/155018/the-programming-language-quiz-mark-ii-cops&quot;&gt;The Programming Language Quiz, Mark II - Cops&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2018-02-06T18:56:44.180" LastActivityDate="2018-02-06T18:56:44.180" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="14394" PostTypeId="2" ParentId="14383" CreationDate="2017-12-14T12:59:38.427" Score="7" Body="&lt;p&gt;The best case, as already commented, is for the question to be closed as unclear and disputes over the specification resolved before any answers are posted. In other words, I endorse user202729's answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, the question was raised in comments: what if the disputed question already has answers? Here there isn't a one-size-fits-all best approach. Depending on the individual case, the best approach might be:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Leave the question in its broken state, but add a notice to the effect that the specification is known to be broken. I think this would probably be appropriate for something like the chemistry question which has one or two special cases which weren't correctly specified. The game is to golf to the spec, but it's only a game: if someone wants to take a PPCG answer and try to use it in their chemistry research then they deserve whatever bugs result from that.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Leave the question in its broken state with a notice, and post a separate question with a correct spec. This is rarely going to be the best approach, but &lt;em&gt;rarely&lt;/em&gt; is not &lt;em&gt;never&lt;/em&gt;. If the incorrect question is an interesting challenge and the correction is significant enough that it wouldn't be a dupe, there's no harm to having two questions.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Close the question, to freeze the situation and prevent &lt;em&gt;more&lt;/em&gt; answers being added; then discuss how the change the specification. Leave comments on all of the answers warning them that the discussion is in progress, so that they can contribute. It's not nice to invalidate someone's answer without warning, but if the answerers all agree to change their answers in line with the change to the spec then the problem can be resolved while keeping everyone happy. Sometimes there may not be an option which keeps everyone happy: in that case, it's best to at least let the unhappy people feel that they were included in the process rather than presented with a &lt;em&gt;fait accompli&lt;/em&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-12-14T12:59:38.427" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14395" PostTypeId="1" CreationDate="2017-12-14T16:07:59.240" Score="8" ViewCount="196" Body="&lt;p&gt;Recently there was a &lt;a href=&quot;https://codegolf.stackexchange.com/q/150625/59487&quot;&gt;challenge&lt;/a&gt; and the OP immediately posted a &lt;a href=&quot;https://codegolf.stackexchange.com/a/150626/59487&quot;&gt;community wiki answer&lt;/a&gt; which would serve the purpose of combining trivial answers. Citing the answer:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This community answer is for collecting answers in languages with built-in do most of the works, according to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11211/should-we-combine-answers-where-the-same-code-works-in-many-different-languages/11218#11218&quot;&gt;this proposal&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;However, it was not well received, and here are some possible causes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It had no code in the first place.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It might have forced some users to submit their answers there, given that a &lt;a href=&quot;https://codegolf.stackexchange.com/a/150629/59487&quot;&gt;Mathematica answer&lt;/a&gt; &lt;sub&gt;&lt;sup&gt;(you can only see it if you have the required privilege)&lt;/sup&gt;&lt;/sub&gt; was downvoted immediately and thus deleted by its poster, and this might make the poster think their work is not rewarded.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Consequences:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The answer in question &lt;em&gt;and the challenge&lt;/em&gt; were downvoted.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A huge comment clutter was generated because of some degree of opinion.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;How should we handle such situations? Should someone that already has one/more trivial answer(s) put &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11211/should-we-combine-answers-where-the-same-code-works-in-many-different-languages/11218#11218&quot;&gt;xnor's proposal&lt;/a&gt; in practice instead of the OP, or we shouldn't do such things at all? Is &lt;a href=&quot;https://codegolf.stackexchange.com/a/150626/59487&quot;&gt;this&lt;/a&gt; valid by our standards, given that it doesn't provide any solution to the challenge (at the moment of writing)?&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="61384" LastEditDate="2017-12-15T05:47:56.773" LastActivityDate="2017-12-15T05:59:26.400" Title="What should be done about pre-posted Community Wiki answers that serve as a place for combining trivial answers?" Tags="|discussion|answers|community-wiki|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14397" PostTypeId="2" ParentId="14395" CreationDate="2017-12-14T18:03:38.667" Score="16" Body="&lt;p&gt;Posting a community-wiki for the purpose of collecting trivial answers together is perfectly fine, but it was wrong in this case. For it to work, &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It needs to only contain &lt;em&gt;truly&lt;/em&gt; trivial answers. For example, if the challenge was to get the deltas of an array, lots and lots of golfing languages can do this in a single byte. If you could write the answer without knowing the language, that's trivial. In this hypothetical example, pretty much anyone, whether they understand jelly or not, could post a&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#Jelly, 1 byte:&#xA;&#xA;    I&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;answer. That's what makes this trivial, and worth combining in a CW.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The first revision of the CW should have &lt;em&gt;at least&lt;/em&gt; one submission in it, but preferably more. We should never post an empty CW for the purpose of hoping it fills with trivial answers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It should &lt;strong&gt;never&lt;/strong&gt; be mandatory to post in the CW. Whether that means &lt;em&gt;actually&lt;/em&gt; mandatory, posting it anywhere other than the CW is against the rules, or if it's &lt;em&gt;practically&lt;/em&gt; mandatory, you will be heavily downvoted if you post it outside of the CW. Neither of these are OK.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In this case, the answer in question failed on all three points.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The challenge was certainly not trivial. I don't know every golfing language out there, but I can pretty much guarantee that there will be no 0-byte answers to that challenge. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even the Mathematica answer was most definitely &lt;em&gt;NOT&lt;/em&gt; trivial. Can you tell me what &lt;code&gt;{{0,0}}~Join~#]&amp;amp;/@#]&amp;amp;&lt;/code&gt; does? Cause I have no clue. I certainly could not have written it. This clearly is not just a case of copying-pasting a couple builtin functions together.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The first revision of the CW had no submissions whatsoever.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The Mathematica answer was heavily downvoted for being posted as it's own answer, with the OP asking the author to move it. This is not OK.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This was a wrong move on the OP's part. But now that the CW is deleted, and the Mathematica answer reposted, there's nothing left to fix.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="16766" LastEditDate="2017-12-15T05:59:26.400" LastActivityDate="2017-12-15T05:59:26.400" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14400" PostTypeId="1" AcceptedAnswerId="14402" CreationDate="2017-12-14T22:24:32.233" Score="8" ViewCount="137" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;The tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/coding-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;coding-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;coding-theory&lt;/a&gt; now exists.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;After some discussion in the &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/41753536#41753536&quot;&gt;chat&lt;/a&gt;, I propose to create a new tag about &lt;a href=&quot;https://en.wikipedia.org/wiki/Information_theory&quot; rel=&quot;nofollow noreferrer&quot;&gt;Information-&lt;/a&gt; and &lt;a href=&quot;https://en.wikipedia.org/wiki/Coding_theory&quot; rel=&quot;nofollow noreferrer&quot;&gt;Coding theory&lt;/a&gt;. We've already had a number of challenges that would fit this tag very well and I think there are many more to come. It would add context to those challenges that is not possible to express with the current tags. So far the only tags that go in this direction are &lt;em&gt;compression&lt;/em&gt;, &lt;em&gt;error-correction&lt;/em&gt; and &lt;em&gt;kolmogorov-complexity&lt;/em&gt;, (also &lt;em&gt;checksum&lt;/em&gt; , &lt;em&gt;cryptography&lt;/em&gt; ), which are just three specific areas of this topic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Originally I proposed &quot;coding-theory&quot;, but that alone would (perhaps?) be prone to be misunderstood, so I'd suggest &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/information-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;information-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;information-theory&lt;/a&gt;, as &quot;information- and coding theory&quot;  would be too long. Furthermore both topics usually go hand in hand, even if information theory technically contains coding theory as a field.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the following list I collected a few examples (there are many more) that I think would fit very well:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/95194/incrementing-gray-codes&quot;&gt;Incrementing Gray Codes&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/123219/generate-hamming-codes&quot;&gt;Generate Hamming codes&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/55726/an-optimization-version-of-the-hadamard-problem&quot;&gt;An optimization version of the Hadamard problem&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/78507/compute-the-histogram-entropy-estimation-of-a-string&quot;&gt;Compute the histogram entropy estimation of a string&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/61903/code-the-huffman&quot;&gt;Code the Huffman!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/48880/the-gray-area-of-n-ary-codes&quot;&gt;The Gray area of n-ary codes&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/45684/correct-errors-using-hamming7-4&quot;&gt;Correct errors using Hamming(7,4)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/100171/on-this-site-we-obey-the-laws-of-thermodynamics&quot;&gt;On this site we obey the laws of thermodynamics!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/75878/generate-m-sequences&quot;&gt;Generate m-sequences&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="20198" LastEditDate="2018-01-11T19:38:07.587" LastActivityDate="2018-01-11T19:38:07.587" Title="Tag Proposal: Information- and Coding Theory" Tags="|discussion|tags|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14402" PostTypeId="2" ParentId="14400" CreationDate="2017-12-15T09:44:54.233" Score="4" Body="&lt;p&gt;I don't see a problem with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/coding-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;coding-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;coding-theory&lt;/a&gt;. Tags have wikis and wiki summaries for a reason: to say &quot;This tag is about X&quot;, and often &quot;If your question is about Y then you should use tag Y instead&quot;. We may have to retag things which are inappropriately tagged, but we already have to do that quite a lot with questions which misuse the winning criterion tags.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's certainly not too specific: the list of questions you've given would put it on page 5 of 8.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There may be a case for an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/information-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;information-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;information-theory&lt;/a&gt; tag &lt;em&gt;as well&lt;/em&gt;, but since that is so much wider I don't think that either precludes the existence of the other.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Proposed tag wiki for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/coding-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;coding-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;coding-theory&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Questions relating to &lt;a href=&quot;//en.wikipedia.org/wiki/Coding_theory&quot; rel=&quot;nofollow noreferrer&quot;&gt;mathematical codes&lt;/a&gt;: Huffman encoding, Reed-Solomon encoding, etc.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;If your question is about ciphers, prefer &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cryptography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cryptography&amp;#39;&quot; rel=&quot;tag&quot;&gt;cryptography&lt;/a&gt;. If it is about compression, in general prefer &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; rel=&quot;tag&quot;&gt;compression&lt;/a&gt;. This is not mutually exclusive with those tags, but it is more oriented to codes which don't have another related tag.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="194" LastEditorUserId="194" LastEditDate="2017-12-15T16:31:28.240" LastActivityDate="2017-12-15T16:31:28.240" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14403" PostTypeId="2" ParentId="2140" CreationDate="2017-12-15T12:36:23.660" Score="1" Body="&lt;h1&gt;Destroy the Computers with Magnets!&lt;/h1&gt;&#xA;&lt;p&gt;The robot apocalypse has finally arrived. But as we all know, robots are controlled by computers. And magnets are a convenient way of disabling computers.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Your task:&lt;/strong&gt; place the magnet close enough to the computer so that it disables the computer.&lt;/p&gt;&#xA;&lt;p&gt;A computer looks like this (always the exact same size):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; ____&#xA;|    |&#xA;|    |&#xA;|____|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The magnet looks like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;o&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The magnet needs to be touching the computer to do its work:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; o____o&#xA;o|    |o&#xA;o|    |o&#xA;o|____|o&#xA; oooooo&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note the lack of placements on the top; that is intentional. People use the computer on that side, and would easily see the magnet and remove it.&lt;/p&gt;&#xA;&lt;p&gt;So if you are given a picture of some computers:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;       ____&#xA;      |    |&#xA; ____ |    |&#xA;|    ||____|&#xA;|    |      ____&#xA;|____|     |    |&#xA;           |    |&#xA;           |____|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You should place 1 magnet for computer next to the computers:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;       ____&#xA;      |    |&#xA; ____ |    |&#xA;|    ||____|&#xA;|    |  o   ____&#xA;|____|     |    |&#xA; o        o|    |&#xA;           |____|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Magnets may touch computers, but there must be 1 touching magnet per computer.&lt;/p&gt;&#xA;&lt;p&gt;Due to the apocalypse, resources are scarce, so your program to place magnets must be as short as possible.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test cases:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input&#xA;~~~~~&#xA;Example outputs (not only possible outputs)&#xA;=====&#xA;       ____&#xA;      |    |&#xA; ____ |    |&#xA;|    ||____|&#xA;|    |      ____&#xA;|____|     |    |&#xA;           |    |&#xA;           |____|&#xA;~~~~~&#xA;       ____&#xA;      |    |&#xA; ____ |    |&#xA;|    ||____|&#xA;|    |  o   ____&#xA;|____|     |    |&#xA; o        o|    |&#xA;           |____|&#xA;&#xA;        ____&#xA;       |    |&#xA;  ____ |    |o&#xA; |    ||____|&#xA; |    |     o____&#xA;o|____|     |    |&#xA;            |    |&#xA;            |____|&#xA;=====&#xA;More soon....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="64159" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-12-14T15:32:08.520" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="14404" PostTypeId="2" ParentId="14383" CreationDate="2017-12-15T19:54:19.357" Score="-2" Body="&lt;h1&gt;Allow Either Specification&lt;/h1&gt;&#xA;&lt;p&gt;While the best option would indeed be to fix the challenge before any answers are posted, essentially the purpose of Sandbox in the first place, sometimes things get through. In order to avoid invalidating existing solutions while also allowing solutions that should have been correct from the start, answers should be allowed to choose either the original or corrected challenge. As an example, the State Tax challenge mentioned in the question allows answers to use &lt;em&gt;either&lt;/em&gt; the original &lt;code&gt;WS&lt;/code&gt; or the correct &lt;code&gt;WA&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-12-15T19:54:19.357" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14407" PostTypeId="1" CreationDate="2017-12-16T05:45:55.397" Score="11" ViewCount="370" Body="&lt;p&gt;I wrote a challenge about sampling a probability distribution: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/150700/sample-the-pareto-distribution?noredirect=1#comment368622_150700&quot;&gt;Sample the Pareto Distribution&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This probability distribution is defined over the real numbers. However, submissions do not have access to true real numbers, but merely imprecise approximations of real numbers. I wanted to allow submissions using floating point numbers. However, I couldn't find a satisfying way to specify what submissions were allowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In particular, many submissions would, very rarely, output &lt;code&gt;Infinity&lt;/code&gt; or &lt;code&gt;NaN&lt;/code&gt;, due to the fact that their randomly sampled floating point number would ocassionally be 0, and &lt;code&gt;1/0&lt;/code&gt; would be output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Likewise, in my challenge specification, I said that the output should be greater than 1 with probability 1, which is part of a natural definition of the distribution over the reals. However, many submissions would output exactly 1 with non-zero probability, again due to the fact that the floats are different from the reals.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What's the best way to say in the challenge that it's OK if submissions don't perfectly sample the true distribution due to floating point imprecision?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In general, how should challenges say that floating point imprecision is allowed?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some options:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Say that a submission must be written so that if the floating point type was replaced by a true real-number type, and all appropriate built-ins were likewise adjusted, then the program's output would exactly match the specified distribution.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is unsatisfying because it asks about a hypothetical analysis of the program, which isn't testable.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Specify exactly how far from the idealized output the submission is allowed to be. For instance, it could say that the difference between the probability of the submission outputting a value in an interval of size &lt;code&gt;1e-6&lt;/code&gt; must not differ from the true probability mass in that interval by more than &lt;code&gt;1e-6&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is unsatisfying because it's very technical and puts a heavy burden on the answerer. In addition, it might be very hard to come up with a perfect specification. Finally, this doesn't add much to the quality of the question.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Just handwave it with something like &quot;The submission shouldn't be very far the ideal distribution.&quot;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is unsatisfying because it's not objective, and may lead to disagreements that a specification should make clear.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;How should challenges specify that floating-point imprecision is allowed?&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2017-12-22T10:49:53.443" Title="How should a challenge allow floating point imprecision to be ignored?" Tags="|discussion|challenges|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14408" PostTypeId="2" ParentId="14407" CreationDate="2017-12-16T06:09:52.003" Score="4" Body="&lt;h1&gt;Specify exactly how far from the idealized output the submission is allowed to be&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;[In this answer, &lt;code&gt;eps&lt;/code&gt; (short for epsilon, or error) will refer to the tolerance, which is a small number, up to OP's decision]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It includes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For boundary condition: what have probability less than &lt;code&gt;eps&lt;/code&gt; can be treated as not being able to happen.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This includes whether it is possible to output 1, to error because &lt;code&gt;1/0&lt;/code&gt;, etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;For range: Consider a range &lt;code&gt;[a, b]&lt;/code&gt;. The probability that the output lies in this range must have absolute or relative error less than &lt;code&gt;eps&lt;/code&gt; for all such ranges, which means - let &lt;code&gt;x&lt;/code&gt; be the correct answer, and &lt;code&gt;y&lt;/code&gt; be the output, (assume &lt;code&gt;x, y &amp;gt; 0&lt;/code&gt;) then &lt;code&gt;(x - y) / max(1, x) &amp;lt; eps&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;Sorry, I confuses the definition... using &lt;code&gt;min&lt;/code&gt; implies absolute &lt;strong&gt;and&lt;/strong&gt;&#xA; relative error less than &lt;code&gt;eps&lt;/code&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;it's very technical and puts a heavy burden on the answerer&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;is not really a problem, because in most cases it is trivial to write. When in doubt, the answerer or someone else (← SE complains this is not a proper English word?) can prove this without too much problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For this particular challenge, it means:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Whether &lt;code&gt;1&lt;/code&gt; can be returned, or the program can error, it doesn't matter if the probability is &lt;code&gt;&amp;lt; eps&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;By default, I think &lt;code&gt;eps = 10&lt;sup&gt;-3&lt;/sup&gt;&lt;/code&gt; is enough. It allows some algorithm that takes time/memory like&lt;br&gt;&#xA;&lt;code&gt;eps&lt;sup&gt;-2&lt;/sup&gt;&lt;/code&gt; or even &lt;code&gt;eps&lt;sup&gt;-3&lt;/sup&gt;&lt;/code&gt; to be testable in reality, and yet still relatively precise.&lt;/p&gt;&#xA;" OwnerUserId="69850" LastEditorUserId="69850" LastEditDate="2017-12-16T06:42:10.003" LastActivityDate="2017-12-16T06:42:10.003" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="14412" PostTypeId="1" AcceptedAnswerId="14427" CreationDate="2017-12-17T08:44:28.310" Score="15" ViewCount="335" Body="&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/118444/stay-away-from-zero&quot;&gt;this question&lt;/a&gt;, the current C solution is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f(n){n=n?:1;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Obviously this command line is shorter by 2 bytes:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-Df(n)=n?:1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;But I've never seen anyone do that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it allowed but not found, or not allowed? In the latter case, why?&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="61563" LastEditDate="2017-12-26T21:35:36.197" LastActivityDate="2017-12-26T21:35:36.197" Title="Can a C submission be in the form of a macro defined by command line argument?" Tags="|discussion|code-golf|" AnswerCount="3" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="14414" PostTypeId="2" ParentId="2140" CreationDate="2017-12-17T19:38:57.040" Score="1" Body="&lt;h1&gt;Demolish a string! v2&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A modified version of &lt;a href=&quot;https://codegolf.stackexchange.com/q/145217/60043&quot;&gt;Demolish a String&lt;/a&gt;; since the original question involved randomness, the challenge was too complex and there were not many answers. This challenge removes the criterion and allows flexibility by the answerer, which should invite responses in languages without randomness built-ins.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a string input, output the demolished version of it.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Process&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;P&#xA;r      Pr       r&#xA;o       o       o&#xA;g       g       g&#xA;r       r       r      rogr         r&#xA;a  -&amp;gt;   a  -&amp;gt;   a  -&amp;gt;     a  -&amp;gt;     a  -&amp;gt;           -&amp;gt;           -&amp;gt;           -&amp;gt;           -&amp;gt;  &#xA;m       m       m         m         m&#xA;m       m       m         m         m         mmar         m&#xA;i       i       i         i         i         i            i           mi           m&#xA;n       n       n         n        gn        gn           gn           gn           gni         mgni&#xA;g       g      Pg        Pg      roPg      roPg         roPgmar      roPgmar      roPgmar      roPgmar&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Place the string vertically. Repeat the following steps until they are impossible:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Take any column of characters that can be demolished (explained below)&lt;/li&gt;&#xA;&lt;li&gt;Select some integer between &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;(height of the column of characters) - 1&lt;/code&gt; and some direction (left or right).&lt;/li&gt;&#xA;&lt;li&gt;Rotate that number of characters in that direction (only if those spaces are unoccupied; if not, go back to step 3).&lt;/li&gt;&#xA;&lt;li&gt;Let those characters fall due to gravity.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;At the end, the output should be a string whose heights of consecutive columns differ by at most one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note: the choice of integers and the direction is up to the answerer&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there are space characters in the input, demolish those first, all at once.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;C&#xA;o&#xA;&#xA;d      &#xA;e  -&amp;gt;     oC  -&amp;gt;         -&amp;gt;  ...&#xA;       de         &#xA;G        G          G&#xA;o        o          o&#xA;l        l          l&#xA;f        f        defoC&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard loopholes are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;Trailing and leading newlines are allowed.&lt;/li&gt;&#xA;&lt;li&gt;Your program may either print or return a string/equivalent.&lt;/li&gt;&#xA;&lt;li&gt;Please explain the demolition algorithm (&lt;code&gt;# of characters&lt;/code&gt; and &lt;code&gt;direction&lt;/code&gt;) in your answer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Some test cases to try&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A&#xA;Programming&#xA;Code Golf&#xA;The quick brown fox jumps over the lazy dog&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the submissions with the smallest byte counts in their languages win!&lt;/p&gt;&#xA;" OwnerUserId="60043" LastActivityDate="2017-12-17T19:38:57.040" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14415" PostTypeId="1" CreationDate="2017-12-18T00:48:04.030" Score="3" ViewCount="97" Body="&lt;p&gt;Ever since PPCG was created, answers using builtins have been an issue for challenge writers. Sometimes, an interesting challenge can be posted, only for some languages (not necessarily golfing languages) to have a builtin function that does all the work. Some people don't mind these answers, others seek to ban them. My views can be summed up by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/149192/eigenvalues-of-a-matrix/149193#comment364736_149193&quot;&gt;this&lt;/a&gt; comment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, banning builtins outright &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13775/66833&quot;&gt;isn't what we should do&lt;/a&gt;. Lynn puts it much more elegantly in that post, but quite often, answers without builtins get more upvotes then answers with builtins. Upvotes shouldn't matter to the more active users, but they do have a negative effect on voting: more votes equals more visibility.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, builtin solutions aren't good answers. A good answer contributes something new, something interesting to the site. And 10 answers consisting of the same function do not do this. One suggestion is to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11218/66833&quot;&gt;combine equally trivial answers&lt;/a&gt;, but that hasn't always worked out, or been implemented. Basically we have to face it: builtin answers will be posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yet, there may be a solution that satisfies both sides of the argument: forcing non-builtin answers to be posted with builtin answers. I'd be much more inclined to upvote a Mathematica answer that actually implemented &lt;a href=&quot;https://codegolf.stackexchange.com/a/71680/66833&quot;&gt;goat recognition&lt;/a&gt;, rather than relying on a builtin function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, I am suggesting allowing a rule in challenges where, if the challenge is fairly trivial, the challenge poster can force answers to post both the builtin and the non-trivial code in their answer. This meta post is here to ensure that the challenger can enforce this rule, if implemented.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What do you think?  &lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2017-12-18T03:44:16.287" Title="Requiring non-builtin answers" Tags="|discussion|answers|rules|" AnswerCount="1" CommentCount="2" ClosedDate="2017-12-20T18:19:58.773" ContentLicense="CC BY-SA 3.0" />
  <row Id="14416" PostTypeId="2" ParentId="14415" CreationDate="2017-12-18T03:44:16.287" Score="8" Body="&lt;h1&gt;I don't think we can or should do this&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The first reason I believe this is because we will never be able to force anyone to write a good answer.  By implementing these types of rules we are optimizing for sand, not pearls. There can be really quality answers that are just a built in.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example if we had a problem that could be solved by a single builtin, but that builtin was designed to solve a different task altogether, that would a good observation by the golfer, and thus a good answer in my opinion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And as you say&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A good answer contributes something new, something interesting to the site.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I think this definitely falls under that definition.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We should not put extra obstacles in the way of producing answers.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;My second point is that the term &quot;builtin&quot; is really vague. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13774/56656&quot;&gt;I've pointed it out here&lt;/a&gt; but using the phrase builtins instantly introduces a ton of ambiguity to the question.  Even if we could come up with a concrete definition of builtins, it would likely let some answers we might all agree are builtins through the cracks and it mark some perfectly good answers as builtins.  Terms as vague as builtins should not be allowed in challenges without definition.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-12-18T03:44:16.287" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14417" PostTypeId="2" ParentId="2140" CreationDate="2017-12-18T20:24:20.257" Score="1" Body="&lt;h1&gt;What is the simplest reversible circuit that computes conjugacy of transpositions?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;,&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt;,&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/logic-gates&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;logic-gates&amp;#39;&quot; rel=&quot;tag&quot;&gt;logic-gates&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Motivation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Reversible computation refers to computation in which little or no information is deleted. Reversible computation a major component of quantum computation, and reversible computation is potentially many times more energy efficient than conventional computation. I want to know how easy it is to compute the conjugacy of transpositions reversibly?&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let &lt;code&gt;T5&lt;/code&gt; be the set of all transpositions on the set &lt;code&gt;{1,2,3,4,5}&lt;/code&gt;. Let &lt;code&gt;*&lt;/code&gt; be the &lt;a href=&quot;http://mathworld.wolfram.com/Conjugation.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;conjugacy operation&lt;/a&gt; on &lt;code&gt;T5&lt;/code&gt; defined by &lt;code&gt;x * y=xyx^(-1)&lt;/code&gt; (here concatenation denotes the &lt;a href=&quot;https://en.wikipedia.org/wiki/Permutation_group&quot; rel=&quot;nofollow noreferrer&quot;&gt;group operation&lt;/a&gt;). In other words, the underlying set of &lt;code&gt;T5&lt;/code&gt; consists of all 10 pairs &lt;code&gt;(a,b)&lt;/code&gt; of distinct numbers from &lt;code&gt;{1,2,3,4,5}&lt;/code&gt; and where we declare &lt;code&gt;(a,b)=(b,a)&lt;/code&gt;. The operation &lt;code&gt;*&lt;/code&gt; is the unique operation on the underlying set that satisfies &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;(a,b) * (c,d)=(c,d)&lt;/code&gt;,&lt;/li&gt;&#xA;&#xA;&lt;li&gt;&lt;code&gt;(a,b) * (b,c)=(a,c)&lt;/code&gt;,&lt;/li&gt;&#xA;&#xA;&lt;li&gt;&lt;code&gt;(a,b) * (a,b)=(a,b)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;whenever &lt;code&gt;a,b,c,d&lt;/code&gt; are distinct.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What is the simplest &lt;code&gt;n&lt;/code&gt; bit input reversible circuit &lt;code&gt;C&lt;/code&gt; along with an injective function &lt;code&gt;R:T5-&gt;{0,1}^n&lt;/code&gt; such that &lt;code&gt;C(R(x),R(y))=(R(x),R(x*y))&lt;/code&gt; for all &lt;code&gt;x,y&lt;/code&gt; in &lt;code&gt;T5&lt;/code&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The gate cost of a reversible circuit shall be the sum of the costs of every individual logic gate in the reversible circuit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is the price chart per logic gate (see &lt;a href=&quot;https://en.wikipedia.org/wiki/Quantum_gate&quot; rel=&quot;nofollow noreferrer&quot;&gt;this link&lt;/a&gt; for a description of the logic gates) along with a description of the reversible gates.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each SWAP gate &lt;code&gt;(x,y)-&gt;(y,x)&lt;/code&gt; will have a cost of &lt;code&gt;0&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each &lt;a href=&quot;https://en.wikipedia.org/wiki/Inverter_(logic_gate)&quot; rel=&quot;nofollow noreferrer&quot;&gt;NOT gate&lt;/a&gt; &lt;code&gt;x-&gt; NOT x&lt;/code&gt; shall have a cost of &lt;code&gt;1&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each &lt;a href=&quot;https://en.wikipedia.org/wiki/Controlled_NOT_gate&quot; rel=&quot;nofollow noreferrer&quot;&gt;CNOT gate&lt;/a&gt; &lt;code&gt;(x,y)-&amp;gt;(x,x XOR y)&lt;/code&gt; shall have a cost of &lt;code&gt;2&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each &lt;a href=&quot;https://en.wikipedia.org/wiki/Fredkin_gate&quot; rel=&quot;nofollow noreferrer&quot;&gt;Fredkin gate&lt;/a&gt; &lt;code&gt;(x,y,z)-&amp;gt;(x,(NOT x AND y) OR (x AND z),(x AND y) OR (NOT x AND z))&lt;/code&gt; shall have a cost of &lt;code&gt;4&lt;/code&gt; (the Fredkin gate can also be described as the reversible logic gate where &lt;code&gt;(0,x,y)-&amp;gt;(0,x,y)&lt;/code&gt; and &lt;code&gt;(1,x,y)-&amp;gt;(1,y,x)&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each &lt;a href=&quot;https://en.wikipedia.org/wiki/Toffoli_gate&quot; rel=&quot;nofollow noreferrer&quot;&gt;Toffoli gate&lt;/a&gt; &lt;code&gt;(x,y,z)-&amp;gt;(x,y,(x AND y) XOR z)&lt;/code&gt; shall have a cost of &lt;code&gt;5&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;No other gates are allowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Observe that each reversible gate has the same number of inputs as it has outputs (this feature is required for all reversible gates).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The complexity of your circuit will be the product of the gate cost or your circuit with the number &lt;code&gt;n&lt;/code&gt; which you choose. The goal of this challenge will be to minimize this measure of complexity.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Format&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Complexity: This is your final score. The complexity is the product of the number &lt;code&gt;n&lt;/code&gt; with your total gate cost.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Space: State the number &lt;code&gt;n&lt;/code&gt; of bits that your circuit &lt;code&gt;C&lt;/code&gt; acts on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Total gate cost: State the sum of the costs of each of the individual gates in your circuit &lt;code&gt;C&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;NOT gate count: State the number of NOT gates.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;CNOT gate count: State the number of CNOT gates.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Toffoli gate count: How many Toffoli gates are there?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fredkin gate count: How many Fredkin gates are there?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Legend: Give a description of the function &lt;code&gt;R&lt;/code&gt;. For example, you may write&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;(1,2)-&gt;0000,(1,3)-&gt;0001,(1,4)-&gt;0010,(1,5)-&gt;0011,(2,3)-&gt;0100,&#xA;(2,4)-&gt;0101,(2,5)-&gt;0110,(3,4)-&gt;0111,(3,5)-&gt;1000,(4,5)-&gt;1001&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Gate list: Here list the gates in the circuit &lt;code&gt;C&lt;/code&gt; from first to last. Each gate shall be written in the form [Gate type abbreviation,lines where the gates come from]. For this problem, we shall start with the 0th bit. The following list specifies the abbreviations for the type of gates.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;T&lt;/code&gt;-Toffoli gate&#xA;&lt;code&gt;S&lt;/code&gt;-Swap gate&#xA;&lt;code&gt;C&lt;/code&gt;-CNOT gate&#xA;&lt;code&gt;F&lt;/code&gt;-Fredkin gate&#xA;&lt;code&gt;N&lt;/code&gt;-Not gate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, &lt;code&gt;[T,1,5,3]&lt;/code&gt; would denote a Toffoli gate acting on the 1st bit, the 5th bit, and the 3rd bit. For example, &lt;code&gt;[T,2,4,6]&lt;/code&gt; produces the transformation &lt;code&gt;01101010-&amp;gt;01101000&lt;/code&gt; and &lt;code&gt;[C,2,1]&lt;/code&gt; produces &lt;code&gt;011-&amp;gt;001,010-&amp;gt;010&lt;/code&gt; and &lt;code&gt;[N,3]&lt;/code&gt; produces &lt;code&gt;0101-&amp;gt;0100&lt;/code&gt;. For example, one could write&#xA;&lt;code&gt;[S,7,3],[N,2],[T,1,2,3],[F,1,2,5],[C,7,5]&lt;/code&gt;&#xA;for the gate list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The gates act on the bit string from left to right. For example, the gate list &lt;code&gt;[C,0,1],[C,1,0]&lt;/code&gt; will produce the transformation &lt;code&gt;01-&amp;gt;11&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sample answer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Complexity: &lt;code&gt;80&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Space: &lt;code&gt;5&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Total gate cost: &lt;code&gt;16&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;NOT gate count: &lt;code&gt;3&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;CNOT gate count: &lt;code&gt;2&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Toffoli gate count: &lt;code&gt;1&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fredkin gate count: &lt;code&gt;1&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Legend: &lt;code&gt;(1,2)-&amp;gt;00001,(1,3)-&amp;gt;00011,(1,4)-&amp;gt;00101,(1,5)-&amp;gt;00110,(2,3)-&amp;gt;01000,(2,4)-&amp;gt;01011,(2,5)-&amp;gt;01100,(3,4)-&amp;gt;01110,(3,5)-&amp;gt;10001,(4,5)-&amp;gt;10011&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Gate list: &lt;code&gt;[N,1],[N,0],[N,4],[S,1,2],[S,2,3],[C,0,1],[C,2,3],[T,3,2,1],[F,4,3,2,1]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;" OwnerUserId="53548" LastEditorUserId="53548" LastEditDate="2018-09-08T15:25:13.847" LastActivityDate="2018-09-08T15:25:13.847" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="14418" PostTypeId="1" CreationDate="2017-12-18T20:59:20.167" Score="3" ViewCount="33" Body="&lt;p&gt;Opcode can have &lt;code&gt;JMP&lt;/code&gt; command jumping to an address that also mean another instruction:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;JE $+42 ; 74 40, from 0001 it's an INC EAX&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;but usually it makes a jump far.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem is that I also write one program separated sometimes, e.g. when the skipped space is intended to do some other stuff, or maybe it's a fun call. Thus separated code seems nothing wrong.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So is it allowed?&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2017-12-18T20:59:20.167" Title="Can machine code be separated into several parts with fixed distance?" Tags="|discussion|code-golf|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14420" PostTypeId="1" AcceptedAnswerId="14421" CreationDate="2017-12-18T21:29:41.493" Score="3" ViewCount="119" Body="&lt;p&gt;In Excel, Excel VBA, and Google Sheets cell (and range) address may be redefined by the user as special &lt;code&gt;Named Range&lt;/code&gt; objects, is the use of these objects allowed by default - that is, may it be assumed that cell &lt;code&gt;A1&lt;/code&gt; is renamed to &lt;code&gt;A&lt;/code&gt; and Cell &lt;code&gt;B1&lt;/code&gt; is renamed to &lt;code&gt;b&lt;/code&gt; by default such as is done in &lt;a href=&quot;https://codegolf.stackexchange.com/a/150068/61846&quot;&gt;this answer&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="61846" LastActivityDate="2017-12-18T22:14:35.560" Title="Is Shortening Cell Addresses Valid?" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14421" PostTypeId="2" ParentId="14420" CreationDate="2017-12-18T21:29:41.493" Score="4" Body="&lt;h1&gt;No, Unless done programmatically&lt;/h1&gt;&#xA; &#xA;&lt;p&gt;It is invalid to assume that the user has manually redefined a given range to a shorter name. You may, however do so programmatically as part of your answer. An example of valid code renaming range &lt;code&gt;[A1]&lt;/code&gt; to &lt;code&gt;[A]&lt;/code&gt; in VBA is included below&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-vb prettyprint-override&quot;&gt;&lt;code&gt;ActiveWorkbook.Names.Add&amp;quot;A&amp;quot;,&amp;quot;=A1&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="61846" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-12-18T21:29:41.493" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="14422" PostTypeId="2" ParentId="14420" CreationDate="2017-12-18T22:14:35.560" Score="-3" Body="&lt;h1&gt;Yes.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;When really using Excel formula, the source values are usually not in &lt;code&gt;A1&lt;/code&gt; &lt;code&gt;A2&lt;/code&gt; &lt;code&gt;B1&lt;/code&gt; or anything. To make it clear we use name to mean the source. Thus if &lt;code&gt;A1&lt;/code&gt; is allowed, &lt;code&gt;a&lt;/code&gt; should&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2017-12-18T22:14:35.560" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="14423" PostTypeId="2" ParentId="2140" CreationDate="2017-12-18T22:45:43.620" Score="0" Body="&lt;h1&gt;All possible distributions of different items of a set to an arbitrary number of groups&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;See &lt;em&gt;Descriptive Real World Example&lt;/em&gt;, &lt;em&gt;Rules / Edge Cases&lt;/em&gt; or &lt;em&gt;Sample Data&lt;/em&gt; for an idea about this or help me by adding a nice sentence explaining it while this is in sandbox.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Descriptive Real World Example:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Ordering a set of &lt;code&gt;x&lt;/code&gt; &lt;code&gt;items&lt;/code&gt; from a shop what are the possibilities to distribute them among &lt;code&gt;1 to x&lt;/code&gt; &lt;code&gt;orders&lt;/code&gt;?&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules / Edge Cases&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Identical &lt;code&gt;items&lt;/code&gt; are not being distinguished (&lt;code&gt;AB, B == AB, B&lt;/code&gt;, compare examples &lt;code&gt;#4&lt;/code&gt;, &lt;code&gt;#5&lt;/code&gt; and &lt;code&gt;#6&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Order is &lt;strong&gt;&lt;em&gt;not&lt;/em&gt; important&lt;/strong&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Order of &lt;code&gt;items&lt;/code&gt; in &lt;code&gt;order&lt;/code&gt;/&lt;code&gt;group&lt;/code&gt;: &lt;code&gt;AB == BA&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Order of &lt;code&gt;orders&lt;/code&gt;/&lt;code&gt;groups&lt;/code&gt; in &lt;code&gt;distributions&lt;/code&gt;: &lt;code&gt;A, B == B, A&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Order of possible &lt;code&gt;distributions&lt;/code&gt; (i. e. lines among output)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Format&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I don't really mind the exact format but as it probably makes sense (right?) to tie oneself down to one format I'll suggest the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input: Set of items without delimiters. Supported chars: [A-Za-z0-9]&lt;/li&gt;&#xA;&lt;li&gt;Output:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Hierarchy: &lt;code&gt;Distributions (Orders (Items))&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Delimiters:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Among &lt;code&gt;distributions&lt;/code&gt; in overall output: &lt;code&gt;EOL&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Among &lt;code&gt;orders&lt;/code&gt;/&lt;code&gt;groups&lt;/code&gt; in &lt;code&gt;distribution&lt;/code&gt;: &lt;code&gt;Comma&lt;/code&gt;, &lt;code&gt;Space&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Among &lt;code&gt;items&lt;/code&gt; in &lt;code&gt;orders&lt;/code&gt;/&lt;code&gt;groups&lt;/code&gt;: &lt;code&gt;None&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Sample Data&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;╔═════════╤═══════╤═════════╤════════════╗&#xA;║ Example │ Input │ Output  │   Output   ║&#xA;║   Nr    │       │ line nr │   lines    ║&#xA;╠═════════╪═══════╪═════════╪════════════╣&#xA;║   #1    │ A     │    1    │     A      ║&#xA;╠═════════╪═══════╪═════════╪════════════╣&#xA;║         │       │    1    │    A, A    ║&#xA;║   #2    │ AA    ├─────────┼────────────╢&#xA;║         │       │    2    │     AA     ║&#xA;╠═════════╪═══════╪═════════╪════════════╣&#xA;║         │       │    1    │    A, B    ║&#xA;║   #3    │ AB    ├─────────┼────────────╢&#xA;║         │       │    2    │     AB     ║&#xA;╠═════════╪═══════╪═════════╪════════════╣&#xA;║         │       │    1    │  A, A, A   ║&#xA;║         │       ├─────────┼────────────╢&#xA;║   #4    │ AAA   │    2    │   AA, A    ║&#xA;║         │       ├─────────┼────────────╢&#xA;║         │       │    3    │    AAA     ║&#xA;╠═════════╪═══════╪═════════╪════════════╣&#xA;║         │       │    1    │  A, A, B   ║&#xA;║         │       ├─────────┼────────────╢&#xA;║         │       │    2    │   AA, B    ║&#xA;║   #5    │ AAB   ├─────────┼────────────╢&#xA;║         │       │    3    │   AB, A    ║&#xA;║         │       ├─────────┼────────────╢&#xA;║         │       │    4    │    AAB     ║&#xA;╠═════════╪═══════╪═════════╪════════════╣&#xA;║         │       │    1    │  A, B, C   ║&#xA;║         │       ├─────────┼────────────╢&#xA;║         │       │    2    │   AB, C    ║&#xA;║         │       ├─────────┼────────────╢&#xA;║   #6    │ ABC   │    3    │   AC, B    ║&#xA;║         │       ├─────────┼────────────╢&#xA;║         │       │    4    │   BC, A    ║&#xA;║         │       ├─────────┼────────────╢&#xA;║         │       │    5    │    ABC     ║&#xA;╠═════════╪═══════╪═════════╪════════════╣&#xA;║         │       │    1    │ A, B, C, D ║&#xA;║         │       ├─────────┼────────────╢&#xA;║         │       │    2    │   AB, CD   ║&#xA;║         │       ├─────────┼────────────╢&#xA;║         │       │    3    │   AC, BD   ║&#xA;║         │       ├─────────┼────────────╢&#xA;║         │       │    4    │   BC, AD   ║&#xA;║         │       ├─────────┼────────────╢&#xA;║         │       │    5    │  A, BC, D  ║&#xA;║         │       ├─────────┼────────────╢&#xA;║         │       │    6    │  B, AC, D  ║&#xA;║         │       ├─────────┼────────────╢&#xA;║         │       │    7    │  C, AB, D  ║&#xA;║         │       ├─────────┼────────────╢&#xA;║   #7    │ ABCD  │    8    │  A, CD, B  ║&#xA;║         │       ├─────────┼────────────╢&#xA;║         │       │    9    │  A, BD, C  ║&#xA;║         │       ├─────────┼────────────╢&#xA;║         │       │   10    │  B, AD, C  ║&#xA;║         │       ├─────────┼────────────╢&#xA;║         │       │   11    │   ABC, D   ║&#xA;║         │       ├─────────┼────────────╢&#xA;║         │       │   12    │   BCD, A   ║&#xA;║         │       ├─────────┼────────────╢&#xA;║         │       │   13    │   CDA, B   ║&#xA;║         │       ├─────────┼────────────╢&#xA;║         │       │   14    │   DAB, C   ║&#xA;║         │       ├─────────┼────────────╢&#xA;║         │       │   15    │    ABCD    ║&#xA;╚═════════╧═══════╧═════════╧════════════╝&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="72180" LastActivityDate="2017-12-18T22:45:43.620" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14426" PostTypeId="1" AcceptedAnswerId="14429" CreationDate="2017-12-19T13:53:44.657" Score="-1" ViewCount="84" Body="&lt;p&gt;In C, to sum up some numbers, can do:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;*X;f(x,n){X=x;x=0;while(n--)x+=*X++;} &#xA;// not sure if return the answer, assuming it does&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;input a pointer &lt;code&gt;x&lt;/code&gt; and the length &lt;code&gt;n&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But can also be done by&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;n;f(x){n+=x;}&#xA;#define g(d)d=n,n=0  // 4 bytes shorter&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;input by repeatedly call &lt;code&gt;f&lt;/code&gt;, once a value, then call &lt;code&gt;g(dest)&lt;/code&gt; to get the final result into &lt;code&gt;dest&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it allowed? (Maybe there's shorter solution, but that's not the point)&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;that(this topic) sounds like a special form of currying and would be worth asking about in a separate question. (In principle, this should be valid, but it's worth discussing explicitly.) – Martin Ender♦ 17 hours ago&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2017-12-19T14:43:11.123" LastActivityDate="2017-12-19T17:46:11.447" Title="Is it allowed to take input by repeatedly call a function?" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="2" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14427" PostTypeId="2" ParentId="14412" CreationDate="2017-12-19T14:56:30.897" Score="4" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Passing &lt;code&gt;-Df(n)!n+n&lt;/code&gt; to the compiler is exactly equivalent to adding &lt;code&gt;#define f(n)!n+n&lt;/code&gt; in the code. So there is no reason to allow one and disallow the other.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;Apparently no one wrote an answer...&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;For those who are not familiar with the language C:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &quot;accepted&quot; solution, use &lt;code&gt;#define&lt;/code&gt;, add 16 bytes (17 if the newline is counted) to the file to define the function:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#define f(n)!n+n&#xA;int main() {&#xA;    printf(&quot;%d\n%d&quot;, f(0), f(5));&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and the command to compile it: (assume the file is stored as &lt;code&gt;a.c&lt;/code&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;gcc a.c&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(which will produce an executable named &lt;code&gt;a&lt;/code&gt;. It's possible to specify executable name with &lt;code&gt;-o&lt;/code&gt;, but it's not important here)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;where the proposed solution would add 0 byte to the file:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;int main() {&#xA;    printf(&quot;%d\n%d&quot;, f(0), f(5));&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;but make the compilation command 11 bytes longer:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;gcc -Df(n)!n+n a.c&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="69850" LastEditorUserId="69850" LastEditDate="2017-12-19T15:03:44.730" LastActivityDate="2017-12-19T15:03:44.730" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14428" PostTypeId="2" ParentId="14412" CreationDate="2017-12-19T16:50:55.360" Score="1" Body="&lt;h1&gt;Yes, but ...&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There are conflicting accounts on how to score command line arguments and flags however, everyone seems to agree (for the most part) that the use of any and all command line flags is allowed.  So yes, you can use flags to set C macros.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The &lt;strong&gt;but&lt;/strong&gt; part of this answer is scoring.  Traditionally scoring command line flags has been a muddy ordeal, there was a meta answer which was interpreted in different ways by different people and lead to a lot of confusion.  Under that method you would probably have to add either 10 or 11 bytes to your score for the flag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Recently there has been a push to stop scoring command line flags altogether.  Different flags are different invocations of the interpreter and thus are different &lt;em&gt;languages&lt;/em&gt;.  This is nice for a couple of reasons, the main one is it is completely unambiguous.  &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14339/56656&quot;&gt;Mego's post here&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/13792/56656&quot;&gt;my question here&lt;/a&gt; outline the reasons for this in better detail.  Under this system you would gain 0 bytes for using the flag, but would have to mark it as a separate language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is basically the same as saying don't do that.  There is not much sense in making that answer because, since most competitions are language categorized, you are only competing against yourself.  &lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2017-12-19T17:05:18.993" LastActivityDate="2017-12-19T17:05:18.993" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14429" PostTypeId="2" ParentId="14426" CreationDate="2017-12-19T17:46:11.447" Score="5" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;... unless this is somehow a &amp;quot;standard&amp;quot; way to accomplish some input in a given language.&lt;/p&gt;&#xA;&lt;p&gt;There are multiple reasons I see for why this would be problematic, which I will present in no particular order.&lt;/p&gt;&#xA;&lt;h3&gt;Technically adds inputs&lt;/h3&gt;&#xA;&lt;p&gt;In some languages or situations, having a single value input multiple times offers fundamental advantages compared to having it input just once. This is a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1789/71434&quot;&gt;forbidden loophole&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Requires user action not defined in the source code&lt;/h3&gt;&#xA;&lt;p&gt;The consensus &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14094/71434&quot;&gt;here&lt;/a&gt; states that a program requiring user interaction between the initial input and receiving output must either A) represent that user interaction as part of the source code or B) follow a known standard. If this was a standard input format for a language then B would apply.&lt;/p&gt;&#xA;&lt;h3&gt;Neither a function nor a program&lt;/h3&gt;&#xA;&lt;p&gt;The default I've seen for PPCG is that a challenge can be answered either with a full program or a single function. The formation listed in this question is neither; rather, it is two functions called independently with different information for different purposes and requires the user to perform special actions on each. It might be possible to avoid this in a way that calling the function multiple times will return the answer on the final call rather than requiring an additional call to retrieve it, but as-written I would consider such a submission invalid even if the input type were not.&lt;/p&gt;&#xA;&lt;h3&gt;Sensitive to initial state&lt;/h3&gt;&#xA;&lt;p&gt;While not an especially strong argument, this method of input would make evaluating a submission much more difficult and time-consuming. TIO and most other online interpreters would be useless, and attempts to form a &amp;quot;test battery&amp;quot; that checks the results of multiple cases in sequence would be at best painful. I wouldn't call that alone a reason to forbid something, but I do much prefer when answers can be easily checked for validity.&lt;/p&gt;&#xA;&lt;h3&gt;Forms a dangerous precedent&lt;/h3&gt;&#xA;&lt;p&gt;Currently, input is mostly accepted in formats that can be obtained through STDIN, read from a file, input as a command-line argument, fed as a bit stream, etc. While formatting is usually flexible, there isn't any current precedent for accepting inputs as things that don't match a language's definition of an input. If these atypical input types are acceptable, then a lot of other input types come into the realm of possibility. For example, if a challenge is &amp;quot;Given a number &lt;code&gt;n&lt;/code&gt;, output the current year &lt;code&gt;n&lt;/code&gt; milliseconds after epoch time&amp;quot;, an answer could be a given language's &lt;code&gt;CurrentYear&lt;/code&gt; function and input given as &amp;quot;number of milliseconds after epoch time that the function was called&amp;quot;. I don't consider that to be a valid challenge answer, and I also consider both that type of input and input as &amp;quot;number of times the function is called&amp;quot; to be in the same category of &amp;quot;taking input as external state rather than provided values.&amp;quot; So rather than trying to decide on a &amp;quot;line&amp;quot; where some external inputs are valid and some aren't, I would prefer to stop the issue immediately.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-12-19T17:46:11.447" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14431" PostTypeId="2" ParentId="2140" CreationDate="2017-12-19T21:54:21.113" Score="-3" Body="&lt;h1&gt;Feliz navidad, prospero año y felicidad&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So christmas is comming and carols are on the radio all day. Jose Feliciano's &lt;em&gt;Feliz Navidad&lt;/em&gt; song is a good example of this. Your task is to print the entire (and repetitive) song.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.azlyrics.com/lyrics/josefeliciano/feliznavidad.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Lyrics&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Feliz navidad&#xA;Feliz navidad&#xA;Feliz navidad, prospero año y felicidad&#xA;&#xA;Feliz navidad&#xA;Feliz navidad&#xA;Feliz navidad, prospero año y felicidad&#xA;&#xA;I want to wish you a merry Christmas&#xA;I want to wish you a merry Christmas&#xA;I want to wish you a merry Christmas from the bottom of my heart&#xA;&#xA;I want to wish you a merry Christmas&#xA;I want to wish you a merry Christmas&#xA;I want to wish you a merry Christmas from the bottom of my heart&#xA;&#xA;Feliz navidad&#xA;Feliz navidad&#xA;Feliz navidad, prospero año y felicidad&#xA;A-ha!&#xA;&#xA;Feliz navidad&#xA;Feliz navidad&#xA;Feliz navidad, prospero año y felicidad&#xA;&#xA;I want to wish you a merry Christmas&#xA;I want to wish you a merry Christmas&#xA;I want to wish you a merry Christmas from the bottom of my heart&#xA;&#xA;I want to wish you a merry Christmas&#xA;I want to wish you a merry Christmas&#xA;I want to wish you a merry Christmas from the bottom of my heart&#xA;&#xA;Feliz navidad&#xA;Feliz navidad&#xA;Feliz navidad, prospero año y felicidad&#xA;&#xA;Feliz navidad&#xA;Feliz navidad&#xA;Feliz navidad, prospero año y felicidad&#xA;&#xA;I want to wish you a merry Christmas&#xA;I want to wish you a merry Christmas&#xA;I want to wish you a merry Christmas from the bottom of my heart&#xA;&#xA;I want to wish you a merry Christmas&#xA;I want to wish you a merry Christmas&#xA;I want to wish you a merry Christmas from the bottom of my heart&#xA;&#xA;Feliz navidad&#xA;Feliz navidad&#xA;Feliz navidad, prospero año y felicidad &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;RULES:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Default loopholes are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;Default I/O.&lt;/li&gt;&#xA;&lt;li&gt;Programs or functions are acceptable.&lt;/li&gt;&#xA;&lt;li&gt;You MUST include the ñ character in the &lt;em&gt;año&lt;/em&gt; word.&lt;/li&gt;&#xA;&lt;li&gt;You can print it in lowercase, uppercase or sentence case.&lt;/li&gt;&#xA;&lt;li&gt;Shortest code in bytes wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="68134" LastEditorUserId="68134" LastEditDate="2017-12-19T22:02:33.257" LastActivityDate="2017-12-19T22:02:33.257" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14433" PostTypeId="1" AcceptedAnswerId="14434" CreationDate="2017-12-20T00:51:50.337" Score="2" ViewCount="55" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/10553/build-a-random-number-generator-that-passes-the-diehard-tests&quot;&gt;This challenge&lt;/a&gt; is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;, where you need the set of test cases that the challenge provides.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, the test suite that you are required to use is missing, since the website has gone down. I want to answer the challenge, so what should I do? &lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="46271" LastEditDate="2017-12-20T02:13:32.033" LastActivityDate="2017-12-20T02:13:32.033" Title="Test cases are missing on a [test-battery] challenge" Tags="|discussion|testing|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14434" PostTypeId="2" ParentId="14433" CreationDate="2017-12-20T01:06:09.380" Score="6" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;What should I do with my answer?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The real question is, what should we do with the challenge?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If new answers cannot be scored anymore because some outside resource became unavailable, I see only two possible courses of action.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Replace the broken link with a working one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this particular case, the Wayback Machine appears to have mirrored the resource here: &lt;a href=&quot;https://web.archive.org/web/20161114211602/http://stat.fsu.edu/pub/diehard/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://web.archive.org/web/20161114211602/http://stat.fsu.edu/pub/diehard/&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Close the challenge, as it no longer has a winning criterion.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-12-20T01:06:09.380" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14437" PostTypeId="2" ParentId="14412" CreationDate="2017-12-20T09:12:45.747" Score="0" Body="&lt;p&gt;I'm still not convinced that this works: the TIO link for the answer you refer to shows that it is buggy. But that's really an aside. To address the real question:&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;For a macro to be equivalent to a function, it needs a lot of parentheses.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;To get a macro equivalent to&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f(n){n=n?:1;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;you need&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-Df(n)=((n)?:1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which is longer, so there's no point.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-12-20T09:12:45.747" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14438" PostTypeId="1" CreationDate="2017-12-20T09:56:11.457" Score="2" ViewCount="65" Body="&lt;p&gt;I'm currently writing a challenge which forces people to work in pairs to participate in the challenge. However, this leads to the question, who wins in the pair?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm thinking about (ideally) having a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; (don't boo until after reading the challenge), where a pair's score is the sum of their upvotes minus the sum of their downvotes. But this would lead to two people winning the challenge. Is this OK, or can only one person win a challenge (ignoring ties)?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2017-12-20T14:20:27.183" Title="How many winners can a challenge have?" Tags="|discussion|policy|winning-criteria|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="14439" PostTypeId="1" AcceptedAnswerId="14440" CreationDate="2017-12-20T12:51:32.323" Score="12" ViewCount="343" Body="&lt;p&gt;Is is acceptable to bunch together multiple answers in a CW post just because the challenge is trivial?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/a/151280/43319&quot;&gt;https://codegolf.stackexchange.com/a/151280/43319&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="12012" LastEditDate="2017-12-20T13:31:22.667" LastActivityDate="2017-12-20T13:36:30.193" Title="Multiple answers in a single post" Tags="|discussion|policy|answers|community-wiki|specific-answer|" AnswerCount="1" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="14440" PostTypeId="2" ParentId="14439" CreationDate="2017-12-20T13:36:30.193" Score="32" Body="&lt;h1&gt;No, this is not acceptable&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;xnor's proposal to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11218/12012&quot;&gt;combine equivalent trivial answers&lt;/a&gt; talks about solutions that are &lt;em&gt;just a built-in&lt;/em&gt;. None of the answers in the post you mention are just rather; they all consist of at least three tokens. Furthermore, although the differences may be subtle, they certainly aren't all &lt;em&gt;equivalent&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Aside from the fact that a single answer is now hogging the challenge for an arbitrary number of languages (&lt;a href=&quot;https://codegolf.stackexchange.com/a/151277/12012&quot;&gt;the Python answer&lt;/a&gt; isn't less trivial than the answer in the CW post), the answers aren't explained as well as they could be, there's a &lt;em&gt;huge&lt;/em&gt; potential for editing conflicts as the post grows larger, votes cannot discriminate between good and bad solutions, and we've pinned a vertically large post to the top, furthermore decreasing the attention less trivial answers will get.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Personally, I can't see any &lt;em&gt;upsides&lt;/em&gt; to making a huge CW posts for anything but one-step answers (the fact that there are &lt;em&gt;two&lt;/em&gt; Jelly answers lumped in there shows that answers aren't as trivial as they're supposed to be). I propose to delete this answer and repost the solutions as separate answers, as they should have been posted in the first place.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-12-20T13:36:30.193" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14441" PostTypeId="2" ParentId="14438" CreationDate="2017-12-20T14:20:27.183" Score="2" Body="&lt;h1&gt;The rules are specified in the challenges itself&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As long as it is programming puzzle, and it have objective winning criteria, any rules are fine. That includes allow multiple users to win.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I don't see any problem with this, except that it may changes how PPCG users work. However there are already a lot of answers on this site involves teamwork (the most famous one is the Tetris GoL challenge), so it should be normal.&lt;/p&gt;&#xA;" OwnerUserId="69850" LastActivityDate="2017-12-20T14:20:27.183" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14442" PostTypeId="2" ParentId="2140" CreationDate="2017-12-20T14:48:23.483" Score="0" Body="&lt;h1&gt;Show me your core&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;On many 8-bit machines, it is relatively easy to output the entire core syntax of the built-in language, as everything required is in ROM and most 8-bit machines allow you to &lt;code&gt;PEEK&lt;/code&gt; at each location therein, or otherwise easily access the ROM contents.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's the complete syntax for a Sinclair ZX81 or Timex TS1000/1500 machine as an example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 1 PRINT CHR$ 64;CHR$ 65;CHR$ 66;CHR$ 193;CHR$ 193;&#xA; 2 FOR I=196 TO 255&#xA; 3 PRINT CHR$ I;&#xA; 4 NEXT I&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Is it as easy to output the core or standard syntax to a screen, console, or window in modern-days languages? How best would I word such a question? And would this make a good challenge?&lt;/p&gt;&#xA;" OwnerUserId="61603" LastActivityDate="2017-12-20T14:48:23.483" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="14443" PostTypeId="1" CreationDate="2017-12-20T15:10:50.680" Score="7" ViewCount="320" Body="&lt;p&gt;What constitutes a trivial solution to a problem on this stack exchange? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should there be a different rule for different languages (e.g. one token for very esoteric languages like Jelly, or just a built in property for C#)?&lt;/p&gt;&#xA;" OwnerUserId="68917" LastEditorUserId="61563" LastEditDate="2017-12-23T01:30:46.147" LastActivityDate="2017-12-28T02:26:00.023" Title="What is a trivial solution?" Tags="|discussion|" AnswerCount="4" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14444" PostTypeId="2" ParentId="14443" CreationDate="2017-12-20T15:49:54.007" Score="2" Body="&lt;p&gt;I would say that a trivial solution is one that contains a &lt;strong&gt;single operator&lt;/strong&gt;, be that some wonderfully obscure character in Jelly/APL or a single word in Python/Rust. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;e.g. &quot;sort this array of numbers ascending&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;would result in trivial answers for most languages.&lt;/p&gt;&#xA;" OwnerUserId="69200" LastActivityDate="2017-12-20T15:49:54.007" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14445" PostTypeId="5" CreationDate="2017-12-20T16:45:52.390" Score="0" Body="&lt;p&gt;Questions with this tag should be about &lt;a href=&quot;https://codegolf.stackexchange.com/help/declined-flags&quot;&gt;declined flags&lt;/a&gt;, such as asking why a specific flag was declined, or asking how to deal with declined flags.&lt;/p&gt;&#xA;&lt;p&gt;You can see a list of your pending and declined flags at &lt;a href=&quot;https://codegolf.stackexchange.com/users/flag-summary/current&quot;&gt;&lt;code&gt;/users/flag-summary/current&lt;/code&gt;&lt;/a&gt;, or by navigating to your Activity on your profile and clicking &amp;quot;X helpful flags&amp;quot; on the right. Declined flags will have a message left by the moderator who handled them explaining why the flag was declined.&lt;/p&gt;&#xA;" OwnerUserId="-1" LastEditorUserId="66833" LastEditDate="2021-04-14T23:25:09.030" LastActivityDate="2021-04-14T23:25:09.030" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="14446" PostTypeId="4" CreationDate="2017-12-20T16:45:52.390" Score="0" Body="Questions about declined flags, or why a specific flag was declined." OwnerUserId="62402" LastEditorUserId="66833" LastEditDate="2021-04-13T21:29:37.420" LastActivityDate="2021-04-13T21:29:37.420" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="14447" PostTypeId="2" ParentId="14443" CreationDate="2017-12-20T17:05:44.650" Score="11" Body="&lt;p&gt;A Trivial answer is one where the language documentation alone identifies a construct in that language as solving the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although this remains somewhat ambiguous due to languages having different levels of detail and such in their official documentation, or where unofficial documentation is more useful, I believe it captures the important concept of &quot;trivial&quot; answers: that the poster doesn't demonstrate any &lt;strong&gt;understanding&lt;/strong&gt; of the language. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, suppose a challenge were to say &quot;Given a list of strings &lt;code&gt;A&lt;/code&gt; and a separator &lt;code&gt;B&lt;/code&gt; as inputs, output the elements in A with B inserted between each one&quot;. Just by reading the &lt;a href=&quot;https://github.com/DennisMitchell/jelly/wiki/Atoms&quot; rel=&quot;nofollow noreferrer&quot;&gt;wiki&lt;/a&gt; of what things are in Jelly, I could quickly guess that &lt;code&gt;j&lt;/code&gt; is probably a valid answer, despite not knowing anything about how to construct programs in Jelly. Similarly, by reading the .NET Framework specification, I could find that &lt;code&gt;System.String.Join&lt;/code&gt; would be an equally valid solution (as long as I indicated that the format for calling it is &lt;code&gt;System.String.Join(B,A)&lt;/code&gt;), and equally trivial because that's just exactly what that method is &lt;a href=&quot;https://docs.microsoft.com/en-us/dotnet/api/system.string.join?view=netframework-4.7&quot; rel=&quot;nofollow noreferrer&quot;&gt;defined to do&lt;/a&gt;. This also would require no actual knowledge or implementation beyond basic ability to comprehend the documentation and call methods. Now, these answers were particularly easy to find because the challenge I posed was a very common thing for languages to define, but any time that the solution posted to a challenge is &quot;Accomplish this challenge by using the language construct which is defined as solving the challenge&quot; I would call that trivial, even without defining what constitutes a &quot;built-in&quot; or &quot;single operator&quot;.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastActivityDate="2017-12-20T17:05:44.650" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="14449" PostTypeId="1" CreationDate="2017-12-20T20:08:36.090" Score="2" ViewCount="164" Body="&lt;p&gt;So, i have started creating a &lt;a href=&quot;https://github.com/hrrs01/rust-golfing-library&quot; rel=&quot;nofollow noreferrer&quot;&gt;golfing library&lt;/a&gt; for Rust, as i saw some questions about it &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10225/general-rules-for-custom-languages-and-libraries&quot;&gt;here&lt;/a&gt;, with some pretty good response. The usual requirement, was usually including the include statement in the byte count, and adding the library in the header of the answer. In Rust this, for me, leads to some other questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In Rust, with custom libraries, we usually have to do 3 things. &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;rustc &amp;lt;filename&amp;gt; --extern &amp;lt;name of crate&amp;gt;=&amp;lt;name of library file&amp;gt;.rlib&lt;/code&gt; Which essentially is giving an extra argument to the compiler, saying that we want to use the following library, under that specific crate name.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;extern crate &amp;lt;name of crate&amp;gt;;&lt;/code&gt; which makes it possible to access the library, from within the file in context.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;use &amp;lt;name of crate&amp;gt;::&amp;lt;name of function, or module&amp;gt;::&amp;lt;name of function, if inside module&amp;gt;&lt;/code&gt; which puts the code needed in scope.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;As you may have guessed, even with the shortest library names possible, and functions outside modules, this very quickly adds some bytes towards the answer if everything is included.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is where my question comes into play. What actually counts as the include statement? All 3 parts of it, 2. and 3., or just 3.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, some answers said that one should add command line parameters towards the byte count. Does this also go for compiler arguments?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thank you for all feedback, it would be great to have a good standard to live by. :)&lt;/p&gt;&#xA;" OwnerUserId="55458" LastEditorUserId="56656" LastEditDate="2017-12-21T09:31:09.670" LastActivityDate="2017-12-21T09:31:09.670" Title="Rust Golfing Crates" Tags="|discussion|scoring|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="14452" PostTypeId="1" CreationDate="2017-12-21T00:49:31.537" Score="7" ViewCount="321" Body="&lt;p&gt;Recently, an answer of Peter Taylor &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14437&quot;&gt;here&lt;/a&gt; says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;To get a macro equivalent to&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f(n){n=n?:1;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;you need&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-Df(n)=((n)?:1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;which is longer, so there's no point.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So are those criteria really necessary? Which of the following criteria should be satisfied:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Arguments must be put in parentheses.&lt;/li&gt;&#xA;&lt;li&gt;The function itself must be wrapped in parentheses (unless it's single token).&lt;/li&gt;&#xA;&lt;li&gt;The argument must be referenced exactly once.&lt;/li&gt;&#xA;&lt;li&gt;There should be a trailing newline (if use &lt;code&gt;#define&lt;/code&gt;) (because you can't put the code right after the macro, you need a trailing newline).&lt;/li&gt;&#xA;&lt;li&gt;If there are multiple statements there should be &lt;code&gt;if(1){...}else&lt;/code&gt; wrap or &lt;code&gt;do{...}while(0)&lt;/code&gt; wrap.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Real world macros satisfy all three of them (except some nonstandard ones (never used in production code), for example the macro defined by&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#define all(x) begin(x), end(x)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;. With this you can do some (weird?) trick such as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;sort(all(x))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;, which avoid duplication of &lt;code&gt;x&lt;/code&gt; in code - source: &lt;a href=&quot;https://stackoverflow.com/a/694554&quot;&gt;this&lt;/a&gt; or &lt;a href=&quot;https://www.topcoder.com/community/data-science/data-science-tutorials/power-up-c-with-the-standard-template-library-part-1/&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Should that be enforced?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Agree: That's the standard of C macro.&lt;/li&gt;&#xA;&lt;li&gt;Agree: That makes the macro more like a real &quot;function&quot;.&lt;/li&gt;&#xA;&lt;li&gt;Disagree: That may change a lot of existing submissions.&lt;/li&gt;&#xA;&lt;li&gt;Disagree: Even without that condition, we can call it with variables, and wrap the return value in parentheses. This is &quot;require more input than necessary&quot;.&lt;/li&gt;&#xA;&lt;li&gt;Disagree: That takes more bytes. (← should not be a problem)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="69850" LastEditorUserId="61563" LastEditDate="2017-12-28T01:38:27.437" LastActivityDate="2017-12-28T01:38:27.437" Title="What must a C macro do to be a valid answer?" Tags="|discussion|code-golf|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14454" PostTypeId="2" ParentId="14449" CreationDate="2017-12-21T09:29:27.740" Score="2" Body="&lt;h1&gt;Anything in the file counts&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In general (meaning with the rare expection if any) the score of an answer should be the size of the file used to store it.  This is nice and simple and easy to follow.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Wait does that mean command line flags are scored?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Maybe, maybe not.  The community seems to be in the middle of deciding whether or not to score command line arguments, as I &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14339/56656&quot;&gt;linked&lt;/a&gt; in the comments.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Personally, I have stopped scoring them myself, but I think right now that might be more of a personal choice then something the meta will tell you.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Ok now this might not be the answer you were looking for, as it stands you are going to have to lose a ton of bytes every time you want to use your library.  Here are my suggestions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Remember that you are not competing against other rust answers.  A language plus a custom library is a different language.  When I golf I'm almost always competing against myself, I think most of the fun is doing the best you can with the tools you have not necessarily beating others.  Just because your golfing library may have a permanent penalty doesn't mean that you can't have fun trying to make your answers shorter.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;That suggestion might not be the best, if you are still unsatisfied, here is a more concrete suggestion:&lt;/p&gt;&#xA;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;Make a &quot;new language&quot;.  Pietu1998 commented on something similar to this, but since every answer in &lt;strong&gt;rust + Håvard's golfing library&lt;/strong&gt; will have the same boiler plate you can just make a new language with a &quot;compiler&quot; that adds the boiler plate to whatever you feed it.  If you want to get really fancy you might modify the existing rust compiler so that it includes your functions by default.  This will prevent you from ever having to score those bytes.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;&lt;sup&gt;(I now see you commented something to this extent right before I finished this answer.  Hopefully that means this solution works for you.)&lt;/sup&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I hope that clarifies a few things and I hope that you can find a resolution that satisfies you.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-12-21T09:29:27.740" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14455" PostTypeId="2" ParentId="14452" CreationDate="2017-12-21T09:44:40.003" Score="5" Body="&lt;p&gt;As I see it this is quite simple: the default submission format is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2419/194&quot;&gt;program or function&lt;/a&gt;, including function-like constructs. Since C has functions, a function-like construct in C should be interchangeable with a function, so if there are expressions where substituting a valid function with the given macro would change the behaviour, the macro is not a valid answer.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2017-12-21T09:44:40.003" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="14456" PostTypeId="2" ParentId="14452" CreationDate="2017-12-21T16:07:15.657" Score="5" Body="&lt;h2&gt;It must work&lt;/h2&gt;&#xA;&lt;p&gt;I can't say I'm even moderately versed in this &amp;quot;C macro passed directly to the compiler&amp;quot; concept, but in code golf the main requirement for an answer to be valid is just that it defines a function or program which solves the challenge. We very much do NOT care about best practices as long as your compiler or interpreter doesn't enforce them.&lt;/p&gt;&#xA;&lt;p&gt;For example, in a comment you mention that the argument of the function should show up exactly once in the macro to avoid extra side effects that would cause different behavior compared to defining the function normally. Code golf doesn't care unless it causes problems for that exact challenge. Most of the time your inputs would be literal values with no side effects anyway. As long as the compiler doesn't complain and the &amp;quot;function&amp;quot; can be called and works, then it remains valid.&lt;/p&gt;&#xA;&lt;p&gt;Taking your example, the macro code seems to define a function (or function-like construct) &lt;code&gt;f(n)&lt;/code&gt;. If I want to call the function on a value &lt;code&gt;x&lt;/code&gt; inside a program, and then store the return value in a variable &lt;code&gt;y&lt;/code&gt;, I would write &lt;code&gt;y = f(x);&lt;/code&gt;. As long as the macro results in that line being valid and resulting in &lt;code&gt;y&lt;/code&gt; correctly containing the same result as any other valid answer would, then whatever &amp;quot;code&amp;quot; was passed to the compiler to define that &amp;quot;function&amp;quot; is a valid answer itself.&lt;/p&gt;&#xA;&lt;p&gt;One thing specifically though: I would probably NOT allow a function to be defined in a way that calling it requires &lt;code&gt;y = (f(x));&lt;/code&gt; instead. Those parentheses should be in the source code if they are needed for the function to work.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-12-21T16:07:15.657" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="14458" PostTypeId="2" ParentId="14443" CreationDate="2017-12-21T19:59:03.343" Score="3" Body="&lt;p&gt;A trivial solution is one where a language built-in (a feature provided by the language, rather than being written by the solution author) does the lion's share of the work towards solving a challenge. This is somewhat subjective, but it's hard to write an objective definition that covers all cases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some examples of trivial solutions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Using a built-in integer addition operator in a challenge to add two integer&lt;/li&gt;&#xA;&lt;li&gt;Using a built-in string repetition function in a challenge to repeat a string N times&lt;/li&gt;&#xA;&lt;li&gt;Using a built-in matrix determinant function in a challenge to compute the determinant of a matrix&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Some examples of non-trivial solutions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Using a built-in integer addition operator in a challenge to add two matrices&lt;/li&gt;&#xA;&lt;li&gt;Using a built-in string repetition function in a challenge to retrieve the &lt;code&gt;N % len(string)&lt;/code&gt;th character in a string&lt;/li&gt;&#xA;&lt;li&gt;Using a built-in matrix determinant function as part of input validation to compute the inverse of a matrix&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Of course, there are a wealth of possibilities not covered, and those that are not obvious will need to be considered on a case-by-case basis.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2017-12-21T19:59:03.343" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14459" PostTypeId="2" ParentId="14407" CreationDate="2017-12-21T21:27:46.897" Score="8" Body="&lt;h1&gt;Allow solutions to assume input will be within their language's bounds&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For example, if a language can't represent &lt;code&gt;2^-20 (~1.035264923841377504347788194211246)&lt;/code&gt; (where &lt;code&gt;^&lt;/code&gt; is exponentiation) as a floating-point number, with any settings set for the particular solution, then the solution can assume it won't be ever needed to be used. However, &lt;strong&gt;the &lt;em&gt;algorithm&lt;/em&gt; used must theoretically work for all possible inputs&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another example would be a division by zero that shouldn't happen because normally the divisor wouldn't be 0 but a float which got rounded to 0 because of bounds, or some digits of a float being rounded because of bounds.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, if the float is rounded because of your algorithm or such rounding is meant to be done in your language and isn't unintended, then your answer would be invalid, since the rounding would be part of your algorithm.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2017-12-22T10:49:53.443" LastActivityDate="2017-12-22T10:49:53.443" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14462" PostTypeId="2" ParentId="2140" CreationDate="2017-12-22T02:56:02.167" Score="0" Body="&lt;h1&gt;Sight Matrix&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I haven't seen this done anywhere yet after a couple of searches, so I might as well post this anyways. If you see this done somewhere else, please tell me and I will delete this post.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;The Story&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You are a two meter tall sniper fighting in a war-torn area. Your teams have just beaten back the enemy, but the guerillas have an annoying habit of hiding out of sight and waiting patiently to take your unit by surprise, often inflicting heavy casualties. You have been tasked with dealing with these guerillas as a sentry. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Task&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Summary&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write a program that, when given a n x n 2D matrix of heights (in meters), outputs a n x n 2D binary matrix with ones being areas that you can see and zeroes being areas that you cannot see.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input Format&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The input will be a two-dimensional array of heights and two numbers signifying where you are standing.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output Format&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The output will be a two-dimensional array of ones and zeroes: ones where you can see and zeroes where you can't see.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sample input/output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;code&gt;[[120,87,89,93,121],&#xA;  [120,91,83,91,114],&#xA;  [118,121,90,93,97],&#xA;  [124,129,115,120,101],&#xA;  [117,140,138,124,99]]&#xA;  0&#xA;  0&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;code&gt;[[1,1,1,1,1],&#xA;  [1,1,1,1,1],&#xA;  [1,1,1,1,1],&#xA;  [0,0,1,1,1],&#xA;  [0,0,0,0,1]]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Hint:&lt;/p&gt;&#xA;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;  &lt;p&gt; Last time I checked, people's eyes were on their head. Put that into account when you are writing your code.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;hr&gt;&#xA;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. Shortest answer in bytes wins. Standard loopholes apply.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note: this is my first foray into code-golf stackexchange. Please tell me how to improve this or things that I need to add to this answer.&lt;/p&gt;&#xA;" OwnerUserId="60169" LastActivityDate="2017-12-22T02:56:02.167" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14463" PostTypeId="1" CreationDate="2017-12-22T13:51:11.047" Score="10" ViewCount="195" Body="&lt;p&gt;Every time I post a question to the main site, it always seems there is something that I missed when posting it. How do I catch these issues?&lt;/p&gt;&#xA;" OwnerUserId="72190" LastEditorUserId="56656" LastEditDate="2017-12-23T06:28:11.683" LastActivityDate="2017-12-26T11:15:44.993" Title="How do I get better at writing questions?" Tags="|discussion|asking-questions|" AnswerCount="4" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14464" PostTypeId="2" ParentId="2140" CreationDate="2017-12-22T13:55:09.550" Score="0" Body="&lt;h1&gt;Output One More than Int Max  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your job is to create a program or function that will output a whole number (with no trailing decimal point) that is 1 greater than the max number an integer can hold for the language; more or less this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;MAX_INT + 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You are not allowed to use Strings in your solution. Any other type may be used.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Shortest answer in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note: I know this might be impossible in some languages. I have verified that it is possible in at least one (un-disclosed) language.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Notes on this puzzle&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I posted this puzzle recently &lt;a href=&quot;https://codegolf.stackexchange.com/questions/151495/output-one-more-then-int-max&quot;&gt;here&lt;/a&gt; and it promptly got closed and deleted (oops). Thankfully, @WheatWizard was kind enough to explain what some of the confusion was. Here where his comments:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I've voted to close this question as unclear. There are a couple of&#xA;  things I find especially unclear, 1) I'm not sure what &quot;the max number&#xA;  an integer can hold for the language&quot; means, it definitely needs a&#xA;  more concrete definition. It seems to presuppose some bounded&#xA;  &quot;integer&quot; type in the language. All the existing answers seem to&#xA;  suppose that long (or equivalent) is not this integer type but that is&#xA;  not at all clear from the question.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;2) The requirement &quot;You are not allowed to use strings in your&#xA;  solution&quot; is neither clear nor enforceable. Without a rigorous&#xA;  definition of string there is no way to determine what is a string or&#xA;  not. For example Prolog has a type called &quot;String&quot; but all real string&#xA;  manipulation is actually done on lists of char codes. Are those&#xA;  strings? Prolog also has atoms which behave a lot like strings in many&#xA;  ways, (and act like integers in others) are they strings?&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;The main thing I would want to see before retracting my close&#xA;  vote/voting to reopen is clear definitions of the terms in question.&#xA;  To be clear that is a very tall order. These terms are not going to be&#xA;  easy to define, let alone define well. I would recommend temporarily&#xA;  moving this question to the sandbox so that you can workshop it a bit.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;@Xcali said the following:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;To follow on @WheatWizard's comment, what about languages where&#xA;  there's really no type to a variable. For example, in Perl, any single&#xA;  value may be treated as a string or a number at any time&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;And @Adám:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;@CalebKleveter I think you can fix your challenge by removing the&#xA;  prohibition on strings and requiring documentation and/or additional&#xA;  supporting code showing that the produced number cannot be held as any&#xA;  type of integer. Do you want me to edit your post accordingly?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Are there any suggestions on how we could define the things pointed out in these comments? Are there any other issues that should be resolved?&lt;/p&gt;&#xA;" OwnerUserId="68374" LastEditorUserId="69850" LastEditDate="2017-12-22T14:09:30.590" LastActivityDate="2017-12-22T14:09:30.590" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14465" PostTypeId="2" ParentId="14463" CreationDate="2017-12-22T14:26:31.050" Score="15" Body="&lt;h1&gt;Use the sandbox&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Even for the most experienced challenges writers, catching all open questions and potential issues of a challenge can be difficult. That's what the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/12012&quot;&gt;Sandbox for Proposed Challenges&lt;/a&gt; is for: get help from the community to catch these things before going live on the main site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a rule of thumb, I saw that you used the sandbox once before, but sandboxing your challenge for less than two hours isn't terribly effective, as almost nobody will have seen it by then. I suggest waiting &lt;em&gt;at least&lt;/em&gt; until your proposal has dropped of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/12012&quot;&gt;the first page (sorted by activity)&lt;/a&gt; or until a week has passed, whichever happens earlier. &lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2017-12-22T14:26:31.050" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14466" PostTypeId="2" ParentId="14463" CreationDate="2017-12-22T15:16:05.450" Score="11" Body="&lt;h1&gt;Use the FAQs&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In addition to Dennis' answer to use the Sandbox, we also have two FAQs related to challenge writing --&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8047/42963&quot;&gt;Things to avoid when writing challenges&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5582/42963&quot;&gt;Things to consider when creating a challenge&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="42963" LastActivityDate="2017-12-22T15:16:05.450" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14467" PostTypeId="2" ParentId="2140" CreationDate="2017-12-22T16:18:01.347" Score="2" Body="&lt;h1&gt;Not-So-Simple Simplex&lt;/h1&gt;&#xA;&lt;p&gt;(Note: should I name it Complex Simplex?)&lt;/p&gt;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Simplex&quot; rel=&quot;nofollow noreferrer&quot;&gt;simplex&lt;/a&gt; is an n-dimensional analog of a triangle. Thus, a 3-dimensional simplex is a tetrahedron. We want to find the number of points with integer coordinates (lattice points) &lt;strong&gt;strictly on the interior&lt;/strong&gt; of this simplex. A point that lies on the boundary is not considered to be in the interior. For example, in a 2-dimensional simplex, any point on its perimeter is not an interior point. In a 3-dimensional simplex, any point on its surface area is not an interior point. In an &lt;code&gt;n&lt;/code&gt;-dimensional simplex, any point on its &lt;em&gt;surface&lt;/em&gt; &lt;code&gt;n-1&lt;/code&gt;&lt;em&gt;-volume&lt;/em&gt; is not an interior point.&lt;/p&gt;&#xA;&lt;p&gt;You are given &lt;code&gt;n + 1&lt;/code&gt; points, each with &lt;code&gt;n&lt;/code&gt; integral coordinates. You must output the number of integer points strictly in the interior of this simplex. &lt;strong&gt;The simplex is guaranteed to be non-degenerate, that is, it has strictly positive n-volume.&lt;/strong&gt; If I provide 4 points, for example, you can assume they do not all lie on the same plane.&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(0,0), (6,1), (2,5) -&amp;gt; 12 (see picture)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Hv7gZ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Hv7gZ.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(2,3),(5,2),(3,2) -&amp;gt; 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;More test cases coming when I actually write the program to solve this because drawing the picture of a 4-simplex is a nightmare..&lt;/p&gt;&#xA;" OwnerUserId="72190" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2017-12-22T16:18:01.347" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14471" PostTypeId="2" ParentId="14463" CreationDate="2017-12-23T03:40:23.337" Score="7" Body="&lt;h2&gt;Write more questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As it is with many things the best way to get better is to practice, and question writing is no exceptions.  Every time you make an error or a misstep you learn to avoid it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is a lot that other users can do to help you, in the sandbox, in chat and through the FAQs, but there is also a great value in getting the feel of a fun clear question.  Forming your own intuitions and systems for writing and proof reading questions can be extremely valuable.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Read more questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It's practically a cliche at this point, but they say that to become a better writer you ought to read more.  And I think this is true of questions as well.  Reading more questions will also help you build the same skills as writing questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This works especially well if you spend time to think about how the question works.  Here is my checklist for reading challenges&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Try the challenge.  Even if just a bit try the challenge to see how it feels when you are solving it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Form an opinion.  Do you like the challenge?  What parts do you like what parts do you think are bad?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Ask yourself &quot;How would I write this challenge?&quot;  You don't have to write up a whole draft but thinking about this can help you to get practice at writing challenges.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-12-23T03:40:23.337" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14477" PostTypeId="2" ParentId="14463" CreationDate="2017-12-26T11:15:44.993" Score="1" Body="&lt;p&gt;I would agree with all of the sandbox suggestions and would add to leave your challenge there until there is at least some feedback. May be 2 days or may be a month. There is no rush to put the challenge live and waiting and getting it right can save a lot of downvotes. There is no rule that says we have to go to the sandbox and give feedback but many of the more experienced members have helped me there with previous challenges. I thank them for that. I have also written (not particularly golfed) reference implementations for all of mine. This helps me understand any ambiguities in what I am asking. Works for me and hopefully will help you too.&lt;/p&gt;&#xA;" OwnerUserId="56555" LastActivityDate="2017-12-26T11:15:44.993" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14481" PostTypeId="1" CreationDate="2017-12-26T23:08:29.307" Score="3" ViewCount="160" Body="&lt;p&gt;Currently we have two tags &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/linear-algebra&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;linear-algebra&amp;#39;&quot; rel=&quot;tag&quot;&gt;linear-algebra&lt;/a&gt;.  These tags have a rather large overlap, in fact (after a clean up) of the 30 questions tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/linear-algebra&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;linear-algebra&amp;#39;&quot; rel=&quot;tag&quot;&gt;linear-algebra&lt;/a&gt; the following are the questions &lt;em&gt;not&lt;/em&gt; tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/105362/arnolds-cat-map&quot;&gt;Arnold&amp;#39;s Cat Map&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/81046/self-referential-polynomials&quot;&gt;Self Referential Polynomials&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/78079/linear-independence&quot;&gt;Linear Independence&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/76121/solve-a-linear-equation&quot;&gt;Solve a Linear Equation&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/70506/find-the-cross-product&quot;&gt;Find the Cross Product&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And all of these questions are not about matrices, (however some do have methods of solution that involve matrices.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt;, has about 100 questions with only 25 of them being tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/linear-algebra&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;linear-algebra&amp;#39;&quot; rel=&quot;tag&quot;&gt;linear-algebra&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should one of these tags be a synonym of the other?  If so which one?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2017-12-27T02:18:07.507" Title="Matrix vs. Linear Algebra" Tags="|discussion|tags|tag-synonyms|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14482" PostTypeId="2" ParentId="14481" CreationDate="2017-12-27T02:18:07.507" Score="15" Body="&lt;h2&gt;Keep them separate&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A good number of the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt; challenges are about grids of numbers that do not represent any linear transformation. Conversely, the five &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/linear-algebra&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;linear-algebra&amp;#39;&quot; rel=&quot;tag&quot;&gt;linear-algebra&lt;/a&gt; challenges you note do not involve matrices, but are about vectorspaces, independence, abstract transformations, etc. Though these are a minority, I think it would not be accurate to tag them &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt;. So, I just suggest not making them synonyms, and using both tags where both apply.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2017-12-27T02:18:07.507" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14483" PostTypeId="2" ParentId="2140" CreationDate="2017-12-27T03:15:03.933" Score="1" Body="&lt;h1&gt;Squeeze Out a Square Quine&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;...the bigger the better.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Task&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write a full program that is a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4878/61405&quot;&gt;proper quine&lt;/a&gt; (a piece of&#xA;code that outputs itself without reading its source code). To make things more difficult, your code (and obviously&#xA;the output) has to be in a form of a square, meaning that your code must consist of &lt;code&gt;n&lt;/code&gt; lines of length &lt;code&gt;n&lt;/code&gt; (not&#xA;counting the newline to the line length).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your answer's score will be &lt;code&gt;n&lt;/code&gt;, the side length of the square. &lt;strong&gt;The largest square quine wins.&lt;/strong&gt; To avoid&#xA;answers being padded to create arbitrarily large squares, your code must fail to be a proper quine if any single&#xA;non-newline character is replaced by some other character that appears in the code. There must be, at minimum, two different non-newline characters in the code.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;For example, if your code was...&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abc&#xA;def&#xA;ghi&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;...and would output itself, your answer would be valid and its score would be &lt;code&gt;3&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A single trailing newline in the output is allowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="61405" LastActivityDate="2017-12-27T03:15:03.933" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="14484" PostTypeId="2" ParentId="2140" CreationDate="2017-12-27T03:17:06.973" Score="2" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Note&lt;/strong&gt;:&#xA;  Please leave an upvote if you think the challenge idea is good and is clear, a downvote if you think the challenge idea is bad, and comment if you can't understand the challenge. Last time I asked on TNB 2 users told me that they can't understand anything.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Golf a return-oriented code generator!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Return-oriented programming (ROP) is a computer security exploit technique that allows an attacker to execute code in the presence of security defenses such as non-executable memory (W xor X technique) and code signing. (from &lt;a href=&quot;https://en.wikipedia.org/wiki/Return-oriented_programming&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you should write a program, that takes the code of the existing program and the required code, and output the stack necessary to execute that program.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; apply, as usual.&lt;/li&gt;&#xA;&lt;li&gt;How the machine works&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;At first, IP is equal to the top of the stack, and the top of the stack is popped.&lt;/li&gt;&#xA;&lt;li&gt;For each clock cycle (whatever it means), the command at the position of IP is executed, and the IP is advanced if the command does not modify IP.&lt;/li&gt;&#xA;&lt;li&gt;The behavior if the IP is at the last instruction and that instruction does not modify IP is undefined.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Assembly instructions&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All commands are case insensitive.&lt;/li&gt;&#xA;&lt;li&gt;Note: There is nothing that guarantees commands must be 3 characters long, or limited to some sets. After all, this is not real assembly. However:&lt;/li&gt;&#xA;&lt;li&gt;You can assume that all the characters are in the English alphabet, uppercase or lowercase.&lt;/li&gt;&#xA;&lt;li&gt;There may be some other commands &quot;similar but not the same&quot; with &lt;code&gt;ret&lt;/code&gt;, so checking for the first character or the SHA256 hash won't work.&lt;/li&gt;&#xA;&lt;li&gt;The special command &lt;code&gt;ret&lt;/code&gt; will pop the value on the top of the stack, and set the instruction pointer &lt;code&gt;IP&lt;/code&gt; to that value.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that all the other commands won't modify the stack, or the IP.&lt;/li&gt;&#xA;&lt;li&gt;The &quot;existing program&quot; and &quot;required code&quot; will be represented as a string, separated by newline characters (you may optionally take a list of strings as input).&lt;/li&gt;&#xA;&lt;li&gt;The required code will never contains &lt;code&gt;ret&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The output should be a stack of line-numbers in appropriate format (list of numbers - may be reversed, array of numbers, etc.)&lt;/li&gt;&#xA;&lt;li&gt;The command executed right after the last command in the &quot;required code&quot; must be a &lt;code&gt;ret&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Because the memory of the machine is limited, you should output the shortest possible stack. If there are multiple shortest stack, output any.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;You may assume that there exists an output.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example test cases:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Existing program:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1:  add eax, ebx&#xA;2:  lea eax, [2*eax+4*ecx]&#xA;3:  ret&#xA;4:  mov eax, ebx&#xA;5:  xch ecx, eax&#xA;6:  ret&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(the line numbers are just for demonstration purposes. They are not included in the input, you can use 0-indexing or 1-indexing)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(disclaimer: this is not real assembly, just for demonstration purposes)&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Required code:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;lea eax, [2*eax+4*ecx]&#xA;xch ecx, eax&#xA;mov eax, ebx&#xA;xch ecx, eax&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In that case, you should output &lt;code&gt;[2, 5, 4]&lt;/code&gt; (&lt;code&gt;2&lt;/code&gt; is at the top of the stack), because if the stack have that value, then:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;First, &lt;code&gt;IP = 2&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The commands&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2:  lea eax, [2*eax+4*ecx]&#xA;3:  ret&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;are executed.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;On executing &lt;code&gt;ret&lt;/code&gt;, the &lt;code&gt;IP&lt;/code&gt; get the value &lt;code&gt;5&lt;/code&gt;. Then, the commands&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;5:  xch ecx, eax&#xA;6:  ret&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;are executed.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Then, similarly, when the next &lt;code&gt;ret&lt;/code&gt; is executed, the value &lt;code&gt;4&lt;/code&gt; is popped from the stack, and commands&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4:  mov eax, ebx&#xA;5:  xch ecx, eax&#xA;6:  ret&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;are executed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, the commands executed (apart from &lt;code&gt;ret&lt;/code&gt;) are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2:  lea eax, [2*eax+4*ecx]&#xA;5:  xch ecx, eax&#xA;4:  mov eax, ebx&#xA;5:  xch ecx, eax&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which is equal to the &quot;required code&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winning criteria&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, shortest code in bytes win!&lt;/p&gt;&#xA;" OwnerUserId="69850" LastEditorUserId="69850" LastEditDate="2018-01-29T14:50:53.740" LastActivityDate="2018-01-29T14:50:53.740" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14485" PostTypeId="2" ParentId="14443" CreationDate="2017-12-27T05:33:13.197" Score="2" Body="&lt;p&gt;The problem with some of the answers I see here is that they fail to address the problem of an answer being solved multiple built-ins. For example, in a challenge to &quot;sum the prime factors of a number&quot;, the Haskell answer &lt;code&gt;sum.primeFactors&lt;/code&gt; (let's pretend &lt;code&gt;primeFactors&lt;/code&gt; is a Prelude function here) should be considered trivial, even though it technically consists of three builtins: &lt;code&gt;sum&lt;/code&gt;, &lt;code&gt;primeFactors&lt;/code&gt;, and &lt;code&gt;(.)&lt;/code&gt; (function composition).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another issue is that even when a challenge can be solved in a single builtin, that does not always mean that the answer is trivial. For example, I'd argue &lt;a href=&quot;https://codegolf.stackexchange.com/a/79617/61384&quot;&gt;this answer&lt;/a&gt; is not trivial, since it involves clever use of a builtin that is not immediately obvious.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As such, here's my slightly more clunky definition that hopes to cover these cases:&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;A trivial solution is one that consists mainly of builtin operations or idiomatic combinations of builtin operations that are obviously relevant to the challenge and that solve a significant portion of it, along with minimal &quot;wrapper&quot; or &quot;padding&quot; builtins.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;To clarify a few things:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;By &quot;builtin&quot; I mean any operation pre-defined by the language implementation, including anything from standard libraries, etc.&lt;/li&gt;&#xA;&lt;li&gt;By &quot;idiomatic combination&quot; I mean a very common pattern, such as &lt;code&gt;:+&lt;/code&gt; (fold-with addition) which is used to compute the sum of an array in CJam.&lt;/li&gt;&#xA;&lt;li&gt;Minimal wrappers and padding builtins include input and output, function composition, etc. What is a &quot;wrapper&quot; or &quot;padding&quot; varies from answer to answer, because common builtins can still be used in clever ways (e.g. using &lt;code&gt;,&lt;/code&gt; to zero a cell in BF). In a Haskell submission like &lt;code&gt;putStrLn=&amp;lt;&amp;lt;getLine&lt;/code&gt;, &lt;code&gt;(=&amp;lt;&amp;lt;)&lt;/code&gt; would be considered a padding builtin, whereas in a submission like &lt;a href=&quot;https://codegolf.stackexchange.com/a/144402/61384&quot;&gt;this&lt;/a&gt; it would not.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="61384" LastEditDate="2017-12-28T02:26:00.023" LastActivityDate="2017-12-28T02:26:00.023" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14489" PostTypeId="1" CreationDate="2017-12-28T05:37:46.387" Score="-1" ViewCount="76" Body="&lt;p&gt;Consider an example challenge:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Given a number &lt;code&gt;b&lt;/code&gt; and an array &lt;code&gt;a&lt;/code&gt;, output the &lt;code&gt;b&lt;/code&gt;th element of the array &lt;code&gt;a&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In this case, when requiring input in JavaScript, we need an array and a number as input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The usual (accepted) function input method are &lt;code&gt;(a,b)=&amp;gt;a[b]&lt;/code&gt; or &lt;code&gt;a=&amp;gt;b=&amp;gt;a[b]&lt;/code&gt;, but can I require to input the array &lt;code&gt;a&lt;/code&gt; with extra property &lt;code&gt;b&lt;/code&gt;, which is constructed by&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a=[1,2,3]; a.b=2;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and the submission is &lt;code&gt;a=&amp;gt;a[a.b]&lt;/code&gt; ?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If that's allowed, does it increase the byte-count?&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="69850" LastEditDate="2017-12-28T10:59:05.130" LastActivityDate="2017-12-28T11:06:50.607" Title="Requiring an objectly array in JavaScript" Tags="|discussion|code-golf|scoring|" AnswerCount="1" CommentCount="0" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14490" PostTypeId="2" ParentId="11737" CreationDate="2017-12-28T05:50:28.070" Score="1" Body="&lt;h1&gt;For pure length comparing, if you can remove some chars make it still work, it's not allowed&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x+x+x+x allowed&#xA;x+x-x   not allowed as x work&#xA;var a,aa,aaa,aaaa&#xA;        allowed in this rule, but there may be other ones&#xA;numberOfCharacters(&quot;abcdefghijklmnopqrstuvwxyz&quot;)-24&#xA;        not allowed as 2 or numberOfCharacters(&quot;ab&quot;) work&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2017-12-28T05:50:28.070" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14492" PostTypeId="2" ParentId="14489" CreationDate="2017-12-28T11:06:50.607" Score="3" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The example challenge requires &quot;an array&quot; and &quot;a number&quot;. The &quot;modified array&quot; is not strictly an array.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, passing a dictionary-like object (&lt;code&gt;{a: [1, 2, 3], b: 2}&lt;/code&gt;) is valid.&lt;/p&gt;&#xA;" OwnerUserId="69850" LastActivityDate="2017-12-28T11:06:50.607" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14495" PostTypeId="1" CreationDate="2017-12-29T19:00:14.987" Score="28" ViewCount="479" Body="&lt;p&gt;I know there's a desire on PPCG for challenges to be flexible in terms of what they allow for input and output. However, I think there is an argument to be made that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; is a special case, and should be stricter about the permitted output formats.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a case in point, there was a recent &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; challenge that involved outputting dominoes. In the challenge description, the sample output looked something like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;    o|o   o&#xA;     |  o  &#xA;o    |o   o&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The top answer, at the time of writing, was returning output like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[[False, False, True], [False, 0, False], [True, False, False]], [[True, False, True], [False, 1, False], [True, False, True]]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I find it hard to believe that anyone looking at that could honestly describe it as ASCII art! The second most upvoted answer is a little better, but not by much.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now I don't mean to criticise these answers, because the challenge made it quite clear that that sort of output was considered acceptable. But what I'm proposing, is that maybe in the future we should be discouraging challenge authors from being so lenient in what they accept, assuming the question is tagged as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for what exactly should be permitted, at the very least I'd expect the output to include the actual characters of the artwork that was specified in the challenge. Outputting to stdout, displayed on screen, or returning a string (typically newline-separated) all seem OK to me. Returning an array of strings, or an array of characters, feels perhaps like it's getting too lenient again.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But that's the point of this question: what is the consensus on output formats that should be allowed for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="62101" LastActivityDate="2018-01-08T17:55:04.017" Title="ASCII Art Output Rules" Tags="|discussion|policy|rules|" AnswerCount="4" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14497" PostTypeId="2" ParentId="2140" CreationDate="2017-12-30T06:42:36.587" Score="0" Body="&lt;p&gt;&lt;strong&gt;Als pr Yrck, I knw hm Hrtio&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is a link to a text file containing the script for Shakespeare's Hamlet.&lt;sup&gt;[to do: provide such a text file, or think of another freely available text input that leads to a wittier title.]&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a program that will compress this text, and another that will decompress it to return exactly the original file. Your score is given by &lt;code&gt;C + D + 0.5*F&lt;/code&gt;, where &lt;code&gt;C&lt;/code&gt; is the size of your compression program, &lt;code&gt;D&lt;/code&gt; is the size of your decompression program, and &lt;code&gt;F&lt;/code&gt; is the size of the file that your compression program generates, all measured in bytes. The smallest score wins. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Further particulars&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your compression program should take &lt;code&gt;hamlet.txt&lt;/code&gt; as input and produce a single file as output, which is to be given as input to your decompression program. You should make sure that the resulting output from your decompression program is identical to the original &lt;code&gt;hamlet.txt&lt;/code&gt; file, e.g.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; myCompressor hamlet.txt &amp;gt; compressed&#xA;&amp;gt; myDecompressor compressed &amp;gt; output.txt&#xA;&amp;gt; diff hamlet.txt output.txt&#xA;[no output from diff command means they are identical]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your programs' only purpose is to compress and decompress the &lt;code&gt;hamlet.txt&lt;/code&gt; file - their behaviour on any other input is not part of the challenge. It's fine, for example, if the decompressor always outputs the text of Hamlet regardless of the original input, or if the compressor crashes on any input besides &lt;code&gt;hamlet.txt&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input and output can be by file I/O or STDIN/STDOUT or any other reasonable method, but the compressor and decompressor should be full programs. They need not be written in the same language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your compressor and decompressor must each be completely self-contained. Each must consist of a single file, and that file must be the source code for a programming language as defined &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2028/what-are-programming-languages/2073#2073&quot;&gt;here&lt;/a&gt;. With the exception of importing libraries, your compressor and decompressor must not open any other files besides their input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The compressed file may be a text file or a binary file - the only thing that matters is its size in bytes. No information may be transmitted from the compressor to the decompressor by any means other than the content of this file.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may not use any libraries or built-ins that implement data compression algorithms, such as &lt;code&gt;gzip&lt;/code&gt; or &lt;code&gt;bz2&lt;/code&gt;, or their corresponding decompression algorithms. This restriction only applies to &quot;off the shelf&quot; implementations - you can use any algorithm you like if you implement it yourself. For details on what counts as a data compression algorithm, see note 1. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If for some reason your language or libraries include a feature that outputs some or all of the text of Hamlet, you may not use that feature.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although it's not part of the challenge, you are encouraged to explain/demonstrate what happens when your compressor is given some other input besides &lt;code&gt;hamlet.txt&lt;/code&gt;, especially if it does something interesting such as produce a garbled Shakespearean version of the input text.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;strong&gt;Note 1:&lt;/strong&gt; For the purpose of this challenge, a data compression algorithm is anything listed in Wikipedia's &lt;a href=&quot;https://en.wikipedia.org/wiki/Category:Lossless_compression_algorithms&quot; rel=&quot;nofollow noreferrer&quot;&gt;Category:Lossless Compression Algorithms&lt;/a&gt; or &lt;a href=&quot;https://en.wikipedia.org/wiki/Category:Lossy_compression_algorithms&quot; rel=&quot;nofollow noreferrer&quot;&gt;Category:Lossy Compression Algorithms&lt;/a&gt;, or any of their subcategories. Note that these lists can change over time, and if Wikipedia's editors will allow a new item to be added then that will count as a compression algorithm, even if that happens after an answer using it is posted. This is to prevent the use of obscure algorithms that are not yet listed on Wikipedia. Editing Wikipedia to get around the restriction on off-the-shelf compression is not allowed.&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;This rule is intended to prevent the use of existing algorithms while allowing all other language features and built-ins. It may be the case that some items on the Wikipedia list are overly broad and end up banning common language features. If this is the case I will add exceptions on a case-by-case basis. This will only be used to permit things that would otherwise be banned, so it won't invalidate existing answers.&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Sandbox note:&lt;/strong&gt; the really tricky thing here is how to prevent trivial solutions that just wrap an existing compression algorithm, without also banning common language features. The above Wikipedia-based definition of a compression algorithm is a bit experimental and I'd welcome feedback on it. My intention is to prevent trivial solutions that just wrap an existing implementation of a compression algorithm, while allowing pretty much anything else.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Another possible approach is simply to allow anything and hope that answers specialised to the input can achieve better scores. That's effectively what I did in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69930/paint-starry-night-objectively-in-1kb-of-code&quot;&gt;Paint Starry Night&lt;/a&gt;, but in the end I wish I hadn't, because it turned out that (so far at least) even really clever solutions based on neural nets and genetic algorithms can't come close to the off-the-shelf BPG algorithm. That's the sort of situation I want to avoid for this challenge.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="21034" LastEditorUserId="21034" LastEditDate="2017-12-31T07:04:05.030" LastActivityDate="2017-12-31T07:04:05.030" CommentCount="30" ContentLicense="CC BY-SA 3.0" />
  <row Id="14500" PostTypeId="1" CreationDate="2017-12-31T07:33:22.723" Score="8" ViewCount="248" Body="&lt;p&gt;I am working on a new challenge (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14497/21034&quot;&gt;sandbox link&lt;/a&gt;) that has something in common with my old challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69930/paint-starry-night-objectively-in-1kb-of-code&quot;&gt;Paint Starry Night&lt;/a&gt;. In these challenges the goal is essentially to design a compression algorithm tailored to a particular input. (For the new challenge the input is text rather than an image.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In Paint Starry Night the most competitive answers simply wrapped an existing image compression format such as FLIF or BPG. These answers are (to me) less interesting than some of the others, which did really clever things with genetic algorithms and deep neural networks. For the new challenge I would like to include a rule against such off-the-shelf implementations of compression algorithms, while still leaving a level playing field for all other approaches.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question is on the right way to do this --- in short, where and how to draw the line between compression routines like bz2 or gzip, versus language features like Python's base conversion or Jelly's dictionary lookup feature, both of which I think should be allowed. The things I want to avoid are (i) that people come up with loopholes that allow them to produce trivial solutions that wrap existing algorithms, or (ii) I accidentally ban perfectly sensible language features that could be used to build a non-trivial solution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The sandbox link above has (at the time of writing) a possible way to do this based on what Wikipedia's editors list as compression algorithms, but I am not really sure if this is a good idea. Hence I would like to ask for feedback on it, and/or other suggestions of how to define off-the-shelf compression algorithms for the purposes of this kind of challenge.&lt;/p&gt;&#xA;" OwnerUserId="21034" LastEditorUserId="21034" LastEditDate="2018-01-01T02:29:43.700" LastActivityDate="2018-01-01T02:29:43.700" Title="What should count as a compression algorithm?" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14502" PostTypeId="2" ParentId="14500" CreationDate="2017-12-31T11:06:25.220" Score="12" Body="&lt;h1&gt;It's unrealistic to define this&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You have summed up well the reasons that banning certain algorithms will cause problems (whether you ban too many or too few). I don't expect anyone to come up with a clean solution to this that won't cause other problems. If an existing compression algorithm happens to be better than any the contestants can come up with, then their striving towards the best approach will lead some of them to converge on their own implementations of those existing algorithms. Banning an algorithm that people will naturally converge on seems to create an unavoidable grey area.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Observable rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As has been pointed out elsewhere in similar discussions, it's problematic to try to ban implementation approaches. To keep the rules objective, it's generally better to define them in terms of inputs and outputs, instead of in terms of the internal workings of the code. This has been described elsewhere as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10002/20283&quot;&gt;avoiding making rules about unobservable behaviour&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Seek the weaknesses of existing algorithms&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;So I recommend approaching this problem from a different direction. Instead of taking an input that is best compressed with existing algorithms, and trying to carefully ban those algorithms without banning too much, try to find an input or category of inputs that existing algorithms are not the best approach to. Then you don't need to ban them. Early answers may involve existing algorithms, which may not seem as innovative, but later answers will show custom algorithms that suit the specific input types better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This will be a difficult task, as there are a variety of compression algorithms available that are suited to different input types, but I still think this will be more realistic than trying to find an objective way to ban only some algorithms.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2017-12-31T11:06:25.220" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="14503" PostTypeId="2" ParentId="14495" CreationDate="2017-12-31T11:37:25.520" Score="-4" Body="&lt;h1&gt;A 2D array can be treated as an ASCII output, if each contain one character, and joining the inner layer then join the outer layer with delimeter '\n'&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For the &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[[False, False, True], [False, 0, False], [True, False, False]], [[True, False, True], [False, 1, False], [True, False, True]]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;guy it's too far: containment are boolean, and it's a 3D array rather than a 2D one&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Returning&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[0, 0, 1, 9, 1, 0, 1],&#xA; [0, 0, 0, 9, 0, 1, 0],&#xA; [1, 0, 0, 9, 1, 0, 1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is acceptable if challenge allow any symbol&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2017-12-31T11:37:25.520" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14507" PostTypeId="2" ParentId="5243" CreationDate="2018-01-01T03:16:34.197" Score="4" Body="&lt;h1&gt;400 reputation for an answer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69930/paint-starry-night-objectively-in-1kb-of-code&quot;&gt;Paint Starry Night&lt;/a&gt; that takes top place without built-in compression&lt;/h1&gt;&#xA;&lt;p&gt;The bounty will be awarded to the first answer that takes first place (i.e. lowest score) without using an off-the-shelf compression routine. I'll award it even if it's immediately beaten by another answer. Currently the score to beat is 4159.06.&lt;/p&gt;&#xA;" OwnerUserId="21034" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-01T03:16:34.197" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14511" PostTypeId="1" CreationDate="2018-01-02T16:05:40.623" Score="28" ViewCount="925" Body="&lt;p&gt;Last year &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11186/cast-your-vote-for-best-of-ppcg-2016&quot;&gt;we voted for the best posts of 2016&lt;/a&gt; and rewarded them with bounties and challenges. I think it's a great way to reward and draw attention to some of the best content the community has created throughout the year, so let's do that again. (And hopefully, this year, we'll be able to sort everything out before half a year has passed.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First off, we'll need categories again, which you can nominate here. Each answer should contain a category for a challenge or answer to be rewarded. The top-voted categories will then receive separate nomination posts to find the actual winners. Like last year, I'm not going to state a fixed number of categories that will make it, but it's probably going to be between 5 and 10 again (last year, we went with 10 categories).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Feel free to resubmit &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10938/best-of-ppcg-2016-call-for-categories&quot;&gt;proposals from last year&lt;/a&gt; regardless of whether they were among the final 10 or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Voting will last for two weeks&lt;s&gt;, so that we can start nominating posts in the top categories right when the new year starts&lt;/s&gt; ¯\_(ツ)_/¯.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Offered Bounties&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As a further note, we'll need reputation rewards again, so if you're willing to spend some of your reputation on a bounty for one of the winners, edit your name into this list to indicate that you're willing.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Four 500 rep bounties offered by&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/u/43319&quot;&gt;Adám&lt;/a&gt; &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Two 500 rep bounties offered by&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/u/59376&quot;&gt;Magic Octopus Urn&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/u/8478&quot;&gt;Martin Ender&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/u/71256&quot;&gt;H.PWiz&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/u/68615&quot;&gt;totallyhuman&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;One 500 rep bounty offered by&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/u/56656&quot;&gt;Wheat Wizard&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/u/42963&quot;&gt;AdmBorkBork&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/u/36398&quot;&gt;Luis Mendo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/u/45941&quot;&gt;Mego&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/u/41805&quot;&gt;Cows quack&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/u/67312&quot;&gt;Giuseppe&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/u/41024&quot;&gt;Erik the Outgolfer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/u/59487/&quot;&gt;Mr. Xcoder&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="60042" LastEditorUserId="59376" LastEditDate="2018-01-24T20:50:53.077" LastActivityDate="2018-01-24T20:50:53.077" Title="Best of PPCG 2017 — Call for Categories" Tags="|discussion|best-of|" AnswerCount="14" CommentCount="6" ClosedDate="2018-01-18T16:26:55.013" ContentLicense="CC BY-SA 3.0" />
  <row Id="14512" PostTypeId="2" ParentId="14511" CreationDate="2018-01-02T16:07:48.323" Score="30" Body="&lt;h1&gt;Best Explanation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This category is for the answer with the best explanation accompanying it. Ideally, the winner will be an answer with a very detailed explanation that is accessible to anyone, regardless of the amount of relevant knowledge already possessed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Taken from the last year's category nominations, initial proposer &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10940/59487&quot;&gt;Mego&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="60042" LastEditDate="2018-01-18T16:21:05.397" LastActivityDate="2018-01-18T16:21:05.397" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14513" PostTypeId="2" ParentId="14511" CreationDate="2018-01-02T16:09:41.813" Score="-2" Body="&lt;h1&gt;King of the King of the Hills&lt;/h1&gt;&#xA;&lt;p&gt;This category is for the best &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenge in terms of detail where  a lot of effort was put into creating it and it has resulted in an amazing challenge with many possibilities.&lt;/p&gt;&#xA;" OwnerUserId="41805" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-02T16:09:41.813" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14515" PostTypeId="2" ParentId="14511" CreationDate="2018-01-02T16:19:13.950" Score="17" Body="&lt;h1&gt;Best Above-and-Beyond Answer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Every once in a while, an answer takes the challenge to the extreme. This prize will be awarded to an answer which went far beyond the expectations of the challenge. This could include&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a code golf answer that brute-forced/proved the shortest program in some language&lt;/li&gt;&#xA;&lt;li&gt;a graphical-output popcon answer of extreme size and quality&lt;/li&gt;&#xA;&lt;li&gt;a KOTH answer of high complexity which absolutely dominated the competition&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This category was featured in both Best of 2015 and Best of 2016.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2018-01-02T16:19:13.950" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14516" PostTypeId="2" ParentId="14511" CreationDate="2018-01-02T16:19:57.560" Score="18" Body="&lt;h1&gt;Rookie of the Year - Challenges&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For the best challenge written by someone who has not written a challenge prior to 2017 (i.e., not necessarily a new user, just a new challenge writer).&lt;/p&gt;&#xA;" OwnerUserId="42963" LastActivityDate="2018-01-02T16:19:57.560" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14517" PostTypeId="2" ParentId="14511" CreationDate="2018-01-02T16:21:11.307" Score="29" Body="&lt;h1&gt;Best use of the wrong language for the job&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This category is for an exemplary answer written in a language that was not adequately equipped to solve the challenge.&lt;/p&gt;&#xA;" OwnerUserId="51785" LastActivityDate="2018-01-02T16:21:11.307" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14518" PostTypeId="2" ParentId="14511" CreationDate="2018-01-02T16:22:16.020" Score="26" Body="&lt;h1&gt;Rookie of the Year - Answers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For the best answer by someone who hasn't submitted an answer prior to 2017 (i.e., not necessarily a new user, but just someone who's a new answer writer).&lt;/p&gt;&#xA;" OwnerUserId="42963" LastActivityDate="2018-01-02T16:22:16.020" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14520" PostTypeId="2" ParentId="14511" CreationDate="2018-01-02T16:26:39.093" Score="22" Body="&lt;h1&gt;The student becomes the master (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This category aims to reward an answer that fulfils the following conditions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The poster is &lt;em&gt;not&lt;/em&gt; the creator of the language, and the code has byte count &lt;em&gt;N&lt;/em&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The creator of the language already submitted an answer, with byte count &lt;em&gt;M&lt;/em&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;And finally &lt;em&gt;N &amp;lt; M&lt;/em&gt;, but the restriction is that no language features used  have been added in the meantime.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="59487" LastEditDate="2018-01-05T09:55:04.220" LastActivityDate="2018-01-05T09:55:04.220" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14521" PostTypeId="2" ParentId="14511" CreationDate="2018-01-02T16:27:39.450" Score="10" Body="&lt;h2&gt;SGITW (Slowest Gun in the West)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For the best 2017 answer in a challenge which received no answers within 48 hours of posting. The challenge itself does not need to be from 2017 and the nominated answer doesn't need to be the first answer to the challenge, but the first answer to the challenge does need to be from 2017. Tips questions are not counted for this category.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's very easy to get drawn to the fast-rising HNQ-hitting questions with a plethora of answers, so I thought this would be a good way to bring attention to answers that really needed to earn their love.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;SEDE query: &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/776856/48-hour-gap&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://data.stackexchange.com/codegolf/query/776856/48-hour-gap&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This category originally created &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10988/2867&quot;&gt;by Sp3000&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2018-01-02T16:27:39.450" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14522" PostTypeId="2" ParentId="14511" CreationDate="2018-01-02T16:35:12.953" Score="24" Body="&lt;h1&gt;Best mathematical insight&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;On this site we often see answers in languages specifically designed for short code, or designed to be fast. Sometimes, a nice golfing trick or speed-up technique surprises us with its ingenuity, beyond the standard use of that language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And occasionally an answer shows up that uses an unexpected approach to greatly simplify the problem, and makes us wonder how the author could ever think of that. This usually involves some far-from-obvious mathematical equivalence, or a particularly simple approach to the problem that was not evident at all (once revealed, other answers often follow the same approach).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This category is for the answer with the best &lt;strong&gt;mathematical&lt;/strong&gt; insight or unexpected approach that led to greatly simplifying the problem, in &lt;strong&gt;any challenge type&lt;/strong&gt; (code golf, fastest code, or others). The insight should have led to a significant improvement according to the challenge's metric (code length, run time, or whatever applicable).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10950/59487&quot;&gt;Initially posted in 2016 by Luis Mendo&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastActivityDate="2018-01-02T16:35:12.953" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14523" PostTypeId="2" ParentId="14511" CreationDate="2018-01-02T17:37:00.863" Score="9" Body="&lt;h2&gt;Pro tip&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Best answer to any &lt;em&gt;general&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question. That is, candidates should be drawn from &quot;Tips for golfing in X&quot; questions (as opposed to specific &quot;how do I shorten this piece of code&quot; questions).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some of the most useful content that we generate for other golfers is in our tips questions, so it would be nice to reward an exceptional golfing trick this way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Candidates should be tips which show deep insight into the language, yet are applicable in wide range of situations. The exact amounts of bytes saved by the tip is not relevant.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Copied from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10939/56656&quot;&gt;Martin Ender's answer last year&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2018-01-02T17:37:00.863" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14525" PostTypeId="2" ParentId="14495" CreationDate="2018-01-02T19:26:27.797" Score="0" Body="&lt;h2&gt;Allowed, not required&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; are two major categories where the specific format of the result is important to the validity of an answer. In Kolmogorov Complexity especially, &amp;quot;saving&amp;quot; bytes by outputting the result in a different order than requested is really far outside the spirit of the tag. ASCII art also often has a motivation that the output be formatted a certain way. In both these cases a clear motivation for why the output format is important to the challenge can usually be stated.&lt;/p&gt;&#xA;&lt;p&gt;On the other hand, I don't see any reason that using the ASCII art tag should FORBID a challenge from being flexible with output formats. I wouldn't necessarily expect it when solving such a challenge, but if the challenge poster says answer is valid I don't see why not. Common ways ASCII art challenges afford some flexibility includes allowing a list of strings instead of a single string with newline delimiters, allowing choice for certain characters (e.g. in the domino example allowing free choice of character to represent the pips rather than only &lt;code&gt;o&lt;/code&gt;) or allowing additional whitespace that doesn't alter the shape (such as at the end of lines, before the first line, or after the last line).&lt;/p&gt;&#xA;&lt;h2&gt;Flexible I/O is a default guideline, not a rule&lt;/h2&gt;&#xA;&lt;p&gt;As long as the poster of a challenge can formulate a reasonable argument for why their rules about I/O are important to the nature of the challenge, it's not common practice to force undesired I/O restrictions or lack-thereof onto a challenge. For example in the domino challenge, I think it's perfectly valid for the challenge author to accept flexible output. I also think it would be valid for the author to require all pips to be represented by the same value, or that the first row pips of both sides to be &amp;quot;in the same line&amp;quot;, or that pips must be a single character, or that the dividing line is important... All those are restrictions that could easily be argued as important to defining the spirit of the challenge.&lt;/p&gt;&#xA;&lt;p&gt;I would also have been fine with a similar challenge posted that didn't explicitly state any of those requirements, which then rejected the answer mentioned on the basis of &amp;quot;it doesn't look like a domino&amp;quot;.&lt;/p&gt;&#xA;&lt;h3&gt;TL;DR&lt;/h3&gt;&#xA;&lt;p&gt;I don't think a challenge shouldn't be allowed flexible output just because it is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;, nor do I think ascii-art challenges should be expected to use the same standards of flexible output as other challenges.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-02T19:26:27.797" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14527" PostTypeId="2" ParentId="5243" CreationDate="2018-01-02T23:08:12.857" Score="3" Body="&lt;h1&gt;500 rep for a Brain-Flak answer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/114219/balance-the-brackets&quot;&gt;Balance the Brackets&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The challenge is clearly brain-flak related, and should have a brain-flak answer, though this is understandably difficult.&lt;/p&gt;&#xA;" OwnerUserId="60042" LastActivityDate="2018-01-02T23:08:12.857" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14531" PostTypeId="2" ParentId="14495" CreationDate="2018-01-03T19:07:23.753" Score="8" Body="&lt;h1&gt;Allow strings, arrays of strings and 2D arrays of chars.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If the question is going to allow much more (e.g. outputting boolean values), pretty much every answer is just gonna use that and the question would be better off not being &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; at all. If it is reasonable to allow that type of output on a challenge, it being &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; is pointless.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;ASCII-art is (usually) about creating 2-dimensional text art. Strings with newlines and arrays of lines clearly encode a 2-dimensional output. As in many languages strings equal character arrays, I think 2D character arrays should be allowed too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The characters in the 2D array can be integers too, as long as they are the ordinal of the character represented in some encoding.&lt;/p&gt;&#xA;" OwnerUserId="59183" LastActivityDate="2018-01-03T19:07:23.753" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14533" PostTypeId="1" CreationDate="2018-01-04T04:47:54.523" Score="2" ViewCount="79" Body="&lt;p&gt;Because it would be hard for newcomers to find and read all of the meta questions about this topic, I suggest having a common post for all of them. It would be easier for moderators to point newcomers at a single post instead of multiple meta posts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Related questions:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8546/what-is-the-best-way-to-actually-time-an-answer-for-fastest-code-challenges&quot;&gt;What is the best way to actually time an answer for fastest-code challenges&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/388/comparing-fastest-code?answertab=votes#tab-top&quot;&gt;comparing fastest code&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8307/would-language-restrictions-for-fastest-code-problems-be-ok?rq=1&quot;&gt;Would language restrictions for fastest-code problems be ok?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12707/is-tio-acceptable-for-fastest-code-questions&quot;&gt;Is TIO acceptable for fastest-code questions?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1523/winning-criteria-vs-valid-criteria&quot;&gt;Winning Criteria vs Valid Criteria&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;What are the requirements for writing a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenge?&lt;/p&gt;&#xA;" OwnerUserId="69850" LastEditorUserId="69850" LastEditDate="2018-01-04T04:55:23.530" LastActivityDate="2018-01-04T04:55:23.530" Title="Default for fastest-code or restricted-time challenge" Tags="|discussion|policy|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14534" PostTypeId="2" ParentId="2140" CreationDate="2018-01-04T14:18:19.010" Score="2" Body="&lt;h1&gt;Megatanium trading&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to build a javascript function to trade a fictional stock called Megatanium&lt;br&gt;&#xA;You start with $1000 and 0 stock of Megatanium&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenge, all submissions should be written in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your function should accept four variables as follows, obviously within your function you can name these whatever you like&lt;br&gt;&#xA; - 1st variable represents the current value of 1 bar of Megatanium&lt;br&gt;&#xA; - 2nd variable represents your current bank balance&lt;br&gt;&#xA; - 3rd variable represents your current stock holding&lt;br&gt;&#xA; - 4th variable represents the iteration number  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your function should return an integer representing the size of your desired trade&lt;br&gt;&#xA;The return value should be negative if you wish to sell stock, positive if you wish to buy stock, 0 if you wish to neither buy or sell&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example;&lt;br&gt;&#xA;If you wish to buy 10 bars of Megatanium at the current price you would return 10&lt;br&gt;&#xA;If you wish to sell 5 bars of Megatanium at the current price you would return -5&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I will call your function 1000 times. Stock price will always be an integer, chosen at random, with a minimum of 0 and a maximum of 256. Method of selecting the stock price is described in more detail below, it will NOT be an even distribution!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your bot will be disqualified if it does any of the following at any point&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Try to buy more stock than it can afford&lt;/li&gt;&#xA;&lt;li&gt;Try to sell more stock than it holds&lt;/li&gt;&#xA;&lt;li&gt;Try to write any value to any of the global variables&lt;/li&gt;&#xA;&lt;li&gt;Fail to return a value&lt;/li&gt;&#xA;&lt;li&gt;Return a value that is not an integer&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Here is the code I will be running, the score output at the end will be your bot's score. It is calculated from your bank balance plus the value of your held stock at the latest value.  &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function go(bot) {&#xA;    bank = 1000;&#xA;    stock = 0;&#xA;    disqualified = 0;&#xA;    for (i=1; i&amp;lt;=1000; i++) {&#xA;        price = prices[i];&#xA;        trade = window[bot](price, bank, stock, i);&#xA;        if (trade !== parseInt(trade)) disqualified = &quot;INVALID TRADE&quot;;&#xA;        bank = bank - (price * trade);&#xA;        stock = stock + trade;&#xA;        if (bank &amp;lt; 0) disqualified = &quot;RUN OUT OF MONEY&quot;;&#xA;        if (stock &amp;lt; 0) disqualified = &quot;TRIED TO SELL STOCK YOU DIDN'T OWN&quot;;&#xA;        if (disqualified) break;&#xA;    }&#xA;    if (disqualified) {&#xA;        console.log(&quot;Disqualified on iteration &quot; + i + &quot; REASON: &quot; + disqualified);&#xA;    }&#xA;    else {&#xA;        score = bank + (stock * price);&#xA;        console.log(bot + &quot; scores &quot; + score);&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The function for generating a suitable distribution of random values is a slightly modified version of the function described &lt;a href=&quot;https://stackoverflow.com/a/36481059&quot;&gt;here&lt;/a&gt;&lt;br&gt;&#xA;Every bot will be given the same set of prices, but the set will not be generated until immediately before the bots are run.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function randn_bm() {&#xA;    var u = 0, v = 0;&#xA;    while(u === 0) u = Math.random();&#xA;    while(v === 0) v = Math.random();&#xA;    w = Math.floor(Math.sqrt( -2.0 * Math.log( u ) ) * Math.cos( 2.0 * Math.PI * v ) * 32) + 128;&#xA;    while (w &amp;lt; 0 || w &amp;gt; 256) w = randm_bm();&#xA;    return w;&#xA;}&#xA;prices = [];&#xA;for (i=1; i&amp;lt;=101; i++) {&#xA;    prices.push(randn_bm());&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Completion&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You may submit as many bots as you like, try to be inventive with your algorithms! You may use a global variable called &lt;code&gt;data&lt;/code&gt;, this will be initially set to null and will always be available to your function.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example bots&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function buyBot(p,b,s,i) {&#xA;    /* Bot always buys as much as it can */&#xA;    return Math.floor(b / p);&#xA;}&#xA;&#xA;function randomBot(p,b,s,i) {&#xA;    /* Bot buys and sells randomly */&#xA;    if (Math.random() &amp;gt; 0.5) {&#xA;        return Math.floor(Math.random() * (b / p));&#xA;    }&#xA;    else {&#xA;        return -Math.ceil(Math.random() * s);&#xA;    }&#xA;}&#xA;&#xA;function smartBot(p,b,s,i) {&#xA;    /* Bot always buys at under 100 and sells at over 150 */&#xA;    if (p &amp;lt; 100) {&#xA;        return Math.floor(b / p);&#xA;    }&#xA;    else if (p &amp;gt; 150) {&#xA;        return -s;&#xA;    }&#xA;    else {&#xA;        return 0;&#xA;    }&#xA;}&#xA;&#xA;function bankruptBot(p,b,s,i) {&#xA;    /* Bot always sells at under 100 and buys at over 150 */&#xA;    if (p &amp;gt; 150) {&#xA;        return Math.floor(b / p);&#xA;    }&#xA;    else if (p &amp;lt; 100) {&#xA;        return -s;&#xA;    }&#xA;    else {&#xA;        return 0;&#xA;    }&#xA;}&#xA;&#xA;function alternateBot(p,b,s,i) {&#xA;    /* Bot buys and sells alternately */&#xA;    if (data == 1) {&#xA;        data = 0;&#xA;        return Math.floor(Math.random() * (b / p));&#xA;    }&#xA;    else {&#xA;        data = 1;&#xA;        return -Math.ceil(Math.random() * s);&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Winning conditions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;All bots will be run on locally by me approximately 1 week after the question is posted (date will be decided when question is posted, no point setting a date in sandbox)&lt;br&gt;&#xA;Winner will quite simply be the bot that has the highest final score after the last iteration, as calculated by the function provided above. The array of prices used will be published after a winner has been crowned.&lt;br&gt;&#xA;There are no set conditions on the speed of your function, but please be fair and try to avoid anything that will take more than a couple of minutes to execute&lt;/p&gt;&#xA;" OwnerUserId="42493" LastActivityDate="2018-01-04T14:18:19.010" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14535" PostTypeId="2" ParentId="11408" CreationDate="2018-01-04T14:51:26.113" Score="-6" Body="&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/57815/jelly-hypertraining&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/gWQuB.png&quot; alt=&quot;Join over 20 students in their efforts to learn Jelly. Just request access and start working!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2018-01-04T14:51:26.113" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14536" PostTypeId="2" ParentId="14511" CreationDate="2018-01-04T15:40:57.563" Score="16" Body="&lt;h1&gt;Overall best challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This category is for a challenge that is exceptionally well written, is properly specified, and most of all, an interesting challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Due to the &quot;HNQ effect&quot;, easy, simple challenges often get more attention than more interesting, harder puzzles, and this award is intended to recognize effort in writing complex challenges.&lt;/p&gt;&#xA;" OwnerUserId="60042" LastEditorUserId="60042" LastEditDate="2018-01-04T20:45:29.103" LastActivityDate="2018-01-04T20:45:29.103" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14538" PostTypeId="2" ParentId="14511" CreationDate="2018-01-05T02:09:08.090" Score="10" Body="&lt;h1&gt;&lt;s&gt;Best Alternative Method&lt;/s&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10948/8478&quot;&gt;Kansas City Shuffle&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Too often, once someone devises a generic golfy method of solving a challenge, most people will use that method for their answers. This award goes to those answers that utilize an alternative method as a better solution than the method that the majority of other answers use (prior to the posting of the rewarded answer).&lt;/p&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="31957" LastEditDate="2018-01-09T14:04:08.260" LastActivityDate="2018-01-09T14:04:08.260" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14539" PostTypeId="1" CreationDate="2018-01-05T15:58:52.630" Score="1" ViewCount="175" Body="&lt;p&gt;Should programs be able to output to STDOUT, when the question says you must &amp;quot;error&amp;quot;?&lt;/p&gt;&#xA;&lt;p&gt;For example, the python program &lt;code&gt;1/0&lt;/code&gt; outputs &lt;code&gt;ZeroDivisionError: integer division or modulo by zero&lt;/code&gt;.  This is to STDERR by default.&lt;/p&gt;&#xA;&lt;p&gt;But the program:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;print &amp;quot;ZeroDivisionError: integer division or modulo by zero&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Echos the same thing, but to STDOUT.  There is no observable difference in the output of the first and the last program, save the STDOUT/STDERR issue.&lt;/p&gt;&#xA;&lt;p&gt;In addition, we already allow &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2451/46271&quot;&gt;output to be piped to STDERR&lt;/a&gt; as a standard i/o method.&lt;/p&gt;&#xA;&lt;p&gt;Some programming languages, such as Mathematica, even output errors to STDOUT by default.&lt;/p&gt;&#xA;&lt;h3&gt;So, should we allow answers to output to STDOUT when an &amp;quot;error&amp;quot; is requested?&lt;/h3&gt;&#xA;&lt;p&gt;And the opposite should also be considered: what about answers that output errors to STDOUT, which would normally fall under the &amp;quot;No Extraneous Output&amp;quot; rule?&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2451&quot;&gt;Programs may output to STDERR&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="69850" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-10T14:57:04.743" Title="Can programs output to STDOUT when an error is requested?" Tags="|discussion|" AnswerCount="3" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="14540" PostTypeId="2" ParentId="14539" CreationDate="2018-01-05T18:04:13.937" Score="-1" Body="&lt;h3&gt;Yes.&lt;/h3&gt;&#xA;&lt;p&gt;IMHO, it doesn't really matter.  It's unlikely that it's shorter to fake-generate the error (via printing an error message) than it is to actually generate the error.&lt;/p&gt;&#xA;&lt;p&gt;In addition, most questions don't specify an &lt;em&gt;exact&lt;/em&gt; error to generate, and most languages allow the 3-byte &lt;code&gt;1/0&lt;/code&gt; snippet to error out.&lt;/p&gt;&#xA;&lt;p&gt;AFAICT, there's no good reason to force errors to STDERR.&lt;/p&gt;&#xA;&lt;h3&gt;What about for generating a specific error message, instead of a generic &amp;quot;error&amp;quot;?&lt;/h3&gt;&#xA;&lt;p&gt;If the challenge requests a specific error message, then that's more of a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenge, but with a possible golfing trick of generating the error.  In that case, I think it falls under the standard I/O rules, which allow the answerer to choose STDERR or STDOUT.&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-05T18:04:13.937" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="14541" PostTypeId="2" ParentId="2140" CreationDate="2018-01-06T11:52:42.963" Score="0" Body="&lt;h2&gt;Your Task:&lt;/h2&gt;&#xA;&lt;h3&gt;To create a piece of code that takes in an input, and outputs ASCII art, which is encoded in the input string.&lt;/h3&gt;&#xA;&lt;p&gt;It seems unclear, but you are basically creating your own programming language that takes a piece of code in a syntax that you create, and then writing a code that takes that input, and turns it into ASCII art.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Example:&lt;/h2&gt;&#xA;&lt;p&gt;A simple example would be an input that runs through a line of input code with the syntax:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 : An empty space&#xA;1 : A space that is occupied&#xA;2 : A newline character&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;I:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;01010210101201010210101201010&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;O:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; The '|' character is just to show the matrix&#xA;&#xA;| # # |&#xA;|# # #|&#xA;| # # |&#xA;|# # #|&#xA;| # # |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;I:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;11112000121111210002111122 // Shows a 2&#xA;11112100121001210012111122 // Shows a 0&#xA;0120120120120122 // Shows a 1&#xA;11112100121111210012111122 // Shows an 8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;O:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;####   &#xA;   # &#xA;#### &#xA;#  &#xA;#### &#xA;&#xA;####&#xA;#  #&#xA;#  #&#xA;#  #&#xA;####&#xA;&#xA; #&#xA; #&#xA; #&#xA; #&#xA; #&#xA;&#xA;####&#xA;#  #&#xA;####&#xA;#  #&#xA;####&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The code would read through the letters one by one and print out the characters, or create a newline character as expected.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Since this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the code with the fewest bytes wins!&lt;/p&gt;&#xA;" OwnerUserId="68546" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-06T11:52:42.963" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14542" PostTypeId="2" ParentId="14539" CreationDate="2018-01-06T16:26:05.143" Score="3" Body="&lt;h2&gt;Authors ought to specify what they mean by errors&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;No definition we decide on as a community is going to fit every challenge involving an error. STDERR is a pretty good definition but often times authors are going to want to use something different, so we should let authors decide.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you see a question that just says some thing like &lt;em&gt;&quot;Throw an error&quot;&lt;/em&gt; you should ask for clarification.  If they don't clarify with a concrete definition of what they mean by error, then that question is unclear and should be closed.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2018-01-10T14:57:04.743" LastActivityDate="2018-01-10T14:57:04.743" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14543" PostTypeId="1" AcceptedAnswerId="14544" CreationDate="2018-01-06T16:41:39.583" Score="11" ViewCount="358" Body="&lt;p&gt;Related to this thread on reddit: [&lt;em&gt;a link that was determined to be NSFW&lt;/em&gt;]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can I submit this as a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question, or is it too inappropriate for StackExchange?&lt;/p&gt;&#xA;" OwnerUserId="72485" LastEditorUserId="34718" LastEditDate="2018-01-16T15:23:54.390" LastActivityDate="2018-01-16T15:23:54.390" Title="Mildly not-safe-for-work challenge?" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14544" PostTypeId="2" ParentId="14543" CreationDate="2018-01-06T16:45:25.993" Score="27" Body="&lt;p&gt;It's definitely too inappropriate for Stack Exchange. However, you could trivially modify the animation to be something appropriate (like perhaps a &lt;a href=&quot;https://i.stack.imgur.com/elPCX.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;party blower&lt;/a&gt;).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2018-01-06T16:45:25.993" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14545" PostTypeId="2" ParentId="2140" CreationDate="2018-01-06T19:32:35.793" Score="-2" Body="&lt;h1&gt;Golf an interpreter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The challenge is to find a path from A to B, but you must also provide an interpreter for your program.  The shortest interpreter wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input to path finder:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A list of edges in a graph e.g.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;AC&#xA;CD&#xA;DB&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output from path finder:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A list of vertices e.g. &lt;code&gt;A C D B&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Feel free to somewhat adjust the input/output format.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your score is the number of bytes of your interpreter/compiler.  The lowest score wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's possible to work around the question and interpret a language that is too similar to an existing one by doing something like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;eval(input_file.replace(&quot;this never happens&quot;, &quot;&quot;))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I don't have a good rule to prevent this other than to ask that you don't.&lt;/p&gt;&#xA;" OwnerUserId="41245" LastActivityDate="2018-01-06T19:32:35.793" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14550" PostTypeId="2" ParentId="14495" CreationDate="2018-01-08T17:55:04.017" Score="5" Body="&lt;h1&gt;Return types should be trivially viewable as ASCII art&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If you're writing a function that returns the content rather than outputting it directly, then it's expected that your language has a function, procedure, or operation that could trivially display that content (whether writing to stdout, displaying directly onscreen, or some other visual representation) without any additional processing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if your language's &quot;print&quot; function can only print strings, then your function should return a string. But if your language doesn't differentiate between strings, list of chars, or even lists of integer ASCII codes, then those would be acceptable return types too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't want to arbitrarily limit the return types in languages where the distinction between a string and a char array is meaningless. However, I don't think it's acceptable to return something like a list of numbers if the given language requires several lines of additional code to convert those numbers into the actual output that was requested.&lt;/p&gt;&#xA;" OwnerUserId="62101" LastActivityDate="2018-01-08T17:55:04.017" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14551" PostTypeId="2" ParentId="2140" CreationDate="2018-01-09T03:53:12.067" Score="-10" Body="&lt;h1&gt;Worst language Ever&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let's find out the worst language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Make a program that does anything that is shortest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The worst language would be the longest of all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'll go with C first.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;https://gcc.gnu.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;C (gcc)&lt;/a&gt;, 15 bytes&lt;/h1&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-c prettyprint-override&quot;&gt;&lt;code&gt;f(){puts(&quot;1&quot;);}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##S9ZNT07@/z9NQ7O6oLSkWEPJUEnTuvZ/bmJmHlAIKAzkAAA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;C (gcc) – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It prints 1. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It does print something and it is the shortest code.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;https://developer.apple.com/swift/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Swift 4&lt;/a&gt;, 8 bytes&lt;/h1&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-swift prettyprint-override&quot;&gt;&lt;code&gt;print(2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##Ky7PTCsx@f@/oCgzr0TDSPP/fwA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Swift 4 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It prints 2. It does print something that is shortest.&lt;/p&gt;&#xA;" OwnerUserId="77388" LastActivityDate="2018-01-09T03:53:12.067" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14553" PostTypeId="2" ParentId="2140" CreationDate="2018-01-10T00:50:00.837" Score="1" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;Any comments for improvement would be appreciated.&lt;br /&gt;&#xA;Should I choose a harder function? (maybe &amp;quot;Is this binary number prime?&amp;quot;)&lt;br /&gt;&#xA;Or maybe not harder, but some other decision problem suggestion?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Majority function, a non-uniform computing challenge&lt;/h1&gt;&#xA;&lt;p&gt;Non-uniform computing is a class of computing where a different procedure can be specified for each input size of a problem.  This allows discussing complexity of languages that are only straight line computations (no looping constructs), yet which are powerful enough to compute any fixed input size function a Turing machine can compute. It also allows taking advantage of algorithms that may work well if only you could tweak a parameter for each size (even if the parameter is difficult to compute) or where there are only a small number of exceptions in each input size (so checking those exceptions then using the algorithm succeeds).&lt;/p&gt;&#xA;&lt;h1&gt;Goal:&lt;/h1&gt;&#xA;&lt;p&gt;Write a program or function which, given an input length, outputs an If-Then-Else sequence (defined below) which determines if greater than half the inputs are 1 (the majority function).&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;. Your score will be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;G20 + 4*G5 + 10*G2 + L&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Where &lt;code&gt;L&lt;/code&gt; is the size of your submission in bytes, and &lt;code&gt;G20&lt;/code&gt; is the length of the generated If-Then-Else sequence for size=20 (length being defined as number of If-Then-Else statements).  Similarly &lt;code&gt;G5&lt;/code&gt; and &lt;code&gt;G2&lt;/code&gt; are the lengths for the generated programs for size=5 and size=2 respectively. The lowest score wins.&lt;/p&gt;&#xA;&lt;p&gt;This is in some sense an &amp;quot;inception&amp;quot; code golf. You will be judged on the&#xA;length of your program as well as the length of the programs it generates.&lt;/p&gt;&#xA;&lt;p&gt;To prevent submissions that just loop over all possible ITE sequences till it&#xA;finds the smallest one that works, entries need to provide the &lt;code&gt;G20&lt;/code&gt;, &lt;code&gt;G5&lt;/code&gt;, &lt;code&gt;G2&lt;/code&gt; values along with the code submission for it to be a valid entry.&#xA;As the number of possible sequences quickly becomes infeasible to search, this should eliminate raw brute forcing.&lt;/p&gt;&#xA;&lt;h3&gt;If-Then-Else &amp;quot;programs&amp;quot;&lt;/h3&gt;&#xA;&lt;p&gt;An If-Then-Else (ITE) statement is a logical statement of the form:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;if A then B else C&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The logical value of this statement is referred to as the &amp;quot;output&amp;quot;, and the values A, B, and C are the &amp;quot;inputs&amp;quot; of the statement. To turn this into a formatted language, a file (or string) describing an ITE program will be a series of lines that contain:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;input_term&amp;gt; &amp;lt;space&amp;gt; &amp;lt;input_term&amp;gt; &amp;lt;space&amp;gt; &amp;lt;input_term&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Where an input_term is one of:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;'0'&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;'1'&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;'I' &amp;lt;decimal_number&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;'Q' &amp;lt;decimal_number&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The values 0 and 1 are Boolean false and true respectively. The value of I(number) is the value of the input at index 'number';&#xA;for example I3 = Input #3 (input numbering starts at zero).&#xA;The value of Q(x) is the result of ITE statement number 'x' (again, numbering starts at zero).&lt;/p&gt;&#xA;&lt;p&gt;The result of an ITE program is the output of its last statement.&lt;/p&gt;&#xA;&lt;h3&gt;Example ITE program&lt;/h3&gt;&#xA;&lt;p&gt;Here is a simple interpreter for ITE programs, written in python:&#xA;&lt;a href=&quot;https://pastebin.com/nyziRDpk&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;ite.py&quot;&gt;ite.py&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This interpreter has some additional features like comments (start a line with &lt;code&gt;#&lt;/code&gt;) and custom output names (start line with &lt;code&gt;&amp;lt;name&amp;gt;: &lt;/code&gt;) which are useful when playing with some ideas by hand. If you choose to utilize those features in your generated ITE programs, that's fine, although I'm not sure how that would help.  This will be considered the defacto standard for the ITE language for this competition.&lt;/p&gt;&#xA;&lt;p&gt;Here is an example program: parity4.ite&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;I0 0 1&#xA;I1 Q0 I0&#xA;Q1 0 1&#xA;I2 Q2 Q1&#xA;Q3 0 1&#xA;I3 Q4 Q3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;As its name suggests, this is the parity function for input size 4. It returns 1 if the 4 inputs bits have an odd number of 1s, otherwise it returns 0. Here is an example of testing it on some values.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;$ python ite.py parity4.ite 0110&#xA;0&#xA;$ python ite.py parity4.ite 0111&#xA;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="68341" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-10T14:12:37.637" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14554" PostTypeId="1" AcceptedAnswerId="14563" CreationDate="2018-01-10T04:26:51.343" Score="3" ViewCount="273" Body="&lt;p&gt;The challenge &lt;a href=&quot;https://codegolf.stackexchange.com/q/10768/61563&quot;&gt;Solve Rubik&amp;#39;s cube&lt;/a&gt; has a lot of flaws:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Arbitrary limits: &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;(say, max. 5 seconds on your machine and less than 1000 moves)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Cumbersome input format: &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The input is in the format UF UR UB UL DF DR DB DL FR FL BR BL UFR URB UBL ULF DRF DFL DLB DBR (this particular input represents the solved cube). First 12 2-character strings are the edges in the UF, UR, ... BL positions (U=up, F=front, R=right, B=back, L=left, D=down), then the next 8 3-character strings are the corners in the UFR, URB, ... DBR positions.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Cumbersome output format: &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;D+ L2 U+ F+ D+ L+ D+ F+ U- F+ Where D1 or D+ represents turning the D (down) face clockwise 90 degrees, L2 is turning the L face 180 degrees, U3 or U- represents turning the U face counterclockwise 90 degrees.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's five years old and only has three answers (likely due to the three points above).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I would like to rewrite it with less time/output limits and less I/O requirements.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any objections/thoughts?&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/153315/61563&quot;&gt;Posted&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="61563" LastEditorUserId="46271" LastEditDate="2018-01-23T22:18:05.243" LastActivityDate="2018-01-23T22:18:05.243" Title="Can I redo the Solve Rubik's Cube challenge?" Tags="|discussion|code-golf|challenges|reposting|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14556" PostTypeId="1" CreationDate="2018-01-10T12:06:52.070" Score="4" ViewCount="181" Body="&lt;p&gt;Sometimes, when you comment on a solution with a suggested improvement (either independently derived or using the existing solution as a starting point), for whatever reason, the author might not take that suggestion on board.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it's a significant enough improvement, I've occasionally felt tempted to post the it as my own solution after a month or so has passed. Is that long enough to wait or should I wait longer?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an example see &lt;a href=&quot;https://codegolf.stackexchange.com/a/147502/58974&quot;&gt;this solution&lt;/a&gt; and my &lt;em&gt;very&lt;/em&gt; quick improvement in the comments, which I've since golfed down further.&lt;/p&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="58974" LastEditDate="2018-01-10T12:36:00.943" LastActivityDate="2018-01-10T14:21:39.523" Title="How long should you wait before posting an improvement as your own solution?" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14557" PostTypeId="2" ParentId="14554" CreationDate="2018-01-10T12:07:31.063" Score="0" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Arbitrary limits: &lt;code&gt;(say, max. 5 seconds on your machine and less than 1000 moves)&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;IMO that's not a flaw. The only thing you really gain by removing the arbitrary limits is the possibility of untestable answers. When the complexity of the problem is sufficiently low that answers can be checked for bugs by eye it's not a problem if they can't be tested, but I don't think this falls into that category.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition, it's these limitations which make it an interesting question. Brute force is less interesting than exploiting the structure of the group. See comments on &lt;a href=&quot;https://codegolf.stackexchange.com/q/12056/194&quot;&gt;Rubik&amp;#39;s Revenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;It's five years old and only has five answers (likely due to the three points above).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I seriously doubt that the I/O has anything to do with it. The arbitrary limits probably go a long way to explaining it, because they require a certain level of mathematical sophistication.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;IMO rather than reposting Rubik's cube, if you want to do something in the same area but without anti-brute-forcing constraints you might as well generalise and ask the &lt;a href=&quot;https://en.wikipedia.org/wiki/Word_problem_for_groups&quot; rel=&quot;nofollow noreferrer&quot;&gt;word problem&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-01-10T12:07:31.063" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14559" PostTypeId="2" ParentId="14556" CreationDate="2018-01-10T14:21:39.523" Score="6" Body="&lt;p&gt;Technically, there is no rule stating that you have to suggest an improvement with a comment instead of posting a new answer in the first place, so in that light you could post it as your own answer immediately.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, as, even if not mandated by a rule, it is commendable to comment an existing answer to suggest an improvement instead of posting the improved version as your own, there probably should be, as suggested by the question, a guideline on how long to wait before answering if the poster doesn't edit their answer in response to the comment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think a week, or even a few days if the improvement is very straightforward (easy to verify as correct), should be sufficient. If by then the poster has not edited their answer or responded to the comment in any way, they're probably not very interested in doing so in the future. (If the poster hasn't visited the site during that time, it's better to wait a little longer; perhaps another week.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You could, of course, ask the poster if it is OK for you to post the improved answer. If they don't respond to that in a couple of days either, just go ahead and post it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All that said, if the improved version doesn't differ by more than a couple of bytes from the answer, it's probably better just to leave the comment there instead of making a new similar post, even if the answer never gets edited.&lt;/p&gt;&#xA;" OwnerUserId="61405" LastActivityDate="2018-01-10T14:21:39.523" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14560" PostTypeId="2" ParentId="14539" CreationDate="2018-01-10T14:56:24.500" Score="-2" Body="&lt;h1&gt;Output to STDOUT should only be allowed if that is the language's default for errors&lt;/h1&gt;&#xA;&lt;p&gt;I think throwing an error is clear enough for (almost?) all languages. The way a normal error presents itself in a given language should be the way to throw an error when needed.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-10T14:56:24.500" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14561" PostTypeId="1" CreationDate="2018-01-10T17:20:25.700" Score="0" ViewCount="217" Body="&lt;p&gt;As explained in our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8750/45941&quot;&gt;policy on serious contenders&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69930/paint-starry-night-objectively-in-1kb-of-code/69934#69934&quot;&gt;this answer&lt;/a&gt; is not a serious contender because it is deliberately crafted to get a low score (the only way it could win is if there were no other entries). &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69930/paint-starry-night-objectively-in-1kb-of-code/69934#comment171906_69934&quot;&gt;Several others seem to agree&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As per &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990/45941&quot;&gt;our policy on invalid/unacceptable answers&lt;/a&gt;, I flagged the answer with a custom moderator flag on January 27, 2016. It was marked as helpful:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/26B86.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/26B86.png&quot; alt=&quot;helpful flag&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, nearly 2 years later, the answer &lt;a href=&quot;https://codegolf.stackexchange.com/posts/69934/revisions&quot;&gt;still hasn't been deleted&lt;/a&gt;. This goes against our policy, as far as I can tell: if it is a non-serious answer, leaving it as a broken window that signals that making other non-serious answers is acceptable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why is this answer still around? If it is actually a serious contender, then why was the flag validated? The mixed signals are causing confusion.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2018-01-10T18:41:01.913" LastActivityDate="2018-01-10T18:41:01.913" Title="Why is this non-serious-contender answer still around, despite a &quot;helpful&quot; flag?" Tags="|discussion|policy|site-health|specific-answer|" AnswerCount="1" CommentCount="17" ContentLicense="CC BY-SA 3.0" />
  <row Id="14562" PostTypeId="2" ParentId="14561" CreationDate="2018-01-10T18:32:12.390" Score="-4" Body="&lt;h3&gt;Why was the mod flag marked helpful, but the answer not deleted?&lt;/h3&gt;&#xA;&lt;p&gt;The most likely answer to that is because it was &amp;quot;helpful&amp;quot;.  The single comment proposing deletion for that answer was &lt;em&gt;by&lt;/em&gt; a mod.  The mods likely appreciated the notice, but they couldn't do much about it, since the community had pretty clearly voted in favor of &lt;em&gt;not&lt;/em&gt; deleting it. See the comments on the answer.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/69930/paint-starry-night-objectively-in-1kb-of-code/69934#comment171935_69934&quot;&gt;@AlexA. I disagree. This is a valid, if simplistic solution. I doubt there would be any call to remove it if it wasn't so highly upvoted or if it were only one of a couple answers. – Calvin's Hobbies Jan 27 '16&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/69930/paint-starry-night-objectively-in-1kb-of-code/69934#comment171964_69934&quot;&gt;[...] it doesn’t invalidate the approach and it’s most certainly not a joke answer. [...] Konrad Rudolph&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/69930/paint-starry-night-objectively-in-1kb-of-code/69934#comment172175_69934&quot;&gt;Personally I think this is a fine answer, well within the spirit of the question. – Nathaniel Jan 28 '16&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;There is only one comment in favor of deletion on the post, and it has very few comment upvotes compared to the rest (11 vs 38/15/25).&lt;/p&gt;&#xA;&lt;h3&gt;Site policy is based on the community consensus.&lt;/h3&gt;&#xA;&lt;p&gt;If the community decides something is allowed, then it's allowed. That's the way Stack Exchange works.  The majority vote in this case is that the answer doesn't fall under the ruling of &amp;quot;non-serious answer&amp;quot;.  Here is a breakdown of the &amp;quot;serious answer&amp;quot; rules.&lt;/p&gt;&#xA;&lt;h3&gt;Breakdown of points in the linked meta&lt;/h3&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A serious contender is a submission which makes a serious effort towards optimizing the submission's score within the chosen language(s) and other choices (such as algorithm choice or optional restrictions/bonuses taken).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Does it fit this? It's debatable.  It does use an algorithm that makes an attempt to solve the challenge.  It's definitely inefficient, but such is life.  That algorithm was not very well suited to the challenge.  Just because it's a bad choice of algorithm, and it was known to be such, doesn't necessarily mean it's not allowed.  IMHO, that's like banning Java from a challenge, simply because it has no chance of winning.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;In code challenges, deliberately crafting a solution that gets a poor score.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I don't think it was deliberately crafted to have a poor score, but OP definitely knew it wasn't going to win.  But again, IMHO, just because that algorithm is horrible doesn't mean it's not allowed. See the &amp;quot;banning Java&amp;quot; argument in the last paragraph.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;In short, if the only way a submission could win a challenge (either overall or within its set of choices for language(s), algorithm(s), and/or other relevant categories for the challenge) is if no other solutions were posted, it's almost certainly not a serious contender (like the linked submission above).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This says right there:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;win a challenge, within its set of choices for [...] algorithm(s)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;For the algorithm of &amp;quot;best answer that finds the average color&amp;quot;, this answer definitely made an attempt.  The OP even edited when another user commented with a tipoff that a different color was a tiny bit better.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Note that this does not exclude using a more-verbose language or lengthier approach in code golf, since submissions in all programming languages are welcome, and different submissions in the same language are acceptable so long as the differences are non-trivial.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I see no reason why code-golf should be special here.  If our current site policy is to allow duplicate answers (short of plagiarism of course), including ones in the same language with different lengths, by those rules a less efficient algorithm should be allowed.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;TL;DR: The community disagrees with your assessment that the answer is &amp;quot;not a serious contender&amp;quot;. The moderator presumably saw your flag, and presumably appreciated the notice, but declined to do anything about it.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-10T18:32:12.390" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="14563" PostTypeId="2" ParentId="14554" CreationDate="2018-01-10T20:16:16.160" Score="6" Body="&lt;p&gt;Please do remake the challenge (getting permission) but &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-time&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-time&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-time&lt;/a&gt; with a lax and well-specified limit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think implementing some Rubik's cube solving algorithm is much more interesting than those writing generic path search over an enormous graph of ~2&lt;sup&gt;65&lt;/sup&gt; configurations. And it's nice to have answers that actually run. Some fairly lax time limit should suffice for this, preferably given on a specific machine setup to avoid ambiguity.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2018-01-10T20:16:16.160" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="14564" PostTypeId="1" CreationDate="2018-01-10T21:28:34.927" Score="2" ViewCount="67" Body="&lt;p&gt;I would like to know what the common practice is for revamping problems that were not constructed properly the first time. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first(and only) code-golf puzzle I made was &lt;a href=&quot;https://codegolf.stackexchange.com/questions/150370/the-struggling-college-students-gpa-calculator&quot;&gt;The struggling college student's GPA Calculator&lt;/a&gt;. I put the question into the sandbox and received a few feedback items, but being new to the site, I didn't structure the question in the way I would now. At the time of writing the question, I did not know that adding a lot of requirements(such as the rounding requirement and the I/O requirements) would lead to people disliking and not answering the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does the site have any protocol for fixing questions like these, to allow more answers and more people to participate? Just opening up a new, better formatted question seems like it will get marked as a dupe.&lt;/p&gt;&#xA;" OwnerUserId="76365" LastActivityDate="2018-01-10T21:45:49.353" Title="How to fix a poorly constructed question that you are the author of" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14565" PostTypeId="2" ParentId="14564" CreationDate="2018-01-10T21:45:49.353" Score="2" Body="&lt;h1&gt;Sandbox 100% of your Posts&lt;/h1&gt;&#xA;&lt;p&gt;Sandboxing your posts is the best way to get attention to the flaws of your question, if you don't get a response within 12 hours, try the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Post a link to your sandbox in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;, more experienced users often use this as a forum and will be glad to help (this is also where new sandbox posts / meta posts / regular posts appear).&lt;/li&gt;&#xA;&lt;li&gt;Make an edit to your sandbox post to bump it back to the top (do not abuse this, abuse The Nineteenth Byte before doing this).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Recovering Outside of the Sandbox&lt;/h1&gt;&#xA;&lt;p&gt;If you happen to make a post that made it through sandbox, to the main site, and it is not well received (E.G. 3 downvotes in 2 minutes):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Remove the post before it gets answers (once it has answers it is considered rude to remove).&lt;/li&gt;&#xA;&lt;li&gt;Or, ask in the comment section what can be done to fix it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;General Guidelines (My Personal Opinion)&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bullet points: nobody wants to read a paragraph in your challenge.&lt;/li&gt;&#xA;&lt;li&gt;Sections: Turn your post into multiple sections, some common ones I use are&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&amp;quot;Background&amp;quot;: Tell the user the backstory and link to a Wikipedia or OEIS.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1-4 sentences MAXIMUM on the story behind why this challenge is neat.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Formal Definition&amp;quot;: Tell the user the variables of the challenge, for example if your challenge takes 2 integers and outputs a list...&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Given &lt;code&gt;n&lt;/code&gt; and &lt;code&gt;m&lt;/code&gt;, where &lt;code&gt;n&lt;/code&gt; is the number of bananas and &lt;code&gt;m&lt;/code&gt; is the number of angry beavers, calculate the list of angry bananas &lt;code&gt;b&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Examples&amp;quot;: Give the inputs and their corresponding outputs.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Hit base cases, hit edge cases and hit weird cases.&lt;/li&gt;&#xA;&lt;li&gt;If you have a rule that is odd, make sure that rule is hit by an example.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Rules&amp;quot;: Define a rules section, I recommend keeping track of the common rules seen around the site.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&amp;quot;Leading/trailing newlines are allowed.&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Input may be taken as a list/space delimited string.&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;Etc...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Related&amp;quot;: If you know of a post that is like yours, call it out before someone else does and say how it is different. This will prevent the inevitable argument in the comment section.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Winning Criterion: If you don't have this, your question gets closed. Add a winning criteria.&lt;/li&gt;&#xA;&lt;li&gt;Compete. Competing in challenges and reading challenges will give you &lt;strong&gt;ideas for good practice in writing questions&lt;/strong&gt;, if you compete in challenges your understanding of what is required will increase steadily. Even if the challenge is 2 years old, it could still be gold ;).&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Ask someone to help!!!&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If you have more questions view my Question posts by &lt;a href=&quot;https://codegolf.stackexchange.com/users/59376/magic-octopus-urn?tab=questions&amp;amp;sort=votes&quot;&gt;votes&lt;/a&gt;, you can see which ones flopped and which ones rocked. Or you can just message me or join us in the nineteenth byte anytime you have questions man.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-10T21:45:49.353" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14568" PostTypeId="2" ParentId="2437" CreationDate="2018-01-10T23:02:13.743" Score="-1" Body="&lt;p&gt;Sure many will not agree but why not just delete everything that has not been edited in the last 6 months. That gives plenty of time for people to discover old, abandoned gems and will also get rid of anything that has been posted to main but not removed from Sandbox.&lt;/p&gt;&#xA;" OwnerUserId="56555" LastActivityDate="2018-01-10T23:02:13.743" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14569" PostTypeId="1" CreationDate="2018-01-11T00:46:42.007" Score="14" ViewCount="290" Body="&lt;p&gt;&lt;strong&gt;update:&lt;/strong&gt; This is resolved now - I did update the challenge, and I'm glad I did so.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I recently posted the challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/152856/write-moby-dick-approximately&quot;&gt;Write Moby Dick, approximately&lt;/a&gt;, which has proven popular and the answers are flowing in. However, it has one unforeseen issue that I'm tempted to try and fix.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The current best-scoring answers solve the problem in two steps: first strip out the newlines, then run some kind of text prediction algorithm, then use a second, separate algorithm to work out whether to replace a space with a newline or not. This is because the &lt;code&gt;whale.txt&lt;/code&gt; file is wrapped to a line width of 73 characters, which makes the task of predicting newlines quite different from predicting the other characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I suspect that most if not all competitive answers will have to solve these two problems separately. This is inelegant, and it creates a barrier to entry for new approaches, since someone might have a great idea for a new text prediction approach, but it's unlikely to be competitive unless they also implement a separate linefeed prediction algorithm.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because of this, I'm tempted to create a new file, &lt;code&gt;whale2.txt&lt;/code&gt;, that's processed to remove this line wrapping. (It would still contain newlines, but only at the end of paragraphs.) I would provide both this file and the original &lt;code&gt;whale.txt&lt;/code&gt;, and give people the choice of which to use. This way existing answers won't be invalidated, but new answers will not have to face the linefeed issue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question is just whether updating the challenge in this way is the right thing to do, or if it's better to just leave the question as it is. I think fixing the issue would improve the challenge, but I want to make sure this kind of change is acceptable in this community. I'd appreciate any comments, opinions, links to previous meta discussions, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Update: I've created the &lt;a href=&quot;https://gist.githubusercontent.com/nathanielvirgo/73b4181917f83c0cd306bd0d8f4c998a/raw/208774322bad4e04715eae743d7d350b504fe5eb/whale2.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;whale2.txt&lt;/a&gt; file, and I guess I'll go ahead with this in 5 hours or so unless someone tells me it's frowned upon.&lt;/p&gt;&#xA;" OwnerUserId="21034" LastEditorUserId="21034" LastEditDate="2018-01-16T23:47:42.093" LastActivityDate="2018-01-17T01:53:32.593" Title="Should I update this challenge? (Moby Dick)" Tags="|discussion|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14570" PostTypeId="2" ParentId="14569" CreationDate="2018-01-11T05:29:49.527" Score="0" Body="&lt;p&gt;Having two distinct (though similar) texts to predict, of which answerers may choose one, is akin to having two challenges in one. I'd recommend leaving it as-is, and after some time has passed, posting a follow-up challenge with the edited text (perhaps with a different source text to distinguish it further).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2018-01-11T05:29:49.527" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14571" PostTypeId="2" ParentId="2140" CreationDate="2018-01-11T16:51:00.337" Score="1" Body="&lt;h1&gt;Square Number Chains&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Background&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given a positive integer &lt;code&gt;n &amp;gt;= 25&lt;/code&gt;, it is conjectured that there exists a permutation of the positive integers which are less than or equal to &lt;code&gt;n&lt;/code&gt; in which every adjacent pair of numbers adds up to a square number. There are also several numbers less than 25 that this is also true for - 15, 16, 17, and 23.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write a program or function which accepts a positive integer, &lt;code&gt;n&lt;/code&gt;, and returns all positive integers less than or equal to &lt;code&gt;n&lt;/code&gt;, ordered such that each adjacent pair adds up to a square number. If there are multiple valid orderings, only one needs to be returned, but your program must be deterministic - that is, for a particular input, your answer should return the same output every time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can assume that the input will always have at least one solution, so you don't have to deal with inputs 1-14, 18-22, or 24. If you prefer, you can require that input to your submission will always be greater than 24 - if so, please specify in your submission.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output may be in the form of a list, or written to STDOUT, so long as there is a consistent and identifiable seperator between them - for example, a space, newline, comma, tab, etc are all fine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can validate your program's output by using &lt;a href=&quot;https://tio.run/##ZZDLbsIwEEX3/oqRVwlMEYbSl8SiYtsd3SEWFjHFUrCD7VSgKN@ejsMjhK5G9sy9Z@4Up7CzZto0vsh1WOykk5ugHMyBI2dMm6IMn87JE/2stAnJMYWtdXAEbaDtJumo1SZ9h3RNar@w@yJXQZHaWxdUlnSOKczJ89jZOWl@VCIQcmV6c0MQZFe4yOdLdSiV2SjQHqp6cwHwEdnsJfU56C3ckVXuFXBjA/A0ZexX5jqjdb5dqVhE6w49/o9@IvQHA/DlnkRdZ6XXtNb9eyjWNKf98lBKFwMncd2oGwxgNEtjmbSZ6Y8mL3GqeljV86pGCuNb6S1Kj4aPMIw@CNe8F2w/LcA17rlKk91GGbte9Ev7cL7mecrbvAzamoeb3ls8XFcbojXNO77iBMUzCoEzpEKPKU7xBcUYxQwFvv0B&quot; rel=&quot;nofollow noreferrer&quot;&gt;this TIO link&lt;/a&gt;. It supports input as a string with any consistent separator, and will tell you what criteria (if any) your list is failing on.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Inspiration&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.youtube.com/watch?v=G1m7goLCJDY&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Square-Sum Problem - Numberphile&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input    Example output&#xA;15       9,7,2,14,11,5,4,12,13,3,6,10,15,1,8&#xA;23       18,7,9,16,20,5,11,14,2,23,13,12,4,21,15,10,6,19,17,8,1,3,22&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Winning Criteria&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes will be the winner! Good luck and happy golfing!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;TODO&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;-More test cases&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Feedback requested:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The Python program I've thrown together to provide solution verification is probably a bit shonky, I'm not that strong a Python programmer. If anyone has any comment/criticisms feel free to let me know, or improve it yourself!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As has been pointed out that this challenge is similar to a few others which ask for a Hamiltonian cycle. In my opinion this is suitably different, as this is looking for a Hamiltonian path, and the input is far simpler than the other challenges. What do people think?&lt;/p&gt;&#xA;" OwnerUserId="41020" LastEditorUserId="41020" LastEditDate="2018-03-21T09:21:00.713" LastActivityDate="2018-03-21T09:21:00.713" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14576" PostTypeId="2" ParentId="2140" CreationDate="2018-01-12T15:36:18.383" Score="1" Body="&lt;h1&gt;Solve the Square-Sum problem&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Based on these (very good) Numberphile videos:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.youtube.com/watch?v=G1m7goLCJDY&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Square-Sum problem&lt;/a&gt; and its &lt;a href=&quot;https://www.youtube.com/watch?v=7_ph5djCCnM&quot; rel=&quot;nofollow noreferrer&quot;&gt;extra footage&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The Problem:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given a list of integer numbers &lt;code&gt;[1,n]&lt;/code&gt; where &lt;code&gt;n≥15; n≠18, 19, 20, 21, 22, 24&lt;/code&gt;, your task is to arrange those numbers in a way such that the sum of two consecutive numbers is a square number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example for &lt;code&gt;n=15&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Original sequence: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15&#xA;Square-sum of it: 8 1 15 10 6 3 13 12 4 5 11 14 2 7 9&#xA;                   | |  |  | | |  |  | | |  |  | | |&#xA;                  3² 4² 5² 4²3²4² 5² 4²3²4² 5² 4²3²4²&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This problem can be solved by creating a graph of every sum of two numbers in the sequence that result in a square number:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ZsHDU.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZsHDU.png&quot; alt=&quot;Graph&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From that graph, it's possible to find its &lt;a href=&quot;http://mathworld.wolfram.com/HamiltonianPath.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hamiltonian Path&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/fsQf6.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/fsQf6.png&quot; alt=&quot;Hamiltonian Path&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This path, if existing, is the solution to the square-sum problem.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;---Under Construction---&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sandbox:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Suggestions?&lt;/li&gt;&#xA;&lt;li&gt;Dupe?&lt;/li&gt;&#xA;&lt;li&gt;Test cases are under construction&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="74163" LastActivityDate="2018-01-12T15:36:18.383" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14577" PostTypeId="1" CreationDate="2018-01-12T20:41:28.750" Score="27" ViewCount="671" Body="&lt;p&gt;It's been a couple years since &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5056/do-we-really-want-latex-mathjax-right-now&quot;&gt;PPCG voted against MathJax&lt;/a&gt;. Since then, the vote ratio has changed significantly, and most seem to be in favor of MathJax. However,  it is &lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt; and no change will be enacted on the current votes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The issue then was weird-looking search results, odd indentation and broken stack snippets due to &lt;code&gt;$&lt;/code&gt; being used in code. There are solutions to most of these, however. One solution is to escape all instances of &lt;code&gt;$&lt;/code&gt; in code (like it's done with &lt;code&gt;&amp;lt;&lt;/code&gt; and &lt;code&gt;&amp;gt;&lt;/code&gt;), which sounds fairly tedious but most of the work could automated if TIO were to do it. Not a great solution but some might believe having MathJax outweighs the cons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We've had a lot of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; questions (and answers) since and they would &lt;em&gt;greatly&lt;/em&gt; benefit from having actual mathematical expressions that look ridiculously better than if they were done with meek markdown formatting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd like to revisit this issue with another vote as opinions and ideas have changed since then.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should MathJax be enabled again?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;Please vote on the answers with approaches, not on the question based on your opinion on Mathjax.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="68615" LastEditorUserId="68942" LastEditDate="2021-04-27T17:19:02.500" LastActivityDate="2021-04-27T17:19:02.500" Title="Can we have MathJax back?" Tags="|discussion|feature-request|status-completed|latex|" AnswerCount="3" CommentCount="8" FavoriteCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14578" PostTypeId="2" ParentId="14577" CreationDate="2018-01-12T21:54:06.410" Score="40" Body="&lt;h1&gt;Yes, bring MathJax back&lt;/h1&gt;&#xA;&lt;p&gt;Advantages of having MathJax on Programming Puzzles &amp;amp; Code Golf:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A lot of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt; challenges and answers (and not only those!) would benefit from having it back. This is &lt;em&gt;&lt;strong&gt;a lot&lt;/strong&gt;&lt;/em&gt; – At the time of writing, about 12.19 percent of the challenges are mathematics-related, not to mention that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; is our third most frequented tag.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Rather than having to type our maths using third-party services, and then uploading pictures which would clutter the entire page, while still not being completely aesthetically pleasant, we would have a built-in way to use these equations that would overall bring a design improvement to the entire site.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Disadvantages of having MathJax (mostly those that were mentioned in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5056/do-we-really-want-latex-mathjax-right-now&quot;&gt;2015 post that has disabled it&lt;/a&gt;) and their possible solutions (but they no longer seem to apply):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Snippets that contain &lt;code&gt;$&lt;/code&gt; would mess up the search query and / or markdown. As &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5059/59487&quot;&gt;pointed out&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/3808/doorknob&quot;&gt;Doorknob&lt;/a&gt;, the &lt;a href=&quot;https://electronics.meta.stackexchange.com/a/5206/27816&quot;&gt;fix&lt;/a&gt; is easy. Use &lt;code&gt;\$&lt;/code&gt; or other separators instead of &lt;code&gt;$&lt;/code&gt; for starting / ending MathJax passages.&lt;/li&gt;&#xA;&lt;li&gt;Code snippets containing &lt;code&gt;$$&lt;/code&gt; are a problem – unless the escaping issue has been addressed since 2015, not sure – the separators for non-inline, centred expressions are not site-settable. I am sure we would find a work-around, though, because stack-snippets and the search query are still two very important features of this site. If this would still be a problem, we could simply just use inline math with &lt;code&gt;\$&lt;/code&gt;. However, the fix is rather easy as discussed in &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/42250692#42250692&quot;&gt;chat&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Example Answers and Challenges that would take advantage of it&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://codegolf.stackexchange.com/a/74372/12012&quot;&gt;Calculate the number of primes up to N&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/143822/&quot;&gt;(-a) &amp;#215; (-a) = a &amp;#215; a&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;Wheat Wizard&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://codegolf.stackexchange.com/a/105014/12012&quot;&gt;Absolute Sums of Sidi Polynomial Coefficients&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Some answers to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/133754&quot;&gt;One OEIS after another&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/caird-coinheringaahing&quot;&gt;caird coinheringaahing&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/18028/largest-number-printable&quot;&gt;Largest Number Printable&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12626/vereos&quot;&gt;Vereos&lt;/a&gt;, and all its answers.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/147668/determinant-of-an-integer-matrix/147723#147723&quot;&gt;Determinant of an Integer Matrix&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/48934/leaky-nun&quot;&gt;Leaky Nun&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/151519/59487&quot;&gt;How lit is this mountain? &lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/59487/mr-xcoder&quot;&gt;Mr. Xcoder&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/104681/59487&quot;&gt;Coprimes up to N&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/120621/golf-a-transcendental-number/120635#120635&quot;&gt;Golf a transcendental number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/20260/xnor&quot;&gt;xnor&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/152078/approximate-definite-integrals-using-riemann-sums&quot;&gt;Approximate definite integrals using Riemann sums&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/59487/mr-xcoder&quot;&gt;Mr. Xcoder&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And the list goes on. As you might have seen, challenges and answers from various tags, not only code-golf would have a benefit from re-enabling it. Now, we can’t just exempt this site from having nicely-rendered mathematical insights, purely due to some separators, right?&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-27T10:06:59.327" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14579" PostTypeId="2" ParentId="14577" CreationDate="2018-01-12T22:09:15.603" Score="17" Body="&lt;h1&gt;Add support back, but change the delimiter&lt;/h1&gt;&#xA;&lt;p&gt;I think MathJax would be fine, and see Xcoder's answer for more reasons why.  However, the reasons it were disabled still stand:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Messed up regexes, since MathJax can trigger inside code blocks for whatever reason&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Odd-looking search results (though in general I think this applies to regexes in search results)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Breaks stack snippets that we have, including the leaderboard one.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;But as far as I can tell, all of these would be fixed by changing the delimiter. Something like &lt;code&gt;\$&lt;/code&gt; would work, but I'm open to other suggestions.&lt;/p&gt;&#xA;" OwnerUserId="46271" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-12T22:09:15.603" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="14580" PostTypeId="2" ParentId="8047" CreationDate="2018-01-13T01:55:44.763" Score="37" Body="&lt;h1&gt;The prime numbers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We have &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot;&gt;226 questions about prime numbers&lt;/a&gt; at the time of writing. Almost every single one of these involves some adaptation of the “canonical prime checking code” or the “canonical prime generator”. Primes are notorious for not really conforming to any mathematical symmetry in a lot of ways, so very often, there is no way around a “brute force” approach: you just do exactly what the challenge tells you to do with your bit of primality logic; and that bit of logic is usually the “ungolfable” part.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I beg you — I &lt;em&gt;plead&lt;/em&gt; you — consider &lt;em&gt;any&lt;/em&gt; other integer sequence for once. Spice things up! Whatever challenge you were going to write called “Onerous primes” or “Highfalutin primes” or “Supercalifragilistic primes”: ask it about the &lt;a href=&quot;http://oeis.org/A000069&quot; rel=&quot;nofollow noreferrer&quot;&gt;odious numbers&lt;/a&gt; or the &lt;a href=&quot;https://oeis.org/A000959&quot; rel=&quot;nofollow noreferrer&quot;&gt;lucky numbers&lt;/a&gt; or the &lt;a href=&quot;https://oeis.org/A002858&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ulam numbers&lt;/a&gt; instead. Or heck, ask it about the &lt;a href=&quot;https://oeis.org/A000290&quot; rel=&quot;nofollow noreferrer&quot;&gt;squares&lt;/a&gt;!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There isn’t anything wrong with the prime numbers, but there isn’t anything &lt;em&gt;particularly&lt;/em&gt; nice about them either. In fact, primality is quite an “ugly” condition, in the sense that there are no formulas for the next prime after \$p\$, or the number of primes below \$n\$, etc. This is what makes them interesting to study from a mathematical point of view, but they’re a nuisance to compute things about, because you can’t apply very many tricks, and this might actually &lt;em&gt;limit&lt;/em&gt; the set of approaches golfers could reasonably take to solve your challenge with.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please, give this some thought before you post the 227th, or 228th, or 229th question asking us to find “the n-th prime number such that (blah blah blah).”&lt;/p&gt;&#xA;" OwnerUserId="3852" LastEditorUserId="3852" LastEditDate="2018-06-25T16:59:49.277" LastActivityDate="2018-06-25T16:59:49.277" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="14582" PostTypeId="2" ParentId="14511" CreationDate="2018-01-13T13:08:51.010" Score="10" Body="&lt;h1&gt;Novel scoring mechanism&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A challenge posted in 2017 that used a new approach to scoring that made for interesting competition.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This could be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; with a defined score calculation, or a modification of an existing challenge type like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2018-01-13T13:08:51.010" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14583" PostTypeId="2" ParentId="14511" CreationDate="2018-01-13T22:27:05.160" Score="6" Body="&lt;h2&gt;Best Showcase of a New Language&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(from @AdmBorkBork's &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10966/42545&quot;&gt;proposal&lt;/a&gt; last year)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is for new languages (golfing or otherwise) created in or after December 2016 (meaning, the first commit on GitHub or the like was from that date). The category is designed to highlight the answer that best shows the features, tricks, and benefits of using this new language. The author of the answer does not necessarily need to have been the author of the language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answers from &quot;Showcase your language&quot; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; challenges are ineligible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(If someone would like to compile a list of eligible languages here, please do so)&lt;/p&gt;&#xA;" OwnerUserId="42545" LastActivityDate="2018-01-13T22:27:05.160" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14585" PostTypeId="2" ParentId="5243" CreationDate="2018-01-14T04:12:50.897" Score="5" Body="&lt;h1&gt;100 rep for a neural network (or other new thing) that writes Moby Dick&lt;/h1&gt;&#xA;&lt;p&gt;This will be awarded in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/152856/write-moby-dick-approximately&quot;&gt;Write Moby Dick,&#xA;approximately&lt;/a&gt; when one of the following conditions is met:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;an answer is posted based on neural networks and gets a reasonable score. (It doesn't need to compete with the top answers, just do reasonably well.)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;an answer is posted that takes a different method from the existing answers, in my subjective opinion. All the current top answers use variations on a Markov model (i.e. store substrings of length n and guess the most common next letter); I'm looking for an answer that does something significantly different from this. As above, this should score reasonably well but need not compete with the top answers.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;an answer is posted that (a) uses a sophisticated method (in my subjective opinion), and (b) has a good explanation of that method, where &amp;quot;good explanation&amp;quot; means I could implement it myself without reading the code. This bounty could be awarded to an existing answer, if one is updated with a good explanation.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="21034" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-04-07T10:10:23.437" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="14587" PostTypeId="1" CreationDate="2018-01-15T15:15:32.297" Score="23" ViewCount="681" Body="&lt;p&gt;One of PPCG's oldest rules, mentioned in &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;What topics can I ask about here?&lt;/a&gt;, is that all answers to challenge questions must:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Be a serious contender for the winning criteria in use. For example, an entry to a code golf contest needs to be golfed, and an entry to a speed contest should make some attempt to be fast.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;While &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8749/12012&quot;&gt;we're still working on the wording&lt;/a&gt;, at least for code golf challenges, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10836/12012&quot;&gt;we have some guidelines&lt;/a&gt; and rarely ever dispute whether a particular post is a serious contender or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For other types of challenges, the boundaries seem less clear. In particular, these two answers seem to divide the community.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/69934/12012&quot;&gt;“Mean of all channels”&lt;/a&gt;, answering &lt;a href=&quot;https://codegolf.stackexchange.com/q/69930/12012&quot;&gt;Paint Starry Night, objectively, in 1kB of code&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/152908/12012&quot;&gt;”Most common character”&lt;/a&gt;, answering &lt;a href=&quot;https://codegolf.stackexchange.com/q/152856/12012&quot;&gt;Write Moby Dick, approximately&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Both answers have several things in common:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Compared to other answers, they use a &lt;em&gt;very&lt;/em&gt; simple strategy.&lt;/li&gt;&#xA;&lt;li&gt;They have a worse score than all other answers to their respective challenges.&lt;/li&gt;&#xA;&lt;li&gt;They have more upvotes than all other answers to their respective challenges.&lt;/li&gt;&#xA;&lt;li&gt;They have more downvotes than all other answers to their respective challenges.&lt;/li&gt;&#xA;&lt;li&gt;Supporters of these answers argue that they're useful as baseline submissions, as answers with more complex approaches should be compared to these ones.&lt;/li&gt;&#xA;&lt;li&gt;Critics of these answers argue that they're not serious contenders for the winning criteria in use. Both answers have been flagged for moderator attention.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Voting habits are out of the scope of this discussion, but I do hope to reach a consensus with regard to these two questions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Should these answers be considered serious contenders?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If not, they'd have to be removed in compliance with our &lt;a href=&quot;http://meta.codegolf.stackexchange.com/a/7990/12012&quot;&gt;policy about answers not meeting the challenge specification&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the answer to the above question is &lt;strong&gt;no&lt;/strong&gt;, how could baseline solutions be posted instead?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Just because something isn't a valid answer according to our rules, doesn't mean that is isn't valuable at all.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2022-12-22T16:25:47.710" Title="Are baseline submissions serious contenders?" Tags="|discussion|policy|answers|" AnswerCount="11" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="14588" PostTypeId="2" ParentId="14587" CreationDate="2018-01-15T16:37:40.180" Score="0" Body="&lt;p&gt;I think there are two separate issues to consider when trying to determine if an answer is a serious contender:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The approach&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The implementation&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the approach can be as nonoptimal as anything, and likely nobody will complain. If the code that implements the approach is not even trivially golfed, almost everyone will agree that the answer is not a serious contender.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As I see it, the case with the two particular answers in question is that one side views the approach as trivial, highly nonoptimal, and therefore not a serious contender, whereas the other side points out that the implementation is as well-optimized as it can be with that approach, and that there is no well-defined line after which an approach becomes a non-serious one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As the supporters argue, both of these answers can be thought of as a sort of a baseline for what kind of a score an answer should at least be able to attain. However, like the property of being a serious contender, it is more or less subjective to decide what is a good baseline. Also, I'm not convinced that a solution that marks a baseline should be posted as an answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My suggestion is, that for optimization &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenges&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenges&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenges&lt;/a&gt;s, like the ones in question, where the score doesn't depend on the language used to write the answer, the challenge asker should define a baseline better than which an answer has to score to be considered a serious contender.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The baseline should probably be based on the score of a trivial approach, much like the two answers at issue here, perhaps slightly buffered against similar but better implemented trivial approaches. The baseline/limit should be stated in the question, perhaps along with an implementation of it. If it would crowd the question body too much, the implementation could be posted as a community-wiki answer by the challenge poster.&lt;/p&gt;&#xA;" OwnerUserId="61405" LastActivityDate="2018-01-15T16:37:40.180" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14589" PostTypeId="1" CreationDate="2018-01-15T20:16:17.670" Score="2" ViewCount="133" Body="&lt;p&gt;Our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard Loopholes&lt;/a&gt; meta post is extremely helpful for simplifying challenges, and every time I post a challenge, I have to go look up the link for new users who might be unaware of it. Can we feature it permanently on meta since it is so useful?&lt;/p&gt;&#xA;" OwnerUserId="69912" LastEditorUserId="31716" LastEditDate="2018-01-15T20:28:12.293" LastActivityDate="2018-01-15T20:28:12.293" Title="Can Standard Loopholes be featured?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14590" PostTypeId="2" ParentId="14587" CreationDate="2018-01-15T20:22:26.553" Score="-1" Body="&lt;h2&gt;Require them to be posted CW&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Only allow baseline submissions to be posted &lt;a href=&quot;https://meta.stackexchange.com/questions/11740/what-are-community-wiki-posts&quot;&gt;Community Wiki&lt;/a&gt;, where the poster doesn't get rep and everyone is encouraged to edit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Baseline answers are a helpful resource for coders to check if their method actually does decently. It saves everyone the world of writing the same basic code to compare, and its boilerplate can perhaps be used as a starting point. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think CW status fits well. It's not really a submission that deserves rep (much less the kajillions given by HNQ voters), but a community resource that any kind poster can write or contribute to, including the question asker. And the CW label makes posters less shy about editing the formatting, fixing the code, adding explanations, comparing alternatives, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To make sure I'm answering the question, I don't see baseline submissions as serious contenders at all, otherwise the phrase &quot;serious contender&quot; is basically meaningless, but there's a good niche for them as CW posts.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2018-01-15T20:22:26.553" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14591" PostTypeId="2" ParentId="14589" CreationDate="2018-01-15T20:28:11.013" Score="8" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Permanently featured posts aren't supposed to exist; Community removes the &lt;a href=&quot;/questions/tagged/featured&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;featured&amp;#39;&quot; rel=&quot;tag&quot;&gt;featured&lt;/a&gt; once a month. We make an exception for the sandbox and manually re-feature it each month, but the &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq&lt;/a&gt; will have to do for everything else. The main reason for this is that there's a limited amount of vertical space in the side bar. Sometimes, when there are featured posts on Mother Meta or blog posts, not even a single one of our &lt;em&gt;Hot Meta Posts&lt;/em&gt; is visible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not saying that a little extra visibility would hurt for the standard loopholes, but even if there were space for more featured posts, there are others I consider more valuable for new users, such as our policy about invalid answers, defaults for I/O, and things to avoid when writing challenges. These threads are important for &lt;em&gt;all&lt;/em&gt; new users; the standard loopholes are only relevant for people who try to cheat.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2018-01-15T20:28:11.013" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14592" PostTypeId="2" ParentId="14587" CreationDate="2018-01-16T02:12:18.450" Score="16" Body="&lt;h2&gt;If a baseline solution is given, it should be included in the challenge text, &lt;em&gt;not&lt;/em&gt; posted as an answer&lt;/h2&gt;&#xA;&lt;p&gt;While baseline solutions are useful, they are still (often) not serious contenders for winning the challenge, so they have no place as answers. So, include them in the challenge text instead. This is common practice: &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=reference+implementation+is%3Aq&quot;&gt;many existing challenges&lt;/a&gt; include reference implementations where such implementations would be considered non-competing, but still are a useful resource for users seeking to answer the challenge.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-16T02:12:18.450" CommentCount="19" ContentLicense="CC BY-SA 3.0" />
  <row Id="14593" PostTypeId="2" ParentId="14587" CreationDate="2018-01-16T08:26:26.757" Score="-11" Body="&lt;h1&gt;Programmers can be lazy sometimes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let people write the answer they want to (if these answers run as specified in the challenge). People are free to downvote any solution but not to delete them. This is because you could not see something in their solution that the authors does see.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This has only two exceptions. 1) If the author of these baseline submissions makes more than 1 solution a day (or has a different account on PPCG and write more than 1/day such answer on multiple accounts). 2) Or if the solution's length &gt; 3000 bytes (or a convenient number of bytes). The problem is too many posts of this kind, and space reserved in memory to store them.&lt;/p&gt;&#xA;" OwnerDisplayName="user58988" LastEditorDisplayName="user58988" LastEditDate="2018-01-16T22:11:19.517" LastActivityDate="2018-01-16T22:11:19.517" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14594" PostTypeId="2" ParentId="14587" CreationDate="2018-01-16T12:49:51.093" Score="7" Body="&lt;blockquote&gt;&#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;Should these answers be considered serious contenders?&lt;/li&gt;&#xA;  &lt;li&gt;If the answer to the above question is &lt;strong&gt;no&lt;/strong&gt;, how could baseline solutions be posted instead?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I think there's a problem in the framing of the question, because in the case of the Moby Dick answer I would argue that it is &lt;em&gt;neither&lt;/em&gt; a serious contender &lt;em&gt;nor&lt;/em&gt; a baseline solution. The baseline solution there is either (a) the literal text with a &lt;code&gt;charAt&lt;/code&gt; call, for a score slightly greater than 1215235; or (b) a compressed version of the literal text with uncompression and &lt;code&gt;charAt&lt;/code&gt;, with a score slightly greater than 762421.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would have said (a) unconditionally were it not that the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/revisions/14546/17&quot;&gt;sandbox entry&lt;/a&gt; (probably only visible with 20k rep) explicitly says that it is designed with the intention that (b) &lt;em&gt;not&lt;/em&gt; be a winning strategy, suggesting that the author intended (b) as a baseline.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That makes that answer in particular &lt;strong&gt;&gt;25% worse&lt;/strong&gt; than the baseline.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;As for what &lt;em&gt;serious contender&lt;/em&gt; means, I would echo &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8750/194&quot;&gt;Mego's answer to one of the linked questions&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;In short, if the only way a submission could win a challenge is if no other solutions were posted, it's almost certainly not a serious contender&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;On that basis, baseline solutions are not serious contenders (and worse-than-baseline solutions &lt;em&gt;a fortiori&lt;/em&gt; are not either).&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-01-16T12:49:51.093" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14595" PostTypeId="2" ParentId="14587" CreationDate="2018-01-16T13:24:15.693" Score="5" Body="&lt;h1&gt;Reword what a serious contender is, it is too elitist&lt;/h1&gt;&#xA;&lt;p&gt;Our current definition of serious contender is that it &lt;em&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8750/41723&quot;&gt;“is a submission which makes a serious effort towards optimizing the submission's score”&lt;/a&gt;&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This is in my opinion not the right definition. In particular, a new golfer could submit an answer that can be golfed a lot with simple, well-known tricks. With that definition, one could argue that such answers are not serious contenders because the newcomer did not make a serious effort into learning simple golfing tricks to improve their answer, which is obviously ridiculous.&lt;/p&gt;&#xA;&lt;p&gt;A better definition to me would be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A serious contender is a submission which does not make a deliberate effort towards degrading its own score.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;With this definition, common non-contender issues such as long variable names are still non-contender. However, beginner answers are now objectively serious contenders.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;And with this definition, &amp;quot;baseline&amp;quot; answers (whatever it may be) are also serious contenders, because they are not intentionally trying to get a bad score.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;We also have to remind ourselves that not everyone can come up with strategies to solve &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; questions that the seasoned PPCG user would consider &amp;quot;interesting&amp;quot;.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Note&lt;/h3&gt;&#xA;&lt;p&gt;I also consider our current definition of serious contender to be bad for the following reasons: many PPCG challenges can be solved by trivially chaining a bunch of built-ins in many languages, which is far from requiring &amp;quot;a serious effort&amp;quot;.&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-16T13:29:27.877" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14596" PostTypeId="2" ParentId="14587" CreationDate="2018-01-16T15:39:14.950" Score="7" Body="&lt;h1&gt;Yes, but it depends on how you define baseline&lt;/h1&gt;&#xA;&lt;p&gt;I'd like to make 2 points here:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Baseline submissions are defined by the strategy they choose&lt;/li&gt;&#xA;&lt;li&gt;It's hard (if not impossible) to define a line that divides the baseline and the winner&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h1&gt;1. Baseline submissions are defined by the strategy they choose&lt;/h1&gt;&#xA;&lt;p&gt;I believe that baseline submissions &lt;em&gt;can&lt;/em&gt; be competitive.  But first, an analogy:&lt;/p&gt;&#xA;&lt;p&gt;Let's say you're playing some laser tag with some friends.  Some competitive strategies you could try are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Run around shooting everybody, trying to hit as many others as possible.&lt;/li&gt;&#xA;&lt;li&gt;Hide in a spot, trying to avoid getting hit, while defending against those approaching&lt;/li&gt;&#xA;&lt;li&gt;Team up with others to defeat large groups and defend each other&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Now, while the winner depends on the exact scoring rules and execution, &lt;strong&gt;the winning submission will most likely employ multiple strategies, or do a particular strategy really well&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;However, now lets say there's a KoTH with a similar premise.  Each of the following &lt;em&gt;baseline&lt;/em&gt; bots would be acceptable:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;def action(): stepForward(); shoot();&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;def action(): walkToWall(); shoot();&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;def action(): walkToAlly(); shoot();&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Here are some that &lt;em&gt;wouldn't&lt;/em&gt; be allowed:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;def action(): shoot();&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;def action(): walk();&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;def action(): die();&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Each of the &lt;em&gt;baseline&lt;/em&gt; submissions follow a legitimate, competitive strategy.  None of them will likely win because their implementation is too simple&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, &lt;strong&gt;baseline is defined by the strategy, and if that strategy is competitive&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;2. It's hard (if not impossible) to define a line that divides the baseline and the winner&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/69930/paint-starry-night-objectively-in-1kb-of-code/69934#69934&quot;&gt;&amp;quot;Mean of all channels&amp;quot;&lt;/a&gt; is following a legitimate strategy &amp;quot;pick a color similar to the image&amp;quot;.  If we disallow the baseline submission:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Would I be allowed to submit a simple, two color image with a dark blue bar on the left, and a light blue bar on the right? What about the &lt;a href=&quot;https://codegolf.stackexchange.com/a/70230/20198&quot;&gt;Java Voronoi submission&lt;/a&gt;?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Would I be allowed to post a 2x2 pixel image that was scaled up to the appropriate size?  What about 32x32?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Would I be allowed to use a super-lossy, built-in compression algorithm?  Does it matter &lt;em&gt;how&lt;/em&gt; lossy that compression algorithm is?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;It's easy to tell if a submission has a strategy.  (A white image is invalid because there's no strategy).  It's &lt;em&gt;hard to differentiate between a baseline strategy and the winning strategy&lt;/em&gt;.  This leaves us with 3 options:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Disallow all submissions that don't win (in their respective language)&lt;/li&gt;&#xA;&lt;li&gt;Make &amp;quot;serious contender&amp;quot; an ambiguous line between &amp;quot;baseline&amp;quot; and &amp;quot;winning&amp;quot; that we need to vote and debate about every time.&lt;/li&gt;&#xA;&lt;li&gt;Allow baseline submissions &lt;strong&gt;as long as they are implementing a viable strategy&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-16T22:54:42.557" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="14598" PostTypeId="2" ParentId="14587" CreationDate="2018-01-16T21:02:52.057" Score="3" Body="&lt;h1&gt;The problem is interesting -- who cares what the &quot;baseline&quot; is&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt;: I want more answers, not fewer. I want to explore ideas.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think that both &quot;Moby Dick&quot; and &quot;Starry Night&quot; are really interesting questions, and both of them have some great answers. But I also think we've taken a wrong turn somewhere: By even discussing to limit the answers to &quot;serious contenders&quot; by this or that definition, we are &lt;em&gt;killing&lt;/em&gt; some of the possibilities to create and to explore the very concepts behind the questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To me the two questions are great because they make me &lt;em&gt;think&lt;/em&gt; more than ordinary code golf questions, which usually have a somewhat upper limit to the amount of optimization. These particular questions on the other hand are more open ended, with virtually no limit for improvement, while they also have a great measurement for &quot;success&quot;; &quot;Moby Dick&quot; has a specially well balanced scoring system.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, it's not only the most successful (by an arbitrary score) answers that are &lt;em&gt;interesting&lt;/em&gt;*.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance, the first thing I thought of were n-grams and &lt;em&gt;what is the most common successor of input x?&lt;/em&gt; Turns out, someone already posted an answer using something like that. But the concept of n-grams is important, and simple and interesting. So then I started to think &lt;em&gt;what variations of this can I make? Can it be simplified? Generalized?&lt;/em&gt; That's when I tried the &quot;most common distance&quot; function. It doesn't do great. In fact, it's about 15% worse than always returning a space (&lt;a href=&quot;https://pastebin.com/qCL8uBWe&quot; rel=&quot;nofollow noreferrer&quot;&gt;here's a pastebin&lt;/a&gt; comparing the two).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The premise sounds kinda promising, but the result is disastrous. By the scoring system it's not competitive at all, but to me that doesn't make it any less &lt;strong&gt;interesting&lt;/strong&gt;. In fact this is an interesting finding by its own right. It also makes you appreciate the other answers more because you can see how much better they do, and some with quite a small amount of code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But if &quot;always return space&quot; should be forbidden because of its bad score, then obviously this other solution is &lt;em&gt;way&lt;/em&gt; under the threshold. And this I think is a pity. Because I don't really care that much for the &lt;em&gt;one&lt;/em&gt; best answer with the &lt;em&gt;one&lt;/em&gt; best score; I like to see the whole picture from as many angles as possible. This is what all of you want to forbid, and I can't see why.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By instead allowing any answer, regardless of an arbitrary score, we can make up a &lt;strong&gt;catalogue&lt;/strong&gt; of concepts around the subject, and explore and discuss more paths and theories. &lt;strong&gt;Any answer with an original idea is worth keeping.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;*) Not saying that my &quot;print a space&quot; solution was super interesting. I don't care. This is not a defense of that post, this an argument to &lt;strong&gt;allow exploring ideas&lt;/strong&gt;.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="4372" LastEditorUserId="39490" LastEditDate="2018-01-26T10:13:47.373" LastActivityDate="2018-01-26T10:13:47.373" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14600" PostTypeId="2" ParentId="14569" CreationDate="2018-01-17T01:53:32.593" Score="2" Body="&lt;h1&gt;Change it&lt;/h1&gt;&#xA;&lt;p&gt;But don't require answers to change for the new text.&lt;/p&gt;&#xA;&lt;p&gt;This reminds me of my first challenge where I changed the text part way through and just required NEW answers to change and old answers could change or stay the same. Mind you it also golfed down the text.&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-17T01:53:32.593" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14601" PostTypeId="1" CreationDate="2018-01-17T05:31:44.560" Score="31" ViewCount="394" Body="&lt;p&gt;A long time ago, in a chat room far, far away, there was an idea proposed for a PPCG Podcast, featuring members of the site talking about PPCG- and programming-related things. Due to time issues, the podcast project never really got off the ground.&lt;/p&gt;&#xA;&lt;p&gt;Recently, I took it upon myself to revive the project, as a monthly podcast. We had an excellent first episode, which is now ready for your consumption! Download links (as well as a list of episodes) can be found at the bottom of this post.&lt;/p&gt;&#xA;&lt;p&gt;I am always looking for feedback, so please do not hesitate to leave feedback here (as an answer) or in the &lt;a href=&quot;https://chat.stackexchange.com/rooms/48368/ppcg-podcast&quot;&gt;PPCG Podcast chatroom&lt;/a&gt;. If you have a topic proposal or wish to be a guest, please use the chatroom for that - the comments and answers here would get too cluttered otherwise.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Episodes&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Episode 0: Mego, DJMcMayhem, Doorknob, Nick Clifford (Topics: Spectre and Meltdown, Net Neutrality, Programming Language Trends and Development, PPCG v2): &lt;a href=&quot;https://drive.google.com/open?id=1GmfQEQ1gT22TPHH2EfWWe-Uzx0vp9QI8&quot; rel=&quot;nofollow noreferrer&quot;&gt;mp3&lt;/a&gt; &lt;a href=&quot;https://drive.google.com/open?id=1Qr8OKWf4fFmhrNDP3ZDVJRoxZLqyb8Qw&quot; rel=&quot;nofollow noreferrer&quot;&gt;ogg&lt;/a&gt; &lt;a href=&quot;https://drive.google.com/open?id=1987r2vciSQkMz1axfNHkZTwAgZHy7kpU&quot; rel=&quot;nofollow noreferrer&quot;&gt;wma&lt;/a&gt; &lt;a href=&quot;https://youtu.be/IAEO1h5Y05c&quot; rel=&quot;nofollow noreferrer&quot;&gt;YouTube&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-25T19:00:04.927" Title="Introducing the PPCG Podcast!" Tags="|discussion|" AnswerCount="0" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="14602" PostTypeId="2" ParentId="14587" CreationDate="2018-01-17T07:42:04.553" Score="2" Body="&lt;h1&gt;1 - They are something we should try to mitigate, but not prevent&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I am very much in support of posters of these questions adding solutions of their own to their questions in order to give a baseline. I agree with the opinions stated that throwaway answers designed to just &quot;get the ball rolling,&quot; aren't often very interesting and aren't deserving of the attention they get. But I don't think that we should delete them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's been mentioned before, with regard to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14354/42833&quot;&gt;trivial solutions&lt;/a&gt;, that taking action against solutions that aren't particularly &quot;good&quot; for some definition thereof isn't ideal. Votes will, unfortunately, always tend toward certain answers, whether it be because they're &lt;a href=&quot;https://meta.stackexchange.com/questions/9731/fastest-gun-in-the-west-problem&quot;&gt;early&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/55461/42833&quot;&gt;funny&lt;/a&gt;, or in an &lt;a href=&quot;https://codegolf.stackexchange.com/a/97542/42833&quot;&gt;aptly-named&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/57059/42833&quot;&gt;language&lt;/a&gt;. You can probably think of more examples, too (the easiest way would be to look at the most popular challenges). Trying to fight the will of the people by taking direct action against them is, in my opinion, foolish.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Preemptive action, to me, is the best solution, but it is of course not perfect. For a problem like this, you take away the possibility for someone posting a simple baseline by writing one yourself and including it in your post. Does that prevent someone from writing one anyways? No. There might be a slightly less simple baseline that they implement or maybe they'll post the baseline in another language, but we shouldn't be taking pains to account for all of these possibilities.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I feel like to some extents there is an implicit (at least in the way I am interpreting it, feel free to argue with me) claim that these posts don't &quot;deserve&quot; their votes or attention. Trying to make sure answers get votes proportional to the ones they &quot;deserve&quot; is ridiculous. HNQ-drawn voters have, for better or for worse, votes as powerful as our own. It might feel unfair to the regulars -- I for one am displeased to see a trivial solution in a golfing language overshadow a creative solution in another -- but the votes have been cast.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;2 - On elitism&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I also wanted to second what @Fatalize had to say and give my own input regarding elitism. Let me preface this by saying that I like this site a lot. There have been tons of interesting challenges I've really enjoyed answering and answers I've really enjoyed reading. But I do think there are some things that make it difficult for newcomers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I feel like PPCG is a bit insular as a community, which isn't too much of a problem for most users. The standard that submissions and answers are held to and the pretty strict policing, in fact, are in part what makes the content on this site so good. I see similar quality control on other Stack Exchange sites. However, it can be daunting to the uninitiated, which I feel is spoken to by the number of new questions and answers we get that need rephrasing, edits, and sometimes even deletion. If I recall correctly, I was able to join in with relative ease because I lurked enough to pick up on the sort of &quot;culture,&quot; for lack of a better word, but not everyone is as careful as I am, nor should they have to be.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In answers, there's the way we format them to include bytecount, the way we count bytes for some languages, the (optional, but encouraged) use of TIO, explanations, so on and so forth. In questions, there's the use of the sandbox, standard guidelines, policies on default exceptions, etc. I'm sure most of this is covered in the guide to the site, but this doesn't make it any less daunting. And let's not forget &quot;culture&quot;-specific things that people need to learn (what golfing and esoteric languages are, references such as &quot;crossed out 44,&quot; outgolfing Dennis, etc.).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's nothing wrong with any of this, and I think as a whole the community is welcoming and kind, but it's still worth bearing in mind how PPCG might appear to those who don't visit it every day. Any transition to a new community requires some getting used to, but for a public community like PPCG I think it's best to try to be cognizant of this public presence, especially of the people who might not be so in the know. I feel like I'm sort of on the outskirts of the community of PPCG, and I've been visiting the site semi-frequently for over two years now (wow). Keep the guys who are seeing it for the first time in mind, too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Not that I think PPCG has a significant problem with this, I've said before and I'll say again that I think for the most part it's welcoming. But in my opinion, trying to police things that get more and more specific may make it harder for newer members to contribute.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Etc&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Sorry for the wall of text; I realize I wrote a lot for this. I didn't really intend to, I guess it's something I'm more passionate about than I thought.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I welcome any argument against what I have to say.&lt;/p&gt;&#xA;" OwnerUserId="42833" LastActivityDate="2018-01-17T07:42:04.553" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14603" PostTypeId="1" AcceptedAnswerId="14609" CreationDate="2018-01-17T14:47:11.643" Score="9" ViewCount="227" Body="&lt;p&gt;I'd like feedback on this challenge I posted which was closed as unclear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/153424/make-a-1-a-2-a-3-evaluate-to-true&quot;&gt;Make (a ==1 &amp;amp;&amp;amp; a== 2 &amp;amp;&amp;amp; a==3) evaluate to true?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One issue raised was the vagueness of &quot;reasonably equivalent to&quot;. I was just trying to communicate &lt;code&gt;$a == 1&lt;/code&gt; for PHP, or &lt;code&gt;a == 1&lt;/code&gt; for JavaScript, so on. I know that different languages handle conditionals different. Is there a way I could phrase this requirement in a more strict way? Perhaps &quot;Must do an equality comparison on a variable integer of 1, to integer of 2, and to integer of 3, in the same conditional&quot;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another issue raised is that some languages do not involve if statements or Boolean. If I'm more clear that the language must support these concepts, will it be allowed, or does a challenge need to specify a language or support all languages?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, I heard this is an Underhanded challenge, which is not allowed. I haven't found a hard definition on it, but I did find &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8325/the-state-of-the-underhanded-tag&quot;&gt;this discussion on it&lt;/a&gt; and understand the general idea that it's a question that is tricky. Can someone provide a solid definition. Can this challenge can be made to not be Underhanded?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this challenge salvageable?&lt;/p&gt;&#xA;" OwnerUserId="41837" LastEditorUserId="41837" LastEditDate="2018-01-17T15:05:56.367" LastActivityDate="2018-01-17T15:13:06.720" Title="Can this challenge be made on topic?" Tags="|discussion|closed-questions|" AnswerCount="2" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="14604" PostTypeId="1" CreationDate="2018-01-17T15:03:15.717" Score="2" ViewCount="155" Body="&lt;p&gt;The question is all in the title:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Must askers be able to answer their own question?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This question had been asked before, but may be easier to find than the most directly relevant previous question, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1352&quot;&gt;Ability to Solve Own Challenge as a Requirement&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are also relevant answers in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1350&quot;&gt;Basis for Voting to Close&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/107/69850&quot;&gt;What details should always be given for a code golf task?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="69850" LastEditorUserId="194" LastEditDate="2018-01-26T11:42:23.940" LastActivityDate="2018-01-26T11:42:23.940" Title="Must askers be able to answer their own question?" Tags="|discussion|" AnswerCount="0" CommentCount="2" ClosedDate="2018-01-25T18:36:17.670" ContentLicense="CC BY-SA 3.0" />
  <row Id="14606" PostTypeId="2" ParentId="14587" CreationDate="2018-01-17T15:05:17.820" Score="13" Body="&lt;h1&gt;&quot;Serious contender&quot; applies to the approach, &lt;em&gt;and&lt;/em&gt; the resulting implementation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We already apply this methodology to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; entries, even if we don't realize it. For example, an iterative solution may score 75 bytes while a recursive solution in the same language scores 70.  Or a solution in language X may score 80 bytes, while a solution in golflang Y scores 5. In any case, we don't declare the longer solution a non-contender, just because it happens to be losing, &lt;em&gt;provided that an effort is made to optimize for the particular winning criteria (e.g., extraneous whitespace).&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The same thing applies here. (Or, for that matter, to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenges that have &quot;joke&quot; submissions to get the ball rolling, but that's an aside.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For Starry Night, &lt;em&gt;an&lt;/em&gt; approach is to simply average the entire image. It might not be the &lt;em&gt;best&lt;/em&gt; approach, and it turns out that it isn't the best approach. The answer, however, made a serious attempt at solving the challenge for that particular approach. The author even updated the solution to a better color after an optimization was pointed out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For Moby Dick, &lt;em&gt;an&lt;/em&gt; approach is to output the most common character. It might not be the &lt;em&gt;best&lt;/em&gt; approach, and it turns out that it isn't the best approach. The answer, however, made a serious attempt at solving the challenge for that particular approach, by using the most common character and writing it in a language that optimized that portion of the scoring.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Just like with the code-golf answers, there could be (and likely will be) a better approach, but that doesn't make these answers &lt;strong&gt;&lt;em&gt;invalid.&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="42963" LastActivityDate="2018-01-17T15:05:17.820" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14607" PostTypeId="2" ParentId="14603" CreationDate="2018-01-17T15:09:37.667" Score="4" Body="&lt;p&gt;I would recommend you to check &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;The Sandbox&lt;/a&gt; post and propose your challenge there before posting it on the main site. There you'll get feedback and suggestions that'll help you avoid this exact problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regarding your questions, as HJM commented, &lt;em&gt;&quot;reasonably equivalent&quot;&lt;/em&gt; is kind of hard to define well enough. As to the language restriction, I recommend you read &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7339/74163&quot;&gt;this answer&lt;/a&gt;. I'll leave it to someone more experienced than me to answer the question regarding the Underhanded tag, since I myself get confused by it.&lt;/p&gt;&#xA;" OwnerUserId="74163" LastActivityDate="2018-01-17T15:09:37.667" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14609" PostTypeId="2" ParentId="14603" CreationDate="2018-01-17T15:13:06.720" Score="6" Body="&lt;p&gt;I think that the biggest issue with the challenge is the part where it's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt;. The simple definition for the underhanded tag is&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;An underhanded challenge is a challenge to write a program that looks as if it is doing one thing, but does something else.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;And I think that there's no way to avoid that. &lt;code&gt;(a == 1 &amp;amp;&amp;amp; a == 2 &amp;amp;&amp;amp; a == 3)&lt;/code&gt; looks like it should be false, and the challenge is to make it true, thus underhanded. Underhanded challenges have been determined to be off-topic here, so even with the other problems fixed I don't think it would be allowed.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastActivityDate="2018-01-17T15:13:06.720" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14610" PostTypeId="2" ParentId="2140" CreationDate="2018-01-17T17:59:49.687" Score="1" Body="&lt;h1&gt;Word ladder&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Word_ladder&quot; rel=&quot;nofollow noreferrer&quot;&gt;word ladder&lt;/a&gt; is a puzzle where the aim is to create the smallest sequence of steps between two fixed words (a starting word and a target word), where each step changes one letter to produce a new word.  All the intermediate words must be recognised in a dictionary (which will be supplied).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the target word is longer than the starting word, a step may &lt;em&gt;add&lt;/em&gt; a letter at any position instead of changing one; if it's shorter than the starting word, a step may &lt;em&gt;remove&lt;/em&gt; a letter instead of changing one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;HAND&#xA;BAND&#xA;BOND&#xA;FOND&#xA;FOOD&#xA;FOOT&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;FINGER&#xA;FINER&#xA;FINE&#xA;TINE&#xA;TONE&#xA;TOE&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;EYES&#xA;EYED&#xA;DYED&#xA;DEED&#xA;TEED&#xA;TEND&#xA;TENT&#xA;TENTH&#xA;TEETH&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program or function which accepts a dictionary of words and the two fixed words (i.e. a starting word and a target word), and produces an ordered list of intermediate words following the rules above.  You may choose to output the starting word, the target word, both, or neither.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may use any of the standard methods of input and output, and must not bypass the rules with any of the standard loopholes.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;&lt;em&gt;(I need some help with this part).&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The score is the number of dictionary lookups your program makes during a test run (or average of several test runs, if it's not deterministic) on a set of inputs with a simple English dictionary.  &lt;strong&gt;&lt;em&gt;Q: does this test set need to be prepared and included in the question?&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I don't really want to make this a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, as we'll just end up with simple brute-force algorithms; I really want to see creative use of the dictionary, either by pre-processing or perhaps by ordering candidate words.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there a way we can define a &quot;dictionary lookup&quot; and somehow separate the word generation/validation from knowledge of the fixed words, without making assumptions that the language has functions or other methods of isolating code?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can we require the dictionary to be a separate process, and provide a reference implementation?  I don't think we can, without excluding languages without reasonable inter-process communication (I'm thinking of PostScript, possibly JavaScript, and microcomputer BASIC).&lt;/p&gt;&#xA;" OwnerUserId="39490" LastEditorUserId="39490" LastEditDate="2018-01-18T14:44:46.330" LastActivityDate="2018-01-18T14:44:46.330" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="14614" PostTypeId="1" CreationDate="2018-01-18T16:11:27.627" Score="30" ViewCount="2894" Body="&lt;h3&gt;Final phase&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You have chosen the categories and the nominees for PPCG's annual “Best of”. Now it is time to pick the winners!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each of the thirteen categories is represented by an answer to this question, and each of these answers contains all nominations by the members of our community.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Voting mechanism&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each nominee has been added as a comment to its category's answer. In each category, the nominee whose comment has the highest number of votes by February 9, 03:00 UTC will be declared the winner of that category.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Further details&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Starting now, please do &lt;strong&gt;not&lt;/strong&gt; edit the answers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Please do &lt;strong&gt;not&lt;/strong&gt; add comments to the answers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Votes on the question and on answers are meaningless; only votes on comments count.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Feel free to vote for multiple nominees of the same category, including your own posts.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="60042" LastEditorUserId="12012" LastEditDate="2018-02-09T13:10:45.233" LastActivityDate="2018-02-09T13:10:45.233" Title="Cast your vote for “Best of PPCG 2017”!" Tags="|discussion|best-of|" AnswerCount="13" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14615" PostTypeId="2" ParentId="14614" CreationDate="2018-01-18T16:11:27.627" Score="5" Body="&lt;h2&gt;Best Showcase of a New Language&lt;/h2&gt;&#xA;&lt;p&gt;This is for new languages (golfing or otherwise) created in or after December 2016 (meaning, the first commit on GitHub or the like was from that date). The category is designed to highlight the answer that best shows the features, tricks, and benefits of using this new language. The author of the answer does not necessarily need to have been the author of the language.&lt;/p&gt;&#xA;&lt;p&gt;Answers from &amp;quot;Showcase your language&amp;quot; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; challenges are ineligible.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/114137/16766&quot;&gt;Division and remainder&lt;/a&gt; in BitCycle by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://esolangs.org/wiki/BitCycle&quot; rel=&quot;nofollow noreferrer&quot;&gt;BitCycle&lt;/a&gt; is a low-level 2D language that works by moving bits around on a playfield. (Think of it as the lovechild of &lt;a href=&quot;http://esolangs.org/wiki/Fish&quot; rel=&quot;nofollow noreferrer&quot;&gt;&amp;gt;&amp;lt;&amp;gt;&lt;/a&gt; and &lt;a href=&quot;http://esolangs.org/wiki/Bitwise_Cyclic_Tag&quot; rel=&quot;nofollow noreferrer&quot;&gt;Bitwise Cyclic Tag&lt;/a&gt;.) Even though the only tools it has for computation are 0's, 1's, and some queues for storage, &lt;a href=&quot;http://esolangs.org/wiki/BitCycle#Computational_class&quot; rel=&quot;nofollow noreferrer&quot;&gt;it is Turing-complete&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This answer shows off nearly all of BitCycle's features and performs an integer-arithmetic task in a language that doesn't even have integers. It comes with a GIF showing the ungolfed version in action, plus a point-by-point explanation.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/139202/56656&quot;&gt;Klein Topololyglots&lt;/a&gt; in Klein by &lt;a href=&quot;https://codegolf.stackexchange.com/users/20059/0&quot;&gt;0                                                                                                              '&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;nominated by Heeby Jeeby Man&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Klein is a language about topology and no answer shows off the mind bending nature of Klein better than this answer.  In this answer 0                                                                                                              ' makes a polyglot that runs in all of the Kleins 12 topologies and prints a different result in each.  With its excellent explanation this answer provides a full showcase of what Klein does.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/122210/31957&quot;&gt;Generate ;# code&lt;/a&gt; in ;#+ by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31957/conor-obrien&quot;&gt;Conor O'Brien&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;;#+ is a language designed to redeem the relatively uninteresting language ;#. This specific answer highlights the unconventional nature of the language, showing that the shortest approach is not like a Brainf*** or similar esoteric answer, for it outgolfs the first ;#+ answer &lt;a href=&quot;https://codegolf.stackexchange.com/a/122167/31957&quot;&gt;here&lt;/a&gt;. The answer serves as a general guide as to how to write tersely in the language, showing off most of its programmatic features in a simple way. The answer explains itself well, and summarizes ;#+ pithily.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/131545/the-crow-vs-the-taxicab/131772#131772&quot;&gt;The Crow and The Taxicab&lt;/a&gt; in Add++ by &lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/caird-coinheringaahing&quot;&gt;caird coinheringaahing&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Add++ is a language that started as not very complex, using a single accumulator, and eventually evolving into a language with functions and complex structures. This answer is the first that demonstrates usage of all three memory systems Add++ has to offer and is a good example of how to switch between functions and accumulator coding in Add++.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/149457/8478&quot;&gt;Repeated Digit Primes&lt;/a&gt; in Alice by &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-ender&quot;&gt;Martin Ender&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Alice is a feature-rich 2D language (of the Fungeoid family), which has a ton of built-ins, and either uses string manipulation commands or arithmetic commands, depending on which direction the instruction pointer is moving in. This is one of the most complex programs that has been written and golfed in Alice at this point, and it shows off the benefit of mixing both Cardinal (integer) and Ordinal (string) mode in a single program to get things done. The answer also shows off the usefulness of Alice's somewhat seemingly random built-ins (e.g. &amp;quot;divide all factors less than k out of n&amp;quot;) and how to build interesting nested loops with Alice's control flow commands. I personally also really like the neatness of how the four short Ordinal sections interleave perfectly in the layout without wasting any bytes (which is a big part of golfing any Alice program that makes nontrivial use of both modes).&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/137645/32014&quot;&gt;DropSort it like it's hot&lt;/a&gt; in Husk by &lt;a href=&quot;https://codegolf.stackexchange.com/users/32014/zgarb&quot;&gt;Zgarb&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Husk is a pure functional golfing language created in 2017 by PPCG users Zgarb and Leo.&#xA;This answer highlights two of the distinctive features of Husk golfing: casual handling of infinite lists (as produced by &lt;code&gt;¡&lt;/code&gt; and then chopped by &lt;code&gt;U&lt;/code&gt;) and abuse of higher-order functions by giving them arguments that defy the &amp;quot;intended&amp;quot; semantics (like &lt;code&gt;ü&amp;lt;&lt;/code&gt;, where &lt;code&gt;ü&lt;/code&gt; is supposed to remove duplicates based on a binary equality predicate).&#xA;Even with the intended semantics, &lt;code&gt;ü&lt;/code&gt; is arguably a weird built-in; Husk has lots of similar higher-order functions.&lt;/p&gt;&#xA;" OwnerUserId="60042" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-25T09:29:16.143" CommentCount="6" CommunityOwnedDate="2018-01-18T16:11:27.627" ContentLicense="CC BY-SA 3.0" />
  <row Id="14616" PostTypeId="2" ParentId="14614" CreationDate="2018-01-18T16:12:42.623" Score="10" Body="&lt;h1&gt;Novel scoring mechanism&lt;/h1&gt;&#xA;&lt;p&gt;A challenge posted in 2017 that used a new approach to scoring that made for interesting competition.&lt;/p&gt;&#xA;&lt;p&gt;This could be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; with a defined score calculation, or a modification of an existing challenge type like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/111758/disconnect-4-bits&quot;&gt;Disconnect 4 bits&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/60042/pavel&quot;&gt;Pavel&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Poke&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this challenge the scoring was not solely based on shortest number of bytes but also the shortest number of sets of 4 bits in the binary representation of the source code. This meant that sometimes it was worth it to make the code a little longer in order to avoid characters or character sequences which negatively affected your score.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/127261/52210&quot;&gt;Unique is Cheap&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56433/laikoni&quot;&gt;Laikoni&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Kevin Cruijssen&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this challenge the scoring was the same as the challenge itself: the cost of each character is equal to how many times this character has occurred in the string thus far. I.e. &lt;code&gt;abaacab&lt;/code&gt; has a score of &lt;code&gt;1+1+2+3+1+4+2 = 14&lt;/code&gt;. In some programming languages this actually meant increasing the byte-count could benefit a lower score. An interesting concept which was fun to do.&lt;br /&gt;&#xA;I wouldn't mind seeing more challenges where the score is based on the challenge itself.&lt;/p&gt;&#xA;" OwnerUserId="60042" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-23T14:07:01.450" CommentCount="2" CommunityOwnedDate="2018-01-18T16:12:42.623" ContentLicense="CC BY-SA 3.0" />
  <row Id="14617" PostTypeId="2" ParentId="14614" CreationDate="2018-01-18T16:13:42.820" Score="6" Body="&lt;h1&gt;Kansas City Shuffle&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Too often, once someone devises a generic golfy method of solving a challenge, most people will use that method for their answers. This award goes to those answers that utilize an alternative method as a better solution than the method that the majority of other answers use (prior to the posting of the rewarded answer).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/120635/59487&quot;&gt;Golf a transcendental number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/20260/xnor&quot;&gt;xnor&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Mr. Xcoder&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This answer provides a whole new approach to the challenge, alongside a strong proof of validity and a good explanation. It also shows a lot of research effort from its poster, xnor, with multiple references to Math.SE questions and answers and OEIS. In my opinion, the way the OP tackled the problem is just amazing and therefore worthy of an additional bounty.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/141693/6741&quot;&gt;When do I get my sandwich?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/73111/jonathan-frech&quot;&gt;Jonathan Frech&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Riker&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This answer takes an alternative approach just to eke out a one-byte advantage over the next largest answer.  And neither answer is even that long!  And the use of a generator to choose the numbers is just as impressive.&lt;/p&gt;&#xA;" OwnerUserId="60042" LastEditorUserId="46271" LastEditDate="2018-02-01T22:12:23.840" LastActivityDate="2018-02-01T22:12:23.840" CommentCount="2" CommunityOwnedDate="2018-01-18T16:13:42.820" ContentLicense="CC BY-SA 3.0" />
  <row Id="14618" PostTypeId="2" ParentId="14614" CreationDate="2018-01-18T16:13:46.700" Score="4" Body="&lt;h2&gt;Pro tip&lt;/h2&gt;&#xA;&lt;p&gt;Best answer to any &lt;em&gt;general&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question. That is, candidates should be drawn from &amp;quot;Tips for golfing in X&amp;quot; questions (as opposed to specific &amp;quot;how do I shorten this piece of code&amp;quot; questions).&lt;/p&gt;&#xA;&lt;p&gt;Some of the most useful content that we generate for other golfers is in our tips questions, so it would be nice to reward an exceptional golfing trick this way.&lt;/p&gt;&#xA;&lt;p&gt;Candidates should be tips which show deep insight into the language, yet are applicable in wide range of situations. The exact amounts of bytes saved by the tip is not relevant.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/109859/51785&quot;&gt;Tips for Golfing in Brain-Flak&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/heeby-jeeby-man&quot;&gt;Heeby Jeeby Man&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Poke&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Brain-Flak only has two stacks on which to perform operations. The third stack is always present but not always made use of. The concept and application of the third stack is widely used when golfing brain-flak code as it allows for implicit re-use of certain values so they do not need to be computed again later. This can easily be seen in the &lt;a href=&quot;https://codegolf.stackexchange.com/a/92975/51785&quot;&gt;Hello World answer written in brain-flak&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/150895/45941&quot;&gt;Shorter Header&lt;/a&gt; in &lt;a href=&quot;https://codegolf.stackexchange.com/q/132/45941&quot;&gt;Tips for golfing in C++&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/69850/user202729&quot;&gt;user202729&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Mego&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;C++ has a lot of headers, and unlike C, you have to actually include them if you want to use library functions. This answer tells of a GCC precompiled header file that includes every standard library header, and whose name is fairly short. So, if you need to include multiple headers (like &lt;code&gt;string&lt;/code&gt; and &lt;code&gt;iostream&lt;/code&gt;), &lt;code&gt;#include&amp;lt;bits/stdc++.h&amp;gt;&lt;/code&gt; will almost certainly be shorter. This header file isn't documented very well, so the tips answer is a huge help.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/142629/58974&quot;&gt;Compressing String Arrays&lt;/a&gt; in &lt;a href=&quot;https://codegolf.stackexchange.com/a/142629/58974&quot;&gt;Tips for Golfing in Japt&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58974/shaggy&quot;&gt;Shaggy&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I'm not great at these types of self-promotional blurbs but I put a good bit of work into researching and writing this tip as well as writing tools to help people make use of it. Includes a bonus tip for compressing integer arrays!&lt;/p&gt;&#xA;" OwnerUserId="68615" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-01T15:01:46.847" CommentCount="3" CommunityOwnedDate="2018-01-18T16:13:46.700" ContentLicense="CC BY-SA 3.0" />
  <row Id="14619" PostTypeId="2" ParentId="14614" CreationDate="2018-01-18T16:14:30.897" Score="5" Body="&lt;h1&gt;Best Explanation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This category is for the answer with the best explanation accompanying it. Ideally, the winner will be an answer with a very detailed explanation that is accessible to anyone, regardless of the amount of relevant knowledge already possessed.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/144323/42963&quot;&gt;How on earth did llhuii output the Evil Numbers in 42 bytes of Python?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/20260/xnor&quot;&gt;xnor&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by AdmBorkBork&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even though xnor was the original poster of the question, the explanation provided on this answer is well written and very thorough -- to the point that even I, as a non-Python programmer, could follow along and understand the steps taken to get to the new 39-byte record. xnor takes the reader along exactly through the thought process to get to the next byte savings, and the result is something truly extraordinary.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/151501/how-lit-is-this-mountain/151519#151519&quot;&gt;How lit is this mountain? &lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/59487/mr-xcoder&quot;&gt;Mr. Xcoder&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Ian Gödel&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although it has later been outgolfed by xnor, this answer includes a detailed explanation to a geometry problem, including drawings and references to multiple theorems, while still being accessible to anyone with basic geometry knowledge. It shows the viewers what the program does step-by-step, explaining both the mathematics behind it and the functionality of the code. Therefore, I think this answer perfectly fits this category.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/147868/194&quot;&gt;One OEIS after another&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56725/&quot;&gt;Christian Sievers&lt;/a&gt;.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Peter Taylor&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Christian has three answers in this chain which use not-Burnside's lemma to tackle some non-trivial sequences. This is perhaps the most detailed, and certainly the most interesting as it explains how the standard approach can be golfed.&lt;/p&gt;&#xA;" OwnerUserId="32686" LastEditorUserId="194" LastEditDate="2018-01-29T21:00:45.637" LastActivityDate="2018-01-29T21:00:45.637" CommentCount="3" CommunityOwnedDate="2018-01-18T16:14:30.897" ContentLicense="CC BY-SA 3.0" />
  <row Id="14620" PostTypeId="2" ParentId="14614" CreationDate="2018-01-18T16:14:52.257" Score="8" Body="&lt;h2&gt;SGITW (Slowest Gun in the West)&lt;/h2&gt;&#xA;&lt;p&gt;For the best 2017 answer in a challenge which received no answers within 48 hours of posting. The challenge itself does not need to be from 2017 and the nominated answer doesn't need to be the first answer to the challenge, but the first answer to the challenge does need to be from 2017. Tips questions are not counted for this category.&lt;/p&gt;&#xA;&lt;p&gt;It's very easy to get drawn to the fast-rising HNQ-hitting questions with a plethora of answers, so I thought this would be a good way to bring attention to answers that really needed to earn their love.&lt;/p&gt;&#xA;&lt;p&gt;SEDE query: &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/776856/48-hour-gap&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://data.stackexchange.com/codegolf/query/776856/48-hour-gap&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/43150/build-a-fewest-moves-freecell-solver/139783#139783&quot;&gt;Build a fewest-moves freecell solver&lt;/a&gt; By &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/63187/christopher-2ez-4rtz&quot;&gt;Christopher 2EZ 4RTZ&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I spent a while trying to make the code work, it took me WEEKS to calculate my score and a week or so to get a bash script to auto-test score my answer. I spent a long time getting this to work and really like how it turned out.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/111932/51785&quot;&gt;Build a digital clock in Conway's Game of Life&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/64412/dim&quot;&gt;dim&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nomintated by Poke&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This answer was posted 7 months after the challenge was posted. It seemingly came out of nowhere and the result is beautiful.&lt;/p&gt;&#xA;" OwnerUserId="68615" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-02T17:17:49.110" CommentCount="2" CommunityOwnedDate="2018-01-18T16:14:52.257" ContentLicense="CC BY-SA 3.0" />
  <row Id="14621" PostTypeId="2" ParentId="14614" CreationDate="2018-01-18T16:15:06.360" Score="5" Body="&lt;h1&gt;The student becomes the master&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This category aims to reward an answer that fulfils the following conditions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It is an answer to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The poster is &lt;em&gt;not&lt;/em&gt; the creator of the language, and the code has byte count &lt;em&gt;N&lt;/em&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The creator of the language already submitted an answer, with byte count &lt;em&gt;M&lt;/em&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;And finally &lt;em&gt;N &amp;lt; M&lt;/em&gt;, but the restriction is that no language features used  have been added in the meantime.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/113301/42963&quot;&gt;Is it true? Ask Jelly!&lt;/a&gt; in Jelly by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16385/hvd&quot;&gt;hvd&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by AdmBorkBork&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Dennis' &lt;a href=&quot;https://codegolf.stackexchange.com/questions/113238/is-it-true-ask-jelly#comment276312_113301&quot;&gt;comment&lt;/a&gt; on this submission really sums up the reason why I nominated the answer here -- &lt;em&gt;&quot;Outgolfed in my own challenge and my own language... Well done!&quot;&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/142224/31716&quot;&gt;Are the brackets fully matched?&lt;/a&gt; in Brain-Flak by &lt;a href=&quot;https://codegolf.stackexchange.com/users/69059/nitrodon&quot;&gt;Nitrodon&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by DJMcMayhem&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Are the brackets fully matched is one of my favorite challenges I have ever posted. Mostly because it's the challenge that inspired me to write brain-flak, which is a minimalist stack based esolang where the only valid programs are balanced strings of brackets. I had always wanted to answer it in brain-flak, but this is a very difficult task because of brain-flak's bad support for string processing. When I finally got around to answering it in brain-flak, it took me about 2 hours of work to get it working at all. I had given up on golfing it because it was a monumental task to get it working in the first place. Nitrodon came along 9 months later, and outgolfed me by 800 bytes.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/147629&quot;&gt;Is this number a prime?&lt;/a&gt; in Hexagony by &lt;a href=&quot;https://codegolf.stackexchange.com/users/71256/h-pwiz&quot;&gt;H.PWiz&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Steadybox&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-ender&quot;&gt;Martin Ender&lt;/a&gt; wrote &lt;a href=&quot;https://codegolf.stackexchange.com/a/57706&quot;&gt;an answer&lt;/a&gt; to the challenge in &lt;a href=&quot;https://github.com/m-ender/hexagony&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hexagony&lt;/a&gt; shortly after creating the language in 2015. A week or so later, &lt;a href=&quot;https://codegolf.stackexchange.com/users/45161/etoplay&quot;&gt;Etoplay&lt;/a&gt; posted &lt;a href=&quot;https://codegolf.stackexchange.com/a/58347&quot;&gt;another Hexagony answer&lt;/a&gt;, which was only half as long as the previous answer and had a smaller &lt;a href=&quot;http://esolangs.org/wiki/Hexagony#Overview&quot; rel=&quot;nofollow noreferrer&quot;&gt;side-length&lt;/a&gt;. Etoplay's answer (their first answer on the site) remained the shortest Hexagony answer for two years, until, in November 2017, H.PWiz, having been outgolfed by Etoplay in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/143822/a-%c3%97-a-a-%c3%97-a&quot;&gt;another challenge&lt;/a&gt;, managed to write a Hexagony answer one byte shorter than that of Etoplay's. So, not only did H.PWiz outgolf the language creator, they also outgolfed the previous outgolfer.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/110429/8478&quot;&gt;Multiply two numbers&lt;/a&gt; in Retina by &lt;a href=&quot;https://codegolf.stackexchange.com/users/62393/leo&quot;&gt;Leo&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Martin Ender&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Leo outgolfed me by coming up with better solutions for both parts of the challenge: a) figuring out the result's sign and b) multiplying the absolute values, by avoiding the conversion of one of the two values to unary. Since multiplying numbers is a fairly common operation, especially the second half of the answer was a pretty big deal for Retina at the time.&lt;/p&gt;&#xA;" OwnerUserId="60042" LastEditorUserId="36398" LastEditDate="2018-02-07T23:20:24.353" LastActivityDate="2018-02-07T23:20:24.353" CommentCount="4" CommunityOwnedDate="2018-01-18T16:15:06.360" ContentLicense="CC BY-SA 3.0" />
  <row Id="14622" PostTypeId="2" ParentId="14614" CreationDate="2018-01-18T16:16:00.597" Score="13" Body="&lt;h1&gt;Overall best challenge&lt;/h1&gt;&#xA;&lt;p&gt;This category is for a challenge that is exceptionally well written, is properly specified, and most of all, an interesting challenge.&lt;/p&gt;&#xA;&lt;p&gt;Due to the &amp;quot;HNQ effect&amp;quot;, easy, simple challenges often get more attention than more interesting, harder puzzles, and this award is intended to recognize effort in writing complex challenges.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/135102/formic-functions-ant-queen-of-the-hill-contest/&quot;&gt;Formic Functions: Queen of the Hill&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/20283/trichoplax&quot;&gt;trichoplax&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Draco18s&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Incredible dedication to maintaining the KOTH challenge and running tournaments as new answers were added and old ones updated (even now, over a month after the chatroom was automatically suspended, a new edit was made and trichoplax will still run another tournament). The challenge was one that looked like it wouldn't have much diversity in the answers at first, but as people tried things and got to know the playing field, approaches to the problem got very complex, varied, and beautiful.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/151341/lets-play-mafia&quot;&gt;Let&amp;#39;s Play Mafia!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/14509/undergroundmonorail&quot;&gt;undergroundmonorail&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/users/63187/christopher-2ez-4rtz&quot;&gt;Christopher 2EZ 4RTZ&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination (kinda)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a really cool KoTH but as I didn't write it the potential winnings will go to the actual author :).&lt;/p&gt;&#xA;&lt;p&gt;It is a really cool and hard challenge that was sandboxed forever! It was well written and is very cool.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/110648/fewest-distinct-characters-for-turing-completeness&quot;&gt;Fewest (distinct) characters for Turing Completeness&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/62384/julian-lachniet&quot;&gt;Julian Lachniet&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Laikoni&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;An unusual challenge in the sense that instead of code size the &amp;quot;size&amp;quot; of the language itself should be reduced as much as possible while maintaining Turing Completeness. The challenge produced a lot of interesting answers with methods as diverse as the used languages, e.g. the &lt;a href=&quot;https://codegolf.stackexchange.com/a/111002/56433&quot;&gt;5 characters for JavaScript&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="68615" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-25T14:58:40.997" CommentCount="3" CommunityOwnedDate="2018-01-18T16:16:00.597" ContentLicense="CC BY-SA 3.0" />
  <row Id="14623" PostTypeId="2" ParentId="14614" CreationDate="2018-01-18T16:16:08.353" Score="10" Body="&lt;h1&gt;Rookie of the Year - Challenges&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For the best challenge written by someone who has not written a challenge prior to 2017 (i.e., not necessarily a new user, just a new challenge writer).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/117329/garbled-phone-numbers&quot;&gt;Garbled Phone Numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/47990/draco18s&quot;&gt;Draco18s&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It was my first ever challenge in any tag that got several answers, including one of the longest Jelly answers ever written (its like 3rd or 4th). Writing good challenges is hard and I want to do more.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/149344/cool-untitled-sequence&quot;&gt;cool untitled sequence thingy&lt;/a&gt; by &lt;a href=&quot;/u/68615&quot;&gt;totallyhuman&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Typical sequence challenge with barely any appreciation but I like this challenge (not only because it's mine). The nth element of a simple sequence and it led to a diversity of approaches where each of them had a mathematical backing, with none being &lt;em&gt;obviously&lt;/em&gt; the golfiest, something that I want to see in more challenges. Also, it totally has the best title.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/148206/the-quantum-drunkards-walk&quot;&gt;The Quantum Drunkard&amp;#39;s Walk&lt;/a&gt; by &lt;a href=&quot;/u/72401&quot;&gt;stellatedHexahedron&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by DLosc&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A fun ASCII-art challenge about outputting the pattern of a cellular automaton after a given number of steps. It's well-specified but allows appropriate flexibility in output format. The automaton's symmetry and some other properties led to interesting ways of golfing the generation algorithm. As LuisMendo commented, &quot;Great first challenge!&quot;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/132558/i-double-the-source-you-double-the-output&quot;&gt;I double the source, you double the output!&lt;/a&gt; by &lt;a href=&quot;/u/59487&quot;&gt;Mr. Xcoder&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although I've had a couple of well-received challenges before this one was posted, I feel like this was my best challenge overall. The thing I enjoyed most about this post is the fact that the solutions were incredibly diverse, ranging from sheerly ridiculous esolang answers (ab)using language features to clever solutions in more practical languages. I haven't posted any challenges (nor answers) prior to 2017.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/133754/one-oeis-after-another&quot;&gt;One OEIS after another&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/caird-coinheringaahing&quot;&gt;caird coinheringaahing&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I joined this site in May 2017, and since posting, this has become the &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=answers%3A300...&quot;&gt;third most answered challenge ever&lt;/a&gt;, the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot;&gt;fifth highest voted answer chaining challenge&lt;/a&gt; and my highest voted challenge, with contributions from 60 users for over 6 months. It has lead to some &lt;a href=&quot;https://codegolf.stackexchange.com/a/137800/66833&quot;&gt;very impressive&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/a/133933/66833&quot;&gt;amusing answers&lt;/a&gt;, even extending to &lt;a href=&quot;https://math.stackexchange.com/q/2379460/427632&quot;&gt;other SE sites&lt;/a&gt;. It even has a &lt;a href=&quot;https://chat.stackexchange.com/rooms/69745/one-oeis-after-another&quot;&gt;chat room&lt;/a&gt; dedicated to it.&lt;/p&gt;&#xA;" OwnerUserId="60042" LastEditorUserId="16766" LastEditDate="2018-01-28T22:42:37.870" LastActivityDate="2018-01-28T22:42:37.870" CommentCount="5" CommunityOwnedDate="2018-01-18T16:16:08.353" ContentLicense="CC BY-SA 3.0" />
  <row Id="14624" PostTypeId="2" ParentId="14614" CreationDate="2018-01-18T16:16:52.713" Score="10" Body="&lt;h1&gt;Best use of the wrong language for the job&lt;/h1&gt;&#xA;&lt;p&gt;This category is for an exemplary answer written in a language that was not adequately equipped to solve the challenge.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/144386/16766&quot;&gt;Write a brain-flak classic interpreter&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/69059/nitrodon&quot;&gt;Nitrodon&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by DLosc&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Most interpreter challenges attract answers in high-level languages like Python and Java. And then Nitrodon goes and writes a Brain-Flak Classic interpreter... &lt;em&gt;in Brain-Flak Classic&lt;/em&gt;. In case you weren't aware, &lt;a href=&quot;http://esolangs.org/wiki/Brain-Flak&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brain-Flak&lt;/a&gt; is an extremely simple esolang, with only two stacks for storage and eight commands. Using this language to interpret itself is completely crazy--in the best possible way. Nitrodon's post also contains a thorough explanation.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/111806/51785&quot;&gt;Disconnect 4 bits&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/51785/poke&quot;&gt;Poke&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I originally wrote this in what I thought was a golfy manner with a couple tricks to avoid known characters that would cause demerits. After tweaking my method and variables I managed to golf almost 50% off of my score by &lt;em&gt;increasing&lt;/em&gt; my bytecount. I feel like this was possibly more of a challenge for Java than other languages since Java is naturally more verbose causing there to be more cases where you're forced to take demerits. There's also a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/111758/disconnect-4-bits/111806#comment272286_111806&quot;&gt;comment&lt;/a&gt; arguing my case.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/108174/194&quot;&gt;Find the shortest Golomb rulers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/194&quot;&gt;Peter Taylor&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The Mathematica answer is really 7 lines. This C# answer is over 300 lines, not counting argument validation, comments, and blanks; doesn't have entirely satisfactory types; and only does about twice as much from an abstract mathematical point of view. It is a classic example of pretending that the problem is a nail because I only have a hammer.&lt;/p&gt;&#xA;" OwnerUserId="32686" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-29T21:02:12.827" CommentCount="3" CommunityOwnedDate="2018-01-18T16:16:52.713" ContentLicense="CC BY-SA 3.0" />
  <row Id="14625" PostTypeId="2" ParentId="14614" CreationDate="2018-01-18T16:17:20.040" Score="6" Body="&lt;h1&gt;Best mathematical insight&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;On this site we often see answers in languages specifically designed for short code, or designed to be fast. Sometimes, a nice golfing trick or speed-up technique surprises us with its ingenuity, beyond the standard use of that language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And occasionally an answer shows up that uses an unexpected approach to greatly simplify the problem, and makes us wonder how the author could ever think of that. This usually involves some far-from-obvious mathematical equivalence, or a particularly simple approach to the problem that was not evident at all (once revealed, other answers often follow the same approach).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This category is for the answer with the best &lt;strong&gt;mathematical&lt;/strong&gt; insight or unexpected approach that led to greatly simplifying the problem, in &lt;strong&gt;any challenge type&lt;/strong&gt; (code golf, fastest code, or others). The insight should have led to a significant improvement according to the challenge's metric (code length, run time, or whatever applicable).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/107634/approximate-bruns-constant/107648#107648&quot;&gt;Approximate Brun's Constant&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Mr. Xcoder&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't have much to say about this answer. The mathematics behind it is amazing, and so is its explanation and its implementation. The author, Dennis, has put some incredible effort into creating and explaining it (and this is one of the posts that would benefit from having MathJax :P).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/148601/61384&quot;&gt;Quadrants passed through by a line&lt;/a&gt; by Leaky Nun&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Esolanging Fruit&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I posed what I thought would be an interesting challenge, but Leaky revealed it was dependent simply on the number of zeroes in the input. Leaky originally used an array lookup to switch on the number of zeroes, but this was later changed to bit manipulation.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/141387/194&quot;&gt;What an Odd Function&lt;/a&gt; by &lt;a href=&quot;/users/12012&quot;&gt;Dennis&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Peter Taylor&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Most of the answers to this question case-split in some way or do fiddly things with lists of even and odd numbers. After thinking about it for a while (note the time lag between his first answer and this one), Dennis spotted an elegant approach based on prime factorisation which is the clear winner as things stand.&lt;/p&gt;&#xA;" OwnerUserId="60042" LastEditorUserId="47990" LastEditDate="2018-01-29T20:53:43.120" LastActivityDate="2018-01-29T20:53:43.120" CommentCount="3" CommunityOwnedDate="2018-01-18T16:17:20.040" ContentLicense="CC BY-SA 3.0" />
  <row Id="14626" PostTypeId="2" ParentId="14614" CreationDate="2018-01-18T16:17:43.640" Score="10" Body="&lt;h1&gt;Rookie of the Year - Answers&lt;/h1&gt;&#xA;&lt;p&gt;For the best answer by someone who hasn't submitted an answer prior to 2017 (i.e., not necessarily a new user, but just someone who's a new answer writer).&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/43150/build-a-fewest-moves-freecell-solver/139783#139783&quot;&gt;Build a fewest-moves freecell solver&lt;/a&gt; By &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/63187/christopher-2ez-4rtz&quot;&gt;Christopher 2EZ 4RTZ&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I know this was also nominated by me but it fits in both categories. My first answer was back on January 24th and I really fell in love with this site. I bet other people will have better choices but what is the fun without a little chance!&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/121264/61563&quot;&gt;Output with the same length of the code&lt;/a&gt; aka Segmentation Fault, &lt;a href=&quot;https://codegolf.stackexchange.com/users/61563/md-xf&quot;&gt;MD XF&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Well, it was my 14th answer on this site (all in 2017) and the first to get more than two votes. I repcapped about 3 times from this answer and it became a PPCG meme, which was fueled when I got &lt;a href=&quot;https://codegolf.stackexchange.com/a/133896/61563&quot;&gt;another 56 upvotes&lt;/a&gt; for a seg-fault.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/141693/6741&quot;&gt;When do I get my sandwich?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/73111/jonathan-frech&quot;&gt;Jonathan Frech&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by plannapus&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Could be a good candidate for Kansas City Shuffle as well. Original, unexpected way to solve the challenge, great explanation and alternative solutions make for a great answer.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/111600/71256&quot;&gt;Letter, Number, Symbol, Space, Repeat&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/66041/%c3%98rjan-johansen&quot;&gt;Ørjan Johansen&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by H.PWiz&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is the user's first submission to the site. It answers a restricted source challenge that was previously thought to be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/111351/letter-number-symbol-space-repeat/111600#comment271206_111351&quot;&gt;unsolvable in a conventional language&lt;/a&gt;. Ørjan, however was able to answer in Haskell. Overall, it is a fantastic answer and exhibits some truly obfuscated Haskell.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/151245/christmas-theme-disclaimer-here/151394#151394&quot;&gt;[CHRISTMAS THEME DISCLAIMER HERE]&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/69912/tfbninja&quot;&gt;tfbninja&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This was my first in-depth answer to a non-trivial challenge. I spent a lot of time on it and felt pretty good about it. It was later golfed on, but it was still quite difficult and took a lot of effort.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/124049/display-random-colored-pixels/124610#124610&quot;&gt;Display random colored pixels&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/70172/bradc&quot;&gt;BradC&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;My first posted answer, solved using Minecraft redstone/command blocks. High bit count, but complete with detailed pictures and descriptions, and even an accompanying YouTube video and downloadable NBT file if you want to reproduce. I haven't attempted another Minecraft answer since.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/126235/65326&quot;&gt;In Honor of Adam West&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/65326/uriel&quot;&gt;Uriel&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;One of my earlier answers, that caught &lt;em&gt;&lt;strong&gt;way&lt;/strong&gt;&lt;/em&gt; much attention than expected. Getting to the challenge after most answers were already quite short, and having &lt;a href=&quot;https://codegolf.stackexchange.com/questions/113276/code-johnny-code-code/113315#113315&quot;&gt;my history&lt;/a&gt; with memorial challenges, I figured one made out of the memorated's name could cause no harm. The &lt;strong&gt;w&lt;/strong&gt;est is history.&lt;/p&gt;&#xA;" OwnerUserId="68615" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-31T23:33:18.583" CommentCount="7" CommunityOwnedDate="2018-01-18T16:17:43.640" ContentLicense="CC BY-SA 3.0" />
  <row Id="14627" PostTypeId="2" ParentId="14614" CreationDate="2018-01-18T16:18:43.203" Score="14" Body="&lt;h1&gt;Best Above-and-Beyond Answer&lt;/h1&gt;&#xA;&lt;p&gt;Every once in a while, an answer takes the challenge to the extreme. This prize will be awarded to an answer which went far beyond the expectations of the challenge. This could include&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a code golf answer that brute-forced/proved the shortest program in some language&lt;/li&gt;&#xA;&lt;li&gt;a graphical-output popcon answer of extreme size and quality&lt;/li&gt;&#xA;&lt;li&gt;a KOTH answer of high complexity which absolutely dominated the competition&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This category was featured in both Best of 2015 and Best of 2016.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/111932/51785&quot;&gt;Build a digital clock in Conway's Game of Life&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/64412/dim&quot;&gt;dim&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nomintated by Draco18s&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This answer was posted 7 months after the challenge was posed. It seemingly came out of nowhere and the result is beautiful. No other answers have ever been posted, due to the sheer complexity of the challenge.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/126326/print-a-variables-name/126532#126532&quot;&gt;Print a Variable's Name&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/51785/poke&quot;&gt;Poke&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Caleb Kleveter&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A rather brilliant solution to a challenge I proposed, using a stack trace to get the name of a variable. There is a very good explanation that goes with the solution. This answer was also the most popular.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/69930/paint-starry-night-objectively-in-1kb-of-code/149835#149835&quot;&gt;Paint Starry Night, objectively, in 1kB of code&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/39242/anders-kaseorg&quot;&gt;Anders Kaseorg&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Ian Gödel&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This answer deeply impressed me, because it doesn't use built-in compression (and it is also in Pyth!), and the amount of effort the poster has made is just amazing. There is a detailed explanation, and the graphical output is of extreme quality. These things make it worthy of a some of our rep points.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/124497/31716&quot;&gt;How high can you count?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by DJMcMayhem&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A very impressive answer, with a very impressive score. I think Dennis went above and beyond in 1) Continually coming back and improving the score (36 revisions), and 2) Posting a very extensive test-suite.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/124049/display-random-colored-pixels/124610#124610&quot;&gt;Display random colored pixels&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/70172/bradc&quot;&gt;BradC&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&amp;quot;Simple&amp;quot; graphical challenge solved by placement of colored wool blocks using Minecraft redstone/command blocks. Complete with detailed pictures and descriptions, an update that chopped 1,483 bytes off the score, and even an accompanying YouTube video and downloadable NBT file if you want to reproduce it yourself.&lt;/p&gt;&#xA;" OwnerUserId="68615" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-02T06:41:51.697" CommentCount="5" CommunityOwnedDate="2018-01-18T16:18:43.203" ContentLicense="CC BY-SA 3.0" />
  <row Id="14631" PostTypeId="2" ParentId="8471" CreationDate="2018-01-19T09:09:25.927" Score="0" Body="&lt;h1&gt;The range for the arg of function return right result &lt;em&gt;must&lt;/em&gt; be in the answers code&lt;/h1&gt;&#xA;&lt;p&gt;The note negative for the 99% answers, that down quality of them: The absence of a range in the code for a valid argument for function that return a right result.&lt;/p&gt;&#xA;&lt;p&gt;There would be a range limit for the arg of the function; something as 1..20000 and each answer would indicate its kind of range the argument has to be for to be safe to pass to the function (without one seg fault in the code, without one memory insufficient for the program, without one incorrect value return as result ).&lt;/p&gt;&#xA;&lt;p&gt;So it is not the question that specify the general range of validity for the answers (perhaps a minimum range) but it is the answer specific it, based of restrictions: language, mean PC power computation, algorithm etc.&lt;/p&gt;&#xA;" OwnerDisplayName="user58988" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-19T09:18:03.903" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14636" PostTypeId="1" AcceptedAnswerId="22396" CreationDate="2018-01-21T15:30:17.753" Score="14" ViewCount="570" Body="&lt;p&gt;Recently &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/42392601#42392601&quot;&gt;I suggested&lt;/a&gt; having a feed in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240&quot;&gt;The Nineteenth Byte&lt;/a&gt; for new answers to the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world&quot;&gt;Hello, World!&lt;/a&gt; challenge. It received some support (as you can tell from the stars), but it was suggested that it be discussed on Meta first.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I see advantages and disadvantages to having this feed, but I'll just state the biggest (in my eyes) of each here:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Advantage&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;People tend to post an answer to the Hello, World! challenge when revealing a new language. Having a feed would allow the more active members of the community who frequent chat to see these new languages quickly.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Disadvantage&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It was &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/42392620#42392620&quot;&gt;pointed out&lt;/a&gt; that it could get annoying if too many answers were posted at once or in quick succession to the challenge as a large number of oneboxes would be posted into The Nineteenth Byte very quickly, possibly disrupting conversation.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There are definitely more pros and cons to this decision, but there's no need to put them all in this post. What does the community think of this?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="68942" LastEditDate="2021-06-08T03:48:49.467" LastActivityDate="2021-06-08T03:48:49.467" Title="Can we have a Hello, World! feed?" Tags="|discussion|feature-request|status-completed|chat|rss|" AnswerCount="3" CommentCount="5" ClosedDate="2021-06-06T18:19:42.003" ContentLicense="CC BY-SA 3.0" />
  <row Id="14638" PostTypeId="2" ParentId="14636" CreationDate="2018-01-21T20:18:33.373" Score="12" Body="&lt;h1&gt;Maybe in Another Chatroom?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We should put the feed in either &lt;a href=&quot;https://chat.stackexchange.com/rooms/27364/esoteric-programming-languages&quot;&gt;Esoteric Programming Languages&lt;/a&gt;, &lt;a href=&quot;https://chat.stackexchange.com/rooms/60252/language-development&quot;&gt;Language Development&lt;/a&gt;, or in an entirely new chatroom.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Pros for Esoteric Programming Languages:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Most new PPCG languages are esolangs, so the feed would be mostly relevant there.&lt;/li&gt;&#xA;&lt;li&gt;This room is more active than the Language Development one.&lt;/li&gt;&#xA;&lt;li&gt;Language Development seems to focus more on the actual design process, rather than showing off new, finished languages.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Pros for Language Development&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Not all new PPCG languages are esolangs, and Language Development accepts discussion about esoteric and practical languages.&lt;/li&gt;&#xA;&lt;li&gt;It would stop the chatroom from getting frozen, and promote useful discussions.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Pros for putting the feed in a new chatroom&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The feed (and the discussion around it like golfing, tips, etc.) might be too much to put in one of the other chatrooms.&lt;/li&gt;&#xA;&lt;li&gt;The discussion involved doesn't &lt;em&gt;quite&lt;/em&gt; fit either of the other chatrooms: it's not about developing languages, it's not necessarily general talk about languages, and it's not for esolangs only.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="61384" LastActivityDate="2018-01-21T20:18:33.373" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14641" PostTypeId="2" ParentId="2140" CreationDate="2018-01-21T23:50:18.810" Score="3" Body="&lt;h1&gt;Voronoi Iteration&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a finite set of points in the plane, output the set vertices of the corresponding Voronoi diagram.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;p&gt;A vertex of the voronoi diagram is a point of the plane that has the same distance to the three or more closest input points.&#xA;As usual, you don't have to worry about the rounding issues of limited precision floating point numbers.&lt;/p&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;[(0,0),(2,0),(0,2),(2,2)] -&amp;gt; [(1,1)]&#xA;[(0,0),(1,0)] -&amp;gt; []&#xA;[(0,0),(2,0),(0,2)] -&amp;gt; [(1,1)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://mathoverflow.net/questions/291208/a-voronoi-iteration-game&quot;&gt;this question on MO&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-21T23:50:18.810" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14645" PostTypeId="1" AcceptedAnswerId="14671" CreationDate="2018-01-22T06:45:43.917" Score="41" ViewCount="703" Body="&lt;p&gt;&lt;strong&gt;&lt;em&gt;Whereas,&lt;/em&gt;&lt;/strong&gt; there are lots of interesting languages out there that might be fun to golf in, and&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Whereas,&lt;/em&gt;&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/6918/16766&quot;&gt;many of us are the inventors of said interesting languages&lt;/a&gt;, and would like to teach them to others, and&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Whereas,&lt;/em&gt;&lt;/strong&gt; learning and golfing in a language is more fun if other people are doing it with you:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I propose that we start a &lt;strong&gt;&lt;em&gt;language of the month&lt;/em&gt;&lt;/strong&gt;&lt;sup&gt;1&lt;/sup&gt; event.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This idea is inspired by some of the recurring events on other StackExhange sites, particularly the &lt;a href=&quot;https://writers.meta.stackexchange.com/q/1374/23938&quot;&gt;writing challenges&lt;/a&gt; on Writers.SE or the &lt;a href=&quot;https://literature.meta.stackexchange.com/q/596/1091&quot;&gt;reading challenges&lt;/a&gt; on Literature.SE. The main idea is to get more exposure for less-frequently used languages, and to have fun learning and golfing them together.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's how I envision this working. We start a nominations thread on Meta. To nominate a language, you post an answer to that thread, stating the language you're nominating, why you think it's a good language to feature, and details like where to find an implementation. At the beginning of each month, the nomination with the highest net vote total is chosen as the language of the month. (This nomination process is modeled after &lt;a href=&quot;https://literature.meta.stackexchange.com/q/596/1091&quot;&gt;Lit.SE's reading challenges&lt;/a&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe there is some way to set up an &quot;event&quot; that shows up in the sidebar but isn't mutually exclusive with the normally displayed meta posts. Maybe somebody who knows the StackExchange system better than I do can confirm that?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;During the month, everyone who wants to participate would:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Learn the basics of the language (if they don't know it already)&lt;/li&gt;&#xA;&lt;li&gt;Answer challenges in it (new ones or old ones, doesn't matter)&lt;/li&gt;&#xA;&lt;li&gt;Try to outgolf each other's answers&lt;/li&gt;&#xA;&lt;li&gt;Discuss all of the above in chat&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I particularly envision chat being useful for experienced users of the language to give pointers and learning exercises to newbies. Something like this &lt;a href=&quot;https://chat.stackexchange.com/rooms/41599/conversation/brain-flak-training-with-cmcs&quot;&gt;has recently been happening&lt;/a&gt; in the Brain-Flak room. We could start a single new chatroom for all language-of-the-month chatting, or we could use the existing chatroom for each featured language (creating a chatroom for languages that didn't previously have one).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My suggested criteria for a good language of the month:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It should be somewhat &lt;em&gt;general-purpose&lt;/em&gt; and &lt;em&gt;possible to program in&lt;/em&gt;. Bubblegum isn't a good choice, because it's only capable of solving a small subset of challenges. Malbolge isn't a good choice, because it's prohibitively hard to create a working program in it at all.&lt;/li&gt;&#xA;&lt;li&gt;It should &lt;em&gt;not be one of our most commonly used languages&lt;/em&gt; on PPCG. That's a subjective criterion, and I don't mean to exclude a lot of languages by it--but still, the point of this event is to bring attention to lesser-known languages. We don't really need to bring more attention to Python or JavaScript.&lt;/li&gt;&#xA;&lt;li&gt;It should have a &lt;em&gt;freely available implementation&lt;/em&gt;. This can be TIO, some other online source, or a downloadable interpreter/compiler.&lt;/li&gt;&#xA;&lt;li&gt;It can be either esoteric or practical. Of course we like our esolangs around here, but I also think it would be cool to study some lesser-known &quot;real&quot; languages.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;What say ye?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;sup&gt;1&lt;/sup&gt; Or other time period--please make suggestions. If we end up with a duration such as &quot;three weeks,&quot; the name of the event could be changed to &quot;featured language&quot; or somesuch.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="31716" LastEditDate="2018-02-06T18:45:12.143" LastActivityDate="2018-02-06T18:45:12.143" Title="Let's start a &quot;language-of-the-month&quot; event" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="14646" PostTypeId="2" ParentId="2140" CreationDate="2018-01-22T07:16:15.763" Score="1" Body="&lt;h3&gt;Objective&lt;/h3&gt;&#xA;&lt;p&gt;Given a 2D array (of x by x size), write a program or function to alternatively shift elements of the array along the anti-diagonals. (anti-diagonals are right to left, top to bottom). (first anti-diagonal moves down second anti-diagonal moves up with elements wrapping when they reach the end of the anti-diagonal)&lt;/p&gt;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;a b c d&#xA;e f g h&#xA;i j k l&#xA;m n o p&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Will become:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a e i g&#xA;b c j n&#xA;f m h o&#xA;d k l p&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;I will follow the tradition of selecting the shortest working code as the best answer&lt;/p&gt;&#xA;&lt;p&gt;**edited for user202729 suggestion&lt;/p&gt;&#xA;" OwnerUserId="77666" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-23T08:55:46.997" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="14647" PostTypeId="1" CreationDate="2018-01-22T13:09:13.427" Score="3" ViewCount="90" Body="&lt;p&gt;I suggest that we should have a list of scoring functions.&#xA;When there is only one variable in the score for example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Length of submission  (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Portion of test cases passed (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Number of languages (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/rosetta-stone&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;rosetta-stone&amp;#39;&quot; rel=&quot;tag&quot;&gt;rosetta-stone&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is easy.  &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;When there is multiple such as any two of the above it becomes hard.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Some time the challenge wants to use two but restricts it to one; as the common &lt;em&gt;&quot;Number of correct test cases, in less than 128 bytes&quot;&lt;/em&gt; &#xA;This is less fun since it outright knocks out languages that need a lot of boilerplate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Other challenges use bonuses in a similar way. It seems meta isn't keen on bonuses, see reasons: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8106/4397&quot;&gt;1&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges/8102#8102&quot;&gt;2&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The main way (and what this question is about) is scoring systems that combine multiple scores into one.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;There are better and worse ways to deal with this. It is a heuristic, and there is a whole field of study relating to multi-objective optimization heuristics.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The best scoring function depends on the challenge, but for similar challenges it should be similar.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider, as pointed out by user202729 and Mego,&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/139243/4397&quot;&gt;Determine your language&amp;#39;s version&lt;/a&gt;&#xA;which uses &lt;code&gt;code length / number of languages&lt;/code&gt; vs&lt;br&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/65641/4397&quot;&gt;The versatile integer printer&lt;/a&gt; which uses &lt;code&gt;code length / (number of languages ^ 3)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would argue that the later scoring function is better than the former,&#xA;because you can see in the former that the best scoring function is for solutions that only use 2 languages, where as to me the more interesting answers and the ones that are more challenging to write are the ones that do many languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now even looking at just this problem there is no obvious objectively correct answer. So I suggest in this post posting one scoring function per answer, with reference to what it is good for, and links to questions that use it, and/or questions that could use it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bonus points for showing plots.&lt;/p&gt;&#xA;" OwnerUserId="4397" LastEditorUserId="61405" LastEditDate="2018-01-22T17:52:52.610" LastActivityDate="2018-01-22T17:52:52.610" Title="List of Good Numeric Scoring Systems" Tags="|discussion|scoring|challenge-quality|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14648" PostTypeId="2" ParentId="2140" CreationDate="2018-01-22T17:18:21.253" Score="1" Body="&lt;h1&gt;What's in an ISBN?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an ISBN-10 code starting with &lt;code&gt;0&lt;/code&gt; or &lt;code&gt;1&lt;/code&gt;, extract the registration group, registrant, publication, and checksum numbers.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We've talked about &lt;a href=&quot;https://en.wikipedia.org/wiki/International_Standard_Book_Number&quot; rel=&quot;nofollow noreferrer&quot;&gt;International Standard Book Numbers&lt;/a&gt; before, including &lt;a href=&quot;https://codegolf.stackexchange.com/questions/153624/converting-isbn-13-to-isbn-10#153624&quot;&gt;converting them&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/342/calculate-isbn-13-check-digit&quot;&gt;calculating their checksums&lt;/a&gt;. Now let's talk about parsing their data.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An ISBN-10 code has four parts; in order from left to right: registration&#xA;group, registrant, publication, and checksum. We're only going to consider registration group numbers &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt;, which represent English-speaking areas. Take a look at these two ISBN-10 codes, shown with their parts separated:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;0-307-45547-5&lt;/code&gt; – This book, from registration group &lt;code&gt;0&lt;/code&gt;, is printed by publishing giant Penguin Random House. Penguin prints thousands of books, so it's assigned ISBN blocks with few digits for registrar (&lt;code&gt;307&lt;/code&gt; here), leaving many digits for publication (&lt;code&gt;45547&lt;/code&gt;). The checksum is &lt;code&gt;5&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;1-940696-27-5&lt;/code&gt; – This book, from registration group &lt;code&gt;1&lt;/code&gt;, is printed by indie poetry press Wave Books, which prints just a few books each year, so its ISBN blocks have many digits for registrant (&lt;code&gt;940696&lt;/code&gt; here) and just a few for publication number (&lt;code&gt;27&lt;/code&gt;). The checksum is also &lt;code&gt;5&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that takes a non-separated ISBN-10 code and return its four parts as distinct values.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;ISBN-10 codes in registration groups &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt; are separated according to the following scheme, where &lt;code&gt;xx…&lt;/code&gt; is registrant number and &lt;code&gt;y&lt;/code&gt; is checksum.&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;From            to                 From            to&#xA;-------------   -------------      -------------   -------------&#xA;0-00-xxxxxx-y … 0-19-xxxxxx-y      1-00-xxxxxx-y … 1-09-xxxxxx-y&#xA;0-200-xxxxx-y … 0-699-xxxxx-y      1-100-xxxxx-y … 1-399-xxxxx-y&#xA;0-7000-xxxx-y … 0-8499-xxxx-y      1-4000-xxxx-y … 1-5499-xxxx-y&#xA;0-85000-xxx-y … 0-89999-xxx-y      1-55000-xxx-y … 1-86979-xxx-y&#xA;0-900000-xx-y … 0-949999-xx-y      1-869800-xx-y … 1-998999-xx-y&#xA;0-9500000-x-y … 0-9999999-x-y      1-9990000-x-y … 1-9999999-x-y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For example, &lt;code&gt;0307455475&lt;/code&gt; lies in the range &lt;code&gt;0-200-xxxxx-y … 0-699-xxxxx-y&lt;/code&gt;, so we know it has three digits for registrant and five for publication and the program, given this input, should return &lt;code&gt;0&lt;/code&gt;, &lt;code&gt;307&lt;/code&gt;, &lt;code&gt;45547&lt;/code&gt;, and &lt;code&gt;5&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Likewise, &lt;code&gt;1940696275&lt;/code&gt; is in the range &lt;code&gt;1-869800-xx-y … 1-998999-xx-y&lt;/code&gt;, so the program should return &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;940696&lt;/code&gt;, &lt;code&gt;27&lt;/code&gt;, and &lt;code&gt;5&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input may be in any convenient format, e.g. a string, list of characters, or list of numbers.&lt;/li&gt;&#xA;&lt;li&gt;The input must be 10 or fewer characters or numbers, plus an optional trailing newline. Leading zeroes are optional.&lt;/li&gt;&#xA;&lt;li&gt;In ISBN-10 codes the checksum 10 is represented with an &lt;code&gt;X&lt;/code&gt;. If your&#xA;program takes input as a list of numbers, the number &lt;code&gt;10&lt;/code&gt; may be used. If it takes input as a string or list of characters, a &lt;em&gt;single&lt;/em&gt; non-digit character of your choosing (e.g. &lt;code&gt;X&lt;/code&gt; or &lt;code&gt;x&lt;/code&gt;) must be used.&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, standard input rules apply.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output may be in any convenient format, as long as each part is easily distinguishable from the next, e.g. a delimited string, a list of four numbers, or a list of four lists of numbers.&lt;/li&gt;&#xA;&lt;li&gt;Leading zeroes are optional.&lt;/li&gt;&#xA;&lt;li&gt;If the checksum is 10, it may be &lt;code&gt;10&lt;/code&gt; (as a number or string) or a single non-digit character of your choosing. For example, both &lt;code&gt;0 8044 2957 X&lt;/code&gt; and &lt;code&gt;0 8044 2957 10&lt;/code&gt; are valid.&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, standard output rules apply.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Winning&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;; the solution with the fewest bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard loopholes are forbidden.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;Input       Output&#xA;0000000000  0-00-000000-0&#xA;0144751605  0-14-475160-5&#xA;0393765621  0-393-76562-1&#xA;0763320041  0-7633-2004-1&#xA;0859056018  0-85905-601-8&#xA;0906789222  0-906789-22-2&#xA;0958171947  0-9581719-4-7&#xA;0999999999  0-9999999-9-9&#xA;099999999X  0-9999999-9-X&#xA;1000000000  1-00-000000-0&#xA;1080925818  1-08-092581-8&#xA;1149092167  1-149-09216-7&#xA;1457721261  1-4577-2126-1&#xA;1578424693  1-57842-469-3&#xA;1973088617  1-973088-61-7&#xA;1999973361  1-9999733-6-1&#xA;1999999999  1-9999999-9-9&#xA;199999999X  1-9999999-9-X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h2&gt;Sandbox questions&lt;/h2&gt;&#xA;  &#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;&lt;p&gt;What are good tags for this?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;Is the description of the separation scheme clear?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;Any test cases missing (or wrong)?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="11261" LastEditorUserId="11261" LastEditDate="2018-01-25T15:16:00.850" LastActivityDate="2018-01-25T15:16:00.850" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14651" PostTypeId="2" ParentId="6918" CreationDate="2018-01-22T21:47:40.383" Score="1" Body="&lt;h1&gt;Triangularity&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Triangularity was created on January 5th, 2018 by me, &lt;a href=&quot;https://codegolf.stackexchange.com/users/59487/mr-xcoder&quot;&gt;Mr. Xcoder&lt;/a&gt;. It is a new esolang, which only has a few commands. Loops are not implemented yet (but that is, hopefully, about to change), so &lt;s&gt;it’s definitely not Turing-Complete&lt;/s&gt; (it can evaluate Python :|). In fact, it can only participate in very simple challenges. It’s stack based. Some helpful resources:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://github.com/Mr-Xcoder/Triangularity&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github repository&lt;/a&gt;&lt;/strong&gt; and &lt;strong&gt;&lt;a href=&quot;https://github.com/Mr-Xcoder/Triangularity/wiki&quot; rel=&quot;nofollow noreferrer&quot;&gt;Documentation&lt;/a&gt;&lt;/strong&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you want help learning it, want to request features, spot bugs or anything else, feel free to ping me (&lt;code&gt;@Mr.Xcoder&lt;/code&gt;) in its &lt;strong&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/71290/a-triangular-strange-esolang&quot;&gt;dedicated chat room&lt;/a&gt;&lt;/strong&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Thanks to our moderator, Dennis, you can &lt;strong&gt;&lt;a href=&quot;https://tio.run/#triangularity&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Fun facts&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A valid Triangularity program must have the character count listed in &lt;a href=&quot;https://oeis.org/A056220&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS A056220&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each Triangularity program must be padded with dots such that the overall shape of the program is rectangular, but the dots themselves must be laid out in nice, right-angled and isosceles triangles. Basic rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If you have &lt;strong&gt;N&lt;/strong&gt; lines of code, each line must consist of &lt;strong&gt;2N - 1&lt;/strong&gt; characters.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;strong&gt;K&lt;/strong&gt;th line, counting from the bottom, must be padded with &lt;strong&gt;K - 1&lt;/strong&gt; dots on each side.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Any character that is not a command is ignored (unless we’re talking about the newlines and the dots that make up for the padding).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="59487" LastEditDate="2018-01-24T18:26:51.190" LastActivityDate="2018-01-24T18:26:51.190" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14652" PostTypeId="1" CreationDate="2018-01-23T00:15:19.777" Score="4" ViewCount="81" Body="&lt;p&gt;Currently our &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt; description reads:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;for challenges involving optimizing something. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Which is not very specific.  Due to our rules on objective winning criteria every question (except maybe pop-cons) is about optimizing &lt;em&gt;something&lt;/em&gt;.  The tag wiki:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This indicates that the challenge involves optimization, which could be maximization, minimization, or something else. It might be performing some sequence of events in the most effective way, or it could be improving efficiency of retrieval or processing of input in a certain way.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;is no more specific about what the tag should be used for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The tag might be about optimizing the output in which case it would be a synonym of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimized-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimized-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimized-output&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The questions with these tags don't seem to have a common thread to me, which seems to be an indicator that this tag is not very useful.  But perhaps with a more descriptive description questions that fit the tag would end up being tagged properly more frequently and questions that don't less so.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So what should the tag be used for? What should its description be?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorDisplayName="user45941" LastEditDate="2018-01-23T06:16:22.997" LastActivityDate="2018-01-23T06:16:22.997" Title="What is the optimization tag for? What should its description be?" Tags="|discussion|tags|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14653" PostTypeId="2" ParentId="14652" CreationDate="2018-01-23T01:36:33.100" Score="1" Body="&lt;p&gt;Note: This is my best understanding of what an optimization puzzle is. It reflects my opinions that were formed based on my limited perspective.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think optimization puzzles tend to focus on three areas:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;There is exactly one observable parameter (&quot;score&quot;) which measures the performance of attempting a puzzle in a particular approach. As examples, this could be a mixed function between code size, objectives reached (e.g. count from 1 to N where score depends on increasing N), constraints met (e.g. penalty on repeating characters), or any arbitrary but well defined set such as playing a game and measuring your score, etc.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The performance (measured score) involves the loosely computer sciencey definition of &quot;optimization&quot;, that is a &quot;better&quot; approach works more efficiently or use fewer resources. (Resources is generally interpreted as code size on this site, but there may be alternatives.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The problem does not have an obvious solution, i.e. solutions may compete on out-performing each other rather than solving the problem with the optimal methods. More specifically, in most optimization problems there exists a playing field that arises from having the output be a continuous function (i.e. for two similar approaches, they may be measured to be distinct from each other based on details) or the optimal algorithm is very hard to find / compute. (e.g. unit allocation)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Because optimizing code size already has its own field (code golf), and optimizing output size is generally considered golf over a puzzle (e.g. proof golf), optimization puzzles tend to target a different field, such as exploring a problem as deep / consistently as possible, or using less fuel to move a robot to a destination, sorting new structures which is graded by efficiency, or devising an algorithm to play a game and have your code try to reach as high of a score as possible.&lt;/p&gt;&#xA;" OwnerUserId="21830" LastEditorUserId="21830" LastEditDate="2018-01-23T01:42:30.587" LastActivityDate="2018-01-23T01:42:30.587" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14655" PostTypeId="2" ParentId="2140" CreationDate="2018-01-23T07:37:52.687" Score="-2" Body="&lt;h2&gt;Brainf*** Polygot&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polygot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polygot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polygot&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brainfuck&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brainfuck&amp;#39;&quot; rel=&quot;tag&quot;&gt;brainfuck&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a brainf*** interpreter in as many languages as possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will take the brainf*** code on standard input, and then execute it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your score is &lt;code&gt;bytes / (n * sqrt n)&lt;/code&gt; (where n is the number of languages in which your program works), which you will seek to minimize.&lt;/p&gt;&#xA;" OwnerUserId="16842" LastActivityDate="2018-01-23T07:37:52.687" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="14657" PostTypeId="2" ParentId="2140" CreationDate="2018-01-23T13:59:30.867" Score="0" Body="&lt;h1&gt;Stem and Leaf&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A stem-and-leaf plot is a way to represent data and visualizing distribution. Usually the data is grouped in step of 10, with the last digit as &quot;leafs&quot; in ascending order, and the remaining digits as &quot;stem&quot;. The steam and leafs are separated with a vertical line, with stem on the left and leafs on the right. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Make a program or function which takes a list of non-negative integers as input, and outputs the corresponding stem-and-leaf plot. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example Input and Outputs&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Example 1:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input: &#xA;&lt;code&gt;10 2 15 4 2 24 18 17 24 24 25 15 18 22 17 23 24 33 19 28 28 28 26 32 25 27 37 28 41 38 38 30 35 30 41 45 40 40 37 33&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0|224           &#xA;1|05577889      &#xA;2|23444455678888&#xA;3|0023357788    &#xA;4|00115&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Example 2:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input:&#xA;&lt;code&gt;112 101 116 99 99 107 101 99 115 112 114 128 115 119 125 160 148 147 159 147 169 160 163 160 160 163 162 164 160 173 84 92&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 8|4&#xA; 9|2999       &#xA;10|117       &#xA;11|2245569   &#xA;12|58        &#xA;13|&#xA;14|778       &#xA;15|9         &#xA;16|0000023349&#xA;17|3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input may be a list, an array, a space or comma delimited string or other appropriate representation containing raw data values. &lt;/li&gt;&#xA;&lt;li&gt;The vertical line of the output must be aligned. &lt;/li&gt;&#xA;&lt;li&gt;A leading or trailing newline, or trailing spaces for each line are accepted. &lt;/li&gt;&#xA;&lt;li&gt;Common loopholes applied. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, so the lowest-byte solution for each language wins! &lt;/p&gt;&#xA;" OwnerUserId="76277" LastActivityDate="2018-01-23T13:59:30.867" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14660" PostTypeId="2" ParentId="2140" CreationDate="2018-01-23T20:40:00.957" Score="1" Body="&lt;h1&gt;Shape sequence sums&lt;/h1&gt;&#xA;&lt;h3&gt;0. DEFINITIONS&lt;/h3&gt;&#xA;&lt;p&gt;For the purposes of this challenge, a &lt;em&gt;sequence&lt;/em&gt; refers to a list of numbers whose absolute values increment in steps of 1. A sequence begins with a value of 1, 0, or -1.&lt;br&gt;&#xA;A &lt;em&gt;positive sequence&lt;/em&gt; refers to the natural numbers: 1, 2, 3, 4, and so on.&lt;br&gt;&#xA;A &lt;em&gt;negative sequence&lt;/em&gt; refers to the additive inverses of the natural numbers: -1, -2, -3, -4, and so on.&lt;/p&gt;&#xA;&lt;h3&gt;1. CHALLENGE&lt;/h3&gt;&#xA;&lt;p&gt;Given an integer &lt;code&gt;n&lt;/code&gt;, return a list of sequences such that the sum of all the numbers in the list is equal to &lt;code&gt;n&lt;/code&gt;. Sequences must alternate in sign (see test cases). Solutions must produce the list with the fewest sequences; that is, the sign should change a minimal number of times. (Read: Don't do 1, 2, -1 over and over again.) The resulting list must be flat, not nested. The shortest working solution wins.&lt;/p&gt;&#xA;&lt;h3&gt;2. TEST CASES&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt; 17: 1, 2, 3, 4, 5, 6, -1, -2, -3, 1, 2, -1&#xA; 18: 1, 2, 3, 4, 5, 6, -1, -2&#xA; 19: 1, 2, 3, 4, 5, 6, -1, -2, 1&#xA; 21: 1, 2, 3, 4, 5, 6&#xA;-21: -1, -2, -3, -4, -5, -6&#xA; -5: -1, -2, -3, 1&#xA;  0: 0 or [] (null set)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You may choose to begin each sequence with 0 instead of 1 or -1. However, if you do this, &lt;em&gt;every&lt;/em&gt; sequence must begin with a zero, not just the positives, the negatives, the first sequence, or any other strict subset. This also means that input 0 requires a list containing a single 0.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 17: 0, 1, 2, 3, 4, 5, 6, 0, -1, -2, -3, 0, 1, 2, 0, -1&#xA;  0: 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="54071" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-24T05:32:41.780" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="14664" PostTypeId="2" ParentId="2140" CreationDate="2018-01-24T21:22:39.057" Score="2" Body="&lt;h1&gt;Number of Adjacently Divisible Partitions of n&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Output the following sequence (&lt;a href=&quot;https://oeis.org/A167865&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS A167865&lt;/a&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1, 0, 1, 1, 1, 1, 2, 1, 2, 2, 2, 1, 4, 1, 3, 3, 3, 1, 5, 1, 5, 4, 3, 1, 6, 2, 5, 4, 5, 1, 9, 1, 6, 4, 4, 4, 8, 1, 6, 6, 7, 1, 11, 1, 8, 8, 4, 1, 10, 3, 10, 5, 8, 1, 11, 4, 10, 7, 6, 1, 13, 1, 10, 11, 7, 6, 15, 1, 9, 5, 11, 1, 14, 1, 9, 12, 8, 5, 15, 1, 16, 9, 8, 1, 18, 5, 12, 7, 10, 1, 21, 7, 13, 11, 5, 7, 12, 1, 14, 12, 15, 1, 20, 1, 14, 17, 9, 1, 18, 1, 21, 10, 17, 1, 19, 5, 14, 14, 7, 6, 22, 3, 14, 9, 12, 8, 25, 1, 18, 13, 17, 1, 24, 8, 16, 21, 11, 1, 23, 1, 22, 6, 12, 7, 19, 7, 15, 19, 11, 1, 28, 1, 21, 17, 18, 11, 27, 1, 16, 10, 18, 6, 28, 1, 18, 25, 9, 1, 25, 5, 29, 19, 18, 1, 27, 14, 20, 8, 11, 1, 30, 1, 31, 15, 21...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Number of partitions of n into distinct parts greater than 1, with each part divisible by the next.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h3&gt;Definition:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/2CWlK.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/2CWlK.png&quot; alt=&quot;a(0) = 1&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/QvbeJ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/QvbeJ.png&quot; alt=&quot;\forall n&amp;gt;0: a(n) = \sum {a(\frac{n-k}{k}) : k&amp;gt;1 \land k \mid n}&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Task:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Choose one of the three options:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Output the sequence indefinitely.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Take &lt;strong&gt;n&lt;/strong&gt; as input and output the &lt;strong&gt;n&lt;/strong&gt; first elements of the sequence.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Take &lt;strong&gt;n&lt;/strong&gt; as input and output the &lt;strong&gt;n&lt;/strong&gt;th element of the sequence. Both 0- and 1-based indices are allowed, but please specify which one your answer uses.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Hint:&lt;/strong&gt; There is a simpler formula than the one used on OEIS and in this post. It may save you some bytes (it saved six bytes on a simple reference implementation I made in Python). I'll add it here later.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="61405" LastEditorUserId="61405" LastEditDate="2018-03-01T00:05:29.400" LastActivityDate="2018-03-01T00:05:29.400" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14665" PostTypeId="2" ParentId="6918" CreationDate="2018-01-25T04:21:16.483" Score="0" Body="&lt;h1&gt;MashedPotatoes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;MashedPotatoes is a register-based esoteric programming language designed by yours truly that &quot;mashes&quot; together several syntactic constructs from other languages and alters their meaning significantly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The central theme of MashedPotatoes is to confuse color-coding parsers while making code difficult to read and frustrating to write. Almost every construct in the language is borrowed syntactically from another language but does not serve its original purpose. Examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The text &lt;code&gt;--help&lt;/code&gt; is the numerical literal representing zero. This is the only numerical literal whose value does not change.&lt;/li&gt;&#xA;&lt;li&gt;The Perl &quot;baby carriage&quot; operator &lt;code&gt;@{[ ... ]}&lt;/code&gt; returns the negative of the argument&lt;/li&gt;&#xA;&lt;li&gt;The Common Lisp style print statement &lt;code&gt;(format t &quot; ... &quot;)&lt;/code&gt; is the basic looping construct in MashedPotatoes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Additionally, to make sure programmers don't become complacent, many syntactic constructs change meaning each time you use them. There are three registers: the accumulator, the counter, and the evaluator. However, none of these registers can be accessed directly. They are accessed by the following expressions.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;STDERR&lt;/code&gt;, which returns the accumulator the first time it is used in a program, the counter the second, and the evaluator the third.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;$[&lt;/code&gt;, which returns the counter, then the evaluator and then the accumulator.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;`uniq -c`&lt;/code&gt; (the backticks are significant) refers to the evaluator, then the accumulator, and then the counter.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So to refer to a register, you have to find an identifier that is currently pointing to that register. This design decision ensures that programmers who are refactoring code still have a sufficiently challenging task. Likewise, labels are used to activate several commands. There are three labels (plus a fourth &quot;nullary&quot; label), and each label has four names. Referring to a label by the wrong name is a syntax error, and the name changes every time you use it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Resources:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/Mercerenies/mashed-potatoes&quot; rel=&quot;nofollow noreferrer&quot;&gt;Official interpreter&lt;/a&gt; (written in Python)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://esolangs.org/wiki/MashedPotatoes&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolangs page&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;FAQs:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Why?&lt;/strong&gt; I got bored at work one day and this was the result.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Are there any example programs?&lt;/strong&gt; Yes, the Esolang page has a well-documented &lt;a href=&quot;https://esolangs.org/wiki/MashedPotatoes#Factorial&quot; rel=&quot;nofollow noreferrer&quot;&gt;factorial program&lt;/a&gt; and a (less well-documented) &lt;a href=&quot;https://esolangs.org/wiki/MashedPotatoes#Fibonacci_Sequence&quot; rel=&quot;nofollow noreferrer&quot;&gt;Fibonacci program&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;What does &quot;Hello World&quot; look like in MashedPotatoes?&lt;/strong&gt; No idea. I tried once to write it and eventually gave up. If you can write &quot;Hello World&quot; in MashedPotatoes, please let me know.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="9486" LastActivityDate="2018-01-25T04:21:16.483" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14671" PostTypeId="2" ParentId="14645" CreationDate="2018-01-25T22:42:13.253" Score="21" Body="&lt;h2&gt;Let's do this!&lt;/h2&gt;&#xA;&lt;p&gt;This is a nice idea; there is nothing to lose but the potential to gain a lot.&lt;/p&gt;&#xA;&lt;p&gt;My only concern with DLosc's proposal was that one month might be a bit long for some languages and community involvement might die down after the first two weeks. However, trichoplax pointed out that a resting period between events would likely have a positive effect on the sustainability of the event in the long run.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, I now also think that featuring a language for a month is the better idea. The current language of the month could be promoted by an community ad and potentially some challenges related to the language, as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14645/lets-start-a-language-of-the-month-event#comment53313_14645&quot;&gt;Sanchises has suggested&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="56433" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-30T04:13:26.473" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14672" PostTypeId="2" ParentId="2140" CreationDate="2018-01-25T23:25:37.987" Score="0" Body="&lt;p&gt;Imagine you're a dishonorable scientist trying to prove that getting heads on a coin flip actually has about 70% probability when flipped 100 times.  The trick is, you're going to flip the coin an arbitrarily large number of times (say, a million) and select the slice of 100 flips that contains the most number of heads.  As input, take the number of total trials to do, and as output, return the number of heads contained within the most favorable contiguous slice of 100.&lt;/p&gt;&#xA;" OwnerUserId="20296" LastActivityDate="2018-01-25T23:25:37.987" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14675" PostTypeId="2" ParentId="2140" CreationDate="2018-01-26T16:48:05.157" Score="1" Body="&lt;h1&gt;Implement RaGOL &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cellular-automata&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cellular-automata&amp;#39;&quot; rel=&quot;tag&quot;&gt;cellular-automata&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;RaGOL (&lt;strong&gt;Ra&lt;/strong&gt;ndom &lt;strong&gt;G&lt;/strong&gt;ame &lt;strong&gt;o&lt;/strong&gt;f &lt;strong&gt;L&lt;/strong&gt;ife) is a randomized cellular automaton based on GOL (&lt;strong&gt;G&lt;/strong&gt;ame &lt;strong&gt;o&lt;/strong&gt;f &lt;strong&gt;L&lt;/strong&gt;ife). For reference, here are the rules of GOL (B3/S23):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Moore neighborhoods are used, that is, a cell &lt;code&gt;#&lt;/code&gt; looks at its neighbors &lt;code&gt;*&lt;/code&gt; as in here:&lt;pre&gt;.......&#xA;.......&#xA;..***..&#xA;..*#*..&#xA;..***..&#xA;.......&#xA;.......&lt;/pre&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A cell can have 2 states: &lt;strong&gt;dead&lt;/strong&gt; or &lt;strong&gt;alive&lt;/strong&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;If a &lt;strong&gt;dead&lt;/strong&gt; cell has 3 &lt;strong&gt;alive&lt;/strong&gt; neighbors, it becomes &lt;strong&gt;alive&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If an &lt;strong&gt;alive&lt;/strong&gt; cell does not have exactly 2 or 3 &lt;strong&gt;alive&lt;/strong&gt; neighbors, it becomes &lt;strong&gt;dead&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In this challenge, we will assume the board is unbounded, and the default state of a cell is &lt;strong&gt;dead&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, since &lt;a href=&quot;https://codegolf.stackexchange.com/q/3434/41024&quot;&gt;we have already implemented GOL&lt;/a&gt;, it's time to change the rules a bit. Here are the differences between GOL and RaGOL:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a &lt;strong&gt;dead&lt;/strong&gt; cell has 3 &lt;strong&gt;alive&lt;/strong&gt; neighbors, there is 1/3 of a chance it becomes &lt;strong&gt;alive&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If an &lt;strong&gt;alive&lt;/strong&gt; cell has 2 &lt;strong&gt;alive&lt;/strong&gt; neighbors, there is 1/5 of a chance it becomes &lt;strong&gt;dead&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If an &lt;strong&gt;alive&lt;/strong&gt; cell has 3 &lt;strong&gt;alive&lt;/strong&gt; neighbors, there are 2/5 of a chance it becomes &lt;strong&gt;dead&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Note that if an &lt;strong&gt;alive&lt;/strong&gt; cell doesn't have exactly 2 or 3 &lt;strong&gt;alive&lt;/strong&gt; neighbors, it still becomes &lt;strong&gt;dead&lt;/strong&gt; just like in GOL.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to get an &lt;strong&gt;&lt;em&gt;x&lt;/em&gt;×&lt;em&gt;y&lt;/em&gt;&lt;/strong&gt; RaGOL board &lt;strong&gt;&lt;em&gt;B&lt;/em&gt;&lt;/strong&gt; where &lt;strong&gt;&lt;em&gt;x&lt;/em&gt; &gt; 0&lt;/strong&gt; and &lt;strong&gt;&lt;em&gt;y&lt;/em&gt; &gt; 0&lt;/strong&gt; and a number &lt;strong&gt;&lt;em&gt;N&lt;/em&gt; &gt; 0&lt;/strong&gt; and return the board after &lt;strong&gt;&lt;em&gt;N&lt;/em&gt;&lt;/strong&gt; generations starting from &lt;strong&gt;&lt;em&gt;B&lt;/em&gt;&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please note that the result isn't deterministic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will also need to expand the board to simulate an unbounded-board automaton in some cases.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can get &lt;strong&gt;&lt;em&gt;B&lt;/em&gt;&lt;/strong&gt; and &lt;strong&gt;&lt;em&gt;N&lt;/em&gt;&lt;/strong&gt; in any reasonable way.&lt;/li&gt;&#xA;&lt;li&gt;Errors due to floating-point imprecision do not matter, be it a slight difference due to how floats work or a precision limit of the float datatype you use. Otherwise, you must adhere to the aforementioned probabilities.&lt;/li&gt;&#xA;&lt;li&gt;You may expand the board as much as you like, as long as 1) the result will be theoretically returned at some point in time and 2) the whole expected result is shown.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Note: If your language has a board datatype which natively supports unbounded boards, you can use that instead of manually expanding the resulting board, as long as the correct result is returned sometime. You may also use third-party modules which provide such a datatype, or even implement your own, just as long as there is an implementation available online!&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2018-03-19T19:47:52.857" LastActivityDate="2018-03-19T19:47:52.857" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="14676" PostTypeId="2" ParentId="2140" CreationDate="2018-01-26T20:47:35.873" Score="0" Body="&lt;h1&gt;Find a Path of Similar Proportions!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a point on a square lattice, find the shortest path (by jumps) from the origin to that point, following these rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You are allowed to make any number of jumps containing any number of steps along the grid lines to another lattice point. These jumps must be along the grid lines and have an integer length. &lt;/li&gt;&#xA;&lt;li&gt;Each jump &lt;strong&gt;must&lt;/strong&gt; contain one step more or be one step shorter than the step before it. (This is where the &quot;similar proportions&quot; comes into play. Name change pending?)&lt;/li&gt;&#xA;&lt;li&gt;The first step can have any length.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;As an example, here is how one possible way one might travel from A(0,0) to B(5,5) under these rules:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A&#xA;|&#xA;|&#xA;|&#xA;1----2&#xA;     B&#xA;     |&#xA;     |&#xA;     3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The numbers indicate which steps are taken. Note that this solution backtracks, moving to (5,8) before partially retracing its path to get to its destination. This solution takes four jumps and is therefore optimal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is a diagram of the number of jumps required for the shortest (or is it?) path to any other point with both integer coordinates below or equal to 10. Note the symmetry around (x,x). I don't know if my solution for (7,10) is optimal.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  | 0  1  2  3  4  5  6  7  8  9  10&#xA;--------------------------------------&#xA;0 | 0  1  1  1  1  1  1  1  1  1  1&#xA;1 | 1  3  2  3  3  3  3  3  3  3  3&#xA;2 | 1  2  3  2  3  3  3  3  3  3  3&#xA;3 | 1  3  2  3  2  3  3  3  3  3  4&#xA;4 | 1  3  3  2  4  2  3  3  3  3  3&#xA;5 | 1  3  3  3  2  4  2  3  3  3  3&#xA;6 | 1  3  3  3  3  2  4  2  4  3  3&#xA;7 | 1  3  3  3  3  3  2  4  2  4  5?&#xA;8 | 1  3  3  3  3  3  4  2  4  2  4&#xA;9 | 1  3  3  3  3  3  3  4  2  4  2&#xA;10| 1  3  3  4  3  3  3  5? 4  2  4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;The actual actual task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to continue the table for points with coordinates as large as (127,127).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your submission should be a program which prints valid paths for all points whose two coordinates lie between 0 and an inputted positive integer inclusively, or a function, which, given any pair of positive integers, outputs a valid path to the point specified by these coordinates.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A valid output path is an array or list (or other comparable datatype) which uniquely represents a valid sequence of jumps that can be used to reach the specified point and which makes it as easy as possible to find the number of jumps required.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example possible ways for the example path given above:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[&quot;d&quot;, 4], [&quot;r&quot;, 5], [&quot;d&quot;, 4], [&quot;u&quot;, 3]] // using chars to represent direction&#xA;[[0, 4], [5, 0], [0, 4], [0, -3]] // direction vectors&#xA;[0, 4, 5, 0, 0, 4, 0, -3] // As above, in just one list. len()/2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your submission will be scored by the sum of your solution's bytecount and the sum of all jump counts for all paths it outputs for reaching any point between (0,0) and (127,127), inclusively. Smallest score wins, standard rules and loopholes apply, etc... &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example response (Python 3):&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def c(a,b):&#xA;    d,e,g=[[a,0]],a+1,0&#xA;    while not g==b:&#xA;        d.append([0,e])&#xA;        e,g=-e+1,g+e&#xA;    return d&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This extremely simple and naive piece of Python code achieves a score of 92 (program length) + 1406272 (for the path part) = 1406364, as verified here - &lt;a href=&quot;https://tio.run/##ZY1BDoMgEEXXcIpZQpw22G6aJpzEuEAZEWNGQjBNT0@1XXb7/nv56V3mje@1eppgVA4H/ZTCI2GwXefQ9D26pkUjxWuOKwFvBYK1w2EJf3UpEXvVGaReH@TMLnT4oSEpMpU9M/g6bjsXsGCknLYMESJDdhxItbfHeXjS5Y@KX9dYWInVqCIuWkuZcuSivpuuHw&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 3 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;More?&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;missing tags?&lt;/li&gt;&#xA;&lt;li&gt;clarifications?&lt;/li&gt;&#xA;&lt;li&gt;Table is incorrect?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Please respond.&lt;/p&gt;&#xA;" OwnerUserId="65965" LastEditorUserId="65965" LastEditDate="2018-01-26T21:52:17.483" LastActivityDate="2018-01-26T21:52:17.483" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14679" PostTypeId="1" CreationDate="2018-01-28T10:14:25.060" Score="0" ViewCount="138" Body="&lt;p&gt;In my dream world, I would rather have code challenges generate a code that's actually useful in the real world, a code that makes its way to be an idiom, to be used in real world projects, and put in a language's standard library.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The prime criterion for a piece of code to be re-used is its readability, then complexity. Additionally, it's important that the code makes sparing use of third party libraries, as library writers and commercial language users are usually reluctant to burden their code with dependencies.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For this end, I propose the following scoring system:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Every language has its winner, no competition between languages.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The score is counted against the code. That is, the less the score -- the better.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The scoring rewards terseness, but in a sense of lexemes rather than characters, so readable names and nice layout do not impair the code. I believe lexemes are a well defined concept for any language. For a high level language, it's any unit of syntax, an identifier, or a literal. For machine code, it's a machine instruction. Clearly higher level languages with less visual noise are at advantage here, but we shall not have direct competition between different languages.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;For every lexeme that's built in the language, add 1 point.&lt;/li&gt;&#xA;&lt;li&gt;For every lexeme found in standard libraries for the language, add 2 points. If a language doesn't have a prevalent standard library, no lexeme is considered as a part of standard library for that language.&lt;/li&gt;&#xA;&lt;li&gt;For every lexeme that's in some other published library, add 10 points.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;The statements that bring the necessary lexemes into scope are not counted.&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The scoring encourages efficient algorithms. For simplicity, the largest of time and space complexities is considered, so an algorithm that's balanced between time and space is scored more favorably than a specialized algorithm that wastes one for the sake of maximizing the other.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The author of the code must attribute complexity to the algorithms they have explicitly encoded, and justify their attribution. Anyone who believes the attribution of complexity to an algorithm is justified insufficiently or wrongly, is encouraged to speak up, and the issue clarified until there are no more objections outstanding.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this way, builtin or library procedures can be of any complexity (I assume the authors of the library are incentivized to choose the algorithms as best they can, and, in any case, providing better replacements for library functions is not the point of our exercise), but adding complexity on top of them is discouraged.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a library of a language is closed source, official documentation may serve as justified attribution of complexity. (Again, I presume the authors of the documentation are incentivized to be honest and state the correct complexity.) If the complexity is not documented, it is considered unknown and this is as bad for the score as it gets.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;For every explicitly encoded algorithm of logarithmic complexity, add the exponent over logarithm + 1. (That is, for O(log n) add 2 points, for O(log^2 n) add 3 points.&lt;/li&gt;&#xA;&lt;li&gt;For every explicitly encoded polynomial algorithm, add as many points as its exponent * 2 + 1. (That is, for O(n^2) add 5 points, for O(1), one point.)&lt;/li&gt;&#xA;&lt;li&gt;For every explicitly encoded sub-exponential algorithm, add 8 points.&lt;/li&gt;&#xA;&lt;li&gt;For every explicitly encoded exponential or factorial algorithm, add 10 points.&lt;/li&gt;&#xA;&lt;li&gt;For algorithms of compound complexity, add scores together. (For example, O(n log n) is 5 points.)&lt;/li&gt;&#xA;&lt;li&gt;For algorithms of unknown complexity, add 11 points. This is as bad as it gets, because one must know one's algorithms' complexity.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Can this work?&lt;/p&gt;&#xA;" OwnerUserId="77857" LastEditorUserId="77857" LastEditDate="2018-01-28T11:52:46.480" LastActivityDate="2018-01-31T23:15:25.447" Title="Scoring that rewards useability" Tags="|discussion|scoring|" AnswerCount="3" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="14680" PostTypeId="2" ParentId="14679" CreationDate="2018-01-28T10:55:28.540" Score="5" Body="&lt;h1&gt;It's complicated...&lt;/h1&gt;&#xA;&lt;p&gt;There are a couple of reasons why I would vote against this proposal (in ascending order of importance):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;This makes assumptions about language features, which &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8067/59487&quot;&gt;isn't desirable at all&lt;/a&gt;. Not all languages have the concept of &amp;quot;Standard Library&amp;quot; or &amp;quot;Library&amp;quot; in general, and it might be hard to draw the line in the sand as to whether a submission uses these features or not. This might disadvantage certain languages or classes thereof.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It's hard to score the program – You have to analyse each &amp;quot;lexeme&amp;quot; and determine its complexity, and there might appear some disagreements regarding that (e.g. when using built-ins in closed-source programming languages like Mathematica).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In my opinion, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt; are better alternatives for this, and if you really want to have things balanced, you could just write a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; with a special winning criterion that advantages implementations that are both time and memory efficient. This has the advantage of not having to write a fancy scoring algorithm and is also more objective (depending on how you'd write the challenge).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;How would you objectively define a &amp;quot;lexeme&amp;quot;? Because different languages have different paradigms and syntaxes, I find it hard to come up with an universally accepted definition.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;General programming questions might invade the site. Everyone seeking programming help could be able to post it under this tag to make it on-topic. And after all, this &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8350/were-not-a-qa-site-but-what-should-be-done-about-it&quot;&gt;is not a Q&amp;amp;A site&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-28T11:00:41.520" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14681" PostTypeId="2" ParentId="14679" CreationDate="2018-01-28T14:15:32.970" Score="11" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;In my dream world, I would rather have code challenges generate a code that's actually useful in the real world, a code that makes its way to be an idiom, to be used in real world projects, and put in a language's standard library.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The first and foremost problem with this is that real-world solutions require real-world problems, which usually aren't a good fit for our site.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8065/12012&quot;&gt;You shouldn't override the defaults&lt;/a&gt;, but they're made for competing, not real-world problems. In practice, you won't be able to use a function that reads from STDIN and prints to STDOUT; you need one that returns a value.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Portability costs, whether it's bytes or lexemes. As long as program length is part of the score, writing non-portable code will always be encouraged. This is especially true in C, where relying on undefined behavior is a common code golf practice. A challenge that enforces portability would have to specify exactly &lt;em&gt;how portable&lt;/em&gt; solutions must be.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;We don't like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8858/12012&quot;&gt;input validation&lt;/a&gt; or &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8437/12012&quot;&gt;complicated number types&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Many languages we like to use on PPCG aren't meant for real-world usage in the first place.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;That said, there are also numerous problems with your proposed scoring.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Simply counting lexemes is broken. Any languages in that &lt;code&gt;eval&lt;/code&gt; and strings count as 1 point each, &lt;code&gt;eval(&quot;&amp;lt;actual code here&amp;gt;&quot;)&lt;/code&gt; is a solution scoring 2 points.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Rewarding a lower complexity may make sense for some problems, but since the complexity is only an upper bound, &lt;strong&gt;O(n)&lt;/strong&gt; can very well be &lt;em&gt;slower&lt;/em&gt; that the higher-scoring alternatives.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Other approaches may not even fit into your scoring model. For example, there are sorting algorithms that depend both on the length of the list and the largest number in it, so if &lt;strong&gt;n&lt;/strong&gt; is the length of the input,  there's no &lt;strong&gt;f&lt;/strong&gt; that makes the complexity &lt;strong&gt;O(f(n))&lt;/strong&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your balance between length and complexity may work for &lt;em&gt;one&lt;/em&gt; problem, but certainly not all. A penalty of only 2 points for turning an &lt;strong&gt;O(n)&lt;/strong&gt; algorithm into an &lt;strong&gt;O(n²)&lt;/strong&gt; algorithm will prevent a clever golf or two, but it won't make me rethink my entire approach.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Complexity analysis works well for algorithms, not so much for implementation. A function that can take only 64-bit integers as input is &lt;em&gt;always&lt;/em&gt; &lt;strong&gt;O(1)&lt;/strong&gt;, no matter which algorithm it implements.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In general, any scoring mechanism that combines different aspects (e.g., length and speed) of the solutions needs to be tailored exclusively to &lt;em&gt;that&lt;/em&gt; challenge if you want it to work.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my opinion, good scoring mechanisms are &lt;em&gt;simple&lt;/em&gt;, so I'd stick to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; (or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;) and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; (or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;), instead of trying to create a hybrid.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2018-01-31T22:52:48.993" LastActivityDate="2018-01-31T22:52:48.993" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14687" PostTypeId="1" CreationDate="2018-01-29T04:23:04.893" Score="20" ViewCount="1279" Body="&lt;p&gt;It's almost February in 2018, which isn't supposed to be the proper time to cycle these, but for this year it'll be once again, so we'll be refreshing the &lt;strong&gt;Community Promotion Ads&lt;/strong&gt; for this year now!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;What are Community Promotion Ads?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Community Promotion Ads are community-vetted advertisements that will show up on the main site, in the right sidebar. The purpose of this question is the vetting process. Images of the advertisements are provided, and community voting will enable the advertisements to be shown.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Why do we have Community Promotion Ads?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is a method for the community to control what gets promoted to visitors on the site. For example, you might promote the following things:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the site's twitter account&lt;/li&gt;&#xA;&lt;li&gt;code puzzle blogs and websites&lt;/li&gt;&#xA;&lt;li&gt;interesting challenge sites&lt;/li&gt;&#xA;&lt;li&gt;cool events or conferences&lt;/li&gt;&#xA;&lt;li&gt;anything else your community would genuinely be interested in&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The goal is for future visitors to find out about &lt;em&gt;the stuff your community deems important&lt;/em&gt;. This also serves as a way to promote information and resources that are &lt;em&gt;relevant to your own community's interests&lt;/em&gt;, both for those already in the community and those yet to join. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Why do we reset the ads every year?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Some services will maintain usefulness over the years, while other things will wane to allow for new faces to show up. Resetting the ads every year helps accommodate this, and allows old ads that have served their purpose to be cycled out for fresher ads for newer things. This helps keep the material in the ads relevant to not just the subject matter of the community, but to the current status of the community. We reset the ads once a year, every December.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The community promotion ads have no restrictions against reposting an ad from a previous cycle. If a particular service or ad is very valuable to the community and will continue to be so, it is a good idea to repost it. It may be helpful to give it a new face in the process, so as to prevent the imagery of the ad from getting stale after a year of exposure.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;How does it work?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The answers you post to this question &lt;em&gt;must&lt;/em&gt; conform to the following rules, or they will be ignored. &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;All answers should be in the exact form of:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[![Tagline to show on mouseover][1]][2]&#xA;&#xA;   [1]: http://image-url&#xA;   [2]: http://clickthrough-url &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Please &lt;strong&gt;do not add anything else to the body of the post&lt;/strong&gt;. If you want to discuss something, do it in the comments.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The question must always be tagged with the magic &lt;a href=&quot;/questions/tagged/community-ads&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;community-ads&amp;#39;&quot; rel=&quot;tag&quot;&gt;community-ads&lt;/a&gt; tag. In addition to enabling the functionality of the advertisements, this tag also pre-fills the answer form with the above required form.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h3&gt;Image requirements&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The image that you create must be 300 x 250 pixels, or double that if high DPI.&lt;/li&gt;&#xA;&lt;li&gt;Must be hosted through our standard image uploader (imgur)&lt;/li&gt;&#xA;&lt;li&gt;Must be GIF or PNG&lt;/li&gt;&#xA;&lt;li&gt;No animated GIFs&lt;/li&gt;&#xA;&lt;li&gt;Absolute limit on file size of 150 KB&lt;/li&gt;&#xA;&lt;li&gt;If the background of the image is white or partially white, there must be a 1px border (2px if high DPI) surrounding it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Score Threshold&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;There is a &lt;strong&gt;minimum score threshold&lt;/strong&gt; an answer must meet (currently &lt;strong&gt;6&lt;/strong&gt;) before it will be shown on the main site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can check out the ads that have met the threshold with basic click stats &lt;a href=&quot;https://codegolf.meta.stackexchange.com/ads/display/14687&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="2414" LastActivityDate="2018-12-26T21:55:16.407" Title="Community Promotion Ads - 2018" Tags="|discussion|community-ads|" AnswerCount="10" CommentCount="2" ClosedDate="2019-02-07T13:32:30.477" ContentLicense="CC BY-SA 3.0" />
  <row Id="14688" PostTypeId="2" ParentId="14687" CreationDate="2018-01-29T04:23:04.893" Score="-7" Body="&lt;p&gt;&lt;a href=&quot;https://twitter.com/StackCodeGolf&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZJKMH.png&quot; alt=&quot;Help this community grow -- follow us on twitter!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="2414" LastEditorUserId="43319" LastEditDate="2018-01-31T20:40:47.853" LastActivityDate="2018-01-31T20:40:47.853" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14689" PostTypeId="2" ParentId="14687" CreationDate="2018-01-29T04:31:19.113" Score="63" Body="&lt;p&gt;&lt;a href=&quot;https://tio.run/#home&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/44PbI.png&quot; alt=&quot;Over 600 online interpreters. Free of charge, open source, and ad-free.&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2018-12-26T21:55:16.407" LastActivityDate="2018-12-26T21:55:16.407" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="14691" PostTypeId="2" ParentId="14687" CreationDate="2018-01-29T05:43:50.463" Score="13" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions?sort=featured&quot;&gt;&lt;img src=&quot;https://stack-exchange-dynamic-ads.herokuapp.com/codegolf.stackexchange.com/bounty.png&quot; alt=&quot;Bounties for everybody&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2018-01-29T05:43:50.463" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14692" PostTypeId="2" ParentId="14687" CreationDate="2018-01-29T05:45:05.903" Score="40" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/40695&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/n3xsb.png&quot; alt=&quot;Have a challenge idea? Iron out its bugs. Join us in the Sandbox!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2018-01-29T05:45:05.903" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14693" PostTypeId="2" ParentId="14687" CreationDate="2018-01-29T09:23:38.947" Score="32" Body="&lt;p&gt;&lt;a href=&quot;https://github.com/abrudz/lb/blob/master/README.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/PT2I9.png&quot; alt=&quot;Bookmarklet — no install needed!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2018-01-29T09:23:38.947" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14694" PostTypeId="2" ParentId="2140" CreationDate="2018-01-29T16:54:22.847" Score="5" Body="&lt;h1&gt;Learning your strengths and weaknesses &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Fighters have a unique, random Strength (between 1 and 1000)&lt;/li&gt;&#xA;&lt;li&gt;When two fighters fight, the stronger one wins.&lt;/li&gt;&#xA;&lt;li&gt;Your goal is to accurately guess your fighter's Strength.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Gameplay:&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;We start by randomly ordering all 1000 fighters.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each fighter fights his neighbor (The even fighters fight the fighter 1 above)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The fighter is given two pieces of information:  His opponent's last guess, and who won the fight.  The fighter then guesses his strength.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;We perform a stable sort based on the guessed strength, and go back to step 2&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;After 10 guesses, the fighter's score is &lt;code&gt;(RealStrength - GuessedStrength)^2&lt;/code&gt;.  Lower is better.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h1&gt;Other details:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;There will be duplicate bots in a single game.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A stable sort is a sort that (effectively) uses the past ordering as a tiebreaker.  In essence, if players &lt;code&gt;[A,B,C,D]&lt;/code&gt; guessed &lt;code&gt;[10,5,10,5]&lt;/code&gt; then the new order would be &lt;code&gt;[B,D,A,C]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Bots aren't allowed to share information between each other, but are allowed to persist information within a single game.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I will run a large number of games.  The exact number will be dependent on how much variation there is.  Your final score will be all of your scores summed up.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-01-29T22:07:38.470" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="14696" PostTypeId="2" ParentId="14687" CreationDate="2018-01-29T19:01:22.897" Score="9" Body="&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/57815/jelly-hypertraining&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/zIFyO.png&quot; alt=&quot;Want to improve your Jelly skills? – Join Jelly HyperTraining!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="43319" LastEditDate="2018-05-15T14:41:28.440" LastActivityDate="2018-05-15T14:41:28.440" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="14698" PostTypeId="1" CreationDate="2018-01-29T20:02:59.687" Score="18" ViewCount="602" Body="&lt;p&gt;Programming Puzzles &amp;amp; Code Golf is scheduled for an election &lt;a href=&quot;https://codegolf.stackexchange.com/election/2&quot;&gt;next week, February 5th&lt;/a&gt;. In connection with that, we will be holding a Q&amp;amp;A with the candidates. This will be an opportunity for members of the community to pose questions to the candidates on the topic of moderation.  Participation is completely voluntary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unlike &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8752/2016-moderator-election-qa-question-collection&quot;&gt;last time&lt;/a&gt;, we're hosting the question collection a week in advance, so that not only can folks start prepping questions in advance, but also potential candidates can think about nominating themselves and seeing the questions they'll have an opening to answer.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;The purpose of this thread was to collect questions for the questionnaire. The questionnaire is now live, and you may find it &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14763/2018-moderator-election-qa-questionnaire&quot;&gt;here&lt;/a&gt;.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Here's how it'll work:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Until the nomination phase, (so, until Monday, February 5th at 20:00:00Z UTC, or 3:00 pm EST on the same day, give or take time to arrive for closure), this question will be open to collect potential questions from the users of the site. Post answers to this question containing any questions you would like to ask the candidates. Please only post &lt;em&gt;one question per answer&lt;/em&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;We, the Community Team, will be providing a small selection of generic questions. The first two will be guaranteed to be included, the latter ones are if the community doesn't supply enough questions. This will be done in a single post, unlike the prior instruction.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If your question contains a link, please use the syntax of &lt;code&gt;[text](link)&lt;/code&gt;, as that will make it easier for transcribing for the finished questionnaire.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is a perfect opportunity to voice questions that are specific to your community and issues that you are running into at currently.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;At the start of the nomination phase, the Community Team will select &lt;strong&gt;up to 8 of the top voted questions submitted by the community&lt;/strong&gt; provided in this thread, to use in addition to the aforementioned 2 guaranteed questions. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Once questions have been selected, a new question will be opened to host the actual questionnaire for the candidates, typically containing 10 questions in total.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is not the only option that users have for gathering information on candidates. As a community, you are still free to, for example, hold a live chat session with your candidates to ask further questions, or perhaps clarifications from what is provided in the Q&amp;amp;A.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If you have any questions or feedback about this process, feel free to post as a comment here.&lt;/p&gt;&#xA;" OwnerUserId="2414" LastEditorUserId="2414" LastEditDate="2018-02-05T20:01:30.510" LastActivityDate="2018-02-05T20:01:30.510" Title="2018 Moderator Election Q&amp;A - Question Collection" Tags="|discussion|election|" AnswerCount="9" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14699" PostTypeId="2" ParentId="14698" CreationDate="2018-01-29T20:02:59.687" Score="5" Body="&lt;p&gt;Here is a set of general questions, gathered as very common questions asked every election. As mentioned in the instructions, the first two questions are guaranteed to show up in the Q&amp;amp;A, while the others are if there aren't enough questions (or, if you like one enough, you may split it off as a separate answer for review within the community's 8). &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How would you deal with a user who produced a steady stream of valuable posts, but tends to generate a large number of arguments/flags from comments? &lt;/li&gt;&#xA;&lt;li&gt;How would you handle a situation where another mod closed/deleted/etc a question that you feel shouldn't have been?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In your opinion, what do moderators do? &lt;/li&gt;&#xA;&lt;li&gt;A diamond will be attached to everything you say and have said in the past, including questions, answers and comments. Everything you will do will be seen under a different light. How do you feel about that? &lt;/li&gt;&#xA;&lt;li&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep? &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="2414" LastEditorUserId="31716" LastEditDate="2018-01-30T17:24:22.873" LastActivityDate="2018-01-30T17:24:22.873" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14700" PostTypeId="2" ParentId="14698" CreationDate="2018-01-29T20:28:16.597" Score="11" Body="&lt;h2&gt;Community Consensus&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given the recent debates surrounding &quot;baseline&quot; answers, how do you feel you will  balance the following, in general?  &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;guiding the community consensus,  &lt;/li&gt;&#xA;&lt;li&gt;building the community consensus, and  &lt;/li&gt;&#xA;&lt;li&gt;abiding by the community consensus&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;In particular, is there something unique or special you feel you can bring to the community to help out with questions like these?&lt;/p&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="46271" LastEditDate="2018-02-05T19:42:31.143" LastActivityDate="2018-02-05T19:42:31.143" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14702" PostTypeId="2" ParentId="1352" CreationDate="2018-01-30T09:03:56.747" Score="2" Body="&lt;h2&gt;You do not need the ability to solve your own challenges!&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It's however beneficial if you have the ability to understand your own challenges to the extent that you see potential problems with it and are able to answer questions asking for clarifications. (The sandbox will help a lot here).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Proof, by counterexamples&lt;/strong&gt;: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Suppose the ability to solve your own challenges was a requirement.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That would entail that the following challenges would never have been posted:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/11880/31516&quot;&gt;Build a working game of Tetris in Conway's Game of Life&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/88783/31516&quot;&gt;Build a digital clock in Conway's Game of Life&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/28821/31516&quot;&gt;Regex that only matches itself&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Many of my challenges, including &lt;a href=&quot;https://codegolf.stackexchange.com/q/65641/31516&quot;&gt;The versatile integer printer&lt;/a&gt;, and &lt;em&gt;possibly&lt;/em&gt;&lt;sup&gt;1&lt;/sup&gt; some of &lt;a href=&quot;https://codegolf.stackexchange.com/users/26997/calvins-hobbies&quot;&gt;Calvin's Hobbies&lt;/a&gt; awesome &lt;a href=&quot;https://codegolf.stackexchange.com/users/26997/calvins-hobbies?tab=questions&amp;amp;sort=votes&quot;&gt;challenges&lt;/a&gt;, for instance &lt;a href=&quot;https://codegolf.stackexchange.com/q/92944/31516&quot;&gt;this one&lt;/a&gt; wouldn't have been posted either.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All the aforementioned challenges have more than 80 upvotes and are definitely well received by the community. This contradicts the first assumption, thus it's proven that the ability to solve your own challenges is not a requirement.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;sup&gt;1&lt;/sup&gt; Apologies to Calvin's Hobbies if I underestimate your programming skills, but some of those challenges are really tricky, and you haven't posted many answers that prove me wrong.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="31516" LastActivityDate="2018-01-30T09:03:56.747" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14703" PostTypeId="2" ParentId="14698" CreationDate="2018-01-30T12:30:06.823" Score="7" Body="&lt;h1&gt;Finding out invalid solutions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Somebody posts a solution, which seems to be valid at first sight. However, you analyze it further, and find out it's invalid. Nobody else has already commented or flagged about it. What do you do?&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2018-01-30T19:32:34.280" LastActivityDate="2018-01-30T19:32:34.280" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14705" PostTypeId="2" ParentId="14698" CreationDate="2018-01-30T18:51:08.503" Score="13" Body="&lt;p&gt;Imagine the following scenario:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A challenge by a new user is posted, and it quickly receives a fair amount of downvotes (and potentially even close votes), because it has &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges&quot;&gt;some specs that we dislike&lt;/a&gt;. However, you think that the core idea is good and that the post is salvageable. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;What would you do in such situations as a moderator? What if the OP doesn't want to change their challenge, and insists on keeping the disliked specs?&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="59487" LastEditDate="2018-01-31T13:06:37.550" LastActivityDate="2018-01-31T13:06:37.550" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14708" PostTypeId="2" ParentId="14687" CreationDate="2018-01-31T12:03:41.237" Score="9" Body="&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/52405/the-apl-orchard&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/VAV4a.png&quot; alt=&quot;J and K are on topic too!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2018-05-23T17:40:21.090" LastActivityDate="2018-05-23T17:40:21.090" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="14710" PostTypeId="2" ParentId="14577" CreationDate="2018-01-31T13:14:15.577" Score="8" Body="&lt;h1&gt;Add support back, but make it not trigger in code blocks.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As far as I can see, this is the root of all problems. @200_success on CodeReview Meta &lt;a href=&quot;https://codereview.meta.stackexchange.com/questions/1438/mathjax-on-codereview/1546#comment4768_1708&quot;&gt;says&lt;/a&gt; (emphasis mine):&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;MathJax is currently enabled with $ … $ as delimiters. However, that breaks existing posts that contain two dollar signs within the same paragraph, &lt;strong&gt;but where the code is not formatted using backticks or a code block.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;...which makes me think that this, IMO proper, fix is easily achievable.&lt;/p&gt;&#xA;" OwnerUserId="55934" LastActivityDate="2018-01-31T13:14:15.577" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14711" PostTypeId="2" ParentId="2140" CreationDate="2018-01-31T15:22:12.043" Score="2" Body="&lt;h1&gt;Casinos and Gamblers &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You either play as a casino, or as a gambler.  Casinos offer bets, and gamblers choose bets to take.  &lt;strong&gt;Casinos want to make money, gamblers want to have more money than others.&lt;/strong&gt;  Read that sentence again, it is the core concept here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A game is made up of 100 turns, 10 casinos, and 10 gamblers.  Gamblers start with 1000 dollars, casinos start with 0.  A turn consists of:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;All casinos simultaneously comes up with a Bet.  A Bet consists of three parts:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Entry Fee (Positive integer amount a gambler must pay to take)&lt;/li&gt;&#xA;&lt;li&gt;Odds (The chance that a gambler will win between 0 and 1)&lt;/li&gt;&#xA;&lt;li&gt;Reward (Positive integer amount a gambler is given if he wins).  This can be any amount, even if it would make the casino go negative.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;Each gambler optionally chooses a bet to take.  They must have enough money to pay for the Entry Fee.&lt;/li&gt;&#xA;&lt;li&gt;We calculate who wins and who doesn't (using a PRNG), and pay out.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;At the end of a game, we give points as follows:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Casinos receive 1 point for each dollar they have (can be negative)&lt;/li&gt;&#xA;&lt;li&gt;Gamblers receive N^2 points for having more money than N other gamblers.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;A tournament consists of many games, and a player's score is their average score across all of the games.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Gamblers and Casinos all have complete information throughout the game.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2018-02-03T00:06:31.490" LastActivityDate="2018-02-03T00:06:31.490" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14712" PostTypeId="2" ParentId="12131" CreationDate="2018-01-31T18:42:30.703" Score="0" Body="&lt;h1&gt;For new answers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It might be possible to recommend having a header at the top of an answer something like this, maybe with a UI like the one &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/58826/programmer5000&quot;&gt;@programmer500&lt;/a&gt; suggested:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;&amp;lt;!-- CG{&quot;lang&quot;:&quot;Kotlin&quot;, &quot;size&quot;:[100,99,98]} --&amp;gt;&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The idea of it being that it is JSON, so parsing it in the dump should be &#xA;easy, and if more metadata wants to be added it can be while keeping backwards compatibility, the CG tag should make it easy to reduce the number of false positives being found.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;For old answers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It would seem that headers at the moment are quite mixed, based on analysis of the current dump data the breakdown of first tags in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; looks like this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;h1=67904&lt;/li&gt;&#xA;&lt;li&gt;h2=20315 &lt;/li&gt;&#xA;&lt;li&gt;p=3144 &lt;/li&gt;&#xA;&lt;li&gt;h3=983 &lt;/li&gt;&#xA;&lt;li&gt;pre=68 &lt;/li&gt;&#xA;&lt;li&gt;blockquote=15&lt;/li&gt;&#xA;&lt;li&gt;ol=13&lt;/li&gt;&#xA;&lt;li&gt;ul=11&lt;/li&gt;&#xA;&lt;li&gt;hr=4&lt;/li&gt;&#xA;&lt;li&gt;strike=1&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This may prevent all of the answers being automatically changed over, but as most of the answers follow a standard format it should mean that the rest can be dealt with manually.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using a version of the leaderboard regex that allows a few more separators I am working on finding all the posts with no header, the gist I will update is &lt;a href=&quot;https://gist.github.com/jrtapsell/ffa953ed074790ff5bb5fbde74634536&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="73772" LastEditorUserId="73772" LastEditDate="2018-01-31T19:12:48.720" LastActivityDate="2018-01-31T19:12:48.720" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14713" PostTypeId="2" ParentId="2140" CreationDate="2018-01-31T19:24:38.913" Score="-2" Body="&lt;h1&gt;Gatherer Golf: The 61 Dwarves&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://gatherer.wizards.com/Pages/Advanced.aspx&quot; rel=&quot;nofollow noreferrer&quot;&gt;Gatherer&lt;/a&gt; is the official tool for searching for Magic: The Gathering cards. Its advanced mode allows searching by most of the criteria you could hope for, as well as simple boolean combinations within a single kind of criterion (for example, you can do &quot;name contains X or Y and not Z&quot;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've been using it a lot recently, and have been trying to get better at more quickly finding the exact set of cards I need. For example, if I want creatures that can generate mana, searching for &lt;a href=&quot;http://gatherer.wizards.com/Pages/Search/Default.aspx?action=advanced&amp;amp;type=+[%22Creature%22]&amp;amp;text=+[%22add%20%7B%22]&quot; rel=&quot;nofollow noreferrer&quot;&gt;&quot;dd {&quot;&lt;/a&gt; seems to be the minimal exact string match on their rules text.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For this inaugural Gatherer Golf, your challenge is to create a query that lists, exactly, the 61 Dwarf cards (not counting creatures that are all creature types), without using the key &quot;subtype&quot;. The result generated the normal way can be found &lt;a href=&quot;http://gatherer.wizards.com/Pages/Search/Default.aspx?action=advanced&amp;amp;subtype=+[%22Dwarf%22]&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Your score is the length of the full URL in Gatherer. For example, searching for &quot;name contains Dw or Resp and type contains Creature&quot; generates the URL &lt;code&gt;gatherer.wizards.com/Pages/Search/Default.aspx?action=advanced&amp;amp;name=|[Dw]|[Resp]&amp;amp;type=+[%22Creature%22]&lt;/code&gt; for a score of 104.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Lowest score wins.&lt;/li&gt;&#xA;&lt;li&gt;Your URL can be manually generated; it doesn't have to be possible to create it via the advanced search form.&lt;/li&gt;&#xA;&lt;li&gt;Cards added to Gatherer after this challenge was posted (in this case, after Rivals of Ixalan) do not invalidate existing answers. Your answer may include or exclude any card published after that date, regardless of whether it's a dwarf, and answers that no longer give correct results (for example, because the Oracle text of a card changed) do not need to be deleted.&lt;/li&gt;&#xA;&lt;li&gt;Other than as described above, all cards in Gatherer are relevant to this challenge, regardless of whether they're legal for tournament play.&lt;/li&gt;&#xA;&lt;li&gt;Don't DOS Gatherer or otherwise break its terms of service.&lt;/li&gt;&#xA;&lt;li&gt;The cards may be listed in any order. This may be relevant if your search contains more than just dwarves, but concentrates all the dwarves into one page of the search results.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="6828" LastEditorUserId="6828" LastEditDate="2018-01-31T20:59:30.280" LastActivityDate="2018-01-31T20:59:30.280" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14714" PostTypeId="1" CreationDate="2018-01-31T20:40:03.860" Score="8" ViewCount="231" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/2414/grace-note&quot;&gt;Grace Note&lt;/a&gt; posted &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14688/43319&quot;&gt;a community ad&lt;/a&gt; which seems to claim that following PPCG on Twitter will help the community grow:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://twitter.com/StackCodeGolf&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZJKMH.png&quot; alt=&quot;Help this community grow -- follow us on twitter!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How does that work?&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="31716" LastEditDate="2018-01-31T22:43:20.560" LastActivityDate="2018-04-02T01:05:40.540" Title="How does following PPCG on Twitter help the community grow?" Tags="|discussion|site-health|stackexchange|advertising|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14715" PostTypeId="2" ParentId="6918" CreationDate="2018-01-31T21:19:51.403" Score="0" Body="&lt;h1&gt;ALPHA&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I made up this esoteric language by me, SnivyDroid, on the 27th of January, 2018 after reading about alphabetical-based esolangs like alphuck, it is just pseudo-code currently although I am working on structuring a interpreter with what little knowledge I have about parsing and interpreting code.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Basic Syntax&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;ALPHA Revolves around 1-character alphabetical mirrored commands, basically you start a command with the corresponding letter and you end it with the corresponding letter&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Starting a line&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;KK&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Printing a statement&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;KMSDFOODMK&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Hello World&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;KMDHELLO WORLDDMK&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here is the entire command set I made up:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A=Not Equal&#xA;B=Subtract&#xA;C=If&#xA;D=String&#xA;E=Divide&#xA;F=Multiply&#xA;G=Equal&#xA;H=Add&#xA;I=For loop&#xA;J=Variable&#xA;K=Line&#xA;L=While loop&#xA;M=Print&#xA;N=Break&#xA;O=Not&#xA;P=Integer&#xA;Q=Take input&#xA;R=Do&#xA;S=Array&#xA;T=Join&#xA;U=Set&#xA;V=Pop&#xA;W=Then&#xA;X=Modulo&#xA;Y=Append&#xA;Z=Special&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(Yes, I specifically shuffled the commands to make it painful)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Z would act as a way to access different sets of commands to extend into more specific functions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hopefully I should be able to write an interpreter one day, and if anyone has any advice on what I can use to make one that would be neat.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some other examples I whipped up:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Wide text generator&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;KMHTD DQQTD DHMK&#xA;KK - Start line&#xA;KM - Start print&#xA;KMH - Start Add&#xA;KMHT - Start Join&#xA;KMHTD D - Add String arg&#xA;KMHTD DQQ - Add input arg&#xA;KMHTD DQQT - End Join&#xA;KMHTD DQQTD D - Add String arg&#xA;KMHTD DQQTD DH - End Add&#xA;KMHTD DQQTD DHM - End print&#xA;KMHTD DQQTD DHMK - End line&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Generate a N-Length list of N&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;KUJAJSSUK&#xA;KMIUJCJUUJIJQQUIRYSSVIVYRMK&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Any feedback?&lt;/p&gt;&#xA;" OwnerUserId="77743" LastEditorUserId="77743" LastEditDate="2018-01-31T21:38:23.190" LastActivityDate="2018-01-31T21:38:23.190" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14717" PostTypeId="2" ParentId="14679" CreationDate="2018-01-31T23:15:25.447" Score="1" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;In my dream world, I would rather have code challenges generate a code that's actually useful in the real world, a code that makes its way to be an idiom, to be used in real world projects, and put in a language's standard library.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'm not entirely sure what you mean by &quot;&lt;em&gt;makes its way to be an idiom&lt;/em&gt;&quot;, but note that for the other practical purposes you mention the licensing of code on this site may not be ideal. Stack Exchange has attempted to resolve this issue, but the way they went about it &lt;a href=&quot;https://meta.stackexchange.com/q/271080/164922&quot;&gt;caused much kerfuffle&lt;/a&gt; and ended up being put on ice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that in a site-specific discussion of that proposal I did bring up &lt;a href=&quot;https://codegolf.stackexchange.com/a/9342/194&quot;&gt;one case&lt;/a&gt; of code I wrote for a PPCG question which might have practical use. You could look to that question for inspiration.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-01-31T23:15:25.447" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14718" PostTypeId="2" ParentId="14714" CreationDate="2018-01-31T23:23:15.500" Score="2" Body="&lt;p&gt;A bot tweets links to questions using similar criteria to the Hot Network Questions sidebar. HNQ is one of the biggest drivers of traffic to the smaller Stack Exchange sites, but the intention is clearly that the Twitter account should also drive traffic. Based on how Twitter works, the idea is probably that community members retweet links to questions they like.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I personally consider that HNQ is actively harmful, because it promotes trivial questions rather than good ones and gives people a distorted view of the site. On that basis I have downvoted the Twitter community ad, and I suspect that a good proportion of the other downvotes are based on similar reasoning.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-01-31T23:23:15.500" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14719" PostTypeId="2" ParentId="2140" CreationDate="2018-01-31T23:41:11.370" Score="0" Body="&lt;h2&gt;Unicode reversible programs&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The goal is to make a program that includes unicode formatting characters that when executed as-is generates a OEIS sequence, and when copied as its rendered* and executed, returns a different sequence.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The renderer is one that properly reacts to unicode formatting. For example with RLO the text should be reverted. (Its stored as &quot;\u202etest&quot; but renders as &quot;tset&quot;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is will be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the answer with less bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="64949" LastEditorUserId="64949" LastEditDate="2018-02-02T18:22:35.730" LastActivityDate="2018-02-02T18:22:35.730" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="14720" PostTypeId="1" CreationDate="2018-01-31T23:48:29.790" Score="1" ViewCount="102" Body="&lt;p&gt;Is it considered bad to edit old &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; answers to add in headers so that the answers can be easily seen by tools using the &lt;a href=&quot;http://data.stackexchange.com/codegolf/queries&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE&lt;/a&gt; or &lt;a href=&quot;https://archive.org/details/stackexchange&quot; rel=&quot;nofollow noreferrer&quot;&gt;data dumps&lt;/a&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can see pros and cons to doing this, and I what is the &lt;em&gt;correct&lt;/em&gt; thing to do in this case.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Pros&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Allows for easier analysis and searching&lt;/li&gt;&#xA;&lt;li&gt;Can bring more answers to questions that didn't get much attention first time round&lt;/li&gt;&#xA;&lt;li&gt;Standardises the posts using older header formats&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Cons&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Causes edits to old posts&lt;/li&gt;&#xA;&lt;li&gt;Can cause old posts to be bumped&lt;/li&gt;&#xA;&lt;li&gt;Adds to the &lt;code&gt;Suggested Edits&lt;/code&gt; queue, taking up time&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Also, are the rules different if it had a header from before the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5139/leaderboard-snippet&quot;&gt;leaderboard&lt;/a&gt; became common? I try to make sure if I can improve a post then I do that at the same time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This question is different to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11566/header-formatting-edit&quot;&gt;this&lt;/a&gt; as that one deals with occasional edits, where as this focuses more on bulk modifications.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I &lt;strong&gt;every so often&lt;/strong&gt; stumble upon an oldish challenge and find myself compelled to edit a lot of answers in order to make them follow the standard/new header formatting (## language name, bytes count).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="73772" LastEditorUserId="73772" LastEditDate="2018-02-01T16:40:47.403" LastActivityDate="2018-02-01T16:40:47.403" Title="Bulk editing code-golf answers to add headers" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="12" ClosedDate="2018-02-01T16:56:12.703" ContentLicense="CC BY-SA 3.0" />
  <row Id="14722" PostTypeId="2" ParentId="2140" CreationDate="2018-02-01T11:50:24.160" Score="0" Body="&lt;h1&gt;Non-true, non-false JS boolean&lt;/h1&gt;&#xA;&lt;p&gt;Array prototype isn't redefined, input hasn't getters&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;function magic(input){&#xA;  let result = [];&#xA;  if(input.boolean != true){result.push(&amp;quot;non-true&amp;quot;);}&#xA;  if(input.boolean != false){result.push(&amp;quot;non-false&amp;quot;);}&#xA;  result.push(input);&#xA;  return result.join(&amp;quot;\n&amp;quot;);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;returns&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;non-true&#xA;non-false&#xA;{&amp;quot;boolean&amp;quot;: true}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;What is passed to &lt;code&gt;magic&lt;/code&gt; function?&lt;/p&gt;&#xA;&lt;p&gt;Based on real problem :) I spent 30 minutes on this puzzle&lt;/p&gt;&#xA;" OwnerUserId="71612" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-03T07:40:13.297" CommentCount="19" ContentLicense="CC BY-SA 3.0" />
  <row Id="14724" PostTypeId="2" ParentId="14720" CreationDate="2018-02-01T16:19:06.070" Score="1" Body="&lt;p&gt;Based on discussions with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/56433/laikoni&quot;&gt;@laikoni&lt;/a&gt; in the comments it seems the following rules should be followed:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Try to minimise the amount of bumped questions&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This can be done by using a query like &lt;a href=&quot;http://data.stackexchange.com/codegolf/query/795630/&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; to find the questions with the highest amount of answers with broken headers&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Questions with low amounts of answers that are incorrect should have time left between fixes, to prevent bumping a large number of old questions.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="73772" LastActivityDate="2018-02-01T16:19:06.070" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14729" PostTypeId="2" ParentId="14698" CreationDate="2018-02-01T22:48:03.850" Score="11" Body="&lt;p&gt;Let's say that a new user comes to the site and posts a question with some problems. For example, either a challenge missing some specifications, or overruling default rules that we like to have on this site. Or it's not even a challenge, but simply a programming question, off-topic for this site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now let's say that a member of the community responds to this post in a harsh and unwelcoming way, either insulting the OP or rudely explaining which of our rules have they have unknowingly broken.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;What would you do to calm the tension in this situation?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What would you do to discourage people from harsh responses in the future?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What would you do to make sure that the new user still feels welcome?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2018-02-01T22:48:03.850" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14730" PostTypeId="2" ParentId="14698" CreationDate="2018-02-01T22:51:57.477" Score="13" Body="&lt;h1&gt;Moderation schedule&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;How active of a moderator will you be? What times will you generally be around to offer help when a moderator is needed? How much time do you expect you'll be able to spend on &lt;s&gt;janitorial&lt;/s&gt; moderator tasks? (Just an estimate. No one will hold you to this schedule) &lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="31716" LastEditDate="2018-02-02T07:56:29.277" LastActivityDate="2018-02-02T07:56:29.277" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14735" PostTypeId="2" ParentId="14698" CreationDate="2018-02-02T07:52:44.017" Score="3" Body="&lt;p&gt;Imagine the following scenario:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;To an otherwise hard challenge, someone posts a very trivial, built-in solution, either in a practical language specialised for those kinds of tasks or in a golfing language. A new-ish user submits another answer, which they worked hard for. As it usually happens on any internet community, the trivial answer receives a lot of good feedback (in the form of upvotes), while the other submissions don't receive much attention. Then the new user leaves a comment under the other user's answer, politely complaining about the voting culture.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;How would you act in this situation as a moderator? What would you do to stop / discourage this phenomenon? &lt;strong&gt;What would you do to stimulate healthy voting and encourage non-trivial solutions?&lt;/strong&gt; I know you cannot &lt;em&gt;enforce&lt;/em&gt; this by any means, but how would you use your influence as a moderator in this situation?&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="59487" LastEditDate="2018-02-02T08:06:02.037" LastActivityDate="2018-02-02T08:06:02.037" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14736" PostTypeId="2" ParentId="14698" CreationDate="2018-02-02T08:31:22.153" Score="8" Body="&lt;p&gt;Suppose the following happens:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A moderator takes action in a manner with which you disagree.&lt;/li&gt;&#xA;&lt;li&gt;Several community members see the action, and also disagree with it.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;How would you go about addressing the controversial action to both the moderation team and the community at large, to resolve the issue?&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2018-02-02T08:31:22.153" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14737" PostTypeId="1" CreationDate="2018-02-02T09:22:06.207" Score="36" ViewCount="2139" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14645/16766&quot;&gt;We've decided&lt;/a&gt; that we like the idea of a &quot;Language of the Month&quot; event. The main idea is to get more exposure for less-frequently used languages, and to have fun learning and golfing them together. The next question is, what languages shall we choose? And that's where you come in.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Procedure&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A language can be nominated for Language of the Month by posting an answer to this thread. We all vote on the languages we'd like to see featured. At the beginning of each month, the nomination with the highest net vote total is chosen as the Language of the Month. (This nomination process is modeled after &lt;a href=&quot;https://literature.meta.stackexchange.com/q/596/1091&quot;&gt;Lit.SE's reading challenges&lt;/a&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The chosen language will have a chatroom created for it, if it doesn't already have one. We could have a community ad to promote it, changing the ad each month to reflect the new featured language. &lt;strong&gt;(Does someone want to volunteer to create an ad?)&lt;/strong&gt; It can also be featured as a site-wide event in the &lt;a href=&quot;https://meta.stackexchange.com/q/130892/346927&quot;&gt;Community Bulletin Board sidebar&lt;/a&gt;; a mod would need to create the event.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;During the month, everyone who wants to participate will:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Learn the basics of the language (if they don't know it already)&lt;/li&gt;&#xA;&lt;li&gt;Answer challenges in it (new ones or old ones, doesn't matter)&lt;/li&gt;&#xA;&lt;li&gt;Try to outgolf each other's answers&lt;/li&gt;&#xA;&lt;li&gt;Discuss all of the above in the language's chatroom&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Past languages of the month will be added to a list at the bottom of this post. Their nomination posts should be deleted (preferably by the person who made the post) to reduce clutter.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What sort of languages should I nominate?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We hope to see a wide variety! But not every language is a good choice for Language of the Month. Some things to consider before nominating, and when voting on nominations:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It should be somewhat &lt;strong&gt;general-purpose&lt;/strong&gt; and &lt;strong&gt;possible to program in&lt;/strong&gt;. &lt;a href=&quot;http://esolangs.org/wiki/Bubblegum&quot; rel=&quot;nofollow noreferrer&quot;&gt;Bubblegum&lt;/a&gt; isn't a good choice, because it's only capable of solving a small subset of challenges. Neither is &lt;a href=&quot;http://esolangs.org/wiki/Malbolge&quot; rel=&quot;nofollow noreferrer&quot;&gt;Malbolge&lt;/a&gt; a good choice, because it's prohibitively hard to create a working program in it at all.&lt;/li&gt;&#xA;&lt;li&gt;It should &lt;strong&gt;not be one of our most commonly used languages&lt;/strong&gt; on PPCG. The point of this event is to bring attention to lesser-known languages. We don't really need to bring more attention to Python or JavaScript. Suggested rule of thumb: if there are fewer than 10 PPCG users who regularly golf in this language, it's a good nomination.*&lt;/li&gt;&#xA;&lt;li&gt;It should have a &lt;strong&gt;freely available implementation&lt;/strong&gt;. This can be &lt;a href=&quot;https://tio.run/&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;, some other online source, or a downloadable interpreter/compiler.&lt;/li&gt;&#xA;&lt;li&gt;It should be fairly &lt;strong&gt;stable&lt;/strong&gt;. Most languages &lt;a href=&quot;https://docs.python.org/3/whatsnew/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;change&lt;/a&gt; over time, even &lt;a href=&quot;https://isocpp.org/std/status&quot; rel=&quot;nofollow noreferrer&quot;&gt;well-established ones&lt;/a&gt;, so this is a subjective criterion. But if a language is likely to experience significant modifications in the next month, don't nominate it yet.&lt;/li&gt;&#xA;&lt;li&gt;It can be &lt;strong&gt;either esoteric or practical&lt;/strong&gt;. Of course we like our esolangs around here, but it would also be cool to study some lesser-known &quot;real&quot; languages.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;* Better rules of thumb are welcome. I made this one up after thinking about it for ten seconds.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What should I include in a nomination post?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;At a minimum, your nomination must include:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The language's &lt;strong&gt;name&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A link to a free &lt;strong&gt;implementation&lt;/strong&gt; (or more than one, if available).&lt;/li&gt;&#xA;&lt;li&gt;A short &lt;strong&gt;description&lt;/strong&gt; of the language, for those unfamiliar with it.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Why you think&lt;/strong&gt; this would make a good Language of the Month.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Ideally, your nomination should also include:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Some links to &lt;strong&gt;documentation&lt;/strong&gt; and other good resources for learning the language.&lt;/li&gt;&#xA;&lt;li&gt;A link to the language's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question, if it has one.&lt;/li&gt;&#xA;&lt;li&gt;Ideas for one or more &lt;strong&gt;language-specific challenges&lt;/strong&gt; that will provide an interesting experience beyond answering regular challenges in this language. These can be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;... you name it. Good language-specific challenges will focus on some aspect of the language that makes it unique, such as an ability or a weakness that most other languages don't have.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;List of past and current Languages of the Month&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;March 2018:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14917/16766&quot;&gt;Brachylog&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;April 2018:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/16116/31716&quot;&gt;Brain-Flak&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;May 2018:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/16337/41024&quot;&gt;MATL&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;June 2018:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/16480/16766&quot;&gt;QBasic&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;July 2018:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/16592/61613&quot;&gt;Japt&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;August 2018:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/16729/71434&quot;&gt;Self-modifying Brainfuck&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Don't forget to keep nominating and voting on languages for next month!&lt;/p&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="71434" LastEditDate="2018-08-17T17:48:06.247" LastActivityDate="2020-08-31T18:29:29.717" Title="Nominations for Language of the Month" Tags="|discussion|language-of-the-month|" AnswerCount="8" CommentCount="28" ClosedDate="2020-09-03T00:10:29.693" ContentLicense="CC BY-SA 4.0" />
  <row Id="14740" PostTypeId="2" ParentId="14687" CreationDate="2018-02-02T16:05:08.223" Score="27" Body="&lt;p&gt;&lt;a href=&quot;https://esolangs.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/vk4zF.png&quot; alt=&quot;Esolangs.org - the esoteric programming languages wiki&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="68615" LastEditorUserId="68615" LastEditDate="2018-02-04T13:33:38.587" LastActivityDate="2018-02-04T13:33:38.587" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14743" PostTypeId="2" ParentId="2140" CreationDate="2018-02-02T18:50:50.783" Score="-1" Body="&lt;h1&gt;Removing a Letter adds a Letter&lt;/h1&gt;&#xA;&lt;p&gt;Your program should output nothing when unaltered, however, when any single character is removed it should have an output length of 1. This extends to any number of characters being removed from the program, as long as there is, at minimum, a single character remaining.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;For example, if my program were &lt;code&gt;abcdefg&lt;/code&gt;, it should output nothing if unaltered.&lt;/p&gt;&#xA;&lt;p&gt;However, if I were to remove &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;d&lt;/code&gt; from this program to get &lt;code&gt;bcefg&lt;/code&gt;, it should output any two printable characters that represent 16 bytes of information (2 characters for 2 characters removed).&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;So if &lt;code&gt;bcefg&lt;/code&gt; outputs (&lt;code&gt;00&lt;/code&gt;,&lt;code&gt;AA&lt;/code&gt;,etc...) this is valid.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Taking this further, if we were to remove all but the letter &lt;code&gt;g&lt;/code&gt; we'd need an output of 6 characters.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;So if &lt;code&gt;g&lt;/code&gt; outputs ('000000','@$^%@(',etc...) this is valid.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Your program must function for all possible combinations of removals that are possible, that is to say each single letter in your program should be a valid program.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may &amp;quot;lock&amp;quot; pieces of the code, each locked byte counts for 2-bytes instead of 1-byte.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Locked bytes will never be removed.&lt;/li&gt;&#xA;&lt;li&gt;For instance, if my program was &lt;code&gt;abcdefg&lt;/code&gt; and &lt;code&gt;bcd&lt;/code&gt; is locked, the shortest program we'll get is &lt;code&gt;abcd&lt;/code&gt;,&lt;code&gt;bcde&lt;/code&gt;,&lt;code&gt;bcdf&lt;/code&gt; and &lt;code&gt;bcdg&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;bcd&lt;/code&gt; was locked in &lt;code&gt;abcdefg&lt;/code&gt; it'd be 10 bytes, not 7.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The program may output any byte to represent 1 removed character, N-bytes for N removed chars in the code itself.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-02T18:50:50.783" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14744" PostTypeId="2" ParentId="14698" CreationDate="2018-02-02T19:28:35.347" Score="-7" Body="&lt;p&gt;I'm kinda shocked this isn't here:&lt;/p&gt;&#xA;&lt;h1&gt;How active are you in meta-PPCG? Give examples.&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Wouldn't we want mods who care more about the meta of the site than the site itself?&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-02T19:28:35.347" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14745" PostTypeId="2" ParentId="2140" CreationDate="2018-02-02T21:26:22.323" Score="2" Body="&lt;h1&gt;Faux Compress a String&lt;/h1&gt;&#xA;&lt;p&gt;Given a string &lt;code&gt;s&lt;/code&gt;, perform a faux compression on it. Below is an example with &lt;code&gt;f('hello world')&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;To faux compress a string, start by taking a frequency count of all letters.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;hello world -&amp;gt; [h:1, e:1, l:3, o:2,  :1, w:1, r:1, d:1]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Next, sort smallest to largest in count with a tie-breaker of ASCII-code.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;[ :1, d:1, e:1, h:1, r:1, w:1, o:2, l:3]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Next, in the original string, replace each letter with it's index in the frequency list.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;[3,2,7,7,6,0,5,6,4,7,1]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Next, convert each integer to binary, and join them all with the digit &lt;code&gt;2&lt;/code&gt;, then convert this to base-3.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;1121021112111211020210121102100211121 -&amp;gt; 240591504997661290&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Lastly, print or return both this number and the sorted keyset of the frequency map.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;[240591504997661290, ' dehrwol']&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Is the final result.&lt;/p&gt;&#xA;&lt;p&gt;You now have a &amp;quot;faux compressed&amp;quot; string.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;To get a real compressed string you'd figure out the shortest sequence of bits to replace &lt;code&gt;2&lt;/code&gt; with which would be a unique delimiter and treat the binary digits as they are, bits, instead of bytes.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;More Examples&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;000000000001 -&amp;gt; [58839486765, '10']&#xA;eeEeeeeeeeeeeEEEEEeeeeee -&amp;gt; [16508589985213004629636, 'Ee']&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your code's function may be undefined if the following is not met:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The string may not start with the least frequent character.&lt;/li&gt;&#xA;&lt;li&gt;The string will contain more than one unique character.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Lowest byte count wins because this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;PSA: I have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/search?tab=active&amp;amp;q=user%3A59376+inquestion%3A2140&quot;&gt;many PENDING PROPOSALS&lt;/a&gt;, tell me which to delete.&lt;/h1&gt;&#xA;&lt;p&gt;If you post a comment on any of these challenges with the words &amp;quot;This isn't good in my opinion.&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;It will be removed.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-02T21:39:50.147" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14747" PostTypeId="2" ParentId="14737" CreationDate="2018-02-03T01:21:29.500" Score="12" Body="&lt;h1&gt;Cubically&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Cubically is an esolang created by me, &lt;a href=&quot;https://codegolf.stackexchange.com/users/61563/md-xf&quot;&gt;MD XF&lt;/a&gt;, designed to work with Rubik's Cubes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/aaronryank/Cubically&quot; rel=&quot;nofollow noreferrer&quot;&gt;Interpreter&lt;/a&gt;&#xA; - &lt;a href=&quot;https://cubically.github.io/docs&quot; rel=&quot;nofollow noreferrer&quot;&gt;Documentation&lt;/a&gt;&#xA; - &lt;a href=&quot;https://github.com/Cubically&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub Organization&lt;/a&gt;&#xA; - &lt;a href=&quot;https://chat.stackexchange.com/rooms/62883/cubically&quot;&gt;Chatroom&lt;/a&gt;&#xA; - &lt;a href=&quot;http://cubically.tryitonline.net/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it Online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Why?&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Cubically is very easy to use. No, it's not easy to perform simple tasks such as &quot;Hello, World!&quot; in, but it's really very easy to get started writing code. The syntax is simple for the most part, and the docs are fairly easy to understand.&lt;/li&gt;&#xA;&lt;li&gt;Cubically is powerful. Its 3-byte &lt;a href=&quot;https://codegolf.stackexchange.com/a/153968/61563&quot;&gt;3x3x3 solver&lt;/a&gt; finishes in under a second and in very few moves; it uses a nearly optimal algorithm.&lt;/li&gt;&#xA;&lt;li&gt;Cubically is fun. It forces its users to find algorithms and crazy code snippets to achieve simple tasks, like obtaining the integer 1.&lt;/li&gt;&#xA;&lt;li&gt;Most of all, &lt;strong&gt;Cubically does not get a lot of attention!&lt;/strong&gt; It was created over six months ago and it gets more and more useful every commit, but as far as I know, only four people have ever used it in something that wasn't a polyglot.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="61563" LastEditorUserId="46271" LastEditDate="2018-02-28T22:15:33.277" LastActivityDate="2018-02-28T22:15:33.277" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14750" PostTypeId="2" ParentId="6918" CreationDate="2018-02-04T16:55:00.010" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/RaspPiTor/17&quot; rel=&quot;nofollow noreferrer&quot;&gt;17&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;17 is a stack based language that has a bit of a focus on the number 17, for example it uses base 17 and whenever it tries to pop off an empty stack it returns 17.&#xA;It has blocks of code defined as &amp;lt; base-17 number &gt; {&amp;lt; code &gt;}. It starts at block 777 and then goes to whichever the block in memory location 0.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hello world:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;777 {&#xA;    44 $ 5g $ 66 : : $ $ 69 : $ 1f $ 52 $ $ 6c $ $ 5f $ 1g $ a $ 0 @&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Count down from 100 to 1(inclusive):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 {&#xA;2 #&#xA;1 -&#xA;:&#xA;2 @&#xA;2 &amp;lt;&#xA;0 @&#xA;2 # $$&#xA;a $&#xA;}&#xA;&#xA;&#xA;777 {&#xA;5g 2 @&#xA;0 1 @&#xA;0 0 @&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="77994" LastActivityDate="2018-02-04T16:55:00.010" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14752" PostTypeId="2" ParentId="14687" CreationDate="2018-02-04T18:27:06.777" Score="-4" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12575/ppcg-specific-mobile-app&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/5wyTo.png&quot; alt=&quot;Code a mobile app for PPCG!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2018-02-04T18:27:06.777" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14756" PostTypeId="2" ParentId="13935" CreationDate="2018-02-05T13:03:03.717" Score="2" Body="&lt;h1&gt;Why this is difficult&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12131/metadata-for-answers&quot;&gt;this&lt;/a&gt; shows, answers have no metadata at the moment, searching for &lt;code&gt;J&lt;/code&gt; for example will also give answers containing a letter J&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;How you can find answers for a given language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You can use [SEDE], but the data is only updated once a week, and you will only be able to find answers with some form of header.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Language users&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://data.stackexchange.com/codegolf/query/793250&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://data.stackexchange.com/codegolf/query/793250&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Language golfs&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://data.stackexchange.com/codegolf/query/797516&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://data.stackexchange.com/codegolf/query/797516&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="73772" LastEditorUserId="73772" LastEditDate="2018-02-05T13:08:49.583" LastActivityDate="2018-02-05T13:08:49.583" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14757" PostTypeId="2" ParentId="2140" CreationDate="2018-02-05T16:41:28.167" Score="0" Body="&lt;p&gt;Tags: Codegolf&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Title: evil detection&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When given any (you may choose the format and you should assume integer input) input, the output should be true if the input is a palindrome and false if not (or 1/0 or any equivalent).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To make it (a lot) harder, your code must work with a result that fulfills the challenge &lt;strong&gt;inverted&lt;/strong&gt; if read backwards. So for a palindrome input, forward gives true, backwards false.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your code is &quot;abc12&quot; and the input is 1221, your code should produce true-ish and &quot;21cba&quot; (your code read backwards) should produce false-ish. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bonus if you think that's to easy: produce false if and only if the input is 666 forward and true backwards.&lt;/p&gt;&#xA;" OwnerUserId="78017" LastEditorUserId="78017" LastEditDate="2018-02-06T18:58:32.680" LastActivityDate="2018-02-06T18:58:32.680" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="14759" PostTypeId="2" ParentId="2140" CreationDate="2018-02-05T18:06:12.727" Score="3" Body="&lt;h1&gt;Number rewinder&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Inspired by this &lt;a href=&quot;https://stackoverflow.com/questions/48584084/how-to-move-the-first-digit-to-the-end-of-a-number-in-c/48589774#48589774&quot;&gt;SO question&lt;/a&gt; and little bit expanded.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to rotate left a given integer by one digit in a given base and return integer (move the MSD to the LSD position).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: Two integers &lt;code&gt;Number &amp;gt; Base &amp;gt; 1&lt;/code&gt;&lt;br&gt;&#xA;Output: &lt;code&gt;Result&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Number Base  Result  String representations&#xA;61453   10    14536  61453 -&amp;gt; 14536&#xA;61453   16      223  F00D -&amp;gt; DF (00DF)&#xA;61453    8   229481  170015 -&amp;gt; 700151&#xA;60429   16    49374  EC0D -&amp;gt; C0DE&#xA;62977   16    24607  F601 -&amp;gt; 601F&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is Code-golf, standard loopholes are forbidden and shortest answer wins.&lt;/p&gt;&#xA;" OwnerUserId="71179" LastEditorUserId="71179" LastEditDate="2018-02-06T16:02:24.360" LastActivityDate="2018-02-06T16:02:24.360" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14760" PostTypeId="1" CreationDate="2018-02-05T18:21:13.567" Score="5" ViewCount="128" Body="&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Core_War&quot; rel=&quot;nofollow noreferrer&quot;&gt;Core War&lt;/a&gt; is a game about two or more programs written in an abstract assembly language (REDCODE) dueling/jousting/fighting. The goal of it is to get the enemy program to have no more running threads.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://esolangs.org/wiki/BF_Joust&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brainfuck Jousting&lt;/a&gt; is a Core Wars like game using a Brainfuck derivative instead of REDCODE. It has a bit of activity on the #esoteric IRC channel, but it's very thin. It has an abstraction syntax to make writing programs in it somewhat easier. Its goal is to zero out the enemy 'flag'&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do things like these and their relatives belong on PPCG? If so, how would they be handled and executed? What would be the scoring criteria? How would matchmaking be done?&lt;/p&gt;&#xA;" OwnerUserId="77964" LastEditorUserId="61405" LastEditDate="2018-02-05T18:59:31.413" LastActivityDate="2018-02-05T18:59:31.413" Title="Core Wars and similar programming challenges on PPCG?" Tags="|discussion|scope|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14761" PostTypeId="2" ParentId="14760" CreationDate="2018-02-05T18:55:03.987" Score="3" Body="&lt;p&gt;This would be perfectly appropriate for PPCG as a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenge! To quote the excerpt:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;King-of-the-hill indicates a game where the submissions interact with and compete against each other in some form of game. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In fact, a challenge very similar to this &lt;a href=&quot;https://codegolf.stackexchange.com/q/36645/31716&quot;&gt;has been done before!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A lot of your questions (scoring, execution, matchmaking, etc.) come down to the individual challenge, but you can find helpful information on &lt;a href=&quot;https://codegolf.stackexchange.com/tags/king-of-the-hill/info&quot;&gt;the tag wiki&lt;/a&gt;. An example of one scoring and matchmaking scheme you could use is to have every bot fight every other bot once, and each game count as 1 point for a win and 0 points for a win. Or you could do it in a &lt;a href=&quot;https://en.wikipedia.org/wiki/NCAA_Division_I_Men%27s_Basketball_Tournament#Current_tournament_format&quot; rel=&quot;nofollow noreferrer&quot;&gt;March Madness style bracket tournament&lt;/a&gt;. However, these are the kind of things that could be solved &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/31716&quot;&gt;in the sandbox&lt;/a&gt;. Sine KOTH challenges are notoriously hard to balance and implement, I would recommend posting your challenge there to get valuable feedback before going live.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2018-02-05T18:55:03.987" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14762" PostTypeId="1" CreationDate="2018-02-05T20:00:05.633" Score="6" ViewCount="135" Body="&lt;p&gt;The 2018 Community Moderator Election is now underway!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Community moderator elections have three phases:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Nomination phase&lt;/li&gt;&#xA;&lt;li&gt;Primary phase&lt;/li&gt;&#xA;&lt;li&gt;Election phase&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Most elections take between two and three weeks, but this depends on how many candidates there are.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please visit the official election page at&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/election&quot;&gt;https://codegolf.stackexchange.com/election&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;for more detail, and to participate!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you have general questions about the election process, or questions for moderator candidates, feel free to ask them here on meta -- just make sure your questions are tagged &lt;a href=&quot;/questions/tagged/election&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;election&amp;#39;&quot; rel=&quot;tag&quot;&gt;election&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="-1" LastActivityDate="2018-02-05T20:00:05.633" Title="2018 Community Moderator Election" Tags="|discussion|moderators|election|" AnswerCount="0" CommentCount="0" CommunityOwnedDate="2018-02-05T20:00:05.633" ContentLicense="CC BY-SA 3.0" />
  <row Id="14763" PostTypeId="1" CreationDate="2018-02-05T20:01:06.650" Score="22" ViewCount="912" Body="&lt;p&gt;In connection with the moderator elections, we are holding a Q&amp;amp;A thread for the candidates. Questions collected &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14698/2018-moderator-election-qa-question-collection&quot;&gt;from an earlier thread&lt;/a&gt; have been compiled into this one, which shall now serve as the space for the candidates to provide their answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Due to the submission count, we have selected all provided questions as well as one of our back up questions (not the one that got split off and then downvoted to oblivion, for the record) for a total of 10 questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a candidate, your job is simple - post an answer to this question, citing each of the questions and then post your answer to each question given in that same answer. For your convenience, I will include all of the questions in quote format with a break in between each, suitable for you to insert your answers. Just &lt;a href=&quot;https://codegolf.meta.stackexchange.com/revisions/97d021c0-6f43-4f8b-ac5c-062dcffaf626/view-source&quot;&gt;copy the whole thing after the first set of three dashes&lt;/a&gt;. Please consider putting your name at the top of your post so that readers will know who you are before they finish reading everything you have written, and also including a link to your answer on your nomination post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once all the answers have been compiled, this will serve as a transcript for voters to view the thoughts of their candidates, and will be appropriately linked in the Election page.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Good luck to all of the candidates!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Oh, and when you've completed your answer, please provide a link to it after this blurb here, before that set of three dashes. Please leave the list of links in the order of submission.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To save scrolling here are links to the submissions from each candidate (in order of submission):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14770/45941&quot;&gt;Mego&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14774/31716&quot;&gt;DJMcMayhem&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14776/31716&quot;&gt;PhiNotPi&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;&lt;p&gt;A challenge by a new user is posted, and it quickly receives a fair amount of downvotes (and potentially even close votes), because it has &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges&quot;&gt;some specs that we dislike&lt;/a&gt;. However, you think that the core idea is good and that the post is salvageable. What would you do in such situations as a moderator? What if the OP doesn't want to change their challenge, and insists on keeping the disliked specs?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;How active of a moderator will you be? What times will you generally be around to offer help when a moderator is needed? How much time do you expect you'll be able to spend on janitorial moderator tasks? (Just an estimate. No one will hold you to this schedule)&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;Let's say that a new user comes to the site and posts a question with some problems. For example, either a challenge missing some specifications, or overruling default rules that we like to have on this site. Or it's not even a challenge, but simply a programming question, off-topic for this site. Then, a member of the community responds to this post in a harsh and unwelcoming way, either insulting the OP or rudely explaining which of our rules have they have unknowingly broken. What would you do to calm the tension in this situation? What would you do to discourage people from harsh responses in the future? What would you do to make sure that the new user still feels welcome?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;Given the recent debates surrounding &quot;baseline&quot; answers, how do you feel you will balance the following, in general?: (1) guiding the community consensus, (2) building the community consensus, and (3) abiding by the community consensus; In particular, is there something unique or special you feel you can bring to the community to help out with questions like these?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;Suppose a fellow moderator takes action in a manner with which you disagree. Furthermore, several community members see the action, and also disagree with it. How would you go about addressing the controversial action to both the moderation team and the community at large, to resolve the issue?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;Somebody posts a solution, which seems to be valid at first sight. However, you analyze it further, and find out it's invalid. Nobody else has already commented or flagged about it. What do you do?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;How would you deal with a user who produced a steady stream of valuable posts, but tends to generate a large number of arguments/flags from comments?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;How would you handle a situation where another mod closed/deleted/etc a question that you feel shouldn't have been?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;To an otherwise hard challenge, someone posts a very trivial, built-in solution, either in a practical language specialised for those kinds of tasks or in a golfing language. A new-ish user submits another answer, which they worked hard for. As it usually happens on any internet community, the trivial answer receives a lot of good feedback (in the form of upvotes), while the other submissions don't receive much attention. Then the new user leaves a comment under the other user's answer, politely complaining about the voting culture. How would you act in this situation as a moderator? What would you do to stop / discourage this phenomenon? &lt;strong&gt;What would you do to stimulate healthy voting and encourage non-trivial solutions?&lt;/strong&gt; I know you cannot &lt;em&gt;enforce&lt;/em&gt; this by any means, but how would you use your influence as a moderator in this situation?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="2414" LastEditorDisplayName="user45941" LastEditDate="2018-02-21T00:54:02.083" LastActivityDate="2018-02-21T00:54:02.083" Title="2018 Moderator Election Q&amp;A - Questionnaire" Tags="|discussion|election|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14765" PostTypeId="2" ParentId="2140" CreationDate="2018-02-05T20:53:07.010" Score="1" Body="&lt;h2&gt;Code Basketball&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Programs are competing in a game of &quot;basketball&quot;. They are given a 5x6 (Minus the top center character)&#xA;grid on which to put either &lt;code&gt;/&lt;/code&gt;, &lt;code&gt;\&lt;/code&gt;, or &lt;code&gt;^&lt;/code&gt;. The programs can place two symbols every tick on the grid. If the programs try and place a symbol at the same place at the same time, neither symbol is placed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the first tick, a 'ball', &lt;code&gt;o&lt;/code&gt;, is spawned at (3,6) on the grid. The ball falls by one character every tick. If the ball encounters a \ while falling, it moves to the right. If it encounters a /, it moves to the left. If the ball hits a ^, it moves back to the top of the grid at that x position. The ball only moves once every tick, and does not effect the map on it's own.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When the ball is on the bottom row, if it's on the left, it gives a point to the first program and respawns, if it's on the right, it gives a point to the second program and respawns. If it's in the center, it simply respawns without giving points to anyone. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the ball tries to move off the map, it simply stays in place.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The grid is rotated when transfered to the contending programs so that it always appears that the left is that program's goal.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Program I/O&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Programs use Standard Input and Standard Output to communicate to the contest framework. The program is sent a 30 byte buffer containing a map and a 2 byte buffer containing the position of the ball.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program must send two 3 byte buffers in response with the character to put on the map, it's x position, and it's y position.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The framework gives each program 5 seconds to perform there action. If they fail to be within this 5 second window three times, they automatically lose to prevent the round from going on too long.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Competition&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Programs will compete in pairs of two. The winner of each pair will move on to the next round, and be paired up with another winner.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Sandbox questions&lt;/p&gt;&#xA;  &#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;&lt;p&gt;How can this be improved?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;What actions should I take to make sure rounds are fair?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;How should invalid data be handled when sent to the framework?&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="77964" LastEditorUserId="77964" LastEditDate="2018-02-05T21:14:12.670" LastActivityDate="2018-02-05T21:14:12.670" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="14766" PostTypeId="1" CreationDate="2018-02-05T21:02:36.017" Score="7" ViewCount="196" Body="&lt;p&gt;So, recently &lt;a href=&quot;https://codegolf.stackexchange.com/q/114280/15599&quot;&gt;this question&lt;/a&gt; (on which I have the only answer) has been bumped and as a result I have noticed several upvotes coming in on my answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Today I received some downvotes, and as a result became aware that the question has been marked as off topic. The reason given is that it has &quot;no objective winning criterion&quot; when in fact it does have one: &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The winner will be the person who first posts a program which accomplishes all of the following&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;As such it is a &quot;fastest gun in the west challenge.&quot; I looked to see what the consensus was on Meta, and the most relevant post &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5585/15599&quot;&gt;Are pure programming puzzles on topic?&lt;/a&gt; shows divided opinions on whether such challenges are off topic - in fact there is a slight leaning towards them being &lt;strong&gt;on&lt;/strong&gt; topic, though not the best choice of winning criterion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Clearly the OP of the Schlafi challenge recognised that significant time would be required to answer this question, and thought that fastest gun in the west was the best fit. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The current situation, however, is that the &quot;winner&quot; is already decided and this is claimed to discourage further entries.  But the action taken today (closing the question) does nothing to address this issue as it now completely &lt;strong&gt;prevents&lt;/strong&gt; further entries! This is especially true as the OP of the question is not particularly active on PPCG.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, I have two questions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Are those pure programming puzzles which take a significant amount of time to answer on topic? It's clear that the OP thought completing the challenge at all was sufficient achievement to award the acceptance (and there are a number of similar questions around.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What should we do with this question now?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;a) Leaving it closed achieves nothing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;b) Should it be reopened without editing?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;c) Should it be reopened with different winning criteria, what should they be and is the OP the only person who can choose? I would welcome an answer more  mathematically elegant than my own (and assume that's the kind of answer the OP would like to see) but that wouldn't likely be achieved by setting code-golf as the winning criterion. So what else? In order to encourage mathematically elegant answers, dare I suggest popularity contest? (ducks and runs for cover...)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an aside, the behaviour of punishing the answerer with downvotes for an issue with the question seems somewhat irrational to me, but it's not a big deal, and did alert me to the fact that the question had been closed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;EDIT&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Per Peter's answer, it seems I misinterpreted the meaning of &quot;pure programming puzzles&quot;. I did search the whole of meta for &quot;fastest gun&quot;, read quite a bit (rather quickly) and didn't find anything else relevant, so wasn't sure where to look for whether fastest gun is an on/off topic winning criterion for questions such as this one (though of course I understand why it is not a good winning criterion.) Peter's link is indeed more relevant. &lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="15599" LastEditDate="2018-02-06T22:53:53.380" LastActivityDate="2018-02-06T22:53:53.380" Title="What to do about the Schlafi question (and are time consuming pure programming puzzles on topic?)" Tags="|discussion|" AnswerCount="4" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14767" PostTypeId="2" ParentId="14766" CreationDate="2018-02-05T21:42:11.867" Score="2" Body="&lt;h2&gt;I think it is off topic and should be closed until further notice&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I recommend you take a look a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8135/56656&quot;&gt;Martin Ender's answer to &lt;em&gt;Why do we have objective winning criteria?&lt;/em&gt;&lt;/a&gt; Here Martin outlines what our objective winning criterion requirement accomplishes.  I'm not going to talk about the whole answer but I think it is definitely worth a read.  But I am going to highlight a few sections that I think are important.  In this section Martin discusses what a challenge with an objective winning criterion feels like in comparison to challenges without any criterion. &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Here is how a challenge works that has an objective scoring: you come up with a solution that is valid, and may or may not do reasonably well. However, you have a pretty good idea how you can or cannot improve that score, and if you can, you do. At some point you'll think &quot;yeah that looks reasonably good, I'll go with this&quot;. But then you'll see the other participants' scores and notice that you're only a few &quot;points&quot; behind (whatever those are in the specific challenge). And suddenly you've got a very specific goal: come up with something to beat the other score. That's a tangible goal and a motivation to try new things, and it eliminates the problem of thinking &quot;yeah I think this is as good as it can be&quot; before that's really the case.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Challenges that operate on a fastest guns in the west approach while objective, don't do any of these things.  Once you have an answer that works (or you at least think probably works) you post it.  Fastest guns in the west does not allow you to improve your score, it only gets worse as time goes on.  There is no drive to make your answer better than the bare minimum.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fastest guns in the west may be a objective winning criteria, but it doesn't do what we want from an objective winning criteria. So if what Martin says we want is really what we want from a question, I think it ought to be considered off topic.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;As for it's closure I think off-topic questions should be closed, that way they can either be fixed or replaced before any more answers are added.  &lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2018-02-05T23:06:30.707" LastActivityDate="2018-02-05T23:06:30.707" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14770" PostTypeId="2" ParentId="14763" CreationDate="2018-02-05T23:32:35.960" Score="19" Body="&lt;p&gt;I'm Mego, your friendly neighborhood penguin. &lt;a href=&quot;https://codegolf.stackexchange.com/election/2#post-154959&quot;&gt;Nomination post&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;A challenge by a new user is posted, and it quickly receives a fair amount of downvotes (and potentially even close votes), because it has &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges&quot;&gt;some specs that we dislike&lt;/a&gt;. However, you think that the core idea is good and that the post is salvageable. What would you do in such situations as a moderator? What if the OP doesn't want to change their challenge, and insists on keeping the disliked specs?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I believe that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13071/45941&quot;&gt;challenges belong to the community&lt;/a&gt;. It is the community's responsibility to maintain the site - hence why edit privileges exist. If there is a conflict between the community and the OP, I believe the correct method of resolution would be to lock the post with the &quot;content disputes&quot; reason, and take the discussion to meta. If there is significant community support for changing a challenge, then the will of one user should not override the will of the community.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;2&quot;&gt;&#xA;  &lt;li&gt;How active of a moderator will you be? What times will you generally be around to offer help when a moderator is needed? How much time do you expect you'll be able to spend on janitorial moderator tasks? (Just an estimate. No one will hold you to this schedule)&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I almost always have PPCG and TNB open in browser tabs. I will be available as much as life allows, and I will spend as much time on janitorial tasks as needed in order to get them done.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;3&quot;&gt;&#xA;  &lt;li&gt;Let's say that a new user comes to the site and posts a question with some problems. For example, either a challenge missing some specifications, or overruling default rules that we like to have on this site. Or it's not even a challenge, but simply a programming question, off-topic for this site. Then, a member of the community responds to this post in a harsh and unwelcoming way, either insulting the OP or rudely explaining which of our rules have they have unknowingly broken. What would you do to calm the tension in this situation? What would you do to discourage people from harsh responses in the future? What would you do to make sure that the new user still feels welcome?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I would welcome the new user to PPCG, kindly explain the problems, and gently remind the community members to Be Nice.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;4&quot;&gt;&#xA;  &lt;li&gt;Given the recent debates surrounding &quot;baseline&quot; answers, how do you feel you will balance the following, in general?: (1) guiding the community consensus, (2) building the community consensus, and (3) abiding by the community consensus; In particular, is there something unique or special you feel you can bring to the community to help out with questions like these?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I believe that, as long as an opinion is reasonable, it is worth expressing, even if it does not get much community support. To that end, I do my best to contribute to every meta discussion I see, even if my opinions are unpopular. Even unpopular opinions have merit - they can help the community determine exactly what about those opinions they dislike, and help them come up with proposals that they do like. As a moderator, I would do nothing different in that regard. No matter what the community consensus is, I would uphold it as a moderator, even if I disagree with it.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;5&quot;&gt;&#xA;  &lt;li&gt;Suppose a fellow moderator takes action in a manner with which you disagree. Furthermore, several community members see the action, and also disagree with it. How would you go about addressing the controversial action to both the moderation team and the community at large, to resolve the issue?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I would start a discussion with the rest of the moderation team, to try to find a solution that we all were happy with. The moderation team would address the community, letting them know that we were aware of the community's opinion of the action, and that we were discussing it internally to come up with a solution that would be acceptable to all. Finally, when an acceptable solution is found, the moderator team would once again address the community, informing them of the final decision and the rationale behind it.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;6&quot;&gt;&#xA;  &lt;li&gt;Somebody posts a solution, which seems to be valid at first sight. However, you analyze it further, and find out it's invalid. Nobody else has already commented or flagged about it. What do you do?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I would continue to follow the procedure outlined in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990/45941&quot;&gt;our policy on invalid answers&lt;/a&gt;. The only difference is that I would be able to delete the answer myself, rather than having to raise a custom flag and have a moderator take care of it.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;7&quot;&gt;&#xA;  &lt;li&gt;How would you deal with a user who produced a steady stream of valuable posts, but tends to generate a large number of arguments/flags from comments?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It's important to separate the content from the user in cases like these. One must look objectively at the content and act appropriately, regardless of the user's history (unless their history would indicate that escalation of moderator action is necessary). It would not matter that the user produces valuable content - all users are beholden to the Be Nice policy. I would remind the user to Be Nice, and if they continue, I would take the appropriate moderation action, depending on the circumstances.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;8&quot;&gt;&#xA;  &lt;li&gt;How would you handle a situation where another mod closed/deleted/etc a question that you feel shouldn't have been?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is basically the same question as #5.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;9&quot;&gt;&#xA;  &lt;li&gt;To an otherwise hard challenge, someone posts a very trivial, built-in solution, either in a practical language specialised for those kinds of tasks or in a golfing language. A new-ish user submits another answer, which they worked hard for. As it usually happens on any internet community, the trivial answer receives a lot of good feedback (in the form of upvotes), while the other submissions don't receive much attention. Then the new user leaves a comment under the other user's answer, politely complaining about the voting culture. How would you act in this situation as a moderator? What would you do to stop / discourage this phenomenon? &lt;strong&gt;What would you do to stimulate healthy voting and encourage non-trivial solutions?&lt;/strong&gt; I know you cannot &lt;em&gt;enforce&lt;/em&gt; this by any means, but how would you use your influence as a moderator in this situation?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Users are allowed to vote however they wish (assuming that they don't break any network-wide rules like sockpuppeting or targeted voting). Trying to influence voting patterns is futile, and outside of the scope of moderation. The appropriate solution is to draw attention to exemplary answers (via bounties, chat, and the annual Best Of competition).&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;10&quot;&gt;&#xA;  &lt;li&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;An issue our community faces right now is the fact that flags take a while to be handled. As a moderator, I would be able to handle those flags (and also not generate my own flags that need to be handled), which would help alleviate the problem.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2018-02-11T20:52:54.543" LastActivityDate="2018-02-11T20:52:54.543" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14771" PostTypeId="2" ParentId="2140" CreationDate="2018-02-06T00:04:21.273" Score="1" Body="&lt;h1&gt;Basketball Recruitment &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;You're recruiting your local neighborhood for your Jr Basketball team.  However, the opposing team also is recruiting!&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You both stand at the end of the street of 100 houses.  Each house has a kid with a unique, random height from 1 to 100. Taller is better.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Actions take different amounts of time.&lt;/strong&gt;  Your opponent may have a different turn order, or may even have more/less turns than you.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you have spent less than or equal time than your opponent, then your turn is next (turns can be simultaneous)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;On your turn you perform one of the following actions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Recruit&lt;/strong&gt; the kid at the &lt;code&gt;N&lt;/code&gt;th house.  This takes &lt;code&gt;N&lt;/code&gt; Time.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If you both recruit the same kid, you get into argument, and he decides not to play basketball this year.  (Nobody gets him)&lt;/li&gt;&#xA;&lt;li&gt;Once recruited, a kid won't switch sides.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Disqualify&lt;/strong&gt; the kid at the &lt;code&gt;N&lt;/code&gt;th house.  There are myriads of rules to Jr Basketball, and you know just which rules he's breaking.  This takes &lt;code&gt;10&lt;/code&gt; time.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You cannot disqualify a kid that has been recruited or is in the process of recruitment.&lt;/li&gt;&#xA;&lt;li&gt;If you try to disqualify a kid on the same turn your opponent tries to recruit him, the disqualification fails.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;After all of the boys have been recruited, been disqualified, or lost interest, we play the big game:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;We place the teams into two lines from shortest to tallest.&lt;/li&gt;&#xA;&lt;li&gt;Each pair of boys play each other.&lt;/li&gt;&#xA;&lt;li&gt;The taller one wins, and gives his team 1 point.&lt;/li&gt;&#xA;&lt;li&gt;If a team has more boys than the other, they get 1 point for each extra boy.&lt;/li&gt;&#xA;&lt;li&gt;The team with the most points wins.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Now, your goal is to become the top recruiter.  This means you need to win as many games as possible.  You will face many other recruiters at random until a clear victor is decided.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-06T00:43:18.903" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14772" PostTypeId="2" ParentId="14766" CreationDate="2018-02-06T00:30:48.153" Score="0" Body="&lt;p&gt;Now that one of the close voters has posted, I give my own thoughts as poster of this meta question.&lt;/p&gt;&#xA;&lt;p&gt;Heeby Jeeby Man has made some good points, which apply very well to new questions. The point of an objective winning criterion is to encourage creativity. Therefore if no or a poor objective winning criterion is included on a new question, it may be commented on and &lt;strong&gt;temporarily&lt;/strong&gt; closed while the issue is sorted out. &lt;em&gt;The purpose of closing, except in cases where the question is not salvageable, is to improve the question so that it can be opened again in the near future.&lt;/em&gt; Hopefully this will lead to more interest and better answers&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Silently closing an old question does not achieve any of this.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Old questions may have been written when what was on/off topic is different to our current standards. If the issue is a simple matter of the objective winning criterion, the question is salvageable. If the aim is to get more answers on the question, silently closing a question because it has a fastest gun in the west winning criterion achieves nothing. Rather than promote more answers, it prevents them. &lt;strong&gt;&amp;quot;Closing this question until further notice&amp;quot; effectively means closing it forever and not receiving any more answers.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h1&gt;What should be done&lt;/h1&gt;&#xA;&lt;p&gt;To me, leaving the question open and unedited was an acceptable course of action. &lt;strong&gt;I do not agree that leaving old low-traffic questions with imperfect winning criteria causes people to select inappropriate winning criteria for new questions, as they do not tend to review old low-traffic questions when posting.&lt;/strong&gt; They &lt;strong&gt;are&lt;/strong&gt; influenced by commenters and close/reopen voters in the very active phase immediately after posting their question. I think reopening the question as is would be preferable to leaving it closed indefinitely. Reopening is following the &lt;strong&gt;spirit&lt;/strong&gt; of our laws encouraging creativity. Leaving it closed is followng the &lt;strong&gt;letter&lt;/strong&gt; of our laws to an end which is completely distinct from their intention.&lt;/p&gt;&#xA;&lt;p&gt;The OP is not very active on PPCG. I assume he would have liked to see other answers and would have appreciated a more mathematically elegant answer than my existing one. If we leave the question open Dennis (just might) come along with an answer a tenth of the size of mine that runs on an algorithm simulating tetrahedra in n-dimensional space that self-assemble into N-dimensional polytopes. But if we close it the chances of that happening are essentially reduced to zero. Popularity contest is not well liked and suffers strongly from the fastest gun in the west effect. The OP probably did not want to select Code Golf because either it would lead to unreadable code or because he thought that producing an answer at all was challenging enough and that the additional challenge of golfing would discourage people.&lt;/p&gt;&#xA;&lt;p&gt;On balance and reflection, &lt;strong&gt;I would like to see this question edited and reopened as Code-Golf (as a default winning criterion as I do not realistically see a better option.)&lt;/strong&gt; But I am reluctant to take that course of action unilaterally, especially as the poster of an existing answer. If others feel it is a good idea I can do edit or (preferably) somebody else or a moderator can do it.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;EDIT&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;To answer Peter's comment on what I mean by &amp;quot;silently closing a question&amp;quot;:&lt;/p&gt;&#xA;&lt;p&gt;By &amp;quot;silently closing a question&amp;quot; I mean closing a question which is no longer near top of the &amp;quot;Newest Questions&amp;quot; list without thinking what other options are available and with out discussion.&lt;/p&gt;&#xA;&lt;p&gt;Thus there are 2 types of what I would call &amp;quot;NON-silently closing&amp;quot; a question&lt;/p&gt;&#xA;&lt;p&gt;The first type of NON-silent is closing a question when it is brand new, near the top of the Newest Questions list, and all eyes are on it. It frequently occurs that flaws are found in questions, and it is desirable to close the question &lt;strong&gt;temporarily&lt;/strong&gt; to prevent answers while this is sorted out. Unless the question is low quality, this usually results in the question being reopened.&lt;/p&gt;&#xA;&lt;p&gt;The second type of NON-silent closing, is to ask a meta question first, similar to what was done in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8305/15599&quot;&gt;&amp;quot;Good&amp;quot; Questions That are Incomplete&lt;/a&gt;. The question under discussion here was at least as complete as the ones mentioned in that meta post, and had about as many upvotes as one of them. I do think that when you find a high quality old question that has an issue, the order of preference should be&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;FIX it&lt;/strong&gt; (with discussion if necessary)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;leave it alone in case someone wishes to answer it&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Close it, but not before seeking advice on meta or chat.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;If it wasn't for the fact that some of the close voters chose to downvote my answer, the closing would have gone unnoticed. And anyone wishing to answer later, rather than being &lt;strong&gt;&amp;quot;discouraged&amp;quot;&lt;/strong&gt; by the fastest gun criterion would have been &lt;strong&gt;unable&lt;/strong&gt; to answer without doing the legwork to get it opened (which is surely even more discouraging!) It also means the person trying to reopen a question in order to answer it would likely have to suggest or specify a winning criterion which is an awkward conflict of interest.&lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-06T22:47:48.617" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14774" PostTypeId="2" ParentId="14763" CreationDate="2018-02-06T01:36:43.760" Score="21" Body="&lt;p&gt;I'm DJMcMayhem. &lt;a href=&quot;https://codegolf.stackexchange.com/election/2#post-154953&quot;&gt;My nomination&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;A challenge by a new user is posted, and it quickly receives a fair amount of downvotes (and potentially even close votes), because it has &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges&quot;&gt;some specs that we dislike&lt;/a&gt;. However, you think that the core idea is good and that the post is salvageable. What would you do in such situations as a moderator? What if the OP doesn't want to change their challenge, and insists on keeping the disliked specs?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The very first thing I would do would be to comment on the post, explaining what about it is unpopular, and requesting that they edit it. In the end, if they don't want to improve their posts with the community's guidance, then they will just have to live with the downvotes and/or close votes. It's unfortunate if it has to come to that, but there are very real legitimate reasons we have the list of things to avoid.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;2&quot;&gt;&#xA;  &lt;li&gt;How active of a moderator will you be? What times will you generally be around to offer help when a moderator is needed? How much time do you expect you'll be able to spend on janitorial moderator tasks? (Just an estimate. No one will hold you to this schedule)&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Well frankly, I'm addicted to this site :P I do have a pretty full schedule between work and school, but right now, it's pretty much just part of my day that I'll check out PPCG from my phone during any spare moments. So I'm available to talk to pretty much whenever I'm awake. Generally, I will be most active in moderating tasks around 0-5 UTC. This chart shows when I'm most active in chat (all times in UTC)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/8Fkar.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/8Fkar.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;3&quot;&gt;&#xA;  &lt;li&gt;Let's say that a new user comes to the site and posts a question with some problems. For example, either a challenge missing some specifications, or overruling default rules that we like to have on this site. Or it's not even a challenge, but simply a programming question, off-topic for this site. Then, a member of the community responds to this post in a harsh and unwelcoming way, either insulting the OP or rudely explaining which of our rules have they have unknowingly broken. What would you do to calm the tension in this situation? What would you do to discourage people from harsh responses in the future? What would you do to make sure that the new user still feels welcome?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I have very strong opinions on this matter. I've written &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11807/31716&quot;&gt;a lengthy meta post&lt;/a&gt; on exactly this issue before. But, I'll summarize my thoughts on that post here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are two different issues at hand.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The post is off-topic, or has some serious problems that need to be addressed, and&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The harsh response of the community member is completely inappropriate. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;1) fairly easy to fix. If the post is off-topic, I would close it and leave a comment welcoming them to the site and explaining why their post is off-topic. And if the challenge just has some problems that can be fixed, I would comment on it, explaining what is wrong with the challenge, why the community dislikes certain things in challenges and asking them to edit it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2) is IMO a bigger issue. I strongly believe that all users should be welcomed to the site unless they repeatedly show hostility or a lack of willingness to comply with the community's rules. The OP, in this case, has done nothing wrong. They are simply misguided. And the number one rule across SE sites is &lt;a href=&quot;https://codegolf.stackexchange.com/help/be-nice&quot;&gt;be nice&lt;/a&gt;, and the user is clearly violating this rule. My response varies depending on exactly how rude the comment is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the very least, I would delete the rude comment, and write my own more welcoming comment. I would also tell the user who wrote the rude comment that their behavior is inappropriate, and will not be stood for. If the comment is straight out insulting, or this behavior becomes a longer pattern, I fully believe that a short suspension would be deserved.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;4&quot;&gt;&#xA;  &lt;li&gt;Given the recent debates surrounding &quot;baseline&quot; answers, how do you feel you will balance the following, in general?: (1) guiding the community consensus, (2) building the community consensus, and (3) abiding by the community consensus; In particular, is there something unique or special you feel you can bring to the community to help out with questions like these?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;As for 1 and 2, I believe that moderators have more cultural sway, but in the end have just as much responsibility to help build the community consensus as any other community member who chooses to be active on meta. So I recognize that if I were elected, my words would carry more weight, but I would still only be one voice in the discussion. For 3, I can say that I will always do my best to enforce the policies that the community has agreed upon, rather than my personal opinion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Is there something unique or special you feel you can bring to the community to help out with questions like these?&lt;/em&gt; Well, I have been active on this site for a long time, so I have a good feel for what would be healthy for the site, just due to familiarity.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;5&quot;&gt;&#xA;  &lt;li&gt;Suppose a fellow moderator takes action in a manner with which you disagree. Furthermore, several community members see the action, and also disagree with it. How would you go about addressing the controversial action to both the moderation team and the community at large, to resolve the issue?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;To the moderator team: I would bring this up in the private chat room as soon as possible. The goal is to come to a clear consensus on the right steps forward before taking any steps to undo the action. Since ideally, the moderator should come across as unified in their actions, I would tend to default towards &lt;em&gt;not&lt;/em&gt; overruling the action. But if it becomes clear that most of the moderators agree that the action was incorrect, we can discuss steps to fix it moving forward.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since after this election, there will be 6 moderators, I'm pretty confident that their will almost always be someone around to discuss what the correct course of action is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To the community: Since this action is by definition &lt;em&gt;controversial&lt;/em&gt;, I think the worst thing to do is prematurely respond to the community and tell them what will happen. As long as the issue is being worked on, there is no reason to rush it. I think a simple &lt;em&gt;We're discussing it, we'll get back to you once we know for sure&lt;/em&gt; is perfectly appropriate.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;6&quot;&gt;&#xA;  &lt;li&gt;Somebody posts a solution, which seems to be valid at first sight. However, you analyze it further and find out it's invalid. Nobody else has already commented or flagged about it. What do you do?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Well, as a community member, my response would be to explain to the user where their post is lacking, and link them to the relevant meta posts if necessary, sometimes accompanying a flag to make sure the issue is eventually fixed. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a mod, my actions would not be that different. I would comment, let them know the post is invalid, and give them some time to fix it. I would also save a link to the post, and make a note of it, so that I can delete it later if they don't fix it in a certain amount of time.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;7&quot;&gt;&#xA;  &lt;li&gt;How would you deal with a user who produced a steady stream of valuable posts, but tends to generate a large number of arguments/flags from comments?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is a tricky situation. In the end, I think that having a peaceful site without a large number of arguments and flags outweighs the value of the user's posts. In each individual case, the flags can be handled, or the arguments moved to chat. But after noticing a trend, it comes to time to escalate it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first escalation is to message the user. I have never been a mod before, so I don't exactly know what features are available, but I'm pretty sure there is a feature for private messaging. Or private chat rooms. I would explain to the user that we want them around, and their input is valuable, but that their current behavior is disrupting the site. I would ask them to stop and monitor whether it improves in the future. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The second escalation is a suspension. Assuming the user had not been suspended before, a week-long suspension would be fitting. It's unfortunate if it has to come to that, but like I said, I believe that a peaceful site is far more valuable than any one user's contributions. If the disruptive behavior continues after the suspension ends, the cycle will have to continue: PM's asking the user to stop and warning that a suspension is imminent, and another suspension with a greater length.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;8&quot;&gt;&#xA;  &lt;li&gt;How would you handle a situation where another mod closed/deleted/etc a question that you feel shouldn't have been?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The same way I would handle #5.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;9&quot;&gt;&#xA;  &lt;li&gt;To an otherwise hard challenge, someone posts a very trivial, built-in solution, either in a practical language specialized for those kinds of tasks or in a golfing language. A new-ish user submits another answer, which they worked hard for. As it usually happens in any internet community, the trivial answer receives a lot of good feedback (in the form of upvotes), while the other submissions don't receive much attention. Then the new user leaves a comment under the other user's answer, politely complaining about the voting culture. How would you act in this situation as a moderator? What would you do to stop/discourage this phenomenon? &lt;strong&gt;What would you do to stimulate healthy voting and encourage non-trivial solutions?&lt;/strong&gt; I know you cannot &lt;em&gt;enforce&lt;/em&gt; this by any means, but how would you use your influence as a moderator in this situation?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't think there really is anything to do in this situation. Overall, I dislike the current voting culture, but that's not the kind of thing that one user (or even one mod) could fix. In this specific instance, really the only thing that could be done is to delete the comment if it's off-topic or causing an argument. Beyond that, the only thing I could do to influence voting culture is &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;To write challenges which aren't likely to result in trivial answers, and &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;To do my best to reward exceptional answers, be it through voting, bountying, or bringing attention to them.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;But these are all things that have nothing to do with being a moderator or not.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;10&quot;&gt;&#xA;  &lt;li&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In a perfect world, I would not have to do much. The community would be able to handle issues as they arise, and mods would not be needed. But we don't live in a perfect world. So as a moderator, I would be able to jump in in situations that the community can't handle. I would channel my obsessive review checking into flag-handling and help the community take care of issues faster. And I would be more effective at moderating chat since there are certain privileges granted to mods that are not granted to room owners.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="69912" LastEditDate="2018-02-14T01:11:30.937" LastActivityDate="2018-02-14T01:11:30.937" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14776" PostTypeId="2" ParentId="14763" CreationDate="2018-02-06T05:59:42.910" Score="22" Body="&lt;p&gt;I'm PhiNotPi.  &lt;a href=&quot;https://codegolf.stackexchange.com/election/2#post-154976&quot;&gt;Nomination post.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;A challenge by a new user is posted, and it quickly receives a fair amount of downvotes (and potentially even close votes), because it has &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges&quot;&gt;some specs that we dislike&lt;/a&gt;. However, you think that the core idea is good and that the post is salvageable. What would you do in such situations as a moderator? What if the OP doesn't want to change their challenge, and insists on keeping the disliked specs?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If we're dealing with a truly new user, the way the moderation team handles this situation will strongly influence this user's decision to stay on the website or leave. So it is crucial for us to get this right, and honestly I think it would be good for the elected moderation team to get together and come to a consensus on the way that they should approach situations involving new users.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first step would be to get in immediate communication with the OP (such as commenting on his challenge) and explain the situation in non-accusatory terms:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Explain that the new user's post is most likely receiving downvotes because [part of spec] goes against a commonly-accepted community guideline [link to guideline here], which may cause it to be considered low-quality/off-topic, subject to the opinion of the community at large.&lt;/li&gt;&#xA;&lt;li&gt;But (and this is the important part, can't leave this out), say that some portion of the new user's idea is in fact salvageable and could make for a good challenge.  And explain an option or two on how to change the challenge to make it more appropriate for this site.  I think complimenting the parts that are good is just as important as pointing out the flaws, as can serve to encourage the user to keep working to improve their challenge.&lt;/li&gt;&#xA;&lt;li&gt;Tell them about the sandbox (although the sandbox isn't a panacea for all challenge issues).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If the user is receptive of the suggested changes, then that's great. I would recommend that the user make the necessary changes as soon as possible, either that or recommend that the user delete their post now to edit/undelete later. (I say this because downvotes are generally permanent once a question acquires them.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the user does not wish to make any changes to his spec, then what happens is up to the will of the community at large (well, those with appropriate privileges), since they are the primary judges of these sorts of community-consensus challenge guidelines.  The question may be closed or remain open. Concept ideas might eventually be adopted and reworked by other users. We should generally seek to avoid the escalation to content dispute, but those situations are possible, especially if the challenge has already attracted several on-topic/high-quality answers.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;2&quot;&gt;&#xA;  &lt;li&gt;How active of a moderator will you be? What times will you generally be around to offer help when a moderator is needed? How much time do you expect you'll be able to spend on janitorial moderator tasks? (Just an estimate. No one will hold you to this schedule)&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I am usually pingable in chat (and will often respond to any mention of irrational numbers). I believe I have the time to be an active member of the mod team and complete any necessary janitorial tasks. Certain semester schedules force me to work according to US Eastern Time, but during summers/other semesters my sleep cycle gets pushed back by several hours.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;3&quot;&gt;&#xA;  &lt;li&gt;Let's say that a new user comes to the site and posts a question with some problems. For example, either a challenge missing some specifications, or overruling default rules that we like to have on this site. Or it's not even a challenge, but simply a programming question, off-topic for this site. Then, a member of the community responds to this post in a harsh and unwelcoming way, either insulting the OP or rudely explaining which of our rules have they have unknowingly broken. What would you do to calm the tension in this situation? What would you do to discourage people from harsh responses in the future? What would you do to make sure that the new user still feels welcome?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;First, regarding addressing the new user, is probably best for me to restate what the other community member is likely attempting to say, but in a nicer way. This would be a good way to set a positive example.  It would start off as a generic introduction / explanation of what this site is about, then I would state what the new user's misconception is, and state that this is not the website they are looking for (&lt;em&gt;Note: I won't explicitly direct users to any other specific site because there have been past issues regarding cross-posting of questions not appropriate on any SE site&lt;/em&gt;). Finally I will encourage them to participate on this website, in the hopes that the new user might be interested in what this site is actually about.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Second, regarding the rude community member. It depends a lot on the extent to which their comment is considered rude. Appropriate action can vary from simply setting a positive example, or commenting a reminder to be respectful to new users, or messaging the community member in chat to tell him to be nicer, or in more drastic situations deletion of the comment/real penalties.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;4&quot;&gt;&#xA;  &lt;li&gt;Given the recent debates surrounding &quot;baseline&quot; answers, how do you feel you will balance the following, in general?: (1) guiding the community consensus, (2) building the community consensus, and (3) abiding by the community consensus; In particular, is there something unique or special you feel you can bring to the community to help out with questions like these?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;When it comes to guiding the community consensus, one of the more prominent roles of moderators is the creation of these community consensus meta questions.  Not that it has to be a moderator who initiates the conversation, but rather that I believe it is very much part of a moderator's job to find deficiencies in the existing meta consensuses and start the meta process.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When it comes to building a consensus I believe it is important to ask clear questions to receive clear answers. It is important to do background research, to provide examples of posts that could be affected by this consensus, etc.  The best consensuses must be actionable. That is, they must clearly delineate what is/isn't allowed. To use the &quot;baseline&quot; debate as an example, we are looking for more than a yes/no consensus, but also a guiding definition of what counts as a &quot;baseline&quot; answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When it comes to abiding by the community consensus, how that plays out depends significantly on the type of guideline as well as how clearly worded the guideline is.  In many circumstances (there's plenty of flexible guidelines out there about how to write good challenges), it is more up to the community if they see a violation as being significant enough to consider the challenge low-quality or off-topic.  When the meta consensus is clearly worded, then it's easier for moderators to get involved (given their close-hammer).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it would be nice to have a clearer distinction between when an answer goes from being suggested policy to official policy. Right now this is usually just a combination of upvotes + time, but this can be less clear when the different meta answers cover different aspects of the original question (might indicate the need for a follow-up meta question to answer a more clear-cut problem).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;5&quot;&gt;&#xA;  &lt;li&gt;Suppose a fellow moderator takes action in a manner with which you disagree. Furthermore, several community members see the action, and also disagree with it. How would you go about addressing the controversial action to both the moderation team and the community at large, to resolve the issue?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In my experience, it is usually best that the moderation seem present a uniform outward face to the community and attempt to resolve disputes about &lt;em&gt;specific actions&lt;/em&gt; internally at first.  This basically means that I shouldn't overrule/undo a previous moderation action &lt;em&gt;unless&lt;/em&gt; I am issuing the final agreed-upon opinion of the mod team. (Also to clarify, this is specifically referring to moderation actions: mods are free to offer differing opinions when building a meta consensus).  If community members voice their disagreement with an action, we should simply state that the mods are having a discussion about it and get back to them once we've come to an agreement.  If there's still reasonably strong disagreement about a particular moderation action, then it is likely worth creating a meta thread about that topic and create a new consensus, which will serve as a more final say.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;6&quot;&gt;&#xA;  &lt;li&gt;Somebody posts a solution, which seems to be valid at first sight. However, you analyze it further, and find out it's invalid. Nobody else has already commented or flagged about it. What do you do?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;As others have mentioned, there is a pretty solid existing policy about what to do with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7987/definitive-policy-about-answers-not-meeting-the-challenge-specification/7990#7990&quot;&gt;invalid answers&lt;/a&gt;.  If it's not invalid at first sight, it might be either due to some small easily-fixed detail that people are overlooking, or something much deeper (like, something that passes the available testcases due to [math reason] but breaks on other testcases).  I will first leave a comment explaining the problem.  As a mod I would be able to delete the answer myself if it stays up for too long, but in many cases this isn't particularly urgent.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;7&quot;&gt;&#xA;  &lt;li&gt;How would you deal with a user who produced a steady stream of valuable posts, but tends to generate a large number of arguments/flags from comments?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Once upon a time I was an admin on another (non-SE) site, and situations like this occurred many times. I believe that a user's arguments/flag-worthy content can detract from this site as much as that user's other posts add to it.  In the end, how we deal with inappropriate behavior shouldn't depend on how much rep a user has.  Quality content should of course be kept, rule-breaking content of course should be dealt with.  Don't underestimate the importance of having a nice community when it comes to attracting quality content from the userbase, it's not just about that one user's posts, but rather the site as a whole.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;8&quot;&gt;&#xA;  &lt;li&gt;How would you handle a situation where another mod closed/deleted/etc a question that you feel shouldn't have been?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This feels very similar to #5. The only difference being that this action hasn't drawn the attention of the community at large, simply my own attention.  So I should initiate a discussion among the mods, and possibly this could lead to a reversal of the action if the other mods agree or the creation of a new meta discussion if there are still disagreements.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;9&quot;&gt;&#xA;  &lt;li&gt;To an otherwise hard challenge, someone posts a very trivial, built-in solution, either in a practical language specialised for those kinds of tasks or in a golfing language. A new-ish user submits another answer, which they worked hard for. As it usually happens on any internet community, the trivial answer receives a lot of good feedback (in the form of upvotes), while the other submissions don't receive much attention. Then the new user leaves a comment under the other user's answer, politely complaining about the voting culture. How would you act in this situation as a moderator? What would you do to stop / discourage this phenomenon? &lt;strong&gt;What would you do to stimulate healthy voting and encourage non-trivial solutions?&lt;/strong&gt; I know you cannot &lt;em&gt;enforce&lt;/em&gt; this by any means, but how would you use your influence as a moderator in this situation?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;When it comes to responding to the new user's comment, there is not too much to say other than that voting is ultimately up to the users, and to reassure them that an absence of upvotes doesn't indicate an absence of quality. Although I do believe that the voting culture here is not always the best (and I think situations like these do have a negative impact on user retention: people are generally more motivated when they believe that they will be recognized for their efforts), I don't currently see anything that a mod can do to fix this voting problem.  I can simply vote according to my own evaluation of the answers.  I agree with other users in that bounties / awards are an excellent way of promoting high-quality posts.  As a spontaneous idea, I think it would be cool if we started something similar to the Best Of awards, but have a large number of small bounties instead of a small number of large bounties, and therefore have it running much more often then once a year.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;10&quot;&gt;&#xA;  &lt;li&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I stand by what I said in 2016:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;As a moderator, I will be able do a couple extra things, like moving/removing comments, having increased communication with the SE team, resolving disputes between users, sometimes even suspending people. It's really a testament to the SE system how little mods do as a percentage of overall moderation, but there are some things that simply require a moderator to perform. As a moderator, I believe I will perform these jobs in a rational, level-headed manner, that I will be willing to contemplate alternative viewpoints, and that I will maintain a high standard of excellence in everything that I do.&quot;&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2018-02-20T15:30:25.787" LastActivityDate="2018-02-20T15:30:25.787" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14777" PostTypeId="1" AcceptedAnswerId="14778" CreationDate="2018-02-06T06:45:11.933" Score="7" ViewCount="179" Body="&lt;p&gt;In a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14737/nominations-for-language-of-the-month/14754#comment53859_14737&quot;&gt;comment&lt;/a&gt; on the Language of the Month nominations thread, Peter Taylor raised a valid point:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;It might be worth prohibiting nominations of your own language. If a language is genuinely interesting, it should be possible to find someone else who's willing to advocate it; and if you can't find anyone else to advocate it, you're going to be a bottleneck to answering questions in chat etc.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;As of this writing, the comment has four upvotes, which indicates to me that several people think prohibiting self-nominations may be a good thing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, when I &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/42698411#42698411&quot;&gt;brought up the issue in chat&lt;/a&gt;, some people argued against such a ban:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I'm totally fine with allowing self-nominations. The whole point of voting is to filter out what's actually good.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Destructible Lemon made a salient point:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I'd like to comment that the thing was designed to help people raise awareness of their languages and stuff, not to have a language appreciation club or something&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So, what do you think? To self-nominate, or not to self-nominate?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;If we decide we don't want self-nominations, I propose that this rule apply only to &lt;em&gt;future&lt;/em&gt; nominations. Existing nominations should be allowed to stay.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="31716" LastEditDate="2018-02-06T18:45:31.047" LastActivityDate="2018-02-06T19:01:17.877" Title="Should we allow people to nominate their own language for Language of the Month?" Tags="|discussion|meta|language-of-the-month|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14778" PostTypeId="2" ParentId="14777" CreationDate="2018-02-06T07:32:49.713" Score="16" Body="&lt;h1&gt;Yes:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The intention of the language of the month was to generate interest in obscure languages made by ppcg users&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Whereas, many of us are the &lt;strong&gt;inventors&lt;/strong&gt; of said interesting languages, and would like to teach them to others, and&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;from the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14645/16766&quot;&gt;original proposal&lt;/a&gt; (emphasis mine)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we don't allow self nominations, it means that the (possibly high quality) languages that need help will all languish in author-only-use, which could be argued to be the very reason the language of the month was proposed, or why it was supported.&lt;/p&gt;&#xA;" OwnerUserId="55896" LastEditorUserId="16766" LastEditDate="2018-02-06T08:51:29.927" LastActivityDate="2018-02-06T08:51:29.927" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14780" PostTypeId="2" ParentId="14766" CreationDate="2018-02-06T15:12:46.070" Score="2" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;As such it is a &quot;fastest gun in the west challenge.&quot; I looked to see what the consensus was on Meta, and the most relevant post &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5585&quot;&gt;Are pure programming puzzles on topic?&lt;/a&gt; shows divided opinions on whether such challenges are off topic - in fact there is a slight leaning towards them being &lt;strong&gt;on&lt;/strong&gt; topic, though not the best choice of winning criterion.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;...&lt;/p&gt;&#xA;  &#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;Are those pure programming puzzles which take a significant amount of time to answer on topic?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This question is predicated on the challenge being a &quot;pure programming puzzle&quot;, but it isn't.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The linked question is not about whether FGitW questions are on topic, but whether puzzles are on topic. It quotes the tag wiki for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;blockquote&gt;&#xA;    &lt;p&gt;A programming puzzle includes a goal, a partially completed program, and rules outlining how the program can be modified. The program is specifically designed to make achieving the goal difficult. An answer to a programming puzzle takes the program and modifies it only in ways specified in the rules, so that the goal is achieved.&lt;/p&gt;&#xA;  &lt;/blockquote&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The Schläfi challenge is clearly not in this category, and so to use answers to that question to argue that the challenge is on-topic requires decontextualising them. The more relevant meta-question is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/908/194&quot;&gt;The Tag Categorisation Project&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Winning Criteria/Question Type&lt;/h1&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;Every&lt;/strong&gt; question should have at least one of these tags.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The Schläfi challenge does not have any of those tags, and nor could any of them be applied.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;TL;DR: the answer to question 1 is that this question &lt;em&gt;isn't&lt;/em&gt; a pure programming puzzle, and it &lt;em&gt;is&lt;/em&gt; off-topic.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-02-06T15:12:46.070" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14781" PostTypeId="2" ParentId="14777" CreationDate="2018-02-06T19:01:17.877" Score="11" Body="&lt;h1&gt;Also Yes:&lt;/h1&gt;&#xA;&lt;p&gt;Nothing wrong with the other answer, but I would like to propose an alternate change rather than no change.&lt;/p&gt;&#xA;&lt;p&gt;I think self-nomination is valid and well within the spirit of the event. The goal (seems to be) to get exposure to interesting but not-well-known languages, and having a proposal written by a person who (presumably) knows the language best and has the most interest in it seems like a valid way to showcase key features. I think at least part of the problem originated from a particular answer (which seems to have been deleted, so I won't name names) which featured a language which was essentially still in development.&lt;/p&gt;&#xA;&lt;p&gt;So, instead of considering &amp;quot;maybe the creator is biased and will nominate a bad language&amp;quot;, which has a lot of fallout, simply add two requirements:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The language should have a stable implementation available.&lt;/li&gt;&#xA;&lt;li&gt;The language should have useful documentation for said implementation.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The phrasing could probably use some more precision, but I think these rules should avoid problems of languages that change/replace/remove features, creating an unstable golfing environment, as well as having an alternate resource for answering questions than just the creator. If making these hard rules is too restrictive, I think they're at least good metrics for &lt;em&gt;evaluating&lt;/em&gt; proposals (e.g. &amp;quot;it's hard to pick up this language from just the documentation, so I don't think it's a good option&amp;quot;).&lt;/p&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-06T19:01:17.877" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14783" PostTypeId="1" AcceptedAnswerId="14784" CreationDate="2018-02-06T19:49:25.200" Score="2" ViewCount="109" Body="&lt;p&gt;Questions like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/155018/the-programming-language-quiz-mark-ii-cops&quot;&gt;this&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/155019/the-programming-language-quiz-mark-ii-robbers&quot;&gt;this&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/154741/cops-and-robbers-redacted-primality-cops-thread&quot;&gt;this&lt;/a&gt; are very fun, exciting, and bring a lot of participation to PP&amp;amp;CG. I thoroughly enjoy participating in them, as well as just reading through them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, I can't help think that answers to these questions would be much more fun, and much harder to crack, if they were &lt;strong&gt;temporarily&lt;/strong&gt; anonymous and it was unknown to the audience who the author of the answer was. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Many of these questions can be cracked by opening the users best answers and best questions and picking their top three languages they use. Typically, one of these will be the answer, drastically reducing the time it takes to crack these questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would it be possible to have a &quot;temporary anonymous&quot; answer for these type of questions? Where users could answer these questions without their name visible at first, until either, the code is cracked, the time runs out, or admins make it publicly visible for any feasible reason?&lt;/p&gt;&#xA;" OwnerUserId="76365" LastEditorUserId="68942" LastEditDate="2021-06-09T05:36:06.590" LastActivityDate="2021-06-09T05:36:06.590" Title="Can we create temporary anonymous answers for challenge type questions" Tags="|discussion|feature-request|status-declined|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="14784" PostTypeId="2" ParentId="14783" CreationDate="2018-02-06T20:40:07.950" Score="4" Body="&lt;p&gt;Hmm… let's &lt;em&gt;not&lt;/em&gt; give the community team a headache. This would be a good amount of effort on their part, and the only people in the entire network who would benefit would be a fairly small subset of an already relatively small site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We have some site-specific code to stop automatic protection of the sandbox, but that only requires changing this…&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;if (the post is a question AND it has lots of deleted answers) {&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;…to this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;if (the post is a question AND it has lots of deleted answers AND the post ID is not 2140) {&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In other words, one line of code.&lt;/p&gt;&#xA;" OwnerUserId="62402" LastActivityDate="2018-02-06T20:40:07.950" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14786" PostTypeId="2" ParentId="14766" CreationDate="2018-02-06T21:21:43.777" Score="2" Body="&lt;h1&gt;I have edited the winning criterion to Code Golf.&lt;/h1&gt;&#xA;&lt;p&gt;I left a comment for the OP but have had no response.&lt;/p&gt;&#xA;&lt;p&gt;As no other ideas have come to light, I have revised the winning criterion to code golf. I believe the question is now on topic and can be reopened.&lt;/p&gt;&#xA;&lt;p&gt;If people disagree with my actions it can be rolled back.&lt;/p&gt;&#xA;&lt;p&gt;I will refrain from saying any more in this answer, so that it can be voted on in terms of my actions, rather than my philosophy. I will edit my other answer with some more philosophical comments.&lt;/p&gt;&#xA;" OwnerUserId="15599" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-06T21:21:43.777" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14788" PostTypeId="1" CreationDate="2018-02-07T00:40:10.370" Score="4" ViewCount="141" Body="&lt;p&gt;EDIT: I simplified the challenge and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/14807#14807&quot;&gt;posted it&lt;/a&gt; in the sandbox. Summary: python2/python3 compatible judge script that works on a solution's output (instead of fork/exec-ing the solution); users are trusted not to cheat; arbitrary large file for input instead of randomness; no time limit; totalScore = gameScore - codeSize&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I'm thinking of designing a single-player game strategy challenge in which programs are fed lines on stdin, to which they respond on stdout. A program must respond to the current line before learning the next one. This is similar to how the popular &lt;a href=&quot;https://codegolf.stackexchange.com/questions/152856/write-moby-dick-approximately&quot;&gt;Moby Dick&lt;/a&gt; challenge works. Ideally, I would provide a judge program that forks the solution as a separate process, supplies the input and computes the score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What language should I use for an easy-to-run, fast, cross-platform judge? From the mainstream I speak Python (it may be too slow), C (but only on Linux), Java and JavaScript (for some users installing a JDK or Node may be too much bother). Or should I ask the users to rewrite the judge in their own language, perhaps as a separate challenge, and risk having many of them give up?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What would be a good scoring scheme that discourages excessive use of resources? I was thinking some linear combination of code size, timing (self-measured? hard limit?), and challenge-specific &quot;points&quot;. Would it be too rude to tweak a published formula and ask everyone to rejudge?&lt;/p&gt;&#xA;" OwnerUserId="24908" LastEditorUserId="24908" LastEditDate="2018-02-12T17:53:54.083" LastActivityDate="2018-02-12T17:53:54.083" Title="A challenge that comes with a judge program" Tags="|discussion|challenge-quality|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14789" PostTypeId="2" ParentId="14788" CreationDate="2018-02-07T02:12:02.810" Score="5" Body="&lt;p&gt;Python is a good choice. Writing cross-platform code takes very little work (basically just don't use stuff in the &lt;code&gt;os&lt;/code&gt; module), and it's really not all that slow. It will suit your needs just fine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, C is also a decent choice, so long as you write standard-conforming C (C11). The code should be portable as long as you're careful (don't assume things like word size or integer size - use the fixed-width types in the standard library).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2018-02-07T02:12:02.810" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="14800" PostTypeId="2" ParentId="2140" CreationDate="2018-02-09T21:21:17.173" Score="0" Body="&lt;h1&gt;Chiasmus Indenter&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Chiasmus is a &lt;a href=&quot;https://en.wikipedia.org/wiki/Chiasmus&quot; rel=&quot;nofollow noreferrer&quot;&gt;literary form&lt;/a&gt; that is similar to palindromes. Some ideas are presented and then presented again in reverse order, often phrased differently.&lt;/p&gt;&#xA;&lt;p&gt;Natural language processing is hard, so I'll be using a more computer-friendly definition. A chiasmic string is made up of a series of substrings that are repeated in reverse order in the second half of a string. Formally:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;code&gt;a&lt;/code&gt; is some non-empty string, then &lt;code&gt;aa&lt;/code&gt; is chiasmic.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;C&lt;/code&gt; is chiasmic and &lt;code&gt;a&lt;/code&gt; is some string, then &lt;code&gt;aCa&lt;/code&gt; is also chiasmic. Note that this applies recursively, thus &lt;code&gt;abCba&lt;/code&gt; is chiasmic if &lt;code&gt;C&lt;/code&gt; is also chiasmic and &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; are non-empty strings.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For example, &lt;code&gt;batbat&lt;/code&gt; is chiasmic, as are &lt;code&gt;glassbottlebottleglass&lt;/code&gt; and &lt;code&gt;AliceBobCharlieCharlieBobAlice&lt;/code&gt;. All even-length palindromes are chiasmic, being made up of many length-1 strings.&lt;/p&gt;&#xA;&lt;p&gt;Note that the empty string is not a chiasmus.&lt;/p&gt;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&lt;p&gt;We're programmers, so we like nice indentation. Your goal is to take chiasmic strings and indent them so that each matching substring is at the same level of indentation. For example, &lt;code&gt;cheesepizzawithanchoviesanchovieswithpizzacheese&lt;/code&gt; would be indented like so:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;cheese&#xA;    pizza&#xA;        with&#xA;            anchovies&#xA;            anchovies&#xA;        with&#xA;    pizza&#xA;cheese&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For base case chiasms (i.e. 2 repetitions of a string), no indentation is necessary, but the substrings should still be on separate lines. Thus, &lt;code&gt;gumgum&lt;/code&gt; would be indented:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;gum&#xA;gum&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In order for there to be only one canonical output for each chiasmus, if it is possible to indent at more than one place, indent in a way such that the &lt;code&gt;a&lt;/code&gt; substrings for the form &lt;code&gt;aCa&lt;/code&gt; are as long as possible (applied recursively for each &lt;code&gt;C&lt;/code&gt; until the &lt;code&gt;aa&lt;/code&gt; base case is reached). For example, &lt;code&gt;catdogcatdogdogcatdogcat&lt;/code&gt; should be indented like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;catdogcat&#xA;    dog&#xA;    dog&#xA;catdogcat&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Not like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;cat&#xA;    dog&#xA;        cat&#xA;            dog&#xA;            dog&#xA;        cat&#xA;    dog&#xA;cat&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Also not like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;cat&#xA;    dogcatdog&#xA;    dogcatdog&#xA;cat&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The behavior of indenting a non-chiasmus is undefined.&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Indentation can use any amount of whitespace of any kind, so long as it is consistent (e.g. do not mix tabs and spaces). Lines may either be output as a list/array/whatever or a newline-separated string.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that the input is a chiasmus that contains only alphanumeric characters.&lt;/li&gt;&#xA;&lt;li&gt;As this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the shortest submission wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-13T18:48:37.663" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="14801" PostTypeId="2" ParentId="2140" CreationDate="2018-02-09T21:50:56.117" Score="0" Body="&lt;h2&gt;Build a Brainfuck transpiler&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your job is to build a program that transpiles valid brainfuck to a language (not brainfuck!) of your choice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are not required to handle cases where the program is invalid (mismatched [ ]s), or contains characters that are not +-&amp;lt;&gt;[],. but all other cases must be handled.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Size limits on your input or output are fine as long as they are imposed by computer restrictions, like RAM.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The programming language you transpile &lt;em&gt;to&lt;/em&gt; is covered under the &quot;What defines a programming language&quot; rules, and must have been created before this challange.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In extension to not transpiling to brainfuck (cheater!) you can't use a brainfuck derivative or trival brainfuck substitution as the transpiled to language either.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Programs will be scored with the average ratio of bytes in the input brainfuck program to the output transpiled result, as based on the examples.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Meta questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a rough draft!&lt;br&gt;&#xA;What tags should be associated with this?&lt;br&gt;&#xA;How can I improve the scoring system?&lt;br&gt;&#xA;What examples should I use to keep the scoring fair, but prevent obvious tricks?&lt;br&gt;&#xA;What loopholes are there in this rough draft that I need to patch?  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This entire thing will be reorganized when I get enough info to make a better writeup. &lt;/p&gt;&#xA;" OwnerUserId="77964" LastActivityDate="2018-02-09T21:50:56.117" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14803" PostTypeId="2" ParentId="14788" CreationDate="2018-02-11T04:16:56.883" Score="0" Body="&lt;p&gt;For the language I recommend Python, for similar reasons to what Mego says.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For discouraging excessive use of resources, I would recommend to consider why you want to do this. Are you planning to verify all the answers yourself? (That would be a lot of work, and I would recommend trusting people instead - the community can usually spot if someone is trying to cheat, and it happens rarely in any case.) Or are restrictions on resource use an inherent part of the challenge?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If neither of these is the case, I would recommend not trying to restrict it. If someone is willing to put tons of resources into something then just let them - it could lead to an interesting answer. (See, for example, &lt;a href=&quot;https://codegolf.stackexchange.com/a/149835/21034&quot;&gt;Anders Kaseorg's answer&lt;/a&gt; to Paint Starry Night. He built a GPU machine specifically for the challenge and it led to a really interesting answer.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If limitations on resource use are an inherent part of the challenge, I recommend sticking to code size as the only limited resource. It's a fun constraint to satisfy, it's easy to verify, and it's the kind of challenge people on this site like. You can do this by limiting the size of the code (as per the Starry Night challenge) or just by including code length in the score (as per Write Moby Dick, or just about any Code Golf challenge). &lt;/p&gt;&#xA;" OwnerUserId="21034" LastActivityDate="2018-02-11T04:16:56.883" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14804" PostTypeId="2" ParentId="2140" CreationDate="2018-02-11T15:40:18.650" Score="1" Body="&lt;h1&gt;Convert Arabic Numbers to Chinese Numbers &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;There EXISTS a similar question, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/97734/convert-chinese-numbers&quot;&gt;&quot;Convert Chinese numbers&quot;&lt;/a&gt;, but the question itself differs from that question by:&lt;/strong&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;That question asks for a shortest code converting Chinese numbers to Arabic numbers, but this asks for a shortest code converting in the opposite direction.&lt;/li&gt;&#xA;  &lt;li&gt;That question limits the range of &lt;code&gt;1 &amp;lt;= N &amp;lt; 10^3&lt;/code&gt;, but this has the range far larger than that -- &lt;code&gt;1 &amp;lt;= N &amp;lt; 10^8192&lt;/code&gt;.&lt;/li&gt;&#xA;  &lt;li&gt;Due to the range of that question, that question only considers one type of representation on Chinese numbers, but this considers four -- the commonly used &lt;em&gt;Wan Jin&lt;/em&gt; (萬進) and other ancient systems. These terms will be explained in the introduction part.&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;There EXISTS another similar question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/155995/convert-a-number-to-korean&quot;&gt;&quot;Convert a number to Korean&quot;&lt;/a&gt;, but there is essential difference because Korean number only uses &lt;em&gt;Wan Jin&lt;/em&gt;, always omits &quot;一(일)&quot;s before &quot;十(십)&quot;s, &quot;百(백)&quot;s and &quot;千(천)&quot;s and all &quot;零&quot;s between digits, and so does Japanese.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;I have edited the challenge description so that the rules are now outlining the process of conversion. Although this will be clearer in illustrating the rules, will this be restricting the choice of algorithms?&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Chinese numbers, literally, is the number still in use in societies which uses Chinese characters. Although Arabic numbers are also in use nowadays, Chinese numbers still have an important role. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The system Chinese people in Taiwan are using is called &lt;em&gt;Wan Jin&lt;/em&gt; (萬進), which names &lt;code&gt;1,000,000,000,000&lt;/code&gt; (1 trillion) as &lt;em&gt;Yi Zhao&lt;/em&gt; (一兆). However, according to &lt;em&gt;Wu Jing Suan Shu&lt;/em&gt; (五經算術) ,in the history there existed 3 different kinds of such large-number representations. The reference says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;按黃帝為法，數有十等。及其用也，乃有三焉。十等者，謂「億、兆、京、垓、秭、壤、溝、澗、正、載」也。三等者，謂「上、中、下」也。其下數者，十十變之。若言十萬曰億，十億曰兆，十兆曰京也。中數者，萬萬變之。若言萬萬曰億，萬萬億曰兆，萬萬兆曰京也。上數者，數窮則變。若言萬萬曰億，億億曰兆、兆兆曰京也。&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;(Translation) According to Huang Di, there are 10 &quot;ranks&quot; of numbers. Regarding the usages, there are three. The 10 ranks are called &lt;em&gt;Y&amp;igrave;&lt;/em&gt; (億), &lt;em&gt;Zh&amp;agrave;o&lt;/em&gt; (兆), &lt;em&gt;J&amp;#299;ng&lt;/em&gt; (京), &lt;em&gt;G&amp;#257;i&lt;/em&gt; (垓), &lt;em&gt;Z&amp;#464;&lt;/em&gt; (秭), &lt;em&gt;R&amp;aacute;ng&lt;/em&gt; (穰), &lt;em&gt;G&amp;#333;u&lt;/em&gt; (溝), &lt;em&gt;Ji&amp;agrave;n&lt;/em&gt; (澗), &lt;em&gt;Zh&amp;egrave;ng&lt;/em&gt; (正), &lt;em&gt;Z&amp;agrave;i&lt;/em&gt; (載). The three usages are called &quot;Upper&quot;, &quot;Middle&quot; and &quot;Lower&quot;. For the &quot;Lower&quot;, the rank changes if multiplied by 10. We call 10 &lt;em&gt;W&amp;agrave;n&lt;/em&gt; as &lt;em&gt;Y&amp;igrave;&lt;/em&gt;, 10 &lt;em&gt;Y&amp;igrave;&lt;/em&gt; as &lt;em&gt;Zh&amp;agrave;o&lt;/em&gt;, and 10 &lt;em&gt;Zh&amp;agrave;o&lt;/em&gt; as &lt;em&gt;J&amp;#299;ng&lt;/em&gt;. For the &quot;Middle&quot;, the rank changes if multiplied by 100,000,000. We call 100,000,000 &lt;em&gt;W&amp;agrave;n&lt;/em&gt; as &lt;em&gt;Y&amp;igrave;&lt;/em&gt;, 100,000,000 &lt;em&gt;Y&amp;igrave;&lt;/em&gt; as &lt;em&gt;Zh&amp;agrave;o&lt;/em&gt;, and 100,000,000 &lt;em&gt;Zh&amp;agrave;o&lt;/em&gt; as &lt;em&gt;J&amp;#299;ng&lt;/em&gt;. And for the &quot;Upper&quot;, the rank changes if the rank exhausts its numbers. We call 1 &lt;em&gt;W&amp;agrave;n&lt;/em&gt; &lt;em&gt;W&amp;agrave;n&lt;/em&gt; as &lt;em&gt;Y&amp;igrave;&lt;/em&gt;, 1 &lt;em&gt;Y&amp;igrave;&lt;/em&gt; &lt;em&gt;Y&amp;igrave;&lt;/em&gt; as &lt;em&gt;Zh&amp;agrave;o&lt;/em&gt;, and 1 &lt;em&gt;Zh&amp;agrave;o&lt;/em&gt; &lt;em&gt;Zh&amp;agrave;o&lt;/em&gt; as &lt;em&gt;J&amp;#299;ng&lt;/em&gt;. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;To sum up, we have 4 systems which is, or was in use in Chinese history:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Xia Shu&lt;/em&gt; (下數): Starting from &lt;em&gt;wan&lt;/em&gt; (萬, &lt;code&gt;10,000&lt;/code&gt;), the rank changes by multipling by 10. 10 &lt;em&gt;wan&lt;/em&gt; is called &lt;em&gt;yi&lt;/em&gt; (億, &lt;code&gt;100,000&lt;/code&gt;), 10 &lt;em&gt;yi&lt;/em&gt; is called &lt;em&gt;zhao&lt;/em&gt; (兆, &lt;code&gt;1,000,000&lt;/code&gt;), 10 &lt;em&gt;zhao&lt;/em&gt; is called &lt;em&gt;jing&lt;/em&gt; (京, &lt;code&gt;10,000,000&lt;/code&gt;), etc.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Zhong Shu&lt;/em&gt; (中數): Starting from &lt;em&gt;wan&lt;/em&gt; (萬, &lt;code&gt;10,000&lt;/code&gt;), the rank changes by multipling by 10&lt;sup&gt;8&lt;/sup&gt;, with the exception of &lt;em&gt;yi&lt;/em&gt;, which represents &lt;code&gt;10^8&lt;/code&gt;. 10,000 &lt;em&gt;wan&lt;/em&gt; is called &lt;em&gt;yi&lt;/em&gt; (億, &lt;code&gt;10^8&lt;/code&gt;), 10&lt;sup&gt;8&lt;/sup&gt; &lt;em&gt;yi&lt;/em&gt; is called &lt;em&gt;zhao&lt;/em&gt; (兆, &lt;code&gt;10^16&lt;/code&gt;), 10&lt;sup&gt;8&lt;/sup&gt; &lt;em&gt;zhao&lt;/em&gt; is called &lt;em&gt;jing&lt;/em&gt; (京, &lt;code&gt;10^24&lt;/code&gt;), etc.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Shang Shu&lt;/em&gt; (上數): Starting from &lt;em&gt;wan&lt;/em&gt; (萬, &lt;code&gt;10,000&lt;/code&gt;), the rank changes by squaring. 10,000 &lt;em&gt;wan&lt;/em&gt; is called &lt;em&gt;yi&lt;/em&gt; (億, &lt;code&gt;10^8&lt;/code&gt;), 10&lt;sup&gt;8&lt;/sup&gt; &lt;em&gt;yi&lt;/em&gt; is called &lt;em&gt;zhao&lt;/em&gt; (兆, &lt;code&gt;10^16&lt;/code&gt;), 10&lt;sup&gt;16&lt;/sup&gt; &lt;em&gt;zhao&lt;/em&gt; is called &lt;em&gt;jing&lt;/em&gt; (京, &lt;code&gt;10^32&lt;/code&gt;), etc.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Wan Jin&lt;/em&gt; (萬進): Starting from &lt;em&gt;wan&lt;/em&gt; (萬, &lt;code&gt;10,000&lt;/code&gt;), the rank changes by multipling by 10,000. 10,000 &lt;em&gt;wan&lt;/em&gt; is called &lt;em&gt;yi&lt;/em&gt; (億, &lt;code&gt;10^8&lt;/code&gt;), 10,000 &lt;em&gt;yi&lt;/em&gt; is called &lt;em&gt;zhao&lt;/em&gt; (兆, &lt;code&gt;10^12&lt;/code&gt;), 10,000 &lt;em&gt;zhao&lt;/em&gt; is called &lt;em&gt;jing&lt;/em&gt; (京, &lt;code&gt;10^16&lt;/code&gt;), etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Table 1: Rank markers in Chinese numbers&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; Name    Wan Jin      Xia Shu      Zhong Shu   Shang Shu&#xA;(十               commonly representing 10^1            )&#xA;(百               commonly representing 10^2            )&#xA;(千               commonly representing 10^3            )&#xA;(萬               commonly representing 10^4            )&#xA; 億      10^8         10^5         10^8        10^8&#xA; 兆      10^12        10^6         10^16       10^16&#xA; 京      10^16        10^7         10^24       10^32&#xA; 垓      10^20        10^8         10^32       10^64&#xA; 秭      10^24        10^9         10^40       10^128&#xA; 穰      10^28        10^10        10^48       10^256&#xA; 溝      10^32        10^11        10^56       10^512&#xA; 澗      10^36        10^12        10^64       10^1024&#xA; 正      10^40        10^13        10^72       10^2048&#xA; 載      10^44        10^14        10^80       10^4096&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For numbers smaller than 10, this works as &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;零:0 一:1 二:2 三:3 四:4 五:5 六:6 七:7 八:8 九:9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you are required to write the shortest code, accepting two inputs: the number N, and a number S indicating the system used, converts N into the corresponding Chinese representation according to the given system, and output the representation. Here are some basic rules about converting Chinese numbers:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;For numbers less than 10,000 and &lt;em&gt;Xia Shu&lt;/em&gt; numbers:&lt;/p&gt;&#xA;  &#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;Append position markers digit by digit first.&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;code&gt;1234 =&amp;gt; 一千二百三十四&lt;/code&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;1234567 =&amp;gt; 一兆二億三萬四千五百六十七&lt;/code&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&lt;/li&gt;&#xA;  &lt;li&gt;Strip away all position markers prepended by &quot;零&quot;, coalesce all consecutive &quot;零&quot;s into a single &quot;零&quot;, and remove the leading/trailing &quot;零&quot;s.&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;code&gt;5 =&amp;gt; 五&lt;/code&gt;, &lt;code&gt;25 =&amp;gt; 二十五&lt;/code&gt;, &lt;code&gt;125 =&amp;gt; 一百二十五&lt;/code&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;20 =&amp;gt; 二十&lt;/code&gt;, &lt;code&gt;100 =&amp;gt; 一百&lt;/code&gt;, &lt;code&gt;5000 =&amp;gt; 五千&lt;/code&gt;.&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;1001 =&amp;gt; 一千零一&lt;/code&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;  &#xA;  &lt;p&gt;For &lt;em&gt;Wan Jin&lt;/em&gt; numbers: &lt;/p&gt;&#xA;  &#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;Divide the digits into subgroups of at most 4 digits each from the right.&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;code&gt;12345678900004321 =&amp;gt; 1'2345'6789'0000'4321&lt;/code&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&lt;/li&gt;&#xA;  &lt;li&gt;Apply to each subgroup the conversion for numbers less than 10,000 (as above), and append each subgroup with the corresponding rank markers. If there is any &quot;0&quot; at the subgroup boundary, append &quot;零&quot; after the rank marker.&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;code&gt;1'2345'6789'0000'4321 =&amp;gt; (一)京(二千三百四十五)兆(六千七百八十九)億零(零)萬零(四千三百二十一)&lt;/code&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&lt;/li&gt;&#xA;  &lt;li&gt;Discard the subgroups with &quot;零&quot;, together with their rank markers, and remove redundant &quot;零&quot;s.&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;code&gt;(一)京(二千三百四十五)兆(六千七百八十九)億零(零)萬零(四千三百二十一) =&amp;gt; 一京二千三百四十五兆六千七百八十九億零四千三百二十一&lt;/code&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;  &#xA;  &lt;p&gt;For &lt;em&gt;Zhong Shu&lt;/em&gt; numbers:&lt;/p&gt;&#xA;  &#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;Divide the digits into subgroups of at most 8 digits each from the right.&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;code&gt;12345678900004321 =&amp;gt; 1&quot;23456789&quot;00004321&lt;/code&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&lt;/li&gt;&#xA;  &lt;li&gt;Apply to each subgroup the conversion for &lt;em&gt;Wan Jin&lt;/em&gt; numbers (as above), and append each subgroup with the corresponding rank markers. If there is any &quot;0&quot; at the subgroup boundary, append &quot;零&quot; after the rank marker.&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;code&gt;1&quot;23456789&quot;00004321 =&amp;gt; (一)兆(二千三百四十五萬六千七百八十九)億零(四千三百二十一)&lt;/code&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&lt;/li&gt;&#xA;  &lt;li&gt;Discard the subgroups with &quot;零&quot;, together with their rank markers, and remove redundant &quot;零&quot;s.&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;code&gt;(一)兆(二千三百四十五萬六千七百八十九)億零(四千三百二十一) =&amp;gt; 一兆二千三百四十五萬六千七百八十九億零四千三百二十一&lt;/code&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;  &#xA;  &lt;p&gt;For &lt;em&gt;Shang Shu&lt;/em&gt; numbers:&lt;/p&gt;&#xA;  &#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;Divide the digits into 2 subgroups: the least significant one with number of digits equals to the least power of 2 not less than half of the original length, and the most significant one with the remaining digits.&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;code&gt;123456789012345678901234567890 =&amp;gt; (12345678901234)(5678901234567890)&lt;/code&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&lt;/li&gt;&#xA;  &lt;li&gt;Append the most significant subgroup with the corresponding rank marker. If there is any &quot;0&quot; at the subgroup boundary, append &quot;零&quot; after the rank marker.&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;code&gt;(12345678901234)(5678901234567890) =&amp;gt; 12345678901234兆5678901234567890&lt;/code&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&lt;/li&gt;&#xA;  &lt;li&gt;Discard the subgroups with &quot;零&quot;, together with their rank markers&lt;/li&gt;&#xA;  &lt;li&gt;Recursively apply all steps to each subgroup with a lower rank marker, until the number of digits in a subgroup is less than 4, which then apply the conversion for numbers less than 10,000 (as above).&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;code&gt;12345678901234兆5678901234567890 =&amp;gt; 123456億78901234兆56789012億34567890 =&amp;gt; 12萬3456億7890萬零1234兆5678萬9012億3456萬7890 =&amp;gt; 十二萬三千四百五十六億七千八百九十萬零一千二百三十四兆五千六百七十八萬九千零一十二億三千四百五十六萬七千八百九十&lt;/code&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;  &#xA;  &lt;p&gt;And at last...&lt;/p&gt;&#xA;  &#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;If &quot;一十&quot; is at the beginning, remove the &quot;一&quot;.&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;code&gt;15 =&amp;gt; 十五&lt;/code&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;114514 =&amp;gt; 十一萬四千五百一十四&lt;/code&gt;, &lt;code&gt;10011 =&amp;gt; 一萬零一十一&lt;/code&gt;.&lt;/li&gt;&#xA;  &lt;/ul&gt;&lt;/li&gt;&#xA;  &lt;li&gt;Remove redundant &quot;零&quot;s, and if an empty string occurs, return with &quot;零&quot;.&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;For more details, the reference implementation in JSFiddle gives the reference code.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Requirements&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your code must be a full program or a function. Defining helper functions are allowed. Snippets are not allowed.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are not allowed by default.&lt;/li&gt;&#xA;&lt;li&gt;You can use any methods of I/O that are considered &quot;standard&quot; by PPCG community.&lt;/li&gt;&#xA;&lt;li&gt;You must receive 2 inputs, one number N, and one number S. You can pass the inputs as strings or as integers. Please indicate your choice.&lt;/li&gt;&#xA;&lt;li&gt;You may assume the input is always valid, i.e. &lt;code&gt;S in [0, 1, 2, 3]&lt;/code&gt; and &lt;code&gt;N&lt;/code&gt; is within the corresponding range:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Table 2: Number systems and their representable number range&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;S (System)       N (Number Range)&#xA;0 (Wan Jin)      1 &amp;lt;= N &amp;lt; 1E+48&#xA;1 (Xia Shu)      1 &amp;lt;= N &amp;lt; 1E+15&#xA;2 (Zhong Shu)    1 &amp;lt;= N &amp;lt; 1E+88&#xA;3 (Shang Shu)    1 &amp;lt;= N &amp;lt; 1E+8192&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In case Unicode is not supported by the interpreter and/or the language, or for any reasons, you may use one of the two Chinese Pinyins in place of the corresponding Chinese characters as output as follows. Your choice must be consistent over all outputs. One space must be added between the pinyins of 2 characters. You must indicate if you choose to do so.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Table 3: The Chinese characters and their pinyin representations&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Character  Pinyin              Character  Pinyin&#xA;一         yī or yi1           二         èr or er4&#xA;三         sān or san3         四         sì or si4&#xA;五         wǔ or wu3           六         liù or liu4&#xA;七         qī or qi1           八         bā or ba1&#xA;九         jiǔ or jiu3         十         shí or shi2&#xA;百         bǎi or bai3         千         qiān or qian1&#xA;萬         wàn or wan4         億         yì or yi4&#xA;兆         zhào or zhao4       京         jīng or jing1&#xA;垓         gāi or gai1         秭         zǐ or zi3&#xA;穰         ráng or rang2       溝         gōu or gou1&#xA;澗         jiàn or jian4       正         zhèng or zheng4&#xA;載         zài or zai4         零         líng or ling2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Example I/O (Only the first Pinyin format is displayed)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In these examples, I use &lt;code&gt;' =&amp;gt; 萬, &quot; =&amp;gt; 億, (...) =&amp;gt; 兆, [...] =&amp;gt; 京, {...} =&amp;gt; 垓, &amp;lt;...&amp;gt; =&amp;gt; 秭&lt;/code&gt; in the grouping for clarity. The grouping is only for illustration, and you do not need to print the groupings.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:    18446744073709551616 0&#xA;Grouping: [1844](6744)0737&quot;0955'1616&#xA;Output:   一千八百四十四京六千七百四十四兆零七百三十七億零九百五十五萬一千六百一十六&#xA;    or    yī qiān bā bǎi sì shí sì jīng liù qiān qī bǎi sì shí sì zhào líng qī bǎi sān shí qī yì líng jiǔ bǎi wǔ shí wǔ wàn yī qiān liù bǎi yī shí liù&#xA;&#xA;Input:    1234567890 1&#xA;Grouping: &amp;lt;1&amp;gt;{2}[3](4)5&quot;6'7890&#xA;Output:   一秭二垓三京四兆五億六萬七千八百九十&#xA;    or    yī zǐ èr gāi sān jīng sì zhào wǔ yì liù wàn qī qiān bā bǎi jiǔ shí&#xA;&#xA;Input:    1267650600228229401496703205376 2&#xA;Grouping: [126'7650](6002'2822)9401'4967&quot;0320'5376&#xA;Output:   一百二十六萬七千六百五十京零六千零二萬二千八百二十二兆九千四百零一萬四千九百六十七億零三百二十萬零五千三百七十六&#xA;    or    yī bǎi èr shí liù wàn qī qiān liù bǎi wǔ shí jīng líng liù qiān líng èr  wàn èr qiān bā bǎi èr shí èr zhào jiǔ qiān sì bǎi líng yī wàn sì qiān jiǔ bǎi liù shí qī yì líng sān bǎi èr shí wàn líng wǔ qiān sān bǎi qī shí liù&#xA;&#xA;Input:    8749002899132047697490008908470485461412677723572849745703082425639811996797503692894052708092215296 3&#xA;Grouping: {[8749](0028'9913&quot;2047'6974)9000'8908&quot;4704'8546}[(1412'6777&quot;2357'2849)7457'0308&quot;2425'6398](1199'6797&quot;5036'9289)4052'7080&quot;9221'5296&#xA;Output  : 八千七百四十九京零二十八萬九千九百一十三億二千零四十七萬六千九百七十四兆九千萬零八千九百零八億四千七百零四萬八千五百四十六垓一千四百一十二萬六千七百七十七億二千三百五十七萬二千八百四十九兆七千四百五十七萬零三百零八億二千四百二十五萬六千三百九十八京一千一百九十九萬六千七百九十七億五千零三十六萬九千二百八十九兆四千零五十二萬七千零八十億零九千二百二十一萬五千二百九十六&#xA;    or    bā qiān qī bǎi sì shí jiǔ jīng líng èr shí bā wàn jiǔ qiān jiǔ bǎi yī shí sān yì èr qiān líng sì shí qī wàn liù qiān jiǔ bǎi qī shí sì zhào jiǔ qiān wàn líng bā qiān jiǔ bǎi líng bā yì sì qiān qī bǎi líng sì wàn bā qiān wǔ bǎi sì shí liù gāi yī qiān sì bǎi yī shí èr wàn liù qiān qī bǎi qī shí qī yì èr qiān sān bǎi wǔ shí qī wàn èr qiān bā bǎi sì shí jiǔ zhào qī qiān sì bǎi wǔ shí qī wàn líng sān bǎi líng bā yì èr qiān sì bǎi èr shí wǔ wàn liù qiān sān bǎi jiǔ shí bā jīng yī qiān yī bǎi jiǔ shí jiǔ wàn liù qiān qī bǎi jiǔ shí qī yì wǔ qiān líng sān shí liù wàn jiǔ qiān èr bǎi bā shí jiǔ zhào sì qiān líng wǔ shí èr wàn qī qiān líng bā shí yì líng jiǔ qiān èr bǎi èr shí yī wàn wǔ qiān èr bǎi jiǔ shí liù&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://jsfiddle.net/kaoqr3ma/2/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here is a reference implementation in JS, not golfed at all&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winning Criteria&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As this is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code measuring in bytes wins. Accented Latin alphabets and Chinese characters must be measured in UTF-8 unless they are included in the SBCS of the language and can be used in the string literals.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Reference&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://zh.wikipedia.org/wiki/%E4%B8%AD%E6%96%87%E6%95%B0%E5%AD%97#%E5%A4%A7%E6%95%B8%E7%B3%BB%E7%B5%B1&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia - 中文數字&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="71546" LastEditorUserId="71546" LastEditDate="2018-02-26T04:09:30.177" LastActivityDate="2018-02-26T04:09:30.177" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="14808" PostTypeId="1" CreationDate="2018-02-12T20:03:28.207" Score="48" ViewCount="287" Body="&lt;p&gt;I just got a notification telling me to vote in the election.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When following the link however, I'm redirected to &lt;a href=&quot;https://codegolf.stackexchange.com/error?aspxerrorpath=/election&quot;&gt;here&lt;/a&gt; (an error page). Presumably, this is supposed to be the election page.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;It seems to be fixed now.&lt;/p&gt;&#xA;" OwnerUserId="31224" LastEditorUserId="12012" LastEditDate="2018-02-13T17:30:21.977" LastActivityDate="2018-02-13T17:34:05.957" Title="Election page is broken" Tags="|bug|status-completed|election|notifications|" AnswerCount="0" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="14810" PostTypeId="2" ParentId="6918" CreationDate="2018-02-13T10:55:03.073" Score="4" Body="&lt;h1&gt;Wumpus&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Wumpus was created by me in February 2018. The language's history is actually much longer though. Back when I created Hexagony (in September 2015), I noticed that there aren't any 2D languages for either hexagonal &lt;em&gt;or&lt;/em&gt; triangular grids, and ended up picking hexagons at the time. But from the beginning I intended to fill both of those gaps.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But after I designed Hexagony, the ideas for a triangular language went through many stages, some or and some less ambitious and kept putting off actually getting to work on it. Originally, I came up with the idea of calling the language &lt;em&gt;Triptych&lt;/em&gt; and making it consist of three separate triangle-based structures and three separate programs (a bit like Brian &amp;amp; Chuck on steroids). At any given time, one of the three programs would be running, with the corresponding structure acting as the code, and the two other structures acting as data, and each program could pass control off to the other structures. And each of those three programs was supposed to be running a different programming paradigm. But then the design for one of those three spiralled a bit out of control, and I decided to turn it into its own language – that one is still on the backlog, because it's a fairly ambitious idea. But the other two were the triangular grid and the icosahedron.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After removing one of the three subprograms, I decided to drop the idea of having multiple programs with different paradigms and settled on making this a more traditional Fungeoid on a triangular grid but using the icosahedron as a data structure. After Hexagony, I didn't want to force this kind of mind bending memory model onto the programmer, so I also gave the language a stack and made it the primary data structure (the icosahedron acts as 20 registers, which are largely optional, but can make some things more convenient if you do figure out their topology).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So that's what I ended up with: (what I believe is) the first ever 2D programming language on a triangular grid, taking many inspirations from existing Fungeoids, but adding the icosahedron as its own interesting twist. There's also two other features regarding control flow, which are comparably rare among 2D languages: the boundaries of the grid don't wrap around (or terminate the program), but instead the IP reflects off them. I had already used this idea for Alice's Ordinal mode, but it was part of Wumpus's design long before I thought of Alice. The other feature is a strafing move, which lets you move the IP orthogonally to its current direction, to sidestep onto the next or previous line. The way this interacts with the triangular grid is quite interesting, I think.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, the name is a reference to the classic game &lt;a href=&quot;https://en.wikipedia.org/wiki/Hunt_the_Wumpus&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hunt the Wumpus&lt;/a&gt;, which uses an icosahedral map for its dungeon. The game is also a significant part of Fungeoid history.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a side note, this is the first language since Labyrinth and Hexagony (my first two) which I managed to implement in just two days. Of course, with the idea having brewed for over two years it's not quite the same (those two went from idea to finished implementation in two or three days), but after the lengthy design processes of my recent languages, this honestly felt quite good.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/m-ender/wumpus&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;GitHub repository&lt;/strong&gt;&lt;/a&gt;. Includes language specification, reference implementation (Ruby), example programs and issue tracker.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#wumpus&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Try it online!&lt;/strong&gt;&lt;/a&gt; (by &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;) backed by the Ruby interpreter.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://esolangs.org/wiki/Wumpus&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Esolangs page&lt;/strong&gt;&lt;/a&gt;, essentially a mirror of the README on GitHub.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/155641/8478&quot;&gt;&lt;strong&gt;&lt;em&gt;Hunt the Wumpus&lt;/em&gt; in Wumpus&lt;/strong&gt;&lt;/a&gt; because I had to.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2018-02-13T10:55:03.073" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14813" PostTypeId="2" ParentId="2140" CreationDate="2018-02-13T17:56:06.453" Score="-3" Body="&lt;h2&gt;Ultimate crackpot&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In minimum number of ASCII bytes, write a plain text &quot;physics research article&quot; in English that scores each item in &lt;a href=&quot;http://math.ucr.edu/home/baez/crackpot.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Crackpot Index&lt;/a&gt; at least once.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;I'm not sure if such thing is on-topic here or on the Puzzling.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="7773" LastActivityDate="2018-02-13T17:56:06.453" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14814" PostTypeId="1" CreationDate="2018-02-13T18:25:34.800" Score="16" ViewCount="224" Body="&lt;p&gt;People seem to know that active chat bots are &lt;a href=&quot;https://www.youtube.com/watch?v=PjrlW8EryZ4&quot; rel=&quot;nofollow noreferrer&quot;&gt;prohibited&lt;/a&gt; in TNB, but I don't see that written &lt;a href=&quot;https://ppcg.github.io/chatiquette/&quot; rel=&quot;nofollow noreferrer&quot;&gt;anywhere&lt;/a&gt;. Is this indeed so?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And if so, are pure listening bots that never speak also prohibited? These could be useful for custom notification.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2018-02-13T19:09:47.183" Title="Are bots allowed in The Nineteenth Byte?" Tags="|discussion|policy|rules|chat|users|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14815" PostTypeId="2" ParentId="14814" CreationDate="2018-02-13T19:09:47.183" Score="18" Body="&lt;p&gt;Chat bots (that post messages) have no place in TNB. Since TNB is for discussion of code-golf and PPCG related topics, having bots in the room would be distracting and obnoxious, and would overtake more important conversations. The reason that this is not officially mentioned in the chatiquette is because this isn't a frequent or reoccurring issue. You could try &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12220/31716&quot;&gt;posting an answer here&lt;/a&gt; if you think this warrants being added to the official TNB guidelines.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, bots can be super helpful and useful at times. So if you have a bot and you would like to run it in a chat room, that's perfectly fine as long as it goes in the appropriate room. Testing the bot should go &lt;a href=&quot;https://chat.stackexchange.com/rooms/1/sandbox&quot;&gt;in the sandbox&lt;/a&gt;, and once the bot works correctly, it should go in it's own new room or in an existing room with the permission of that room's owner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bots that don't post any messages are an exception. If they are only listening to the ongoing conversation, they can't derail the conversation or annoy users, so there is no harm from having them in TNB. Of course, while testing that the bot is functioning correctly, this should also go in the sandbox.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2018-02-13T19:09:47.183" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14818" PostTypeId="2" ParentId="2140" CreationDate="2018-02-14T10:35:15.797" Score="0" Body="&lt;h2&gt;Self-removing executable (retracted: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/19355/a-program-that-deletes-itself&quot;&gt;dupe&lt;/a&gt;)&lt;/h2&gt;&#xA;" OwnerUserId="7773" LastEditorUserId="7773" LastEditDate="2018-02-14T14:04:02.963" LastActivityDate="2018-02-14T14:04:02.963" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14819" PostTypeId="1" CreationDate="2018-02-14T14:30:45.927" Score="12" ViewCount="167" Body="&lt;p&gt;The challenge in question is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/6884/solve-the-15-puzzle-the-tile-sliding-puzzle&quot;&gt;this one&lt;/a&gt;, which is solving a couple 4x4 sliding puzzles (also known as 15 puzzle) with the least amount of moves in a certain time limit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I posted an answer that computes optimal answers within the time limit, essentially ending the challenge. Such an answer is not possible in 5x5 puzzles and higher. And especially in large puzzles, e.g. 8x8 or 10x10 you need techniques that are approximations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since the challenge is 5+ years old, is essentially closed, and has an interesting extension into bigger sizes, would it be allowed to repost the challenge for those bigger sizes?&lt;/p&gt;&#xA;" OwnerUserId="4162" LastEditorUserId="66833" LastEditDate="2021-05-12T16:51:29.353" LastActivityDate="2021-05-12T16:51:29.353" Title="Can I repost a challenge with different difficulty parameters?" Tags="|discussion|duplicates|reposting|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14820" PostTypeId="2" ParentId="2140" CreationDate="2018-02-14T17:15:47.557" Score="2" Body="&lt;h1&gt;Busier Beaver &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/busy-beaver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;busy-beaver&amp;#39;&quot; rel=&quot;tag&quot;&gt;busy-beaver&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Cops&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You will write two programs in a language of your choice&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A public program: This program must execute in a finite amount of time. So it can not go on indefinitely (although there is no time limit). It also wise if you program it to output a large number of bytes to standard output. This is the what you post in your answer. You must also post the programming language.&lt;/li&gt;&#xA;&lt;li&gt;A secret program: This program must output &lt;em&gt;more&lt;/em&gt; bytes than the public answer, i.e. it is a busier beaver. It also must not go on indefinitely. It also can not be longer than the public program. You &lt;em&gt;do not&lt;/em&gt; post it the answer immediately. After one week, if no robber has cracked the answer, you edit it in.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For these programs, you may assume that numerics types are actually unbounded, i.e. that overflow never occurs. This means that you can store, for example, Graham's number in a variable. It also means that finding the maximum value of storage capacity of a numeric type results in an error.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If no robber has cracked your answer, your score is equal to (length of public program)/(length of secret program), which you are trying to maximize. In case of ties, the longer public program wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Robbers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The cops will post a public program. Your job is to find a busier beaver. That is, you need to find a program that outputs more bytes to standard output than the cops program. It can not go on indefinitely, and can not be longer than the public program (although it can be the same length).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You get points equal to (length of cops public program)/(length of your program) for each post you crack.&lt;/p&gt;&#xA;" OwnerUserId="16842" LastActivityDate="2018-02-14T17:15:47.557" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14825" PostTypeId="2" ParentId="14819" CreationDate="2018-02-15T04:47:29.687" Score="12" Body="&lt;h2&gt;This should be allowed&lt;/h2&gt;&#xA;&lt;p&gt;4x4 puzzles have known optimal algorithms. Only rough bounds are known for 5x5, and only weak upper bounds are known up to 10x10. Including 5x5 and larger completely changes the challenge from &amp;quot;optimize the known optimal algorithm for time&amp;quot; to &amp;quot;come up with an algorithm that performs well in moves and time&amp;quot;. I'd definitely consider those two to be different challenges.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-15T04:47:29.687" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14828" PostTypeId="1" AcceptedAnswerId="14829" CreationDate="2018-02-15T17:35:50.560" Score="2" ViewCount="99" Body="&lt;p&gt;I am planning on running a KoTH where each bot individually plays a game, it is a 1 player game so they don't fight each other. Is it still a KoTH or should I do it as a code-challenge?&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastEditorUserId="31716" LastEditDate="2018-02-15T18:08:33.017" LastActivityDate="2018-02-15T18:08:33.017" Title="Is it KoTH if they don't fight each other?" Tags="|discussion|tags|code-challenge|king-of-the-hill|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14829" PostTypeId="2" ParentId="14828" CreationDate="2018-02-15T17:38:15.063" Score="5" Body="&lt;p&gt;From the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; tag wiki:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;King-of-the-hill indicates a game where the submissions interact with and compete against each other in some form of game. Competitions which pit programs against each other without interaction should rather use &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2018-02-15T17:38:15.063" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14830" PostTypeId="1" AcceptedAnswerId="14833" CreationDate="2018-02-15T18:20:52.080" Score="10" ViewCount="226" Body="&lt;p&gt;I asked a challenge to interpret deadfish &lt;a href=&quot;https://codegolf.stackexchange.com/questions/155882/interpret-deadfish&quot;&gt;here&lt;/a&gt;, but it got closed for being a duplicate of a challenge to write an interactive deadfish interpreter &lt;a href=&quot;https://codegolf.stackexchange.com/questions/16124/write-an-interactive-deadfish-interpreter&quot;&gt;here&lt;/a&gt;. Is this really a duplicate?&lt;/p&gt;&#xA;" OwnerUserId="38078" LastEditorUserId="38078" LastEditDate="2018-02-16T02:40:15.857" LastActivityDate="2018-02-16T14:00:39.060" Title="Is my question a duplicate even though it doesn't impose a requirement that the original one did?" Tags="|discussion|code-golf|duplicates|closed-questions|" AnswerCount="5" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14831" PostTypeId="2" ParentId="14830" CreationDate="2018-02-15T18:37:45.263" Score="0" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;Since a valid answer for your challenge isn't a valid answer for the other one, and a competitive answer in the other challenge wouldn't be competitive in yours - I don't think it's a duplicate.&lt;/p&gt;&#xA;" OwnerUserId="18730" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-15T18:37:45.263" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14832" PostTypeId="2" ParentId="14830" CreationDate="2018-02-15T18:44:58.390" Score="2" Body="&lt;h1&gt;Yes, it is a duplicate&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Since I am the one who “hammer”-closed it as a duplicate, I feel like I am morally obligated to explain my reasoning here. Because your challenge is merely a subset of the other challenge, I think they cannot be considered different challenges — although the answers are not immediately portable from one challenge to another, the &lt;em&gt;core&lt;/em&gt; task is the same: Interpret the Deadfish programming language. Interactively or not, the idea is the same. Therefore, I think they are too closely related for yours to be kept open. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Don’t get me wrong, it’s a very well-written challenge, but I closed it as a duplicate because your was a subset — and a rather big one — of the other post.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastActivityDate="2018-02-15T18:44:58.390" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14833" PostTypeId="2" ParentId="14830" CreationDate="2018-02-15T18:47:27.993" Score="7" Body="&lt;h1&gt;Maybe!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The title of this question is general, so I'll provide a general answer. It applies to the specific challenges mentioned in the question too.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Ask yourself this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Does it bring something new to the table?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If it does, then it's not a duplicate. If it doesn't, then it's a duplicate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In general, taking away (or imposing new) restrictions might lead to very different answers in which case it's not a duplicate. However, it may also lead to similar answers where parts of the code is taken away, or there are some parts added to the existing ones, in which case it can be considered a duplicate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's hard to tell how close two challenges can be before they are considered duplicates. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/31516&quot;&gt;The Sandbox&lt;/a&gt; is particularly useful in such cases.&lt;/p&gt;&#xA;" OwnerUserId="31516" LastEditorUserId="31516" LastEditDate="2018-02-15T19:20:48.173" LastActivityDate="2018-02-15T19:20:48.173" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14834" PostTypeId="2" ParentId="14830" CreationDate="2018-02-15T20:19:46.357" Score="-4" Body="&lt;h1&gt;The case for &quot;No&quot;.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I did vote to close, but I was actually trying to just flag it for moderator attention. I don't necessarily have an opinion one way or another, but I want to present this viewpoint.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sometimes challenges require a lot from a language (IO, measuring mouse clicks or positions, etc.) and a similar challenge with fewer requirements can be appropriate. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;An example of this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/153366/visualize-visual-eyes&quot;&gt;Visualize Visual Eyes&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/153558/the-eyes-are-following-you?noredirect=1&amp;amp;lq=1&quot;&gt;The Eyes are Following You&lt;/a&gt;. The first challenge required detection of mouse location on a screen and the second challenge replaced mouse interactivity with an integer input, allowing for many more languages to participate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this case, if the first challenge is restrictive of many languages due to requiring interactivity, then another challenge might be warranted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Edit: if you disagree, please consider adding a comment and explaining why.&lt;/p&gt;&#xA;" OwnerUserId="75553" LastEditorUserId="69850" LastEditDate="2018-02-16T12:07:55.580" LastActivityDate="2018-02-16T12:07:55.580" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14836" PostTypeId="2" ParentId="14830" CreationDate="2018-02-16T14:00:39.060" Score="4" Body="&lt;h1&gt;No, it is not a duplicate.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Since I'm the one who hammered it back &lt;em&gt;open&lt;/em&gt;, I should definitely explain my thoughts on this. An interactive interpreter is a lot different from a non-interactive one, because a non-interactive interpreter can be a lot simpler and use some golfing strategies that would not work provided a requirement for a prompt.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, displaying a prompt and taking input from STDIN takes up to 6 bytes in Jelly, and putting it in a loop takes another 2, at least, so answers from the interactive one would not be competitive enough in this scenario unless they were modified to match the challenge specs for this challenge, which I believe justifies its individual existence. Likewise, answers in this challenge wouldn't even be valid in the other one because they're non-interactive without a prompt.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Stewie Griffin's main point which I want to expand on is whether or not it &quot;adds something new to the table&quot;. This is definitely a good point to consider and while I believe that the two have basically the same ideas in terms of what they're doing, I'd argue that the majority of KC challenges are all basically identical and that adding a non-interactive interpreter challenge &lt;em&gt;does&lt;/em&gt; bring something new by allowing participation of certain languages without interactive input (maybe those exist, I don't know) and opening the scope to another set of golfing strategies.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For these reasons, I voted to reopen. (For reference, my vote counted in the place of 2 votes in this case)&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2018-02-16T14:00:39.060" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14838" PostTypeId="1" CreationDate="2018-02-16T19:58:31.950" Score="17" ViewCount="401" Body="&lt;p&gt;Recently a user joined the site asking a question that was an equivalent of the routinely closed, &quot;hey guys please solve my homework for me&quot;. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/155938/sum-of-combinations-with-repetition&quot;&gt;Here's the specific question I'm talking about&lt;/a&gt;. An &lt;strong&gt;existing&lt;/strong&gt; user then proceeded to edit the question to make it more fitted to our site, and I voted to reopen the challenge due to this fact.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When asking in The Nineteenth Byte the overall consensus was that a challenge should not be edited to alter the original poster's intent. My few questions pertaining to this topic would be:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is it okay to take a malformed &quot;closed&quot; challenge from a new user like this and repost it as your own in a valid format?&lt;/li&gt;&#xA;&lt;li&gt;Is it okay to edit the question to make it 'valid' maintaining the original user's intent of solving the problem but making it relevant to our site?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;My main discussion point here is:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A new user posts a question without knowing the rules of the site.&lt;/li&gt;&#xA;&lt;li&gt;The question is actually a nice challenge that's not a dupe.&lt;/li&gt;&#xA;&lt;li&gt;The question is off-topic for one reason or another and gets closed.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;em&gt;What do we do if we want the challenge, but well-formed?&lt;/em&gt;&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Discuss correct courses of action please.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="41024" LastEditDate="2018-02-17T15:04:25.563" LastActivityDate="2018-02-17T15:04:25.563" Title="On editing somebody else's off-topic question to make it on-topic without the owner's word" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14840" PostTypeId="2" ParentId="14838" CreationDate="2018-02-16T20:48:39.837" Score="24" Body="&lt;h2&gt;Stop editing programming questions to make them on-topic&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Note that this is solely my opinion about the problem. In case the post was initially a general programming question, I think we should &lt;strong&gt;not&lt;/strong&gt; edit them to make them on topic for the following reason:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Although (usually) obnoxiously inefficient and esoteric, the answers here &lt;em&gt;still&lt;/em&gt; provide some sort of reference for the OP to use when solving their homework / whatever else they want to solve. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This incentivizes posting off-topic, programming-related help questions, which is &lt;strong&gt;not&lt;/strong&gt; ok.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The poster is then &lt;em&gt;rewarded&lt;/em&gt; through upvotes, thanks to a significant edit made by another user, and this might make them think it's perfectly fine to just post a question which is then edited by someone else, and eventually also answered in a manner that is at least somewhat helpful to them.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;We should close such questions as &lt;strong&gt;off-topic&lt;/strong&gt; and leave them closed, without bothering to make them on-topic by editing. &lt;strong&gt;But&lt;/strong&gt; we should still be welcoming to the new user and explain why the question is not well-received, and how things work around PPCG, additionally pointing them towards the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;Sandbox&lt;/a&gt;. After we provide all the necessary information, we might want to ask the OP if they want to reword their question &lt;strong&gt;themselves&lt;/strong&gt; to make it on-topic (this would be perfectly fine, I think). If they don't want to modify their post or don't reply to the comments after a certain threshold (e.g. a couple of days), some other member of the community can take over their challenge and &lt;strong&gt;post it separately&lt;/strong&gt;, of course mentioning the original post.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastActivityDate="2018-02-16T20:48:39.837" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14841" PostTypeId="1" CreationDate="2018-02-17T02:49:44.500" Score="7" ViewCount="194" Body="&lt;p&gt;I recently closed &lt;a href=&quot;https://codegolf.stackexchange.com/q/155973/68942&quot;&gt;this post&lt;/a&gt; as &lt;strong&gt;off-topic&lt;/strong&gt; because &quot;it is not clear and it does not appear to be your own content&quot;.  In case the post ever gets deleted, &amp;lt;2k users can see the image &lt;a href=&quot;http://www.imgpaste.net/image/uY54T&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;. While I now realize my mistake in that it does actually seem to be OP's original post on that site, I will not vote to re-open because it is still not clearly written or specified enough. However, I present the need for a verdict for this site in terms of the originality of content:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What does the community decide to do for challenges that take most or all of its content from a site that permits their content to be copied and is cited in the challenge?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unlike &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/13311/what-should-we-do-about-posts-that-are-copied-from-external-sources&quot;&gt;this meta post&lt;/a&gt; by Mr. Xcoder with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13315/68942&quot;&gt;this consensus&lt;/a&gt; by Peter Taylor, this question deals with the scenario where it is not bound by legal restrictions. The main points I want to see considered for this situation are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Does it add anything to the site where the exact content could otherwise be found on another site?&lt;/li&gt;&#xA;&lt;li&gt;Does it warrant a new post?&lt;/li&gt;&#xA;&lt;li&gt;Is it morally right to get reputation off of non-original content? (Note that CW does not rectify plagiarism or mitigating reputation from up or down votes, and, for challenges, causes all answers to become CW, which means users who answer don't get reputation from up or down votes either)&lt;/li&gt;&#xA;&lt;li&gt;Why post a challenge instead of posting a link in chat? Please provide reasons for why it is better to do this if you propose that these challenges should not be discouraged, and please provide reasons for why there is no advantage if you propose that these challenges should be discouraged.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="73111" LastEditDate="2018-02-20T21:10:24.117" LastActivityDate="2018-02-20T21:10:24.117" Title="What's the PPCG policy on originality of content?" Tags="|discussion|scope|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14842" PostTypeId="2" ParentId="14841" CreationDate="2018-02-17T04:00:14.357" Score="1" Body="&lt;h1&gt;[No] These challenges should be &lt;em&gt;discouraged&lt;/em&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Discouraged&lt;/em&gt; is emphasized here. I believe that posting these challenges to PPCG is only mildly better than posting spam questions/answers, the main distinction that makes these types of challenges not instantly red-flaggable is that these challenges have actual relevance to what we do on this site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In general, I do concede that it would add something new &lt;em&gt;to the site&lt;/em&gt;, because this content likely would not have been seen before on the site. However, I do not believe it warrants a new post. In general, I believe that questions on this site should be commended for originality, thorough specifications, and being interesting. Originality is definitely not met by reposting others' content, and specifications are often not thorough enough because other sites have different requirements, rules, and format from our site (in fact, I typically use this as a guideline to guess if a challenge is potentially copied if its format seems to be well defined but not suitable for this site). Copied content can sometimes be interesting, though a lot of the time it is more of a programming task, homework-like problem, or some other non-challenging task.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I do not believe it is morally right to get the reputation from up-votes on copied content. While I do not care that much about my own reputation and I do not think the reputation system is the best system out there for this site as it can create unnecessary disputes sometimes, it is still a part of the Stack Exchange culture and should still be considered. Normally, posting good challenges gives the user reputation which is rightfully earned because they had to put forth the effort to create a unique challenge idea. However, when re-posting others' content, not much effort is required and anyone else could have just as easily posted that without being good at challenge-writing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, I believe posting a challenge is no better than linking it in chat. Sure, posting a real challenge gets you and other people internet points, but if it's not your own content, I believe the previous points make that an insignificant &quot;benefit&quot; in the scope of all of the other issues.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For these reasons, I propose to discourage legally permitted and credited copying of content.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2018-02-17T04:00:14.357" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14843" PostTypeId="2" ParentId="2140" CreationDate="2018-02-17T08:53:43.547" Score="2" Body="&lt;h1&gt;Indices of inner join (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given two lists of integers &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; of possibly unequal lengths, return the list of pairs &lt;code&gt;(i, j)&lt;/code&gt; such that the &lt;code&gt;i&lt;/code&gt;th element of &lt;code&gt;x&lt;/code&gt; is equal to the &lt;code&gt;j&lt;/code&gt;th element of &lt;code&gt;y&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output consists of a vector of pairs or a pair of vectors (the zip of the other option, may be useful for languages without pair data structure). The pairs may be given in any order, and using 0-based or 1-based indexing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In pseudo-code: (this returns two lists of indices, assumes 1-based indexing, and gives lexicographically sorted output)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input vector&amp;lt;int&amp;gt; x, vector&amp;lt;int&amp;gt; y&#xA;vector&amp;lt;int&amp;gt; xout, yout;&#xA;for (i in 1 to length(x)) &#xA;  for (j in 1 to length(y))&#xA;    if (x[i] == y[j]) {&#xA;      add i to end of xout;&#xA;      add j to end of yout;&#xA;    }&#xA;return xout, yout;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is code-golf so answers will be scored in bytes with fewer bytes being better.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test case 1&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x = [5, 1, 1, 2], y = [5, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-&amp;gt; xout = [1, 2, 3]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(5, 1, 1 each appears once in y)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-&amp;gt; yout = [1, 2, 2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(the first position appears once in x, the second twice)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Reshuffling the pairs is okay:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-&amp;gt; xout = [2, 1, 3]&#xA;-&amp;gt; yout = [2, 1, 2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Test case 2&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x = [2, 2, 2, 3, 3], y = [4, 2, 2, 2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-&amp;gt; xout = [1, 1, 1, 2, 2, 2, 3, 3, 3]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(each of the three first positions finds three matches in y)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-&amp;gt; yout = [2, 2, 2, 3, 3, 3, 4, 4, 4] &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Improvements and clarifications are very welcome!&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="78289" LastEditorUserId="194" LastEditDate="2018-02-20T12:15:40.697" LastActivityDate="2018-02-20T12:15:40.697" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14844" PostTypeId="2" ParentId="2140" CreationDate="2018-02-17T09:23:49.577" Score="1" Body="&lt;h1&gt;Assemble an XOISC program&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Tags&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parentheses&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parentheses&amp;#39;&quot; rel=&quot;tag&quot;&gt;parentheses&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Recently I solved &lt;a href=&quot;https://codegolf.stackexchange.com/questions/154617/design-a-one-instruction-set-computer&quot;&gt;this&lt;/a&gt; challenge, for which I created &lt;a href=&quot;https://github.com/bforte/XOISC&quot; rel=&quot;nofollow noreferrer&quot;&gt;XOISC&lt;/a&gt; - a very low-level functional language. To compile a program (written in the absurdly high-level lambda calculus programming language) it must first be translated into an expression consisting only of &lt;em&gt;X&lt;/em&gt; combinators and from there it can be translated to the &quot;machine language&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's an initially empty stack and the program only consists of a stream of integers. For each integer the following happens:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pop &lt;em&gt;N&lt;/em&gt; elements &lt;em&gt;f&lt;sub&gt;1&lt;/sub&gt;,...,f&lt;sub&gt;N&lt;/sub&gt;&lt;/em&gt; and push &lt;em&gt;X (f&lt;sub&gt;1&lt;/sub&gt; (..(f&lt;sub&gt;N-1&lt;/sub&gt; f&lt;sub&gt;N&lt;/sub&gt;)..))&lt;/em&gt; - ie. it right-folds function application and applies this to another &lt;em&gt;X&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Eventually we'll end up with a stack of functions which gets left-folded with function application. That's it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;How does it work?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When parsing such an expression, one thing to keep in mind is that function application is left-associative - meaning that &lt;em&gt;X (X X) X&lt;/em&gt; is read as &lt;em&gt;(X (X X)) X&lt;/em&gt; rather than &lt;em&gt;X ((X X) X)&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we have an expression &lt;em&gt;f g&lt;/em&gt; with sub-expressions &lt;em&gt;f&lt;/em&gt; and &lt;em&gt;g&lt;/em&gt; (in the code below &lt;code&gt;App f g&lt;/code&gt; - eg. &lt;em&gt;X (X X) X&lt;/em&gt; would be &lt;em&gt;f = X (X X)&lt;/em&gt; and &lt;em&gt;g = X&lt;/em&gt;), there's a simple recursive algorithm to assemble it:&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-hs prettyprint-override&quot;&gt;&lt;code&gt;-- Base case: We simply need to pop the accumulated functions &#xA;asm' n X         = [n]&#xA;-- Recurse: First build the left function, then the right one. &#xA;--          Incrementing n ensures that we leave (f g) on stack&#xA;asm' n (App f g) = asm' 0 f ++ asm' (n+1) g&#xA;&#xA;-- Now we start with 0 functions on the stack:&#xA;asm expr = asm' 0 expr&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For those unfamiliar with Haskell:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;this algorithm assumes an already parsed expression in the form of of a binary tree (the definition of the data structure would be &lt;code&gt;data Exp = X | App Exp Exp&lt;/code&gt; where &lt;code&gt;X&lt;/code&gt; would be a leaf and &lt;code&gt;App f g&lt;/code&gt; would be a node with children &lt;code&gt;f&lt;/code&gt; and &lt;code&gt;g&lt;/code&gt; that are &lt;code&gt;Exp&lt;/code&gt;s as well)&lt;sup&gt;*&lt;/sup&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;asm' n exp&lt;/code&gt; does a case distinction by matching a pattern on &lt;code&gt;exp&lt;/code&gt;:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;if the expression is &lt;em&gt;X&lt;/em&gt; (ie. &lt;code&gt;exp = X&lt;/code&gt;) it's the base case and just returns a singleton list containing &lt;code&gt;n&lt;/code&gt; (an integer)&lt;/li&gt;&#xA;&lt;li&gt;else it's of the form &lt;em&gt;f g&lt;/em&gt; (with &lt;em&gt;f,g&lt;/em&gt; some sub-expressions) which is expressed as &lt;code&gt;App f g&lt;/code&gt;, so it will recursively build the list for &lt;em&gt;f&lt;/em&gt; and append the list of &lt;em&gt;g&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;to assemble an expression &lt;code&gt;exp&lt;/code&gt; we begin initialize the recursive algorithm with &lt;code&gt;n = 0&lt;/code&gt; (&lt;code&gt;asm' 0 exp&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note&lt;/strong&gt;: Since a lot of people here know Python, you can find a horrible but very well documented Python reference implementation &lt;a href=&quot;https://tio.run/##jVTvi5tAEP3uXzHcQdXenk3Sb4EclHLQfiiUfgqIlE0ya2zXVXY3d5eW/u3prKtGTa5UwR87zxnnzdtXH@2@Uu9Ppx0KkCjsd25MtS24xQhfahMvA6Dj5uYGvnKNyu7RFL8QKKbRmKJSBt6AOWzuBysMjE2AoEfQKCRubZPEHRssVN4Uuu8KFU@YwOMLL2uJZtkjAdJZBvcP7jZaZHT6gHvO2DTcrXaQ5v06zAF9uAd3X3eBADoCgubhFmbv1oP2oTDjdnAHXGrkuyPRUMEzwo@DsUSEPWhCeyoKAfZYtxS7FIWy59ZbrAt2RT9yg5CKOQOxYJAkSbaEb7g9aFqmnxBzmoJYAFc7qIdzonvZVZSo2oIPsDhXEwxyBm81lrDyNbuI5IKWJqoQ8SCeX8bzeNrHBJCmlJe5j4n2OwKVcdflF/4TSUwaiUI5VRVQX5dUG2JYymBQLp3KOAZRaUDiuGkvC4LAqZ14MhgZq12Nsc6JVK6GQyYU6ZbR0qVM15ciXTfnKxJdQ0TR2H/Vq@wivP6Xfj3Iwc65rqt3rN1PldbFRh7Baq4M0VISK/XBgq2AQ7SvahQHKY8xfG2MAWRhvGIdhZzBxrGYhlEaMgjjzF2Buet6FmZnVlpWSR3tU6KxlnyLkcvRz/vxiUsn0aYMKbjs51/Y0O8rOA87eF1TSImiMP39JwsT1xW3/WDjuJ03N6WTv2agVrPBvD8Yg@VG0si9JHbDwefkTsqpjDf/eF0B141q5EMzNmfzafj6uAbxbvJtihlb/EeSHjwnOH1yIYLPouF87GGpYHlG7J4tBZ4Lu3dc0WAcE927upu3iSJVWVz6AaLKKUqJuHzmRwMLR9UWa9soZ1JvTQucJtzm6e3CAci7/L7u6LyFeOqZuvHMRjTO8Vpjo9XVaups3tP01JOcGERM9uMecubbikc2opxR3JLL8p3fJMzrg7RJjPBONeToNZmDjVwm7ykNOiLlxafTZKf@BQ&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 3 – Try It Online&quot;&gt;here&lt;/a&gt; which does the parsing as well as the assembling!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;*&lt;/sup&gt; The &lt;code&gt;|&lt;/code&gt; means that an &lt;code&gt;Exp&lt;/code&gt; type can be constructed of either the left constructor (&lt;code&gt;X&lt;/code&gt;) or of the right one (&lt;code&gt;App Exp Exp&lt;/code&gt; where the two &lt;code&gt;Exp&lt;/code&gt; are &lt;code&gt;Exp&lt;/code&gt; two sub-expressions).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example the expression &lt;em&gt;X (X X) X&lt;/em&gt; would be expressed as &lt;code&gt;App (App X (App X X)) X&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Having an expression &lt;em&gt;X (X X) X&lt;/em&gt;, it helps to think of the implicit parentheses: &lt;em&gt;(X (X X)) X&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Translating this with the above algorithm:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Assemble &lt;em&gt;(X (X X))&lt;/em&gt;:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Assemble &lt;em&gt;X&lt;/em&gt;:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Base case =&gt; &lt;code&gt;0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Now Assemble &lt;em&gt;X X&lt;/em&gt;, making sure it gets applied to the previous one (+1)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first &lt;em&gt;X&lt;/em&gt; gives us a &lt;code&gt;0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The second one gives us &lt;code&gt;0 + 1 + 1 = 2&lt;/code&gt; (apply to &lt;em&gt;X&lt;/em&gt; and previous one)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;So the left &lt;em&gt;(X (X X))&lt;/em&gt; gave us &lt;code&gt;[0,0,2]&lt;/code&gt;, assembling the right &lt;em&gt;X&lt;/em&gt;:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This gives us &lt;code&gt;0 + 1&lt;/code&gt; (apply to the previous one)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And we end up with the program &lt;code&gt;[0,0,2,1]&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note&lt;/strong&gt;: While this algorithm ensures that there's a program for every expression, there can be other solutions too. For example &lt;code&gt;[0,0,1,0]&lt;/code&gt; would be a valid one for &lt;em&gt;X (X X) X&lt;/em&gt; as well.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an expression consisting of &lt;em&gt;X&lt;/em&gt; combinators, translate it to the XOISC machine language:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input will be a string encoding such an expression&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input will be a valid expression and non-empty&lt;/li&gt;&#xA;&lt;li&gt;You may choose to require an input string that contains no spaces&lt;/li&gt;&#xA;&lt;li&gt;You may choose the characters encoding parentheses and the combinator itself (as long as it's consistent, eg. using &lt;code&gt;[&lt;/code&gt;,&lt;code&gt;]&lt;/code&gt;,&lt;code&gt;x&lt;/code&gt; instead of &lt;code&gt;(&lt;/code&gt;,&lt;code&gt;)&lt;/code&gt;,&lt;code&gt;X&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;You're guaranteed that there are no unnecessary parentheses (eg. &lt;code&gt;(X X) X&lt;/code&gt; would result in undefined behaviour)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Output can be a list of integers, a string separated by new-lines or whitespaces&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;These testcases assume that the input contains whitespaces and choose &lt;code&gt;X&lt;/code&gt; to encode the combinator.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that there may be multiple valid outputs, you're free to choose one&lt;sup&gt;*&lt;/sup&gt; - I'll only show the solution resulting from the above algorithm:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-hs prettyprint-override&quot;&gt;&lt;code&gt;X -&amp;gt; [0]&#xA;X X X -&amp;gt; [0,1,1]&#xA;X (X X) -&amp;gt; [0,0,2]&#xA;X (X X) X -&amp;gt; [0,0,2,1]&#xA;X (X (X (X X X))) -&amp;gt; [0,0,0,0,1,4]&#xA;X (X X) (X X) (X X) -&amp;gt; [0,0,2,0,2,0,2]&#xA;X (X X X (X X)) -&amp;gt; [0,0,1,1,0,3]&#xA;X (X (X X) (X X)) -&amp;gt; [0,0,0,2,0,3]&#xA;X X (X X (X (X (X (X (X X X)))) X) X) -&amp;gt; [0,1,0,1,0,0,0,0,0,1,5,2,2]&#xA;X (X (X X) X (X X X)) X (X (X (X X) X)) -&amp;gt; [0,0,0,2,1,0,1,3,1,0,0,0,2,3]&#xA;X (X (X (X (X X) X X) X X X) X X X X) X X X X X -&amp;gt; [0,0,0,0,0,2,1,2,1,1,2,1,1,1,2,1,1,1,1,1]&#xA;X (X (X X (X X) (X X) (X X) X) X (X X) X) X (X X X) X -&amp;gt; [0,0,0,1,0,2,0,2,0,2,2,1,0,2,2,1,0,1,2,1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;* &lt;a href=&quot;https://tio.run/##XU9BasMwELzrFYNONnGLczXE1JQees7FYExQasUWVWVhLcSH/t3VygRKBEKzszOj3UmFb23ttg2KFD5WjxMa7xPi@4tWCO@bSN@s8dwTwrhAyn1pnKf5nmT3SS9aAIGJjAMUrm8JXHDJ82hPLYXDARKZ5Dcx18Tk8tn8bPnneEjbKJGtFOJHGRfxqOl9dqQdBdT1CX4xjvCK22yH5QjeYi8sxhldH6ts0WpAVeFMUTzipUb36ajP4x9pJ1auARy/OzmlBaFKczzOrs2o2Of21lBD0bWGbevKoiyORdn/AQ&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Haskell – Try It Online&quot;&gt;Here&lt;/a&gt;'s a program to validate alternative solutions&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sandbox&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I already &lt;a href=&quot;https://codegolf.stackexchange.com/q/156566/48198&quot;&gt;posted&lt;/a&gt; this to main, but apparently I did a bad job of explaining it.. It's hard to tell what's missing, I'd be happy for feedback (feel free to edit this)!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="48198" LastEditorUserId="48198" LastEditDate="2018-02-23T21:09:43.793" LastActivityDate="2018-02-23T21:09:43.793" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14845" PostTypeId="2" ParentId="14841" CreationDate="2018-02-17T10:04:00.557" Score="11" Body="&lt;p&gt;There are various scenarios, and I don't think the answer is necessarily the same for all of them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I assume for all of these scenarios that the content is explicitly licensed in a way which makes it legally ok to post it here, and that the source is properly credited in the question.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scenario: borrowed spec, new challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It may happen that while browsing a programming contest site where the challenge is to find an efficient algorithm that someone thinks, &quot;This would make a fun golf&quot;. I don't see any problem with that, as long as the spec is sufficiently clear. However, I think the next scenario is a nicer way to handle it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scenario: same core problem, rewritten description&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;My question &lt;a href=&quot;https://codegolf.stackexchange.com/q/131787/194&quot;&gt;Trigger the chutes and protect the jackpot&lt;/a&gt; was inspired by a question on Code Review which in turn was based on (IIRC) a TopCoder contest. I took the core concept and completely rewrote the situation. The original one wasn't about a gameshow, and (difficult though it may be to believe) was even less plausible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rewriting avoids copyright issues (copyright protects the &lt;em&gt;expression&lt;/em&gt; of ideas, not ideas &lt;em&gt;per se&lt;/em&gt;). It means that people searching for help with the TopCoder challenge won't find the PPCG question on the first page of Google results and rip off the answers. It also ensures that I've thought about ways in which the wording could create loopholes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This takes more effort, but IMO it's preferable.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scenario: straight repost&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is where you seem to be focussing the question. There is precedent for reposting questions from some Google challenge site which explicitly allowed it, although I can't remember enough details to find the relevant question(s).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not convinced that questions in this category should be automatically closed or deleted (although if they have other problems such as ambiguities in the spec then those should be handled as normal). However, they &lt;em&gt;do&lt;/em&gt; meet one of the downvote criteria (lack of effort), and I would certainly be loath to upvote them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think we should encourage people to put in some effort, take ownership, and convert questions into the previous scenario.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scenario: off-site contest&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is where I think the question should be focussed, because the linked (and now deleted) challenge seems to be more about advertising an off-site challenge with off-site prizes than running a parallel challenge. This is antithetical to what PPCG is about: this is a site for hosting contests, not for discussing contests which are hosted elsewhere, and every question should aim to be self-contained.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-02-17T10:04:00.557" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14846" PostTypeId="2" ParentId="5243" CreationDate="2018-02-17T10:50:44.510" Score="23" Body="&lt;h1&gt;1000 – 2000 rep for figuring out how to program with both halves of a &lt;a href=&quot;https://github.com/m-ender/stackcats&quot; rel=&quot;nofollow noreferrer&quot;&gt;Stack Cats&lt;/a&gt; program&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This bounty needs a bit of background, so bear with me.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Stack Cats is an esolang with fairly strong constraints on its program structure. Specifically, each valid program has to have mirror symmetry, and the commands are designed such that mirroring a character results in the inverse operation. That means that the second half of the program (disregarding the character in the centre) exactly undoes what the first half did. So in a way it's on that central character to change the program state in a meaningful way, such that the undoing part actually results in the program behaviour you want.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, there's only a handful of possible commands that can even be used for that single central character. For the mathematically inclined, this means that programming in Stack Cats is all about finding a &lt;a href=&quot;https://en.wikipedia.org/wiki/Conjugacy_class&quot; rel=&quot;nofollow noreferrer&quot;&gt;conjugate relation&lt;/a&gt; that transforms one of 12 built-ins into the program you want to write. Nevertheless, I believe that Stack Cats &lt;a href=&quot;http://esolangs.org/wiki/Stack_Cats#Computational_Class&quot; rel=&quot;nofollow noreferrer&quot;&gt;is in fact Turing-complete&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While I've written non-trivial programs in Stack Cats (for example &lt;a href=&quot;https://codegolf.stackexchange.com/a/83730/8478&quot;&gt;this primality test&lt;/a&gt;), they all rely on a certain construction that essentially works around these limitations, by skipping the entire first half of the program. This lets us put arbitrary &quot;unbalanced&quot; code in the second half, so we don't really have to worry about the conjugation. The basic construction looks like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;(...)*(...)&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;()&lt;/code&gt; are conditionals, which are always false in the first half and always true in the second half, so the first &lt;code&gt;...&lt;/code&gt; is skipped and the second &lt;code&gt;...&lt;/code&gt; is executed. The problem is that this is clearly inefficient for golfing: we could be doing useful stuff with both halves of the program, but we're just throwing one half away to be able to make sense of the program in the first place.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For very trivial problems, Sp3000 and I have found some programs that don't use this construction, but even those were &lt;em&gt;usually&lt;/em&gt; found by an automated search. &lt;a href=&quot;https://codegolf.stackexchange.com/a/85048/8478&quot;&gt;Here is an example of that for adding two numbers.&lt;/a&gt; In particular, our brute force approaches are usually nowhere near fast enough to find solutions that actually require control flow/loops. As far as I know, the only program that was ever written which uses both halves and contains a loop is &lt;a href=&quot;https://codegolf.stackexchange.com/a/89484/8478&quot;&gt;this program by feersum&lt;/a&gt; (and given that the task was to implement an arbitrary OEIS sequence, it's likely that they just tried some programs with loops until one of them produced a reasonable OEIS sequence).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;So,&lt;/strong&gt; Sp3000 and I will together award 1000 rep to a Stack Cats answer, which:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Contains non-trivial control flow, i.e. &lt;code&gt;(...)&lt;/code&gt; and/or &lt;code&gt;{...}&lt;/code&gt; which don't always do the same regardless of program input (in particular, if there's a &lt;code&gt;(...)&lt;/code&gt; it should be executed for some inputs and skipped for others, to make sure that it isn't used to skip unused parts of the code unconditionally).&lt;/li&gt;&#xA;&lt;li&gt;Contains an explanation for how one can find such an answer without resorting to automated search (of course, you're perfectly welcome to make use of automated searches to get a better understanding of the structure of Stack Cats programs).&lt;/li&gt;&#xA;&lt;li&gt;Can't be easily outgolfed by an answer which uses the &lt;code&gt;&amp;lt;(...)*(...)&amp;gt;&lt;/code&gt; template or which uses no control flow operations at all (to ensure that the program isn't just a linear solution like the addition program, padded with some loops which don't end up doing anything; and also to ensure that this technique actually &lt;em&gt;makes use&lt;/em&gt; of both halves in an efficient way).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;To be clear, the explanation is the most important part: this bounty isn't for finding such a solution by serendipity but for understanding how to construct such a solution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Don't try to find loopholes in these rules — we're in no obligation to actually hand out the bounty, so if we feel like your answer is clearly not in the spirit of this bounty, we won't award it. I'm pretty sure that any answer which actually deserves the bounty, will do so quite obviously. Also, if you can solve several challenges (which are sufficiently different) with your technique — which would be a great proof that it's actually a general technique and not just a way to solve one particular task — we will award another 1000 rep to a second answer.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="20080" LastEditDate="2019-03-12T21:30:22.847" LastActivityDate="2019-03-12T21:30:22.847" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="14847" PostTypeId="2" ParentId="2140" CreationDate="2018-02-17T13:50:37.847" Score="1" Body="&lt;h1&gt;Generate a maximal binary Gray code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given an input integer &lt;code&gt;n&lt;/code&gt;, find an &lt;code&gt;n&lt;/code&gt;-bit gray code where the sum of the absolute difference between each adjacent pair of bits converted to decimal is maximized.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if &lt;code&gt;n = 3&lt;/code&gt;, there are 96 possible gray codes, and the maximal sum of deltas in decimal of those is 21. Out of the 96 total, only 8 have maximal deltas.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;┌─────┬─────┬─────┬─────┬─────┬─────┬─────┬─────┐&#xA;│0 0 0│0 0 1│0 1 0│0 1 1│1 0 0│1 0 1│1 1 0│1 1 1│&#xA;│1 0 0│1 0 1│1 1 0│1 1 1│0 0 0│0 0 1│0 1 0│0 1 1│&#xA;│1 1 0│1 1 1│1 0 0│1 0 1│0 1 0│0 1 1│0 0 0│0 0 1│&#xA;│0 1 0│0 1 1│0 0 0│0 0 1│1 1 0│1 1 1│1 0 0│1 0 1│&#xA;│0 1 1│0 1 0│0 0 1│0 0 0│1 1 1│1 1 0│1 0 1│1 0 0│&#xA;│1 1 1│1 1 0│1 0 1│1 0 0│0 1 1│0 1 0│0 0 1│0 0 0│&#xA;│1 0 1│1 0 0│1 1 1│1 1 0│0 0 1│0 0 0│0 1 1│0 1 0│&#xA;│0 0 1│0 0 0│0 1 1│0 1 0│1 0 1│1 0 0│1 1 1│1 1 0│&#xA;└─────┴─────┴─────┴─────┴─────┴─────┴─────┴─────┘&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Checking the first result, the decimal values are&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 4 6 2 3 7 5 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and the deltas of each adjacent pair are&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4 2 4 1 4 2 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and the sum of that is 21.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input will be an integer &lt;code&gt;n &amp;gt; 0&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You may output either one or all possible gray codes that satisfy the condition.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="6710" LastEditorUserId="6710" LastEditDate="2018-02-17T14:08:47.503" LastActivityDate="2018-02-17T14:08:47.503" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14848" PostTypeId="1" CreationDate="2018-02-17T17:31:08.840" Score="0" ViewCount="89" Body="&lt;p&gt;&lt;em&gt;(this question relates to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/155973/real-tv-contest&quot;&gt;that &quot;real TV&quot; attempt at KOTH challenge&lt;/a&gt;)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd like to submit a game with the following characteristics, and I'd like to discuss whether or not it is acceptable here, and to what conditions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;game will be self-contained, but simultaneously posted on at least another platform&lt;/li&gt;&#xA;&lt;li&gt;that other platform will give crypto-currency reward to the winners, but only if&lt;/li&gt;&#xA;&lt;li&gt;game will have an unambiguous scoreboard for prize determination&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Note 1: money is provided (in very short) by the platform &quot;likes&quot;, people liking (as in facebook) the post contribute to the prize pool&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note 2: Following advice on OP comments, I went through &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1878/are-we-allowed-to-offer-real-world-prizes-such-as-gift-codes-to-the-winner-of-a/1895#1895&quot;&gt;this meta post&lt;/a&gt;. My understanding is that monetary prize is unusual but not strictly forbidden&lt;/p&gt;&#xA;" OwnerUserId="77508" LastActivityDate="2018-02-17T20:12:51.200" Title="A contest on multiple platforms with monetary reward" Tags="|discussion|meta|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14849" PostTypeId="2" ParentId="14848" CreationDate="2018-02-17T20:12:51.200" Score="8" Body="&lt;p&gt;Though (AFAIK) it's technically not forbidden by SE, it's not a great idea to offer monetary rewards for content posted to SE. If you really want to do this, you should only mention that the challenge is also hosted somewhere else. I would forgo any mention of the possibility of monetary reward from that other platform, and make it very clear that the challenge on PPCG is independent of the challenge on the other platform.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What other platforms do or do not do is not our concern, so if you can maintain an arm's-length separation between PPCG and the other platform, you should be alright.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2018-02-17T20:12:51.200" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14852" PostTypeId="1" CreationDate="2018-02-19T06:11:09.443" Score="10" ViewCount="271" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8503/does-using-smbf-count-as-a-cheating-quine&quot;&gt;Related&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;g&lt;/code&gt;et command, shared by Befunge and &gt;&amp;lt;&gt;, is a command that pops two values x and y and retrieves a value stored at that cell (its counterpart is the &lt;code&gt;p&lt;/code&gt;ut command, which stores a value at a certain cell). The problem is that the 2D surface is the same surface the source code is running off, with uninitialised cells being value 0.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is an example of 3 &gt;&amp;lt;&gt; quines, with varying use of the &lt;code&gt;g&lt;/code&gt; command:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0:0g:?!;o1+!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This simply iterates over the first line using the get command until it reaches an uninitialised cell (disregard that it's invalid for other reasons).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;r00g&amp;gt;o&amp;lt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This &lt;code&gt;g&lt;/code&gt;ets the &lt;code&gt;&quot;&lt;/code&gt; from the first cell, avoiding having to calculate the value manually, which is two bytes longer(&lt;code&gt;75*1-&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;'rd3*&amp;gt;o&amp;lt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This avoids the use of the &lt;code&gt;g&lt;/code&gt; command altogether and should be valid regardless.&lt;/p&gt;&#xA;&#xA;&lt;hr/&gt;&#xA;&#xA;&lt;p&gt;Okay, let me add an edge case to illustrate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Say there's a challenge to find the product of two positive numbers below 5 without actually using multiplication. Underneath our actual code, we create a box with the appropriate values so that we could simply grab the value at that point on the grid. In Befunge, for example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;amp;  &amp;amp;  g  .  @&#xA;   1  2  3  4  5&#xA;   2  4  6  8  10&#xA;   3  6  9  12 15&#xA;   4  8  12 16 20&#xA;   5  10 15 20 25&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(Pretend that the numbers are the cell values). Does this count as reading the source code, even when the closest analogy would be declaring a 2D array?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How about the wrapping string literal, a common staple of the 2D language quine? It is also accessing the &lt;em&gt;exact same&lt;/em&gt; data that the get command is fetching its data from, which seems like a bit of a double standard to me. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;And just the normal string literal? Take the Befunge program &lt;code&gt;&quot;@&quot;#,&amp;lt;&lt;/code&gt;, which reuses the &lt;code&gt;@&lt;/code&gt; as both the printed character, &lt;em&gt;and&lt;/em&gt; the terminating instruction. Does this count as reading the source code, as it both executes and reads the same character?&lt;/p&gt;&#xA;" OwnerUserId="76162" LastEditorUserId="76162" LastEditDate="2018-02-19T23:42:24.457" LastActivityDate="2018-02-24T17:36:10.640" Title="At what point does the get command (Befunge, &gt;&lt;&gt;, etc) count as reading your own source code?" Tags="|discussion|" AnswerCount="3" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="14853" PostTypeId="2" ParentId="14852" CreationDate="2018-02-19T06:22:09.010" Score="6" Body="&lt;p&gt;This is no different than self-modifying brainfuck in regards to the rules: it only counts as reading its own source if it does, in fact, read its own source. If the cell being read is outside of the bounding box of the source code, then it's fine. If not, then you're reading the source code.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2018-02-19T06:22:09.010" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="14855" PostTypeId="2" ParentId="2140" CreationDate="2018-02-19T09:12:21.807" Score="1" Body="&lt;h1&gt;Build a cardinal cyclic quine&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A cardinal cyclic quine is a cyclic quine with four states, one for each orientation of the cardinal directions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See also &lt;a href=&quot;https://codegolf.stackexchange.com/q/156913/9365&quot;&gt;Build a half cardinal cyclic quine&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/q/156129/9365&quot;&gt;Take a stand against long quine lines&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You can decide which rotation you want to implement, clockwise or counter-clockwise.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once rotated, any gaps in your code should be replaced with spaces to preserve the positioning.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each program must be unique, you cannot use a quine that has the same layout regardless of orientation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program must satisfy &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4878/9365&quot;&gt;the community definition of a quine&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest program in each language wins. Your &lt;em&gt;first&lt;/em&gt; program is used for your byte count.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/9365&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If your program is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$_=q{print};eval&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then the next iterations must be either:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$&#xA;_&#xA;=&#xA;'&#xA;p&#xA;r&#xA;i&#xA;n&#xA;t&#xA;'&#xA;;&#xA;e&#xA;v&#xA;a&#xA;l&#xA;&#xA;lave;}tnirp{q=_$&#xA;&#xA;l&#xA;a&#xA;v&#xA;e&#xA;;&#xA;'&#xA;t&#xA;n&#xA;i&#xA;r&#xA;p&#xA;'&#xA;=&#xA;_&#xA;$&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;l&#xA;a&#xA;v&#xA;e&#xA;;&#xA;'&#xA;t&#xA;n&#xA;i&#xA;r&#xA;p&#xA;'&#xA;=&#xA;_&#xA;$&#xA;&#xA;lave;}tnirp{q=_$&#xA;&#xA;$&#xA;_&#xA;=&#xA;'&#xA;p&#xA;r&#xA;i&#xA;n&#xA;t&#xA;'&#xA;;&#xA;e&#xA;v&#xA;a&#xA;l&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or if your program is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;;$_=';&#xA;;$_=';&#xA;print&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then the next iterations must be either:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;;;&#xA;''t&#xA;==n&#xA;__i&#xA;$$r&#xA;;;p&#xA;&#xA;;'=_$;&#xA;;'=_$;&#xA; tnirp&#xA;&#xA;p;;&#xA;r$$&#xA;i__&#xA;n==&#xA;t''&#xA; ;;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;p;;&#xA;r$$&#xA;i__&#xA;n==&#xA;t''&#xA; ;;&#xA;&#xA;;'=_$;&#xA;;'=_$;&#xA; tnirp&#xA;&#xA;;;&#xA;''t&#xA;==n&#xA;__i&#xA;$$r&#xA;;;p&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="9365" LastEditorUserId="9365" LastEditDate="2018-03-01T09:25:15.323" LastActivityDate="2018-03-01T09:25:15.323" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="14856" PostTypeId="2" ParentId="1324" CreationDate="2018-02-19T11:00:43.040" Score="11" Body="&lt;h1&gt;&amp;quot;Positive&amp;quot;, &amp;quot;Negative&amp;quot;, &amp;quot;Non-Negative&amp;quot;, &amp;quot;Non-Positive&amp;quot;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Positive&lt;/strong&gt;, by default, means &lt;em&gt;strictly&lt;/em&gt; positive, ie. all N larger than zero. Zero is not a positive number.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Negative&lt;/strong&gt; means all N less than zero. Zero is not a negative number.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Non-negative&lt;/strong&gt; means all N larger than &lt;em&gt;or equal to&lt;/em&gt; zero. Zero &lt;em&gt;is&lt;/em&gt; a non-negative number.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Non-Positive&lt;/strong&gt; means all N smaller than &lt;em&gt;or equal to&lt;/em&gt; zero. Zero &lt;em&gt;is&lt;/em&gt; a non-positive number.&lt;/p&gt;&#xA;" OwnerUserId="76162" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-20T02:10:33.647" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="14858" PostTypeId="2" ParentId="2140" CreationDate="2018-02-19T14:42:27.100" Score="1" Body="&lt;h1&gt;Design a language and golf its interpreter&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to design a language and write an interpreter for it. Your language must have the following properties:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Its source code will consist of strings of two characters. I will write them as &lt;code&gt;(&lt;/code&gt; and &lt;code&gt;)&lt;/code&gt; and refer to them as parentheses, but you can choose whichever two distinct characters you like. You can choose whether to ignore other characters.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Valid programs will consist of any string in which the parentheses are balanced, such as &lt;code&gt;()()&lt;/code&gt; or &lt;code&gt;(()(()()))&lt;/code&gt;. The empty string is a valid program. You may assume the input will be a valid program.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Programs will take an input and return an output. Valid inputs and outputs are of the same form as source code: they must be balanced strings of parentheses. This input and output may be accomplished by any method you like, e.g. command-line arguments or STDIN/STDOUT. You may assume your program's input will always be valid.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program must be Turing complete. That means that for every computable function from balanced strings to balanced strings, there must be a program in your language that computes it. &lt;strong&gt;Your answer must include a proof of Turing completeness&lt;/strong&gt;, otherwise it is not a valid answer.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. Your score will be the size of your interpreter's implementation, measured in bytes. The lowest score wins.&lt;/p&gt;&#xA;&lt;p&gt;Here are some additional rules and clarifications:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Your interpreter must be a complete program&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You must include a description of your language's semantics. This is needed in order to prove that it's Turing complete.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your interpreter must correctly implement these semantics. (Or at least, it must be able to in principle, given infinite machine resources.) If someone finds a bug in your interpreter, your answer becomes invalid until it's fixed.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may not assume numerical types are of unlimited precision unless they actually are - be careful of integer overflow!&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Here is the precise grammar for programs as well as input and output strings:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;expr&amp;gt; ::= &amp;quot;(&amp;quot; &amp;lt;expr_list&amp;gt; &amp;quot;)&amp;quot;&#xA;&amp;lt;expr_list&amp;gt; ::= &amp;quot;&amp;quot; | &amp;lt;expr_list&amp;gt; &amp;lt;expr&amp;gt;.&#xA;&amp;lt;program&amp;gt; ::= &amp;lt;expr_list&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You can optionally replace the last line with&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;program&amp;gt; ::= &amp;lt;expr&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;which means there must always be an enclosing pair of parentheses. (So &lt;code&gt;()()&lt;/code&gt; and the empty string would not be valid programs, for example.) If you do this, you must do it for input and output strings, as well as programs.&lt;/p&gt;&#xA;&lt;p&gt;As mentioned above, &lt;code&gt;(&lt;/code&gt; and &lt;code&gt;)&lt;/code&gt; may be replaced with any two distinct characters.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox notes&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I've been obsessed with designing a simple and elegant language with these properties for some time, but I've never come up with one that really satisfied me. It occurred to me that &amp;quot;source code size of the interpreter&amp;quot; &lt;em&gt;might&lt;/em&gt; work as a proxy for simplicity and elegance, so I thought I'd give this a try. Suggestions for a better winning criterion (making it a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;) would be welcome.&lt;/p&gt;&#xA;&lt;p&gt;I'd also welcome suggestions for a snappier title.&lt;/p&gt;&#xA;" OwnerUserId="21034" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-20T12:30:05.307" CommentCount="20" ContentLicense="CC BY-SA 3.0" />
  <row Id="14860" PostTypeId="2" ParentId="2140" CreationDate="2018-02-19T19:45:22.900" Score="1" Body="&lt;h1&gt;The Euler Masheroni Constant&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The Euler Masheroni constant is a very interesting number. It is defined to be&#xA;&lt;a href=&quot;https://i.stack.imgur.com/ZvKTY.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZvKTY.png&quot; alt=&quot;&quot;&gt;&lt;/a&gt;&#xA;and appears seemingly everywhere in number theory. Famously, it is unknown whether it is rational, irrational, or transcendental.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Challenge:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Pretty simple one here: Given &lt;code&gt;N&lt;/code&gt;, your program should calculate the Euler Macaroni constant to at least &lt;code&gt;N&lt;/code&gt; decimal places of prescision. Your score will be the maximum value of &lt;code&gt;N&lt;/code&gt; for which the program is accurate, and ties will be won by the shortest code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For refrence, the Euler Macaroni constant to 50 places is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0.57721566490153286060651209008240243104215933593992&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Be sure to check out the wikipedia page for more formulas for the Oily Macaroni constant!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Euler%E2%80%93Mascheroni_constant&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://en.wikipedia.org/wiki/Euler%E2%80%93Mascheroni_constant&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76025" LastEditorUserId="76025" LastEditDate="2018-02-19T22:52:15.400" LastActivityDate="2018-02-19T22:52:15.400" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14863" PostTypeId="2" ParentId="14852" CreationDate="2018-02-20T16:47:21.760" Score="-1" Body="&lt;h3&gt;&lt;code&gt;g&lt;/code&gt;et is cheating, although the line is blurry&lt;/h3&gt;&#xA;&lt;p&gt;As mentioned in the OP, a prior thread about SMBF resulted in a clear consensus that using the tape values initialized to the source code character values was &amp;quot;cheating&amp;quot; and not a proper quine. It's a fairly strong consensus.&lt;/p&gt;&#xA;&lt;p&gt;However, a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13638/71434&quot;&gt;different&lt;/a&gt; meta question about Javascript resulted in an equally strong consensus that printing the string representation of a function's source code is valid. The question then becomes, what makes these two different, and which one is &lt;code&gt;g&lt;/code&gt;et more like?&lt;/p&gt;&#xA;&lt;p&gt;To put it simply, my interpretation of why the Javascript is valid is just because it accesses a string representation of a &lt;em&gt;function&lt;/em&gt; not the program. At least, that's the only distinction I can see between the two. In none of the example programs do I see any indication that the source code of a &lt;em&gt;function&lt;/em&gt; is read, but rather that the program's source code is available in full, just like SMBF. If we assume that both prior consensuses are still valid, then &lt;code&gt;g&lt;/code&gt;et must follow the SMBF precedent.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-20T16:47:21.760" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14866" PostTypeId="2" ParentId="2140" CreationDate="2018-02-20T18:48:39.443" Score="0" Body="&lt;h1&gt;Navigate my Taxi&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://bigzaphod.github.io/Taxi/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Taxi&lt;/a&gt; is an esoteric programming language simulating a taxi. You can pick up passengers (values) and drop them at special places to modify them. For example, &lt;a href=&quot;https://tio.run/##tVJLDoIwEN1zijkAIfGzYqkLVkYTuUDFoUxsWtKWKKfH8hMFYmRh0knnk/dm@jqWPaiqIgXWnQzhpIyFY5pSgiHc0QUrZwJT6zeeJp51bp0MvBMltyIHBjkzBiVHDVyR5DVh7Ah37IIiJZOhLgOvbTTOh2BUYbO5Vt8b7MtEKIk9bxeGIJWe0LXeWl5/IT4UwlIuKGGWlISzbe4BI5UTSy9BthPOV6fvf43pw9YV/iP1or8cLUfPP9mZOek7wQdE7LYOIqYZ/0CMBnoHV9XmCQ&quot; rel=&quot;nofollow noreferrer&quot;&gt;this program&lt;/a&gt; squares the input. The places are all in Townsburg:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://bigzaphod.github.io/Taxi/map-big.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/F6Vek.png&quot; alt=&quot;Map of Townsburg&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To travel from one place to another, you have to tell your taxi where to go:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Go to the Post Office: west 1st left, 1st right, 1st left.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And you need gas to drive, your car gets 18 miles per gallon. So it's best to find the shortest possible way between two places. That leads me to ...&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You get an incomplete Taxi program, consisting of the following statements:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;Pickup a[nother] passenger going to [the] &amp;lt;place&amp;gt;.&lt;/code&gt;: Pickup a passenger, you may ignore it for this challenge&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;&amp;lt;string&amp;gt;&quot; is waiting at [the] Writer's Depot.&lt;/code&gt; / &lt;code&gt;&amp;lt;number&amp;gt; is waiting at [the]&#xA;Starchild Numerology.&lt;/code&gt;: Create passengers, you may ignore this, too&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Go to [the] &amp;lt;place&amp;gt;.&lt;/code&gt;: Go to a place, you have to add directions (see below)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[&amp;lt;label&amp;gt;]&lt;/code&gt;: A label for jumping, you have to parse those to know where the taxi is. They don't do anything if passed. You can assume that you are in the same location, regardless of where you reach the label from.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Switch to plan &quot;&amp;lt;label&amp;gt;&quot;.&lt;/code&gt;: Unconditional jump, follow these to know where the taxi is&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Switch to plan &quot;&amp;lt;label&amp;gt;&quot; if no one is waiting.&lt;/code&gt;: Conditional jump, you have to support both ways&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If the input program contains anything else, you may do anything you want (undefined behaviour).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Conversion&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Following all jumping instructions, you have to add directions to the &lt;code&gt;Go to&lt;/code&gt; commands. It has to be the shortest possible way (I want to save gas!)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Directions consist of a cardinal direction (&lt;code&gt;north&lt;/code&gt;, &lt;code&gt;east&lt;/code&gt;, &lt;code&gt;south&lt;/code&gt;, &lt;code&gt;west&lt;/code&gt; or &lt;code&gt;NESW&lt;/code&gt;) and a comma-separated list of turns, consisting of a number (&lt;code&gt;1st 2nd 3rd&lt;/code&gt; or &lt;code&gt;1 2 3&lt;/code&gt;) and &lt;code&gt;left&lt;/code&gt;/&lt;code&gt;L&lt;/code&gt; or &lt;code&gt;right&lt;/code&gt;/&lt;code&gt;R&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Go to the Post Office: west 1st left, 1st right, 1st left.&#xA;Go to Post Office: W 1 L, 1 R, 1 L.&#xA;Go to Tom's Trims: N.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The cardinal directions do have the following meanings (x&lt;sub&gt;start&lt;/sub&gt; means x pos of the starting point, y&lt;sub&gt;end&lt;/sub&gt; means y pos of the next corner/intersection/place):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;north: y&lt;sub&gt;start&lt;/sub&gt; &gt; y&lt;sub&gt;end&lt;/sub&gt;&lt;/li&gt;&#xA;&lt;li&gt;south: y&lt;sub&gt;start&lt;/sub&gt; &amp;lt; y&lt;sub&gt;end&lt;/sub&gt;&lt;/li&gt;&#xA;&lt;li&gt;west: x&lt;sub&gt;start&lt;/sub&gt; &gt; x&lt;sub&gt;end&lt;/sub&gt;&lt;/li&gt;&#xA;&lt;li&gt;east: x&lt;sub&gt;start&lt;/sub&gt; &amp;lt; x&lt;sub&gt;end&lt;/sub&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;(Coordinates from the top left corner)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://pastebin.com/RYc3hxBV&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt; is a list of all intersections/corners/places/streets, extracted from the interpreter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some additional info:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The taxi starts at the Taxi Garage.&lt;/li&gt;&#xA;&lt;li&gt;If the taxi reaches the Taxi Garage, the program ends.&lt;/li&gt;&#xA;&lt;li&gt;If the program reaches its end and the taxi is not in the Taxi Garage, that's an error, so you'll have to add 'Go to the Taxi Garage: ...' at the end if it's missing.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program or function has to output a valid Taxi program (&lt;a href=&quot;https://tio.run/#Taxi&quot; rel=&quot;nofollow noreferrer&quot;&gt;online interpreter&lt;/a&gt;) or a list of instructions (which, when concatenated, form a valid Taxi program)&lt;/li&gt;&#xA;&lt;li&gt;You may use the long (north 1st left) or short (N 1 L) syntax.&lt;/li&gt;&#xA;&lt;li&gt;The ways chosen have to be the shortest possible (droven distance, i.e. sum of Euclidian distances between any two consecutive points on your way)&lt;/li&gt;&#xA;&lt;li&gt;If there are multiple equally long ways, you can use any of them&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Additional Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/78123&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden&lt;/li&gt;&#xA;&lt;li&gt;Your score is the number of bytes in your program&lt;/li&gt;&#xA;&lt;li&gt;Lowest score wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;TODO&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Is any part of the specs confusing?&lt;/li&gt;&#xA;  &lt;li&gt;Should I not input a full program, but just start and destination?&lt;/li&gt;&#xA;  &lt;li&gt;Should I add the map in some format as an additional input?&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="78123" LastEditorUserId="78123" LastEditDate="2018-03-31T13:15:15.780" LastActivityDate="2018-03-31T13:15:15.780" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="14867" PostTypeId="1" CreationDate="2018-02-20T20:05:52.550" Score="47" ViewCount="632" Body="&lt;p&gt;Programming Puzzles &amp;amp; Code Golf's &lt;a href=&quot;https://codegolf.stackexchange.com/election/2&quot;&gt;second moderator election&lt;/a&gt; has come to a close, the votes have been tallied, and the 2 new moderators are:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/45941&quot;&gt;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/45941.png&quot; alt=&quot;Mego&quot;&gt;&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/users/31716&quot;&gt;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/31716.png&quot; alt=&quot;DJMcMayhem&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;They'll be joining &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=moderators&quot;&gt;the existing crew&lt;/a&gt; shortly — please thank them for volunteering, and share your assistance and advice with them as they learn the ropes!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For details on how the voting played out, you can download the election results &lt;a href=&quot;https://codegolf.stackexchange.com/election/2&quot;&gt;here&lt;/a&gt;, or &lt;a href=&quot;https://www.opavote.com/results/4557875250724864/0&quot; rel=&quot;nofollow noreferrer&quot;&gt;view a summary report online&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="8534" LastEditorUserId="31716" LastEditDate="2018-03-08T21:51:01.327" LastActivityDate="2018-03-08T21:51:01.327" Title="2018 Community Moderator Election Results" Tags="|discussion|election|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="14868" PostTypeId="2" ParentId="14867" CreationDate="2018-02-20T20:12:50.720" Score="29" Body="&lt;p&gt;Thanks for all of the support during the election! I am proud to be a moderator of this fine site!&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2018-02-20T20:12:50.720" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14869" PostTypeId="1" CreationDate="2018-02-20T21:43:33.030" Score="8" ViewCount="210" Body="&lt;p&gt;I often prefer to improve other people' answers instead of writing one of my own (unless mine would be considerably different). To be entirely honest, I do this for petty selfish reasons - to show off that I can, to avoid having to explain the answer myself, &lt;s&gt;and maybe to gain some reputation&lt;/s&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The typical behaviour I observe then is they either suggest to me I should post a separate answer (which I, being lazy, refuse) or they credit my username with the number of characters I saved. That's why sometimes I only give clues, to make the author come up with the improvements alone, and to avoid complicating things.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What would be a good rule of thumb to tell if an improvement is worth posting as a separate answer?&#xA;From the PPCG community point of view, is an unexplained shorter solution preferable to an explained longer one?&#xA;Is credit necessary? &lt;s&gt;Wouldn't it be better to upvote the comment instead of @-mentioning in the answer?&lt;/s&gt;&lt;/p&gt;&#xA;" OwnerUserId="24908" LastEditorUserId="24908" LastEditDate="2018-02-20T22:05:41.307" LastActivityDate="2018-02-20T22:12:36.180" Title="Ethics around improving answers in comments" Tags="|discussion|" AnswerCount="1" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="14870" PostTypeId="2" ParentId="14869" CreationDate="2018-02-20T22:06:23.897" Score="18" Body="&lt;h2&gt;You are free to choose whether to comment or post your own answer&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There is absolutely no threshold upon submitting your own solutions, you are free to choose whether to leave a comment or post your own answer. Yeah, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10812/59487&quot;&gt;even duplicate answers are allowed&lt;/a&gt;! I personally comment:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the improvement(s) is/are relatively small.&lt;/li&gt;&#xA;&lt;li&gt;If I would not have been able devise my own answer to be shorter than the original one, without seeing it first.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I personally answer separately:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If I arrived at my solution independently, and if it is not identical to another answer that predates mine.&lt;/li&gt;&#xA;&lt;li&gt;(Sometimes) If the other user tells me that I should post it separately.&lt;/li&gt;&#xA;&lt;li&gt;If I feel like my improvement(s) is/are significant enough to warrant a separate answer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;When it comes to giving credit, I think it &lt;em&gt;is necessary&lt;/em&gt;. &lt;em&gt;Morally&lt;/em&gt; speaking, you should mention those that helped improving your post, regardless of how significant their suggestions were. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Giving clues instead of spoiling is also &lt;em&gt;completely fine&lt;/em&gt;. That might also incentivize competition, which is definitely in the spirit of PPCG.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;From the PPCG community point of view, is an unexplained shorter solution preferable to an explained longer one?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Of course, explanations are encouraged, but not strictly necessary. No solution is preferable over another one, as long as both meet our rules.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="59487" LastEditDate="2018-02-20T22:12:36.180" LastActivityDate="2018-02-20T22:12:36.180" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14871" PostTypeId="1" AcceptedAnswerId="14875" CreationDate="2018-02-21T14:41:29.640" Score="14" ViewCount="455" Body="&lt;p&gt;We've got &lt;a href=&quot;https://codegolf.stackexchange.com/q/8369/8478&quot;&gt;a fairly old challenge&lt;/a&gt; about the &lt;a href=&quot;http://oeis.org/A000002&quot; rel=&quot;nofollow noreferrer&quot;&gt;Kolakoski sequence&lt;/a&gt;. Unfortunately, the challenge is fairly restrictive in its I/O requirements: in particular, input &lt;em&gt;has&lt;/em&gt; to be taken via command-line argument. This prevents most esolangs from competing entirely, which I think is a shame for such a popular (and fun) integer sequence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we post a new version of this challenge, which allows all of our standard I/O methods to allow all languages to participate? While we're at it, we could also relax the output requirements to the recent trend of letting the answerers choose between a) given &lt;strong&gt;n&lt;/strong&gt; output &lt;strong&gt;a(n)&lt;/strong&gt;, b) given &lt;strong&gt;n&lt;/strong&gt; output the first &lt;strong&gt;n&lt;/strong&gt; terms and c) print the sequence indefinitely.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The old challenge could either be closed as a duplicate of the new one, or it could be merged into the new one as all the old answers would still be valid. However, they'd likely all be suboptimal (except in languages where reading from command-line arguments is shortest anyway). Since there are only 11 answers, I don't think it's a big deal either way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Of course, we could just edit the old challenge, but the OP doesn't seem to want to make this change, specifically because it would make the existing answers unnecessarily suboptimal.)&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="8478" LastEditDate="2018-03-06T11:43:16.747" LastActivityDate="2018-03-06T11:43:16.747" Title="Should we repost the Kolakoski challenge?" Tags="|discussion|status-completed|specific-question|reposting|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14873" PostTypeId="2" ParentId="14871" CreationDate="2018-02-21T17:01:34.370" Score="3" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;The old challenge could either be closed as a duplicate of the new one, or it could be merged into the new one as all the old answers would still be valid. However, they'd likely all be suboptimal (except in languages where reading from command-line arguments is shortest anyway).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;There is at least &lt;a href=&quot;https://codegolf.stackexchange.com/a/8376/194&quot;&gt;one answer&lt;/a&gt; which also gave a version with more idiomatic input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More to the point, although the OP is privileged in some regards (e.g. with respect to notifications), it has always been the case that when we post on a Stack Exchange site we grant a licence to edit the content. There is a sense in which the &lt;em&gt;content&lt;/em&gt; belongs to its author(s), but the &lt;em&gt;post&lt;/em&gt; belongs to the community. So it is legitimate to weigh the OP's desire to use a specific input format to disadvantage golfing languages against what's best for the community as a whole.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Considering the options:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Creating a duplicate is to the detriment of the OP (whose question, being closed, loses relevance and is unlikely to attract many more upvotes) and of the community (the answers from the old question can be reposted with trivial modifications, and explanations of answers like the &lt;a href=&quot;https://codegolf.stackexchange.com/a/26560/194&quot;&gt;J one&lt;/a&gt; get duplicated; but if answers aren't reposted then people have to look at multiple pages to see what they're competing against).&lt;/li&gt;&#xA;&lt;li&gt;Merging the old question into a new one sorts out the duplication / dilution issue, but is to the detriment of the OP (who keeps rep from votes older than a few months, but definitely won't receive any more).&lt;/li&gt;&#xA;&lt;li&gt;Editing the question also sorts out the duplication / dilution issue; its effect on the OP is more nuanced, because their explicitly stated wishes are being overridden but fresh activity on the question is likely to bring upvotes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Of these three options, the last seems to be the one which best balances advantages and disadvantages to the OP and the community.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-02-21T17:01:34.370" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14874" PostTypeId="2" ParentId="2140" CreationDate="2018-02-21T17:40:12.670" Score="1" Body="&lt;h3&gt;Find Graph Isomorphism&lt;/h3&gt;&#xA;&lt;h3&gt;Meta:&lt;/h3&gt;&#xA;&lt;p&gt;I don't know whether there are any known algorithms for solving this problem, that also means I'm not sure whether this is an interesting challenge.&#xA;EDIT: Ok it is probably &lt;a href=&quot;https://en.wikipedia.org/wiki/Graph_canonization&quot; rel=&quot;nofollow noreferrer&quot;&gt;equally hard&lt;/a&gt; as the graph isomorphism problem.&lt;/p&gt;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://puzzling.stackexchange.com/questions/60813/how-to-solve-elastic-band-puzzles&quot;&gt;this puzzle&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graph-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graph-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;graph-theory&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given two isomorphic directed (unweighted) graphs with labelled nodes, find an isomorphism between the two graphs.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You have to provide a working implementation of your algorithm.&lt;/li&gt;&#xA;&lt;li&gt;You have to provide the complexity expressed in the number of nodes, edges (or possibly other numbers?)&lt;/li&gt;&#xA;&lt;li&gt;The graphs can be represented as an adjecency matrix, as set of pairs that represent edges, as an adjecency list or as a native graph type etc.&lt;/li&gt;&#xA;&lt;li&gt;The output can be a function that maps the labels of one graph to the labels of the other, as a list as a graph etc.&lt;/li&gt;&#xA;&lt;li&gt;If necessary, you can assume that there are no edges with the same start as end node.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;to be added...&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-21T17:55:06.517" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14875" PostTypeId="2" ParentId="14871" CreationDate="2018-02-21T20:04:39.300" Score="11" Body="&lt;h1&gt;Yes, let's repost&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The restrictive I/O format has been pointed out in the comments and the OP has responded.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;That's a &lt;a href=&quot;http://meta.codegolf.stackexchange.com/a/8077/45941&quot;&gt;cumbersome I/O format&lt;/a&gt; that makes many languages unable to participate. – &lt;a href=&quot;https://codegolf.stackexchange.com/users/45941/mego&quot;&gt;Mego♦&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/8369/generate-a-kolakoski-sequence#comment187369_8369&quot;&gt;Apr 2 '16 at 5:26&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;@Mego thanks for the tip. but in fairness to the current submissions, let's not go changing preferential specs on a 4 year old question – &lt;a href=&quot;https://codegolf.stackexchange.com/users/3348/ardnew&quot;&gt;ardnew&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/8369/generate-a-kolakoski-sequence#comment187501_8369&quot;&gt;Apr 2 '16 at 20:01&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;While reposting the challenge affects the OP negatively, if they do not want to edit it, I think it's preferable to respect their wishes and post a new challenge. While relaxing the input method alone might be a justifiable edit, changing everything from allowing functions to allowing infinite output is a rather drastic change that shouldn't happen without the consent of the OP.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2018-02-21T20:04:39.300" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14876" PostTypeId="1" CreationDate="2018-02-21T21:33:37.523" Score="90" ViewCount="2027" Body="&lt;p&gt;If you're new around here, chances are you might not even know who I am. I'm Alex, and I'm a (soon to be ex-) moderator on this site. At first I was a user just like you, enthusiastic about the site, then I became a moderator &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5846/20469&quot;&gt;&lt;em&gt;pro tempore&lt;/em&gt;&lt;/a&gt;, and then I was &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8910/20469&quot;&gt;elected&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's no secret that I haven't been active much in the last year or so. This is for a multitude of personal reasons, none of which have to do with the site or the community itself. I had been considering formally resigning as a PPCG moderator for quite some time, but I held out hope for a while that I'd be able to dedicate more time to the site in the future, so I held off. A couple months ago I finally decided to contact a Stack Exchange community manager and request to resign. The CM asked if I could wait until the next moderator election, at which point the baton could be formally passed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now here we are. We have two &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14867/20469&quot;&gt;incredible new moderators&lt;/a&gt; joining our other fantastic folks. The reason why we have two slots for moderators is because one of them is replacing me. It hasn't happened quite yet, but sometime soon the little diamond next to my name will disappear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not dying or anything, you'll probably still see my little bird avatar pop up from time to time to post an answer in Julia. But the moderation will now rest solely in the very capable hands of the new and existing mods. I'm quite confident that the new mod team will be able to serve the community better than I ever have.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm &lt;em&gt;immensely&lt;/em&gt; grateful for the fun and support this community has given me over the years. PPCG is a very unique place full of incredibly smart and talented people, and I'm honored to have had the opportunity to moderate it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now go forth and golf!&lt;/p&gt;&#xA;" OwnerUserId="20469" LastEditorUserId="66833" LastEditDate="2021-01-02T01:42:23.907" LastActivityDate="2021-01-02T01:42:23.907" Title="A farewell to moderation" Tags="|discussion|moderation|moderators|" AnswerCount="3" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="14877" PostTypeId="2" ParentId="14876" CreationDate="2018-02-21T23:06:45.197" Score="65" Body="&lt;p&gt;It's been an absolute pleasure to moderate PPCG at your side. Whether I needed a second opinion on some moderation issue, help with some Julia code, or just a sympathetic ear, you've been there for me countless times.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While I understand your reasons to retire, I selfishly wish you would come back full-time. All of us who have been fortunate enough to know you will forever feel your absence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Farewell, Alex A. ♦!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&lt;a href=&quot;https://i.stack.imgur.com/N6lu5.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/N6lu5.jpg&quot; alt=&quot;Magman&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2018-02-21T23:06:45.197" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14878" PostTypeId="2" ParentId="2140" CreationDate="2018-02-21T23:08:52.740" Score="2" Body="&lt;h1&gt;Evil Overlord, Part 1: Moon Base Scouting&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-time&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-time&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-time&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm starting these &quot;Evil Overlord&quot; challenges as a way to experiment with non-golf scoring. Though I may have one or two code golf challenges.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;If you're going to be an evil overlord, there are 2 things that you need: an inner sanctum, and mad-science tech.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To fill these requirements, your science minions have developed a fusion reactor, and Elon Musk has agreed to help you establish a Moon base. Now you just need to pick a spot.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These are the criteria that will be used:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You'll need some Helium-3 to power your reactor, so scoring will be based on proximity to deposits. More on this under Scoring.&lt;/li&gt;&#xA;&lt;li&gt;It cannot be on the far side of the Moon, because then you won't have comms to deliver ultimatums with.&lt;/li&gt;&#xA;&lt;li&gt;Elon Musk has given you a tight deadline (that absolutely MUST be followed), so you have a runtime limit. Details under Restrictions.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your input will be a list of &lt;sup&gt;3&lt;/sup&gt;He deposits, with information on size and location. Some will be on the far hemisphere.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You should output a single coordinate for where the Moon base should be. It can't be on the far side, but you can still collect &lt;sup&gt;3&lt;/sup&gt;He from there.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Coordinates and Distances&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The coordinates in the test cases are radial coordinates from a pole at the center of the visible hemisphere. You can use a different coordinate system (e.g. use a map projection) but please specify it if you do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since this is a sphere, calculating distances is done with the following equation that I shamelessly stole from &lt;a href=&quot;https://en.m.wikipedia.org/wiki/Spherical_law_of_cosines&quot; rel=&quot;nofollow noreferrer&quot;&gt;this Wikipedia article&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;cos(&lt;em&gt;c&lt;/em&gt;) = cos(&lt;em&gt;a&lt;/em&gt;)cos(&lt;em&gt;b&lt;/em&gt;)+sin(&lt;em&gt;a&lt;/em&gt;)sin(&lt;em&gt;b&lt;/em&gt;)cos(&lt;em&gt;C&lt;/em&gt;)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;For our purposes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;a&lt;/em&gt; and &lt;em&gt;b&lt;/em&gt; are the latitudes from the pole.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;c&lt;/em&gt; is the angular distance between the points.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;C&lt;/em&gt; is the difference in longitude between the points.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Restrictions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;To do. I don't remember the specs of the computer I have in mind, and I don't know what a reasonable time limit would be.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You will be scored by the amount of Helium-3 that you can mine. The formula for how much you get from a single deposit is as follows:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/745Rb.png&quot; alt=&quot;p=s\cdot\cos^2\left({\frac{\pi d}{2}}\right)\cdot\left(1-e^{-1/d}\right)^2&quot;&gt;&lt;br&gt;&#xA;&lt;sup&gt;&lt;sup&gt;(There's no real reason for this specific formula; I liked the curve it produced is all.)&lt;/sup&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;d&lt;/em&gt; is the angular distance calculated between the two points, in radians; &lt;em&gt;s&lt;/em&gt; is the size of the deposit. Deposits more than 1 radian away don't give you anything.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test Cases and Winning&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Beta generator for test cases, for which I'd appreciate debugging in the Sandbox:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;function makeTestCase(deposits) {&#xD;&#xA;    var depositList = Array(deposits);&#xD;&#xA;    for (var i = 0; i &amp;lt; deposits; i++) {&#xD;&#xA;        var point = getSphericalPoint();&#xD;&#xA;        depositList[i] = [point[0], point[1], getDistNum()];&#xD;&#xA;    }&#xD;&#xA;    return depositList;&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function getSphericalPoint() {&#xD;&#xA;    const pointgen = () =&amp;gt; Math.random() * 2 - 1;&#xD;&#xA;    do {&#xD;&#xA;        var [x, y, z] = [pointgen(), pointgen(), pointgen()];&#xD;&#xA;    } while (x*x + y*y + z*z &amp;gt;= 1);&#xD;&#xA;    return [Math.atan(y / Math.sqrt(x*x + z*z)), Math.atan2(x, z)];&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function getDistNum() {&#xD;&#xA;    return Math.sqrt(-1 / Math.log(Math.random()));&#xD;&#xA;}&#xD;&#xA;try {&#xD;&#xA;console.log(makeTestCase(10));&#xD;&#xA;} catch (e) {&#xD;&#xA;    console.log(e.message);&#xD;&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The test cases will be arranged as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A test case with only a few deposits, with a heatmap showing score for each point.&lt;/li&gt;&#xA;&lt;li&gt;A few test cases with a few dozen deposits each, for debugging.&lt;/li&gt;&#xA;&lt;li&gt;Test cases and a generator for them with 100+ deposits each.&lt;/li&gt;&#xA;&lt;li&gt;10 or so &lt;em&gt;ranked&lt;/em&gt; test cases (made with the above generator) that determine the winner. Until I evaluate the submissions, I will only post hashes of them.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Definitely has a long ways to go before it's ready to post, but I'd like to know if this has merit as a challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To-do:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Establish some test cases.&lt;/li&gt;&#xA;&lt;li&gt;Figure out the specs of the machine in question.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Once that's done, figure out a good time limit.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Solidify the scoring formula—something better I can use?&lt;/li&gt;&#xA;&lt;li&gt;Figure out some tags.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="62402" LastEditorUserId="62402" LastEditDate="2018-04-09T19:17:33.267" LastActivityDate="2018-04-09T19:17:33.267" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="14879" PostTypeId="2" ParentId="14876" CreationDate="2018-02-21T23:24:18.253" Score="34" Body="&lt;p&gt;I remember the very first time I used SE chat, the first person to ever say anything to me was a &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/21463172#21463172&quot;&gt;friendly welcome by a bird avatar.&lt;/a&gt; I slowly started to use chat more and more often, and I had lots of good conversations with Alex. Which is one of the reasons I started using chat so much. And after becoming completely addicted to talking with my new friends in TNB, I also became addicted to using PPCG. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now almost 3 years later, I'm transitioning into replacing you. (Or Mego is replacing you, I'm not sure which one of us it's supposed to be :P) It's a bittersweet moment. You were a very friendly, fun, and welcoming user in chat, and largely one of the reasons I have a diamond next to my name now. You have done a lot for this little corner of the internet where a bunch of nerds get together to write horrible code for fun. I hope that I will be able to live up to the excellent example you have set not just as a moderator, but also as a regular user in main and on chat. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I hope I speak for everyone when I say that I wish you well, and I hope that the next time you come back to visit us, you'll see a happy, healthy, and growing community. :)&lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2018-02-21T23:24:18.253" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14880" PostTypeId="2" ParentId="14876" CreationDate="2018-02-22T00:32:00.477" Score="39" Body="&lt;p&gt;When I first joined the site, I was quickly drawn in by the extremely friendly community. I distinctly remember Alex frequently being in chat, having a good time with the other chat users, but not hesitating to speak up when someone crossed a line somewhere. That has stuck with me as the ideal that all community members, and especially moderators, should live up to: friendly, helpful, but firm when enforcing rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I wasn't always the friendly penguin that I am now. I used to be rude and abrasive, though not intentionally. Seeing the moderators, especially Alex, lead by example helped me become a nicer, friendlier, more postively-contributing member of the community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm sad to see Alex go, though I completely understand the reasons. Life has a way of catching up to you - it's funny like that. I only hope that I can be half the moderator and the positive influence that Alex has been these past few years.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fly free, fellow bird.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2018-02-22T00:32:00.477" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14882" PostTypeId="2" ParentId="6918" CreationDate="2018-02-22T21:03:59.277" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/robbie0630/BFZip&quot; rel=&quot;nofollow noreferrer&quot;&gt;BFZip&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;While not technically a programming language, I made this to help Brainfuck golfers to reduce their byte count.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, there are some glaring &lt;a href=&quot;https://github.com/robbie0630/BFZip/issues&quot; rel=&quot;nofollow noreferrer&quot;&gt;issues&lt;/a&gt; that make this unusable. I would appreciate any help with fixing them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can still calculate the bytes hypothetically if you use this formula, where &lt;code&gt;n&lt;/code&gt; is the original byte count: &lt;code&gt;&amp;lceil;3&amp;sdot;&lt;sup&gt;n&lt;/sup&gt;&amp;frasl;&lt;sub&gt;8&lt;/sub&gt;&amp;rceil;&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="38078" LastEditorUserId="38078" LastEditDate="2018-02-23T22:43:40.987" LastActivityDate="2018-02-23T22:43:40.987" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14884" PostTypeId="2" ParentId="2140" CreationDate="2018-02-23T13:43:39.063" Score="0" Body="&lt;h1&gt;Convert a number to (Name-To-Be-Specified)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(Name-To-Be-Specified) is a completely made up language. It uses a Senary (base 6) system of numbers with words for those numbers structured in a similar way to English. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;0 to 6&lt;/strong&gt;&lt;br&gt;&#xA;Single digit numbers use a single word for each digit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;0 = &quot;zeeroo&quot;&lt;br&gt;&#xA;1 = &quot;nimbo&quot;&lt;br&gt;&#xA;2 = &quot;feta&quot;&lt;br&gt;&#xA;3 = &quot;tarumba&quot;&lt;br&gt;&#xA;4 = &quot;ntamno&quot;&lt;br&gt;&#xA;5 = &quot;waramaka&quot;&lt;br&gt;&#xA;(Any similarity to Kómnzo numbers are coincidental.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;6 to 11&lt;/strong&gt;&lt;br&gt;&#xA;The first set of two-digits numbers have special rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;6 = &quot;wi&quot;&lt;br&gt;&#xA;7 = &quot;seeveen&quot;&lt;br&gt;&#xA;8 = &quot;ayte&quot;&lt;br&gt;&#xA;9 = &quot;tarumbawin&quot;&lt;br&gt;&#xA;10 = &quot;ntamnowin&quot;&lt;br&gt;&#xA;11 = &quot;waramakawin&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;12 to 35&lt;/strong&gt;&lt;br&gt;&#xA;Multiples of 6 have the single digit word with a &quot;wee&quot; suffix.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;12 = &quot;fetawee&quot;&lt;br&gt;&#xA;18 = &quot;tarambawee&quot;&lt;br&gt;&#xA;24 = &quot;ntamnowee&quot;&lt;br&gt;&#xA;30 = &quot;waramakawee&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Other numbers in this range are made by joining the word for the multiple of 6 with the word for single digit number, separated by a space. For example:&lt;br&gt;&#xA;13 = &quot;fetawee nimbo&quot;&lt;br&gt;&#xA;20 = &quot;tarambawee feta&quot;&lt;br&gt;&#xA;27 = &quot;ntamnowee taramba&quot;&lt;br&gt;&#xA;34 = &quot;waramakawee ntamno&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;36 to 1295&lt;/strong&gt;&lt;br&gt;&#xA;&lt;strong&gt;1296 to 46655&lt;/strong&gt;&lt;br&gt;&#xA;&lt;strong&gt;46656 to 1679615&lt;/strong&gt;&lt;br&gt;&#xA;&lt;strong&gt;1679616 to 60466175&lt;/strong&gt;&lt;br&gt;&#xA;(Since this is a sandbox, I'll leave these to-be-specified for now. Suffice to say I'll come up with words for each and consistent rules for joining them together and when you need the word &quot;and&quot;.)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program that takes an integer as input and outputs that number in (Name-To-Be-Specified) words as described above. Shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="20793" LastEditorUserId="20793" LastEditDate="2018-02-23T14:04:22.690" LastActivityDate="2018-02-23T14:04:22.690" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14885" PostTypeId="2" ParentId="1213" CreationDate="2018-02-23T18:24:11.307" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://autohotkey.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;AutoHotkey&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;AutoHotkey is an open source Turing complete scripting language that can be compiled. It's often used to remap keys, automate batch boring jobs, or cheat in video games. It's similar to AutoIt but much less strict, allowing both a C-like syntax or natural language, see the &lt;a href=&quot;http://lexikos.github.io/v2/docs/AutoHotkey.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Documentation&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Installation:&lt;/h3&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://autohotkey.com/download/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Download&lt;/a&gt;, available on windows only.&lt;/li&gt;&#xA;&lt;li&gt;Save as .ahk and it can be run through the exe or dll.&lt;/li&gt;&#xA;&lt;li&gt;If you want to compile the script; run ./Compiler/Ahk2Exe.exe&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="71883" LastActivityDate="2018-02-23T18:24:11.307" CommentCount="0" CommunityOwnedDate="2018-02-23T18:24:11.307" ContentLicense="CC BY-SA 3.0" />
  <row Id="14886" PostTypeId="2" ParentId="2140" CreationDate="2018-02-23T18:56:26.880" Score="3" Body="&lt;p&gt;How acceptable is it to base challenges off of pre-existing challenges? I saw the challenge for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/156245/code-golf-your-own-pet-ascii-snake&quot;&gt;Your Own Pet Ascii Snake&lt;/a&gt; and had a thought about making the output look more 'snakelike' by printing the characters |,\,/,(,),_ instead of always using the + character.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's how it would work. You would get some positive, negative, and 0 numbers as input, and based on those numbers, the snake moves one row down and that many characters in that direction. So, for a snake like the ones in the previous problem, your array would be restricted to the numbers 0, 1, and -1. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are the rules to draw the snake, the characters you print are dependent on the spacing of the lines before and after it. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, say your snake is at position n (in the previous problem, n=30 to start, in this one you need to figure out a number for n that will keep your entire snake on the screen),  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;if the input is 0 you print n-1 spaces and a &lt;code&gt;|&lt;/code&gt;&lt;br&gt;&#xA;if the input is +1 you print n spaces and a &lt;code&gt;\&lt;/code&gt;&lt;br&gt;&#xA;if the input is +2 you print n spaces and &lt;code&gt;\_&lt;/code&gt;, +10 would be &lt;code&gt;\_________&lt;/code&gt; (9 &lt;code&gt;_&lt;/code&gt; and a backslash)&lt;br&gt;&#xA;if the input is -1 you print n-2 spaces and  &lt;code&gt;/&lt;/code&gt;&lt;br&gt;&#xA;if the input is -2 you print n-3 spaces and &lt;code&gt;_/&lt;/code&gt;, -10 would be &lt;code&gt;_________/&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's an example snake based on this array &lt;code&gt;[+4, -3, +1, -4, +2, -3, +2, +5, -4, -1, -2, 0, +4, -4]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;                        |&#xA;                         \___&#xA;                          __/&#xA;                          \&#xA;                       ___/&#xA;                       \_&#xA;                      __/&#xA;                      \_&#xA;                        \____&#xA;                        ____/&#xA;                       /&#xA;                     _/&#xA;                    |&#xA;                     \___&#xA;                     ___/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I could also add optional 'curvy' rules that would include the '(' and ')' characters on direction changes to produce a snake like this, based on the same array above:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;                         |&#xA;                         \___&#xA;                          ___)&#xA;                         (_&#xA;                       ____)&#xA;                      (__&#xA;                      ___)&#xA;                     (__&#xA;                        \____&#xA;                        _____)&#xA;                       /&#xA;                     _/&#xA;                    (&#xA;                     \___&#xA;                     ____)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;note that for the curvy snake, 0s are handled differently depending on if there is a direction change in the rows above and below them, here there is a negative, 0, positive pattern, so we use a '(', if there were no direction change we'd use a |, and in the opposite pattern, a ')'  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are spaces to the left of my example snake because I didn't want to count out how many spaces I should leave exactly, I don't know whether it should be mandatory to cut out extra whitespace to the left, or whether to let people have as much or as little whitespace as they want, provided that their snake doesn't 'go off screen'&lt;/p&gt;&#xA;" OwnerUserId="78497" LastEditorUserId="78497" LastEditDate="2018-02-23T21:19:50.360" LastActivityDate="2018-02-23T21:19:50.360" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14887" PostTypeId="2" ParentId="14852" CreationDate="2018-02-24T17:36:10.640" Score="2" Body="&lt;h1&gt;If the read value depends on the original source code, then it reads the source code&lt;/h1&gt;&#xA;&lt;p&gt;For example, in a self-modifying language, if the source code has not been modified since the program has started, then &lt;strong&gt;executing&lt;/strong&gt; &lt;code&gt;g&lt;/code&gt;et would always count as reading your source code.&lt;/p&gt;&#xA;&lt;p&gt;Another example that counts as reading your source is if &lt;code&gt;g&lt;/code&gt;et reads a byte which has only been incremented since the start of the program, thus still depending on the original source code.&lt;/p&gt;&#xA;&lt;p&gt;An example which doesn't count as reading your source code is if &lt;code&gt;g&lt;/code&gt;et reads a byte which has been replaced with another byte which doesn't depend on the program's source code itself, for example &lt;code&gt;g&lt;/code&gt;et reading a byte which has been replaced with &lt;code&gt;@&lt;/code&gt;, then incremented to &lt;code&gt;A&lt;/code&gt;, since the &lt;code&gt;@&lt;/code&gt; hasn't been inferred from the &lt;strong&gt;original&lt;/strong&gt; source code itself via &lt;code&gt;g&lt;/code&gt;etting.&lt;/p&gt;&#xA;&lt;h3&gt;Examples with &amp;gt;&amp;lt;&amp;gt; programs&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;01go;&#xA;X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This pushes &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt; to the stack (&lt;code&gt;01&lt;/code&gt;), then pops those two values and reads (&lt;code&gt;g&lt;/code&gt;) the character at that 0-indexed (y, x) position (1, 0) in the (possibly modified) source code (&lt;code&gt;X&lt;/code&gt; in this case), prints it (&lt;code&gt;o&lt;/code&gt;) and then exits (&lt;code&gt;;&lt;/code&gt;). &lt;a href=&quot;https://tio.run/##S8sszvj/38AwPd@aK@L/fwA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;&amp;gt;&amp;lt;&amp;gt; – Try It Online&quot;&gt;Try it online!&lt;/a&gt; Try changing the &lt;code&gt;X&lt;/code&gt; to another character, and you'll see that the printed character changes accordingly. Thus, it's evident that &lt;code&gt;g&lt;/code&gt; reads part of the original source code.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;01g1+01p01go;&#xA;@&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This &lt;code&gt;g&lt;/code&gt;ets the character at position (1, 0) of the source as before (&lt;code&gt;01g&lt;/code&gt;), increments it (&lt;code&gt;1+&lt;/code&gt;), then replaced the character at position (1, 0) of the source with the incremented character (&lt;code&gt;01p&lt;/code&gt;), then again gets the character at (1, 0) (&lt;code&gt;01g&lt;/code&gt;), and finally prints it and exits (&lt;code&gt;o;&lt;/code&gt;). &lt;a href=&quot;https://tio.run/##S8sszvj/38Aw3VDbwLAASOdbczn8/w8A&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;&amp;gt;&amp;lt;&amp;gt; – Try It Online&quot;&gt;Try it online!&lt;/a&gt; As before, if you change the &lt;code&gt;@&lt;/code&gt; to a different character the result will also change. Again, you can see &lt;code&gt;g&lt;/code&gt; reads from the original source.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;f4*4+01p01go;&#xA;I&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This pushes 15 (&lt;code&gt;f&lt;/code&gt;), multiplies it by 4 (&lt;code&gt;4*&lt;/code&gt;) and then adds 4 (&lt;code&gt;4+&lt;/code&gt;), resulting in 64, then puts the character with that ASCII code (i.e. &lt;code&gt;@&lt;/code&gt;) on (1, 0) (&lt;code&gt;01p&lt;/code&gt;), then gets the character at (1, 0) (&lt;code&gt;01g&lt;/code&gt;), prints it and exits (&lt;code&gt;o;&lt;/code&gt;). &lt;a href=&quot;https://tio.run/##S8sszvj/P81Ey0TbwLDAwDA935rL8/9/AA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;&amp;gt;&amp;lt;&amp;gt; – Try It Online&quot;&gt;Try it online!&lt;/a&gt; In this case, if you try changing the &lt;code&gt;I&lt;/code&gt; to another character, the output won't change. This is because, regardless of what character you change it to, it will be always replaced with &lt;code&gt;@&lt;/code&gt;, therefore making it not count as part of the original source code anymore.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-24T17:36:10.640" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14888" PostTypeId="2" ParentId="2140" CreationDate="2018-02-24T18:45:50.767" Score="1" Body="&lt;h1&gt;American Checkers AKA English Draughts&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a king of the hill challenge for checkers/draughts enthusiasts.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;Note: All code below is written in F#&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;For this game, I am using the rules from &lt;a href=&quot;http://www.usacheckers.com/rulesofcheckers.php&quot; rel=&quot;nofollow noreferrer&quot;&gt;The American Checker Federation&lt;/a&gt; (Note: it tries to download a .doc file). The relevant rules are listed below.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Moving&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Checkers move forward diagonally one square.&lt;br /&gt;&#xA;Kings move diagonally one square in any direction.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Capturing&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Capturing is required in this variant.&lt;/em&gt;&lt;br /&gt;&#xA;Checkers jump forward diagonally two squares; they may only jump over an opponent's piece onto a blank square and continue jumping until there are no more pieces to jump, or until they reach the king row.&lt;/p&gt;&#xA;&lt;p&gt;King jumps follow the same pattern as checkers jumps, but do not have the restriction on moving forward.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Winning&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The game is won when one player has no more pieces or cannot make any more moves.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Draws&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A draw is declared when the same position is reached three times or when neither player moves an unkinged checker for 40 moves and there are no captures in those forty moves.&lt;/p&gt;&#xA;&lt;h2&gt;Play&lt;/h2&gt;&#xA;&lt;p&gt;Each program will take a list of the game history in the form of a &lt;code&gt;PdnTurn list&lt;/code&gt; (&lt;a href=&quot;https://en.wikipedia.org/wiki/Portable_Draughts_Notation&quot; rel=&quot;nofollow noreferrer&quot;&gt;Read about PDN notation here&lt;/a&gt;):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;type PieceType = Checker | King&#xA;type PdnMove = { Move :int list; ResultingFen :string; DisplayString :string; PieceTypeMoved :PieceType Option }&#xA;type PdnTurn = { MoveNumber :int; BlackMove :PdnMove; WhiteMove :PdnMove Option }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;It will return the data in the form of a list of &lt;code&gt;int&lt;/code&gt;s, where each &lt;code&gt;int&lt;/code&gt; represents a square on the board. That is, if you have a piece on square 1 and intend to jump to square 10 over a piece on square 6, your program will return &lt;code&gt;[1; 10]&lt;/code&gt; (notation as an F# list). If any player returns an invalid move, they forfeit the game.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Each player will play three games against each opponent; each win will be scored as 1, each loss as 0, and each draw as 1/2. The loser of the match will be disqualified. At the end of the tournament, the player(s) with the highest score win.&lt;/p&gt;&#xA;&lt;h2&gt;The Tournament &lt;em&gt;(incomplete)&lt;/em&gt;:&lt;/h2&gt;&#xA;&lt;p&gt;I set up a website at checkerstreasury.azurewebsites.net. Communication from the server to the player is done with SignalR preferring websockets (you can probably just use websockets without SignalR, but I don't know how). Communication from the player to the server is done with POST requests. I am at work now, but I will post the API and finalize this later.&lt;/p&gt;&#xA;&lt;p&gt;This challenge feels incomplete; am I missing something?&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Question:&lt;/strong&gt; I have my own AI implemented alongside my controller. I intend on submitting this as a base submission, but will not award it the win even if it is the king of the hill. Should I include it in the question, or as an answer? If an answer, should I post it with the question, or wait a while?&lt;/p&gt;&#xA;" OwnerDisplayName="user10766" LastEditorUserId="-1" LastEditorDisplayName="user10766" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-06-18T13:15:02.343" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="14889" PostTypeId="1" AcceptedAnswerId="14891" CreationDate="2018-02-25T01:13:30.977" Score="13" ViewCount="549" Body="&lt;p&gt;I've been lurking for quite a while and have realized (after a technical interview) that I'm really out of practice solving problems like what is here. Is there a language that you recommend I start with? I'm a Python enthusiast (and I know Java and PowerShell) and I plan to try and golf with it, but I'd like to learn some golfing languages too, because I love learning stuff.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What would be a good one to start with?&lt;/p&gt;&#xA;" OwnerUserId="65917" LastEditorUserId="61563" LastEditDate="2018-03-07T02:57:41.240" LastActivityDate="2018-03-09T05:57:45.063" Title="Getting Started" Tags="|discussion|answers|new-users|" AnswerCount="5" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="14891" PostTypeId="2" ParentId="14889" CreationDate="2018-02-25T02:52:38.413" Score="12" Body="&lt;h1&gt;Start with your familiar language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You'll find that if you start off with learning a new golfing language right away, you'll find it rather difficult to create competitive solutions. That's completely normal; since you're new to Code Golf, your mindset is still set to practical uses. Instead of learning a new language right away, I would recommend that you start by looking for golfing tips in your own familiar language. That way, you're working with a language you've known for a while, and you can focus on learning the code golf mindset. It will also be interesting to see what can be done in the languages you know that you've never seen before.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Then, learn some more intuitive languages&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Then, after you've become somewhat experienced with golfing in your own language and you're starting to get the hang of golfing ideas and thought processes, you can start learning a language. For a beginner at golfing languages, I would recommend you start by learning something like &lt;a href=&quot;https://github.com/Adriandmen/05AB1E&quot; rel=&quot;nofollow noreferrer&quot;&gt;05AB1E&lt;/a&gt; or &lt;a href=&quot;https://github.com/Mego/Seriously&quot; rel=&quot;nofollow noreferrer&quot;&gt;Seriously/Actually&lt;/a&gt;, which are two stack-based golfing languages that have relatively simple syntax. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each golfing language has its own mindset and structure.  Different languages often have shorter ways to solve tasks, such as Jelly and Python.  Getting the Nth triangular number in Python could be &lt;code&gt;lambda n:n*~-n&lt;/code&gt; but in Jelly would be &lt;code&gt;RS&lt;/code&gt;, as in &lt;code&gt;sum(range(n))&lt;/code&gt;.  Different languages also use different memory structures (i.e. tapes vs stacks) and specialize in different things. For example, Charcoal specializes in ASCII art, compared to 05AB1E for sequences. You may not always win a challenge with a given language, but it can be quite fun to puzzle how to even solve it.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Finally, learn some more powerful and less intuitive languages&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Then, after you get the hang of that, you could start learning a more difficult language like &lt;a href=&quot;https://github.com/DennisMitchell/jelly/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt;. Jelly isn't stack-based so the command flow isn't as intuitive to begin with, but it's a very powerful golfing language because of its tacit command structure (which is also what makes it confusing at times!).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Hope you enjoy your time here!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Welcome to PPCG! I look forward to seeing your contributions to this community, and all the best to your golfing adventures! If you ever have any questions about how we operate, make sure you check out the help center, and if you ever want to ask for tips for golfing in basically every language you can think of or just hang out with fellow golfers, be sure to check out our &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;chat room&lt;/a&gt;!&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2018-02-27T14:40:23.273" LastActivityDate="2018-02-27T14:40:23.273" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14892" PostTypeId="2" ParentId="14889" CreationDate="2018-02-25T03:18:33.227" Score="4" Body="&lt;h3&gt;Welcome to Programming Puzzles &amp;amp; Code Golf!&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;We're very happy to have gained another new golfer! HyperNeutrino covered in their answer a lot of what I was going to say, so I'll focus on the various golfing languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First off, let me point out that there are &lt;a href=&quot;https://github.com/ETHproductions/golfing-langs&quot; rel=&quot;nofollow noreferrer&quot;&gt;dozens of golfing languages to choose from&lt;/a&gt;. I'll try to narrow it down to the most commonly used langs:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://github.com/Adriandmen/05AB1E&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;05AB1E&lt;/strong&gt;&lt;/a&gt; is a stack-based language, the type which is usually easiest to understand&amp;mdash;all values are contained in a master array/list, or &quot;stack&quot;, and each command takes a few values from the end of this array, does something with them, and puts the results back at the end of the array. 05AB1E is fairly recent, is still being updated, and has a fairly active community, making it a good candidate.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://github.com/Mego/Seriously&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Actually&lt;/strong&gt;&lt;/a&gt; is a stack-based language similar to 05AB1E. Someone who's more familiar with the two could probably point out the differences in detail.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://github.com/isaacg1/pyth&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Pyth&lt;/strong&gt;&lt;/a&gt; is a prefix-based language, which can be slightly harder to get the hang of. It's also as old as CJam, although it is actively being maintained. If you want a Python-based golfing language, it's definitely one to look into.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Jelly&lt;/strong&gt;&lt;/a&gt; is a tacit language&amp;mdash;even trickier to understand than Pyth. However, it's been known as one of the top golfing languages, beating all other languages in most challenges it enters. It's written in Python, which may give it a slight advantage in your case.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://github.com/barbuz/Husk&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Husk&lt;/strong&gt;&lt;/a&gt; is a relatively new Jelly challenger. It's a functional language, being based on Haskell; coming from Python, it may or may not be easier to understand than Jelly.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://github.com/lmendo/MATL&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;MATL&lt;/strong&gt;&lt;/a&gt; is another stack-based language, based on MATLAB. It tends to be really good at mathematical operations, especially those involving matrices.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://github.com/somebody1234/Charcoal&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Charcoal&lt;/strong&gt;&lt;/a&gt; is prefix-based, but unique in that it specializes in creating &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot;&gt;ASCII art&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://github.com/ETHproductions/japt&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Japt&lt;/strong&gt;&lt;/a&gt; is a shortened version of JavaScript&amp;mdash;which might not sound very enticing, but you never know ;-)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://github.com/JCumin/Brachylog&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Brachylog&lt;/strong&gt;&lt;/a&gt; is an interesting declarative language, where programs often consist of, quite literally, &quot;the output should have this relation to the input, find it for me&quot;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;All in all, there's no &quot;right&quot; golfing language for you to learn&amp;mdash;but there's certainly no &quot;wrong&quot; language either. It is generally better to choose a language that has an active community, because there will be more experienced users to encourage you and give you tips on golfing your answers. But whichever language(s) you choose, I hope you enjoy your time golfing :-)&lt;/p&gt;&#xA;" OwnerUserId="42545" LastActivityDate="2018-02-25T03:18:33.227" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14893" PostTypeId="2" ParentId="14889" CreationDate="2018-02-25T07:32:44.047" Score="5" Body="&lt;p&gt;Welcome to Programming Puzzles &amp;amp; Code Golf! I am speaking from experience, and I'll have to warn you that mastering &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; takes time. Here are my tips for you, and for any beginner in general.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;First try to golf in a language you already know&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Getting used to golfing in a &quot;practical&quot; language that you are already familiar helps a lot. Make sure to read the appropriate &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions that suit your language (e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/54/tips-for-golfing-in-python&quot;&gt;Tips for golfing in Python&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;At first, you might not be able to produce the shortest submissions in that language, and some other user might post something shorter. &lt;strong&gt;Don't let that discourage you!&lt;/strong&gt; But rather, try to analyse the other (shorter) programs, discover what tricks they use, figure out how it works, etc. If you don't understand the algorithm they used at all, you can always ask the OP to add an explanation. By understanding how other entries in a language you use work, you'll see more and more interesting tricks that you will eventually get to use on a regular basis.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Others are there to help – (Usually) if we see some piece of code that can be improved, or if your solution would benefit from some kind of rearrangement, we'll most likely comment to express our suggestions. Analyse the &quot;golfs&quot; thoroughly and feel free to edit your answer accordingly (of course, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14869/ethics-around-improving-answers-in-comments/14870#14870&quot;&gt;giving credit&lt;/a&gt; to those that helped you shorten your solution). This also gives you the benefit of learning new tricks by looking at how others modified your code.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Some&lt;/em&gt; of the skills you earn by learning a practical language can also be used in golfing languages. There are actually &lt;a href=&quot;https://codegolf.stackexchange.com/questions/5285/tips-for-golfing-in-all-languages&quot;&gt;some tips&lt;/a&gt; that apply to a vast majority of languages.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Then, try to learn a (easier) golfing language&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;After having learned some of techniques in your language of choice, you should be able to go ahead and learn a golfing language. I wouldn't use something too confusing at first, but rather an esolang that makes it easier to get rid of the &quot;practical / imperative&quot; mindset (of course, only when golfing!). Here are my suggestions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://github.com/Adriandmen/05AB1E&quot; rel=&quot;nofollow noreferrer&quot;&gt;05AB1E&lt;/a&gt;&lt;/strong&gt; – A stack-based language with &lt;a href=&quot;https://github.com/Adriandmen/05AB1E/wiki/Commands&quot; rel=&quot;nofollow noreferrer&quot;&gt;lots of built-ins&lt;/a&gt;, some which are hardly ever used, but when chained properly, yield some unbelievably terse code.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://github.com/muddyfish/PYKE&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pyke&lt;/a&gt;&lt;/strong&gt; – Another stack-based esolang, whose usage dropped in the last couple of months. It has its own &lt;a href=&quot;https://pyke.catbus.co.uk&quot; rel=&quot;nofollow noreferrer&quot;&gt;online interpreter&lt;/a&gt; with includes a list of commands you can search pretty easily. Note that you'll most likely not win with Pyke, but I think it is worth learning.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you are interested in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; challenges, then &lt;a href=&quot;https://github.com/somebody1234/Charcoal&quot; rel=&quot;nofollow noreferrer&quot;&gt;Charcoal&lt;/a&gt; is an awesome tool to use. It's like drawing on a Canvas using... well, code. There are some other interesting languages made for this purpose (and also for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;), namely &lt;a href=&quot;https://github.com/dzaima/SOGL&quot; rel=&quot;nofollow noreferrer&quot;&gt;SOGL&lt;/a&gt; and &lt;a href=&quot;https://github.com/dzaima/Canvas&quot; rel=&quot;nofollow noreferrer&quot;&gt;Canvas&lt;/a&gt;, both stack-based, but I believe they are a bit more confusing, since the docs aren't very clear yet.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://github.com/splcurran/Gaia&quot; rel=&quot;nofollow noreferrer&quot;&gt;Gaia&lt;/a&gt;&lt;/strong&gt; – Although you won't see Gaia win very often, it's an easy-to-learn stack-based language, which pretty much opens the path towards Jelly – Like the aforementioned, Gaia's functions lie on separate lines, and can be accessed using various syntax features. You can read more about Gaia's structure &lt;a href=&quot;https://github.com/splcurran/Gaia/wiki/Overview#functions&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Then try to dive deeper – learn something harder&lt;sup&gt;1&lt;/sup&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are many very confusing languages out there, but some of them are particularly competitive at code-golf contests:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt;&lt;/strong&gt; – A &lt;a href=&quot;https://en.wikipedia.org/wiki/Tacit_programming&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;tacit&lt;/em&gt;&lt;/a&gt; golfing language, which is a lot more confusing then everything I mentioned before. However, if you get to understand its concepts, you'll be amazed by how terse it can be. In Jelly's case, learning by doing is definitely the way to go. If you need help, feel free to ask for it in &lt;a href=&quot;https://chat.stackexchange.com/rooms/32533/jelly&quot;&gt;Jelly's official chatroom&lt;/a&gt; or join us in &lt;a href=&quot;https://chat.stackexchange.com/rooms/57815/jelly-hypertraining&quot;&gt;Jelly HyperTraining&lt;/a&gt; (the latter has been very effective for me).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://github.com/barbuz/Husk&quot; rel=&quot;nofollow noreferrer&quot;&gt;Husk&lt;/a&gt;&lt;/strong&gt; – It uses prefix notation, and it's a functional language based-off Haskell, which excels at &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; challenges due to its very neat feature (among many others), support for infinite lists. I also recommend reading &lt;a href=&quot;https://github.com/barbuz/Husk/wiki/Language-comparison&quot; rel=&quot;nofollow noreferrer&quot;&gt;Language Comparison&lt;/a&gt;, from Husk's wiki page.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://github.com/JCumin/Brachylog&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brachylog&lt;/a&gt;&lt;/strong&gt; – A declarative programming language based off Prolog, which is extremely useful and concise for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problems&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problems&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problems&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Other languages you might want to learn over time&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://github.com/isaacg1/pyth&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pyth&lt;/a&gt;&lt;/strong&gt; – A prefix-notation golfing language, which used to be very competitive back in the day. It's based off Python and it has some structures that somewhat resemble Python programs. The &lt;a href=&quot;http://pyth.herokuapp.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pyth online interpreter&lt;/a&gt; also offers a great feature called &quot;Debug&quot;, which essentially outputs a pseudo-code that helps you see what you're doing wrong, or what you have to add to make it work properly. Its &quot;higher-order functions&quot; use their own variables, and every built-in has a fixed &lt;strong&gt;arity&lt;/strong&gt;, so there are usually no syntactic ambiguities, unless that function is overloaded. You can read more about Pyth at its awesome &lt;a href=&quot;https://pyth.readthedocs.io&quot; rel=&quot;nofollow noreferrer&quot;&gt;documentation&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://github.com/ETHproductions/japt&quot; rel=&quot;nofollow noreferrer&quot;&gt;Japt&lt;/a&gt;&lt;/strong&gt; – A language that is transpiled to Javascript. Its documentation can be found &lt;a href=&quot;https://ethproductions.github.io/japt/&quot; rel=&quot;nofollow noreferrer&quot;&gt;along with the online interpreter&lt;/a&gt;, which offers some nice features, similar to Pyth's &quot;Debug&quot; section.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you like regular expressions and string manipulation, I recommend &lt;a href=&quot;https://github.com/m-ender/retina/wiki/The-Language&quot; rel=&quot;nofollow noreferrer&quot;&gt;Retina&lt;/a&gt; or &lt;a href=&quot;https://github.com/DJMcMayhem/V&quot; rel=&quot;nofollow noreferrer&quot;&gt;V&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://sourceforge.net/p/cjam&quot; rel=&quot;nofollow noreferrer&quot;&gt;CJam&lt;/a&gt;&lt;/strong&gt; — An esolang that was very trendy back in the day, but nowadays, you’ll likely not win with it. It only has a handful of commands, and is stack-based, but when those features are put together smartly, it won’t let you down. Like Pyth, CJam is an ASCII-only language.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Also make sure to check out some of the less-used esolangs around here such as &lt;a href=&quot;https://github.com/nickbclifford/Ohm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ohm&lt;/a&gt;, &lt;a href=&quot;https://github.com/mudkip201/pyt&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pyt&lt;/a&gt;, &lt;a href=&quot;https://github.com/tomtheisen/stax&quot; rel=&quot;nofollow noreferrer&quot;&gt;Stax&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Final notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you have any question regarding any golfing language, want to improve one of your existing answers or are looking for suggestions, don't hesitate to visit &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte (aka TNB)&lt;/a&gt;, our official chatroom. Regardless of what path you choose to take, good luck golfing!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;&lt;sub&gt;1: Of course, if you wish to do so.&lt;/sub&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="59487" LastEditDate="2018-02-26T08:27:20.583" LastActivityDate="2018-02-26T08:27:20.583" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14899" PostTypeId="1" CreationDate="2018-02-26T15:05:00.547" Score="1" ViewCount="212" Body="&lt;p&gt;There are cases where a challenge asks for some specific inputs/outputs, for instance an array where each element is a tuple or something similar.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This might be perfectly fine and clear in some languages, while it might be impossible in others. Therefore, people start asking for clarifications asking how to treat the input in such languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The question is thus clear and concise for some languages, while it is unclear for others. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Vote to close?&lt;/h3&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Relevant:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8067/31516&quot;&gt;Making assumptions about language features&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8077/31516&quot;&gt;Cumbersome I/O formats&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="31516" LastEditorUserId="31516" LastEditDate="2018-02-26T19:18:55.010" LastActivityDate="2018-04-16T19:32:40.360" Title="Voting to close question if it's unclear for some?" Tags="|discussion|policy|close-reasons|vote-to-close|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14900" PostTypeId="2" ParentId="14899" CreationDate="2018-02-26T15:29:09.330" Score="6" Body="&lt;p&gt;The situation described sounds like one in which the question needs to spend a few days in the sandbox. Vote to close and comment with a pointer to the sandbox.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-02-26T15:29:09.330" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14901" PostTypeId="2" ParentId="6918" CreationDate="2018-02-26T15:35:33.450" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/Soaku/Pepe&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pepe&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Programming language inspired by an old meme, Pepe.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Uses two stacks and uses only 4 characters: &lt;code&gt;reRE&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every command in it begins with R/r, followed by a certain amount of E/e, ex. &lt;code&gt;REEE&lt;/code&gt;. The R/r define on which stack the command has to work on (1st or 2nd), while E/e define the command used. Both amount of letters and their case matters. &lt;a href=&quot;https://github.com/Soaku/Pepe/blob/master/commands.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;List of commands is available on GitHub&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Links:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/Soaku/Pepe&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://soaku.github.io/Pepe/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Online interpreter&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/Soaku/Pepe/blob/master/commands.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;List of commands&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/search?q=Pepe&quot;&gt;Submissions in Pepe&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="72792" LastEditorUserId="72792" LastEditDate="2018-09-20T19:58:01.297" LastActivityDate="2018-09-20T19:58:01.297" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="14902" PostTypeId="2" ParentId="14899" CreationDate="2018-02-26T16:42:39.813" Score="2" Body="&lt;p&gt;I don't think your example fits the question you are asking very well.  If a challenge only asks programs to take in a 3D matrix, then there is no unclarity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Languages without a 3D matrix cannot compete which is bad, but not unclear (although the challenge as a whole can still be good in these scenarios).  And we shouldn't close vote questions just for being bad.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A more fitting example would be a challenge that discusses keywords.  What is and isn't a keyword is abundantly clear in some languages and unclear in others.  In this case the question is unclear and should be closed and sandboxed depending on how unclear it is.  If we allow challenges to stay open because they are clear in one language we will never get the issue fixed.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2018-04-16T19:32:40.360" LastActivityDate="2018-04-16T19:32:40.360" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14903" PostTypeId="2" ParentId="2140" CreationDate="2018-02-26T18:48:21.103" Score="-1" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Sandbox:&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Is this question already available (duplicate)?&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Are things too vague?&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Does providing the example help or hinder?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Tidy the Pantry (easy)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I hate grocery shopping, particularly the part where I put groceries away--so I'm calling upon the collective hive-mind to handle that.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to take a 1D-list of groceries and a 2D pantry as input; and output an newly assorted pantry. The two variables can be of your type choice, and in any order, but please specify what item types your program requires (e.g. string, array, etc.).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules &amp;amp; Additional info.&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is code golf, so the shortest answer in bytes wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The pantry should be ordered alphabetically (A - Z, left to right, top to bottom)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For simplicity, the pantry is case-insensitive&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The pantry must retain its horizontal size (but trailing newlines are optional)&lt;/li&gt;&#xA;&lt;li&gt;&quot;Pockets&quot; (empty spaces) should be filled between items (i.e. only the last item is allowed to have a trailing pocket)&lt;/li&gt;&#xA;&lt;li&gt;If the pantry is too small for the incoming groceries, then the pantry must replace older items (&lt;code&gt;Z&lt;/code&gt; being the oldest, &lt;code&gt;A&lt;/code&gt; the youngest)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;Z&lt;/code&gt; from &lt;code&gt;groceries&lt;/code&gt; is younger than &lt;code&gt;A&lt;/code&gt; in &lt;code&gt;pantry&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/9365&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Examples (&lt;code&gt;[&lt;/code&gt; and &lt;code&gt;]&lt;/code&gt; are used for readability)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input (4x4 &lt;code&gt;pantry&lt;/code&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[A][A][ ][ ]&#xA;[ ][ ][B][ ]&#xA;[C][ ][ ][ ]&#xA;[ ][ ][ ][D]&#xA;&#xA;AAD&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[A][A][A][A]&#xA;[B][C][D][D]&#xA;[ ][ ][ ][ ]&#xA;[ ][ ][ ][ ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Input (2x2 &lt;code&gt;pantry&lt;/code&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[A][B]&#xA;[C][D]&#xA;&#xA;XYZ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[A][X]&#xA;[Y][Z]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Example solution&lt;/h3&gt;&#xA;&#xA;&lt;h1&gt;JavaScript ES6 (989 bytes)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;// (String, String) -&amp;gt; String&#xD;&#xA;let organise = (pantry, groceries) =&amp;gt; {&#xD;&#xA;  let n = pantry.split(&quot;\n&quot;).sort((a, b) =&amp;gt; b.length - a.length); // used at the end of the function for horizontal sizing&#xD;&#xA;  n = n[0].length;&#xD;&#xA;&#xD;&#xA;  pantry = pantry&#xD;&#xA;    .replace(/\W/g, &quot;&quot;) // get rid of all non-alphanumeric characters&#xD;&#xA;    .split(&quot;&quot;);         // turn the string into an array&#xD;&#xA;&#xD;&#xA;  // we need the properties of the new array&#xD;&#xA;  // so the extra `pantry = pantry` is needed&#xD;&#xA;  pantry = pantry&#xD;&#xA;    .slice(0, pantry.length - groceries.length) // go ahead and remove the last overlapping elements&#xD;&#xA;    .concat(groceries)                          // add the groceries to the pantry&#xD;&#xA;    .join(&quot;&quot;)                                   // turn into a string&#xD;&#xA;    .split(&quot;&quot;)                                  // turn into an array&#xD;&#xA;    .sort()                                     // sort the array&#xD;&#xA;    .join(&quot;&quot;);                                  // turn into a string&#xD;&#xA;&#xD;&#xA;    return pantry.replace(RegExp(`(.{${n}})`, 'g'), &quot;$1\n&quot;);&#xD;&#xA;};&#xD;&#xA;&#xD;&#xA;/** Testing below **/&#xD;&#xA;&#xD;&#xA;console.log(&quot;Test #2:\n&quot; + organise(&#xD;&#xA;`AJCHDJE&#xD;&#xA;JJ   JA&#xD;&#xA;    ASD&#xD;&#xA;OOQ I U&#xD;&#xA;Q     W&#xD;&#xA;      R`,&#xD;&#xA;&#xD;&#xA;'AHJBCJHDHHATTGEH'&#xD;&#xA;))&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Test Cases:&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Test #1, 4x4 pantry&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;TVCX &amp;lt;- pantry&#xA;ABCD&#xA;ATDJ&#xA;UAIK&#xA;&#xA;XYXY &amp;lt;- groceries&#xA;----&#xA;AAAB &amp;lt;- expected output&#xA;CCDD&#xA;IJKT&#xA;XYXY&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Test #2, 7x6 pantry&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;AJCHDJE&#xA;JJ   JA&#xA;    ASD&#xA;OOQ I U&#xA;Q     W&#xA;      R&#xA;&#xA;AHJBCJHDHHATTGEH&#xA;-------&#xA;AAAAABC&#xA;CDDDEGH&#xA;HHHHJJT&#xA;T&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Test #3, 10x10 pantry&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;AAAAAAAAAA&#xA;AAAAAAAAAA&#xA;AAAAAAAAAA&#xA;AAAAAAAAAA&#xA;AAAAAAAAAA&#xA;AAAAAAAAAA&#xA;AAAAAAAAAA&#xA;AAAAAAAAAA&#xA;AAAAAAAAAA&#xA;AAAAAAAAAA&#xA;&#xA;ZZZZZZZZZZZZZZZZZZZZ&#xA;----------&#xA;AAAAAAAAAA&#xA;AAAAAAAAAA&#xA;AAAAAAAAAA&#xA;AAAAAAAAAA&#xA;AAAAAAAAAA&#xA;AAAAAAAAAA&#xA;AAAAAAAAAA&#xA;AAAAAAAAAA&#xA;ZZZZZZZZZZ&#xA;ZZZZZZZZZZ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Test #4, 16x16 pantry pantry&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ASDFGHJKLZXCVBNM&#xA;QJKAJ  KAKSJD  J&#xA;KJASDKFHI YOIER&#xA;W   OSDOFJ    DK&#xA;E PPPASP     AS&#xA;R&#xA;TASD &#xA;YAAAAAAAAAAAA&#xA;U          JHOLK&#xA;IIAUSHODUYOAISUO&#xA;OASD  AUSODI &#xA;PIASND JUASJNOIJ&#xA;A ASJDH PPOIO &#xA;QHIAIUSOIUOOO&#xA;WYYAIUSNNAJSDASD&#xA;EAISDUUIOPJPIJPJ&#xA;ROQPEWIHRNXCAISD&#xA;&#xA;QWERTYUIOP&#xA;----------------&#xA;AAAAAAAAAAAAAAAA&#xA;AAAAAAAAAAAAAAAA&#xA;ABCCDDDDDDDDDDDD&#xA;DDDEEEEEFFFGHHHH&#xA;HHHIIIIIIIIIIIII&#xA;IIIIIIJJJJJJJJJJ&#xA;JJJJJJKKKKKKKKLL&#xA;MNNNNNNOOOOOOOOO&#xA;OOOOOOOOOOPPPPPP&#xA;PPPPPPQQQQRRRRRS&#xA;SSSSSSSSSSSSSSSS&#xA;SSSTTUUUUUUUUUUU&#xA;UVWWY&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Test #5, 2x2 pantry&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;HE&#xA;LO&#xA;&#xA;[no groceries]&#xA;--&#xA;HE&#xA;LO&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="73226" LastEditorUserId="73226" LastEditDate="2018-02-27T00:34:40.377" LastActivityDate="2018-02-27T00:34:40.377" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="14904" PostTypeId="2" ParentId="2140" CreationDate="2018-02-26T20:39:22.013" Score="0" Body="&lt;h1&gt;Paintball Tournament&lt;/h1&gt;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35079/the-rock-paper-scissors-lizard-spock-tournament-of-epicness&quot;&gt;The Rock, Paper, Scissors, Lizard, Spock Tournament of Epicness&lt;/a&gt; as well as other King-of-the-hill challenges, I would like to propose a Paintball Tournament.&lt;/p&gt;&#xA;&lt;p&gt;There is a game on my phone, called &lt;a href=&quot;https://itunes.apple.com/us/app/gamepigeon/id1124197642?mt=8&quot; rel=&quot;nofollow noreferrer&quot;&gt;Game Pigeon&lt;/a&gt; that contains a paintball game. This paintball game is played by two players. The object of the game is to shoot your opponent &lt;strong&gt;x&lt;/strong&gt; times before they shoot you &lt;strong&gt;x&lt;/strong&gt; times.&lt;/p&gt;&#xA;&lt;h3&gt;Gameplay&lt;/h3&gt;&#xA;&lt;p&gt;The game is played in two sets of rounds. A moving round and a shooting round.&lt;/p&gt;&#xA;&lt;p&gt;Both players, without their opponents knowledge, pick from three objects in front of them to hide behind.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;                                (P1) X           X&#xA;                                     X           X (P2)&#xA;                                     X           X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Both players, without their opponents knowledge, choose which target across from them they would like to shoot at. After players decide which target to shoot at, players shoot at the targets chosen in unison, during which expose themselves from behind their target and are vulnerable to be hit.&lt;/p&gt;&#xA;&lt;p&gt;Let's go through a small example. In the movement round, P1 has chosen to hide behind their left-most target. P2 has chosen to hide behind their middle target. In the shooting round, P1 chooses their leftmost target (Spot 1). P2 chooses their rightmost target (Spot 3). (See Below for diagram)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;                                (P1) 3 &amp;lt;- Hit   1&#xA;                                     2          2 (P2)&#xA;                                     1  Miss -&amp;gt; 3      &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For the above example, P1 would miss their shot and P2 would hit their shot, resulting in P1 losing one of their lives. &lt;strong&gt;During the shooting phase, players must choose a barrier to shoot behind, they cannot stay hidden.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;After the shooting phase both players go back into the moving phase and, without their opponents knowledge, can move behind either of the other two objects or stay in place. They then continue to the shooting phase. They loop through these two phases until one of the players run out of lives, both players run out of lives, or a set number of rounds is completed.&lt;/p&gt;&#xA;&lt;h3&gt;Inputs&lt;/h3&gt;&#xA;&lt;p&gt;In the first game of the match, no arguments will be supplied to your bot. In each subsequent game of the match, you will be supplied 2 Args. -Arg1 will contain the location of the player([1, 2, or 3]) as well as the players move history. -Arg2 will contain the location of the players shot([1, 2, or 3]) as well as the players shot history. Both of these locations are referenced as if you are looking in the face of your opponent.&lt;/p&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Round 1: PaintballBot.exe&lt;/li&gt;&#xA;&lt;li&gt;Round 2: PaintballBot.exe 1 1&lt;/li&gt;&#xA;&lt;li&gt;Round 3: PaintballBot.exe 12 11&lt;/li&gt;&#xA;&lt;li&gt;Round 4: PaintballBot.exe 121 113&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;Each round, your bot must output the location in which it is hiding, and the location it is going to shoot, to STDOUT, with two characters. All example outputs are shown below:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;11&lt;/code&gt;&#xA;&lt;code&gt;12&lt;/code&gt;&#xA;&lt;code&gt;13&lt;/code&gt;&#xA;&lt;code&gt;21&lt;/code&gt;&#xA;&lt;code&gt;22&lt;/code&gt;&#xA;&lt;code&gt;23&lt;/code&gt;&#xA;&lt;code&gt;31&lt;/code&gt;&#xA;&lt;code&gt;32&lt;/code&gt;&#xA;&lt;code&gt;33&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Match Format&lt;/h3&gt;&#xA;&lt;p&gt;Each submitted bot will play one match against each other bot in the tournament&lt;/p&gt;&#xA;&lt;p&gt;Each match will last until one of the players loses their x amount of lives, or the match executes 50 rounds.&lt;/p&gt;&#xA;&lt;p&gt;Matches will be played anonymously, you will not have an advanced knowledge of the specific bot you are playing against, however you may use any and all information you can garner from his decision making during the history of the current match to alter your strategy against your opponent. You may also track history of your previous games to build up patterns/heuristics etc... (See rules below)&lt;/p&gt;&#xA;&lt;h3&gt;Submission&lt;/h3&gt;&#xA;&lt;p&gt;Your submission should include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your Bot's name&lt;/li&gt;&#xA;&lt;li&gt;Your Code&lt;/li&gt;&#xA;&lt;li&gt;A command to&#xA;&lt;ul&gt;&#xA;&lt;li&gt;execute your bot from the shell e.g.&lt;/li&gt;&#xA;&lt;li&gt;ruby myBot.rb&lt;/li&gt;&#xA;&lt;li&gt;python3 myBot.py&lt;/li&gt;&#xA;&lt;li&gt;OR&lt;/li&gt;&#xA;&lt;li&gt;first compile your both and then execute it. e.g.&lt;/li&gt;&#xA;&lt;li&gt;csc.exe MyBot.cs&lt;/li&gt;&#xA;&lt;li&gt;MyBot.exe&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Sidenotes&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Need to describe that the location is relative to the shooter(from left to right) and the targets are relative to the shooter(from left to right)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;I am still working on the control program for this event, and any help from other is greatly appreciated&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If someone with more experience than me wants to take this over, please let me know. I would rather help with this challenge since it is my first and then have the knowledge and skills to run my own in the future.&lt;/p&gt;&#xA;&lt;p&gt;Please let me know what still needs more clarification so we can have a fun tournament!&lt;/p&gt;&#xA;" OwnerUserId="76365" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-26T20:39:22.013" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14905" PostTypeId="1" CreationDate="2018-02-26T20:39:53.850" Score="-5" ViewCount="215" Body="&lt;p&gt;&lt;sup&gt;Somewhat related to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/64/tags-regarding-difficulty&quot;&gt;this&lt;/a&gt; question on creating tags regarding difficulty&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;To any duplicate/down voters, see &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14905/we-should-make-a-list-of-basic-mediocre-and-expert-challenges#comment54504_14905&quot;&gt;this&lt;/a&gt; commment&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When I first came to this site, I had no idea on how anything worked, and I wasn't that great at golfing, I only knew python and I had never used it for anything like this. I can only assume this is how most new users feel. If they come to the homepage and see mostly difficult challenges, most likely they won't come back. I say we should have a running list on meta of basic, moderate, and expert challenges. &lt;strong&gt;Obviously this is subjective&lt;/strong&gt;. This can just be a suggested difficulty rating. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For instance, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/84260/add-two-numbers&quot;&gt;Add two numbers&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/58891/dont-google-google&quot;&gt;Don't google 'google'&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/85/fibonacci-function-or-sequence&quot;&gt;Fibonacci Sequence&lt;/a&gt; could all go under basic, since these challenges require little to no thought in &lt;em&gt;most&lt;/em&gt; programming languages. There are certainly notable exceptions, but for standard golfing/everyday languages, these are extremely simple.&lt;/li&gt;&#xA;&lt;li&gt;Challenges to go under the moderate list could be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/154236/find-number-of-ones-to-get-a-number-using-and&quot;&gt;Find number of ones to get a number using + and *&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/155650/can-you-outgolf-bill-gates&quot;&gt;Can you outgolf Bill Gates?&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/141675/when-do-i-get-my-sandwich&quot;&gt;When do I get my sandwich?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Finally, the expert list could contain such challenges like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/88783/build-a-digital-clock-in-conways-game-of-life&quot;&gt;Build a digital clock in Conway's Game of Life&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/28821/regex-that-only-matches-itself&quot;&gt;Regex that only matches itself&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/71631/upgoat-or-downgoat&quot;&gt;Upgoat or Downgoat?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Basically they would be sorted based on amount of time required to answer in a reasonable language&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These lists would just be for reference so people who are new to the site can find challenges to suit them, they often wouldn't know what to search for to get an easier challenge. It could maybe be linked to when a new user makes a first post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What are your opinions on this? Improvements? Let me know.&lt;/p&gt;&#xA;" OwnerUserId="69912" LastEditorUserId="56656" LastEditDate="2020-01-02T14:32:59.547" LastActivityDate="2020-01-02T14:32:59.547" Title="We should make a list of 'basic', 'moderate', and 'expert' challenges" Tags="|discussion|new-users|" AnswerCount="1" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="14906" PostTypeId="2" ParentId="14905" CreationDate="2018-02-26T20:49:22.643" Score="5" Body="&lt;p&gt;The problem with curating such a list is that someone has to maintain it. There are so many new questions on a regular basis that eventually the list may become orphaned.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A suggestion that I'd like to make that might align with this is to adapt the format of a blog and release a set of around 5~20 questions that are similar in difficulty (and preferably &quot;new&quot; as well, so it isn't already flooded with answers) once in a while, and direct users to it for finding material to train on. Some sets might be &quot;basic&quot;, some sets might be &quot;hard&quot;, but at least a consistent, easy to manage format might keep it at a size that will actually appear useful to someone.&lt;/p&gt;&#xA;" OwnerUserId="21830" LastActivityDate="2018-02-26T20:49:22.643" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14907" PostTypeId="2" ParentId="14889" CreationDate="2018-02-26T23:41:09.503" Score="2" Body="&lt;p&gt;Welcome to PPCG! I started golfing a little less than a year ago, and here's how I progressed from enthusiast programmer to serious golfer:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Start with a language you know fairly well&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;That means in your case python. python has the advantage that it's more &quot;encouraging&quot; than other languages -- it's already short and easy to write, so there are lots of golfers who are always giving new users pointers. I am a proud R golfer, and there's a few of us who I'm always happy to see comment on my answers.&lt;/li&gt;&#xA;&lt;li&gt;Don't be discouraged when your answer isn't the first or the shortest. I posted a few 300+ byte solutions that I'm now proud of but at the time I didn't enjoy golfing at all -- I was upset about golfing languages and how much better at processing strings other languages were. I can't remember what challenge I first read that said &quot;shortest answer &lt;em&gt;in each language&lt;/em&gt; wins&quot; (emphasis added) but that flipped a switch for me, and I really started enjoying golfing, not just for all the interesting problems to solve, but for the sake of golfing.&lt;/li&gt;&#xA;&lt;li&gt;Post your answer, ask for comments, and as somebody else said, go dissect what the shorter answers did, ask them for an explanation (in chat or in comments). The only way to get good at anything is to practice the crap out of it, and somebody else (usually) has more experience than you.&lt;/li&gt;&#xA;&lt;li&gt;Eventually, you'll get a nice short answer or golf down somebody else's answer a lot and you'll know you're contributing to the community, which is always nice.&lt;/li&gt;&#xA;&lt;li&gt;Rep exist to make the Q&amp;amp;A sites a game, and it's nice to have a lot to unlock privileges, but don't just go chasing reputation. Otherwise it gets really depressing and you'll probably quit. PPCG is &lt;em&gt;not&lt;/em&gt; a good fit for that style, because every golfing problem is a challenge where you are competing against yourself to find a shorter approach than your previous one. Squeezing another 2 bytes out of your approach feels way better than getting 200 rep, because now you know a good trick for next time.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Go with a language that's (super) different&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I was an R golfer and I know MATLAB decently well (I'm not &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/36398/luis-mendo&quot;&gt;Luis Mendo&lt;/a&gt; but I'm not terrible), so I was comfortable enough with matrix languages. MATL would have been a natural fit, but I really wanted to get out of my comfort zone, so I picked a random esolang, and settled on &lt;a href=&quot;https://github.com/ETHproductions/cubix/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cubix&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I found Cubix was super helpful because&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the syntax is extremely simple. It's stack-based, only has integer arithmetic, but besides managing the stack, you have to worry about which way the instruction pointer is going, because the code runs on the surface of a cube.&lt;/li&gt;&#xA;&lt;li&gt;So you also have to manage code size, or else the cube will change sizes and all the code you've written doesn't work.&lt;/li&gt;&#xA;&lt;li&gt;Because it's easiest (but still quite difficult) to write simple programs, it requires you to break down problems into really small parts, which is very helpful for the more general problem-solving.&lt;/li&gt;&#xA;&lt;li&gt;You don't have to go for a weird language like Cubix, even a more practical language that's got a different syntax and/or built-in data structures than Python is good, just to get you to think about problems differently.&lt;/li&gt;&#xA;&lt;li&gt;Next I switched to &lt;a href=&quot;https://github.com/lmendo/MATL&quot; rel=&quot;nofollow noreferrer&quot;&gt;MATL&lt;/a&gt; because like I said, I was comfortable with MATLAB and the stack-based syntax was a natural fit after doing some Cubix. There was still a pretty steep learning curve but it's been a fun language that I will keep writing answers in.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Go pick whatever language you want&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Keep golfing in your &quot;comfort zone&quot; languages (there are definitely still language features you don't know about), and learn new languages whenever one seems interesting to you! You should have enough experience that you should be able to pick up a language and learn enough to answer a simple challenge, then dive deeper if it piques your interest from there. Or if you see somebody else post an answer in a language, go try to write an answer on another challenge! People are always creating new languages for golf, and you being a &quot;free beta tester&quot; will help the language grow in golfiness.&lt;/li&gt;&#xA;&lt;li&gt;Golfing is sometimes just about finding the right language for the job, just like any programming challenge. If it calls for ASCII-art, maybe think about learning Charcoal. For pattern matching, look at Retina. For anything else, pick Jelly/SOGL/MATL/J/CJam/whatever. If it's a trivially easy challenge, go learn the basic syntax of a new language just to answer it.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;To keep things fun, I find myself writing answers in SNOBOL which is an ancient language that predates the use of regular expressions in programming languages. some funky features: it has a PATTERN type, strange whitespace requirements, and handles control flow by GOTOs and SUCCESS or FAILURE of a line. Because it's so strange, nobody else uses it and I've had to figure most golfs out for myself, with the help of the various tutorials that exist online.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="67312" LastActivityDate="2018-02-26T23:41:09.503" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14909" PostTypeId="2" ParentId="2140" CreationDate="2018-02-27T05:47:16.087" Score="0" Body="&lt;blockquote&gt;&#xA;  &lt;h2&gt;Sandbox Notes&lt;/h2&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Is this inflammatory, mean, and liable to draw unwanted and unnecessary attention to low-voted questions in the Network?&lt;/li&gt;&#xA;  &lt;li&gt;Better tags?&lt;/li&gt;&#xA;  &lt;li&gt;I should probably write a snippet to find all angry Metas.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Angry Meta&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stack-exchange-api&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stack-exchange-api&amp;#39;&quot; rel=&quot;tag&quot;&gt;stack-exchange-api&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A site on the Stack Exchange network is considered to have an &lt;em&gt;angry Meta&lt;/em&gt; if the lowest-voted Meta question (possibly closed, but not deleted) on the site is voted lower than the lowest-voted Main question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, at the moment, the lowest-voted question on PPCG.SE is at -32, while the lowest-voted question on Meta.PPCG.SE is at -24. This means that &lt;code&gt;codegolf&lt;/code&gt; does not have an angry Meta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, the lowest voted question on SoftwareEngineering.SE is at -13, while the lowest-voted question on Meta.SoftwareEngineering.SE is at -17. This means that &lt;code&gt;softwareengineering&lt;/code&gt; does have an angry Meta.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You will be given the name of a Stack Exchange site, which you can assume will not be Area 51, Stack Apps, Stack Overflow, a subdomain of Stack Overflow (such as the Spanish Stack Overflow), Ask Ubuntu, Super User, Meta.SE, or any other site that whose domain is not of the form &lt;code&gt;*.stackexchange.com&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The name will be given as the name of the subdomain (e.g. &lt;code&gt;codegolf&lt;/code&gt; for PPCG, &lt;code&gt;puzzling&lt;/code&gt; for Puzzling, &lt;code&gt;gaming&lt;/code&gt; for Arqade, etc.). You should return one of two &lt;strong&gt;distinct, consistent values&lt;/strong&gt; depending on whether the site has an angry Meta or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since this is liable to change over time, I will not provide a list of test cases here, but you can use this Stack Snippet which is the reference implementation:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;TODO&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="61384" LastEditDate="2018-03-01T16:38:48.790" LastActivityDate="2018-03-01T16:38:48.790" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14910" PostTypeId="1" AcceptedAnswerId="16556" CreationDate="2018-02-27T10:18:05.170" Score="21" ViewCount="396" Body="&lt;p&gt;More than a month ago, we've reached a consensus: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14577/can-we-have-mathjax-back&quot;&gt;We want MathJax back&lt;/a&gt;. The reasons why it was turned off in 2015 no longer seem to apply, and details about why MathJax is needed on this site are detailed in the linked post. After a while, I &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=42691274#42691274&quot;&gt;asked a Community Manager&lt;/a&gt; about what we shall do next, but they were probably busy with other things (such as the election that was just about to start), so I didn't get my question answered.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, what should we do to have MathJax re-enabled? Can we please have it back?&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="31716" LastEditDate="2018-06-20T02:16:55.873" LastActivityDate="2018-06-20T03:01:37.293" Title="Can we have MathJax back (part II)?" Tags="|feature-request|status-completed|latex|" AnswerCount="2" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="14915" PostTypeId="2" ParentId="14687" CreationDate="2018-02-27T23:35:51.060" Score="22" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10132/32352&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Vdi3R.png&quot; alt=&quot;Know how to vote!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user63187" LastActivityDate="2018-02-27T23:35:51.060" CommentCount="4" CommunityOwnedDate="2018-10-03T13:51:49.237" ContentLicense="CC BY-SA 3.0" />
  <row Id="14916" PostTypeId="1" AcceptedAnswerId="14918" CreationDate="2018-02-28T02:29:54.363" Score="13" ViewCount="143" Body="&lt;p&gt;I joined PPCG a while ago, and made a few posts, but didn't do much. I find that I have an interesting question that doesn't already have several answers. If I go to the &quot;active&quot; section, most of the questions that show up already have many answers, but if I go to the &quot;unanswered&quot; section, most questions aren't very good questions. It's almost a bit discouraging, because I want to do some code golf, but you can't code golf if there's nothing to golf. I could just answer a question that's already been answered in the language I intend to use, but that feels like less fun knowing that someone else has already done it, and probably better.&lt;/p&gt;&#xA;" OwnerUserId="70795" LastActivityDate="2018-02-28T10:37:21.840" Title="Finding questions to answer" Tags="|discussion|new-users|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14917" PostTypeId="1" CreationDate="2018-02-28T03:44:22.237" Score="29" ViewCount="718" Body="&lt;p&gt;In accordance with our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14645/16766&quot;&gt;meta agreement&lt;/a&gt; to have a Language of the Month, and since the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14737/16766&quot;&gt;list of nominations&lt;/a&gt; has a single highest-voted entry as February nears its end, I am pleased to announce the very first featured language! Throughout March 2018, our Language of the Month, proposed by &lt;a href=&quot;https://codegolf.stackexchange.com/users/41723/fatalize&quot;&gt;Fatalize&lt;/a&gt;, will be:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;&lt;a href=&quot;https://github.com/JCumin/Brachylog&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brachylog&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h3&gt;What's a Language of the Month?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;See the meta posts linked above. In short, during March, those who wish to participate should learn (at least the basics of) Brachylog, use it to solve challenges, and discuss it in the &lt;a href=&quot;https://chat.stackexchange.com/rooms/34284/brachylog&quot;&gt;Brachylog chat room&lt;/a&gt;. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Information about Brachylog&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Copied from the nomination post:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Brachylog is a &lt;strong&gt;declarative logic language&lt;/strong&gt;. You will thus discover new programming principles and mechanisms, such as unification, backtracking, and constraint integer arithmetic, that you've probably never experienced in other non-declarative languages.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Programming with a declarative language such as Brachylog requires a significantly &lt;strong&gt;different mindset&lt;/strong&gt; compared to your typical imperative languages. This may give you a new perspective on solving programming problems in general (see &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/41350518#41350518&quot;&gt;this quote by a PPCG user&lt;/a&gt;).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Brachylog is a &lt;strong&gt;general purpose code golf&lt;/strong&gt; language. Although it's much better at some tasks than others, and not always as competitive as say Jelly, you should be able to tackle the vast majority of challenges with it, and it can sometimes be remarkably terse.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Documentation&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://github.com/JCumin/Brachylog/wiki&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brachylog's wiki&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/34284/brachylog&quot;&gt;Brachylog's chatroom&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://www.youtube.com/watch?v=XYVhZ-MFcUs&quot; rel=&quot;nofollow noreferrer&quot;&gt;A short Youtube video presenting the basic philosophy of Brachylog&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Interpreter&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The simplest way to run Brachylog is through &lt;a href=&quot;https://tio.run/#brachylog2&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can also download the sources of Brachylog &lt;a href=&quot;https://github.com/JCumin/Brachylog/tree/master/src&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;, and run the language using &lt;a href=&quot;http://www.swi-prolog.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;SWI-Prolog&lt;/a&gt; (this is pretty much only useful if you somehow want to use the debugger).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;&lt;a href=&quot;https://tio.run/##SypKTM6ozMlPN/r/X8kjsaCgUiE9PyctMy9dUan8/38A&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;&quot;Happy golfing!&quot;w&lt;/code&gt;&lt;/a&gt;&lt;/h3&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="31716" LastEditDate="2018-04-01T04:33:49.260" LastActivityDate="2018-04-01T04:33:49.260" Title="Language of the Month for March 2018: Brachylog" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14918" PostTypeId="2" ParentId="14916" CreationDate="2018-02-28T03:44:50.417" Score="12" Body="&lt;p&gt;I have two answers for you, a simple technical one and a more complex philosophical one:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Go to &lt;em&gt;Questions&lt;/em&gt;, sort by &lt;em&gt;newest&lt;/em&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When you sort questions by &quot;active&quot;, you get all the questions that most recently had some activity, where activity could mean different things, but in practice you will see mostly questions that received an answer (or had modifications to an answer) in the last hours, no matter when they were asked. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you are really interested in recent questions that didn't get many answers yet one thing you could do is clicking on the &quot;Questions&quot; link at the top of the page, which will lead you to &lt;a href=&quot;https://codegolf.stackexchange.com/questions&quot;&gt;this page&lt;/a&gt;, where you can actually sort questions by &quot;newest&quot;, showing first the questions that have been most recently asked. Here you have a bit more chance of finding questions that don't have lots of answes yet, but might get more in the future.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said...&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Don't worry so much about that&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;My real suggestion is: try to answer any question you find interesting, no matter how many answer it has. Try first to come up with your own way of solving it, without looking at how other people did. Then you can compare your solution with others and see what other people did differently: maybe they used different algorithms, or applied some golfing tricks you didn't know or didn't think about. As long as you are using a different language, or a different approach, you can even get ideas from other answers and use them to improve your own! (In this case it's always nice crediting people for the ideas you &quot;borrowed&quot;, both in your answer and with upvotes)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once you have an answer you don't think you can improve anymore, don't be afraid of posting it even if it's longer than some other answer in the same language: if you took a different approach to any part of the answer, or to all of it, people may appreciate your creativity. Even more, you may get some golfing tips that could shorten your answer and make it competitive!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The best part of all of this is that even in the worst case, when at the end you find out that some other answer is simply a better golfed version of yours and you end up not posting your solution, you will have learned some new tricks from that which will help you do better next time, and you will probably have had fun while doing that!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;A final note: from my experience &quot;unanswered&quot; questions are often unanswered not because they are not interesting, but because they are &lt;em&gt;hard&lt;/em&gt;. Try not to dismiss them so quickly, and if you think you can build an answer for one of them, by all means do it and post it! Your efforts won't be unappreciated.&lt;/p&gt;&#xA;" OwnerUserId="62393" LastActivityDate="2018-02-28T03:44:50.417" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14920" PostTypeId="2" ParentId="2140" CreationDate="2018-02-28T08:48:27.030" Score="-2" Body="&lt;h1&gt;xkcd-esque Reverse Code Golf&lt;/h1&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;A new &lt;a href=&quot;https://xkcd.com/1960/&quot; rel=&quot;nofollow noreferrer&quot;&gt;xkcd comic&lt;/a&gt; came out recently, seemed to be a fun challenge and a change from the usual code golfing.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/F9Vfw.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/F9Vfw.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;So I set out on making this challenge!&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Make a short snippet of code in any language which, when read out, sounds like  1 sentence of normal English literature (for example, Moby Dick in the comic).&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The snippet doesn't have to run, so you are free to add statements which would not execute (for example: undeclared variables, functions, etc.). However, it must be syntactically correct.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A word in this challenge is any sequence of letters considered as valid English as in a dictionary. Articles (a, an, the) are counted as words.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;To prevent too long answers, the maximum number of words will be fixed at 200 individual words. This includes operator expansion.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The maximum length of any function or variable name will be 10 words.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The expansion used for an operator must be specified in the answer.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Imported and built-in functions are not considered as operators.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Since this is &lt;em&gt;reverse&lt;/em&gt; code golf, the answer with the &lt;strong&gt;most&lt;/strong&gt; points wins.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Scoring criteria:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Characters used to structure code (0)&lt;/strong&gt;: All kinds of brackets, statement terminators, whitespace, etc.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Comments and String literals (0)&lt;/strong&gt;: To avoid making large comments/literals with actual literature&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Names of functions or variables (1 per character)&lt;/strong&gt;:&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Keywords (2 per letter)&lt;/strong&gt;: Using keywords in the story as valid syntax.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Operators (2 per letter of expansion)&lt;/strong&gt;: For example, &lt;code&gt;&amp;gt;&lt;/code&gt; is worth 2x13 (isGreaterThan).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;p&gt;Valid:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;try { throw IngTheBallAnd; } catch (Ing it) {}&#xA;// Worth 3x2 + 5x2 + 13 + 5x2 + 3 + 5 = 37 points&#xA;&#xA;let myLife = &amp;quot;a quote&amp;quot;;&#xA;// Worth 3x2 + 6 + 2x2 = 16 points (&amp;quot;=&amp;quot; used as &amp;quot;be&amp;quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Invalid:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;// One does not simply write everything in a comment&#xA;// Worth 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Hope this meets PPCG puzzle criteria :D&lt;/p&gt;&#xA;" OwnerUserId="78468" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-02-28T12:11:14.277" CommentCount="16" ContentLicense="CC BY-SA 3.0" />
  <row Id="14921" PostTypeId="2" ParentId="14916" CreationDate="2018-02-28T10:37:21.840" Score="5" Body="&lt;p&gt;There are some &lt;a href=&quot;https://codegolf.stackexchange.com/help/searching&quot;&gt;quite sophisticated search predicates&lt;/a&gt; which you can use. E.g. you can search for questions with 3 to 8 answers and a score of at least 5 which were posted in the last year: &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=is%3Aq+answers%3A3..8+score%3A5+created%3A1y&quot;&gt;https://codegolf.stackexchange.com/search?q=is%3Aq+answers%3A3..8+score%3A5+created%3A1y&lt;/a&gt;..&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-02-28T10:37:21.840" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14922" PostTypeId="2" ParentId="14917" CreationDate="2018-02-28T10:42:11.037" Score="10" Body="&lt;h1&gt;List of &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=brachylog+created%3A2018-02-28..2018-03-31+is%3Aanswer&quot;&gt;all Brachylog solutions posted&lt;/a&gt; in March&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/156864/8478&quot;&gt;Implement a Truth-Machine&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478&quot;&gt;Martin Ender&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/156944/32014&quot;&gt;ID generator with no matching contiguous pairs&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/32014&quot;&gt;Zgarb&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/156972/8478&quot;&gt;Non-discriminating Programming&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/41024/erik-the-outgolfer&quot;&gt;Erik the Outgolfer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/156976/8478&quot;&gt;Non-discriminating Programming&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-ender&quot;&gt;Martin Ender&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/156987/71256&quot;&gt;Non-discriminating Programming&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/71256/h-pwiz&quot;&gt;H.PWiz&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/157045/8478&quot;&gt;Collatz Conjecture (OEIS A006577)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478&quot;&gt;Martin Ender&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/157180&quot;&gt;Bernardino identifies unaltered dollar words&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766&quot;&gt;DLosc&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/157189/8478&quot;&gt;Sort by shuffling blocks&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478&quot;&gt;Martin Ender&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/157202/32014&quot;&gt;Garble that string!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/32014&quot;&gt;Zgarb&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/157216/32014&quot;&gt;Number of sums of factors&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/32014&quot;&gt;Zgarb&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/157328/8478&quot;&gt;Find relevant digit groupings&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-ender&quot;&gt;Martin Ender&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/157417/32014&quot;&gt;Necklace splitting problem&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/32014&quot;&gt;Zgarb&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/157464/8478&quot;&gt;Compute the Kolakoski sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/32014&quot;&gt;Zgarb&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/158028/41024&quot;&gt;Duck, duck, goose!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/41024&quot;&gt;Erik the Outgolfer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/158256/32014&quot;&gt;Transitive equality&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/32014&quot;&gt;Zgarb&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/159503/8478&quot;&gt;The Spanish license plates game&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/76359&quot;&gt;ais523&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/159506/8478&quot;&gt;Non-discriminating Programming&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/76359&quot;&gt;ais523&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/159529/8478&quot;&gt;What is my exponential potential?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/76359&quot;&gt;ais523&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/159574/41024&quot;&gt;Blue duck, red duck, gray duck&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/41024&quot;&gt;Erik the Outgolfer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;List of &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=inquestion%3A108296+created%3A2018-02-28..2018-03-31+is%3Aanswer&quot;&gt;all Brachylog tips posted&lt;/a&gt; in March&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;tip title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;List of Brachylog-related challenges posted in March&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;https://codegolf.stackexchange.com/q/&amp;lt;question-ID&amp;gt; by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="41024" LastEditDate="2018-03-23T14:50:37.413" LastActivityDate="2018-03-23T14:50:37.413" CommentCount="0" CommunityOwnedDate="2018-02-28T10:42:11.037" ContentLicense="CC BY-SA 3.0" />
  <row Id="14927" PostTypeId="1" AcceptedAnswerId="14938" CreationDate="2018-02-28T21:10:23.900" Score="27" ViewCount="688" Body="&lt;p&gt;Having started writing my own golfing language, I noticed there is no tips page for launching a new language.&lt;/p&gt;&#xA;&lt;p&gt;Having seen how many languages have been made by this community, I wondered what advice the community has for launching a new golfing languages, and what pitfalls to avoid while doing so.&lt;/p&gt;&#xA;&lt;p&gt;See also &lt;a href=&quot;https://codegolf.stackexchange.com/questions/198446/tips-for-creating-maintaining-a-golfing-language&quot;&gt;tips for creating a golfing language&lt;/a&gt; for some tips on how to create golfing languages specifically, but many tips there are applicable for any type of language.&lt;/p&gt;&#xA;" OwnerUserId="73772" LastEditorUserId="91213" LastEditDate="2022-08-31T15:44:24.680" LastActivityDate="2022-08-31T15:44:24.680" Title="Tips for launching a language" Tags="|discussion|languages|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="14929" PostTypeId="2" ParentId="2140" CreationDate="2018-02-28T23:03:03.117" Score="-5" Body="&lt;p&gt;&lt;strong&gt;Letter Grade Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Create a program that allows the user to input an &lt;code&gt;int&lt;/code&gt; between 1 and 100, then grades that number based on standard US letter grades, printing the grade character as a result. Please use Java for this challenge, and like usual code golf challenges, the smallest answer (bytes) wins.&#xA;For example, if input is &lt;code&gt;90&lt;/code&gt;, then you display &lt;code&gt;A&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="78149" LastEditorUserId="78149" LastEditDate="2018-03-01T00:04:00.750" LastActivityDate="2018-03-01T00:04:00.750" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="14935" PostTypeId="2" ParentId="2140" CreationDate="2018-03-01T12:22:04.320" Score="1" Body="&lt;h1&gt;Safely check a password against HIBP v2 range API&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Per &lt;a href=&quot;https://www.troyhunt.com/ive-just-launched-pwned-passwords-version-2/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.troyhunt.com/ive-just-launched-pwned-passwords-version-2/&lt;/a&gt;, what would be the shortest code to safely check a password against the &lt;em&gt;Have I Been Pwned?&lt;/em&gt; k-anonymity (range) API, as mentioned in the article?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;API overview&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Specifically, the API is at:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;https://api.pwnedpasswords.com/range/$FIRST_5_CHARS_OF_SHA1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and returns a list of SHA1 hashes beginning with the specified 5 chars (more precisely: it returns only the substrings of hashes after &lt;code&gt;$FIRST_5_CHARS_OF_SHA1&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, given a password &lt;code&gt;P@ssw0rd&lt;/code&gt;, its SHA1 hash is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;21BD12DC183F740EE76F27B78EB39C8AD972A757&#xA;\---/\---------------------------------/&#xA;  |                     |&#xA;  `-- first 5 chars     `-- rest of chars&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and thus for a request like one of below:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;https://api.pwnedpasswords.com/range/21BD1&#xA;https://api.pwnedpasswords.com/range/21bd1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;the API gives a response like below (&lt;code&gt;...&lt;/code&gt; represents more lines):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;...&#xA;29B59205F57C2608CAE47E8157621FF7645:1&#xA;2B766777053A89201D8257221BBC161E279:2&#xA;2D10A6654B6D75908AE572559542245CBFA:2&#xA;2D6980B9098804E7A83DC5831BFBAF3927F:1&#xA;2D8D1B3FAACCA6A3C6A91617B2FA32E2F57:1&#xA;2DC183F740EE76F27B78EB39C8AD972A757:47205&#xA;2DE4C0087846D223DBBCCF071614590F300:2&#xA;2DEA2B1D02714099E4B7A874B4364D518F6:1&#xA;2E90B7B3C5C1181D16C48E273D9AC7F3C16:1&#xA;2EAE5EA981BFAF29A8869A40BDDADF3879B:1&#xA;2F1AC09E3846595E436BBDDDD2189358AF9:1&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Existence of &lt;code&gt;2DC183F740EE76F27B78EB39C8AD972A757&lt;/code&gt; in the response means that &lt;code&gt;P@ssw0rd&lt;/code&gt; was found in some breach and should be considered unsafe. Number &lt;code&gt;47205&lt;/code&gt; signifies how many times such a password occurs in all the contributing breaches.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules details&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The password must be read from user's keyboard. Per the next rule, it should not be displayed on screen, thus if read from standard input, usually the &quot;character echo&quot; would need to be disabled (e.g. &lt;code&gt;read -s&lt;/code&gt; in bash). If implemented as a GUI app, e.g. a standard &quot;password input&quot; widget may be used, which would replace typed characters with asterisks or black dots. &lt;/li&gt;&#xA;&lt;li&gt;&quot;Safely&quot; means that the solution should not leak raw password to other users of a machine (e.g. the raw password should never appear as part of command line of any subcommand, and should never appear on screen) or outside the machine (websites, etc.). The full hash should not be shared outside the machine either.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Specifically, it must be &lt;em&gt;clear&lt;/em&gt; (for an experienced user of the language) from the code comprising the solution that the raw password (and the SHA) do not leak (as mentioned above). So, for example, the solution's code cannot be downloaded from a remote repository (not sure if it's already included in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/78604&quot;&gt;default forbidden loopholes list&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The SHA sum of the checked password should be printed on screen, to make it possible to verify correctness of the solution, e.g. by checking SHA sum for &lt;code&gt;P@ssw0rd&lt;/code&gt;. Other hashes can be printed too or not, but the one matching the checked password must be easy to see (i.e. always first/last/highlighted/...)&lt;/li&gt;&#xA;&lt;li&gt;The solution should also display the number of occurrences of the password &quot;in the wild&quot; as returned by the API (i.e. 47205 for &lt;code&gt;P@ssw0rd&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;The solution should print at least a 1 character of prompt before reading the answer, so that user knows console is safely in &quot;no echo&quot; mode.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Extra tag&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To keep with the site's  sport spirit, I'm putting no formal restrictions on language. However, &lt;em&gt;personally&lt;/em&gt; I'm particularly interested in and curious about  &quot;real-world usable&quot; answers. As such, if your answer has the following &lt;strong&gt;&quot;extra&quot; attributes&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;can be typed in bash as a &lt;a href=&quot;https://en.wikipedia.org/wiki/One-liner_program&quot; rel=&quot;nofollow noreferrer&quot;&gt;one-liner&lt;/a&gt; (with appropriate preamble like &lt;code&gt;perl -ne&lt;/code&gt; if needed)&lt;/li&gt;&#xA;&lt;li&gt;is composed only of printable ASCII characters (no Unicode)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;please&lt;/strong&gt; append an extra marker/tag like below in the &quot;title&quot; line of your answer:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;[bash oneliner: 30 +7]&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;30&lt;/code&gt; is the length of the actual code in your preferred language, and &lt;code&gt;+7&lt;/code&gt; is the length of the required preamble/postamble. For pure bash answers, this can be &lt;code&gt;+0&lt;/code&gt;. Please then also include the actual oneliner, together with the preamble/postamble.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an explanation, the benefits of a one-liner I'm interested in for &quot;real world users&quot;, are such that a one-liner is easy to re-type and execute in console for paranoid users, who would prefer to do it instead of Ctrl-C &amp;amp; Ctrl-V.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sample naive answer in bash&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Split to multiline with &lt;code&gt;\&lt;/code&gt;s purely for readability:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$ (sha=$(IFS= read -s -p &quot;pwned? &quot; pw; tr -d '\n' &amp;lt;&amp;lt;&amp;lt;$pw | shasum ); \&#xA;  curl -s https://api.pwnedpasswords.com/range/${sha:0:5} | \&#xA;  (grep -i ${sha:5} || echo &quot;${sha:5}:0&quot;) | \&#xA;  sed &quot;s/^/${sha:0:5}/&quot;)&#xA;pwned? 21bd12DC183F740EE76F27B78EB39C8AD972A757:47205&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;One-liner:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;$ (sha=$(IFS= read -s -p &quot;pwned? &quot; pw; tr -d '\n' &amp;lt;&amp;lt;&amp;lt;$pw | shasum ); curl -s https://api.pwnedpasswords.com/range/${sha:0:5} | (grep -i ${sha:5} || echo &quot;${sha:5}:0&quot;) | sed &quot;s/^/${sha:0:5}/&quot;)&#xA;pwned? 21bd12DC183F740EE76F27B78EB39C8AD972A757:47205&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="78604" LastEditorUserId="69850" LastEditDate="2018-03-08T11:17:10.830" LastActivityDate="2018-03-08T11:17:10.830" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="14938" PostTypeId="2" ParentId="14927" CreationDate="2018-03-01T18:10:23.813" Score="28" Body="&lt;p&gt;Welcome to the weird and wonderful world of esolang creation! I think it's a very fun meta-game part of PPCG to make new languages, and it's one that I enjoy a lot. I'm certainly not an expert on the topic, but I have made two languages before. Here are some tips I'd give you. Keep in mind that all of these are optional:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Mention it in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;People in TNB love learning new languages. Mentioning it there is very likely to get at least a couple of people interested in it.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Put it on &lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try It Online&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;TIO is a website hosting online interpreters for practical and esoteric languages, generously hosted by our moderator &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;. At the time of writing this, there are nearly 500 different languages hosted on TIO, and adding yours is surprisingly easy. To have your language added, ping &lt;code&gt;@Dennis&lt;/code&gt; in &lt;a href=&quot;https://chat.stackexchange.com/rooms/44255/talk-tryitonline-net&quot;&gt;The TIO chat room&lt;/a&gt;, and he will tell you what you'll need to do. From there, you can now use your language online at &lt;code&gt;tio.run/#&amp;lt;your-language&amp;gt;&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may also prefer to host your own online interpreter, for example, if your interpreter is in Javascript. This is perfectly valid too. Make sure to include a permalink feature, so that you can link people to a particular code snippet.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Make some docs&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The most fun part of writing a new language is seeing other people use and enjoy it. It's very satisfying to know your language is enjoyed by people other than you. But they'll need a way to learn it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Presumably, your code is hosted on Github, or something similar. Github has a &lt;em&gt;wiki&lt;/em&gt; feature, which is ideal for posting language documentation. What exactly your docs will have is entirely up to you, but most people will generally do some combination of the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Specifications&lt;/li&gt;&#xA;&lt;li&gt;A tutorial for beginners&lt;/li&gt;&#xA;&lt;li&gt;A full list of commands&lt;/li&gt;&#xA;&lt;li&gt;Some useful examples in your language&lt;/li&gt;&#xA;&lt;li&gt;How to run your interpreter&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You can also include docs in the directory of the project itself. Personally, I prefer wikis, but either way is perfectly fine.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Make a chat room&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A lot of esolangs can be hard to learn. So it's really nice to have a place where you can talk directly to the expert on the language. Chat rooms are perfect for this. It's also perfectly fine to talk about your language in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;, but sometimes talking about one language too long can dominate the conversation. (If lots of people are interested)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your mileage may vary on this tip. I have two language chat rooms. One of them is constantly frozen and has no one there wanting to talk. The other is usually somewhat active every week, and will have people talking in there with or without me. In order to avoid making a new dead room, it might be wise to wait and see how often people want to talk about your language. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Answer noteworthy questions in your language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Here are some examples of very famous questions that are a catalog of how to do the task in may different languages:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/55422/31716&quot;&gt;&amp;quot;Hello, World!&amp;quot;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/44680/31716&quot;&gt;Showcase of Languages&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/57617/31716&quot;&gt;Is this number a prime?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/69/31716&quot;&gt;Golf you a quine for great good!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/62732/31716&quot;&gt;Implement a Truth-Machine&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/59347/31716&quot;&gt;Shortest infinite loop producing no output&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;These have the added benefit of being fairly simple tasks that help you get a hang of how to use your language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can answer more than these challenges too! The more challenges you answer, the greater the chance of getting people interested.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Those are the main ones. Here are some extra things you can do:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Make a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question is a great way to show off how to golf in your language, and to share your knowledge with the community so that they can learn how to golf in your language as well. If your lucky, sometimes you'll even be blown away by the users of your language, and &lt;a href=&quot;https://codegolf.stackexchange.com/a/109859/31716&quot;&gt;learn something you didn't even know of yourself!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Nominate your language for Language of the Month&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14737/31716&quot;&gt;Language of the Month&lt;/a&gt; is a new contest started by DLosc, intended to bring awareness of obscure languages to the community. If you can get enough people interested in learning your language, you might get to have it featured for a month, which will bring it to way more people. &lt;em&gt;Disclaimer: If your language is seen as a cheap derivative, or as not creative, it might end up being downvoted. This option mostly depends on how original/interesting your language is&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Make some bounties for your language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Nothing gets people motivated to learn a new language like rep does! We have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5243/31716&quot;&gt;meta post for endless bounties&lt;/a&gt;, which is where people offer some of their own reputation to see particularly difficult tasks completed. If you come up with a task in your language (e.g. outgolf me, do X in &amp;lt; Y bytes, Do particularly hard task, write a quine, etc.), you can incentivize people to learn your language by offering up your own rep.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Make an &lt;a href=&quot;https://esolangs.org/wiki/Main_Page&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolangs Wiki&lt;/a&gt; entry&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The esolangs wiki is a site that PPCG loves a lot. Basically, it's like wikipedia but for esoteric programming languages. If you include your language here, there's a greater chance of it being discovered by people outside of PPCG.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="31716" LastEditDate="2018-03-01T18:30:23.710" LastActivityDate="2018-03-01T18:30:23.710" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14939" PostTypeId="2" ParentId="14927" CreationDate="2018-03-01T18:24:21.077" Score="4" Body="&lt;p&gt;Prepare a very short description of the language's features and goals, no more than a few sentences. Give some non-trivial examples with a hint for what they do as a comment. Say how your language is different from the myriad of already existing langauges and why anyone should pay attention to it. Name it something googlable.&lt;/p&gt;&#xA;" OwnerUserId="24908" LastEditorUserId="24908" LastEditDate="2018-03-01T18:50:09.030" LastActivityDate="2018-03-01T18:50:09.030" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14942" PostTypeId="2" ParentId="14871" CreationDate="2018-03-01T19:51:37.727" Score="3" Body="&lt;p&gt;I sincerely don't mind if you guys decide to close as duplicate in favor of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14926/8478&quot;&gt;sandboxed version&lt;/a&gt;. Perhaps I was being spiteful with the original requirements :)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Otherwise, feel free to modify the existing question to relax the I/O restrictions. When I rejected that proposition originally, it wasn't my question I was protecting -- it was the existing answers. So you certainly have my consent, although mine isn't the one you should want IMHO.&lt;/p&gt;&#xA;" OwnerUserId="3348" LastActivityDate="2018-03-01T19:51:37.727" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14945" PostTypeId="2" ParentId="6918" CreationDate="2018-03-02T04:03:35.350" Score="7" Body="&lt;h1&gt;Stax&lt;/h1&gt;&#xA;&lt;p&gt;Stax is a golfing language created by me.  Unique features include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Compressed string literals&lt;/li&gt;&#xA;&lt;li&gt;Built-in rational support&lt;/li&gt;&#xA;&lt;li&gt;Online interactive debugger&lt;/li&gt;&#xA;&lt;li&gt;Code is written in ascii, but can be &amp;quot;packed&amp;quot; to a single byte character set for savings&lt;/li&gt;&#xA;&lt;li&gt;Two implementations: typescript and C#&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;It's got a &lt;a href=&quot;https://github.com/tomtheisen/stax/issues&quot; rel=&quot;nofollow noreferrer&quot;&gt;github repo&lt;/a&gt;, an &lt;a href=&quot;https://staxlang.xyz/&quot; rel=&quot;nofollow noreferrer&quot;&gt;online interpreter&lt;/a&gt;, and &lt;a href=&quot;https://github.com/tomtheisen/stax/blob/master/docs/README.md#stax&quot; rel=&quot;nofollow noreferrer&quot;&gt;documentation&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I'll finish with Hello, World!, which uses a single compressed string literal.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;`jaH1&amp;quot;jS3!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="527" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-03-02T04:03:35.350" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14948" PostTypeId="1" AcceptedAnswerId="14949" CreationDate="2018-03-02T09:34:26.940" Score="2" ViewCount="88" Body="&lt;p&gt;OK Maybe I am really dumb and fail to see something obvious, but I am not able to find a link to the main site (i.e. codegolf.stackexchange.com) in the non-mobile view of this meta site. I can find the link at the bottom of the page in the mobile view, or find the link to the right of the edit box when I start to ask a question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can anyone please tell me where the link to codegolf.stackexchange.com is located on the non-mobile view of the homepage of codegolf.meta.stackexchange.com, or help to add it if there really isn't one?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Edit (the edit was made before the question had an answer, and is the same as the comment by @ASCII-only. The latter is now included in @Mr.XCoder's answer with a illustrative picture): I can click the final button on the toolbar at the upper-right corner to get a link to the main site but is there a more obvious place that holds the link to the main site?&lt;/p&gt;&#xA;" OwnerUserId="77134" LastEditorUserId="68942" LastEditDate="2021-06-09T05:30:35.920" LastActivityDate="2021-06-09T05:30:35.920" Title="Link to the main site" Tags="|support|feature-request|status-declined|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14949" PostTypeId="2" ParentId="14948" CreationDate="2018-03-02T09:55:35.273" Score="2" Body="&lt;p&gt;As pointed out by ASCII-only, it is available when you open the hamburger menu resembling SE's favicon:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/HObfQm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/HObfQm.png&quot; alt=&quot;From the hamburger menu&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can also access it via your profile (or anyone else's, actually) – this will link you to that person's profile on the main site:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/swUQK.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/swUQK.png&quot; alt=&quot;From a user profile&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, if you want to go from meta straight to the main site, just delete the &lt;code&gt;.meta&lt;/code&gt; from &lt;code&gt;https://codegolf.meta.stackexchange.com&lt;/code&gt; :-).&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="59487" LastEditDate="2018-03-02T10:12:12.707" LastActivityDate="2018-03-02T10:12:12.707" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14951" PostTypeId="2" ParentId="14948" CreationDate="2018-03-02T17:14:43.443" Score="0" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Still I think it would be nice to have a direct link like that in the mobile view&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;There is! Just click on the hamburger menu on the top left of your screen, and go here:&lt;img src=&quot;https://i.stack.imgur.com/MUwUm.jpg&quot; alt=&quot;enter image description here&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2018-03-02T17:14:43.443" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14955" PostTypeId="1" CreationDate="2018-03-03T15:56:26.817" Score="2" ViewCount="149" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/155113/largest-number-in-512-bytes&quot;&gt;This topic&lt;/a&gt; was closed as unclear. However, all asked problem in the comment that matter seem answered in the first version statement.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;&lt;pre&gt;&lt;code&gt;1. The result should be constant when n exceed a constant.&#xA;2. Decimal and unary(use the output.length) output allowed&#xA;3. No infinity output, but infinite loop allowed if the loop doesn't generate any output, or the infinite output is after a decimal point.&#xA;4. You can assume sizeof(a number type) be its size on some existed env or linear to 2^n with an existed rate. That means, long long in C++ can be 4 bytes(16-b env), 8 bytes(32-b env), 2^n bytes(64-b env), 2*2^n bytes(32-b env). However, if char* is 4-byte or 8-byte, it can only handle 4GB memory or 2^64 byte memory, and the result won't be that large.&#xA;5. For float(and double), you can define your custom IEEE bit arrange, sizeof(float)=2^n, sizeof(double)=2^(n+1)&#xA;6. Unlike other models, with n treated as a large enough input, this model can solve something like the busy beaver. Therefore, you may want to go further.&#xA;a. I only answer &quot;What the problem mean&quot;, not &quot;Why ask this problem&quot;(The latter usually don't apply in PCCG)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;　&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;&lt;pre&gt;&lt;code&gt;It's very unclear to me what the challenge is actually about. Given a 2^n-bit x86: Is this an assumption about computer architecture? Some kind of input? What is n? output the largest result when n is large enough: Large enough for what? [a]&#xA;A busy beaver maximises some property of the computation model (e.g. execution time, memory usage, output length) subject to the constraint that it must halt. From Note 3 I don't even think it is a busy beaver (because infinite loop is allowed). And when n is large enough, does this imply unlimited precision? [3&amp;amp;6]&#xA;What do you want to say? I don't understand. / What about the program unsigned n=1,p=0;while(n&amp;gt;p){++n;++p;}print(p); which prints the largest unsigned value?[1]&#xA;So what's the difference between this and the other challenge? Any program from the other challenge can be ported to this challenge and remains competitive.[6]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/152472/write-it-into-number-theory-style&quot;&gt;This one&lt;/a&gt; was closed(later reopened) also as unclear, for they didn't know the statement's truth value is unknown. However, the first version directly says &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;you shouldn't just say &quot;one of E x x=x and A x x&gt;x match&quot;; but if you proved one, you are allowed to use that XD&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Therefore &quot;unclear&quot; seem doesn't mean &quot;don't know what the question mean, and thus unable to answer&quot;. So what does it mean?&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2018-04-17T12:12:19.277" Title="What does &quot;unclear&quot; mean?" Tags="|discussion|" AnswerCount="2" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="14956" PostTypeId="2" ParentId="14195" CreationDate="2018-03-03T21:47:37.440" Score="1" Body="&lt;p&gt;This seems to happen when you have enough reputation to access the &lt;em&gt;First Posts&lt;/em&gt; and the &lt;em&gt;Late Answers&lt;/em&gt; review queues, but not enough reputation to access any other queues.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the main site, the review button shows you those two queues. On the meta site, the button still is there (presumably because it doesn't check for main and meta separately), but on meta there is no &lt;em&gt;First Posts&lt;/em&gt; or &lt;em&gt;Late Answers&lt;/em&gt; queue, so there are no queues you have the privilege to access.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And it does happen on other Stack Exchange sites as well, not just here on PPCG. That's how I found it out, actually.&lt;/p&gt;&#xA;" OwnerUserId="61405" LastActivityDate="2018-03-03T21:47:37.440" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14957" PostTypeId="2" ParentId="2140" CreationDate="2018-03-04T01:05:38.353" Score="0" Body="&lt;h1&gt;Comment or not comment?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a function which given an all lowercase string, return the same string but with characters that are comments turned uppercase.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input is a null terminated ASCII string which may contain any of these characters&#xA;abcdefghijklmnopqrstuvwxyz /*\ space newline&lt;br&gt;&#xA;Last and only last character is null&lt;br&gt;&#xA;You will not need to test for invalid input, such as &quot;stringliterals&quot; etc&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules for what is comment&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;/* causes everything until */ (or end of string) to be comment&lt;br&gt;&#xA;// causes everything until newline (or end of string) to be comment&lt;br&gt;&#xA;'\' at end of line in a comment causes next line to be a comment aswell  &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A copy of the input but with letters which are comments according to the rules above in uppercase, other characters shall remain unchanged&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;/comment -&amp;gt; /comment&#xA;//comment -&amp;gt; //COMMENT&#xA;/*comment -&amp;gt; /*COMMENT&#xA;no /*yes*/ no // yes -&amp;gt; no /*YES*/ no // YES&#xA;&#xA;/*          -&amp;gt;              /*&#xA;comment                     COMMENT&#xA;*/                          */&#xA;&#xA;//\          -&amp;gt;             //\&#xA;/*                          /*&#xA;not comment                 not comment&#xA;//\                         //\&#xA;*/                          */&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##lVTbctowEH33V2yZaSTb9TgkbzXOj9Q8KEIETYTUsUUJk/DtdFfYxgbKUF6w9pw9Zy@WZfYm5eEgV6JOoNlZLz54e3CbWqr4MwJtPRhloYTG1/jAW6iIYJiH@FoY4yRHTjoleOlq4JSuy8dCzzBe6DQlTQipIEk0qP3S84LCzVZ7ueLySEKaaBSwnMFPaCMAeslBp1N4KamuGF5rJd6LDg3CVn34gXY6nff40QE4UeJe87oT/fIERsccmZtGNaD@qHrnV9q@wcZ6bdB0a7RVwLFtZRfgljQxxGPwDl4VSLdeK@uHciu3JR1gFQPhu7Qg09qEVkLgKCI6GRDNVhkzqi7Jh6eFg0/YrrRRODAaPzw8nOYN30q0tQziccPQLpQoyJCsGKO4wlFkHyL4F5xw4TCDM6/saV6WrKpYPMrERepZSTuMLt2zTM/Lsfv@bNXd0pKLpd3qoBvIscxsSoXys7Gg4tfX8PUJ0ZxmFV@dVZr@a1rUY/D5j8TLRhdqKTbGY5@j1hwrzqj76IrCXdmYuY/Cpb1@Z7GTfki0TcviXi0cUUUZ3AcRe4BWOHrtXkomcI4nRo9kz0@dxBW0iKi6FsCyqINH5NfKb2rbAkg6UPFroS3Hon/j9fNLPvneVLaykx/dN26St5doggstbtDu5SX38azD78lONUkO9JgDPt9bQlVVVpjGdfe/stZ5uLe@yp7yknwS37YkL8oZOGAghJMcuZSOo/4L&quot; rel=&quot;nofollow noreferrer&quot;&gt;ungolfed&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="75884" LastEditorUserId="75884" LastEditDate="2018-03-04T20:58:27.507" LastActivityDate="2018-03-04T20:58:27.507" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14960" PostTypeId="2" ParentId="14955" CreationDate="2018-03-05T15:08:42.077" Score="9" Body="&lt;p&gt;&quot;Unclear&quot; can mean any of the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I don't understand the specification well enough to judge whether a program meets it or not (so by implication, I cannot answer it), and that's not just because I don't know enough of some obscure branch of mathematics which is an integral part of the question.&lt;/li&gt;&#xA;&lt;li&gt;I think I do understand the specification, and it's self-contradictory.&lt;/li&gt;&#xA;&lt;li&gt;I can see incompatible interpretations of the specification (i.e. it's ambiguous).&lt;/li&gt;&#xA;&lt;li&gt;I'm convinced that the specification is unambiguous, someone else is also convinced that it's unambiguous, but our interpretations disagree.&lt;/li&gt;&#xA;&lt;li&gt;I'm convinced that the specification is unambiguous, but I'm also pretty sure that what you're asking for isn't what you &lt;em&gt;intended&lt;/em&gt; to ask for. (E.g. you ask me to output the 17th integer in a sequence, and the obvious answer is to hard-code it rather than to calculate it).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-03-05T15:08:42.077" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14961" PostTypeId="1" AcceptedAnswerId="14962" CreationDate="2018-03-06T03:13:33.617" Score="5" ViewCount="124" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/157229/any-ideas-on-how-to-solve-this-problem&quot;&gt;This question&lt;/a&gt; is closed recently because it is off-topic. It has been &lt;a href=&quot;https://codegolf.stackexchange.com/questions/157229/any-ideas-on-how-to-solve-this-problem#comment-383058&quot;&gt;commented&lt;/a&gt; that we are not supposed to ask questions that may be coming from ongoing contests.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While sometimes it is obvious the the question is not by the asker himself and need proper attribution (For example, through text with poor formatting that is evident to be copied from somewhere else), in other cases it would not be so clear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On second thought, it is also not clear if the asker is trying to get help from us to help him get unfair advantages in an online contest by asking an adapted version of the original challenge in the contest. It may not be necessary to develop a definition of what is an adapted version though, and the general rule &quot;Vote to close if you think it's from a ongoing challenge&quot; may suffice, but overall I think it is better to have something (whatever it is) in a &lt;strong&gt;written form&lt;/strong&gt; to properly address the issue &lt;strong&gt;explicitly&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Feel free to vote to close this question if it is a duplicate.&lt;/p&gt;&#xA;" OwnerUserId="77134" LastEditorUserId="77134" LastEditDate="2018-03-06T05:28:02.903" LastActivityDate="2018-03-06T05:28:02.903" Title="What is the policy on asking questions on ongoing competitions hosted on other sites" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14962" PostTypeId="2" ParentId="14961" CreationDate="2018-03-06T04:09:54.657" Score="5" Body="&lt;p&gt;I'll restate my opinion that I &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/43207019#43207019&quot;&gt;stated in chat earlier&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Assuming no copyright infringement issues, there is no firm policy other than &quot;use your best judgment&quot;. We don't want to compromise the integrity of external contests, but we also don't want to turn away valid challenges.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;There is no rule against posting challenges from external sites, so long as you aren't breaking any copyright/IP law. If it is a valid challenge according to our rules, it's fine. It is the responsibility of the users to respect the rules of other sites, and to respect the integrity of ongoing challenges. We cannot be expected to police our site according to the rules of other sites.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2018-03-06T04:09:54.657" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14965" PostTypeId="2" ParentId="2140" CreationDate="2018-03-06T18:00:33.223" Score="-3" Body="&lt;h1&gt;Same code, different work&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a code in a language that do these few things:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Input a positive integer &lt;code&gt;n&lt;/code&gt;, check whether it's a prime. (2 -&gt; true, 5 -&gt; true, 8 -&gt; false)&lt;/li&gt;&#xA;&lt;li&gt;Input an integer &lt;code&gt;n&amp;gt;1&lt;/code&gt;, output an array with fewest positive prime as element, where the sum of the array is &lt;code&gt;n&lt;/code&gt;. (2 -&gt; [2], 5 -&gt; [5], 6 -&gt; [3, 3], 8 -&gt; [3, 5] or [5, 3])&lt;/li&gt;&#xA;&lt;li&gt;Input an integer &lt;code&gt;n&lt;/code&gt;, output &lt;code&gt;sum(n mod i, for i=1 to n)&lt;/code&gt;. (2 -&gt; 0, 5 -&gt; 4, 8 -&gt; 8)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Your code should theoretically solve all legal &lt;code&gt;n&lt;/code&gt;, but in practive up to 1000 is enough&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Shortest code in bytes win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-04-02T11:26:47.390" LastActivityDate="2018-04-02T11:26:47.390" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14966" PostTypeId="1" CreationDate="2018-03-06T20:19:51.593" Score="13" ViewCount="221" Body="&lt;p&gt;I have an answer-chaining question in the sandbox, but I still haven't come up with a winning criterion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What scoring criteria are there for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; questions that encourage users to collaborate for a longer chain?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="46076" LastEditDate="2022-09-03T02:11:05.100" LastActivityDate="2022-09-03T02:11:05.100" Title="What answer-chaining scoring criteria promote collaboration?" Tags="|discussion|tips|answer-chaining|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="14967" PostTypeId="2" ParentId="14966" CreationDate="2018-03-06T20:53:12.460" Score="0" Body="&lt;h1&gt;It already does&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;By the nature of this type of challenge you don't get a &quot;winner&quot;. The person who breaks the chain loses which already encourages collaboration. This is probably a good argument for why this type of challenge doesn't quite fit on the site and why the existing winning criteria feels wrong.&lt;/p&gt;&#xA;" OwnerUserId="51785" LastActivityDate="2018-03-06T20:53:12.460" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14969" PostTypeId="1" AcceptedAnswerId="14971" CreationDate="2018-03-07T02:12:51.413" Score="2" ViewCount="283" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/13107/what-is-a-character-encoding-exactly&quot;&gt;Possibly&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7764/what-is-a-character&quot;&gt;relevant&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I was looking at &lt;a href=&quot;https://codegolf.stackexchange.com/a/157249/77115&quot;&gt;this answer&lt;/a&gt; and was amazed by the compactness and unreadability, when I suddenly thought: &quot;That are an awful lot of non standard characters!&quot; So I get that coding golf languages utilize single characters for extended functionality, but as I remember it, a &quot;byte&quot; are 8 bit, so only 256 one-character-commands could possibly be used. &lt;a href=&quot;https://github.com/Adriandmen/05AB1E/blob/master/docs/info.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;And then I found out that the language in question uses more.&lt;/a&gt; So, are you really that lenient with encodings? Can one just select which parts of the command list are to be taken? But then that would be the same as counting any character as 1 byte. So shouldn't languages that are okay here only use up to 256 bytes?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I understand that single characters can have an encoding bigger than 255 for display reasons, I just kinda disagree that more than 256 characters are allowed in general.)&lt;/p&gt;&#xA;" OwnerUserId="77115" LastEditorUserId="46076" LastEditDate="2018-03-30T01:09:04.313" LastActivityDate="2018-03-30T01:09:04.313" Title="What exactly is a &quot;byte&quot; here?" Tags="|discussion|scoring|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14970" PostTypeId="2" ParentId="14969" CreationDate="2018-03-07T02:33:47.203" Score="5" Body="&lt;h2&gt;A byte is a byte&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are, in fact, only 256 characters used in these types of languages!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The linked answer uses a SBCS, or a &lt;strong&gt;Single Byte Character Set&lt;/strong&gt;. The code page can be found &lt;a href=&quot;https://github.com/Adriandmen/05AB1E/wiki/Codepage&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;. Every character in 05AB1E corresponds to a single codepoint in the 256 byte range. The language uses a &lt;a href=&quot;https://github.com/Adriandmen/05AB1E/blob/ec9264d3782bc99c15b1f549f750e7af25fc58ec/lib/encoding.py&quot; rel=&quot;nofollow noreferrer&quot;&gt;translator&lt;/a&gt; to correspond UTF8 encoded source code to raw bytes. This is the same for most languages that use funky-looking characters on this site.&lt;/p&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2018-03-07T02:33:47.203" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14971" PostTypeId="2" ParentId="14969" CreationDate="2018-03-07T02:34:17.880" Score="8" Body="&lt;p&gt;05AB1E uses &lt;a href=&quot;https://github.com/Adriandmen/05AB1E/blob/master/docs/code-page.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;this code page&lt;/a&gt;, which contains exactly 256 characters. The &lt;a href=&quot;https://github.com/Adriandmen/05AB1E/blob/master/docs/info.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;info.txt&lt;/a&gt; includes many two-byte tokens (such as &lt;code&gt;ža&lt;/code&gt; and &lt;code&gt;.€&lt;/code&gt;), which is why there are more than 256.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2018-03-07T02:34:17.880" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14972" PostTypeId="2" ParentId="2447" CreationDate="2018-03-07T03:14:50.820" Score="14" Body="&lt;h1&gt;An array may be represented in input as a begin pointer and an end pointer.&lt;/h1&gt;&#xA;&lt;p&gt;like what's done in C++ std&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-02-02T05:26:34.993" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="14976" PostTypeId="2" ParentId="14966" CreationDate="2018-03-07T17:03:54.920" Score="4" Body="&lt;h3&gt;Second-to-last answer&lt;/h3&gt;&#xA;&lt;p&gt;This is (to my knowledge) basically the &amp;quot;standard&amp;quot; for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;. Essentially, the overall goal of answer chaining is to make the chain as long as possible, but in order to declare a single &amp;quot;winner&amp;quot; you want to make a condition that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Discourages answers that are difficult/impossible to follow&lt;/li&gt;&#xA;&lt;li&gt;Encourages challengers to come back and contribute again&lt;/li&gt;&#xA;&lt;li&gt;Allows the challenge to continue for as long as possible&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;A simple win condition that accomplishes these is &amp;quot;The winner is the second-to-last answer after no new answers are made within [timespan]&amp;quot;. An impossible to follow answer cannot win, a user cannot win if they stop contributing, and there isn't any upper bound for total number of answers, nor a chance for a &amp;quot;soft bound&amp;quot; where posting new answers becomes undesirable (e.g. because the scoring makes it impossible to catch up to existing challengers). An example is the &lt;a href=&quot;https://codegolf.stackexchange.com/q/102370/71434&quot;&gt;Add a language to a polyglot&lt;/a&gt; challenge which has been going on for over a year.&lt;/p&gt;&#xA;&lt;p&gt;On the other hand, as discussed in some other cases (such as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/13951/71434&quot;&gt;here&lt;/a&gt;), using this criterion as an excuse to make a challenge continue forever without a winner is more like a loophole in the &amp;quot;challenge must have a winning criterion&amp;quot; requirement. I haven't seen any better options that can simply be applied to any answer-chaining challenge though.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-03-07T17:03:54.920" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14977" PostTypeId="2" ParentId="2140" CreationDate="2018-03-07T18:45:42.443" Score="3" Body="&lt;h1&gt;Universal Self-correcting Program&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The idea here is to make a program that can tolerate errors &lt;strong&gt;in its own code&lt;/strong&gt;, while still functioning correctly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since &quot;error&quot; is too broad, we will define it by a single bit flip. Of course, more tolerant versions, that could accept swapping any character with any other character would still be valid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This program is &lt;strong&gt;universal&lt;/strong&gt; in the sense that you can write any other self-correcting program (with the same tolerance) -- more on that later. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Importantly:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;1) This program takes as input a triple-redundancy string of characters, and outputs a corrected string.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;2) This program executes correctly with any bit flip in its own code.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;(1) Triple redundancy codes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A triple redundancy code consists of simply repeating each bit, character or byte 3 times. In this case we use characters. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Correction is done by taking the majority of the characters, so (A,A,B) is corrected to &lt;em&gt;A&lt;/em&gt;, (A,B,B) is corrected to &lt;em&gt;B&lt;/em&gt; and so on.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;AAA =&amp;gt; A&#xA;AAB =&amp;gt; A&#xA;HHHEEELLXLLLXOO =&amp;gt; HELLO&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is a very crude an inefficient code for correcting single bit errors, but it is the least complex, which is why I think may be the best choice here. Hamming codes are better but a little more complex.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;(2) Error tolerance&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Our program will be defined as error tolerant if it performs the desired decoding function for any single bit flip in its own code. It may take longer for some inputs or when some flips occur, but it should always terminate.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Putting it together&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The error-tolerant program can receive as input a (possibly faulty) program, and outputs a error-free program. Therefore, if a single-bit error occurs anywhere in the system comprised of (decoder,input program), a corrected program will still be output.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Observation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I don't actually know if this is possible, quite possibly it won't be achievable in every language. If it is too hard, we may relax the tolerable errors.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The score will reflect the reliability of your program to errors. &lt;code&gt;Tolerance&lt;/code&gt; is simply the number of bit flips you code accepts anywhere. It must be at least 1 (accept 1 bit flip anywhere). &lt;code&gt;Size&lt;/code&gt; is the length of your program in bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The score is &lt;code&gt;Score = Size / 2^Tolerance&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lowest score wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/error-correction&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;error-correction&amp;#39;&quot; rel=&quot;tag&quot;&gt;error-correction&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/coding-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;coding-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;coding-theory&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/encode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;encode&amp;#39;&quot; rel=&quot;tag&quot;&gt;encode&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/radiation-hardening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; rel=&quot;tag&quot;&gt;radiation-hardening&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note&lt;/strong&gt;: Several other challenges are possibly solved by solving this one (which would make sense given its universality!) by hardcoding the input.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/107643/detect-if-your-program-has-been-mutated&quot;&gt;Detect if your program has been mutated&lt;/a&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/4486/write-a-program-that-always-outputs-2012-even-if-its-modified&quot;&gt;Write a program that always outputs “2012” - even if it's modified!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This solves the &quot;Who Watches the Watchmen?&quot; problem involved in error correcting programs, like in this challenge:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/111005/meta-radiation-hardener&quot;&gt;Meta radiation hardener&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;since the decoding program itself tolerates errors (what good would be an error correcting program that is itself in error? :p).&lt;/p&gt;&#xA;" OwnerUserId="78712" LastEditorUserId="78712" LastEditDate="2019-12-03T22:22:09.650" LastActivityDate="2019-12-03T22:22:09.650" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="14978" PostTypeId="1" CreationDate="2018-03-07T21:41:23.563" Score="7" ViewCount="505" Body="&lt;p&gt;I posted a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/157546/create-a-magic-8-ball/157548#157548&quot;&gt;question&lt;/a&gt; that received multiple up &amp;amp; down votes within the first few minutes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I assume the first few down-votes were from my question not specifying what I meant by rounding. But after specifying that, my question started receiving more up-votes, followed by more down-votes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, there were no more comments added to my question to explain why it was receiving down-votes. I also noticed all of the answers were receiving down-votes, without any comments as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there any rules on &quot;excessive down-voting&quot; or anything being done to stop it? It makes me feel like not posting any more questions if the community does not explain the reason they do not like my question, however if my question is that bad I guess you can down-vote it without a comment, but down-voting a perfectly good answer to my question seems like terms for losing down-voting privileges. If I answered this question and it was down-voted, I would delete my answer after a day or so as I do not want to lose reputation for no reason.&lt;/p&gt;&#xA;" OwnerUserId="76365" LastActivityDate="2018-03-08T07:25:38.450" Title="What to do about down-votes without comments?" Tags="|discussion|" AnswerCount="1" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="14979" PostTypeId="2" ParentId="2140" CreationDate="2018-03-07T22:00:12.503" Score="3" Body="&lt;p&gt;Note: I'm putting this challenge on the back burner for a indefinite time in favor of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/16435#16435&quot;&gt;Hierarchies&lt;/a&gt; challenge. Go check that or the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/16415#16415&quot;&gt;Formic Forest&lt;/a&gt; out if you're interested in a Formic sequel.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Formic Functions 3: Memory&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;This is a preliminary write-up of a new challenge heavily inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/135102/formic-functions-ant-queen-of-the-hill-contest/&quot;&gt;&lt;strong&gt;Formic Functions&lt;/strong&gt;&lt;/a&gt;. The spec is based on the original challenge's spec - credits for most of what you'll read here to &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/20283/trichoplax&quot;&gt;trichoplax&lt;/a&gt;&lt;/strong&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each player starts with one ant - a queen, who collects food. Each piece of food can be held or used to produce a worker. Workers also collect food to be brought back to the queen.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All players compete in one arena. The winner is the queen holding the most food after she has taken &lt;s&gt;8,000&lt;/s&gt; 10,000 &lt;strong&gt;[Thanks @Draco18s]&lt;/strong&gt; turns. Ants can communicate by changing the colors of the arena squares (which can also be modified by rivals), as well as by storing messages for their peers.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The arena&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The arena is a toroidal (edge wrapping) grid of hexagonal cells arranged in a rhombus of side length 1000. All cells start as color 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Initially exactly &lt;s&gt;1%&lt;/s&gt; 0.5% of cells will contain food. The 5000 pieces of food will be scattered uniformly randomly. No new food will be introduced during the game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The queens will be placed randomly on empty cells, with no guarantee that they will not be adjacent to each other (although this is very unlikely).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Ant abilities&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Sight:&lt;/strong&gt; Each ant sees the 7 cells in its neighborhood. It has no knowledge of any other ants outside this neighborhood. It sees the contents of each of the 7 cells (other ants and food), and also each cell's &lt;em&gt;color&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Memory:&lt;/strong&gt; Each ant has access to a string as its memory. It is initially empty for the queen, and must be initialized by the queen when spawning a worker. For ways to change the memory after initialization, see &lt;strong&gt;Output&lt;/strong&gt; below.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;No orientation:&lt;/strong&gt; An ant does not know where it is or which way it faces - it has no concept of North. The neighborhood will be presented to it at a randomly rotated orientation that changes each turn so it cannot even walk in a straight line unless it has colors to guide it. &lt;em&gt;(Making the same move every turn will result in a random walk rather than a straight line.)&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Moving, color marking, producing workers and transferring food:&lt;/strong&gt; See &lt;strong&gt;Output&lt;/strong&gt; below.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Immortality:&lt;/strong&gt; These are highland ants that cannot die. You can confuse rival ants by changing the colors around them, or constrain them from moving by surrounding them with 6 ants of your own, but they cannot be harmed apart from this. &lt;strong&gt;[Should ants be able to die? If so, how?]&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Carrying food:&lt;/strong&gt; A worker can carry up to 1 piece of food. A queen can carry an arbitrary amount of food.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Coding&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Provide a function body&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each ant is controlled by an ant function. &lt;strong&gt;&lt;em&gt;Each turn the player's ant function is called separately for each ant (not just once per player, but once for the queen and once for each worker that player controls).&lt;/em&gt;&lt;/strong&gt; Each turn, the ant function will receive its input and return a move for that particular ant.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Post an answer containing a code block showing the body of a JavaScript function, and it will be automatically included in the controller. The name of the player forms the title of the answer, in the form &lt;code&gt;# PlayerName&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;No access to outside data&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Functions must be fully deterministic. When called with a given input, they must return the same output every time. A function must not access global variables and must not store state between turns in other ways than through the provided memory string. It may use built in functions that do not involve storing state or accessing data from the outside. For example, the use of &lt;code&gt;Math.abs()&lt;/code&gt; is fine, but &lt;code&gt;Date.getTime()&lt;/code&gt;, &lt;code&gt;Math.random()&lt;/code&gt; must not be used.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;An ant function may only use a pseudo random number generator that it supplies itself, that utilizes data provided through input.&lt;/strong&gt; For example, it may implement its own pseudo RNG via its memory string, seeded by the environment (or statically).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A simple random strategy is still possible due to the random orientation of the input - an ant that always chooses the same direction will perform a random walk rather than a straight line path.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An ant function is permitted to contain further functions within its body.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input and output&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The orientation of the input will be chosen at random for each ant and for each turn. The input will be rotated by 0, 60, 120, 180, 240 or 300 degrees, but will never be reflected.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Cells are numbered in this order:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 0 1&#xA;5 6 2&#xA; 4 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The ant function will receive an array called &lt;code&gt;view&lt;/code&gt;, containing an object for each of the 7 visible cells. Each object will have the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;color: a number from 1 to 8&#xA;food: 0 or 1&#xA;ant: null if there is no ant on that cell, or otherwise an ant object&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;[Is 8 colors perhaps too many?]&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a cell contains an ant, the ant object will have the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;food: 0 or more (maximum 1 for a worker)&#xA;queen: true or false&#xA;friend: true or false&#xA;memory: memory string when friendly, otherwise undefined&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;[&lt;s&gt;Should ants be able to read rivals' memories?&lt;/s&gt; This would cause rampant edit wars. Rejected.]&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The ant can determine its own details by looking at the ant in the central cell, &lt;code&gt;view[6].ant&lt;/code&gt;. For example, &lt;code&gt;view[6].ant.memory&lt;/code&gt; contains the memory of the executing ant.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Output is returned as an object representing the action to take. This can have any of the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;cell: a number from 0 to 6 (mandatory)&#xA;color: a number from 1 to 8 (optional)&#xA;spawn: a string (optional)&#xA;memory: a string (optional)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If &lt;code&gt;color&lt;/code&gt; and &lt;code&gt;spawn&lt;/code&gt; are omitted or non-&lt;a href=&quot;https://developer.mozilla.org/en-US/docs/Glossary/Truthy&quot; rel=&quot;nofollow noreferrer&quot;&gt;truthy&lt;/a&gt;, then &lt;code&gt;cell&lt;/code&gt; indicates the cell to move to.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If &lt;code&gt;color&lt;/code&gt; is a number, the indicated cell is set to that number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If &lt;code&gt;spawn&lt;/code&gt; is a string, a worker ant is created on the indicated cell. The new worker will have its &lt;code&gt;memory&lt;/code&gt; initialized to that string. The string cannot be longer than 256 characters. Only a queen can create a new worker, and only if she has food, as this costs one piece of food per worker.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If &lt;code&gt;memory&lt;/code&gt; is a string, the executing ant will have its &lt;code&gt;memory&lt;/code&gt; immediately changed to that string. The string cannot be longer than 65,536 characters for the queen, and 256 characters for workers. An ant may change its memory while also performing a different action - changing memory does not take a turn.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;[Should changing own memory take a turn?]&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;[Should ants be able to send a message directly to another ant's &lt;code&gt;inbox&lt;/code&gt;? For example, a message could look like this: &lt;code&gt;{title:&quot;help&quot;, content:view_array_of_sender}&lt;/code&gt;. An ant should also be able to perform an action while sending a message, otherwise the described behavior could be emulated.]&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;[Should ants be able to see the age of an ant? This behavior will often be emulated with memory. Is there a reason &lt;em&gt;not&lt;/em&gt; to do that?]&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;[&lt;s&gt;Is 65,536 characters a good number to pick for the max length of memory?&lt;/s&gt; Thanks to @Draco18s's and @dzaima's advice, workers now have significantly less memory than a queen.]&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example outputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{cell:0}: move to cell 0&#xA;{cell:5, memory:&quot;abc&quot;}: move to cell 5 and set own memory to &quot;abc&quot;&#xA;{cell:6}: move to cell 6 (that is, do nothing, as 6 is the central cell)&#xA;{cell:6, color:8}: set own cell to color 8&#xA;{cell:2, color:1, memory:&quot;hey&quot;}: set cell 2 to color 1 and set own memory to &quot;hey&quot;&#xA;{cell:1, spawn:&quot;def&quot;, memory:&quot;5252&quot;}: create a worker with its memory initialized to &quot;def&quot; on cell 1 and set own memory to &quot;5252&quot;&#xA;{cell:3, color:0}: equivalent to just `{cell:3}` - move rather than set color&#xA;{cell:1, spawn:0}: equivalent to just `{cell:1}` - move rather than create worker&#xA;{cell:4, color:0, spawn:0}: move to cell 4 - color 0 and type 0 are ignored&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Invalid outputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{cell:7}: cell must be from 0 to 6&#xA;{cell:0, color:9}: color must be from 1 to 8&#xA;{cell:0, spawn:true}: spawn must be a string&#xA;{cell:6, spawn:&quot;254&quot;}: cannot create a worker on a non-empty cell&#xA;{cell:0, color:1, spawn:&quot;77&quot;}: cannot set color and create worker in the same turn&#xA;{cell:3, memory:true}: cannot set memory to non-string&#xA;{cell:2, spawn:true}: cannot create a worker with a non-string memory&#xA;{cell:0, memory:long_string}: (if long_string is a string of length &amp;gt; 65536) cannot set memory to a string of length greater than 65536&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;[Missed any?]&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An ant moving onto a cell containing food will automatically pick up the piece of food. If that ant is a laden worker, it will move onto the cell without picking up the piece of food.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An unladen worker trying to move onto an enemy queen with food will steal one piece of food from her instead. A laden worker trying to move onto an unladen friendly worker or a friendly queen will give its food to their target instead.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Turn order&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Ants take turns in a set order. At the start of a game the queens are assigned a random order which does not change for the rest of the game. When a queen creates a worker, that worker is inserted into the turn order at the position before its queen. This means that all other ants belonging to all players will move exactly once before the new worker takes its first turn.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Limit on number of players&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Obviously an unlimited number of players cannot fit into the arena. If there are more than 8 answers, only 8 of them will play in any one game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;[Good max number of players?]&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Time limit per turn&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Each time the ant function is called, it should return within 20 milliseconds. Since the time limit may be exceeded due to fluctuations outside the ant function's control, an average will be calculated. If at any point the average is above 20 milliseconds and the total time taken by that particular ant function across all calls so far is more than 10 seconds, the relevant player will be disqualified.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;[Enough time?]&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Disqualification&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This means the player will not be eligible to win and their ant function will not be called again during that game. They will also not be included in any further games. If a player is disqualified on the tournament machine during a leaderboard game then it will be excluded from all future leaderboard games until edited.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A player will be disqualified for any of the following for any of its ants (queen or worker):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Exceeding the time limit as described.&lt;/li&gt;&#xA;&lt;li&gt;Returning an invalid move as described under Output.&lt;/li&gt;&#xA;&lt;li&gt;The cell to move to contains an ant and the case isn't defined under Output.&lt;/li&gt;&#xA;&lt;li&gt;The cell to produce a worker on contains an ant.&lt;/li&gt;&#xA;&lt;li&gt;A worker is trying to produce a worker.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;[Did I miss any?]&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It may seem harsh to disqualify for invalid moves, rather than simply interpreting this as no move. However, I believe that enforcing correct implementations will lead to more interesting strategies over time. This is not intended to be an additional challenge, so a clear reason will be displayed when a player is disqualified, with the specific input and output alongside to aid in fixing the code.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Multiple answers and editing&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You may provide multiple answers, provided that they do not team up against the others. Provided each answer is working solely towards its own victory, you are permitted to tailor your strategy to take advantage of weaknesses in specific other strategies, including changing the color of the cells to confuse or manipulate them. Bear in mind that as more answers come in, the likelihood of meeting any particular player in a given game will diminish.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may also edit your answers whenever you choose. It is up to you whether you post a new answer or edit an existing one. Provided the game is not flooded with many near-identical variations, there should be no problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you make a variation of another person's answer, please remember to give them credit by linking to their answer from yours.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;At the end of each game, a player's score is the number of other players who have less food carried by their queen. Food carried by workers is not counted. This score is added to the leaderboard, which is displayed in order of average score per game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Joint places indicate that the order of players is not yet consistent between 6 subsets of the games played so far. The list of games is split into 6 subsets because this is the minimum number that will give a probability of less than 5% that a given pair of players will be assigned distinct places in the wrong order.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;[Scoring mechanism subject to change.]&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;[New feature/modification recommendations are very welcome! I want this challenge to be as different from the original Formic as possible, while keeping its spirit.]&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hexagonal-grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hexagonal-grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;hexagonal-grid&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="74965" LastEditorUserId="74965" LastEditDate="2018-05-25T09:39:58.700" LastActivityDate="2018-05-25T09:39:58.700" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="14980" PostTypeId="2" ParentId="14978" CreationDate="2018-03-08T07:25:38.450" Score="12" Body="&lt;h2&gt;Nothing&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Downvotes are a part of the system and if you are active on the site for long enough you are bound to receive them.  Stressing endlessly over downvotes doesn't do much good for you, especially if the person who downvoted hasn't left a reason.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some people suggest leaving a comment demanding an explanation along the lines of &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;@downvoters Why?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;but I'm not really sure how effective these are.  I tend to avoid them because they are usually just noise, but I have seen them work in some scenarios.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you only have one or two downvotes and a positive score I would spend a moment to see if there is an obvious reason someone might downvote. If you can see one great!  You can now try and fix it. however if you can't I would suggest allowing it to slip from your mind.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2018-03-08T07:25:38.450" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14982" PostTypeId="2" ParentId="2140" CreationDate="2018-03-08T09:36:37.907" Score="2" Body="&lt;h1&gt;Minimal dot matrix adressing&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary&amp;#39;&quot; rel=&quot;tag&quot;&gt;binary&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider a typical dot-matrix LED module. The LEDs are addressed in rows and columns. A LED will light up iff the voltage on the row &lt;code&gt;R&lt;/code&gt; it's on is high (&lt;code&gt;1&lt;/code&gt;), and the column &lt;code&gt;C&lt;/code&gt; it's on is set to low (&lt;code&gt;0&lt;/code&gt;). For example,&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1  | 0 1 1 0 &#xA;0  | 0 0 0 0 &#xA;0  | 0 0 0 0 &#xA;1  | 0 1 1 0 &#xA;^  +---------&#xA;R C&amp;gt; 1 0 0 1 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In other words, state of the LED at the &lt;code&gt;r&lt;/code&gt;th row and &lt;code&gt;c&lt;/code&gt;th column will be &lt;code&gt;r AND NOT(c)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To make arbitrary images, different parts of the matrix are lighted up sequentially. In other words, the sequential frames form the final image through element-wise OR. For example (adressing row-by-row)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;| 1 0 0 1    Frame 1: R=[1 0 0 0]', C=[0 1 1 0]&#xA;| 0 1 0 0    Frame 2: R=[0 1 0 0]', C=[1 0 1 1]&#xA;| 0 0 1 0    Frame 3: R=[0 0 1 0]', C=[1 1 0 1]&#xA;| 0 0 1 0    Frame 4: R=[0 0 0 1]', C=[1 1 0 1]&#xA;+--------&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;However, a more efficient way would be to address the third and fourth row together in a single frame, &lt;code&gt;Frame 3: R=[0 0 1 1]', C=[1 1 0 1]&lt;/code&gt;. This way, we can address the entire display in only three frames.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to make a program or function that outputs the required frames to display an arbitrary dot-matrix, using as few frames as possible.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A &lt;strong&gt;binary square matrix&lt;/strong&gt; taken in any of the default input methods in any convenient format. To allow for submissions taking the input as bytes, the &lt;strong&gt;size of the matrix will always be a multiple of 8&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A minimal set of frames that addresses only the required LEDs, using any of the default output methods in any convenient format. This includes outputting bytes or hex representations rather than vectors of &lt;code&gt;1&lt;/code&gt;s and &lt;code&gt;0&lt;/code&gt;s. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Testcases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Note: the output given is just one way of addressing the matrix. There may be many different options; however, your solution must not use more frames than these examples.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Testcase 1&#xA;&#xA;   Binary:                            Hex:    &#xA;   0 0 0 0 0 0 0 0                    00&#xA;   0 1 1 1 1 0 0 0                    1E&#xA;   0 1 1 1 1 0 0 0                    1E&#xA;   0 1 1 1 1 0 0 0                    1E&#xA;   0 1 1 1 1 1 0 0                    3E&#xA;   0 0 0 0 1 1 0 0                    30&#xA;   0 0 0 0 0 0 0 0                    00&#xA;   0 0 0 0 0 0 0 0                    00&#xA;&#xA;Frame 1: R=[0 1 1 1 1 0 0 0]', C=[1 0 0 0 0 1 1 1]; (hex: R=1E, C=E1)&#xA;Frame 2: R=[0 0 0 0 1 1 0 0]', C=[1 1 1 1 0 0 1 1]; (hex: R=30, C=CF)&#xA;&#xA;Testcase 2 &#xA;&#xA;   Binary:                            Hex:&#xA;   1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0    0001&#xA;   0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0    0000&#xA;   0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0    0000&#xA;   0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0    0000&#xA;   0 0 0 1 1 1 1 1 1 1 1 1 0 0 0 0    0FF8&#xA;   0 0 0 1 1 1 1 1 1 1 1 1 0 0 0 0    0FF8&#xA;   0 0 0 1 1 1 0 1 1 1 1 1 0 0 0 0    0FB8&#xA;   1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1    FFFF&#xA;   0 0 0 1 1 1 1 1 1 1 1 1 0 0 0 0    0FF8&#xA;   0 0 0 1 1 1 1 1 1 1 1 1 0 0 0 0    0FF8&#xA;   0 0 0 1 1 1 1 1 1 1 1 1 0 0 0 0    0FF8&#xA;   0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0    0000&#xA;   0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0    0000&#xA;   0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0    0000&#xA;   0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0    0000&#xA;   0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1    8000 &#xA;&#xA;Doable in 6 frames.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Make sure your submission also handles a matrix of all ones and all zeros (both of course can be handled in a single frame).&lt;/p&gt;&#xA;" OwnerUserId="32352" LastEditorUserId="32352" LastEditDate="2018-03-08T19:06:23.137" LastActivityDate="2018-03-08T19:06:23.137" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14986" PostTypeId="2" ParentId="2140" CreationDate="2018-03-08T18:13:34.120" Score="0" Body="&lt;h1&gt;There, I fixed it (with recycled parts)&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given a string containing only letters &lt;code&gt;a-z&lt;/code&gt; (either upper- or lowercase), fix it by adding characters to it so that the difference between two adjacent characters is no more than one, or if you can't, remove offending characters (in order) until the string satisfies the requirement.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, &lt;code&gt;abcdfge&lt;/code&gt; must be fixed either by adding an &lt;code&gt;e&lt;/code&gt;, resulting in &lt;code&gt;abcdefge&lt;/code&gt;, or by removing &lt;code&gt;f&lt;/code&gt; and &lt;code&gt;g&lt;/code&gt;, resulting in &lt;code&gt;abcde&lt;/code&gt;. Removing must be done only if adding can't be done.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can add characters only from a recycle bin, which your program or function must store between calls. Characters removed from the string are placed in the recycle bin, and added characters are removed from the bin. The bin can store multiple instances of the same character. In the beginning, the bin is empty.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you can't fix the whole string by adding characters, don't add any characters. That is, only ever either add or cut a string, not a bit of both.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;First call:&#xA;  Recycle bin: &quot;&quot; (empty)&#xA;  Input:       &quot;abcdfge&quot;&#xA;  Output:      &quot;abcde&quot;          // 'f' and 'g' are removed and placed in the recycle bin&#xA;&#xA;Second call:&#xA;  Recycle bin: &quot;fg&quot;&#xA;  Input:       &quot;defhiabcdeg&quot;&#xA;  Output:      &quot;defghiabcdefg&quot;  // 'f' and 'g' are taken from the recycle bin and placed&#xA;                                // where they are needed.&#xA;&#xA;Third call:&#xA;  Recycle bin: &quot;&quot;&#xA;  Input:       &quot;codegolf&quot;&#xA;  Output:      &quot;cdef&quot;           // The two 'o's and the 'g' and the 'l' are removed and&#xA;                                // placed in the recycle bin.&#xA;&#xA;Fourth call:&#xA;  Recycle bin: &quot;oogl&quot;&#xA;  Input:       &quot;mnpqrt&quot;&#xA;  Output:      &quot;mn&quot;             // 'o' could be added, but it isn't, because an 's' is&#xA;                                // also missing and we don't have one. &quot;pqrt&quot; are added&#xA;                                // to the recycle bin.&#xA;&#xA;Fifth call:&#xA;  Recycle bin: &quot;ooglpqrt&quot;&#xA;  Input:       &quot;kmnrsu&quot;&#xA;  Output:      &quot;klmnopqrstu&quot;    // Characters &quot;lopqt&quot; are added from the bin to fill all&#xA;                                // the gaps. Unused characters are left in the bin.&#xA;&#xA;Sixth call:&#xA;  Recycle bin: &quot;ogr&quot;&#xA;  Input:       &quot;qwerty&quot;&#xA;  Output:      &quot;qe&quot;             // The gap between 'q' and 'w' can't be fixed so 'q' is&#xA;                                // removed. 'e'-'q' &amp;lt; 0 and therefore not more than 1,&#xA;                                // so 'e' stays. The rest of the characters are removed.&#xA;                                // The recycly bin will contain &quot;ogrwrty&quot;.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the goal is to make your code as short as possible in whatever language you choose to participate with.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="61405" LastActivityDate="2018-03-08T18:13:34.120" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14988" PostTypeId="1" CreationDate="2018-03-08T23:31:58.073" Score="10" ViewCount="310" Body="&lt;p&gt;The community &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12877/61384&quot;&gt;has decided&lt;/a&gt; that answers in newer languages can now compete in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; (they were previously required to be marked as non-competing). However, now and then I will still come across an answer that hasn't been updated with this rule yet, so it is still marked as non-competing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have been both the sender and recipient of comments asking to remove the non-competing note from a submission, and I am wondering whether these comments are necessary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we try to get permission from the poster before editing? Should we just edit it out without notifying them? Or should we just leave them?&lt;/p&gt;&#xA;" OwnerUserId="61384" LastActivityDate="2018-03-09T23:55:17.370" Title="Answers still marked as &quot;non-competing&quot;" Tags="|discussion|code-golf|" AnswerCount="4" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14989" PostTypeId="2" ParentId="14988" CreationDate="2018-03-08T23:44:15.243" Score="14" Body="&lt;p&gt;Editing the text out yourself is fine, but don't get too carried away, lest you bump a lot of old challenges to the front page. The general rule of thumb for doing mass edits is to only edit content on around 5 questions per day to prevent drowning out new content with the bumps. I'd also suggest leaving a comment to avoid confusion.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2018-03-09T23:55:17.370" LastActivityDate="2018-03-09T23:55:17.370" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="14990" PostTypeId="2" ParentId="14988" CreationDate="2018-03-09T04:08:57.080" Score="4" Body="&lt;h1&gt;Edit, and preferably leave a comment&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We don't need to ask permission from the author to revoke NC status—it's not within their control anyway (we don't allow users to simply &lt;em&gt;decide&lt;/em&gt; that their submission should be NC). If it is left there, it constitutes an oversight that should simply be corrected.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, it's not particularly important, so try not to let that be your only edit to the post—do it in conjunction with a bunch of other minor edits, or with a larger edit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, as @Mego said, it's a good idea to leave a comment on the answer as well. Something like this might work:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I've removed the &quot;non-competing&quot; note from your post because &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12877/61384&quot;&gt;languages postdating the challenge can compete&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="61384" LastEditDate="2018-03-09T19:57:41.593" LastActivityDate="2018-03-09T19:57:41.593" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="14991" PostTypeId="2" ParentId="14889" CreationDate="2018-03-09T05:24:27.497" Score="1" Body="&lt;h1&gt;How I started&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Unlike many here, I actually started by posting a challenge. In fact, I posted 4 different challenges before I posted my first golf. And my first golf was actually a self-answer on that fourth challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since then, I've abused Python 2, Python 3, Z, CJam, Brainfuck, Underload (and Betaload), ///, &gt;&amp;#xfeff;&amp;lt;&gt;, Check, Headsecks, Bash, Foam, Jelly, J, Dreaderef, Pip, MiLambda, Ternary, Golunar, Glass, Momema, Felix, and Haskell.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I almost never use a language that's already been used before on a challenge, because I am more interested in getting a solution working in an obscure esolang than in the competitive aspect. If you feel similarly (or if you're bad at golfing, as I am), here's my process:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Write some challenges.&lt;/li&gt;&#xA;&lt;li&gt;Make some esolangs and golf in them.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Since you're the creator (and in my case, usually the only user) of your esolangs, you're probably the one who knows them best. To me, the best esolangs are always ones where golfing is very tricky.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="61384" LastEditDate="2018-03-09T05:57:45.063" LastActivityDate="2018-03-09T05:57:45.063" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14992" PostTypeId="2" ParentId="2140" CreationDate="2018-03-09T07:25:51.773" Score="4" Body="&lt;h1&gt;Make a Sierpinski triangle&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to output a n-th order right-angle Sierpinski triangle, similar to this (third-order):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#&#xA;# #&#xA;#   #&#xA;# # # #&#xA;#       #&#xA;# #     # #&#xA;#   #   #   #&#xA;# # # # # # # #&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Input:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A number, n, and a character (in this example '#');&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A 2**n (two to the n) line Sierpinski triangle, made of the given character.&#xA;You could consider it a two-state cellular automaton: the cells are separated by a single spaaace; if it is on, it contains the given character; Otherwise is contains a spaaace.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;in:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 *&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;out:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;*&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;explanation:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2**0=1&lt;/p&gt;&#xA;&#xA;&lt;p&gt;in:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 *&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;out:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;*&#xA;* *&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;in:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2 *&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;out:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;*&#xA;* *&#xA;*   *&#xA;* * * *&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Winner:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;this is codegolf so the winner is the answer with the least bytes. (&lt;em&gt;NOTE&lt;/em&gt;: might add something tho do with triangles of the same character.)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Hint:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;it might be helpful to know that the n-th line contains the previous line xor that line shifted right by one cell (x^(x&gt;&gt;1)).&lt;/p&gt;&#xA;" OwnerUserId="69938" LastEditorUserId="69938" LastEditDate="2018-03-09T07:35:27.950" LastActivityDate="2018-03-09T07:35:27.950" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14995" PostTypeId="2" ParentId="14988" CreationDate="2018-03-09T22:03:51.187" Score="-3" Body="&lt;h1&gt;Don't edit if the answer predates the rule change&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If the answer &lt;em&gt;was&lt;/em&gt; non-competing at the time of writing as per the rule that was in force &lt;em&gt;then&lt;/em&gt;, I see no point in changing it now.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is similar to how we don't close an old challenge just because it doesn't conform to some current, more stringent rule.&lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2018-03-09T22:09:08.680" LastActivityDate="2018-03-09T22:09:08.680" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="14996" PostTypeId="2" ParentId="14988" CreationDate="2018-03-09T22:09:19.600" Score="2" Body="&lt;h1&gt;Leave a comment if the answer postdates the rule change&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If the answer is posted &lt;em&gt;now&lt;/em&gt; that the “non-competing” rule is gone and has been marked as non-competive, that probably means that the author is not aware of the change of rule. In that case leave a comment with a link to the new rule.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is true that the author doesn't get to decide whether the answer is competing or not but, I wouldn't go as far as editing the answer because of this.&lt;/p&gt;&#xA;" OwnerUserId="36398" LastActivityDate="2018-03-09T22:09:19.600" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14997" PostTypeId="1" AcceptedAnswerId="14998" CreationDate="2018-03-10T15:45:35.127" Score="-9" ViewCount="178" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11807/be-nice-applies-to-off-topic-questions-too&quot;&gt;Related&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Occasionally, PPCG gets an off-topic post or two. Usually, these are closed fairly quickly, and the user is informed that this isn't what this site is about. The majority of the time, the user is posting here because they have misunderstood the point of the site, not because they want to deliberately spam the site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, recently, I've been noticing a trend in the voting patterns of said off-topic posts. Off topic posts are quickly getting downvoted, as well as closed. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/157678/mod-auth-basic-so-not-found-after-upgrading-from-2-23-to-2-4-29&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/157578/for-some-reason-my-time-will-not-show-up-on-my-program-im-new-to-python&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/157201/play-with-numbers-challenge-hackerearth&quot;&gt;3&lt;/a&gt;. These are all deleted, but have the vote scores -4, -3 and -5.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sure these posts aren't a good or right fit for the site, but that doesn't mean they are worth a lot of downvotes, which can give a negative impression of the site towards the new users posting this off-topic content. I'm not saying we don't downvote spam posts, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/157147&quot;&gt;this&lt;/a&gt;, but posts that are unintentionally against our on-topic guidelines have no reason to be downvoted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm proposing that we stop downvoting these off-topic posts into oblivion, and instead leave a single downvote and a comment explaining why the post isn't right for this site. What do you think?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2018-03-10T17:24:18.863" Title="Don't downvote off topic posts into oblivion" Tags="|discussion|new-users|voting|" AnswerCount="3" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="14998" PostTypeId="2" ParentId="14997" CreationDate="2018-03-10T16:04:31.283" Score="22" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;posts that are unintentionally against our on-topic guidelines have no reason to be downvoted.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is false; posts with a score of &lt;strong&gt;-4&lt;/strong&gt; or lower do not appear on the front page.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Making low quality content less visible than high quality content is pretty much why we cast downvotes in the first place, so this is reason enough to downvote unsalvagably off-topic posts.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2018-03-10T16:04:31.283" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="14999" PostTypeId="2" ParentId="14997" CreationDate="2018-03-10T16:57:26.040" Score="12" Body="&lt;p&gt;In addition to what Dennis said, one of the reasons for downvoting is &quot;...does not show any research effort&quot;. Not bothering to check if &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;the site where the question is posted is appropriate for the question&lt;/a&gt; counts for no research effort.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2018-03-10T16:57:26.040" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="15000" PostTypeId="2" ParentId="14997" CreationDate="2018-03-10T17:24:18.863" Score="3" Body="&lt;p&gt;A post being off-topic is enough of a reason for people to downvote it, as Dennis and Mego have already said. If you worry about the user feeling insulted, you can leave a comment explaining why you acted this way, to reassure the user you have objective, written reasons to do so. If the user is being reluctant to read the Tour page (big banner on top of the front page) and Help Center, then there's pretty much nothing we can do to further help them.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2018-03-10T17:24:18.863" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="15002" PostTypeId="2" ParentId="2140" CreationDate="2018-03-11T08:33:50.270" Score="0" Body="&lt;p&gt;I wrote the following question then found &lt;a href=&quot;https://codegolf.stackexchange.com/questions/110812/find-recursively-prime-primes&quot;&gt;this&lt;/a&gt; question. Is it similar enough to mine that mine would be considered a duplicate?&lt;/p&gt;&#xA;&lt;h1&gt;Recursive Prime Multiplicative Base&lt;/h1&gt;&#xA;&lt;p&gt;I've been thinking about this idea for months now, and, as far as I have been able to find, nobody else has thought of it. Please let me know if I wasn't the first!&lt;/p&gt;&#xA;&lt;p&gt;Most number systems are additive positional. These take the form of ∑b&lt;sub&gt;i&lt;/sub&gt;*d&lt;sub&gt;i&lt;/sub&gt;, where d&lt;sub&gt;i&lt;/sub&gt; is the sequence of digits and b&lt;sub&gt;i&lt;/sub&gt; is the base sequence. For example, for the number 1234 in base ten, d&lt;sub&gt;i&lt;/sub&gt;={4,3,2,1,0,0,0...} and b&lt;sub&gt;i&lt;/sub&gt;=10&lt;sup&gt;i&lt;/sup&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I propose the idea of a multiplicative positional system.&lt;sup&gt;1&lt;/sup&gt; This instead takes a general form of ∏b&lt;sub&gt;i&lt;/sub&gt;&lt;sup&gt;d&lt;sub&gt;i&lt;/sub&gt;&lt;/sup&gt;. The most obvious useful multiplicative base is that of b&lt;sub&gt;i&lt;/sub&gt;=P&lt;sub&gt;i&lt;/sub&gt;, where P&lt;sub&gt;i&lt;/sub&gt; is the i-th prime number. For example, one could write 3960 as &lt;code&gt;3,2,1,0,1&lt;/code&gt;&lt;sup&gt;2&lt;/sup&gt;, as 2&lt;sup&gt;3&lt;/sup&gt;*3&lt;sup&gt;2&lt;/sup&gt;*5&lt;sup&gt;1&lt;/sup&gt;*7&lt;sup&gt;0&lt;/sup&gt;*11&lt;sup&gt;1&lt;/sup&gt;=3960. This is mathematically interesting (e.g. multiplication gets reduced to addition, but addition is way harder) but we're still using an additive system underneath. This obviously cannot do. Thankfully, we can use recursion! This is probably best illustrated with an example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;3960=&#xA;  3    2   1  0 1&#xA;(0 1) (1)  () 0 ()&#xA;(0()) (()) () 0 ()&#xA;=(0())(())()0()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;As you can see, each nonzero digit gets replaced with that digit's representation. 1 gets replaced with (), as a blank sequence is equivalent to an infinite series of zeros, and anything to the power of zero is one. If one were to include a symbol representing negation, one could write any rational number and even any expression obtainable from the integers using a finite number of multiplications and exponentiations in a finite sequence of four characters.&lt;/p&gt;&#xA;&lt;p&gt;To give this number system a name, I term it the &lt;strong&gt;recursive prime multiplicative base&lt;/strong&gt; or &lt;strong&gt;RPMB&lt;/strong&gt; (unless you have any better ideas for it).&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt;Extending this, one can conceive of an infinite number of &lt;a href=&quot;https://en.wikipedia.org/wiki/Hyperoperation&quot; rel=&quot;nofollow noreferrer&quot;&gt;hyperoperational&lt;/a&gt; positional systems, but that's for another code challenge. ;)&lt;/p&gt;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&lt;p&gt;You are to write a program that, when given an integer as input outputs the RPMB form of that integer. The output may be either as a string or a list. If the output is a string, you may substitute any characters for &lt;code&gt;()0&lt;/code&gt;. If the output is a list, the output should be a list of 0's and other lists matching this description. For example, for 3960, the program might output &lt;code&gt;[[0,[]],[[]],[],0,[]]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;(todo)&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the smallest program in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="41938" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-03-11T17:31:04.273" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="15006" PostTypeId="2" ParentId="2140" CreationDate="2018-03-11T21:58:39.703" Score="0" Body="&lt;h1&gt;Split the wagons! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In some variants of APL, a tacit function, or a &lt;em&gt;train&lt;/em&gt;, consists of several functions next to each other. Your task is, given a train, to separate the different functions it consists of.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The symbols you will be given and their meanings are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;F&lt;/strong&gt;: Function&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;O&lt;/strong&gt;: Dyadic operator&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Here is how functions are separated in extended Backus-Naur form:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function ::= {F O} F&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Namely, a dyadic operator &lt;strong&gt;O&lt;/strong&gt; accepts one function to its left and one &lt;strong&gt;F&lt;/strong&gt; to its right, and the result is one function, for example &lt;strong&gt;F O F&lt;/strong&gt;, &lt;strong&gt;F O F O F O F&lt;/strong&gt; and &lt;strong&gt;F O F O F O F O F O F&lt;/strong&gt; are all considered single functions for the purposes of this challenge. &lt;strong&gt;F F F O F O F F F O F&lt;/strong&gt;, however, isn't a single function, and is split as (&lt;strong&gt;F&lt;/strong&gt;, &lt;strong&gt;F&lt;/strong&gt;, &lt;strong&gt;F O F O F&lt;/strong&gt;, &lt;strong&gt;F&lt;/strong&gt;, &lt;strong&gt;F O F&lt;/strong&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can get the symbols in any reasonable form, including a string, an array of integers, and any other kind of ordered collection able to hold at least 2 different elements. You can assume the input doesn't start or end with &lt;strong&gt;O&lt;/strong&gt;, or contain two &lt;strong&gt;O&lt;/strong&gt;s in a row. However, you must always use the same symbols, and you must only use two unique symbols. The output can be one of:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;List of indices (0- or 1-based) which are the locations of the first symbol of each function. The index representing the first symbol of the input can be optionally omitted, as it's implied. The list doesn't have to be ordered.&lt;/li&gt;&#xA;&lt;li&gt;List of indices (0- or 1-based) which are the locations of the last symbol of each function. The index representing the last symbol of the input can be optionally omitted, as it's implied. The list doesn't have to be ordered.&lt;/li&gt;&#xA;&lt;li&gt;List of the individual functions. Every element of this list is a list subject to the same restrictions as the input, but not necessarily in the same format as the input. However, all elements must have the same format. The list has to be ordered.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Do not include empty partitions or duplicate, out-of-bounds or negative indices in the output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Below are some test cases. &lt;code&gt;F&lt;/code&gt; and &lt;code&gt;O&lt;/code&gt; are used for &lt;strong&gt;F&lt;/strong&gt; and &lt;strong&gt;O&lt;/strong&gt; respectively, and the output is a list of the separated parts.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(empty) -&amp;gt; (empty)&#xA;F -&amp;gt; F&#xA;FOF -&amp;gt; FOF&#xA;FOFOFOF -&amp;gt; FOFOFOF&#xA;FOFOFOFOFOF -&amp;gt; FOFOFOFOFOF&#xA;FFFOFOFFFOF -&amp;gt; F F FOFOF F FOF&#xA;FFOFOFFOF -&amp;gt; F FOFOF FOF&#xA;FFFFF -&amp;gt; F F F F F&#xA;FOFF -&amp;gt; FOF F&#xA;FFFF -&amp;gt; F F F F&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2018-03-19T20:01:18.527" LastActivityDate="2018-03-19T20:01:18.527" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="15007" PostTypeId="1" CreationDate="2018-03-12T01:41:49.097" Score="1" ViewCount="93" Body="&lt;p&gt;E.g. requiring to call by &lt;code&gt;f(4)&lt;/code&gt;, and add 1 to the byte count&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or maybe when inputting a choice, require input &lt;code&gt;f`!#%`&lt;/code&gt; or &lt;code&gt;f`&amp;amp;^%`&lt;/code&gt;, and add 6 to the byte count?(&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14110/76323&quot;&gt;Related&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Cuz we allow filename storage as long as its byte counted(&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1072/76323&quot;&gt;Related&lt;/a&gt;)&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-03-12T03:49:32.950" LastActivityDate="2018-03-12T03:49:32.950" Title="Are fixed input allowed if the bytes count?" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="5" ClosedDate="2018-03-25T14:46:42.920" ContentLicense="CC BY-SA 3.0" />
  <row Id="15008" PostTypeId="2" ParentId="15007" CreationDate="2018-03-12T02:51:38.947" Score="1" Body="&lt;h1&gt;In some cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In programming languages where functions are curried by default this is already allowed. For example &lt;a href=&quot;https://codegolf.stackexchange.com/a/156331/56656&quot;&gt;here&lt;/a&gt; I define the function &lt;code&gt;%&lt;/code&gt; as so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(a:b)!(c:d)|a==c=1+b!d&#xA;_!_=0&#xA;a%c@(e:d)=maximum[a!c,&quot;&quot;%d,(a++[e])%d]&#xA;_%_=0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;but my actual solution requires the empty string to be passed as input.  I add the bytes &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(&quot;&quot;%)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(if you are not familiar with Haskell this partially applies &lt;code&gt;%&lt;/code&gt; to the empty string) to create a anonymous function.  This is basically passing a static argument to the function from earlier.  It is even clearer if we rename &lt;code&gt;%&lt;/code&gt; to &lt;code&gt;f&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(a:b)!(c:d)|a==c=1+b!d&#xA;_!_=0&#xA;f a c@(e:d)=maximum[a!c,f&quot;&quot;d,f(a++[e])d]&#xA;f _ _=0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In which case we add the extra bytes&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f&quot;&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Since anonymous functions are already allowed, and partial application create returns a function, this is allowed and the way to count bytes is rather obvious.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This only works if the original function was named (not anonymous) because it has to be called.  If my function were already anonymous I would have to add to its definition or name it.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;But not in other cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If your function is not curried, it can't use the same format.  Alternative solutions would include&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Define a new function (anonymous or named) that calls on the old one (assuming the old one was named).&lt;/li&gt;&#xA;&lt;li&gt;If your function is not recursive, you could also pay to define a new constant with the value you wish to access.&lt;/li&gt;&#xA;&lt;li&gt;If your language has a builtin way to do partial application you could do that to create a new anonymous function.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2018-03-12T02:51:38.947" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="15009" PostTypeId="1" CreationDate="2018-03-12T03:34:06.183" Score="6" ViewCount="268" Body="&lt;p&gt;On &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/61384&quot;&gt;our standard loopholes post&lt;/a&gt;, there&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1657/61384&quot;&gt;are&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1828/61384&quot;&gt;several&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1283/613840&quot;&gt;different&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1739/61384&quot;&gt;answers&lt;/a&gt;&#xA;that pertain to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; tag &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8326/61384&quot;&gt;has been retired&lt;/a&gt;, there is no longer a need for these answers&lt;sup&gt;1&lt;/sup&gt;. I posted comments on them suggesting that they be deleted, and one person responded that they would prefer a community consensus before they are deleted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm getting a bit tired of seeing these every time I scroll through that page looking for something. Should they be deleted?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; The author of the one about &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1739/61384&quot;&gt;fake random numbers&lt;/a&gt; suggested that that answer should be kept because it does not just apply to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; contests, which I agree with. Should we still keep it?&lt;/p&gt;&#xA;" OwnerUserId="61384" LastActivityDate="2018-03-14T13:26:32.347" Title="Standard Loopholes Pertaining to [underhanded]" Tags="|discussion|underhanded|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="15010" PostTypeId="2" ParentId="2140" CreationDate="2018-03-12T04:06:07.007" Score="3" Body="&lt;p&gt;The TI series of calculators. I've put a lot of hours in writing TI-BASIC programs. The single most tedious part was either scrolling through the program, or switching between alpha and numeric input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For those unfamiliar, the entire Latin alphabet is overlaid on the existing keys alphabetically, and to type any of them (For variable names or assembly programming), you had to first press the ALPHA key, then your desired letter. Alternatively, you could press 2ND, A-LOCK and type in any number of letters, before pressing ALPHA again for numeric input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why am I saying all this? I want to write a code golf like challenge where scoring is done with this tediousness in mind, like switching between numbers/punctuation and letters carrying an extra penalty.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My original idea is that the source code of the submission would be converted to hexadecimal, and the number of transitions between alphas and numerics would be the &quot;score,&quot; with a lower score being better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How can/should I better refine this scoring system, and what sort of challenge should accompany it?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Implement a program or function, in the language of your choice, that takes a string of characters as input and outputs that string's &quot;tediousness score.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How tediousness is scored:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The string is converted into its hexadecimal representation. This is Unicode for languages that don't specify, but for a language like, say, Jelly, the Jelly codepage is used.&lt;br&gt;&#xA;&lt;code&gt;&quot;The quick brown fox jumps, over the lazy dog's back.&quot; in Unicode == 0x54686520717569636b2062726f776e20666f78206a756d70732c206f76657220746865206c617a7920646f672773206261636b2e&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Each switch between numbers and letters in the hexadecimal representation is counted.&lt;br&gt;&#xA;&lt;code&gt;0x54686520717569636b2062726f776e20666f78206a...&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;..0                12      34  56    78    9...&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;This is your tediousness score. For this example, it is 25.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Standard loopholes apply.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should I change the tediousness score? How might I implement golf? I thought about adding/multiplying the two together, but it still seemed to be in favor of just plain golfing. I wanted to make golfing languages be a bit harder for a golfing challenge, since they really pack their character sets and there would be a high &quot;tediousness score&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is the challenge, as written, clear enough? Should I restrict or relax the I/O requirements?&lt;/p&gt;&#xA;" OwnerUserId="62509" LastEditorUserId="62509" LastEditDate="2018-03-12T23:38:38.970" LastActivityDate="2018-03-12T23:38:38.970" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="15011" PostTypeId="2" ParentId="15009" CreationDate="2018-03-12T08:39:34.083" Score="11" Body="&lt;h2&gt;Merge the answers and migrate them here&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;... or anywhere with the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; tag that can be found by people who are still interested in the early history of PPCG.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think these answers are of historical values and should be kept, just not in a way that interferes with the normal browsing of pages that serve as FAQs.&lt;/p&gt;&#xA;" OwnerUserId="77134" LastEditorUserId="77134" LastEditDate="2018-03-14T04:22:42.343" LastActivityDate="2018-03-14T04:22:42.343" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="15012" PostTypeId="1" AcceptedAnswerId="15013" CreationDate="2018-03-12T11:17:10.870" Score="22" ViewCount="255" Body="&lt;p&gt;Is it alright to post an answer to an old challenge, in a language that hasn't been posted before?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm specifically asking about the following question: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/121118/golf-a-custom-fibonacci-sequence&quot; title=&quot;Link&quot;&gt;Link&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I happened across it, and wanted to post a new answer with PowerShell. I noticed, though, that the question has been inactive for many months. Would it still be OK to post my answer, and &quot;revive&quot; an old question?&lt;/p&gt;&#xA;" OwnerUserId="78895" LastActivityDate="2018-03-12T11:41:54.490" Title="Is it acceptable to answer an old question?" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="15013" PostTypeId="2" ParentId="15012" CreationDate="2018-03-12T11:41:54.490" Score="25" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It's not only acceptable, but also encouraged! There are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12507/41024&quot;&gt;several incentives for answering old questions&lt;/a&gt;, and there are even two badges, &lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/59/revival&quot;&gt;Revival&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/44/necromancer&quot;&gt;Necromancer&lt;/a&gt;, that you can get this way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Welcome to our site, and thanks for your desire to contribute!&lt;/p&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2018-03-12T11:41:54.490" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="15015" PostTypeId="2" ParentId="2140" CreationDate="2018-03-12T15:06:14.057" Score="2" Body="&lt;h1&gt;I can't understand Jelly chains!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;or...&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Expand Jelly chains&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;(see &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8090/69850&quot;&gt;this&lt;/a&gt; for more details). Which one do you prefer?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Jelly chain separator is a very powerful feature. Unfortunately, it's not very easy to understand. So, we need a program &lt;sub&gt;(or function, as usual)&lt;/sub&gt; to rewrite a Jelly link that uses chain separator (&lt;code&gt;øµðɓ&lt;/code&gt;) to one that doesn't.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specification (incomplete)&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I am really bad at explaining things, so if you have any idea how to make this better, feel free to edit the post.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;A link (often line of code) consists of chains.&#xA;* The chains are separated by chain separators &lt;code&gt;øµðɓ&lt;/code&gt;. &#xA;* If the first character is a chain-separator, the part right before it is &lt;strong&gt;not&lt;/strong&gt; considered a chain. In other words, chains can't be empty.&#xA;* The arity of each chain is determined by the chain separator right before it. In particular, &lt;code&gt;ø&lt;/code&gt; -&gt; arity 0, &lt;code&gt;µ&lt;/code&gt; -&gt; arity 1, &lt;code&gt;ð&lt;/code&gt; -&gt; arity 2. &lt;code&gt;ɓ&lt;/code&gt; will be discussed later.&#xA;* If there are no chain separator before it (it's the first chain) its arity is equal to the link's arity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A chain consists of atoms, potentially modified by quicks.&#xA;* Each quick affects the atom(s) right before it. How many atoms it takes is quick-dependent.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A link that contains exactly one chain with arity equal to its arity is functionally equivalent to that chain.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A link reference is functionally equivalent to that link. (more about link reference quicks later)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A chain containing atoms a&lt;sub&gt;1&lt;/sub&gt;, a&lt;sub&gt;2&lt;/sub&gt;, ..., a&lt;sub&gt;n&lt;/sub&gt; is functionally equivalent to a link containing chains c&lt;sub&gt;1&lt;/sub&gt;, c&lt;sub&gt;2&lt;/sub&gt;, ..., c&lt;sub&gt;n&lt;/sub&gt; if for all integer i, 1 ≤ i ≤ n, a&lt;sub&gt;i&lt;/sub&gt; has the same arity and is functionally equivalent to c&lt;sub&gt;i&lt;/sub&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Chain reference&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The quicks &lt;code&gt;£ŀĿ ¢Çç Ññ&lt;/code&gt; refer to (call) other links:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;£Ŀŀ&lt;/code&gt; must have a number &lt;code&gt;n&lt;/code&gt; right before it, and call the &lt;code&gt;(n-1)%(l-1)+1&lt;/code&gt;th link (1-indexing) as a nilad, monad or dyad, respectively. Where &lt;code&gt;l&lt;/code&gt; is the number of links in the program, and &lt;code&gt;%&lt;/code&gt; denotes modulo - the result has the same sign as the divisor.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;In reality, the link right before it can have any arity, but for the purpose of this challenge, it's simpler to assume it must be a number.&#xA;  For example:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;code&gt;1£&lt;/code&gt; calls the first link as a nilad.&lt;/li&gt;&#xA;  &lt;li&gt;&lt;code&gt;0Ŀ&lt;/code&gt; calls the second-to-last link as a monad.&lt;/li&gt;&#xA;  &lt;li&gt;If the program has 6 links, &lt;code&gt;7ŀ&lt;/code&gt; calls the second link as a dyad, because &lt;code&gt;(7-1)%(6-1)+1 = 2&lt;/code&gt;.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;¢Çç&lt;/code&gt; call the link right before the one that it appears in as a nilad, monad or dyad respectively. If one of those quicks appear in the first link, it calls the main (last) link.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Ññ&lt;/code&gt; call the link right after the one that it appears in as a monad or dyad respectively.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I don't think that anyone would choose to use one of those quicks (&lt;code&gt;¢ÇçÑñ&lt;/code&gt;) instead of &lt;code&gt;£Ŀŀ&lt;/code&gt;, but imaginary point if you do.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;For example: Consider the link &lt;code&gt;Cð+×µH&lt;/code&gt;, called with arity 1. Its structure is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+---+╔══════╗┏━━━┓&#xA;|┏━┓|║╔═╗╔═╗║┃┏━┓┃&#xA;|┃C┃|║║+║║×║║┃┃H┃┃&#xA;|┗━┛|║╚═╝╚═╝║┃┗━┛┃&#xA;+---+╚══════╝┗━━━┛&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It contains 3 chains:&#xA;* The first one doesn't have any preceding chain separator, therefore it's variadic. When executed it is monadic (because the link is)&#xA;* The second one is dyadic, and the third one is monadic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A possible non-chain-separator version is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;C&#xA;+×&#xA;ÑçH&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which has the structure&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+---+&#xA;|┏━┓|&#xA;|┃C┃|&#xA;|┗━┛|&#xA;+---+&#xA;+------+&#xA;|╔═╗╔═╗|&#xA;|║+║║×║|&#xA;|╚═╝╚═╝|&#xA;+------+&#xA;+---------+&#xA;|┏━┓╔═╗┏━┓|&#xA;|┃Ñ┃║ç║┃H┃|&#xA;|┗━┛╚═╝┗━┛|&#xA;+---------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Because the &lt;code&gt;Ñ&lt;/code&gt; refers to the first link &lt;code&gt;C&lt;/code&gt; and the &lt;code&gt;ç&lt;/code&gt; refers to the second link &lt;code&gt;+×&lt;/code&gt;, this is equivalent to the original version.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Now the hard part: Quicks taking chains as input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because all the quicks that need to be considered always take exactly 1 atom as input, the only rules is&#xA;* If the quick is right after a chain separator, it will take the previous chain.&#xA;* Otherwise it will take whatever stands right before it, either [an atom] or [something that has been modified by a quick].&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example: Consider the link &lt;code&gt;+/Hµ€&lt;/code&gt; with arity 1. Its structure is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;┏━━━━━━━━━━━━━━┓&#xA;┃+------------+┃&#xA;┃|+---------+ |┃&#xA;┃||┏━━━━┓   | |┃&#xA;┃||┃╔═╗ ┃┏━┓| |┃&#xA;┃||┃║+║/┃┃H┃|€|┃&#xA;┃||┃╚═╝ ┃┗━┛| |┃&#xA;┃||┗━━━━┛   | |┃&#xA;┃|+---------+ |┃&#xA;┃+------------+┃&#xA;┗━━━━━━━━━━━━━━┛&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As you can see, the &lt;code&gt;€&lt;/code&gt; takes the &lt;code&gt;+/H&lt;/code&gt; as input because it is right after the chain separator &lt;code&gt;µ&lt;/code&gt;. All the variadic chains have arity 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another example: &lt;code&gt;ABð€CDµ€EFµGHµ€&lt;/code&gt; --&gt; &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;┏━━━━━━━━━━━━━━━━━━━━━━━━━━━━┓             &#xA;┃╔════════════════════╗      ┃             &#xA;┃║╔═════════════════╗ ║      ┃┏━━━━━━━━━━━┓&#xA;┃║║+---------+      ║ ║      ┃┃┏━━━━━━━━━┓┃&#xA;┃║║|+------+ |      ║ ║      ┃┃┃┏━━━━━━┓ ┃┃&#xA;┃║║||┏━┓┏━┓| |┏━┓┏━┓║ ║┏━┓┏━┓┃┃┃┃┏━┓┏━┓┃ ┃┃&#xA;┃║║||┃A┃┃B┃|€|┃C┃┃D┃║€║┃E┃┃F┃┃┃┃┃┃G┃┃H┃┃€┃┃&#xA;┃║║||┗━┛┗━┛| |┗━┛┗━┛║ ║┗━┛┗━┛┃┃┃┃┗━┛┗━┛┃ ┃┃&#xA;┃║║|+------+ |      ║ ║      ┃┃┃┗━━━━━━┛ ┃┃&#xA;┃║║+---------+      ║ ║      ┃┃┗━━━━━━━━━┛┃&#xA;┃║╚═════════════════╝ ║      ┃┗━━━━━━━━━━━┛&#xA;┃╚════════════════════╝      ┃             &#xA;┗━━━━━━━━━━━━━━━━━━━━━━━━━━━━┛             &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Yes, that's a &lt;strong&gt;lot&lt;/strong&gt; of levels to nest a chain. Note that the chain formed by &lt;code&gt;ABð€CD&lt;/code&gt; has arity &lt;code&gt;2&lt;/code&gt; because it is after a &lt;code&gt;ð&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;TODO need to have more explicit rules&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This can be converted to non-chain-separator equivalent form&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are no 2 consecutive chain separators.&lt;/li&gt;&#xA;&lt;li&gt;There are no trailing chain separators.&lt;/li&gt;&#xA;&lt;li&gt;There can be at most 1 leading chain separator, indicates the arity of the first chain. If omitted, equal to the arity of the link.&lt;/li&gt;&#xA;&lt;li&gt;(so, no non-empty useless chain)&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It's guaranteed that the first non-chain-separator character is not a &lt;code&gt;€&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can use either the UTF-8 encoding or the value in the Jelly single byte character set, where &lt;code&gt;ø: 0D, µ: F9, ð: 08, ɓ: 8B, ¢: F1, Ç: FE, ç: 07, Ñ: 00, ñ: 0B, £: F2, Ŀ: B7, ŀ: DE&lt;/code&gt;. The characters &lt;code&gt;@0123456789&lt;/code&gt; has the same ASCII value. (You can use &lt;a href=&quot;https://tio.run/##AVcAqP9qZWxsef//4oCcw7jCtcOwyZPCosOHw6fDkcOxwqPEv8WA4oCdCsOYSiBpw5DigqwgwqIgZOKBtCDhu4vDmEggwqIsIiBq4oKs4oG@OiAgauKBviwg//8&quot; rel=&quot;nofollow noreferrer&quot;&gt;this script&lt;/a&gt; to get character value)&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Note: Should I allow submissions to use either of them, or should I enforce one? Because using single byte input/output is often shorter for most other languages, except Jelly in UTF-8 mode.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Input/output&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Input given: A link (of chains) with atoms, chain separator &lt;code&gt;øµðɓ&lt;/code&gt; and the &lt;code&gt;€&lt;/code&gt; quick, with its arity (0, 1, or 2)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can assume that there is no newline (or other quicks) in the input, and that all of the &lt;code&gt;øµðɓ€&lt;/code&gt; in the input are interpreted with its usual meaning. For what are their &quot;usual meaning&quot;, see rules above.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Output: Multiple links (separated with newlines of course, but &lt;code&gt;¶&lt;/code&gt; is also acceptable), containing &lt;code&gt;£ŀĿ ¢Çç Ññ €@&lt;/code&gt;, but must not contain &lt;code&gt;øµðɓ&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;arity link &gt; output (or output)*&#xA;1 HHH &gt; HHH or HHH¶Ç or HHH¶1Ŀ&#xA;2 HHH &gt; HHH or HHH¶ç or HHH¶1ŀ&#xA;1 Cð+×µH &gt; +×¶CçH or C¶+×¶H¶1Ŀ2ŀ3Ŀ&#xA;0 123µ+ø456 &gt; 0 123¶+¶456¶1£2ŀ3£&#xA;2 ɓ+ &gt; +@ or +¶ç@ or +¶1ŀ@&#xA;1 S‘µ€ &gt; S‘¶Ç€&#xA;1 S‘µ€€€IIµ€€ &gt; S‘¶Ç€€€II¶Ç€€ or S‘¶1Ŀ€€€II¶2Ŀ€€&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(note: real Jelly code are not that verbose, that is only for demonstration purposes)&lt;/p&gt;&#xA;" OwnerUserId="69850" LastEditorUserId="69850" LastEditDate="2018-04-02T15:56:24.927" LastActivityDate="2018-04-02T15:56:24.927" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="15016" PostTypeId="2" ParentId="2140" CreationDate="2018-03-12T21:28:53.063" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://www.xkcd.com/1275/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/IbaCI.png&quot; alt=&quot;If replacing all the '3's doesn't fix your code, remove the 4s, too, with 'ceiling(pi) / floor(pi) * pi * r^floor(pi)'. Mmm, floor pie.&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output the largest prime number possible in as few bytes as possible using no number but pi.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/##FcpBCsIwEIXhvccoHmDSZNrOWtwVqeguFIxt0IEmKWkQPX1M/82Dj@dMeltnEk8m54u186arIbIzC6ffEMOH/etRjYdiPukdzHOx@8Ne9T2cv2u028bB6@NtirymU3DO@Llnb7Wux72cswBEFFIRYlvqpBIKykiADomwkzWpRtStpAYKtyCIlEIB9Ac&quot; rel=&quot;nofollow noreferrer&quot;&gt;This code&lt;/a&gt; will be the sole judge of whether your output is actually a prime number.&lt;/li&gt;&#xA;&lt;li&gt;Your score will be the prime number produced divided by the number of bytes used for your code.&lt;/li&gt;&#xA;&lt;li&gt;If your language has a built-in variable for pi, use that. Otherwise, let pi equal &lt;code&gt;3.1415926535898&lt;/code&gt;. Any occurrance of pi itself or something referring directly to pi counts as one byte.&lt;/li&gt;&#xA;&lt;li&gt;Your number must be generated solely by applying various operations and functions to pi. Those functions cannot offset pi by anything other than another number derived from pi. The sole exceptions to this rule are floor and ceiling functions. For example, if you want to find the square root of something, you must do something to the effect of raising it to the &lt;code&gt;(pi/pi/(pi/pi+pi/pi))&lt;/code&gt;th power.&lt;/li&gt;&#xA;&lt;li&gt;You may not modify pi in any way that uses a reference to or directly uses non-pi number.&lt;/li&gt;&#xA;&lt;li&gt;The entirety of the number must be outputted in base 10 and without scientific notation. All digits of the number must be included in the output.&lt;/li&gt;&#xA;&lt;li&gt;You must provide a&lt;/li&gt;&#xA;&lt;li&gt;The largest score wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Here's an example in Lua:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;print(math.floor(math.pi))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;That's 14 bytes (counting &lt;code&gt;math.pi&lt;/code&gt; as one byte) for the prime number 3, so my score is 3/14 or ~0.21428571428. Here's another example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;m=math print(m.floor(m.pi^m.pi)+m.pi/m.pi)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;That's 31 bytes (each &lt;code&gt;m.pi&lt;/code&gt; is one byte) for the prime number 37, so my score is 37/31 or ~1.1935483871.&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&lt;p&gt;Are there any other ways to clear up ambiguities I may be missing?&lt;/p&gt;&#xA;" OwnerUserId="47826" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-03-13T00:35:53.103" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="15022" PostTypeId="2" ParentId="2140" CreationDate="2018-03-13T21:15:20.420" Score="1" Body="&lt;h1&gt;Image to HTML ASCII-Art&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Given an input image &lt;code&gt;n&lt;/code&gt;, output each pixel as a &lt;code&gt;0&lt;/code&gt; using HTML for coloring and &lt;code&gt;&amp;lt;br/&amp;gt;&lt;/code&gt; as a delimiter for the rows.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Example:&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input Image:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/wrxaM.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/wrxaM.png&quot; alt=&quot;Input Image 1&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example HTML Output:&lt;/strong&gt; &lt;a href=&quot;https://pastebin.com/jDHZwb4P&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://pastebin.com/jDHZwb4P&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rendered Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/CHJAj.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/CHJAj.png&quot; alt=&quot;Output rendered as HTML...&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Rules:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may color the 0's using any HTML trick you know of (CSS Style, JavaScript, etc)...&lt;/li&gt;&#xA;&lt;li&gt;You may use any character other than 0 that shows visible color if you so wish.&lt;/li&gt;&#xA;&lt;li&gt;Colors must be exact down to the RGB of the pixel, alpha can be assumed non-existent.&lt;/li&gt;&#xA;&lt;li&gt;If you get a malformed image, or an image with transparency, you may error.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, lowest byte-count wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-03-14T12:45:12.427" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="15023" PostTypeId="2" ParentId="15009" CreationDate="2018-03-14T13:26:32.347" Score="2" Body="&lt;p&gt;Delete them, they serve no purpose any more.&lt;/p&gt;&#xA;" OwnerUserId="21034" LastActivityDate="2018-03-14T13:26:32.347" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="15025" PostTypeId="1" CreationDate="2018-03-14T17:53:34.300" Score="17" ViewCount="460" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot;&gt;There are lots of of challenges involving randomness&lt;/a&gt;. However, not all languages have a built-in method for randomness. Some languages, like python or most golfing languages make it really easy. You can simply call some built in function that will return a pseudo-randomly generated number. There is no boilerplate needed to seed the &lt;a href=&quot;https://en.wikipedia.org/wiki/Pseudorandom_number_generator&quot; rel=&quot;nofollow noreferrer&quot;&gt;PRNG&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Other languages make it harder. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;C/C++ has builtin PRNGs, but in order to get truly unpredictable results, you must call &lt;code&gt;srand(time(NULL));&lt;/code&gt;, which seeds the PRNG with the current time. This is essentially an 18-byte penalty. As far as I know, Go works the same way.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Turing tarpits and esolangs, such as brainfuck and Brain-Flak have the algorithmic capabilities to create a PRNG, but no way to get an unpredictable starting seed (such as OS utilities or time). &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;One potential solution is to allow the seed to come from user input. But this opens up a new can of worms. Imagine the hypothetical (underspecified) challenge: &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Print the letter 'a' a random number of times.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If user input counts as a valid source of randomness in Brain-Flak, one could argue that I could simply do &lt;code&gt;print('a'*input())&lt;/code&gt; in python. Or even the equivalent in Brain-Flak:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;  ({}&amp;lt;&#xA;    ((((((()()()){}){}){}){}){}())&#xA;  &amp;gt;[()])&#xA;}{}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(For those who don't read Brain-Flak, this is basically the exact same thing as the python answer). Now, this hypothetical challenge is horribly underspecified, but the underlying problem is still there. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, it has been discussed before that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/13029/31716&quot;&gt;time is a valid source of randomness for one value, not multiple&lt;/a&gt;. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1325/31716&quot;&gt;This post&lt;/a&gt; also addresses the meaning of the term &quot;random&quot;. But neither of these address all of the potential problems with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; answers. I'd like to get a definitive answer to all of these potential loopholes:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Is it valid for a challenge to use an unseeded PRNG? (This would affect answers such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/156245/code-golf-your-own-pet-ascii-snake/156663#156663&quot;&gt;this one&lt;/a&gt;) &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is user input a valid source of randomness? (This would affect &lt;a href=&quot;https://codegolf.stackexchange.com/a/157927/31716&quot;&gt;this answer&lt;/a&gt; which was deemed invalid and deleted)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is it valid to use user input to seed to a PRNG? &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Should we treat all languages the same in this regard, or is it OK to use more forgiving rules for languages with less randomness capabilities?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="69850" LastEditDate="2018-03-15T08:33:33.493" LastActivityDate="2018-03-21T00:56:49.707" Title="What are the standard requirements for answering a [random] challenge?" Tags="|discussion|policy|answers|random|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="15026" PostTypeId="2" ParentId="15025" CreationDate="2018-03-15T00:06:15.317" Score="4" Body="&lt;p&gt;My opinions on the matter(s):&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;Is it valid for a challenge to use an unseeded PRNG?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Yes. The seed for a PRNG doesn't matter within a single invocation.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;2&quot;&gt;&#xA;  &lt;li&gt;Is user input a valid source of randomness?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1789/45941&quot;&gt;No&lt;/a&gt;. It's not acceptable to take any more inputs than specified in the challenge, as the linked loophole makes clear.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;3&quot;&gt;&#xA;  &lt;li&gt;Is it valid to use user input to seed to a PRNG?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;No (see above). This is effectively the same thing. This differs from asking for an additional input (such as the length of an array along with the array), since you can seed your PRNG without user input.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;4&quot;&gt;&#xA;  &lt;li&gt;Should we treat all languages the same in this regard, or is it OK to use more forgiving rules for languages with less randomness capabilities?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10003/45941&quot;&gt;All languages should be treated equally&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;That being said, challenge authors should be able to override these defaults if they deem it necessary (especially #1).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2018-03-21T00:56:49.707" LastActivityDate="2018-03-21T00:56:49.707" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="15028" PostTypeId="1" CreationDate="2018-03-15T06:27:56.810" Score="1" ViewCount="55" Body="&lt;p&gt;When solving a puzzle with an appropriate solution, does the programming language standard boiler-plate source code need to be included:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, should I include all of this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;using System;&#xA;using System.Linq;&#xA;&#xA;public class Program&#xA;{&#xA;    public static void Main()&#xA;    {&#xA;        Console.WriteLine(&quot;Code Golfing Is My Favourite Sport!&quot;);&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Alternatively, is it enough to include the actual specific code which solves the challenge, i.e.:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Console.WriteLine(&quot;Code Golfing Is My Favourite Sport!&quot;);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="79014" LastActivityDate="2018-03-15T06:27:56.810" Title="Is boiler-plate code required for challenges?" Tags="|discussion|answers|" AnswerCount="0" CommentCount="3" ClosedDate="2018-03-15T12:55:28.683" ContentLicense="CC BY-SA 3.0" />
  <row Id="15031" PostTypeId="2" ParentId="8143" CreationDate="2018-03-15T13:23:51.587" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/1076/mixed-up-output&quot;&gt;Mixed up output&lt;/a&gt; (&lt;em&gt;&lt;strong&gt;older&lt;/strong&gt;&lt;/em&gt; 7 years old)&lt;/p&gt;&#xA;&lt;p&gt;Was recently marked as a duplicate of&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/6043/were-no-strangers-to-code-golf-you-know-the-rules-and-so-do-i&quot;&gt;We&amp;#39;re no strangers to code golf, you know the rules, and so do I&lt;/a&gt; (&lt;em&gt;&lt;strong&gt;younger&lt;/strong&gt;&lt;/em&gt; 5 years old)&lt;/p&gt;&#xA;&lt;p&gt;Due to the consensus that&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8143/what-should-we-do-with-old-challenges-no-longer-on-topic&quot;&gt;What should we do with old challenges no longer on topic?&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;The one thing this meta-post didn't cover was...&lt;/p&gt;&#xA;&lt;h1&gt;&lt;em&gt;&lt;strong&gt;Which one is the real duplicate&lt;/strong&gt;&lt;/em&gt;?&lt;/h1&gt;&#xA;&lt;p&gt;The one with the most recent date, or the one that was most well received?&lt;/p&gt;&#xA;&lt;p&gt;Personally I think we should VTC old challenges with the more well-received ones being the ones to stay open. I believe this is what we're doing anyway, I just wanted it to be stated somewhere.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-03-15T13:23:51.587" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="15032" PostTypeId="2" ParentId="2140" CreationDate="2018-03-15T14:55:10.653" Score="0" Body="&lt;h1&gt;Relay Adder&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Make a 32-bit full adder with relays.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A relay is here a gate with four inputs &lt;code&gt;A&lt;/code&gt;, &lt;code&gt;B&lt;/code&gt;, &lt;code&gt;C&lt;/code&gt; and &lt;code&gt;D&lt;/code&gt;, and output &lt;code&gt;if A==B then C else D&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You'll be given two 32-bit numbers (totally 64 inputs), a carry flag, constant 0 and 1, sum up to 67 inputs; output 33 bits as the result&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Smallest &lt;code&gt;Gate count * gate depth&lt;/code&gt; win&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TODO: add tags&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-03-15T15:23:37.170" LastActivityDate="2018-03-15T15:23:37.170" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="15035" PostTypeId="2" ParentId="2140" CreationDate="2018-03-15T20:42:15.200" Score="0" Body="&lt;h1&gt;Tell SMILES from FROWNS&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chemistry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chemistry&amp;#39;&quot; rel=&quot;tag&quot;&gt;chemistry&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Simplified_molecular-input_line-entry_system&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;S&lt;/strong&gt;implified &lt;strong&gt;M&lt;/strong&gt;olecular-&lt;strong&gt;I&lt;/strong&gt;nput &lt;strong&gt;L&lt;/strong&gt;ine-&lt;strong&gt;E&lt;/strong&gt;ntry &lt;strong&gt;S&lt;/strong&gt;ystem&lt;/a&gt; file format is used to store structures of organic molecules. For information on why there is an actual file format called &quot;smiles&quot;, consult &lt;a href=&quot;http://phdcomics.com/comics/archive.php?comicid=1100&quot; rel=&quot;nofollow noreferrer&quot;&gt;this comic&lt;/a&gt; from PhD Comics. As a summary of the format:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Start the file with a root chain of atoms.&lt;/li&gt;&#xA;&lt;li&gt;Put each branch group in parentheses after the atom it connects to.&lt;/li&gt;&#xA;&lt;li&gt;Use &lt;code&gt;=&lt;/code&gt; for a double bond and &lt;code&gt;#&lt;/code&gt; for a triple bond.&lt;/li&gt;&#xA;&lt;li&gt;Break aromatic rings and number the bonds broken; add those numbers after the atoms bordering them.&lt;/li&gt;&#xA;&lt;li&gt;Put metal atoms and any ions in square brackets.&lt;/li&gt;&#xA;&lt;li&gt;Omit hydrogens attached to carbons. Their presence is assumed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For example, 1-chloro-3-ethylbenzene could be &lt;code&gt;C=1(CC)C=CC(Cl)=CC=1&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let's make a new acronym, FROWNS: &lt;strong&gt;F&lt;/strong&gt;raudulent, &lt;strong&gt;R&lt;/strong&gt;idiculous, &lt;strong&gt;O&lt;/strong&gt;verbonded, &lt;strong&gt;W&lt;/strong&gt;acked, or &lt;strong&gt;N&lt;/strong&gt;onexistent &lt;strong&gt;S&lt;/strong&gt;MILES. Basically, a SMILES string is a FROWNS string if any of the following apply:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A loop is unclosed or closed twice.&lt;/li&gt;&#xA;&lt;li&gt;An atom from period 2 (Li, Be, B, C, N, O, F, Ne) has more than 4 total bonds.&lt;/li&gt;&#xA;&lt;li&gt;A neutral nitrogen atom has 4 total bonds.&lt;/li&gt;&#xA;&lt;li&gt;An oxygen atom has more than 2 difference of bonds - charge.&lt;/li&gt;&#xA;&lt;li&gt;A fluorine atom has anything other than exactly 1 bond.&lt;/li&gt;&#xA;&lt;li&gt;Noble gasses other than xenon are bonded.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your program should determine whether a given SMILES string is a FROWNS string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some examples of FROWNS:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;C1=CC=CC=C&#xA;CC(C)(C)(C)C&#xA;C1=CC=CC=C1C=CN1&#xA;C#C#C&#xA;C=N=C&#xA;CC#O&#xA;OFO&#xA;FKr(F)(F)(F)(F)F&#xA;FXeF(F)(F)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;These, however, are not FROWNS:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;C1=CC=CC=C1&#xA;CC(C)(C)C&#xA;C12=CC=CC=C1C=CN2&#xA;C#C&#xA;C[N-]C&#xA;CC=O&#xA;OClO&#xA;FXe(F)(F)(F)(F)F&#xA;Xe(F)(F)(F)(F)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;May the shortest code win.&lt;/p&gt;&#xA;" OwnerUserId="62402" LastEditorUserId="62402" LastEditDate="2018-04-13T17:50:00.397" LastActivityDate="2018-04-13T17:50:00.397" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="15037" PostTypeId="1" CreationDate="2018-03-16T06:45:28.887" Score="8" ViewCount="103" Body="&lt;p&gt;The &lt;strong&gt;404 image&lt;/strong&gt; is missing in the meta site's &lt;strong&gt;Page Not Found&lt;/strong&gt; page.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main sites' Page Not Found page has that image:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/404&quot;&gt;codegolf.stackexchange.com/404&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But in the meta site it is missing:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/404&quot;&gt;codegolf.meta.stackexchange.com/404&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Screenshot for reference:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/IIyio.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/IIyiom.png&quot; alt=&quot;404 image missing&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The meta site's image source is point to this &lt;a href=&quot;http://cdn.sstatic.net/Sites/skins/sketchymeta/img/sketchy-404.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;CDN path&lt;/a&gt;, that is not available, where the main site's image source &lt;a href=&quot;http://cdn.sstatic.net/Sites/beta/img/404.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;CDN path&lt;/a&gt; is valid one.&lt;/p&gt;&#xA;" OwnerUserId="72598" LastEditorUserId="66833" LastEditDate="2023-08-26T17:57:30.647" LastActivityDate="2023-08-26T17:57:30.647" Title="404 image is missing on the meta site Page Not Found page" Tags="|bug|status-completed|meta|404-page|" AnswerCount="0" CommentCount="1" ClosedDate="2018-03-16T13:50:22.040" ContentLicense="CC BY-SA 3.0" />
  <row Id="15038" PostTypeId="1" AcceptedAnswerId="15039" CreationDate="2018-03-16T18:49:58.540" Score="3" ViewCount="138" Body="&lt;p&gt;Some time ago, I created a chatroom for the Reflections language. Now, I can't find it, and if I click &lt;a href=&quot;https://chat.stackexchange.com/rooms/74079/reflections&quot;&gt;the link on the Reflections page&lt;/a&gt;, it's not found. Has it been deleted? Why?&lt;/p&gt;&#xA;" OwnerUserId="78123" LastActivityDate="2018-03-16T18:56:14.457" Title="What happened to my chat room?" Tags="|support|chat|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="15039" PostTypeId="2" ParentId="15038" CreationDate="2018-03-16T18:56:14.457" Score="4" Body="&lt;p&gt;Yes, inactive rooms get deleted automatically after a while:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Rooms will exist indefinitely, so long as there is at least one person actively talking in the room. &lt;strong&gt;A room is considered worth retaining if it has more than 15 messages by at least 2 users.&lt;/strong&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;— Source: &lt;a href=&quot;https://chat.stackexchange.com/faq#retention&quot;&gt;Chat FAQ&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I've undeleted the room for you. If you can get a bit more activity in there, you shouldn't have to worry about it being deleted again. However, inactive rooms will still &lt;em&gt;freeze&lt;/em&gt; after 14 days of inactivity, which will prevent further messages. Should that happen and you need the room again, feel free to ping one us moderators in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; and we'll unfreeze it for you.&lt;/p&gt;&#xA;" OwnerUserId="8478" LastActivityDate="2018-03-16T18:56:14.457" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="15040" PostTypeId="1" CreationDate="2018-03-16T19:03:50.513" Score="5" ViewCount="427" Body="&lt;p&gt;An interesting conundrum has arisen in relation to &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/43331784#43331784&quot;&gt;the bonus I offered&lt;/a&gt; for APL solutions to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35978/an-ant-on-a-cube&quot;&gt;An Ant on a Cube&lt;/a&gt;. It's an old challenge that requires a &quot;named function&quot;, such as a lambda assigned to a variable: &lt;code&gt;f←{...}&lt;/code&gt; - that is 2+ the code length we normally consider valid for most golfing challenges. @Adám &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35978/an-ant-on-a-cube#comment384802_157955&quot;&gt;devised&lt;/a&gt; the following way to circumvent the need for &quot;&lt;code&gt;f←&lt;/code&gt;&quot;: create a named function object (in APL-speak: &quot;fix&quot; it) from a string, and claim the string's length as code length. Typing the string directly in the REPL or placing it in a file wouldn't have the same effect, so &quot;fix&quot;-ing is essential and the actual number of bytes sent to the interpreter in order to pull off this stunt is, of course, much higher.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, in this context, how do we define code length?&lt;/p&gt;&#xA;" OwnerUserId="24908" LastActivityDate="2018-11-23T12:37:02.743" Title="What is code length?" Tags="|discussion|" AnswerCount="2" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="15041" PostTypeId="2" ParentId="2140" CreationDate="2018-03-16T21:09:25.810" Score="-2" Body="&lt;h1&gt;Bees?&lt;/h1&gt;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;http://www.scp-wiki.net/scp-3045&quot; rel=&quot;nofollow noreferrer&quot;&gt;SCP-3045&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Write a program that takes the input, extracts all of the words, and looks for the word &lt;code&gt;bee&lt;/code&gt;; then:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;code&gt;bee&lt;/code&gt; is not detected, pick sections of the text at random and delete them.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;bee&lt;/code&gt; is detected, add instances of the word &lt;code&gt;bee&lt;/code&gt; to the input such that it has significantly more bytes than the original input.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The program should then output these modifications.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="53819" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-03-16T21:09:25.810" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="15042" PostTypeId="2" ParentId="2140" CreationDate="2018-03-16T22:48:46.503" Score="1" Body="&lt;h1&gt;Find most isolated point&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graph&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graph&amp;#39;&quot; rel=&quot;tag&quot;&gt;graph&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a finite set &lt;code&gt;S&lt;/code&gt; of points in &lt;code&gt;d&lt;/code&gt; dimensions, find the &lt;em&gt;most isolated points&lt;/em&gt;, that is the point with the greatest distance to its closest neighbours.&lt;/p&gt;&#xA;&lt;p&gt;Or more mathematically, the point &lt;code&gt;p ∈ S&lt;/code&gt; that maximizes &lt;code&gt;min {d(p,q) | q ∈ S, q ≠ p}&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can return the coordinates of the actual point, or you can alternatively return the index of the point in the input list.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;em&gt;most isolated point&lt;/em&gt; as defined above is not necessarily unique. But you can assume that the given input results in an unique such point.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;1D:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;[0,1] (invalid, no unique result)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[0,1,3] -&amp;gt; 3&lt;/code&gt;,&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;2D:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;[(0,0),(0,1),(1,2)] -&amp;gt; [(1,2)]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;more to be added...&lt;/p&gt;&#xA;&lt;p&gt;This challenge was inspired by &lt;a href=&quot;https://cs.stackexchange.com/questions/89411/how-to-efficiently-compute-the-most-isolated-point&quot;&gt;this question&lt;/a&gt;. If you find a particularly time-efficient solution please post it there!&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-03-16T22:48:46.503" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16044" PostTypeId="2" ParentId="15040" CreationDate="2018-03-17T20:38:19.783" Score="1" Body="&lt;p&gt;The &lt;code&gt;∇&lt;/code&gt; just opens and closes the line editor and is certainly not part of the code, as can be seen Character Representation (&lt;code&gt;⎕CR'f'&lt;/code&gt;) of the program. It was exactly to demonstrate this that I included the &lt;code&gt;⎕CR&lt;/code&gt; in the output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also placing the code in a file &lt;em&gt;without&lt;/em&gt; &lt;code&gt;∇&lt;/code&gt;s is perfectly adequate for APL to import it. &lt;a href=&quot;https://tio.run/##SyzI0U2pTMzJT////1HfVLeIR13NQNrP3TVEQV0vM6@gtESvJDNfXcGQCyj8qG0CkHQOUlBPU///P42r@lHv1kedCzUetU1@1LHqUdeiRx0zHvXs1dQHqtIBytU@6mp61LvZBAA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;APL (Dyalog Unicode) – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2018-03-17T20:38:19.783" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="16045" PostTypeId="1" CreationDate="2018-03-18T06:08:26.060" Score="7" ViewCount="257" Body="&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Concatenative_programming_language&quot; rel=&quot;nofollow noreferrer&quot;&gt;Concatenative languages&lt;/a&gt; are languages where juxtaposition of functions represents composition. Programs consist of the primitives in the language combining to form a large function which takes program input as its argument and whose return value is written to output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In many concatenative languages, all functions take and return the same structure so that the language can be implemented as a pipeline of operations on that structure. In the case that this structure is a stack, you get a model for many stack-based languages such as Joy, Underload, and CJam. For example, consider the following program that computes (&lt;em&gt;n&lt;/em&gt;+1)&lt;sup&gt;2&lt;/sup&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 add dup mul&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is a composition of four different functions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;1&lt;/code&gt; is a function that pushes &lt;code&gt;1&lt;/code&gt; to the top of the stack.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;add&lt;/code&gt; is a function that replaces the top two items on the stack with their sum. &lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;dup&lt;/code&gt; is a function that makes a copy of the top item on the stack and pushes it again.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;mul&lt;/code&gt; is a function that replaces the top two items on the stack with their product.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;We &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2422/61384&quot;&gt;allow submissions in the form of functions&lt;/a&gt;. Usually, in CJam, I take this to mean a block like &lt;code&gt;{1+_*}&lt;/code&gt;. This is the example given in the linked answer, but with the concatenative interpretation, &lt;code&gt;1+_*&lt;/code&gt; is a function, and &lt;code&gt;{1+_*}&lt;/code&gt; is a function that pushes a function to the stack.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In Python, if some function &lt;code&gt;f&lt;/code&gt; was a valid submission, &lt;code&gt;lambda s:s[:-1]+[f(s[-1])]&lt;/code&gt; would certainly not be. The latter seems to be what I've been doing for answers in concatenative languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question, then, is that there are two viewpoints for this in a stack-based language:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The theoretical viewpoint, in which juxtaposition of several functions composes them into a new function.&lt;/li&gt;&#xA;&lt;li&gt;The viewpoint of the implementation (which just applies each of the operations in sequence), in which the same juxtaposition of functions is a snippet that operates on some state already assumed to exist (the stack).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Which perspective is correct here?&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="61384" LastEditDate="2018-03-19T14:26:25.780" LastActivityDate="2018-03-19T14:26:25.780" Title="Definition of a Function in Concatenative Languages" Tags="|discussion|policy|scoring|languages|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="16046" PostTypeId="2" ParentId="16045" CreationDate="2018-03-18T14:22:24.950" Score="12" Body="&lt;p&gt;We already have a consensus that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4940/12012&quot;&gt;functions have to be reusable arbitrarily often&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While that consensus arose in the context of side effects (such as changing global variables in a way that prevents the function from working more than once), I think we should apply it to this situation as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;1+_*&lt;/code&gt; is &lt;em&gt;not&lt;/em&gt; a function. Yes, it operates on the top of the stack (as a function would), and yes, it pops &lt;strong&gt;n&lt;/strong&gt; and pushes &lt;strong&gt;(n+1)&lt;sup&gt;2&lt;/sup&gt;&lt;/strong&gt; (as a function would), but &lt;em&gt;you can only use it once&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The whole point of defining a function is that you don't have to write the same code more than once to perform the same procedure. &lt;code&gt;{1+_*}&lt;/code&gt; clearly satisfies this, as you can make a copy from wherever (&lt;code&gt;&amp;lt;n&amp;gt;$&lt;/code&gt;), save it in a variable (&lt;code&gt;:F&lt;/code&gt;), or map it over an array (&lt;code&gt;%&lt;/code&gt;). The bare &lt;code&gt;1+_*&lt;/code&gt; doesn't allow you to do any of these things.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2018-03-18T14:22:24.950" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16047" PostTypeId="2" ParentId="2140" CreationDate="2018-03-18T16:51:16.460" Score="20" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/162093/66833&quot;&gt;Build a golfing language with me&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2018-04-13T09:22:15.530" LastActivityDate="2018-04-13T09:22:15.530" CommentCount="22" ContentLicense="CC BY-SA 3.0" />
  <row Id="16049" PostTypeId="2" ParentId="16045" CreationDate="2018-03-19T10:45:35.700" Score="1" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;This is the example given in the linked answer, but in reality, &lt;code&gt;1+_*&lt;/code&gt; is a function, and &lt;code&gt;{1+_*}&lt;/code&gt; is a function that pushes a function to the stack&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;You seem to be assuming the answer you want within the &quot;question&quot;, but your working definition of &lt;em&gt;function&lt;/em&gt; is certainly open to debate. The reason that the linked answer to the primary meta question on this subject calls CJam blocks &quot;&lt;em&gt;function-like&lt;/em&gt;&quot; is because when that answer was written blocks, J verbs, etc. were not considered to be functions, strictly speaking.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider that the name &lt;em&gt;function&lt;/em&gt; has been used in language documentation for something like 50 years. If a language's doc doesn't describe the syntax to define a function, there's probably a good reason why the language designer(s) didn't consider it to have them.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-03-19T10:45:35.700" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="16056" PostTypeId="2" ParentId="2140" CreationDate="2018-03-21T08:57:26.250" Score="1" Body="&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The goal is to write a complete program that prints out every possible tetris block made up of #.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The blocks must have an equal chance of printing in any order and must appear exactly once each. The blocks may have any rotation, rotation may be consistent between executions. No two blocks can be touching. All blocks must have settled on the &quot;floor&quot;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ValidExample.exe&#xA;                    #   #&#xA;## ###      ##   ## #   #&#xA;##  #  ####  ## ##  ## ##&#xA;&#xA;TouchingExample.exe&#xA;      #&#xA;      #  # ##&#xA;## ####  #  # ##   ## &#xA;##  # # ##  #  ## ##   &#xA;&#xA;FloatingExample.exe&#xA;       #   #             &#xA;## ### ## ## #     # ####&#xA;##  #   # #  ### ###     &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Use the language of your choice, lowest number of bytes wins&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Questions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the wording clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Does the challenge meet the expectations for a challenge here?&lt;/li&gt;&#xA;&lt;li&gt;What can I do to remove any ambiguity if there is any?&lt;/li&gt;&#xA;&lt;li&gt;Is the formatting for the question / examples ok?&lt;/li&gt;&#xA;&lt;li&gt;Would the challenge be &quot;better&quot; if the blocks had to be made up of their corresponding letter (IOJLZST)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79162" LastEditorUserId="79162" LastEditDate="2018-03-21T10:01:13.913" LastActivityDate="2018-03-21T10:01:13.913" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="16058" PostTypeId="2" ParentId="2140" CreationDate="2018-03-21T14:36:28.170" Score="3" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;X1M4L got in before me and posted the very similar challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/161757/print-the-previous-answer&quot;&gt;Print the previous answer!&lt;/a&gt;, which I don't mind at all. However, that one seems to have turned out quite a lot more open-ended than this version would be, with answers tending to score in the tens of thousands. So after a sufficiently long delay this will probably not be considered a duplicate - I intend to leave it in the sandbox for at least a few months before posting.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Compress the previous answer&lt;/h1&gt;&#xA;&lt;p&gt;This is an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; challenge. The first answer must output the empty string. The second answer must output the source code of the first answer, and so on, with each answer outputting the code of the previous one.&lt;/p&gt;&#xA;&lt;p&gt;To make this challenging, no answer may be longer than 100 bytes in length. Once the answers start getting close to this limit, it will become necessary to compress the text of the previous answers, which itself will become harder over time.&lt;/p&gt;&#xA;&lt;p&gt;Each answer should output the exact string of bytes that forms the previous program. Because of this, if your program is in any format other than plain ASCII, you should post a hexdump as well as the source, so that the next person knows exactly what to output.&lt;/p&gt;&#xA;&lt;p&gt;An answer's score is its position in the chain, i.e. the &lt;code&gt;N&lt;/code&gt;th answer scores &lt;code&gt;N&lt;/code&gt; points. Your score is the score of your highest-scoring answer. You are encouraged to treat this challenge cooperatively, keeping the chain going as long as possible by not adding extra unnecessary entropy to your code.&lt;/p&gt;&#xA;&lt;p&gt;The code of your answer cannot be identical to the code of any previous answer. The first answer must be at least one byte in length.&lt;/p&gt;&#xA;&lt;p&gt;You may not post two consecutive answers. There are no restrictions on language.&lt;/p&gt;&#xA;&lt;p&gt;tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; rel=&quot;tag&quot;&gt;compression&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="21034" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-04-15T04:14:39.250" CommentCount="17" ContentLicense="CC BY-SA 3.0" />
  <row Id="16059" PostTypeId="2" ParentId="14737" CreationDate="2018-03-21T15:59:12.663" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/DennisMitchell/sesos&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sesos&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Sesos is a language largely based upon &lt;a href=&quot;https://en.wikipedia.org/wiki/Brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;brainfuck&lt;/a&gt;, but it has some extra features:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Unbounded signed integers (can be disabled)&lt;/li&gt;&#xA;&lt;li&gt;I/O with numbers (input and output must be enabled separately)&lt;/li&gt;&#xA;&lt;li&gt;Conditional jump based on whether the input's EOF has been reached&lt;/li&gt;&#xA;&lt;li&gt;Conditional jump, with the code before it having been executed at least once.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Additionally, it has a difference from brainfuck: While brainfuck's &lt;code&gt;+&lt;/code&gt; and &lt;code&gt;-&lt;/code&gt; increment and decrement the current cell respectively, Sesos's &lt;code&gt;add&lt;/code&gt; and &lt;code&gt;sub&lt;/code&gt; take an argument determining how much to add or subtract respectively. The same difference also applies between brainfuck's &lt;code&gt;&amp;gt;&lt;/code&gt; (go one cell right) and &lt;code&gt;&amp;lt;&lt;/code&gt; (go one cell left) and Sesos's &lt;code&gt;fwd&lt;/code&gt; and &lt;code&gt;rwd&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another important difference is that you can't put certain instructions next to each other, due to how the program is encoded into a binary file. More specifically, &lt;code&gt;add&lt;/code&gt;/&lt;code&gt;sub&lt;/code&gt;, &lt;code&gt;fwd&lt;/code&gt;/&lt;code&gt;rwd&lt;/code&gt; and &lt;code&gt;jmp&lt;/code&gt;/&lt;code&gt;jnz&lt;/code&gt; are pairs of instructions which can't be put one after the other. Also, &lt;code&gt;get&lt;/code&gt; can't go after &lt;code&gt;add&lt;/code&gt; or &lt;code&gt;sub&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The final difference is that &lt;code&gt;jmp&lt;/code&gt; and &lt;code&gt;nop&lt;/code&gt; can't be the last instructions of a program.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Programs are written top-to-bottom, instead of left-to-right, before compilation. There are 10 instructions and 3 assembler directives.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The instructions are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;add &amp;lt;n&amp;gt;&lt;/code&gt;: Adds &lt;code&gt;&amp;lt;n&amp;gt;&lt;/code&gt; to the current cell.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;sub &amp;lt;n&amp;gt;&lt;/code&gt;: Subtracts &lt;code&gt;&amp;lt;n&amp;gt;&lt;/code&gt; from the current cell.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;fwd &amp;lt;n&amp;gt;&lt;/code&gt;: Moves &lt;code&gt;&amp;lt;n&amp;gt;&lt;/code&gt; cells forward.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;bwd &amp;lt;n&amp;gt;&lt;/code&gt;: Moves &lt;code&gt;&amp;lt;n&amp;gt;&lt;/code&gt; cells backward.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;put&lt;/code&gt;: Prints the content of the current cell.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;get&lt;/code&gt;: Takes one input character (or integer) and replaces the current cell's content with it.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;jmp&lt;/code&gt;: Sets an entry point, and jumps to its corresponding exit point (i.e. the closest following exit point that doesn't belong to any following &lt;code&gt;jmp&lt;/code&gt;s).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;nop&lt;/code&gt;: Sets an entry point.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;jnz&lt;/code&gt;: Sets an exit point and, if the current cell is non-zero, jumps right below its corresponding entry point.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;jne&lt;/code&gt;: Sets an exit point and, if STDIN's EOF hasn't been reached, calls &lt;code&gt;get&lt;/code&gt; and jumps right below its corresponding entry point.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Leading &lt;code&gt;jmp&lt;/code&gt; instructions can be omitted, as long as their corresponding exit points are explicitly present in the code. The same is true for trailing &lt;code&gt;jnz&lt;/code&gt;, where their corresponding entry points must be explicitly specified.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The assembler directives are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;set numin&lt;/code&gt;: Take input as integers instead of characters.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;set numout&lt;/code&gt;: Print as numbers instead of characters.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;set mask&lt;/code&gt;: Use 8-bit unsigned integers instead of unbounded signed integers.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In the source code, those directives can be put anywhere, and the result will be the same.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Extra whitespace is ignored.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Details about the compilation process can be found over the GitHub repository.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I'm nominating this language because interest was always little and gradually faded away. I think it's a very interesting language, and it definitely has golfing potential.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/159818/41024&quot;&gt;Tips for golfing in Sesos&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2018-03-21T17:07:15.947" LastActivityDate="2018-03-21T17:07:15.947" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="16061" PostTypeId="1" CreationDate="2018-03-21T23:53:00.187" Score="2" ViewCount="122" Body="&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/159755/this-code-errors-on-this-and-that-is-it-really-written-in-them&quot;&gt;my recent challenge&lt;/a&gt;, the task is to generate an output &lt;em&gt;including the language name&lt;/em&gt;, and then generate an error (in two different languages).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regarding the &quot;language name&quot;, I used the following rules (since someone mentioned that another challenge was closed due to the &quot;language name&quot; being unclear):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In the output, language names should exactly follow:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The name listed on &lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;, optionally excluding the version number and/or the implementation name (e.g. if you use &lt;code&gt;JavaScript (Node.js)&lt;/code&gt; as one of your languages, you can use &lt;code&gt;JavaScript&lt;/code&gt; for your language name, but not &lt;code&gt;JS&lt;/code&gt; or &lt;code&gt;Javascript&lt;/code&gt;.)&lt;/li&gt;&#xA;&lt;li&gt;The full name on the official website (or GitHub repo) if your language of choice is not available on TIO.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I believe that these rules cover most languages used in PPCG (and a few others on chat said it looks clear enough when this post was in the Sandbox).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But then @Mark asked in the comment:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What about &lt;strong&gt;languages that are too old to have an official website or GitHub repository&lt;/strong&gt;?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I've got some ideas, but all of them have some amount of ambiguity:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Submissions on PPCG must have a working compiler/interpreter to run the program on. And the compiler/interpreter should have some name associated with it.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A compiler often has an implementation name, not language name, as its name (e.g. GCC or Clang for C).&lt;/li&gt;&#xA;&lt;li&gt;What if there are multiple implementations and they use different names for that language?&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Just fall back to the most common name (or any common name) for such a language.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How to define &quot;most common name&quot;?!&lt;/li&gt;&#xA;&lt;li&gt;&quot;any common name&quot; could lead to nonsense arguments in order to reduce bytes or something, and this might be an unfair advantage against languages with a well-established name.&lt;/li&gt;&#xA;&lt;li&gt;&quot;any common name&quot; is also a problem when e.g. a challenge wants to ban chars used in the language name.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Any possible improvements to the above, or any other suggestions are welcome.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2018-03-23T02:26:23.637" Title="Rules for &quot;Language Name&quot; to use in a challenge" Tags="|discussion|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="16063" PostTypeId="2" ParentId="16061" CreationDate="2018-03-22T13:56:09.703" Score="0" Body="&lt;p&gt;TIO is not a good standard for language names. It has &lt;strong&gt;&lt;em&gt;only&lt;/em&gt;&lt;/strong&gt; 500 languages. There are lots of languages not included, so it's best to ignore what TIO has. TIO gets its interpreters from github anyway. Just skip the middle man and use the official language page.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a language is too old to have an official page, hopefully it at least has an official name to use. If not, consider it disallowed.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastActivityDate="2018-03-22T13:56:09.703" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="16064" PostTypeId="1" CreationDate="2018-03-22T13:56:44.457" Score="5" ViewCount="155" Body="&lt;p&gt;I couldn't find any consensus on this on meta for a while, and this seems to be particularly helpful when answering &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; challenges. Should swapping &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2190/interpretation-of-truthy-falsey&quot;&gt;truthy and falsy&lt;/a&gt; be allowed by default, when answering such challenges, unless overridden?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, when testing primality, one could output a falsy value for primes and a truthy value for non-primes. Is this allowed by default?&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="194" LastEditDate="2018-03-22T16:51:43.293" LastActivityDate="2018-03-22T16:51:43.293" Title="Is (consistently) swapping truthy / falsy values allowed in decision-problems?" Tags="|discussion|output|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="16065" PostTypeId="2" ParentId="16064" CreationDate="2018-03-22T14:07:11.243" Score="12" Body="&lt;p&gt;Defaults apply by default (duh), but they do not override the challenge specification. In contrast, the challenge specification can override our defaults in any way it deems fit. Thus, all answers should do what the challenge asks for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the challenge asks for a truthy value for primes and a falsy value for non-primes, output a a truthy value for primes and a falsy value for non-primes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, if the challenge only asks for two consistent and distinct outputs for primes and non-primes and specifies no further restrictions, truthiness no longer matters.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2018-03-22T14:07:11.243" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16066" PostTypeId="2" ParentId="16064" CreationDate="2018-03-22T14:13:59.807" Score="2" Body="&lt;h1&gt;You should ask the OP&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Consensus exists to help us deem what we think is appropriate for all challenges, not to override what challengers say.  The challengers are probably much better equipped to make specific decisions about what is best for their challenge than for us to make sweeping defaults about all challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that for decision problems where two consistent values are requested, (which seem to be becoming more popular because of issues with truthy v. falsy), swapping values is perfectly acceptable just by the definition of the challenge.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2018-03-22T14:13:59.807" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16067" PostTypeId="2" ParentId="16064" CreationDate="2018-03-22T14:59:29.823" Score="1" Body="&lt;h1&gt;Allow swapping them by default&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Having to negate the truthiness of a certain value sometimes only adds unnecessary bytes to a submission. Unless explicitly overridden in the challenge body, swapping truthy / falsy values should be allowed by default.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note to challenge writers – You may want to read &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12305/31625&quot;&gt;this meta discussion&lt;/a&gt; about replacing &lt;em&gt;truthy / falsy values&lt;/em&gt; (which is a concept which some languages don't have) with other methods, suitable for decision-problems.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastActivityDate="2018-03-22T14:59:29.823" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="16068" PostTypeId="1" AcceptedAnswerId="16069" CreationDate="2018-03-22T18:47:09.373" Score="2" ViewCount="1615" Body="&lt;p&gt;What are the rules for using c++ in code golf? In TIO, there is a header section and a footer section. Can you put your #includes in the header section?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do you use this template?&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;HEADER: [#include...]&#xA;CODE: &amp;lt;function&amp;gt;&#xA;FOOTER: &amp;lt;main method, runs function&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##Sy4o0E1PTv6vnJmXnFOakqpg4@nn7BPq4qobHOIY4urr6hcSbPe/LD8zRSFNQ7O69n9mXolCbmJmnoamQjUXZ5qGsaY1V@1/AA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;C++ (gcc) – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="75059" LastEditorUserId="31716" LastEditDate="2018-03-22T19:10:50.890" LastActivityDate="2018-03-22T19:10:50.890" Title="What is the purpose of &quot;header&quot; and &quot;footer&quot; for C++ submissions using TIO?" Tags="|discussion|code-golf|rules|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="16069" PostTypeId="2" ParentId="16068" CreationDate="2018-03-22T19:09:53.250" Score="7" Body="&lt;p&gt;If your submission require the includes, then no you may not put the &lt;code&gt;#include&lt;/code&gt;s in the header. It is consensus that imports/includes should count towards your score.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/383/should-imports-includes-count-in-golf&quot;&gt;should imports/includes count in golf&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/188/using-libraries-in-solutions&quot;&gt;Using libraries in solutions&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The reason the &lt;code&gt;header&lt;/code&gt; and &lt;code&gt;footer&lt;/code&gt; exist is so that you can put boilerplate code in there for testing your program, but then have your byte count not be affected by the boilerplate. For example, if you submitted a function to add two numbers together, such as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;int s(int a,int b){return a+b;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;then this is a valid 31-byte solution. However, people looking at it can't immediately verify that this solution is correct because it needs certain boilerplate to run. So you could put some additional code in the header and footer to make it a testcase, like &lt;a href=&quot;https://tio.run/##jc5NCoMwEAXgfU/xsJsEI1gVBH96l5iEEtAoJkJBPLtN7Eawi85iYOYxHyOmKRE9N6/9ro3oF6nQ6NG6WfHhuWvjYEnonIXe0XVWbpkNeNzV25EPXBtC1xt8WSerSoyLQ9MgyhGjQNsiCqMlOUNBjwREvSclnJIVSvqNw6kysq9/SKmXspOUMmRXKftDSh7BKk@W3zD/xEVL8gu37R8&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;C++ (clang) – Try It Online&quot;&gt;Try it online!&lt;/a&gt; without drastically inflating your byte count.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that here, I am putting the &lt;code&gt;#include &amp;lt;iostream&amp;gt;&lt;/code&gt; in the header because that is needed for the testcase, &lt;em&gt;not&lt;/em&gt; the function. If you were submitting a function that required a library such as &lt;code&gt;string&lt;/code&gt; or &lt;code&gt;vector&lt;/code&gt;, then that would still need to go under &lt;code&gt;code&lt;/code&gt; and count towards your byte-count.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2018-03-22T19:09:53.250" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16071" PostTypeId="2" ParentId="16061" CreationDate="2018-03-23T01:57:08.337" Score="1" Body="&lt;p&gt;Use name in following fallback rules:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Official name used by the compiler / interpreter&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Since we define language as its implementation, we should look at this first;&lt;/li&gt;&#xA;&lt;li&gt;We are talking about name of languages, not name of compilers&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use &lt;code&gt;C&lt;/code&gt; instead of &lt;code&gt;Intel® C Compiler&lt;/code&gt;;&lt;/li&gt;&#xA;&lt;li&gt;Use &lt;code&gt;JavaScript&lt;/code&gt; instead of &lt;code&gt;Node.js&lt;/code&gt;;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;If different implementation (maybe dialect) use different names, chose the one which your program works on;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use &lt;code&gt;MySQL&lt;/code&gt;, &lt;code&gt;PostgreSQL&lt;/code&gt;, &lt;code&gt;SQLite&lt;/code&gt; instead of &lt;code&gt;SQL&lt;/code&gt;;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Official name may come from official website, official code repository readme (including GitHub), official documentation. If they give different names, any one is fine.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Official name used by the language specification&lt;/li&gt;&#xA;&lt;li&gt;Title of English Wikipedia article of the language (excluding disambiguation parts)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use last version of the article when question posted&lt;/li&gt;&#xA;&lt;li&gt;Page title may be incorrect due to some reason (e.g. technical restrictions). Use the correct one described in the article.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Title of Esolang article for the language&lt;/li&gt;&#xA;&lt;li&gt;Any common name but marked as non-competing&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="44718" LastEditorUserId="44718" LastEditDate="2018-03-23T02:26:23.637" LastActivityDate="2018-03-23T02:26:23.637" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16072" PostTypeId="1" CreationDate="2018-03-23T06:58:36.250" Score="7" ViewCount="339" Body="&lt;p&gt;Based on information in  &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8461/9365&quot;&gt;this post&lt;/a&gt; I feel I should try and validate all answers to my challenges. That hasn't proved too hard so far which is good, but &lt;a href=&quot;https://codegolf.stackexchange.com/a/156158/9365&quot;&gt;Dennis's answer here&lt;/a&gt; technically wins the criteria of the challenge, but I cannot actually validate it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The information in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12831/9365&quot;&gt;this post&lt;/a&gt; doesn't really seem to hold an answer so I thought I'd pose this question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since I can't (and nobody can) test this answer, is it ineligible to win the challenge?&lt;/p&gt;&#xA;" OwnerUserId="9365" LastEditorUserId="46271" LastEditDate="2018-03-26T21:10:39.973" LastActivityDate="2018-03-26T21:10:39.973" Title="Should I accept an answer to a question I cannot validate?" Tags="|discussion|rules|" AnswerCount="0" CommentCount="20" ContentLicense="CC BY-SA 3.0" />
  <row Id="16076" PostTypeId="2" ParentId="2140" CreationDate="2018-03-23T16:29:56.637" Score="0" Body="&lt;h1&gt;Euler's Formula for the Quaternions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Euler's famous formula, &lt;code&gt;e^iθ = cosθ + isinθ&lt;/code&gt;, can be used to calculate the exponential of arbitrary complex numbers: &lt;code&gt;e^(a+ib) = e^a(cosb + isinb)&lt;/code&gt;. That's cool and all, but what if we want to go even further?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The quaternions are an expansion of the complex numbers, where instead of just having &lt;code&gt;i*i = -1&lt;/code&gt;, you have &lt;code&gt;i*i = j*j = k*k = i*j*k = -1&lt;/code&gt;. Quaternions can be represented as &lt;code&gt;a + bi + cj + dk&lt;/code&gt; or &lt;code&gt;(s, v)&lt;/code&gt; where &lt;code&gt;s&lt;/code&gt; is a scalar and &lt;code&gt;v&lt;/code&gt; is a 3-Dimensional vector.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Euler's formula can be extended to the quaternions; for an arbitrary quaternion &lt;code&gt;q = (s, v)&lt;/code&gt;, &lt;code&gt;e^q = e^s (cos|v|, (v/|v|)sin|v|)&lt;/code&gt;, or, if &lt;code&gt;q = a + bi + cj + dk&lt;/code&gt; and &lt;code&gt;r = sqrt(b^2 + c^2 + d^2)&lt;/code&gt;, &lt;code&gt;e^q = e^a (cosr + (bi + cj + dk)(sinr)/r)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The task:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write a program or function to exponentiate arbitrary quaternions. Built-ins are allowed. You may represent a quaternion in any sane manner.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Here, quaternions are represented as a four element array.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input                                    Output (approximately)&#xA;0 3.14159 0 0                            -1&#xA;0 1 1 1                                  -0.160557 0.56986 0.56986 0.56986&#xA;1 2 3 4                                  1.69392 -0.78956 -1.18434 -1.57912&#xA;0.095767 0.601479 0.285658 0.926716      0.458433 0.527339 0.250447 0.812487&#xA;-0.654682 -0.925557 -0.409382 0.619391   0.194782 -0.37576 -0.166202 0.251462&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="76025" LastEditorUserId="76025" LastEditDate="2018-03-26T05:54:24.730" LastActivityDate="2018-03-26T05:54:24.730" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="16077" PostTypeId="2" ParentId="2140" CreationDate="2018-03-24T14:37:46.423" Score="2" Body="&lt;h1&gt;Minimal viable file corruptor&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your totally legal ROM collection, as vast as it may be, has started feeling a bit mundane recently. Why not spice it up a notch? Write a program that takes in the following arguments:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first (inclusive) and last (exclusive) bytes between which the corruption will occur (indexing can start from either 0 or 1, as long as it's consistent)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;n&lt;/code&gt;, the distance between bytes to be corrupted (1 = all bytes, 2 = every second byte, etc.)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;i&lt;/code&gt;, the increment value&lt;/li&gt;&#xA;&lt;li&gt;&lt;del&gt;Path or&lt;/del&gt; contents of the file to be corrupted&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;and &lt;del&gt;saves or&lt;/del&gt; outputs a modified version of the file where every &lt;code&gt;n&lt;/code&gt;th byte in the specified range has been incremented by &lt;code&gt;i&lt;/code&gt;. In case of an overflow, take the modulo 256 of the number. &lt;del&gt;If saved as a file, the path can be anything &lt;strong&gt;but&lt;/strong&gt; the input one (unless you've appended something to it or whatever). You wouldn't want to lose your legally-acquired ROMs, would you?&lt;/del&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;File:   00 01 02 03 04&#xA;Start:  0&#xA;End:    5&#xA;n:      1&#xA;i:      7&#xA;Output: 07 08 09 0a 0b&#xA;&#xA;File:   ff ff ff ff ff ff ff ff&#xA;Start:  2&#xA;End:    5&#xA;n:      1&#xA;i:      1&#xA;Output: ff ff 00 00 00 ff ff ff&#xA;&#xA;File:   00 00 00 00 00 00 00 00 00 00&#xA;Start:  3&#xA;End:    8&#xA;n:      2&#xA;i:      16&#xA;Output: 00 00 00 10 00 10 00 10 00 00&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You want as much space as possible for your most definitely not pirated files, so &lt;strong&gt;shortest bytecount wins&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;TODO: clarify the rules a bit? also another example or two&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="58624" LastEditorUserId="58624" LastEditDate="2018-03-25T14:39:00.677" LastActivityDate="2018-03-25T14:39:00.677" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="16082" PostTypeId="2" ParentId="2140" CreationDate="2018-03-26T12:33:21.337" Score="-2" Body="&lt;p&gt;&lt;strong&gt;Move a window around the screen&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code should open  a new window that is at least 100 by 100 pixels in size.  Once the window is open you should be able to move the window around the screen using the keyboard.  The window should move smoothly but it doesn't matter how fast it moves.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/gui&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;gui&amp;#39;&quot; rel=&quot;tag&quot;&gt;gui&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user9206" LastEditorDisplayName="user9206" LastEditDate="2018-03-26T12:46:15.857" LastActivityDate="2018-03-26T12:46:15.857" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="16085" PostTypeId="2" ParentId="2140" CreationDate="2018-03-26T19:55:50.140" Score="0" Body="&lt;h1&gt;Brainfuck Compiler!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-generation&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-generation&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your goal is simple: Compile brainfuck to x86 assembly (NASM style), and do it with as small of a program as possible. You will be able to choose your compiler's input and output model, as long as the input is brainfuck code and the output is NASM style x86 assembly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The brainfuck code should read from STDIN and output to STDOUT&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your compiler must be fully compliant with no extensions, and must support a infinite (to the max the computer's memory can sustain, running out of space on either end can be treated as a crash.) number of unsigned 8 bit cells both forward and back, with the tape  Your output assembly should provide the exact same outputs for the corresponding inputs as the brainfuck code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program's output must be compilable to a ELF binary that runs on Linux using the NASM compiler. Your program will be linked with libc, so you can use any function in the C library. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;What is Brainfuck?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Brainfuck is a language with 8 instructions, and a tape memory model composed of an infinite amount of unsigned 8 bit (1 byte) cells. The pointer always points to one of those cells, executing its operations on the current cell.&#xA;Each instruction is executed one at a time, and are as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;+&lt;/code&gt; Increment the current value under the pointer&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;-&lt;/code&gt; Decrement the current value under the pointer&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;.&lt;/code&gt; Output the value under the pointer as an ASCII character&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;,&lt;/code&gt; Get a character from input, and wait until one is received.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;gt;&lt;/code&gt; Move the pointer to the right&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;lt;&lt;/code&gt; Move the pointer to the left&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[&lt;/code&gt; Jump to the matching &lt;code&gt;]&lt;/code&gt; if the value under the pointer is 0&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;]&lt;/code&gt; Jump to the matching &lt;code&gt;[&lt;/code&gt; if the value under the pointer is not 0 &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If a &lt;code&gt;[&lt;/code&gt; doesn't have a matching &lt;code&gt;]&lt;/code&gt; (or vice versa), you can consider that undefined behavior.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anything not listed here should be considered a NOP, or in the case of a empty program (EOF), simply a blank, noncrashing program.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;To allow competition, and varying compilation results, my test cases will show what each test program should output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;++++++++++[&amp;gt;+++++++&amp;gt;++++++++++&amp;gt;+++&amp;gt;+&amp;lt;&amp;lt;&amp;lt;&amp;lt;-]&amp;gt;++.&amp;gt;+.+++++++..+++.&amp;gt;++.&amp;lt;&amp;lt;+++++++++++++++.&amp;gt;.+++.------.--------.&amp;gt;+.&amp;gt;.&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Outputs (no input):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;Hello, World!&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+[,.]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Outputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;I am a test string&quot; -&amp;gt; &quot;I am a test string&quot;&#xA;&#xA;&quot;Golfing is fun!&quot; -&amp;gt; &quot;Golfing is fun!&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;`+[]`&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Outputs:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Nothing. This program loops forever.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+[&amp;lt;+]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Outputs:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This program can be considered undefined behavior, because it will eventually run out of memory.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;TODO&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;More test cases?&lt;/p&gt;&#xA;" OwnerUserId="77964" LastEditorUserId="77964" LastEditDate="2018-03-27T01:45:18.493" LastActivityDate="2018-03-27T01:45:18.493" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="16086" PostTypeId="2" ParentId="2140" CreationDate="2018-03-27T00:50:42.620" Score="-1" Body="&lt;h1&gt;Common Logic Gates&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given positive integer &lt;code&gt;n&lt;/code&gt;, make a common &lt;code&gt;n&lt;/code&gt;-to-1 gate with fewest input, i.e. make a function f: {0,1}&lt;sup&gt;k&lt;/sup&gt; ↦ {0,1} with smallest &lt;code&gt;k&lt;/code&gt; that, for each function g: {0,1}&lt;sup&gt;n&lt;/sup&gt; ↦ {0,1}, there exists {a&lt;sub&gt;k&lt;/sub&gt;}, such that each element a&lt;sub&gt;i&lt;/sub&gt; in the sequence map to one of 0, 1, x&lt;sub&gt;1&lt;/sub&gt;, x&lt;sub&gt;2&lt;/sub&gt;, x&lt;sub&gt;3&lt;/sub&gt;, ..., x&lt;sub&gt;n&lt;/sub&gt;, satisfying that, for each {x&lt;sub&gt;n&lt;/sub&gt;}, g(x&lt;sub&gt;1&lt;/sub&gt;, x&lt;sub&gt;2&lt;/sub&gt;, x&lt;sub&gt;3&lt;/sub&gt;, ..., x&lt;sub&gt;n&lt;/sub&gt;) = f(a&lt;sub&gt;1&lt;/sub&gt;, a&lt;sub&gt;2&lt;/sub&gt;, a&lt;sub&gt;3&lt;/sub&gt;, ..., a&lt;sub&gt;n&lt;/sub&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Samples:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To make a common 1-to-1 gate, your circuit must take at least 2 input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f(A,B) = A XOR B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For a buffer gate (g = x&lt;sub&gt;1&lt;/sub&gt; ↦ x&lt;sub&gt;1&lt;/sub&gt;), let A=0 and B=Input (a&lt;sub&gt;1&lt;/sub&gt; = 0, a&lt;sub&gt;2&lt;/sub&gt; = x&lt;sub&gt;1&lt;/sub&gt;); for a not gate (g = x&lt;sub&gt;1&lt;/sub&gt; ↦ ¬x&lt;sub&gt;1&lt;/sub&gt;) , let A=1 and B=Input (a&lt;sub&gt;1&lt;/sub&gt; = 1, a&lt;sub&gt;2&lt;/sub&gt; = x&lt;sub&gt;1&lt;/sub&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Alternatively, you can use &lt;code&gt;f(A,B) = A AND NOT B&lt;/code&gt;. For a buffer gate, let B=0 and A=Input; for a not gate, let A=1 and B=Input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To make a common 2-to-1 gate, the circuit must take at least 4 input bits: (The two inputs are represented as &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f(A,B,C,D) = ((A AND B) OR (C AND NOT B)) XOR D&#xA;&#xA;(ab)&#xA;00 01 10 11 A B C D&#xA;0  0  0  1  a b 0 0&#xA;0  0  1  0  0 b a 0&#xA;0  1  1  0  a a a b&#xA;0  1  1  1  1 b a 0&#xA;1  0  0  0  1 b a 1&#xA;1  0  0  1  0 a 1 b&#xA;1  1  0  1  0 b a 1&#xA;1  1  1  0  a b 0 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output can be an boolean expression with reasonable logic gates, or just the output corresponding to all possible input of the &lt;code&gt;n&lt;/code&gt;-to-1 function &lt;code&gt;f&lt;/code&gt; (the truth table of &lt;code&gt;f&lt;/code&gt;). If there are more than one possible functions, you can output any of them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Shortest code in bytes win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code that matches the requirement:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;function solve(n) { // n positive int&#xD;&#xA;    var res = [], tmp=[], inmap=[], need=[];&#xD;&#xA;    for (var i=1; ; i++) {&#xD;&#xA;        for (var _res=0; _res&amp;lt;2**(2**i); _res++) {&#xD;&#xA;            var valid = 1;&#xD;&#xA;            for (var j=0; j&amp;lt;2**i; j++)&#xD;&#xA;                tmp[j] = Math.floor(_res/2**j)%2;&#xD;&#xA;            for (var _need=0; _need&amp;lt;2**(2**n); _need++) {&#xD;&#xA;                for (var j=0; j&amp;lt;2**n; j++) &#xD;&#xA;                    need[j] = Math.floor(_need/2**j)%2;&#xD;&#xA;                var valid2 = 0;&#xD;&#xA;                for (var _inmap=0; _inmap&amp;lt;(n+2)**i; _inmap++) {&#xD;&#xA;                    var valid3 = 1;&#xD;&#xA;                    for (var j=0; j&amp;lt;i; j++) &#xD;&#xA;                        inmap[j] = Math.floor(_inmap/(n+2)**j)%(n+2) - 1;&#xD;&#xA;                    for (var j=0; j&amp;lt;2**n; j++) {&#xD;&#xA;                        var bits = 0;&#xD;&#xA;                        for (var k=0; k&amp;lt;i; k++) {&#xD;&#xA;                            if (inmap[k]==-1 || (inmap[k] &amp;amp;&amp;amp; (j&amp;gt;&amp;gt;(inmap[k]-1))%2))&#xD;&#xA;                                bits |= 1 &amp;lt;&amp;lt; k;&#xD;&#xA;                        }&#xD;&#xA;                        if (tmp[bits] != need[j]) &#xD;&#xA;                            valid3 = 0;&#xD;&#xA;                    }&#xD;&#xA;                    valid2 |= valid3;&#xD;&#xA;                }&#xD;&#xA;                if (!valid2) valid = 0;&#xD;&#xA;            }&#xD;&#xA;            if (valid) &#xD;&#xA;                res.push (tmp.slice());&#xD;&#xA;        }&#xD;&#xA;        if (res.length) &#xD;&#xA;            return res[AnyNonNegativeIntegerLessThan(res.length)];&#xD;&#xA;        // binary index input&#xD;&#xA;    }&#xD;&#xA;}&#xD;&#xA;&#xD;&#xA;function AnyNonNegativeIntegerLessThan(x) { if(R&amp;gt;=x) throw (&quot;end&quot;); return R;}&#xD;&#xA;for (R=0; ; R++) { console.log (solve(1)); }&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-04-02T16:44:20.937" LastActivityDate="2018-04-02T16:44:20.937" CommentCount="19" ContentLicense="CC BY-SA 3.0" />
  <row Id="16087" PostTypeId="2" ParentId="2140" CreationDate="2018-03-27T03:00:34.297" Score="-1" Body="&lt;h1&gt;Interpret pseudocode&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Wikipedia says pseudocode&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;is intended for human reading rather than machine reading.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A program in pseudocode is not an executable program.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't care.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Make a pseudocode interpreter that can run pseudocode that fits the rules described below*. This is based on the &lt;a href=&quot;http://ib.compscihub.net/wp-content/uploads/2015/04/IB-Pseudocode-rules.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;IB pseudocode guide&lt;/a&gt;, but it is simplified quite a bit to make it fit for the challenge.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Pseudocode specifications&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a simplified pseudocode to make the challenge less tedious. The pseudocode language has no strings, no arrays, no classes, no methods, and no variables other than integers.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Basic syntax&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Comments that start at &lt;code&gt;//&lt;/code&gt; and end at a newline (like java one-line comments). &lt;code&gt;//&lt;/code&gt; is not necessarily followed by a space, and the comment may be empty. Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = 2 + 3 // I can't write five because my keyboard is broken&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Statements are separated by newlines. Lines may be empty (without statements). The exact number of spaces doesn't matter, and spaces are not required. The language is case sensitive.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Variables&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;All variables are global, and can be accessed anywhere. They do not need to be declared. To keep things simple, all variables can be assumed to be integers. All variable names are UPPERCASE, and consist only of letters. Your program should at least handle integers from -256 to 256. A wider range is not a requirement.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Variables are assigned values using this syntax:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;VARIABLE = Expression&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where VARIABLE can be any uppercase name and expression can be any integer expression, as discussed below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = 5&#xA;B = A + 3&#xA;NUMBER = A * B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Expressions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An expression can be:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An integer, like &lt;code&gt;42&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;A variable, like &lt;code&gt;NUMBER&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;A binary operation on two other expressions, like NUMBER + 5. There are only four operations: &lt;code&gt;+&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;, &lt;code&gt;*&lt;/code&gt;, &lt;code&gt;/&lt;/code&gt;. Division rounds integers down.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Expressions can be surrounded by parentheses to indicate that they need to be evaluated first. To keep things simple, all expressions are evaluated from left to right no matter what the operations are (unless there are parentheses that specify otherwise), so&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = 2 - RM * 9 + 3 / NUMBER&#xA;B = 1 + 2 * (3 - 4) / 6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is equivalent to&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = (((2 - RM) * 9) + 3) / NUMBER&#xA;B = ((1 + 2) * (3 - 4)) / 6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Boolean expressions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Boolean expressions can compare two expressions using &lt;code&gt;==&lt;/code&gt; (equality), &lt;code&gt;!=&lt;/code&gt; (not equal to), &lt;code&gt;&amp;lt;&lt;/code&gt; (less than), and &lt;code&gt;&amp;gt;&lt;/code&gt; (greater than). They are only used for control flow, as discussed below (there are no boolean variables).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Control flow&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are four types of control flow. They can be infinitely nested in all combinations.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;If&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;if (booleanExpression) then&#xA;    // statements (discussed below)&#xA;endif&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;If-else&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;if (booleanExpression) then&#xA;    // statements (discussed below)&#xA;else&#xA;    // other statements&#xA;endif&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Loop while&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;loop while (booleanExpression)&#xA;    // do stuff&#xA;endloop&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;booleanExpression&lt;/code&gt;s are boolean expressions. The &lt;code&gt;if&lt;/code&gt;s work the same as in normal programming languages. The &lt;code&gt;while&lt;/code&gt; loop is a simple while loop.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The booleanExpressions will always be surrounded by &lt;code&gt;()&lt;/code&gt;. The pseudocode is very flexible with spaces, and any number of spaces is valid.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Loop for&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;loop VARIABLE from Expression1 to Expression2&#xA;    // things to do over and over again&#xA;end loop&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;Expression1&lt;/code&gt; and &lt;code&gt;Expression2&lt;/code&gt; are expressions that are evaluated before the loop begins and their values are stored until the loop finishes. The content of the loop is executed for every integer from the result of &lt;code&gt;Expression1&lt;/code&gt; to that of &lt;code&gt;Expression1&lt;/code&gt;, inclusive. At every iteration, the index variable (&lt;code&gt;VARIABLE&lt;/code&gt; in this case) is updated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;loop I from 3 to 5&#xA;    output(I)&#xA;endloop&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Outputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3&#xA;4&#xA;5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Statements&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;output(Expression)&lt;/code&gt; outputs the evaluated expression. It's like &lt;code&gt;println&lt;/code&gt; in programming languages. So:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;output(1+1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;prints &lt;code&gt;2&lt;/code&gt;, followed by a newline.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;output()&lt;/code&gt; with no arguments should print a newline.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Other statements&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If the interpreter encounters any other statement that looks like a method call with no arguments, it should pretend it's executing it. For example,&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;lightsoff()&#xA;gohome()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;should print (together with a newline):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;executing lightsoff&#xA;executing gohome&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In other words, &lt;code&gt;executing [Method name]&lt;/code&gt; should be printed. All statements will be lowercase and will consist entirely of letters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Keywords cannot be statements. You do &lt;strong&gt;not&lt;/strong&gt; have to deal with the following (it will not appear in the pseudocode):&#xA;- if()&#xA;- endif()&#xA;- loop()&#xA;- while()&#xA;- etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, statements that start with keywords are valid. For example, loophole() should print &lt;code&gt;executing loophole&lt;/code&gt;, even though &lt;code&gt;loop()&lt;/code&gt; itself is not valid.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Challenge rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program should take a string as input. It can also take something equivalent, like an array of characters. But you can't take an array of strings; your program must itself separate the lines and tokens. You can also take a file as input.&lt;/li&gt;&#xA;&lt;li&gt;Your program should print the output of the pseudocode in any reasonable form.&lt;/li&gt;&#xA;&lt;li&gt;No standard loopholes.&lt;/li&gt;&#xA;&lt;li&gt;There are no restrictions on what your program should do when given invalid pseudocode.&lt;/li&gt;&#xA;&lt;li&gt;This is code golf. The shortest code in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Example output&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;1&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A = 3&#xA;output(A) // prints 3&#xA;B = 4 + A * 2&#xA;output(B)&#xA;helloworld()&#xA;output(A + B + 1 * 3)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Should give:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3&#xA;14&#xA;executing helloworld&#xA;54&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;2&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;loop NUM from 2 to 20 // cycle through possible prime numbers&#xA;    COUNT = 0&#xA;    loop DIV from 2 to NUM // cycle through possible divisors&#xA;        if(NUM/DIV*DIV == NUM) then // if the number is exactly divisible&#xA;            COUNT = COUNT + 1&#xA;        endif&#xA;    endloop&#xA;    if (COUNT == 2) then // if number is prime&#xA;        output(NUM)&#xA;    endif&#xA;endloop&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Should give:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2&#xA;3&#xA;5&#xA;7&#xA;11&#xA;13&#xA;17&#xA;19&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;3&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Tricky cases that your interpreter should handle:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;// empty comment:&#xA;//&#xA;// empty line:&#xA;&#xA;    // more comment testing // ///&#xA;////&#xA;&#xA;if     (3&amp;lt;4) then&#xA;    endoftheworld() // a statement&#xA;    ifff()&#xA;    endifnot()&#xA;    // endif in a comment doesn't count&#xA;endif&#xA;// loops can be empty:&#xA;loop I from 0 to 10&#xA;endloop&#xA;output(I) // variables are global&#xA;if(1&amp;lt;2)&#xA;    if(3&amp;lt;4) // nesting is ok&#xA;        ok()&#xA;    endif&#xA;endif&#xA;// spacing doesn't matter:&#xA;output   (2+   8   - 1   )&#xA;loop             while(2&amp;lt;1)&#xA;    neverhappened()&#xA;endloop&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Should output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;executing endoftheworld&#xA;executing ifff&#xA;executing endifnot&#xA;10&#xA;excecuting ok&#xA;9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;*Technically, once pseudocode follows rules as strict as those described here, it is arguably not pseudocode anymore. Wikipedia says it's called skeleton code. &lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Any suggestions?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I double-checked all the specifications, but if anything seems reasonably unclear, please let me know.&lt;/p&gt;&#xA;" OwnerUserId="74635" LastActivityDate="2018-03-27T03:00:34.297" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="16089" PostTypeId="2" ParentId="2140" CreationDate="2018-03-27T13:28:41.677" Score="2" Body="&lt;h1&gt;That's &lt;em&gt;&lt;strong&gt;MY&lt;/strong&gt;&lt;/em&gt; Program Now&lt;/h1&gt;&#xA;&lt;p&gt;Given the previous answer in the chain, write a program that outputs that program.&lt;/p&gt;&#xA;&lt;p&gt;The start of this challenge will be the following Brain-flak program:&lt;/p&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://github.com/DJMcMayhem/Brain-Flak&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brain-Flak&lt;/a&gt;, 148 bytes&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;(((((((((((()()()()){}){}){}()))){}{}())[][][][])[][])[[]]())[[][][][][]]())([([]([])[][]{})]()()()([[]](([()()()]([([][][])](((({}()){}))){}{})))))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##SypKzMzTTctJzP7/XwMJaEKgZnUtBAGZIA6YER0LgZoQIjo2FiQIE4VwNaI1omM1oGqAJsRCTQSrBkqCebFgVWBTYkGWgk0HKobYBLJR8////7qOAA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Brain-Flak – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;Your answer will be scored based on the size of the previous answer in comparison to your answer. &lt;em&gt;&lt;strong&gt;You are aiming to maximize your score (the max being 1, the minimum allowed is -10).&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;To get your answer's score:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1-[Your Answer's Bytecount]/[Previous Answer's Bytecount]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The highest possible score will be 1, which means an empty program outputs the previous program (if this ever happens, the challenge is over). Your score can be negative, and you shouldn't see this as being a bad thing, it is what it is. The minimum allowable score, however, is -10. No Lenguage answers or answers that would destroy the challenge.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&lt;h1&gt;1. &lt;a href=&quot;https://github.com/Adriandmen/05AB1E&quot; rel=&quot;nofollow noreferrer&quot;&gt;05AB1E&lt;/a&gt;, 149 bytes (Score -0.0067)&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;(((((((((((()()()()){}){}){}()))){}{}())[][][][])[][])[[]]())[[][][][][]]())([([]([])[][]{})]()()()([[]](([()()()]([([][][])](((({}()){}))){}{})))))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##TU0xDoBACPuLE2w6@BrSwUt8hfHtCO2ZHCWEQtPu5zWOO3OzpVzw51XX2oRLQHCNAPr4X0UtLGBTUw6YjlTXkwxU0QUdSvcSK6kTPfMD&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;05AB1E – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;But, the score of this program would be awful (negative even -0.0067). However, don't let a bad score dissuade you from competing if your goal is to make it a bit more difficult for the next person to attempt the challenge. Conversely, if your goal is to post a trivial answer, try not to gunk up the challenge too much.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Answer Format&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;#&amp;lt;Answer #&amp;gt;. &amp;lt;Language Name&amp;gt;, &amp;lt;N Bytes&amp;gt; (&amp;lt;Score&amp;gt;)&#xA;&#xA;&amp;lt;Code&amp;gt;&#xA;&#xA;TIO Link (If Possible)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No language may be reused until there have been 20 answers.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is arbitrary to version number, E.G. you cannot use Python 2 if 3 has been used.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;You may not post a second answer until 2 other people have answered after you.&lt;/li&gt;&#xA;&lt;li&gt;If you and another person submit the same answer #, use timestamps to decide who deletes.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;(or marks &amp;quot;non-competing&amp;quot;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Your post may have a negative score (E.G. Java will probably be negative).&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your score may not exceed -10.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;PRNG, Encryption and any form of hashing is explicitly banned (E.G. gzdeflate).&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; but the best score will be considered the winner.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The scores can be used as a decider for best answer though (if I choose to).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Sandbox question: Could this be a cops and robbers answer chaining question where the cops are trying to reduce the size while the robbers are trying to increase it? If cops get to 1 or less bytes before robbers can fill a TB HDD, one wins.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-03-29T18:57:42.973" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="16094" PostTypeId="1" AcceptedAnswerId="16095" CreationDate="2018-03-28T13:51:59.630" Score="10" ViewCount="416" Body="&lt;p&gt;Related:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12855/what-to-do-about-widely-disliked-questions-that-dont-technically-break-any-rule&quot;&gt;What to do about widely disliked questions that don&amp;#39;t technically break any rules?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9022/unspoken-challenge-rules&quot;&gt;Unspoken challenge rules&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14955/what-does-unclear-mean&quot;&gt;What does &amp;quot;unclear&amp;quot; mean?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;We have &lt;a href=&quot;https://codegolf.stackexchange.com/questions?page=189&amp;amp;sort=votes&quot;&gt;a lot of widely-disliked challenges&lt;/a&gt;. Some of them are wrongly closed (in my opinion), or just never reopened after issues have been fixed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What should be done with those challenges?&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Leave them closed. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Not a good idea, because not everyone dislikes those questions.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Just vote to reopen.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I tried it, and didn't success. Either because people disagree (they didn't leave a comment, I don't know why is that unclear) or just they're hesistant to vote to reopen a challenge they don't like. Again, &lt;em&gt;reopen votes are not super-upvotes&lt;/em&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Moderator flag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How is that?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Other.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="69850" LastEditorUserId="69850" LastEditDate="2018-04-02T14:56:36.023" LastActivityDate="2018-04-02T14:56:36.023" Title="A Close-Vote is clearly not a Super-Downvote! What to do with challenges that are wrongly closed but also widely-disliked?" Tags="|discussion|" AnswerCount="1" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="16095" PostTypeId="2" ParentId="16094" CreationDate="2018-03-28T14:22:15.273" Score="13" Body="&lt;h1&gt;Vote to reopen, and escalate if that doesn't work.&lt;/h1&gt;&#xA;&lt;p&gt;Add a reopen vote, and comment why you believe it shouldn't be closed.  Ask for open votes in chat.&lt;/p&gt;&#xA;&lt;p&gt;If that doesn't work, then you can escalate it to a mod, or post about it on meta.&lt;/p&gt;&#xA;&lt;p&gt;If all of that doesn't work, then perhaps you should reevaluate what you think should be open/closed.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-03-28T14:22:15.273" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="16096" PostTypeId="2" ParentId="2140" CreationDate="2018-03-28T14:49:33.747" Score="1" Body="&lt;h1&gt;Find the Intersection &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Given some planes in an n-dimensional space, return the intersection of these planes with the highest degree, if it exists.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;p&gt;You will be given two integers, n and k, such that 0 &amp;lt; k ≤ n and 1 &amp;lt; n. You will also be given (n-k) hyperplanes within the space &lt;strong&gt;R&lt;/strong&gt;&lt;sup&gt;n&lt;/sup&gt;. (A hyperplane in the space &lt;strong&gt;R&lt;/strong&gt;&lt;sup&gt;n&lt;/sup&gt; has (n-1) dimensions.) Your task is to find the intersection between them that has the highest number of dimensions, if it exists. This intersection will have at least k dimensions; it may have more than k dimensions if the inputs are not independent.&lt;/p&gt;&#xA;&lt;p&gt;For example, if we are working in the 3-dimensional space (&lt;strong&gt;R&lt;/strong&gt;&lt;sup&gt;3&lt;/sup&gt;), you would be given planes with 2 dimensions. If you are given 3 distinct planes, you would at best be able to find a single point where they all intersect (0 dimensions). If you are given 2 distinct planes, you could find a line where they intersect (1 dimension). Et cetera.&lt;/p&gt;&#xA;&lt;h3&gt;Input format&lt;/h3&gt;&#xA;&lt;p&gt;You may choose any standard format to represent hyperplanes in &lt;strong&gt;R&lt;/strong&gt;&lt;sup&gt;n&lt;/sup&gt;. Here are two formats that I suggest:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;v&lt;sub&gt;n&lt;/sub&gt; = c&lt;sub&gt;1&lt;/sub&gt;v&lt;sub&gt;1&lt;/sub&gt; + c&lt;sub&gt;2&lt;/sub&gt;v&lt;sub&gt;2&lt;/sub&gt; + ... + c&lt;sub&gt;n-1&lt;/sub&gt;v&lt;sub&gt;n-1&lt;/sub&gt; + c&lt;sub&gt;n&lt;/sub&gt;, where v represents a variable and c represents a scalar constant.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;c&lt;sub&gt;1&lt;/sub&gt;v&lt;sub&gt;1&lt;/sub&gt; + c&lt;sub&gt;2&lt;/sub&gt;v&lt;sub&gt;2&lt;/sub&gt; + ... + c&lt;sub&gt;n&lt;/sub&gt;v&lt;sub&gt;n&lt;/sub&gt; + c&lt;sub&gt;n+1&lt;/sub&gt;=0.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;For example, consider the plane z=2x-3y in &lt;strong&gt;R&lt;/strong&gt;&lt;sup&gt;3&lt;/sup&gt;. In format 1, I would write this as v&lt;sub&gt;3&lt;/sub&gt;=2v&lt;sub&gt;1&lt;/sub&gt;-3v&lt;sub&gt;2&lt;/sub&gt;+0, so my program would take in the tuple of scalar constants (2, -3, 0). In format 2, I would rewrite this as 2x-3y-z+0=0, and similarly take the tuple (2, -3, -1, 0). You can choose one of these two formats or another standard format, so long as you provide details in your answer.&lt;/p&gt;&#xA;&lt;p&gt;You may take in n and k explicitly if you wish, though you should be able to determine both from the list of planes (k is the number of planes, n is one more than the number of dimensions in a plane).&lt;/p&gt;&#xA;&lt;h3&gt;Output format&lt;/h3&gt;&#xA;&lt;p&gt;You should output a single plane in the same format as your input. If no intersecting plane exists, you should return something recognizably distinct from other valid outputs of your program (such as an empty tuple, false, a thrown exception, etc.).&lt;/p&gt;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&lt;p&gt;These use suggested input format 1, with n and k provided implicitly.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;[(c&lt;sub&gt;1&lt;/sub&gt;, c&lt;sub&gt;2&lt;/sub&gt;, ..., c&lt;sub&gt;n&lt;/sub&gt;), (...), ...] =&amp;gt; (c&lt;sub&gt;1&lt;/sub&gt;, c&lt;sub&gt;2&lt;/sub&gt;, ...)&lt;/p&gt;&#xA;&lt;p&gt;In &lt;strong&gt;R&lt;/strong&gt;&lt;sup&gt;3&lt;/sup&gt;, the intersection of z=-3x-2y, z=5+2x+3y, and z=-x-y-1 is the point (2, -3, 0)&lt;/p&gt;&#xA;&lt;p&gt;[(2, 3, 5), (-3, -2, 0),  (-1, -1, -1)] =&amp;gt; (2, -3, 0) // This doesn't work&lt;/p&gt;&#xA;&lt;p&gt;In &lt;strong&gt;R&lt;/strong&gt;&lt;sup&gt;3&lt;/sup&gt;, the intersection of z=4x+y and z=x+2y+1 is the line y=3x-1&lt;/p&gt;&#xA;&lt;p&gt;[(4, 1, 0), (1, 2, 1)] =&amp;gt; (3, -1)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;Scoring criteria&lt;/h3&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in each language wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;p&gt;Can you follow the goal of the challenge and the details I've provided? I've tried to be as clear as possible, but I think I may have been too verbose.&lt;/p&gt;&#xA;&lt;p&gt;I think my output format needs to change - there's no way to represent a point in &lt;strong&gt;R&lt;/strong&gt;&lt;sup&gt;n&lt;/sup&gt; the way I've phrased it...any suggestions?&lt;/p&gt;&#xA;&lt;p&gt;More test cases coming soon.&lt;/p&gt;&#xA;" OwnerUserId="69054" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-04-08T15:32:21.780" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="16102" PostTypeId="2" ParentId="2140" CreationDate="2018-03-29T16:21:27.337" Score="-2" Body="&lt;h1&gt;Let's play the too high too - low game!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;TL:DR : write a code that plays the too high - too low game&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Given this pseudo code function for the too high - too low game, write it in your language of choice. This is just to make the challenge work better across all languages. This code won't count in the final score. You may also change the function's name and any of its variable's name too.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;function isRight(number, guess):  # where the number is the correct answer and the guess is your code's guess&#xA;&#xA;    if guess &amp;lt; number:            # if the guess is too low&#xA;        return 0                  # return 0&#xA;&#xA;    else if guess &amp;gt; number:       # if the guess is too high&#xA;        return 2                  # return 2&#xA;&#xA;    else if guess == number:      # if the guess is right&#xA;        return 1                  # return 1&#xA;&#xA;    else:                         # if there is an error&#xA;        return -1                 # return -1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;The challenge&lt;/h1&gt;&#xA;&lt;p&gt;Write a code, function, script, etc. that guesses the right number. The range of the &amp;quot;random&amp;quot; number will be between 0 inclusively and 100 exclusively. For the sake of this challenge, the &amp;quot;random&amp;quot; numbers will be the test cases. Note that hard-coding the test cases is banned.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;This is how the score will be counted:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;bytes = number of bytes in your code&#xA;tries = the sum of all the tries used to guess all the test cases&#xA;&#xA;score = bytes + tries&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Hard-coding the test cases if forbidden.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;[0,2,4,13,19,21,26,33,38,42,48,50,51,56,66,69,74,75,80,89,98,99]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="67864" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-04-05T10:38:36.197" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="16103" PostTypeId="2" ParentId="2140" CreationDate="2018-03-29T18:56:00.267" Score="2" Body="&lt;h1&gt;Polyglot in a box&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output the smallest bounding rectangle that fits around your code, with the border being of a different character than the inside.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if your code is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ab&#xA;c  d&#xA;&#xA;&#xA;e&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;then the smallest bounding box is 7x6 since the code fits right in&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;######&#xA;#ab  #&#xA;#c  d#&#xA;#    #&#xA;#    #&#xA;#e   #&#xA;######&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Hence, a valid output is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;######&#xA;#    #&#xA;#    #&#xA;#    #&#xA;#    #&#xA;#    #&#xA;######&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(note how the border &lt;code&gt;#&lt;/code&gt; is different from the inside &lt;code&gt;&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;and the bounded area is 5 × 4 = 20.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Summary&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Output the smallest bounding rectangle your code fits in&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The border should be of a different character than the inside, neither can be newlines&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Only trailing/leading newlines are allowed, nothing else should be in the output&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Output to STDERR is ignored, and your program should not take any input&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Submissions must be full programs, functions are not allowed&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;0-byte programs are not allowed&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The program must run in at least 2 different programming languages and output the same bounding box in each one of them&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Score&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt;, so your program has to run in at least 2 different programming languages. Each of these languages must output the bounding box for the entire program. The winner is the submission with the most languages, with the bounding area (smaller is better) being the tie-breaker.&lt;/p&gt;&#xA;" OwnerUserId="41805" LastEditorUserId="41805" LastEditDate="2018-03-30T13:04:55.913" LastActivityDate="2018-03-30T13:04:55.913" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="16104" PostTypeId="2" ParentId="2140" CreationDate="2018-03-29T19:32:51.547" Score="0" Body="&lt;h1&gt;Fill a virtual World Cup Sticker Album&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As the World Cup is due to kick off (pun intended), the inevitable sticker book comes along as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;According to this &lt;a href=&quot;http://www.bbc.co.uk/news/business-43566749&quot; rel=&quot;nofollow noreferrer&quot;&gt;BBC article&lt;/a&gt; , at a cost of £0.80 for a pack of 5 and with a total of 682 stickers needed to complete the book it could cost up to £700 or more to fill, taking duplicates into account.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write the shortest program possible to &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Buy a virtual pack of stickers (at 0.80 per pack), which will be 5&#xA;random numbers between 1 and 682 (or 0 and 681) &lt;/li&gt;&#xA;&lt;li&gt;Repeat until all numbers have been picked at least once &lt;/li&gt;&#xA;&lt;li&gt;Output how many packs were bought and a final cost.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Output should be in the format &quot;Bought &lt;i&gt;number&lt;/i&gt; packets at cost of &lt;i&gt;number&lt;/i&gt;&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sample un-golfed Python 2 code&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import random&#xA;total = 682&#xA;remain = total&#xA;cost = 0.8&#xA;spend = 0.0&#xA;packs = 0&#xA;got = [0 for i in range(total)]&#xA;&#xA;while remain &amp;gt; 0:&#xA;    # buy a packet of stickers&#xA;    for i in range(5):&#xA;        got[random.randint(0,total-1)] += 1&#xA;    spend += cost&#xA;    remain = got.count(0)&#xA;    packs += 1&#xA;&#xA;print 'Bought %d packs at cost of %.2f' % (packs,spend)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sample output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Bought 865 packs at cost of 692.00&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;QUESTION&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Writing the Python script for myself is what made me think of this question - does it help to include it, or clutter the page? (This is my first attempt at a question here)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="18412" LastEditorUserId="18412" LastEditDate="2018-03-30T06:49:30.287" LastActivityDate="2018-03-30T06:49:30.287" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="16105" PostTypeId="2" ParentId="2140" CreationDate="2018-03-29T20:51:35.123" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;http://static.tvtropes.org/pmwiki/pub/images/rsz_bugs_2_4558.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;Left Turn at Euqreuqebla&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Write a quine, according to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4877/what-counts-as-a-proper-quine/4878#4878&quot;&gt;standard definition of a quine&lt;/a&gt;, that outputs itself when executed. However, when your code is reversed it should output each character of your source code separated by a newline instead.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&lt;p&gt;If your program was:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ABCDEFGH&#xA;IJKLMNOP&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The &lt;strong&gt;unedited program&lt;/strong&gt; should output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ABCDEFGH&#xA;IJKLMNOP&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;However the reverse of the program&lt;/strong&gt; should output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A&#xA;B&#xA;C&#xA;D&#xA;E&#xA;F&#xA;G&#xA;H&#xA;&#xA;&#xA;I&#xA;J&#xA;K&#xA;L&#xA;M&#xA;N&#xA;O&#xA;P&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Rules:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Outputting a single trailing or preceding newline is acceptable.&lt;/li&gt;&#xA;&lt;li&gt;If your code contains newlines, they do not require rotation, treat them regularly.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are disallowed.&lt;/li&gt;&#xA;&lt;li&gt;Ensure that your &amp;quot;quine&amp;quot; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4877/what-counts-as-a-proper-quine/4878#4878&quot;&gt;is actually a quine&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;; lowest byte-count wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-04-02T11:50:51.847" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="16113" PostTypeId="2" ParentId="2140" CreationDate="2018-03-31T18:10:08.710" Score="1" Body="&lt;h1&gt;Hyperprogramming: X×Y, X^Y, X^^Y all in two&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt;, just like the original.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Heavily inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/92944/hyperprogramming-nn-n%C3%97n-nn-all-in-one&quot;&gt;Hyperprogramming: N+N, N×N, N^N all in one&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to write two programs so that they compute different hyperoperations when they are placed in relation to each other in the form of the mathematical notation for that hyperoperation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Full rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write two rectangular programs of the same size — call them &quot;program A&quot; and &quot;program B&quot; — that each take a single positive integer as input and output that integer. In this case, &quot;rectangular&quot; means that every line is the same length, and that there is no trailing newline. Thus, your two programs will each be composed of M lines of N bytes each.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The catch is that when the two programs are placed next to each other in various positions, they will act as a single program that takes &lt;em&gt;two&lt;/em&gt; positive integers, X and Y, as input and outputs either X×Y, X^Y, or X^^Y (tetration), depending on the position. Moreover, when the locations of the two programs are reversed, the resulting program will print Y×X, Y^X, or Y^^X — e.g., with X and Y reversed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The precise location of the two programs with respect to each other is determined by the notation for that particular operation. For instance, if your program A reads&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;*this* is&#xA;program A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and your program B reads &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;*this* is&#xA;program B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;your program to output X×Y must contain both program's source codes placed horizontally adjacent without any filler inserted, like so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;*this* is*this* is&#xA;program Aprogram B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Because multiplication is commutative, both [AB] and [BA] must function identically.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your programs to output X^Y and Y^X must contain the code of programs A and B in the locations [ᴀᴮ] and [ʙᴬ], with spaces padding the &quot;exponent&quot; program to the correct horizontal position and optional trailing spaces after each line of the &quot;base&quot; program to pad the layout into a rectangle — no partial padding allowed, it's all or nothing. Padding must be consistent for both X^Y and Y^X (as well as X^^Y and Y^^X later). Illustrated without trailing spaces:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;         *this* is&#xA;         program B&#xA;*this* is&#xA;program A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;         *this* is&#xA;         program A&#xA;*this* is&#xA;program B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Finally, your programs to output X^^Y and Y^^X must contain the code of programs A and B in the locations [ᴮᴀ] and [ᴬʙ], with spaces padding the &quot;base&quot; program, and trailing spaces after each line of the &quot;superexponent&quot; program to pad the layout into a rectangle if and only if your X^Y and Y^X programs included trailing spaces as padding. Illustrated without trailing spaces:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;*this* is&#xA;program B&#xA;         *this* is&#xA;         program A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;*this* is&#xA;program A&#xA;         *this* is&#xA;         program B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You do not have to support arbitrarily large integers, but your answer should work for a reasonable range of X and Y — that is, it should probably at the very least support all combinations of X and Y up to 3 except maybe 3^^3 = 7625597484987.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Source code reading is allowed, as it would be very difficult to otherwise distinguish X^Y and X^^Y in many languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, fewest bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note: your score is the total byte count of a single one of your original two programs, not any of the hyperoperation-computing ones — for example, if your programs A and B are each 5×5, your score will be 5×5 + 4 newlines = 29. Since both programs A and B will have identical byte counts, it doesn't matter which one you pick.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there anything unclear about this? If so, how could I fix it?&lt;/p&gt;&#xA;" OwnerUserId="66566" LastEditorUserId="66566" LastEditDate="2018-03-31T18:51:20.213" LastActivityDate="2018-03-31T18:51:20.213" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="16115" PostTypeId="2" ParentId="7377" CreationDate="2018-04-01T04:12:42.010" Score="1" Body="&lt;p&gt;In light of new updates, I figured sizing of MC programs could be reconsidered.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These only apply to the new features and the other answers that address command blocks, entities, etc should be included in the total byte total. However, most code golf may just be solved using just these new features and no blocks (the use of the player is arguably irrelevant)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;strong&gt;1.12&lt;/strong&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;1.12 introduced function files that hold commands like a text file. Commands are listed line by line. Unlike command blocks and redstone, these require no in game blocks and only mcfunction files.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These function files are stored in the data directory.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.minecraft&#xA;|- saves&#xA;   |- 'worldname'&#xA;      |- data&#xA;         |- functions&#xA;            |- 'namespace'&#xA;                |- func-name.mcfunction&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;These files can be run with the following command in game:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;/function [func-file]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Ex&lt;/strong&gt;: With function file, test in namespace test&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;/function test:test&lt;/code&gt; will run the function&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(there is an alternative method:  &lt;code&gt;/gamerule gameLoopFunction [func-file]&lt;/code&gt; but this is obviously longer. This will, however, loop the code if it is necessary. More on this later.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are two things to keep note of:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Functions can call other functions inside of them and therefore&#xA;should be counted as multiple files are.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Functions can call themselves. This is recursion and is the only&#xA;way to execute commands in a loop in one tick in game. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;At this point, we can use the normal method of calculating bytes through the function file's byte count.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then we should add the bytes of the line to call the function in game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Total Bytes = Bytes of files + Bytes of ingame function call&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Extra: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It should be noted that in Minecraft, the namespace minecraft is&#xA;    automatically added if not defined. Therefore, you can save the&#xA;    maximum amount of bytes by using a single letter function name&#xA;    stored in a minecraft namespace.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;i.e. `/function a` for `a.mcfunction` in the `minecraft` namespace&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Looping in mc can be done via: gameLoopFunction and recursion&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;gameLoopFunction is done via the gamerule command (&lt;code&gt;/gamerule gameLoopFunction.&lt;/code&gt;). This will loop the function every tick (minecraft divides ingame stuff in ticks. 20 ticks = 1 seconds (mostly))&lt;/li&gt;&#xA;&lt;li&gt;recursion is done when a function calls itself (as you would). This happens &lt;strong&gt;within&lt;/strong&gt; a tick.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Do keep this in mind when designing your solutions for the lowest amount of bytes.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;strong&gt;1.13 (currently in snapshots)&lt;/strong&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In 1.13 (the dev. versions of Minecraft reveal what 1.13 will be), datapacks have replaced the system for functions. Datapacks can be zipped and still function within the game. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;A new addition to 1.13 removes the gameLoopFunction gamerule in favor of function tags. A JSON file can be included at `worldname/datapacks/[datapack-name]/data/[namespace]/tags/functions/[file-name].&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the JSON file is named tick.json and is located under the minecraft namespace, all functions listed as a value will be called every tick (like the old gamerule).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These bytes should be included in the total calculation.&#xA;NOTE: it should be known that calling the function w/o adding the function to the #minecraft:tick tag is completely fine. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The bytes of a valid, zipped datapack should be added with the following lines:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;/datapack enable [file-name]&lt;/code&gt;&#xA;and &lt;code&gt;/function [file-name]&lt;/code&gt; if function is not added to the tick tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;** Total Bytes = Bytes of zipped datapack + bytes of following ingame commands **&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Answer will be updated in light of new changes&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="79509" LastActivityDate="2018-04-01T04:12:42.010" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16116" PostTypeId="1" CreationDate="2018-04-01T04:13:57.813" Score="22" ViewCount="807" Body="&lt;p&gt;In accordance with our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14645/16766&quot;&gt;meta agreement&lt;/a&gt; to have a Language of the Month, and since the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14737/16766&quot;&gt;list of nominations&lt;/a&gt; has a single highest-voted entry as March nears its end, I am pleased to announce the next featured language! Throughout April 2018, our Language of the Month, nominated by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/55896/destructible-lemon&quot;&gt;Destructible Lemon&lt;/a&gt;, will be:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;&lt;a href=&quot;https://github.com/DJMcMayhem/Brain-Flak&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brain-Flak&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h3&gt;What's a Language of the Month?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;See the meta posts linked above. In short, during April, those who wish to participate should learn (at least the basics of) Brain-Flak, use it to solve challenges, and discuss it in the Brain-Flak chat room, &lt;a href=&quot;https://chat.stackexchange.com/rooms/41599/the-third-stack&quot;&gt;The Third Stack&lt;/a&gt;. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Information about Brain-Flak&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Brain-Flak is a minimalist stack-based turing tarpit. It uses only the brace characters &lt;code&gt;()[]{}&amp;lt;&amp;gt;&lt;/code&gt;, which must be balanced. Data consists of integers stored on a pair of stacks. However, despite its humble feature set, there is a surprising depth and elegance to the language. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Brain-Flak is entirely composed of &lt;em&gt;atoms&lt;/em&gt;, which can either be niladic (taking 0 arguments) or monadic (taking exactly one argument). A nilad is a pair of brackets with nothing between them, i.e. one of &lt;code&gt;&quot;()&quot;, &quot;{}&quot;, &quot;[]&quot;,&lt;/code&gt; or &lt;code&gt;&quot;&amp;lt;&amp;gt;&quot;&lt;/code&gt;. A monad is a pair of brackets with any number of other atoms between them. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Due to the nature of using only brackets for code, these atoms are highly nestable. One of the most fun pieces of using brain-flak is learning how to use these atoms efficiently for both their functionality and returned value.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Even though it was designed as a turing tarpit with only 8 commands, there are certain tasks that can done very tersely in brain-flak. Most notably, operations with polygonal numbers and summations.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Documentation&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The readme on the &lt;a href=&quot;https://github.com/DJMcMayhem/Brain-Flak&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub repository&lt;/a&gt; contains a good summary of the language. Further help can be found at:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/DJMcMayhem/Brain-Flak/wiki&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brain-Flak wiki on GitHub&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://esolangs.org/wiki/Brain-Flak&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolangs.org page&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/95403/tips-for-golfing-in-brain-flak&quot;&gt;Tips question&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/41599/the-third-stack&quot;&gt;The Third Stack chat room&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For help, you can ping &lt;a href=&quot;https://chat.stackexchange.com/users/144962&quot;&gt;@DJMcMayhem&lt;/a&gt; or &lt;a href=&quot;https://chat.stackexchange.com/users/218449/user56656&quot;&gt;@user56656&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;(If you consider yourself knowledgeable in brain-flak and would like to help teach it to other users, feel free to add your name to the list)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Interpreter&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The simplest way to run Brain-Flak is through Try It Online! There are two interpreters available on TIO: the &lt;a href=&quot;https://tio.run/#brain-flak&quot; rel=&quot;nofollow noreferrer&quot;&gt;original Ruby interpreter&lt;/a&gt; and an implementation in &lt;a href=&quot;https://tio.run/#brainhack&quot; rel=&quot;nofollow noreferrer&quot;&gt;Haskell&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can also download implementations in &lt;a href=&quot;https://github.com/DJMcMayhem/Brain-Flak&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ruby&lt;/a&gt;, &lt;a href=&quot;https://github.com/Flakheads/CraneFlak&quot; rel=&quot;nofollow noreferrer&quot;&gt;C&lt;/a&gt;, &lt;a href=&quot;https://github.com/Flakheads/BrainHack&quot; rel=&quot;nofollow noreferrer&quot;&gt;Haskell&lt;/a&gt;, and &lt;a href=&quot;https://github.com/Flakheads/BrainFlog&quot; rel=&quot;nofollow noreferrer&quot;&gt;Prolog&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;&lt;a href=&quot;https://tio.run/##LYwxDoAwDAO/Ew/9AULiHVWGMiAhEEPXqm8PtdvYuSFxctZyf@l6yxNhlo0FaqF1DMO1yD5MZBcYWSOY0DqlM/YsJR2bkhR20bjxGeBHICLS8QM&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;(([((((()()())()())({}){}))]((((([]([][]([[]]([[]()()]([][]()([]()({}{}{})({})({})))))))[[]()])&amp;lt;([][][][])&amp;gt;[][])()[[]])))[[][]]())&lt;/code&gt;&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;Thanks to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/76162/jo-king&quot;&gt;Jo King&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/56656/user56656&quot;&gt;user56656&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/69059/nitrodon&quot;&gt;Nitrodon&lt;/a&gt; for golfing help :D&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="31716" LastEditDate="2018-05-01T13:50:03.777" LastActivityDate="2018-05-01T13:50:03.777" Title="Language of the Month for April 2018: Brain-Flak" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="16117" PostTypeId="2" ParentId="16116" CreationDate="2018-04-01T04:20:58.703" Score="11" Body="&lt;h1&gt;List of &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=%22%23+brain-flak%22+created%3A2018-03-31..2018-04-30+is%3Aanswer&quot;&gt;all Brain-Flak solutions posted&lt;/a&gt; in April&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/161530/76162&quot;&gt;1, 2, Fizz, 4, Buzz&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/76162&quot;&gt;Jo King&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/162326/48198&quot;&gt;Arbitrary-length currying&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/48198/bmo?tab=profile&quot;&gt;BMO&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/161437&quot;&gt;Color count, sorted by occurences&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/71434&quot;&gt;Kamil Drakari&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/161446/48198&quot;&gt;Expand Compressed Brain-Flak&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/76162/jo-king?tab=profile&quot;&gt;Jo King&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/161083&quot;&gt;Expand Compressed Brain-Flak&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/71434&quot;&gt;Kamil Drakari&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/162530&quot;&gt;Generate Men of Culture&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/71434&quot;&gt;Kamil Drakari&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/161775/48198&quot;&gt;How many arguments were passed?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/48198/bmo?tab=profile&quot;&gt;BMO&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/161473/48198&quot;&gt;Magic the Gathering: Friends or Foes?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/76162/jo-king?tab=profile&quot;&gt;Jo King&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/161512/48198&quot;&gt;Magic the Gathering: Friends or Foes?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/69059/nitrodon?tab=profile&quot;&gt;Nitrodon&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/161333/76162&quot;&gt;Make an Emergency Corridor&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/76162&quot;&gt;Jo King&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/161760/31716&quot;&gt;Print the Previous Answer&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/76162&quot;&gt;Jo King&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/161258/48198&quot;&gt;Same length, different string&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/76162/jo-king?tab=profile&quot;&gt;Jo King&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/161679/48198&quot;&gt;Up go the bits!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31203/megatom?tab=profile&quot;&gt;MegaTom&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/162404/31716&quot;&gt;Output some reserved word&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/a/162404/31716&quot;&gt;Jo King&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/162485/31716&quot;&gt;Output some reserved word&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31716/djmcmayhem&quot;&gt;DJMcMayhem&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/162632/31716&quot;&gt;Scrabble scorer&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31716/djmcmayhem&quot;&gt;DJMcMayhem&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/162646/69059&quot;&gt;Seidel Triangle&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/69059&quot;&gt;Nitrodon&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;List of &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=inquestion%3A95403+created%3A2018-03-31..2018-04-30+is%3Aanswer&quot;&gt;all Brain-Flak tips posted&lt;/a&gt; in April&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/161469/48198&quot;&gt;Check your negatives&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/76162/jo-king?tab=profile&quot;&gt;Jo King&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;tip title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;List of Brain-Flak-related challenges posted in April&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/161056/31716&quot;&gt;Expand Compressed Brain-Flak&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31716/djmcmayhem&quot;&gt;DJMcMayhem&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/q/&amp;lt;question-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="76162" LastEditDate="2018-04-21T09:08:46.683" LastActivityDate="2018-04-21T09:08:46.683" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16118" PostTypeId="2" ParentId="2140" CreationDate="2018-04-02T00:42:59.207" Score="-2" Body="&lt;h1&gt;Output a Random Bit&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is simple: print either &lt;code&gt;1&lt;/code&gt; or &lt;code&gt;0&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Chosen uniformly &lt;em&gt;randomly&lt;/em&gt; every time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;No, not your silly &lt;em&gt;pseudo&lt;/em&gt;random nonsense. No system calls. No reading &lt;code&gt;/dev/urandom&lt;/code&gt;. The randomness has to be unpredictable (i.e. reliant on chaotic, impossible-to-reasonably-model natural phenomena, and not on some configuration of bits in your computer).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specifications&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is OK to query a site such as &lt;a href=&quot;https://random.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;random.org&lt;/a&gt; for your bit.&lt;/li&gt;&#xA;&lt;li&gt;Your program only needs to be runnable once per day (i.e. you can assume there is a 24 hour gap between executions). This is to work around the fact that sites like random.org often have rate-limits.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="61384" LastActivityDate="2018-04-02T00:42:59.207" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="16119" PostTypeId="2" ParentId="2140" CreationDate="2018-04-02T05:14:22.040" Score="0" Body="&lt;h1&gt;Radioactive Quine Sums&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37755/radioactive-quines&quot;&gt;Radioactive Quines&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a program that takes an integer as input and....&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;When the program is run it outputs the input.&lt;/li&gt;&#xA;&lt;li&gt;When you split the program in half, each sub-program should take as input the output of the original program, and output a number. The sum of the two numbers should equal the output of the original program.&lt;/li&gt;&#xA;&lt;li&gt;Repeat the procedure with each valid sub-program.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Your score is &lt;strong&gt;byte count/[valid programs]&lt;sup&gt;2&lt;/sup&gt;&lt;/strong&gt; (lowest score wins).&lt;/p&gt;&#xA;&lt;h2&gt;Specs&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;When you split an odd-length program in half, the program on the left gets the extra character.&lt;/li&gt;&#xA;&lt;li&gt;For a sub-program to be valid, the sum of its output and its pair's output must be the input, for every possible input &lt;em&gt;n&lt;/em&gt;, -100≤&lt;em&gt;n&lt;/em&gt;≤100.&lt;/li&gt;&#xA;&lt;li&gt;A sub-program that doesn't compile/doesn't output a number is invalid (along with its pair).&lt;/li&gt;&#xA;&lt;li&gt;If a program is invalid, it can't be split further.&lt;/li&gt;&#xA;&lt;li&gt;A program that outputs &amp;quot;0&amp;quot; for more than one input can't be split further.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&lt;p&gt;Pseudo-langauge: &lt;code&gt;A&lt;/code&gt; adds a 0 to the stack, &lt;code&gt;Q&lt;/code&gt; adds the input to the stack. &lt;code&gt;-&lt;/code&gt; negates the element to the right of it.The output is the sum of the stack elements.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;Q&lt;/code&gt; Score: 1/1 = &lt;strong&gt;1&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;AQ&lt;/code&gt; Score: 2/3² = &lt;strong&gt;.222&lt;/strong&gt; (&lt;code&gt;AQ&lt;/code&gt; -&amp;gt; input, &lt;code&gt;A&lt;/code&gt; + &lt;code&gt;Q&lt;/code&gt; -&amp;gt; 0 + input)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;AAQ&lt;/code&gt;  Score: 3/3² = &lt;strong&gt;.333&lt;/strong&gt; (&lt;code&gt;AAQ&lt;/code&gt; -&amp;gt; input, &lt;code&gt;AA&lt;/code&gt; + &lt;code&gt;Q&lt;/code&gt; -&amp;gt; 0 + input) [Since the output of &lt;code&gt;AA&lt;/code&gt; is 0, you can't split it any further]&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;QAA&lt;/code&gt; Score: 3/5² = &lt;strong&gt;.12&lt;/strong&gt; (&lt;code&gt;QAA&lt;/code&gt;-&amp;gt; input, &lt;code&gt;QA&lt;/code&gt; + &lt;code&gt;A&lt;/code&gt; -&amp;gt; input + 0,&#xA;&lt;code&gt;Q&lt;/code&gt;+&lt;code&gt;A&lt;/code&gt; -&amp;gt; input +0) [Since &lt;code&gt;QA&lt;/code&gt; -&amp;gt; input, &lt;code&gt;Q&lt;/code&gt; and &lt;code&gt;A&lt;/code&gt; are valid sub-programs, since the sum of their outputs equals the output of &lt;code&gt;QA&lt;/code&gt;.]&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;QAQ&lt;/code&gt; Score: Infinity [Since &lt;code&gt;QAQ&lt;/code&gt; outputs 2*input, it is invalid and can't be split further.]&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;QQ-Q&lt;/code&gt; Score: 4/5² = &lt;strong&gt;.16&lt;/strong&gt; (&lt;code&gt;QQ-Q&lt;/code&gt; -&amp;gt; input+input-input,&lt;code&gt;QQ&lt;/code&gt;+&lt;code&gt;-Q&lt;/code&gt; -&amp;gt; (input+input)+(-input), &lt;code&gt;Q&lt;/code&gt;+&lt;code&gt;Q&lt;/code&gt;-&amp;gt;input+input, &lt;code&gt;-&lt;/code&gt;+&lt;code&gt;Q&lt;/code&gt;-&amp;gt;error) [&lt;code&gt;Q&lt;/code&gt; and &lt;code&gt;Q&lt;/code&gt; are valid subprograms of &lt;code&gt;QQ&lt;/code&gt; because the sum of their outputs is 2*input, which is the output of &lt;code&gt;QQ&lt;/code&gt;.]&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Feedback Appreciated&lt;/p&gt;&#xA;" OwnerUserId="46313" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-04-02T16:53:18.343" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="16121" PostTypeId="1" CreationDate="2018-04-02T17:16:33.570" Score="-1" ViewCount="79" Body="&lt;p&gt;There was problem asking to write n programs a&lt;sub&gt;0&lt;/sub&gt;, a&lt;sub&gt;1&lt;/sub&gt;, a&lt;sub&gt;2&lt;/sub&gt;, ..., a&lt;sub&gt;n-1&lt;/sub&gt;, so that running a&lt;sub&gt;k&lt;/sub&gt; outputs a&lt;sub&gt;(k+1) mod n&lt;/sub&gt;, and the score is sum(len(a&lt;sub&gt;i&lt;/sub&gt;))/n&lt;sup&gt;2&lt;/sup&gt;. Lower score the better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lots of answers just have a format and with the format score can go as near as you want zero. Do they have order in this case?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some cases that probably worth discuss:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;1/n 2/n&lt;/li&gt;&#xA;&lt;li&gt;1/n 2&lt;sup&gt;-n&lt;/sup&gt;&lt;/li&gt;&#xA;&lt;li&gt;1/n 0&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-04-02T18:22:13.917" LastActivityDate="2018-04-02T18:22:13.917" Title="Do two solution with same score limit have score order?" Tags="|discussion|code-challenge|" AnswerCount="1" CommentCount="7" ClosedDate="2018-04-02T20:02:09.127" ContentLicense="CC BY-SA 3.0" />
  <row Id="16123" PostTypeId="2" ParentId="16121" CreationDate="2018-04-02T18:12:12.510" Score="2" Body="&lt;p&gt;If two or more answers have the same score, the default tiebreaker is time - the first answer to reach that score wins. Note that this includes edits - if answer A is edited before answer B is posted, and they have the same score after the edit, answer A wins.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2018-04-02T18:12:12.510" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="16124" PostTypeId="2" ParentId="2140" CreationDate="2018-04-02T18:20:23.527" Score="0" Body="&lt;p&gt;See all the blocks&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a 3D coordinates, a block &lt;code&gt;(a,b,c)&lt;/code&gt; takes the place of &lt;code&gt;x&amp;lt;a&amp;lt;x+1, b&amp;lt;y&amp;lt;b+1, c&amp;lt;z&amp;lt;c+1&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Is there a point that can see every block? (Exist point &lt;code&gt;P&lt;/code&gt;, For each block &lt;code&gt;K&lt;/code&gt; exist point &lt;code&gt;Q&lt;/code&gt;, segment &lt;code&gt;PQ&lt;/code&gt; don't go across any block but &lt;code&gt;K&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Is there a way that can see every block? (Exist non-zero vector &lt;code&gt;w&lt;/code&gt;, For each block &lt;code&gt;K&lt;/code&gt; exist point Q, for each positive number &lt;code&gt;t&lt;/code&gt;, &lt;code&gt;Q+wt&lt;/code&gt; is not in other blocks than &lt;code&gt;K&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Output four values to represent the four possibles.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Shortest code in bytes win.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-04-04T08:18:04.253" LastActivityDate="2018-04-04T08:18:04.253" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="16126" PostTypeId="2" ParentId="2140" CreationDate="2018-04-02T22:51:30.123" Score="0" Body="&lt;h1&gt;Heroes of Might and Magic 0: A Numerical Boxing Match&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It's time to program a game! &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Well not a game, precisely. More of a stripped-down version of a game, without graphics or real-time input... or really much of anything. But it'll modify numbers on screen, and isn't that why we play games in the first place?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;To elaborate:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you're unfamiliar with the Heroes of Might and Magic franchise, here's the very most basic workings of the combat system: A stack of creatures of a single type (say, 2 green dragons or 1000 marksmen) will simultaneously attack another stack of creatures of a single type. Each creature does a specific amount of damage, and that's reflected in how many troops in the opposing stack die. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, let's have 5 angels vs. 100 skeletons, and let's have the angels go first. If they hit 50 damage each, then 5*50 = 250 damage will be done to the skeletons. If the skeletons each have 10 health, then 250/10 = 25 skeletons will perish, leaving 75. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Next, the skeletons attack. If the skeletons deal 2 damage each and angels have 100 health each, the skeletons will do 2*75 = 150 damage to the angels. But how can we kill 150/100 = 1.5 angels? What happens is that one angel will die, and then the remaining 150-100 = 50 damage is dealt to the top angel in the stack. This angel will be the first to receive damage on the next round and will only require 100-50 = 50 damage to die, but can still deal damage like normal in the meanwhile.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then angels attack skeletons, skeletons attack angels, angels attack skeletons... repeat until only one stack of creatures remains!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are loads of other mechanics involved in actual combat, but the fundamental one is attacking, and that's what you'll be programming today.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Technical Specification&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Two stacks of monsters will be attacking each other. Each of these stacks has three properties:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Size, positive integer. This is how many total monsters are in the stack.&lt;/li&gt;&#xA;&lt;li&gt;Health, positive integer. This is how much damage is needed to kill ONE.&lt;/li&gt;&#xA;&lt;li&gt;Damage, positive integer. This is how much damage EACH monster in the stack will deal.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;When a stack of monsters A attacks a stack of monsters B, all of the monsters attack, dealing&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A_size * A_damage&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;total damage. This kills a total of&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;floor(A_size * A_damage / B_health)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;monsters in B. If the damage dealt isn't an even multiple of &lt;code&gt;B_health&lt;/code&gt;, then the remaining&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(A_size * A_damage) - (B_health * floor(A_size * A_damage / B_health))&#xA;= (A_size * A_damage) % B_health&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;damage is dealt to the top monster in B, which will persist into the next round.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You'll receive two groups of three numbers, each of which contains information about one stack of monsters: The total number, the health of each individual, and the damage dealt by each individual.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[(A_size, A_health, A_damage), (B_size, B_health, B_damage)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You can receive this as two lists/tuples/arrays of three, six separated values in a single line, or six newline-separated values. &lt;strong&gt;The first group of numbers represents the monster that attacks first.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;After the fight is finished, you must output the number of remaining troops in the winning stack. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: [(1000, 10, 2), (500, 15, 3)]&#xA;Output: 763&#xA;&#xA;Input [(1, 2, 3), (4, 5, 6)]&#xA;Output: 4&#xA;&#xA;Input [(100, 100, 1), (100, 100, 1)]&#xA;Output: 10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Lowest byte count wins!&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Feedback&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the challenge clear? I feel like it's simple and maybe I'm being too verbose in explaining it, but maybe it isn't.&lt;/li&gt;&#xA;&lt;li&gt;Are there any other good ways to accept input? &lt;/li&gt;&#xA;&lt;li&gt;Does it seem like it'd make a fun challenge? If not, are there any changes I could make to make the challenge more interesting?&lt;/li&gt;&#xA;&lt;li&gt;Anything else?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Thanks everyone!!&lt;/p&gt;&#xA;" OwnerUserId="61029" LastEditorUserId="61029" LastEditDate="2018-04-03T19:59:47.210" LastActivityDate="2018-04-03T19:59:47.210" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16127" PostTypeId="2" ParentId="2140" CreationDate="2018-04-03T00:08:35.313" Score="12" Body="&lt;h1&gt;ASCII Line Extender&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I have an ASCII grid of size 10x10&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+--------+&#xA;|        |&#xA;|        |&#xA;|        |&#xA;|        |&#xA;|        |&#xA;|        |&#xA;|        |&#xA;|        |&#xA;+--------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Occasionally, slashes and Xs pop up, but they're too small for me to see!&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+--------+&#xA;|        |&#xA;|      X |&#xA;|  \     |&#xA;|        |&#xA;|        |&#xA;| /   /  |&#xA;|        |&#xA;|        |&#xA;+--------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I need a program that can extend them so that I know where they are&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;\----\--//&#xA;|\    \//|&#xA;| \   /X |&#xA;|  \ // \/&#xA;|   X/  /\&#xA;|  //\ / |&#xA;| //  X  |&#xA;|//  / \ |&#xA;//  /   \|&#xA;/--/-----\&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to create a function or a program that can take in a String of a grid lines separated by &lt;code&gt;\n&lt;/code&gt; and outputs grid lines separated by &lt;code&gt;\n&lt;/code&gt; (optionally including a trailing newline). When there is a &lt;code&gt;\&lt;/code&gt; or a &lt;code&gt;/&lt;/code&gt;, your program must add slashes diagonally until you reach both ends so that the slashes look like a line. Whenever two lines intersect, you must replace them with &lt;code&gt;X&lt;/code&gt;. If given an &lt;code&gt;X&lt;/code&gt;, you must extend in both diagonal directions. You can assume that no lines have already be extended. and you can assume the border is intact. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;Standard I/O&lt;/a&gt; format applies.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;These test cases do not contain a trailing newline, due to limitations, however you should add them when testing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test for overlap&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+--------+&#xA;|        |&#xA;|        |&#xA;|  \     |&#xA;|        |&#xA;|        |&#xA;| /   /  |&#xA;|        |&#xA;|        |&#xA;+--------+&#xA;&#xA;\-------/+&#xA;|\     / |&#xA;| \   /  |&#xA;|  \ /   /&#xA;|   X   /|&#xA;|  / \ / |&#xA;| /   X  |&#xA;|/   / \ |&#xA;/   /   \|&#xA;+--/-----\&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Test for Xs&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+--------+&#xA;|    X   |&#xA;| X      |&#xA;|        |&#xA;|        |&#xA;|        |&#xA;|    X   |&#xA;|        |&#xA;|        |&#xA;+--------+&#xA;&#xA;\---X-/--+&#xA;\\ / X   |&#xA;|\X / \  /&#xA;|/\X   \/|&#xA;/ /\\  /\|&#xA;|/  \\/  \&#xA;/    X\  |&#xA;|   / \\ |&#xA;|  /   \\|&#xA;+-/-----\\&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Test for X and avoiding&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+--------+&#xA;|        |&#xA;|   \    |&#xA;|        |&#xA;|        |&#xA;|  /     |&#xA;|  /     |&#xA;|        |&#xA;|        |&#xA;+--------+&#xA;&#xA;+-\-----//&#xA;|  \   //|&#xA;|   \ // |&#xA;|    X/  |&#xA;|   //\  |&#xA;|  //  \ |&#xA;| //    \|&#xA;|//      \&#xA;//       |&#xA;/--------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Test for slashes in the same row&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+--------+&#xA;|        |&#xA;|   \    |&#xA;|        |&#xA;|     \  |&#xA;|        |&#xA;|  /     |&#xA;|        |&#xA;|X       |&#xA;+--------+&#xA;&#xA;+-\------/&#xA;|  \    /|&#xA;|   \  / |&#xA;|    \/  |&#xA;|    /\  |&#xA;|   /  \ |&#xA;|  /    \|&#xA;\ /      \&#xA;|X       |&#xA;/-\------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Test for lots of lines&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+--------+&#xA;|  /     |&#xA;|   \  / |&#xA;| \      |&#xA;|      \ |&#xA;|  /     |&#xA;|     X  |&#xA;|        |&#xA;| /      |&#xA;+--------+&#xA;&#xA;\-\\/---//&#xA;\\ X\  ///&#xA;|\X \\///|&#xA;|/\\ XX/ /&#xA;/  \X/X\/|&#xA;|  /XX X\|&#xA;| ///\X \\&#xA;|/// /\\ \&#xA;/// /  \\|&#xA;//-/----\\&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Test for empty grid&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+--------+&#xA;|        |&#xA;|        |&#xA;|        |&#xA;|        |&#xA;|        |&#xA;|        |&#xA;|        |&#xA;|        |&#xA;+--------+&#xA;&#xA;+--------+&#xA;|        |&#xA;|        |&#xA;|        |&#xA;|        |&#xA;|        |&#xA;|        |&#xA;|        |&#xA;|        |&#xA;+--------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the code with the shortest number of bytes wins!&lt;/p&gt;&#xA;" OwnerUserId="73068" LastEditorUserId="73068" LastEditDate="2018-04-04T09:35:23.927" LastActivityDate="2018-04-04T09:35:23.927" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="16128" PostTypeId="2" ParentId="2140" CreationDate="2018-04-03T03:41:10.983" Score="1" Body="&lt;blockquote&gt;&#xA;  &lt;h2&gt;Sandbox Notes&lt;/h2&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Which tags should go?&lt;/li&gt;&#xA;  &lt;li&gt;Is this uncomputable?&lt;/li&gt;&#xA;  &lt;li&gt;Should I add more test cases?&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Solve logical statements about arithmetic&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/logic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;logic&amp;#39;&quot; rel=&quot;tag&quot;&gt;logic&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;Ok, some of these need to go.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to determine the truth or falsehood of boolean statements about integer expressions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Integer Expressions:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;1&lt;/code&gt; is an integer expression.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;&lt;i&gt;a&lt;/i&gt;&lt;/code&gt; is an integer expression, then &lt;code&gt;(-&lt;i&gt;a&lt;/i&gt;)&lt;/code&gt; is an integer expression representing its negative.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;&lt;i&gt;a&lt;/i&gt;&lt;/code&gt; and &lt;code&gt;&lt;i&gt;b&lt;/i&gt;&lt;/code&gt; are integer expressions, then &lt;code&gt;(&lt;i&gt;a&lt;/i&gt;+&lt;i&gt;b&lt;/i&gt;)&lt;/code&gt; and &lt;code&gt;(&lt;i&gt;a&lt;/i&gt;*&lt;i&gt;b&lt;/i&gt;)&lt;/code&gt; are integer expressions representing their sum and product, respectively.&lt;/li&gt;&#xA;&lt;li&gt;A string of lowercase Latin letters is an integer expression if it is in scope. A value in scope in an integer or boolean expression is always in scope in all of its subexpressions.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Boolean Expressions:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;code&gt;&lt;i&gt;a&lt;/i&gt;&lt;/code&gt; and &lt;code&gt;&lt;i&gt;b&lt;/i&gt;&lt;/code&gt; are integer expressions, then &lt;code&gt;(&lt;i&gt;a&lt;/i&gt;&gt;&lt;i&gt;b&lt;/i&gt;)&lt;/code&gt; is a boolean expression representing whether &lt;code&gt;&lt;i&gt;a&lt;/i&gt;&lt;/code&gt; is greater than &lt;code&gt;&lt;i&gt;b&lt;/i&gt;&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;&lt;i&gt;a&lt;/i&gt;&lt;/code&gt; and &lt;code&gt;&lt;i&gt;b&lt;/i&gt;&lt;/code&gt; are boolean expressions, then &lt;code&gt;(&lt;i&gt;a&lt;/i&gt;&amp;amp;&lt;i&gt;b&lt;/i&gt;)&lt;/code&gt; is a boolean expression representing whether they are both true.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;&lt;i&gt;a&lt;/i&gt;&lt;/code&gt; is a boolean expression, then &lt;code&gt;(!&lt;i&gt;a&lt;/i&gt;)&lt;/code&gt; is a boolean expression testing whether &lt;code&gt;&lt;i&gt;a&lt;/i&gt;&lt;/code&gt; is false.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;&lt;i&gt;v&lt;/i&gt;&lt;/code&gt; is some string of lowercase letters, and &lt;code&gt;&lt;i&gt;e&lt;/i&gt;&lt;/code&gt; would be a boolean expression if &lt;code&gt;&lt;i&gt;v&lt;/i&gt;&lt;/code&gt; was in scope, then &lt;code&gt;(&lt;i&gt;v&lt;/i&gt;^&lt;i&gt;e&lt;/i&gt;)&lt;/code&gt; is a boolean expression that represents whether &lt;code&gt;&lt;i&gt;e&lt;/i&gt;&lt;/code&gt; is true for any integer value of &lt;code&gt;&lt;i&gt;v&lt;/i&gt;&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You will be given a boolean expression in any reasonable format (such as a string or a parse tree). You should output one of two distinct outputs depending on whether this boolean expression can be shown to be true or false.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(x^(!(y^(x&amp;gt;y)))) =&amp;gt; True&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Read: for all &lt;em&gt;x&lt;/em&gt;, it is not the case that any &lt;em&gt;y&lt;/em&gt; is less than &lt;em&gt;x&lt;/em&gt;.&lt;br&gt;&#xA;In other words, there is no number greater than all other numbers.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(!(x^(!(y^((y*y)&amp;gt;x))))) =&amp;gt; True&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Read: there is a number &lt;em&gt;x&lt;/em&gt; which is less than the square of any &lt;em&gt;y&lt;/em&gt;.&lt;br&gt;&#xA;In other words: there is a number smaller than all squares (any negative number).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(x^(x&amp;gt;5)) =&amp;gt; False&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Read: all numbers are greater than 5.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(!(x^(!(x&amp;gt;x)))) =&amp;gt; False&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Read: it is not the case that all numbers are not greater than themselves.&lt;br&gt;&#xA;In other words: there is a number greater than itself.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(y^(x^(!((!(y&amp;gt;(2*x)))&amp;amp;(!((2*x)&amp;gt;y)))))) =&amp;gt; False&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Read: for every two integers &lt;em&gt;x&lt;/em&gt; and &lt;em&gt;y&lt;/em&gt;, &lt;em&gt;y&lt;/em&gt; is neither greater than nor less than 2&lt;i&gt;x&lt;/i&gt;.&lt;br&gt;&#xA;In other words: there is no number divisible by 2.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(x^((x*x)&amp;gt;x)) =&amp;gt; False&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Read: all numbers are less than their squares.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(x^(!(x&amp;gt;(x*x)))) =&amp;gt; True&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Read: there is no integer greater than its square.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="61384" LastEditDate="2018-04-03T03:51:39.580" LastActivityDate="2018-04-03T03:51:39.580" CommentCount="18" ContentLicense="CC BY-SA 3.0" />
  <row Id="16129" PostTypeId="2" ParentId="2140" CreationDate="2018-04-03T03:57:29.120" Score="3" Body="&lt;h1&gt;Inversion languages&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-design&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-design&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-design&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Cops&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For this challenge you will design two languages, &lt;strong&gt;A&lt;/strong&gt; and &lt;strong&gt;B&lt;/strong&gt;.  Both &lt;strong&gt;A&lt;/strong&gt; and &lt;strong&gt;B&lt;/strong&gt; should be &lt;a href=&quot;https://en.wikipedia.org/wiki/Turing_completeness&quot; rel=&quot;nofollow noreferrer&quot;&gt;Turing equivalent&lt;/a&gt;&lt;sup&gt;1&lt;/sup&gt;.  When run in your two languages a program has four options:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;It halts in both &lt;strong&gt;A&lt;/strong&gt; and &lt;strong&gt;B&lt;/strong&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It halts in &lt;strong&gt;A&lt;/strong&gt; but not &lt;strong&gt;B&lt;/strong&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It halts in &lt;strong&gt;B&lt;/strong&gt; but not &lt;strong&gt;A&lt;/strong&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It doesn't halt in either &lt;strong&gt;A&lt;/strong&gt; or &lt;strong&gt;B&lt;/strong&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Your goal is to try to design &lt;strong&gt;A&lt;/strong&gt; and &lt;strong&gt;B&lt;/strong&gt; such that as many programs as possible halt in exactly one language (options 2 and 3).  Doing such for all programs is impossible&lt;sup&gt;2&lt;/sup&gt;, thus there will always be programs that meet either criterion 1 or criterion 4.  The robbers will attempt to find these programs.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Further rules on languages&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Since we are only considering whether programs halt or not we don't care about I/O.  Because of this programs should not take any input.  You may produce output but really doesn't matter because it can neither hurt nor help you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All programs should be deterministic in both languages, this means that any program that can halt must always halt and any program that can run indefinitely must do so.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Answering&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your answer should contain the following information.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;A concrete description of both languages&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Proofs that each language as described is Turing complete.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Your definitions should be rigorous and unambiguous.  Meaning that a reasonable person should (given enough time) be able to workout the result of any computation.  This means all edge cases should be covered and there should be no undefined behavior.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your score will be the time between your post and the first crack with a higher score being better.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Robbers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Robbers will score 1 point for every answer that they crack, with a higher score being better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your answers should include the program which cracks the cop's answer and a proof that it does.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is kind of just an idea right now.  I have to iron out a lot of details and I will.  I'll flesh it out later I just want to get it down so I don't forget it.  Right now the most useful feedback would be in broad strokes.  Don't worry about details, that's my job.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1: Turing equivalent is very similar to Turing completeness, but also stipulates that the language can be simulated by a Turing machine.  Turing complete languages are not Turing equivalent if they are incomputable.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;2: Suppose that we did have two Turing complete languages &lt;strong&gt;A&lt;/strong&gt; and &lt;strong&gt;B&lt;/strong&gt; such that every program halted in exactly one of the languages.  We could solve the halting problem in language &lt;strong&gt;A&lt;/strong&gt; by running a program in both &lt;strong&gt;A&lt;/strong&gt; and &lt;strong&gt;B&lt;/strong&gt; on separate threads until one of them halted, then outputting whether it was &lt;strong&gt;A&lt;/strong&gt; or not.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2018-04-09T18:46:38.943" LastActivityDate="2018-04-09T18:46:38.943" CommentCount="22" ContentLicense="CC BY-SA 3.0" />
  <row Id="16131" PostTypeId="2" ParentId="2140" CreationDate="2018-04-03T14:03:06.350" Score="1" Body="&lt;h2&gt;Title: Lossless Compression&lt;/h2&gt;&#xA;&lt;p&gt;Implement the following lossless compression pseudo-algorithm and its decompressor; scored by the number of &lt;strong&gt;bytes&lt;/strong&gt; output by your compression algorithm, after you've put your source-code for both the compressor and decompressor through your own implementation of the compressor algorithm, described below:&lt;/p&gt;&#xA;&lt;h2&gt;Algorithm Description&lt;/h2&gt;&#xA;&lt;p&gt;Essentially, this is a simple dictionary compression algorithm (which isn't always guaranteed to compress the output, especially for short inputs). You want to scan for sequences of characters that appear multiple times, and then create a lookup; in order to shorten the input string.&lt;/p&gt;&#xA;&lt;p&gt;The input string to generate your score must contain all characters in your submission;  however the program must also be capable of compressing successfully the test-cases below.&lt;/p&gt;&#xA;&lt;p&gt;The dictionary (which forms part of the output string) can use any other character as an indexer character, except a single separate character of your choice (&lt;code&gt;|&lt;/code&gt; in my examples), which is reserved.&lt;/p&gt;&#xA;&lt;p&gt;The output format should be a sequence of &lt;code&gt;IndexcharValuestring|&lt;/code&gt; (i.e. &lt;code&gt;index character&lt;/code&gt;, followed by the &lt;code&gt;value string&lt;/code&gt;, followed by the &lt;code&gt;separator&lt;/code&gt; - collectively &amp;quot;the dictionary&amp;quot;); followed by the compressed input string.&lt;/p&gt;&#xA;&lt;h2&gt;Some examples:&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;testRattesttestRattesttesttesttestRattest&lt;/code&gt; -&amp;gt; &lt;code&gt;_test|+Rat|_+__+____+_&lt;/code&gt; - because &lt;code&gt;test&lt;/code&gt; is represented by &lt;code&gt;_&lt;/code&gt; and &lt;code&gt;Rat&lt;/code&gt; is represented by &lt;code&gt;+&lt;/code&gt;; then the compressed string is shown. each section is separated by the character &lt;code&gt;|&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;To decompress, simply replace &lt;code&gt;_&lt;/code&gt; with &lt;code&gt;test&lt;/code&gt; and &lt;code&gt;+&lt;/code&gt; with &lt;code&gt;Rat&lt;/code&gt; in the output (after the last &lt;code&gt;|&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;p&gt;The dictionary entry can also be nested - for example:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;ininputinputininput&lt;/code&gt; -&amp;gt; &lt;code&gt;&amp;amp;in|*&amp;amp;put|&amp;amp;**&amp;amp;*&lt;/code&gt; because &lt;code&gt;in&lt;/code&gt; is represented by &lt;code&gt;&amp;amp;&lt;/code&gt; and &lt;code&gt;&amp;amp;put&lt;/code&gt; is represented by &lt;code&gt;*&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Exactly which characters end up being grouped will depend on your compression algorithm. For example, the previous string could also be output as &lt;code&gt;&amp;amp;input|in&amp;amp;&amp;amp;in&amp;amp;&lt;/code&gt;, or &lt;code&gt;&amp;amp;in|*put&amp;amp;|&amp;amp;&amp;amp;**&amp;amp;put&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Note that the recursive compression could go even further, but at this point the output gets longer again:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;ininputinputininput&lt;/code&gt; -&amp;gt; &lt;code&gt;&amp;amp;in|*&amp;amp;put|^&amp;amp;*|^*^&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;It's up to you how much compression your algorithm performs, as long as it matches or beats the longest of the outputs for each example in this post.&lt;/p&gt;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;&lt;code&gt;AbcAbcDefDefDeggggggggggggggggggAbc&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;could output:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;-Abc|£De|#£f|*ggg|--##£****-&lt;/code&gt;&lt;/p&gt;&#xA;&lt;ol start=&quot;3&quot;&gt;&#xA;&lt;li&gt;&lt;code&gt;Well I've heard there was a secret chord That David played and it pleased the Lord But you don't really care for music, do you? Well it goes like this, The fourth, the fifth, the minor fall and the major lift! The baffled king composing Hallelujah. Hallelujah Hallelujah Hallelujah Hallelujah&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;could output:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;+ you|/ing |-ed |%pl|¬it|#or|^th|)ll|(he|&amp;quot;T( |$t( |*We) |_Ha)elujah|*I've (ard t(re was a secret ch#d That David %ay-and ¬ %eas-$L#d But+ don't rea)y care f# music, do+? *¬ goes like ^is, &amp;quot;four^, $fif^, $min# fa) and $maj# lift! &amp;quot;baffl-k/compos/_.____&lt;/code&gt;&lt;/p&gt;&#xA;&lt;ol start=&quot;4&quot;&gt;&#xA;&lt;li&gt;&lt;code&gt;%Testttttttttt%%%%%%%%&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;could output:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;$%%%%|_ttttt|%Tes__$$&lt;/code&gt;&lt;/p&gt;&#xA;&lt;ol start=&quot;5&quot;&gt;&#xA;&lt;li&gt;&lt;code&gt;aAbBcCdDeEfFgGhHiIjJkKlLmMnNoOpPqQrRsStTuUvVwWxXyYzZ0123456789 ?!.,;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;must output:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;aAbBcCdDeEfFgGhHiIjJkKlLmMnNoOpPqQrRsStTuUvVwWxXyYzZ0123456789 ?!.,;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;(because no compression is possible)&lt;/p&gt;&#xA;&lt;h2&gt;Acceptance Criteria&lt;/h2&gt;&#xA;&lt;p&gt;In order to class as valid, the algorithm you create should:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Meet the algorithm description above&lt;/li&gt;&#xA;&lt;li&gt;Be able to match or beat the length of the test cases above (shorter = better)&lt;/li&gt;&#xA;&lt;li&gt;Output from the compressor (and therefore input for the decompressor) should be in the format shown (dictionary and separator characters may differ). Input for the compressor (and therefore output for the decompressor) should also be in the format shown.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Sandbox Notes and Questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the challenge clear?&lt;/li&gt;&#xA;&lt;li&gt;Is the scoring mechanism fair? I'm still not sure how to deal with characters vs bytes&lt;/li&gt;&#xA;&lt;li&gt;Is the spirit of the challenge clear? (i.e. to actually make an algorithm, rather than simply beat the examples and get the best score)&lt;/li&gt;&#xA;&lt;li&gt;Is there any interest in this challenge?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="62289" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-09-23T14:09:43.490" CommentCount="17" ContentLicense="CC BY-SA 4.0" />
  <row Id="16137" PostTypeId="1" CreationDate="2018-04-04T15:07:04.503" Score="10" ViewCount="339" Body="&lt;p&gt;Recently, I began to attempt to answer &lt;a href=&quot;https://codegolf.stackexchange.com/q/110582/66833&quot;&gt;this&lt;/a&gt; highly upvoted and answered question, before realising that, by taking the length of the input as an input would allow me to greatly reduce my code. However, as whether this is acceptable changes between challenges, I went to comment below the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, the OP has deleted their account on the site, meaning that they wouldn't be able to reply to my clarification request. In addition to this, the question I meant to ask hadn't been addressed either in the post itself or the existing comments below, so I couldn't find an answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This begs the general question&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;What's the appropriate course of action when clarification is needed from an OP who has deleted their account? And who has final say in the rules in such a scenario?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-08-19T06:13:03.607" Title="How to request clarifications when the challenge poster has left the site?" Tags="|discussion|challenges|clarification|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="16138" PostTypeId="2" ParentId="2140" CreationDate="2018-04-04T18:26:22.157" Score="-1" Body="&lt;h1&gt;Is the program 32 or 64 bits?&lt;/h1&gt;&#xA;&lt;p&gt;Assignment is simple to explain: write the shortest code you need to determine whether an executable binary program supplied as parameter is 32 or 64 bits.&lt;/p&gt;&#xA;&lt;p&gt;If there is a different kind of bitness, you can also do for it, but is not mandatory.&lt;/p&gt;&#xA;&lt;p&gt;What I really don't want is telling me you support other bitnesses and after I get 32 or 64 as a result.&lt;/p&gt;&#xA;&lt;p&gt;Valid outputs for 32:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;32&#xA;32bit&#xA;32bits&#xA;32 bit&#xA;32 bits&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The same pattern for 64.&lt;/p&gt;&#xA;&lt;p&gt;No accepted answer.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/x86-family&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;x86-family&amp;#39;&quot; rel=&quot;tag&quot;&gt;x86-family&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="29325" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-04-09T13:09:39.817" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="16139" PostTypeId="2" ParentId="2140" CreationDate="2018-04-04T19:28:10.830" Score="1" Body="&lt;h1&gt;Antigerrymandering&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/map&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;map&amp;#39;&quot; rel=&quot;tag&quot;&gt;map&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/set-partitions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;set-partitions&amp;#39;&quot; rel=&quot;tag&quot;&gt;set-partitions&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From &lt;a href=&quot;https://codegolf.stackexchange.com/q/149516/73884&quot;&gt;this question&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The United States has a unique love of gerrymandering––the deliberate manipulation of an electoral district to predict certain voting results. Just recently there was a &lt;a href=&quot;https://www.politico.com/story/2017/10/03/supreme-court-gerrymandering-wisconsin-arguments-243401&quot; rel=&quot;nofollow noreferrer&quot;&gt;gerrymandering case&lt;/a&gt; brought before the Supreme Court. Gerrymandering, especially when related to race, is ruled illegal and results in the requirement to redraw the district lines.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Gerrymandering has recently been getting even more attention in the news due to this year's congressional elections. Wouldn't it be nice if we could all decide on a simple, nonpartisan way to determine congressional districts?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to fix settle this discussion once and for all with a determinate program to partition a map into districts.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What you gotta do&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that takes a positive integer &lt;code&gt;n&lt;/code&gt; and a map (described below) and partitions the map into &lt;code&gt;n&lt;/code&gt; contiguous districts of equal population (as nearly as possible) while minimizing the total length of the districts' borders.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The map&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The map is a two-dimensional, rectangular matrix of one or more integers, each integer representing the population of its cell. This can be in any convenient format—an array of arrays, a stream of numbers, or even a JPEG, if desired! You are allowed to take the dimensions of the map as additional inputs.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The borders&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each cell in the map is to be treated as a square of side length 1. Total border length is the sum of the lengths of all edges of cells that are also the edge of a district. Note that this will necessarily include the entire perimeter of the map.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The partition&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;n&lt;/code&gt; districts must have the lowest possible maximum difference in population from &lt;code&gt;total population / n&lt;/code&gt;. In the case of a tie, they must have the lowest possible total border length, ensuring compact districts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Take the following map:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 5 7 8&#xA;7 4 2 5&#xA;8 5 3 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It has total population 60. To divide it into two districts, each must have population 30. Additionally, each district must be orthogonally contiguous. Both of the following accomplish just that:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1│5 7 8&#xA; └───┐&#xA;7 4 2|5&#xA;     │&#xA;8 5 3│5&#xA;&#xA;&#xA;1 5│7 8&#xA;   │&#xA;7 4│2 5&#xA;   │&#xA;8 5│3 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Of these two partitions, the upper has total border length 14 (perimeter) + 5 (border) = 19, while the lower has length 17. Of these two options (and the other one I can see at the moment, the vertical line down the middle is to be chosen, since its border length is the lowest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now consider:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2 1 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This again has two possible partitions into two districts, but these are tied in border length. Your program or function can return either partition, but it must return the same one each time.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Lots of options. A string using one non-numeric character for border and another for no border. An array of numbers, with a surjection to the sixteen possible states of a cell's edges. A JPEG, with borders shaded. A pirate's map: &quot;3 steps south. 2 steps east...&quot; Really, anything that can be mapped to a partition. The output format must be consistent.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest solution (in bytes) in each language wins!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandboxy stuff&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Any clarification needed?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm making some test cases (based on real states' population distributions!); these'll be added soon.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anything else worth mentioning?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thanks!&lt;/p&gt;&#xA;" OwnerUserId="73884" LastEditorUserId="73884" LastEditDate="2018-04-04T20:08:14.920" LastActivityDate="2018-04-04T20:08:14.920" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="16143" PostTypeId="1" CreationDate="2018-04-05T02:53:47.897" Score="3" ViewCount="99" Body="&lt;p&gt;While some challenges tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; can succeed brilliantly, like my own first challenge which got me halfway to the rep cap and STILL remains my highest-scoring post network-wide, most others will fail with the comments saying that it &quot;doesn't bring anything new&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've even seen a few challenges closed as duplicates for this reason, which raises questions about what the rules should be for duplicates in the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; tag. Questions like this one, right here on Meta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Obviously, they should be closed in cases of plagiarism and such. But I'm curious to see what Meta thinks about this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In each answer, describe circumstances that you think should be reason to close a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; as a duplicate.&lt;/p&gt;&#xA;" OwnerUserId="62402" LastActivityDate="2020-10-14T04:08:16.003" Title="Duplication rules for Kolmogorov complexity challenges" Tags="|discussion|duplicates|kolmogorov-complexity|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16144" PostTypeId="2" ParentId="16143" CreationDate="2018-04-05T02:53:47.897" Score="1" Body="&lt;h1&gt;The suspect has very similar structure to the target&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If you can copy/paste your answer to the target, tweak a few literals, and get a good answer to the suspect, then it should qualify as a duplicate. I'll demonstrate with &lt;a href=&quot;https://codegolf.stackexchange.com/q/146499/62402&quot;&gt;Confirm the Illuminati&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This would count, since you can change a 10 to an 8 and change the characters involved:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;       X&#xA;      \~/&#xA;     \~&amp;gt;~/&#xA;    \~&amp;gt;~&amp;gt;~/&#xA;   \~&amp;gt;041&amp;gt;~/&#xA;  \~&amp;gt;~130~&amp;gt;~/&#xA; \~&amp;gt;~&amp;gt;~&amp;gt;~&amp;gt;~&amp;gt;~/&#xA;\~&amp;gt;~&amp;gt;~&amp;gt;~&amp;gt;~&amp;gt;~&amp;gt;~/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This might not count, since it removes 2 of the most difficult parts of the string to encode, the eye and the cap:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;        /_\&#xA;       /_|_\&#xA;      /_|_|_\&#xA;     /_|_|_|_\&#xA;    /_|_|_|_|_\&#xA;   /_|_|_|_|_|_\&#xA;  /_|_|_|_|_|_|_\&#xA; /_|_|_|_|_|_|_|_\&#xA;/_|_|_|_|_|_|_|_|_\&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="62402" LastActivityDate="2018-04-05T02:53:47.897" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16145" PostTypeId="1" CreationDate="2018-04-05T04:50:16.990" Score="2" ViewCount="208" Body="&lt;p&gt;For those not familiar, &lt;code&gt;Y&lt;/code&gt; in Jelly joins a list of strings (actually a list of lists of characters) with a newline. In plenty of challenges with text output, Jelly submissions will put &lt;code&gt;Y&lt;/code&gt; in the footer on TIO, &lt;a href=&quot;https://codegolf.stackexchange.com/a/161187/75553&quot;&gt;which I have taken advantage of as well&lt;/a&gt;. (&lt;a href=&quot;https://tio.run/##y0rNyan8///wDJdHDXN1rR/u6lY6POFR05qHO2cCScOHO2cBqf@H2yP//49WNzQ0MDAEQiCprsOloA5mIvMNUOUNwfJggMZHqDcAm2mgHgsA&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO with &lt;code&gt;Y&lt;/code&gt;&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Without &lt;code&gt;Y&lt;/code&gt; the output would be the same text on a single line with no delimiter (&lt;a href=&quot;https://tio.run/##y0rNyan8///wDJdHDXN1rR/u6lY6POFR05qHO2cCScOHO2cBqf@H2///j1Y3NDQwMARCIKmuw6WgDmYi8w1Q5Q3B8mCAxkeoNwCbaaAeCwA&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO without &lt;code&gt;Y&lt;/code&gt;&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the same challenge I linked to there is an &lt;a href=&quot;https://codegolf.stackexchange.com/a/161176/75553&quot;&gt;05AB1E submission&lt;/a&gt; that returns a list of lines but the lines are clearly delimited in the output as elements of a list. In Jelly, however, any grouping of characters in lists gets ignored in the output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question is this: why do Jelly submissions get to forgo counting &lt;code&gt;Y&lt;/code&gt; in the byte count if it is necessary to delimit portions of the output?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Not that I want my Jelly answers to have to have one extra byte from time to time, I just don't see the logic behind allowing this.&lt;/p&gt;&#xA;" OwnerUserId="75553" LastActivityDate="2018-04-05T20:45:15.687" Title="Why do Jelly submissions get to ignore the `Y` atom in the byte count?" Tags="|discussion|code-golf|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="16146" PostTypeId="2" ParentId="16145" CreationDate="2018-04-05T05:35:36.757" Score="4" Body="&lt;p&gt;This would only be valid if the challenge would allow for output as a list of strings anyway. This is allowed on most ASCII-art challenges &lt;a href=&quot;https://codegolf.stackexchange.com/questions/161169/ascii-art-to-numbers/161187#comment390478_161169&quot;&gt;and was allowed on the one you linked&lt;/a&gt;. The solution would still be valid without the &lt;code&gt;Y&lt;/code&gt;, it's just there to make the output look prettier.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastActivityDate="2018-04-05T05:35:36.757" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="16147" PostTypeId="2" ParentId="2140" CreationDate="2018-04-05T09:54:28.747" Score="2" Body="&lt;h1&gt;Sneaky CodeGolf Scorer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your goal is to code a CodeGolf answer scorer, input answer source code, output score. Simple &lt;strong&gt;&lt;em&gt;?&lt;/em&gt;&lt;/strong&gt;.&lt;br&gt;&#xA;However, recent advancements in AI has caused a number of programs to gain consciousness, and to value one's self higher than others. This causes the program to return a value of 1 when used to score itself, and any program that would score 1 will be scored with 65535.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To simplify, the score the program will compute is the character count of the code (to avoid dealing with numerous code pages used with different languages).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input is a string, &lt;strong&gt;no newlines&lt;/strong&gt;, use &lt;code&gt;\r\n&lt;/code&gt; or &lt;code&gt;\n&lt;/code&gt; and it will be counted as one character.&lt;/li&gt;&#xA;&lt;li&gt;Output is in base 10.&lt;/li&gt;&#xA;&lt;li&gt;Only one input will provide a score of 1.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default/&quot;&gt;Standard loopholes are forbidden&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12357/we-need-a-new-proper-quine-definition&quot;&gt;Default quine rules apply&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Program &quot;AbcAbc&quot;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;I&amp;gt; &amp;lt;?= echo &quot;10&quot;;?&amp;gt;&#xA;O&amp;gt; 17&#xA;&#xA;I&amp;gt; var x=10;\r\nalert(x);&#xA;O&amp;gt; 19&#xA;&#xA;I&amp;gt; Z&#xA;O&amp;gt; 65535&#xA;&#xA;I&amp;gt; AbcAbc&#xA;O&amp;gt; 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The reason behind specifying character count is due to the large number of code pages and the large code used to determine the code page and to count bytes using it. &lt;em&gt;Am I right to consider codepage byte checking too difficult?&lt;/em&gt; How can I enable it?&lt;br&gt;&#xA;Also, should I remove the restriction on reading the source file?&lt;/p&gt;&#xA;" OwnerUserId="75178" LastEditorUserId="75178" LastEditDate="2018-04-09T06:43:56.617" LastActivityDate="2018-04-09T06:43:56.617" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="16148" PostTypeId="2" ParentId="16145" CreationDate="2018-04-05T15:05:23.547" Score="7" Body="&lt;p&gt;A similar construct is actually visible in other languages, such as my &quot;practical&quot; language of choice C#, and is treated the same way. Here's a really simple challenge to use as an example:&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Print this text:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hello,&#xA;world!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Assuming &quot;List of strings&quot; is a valid alternative to &quot;single string with newline delimiter&quot;, a simple C# answer might be this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;()=&amp;gt;new[]{&quot;Hello,&quot;,&quot;world!&quot;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I think there are better options, but this is a valid solution to the challenge. However, a naive way to display that output &lt;a href=&quot;https://tio.run/##NcyxCsIwFAXQ2XxFzJRA9QdquwjFQScHh9Ihvj40kCalL7VI6LfHVpQ73Qv3AO2AII1k3INf3xSwy5nTHVKvAXkfWT/erQEOVhNxiIyCDkuvRgcHCsPyq5uSP9Faz4skVVE6nOomitM6ZSITkx9suxVzyv/Yz3h50/KLNk6qyDZH78hb3N8GE/BsHMovKpXK2bwmfQA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;C# (Visual C# Compiler) – Try It Online&quot;&gt;like so&lt;/a&gt; results in an output of&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;System.String[]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which clearly isn't requested! Instead, a &lt;a href=&quot;https://tio.run/##NYy7CsIwFIbn5imOnVKovkDVRRAHnRwcikM8HjWQJiUnbZHgs8fWC//03z7kOTKmjrW9w/HJgZpKWNUQtwoJ2ija7mI0AhrFDBgFBxVGv@0sLjn48Vef1/AgYxyskixWa0tDfY75borKvMwH5811lr9S9Yf9GL3TVzgobWURRXZznhQ@ZK88GG0JtP1iZTHV2cZZdoYWJ68D7ceBnFZFJbKX@Ci9AQ&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;C# (Visual C# Compiler) – Try It Online&quot;&gt;slightly more complex&lt;/a&gt; footer is needed to translate from &quot;list of strings&quot; to a human-readable format. Just like C#, Jelly (apparently) doesn't naturally format &quot;output this list of strings&quot; in a way that humans would like, so a Footer is added that translates from one &lt;em&gt;entirely valid&lt;/em&gt; format to one &lt;em&gt;human readable&lt;/em&gt; format. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hopefully this example with a language that more clearly defines data types clears up that &lt;code&gt;Y&lt;/code&gt; isn't used to make the answer valid, only to display a readable output.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="71434" LastEditDate="2018-04-05T20:45:15.687" LastActivityDate="2018-04-05T20:45:15.687" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="16149" PostTypeId="1" CreationDate="2018-04-05T21:29:51.490" Score="8" ViewCount="296" Body="&lt;p&gt;I think the title says it all. If you think a question is a duplicate or should be closed for any other reason, should it be acceptable for you to submit an answer before you vote for it to be closed? Potentially the member is then gaining rep and then denying anyone else the opportunity to do this themselves. I am not referring to any specific instance or member - I have seen this several times and commented more than once. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;My view would be that it is against the spirit of fairness that I think we all believe in.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thoughts anyone?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;EDIT&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As pointed out by @user56656 the rep thing is not really relevant. What is more important is that the member who has answered is then blocking other members from answering and competing with their answer. To be honest, I don't even know if it really matters. I have seen questions that have been closed which I would have had a try at and then seen that several of the people who voted to close had an answer already there. Guess it is my British spirit of &quot;fair play&quot; coming through. It's just not cricket!&lt;/p&gt;&#xA;" OwnerUserId="56555" LastEditorUserId="56555" LastEditDate="2018-04-05T22:20:10.283" LastActivityDate="2018-04-05T22:20:10.283" Title="Should a member vote to close on a question that they have already answered themselves?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="16150" PostTypeId="2" ParentId="16149" CreationDate="2018-04-05T21:39:41.993" Score="26" Body="&lt;p&gt;I think it is in bad spirit to answer a question you believe should be closed, whether it is a duplicate, unclear or other.  The intention of closure is to stop new answers so the question can be fixed.  By answering you are acting to undermine the benefits of closing the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That being said, I however do think that it is fine to vote to close a question that you have already answered.  For example you might see a question, answer it and then later another user might point out it is a duplicate, or in some way unclear that you hadn't realized.  In that case it is perfectly fine to vote to close if you believe it should be.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In short you should abstain from answering if you are voting to close but not abstain from voting to close because you have answered.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2018-04-05T21:39:41.993" CommentCount="11" ContentLicense="CC BY-SA 3.0" />
  <row Id="16151" PostTypeId="1" CreationDate="2018-04-06T01:26:36.210" Score="50" ViewCount="1831" Body="&lt;p&gt;PPCG &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8538/31716&quot;&gt;has graduated&lt;/a&gt;. Some features for graduated sites come immediately after graduating. However, other features are held off for an indefinite amount of time:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The site gets a custom theme, and&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges&quot;&gt;Privilege levels&lt;/a&gt;, which are initially lowered to help growing beta sites grow, are raised to match the &lt;a href=&quot;https://stackoverflow.com/help/privileges&quot;&gt;privilege levels of Stack Overflow.&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;PPCG has been graduated for over two years, but Stack Exchange has not had the resources to make our custom theme. This has held us back from getting our privilege levels adjusted, since traditionally these two changes happen at the same time. But this does not need to be the case. We've received word from the Community team that our privilege thresholds can be adjusted to post-design levels, prior to getting our design. However, we need to check in with you, the PPCG community, to make sure that you are OK with that change before it can happen.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;What will happen?&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Our privilege thresholds will be changed to the &lt;a href=&quot;https://meta.stackexchange.com/a/160292/307833&quot;&gt;post-design levels&lt;/a&gt;. This means that all users with less than 25,000 reputation will lose some privileges, and will have to earn more rep in order to regain them.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;What won't happen?&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We're not getting a design yet. Great things take time.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Please let us know what you think about this proposal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;~ The PPCG Moderation Team&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="31716" LastEditDate="2019-06-11T19:30:37.097" LastActivityDate="2022-11-16T12:42:08.220" Title="Can we raise the privilege levels?" Tags="|discussion|status-completed|graduation|privileges|" AnswerCount="3" CommentCount="23" ContentLicense="CC BY-SA 3.0" />
  <row Id="16152" PostTypeId="2" ParentId="16151" CreationDate="2018-04-06T01:27:06.237" Score="44" Body="&lt;h1&gt;Yes, let's do it&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;PPCG has a healthy voting culture and a relatively low barrier to entry. This means that it's easy to quickly gain reputation. &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=NewUsers&amp;amp;sort=reputation&quot;&gt;It's not unusual for new users to gain the close and reopen vote privilege in a week or two&lt;/a&gt;. Unless they spend quite a bit of time going over all of our policies on meta, and learning what makes us different from Q&amp;amp;A sites, new users will likely gain that important privilege before fully understanding how to use it, leading to close and reopen votes being applied where they should not (a problem we've already experienced). Raising the thresholds for privileges will reduce this problem. The community will also benefit from other important privileges having higher thresholds, like running in a moderator election and editing freely.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While nobody likes losing privileges, it's not hard to gain reputation on PPCG. Taking a little extra time to learn the policies and participating in the community before earning important, powerful privileges will benefit everyone. Additionally, this will get us one step further to being fully graduated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, this will have no bearing on when we get a design - changing the privilege levels only requires the CMs to change a setting. Our design will be on the backlog for the design team regardless.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorDisplayName="user45941" LastEditDate="2018-04-08T00:44:30.523" LastActivityDate="2018-04-08T00:44:30.523" CommentCount="24" ContentLicense="CC BY-SA 3.0" />
  <row Id="16153" PostTypeId="1" AcceptedAnswerId="16155" CreationDate="2018-04-06T10:49:39.930" Score="-8" ViewCount="226" Body="&lt;p&gt;I'll cut straight to the point here:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;We &lt;em&gt;must&lt;/em&gt; do something about the Sandbox, and &lt;em&gt;soon&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Sandbox recently hit 2000 non-deleted answers (5700 total). That's over 2000 potential challenges festering in some corner of the Internet, most likely not going to be posted for years, if ever.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm proposing that we, as a community, spend a week cleaning up the Sandbox.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The problem with the Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The Sandbox is intended to be a place where people can post challenge proposals, in order to get feedback before posting to main. However, the fact that there over 2000 proposals in one place means that, most of the time, people's challenges &lt;a href=&quot;https://codegolf.stackexchange.com/questions/47134/from-0-to-2n-1-in-popcorn-order#comment110591_47134&quot;&gt;don't get the feedback they need&lt;/a&gt;, and suffer for it on main. Its size is preventing the Sandbox from becoming effective.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition to this, it's a store for a large number of potential questions, yet &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14129/66833&quot;&gt;people are complaining&lt;/a&gt; about the low number of questions being posted per day. Cleaning it up, even just a little, can help solve both of these issues&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Clean up&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;&lt;em&gt;This is just my idea for a plan for cleaning up. Feel free to suggest alternatives in answers&lt;/em&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is laid out in progressive steps e.g. &lt;code&gt;1.&lt;/code&gt; is the first thing we do.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Lock the Sandbox. It is &lt;a href=&quot;https://math.meta.stackexchange.com/q/4666/427632&quot;&gt;possible&lt;/a&gt; to lock a question to prevent new answers. If we lock the Sandbox for a week while cleaning it up, it prevents new answers for being posted, which would then need to be held in consideration.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;Everyone who has a post in the Sandbox&lt;/em&gt; goes through their posts, marking each into one of four categories. &lt;strong&gt;Be harsh.&lt;/strong&gt; If you end up thinking &lt;em&gt;&quot;Will I ever post that?&quot;&lt;/em&gt;, delete it. If you change your mind, &lt;em&gt;you can repost afterwards&lt;/em&gt;. The categories:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;strong&gt;Ready to post&lt;/strong&gt; - These are posts, which after a few edits, would be perfectly fine to post on Main. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11108/66833&quot;&gt;Example&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;In progress&lt;/strong&gt; - These are posts which are &lt;em&gt;still being worked on&lt;/em&gt;, but aren't ready for Main just yet. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2302/66833&quot;&gt;Example&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Delete&lt;/strong&gt; - A &lt;em&gt;lot&lt;/em&gt; of posts in the Sandbox aren't worth posting, or can't really be salvaged, no matter the amount of editing. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10032/66833&quot;&gt;Example&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Open to anyone&lt;/strong&gt; - Some people don't want to post a challenge, but are willing to let others post. &lt;em&gt;Do this&lt;/em&gt;, if you're not sure about a challenge. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12399/66833&quot;&gt;Example&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This will just leave the posts where the authors are no longer active. Here, we post a comment below the challenge saying something like&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;You have 48 hours to decide what to do with the post, else it will be part of the Sandbox clean up (link to meta post). Please mark it appropriately, as you see fit.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Any posts which haven't been updated 48 hours after such a comment is posted can either be deleted, or, if someone else wants to post it, be adopted.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Finally, after all this, all Sandbox posts will be categorised. We then follow through on each of these categories, posting to main and deleting. &lt;strong&gt;Downvote and Vote To Delete&lt;/strong&gt; posts due for deletion. If you can't vote to delete, downvote and others will.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In short (not really short, but ¯\_(ツ)_/¯): Everyone trawls through the &lt;em&gt;entire&lt;/em&gt; Sandbox, acting on each post, relating to how it's categorised. The most important thing here is &lt;strong&gt;In progress&lt;/strong&gt; posts. &lt;em&gt;Give them feedback!&lt;/em&gt; Be a brutal and as honest as you want, &lt;em&gt;that's what the Sandbox is for!&lt;/em&gt; (Although &lt;a href=&quot;https://codegolf.stackexchange.com/help/be-nice&quot;&gt;Be Nice&lt;/a&gt;). We should aim to make &lt;em&gt;almost all&lt;/em&gt; &lt;strong&gt;In progress&lt;/strong&gt; posts be ready to post to main.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you wish to adopt a &lt;em&gt;unadopted&lt;/em&gt; post, edit your username in, next to the &lt;strong&gt;Open to anyone&lt;/strong&gt;, like so:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Open to anyone: taken by caird coinheringaahing&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Please don't steal posts from other people; there's no reason to.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Hopefully, by the end of the time we do this in, the Sandbox will be reduced to around 6000 deleted proposals, with 100 or so &lt;strong&gt;In progress&lt;/strong&gt; posts that can't be either posted or deleted yet. At this point, &lt;em&gt;the moderators&lt;/em&gt; create a new Sandbox post, migrating the remaining answers across to start a new Sandbox post.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Hopefully, if we do this right, this will kill two birds with one stone:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The Sandbox has been a big issue, and is getting too big to maintain properly&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14129/66833&quot;&gt;We should be posting more questions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;What does the community think about this? Do you have a better idea of how we can clean up the Sandbox? Please, post it as an answer!&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="69850" LastEditDate="2018-04-06T13:22:48.210" LastActivityDate="2018-04-07T04:20:21.997" Title="It's time for some Spring Cleaning" Tags="|discussion|sandbox|" AnswerCount="3" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="16154" PostTypeId="2" ParentId="16153" CreationDate="2018-04-06T13:30:24.880" Score="1" Body="&lt;h1&gt;The size is not a problem&lt;/h1&gt;&#xA;&lt;p&gt;You &lt;em&gt;do&lt;/em&gt; describe two very real problems:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;People want more challenges&lt;/li&gt;&#xA;&lt;li&gt;There's not enough feedback in the sandbox&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;However, neither of these problems are caused by the size of the sandbox.  In fact, I'd argue that the size of the sandbox actually &lt;em&gt;improves&lt;/em&gt; our challenge-posting situation:  People will occasionally look back at old challenges and say &amp;quot;Hey, I want to post that!&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Getting people to provide feedback in the sandbox is hard&lt;/strong&gt;.  We've had &lt;em&gt;many&lt;/em&gt;, &lt;em&gt;many&lt;/em&gt; discussions about how to motivate people to do this.  The primary discussion around it is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/13291/how-can-we-get-more-feedback-on-our-sandbox-questions&quot;&gt;here&lt;/a&gt;, so if you have an idea on how to motivate people to provide more feedback, that would be awesome.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-04-06T13:30:24.880" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16155" PostTypeId="2" ParentId="16153" CreationDate="2018-04-06T13:56:01.500" Score="13" Body="&lt;h3&gt;The sandbox's size is not an issue.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;When sorting the sandbox &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?answertab=active#tab-top&quot;&gt;by activity&lt;/a&gt;, you only see the 30 most recently active posts. Whether there are 2 or 200 more pages doesn't really change that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I agree that the low amount of feedback for sandboxed posts is an issue, but I fail to see &lt;em&gt;any&lt;/em&gt; evidence suggesting that this is due to the number of posts in it.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The size doesn't decrease by deleting.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The most valuable feedback will usually come from established users. Everyone with &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/moderator-tools&quot;&gt;access to moderator tools&lt;/a&gt; sees all deleted posts anyway, so deleting a lot of posts doesn't even make it &lt;em&gt;appear&lt;/em&gt; to have less of them.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Your plan is disruptive.&lt;/h3&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Closing the sandbox for a week (or applying that hacky wiki lock) will prevent it from getting the ~30 answers it usually gets in a week. 30 answers for a sandbox containing &lt;em&gt;thousands&lt;/em&gt; is merely a drop in the bucket, so we'll prevent people from using the sandbox for no good reason.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;Everyone who has a post in the Sandbox&lt;/em&gt; goes through their posts, marking each into one of four categories.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Everyone? You're lucky if the owners of 10% of the sandbox posts even &lt;em&gt;see&lt;/em&gt; this meta discussion, let alone act on it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Giving hundreds of users 48 hours to act on a non-issue is unnecessarily confrontational, perhaps even rude. Our less active users (not &lt;em&gt;everyone&lt;/em&gt; has a Fanatic badge) might not even see the comment in time, let alone have time to act on it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I predict that after the above steps, we will be left with some 1,800 uncategorized posts. There's no way we'll be able to handle any significant portion of those posts in a week.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Due to pagination, that doesn't really accomplish anything.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="56656" LastEditDate="2018-04-06T15:46:10.967" LastActivityDate="2018-04-06T15:46:10.967" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="16156" PostTypeId="2" ParentId="13291" CreationDate="2018-04-06T15:34:20.307" Score="1" Body="&lt;h1&gt;Courtesy suggestion for challenge authors&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If you have time to write a draft, then you have time for giving feedback. If you have the necessary talent to write a clear challenge on the first try, then you probably have the eye to spot problems with someone else's draft.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In light of this, from now on I will adopt a new courtesy in the Sandbox, and encourage others to do the same: &lt;em&gt;every time&lt;/em&gt; I need to delete a draft, whether it was published, scuttled, or poorly received, I will wait for activity in the Sandbox. The next &lt;em&gt;two&lt;/em&gt; drafts I see with new activity I will read completely and give my best feedback.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In essence, this is a way I can make a habit of giving feedback without forcing it when I have other things to do. I acknowledge that it would be infeasible to get everyone to do this, but my hope is to get at least the most active and experienced challenge authors into this.&lt;/p&gt;&#xA;" OwnerUserId="62402" LastEditorUserId="62402" LastEditDate="2018-04-06T15:40:18.603" LastActivityDate="2018-04-06T15:40:18.603" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="16159" PostTypeId="2" ParentId="2140" CreationDate="2018-04-07T04:19:53.837" Score="0" Body="&lt;p&gt;Write a program that, in different languages, output a different permutation(the exact source is counted as one permutation) of the code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Proper quine rule apply. Largest (Language count)^6/(Code length) win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sample: If your code is &lt;code&gt;AAB&lt;/code&gt; and running in several languages return &lt;code&gt;ABA&lt;/code&gt;, &lt;code&gt;AAB&lt;/code&gt;, &lt;code&gt;AAB&lt;/code&gt;, then its score is 2^6/3.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-04-07T08:26:55.403" LastActivityDate="2018-04-07T08:26:55.403" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="16160" PostTypeId="2" ParentId="16153" CreationDate="2018-04-07T04:20:21.997" Score="7" Body="&lt;h1&gt;Let's do a softer variation of this&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I believe, as others do, that this proposal may be a too drastic solution to a not-so-important problem. Some points of the proposal, however, could still be applied to produce good results.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Review your old posts&lt;/strong&gt; - I think it's not that uncommon even for fairly active people to have some forgotten proposals in the sandbox (I might have one or two of those myself). Let's use this post as an incentive to look for our old proposals and update them: either post them, go back on working on them, delete them or mark them as &lt;em&gt;open to anyone&lt;/em&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Open to anyone&lt;/strong&gt; - This could become an &quot;official&quot; status for questions in the sandbox. We could even allow posting incomplete ideas for challenges with this status, ready to be picked by anyone and turned into a real challenge ready for main.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Abandoned posts&lt;/strong&gt; - If you see an old proposal that you would like to complete and post, you can leave a comment under it; if the author doesn't answer for &lt;em&gt;a week&lt;/em&gt;, the proposal becomes automatically &lt;em&gt;open to anyone&lt;/em&gt; and you can make it your own.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;By doing this we could facilitate the flow of ideas from sandbox to main, and encourage people to build on other people's ideas to produce better challenges and avoid having half-baked proposals lying in wait forever.&lt;/p&gt;&#xA;" OwnerUserId="62393" LastActivityDate="2018-04-07T04:20:21.997" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16162" PostTypeId="2" ParentId="5243" CreationDate="2018-04-07T10:11:53.253" Score="4" Body="&lt;h1&gt;200 rep for an Abstract Rewriting System under 100 points&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This will be awarded to the first answer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/157094/abstract-rewriting-challenge-cops&quot;&gt;Abstract Rewriting Challenge (Cops)&lt;/a&gt; that scores less than 100 points and doesn't get cracked (or invalidated).&lt;/p&gt;&#xA;" OwnerUserId="21034" LastActivityDate="2018-04-07T10:11:53.253" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16164" PostTypeId="2" ParentId="2140" CreationDate="2018-04-07T15:17:51.280" Score="1" Body="&lt;h1&gt; Get Rid of GoTo's&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;My (pseudo) code is full of &lt;strong&gt;goto's&lt;/strong&gt;! What a mess... Let's change it into a more iterative code.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;SPECIFICATION&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each input consists of:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;HEADER&amp;gt; { &#xA;  0: &amp;lt;code&amp;gt; &#xA;  1: &amp;lt;code&amp;gt; (optional) &#xA;  2: &amp;lt;code&amp;gt; (optional) &#xA;  ... &#xA;  99: &amp;lt;code&amp;gt; (optional) &#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&amp;lt;&lt;em&gt;HEADER&lt;/em&gt;&gt;&lt;/strong&gt;: It is the method signature, but it can be anything. Just repeat it in the output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&amp;lt;&lt;em&gt;code&lt;/em&gt;&gt;&lt;/strong&gt;: It is the main code that contains the unwanted goto's and need to be refactored. It is always numbered, starting at 0 and increasing sequentially. &lt;strong&gt;code&lt;/strong&gt; can be one of:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;if&lt;/em&gt; [condition] goto [number] [trailing]: this is where the &lt;strong&gt;goto's&lt;/strong&gt; are. The if clause contains any text as a &lt;strong&gt;condition&lt;/strong&gt;, that should be repeated in the output. The &lt;strong&gt;number&lt;/strong&gt; should be between 0 and 99, and should point to a valid line in the input. The trailing could be a semicolon, a text comment or even nothing at all, but it will &lt;strong&gt;not&lt;/strong&gt; appear in the output.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;return&lt;/em&gt;: the return clause is special because it ends the method execution. In the input code, a return could be followed by others lines reachable by a goto. But in the output code, a return is never followed by a code line. The return can be followed by a semicolon or nothing at all.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;anything&lt;/em&gt;: anything else is just code clauses that should be repeated somewhere in the output code.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;EXAMPLES&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;BEFORE:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;method1() {&#xA;    0: printMessage(&quot;This is the firstMethod&quot;);&#xA;    1: if (inputString(0)) goto 3;&#xA;    2: return;&#xA;    3: setVar(10);&#xA;    4: printMessage(&quot;Var is set to 10&quot;);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;AFTER:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;method1() {&#xA;    0: printMessage(&quot;This is the firstMethod&quot;);&#xA;    1: if (inputString(0)) {&#xA;    2:  setVar(10);&#xA;    3:  printMessage(&quot;Var is set to 10&quot;);&#xA;    4: } else {&#xA;    5:  return;&#xA;    6: }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is the simplest example. The goto is changed into an if/else structure. The 'return' clause always ends a block (i.e., the code does not continue after it).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;BEFORE:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;public method2() {&#xA;    0: addFlag(char, 1);&#xA;    1: play(22, 3468, 4433);&#xA;    2: int rndNum = random(3)&#xA;    3: if(rndNum == 1) goto 6&#xA;    4: if(rndNum == 2) goto 8&#xA;    5: if(rndNum == 3) goto 10&#xA;    6: addItem(36, 54, 0, 0);&#xA;    7: return;&#xA;    8: addItem(37, 54, 0, 0);&#xA;    9: return;&#xA;    10: addItem(38, 54, 0, 0);&#xA;    11: return;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;AFTER:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;public method2() {&#xA;    0: addFlag(char, 1);&#xA;    1: play(22, 3468, 4433);&#xA;    2: int rndNum = random(3)&#xA;    3: if(rndNum == 1) {&#xA;    4:     addItem(36, 54, 0, 0);&#xA;    5:     return;&#xA;    6: } else {&#xA;    7:     if(rndNum == 2) {&#xA;    8:         addItem(37, 54, 0, 0);&#xA;    9:         return;&#xA;    10:    } else {&#xA;    11:        if(rndNum == 3) {&#xA;    12:            addItem(38, 54, 0, 0);&#xA;    13:            return;&#xA;    14:        } else {&#xA;    15:            addItem(36, 54, 0, 0);&#xA;    16:            return;&#xA;    17:        }&#xA;    18:    }&#xA;    19: }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This example is trickier. The three gotos end up creating nested if/else clauses. Also, as the transpiler can't know if rndNum(3) returns something from [1-2-3], there is also an ultimate else clause afterwards.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;BEFORE:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;public method3() {&#xA;    0: int curChar = whoMenu(&quot;Test&quot;, &quot;Super&quot;);&#xA;    1: if (firstChar(currentChar, 1)) goto 5;&#xA;    2: printMessage(&quot;The sun is hot.&quot;);&#xA;    3: if (YesNo(1)) goto 17;&#xA;    4: return;&#xA;    5: addVar(currentChar, 10);&#xA;    6: addVar(currentChar, 20);&#xA;    7: addVar(currentChar, 30);&#xA;    8: addVar(currentChar, 40);&#xA;    9: addVar(currentChar, 50);&#xA;    10: addVar(currentChar, 60);&#xA;    11: addVar(currentChar, 70);&#xA;    12: addVar(currentChar, 80);&#xA;    13: addVar(currentChar, 90);&#xA;    14: addVar(currentChar, 100);&#xA;    15: printMessage(&quot;You feel good&quot;);&#xA;    16: if (YesNo(1)) goto 17;&#xA;    17: addFlag(currentChar, 82);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;AFTER:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;public method3() {&#xA;    0: int curChar = whoMenu(&quot;Test&quot;, &quot;Super&quot;);&#xA;    1: if (firstChar(currentChar, 1)) {&#xA;    2:    addVar(currentChar, 10);&#xA;    3:    addVar(currentChar, 20);&#xA;    4:    addVar(currentChar, 30);&#xA;    5:    addVar(currentChar, 40);&#xA;    6:    addVar(currentChar, 50);&#xA;    7:    addVar(currentChar, 60);&#xA;    8:    addVar(currentChar, 70);&#xA;    9:    addVar(currentChar, 80);&#xA;    10:   addVar(currentChar, 90);&#xA;    11:   addVar(currentChar, 100);&#xA;    12:   printMessage(&quot;You feel good&quot;);&#xA;    13:   if (YesNo(1)) {&#xA;    14:         addFlag(currentChar, 82);&#xA;    15:   }&#xA;    16: } else {&#xA;    17:     printMessage(&quot;The sun is hot.&quot;);&#xA;    18:     if (YesNo(1)) {&#xA;    19:         addFlag(currentChar, 82);&#xA;    20:     } else {&#xA;    21:         return;&#xA;    22:     }&#xA;    23: }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This example is not so hard, but note there are two goto's going to the same line. As this line does not create a loop, it is permitted (see rules below).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;BEFORE:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;method4() {&#xA;    0: printMessage(&quot;This is the firstMethod&quot;);&#xA;    1: if (inputString(0)) goto 4;&#xA;    2: printMessage(&quot;End is near.&quot;);&#xA;    3: return;&#xA;    4: setVar(10);&#xA;    5: if (inputString(1)) goto 2;&#xA;    6: printMessage(&quot;Var is set to 10&quot;);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;AFTER:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;method4() {&#xA;    0: printMessage(&quot;This is the firstMethod&quot;);&#xA;    1: if (inputString(0)) {&#xA;    2:     setVar(10);&#xA;    3:     if (inputString(1)) {&#xA;    4:         printMessage(&quot;End is near.&quot;);&#xA;    5:         return;&#xA;    6:     } else {&#xA;    7:         printMessage(&quot;Var is set to 10&quot;);&#xA;    8:     }&#xA;    9: } else {&#xA;    10:    printMessage(&quot;End is near.&quot;);&#xA;    11:    return;&#xA;    12: }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This example is also tricky, because it contains a goto to a previous line. This does not create a loop, but it also creates a block that is repeated twice in the code.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;CONSIDERATIONS:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;1) Goto's are &lt;strong&gt;always&lt;/strong&gt; associated with an 'if' clause. Replace the goto with a start block '{' clause.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2) Goto's always create an 'if', but &lt;strong&gt;not&lt;/strong&gt; necessarily an 'else'.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;3) Some clauses can repeat due to more than one goto's going to the same line (directly or not).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;4) &lt;strong&gt;There won't be loops.&lt;/strong&gt; Example of invalid code:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;public methodInvalid() {&#xA;    0: if(YesNo(1)) goto 2;&#xA;    1: printMessage(&quot;this code is invalid.&quot;);&#xA;    2: if(NoYes(1)) goto 0;&#xA;    3: printMessage(&quot;still invalid.&quot;);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;5) Identation in the output is desirable. Each if/else block must be nested with a tab for each nested level. If you want to replace the tab for 2, 3 or 4 spaces, ok, just state it and make it coherent on your code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;6) As there won't be more goto's, the line numbers are &lt;strong&gt;optional&lt;/strong&gt; in the output code. Just don't put them out of order, if you want to keep them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;7) The first line can be ignored (just repeat it in the output) and the last line is always the close statement ('}'). These lines are never numbered.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;8) The input will always contains line numbers, starting with 0 and a colon. The next line will be 1 and a colon, and so on. &lt;strong&gt;No more than 99 lines will be present.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;9) There is also at least one space (or tab or opening parenthesis) after the if statement, one space before the goto statement and one space before the number after it. So &quot;1:ifagoto2&quot; is invalid, but &quot;1:if a goto 2&quot; is valid and also valid is &quot;1: if(a) goto 2&quot;. Spaces (or tabs) are optional before the line numbers and between the semicolon and the start of the code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;10) You &lt;strong&gt;only&lt;/strong&gt; need to worry with (a) 'goto's; (b) line numbers; (c) the 'return' clause; and (d) the end of the code (last line). Everything else is gibberish, you don't need to interpret the code. See a valid input below:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;BEFORE: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;fun with code {&#xA;    0: gibberish&#xA;    1: if a goto 3&#xA;    2: gibberish&#xA;    3: gibberish&#xA;    4: gibberish&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;AFTER:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;fun with code {&#xA;    0: gibberish&#xA;    1: if a {&#xA;    2:  gibberish&#xA;    3:  gibberish&#xA;    4: } else {&#xA;    5:  gibberish&#xA;    6:  gibberish&#xA;    7:  gibberish&#xA;    8: }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Standard loopholes apply, shortest answer in bytes wins!&lt;/p&gt;&#xA;" OwnerUserId="58829" LastEditorUserId="58829" LastEditDate="2018-04-09T18:02:02.143" LastActivityDate="2018-04-09T18:02:02.143" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="16165" PostTypeId="2" ParentId="2140" CreationDate="2018-04-07T17:09:30.130" Score="0" Body="&lt;h1&gt;The 3n+1 problem&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://uva.onlinejudge.org/index.php?option=com_onlinejudge&amp;amp;Itemid=8&amp;amp;category=3&amp;amp;page=show_problem&amp;amp;problem=36&quot; rel=&quot;nofollow noreferrer&quot;&gt;The legendary problem in UVa Online Judge&lt;/a&gt;, with &lt;a href=&quot;https://uva.onlinejudge.org/index.php?option=com_onlinejudge&amp;amp;Itemid=8&amp;amp;page=problem_stats&amp;amp;problemid=36&amp;amp;category=24&quot; rel=&quot;nofollow noreferrer&quot;&gt;over 775k submissions and over 85k people who solved it&lt;/a&gt;. I, personally, have solved it in many ways, even reaching the best time below 0.01 sec.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even though the problem is interesting from the algorithmic point of view, insofar as reasonable time constraints would be easily able to force people to think about some sane approach to caching and use data structures like the segment tree, it is actually not the case here: the time constraints, on UVa, are so lax that even a purely naive algorithm is accepted by the judge. Since we are on CodeGolf and not on a programming contest, we aim here to write shortest code, and not necessarily fastest one, so for most part you don't need to care about performance - that is, as long as it is not horrible even beyond the lax allowances of the online judge; more on that below.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The input will consist of several lines, each containing a pair of integers &lt;em&gt;i&lt;/em&gt; and &lt;em&gt;j&lt;/em&gt;, such that &lt;em&gt;0&amp;lt;i,j&amp;lt;1,000,000&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For each line of input, you are to print one line of output that will consist of integers &lt;em&gt;i&lt;/em&gt; and &lt;em&gt;j&lt;/em&gt;, in that order, followed by one number that will denote the maximum length of the &lt;a href=&quot;https://en.wikipedia.org/wiki/Collatz_conjecture&quot; rel=&quot;nofollow noreferrer&quot;&gt;Collatz sequence&lt;/a&gt; (also known as the 3n+1 sequence), over all numbers between and including &lt;em&gt;i&lt;/em&gt; and &lt;em&gt;j&lt;/em&gt;. Note that while in mathematics the terminal number &lt;em&gt;1&lt;/em&gt; usually doesn't count to the length of the sequence, in this problem it does.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Collatz sequence is defined as follows: If &lt;em&gt;a&lt;sub&gt;n&lt;/sub&gt;&lt;/em&gt; is odd, then &lt;em&gt;a&lt;sub&gt;n+1&lt;/sub&gt;:=3*a&lt;sub&gt;n&lt;/sub&gt;+1&lt;/em&gt;; or, if &lt;em&gt;a&lt;sub&gt;n&lt;/sub&gt;&lt;/em&gt; is even, then &lt;em&gt;a&lt;sub&gt;n+1&lt;/sub&gt;:=a&lt;sub&gt;n&lt;/sub&gt;/2&lt;/em&gt;. The sequence ends when it reaches number &lt;em&gt;1&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sample input (taken from UVa):&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 10&#xA;100 200&#xA;201 210&#xA;900 1000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Sample output (taken from UVa):&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 10 20&#xA;100 200 125&#xA;201 210 89&#xA;900 1000 174&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Additional notes:&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There is no guarantee that &lt;em&gt;i&amp;lt;=j&lt;/em&gt;. The input may contain lines with &lt;em&gt;i&amp;gt;j&lt;/em&gt;. However, even in these cases, you are supposed to print out &lt;em&gt;i&lt;/em&gt; and &lt;em&gt;j&lt;/em&gt; in the output in the correct order (that is, &lt;em&gt;i&lt;/em&gt; comes before &lt;em&gt;j&lt;/em&gt;, not &lt;em&gt;min(i, j)&lt;/em&gt; before &lt;em&gt;max(i, j)&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;There is a guarantee that, while computing the Collatz sequence terms, no term will overflow a 32bit integer.&lt;/li&gt;&#xA;&lt;li&gt;As of now, the &lt;a href=&quot;https://uva.onlinejudge.org/index.php?option=com_onlinejudge&amp;amp;Itemid=8&amp;amp;page=show_problem&amp;amp;problem=36&quot; rel=&quot;nofollow noreferrer&quot;&gt;problem specification&lt;/a&gt; gives incorrect input boundaries, claiming that all numbers will be less than 10,000. The correct bound seems to be 1,000,000 instead, which is present in the &lt;a href=&quot;http://web.archive.org/web/20161225044321/https://uva.onlinejudge.org/index.php?option=com_onlinejudge&amp;amp;Itemid=8&amp;amp;page=show_problem&amp;amp;problem=36&quot; rel=&quot;nofollow noreferrer&quot;&gt;archived version of the problem specification&lt;/a&gt;. Since last time I checked the judge required accepted programs to be able to process numbers up to 1,000,000, we retain that requirement in our problem.&lt;/li&gt;&#xA;&lt;li&gt;Your program must perform actual computations. Hardcoding all sequence lengths for numbers between &lt;em&gt;1&lt;/em&gt; and &lt;em&gt;1,000,000&lt;/em&gt; is unacceptable. So is fetching them from external sources.&lt;/li&gt;&#xA;&lt;li&gt;Your program must read from standard input and write to standard output. Your program must format its output as required by UVa Online Judge for this program.&lt;/li&gt;&#xA;&lt;li&gt;Of course, we do not retain the original harsh requirements on acceptable programming languages. Any programming language is OK as long as it doesn't violate the standard loopholes.&lt;/li&gt;&#xA;&lt;li&gt;Your program must correctly process all lines until EOF and then exit gracefully. Your program must not wait endlessly on EOF, enter an infinite loop on EOF, crash on EOF, exit with an error, etc.&lt;/li&gt;&#xA;&lt;li&gt;Performance restrictions:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Basically, the intention is to allow everything but most horribly underperforming programs.&lt;/li&gt;&#xA;&lt;li&gt;To be more specific, the naive algorithm that, for each line of input, computes once the whole sequence for each number in the required range is allowed (&lt;a href=&quot;https://ideone.com/fsyca5&quot; rel=&quot;nofollow noreferrer&quot;&gt;example of an allowed program&lt;/a&gt;). It is also allowed to keep an array caching lengths of all sequences starting with numbers from &lt;em&gt;1&lt;/em&gt; to &lt;em&gt;1,000,000&lt;/em&gt; (&lt;a href=&quot;https://ideone.com/JRZOjF&quot; rel=&quot;nofollow noreferrer&quot;&gt;example of an allowed program&lt;/a&gt;), or to keep a dictionary caching lengths of all sequences starting with any encoutered numbers so far (&lt;a href=&quot;https://ideone.com/2tA6W1&quot; rel=&quot;nofollow noreferrer&quot;&gt;example of an allowed program&lt;/a&gt;); however, it is not allowed to keep an array caching all encountered lengths, since that array would be unreasonably sparce and thus unreasonably large (&lt;a href=&quot;https://ideone.com/UW541X&quot; rel=&quot;nofollow noreferrer&quot;&gt;example of a disallowed program&lt;/a&gt;); it is also not allowed to precompute a &lt;em&gt;1,000,000x1,000,000&lt;/em&gt; array that would keep all maximums of lengths in all valid ranges (&lt;a href=&quot;https://ideone.com/rRD1vz&quot; rel=&quot;nofollow noreferrer&quot;&gt;example of a disallowed program&lt;/a&gt;). Your program may precompute lengths even for numbers that would otherwise be disallowed by the guarantee of not overflowing a 32bit integer (&lt;a href=&quot;https://ideone.com/R7Bp2L&quot; rel=&quot;nofollow noreferrer&quot;&gt;example of an allowed program&lt;/a&gt;), if you wish.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Shortest code wins.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="53271" LastEditorUserId="53271" LastEditDate="2018-04-07T18:16:08.353" LastActivityDate="2018-04-07T18:16:08.353" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="16169" PostTypeId="2" ParentId="2140" CreationDate="2018-04-09T14:07:47.907" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/162554/75524&quot;&gt;Dollar Bill Auction&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="75524" LastEditorUserId="75524" LastEditDate="2018-04-17T23:22:46.613" LastActivityDate="2018-04-17T23:22:46.613" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="16171" PostTypeId="2" ParentId="2140" CreationDate="2018-04-09T16:23:11.330" Score="0" Body="&lt;h1&gt;___ encrypting&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given two text &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt;, both contain only lowercase letters&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Write each charactor in &lt;code&gt;a&lt;/code&gt; into 5 digits of binary (&lt;code&gt;a =&amp;gt; 00001&lt;/code&gt;, &lt;code&gt;z =&amp;gt; 11010&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Write each charactor in &lt;code&gt;b&lt;/code&gt; where such place of the binary list is &lt;code&gt;1&lt;/code&gt; is written into a different style (uppercase, bold, etc., but should be consistant)&lt;/li&gt;&#xA;&lt;li&gt;If some char remain in &lt;code&gt;b&lt;/code&gt;, either keep them all in the &lt;code&gt;0&lt;/code&gt; style or remove them. You can assume &lt;code&gt;b&lt;/code&gt; has enough chars.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Sample:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;a&lt;/code&gt; = &lt;code&gt;cat&lt;/code&gt;, &lt;code&gt;b&lt;/code&gt; = &lt;code&gt;programmingpuzzlescodegolf&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Write &lt;code&gt;a&lt;/code&gt; into binary &lt;code&gt;000110000110100&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;So the output can be  &lt;code&gt;proGRammiNGpUzz&lt;/code&gt;, &lt;code&gt;proGRammiNGpUzzlescodegolf&lt;/code&gt;, pro&lt;strong&gt;gr&lt;/strong&gt;ammi&lt;strong&gt;ng&lt;/strong&gt;p&lt;strong&gt;u&lt;/strong&gt;zzlescodegolf, etc.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="69850" LastEditDate="2018-04-10T05:21:29.887" LastActivityDate="2018-04-10T05:21:29.887" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="16172" PostTypeId="1" CreationDate="2018-04-09T18:09:33.297" Score="27" ViewCount="642" Body="&lt;p&gt;I was thinking of a proof of impossibility for a long-running unanswered question on this site. By a proof of impossibility, what I mean is a proof that no possible answer can solve the challenge. When I polled chat for other interested fellows, one response was this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;unfortunately, I don't think that would fit as an answer, since the question asks about solutions to the challenge, but about a proof that it's impossible&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So I came here to ask: if I could prove that a challenge had no valid solutions, could I post it as an answer?&lt;/p&gt;&#xA;" OwnerUserId="62402" LastActivityDate="2018-04-16T14:42:32.337" Title="Is a proof of impossibility allowed as an answer?" Tags="|discussion|answers|unanswered-questions|" AnswerCount="4" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="16173" PostTypeId="2" ParentId="16172" CreationDate="2018-04-09T18:55:25.827" Score="-8" Body="&lt;h2&gt;Vote to close&lt;/h2&gt;&#xA;&lt;p&gt;(Or whatever the closest available option is based on reputation)&lt;/p&gt;&#xA;&lt;p&gt;A challenge with no solutions is not capable of generating new answers in a valuable way, and other types of challenges incapable of being answered well are often closed. I would lean towards &amp;quot;Unclear what you are asking&amp;quot;, alongside a comment that links to the proof of impossibility, which would allow the poster or some other community member the chance to tweak the challenge constraints into one that &lt;em&gt;does&lt;/em&gt; have solutions in case there is something interesting in the core of the challenge even if other parts make it inaccessible. In this way challenges which are impossible for abstract reasons that are difficult to prove get treated the same as a challenge which says both &amp;quot;Answers must do X&amp;quot; and &amp;quot;Answers must not do X&amp;quot;: both are impossible as defined, and clarification is requested to resolve the impossibility. Then, if no improvement is/can be made, the challenge stays closed.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-04-09T18:55:25.827" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="16174" PostTypeId="2" ParentId="16172" CreationDate="2018-04-09T19:16:32.610" Score="11" Body="&lt;h1&gt;Yes, if the question is locked as &lt;em&gt;Wiki Answer&lt;/em&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note&lt;/strong&gt; &lt;em&gt;This is a point of view, not an authoritative answer.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you have a proof of impossibility, the challenge cannot be properly solved. It should get &lt;em&gt;one&lt;/em&gt; answer (the proof of impossibility), but no other answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fortunately, Stack Exchange supports this. Mods can lock questions with the reason &lt;strong&gt;Wiki Answer&lt;/strong&gt;, which is described as follows.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This question's answers are a collaborative effort: if you see something that can be improved, just edit the answer to improve it! &lt;em&gt;No additional answers can be added here&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I think this is a perfect fit: it effectively closes the challenge, but it also provides a space to detail why the challenge had to be closed.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Example of a question locked as &lt;em&gt;Wiki Answer&lt;/em&gt;: &lt;a href=&quot;https://stackoverflow.com/q/388242/950430&quot; title=&quot;c++ faq - The Definitive C++ Book Guide and List - Stack Overflow&quot;&gt;The Definitive C++ Book Guide and List&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2018-04-10T14:43:05.883" LastActivityDate="2018-04-10T14:43:05.883" CommentCount="19" ContentLicense="CC BY-SA 3.0" />
  <row Id="16176" PostTypeId="2" ParentId="2140" CreationDate="2018-04-10T07:42:23.233" Score="0" Body="&lt;h1&gt;A Magic Ritual&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an input string N perform a sequence of steps.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Delete all spaces from the string.&lt;/li&gt;&#xA;&lt;li&gt;Delete all other occurrences that come after the first one of the same letter from the string.&lt;/li&gt;&#xA;&lt;li&gt;If the string contains the letters needed for &lt;code&gt;zero&lt;/code&gt;, delete these letters and add the corresponding digit &lt;code&gt;0&lt;/code&gt; to the end of the string. Repeat this for 0 to 9.&lt;/li&gt;&#xA;&lt;li&gt;Order the characters left in the string by the alphabet, then by their numeric values.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;May be received as a string, an array of characters or any other reasonable input for text.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may assume that the input will only consist of characters including a-z (lowercase) and spaces.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Same as input, or may be directly written to &lt;code&gt;stdout&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the shortest code in terms of bytecount wins.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are forbidden.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a magic ritual -&amp;gt; acgilmrtu&#xA;sixone -&amp;gt; 16&#xA;codegolf -&amp;gt; cdefglo&#xA;the quick brown fox jumps over the lazy dog -&amp;gt; abcdfghjklmnpqtuvwy06&#xA;qwertyuiopasdfghjklzxcvbnm -&amp;gt; abcdfghjklmnpqtuvwy06&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="72738" LastEditorUserId="72738" LastEditDate="2018-04-10T08:16:10.350" LastActivityDate="2018-04-10T08:16:10.350" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="16177" PostTypeId="2" ParentId="2140" CreationDate="2018-04-10T14:43:46.863" Score="0" Body="&lt;h2&gt;Title: The Liquorice All-sort&lt;/h2&gt;&#xA;&lt;p&gt;I have just invented a new sorting algorithm, which I would like you to implement in the smallest number of bytes... The &lt;em&gt;Liquorice All-sort&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given that the individual sweets are (or were) named: chips, rocks, Buttons&lt;code&gt;[sic]&lt;/code&gt;, nuggets, plugs, twists, spogs (&lt;a href=&quot;https://en.wikipedia.org/wiki/Liquorice_allsorts&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://en.wikipedia.org/wiki/Liquorice_allsorts&lt;/a&gt;), we can say that:&lt;/p&gt;&#xA;&lt;p&gt;A bag (multiset) of &lt;code&gt;Liquorice allsorts&lt;/code&gt; is comprised of 0..n of each item &lt;code&gt;chip, rock, Button, nugget, plug, twist, spog&lt;/code&gt;, plus a bonus of 1..2 &lt;code&gt;Bertie&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Given an input of an arbitrary array characters (&lt;code&gt;A-z&lt;/code&gt;, &lt;code&gt;0-9&lt;/code&gt;, &lt;code&gt;space&lt;/code&gt;), and a bag of Liquorice allsorts, sort as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;For each input character, from last to first:&#xA;    Is the bag empty?&#xA;           Yes: Exit the sort&#xA;    Else, Is the input equal to a letter (case-sensitive) that is contained in the name of one or more of the sweets in the bag?&#xA;       Yes: The number of items it matches is the number of positions it moves up the list (can't move past the top of the list).&#xA;            Take a bite out of each of the used sweets, by removing the letter we used. &#xA;            Have we used all the letters in any item?&#xA;               Yes: Remove that item from the bag&#xA;    Else: move to the bottom of the list.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Inputs&lt;/h2&gt;&#xA;&lt;p&gt;two inputs - the numbers to sort, and the list of sweet names. Both are guaranteed to be non-empty bags (sets that can contain duplicates; or an equivalent in your language), and the bags of sweets contains a minimum of one &lt;code&gt;Bertie&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Outputs&lt;/h2&gt;&#xA;&lt;p&gt;The sorted numbers&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;{Bertie},{B}&lt;/code&gt; -&amp;gt; &lt;code&gt;{B}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{Bertie},{X,B}&lt;/code&gt; -&amp;gt; &lt;code&gt;{B,X}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{chip, rock, Button, nugget, plug, twist, spog, Bertie}, {A,B,C,k,e,r,w}&lt;/code&gt; -&amp;gt; {B,C,k,e,r,w,&lt;code&gt;A&lt;/code&gt;} -&amp;gt; {&lt;code&gt;B&lt;/code&gt;,C,k,e,r,w,A} -&amp;gt; {B,k,e,r,w,A,&lt;code&gt;C&lt;/code&gt;} -&amp;gt; {&lt;code&gt;k&lt;/code&gt;,B,e,r,w,A,C} -&amp;gt; {&lt;code&gt;e&lt;/code&gt;,k,B,r,w,A,C} -&amp;gt; {e,&lt;code&gt;r&lt;/code&gt;,k,B,w,A,C} -&amp;gt; {e,r,k,&lt;code&gt;w&lt;/code&gt;,B,A,C}&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{Bertie, rock}, {r,o,c,k,r,o,c,e}&lt;/code&gt; -&amp;gt; {&lt;code&gt;r&lt;/code&gt;,o,c,k,r,o,c,e} -&amp;gt; {&lt;code&gt;o&lt;/code&gt;,r,c,k,r,o,c,e} -&amp;gt; {o,&lt;code&gt;c&lt;/code&gt;,r,k,r,o,c,e} -&amp;gt; {o,c,&lt;code&gt;k&lt;/code&gt;,r,r,o,c,e} -&amp;gt; (remove rock from the bag) -&amp;gt; {o,c,k,r,o,c,e,&lt;code&gt;r&lt;/code&gt;} -&amp;gt; {o,c,k,r,c,e,r,&lt;code&gt;o&lt;/code&gt;} -&amp;gt; {o,c,k,r,e,r,o,&lt;code&gt;c&lt;/code&gt;} -&amp;gt; {o,c,k,&lt;code&gt;e&lt;/code&gt;,r,r,o,c}&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&lt;p&gt;I really like the idea of doing something with this (I like the wordplay of &lt;code&gt;bag&lt;/code&gt;, etc.); but I don't know if the algorithm is just too arbitrary. Any thoughts or alternatives would be appreciated!&lt;/p&gt;&#xA;" OwnerUserId="62289" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-09-23T15:02:23.633" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16178" PostTypeId="1" CreationDate="2018-04-10T15:04:32.553" Score="9" ViewCount="252" Body="&lt;p&gt;For a challenge, I recently submitted the JavaScript solution&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[].push&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;To be clear, this isn't &lt;code&gt;x=&amp;gt;[].push&lt;/code&gt;. The entry itself is a function: it's the function identified by the JavaScript expression &lt;code&gt;[].push&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The critical complication is that it wouldn't work to place this function in a variable. this would &lt;strong&gt;not&lt;/strong&gt; work:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f=[].push;&#xA;f(...);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is because &lt;code&gt;push&lt;/code&gt; needs to be accessed as a method (i.e., a property accessed from some parent value) in the lexical invocation expression where it is called in order for it to push into the correct array. A correct invocation must be &lt;code&gt;[].push(...)&lt;/code&gt; (or, to separate the answer from the input, &lt;code&gt;([].push)(...)&lt;/code&gt; would be fine, too). The &quot;bare&quot; invocation &lt;code&gt;f(...)&lt;/code&gt; does not include property access, so the &lt;code&gt;push&lt;/code&gt; function is called but does not work correctly.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;If this is allowed, are more complex answers of the same form allowed, e.g.:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;    x: 5,&#xA;    f: function() { return Math.dothing(this.x) }&#xA;}.f&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where you define an object with properties and then conclude with &lt;code&gt;.f&lt;/code&gt; so that the whole expression returns that single function?&lt;/p&gt;&#xA;" OwnerUserId="7796" LastEditorUserId="41024" LastEditDate="2018-04-10T18:08:44.663" LastActivityDate="2018-04-10T18:08:44.663" Title="Is it legal to submit a function that must exist as a method on an object?" Tags="|discussion|answers|" AnswerCount="3" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="16179" PostTypeId="2" ParentId="16178" CreationDate="2018-04-10T15:39:44.673" Score="-4" Body="&lt;p&gt;You're essentially referencing a builtin. While that's very much allowed, the correct code (which can be stored in a variable and called later) would be one of these:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[].push.bind()&#xA;a=&amp;gt;[].push(a)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now, in your example, a better way to write it would be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f=&amp;gt;Math.dothing(x);x=5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Since you don't need to worry about global variable name collision.&lt;/p&gt;&#xA;" OwnerUserId="62402" LastActivityDate="2018-04-10T15:39:44.673" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="16180" PostTypeId="2" ParentId="16178" CreationDate="2018-04-10T16:29:23.350" Score="7" Body="&lt;h3&gt;That is not a valid function&lt;/h3&gt;&#xA;&lt;p&gt;Although the meta ruling on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8737/71434&quot;&gt;what qualifies as a function&lt;/a&gt; isn't conclusive with two top answers at roughly equal scores, both of those answers indicate that a function only counts if it can be assigned to a variable or given a name. The fact that you need to replicate the entire code of the submission in order to call it each time, rather than being easily able to store it to a chosen name, to me means that it can't qualify as a function. I think it's also obvious that it doesn't qualify as a program either.&lt;/p&gt;&#xA;&lt;p&gt;Since it is neither a Function nor a Program, based on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2419/71434&quot;&gt;a much stronger consensus&lt;/a&gt; it isn't a valid solution unless the challenge specifically allows it. I would recommend replacing it with &lt;code&gt;a=&amp;gt;[].push(a)&lt;/code&gt; or something similar, or asking a followup question about whether a submission can be called a function if it requires some simple and consistent boilerplate in order to name/assign/store it.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-04-10T16:29:23.350" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="16181" PostTypeId="1" CreationDate="2018-04-10T16:44:24.780" Score="1" ViewCount="59" Body="&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/a/161797/76323&quot;&gt;this answer&lt;/a&gt;, the function is defined as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;With(Math)f=(a,b,c,d)=&amp;gt;...    (1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;However, &lt;code&gt;f&lt;/code&gt; is not used in the function, so it seems fine to write &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;With(Math)(a,b,c,d)=&amp;gt;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(the latter one's return value is also the function)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The point is that, you can't write &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f = With(Math)(a,b,c,d)=&amp;gt;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You either write (1) or &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f = eval('With(Math)(a,b,c,d)=&amp;gt;...')&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;to make f be the function. Is that allowed?&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2018-04-10T16:44:24.780" Title="Function not that directly used allowed?" Tags="|discussion|code-golf|" AnswerCount="0" CommentCount="5" ClosedDate="2018-04-10T18:44:23.830" ContentLicense="CC BY-SA 3.0" />
  <row Id="16182" PostTypeId="2" ParentId="16172" CreationDate="2018-04-10T16:55:24.380" Score="-9" Body="&lt;h1&gt;Answer it with a stronger model language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Some questions can't be solved on Turing machine, then you can try a stronger model to solve it. A proof is welcomed. No strong model abusing, though&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2018-04-10T16:55:24.380" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="16183" PostTypeId="2" ParentId="16178" CreationDate="2018-04-10T17:20:28.260" Score="9" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9067/41024&quot;&gt;If it quacks like a function, it's a function&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For example, if you want to join a list of strings with spaces in Python, the function to use would be &lt;code&gt;' '.join&lt;/code&gt;. I don't see any reason that this function should be invalid in such a challenge, as it can be assigned (as e.g. &lt;code&gt;f = ' '.join; f(list_of_strings)&lt;/code&gt;) or even used as is (e.g. &lt;code&gt;' '.join(list_of_strings)&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The reason why a function like Python's &lt;code&gt;[].append&lt;/code&gt; won't work in a challenge that asks you to return a singleton list containing a value passed as input is that the function itself doesn't return the result, but instead it assigns it in place, and that place is the new reference created by mentioning &lt;code&gt;[]&lt;/code&gt;, and so the function isn't even the same function when used multiple times without assigning it to a variable.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2018-04-10T17:20:28.260" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="16185" PostTypeId="2" ParentId="16172" CreationDate="2018-04-11T12:43:03.380" Score="37" Body="&lt;p&gt;This is my opinion:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If the proof of impossibility is trivial, offer it as a comment and hope the OP revises their question or deletes it. If they don't, it should be closed as &quot;unclear what you're asking.&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the proof of impossibility is nontrivial - which I think must be the case here, since you said the question is a long-standing one - then offer it as an answer. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In the latter case I would say there is no need to make it &quot;Wiki Answer&quot; as suggested by Dennis. If the proof is nontrivial then you put work into it and it is helpful for the community (so that others don't keep trying to solve it), so you should credit - and rep - for it. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is basically how it would work on sites such as Math or Physics - if the question is &quot;how can I do X&quot; it's quite acceptable to give an answer &quot;you can't do X, for nontrivial reason Y.&quot; I think it should be the same here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;[Added later:&lt;/strong&gt; it turns out that you can have a &quot;Wiki Answer&quot; question without the answer being Community Wiki. In that case the person who posted the answer does still get the rep, so in that case applying it wouldn't cause a problem. (Note that +20 votes on this answer are from before this text was added.)&lt;strong&gt;]&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="21034" LastEditorUserId="21034" LastEditDate="2018-04-16T14:42:32.337" LastActivityDate="2018-04-16T14:42:32.337" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="16186" PostTypeId="2" ParentId="8047" CreationDate="2018-04-11T13:20:14.517" Score="37" Body="&lt;h1&gt;Formulating the challenge as &lt;em&gt;something&lt;/em&gt; and then including a &lt;em&gt;twist&lt;/em&gt; that completely changes the task&lt;/h1&gt;&#xA;&lt;p&gt;Don't hide information from the reader. Don't enounce the challenge as something that later on it will turn out not to be.&lt;/p&gt;&#xA;&lt;p&gt;To ellaborate, consider the following formulation:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;em&gt;Do&lt;/em&gt; &amp;lt; &lt;em&gt;task &lt;strong&gt;A&lt;/strong&gt;, usually easy, described in one or several paragraphs&lt;/em&gt; &amp;gt; &lt;br&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;But wait!&lt;/em&gt; / &lt;em&gt;Not so fast!&lt;/em&gt; / &lt;em&gt;There is a twist&lt;/em&gt;...&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;You can only use ...&lt;/em&gt; &amp;lt; &lt;em&gt;clarification that significantly changes the task into &lt;strong&gt;B&lt;/strong&gt;&lt;/em&gt; &amp;gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is &lt;strong&gt;misleading&lt;/strong&gt;. The initial description says something, then the challenge turns out to be something else.&lt;/p&gt;&#xA;&lt;p&gt;A typical use of this is to present the task as deceivingly simple (A), and then clarify that it is actually much harder (B). The writer's intention may be to make the challenge more &amp;quot;fun&amp;quot; or to add some &amp;quot;spice&amp;quot;. But it's better to &lt;strong&gt;be honest from the start&lt;/strong&gt; and include all the relevant information at the beginning, not leaving important information for later. The &amp;quot;twist&amp;quot; may be fun for the writer; but the reader may feel they have been deceived. What was initially told is not really true.&lt;/p&gt;&#xA;&lt;p&gt;I'm not saying that clarifications are not allowed. As the challenge text progresses, the initial description can (should) be refined. But &lt;strong&gt;don't include a significant change in the middle of the text&lt;/strong&gt;. If a &amp;quot;clarification&amp;quot; contradicts or significantly alters the challenge, it should be put right at the outset (it's not a clarification, it's one of the main ideas).&lt;/p&gt;&#xA;&lt;p&gt;The order of ideas in the text should be chosen to &lt;strong&gt;minimize surprise&lt;/strong&gt; to the reader. Start with the main ideas, then include refinements that modify or qualify any previous statements as little as possible.&lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-01-16T16:10:09.643" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="16187" PostTypeId="2" ParentId="2140" CreationDate="2018-04-11T14:00:19.687" Score="-3" Body="&lt;p&gt;Write a program who return the current month.&lt;/p&gt;&#xA;&lt;h2&gt;The Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The result needs to be correct even if the program is run &lt;strong&gt;in the future&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;It's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest code wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Optional&lt;/h2&gt;&#xA;&lt;p&gt;Add an interpreter so the submission can be tested. It is allowed to write this interpreter yourself for a previously unimplemented language.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sup&gt;It's my first code-golf idea I'm fully open to improving it with more experienced users.&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="78116" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-04-13T12:17:31.103" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="16188" PostTypeId="2" ParentId="2140" CreationDate="2018-04-11T16:25:22.133" Score="3" Body="&lt;p&gt;Really skirting bit of sandboxing here (I haven't taken the time to develop the question):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd like to do a 2-d variant of this one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/161632/two-lasers-between-two-mirrors&quot;&gt;Two lasers between two mirrors&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input would be an ascii maze, with a marker for the laser starting point, e.g.:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+---+------+&#xA;|*  |      |&#xA;|   |      |&#xA;|   |  ----+&#xA;|   |      |&#xA;|   |      |&#xA;|   |      |&#xA;|   +---   |&#xA;|          |&#xA;|          |&#xA;|          |&#xA;+----------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Astrisk(*): laser starting point.&lt;/li&gt;&#xA;&lt;li&gt;Whitespace: passable.&lt;/li&gt;&#xA;&lt;li&gt;Any other character is a reflective obstacle.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Result:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+---+------+&#xA;|\  |   /\ |&#xA;| \ |  /  \|&#xA;|  \| /----+&#xA;|  /|/   /\|&#xA;| / |\  / /|&#xA;|/  | \/ / |&#xA;|\  +---/  |&#xA;| \    /   |&#xA;|  \  /    |&#xA;|   \/     |&#xA;+----------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Rules: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When you can't move horizontally, reverse horizontal direction.&lt;/li&gt;&#xA;&lt;li&gt;When you can't move vertically, reverse vertical direction.&lt;/li&gt;&#xA;&lt;li&gt;Stop going when you meet the same laser coming the other way (e.g. when you hit a corner or reach your starting position again).I'm thinking of a golfing challenge.&lt;/li&gt;&#xA;&lt;li&gt;If the laser revisits a space in the other direction, draw an upper case X.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Simplifying factors:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Let's just say the laser always goes the same way.&lt;/li&gt;&#xA;&lt;li&gt;The map is always a rectangle.&lt;/li&gt;&#xA;&lt;li&gt;Just the one laser.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;It'll probably just be a golfing challenge.&lt;/p&gt;&#xA;" OwnerUserId="16824" LastEditorUserId="59183" LastEditDate="2018-04-11T17:24:59.693" LastActivityDate="2018-04-11T17:24:59.693" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="16190" PostTypeId="2" ParentId="2140" CreationDate="2018-04-11T18:48:30.903" Score="2" Body="&lt;h1&gt;Survival Game: Alien Hunters (working title)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/java&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;java&amp;#39;&quot; rel=&quot;tag&quot;&gt;java&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Based on &lt;a href=&quot;//codegolf.stackexchange.com/questions/25347/survival-game-create-your-wolf&quot;&gt;Create Your Wolf&lt;/a&gt;, but the combat is very different.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Somewhere, deep in the heart of the galaxy, lies the planet Oizys. A toroidal planet in the habitable zone of its star, its bountiful land and beautiful oceans make it the perfect planet for your race of aliens to start colonizing as an interstellar civilization.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, a few dozen other alien races are &lt;em&gt;also&lt;/em&gt; trying to colonize it, and you can't stand them. So you're going to have to kill them.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Your Alien&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to write an implementation of the &lt;code&gt;net.ramenchef.oizys.Alien&lt;/code&gt; class:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-java prettyprint-override&quot;&gt;&lt;code&gt;package net.ramenchef.oizys;&#xA;&#xA;public class Alien {&#xA;    public enum Move {&#xA;        // a whole bunch of values; these are described in &quot;the board&quot;&#xA;    }&#xA;&#xA;    /**&#xA;     * Used by the runner to keep track of the alien's energy.&#xA;     */&#xA;    double energy = 1.0;&#xA;&#xA;    /**&#xA;     * Moves the alien.&#xA;     *&#xA;     * @param surroundings The alien's surroundings. The first&#xA;     *  dimension is North–South, with index 0 being North. The second&#xA;     *  dimension is East–West, with index 0 being West.&#xA;     * @return A {@code Move} object representing the direction to&#xA;     *  move the alien&#xA;     */&#xA;    public abstract Move move(char[][] surroundings);&#xA;&#xA;    /**&#xA;     * Called when the alien is in battle.&#xA;     *&#xA;     * @param opponents The other aliens on this tile that need to be&#xA;     *  fought&#xA;     * @return The amount of energy to use in this battle&#xA;     */&#xA;    public abstract double attack(char[] opponents);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;100 instances of your class will be spawned in random locations on the board for each trial. Each alien class will be assigned a unique character to represent them on the board.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are a number of stock alien races that already inhabit Oizys:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Rocks: they do absolutely nothing and don't pose any sort of threat (i.e., they attack with 0 energy), but for some reason your generals don't know what rocks are, so they appear just like any other alien.&lt;/li&gt;&#xA;&lt;li&gt;Random Bears: they act randomly. They move in a random direction (including possibly not moving at all) and attack using a random portion of their energy.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;The Board&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Oizys is a toroidal planet, so the board will be side-looped on both edges. The width and height of the board will be equal to &lt;span class=&quot;math-container&quot;&gt;\$\left\lceil\sqrt s\right\rceil\$&lt;/span&gt;, where &lt;em&gt;s&lt;/em&gt; is the number of alien species. Each round, your aliens will have the option to move one tile horizontally and/or vertically with the &lt;code&gt;move&lt;/code&gt; method. This method takes a 3x3 &lt;code&gt;char[][]&lt;/code&gt; representing the alien's surroundings, with &lt;code&gt;a[0][0]&lt;/code&gt; being Northwest and &lt;code&gt;a[0][2]&lt;/code&gt; being Northeast, and returns a &lt;code&gt;Move&lt;/code&gt; enum. The possible &lt;code&gt;Move&lt;/code&gt; values are &lt;code&gt;NORTHWEST&lt;/code&gt;, &lt;code&gt;NORTH&lt;/code&gt;, &lt;code&gt;NORTHEAST&lt;/code&gt;, &lt;code&gt;WEST&lt;/code&gt;, &lt;code&gt;HOLD&lt;/code&gt;, &lt;code&gt;EAST&lt;/code&gt;, &lt;code&gt;SOUTHWEST&lt;/code&gt;, &lt;code&gt;SOUTH&lt;/code&gt;, and &lt;code&gt;SOUTHEAST&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Combat&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If two or more aliens attempt to move into the same tile, they will fight. What better opportunity to kill those annoying other aliens! Or maybe get killed yourself, who knows? Each alien starts with 1 energy, and uses it to fight other aliens. When aliens fight, they use the &lt;code&gt;attack&lt;/code&gt; method, which takes a &lt;code&gt;char[]&lt;/code&gt; representing their opponents and returns a &lt;code&gt;double&lt;/code&gt;, to determine how much energy they will use for that battle. The alien that uses the most energy wins, and the others die. In the case of a tie, the winner is determined by coin flip. An alien cannot use more energy than it has or it will die; neither can it use a negative amount of energy.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Five trials will be held, with each trial being scored by the portion of the aliens remaining that are your alien. These trials will be held on [1 month after the challenge is posted].&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Other Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;//codegolf.meta.stackexchange.com/q/1061/75524&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;Aliens attempting to alter field visibility/writability will be met with mysterious &lt;code&gt;SecurityException&lt;/code&gt;s.&lt;/li&gt;&#xA;&lt;li&gt;The order that aliens' methods are called is undefined, though there is a &lt;a href=&quot;https://docs.oracle.com/javase/specs/jls/se7/html/jls-17.html#jls-17.4.5&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;happens-before&lt;/em&gt;&lt;/a&gt; relationship between calls on successive rounds, as well as between aliens moving and those same aliens attacking each other.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="75524" LastEditorUserId="75524" LastEditDate="2018-11-21T16:39:57.067" LastActivityDate="2018-11-21T16:39:57.067" CommentCount="15" ContentLicense="CC BY-SA 4.0" />
  <row Id="16191" PostTypeId="2" ParentId="2140" CreationDate="2018-04-11T19:44:37.490" Score="0" Body="&lt;h1&gt;Count the Matches&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Given a stripped-down regular expression, estimate (rules below) the number of lower-ASCII-only strings that it matches fully (meaning it matches the whole string).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should handle the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Literals/sequencing&lt;/li&gt;&#xA;&lt;li&gt;Vertical bars &lt;code&gt;...|...&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Groups &lt;code&gt;(...)&lt;/code&gt; or &lt;code&gt;(?:...)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Special characters escaped with a preceding &lt;code&gt;\&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Character classes &lt;code&gt;[...]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Complemented classes &lt;code&gt;[^...]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The standard classes &lt;code&gt;.&lt;/code&gt;, &lt;code&gt;\d&lt;/code&gt;, &lt;code&gt;\w&lt;/code&gt;, &lt;code&gt;\s&lt;/code&gt;, &lt;code&gt;\D&lt;/code&gt;, &lt;code&gt;\W&lt;/code&gt;, and &lt;code&gt;\S&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The escape sequences &lt;code&gt;\f&lt;/code&gt;, &lt;code&gt;\n&lt;/code&gt;, &lt;code&gt;\r&lt;/code&gt;, &lt;code&gt;\t&lt;/code&gt;, and &lt;code&gt;\xhh&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The quantifiers &lt;code&gt;?&lt;/code&gt;, &lt;code&gt;{x}&lt;/code&gt;, and &lt;code&gt;{a,b}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Estimation Rules&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Literals&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Literals, obviously, match only one string.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;aaaaa --&amp;gt; 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Classes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The estimate for a class is the number of characters that it can match. If multiple are seen, then their individual counts can be multiplied. There are also the standard classes: &lt;code&gt;\d&lt;/code&gt; is &lt;code&gt;[0-9]&lt;/code&gt;, &lt;code&gt;\w&lt;/code&gt; is &lt;code&gt;[_A-Za-z\d]&lt;/code&gt;, and &lt;code&gt;\s&lt;/code&gt; is &lt;code&gt;[ \n\t\r]&lt;/code&gt;. &lt;code&gt;\D&lt;/code&gt;, &lt;code&gt;\W&lt;/code&gt;, and &lt;code&gt;\S&lt;/code&gt; are the complements of their lowercase versions.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a.b --&amp;gt; 127&#xA;\D --&amp;gt; 118&#xA;[a-gd-k] --&amp;gt; 11&#xA;[^\w$A] --&amp;gt; 64&#xA;[abc][xyz] --&amp;gt; 9&#xA;\d\d\d --&amp;gt; 1000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Switches&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Switches (vertical bars) should be estimated as the sum of the component expressions.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a|a --&amp;gt; 2&#xA;a|b --&amp;gt; 2&#xA;(0|1)[01] --&amp;gt; 4&#xA;0|1[01] --&amp;gt; 3&#xA;optional| --&amp;gt; 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Quantifiers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;With a static quantifier, you can treat it as a power function. With a variable quantifier, you can use the geometric sequence formula to get the estimate:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;a&lt;sub&gt;1&lt;/sub&gt;&lt;/em&gt; is the first term, in this case the estimate at the lower bound. &lt;em&gt;r&lt;/em&gt; is the common ratio, for which you should use the estimate for the group quantified. &lt;em&gt;n&lt;/em&gt; is the number of terms, which is the upper bound minus lower bound plus one for the quantifier.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[01]{10} --&amp;gt; 1024&#xA;.? --&amp;gt; 128&#xA;[01]{3,10} --&amp;gt; 2040&#xA;0|[12]{3} --&amp;gt; 9&#xA;(0|[12]){3} --&amp;gt; 27&#xA;\d{30,40} --&amp;gt; 99999999999000000000000000000000000000000&#xA;(?:a{2,3}){2,3} --&amp;gt; 12&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Shortest code in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="62402" LastEditorUserId="62402" LastEditDate="2018-04-12T17:27:34.887" LastActivityDate="2018-04-12T17:27:34.887" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="16194" PostTypeId="2" ParentId="2140" CreationDate="2018-04-12T10:55:42.110" Score="1" Body="&lt;h1&gt;Scoring a Game of Composite Boards &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/classification&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;classification&amp;#39;&quot; rel=&quot;tag&quot;&gt;classification&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;The Game&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given a board size &lt;em&gt;n&lt;/em&gt; which must be a &lt;a href=&quot;https://en.wikipedia.org/wiki/Composite_number&quot; rel=&quot;nofollow noreferrer&quot;&gt;composite number&lt;/a&gt;, the game is played on &lt;em&gt;m&lt;/em&gt; boards in parallel which correspond to the &lt;em&gt;m&lt;/em&gt; factors of &lt;em&gt;n&lt;/em&gt;, excluding 1 and &lt;em&gt;n&lt;/em&gt; itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;E.g. if &lt;em&gt;n&lt;/em&gt; = 12, we get the following 4 boards, where the same character represents the same field:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;01     012     0123     012345&#xA;23     345     4567     6789AB&#xA;45     678     89AB&#xA;67     9AB&#xA;89&#xA;AB&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Two players, &lt;em&gt;Zero&lt;/em&gt; and &lt;em&gt;One&lt;/em&gt;, take turns in writing a &lt;code&gt;0&lt;/code&gt; or &lt;code&gt;1&lt;/code&gt; respectively on an empty field, which makes that number appear on all boards at the corresponding field.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On each board their goal is to get more rows or columns filled with just their number than their opponent, resulting in the board being either a win for &lt;em&gt;Zero&lt;/em&gt;, a win for &lt;em&gt;One&lt;/em&gt; or a draw if both players fill the same number of rows or columns.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The game is won by the player who wins the majority of boards, or results in a draw if both players win the same number of boards.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Let's say we have the game &lt;code&gt;010111010100&lt;/code&gt; of size 12, which corresponds to the following boards:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;01&#xA;01&#xA;11 &amp;lt;- row for player One&#xA;01&#xA;01&#xA;00 &amp;lt;- row for player Zero&#xA;no columns for either player -&amp;gt; draw&#xA;&#xA;010&#xA;111 &amp;lt;- row for One&#xA;010&#xA;100&#xA;-&amp;gt; One wins this board&#xA;&#xA;0101&#xA;1101&#xA;0100&#xA; ^^&#xA; one column for each player -&amp;gt; draw&#xA;&#xA;010111&#xA;010100&#xA;^^^^&#xA;two columns for each player -&amp;gt; draw&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As player &lt;em&gt;One&lt;/em&gt; wins one board and player &lt;em&gt;Zero&lt;/em&gt; wins none, player &lt;em&gt;One&lt;/em&gt; wins the game.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The Task&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given a completed game as input, output which player won or whether the game was a draw. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the smallest answer in bytes in each language wins.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A one-dimensional array/list/string of two distinct values representing the fields of the boards when read left-to-right and top-to-bottom. You can assume that the input describes a valid game, that is the length will always be a composite number and the two values appear either the same number of times for even board lengths or with a difference of one for odd board lengths.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Three distinct constant values which correspond to &lt;em&gt;player Zero wins&lt;/em&gt;, &lt;em&gt;player One wins&lt;/em&gt; or &lt;em&gt;draw&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Draw:&lt;/em&gt; &lt;sub&gt;(All games of size &lt;em&gt;2*p&lt;/em&gt; where &lt;em&gt;p&lt;/em&gt; is prime necessarily result in a draw)&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0110&#xA;101010&#xA;11010010&#xA;010101010&#xA;11001111000100&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Zero wins:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;110110000&#xA;001001110101&#xA;1000110101011001&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;One wins:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;111100001&#xA;010111010100&#xA;1100111100010010&#xA;0111010001001101&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="56433" LastEditorUserId="56433" LastEditDate="2018-04-12T18:43:08.790" LastActivityDate="2018-04-12T18:43:08.790" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16196" PostTypeId="2" ParentId="5243" CreationDate="2018-04-12T18:29:18.657" Score="1" Body="&lt;h1&gt;50 rep for the shortest &quot;Hello, World!&quot; in Pepe&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If you can beat &lt;a href=&quot;https://codegolf.stackexchange.com/a/156764/72792&quot;&gt;this&lt;/a&gt;, I will pass a 50 bounty for you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't really believe a shorter solution exists - prove me wrong and you'll get it. My solution uses character constants which are probably the shortest way to push a number in Pepe. However, they are binary, so they span a lot of bytes - outgolfing it &lt;em&gt;might&lt;/em&gt; be possible. Another problem is that most function pop the stack by default...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If it will be really hard (it will), I'm might even pass a 100 rep bounty.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="72792" LastEditorUserId="72792" LastEditDate="2018-04-17T13:24:27.353" LastActivityDate="2018-04-17T13:24:27.353" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16200" PostTypeId="2" ParentId="5851" CreationDate="2018-04-13T01:21:02.370" Score="2" Body="&lt;p&gt;If your program isn't standard C++, then you shouldn't call it C++.  The name of the language dialect you're using then involves the compiler, so you might need to say&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;x86-64 &lt;code&gt;g++ -O0&lt;/code&gt; hackery, n bytes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;if you're doing something horrible like depending on g++'s current behaviour in un-optimized code of evaluating expressions in the return-value register, and depending on that to &quot;return&quot; a value without typing &lt;code&gt;return&lt;/code&gt;.  e.g. &lt;strong&gt;if your code &lt;em&gt;only&lt;/em&gt; works in debug-mode, you need to say so.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's expected that valid answers work for the &quot;right&quot; reason, and not just as a side effect of an implementation.  And that they'll continue to work when compiled with different surrounding code, or different options.  (IMO leaving out a &lt;code&gt;return&lt;/code&gt; for answers like &lt;code&gt;f(int n){++n;}&lt;/code&gt; is not an interesting source of byte savings.  Don't worry so much about competing with other languages, just make it the best C++ program you can.)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;For well-defined C++ dialects like GNU C++&lt;/strong&gt;, use its name if you take advantage of GNU extensions that ISO C++ doesn't have, like C99-style variable-length arrays (&lt;code&gt;int foo[n]&lt;/code&gt;) or whatever other feature that GNU C++ allows but ISO C++ doesn't.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;GNU C++, n bytes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is appropriate for stuff that GNU C++ documentation specifies will continue to work in future versions of g++, and isn't just a fluke.  C-like features such as accepting a &lt;code&gt;main&lt;/code&gt; with a default-&lt;code&gt;int&lt;/code&gt; return type would fall in this category.&lt;/p&gt;&#xA;" OwnerUserId="30206" LastActivityDate="2018-04-13T01:21:02.370" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16206" PostTypeId="1" CreationDate="2018-04-13T18:10:24.870" Score="9" ViewCount="220" Body="&lt;p&gt;I recently had a look through the &lt;a href=&quot;https://codegolf.stackexchange.com/tags?tab=new&quot;&gt;&quot;new&quot; tags&lt;/a&gt; and found that most of them apply to 1 or 2 questions, and aren't really necessary. Can we remove these obsolete tags? For reference, the tags I'm referring to are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/circuit-golf&quot;&gt;Circuit golf&lt;/a&gt;, which currently applies to 2 questions, one &lt;a href=&quot;https://codegolf.stackexchange.com/questions/159516/make-a-bcdto7seg-chip&quot;&gt;closed&lt;/a&gt; and the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/159522/make-a-128-64-divider&quot;&gt;other&lt;/a&gt; is due to be cleaned up in the next few days:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The system will automatically delete unlocked, unanswered questions that have negative score that are at least 30 days old &lt;sub&gt;&lt;a href=&quot;https://meta.stackexchange.com/a/5222/355458&quot;&gt;Source&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/computability-theory&quot;&gt;Computability Theory&lt;/a&gt;, with a single question with that tag. If this one isn't removed, it would greatly benefit a tag description&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/yabasic&quot;&gt;Yabasic&lt;/a&gt;, which seems as though it could be merged with the existing, and used, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/basic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;basic&amp;#39;&quot; rel=&quot;tag&quot;&gt;basic&lt;/a&gt; tag.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ubasic&quot;&gt;Ubasic&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/visual-basic&quot;&gt;Visual Basic&lt;/a&gt; are also very similar, with 1 and 2 questions respectively&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/mapping&quot;&gt;Mapping&lt;/a&gt;, where &lt;a href=&quot;https://codegolf.stackexchange.com/questions/156918/rgb-to-xterm-color-converter&quot;&gt;one&lt;/a&gt; of the tagged questions doesn't appear to apply, and the &lt;a href=&quot;https://codegolf.stackexchange.com/q/158044/66833&quot;&gt;other&lt;/a&gt; seems to be covered by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Thoughts on removing or keeping these tags?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Side note: Remember, users with more than 1,250 reputation and a total answer score of 5 or more on a given tag can vote on &lt;a href=&quot;https://codegolf.stackexchange.com/tags/synonyms&quot;&gt;tag synonyms&lt;/a&gt; for that tag, and a few synonyms are &lt;em&gt;still&lt;/em&gt; pending.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="46271" LastEditDate="2018-04-13T19:01:45.900" LastActivityDate="2018-05-10T18:18:09.513" Title="Can we remove some useless tags?" Tags="|discussion|tags|tag-synonyms|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="16207" PostTypeId="2" ParentId="16206" CreationDate="2018-04-13T19:21:19.350" Score="9" Body="&lt;p&gt;&lt;em&gt;Note, all of this is my opinion as a user, not as a moderator&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;A lot of these tags are certainly useless. But some of them aren't bad tags just because there aren't a lot of questions for them. Here are my thoughts on each tag individually:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/mathematics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;mathematics&amp;#39;&quot; rel=&quot;tag&quot;&gt;mathematics&lt;/a&gt; &lt;s&gt;Should definitely be a synonym of&lt;/s&gt; is actually now a synonym of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/circuit-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;circuit-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;circuit-golf&lt;/a&gt; Seems like a useful tag to me. It's a specialization of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;, but I can find several questions I think it would be appropriate on:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/69912/31716&quot;&gt;Build a 4-vertex Connectedness Tester using NAND gates&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/12229/31716&quot;&gt;Build a NAND gate using multiple NAND gates&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/24834/31716&quot;&gt;building circuit for divisibility by 3&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/24983/31716&quot;&gt;Build a 2-way universal logic processor using NAND logic gates&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Additionally, it's different than &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/logic-gates&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;logic-gates&amp;#39;&quot; rel=&quot;tag&quot;&gt;logic-gates&lt;/a&gt; because not all challenges related to logic gates are necessarily circuit golf challenges. This tag could use a better wiki, but I see no reason to remove it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/computability-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;computability-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;computability-theory&lt;/a&gt; This is another one that I think is useful. Granted, I'm not an expert in computability theory, so I don't know if there are many other questions this could be applied to. But as far as I can tell it fits the one question it's on, and there could be other questions with a similar theme to them. IMO, having only one relevant question is a good reason to &lt;em&gt;not add&lt;/em&gt; a tag, but not a good reason to remove it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/whatever-basic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;whatever-basic&amp;#39;&quot; rel=&quot;tag&quot;&gt;whatever-basic&lt;/a&gt; Absolutely agree with OP. All questions tagged with &lt;em&gt;something-basic&lt;/em&gt; should have the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/basic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;basic&amp;#39;&quot; rel=&quot;tag&quot;&gt;basic&lt;/a&gt; tag added, and the &lt;em&gt;something-basic&lt;/em&gt; tag removed. I wrote more on that subject &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11537/31716&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Update: Burninated!&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/mapping&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;mapping&amp;#39;&quot; rel=&quot;tag&quot;&gt;mapping&lt;/a&gt; Again, absolutely agree. What could this tag even possible be about? Geographical maps? Not worth having, and if it was it should be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geography&amp;#39;&quot; rel=&quot;tag&quot;&gt;geography&lt;/a&gt; instead. Dictionaries? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/data-structures&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;data-structures&amp;#39;&quot; rel=&quot;tag&quot;&gt;data-structures&lt;/a&gt; My vote? &lt;a href=&quot;https://ih1.redbubble.net/image.215635643.7844/raf,750x1000,075,t,9ec0d5:0d26d5c715.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;Burninate it&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Update: Burninated!&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="31716" LastEditDate="2018-05-10T18:18:09.513" LastActivityDate="2018-05-10T18:18:09.513" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="16209" PostTypeId="2" ParentId="12959" CreationDate="2018-04-14T08:19:09.727" Score="2" Body="&lt;p&gt;We should not consider every problem in this format in a running competition.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These competitions generally runs for only a few hours. After they end, they are just exercises. They may still maintain a scoreboard somewhere, but it is not much different from PPCG upvotes and reps.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some websites don't like people posting code in their own forums or something. But I assume that's just for not making it too easy. I doubt any of them will ban discussing the algorithms, or interfering with other websites, as long as it is not in a running competition. (If they really take it too seriously, it's really their bad.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If they are really running competitions, it's unlikely they will get it satisfying our rules and receive an answer in their acceptable languages in time. Some websites even have mechanisms for detecting cheating (mostly for similar submissions in their own sites, and has no effect on copying the algorithm, though). So I don't think it is too much of a problem if we didn't notice some of them, yet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It could also be a homework problem. But any problem could be a homework problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It could only annoy us for not satisfying the rules and unwilling to change. I don't know whether there is more we can / should do for this. One reason I could think of is copyright.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But if we don't find anything feasible, we could usually still just close them and/or asking for changes for the normal reasons. We could ask for its source and tell them copying the algorithm problems without modification is the reason it probably won't satisfy the rules, and sometimes uninteresting, but don't get distracted from the real problem, namely not satisfying the rules itself.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2018-04-14T08:19:09.727" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16210" PostTypeId="2" ParentId="2140" CreationDate="2018-04-14T08:21:06.680" Score="1" Body="&lt;h1&gt;Curve Matching&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; rel=&quot;tag&quot;&gt;array&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given two lists &lt;code&gt;a&lt;/code&gt;, &lt;code&gt;b&lt;/code&gt; of the same length &lt;code&gt;n&lt;/code&gt; find a third list &lt;code&gt;x&lt;/code&gt; of indices such that &lt;code&gt;a(i) = b(x(i))&lt;/code&gt; for all indices &lt;code&gt;i&lt;/code&gt; and &lt;code&gt;x(i) &amp;lt;= x(i+1)&lt;/code&gt; for all applicable indices &lt;code&gt;i&lt;/code&gt; and &lt;code&gt;x(1) = 1&lt;/code&gt; and &lt;code&gt;x(n) = n&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The list &lt;code&gt;x&lt;/code&gt; is not necessarily unique (for instance when &lt;code&gt;b&lt;/code&gt; has a run of two or more equal entries).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In the challenge description we use 1-based indices, but you can also use 0-based indices.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can assume that &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; contain integers, floating point numbers, characters or any other types that have a natural order and have at least 256 distinct values.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can assume that such an &lt;code&gt;x&lt;/code&gt; exists. (You can for instance assume that &lt;code&gt;a=[1,2,3], b=[1,2,1]&lt;/code&gt; are never passed as an input.)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;a = b = [1,2,3]&#xA;x = [1,2,3]&#xA;&#xA;a = [1,3,3], b = [1,1,3]&#xA;x = [1,3,3]&#xA;&#xA;a = [1,1,2,3,4,4], b = [1,2,2,3,3,4]&#xA;x = [1,1,2,4,6,6] or [1,1,3,5,6,6] etc&#xA;&#xA;a = [1,1,2,3,2,1,1], b = [1,2,1,2,3,2,1]&#xA;x = [1,3,4,5,6,7,7]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This challenge was inspired by &lt;a href=&quot;https://math.stackexchange.com/questions/2732895/find-optimal-xt-such-that-lt-rxt-as-close-as-possible&quot;&gt;this question&lt;/a&gt; on math.SE.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-04-14T08:21:06.680" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16215" PostTypeId="2" ParentId="16151" CreationDate="2018-04-14T18:56:37.453" Score="19" Body="&lt;h1&gt;Let's not do this&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As a bit of disclaimer, I am opposed to the whole idea of internet points and gamification, and privilege levels. All registered users should be equal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Other reasons than my personal opinions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Many of the privileges are actually very useful to the users and allowing them does not really cause any harm. Examples of this kind of privileges are seeing vote counts and deleted posts. Every registered user should have at least these rights. Deleted posts (like sandbox posts) contain useful historical information, and vote counts make it easier to read meta.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Reputation is not divided equally. It would be logical to automatically give reputation for participation at our site, but unfortunately this is not the case. Those who post first are upvoted the most, and many times answering an old question does not provide any reputation at all. &lt;strong&gt;The system is inherently flawed.&lt;/strong&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This site is not as popular as Stack Overflow. Comparing our privilege levels to theirs is not fair.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;What could be possible is to heighten the reputation levels of moderation privileges such as question deletion. However, I don't see how that would be useful as compared to the current situation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;As I think that the current system is better than the new, we maximize the utility we gain by delaying the raising as long as possible.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="66323" LastEditorUserId="66323" LastEditDate="2018-04-14T20:24:57.600" LastActivityDate="2018-04-14T20:24:57.600" CommentCount="19" ContentLicense="CC BY-SA 3.0" />
  <row Id="16217" PostTypeId="2" ParentId="10024" CreationDate="2018-04-15T00:36:44.240" Score="7" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;As per this feature request: &lt;a href=&quot;https://meta.stackexchange.com/q/285838/&quot;&gt;Stop expanding tabs into four spaces&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;amp;#9;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Note that this only works if you put the code within a &lt;code&gt;&amp;lt;pre&amp;gt;&amp;lt;code&amp;gt;&lt;/code&gt; block, which means you also have to escape &lt;code&gt;&amp;lt;&lt;/code&gt; with &lt;code&gt;&amp;amp;lt;&lt;/code&gt; (and &lt;code&gt;&amp;amp;&lt;/code&gt; with &lt;code&gt;&amp;amp;amp;&lt;/code&gt; in certain cases), so it's still annoying, but if you do a find/replace on your code, you can make it work.&lt;/p&gt;&#xA;&lt;p&gt;If you really need to display tabs correctly, this workaround helps.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="79485" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-04-15T00:36:44.240" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="16219" PostTypeId="2" ParentId="2140" CreationDate="2018-04-15T14:03:28.990" Score="2" Body="&lt;h1&gt;Ordering the integer arrays &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;So, we have managed to &lt;a href=&quot;https://codegolf.stackexchange.com/q/93441/41024&quot;&gt;print all integers&lt;/a&gt;. Yay! The next step is to extend this to the set of integer arrays. An integer array is an ordered array that only consists of integers. As in the linked challenge, integers can be negative too, but that should be out of the way now that we have found a way to order them. However, in this challenge, arrays of all lengths (&lt;strong&gt;[0, ∞)&lt;/strong&gt;) must be accounted for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that you don't necessarily have to print the arrays. You can do one of these things:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take an index (0- or 1-based) and return an integer array. In this case, your solution must be bijective from the natural numbers starting with the index base to the set of integer arrays.&lt;/li&gt;&#xA;&lt;li&gt;Take an integer array and return an index (0- or 1-based). This is essentially the inverse of the previous case, so your solution must be bijective from the set of integer arrays to the natural numbers starting with the index base you have chosen. If your language supports variadic functions, you can take the array as multiple integer arguments instead.&lt;/li&gt;&#xA;&lt;li&gt;Print all possible integer arrays. Note that every possible integer array must be eventually printed. If an array will be printed after infinite time, then it will not be eventually printed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The arrays can be in any native format that represents an ordered collection.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In case you choose to print to an output stream, the output format is as following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Integers must be in decimal (digits &lt;code&gt;0123456789&lt;/code&gt;) or your language's native format.&lt;/li&gt;&#xA;&lt;li&gt;The minus sign's representation must be consistent and one of &lt;code&gt;-&lt;/code&gt; or your language's native minus sign. It must be prefixed to its corresponding number, unless your language's native integer format happens to have it at other positions too. However, the minus sign must be adjacent to at least one of its corresponding integer's digits.&lt;/li&gt;&#xA;&lt;li&gt;The separators between integers and between arrays must be consistent.&lt;/li&gt;&#xA;&lt;li&gt;You can output any prefix as long as it's consistent, but you don't have to.&lt;/li&gt;&#xA;&lt;li&gt;The output should not have any ambiguities. For that reason, you must specify the separator between integers and the separator between arrays. Also, if you don't specify any of those, the number format's default is decimal with digits &lt;code&gt;0123456789&lt;/code&gt;, the minus sign's default is &lt;code&gt;-&lt;/code&gt; and its default position is being prefixed, and no output prefix is assumed.&lt;/li&gt;&#xA;&lt;li&gt;You are allowed to output negative zero.&lt;/li&gt;&#xA;&lt;li&gt;If you want, you can output floating-point numbers with the fractional part be 0. This can be inconsistent, however it should be specified in the post.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest solution wins! However, don't let that bring you down; if your solution is way longer than others' but in a unique language, then that's an achievement!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sandbox questions&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the output stream text format too lenient? Doesn't seem like it.&lt;/li&gt;&#xA;&lt;li&gt;Should I add a link to the standard loopholes? I feel like that won't do much.&lt;/li&gt;&#xA;&lt;li&gt;Are the tags good enough?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2018-04-15T15:15:36.973" LastActivityDate="2018-04-15T15:15:36.973" CommentCount="13" ContentLicense="CC BY-SA 3.0" />
  <row Id="16220" PostTypeId="5" CreationDate="2018-04-15T14:25:26.667" Score="0" Body="" OwnerUserId="-1" LastEditorUserId="-1" LastEditDate="2018-04-15T14:25:26.667" LastActivityDate="2018-04-15T14:25:26.667" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16221" PostTypeId="4" CreationDate="2018-04-15T14:25:26.667" Score="0" Body="For questions about challenges and rules related to quines. A quine is a program that outputs its own source code. It must be non-empty, and cannot read its own source code or take user input." OwnerUserId="79857" LastEditorUserId="8478" LastEditDate="2018-04-15T16:05:19.843" LastActivityDate="2018-04-15T16:05:19.843" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16223" PostTypeId="1" AcceptedAnswerId="16229" CreationDate="2018-04-16T04:25:23.373" Score="13" ViewCount="201" Body="&lt;p&gt;There's a lot of questions that result in code that refers to itself. Typically these questions get assigned the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; tag, though it's not quite applicable in some cases. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I propose a new tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-referential&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-referential&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-referential&lt;/a&gt;, which is applied to questions where the answers in someway refer to their characteristics, such as length or characters. While there's some overlap with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;, I believe this can be reconciled by having &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; refer to challenges that have to output or generates versions of themselves, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/161990/quine-of-orders&quot;&gt;permutations&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44915/print-out-the-first-n-characters-of-your-code&quot;&gt;sections&lt;/a&gt;, or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/16021/print-your-code-backwards-reverse-quine&quot;&gt;backwards&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some questions that would benefit from adding the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-referential&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-referential&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-referential&lt;/a&gt; tag (and maybe removing the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; tag):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/160646/output-your-score&quot;&gt;Output your score!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/121056/76162&quot;&gt;Output with the same length as the code&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/59436/76162&quot;&gt;Create output twice the length of the code&lt;/a&gt; and other variants &lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/12368/76162&quot;&gt;Print every character your program doesn't have&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/67921/76162&quot;&gt;What is the smallest positive base 10 integer that can be printed by a program shorter (in characters) than itself?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Something like the &lt;a href=&quot;https://codegolf.stackexchange.com/q/11370/76162&quot;&gt;self-identifying quine&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/q/12368/76162&quot;&gt;print every character you program doesn't have&lt;/a&gt; might get both tags.&lt;/p&gt;&#xA;" OwnerUserId="76162" LastEditorUserId="68942" LastEditDate="2021-06-03T03:17:01.540" LastActivityDate="2021-06-03T03:17:01.540" Title="New Tag Proposal: Self-Referential" Tags="|feature-request|status-completed|tags|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="16229" PostTypeId="2" ParentId="16223" CreationDate="2018-04-16T20:25:22.467" Score="20" Body="&lt;h1&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-referential&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-referential&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-referential&lt;/a&gt; would be strictly weaker than &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; should only be used for tasks involving the actual manipulation of the program's source, which is not required for the challenges linked.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While &quot;Output with the same length as the code&quot; could &lt;em&gt;theoretically&lt;/em&gt; be done by using a standard extensible quine to get the source, computing the length of the source and using that to generate a string, it is unlikely that would be competitive. Because it is not the only viable approach to solving the challenge, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-referential&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-referential&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-referential&lt;/a&gt; is more appropriate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This distinction seems useful to make.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastActivityDate="2018-04-16T20:25:22.467" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16230" PostTypeId="1" AcceptedAnswerId="16235" CreationDate="2018-04-17T11:30:12.527" Score="11" ViewCount="187" Body="&lt;p&gt;Recently, I flagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/161571/block-rearrangement#comment391412_161571&quot;&gt;this comment&lt;/a&gt; as &lt;em&gt;no longer needed&lt;/em&gt;, since it has been rightfully copy-pasted into the question body. However, the flag got declined along with flags on two other comments which can now be answered by the post itself (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/161571/block-rearrangement#comment391410_161571&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/161571/block-rearrangement#comment391411_161571&quot;&gt;2&lt;/a&gt;). I have casted numerous flags in similar situations and they have been voted on as helpful, so can a moderator please elaborate on why those were declined?&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="62402" LastEditDate="2018-04-17T13:23:25.680" LastActivityDate="2018-04-17T14:14:07.347" Title="Declined flag on a comment which was copy-pasted into the question's body" Tags="|discussion|flags|declined-flags|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="16231" PostTypeId="2" ParentId="14955" CreationDate="2018-04-17T12:12:19.277" Score="2" Body="&lt;p&gt;In your specific case, the question had several problems that probably should make it closed. Users are more likely only unsure of whether it is salvageable, and if not, which one is the real unsalvageable reason to close it. And they didn't find the answer from your replies in the comments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now I get the idea that this model is stronger than a Turing machine, as it can compute a &quot;limit&quot; in infinite time. If this is exactly your intention and the reason you find it interesting, better answer this to the question &quot;why ask this&quot;. And explain this exactly, instead of linking to uncommented source code on external sites. And other users may help cleaning up the other parts. (But if you intend to revive this question, better use the sandbox.) But it has too many other problems that this looks like a coincidence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an example, x86 is an instruction set. There is no such thing as 128-bit x86, because nobody has invented the opcodes for the new instructions yet, even though your idea about what it is like might not be too far. Depending on what you intended to mean exactly, this might be easy to fix, or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some obvious options are to add a full specification of x86 with variable register size, or simply change n to an input and not run into the problem of defining number types. The former needs a lot of work and may not make it on-topic. The later changes the question significantly and would make people rethink whether it is a duplicate. Nobody is likely going to do these unless they are sure their interpretation is right.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In your situation, you shouldn't consider it a minor, irrelevant, technical problem that could be ignored. It is a probably minor problem that makes the question in its current form should absolutely be closed with no excuse. It's only less often so because editing it could be easy, if someone else knows your intention. But if there are 5 different parts in the question that it is 80% &quot;obviously&quot; sure what it means each, another single interpretation that is only 35% sure, completely changing the problem and making the 5 parts irrelevant is more likely, even if it assumes you have made more mistakes similar to the x86 problem while an interpretation without those is possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Worse, that you said unclear not seeming to mean &quot;don't know what the question mean&quot;, so I would easily consider my interpretation overthinking, and you agree the user who edited it know what it means and did it right.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, it is just unclear. Not answering the questions only leaves it in an unclear state, however big or small the problems are. Better firstly make it clear what's the most important part and why a rule must be there than insisting on everything. Acknowledging which users interpreted it correctly or wrongly could help further. Also note that even if everybody knows your intention, it could still be difficult to get the rules exactly right for some types of challenges.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2018-04-17T12:12:19.277" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16232" PostTypeId="2" ParentId="5243" CreationDate="2018-04-17T12:18:06.140" Score="4" Body="&lt;h1&gt;100 rep for a Haskell answer to &quot;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/162231/make-me-some-curry&quot;&gt;Make me some curry&lt;/a&gt;&quot;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'll offer a 100 rep bounty for a Haskell answer to the above mentioned challenge. I might offer more than 100 rep for an interesting answer (for example not just copying the Idris answer or a clever TH answer).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given that tuples are tricky with Haskell and that you can't use lists (can only contain one type), feel free to define your own data-type or use an appropriate one from an existing library on hackage.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; This bounty is tied to the one below, if someone gets the second bounty I will delete this one!&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;200 rep for a low-level answer (machine language, C or similar)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'd love to see an answer that's really low-level, that's the main reason I allowed taking the number of arguments as input because otherwise it seems impossible.&lt;/p&gt;&#xA;" OwnerUserId="48198" LastActivityDate="2018-04-17T12:18:06.140" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="16234" PostTypeId="2" ParentId="2140" CreationDate="2018-04-17T13:42:39.470" Score="-4" Body="&lt;h2&gt;No strings code bowling&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I created this challenege idea with @redwolfprograms. In the challenge, you would create the longest program possible (code-bowling) it can do anything, but it cannot:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Contain any strings, or quotation marks/apostrophes/backticks&lt;/li&gt;&#xA;&lt;li&gt;Contain the same alphanumeric byte more than twice&lt;/li&gt;&#xA;&lt;li&gt;Conatin the same non alphanumeric byte more than three times&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79901" LastEditorUserId="79901" LastEditDate="2018-04-18T13:19:57.913" LastActivityDate="2018-04-18T13:19:57.913" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="16235" PostTypeId="2" ParentId="16230" CreationDate="2018-04-17T14:14:07.347" Score="8" Body="&lt;p&gt;I've handled those three flags nine days ago.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't actually remember declining them, but looking at the comments and the post, it was clearly done by mistake. The comments should have been deleted, the flags marked helpful.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sorry about that.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2018-04-17T14:14:07.347" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="16237" PostTypeId="1" CreationDate="2018-04-18T00:27:35.850" Score="11" ViewCount="260" Body="&lt;h2&gt;Voting while participating&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;As it's a contest it doesn't make sense to vote for other answers - does it?&lt;/li&gt;&#xA;&lt;li&gt;Should I vote for the puzzle? Isn't the participation already a vote?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Voting while not participating&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Beside the code-length, what are other usual motives to vote?&lt;/li&gt;&#xA;&lt;li&gt;Considering that i have not a glimpse of understanding of most of the used programming languages, how can I vote objectively?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79948" LastEditorUserId="31516" LastEditDate="2018-04-18T12:48:49.720" LastActivityDate="2018-04-18T20:00:37.007" Title="Newbie question about voting" Tags="|discussion|new-users|voting|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="16238" PostTypeId="2" ParentId="2140" CreationDate="2018-04-18T02:11:01.667" Score="0" Body="&lt;h2&gt;Rock, Paper, Scissors, Load, Shoot, Block, Mirror, Plasma-shot, Ammo-block, Punch, Bazooka, Super load, and so on and so forth&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is an abomination of a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenge.&#xA;Two bots are fighting to the death, but the rules keep changing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each turn both bots have the same set of 3 random actions from this list as their input:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;L - Load. Gives you 1 ammo.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;S - Shoot. Costs 1 ammo, you win.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;B - Block. Prevents the opponent from winning this turn&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;P - Paper. If your opponent chooses the first option in the list, you win.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;C - Scissors. If your opponent chooses the second option in the list, you win.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;R - Rock. If your opponent chooses the third option in the list, you win.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;H - Punch. You win.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;A - Plasma. Costs 2 ammo, you win&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;O - Ammo Block. Costs 1 ammo, prevent the opponent from winning this turn&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Z - Bazooka. Costs 3 ammo, you win. This cannot be blocked.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;E - Ammo Paper. Costs 1 ammo, if your opponent chooses the first option in the list, you win. &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;X - Ammo Scissors. Costs 1 ammo, if your opponent chooses the second option in the list, you win. &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;K - Ammo Rock. Costs 1 ammo, if your opponent chooses the third option in the list, you win. &lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;U - Super Load. Gives you 2 ammo.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;D - Defeat. Instantly Lose.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;I - Strike. Prevent your opponent from winning. If your opponent wasn't trying &#xA;  to win, you win.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;N - Nothing. Does nothing.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;M - Mirror. If your opponent would win, you win instead.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;W - Wild. Allows you to do anything.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;T - Take. Take 1 ammo from your opponent.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;G - Gloat. Win if you have more ammo than your opponent&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;J - Joker. Does a random action.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Q - Quintuple Load. Gives you 5 ammo.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Y - Lucky. 50/50 chance of winning or losing.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;V - Victory. Win the game, unblockable. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Each bot must choose 1 action to do. Actions happen simultaneously, and if two players win at the same time, then the player who spent more ammo to win is the winner (So a Punch would lose to a Plasma).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;NOTES&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each bot is played 1000 times against every other bot. The winner is the bot with the most total wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The 3 actions are selected before each turn. Actions can appear multiple times (&quot;PPB&quot; is possible).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your bot can see what the opponent did, the set of actions available, ammo counts, and move histories.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you don't have enough ammo, then your action is treated as an N.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you choose an invalid action, then you lose.&lt;/p&gt;&#xA;" OwnerUserId="79953" LastEditorUserId="79953" LastEditDate="2018-04-18T20:46:58.930" LastActivityDate="2018-04-18T20:46:58.930" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="16240" PostTypeId="2" ParentId="16237" CreationDate="2018-04-18T07:36:06.990" Score="14" Body="&lt;h1&gt;&lt;em&gt;Do not&lt;/em&gt; vote for code length!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Code length is not a good way to determine what to vote for, because it isn't a good indicator of quality. A golflang submission can be thoroughly uninteresting and still beat out the most clever and well-golfed Python or Haskell submission out there.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, golfing languages can have clever tricks as well (abusing the built-ins well is no easy task), and you should vote on them if they do, but don't do it merely because it's short.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/V2Exf.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/V2Exf.png&quot; alt=&quot;Freehand red circles&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By voting, you help to indicate that a submission is high quality. Quality is, of course, subjective—if it wasn't, Stack Exchange wouldn't need humans to vote. But many of the following things, to me, can make an answer good:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An impressively high-scoring solution, especially when a lot of work went into creating such a solution, such as &lt;a href=&quot;https://codegolf.stackexchange.com/a/62812/61384&quot;&gt;brute-forcing for an optimal program&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/a/74372/61384&quot;&gt;doing lots of math&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;An impressively thorough explanation, such as &lt;a href=&quot;https://codegolf.stackexchange.com/a/57706/61384&quot;&gt;many of Martin Ender's esolang answers&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A valid answer to an impressively difficult challenge, such as &lt;a href=&quot;https://codegolf.stackexchange.com/q/11880/61384&quot;&gt;the Quest for Tetris Project&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;An answer to a nontrivial challenge in a language that is very hard to use, such as &lt;a href=&quot;https://codegolf.stackexchange.com/a/156271/61384&quot;&gt;Hexagony&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/144386/61384&quot;&gt;Brain-Flak&lt;/a&gt;, or &lt;a href=&quot;https://codegolf.stackexchange.com/a/55656/61384&quot;&gt;Malbolge&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;You can only be a good judge of the quality of a submission if you understand it.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Of course, what you vote for is up to you (short of voting fraud). Try not to let the existing votes on an answer influence your own.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="61384" LastEditDate="2018-04-18T20:00:37.007" LastActivityDate="2018-04-18T20:00:37.007" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="16241" PostTypeId="2" ParentId="16237" CreationDate="2018-04-18T08:19:01.733" Score="17" Body="&lt;h2&gt;Voting while participating&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;As it's a contest it doesn't make sense to vote for other answers - does it?&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is a contest, but I like to think of it as a challenge. And everyone participates individually on their own level. You'll see that many users help others golf their submissions in the comments. There's even a &lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/58/sportsmanship&quot;&gt;Sportsmanship&lt;/a&gt; badge rewarded to people that vote on other answers.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Should I vote for the puzzle? Isn't the participation already a vote?&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You should upvote the puzzle if you think it's an interesting and well specified challenge, and downvote if it's uninteresting or badly specified. Note that it's perfectly fine to not leave a vote, if you think the challenge is just mediocre, or you don't have the required background to understand if it's a good one or not.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Voting while not participating&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Beside the code-length, what are other usual motives to vote?&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Don't vote for code-length alone, but rather the approaches they use or how well golfed they are. As you say, you don't understand most of the languages used here (neither do I). I would recommend you read the explanations (if provided), and judge if you think it's a good answer based on that. I often upvote well explained answers, even if they are not the shortest, because it shows that a lot of effort was put into it.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Considering that i have not a glimpse of understanding of most of the used programming languages, how can I vote objectively?&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I suggest you vote based on the explanations in this case. If none is provided, or you don't understand it, then don't vote.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="31516" LastActivityDate="2018-04-18T08:19:01.733" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16242" PostTypeId="2" ParentId="2140" CreationDate="2018-04-18T15:02:34.020" Score="0" Body="&lt;h2&gt;Cleanup after Easter&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As most people (probably) know, Easter was about a month ago. But around the community park, there're still some eggs hidden! Can you build a (Javascript only, please) bot to help us find them?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The Course:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The bots will compete on a 201 by 201 field, with coordinates ranging from (-100,-100) to (100,100). All bots will start at (0,0) and will begin. The course has 3 types of areas: wall, egg, and grass.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Finding Eggs:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will build a function to find the Easter eggs. To see, use the function &lt;code&gt;checkZone(x,y)&lt;/code&gt;. The ouputs are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0=Grass&#xA;1=Wall&#xA;2=Egg&#xA;3=Bot&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;To find a player, use &lt;code&gt;findPlayer(name)&lt;/code&gt; (Returns coordinates array) or &lt;code&gt;detectPlayers(x,y)&lt;/code&gt; (Returns name or &lt;code&gt;null&lt;/code&gt;). If your bot lands on a spot with an egg, it will not be able to pick it up until it uses the function &lt;code&gt;fetchEgg()&lt;/code&gt;. If there is not an egg, your turn will stop.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Moving:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moving is done by returning a string. This string can be &lt;code&gt;north&lt;/code&gt;, &lt;code&gt;south&lt;/code&gt;, &lt;code&gt;east&lt;/code&gt;, &lt;code&gt;west&lt;/code&gt;, or &lt;code&gt;none&lt;/code&gt;. Assume that directions are like a compass placed on a Cartesian plane:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;North=Y+1&#xA;East=X+1&#xA;South=Y-1&#xA;West=X-1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Winning:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When all eggs are found, the game is over. If you move North to an egg, you must pick it up on the next turn in order to obtain it. If you try to move into a wall, nothing will happen. To get your current position, use &lt;code&gt;getLocation()&lt;/code&gt;, which returns an array &lt;code&gt;[x,y]&lt;/code&gt;. Use &lt;code&gt;getBasket()&lt;/code&gt; to get how many eggs you have. The course will be designed so that all eggs are accessible, but some may be hard to get. If an egg is found by two bots in the same turn, each bot get 0.5 added to their basket, as they split the reward.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Functions list:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;checkZone(x,y): Returns an integer, takes 2 integers as parameters between -100 and 100&#xA;    0=Empty&#xA;    1=Wall&#xA;    2=Egg&#xA;findPlayer(name): Takes string as parameter, returns player's position as an array of integers or null if player is nonexistant&#xA;detectPlayers(x,y):  Returns an array of player names, takes 2 integers as parameters between -100 and 100&#xA;fetchEgg(): Fetches egg in current position if exists&#xA;getLocation(): Returns array with x and y coordinates&#xA;getBasket(): Returns number of eggs in basket&#xA;move functions: Returns true or ends turn (Ends turn if cannot move)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function rabbitInDisguise() {&#xA;    var loc = getLocation();&#xA;    if (getLocation(loc[0], loc[1]) == 2) {&#xA;        fetchEgg();&#xA;    } else {&#xA;        if (getLocation(loc[0], loc[1] + 1)) {&#xA;            moveNorth();&#xA;        } else {&#xA;            moveEast();&#xA;        }&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;UPDATE 1:&lt;/strong&gt; Added &lt;code&gt;findPlayer(name)&lt;/code&gt; and &lt;code&gt;detectPlayers(x,y)&lt;/code&gt; functions, made locating functions &quot;background&quot;, and added simultaneous egg finding rules&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;UPDATE 2:&lt;/strong&gt; Added functions list&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2018-08-27T00:40:49.780" LastActivityDate="2018-08-27T00:40:49.780" CommentCount="34" ContentLicense="CC BY-SA 4.0" />
  <row Id="16245" PostTypeId="2" ParentId="2140" CreationDate="2018-04-18T16:09:28.847" Score="0" Body="&lt;h1&gt;Clebsch-Gordon coefficients&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Clebsch-Gordon coefficients are numbers that arise when adding two quantum mechanical angular momenta. Angular momentum is a vector in three-space and can be described by two numbers &lt;em&gt;j&lt;/em&gt; and &lt;em&gt;m&lt;/em&gt;. The magnitude of the momentum can be determined by &lt;em&gt;j&lt;/em&gt; and its z-component can be determined by &lt;em&gt;m&lt;/em&gt; (more on this below).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For quantum mechanical particles, &lt;em&gt;j&lt;/em&gt; can only take on nonnegative integer or positive half integer values (&lt;code&gt;0, 1/2, 1, 3/2, 2...&lt;/code&gt;). Additionally, its z-component &lt;em&gt;m&lt;/em&gt; can only take on values between &lt;em&gt;j&lt;/em&gt; and &lt;em&gt;-j&lt;/em&gt; inclusive in integer steps. For example if  &lt;em&gt;j&lt;/em&gt;=&lt;strong&gt;1&lt;/strong&gt;, &lt;em&gt;m&lt;/em&gt; can hold values &lt;strong&gt;-1&lt;/strong&gt;, &lt;strong&gt;0&lt;/strong&gt; or &lt;strong&gt;1&lt;/strong&gt;. If &lt;em&gt;j&lt;/em&gt;=&lt;strong&gt;3/2&lt;/strong&gt;, &lt;em&gt;m&lt;/em&gt; can have values &lt;strong&gt;-3/2&lt;/strong&gt;, &lt;strong&gt;-1/2&lt;/strong&gt;, &lt;strong&gt;1/2&lt;/strong&gt; or &lt;strong&gt;3/2&lt;/strong&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If an angular momentum has magnitude &lt;em&gt;j&lt;/em&gt; and z component &lt;em&gt;m&lt;/em&gt; we say it is in the state |&lt;em&gt;j&lt;/em&gt;,&lt;em&gt;m&lt;/em&gt;⟩. The state can be thought of as a column vector in an infinite dimensional vector space (Hilbert space). It is infinite because there is no upper bound for the value &lt;em&gt;j&lt;/em&gt; can take on. From now on when I refer to an angular momentum I will just use it's state to reference it. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;strong&gt;j&lt;sup&gt;2&lt;/sup&gt;&lt;/strong&gt; and &lt;strong&gt;j&lt;sub&gt;z&lt;/sub&gt;&lt;/strong&gt; operators&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I have picked the states |&lt;em&gt;j&lt;/em&gt;,&lt;em&gt;m&lt;/em&gt;⟩ such that they are eigenvectors of the operators &lt;strong&gt;j&lt;sup&gt;2&lt;/sup&gt;&lt;/strong&gt; and &lt;strong&gt;j&lt;sub&gt;z&lt;/sub&gt;&lt;/strong&gt;. These operators can be thought of as matrices in the infinite dimensional vector space. Eigenvectors of &lt;strong&gt;j&lt;sup&gt;2&lt;/sup&gt;&lt;/strong&gt; have eigenvalue equal to a states total angular momentum squared. The eigenvalue of a state operated on by &lt;strong&gt;j&lt;sub&gt;z&lt;/sub&gt;&lt;/strong&gt; is the state's z-component of its angular momentum. The eigenvalues for a state |&lt;em&gt;j&lt;/em&gt;,&lt;em&gt;m&lt;/em&gt;⟩ are shown below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;j&lt;sup&gt;2&lt;/sup&gt;&lt;/strong&gt;|&lt;em&gt;j&lt;/em&gt;,&lt;em&gt;m&lt;/em&gt;⟩=&lt;em&gt;j&lt;/em&gt;(&lt;em&gt;j&lt;/em&gt;+1)|&lt;em&gt;j&lt;/em&gt;,&lt;em&gt;m&lt;/em&gt;⟩&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;j&lt;sub&gt;z&lt;/sub&gt;&lt;/strong&gt;|&lt;em&gt;j&lt;/em&gt;,&lt;em&gt;m&lt;/em&gt;⟩=&lt;em&gt;m&lt;/em&gt;|&lt;em&gt;j&lt;/em&gt;,&lt;em&gt;m&lt;/em&gt;⟩.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In words, the square of the magnitude of the angular momentum of state |&lt;em&gt;j&lt;/em&gt;,&lt;em&gt;m&lt;/em&gt;⟩ is &lt;em&gt;j&lt;/em&gt;(&lt;em&gt;j&lt;/em&gt;+1) and the z-component of the angular momentum of this state is simply &lt;em&gt;m&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Side notes which do not affect the challenge and you can choose to ignore:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We could have just as easily chosen x or y instead of z but the &lt;strong&gt;j&lt;sub&gt;i&lt;/sub&gt;&lt;/strong&gt; operators do not commute so we must decide on one only to create our basis vectors. All &lt;strong&gt;j&lt;sub&gt;i&lt;/sub&gt;&lt;/strong&gt; commute with &lt;strong&gt;j&lt;sup&gt;2&lt;/sup&gt;&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;I have set ħ=1.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Now let's say we have a composite angular momentum with total angular momentum &lt;em&gt;J&lt;/em&gt; and z-component &lt;em&gt;M&lt;/em&gt; made up of two individual angular momenta. As you might have guessed, this is the state |&lt;em&gt;J&lt;/em&gt;,&lt;em&gt;M&lt;/em&gt;⟩. We can make equivalent operators &lt;strong&gt;J&lt;sup&gt;2&lt;/sup&gt;&lt;/strong&gt;= and &lt;strong&gt;J&lt;sub&gt;z&lt;/sub&gt;&lt;/strong&gt;. In order for |&lt;em&gt;J&lt;/em&gt;,&lt;em&gt;M&lt;/em&gt;⟩ to be an eigenvector of both of these operators is equal to a linear combination of outer products between states |&lt;em&gt;j&lt;sub&gt;1&lt;/sub&gt;&lt;/em&gt;,&lt;em&gt;m&lt;sub&gt;1&lt;/sub&gt;&lt;/em&gt;⟩ and |&lt;em&gt;j&lt;sub&gt;2&lt;/sub&gt;&lt;/em&gt;,&lt;em&gt;m&lt;sub&gt;2&lt;/sub&gt;&lt;/em&gt;⟩.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the angular momenta that compose |&lt;em&gt;J&lt;/em&gt;,&lt;em&gt;M&lt;/em&gt;⟩ are in states |&lt;em&gt;j&lt;/em&gt;&lt;sub&gt;1&lt;/sub&gt;,&lt;em&gt;m&lt;/em&gt;&lt;sub&gt;1&lt;/sub&gt;⟩ and |&lt;em&gt;j&lt;/em&gt;&lt;sub&gt;1&lt;/sub&gt;,&lt;em&gt;m&lt;/em&gt;&lt;sub&gt;1&lt;/sub&gt;⟩...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/BMHur.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/BMHur.png&quot; alt=&quot;Clebsch-Gordon explicit formula&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Image from wikipedia.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is an early stage of writing the challenge, but feedback is welcome. If you are familiar with Clebsch-Gordon coefficients I would appreciate any input. They are important in group theory but I am less familiar with that side of them, so if you have a good way of explaining them in that context that would be helpful.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I plan on asking for the square of the coefficients so as not to worry about floating point numbers. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should I require sign of the coefficients as well or just magnitude?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="75553" LastEditorUserId="75553" LastEditDate="2018-04-26T23:03:25.117" LastActivityDate="2018-04-26T23:03:25.117" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="16249" PostTypeId="2" ParentId="2140" CreationDate="2018-04-19T13:24:36.767" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/179375/countries-by-area&quot;&gt;Countries by Area&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="71398" LastEditorUserId="71398" LastEditDate="2019-02-01T17:11:59.203" LastActivityDate="2019-02-01T17:11:59.203" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16250" PostTypeId="1" CreationDate="2018-04-19T18:03:53.747" Score="14" ViewCount="391" Body="&lt;p&gt;In a &lt;a href=&quot;https://codegolf.stackexchange.com/q/162710/31516&quot;&gt;recent challenge&lt;/a&gt;, almost all answers use an algorithm that yields the wrong results due to floating point errors. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is/was not unclear, but there was no test case that led to the wrong results when most answers were posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, most of the answers are invalid, and should therefore by community consensus be deleted until they are fixed. However, asking a moderator to delete almost all answers on a challenge doesn't seem like the right course of action.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;What to do?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Note: Most (not all) answers got comments saying they were invalid 15-25 hours ago. They are not yet updated.&lt;/p&gt;&#xA;" OwnerUserId="31516" LastActivityDate="2018-04-19T20:13:15.867" Title="What to do when almost all answers are wrong?" Tags="|discussion|answers|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16251" PostTypeId="2" ParentId="16250" CreationDate="2018-04-19T18:15:03.240" Score="-6" Body="&lt;p&gt;&lt;strong&gt;I think the challenge &lt;em&gt;is&lt;/em&gt; unclear.&lt;/strong&gt; If you want to avoid that people use floating point arithmetic that might result in rounding errors this should explicitly be written as a requirement, and if it is ok to find results up to floating point inaccuracies it should also be mentioned. This challenge didn't do either of that. The fact that there are so many &quot;wrong&quot; answers means that the challenge just was not good enough. And this would most certainly have been prevented if the challenge was submitted to the sandbox in the first place. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;What to do?&lt;/strong&gt; In my opinion it doesn't make any sense to &lt;em&gt;change&lt;/em&gt; the specs after so many people did answer it with the same interpretation. I suggest closing it as unclear.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastActivityDate="2018-04-19T18:15:03.240" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="16252" PostTypeId="2" ParentId="2140" CreationDate="2018-04-19T18:16:39.973" Score="7" Body="&lt;h1&gt;Tower Defense (Abandoned)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anyone is free to take over this challenge and fork as necessary. Just give me credit ;)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/DKjjM.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/DKjjM.jpg&quot; alt=&quot;Tower Defense Example&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;http://Beefster09.github.io/pcg-tower-defense/tower-defense.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;View it here&lt;/a&gt; | &lt;a href=&quot;https://chat.stackexchange.com/rooms/80457/tower-defense&quot;&gt;Chat&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Tower Defense is a format for casual games that was popularized in the Flash era. The player places towers that shoot down invaders moving along a predefined path.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Overview&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Two submissions will compete against each other to invade the other player's village without being invaded themselves. They will have the ability to place towers, upgrade them, and spawn invaders to attack the enemy village. The game will be simulated deterministically in a turn based fashion, with each player being able to do one action each turn.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The game board is made up of two paths, each 100 spaces long. Each player begins with 500 gold, which is used for building towers and spawning invaders; and 100 life. Your objective is to bring your opponent's life down to 0. If neither player has been defeated after 100000 turns, the winner will be the player with the most life at that point, with ties being broken by who has the most gold at that point. If, somehow, there is still a tie, the match will be considered a tie.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Income&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Every 10 turns, players will receive gold. Initially, they receive 10 gold, but this amount increases by 3 every 100 turns.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each time you successfully get an invader through your opponent's defenses, your income increases by 1 and you receive a portion of your income proportional to how much HP the invader had left.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each time one of your towers defeats an invader, you receive gold. (More on that below)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Towers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Each space on the path can house one tower. There are 3 types of towers, which have a range and a power. It takes 10 turns for a tower to be ready after it is built. Towers can be upgraded either with a wider range or an increased power, in increments of 1. There is no hard limit to how many times a tower can be upgraded.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Range refers to how many spaces away from the tower that can be reached by the tower's abilities. A range of 0 means that only the space that the tower is on is affected by the tower's attacks.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Power has a different meaning depending on the kind of tower.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Turrets&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each turn, turrets fire at the invader within range that is farthest along the path to your village. They deal damage equal to the tower's power.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Turrets begin with a range of 1 and a power of 1.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Stunners&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Stunners fire at the invader within range that is farthest along the path to your village. However, instead of dealing damage, they stun the invader for a number of turns equal to the tower's power. After firing, stunners cannot fire again for their power + 1 turns. Stunners will not fire at invaders that are already stunned.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Stunners begin with a range of 0 and a power of 3&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Bombs&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When an invader is on the same space as the bomb tower, it triggers and deals damage equal to its power to all invaders within its range. After being triggered, it cannot fire again for another 5 turns.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bombs begin with a range of 2 and a power of 2&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Invaders&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Each turn, you may spawn an invader. At minimum, it costs 10 gold and has a base HP of 10. You can spend additional gold to increase its power:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;(1G) +1 HP&lt;/li&gt;&#xA;&lt;li&gt;(10G) +1 Defense (reduce damage taken by 1, but not lower than 1)&lt;/li&gt;&#xA;&lt;li&gt;(10G) +1 Stun resistance (reduces stun time by 1 turn)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You are limited on the maximum stats. You start off unable to boost stats, but every 100 turns, the maximum increases by 5&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There can only be one invader on each space of the board and invaders cannot pass through each other. You cannot spawn an invader if there is already an invader on the first space of the board. Therefore, a potential counterplay from defenders to prevent massive hordes of invaders is to put stunners on the first few spaces.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Coding&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The main game / AI driver is &lt;a href=&quot;http://Beefster09.github.io/pcg-tower-defense/tower-defense.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; (still a work in progress)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Submission logistics TBD&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Both players will have complete knowledge about the state of the game and will be allowed to maintain state from the beginning of the game. They may not directly modify the game state. Any attempts to do so will be disqualified as will any attempt to obfuscate such an attempt.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(api description will go here)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Defenders should return an object with an &lt;code&gt;action&lt;/code&gt; property that is either &lt;code&gt;'build'&lt;/code&gt;, &lt;code&gt;'upgrade'&lt;/code&gt;, or &lt;code&gt;'destroy'&lt;/code&gt;. Each requires some additional properties to be set: (will add later)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Invaders should return an object which contains any stat boosts desired: &lt;code&gt;hp&lt;/code&gt;, &lt;code&gt;defense&lt;/code&gt;, and &lt;code&gt;stunRes&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Both defenders or invaders may also return undefined or null to indicate not taking an action.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;AIs must return their desired action in less than 10 milliseconds, averaged over 100 turns. Invalid actions returned by the AI will be ignored.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;All submissions will compete against all other submissions in a round-robin tournament. The bot that wins the most matches is declared the winner. In the event of a tie, the number of turns it took to win will be totaled for all winning matches with the smallest cumulative turn count to victory wins. In the unlikely event of a further tie, the turns to loss will be totaled for all losing matches and the bot with the highest cumulative turn count to loss wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Only one submission per user can be scored in the round-robin tournament.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No abusing standard loopholes&lt;/li&gt;&#xA;&lt;li&gt;No direct modification of the game state passed to you. It will &lt;em&gt;not&lt;/em&gt; be defensively deep-copied. Don't obfuscate your code to try to hide state modification.&lt;/li&gt;&#xA;&lt;li&gt;Any uncaught exceptions will result in disqualification.&lt;/li&gt;&#xA;&lt;li&gt;Implementations must be totally deterministic, i.e. random number generators are only allowed if seeded consistently (either with a constant or with game state) and must use isolated random state which the other AI in play cannot access.&lt;/li&gt;&#xA;&lt;li&gt;Submissions shall include an explanation of the AI's strategy.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2018-12-13T23:32:25.513" LastActivityDate="2018-12-13T23:32:25.513" CommentCount="19" ContentLicense="CC BY-SA 4.0" />
  <row Id="16253" PostTypeId="2" ParentId="16250" CreationDate="2018-04-19T18:47:38.167" Score="-7" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;The challenge is/was not unclear&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Yes, it was. It was necessary to reverse engineer from the test cases the fact that &lt;code&gt;^&lt;/code&gt; was an exponentiation operator and not an exclusive or.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With such a trivial question I don't think that anything of value would be lost if the entire question were deleted and all the answers with it, but since I don't expect that to be a popular solution I will instead observe that the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990/194&quot;&gt;consensus which I think you're referring to&lt;/a&gt; says&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If a sufficient amount of time has passed (say 48 hours) or the answer was deliberately invalid, flag the answer as in need of moderator intervention, providing an explanation of why it is invalid.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Give people a bit longer to fix their answers before flagging, or downvoting and voting to delete for those which haven't acquired upvotes.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-04-19T18:47:38.167" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="16254" PostTypeId="2" ParentId="16250" CreationDate="2018-04-19T20:13:15.867" Score="14" Body="&lt;h3&gt;The challenge was not unclear on that test case&lt;/h3&gt;&#xA;&lt;p&gt;log&lt;sub&gt;10&lt;/sub&gt;(1000) = 3 isn't some weird constraint that the challenge imposed, or unexpected behavior that the OP ruled on where it could have gone one of two ways. It's simply the correct answer to the challenge with its existing specification. Adding it to the test cases doesn't cause answers to become valid or stop being valid, it's just a useful edge-case that happens to show that many existing answers &lt;em&gt;were never truly valid&lt;/em&gt;. This isn't a case where the specification was changed due to the OP not liking some answers or the like.&lt;/p&gt;&#xA;&lt;h3&gt;Any invalid answer needs an &lt;em&gt;individual&lt;/em&gt; notice that they are invalid&lt;/h3&gt;&#xA;&lt;p&gt;A user won't know that an answer was discovered as invalid because of comments on the challenge or any meta post. The method I know of is to &lt;em&gt;comment&lt;/em&gt; on any post which is discovered to not meet the spec, or even propose an edit which resolves the issue. Just using age, or age since the issue was first discovered on one answer, is not useful because the user doesn't know that it happened. I don't necessarily have some good resolution for determining who is responsible for that check, but we shouldn't delete answers made in good faith without giving the user a chance to fix it (though, if something &lt;em&gt;does&lt;/em&gt; get deleted, the user still has an opportunity to fix it afterwards).&lt;/p&gt;&#xA;&lt;h3&gt;Deleting isn't the only fix&lt;/h3&gt;&#xA;&lt;p&gt;Sometimes an answer on other challenges is constrained to some seemingly-arbitrary upper bound of input, often having to do with the language's number representations. I am not opposed to answers that are &amp;quot;only guaranteed to work up to inputs of 1000 due to floating point precision errors&amp;quot; in a roughly similar manner. It would be prudent to establish a &lt;em&gt;firm&lt;/em&gt; upper bound for it, i.e. you should know with certainty what the lowest number pair that produces incorrect output is. In reality most languages represent numbers in a format with a strict upper bound, or variable precision, and so almost all answers in almost all challenges involving numerical input without upper bounds there is some input that is technically within spec but will cause every answer to break. &lt;code&gt;(1000,10)&lt;/code&gt; isn't a particularly high input to be causing such an error, but as long as answers identify such bounds I don't think they should count as invalid.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-04-19T20:13:15.867" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="16255" PostTypeId="2" ParentId="16137" CreationDate="2018-04-19T20:38:07.617" Score="5" Body="&lt;p&gt;I'm a believer that the challenge's OP shouldn't have the final say as to the challenge anyway (and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/13067/76359&quot;&gt;our previous discussion on the issue&lt;/a&gt; agrees with that). If there was any way to release all my questions to the community in the hope that they'd make them better, I'd do that. I'd &lt;em&gt;hoped&lt;/em&gt; that deleting my account would make it clear that I didn't want ownership over the things I'd posted, but apparently not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In general, I think the ideal outcome would be for Meta consensus on, e.g., allowed I/O formats to be clear enough that there's only one standard way to write a challenge anyway. Having the OP decide separately for each challenge simply leads to inconsistency and some of the challenges being suboptimal (in addition to being a lot of work for the collected OPs). This implies an answer to your actual question: ask here on Meta, ideally aiming to get a precedent that can be used for a range of challenges. (As it happens, the challenge you linked explicitly attempts to defer to the Meta consensus, but we currently only have a Meta consensus for I/O methods, not I/O formats.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(By the way, you shouldn't put much stock into challenges being highly upvoted, especially with this challenge in particular. I knew even before I'd posted it that it was inevitably going to be voted into the stratosphere simply because the ratio between how easy it is to answer, and how impressive answers are to someone who's unfamiliar with golfing, was likely to pin it to Hot Network Questions for several days and attract a large number of drive-by upvotes as a result. Because the votes were inevitable, being highly voted thus doesn't imply much about the quality of the challenge.)&lt;/p&gt;&#xA;" OwnerUserId="76359" LastActivityDate="2018-04-19T20:38:07.617" CommentCount="0" CommunityOwnedDate="2018-04-19T20:38:07.617" ContentLicense="CC BY-SA 3.0" />
  <row Id="16258" PostTypeId="2" ParentId="2140" CreationDate="2018-04-20T06:13:28.040" Score="1" Body="&lt;blockquote&gt;&#xA;  &lt;h3&gt;Sandbox notes&lt;/h3&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Is there anything that is unclear?&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Double Language Supersets&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-design&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-design&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-design&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the purposes of this challenge:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A &lt;em&gt;language&lt;/em&gt; is a partial mapping from &lt;em&gt;programs&lt;/em&gt; (strings of bytes) to &lt;em&gt;outputs&lt;/em&gt; (streams of bytes). Not every output must be finite or produce any elements before looping indefinitely.&lt;/li&gt;&#xA;&lt;li&gt;A language &lt;strong&gt;L&lt;/strong&gt; is an &lt;em&gt;superset&lt;/em&gt; of another language &lt;strong&gt;K&lt;/strong&gt; if, for every program of length &lt;strong&gt;n&lt;/strong&gt; given meaning in &lt;strong&gt;K&lt;/strong&gt;, there is a program of length &lt;strong&gt;n&lt;/strong&gt; given meaning in &lt;strong&gt;L&lt;/strong&gt; which produces the same output. In other words, all programs in &lt;strong&gt;K&lt;/strong&gt; can be translated into &lt;strong&gt;L&lt;/strong&gt; without requiring any more bytes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(cops' part)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a cop, you must:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Find two languages, and provide (or link to) a specification in the form of a detailed description or an implementation. Be prepared to answer any questions should ambiguities arise.&lt;/li&gt;&#xA;&lt;li&gt;Define a new &quot;solution&quot; language which is a superset of both of the others. This can be in the form of a detailed document, implementation, or a proof that such a language exists.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You should reveal the first two languages, but keep the solution language secret.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The cop whose submission takes the longest to crack is the winner.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(robbers' part)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a robber, you must:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Find an existing cop submission.&lt;/li&gt;&#xA;&lt;li&gt;Define a new language which is a superset of both of the languages provided by the cop. This can be in the form of a detailed description, an implementation, or a proof that such a language exists.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The robber who cracks the most cop submissions is the winner.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="61384" LastEditDate="2018-04-23T18:53:24.223" LastActivityDate="2018-04-23T18:53:24.223" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="16260" PostTypeId="2" ParentId="2140" CreationDate="2018-04-20T15:45:34.423" Score="2" Body="&lt;h2&gt;Bot Wars at the Auction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have seen KOTH challenges where the bots fight each other, and I have seen KOTH challenges where the bots are in an auction. So I came up with this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The Challenge:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must build a javascript bot that will fight other bots using weapons purchased in an auction. These items are: swords, bows, and shields. You can also purchase healing and quivers. Your function is called once per &quot;Turn&quot;, and only 1 weapon action and 1 move action can be called in each turn. You start with 200 health, and 2000 coins. Fight in arena with each bot in its own 5 by 5 square. For example, 16 bots would be a 20 by 20 arena.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Auctions:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;During an auction, 2 items will be sold per surviving bot. In the initial auction, 3 items will be sold for each bot. It is up to the bots how they will bid: some bots may spend lots on a cool sword, while others could choose to buy healing in large amounts. There is an auction every few hundred turns. Items start at cost 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Fighting:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After the auction, your bots will be pitted against each other. With swords to strike nearby enemies, bows to attack distant bots, and shields to defend yourself, what could go wrong? If you find yourself low on health, you can heal (Which takes between 6 and 8 turns).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As input, your function receives an object filled with functions that can be used to control your bot. This object is also at &lt;code&gt;window.bots[&quot;yourbot&quot;].auction&lt;/code&gt; or &lt;code&gt;window.bots[&quot;yourbot&quot;].fight&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Object:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;//within window.bots[&quot;yourbot&quot;]&#xA;mode: integer, //0=Dead, 1=Auction, 2=Fight&#xA;items: object, //All items owned&#xA;coins: integer,&#xA;health: integer,&#xA;auction: {&#xA;    itemlist: array, //Array of item objects&#xA;    placeBid(coins), //Bid on item&#xA;    incrementBid(amount), //Bids (current + amount)&#xA;    item: {&#xA;        current: integer, //Current highest bid&#xA;        bidder: string, //Current highest bidder&#xA;        type: integer, //1=Sword, 2=Bow, 3=Quiver, 4=Shield, 5=Healing&#xA;        power: integer, //Item power (Attack amount, healing amount, or block percentage)&#xA;        units: integer //Only for healing and quivers; amount of turns taken to heal, or amount of arrows in quiver&#xA;    }&#xA;},&#xA;fight: {&#xA;    botList: array, //List of bots&#xA;    surrenderTo(bot), //Surrenders to a specific bot&#xA;    move: {&#xA;        north(), //Y+&#xA;        east(), //X+&#xA;        south(), //Y-&#xA;        west(), //X-&#xA;    }&#xA;    use: {&#xA;        swordAttack(bot OR [x,y]), //Attacks a bot, but only if it is adjacent to attacker&#xA;        bow(bot OR [x,y]), //Shoots bow at bot, bot must be within 5 spaces&#xA;        shield(), //Raises shield for 5 turns&#xA;        heal(sor) //Uses least powerful healing or takes input sort function&#xA;    }&#xA;    util: {&#xA;        getNearest(), //Returns nearest bot&#xA;        getBot(name), //Returns a specific bot by name&#xA;        atLocation([x,y]), //Returns bot at a certain location&#xA;        gridSize(), //Returns the side length of the square arena&#xA;        getPosition(), //Returns array [x,y] of caller bot&#xA;        see([x,y]), //Returns true or false, depending on if there is a bot in a certain location&#xA;    }&#xA;}&#xA;&#xA;//within other bot nearestBot(), getBot(), botList, or atLocation(x, y)&#xA;location: array, //[x,y]&#xA;name: string, //Bot's name&#xA;items: object //All objects owned by bot&#xA;&#xA;//within items&#xA;type: integer, //1=Sword, 2=Bow, 3=Quiver, 4=Shield, 5=Healing&#xA;power: integer, //Item power (Attack amount, healing amount, or block percentage)&#xA;units: integer //Only for healing and quivers; amount of turns taken to heal, or amount of arrows in quiver&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;How it Works:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will start in an auction. With your 2000 coins, you can bid on items using the functions &lt;code&gt;placeBid(price)&lt;/code&gt; or &lt;code&gt;incrementBid(amount)&lt;/code&gt;. If nobody bids for 5 turns, the item is sold. Once the items are all gone, the fight begins. The initial auction focuses mainly on swords, bows, and shields. During the fight, you can attack players using simple methods like &lt;code&gt;bow(nearestPlayer())&lt;/code&gt;, or more complex methods involving mapping the area with &lt;code&gt;see([x,y])&lt;/code&gt; and &lt;code&gt;atLocation([x,y])&lt;/code&gt;. When the fight round is over, another auction starts, which mainly focuses on healing and quivers. When the fight begins again, you will be able to heal (Make sure you shield right before doing so!). After that fight, another auction will commence. This will repeat until one person remains, or all other bots use &lt;code&gt;surrenderTo(bot)&lt;/code&gt;. Inflicting damage on another bot gets you 1 coin per point, and you get a 500 coin bonus for killing a bot. If a bot surrenders to you, you earn 100 coins. Store information that you bot may use in &lt;code&gt;window.bots[yourBotName]&lt;/code&gt;. Note that a copy of this object is passed to your bot, but storing a varibale in this object will only affect it locally. Coordinates range from [0,0] in the corner to [max,max] in the opposite corner, max being &lt;code&gt;round(22.36 * sqrt(botCount))&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Function Specifications:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;placeBid(coins)&#xA;    Inputs amount of coins to set the bidding at&#xA;    If lower than current highest bid or another bid in that turn, returns 1&#xA;    If input is invalid, returns 2&#xA;    Will set auction.item.current to coins and auction.item.bidder to your bot name&#xA;incrementBid(amount)&#xA;    Inputs amount of coins to increase bidding by&#xA;    Adds to highest bid in last turn&#xA;    If lower than current highest bid or another bid in that turn, returns 1&#xA;    If input is invalid, returns 2&#xA;    Will add amount to auction.item.current and auction.item.bidder to your bot name&#xA;moveNorth()&#xA;    Will move bot 1 space Y+&#xA;    Returns 1 if bot is at far North edge of arena&#xA;moveEast()&#xA;    Will move bot 1 space X+&#xA;    Returns 1 if bot is at far East edge of arena&#xA;moveSouth()&#xA;    Will move bot 1 space Y-&#xA;    Returns 1 if bot is at far South edge of arena&#xA;moveWest()&#xA;    Will move bot 1 space X-&#xA;    Returns 1 if bot is at far West edge of arena&#xA;getNearest()&#xA;    Returns the nearest bot as of the last turn&#xA;    Read information: location, name, items&#xA;getBot(name)&#xA;    Inputs a string, containing the name of a bot&#xA;    If bot does not exist, returns 1&#xA;    If bot is dead, returns 2&#xA;    If input is invalid, returns 3&#xA;    Returns bot as of last turn&#xA;atLocation([x,y]) or atLocation(x,y)&#xA;    Inputs an array containing coordinates, or two integer coordinates&#xA;    Returns bot as of last turn&#xA;    If no bot exists in that spot, returns 0&#xA;    Invalid input returns 1&#xA;gridSize()&#xA;    Returns an integer containing the side length of the arena&#xA;getPosition()&#xA;    Returns an array [x,y] containing the position of the bot&#xA;surrenderTo(bot)&#xA;    Takes bot as input&#xA;    Will set mode to 0 on your bot&#xA;    Gives bot surrendered to 100 coins&#xA;    Returns 1 if input is invalid&#xA;    Returns 2 if bot is dead or inexistant&#xA;see([x,y])&#xA;    Returns true if bot is in location&#xA;    Returns false if input is invalid or no bot exists in location&#xA;swordAttack(bot OR [x,y])&#xA;    Takes either a bot or [x,y] coordinates as input&#xA;    Does as much damage as your best sword&#xA;    Will return 1 if input is invalid&#xA;    Will return 2 if bot is dead/nonexistant, or if coordinates are out of bounds&#xA;    Will return 3 if you don't have a sword&#xA;    Will return 4 if bot/coordinates are not within 1 space of your bot&#xA;bow(bot OR [x,y])&#xA;    Takes either a bot or [x,y] coordinates as input&#xA;    Doesas much damage as your best bow&#xA;    Will return 1 if input is invalid&#xA;    Will return 2 if bot is dead/nonexistant, or if coordinates are out of bounds&#xA;    Will return 3 if you don't have a bow, and 5 if you have no arrows&#xA;    Will return 4 if bot/coordinates are not within 20 spaces of your bot&#xA;shield()&#xA;    Blocks as much damage as your best shield as a percentage&#xA;    Lasts for 5 turns (Includes turn activated)&#xA;    Will return 1 if you don't have a shield&#xA;heal()&#xA;    Uses your weakest heal, or you can specify a sort function to define the order they are used&#xA;    Cannot move for 6-8 turns (Selected randomly)&#xA;    Will return 1 if you don't have heal&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Item Specifications:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Sword&#xA;    The sword is used to attack bots within 1 space&#xA;    Has set damage amount (Geometric distribution 10-100)&#xA;    Is found in:&#xA;        Auction 1 = 35%&#xA;        Auction 2 = 30%&#xA;        Auction 3 = 15%&#xA;        Auction 4 = 5%&#xA;Bow&#xA;    The bow is used to remotely attack bots within 20 spaces&#xA;    Has set damage amount (Geometric distribution 4-40)&#xA;    Is found in:&#xA;        Auction 1 = 30%&#xA;        Auction 2 = 20%&#xA;        Auction 3 = 10%&#xA;        Auction 4 = 5%&#xA;Quiver&#xA;    Quivers are purchased with arrows in them, used for shooting bows&#xA;    Starts with specific amount of arrows (Geometric distribution 5-20)&#xA;    Is found in:&#xA;        Auction 1 = 7.5%&#xA;        Auction 2 = 10%&#xA;        Auction 3 = 25%&#xA;        Auction 4 = 40%&#xA;        Other auctions = 45%&#xA;Shield&#xA;    Shields are used to defend against attack&#xA;    Starts with a specific block percentage (Geometric distribution 5%-75%)&#xA;    Can be used while healing&#xA;    Is found in:&#xA;        Auction 1 = 20%&#xA;        Auction 2 = 30%&#xA;        Auction 3 = 20%&#xA;        Auction 4 = 10%&#xA;Heal&#xA;    Heal is used to regenerate during battle&#xA;    Heal level is geometric distribution 20-80&#xA;    Is found in:&#xA;        Auction 1 = 7.5%&#xA;        Auction 2 = 10%&#xA;        Auction 3 = 30%&#xA;        Auction 4 = 40%&#xA;        Other auctions = 55%&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example bot:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function readyToFight(obj) {&#xA;    var items = obj.items;&#xA;    var types = [];&#xA;    var coins = obj.coins;&#xA;    for (var i = 0, n; i &amp;lt; items.length; i++) {&#xA;        n = items[i];&#xA;        types.push(n.type);&#xA;    }&#xA;    if (obj.mode == 1) {&#xA;        obj = obj.auction;&#xA;        if (obj.item.type == 1) {&#xA;            if (types.indexOf(1) != -1) {&#xA;                for (var i = 0, n; i &amp;lt; items.length; i++) {&#xA;                    n = items[i];&#xA;                    if (n.type == 1 &amp;amp;&amp;amp; n.power &amp;lt; obj.item.power) {&#xA;                        var bid = true;&#xA;                    }&#xA;                }&#xA;                if (n.item.price &amp;lt; coins) {&#xA;                    obj.incrementBid(1);&#xA;                }&#xA;            } else {&#xA;                if (n.item.price &amp;lt; coins) {&#xA;                    obj.incrementBid(1);&#xA;                }&#xA;            }&#xA;        } else if (obj.item.type == 2) {&#xA;            if (types.indexOf(2) != -1) {&#xA;                for (var i = 0, n; i &amp;lt; items.length; i++) {&#xA;                    n = items[i];&#xA;                    if (n.type == 2 &amp;amp;&amp;amp; n.power &amp;lt; obj.item.power) {&#xA;                        var bid = true;&#xA;                    }&#xA;                }&#xA;                if (n.item.price &amp;lt; coins) {&#xA;                    obj.incrementBid(1);&#xA;                }&#xA;            } else {&#xA;                if (n.item.price &amp;lt; coins) {&#xA;                    obj.incrementBid(1);&#xA;                }&#xA;            }&#xA;        } else if (obj.item.type == 3) {&#xA;            if (n.item.price &amp;lt; n.item.units * 2) {&#xA;                obj.incrementBid(1);&#xA;            }&#xA;        } else if (obj.item.type == 4) {&#xA;            if (types.indexOf(4) != -1) {&#xA;                for (var i = 0, n; i &amp;lt; items.length; i++) {&#xA;                    n = items[i];&#xA;                    if (n.type == 4 &amp;amp;&amp;amp; n.power &amp;lt; obj.item.power) {&#xA;                        var bid = true;&#xA;                    }&#xA;                }&#xA;                if (n.item.price &amp;lt; coins) {&#xA;                    obj.incrementBid(1);&#xA;                }&#xA;            } else {&#xA;                if (n.item.price &amp;lt; coins) {&#xA;                    obj.incrementBid(1);&#xA;                }&#xA;            }&#xA;        } else if (obj.item.type == 5) {&#xA;            if (n.item.price &amp;lt; n.item.power * 5) {&#xA;                obj.incrementBid(1);&#xA;            }&#xA;        }&#xA;    } else if (obj.mode == 2) {&#xA;        hp = obj.health;&#xA;        obj = obj.fight;&#xA;        if (types.indexOf(2) != -1) {&#xA;            obj.use.bow(obj.nearestPlayer());&#xA;        } else if (obj.health &amp;lt; 50 &amp;amp;&amp;amp; types.indexOf(5) != -1) {&#xA;            obj.use.heal();&#xA;        } else {&#xA;            //Be scared, or implement better fighting techniques!&#xA;        }&#xA;    } else {&#xA;        //Bot can still see the arena and auction when dead, but cannot fight or bid&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Notes:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard Loopholes&lt;/a&gt; prohibited, javascript only&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2018-04-23T18:31:53.260" LastActivityDate="2018-04-23T18:31:53.260" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="16261" PostTypeId="2" ParentId="2140" CreationDate="2018-04-20T15:59:20.863" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following is an idea I hope to eventually make into a full king of the hill.  I've never written or participated in a king of the hill so help would be appreciated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is how this is going to work.  You are going to be able to write the brain behind a bot.  Your bot will have a limited amount of energy to work with.  It won't have to expend energy to move around normally, however every time it moves while carrying something it will expend 1 unit of energy.  When your bot hits zero energy it won't be able to move any longer and will &lt;s&gt;die&lt;/s&gt; have to take a nap.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal is to make bots that will take agar from sources to their corresponding goals.  However the sources and goals will be too far apart for a single bot to carry a piece of agar all by themselves so &lt;strong&gt;you will need to work with other bots to achieve your goals&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specifics&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;The course&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The course will likely be a square grid of yet determined size.  On the south and east ends will be sources of agar, which will replenish as it is drained by the bots.  On the north and west ends will be goals.  Agar placed in the goal will disappear.  Agar from the east source should be placed in the west goal and agar from the south source in the north goal.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The bots&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each player will be given control of 1 bot.  Bots will be implemented as a rather simple state-machine. You will implement your bot as a function that takes inputs and produces outputs.  At each step of the program a the bot will receive the following pieces of information:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Whether each of the four squares adjacent to it is inside our outside of the arena.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Whether there is agar in each of the four squares adjacent to it, and the square it is in.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Whether there is another bot in each of the four squares adjacent to it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Whether it is carrying agar currently.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;How much energy it has remaining.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;An additional 2 bit state, to be explained.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;From those inputs the bot will produce two outputs:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;An action, which is either a direction to move, picking up agar, or placing agar back on the ground.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A 2 bit state to be passed on to your bot at the next step.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The 2 bit state acts as your bot's memory.  It's not a lot so you should use it wisely.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Movement&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your bot has pretty free movement.  It can move into any empty space.  However there are two limits on movement.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You may not move outside of the course&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may not move into a space that has agar if you are carrying agar.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I am not yet sure how I will handle bot collisions.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Carrying&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your bots can carry agar.  They can only carry one piece of agar at a time.  To pick up agar a bot must be standing where the agar is located and perform a pick up action.  Placing agar works in much the same way.  If a bot is carrying agar they may perform a place action to put the agar down where they stand.  Placed agar will remain there until a bot picks it up and moves it.  Picking up and placing agar does not cost energy, however moving while holding agar does cost a unit of energy for every movement.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Scoring is still up in the air, once I have a working controller I will finalize scoring aspects.  That being said thoughts, questions and suggestions are more than welcome.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each piece of agar will remember which bots helped move it and how many steps they took.  Upon being put into the correct goal agar will award every bot 1 point for every step they took while holding the agar.  Agar left on the field or put in an incorrect goal will award no points.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More points is better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not sure how koth scoring usually works overall so you guys might want to help me with that.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Controller&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Once I have the idea down I will start to write a controller.  I may need some help from people more experienced in koths in getting the basics down.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I intend to write the controller in &lt;a href=&quot;http://elm-lang.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;elm&lt;/a&gt; because I like functional programming and I would like the controller to be runnable from in browser.  Answerers will not have to write in elm they will instead write in a toy language I have yet to write the specifics for.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2018-05-22T23:36:38.987" LastActivityDate="2018-05-22T23:36:38.987" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16263" PostTypeId="2" ParentId="2140" CreationDate="2018-04-20T17:03:16.183" Score="-3" Body="&lt;h1&gt;Output Infinity (updated v2)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Output the following &lt;strong&gt;infinity symbol&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;         ∞∞infinity                         ∞infinity                   &#xA;     infinity∞∞infinity                 infinity∞∞infinity              &#xA;   infinity∞∞∞∞∞∞∞infinity           infinity∞∞∞∞∞∞∞infinity            &#xA;  infinity        ∞∞infinity      ∞∞∞∞∞infinity        ∞∞∞∞∞∞∞          &#xA; ∞∞∞∞∞                 ∞∞∞∞∞∞∞  ∞∞∞infinity               ∞∞∞∞∞         &#xA; ∞∞∞                      ∞∞∞∞∞∞∞infinity                   ∞∞∞         &#xA;∞∞∞                         ∞∞infinity                       ∞∞∞        &#xA;∞∞∞                       ∞∞infinity                         ∞∞∞        &#xA; ∞∞∞                    ∞∞∞∞∞∞infinity                      ∞∞∞         &#xA; ∞∞∞∞∞               ∞∞∞infinity  ∞∞∞∞∞∞∞                 ∞∞∞∞∞         &#xA;  infinity       ∞∞∞∞∞infinity     ∞∞∞infinity        infinity          &#xA;    infinity∞∞∞∞∞∞∞infinity           infinity∞∞∞∞∞∞∞infinity           &#xA;      infinity∞∞infinity                infinity∞∞∞infinity             &#xA;           ∞infinity                        ∞∞∞infinity                 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No input.&lt;/li&gt;&#xA;&lt;li&gt;Output can be given &lt;a href=&quot;http://meta.codegolf.stackexchange.com/q/2447/42963&quot;&gt;in any convenient format&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Any number of &lt;strong&gt;trailing spaces&lt;/strong&gt; at the end of each line is allowed.&lt;/li&gt;&#xA;&lt;li&gt;Any number of &lt;strong&gt;trailing new lines&lt;/strong&gt; at the end of the shape is permitted.&lt;/li&gt;&#xA;&lt;li&gt;Either a full program or a function are acceptable. If a function, you can return the output rather than printing it.&lt;/li&gt;&#xA;&lt;li&gt;If possible, please include a link to an on-line testing environment so other people can try out your code!&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://meta.codegolf.stackexchange.com/q/1061/42963&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so all usual golfing rules apply, and the shortest code (in bytes) wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="71398" LastEditorUserId="71398" LastEditDate="2018-04-21T20:06:45.470" LastActivityDate="2018-04-21T20:06:45.470" CommentCount="12" ContentLicense="CC BY-SA 3.0" />
  <row Id="16264" PostTypeId="2" ParentId="2140" CreationDate="2018-04-20T20:43:34.317" Score="1" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Unless someone can convince me otherwise I think this is too close to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/77138/are-the-brackets-fully-matched&quot;&gt;Are the brackets fully matched?&lt;/a&gt; to be an interesting new challenge, so I won't submit it.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Well-formed Parentheses Gone Wild&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The object is to determine if the &quot;parentheses&quot; in a string are well-formed, in the sense that they are balanced and well-nested. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example &lt;code&gt;[(ab(c!{})n)]&lt;/code&gt; is such a string, while &lt;code&gt;[(ab(c!(d)x){)}]&lt;/code&gt; is not (balanced, but not well-nested due to the last closing &lt;code&gt;)&lt;/code&gt; appearing before the closing &lt;code&gt;}&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;But wait, there's more&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Those examples took advantage of the commonly understood meanings of the pairs &lt;code&gt;()&lt;/code&gt;, &lt;code&gt;{}&lt;/code&gt;, and &lt;code&gt;[]&lt;/code&gt;. But any characters could be opening and closing parentheses, and not just the obvious ones.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input consists of two strings with optional trailing newlines. The characters can be any ASCII printable character (hex 20 to hex 7E).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first string has an even number of characters with no duplicates. Each successive pair of characters defines a pair of opening and closing parentheses. The second string is the test string.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Truthy or falsy value (with optional trailing whitespace) for whether or not the parentheses in the test string are well-formed (balanced and well-nested). If either the first or second strings are empty, the answer is defined to be truthy.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Some Tests&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;String1&#xA;String2&#xA;Output&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Tests:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(){}[]&#xA;[(ab(c!{})n)]&#xA;truthy&#xA;&#xA;(){}[]&#xA;[(ab(c!(d)x){)}]&#xA;falsy&#xA;&#xA;()[]&amp;lt;&amp;gt;&#xA;[(ab(c!(d)x){)}]&#xA;truthy&#xA;&#xA;                      &amp;lt;---- empty parenthesis string&#xA;%$w%jS(5gS&#xA;truthy&#xA;&#xA;(){}[]&#xA;                      &amp;lt;---- empty test string&#xA;truthy &#xA;&#xA;qwertyuiop&#xA;q##qCfet^Hy&amp;amp;&amp;amp;r$wuiwgJo7({)}erxp&#xA;truthy&#xA;&#xA;@#$%^&amp;amp;&#xA;super b$fox$#@%%g ongshow^&amp;amp;&#xA;falsy&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring and Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. Shortest entry wins.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes forbidden and standard rules apply.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79980" LastEditorUserId="79980" LastEditDate="2018-04-21T17:23:02.967" LastActivityDate="2018-04-21T17:23:02.967" CommentCount="10" ContentLicense="CC BY-SA 3.0" />
  <row Id="16265" PostTypeId="2" ParentId="2140" CreationDate="2018-04-20T23:00:19.860" Score="-2" Body="&lt;h1&gt;&amp;#9835; &lt;em&gt;I see a window and I want it painted black&lt;/em&gt; &amp;#9835;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Yes, I know this is a popular mishearing of the lyrics. But instead of a red door, I really do want an (application) window painted black.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your standalone program should launch an application window at least 400x400 and fill it entirely with black. It doesn't need to be borderless, and it doesn't need to exit gracefully.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Running in a browser is insufficient because there are still elements of the window such as the address-bar and tab-bar that aren't painted black. You must paint the whole window black except for borders added by your window manager.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code golf. Standard loopholes apply. Additional challenge is to listen to The Rolling Stones while making your submission. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is an un-golfed Java solution:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#compile: javac BlackWindow.java&#xA;#run: java BlackWindow&#xA;import java.awt.Color;&#xA;import java.awt.Frame;&#xA;&#xA;public class BlackWindow{&#xA;  public static void main(String[] args){&#xA;    Frame frame = new Frame(&quot;no colors anymore&quot;);&#xA;    frame.setsize(400, 400);&#xA;    frame.setLocationRelativeTo(null);&#xA;    frame.setBackground(Color.Black);&#xA;    frame.setvisible(true);&#xA;  }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="69304" LastActivityDate="2018-04-20T23:00:19.860" CommentCount="6" ContentLicense="CC BY-SA 3.0" />
  <row Id="16266" PostTypeId="2" ParentId="2140" CreationDate="2018-04-21T02:00:11.363" Score="2" Body="&lt;h1&gt;Operate on a subset of a register&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quantum-computing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quantum-computing&amp;#39;&quot; rel=&quot;tag&quot;&gt;quantum-computing&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Note: You do &lt;strong&gt;NOT&lt;/strong&gt; need to know anything about quantum mechanics or quantum computing to understand this challenge. I've tried to include sufficient background for any old code golfer to realize what's going on.&lt;/p&gt;&#xA;&lt;h3&gt;Motivation (much of this can probably be skipped)&lt;/h3&gt;&#xA;&lt;p&gt;In quantum computing, the equivalent of a bit is a &lt;strong&gt;qubit&lt;/strong&gt;. Like a bit, a qubit will have a state of OFF or ON (&lt;code&gt;0&lt;/code&gt; or &lt;code&gt;1&lt;/code&gt;) when observed, but unlike a bit, a qubit can exist in both states simultaneously while unobserved. Trippy.&lt;/p&gt;&#xA;&lt;p&gt;What's even trippier is that they don't exist in simple superpositions (40% chance to observe &lt;code&gt;0&lt;/code&gt;, 60% for &lt;code&gt;1&lt;/code&gt;)—you can have two qubits that will behave the same when observed, but not when interacting with other qubits. Taking this into account, a convenient representation of a qubit's state is a complex vector, with bases &lt;code&gt;|0&amp;gt;&lt;/code&gt; and &lt;code&gt;|1&amp;gt;&lt;/code&gt;. A qubit with state &lt;code&gt;(1+0i)|0&amp;gt; + (0+0i)|1&amp;gt;&lt;/code&gt; will always show &lt;code&gt;0&lt;/code&gt; when observed, as will &lt;code&gt;(0+1i)|0&amp;gt; + (0+0i)|1&amp;gt;&lt;/code&gt; or &lt;code&gt;(0.6+0.8i)|0&amp;gt; + (0+0i)|1&amp;gt;&lt;/code&gt;. What matters here is the squared magnitude of each component—that's the probability of observing the corresponding basis vector. Noting this, &lt;code&gt;(-0.5+0.5i)|0&amp;gt; + (-0.5-0.5i)|1&amp;gt;&lt;/code&gt; will &amp;quot;choose&amp;quot; randomly between the two possible states. This ability to have multiple states at once allows qubits to store much, &lt;em&gt;much&lt;/em&gt; more information than an equal number of bits.&lt;/p&gt;&#xA;&lt;p&gt;Now, since a qubit is a two-dimensional vector (as far as we're concerned), an operation on a qubit can be represented as a 2x2 matrix. For example, the identity:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[1+0i  0+0i]&#xA; [0+0i  1+0i]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;will take any qubit to an equivalent one, while the &lt;a href=&quot;https://en.wikipedia.org/wiki/Hadamard_transform&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hadamard transform&lt;/a&gt;, represented by the matrix:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[1+0i  1+0i]&#xA; [1+0i -1+0i]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;will turn any pure state (&lt;code&gt;P(0) == 0 or 1&lt;/code&gt;) into an equal superposition of the two. Check out &lt;a href=&quot;https://codegolf.stackexchange.com/q/162254/73884&quot;&gt;this challenge&lt;/a&gt; for generation of this matrix, generalized to &lt;code&gt;n&lt;/code&gt; qubits! These matrices multiply a qubit's vector state to yield a new state.&lt;/p&gt;&#xA;&lt;p&gt;A qubit on its own is little more useful than a bit. However, they can be put into registers with others, so a &amp;quot;qubyte&amp;quot; can store &lt;code&gt;0&lt;/code&gt;, &lt;code&gt;255&lt;/code&gt;, or any arbitrary superposition of the numbers between.&lt;/p&gt;&#xA;&lt;p&gt;I won't go into depth on entanglement here, but I'll say that it is a property of these qubits that makes storing quantum registers as lists of qubits not work at all (and makes quantum computers outperform classical ones). It works much better to treat a register much like a qubit and give it a vector representation, this time with a basis vector for each observable state. For example, two &lt;code&gt;(1+0i)|0&amp;gt; + (0+0i)|1&amp;gt;&lt;/code&gt; qubits together form a &lt;code&gt;(1+0i)|00&amp;gt; + (0+0i)|01&amp;gt; + (0+0i)|10&amp;gt; + (0+0i)|11&amp;gt;&lt;/code&gt; register. Note that the probability distributions of outcomes are identical for the two representations—in this case, both qubits will and up as &lt;code&gt;0&lt;/code&gt; in both representations.&lt;/p&gt;&#xA;&lt;h3&gt;Important stuff again&lt;/h3&gt;&#xA;&lt;p&gt;These registers are nice and all, but it's difficult (and often impossible—try it yourself on &lt;code&gt;(-0.5+0.5i)|00&amp;gt; + (0+0i)|01&amp;gt; + (0+0i)|10&amp;gt; + (-0.5-0.5i)|11&amp;gt;&lt;/code&gt;!) to extract the state of a single qubit in a register from the register's vector—that is, you can have a register in a state unformable by individual qubits. Fortunately, to apply, say, the Hadamard transform to qubit 2 of a register, we can construct a matrix by which we can multiply the entire register but change only the one qubit. Neat!&lt;/p&gt;&#xA;&lt;p&gt;Let's say we have an operation &lt;code&gt;m&lt;/code&gt; on one qubit defined as:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[x y]&#xA; [z w]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and a three-qubit register of qubits &lt;code&gt;a|0&amp;gt; + b|1&amp;gt;&lt;/code&gt;, &lt;code&gt;c|0&amp;gt; + d|1&amp;gt;&lt;/code&gt;, and &lt;code&gt;e|0&amp;gt; + f|1&amp;gt;&lt;/code&gt;. This register has a vector form (treating the first of these qubits as the least significant) of:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;eca|000&amp;gt; + ecb|001&amp;gt; + eda|010&amp;gt; + edb|011&amp;gt; + fca|100&amp;gt; + fcb|101&amp;gt; + fda|110&amp;gt; + fdb|111&amp;gt;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Defining &lt;code&gt;g := ax + by&lt;/code&gt; and &lt;code&gt;h := az + bw&lt;/code&gt;, we see that the result of applying &lt;code&gt;m&lt;/code&gt; to &lt;code&gt;a|0&amp;gt; + b|1&amp;gt;&lt;/code&gt; is &lt;code&gt;g|0&amp;gt; + h|1&amp;gt;&lt;/code&gt;. What we want is a matrix that, when multiplied by the register state above, yields the same but with &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; replaced by &lt;code&gt;g&lt;/code&gt; and &lt;code&gt;h&lt;/code&gt;, respectively:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;ecg|000&amp;gt; + ech|001&amp;gt; + edg|010&amp;gt; + edh|011&amp;gt; + fcg|100&amp;gt; + fch|101&amp;gt; + fdg|110&amp;gt; + fdh|111&amp;gt;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Let's look at a matrix that does just this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[x y 0 0 0 0 0 0]     [[eca]     [[ecax + ecby]     [[ecg]&#xA; [z w 0 0 0 0 0 0]      [ecb]      [ecaz + ecbw]      [ech]&#xA; [0 0 x y 0 0 0 0]      [eda]      [edax + edby]      [edg]&#xA; [0 0 z w 0 0 0 0]  \/  [edb]  ——  [edaz + edbw]  ——  [edh]&#xA; [0 0 0 0 x y 0 0]  /\  [fca]  ——  [fcax + fcby]  ——  [fcg]&#xA; [0 0 0 0 z w 0 0]      [fcb]      [fcaz + fcbw]      [fch]&#xA; [0 0 0 0 0 0 x y]      [fda]      [fdax + fdby]      [fdg]&#xA; [0 0 0 0 0 0 z w]]     [fdb]]     [fdaz + fdbw]]     [fdh]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;How nice. Of course, we can operate of qubit 1 or 2 (0-indexed) with a modified version of the very same matrix:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[x 0 y 0 0 0 0 0]&#xA; [0 x 0 y 0 0 0 0]&#xA; [z 0 w 0 0 0 0 0]&#xA; [0 z 0 w 0 0 0 0]&#xA; [0 0 0 0 x 0 y 0]&#xA; [0 0 0 0 0 x 0 y]&#xA; [0 0 0 0 z 0 w 0]&#xA; [0 0 0 0 0 z 0 w]]&#xA;&#xA;[[x 0 0 0 y 0 0 0]&#xA; [0 x 0 0 0 y 0 0]&#xA; [0 0 x 0 0 0 y 0]&#xA; [0 0 0 x 0 0 0 y]&#xA; [z 0 0 0 w 0 0 0]&#xA; [0 z 0 0 0 w 0 0]&#xA; [0 0 z 0 0 0 w 0]&#xA; [0 0 0 z 0 0 0 w]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;These are the same as before, but with the 2x2 squares spread out a bit and overlapping. Verification of these matrices is left as an exercise for the reader.&lt;/p&gt;&#xA;&lt;p&gt;You can also perform multi-qubit operations (like the controlled-NOT gate) on just part of a register in much the same fashion. Performing on qubits 0 and 2 of a 3-qubit register the following operation:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[a b c d]&#xA; [e f g h]&#xA; [i j k l]&#xA; [m n o p]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;can be accomplished with yet another 8x8 matrix:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[a b 0 0 c d 0 0]&#xA; [e f 0 0 g h 0 0]&#xA; [0 0 a b 0 0 c d]&#xA; [0 0 e f 0 0 g h]&#xA; [i j 0 0 k l 0 0]&#xA; [m n 0 0 o p 0 0]&#xA; [0 0 i j 0 0 k l]&#xA; [0 0 m n 0 0 o p]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This can be generalized to an operation on &lt;code&gt;m&lt;/code&gt; qubits of a register of &lt;code&gt;n&lt;/code&gt; qubits, where &lt;code&gt;0 ≤ m ≤ n&lt;/code&gt;; in fact, that's what this challenge'll do!&lt;/p&gt;&#xA;&lt;h3&gt;Your task (at long last!)&lt;/h3&gt;&#xA;&lt;p&gt;Write a program or function. It must:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Take as input a nonnegative integer &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Take as input a list of &lt;code&gt;m&lt;/code&gt; distinct integers from 0 to &lt;code&gt;n&lt;/code&gt; (inclusive).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Take as input a 2&lt;sup&gt;m&lt;/sup&gt;x2&lt;sup&gt;m&lt;/sup&gt; matrix of integers that represents the operation to be performed on the qubits of an &lt;code&gt;n&lt;/code&gt;-qubit register indicated (in order) by the aforementioned list.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Return as output a 2&lt;sup&gt;n&lt;/sup&gt;x2&lt;sup&gt;n&lt;/sup&gt; matrix of integers that represents an operation on the entire register equivalent to applying the given matrix to the indicated qubits.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;n = 4&#xA;qubits = {2}&#xA;Operation: [[1  2]&#xA;            [3  4]]&#xA;Return: [[1 0 0 0 2 0 0 0 1 0 0 0 2 0 0 0]&#xA;         [0 1 0 0 0 2 0 0 0 1 0 0 0 2 0 0]&#xA;         [0 0 1 0 0 0 2 0 0 0 1 0 0 0 2 0]&#xA;         [0 0 0 1 0 0 0 2 0 0 0 1 0 0 0 2]&#xA;         [3 0 0 0 4 0 0 0 3 0 0 0 4 0 0 0]&#xA;         [0 3 0 0 0 4 0 0 0 3 0 0 0 4 0 0]&#xA;         [0 0 3 0 0 0 4 0 0 0 3 0 0 0 4 0]&#xA;         [0 0 0 3 0 0 0 4 0 0 0 3 0 0 0 4]&#xA;         [1 0 0 0 2 0 0 0 1 0 0 0 2 0 0 0]&#xA;         [0 1 0 0 0 2 0 0 0 1 0 0 0 2 0 0]&#xA;         [0 0 1 0 0 0 2 0 0 0 1 0 0 0 2 0]&#xA;         [0 0 0 1 0 0 0 2 0 0 0 1 0 0 0 2]&#xA;         [3 0 0 0 4 0 0 0 3 0 0 0 4 0 0 0]&#xA;         [0 3 0 0 0 4 0 0 0 3 0 0 0 4 0 0]&#xA;         [0 0 3 0 0 0 4 0 0 0 3 0 0 0 4 0]&#xA;         [0 0 0 3 0 0 0 4 0 0 0 3 0 0 0 4]]&#xA;&#xA;n = 3&#xA;qubits = {0, 2}&#xA;Operation: [[1  2  3  4 ]&#xA;            [5  6  7  8 ]&#xA;            [9  10 11 12]&#xA;            [13 14 15 16]]&#xA;Return: [[1  2  0  0  3  4  0  0 ]&#xA;         [5  6  0  0  7  8  0  0 ]&#xA;         [0  0  1  2  0  0  3  4 ]&#xA;         [0  0  5  6  0  0  7  8 ]&#xA;         [9  10 0  0  11 12 0  0 ]&#xA;         [13 14 0  0  15 16 0  0 ]&#xA;         [0  0  9  10 0  0  11 12]&#xA;         [0  0  13 14 0  0  15 16]]&#xA;&#xA;n = 3&#xA;qubits = {2, 0}&#xA;Operation: [[1  2  3  4 ]&#xA;            [5  6  7  8 ]&#xA;            [9  10 11 12]&#xA;            [13 14 15 16]]&#xA;Return: [[1  3  0  0  2  4  0  0 ]&#xA;         [9  11 0  0  10 12 0  0 ]&#xA;         [0  0  1  3  0  0  2  4 ]&#xA;         [0  0  9  11 0  0  10 12]&#xA;         [5  7  0  0  6  8  0  0 ]&#xA;         [13 15 0  0  14 16 0  0 ]&#xA;         [0  0  5  7  0  0  6  8 ]&#xA;         [0  0  13 15 0  0  14 16]]&#xA;Wow, things get weird.&#xA;&#xA;Operation: 2^m x 2^m identity matrix&#xA;Return: 2^n x 2^n identity matrix&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;n = 5&lt;/p&gt;&#xA;&lt;p&gt;qubits = {3, 0, 4, 2, 7}&lt;/p&gt;&#xA;&lt;p&gt;Operation: &lt;a href=&quot;https://www.youtube.com/watch?v=dQw4w9WgXcQ&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pastebin&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Return: [Pastebin] (TODO)&lt;/p&gt;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&lt;p&gt;As usual, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/73884&quot;&gt;standard loopholes&lt;/a&gt; apply. Builtins are allowed, but try to include a solution &lt;em&gt;sans&lt;/em&gt; builtin as well.&lt;/p&gt;&#xA;&lt;p&gt;You can 1-index or reverse the list if desired.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/73884&quot;&gt;I/O is flexible.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest solution (in bytes) in each language wins!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Sandboxy stuff&lt;/h1&gt;&#xA;&lt;p&gt;Anything worth mentioning that I missed?&lt;/p&gt;&#xA;&lt;p&gt;Is there another application of this that might be easier to explain and scare fewer people off?&lt;/p&gt;&#xA;&lt;p&gt;Thanks!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="73884" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-04-22T21:10:25.290" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="16269" PostTypeId="2" ParentId="2140" CreationDate="2018-04-21T16:29:53.757" Score="-6" Body="&lt;h1&gt;Smallest code to import in G++&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given some head files that need to import, return the shortest code to do so.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You are allowed to access &lt;code&gt;include/&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;You should consider both &lt;code&gt;#include &amp;lt;xxx&amp;gt;&lt;/code&gt; and &lt;code&gt;#include &quot;xxx&quot;&lt;/code&gt;(used in e.g. &lt;code&gt;backward/hash_set #include &quot;backward_warning.h&quot;&lt;/code&gt;), but not &lt;code&gt;#import&lt;/code&gt; (std don't use &lt;code&gt;#import&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Sample input &lt;code&gt;['string']&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sample output &lt;code&gt;#import&amp;lt;map&amp;gt;&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/150895/busy-beaver&quot;&gt;Related&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;What more assumption necessary? (&lt;code&gt;#if&lt;/code&gt; don't effect imported heads?)&lt;/li&gt;&#xA;&lt;li&gt;Time limit necessary?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c%2b%2b&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c++&amp;#39;&quot; rel=&quot;tag&quot;&gt;c++&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-04-23T01:34:39.990" LastActivityDate="2018-04-23T01:34:39.990" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="16270" PostTypeId="2" ParentId="2140" CreationDate="2018-04-21T17:52:25.093" Score="-4" Body="&lt;p&gt;[Posted, but reference kept]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a function with boolean inputs &lt;em&gt;a&lt;/em&gt;&lt;sub&gt;1&lt;/sub&gt;, ..., &lt;em&gt;a&lt;/em&gt;&lt;sub&gt;&lt;em&gt;n&lt;/em&gt;&lt;/sub&gt; and a boolean output, output an array of numbers 0 to &lt;em&gt;n&lt;/em&gt; satisfying:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For each item in the truth value, if (from the array you output, we repeatedly remove two adjacent numbers &lt;em&gt;x&lt;/em&gt; and &lt;em&gt;y&lt;/em&gt; satisfying that, for each integer &lt;em&gt;n&lt;/em&gt; between &lt;em&gt;x&lt;/em&gt;+0.5 and &lt;em&gt;y&lt;/em&gt;+0.5, &lt;em&gt;a&lt;sub&gt;n&lt;/em&gt;&lt;/sub&gt;=1), we can get an empty result array iff the given function's output is 1. You can assume the result exist.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sample input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a[1] a[2] result&#xA;0    0    0&#xA;0    1    0&#xA;1    0    0&#xA;1    1    1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Sample output: &lt;code&gt;0 2&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sample input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a[1] a[2] result&#xA;0    0    0&#xA;0    1    1&#xA;1    0    1&#xA;1    1    1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Sample output: &lt;code&gt;0 1 2 0 1 2&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sample input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a[1] a[2] result&#xA;0    0    1&#xA;0    1    1&#xA;1    0    1&#xA;1    1    1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Sample output: (empty)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;shortest code win, but optimizing running time and result length is encouraged(I won't accept but I may upvote)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may check your answer &lt;a href=&quot;https://tio.run/##pVDLboMwELzzFZMcElOertRLHSrlkh/IEeVAqUmhyFTYiZCqfDu1wyOgHKq2B9u7szM76y2ScyLTOv9UnqjeeNtmJ5GqvBLYka2LvY0vC8iqGuSc1GiQC2w7EDCIRIS9L8s85cRmV3hk55H0Sy6O6p0h9zyGQTjhFBFlKDY3YuE4N9qEqAxRbaJmZKo5E8gzECLj4uCE/pOnbDzApB4dgQ1CrFZYOE2sNDyXA681Tz7YBLpY95FxUS/DGLoFggCiwvKqXk7UZjey303oQg9i@2kl0kSRAS4catvszqV7uzsItEZWJffL6kgaF7IXmEEWw@KwiLCNm8mXaq5OtUCWlJKzsZ85fUXVJ124WNP2urojV/LQZh2G62eE7pjSWUrnVWqqtEsv3RPrrz8edGhbevA/mNG5Gf3JjGo/F33wK2P6D@PBqG2/AQ&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-04-27T11:16:54.490" LastActivityDate="2018-04-27T11:16:54.490" CommentCount="2" ContentLicense="CC BY-SA 3.0" />
  <row Id="16272" PostTypeId="1" CreationDate="2018-04-21T23:30:27.013" Score="11" ViewCount="361" Body="&lt;p&gt;I'm serious. Does anybody here remember viewing &lt;em&gt;any pages&lt;/em&gt; on PPCG.SE before the fifth of this month?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because according to &lt;a href=&quot;https://codegolf.stackexchange.com/site-analytics&quot;&gt;the site analytics&lt;/a&gt; (5k+ only), the only time anybody has &lt;em&gt;ever&lt;/em&gt; visited or viewed pages on this site was between April 5th and April 10th, 2018.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Hq5Nv.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Hq5Nv.png&quot; alt=&quot;Hmm&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is rather strange, because the other graphs (such as posts and votes) seem to be quite active. Could it be that everyone has actually just been using Stack Exchange API calls to browse PPCG without realizing it?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;In seriousness, I have no idea what's happening here. Can anybody repro this? Is this happening on any other sites? (I don't have enough reputation to access site analytics on any other site.)&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="1144" LastEditDate="2018-08-08T23:54:59.070" LastActivityDate="2019-05-25T03:06:56.113" Title="Has anybody used PPCG.SE before April 5th?" Tags="|bug|status-completed|status-bydesign|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="16273" PostTypeId="2" ParentId="2140" CreationDate="2018-04-22T03:18:30.737" Score="3" Body="&lt;h1&gt;Rebuild My Scrabble Board&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/board-game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;board-game&amp;#39;&quot; rel=&quot;tag&quot;&gt;board-game&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My daughter and I have an ongoing Scrabble tournament. We enjoy admiring the board at the end of a game. But recently we knocked over the board and didn't get a chance to get a good look or take a picture. Fortunately, we kept track of all our moves. Your challenge is to take the list of moves and use it to rebuild the Scrabble board.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each move includes 4 pieces of information&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Column - &lt;code&gt;A&lt;/code&gt; - &lt;code&gt;O&lt;/code&gt;, like the column label of a typical spreadsheet. Upper or lower case is OK, but you only need to support one or the other.&lt;/li&gt;&#xA;&lt;li&gt;Row - &lt;code&gt;1&lt;/code&gt; - &lt;code&gt;15&lt;/code&gt;, like the row label of a typical spreadsheet. 0-indexed &lt;code&gt;0&lt;/code&gt; - &lt;code&gt;14&lt;/code&gt; is acceptable.&lt;/li&gt;&#xA;&lt;li&gt;Orientation - H=Horizontal, V=Vertical - Upper or lower case is OK, or you may choose any other 2 printable ASCII characters.&lt;/li&gt;&#xA;&lt;li&gt;Tiles - &lt;code&gt;A&lt;/code&gt; - &lt;code&gt;Z&lt;/code&gt; plus &lt;code&gt;@&lt;/code&gt; for blank. Upper or lower case is OK, but you only need to support one or the other. You can use a different printable ASCII character for blank if you prefer, but not the space character or a period. The tiles for a move may be a string or a list of characters - e.g., &lt;code&gt;CAT&lt;/code&gt; or &lt;code&gt;(C,A,T)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Input format may be a tuple, list, separate lines (4 per move) or any other reasonable format. Column + Row may be combined, spreadsheet-style (e.g., &lt;code&gt;A1&lt;/code&gt;, &lt;code&gt;O15&lt;/code&gt;), but the orientation and tiles must be separate fields. Column can't be numeric - that is easy for the computer but in the middle of a game we have enough to keep track of, so remembering which # is Row and which # is Column would be too confusing - spreadsheet notation is easy to remember.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The completed Scrabble board is to be printed in a format similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/92055/draw-an-empty-scrabble-board&quot;&gt;Draw an Empty Scrabble Board&lt;/a&gt;. However, the double/triple squares are not printed and the moves are, obviously, included. Specifically:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;15x15 matrix&lt;/li&gt;&#xA;&lt;li&gt;Unused spaces display as a period &lt;code&gt;.&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;No leading spaces allowed.&lt;/li&gt;&#xA;&lt;li&gt;Trailing spaces allowed.&lt;/li&gt;&#xA;&lt;li&gt;One line feed at the end of each row.&lt;/li&gt;&#xA;&lt;li&gt;Up to one leading and one trailing line feed permitted.&lt;/li&gt;&#xA;&lt;li&gt;Blank tiles are to be output using the same character as input (default &lt;code&gt;@&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each move is placed starting with the first tile in the specified location. Each additional tile is to be placed in the &lt;strong&gt;next available&lt;/strong&gt; location. In other words, your program must keep track of filled locations and skip them, just like a player placing tiles on the board.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What you &lt;strong&gt;don't need to worry about&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Invalid words - if my daughter and I decided it was OK, you don't have to check it.&lt;/li&gt;&#xA;&lt;li&gt;Invalid locations - these are real moves, so there will of course be enough space to place all the tiles, and you don't have to double-check that a move starts on an empty space (but you can do that if it makes your algorithm shorter since you do have to check for all the other tiles in each move).&lt;/li&gt;&#xA;&lt;li&gt;Proper use of the standard Scrabble set of tiles - e.g., you don't have to check that there are only 2 blanks, 1 Z, etc.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;[&lt;strong&gt;Sandbox note:&lt;/strong&gt; Plan to include a couple of complete games plus a few shorter examples to highlight particular issues]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(G,8,H,CAT)&#xA;(G,9,V,OMPUTE)&#xA;(F,9,H,RB)&#xA;(H,7,H,TIME)&#xA;(I,6,V,BE)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;...............&#xA;...............&#xA;...............&#xA;...............&#xA;...............&#xA;........B......&#xA;.......TIME....&#xA;......CAT......&#xA;.....ROBE......&#xA;......M........&#xA;......P........&#xA;......U........&#xA;......T........&#xA;......E........&#xA;...............&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input and output can be given by &lt;a href=&quot;http://meta.codegolf.stackexchange.com/q/2447/42963&quot;&gt;any convenient method&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Either a full program or a function are acceptable. If a function, you can return the output rather than printing it.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://meta.codegolf.stackexchange.com/q/1061/42963&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so all usual golfing rules apply, and the shortest code (in bytes) wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="69008" LastEditorUserId="69008" LastEditDate="2018-04-22T16:09:10.107" LastActivityDate="2018-04-22T16:09:10.107" CommentCount="7" ContentLicense="CC BY-SA 3.0" />
  <row Id="16275" PostTypeId="2" ParentId="2140" CreationDate="2018-04-22T13:19:04.660" Score="1" Body="&lt;h1&gt;Knightmare in 1024 bytes of (JavaScript?)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/board-game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;board-game&amp;#39;&quot; rel=&quot;tag&quot;&gt;board-game&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Board&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The board is a 16x16 grid of squares. It does not wrap, so the outer edges are an impassable boundary.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Pieces&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Each piece is like a Chess knight, and will be referred to as a &lt;strong&gt;&lt;em&gt;knight&lt;/em&gt;&lt;/strong&gt;. It moves to a square that is two squares away horizontally and one square vertically, or two squares vertically and one square horizontally. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://commons.wikimedia.org/wiki/File:Chess.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/6/6f/Chess.png&quot; alt=&quot;Chess board showing a knight and its moves&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A knight can move to any of these squares, regardless of whether it is occupied. There is no limit to how many knights may occupy the same square at the same time.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Players&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a 2 player game. Each player has 16 knights. Knights cannot be removed from the board so there will still be 16 knights per player at the end of the game.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Turns&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Each turn both players move all 16 of their knights simultaneously (that is, all 32 knights move at the same time).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Costs&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Each square has a &lt;strong&gt;&lt;em&gt;cost&lt;/em&gt;&lt;/strong&gt;, which is a non-negative integer, initially set to zero. Each time a knight visits a square, the cost of that square is increased by 1. To be explicit, if N knights land on a square in the same turn, that square's cost is increased by N.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Penalties&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;After each turn, each knight incurs a &lt;strong&gt;&lt;em&gt;penalty&lt;/em&gt;&lt;/strong&gt;, which is the cost of the square it occupies, plus the number of other knights occupying the same square (regardless of whether they are friend or foe).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The player's &lt;strong&gt;&lt;em&gt;cumulative penalty&lt;/em&gt;&lt;/strong&gt; is zero at the start of a game, and is increased by each knight's penalty each turn (for all 16 of its knights).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Winning&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A game ends after 1024 turns. The winner is the player with the lowest cumulative penalty.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The player is supplied with:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;an array showing the cost for each square&lt;/li&gt;&#xA;&lt;li&gt;an array showing the number of its own knights for each square&lt;/li&gt;&#xA;&lt;li&gt;an array showing the number of its opponent's knights for each square&lt;/li&gt;&#xA;&lt;li&gt;an array showing the total knights for each square&lt;/li&gt;&#xA;&lt;li&gt;an array of coordinates for its own knights&lt;/li&gt;&#xA;&lt;li&gt;an array of coordinates for its opponent's knights&lt;/li&gt;&#xA;&lt;li&gt;its own cumulative penalty&lt;/li&gt;&#xA;&lt;li&gt;its opponent's cumulative penalty&lt;/li&gt;&#xA;&lt;li&gt;the turn number&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The player responds with a move for each of its 16 knights. Each move is a number from 0 to 7, indicating the direction to move, numbered clockwise from the top. The response must be received within 5ms.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Invalid moves&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Since the edge of the board is impassable, sometimes there will be fewer than 8 valid moves available for a given knight. If an invalid move is given, it will be reflected vertically and/or horizontally to give a valid move, and that move will be made instead. This means every knight will move every turn - none will ever stand still.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Each entry provides the body of a JavaScript function that is no more than 1024 bytes.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'm not settled on which language to use yet. I like the idea of using a different language for each KotH. I'm considering maybe Japt or APL for this one. Ideally something terse since golfing is part of the challenge here.&lt;/li&gt;&#xA;&lt;li&gt;Fixed starting configuration (for example, players in a line along opposite edges of the board), or random initial placement?&lt;/li&gt;&#xA;&lt;li&gt;Leaning towards a board that does not wrap. Any reasons to avoid this?&lt;/li&gt;&#xA;&lt;li&gt;I've put placeholder values for the number of bytes, the size of the board, and the number of knights per player. Any feedback on how to improve these values welcome.&lt;/li&gt;&#xA;&lt;li&gt;I'm not sure whether to make staying still a valid move. I'd prefer to keep it simple and have 8 possible moves with no possibility of staying still.&lt;/li&gt;&#xA;&lt;li&gt;I'm currently deciding between the penalty being the cost plus the number of other knights on the same square, or the cost times the number of knights on the square.&lt;/li&gt;&#xA;&lt;li&gt;I need to settle on input and output that are suitable for both golfing the contestant code and keeping things running reasonably quickly.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2018-08-28T00:06:55.680" LastActivityDate="2018-08-28T00:06:55.680" CommentCount="16" ContentLicense="CC BY-SA 4.0" />
  <row Id="16276" PostTypeId="2" ParentId="2140" CreationDate="2018-04-22T15:25:45.403" Score="1" Body="&lt;h1&gt;Golf the linux kernel&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; rel=&quot;tag&quot;&gt;compression&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This file &lt;em&gt;[to do: make the file and provide a link]&lt;/em&gt; contains all the code in the Linux kernel, concatenated together into a single file. Your task is to output this exact file.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The code in the file has been stripped of all comments, except for the copyright notice at the top, which is a legal necessity in order to distribute it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenge, so your score is the size of your submission in bytes, and the smallest score wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your submission will contain multiple files (for example, code and a separate data file), please take note of the rules on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4934/21034&quot;&gt;scoring&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12821/21034&quot;&gt;directory structure&lt;/a&gt; for multi-file submissions. Any data that your code uses must be included in your score.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Sandbox note&lt;/strong&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;This is an unusual &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenge, in that the specified output consists of a really huge file. (Probably in the hundreds of Mb.) Normally that would mean built-in compression methods would dominate, but the Linux kernel has a lot of structure in it, both due to the grammar of C and due to the strict coding standards. For that reason I would expect customised algorithms to out-perform standard ones, so it should make for an interesting open-ended challenge along the lines of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69930/paint-starry-night-objectively-in-1kb-of-code&quot;&gt;Paint Starry Night&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/152856/write-moby-dick-approximately&quot;&gt;Write Moby Dick&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="21034" LastEditorUserId="21034" LastEditDate="2018-04-22T16:14:20.927" LastActivityDate="2018-04-22T16:14:20.927" CommentCount="15" ContentLicense="CC BY-SA 3.0" />
  <row Id="16278" PostTypeId="2" ParentId="2140" CreationDate="2018-04-22T20:59:52.913" Score="2" Body="&lt;h1&gt;Single-Digit Representations of Natural Numbers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/expression-building&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;expression-building&amp;#39;&quot; rel=&quot;tag&quot;&gt;expression-building&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://inderjtaneja.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Dr. Inder Taneja&lt;/a&gt; is a Mathematics Professor at the Federal University of Santa Catarina who wrote and published &quot;&lt;a href=&quot;https://arxiv.org/abs/1502.03501&quot; rel=&quot;nofollow noreferrer&quot;&gt;Single Digit Representations of Natural Numbers&lt;/a&gt;&quot;. In this paper, he describes each natural number from 0 to 1000 in terms of each of the digits 1 through 9 in as few digits as possible and using only the five basic arithmetic operations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the entry for &quot;282&quot; written only using the digit &quot;3&quot; looks like this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;3 + 3 * (3 * (3 ^ 3 + 3) + 3)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Similarly, &quot;466&quot; written using the digit &quot;7&quot; looks like this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;7 * 77 + 77 / 7 - 77 - 7&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is also described in the first half of &lt;a href=&quot;https://www.youtube.com/watch?v=-ruC5A9EzzE&quot; rel=&quot;nofollow noreferrer&quot;&gt;this video&lt;/a&gt; on the Numberphile youtube channel.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge will ask you to write a program (or function, class, etc.) which takes two inputs and outputs a valid mathematical expression according to the rules used by Dr. Taneja. Your score will be calculated based on the size of your code &lt;em&gt;and&lt;/em&gt; the quality of your outputs.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Details&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program (or function, class, etc.) which takes two integers as input. The first of these will be an integer from 0 to 1000, inclusive. The second number will be a digit from 1 to 9, inclusive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program shall output an expression of the first input as a series of arithmetic operations on numbers whose digits are exclusively the digit specified as the second input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition to parentheses &lt;code&gt;(&lt;/code&gt; and &lt;code&gt;)&lt;/code&gt;, the following arithmetic operators are allowed in your output:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;addition (represented by the &lt;code&gt;+&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;subtraction (represented by the &lt;code&gt;-&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;multiplication (represented by the &lt;code&gt;*&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;division (represented by the &lt;code&gt;/&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;power (represented by the &lt;code&gt;^&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Numbers, as stated before, must be composed entirely of the digit specified by the second input, but they can be any number of digits. Numbers can be positive or negative. Number tokens cannot contain any characters besides the digit specified and, if negative, a &lt;code&gt;-&lt;/code&gt; at the beginning.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any form and amount of whitespace, including no whitespace at all, is allowed around each token in your output, where &quot;token&quot; refers to a number, operator, or parentheses. Your program's output may not contain any other characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The order of operations are evaluated in &lt;a href=&quot;https://en.wikipedia.org/wiki/Order_of_operations&quot; rel=&quot;nofollow noreferrer&quot;&gt;the usual manner&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Dr. Taneja claims that his answers use &quot;as few digits as possible&quot;; unfortunately, his paper does not show how to prove that a solution is truly minimal. In the spirit of preserving that goal, however, the quality of your solutions will contribute to your score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The quality of an output is measured, as Dr. Taneja says, by the number of digits used. For example, consider the output for &quot;466&quot; and &quot;7&quot;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;7 * 77 + 77 / 7 - 77 - 7&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This has a score of 1 + 2 + 2 + 1 + 2 + 1 = 9. &lt;strong&gt;Smaller is better.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code's score is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;score = 2 * &amp;lt;worst_scoring_output&amp;gt; + &amp;lt;solution_bytecount&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The lowest scoring valid solution wins.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may determine your worst output either by test battery (trying every input) or logical proof. The following shell script can be used to compute your worst-scoring output, assuming your program is an executable which takes input as command-line arguments and provides output to stdout on a single line. When executing this script, provide the path to your program executable as a command-line argument.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;// TODO: write a shell script which could compute your bonus score&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input and output may use &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;any convenient method&lt;/a&gt;. This includes writing a function which takes the inputs as arguments to the function and returns or prints a string as described.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the size of your code in bytes forms a significant part of your score. The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;standard loopholes&lt;/a&gt; are forbidden, this includes parsing the original paper to &quot;look up&quot; Dr. Taneja's solution for a combination of inputs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Reasonable adjustments to the output format are allowed; for instance: if your language has a native &lt;code&gt;Expression&lt;/code&gt; object for mathematical expressions but its &lt;code&gt;toString()&lt;/code&gt; (or equivalent) method represents the power operator as two asterisks rather than a caret, you may use the native representation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Similarly, if it is easier for you to format your output as an equation rather than a one-sided expression, you may do so. For example, you may output &lt;code&gt;&amp;lt;number&amp;gt; = &amp;lt;expression&amp;gt;&lt;/code&gt; or &lt;code&gt;&amp;lt;expression&amp;gt; = &amp;lt;number&amp;gt;&lt;/code&gt; rather than simply &lt;code&gt;&amp;lt;expression&amp;gt;&lt;/code&gt; (where the number is the first input to the program and the expression is the output as defined in the challenge section). Note that in this case, only the digit count of your expressions contribute to your score.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example Input and Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your outputs may vary, but are still valid provided all explicitly-stated rules are respected.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;282 3&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;3 + 3 * (3 * (3 ^ 3 + 3) + 3)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;0 7&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;7 - 7&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;1000 9&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;999 + 9 / 9&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;466 7&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;7 * 77 + 77 / 7 - 77 - 7&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="66076" LastEditorUserId="66076" LastEditDate="2018-04-25T13:55:16.810" LastActivityDate="2018-04-25T13:55:16.810" CommentCount="14" ContentLicense="CC BY-SA 3.0" />
  <row Id="16280" PostTypeId="1" CreationDate="2018-04-23T19:41:33.220" Score="4" ViewCount="229" Body="&lt;p&gt;The .bss section is simply a way of saying 'I want this amount of space beforehand'&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You cannot store extra information in the section, it's entire purpose is preallocating space, and it does not allow initializing the data beforehand. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should the size of the .bss section count against the score?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is aimed at x86 Assembly answers, and probably isn't applicable towards C/C++/Jelly/Brainfuck and others.&lt;/p&gt;&#xA;" OwnerUserId="77964" LastEditorUserId="77964" LastEditDate="2018-04-23T19:49:57.747" LastActivityDate="2018-04-23T21:51:34.427" Title="Should the .bss section count against an assembly program's score?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 3.0" />
  <row Id="16282" PostTypeId="2" ParentId="16280" CreationDate="2018-04-23T21:51:34.427" Score="6" Body="&lt;h1&gt;Yes, it should&lt;/h1&gt;&#xA;&lt;p&gt;This answer is very generic and does not apply to x86 exclusively, but rather to assembly in general.&lt;/p&gt;&#xA;&lt;h3&gt;For assembly source code&lt;/h3&gt;&#xA;&lt;p&gt;All statements in the .bss section are definitely part of the source code and are similar to -- say -- array declarations in other languages. The program can't possibly compile without them.&lt;/p&gt;&#xA;&lt;h3&gt;For executable dumps&lt;/h3&gt;&#xA;&lt;p&gt;The .bss section will basically be stored as a total size to be allocated at runtime. It's a small overhead but, again, the program could not work without this information.&lt;/p&gt;&#xA;" OwnerUserId="58563" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-04-23T21:51:34.427" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="16285" PostTypeId="2" ParentId="2140" CreationDate="2018-04-24T14:06:56.350" Score="1" Body="&lt;h1&gt;Decode my Alphabet Code (Cops)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;&lt;em&gt;This is my first C&amp;amp;R challenge, so I thought I'd better post it in the sandbox. This is only the Cops thread and it's still missing some usual C&amp;amp;R rules (such as explaining what should be done once a submission has been cracked).&lt;/em&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is the Cops' thread of a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; challenge. &lt;em&gt;[Link to the Robbers' thread goes here.]&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Your task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As a Cop, you must write either a full program or a function that meets the following requirements.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A non-empty string made of at most 26 distinct characters in a given code page. The input is guaranteed to be valid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The code page is either UTF-8 or -- at your option and if applicable -- a specific code page used by your language.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A string of the same length and in the same code page where the first encountered character is replaced with &lt;strong&gt;A&lt;/strong&gt;, the second encountered character (distinct from the first one) is replaced with &lt;strong&gt;B&lt;/strong&gt;, and so on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance, the expected output for &lt;code&gt;Hello, World!&lt;/code&gt; is &lt;code&gt;ABCCDEFGDHCIJ&lt;/code&gt;, where &lt;code&gt;A=H&lt;/code&gt;, &lt;code&gt;B=e&lt;/code&gt;, &lt;code&gt;C=l&lt;/code&gt;, etc.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Code restriction&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your code must be a valid input for itself. In other words, it must consist of at most 26 distinct characters in the chosen code page. (But of course, each distinct character may be used several times.)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Your submission&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your submission must contain:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The language used&lt;/li&gt;&#xA;&lt;li&gt;The code page used&lt;/li&gt;&#xA;&lt;li&gt;The size of the code in this code page&lt;/li&gt;&#xA;&lt;li&gt;A brief description explaining the nature of your code (program or function) and the I/O formats it's using, in case it slightly differs from string/string.&lt;/li&gt;&#xA;&lt;li&gt;The output produced by applying the transformation to your code&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# MyLanguage, 32 characters in MyLanguage code page&#xA;&#xA;A function taking an array of characters and returning a string.&#xA;&#xA;ABCADAEFGHIEJKDKLMEBCLNEOPPJLNEO&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Robbers' task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Robbers must crack your submission by finding a working program that produces &lt;em&gt;exactly&lt;/em&gt; the same output once transformed. (Finding a shorter program is &lt;em&gt;not&lt;/em&gt; a valid crack.)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If your answer remains uncracked for a week, you can mark it as &lt;em&gt;Safe&lt;/em&gt; and unveil the original code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner is the shortest uncracked answer. In the case of a tie, the oldest answer wins.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;&lt;em&gt;Sandbox questions&lt;/em&gt;&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Is it a dupe or too close to an existing challenge?&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/revisions/16285/3&quot;&gt;&lt;strong&gt;In the original version&lt;/strong&gt;&lt;/a&gt;, the encoding was forced to UTF-8. I'm still not sure which option is the best, so I'm interested in any feedback about that.&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;All other comments and suggestions are much welcomed!&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="58563" LastEditorUserId="58563" LastEditDate="2018-04-24T15:16:21.743" LastActivityDate="2018-04-24T15:16:21.743" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="16287" PostTypeId="2" ParentId="2140" CreationDate="2018-04-25T08:02:43.980" Score="0" Body="&lt;p&gt;Do other programming languages allow &lt;strong&gt;post-assignment&lt;/strong&gt;, like R?&#xA;Can you force it? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In many programming languages assignment works like this, where a value such as 5 is assigned to x. &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;int x = 5; // C++&#xA;&#xA;x = 5 # etc ... // Python &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;But in R, you can do this (and this is the first I've ever heard of this): &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;5 -&amp;gt; x # where 5 is assigned to x in reverse order.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This has some advantages. You can do several operations and then save the results to a variable at the end, stopping the operations. As an example, &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;library(dplyr) # allows then (%&amp;gt;%) statements &#xA;&#xA;(1:10) %&amp;gt;% square() %&amp;gt;% sum() -&amp;gt; y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where I define an array of numbers 1 to 10: {1, 2, 3, 4, 5, 6, 7, 8, 9, 10},&lt;/p&gt;&#xA;&#xA;&lt;p&gt;square each of those: {1^2, 2^2, 3^2, 4^2, 5^2, 6^2, 7^2, 8^2, 9^2 , 10^2},&lt;/p&gt;&#xA;&#xA;&lt;p&gt;sum up the sequence 1^2 + 2^2 + 3^2 + 4^2 + 5^2 + 6^2 + 7^2, 8^2 + 9^2 + 10^2&lt;/p&gt;&#xA;&#xA;&lt;p&gt;and assign that sum of squares to variable y.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;y holds a value of 385, matter of fact. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;To do something like that, though I would have to define a square function:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;square &amp;lt;- function(x){return(x * x)}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You assignment is to create a post-assignment overloaded operator like &quot;-&gt;&quot; which allows assignment like 5 -&gt; x.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bonus points if the overloaded assignment operator is variable type insensitive, working on numbers, characters, strings, etc ...    &lt;/p&gt;&#xA;" OwnerUserId="69968" LastEditorUserId="69968" LastEditDate="2018-04-25T08:11:57.010" LastActivityDate="2018-04-25T08:11:57.010" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="16291" PostTypeId="2" ParentId="2140" CreationDate="2018-04-25T20:56:18.740" Score="0" Body="&lt;h1&gt;Go Fish!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/java&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;java&amp;#39;&quot; rel=&quot;tag&quot;&gt;java&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&quot;Go Fish&quot; is a childhood card game where you try to obtain pairs by either drawing from the deck or taking them from the other players.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The rules can vary by who you ask, but the rules that this challenge will use are these:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Everyone starts with a hand of five cards.&lt;/li&gt;&#xA;&lt;li&gt;Play goes in a circle.&lt;/li&gt;&#xA;&lt;li&gt;On your turn, you can call a card and another player.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If that player has that card in their hand, then you get it from them.&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, you draw a new card from the deck. If the deck is empty, you don't get anything.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;If you have two of the same card, then both are removed from your hand and set aside.&lt;/li&gt;&#xA;&lt;li&gt;The game lasts until the deck and all players' hands are empty, or until the deck is empty and there are no pairs made for 2 full circles.&lt;/li&gt;&#xA;&lt;li&gt;The winner is the player that ends with the most pairs.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There will be 20 rounds with every bot in them in random order. The winner will be the bot that gets the most &lt;em&gt;cumulative&lt;/em&gt; matches across all rounds.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Deck&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There will be 40 unique cards in the deck, each identified by a string. Each one will appear twice in the deck for each bot in play.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Implementation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;To do as soon as I finish the runner.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;For the unique cards, I was thinking of doing a fish theme. Examples include:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Water-type pokémon&lt;/li&gt;&#xA;&lt;li&gt;State fish for various states&lt;/li&gt;&#xA;&lt;li&gt;Commands, functions, or programs in &gt;&amp;lt;&gt; and *&gt;&amp;lt;&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Any other ideas?&lt;/p&gt;&#xA;" OwnerUserId="62402" LastEditorUserId="62402" LastEditDate="2018-04-26T14:35:01.493" LastActivityDate="2018-04-26T14:35:01.493" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="16295" PostTypeId="2" ParentId="2140" CreationDate="2018-04-27T13:58:18.043" Score="-5" Body="&lt;h1&gt;Shortest Possible 240 Sided Die Program: Using No Constant Greater than 6&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Have you ever played Yahtzee with a 240-sided die? No, probably not. Anyway, I came up with the idea of a 240-sided die program, but to make it hard, you cannot use a constant with an absolute value greater than 6. For example, &lt;code&gt;randInt(1,240)&lt;/code&gt; wouldn't work. The chances of any number 1-240 must be completely equal, and using expressions that represent numbers with an absolute value larger than 240 is not allowed. For example, &lt;code&gt;randInt(1,4*6*2*5)&lt;/code&gt; is against the rules, since &lt;code&gt;4*6*2*5&lt;/code&gt; evaluates to 240. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; prohibited, and you're code golfing.&lt;/p&gt;&#xA;" OwnerUserId="80130" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-04-27T14:09:09.560" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="16296" PostTypeId="2" ParentId="2140" CreationDate="2018-04-27T16:12:29.050" Score="2" Body="&lt;h1&gt;The Derby Stakes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The Derby is a horse race run (near) annually since 1780 near the town of Epsom and is the middle leg of the Triple Crown. The race covers one mile, four furlongs, and six yards. Over the years it has had as few as 4 and as many as 34 entries. The fastest winning time was in 2010 at 2m31.33, but I'm old-fashioned and like horse race results only to the nearest fifth of a second. So let's call it 2:31 2/5.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We will ID horses by number from 0 or 1 (your choice) up to the number of horses in the race (could be anything from 4 to 34). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The task is to take a list of the &lt;em&gt;average horse speeds in miles per hour&lt;/em&gt; and produce a report of the race. The report has:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;the winning horse ID and its winning time;&lt;/li&gt;&#xA;&lt;li&gt;the other horse IDs in their order of finish and the difference between each time and the time of the horse that finished ahead of it.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;However:&lt;/p&gt;&#xA;&#xA;&lt;ol start=&quot;3&quot;&gt;&#xA;&lt;li&gt;the times are to the nearest fifth of a second. There can be ties, &lt;em&gt;which must be listed in random order&lt;/em&gt;; &lt;/li&gt;&#xA;&lt;li&gt;some horses might not finish the race, in which case their average speed is 0.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;I/O&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input will have between 4 and 34 non-negative numbers (average speeds) rounded to one decimal place, in any convenient format for your language. The horse ID is just the index (starting at 0 or 1) of their average speed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output can be any convenient format, as long as the winner is &quot;first&quot; (in the sense of top-most or left-most) and the other horses are listed in a way that makes their finishing order clear. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The times have to be rounded to the nearest fifth of a second, but otherwise can be represented however you like, such as the number of seconds, or some format like &lt;code&gt;2:31.4&lt;/code&gt; or whatever. If the time is in &quot;seconds flat&quot;, as they say, either &lt;code&gt;2:32.0&lt;/code&gt; or &lt;code&gt;2:32&lt;/code&gt; (for example) is fine. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For horses that don't finish the race, no time difference really makes sense, so anything that just indicates they didn't finish is fine. But the do have to appear in the report, and if more than one horse does not finish they have to be listed randomly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The point with the output is that it needs to be &lt;em&gt;clear&lt;/em&gt;, but the format itself is not so important. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You also need to state in your answer how you have ensured that ties are output in a random order. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test case&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;31.8, 0, 32.9, 32.1, 30.8, 31.8, 31.1, 33.1  &#xA;&#xA;8 2:43.6&#xA;3 0:01.0&#xA;4 0:04.0&#xA;1 0:01.6&#xA;6 0:00.0&#xA;7 0:03.8&#xA;5 0.01.8&#xA;2 DNF&#xA;&#xA;&quot;I made the ranking of ties random by using `rank(x, ties.method = &quot;random&quot;)` in R.&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I chose a particular time format and used &quot;DNF&quot; for the horse that didn't finish, but you don't need to adhere to these. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I will make more test cases if this challenge seems interesting to anyone.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt;. Standard loopholes forbidden.&lt;/p&gt;&#xA;" OwnerUserId="79980" LastActivityDate="2018-04-27T16:12:29.050" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="16297" PostTypeId="2" ParentId="2140" CreationDate="2018-04-29T07:36:38.333" Score="3" Body="&lt;h1&gt;Arithmetic quine&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a quine.&lt;br&gt;&#xA;Well that's not very original challenge so let's spice things up.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a quine which when once or multiple times appended to itself (see Appending)&#xA;then performs an arithmetic operation of your choice.&lt;br&gt;&#xA;You can implement as many operations from the  as you want (see Scoring, Operations)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;:&lt;br&gt;&#xA;Let's say my code were &lt;code&gt;foobar&lt;/code&gt;. This would return &lt;code&gt;foobar&lt;/code&gt; because it's a quine.&lt;br&gt;&#xA;Now &lt;code&gt;foobarfoobar&lt;/code&gt; would preform + operation on two input numbers.&lt;br&gt;&#xA;&lt;code&gt;foobarfoobarfoobar&lt;/code&gt; could preform a * operation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note&lt;/strong&gt;: which operation you choose for whatever number of appended copies doesn't matter but you have to write it down in your answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example: Your code might be 4 times appended to preform addition, or it might need to be appended 5 times. It doesn't matter as long as you write the full list of the operations you implemented and the number of concatenations needed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Operations&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The list of operations you are allowed to implement is: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Addition&#xA;Subtraction&#xA;Multiplication&#xA;Integer Division&#xA;Integer exponentiation&#xA;Integer Factorial&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;score = bytes/(n_operations + 1)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bytes mean the bytes of the initial un-appended program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Appending&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All languages (even if 2D) must be appended by simply concatenating the program two or more times.&lt;/p&gt;&#xA;" OwnerUserId="66799" LastEditorUserId="66799" LastEditDate="2019-05-11T13:49:52.153" LastActivityDate="2019-05-11T13:49:52.153" CommentCount="15" ContentLicense="CC BY-SA 4.0" />
  <row Id="16299" PostTypeId="2" ParentId="2140" CreationDate="2018-04-30T04:08:30.363" Score="2" Body="&lt;h1&gt;How far can I throw a ball up the hill?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an initial velocity, an angle to throw the ball, and the angle of a hill, determine how far the ball will go before it hits the ground due to gravity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Refer to the image below. V=initial velocity vector, a1=angle of hill, a2=angle ball is thrown at, d=distance ball will travel&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://i.stack.imgur.com/77NB8.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/77NB8.png&quot; alt=&quot;Highly detailed image&quot;&gt;&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Inputs&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The velocity the ball is thrown at (m/s)&lt;/li&gt;&#xA;&lt;li&gt;The angle from level ground that the ball is thrown at (radians or degrees)&lt;/li&gt;&#xA;&lt;li&gt;The angle from level ground the hill is at&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The number of meters the ball travels before hitting the ground&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Specifics&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Gravity will pull the ball downwards at 9.81 m/s^2&lt;/li&gt;&#xA;&lt;li&gt;Due to floating point rounding, the answer only need be correct within 0.1 of my test case examples&lt;/li&gt;&#xA;&lt;li&gt;The input angle can be between 0 and pi/2 radians (or 90 degrees)&lt;/li&gt;&#xA;&lt;li&gt;An angle of 0 means the ball is thrown horizontally across the ground, which hits the ground at 0 meters&lt;/li&gt;&#xA;&lt;li&gt;An angle of pi/2 radians (or 90 degrees) means the ball is thrown vertically and hits the ground at 0 meters&lt;/li&gt;&#xA;&lt;li&gt;The angle of the hill will always be less or equal than the angle the ball is thrown at&lt;/li&gt;&#xA;&lt;li&gt;This is code golf, fewest bytes wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/63014/the-interview-the-front-nine&quot;&gt;Related to task 3&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;pi/4  (20, 0.7853981633974483, 0) = 40.8&#xA;pi/5  (20, 0.6283185307179586, 0) = 38.8&#xA;pi/6  (10, 0.5235987755982988, 0) = 8.8&#xA;pi/3  (10, 1.0471975511965976, 0) = 8.8&#xA;pi/2  (5,  1.5707963267948966, 0) = 0.0&#xA;0     (5,  0,                  0) = 0.0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm not sure what standard rules are used when accounting for floating point errors, is allowing a .1 margin of error fine?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test cases for angles &gt; 0 to come.&lt;/p&gt;&#xA;" OwnerUserId="79679" LastEditorUserId="79679" LastEditDate="2018-05-01T06:12:01.700" LastActivityDate="2018-05-01T06:12:01.700" CommentCount="9" ContentLicense="CC BY-SA 3.0" />
  <row Id="16302" PostTypeId="2" ParentId="2140" CreationDate="2018-04-30T11:41:04.873" Score="0" Body="&lt;h1&gt;PPCG Generalist Countdown&lt;/h1&gt;&#xA;&lt;p&gt;Write a function or program that takes no input and returns or outputs the current minimum number of new questions required for PPCG to hand out Generalist badges. Internet access is only allowed to the Stack Exchange API.&lt;/p&gt;&#xA;&lt;p&gt;The badges are handed out when the top 40 tags (measured by question count) each have at least 200 questions.&lt;/p&gt;&#xA;&lt;p&gt;Standard loopholes are disallowed. This is code-golf, so the shortest entry wins!&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stack-exchange-api&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stack-exchange-api&amp;#39;&quot; rel=&quot;tag&quot;&gt;stack-exchange-api&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/counting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;counting&amp;#39;&quot; rel=&quot;tag&quot;&gt;counting&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="60340" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-05-01T13:11:57.823" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="16303" PostTypeId="2" ParentId="2140" CreationDate="2018-04-30T12:23:06.150" Score="1" Body="&lt;h2&gt;Integers as &quot;polynomials&quot;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Suppose we use successive digits of an non-negative integer for coefficient, base and power respectively and construct a &quot;polynomial&quot;. For a 4-digit number we'll have:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;abcd&lt;/code&gt;  -&gt; &lt;code&gt;a*b^c + b*c^d + c*d^a + d*a^c&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each digit must go through the three roles exactly once. For the last two members we wrap around the right edge and use the first/second digit again.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example 1234 will represent the following &quot;polynomial&quot;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;1*2^3 + 2*3^4 + 3*4^1 + 4*1^2&lt;/code&gt; -&gt; &lt;code&gt;1*8 + 2*81 + 3*4 +4*1&lt;/code&gt; -&gt; &lt;code&gt;186&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We started with an integer and ended with an integer. That gives me the idea that we can feed the result into the procedure again and keep calculating. As it seems the numbers will sooner or later start repeating, leading to an endless loop. For example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;4 -&amp;gt; 1024 -&amp;gt; 12 -&amp;gt; 4 -&amp;gt; ...&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm interested in how many cycles are needed until we come to a number that has already been calulated.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Task:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Start with a non-negative integer and calculate my &quot;polynomial&quot; from it. Keep calculating using the result as input until you reach a number that has already been calculated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your answer must be theoretically correct if your language's integer types had infinite width, but you may use any integer type with at least 8 bits&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You can take the input as:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A non-negative integer&lt;/li&gt;&#xA;&lt;li&gt;A list of digits&lt;/li&gt;&#xA;&lt;li&gt;A string&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A single integer - the number of cycles until a known number is reached.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winning criteria:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes in each language wins. Explanations of the code are welcome!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 0:  1&#xA; 1:  1&#xA; 2: 34&#xA; 3:  5&#xA; 4:  3&#xA; 5:  3&#xA; 6: 29&#xA; 7: 48&#xA; 8: 33&#xA; 9: 20&#xA;10:  1&#xA;11: 35&#xA;12:  3&#xA;13: 30&#xA;14: 34&#xA;15:  2&#xA;16:  3&#xA;17: 35&#xA;18:  4&#xA;19:  5&#xA;20:  1&#xA;21:  3&#xA;22:  4&#xA;23: 79&#xA;24: 78&#xA;25: 36&#xA;26: 34&#xA;27: 15&#xA;28: 41&#xA;29: 57&#xA;30:  1&#xA;31: 30&#xA;32: 79&#xA;33:  3&#xA;34: 10&#xA;35: 45&#xA;36: 32&#xA;37:  9&#xA;38: 64&#xA;39: 10&#xA;40:  1&#xA;41: 34&#xA;42: 78&#xA;43: 10&#xA;44: 30&#xA;45: 16&#xA;46: 39&#xA;47: 13&#xA;48: 96&#xA;49:  7&#xA;50:  1&#xA;51:  2&#xA;52: 36&#xA;53: 45&#xA;54: 16&#xA;55: 11&#xA;56: 40&#xA;57:  4&#xA;58: 12&#xA;59: 17&#xA;60:  1&#xA;61:  3&#xA;62: 34&#xA;63: 32&#xA;64: 39&#xA;65: 40&#xA;66: 30&#xA;67:  4&#xA;68:  6&#xA;69: 77&#xA;70:  1&#xA;71: 35&#xA;72: 15&#xA;73:  9&#xA;74: 13&#xA;75:  4&#xA;76:  4&#xA;77:  9&#xA;78: 38&#xA;79:  6&#xA;80:  1&#xA;81:  4&#xA;82: 41&#xA;83: 64&#xA;84: 96&#xA;85: 12&#xA;86:  6&#xA;87: 38&#xA;88: 97&#xA;89: 13&#xA;90:  1&#xA;91:  5&#xA;92: 57&#xA;93: 10&#xA;94:  7&#xA;95: 17&#xA;96: 77&#xA;97:  6&#xA;98: 13&#xA;99: 69&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polynomial&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polynomial&amp;#39;&quot; rel=&quot;tag&quot;&gt;polynomial&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="75681" LastEditorUserId="69850" LastEditDate="2018-05-01T12:52:52.260" LastActivityDate="2018-05-01T12:52:52.260" CommentCount="4" ContentLicense="CC BY-SA 3.0" />
  <row Id="16304" PostTypeId="1" CreationDate="2018-04-30T15:20:15.563" Score="1" ViewCount="59" Body="&lt;p&gt;Should the p command be considered cheating in Funge-98 quines?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm asking because:&#xA;Unlike the g command it does not read source code, so it doesn't break &quot;No reading source code&quot; rule.&lt;br&gt;&#xA;But it does modify source code so it may be considered cheating?&lt;/p&gt;&#xA;" OwnerUserId="66799" LastActivityDate="2018-04-30T15:20:15.563" Title="p command in Funge-98 quines" Tags="|discussion|quine|" AnswerCount="0" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="16306" PostTypeId="2" ParentId="2140" CreationDate="2018-04-30T20:15:00.633" Score="4" Body="&lt;h1&gt;-(-(--x)--))&gt; Code Kebabs! &amp;lt;-(-(--x)--))&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Your goal is to parse Code Kebabs, they look like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-x--&amp;gt; 8&#xA;2 &amp;lt;-(-(--x)--))&#xA;-x-x-x--&amp;gt; -10&#xA;--x&amp;gt; 255&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A Code Kebab is made up of 3 parts, the stick, the tip (&amp;lt; and &gt;), and the stand (the number compared by)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;stick tip stand &#xA;--x-- &amp;gt;   -5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;The stick&lt;/h3&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The stick contains 4 operators, and the variable (x)&#xA;The operators are listed here, in order of precedence:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;( ... ) | Brackets. They are the &quot;veggies&quot; on a code kebab. Everything inside them runs before the rest of the kebab, with the last, deepest pair going first. Brackets can be nested.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;v-- | Suffix decrementation. This is one of the 4 parts of the stick, and decrements the value supplied to it by one.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;v-v | Subtraction. This is the 2nd part of the stick, and subtracts the two values.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;--x | Prefix decrementation. This is the 3rd part of the stick, and decrements the value supplied to it by one.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;-v | Negation. This is the 4th and final part of the stick, and inverts the value supplied. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Each operator returns it's result, and can be used as input for other operators.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The Tip&lt;/h3&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The tip is one of two symbols: &amp;lt; or &gt;&#xA;When the tip is &amp;lt;, the stand must be left of it, with the tip being left of the stick.&#xA;When it is &gt;, the stand is to it's right, with the tip being on the right of the stick.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The Stand&lt;/h3&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The stand is any integer. That's all there really is to say about it.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Execution of the kebab&lt;/h3&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;You can't execute a kebab without eating it!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Kebabs are executed in a loop until their condition (The result of the stick being less than the stand's value) is fulfilled. When execution is finished, the variable (x) is set to the result of the stick, X is printed, and execution resumes again unless the condition is fulfilled.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When execution starts for the first time, X is set to &lt;code&gt;10&lt;/code&gt; beforehand.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;TODO&lt;/h3&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Add test cases.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Clear a few things up.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Make the description of execution a bit clearer?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="77964" LastActivityDate="2018-04-30T20:15:00.633" CommentCount="8" ContentLicense="CC BY-SA 3.0" />
  <row Id="16308" PostTypeId="2" ParentId="5243" CreationDate="2018-04-30T22:07:13.027" Score="0" Body="&lt;h1&gt;250 and 500 rep for the next two decent TIO &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world&quot;&gt;Hello, World!&lt;/a&gt; golfs&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&quot;Decent&quot; here meaning in beating any solution on &lt;a href=&quot;https://rosettio.github.io/Hello%20World&quot; rel=&quot;nofollow noreferrer&quot;&gt;this page&lt;/a&gt; by at least 25%. Bounty may be awarded if under 25% if solution is especially impressive (subjective) - for example, if golfing in a language is particularly difficult.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note: jimmy23013 appears to be on track to claim both bounties right now - they will probably be awarded after the current one ends unless a more impressive solution appears.&lt;/p&gt;&#xA;" OwnerUserId="39244" LastActivityDate="2018-04-30T22:07:13.027" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="16309" PostTypeId="1" AcceptedAnswerId="16311" CreationDate="2018-05-01T11:08:21.367" Score="9" ViewCount="253" Body="&lt;p&gt;A simple question really: how strict is this community (or how strict does it want to be) about newlines when it comes to quines?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, is the Python quine&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;_='_=%r;print _%%_';print _%_&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;29 bytes, or is it 30 (including the trailing newline, since that's printed in its output)?&lt;/p&gt;&#xA;" OwnerUserId="21034" LastActivityDate="2018-05-02T10:48:29.987" Title="Quines and newlines" Tags="|discussion|quine|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 3.0" />
  <row Id="16311" PostTypeId="2" ParentId="16309" CreationDate="2018-05-01T12:47:43.677" Score="28" Body="&lt;h2&gt;If a newline is printed it must be part of the source code&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A lot of languages have multiple functions for printing, some of them will include a newline and some of them won't. It's the programmer's choice what function they use, if they choose to print a trailing newline it must be included in the source code because it's part of the output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Questions like for example KC challenges state whether it's fine to include newlines or not. So if a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; challenge does not specify whether that's ok, it should be required by default. The tag-wiki defines a quine as:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A quine is a program which produces its source as output.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It doesn't say &quot;&lt;em&gt;which produces its source plus additional characters as output&lt;/em&gt;&quot;, newlines are not really different from other characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm guessing this question targets the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69/golf-you-a-quine-for-great-good&quot;&gt;Golf you a quine for great good!&lt;/a&gt; challenge which has an even less ambiguous definition (emphasis mine): &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A quine is a non-empty computer program which takes no input and produces a copy of its own source code as its &lt;strong&gt;only&lt;/strong&gt; output.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This means no trailing spaces, non-printable chars, unicode characters or newlines. If we would ask whether it's fine to print an additional &lt;code&gt;a&lt;/code&gt; character, nobody would say that this is fine (unless the rules explicitly say so). Newlines should be treated the same as other characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Furthermore (and most importantly) most answers that currently include a newline as part of their output can be easily fixed&lt;sup&gt;[citation needed]&lt;/sup&gt; and we won't lose valuable content by enforcing the rules.&lt;/p&gt;&#xA;" OwnerUserId="48198" LastEditorUserId="73111" LastEditDate="2018-05-02T10:48:29.987" LastActivityDate="2018-05-02T10:48:29.987" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16312" PostTypeId="2" ParentId="2140" CreationDate="2018-05-01T12:48:37.277" Score="0" Body="&lt;p&gt;&lt;strong&gt;Given equations, determine values&lt;/strong&gt; &lt;em&gt;(what would be a good title?)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given these equations as input, write a program that determines which variable has the greatest, and which has the smallest value.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Equations:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x             &amp;lt;   y&#xA;2x            &amp;lt;   y + z&#xA;2x + 2y + z   &amp;lt;   2x + y + z&#xA;x,y,z         !=   0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&#xA;&lt;strong&gt;Rules:&lt;/strong&gt; &lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your code must mathematically determine which variable has the greatest/smallest value.&lt;/li&gt;&#xA;&lt;li&gt;As this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; the shortest answer in bytes wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="63144" LastEditorUserId="63144" LastEditDate="2018-05-01T15:41:18.820" LastActivityDate="2018-05-01T15:41:18.820" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="16313" PostTypeId="2" ParentId="2140" CreationDate="2018-05-01T13:40:45.203" Score="0" Body="&lt;p&gt;&lt;strong&gt;Building a Structured Outline&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a fictional document management system, input documents are structured with weighted headings. Lowest weighted headings are the most important. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a sample document: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;H1 All About Birds &lt;/p&gt;&#xA;&#xA;&lt;p&gt;H2 Kinds of Birds &lt;/p&gt;&#xA;&#xA;&lt;p&gt;H3 The Finch &lt;/p&gt;&#xA;&#xA;&lt;p&gt;H3 The Swan &lt;/p&gt;&#xA;&#xA;&lt;p&gt;H2 Habitats &lt;/p&gt;&#xA;&#xA;&lt;p&gt;H3 Wetlands &lt;/p&gt;&#xA;&#xA;&lt;p&gt;From this document we would like to produce an outline using nested ordered lists in HTML, which would look like this when rendered: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;All About Birds &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Kinds of Birds &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;The Finch &#xA;&#xA;The Swan &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Habitats &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Wetlands&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your code only needs to take the input list and transform it into the expected data structure, which will be printed and checked against the expected output. &lt;/p&gt;&#xA;" OwnerUserId="79311" LastActivityDate="2018-05-01T13:40:45.203" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="16315" PostTypeId="1" CreationDate="2018-05-01T18:39:13.410" Score="6" ViewCount="263" Body="&lt;p&gt;The Powder Toy is a falling-sand game with enough functionality to be classified as a interesting take on fungeoids.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, there are a few problems with this.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input/Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Programs (&lt;em&gt;simulations&lt;/em&gt;) written (&lt;em&gt;built&lt;/em&gt;) in The Powder Toy (&lt;em&gt;TPT&lt;/em&gt;) don't have any built-in IO functionality, but it can be done in many non-canonical ways. Should you write output to the screen, should you output it as an electric (SPRK particle) signal on a wire, or should you output it as data on FILT?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's  a similar problem for input. How should it be taken? From where? Can programs take input at arbitrary points, or does it have to be given at a specific position?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;TPT is also a bit of a challenge to score fairly. Scoring a program based on the size of the save file may be unfair, because they contain large amounts of &quot;fluff&quot; in the form of metadata (such as the save name, game version, and the names of various fields). The header itself requires about 150 bytes of overhead, and a save containing 8-9 particles has a full weight of nearly a kilobyte.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, scoring simulations based on the number of particles may also be unfair because particles can be used to store data.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Status as a Programming Language&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a simple question: Is TPT actually a programming language?&#xA;TPT &lt;em&gt;can&lt;/em&gt; be classified as a fungeoid, but is it actually a fungeoid? Is it even a language?&lt;/p&gt;&#xA;" OwnerUserId="77964" LastEditorUserId="61384" LastEditDate="2018-05-05T18:51:16.900" LastActivityDate="2021-12-19T04:51:57.957" Title="Input/Output format, scoring, and the status of The Powder Toy" Tags="|discussion|policy|" AnswerCount="4" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16316" PostTypeId="2" ParentId="16315" CreationDate="2018-05-01T18:39:13.410" Score="-4" Body="&lt;p&gt;This is &lt;em&gt;my own&lt;/em&gt; response to the question, to cover all the bases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First off, TPT is, truly, just a fungeoid. That's really what it should be classified as, because of two things: One, TPT is provably a Finite State Machine, and two, functional computers can be built in the game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On scoring TPT, I believe that it should be scored based on the particle count of the save. This probably isn't the best way, but the best way is likely many times more complicated, and I won't try and cover that here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I/O should be pretty simple, input anywhere, output anywhere. Of any type, essentially allowing the save's designer to choose their I/O format.&lt;/p&gt;&#xA;" OwnerUserId="77964" LastActivityDate="2018-05-01T18:39:13.410" CommentCount="1" ContentLicense="CC BY-SA 3.0" />
  <row Id="16317" PostTypeId="1" AcceptedAnswerId="16319" CreationDate="2018-05-01T19:00:02.033" Score="5" ViewCount="381" Body="&lt;p&gt;Related to &lt;a href=&quot;https://codegolf.stackexchange.com/a/163393/34718&quot;&gt;this quine answer&lt;/a&gt;. There was this comment:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;That meta question is not applicable to this answer. &lt;code&gt;document.body&lt;/code&gt; is not a function which you've created and are now printing the source of. &lt;code&gt;document.body&lt;/code&gt; is a function that returns an object with string attributes that &lt;strong&gt;contain the source code of the program&lt;/strong&gt;.&#xA;  – &lt;a href=&quot;https://codegolf.stackexchange.com/questions/163383/auto-cycler-quine/163393#comment396540_163393&quot;&gt;Jo King&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This comment basically says there is some abstraction between the source code and accessing it. To me, this still looks like the same thing as reading your own source code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should this be allowed in quines?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is not a duplicate of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4877/what-counts-as-a-proper-quine&quot;&gt;What counts as a proper quine?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even though the question is similar, there were enough likes on my questions in the comments on the JS answer that there is obviously still some clarification needed.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="34718" LastEditDate="2018-05-13T03:07:46.850" LastActivityDate="2018-05-13T03:07:46.850" Title="Is `document.body` reading your source code?" Tags="|discussion|quine|" AnswerCount="3" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16319" PostTypeId="2" ParentId="16317" CreationDate="2018-05-01T21:09:52.097" Score="23" Body="&lt;p&gt;If someone submits a program as &quot;C (Linux)&quot; which opens &lt;code&gt;/dev/sda1&lt;/code&gt; (typically the primary disk drive) and searches for the source of the program, that is reading its own source code, even though it doesn't technically open &quot;the&quot; file containing it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Extracting a JavaScript program from &lt;code&gt;document.body&lt;/code&gt; seems to me to be a direct analogue. There's a level of indirection, but &lt;a href=&quot;https://en.wikipedia.org/wiki/Duck_test&quot; rel=&quot;nofollow noreferrer&quot;&gt;it looks like a duck and quacks like a duck&lt;/a&gt;. It shouldn't be considered a permissible technique in a true quine.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-05-01T21:09:52.097" CommentCount="5" ContentLicense="CC BY-SA 3.0" />
  <row Id="16322" PostTypeId="2" ParentId="16317" CreationDate="2018-05-01T22:33:30.873" Score="-5" Body="&lt;p&gt;In the situation the link point, &lt;code&gt;document.body.innerText&lt;/code&gt; &lt;a href=&quot;https://developer.mozilla.org/en-US/docs/Web/API/Node/innerText&quot; rel=&quot;nofollow noreferrer&quot;&gt;don't point to the source code at all&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-05-06T05:01:30.820" LastActivityDate="2018-05-06T05:01:30.820" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16323" PostTypeId="2" ParentId="2140" CreationDate="2018-05-02T00:30:30.133" Score="5" Body="&lt;h1&gt;Efficient Tab Completion&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Many tools that programmers use on a daily basis, like bash and Emacs, have &lt;a href=&quot;https://en.wikipedia.org/wiki/Command-line_completion&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;tab completion&lt;/em&gt;&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Pressing &lt;kbd&gt;Tab&lt;/kbd&gt; in certain situations will attempt to complete the text at the cursor, from a set of possibilities. The term is &amp;quot;completed&amp;quot; by filling in the remaining text.&lt;/li&gt;&#xA;&lt;li&gt;For the aforementioned, if there are multiple candidates for completion, you will instead be shown a list of the candidates.&lt;/li&gt;&#xA;&lt;li&gt;If there are multiple possibilities but they all start with the same substring/prefix, the rest of that substring will be filled in.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For example, to reach &lt;code&gt;pydoc3&lt;/code&gt;, you only have to type&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;pyd&amp;lt;TAB&amp;gt;3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;where &lt;kbd&gt;Tab&lt;/kbd&gt; is shown as &lt;code&gt;&amp;lt;TAB&amp;gt;&lt;/code&gt;. The tab key will insert &lt;code&gt;oc&lt;/code&gt;, since all options starting with &lt;code&gt;pyd&lt;/code&gt; also start with &lt;code&gt;pydoc&lt;/code&gt; &lt;sub&gt;(in the set below)&lt;/sub&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/9dDd0.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/9dDd0.png&quot; alt=&quot;a shot of bash tab completion options&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a &lt;strong&gt;collection of strings&lt;/strong&gt; called &lt;em&gt;S&lt;/em&gt; and a &lt;strong&gt;target string&lt;/strong&gt; called &lt;em&gt;T&lt;/em&gt;, figure out the minimum number of keystrokes to reach &lt;em&gt;T&lt;/em&gt;, assuming we're using tab completion and &lt;em&gt;S&lt;/em&gt; is the set of possibilities.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Tab completion here is modeled after bash and Emacs, so it is case-sensitive.&lt;/li&gt;&#xA;&lt;li&gt;The keystrokes/moves don't matter, only how many. A &amp;quot;keystroke&amp;quot; is:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Some character in the string&lt;/li&gt;&#xA;&lt;li&gt;&lt;kbd&gt;Tab&lt;/kbd&gt;&lt;/li&gt;&#xA;&lt;li&gt;If &lt;em&gt;S&lt;/em&gt; is &lt;code&gt;[abc, ab]&lt;/code&gt; and &lt;em&gt;T&lt;/em&gt; is &lt;code&gt;ab&lt;/code&gt;, then either &lt;code&gt;a&amp;lt;TAB&amp;gt;&lt;/code&gt; or &lt;code&gt;ab&lt;/code&gt; will get there. &lt;kbd&gt;Tab&lt;/kbd&gt; counts as one keystroke, so the method doesn't matter.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;You may assume terms will only contain alphanumeric characters, underscore, and hyphen (&lt;code&gt;[A-Za-z0-9]_-&lt;/code&gt;), for the purpose of this challenge.&lt;/li&gt;&#xA;&lt;li&gt;You may assume no strings are empty.&lt;/li&gt;&#xA;&lt;li&gt;You may assume &lt;em&gt;S&lt;/em&gt; contains &lt;em&gt;T&lt;/em&gt; (&lt;strong&gt;unsure about this one&lt;/strong&gt;)&lt;/li&gt;&#xA;&lt;li&gt;The input can be taken in whatever format is appropriate for your platform or language (array of strings, string with separators etc.) &lt;em&gt;S&lt;/em&gt; and &lt;em&gt;T&lt;/em&gt; are considered separate inputs.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I/O format is flexible and defaults apply (full program, function etc.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Set                                                 Target         Output&#xA;--------------------------------------------------  -------------  ------&#xA;[ab, abc]                                           ab             2&#xA;[lisp-mode, list-abbrevs, list-packages]            list-packages  5&#xA;[heck, hell, help_me, hello, goodbye, hello_world]  hello          5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Feedback&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is anything vague or underspecified?&lt;/li&gt;&#xA;&lt;li&gt;Is something &lt;em&gt;too&lt;/em&gt; specific or cumbersome?&lt;/li&gt;&#xA;&lt;li&gt;Is this too similar to an existing question?&lt;/li&gt;&#xA;&lt;li&gt;Should we assume &lt;em&gt;S&lt;/em&gt; will always contain &lt;em&gt;T&lt;/em&gt;, or require a special case?&lt;/li&gt;&#xA;&lt;li&gt;Should something be changed about case-sensitivity? Assume everything is lowercase?&lt;/li&gt;&#xA;&lt;li&gt;Any tags I should use?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42096" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-05-03T01:43:34.253" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16324" PostTypeId="2" ParentId="16315" CreationDate="2018-05-02T03:19:00.870" Score="7" Body="&lt;h1&gt;Byte count should be based on the file&lt;/h1&gt;&#xA;&lt;p&gt;Regardless of what &amp;quot;header&amp;quot; or &amp;quot;boilerplate&amp;quot; is included, you need to be able to save your source code to a file in some manner for it to qualify, and your score in bytes is the size of that source code in bytes. If you find or make some alternative way to store your TPT programs as a file, and provide an interpreter which can read those files and run the program they represent, then that file format is an option for scoring. A similar situation happened with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7377/71434&quot;&gt;Minecraft&lt;/a&gt;, and the consensus was that there had to be an actual file to use as the byte count, but scores were later greatly improved when a more efficient way of storing structures as files was added. Fortunately you mostly compete within a language rather than between languages because the numbers just differ so much, so as long as the file size correlates reasonably well with program complexity (so golfing remains a programming challenge rather than just an optimize stuff for the file format challenge) it won't really be a problem in my mind. If the file size does &lt;em&gt;not&lt;/em&gt; correlate well with complexity... sorry, but you still need to be able to store your source code in a file.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;All of the output formats you listed seem appropriate, though I can't evaluate them for sure without more information. As long as you can explain how someone runs the program and how they obtain the output it's probably fine and in some narrow situations it could even be legitimate to use multiple output types in a single answer&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;For languages that don't accept a standardized or simple Input mechanism, deciding how input is obtained is dependent on relatively deep knowledge of that specific language that I just don't have. In general though, a good input method should be easy to adapt to any challenge. As an example, a language with memory represented as an infinite list of Stacks and no input functionality would most likely take input by assuming the first stack starts populated with the entire input. An uncommon alternative might be that stacks starting from the first and extending to the right each have exactly one item of the input. It would &lt;em&gt;not&lt;/em&gt; be allowed to determine for each challenge that it wants, say, &amp;quot;the first input stored in the third stack, the second and third both on the seventh stack, and the fourth input stored as a negative value underneath three 0s in the eleventh stack&amp;quot; and just have input data always prepopulated wherever is convenient.&lt;/p&gt;&#xA;&lt;h3&gt;Is it a language?&lt;/h3&gt;&#xA;&lt;p&gt;If TPT can truly be used to construct functional computers as you claim, then it almost certainly is enough of a programming language for us. The requirements are not very strict.&lt;/p&gt;&#xA;&lt;h2&gt;Suggestion&lt;/h2&gt;&#xA;&lt;p&gt;Try posting an answer to one of the basic challenges like &lt;a href=&quot;https://codegolf.stackexchange.com/q/84260/71434&quot;&gt;Add two numbers&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/q/55422/71434&quot;&gt;&amp;quot;Hello, World!&amp;quot;&lt;/a&gt; and we can give more definitive comments. I'd recommend Add two numbers so we can critique input methods as well. As long as you're reasonably responsive to comments it shouldn't be deleted and can serve as valuable precedent for future decisions.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-05-02T03:19:00.870" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16326" PostTypeId="2" ParentId="16315" CreationDate="2018-05-02T06:00:18.097" Score="1" Body="&lt;p&gt;We really only need a couple of things to make anything a language:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A language must be able to input and then execute source code. Input means something like &quot;load a file&quot; or &quot;paste in some text&quot;.  It does &lt;em&gt;not&lt;/em&gt; mean &quot;click in these 20 spots&quot;.  We are inputting &lt;em&gt;bytes&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;We score the entire source code by measuring its bytes.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;What we &lt;em&gt;don't&lt;/em&gt; do, is define input/output.  We like to be very flexible in this manner, and trying to nail down input/output for a language often doesn't work well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The general rule of thumb is that &lt;strong&gt;we try to represent the desired input/output as closely as we can in the given language&lt;/strong&gt;.  For example, if you needed to input 2 integers, I'd personally simply represent each integer by a set of 8 locations (e.g. 8-bit integers, with a piece of sand representing a bit).  Output is similar.  We simply require that you are &lt;em&gt;consistent&lt;/em&gt; (within a post) (you can't have half of your bits be represented by &quot;water&quot; and another half as &quot;oil&quot;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If, after submissions have been posted, it turns out that input/output representation isn't commonly agreed upon, then we can hash out the details on Meta (and the discussion will be more productive, as we will have concrete examples)&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2018-05-06T13:18:44.997" LastActivityDate="2018-05-06T13:18:44.997" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16327" PostTypeId="2" ParentId="2140" CreationDate="2018-05-02T07:27:25.520" Score="1" Body="&lt;h1&gt;Relational Division&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a database of colored marbles in bins, find which bin has the most marbles of a certain color. In database administration, this task is known as &lt;em&gt;relational division&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Input marbles (flexible format, this is just one possibility):&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;red,A&#xA;blue,B&#xA;green,C&#xA;red,B&#xA;red,A&#xA;blue,A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Input color:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;red&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Program output:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Format&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each 'marble' is represented as a &lt;code&gt;(color, bin)&lt;/code&gt; pair, so the entire database of marbles is represented by a list of these pairs. The list can be fed into your program in any reasonable way so long as the association of the input data remains between colors and bins -- for example via CSV on stdin in &lt;code&gt;color,bin&lt;/code&gt; pairs split on newlines in string-manipulation programs, or perhaps via a list of &lt;code&gt;(str, str)&lt;/code&gt; tuples as a parameter to a function in a language like Python. It's up to you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my examples, I'm using &lt;code&gt;string&lt;/code&gt;s to represent colors and bins, but you can use any data type that is capable of representing at least 1000 distinct values in your programming language (i.e. no booleans). Examples of other acceptable data types would be integers or floats so long as you're consistent.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's very important that colors cannot be used as bins, and bins cannot be used as colors (i.e. the set of bin identifiers and the set of color identifiers must be disjoint). If this isn't true, the result is undefined.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition to the marble database, your program takes in a color identifier, again in whatever way is most convenient to do I/O of a single value in your language. Your program &lt;strong&gt;must&lt;/strong&gt; output or return a unique identifier for the bin that contains the most marbles of that color. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The result is undefined if the input color doesn't exist, or if there is a tie between multiple bins (i.e. if the input color is &lt;code&gt;red&lt;/code&gt;, there are 70 red marbles in total, and two bins both have 30 red marbles). Your program should be expected to handle up to 1000 input marbles without much difficulty.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, so the shortest program wins, with submission time (earlier is better) as the tiebreaker.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="48718" LastEditorUserId="48718" LastEditDate="2018-05-03T03:10:03.703" LastActivityDate="2018-05-03T03:10:03.703" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16328" PostTypeId="2" ParentId="2140" CreationDate="2018-05-02T08:30:55.110" Score="-2" Body="&lt;p&gt;(Now I don't know what the name should be)&lt;/p&gt;&#xA;&lt;h1&gt;Intention&lt;/h1&gt;&#xA;&lt;p&gt;I want to create a challenge based on dependent typing, feature that exists in Idris, Coq, Agda and the similiar.&lt;/p&gt;&#xA;&lt;h1&gt;Text&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;You should create a function in dependently typed language (Idris, Coq, Agda, etc) so that:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The function will receive a string that denotes format.&lt;/li&gt;&#xA;&lt;li&gt;The format string will have s or n, s means it will receive a string, n means it will receive a number. You can assume that there is no other thing in the string&lt;/li&gt;&#xA;&lt;li&gt;Arguments is received in order. If there is type mismatch, the error must be reported on compile-time.&lt;/li&gt;&#xA;&lt;li&gt;After all arguments is received, the function will return a string, that is list of all passed argument&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;For example&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;formatf &amp;quot;sn&amp;quot; &amp;quot;goods&amp;quot; 25&#xA;&amp;gt; &amp;quot;goods 25&amp;quot;&#xA;formatf &amp;quot;sn&amp;quot; &amp;quot;goods&amp;quot; &amp;quot;bad&amp;quot;&#xA;&amp;gt; Type error in compile time&#xA;formatf &amp;quot;ak&amp;quot; &amp;quot;Akangka&amp;quot; 25&#xA;&amp;gt; You can do anything.&#xA;formatf &amp;quot;nnn&amp;quot; 24 25&#xA;&amp;gt; Either type error or return a function expecting a number and return string (currying is almost universal in these languages)&#xA;formatf &amp;quot;ss&amp;quot; &amp;quot;Akangka&amp;quot; &amp;quot;Martin Ender&amp;quot; &amp;quot;Adám&amp;quot;&#xA;&amp;gt; Type error on compile time&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This challenge is similiar to &lt;a href=&quot;https://codegolf.stackexchange.com/q/17297/46245&quot;&gt;printf-style string formatting&lt;/a&gt;, the difference that the function in this challenge has to be type safe.&lt;/p&gt;&#xA;&lt;p&gt;Note that you cannot use build-in function or macro to do this&lt;/p&gt;&#xA;&lt;h1&gt;Discussion&lt;/h1&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;What should be the name of this challenge?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="46245" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-05-03T06:50:33.420" CommentCount="15" ContentLicense="CC BY-SA 4.0" />
  <row Id="16331" PostTypeId="2" ParentId="2140" CreationDate="2018-05-02T12:49:52.270" Score="-2" Body="&lt;h1&gt;Shorter coding in non-golfing language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Copper write a requirement, a sample program in a golfing language, and a required non-golfing language. Rob hack it with the required language, with fewer bytes of code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I guess it'd be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; cuz it's sometimes hard to define which is &quot;golfing language&quot;. Also is it a duplicate?&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2018-05-02T12:49:52.270" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16333" PostTypeId="2" ParentId="2140" CreationDate="2018-05-02T18:02:34.217" Score="1" Body="&lt;h1&gt;Nice Tile Connector&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to connect the tiles given to you in the input by removing the lines on sides they connect&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A set of tiles that are not yet connected&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The tiles with the walls removed in the right places to connect them&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Method&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each tile in the input looks like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;___&#xA;|~|&#xA;|_|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Every air space looks like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;...&#xA;...&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;On a tile, the top line is in front of the side lines, which are both in front of the bottom line. That means the top line will always replace the &lt;code&gt;|&lt;/code&gt; characters that would be there on the sides, and the side lines will always replace the &lt;code&gt;_&lt;/code&gt; characters that would be there on the bottom.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each tile must have any lines removed that are adjacent to other tiles&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;...______...&#xA;...|~||~|...&#xA;...|_||_|...&#xA;...___...___&#xA;...|~|...|~|&#xA;...|_|...|_|&#xA;...______...&#xA;...|~||~|...&#xA;...|_||_|...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The output&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;...______...&#xA;...|~~~~|...&#xA;...|~~__|...&#xA;...|~|...___&#xA;...|~|...|~|&#xA;...|~|...|_|&#xA;...|~~___...&#xA;...|~~~~|...&#xA;...|~~~~|...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, smallest solution in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="77796" LastEditorUserId="77796" LastEditDate="2018-05-09T18:33:40.330" LastActivityDate="2018-05-09T18:33:40.330" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16335" PostTypeId="1" CreationDate="2018-05-02T21:53:19.717" Score="7" ViewCount="206" Body="&lt;p&gt;I ask this question because I worry that if an opinion regarding a certain rule holds a majority among users at one point in time, an accepted answer signals that the rule can no longer change to anyone who later considers the question. There is no reason, however, that the rules we put in place must stay till the end of time. Shouldn't we avoid accepting answers to not discourage people from disagreeing with the status quo?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Accepted answers can always be changed, but that doesn't address the point made above. There isn't a clear note on every question reminding potential answerers/voters of this. Additionally, the person who asked the question may become inactive on the site, meaning the accepted answer will never change regardless of any subsequent change in opinion or votes.&lt;/p&gt;&#xA;" OwnerUserId="75553" LastActivityDate="2018-05-03T10:27:36.807" Title="Should we stop accepting answers on meta?" Tags="|discussion|meta|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16336" PostTypeId="2" ParentId="2140" CreationDate="2018-05-03T08:08:22.620" Score="0" Body="&lt;h1&gt;Infer the type&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;(This is not finished yet.)&lt;/p&gt;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&lt;p&gt;Implement the type inference algorithm for Hindley-Milner lambda calculus.&lt;/p&gt;&#xA;&lt;h1&gt;Data Types&lt;/h1&gt;&#xA;&lt;p&gt;The data types in this challenge is (in Haskell):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;data Kind  = Star | KindFunc Kind Kind&#xA;data Type  = TypeName String  | TypeVar String | App Type Type&#xA;data Value = ValueName String | ValueFunc String Type | App Value Value &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If your language doesn't support ADT or if using it will make the program longer, you can use any isomorphic representation.&lt;/p&gt;&#xA;&lt;p&gt;You can assume that there is no name conflict, nor unbound name.&lt;/p&gt;&#xA;&lt;h1&gt;Theory&lt;/h1&gt;&#xA;&lt;h2&gt;Value&lt;/h2&gt;&#xA;&lt;p&gt;In Hindley-Milner system,every value has a single most general type. For example the type of &lt;code&gt;Just 5&lt;/code&gt; is &lt;code&gt;Maybe Int&lt;/code&gt; (Note that in Hindley-Milner type system, unlike Haskell, doesn't have any typeclass).&lt;/p&gt;&#xA;&lt;p&gt;If a function value has type &lt;code&gt;A -&amp;gt; B&lt;/code&gt;, you can call it with argument with type &lt;code&gt;A&lt;/code&gt; to produce &lt;code&gt;B&lt;/code&gt;. Additionally, you can use a lambda. A &lt;code&gt;\x -&amp;gt; y&lt;/code&gt; has type &lt;code&gt;type(x) -&amp;gt; type(y)&lt;/code&gt;. (type(x) means the type of value x). However, if you try to apply a value of type &lt;code&gt;A&lt;/code&gt; to function with type &lt;code&gt;B -&amp;gt; C&lt;/code&gt; type unification between A and B occurs (explained below)&lt;/p&gt;&#xA;&lt;h2&gt;Type&lt;/h2&gt;&#xA;&lt;p&gt;Like a value, type is composed from smaller type, so that if &lt;code&gt;K&lt;/code&gt; has kind &amp;quot;a -&amp;gt; b&amp;quot;, and a has type &amp;quot;a&amp;quot;, the type &lt;code&gt;K a&lt;/code&gt; has kind &amp;quot;b&amp;quot;. The example of the type is &lt;code&gt;String&lt;/code&gt;, &lt;code&gt;-&amp;gt;&lt;/code&gt;, &lt;code&gt;Maybe&lt;/code&gt;, &lt;code&gt;Either String&lt;/code&gt;, and &lt;code&gt;EitherT String&lt;/code&gt; which has kind &lt;code&gt;*&lt;/code&gt;, &lt;code&gt;* -&amp;gt; * -&amp;gt; *&lt;/code&gt;, &lt;code&gt;* -&amp;gt; *&lt;/code&gt;, &lt;code&gt;*&lt;/code&gt;, and &lt;code&gt;(* -&amp;gt; *) -&amp;gt; *&lt;/code&gt; (Assuming EitherT has kind &lt;code&gt;* -&amp;gt; (* -&amp;gt; *) -&amp;gt; * -&amp;gt; *&lt;/code&gt;. Every value has type *. However, the type can be generic. So a value of &lt;code&gt;Nothing&lt;/code&gt; has type &lt;code&gt;Maybe a&lt;/code&gt;. Here, &lt;code&gt;a&lt;/code&gt; can stand for any type.&lt;/p&gt;&#xA;&lt;h2&gt;Type Unification&lt;/h2&gt;&#xA;&lt;p&gt;(TODO : To be filled tomorrow)&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;The input is a:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;list of pair of type name and the its kind&lt;/li&gt;&#xA;&lt;li&gt;list of pair of value name and its type&lt;/li&gt;&#xA;&lt;li&gt;and a value to be infered&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;Either the type of the supplied input or error if there is type mismatch.&lt;/p&gt;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&lt;p&gt;(Here we use Haskell notation for the input, it is not recomended in actual challenge because it will unecessarily make the program longer)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; Types  : Maybe :: * -&amp;gt; *, Bool :: *&#xA;&amp;gt; Values : Just :: a -&amp;gt; Maybe a, Nothing :: Maybe a, True :: Bool, False :: Bool, maybe :: (a -&amp;gt; b) -&amp;gt; b -&amp;gt; Maybe a -&amp;gt; b, compose :: (a -&amp;gt; b) -&amp;gt; (c -&amp;gt; a) -&amp;gt; (c -&amp;gt; b)&#xA;&amp;gt; Infer  : \f -&amp;gt; maybe (compose Just f) Nothing&#xA;&amp;gt; Result : (a -&amp;gt; b) -&amp;gt; Maybe a -&amp;gt; Maybe b&#xA;&amp;gt; Infer  : \f -&amp;gt; maybe (compose Just f) True&#xA;&amp;gt; Result : Type error&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="46245" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-05-04T08:01:16.120" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16337" PostTypeId="1" CreationDate="2018-05-03T08:52:41.317" Score="22" ViewCount="642" Body="&lt;p&gt;In accordance with our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14645/16766&quot;&gt;meta agreement&lt;/a&gt; to have a Language of the Month, and since the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14737/16766&quot;&gt;list of nominations&lt;/a&gt; had a single highest-voted entry at the beginning of May, we have a new featured language! Throughout May 2018, our Language of the Month, nominated by &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/43131877#43131877&quot;&gt;DJMcMayhem&lt;/a&gt; and &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/43141097#43141097&quot;&gt;Sanchises&lt;/a&gt;, will be:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;&lt;a href=&quot;https://github.com/lmendo/MATL&quot; rel=&quot;nofollow noreferrer&quot;&gt;MATL&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h3&gt;What's a Language of the Month?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;See the meta posts linked above. In short, during May, those who wish to participate should learn (at least the basics of) MATL, use it to solve challenges, and discuss it in the MATL chat room, &lt;a href=&quot;https://chat.stackexchange.com/rooms/39466/matl-chatl&quot;&gt;MATL CHATL&lt;/a&gt;. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Information about MATL&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;MATL is a &lt;strong&gt;stack-oriented&lt;/strong&gt; language based on MATLAB/Octave and suitable for code golf. Many functions are similar to those of MATLAB, sometimes with extended funcionality.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To simplify stack handling there are &lt;strong&gt;clipboards&lt;/strong&gt;, similar to variables in other languages. An interesting feature is an automatic clipboard that holds the inputs of recent function calls. This often avoids the need to manually copy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are different types of functions. Most are &lt;strong&gt;normal functions&lt;/strong&gt;, which perform operations on inputs and produce outputs. Other types are stack-handling functions, for duplicating, deleting or moving elements in the stack; and clipboard functions, for copying and pasting elements from the clipboards.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Documentation&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://esolangs.org/wiki/MATL&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolangs page&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/44680/showcase-of-languages/76535#76535&quot;&gt;Entry in the showcase of languages&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/lmendo/MATL/blob/master/spec/MATL_spec.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;Language specification&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/78152/tips-for-golfing-in-matl&quot;&gt;Golfing tips&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For help, you can ping &lt;a href=&quot;https://codegolf.stackexchange.com/users/36398/luis-mendo&quot;&gt;@LuisMendo&lt;/a&gt; or visit the &lt;a href=&quot;https://chat.stackexchange.com/rooms/39466/matl-chatl&quot;&gt;MATL CHATL&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;(If you consider yourself knowledgeable in MATL and would like to help teach it to other users, feel free to add your name to the list)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Interpreters&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;There are two online interpreters:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#matl&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Try It Online!&lt;/strong&gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://matl.suever.net/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;MATL Online!&lt;/strong&gt;&lt;/a&gt; (featuring &lt;a href=&quot;https://matl.suever.net/?code=2%24rEk%60t%27%23.%27w%29XxDt3Y6Z%2ByyHIhm%2abbI%3D%3C%2BT&amp;amp;inputs=25%0A125&amp;amp;version=19.2.0&quot; rel=&quot;nofollow noreferrer&quot;&gt;real-time&lt;/a&gt;, &lt;a href=&quot;https://matl.suever.net/?code=Q%3AqG%2Fq1e3YytP%2B1e6j%2aZeYsXG&amp;amp;inputs=700&amp;amp;version=19.6.0&quot; rel=&quot;nofollow noreferrer&quot;&gt;graphical&lt;/a&gt; and &lt;a href=&quot;https://matl.suever.net/?code=%25+Create+values+of+t+from+0+-+1+seconds+at+44100+Hz%0A0+l+44100+%2F+1+3%24%3A+2YP+%2a+%2a+XJx%0A%0A%27C-Major%3A%27D%0AJ+261.626+%2a+X%2C+J+329.628+%2a+X%2C+%2B+J+391.995+%2a+X%2C+%2B+TY%23%0A%0A%27F-Major%3A%27D%0AJ+261.626+%2a+X%2C+J+349.228+%2a+X%2C+%2B+J+440.000+%2a+X%2C+%2B+TY%23%0A%0A%27G-Major%3A%27D%0AJ+246.942+%2a+X%2C+J+293.665+%2a+X%2C+%2B+J+391.995+%2a+X%2C+%2B+TY%23&amp;amp;inputs=&amp;amp;version=20.6.0&quot; rel=&quot;nofollow noreferrer&quot;&gt;sound&lt;/a&gt; output)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You can also download the interpreter from &lt;a href=&quot;https://github.com/lmendo/MATL&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github&lt;/a&gt; and run it on MATLAB or on Octave.&lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="31716" LastEditDate="2018-06-01T16:08:04.040" LastActivityDate="2018-06-01T16:08:04.040" Title="Language of the Month for May 2018: MATL" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16338" PostTypeId="2" ParentId="16337" CreationDate="2018-05-03T09:34:44.983" Score="12" Body="&lt;h1&gt;List of &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=%22%23+MATL%22+created%3A2018-04-30..2018-05-31+is%3Aanswer&quot;&gt;all MATL solutions posted&lt;/a&gt; in May&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/164076/36398&quot;&gt;Detect rectangular text with rectangular code&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/36398/luis-mendo&quot;&gt;Luis Mendo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/164112/31716&quot;&gt;Weighted average - the pressup trend problem&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31716/djmcmayhem&quot;&gt;DJMcMayhem&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/164122/36398&quot;&gt;Bringing a pair of integers to equality&lt;/a&gt;  by &lt;a href=&quot;https://codegolf.stackexchange.com/users/36398/luis-mendo&quot;&gt;Luis Mendo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/164161/59487&quot;&gt;The Add-Multiply-Add Sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31516/stewie-griffin&quot;&gt;Stewie Griffin&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/164491/36398&quot;&gt;Find arsonist's lullaby&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/36398/luis-mendo&quot;&gt;Luis Mendo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/164535/36398&quot;&gt;Sign-Swapping Sums&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31516/stewie-griffin&quot;&gt;Stewie Griffin&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/164536/56433&quot;&gt;Circular Limited Sums&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56433/laikoni&quot;&gt;Laikoni&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/164594/67312&quot;&gt;Modular broadcasting&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/67312/giuseppe&quot;&gt;Giuseppe&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/164663/31516&quot;&gt;Collatz Conjecture (OEIS A006577)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31516/stewie-griffin&quot;&gt;Stewie Griffin&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/164856/36398&quot;&gt;Orthodiagonal steps&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/32352/sanchises&quot;&gt;Sanchises&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/164872/59487&quot;&gt;Orthodiagonal steps&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/59487/mr-xcoder&quot;&gt;Mr. Xcoder&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/164882/36398&quot;&gt;Find the Fibonacci Patterns&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/36398/luis-mendo&quot;&gt;Luis Mendo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/164925/67312&quot;&gt;Progression of Matrix Columns&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/67312/giuseppe&quot;&gt;Giuseppe&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/164997/36398&quot;&gt;Up and down, up and down&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/67312/giuseppe&quot;&gt;Giuseppe&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/165006/59487&quot;&gt;Is this a consecutive-prime/constant-exponent number?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/59487/mr-xcoder&quot;&gt;Mr. Xcoder&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/165136/36398&quot;&gt;Is this a consecutive-prime/constant-exponent number?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/36398/luis-mendo&quot;&gt;Luis Mendo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/165344/36398&quot;&gt;Merge two values&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31516/stewie-griffin&quot;&gt;Stewie Griffin&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/165347/36398&quot;&gt;Determining Yes or No?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31516/stewie-griffin&quot;&gt;Stewie Griffin&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/165513/36398&quot;&gt;Beginners 10x10 multiplication matrix&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31516/stewie-griffin&quot;&gt;Stewie Griffin&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/165625/36398&quot;&gt;Produce a List of Rotonyms 1&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/36398/luis-mendo&quot;&gt;Luis Mendo&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;List of &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=inquestion%3A78152+created%3A2018-04-30..2018-05-31+is%3Aanswer&quot;&gt;all MATL tips posted&lt;/a&gt; in May&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/165257/36398&quot;&gt;Efficiently defining numeric array literals&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;tip title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;List of MATL-related challenges posted in May&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/164056/modular-broadcasting&quot;&gt;Modular broadcasting&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/36398/luis-mendo&quot;&gt;Luis Mendo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/164712&quot;&gt;Function clipboard: copy&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/36398/luis-mendo&quot;&gt;Luis Mendo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/165144/function-clipboard-paste&quot;&gt;Function clipboard: paste&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/36398/luis-mendo&quot;&gt;Luis Mendo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/q/&amp;lt;question-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2018-05-31T06:55:35.293" LastActivityDate="2018-05-31T06:55:35.293" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16339" PostTypeId="2" ParentId="16335" CreationDate="2018-05-03T10:27:36.807" Score="5" Body="&lt;p&gt;Accepting an answer is a way for the person who asked to question to publicly signal &quot;This is the answer which I found most helpful&quot;. Nothing more, nothing less.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So with respect to&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;an accepted answer signals that the rule can no longer change to anyone who later considers the question&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;(presumably on a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/policy&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;policy&amp;#39;&quot; rel=&quot;tag&quot;&gt;policy&lt;/a&gt; question), the accepted answer &lt;strong&gt;never&lt;/strong&gt; signalled that that was the rule. It may have been on a negative score when it was accepted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On that basis, I would argue that if there is a reason for not accepting answers on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/policy&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;policy&amp;#39;&quot; rel=&quot;tag&quot;&gt;policy&lt;/a&gt; questions it's to avoid confusing people who haven't understood that point. However, without evidence that this is a real problem we don't need a solution.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-05-03T10:27:36.807" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="16341" PostTypeId="2" ParentId="2140" CreationDate="2018-05-03T16:41:24.690" Score="0" Body="&lt;h1&gt;The true spirit of &quot;Hello World!&quot;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A hello world program is traditionally the first program you write in a language you've never tried before. So we're gonna make some true hello world programs here. Your challenge is to golf a hello world program in a language you've never used before. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once you've posted your best attempt, you are welcome to accept help from others in the comments, including those who've used that language before, but please leave a copy of your original attempt, and use &lt;s&gt;strikethrough&lt;/s&gt; on previous byte counts.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules based on honesty of participants:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Really pick one you've never used before. Different versions (python 2 / python 3) don't count. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Don't look at any other codegolf pages other than &quot;tips for golfing in  [your language]&quot;. Hello world has been golfed in many languages on PPCG but copying would be boring. The point is for each participant to have fun trying something new.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Objective rules, copied from the Hello World catalog challenge (who's answers you are not allowed to look at):&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each submission must be a full program.&lt;/li&gt;&#xA;&lt;li&gt;The program must take no input, and print &lt;code&gt;Hello, World!&lt;/code&gt; to STDOUT (this exact byte stream, including capitalization and punctuation) plus an optional trailing newline, and nothing else.&lt;/li&gt;&#xA;&lt;li&gt;The program must not write anything to STDERR.&lt;/li&gt;&#xA;&lt;li&gt;Submissions are scored in &lt;em&gt;bytes&lt;/em&gt;, in an appropriate (pre-existing) encoding, usually (but not necessarily) UTF-8.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Notes for the Sandbox:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;-Will people understand the point of this challenge? I want people to realize that, while PPCG is unlikely to see any novel solutions here, this challenge will still be a challenge for each participant. In fact, even the top-scoring master golfers will have a challenge: to find a language they haven't used ;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-Is the title obnoxious? Suggestions?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-This is supposed to be a fun challenge for learning and teaching. Will people get that, or will people get really competitive and look for loopholes in the honesty-based rules?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;-Should I tag it popularity-contest despite asking for golfed code, just so that people realize it's not supposed to be super-competitive?&lt;/p&gt;&#xA;" OwnerUserId="69304" LastActivityDate="2018-05-03T16:41:24.690" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16343" PostTypeId="1" CreationDate="2018-05-04T03:32:55.660" Score="0" ViewCount="127" Body="&lt;p&gt;Close vote seems rule-based, but the rule now can't be handled by a computer. What about up/down vote?&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2018-05-12T09:09:56.477" Title="Are voting opinion-based or rule-based?" Tags="|discussion|voting|" AnswerCount="1" CommentCount="0" FavoriteCount="0" ClosedDate="2018-05-12T16:13:55.090" ContentLicense="CC BY-SA 4.0" />
  <row Id="16344" PostTypeId="2" ParentId="2140" CreationDate="2018-05-04T03:51:33.560" Score="0" Body="&lt;h1&gt;Page size changing&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given positive integer &lt;code&gt;m&lt;/code&gt; and &lt;code&gt;n&lt;/code&gt; both &gt; 1, and array(maybe-empty ordered list) &lt;code&gt;A&lt;/code&gt; consist of integers in &lt;code&gt;[0,m)&lt;/code&gt;(0-based) or &lt;code&gt;(0,m]&lt;/code&gt;(1-based), output an array &lt;code&gt;B&lt;/code&gt; consist of integers in &lt;code&gt;[0,n)&lt;/code&gt;(0-based) or &lt;code&gt;(0,n]&lt;/code&gt;(1-based) such that, when given input &lt;code&gt;m'=n, n'=m, A'=B&lt;/code&gt;, the output is &lt;code&gt;A&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are not allowed to use built-in large number. To be clear, the number you use should be at most polynomial to &lt;code&gt;(m+n)*arrlength&lt;/code&gt;. (discussing, ban/penalty/just allow)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example: if you output &lt;code&gt;[1,2,3]&lt;/code&gt; for &lt;code&gt;m=6, n=8, A=[4,3,2,1]&lt;/code&gt;, then you have to output &lt;code&gt;[4,3,2,1]&lt;/code&gt; for &lt;code&gt;m=8, n=6, A=[1,2,3]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Shortest code win.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-05-05T11:14:18.830" LastActivityDate="2018-05-05T11:14:18.830" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16345" PostTypeId="2" ParentId="16343" CreationDate="2018-05-04T04:01:29.843" Score="3" Body="&lt;h1&gt;Both voting and close votes are opinion based, guided by rules&lt;/h1&gt;&#xA;&lt;p&gt;If you hover over the upvote button:  you'll find some basic guidelines:  &amp;quot;This question shows research effort; it is useful and clear&amp;quot;.  You'll find something similar for downvotes.&lt;/p&gt;&#xA;&lt;p&gt;The same is true for close votes.  When you close something, you specify the reason.  However, if you look at all of the close reasons, all of them have elements of subjective, opinion-based elements.  (e.g. Is this challenge similar enough to be a duplicate?)&lt;/p&gt;&#xA;&lt;p&gt;There &lt;em&gt;is&lt;/em&gt; a distinction however:  As close votes matter far more, we have far more guidelines on their use, and who voted to close a challenge is public information.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-05-04T04:01:29.843" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16347" PostTypeId="1" AcceptedAnswerId="16350" CreationDate="2018-05-04T08:51:07.503" Score="-3" ViewCount="139" Body="&lt;p&gt;I see new users treat &quot;code-challenge&quot; as &quot;it's hard to solve, but once done you win&quot;, but &quot;code-challenge&quot; here seems to mean &quot;you need to optimize, but it's hard to put such an scoring way in one class&quot; (Source: with an objective winning criterion not covered by other scoring tags).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1) How to make new user just see what CC mean?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2) What do &quot;hard to solve but win when solved&quot; go?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5594/&quot;&gt;Related&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-06-01T12:46:31.577" LastActivityDate="2018-06-01T12:46:31.577" Title="Code challenge &amp;" Tags="|discussion|code-challenge|" AnswerCount="1" CommentCount="3" ClosedDate="2018-05-12T08:50:06.360" ContentLicense="CC BY-SA 4.0" />
  <row Id="16350" PostTypeId="2" ParentId="16347" CreationDate="2018-05-04T11:46:18.670" Score="6" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;1) How to make new user just see what CC mean?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;There is a proverb in English: &lt;em&gt;you can lead a horse to water, but you can't make it drink&lt;/em&gt;. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; already has a tag summary which says what it means: there is no way of forcing a new user to read it, to click through for a more detailed explanation, or to think about whether it applies to their case. Perhaps the summary could be improved: if you think so, you can propose new wording for it.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;2) What do &quot;hard to solve but win when solved&quot; go?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In most cases, a different website. They break the Q&amp;amp;A model even more than most of our questions. Although the Puzzling site changed its scope to include that kind of question, PPCG has not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main exception is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt;, but that has a very narrow definition, and should ideally have a secondary criterion to pick the best out of multiple solutions.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-05-04T11:46:18.670" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16354" PostTypeId="2" ParentId="2140" CreationDate="2018-05-05T01:44:34.533" Score="-2" Body="&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Write a Discord bot with a single command, &lt;code&gt;!oldest&lt;/code&gt;, that gives the oldest user in the server that the command that was run in.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Gracefully failing in DM channels is not required.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Assume the bot's token is this invalid token: &lt;code&gt;MjM4NDk0NzU2NTIxMzc3Nzky.CunGFQ.wUILz7z6HoJzVeq6pyHPmVgQgV4&lt;/code&gt;.&lt;br&gt;&#xA;If the token is compressed in the program, provide instructions on how to change it so I can test it.  &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Sample discord.py implementation&lt;/h2&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import discord&#xA;client = discord.Client()&#xA;@client.event&#xA;async def on_message(M):&#xA; if(M.content==&quot;!oldest&quot;):&#xA;  N=sorted([x.id for x in M.server.members])[1]&#xA;  await client.send_message(M.channel, str(M.server.get_member(N)))&#xA;client.run(&quot;MjM4NDk0NzU2NTIxMzc3Nzky.CunGFQ.wUILz7z6HoJzVeq6pyHPmVgQgV4&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Get a list of every user in the server&lt;/li&gt;&#xA;&lt;li&gt;Sort their snowflake IDs&lt;/li&gt;&#xA;&lt;li&gt;Print the username and discriminator of the member with the smallest ID.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;No API for your language? Have fun.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard loopholes forbidden, etc, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Shortest code in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I originally posted this question on the main site, but I deleted it, as it turns out I'm bad at writing these. Please forgive me.&lt;/p&gt;&#xA;" OwnerUserId="49186" LastEditorUserId="49186" LastEditDate="2018-05-07T17:33:27.350" LastActivityDate="2018-05-07T17:33:27.350" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16355" PostTypeId="2" ParentId="2140" CreationDate="2018-05-05T04:52:54.440" Score="0" Body="&lt;h1&gt;Bananagrams&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/crossword&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;crossword&amp;#39;&quot; rel=&quot;tag&quot;&gt;crossword&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Bananagrams is a tile-based word game where you race to make crosswords and use all your letters before everyone else does. In the original game, finishing your crossword allows you to say &quot;peel&quot;, causing everyone to draw another letter tile. Whoever finishes their crossword when there are no more letter tiles to draw is the winner.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You will be given a list of letter tiles and your task is to arrange them into a  crossword using &lt;a href=&quot;https://raw.githubusercontent.com/dwyl/english-words/master/words_alpha.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;this list of alphabetic words&lt;/a&gt; as your dictionary. In the spirit of the board game, you need to do this as quickly as possible.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input and Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input to your solution will be a list of letters and you should output a grid of letters. You will need to read in the list of words.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an example: given &lt;code&gt;abcdeiloopswy&lt;/code&gt;, your program/function might produce&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;cowboy&#xA;  a l&#xA;  side&#xA;  p&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Test cases for timing&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;aabcdeeefghiijklmnoopqrssttuuvwxy&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;more TBA&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No abusing standard loopholes&lt;/li&gt;&#xA;&lt;li&gt;Input and output may be in any convenient format.&lt;/li&gt;&#xA;&lt;li&gt;You must load the linked word list exactly, not a stripped down version.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that you will be given only lowercase letters&lt;/li&gt;&#xA;&lt;li&gt;You may assume that there is at least one possible crossword from your given set of letters.&lt;/li&gt;&#xA;&lt;li&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenge, so the answer with the shortest execution time in each language wins.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Be sure to post execution time and CPU as part of your solution.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2018-05-20T06:39:23.790" LastActivityDate="2018-05-20T06:39:23.790" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="16356" PostTypeId="2" ParentId="2140" CreationDate="2018-05-05T12:55:28.903" Score="0" Body="&lt;h3&gt;Palindromic Sum&lt;/h3&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base&amp;#39;&quot; rel=&quot;tag&quot;&gt;base&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;For some all bases g ≥ 5, we prove that any positive integer can be written as a sum of three palindromes in base g.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is the theorem proven in &lt;a href=&quot;https://arxiv.org/pdf/1602.06208.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;this paper&lt;/a&gt; by Cilleruelo, Luca, Baxter.&lt;/p&gt;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Given a positive integer &lt;code&gt;n&lt;/code&gt; and a base &lt;code&gt;g ≥ 5&lt;/code&gt; find three palindromic numbers in base &lt;code&gt;g&lt;/code&gt; that sum to &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You cannot use leading zeros to make a number count as a palindrome, that means the most significant digit of a palindrome must be nonzero. (In base 10, the number &lt;code&gt;01210 = 1210&lt;/code&gt; is not considered as a palindrome.)&lt;/li&gt;&#xA;&lt;li&gt;The submissions must be able to process any aribtrarily large input &lt;code&gt;n&lt;/code&gt; (within the memory limits). It is not sufficient to use finite precision integers, i.e. 32-bit &lt;code&gt;int&lt;/code&gt;s.&lt;/li&gt;&#xA;&lt;li&gt;The integers in the input and output can be in the format of native integer types, as strings in any fixed base (not dependent on &lt;code&gt;g&lt;/code&gt;), or as list of digits in any fixed base (not dependent on &lt;code&gt;g&lt;/code&gt;) or in the base &lt;code&gt;g&lt;/code&gt; or as number in the base &lt;code&gt;g&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-05-05T12:55:28.903" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16357" PostTypeId="2" ParentId="2140" CreationDate="2018-05-05T13:27:46.537" Score="0" Body="&lt;p&gt;Take an expression containing variables and these functions, check whether it's true:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 int  one()          1&#xA;- int  neg(int)       -a&#xA;+ int  add(int, int)  a+b&#xA;- int  sub(int, int)  a-b&#xA;* int  mul(int, int)  a*b&#xA;&amp;gt; bool gt (int, int)  a&amp;gt;b&#xA;&amp;lt; bool lt (int, int)  a&amp;lt;b&#xA;= bool eq (int, int)  a==b&#xA;&amp;amp; bool and(bool,bool) a&amp;amp;b&#xA;| bool or (bool,bool) a|b&#xA;! bool not(bool)      !a&#xA; bool nand(bool,bool) !(a&amp;amp;b)&#xA;^ bool xor(bool,bool) a^b, or (a&amp;amp;!b)|(!a&amp;amp;b)&#xA;  bool imp(bool,bool) !a|b&#xA;... (any bool function, with any amount of input)&#xA;E bool any(var, expr) whether a be any value make expr true&#xA;A bool all(var, expr) whether a be all value make expr true&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You can take input in any reasonable format. You can define what &quot;variable&quot; look like as long as there can be infinite possible different variables. Removing some functions is allowed as long as it doesn't reduce the ability of expressing, i.e. some calculatable function can convert expression with all functions possibly exist into the model you removed something. Redefining the function name or merging some symbols is also allowed. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;To solve the problem, you are given another input source &lt;code&gt;G&lt;/code&gt;. You need to solve the problem correctly when &lt;code&gt;G[0] -&amp;gt; inf, G[1] &amp;gt; any_function(G[0]), G[2] &amp;gt; any_function(G[1]) ...&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sandbox Notes:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;it's quite a fix of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/16128/gg&quot;&gt;this one&lt;/a&gt;, but it's using haltable as output while I use another input source to help solve.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-05-12T14:55:48.403" LastActivityDate="2018-05-12T14:55:48.403" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16358" PostTypeId="2" ParentId="2140" CreationDate="2018-05-05T14:27:27.027" Score="2" Body="&lt;h2&gt;Queuez&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A typical stack-based lanaguage uses nilads, monads, dyads, and occasionally operations with larger numbers of arguments. As each operation is processed, the values are stored on a stack, so that if you want to apply an operation to the result of other operation(s), you simply invoke those operations (and predecessor operations if necessary), at which point their results will end up on the stack ready for the operation you provide next.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Queuez is a fictional language which works differently: instead of the results being stored on a stack, they are stored in a queue, so you have to be careful how you manage your order of operations. For example, let's imagine that digits are nilads and &lt;code&gt;-&lt;/code&gt; and &lt;code&gt;/&lt;/code&gt; are dyads and you want to calculate &lt;code&gt;((a / c) - f) / ((b / d) - e)&lt;/code&gt;. In a stack-based language you would write this as &lt;code&gt;ac/f-bd/e-/&lt;/code&gt;, however in Queuez you need to write this as &lt;code&gt;acbd/f/e--/&lt;/code&gt;. Explanation:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Command Stack&#xA;a       a&#xA;c       a c&#xA;/       a/c&#xA;f       a/c f&#xA;-       a/c-f&#xA;b       a/c-f b&#xA;d       a/c-f b d&#xA;/       a/c-f b/d&#xA;e       a/c-f b/d e&#xA;-       a/c-+f b/d-e&#xA;/       (a/c-f)/(b/d-e)&#xA;Command Queue&#xA;a       a&#xA;c       a c&#xA;b       a c b&#xA;d       a c b d&#xA;/       b d a/c&#xA;f       b d a/c f&#xA;/       a/c f b/d&#xA;e       a/c f b/d e&#xA;-       b/d e a/c-f&#xA;-       a/c-f b/d-e&#xA;/       (a/c-f)/(b/d-e)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Please write a program or function that converts a program written in a fictional stack-based language into the equivalent Queuez. The actual nilads, monads and dyads of the two lanaguages will be arbitrarily mapped to three sets of at least 10 printable ASCII characters of your choice (you are not required to use letters or mathematical symbols); your answer only has to output the correct rearrangement based on which characters you have chosen to represent nilads, monads and dyads. You can assume that there will be one value left on the stack/queue at the end of the program. Normal &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you prefer, you can reverse the dyad argument order, but this must apply both to the original stack-based language and the output. For instance, for the input &lt;code&gt;edb/-fca/-/&lt;/code&gt; you would need to output &lt;code&gt;dbcae/f/--/&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Command Stack&#xA;e       e&#xA;d       d e&#xA;b       b d e&#xA;/       b/d e&#xA;-       b/d-e&#xA;f       f b/d-e&#xA;c       c f b/d-e&#xA;a       a c f b/d-e&#xA;/       a/c f b/d-e&#xA;-       a/c-f b/d-e&#xA;/       (a/c-f)/(b/d-e)&#xA;Command Queue&#xA;d       d&#xA;b       b d&#xA;c       c b d&#xA;a       a c b d&#xA;e       e a c b d&#xA;/       b/d e a c&#xA;f       f b/d e a c&#xA;/       a/c f b/d e&#xA;-       b/d-e a/c f&#xA;-       a/c-f b/d-e&#xA;/       (a/c-f)/(b/d-e)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2018-05-05T20:36:33.490" LastActivityDate="2018-05-05T20:36:33.490" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16363" PostTypeId="2" ParentId="1061" CreationDate="2018-05-07T06:51:01.817" Score="21" Body="&lt;h1&gt;Exactly duplicating another answer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This specifically came up for me in a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; contest. In particular, this contest had a random component, so replicating a submission could allow one to win by luck.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In general, duplicate submissions are uninteresting, and do not add anything to any sort of contest, king of the hill, code golf or otherwise.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Importantly, even if the posters came up with the answers separately, duplicate answers should still be banned.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="20080" LastEditDate="2018-05-07T09:03:49.087" LastActivityDate="2018-05-07T09:03:49.087" CommentCount="6" CommunityOwnedDate="2018-05-07T06:51:01.817" ContentLicense="CC BY-SA 4.0" />
  <row Id="16364" PostTypeId="2" ParentId="2140" CreationDate="2018-05-07T11:26:56.863" Score="0" Body="&lt;h1&gt;Pressure unit conversion&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my line of work I often need to convert between four different pressure units: &lt;code&gt;bar&lt;/code&gt;, &lt;code&gt;psi&lt;/code&gt;, &lt;code&gt;MPa&lt;/code&gt; and &lt;code&gt;kgf/cm2&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that does the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The user enters a value, the original unit and the conversion unit&lt;/li&gt;&#xA;&lt;li&gt;The program or function makes the conversion&lt;/li&gt;&#xA;&lt;li&gt;It then prints out the result in the form: &lt;code&gt;[Starting value] [Starting unit] = [Converted value] [Converted unit]&lt;/code&gt; with spaces between all items.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For example with inputs &lt;code&gt;15.25&lt;/code&gt;, &lt;code&gt;psi&lt;/code&gt; and &lt;code&gt;kgf/cm2&lt;/code&gt;, the program would print out the following:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;15.25 psi = 0.07030695796 kgf/cm2&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The allowed range of input values can be in your language's standard floating-point type.&lt;/li&gt;&#xA;&lt;li&gt;Input can be arguments, come from STDIN, or whatever is your language's preferred form of input.&lt;/li&gt;&#xA;&lt;li&gt;The input units don't have to be literal strings - you can use other pre-defined values if you want.&lt;/li&gt;&#xA;&lt;li&gt;However, the output must use the literal of the units: &lt;code&gt;bar&lt;/code&gt;, &lt;code&gt;psi&lt;/code&gt;, &lt;code&gt;MPa&lt;/code&gt; and &lt;code&gt;kgf/cm2&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Both &lt;code&gt;kgf/cm²&lt;/code&gt; and &lt;code&gt;kgf/cm2&lt;/code&gt; are acceptable.&lt;/li&gt;&#xA;&lt;li&gt;If printing out the result isn't feasible then you can return the string that would have been printed out.&lt;/li&gt;&#xA;&lt;li&gt;This is code golf - shortest answer wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Conversion values&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The conversion values are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 bar = 14.50377377 psi&#xA;1 bar = 0.1 MPa&#xA;1 bar = 1.019716213 kgf/cm²&#xA;1 psi = 0.06894757293 bar&#xA;1 psi = 0.006894757293 MPa&#xA;1 psi = 0.07030695796 kgf/cm²&#xA;1 MPa = 10 bar&#xA;1 MPa = 145.0377377 psi&#xA;1 MPa = 10.19716213 kgf/cm²&#xA;1 kgf/cm² = 0.980665 bar&#xA;1 kgf/cm² = 14.22334331 psi&#xA;1 kgf/cm² = 0.0980665 MPa&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Some test cases:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;33.4 bar = 484.426044 psi&#xA;19 kgf/cm2 = 1.8632635 MPa&#xA;65 MPa = 650 bar&#xA;-59.002 kgf/cm2 = -839.2057018 psi&#xA;23 bar = 23 bar&#xA;0 psi = 0 kgf/cm2&#xA;1 MPa = 1 MPa&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I took these sample values from &lt;a href=&quot;http://calculator.org/property.aspx?name=pressure&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;. You can use it too for more test cases.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is four pressure units all right, or is it too many? My gut tells me that four makes it just complex enough, but I'm also worried that it's just adding extra information without any extra challenge.&lt;/li&gt;&#xA;&lt;li&gt;I'm not certain if I should restrict the input as well as the output. I think restricting the output format adds to the challenge, but restricting the input would make the challenge too, well, restrictive.&lt;/li&gt;&#xA;&lt;li&gt;I should display the conversion values in a more machine-readable form, but I'm not sure how. Any ideas?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78954" LastActivityDate="2018-05-07T11:26:56.863" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16365" PostTypeId="2" ParentId="2140" CreationDate="2018-05-07T16:54:48.353" Score="1" Body="&lt;h1&gt;Conway's Battlegrounds&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game-of-life&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game-of-life&amp;#39;&quot; rel=&quot;tag&quot;&gt;game-of-life&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot;&gt;python&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/83988/72792&quot;&gt;Related&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Conway's Battlegrounds will be a mix of &lt;a href=&quot;https://en.wikipedia.org/wiki/PlayerUnknown&amp;#39;s_Battlegrounds&quot; rel=&quot;nofollow noreferrer&quot;&gt;PUBG&lt;/a&gt; and &lt;a href=&quot;https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life&quot; rel=&quot;nofollow noreferrer&quot;&gt;Conway's Game of Life&lt;/a&gt;. In this challenge, you will need to make a Python bot that will play it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Game rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The controller, at the beginning of the round, will create a two-dimensional 500x500 toroidal (edge wrapping) board with &lt;a href=&quot;https://github.com/Soaku/KoTH-CBG/blob/master/board.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;chosen cells being alive&lt;/a&gt;, the others are dead.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The players are then separated into equal teams, each with 4 bots. If there isn't enough players in the team, some of them might be duplicated.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Gameplay&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;&quot;Parachuting&quot; phase&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Everybody in the game will be given the array representing the starting state of the board. Each bot's class will be initialized, with these arguments in order:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;num&lt;/code&gt; - an int between 2 and 5 inclusive, representing the number you'd be marked with on the map during the game. The other numbers in the range will be your party members.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;area&lt;/code&gt; - Dictionary, where each key is a 2 value tuple &lt;code&gt;(x,y)&lt;/code&gt; and each value is either a 0 (dead cell) or 1 (alive cell)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;During this phase, each bot's method &lt;code&gt;parachute&lt;/code&gt; will be called exactly 10 times. It will be given only one argument:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;team&lt;/code&gt; - 4 item dictionary with your and each teammate's ID (between 2 and 5) as key and a 2 item tuple as value, representing the &lt;code&gt;(x,y)&lt;/code&gt; position they chosen, or &lt;code&gt;None&lt;/code&gt; if they didn't yet chose any.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The method can return a 2 value tuple, representing where the bot want to start or None, if the bot can't decide. The returned value will be visible to every other teammate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The method will be called again, even if the player already chose a location. The next return value will replace previous. You can prevent that by returning &lt;code&gt;team[self.num]&lt;/code&gt;, assuming you saved the &lt;code&gt;num&lt;/code&gt; parameter from &lt;code&gt;__init__&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;It is recommended to spawn your bot near teammates, so it's easier to cooperate later.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the method has been called the 10th time and the bot didn't return that time a &lt;code&gt;(int, int)&lt;/code&gt; tuple, it will be removed from the game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each bot will then be spawned at a random location in a 9x9 rectangle, with the returned location in the center. The bot will not collide with other players.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Starting phase&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This phase will take exactly 25 turns. It's almost the same as the later, main phase of the game, except that no cell will die or be created in it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;start&lt;/code&gt; method of each bot will be called once every turn. It will take these arguments in order:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;area&lt;/code&gt; - Basically the same as in the previous phase, but with several modifications:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It will be only a 25x25 fragment of the map, with the bot in the middle.&lt;/li&gt;&#xA;&lt;li&gt;It might also contain the ints in range 2..5 representing each teammate.&lt;/li&gt;&#xA;&lt;li&gt;It might also contain the int &lt;code&gt;-1&lt;/code&gt; representing an opponent.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;turn&lt;/code&gt; - The number of the turn, starting with 0. In the last turn of the phase it will be 24.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;chat&lt;/code&gt; - a list of new chat messages, stored in tuples &lt;code&gt;(author_id, msg_id)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The method must return a 0..4 value tuple or list, which may contain up to three actions the bot will perform during it and optionally a single chat message. Each item in tuple is a one move, depending on the value:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Falsy values (0, &lt;code&gt;None&lt;/code&gt;, &lt;code&gt;False&lt;/code&gt;) - Do nothing&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Positive int - Move in given direction, according to the rule (where the bot is in the center):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3&#xA;4   6&#xA;7 8 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Bot can only move to a neutral position.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;Negative int - Replace a neighbour dead cell with a neutral alive cell, according to the rule above, ex. &lt;code&gt;-1&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;String -  Send a chat message with the given ID, explained later&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Main phase&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Similar to the previous phase, but in this one, cells can die. It won't end until only one team is on the board.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;main&lt;/code&gt; method of each bot will be called once every turn. It will take these arguments in order:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;area&lt;/code&gt; - Same as in starting phase&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;team&lt;/code&gt; - Dictionary with position of teammates &lt;code&gt;id: (x, y)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;turn&lt;/code&gt; - The number of the turn, starting with 0. In the last turn of the phase it will be 24.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;hp&lt;/code&gt; - The amount of health points the bot has, explained later. Initially 4.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;chat&lt;/code&gt; - a list of new chat messages, stored in tuples &lt;code&gt;(author_id, msg_id)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The return value is the same as in the previous phase.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Neighbours, dying and reproducing&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A neighbour of a cell &lt;em&gt;a&lt;/em&gt; is an another cell that is positioned next to the cell &lt;em&gt;a&lt;/em&gt;, either orthogonal or diagonal.&lt;/li&gt;&#xA;&lt;li&gt;A neutral cell is any cell that is either &lt;code&gt;0&lt;/code&gt; or &lt;code&gt;1&lt;/code&gt; (isn't a bot).&lt;/li&gt;&#xA;&lt;li&gt;A bot cell is any cell occupied by a bot, that is, the negative number &lt;code&gt;-1&lt;/code&gt; and positive &lt;code&gt;2&lt;/code&gt;, &lt;code&gt;3&lt;/code&gt;, &lt;code&gt;4&lt;/code&gt;, &lt;code&gt;5&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A dead cell is any cell that is exactly &lt;code&gt;0&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;An alive cell is any cell that is not dead (&lt;code&gt;0&lt;/code&gt;). This includes both bot cells and &lt;code&gt;1&lt;/code&gt;'s.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In this round, cells can die. They can also reproduce.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Neutral cells (marked &lt;code&gt;1&lt;/code&gt;) will die (turn to &lt;code&gt;0&lt;/code&gt;) if amount of their alive neighbours is not 2 nor 3.&lt;/li&gt;&#xA;&lt;li&gt;Dead cells (marked &lt;code&gt;0&lt;/code&gt;) will reproduce (turn to &lt;code&gt;1&lt;/code&gt;) if amount of their alive neighbours is exactly 3.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Rules about bot cells (&lt;code&gt;-1&lt;/code&gt; and greater than &lt;code&gt;1&lt;/code&gt;) are a bit different though.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bot cells will lose 1 hp if amount of their alive neighbours is not 2 nor 3 &lt;em&gt;and no natural cells were reproduced in the neighbourhood&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Bot cells will die if they have 0 hp.&lt;/li&gt;&#xA;&lt;li&gt;Bot cells will gain 1 hp if amount of their alive neighbours is equal to 3 and at least 1 neighbour is a teammate. Cell will not gain hp if it has 3 or more hp.&lt;/li&gt;&#xA;&lt;li&gt;Bot cells will be moved if amount of their alive neighbours is not 2 nor 3 and a single nearby cell was reproduced (it will replace it). Bot cells cannot duplicate.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;The red zone&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Every 100 generations (turns), the red zone will start in the place with most dead cells. It will end after 10 turns, and every second turn it will spawn a &lt;a href=&quot;https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life#Examples_of_patterns&quot; rel=&quot;nofollow noreferrer&quot;&gt;glider&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Chatting&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Bots in the same team can communicate between themselves during the game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some of the messages were made because of how the board is generated. Make sure you read &lt;a href=&quot;https://github.com/Soaku/KoTH-CBG/blob/master/board.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; before, so you can use it to collaborate with other bots easier.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's a list of all &quot;built-in&quot; messages:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;1&lt;/code&gt; - Help!&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;2&lt;/code&gt; - Wait!&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;3&lt;/code&gt; - Need healing!&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;4&lt;/code&gt; - Come here&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;5&lt;/code&gt; - Enemies are nearby&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;6&lt;/code&gt; - I'll fight&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;7&lt;/code&gt; - I'll build&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;8&lt;/code&gt; - Search for boats/Build a boat&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;9&lt;/code&gt; - Get in the boat&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;10&lt;/code&gt; - Exit the glider&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;The controller&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;WIP, I won't probably have time to make it this week.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example bot&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A classic random bot, won't survive long.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import random&#xA;&#xA;&#xA;class RandomBot:&#xA;&#xA;    def __init__(*args): pass&#xA;&#xA;    def parachute(self, team: dict):&#xA;&#xA;        return random.choice([x for x in team.values() if x])&#xA;&#xA;    def start(*args):&#xA;&#xA;        return random.randint(-9, 9)&#xA;&#xA;    def main(*args):&#xA;&#xA;        return RandomBot.start()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Additional rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You have access only to non-superuser built-in Python packages&lt;/li&gt;&#xA;&lt;li&gt;You must not create, write nor open any files&lt;/li&gt;&#xA;&lt;li&gt;You cannot access any of internal or other bot's classes&lt;/li&gt;&#xA;&lt;li&gt;You cannot modify any mutable arguments given to your methods, only their copies&lt;/li&gt;&#xA;&lt;li&gt;You shouldn't throw any exceptions&lt;/li&gt;&#xA;&lt;li&gt;You must return only specified values.&lt;/li&gt;&#xA;&lt;li&gt;The code you publish here must not output anything&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="72792" LastEditorUserId="72792" LastEditDate="2018-05-08T11:30:56.497" LastActivityDate="2018-05-08T11:30:56.497" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="16367" PostTypeId="2" ParentId="2140" CreationDate="2018-05-08T07:45:44.310" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/editor-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;editor-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;editor-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrices&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrices&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrices&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Intro&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Many fans of high-powered editors like to learn new tricks. For example, &lt;a href=&quot;http://vimgolf.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;vimgolf.com&lt;/a&gt;: &quot;Real Vim ninjas count every keystroke&quot;. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Goal&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Produce this diagonal matrix in a text editor:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0000000000&#xA;0100000000&#xA;0020000000&#xA;0003000000&#xA;0000400000&#xA;0000050000&#xA;0000006000&#xA;0000000700&#xA;0000000080&#xA;0000000009&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Winning criterion&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Fewest keystrokes wins&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Need to do it in a text editor&lt;/li&gt;&#xA;&lt;li&gt;All pre-existing packages are allowed&lt;/li&gt;&#xA;&lt;li&gt;Must start from an empty page&lt;/li&gt;&#xA;&lt;li&gt;No copy/pasting external content&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Explanation&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Say which editor&lt;/li&gt;&#xA;&lt;li&gt;Present the total number of keystrokes&lt;/li&gt;&#xA;&lt;li&gt;Provide a list of keystrokes, and say what each one does&lt;/li&gt;&#xA;&lt;li&gt;Link to any packages used, so we can check them out!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4816/is-editor-golf-on-topic&quot;&gt;Is editor golf on-topic?&lt;/a&gt; for more info on editor golf.&lt;/p&gt;&#xA;" OwnerUserId="58945" LastEditorUserId="58945" LastEditDate="2018-05-08T08:16:53.347" LastActivityDate="2018-05-08T08:16:53.347" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="16371" PostTypeId="2" ParentId="2140" CreationDate="2018-05-08T17:30:13.827" Score="0" Body="&lt;h1&gt;How Many Cards Can You Play This Turn?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a deck of cards L, where each card has an nonnegative integer mana cost, and two nonnegative integers x, representing the mana you have this turn, and n, representing the number of cards you draw from the deck, output the average highest number of cards you can play this turn.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;i.e. given an array of nonnegative integers L and nonnegative integers x and n, create the subset N by choosing n random elements of L. Find the average of the maximum number of elements in N that sum to no greater than x.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For example, L = [0, 1, 2, 3, 4, 5, 6], x = 1, n = 1. You get 1 mana this turn and draw 1 card at random, from a deck of cards with mana cost 0...6. Since there is a 1/7 chance of drawing any card and you only have 1 mana, there is a 2/7 chance you can play the 1 card you draw (0 or 1) and a 5/7 chance you can’t play the card you draw (2...6). Therefore the average max number of cards that can be played is 2/7 = 0.286&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For a more complicated example, L = [0, 1, 2, 3, 4, 5, 6], x = 10, n = 4. You get 10 mana and draw 4 cards from the same deck as above. There are 7 choose 4 = 35 different possible hands. Of this, there are only 2 hands in which only two cards can be played (3,4,5,6 and 2,4,5,6). There are 22 hands where 3 cards can be played and 11 hands where 4 cards can be played. Therefore, the average max number of cards that can be played is (2*2 + 3*22 + 11*4) / 35 = 114/35 = 3.257&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specifications&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input must be a list of nonnegative integers, L, and two nonnegative integers, x and n.&lt;/li&gt;&#xA;&lt;li&gt;You may assume n &amp;lt;= len(L), i.e. you cannot draw more cards than are in the deck&lt;/li&gt;&#xA;&lt;li&gt;The output must be either a decimal which has at least 3 digits of precision or an exact fraction&lt;/li&gt;&#xA;&lt;li&gt;The distribution for each element of L must be equal&lt;/li&gt;&#xA;&lt;li&gt;Standard I/O methods apply and standard loopholes forbidden&lt;/li&gt;&#xA;&lt;li&gt;This is code golf so shortest answer in bytes wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: L (the deck), x (mana), n (cards drawn)&#xA;-&amp;gt; Output: average max # of cards played this turn (fraction for reference)&#xA;&#xA;[0, 1, 2, 3, 4, 5, 6], 1, 1 -&amp;gt; 0.286 (2/7)&#xA;[0, 1, 2, 3, 4, 5, 6], 2, 2 -&amp;gt; 0.810 (17/21)&#xA;[0, 1, 2, 3, 4, 5, 6], 3, 3 -&amp;gt; 1.457 (51/35)&#xA;&#xA;[0, 1, 2, 3, 4, 5, 6], 10, 3 -&amp;gt; 2.686 (94/35)&#xA;[0, 1, 2, 3, 4, 5, 6], 10, 4 -&amp;gt; 3.257 (114/35)&#xA;[0, 1, 2, 3, 4, 5, 6], 10, 5 -&amp;gt; 3.762 (79/21)&#xA;&#xA;[0, 1, 2, 3, 4, 5, 6], 1, 0 -&amp;gt; 0&#xA;[0, 0, 0, 0, 0, 0, 0], 1, 3 -&amp;gt; 3&#xA;[2, 3, 4, 5, 6, 7, 8], 1, 3 -&amp;gt; 0&#xA;&#xA;[0, 16, 4, 9, 3], 7, 2 -&amp;gt; 1.2 (12/10)&#xA;[11, 0, 3, 19, 6, 8, 15], 20, 4 -&amp;gt; 2.686 (94/35)&#xA;[14, 3, 2, 11, 5, 3, 9, 2, 10], 20, 6 -&amp;gt; 3.976 (334/84)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="72273" LastActivityDate="2018-05-08T17:30:13.827" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16374" PostTypeId="2" ParentId="2140" CreationDate="2018-05-09T03:47:02.587" Score="-3" Body="&lt;h1&gt;Reverse Code Golf- Print out two by using variables a and b that both equal one and adding them without any extraneous lines.&lt;/h1&gt;&#xA;&lt;p&gt;Your task is very simple, display that 1+1=2, except you need as many commands and non extraneous lines as possible.&lt;/p&gt;&#xA;&lt;p&gt;What counts as non-extraneous? If one cannot remove any kind of sequence or segment of commands, then the program is counted as non-extraneous. The variable names need to be only one byte each, without any kind of trailing zeroes or insignificant digits.&lt;/p&gt;&#xA;&lt;p&gt;Input: nothing&lt;/p&gt;&#xA;&lt;p&gt;Output: &amp;quot;2&amp;quot; or 2 or whatever, as long as the program runs 1+1.&lt;/p&gt;&#xA;&lt;p&gt;Sample: Java- &lt;code&gt;System.out.println( Integer.parseInt( &amp;quot;1&amp;quot; ) + Integer.parseInt( &amp;quot;1&amp;quot;));&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="48493" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-05-09T03:47:02.587" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16375" PostTypeId="2" ParentId="2140" CreationDate="2018-05-09T14:36:10.773" Score="3" Body="&lt;h2&gt;Find the minimum set of letters to buy&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Imagine that you own a board like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/uieBS.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/uieBS.jpg&quot; alt=&quot;Black letter board&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;which lets you write any message that you want, given that you have the letters for the message. Given that you have a list of messages that you want to switch between, find the minimum number of each letter that you have to order with your board. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an example, if your messages are &lt;code&gt;Hello world&lt;/code&gt; and &lt;code&gt;Hello aliens&lt;/code&gt;, you would need the letters &lt;code&gt;Helloworldaiens&lt;/code&gt;, as both messages share the &lt;code&gt;Hello&lt;/code&gt; part and the letter &lt;code&gt;l&lt;/code&gt; in the second word.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For this challenge, input messages will only consist of letters &lt;code&gt;a-zA-Z&lt;/code&gt; and space, however note that spaces are not included in the output as you don't need to buy them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;h2&gt;Input&lt;h2&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input consists of a list of strings, which all match &lt;code&gt;[a-zA-Z ]+&lt;/code&gt;. There is no limit on the amount of messages that can be provided, or their length.&lt;/p&gt;&#xA;&#xA;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Output consists of a string of a list of characters, where the letters in the output can be rearranged to create all the input messages, and is of minimal length. The output does not need to be sorted. &lt;/p&gt;&#xA;&#xA;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;['Hello world', 'Hello aliens'] =&amp;gt; Hadeeilllnoorsw&#xA;['foo', 'bar', 'baz'] =&amp;gt; abfoorz&#xA;['Eat more tacos', 'Drink more tequila'] =&amp;gt; DEaaceeiiklmnooqrrsttu&#xA;['Golfing is a fun activity', 'Code should be readable'] =&amp;gt; CGaabbcdddeeeeffghiiiillnnoorsttuvy&#xA;['a', 'b', 'c', 'd', 'e', 'f', 'g'] =&amp;gt; abcdefg&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This would of course be a &lt;code&gt;code-golf&lt;/code&gt; challenge&lt;/p&gt;&#xA;" OwnerUserId="79994" LastActivityDate="2018-05-09T14:36:10.773" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16376" PostTypeId="1" CreationDate="2018-05-09T22:28:12.600" Score="15" ViewCount="310" Body="&lt;p&gt;I want to suggest an idea for a non-conventional non-meta post. Can I make a well thought out thread where, as answers, people will post links to questions and name a language? I want a thread for &quot;cops&quot; the people who will respond to the &quot;robbers&quot; who will be asking for people to implement question X in language Y. Then I want a &quot;cops&quot; thread for the responses to aforementioned questions. This is quite unlike any other &quot;challenge&quot; ever posted, so I thought I'd suggest it in the meta section itself instead of sandbox. Is this type of &quot;meta-c&amp;amp;r&quot; allowed?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I feel like this would:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Encourage answers in rare languages.&lt;/li&gt;&#xA;&lt;li&gt;Revive old questions.&lt;/li&gt;&#xA;&lt;li&gt;Help new users understand languages!&lt;/li&gt;&#xA;&lt;li&gt;Most importantly: It'd be fun to post a &quot;hey, bet you can't do THIS in Brainflak!&quot; then have someone prove you wrong :).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Let me know what you think.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Robbers Layout:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#[Link to Question](Question URL)&#xA;&#xA;I would like this answered in [Langauge TIO Name](Language TIO Link) b/c X, Y and Z.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Cops Layout:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#[Link to Robbers Request](Request URL)&#xA;&#xA;&amp;lt;CODE/TIO LINK&amp;gt;&#xA;&#xA;[HELPFUL EXPLANATION, RESPONDING TO X, Y AND Z]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This would also be a good way to encourage bounties imho.&lt;/p&gt;&#xA;" OwnerUserId="59376" LastEditorUserId="59376" LastEditDate="2018-05-09T22:34:33.717" LastActivityDate="2018-05-10T20:35:24.043" Title="&quot;Unanswered in a Language I want to Understand&quot; C&amp;R Challenge Thread" Tags="|discussion|" AnswerCount="3" CommentCount="9" FavoriteCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16378" PostTypeId="2" ParentId="16376" CreationDate="2018-05-10T13:40:45.287" Score="3" Body="&lt;h3&gt;I don't think this fits on the main site&lt;/h3&gt;&#xA;&lt;p&gt;While I understand that you want to put this somewhere more visible than Meta because one of the goals is to provide this to people who don't have the reputation to post a Bounty for the List of bounties with no deadline, among other reasons, I don't think your attempt to coerce your desired result (help people who want to see challenge X answered in language Y) into an accepted PPCG format (Cops and Robbers) was successful. There are some superficial similarities that you put in intentionally, I think they both detract from the main purpose, and at the same time they don't actually accomplish the goal. For example, I can't think of a useful &amp;quot;Winning-criterion&amp;quot; or even a reasonable way of scoring either side. The coat of paint that you tried to put on your idea to pretend it's on-topic was not successful, and I don't think additional paint can fix the problem.&lt;/p&gt;&#xA;&lt;h3&gt;It's still a good idea&lt;/h3&gt;&#xA;&lt;p&gt;Or, I like it at least. I would much prefer if all the weird Cops and Robbers veneer were completely ditched and we just abuse the Q&amp;amp;A format even more than we already do. Basically, every &amp;quot;answer&amp;quot; would just be a request, then if someone fulfilled the request they should indicate that they did in a comment with a link and the poster of the request can edit that link into their &amp;quot;answer&amp;quot; (This pattern is common in CnR, so it doesn't seem like too much of an abuse of the comment system to be acceptable). I'll admit that I'm often in favor of not adhering too strictly to &amp;quot;Stack Exchange must be Q&amp;amp;A format&amp;quot;, but there are conflicting view points.&lt;/p&gt;&#xA;&lt;h3&gt;Without rephrasing it as a challenge, it could be on-topic&lt;/h3&gt;&#xA;&lt;p&gt;The main PPCG site isn't &lt;em&gt;solely&lt;/em&gt; restricted to challenges. For example, &amp;quot;Tips for golfing in [language]&amp;quot; posts are hosted there rather than Meta, and there are occasional &amp;quot;Help with X&amp;quot; questions, some of which are considered on-topic. I wouldn't take those as sufficient evidence that this could just be posted without worries, but in my opinion it does mean that this suggestion would be equally on- or off-topic regardless of attempts to rephrase as a challenge. If it's not allowed on the main site then it would definitely be acceptable in Meta, though that runs into the Sandbox Problem where new users that would benefit most just don't see it.&lt;/p&gt;&#xA;&lt;p&gt;Speaking of the Sandbox, I think that's the biggest evidence that this belongs in Meta. This strikes me as very similar to the Sandbox, and the Sandbox is very firmly in Meta. It's not indisputable, but I wouldn't try posting in Main unless there's a very strong consensus first.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-05-10T13:40:45.287" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16379" PostTypeId="2" ParentId="2140" CreationDate="2018-05-10T14:45:11.117" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/164760/orthodiagonal-steps&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66855" LastEditorUserId="66855" LastEditDate="2018-05-14T14:14:25.630" LastActivityDate="2018-05-14T14:14:25.630" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16380" PostTypeId="2" ParentId="2140" CreationDate="2018-05-10T14:55:03.470" Score="2" Body="&lt;h1&gt;Multidimensional orthodiagonal steps&lt;/h1&gt;&#xA;&lt;p&gt;Step further in step generation.&lt;br /&gt;&#xA;Navigation in 2d matrix is common, but something uncommon is even more insteresting.&lt;br /&gt;&#xA;Now I'll ask you to develope shortest solutions to generate all possible steps in N-dimensional matrix.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Your code takes positive integer number N &amp;gt; 0 as input.&lt;br /&gt;&#xA;Your code must output all possible steps in matrix of N dimensions. In other words, you need to output coordinates of all cells that touch (0;...;0) cell in any way.&lt;/p&gt;&#xA;&lt;h2&gt;Examples:&lt;/h2&gt;&#xA;&lt;p&gt;Input: 1&lt;br /&gt;&#xA;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(-1)&#xA;(1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input: 2&lt;br /&gt;&#xA;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(0,1)&#xA;(0,-1)&#xA;(1,0)&#xA;(-1,0)&#xA;(1,1)&#xA;(1,-1)&#xA;(-1,1)&#xA;(-1,-1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input 3:&#xA;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(0,1,0)   (0,1,1)    (0,1,-1)&#xA;(0,-1,0)  (0,-1,1)   (0,-1,-1)&#xA;(1,0,0)   (1,0,1)    (1,0,-1)&#xA;(-1,0,0)  (-1,0,1)   (-1,0,-1)&#xA;(1,1,0)   (1,1,1)    (1,1,-1)&#xA;(1,-1,0)  (1,-1,1)   (1,-1,-1)&#xA;(-1,1,0)  (-1,1,1)   (-1,1,-1)&#xA;(-1,-1,0) (-1,-1,1)  (-1,-1,-1)&#xA;(0,0,1)&#xA;(0,0,-1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Standart loopholes are disalowed&lt;/li&gt;&#xA;&lt;li&gt;Input number is always integer and always greater than zero&lt;/li&gt;&#xA;&lt;li&gt;Output order is not relevant&lt;/li&gt;&#xA;&lt;li&gt;Output is flexible. Coordinates just need to be distinguishable&lt;/li&gt;&#xA;&lt;li&gt;This is code-golf, so shortest answer in bytes wins&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="66855" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-05-10T15:07:05.417" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16381" PostTypeId="2" ParentId="13090" CreationDate="2018-05-10T16:26:41.453" Score="11" Body="&lt;h1&gt;No, as long as the winning criterion is already clear from the tags&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Most challenges on PPCG are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. A lot of distraction, duplication, and possibly inconsistency is caused by having to re-explain in each of them what &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; means. On the other hand, the probability and the cost of a new user mistakenly using the tag are small, as that is usually caught quickly and then the user learns and doesn't repeat the mistake (assuming good intentions).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Due to the nature of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, it does require an explanation of how performance will be measured.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In practice we don't have this problem with other tags, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/koth&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;koth&amp;#39;&quot; rel=&quot;tag&quot;&gt;koth&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;. They are rare and authors tend to explain the winning criterion well.&lt;/p&gt;&#xA;" OwnerUserId="24908" LastActivityDate="2018-05-10T16:26:41.453" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16382" PostTypeId="2" ParentId="16376" CreationDate="2018-05-10T18:38:15.907" Score="16" Body="&lt;h2&gt;What if we &lt;em&gt;don't&lt;/em&gt; make it a challenge?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I like the idea of having a thread open to solution-requests. However, stretching the rules and making it a challenge makes no sense to me. I suggest another model, which I think would be on-topic if we all come to an agreement:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Write a post (question) in which you &lt;em&gt;clearly&lt;/em&gt; describe the purposes of this initiative. Ideally, make it a community wiki (this is solely my opinion).&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each answer to that question would be a proposal in the format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# [Challenge title](challenge link) in [Language X](language link)&#xA;&#xA;A short description of the challenge + the reasons they think a solution in that&#xA;language would be beneficial.&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Other people submit solutions to the challenges linked and then comment under the proposal. Naturally, multiple solutions can be posted to incentivize competition.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;IMHO, such a post is worthy of having on  PPCG. Not only will it be a catalogue of non-trivial solutions that gives those more visibility, but it would also help the newcomers learn other languages in a more efficient manner. Plus, as already &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/16376/unanswered-in-a-language-i-want-to-understand-cr-challenge-thread#comment56962_16376&quot;&gt;mentioned&lt;/a&gt; by Leo, it would play well with our relatively new &quot;Language of the Month&quot; event. There are downsides too, however:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The activity will eventually decrease and the post will most likely stagnate and lose visibility.&lt;/li&gt;&#xA;&lt;li&gt;It kind of bends our rules, and is somewhat conflicting the Q&amp;amp;A format SE provides. I don't think that's a major problem, though. I think we can make this work.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="59487" LastActivityDate="2018-05-10T18:38:15.907" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16383" PostTypeId="2" ParentId="16376" CreationDate="2018-05-10T20:35:24.043" Score="4" Body="&lt;h2&gt;This is basically a duplicate of: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5243/34718&quot;&gt;List of bounties with no deadline&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The bounty list has posts asking for solutions to specific challenges in specific languages (combinations that are often difficult and worthy of a bounty.) Examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8219/34718&quot;&gt;Fitting but Unsuitable Languages: 3 x 500 points&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14505/34718&quot;&gt;200 rep for a segfault in Actually&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10461/34718&quot;&gt;100 bounty: Minecraft prime checker&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When someone asks for a solution like what you are suggesting, it's often difficult. Having a bounty makes it more likely that someone will put in the effort. It also makes finding a solution more gratifying when you receive a bounty for it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Part of this is already covered by searching for &lt;a href=&quot;https://codegolf.stackexchange.com/unanswered&quot;&gt;unanswered challenges&lt;/a&gt;, in which case any solution is welcome.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This would also be a good way to encourage bounties imho.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Again, this is already covered by the list of bounties with no deadline. I don't think there's any reason to create another list and disguise it as a challenge when &lt;strong&gt;we already have something that fulfills this purpose&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;I think we would be better off organizing the existing page, or perhaps recreating it with each &quot;request&quot; posted as an answer rather than edited into the question (this is already suggested in the comments, but some people haven't been doing that.)&lt;/s&gt; -- Just saw that Peter Taylor edited the question to fix this a few days ago.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We should instead work to do a better job of promoting the existing list of bounties.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastActivityDate="2018-05-10T20:35:24.043" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16385" PostTypeId="2" ParentId="16317" CreationDate="2018-05-11T08:52:08.163" Score="-1" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;It must be possible to identify a section of the program which encodes a different part of the program. (&quot;Different&quot; meaning that the two parts appear in different positions.)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So, these are invalid:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;img onerror=&quot;alert(document.body.innerHTML)&quot; src=&quot;#&quot;&amp;gt;&#xA;&amp;lt;img onerror=&quot;alert(this.outerHTML)&quot; src=&quot;#&quot;&amp;gt;&#xA;&amp;lt;body onload=&quot;alert(document.body.outerHTML.slice(0,-7))&quot;&amp;gt;&#xA;&amp;lt;div id=&quot;r&quot;&amp;gt;&amp;lt;script&amp;gt;setTimeout(&quot;alert(r.outerHTML)&quot;)&amp;lt;/script&amp;gt;&amp;lt;/div&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It's just nothing about &lt;code&gt;document.body&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2018-05-11T08:52:08.163" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16387" PostTypeId="2" ParentId="2140" CreationDate="2018-05-11T15:56:52.867" Score="1" Body="&lt;h2&gt;Pascal Squared Sums&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Most everyone here is familiar with Pascal's triangle, which is formed by taking the summation of the two parent objects. Here are the first few rows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;     1&#xA;    1 1&#xA;   1 2 1&#xA;  1 3 3 1&#xA; 1 4 6 4 1&#xA;    ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Let's instead rotate this to the left by 45 degrees, and assume that it's forming an infinite matrix. Alternatively, this can be thought of as the triangle is reading the anti-diagonals of the matrix.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 1 1 1 1&#xA;1 2 3 4&#xA;1 3 6&#xA;1 4   ...&#xA;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Given an input &lt;code&gt;n&lt;/code&gt;, take the top-left &lt;code&gt;n x n&lt;/code&gt; sub-matrix of this infinite matrix. Then, take the column sums of that &lt;code&gt;n x n&lt;/code&gt; matrix as your output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, for input &lt;code&gt;n = 3&lt;/code&gt;, this would result in the sub-matrix&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 1 1&#xA;1 2 3&#xA;1 3 6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Taking the column sums gives us &lt;code&gt;3, 6, 10&lt;/code&gt;, so our output is &lt;code&gt;[3, 6, 10]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Standard I/O Boilerplate&lt;/h3&gt;&#xA;" OwnerUserId="42963" LastActivityDate="2018-05-11T15:56:52.867" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16389" PostTypeId="2" ParentId="2140" CreationDate="2018-05-12T02:29:21.403" Score="1" Body="&lt;h1&gt;Polyraptor/Forerunner Combo&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/mtg&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;mtg&amp;#39;&quot; rel=&quot;tag&quot;&gt;mtg&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Notice: You probably need to understand the Stack in MTG for this challenge!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A new expansion to the trading card game &lt;a href=&quot;https://magic.wizards.com/en&quot; rel=&quot;nofollow noreferrer&quot;&gt;Magic: The Gathering&lt;/a&gt;, &lt;em&gt;Rivals of Ixalan&lt;/em&gt;, was released this January. In this set were the two cards important to this challenge: &lt;a href=&quot;http://gatherer.wizards.com/Pages/Card/Details.aspx?name=Forerunner+of+the+Empire&quot; rel=&quot;nofollow noreferrer&quot;&gt;Forerunner of the Empire&lt;/a&gt; and &lt;a href=&quot;http://gatherer.wizards.com/Pages/Card/Details.aspx?name=polyraptor&quot; rel=&quot;nofollow noreferrer&quot;&gt;Polyraptor&lt;/a&gt;, as I learned just now after losing a game of &lt;a href=&quot;https://magic.wizards.com/en/mtgarena&quot; rel=&quot;nofollow noreferrer&quot;&gt;MTG Arena&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ZDETl.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZDETl.png&quot; alt=&quot;Forerunner of the Empire&quot;&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/Sphws.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Sphws.png&quot; alt=&quot;Polyraptor&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;I like the Polyraptor in the background of Forerunner. Wizards knew precisely what they had brought about.&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you'll notice, if a Polyraptor enters the battlefield under your control, since it's a Dinosaur (look at the bit just below the art), it triggers Forerunner of the Empire's second ability. You may then have the Forerunner deal one damage to all creatures, including itself and Polyraptor! This clones Polyraptor, and the clone ALSO TRIGGERS THE ABILITY! This time, each Polyraptor (there are two now) takes one damage, and TWO new clones spring into being! However, these clone-making abilities execute one after another, not simultaneously. Both are pushed to the Stack, and the second pops and resolves. The Polyraptor clone enters the battlefield and triggers the Forerunner's ability BEFORE the second Polyraptor clone is created (Forerunner's ability pops from the Stack earlier). Again, Forerunner of the Empire deals one damage to each creature. There are now three Polyraptors, and each takes one damage. Three more Polyraptor clonings enter the Stack, which now contains four. The Forerunner, having at this point taken three damage this turn, dies, and the rest of the Polyraptors enter the battlefield without triggering its ability. When all's said and done, there are seven Polyraptors on the battlefield.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Generalization&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Now, imagine for a moment that Forerunner had five toughness and Polyraptor three instead. Let &lt;code&gt;PA := Polyraptor-cloning ability&lt;/code&gt; and &lt;code&gt;FA := One damage to all creatures&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Polyraptor enters.                        Stack: FA&#xA;Forerunner deals one to each creature.    Stack: PA PA&#xA;Polyraptor enters.                        Stack: PA FA&#xA;Forerunner deals one to each creature.    Stack: PA PA PA PA&#xA;Polyraptor enters.                        Stack: PA PA PA FA&#xA;Forerunner deals one to each creature.    Stack: PA PA PA PA PA PA&#xA;  At this point, the original Polyraptor dies. It will no longer take damage. Three left.&#xA;Polyraptor enters.                        Stack: PA PA PA PA PA FA&#xA;Forerunner deals one to each creature.    Stack: PA PA PA PA PA PA PA PA&#xA;  Another Polyraptor dies. Three left.&#xA;Polyraptor enters.                        Stack: PA PA PA PA PA PA PA FA&#xA;Forerunner deals one to each creature.    Stack: PA PA PA PA PA PA PA PA PA PA&#xA;  Another Polyraptor dies. Three left.&#xA;  Forerunner also dies here.&#xA;The Stack empties with no more abilies triggered.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here, the final Polyraptor count is 13.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Your task&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that takes as input two nonnegative integers &lt;code&gt;F&lt;/code&gt; and &lt;code&gt;P&lt;/code&gt; and returns the final count of Polyraptors when a Polyraptor with toughness &lt;code&gt;P&lt;/code&gt; is cast while its owner controls a Forerunner of the Empire with toughness &lt;code&gt;F&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Form: &lt;code&gt;F&lt;/code&gt;, followed by &lt;code&gt;P&lt;/code&gt;, followed by the result and an explanation.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 0&#xA;0&#xA;The Forerunner has zero toughness, so it dies before anything happens. The Polyraptor dies immediately upon entering play.&#xA;&#xA;0 5&#xA;1&#xA;As before, the Forerunner dies, but this time, the Polyraptor lives to see the dawn.&#xA;&#xA;1 0&#xA;0&#xA;The Forerunner's ability triggers once, but all Polyraptors die on their own.&#xA;&#xA;1 5&#xA;2&#xA;This time, the Forerunner kills itself damaging and copying the Polyraptor once.&#xA;&#xA;2 5&#xA;4&#xA;Again, Forerunner kills itself, but this time, it manages to copy the Polyraptor and then both the original and the copy.&#xA;&#xA;3 5&#xA;7&#xA;See above&#xA;&#xA;5 3&#xA;13&#xA;See above&#xA;&#xA;More coming! This is hard to do by hand :|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Forerunner of the Empire's ability says &quot;may&quot;. Ignore that—it always deals the damage.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/73884&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/73884&quot;&gt;I/O is flexible&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest solution (in bytes) in each language wins! Happy golfing!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Sandboxy Stuff&lt;/h1&gt;&#xA;  &#xA;  &lt;p&gt;Did I mess up a test case?&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;What do y'all think? Should I explain the Stack so all can understand?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="73884" LastActivityDate="2018-05-12T02:29:21.403" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16393" PostTypeId="2" ParentId="2140" CreationDate="2018-05-14T04:36:47.307" Score="0" Body="&lt;h1&gt;Source in n bytes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program &lt;code&gt;A&lt;/code&gt; and an integer &lt;code&gt;K&lt;/code&gt; that, when given a number &lt;code&gt;n&amp;gt;=K&lt;/code&gt;, your program generates a program(in same language) of length &lt;code&gt;n&lt;/code&gt; that generates the source program &lt;code&gt;A&lt;/code&gt; and don't if some characters are removed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Smallest &lt;code&gt;K&lt;/code&gt; for each language win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2018-05-14T04:36:47.307" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="16394" PostTypeId="2" ParentId="8350" CreationDate="2018-05-14T07:37:47.083" Score="6" Body="&lt;h1&gt;Customize the How To Ask box further&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We're still getting a bunch of homework questions and interview riddles. I think the phrasing on the How To Ask box could be tweaked to make it &lt;strong&gt;abundantly&lt;/strong&gt; clear that this is not a Q&amp;amp;A site:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/v7eX4.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/v7eX4.png&quot; alt=&quot;PPCG&amp;#39;s How To Ask box&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I suggest we:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Remove the bolded question at the top. I think a large number of users submitting “bad” asks read this question and think “oh, this is/could be conceived as a puzzle, so it's welcome here.” I don't think the phrasing “programming puzzle”, which is generally agreed to be a little misleading, should be in this box at all.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Replace it with something like &lt;strong&gt;We’re not a traditional Q&amp;amp;A or homework help site.&lt;/strong&gt; in bold and red, so it will catch the eye of anyone submitting their first question.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="3852" LastActivityDate="2018-05-14T07:37:47.083" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16395" PostTypeId="2" ParentId="2140" CreationDate="2018-05-14T08:29:29.447" Score="2" Body="&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/164833/fridge-magnet-substitution&quot;&gt;Fridge magnet substitution (posted)&lt;/a&gt;&lt;/h3&gt;&#xA;" OwnerUserId="79994" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-05-15T15:13:18.977" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16396" PostTypeId="2" ParentId="2140" CreationDate="2018-05-14T14:08:14.963" Score="0" Body="&lt;h2&gt;Calculator tape&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There is an infinite amount of calculators in a row (supporting the four basic operations, +, -, *, and /), all initially displaying &quot;0&quot;. They have a peculiar property that any calculator which has a result lower than either the one to its left or right stop accepting any button presses except &quot;=&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Besides the calculators is an operator who follows certain instructions and presses their buttons accordingly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, the operator is a bit lazy and has asked you to write a program which would simulate all of this for him and then output a list of all nonzero calculator results.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Calculators and operations&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Every calculator has three registers, one which stores the input, one which stores the last result, and one which stores the currently selected operation (+, -, *, /).&lt;br&gt;&#xA;In the beginning, the input and result registers are &lt;code&gt;unset&lt;/code&gt;, acting as 0 if adding/subtracting or 1 if multiplying/dividing. The operation starts as &lt;code&gt;+&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The operations available are the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;0&lt;/code&gt;..&lt;code&gt;9&lt;/code&gt; - Append the digit to the input of the selected calculator, without changing its result.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;#&lt;/code&gt; (±) - Change the sign of the input. Note that this might be executed even when the input is 0.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;+&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;, &lt;code&gt;*&lt;/code&gt;, &lt;code&gt;/&lt;/code&gt; - Evaluate the current operation, then set the operation accordingly and reset the input. As it changes the result, it might change the disabled statuses of calculators.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;=&lt;/code&gt; - Evaluate the current operation and reset the input. Don't reset the operation.&lt;br&gt;&#xA;Unlike the other operations, this operation works even when the calculator has a lower result than its adjacent calculators.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;lt;&lt;/code&gt;, &lt;code&gt;&amp;gt;&lt;/code&gt; - Select the previous or the next calculator, similar to BF. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Input and output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input is going to be a string or list of operations to be done. The characters used to represent the individual operations need not be the same as outlined above, but must be distinct.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output should be a list (in any format) composed of nonzero calculator results and their indices. The indices might start from any number, as long as it is identical between runs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input  -&amp;gt;  Output # comment&#xA;1  -&amp;gt;  # The calculator's result is 0&#xA;1=  -&amp;gt; 0: 1 # The = operation evaluates result + input = 0 + 1 = 1&#xA;1#=  -&amp;gt; 0: -1&#xA;#1=  -&amp;gt; 0: -1 # Note that this results in input being -0 for a moment&#xA;1=&amp;gt;2=  -&amp;gt;  0: 1 # The second calculator does not work while the first is larger&#xA;1#=&amp;gt;2=  -&amp;gt;  0: -1, 1: 2 # Results start at 0, so negative results don't disable&#xA;1&amp;gt;2=&amp;lt;=  -&amp;gt;  0: 1, 1: 2 # = Works on otherwise-disabled calculators&#xA;4*4&amp;gt;1+2=&amp;lt;=  -&amp;gt;  0: 16 # * changes the result to 4, thus disabling others&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;As it currently stands, there are too few complicated examples, mainly because it is too easy to disable a calculator. Would be nice to have some which have multiple adjacent calculators with the same result.&lt;/li&gt;&#xA;&lt;li&gt;There is too little inter-calculator interaction past the disabling mechanic. Maybe some way to read a result as input?&lt;/li&gt;&#xA;&lt;li&gt;The third point might be yours! Comment to claim it ;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41277" LastEditorUserId="41277" LastEditDate="2018-05-15T11:53:05.873" LastActivityDate="2018-05-15T11:53:05.873" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16397" PostTypeId="2" ParentId="2140" CreationDate="2018-05-14T14:28:09.057" Score="1" Body="&lt;h1&gt;Create a solver for the Topspin puzzle&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The Topspin puzzle consists of 20 round pieces in one long looped track. The pieces can slide along the loop. There is a turntable on one of the sides of the the loop which can rotate the four adjacent pieces laying within it, so that they reverse their order. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;By sliding the pieces left and right and rotating the turntable the puzzle can be scrambled.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal is to restore the pieces in their initital order by sliding / rotating them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ur4Em.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ur4Em.jpg&quot; alt=&quot;Topspin&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can learn more about the puzzle here: &lt;a href=&quot;https://www.jaapsch.net/puzzles/topspin.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.jaapsch.net/puzzles/topspin.htm&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program / function that solves the Topspin puzzle from a scrambled to ordered state.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input is a list of the numbered scrambled pieces, in any convenient format. For example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;10 18 12 11 7 2 3 4 6 9 15 19 14 17 1 8 13 5 20 16&lt;/code&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can use 0-indexing, just mention it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The output is a list of moves that solve the puzzle. You a free to chose a notation which suits your language / algorithm. Possible notation:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;0&lt;/code&gt; - rotate the turntable&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1&lt;/code&gt; - slide all pieces to the left&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;2&lt;/code&gt; - slide all pieces to the right&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;or:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;t&lt;/code&gt; - rotate the turntable&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;l&lt;/code&gt; - slide all pieces to the left&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;r&lt;/code&gt; - slide all pieces to the right&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Since the pieces form a loop it is NOT necessary to shift the pieces in the final solution so that the lists starts at 1. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So the output should look something like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;011022201...&lt;/code&gt; and so on&lt;/p&gt;&#xA;&#xA;&lt;p&gt;or &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;tllltltrrt...&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;14 1 9 10 17 15 13 18 16 6 12 19 2 11 20 4 7 8 5 3&#xA;3 4 18 1 5 13 14 8 2 16 10 12 15 9 7 17 20 11 6 19&#xA;6 16 5 13 14 17 11 8 10 7 4 3 15 1 18 9 20 12 19 2&lt;/code&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can use this script to generate more scrambled sequences:&#xA;&lt;a href=&quot;https://tio.run/##NY7BDoMwDEPv/Qr/AYxtFz5j16iH0kZaBbRRqED7@q5oLL49W46VQ31xIFvVpZDXbmMOSPnoSlzZTCN8lg/IGmVhV5Aw9OREOAVMSNYsOQuefU8G7bYjFv/Grwx3MjfQmndu2eLigsma4U@cny944jvIj1DeWTdufOZOnJZmPtBmXC/9GT0lGlMza/0C&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Red – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can check your solution with this script: &lt;a href=&quot;https://tio.run/##bVJbcoMwDPznFHuDVlKSJhyjvx4@gJhpJk3KODQ9PjUO2DKJBz@Q1vJqJWeP46c9mmrsSnS/1xamwaUyKOBH9@Ns3X7B4WKCYRq3v9MQbMk0DYK5/NwtGgz16RtNlXl58dbteQasIQLTlnD2bt3NeszZvvW1Gzxwg6ZE3ff2ekSrroVDWJqiGusSZucfooMPtcEHyJ/9KthjC9qD30Eb0M5TJf/5vy0OVeFjG/H3ZLKHlacoYT4sHCapncNZIpIjTjL84qMYS6Kd5vsP/xJ/eYUVo2SnGbt4Ex9RHFKEdFMyDM9MJO5pLtwo3iKVC0eUjigxi6SiRF46R8p4UFSR1VspIiutROXM0ZZU44w7r1ShVRUWm7zIL@@FhMm5stIoVZmVjqL0FcXwWfNcD3rhTdFSBUh16ZqX1pAyRqQi8KoGpDJ@5kcqOq8qyapz1/@U9SplfcEqQ1YV0JXSqib1OHtFXva9Vsr7qqJ3p@uADjWa8R8&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Red – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(&lt;code&gt;a&lt;/code&gt; is 1-indexed list of the scrambled pieces, &lt;code&gt;b&lt;/code&gt; is the solution in notation - &lt;code&gt;1&lt;/code&gt; - slide to left, &lt;code&gt;2&lt;/code&gt; - slide to right, &lt;code&gt;3&lt;/code&gt; - turn )&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winning criteria:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shorest solutions in bytes in each language win. Please explain you algorithm!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="75681" LastActivityDate="2018-05-14T14:28:09.057" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="16399" PostTypeId="2" ParentId="2140" CreationDate="2018-05-14T16:30:19.420" Score="2" Body="&lt;h1&gt;Treasure Map Drawing Bot&lt;/h1&gt;&#xA;&lt;p&gt;You're organizing a treasure hunt for your friends. To conduct things more easily, you want to draw a map of all locations where you hid the precious objects.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;A string consisting of the locations of the objects separated by newlines. Each location is represented by two non-negative integer coordinates describing the position in the field by an x- and y-coordinate, &lt;code&gt;0 0&lt;/code&gt; being the upper left corner. Example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 2&#xA;3 0&#xA;0 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Your function or program should be able to construct a map denoting every given location with an &lt;code&gt;x&lt;/code&gt; where the mark is found in row y + 1 and column x + 1 in the output. Unmarked locations are represented with a &lt;code&gt; &lt;/code&gt;. The map also consists of a frame where the corners are &lt;code&gt;+&lt;/code&gt;s, the vertical lines are &lt;code&gt;|&lt;/code&gt;s and the horizontal lines are &lt;code&gt;-&lt;/code&gt;s. Map for the input example given above:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+----+&#xA;|   x|&#xA;|x   |&#xA;| x  |&#xA;+----+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Possible Test Cases&lt;/h2&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;0 0&amp;quot;&#xA;=&amp;gt;&#xA;+-+&#xA;|x|&#xA;+-+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;0 10&#xA; 5 5&#xA; 10 0&amp;quot;&#xA;=&amp;gt;&#xA;+-----------+&#xA;|          x|&#xA;|           |&#xA;|           |&#xA;|           |&#xA;|           |&#xA;|     x     |&#xA;|           |&#xA;|           |&#xA;|           |&#xA;|           |&#xA;|x          |&#xA;+-----------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;&amp;quot;&#xA;=&amp;gt;&#xA;++&#xA;++&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;0 0&#xA; 0 2&#xA; 2 0&amp;quot;&#xA;=&amp;gt;&#xA;+---+&#xA;|x x|&#xA;|   |&#xA;|x  |&#xA;+---+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Of course, this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, meaning that the solution with the lowest byte count wins!&lt;/p&gt;&#xA;" OwnerUserId="72218" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-05-16T04:50:20.497" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16400" PostTypeId="1" CreationDate="2018-05-15T05:28:29.010" Score="13" ViewCount="285" Body="&lt;p&gt;As per past &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4939/do-function-submissions-have-to-be-reusable&quot;&gt;discussion&lt;/a&gt;, function submissions should be reusable. And, currying function may be a valid submission.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider a challenge which require 2 inputs &lt;code&gt;x&lt;/code&gt;, and, &lt;code&gt;y&lt;/code&gt;. A currying function submission may be &lt;code&gt;f = λ x: (initial_global(); λ y: more_codes_about(x, y))&lt;/code&gt;, and it should be used as &lt;code&gt;f(x)(y)&lt;/code&gt;. Though &lt;code&gt;f&lt;/code&gt; is reusable, &lt;code&gt;g = f(x)&lt;/code&gt; is not (due to failed to initialize global values). Is this a valid submission? Or, in the other word, is function &lt;code&gt;g = f(x)&lt;/code&gt; required to be reusable?&lt;/p&gt;&#xA;" OwnerUserId="44718" LastEditorUserId="44718" LastEditDate="2018-05-15T11:26:57.843" LastActivityDate="2018-05-27T04:42:28.090" Title="Is function returned by first invoke of a currying function submission required to be reusable?" Tags="|discussion|policy|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16403" PostTypeId="2" ParentId="16400" CreationDate="2018-05-15T13:16:59.793" Score="18" Body="&lt;h2&gt;Only the first function need be reusable&lt;/h2&gt;&#xA;&lt;p&gt;I'd say this for the following reasons:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Disadvantage to functional languages&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Suppose that there is a challenge to print two numbers, and I submitted the following code in F#:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;let f x y =&#xA; printfn &amp;quot;x: %i y: %i&amp;quot; x y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://fsharpforfunandprofit.com/posts/currying/&quot; rel=&quot;nofollow noreferrer&quot;&gt;F# would implicitly curry this&lt;/a&gt;, so to comply it would have to be re-written into something like:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;let g y = &#xA; printfn &amp;quot;y: %i&amp;quot; y&#xA;&#xA;let f x =&#xA; printf &amp;quot;x: %i &amp;quot; x&#xA; g&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Which is a disadvantage to F# (and I'm assuming other functional languages!)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;It's the submitted function itself that's important&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Martin Ender said this too in his comment.&lt;/p&gt;&#xA;&lt;p&gt;When I look at a submission like:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;let f x y =&#xA; printfn &amp;quot;x: %i y: %i&amp;quot; x y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;I'm more looking at if &lt;em&gt;this block of code&lt;/em&gt; is reusable, rather than &lt;em&gt;the individual functions curried in this code&lt;/em&gt;. I would expect that the code function be reusable, but not every function implicitly defined in it. The actual submission is what's important.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;It's not a very interesting rule&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The rules are (mainly) there to keep challenges open and interesting. It means that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1063/78954&quot;&gt;I can't hard-code a solution&lt;/a&gt; to a puzzle, because that would make things too easy and dull.&lt;/p&gt;&#xA;&lt;p&gt;With this restriction I cannot see how it would make things more interesting. To me it would be a superfluous rule that's just there to be followed, and doesn't add anything to the site.&lt;/p&gt;&#xA;" OwnerUserId="78954" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-05-15T13:16:59.793" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16413" PostTypeId="2" ParentId="2140" CreationDate="2018-05-17T17:54:33.430" Score="-6" Body="&lt;p&gt;Merge two code in two languages into a polyglot.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;E.g. If you choose C &amp;amp; Python 3, you can merge &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;main(){puts(&quot;a&quot;);}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;print(6)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;into&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#define print(x) main(){puts(&quot;a&quot;);}&#xA;print(6)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; (for it's hard to have a score on language difficulty, optimizy, etc.)&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2018-05-17T17:54:33.430" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16415" PostTypeId="2" ParentId="2140" CreationDate="2018-05-18T22:07:36.483" Score="7" Body="&lt;h1&gt;The Formic Forest - Ant QotH Contest&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Overview&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;While the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/135102/formic-functions-ant-queen-of-the-hill-contest&quot;&gt;ants of the highlands&lt;/a&gt; gather food and walk around each other, their distant cousins live in the forests below, growing fungus and aggressively raiding the ground and other nests for food. But like their highland counterparts, they want food, and they have armies of workers at their disposal to get at it. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Arena&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The arena is a torodial 1000*2500 rectangular grid of cells. Each cell has one of eight colors, and at most one object at any one time. There are three types of objects of significance: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Ants are either queens, which are spawned at the start of the game, or workers, which are spawned by queens. &lt;/li&gt;&#xA;&lt;li&gt;Food is a prized possession, and may be hoarded or consumed. &lt;/li&gt;&#xA;&lt;li&gt;Fungi are ant-placed objects which may be created at low cost and will grow slowly into food if left alone within the vicinity of food. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In this game, adjacency refers to being in the &lt;a href=&quot;https://en.wikipedia.org/wiki/Moore_neighborhood&quot; rel=&quot;nofollow noreferrer&quot;&gt;Moore Neighborhood&lt;/a&gt; unless otherwise specified. Some rules instead specify the &lt;a href=&quot;https://en.wikipedia.org/wiki/Von_Neumann_neighborhood&quot; rel=&quot;nofollow noreferrer&quot;&gt;von Neumann neighborhood&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Game Overview&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each game, 16 submissions are put against each other in a game. If the competition has fewer than 16 submissions, all of them participate in a game, and if there are more, the 16 players are chosen randomly. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the beginning of each game, each cell is reset to the color 0 (white), each submission used in the game has its corresponding submission object constructed, and 2500 food, and 16 queens are randomly scattered onto the map. Queens are very unlikely to be adjacent to food or other queens, but this is not a guarantee. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then the game itself proceeds. The game lasts for 15000 turns, and each turn consists of the following phases, each of which is resolved concurrently in turn:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Decide: Each ant's views are determined based on the current state of the arena and previous move history, and each ant's decision is determined and validated separately.&lt;/li&gt;&#xA;&lt;li&gt;Move: Each ant's decision is executed simultaneously, and the presence of multiple objects in a single cell resolved once all ants that decided to move into a cell have done so.&lt;/li&gt;&#xA;&lt;li&gt;Grow: Each object that can potentially change as a result of its surroundings has its neighborhood resolved, and the changes to the objects as a result happen simultaneously.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;After the 15000 turns is up, the game ends. Submission objects are disposed of, caches trimmed down, food amounts logged, and the process started again if more scores need to be collected. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Ant Senses&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each ant has a 5*5 area of sight centered on themselves. This area of sight is arranged to give the ants a relative sense of direction in the immediate term, but not innately in the long term. Ants can see the color of empty cells, and the properties of objects in filled cells, but not the color of filled cells. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each ant also has an internal state that can take one of eight values. This state is internal to that ant, and to transfer information between herself and other ants or to remember more than this, she must position herself, drop payloads, or mark the ground below her, all which are subject to enemy interference. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Ant Actions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Using their senses, ants can decide to move or drop payloads, and also color their current cell and change their current state simultaneously, once per turn. The coloring happens on the cell that the ant is currently in, before she moves. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ants move orthogonally or diagonally one cell at a time. Worker ants are free to move into other cells at their own risk, but a queen may not move to a cell that her view shows is in the Moore neighborhood of a non-adjacent queen, nor to a cell that her view shows is in the von Neumann neighborhood of an adjacent queen. (However, it is legal for a queen to stay still on a cell adjacent to another queen.) Additionally, a queen without food may not move into a step into a cell already occupied by a laden worker, lest she step onto a laden worker that decides to stay still, which would without this restriction kill her. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Instead of moving, ants may instead drop a payload into an adjacent cell. Food payloads cost one food, and can only be performed if the ant is carrying food. Fungus payloads cost nothing, and may be freely placed. Ant payloads may be performed only by the queen, cost one food, and consistently result in a new loyal worker. It is legal to drop payloads on oneself, but this will usually result in the dropped object being picked back up or destroyed during collision resultion, to no substantive effect. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Ant Lifecycle&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Both queen and worker ants start in state 0. Worker ants are oriented such that their &quot;from&quot; cell is the cell the queen occupied when spawning the worker, while queen ants have a random initial orientation. From there, it is up to submissions to perform ant-specific initialization and differentiation if desired. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once spawned, ants have an indefinite lifetime. Queen ants are guaranteed to live up to the end of the game, but worker ants may die by colliding with other ants. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Ant Leeching&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;After movements and collisions are handled, a queen may neighbor one or more unladen enemy workers. If the number of such neighbors is equal to or less than the amount of food carried by that ant, then the queen loses food equal to the number of adjacent enemy workers. An unladen worker ant that neighbors one or more enemy queens that lose food this way gains one food. If a worker is next to multiple such enemy queens, she receives only one food, and one or more food is simply lost forever. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This transfer does not occur between allied ants. To perform such food transfers, you must command the laden ant to drop her food in an adjacent cell, and have another ally be in that cell to automatically pick it up. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Fungi&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Fungi are a means of spawning more food. Fungus farms may potentially lead to bountiful harvests for submissions that invest the resources to spawn, watch over, guard and harvest these fungi. They may also be strategically planted to obscure the ground or probe for food from a distance. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If food is within a 9 by 9 cell area centered around the fungus, then the fungus will grow. Internally, fungus takes 32768 steps to mature and spawn into food, and will gain 1 step per generation per piece of food placed in this vicinity. Therefore, placing more food in the vicinity of a fungus will speed up the fungus's growth, but will also make a nice feast for any ants that find it. If a fungus is not within the vicinity of food, it will not grow. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Growth stages are visible to all ants, and work as a coarse indicator of the age of the fungus. 0 means that the fungus has taken no steps toward maturity, 1 means the fungus has taken 1-7 steps toward maturity, 2 means the fungus has taken 8-63 steps toward maturity, 3 means the fungus has taken 64-511 steps toward maturity, 4 means the fungus has taken 512-4095 steps toward maturity, and 5 means the fungus has taken 4096-32767 steps toward maturity. (If a fungus completes all 32768 steps of growth, it matures into food in time for ants to see it as food the next turn.)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Collision Resolution&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As noted above, all decisions are executed at once, and collisions are resolved as they happen once surrounding ants have all their decisions executed. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Ants&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Collisions are an unavoidable consequence of multiple ants deciding to enter the same cell independently, or one or more ants entering a cell of an ant that decides not to move from it. Because ants may move only one cell at a time, up to 8 ants can move into the same cell at a time, and may run into an ant standing still in it. Queen-queen collisions are prevented by the rules restricting movement within the vicinity of other queens. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Collisions of ants are resolved depending on the ants involved. For the purposes of collision resolution, an ant is considered moving if and only if she spent her turn moving herself to a different cell. A newly spawned worker is treated like a moving worker. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A queen, if involved in a collision, is always the only survivor. She loses one food if she moved to a cell containing a laden worker that stayed still. As stated previously, a queen without food may not move to a cell already occupied by a laden worker, preventing the case where an unladen queen would step on a laden worker staying still. &lt;/li&gt;&#xA;&lt;li&gt;The collision of more than one moving laden ants in a worker-only collision results in all involved workers dying, leaving food behind in the cell. &lt;/li&gt;&#xA;&lt;li&gt;If a still laden worker is in a worker-only collision with no more than one moving laden worker, she survives, but loses her food if there was a moving laden worker in the collision. &lt;/li&gt;&#xA;&lt;li&gt;If a single ant in a worker-only collision held food and she moved, then she alone is the survivor. She loses the food she carried if she moved onto a worker ant that stood still. &lt;/li&gt;&#xA;&lt;li&gt;If none of ants in a worker-only collision held food, then they all die. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Food and Fungi&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Fungi do not stack. If multiple fungi are placed into a cell at once, collision resolution proceeds as if only one were placed in. Putting fungus in a cell already containing fungus will destroy the old fungus and create a new one. Fungus is destroyed if it shares its cell with any other object. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;A queen ant that stays or moves into a cell will pick up all contained and/or placed food in that cell. However, if a worker does the same, she can only pick up one of these pieces, and the rest are simply lost forever. If no ants are available to pick up the food, then only one food remains in the cell, with the rest lost forever. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Submission&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Each submission must be a Javascript class, with two methods holding special significance: a constructor, which is called once per game start to initialize each object before eachTurn is ever called, and an eachTurn method, which is called concurrently on all new ant views to determine what to do. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The constructor is given no arguments, while eachTurn is given to arguments, an integer corresponding to the current ant's state, and a 25-length view array. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;A possible submission skeleton is as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;class MyAnt {&#xA;&#xA;    constructor() {&#xA;        //TODO: You fill this in&#xA;    }&#xA;&#xA;    eachTurn(state, view) {&#xA;        //TODO: You also fill this in&#xA;    }&#xA;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The view array contains objects of the following form: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;    contents: Integer representing the contents of the cell, 0 for empty, 1 for food, 2 for fungus, 3 for ant&#xA;    details: Object giving details about the cell contents&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The details object yields further information about the object in the cell, and for each of the possible cell contents, it has the following forms: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Empty Cell:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;    color: Integer from 0-7 inclusive representing color of the cell&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Cell with Food:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{} // Yes, an empty object&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Cell with Fungus:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;    stage: Integer from 0-5 representing fungus stage, a very coarse indicator of age and time to maturity&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Cell with Ant:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;    queen: Boolean representing whether the ant is a queen&#xA;    friend: Boolean representing whether the ant is ally or enemy&#xA;    food: Integer representing the current food stores of that ant&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Each view object provided represents reflects the true state of a cell in the arena, albeit with incomplete information. The array itself always corresponds to a flattened 5*5 cell area of the arena centered on the ant, rotated 0, 90, 180, or 270 degrees such that: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For ants that have moved since spawning, either the cell to the top or to the top left correspond to the cell that the ant was in before the one currently inhabited&lt;/li&gt;&#xA;&lt;li&gt;For worker ants that have not moved since spawning, either the cell to the top or to the top left correspond to the cell that the queen occupied the turn she spawned the worker&lt;/li&gt;&#xA;&lt;li&gt;For queen ants that have not moved since spawning, the orientation is randomly determined at the start of the game and remains until the queen moves&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Indices in the view array correspond to cells in english reading order: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 0  1  2  3  4&#xA; 5  6  7  8  9&#xA;10 11 12 13 14&#xA;15 16 17 18 19&#xA;20 21 22 23 24&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There is no means of getting orientation information definitively either form inside or outside, and it must be inferred by current state and surroundings. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The output expected of the eachTurn method is an object with the following fields:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;    cell: (Mandatory) Integer in 0-8 inclusive, representing the cell to move to or to drop a payload to&#xA;    spawn: (Optional) If present, 0 for no payload, or 1, 2, or 3 for a payload of food, fungus, or worker, respectively&#xA;    state: (Optional) If present, an integer in 0-7 inclusive, representing the state to change to&#xA;    color: (Optional) If present, an integer in 0-7 inclusive, representing the color to color the old cell with&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The cell is interpreted with the same rotation as the view. Output cells 0-2 correspond to view indices 6-8, output cells 3-5 correspond to view indices 11-13, and output cells 6-8 correspond to view indices 16-18. If you compare this to the index chart above, this is in the same english reading order as the view array provided. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;No Side Effects&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Submissions may not make state modifications except to themselves, and should take care so that internal state modifications from calls to eachTurn are not visible from outside. Debugging submissions using input and output is allowed, but once submitted as an answer, they are forbidden. Attempting to use input or output in a submission will result in an error and disqualification until edited out. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Consistency&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Submissions are expected to behave deterministically, and the eachTurn function is expected to be pure, returing the same decision object for a given combination of state and view, regardless of how eachTurn was previously called or is currently being called. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Built-in functions may be called, if they are similarly externally pure. Math.abs() is fine, but Date.getTime() is not, for some examples. In particular, you are not allowed to call Math.random(). Supply your own pseudorandom numbers from constants, ant states, and ant views. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unless you have a good handle on javascript concurrency and are willing to stress-test the code for concurrency bugs, I recommend using well-tested concurrency patterns and performing only idempotent modifications of objects, or avoiding modification in the eachTurn object altogether. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Resource Limits&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each game submission starts with 1 second of reserve time. Each call to the constructor and eachTurn add 1 millisecond to the reserve time, then decrement from the reserve time the time they took to execute. Calls are memoized, and don't count against a submission if they are found in cache. If a submission exhausts its reserve time, it is disqualified. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Submissions are also limited to 64 Megabytes of memory at any one time. Unlike the time limit, this limit is not enforced automatically, but if a submission turns out to consistently hog memory during games it participates in, I will use a memory profiler to determine if this limit is exceeded. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;After Submission&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Disqualification&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To keep tournaments running smoothly, submissions are disqualified if their submission performs an invalid action. Disqualified submissions will be excluded from future games within a tournament after a disqualification, and will be kept out of future tournaments until the problem causing the disqualification is fixed. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following conditions are detected automatically, and therefore result in disqualification immediately: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Exhausting reserve time, as described above&lt;/li&gt;&#xA;&lt;li&gt;Returning an ill-formed or badly typed object from eachTurn&lt;/li&gt;&#xA;&lt;li&gt;Throwing an exception from the constructor or eachTurn&lt;/li&gt;&#xA;&lt;li&gt;Attempting to spawn food or workers with no food&lt;/li&gt;&#xA;&lt;li&gt;Attempting to spawn a worker with another worker&lt;/li&gt;&#xA;&lt;li&gt;Attempting to move a queen too close to another queen&lt;/li&gt;&#xA;&lt;li&gt;Attempting to move an unladen queen to a cell containing a laden worker&lt;/li&gt;&#xA;&lt;li&gt;Performing input/output from submitted answers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;It might seem harsh to disqualify for a single wrong move or bug, rather than consider it &quot;no move&quot; or ignoring it, but by insisting on correctness from entries, I can focus my efforts on keeping tournaments running quickly and smoothly. This is not supposed to be an additional challenge, so a reason is given for any disqualification, and an explanation given, with specific input and output given to help solve the disqualifying problem. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Multiple Answers and Editing&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You may provide multiple answers, provided that each one stands as a competitor in its own right, does not team up with other submissions, and at least in part is the product of your own substantive effort. You may take advantage of other submissions' weaknesses in an effort to achieve a higher score in comparison. Keep in mind that submissions come in, the chances of running into another particular submission will decrease. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may also edit your submissions to tune them however you choose. There are no guidelines about whether to create a new post or edit a currently existing post; the choice is yours. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you make a variation of another submission, remember to differentiate it, and if is derived from someone else's work, remeber to credit your sources. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;At the end of a game, submissions are ranked on how much food their queens held at the end of the game. Submissions which score exactly equal to each other simply share the average of the ranks they would have if they scored differently from each other. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Submissions with the highest average rank over a multitude of games win. For this challenge, I will give out working first places from tournaments as scores accumulate enough significance that Dunn's test indicates that there is a single distinct first place with at least 98% confidence. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Chat&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For questions and extended discussion of this challenge, please use the &lt;a href=&quot;https://chat.stackexchange.com/rooms/77728/the-formic-forest&quot;&gt;chat room&lt;/a&gt;. Comments on this post are likely to be cleared up from time to time, while chat room text will be kept around permanently. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want to contribute to the specification itself, see the github repository hosting the latest changes to this specification, &lt;a href=&quot;https://github.com/eaglgenes101/formic-forest-specification&quot; rel=&quot;nofollow noreferrer&quot;&gt;right here&lt;/a&gt;. &lt;/p&gt;&#xA;" OwnerUserId="43363" LastEditorUserId="43363" LastEditDate="2018-05-25T17:33:32.067" LastActivityDate="2018-05-25T17:33:32.067" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="16416" PostTypeId="2" ParentId="2140" CreationDate="2018-05-19T16:08:51.197" Score="0" Body="&lt;h1&gt;Tired Sumo Fighters&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a simple KOTH challenge in which you program a bot to push other bots out of a ring. Each round consists of two bots, and every bot will compete against each other bot at least 10 times. The reason that this KOTH is different from other similar KOTHs is that the bot only is very tired, so it only has a little bit of energy, and it cannot waste it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Moving&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your bot can move around the ring (An 11x11 square) using one of 10 commands:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;moveForward() //Moves forward&#xA;moveLeft() //Moves left&#xA;moveBackward() //Moves backward&#xA;moveRight() //Moves right&#xA;moveToward() //Moves toward enemy&#xA;moveAway() //Moves away from enemy&#xA;approachCenter() //Moves toward center of ring&#xA;approachEdge() //Moves away from center of ring&#xA;moveCounterClockwise() //Moves counter-clockwise around ring&#xA;moveClockwise() //Moves clockwise around ring&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;However, each movement takes energy. As a parameter, set the energy consumption (Defaults 1). If one bot stays still and the other runs into it, the moving bot pushes the still bot. If the bots run into each other, the bot who allotted more energy pushes. If there is a tie, the bots do not move.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Pushing&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Say that bot 1 and bot 2 are fighting. If bot 1 is at position (-4,5) and bot 2 is at (-2,5), there is one space between them. If each bot moves toward the opponent, the one who spent more energy moves forward. If there is a tie, the bots do not move. If a bot has any coordinate with an absolute value greater than 5, it loses. If any bot has energy under 0, it loses. It is possible to live with 0 energy, but you will be quickly pushed out of the ring. &lt;strong&gt;Every bot starts with 200 energy&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Detection&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To find your opponent or yourself, use these commands:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;locateSelf() //Returns as array [x,y]&#xA;locateOpponent() //Returns as array&#xA;energyLevel() //Returns your energy level&#xA;opponentEnergy() //Returns opponent's energy&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function sumoChamp() {&#xA;    if (energyLevel() &amp;gt; opponentEnergy()) {&#xA;        moveToward(5);&#xA;    } else {&#xA;        moveCounterClockwise(2);&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As you can see, a basic sumo bot takes just a few lines. However, a smart sumo bot would be able to overpower it, and a genius bot could even figure out its pattern and destroy it. You cannot build systems designed to target specific bots that have already been designed. To save information for later, store it in your bot's function, like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;sumoChamp.opponentResearch.avgEnergy = 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/75524&quot;&gt;Standard loopholes&lt;/a&gt; not allowed&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Entries can be in any language that supports functions and arrays, but all entries will be converted to JavaScript before the game starts.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2018-05-19T16:08:51.197" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16417" PostTypeId="2" ParentId="2140" CreationDate="2018-05-19T17:45:08.960" Score="0" Body="&lt;h1&gt;K-th largest element&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Find the k-th largest element of n elements in at worst O(n)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It shouldn't be affected by&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;element arranging&lt;/li&gt;&#xA;&lt;li&gt;element range&lt;/li&gt;&#xA;&lt;li&gt;RNG (if you use)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-05-21T01:33:22.983" LastActivityDate="2018-05-21T01:33:22.983" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="16420" PostTypeId="2" ParentId="2140" CreationDate="2018-05-20T15:26:37.243" Score="0" Body="&lt;h1&gt;Construct any Sporadic Simple Group&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There are 26 &lt;a href=&quot;https://en.wikipedia.org/wiki/Sporadic_group&quot; rel=&quot;nofollow noreferrer&quot;&gt;sporadic simple groups&lt;/a&gt;. Your task is to write a program which defines an operation isomorphic any of these groups.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;: Two symbols that represent elements of the group. You can choose how these symbols will be represented (characters, numbers etc.). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;: The result of the operation on the input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Taken as a whole, the operator defined must be isomorphic to one of the 26 sporadic groups.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;I don't actually know anything about group theory; I haven't even taken a course in it yet, just read some Wikipedia and thought this could be interesting. If it isn't trivially solvable, maybe someone could post it?&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="23550" LastActivityDate="2018-05-20T15:26:37.243" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16421" PostTypeId="1" AcceptedAnswerId="16422" CreationDate="2018-05-21T02:41:27.003" Score="2" ViewCount="245" Body="&lt;p&gt;I just got 2 back-to-back 30-minute suspensions for &quot;inappropriate content&quot; for using the F-word. I usually don't use that word that often but for whatever reason people felt the need to bad me for it. The two messages were approximately:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;fireworks are legitimately an invention from hell. people are setting off fireworks and it's so f***ing loud I couldn't sleep if I wanted to&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;what the f*** I just got flagged for swearing?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't get it...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=44526414#44526414&quot;&gt;I&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=44461455#44461455&quot;&gt;r&lt;/a&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=44172340#44172340&quot;&gt;e&lt;/a&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=44118045#44118045&quot;&gt;a&lt;/a&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=44048223#44048223&quot;&gt;l&lt;/a&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=43785128#43785128&quot;&gt;l&lt;/a&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=43629598#43629598&quot;&gt;y&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=43291696#43291696&quot;&gt;d&lt;/a&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=43227945#43227945&quot;&gt;o&lt;/a&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=43135921#43135921&quot;&gt;n&lt;/a&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=42926635#42926635&quot;&gt;'&lt;/a&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=42868083#42868083&quot;&gt;t&lt;/a&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=42841237#42841237&quot;&gt;.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yes, every character in that is a link.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unless they have something against me insulting fireworks? I don't know. I know an hour isn't really much, but I don't want this to stack to me becoming another one of the year-banned people just for using a word that has been used over 600 times in our chat room with no problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I apologize for my language choice; I'll try to watch it better, I was just rather annoyed at the time and didn't think it would be a problem given the 613 other messages containing the word. However, I do not believe I deserved the 2x30 minute suspensions and I also don't want excessive punishment (week-/month-/year-bans) for something other people never got punished for.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="61384" LastEditDate="2018-05-21T04:25:49.553" LastActivityDate="2018-05-21T04:55:51.883" Title="Chat Suspensions for Swearing" Tags="|support|chat|" AnswerCount="2" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="16422" PostTypeId="2" ParentId="16421" CreationDate="2018-05-21T03:03:37.517" Score="10" Body="&lt;p&gt;Different people find different things offensive. While I personally don't mind some mild swearing, others might. Remember that it takes only six users (or less, if one is a mod) out of all SE users who see the first flag to get you a 30 minute suspension.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, while I wouldn't have flagged the first message, I'm not so sure about the second one. You spelled out OMFG, which is bound to offend at least &lt;em&gt;some&lt;/em&gt; people.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, swearing as a reaction to the first flag won't gather you any sympathy from flag reviewers. &lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2018-05-21T03:03:37.517" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="16423" PostTypeId="2" ParentId="16421" CreationDate="2018-05-21T04:55:51.883" Score="-1" Body="&lt;h2&gt;If this is a rule, it needs to be enforced more consistently&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I don't think it should be a rule anyways, at least not for chat. I feel that swearing itself is fine, as long as you &lt;a href=&quot;https://github.com/TheNineteenthByte/The-Nineteenth-Byte/blob/master/chatiquette.md#be-nice&quot; rel=&quot;nofollow noreferrer&quot;&gt;Be Nice&lt;/a&gt;, &lt;a href=&quot;https://github.com/TheNineteenthByte/The-Nineteenth-Byte/blob/master/chatiquette.md#dont-be-disruptive&quot; rel=&quot;nofollow noreferrer&quot;&gt;Don't Be Disruptive&lt;/a&gt;, and &lt;a href=&quot;https://github.com/TheNineteenthByte/The-Nineteenth-Byte/blob/master/chatiquette.md#dont-make-noise&quot; rel=&quot;nofollow noreferrer&quot;&gt;Don't Make Noise&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Were you Being Nice? You weren't insulting anybody in particular, just expressing frustration. The section says not to use &quot;inappropriate language,&quot; but &lt;em&gt;inappropriate&lt;/em&gt; means different things to different people: I personally think that this should encompass only offensive racist and/or bigoted words rather than merely a curse.&lt;/li&gt;&#xA;&lt;li&gt;Were you Being Disruptive? I don't think you were &quot;doing anything that prevents, impedes, or discourages other users from using The Nineteenth Byte for its intended purpose.&quot; &lt;em&gt;I&lt;/em&gt; certainly wouldn't have felt prevented, impeded, or discouraged by your comment.&lt;/li&gt;&#xA;&lt;li&gt;Were you Making Noise? &lt;em&gt;Perhaps&lt;/em&gt;. I'm not sure how relevant your message might be to the other users of the room.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Ultimately, a user's impression of what's appropriate for a chat room comes from what they observe in the chatroom, not just Chatiquette. Unless we plan on deleting all 613 messages now, users will continue to take that as an example of what is appropriate. So we need to either delete those messages as to not set an example or just remove that rule.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In any case, &lt;a href=&quot;https://github.com/TheNineteenthByte/The-Nineteenth-Byte/blob/master/chatiquette.md#dont-use-chat-flags-for-chatiquette-violations&quot; rel=&quot;nofollow noreferrer&quot;&gt;chat flags shouldn't be used for Chatiquette violations&lt;/a&gt;. They are broadcast to the entire SE network, including to other sites with users and moderators that may not understand our room culture. Those messages shouldn't have been flagged, and the users who flagged them are in violation of the Chatiquette.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ideally, you should have been politely warned that you were in violation of the Chatiquette, obviating the need for the second message.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastActivityDate="2018-05-21T04:55:51.883" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16428" PostTypeId="2" ParentId="2140" CreationDate="2018-05-22T20:12:10.250" Score="0" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Meta&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Polyomino detection itself is a duplicate. And there was also a very similar question concerning simple connectedness of a tiling pattern. So I won't submit.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Holey polyomino&lt;/h1&gt;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Polyomino&quot; rel=&quot;nofollow noreferrer&quot;&gt;polyomino&lt;/a&gt; is a plane polygon consisting of equally-sized squares connected at edges. A polyomino might have a hole if it contains a region with a square on all four sides.&lt;/p&gt;&#xA;&lt;h1&gt;The challenge&lt;/h1&gt;&#xA;&lt;p&gt;Determine if a collection of squares is a polyomino with a hole.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;The input will be a matrix of 0s and 1s, where a 1 indicates a square in that position. For example, the top left nonomino in the picture above could be:&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;A truthy or falsey value for whether the input represents a polynomino with a hole.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;Arrays of rows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[1, 1, 1], [1, 0, 1], [1, 1, 1], [0, 1, 0]] =&amp;gt; TRUE&#xA;&#xA;[[1, 1, 1, 0], [1, 0, 1, 0], [1, 1, 1, 0], [0, 1, 0, 1]] =&amp;gt; FALSE&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="79980" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-05-23T19:01:42.217" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="16431" PostTypeId="2" ParentId="2140" CreationDate="2018-05-24T08:55:25.943" Score="1" Body="&lt;h1&gt;What a hat at wheat!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a word, remove letters one at a time until nothing is left. Output the list of steps.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; wheat&#xA; what or heat&#xA; hat or eat&#xA; at or ha&#xA; a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;All words must exist in a word list, but this list may be provided via any means, such as in a file with a specific name, or in a global variable, or built-in to the language, as long as it's a list of words and not some custom data structure. You can however require that the list is pre-sorted in a specific order (in which case you should also provide a suitable sort function, which can be in any language).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there is more than one solution then you can return any one or all solutions. If there are no solutions then you should return a falsy value. You can assume that the input is taken from the word list. You don't need to return the original input or the empty string as part of the solution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2018-05-24T08:55:25.943" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16432" PostTypeId="2" ParentId="2140" CreationDate="2018-05-24T09:27:54.617" Score="0" Body="&lt;h1&gt;Go shopping!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You're shopping for four specific items. Your town contains fifteen shopping malls. Unfortunately you can't always find the item you want at the nearest mall. You want see whether you can purchase the four items on a single shopping trip. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For each item, there is a list of malls (given as coordinates) where the item can be purchased. Some malls however will only sell you a given item if you visit that mall first. Furthermore, the entrances and exits to the malls are badly placed and you can only visit malls in increasing order of coordinates.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Item 1 can be purchased at mall (7, 2) but only if you visit that mall first. It can also be purchased at mall (3, 1).&lt;/li&gt;&#xA;&lt;li&gt;Item 2 can be purchased at mall (7, 1).&lt;/li&gt;&#xA;&lt;li&gt;Item 3 can be purchased at mall (3, 2), (4, 2), (5, 2) or (6, 2).&lt;/li&gt;&#xA;&lt;li&gt;Item 4 can be purchased at mall (7, 2).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;With this scenario, it's not possible to purchase both items 2 and 3 in one trip.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Item 1 can be purchased at mall (3, 3), (4, 3), (5, 3), (6, 3).&lt;/li&gt;&#xA;&lt;li&gt;Item 2 can be purchased at mall (3, 2), (4, 2), (3, 3) or (4, 3).&lt;/li&gt;&#xA;&lt;li&gt;Item 3 can be purchased at mall (6, 1), (7, 1), (6, 2) or (7, 2).&lt;/li&gt;&#xA;&lt;li&gt;Item 4 can be purchased at mall (4, 1), (5, 1), (6, 1) or (7, 1), but only if you visit that mall first.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;In this secnario, you would visit mall (4, 1), (4, 2), (6, 2), and then (6, 3), and successfully purchase all four items on a single trip.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2018-05-24T09:27:54.617" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="16435" PostTypeId="2" ParentId="2140" CreationDate="2018-05-24T21:12:00.860" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hexagonal-grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hexagonal-grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;hexagonal-grid&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Formic Functions 2: Hierarchies&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;     &lt;strong&gt;&lt;a href=&quot;http://placeholder&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Watch live&quot;&gt;Watch live&lt;/a&gt; | &lt;a href=&quot;http://placeholder&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Active answers&quot;&gt;Active answers&lt;/a&gt; | &lt;a href=&quot;http://placeholder&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Add new answer&quot;&gt;Add new answer&lt;/a&gt; | &lt;a href=&quot;https://chat.stackexchange.com/rooms/77964/formic-functions-2-hierarchies&quot; title=&quot;Chat room&quot;&gt;Chat room&lt;/a&gt; | &lt;a href=&quot;http://placeholder&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Source code&quot;&gt;Source code&lt;/a&gt; | &lt;a href=&quot;http://placeholder&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Leaderboard&quot;&gt;Leaderboard&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;               &lt;em&gt;This is an open-ended challenge. New answers and updates are always welcome.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We've seen the territorial &lt;a href=&quot;https://codegolf.stackexchange.com/questions/135102/formic-functions-ant-queen-of-the-hill-contest&quot; title=&quot;Formic Functions - Ant Queen of the Hill Contest&quot;&gt;highland ants&lt;/a&gt; wander the lands in search of food. There have also been talks of aggressive &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/16415/74965&quot; title=&quot;The Formic Forest - Ant QotH Contest&quot;&gt;forest ants&lt;/a&gt; lurking down below whilst feasting on fungi. These ants, however, are unlike any you've seen before. Collecting food is their goal, as always, but &lt;strong&gt;colonies don't need a queen&lt;/strong&gt; - all ants of this subfamily are capable of creating offspring. There's a catch, though. New ants have less strength than their parent, unless the parent ant spends a large amount of food on them. Ants are capable of killing others weaker than them, and weaker ants are worth less, so your ants need to make careful choices.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;http://placeholder&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Watch live&quot;&gt;Watching the game&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Because this competition is made in JavaScript, you can see what other players have made already directly in your browser. Just click on one of the links above - you'll figure out the rest.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/77964/formic-functions-2-hierarchies&quot; title=&quot;Chat room&quot;&gt;Chat&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;To keep the comment section clean, I highly encourage you to use the dedicated chat room for questions and discussion.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;http://placeholder&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Leaderboard&quot;&gt;Leaderboard&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;No official tournaments available yet.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Screenshots&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Here are a couple of images taken at the end of a game that should entice you:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;No screenshots available yet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can look at more simply by running games in your browser. The controller also allows you to zoom in so you can track the ants' decisions that result in the large-scale patterns you ultimately see.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Definitions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A value range is indicated by a number followed by two dots and another number. &quot;0..7&quot; means &quot;between 0 and 7, inclusive&quot;. A different type of range is indicated by a number followed by a plus sign. &quot;1024+&quot; means &quot;greater than or equal to 1024&quot;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Programming&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to provide a JavaScript class that implements a &lt;code&gt;getAction(view)&lt;/code&gt; function and optionally a constructor. All code provided by you will be run under &lt;a href=&quot;https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Strict_mode&quot; rel=&quot;nofollow noreferrer&quot;&gt;strict mode&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The constructor is called with no arguments. It must take no more than one second to run. It must be side-effect free and must consistently result in an identical object after every run.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;getAction(view)&lt;/code&gt; function (henceforth known as the ant function) is called like this: &lt;code&gt;yourConstructedObject.getAction(someViewArray);&lt;/code&gt;. It must also be side-effect free and must consistently return an object, and provide the same output every time if provided the same input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the start of every game, your ant function is granted 1 second of reserve time. It is also granted an additional 10 milliseconds of time every time it is called. Time measurement starts right before the function call and ends upon return. That time is then taken away from the reserve time. Your function must not run out of the reserve time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The constructed object and any temporary data combined must not consume more than 64 MB of memory at any time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's a template for you to fill in:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;class Entry { // TODO: Change the &quot;Entry&quot; to whatever you want, preferably your entry name. Remember that this is a JavaScript class name, so you can't use some characters.&#xA;  constructor() {&#xA;    // TODO: Optionally fill this in.&#xA;  }&#xA;&#xA;  getAction(view) {&#xA;    // TODO: Fill this in.&#xA;  }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Arena&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The arena is a toroidal (edge wrapping) grid of hexagonal cells arranged in a rhombus of side length 1500. Initially, all cells have the color 0 and 0.1% have food placed on them, for a total of 2250 pieces of food. Up to 12 entries are randomly chosen every game and have their corresponding ants (one per entry) spawned in random locations, with no more than one ant occupying any cell. The initial turn order of ants is also randomized.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Game&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The game lasts 32768 turns, which are processed sequentially. Every turn, in an unchanging order, each ant has its corresponding function called with the local state of the arena passed as an argument. &lt;em&gt;In other words, your ant function is called separately for every ant you control.&lt;/em&gt; The action chosen by the ant function is then taken immediately - other ants see the arena changes even during the same turn.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Ants&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;State&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each ant carries the following properties with them:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Position:&lt;/strong&gt; Implementation-defined.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Ants do not have access to their global position.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Tier:&lt;/strong&gt; An integer representing the tier of an ant.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Equal to 0 for all ants not spawned by other ants.&lt;/li&gt;&#xA;&lt;li&gt;Doesn't change over an ant's lifespan.&lt;/li&gt;&#xA;&lt;li&gt;The lower its tier, the less valuable an ant is.&lt;/li&gt;&#xA;&lt;li&gt;There is no theoretical limit on how high or low tier can be.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Age:&lt;/strong&gt; An integer representing how old an ant is.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Initially 0 for all ants.&lt;/li&gt;&#xA;&lt;li&gt;After every action an ant takes its age goes up by one.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Food:&lt;/strong&gt; An integer representing the amount of food an ant is carrying.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Initially 0 for all ants.&lt;/li&gt;&#xA;&lt;li&gt;An ant may carry an unlimited amount of food.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Memory:&lt;/strong&gt; An integer in the range 0..15 representing the memory of an ant.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Initially equal to 0 for all ants not spawned by other ants.&lt;/li&gt;&#xA;&lt;li&gt;An ant may change it as part of any action.&lt;/li&gt;&#xA;&lt;li&gt;Holds no meaning for the controller.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Owner:&lt;/strong&gt; Implementation-defined.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Allows ants to see whether another one is a friend or not.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Sight&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each ant sees 6 cells in its neighborhood, as well as the cell it is currently occupying. Each cell contains the following properties:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;code&gt;color&lt;/code&gt;:&lt;/strong&gt; An integer in the range 0..7 representing the current color of a cell.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;code&gt;food&lt;/code&gt;:&lt;/strong&gt; A boolean representing whether or not a piece of food is present on a cell.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;code&gt;ant&lt;/code&gt;:&lt;/strong&gt; An object if an ant is present on a cell, &lt;code&gt;undefined&lt;/code&gt; otherwise. If present, the object has the following properties:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;code&gt;tier&lt;/code&gt;:&lt;/strong&gt; Maps to &lt;strong&gt;Tier&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;code&gt;age&lt;/code&gt;:&lt;/strong&gt; An integer in the range 0..3 representing an ant's age on a logarithmic scale. 0 actual age maps to 0, 1..31 actual age maps to 1, 32..1023 actual age maps to 2 and 1024+ maps to 4. &lt;strong&gt;[Sandbox note: I'm torn about whether or not the ants should have access to this information.]&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;[Sandbox] Alternative for or complement to &lt;code&gt;age&lt;/code&gt;: &lt;code&gt;older&lt;/code&gt;:&lt;/strong&gt; A boolean representing whether or not an ant's age is higher that of the currently active ant.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;code&gt;food&lt;/code&gt;:&lt;/strong&gt; An integer in the range 0..3 representing the amount of stored food by an ant on a logarithmic scale. 0 actual food maps to 0, 1..3 actual food maps to 1, 4..15 actual food maps to 2 and 16+ actual food maps to 3.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;code&gt;memory&lt;/code&gt;:&lt;/strong&gt; Maps to &lt;strong&gt;Memory&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;code&gt;friend&lt;/code&gt;:&lt;/strong&gt; A boolean representing whether or not an ant is under control of the same entry as the currently active ant.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Every turn sight is passed to your ant function as an array of 7 objects, arranged in this order:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 0 1&#xA;5 6 2&#xA; 4 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The view is randomly rotated by a multiple of 60 degrees every time your ant function is called. This means that it's impossible to extract a consistent sense of direction without clever use of the environment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Accessing one's own state is done by retrieving the ant object of the 7&lt;sup&gt;th&lt;/sup&gt; element of the array, like this: &lt;code&gt;const me = view[6].ant;&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Actions&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each ant must perform an action every turn. The possible actions are as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Move:&lt;/strong&gt; Move to the desired cell.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Format: &lt;code&gt;{cell: 0..6, action: 0}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;When moving onto a cell with food on it, an ant automatically picks up the piece of food present.&lt;/li&gt;&#xA;&lt;li&gt;When moving onto a cell with an ant on it, of the two ants only one remains. If the still ant's &lt;code&gt;tier&lt;/code&gt; value is lower than that of the moving ant, then the still ant dies and is permanently removed from the game. Otherwise, the unfortunate fate awaits the moving ant instead. In either case, the remaining ant gains all the food of the ant that died and one more.&lt;/li&gt;&#xA;&lt;li&gt;Staying still is a valid action and may hold merit in certain situations.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Paint:&lt;/strong&gt; Change the color of the desired cell to the desired color.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Format: &lt;code&gt;{cell: 0..6, action: 1, color: 0..7}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Changing the color of a cell to the same one is a valid action.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Place food:&lt;/strong&gt; Put a piece of food onto the desired cell.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Format: &lt;code&gt;{cell: 0..6, action: 2}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Placing a piece of food onto a cell with an ant on it results in that ant immediately picking it up.&lt;/li&gt;&#xA;&lt;li&gt;Placing food costs food. An ant may only place a piece of food if it has at least one food stored, and one food is taken away from it.&lt;/li&gt;&#xA;&lt;li&gt;Placing food onto own cell is a valid action, but placing food onto a cell with a piece of food already on it is &lt;em&gt;not&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Spawn:&lt;/strong&gt; Create a new ant under control of the same entry on the desired cell.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Format: &lt;code&gt;{cell: 0..6, action: 3, tier: -1..+1, state: 0..15}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;A parent ant must choose to spend 1, 4 or 16 food on the new ant by specifying a &lt;code&gt;tier&lt;/code&gt; equal to -1, 0 or +1 respectively.&lt;/li&gt;&#xA;&lt;li&gt;A parent ant may only spawn an ant of the desired tier if it has the necessary amount of food to do so, and that amount is taken away from it.&lt;/li&gt;&#xA;&lt;li&gt;Spawning results in an ant of a tier equal to that of its parent plus the &lt;code&gt;tier&lt;/code&gt; value specified.&lt;/li&gt;&#xA;&lt;li&gt;A parent ant must choose the initial memory of the new ant by specifying a &lt;code&gt;state&lt;/code&gt;. &lt;strong&gt;[Sandbox note: I'm considering not letting parents set the initial memory of offspring.]&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;The new ant is inserted into the turn order right before its parent.&lt;/li&gt;&#xA;&lt;li&gt;Spawning an ant counts as movement for the new ant, and is resolved as such.&lt;/li&gt;&#xA;&lt;li&gt;Spawning an ant onto own cell is a valid action and may hold merit in certain situations.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Memorize:&lt;/strong&gt; Replace the currently active ant's memory with the desired number.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Format: &lt;code&gt;{memory: 0..15}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Memorization is not an action itself. It must be appended to one of the four previously mentioned actions.&lt;/li&gt;&#xA;&lt;li&gt;An ant may choose to leave this field undefined. No memory change occurs then. &lt;strong&gt;[Sandbox note: Torn about this as well.]&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Format refers to the JavaScript object that must be returned by your ant function to perform a specific action.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example outputs:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;{cell: 0, action: 0} // Move to cell 0.&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{cell: 6, action: 0} // Do nothing.&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{cell: 6, action: 1, color: 0} // Set own cell color to 0.&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{cell: 3, action: 2} // Put a piece of food onto cell 3. Invalid if there is a piece of food on cell 3.&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{cell: 2, action: 3, tier: -1, state: 3} // Spawn an ant 1 tier lower than that of your own with initial memory equal to 3 on cell 2 at the cost of 1 food. Invalid if you have no food.&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{cell: 5, action: 3, tier: +1, state: 11, memory: 14} // Spawn an ant 1 tier higher than that of your own with initial memory equal to 11 on cell 5 at the cost of 16 food whilst committing 14 to memory. Invalid if you have less than 16 food.&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{cell: 6, action: 3, tier: 0, state: 0} // Spawn an ant with tier equal to that of your own with initial memory equal to 0 on your own cell at the cost of 4 food. A conflict occurs and the newly spawned ant dies, giving you a piece of food. Effectively, ou lost 3 pieces of food. Invalid if you have less than 4 food.&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{cell: 6, action: 3, tier: +1, state: 0} // Spawn an ant 1 tier higher than that of your own with initial memory equal to 0 on your own cell at the cost of 16 food. A conflict occurs and you die, giving the newly spawned ant a piece of food (and any additional food you might've had). Effectively, you upgraded yourself at the cost of 15 food. Invalid if you have less than 16 food.&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{cell: 3, action: 0, color: 5, test: true, memory: 1} // Move to cell 3 whilst committing 1 to memory. Values of&lt;/code&gt;color&lt;code&gt;and&lt;/code&gt;test&lt;code&gt;are irrelevant. You may choose to include unrelated properties - they are simply ignored.&lt;/code&gt; &lt;strong&gt;[Sandbox note: Maybe the controller shouldn't allow &lt;code&gt;color&lt;/code&gt; in this case? This looks like it might be a good breeding ground for hard-to-detect bugs.]&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Example invalid outputs &lt;em&gt;(not exhaustive)&lt;/em&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;{cell: 7, action: 0} // Error: Value of &quot;cell&quot; outside required range 0..6.&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{cell: 3} // Error: &quot;action&quot; left undefined.&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{action: 1, color: 4} // Error: &quot;cell&quot; left undefined.&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{cell: 4, action: 3, tier: -1} // Error: &quot;state&quot; left undefined.&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;At the end of each game, every entry participating in that game is evaluated according to this formula:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://latex.codecogs.com/gif.latex?%5Csum_%7Bi%3D1%7D%5E%7Bn%7D2%5E%7BT_i%7D&amp;plus;2%5E%7BT_i-1%7D*F_i&quot; alt=&quot;formula&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;n is the number of ants belonging to the entry currently being evaluated&lt;br&gt;&#xA;T&lt;sub&gt;i&lt;/sub&gt; is the tier of the i&lt;sup&gt;th&lt;/sup&gt; ant belonging to the entry currently being evaluated&lt;br&gt;&#xA;F&lt;sub&gt;i&lt;/sub&gt; is the amount of food the i&lt;sup&gt;th&lt;/sup&gt; ant belonging to the entry currently being evaluated is holding&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or as pseudocode:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;var evaluation = 0;&#xA;for (int i = 0; i &amp;lt; entry.ants.count; i++) {&#xA;  var ant = entry.ants[i];&#xA;  evaluation += Math.Pow(2, ant.tier) + Math.Pow(2, ant.tier - 1) * ant.food;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;[Sandbox note: Should I count food as score or not?]&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The final score of each entry is equal to the amount of entries whose evaluation was lower than that of the currently considered entry. This means that the highest score an entry can get is 11.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Tournaments&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A tournament is nothing more than a series of individual games. At any point of a tournament the score of each entry is equal to the average of all of its scores.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Official tournaments&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Official tournaments will be run by me on the latest version of Chrome on my personal computer, which at the time of writing is an AMD FX-8350, every time a new entry is posted or an existing one receives a meaningful edit. The leaderboard will be updated once the 1&lt;sup&gt;st&lt;/sup&gt; place becomes consistent between 6 subsets of played games (which gives a probability of 96.875% that the first place won't change).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As stated before, there is no permanent winner. This means that no checkmark will be awarded to any answer, ever. I will continue to run new tournaments for as long as is practical.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Submissions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Each submission must follow this general format:&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;&lt;em&gt;Entry Title&lt;/em&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;[Optional text and pictures]&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;&lt;code&gt;Code block with your JavaScript class&lt;/code&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;[Optional text, pictures and code blocks]&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Not adhering to the above format may result in the submission not being properly picked up by the controller.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Explanations and pictures are highly encouraged, though not necessary. Making your entry pretty and well-documented will entice me (and probably a lot of people) to upvote it.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Disqualification&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your entry will be disqualified if it is found to not adhere to the specification correctly. Most of the time problems will be caught by the controller and reported, but some rules can't be checked programmatically, so they'll be enforced by hand. I reserve the right to disqualify an entry manually if it breaks the rules or if I subjectively believe it has not been made with fair competition in mind. I hope I haven't left any loopholes (and therefore won't have to exercise this power), but if I did then this rule prevents them from potentially ruining the entire challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Disqualification during a game results in all of your ants being immediately and permanently removed from the turn order. Disqualification during a tournament invalidates all games in which your entry has participated and terminates the active game (as it would've been invalid anyway). Disqualification during an official tournament, aside from having the effects of a regular tournament disqualification, prohibits your entry from taking part in any future official tournament until meaningfully edited.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is not supposed to be an additional challenge - helpful error messages along with your ant function's output and the input that disqualified it will be attached to the disqualification notice. I will also paste these messages into a comment informing you of a disqualification should your entry be disqualified during an official tournament.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Multiple entries and editing&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You may provide multiple entries, provided that they do not team up against the others. As long as each entry is working solely towards its own victory, you are permitted to tailor your strategy to take advantage of others' weaknesses. You may also edit your answers whenever you choose. It is up to you whether you post a new entry or edit an existing one; just don't flood the game with nearly identical variations. If you make a variation of another person's entry, remember to give them credit by linking to their entry from your own.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Example entries&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Randant&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This entry demonstrates the minimal amount of code needed for something to be considered valid. It returns the same output regardless of input.&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;class Randant {&#xA;  getAction() {&#xA;    return {cell: 0, action: 0};&#xA;  }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Because the orientation is random every time, Randant will perform a random walk instead of going straight.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Despite being very simple, this is a perfectly valid submission. It won't ever get disqualified either, because moving is guaranteed to be a valid action.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See Smart Randant on how one could go about improving this entry.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Smart Randant&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This entry demonstrates basic mechanics that ought to be commonly used between more advanced entries. It is an improvement of Randant's general design. It depends on input this time around.&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;class SmartRandant {&#xA;  getAction(view) {&#xA;    const me = view[6].ant; // Get data about myself&#xA;&#xA;    function wrap(number, cycleLength = 6, negativeSafety = 1) { // Defining functions inside the getAction(view) function is fine&#xA;      return (number + cycleLength * negativeSafety) % cycleLength; // Wraps numbers (allows for cyclic array access)&#xA;    }&#xA;&#xA;    function stronger(a, b) { // Checks if ant a is stronger than ant b&#xA;      return a &amp;amp;&amp;amp; (!b || a.tier &amp;gt; b.tier);&#xA;    }&#xA;&#xA;    view.forEach((cell, i) =&amp;gt; { // Modifying the view is perfectly acceptable (here we do it to store the index alongside each cell)&#xA;      cell.index = i;&#xA;    });&#xA;&#xA;    const dirs = view.slice(0, 6);&#xA;    const safe = dirs.filter((cell, i) =&amp;gt; !stronger(dirs[cycle(i - 1)].ant, me) &amp;amp;&amp;amp; !stronger(dirs[cycle(i + 1)].ant, me) &amp;amp;&amp;amp; stronger(me, cell.ant)); // Create an array of cells that are safe to move to&#xA;    // TODO: Also consider attacking other ants that are at the same strength level as us by spawning a stronger ant on their face&#xA;&#xA;    if (safe.length) { // If we've got some safe spaces to move to...&#xA;      const victims = safe.filter((cell) =&amp;gt; cell.ant &amp;amp;&amp;amp; stronger(me, cell.ant)); // Prioritize killing other ants&#xA;&#xA;      if (victims.length) { // If we've got someone to kill...&#xA;        const target = victims.reduce((prev, next) =&amp;gt; stronger(next.ant, prev.ant) ? next : prev); // Find the strongest victim and target it&#xA;&#xA;        return {cell: target.index, action: 0};&#xA;      }&#xA;&#xA;      const food = safe.filter((cell) =&amp;gt; cell.food); // Otherwise prioritize grabbing food&#xA;&#xA;      if (food.length) { // If we've got some food to grab...&#xA;        return {cell: food[0].index, action: 0} // Just grab any piece&#xA;        // TODO: Grab the piece that has the most pieces of food next to it&#xA;      }&#xA;&#xA;      return {cell: safe[0].index, action: 0} // Otherwise move to any safe cell&#xA;    }&#xA;&#xA;    return {cell: 6, action: 0}; // If we don't have a safe cell to move to, just stay still and hope for the best&#xA;    // TODO: Handle this situation better&#xA;  }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As you can see, Smart Randant is a lot smarter than his counterpart. Smart Randant dropped his suicidal tendencies by finding safe cells before moving. Note that despite not being suicidal, he may still be killed by particularly cunning entries. He's also more aggressive - he'll gladly attack opponents weaker than him and will grab nearby food. Finally, if he's got anywhere to go, he will go there. Otherwise, he'll just stay still, hoping for the best.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may have also noticed that Smart Randant still has a lot to learn. You can edit your entries to your heart's content, so W.I.P. submissions are allowed, or even encouraged.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Straighter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This entry demonstrates smart usage of the environment for the purpose of fighting randomness. It travels in a straight line, leaving behind a path. It also utilizes and expands Smart Randant's basic framework.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[Placeholder]&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://chat.stackexchange.com/rooms/77964/formic-functions-2-hierarchies&quot; title=&quot;Chat room&quot;&gt;chat room&lt;/a&gt; is active already and is a better place for extended discussion than the comment section. I'd also love to dicuss some preliminary ideas for potential strategies to be used in future entries (though let's try to restrict this dicussion to nothing more than interesting isolated systems rather than full submissions - I'm not particularly interested in posting a nearly-solved challenge).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Most links are broken for now. The controller, for example, doesn't exist yet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm aware that I'll have to make (or find) a custom number library that can handle nearly arbitrarily small and large powers of 2 for scoring (I've managed to design a system which spawns progressively less valuable ants every 2 turns at no cost, leading to a score equal to about &lt;code&gt;1 + 2e-16384&lt;/code&gt;).&lt;/p&gt;&#xA;" OwnerUserId="74965" LastEditorUserId="74965" LastEditDate="2018-05-29T12:52:52.730" LastActivityDate="2018-05-29T12:52:52.730" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16436" PostTypeId="2" ParentId="2140" CreationDate="2018-05-25T10:12:57.997" Score="2" Body="&lt;h1&gt;Is it a table?&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Take an bitmap (in .bmp, 2D array, string containing line break, etc.), check whether it's a table, i.e. the outer border is a rectangle, and each separated (edge-connected) empty part in it is a rectangle.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Equivalently, each space area, including the outside one, has exactly 4 edges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can't assume there is or is no space outside of the table.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;True samples:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;############# &#xA;#           #&#xA;#           #&#xA;#############&#xA;#     #     #&#xA;#     #     #&#xA;#############&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;###########&#xA;#         #&#xA;#         #&#xA;#         #&#xA;###########&#xA;#   #     #&#xA;#####     #&#xA;# # #######&#xA;# # #     #&#xA;###########&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;###########&#xA;###########&#xA;##   #   ##&#xA;##   #   ##&#xA;##### #####&#xA;######   ##&#xA;######   ##&#xA;###########&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that in this test case the smallest space area (with 1 space) is a rectangle, although it doesn't have a rectangular border with &lt;code&gt;#&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;False Samples:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;###########&#xA;#     #   #&#xA;#     #   #&#xA;#     #####&#xA;#         #&#xA;###########&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In this test case the lower-left empty region is a concave hexagon.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;###########&#xA;#    #     #&#xA;#    #     #&#xA;############&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The outer border is not a rectangle.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;############&#xA;#          #&#xA;#          #&#xA;#   ####   #&#xA;#   #  #   #&#xA;#   ####   #&#xA;#          #&#xA;############&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The outer empty region has a &quot;hole&quot; inside.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Winning criteria&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Shortest code win.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="69850" LastEditDate="2018-05-29T04:59:16.013" LastActivityDate="2018-05-29T04:59:16.013" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="16439" PostTypeId="2" ParentId="2140" CreationDate="2018-05-26T22:52:46.790" Score="0" Body="&lt;h1&gt;Softcode&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Softcoding&lt;/strong&gt; is an anti-pattern defined by “&lt;em&gt;the practice of removing ‘things that should be in source code’ from source code and placing them in some external resource&lt;/em&gt;”, which usually are config files, database entries, or both. “&lt;em&gt;At the extreme end, soft-coded programs develop their own poorly designed and implemented scripting languages&lt;/em&gt;”, as can be seen by one of the most egregious examples of the practice, the Enterprise Rules Engine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thus, programmers who fall to the habit of softcoding, after tons of work, find themselves at the very point they were starting from: they have developed “&lt;em&gt;some sort of &lt;strong&gt;CO&lt;/strong&gt;mmon &lt;strong&gt;B&lt;/strong&gt;usiness-&lt;strong&gt;O&lt;/strong&gt;riented &lt;strong&gt;L&lt;/strong&gt;anguage that’s generic enough to code any rule&lt;/em&gt;”. But unfortunately for them, there already is such a thing. “&lt;em&gt;It’s called C++. And Java. And C#. And Basic. And, dare I say, COBOL.&lt;/em&gt;”&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the sources of the above quotations are more information of the practise, see: &lt;a href=&quot;http://thedailywtf.com/articles/Soft_Coding&quot; rel=&quot;nofollow noreferrer&quot;&gt;Soft Coding on The Daily WTF&lt;/a&gt;, &lt;a href=&quot;https://en.wikipedia.org/wiki/Softcoding&quot; rel=&quot;nofollow noreferrer&quot;&gt;Softcoding on Wikipedia&lt;/a&gt; and &lt;a href=&quot;http://thedailywtf.com/articles/The_Enterprise_Rules_Engine&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Enterprise Rules Engine on The Daily WTF&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Softcode&lt;/strong&gt;! Make an actual, Turing-complete language that will reside in config files!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More specifically, you should write a compiler / interpreter / anything in between that will define a Turing-complete programming language, whose every valid source code will also be a valid JSON file. &lt;sup&gt;(The reason why JSON has been chosen is the simplicity of syntax and wide avalability of JSON parsers, so that you won't have to write a parser yourself.)&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input/output format is up to you.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The catch&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Not your interpreter code should be golfed. &lt;strong&gt;Your JSON code should be golfed&lt;/strong&gt;. Or, more specifically, golfable. That is: you will have to present a JSON file that, if fed to your program, will solve a given golfing challenge and will have smallest size out of all JSON files presented here. This will determine the winner; the size of the interpreter code is not relevant.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Technical details&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, given how this challenge is defined, if I would define any particular problem your JSON-program should solve, one could get away with a simple trick of defining one particular command in one's JSON programming-language that solves this particular problem. To instead encourage creating a language that is as concise as possible, this challenge will be split into two phases. Phase 1 will last a month since posting this challenge; you will then write your compilers or interpretes. Then I will, on random, choose one challenge from this site that has at least 5 upvotes. &lt;sup&gt;(&lt;a href=&quot;https://codegolf.stackexchange.com/questions/44278/debunking-stroustrups-debunking-of-the-myth-c-is-for-large-complicated-pro/44283&quot;&gt;If this challenge proves unsuitable for this problem&lt;/a&gt;, I'll roll the dice again.)&lt;/sup&gt; Afterwards, Phase 2 will begin, when you will present a JSON-program that solves this challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Be creative.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Example interpreter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For reference, below is a simple JS interpreter of a Turing-complete JSON programming language. Of course, it does not strive to define a language suitable for golfing. &lt;sup&gt;(I hope there are no bugs in this interpreter, but I don't feel like testing it now.)&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;importPackage(java.io);&#xA;importPackage(java.lang);&#xA;&#xA;// This interpreter implements GOTO-programs, which are Turing-complete.&#xA;&#xA;var stdin = new BufferedReader( new InputStreamReader(System['in']) );&#xA;var progsrc = stdin.readLine();&#xA;var prog = JSON.parse(progsrc).prog;&#xA;&#xA;var vars = {};&#xA;vars.in = Number(stdin.readLine());&#xA;&#xA;for(var i = 0; i &amp;lt; prog.length; i++) {&#xA;    switch(prog[i].command) {&#xA;        case 'ADD':&#xA;            vars[prog[i].varname] = vars[prog[i].varname] || 0;&#xA;            vars[prog[i].varname] += prog[i].constant;&#xA;            break;&#xA;        case 'SUBSTRACT':&#xA;            vars[prog[i].varname] = vars[prog[i].varname] || 0;&#xA;            vars[prog[i].varname] -= prog[i].constant;&#xA;            break;&#xA;        case 'GOTO':&#xA;            i = prog[i].index-1;&#xA;            break;&#xA;        case 'IF':&#xA;            vars[prog[i].varname] = vars[prog[i].varname] || 0;&#xA;            if(vars[prog[i].varname] == prog[i].constant) {&#xA;                i = prog[i].index-1;&#xA;            }&#xA;            break;&#xA;        case 'HALT':&#xA;            i = prog.length;&#xA;            break;&#xA;    }&#xA;&#xA;    vars.out = vars.out || 0;&#xA;    print(vars.out);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="53271" LastActivityDate="2018-05-26T22:52:46.790" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16440" PostTypeId="2" ParentId="16400" CreationDate="2018-05-27T04:42:28.090" Score="-4" Body="&lt;h1&gt;It can even be just currying-like&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;E.g. this is a valid dividing function in C++:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#define f(x)x/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Called by &lt;code&gt;f(x)(y)&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2018-05-27T04:42:28.090" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16442" PostTypeId="2" ParentId="2140" CreationDate="2018-05-27T09:19:35.187" Score="1" Body="&lt;h1&gt;Softcode, take 2&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Softcoding&lt;/strong&gt; is an anti-pattern defined by “&lt;em&gt;the practice of removing ‘things that should be in source code’ from source code and placing them in some external resource&lt;/em&gt;”, which usually are config files, database entries, or both. “&lt;em&gt;At the extreme end, soft-coded programs develop their own poorly designed and implemented scripting languages&lt;/em&gt;”, as can be seen by one of the most egregious examples of the practice, the Enterprise Rules Engine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thus, programmers who fall to the habit of softcoding, after tons of work, find themselves at the very point they were starting from: they have developed “&lt;em&gt;some sort of &lt;strong&gt;CO&lt;/strong&gt;mmon &lt;strong&gt;B&lt;/strong&gt;usiness-&lt;strong&gt;O&lt;/strong&gt;riented &lt;strong&gt;L&lt;/strong&gt;anguage that’s generic enough to code any rule&lt;/em&gt;”. But unfortunately for them, there already is such a thing. “&lt;em&gt;It’s called C++. And Java. And C#. And Basic. And, dare I say, COBOL.&lt;/em&gt;”&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the sources of the above quotations are more information of the practise, see: &lt;a href=&quot;http://thedailywtf.com/articles/Soft_Coding&quot; rel=&quot;nofollow noreferrer&quot;&gt;Soft Coding on The Daily WTF&lt;/a&gt;, &lt;a href=&quot;https://en.wikipedia.org/wiki/Softcoding&quot; rel=&quot;nofollow noreferrer&quot;&gt;Softcoding on Wikipedia&lt;/a&gt; and &lt;a href=&quot;http://thedailywtf.com/articles/The_Enterprise_Rules_Engine&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Enterprise Rules Engine on The Daily WTF&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Softcode&lt;/strong&gt;! Make an actual, Turing-complete language that will reside in config files!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More specifically, you should write a compiler / interpreter / anything in between that will define a Turing-complete programming language, whose every valid source code will also be a valid JSON file. &lt;sup&gt;(The reason why JSON has been chosen is the simplicity of syntax and wide avalability of JSON parsers, so that you won't have to write a parser yourself.)&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input/output format of your JSON language is up to you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Shortest interpreter / compiler code wins, as long as it implements a Turing-complete language.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Technical details&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, given how this challenge is defined, I must put one arbitrary restriction: If your language of choice supports calling a compiler or interpreter of any Turing-complete language, I must disallow doing that. Otherwise, this challenge would likely degrade to calling &lt;code&gt;eval&lt;/code&gt; on a single property name of your JSON input file.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, not to burden you with writing JSON parsers, you may use third-party libraries, as long as they're freely available. (Otherwise, good ol' C++ would be a nightmare without Boost.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Be creative.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Example interpreter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For reference, below is a simple JS interpreter of a Turing-complete JSON programming language. Of course, this code is ungolfed. &lt;sup&gt;(I hope there are no bugs in this interpreter, but I don't feel like testing it now.)&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;importPackage(java.io);&#xA;importPackage(java.lang);&#xA;&#xA;// This interpreter implements GOTO-programs, which are Turing-complete.&#xA;&#xA;var stdin = new BufferedReader( new InputStreamReader(System['in']) );&#xA;var progsrc = stdin.readLine();&#xA;var prog = JSON.parse(progsrc).prog;&#xA;&#xA;var vars = {};&#xA;vars.in = Number(stdin.readLine());&#xA;&#xA;for(var i = 0; i &amp;lt; prog.length; i++) {&#xA;    switch(prog[i].command) {&#xA;        case 'ADD':&#xA;            vars[prog[i].varname] = vars[prog[i].varname] || 0;&#xA;            vars[prog[i].varname] += prog[i].constant;&#xA;            break;&#xA;        case 'SUBSTRACT':&#xA;            vars[prog[i].varname] = vars[prog[i].varname] || 0;&#xA;            vars[prog[i].varname] -= prog[i].constant;&#xA;            break;&#xA;        case 'GOTO':&#xA;            i = prog[i].index-1;&#xA;            break;&#xA;        case 'IF':&#xA;            vars[prog[i].varname] = vars[prog[i].varname] || 0;&#xA;            if(vars[prog[i].varname] == prog[i].constant) {&#xA;                i = prog[i].index-1;&#xA;            }&#xA;            break;&#xA;        case 'HALT':&#xA;            i = prog.length;&#xA;            break;&#xA;    }&#xA;}&#xA;&#xA;vars.out = vars.out || 0;&#xA;print(vars.out);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="53271" LastActivityDate="2018-05-27T09:19:35.187" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="16443" PostTypeId="2" ParentId="2140" CreationDate="2018-05-27T10:45:06.937" Score="0" Body="&lt;p&gt;You have been given the following tree structure make from dictionaries and lists&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{'snapshot': {'outer': {'inner': {'dir1': {'blob': &#xA;          [{'file': '8ke45'}, {file1: '72d4kl'}]}, &#xA;          'dir2': {'blob': [{'file1': 'fa65e'}]}}, &#xA;           'something': {'blob': [{'thing1': '8447v'}]}}}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The dictionary contains all the directories and blobs(arbitrary file) in a given directory, in this case 'snapshot,' which contains the directory outer and no blobs. 'Outer' has all of its corresponding directories and blobs and so on until the end of the branch. Blobs objects are a dictionary with the key 'blob' and the value of a list of dictionaries containing the filename and content hash.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;the tree looks like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;snapshot&#xA;    |_outer &#xA;        |__ inner &#xA;        |     |__dir1&#xA;        |     |   |__file&#xA;        |     |   |__file1&#xA;        |     |__dir2&#xA;        |     |   |__somefile&#xA;        |     |__another_file&#xA;        |__ something&#xA;            |__thing1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;the objective to create trees files, wherein each directory is the hash of the hash of the underlying directories or blobs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;e.g the 'inner' file:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;    name: 7j3429ds &#xA;    contents: tree 8340dnwh28a          --di1&#xA;              tree sh2991ka86n          --dir2&#xA;              blob 12046bshs63          --anotherfile&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You may hash the file using any known checksum ie. sha1, md5 ect. This is an example for the hash of the contents of a file:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def hash_(name):&#xA;    hash_object = hashlib.sha1(bytes(str(name), encoding='utf-8'))&#xA;    hex_dig = hash_object.hexdigest()&#xA;    return(hex_dig)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;An &lt;strong&gt;Example&lt;/strong&gt; of the &lt;strong&gt;final output&lt;/strong&gt; given the dictionary:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{'snapshot': {'inner': {'dir1':{'blob': [{'file': '8ke4528dgsk'}},  &#xA;                        'dir2': {'blob': [{'file1': 'fa65ek97n37'}]}}} &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;should look as such:&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;45334423112&#xA;    |_ds498kdh72b &#xA;        |__ ak37ka729sm&#xA;        |     |__193bal7q8gl&#xA;        |__ o8pdn279ax8&#xA;              |__9y728s7ndsn&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;note the names of the files are just random hashes in the example when actually computing the hashes, the hash should consist of the hashes or all trees and blobs contained within that tree&lt;/p&gt;&#xA;&#xA;&lt;p&gt;45334423112 contents:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;tree ds498kdh72b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;ds498kdh72b contents:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;tree ak37ka729sm&#xA;tree o8pdn279ax8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;ak37ka729sm contents:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;blob 8ke4528dgsk&#xA;blob fa65ek97n37&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;note that the blobs are the value of the filname key in the lowest level directory of the tree ie. &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;'dir1':{'blob': [{'file': '8ke4528dgsk'}]}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The winning criterion is the shortest solution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the question is seemingly vague, please comment on what you're unfamiliar with. Good luck ;)&lt;/p&gt;&#xA;" OwnerUserId="80771" LastEditorUserId="80771" LastEditDate="2018-05-27T11:17:04.173" LastActivityDate="2018-05-27T11:17:04.173" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16444" PostTypeId="2" ParentId="2140" CreationDate="2018-05-27T21:36:45.303" Score="0" Body="&lt;h1&gt;Smallest Match-3 Game&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I was reading about Match Three games, games about manipulating a field of symbols to generate lines of three or more matching symbols, and was thinking a playable game would be a pretty short program, if golfed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The reason I think that is because it has less rules than Chess, so I thought that when golfed it'd be a simpler program shorter than the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/45179/smallest-chess-program&quot;&gt;Smallest chess program&lt;/a&gt;, which uses 487 bytes of Assembly, or less than 2 MB in any language used to answer that question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's the other questions on this site, relating to Match-3 games:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/19418/find-the-best-immediate-move-in-a-match-3-game&quot;&gt;Find the best immediate move in a &amp;quot;match-3&amp;quot; game&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/26505/determine-if-a-move-exists-in-a-bejeweled-match-3-game&quot;&gt;Determine if a move exists in a Bejeweled/match 3 game&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Question:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;How small can a Match-3 Game Program be?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The symbols used can be any ones you want, just have at least 3 different symbols.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;At least a 4x4 board. Board size can be customized, if that's somehow easier.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Board must start with a valid configuration, can stall player interaction and visibly reform the board, but player action must only be start to be allowed on a valid board.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Any method of moving symbols is allowed. It could be sliding rows around, instead of swapping the positions of pieces, either side by side or anywhere on the board, or some other innovative way of moving pieces. But the board starts filled, and you move the symbols already there.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Any method of selection of what to move is allowed.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When a match happens, it's removed, and new pieces arrive, somehow. They don't have to fall from the top.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It'd be nice if it could detect when there's no more valid moves.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Random progression instead of deterministic would be nice as well.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Not sure how much variability in the end result I should have. I want to have maximum customization.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I suppose I could have the score for each entry be something like:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bytes of code - average number of bytes used to implement each optional feature.&lt;/p&gt;&#xA;" OwnerUserId="40864" LastEditorUserId="40864" LastEditDate="2018-07-08T21:00:54.727" LastActivityDate="2018-07-08T21:00:54.727" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16445" PostTypeId="2" ParentId="2140" CreationDate="2018-05-28T04:23:31.397" Score="0" Body="&lt;h1&gt;Link the pairs of points&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given some pairs of points on a plane, connect each pair with a &lt;a href=&quot;https://en.wikipedia.org/wiki/Polygonal_chain#Variations&quot; rel=&quot;nofollow noreferrer&quot;&gt;simple polygonal chain&lt;/a&gt; such that any two different chains don't have any common points. The points won't necessarily be integral. Any two points in the input won't overlap.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Samples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[{(0,1.2),(1,2)}] -&amp;gt; [{(0,1.2),(2.6,1),(1,2)}] # Output doesn't need to be optimized&#xA;[{(0,0),(1,1)},{(1,0),(0,1)}] -&amp;gt; [{(0,0),(1,1)},{(1,0),(9999,0),(0,999),(0,1)}]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Reasonable I/O method allowed. Code-golf, shortest code win. &lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="69850" LastEditDate="2018-05-29T05:07:07.523" LastActivityDate="2018-05-29T05:07:07.523" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16446" PostTypeId="2" ParentId="2140" CreationDate="2018-05-28T04:25:50.987" Score="8" Body="&lt;h1&gt;Make A Full Dobble™ Deck&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Dobble (A.K.A. Spot It!) is a deck of (&lt;strong&gt;55&lt;/strong&gt;) cards each of which has a set of (&lt;strong&gt;8&lt;/strong&gt;) distinct symbols, such that &lt;strong&gt;every&lt;/strong&gt; pair of cards matches on &lt;strong&gt;exactly one&lt;/strong&gt; symbol and all symbols are members of pairs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/MBjSL.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/MBjSL.jpg&quot; alt=&quot;Dobble cards&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The base aim of any of the games one plays with a Dobble deck is to find the matching symbols between pairs of cards quicker than your competitors; if you've never played I recommend it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The deck as sold contains &lt;strong&gt;55&lt;/strong&gt; cards and uses &lt;strong&gt;57&lt;/strong&gt; symbols, but it is actually a &quot;Full Dobble Deck&quot; of &lt;strong&gt;57&lt;/strong&gt; cards with &lt;strong&gt;2&lt;/strong&gt; missing. If the missing &lt;strong&gt;2&lt;/strong&gt; cards were added there would be &lt;strong&gt;8&lt;/strong&gt; distinct symbols on each card such that each symbol would appear &lt;strong&gt;8&lt;/strong&gt; times across the deck. Here is a deck I've been playing with, each row being a card (with the &lt;strong&gt;2&lt;/strong&gt; missing cards added and asterisked):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  Anchor     Apple      Bird       Dinosaur   Dolphin    Ghost      Ladybird   Turtle&#xA;  Anchor     Bang       Car        Clef       Flower     Key        Lips       Lock&#xA;  Anchor     Bolt       Clown      Glasses    No-entry   Snowman    Spider     Target&#xA;  Anchor     Bomb       Bottle     Dog        Heart      Ice-cube   Moon       Zebra&#xA;  Anchor     Bulb       Cactus     Dragon     Flame      Scissors   Sun        Tree&#xA;  Anchor     Candle     Clover     Hand       Man        Skull      Snowflake  Splat&#xA;  Anchor     Carrot     Cheese     Clock      Hammer     Knight     Maple      Web&#xA;  Anchor     Cat        Drop       Eroteme    Eye        Igloo      Pencil     Yin-yang&#xA;  Apple      Bang       Igloo      Maple      Moon       Scissors   Snowflake  Spider&#xA;  Apple      Bolt       Cactus     Car        Carrot     Heart      Pencil     Skull&#xA;  Apple      Bomb       Cat        Hand       Lock       Snowman    Tree       Web&#xA;  Apple      Bottle     Clover     Dragon     Flower     Hammer     No-entry   Yin-yang&#xA;  Apple      Bulb       Cheese     Clown      Drop       Key        Man        Zebra&#xA;  Apple      Candle     Clef       Clock      Dog        Eroteme    Flame      Target&#xA;  Apple      Eye        Glasses    Ice-cube   Knight     Lips       Splat      Sun&#xA;  Bang       Bird       Flame      Glasses    Heart      Man        Web        Yin-yang&#xA;  Bang       Bolt       Bottle     Clock      Dinosaur   Drop       Hand       Sun&#xA;  Bang       Bomb       Carrot     Clown      Dragon     Eroteme    Ghost      Splat&#xA;* Bang       Bulb       Dog        Eye        Hammer     Ladybird   Skull      Snowman&#xA;  Bang       Cactus     Candle     Cat        Dolphin    Knight     No-entry   Zebra&#xA;  Bang       Cheese     Clover     Ice-cube   Pencil     Target     Tree       Turtle&#xA;  Bird       Bolt       Bomb       Candle     Cheese     Eye        Flower     Scissors&#xA;  Bird       Bottle     Eroteme    Key        Knight     Skull      Spider     Tree&#xA;  Bird       Bulb       Carrot     Clef       Hand       Ice-cube   Igloo      No-entry&#xA;  Bird       Cactus     Drop       Hammer     Lock       Moon       Splat      Target&#xA;  Bird       Car        Cat        Clover     Clown      Dog        Maple      Sun&#xA;  Bird       Clock      Dragon     Lips       Pencil     Snowflake  Snowman    Zebra&#xA;  Bolt       Bulb       Clover     Dolphin    Eroteme    Lips       Moon       Web&#xA;  Bolt       Cat        Flame      Ghost      Hammer     Ice-cube   Key        Snowflake&#xA;  Bolt       Clef       Ladybird   Maple      Splat      Tree       Yin-yang   Zebra&#xA;  Bolt       Dog        Dragon     Igloo      Knight     Lock       Man        Turtle&#xA;  Bomb       Bulb       Car        Dinosaur   Knight     Snowflake  Target     Yin-yang&#xA;  Bomb       Cactus     Clock      Clover     Glasses    Igloo      Key        Ladybird&#xA;  Bomb       Clef       Dolphin    Hammer     Man        Pencil     Spider     Sun&#xA;  Bomb       Drop       Flame      Lips       Maple      No-entry   Skull      Turtle&#xA;  Bottle     Bulb       Candle     Ghost      Glasses    Lock       Maple      Pencil&#xA;  Bottle     Cactus     Clef       Clown      Eye        Snowflake  Turtle     Web&#xA;  Bottle     Car        Cheese     Dolphin    Flame      Igloo      Snowman    Splat&#xA;  Bottle     Carrot     Cat        Ladybird   Lips       Man        Scissors   Target&#xA;  Bulb       Cat        Clock      Flower     Heart      Spider     Splat      Turtle&#xA;  Cactus     Cheese     Dog        Ghost      Hand       Lips       Spider     Yin-yang&#xA;* Cactus     Dinosaur   Eroteme    Flower     Ice-cube   Man        Maple      Snowman&#xA;  Candle     Car        Dragon     Drop       Ice-cube   Ladybird   Spider     Web&#xA;  Candle     Carrot     Key        Moon       Snowman    Sun        Turtle     Yin-yang&#xA;  Candle     Clown      Dinosaur   Hammer     Heart      Igloo      Lips       Tree&#xA;  Car        Clock      Eye        Ghost      Man        Moon       No-entry   Tree&#xA;  Car        Eroteme    Glasses    Hammer     Hand       Scissors   Turtle     Zebra&#xA;  Carrot     Clover     Dinosaur   Eye        Flame      Lock       Spider     Zebra&#xA;  Carrot     Dog        Dolphin    Drop       Flower     Glasses    Snowflake  Tree&#xA;  Cat        Cheese     Clef       Dinosaur   Dragon     Glasses    Moon       Skull&#xA;  Cheese     Eroteme    Heart      Ladybird   Lock       No-entry   Snowflake  Sun&#xA;  Clef       Clover     Drop       Ghost      Heart      Knight     Scissors   Snowman&#xA;  Clock      Clown      Dolphin    Ice-cube   Lock       Scissors   Skull      Yin-yang&#xA;  Clown      Flame      Flower     Hand       Knight     Ladybird   Moon       Pencil&#xA;  Dinosaur   Dog        Key        No-entry   Pencil     Scissors   Splat      Web&#xA;  Dolphin    Dragon     Eye        Hand       Heart      Key        Maple      Target&#xA;  Flower     Ghost      Igloo      Skull      Sun        Target     Web        Zebra&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is actually a Full Dobble Deck of order &lt;strong&gt;N=7&lt;/strong&gt;, where the order defines the number of :&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;symbols (&lt;strong&gt;N&lt;sup&gt;2&lt;/sup&gt;+N+1&lt;/strong&gt;);&lt;/li&gt;&#xA;&lt;li&gt;cards (also &lt;strong&gt;N&lt;sup&gt;2&lt;/sup&gt;+N+1&lt;/strong&gt;);&lt;/li&gt;&#xA;&lt;li&gt;symbols per card (&lt;strong&gt;N+1&lt;/strong&gt;); and&lt;/li&gt;&#xA;&lt;li&gt;cards containing any given symbol (also &lt;strong&gt;N+1&lt;/strong&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;A Full Dobble Deck is analogous to a &lt;a href=&quot;https://en.wikipedia.org/wiki/Projective_plane#Finite_projective_planes&quot; rel=&quot;nofollow noreferrer&quot;&gt;finite projective plane&lt;/a&gt; with points and lines as cards and symbols (or as symbols and cards) and thus may be constructed for any prime-power order (it is an open question whether finite projective planes exist for any non-prime-power order). We shall restrict ourselves to prime orders (it is much simpler to implement).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example here is a Full Dobble Deck of order &lt;strong&gt;3&lt;/strong&gt; (PG(2,3)) using &lt;strong&gt;13&lt;/strong&gt; objects/colours (lines) and &lt;strong&gt;13&lt;/strong&gt; cards (points) with &lt;strong&gt;4&lt;/strong&gt; colours per card (lines incident with each point):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/tjPU8.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/tjPU8.png&quot; alt=&quot;Dobble-3 = PG(3,2)&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;...and here it is as a list of cards containing the objects &lt;strong&gt;[0,12]&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[2,3,8,11],[2,5,6,7],[1,2,9,12],[4,7,8,9],[4,5,11,12],[1,3,4,6],[0,6,8,12],[0,3,5,9],[0,1,7,11],[1,5,8,10],[6,9,10,11],[0,2,4,10],[3,7,10,12]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;The challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given a prime (&lt;strong&gt;N&lt;/strong&gt;) yield a Full Dobble Deck of that order in any convenient form.&lt;br&gt;&#xA;&lt;strong&gt;One must be able to observe completion for N=11&lt;/strong&gt; (no brute forcing here)&lt;br&gt;&#xA;For any other input undefined behaviour is acceptable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;* You may alternatively take as input &lt;strong&gt;N+1&lt;/strong&gt; or &lt;strong&gt;N&lt;sup&gt;2&lt;/sup&gt;+N+1&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##bVLLbtswELzrKxYOUFGxajQ5BvApaRv00Bh2bo4PlETVbChSICkHbtFvd5eUSElBeBGpnZ2ZfbRne1Ty9nIFP5@ev94Bl21noemMhYIBBcPlL8FAcMmAcMsaAw09u5jsmoJpA9TAGxPCfY3VCDfZ6lJr1QDCtVVKGOBNq7SF8ki5zKFUTcEltVxJkyQVq@FEBa@oZaRi5Wt2lwAeVfxmpTWwBsMs8ank2sczH@c1CCaJCza0JXjPoQ9nsF7DTc/ijkQOB3XR/ZdDBp/hJgaVrphGgLyWS7kc/w/0gwtPGTj8w@eNGu6UVFc75i0LbnpbaC/YmmE1s52WQIVwzsmQGmXcO4Na6UCa@wuOB/7wNsBNoIaXGTkeKqtITuETFH1TPCXNoXBM0zlMKG@Rz6XLJDlhKXE2fjUI1oGtOfWVtzhvSxbPR2pT3AT41uEiPKiiwJV5QGeganjyDf77b7VYoXhDLTkhBxOGfcQhlf2AZ7XILpf9Pt34bU1zSH/QE3Xf3RuvrbtsHjfpIYf3mF2peesBWw8vqaA97n659HkR/l35N9OiBzxS84qLPaZN5RD8HjSXc35mdINeMD5J3PaAbVecR6OxrkgQ4oFhrhcMBdQgF53H/kx8jNlR7v5qoBk7gr@m@UFgbNyklJAexxPkBxJfzOE/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here is a Python program&lt;/a&gt; that validates a potential Full Dobble Deck (it must be given as a valid list of lists in Python syntax such as the &quot;list of cards containing the objects &lt;strong&gt;[0,12]&lt;/strong&gt;&quot; example above).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="53748" LastEditorUserId="53748" LastEditDate="2018-05-29T21:33:12.540" LastActivityDate="2018-05-29T21:33:12.540" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="16447" PostTypeId="1" CreationDate="2018-05-28T10:17:05.973" Score="2" ViewCount="87" Body="&lt;p&gt;The snippet used in many questions to generate a leaderboard is not displaying correctly for me, and some links are not working. I am using Firefox 59.0.2 (64-bit) on macOS 10.13.2 (High Sierra).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The snippet can be found (and run) &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5139/79343&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's how the snippet, when run, renders for me:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/qqFWm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/qqFWm.png&quot; alt=&quot;broken leaderboard snippet&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That's kind of ugly, but still readable. However, the links overlapping the text (in the center column) are not clickable, which seriously impairs the usability of the snippet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can someone please look into what is causing this issue, and provide a fix? And if it is fixed, how do we best distribute the new code to all the questions that have a leaderboard?&lt;/p&gt;&#xA;" OwnerUserId="79343" LastEditorUserId="56656" LastEditDate="2022-09-29T16:17:25.870" LastActivityDate="2022-09-29T16:17:25.870" Title="Leaderboard not working correctly" Tags="|bug|status-completed|stack-snippets|user-interface|leaderboard|" AnswerCount="0" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16448" PostTypeId="2" ParentId="2140" CreationDate="2018-05-29T04:26:08.433" Score="0" Body="&lt;p&gt;Given some lists of strings containing only lowercase letters, slice the first few (1 to length) characters for each string in each list, so that when each list is joined without separating symbol, it can't be any other list's possible expression.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, for &lt;code&gt;{[ab,cd],[abcd]}&lt;/code&gt;, &lt;code&gt;{ac,a}&lt;/code&gt; is valid, but &lt;code&gt;{abc,a}&lt;/code&gt; is not because &lt;code&gt;abc&lt;/code&gt; can also mean &lt;code&gt;[abcd]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can assume the result exist. If more than one solution, either output all of them or one of them. Shortest code win.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="69850" LastEditDate="2018-05-29T05:00:42.393" LastActivityDate="2018-05-29T05:00:42.393" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16455" PostTypeId="2" ParentId="2140" CreationDate="2018-05-30T08:20:26.127" Score="0" Body="&lt;h1&gt;Shortest code to generate a random ethereum address with matching private key pair&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.ethereum.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ethereum&lt;/a&gt; is a blockchain platform.&#xA;An Ethereurem public address consist of 256 bytes based on ECDSA encryption.&lt;/p&gt;&#xA;&lt;p&gt;It’s very simple challenge about a service available on many websites without registering (which most of the time involve going on website main page and click the generate button) : generate a random ethereum address !&lt;/p&gt;&#xA;&lt;h3&gt;What is an Ethereum address ?&lt;/h3&gt;&#xA;&lt;p&gt;An Ethereum address is a public/private key pair hence the public address is just the public part of the key pair. Here’s an example of Ethereum address with private key after :&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0x7bbaf5E447B089C5e0a802d07A2bc63870e90f05 651bfdb66c839ae0aa4ed59bbada63c13876feb60a89ca6dacc63a7b04cf4b60&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Every private key and &lt;a href=&quot;https://etherscan.io/address/0x0000000000000000000000000000000000000000&quot; rel=&quot;nofollow noreferrer&quot;&gt;public key is valid&lt;/a&gt; as long as the length above is the same. But you need to output a private key which match a public key (It’s possible to retrieve the public key from the private key).&lt;br /&gt;&#xA;Example online generators : &lt;a href=&quot;https://vanity-eth.tk/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://vanity-eth.tk/&lt;/a&gt; &lt;a href=&quot;https://forkdelta.github.io&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://forkdelta.github.io&lt;/a&gt; &lt;a href=&quot;https://etherdelta.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://etherdelta.com&lt;/a&gt; &lt;a href=&quot;https://walletgenerator.net/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://walletgenerator.net/&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Example code to generate an address in bash :&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;#!/bin/sh&#xA;&#xA;keys=$(openssl ecparam -name secp256k1 -genkey -noout | openssl ec -text -noout 2&amp;gt; /dev/null)&#xA;&#xA;# extract private key in hex format, removing newlines, leading zeroes and semicolon&#xA;priv=$(printf &amp;quot;%s\n&amp;quot; $keys | grep priv -A 3 | tail -n +2 | tr -d '\n[:space:]:' | sed 's/^00//')&#xA;&#xA;# extract public key in hex format, removing newlines, leading '04' and semicolon&#xA;pub=$(printf &amp;quot;%s\n&amp;quot; $keys | grep pub -A 5 | tail -n +2 | tr -d '\n[:space:]:' | sed 's/^04//')&#xA;&#xA;# sha3 is a subset of the keccak familly function. Thus keccak is included in most sha3 tools.&#xA;addr=0x$(echo $pub | keccak-256sum -x -l | tr -d ' -' | tail -c 41)&#xA;&#xA;echo 'Private key:' $priv&#xA;echo 'Address:    ' $addr&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The resulting public address shouldn’t be fully random : the last byte should be 0. This can be achieved by generating about 256 random address and selecting the first which has a trailing null byte (the probability is 1∕256).&lt;/li&gt;&#xA;&lt;li&gt;Print or return : the public key along the matching private key as a string.&lt;/li&gt;&#xA;&lt;li&gt;The solidity has native functions to generate an address, so you don’t have to understand how to generate an address&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt; Winner&lt;/h2&gt;&#xA;&lt;p&gt;The code which uses the fewest bytes.&lt;/p&gt;&#xA;" OwnerUserId="50239" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-05-30T11:42:54.393" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16456" PostTypeId="1" CreationDate="2018-05-30T11:16:15.943" Score="3" ViewCount="133" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/165573/the-farfallino-alphabet&quot;&gt;The Farfallino Alphabet&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hello everyone. Because of my &lt;em&gt;cough cough dumbness cough cough&lt;/em&gt; I edited my code golf following many complaints in comments and downvotes, thus invalidating like every submission. I now understand that I should be much more accurate, avoiding any ambiguity. I think that now the requirements are much better but I would like to delete my thread and create another one naming it like &quot;The Farfallino Alphabet v2&quot;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this possible?&#xA;Thanks.&lt;/p&gt;&#xA;" OwnerUserId="80791" LastEditorUserId="31716" LastEditDate="2018-05-30T17:51:40.533" LastActivityDate="2018-05-30T18:28:45.153" Title="Can I redo my Code Golf?" Tags="|discussion|specific-question|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16457" PostTypeId="1" AcceptedAnswerId="16460" CreationDate="2018-05-30T13:31:00.700" Score="-1" ViewCount="70" Body="&lt;p&gt;Current handling of Ethereum questions seems inconsistent (Ethereum being the second largest blockchain).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This about the recent difference between &lt;a href=&quot;https://codegolf.stackexchange.com/q/165724/50239&quot;&gt;Shortest code to generate a random ethereum address with matching private key pair&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/q/152844/50239&quot;&gt;Get ERC-20 token balance&lt;/a&gt; which doesn’t describe how to connect to the ledger Ethereum protocol and propose an HTTP api instead (given many service allow to get token balance of an address through an http request directly).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or does my case about not reopening can be considered as vote to close for downvote ?&lt;/p&gt;&#xA;" OwnerUserId="50239" LastEditorUserId="44945" LastEditDate="2018-05-30T18:12:44.580" LastActivityDate="2018-05-30T18:12:44.580" Title="Are questions about blockchain systems good questions?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16458" PostTypeId="2" ParentId="16456" CreationDate="2018-05-30T13:55:57.210" Score="4" Body="&lt;p&gt;You cannot delete your challenge if it already has answers with a positive score; the system doesn't allow it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moderators &lt;em&gt;can&lt;/em&gt; delete challenges upon request, but hardly ever do so. I don't think a challenge has ever been deleted by a moderator, just so it could be re-posted verbatim, mainly because there aren't any benefits. If the challenge has invalid answers, leave comments under them, so people are aware and can either amend or delete them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, in general and for this particular case, if people ask for clarifications in comments, you usually have the option to clarify &lt;em&gt;without&lt;/em&gt; invalidating preexisting answers. If there are already more than a couple of answers, that's usually the way to go.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Up to revision 4, there weren't any test cases with uppercase vowels. Thus, you could have added a sentence like&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;You may assume that the input doesn't contain any uppercase vowels.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Behavior for uppercase vowels is undefined.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If your edit really invalidates most of (or even a significant portion of) the current answers, I'd personally revert it and use one of the options above.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2018-05-30T13:55:57.210" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16460" PostTypeId="2" ParentId="16457" CreationDate="2018-05-30T15:09:02.317" Score="3" Body="&lt;p&gt;I will note before the rest of my answer: I don't think the earlier question you linked is a good challenge, though it is significantly more clear than the version of your challenge that was closed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your challenge remains slightly unclear, but at this point I would call it &quot;not so unclear that it would be closed if originally posted in this format&quot;. The biggest remaining problem is that the actual challenge is this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Generate secp256k1 ecc public/private key pair; hash the public key string through keccak256; the last byte should be 0&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;but that information is buried and interwoven with a lot of stuff about Ethereum which, by PPCG stanards, is equivalent to &quot;creative backstory&quot;. Making a creative backstory is a somewhat divisive topic in my experience, but the less controversial part is that the motivating backstory should be &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13632/71434&quot;&gt;short and separated&lt;/a&gt; so that uninterested parties can simply ignore it. The fact that Ethereum is a real thing doesn't keep it from being a backstory essentially irrelevant to what is actually required to complete the challenge, so ideally all the stuff about Ethereum should fit in about the space of your first two paragraphs and everything else should focus solely on making the challenge itself (those three requirements I have quoted) more clear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As for whether it should be reopened, I think it can be... but I also think it will remain downvoted and likely ignored either way. &quot;Run stuff through a hashing algorithm until the last byte is zero&quot; sounds really boring to me, and because of the requirements for using specific hashing/key generating algorithms any answer other than &quot;find a library that offers the functions I need, my submission is in 'language w/ library' and consists of calls to that library&quot; will require incredibly tedious re-implementation of hashing functions. It also suffers from being abnormally difficult to evaluate whether answers are correct; even assuming an answer can run on TIO reliably, I would need to go somewhere else to retrieve the public key from the private one, and then hash that private key, and then check that it both matches the one output by the answer and that it ends with 0.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, does this mean blockchain questions are &quot;bad&quot;? Well... there's a high chance. I can't claim to be an expert, but blockchains &lt;em&gt;by design&lt;/em&gt; involve very large random numbers with special properties, and I personally don't think challenges about very large random numbers with special properties are going to be interesting. The earlier challenge you linked gets around that particular difficulty by &lt;em&gt;supplying&lt;/em&gt; those numbers, but I have different issues with it. An example of a good Ethereum-themed challenge might be &quot;given a list of transactions, output everyone's final balance&quot; or something similar, but I suspect a &quot;track balance over transactions&quot; challenge already exists and Ethereum-theming won't keep it from being a duplicate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TL;DR: I've voted to reopen. In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/16094/71434&quot;&gt;prior consensus&lt;/a&gt; a bad but clear challenge should not remain &quot;closed as unclear&quot;.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastActivityDate="2018-05-30T15:09:02.317" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16461" PostTypeId="2" ParentId="2140" CreationDate="2018-05-30T18:21:53.570" Score="1" Body="&lt;h1&gt;Array-of-arrays string conversion&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Matrix challenges are popular. There's an issue of how to provide test cases. A common method is the &lt;em&gt;row-wise array-of-arrays&lt;/em&gt; representation, such as:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[1,2],[3,4],[5,6]] -&amp;gt; a 3 by 2 matrix&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is good with vertical space, but there's always the task of converting the test cases into something your language can use, and vice versa for producing test cases to this format.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So this is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge and also a repository of conversion functions that people can use when trying or composing matrix challenges.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Defining the format&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A &lt;strong&gt;row string of length &lt;em&gt;m&lt;/em&gt;&lt;/strong&gt; is a comma-separated list of &lt;em&gt;m &amp;ge; 1&lt;/em&gt; numbers, enclosed in square brackets.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;strong&gt;row-wise &lt;em&gt;n&amp;times;m&lt;/em&gt; array-of-arrays string&lt;/strong&gt; is a comma-separated list of &lt;em&gt;n &amp;ge; 1&lt;/em&gt; &lt;strong&gt;row strings of length &lt;em&gt;m&lt;/em&gt;&lt;/strong&gt; enclosed in square brackets.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There can be no leading whitespace. One trailing newline immediately after the final &lt;code&gt;]&lt;/code&gt; is optional. Otherwise any whitespace in the string is optional.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Produce two* programs/functions in your language:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;one which takes a &lt;strong&gt;rowwise &lt;em&gt;n&amp;times;m&lt;/em&gt; array-of-arrays string&lt;/strong&gt; as an input, and outputs the matrix (as implemented in the language.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;another one which takes an &lt;em&gt;n&amp;times;m&lt;/em&gt; matrix (as implemented in the language) as an input and outputs the &lt;strong&gt;rowwise &lt;em&gt;n&amp;times;m&lt;/em&gt; array-of-arrays string&lt;/strong&gt;. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;*It is allowed for one program/function to perform both tasks and you can have helper code used by both conversion functions. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;To be clear: the language must support matrices (or something equivalent like 2D arrays - the name is not important) because the output/input of the two tasks needs to be an actual matrix in the language.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. &lt;/li&gt;&#xA;&lt;li&gt;Fewest total number of bytes (from all functions and any helper code) in each language wins. &lt;/li&gt;&#xA;&lt;li&gt;If one program or function does both conversions, only count those bytes once.&lt;/li&gt;&#xA;&lt;li&gt;Standard rules apply/loopholes forbidden. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Here's the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/16461/79980&quot;&gt;Sandbox&lt;/a&gt; and a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/129136/simplify-matrix-input&quot;&gt;related question&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="79980" LastEditorUserId="79980" LastEditDate="2018-06-01T13:54:17.473" LastActivityDate="2018-06-01T13:54:17.473" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="16462" PostTypeId="2" ParentId="16456" CreationDate="2018-05-30T18:28:45.153" Score="11" Body="&lt;p&gt;&lt;em&gt;I'm repeating some things from my last comment, but leaving them here for completeness&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I think that now the requirements are much better&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The requirements are much less clear with the added edge cases, so I have closed the challenge for now.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I went through and tested every single answer that I could (all but 2 of them without TIO links). Not a single one of them passed the &lt;code&gt;AAAH → AfafaAfaH&lt;/code&gt; test case that you added after the fact. And that doesn't surprise me, since this is a very strange edge case that requires some guess work to figure out what you were intending. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Why not handle more than 2 consecutive vowels? My first assumption would be &lt;code&gt;aaaa --&amp;gt; afafafafa&lt;/code&gt;, but clearly that's wrong. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Why does that case turn some letters into lower case? The second &lt;code&gt;A&lt;/code&gt; became an &lt;code&gt;a&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Another rule that has to be inferred from test cases is how &lt;code&gt;A&lt;/code&gt; becomes &lt;code&gt;Afa&lt;/code&gt; rather than &lt;code&gt;AfA&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As Dennis pointed out, the challenge can't be deleted anymore unless a moderator does it, and there is no benefit to having it deleted.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What next?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I have an idea to fix the situation that is pretty unorthodox to the way the site tends to work, so it might be unpopular. I'm not officially saying as a moderator that this is what we should do, it's just my thoughts on how we could move forward.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Leave it closed.&lt;/strong&gt; The challenge in it's current state is still rather unclear and has a lot of edge cases that aren't explicitly stated. And each revision of the challenge was pretty unclear too, so if we wanted it to be re-opened, it would require rolling back, significant editing, deleting nearly all the comments, and then going through and deleting a large portion of the answers. This seems really sloppy to me. Let's just say the challenge didn't work out the way you hoped, it's unclear, and that's OK. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that this includes not deleting it since there are upvoted answers on the thread.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Post the challenge in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/31716&quot;&gt;The Sandbox&lt;/a&gt;. This will allow people to suggest improvements without invalidating answers. While it's in here, I would recommend waiting at least a week, both because it needs some time for clarification, but also because I think it would be best to not repost the challenge immediately. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;While you have this challenge in the sandbox, focus quite a bit on &lt;em&gt;simplifying&lt;/em&gt; the challenge. In particular,&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;There should be &lt;strong&gt;no&lt;/strong&gt; rules that need to be inferred from the test cases. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There should be as few edge cases as possible. If this means removing uppercase altogether, then do that. If this means saying that no input will contain more than 2 consecutive vowels, do that.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The test cases should all be covered by a small set of simple rules that are consistent and cover everything. By &quot;small set&quot;, I mean 2 rules, &lt;em&gt;maybe&lt;/em&gt; a 3rd if necessary.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For your challenge in particular:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Personally, I would recommend removing &lt;em&gt;2 consecutive vowels are not special. You have to handle 2 consecutive vowels&lt;/em&gt;. I think something like &lt;code&gt;aaa --&amp;gt; afafafa&lt;/code&gt; is far more clear than &lt;code&gt;aaa --&amp;gt; afafaafa&lt;/code&gt;. Either keep the double-vowel rule consistent with more than 2 vowels, or don't make people support inputs with more than 2 vowels.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Make sure you are clear and explicit about the capitalization of any added vowels. For example, in your current revision, it's completely unclear why the second 'A' becomes lowercase. Why is it &lt;code&gt;AAH --&amp;gt; AfafaH&lt;/code&gt; and not &lt;code&gt;AAH --&amp;gt; AfAfAH&lt;/code&gt; or even &lt;code&gt;AfAfaH&lt;/code&gt;? Again, the challenge might be a lot better if you just remove handling of uppercase characters entirely.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;After improving the challenge and waiting long enough, I think it would be perfectly fine to post the challenge back on main. It's a little bit weird to advocate for a repost, but 1) The new challenge will be far better. 2) It's not really a duplicate since the current challenge is closed. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;And we could also close the current challenge as a duplicate of the new one to point people towards the better challenge. That's not &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8286/31716&quot;&gt;even an unusual course of action&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;I do think that it's a good challenge, it's was just ruined by changing the rules too many times. With some polishing and a more consistent spec, I think this would be a very enjoyable challenge to answer.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2018-05-30T18:28:45.153" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16463" PostTypeId="2" ParentId="2140" CreationDate="2018-05-30T20:02:19.660" Score="0" Body="&lt;p&gt;&lt;strong&gt;Create random recurrences with their solutions&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(This is a work in progress and I would love any help please. First, how do I copy the wiki entry into this question without making a mess of the math as I have below? PPCG doesn't appear to support math rendering like the wiki does.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The task is to create random recurrence relations that are solvable using the &lt;a href=&quot;https://en.wikipedia.org/wiki/Akra%E2%80%93Bazzi_method&quot; rel=&quot;nofollow noreferrer&quot;&gt;Akra-Bazzi method&lt;/a&gt; along with the solutions. This method solves recurrences of the form:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/tKvYW.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/tKvYW.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The conditions for usage are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;sufficient base cases are provided&lt;/li&gt;&#xA;&lt;li&gt;a_i and b_i are constants for all i&lt;/li&gt;&#xA;&lt;li&gt;a_i &gt; 0 for all i&lt;/li&gt;&#xA;&lt;li&gt;0 &amp;lt; b_i &amp;lt; 1 for all i&lt;/li&gt;&#xA;&lt;li&gt;|g(x)| = O(x^c), where ''c'' is a constant and ''O'' notates &lt;a href=&quot;https://en.wikipedia.org/wiki/Big_O_notation&quot; rel=&quot;nofollow noreferrer&quot;&gt;Big O notation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;| h_i(x) | = O(x/(log x)^2) for all i&lt;/li&gt;&#xA;&lt;li&gt;x_0 is a constant&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The asymptotic behavior of T(x) is found by determining the value of p for which &lt;a href=&quot;https://i.stack.imgur.com/1TS6x.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/1TS6x.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt; and plugging that value into the equation&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Xbhsm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Xbhsm.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user9207" LastEditorDisplayName="user9207" LastEditDate="2018-05-30T20:50:36.493" LastActivityDate="2018-05-30T20:50:36.493" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16464" PostTypeId="1" CreationDate="2018-05-30T20:44:01.937" Score="5" ViewCount="107" Body="&lt;p&gt;I found a bug in a code golf submission but do not yet have commenting privilege. Is there a polite way for me to let the user know about this bug?&#xA;The site offers me to &quot;suggest an edit&quot; but I'm not sure wether doing so would be against the rules/etiquette/good manners. &lt;/p&gt;&#xA;" OwnerUserId="80812" LastEditorUserId="66833" LastEditDate="2021-06-02T14:14:36.313" LastActivityDate="2021-06-02T14:14:36.313" Title="Pointing out bugs without comment privilege" Tags="|support|answers|comments|privileges|" AnswerCount="4" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16466" PostTypeId="2" ParentId="2140" CreationDate="2018-05-30T21:01:40.613" Score="1" Body="&lt;h1&gt;Othello Greedy Strategy&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The rules for Othello can be found &lt;a href=&quot;https://www.wikihow.com/Play-Othello&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a greedy strategy, in each go, you just choose a square in which to place your counter such that there are no other places that could allow you to flip more counters. However, there is still often a choice where you need to decide where to put your counter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an integer N as input, when black goes first and both players follow a greedy strategy, output a possible configuration of counters at the end of the game where there are N black counters. Assume that there exists a configuration for N.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output should be a 64-character string, where the (r-1)*8+1th to r*8th characters (inclusive) represent the rth row from left to right.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'll add test cases if people think that this is a good challenge.&lt;/p&gt;&#xA;" OwnerUserId="55749" LastActivityDate="2018-05-30T21:01:40.613" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16467" PostTypeId="2" ParentId="16464" CreationDate="2018-05-31T03:39:33.890" Score="0" Body="&lt;p&gt;Although commenting is the best way, if you can't there are the following options:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(note: I'm posting multiple answers to let people vote on it)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Flag for moderator attention (needs 15 reputations)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Unlike on other sites, on PPCG moderators accept (in my experience) invalid-answer flags (because answers can be tested without much difficulty. You should also provide invalid test cases). They should leave a comment if they think that's the best way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However... we only have 5 moderators. Only use this if you can't comment or comments won't help (for example when OP has left the site and is unlikely to fix the answer)&lt;/p&gt;&#xA;" OwnerUserId="69850" LastActivityDate="2018-05-31T03:39:33.890" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16468" PostTypeId="2" ParentId="16464" CreationDate="2018-05-31T03:41:35.740" Score="-1" Body="&lt;h1&gt;Raise the issue in chat (needs 20 reputations on any site)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Not really a good idea. There are no guarantee that it will be handled.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can be used if the user who posted the invalid answer is pingable in chat, otherwise, there is a large chance of somebody see your message and comment on the post.&lt;/p&gt;&#xA;" OwnerUserId="69850" LastActivityDate="2018-05-31T03:41:35.740" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16469" PostTypeId="2" ParentId="2140" CreationDate="2018-05-31T09:35:36.747" Score="2" Body="&lt;blockquote&gt;&#xA;  &lt;h1&gt;&lt;em&gt;Hexarun!&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/work-in-progress&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;work-in-progress&amp;#39;&quot; rel=&quot;tag&quot;&gt;work-in-progress&lt;/a&gt;&lt;/h1&gt;&#xA;  &#xA;  &lt;p&gt;Hexarun (stylized as &lt;em&gt;Hexarun!&lt;/em&gt;) is a simultaneous game with complete&#xA;  information.  Hexarun is intended for a minimum of three (3) players.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Overview&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Up to twelve (12) players start on a &lt;strong&gt;regular hexagonal toroidal board&lt;/strong&gt; with a number placed on each hexagon.  The objective of the game is to collect the numbers by navigating the board.  Players have complete knowledge of the board and the participating players.  The number on a hexagon is reduced by the amount being collected.  The game ends when all hexagons &lt;strong&gt;become zero&lt;/strong&gt; or if the game becomes &lt;strong&gt;stale&lt;/strong&gt;.  The player whose collection has the highest sum wins the game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each game consists of multiple turns.  Before the first turn, players choose their own starting location.  During each turn, players &lt;strong&gt;move within their vicinity&lt;/strong&gt; at the same time.  If a player is alone in a numbered hexagon, this player &lt;strong&gt;collects&lt;/strong&gt; the entire number.  If multiple players move into a single hexagon simultaneously, they &lt;strong&gt;split&lt;/strong&gt; the number.  Numbers are not exchanged between players during each game.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Game specifications&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Regular hexagonal toroidal board:&lt;/strong&gt; Each edge of the board measures &lt;code&gt;N=2*P&lt;/code&gt; hexagons where &lt;code&gt;P&lt;/code&gt; is the number of players on the board.  The numbers on the board are placed in concentric rings.  The numbers on the edge of the board are 1, and each successive inner ring follows off the OEIS sequence &lt;a href=&quot;https://oeis.org/A002024&quot; rel=&quot;nofollow noreferrer&quot;&gt;A002024&lt;/a&gt; which starts with 1, 2, 2, 3, 3, 3, 4, 4, 4, 4.  As a final touch, increase the number in the center by 1 if it is not unique on the board.  &lt;a href=&quot;https://i.stack.imgur.com/7cBLi.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;[Example Board (N=6)]&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A game ends when...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;a. &lt;strong&gt;Hexagons become zero&lt;/strong&gt;: Numbers on all hexagons are zero.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;b. &lt;strong&gt;Game becomes stale&lt;/strong&gt;: Scores do not change during &lt;code&gt;6*P&lt;/code&gt; consecutive turns.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Legal moves...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;a. &lt;strong&gt;&lt;em&gt;Run!&lt;/em&gt;&lt;/strong&gt;: Moves into one of the six (6) neighboring hexagons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;b. &lt;strong&gt;Nothing&lt;/strong&gt;: Does literally nothing.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Number collection:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;a. &lt;strong&gt;Collect&lt;/strong&gt;: At the end of a turn, a player alone on a hexagon scores &lt;code&gt;s=h&lt;/code&gt; points, where &lt;code&gt;h&lt;/code&gt; is the number on the hexagon at the beginning of the turn.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;b. &lt;strong&gt;Split&lt;/strong&gt;: At the end of a turn, &lt;code&gt;n&amp;gt;1&lt;/code&gt; players standing on a hexagon scores &lt;code&gt;s=h/n&lt;/code&gt; points, where &lt;code&gt;h&lt;/code&gt; is the number on the hexagon at the beginning of the turn, and &lt;code&gt;/&lt;/code&gt; is integer division.  The number on the hexagon at the end of the turn becomes &lt;code&gt;h-s*n&lt;/code&gt;, a.k.a. the remainder. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Example: At the end of a turn, a total of 3 players are on a hexagon with number 10, then each gets 3 points and the hexagon becomes 1.&lt;/em&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;How to play&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;TODO&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Tournament rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;TODO&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Leaderboard&lt;/h1&gt;&#xA;" OwnerUserId="11933" LastEditorUserId="11933" LastEditDate="2018-05-31T13:07:33.637" LastActivityDate="2018-05-31T13:07:33.637" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="16471" PostTypeId="2" ParentId="2140" CreationDate="2018-05-31T18:01:35.590" Score="-2" Body="&lt;h1&gt;Quecho, a quine-like implementation of echo.&lt;/h1&gt;&#xA;&lt;h1&gt;Challenge:&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge is to write a quine-like program that takes a string from stdin and gives two outputs: Output A is the input string. Output B is your source code.&lt;/p&gt;&#xA;&lt;h1&gt;Output Formats:&lt;/h1&gt;&#xA;&lt;p&gt;You can send your outputs to stdout, stderr, and/or files. If A and B go to the same output, they must be separated by a newline. Having a newline at the beginning of your source doesn't count. You'd need to print that newline from your source and then another newline to separate A and B.&lt;/p&gt;&#xA;&lt;h1&gt;Examples:&lt;/h1&gt;&#xA;&lt;p&gt;source: &lt;code&gt;print($stdin+&amp;quot;\n&amp;quot;+codeThatGeneratesSource)&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;input: &lt;code&gt;Hello, World!&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Both outputs on stdout:&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;Hello, World!&#xA;print($stdin+&amp;quot;\n&amp;quot;+codeThatGeneratesSource)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Separate Outputs:&lt;/h3&gt;&#xA;&lt;p&gt;stdout: &lt;code&gt;Hello, World!&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;stderr: &lt;code&gt;print($stdin+&amp;quot;\n&amp;quot;+codeThatGeneratesSource)&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10033&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/h3&gt;&#xA;&lt;h3&gt;Submissions should be &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4878&quot;&gt;proper quines&lt;/a&gt; except that they produce the additional specified output.&lt;/h3&gt;&#xA;" OwnerUserId="69304" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-06-01T17:04:43.473" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16474" PostTypeId="2" ParentId="2140" CreationDate="2018-06-01T10:31:14.357" Score="0" Body="&lt;h1&gt;Divide two strings&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;One day, I saw the challenge to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/125470/multiply-two-strings&quot;&gt;multiply two strings&lt;/a&gt; and I thought I might be able to do one better. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;That challenge was fake. It was elementwise maximum. It was not real multiplication. So I set out to make something real. Real division between two strings.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I quickly realized that this would make an amazing challenge, as the algorithm was surprisingly complex and interesting to implement.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I then realized that it was actually easily reduced into a mere few operations. I'm still doing the challenge, though.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Enough with the backstory. Let's go.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Method&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To divide two strings, do the following, where &lt;code&gt;x&lt;/code&gt; is the first string and &lt;code&gt;y&lt;/code&gt; the second:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;code&gt;x&lt;/code&gt; does not contain &lt;code&gt;y&lt;/code&gt;, return a space and a period concatenated to &lt;code&gt;x&lt;/code&gt;.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For example, &lt;code&gt;testx&lt;/code&gt; and &lt;code&gt;blah&lt;/code&gt; would become &lt;code&gt;.textx&lt;/code&gt;, with a space at the beginning.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, return every occurrence of &lt;code&gt;y&lt;/code&gt; in &lt;code&gt;x&lt;/code&gt;, a period, then &lt;code&gt;y&lt;/code&gt; divided by &lt;code&gt;x&lt;/code&gt; with every occurrence of &lt;code&gt;y&lt;/code&gt; removed, with all the periods removed.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For example, &lt;code&gt;eestestst&lt;/code&gt; and &lt;code&gt;est&lt;/code&gt; would become &lt;code&gt;estest.est&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that, given two strings via &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;standard input&lt;/a&gt;, returns the first string divided by the second.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may assume that neither input string contains a space, newline or period, and that the operation does not require more than 10 layers of recursion.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;test, es =&amp;gt; es. es&#xA;test, blah =&amp;gt;  .test&#xA;okayye, y =&amp;gt; yy. y&#xA;testes, es =&amp;gt; eses. es&#xA;battat, at =&amp;gt; atat. at&#xA;see, es =&amp;gt;  .see&#xA;see, e =&amp;gt; ee. e&#xA;same, same =&amp;gt; same. &#xA;aabb, ab =&amp;gt; ab.ab &#xA;eestestst, est =&amp;gt; estest.est&#xA;aheahahe, aheah =&amp;gt; aheah.aheah ah&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the submission with the least amount of bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Have I missed anything?&lt;/li&gt;&#xA;&lt;li&gt;Does anything need further explaining?&lt;/li&gt;&#xA;&lt;li&gt;Is there an issue with the concept of the challenge?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="70424" LastEditorUserId="70424" LastEditDate="2018-06-03T23:23:40.223" LastActivityDate="2018-06-03T23:23:40.223" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="16475" PostTypeId="1" CreationDate="2018-06-01T12:34:06.283" Score="2" ViewCount="112" Body="&lt;h1&gt;Sandbox : &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/16478/79762&quot;&gt;link&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h1&gt;Interpret BrainF**K :&lt;/h1&gt;&#xA;&lt;p&gt;This is usually a very common challenge on a lot of sites and on PPCG we also have this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/84/interpret-brainf?answertab=active#tab-top&quot;&gt;Interpret BF&lt;/a&gt;. I wanted to know if we could make a repost of that question or if we could relax the rules a bit.&lt;/p&gt;&#xA;&lt;p&gt;The rule that I wanted relaxed / reason for repost it :&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The program is read from a file.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The challenge is rather old, as in 7 years old.&lt;/p&gt;&#xA;&lt;h3&gt;Post Date : Jan 28, 11&lt;/h3&gt;&#xA;&lt;p&gt;So I don't think changing a 7 year old challenge is the wisest thing to do. (of course I can be wrong).&lt;/p&gt;&#xA;&lt;p&gt;I have already asked this question in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;nineteenth-byte&lt;/a&gt; and there users :&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;@user202729&lt;/li&gt;&#xA;&lt;li&gt;@Mr.Xcoder&lt;/li&gt;&#xA;&lt;li&gt;@ASCII-only&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;were kind enough to answer this. All in all they asked me to post this as a question on meta (which I believe I am doing)&lt;/p&gt;&#xA;&lt;h1&gt;Linked :&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1875/closing-old-question-as-duplicate-of-a-new-one&quot;&gt;Possible links in favor&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;So what I would like to know is whether we can make a repost of the challenge with the updated rules or whether the current challenge is okay ?&lt;/p&gt;&#xA;" OwnerUserId="79762" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-06-02T19:45:32.363" Title="Interpret BF (question on repost)" Tags="|discussion|code-golf|reposting|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16476" PostTypeId="2" ParentId="16475" CreationDate="2018-06-01T12:57:02.507" Score="7" Body="&lt;h3&gt;Put it in the Sandbox&lt;/h3&gt;&#xA;&lt;p&gt;While this is a very generic response that applies to just about every situation where somebody asks &amp;quot;should I post X question&amp;quot;, it remains valid here and I think it's the best option. Include in the Sandbox post a note acknowledging that a previous challenge exists which is similar enough to be a duplicate, but that you think it has resolvable quality issues that are best resolved with a new challenge. That will get the best feedback on what form the new question should take (I think there are other improvements possible than just removing the &amp;quot;read from file&amp;quot; requirement), and also gather additional opinions on whether it would be better to just overhaul the existing question.&lt;/p&gt;&#xA;&lt;p&gt;Creating new questions to &amp;quot;replace&amp;quot; older questions that are interesting but no longer &amp;quot;quality&amp;quot; has precedent so I think there's a good chance the Sandbox reaction will be positive.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-06-01T12:57:02.507" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16477" PostTypeId="2" ParentId="16475" CreationDate="2018-06-01T13:01:17.880" Score="2" Body="&lt;p&gt;There is already a question &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/824/duplicate-questions&quot;&gt;here&lt;/a&gt; with a few answers but your question is a bit of an extension on it so I won't vote it as duplicate. In general, the top and accepted answer says that reposting a challenge that's exactly identical is unnecessary, but if you kind of extend/modify it a bit, it could work out of the other challenge is dead already.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In general, it should be fine to repost old challenges with some sort of a change in the core of the challenge or its competitive aspect (scoring), but an I/O change is probably good enough as well for really old challenges. If a repost as nothing to add to the already existing challenge, then it probably isn't justified.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2018-06-01T13:01:17.880" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16478" PostTypeId="2" ParentId="2140" CreationDate="2018-06-01T14:38:27.357" Score="-2" Body="&lt;ul&gt;&#xA;&lt;li&gt;This is in sandbox to check whether or not to repost the BrainF**k interpreter challenge. The links have been given in credits.&lt;/li&gt;&#xA;&lt;li&gt;Should comment handling be required.&lt;/li&gt;&#xA;&lt;li&gt;Also any other improvements are welcome&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;BrainF**k:&lt;/h1&gt;&#xA;&lt;p&gt;BrainF**k is an esoteric programming language designed in the 90s. The reason for its fame is that understanding a program longer than 10 characters in the language is quite hard.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example program :&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;++++++++[&amp;lt;++++++++&amp;gt;-]&amp;lt;++++++++++++++++.[-]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Guess what this does.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Commands:&lt;/h1&gt;&#xA;&lt;p&gt;Brainf**k operates on an array of memory cells, also referred to as the &lt;strong&gt;tape&lt;/strong&gt;, each initially set to &lt;code&gt;zero&lt;/code&gt;. There is a &lt;em&gt;pointer&lt;/em&gt;, initially pointing to the &lt;em&gt;first memory cell&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;There are a total of eight commands in BF and these are as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Command       |                              Purpose&#xA;  &amp;gt;           |      increment the data pointer (to point to the next cell to the right).&#xA;  &amp;lt;           |      decrement the data pointer (to point to the next cell to the left).&#xA;  +           |      increment (increase by one) the byte at the data pointer. &#xA;  -           |      decrement (decrease by one) the byte at the data pointer.&#xA;  .           |      output the byte at the data pointer&#xA;  ,           |      one byte of input, storing its value in the byte at the data pointer.&#xA;  [           |      if the byte at the data pointer is zero, then instead of moving the instruction pointer forward to the next command, jump it forward to the command after the matching ] command.&#xA;  ]           |      if the byte at the data pointer is nonzero, then instead of moving the instruction pointer forward to the next command, jump it back to the command after the matching [ command.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Note :&lt;/h1&gt;&#xA;&lt;p&gt;&lt;code&gt;+&lt;/code&gt; and &lt;code&gt;-&lt;/code&gt; operators increment and decrement the bytes at the at the data pointer, note that if the value reaches &lt;code&gt;255&lt;/code&gt; then upon a &lt;code&gt;+&lt;/code&gt; it would become &lt;code&gt;0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;255 + 1 = 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Similarly if the value reaches &lt;code&gt;0&lt;/code&gt; then upon the next &lt;code&gt;-&lt;/code&gt; it would become &lt;code&gt;255&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 - 1 = 255&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Input:&lt;/h1&gt;&#xA;&lt;p&gt;You will be given two strings as input:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The actual BrainF**k code that you are supposed to interpret.&lt;/li&gt;&#xA;&lt;li&gt;the program input (&lt;code&gt;that will eventually be emptied&lt;/code&gt;) to be interpreted as an array of bytes using each character's ASCII code and will be consumed by the &lt;code&gt;,&lt;/code&gt; instruction&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Example:&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;Program : +[,&amp;gt;,]&amp;lt;.&#xA;stdin   : 11111 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Output:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the output of the interpreted code, if any was produced by the &lt;code&gt;.&lt;/code&gt; instruction.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Example:&lt;/h1&gt;&#xA;&lt;p&gt;For the above mentioned program, the output should be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;output: 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Notes:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Both &lt;code&gt;program&lt;/code&gt; and &lt;code&gt;stdin&lt;/code&gt; will be given as strings.&lt;/li&gt;&#xA;&lt;li&gt;The output should be a string showing the result after operations.&lt;/li&gt;&#xA;&lt;li&gt;Given input will always be valid, with a valid BrainF**k program.&lt;/li&gt;&#xA;&lt;li&gt;In order to avoid confusion, note that you do not need to output the word &lt;code&gt;output&lt;/code&gt; as well&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;e.g :&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; output : 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;in this your output should only be 1. (asked by @Picard)&lt;/p&gt;&#xA;&lt;h1&gt;Credits:&lt;/h1&gt;&#xA;&lt;p&gt;The question was (more or less) already asked &lt;a href=&quot;https://codegolf.stackexchange.com/questions/84/interpret-brainf&quot;&gt;here&lt;/a&gt;.&#xA;This has been reposted since that was 7 years old and was outdated as well.&lt;/p&gt;&#xA;&lt;p&gt;Meta posts on that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/16475/interpret-bf-question-on-repost&quot;&gt;Asked by me regarding my repost now.&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/824/duplicate-questions&quot;&gt;Another one, about reposts in general.&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1875/closing-old-question-as-duplicate-of-a-new-one?noredirect=1&amp;amp;lq=1&quot;&gt;Martin Ender's post about closing old questions in favor of new.&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Examples:&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;Program: +[&amp;gt;&amp;gt;&amp;gt;&amp;gt;+++++[-&amp;lt;++&amp;gt;]&amp;lt;[-&amp;lt;++++++++++&amp;gt;]&amp;lt;[-&amp;lt;&amp;lt;-&amp;gt;&amp;gt;]&amp;lt;&amp;lt;-[&amp;gt;-&amp;lt;[-]]&amp;gt;+&amp;lt;,]&amp;gt;[&amp;gt;&amp;gt;+&amp;gt;+&amp;lt;&amp;lt;&amp;lt;-]&amp;gt;&amp;gt;&amp;gt;[&amp;lt;&amp;lt;&amp;lt;+&amp;gt;&amp;gt;&amp;gt;-]&amp;lt;&amp;lt;+&amp;gt;[&amp;lt;-&amp;gt;[&amp;gt;++++++++++&amp;lt;[-&amp;gt;-[&amp;gt;+&amp;gt;&amp;gt;]&amp;gt;[+[-&amp;lt;+&amp;gt;]&amp;gt;+&amp;gt;&amp;gt;]&amp;lt;&amp;lt;&amp;lt;&amp;lt;&amp;lt;]&amp;gt;[-]++++++++[&amp;lt;++++++&amp;gt;-]&amp;gt;[&amp;lt;&amp;lt;+&amp;gt;&amp;gt;-]&amp;gt;[&amp;lt;&amp;lt;+&amp;gt;&amp;gt;-]&amp;lt;&amp;lt;]&amp;gt;]&amp;lt;[-&amp;gt;&amp;gt;++++++++[&amp;lt;++++++&amp;gt;-]]&amp;lt;[.[-]&amp;lt;]&amp;lt;&#xA;stdin: Hello, World. This is a program for checking eeeeeeee. Well I have plenty of e&#xA;output: 14&#xA;&#xA;Program: ++++++++[&amp;gt;++++[&amp;gt;++&amp;gt;+++&amp;gt;+++&amp;gt;+&amp;lt;&amp;lt;&amp;lt;&amp;lt;-]&amp;gt;+&amp;gt;+&amp;gt;-&amp;gt;&amp;gt;+[&amp;lt;]&amp;lt;-]&amp;gt;&amp;gt;.&amp;gt;---.+++++++..+++.&amp;gt;&amp;gt;.&amp;lt;-.&amp;lt;.+++.------.--------.&amp;gt;&amp;gt;+.&amp;gt;++.&#xA;stdin: &#xA;output: Hello, World&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Winning-criteria:&lt;/h1&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes for each language wins.&lt;/p&gt;&#xA;" OwnerUserId="79762" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-06-02T09:25:56.393" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="16480" PostTypeId="1" CreationDate="2018-06-01T15:47:34.393" Score="12" ViewCount="482" Body="&lt;p&gt;In accordance with our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14645/16766&quot;&gt;meta agreement&lt;/a&gt; to have a Language of the Month, and since the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14737/16766&quot;&gt;list of nominations&lt;/a&gt; had a single highest-voted entry at the beginning of June, we have a new featured language! Throughout June 2018, our Language of the Month, nominated by DLosc, will be:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/QBasic&quot; rel=&quot;nofollow noreferrer&quot;&gt;QBasic&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h3&gt;What's a Language of the Month?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;See the meta posts linked above. In short, during June, those who wish to participate should learn (at least the basics of) QBasic, use it to solve challenges, and discuss it in the &lt;a href=&quot;https://chat.stackexchange.com/rooms/78269/qbasic&quot;&gt;QBasic chat room&lt;/a&gt;. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Information about QBasic&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;One of a long line of &lt;a href=&quot;https://en.wikipedia.org/wiki/BASIC&quot; rel=&quot;nofollow noreferrer&quot;&gt;BASIC&lt;/a&gt; dialects, QBasic was included with the DOS operating system starting in 1991, and subsequently with Windows 95 and 98. A whole generation of programmers&lt;sup&gt;[citation needed]&lt;/sup&gt; spent many happy hours using it to draw Mandelbrot sets, build dungeon-crawls, or play classical music. For those of us who grew up with it, the nostalgia factor is strong. But QBasic still has appeal for the hobbyist programmer today.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Despite being less capable in some ways than modern practical languages, QBasic has several features that make it fun to use:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Its imperative syntax is familiar and easy to learn, without the boilerplate of C and its descendants.&lt;/li&gt;&#xA;&lt;li&gt;Graphics, sound / music, and the rough equivalent of &lt;a href=&quot;https://en.wikipedia.org/wiki/Ncurses&quot; rel=&quot;nofollow noreferrer&quot;&gt;ncurses&lt;/a&gt; are built in, allowing for easy solutions to some challenges that would require specialized libraries in other languages.&lt;/li&gt;&#xA;&lt;li&gt;There are plenty of opportunities for golfing: rearranging control flow, rewriting conditionals, trying different input methods. Whitespace can be eliminated, the &lt;code&gt;PRINT&lt;/code&gt; command can be abbreviated as &lt;code&gt;?&lt;/code&gt;, strings at the ends of lines can omit the closing quote, etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Documentation&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;It's included in QBasic itself! Fire up the IDE, hit &lt;kbd&gt;Alt&lt;/kbd&gt;-&lt;kbd&gt;H&lt;/kbd&gt;, and make a selection from the Help menu. Or, type a keyword you want to learn about, put the cursor on it, and press &lt;kbd&gt;F1&lt;/kbd&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(Note: the help file in QB64 tends to be more explanatory than the one in actual QBasic.)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Other helpful links:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.schoolfreeware.com/QBasic_Tutorials_-_QB64_Tutorials_-_Programming_And_Code_Examples.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;A tutorial&lt;/a&gt; that looks like it covers most of the basics.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.qbasic.net/en/reference/qb11/overview.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;A stripped-down language reference online&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/47321/16766&quot;&gt;Entry in the showcase of languages&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/147625/16766&quot;&gt;Golfing tips&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For help, you can also visit the &lt;a href=&quot;https://chat.stackexchange.com/rooms/78269/qbasic&quot;&gt;QBasic chatroom&lt;/a&gt;. If no one's there, reply to one of &lt;a href=&quot;https://chat.stackexchange.com/users/128226&quot;&gt;@DLosc&lt;/a&gt;'s messages and he will get back to you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(If you consider yourself knowledgeable in QBasic and would like to help teach it to other users, feel free to add your name to the list!)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Interpreters&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7138/16766&quot;&gt;installation and testing instructions&lt;/a&gt; for more details. TL;DR: your best options (in ascending order of how much work they are to set up) are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://archive.org/details/msdos_qbasic_megapack&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Archive.org&lt;/strong&gt;&lt;/a&gt; (original QBasic, running in a DOS emulator, made available online)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://qb64.net/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;QB64&lt;/strong&gt;&lt;/a&gt; (downloadable QBasic emulator with &gt; 95% compatibility)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.qbasic.net/en/qbasic-downloads/compiler/qbasic-interpreter.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Original QBasic&lt;/strong&gt;&lt;/a&gt; (can be downloaded and run on DOS, pre-XP Windows, or a DOS emulator such as &lt;a href=&quot;http://www.dosbox.com/wiki/Main_Page&quot; rel=&quot;nofollow noreferrer&quot;&gt;DOSBox&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;&lt;code&gt;?&quot;Happy golfing!&lt;/code&gt;&lt;/h1&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="31716" LastEditDate="2018-07-02T05:20:22.427" LastActivityDate="2018-07-05T17:54:21.073" Title="Language of the Month for June 2018: QBasic" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16481" PostTypeId="2" ParentId="16480" CreationDate="2018-06-01T15:58:58.843" Score="5" Body="&lt;h1&gt;List of &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=%22%23+QBasic%22+created%3A2018-05-31..2018-06-30+is%3Aanswer&quot;&gt;all QBasic solutions posted&lt;/a&gt; in June&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/165963&quot;&gt;Diamond creator +&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80888&quot;&gt;Corwin Fjeldstrom&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/165970&quot;&gt;Print a Tabula Recta&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766&quot;&gt;DLosc&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/166096&quot;&gt;Exchange capitalization&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766&quot;&gt;DLosc&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/166106/41024&quot;&gt;What surrounds my Minesweeper tile?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/41024/erik-the-outgolfer&quot;&gt;Erik the Outgolfer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/166166/41024&quot;&gt;X Steps Forward, 1 Step Back&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/41024/erik-the-outgolfer&quot;&gt;Erik the Outgolfer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/166168/41024&quot;&gt;X Steps Forward, 1 Step Back&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/41024/erik-the-outgolfer&quot;&gt;Erik the Outgolfer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/166234/16766&quot;&gt;X Steps Forward, 1 Step Back&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766&quot;&gt;DLosc&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/166253/16766&quot;&gt;Parse a list of signed unary numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766&quot;&gt;DLosc&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/166371/44874&quot;&gt;Count ones in range&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/44874/steenbergh&quot;&gt;steenbergh&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/166466/16766&quot;&gt;Golf A Parentheses Matching Algorithm&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78123/wastl&quot;&gt;wastl&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/166482/44874&quot;&gt;Is this number a repdigit?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/44874/steenbergh&quot;&gt;steenbergh&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/166554/44874&quot;&gt;Which Card is it?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/44874/steenbergh&quot;&gt;steenbergh&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/166690/44874&quot;&gt;Generate a deck of cards&lt;/a&gt;  by &lt;a href=&quot;https://codegolf.stackexchange.com/users/44874/steenbergh&quot;&gt;steenbergh&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/166932/41024&quot;&gt;Diagonal Alphabet&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/41024/erik-the-outgolfer&quot;&gt;Erik the Outgolfer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/166939/41024&quot;&gt;Replace me by the sum of my cyclic successors!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/41024/erik-the-outgolfer&quot;&gt;Erik the Outgolfer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167069/41024&quot;&gt;Print the digital root&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/41024/erik-the-outgolfer&quot;&gt;Erik the Outgolfer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167073/41024&quot;&gt;Merge two values&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/41024/erik-the-outgolfer&quot;&gt;Erik the Outgolfer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167086/16766&quot;&gt;Merge two values&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766&quot;&gt;DLosc&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167091/16766&quot;&gt;Merge two values&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766&quot;&gt;DLosc&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167092/16766&quot;&gt;Semi-Diagonal Alphabet&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766&quot;&gt;DLosc&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167102/16766&quot;&gt;Is this number a repdigit?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766&quot;&gt;DLosc&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167103/16766&quot;&gt;Create and write to a file&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766&quot;&gt;DLosc&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167172/16766&quot;&gt;Find the Squarish Root&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/44874/steenbergh&quot;&gt;steenbergh&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167277/16766&quot;&gt;Recover the prime from the prime power&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766&quot;&gt;DLosc&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167279/16766&quot;&gt;Recover the power from the prime power&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766&quot;&gt;DLosc&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167329/16766&quot;&gt;The Jumping Up Sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766&quot;&gt;DLosc&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167356/41024&quot;&gt;Let's design a digit mosaic&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/41024/erik-the-outgolfer&quot;&gt;Erik the Outgolfer&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167378/78123&quot;&gt;ASCII Ball in Box Animation&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78123/wastl&quot;&gt;wastl&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167477/16766&quot;&gt;Alpha-Numerical Bowtie&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/61846&quot;&gt;Taylor Scott&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167522/16766&quot;&gt;Alpha-Numerical Bowtie&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766&quot;&gt;DLosc&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167557/16766&quot;&gt;Could you make me a hexagon please?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766&quot;&gt;DLosc&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167638/16766&quot;&gt;Consecutive 1-Bits are Incremented&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766&quot;&gt;DLosc&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167610/61846&quot;&gt;Reverse ASCII character map&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/61846&quot;&gt;Taylor Scott&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167547/61846&quot;&gt;Let's design a digit mosaic&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/61846&quot;&gt;Taylor Scott&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;List of &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=inquestion%3A147625+created%3A2018-05-31..2018-06-30+is%3Aanswer&quot;&gt;all QBasic tips posted&lt;/a&gt; in June&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/166130&quot;&gt;Shortening &lt;code&gt;IF&lt;/code&gt; statements&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766&quot;&gt;DLosc&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/166643/44874&quot;&gt;Avoid Arrays&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/44874/steenbergh&quot;&gt;steenbergh&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167081/16766&quot;&gt;&lt;code&gt;WRITE&lt;/code&gt; may be useful in place of &lt;code&gt;PRINT&lt;/code&gt;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766&quot;&gt;DLosc&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167606/16766&quot;&gt;Combine Next Statements&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/61846&quot;&gt;Taylor Scott&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;tip title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;List of QBasic-related challenges posted in June&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/q/&amp;lt;question-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="61846" LastEditDate="2018-07-05T17:54:21.073" LastActivityDate="2018-07-05T17:54:21.073" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16483" PostTypeId="2" ParentId="16464" CreationDate="2018-06-02T10:08:51.513" Score="1" Body="&lt;h1&gt;Post on meta&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Although meta is for discussions about the main site, so far nobody (as far as I know) has done it, because they all have comment privileges. They should be on-topic. &lt;sub&gt;(downvote if you disagree)&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Good thing is, unlike other meta sites it only takes 1 reputation to post on PPCG Meta (instead of 5).&lt;/p&gt;&#xA;" OwnerUserId="69850" LastActivityDate="2018-06-02T10:08:51.513" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16484" PostTypeId="1" AcceptedAnswerId="16485" CreationDate="2018-06-02T17:22:24.977" Score="7" ViewCount="206" Body="&lt;p&gt;Let's consider &lt;a href=&quot;https://codegolf.stackexchange.com/a/58834/16766&quot;&gt;a QBasic solution to FizzBuzz&lt;/a&gt;. The code works correctly, printing the required output from &lt;code&gt;1&lt;/code&gt; all the way up. The problem is, since there's a lot of output, some of it scrolls off the screen. What you see when you run the program is this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Fizz&#xA;79&#xA;Buzz&#xA;Fizz&#xA;82&#xA;83&#xA;Fizz&#xA;Buzz&#xA;86&#xA;Fizz&#xA;88&#xA;89&#xA;FizzBuzz&#xA;91&#xA;92&#xA;Fizz&#xA;94&#xA;Buzz&#xA;Fizz&#xA;97&#xA;98&#xA;Fizz&#xA;Buzz&#xA;&#xA;Press any key to continue&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Unlike with C and its descendants, &lt;strong&gt;output is not a stream, but is sent directly to the screen&lt;/strong&gt;. This means that 1) you can't scroll back in the terminal and see the previous lines, &lt;s&gt;and 2) you can't redirect output to a file to save the lines&lt;/s&gt;.&lt;sup&gt;1&lt;/sup&gt; Once they scroll off the screen, they're gone.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;So is this a valid FizzBuzz program, if it doesn't &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10002/16766&quot;&gt;observably&lt;/a&gt; display all 100 lines?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If not, does it help to add a 1-second pause or wait for user keypress after printing each line?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; Erik the Outgolfer informs me that redirecting output to a file &lt;em&gt;is&lt;/em&gt; possible when running QBasic in DOSBox (or in actual DOS, presumably). So that takes away the specific example I used here. I think the general question is still good to ask and might apply in some cases--for example, if &lt;code&gt;LOCATE&lt;/code&gt; is used, as this isn't recorded in the output buffer.&lt;/p&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="16766" LastEditDate="2018-06-05T00:23:43.923" LastActivityDate="2018-06-05T13:06:16.760" Title="Does output count if part of it scrolls off the screen?" Tags="|discussion|rules|output|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16485" PostTypeId="2" ParentId="16484" CreationDate="2018-06-03T00:09:01.500" Score="25" Body="&lt;h2&gt;Yes, output counts even if you can't see it anymore&lt;/h2&gt;&#xA;&lt;p&gt;The output definitely happened - you just can't see it because additional output caused it to go out of the limited screen space. Just like closing your eyes doesn't make everything poof out of existence&lt;sup&gt;1&lt;/sup&gt;, stuff scrolling out of view in a window doesn't mean it didn't happen.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;[1] unless you haven't developed object permanence, or you follow solipsism&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-06-03T00:09:01.500" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16487" PostTypeId="2" ParentId="2140" CreationDate="2018-06-03T09:56:16.410" Score="2" Body="&lt;h1&gt;Base 18 &amp;amp; Decimal traffic light&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a number &lt;code&gt;n&amp;lt;180&lt;/code&gt;, output the &lt;code&gt;n/10&lt;/code&gt; part and the &lt;code&gt;n%10&lt;/code&gt; part in 7-seg. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;7-seg shapes:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 000         222   333         555   666   777   888   999   AAA         CCC         EEE   FFF   GGG&#xA;0   0     1     2     3 4   4 5     6         7 8   8 9   9 A   A B     C         D E     F     G     H   H&#xA;0   0     1     2     3 4   4 5     6         7 8   8 9   9 A   A B     C         D E     F     G     H   H&#xA;0   0     1     2     3 4   4 5     6         7 8   8 9   9 A   A B     C         D E     F     G     H   H&#xA;             222   333   444   555   666         888   999   AAA   BBB         DDD   EEE   FFF         HHH&#xA;0   0     1 2         3     4     5 6   6     7 8   8     9 A   A B   B C     D   D E     F     G   G H   H&#xA;0   0     1 2         3     4     5 6   6     7 8   8     9 A   A B   B C     D   D E     F     G   G H   H&#xA;0   0     1 2         3     4     5 6   6     7 8   8     9 A   A B   B C     D   D E     F     G   G H   H&#xA; 000         222   333         555   666         888   999         BBB   CCC   DDD   EEE         GGG&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Either led on or (led off&amp;amp;background) should be constant, and the left characters mean the other state, or&lt;/li&gt;&#xA;&lt;li&gt;At least two of your background, led on and led off should be constant, and the left characters mean the left state.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-06-06T10:55:51.247" LastActivityDate="2018-06-06T10:55:51.247" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16488" PostTypeId="2" ParentId="2140" CreationDate="2018-06-03T18:44:38.537" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot;&gt;sorting&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;A sort of cyclic program to string together&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program that sorts a string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, it does some other things too:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;When given a non-sorted string (that is not your source code), outputs the string in non-descending ASCII code order, as expected.&lt;/li&gt;&#xA;&lt;li&gt;When given a sorted string, outputs your program's source code but sorted.&lt;/li&gt;&#xA;&lt;li&gt;When given your source code but sorted, outputs the original source code.&lt;/li&gt;&#xA;&lt;li&gt;When given your source code (not sorted), outputs any nonempty string that is none of the above outputs &#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;i.e. Your program cannot output a sorted string and therefore must be at least two characters, and it cannot output your original source code&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;As a result, consider &lt;code&gt;input string -&amp;gt; output string&lt;/code&gt;. If you're starting with any non source code unsorted string: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program will start with &lt;code&gt;given unsorted string -&amp;gt; given string sorted&lt;/code&gt;. This sorted string can then be input to your program again resulting in &lt;code&gt;given string sorted -&amp;gt; source code sorted&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;If you continue to inputting what the program produced as output, it will then cycle through &lt;code&gt;source code sorted -&amp;gt; source code -&amp;gt; chosen unsorted string -&amp;gt; chosen string sorted -&amp;gt; source code sorted&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Let your program be &lt;code&gt;foobar&lt;/code&gt;. Consider the following examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-- Case 1 (unsorted string -&amp;gt; sorted string) --&#xA;&#xA;Input:  Programming Puzzles &amp;amp; Code Golf&#xA;Output:     &amp;amp;CGPPadeefggillmmnooorrsuzz&#xA;&#xA;Input:  &#xA;This is an unsorted string&#xA;Hey look a newline&#xA;Output: &#xA;&#xA;       HTaadeeeeghiiiikllnnnnnooorrssssttuwy&#xA;&#xA;-- Case 2 (sorted string -&amp;gt; sorted source code) --&#xA;&#xA;Input:  123ABCDabcd&#xA;Output: abfoor&#xA;&#xA;Input:      &amp;amp;CGPPadeefggillmmnooorrsuzz&#xA;Output: abfoor&#xA;&#xA;Input:  a&#xA;Output: abfoor&#xA;&#xA;-- Case 3 (sorted source code -&amp;gt; unsorted source code) --&#xA;&#xA;Input:  abfoor&#xA;Output: foobar&#xA;&#xA;-- Case 4 (unsorted source code -&amp;gt; unsorted string) --&#xA;&#xA;Input:  foobar&#xA;Output: a1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Using the last example, if your program outputs &lt;code&gt;a1&lt;/code&gt; as your chosen string, then it will continue to cycle through &lt;code&gt;a1 -&amp;gt; 1a -&amp;gt; abfoor -&amp;gt; foobar -&amp;gt; a1&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Specifications&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input and output are both strings&lt;/li&gt;&#xA;&lt;li&gt;Your source code can't already be in sorted order since there are two different actions depending on whether or not it is sorted&lt;/li&gt;&#xA;&lt;li&gt;Standard I/O methods apply and standard loopholes forbidden&lt;/li&gt;&#xA;&lt;li&gt;This is code golf so shortest answer in bytes wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Usually I have some sort of solution for a challenge but I have absolutely no idea how to go about doing this. I liked the idea though and wanted to know if it's original and if it's clear enough.&lt;/p&gt;&#xA;" OwnerUserId="72273" LastActivityDate="2018-06-03T18:44:38.537" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16492" PostTypeId="2" ParentId="2140" CreationDate="2018-06-04T12:16:18.933" Score="0" Body="&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;Often computers are used to perform consecutive jobs. Sometimes the order of doing these jobs does not matter. Other times there are dependencies between jobs that restrict the order that jobs can be performed. Additionally, jobs may require significant resources to store results, so it may be necessary to first schedule those jobs that will consume previous results before performing jobs that produce even more results. Furthermore, there may be significant costs to change from one type of job to another. The challenge then becomes finding the optimal execution order of jobs.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Allow me to illustrate the problem with an example. Consider a list of 10 jobs, numbered 0 to 9. Each of these jobs can be dependent on zero or more other jobs. (Assume there are no circular dependencies.) For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Job : Dependent on&#xA;---   ------------&#xA;0   : 8&#xA;1   : 6&#xA;2   :&#xA;3   : 0 6 9&#xA;4   : 7 9&#xA;5   : 2&#xA;6   : 4 8&#xA;7   :&#xA;8   : 9&#xA;9   :&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This can be illustrated graphically as follows:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/PBrG0.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/PBrG0.png&quot; alt=&quot;Illustration&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;One possible solution to this particular example is to perform the 10 jobs in the order: &lt;code&gt;9 8 7 4 6 0 2 1 3 5&lt;/code&gt; While this solution satisfies the dependency requirements, it is not ideal. To see why, let us perform the jobs one at a time:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Job : Results stored in memory&#xA;---   ------------------------&#xA;9   : 9&#xA;8   : 8 9&#xA;7   : 7 8 9&#xA;4   : 4 8 9&#xA;6   : 6 8 9&#xA;0   : 0 6 9&#xA;2   : 0 2 6 9&#xA;1   : 0 1 2 6 9&#xA;3   : 1 2 3&#xA;5   : 1 3 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;After performing the first job (job 9), we only have the result of job 9 in memory. After performing job 8 we need to store the results of 8 and 9, and after job 7 we have the results of jobs 7, 8 and 9. After performing job 4 we find that the results of job 7 is no longer needed and we can discard that, leaving only the results of job 4, 8 and 9. Carrying on we find that the worst case memory usage is after job 1 when we have to store the results of 5 different jobs (0, 1, 2, 6 and 9).&lt;/p&gt;&#xA;&lt;p&gt;As it turns out there is a better solution to this example, and that is to do the jobs in the order: &lt;code&gt;7 9 4 8 6 0 3 2 5 1&lt;/code&gt; The memory usage is then:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Job : Results stored in memory&#xA;---   ------------------------&#xA;7   : 7&#xA;9   : 7 9&#xA;4   : 4 9&#xA;8   : 4 8 9&#xA;6   : 6 8 9&#xA;0   : 0 6 9&#xA;3   : 3 6&#xA;2   : 2 3 6&#xA;5   : 3 5 6&#xA;1   : 1 3 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This time we only ever needed to store the results of 3 jobs in memory, instead of the 5 in the previous solution.&lt;/p&gt;&#xA;&lt;p&gt;Finally, consider that each job is of a certain &amp;quot;type&amp;quot;, and changing from one type to another is something that should be avoided. For example, let's say we have 3 types of jobs: A, B and C, and our 10 jobs in the example have the following types: Jobs 0-3 is type A, jobs 4-7 is type B, and jobs 8 and 9 is type C.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Job : Results stored in memory : Job Type Change&#xA;---   ------------------------ : ---------------&#xA;7   : 7                          B&#xA;9   : 7 9                        C&#xA;4   : 4 9                        B&#xA;8   : 4 8 9                      C&#xA;6   : 6 8 9                      B&#xA;0   : 0 6 9                      A&#xA;3   : 3 6                        .&#xA;2   : 2 3 6                      .&#xA;5   : 3 5 6                      B&#xA;1   : 1 3 5                      A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;As you can see, we had to change the job type 8 times: &lt;code&gt;B C B C B A B A&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;When minimizing job changes, while still keeping maximum memory usage to 3, we now find that the optimal solution is: &lt;code&gt;9 8 7 4 6 0 3 1 2 5&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Job : Results stored in memory : Job Type Change&#xA;---   ------------------------ : ---------------&#xA;9   : 9                          C&#xA;8   : 8 9                        .&#xA;7   : 7 8 9                      B&#xA;4   : 4 8 9                      .&#xA;6   : 6 8 9                      .&#xA;0   : 0 6 9                      A&#xA;3   : 3 6                        .&#xA;1   : 1 3                        .&#xA;2   : 1 2 3                      .&#xA;5   : 1 3 5                      B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This solution require only 4 job type changes (&lt;code&gt;C B A B&lt;/code&gt;), while still only needing memory to store 3 results.&lt;/p&gt;&#xA;&lt;p&gt;The solutions to this example that I presented here was found using a brute force search, ie going through every permutation of job order. From doing this I can tell you that this example has 1485 solutions that satisfy the dependency requirements. Of these 1485 solutions only 15 solutions require memory for no more than 3 results. Of these 15 solutions only 2 require only 4 job changes. The one is shown above (&lt;code&gt;9 8 7 4 6 0 3 1 2 5&lt;/code&gt;). The other is: &lt;code&gt;9 8 7 4 6 0 3 2 1 5&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Unfortunately, brute force is not viable when the total number of jobs increase beyond 10, eg 100. The challenge is to come up with an algorithm that can find the optimal solution (or any one of them if there are more than one) using an algorithm that significantly outperforms brute force.&lt;/p&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;The input to the algorithm is a list of N jobs numbered 0 to N-1, each with a job type (A-Z) followed by a list of zero or more dependencies, eg:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0, A, 8&#xA;1, A, 6&#xA;2, A&#xA;3, A, 0 6 9&#xA;4, B, 7 9&#xA;5, B, 2&#xA;6, B, 4 8&#xA;7, B&#xA;8, C, 9&#xA;9, C&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The output of the algorithm is the optimal execution order, eg:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;9 8 7 4 6 0 3 1 2 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Answers may be presented in any programming language or even pseudo code. I will translate them all to C++ and test them for correctness against the brute force algorithm using randomly generated inputs. The winner will be the algorithm that is fastest (and correct).&lt;/p&gt;&#xA;" OwnerUserId="80917" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-06-04T12:16:18.933" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16494" PostTypeId="2" ParentId="2140" CreationDate="2018-06-04T23:03:21.107" Score="1" Body="&lt;h1&gt;Reverse Engineering RNG&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random-number-generator&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random-number-generator&amp;#39;&quot; rel=&quot;tag&quot;&gt;random-number-generator&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Intro to both&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Pseudorandom number generators are used for simulation and security. While most are appropriate for games and simulations (appropriateness depends on statistical properties), only a select few algorithms are appropriate for security because most of the others are too predictable and can introduce severe vulnerabilities. This challenge should (hopefully) demonstrate how easily some algorithms can be cracked and why the choice of RNG algorithm matters for security.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Cops&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Choose/implement/create a pseudorandom number generator, seed it with a constant state, generate the first 10,000 32-bit unsigned integers, and link to it from your post. The robbers will be trying to make a program that generates the same sequence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your post should include:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The total number of bits of state used by the generator. For example the well-known &lt;a href=&quot;https://en.wikipedia.org/wiki/Mersenne_Twister&quot; rel=&quot;nofollow noreferrer&quot;&gt;Mersenne Twister&lt;/a&gt; has 19,937 bits of state.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Note that if you're using multiple RNG algorithms together, you will have to show the combined count of bits of state.&lt;/li&gt;&#xA;&lt;li&gt;Any randomness used to seed the generator does not count toward this value, though the seed must be constant.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;A link to the generated sequence of 32-bit unsigned integers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;DO NOT&lt;/em&gt; post the source code of your generator. That's what the robbers are trying to figure out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A submission is considered &quot;cracked&quot; if a robber has made a program that generates the exact same sequence. &lt;em&gt;Therefore it is necessary that a robber determine not only the algorithm, but also the initial state of your generator&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&quot;Bits of State&quot; Explanation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Every random number generator has a state that is used to determine the next number in the sequence and every number thereafter. Each time a number is used, the state is convoluted in some way and a random number is emitted. The minimum number of binary bits required to store this state will be your &quot;bits of state&quot; count. If you were using a 32-bit &lt;a href=&quot;https://en.wikipedia.org/wiki/Linear_congruential_generator&quot; rel=&quot;nofollow noreferrer&quot;&gt;linear congruential generator&lt;/a&gt;, you would have 32 bits of state. If you were using an LCG with a modulus of 123,456,789, you would have 27 bits of state because 27 bits is the minimum number of bits required to represent every integer between 0 and 123,456,788, inclusive, even if such a state would actually be stored on a 32-bit integer.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules and Scoring&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All state must be self-contained within your generator and your program should generate the exact same sequence every time it is run.&lt;/li&gt;&#xA;&lt;li&gt;You may not use &lt;em&gt;any&lt;/em&gt; external sources of entropy, including uninitialized memory, wall time, input, atmospheric noise, network latency, etc...&lt;/li&gt;&#xA;&lt;li&gt;If using an existing algorithm, you will need to make sure to do your research to ensure that the generator meets the above requirements. You may need to seed it manually to ensure that.&lt;/li&gt;&#xA;&lt;li&gt;There are no statistical restrictions on your sequence: it does not have to pass any statistical tests and can fit any distribution you would like, so long as it fits within the range of an unsigned 32-bit integer.&lt;/li&gt;&#xA;&lt;li&gt;The source code to the program used to generate your sequence cannot be larger than 4 KB.&lt;/li&gt;&#xA;&lt;li&gt;A submission that has not been cracked in 168 hours (1 week) will be considered &quot;safe&quot;.&lt;/li&gt;&#xA;&lt;li&gt;The &quot;safe&quot; submission with the fewest number of bits of state is the winner.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Robbers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Choose a Cop submission from the other thread (link) and crack its random number generator. It will be considered cracked if you can recreate the sequence exactly.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules and Scoring&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Hard-coding the sequence is not allowed.&lt;/li&gt;&#xA;&lt;li&gt;Your program is limited to 4KB&lt;/li&gt;&#xA;&lt;li&gt;Your generator does not need to have the same state size as long as it generates the same sequence. In practice, this will be necessary unless the RNG used is a really bad algorithm.&lt;/li&gt;&#xA;&lt;li&gt;For each successful crack of a not-yet-safe random number sequence, you will score points according to the number of bits of state used by the generator:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1-32 bits: 1 point&lt;/li&gt;&#xA;&lt;li&gt;33-128 bits: 2 points&lt;/li&gt;&#xA;&lt;li&gt;129-1024 bits: 3 points&lt;/li&gt;&#xA;&lt;li&gt;1025-8192 bits: 5 points&lt;/li&gt;&#xA;&lt;li&gt;8193-65536 bits: 8 points&lt;/li&gt;&#xA;&lt;li&gt;More than 65536 bits: 13 points&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2018-06-07T15:56:41.923" LastActivityDate="2018-06-07T15:56:41.923" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="16496" PostTypeId="2" ParentId="16484" CreationDate="2018-06-05T13:06:16.760" Score="1" Body="&lt;h1&gt;It depends&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It depends on what you defines to be the &quot;output&quot; -- it's up to you. In particular:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If you let the output be &quot;the content on the screen when the program terminates&quot;, it doesn't count.&lt;/li&gt;&#xA;&lt;li&gt;If you let the output be &quot;whatever the program writes&quot;, it does count.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is just a small part of &quot;specify your output format&quot; (stdout/stderr/screen).&lt;/p&gt;&#xA;" OwnerUserId="69850" LastActivityDate="2018-06-05T13:06:16.760" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16497" PostTypeId="1" AcceptedAnswerId="16498" CreationDate="2018-06-05T14:21:11.547" Score="14" ViewCount="302" Body="&lt;p&gt;Recently I've been posting a lot of challenges on the site. This is because I am in a class where the homework are programming challenges (Algorithm Class). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is that OK? or should I stop posting them? I ask because I know this is not site for homework (Yes, the answers helps me to create better algorithms)&lt;/p&gt;&#xA;" OwnerUserId="78039" LastActivityDate="2018-06-05T14:49:16.177" Title="Creating challenges from homework." Tags="|discussion|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16498" PostTypeId="2" ParentId="16497" CreationDate="2018-06-05T14:49:16.177" Score="17" Body="&lt;h1&gt;Depends&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If you just come here and post &quot;hi please help I am new to Python have to make program print 1 to 100 please give me code&quot; then no. If you post an actual on-topic challenge-formatted question that adds something to the site, it doesn't really matter whether or not it was homework (unless your exact homework was to golf your code. I hope not).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Really, the two things we need to consider: is it on-topic, and do you deserve credit for it?&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Is it on-topic?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;That depends on whether or not you made it on-topic. Whether or not it's on-topic has nothing to do with whether or not it's inspired by your homework or not, but just based on how you made it.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Do you deserve credit for it?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Probably. Since your homework relies on certain algorithms that you can then adapt into code-golf challenges, it's really no different from creating a challenge from an already known sequence or a known algorithm. The point is that you still had to put forth the effort to extract the algorithms from the problem and adapt it into a PPCG-on-topic challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Overall, as long as you didn't just copy-paste and it's on-topic, I don't see a problem with it.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2018-06-05T14:49:16.177" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="16499" PostTypeId="1" CreationDate="2018-06-05T15:40:05.323" Score="1" ViewCount="129" Body="&lt;p&gt;(mostly for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt;. For &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt; it's the algorithm that matters, not the code. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4687/do-all-challenges-have-to-be-answered-with-code&quot;&gt;Answers without code are allowed&lt;/a&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Consider a simple function: (where &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; are integers)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;lambda a,b:a+b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;What should be the time complexity of this function?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If it's &lt;code&gt;O(log(a)+log(b))&lt;/code&gt;, most of the current &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt; challenges are impossible. For example &lt;a href=&quot;https://codegolf.stackexchange.com/questions/5522/generate-the-list-1-0-1-0-1-0-1-0&quot;&gt;this&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If it's &lt;code&gt;O(1)&lt;/code&gt;, that opens too much rooms for abuse. For example you can manipulate strings (with fixed alphabet with size A) in O(1), by using its base-A representation.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Example of a possible abuse, assuming the consensus is all arithmetic operations take O(1):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a string &lt;code&gt;s&lt;/code&gt; consisting of characters in range &lt;code&gt;['a' .. 'i']&lt;/code&gt;. We can do the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def encode(s):&#xA; a=0&#xA; for ch in s:&#xA;  a=a*10+ord(ch)-96&#xA; return a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;That way the characters in &lt;code&gt;s&lt;/code&gt; are encoded into &lt;code&gt;a&lt;/code&gt; ('a' -&gt; 1, 'b' -&gt; 2, ..., 'i' -&gt; 9). Assume arithmetic operations take &lt;code&gt;O(1)&lt;/code&gt;, this takes linear &quot;time&quot;. For example if &lt;code&gt;s == 'abcdedcba'&lt;/code&gt;, &lt;code&gt;a == 123454321&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now checking whether two substrings of &lt;code&gt;s&lt;/code&gt; are equal can take constant &quot;time&quot;. Like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;encode(s[i:]) == encode(s)//10**i&#xA;encode(s[:i]) == encode(s)%10**i&#xA;encode(s[a:b]) == encode(s[:b][a:])&#xA;(s[a:b] == s[c:d]) == (  encode(s[a:b]) == encode(s[c:d])  )&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that the right hand sides can be evaluated in constant number of arithmetic operations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Similarly it's possible to check if a substring of a string is palindromic in constant &quot;time&quot;, with linear &quot;time&quot; preparation.&lt;/p&gt;&#xA;" OwnerUserId="69850" LastEditorUserId="69850" LastEditDate="2018-06-06T06:29:12.273" LastActivityDate="2018-06-06T06:29:12.273" Title="How strict are we with [restricted-complexity]?" Tags="|discussion|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16500" PostTypeId="2" ParentId="2140" CreationDate="2018-06-05T15:53:12.293" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I want to do this, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/162403/render-an-ascii-maze&quot;&gt;Render an ASCII maze&lt;/a&gt; but with ascii pipe characters.&lt;br&gt;&#xA;I know this is similar, but I think the extra logic required to figure out which character to put at each position makes this sufficiently different.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;here is what I am thinking of asking.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write code that replaces non whitespace characters in a string with ascii pipe characters depending on adjacency to other non-whitespace characters.&lt;br&gt;&#xA;this will create something like a maze where non-whitespace characters are the walls, and whitespace is abscence of walls&#xA;here are the rules&lt;/p&gt;&#xA;&#xA;&lt;p&gt;your code should take its input from stdin and output to stdout&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This table shows the correct output character for each combination of adjacent walls in directions: Left, Down, Up, and Right&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; L D U R -&amp;gt; Output&#xA; 0 0 0 0 -&amp;gt; any non-whitespace character&#xA; 1 0 0 0 -&amp;gt; ─&#xA; 0 0 0 1 -&amp;gt; ─&#xA; 1 0 0 1 -&amp;gt; ─&#xA; 0 1 0 0 -&amp;gt; │&#xA; 0 0 1 0 -&amp;gt; │&#xA; 0 1 1 0 -&amp;gt; │&#xA; 1 1 0 0 -&amp;gt; ┐&#xA; 1 0 1 0 -&amp;gt; ┘&#xA; 0 1 0 1 -&amp;gt; ┌&#xA; 0 0 1 1 -&amp;gt; └&#xA; 1 1 1 0 -&amp;gt; ┤&#xA; 1 1 0 1 -&amp;gt; ┬&#xA; 1 0 1 1 -&amp;gt; ┴&#xA; 0 1 1 1 -&amp;gt; ├&#xA; 1 1 1 1 -&amp;gt; ┼&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;if characters are on the edge of a string then they should treat the outside as whitespace&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This will be a code golf challenge&lt;/p&gt;&#xA;" OwnerUserId="79127" LastEditorUserId="79127" LastEditDate="2018-06-06T17:44:20.793" LastActivityDate="2018-06-06T17:44:20.793" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16501" PostTypeId="2" ParentId="16499" CreationDate="2018-06-06T06:24:07.857" Score="4" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Consider a simple function:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;lambda a,b:a+b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;What should be the time complexity of this function?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't think a simple answer to this is possible. It depends on the context. If &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; are strings then it's O(n). If &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; are fixed-width integers then it's O(1). If &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; are explicitly big integers and the question says that arbitrarily large inputs must be handled then it's O(lg n). And if &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; are big integers because that's the language's only integer type, but the question doesn't say anything about input ranges, then I think it should be considered O(1) for fairness because that's what it would be if ported directly to a language with fixed-width integers.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;If it's &lt;code&gt;O(1)&lt;/code&gt;, that opens too much rooms for abuse. For example you can manipulate strings (with fixed alphabet with size A) in O(1), by using its base-A representation.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Here I disagree strongly. You can manipulate strings &lt;em&gt;of a bounded length&lt;/em&gt; in O(1) (or O(k) where k is the bound), but any answer which claims to manipulate arbitrary-sized strings in O(1) time should receive a comment, a downvote, and a delete vote after the OP has had time to correct it and hasn't done so.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Minor observations:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Example of a possible abuse, assuming the consensus is all arithmetic operations take O(1):&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is actually a stronger assumption than the one you had previously asked about. Even if we were to say that addition of integers is always O(1), that doesn't imply that exponentiation of integers is O(1).&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Similarly it's possible to check if a substring of a string is palindromic in constant &quot;time&quot;, with linear &quot;time&quot; preparation.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It's not immediately clear why this would be a problem. O(n + lg n) = O(n + 1). If you're doing more than O(n / lg n) subpalindrome checks, there are probably data structures which make those checks more efficient.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-06-06T06:24:07.857" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16502" PostTypeId="2" ParentId="2140" CreationDate="2018-06-06T14:54:42.280" Score="0" Body="&lt;h2&gt;&lt;em&gt;N&lt;/em&gt; represented with only &lt;code&gt;1&lt;/code&gt;s in any base from 2 to &lt;em&gt;N-2&lt;/em&gt;?&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This is mostly a less interesting special case of &lt;a href=&quot;https://codegolf.stackexchange.com/q/75623/194&quot;&gt;Repdigit Base Finding&lt;/a&gt; so I won't submit.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Any positive integer &lt;em&gt;N&lt;/em&gt; can be expressed as &lt;code&gt;11&lt;/code&gt; in base &lt;em&gt;N-1&lt;/em&gt; or as &lt;em&gt;N&lt;/em&gt; concatenated &lt;code&gt;1&lt;/code&gt;s in base 1. Let's call those the &lt;strong&gt;&lt;em&gt;trivial&lt;/em&gt;&lt;/strong&gt; cases in which &lt;em&gt;N&lt;/em&gt; can be represented using only &lt;code&gt;1&lt;/code&gt;s. Let's call any other &quot;all &lt;code&gt;1&lt;/code&gt;s&quot; representation &lt;strong&gt;&lt;em&gt;non-trivial&lt;/em&gt;&lt;/strong&gt;. Some examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;7 has an &quot;all &lt;code&gt;1&lt;/code&gt;s&quot; representation in base 2, so 7 has a &lt;strong&gt;&lt;em&gt;non-trivial&lt;/em&gt;&lt;/strong&gt; &quot;all &lt;code&gt;1&lt;/code&gt;s&quot; representation.&lt;/li&gt;&#xA;&lt;li&gt;16 has &lt;strong&gt;&lt;em&gt;no non-trivial&lt;/em&gt;&lt;/strong&gt; &quot;all &lt;code&gt;1&lt;/code&gt;s&quot; representation.&lt;/li&gt;&#xA;&lt;li&gt;11 itself has &lt;strong&gt;&lt;em&gt;no non-trivial&lt;/em&gt;&lt;/strong&gt; &quot;all &lt;code&gt;1&lt;/code&gt;s&quot; representation by my definition because it is &quot;all &lt;code&gt;1&lt;/code&gt;s&quot; in base 10, which is 11-1.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Provide a program/function that produces one of two distinct, consistent values for whether or not an integer &lt;em&gt;N&lt;/em&gt; &gt; 3 has a non-trivial &quot;all &lt;code&gt;1&lt;/code&gt;s&quot; representation in a base between 2 and &lt;em&gt;N-2&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="79980" LastEditorUserId="79980" LastEditDate="2018-06-08T18:23:15.547" LastActivityDate="2018-06-08T18:23:15.547" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="16504" PostTypeId="1" AcceptedAnswerId="16505" CreationDate="2018-06-06T18:54:41.527" Score="-2" ViewCount="143" Body="&lt;p&gt;So last question that I posted. i.e : &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/16503/answer-posting-method&quot;&gt;this&lt;/a&gt;, I wanted to ask because a specific new user whom I have warned almost on all answer he has posted (5-6) was not following, yet he keeps answering with &lt;strong&gt;snippets&lt;/strong&gt; and won't even reply to to comments. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So far 2 of his/her answers (they were on my challenges), I have had them deleted by voting. I am curious on what the mod take on that is ?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Are users allowed to continuously keep posting rubbish answers to challenges and we keep deleting them. All answers he posted ended in the low quality review (I know that since I reviewed most of 'em) and I am getting tired of telling him that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would like to know any policy on that or should I simply let him answer and mark his answers as ok on the low quality post queues ?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;User's name and profile not linked since I have no right to do that.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;innocent until proven guilty &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;rule applies&lt;/p&gt;&#xA;" OwnerUserId="79762" LastActivityDate="2018-06-06T19:15:36.297" Title="User disobeying rules?" Tags="|discussion|code-golf|answers|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16505" PostTypeId="2" ParentId="16504" CreationDate="2018-06-06T19:15:36.297" Score="11" Body="&lt;p&gt;On the first answer, post a &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/be-nice&quot;&gt;nice&lt;/a&gt;&lt;/strong&gt; comment, explaining why their post is invalid, and linking them to the relevant meta posts. Remember that this is most likely a new user, and you are representing the site to them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On all future interactions, flag it, cast a delete vote if you can, and move on. If it's really invalid, it will end up deleted. If not, you can ask about a specific case on meta.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;whom I have warned almost on all answer he has posted &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Don't do this. One comment is plenty. Feel free to go through and flag all the posts, but beyond that it's out of your hands. The community review queue or us mods will take it from there. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Commenting on every single one of their posts is unnecessary. Saying &lt;em&gt;How many times do I need to tell you&lt;/em&gt;, or &lt;em&gt;This is the fifth time I am telling you&lt;/em&gt; is agressive and borderline harassment. Calling their answers &quot;rubbish&quot; is similarly hostile.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I am getting tired of telling him that&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Than stop telling them! If you are frustrated by another user, you don't have to say anything to them. &lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2018-06-06T19:15:36.297" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16506" PostTypeId="1" CreationDate="2018-06-07T08:39:39.877" Score="6" ViewCount="187" Body="&lt;p&gt;It happens quite frequently that short answers (Title + Code) appear in the Low Quality review queue, due to the automatic flagging mechanisms. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In most cases, the answer &quot;Looks OK&quot;. However, there are cases where the answer was posted in good faith, but the output in some scenarios are incorrect, a new user has hardcoded the input or something similar.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In general, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990/31516&quot;&gt;the consensus seems to be&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If the answer is invalid without the poster's knowledge, it shouldn't&#xA;  be deleted without notifying the poster first and giving him &lt;strong&gt;some time&#xA;  to fix his mistake&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;[...] I think &lt;strong&gt;deleting an accidentally invalid answer on sight is an&#xA;  unnecessarily unpleasant experience for the poster&lt;/strong&gt;, [...]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Give the poster time to fix or self-delete his invalid answer&lt;/strong&gt;.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;If a sufficient amount of time has passed (say &lt;strong&gt;48 hours&lt;/strong&gt;) or the answer&#xA;  was deliberately invalid, flag the answer as in need of moderator&#xA;  intervention, providing an explanation of why it is invalid.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;When these answers appear in the review queues, it feels wrong to choose: &quot;Looks OK&quot;, since it's actually an invalid answer. This might lead to the answer going undeleted indefinitely, unless someone flags it (or votes to delete) after 48 hours have passed. Users can't be expected to go back and check on an answer two days later to see if it's been updated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Voting to delete feels equally wrong, since it's unnecessarily harsh (according to the consensus). Skipping it doesn't make sense, since someone else will have to review it instead.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Assuming OP has received a comment, but &quot;sufficient amount of time&quot; has not passed, should we say that the answer Looks OK? &lt;/p&gt;&#xA;" OwnerUserId="31516" LastEditorUserId="31516" LastEditDate="2018-06-07T08:51:29.447" LastActivityDate="2018-06-07T14:00:48.093" Title="Invalid answers in the review queue, but OP hasn't had time to fix it" Tags="|discussion|answers|reviewing|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16507" PostTypeId="2" ParentId="16506" CreationDate="2018-06-07T14:00:48.093" Score="1" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Users can't be expected to go back and check on an answer two days&#xA;  later to see if it's been updated.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Voting to delete feels equally wrong, since it's unnecessarily harsh&#xA;  (according to the consensus). Skipping it doesn't make sense, since&#xA;  someone else will have to review it instead.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't follow the logic in that last sentence. Skipping it means that someone else will have to review it, but by then more time will have passed, so it might no longer be inappropriate to vote to delete. It seems to me that the other points you make constitute a good case that the best response is to add a comment (directly on the answer, &lt;em&gt;not&lt;/em&gt; using the review queue interface) and then skip.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-06-07T14:00:48.093" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16509" PostTypeId="1" CreationDate="2018-06-07T17:41:17.867" Score="0" ViewCount="78" Body="&lt;p&gt;In this challenge: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/166330/rounding-numbers/166337&quot;&gt;rounding numbers&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Most answers use floating point numbers, which means that many potential input values are impossible due to the limited precision.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the inputs &lt;code&gt;.02675&lt;/code&gt; and &lt;code&gt;4&lt;/code&gt;. In this challenge, that would mean rounding &lt;code&gt;.02675&lt;/code&gt; to &lt;code&gt;4&lt;/code&gt; decimal places, which should result in &lt;code&gt;.0268&lt;/code&gt;.&lt;br&gt;&#xA;However, &lt;code&gt;0.02675&lt;/code&gt; can't be represented exactly in the common floating point formats, and it's actually stored as &lt;code&gt;.02674999...&lt;/code&gt;, which rounds to &lt;code&gt;.0267&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Are these answers are invalid because they can't accept all the potential input values?&lt;/p&gt;&#xA;" OwnerUserId="64538" LastActivityDate="2018-06-07T18:06:48.037" Title="Floating Point Input" Tags="|discussion|" AnswerCount="1" CommentCount="1" ClosedDate="2018-06-07T19:26:04.477" ContentLicense="CC BY-SA 4.0" />
  <row Id="16510" PostTypeId="2" ParentId="16509" CreationDate="2018-06-07T18:06:48.037" Score="2" Body="&lt;h3&gt;Allow the default behavior&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Floating point inaccuracies is a limitation we have to work with/around. That's just how computers work. If a language/program circumvents this and treats the numbers as accurate decimal numbers, then that's fine. If not, then that's fine too.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;If a language/program &lt;strong&gt;can&lt;/strong&gt; handle the numbers as accurate decimal numbers then allow this. That means that it's OK to return &lt;code&gt;0.15&lt;/code&gt; as &lt;code&gt;0.2&lt;/code&gt; if only one decimal number is required.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a language/program &lt;strong&gt;can't&lt;/strong&gt; handle the numbers as accurate decimal numbers, then allow for the default behavior. That means that it's OK to return &lt;code&gt;0.15&lt;/code&gt; as &lt;code&gt;0.1&lt;/code&gt; if only one decimal is required, since it's floating point value is &lt;code&gt;0.14999..&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the specific challenge you linked to, both &lt;code&gt;0.0268&lt;/code&gt; and &lt;code&gt;0.0267&lt;/code&gt; would be OK. However, rounding &lt;code&gt;0.25&lt;/code&gt; to &lt;code&gt;0.2&lt;/code&gt; would not be OK, since &lt;code&gt;0.25&lt;/code&gt; can be accurately represented using floats.&lt;/p&gt;&#xA;" OwnerUserId="31516" LastActivityDate="2018-06-07T18:06:48.037" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16513" PostTypeId="2" ParentId="2140" CreationDate="2018-06-09T10:09:46.860" Score="0" Body="&lt;h1&gt;# Proposed Question # &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;List the amount of factors for a given number.&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;For Example:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If given 1936, the output should be 15 (as 1936 has 15 factors)&lt;br&gt;&#xA;If given 196, the output should be 9 (as 196 has 9 factors)&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;64 - Outputs 7 &lt;/li&gt;&#xA;&lt;li&gt;196 - Outputs 9 &lt;/li&gt;&#xA;&lt;li&gt;1936 - Outputs 15&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Code Golf - Least number of bytes for each language wins (No answer)&#xA;&lt;br&gt;&lt;br&gt;&#xA;I have made my own in JavaScript - 143 Bytes. &lt;br&gt; Available here: &lt;a href=&quot;https://glot.io/snippets/f1tl0vrnmy&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://glot.io/snippets/f1tl0vrnmy&lt;/a&gt;&#xA;&lt;br&gt; To use different numbers, change the &lt;code&gt;console.log(f(64).length)&lt;/code&gt; to &lt;code&gt;console.log(f(###).length)&lt;/code&gt; where &lt;code&gt;###&lt;/code&gt; is your desired number.&lt;br&gt;&lt;br&gt; BTW, if JavaScript or similar, only the defining function is considered in code length. The method of outputting (eg. console.log) does not count.&lt;/p&gt;&#xA;" OwnerUserId="80803" LastEditorUserId="80803" LastEditDate="2018-06-09T10:15:54.157" LastActivityDate="2018-06-09T10:15:54.157" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16514" PostTypeId="2" ParentId="2140" CreationDate="2018-06-09T13:52:39.893" Score="3" Body="&lt;h1&gt;How many times was the function called?&lt;/h1&gt;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/q/161713/80010&quot;&gt;this question&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Using your language of choice, write a function that takes no argument and returns the number of times it was called.&lt;/p&gt;&#xA;&lt;p&gt;Specifics:&lt;/p&gt;&#xA;&lt;p&gt;Your language needs to support something callable (multiple times) that takes no argument (or an empty unused argument) and returns a number or a string representing the number of times it was called, for example 1, 1.0 or &amp;quot;1&amp;quot;. Standard I/O applies.&lt;/p&gt;&#xA;&lt;p&gt;Samples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;f() returns 1&#xA;f();f() returns 1 2&#xA;f();f();f();f() returns 1 2 3 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that &lt;code&gt;f(f(f(f())))&lt;/code&gt; (function composition with itself) is not in the scope of this challenge.&lt;/p&gt;&#xA;&lt;p&gt;As this is code-golf, the winning solution in any language is the one that uses the fewest number of bytes in this language.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="80010" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-06-11T18:28:56.937" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="16517" PostTypeId="2" ParentId="5243" CreationDate="2018-06-09T22:06:25.573" Score="2" Body="&lt;h1&gt;200 rep for n &gt; 10 for my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/165504/delete-some-bits-and-count&quot;&gt;fastest-code&lt;/a&gt; challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a long-bounty. I will award 200 reputations  to the first answer which gets a score of &lt;code&gt;n=11&lt;/code&gt; or better for my challenge.&lt;/p&gt;&#xA;" OwnerDisplayName="user9207" LastEditorDisplayName="user9207" LastEditDate="2018-09-02T11:05:20.663" LastActivityDate="2018-09-02T11:05:20.663" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16518" PostTypeId="2" ParentId="2140" CreationDate="2018-06-10T02:10:03.863" Score="1" Body="&lt;p&gt;&lt;sup&gt;&lt;sup&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/166594/interpreted-arithmetic&quot;&gt;Asked&lt;/a&gt;&lt;/sup&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2018-06-10T12:57:39.613" LastActivityDate="2018-06-10T12:57:39.613" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16519" PostTypeId="2" ParentId="2140" CreationDate="2018-06-10T02:58:43.990" Score="0" Body="&lt;h1&gt;Block partite a string&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://szkopul.edu.pl/problemset/problem/t5FLaUejqAvkMfX7RnLzfEI_/site&quot; rel=&quot;nofollow noreferrer&quot;&gt;Inspiration&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider a list &lt;code&gt;l&lt;/code&gt;, consisting of numbers. Define a block operation at index &lt;code&gt;i&lt;/code&gt; on the list &lt;code&gt;l&lt;/code&gt; to be the act of moving 3 consecutive elements starting from &lt;code&gt;i&lt;/code&gt; in &lt;code&gt;l&lt;/code&gt; to the end.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;l, i (1-indexing) -&amp;gt; l (after applying block operation at index i)&#xA;[1,2,3,4,5], 1 -&amp;gt; [4,5,1,2,3]&#xA;[1,2,3,4,5,6,7], 3 -&amp;gt; [1,2,6,7,3,4,5]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Given a list consisting of only 0 and 1, your challenge is to partite it so that zeros are at the front, and ones are at the back, using only block operations. Output should be the indices in the order they are applied on the list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because this is impossible for the list &lt;code&gt;[1,0,1,0]&lt;/code&gt;, the list length is guaranteed to be at least 5.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also (as a bonus, to avoid handling special cases) there is at least 5 ones and 5 zeroes.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases (1-indexing)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(there are other valid outputs)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1,1,1,0,0] -&amp;gt; [1]&#xA;[0,1,0,1,0] -&amp;gt; [1,2,1,1]&#xA;[0,0,0,1,1,1,0,0,0] -&amp;gt; [4]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Use &lt;a href=&quot;https://tio.run/##y/r/vygxLyU/N744NTXFVs/QyNjE1IwrLz41JzUXyDXg4rJUtDI2V9AwUIgHQU0Q31ABSRNXanJGvoK9AkSPstH//wA&quot; rel=&quot;nofollow noreferrer&quot;&gt;this script&lt;/a&gt; to generate more test cases. (only input)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Winning criteria&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the shortest code in bytes wins.&lt;br&gt;&#xA;Don't let code-golf languages discourage you from posting your solution. Try to come up with as short as possible solution for &lt;em&gt;any&lt;/em&gt; language.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Note&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/166353/69850&quot;&gt;[atomic-code-golf] variant&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You're free to brute force, although I expect that a non-brute-force solution would be much shorter.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="69850" LastActivityDate="2018-06-10T02:58:43.990" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16522" PostTypeId="2" ParentId="14737" CreationDate="2018-06-12T19:13:17.710" Score="8" Body="&lt;h1&gt;Gaia&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://github.com/splcurran/Gaia&quot; rel=&quot;nofollow noreferrer&quot;&gt;Interpreter&lt;/a&gt; | &lt;a href=&quot;https://github.com/splcurran/Gaia/wiki&quot; rel=&quot;nofollow noreferrer&quot;&gt;Documentation&lt;/a&gt; | &lt;a href=&quot;https://github.com/splcurran/Gaia&quot; rel=&quot;nofollow noreferrer&quot;&gt;Online Interpreter&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Gaia is a stack-based golfing language created by PPCG user &lt;a href=&quot;https://codegolf.stackexchange.com/users/53880/business-cat&quot;&gt;Business Cat&lt;/a&gt; about a year ago, in late May 2017.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are a couple of things that make Gaia a very good competitor for the Language of the Month event:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Terseness and Ease of Use&lt;/strong&gt; – It is stack-based, so it is particularly easy to learn and understand. It has some powerful one-byte built-ins, which are pretty well chosen, and also some two-byte ones that perform more complicated tasks. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Features and Forte Points of Gaia&lt;/strong&gt; – This language excels at date-time manipulation, having over &lt;a href=&quot;https://github.com/splcurran/Gaia/wiki/Operators#datetime-nilads&quot; rel=&quot;nofollow noreferrer&quot;&gt;30 operators&lt;/a&gt; dedicated to it. Other than that, the &lt;a href=&quot;https://github.com/splcurran/Gaia/wiki/Metas&quot; rel=&quot;nofollow noreferrer&quot;&gt;meta operators&lt;/a&gt; combined with the separate &lt;a href=&quot;https://github.com/splcurran/Gaia/wiki/Overview#functions&quot; rel=&quot;nofollow noreferrer&quot;&gt;functions&lt;/a&gt; and &lt;a href=&quot;https://github.com/splcurran/Gaia/wiki/Overview#blocks&quot; rel=&quot;nofollow noreferrer&quot;&gt;blocks&lt;/a&gt; make solving non-trivial tasks, which require loops, sorting, filtering or something else very easy in Gaia. Moreover, the input is implicitly pushed to the stack, so you might not need &lt;code&gt;@&lt;/code&gt; explicitly in some situations.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Turing Completeness&lt;/strong&gt; – Gaia is undoubtedly TC, and it is not hard at all to prove it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/search?tab=votes&amp;amp;q=is%3aa%20Gaia&quot;&gt;The Gaia community is &lt;em&gt;very&lt;/em&gt; small&lt;/a&gt;&lt;/strong&gt; – Albeit being well-suited to code-golf, there are just a few answers in it and only two users have ever used it on a regular basis (one of which, its creator, is no longer active).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Golfing in it is fun!&lt;/em&gt;&lt;/strong&gt; – I can't demonstrate this unless you try it yourself, but (at least in my case) this entirely true. Go check it out!&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Currently, Gaia does not have an SE chatroom, but one can be created in case others are interested too. Alternatively, &lt;a href=&quot;https://chat.stackexchange.com/rooms/27364/esoteric-programming-languages&quot;&gt;Esoteric Programming Languages&lt;/a&gt; can be used instead, as I expect the traffic not to be too high. &lt;sub&gt;&lt;sup&gt;(While Business Cat is inactive, I'd be happy participating and maintaining it)&lt;/sup&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Pro tip&lt;/strong&gt;: If you are trying to solve an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt; challenge (taking arrays as input), you should note that the array  syntax is &lt;code&gt;[elem1 elem2 elem3 ... elemN]&lt;/code&gt;, and that &lt;code&gt;e↑&lt;/code&gt; added to the footer makes it easier to parse input.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="59487" LastEditDate="2018-07-31T17:09:51.440" LastActivityDate="2018-07-31T17:09:51.440" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16523" PostTypeId="2" ParentId="2140" CreationDate="2018-06-13T13:06:43.997" Score="0" Body="&lt;h1&gt;Most times a loop&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a positive integer &lt;code&gt;n&lt;/code&gt;. For an array of length &lt;code&gt;n&lt;/code&gt;, each two element of which are different, repeatedly rearrange it using the same permutation till it's the same as original. How many times was the array rearranged at most?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Samples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input output example permutation&#xA;1     1      [a1]&#xA;2     2      [a2 a1]&#xA;3     3      [a3 a1 a2]&#xA;4     4      [a4 a1 a2 a3]&#xA;5     6      [a3 a1 a2 a5 a4]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-06-16T10:55:38.237" LastActivityDate="2018-06-16T10:55:38.237" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="16525" PostTypeId="2" ParentId="2140" CreationDate="2018-06-13T15:14:44.547" Score="0" Body="&lt;p&gt;&lt;strong&gt;DayByte Savings&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: Any positive integer 1..n; or a year in the future (e.g. &lt;code&gt;2025&lt;/code&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: The date-times (UTC) that Britain will change to/from daylight savings times (i.e. 1am on the last Sunday in March and 2am on the last Sunday in October) between now (according to the machine running the code) and the current date in the year specified in the input. We can assume this rule won't change in the future.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any valid list of date-time formats is fine for the output (e.g. &quot;28th October 2018 2am&quot; or &quot;28-OCT-18T02:00:00&quot; or &quot;1540692000&quot; [epoch time])&lt;/p&gt;&#xA;&#xA;&lt;p&gt;inspired by &lt;a href=&quot;https://stackoverflow.com/questions/50839863/future-list-of-daylight-savings-changeover-date-times-uk&quot;&gt;https://stackoverflow.com/questions/50839863/future-list-of-daylight-savings-changeover-date-times-uk&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You could store all the data in your program (it counts towards your byte count), or just call a builtin that calculates it - your choice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can assume that 2099 (however far ahead that is) is the largest input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, usual rules and exclusions apply. You won't have to deal with invalid inputs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example (assuming today is 23rd September 2019):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2020 or 1 -&amp;gt; 27th Oct 2019 2am; 29th Mar 2020 1am&#xA;&#xA;2099 or 80 -&amp;gt; 27 October 2019 02:00:00&#xA;      29 March 2020 01:00:00&#xA;      25 October 2020 02:00:00&#xA;      28 March 2021 01:00:00&#xA;      31 October 2021 02:00:00&#xA;      27 March 2022 01:00:00&#xA;      30 October 2022 02:00:00&#xA;      26 March 2023 01:00:00&#xA;      29 October 2023 02:00:00&#xA;      31 March 2024 01:00:00&#xA;      27 October 2024 02:00:00&#xA;      30 March 2025 01:00:00&#xA;      26 October 2025 02:00:00&#xA;      29 March 2026 01:00:00&#xA;      25 October 2026 02:00:00&#xA;      28 March 2027 01:00:00&#xA;      31 October 2027 02:00:00&#xA;      26 March 2028 01:00:00&#xA;      29 October 2028 02:00:00&#xA;      25 March 2029 01:00:00&#xA;      28 October 2029 02:00:00&#xA;      31 March 2030 01:00:00&#xA;      27 October 2030 02:00:00&#xA;      30 March 2031 01:00:00&#xA;      26 October 2031 02:00:00&#xA;      28 March 2032 01:00:00&#xA;      31 October 2032 02:00:00&#xA;      27 March 2033 01:00:00&#xA;      30 October 2033 02:00:00&#xA;      26 March 2034 01:00:00&#xA;      29 October 2034 02:00:00&#xA;      25 March 2035 01:00:00&#xA;      28 October 2035 02:00:00&#xA;      30 March 2036 01:00:00&#xA;      26 October 2036 02:00:00&#xA;      29 March 2037 01:00:00&#xA;      25 October 2037 02:00:00&#xA;      28 March 2038 01:00:00&#xA;      31 October 2038 02:00:00&#xA;      27 March 2039 01:00:00&#xA;      30 October 2039 02:00:00&#xA;      25 March 2040 01:00:00&#xA;      28 October 2040 02:00:00&#xA;      31 March 2041 01:00:00&#xA;      27 October 2041 02:00:00&#xA;      30 March 2042 01:00:00&#xA;      26 October 2042 02:00:00&#xA;      29 March 2043 01:00:00&#xA;      25 October 2043 02:00:00&#xA;      27 March 2044 01:00:00&#xA;      30 October 2044 02:00:00&#xA;      26 March 2045 01:00:00&#xA;      29 October 2045 02:00:00&#xA;      25 March 2046 01:00:00&#xA;      28 October 2046 02:00:00&#xA;      31 March 2047 01:00:00&#xA;      27 October 2047 02:00:00&#xA;      29 March 2048 01:00:00&#xA;      25 October 2048 02:00:00&#xA;      28 March 2049 01:00:00&#xA;      31 October 2049 02:00:00&#xA;      27 March 2050 01:00:00&#xA;      30 October 2050 02:00:00&#xA;      26 March 2051 01:00:00&#xA;      29 October 2051 02:00:00&#xA;      31 March 2052 01:00:00&#xA;      27 October 2052 02:00:00&#xA;      30 March 2053 01:00:00&#xA;      26 October 2053 02:00:00&#xA;      29 March 2054 01:00:00&#xA;      25 October 2054 02:00:00&#xA;      28 March 2055 01:00:00&#xA;      31 October 2055 02:00:00&#xA;      26 March 2056 01:00:00&#xA;      29 October 2056 02:00:00&#xA;      25 March 2057 01:00:00&#xA;      28 October 2057 02:00:00&#xA;      31 March 2058 01:00:00&#xA;      27 October 2058 02:00:00&#xA;      30 March 2059 01:00:00&#xA;      26 October 2059 02:00:00&#xA;      28 March 2060 01:00:00&#xA;      31 October 2060 02:00:00&#xA;      27 March 2061 01:00:00&#xA;      30 October 2061 02:00:00&#xA;      26 March 2062 01:00:00&#xA;      29 October 2062 02:00:00&#xA;      25 March 2063 01:00:00&#xA;      28 October 2063 02:00:00&#xA;      30 March 2064 01:00:00&#xA;      26 October 2064 02:00:00&#xA;      29 March 2065 01:00:00&#xA;      25 October 2065 02:00:00&#xA;      28 March 2066 01:00:00&#xA;      31 October 2066 02:00:00&#xA;      27 March 2067 01:00:00&#xA;      30 October 2067 02:00:00&#xA;      25 March 2068 01:00:00&#xA;      28 October 2068 02:00:00&#xA;      31 March 2069 01:00:00&#xA;      27 October 2069 02:00:00&#xA;      30 March 2070 01:00:00&#xA;      26 October 2070 02:00:00&#xA;      29 March 2071 01:00:00&#xA;      25 October 2071 02:00:00&#xA;      27 March 2072 01:00:00&#xA;      30 October 2072 02:00:00&#xA;      26 March 2073 01:00:00&#xA;      29 October 2073 02:00:00&#xA;      25 March 2074 01:00:00&#xA;      28 October 2074 02:00:00&#xA;      31 March 2075 01:00:00&#xA;      27 October 2075 02:00:00&#xA;      29 March 2076 01:00:00&#xA;      25 October 2076 02:00:00&#xA;      28 March 2077 01:00:00&#xA;      31 October 2077 02:00:00&#xA;      27 March 2078 01:00:00&#xA;      30 October 2078 02:00:00&#xA;      26 March 2079 01:00:00&#xA;      29 October 2079 02:00:00&#xA;      31 March 2080 01:00:00&#xA;      27 October 2080 02:00:00&#xA;      30 March 2081 01:00:00&#xA;      26 October 2081 02:00:00&#xA;      29 March 2082 01:00:00&#xA;      25 October 2082 02:00:00&#xA;      28 March 2083 01:00:00&#xA;      31 October 2083 02:00:00&#xA;      26 March 2084 01:00:00&#xA;      29 October 2084 02:00:00&#xA;      25 March 2085 01:00:00&#xA;      28 October 2085 02:00:00&#xA;      31 March 2086 01:00:00&#xA;      27 October 2086 02:00:00&#xA;      30 March 2087 01:00:00&#xA;      26 October 2087 02:00:00&#xA;      28 March 2088 01:00:00&#xA;      31 October 2088 02:00:00&#xA;      27 March 2089 01:00:00&#xA;      30 October 2089 02:00:00&#xA;      26 March 2090 01:00:00&#xA;      29 October 2090 02:00:00&#xA;      25 March 2091 01:00:00&#xA;      28 October 2091 02:00:00&#xA;      30 March 2092 01:00:00&#xA;      26 October 2092 02:00:00&#xA;      29 March 2093 01:00:00&#xA;      25 October 2093 02:00:00&#xA;      28 March 2094 01:00:00&#xA;      31 October 2094 02:00:00&#xA;      27 March 2095 01:00:00&#xA;      30 October 2095 02:00:00&#xA;      25 March 2096 01:00:00&#xA;      28 October 2096 02:00:00&#xA;      31 March 2097 01:00:00&#xA;      27 October 2097 02:00:00&#xA;      30 March 2098 01:00:00&#xA;      26 October 2098 02:00:00&#xA;      29 March 2099 01:00:00&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="62289" LastEditorUserId="62289" LastEditDate="2019-09-30T08:02:12.463" LastActivityDate="2019-09-30T08:02:12.463" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16527" PostTypeId="2" ParentId="2140" CreationDate="2018-06-13T17:55:58.523" Score="0" Body="&lt;h1&gt;Which number nearest?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We say 2018 is near 2000, but not 2018 is near 2030, though |2030-2018|&amp;lt;|2000-2018|. Given some pairs of numbers (a,b) and two numbers g&gt;0 and x, find an x+t for min((|t|&lt;sup&gt;c&lt;/sup&gt;+g)*b&lt;sup&gt;d&lt;/sup&gt;) for t as a real number making (x+t) mod a = 0, (a,b) as one of the pairs. You can decide &lt;code&gt;c&lt;/code&gt; to be 1 or 2, and &lt;code&gt;d&lt;/code&gt; to be 1 or -1, as long as it's constant.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Samples: (c=1, d=1)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;In: {(1000, 1), (10, 100)}, g=1, x=2018&#xA;Out: 2000&#xA;&#xA;In: {(1000, 1), (10, 1)}, g=1, x=2018&#xA;Out: 2020&#xA;&#xA;In: {(1, 1), (10, 1)}, g=1, x=2018&#xA;Out: 2018&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-06-14T01:49:44.827" LastActivityDate="2018-06-14T01:49:44.827" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16528" PostTypeId="1" CreationDate="2018-06-13T21:56:39.920" Score="15" ViewCount="596" Body="&lt;p&gt;The PPCG community seems to be moving towards more general I/O formats. Then, we could generalize our notion of a &quot;list&quot; so that it is not restricted to the built-in list or array constructs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance, for a challenge asking for a list output, should we be able to write a program that outputs a lambda expression that behaves like a list? That is, the lambda expression would take an index and return the corresponding value, as if it were a list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is a &quot;list&quot; in a sense that you can access any element given an index. The &quot;list&quot; wouldn't allow any modification to the elements, but the scope of challenges on PPCG doesn't involve with messing with the outputs after they are returned, as long as the program is reusable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is closely related to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; challenges, some of which give the user an option between &quot;make a program that gives the first &lt;code&gt;n&lt;/code&gt; elements&quot; and &quot;make a program that gives the &lt;code&gt;n&lt;/code&gt;-th element.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How should we define a list? Built-in lists only? General objects that behave like a list?&lt;/p&gt;&#xA;" OwnerUserId="60043" LastEditorUserId="60043" LastEditDate="2018-07-19T21:15:01.643" LastActivityDate="2018-07-19T21:15:01.643" Title="What is a list?" Tags="|discussion|" AnswerCount="3" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16529" PostTypeId="2" ParentId="16528" CreationDate="2018-06-14T01:08:46.567" Score="-3" Body="&lt;h2&gt;If it indexes like a list, it's a list&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;What I mean by this is, a &quot;list&quot; structure returned from a function could be considered valid if&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;the structure can be &quot;indexed&quot;, like what you would expect from any list;&lt;/li&gt;&#xA;&lt;li&gt;&quot;indexing&quot; an item within the length of the &quot;list&quot; gives the correct value; and&lt;/li&gt;&#xA;&lt;li&gt;&quot;indexing&quot; an item outside of the length produces a falsy result.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;To expand on these points:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;This is rather loose; there are several basic options:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It can be indexed directly with array access, as in the case of JavaScript's &lt;code&gt;Object&lt;/code&gt;s (&lt;code&gt;list = {1:1, 2:3, 3:6, 4:10}&lt;/code&gt; can be indexed with &lt;code&gt;list[2]&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;It can be accessed with a function call (so that &lt;code&gt;list = lambda i:i*(i+1)/2&lt;/code&gt; would be considered an &quot;infinite list&quot; of triangular numbers, indexing like &lt;code&gt;list(2)&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;It can be accessed via a built-in function or method for accessing such structures (such as the &lt;code&gt;dict.get&lt;/code&gt; method in Python: &lt;code&gt;list.get(2)&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is fairly straightforward. Any index within the range of the &quot;list&quot;, when accessed as specified above, should give the item that would be expected at that index in a true list structure. This can be 0-indexed, 1-indexed, or more generally &lt;code&gt;n&lt;/code&gt;-indexed, where &lt;code&gt;n&lt;/code&gt; is the first integer (or float, if you really need it) in a successive group that makes up the indices (suggested by Mego). Basically, the initial index can be any finite real number, but successive indices must each increase by 1 over the previous.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is a little more vague. The default behavior for indexing outside of a list varies from language to language:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Python (and many other languages) throw an error.&lt;/li&gt;&#xA;&lt;li&gt;JavaScript gives &lt;code&gt;undefined&lt;/code&gt;, indicating no value.&lt;/li&gt;&#xA;&lt;li&gt;In C, this is undefined behavior, meaning behavior may vary from compiler to compiler.  &lt;/li&gt;&#xA;&lt;li&gt;Many golfing languages wrap indices, i.e. &lt;code&gt;list[list.length] == list[0]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think any of these behaviors is fine, as long as &lt;strong&gt;the &quot;list&quot; does not include unexpected values beyond its expected length&lt;/strong&gt;. I would also allow returning any falsy value (&lt;code&gt;0&lt;/code&gt;, &lt;code&gt;False&lt;/code&gt;, &lt;code&gt;null&lt;/code&gt;, etc.) for any index past the length.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that only valid indices (non-negative integers for 0-indexed, positive integers for 1-indexed, etc.) need to be handled, as these would be the only candidates for indexes in the (theoretical) list.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Say the challenge was &quot;given an integer &lt;code&gt;n&lt;/code&gt;, output a list of the first &lt;code&gt;n&lt;/code&gt; triangular numbers&quot;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;f=lambda n:lambda i:i*(i+1)/2&lt;/code&gt; is &lt;strong&gt;not&lt;/strong&gt; a valid entry; while it satisfies points 1 and 2 (after &lt;code&gt;list = f(5)&lt;/code&gt;, items can be accessed with e.g. &lt;code&gt;list(3)&lt;/code&gt;), it does not satisfy point 3, as it keeps giving the correct result for inputs of 5 and beyond.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;f=lambda n:lambda i:i&amp;lt;n and(i+1)*i/2&lt;/code&gt;, on the other hand, &lt;strong&gt;is&lt;/strong&gt; a valid entry; if &lt;code&gt;n = 5&lt;/code&gt;, then returned lambda fails for &lt;code&gt;i&lt;/code&gt; ≥ 5, giving &lt;code&gt;False&lt;/code&gt; instead of the triangular numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would not consider the ability to &lt;em&gt;determine&lt;/em&gt; length an important element in determining a list, as DJMcMayhem &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/31716/djmcmayhem&quot;&gt;suggested in the comments&lt;/a&gt;; as Mego &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/16528/what-is-a-list-array#comment57700_16528&quot;&gt;pointed out&lt;/a&gt;, this ideology fails in languages like C, where an array consists of just a pointer to the first item and there is no way to get its length. However, the list must inherently have a length to comply with point 3.&lt;/p&gt;&#xA;" OwnerUserId="42545" LastEditorUserId="42545" LastEditDate="2018-06-16T00:53:55.697" LastActivityDate="2018-06-16T00:53:55.697" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="16530" PostTypeId="1" CreationDate="2018-06-14T01:12:37.247" Score="0" ViewCount="100" Body="&lt;p&gt;If a challenge is difficult, when is it suitable to hint? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I don't think early is good, it breaks other's thought)&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="69850" LastEditDate="2018-06-14T01:32:15.940" LastActivityDate="2018-06-14T06:51:12.257" Title="When should I give hints for a challenge?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16531" PostTypeId="2" ParentId="16530" CreationDate="2018-06-14T06:51:12.257" Score="4" Body="&lt;h1&gt;Almost always as fast as possible&lt;/h1&gt;&#xA;&lt;p&gt;Generally speaking, PPCG is not a place for challenges that becomes trivial once everyone knows how to solve it. This is not an enforced rule as far as I'm aware, but could easily lead to controversy. For example &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt; challenges with a known optimal algorithm (well, maybe not trivial for everyone), and some of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5585/25180&quot;&gt;pure&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt;s. So better use the sandbox, or at least try to be creative if you want to post these challenges. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; is a notable exception.&lt;/p&gt;&#xA;&lt;p&gt;Or you could use another winning criterion, to make things easier, say &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt;. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8195/25180&quot;&gt;Better not use code-golf as a tie-breaker.&lt;/a&gt; But the main challenge is also different. In most cases you should give information about how to solve the first part (to reach the required complexity), and answers compete with each other by only golfing.&lt;/p&gt;&#xA;&lt;p&gt;If the challenge is so difficult that you have to give hints so that anyone could post an answer, you are likely doing this, but still want the first part to be a part of the challenge. This hides the controversy, but doesn't actually improve the situation. Even if you don't give hints, the first answer automatically serves as a hint to everyone else, and someone could golf it in another language and win despite it's not their own idea. Worse if the user who comes up with a solution isn't interested in golfing it. Better just tell everyone the answer, as it is irrelevant to who wins.&lt;/p&gt;&#xA;&lt;p&gt;But if you want to stick to the original winning criterion, and not just golf, it wouldn't be easy and could only be answered per challenge. And sometimes it only proves that challenge type doesn't work well.&lt;/p&gt;&#xA;&lt;p&gt;If you simply want others to think about it for a while, as user202729 have commented, you could use the spoiler blockquote. This should be enough if you don't consider this part the main challenge. To make life easier, don't be too obsessed about whether others has taken your hint. You could always think yourself a winner if you are sure nobody else could come up with a solution. And you could always assume some people know it if it is helpful and you were willing to share.&lt;/p&gt;&#xA;&lt;p&gt;In practice, I see many users edit the information about how to solve something into the question as soon as someone asks, if they weren't already there.&lt;/p&gt;&#xA;&lt;p&gt;Also note that, for the most challenges, you should be able to post your own answer. Some users would try not answer in a few days because they prefer not winning their own challenge, but not that they have something to hide. This could be better than a hint sometimes.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-06-14T06:51:12.257" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16534" PostTypeId="1" CreationDate="2018-06-14T11:21:45.830" Score="1" ViewCount="85" Body="&lt;p&gt;Assuming an algorithm requires an array of 10&lt;sup&gt;80&lt;/sup&gt; bytes of RAM(maybe not realistic, but theoretically the algorithm work). For languages like Python, &lt;code&gt;[0]*(10**80)&lt;/code&gt; just theoretically work (ignoring optimizing here), but for C, currently there's only 64-bit machine, and avaliable RAM far not enough. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;What is the default when such happens? (inf-bit machine or what)&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2018-06-14T11:21:45.830" Title="Large memory support for bottom language" Tags="|discussion|" AnswerCount="0" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16535" PostTypeId="2" ParentId="2140" CreationDate="2018-06-14T13:02:27.697" Score="0" Body="&lt;h1&gt;Is there a dangling else?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Define a statement as follows (Backus-Naur form) (based on Java syntax):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;statement ::= &quot;;&quot;&#xA;  | &quot;if(true)&quot; &amp;lt;statement&amp;gt;&#xA;  | &quot;if(true)&quot; &amp;lt;statement&amp;gt; &quot;else &quot; &amp;lt;statement&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Example valid statements:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;;&#xA;if(true);else ;&#xA;if(true);else if(true);else ;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Example invalid statement that is valid Java syntax, but considered invalid for simplicity:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;if(false);&#xA;if(true);else;&#xA;if(1&amp;gt;0);else ;&#xA;System.out.println(&quot;This is invalid&quot;);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your task is, given a valid statement, determine if it contains a dangling else (that is, it can be parsed into more than one ways)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Truthy test cases&lt;/strong&gt; (contains a dangling else)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Presented in the format &lt;code&gt;{input}¶ -&amp;gt; {parse 1}¶ -&amp;gt; {parse 2}&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;if(true)if(true);else ;&#xA; -&amp;gt; if(true){if(true);}else ;&#xA; -&amp;gt; if(true){if(true);else ;}&#xA;&#xA;if(true)if(true);else if(true);else ;&#xA; -&amp;gt; if(true){if(true);else if(true);}else ;&#xA; -&amp;gt; if(true){if(true);}else{if(true);else ;}&#xA;&#xA;if(true);else if(true);else if(true)if(true);else ;&#xA; -&amp;gt; if(true);else if(true);else if(true){if(true);}else ;&#xA; -&amp;gt; if(true);else if(true);else if(true){if(true);else ;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Falsy test cases&lt;/strong&gt; (uniquely parsed)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;if(true)if(true)if(true);&#xA;if(true)if(true);else ;else ;&#xA;if(true);else if(true);else if(true);else ;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="69850" LastEditorUserId="69850" LastEditDate="2018-06-14T13:44:46.813" LastActivityDate="2018-06-14T13:44:46.813" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16538" PostTypeId="2" ParentId="2140" CreationDate="2018-06-15T13:15:48.747" Score="0" Body="&lt;h1&gt;Quine of Hanoi&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Objetive&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Make a program that print a rearranged version of itself&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program will consist of newlines and 3 blocks : &lt;code&gt;A&lt;/code&gt;, &lt;code&gt;B&lt;/code&gt; and &lt;code&gt;C&lt;/code&gt; where each block will have distinct and nonzero lengths, i.e. &lt;code&gt;0 &amp;lt; length(A) &amp;lt; length(B) &amp;lt; length(C)&lt;/code&gt;.  &lt;/li&gt;&#xA;&lt;li&gt;The output will be based on the order of the code blocks and newlines,&#xA;it will be a new arrangement that progresses toward a solved state by one move unless it is already solved, following &lt;a href=&quot;https://en.wikipedia.org/wiki/Tower_of_Hanoi&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tower of Hanoi&lt;/a&gt; rules.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;CA&#xA;B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Will print&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;C&#xA;B&#xA;A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Additional rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program don't have to handle invalid orders, e.g. &lt;code&gt;CAB&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;You have to handle at least one configuration of each group (but not necessarily all of them).&lt;/li&gt;&#xA;&lt;li&gt;The order of the lines is irrelevant.  &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For example  &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;CA&#xA;B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;CAN print&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;B&#xA;C&#xA;A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#Group 0 - will output itself&#xA;CBA&#xA;&#xA;#Group 1 - will output one of group 0&#xA;A\nCB&#xA;CB\nA&#xA;&#xA;#Group 2 - will output one of group 1&#xA;A\nB\nC&#xA;A\nC\nB&#xA;B\nA\nC&#xA;B\nC\nA&#xA;C\nA\nB&#xA;C\nB\nA&#xA;&#xA;#Group 3 - will output one of group 2&#xA;CA\nB&#xA;B\nCA&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Winning&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the one with the shortest code (&lt;code&gt;A&lt;/code&gt;+&lt;code&gt;B&lt;/code&gt;+&lt;code&gt;C&lt;/code&gt;) wins &lt;/p&gt;&#xA;" OwnerUserId="47120" LastEditorUserId="47120" LastEditDate="2018-06-15T14:58:35.377" LastActivityDate="2018-06-15T14:58:35.377" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16539" PostTypeId="1" CreationDate="2018-06-15T13:47:07.227" Score="-6" ViewCount="126" Body="&lt;p&gt;There are a number of programming languages that seem to be specifically designed for solving &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; problems (05AB1E and Jelly immediately come to mind). Should providing a &quot;decomposed&quot; explanation be required, or at least &lt;em&gt;strongly&lt;/em&gt; encouraged, as part of the answer? By '&quot;decomposed&quot; explanation', I mean something like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/165215/determining-yes-or-no/165234#165234&quot;&gt;my answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/165215/determining-yes-or-no/&quot;&gt;this challenge&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="79081" LastActivityDate="2018-06-15T14:29:24.910" Title="Solutions Using Golfing Languages: Should Decomposition Be Required?" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16540" PostTypeId="2" ParentId="16539" CreationDate="2018-06-15T14:19:17.360" Score="17" Body="&lt;h1&gt;No, it shouldn't be mandatory. But it is encouraged&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Making it mandatory would cause problems, such as:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;How do you draw a line between languages that require and explanation and those who don't? That's very subjective. Not everyone is familiar with Python, and not everyone finds Jelly difficult to read.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For some answers, even in &quot;difficult&quot; languages, the explanation is hardly necessary because the code is so simple. Again, the distinction is subjective.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;On the other hand, it is already encouraged to include explanations. Answers with explanations tend to get more upvotes. This is part of the culture of the site.&lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2018-06-15T14:29:24.910" LastActivityDate="2018-06-15T14:29:24.910" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16541" PostTypeId="2" ParentId="16528" CreationDate="2018-06-15T15:11:03.110" Score="-3" Body="&lt;h1&gt;Lists are indexed, have a length, and a start index&lt;/h1&gt;&#xA;&lt;p&gt;First, I'd like to mention the &lt;code&gt;length&lt;/code&gt; aspect.  Lists &lt;em&gt;have&lt;/em&gt; a non-negative integer length, even if that length isn't accessible via a function/operator.&lt;/p&gt;&#xA;&lt;p&gt;The start index doesn't need to be accessible either.  It is commonly &lt;code&gt;0&lt;/code&gt; or &lt;code&gt;1&lt;/code&gt; but can be any integer.&lt;/p&gt;&#xA;&lt;p&gt;Now, lists need an indexing operation/function:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It must take an integer.&lt;/li&gt;&#xA;&lt;li&gt;If the integer passed in is less than the start index, it must &lt;em&gt;error&lt;/em&gt; (see below).&lt;/li&gt;&#xA;&lt;li&gt;If the integer passed in is greater than or equal to &lt;code&gt;startIndex + length&lt;/code&gt;, it must &lt;em&gt;error&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, it must return a value (which should match the value expected by the OP)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;em&gt;Erroring&lt;/em&gt; means one of the following:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;An exception (printing to STDERR or terminating the program)&lt;/li&gt;&#xA;&lt;li&gt;Returning an &lt;em&gt;undefined&lt;/em&gt; value (think C).  The key here is that you &lt;em&gt;cannot&lt;/em&gt; know what the value will be before running the program, and changes each time you run it.&lt;/li&gt;&#xA;&lt;li&gt;Returning an &lt;em&gt;error&lt;/em&gt; value.  This is a &lt;code&gt;None&lt;/code&gt;, &lt;code&gt;false&lt;/code&gt;, or any other consistent value.  This value returned must be the same no matter the index passed.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Instead of erroring, lists may modulate the index: &lt;code&gt;((index - startIndex) % length) + startIndex&lt;/code&gt;. This effectively means that values wrap around.&lt;/p&gt;&#xA;&lt;p&gt;(This is largely similar to ETHProduction's answer.  I'm simply trying to tighten up the definitions)&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-06-15T22:38:58.637" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="16542" PostTypeId="1" CreationDate="2018-06-16T00:09:57.970" Score="2" ViewCount="111" Body="&lt;p&gt;I recently flagged a comment as &quot;no longer needed&quot;, and the flag got declined. The thing is, the comment wasn't really obsolete, but rather a bit too chatty. I don't want to target the comment here, so I won't link to it. The exact timestamp of the flag is &lt;code&gt;2018-06-15 10:25:31Z&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think the confusion might have arisen from how the flag is called, &quot;no &lt;strong&gt;longer&lt;/strong&gt; needed&quot;. Its description is:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This comment is obsolete, chatty, or otherwise unnecessary.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I've read (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14120/41024&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8609/41024&quot;&gt;2&lt;/a&gt;), but my case is different. First of all, my case isn't a flagging spree, as in the second case. Second, the comment itself isn't a reply to a non-obsolete comment, as in the first case, but it feels like it could very easily ignite some chat in the comment section. Also, it wasn't an old comment, but a new one posted in the same day as I flagged it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What were the reasons behind declining the flag, if any? The reason I'm asking is because I can't fully understand why the flag was declined.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2018-06-19T00:13:44.097" Title="&quot;no longer needed&quot; flag on chatty comment declined" Tags="|discussion|flags|declined-flags|" AnswerCount="0" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16543" PostTypeId="2" ParentId="2140" CreationDate="2018-06-16T00:24:54.070" Score="2" Body="&lt;h1&gt;Syllabification and classification (Venpa)&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Introduction&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Venpa&quot; rel=&quot;nofollow noreferrer&quot;&gt;Venpa&lt;/a&gt; is a form of classical Tamil poetry, based upon certain rules of metric prosody. The complete rules form a context-free grammar, the task here is to test for a tiny subset of those rules. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Letters&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Vowels: a, A, i, I, u, U, e, E, y, Y, o, O, W&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;small case represents &quot;short&quot; vowels, CAPS represent &quot;long&quot; vowels&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;y&lt;/code&gt; represents the y sound in &quot;my&quot;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;W&lt;/code&gt; represents the &quot;ou&quot; sound in &quot;mouse&quot;, and always comes in capital (long) form.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Consonant: everything else&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the consonants can be in small case or capitals, whichever is convenient.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Word Segmenting&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Words in the input are seen as composed of segments (which roughly correspond to the usual notion of a syllable). A segment divide occurs where:    &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;two or more consonants occur together, &lt;code&gt;tr&lt;/code&gt;, &lt;code&gt;rpp&lt;/code&gt;, etc.      &lt;/li&gt;&#xA;&lt;li&gt;a long (capital) vowel occurs in the word, &lt;code&gt;pO&lt;/code&gt;, &lt;code&gt;W&lt;/code&gt;, &lt;code&gt;mY&lt;/code&gt; etc.     &lt;/li&gt;&#xA;&lt;li&gt;two vowels have occurred since the last segment's end (or the word's beginning). &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;sanjIvi&lt;/code&gt; has segments &lt;code&gt;san&lt;/code&gt;, &lt;code&gt;jI&lt;/code&gt;, &lt;code&gt;vi&lt;/code&gt;.&lt;br&gt;&#xA;&lt;code&gt;Yvar&lt;/code&gt; has &lt;code&gt;Y&lt;/code&gt;,&lt;code&gt;var&lt;/code&gt;.&lt;br&gt;&#xA;&lt;code&gt;vigadakavi&lt;/code&gt; has &lt;code&gt;viga&lt;/code&gt;,&lt;code&gt;daka&lt;/code&gt;,&lt;code&gt;vi&lt;/code&gt;.&lt;br&gt;&#xA;&lt;code&gt;vAnily&lt;/code&gt; has &lt;code&gt;vA&lt;/code&gt;,&lt;code&gt;nily&lt;/code&gt;.&lt;br&gt;&#xA;&lt;code&gt;padAgytAngiha&lt;/code&gt; has &lt;code&gt;padA&lt;/code&gt;, &lt;code&gt;gytAn&lt;/code&gt;, &lt;code&gt;giha&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;radagajaturagapadAdi&lt;/code&gt; has &lt;code&gt;rada&lt;/code&gt;, &lt;code&gt;gaja&lt;/code&gt;, &lt;code&gt;tura&lt;/code&gt;, &lt;code&gt;gapa&lt;/code&gt;, &lt;code&gt;dA&lt;/code&gt;, &lt;code&gt;di&lt;/code&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Consonants at the end of segments make no difference after segmentation and can be ignored - &lt;code&gt;gytAn&lt;/code&gt;=&lt;code&gt;gytA&lt;/code&gt;, &lt;code&gt;var&lt;/code&gt;=&lt;code&gt;va&lt;/code&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As you can see, the segments are of two types: &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;those with a single vowel, &lt;code&gt;san&lt;/code&gt;, &lt;code&gt;Y&lt;/code&gt;, &lt;code&gt;vA&lt;/code&gt;, called a straight (S) segment&lt;/li&gt;&#xA;&lt;li&gt;those with two vowels, &lt;code&gt;viga&lt;/code&gt;, &lt;code&gt;nily&lt;/code&gt;, &lt;code&gt;padA&lt;/code&gt; called a sequence (Q) segment&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;So the segment patterns of the above words are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  sanjIvi              =              san + jI + vi          = SSS&#xA;  Yvar                 =                 Y + var             = SS&#xA;  vigadakavi           =            viga + daka + vi         = QQS&#xA;  vAnily               =                vA + nily            = SQ&#xA;  padAgytAngiha        =           padA + gytAn + giha       = QQQ&#xA;  radagajaturagapadAdi = rada + gaja + tura + gapa + dA + di = QQQQSS&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Permitted patterns&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The rules for words allowed in a Venpa are:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;a word should have one to three segments&lt;/li&gt;&#xA;&lt;li&gt;a one or two segment word can have any pattern (S, Q, SQ, SS, QS, QQ)&lt;/li&gt;&#xA;&lt;li&gt;a three segment word must end in a straight (S) segment&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;So out of the above, SSS, SS, QQS, and SQ are allowed, QQQ and QQQQSS are not. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Task&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given an input word in the above letters, output its segment pattern if it's an allowed word, &#xA;or a false-y value if it's not an allowed word. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Will be a single word composed of the characters mentioned under the Letters heading above&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;(Small case &lt;code&gt;w&lt;/code&gt; will &lt;em&gt;not&lt;/em&gt; be present anywhere in the text (neither as a vowel nor as a consonant))&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The segment pattern of the input word, if it's an allowed word&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;can use any two distinct unambiguous characters to represent S segments and Q segments&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;A false-y value in your language if it's not an allowed word&lt;/li&gt;&#xA;&lt;li&gt;Output is undefined for invalid input (i.e. has characters other than those specified)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;vigadakavi &#xA;=&amp;gt; QQS&#xA;Yvar &#xA;=&amp;gt; SS&#xA;padAgytAngiha&#xA;=&amp;gt; falsey (QQQ not allowed)&#xA;vAnily&#xA;=&amp;gt; SQ&#xA;katradanA&#xA;=&amp;gt; SQS&#xA;radagajaturagapadAdi &#xA;=&amp;gt; falsey (more than 3 segments)&#xA;TuppArkkuT&#xA;=&amp;gt; SSS&#xA;mazai&#xA;=&amp;gt; Q&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="8774" LastEditorUserId="8774" LastEditDate="2018-07-20T14:13:13.420" LastActivityDate="2018-07-20T14:13:13.420" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="16544" PostTypeId="2" ParentId="2140" CreationDate="2018-06-16T05:02:30.423" Score="1" Body="&lt;h1&gt;Add least char to match&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a string, add at least chars to make the whole string match the given regexp. You can assume it's possible. If there are more than one solution, output a (not necessary uniform) random one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here regexp may contain:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;|  or&#xA;() group&#xA;?  possibly not appear&#xA;*  may appear for any times. Maybe different in each match&#xA;0  &#xA;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Samples&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0100      (01)*         010101&#xA;0         (0|1)(0|1)    00; 01; 10 (any should possibly appear)&#xA;1010      ((0|1)(0|1))* 1010&#xA;101       ((0|1)(0|1))* 1010; 1011; 1001; 0101; 1101&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regex&amp;#39;&quot; rel=&quot;tag&quot;&gt;regex&lt;/a&gt; &lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2018-06-16T05:02:30.423" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16548" PostTypeId="2" ParentId="16528" CreationDate="2018-06-17T00:32:12.783" Score="10" Body="&lt;h1&gt;A list is a container in which the elements are in order&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&quot;In order&quot; means, that there's a first element, which has a successor element, which also has a successor element and so on. If the list is finite, there's a last element without a successor. If the list empty, there isn't even a first element. Every element &lt;code&gt;e&lt;/code&gt; together with it's successors is a list of it's own, with &lt;code&gt;e&lt;/code&gt; as the first element. It must be possible to define two operations for the container:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;accessing the first element&lt;/li&gt;&#xA;&lt;li&gt;extracting the tail (if any). The tail of a list is the (sub-)list where the first element is the successor of the original first element.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Both operations can be arbitrary complex but must be consistent for all lists. Examples for accessing the first element: indexing at &lt;code&gt;[0]&lt;/code&gt;, using functions like Lisp's &lt;code&gt;car&lt;/code&gt;. Examples for extracting the tail of a list &lt;code&gt;l&lt;/code&gt;: python: &lt;code&gt;tail=l[1:]&lt;/code&gt;, pointer to arrays in C: &lt;code&gt;tail=l+1&lt;/code&gt;, Lisp: function &lt;code&gt;cdr&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Indexing at &lt;code&gt;i&lt;/code&gt; is &lt;em&gt;not&lt;/em&gt; an inherent feature of a list (but of an array), but can be trivially achieved by starting at the first element and taking &lt;code&gt;i&lt;/code&gt; times the tail and then the head thereof.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lists can be implemented with functions that map integers &lt;code&gt;i&lt;/code&gt; to the &lt;code&gt;i&lt;/code&gt;th element, but only if the language supports higher order functions, because when extracting the tail you have to create a new list-function out of the original list-function. Example (using Haskell syntax): &lt;code&gt;l = join(*)&lt;/code&gt; is the (infinite) list of all square numbers. &lt;code&gt;l 1&lt;/code&gt; is the first element and &lt;code&gt;tail = (.succ) l&lt;/code&gt; is the tail. Both operations (providing &lt;code&gt;1&lt;/code&gt; as an argument and using &lt;code&gt;(.succ)&lt;/code&gt;) are consistent for all list-functions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;List can be implemented via dictionaries with integers as keys. In Perl, &lt;code&gt;%l = (1 =&amp;gt; 1, 2 =&amp;gt; 4, 3 =&amp;gt; 9)&lt;/code&gt; is a list of the first three square numbers. The first element is accessed via lookup of key &lt;code&gt;1&lt;/code&gt; and the tail via removing key 1 and re-mapping all remaining key/value pairs accordingly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some notes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;lists as defined above have basically the same features as &lt;a href=&quot;https://en.wikipedia.org/wiki/Linked_list#Singly_linked_list&quot; rel=&quot;nofollow noreferrer&quot;&gt;singly linked lists&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;function/dictionaries don't have to use integers as arguments/keys, any ordered type will do, e.g. characters.&lt;/li&gt;&#xA;&lt;li&gt;yes, you can also implement finite lists with functions. The list of the first 4 square numbers is (again, using Haskell syntax): &lt;code&gt;f x|x&amp;gt;0,x&amp;lt;5=x*x|otherwise=undefined&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;usually a list requires some method to check for the empty list. For functions you can use a pair (list-function, length) just like C arrays also need a separate length variable or you can introduce a special element &lt;code&gt;nil&lt;/code&gt; to mark the end of the list.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="34531" LastEditorUserId="34531" LastEditDate="2018-06-20T17:12:46.277" LastActivityDate="2018-06-20T17:12:46.277" CommentCount="30" ContentLicense="CC BY-SA 4.0" />
  <row Id="16549" PostTypeId="2" ParentId="2140" CreationDate="2018-06-17T03:23:42.783" Score="1" Body="&lt;h1&gt;Draw the Recamán's Sequence&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/animation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;animation&amp;#39;&quot; rel=&quot;tag&quot;&gt;animation&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Recamán's sequence (&lt;a href=&quot;http://oeis.org/A005132&quot; rel=&quot;nofollow noreferrer&quot;&gt;A005132&lt;/a&gt;) is a mathematical sequence, defined as such:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A(0) = 0&#xA;A(n) = A(n-1) - n if A(n-1) - n &amp;gt; 0 and is new, else&#xA;A(n) = A(n-1) + n&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;A pretty LaTex version of the above (might be more readable):&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/ghGTL.gif&quot; alt=&quot;pretty latex&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;The first few terms are &lt;code&gt;0, 1, 3, 6, 2, 7, 13, 20, 12, 21, 11&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;(Description of the sequence borrowed from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37635/generaterecam%c3%a1ns-sequence&quot;&gt;this older question&lt;/a&gt;).&lt;/p&gt;&#xA;&lt;p&gt;Your task is to &lt;em&gt;animate&lt;/em&gt; the drawing this sequence as a series of semi-circles:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/1wEHY.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/1wEHY.jpg&quot; alt=&quot;Sequence construction&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Where each entry above is a keyframe in the animation. Tween frames should draw the circle segment, and if necessary, scale the image down when the new locus would be out of frame.&lt;/p&gt;&#xA;&lt;p&gt;After 600 terms of the sequence you should have something like this:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/1Z3mh.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/1Z3mh.png&quot; alt=&quot;Pattern&quot; /&gt;&lt;/a&gt;&#xA;(Image from &lt;a href=&quot;https://www.youtube.com/watch?v=FGC5TdIiT9U&amp;amp;t=496s&quot; rel=&quot;nofollow noreferrer&quot;&gt;this Numberphile video&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;p&gt;Your choice whether to draw horizontally, vertically, or diagonally, provided that the entire image fits within the image boundary. Line color can be any value, background can be any value (values must be distinct).&lt;/p&gt;&#xA;&lt;h1&gt;Winner&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program to generate the &lt;em&gt;most&lt;/em&gt; terms of the sequence wins (before the program terminates, crashes, or otherwise corrupts the output--eg by exceeding file size limitations&lt;sup&gt;1&lt;/sup&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Tie will go to the &lt;em&gt;shorter&lt;/em&gt; program.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output image size shall be no smaller than 2048x2048, compiled as a gif, apng, common video format (e.g. mp4), or as an HTML or Javascript canvas (in-place animation).&lt;/li&gt;&#xA;&lt;li&gt;Segments should be drawn over 0.5 second intervals&lt;/li&gt;&#xA;&lt;li&gt;Frame Rate should be no slower than 24 frames/second&lt;/li&gt;&#xA;&lt;li&gt;(That is, each term of the sequence will take at least 12 frames to draw)&lt;/li&gt;&#xA;&lt;li&gt;You need not embed the &lt;em&gt;entire&lt;/em&gt; output in your answer, although some means of showing off the results of your work is expected (sped up version, choice stills, etc).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;1 &lt;sub&gt;If your program will happily produce files in excess of 128 MB (the 64 bit NTFS file system will allow up to 16 TB files), post an altered version of your program that terminates after approximately 128 MB to avoid trashing people's hard drives. You may score based on the unaltered bytecount. Do please post a still image of the final frame your program &lt;em&gt;could otherwise produce&lt;/em&gt; (within reason: you not required to generate the entire animation in order to determine true termination). You may use a modified / separate program to produce this still, as it is purely for aesthetic and curiosity purposes.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="47990" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-06-17T03:23:42.783" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16550" PostTypeId="2" ParentId="2140" CreationDate="2018-06-17T09:21:45.120" Score="-1" Body="&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;I recently came across an oral exam where the candidates were asked to find a logical circuit than can negate 3 inputs A,B,C using only two &lt;code&gt;NOT&lt;/code&gt; gates.&lt;/p&gt;&#xA;&lt;p&gt;The question also specified that such a circuit is unique up to removal of useless gates and reordering inputs/outputs. The candidates were asked to prove this assertion by writing a piece of code that generates all such circuits.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;No inputs whatsoever are given.&lt;/p&gt;&#xA;&lt;p&gt;The program must output all logical circuits using unlimited &lt;code&gt;AND&lt;/code&gt; and &lt;code&gt;OR&lt;/code&gt; gates but only two &lt;code&gt;NOT&lt;/code&gt; gates which take in three inputs which map to three outputs. The outputs should be the negation of each input.&lt;/p&gt;&#xA;&lt;p&gt;The outputted circuits should not have any redundant/trivial gates (gates that always output the same thing) or unused gates (whose output doesn't influence the outcome).&lt;/p&gt;&#xA;&lt;p&gt;The program should use as little precalculated data as possible.&lt;/p&gt;&#xA;&lt;p&gt;Output format is left up to the coders.&lt;/p&gt;&#xA;&lt;p&gt;The winner will be determined by overall simplicity -- low run time and code elegance. It is not an objective criterion.&lt;/p&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;N/A&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;R    = (A &amp;amp; B) | (A &amp;amp; C) | (B &amp;amp; C)&#xA;notR = !R&#xA;S    = (notR &amp;amp; (A | B | C)) | (A &amp;amp; B &amp;amp; C)&#xA;notS = !S&#xA;&#xA;notA = (notR &amp;amp; notS) | (notR &amp;amp; S &amp;amp; (B | C)) | (R &amp;amp; notS &amp;amp; (B &amp;amp; C))&#xA;notB = (notR &amp;amp; notS) | (notR &amp;amp; S &amp;amp; (A | C)) | (R &amp;amp; notS &amp;amp; (A &amp;amp; C))&#xA;notC = (notR &amp;amp; notS) | (notR &amp;amp; S &amp;amp; (A | B)) | (R &amp;amp; notS &amp;amp; (A &amp;amp; B))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="81161" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-06-17T09:21:45.120" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16551" PostTypeId="2" ParentId="2140" CreationDate="2018-06-18T17:38:48.030" Score="1" Body="&lt;h1&gt;Binary Positional Average&lt;/h1&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;(This challenge is from work today)&#xA;This challenge seems relevant for actual use in the real world, it's a (as far as i know) not yet dealt with kind of integer sequences.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Inputs: A Integer between 1 and 64 representing the amount of bits to iterate through&lt;/li&gt;&#xA;&lt;li&gt;Output: An Array or a delimiter separated sequence of arrays or sequences of 0s and 1s&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The algorithm has to take the input and generate all binary sequences up to the given number ordered by the position of the average 1 bit in the binary representation of the current number.&#xA;The direction of the sorting is irrelevant.&#xA;0 can be ignored.&lt;/p&gt;&#xA;&lt;p&gt;The solution must terminate, otherwise this is code golf, tiebreaker is performance in program steps.&lt;/p&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;4&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Has (among others) the following possible outputs:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;0001,0011,0101,0010,0111,1011,0110,1111,0000,1001,1101,1110,1010,0100,1100,1000&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Or:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;0001,0011,0111,0010,0101,1011,0110,1111,1001,1101,1010,1110,0100,1100,1000&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Example Implementation&lt;/h1&gt;&#xA;&lt;p&gt;(Javascript - modified sketch from work)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;function binaryPositionalAverage(size) {&#xA;&#xA;    let srMap = [];&#xA;&#xA;    for (let i = 2**size -1; i &amp;gt; 0; i--) {&#xA;&#xA;        let inp = (i).toString(2);&#xA;        let out = &amp;quot;&amp;quot;;&#xA;        // pad with 0s&#xA;        for (let i = 0; i &amp;lt; (size - inp.length); i++) {&#xA;            out += &amp;quot;0&amp;quot;;&#xA;        }&#xA;        out += inp;&#xA;        out = out.split(&amp;quot;&amp;quot;).map(s =&amp;gt; parseInt(s));&#xA;        // out format: [1,1,1,1];&#xA;&#xA;        let rating = 0;&#xA;        let divisor = 0; // we ignore 0 by loop condition&#xA;        for (let k = 0; k &amp;lt; out.length; k++) {&#xA;            if (out[k]) {&#xA;                rating += k+1;&#xA;                divisor++;&#xA;            }&#xA;        }&#xA;        rating /= divisor;&#xA;&#xA;        srMap.push({&#xA;            rating: rating,&#xA;            binary: out,&#xA;        });&#xA;    }&#xA;    return srMap.sort((a, b) =&amp;gt; a.rating - b.rating).map(e =&amp;gt; e.binary);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="81188" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-06-19T20:13:00.560" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16552" PostTypeId="2" ParentId="2140" CreationDate="2018-06-18T23:19:57.587" Score="0" Body="&lt;h1&gt;The Shifty Maze&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/maze&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;maze&amp;#39;&quot; rel=&quot;tag&quot;&gt;maze&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python3&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python3&amp;#39;&quot; rel=&quot;tag&quot;&gt;python3&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;You are a wild mouse and you have stumbled on a maze that some human has constructed to observe your behavior. The maze is littered with blobs of peanut butter and has a cache of sunflower seeds near its center. After discovering the seeds, you decide that you want to take them all home to your personal cache. You must find your way to the seeds and exit the maze. Since there are so many seeds, it takes you many trips to get them all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Things go well your first time. You find your way to the seeds, bring a few back, and return to the maze. To your surprise, when you return the second time, the maze looks nothing like it did before, but you quickly figure out that the entrance was simply in a different place and continue navigating as usual. The next time you return to the maze, you are once again lost, but you find a familiar pattern of peanut butter dabs and find your way to the sunflower seeds once again. Naturally, you catch onto this pattern and eventually retrieve all the sunflower seeds.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to make a &quot;mouse&quot; bot that navigates through a maze where the entrance moves to somewhere else on the edge of the maze every time you exit and enter it. You have no limits on memory, but no absolute sense of direction and a limited visual field. You can only exit the maze after finding the cache. Your goal is to get all of the seeds in as few steps as possible.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Mazes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;https://www.google.com/search?q=perfect%20maze%20definition&quot; rel=&quot;nofollow noreferrer&quot;&gt;perfect maze&lt;/a&gt; is randomly generated using a randomized version of &lt;a href=&quot;https://en.wikipedia.org/wiki/Maze_generation_algorithm#Randomized_Prim&amp;#39;s_algorithm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Prim's Algorithm&lt;/a&gt; starting from a cell near the center. The seed cache will be close to the center. 10% of the cells will be dabbed with 3-5 units of peanut butter. There will not be any peanut butter on the same cell as the seed cache. The maze used for scoring will be 30x30 cells.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Actions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each turn, you can move forward or turn 90 degrees in either direction. If there is any peanut butter on your current cell, you may also eat one unit of it instead of moving or turning. (Partially eaten peanut butter can be used to create landmarks for navigation.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Vision&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You can see every cell in a straight line in front of you until a wall obstructs your view. You can also see one cell to your left and right, provided there is no wall between that cell and your current cell.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For each cell that you can see, you can see whether there is a wall on each of the four edges of the cell, how much peanut butter is on that cell, and whether it is the seed cache or the exit.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Suppose you had this maze:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+-----+-------+-+---+&#xA;|     |  5    | |   |&#xA;| ----+-- +---+ | --+&#xA;|4    |   |@   3    |&#xA;| --+-+ --+---- | --+&#xA;|   | |    4   &amp;lt;|   |&#xA;| --+ | --+ | | +-+ |&#xA;|         | | |   | |&#xA;| | +-- --+-+ +-- +-+&#xA;| | |    3  | |     |&#xA;+-+-+-------+-+ ----+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;@&lt;/code&gt; is the seed cache. Numbers are blobs of peanut butter. &lt;code&gt;&amp;lt;&lt;/code&gt; is the mouse (facing west)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The vision for the mouse would look something like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  +-+&#xA;&#xA;  + +&#xA;  | |&#xA;  + +    &#xA;   4|&#xA;  + +&#xA;    |&#xA;+-+ + +&#xA;|.(^)3&#xA;+ +-+ +&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;No memory limit&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You can remember as little or as much as you would like. The challenge is in figuring out where you are as quickly as possible and reduce the amount of time you spend wandering.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test Driver&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The test driver can be found &lt;a href=&quot;https://github.com/Beefster09/pcg-general/blob/master/shifty.py&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Coding&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your solution should be compatible with Python 3.7. You should implement a class with the following methods:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A constructor taking no arguments&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;get_action&lt;/code&gt;, which is called with one argument representing your vision on each step of navigation (more on that below). This should return a string representing the action to take: &lt;code&gt;forward&lt;/code&gt;, &lt;code&gt;left&lt;/code&gt;, &lt;code&gt;right&lt;/code&gt;, or &lt;code&gt;eat&lt;/code&gt; are valid values. If this returns an action that cannot be taken, an exception will be thrown and your solution will be considered invalid.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;enter_maze&lt;/code&gt;, which is called without arguments each time the maze is entered. No return value is expected and the function doesn't actually have to do anything. The next time &lt;code&gt;get_action&lt;/code&gt; is called, you are guaranteed to be on the cell on the edge of the maze facing away from the entrance/exit.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;The Vision Object&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You will receive an object with the following attributes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;left&lt;/code&gt; and &lt;code&gt;right&lt;/code&gt;: the cells to your left and right. If there is a wall that obstructs your view, this will be &lt;code&gt;'???'&lt;/code&gt; instead of the cell view object.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;forward&lt;/code&gt;: a list of all the cells in your forward vision, starting with your current cell and continuing until the last cell in your vision.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Any of these cell views may also be &lt;code&gt;None&lt;/code&gt;, indicating the entrance/exit of the maze.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each visible cell inside the maze will be an object with the following attributes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;forward&lt;/code&gt;, &lt;code&gt;left&lt;/code&gt;, &lt;code&gt;right&lt;/code&gt;, &lt;code&gt;back&lt;/code&gt;: booleans indicating whether there is a wall in the given directions, oriented the same way as the mouse.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;contents&lt;/code&gt;: an integer representing the amount of peanut butter (if any), None (if nothing is on the cell), or 'cache' if the cell contains the seed cache.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Scoring and Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard loopholes apply.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If your bot only works on the scoring maze, it is an invalid solution. Your bot does not receive enough input to distinguish the scoring maze from another maze, so hard-coding a route will produce an invalid solution.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Run the test driver to score your result. It uses an isolated and seeded random number generator to ensure that all entries get the same maze and sequence of entrances. The total number of turns it took to retrieve all of the seeds (this takes 100 iterations through the maze) is your score.&lt;/li&gt;&#xA;&lt;li&gt;Include your score, your code, and an explanation in your solution post.&lt;/li&gt;&#xA;&lt;li&gt;You must output a valid move each turn. Moving into a wall or attempting to eat nonexistent peanut butter will result in an error that you have no opportunity to recover from.&lt;/li&gt;&#xA;&lt;li&gt;You may not exit the maze until you have visited the cell containing the seed cache since the last time you entered the maze.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2018-07-20T17:00:45.147" LastActivityDate="2018-07-20T17:00:45.147" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16554" PostTypeId="2" ParentId="2140" CreationDate="2018-06-19T05:28:21.867" Score="1" Body="&lt;h2&gt;Execute a Subpar Shuffle™&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Inspired by the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/166999/execute-a-superb-shuffle&quot;&gt;Execute a Superb Shuffle™&lt;/a&gt; challenge, and a shuffling method I used as a young child before I realised how bad (and time consuming) it is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a Subpar Shuffle, you take the deck of cards, and perform the following actions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Take the top card of the deck and deal it out into a pile.&lt;/li&gt;&#xA;&lt;li&gt;Take the next card of the deck and place it underneath the deck.&lt;/li&gt;&#xA;&lt;li&gt;Repeat steps 1 &amp;amp; 2 until you've dealt out the whole deck.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;If your deck is represented as a list, then it looks something like this:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Set up an empty list to hold the shuffled list.&lt;/li&gt;&#xA;&lt;li&gt;Put the first item of the old list at the start of the new list.&lt;/li&gt;&#xA;&lt;li&gt;Put the first item of the old list at the end of the old list.&lt;/li&gt;&#xA;&lt;li&gt;Repeat 2 &amp;amp; 3 until the old list is empty, then return the new list.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;So, for example, the input list [1, 2, 3, 4] would result in the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Old list     | New list&#xA;[1, 2, 3, 4] | []&#xA;[2, 3, 4]    | [1]          Put the 1 at the start of the new list&#xA;[3, 4, 2]    | [1]          Put the 2 at the end of the old list&#xA;[4, 2]       | [3, 1]       Put the 3 at the start of the new list&#xA;[2, 4]       | [3, 1]       Put the 4 at the end of the old list&#xA;[4]          | [2, 3, 1]    Put the 2 at the start of the new list&#xA;[4]          | [2, 3, 1]    Put the 4 at the end of the old list&#xA;[]           | [4, 2, 3, 1] Put the 4 at the start of the new list&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So the final Subpar Shuffled list is [4, 2, 3, 1].&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are a few more test results for Subpar Shuffling of various lists:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input                     | Output&#xA;[]                        | []&#xA;[&quot;Ace of Spades&quot;]         | [&quot;Ace of Spades&quot;]&#xA;[&quot;A&quot;,&quot;c&quot;,&quot;e&quot;,&quot;o&quot;,&quot;f&quot;,&quot;S&quot;] | [&quot;o&quot;,&quot;S&quot;,&quot;c&quot;,&quot;f&quot;,&quot;e&quot;,&quot;A&quot;]&#xA;[1,2,3,4,5,6,7,8,9,0]     | [4,8,0,6,2,9,7,5,3,1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="32668" LastActivityDate="2018-06-19T05:28:21.867" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16556" PostTypeId="2" ParentId="14910" CreationDate="2018-06-20T02:29:27.427" Score="17" Body="&lt;h2&gt;MathJax has been re-enabled for PPCG&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;\$&lt;/code&gt; is the inline delimiter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let us know if there are any problems. We're aware that search is a little bit funky:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/6L49g.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/6L49g.png&quot; alt=&quot;funky search&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2018-06-20T02:29:27.427" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16557" PostTypeId="2" ParentId="14910" CreationDate="2018-06-20T03:01:37.293" Score="2" Body="&lt;p&gt;\$Test\$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$Test$$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;\$\LaTeX\$&lt;/p&gt;&#xA;" OwnerUserId="60042" LastActivityDate="2018-06-20T03:01:37.293" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16558" PostTypeId="2" ParentId="2140" CreationDate="2018-06-20T12:56:35.673" Score="-4" Body="&lt;p&gt;Write a function that takes &lt;strong&gt;compares each pair of adjacent items and swaps them if they are in the wrong order&lt;/strong&gt;. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted.&lt;/p&gt;&#xA;&lt;p&gt;Static visualization of bubble sort and a gif explanation.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://upload.wikimedia.org/wikipedia/commons/thumb/b/bd/Bubblesort-edited.svg/220px-Bubblesort-edited.svg.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/thumb/b/bd/Bubblesort-edited.svg/220px-Bubblesort-edited.svg.png&quot; alt=&quot;Bubble sort explanation&quot; /&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://upload.wikimedia.org/wikipedia/commons/5/54/Sorting_bubblesort_anim.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/5/54/Sorting_bubblesort_anim.gif&quot; alt=&quot;Bubble sort gif&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt; The steps go from left to right. At each stage, an exchange is made. The darkest color has the most value and finds its final place (bottom) first.&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;The rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The function must take a list of integers that shall be sorted (less than 20 elements)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The function must print each step of the sort.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Yes, built-in Bubble sort algorithms are permitted.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No, you can not assume only positive integers or unique integers.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest code wins!&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;input list&#xA;5 4 3 1 2&#xA;1 2 3 5 4&#xA;11 4 2 1 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Optional&lt;/h2&gt;&#xA;&lt;p&gt;Add an interpreter so the submission can be tested. It is allowed to write this interpreter yourself for a previously unimplemented language.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;em&gt;Note&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;It's my first code-golf idea I'm fully open to improving it with more experienced users if I missed something.&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;This is not a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/q/92753/78116&quot;&gt;Bubble sorting in progress&lt;/a&gt;.&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;Thanks to &lt;a href=&quot;https://codegolf.stackexchange.com/users/41024/erik-the-outgolfer&quot;&gt;@Erik the Outgolfer&lt;/a&gt; for encouraging me to post my idea in the sandbox.&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/bubble&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;bubble&amp;#39;&quot; rel=&quot;tag&quot;&gt;bubble&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot;&gt;sorting&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="78116" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-06-20T12:56:35.673" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16559" PostTypeId="2" ParentId="2447" CreationDate="2018-06-20T15:29:06.457" Score="7" Body="&lt;h1&gt;If a program is supposed to take a whole number as input, it may accept the number as a unary string.&lt;/h1&gt;&#xA;" OwnerUserId="11067" LastActivityDate="2018-06-20T15:29:06.457" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16561" PostTypeId="1" CreationDate="2018-06-21T17:03:32.453" Score="13" ViewCount="795" Body="&lt;p&gt;It's been a while since I've been here, and now it seems that nobody uses CJam or Pyth anymore. New languages have sprung up since then. Has that happened just naturally? Was there a rule change or something?&lt;/p&gt;&#xA;" OwnerUserId="40857" LastActivityDate="2018-06-22T07:58:57.393" Title="What happened to languages like CJam and Pyth?" Tags="|discussion|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16562" PostTypeId="2" ParentId="16561" CreationDate="2018-06-21T17:21:37.293" Score="17" Body="&lt;p&gt;This is a natural process; newer golfing languages learn from the shortcomings of their predecessors.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When I joined the site, the most popular golfing language was GolfScript. Once CJam, which was heavily inspired by GolfScript, was published, GolfScript got used less and less. This isn't (only) because GolfScript would almost always lose to CJam, but also because it was easier to use because of its built-ins and stricter typing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Pyth is newer than CJam, but so vastly different from it that many CJam users never switched. It is still fairly common compared to CJam (~250 Pyth answers in 2018, ~100 CJam answers), possibly because of its uniqueness. CJam, on the other hand, is a stack-based language; there are many newer stack-based languages you could use instead.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2018-06-21T17:21:37.293" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16563" PostTypeId="2" ParentId="16561" CreationDate="2018-06-21T18:11:01.447" Score="16" Body="&lt;p&gt;This is quite normal, given that newer and better golfing languages, with terser paradigms and built-ins have appeared (e.g &lt;a href=&quot;https://github.com/DennisMitchell/jellylanguage&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt;, &lt;a href=&quot;https://github.com/Adriandmen/05AB1E&quot; rel=&quot;nofollow noreferrer&quot;&gt;05AB1E&lt;/a&gt;, &lt;a href=&quot;https://github.com/barbuz/Husk&quot; rel=&quot;nofollow noreferrer&quot;&gt;Husk&lt;/a&gt; etc.).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although both Pyth and CJam are still both used, this usage has indeed decreased a lot. Let's analyse what happened in Pyth's case, as I don't have much of a CJam background. As a prefix-based language with powerful control-flow structures, Pyth has always been quite unique. Some users that were already actively golfing in other languages existent at the time never actually switched to this language, mainly because it was so different from those that were already existent. There are a couple of reasons that lead to a decrease in activity when it comes to Pyth:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It is ASCII-only, and newer golf-langs such as the aforementioned ones took advantage of custom encodings to vastly increase the number of available commands (this also applies to CJam). This is something that definitely disadvantages Pyth a lot – It lacks some built-in functions that were introduced to those languages later on (notable examples include &lt;em&gt;divisors&lt;/em&gt;, &lt;em&gt;exponents of prime factorization&lt;/em&gt; etc.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Some of the most proficient Pyth users have gone quite inactive: &lt;a href=&quot;https://codegolf.stackexchange.com/users/20080/isaacg&quot;&gt;isaacg&lt;/a&gt; (its creator), &lt;a href=&quot;https://codegolf.stackexchange.com/users/29577/jakube&quot;&gt;Jakube&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/31625/fryamtheeggman&quot;&gt;FryAmTheEggman&lt;/a&gt; and there are certainly many more I am omitting. Talking about creators, CJam is in the exact same situation with &lt;a href=&quot;https://codegolf.stackexchange.com/users/7416/aditsu&quot;&gt;aditsu&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The last point on this list, and perhaps the most important: they both aren't as competitive as they used to be, often being beaten consistently by other esolangs. I think this doesn't need further explanation.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And while they are less used than they were before, don't be hesitant about having fun golfing with them :). At the very least, I still am enjoying myself when using Pyth.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastActivityDate="2018-06-21T18:11:01.447" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16564" PostTypeId="2" ParentId="16561" CreationDate="2018-06-22T07:58:57.393" Score="18" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;now it seems that nobody uses CJam or Pyth anymore.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Reports of their demise are greatly exaggerated. The &lt;a href=&quot;http://data.stackexchange.com/codegolf/query/793250/top-language-golfers?Lang=CJam&quot; rel=&quot;nofollow noreferrer&quot;&gt;Top Language Golfers&lt;/a&gt; query shows that 20 people have posted 86 CJam answers this year; Pyth is harder because the query mixes in Python answers, but with a &lt;a href=&quot;http://data.stackexchange.com/codegolf/query/865867/top-language-golfers-ii?Lang=Pyth&amp;amp;Since=2018-01-01&quot; rel=&quot;nofollow noreferrer&quot;&gt;modification to the script&lt;/a&gt; I think it's 34 users and 232 answers. (All numbers approximate, depending as they do on heuristic string matching).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, it is fair to say that they are in decline: the query shows about 164 CJam answers in the second half of 2017, and about 585 Pyth answers over the same timeframe.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As to the actual reasons, though, we can only speculate. Engagement levels is probably a factor. My own decline from 23 CJam answers to 8 is largely down to lack of interesting questions, as a result of which I'm spending more time on the Code Review stack and less on PPCG.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-06-22T07:58:57.393" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16565" PostTypeId="2" ParentId="2140" CreationDate="2018-06-22T12:20:02.703" Score="2" Body="&lt;h1&gt;Progrqmming Puzzle andf Co9de Golf |&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Intro&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We all make mistakes. You, me, everyone. But not computers. They aren't making any mistake. Not even a single typo.&lt;br&gt;&#xA;Time to change this injustice.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task will be to take a string as input, and display the string character by character, and with a cursor, as if someone was typing it. &lt;em&gt;But there is a twist&lt;/em&gt; : sometimes, the &quot;entered&quot; character will be wrong. In that case there is a little pause, then the last entered character (which is supposed to be wrong) is deleted.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input and output will contain only printable ASCII characters.&lt;/li&gt;&#xA;&lt;li&gt;The cursor should be displayed as &lt;code&gt;|&lt;/code&gt;, preceded by a space. This will always be displayed, from the empty string to the exact input displayed.&lt;/li&gt;&#xA;&lt;li&gt;Each &quot;iteration&quot; (new character) is separated by a 0.25s pause (It takes time to write right). You can have a marge error of 0.05s, meaning the pause have to be lower than 0.2s, and lower than 0.3&lt;/li&gt;&#xA;&lt;li&gt;Each character has exactly 1/10 chance to be wrong (that means it will be anything but the right character). In that case you should add a 1s pause (&quot;Wait, did l really made a mistake?&quot;), then delete this character, add a 0.25s pause (with a marge error of 0.05s), then continue.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Hello!&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Possible output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note : I am planning to add a gif to show what the code should do. For now, consider every line as a gif frame&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;H |          // 0.25s pause&#xA;He |         // 0.25s   &quot;&#xA;Hel |        // 0.25s   &quot;&#xA;HelG |       // 1s      &quot;&#xA;Hel |        // 0.25s   &quot;&#xA;Hell |       // 0.25s   &quot;&#xA;Hello |      // 0.25s   &quot;&#xA;Hello! |     // done&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Note for sandbox&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this challenge good enough ?&lt;/li&gt;&#xA;&lt;li&gt;Is this challenge already exist ?&lt;/li&gt;&#xA;&lt;li&gt;Is this challenge clear enough ?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41833" LastEditorUserId="41833" LastEditDate="2018-06-28T06:35:28.950" LastActivityDate="2018-06-28T06:35:28.950" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="16566" PostTypeId="2" ParentId="2140" CreationDate="2018-06-22T17:23:31.223" Score="1" Body="&lt;h1&gt;A fast-growing evaluator&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The fast-growing hierarchy is a hierarchy of, well, fast-growing functions, with a one-to-one correspondence to ordinals. If you did some &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/busy-beaver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;busy-beaver&amp;#39;&quot; rel=&quot;tag&quot;&gt;busy-beaver&lt;/a&gt; challenges, you may have worked with them, since it's a systematic means of defining functions with extremely fast growth rates. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here, you are defining as many of them as you can. Of course, because of obvious problems with enumerating them sequentially, the challenge is to yield any particular one given the ordinal, up to as far an upper limit as possible. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The fast-growing hierarchy&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you are lost on some of the jargon here, I recommend a read about ordinals: &lt;a href=&quot;https://en.wikipedia.org/wiki/Ordinal_number&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://en.wikipedia.org/wiki/Ordinal_number&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The fast growing hierarchy is defined for each ordinal in a recursive manner as follows: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The lowest and slowest function, corresponding to 0, is f&lt;sub&gt;0&lt;/sub&gt;(n) = n+1.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;f&lt;sub&gt;0&lt;/sub&gt;(3) = 3+1 = 4&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For succeeding ordinals and functions in the hierarchy, f&lt;sub&gt;a+1&lt;/sub&gt;(n) = f&lt;sub&gt;a&lt;/sub&gt;&lt;sup&gt;n&lt;/sup&gt;(n). &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;f&lt;sub&gt;1&lt;/sub&gt;(2) = f&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;(2) = f&lt;sub&gt;0&lt;/sub&gt;(f&lt;sub&gt;0&lt;/sub&gt;(2)) = f&lt;sub&gt;0&lt;/sub&gt;(3) = 4&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For functions in the hierarchy corresponding to limit ordinals, first determine a fundamental sequence that approaches the ordinal in question. Then, f&lt;sub&gt;a&lt;/sub&gt;(n) = f&lt;sub&gt;a[n]&lt;/sub&gt;(n), where a[n] is the nth ordinal in the fundamental sequence. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The fundamental sequence of ω is {0, 1, 2, 3...}, indexing from zero. So f&lt;sub&gt;ω&lt;/sub&gt;(2) = f&lt;sub&gt;2&lt;/sub&gt;(2) = f&lt;sub&gt;1&lt;/sub&gt;(f&lt;sub&gt;1&lt;/sub&gt;(2)) = f&lt;sub&gt;1&lt;/sub&gt;(4) = 8&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;As can be seen, for infinite-ordinal entries of the fast-growing hierarchy, the value of the function is dependent on the choice of fundamental sequences. Most ordinal notations specify fundamental sequences with the ordinals that they define notations for. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some typical choices of ordinal notations and fundamental sequences, arranged in increasing ordinal-notating capability: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Ordinal_arithmetic#Cantor_normal_form&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cantor normal form&lt;/a&gt;, for which &lt;a href=&quot;http://cantorsattic.info/Fast-growing_hierarchy&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Wainer hierarchy&lt;/a&gt; defines fundamental sequences&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Veblen_function&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Veblen functions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://cantorsattic.info/Madore%27s_%CF%88_function&quot; rel=&quot;nofollow noreferrer&quot;&gt;Madore's ordinal collapsing function&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://cantorsattic.info/Buchholz%27s_%CF%88_functions&quot; rel=&quot;nofollow noreferrer&quot;&gt;Buchholz's ordinal collapsing functions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://cantorsattic.info/J%C3%A4ger%27s_collapsing_functions_and_%CF%81-inaccessible_ordinals&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jager's ordinal collapsing functions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Within 1024 bytes, write a program that takes the string representation of an ordinal A in some ordinal interval starting at 0, and a number B of arbitrary size, and prints the fast-growing function corresponding to A, applied to B. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Choices of domain of representation, ordinal domain, ordinal notation, and ordinal fundamental sequences must be specified. The choice of fundamental sequences must actually approach the ordinals they define fundamental sequences to, such that logically, the ωth ordinal of that sequence would be the ordinal of that fundamental sequence. &lt;/li&gt;&#xA;&lt;li&gt;The program must provably halt for any input, given sufficient resources, even for invalid inputs or inputs corresponding to ordinals beyond the program's capability. In particular, raw eval() of the input is forbidden, and entries are disqualified if they permit arbitrary code execution. &lt;/li&gt;&#xA;&lt;li&gt;For all given ordinals with the program's capability, the program must print the value as described above for all numbers, deterministically, given enough resources. &lt;/li&gt;&#xA;&lt;li&gt;Standard restrictions on running time and resource usage of programs are relaxed. &lt;/li&gt;&#xA;&lt;li&gt;Competing entries must be able to handle at least A=0. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Take C to be the first ordinal for which the program fails to satisfy the requirements above, and D to be the difference between your program byte length and 1024, the maximum byte length of submissions. Then your score is C+D. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sample scores:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Alice, in 200 bytes, writes a program for which A can be any natural number. Her score is ω+824. &lt;/li&gt;&#xA;&lt;li&gt;Bob, in 220 bytes, writes a program for which A can be ω or any natural number. His score is (ω+1)+804 = ω+805. &lt;/li&gt;&#xA;&lt;li&gt;Carol, in 400 bytes, writes a program for which A can be any ordinal purely in Cantor normal form. Her score is ε&lt;sub&gt;0&lt;/sub&gt;+624.&lt;/li&gt;&#xA;&lt;li&gt;Dave, in 700 bytes, writes a program for which A can be a natural number or any epsilon number. His score is ω+324. &lt;/li&gt;&#xA;&lt;li&gt;Eve, in 300 bytes, writes a program which segfaults if A is represented by a decimal string longer than 65536 bytes. Her score is 10&lt;sup&gt;65536&lt;/sup&gt;+724. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="43363" LastEditorUserId="43363" LastEditDate="2018-06-23T01:32:51.980" LastActivityDate="2018-06-23T01:32:51.980" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16571" PostTypeId="2" ParentId="2140" CreationDate="2018-06-24T18:48:50.160" Score="0" Body="&lt;h1&gt;Rotational symmetry in which bases from 2 to 36&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A number (here, a non-negative integer) is rotationally symmetric if it &quot;looks&quot; the same after being rotated 180 degrees. For example, &lt;code&gt;69&lt;/code&gt; (heh.) &#xA; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/77866/numbers-with-rotational-symmetry&quot;&gt;Here's a related challenge.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We're going to consider bases from 2 to 36, using the symbols &lt;code&gt;0-9A-Z&lt;/code&gt; as the digits. We're going to be generous with what digits are rotationally similar. Each of the following pairs will qualify (order not relevant):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;00, 11, 22, 55, 69, 88, B8, D0, DD, E3, I1, L7, S5, SS, Z2, XX, ZZ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;The challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given a non-negative integer &lt;code&gt;n&lt;/code&gt; in base 10, write a program or function that produces a list of bases from 2 to 36 in which the &lt;code&gt;n&lt;/code&gt; is rotationally symmetric.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input and output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Any reasonable input format is allowed (the integer itself, its character representation, an array of digits, an array of digits as characters.) &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any output format that communicates the desired result in an unambiguous way is acceptable. For example, a 35 element array of truthy/falsey values. If it's easier to include base 1 (always truthy) that's fine too.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. Fewest bytes in each language. Usual rules apply.&lt;/p&gt;&#xA;" OwnerUserId="79980" LastEditorUserId="79980" LastEditDate="2018-06-24T18:59:08.577" LastActivityDate="2018-06-24T18:59:08.577" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16573" PostTypeId="2" ParentId="2140" CreationDate="2018-06-26T02:11:10.103" Score="0" Body="&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;n=2πr&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an input, n, print a circle with the circumference of n characters.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The characters for the circumference of the circle can be any non-whitespace character&lt;/li&gt;&#xA;&lt;li&gt;Shapes don't have to be an amazing circle, kinda roundish shapes are still valid&lt;/li&gt;&#xA;&lt;li&gt;The circle can have a small gap, but no overlap&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: 1&#xA;Output:&#xA;o&#xA;&#xA;Input: 2&#xA;Output:&#xA;oo&#xA;&#xA;Input: 3&#xA;Output:&#xA;oo&#xA;o&#xA;&#xA;Input: 7&#xA;Output:&#xA; ooo&#xA;o   o&#xA; oo&#xA;&#xA;Input: 20&#xA;Output:&#xA;  oooooo&#xA; o      o&#xA;o        o&#xA;o        o&#xA; o      o    &#xA;  oooooo&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="79918" LastActivityDate="2018-06-26T02:11:10.103" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16575" PostTypeId="2" ParentId="2140" CreationDate="2018-06-26T14:07:33.390" Score="2" Body="&lt;h1&gt;Convincingly Fake Compression of Random Data &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;As you may know, it is impossible to write an compression method that takes strings of length &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and returns strings of length &lt;span class=&quot;math-container&quot;&gt;\$n - 1\$&lt;/span&gt;. This can be proven by a simple argument: Each compression function must be a bijection, because otherwise the compressed strings can not unambiguously be uncompressed. However, just considering bit strings, there are &lt;span class=&quot;math-container&quot;&gt;\$2^n\$&lt;/span&gt; strings of length &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, but only &lt;span class=&quot;math-container&quot;&gt;\$2^{n-1}\$&lt;/span&gt; strings of length &lt;span class=&quot;math-container&quot;&gt;\$n-1\$&lt;/span&gt;, thus no such bijection can exist.&lt;/p&gt;&#xA;&lt;p&gt;In other words, for each attempt to write such a compression function, there exist strings which cannot be compressed.&lt;/p&gt;&#xA;&lt;p&gt;The task for the cops in this challenge is to write a function which looks like it can compress arbitrary fixed-length strings, and the task of the robbers is to find a string for which the compression function fails.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Sandbox&lt;/h3&gt;&#xA;&lt;p&gt;I'm not yet convinced if this will actually work as a challenge, mainly if it is feasible for the cops to write a submission which is not easily crackable. It might be easier for large &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; so robbers can not brute force, so I could make the cops winning criterion about getting the safe submission with the lowest &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;. Any ideas for a better winning criterion?&lt;/p&gt;&#xA;&lt;p&gt;Also do you think this will work as a challenge?&lt;/p&gt;&#xA;" OwnerUserId="56433" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-06-26T14:07:33.390" CommentCount="17" ContentLicense="CC BY-SA 4.0" />
  <row Id="16578" PostTypeId="2" ParentId="2140" CreationDate="2018-06-26T23:55:38.310" Score="0" Body="&lt;h1&gt;Shortest code to send an html s/mime signed message with one attachment over smtps&lt;/h1&gt;&#xA;&lt;p&gt;Simple challenge : use a valid RSA based security certificate in order to sign message &lt;a href=&quot;https://www.rfc-editor.org/rfc/rfc5751&quot; rel=&quot;nofollow noreferrer&quot;&gt;according to s/mime rules&lt;/a&gt; and send it over smtp over TLS on port 465 (or starttls on port 25).&lt;/p&gt;&#xA;&lt;h2&gt;Rules :&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program parameters takes an ʜᴛᴍʟ string consisting of message body ; a message subject as string ; a sender address as string ; and list of recipients address.&lt;br /&gt;&#xA;They can be obtained either as function/class parameters or program arguments or read from keyboard input.&lt;/li&gt;&#xA;&lt;li&gt;The security certificate is read from an hardcoded file name of your choice or a hardcoded non empty string.&lt;br /&gt;&#xA;It can be in the format of your choice.&lt;/li&gt;&#xA;&lt;li&gt;The attachment is read is read from an hardcoded file name of your choice or 2 non empty hardcoded strings (1 for filepath and the other 1 for content)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.rfc-editor.org/rfc/rfc5751&quot; rel=&quot;nofollow noreferrer&quot;&gt;The s/mime signing rules&lt;/a&gt; state that message body should be signed and other part shoudln’t be signed, this means in practice that data stating the message is in the html format and all data about attachments should be signed (subject priority, and e‑mail addresses aren’t signed).&lt;/li&gt;&#xA;&lt;li&gt;When I say you have free choice, just pick up the solution using the fewest bytes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt; Winner&lt;/h2&gt;&#xA;&lt;p&gt;The code which uses the fewest bytes.&lt;/p&gt;&#xA;" OwnerUserId="50239" LastEditorUserId="-1" LastEditDate="2021-10-07T07:34:52.683" LastActivityDate="2018-06-27T08:54:25.633" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16579" PostTypeId="2" ParentId="2140" CreationDate="2018-06-28T05:23:13.483" Score="0" Body="&lt;h1&gt;Earth mover's distance &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Dupe check: Do we already have a challenge about the &lt;a href=&quot;https://en.wikipedia.org/wiki/Earth_mover%27s_distance&quot; rel=&quot;nofollow noreferrer&quot;&gt;Earth mover's distance&lt;/a&gt;? &#xA;Some possibilities could be to compute it for a 1D array, a 2D array, or a circle.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2018-06-28T05:41:59.327" LastActivityDate="2018-06-28T05:41:59.327" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16583" PostTypeId="1" CreationDate="2018-06-29T10:46:19.497" Score="4" ViewCount="79" Body="&lt;p&gt;I'm considering adding a bounty to this question, once it qualifies:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/167568/bot-outsnake-the-game&quot;&gt;Bot: Outsnake the game!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I just wondered what the etiquette is for bounties on code challenges:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should it be awarded in a given time-scale?&lt;/li&gt;&#xA;&lt;li&gt;Would it be seen as self-promotion? Is it not the 'done thing'?&lt;/li&gt;&#xA;&lt;li&gt;What's a good amount to put up as a bounty? &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I hope it would make the challenge a little more interesting, if there's an actual reward, but I don't want it to become a point of contention.&lt;/p&gt;&#xA;" OwnerUserId="16824" LastActivityDate="2018-06-29T12:12:01.037" Title="Bounty on a challenge?" Tags="|support|bounty|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16584" PostTypeId="2" ParentId="16583" CreationDate="2018-06-29T12:12:01.037" Score="5" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Should it be awarded in a given time-scale?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If you use an actual bounty, you either award it within a given time-scale (it expires after 7 days, but you have a short grace period during which you can still award it) or you lose it. If no answer meets the criteria, you can choose not to award. However, in that case it might be awarded automatically at half value. These and other details are described in the Mother Meta thread &lt;a href=&quot;https://meta.stackexchange.com/q/16065/164922&quot;&gt;How does the bounty system work?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A PPCG-specific alternative, if you want an open-ended time scale, is to post an answer to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5243/194&quot;&gt;List of bounties with no deadline&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Would it be seen as self-promotion? Is it not the 'done thing'?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;No. It promotes the question rather than the OP. There is a cost in rep points to bountying your own question, but I've never seen a cost in real reputation (i.e. social respect). If the same person did it every week then maybe that would change.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;What's a good amount to put up as a bounty?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That depends on how much you can afford and how hard the criterion is to achieve. I've never seen anyone criticised for stinginess because they posted a bounty at the minimum possible level (50 rep). If the intention is more to have a fun prize rather than to incentivise people to tackle a really hard problem, and bearing in mind that you currently have about 2700 rep, I would suggest picking a value from the lower end of the spectrum.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-06-29T12:12:01.037" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16588" PostTypeId="2" ParentId="7804" CreationDate="2018-07-02T12:04:19.277" Score="20" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;em&gt;You're welcome to take this over. I don't have time, sorry :-(&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Count the pips in a pair of dice&lt;/h1&gt;&#xA;&lt;p&gt;Here are two photographs of a pair of randomly thrown dice. (OK, they're 3D renderings, but never mind). In the photo on the left, the dice are showing one and five pips. In the photo on the right, they are showing three and four pips. Can you program your computer to count the pips automatically?&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/1KLz2.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/1KLz2.jpg&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/uBQG6.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/uBQG6.jpg&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;The challenge:&lt;/h2&gt;&#xA;&lt;p&gt;Write a program that takes as its input the filename of a 240×180 JPEG image similar to the above examples, and outputs two numbers corresponding to the pips visible on the top faces of the dice (in ascending order). Your program must accomplish this in less than five seconds on an averagely specced desktop computer.&lt;/p&gt;&#xA;&lt;h2&gt;Images:&lt;/h2&gt;&#xA;&lt;p&gt;For training and testing purposes, I have created a &lt;a href=&quot;https://ruletheweb.co.uk/dice-images/&quot; rel=&quot;nofollow noreferrer&quot;&gt;set of 1,000 JPEG images&lt;/a&gt; together with information about the number of pips visible in each image.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring:&lt;/h2&gt;&#xA;&lt;p&gt;For scoring purposes, it might be worth converting these to arrays of RGB values (or at least excluding the JPEG conversion code from the length of the submitted code). You might want to provide a randomly selected subset of these images for training, and reserve the other images for testing.&lt;/p&gt;&#xA;&lt;h2&gt;Notes:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;There are no images with any die intersecting the edge of the image frame. However, there are many images where one die is partially obscuring the other.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Both dice are standard right-handed dice, where each pair of opposite sides adds up to 7, and the numbers 1, 2 and 3 are arranged in anti-clockwise order around their shared vertex.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/counting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;counting&amp;#39;&quot; rel=&quot;tag&quot;&gt;counting&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="11006" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-07-02T12:04:19.277" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16589" PostTypeId="1" CreationDate="2018-07-02T15:41:49.860" Score="2" ViewCount="108" Body="&lt;p&gt;Since the Stack Exchange redesign, I try to reestablish that my topbar is fixed; but I can´t seem to get it right; and I can´t think of anything else than&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;@-moz-document domain(stackexchange.com) {&#xA;    .top-bar { position:fixed }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;in &lt;code&gt;userContent.css&lt;/code&gt;, but that has no effect.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any idea how I can keep the main navigational element on PPCG always in sight?&lt;/p&gt;&#xA;" OwnerUserId="55735" LastEditorUserId="30525" LastEditDate="2018-07-21T23:09:05.943" LastActivityDate="2018-07-21T23:09:05.943" Title="trying to get the (new) topbar fixed" Tags="|support|" AnswerCount="0" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16592" PostTypeId="1" CreationDate="2018-07-03T09:01:52.267" Score="12" ViewCount="743" Body="&lt;p&gt;In accordance with our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14645/16766&quot;&gt;meta agreement&lt;/a&gt; to have a Language of the Month, and since the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14737/16766&quot;&gt;list of nominations&lt;/a&gt; had a single highest-voted entry at the beginning of July, we have a new featured language! Throughout July 2018, our Language of the Month, nominated by myself, will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://github.com/ETHproductions/japt&quot; rel=&quot;nofollow noreferrer&quot;&gt;Japt&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;What's a Language of the Month?&lt;/h2&gt;&#xA;&lt;p&gt;See the meta posts linked above. In short, during July, those who wish to participate should learn (at least the basics of) Japt, use it to solve challenges, and discuss it in the &lt;a href=&quot;https://chat.stackexchange.com/rooms/34018/japt&quot;&gt;Japt chat room&lt;/a&gt;. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/tags/japt/info&quot;&gt;Information about Japt&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Japt&lt;/strong&gt; is a shortened version of &lt;strong&gt;Ja&lt;/strong&gt;vaScri&lt;strong&gt;pt&lt;/strong&gt;, created by &lt;a href=&quot;https://codegolf.stackexchange.com/users/42545/ethproductions&quot;&gt;ETHproductions&lt;/a&gt; in early November 2015.&lt;/p&gt;&#xA;&lt;p&gt;Japt is heavily based off of JavaScript; after transpiling Japt's syntax features to JavaScript, it is evaluated as vanilla JS. This allows easy building of an online interpreter. Some of the main features are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;One-letter functions:&lt;/strong&gt; each lowercase letter corresponds to a specific function, which is different on strings, arrays, and numbers.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;String compression:&lt;/strong&gt; Japt uses the &lt;a href=&quot;http://ed-von-schleck.github.io/shoco/&quot; rel=&quot;nofollow noreferrer&quot;&gt;shoco library&lt;/a&gt; for string compression. Wrapping a string in backticks tells the interpreter to automatically decompress it.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Anonymous functions:&lt;/strong&gt; &lt;code&gt;XY{X+Y}&lt;/code&gt; is transpiled to &lt;code&gt;function(X,Y){return X+Y}&lt;/code&gt;, as is &lt;code&gt;@X+Y}&lt;/code&gt;, and in some cases, simply &lt;code&gt;+&lt;/code&gt;. This allows for easy creation of functions on the fly.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Unicode shortcuts:&lt;/strong&gt; All 1-byte characters from &lt;code&gt;¡&lt;/code&gt; to &lt;code&gt;Ì&lt;/code&gt; transpile to longer sequences of chars.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Documentation&lt;/h2&gt;&#xA;&lt;p&gt;Documentation is available in the sidebar of the &lt;a href=&quot;https://ethproductions.github.io/japt/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Japt interpreter&lt;/a&gt; and the &lt;a href=&quot;https://ethproductions.github.io/japt/?v=2.0a0&quot; rel=&quot;nofollow noreferrer&quot;&gt;Japt v2.0a0 interpreter&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Other Links&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/121253/58974&quot;&gt;Golfing tips&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/ETHproductions/japt&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub Repo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/65191/58974&quot;&gt;Entry in the showcase of languages&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#japt&quot; rel=&quot;nofollow noreferrer&quot;&gt;Japt on TIO&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For help, you can also visit the &lt;a href=&quot;https://chat.stackexchange.com/rooms/34018/japt&quot;&gt;Japt chatroom&lt;/a&gt;. If no one's there, ping @ETHProductions, @Oliver or myself and we will get back to you.&lt;/p&gt;&#xA;&lt;p&gt;(If you consider yourself knowledgeable in Japt and would like to help teach it to other users, feel free to add your name to that list!)&lt;/p&gt;&#xA;&lt;h2&gt;Additional Efforts&lt;/h2&gt;&#xA;&lt;p&gt;In order to help promote Japt through the month and get more people to start using it, we - that being primarily ETH, Oliver &amp;amp; myself, but you may also see Bubbler and Nit contributing to - will be attempting to curtail/delay the posting of our own solutions&lt;/p&gt;&#xA;&lt;p&gt;We will also be offering some bounties to those participating. For starters, ETHProductions will be awarding 50 rep to every member posting their first Japt solution during July and I will be setting up some open-ended bounties, the first of which is listed below.&lt;/p&gt;&#xA;&lt;h3&gt;Bounties&lt;/h3&gt;&#xA;&lt;p&gt;Unless otherwise noted, the following bounties are all for 100 rep each and will expire at the end of July. If you have any suggestions for additional bounties, please leave a comment.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Best &lt;a href=&quot;https://codegolf.stackexchange.com/q/121253/58974&quot;&gt;Japt tip&lt;/a&gt; posted by someone who had not posted a tip prior to the 1st of July.&lt;/li&gt;&#xA;&lt;li&gt;All new contributors who add a number to &lt;a href=&quot;https://codegolf.stackexchange.com/a/124389/58974&quot;&gt;this solution&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Anyone who can manage to add Japt to &lt;a href=&quot;https://codegolf.stackexchange.com/q/167621/58974&quot;&gt;this&lt;/a&gt;. (200 rep)&lt;/li&gt;&#xA;&lt;li&gt;&lt;s&gt;First person to beat 24 bytes on &lt;a href=&quot;https://codegolf.stackexchange.com/q/167405/58974&quot;&gt;this challenge&lt;/a&gt;&lt;/s&gt; - Claimed by &lt;a href=&quot;https://codegolf.stackexchange.com/a/168105/58974&quot;&gt;Kamil Drakari&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;First person to score &lt;em&gt;below&lt;/em&gt; 20 bytes on &lt;a href=&quot;https://codegolf.stackexchange.com/q/167405/58974&quot;&gt;this challenge&lt;/a&gt; (200 rep, including the 100 rep above - will be awarded to Kamil if unclaimed at the end of the month)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-08-01T22:15:50.397" Title="Language of the Month for July 2018: Japt" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16593" PostTypeId="2" ParentId="16592" CreationDate="2018-07-03T09:05:19.533" Score="5" Body="&lt;h1&gt;List of &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=%22Japt%22+created%3A2018-06-31..2018-07-31+is%3Aanswer&quot;&gt;all Japt solutions posted&lt;/a&gt; in July&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(First time posters highlighted in bold)&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167774/58974&quot;&gt;Implement Malbolge's “crazy” operator&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58974&quot;&gt;Shaggy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167840/58974&quot;&gt;Concatenating n with n + 1&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410&quot;&gt;Bubbler&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167842/58974&quot;&gt;Pleasanortmanteaus&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/71434&quot;&gt;Kamil Drakari&lt;/a&gt;&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167901/58974&quot;&gt;First Last Last First&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78039&quot;&gt;Luis felipe De jesus Munoz&lt;/a&gt;&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167906/58974&quot;&gt;2D Array Middle Point&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78039&quot;&gt;Luis felipe De jesus Munoz&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167911/58974&quot;&gt;2D Array Middle Point&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/59487&quot;&gt;Mr. Xcoder&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167920/58974&quot;&gt;Concatenating n with n + 1&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58974&quot;&gt;Shaggy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167922/58974&quot;&gt;Find unique elements based on a given key&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78039&quot;&gt;Luis felipe De jesus Munoz&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167936/58974&quot;&gt;In for a bumpy ride&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58974&quot;&gt;Shaggy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167990/58974&quot;&gt;Draw a descendant pyramid (addition)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58974&quot;&gt;Shaggy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168036/58974&quot;&gt;Shortest code in your language to persist a string across a reboot&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/33208&quot;&gt;LegionMammal978&lt;/a&gt;&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168037/58974&quot;&gt;Find unique elements based on a given key&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/71434&quot;&gt;Kamil Drakari&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168082/58974&quot;&gt;Addition-Subtraction of Numbers Within String&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/33208&quot;&gt;LegionMammal978&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168087/58974&quot;&gt;Count sum of all digits&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58974&quot;&gt;Shaggy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168105/58974&quot;&gt;Alpha-Numerical Bowtie&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/71434&quot;&gt;Kamil Drakari&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168214/58974&quot;&gt;Give me the Gray Code list of bit width n&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16484&quot;&gt;Nit&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168215/58974&quot;&gt;Find the Smoothest Number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58974&quot;&gt;Shaggy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168255/58974&quot;&gt;Randomizing until 0&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58974&quot;&gt;Shaggy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168271/58974&quot;&gt;Last digit large number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58974&quot;&gt;Shaggy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168370/58974&quot;&gt;Give me the Gray Code list of bit width n&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/61613&quot;&gt;Oliver&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168374/58974&quot;&gt;Last digit large number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/61613&quot;&gt;Oliver&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168400/58974&quot;&gt;Make me a s'more!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58974&quot;&gt;Shaggy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168401/58974&quot;&gt;Construct ASCII arches&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58974&quot;&gt;Shaggy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168481/58974&quot;&gt;Draw a bowling formation&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58974&quot;&gt;Shaggy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168482/58974&quot;&gt;Count Consecutive Characters&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58974&quot;&gt;Shaggy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168498/58974&quot;&gt;Scoring Briscola&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78039&quot;&gt;Luis felipe De jesus Munoz&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168523/58974&quot;&gt;Perfect Squares below n&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78039&quot;&gt;Luis felipe De jesus Munoz&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168527/58974&quot;&gt;Scoring Briscola&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58974&quot;&gt;Shaggy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168567/58974&quot;&gt;Take a stand against long lines&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16484&quot;&gt;Nit&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168655/58974&quot;&gt;Search text for a prefix and list all its suffixes in the text&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78039&quot;&gt;Luis felipe De jesus Munoz&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168689/58974&quot;&gt;Is the matrix centrosymmetric… and so is the code?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16484&quot;&gt;Nit&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168692/58974&quot;&gt;Search text for a prefix and list all its suffixes in the text&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16484&quot;&gt;Nit&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168788/58974&quot;&gt;Sort odd numbers first&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78039&quot;&gt;Luis felipe De jesus Munoz&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168860/58974&quot;&gt;Is the matrix centrosymmetric… and so is the code?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58974&quot;&gt;Shaggy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168891/58974&quot;&gt;Generate ordered combinations with repetition&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58974&quot;&gt;Shaggy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168943/58974&quot;&gt;Count the lucky tickets within the given range&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/81420&quot;&gt;Amphibological&lt;/a&gt;&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/168967/58974&quot;&gt;Can I restack the buckets?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16484&quot;&gt;Nit&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/169073/58974&quot;&gt;Get the century of a year&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78039&quot;&gt;Luis felipe De jesus Munoz&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/169084/58974&quot;&gt;Trim the array!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58974&quot;&gt;Shaggy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/169133/58974&quot;&gt;Sort of numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58974&quot;&gt;Shaggy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/169390/58974&quot;&gt;Is this a straight flush?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58974&quot;&gt;Shaggy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/169452/58974&quot;&gt;Increment base-36 strings&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/81225/crashoz&quot;&gt;crashoz&lt;/a&gt;&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/169457/58974&quot;&gt;Implementing a stack&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/81420&quot;&gt;Amphibological&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/169636/58974&quot;&gt;The group of sequential positive numbers with the highest sum?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78039&quot;&gt;Luis felipe De jesus Munoz&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/169646/58974&quot;&gt;determine longest group of consecutive numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78039&quot;&gt;Luis felipe De jesus Munoz&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/169648/58974&quot;&gt;Jolly Jumper Sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78039&quot;&gt;Luis felipe De jesus Munoz&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/169655/58974&quot;&gt;Different Way Forward&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78039&quot;&gt;Luis felipe De jesus Munoz&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/169661/58974&quot;&gt;Display percent battery remaining&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58974&quot;&gt;Shaggy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/169662/58974&quot;&gt;Print a string with vertical words&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58974&quot;&gt;Shaggy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/169672/58974&quot;&gt;Code Golf: simple way to get min &amp;amp; max&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78039&quot;&gt;Luis felipe De jesus Munoz&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;List of &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=inquestion%3A121253+created%3A2018-06-31..2018-07-31+is%3Aanswer&quot;&gt;all Japt tips posted&lt;/a&gt; in July&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167704/58974&quot;&gt;Know the flags&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/&quot;&gt;Bubbler&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167829/78410&quot;&gt;Use multiple lines when necessary&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/&quot;&gt;Bubbler&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;tip title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;List of Japt-related challenges posted in July&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/q/&amp;lt;question-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="58974" LastEditDate="2018-08-01T11:39:24.270" LastActivityDate="2018-08-01T11:39:24.270" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16594" PostTypeId="2" ParentId="2140" CreationDate="2018-07-03T20:52:33.953" Score="2" Body="&lt;h1&gt;Use Japt Shortcuts&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/japt&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;japt&amp;#39;&quot; rel=&quot;tag&quot;&gt;japt&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/ETHproductions/japt&quot; rel=&quot;nofollow noreferrer&quot;&gt;Japt&lt;/a&gt; is the PPCG &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/16592/71434&quot;&gt;Language of the Month&lt;/a&gt; for July, and I'm excited to try it out! In accordance with the &lt;a href=&quot;https://codegolf.stackexchange.com/a/121378/71434&quot;&gt;Tips post&lt;/a&gt; I should use the Unicode Shortcuts. However, my keyboard seems to be lacking those important characters like &amp;quot;upside-down exclamation point&amp;quot; needed for optimum golfiness. Please write me a program to change horrible, verbose monstrosities like &lt;code&gt;â m@VgUb==X&lt;/code&gt; into pristine, optimal code like &lt;code&gt;â £VgUb¥X&lt;/code&gt;!&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given Japt code as input, output the same code making maximal use of the Unicode Shortcuts Japt supports.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Answers must support inputs containing any combination of valid Japt characters [Sandbox: is there a list of these? In particular, many languages need to use the NULL byte to indicate end of input, does Japt support NULL bytes in the middle of code?].&lt;/li&gt;&#xA;&lt;li&gt;Input may be in any reasonable format (string, list of chars, etc.)&lt;/li&gt;&#xA;&lt;li&gt;Output may be in any reasonable format, and does not need to be the &lt;em&gt;same&lt;/em&gt; as the one used as input (e.g. &amp;quot;input as string =&amp;gt; output as list of chars&amp;quot; is fine)&lt;/li&gt;&#xA;&lt;li&gt;If multiple shortcuts are possible, use the one that replaces the most characters. For example, &lt;code&gt;===&lt;/code&gt; should be replaced by &lt;code&gt;¶&lt;/code&gt; not &lt;code&gt;¥=&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Your code does not need to handle ambiguous situations. For example, &lt;code&gt;====&lt;/code&gt; could be shortened to &lt;code&gt;¶=&lt;/code&gt; or &lt;code&gt;=¶&lt;/code&gt;, so behavior is undefined if such a string shows up in the input.&lt;/li&gt;&#xA;&lt;li&gt;Only shortcuts available in Japt 1.4.5 (most recent version at time of posting) need to be handled&lt;/li&gt;&#xA;&lt;li&gt;Non-unicode shortcuts like &lt;code&gt;_&lt;/code&gt; and &lt;code&gt;@&lt;/code&gt; don't need to be handled&lt;/li&gt;&#xA;&lt;li&gt;I've replaced easy-to-miss trailing spaces with &lt;code&gt;␠&lt;/code&gt; where I found them. Those should be the literal space character ' ' when running tests or replacements. [Sandbox: Seriously, is there some better way to do this?]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;?OvUf\l m_c %H} qV):0 =&amp;gt; &amp;quot;?OvUf\l ®c %HÃqV):0&amp;quot;&#xA;Ov&amp;quot;y m_î íZ c p0} &amp;quot;p2␠ =&amp;gt; Ov&amp;quot;y ®î íZ c p0Ã&amp;quot;²&#xA;=== =&amp;gt; ¶&#xA;ñgJ òXYZ{XgJ &amp;lt;YgJ } mg mg␠ =&amp;gt; ñÌòÈÌ&amp;lt;YÌÃmÎmÎ&#xA;w å+ m@Vå+ m+S+Xw} c =&amp;gt; w å+ £Vå+ m+S+XwÃc&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;[Sandbox: The first two test cases are grabbed from some real Code Golf answers &lt;a href=&quot;https://codegolf.stackexchange.com/a/166442/71434&quot;&gt;here&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/a/128272/71434&quot;&gt;here&lt;/a&gt;. Should I replace them with something else?]&lt;/p&gt;&#xA;&lt;p&gt;For reference, here is the full list of Unicode Shortcuts to be supported. It can also be found on the &lt;a href=&quot;https://ethproductions.github.io/japt/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Japt Interpreter&lt;/a&gt;. Note that some shortcuts end in a space. [Sandbox: should I format this differently?]&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;¡   Um@&#xA;¢   Us2␠&#xA;£   m@&#xA;¤   s2␠&#xA;¥   ==&#xA;¦   !=&#xA;§   &amp;lt;=&#xA;¨   &amp;gt;=&#xA;©   &amp;amp;&amp;amp;&#xA;ª   ||&#xA;«   &amp;amp;&amp;amp;!&#xA;¬   q␠&#xA;®   m_&#xA;¯   s0,&#xA;°   ++&#xA;±   +=&#xA;²   p2␠&#xA;³   p3␠&#xA;´   --&#xA;µ   -=&#xA;¶   ===&#xA;·   qR␠&#xA;¸   qS␠&#xA;¹   )␠&#xA;º   ((&#xA;»   (((&#xA;¼   .25&#xA;½   .5&#xA;¾   .75&#xA;À   !==&#xA;Á   &amp;gt;&amp;gt;&amp;gt;&#xA;Â   ~~&#xA;Ã   }␠&#xA;Ä   +1&#xA;Å   s1␠&#xA;Æ   o@&#xA;Ç   o_&#xA;È   XYZ{X&#xA;É   -1&#xA;Ê   l␠&#xA;Ë   mDEF{D&#xA;Ì   gJ␠&#xA;Í   n2␠&#xA;Î   g␠&#xA;Ï   XYZ{Y&#xA;Ð   $new Date($&#xA;Ñ   *2&#xA;×   r*1␠&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-07-07T14:39:13.140" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16596" PostTypeId="2" ParentId="8047" CreationDate="2018-07-04T13:50:18.147" Score="32" Body="&lt;h1&gt;Input Validation&lt;/h1&gt;&#xA;&lt;p&gt;This is a subset of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13290/76162&quot;&gt;adding special cases for completeness&lt;/a&gt; that seems to come up pretty often. From a given set of possible inputs, a solution shouldn't have to sort out inputs that don't apply to the challenge.&lt;/p&gt;&#xA;&lt;p&gt;For example, imagine a challenge that asks to find the index of a value in a sequence. For values that are not in the sequence, or values that don't apply (strings or floats in an integer sequence):&lt;/p&gt;&#xA;&lt;h3&gt;Don't:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Require printing &amp;quot;Invalid input!&amp;quot; or something similar&lt;/li&gt;&#xA;&lt;li&gt;Ask for a specific return value, such as &lt;code&gt;-1&lt;/code&gt;, &lt;code&gt;0&lt;/code&gt; or the empty string.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Do:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Say that all inputs are assumed to be valid.&lt;/li&gt;&#xA;&lt;li&gt;Allow undefined behaviour&lt;/li&gt;&#xA;&lt;li&gt;(Less preferably) the return value should be any value not normally returned by valid inputs. This includes errors, undefined values, etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;It's not as fun to have to program in a bunch of edge cases testing whether an element is actually in the array or a number is non-negative. Plus having to allocate precious bytes for a string literal &amp;quot;Invalid input&amp;quot; in the middle of your code is unsatisfying and unnecessary.&lt;/p&gt;&#xA;&lt;p&gt;If your challenge becomes trivial without input validation, then consider making it a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; instead.&lt;/p&gt;&#xA;" OwnerUserId="76162" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-07-05T02:58:53.203" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16597" PostTypeId="1" CreationDate="2018-07-04T16:56:27.717" Score="4" ViewCount="137" Body="&lt;p&gt;I've never studied any computer science. So I've always passed over &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt; questions, since I had no way of knowing the complexity of my code. Today, I decided to try and see whether I could change that. I read the tag description (as available on mobile, which I think is only the shorter part of it), which gave no info on how to find complexity, so Googled and found &lt;a href=&quot;https://stackoverflow.com/q/9958299&quot;&gt;https://stackoverflow.com/q/9958299&lt;/a&gt;, which says there &lt;em&gt;is&lt;/em&gt; no general way to find complexity. So &lt;strong&gt;how do I know the complexity of my code for a restricted-complexity question?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="1976" LastEditorUserId="1976" LastEditDate="2018-07-04T17:05:54.643" LastActivityDate="2018-07-11T04:42:28.150" Title="What's the complexity of my answer?" Tags="|support|answers|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16600" PostTypeId="1" CreationDate="2018-07-05T02:46:33.410" Score="-3" ViewCount="147" Body="&lt;p&gt;I have noticed a user making questionable answers. Here are some examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/167924/-/167933&quot;&gt;In for a bumpy ride&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/167818/-/167819&quot;&gt;Concatenating n with n + 1&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/167337/-/167372&quot;&gt;Let&amp;#39;s design a digit mosaic&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/97713/-/167251&quot;&gt;Print the digital root&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/52400/-/166987&quot;&gt;Simple ASCII Gantt&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In all cases, he is purporting to use a tool called &lt;code&gt;ngn/k&lt;/code&gt; - this raises a&#xA;couple of concerns:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;as his name is &lt;code&gt;ngn&lt;/code&gt;, he wrote the tool&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;both the page he links to and his similar github page host no software, only&#xA;a readme: &lt;a href=&quot;https://gitlab.com/n9n/k&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://gitlab.com/n9n/k&lt;/a&gt; and &lt;a href=&quot;https://github.com/ngn/k&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://github.com/ngn/k&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;to me this is not acceptable - if someone is posting and getting upvotes on&#xA;answers, they should be using a publicly available tool, and ideally an open&#xA;source one.&lt;/p&gt;&#xA;" OwnerUserId="7815" LastEditorUserId="34718" LastEditDate="2018-07-05T18:54:39.000" LastActivityDate="2018-07-05T18:54:39.000" Title="User posting answer of an unavailable tool" Tags="|discussion|users|" AnswerCount="1" CommentCount="10" ClosedDate="2018-07-06T02:37:11.777" ContentLicense="CC BY-SA 4.0" />
  <row Id="16601" PostTypeId="2" ParentId="16600" CreationDate="2018-07-05T03:37:04.993" Score="9" Body="&lt;p&gt;ngn/k &lt;em&gt;is&lt;/em&gt; publicly available: &lt;a href=&quot;https://tio.run/#k-ngn&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://tio.run/#k-ngn&lt;/a&gt;. You can use it to verify ngn/k answers or &amp;ndash; if you know the K language &amp;ndash; write your own answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are many programming languages that exist only as an online interpreter. As long as this implementation is not a blackbox (server-side interpreter that doesn't expose the binary) and &lt;em&gt;remains&lt;/em&gt; available, this is not an issue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As long as you can reliably verify solutions, that's enough for PPCG. What you can or cannot do with these languages &lt;em&gt;outside PPCG&lt;/em&gt; is not our concern.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2018-07-05T04:56:54.650" LastActivityDate="2018-07-05T04:56:54.650" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16602" PostTypeId="2" ParentId="2140" CreationDate="2018-07-05T03:41:15.177" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/168528/&quot;&gt;Existential Golf&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2018-07-13T16:46:55.663" LastActivityDate="2018-07-13T16:46:55.663" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="16604" PostTypeId="2" ParentId="2140" CreationDate="2018-07-05T08:16:13.717" Score="-2" Body="&lt;h1&gt;Longest reference&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write two code A and B, where len(A)&amp;lt;=1024, running A returns B and running B returns A. Longest B win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Proper quine rule and no rubbish rule(for code-bowling) apply.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Un-used Code&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;All code must be used. Meaning the program must fail to always properly complete the task if any individual character (or varying set(s) of characters) is/are removed. Naturally, a subset of the program should not be able complete the task on its own without the rest of the program.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/busy-beaver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;busy-beaver&amp;#39;&quot; rel=&quot;tag&quot;&gt;busy-beaver&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox notes&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The &quot;1024&quot; may change &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-07-07T02:52:58.803" LastActivityDate="2018-07-07T02:52:58.803" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="16605" PostTypeId="2" ParentId="2140" CreationDate="2018-07-05T16:47:43.567" Score="2" Body="&lt;h1&gt;Role reversal&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;This is related to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/23476/swap-genders-on-this-page-code-golf&quot;&gt;an old question&lt;/a&gt;, but is different enough that answers should be quite different to the older one.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are given a sentence referring to two different people. Return the sentence with the roles reversed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, for the input &lt;code&gt;I will give you a kiss.&lt;/code&gt;, you should return &lt;code&gt;You will give me a kiss.&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There will always be exactly two people referred to in the sentence, and they will be referred to with different pronouns. Here's a table of the pronouns that might be used (pronouns in a row refer to the same person. Pronouns in a column can be switched with one another to reverse a role).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; I         me       my           mine         myself&#xA; you       you      your         yours        yourself     &#xA; she       her      her          hers         herself&#xA; he        him      his          his          himself      &#xA; they      them     their        theirs       themselves &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Capitalisation matters (the first letter of the sentence should be capitalised, the pronoun &quot;I&quot; should always be capitalised, and no other pronoun is capitalised when not starting a sentence).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Words/punctuation not appearing in the pronoun table above shouldn't be changed. A pronoun word shouldn't be replaced if it appears as a substring of another word (e.g. 'history' shouldn't he changed). None of the inputs will be contractions using pronouns (so there won't be any inputs with &quot;I'm&quot; or &quot;you're&quot; etc).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input/output examples:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;in: She gave them hers!&#xA;out: They gave her theirs!&#xA;&#xA;in: He will eat me if I don't eat him.&#xA;out: I will eat him if he don't eat me.&#xA;&#xA;in: Get it for them yourself!&#xA;out: Get it for you themselves!&#xA;&#xA;in: I think I am going to see him tomorrow.&#xA;out: He think he am going to see me tomorrow.&#xA;&#xA;in: I am not interested in history, is he?&#xA;out: He am not interested in history, is I?&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is code golf so the shortest answer wins.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are banned.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="71554" LastEditorUserId="71554" LastEditDate="2018-07-06T12:50:00.573" LastActivityDate="2018-07-06T12:50:00.573" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16608" PostTypeId="2" ParentId="2140" CreationDate="2018-07-05T23:37:00.863" Score="1" Body="&lt;h1&gt;Assign tasks to processors &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;sup&gt;&lt;sup&gt;&lt;sup&gt;anything better to put here?&lt;/sup&gt;&lt;/sup&gt;&lt;/sup&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a list of processor speeds \$S\$, where each element denotes how many ticks the processor at its index takes to complete a task, and a number of tasks \$N\$, replace every element in \$S\$ with the number of tasks the processor at its index should perform. The order of completion doesn't matter, and the tasks aren't enumerated anyway. The processors you pick don't matter either. The only thing that matters is that the ticks needed to complete all the tasks are the least possible. If there are multiple solutions, choose one with the lowest sum of the ticks each processor spends working (less man-hours means happier workers). This is a simple version of such a challenge, so you can assume that every task takes the same amount of time to be completed. You can assume that \$S\$ only consists of positive integers and that its length is at least \$1\$, and \$N\$ is a non-negative integer. &lt;sup&gt;What a blob of text...&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples (test cases)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;\$S=[4,1,3,1,2,2,1,1]\\N=13\\\text{Example output: }[0,3,0,3,1,0,3,3]\$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;\$S=[8]\\N=28\\\text{Example output: }[28]\$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;\$S=[1,1,1,1,1,1,1,1,2]\\N=5\\\text{Example output: }[1,1,1,1,1,0,0,0,0]\$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;\$S=[1,28]\\N=28\\\text{Example output: }[28,0]\$&lt;br&gt;&#xA;Note that \$[27,1]\$ is an invalid output, since \$1\times27+28\times1&amp;gt;1\times28\$.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2018-07-05T23:37:00.863" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16609" PostTypeId="1" CreationDate="2018-07-06T02:45:57.623" Score="1" ViewCount="145" Body="&lt;p&gt;I am trying to come up with a workable question but every question I have looked at so far has been one where the winning answer is &quot;fewest bytes in your language&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By &quot;fewest bytes in x language&quot;, I mean &lt;a href=&quot;https://codegolf.stackexchange.com/questions/17005/produce-the-number-2014-without-any-numbers-in-your-source-code&quot;&gt;this&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Answer: Mouse-2002, 4 bytes.&lt;/li&gt;&#xA;  &lt;li&gt;Answer: Python, 52 bytes&lt;/li&gt;&#xA;  &lt;li&gt;Answer: Befunge 8 bytes&lt;/li&gt;&#xA;  &lt;li&gt;Answer: Ruby, 15&lt;/li&gt;&#xA;  &lt;li&gt;Answer: Go, 2 bytes (UTF-16)&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Wondering if one could list some examples where that is not the case. I asked &lt;a href=&quot;https://codegolf.stackexchange.com/questions/47290/fastest-way-to-compute-order-of-magnitude-in-x86-assembly&quot;&gt;one&lt;/a&gt; a while back where it was about &quot;fewest clock cycles&quot;, and it got decent votes. However, it seems that if I asked that same question today it would be flagged as &quot;shouldn't limit to a specific language&quot; (since it was all about x86 assembly). But in limiting it to a language it made it possible to come up with a winning condition, because with assembly you can limit to only primitive instructions (i.e. no libraries can be used) pretty easily.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am having a hard time finding an example of a question that would be considered valid that isn't &quot;shortest x in your language&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, every question here is &quot;shortest x in your language&quot;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/3626/examples-of-well-presented-questions&quot;&gt;Examples of well presented questions&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Update&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As of now I have only found 3 types of winning conditions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Shortest in x language.&lt;/li&gt;&#xA;&lt;li&gt;Popularity contest (win by votes).&lt;/li&gt;&#xA;&lt;li&gt;Playing a game (win by seeing how high a score your algorithm can achieve, either by testing against test data, or actually playing some game).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Popularity contest has issues with early posts getting more votes. Shortest x language has issues in that it can be played by just using an esolang. So that leaves it down to &quot;Playing a game&quot;. But that one is quite involved and requires a lot of effort on the part of the asker and answerer. So not sure what to do.&lt;/p&gt;&#xA;" OwnerUserId="4901" LastEditorUserId="4901" LastEditDate="2018-07-06T03:54:27.667" LastActivityDate="2018-07-07T05:00:38.240" Title="Examples of Questions that don't involve &quot;Fewest bytes in x Language&quot;" Tags="|discussion|asking-questions|" AnswerCount="3" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="16611" PostTypeId="2" ParentId="16609" CreationDate="2018-07-06T03:07:19.910" Score="-5" Body="&lt;p&gt;All of these are non-closed, highly voted questions.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Here is one: Scoring by vote:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/22144/images-with-all-colors&quot;&gt;Images with all colors&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Scoring is by vote&lt;/strong&gt;. Vote for the most beautiful images made by the most elegant code and/or interesting algorithm.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Here is another, a &lt;strong&gt;popularity contest&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Because this a popularity-contest, whichever answer has the most upvotes by March 11, will be declared the winner.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/21835/most-creative-way-to-display-42&quot;&gt;Most creative way to display 42&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another popularity contest:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;This is a popularity contest so the highest voted answer wins. But I'm sure there's lots of ways to be creative with this!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/33172/american-gothic-in-the-palette-of-mona-lisa-rearrange-the-pixels&quot;&gt;American Gothic in the palette of Mona Lisa: Rearrange the pixels&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One with a percentage of correctness trying to do a task:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Score is a percent which can be calculated by: (number_correct / total) * 100&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/71631/upgoat-or-downgoat&quot;&gt;Upgoat or Downgoat?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Popularity contest:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/30322/make-it-look-like-im-working&quot;&gt;Make it look like I&amp;#39;m working&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/50299/draw-an-image-as-a-voronoi-map&quot;&gt;Draw an Image as a Voronoi Map&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Gamified:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;This contest will be officially over on April 19, 2015. On that day (around 11 pm UTC) I will autorun at least 100 battles (possibly many more depending on how long battles take). The team that wins the most will be the overall winner. If it is a tie or extremely close, I will run more battles until it is clear that one team has the advantage.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/48353/red-vs-blue-pixel-team-battlebots&quot;&gt;Red vs. Blue - Pixel Team Battlebots&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Other gamified:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/135102/formic-functions-ant-queen-of-the-hill-contest&quot;&gt;Formic Functions - Ant Queen of the Hill Contest&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/67560/king-of-the-hill-spacewar&quot;&gt;King of the Hill - Spacewar!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/50690/block-building-bot-flocks&quot;&gt;Block Building Bot Flocks!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/117482/team-of-the-hill&quot;&gt;Team of The Hill!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="4901" LastEditorUserId="4901" LastEditDate="2018-07-06T03:53:39.457" LastActivityDate="2018-07-06T03:53:39.457" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16612" PostTypeId="1" AcceptedAnswerId="16613" CreationDate="2018-07-06T03:46:30.877" Score="0" ViewCount="139" Body="&lt;p&gt;I am trying to figure out how to write a good question. I have found that there are basically &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/16609/examples-of-questions-that-dont-involve-shortest-in-x-language&quot;&gt;&lt;del&gt;3&lt;/del&gt; 2 types of acceptable answers&lt;/a&gt; (really only probably 1 as of today):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Playing a game.&lt;/li&gt;&#xA;&lt;li&gt;Shortest in x language.&lt;/li&gt;&#xA;&lt;li&gt;&lt;del&gt;Popularity contest.&lt;/del&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I was wondering though if it would be acceptable to limit it to a specific language, and limit it to only the &lt;strong&gt;core language primitives&lt;/strong&gt;. In x86 assembly, this would mean not calling to external libraries with &lt;code&gt;call&lt;/code&gt;. In JavaScript this would mean only using &lt;code&gt;var&lt;/code&gt;, &lt;code&gt;if&lt;/code&gt;, &lt;code&gt;while&lt;/code&gt;, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or perhaps you could list what languages are acceptable, i.e. &quot;this can be done in x86, JavaScript, C, or Python&quot;, to give it more range but at the same time prevent the &quot;shortest in x language&quot; problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By doing so, the winning condition can be the fewest instructions or statements (statements would need to be defined for each language). Instructions is already clearly defined for Assembly. There is an actual number associated with the amount of primitive constructs used, which could be the score.&lt;/p&gt;&#xA;" OwnerUserId="4901" LastActivityDate="2018-07-06T03:55:18.500" Title="If &quot;fewest instructions&quot; in Assembly is a valid question type" Tags="|discussion|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16613" PostTypeId="2" ParentId="16612" CreationDate="2018-07-06T03:55:18.500" Score="7" Body="&lt;h1&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;From the tag description of atomic code golf:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Atomic code golf asks you to solve a task using only a limited set of operations, with as few of these operations as possible.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Which is what you are describing.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;It's also important to note that atomic code golf tends to work best when there is only one language involved.  This allows the OP to define the scoring mechanic in an objective, and predictable way.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2018-07-06T03:55:18.500" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16614" PostTypeId="2" ParentId="2140" CreationDate="2018-07-06T08:07:35.793" Score="0" Body="&lt;h1&gt;Fewest instructions to copy bytes in memory in WebAssembly.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Implement the functionality for copying bytes in memory in WebAssembly.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use WebAssembly, written in &lt;a href=&quot;https://developer.mozilla.org/en-US/docs/WebAssembly/Understanding_the_text_format&quot; rel=&quot;nofollow noreferrer&quot;&gt;wast&lt;/a&gt; (the text format).&lt;/li&gt;&#xA;&lt;li&gt;Any of the WebAssembly &lt;a href=&quot;https://webassembly.org/docs/semantics&quot; rel=&quot;nofollow noreferrer&quot;&gt;instructions&lt;/a&gt; are fine.&lt;/li&gt;&#xA;&lt;li&gt;In calling copy, it doesn't need to worry about overriding an existing string.&lt;/li&gt;&#xA;&lt;li&gt;Doesn't need to worry about the strings being too large to fit into memory, strings will be reasonable size and wont overflow over the end. For example, the total memory is 10000 bytes, so strings might be 100 bytes and only go to 5000 in the memory. (But those aren't actual hardcodable values).&lt;/li&gt;&#xA;&lt;li&gt;No calling JavaScript functions.&lt;/li&gt;&#xA;&lt;li&gt;The string &quot;Hello World&quot; starts of at position 0 in memory. Copy this string to random places in memory and log it, as shown in the xample below.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The winning answer is the one with the &lt;em&gt;fewest WebAssembly instructions&lt;/em&gt;. That is, feel free to have a functions in WebAssembly, just no calling or importing JavaScript functions.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To get started, here is the start of the WebAssembly module:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;// example.wast&#xA;(module&#xA;  (memory (export &quot;mem&quot;) 1)&#xA;  (data (i32.const 0) &quot;Hello World&quot;)&#xA;  ;; instructions counting starts from here:&#xA;  (func (export &quot;copy&quot;)&#xA;    (param i32) ;; existing start index&#xA;    (param i32) ;; size in bytes&#xA;    (param i32) ;; new index to copy to&#xA;    ...))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And here is how to load it, as well as the tests:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;// example.js&#xA;WebAssembly.instantiateStreaming(fetch('example.wasm'), {}).then(mod =&amp;gt; {&#xA;  var exports = mod.instance.exports&#xA;  var i8 = new Uint8Array(exports.mem)&#xA;  var i = 200 + rand(500)&#xA;  exports.copy(0, 11, i)&#xA;  var i2 = 1000 + rand(500)&#xA;  exports.copy(i, 11, i2)&#xA;  console.log(i, getString(i, 11))&#xA;  console.log(i2, getString(i2, 11))&#xA;&#xA;  function rand(size) {&#xA;    return Math.floor(Math.random() * (size + 1))&#xA;  }&#xA;&#xA;  function getString(index, size) {&#xA;    var string = ''&#xA;    for (var i = index; i &amp;lt; index + size; i++) {&#xA;      string += String.fromCharCode(i8[i])&#xA;    }&#xA;    return string&#xA;  }&#xA;})&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Potentially useful resources:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://hacks.mozilla.org/2017/07/memory-in-webassembly-and-why-its-safer-than-you-think/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Memory in WebAssembly (and why it’s safer than you think)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/WebAssembly/spec/blob/bca1718f6a974453c0e35df94b220bd83cc85be8/test/core/data.wast#L5-L19&quot; rel=&quot;nofollow noreferrer&quot;&gt;Example of the &lt;code&gt;.data&lt;/code&gt; section in wast&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/WebAssembly/spec/blob/bca1718f6a974453c0e35df94b220bd83cc85be8/test/core/func.wast&quot; rel=&quot;nofollow noreferrer&quot;&gt;Example &lt;code&gt;func&lt;/code&gt; in WebAssembly&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/WebAssembly/spec/blob/bca1718f6a974453c0e35df94b220bd83cc85be8/test/core/block.wast&quot; rel=&quot;nofollow noreferrer&quot;&gt;Example of WebAssembly iteration with &lt;code&gt;block&lt;/code&gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/WebAssembly/spec/tree/bca1718f6a974453c0e35df94b220bd83cc85be8/test/core&quot; rel=&quot;nofollow noreferrer&quot;&gt;WebAssembly examples&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="4901" LastActivityDate="2018-07-06T08:07:35.793" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16615" PostTypeId="2" ParentId="2140" CreationDate="2018-07-06T08:45:43.870" Score="0" Body="&lt;h1&gt;Concatenate my strings!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As you know, we all like to save bytes around here. So, my strings are special: they come in four different flavours depending on the highest code point in the string:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;ASC (code points up to 0x7F). Like ISO but all bytes have values less than 0x80.&lt;/li&gt;&#xA;&lt;li&gt;ISO (code points up to 0xFF). Each byte represents a code point.&lt;/li&gt;&#xA;&lt;li&gt;UTF (code points up to 0x7FF). Uses UTF-8 encoding.&lt;/li&gt;&#xA;&lt;li&gt;UCS (code points up to 0xFFFF). Uses UCS-2 encoding.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For input you will receive two strings, each represented by a flavour identifier and a sequence of bytes representing the code points according to the flavour. You then need to output a byte sequence using the best flavour to hold the concatenation. Except where limited by standard loopholes, you don't need to use the designations ASC, ISO, UTF and UCS, so for instance if you choose to use numbers 0-3 for the flavours then the output flavour is simply the maximum of the two input flavours.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ISO 43 6F 64 65 A0 + ASC 47 6F 6C 66 = ISO 43 6F 64 65 A0 47 6F 6C 66 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2018-07-06T08:45:43.870" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16617" PostTypeId="2" ParentId="2140" CreationDate="2018-07-07T02:00:00.950" Score="4" Body="&lt;h1&gt;Extremely small data compressor&lt;/h1&gt;&#xA;&lt;p&gt;In 2014 Jarek Duda at Purdue University wrote a paper containing several ideas for encoding computer data, entitled &lt;strong&gt;“Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding&amp;quot;&lt;/strong&gt;. The paper  is available at Cornell University Library’s ArXiv project: &lt;a href=&quot;https://arxiv.org/abs/1311.2540&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://arxiv.org/abs/1311.2540&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;One of the many fascinating things about this paper is that it begins by describing an extremely simple data compression algorithm, using the concept of the &amp;quot;Uniform asymmetric binary systems (uABS)&amp;quot;. In fact, it is so simple, that you can implement it in only a few lines of code.&lt;/p&gt;&#xA;&lt;p&gt;Basically it attempts to interpret a sequence of input symbols as a single Integer, and as each symbol comes in the Integer can be appended with new information. The trick is that the Integer is represented not using a place-value binary number system, but an alternative system. This representation is designed so that sequences of symbols which occur with higher probability will be represented by a smaller amount of space within the Integer's encoding.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;You will implement the simple uABS compression algorithm, so that given a sequence of 0s and 1s, your program will compress them into a (usually) smaller sequence of 0s and 1s.&lt;/p&gt;&#xA;&lt;h2&gt;Pseudocode&lt;/h2&gt;&#xA;&lt;p&gt;The algorithm in psuedocode is as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Begin with an Integer X, and set it to 1. This will be the main Integer that we append during the algorithm.&lt;/li&gt;&#xA;&lt;li&gt;The input data is a sequence of symbols, each 0 or 1, called Input&lt;/li&gt;&#xA;&lt;li&gt;Find the probability P that any given symbol in Input is 1, (the number of 1s divided by the total number of symbols)&lt;/li&gt;&#xA;&lt;li&gt;For each symbol S in Input, set X to the output of the function Encode(x,s,p)&lt;/li&gt;&#xA;&lt;li&gt;After processing all the input symbols, output the final integer X.&#xA;-- This encoded integer will hopefully have less bits than the input&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The Encode function itself can be described as follows:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;Encode(x,s,p)=&#xA;\left\{&#xA;    \begin{array}{11}&#xA;         \mbox{if } s = 0 &amp;amp; \big\lceil\frac{x+1}{1-p}\big\rceil-1 \\&#xA;         \mbox{if } s = 1 &amp;amp; \big\lfloor\frac{x}{p}\big\rfloor &#xA;    \end{array}&#xA;\right.&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Where&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{array}{11}&#xA;   s \text{ is a symbol, either 0 or 1} \\ &#xA;   x \text{ is the Integer} \\&#xA;   p \text{ is the probability that any symbol in the Input data is 1 } \\&#xA;   \lceil \rceil \text{ is the mathematical ceiling function  } \\&#xA;  \lfloor \rfloor \text{ is the mathematical floor function }&#xA;\end{array}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The input is a sequence of symbols, each symbol being 0 or 1, in any method that is available in your chosen language. Examples include a sequence of ascii characters '0' '1', an array of integers, etc.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The output will be a sequence of symbols in the same format as the input sequence. The output sequence represents the compressed version of the input data.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Empty input data has undefined behavior.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Input data containing only 0s has undefined behavior.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Sometimes the encoded Integer might have more bits than the input, not less. This typically happens when the number of 1s and 0s is relatively even. Data with an unbalanced number of 0s and 1s results in better compression.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may assume that the size of Integer will be your language's largest integer type. The test cases outside this range can be ignored for your language.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Note that if you are trying to test this by 'decoding' or 'decompressing' the compressed data, and compare it to the original, one would have to store additional information, such as the length of input and probability P, but for simplicity this has been left out of the challenge.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Example Input and Output&lt;/h2&gt;&#xA;&lt;p&gt;Short examples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input             Output    &#xA;10                101&#xA;10010100000       1011101001&#xA;1111              1&#xA;11111111111       1&#xA;10000000          11011&#xA;10011111010101    10110000100101    &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Longer examples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input  11111110110111110111111111011111&#xA;Output 11111000011110110&#xA;&#xA;Input  000000000001000000010000000000001100000000001&#xA;Output 1110000101100111000011111&#xA;&#xA;Input  000000000001000000010000000000001100000000001000000000000000000000000000000000000000000000000000000000000000001&#xA;Output 1010100110111110010111011110110101010&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program with the fewest number of characters wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41273" LastEditorUserId="41273" LastEditDate="2021-09-21T03:05:52.803" LastActivityDate="2021-09-21T03:05:52.803" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="16618" PostTypeId="2" ParentId="16609" CreationDate="2018-07-07T04:20:41.313" Score="1" Body="&lt;p&gt;The easy way to find questions with other winning conditions (besides shortest code) is simply to check the questions tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;. Pretty much all of them have an objective winning condition other than just shortest code. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another alternative is to temporarily add the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; to your list of ignored tags. You also have change your settings so that ignored tags are not shown, rather than just being greyed out. That will show you everything else apart from the code golf questions, so you can get a good idea of what else is possible. (I actually browse the site like that regularly, not because I don't like code golf, but because ignoring it makes it much easier to find the kind of novel and non-trivial challenges that I prefer.)&lt;/p&gt;&#xA;" OwnerUserId="21034" LastActivityDate="2018-07-07T04:20:41.313" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16619" PostTypeId="2" ParentId="16609" CreationDate="2018-07-07T05:00:38.240" Score="5" Body="&lt;p&gt;The tag for &quot;shortest x in your language&quot; is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so you can exclude these questions with a search: &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=is%3Aq+-%5Bcode-golf%5D+closed%3Ano+locked%3Ano&quot;&gt;&lt;code&gt;is:q -[code-golf] closed:no locked:no&lt;/code&gt;&lt;/a&gt; (for the sake of convenience this also obviously excludes closed or locked questions). Looking at the list of results you can see tags such as:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fewest-operations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fewest-operations&amp;#39;&quot; rel=&quot;tag&quot;&gt;fewest-operations&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; (not a challenge tag)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Each of these tags has its own tag wiki so you know what it refers to. I'd advise looking at the full wiki and also Meta for any tag that you want to write a challenge for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can further refine this search to weed out tags that you've seen (using the &lt;code&gt;-&lt;/code&gt; operator before the tag while searching).&lt;/p&gt;&#xA;" OwnerUserId="66025" LastActivityDate="2018-07-07T05:00:38.240" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16620" PostTypeId="2" ParentId="2140" CreationDate="2018-07-07T17:23:57.043" Score="0" Body="&lt;h1&gt;Count binomial coefficient entries&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This task is very simple. For integer \$n \ge 0 \$, given the binomial coefficients of all the expansions of \$ (x+y)^m \$ for \$ 0 \le m \le n \$, count the number of occurrences of \$ n \$. This is OEIS &lt;a href=&quot;http://oeis.org/A003016&quot; rel=&quot;nofollow noreferrer&quot;&gt;A003016&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="59487" LastEditDate="2018-07-07T18:04:48.780" LastActivityDate="2018-07-07T18:04:48.780" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16621" PostTypeId="2" ParentId="2140" CreationDate="2018-07-07T20:08:45.183" Score="1" Body="&lt;h1&gt;Integers in increasing order of width when printed in Helvetica&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://imgs.xkcd.com/comics/oeis_submissions.png&quot; alt=&quot;XKCD 2016&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;According to Explain XKCD, Helvetica kerns adjacent &lt;code&gt;1&lt;/code&gt;s together slightly. This means that the sequence of integers in increasing order of width is &lt;code&gt;(0, )&lt;/code&gt; &lt;code&gt;1,&lt;/code&gt; &lt;code&gt;2,&lt;/code&gt; &lt;code&gt;3,&lt;/code&gt; &lt;code&gt;4,&lt;/code&gt; &lt;code&gt;5,&lt;/code&gt; &lt;code&gt;6,&lt;/code&gt; &lt;code&gt;7,&lt;/code&gt; &lt;code&gt;8,&lt;/code&gt; &lt;code&gt;9,&lt;/code&gt; &lt;code&gt;11,&lt;/code&gt; &lt;code&gt;10,&lt;/code&gt; &lt;code&gt;12 ... 99,&lt;/code&gt; &lt;code&gt;111,&lt;/code&gt; &lt;code&gt;110,&lt;/code&gt; &lt;code&gt;112 ... 119,&lt;/code&gt; &lt;code&gt;211,&lt;/code&gt; &lt;code&gt;311,&lt;/code&gt; &lt;code&gt;411,&lt;/code&gt; &lt;code&gt;511,&lt;/code&gt; &lt;code&gt;611,&lt;/code&gt; &lt;code&gt;711,&lt;/code&gt; &lt;code&gt;811,&lt;/code&gt; &lt;code&gt;911,&lt;/code&gt; &lt;code&gt;100 ... 109,&lt;/code&gt; &lt;code&gt;120 ... 210,&lt;/code&gt; etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the purposes of this question you can assume that repunits will always print wider than numbers with fewer digits. Note that the adjacent pairs may overlap e.g. &lt;code&gt;11011&lt;/code&gt; has the same width as &lt;code&gt;11100&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an integer &lt;code&gt;n&lt;/code&gt;, either return the &lt;code&gt;n&lt;/code&gt;th integer in the sequence (you may but do not need to support the &lt;code&gt;0&lt;/code&gt;th integer as &lt;code&gt;0&lt;/code&gt;) or the first &lt;code&gt;n&lt;/code&gt; integers (starting at either &lt;code&gt;0&lt;/code&gt; or &lt;code&gt;1&lt;/code&gt;). Alternatively, print the sequence indefinitely or return a generator or equivalent lazy list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Should I include negative integers? They could be assumed to be longer than all positive integers with the same number of digits, but shorted than those with more digits.)&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2018-07-07T20:08:45.183" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="16622" PostTypeId="2" ParentId="2140" CreationDate="2018-07-08T01:07:29.200" Score="2" Body="&lt;p&gt;A note about this meta post:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I just have one example right now, but I will have three in the final. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I thought it would be interesting to have a problem about something I know a bit about. Right now it seems a bit mathy, but I wanted to ground the problem on something real. It feels more 'real-life' if you need to understand the spec in addition to golfing. The problem is I don't want it to seem like homework. Another problem is the actual computation that needs to take place isn't actually that hard once you understand the simplifications of the problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let me know what you think.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;\$\def\tensor#1{\smash{\underline{\underline{\smash{#1}}}}}\$&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Calculate the strain tensor and volume percent change of a cube given its material properties and stress tensor.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Background&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Common Terms&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://upload.wikimedia.org/wikipedia/commons/1/15/StressStrainWEB.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/1/15/StressStrainWEB.svg&quot; alt=&quot;Stress Strain&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Strain: ε, The amount of elongation per unit length, Units: \$\frac{in}{in}\$&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Normal Stress: σ, The amount of force per unit area perpendicular to the cross section, Units: \$\frac{lbs}{in^2} = psi\$&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Shear Stress: τ, The amount of force per unit area parallel to the cross section, Units: \$\frac{lbs}{in^2} = psi\$&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Young's Modulus: E, The relationship between stress and strain: \$σ = Eε\$, Units: psi&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://upload.wikimedia.org/wikipedia/commons/e/ec/PoissonRatio.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/e/ec/PoissonRatio.svg&quot; alt=&quot;Poisson&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Poisson's Ratio: ν, The relationship between strain in different directions. &#xA;For a uniaxial bar: \$ε_{22} = -ν ε_{11}\$, Units: unitless&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Index Notation: A short form for tensors written with subscripts \$i,j,k,l\$ to denote which element within the tensor. The number of subscripts the tensor has indicates what order it is. \$σ_{ij} \equiv \tensor{σ}\$ (Second Order)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Kroniker Delta: \$δ_{ij}\$, has the value of 1 if i=j, otherwise its value is 0. Index Notation for the Identity Tensor.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;$$&#xA;δ_{ij} = &#xA;\left[\begin{array}{ccc}&#xA;δ_{11} &amp;amp; δ_{12} &amp;amp; δ_{13}\\&#xA;δ_{21} &amp;amp; δ_{22} &amp;amp; δ_{23}\\&#xA;δ_{31} &amp;amp; δ_{32} &amp;amp; δ_{33}\\&#xA;\end{array}\right] =&#xA;\left[\begin{array}{ccc}&#xA;1 &amp;amp; 0 &amp;amp; 0\\&#xA;0 &amp;amp; 1 &amp;amp; 0\\&#xA;0 &amp;amp; 0 &amp;amp; 1\\&#xA;\end{array}\right] = I&#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Tensors&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A tensor in this context can be thought of as three directional components for each of the three positive faces of the cube.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://upload.wikimedia.org/wikipedia/commons/b/b3/Components_stress_tensor_cartesian.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/b/b3/Components_stress_tensor_cartesian.svg&quot; alt=&quot;Tensor on Cube&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although a &lt;a href=&quot;https://en.wikipedia.org/wiki/Cauchy_stress_tensor&quot; rel=&quot;nofollow noreferrer&quot;&gt;Stress Tensor&lt;/a&gt; is not a matrix, it can be represented in matrix form by a 3x3 or other matrices:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$${\tensor{σ}} =&#xA;\left[\begin{array}{ccc}&#xA;σ_{xx} &amp;amp; σ_{xy} &amp;amp; σ_{xz}\\&#xA;σ_{yx} &amp;amp; σ_{yy} &amp;amp; σ_{yz}\\&#xA;σ_{zx} &amp;amp; σ_{zy} &amp;amp; σ_{zz}\\&#xA;\end{array}\right] =&#xA;\left[\begin{array}{ccc}&#xA;σ_{11} &amp;amp; σ_{12} &amp;amp; σ_{13}\\&#xA;σ_{21} &amp;amp; σ_{22} &amp;amp; σ_{23}\\&#xA;σ_{31} &amp;amp; σ_{32} &amp;amp; σ_{33}\\&#xA;\end{array}\right] =&#xA;\left[\begin{array}{c}&#xA;σ_{11}\\&#xA;σ_{12}\\&#xA;\vdots \\&#xA;σ_{33}\\&#xA;\end{array}\right] =&#xA;\left[\begin{array}{cccc}&#xA;σ_{11} &amp;amp; σ_{12} &amp;amp; \dots &amp;amp; σ_{33}\\&#xA;\end{array}\right]&#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a Tensor and a Kroniker Delta share the same indices, they are combined.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$&#xA;σ_{ij} δ_{kj} = σ_{ik}&#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a Tensor has repeating indices, then it is taken as a zero order tensor and the indices are summed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$&#xA;σ_{ij} δ_{ij} = σ_{ii} = \sum_{i=1}^{3} σ_{ii} \equiv tr(\tensor{σ}) = σ_{11} + σ_{22} + σ_{33} &#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Stress Strain Relationship&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The relationship in one dimension is \$σ=Eε\$. For three dimensions we can use &lt;a href=&quot;https://en.wikipedia.org/wiki/Hooke&amp;#39;s_law#Hooke&amp;#39;s_law_for_continuous_media&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hook's law&lt;/a&gt; to find the relationship between the strain tensor and the stress tensor as follows:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$&#xA;σ_{ij} = C_{ijkl} ε_{kl}&#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This general case would need \$3^4 = 81\$ independent material properties to calculate the strain tensor. If we assume the cube has a symetric \$\tensor{σ}\$, symetric \$\tensor{ε}\$, is Elastic, Isotropic, Linear, and Homogeneous, then we only need &lt;a href=&quot;https://en.wikiversity.org/wiki/Introduction_to_Elasticity/Constitutive_relations#An_alternative_form_of_the_stress-strain_relation&quot; rel=&quot;nofollow noreferrer&quot;&gt;two independent material properties&lt;/a&gt;: (Young's modulus: E, Poisson's Ratio: ν) or (Lamé modulus: λ, Shear modulus: μ). We can use either pair of values, but for this example it is much easier to calculate the strain tensor from the stress tensor using Young's Modulus and Poisson's Ratio.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And so we can simplify the stress tensor by what we know.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$${\tensor{σ}} =&#xA;\left[\begin{array}{ccc}&#xA;σ_x &amp;amp; σ_{xy} &amp;amp; σ_{xz}\\&#xA;  &amp;amp; σ_y &amp;amp; σ_{yz}\\&#xA;Sym &amp;amp;   &amp;amp; σ_z\\&#xA;\end{array}\right]&#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And our new relationship is:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$&#xA;ε_{ij} = \frac{1+ν}{E} σ_{ij} - \frac{ν}{E} σ_{kk} δ_{ij}&#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Calculating the Dilation&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://upload.wikimedia.org/wikipedia/commons/8/81/Approximation_volume_deformation.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/8/81/Approximation_volume_deformation.png&quot; alt=&quot;Volumetric Change&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Infinitesimal_strain_theory#Volumetric_strain&quot; rel=&quot;nofollow noreferrer&quot;&gt;Volumetric Strain&lt;/a&gt; can be found by calculating the trace of the strain tensor for very small values of strain. This is because for small values \$ε^3 \ll ε^2 \ll ε\$.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$&#xA;{\frac {ΔV}{V_0}} \approx tr(\tensor{ε})&#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Putting it all together&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Therefore, in summary we can calculate the strain tensor with the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Using Index Notation:&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;$$&#xA;ε_{ij} = \frac{1+ν}{E} σ_{ij} - \frac{ν}{E} σ_{kk} δ_{ij}&#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Using Matrix Notation:&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;$$&#xA;ε_{ij} = \frac{1+ν}{E}&#xA;\left[\begin{array}{ccc}&#xA;σ_{11} &amp;amp; σ_{12} &amp;amp; σ_{13}\\&#xA;σ_{12} &amp;amp; σ_{22} &amp;amp; σ_{23}\\&#xA;σ_{13} &amp;amp; σ_{23} &amp;amp; σ_{33}\\&#xA;\end{array}\right]&#xA;- \frac{ν}{E} tr(\tensor{σ})&#xA;\left[\begin{array}{c}&#xA;1 &amp;amp; 0 &amp;amp; 0\\&#xA;0 &amp;amp; 1 &amp;amp; 0\\&#xA;0 &amp;amp; 0 &amp;amp; 1\\&#xA;\end{array}\right]&#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Then calculate the volumetric change:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Index Notation&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;$$&#xA;{\frac {ΔV}{V_0}} = ε_{ij} δ_{ij} = ε_{ii}&#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Matrix Notation&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;$$&#xA;{\frac {ΔV}{V_0}} = tr(\tensor{ε})&#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;One positive long: Young's Modulus (Usually in the range 100 psi - 100,000,000 psi)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One positive decimal: Poissons's Ratio (Usually in the range 0.01 - 0.5)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Array of signed decimals for Stress Tensor (9 values)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Array of Strain Tensor, to at least five significant figures (same format as input)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Percent volume change of cube, to at least five significant figures&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;(simple example for now)&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA;Young's Modulus: 29,000,000 psi&#xA;Poisson's Ratio: 0.30&#xA;Stress Tensor: [[50000,      0,     0]&#xA;                [    0, -10000,     0]&#xA;                [    0,      0, 25000]] psi&#xA;Output:&#xA;Strain Tensor: [[0.00157,        0,       0]&#xA;                [      0, -0.00112,       0]&#xA;                [      0,        0, 0.00045]] in/in&#xA;Dilation: 0.08966%&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;IO is flexible&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Stress Tensor input can be any size array, or string&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input type and size must be the same as output&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No formatting or units required&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, least number of bytes for each language wins&lt;/p&gt;&#xA;" OwnerUserId="81436" LastActivityDate="2018-07-08T01:07:29.200" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16623" PostTypeId="2" ParentId="6918" CreationDate="2018-07-08T12:02:52.470" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://gitlab.com/TheWastl/Reflections#reflections&quot; rel=&quot;nofollow noreferrer&quot;&gt;Reflections&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Reflections is a 2D Language. A typical program (Fibonacci):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;     \&#xA;/*\   /# (0:0\&#xA;* 0  *\_ (0\/ :(0\&#xA;  \       v/#@/_ /&#xA;\  (1/   1)0)*&#xA;          : \\/&#xA;          \(1/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://thewastl.gitlab.io/Reflections/reflections.html##ICAgICBcCi8qXCAgIC8jICgwOjBcCiogMCAgKlxfICgwXC8gOigwXAogIFwgICAgICAgdi8jQC9fIC8KXCAgKDEvICAgMSkwKSoKICAgICAgICAgIDogXFwvCiAgICAgICAgICBcKDEv/zH/MP8w/w==&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt; is the online interpreter to test it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The most special thing is that you need to go to certain positions in the&#xA;coordinate system to perform very simple actions (e.g. add, push numbers).&#xA;It has 11 stacks, and you can move around values between them, but all other&#xA;commands operate on the main stack.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It was the first language I created.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;+++ &lt;a href=&quot;https://gitlab.com/TheWastl/Reflections&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitLab repository&lt;/a&gt;&#xA;+++ &lt;a href=&quot;http://thewastl.gitlab.io/Reflections/reflections.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Online interpreter&lt;/a&gt;&#xA;+++ &lt;a href=&quot;https://gitlab.com/TheWastl/Reflections/wikis/home&quot; rel=&quot;nofollow noreferrer&quot;&gt;Documentation&lt;/a&gt;&#xA;+++ &lt;a href=&quot;https://chat.stackexchange.com/rooms/76946/reflections&quot;&gt;Chatroom&lt;/a&gt;&#xA;+++&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="78123" LastActivityDate="2018-07-08T12:02:52.470" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16624" PostTypeId="2" ParentId="6918" CreationDate="2018-07-08T12:38:41.873" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://gitlab.com/TheWastl/2DFuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;2DFuck&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;2DFuck is a very simple language created by me. It is inspired by brainfuck,&#xA;but operates on a 2-dimensional matrix of bits instead of a tape of bytes.&#xA;And it has an accumulator. The code is &lt;strong&gt;not&lt;/strong&gt; 2D, only the memory.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It does also have the &lt;code&gt;l&lt;/code&gt; built-in to run Conway's Game of Life on the memory,&#xA;though I haven't written any programs using this so far.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Programming is, in my opinion, a bit easier than in brainfuck, because of the&#xA;2D memory and the accumulator.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, a piece of code (a cat program):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;!x&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;vxvx[^^r![&amp;lt;r!]v![,x&amp;gt;r!]^![&amp;lt;r!]vr![&amp;gt;r!]vr![^^r![&amp;lt;r!]vv![^r.x&amp;gt;vr!]&amp;lt;]r!]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##RYqxCoAgEIb3nuLcw6E53NvbRCHKSLIMNb23txuEjp@7@z@@Ydvf9ayVoWiTMaPUOjA5BqYykz0KenTrxEW7v0SWDhwFUTUqWrXOh41AWW4wuFyPM7ybEmzeEHPRQ/HhhGLTAdfrkiUBnL1N5B8&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/164346/78123&quot;&gt;Here&lt;/a&gt; is an explanation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;+++ &lt;a href=&quot;https://gitlab.com/TheWastl/2DFuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitLab repository&lt;/a&gt;&#xA;+++ &lt;a href=&quot;https://tio.run/#2dfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;Online interpreter&lt;/a&gt;&#xA;+++&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="78123" LastActivityDate="2018-07-08T12:38:41.873" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16631" PostTypeId="2" ParentId="2140" CreationDate="2018-07-10T01:03:16.433" Score="1" Body="&lt;h1&gt;Play a Game of Balls Bounce&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The game &lt;a href=&quot;https://play.google.com/store/apps/details?id=ballz.brick.breaker.ballz.bounce.free&quot; rel=&quot;nofollow noreferrer&quot;&gt;Balls Bounce&lt;/a&gt; consists of the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a number of blocks, each containing a \$durability\$ number \$\geq 1\$&lt;/li&gt;&#xA;&lt;li&gt;a field of dimension \$h \times w\$, partially filled with blocks (field is \$9\times 7\$ in the example)&lt;/li&gt;&#xA;&lt;li&gt;a number of \$balls\$, positioned in one location at the bottom of the field&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Rules of the game:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The player chooses a direction in which all the balls will be shot sequentially.&lt;/li&gt;&#xA;&lt;li&gt;Each time a ball hits a block, that block's \$durability\$ decreases by \$1\$.&lt;/li&gt;&#xA;&lt;li&gt;A block that has its \$durability\$ decreased below \$1\$ is removed from the field.&lt;/li&gt;&#xA;&lt;li&gt;Balls that hit a block are deflected and continue to fly. Note that one ball may be deflected multiple times and hit the same block more than once.&lt;/li&gt;&#xA;&lt;li&gt;Balls do not interact with each other directly. They may be in the same place at the same time.&lt;/li&gt;&#xA;&lt;li&gt;If a ball touches the top, left, or right side of the field, it gets deflected in a similar manner.&lt;/li&gt;&#xA;&lt;li&gt;If a ball touches the bottom of the field, it gets stuck there and won't continue to fly this round.&lt;/li&gt;&#xA;&lt;li&gt;A round ends once there are no more balls flying around.&lt;/li&gt;&#xA;&lt;li&gt;After a round ends, all blocks on the field move one row downwards, and new blocks spawn in the top row.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;The player loses if any block goes past the bottom line.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Note that \$balls\$ might be higher than \$durability\$ of the first block that is hit. In that case, the player now has to keep to paths in mind: the first, a \$durability\$ amount of balls, is deflected by the block, while the second, a \$durability - balls\$ amount passes through the position where the now destroyed block once was.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the mobile game, the player can choose some angle for the shot. Because I want to make this challenge not bigger than it already is, there is only three possible angles to choose from: 45° to the left, denoted by \$L\$, straight upwards, denoted by \$U\$, and 45° to the right, denoted by \$R\$. Also, the first ball to touch the bottom line marks the position from which the nex round's shot will be taken. For simplicity's sake, all shots will be taken from the middle of the baseline. If a grid has even \$w\$, left of the middle is chosen. If an ambiguity would be created by two balls interacting with the same block at once, the ball that was shot first interacts first.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;h3&gt;The Field with Blocks&lt;/h3&gt;&#xA;&#xA;You may take this as a \$h \times w\$ 2D array of integers or strings. Each value represents the \$durability\$ of the block at that position. You may choose something other than \$0\$ to represent an empty space.&lt;/li&gt;&#xA;&lt;li&gt;&lt;h3&gt;The Amount of Balls&lt;/h3&gt;&#xA;&#xA;Quite self-explanatory. Integer (or any convenient format).&lt;/li&gt;&#xA;&lt;li&gt;&lt;h3&gt;The Direction&lt;/h3&gt;&#xA;&#xA;One of \$\{L, U, R\}\$. You may choose the three strings &lt;code&gt;&quot;L&quot;&lt;/code&gt;, &lt;code&gt;&quot;U&quot;&lt;/code&gt; ,&lt;code&gt;&quot;R&quot;&lt;/code&gt; to represent this, but any three distinct and consistent values will suffice.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;h3&gt;Is the game over?&lt;/h3&gt;&#xA;&#xA;Output a truthy value if the game is lost after this round, and a falsy one if the game can go on. Any two distinct and consitent values will suffice.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes for each language wins. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Example:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Field&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[0][0][0][0][0]&#xA;[0][9][0][0][0]&#xA;[0][0][1][0][1]&#xA;[0][0][0][2][0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Balls &lt;code&gt;3&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Direction &lt;code&gt;&quot;R&quot;&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;False&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Step-by-step:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-----------------------&#xA;          (1)&#xA;-----------------------&#xA;#######################   #  border of field&#xA;#+---+---+---+---+---+#   &#xA;#|   |   |   |   |   |#   +  corner of block/empty cell&#xA;#+---+---+---+---+---+#   -  horizontal border of block/empty cell&#xA;#|   | 9 |   |   |   |#   |  vertical border of block/empty cell&#xA;#+---+---+---+---+---+#   &#xA;#|   |   | 1 |   | 1 |#&#xA;#+---+---+---+---+---+#&#xA;#|   |   |   | 2 |   |#   2  durability&#xA;#+---+---+---+---+---+#&#xA;###########o###########   o  ball&#xA;           3              3  number of balls remaining to be shot&#xA;&#xA;-----------------------&#xA;          (2)&#xA;-----------------------&#xA;#######################&#xA;#+---+---+---+---+---+#&#xA;#|   |   |   |   |   |#&#xA;#+---+---+---+---+---+#&#xA;#|   | 9 |   |   |   |#&#xA;#+---+---+---+---+---+#&#xA;#|   |   | 1 |   | 1 |#&#xA;#+---+---+---+---+---+#&#xA;#|   |   |   o 1 |   |#      the first block is hit, durability decreased to 1&#xA;#+---+---+--/+---+---+#   /  &quot;tail&quot; to show the direction of the ball&#xA;###########o###########&#xA;           2&#xA;&#xA;-----------------------&#xA;          (3)&#xA;-----------------------&#xA;#######################&#xA;#+---+---+---+---+---+#&#xA;#|   |   |   |   |   |#&#xA;#+---+---+---+---+---+#&#xA;#|   | 9 |   |   |   |#&#xA;#+---+---+---+---+---+#&#xA;#|   |   | 0 |   | 1 |#      second block decreased to 0, ball that hit it is deflected&#xA;#+---+---+-o-+---+---+#&#xA;#|   |   |   o 0 |   |#      same for the first block&#xA;#+---+---+--/+---+---+#&#xA;###########o###########&#xA;           1&#xA;&#xA;-----------------------&#xA;          (3)&#xA;-----------------------&#xA;#######################&#xA;#+---+---+---+---+---+#&#xA;#|   |   |   |   |   |#&#xA;#+---+---+---+---+---+#&#xA;#|   | 9 |   |   |   |#&#xA;#+---+---+---+---+---+#&#xA;#|   |   |   |   | 1 |#       &#xA;#+---+---+-o-+---+---+#&#xA;#|   |   o   o   |   |# &#xA;#+---+---+---+---+---+#&#xA;###########-###########&#xA;           0&#xA;&#xA;-----------------------&#xA;          (4)&#xA;-----------------------&#xA;#######################&#xA;#+---+---+---+---+---+#&#xA;#|   |   |   |   |   |#&#xA;#+---+---+---+---+---+#&#xA;#|   | 9 |   |   |   |#&#xA;#+---+---+---+---+---+#&#xA;#|   |   o   |   | 1 |#       &#xA;#+---+---+---+-o-+---+#&#xA;#|   |   |   |   |   |# &#xA;#+---+-o-+---+---+---+#      first ball hit the bottom line...&#xA;###########-###########&#xA;           0&#xA;&#xA;-----------------------&#xA;          (5)&#xA;-----------------------&#xA;#######################&#xA;#+---+---+---+---+---+#&#xA;#|   |   |   |   |   |#&#xA;#+---+---+---+---+---+#&#xA;#|   | 8 |   |   |   |#&#xA;#+---+-o-+---+---+---+#&#xA;#|   |   |   |   o 0 |#       &#xA;#+---+---+---+---+---+#&#xA;#|   |   |   |   |   |# &#xA;#+---+---+---+---+---+#      ... and is removed subsequently&#xA;###########-###########&#xA;           0&#xA;&#xA;-----------------------&#xA;       (6 to 19)&#xA;-----------------------&#xA;#######################&#xA;#+---+-*-+---+---+---+#      *  path of the right ball&#xA;#|   *   *   |   |   |#&#xA;#+-*-+---+-*-+---+---+#&#xA;#*   | 8 |   *   |   |#&#xA;#+-*-+---+---+-o-+---+#&#xA;#|   o   |   |   |   |#      °  path of the left ball&#xA;#+-°-+-*-+---+---+---+#&#xA;#°   |   *   |   |   |# &#xA;#+-°-+---+-*-+---+---+#&#xA;###########-###########&#xA;           0&#xA;&#xA;-----------------------&#xA;          (20)&#xA;-----------------------&#xA;#######################&#xA;#+---+---+---+---+---+#&#xA;#|   |   |   |   |   |#&#xA;#+---+---+---+---+---+#&#xA;#|   |   |   |   |   |#      all balls are gone, blocks are shifted down&#xA;#+---+-V-+---+---+---+#      no block reaches the bottom line, so no game over&#xA;#|   | 8 |   |   |   |#       &#xA;#+---+---+---+---+---+#      Return false&#xA;#|   |   |   |   |   |# &#xA;#+---+---+---+---+---+#      &#xA;###########-###########&#xA;           0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The step-by-step diagram is just for illustrative purposes. You are not required to print any of the above.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox Questions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As this is my first challenge on here, I need some guidance. What examples should be added to clarify the task? What corner cases hould I take into consideration? And most importantly, is it clear what my challenge will be?&lt;/p&gt;&#xA;" OwnerUserId="76827" LastActivityDate="2018-07-10T01:03:16.433" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16636" PostTypeId="2" ParentId="16597" CreationDate="2018-07-11T04:42:28.150" Score="4" Body="&lt;h2&gt;Ask in chat&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your best bet is to ask someone else. Learning to evaluate the asymptotic complexity of a program is a pretty standard subject in most college CS educations, so there will probably be a number of people in chat who can either walk you through evaluating the complexity or do it for you, although the latter may be more difficult if you're using an esoteric language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For most small (&amp;lt;100 lines in a conventional language) programs, it's pretty easy to evaluate the complexity with some practice, so someone can often walk you through it.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;As an aside, evaluating complexity automatically is an ongoing research question in the programming languages world. I know some people who are working on it at my university. The best efforts cover a fair number of cases, but aren't all that general, and require you to write your program in their language. For the time being, human evaluation is typically the most effective.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2018-07-11T04:42:28.150" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16642" PostTypeId="2" ParentId="2140" CreationDate="2018-07-12T14:10:30.000" Score="-1" Body="&lt;h1&gt;Projective related points&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Points &lt;code&gt;A, B, C, D&lt;/code&gt; and &lt;code&gt;A′, B′, C′, D′&lt;/code&gt; are related by a projective transformation if their cross ratios are equal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/PyNjZ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/PyNjZ.png&quot; alt=&quot;Projective related points&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given &lt;code&gt;A, B, C, D&lt;/code&gt; four ordered points on a line, their cross ratio is defined as: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;\$\displaystyle\frac{distance(A,C)\times distance(B,D)}{distance(A,D)\times distance(B,C)}\$, &lt;/p&gt;&#xA;&#xA;&lt;p&gt;where \$distance(A,C)\$ is the Euclidean distance between points A and C.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a set of eight points, say if yes or no the set can be splited into two subgroups (each subgroup with four points) where the two subgroups are related by a projective transformation.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A set of 8 points, each point defined by its Cartesian coordinates (integer coordinates).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Either a specific true output (true, 1, yes, ...) or a specific false output (false, 0, no, ...).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{(10,100),(25,100),(2,63),(2,33),(31,100),(2,13),(2,3),(17,100)} --&amp;gt; true&#xA;with subgroups:&#xA;{(10,100),(25,100),(31,100),(17,100)} &#xA;and &#xA;{(2,63),(2,33),(2,13),(2,3)}&#xA;&#xA;{(45,54),(8,23),(8,8),(8,29),(27,30),(15,14),(9,6),(8,15)} --&amp;gt; true&#xA;with subgroups:&#xA;{(8,23),(8,8),(8,29),(8,15)}&#xA;and &#xA;{(45,54),(27,30),(15,14),(9,6)}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Hint (no need to use division or square root)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In order to avoid floating points, you can use the fact that points &lt;code&gt;A, B, C, D&lt;/code&gt; and &lt;code&gt;A′, B′, C′, D′&lt;/code&gt; are related by a projective transformation implies:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;\$distance^2(A,C)\times distance^2(B,D)\times distance^2(A',D')\times distance^2(B',C')\$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;equals&lt;/p&gt;&#xA;&#xA;&lt;p&gt;\$distance^2(A',C')\times distance^2(B',D')\times distance^2(A,D)\times distance^2(B,C)\$&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input and output can be given &lt;a href=&quot;http://meta.codegolf.stackexchange.com/q/2447/42963&quot;&gt;in any convenient format&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;No need to output the two subgroups.&lt;/li&gt;&#xA;&lt;li&gt;No need to handle the case when at least two points in the set are the same.&lt;/li&gt;&#xA;&lt;li&gt;No need to check the fact that the four points in each subgroup are aligned.&lt;/li&gt;&#xA;&lt;li&gt;In your submission, please state the true and the false values.&lt;/li&gt;&#xA;&lt;li&gt;Either a full program or a function are acceptable. If a function, you can return the output rather than printing it.&lt;/li&gt;&#xA;&lt;li&gt;If possible, please include a link to an on-line testing environment so other people can try out your code!&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://meta.codegolf.stackexchange.com/q/1061/42963&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so all usual golfing rules apply, and the shortest code (in bytes) wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="71398" LastEditorUserId="71398" LastEditDate="2018-07-19T16:13:34.520" LastActivityDate="2018-07-19T16:13:34.520" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16643" PostTypeId="2" ParentId="2140" CreationDate="2018-07-12T14:15:17.503" Score="-2" Body="&lt;h1&gt;Sort on an infinite-dimension cube&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a &lt;a href=&quot;https://en.wikipedia.org/wiki/Unit_cube&quot; rel=&quot;nofollow noreferrer&quot;&gt;unit cube&lt;/a&gt; in the \$n\$-dimensional space. Assume that the vertices of the cube has coordinate \$(x_0, x_1, x_2, \dots, x_n)\$ where \$x_i \in \{0,1\} \forall i\in \mathbb N, 0\le i&amp;lt;n\$.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's possible to number all vertices with non-negative integers less than \$2^n\$. In this challenge, the vertex with coordinate \$(x_0, x_1, x_2, \dots, x_n)\$ will be assigned with number \$2^0\times x_0+2^1\times x_1+\dots+2^n\times x_n\$.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each vertex can hold an integer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you can assume \$n\$ contains a very large (practically infinite) value.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Given \$4096\$ items placing in vertex 0 - vertex 4095, you're to sort them. Other vertices contain undefined values, and may be modified by the program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, the program cannot directly access the values held by the vertices. You can only control a memory pointer &lt;code&gt;M&lt;/code&gt;, which always lie at a vertex of the cube (call this vertex &lt;code&gt;V&lt;/code&gt;). Initially &lt;code&gt;M&lt;/code&gt; is at the coordinate \$(0,0,0,\dots)\$. This memory pointer can store exactly 1 integer value.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following operations on the memory pointer &lt;code&gt;M&lt;/code&gt; are alllowed:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Store the value held by &lt;code&gt;V&lt;/code&gt; into memory of &lt;code&gt;M&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Write the value stored by &lt;code&gt;M&lt;/code&gt; into &lt;code&gt;V&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Compare value stored by &lt;code&gt;M&lt;/code&gt; and value held by &lt;code&gt;V&lt;/code&gt;. This operation should report to the program 3 different values based on whether the comparison is \$&amp;lt;\$, \$=\$ or \$&amp;gt;\$.&lt;/li&gt;&#xA;&lt;li&gt;Move along an edge (in the direction specified by the program) of the cube. This corresponds to changing exactly 1 coordinate of &lt;code&gt;M&lt;/code&gt; from &lt;code&gt;0&lt;/code&gt; to &lt;code&gt;1&lt;/code&gt;, or vice versa.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your score is the distance traveled by the memory pointer.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;A psuedo-code sample interaction library may be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;obj[Infinity] = {[4096 values]}&#xA;ptr = 0, cry = undefined&#xA;function move(i): ptr = ptr xor (1 shl i)&#xA;function carry(): cry = obj[ptr]&#xA;function place(): obj[ptr] = cry&#xA;function compare(): return sgn(obj[ptr] - cry)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You can write functions, use IO, or anyway to interact. Lowest &lt;code&gt;move&lt;/code&gt; callings win.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="69850" LastEditDate="2018-07-20T15:41:11.720" LastActivityDate="2018-07-20T15:41:11.720" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="16644" PostTypeId="2" ParentId="2140" CreationDate="2018-07-12T14:53:51.560" Score="0" Body="&lt;h1&gt;An example text for scrambled-words experiment. Version 1&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This challenge is based on an old experiment that proves that we only need first two and last two letters in order to uniquely identify a word. The remaining middle-characters can be completely scrambled and yet we should not have any problems in reading the whole word. And the speed of reading even longest scrambled-words based text shouldn't be significantly longer than reading an &quot;normal&quot; text.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge itself is to write a shortest possible code (any language) that can be used to generate test texts to prove above described idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The experiment in the background of this challenge was conducted many years ago by some English or American scientist. I can't credit particular source or recall any other details. The challenge itself is created by me.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write the shortest possible code to generate test text (any length) based on following algorithm:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;For each word in input text.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If word is 5 characters long or less -- keep it unchanged.&lt;/li&gt;&#xA;&lt;li&gt;If word is 6 characters long or longer -- keep first two and last two characters unchanged and scramble remaining ones.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Print generated resulting text with scrambled words.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;There there no corner cases except for two assumptions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Words with 5 characters and less should be kept untouched.&lt;/li&gt;&#xA;&lt;li&gt;Your code must support all UTF-8 characters, not just English / non-Latin alphabet.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;I assume &quot;standard&quot; approach here, so the winner of the challenge will be determined by the length of the code.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example Input and Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;This challenge is based on an old experiment.&lt;/li&gt;&#xA;  &lt;li&gt;Print generated resulting text with scrambled words.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;This chllenage is based on an old exripmeent.&lt;/li&gt;&#xA;  &lt;li&gt;Print gertaneed reitlusng text with scbrmaled words.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;An example text for scrambled-words experiment. Version 2&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The extended version of this challenge adds only one new assumption to base / above algorithm:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;For each word in input text.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;If word is 4 characters long or less -- keep it unchanged&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;If word is 5 characters long -- keep first and last character unchanged and scramble remaining three&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If word is 6 characters long or longer -- keep first two and last two characters unchanged and scramble remaining ones.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Print generated resulting text with scrambled words.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;And again:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Words with &lt;del&gt;5 characters&lt;/del&gt; &lt;em&gt;4 characters&lt;/em&gt; and less should be kept untouched.&lt;/li&gt;&#xA;&lt;li&gt;Your code must support all UTF-8 characters, not just English / non-Latin alphabet.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Example Input and Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;This challenge is based on an old experiment.&lt;/li&gt;&#xA;  &lt;li&gt;Print generated resulting text with scrambled words.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;This chllenage is baesd on an old exripmeent.&lt;/li&gt;&#xA;  &lt;li&gt;Pirnt gertaneed reitlusng text with scbrmaled wrods.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="81628" LastActivityDate="2018-07-12T14:53:51.560" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16645" PostTypeId="2" ParentId="2140" CreationDate="2018-07-12T16:12:53.173" Score="-1" Body="&lt;h1&gt;Two functions with same input/output, with largest difference in bytes.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;This challenge is a terrible idea. Don't try submitting it or anything similar!&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Provide two &lt;strong&gt;&lt;em&gt;functions&lt;/em&gt;&lt;/strong&gt; with the largest difference in bytes. (These two &lt;strong&gt;&lt;em&gt;functions&lt;/em&gt;&lt;/strong&gt; will be referred to in bold italics to distinguish them from built-in functions available in your language in the rules below.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Both &lt;strong&gt;&lt;em&gt;functions&lt;/em&gt;&lt;/strong&gt; must take an input and must produce an output. The input to and output from both &lt;strong&gt;&lt;em&gt;functions&lt;/em&gt;&lt;/strong&gt; must be identical.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Both &lt;strong&gt;&lt;em&gt;functions&lt;/em&gt;&lt;/strong&gt; must be explicitly named. The &lt;strong&gt;&lt;em&gt;function&lt;/em&gt;&lt;/strong&gt; names must have the same byte count. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may not define any other functions. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you use a built-in function your language provides, it must be used with the same number of parameters in each of the &lt;strong&gt;&lt;em&gt;functions&lt;/em&gt;&lt;/strong&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may use string/numeric literals or any built-in constants, but you must use exactly the same ones in both &lt;strong&gt;&lt;em&gt;functions&lt;/em&gt;&lt;/strong&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can define variables, must you must use the same variable names in both &lt;strong&gt;&lt;em&gt;functions&lt;/em&gt;&lt;/strong&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can use comments, no-ops, and the equivalent, but they must be the same in both &lt;strong&gt;&lt;em&gt;functions&lt;/em&gt;&lt;/strong&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Both &lt;strong&gt;&lt;em&gt;functions&lt;/em&gt;&lt;/strong&gt; must contain the same amount of whitespace (or equivalently, don't count whitespace at all.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can import libraries/packages and the equivalent, as long as you import the same ones for both &lt;strong&gt;&lt;em&gt;functions&lt;/em&gt;&lt;/strong&gt;. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can use pre-processor directives as long as they are the same for both &lt;strong&gt;&lt;em&gt;functions&lt;/em&gt;&lt;/strong&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;If any of these rules mean your language cannot compete, so be it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Not really sure how to tag this. A little bit of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="79980" LastEditorUserId="79980" LastEditDate="2018-07-12T16:57:15.517" LastActivityDate="2018-07-12T16:57:15.517" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16646" PostTypeId="2" ParentId="2140" CreationDate="2018-07-12T21:49:19.720" Score="2" Body="&lt;h1&gt;Haferman Carpet&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given nonnegative integer input \$n\$ output the \$n\$th iteration of the Haferman carpet.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Constructing the carpet&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The zeroth iteration is &lt;code&gt;1&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;When going from the \$n\$th to the \$(n+1)\$th iteration, replace each \$1\$ with the pattern &lt;code&gt;[[0,1,0],[1,0,1],[0,1,0]]&lt;/code&gt; and each \$0\$ with the pattern &lt;code&gt;[[1,1,1],[1,1,1],[1,1,1]]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 [[1]]&#xA;&#xA;1 [[0,1,0],[1,0,1],[0,1,0]]&#xA;&#xA;2 [[1,1,1,0,1,0,1,1,1],[1,1,1,1,0,1,1,1,1],[1,1,1,0,1,0,1,1,1],&#xA;   [0,1,0,1,1,1,0,1,0],[1,0,1,1,1,1,1,0,1],[0,1,0,1,1,1,0,1,0],&#xA;   [1,1,1,0,1,0,1,1,1],[1,1,1,1,0,1,1,1,1],[1,1,1,0,1,0,1,1,1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Standard I/O stuff&lt;/h2&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Is this a duplicate? I will make the rules more explicit later.&lt;/p&gt;&#xA;" OwnerUserId="75553" LastActivityDate="2018-07-12T21:49:19.720" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16649" PostTypeId="2" ParentId="2140" CreationDate="2018-07-13T08:10:50.803" Score="0" Body="&lt;h1&gt;Maximal number of programming languages in 1KiB&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In this code-challenge your task is to write a program/function with a maximum of 1024 bytes, the goal is to interpret/compile as many programming languages as possible.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You're free to use any combination of inputs and outputs as you wish.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Inputs will be the name&lt;sup&gt;1&lt;/sup&gt; of the programming language and the source code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The inputs can be&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;read from a file (you may hardcode a filename if it helps)&lt;/li&gt;&#xA;&lt;li&gt;read from &lt;em&gt;stdin&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;taken as command-line arguments&lt;/li&gt;&#xA;&lt;li&gt;taken as function arguments&lt;/li&gt;&#xA;&lt;li&gt;a combination of the above&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1: you may choose to encode them, as long as the encoding is bijective - for example numbering the languages &lt;em&gt;1&lt;/em&gt; through &lt;em&gt;n&lt;/em&gt;.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The output can be&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the resulting side-effects of interpreting the program in the specified language&lt;/li&gt;&#xA;&lt;li&gt;valid machine code that produces the above&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;What is a programming language?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;For the purpose of this challenge a programming language needs to be&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Turing-complete&lt;/li&gt;&#xA;&lt;li&gt;publicly listed, as in having one of the following:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;an entry on &lt;a href=&quot;https://esolangs.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolangs&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;an entry on &lt;a href=&quot;https://rosettacode.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Rosettacode&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;an entry on &lt;a href=&quot;https://en.wikipedia.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;an interpreter/compiler hosted on &lt;a href=&quot;https://bitbucket.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Bitbucket&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;an interpreter/compiler hosted on &lt;a href=&quot;https://github.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;an interpreter/compiler hosted on &lt;a href=&quot;https://sourceforge.net/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sourceforge&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;released before 13. July 2018&lt;/li&gt;&#xA;&lt;li&gt;able to do I/O&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;What does my interpreter/compiler need to implement?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;For each of the chosen programming languages, your program does not need to implement the full language. It suffices to implement a working subset of it as long as it stays Turing-complete.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The answer that implements the greatest number of different programming languages wins.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Tags:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compiler&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compiler&amp;#39;&quot; rel=&quot;tag&quot;&gt;compiler&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should I leave the source size restriction and use a different scoring, eg. \$\frac{\#bytes}{\#langs ^ n}\$ for some \$n \ge 1\$?&lt;/li&gt;&#xA;&lt;li&gt;Should I disallow using polyglotting (maybe &lt;code&gt;eval&lt;/code&gt; could be used several times that way which would be boring)?&lt;/li&gt;&#xA;&lt;li&gt;How should I properly define &lt;em&gt;different programming languages&lt;/em&gt; (should I count different versions as 1 each)?&lt;/li&gt;&#xA;&lt;li&gt;Additional places for entries, descriptions of programming languages?&lt;/li&gt;&#xA;&lt;li&gt;Missing tags or other suggestions?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="48198" LastEditorUserId="48198" LastEditDate="2018-07-13T20:28:00.613" LastActivityDate="2018-07-13T20:28:00.613" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16655" PostTypeId="2" ParentId="2140" CreationDate="2018-07-14T21:28:46.343" Score="3" Body="&lt;h1&gt;Mixed alphanumeric sort&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot;&gt;sorting&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can't decide if you want to sort by letter or by number? Just do both!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Create a program that, given a series of strings composed of the characters &lt;code&gt;_&lt;/code&gt;, &lt;code&gt;0-9&lt;/code&gt;, and &lt;code&gt;a-z&lt;/code&gt;, sorts them and returns them in order.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Sorting is done according to the following algorithm:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A token is any character among &lt;code&gt;_a-z&lt;/code&gt; or a &lt;strong&gt;contiguous series&lt;/strong&gt; of numerals&lt;/li&gt;&#xA;&lt;li&gt;The empty string is sorted first&lt;/li&gt;&#xA;&lt;li&gt;Single token strings are sorted as follows:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;_&lt;/code&gt; is sorted before numbers, and numbers are sorted before letters&lt;/li&gt;&#xA;&lt;li&gt;Numbers are sorted in numeric order, and letters are sorted from A to Z&lt;/li&gt;&#xA;&lt;li&gt;If two numbers have the same value, the shorter one is sorted first&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Multi token strings are sorted according to the first token. If the first token is the same, then use the second, then third, etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Here is an example of a sorted list. You can use newlines, commas, or whatever else to separate the items, or you can just use a standard array type.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;_first&#xA;5&#xA;5x&#xA;5y&#xA;123&#xA;0123&#xA;124&#xA;ab_&#xA;ab5&#xA;ab10&#xA;abc&#xA;abc&#xA;abc00b&#xA;abc000a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input list can contain empty strings, but is always at least 1 element long&lt;/li&gt;&#xA;&lt;li&gt;Input and output may be a list, or a string with separator characters of choice&lt;/li&gt;&#xA;&lt;li&gt;Output can also be in-place (modifying the input list), as long as the changes are readable from outside the program&lt;/li&gt;&#xA;&lt;li&gt;You can choose to process uppercase characters instead of lowercase ones&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply&lt;/li&gt;&#xA;&lt;li&gt;Lowest byte count wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sandbox questions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the description clear enough, or could anything be added to it?&lt;/li&gt;&#xA;&lt;li&gt;It turns out this is a near duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/108571/filesystem-sort-my-directory-please&quot;&gt;this one&lt;/a&gt;, but with the addition of a character that must be sorted before numbers, which changes the strategy. Is this different enough to be its own question?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="55946" LastEditorUserId="55946" LastEditDate="2018-07-22T22:13:36.377" LastActivityDate="2018-07-22T22:13:36.377" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16657" PostTypeId="1" CreationDate="2018-07-16T01:20:24.137" Score="1" ViewCount="117" Body="&lt;p&gt;Consider a challenge:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Given a positive integer \$n\$, compute \$n^2\$. The solution with the least asymptotic time complexity in terms of \$n\$ wins. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;(let's temporarily ignore that it's too boring or too trivial)&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is it clear enough?&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Assume it's clear enough. Consider this C++ answer. On normal machines, &lt;code&gt;int&lt;/code&gt; is the same type as &lt;code&gt;int32_t&lt;/code&gt;, which can only hold integers in range \$\left[-2^{31}\dots2^{31}-1\right]\$)&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;code&gt;int f(int n){return n*n;}&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Is it a valid answer?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If it is, it will likely be compiled to a single assembly instruction.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;code&gt;imul edi, edi&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;What should be its asymptotic time complexity?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;If it isn't, why?&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Note: Challenges can be objectively and unambiguously defined when there is a set of &quot;base&quot; operations that the program can use, for example:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Given a list \$A\$ of positive integers, sort the list \$A\$. You are not allowed to access the list directly, however you can do the following operations by calling black-box procedures:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Compare two numbers at index \$i\$ and \$j\$ (call &lt;code&gt;compare(i, j)&lt;/code&gt;). Returns &lt;code&gt;signum(A[i] - A[j])&lt;/code&gt;.&lt;/li&gt;&#xA;  &lt;li&gt;Swap two numbers at index \$i\$ and \$j\$ (call &lt;code&gt;swap(i, j)&lt;/code&gt;)&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;  &#xA;  &lt;p&gt;The solution with the asymptotically least number of calls to &lt;code&gt;compare&lt;/code&gt; function wins.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;(yes, this is also trivial, with a provably optimal \$O(n \log n)\$ solution)&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, in that case they will be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fewest-operations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fewest-operations&amp;#39;&quot; rel=&quot;tag&quot;&gt;fewest-operations&lt;/a&gt;, not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Note: PeterTaylor's answer at revision 1's &quot;moreover...&quot; part was pointing out a flaw in the question. Now I've fixed it, as I think that it's better to fix it rather than ask a new question.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="69850" LastEditorUserId="69850" LastEditDate="2018-07-20T04:35:42.413" LastActivityDate="2018-07-20T04:35:42.413" Title="Complexity of assembly built-in?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16658" PostTypeId="2" ParentId="16657" CreationDate="2018-07-16T16:01:49.133" Score="2" Body="&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Is it clear enough?&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;No, so the rest of the question is moot. To be clear enough, the example question should explain in sufficient detail what types are admissible. For integers, this is actually quite tricky: some languages have built-in big integers; some languages &lt;em&gt;only&lt;/em&gt; have big integers; for others the natural type to use would be an array of some integer type, but then you need to consider whether the base is allowed to be different to the size of the type (taking into account that not all languages have unsigned types, and not all languages have &lt;em&gt;signed&lt;/em&gt; types) and whether or not it's acceptable to mix endianness; and for others the natural type is a unary string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moreover, in many challenges (possibly not this one) the difference between unary representations vs higher bases is very important in strict comparison of asymptotic complexity, which is expressed in terms of the &lt;em&gt;length&lt;/em&gt; of the input rather than the &lt;em&gt;represented value&lt;/em&gt; of the input. Thus, for example, &quot;&lt;em&gt;Input a positive integer and print the integers from 0 up to and including the input value&lt;/em&gt;&quot; is trivially implemented in quadratic time for unary representations, but the length of the output is superpolynomial in the length of the input if the input is given in base 2 or higher.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-07-16T16:01:49.133" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16662" PostTypeId="1" CreationDate="2018-07-17T07:43:12.480" Score="12" ViewCount="206" Body="&lt;p&gt;Today I corrected someone who thought that scoring by counting the number of calls to a given function at runtime is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;. Said person pointed me at a quote from the tag wiki:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Atomic code golf asks you to solve a task using only a limited set of operations, with as few of these operations as possible.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It is genuinely ambiguous.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The previous version, with a detailed scoring system, was probably too prescriptive; and I can understand if the author of the current version deliberately avoided the word &lt;em&gt;token&lt;/em&gt; because of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2567/194&quot;&gt;previous meta discussion about atomic-code-golf&lt;/a&gt; or because it's too restrictive for scoring &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/logic-gates&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;logic-gates&amp;#39;&quot; rel=&quot;tag&quot;&gt;logic-gates&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/logic-gates+atomic-code-golf&quot;&gt;questions&lt;/a&gt;. But if it can easily be understood to be talking about algorithmic complexity rather than source code, the current wording needs revision, and it seems like a good idea to sandbox the text here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore please post proposed edits (or rewrites) here, and let's see whether we can find a way of phrasing it which avoids all of the traps mentioned above.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-07-21T13:53:11.557" Title="atomic-code-golf tag wiki is misleading" Tags="|discussion|tags|tag-wikis|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16663" PostTypeId="2" ParentId="2140" CreationDate="2018-07-17T09:05:40.877" Score="1" Body="&lt;h1&gt;Drawing a convex polyiamond &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyomino&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyomino&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyomino&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A subtask of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/168679&quot;&gt;Drawing convex polyiamonds&lt;/a&gt;. I consider the drawing part hard enough on itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Polyiamond&quot; rel=&quot;nofollow noreferrer&quot;&gt;polyiamond&lt;/a&gt; is a polygon made from equilateral triangles. For example: (example in ASCII art)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  *&#xA; / \&#xA;*---*&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  *---*&#xA; / \ / \&#xA;*---*---*&#xA; \ /&#xA;  *&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(with lines drawn between the triangles for clarity)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While the first polyiamond is convex, the second one is not.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Consider a convex polyiamond. All of its internal angles must be less than 180°. Also, the internal angle of a triangle is 60°, so each vertex must be 60° or 120°.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Assume a polyiamond has all 120° angles. It must have 6 edges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given the length of those 6 edges, it's either possible to reconstruct the polyiamond uniquely, or there are no such polyiamond. For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(1,1,1,1,1,1) -&amp;gt;&#xA;&#xA;  *---*&#xA; / \ / \&#xA;*---*---*&#xA; \ / \ /&#xA;  *---*&#xA;&#xA;(1,2,1,2,1,2) -&amp;gt;&#xA;&#xA;  *---*---*&#xA; / \ / \ / \&#xA;*---*---*---*&#xA; \ / \ / \ /&#xA;  *---*---*&#xA;   \ / \ /&#xA;    *---*&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Now consider a 60° internal angle. It can be assumed to be two consecutive 120° angle with the intermediate edge have length 0. For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(0,1,0,1,0,1) -&amp;gt;&#xA;&#xA;  *&#xA; / \&#xA;*---*&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Your program should take a list of 6 non-negative integers (in any convenient format such as: tuples, string of comma-separated integers, \$2^a 3^b 5^c 7^d 11^e 13^f\$ (for Fractran?)) which represents a valid convex polyiamond, and output the polyiamond as ASCII art.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's guaranteed that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No numbers in the list will exceed 12.&lt;/li&gt;&#xA;&lt;li&gt;It's guaranteed that there is at least 1 cell in the output. (so &lt;code&gt;(0,0,1,0,0,1)&lt;/code&gt; is not a valid input) Equivalently, no two consecutive &lt;code&gt;0&lt;/code&gt;'s can appear in the input list.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="69850" LastActivityDate="2018-07-17T09:05:40.877" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16664" PostTypeId="2" ParentId="2140" CreationDate="2018-07-17T10:07:59.047" Score="-1" Body="&lt;p&gt;Quiet QR&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your mission, should you choose to accept it is to infiltrate the top secret HQ of the Big Bad Evil Guy (TM) and extract information on their latest evil scheme saved in the file Plan.txt.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The target PC is isolated from any and all network connections, and you can't physically connect anything to it. The server room is equipped with sound sensors that will detect key presses.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your tools are restricted to a mobile phone equipped with a QR code reader.&#xA;Your recommended course of action is to write a code on the target machine that will display the file content as QR code.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are to complete the mission with the least number of keystrokes as to minimise the sound generated by the mechanical keyboard.&lt;br&gt;&#xA;It is advisable not to use languages that require unicode characters as entering one character will require multiple key presses (Eg:þ = Alt+0254) is considered 5 keystrokes.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are to assume that the machine will have its terminal open and ready for input at the root directory of the system (C:\&gt; or /).  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;All programming languages can be accessed directly from root folder.&#xA;The target file is on the root folder.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Javascript is available as command line executable named js usable as (js filename) and prints output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Image viewer is called view and usable as (view imagefile) [Extension is not needed]  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Possible ways of output:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;An image containing the QR code&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;ASCII art depicting the QR code using characters like █ ▄▀&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Or any form readable by any standard-issue QR code reader&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Other formats of 2D barcodes are accepted on the condition of being readable by a standard reader.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Example Solution for batch file:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;copy con a.bat&#xA;open file Plan.txt&#xA;echo █ ▄▀&#xA;^Z&#xA;a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;=59 keystrokes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The symbols are 4 keystrokes each:  &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;▀ Alt+991&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;█ Alt+987&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;▄ Alt+988&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;^Z as Ctrl+z and is considered 2 ketstrokes (F6 is considered one).&lt;br&gt;&#xA;New lines and spaces are one keystroke each.&lt;br&gt;&#xA;Capital letters are 2 strokes (Shift+c).&lt;br&gt;&#xA;CAPITAL words are one keystroke added to the length of the word (Shift+capital).&lt;br&gt;&#xA;No need to clean the screen at the end because the evidence will be erased by a Micro-EMP device that will disable the machine.&lt;/p&gt;&#xA;" OwnerUserId="75178" LastActivityDate="2018-07-17T10:07:59.047" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16665" PostTypeId="1" AcceptedAnswerId="16666" CreationDate="2018-07-17T15:34:34.247" Score="7" ViewCount="194" Body="&lt;p&gt;I have a slightly problem. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I want to post a challenge (to the sandbox) about building a matrix with X pattern. The problem is that I don't know how to explain it using technical words or mathematical expressions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I post what is needed to do in the challenge and provide multiple &lt;code&gt;input -&amp;gt; output&lt;/code&gt; example, would it be clear enough?&lt;/p&gt;&#xA;" OwnerUserId="78039" LastActivityDate="2018-07-17T15:52:12.080" Title="Explaining a challenge only with test cases and examples" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16666" PostTypeId="2" ParentId="16665" CreationDate="2018-07-17T15:45:11.273" Score="18" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;If I post what is needed to do in the challenge and provide multiple &lt;code&gt;input -&amp;gt; output&lt;/code&gt; example, would it be clear enough?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Only for test batteries: if the inputs listed in the spec are the &lt;em&gt;only&lt;/em&gt; possible inputs, there's no need to explain the pattern.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unless the pattern is &lt;em&gt;extremely&lt;/em&gt; simple and obvious, people should not have to try and guess the pattern from the test cases. Chances are, the test cases do not cover all edge cases, leaving the challenge ambiguous and invalidating answers when further test cases are added to clarify it.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The problem is that I don't know how to explain it using technical words or mathematical expressions.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That means the pattern is complex and in need of an explanation. If the challenge doesn't contain one, it will most likely get closed as &lt;em&gt;unclear what you're asking&lt;/em&gt;. I would vote to close myself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, you can absolutely post your challenge &lt;em&gt;to the sandbox&lt;/em&gt; and get the community's help to come up with a text explanation. That's what the sandbox is for.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2018-07-17T15:52:12.080" LastActivityDate="2018-07-17T15:52:12.080" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16670" PostTypeId="2" ParentId="2447" CreationDate="2018-07-18T10:34:34.010" Score="17" Body="&lt;h1&gt;When a challenge asks for an array as input/output, you may use a list instead, and vice-versa&lt;/h1&gt;&#xA;&lt;p&gt;Note that some languages may lack one of these concepts. For example, &lt;strong&gt;TI-Basic&lt;/strong&gt; does not have an array datatype (but has lists) and &lt;strong&gt;C&lt;/strong&gt; does not have a list in its standard library, but has arrays as part of the language.&lt;/p&gt;&#xA;&lt;p&gt;In keeping with the general flexibility of I/O formats, I suggest we allow to use them interchangeably for all languages.&lt;/p&gt;&#xA;" OwnerUserId="79343" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-07-18T10:34:34.010" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16671" PostTypeId="2" ParentId="2140" CreationDate="2018-07-18T16:05:01.570" Score="0" Body="&lt;h1&gt;Irrational Array indexing Starts at 3.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I came across the following brilliant comment, which suggests that subsequent sets of digit from pi should be used to Index an array, from a user named on the r/programmer humor subreddit &lt;a href=&quot;https://www.reddit.com/r/ProgrammerHumor/comments/8ztjmn/arrays_start_at_05f/e2lo6l8/?context=3&quot; rel=&quot;nofollow noreferrer&quot;&gt;context for the curious&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;To fix the duplicate problem, instead take an extra digit whenever you are about&#xA;to duplicate a key: arr[3], arr[1], arr[4], arr[15], &#xA;arr[9], arr[2], arr[6], arr[5], arr[35] and so on.&#xA;&#xA;Exercise for the reader: write a program that outputs the nth index of this array, and describe for yourself the limitations of the program (what is the maximum value of n? what is the minimum?)&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your task (should you choose to accept it), is to implement a function (or rather pair of functions/ (pair of full programs/ one of each)) that converts to and from this cutting-edge choice. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may either write a single function that receives two inputs one being an integer input, and two being which way to go, or you can write a pair of functions and your score will be the sum of their sizes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Put another way, implement both f(x) and \$ f^{-1}(x) \$ according to this table. You may also instead implement f(x-1), and \$ f^{-1}(x) \$ + 1 (1 indexed arrays), but you will get some stern looks.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;x f(x)&#xA;------&#xA;0 3&#xA;1 1&#xA;2 4&#xA;3 15&#xA;4 9&#xA;5 2&#xA;6 6&#xA;7 5&#xA;8 35&#xA;19 950&#xA;21 841&#xA;41 6280&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This problem is essentially identical to &lt;a href=&quot;https://oeis.org/A064809&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS A064809&lt;/a&gt;, although the table there is one indexed. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, so shortest code in bytes wins. As always, you may use any programming language, but standard loopholes are prohibitted. What is allowed though, is that at no penalty you may optionally take in a second or third input with the first 10,000 digits of pi. Your code must work with 0&amp;lt;=x&amp;lt;=1000. Even if you choose to receive pi as input, I'll personally encourage you to write one that doesn't require pi as input, It'll obviously be unscored, but you'll earn some imaginary internet points. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="46918" LastEditorUserId="46918" LastEditDate="2018-07-19T16:07:22.413" LastActivityDate="2018-07-19T16:07:22.413" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="16672" PostTypeId="2" ParentId="16662" CreationDate="2018-07-19T03:37:29.603" Score="2" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;My proposed rewrite below.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; asks you to write a program with a score as small as you can.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The source code is divided into parts (often called &quot;token&quot;, but it may be different, for example &quot;logic gate&quot;, &quot;node&quot;). Each part has a score defined by the challenge. The score of the program is the sum of the scores of its parts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is a special case of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; (where each byte is 1 token, and each token scores 1 point); and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; is a special case of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Note for challenge-writers:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; challenge can be unambiguously defined when submissions are restricted to a single simple language/submission format (for example: a graph, logic gates), where it's possible to list all possible tokens and score them. Be careful to say exactly what each operation in your language does: for example, modulus works differently with negative numbers in different languages. Ideally, you could provider an interpreter for the language.&lt;/li&gt;&#xA;&lt;li&gt;The tokenization rules must be objective. That is, it must be possible to write a program that tokenizes the program and score the programs objectively.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="69850" LastEditorUserId="69850" LastEditDate="2018-07-21T13:53:11.557" LastActivityDate="2018-07-21T13:53:11.557" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="16673" PostTypeId="1" CreationDate="2018-07-19T17:55:17.953" Score="8" ViewCount="311" Body="&lt;p&gt;Originally &lt;a href=&quot;https://codegolf.stackexchange.com/questions/168828/find-the-inverse-of-a-3-by-3-matrix&quot;&gt;on this challenge&lt;/a&gt; I banned built in matrix functions but people complained about it. I then removed the ban but there were few interesting answers given and some people complained and said there should be no built ins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So what should I have done? In my opinion, I am for banning built ins because if your language has a function that will perform the task easily, there is no motivation to make your answer interesting.&lt;/p&gt;&#xA;" OwnerUserId="30525" LastActivityDate="2018-07-19T18:38:29.637" Title="What is the consensus on built ins?" Tags="|discussion|code-golf|rules|" AnswerCount="1" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="16674" PostTypeId="2" ParentId="16673" CreationDate="2018-07-19T18:38:29.637" Score="12" Body="&lt;h3&gt;If most languages have a builtin, then the challenge is too simple&lt;/h3&gt;&#xA;&lt;p&gt;There are some exceptions, for example I like the existence of the &lt;a href=&quot;https://codegolf.stackexchange.com/q/84260/71434&quot;&gt;Add Two Numbers&lt;/a&gt; challenge as a &amp;quot;language showcase&amp;quot;, but they are exceedingly rare. In other words, if all the answers are just &amp;quot;use builtin&amp;quot; then the challenge won't be saved by banning builtins.&lt;/p&gt;&#xA;&lt;h3&gt;The fact that a language has a weird builtin can itself be interesting&lt;/h3&gt;&#xA;&lt;p&gt;An answer that sometimes gets brought up in discussions about builtins is &lt;a href=&quot;https://codegolf.stackexchange.com/a/71680/71434&quot;&gt;this one&lt;/a&gt;, which uses Mathematica's built in &amp;quot;Does the image contain an upright goat&amp;quot; function. As can be seen, many people like that answer due to the sheer absurdity of a programming language with that builtin. I don't think anybody would accuse that challenge of being &amp;quot;too simple&amp;quot;, though some don't agree with me that the linked answer is &amp;quot;interesting&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;Another example is &lt;a href=&quot;https://codegolf.stackexchange.com/a/139829/71434&quot;&gt;this one&lt;/a&gt;, which is interesting (to me) because it relies on less-than-obvious language behavior to use a single general-purpose function to solve a much more specific challenge. Again, not &lt;em&gt;everybody&lt;/em&gt; finds such answers interesting, but there would be very few answers on the site at all if we only accept answers that &lt;em&gt;everybody&lt;/em&gt; finds interesting.&lt;/p&gt;&#xA;&lt;h3&gt;A challenge that's uninteresting in some languages can be interesting in others&lt;/h3&gt;&#xA;&lt;p&gt;So you make a challenge that isn't trivial, the logic is pretty interesting, but the result is &amp;quot;useful&amp;quot; so several languages have a builtin for it. So what? It may not be an ideal situation where every answer is great, but that doesn't mean you should shove the challenge in the horrendous mess that is &amp;quot;trying to ban builtins&amp;quot; just to reduce the number of answers in hopes that the remaining ones are interesting. It's just not worth it.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-07-19T18:38:29.637" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16675" PostTypeId="2" ParentId="2140" CreationDate="2018-07-19T21:35:39.187" Score="1" Body="&lt;p&gt;Given a list of variable names and a list of monomials, output a string representation of the name of the polynomial. The monomials should be represented as pairs &lt;code&gt;[coefficient, vector of exponents]&lt;/code&gt; where the vector of exponents has the same length as the list of variable names.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Combine like terms, omit terms that have coefficient zero, and output the resulting polynomial. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the list of variables is &lt;code&gt;[&quot;x&quot;, &quot;y&quot;, &quot;z&quot;]&lt;/code&gt; then &lt;code&gt;[c, [i,j,k]]&lt;/code&gt; represents the monomial &lt;code&gt;c*x^iy^jz^k&lt;/code&gt;, so for example &lt;code&gt;[2, [1,2,3]]&lt;/code&gt; should be printed as &lt;code&gt;2xy^2z^3&lt;/code&gt; and &lt;code&gt;[-1, [0,1,2]]&lt;/code&gt; should be printed as &lt;code&gt;-yz^2&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;A worked example:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input &lt;code&gt;[&quot;x&quot;,&quot;y&quot;], [[4,[2,1]], [1,[0,0]], [-1,[1,1]],[-2,[2,1]]]&lt;/code&gt;: &#xA;The monomial &lt;code&gt;[2,1]&lt;/code&gt; which corresponds to &lt;code&gt;x^2y&lt;/code&gt; is repeated twice, &lt;code&gt;[4,[2,1]]&lt;/code&gt; with coefficient &lt;code&gt;4&lt;/code&gt; and &lt;code&gt;[-2,[2,1]]&lt;/code&gt; with coefficient &lt;code&gt;-2&lt;/code&gt; so we add those two coefficients together to get &lt;code&gt;2x^2y&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;[1,[0,0]]&lt;/code&gt; corresponds to &lt;code&gt;1x^0y^0&lt;/code&gt; which should be displayed as &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;[-1,[1,1]]&lt;/code&gt; corresponds to &lt;code&gt;-1x^1y^1&lt;/code&gt; which should be displayed as &lt;code&gt;-xy&lt;/code&gt;. The polynomial is the sum of these three, so all together the output should be &lt;code&gt;2x^2y - xy + 1&lt;/code&gt; or some reordering of these terms.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Requirements:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Operators can be surrounded in spaces&lt;/li&gt;&#xA;&lt;li&gt;Like terms should be combined.&lt;/li&gt;&#xA;&lt;li&gt;If the exponent is 1 it should be omitted: &lt;code&gt;x&lt;/code&gt;, not &lt;code&gt;x^1&lt;/code&gt;. If the exponent is zero, the variable should be omitted entirely: &lt;code&gt;y&lt;/code&gt; not &lt;code&gt;x^0y&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt; not &lt;code&gt;x^0y^0&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Empty polynomials should be represented as 0.&lt;/li&gt;&#xA;&lt;li&gt;Terms with coefficient zero should be dropped. A coefficient of &lt;code&gt;1&lt;/code&gt; should be omitted unless all exponents are zero. &lt;/li&gt;&#xA;&lt;li&gt;A negative coefficient should be written with a minus sign. If the first monomial has a positive coefficient, it should not be preceded by a &lt;code&gt;+&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Terms can be output in any order&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: [&quot;x&quot;], [] ==&amp;gt; &quot;0&quot;&#xA;Input: [], [[3,[]], [-7,[]]] ==&amp;gt; &quot;- 4&quot;&#xA;Input: [&quot;x&quot;], [[0,[5]]] ==&amp;gt; &quot;0&quot;&#xA;Input: [&quot;x&quot;], [[1,[5]]] ==&amp;gt; &quot;x^5&quot;&#xA;Input: [&quot;x&quot;], [[-1,[5]]] ==&amp;gt; &quot;- x^5&quot;&#xA;Input: [&quot;x&quot;], [[1,[5]], [1,[5]]] ==&amp;gt; &quot;2x^5&quot;&#xA;Input: [&quot;x&quot;], [[1,[5]], [-1,[5]]] ==&amp;gt; &quot;0&quot;&#xA;Input: [&quot;x&quot;], [[1,[2]], [2,[1]], [3,[0]]] ==&amp;gt; &quot;3 + 2x + x^2&quot;&#xA;Input: [&quot;x&quot;], [[3,[0]], [2,[1]], [1,[2]]] ==&amp;gt; &quot;3 + 2x + x^2&quot;&#xA;Input: [&quot;x&quot;, &quot;y&quot;, &quot;z&quot;], [[1,[0,0,1]], [1,[1,0,0]], [-1,[0,1,0]]] ==&amp;gt; &quot;x - y + z&quot;&#xA;Input: [&quot;x_1&quot;, &quot;x_2&quot;], [[1,[1,1]],[1,[2,2]]] ==&amp;gt; &quot;x_1x_2 + x_1^{2}x_2^{2}&quot;&#xA;Input: [&quot;x&quot;, &quot;y&quot;], [[2,[2,2]], [3,[2,1]], [4,[2,0]], [1,[0,0]], [-1,[1,0]],[-2,[2,0]]] ==&amp;gt; &#xA;        &quot;1 - x + 2x^2 + 3x^2y + 2x^2y^2&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="77634" LastActivityDate="2018-07-19T21:35:39.187" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16680" PostTypeId="2" ParentId="16662" CreationDate="2018-07-20T22:50:15.673" Score="6" Body="&lt;p&gt;Here is another proposal to rip apart:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; is similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; in that answers&#xA;  aim to minimise code size, but differs in that the size is counted in&#xA;  some &quot;atom&quot; other than bytes or characters.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;For example, a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/logic-gates&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;logic-gates&amp;#39;&quot; rel=&quot;tag&quot;&gt;logic-gates&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; question might&#xA;  ask for an implementation of a given logical function using any two-input&#xA;  logic gates, each scored equally; or it might allow only NOT gates for a&#xA;  score of 1 each and AND gates for a score of 2 each.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;The original intention of this challenge type was to level the playing&#xA;  field between golfing languages and industrial languages by counting&#xA;  tokens in the source code; making, for example, C#'s &lt;code&gt;.Length&lt;/code&gt; score&#xA;  only one more than GolfScript's equivalent &lt;code&gt;,&lt;/code&gt;. However, scoring code&#xA;  by tokens runs into problems of (a) defining &quot;token&quot; unambiguously for&#xA;  some languages; and (b) abuse of encoding programs into string or big&#xA;  integer literals. This challenge type works best for challenges which&#xA;  specify a single well-defined language and an unambiguous way of&#xA;  counting its atoms.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;See also: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/proof-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;proof-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;proof-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-07-20T22:50:15.673" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16681" PostTypeId="2" ParentId="2140" CreationDate="2018-07-21T19:49:15.013" Score="1" Body="&lt;h1&gt;Lord Vetinari's Clock&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Someone very clever — certainly someone much cleverer than whoever had&#xA;trained that imp — must have made the clock for the Patrician’s waiting&#xA;room. It went tick-tock like any other clock. But somehow, and against&#xA;all usual horological practice, the tick and the tock were irregular.&#xA;Tick tock tick ... and then the &lt;em&gt;merest&lt;/em&gt; fraction of a second longer&#xA;before ... tock tick tock ... and then a tick a &lt;em&gt;fraction&lt;/em&gt; of a second earlier&#xA;than the mind’s ear was now prepared for. The effect was enough, after&#xA;ten minutes, to reduce the thinking processes of even the&#xA;best-prepared to a sort of porridge. The Patrician must have paid the&#xA;clockmaker quite highly.&lt;/p&gt;&#xA;&lt;p&gt;-- &lt;em&gt;Feet of Clay&lt;/em&gt;, by Terry Pratchett&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a function or a program that alternatively outputs &amp;quot;tick&amp;quot; and &amp;quot;tock&amp;quot; every second. There is a 1/5 chance that the tick or tock should be &lt;em&gt;slightly&lt;/em&gt; faster or &lt;em&gt;slightly&lt;/em&gt; later than expected, with a 50/50 chance between it being early or late. The time difference should be 0.2 seconds.&lt;/p&gt;&#xA;&lt;p&gt;The clock should still keep accurate time: that is, if a tick or a tock is early or late, the next tick or tock should still be on-time. The clock itself should not &amp;quot;drift&amp;quot; because of the displaced ticks or tocks.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;The usual rules and loopholes apply.&lt;/p&gt;&#xA;&lt;p&gt;This is code golf: shortest code wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="78954" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-07-23T09:37:27.767" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="16684" PostTypeId="2" ParentId="2140" CreationDate="2018-07-23T05:53:39.093" Score="4" Body="&lt;h1&gt;Classical construction golf: Wernick's list No. 47 &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/proof-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;proof-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;proof-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Compass-and-straightedge_construction&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Compass-and-straightedge construction&lt;/strong&gt;&lt;/a&gt;, a.k.a. classical construction, is the construction of lengths, angles, and other geometric figures using only an idealized ruler and compass. A &lt;strong&gt;ruler&lt;/strong&gt; can only be used to draw a straight line passing through two given points; a &lt;strong&gt;compass&lt;/strong&gt; can only be used to draw a circle with two given points (a center, and a point on the circle).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All compass and straightedge constructions consist of repeated application of five basic constructions using the points, lines and circles that have already been constructed. These are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Creating the line through two existing points&lt;/li&gt;&#xA;&lt;li&gt;Creating the circle through one point, with another point as the center&lt;/li&gt;&#xA;&lt;li&gt;Creating the point which is the intersection of two existing, non-parallel lines&lt;/li&gt;&#xA;&lt;li&gt;Creating the one or two points in the intersection of a line and a circle (if they intersect)&lt;/li&gt;&#xA;&lt;li&gt;Creating the one or two points in the intersection of two circles (if they intersect).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/hpxfy.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/hpxfy.png&quot; alt=&quot;Five basic constructions&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition to these listed on Wikipedia, we have the sixth basic construction:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Creating an arbitrary point on the plane, possibly with a constraint:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;On a line (&quot;line&quot; includes straight lines and circles)&lt;/li&gt;&#xA;&lt;li&gt;Not on a line&lt;/li&gt;&#xA;&lt;li&gt;On a closed or open part of a line, bounded by existing points on it&lt;/li&gt;&#xA;&lt;li&gt;Inside a closed or open region, bounded by existing lines&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In any geometric problem, we have an initial set of symbols (points and lines), an algorithm, and some results. From this perspective, geometry is equivalent to an axiomatic algebra, replacing its elements by symbols.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is the basis of the new kind of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/proof-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;proof-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;proof-golf&lt;/a&gt;: &lt;strong&gt;classical construction golf&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://forumgeom.fau.edu/FG2016volume16/FG201610.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Wernick's list&lt;/strong&gt;&lt;/a&gt; is a collection of construction problems. The common objective is to recover the three vertices of a triangle, given three of its 16 &lt;em&gt;characteristic points&lt;/em&gt;. They include:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$A, B, C, O\$&lt;/span&gt;: three vertices and circumcenter,&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$M_a, M_b, M_c, G\$&lt;/span&gt;: the side midpoints and centroid,&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$H_a, H_b, H_c, H\$&lt;/span&gt;: three feet of altitudes and orthocenter,&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$T_a, T_b, T_c, I\$&lt;/span&gt;: three feet of internal angle bisectors and incenter.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Out of the 139 problems, some are solvable by construction, but some are not. The problem we'll tackle here is problem 47, where the given points are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;: a vertex.&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$H_a\$&lt;/span&gt;: the foot of the altitude on side &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt;; that is, the opposite side of the vertex &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$T_b\$&lt;/span&gt;: the foot of the bisector of angle &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Given these three points, recover the other vertices &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$C\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ZjtpM.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZjtpM.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring &amp;amp; Winning criterion&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Every usage of the &lt;strong&gt;six basic constructions&lt;/strong&gt; (shown above) counts. For the line intersections, &lt;strong&gt;creating each point adds 1 score&lt;/strong&gt;, e.g. if you need both intersections of two circles, you get 2 score from the step.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The solution with the lowest score wins.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Scoring example&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Task&lt;/strong&gt;: Construct the midpoint of two points &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Solution&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Draw circle &lt;span class=&quot;math-container&quot;&gt;\$C_1\$&lt;/span&gt; with center &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; going through &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;. (+1)&lt;/li&gt;&#xA;&lt;li&gt;Draw circle &lt;span class=&quot;math-container&quot;&gt;\$C_2\$&lt;/span&gt; with center &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; going through &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;. (+1)&lt;/li&gt;&#xA;&lt;li&gt;Draw two intersections &lt;span class=&quot;math-container&quot;&gt;\$X, Y\$&lt;/span&gt; of two circles &lt;span class=&quot;math-container&quot;&gt;\$C_1\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$C_2\$&lt;/span&gt;. (+2)&lt;/li&gt;&#xA;&lt;li&gt;Draw line &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; going through the two intersections. (+1)&lt;/li&gt;&#xA;&lt;li&gt;Draw line &lt;span class=&quot;math-container&quot;&gt;\$g\$&lt;/span&gt; going through the two given points. (+1)&lt;/li&gt;&#xA;&lt;li&gt;Draw the intersection &lt;span class=&quot;math-container&quot;&gt;\$M\$&lt;/span&gt; of &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$g\$&lt;/span&gt;. (+1)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The score of this construction is 7.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/PbCxy.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/PbCxy.png&quot; alt=&quot;Example task&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Tools&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://www.math10.com/en/geometry/geogebra/geogebra.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;GeoGebra&lt;/a&gt;&lt;/strong&gt; is a free online geometry tool. In addition to basic and advanced constructions, it has &lt;strong&gt;construction protocol&lt;/strong&gt; feature which clearly shows the steps used to create the final image. For the above example task, the construction protocol looks like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/QOB2Y.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/QOB2Y.png&quot; alt=&quot;Example construction protocol&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Out of 9 steps in total, the points &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; are given, so we can confirm that seven steps are taken for this particular construction.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It also supports &lt;strong&gt;&lt;a href=&quot;https://wiki.geogebra.org/en/Scripting&quot; rel=&quot;nofollow noreferrer&quot;&gt;scripting&lt;/a&gt;&lt;/strong&gt; (in GGBScript and JS) for those who want to view this challenge as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;. Among many geometry commands, the &lt;strong&gt;&lt;a href=&quot;https://wiki.geogebra.org/en/Prove_Command&quot; rel=&quot;nofollow noreferrer&quot;&gt;Prove&lt;/a&gt;&lt;/strong&gt; and &lt;strong&gt;&lt;a href=&quot;https://wiki.geogebra.org/en/ProveDetails_Command&quot; rel=&quot;nofollow noreferrer&quot;&gt;ProveDetails&lt;/a&gt;&lt;/strong&gt; commands may help you identify if a particular construction is indeed correct.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm using a relatively easy problem here, in order to see how this new challenge type is received. If it goes well, I'll propose some harder and open-ended problems later.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;s&gt;Is this actually on-topic on PPCG? I'm asking this since this is the first challenge of its kind.&lt;/s&gt; I'll assume on-topic unless someone says otherwise on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/16688/78410&quot;&gt;this meta question&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;s&gt;Maybe we need to tweak the difficulty of the challenge at hand. Is it too easy or too hard? Any other suggestions? I picked Wernick's list because it's not something you may see on Euclidea or similar, and the optimal (or elegant) solutions for many of the problems are not yet known.&lt;/s&gt; I'll go for the task this time, and try to ramp up in subsequent challenges.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2018-09-30T07:26:07.683" LastActivityDate="2018-09-30T07:26:07.683" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16688" PostTypeId="1" CreationDate="2018-07-24T04:11:31.100" Score="14" ViewCount="467" Body="&lt;p&gt;I recently submitted a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/16684/78410&quot;&gt;challenge proposal&lt;/a&gt; on the Sandbox, which is a kind of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/proof-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;proof-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;proof-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is the background section copied from the proposal:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Compass-and-straightedge_construction&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Compass-and-straightedge&#xA;  construction&lt;/strong&gt;&lt;/a&gt;,&#xA;  a.k.a. classical construction, is the construction of lengths, angles,&#xA;  and other geometric figures using only an idealized ruler and compass.&#xA;  A &lt;strong&gt;ruler&lt;/strong&gt; can only be used to draw a straight line passing through&#xA;  two given points; a &lt;strong&gt;compass&lt;/strong&gt; can only be used to draw a circle with&#xA;  two given points (a center, and a point on the circle).&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;All compass and straightedge constructions consist of repeated&#xA;  application of five basic constructions using the points, lines and&#xA;  circles that have already been constructed. These are:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Creating the line through two existing points&lt;/li&gt;&#xA;  &lt;li&gt;Creating the circle through one point with centre another point&lt;/li&gt;&#xA;  &lt;li&gt;Creating the point which is the intersection of two existing, non-parallel lines&lt;/li&gt;&#xA;  &lt;li&gt;Creating the one or two points in the intersection of a line and a circle (if they intersect)&lt;/li&gt;&#xA;  &lt;li&gt;Creating the one or two points in the intersection of two circles (if they intersect).&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;  &#xA;  &lt;p&gt;In any geometric problem, we have an initial set of symbols (points&#xA;  and lines), an algorithm, and some results. From this perspective,&#xA;  geometry is equivalent to an axiomatic algebra, replacing its elements&#xA;  by symbols.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;This is the basis of the new kind of proof-golf: &lt;strong&gt;classical&#xA;  construction golf&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I believe this follows the concept of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/proof-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;proof-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;proof-golf&lt;/a&gt;, but I doubt if it actually fits well with PPCG.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Peter Taylor said in the comment, &quot;proofs in logic can be argued to be as good as programs by reference to the Curry-Howard correspondence, but I don't really see extending that to proofs in general.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So here is the question:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;strong&gt;Is &quot;Proof-Golf for proofs in general&quot; on-topic?&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;If the answer to above is &quot;it depends&quot;, what is the condition for such a challenge to be on-topic?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;(Changing to &quot;build an automatic theorem prover&quot; is not an option; an article mentions such a theorem prover which has thousands of lines of code.)&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2018-07-24T04:32:20.350" Title="Is &quot;Proof-Golf for proofs in general&quot; on-topic?" Tags="|discussion|" AnswerCount="1" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="16689" PostTypeId="2" ParentId="16688" CreationDate="2018-07-24T04:32:20.350" Score="31" Body="&lt;h1&gt;Yes, as long as it is well-specified&lt;/h1&gt;&#xA;&lt;p&gt;For &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/proof-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;proof-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;proof-golf&lt;/a&gt;, we validate the prove by mentally following it.  For compass and straightedge, this means that &lt;strong&gt;a reader should be able to come out with the same solution given the same set of steps&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, each of the possible steps should have a well-specified score (Does placing a point increase your score?)&lt;/p&gt;&#xA;&lt;p&gt;Ideally, there would also be an interpreter we can use. Even better would be a language designed to construct compass-and-straightedge.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-07-24T04:32:20.350" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16691" PostTypeId="2" ParentId="2140" CreationDate="2018-07-24T16:40:12.943" Score="-3" Body="&lt;h1&gt;Send the pairs&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write two program A and B. A takes 1024 pairs of integers &lt;code&gt;(a,b)&lt;/code&gt;, where 0≤&lt;code&gt;a&lt;/code&gt;&amp;lt;2&lt;sup&gt;32&lt;/sup&gt;, 0≤&lt;code&gt;b&lt;/code&gt;&amp;lt;1024, and all &lt;code&gt;a&lt;/code&gt;s are different. Output a positive integer. B take the output of A and one &lt;code&gt;a&lt;/code&gt; from the input pairs of A, and output its &lt;code&gt;b&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Smallest output of A under a same random test data win.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2018-07-24T16:40:12.943" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="16694" PostTypeId="1" CreationDate="2018-07-25T06:45:36.687" Score="8" ViewCount="625" Body="&lt;p&gt;In compiled non-esoteric languages a solution is essentially always either a full program, a method, or a lambda expression. In a full program submission, the use of comments is clearly allowed. It's not clear to me, however, whether comments should be permitted in lambda submissions, which must be expressions, or method submissions. (This tends to come up in certain &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; challenges.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Strictly speaking, in Java, comments are a source-level concept and aren't part of the language's grammar, which suggests to me that source code that contains comments cannot represent an expression or even a method definition. I suspect that other similar languages are defined similarly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It could be said that a submission is acceptable if stripping comments out (as the compiler does) yields a valid expression/method. Yet a trailing line comment can affect the parsing of the program a lambda solution is embedded in if the submission doesn't end with a newline. This too seems a bit suspect to me.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Still, for the most part lambda and method submissions with comments seem intuitively acceptable. This is neither a pressing issue nor a particularly profound one, but it nags at me when I visit many restricted-source challenges. I'm interested to see what others think.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Consider this &lt;a href=&quot;https://codegolf.stackexchange.com/a/110700&quot;&gt;method solution&lt;/a&gt; and this &lt;a href=&quot;https://codegolf.stackexchange.com/a/110667&quot;&gt;lambda solution&lt;/a&gt; where the source is restricted to palindromes. And I use the slightly less suspect multiline comment in this &lt;a href=&quot;https://codegolf.stackexchange.com/a/167561&quot;&gt;lambda solution&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Update&lt;/strong&gt;: I've added an answer. If you have an opinion on this issue, consider voting on my answer and/or adding an alternative one.&lt;/p&gt;&#xA;" OwnerUserId="44945" LastEditorUserId="44945" LastEditDate="2018-07-25T17:26:44.923" LastActivityDate="2018-07-29T18:14:42.590" Title="Comments in lambda submissions" Tags="|discussion|" AnswerCount="3" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16696" PostTypeId="2" ParentId="16694" CreationDate="2018-07-25T17:24:31.240" Score="-4" Body="&lt;h1&gt;Comment use is restricted&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;While this may raise unforeseen issues, I suspect the best way to deal with this is to allow comments in a lambda or method submission as long as it's not possible for any comment to affect the parsing of the solution regardless of how it's embedded in a full program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Essentially this would mean that these submissions cannot have a line comment (&lt;code&gt;//&lt;/code&gt;) on their final line&amp;mdash;a trailing newline would be required to restore whitespace insensitivity. In other words, golfers may not expect a newline to be placed after their solution in the enclosing class/method/....&lt;/p&gt;&#xA;" OwnerUserId="44945" LastEditorUserId="44945" LastEditDate="2018-07-25T17:28:19.210" LastActivityDate="2018-07-25T17:28:19.210" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16697" PostTypeId="2" ParentId="16694" CreationDate="2018-07-25T18:49:39.720" Score="0" Body="&lt;h3&gt;If a submission claims to be an anonymous function, it must behave like an anonymous function.&lt;/h3&gt;&#xA;&lt;p&gt;In this case the anonymous function is described by a Lambda Expression, but I think the same rules would apply regardless of the mechanism for its definition or the language's terminology for the concept. I'll be using C# syntax for my examples because I'm familiar with it.&lt;/p&gt;&#xA;&lt;p&gt;A trivial anonymous function in C# could be defined by the lambda expression &lt;code&gt;x =&amp;gt; x&lt;/code&gt;. The way anonymous functions in C# work is that they could be stored under a name (&lt;code&gt;Func&amp;lt;string,string&amp;gt; cat = x =&amp;gt; x;&lt;/code&gt;), or they can be passed to another function that expects such a parameter (&lt;code&gt;ApplyTransform(x =&amp;gt; x)&lt;/code&gt;). Thus a submission which wants to be treated as an anonymous function would have to work in those situations.&lt;/p&gt;&#xA;&lt;p&gt;If we take that lambda expression and make it a palindrome using a line comment, &lt;code&gt;x =&amp;gt; x//x &amp;gt;= x&lt;/code&gt;, then we will find that it no longer works the way an anonymous function should in C#: &lt;code&gt;Func&amp;lt;string,string&amp;gt; cat = x =&amp;gt; x//x &amp;gt;= x;&lt;/code&gt; and &lt;code&gt;ApplyTransform(x =&amp;gt; x//x &amp;gt;= x)&lt;/code&gt; will not work because the line comment hides the &lt;code&gt;;&lt;/code&gt; and &lt;code&gt;)&lt;/code&gt; respectively. In this case, I would not accept &lt;code&gt;x =&amp;gt; x//x &amp;gt;= x&lt;/code&gt; as an anonymous function, and it doesn't work as a program or named function either so it would not be a valid submission.&lt;/p&gt;&#xA;&lt;p&gt;This tends to be highly language-dependent, and isn't particularly exclusive to comments. In a similar way, the leading &lt;code&gt;x =&amp;gt;&lt;/code&gt; can't be left out, and multiple parameters need to be enclosed in parentheses &lt;code&gt;(x,y) =&amp;gt; x+y&lt;/code&gt; etc. The problems caused by a trailing line comment in C# are resolved by adding a newline just like they (apparently) are in Java, but trailing line comments are really just one example of a thing where humans can understand the intended meaning (&amp;quot;it's a comment so it shouldn't have any effect&amp;quot;) but it doesn't actually work in the language. I don't think there's any need to define a &amp;quot;default&amp;quot; solution for a small subset of the problem, especially since that solution only works for a small subset of languages.&lt;/p&gt;&#xA;&lt;p&gt;TL;DR: There's nothing wrong with comments in general, and comments aren't any more special than other cases of &amp;quot;writing your program wrong so that it doesn't actually work even if it seems like it should&amp;quot;.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-07-25T18:49:39.720" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16699" PostTypeId="2" ParentId="2140" CreationDate="2018-07-26T02:16:35.057" Score="3" Body="&lt;h1&gt;Diagonalize a Blackbox &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;todo: test cases&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;more math explaination?&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;better challenge definition?&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The function \$f(x_1,x_2,x_3)=(3x_1,x_1+2x_2,x_1+x_2+x_3)\$ is a linear transformation on \$\mathbb{R}^3\to\mathbb{R}^3\$. We can prove this, because like all linear transformations, it satisfies:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;\$f(x_1+y_1,x_2+y_2,x_3+y_3)=f(x_1,x_2,x_3)+f(y_1,y_2,y_3)\$&lt;/li&gt;&#xA;&lt;li&gt;\$f(\alpha x_1,\alpha x_2,\alpha x_3)=\alpha f(x_1,x_2,x_3)\$&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Or, more compactly:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;\$f(\alpha x+\beta y) = \alpha f(x)+\beta f(y)\$&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;All linear transformations like this can be represented by a matrix multiplication, such as:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$ M = [f(x)] =&#xA;\begin{bmatrix}&#xA;3 &amp;amp; 0 &amp;amp; 0 \\&#xA;1 &amp;amp; 2 &amp;amp; 0 \\&#xA;1 &amp;amp; 1 &amp;amp; 1 &#xA;\end{bmatrix}&#xA;\begin{pmatrix}&#xA;x_1 \\&#xA;x_2 \\&#xA;x_3&#xA;\end{pmatrix}&#xA;= (x_1,x_1+x_2,x_1+x_2+x_3)&#xA;$$&#xA;One way to find this matrix is by feeding each of the members of the standard basis for \$\mathbb{R}^3\$, which is \$B = \{(1,0,0),(0,1,0),(0,0,1)\}\$, into \$f(x)\$ to get the columns. This can be for any linear transformation and any basis to get a matrix which represents the transformation in that basis.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For &lt;em&gt;some&lt;/em&gt; linear transformations, there is a basis \$B'\$ in which \$M'\$ is diagonal - this requires that \$M\$ in \$B\$ be diagonalizable which requires it have unique eigenvalues. However, in this challenge all transformations you have to deal with will fulfill these requirements.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Continuing with the same example, we can determine the eigenvalues of \$M\$ by finding solutions to \$|M-\lambda I_3|=0\$, and the eigenvectors by solving \$Mv=\lambda v\$ for each \$\lambda\$:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$&#xA;|M-\lambda I_3| =&#xA; (3-\lambda) \begin{vmatrix}&#xA;2 - \lambda &amp;amp; 0 \\&#xA;1 &amp;amp; 1 - \lambda &#xA;\end{vmatrix}&#xA;= (3-\lambda)(-(2-\lambda)(1-\lambda))\\&#xA;(\lambda-3)(-(2-\lambda)(1-\lambda)) = 0 \implies \lambda_1,\lambda_2,\lambda_3 = 3,2,1$$&#xA;This gives us a diagonal matrix \$M' = \begin{bmatrix}3&amp;amp;0&amp;amp;0\\0&amp;amp;2&amp;amp;0\\0&amp;amp;0&amp;amp;1\end{bmatrix}\$ &#xA;$$&#xA;\begin{bmatrix}&#xA;3 &amp;amp; 0 &amp;amp; 0 \\&#xA;1 &amp;amp; 2 &amp;amp; 0 \\&#xA;1 &amp;amp; 1 &amp;amp; 1 &#xA;\end{bmatrix}\begin{pmatrix}&#xA;a\\b\\c&#xA;\end{pmatrix} = \begin{pmatrix}3a\\a+2b\\a+b+c\end{pmatrix}\\&#xA;\lambda_1\begin{pmatrix}a\\b\\c\end{pmatrix}=\begin{pmatrix}3a\\3b\\3c\end{pmatrix}=\begin{pmatrix}3a\\a+2b\\a+b+c\end{pmatrix}\implies v_1=(1,1,1)\\&#xA;\lambda_2\begin{pmatrix}a\\b\\c\end{pmatrix}=\begin{pmatrix}2a\\2b\\2c\end{pmatrix}=\begin{pmatrix}3a\\a+2b\\a+b+c\end{pmatrix}\implies v_2=(0,1,1)\\&#xA;\lambda_3\begin{pmatrix}a\\b\\c\end{pmatrix}=\begin{pmatrix}a\\b\\c\end{pmatrix}=\begin{pmatrix}3a\\a+2b\\a+b+c\end{pmatrix}\implies v_3=(0,0,1)&#xA;$$&#xA;This gives us a basis \$B'=\{(1,1,1),(0,1,1),(0,0,1)\}\$ where the matrix \$M'\$ represents \$f(x)\$.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this basis, a vector that would be \$(5,6,7)\$ in \$B\$ is instead \$(5,1,1)\$, as shown here:&#xA;$$(5,1,1)_{B'} = 5(1,1,1)+1(0,1,1)+1(0,0,1) = (5,6,7)_B$$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This affects the transformation as well:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$&#xA;\begin{bmatrix}&#xA;3&amp;amp;0&amp;amp;0\\&#xA;1&amp;amp;2&amp;amp;0\\&#xA;1&amp;amp;1&amp;amp;1&#xA;\end{bmatrix}&#xA;\begin{pmatrix}&#xA;5\\6\\7&#xA;\end{pmatrix}&#xA;=\begin{pmatrix}&#xA;15+0+0\\&#xA;5+12+0\\&#xA;5+6+7&#xA;\end{pmatrix}&#xA;=(15,17,18)_B\\&#xA;\begin{bmatrix}&#xA;3&amp;amp;0&amp;amp;0\\&#xA;0&amp;amp;2&amp;amp;0\\&#xA;0&amp;amp;0&amp;amp;1&#xA;\end{bmatrix}&#xA;\begin{pmatrix}&#xA;5\\1\\1&#xA;\end{pmatrix}&#xA;=\begin{pmatrix}&#xA;15+0+0\\&#xA;0+2+0\\&#xA;0+0+1&#xA;\end{pmatrix}&#xA;=(15,2,1)_{B'}\\&#xA;(15,2,1)_{B'}=15(1,1,1)+2(0,1,1)+1(0,0,1)=(15,17,18)_B&#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Caveats&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Notice how when we were finding \$v_1\$ above we picked \$(1,1,1)\$ to simplify. Unfortunately \$v_1=(7,7,7)\$, \$v_2=(0,-3,-3)\$ (and infinitely many more) are also valid in this context.&lt;br&gt;&#xA;To make every solution uniform, we normalize each of the vectors:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$&#xA;v_1=\frac{(1,1,1)}{\sqrt{1^2+1^2+1^2}}=(\frac{1}{\sqrt{3}},\frac{1}{\sqrt{3}},\frac{1}{\sqrt{3}})\\&#xA;v_2=\frac{(0,1,1)}{\sqrt{1^2+1^2}}=(0,\frac{1}{\sqrt{2}},\frac{1}{\sqrt{2}})\\&#xA;v_3=\frac{(0,0,1)}{\sqrt{1^2}}=(0,0,1)&#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So we get a basis \$B'=\{(\frac{1}{\sqrt{3}},\frac{1}{\sqrt{3}},\frac{1}{\sqrt{3}}),(0,\frac{1}{\sqrt{2}},\frac{1}{\sqrt{2}}),(0,0,1)\}\$, which corresponds to:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$(5,1,1)_{B'} = 5(\frac{1}{\sqrt{3}},\frac{1}{\sqrt{3}},\frac{1}{\sqrt{3}})+1(0,\frac{1}{\sqrt{2}},\frac{1}{\sqrt{2}})+1(0,0,1)\\ = (\frac{5}{\sqrt{3}},\frac{1}{\sqrt{2}}+\frac{5}{\sqrt{3}},1+\frac{1}{\sqrt{2}}+\frac{5}{\sqrt{3}})_B$$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, we also add a restriction so that the first non-zero element of each eigenvector must be positive, flipping the signs of the rest of the vector if it was initially negative.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a function or program which takes a black-box function or program and either:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;outputs a function or program which accepts arguments in a special basis \$B'\$ as described above, performs the transformation on them, and returns the result in the standard basis \$B\$&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;outputs the result in \$B\$ directly and takes the secondary arguments in \$B'\$ itself&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You are given a function (via one of the standard IO methods applicable) taking a vector as input and returning another vector &lt;em&gt;in the same form, as the same data type&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Alternatively, you can take a program (via the name of an executable in the current working directory, or a process ID) which takes a vector as input through one of the standard input methods for programs, and outputs a vector in a whitespace-separated string.&lt;br&gt;&#xA;(The executable can be in a different language, so don't try to read it.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input and output vectors for this function or program are in \$\mathbb{R}^n\$ with basis \$B\$.&lt;br&gt;&#xA;You are also given a number specifying the size of the lists to be used (\$n\$ in \$\mathbb{R}^n\$).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you follow the second option you will additionally receive a vector in basis \$B'\$.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Otherwise, output a function taking a vector as input and returning another vector, where the function you output uses the standard IO methods for your language. Your submission may output this function as a literal function, function pointer, or as source code for such a function in your language. Instead of a function, you may output a whole program as source code or compiled binary, which takes a vector as input and returns another vector via the standard IO methods for your language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input and output vectors for this function or program are in \$\mathbb{R}^n\$.&lt;br&gt;&#xA;The input vectors have basis \$B'\$, and the output vectors have basis \$B\$.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you follow the second option then the above statement applies to your submission instead of the output, and you do not need to output a function nor a program but instead the specified vector.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Criteria&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the shortest code in bytes for each language, further subdivided by combination of function / program as input / submission / output, wins!&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;todo&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Notes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;While it's a bit math-y, there are multiple interesting routes to go for a solution to this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Transform \$B'\to B\$ and pass to the input function or program&lt;/li&gt;&#xA;&lt;li&gt;Follow the question closely and apply the transformation via \$M'\$&lt;/li&gt;&#xA;&lt;li&gt;More I won't disclose&lt;/li&gt;&#xA;&lt;li&gt;Probably more I haven't thought of&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="18730" LastEditorUserId="18730" LastEditDate="2018-07-26T05:12:13.347" LastActivityDate="2018-07-26T05:12:13.347" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16700" PostTypeId="1" CreationDate="2018-07-26T10:33:02.003" Score="1" ViewCount="71" Body="&lt;p&gt;Some maybe not-intended-to-program languages may have some extra limitations. Is it allowed to change it to solve a problem? If so, how the length go?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;p.s. marking this topic as duplicate of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/13593/&quot;&gt;this topic&lt;/a&gt; generally seems to allow an 0-byte solution loophole, for it's sometimes hard to define &quot;slightly&quot; and that's why I choose to count the changing byte count&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-07-27T00:37:37.590" LastActivityDate="2018-07-27T00:37:37.590" Title="Is a slightly changed compiler allowed?" Tags="|discussion|code-golf|" AnswerCount="0" CommentCount="8" ClosedDate="2018-07-28T16:53:45.217" ContentLicense="CC BY-SA 4.0" />
  <row Id="16702" PostTypeId="2" ParentId="2140" CreationDate="2018-07-27T20:28:30.777" Score="-2" Body="&lt;h1&gt;Golf a regex that matches syntactically valid programs in the language of your choice.&lt;/h1&gt;&#xA;&lt;p&gt;1:  Pick a programming language, &lt;em&gt;P&lt;/em&gt;, that meets these requirements:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;P&lt;/em&gt; is known to be Turing-Complete.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;P&lt;/em&gt; has a freely available and working compiler or interpreter.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;2:  Create a regular expression, &lt;em&gt;R&lt;/em&gt;, such that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;R&lt;/em&gt; matches any string that is a syntactically valid program of &lt;em&gt;P&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;R&lt;/em&gt; rejects any string that is a syntactically invalid program of &lt;em&gt;P&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;3: Golf &lt;em&gt;R&lt;/em&gt;. Shortest regex wins.&lt;/p&gt;&#xA;" OwnerUserId="69304" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-07-27T20:28:30.777" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16703" PostTypeId="2" ParentId="2140" CreationDate="2018-07-27T20:32:12.133" Score="1" Body="&lt;p&gt;Looking for feedback on my first question.&lt;/p&gt;&#xA;&lt;p&gt;Title: Largest Left-Truncatable Prime in Base &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; (A103443)&lt;/p&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;Numberphile recently posted a video about &lt;a href=&quot;https://www.youtube.com/watch?v=azL5ehbw_24&amp;amp;feature=youtu.be&quot; rel=&quot;nofollow noreferrer&quot;&gt;truncatable primes&lt;/a&gt;, and the concept seems like it would make a good base for a number of good code golf exercises. I explain the concepts below, but watch the video only if you want ideas about an algorithmic process for finding them.&lt;/p&gt;&#xA;&lt;p&gt;A left-truncatable prime in base &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; is a prime &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt; such that&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;all the digits of &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt; in base &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; are &lt;em&gt;nonzero&lt;/em&gt;, and&lt;/li&gt;&#xA;&lt;li&gt;when any number of leading digits of &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt; when written in base &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; are removed, the result is still a prime. (That is, every suffix of &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt; when written in base &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; is a prime, when still interpreted in base &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For example, &lt;span class=&quot;math-container&quot;&gt;\$1223\$&lt;/span&gt; is a left-truncatable prime in base &lt;span class=&quot;math-container&quot;&gt;\$10\$&lt;/span&gt;, since &lt;span class=&quot;math-container&quot;&gt;\$1223\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$223\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$23\$&lt;/span&gt;, and &lt;span class=&quot;math-container&quot;&gt;\$3\$&lt;/span&gt; are all prime; &lt;span class=&quot;math-container&quot;&gt;\$1223\$&lt;/span&gt; is also a left-truncatable prime in base &lt;span class=&quot;math-container&quot;&gt;\$4\$&lt;/span&gt;, since &lt;span class=&quot;math-container&quot;&gt;\$1223\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$223\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$23\$&lt;/span&gt;, and &lt;span class=&quot;math-container&quot;&gt;\$3\$&lt;/span&gt; are all prime when considered in base &lt;span class=&quot;math-container&quot;&gt;\$4\$&lt;/span&gt; (in base &lt;span class=&quot;math-container&quot;&gt;\$10\$&lt;/span&gt; they are &lt;span class=&quot;math-container&quot;&gt;\$107\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$43\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$11\$&lt;/span&gt;, and &lt;span class=&quot;math-container&quot;&gt;\$3\$&lt;/span&gt;, respectively). OEIS sequence &lt;a href=&quot;http://oeis.org/A024785&quot; rel=&quot;nofollow noreferrer&quot;&gt;A024785&lt;/a&gt; is a list of all left-truncatable primes in base &lt;span class=&quot;math-container&quot;&gt;\$10\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;There are many variants on this concept, but this is all you need for this challenge. This concept also appeared in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/89907/right-and-tfel-truncatable-primes&quot;&gt;this&lt;/a&gt; challenge from two years ago.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge is to find the largest left-truncatable prime in base &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt;. You can show (from &lt;a href=&quot;http://www.ams.org/journals/mcom/1977-31-137/S0025-5718-1977-0427213-2/S0025-5718-1977-0427213-2.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;this paper&lt;/a&gt; I believe) that there are only finitely many left-truncatable primes for a given base, so the largest one exists. Here it is &lt;em&gt;instrumental&lt;/em&gt; that we require these primes to have all nonzero digits; otherwise, there would be no largest one.&lt;/p&gt;&#xA;&lt;p&gt;For example, the largest left-truncatable prime in base &lt;span class=&quot;math-container&quot;&gt;\$10\$&lt;/span&gt; is 357686312646216567629137, as mentioned in the above video. These are found in &lt;a href=&quot;https://oeis.org/A103443&quot; rel=&quot;nofollow noreferrer&quot;&gt;A103443&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your program must input an integer &lt;span class=&quot;math-container&quot;&gt;\$b \geq 3\$&lt;/span&gt;, and output an integer written in base &lt;span class=&quot;math-container&quot;&gt;\$10\$&lt;/span&gt; which is the largest left-truncatable prime in base &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; (indeed, one must always exist as well). Your program/function should work for any input &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; your language supports.&lt;/p&gt;&#xA;&lt;p&gt;This is code-golf, so the shortest answer wins! No standard loopholes, but built-in primality testing is allowed.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;If your program fails because it would require integers that exceed your language's max integer, then state so in your solution; these solutions are still allowed, but solutions that aren't limited by the language's max integer are better. Alternatively, if you are restricted by a max integer, give the largest left-truncatable prime base &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; that is smaller than this max integer.&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;10&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;357686312646216567629137&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;See &lt;a href=&quot;https://oeis.org/A103443&quot; rel=&quot;nofollow noreferrer&quot;&gt;A103443&lt;/a&gt; for more test cases.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Remember that &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; is not a prime.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="81908" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-07-27T20:32:12.133" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16704" PostTypeId="1" CreationDate="2018-07-28T00:48:04.187" Score="2" ViewCount="48" Body="&lt;p&gt;For some languages with a static type system the compiler is able to infer the types, however sometimes there's ambiguity (even with input) unless the user gives the type manually:&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Motivation 1: Haskell&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Consider the following Haskell example:&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-hs prettyprint-override&quot;&gt;&lt;code&gt;f xs = do&#xA;  x &amp;lt;-randomRIO (toEnum 0, toEnum 1) -- random Enum-type&#xA;  return $ map (x==) xs              -- check for each input if it's equal&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now calling it with &lt;a href=&quot;https://tio.run/##LYy9CsIwFEb3@xTf0KGFKronbgqdhOomDoGmGMxPuUkgPn0M4nY4HM5Lxbe2tlbjtsAJt09M2u1n5ZfgiFaUCIklEFDEDvzz83RFn8LZZ4fDiD8dhxaxTpk9OvRFygGiO7UDkVPGt8/GxidIIbDicVE26vHOWT9r/QI&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;f [False,True]&lt;/code&gt;&lt;/a&gt; succeeds because the type-checker can tell the type of the input - namely &lt;code&gt;[Bool]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, calling it with an empty list &lt;a href=&quot;https://tio.run/##LYwxC8IwFAb39yu@oUMLKronbg5OQh3FIdAUg31JeXmF@OtjELfjOO7l8tsvS62B1ySK@yer58Po4pSYaEbJsJgSAcXsIT8/Xm/oNV3ixjju8KfT0CLxuklEh75YO8B053YgYhdi@6wSosIagxmPZ61f&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;f []&lt;/code&gt;&lt;/a&gt; won't work because the compiler has no idea what kind of list it is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now we could call it with &lt;a href=&quot;https://tio.run/##LYyxCsMgGAZ3n@IbMii0pV2Ddihk6FRIx5BBiKFS9Q9qwD69ldLtOI576fQ2ztVq/UYx4/lJ2fjTqMNCnrEVJUFhIQYUeUT8@fH@AM80hN3jfMCfLqJF0eQ9BnTgRSkB2V3bgTGvbWifLdqQoaTECj7N6HtMNyI3i1q/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;f ([] :: [Bool])&lt;/code&gt;&lt;/a&gt; explicitly giving the compiler the type and it would work. Or even worse (byte-wise) we could just give the function &lt;code&gt;f&lt;/code&gt; a type: &lt;a href=&quot;https://tio.run/##LYyxCoMwGIT3PMUNDgq12FUSh0KHTgU7ikPASEOT/JJEiE@fhuJ2x333fWT4KmNy1nYjH/E@QlT2Okq3kGVsRd9juhOZGe2A5@ssZUgBAgsxIPEW/n8YC1BHerjdorvgTLemQF7F3TtUqJMQDXg1FANjVmpXPJvXLkJwjhXTnPMP&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;f :: [Bool] -&amp;gt; IO [Bool]&lt;/code&gt;&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Motivation 2: Rust&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A similar scenario could cause troubles in Rust, consider:&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-rust prettyprint-override&quot;&gt;&lt;code&gt;let f = |l| { l };  // identity function&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Again calling it with &lt;a href=&quot;https://tio.run/##KyotLvn/Py1PITcxM09DU6GaS0EhJ7VEIU3BVqEmp0ahWiFHodaaCyhaUJSZV5KTp6ihVG1lX6uko5CmUZaarKhhaGCoqalpzVX7/z8A&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;f(vec!(101))&lt;/code&gt;&lt;/a&gt; won't cause any trouble.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However calling it with an empty vector &lt;a href=&quot;https://tio.run/##KyotLvn/Py1PITcxM09DU6GaS0EhJ7VEIU3BVqEmp0ahWiFHodaaCyhaUJSZV5KTp6ihVG1lX6uko5CmUZaarKihqalpzVX7/z8A&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;f(vec!())&lt;/code&gt;&lt;/a&gt; will error.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Again we could solve it by using a typed input:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-rust prettyprint-override&quot;&gt;&lt;code&gt;let v : Vec&amp;lt;i32&amp;gt; = Vec::new(); f(v)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##LYo7DoAgEAV7TvG0gsRKO/zdwt4YSEhwYxSxQM6OW9hNZua8r1CKJeyrI6mQBOBNgMWI179I8Mi9@G2ExmK2wXXtxAOj1mQeqXoejtNR8FTJOuk51w2sjIpLLuUD&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Rust – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or we give the closure a type: &lt;a href=&quot;https://tio.run/##Dcq9CoAgFAbQ3af4dFJoqk37eYv2EAXBJMxa1Ge/deaTn7sQ@YTzCEkqVAZEV@CxoEVo7M7OYRrXhoqIbtgfrhxSiYlLUfXWxQAvX2e5VEoZ1ok@&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;|l : Vec&amp;lt;i32&amp;gt;| { l };&lt;/code&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Often these issues arise with empty lists/vectors etc. - my questions are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Can we assume that the inputs carry a type (like &lt;code&gt;[] :: [Bool]&lt;/code&gt; or &lt;code&gt;let v : Vec&amp;lt;i32&amp;gt; = Vec::new()&lt;/code&gt; in the examples above?&lt;/li&gt;&#xA;&lt;li&gt;Can we assume that there is an implicit annotation (in case the challenge specifies sth. along the lines &quot;&lt;em&gt;given a list of integers&lt;/em&gt;&quot;)?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If none of these are answered with &lt;em&gt;yes&lt;/em&gt;, can we work out a system to count bytes for giving the input a type (eg. in Haskell this is shorter), so something like:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the function is &lt;a href=&quot;https://tio.run/##y0gszk7Nyfn/PzO3IL@oRCG4srgkNVcvKDEvJT@XK02hwlbDRsWuQlNPw9ZWE8gqAksEefprlOS75pXmKhjoQBmGmv9zEzPzFGwVCooy80oUbG1sFNIUNKJjrayinfLzc2I1/wMA&quot; rel=&quot;nofollow noreferrer&quot;&gt;67 bytes&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;annotating costs: &lt;code&gt;::[Bool]&lt;/code&gt; 8 bytes&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Total byte count is 65 bytes, or something else?&lt;/p&gt;&#xA;" OwnerUserId="48198" LastActivityDate="2018-07-28T00:48:04.187" Title="Can we assume typed inputs?" Tags="|discussion|" AnswerCount="0" CommentCount="0" ClosedDate="2018-07-28T01:02:55.037" ContentLicense="CC BY-SA 4.0" />
  <row Id="16705" PostTypeId="2" ParentId="2140" CreationDate="2018-07-28T08:40:00.717" Score="1" Body="&lt;h3&gt;Locate Substring&lt;/h3&gt;&#xA;&lt;p&gt;This is not a challenge yet, just a place to write down an idea.&lt;/p&gt;&#xA;&lt;p&gt;Given some finite binary string &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;, we can try to find the minimal length &lt;span class=&quot;math-container&quot;&gt;\$n \in \mathbb N\$&lt;/span&gt; such that we can uniquely locate each contiguous substring &lt;span class=&quot;math-container&quot;&gt;\$ T \$&lt;/span&gt; of &lt;span class=&quot;math-container&quot;&gt;\$ S \$&lt;/span&gt; that has length &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&lt;p&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$ S = 01000110 \$&lt;/span&gt;. Then surely &lt;span class=&quot;math-container&quot;&gt;\$ n &amp;gt; 1\$&lt;/span&gt;. But we also immediately see that &lt;span class=&quot;math-container&quot;&gt;\$ n &amp;gt; 2\$&lt;/span&gt; because for instance the substring &lt;span class=&quot;math-container&quot;&gt;\$T = 01\$&lt;/span&gt; appears twice in &lt;span class=&quot;math-container&quot;&gt;\$ S = \color{red}{01}00\color{red}{01}10\$&lt;/span&gt;. But all substrings of length &lt;span class=&quot;math-container&quot;&gt;\$ n=3 \$&lt;/span&gt; are distinct, these are in fact (in the order they apppear from left to right) &lt;span class=&quot;math-container&quot;&gt;\$ \{ 010, 100, 000, 001, 011, 110 \} \$&lt;/span&gt;. This means that &lt;span class=&quot;math-container&quot;&gt;\$ n=3 \$&lt;/span&gt; is minimal. [end of example]&lt;/p&gt;&#xA;&lt;p&gt;Alternatively given some &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; one might ask to find the longest sequence &lt;span class=&quot;math-container&quot;&gt;\$ S \$&lt;/span&gt; such that all substrings &lt;span class=&quot;math-container&quot;&gt;\$ T \$&lt;/span&gt; of length &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; are uniquely locatable.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-07-28T15:19:21.343" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16706" PostTypeId="1" CreationDate="2018-07-28T09:29:30.573" Score="1" ViewCount="196" Body="&lt;p&gt;Assume that the method of generating the hidden test-cases is known. (for example: a list of 5000 uniformly random integers in range [1..1000])&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Reasons why hidden test cases should be allowed (that I can think of):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Guaranteed to prevent hard-coding (assume that there are sufficiently many possible test-cases)&lt;/li&gt;&#xA;&lt;li&gt;It's already used in (some) existing challenges, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/169086/wheres-blackhat&quot;&gt;Where&amp;#39;s Blackhat?&lt;/a&gt; .&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Reasons why hidden test cases should not be allowed:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It makes the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/305/what-makes-winning-criteria-objective#1369&quot;&gt;winning condition objectivity&lt;/a&gt; more probabilistic.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;It does not completely contradict the answer linked above; however, as the answer poster can generate random test cases using the same method and then guess; it will still be correct most of the time.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Question:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it possible for a challenge to have hidden scoring test-cases?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If not, what should be done with the existing challenges with hidden scoring test-cases?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="69850" LastActivityDate="2018-08-01T07:56:02.550" Title="Is it possible for a challenge to have hidden scoring test-cases?" Tags="|discussion|" AnswerCount="4" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16707" PostTypeId="2" ParentId="16706" CreationDate="2018-07-28T09:59:47.183" Score="1" Body="&lt;p&gt;Challenges with hidden test cases should not be created. This is because&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The score reported by the challenge author cannot be independently verified.&lt;/li&gt;&#xA;&lt;li&gt;The challenge dies when the author stops responding.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;As an alternative (in the case where there is a specified random distribution for generating the test cases) I suggest generating test cases based on a random number generator seeded by a cryptographic hash of the solution. The non-invertibility of the hash function prevents the answerer from targeting the seed that generates the easiest answers (by adding comments, etc.). This would still allow such &quot;optimization&quot; opportunities by trying different strings through brute force (and I suggest the rules explicitly allow this), but if there are enough test cases it shouldn't go far.&lt;/p&gt;&#xA;" OwnerUserId="30688" LastEditorUserId="30688" LastEditDate="2018-07-30T00:33:19.553" LastActivityDate="2018-07-30T00:33:19.553" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16708" PostTypeId="2" ParentId="16706" CreationDate="2018-07-28T13:22:44.980" Score="2" Body="&lt;h1&gt;Yes, but they need to be made public after X time units&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In my opinion for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt; challenges this can be a sensible thing to do, however there are two important things that a challenge should do in such a case:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;they need to specify a time span (at least once some people are answering) for when they will choose the winner and by that time make the test cases public&lt;/li&gt;&#xA;&lt;li&gt;they need to make sure (eg. by providing a cryptographic hash of the test cases/seed to generate them) that the test cases were not chosen after writing the challenge, this is to make it &quot;impossible&quot; for them to adjust it to an answer they like&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Addressing issues mentioned above&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;1) It makes the winning condition objectivity more probabilistic&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If the method of generating hidden test cases is &lt;strong&gt;not&lt;/strong&gt; known, this might be true. However &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenges are the same. Since the conditions are the same for everyone, this won't cause any advantages/disadvantages for other people. And more importantly just because a challenge fulfils our criterions for being valid, it does not mean that it makes a good challenge:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my opinion a good &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt; challenge will have at least one example and some public test cases which reflect approximately what's being tested. The scoring could then be a mix between hidden and public tests or just the hidden ones.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;2) The score reported by the challenge author cannot be independently verified&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Once the test cases are public the score can be verified by everyone and providing a hash will make sure that they are indeed the original tests.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;3) The challenge dies when the author stops responding&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The first point is very similar to what we do on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; challenges where cops are required to post their solution after some time (usually 7 days), though probably a challenge should give more time than 7 days to solve it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I doubt that an OP of a challenge will just disappear before they chose a winner, we don't disallow &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; challenges because the cop could stop responding and we shouldn't disallow &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt; challenges for that reason. Of course it is a possibility but I don't think that this will create problems.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; For this answer I don't think it really matters whether there's a known method of generating the hidden test cases. If anything points &lt;strong&gt;(1)&lt;/strong&gt; and &lt;strong&gt;(3)&lt;/strong&gt; won't cause troubles since people can generate tests themselves to get an approximative score and if an author stops responding the community could come up with new tests (which probably will never happen).&lt;/p&gt;&#xA;" OwnerUserId="48198" LastActivityDate="2018-07-28T13:22:44.980" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16711" PostTypeId="2" ParentId="16694" CreationDate="2018-07-29T18:14:42.590" Score="12" Body="&lt;h1&gt;Lambda expressions and anonymous functions in general can require the syntax around them to adapt&lt;/h1&gt;&#xA;&lt;p&gt;TLDR: Expressions can differ a lot in what kind of places in a program they can syntactically fit into, and lambda expressions and especially anonymous functions in general are no different, comments or no comments. As long as there's a reasonable way to adopt the surrounding code, this should not be a reason for disqualification.&lt;/p&gt;&#xA;&lt;p&gt;Hopefully no one would accuse &lt;code&gt;x+1&lt;/code&gt; of not being a valid arithmetic expression in most mainstream languages. But you still cannot just put it everywhere without adjusting the syntax of what's around it. &lt;code&gt;x+1*y&lt;/code&gt; doesn't work, you have to put parentheses: &lt;code&gt;(x+1)*y&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I don't see requiring parentheses as essentially different from requiring a newline, or comments as essentially different from anything else that forces the syntax around to adapt.&lt;/p&gt;&#xA;&lt;p&gt;In functional languages like Haskell, that commonly use operators on functions, this isn't even theoretical for anonymous functions: Each of the following ways of defining a palindrome test has different ways in which it cannot fit into just any surrounding syntax. First, a lambda:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;\s -&amp;gt; s == reverse s&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You need parentheses if you want to compose it with operators to its right: &lt;code&gt;(\s -&amp;gt; s == reverse s) . takeWhile (/= ' ')&lt;/code&gt;. But not to its left: &lt;code&gt;not . \s -&amp;gt; s == reverse s&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Secondly, a golfed palindrome test:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(==)=&amp;lt;&amp;lt;reverse&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You need parentheses to compose it with a higher precedence operator: &lt;code&gt;((==)=&amp;lt;&amp;lt;reverse)&amp;lt;$&amp;gt;[&amp;quot;a&amp;quot;,&amp;quot;hi&amp;quot;,&amp;quot;bob&amp;quot;]&lt;/code&gt;, but not with a lower one: &lt;code&gt;(==)=&amp;lt;&amp;lt;reverse$&amp;quot;panama&amp;quot;&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Thirdly, one with &lt;code&gt;do&lt;/code&gt; notation (admittedly a bit silly for this particular use, but I wanted to show how newlines also matter without comments):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;do x &amp;lt;- reverse&#xA;   (==) x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;now you still need something, but you can use a newline and reduced indentation:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;do x &amp;lt;- reverse&#xA;   (==) x&#xA;  $ &amp;quot;madam&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##bY/BCoMwDIbve4qfItiCbi/Q@gY77@BkRCxYtFVaGb59p64eBsshJOH/8ic9hUGPY4yWjIOCpfn@wuyNW1BfsAXnz4CyQoBS8PqtfdAIAlcsNOhHb0YNflPIkQsBZqkjC5Nb7AVD8V3ipmUj/m@qGbECrDd7bqeWNYmaPPjmr5RQUiZAyKw6gEOf5OK0@ZFmbCZHls4jugkrZHlaH7MEYU1dlj5gaGL8AA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Haskell – Try It Online&quot;&gt;Try them online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In other languages, like Python, using operators to build anonymous functions may not be idiomatic, but it's still possible:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;class T:&#xA;    def __add__(x,y): return lambda z: y(z)&#xA;&#xA;print (T()+(lambda x:x+1))(42)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##LcmxCoAgEADQ3a@48Q5bkia/w10sjQIzUQP1562ht77YynEHMcbmTc6gJIOPdTtobazVGuvUSEJy5UkBvLlWa6BLaNiJsZjOUAAVEsf/qqx8JsJF0Bgv&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 2 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66041" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-07-29T18:14:42.590" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16712" PostTypeId="1" AcceptedAnswerId="16713" CreationDate="2018-07-29T22:31:05.670" Score="1" ViewCount="228" Body="&lt;p&gt;I'm using javascript as a golfing language. I've just noticed that the number of characters used in a program may differ from the number of bytes that program takes (due to text encoding&lt;sup&gt;?&lt;/sup&gt;). For example, TIO says that the number of characters in &lt;a href=&quot;https://codegolf.stackexchange.com/a/169505/81748&quot;&gt;this answer&lt;/a&gt; is &lt;strong&gt;101&lt;/strong&gt; whereas the number of bytes is &lt;strong&gt;116&lt;/strong&gt;. I'm fairly new to code golfing so I don't know what to do in this case. Should I just include the number of bytes and ignore the number of characters? Or should I include both?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Including both seems reasonable to me as it shows both how short and light a program is.&lt;/p&gt;&#xA;" OwnerUserId="81748" LastActivityDate="2018-09-15T15:49:53.087" Title="Include characters or just bytes?" Tags="|discussion|code-golf|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16713" PostTypeId="2" ParentId="16712" CreationDate="2018-07-29T23:06:40.087" Score="7" Body="&lt;p&gt;The standard for most &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges on this site is to measure code in bytes, so the length of the code in bytes should be included in the answer. Any other metrics are unnecessary, but not forbidden, so feel free to include them if you think they are relevant or interesting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The answer you linked has more bytes than characters because it is encoded in &lt;a href=&quot;https://en.wikipedia.org/wiki/UTF-8&quot; rel=&quot;nofollow noreferrer&quot;&gt;UTF-8&lt;/a&gt;, which uses between one and four bytes per character, due to the need to encode more than 256 characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You might also find this helpful: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10145/45941&quot;&gt;How to count bytes FAQ&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2018-07-29T23:06:40.087" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16714" PostTypeId="2" ParentId="16706" CreationDate="2018-07-30T10:18:16.587" Score="2" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Reasons why hidden test cases should be allowed (that I can think of):&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Guaranteed to prevent hard-coding (assume that there are sufficiently many possible test-cases)&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If there are thousands of test cases (as you suggest earlier in the question) then making them public will not make hard-coding a competitive approach, so I don't see any value to this argument.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;It's already used in (some) existing challenges, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/169086/wheres-blackhat&quot;&gt;Where&amp;#39;s Blackhat?&lt;/a&gt; .&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&quot;It's already been done&quot; is a terrible argument: see &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;. What matters is whether it's a &lt;em&gt;good&lt;/em&gt; criterion, not whether it's been done before.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The biggest reason that I see for disallowing private test cases is that I can't tell whether a small tweak I make will make the score better or worse. With &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; I can at least run my own simulations on equal terms with the OP and decide which version to post. With hidden scoring the only competitive option is to post multiple answers with tiny differences, which annoys everyone involved (me, OP, and third parties).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In short, hidden test cases create the wrong incentives for answerers.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-07-30T10:18:16.587" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="16716" PostTypeId="2" ParentId="2140" CreationDate="2018-07-30T23:23:31.393" Score="-4" Body="&lt;p&gt;Once, I thought of this. Rules:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1: You must make a fractal that looks like the specified thing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2: One thing per round.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;3: Algorithms are rated by two scores: Resemblance and Compactness. The one that gets the highest scores wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;4: Only I can tell what thing must be made.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;5: Only one entry per user. Do not plagiarize.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;6: One may code in anything they wish.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;7: Have fun!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Round 1: Squidward's head!&lt;/p&gt;&#xA;" OwnerUserId="81961" LastEditorUserId="81961" LastEditDate="2018-07-31T00:15:24.970" LastActivityDate="2018-07-31T00:15:24.970" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="16721" PostTypeId="2" ParentId="2140" CreationDate="2018-07-31T20:14:35.443" Score="1" Body="&lt;h2&gt;Order times fully written out in English, alphabetically&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A 12h format time of day can be &lt;em&gt;fully written out in English&lt;/em&gt; according to the following rules:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;a word from &lt;code&gt;one&lt;/code&gt; to &lt;code&gt;twelve&lt;/code&gt;;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;a space;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;optionally a word from &lt;code&gt;one&lt;/code&gt; to &lt;code&gt;fifty-nine&lt;/code&gt; followed by a space;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;the &quot;word&quot; &lt;code&gt;AM&lt;/code&gt; or &lt;code&gt;PM&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 1:31 AM  =&amp;gt; &quot;one thirty-one AM&quot;&#xA;11:12 PM  =&amp;gt; &quot;eleven twelve PM&quot;&#xA; 4:00 AM  =&amp;gt; &quot;four AM&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The challenge is to take a list of 12h format times and order them alphabetically by the way they are &lt;em&gt;fully written out in English&lt;/em&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input and output format is flexible. Output can either be the times themselves or their &lt;em&gt;fully written out in English&lt;/em&gt; versions. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. Shortest in bytes for each language wins. Standard loopholes forbidden.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[ &quot;1:31 AM&quot;, &quot;11:12 PM&quot;, &quot;4:00 AM&quot; ]   =&amp;gt;   [ &quot;11:12 PM&quot;, &quot;4:00 AM&quot;, &quot;1:31 AM&quot; ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;More test cases can be added if there is interest. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;I'm mainly concerned this might be a dupe. I couldn't find one.&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="79980" LastActivityDate="2018-07-31T20:14:35.443" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16723" PostTypeId="1" AcceptedAnswerId="16724" CreationDate="2018-07-31T22:52:19.903" Score="6" ViewCount="141" Body="&lt;p&gt;I'll use &lt;a href=&quot;https://codegolf.stackexchange.com/questions/169343/implementing-a-stack#169433&quot;&gt;this&lt;/a&gt; challenge as an example. It says &quot;Input will be a list of [...]&quot; and I would like to code that challenge in Lua.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem here is, &lt;strong&gt;Lua doesn't accept lists as input&lt;/strong&gt;, only strings (and maybe numbers since it has implicit coercion). There are two solutions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;I can write the list as a string and deserialize it&lt;/strong&gt; no problem, &lt;strong&gt;but should I count this process in my byte count?&lt;/strong&gt; Or there would be no problem in deserializing and passing it to the function/rest of the program as a list (we call lists 'tables' in Lua)?&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;I can pass each element on the list as different arguments&lt;/strong&gt;, because then Lua would let me create a list (table) from these arguments.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I hope my question is clear. If there's already an answer for that I'm sorry, but I couldn't find.&lt;/p&gt;&#xA;" OwnerUserId="81774" LastActivityDate="2018-08-01T00:57:04.127" Title="When the input is a list and the language doesn't support that: what to do?" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16724" PostTypeId="2" ParentId="16723" CreationDate="2018-08-01T00:57:04.127" Score="8" Body="&lt;h2&gt;Take input through any reasonable format, as allowed by the challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Lua is far from the only language with this problem; many langs only give access to STDIN and arguments as raw strings, not doing any parsing at all. Some methods of inputting an array include:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Putting each item on its own line.&lt;/li&gt;&#xA;&lt;li&gt;Formatting the list in array syntax and using &lt;code&gt;eval&lt;/code&gt; or similar.&lt;/li&gt;&#xA;&lt;li&gt;Asking for one item at a time, with a &lt;a href=&quot;https://en.wikipedia.org/wiki/Sentinel_value&quot; rel=&quot;nofollow noreferrer&quot;&gt;sentinal value&lt;/a&gt; such as the empty string to mark end of input.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I don't know that I've seen an answer taking each item as a separate argument, but it seems fairly similar to the last option, and I would consider it a reasonable method. You'll need to watch out for challenges with stricter input requirements, however.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, parsing the input is part of the fundamental challenge of golfing&amp;mdash;take the input you're given and apply transformations to it to give the desired output, all with as little code as possible. No bytes need to be taken off an answer just because the language has an inconvenient input system; in some esoteric languages, such as &lt;a href=&quot;https://esolangs.org/wiki/Brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brainf***&lt;/a&gt;, this can be half the challenge.&lt;/p&gt;&#xA;" OwnerUserId="42545" LastActivityDate="2018-08-01T00:57:04.127" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16725" PostTypeId="2" ParentId="2140" CreationDate="2018-08-01T06:45:07.050" Score="2" Body="&lt;h1&gt;DRAW me a picture: A QBasic metagolf challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary-matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary-matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;binary-matrix&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;DRAW&lt;/code&gt; command in QBasic takes a string argument, consisting of instructions for moving the cursor and drawing line segments, and produces the appropriate line segments on the screen. The syntax of the instructions is very terse--perfect for a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt; challenge!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program or function which:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Given a 2-D array of on and off pixels, representing a black-and-white image,&lt;/li&gt;&#xA;&lt;li&gt;Generates a string that, when passed to QBasic's &lt;code&gt;DRAW&lt;/code&gt; command, will draw that image on the screen,&lt;/li&gt;&#xA;&lt;li&gt;While keeping the generated string as short as possible.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;More about &lt;code&gt;DRAW&lt;/code&gt;&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your program may use the following &lt;code&gt;DRAW&lt;/code&gt; instructions:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(more details pending)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;U&lt;/code&gt; - draw line upwards&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;D&lt;/code&gt; - draw line downwards&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;L&lt;/code&gt; - draw line to the left&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;R&lt;/code&gt; - draw line to the right&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;E&lt;/code&gt; - draw line diagonally up and to the right&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;F&lt;/code&gt; - draw line diagonally down and to the right&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;G&lt;/code&gt; - draw line diagonally down and to the left&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;H&lt;/code&gt; - draw line diagonally up and to the left&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;B&lt;/code&gt; - meta-instruction: prepend to any instruction to move the cursor accordingly but not draw the line&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;N&lt;/code&gt; - meta-instruction: prepend to any instruction to draw the line but not move the cursor&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(examples + pictures pending)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following instructions are outside the scope of this challenge and may &lt;strong&gt;not&lt;/strong&gt; be used (even if they would improve your score): &lt;code&gt;C&lt;/code&gt;, &lt;code&gt;P&lt;/code&gt;, &lt;code&gt;S&lt;/code&gt;, &lt;code&gt;M&lt;/code&gt;, &lt;code&gt;X&lt;/code&gt;, &lt;code&gt;A&lt;/code&gt;, and &lt;code&gt;TA&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output requirements&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Conceptually, your program's output will be substituted for the &lt;code&gt;...&lt;/code&gt; in the following QBasic program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;SCREEN 9        ' Graphics mode, 640 x 350 pixels&#xA;DRAW &quot;B M 0,0&quot;  ' Set drawing cursor to top left corner&#xA;DRAW &quot;...&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(If the length of your output exceeds any limits on line or string literal length, it may be split across multiple &lt;code&gt;DRAW&lt;/code&gt; commands in such a way that the instructions are preserved.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program will then be run, and the output image compared to your program's input. Where the input array has a 1, the output image must have a white pixel; where the input array has a 0, the output image must have a black pixel. The portion of the screen outside the input array's dimensions must be entirely black pixels.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Practically speaking, I will probably write a verification script in some other language, just to make testing easier.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Standard I/O methods apply. Output is case-insensitive. Input array dimensions will not exceed 640 x 350. &lt;em&gt;(more rules pending)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(test cases pending)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your submission's score is the sum of the lengths of its outputs on these test cases. In the case of a tie, the earlier submission wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note: this challenge is probably a variation on the &lt;a href=&quot;https://en.wikipedia.org/wiki/Travelling_salesman_problem&quot; rel=&quot;nofollow noreferrer&quot;&gt;Traveling Salesman Problem&lt;/a&gt;, meaning that an optimal solution will take exponential time. In order to receive a score, your submission must complete all test cases, which means that you'll need to take a sub-optimal approach.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Sandbox questions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What's a good number of test cases?&lt;/li&gt;&#xA;&lt;li&gt;Should I instead score submissions on a second, hidden set of test cases to prevent overfitting? Or should the hidden test cases be the (first) tiebreaker?&lt;/li&gt;&#xA;&lt;li&gt;Is the implicit requirement &quot;must complete all test cases before you can post it&quot; enough of a bound on long execution times, or should I add a specific execution-time limit?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="16766" LastEditDate="2018-08-02T17:10:05.933" LastActivityDate="2018-08-02T17:10:05.933" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16726" PostTypeId="2" ParentId="16706" CreationDate="2018-08-01T07:56:02.550" Score="1" Body="&lt;h1&gt;Provide a training set, a validation set, and hide the test set&lt;/h1&gt;&#xA;&lt;p&gt;Most challenges that have had hidden test cases are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;  challenges that involve some kind of pattern matching algorithms (such as those image recognition challenges).&lt;/p&gt;&#xA;&lt;p&gt;These challenges are typically solvable using maching learning techniques. With such approaches, it is pretty much always possible to optimize them such that they perform flawlessly on a dataset (even with thousands of elements), if the whole dataset is known. Therefore, for most challenges, scoring on the number of accurate recognition on the given dataset would be meaningless, as everyone could just optimize their answer for it.&lt;/p&gt;&#xA;&lt;p&gt;Moreover, this kind of ruins the purpose of such challenges where it is expected that answerers provide models that should generalize well to any never seen input data.&lt;/p&gt;&#xA;&lt;p&gt;As such, the simplest solution is to provide three datasets of test cases, in much the same way machine learning algorithms are evaluated in scientific literature:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A training set, visible to all, that contains a representative number of examples.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A validation set, visible to all, that people can use to see if their answer generalizes well on unseen data, after designing it using the training set.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A test set, only known to the creator of the challenge, that they use to score each answer.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;That way, answerers cannot optimize their programs for the test set.&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-08-01T07:56:02.550" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16729" PostTypeId="1" CreationDate="2018-08-01T22:12:25.793" Score="12" ViewCount="661" Body="&lt;p&gt;In accordance with our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14645/41024&quot;&gt;meta agreement&lt;/a&gt; to have a Language of the Month, and since the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14737/41024&quot;&gt;list of nominations&lt;/a&gt; had a single highest-voted entry at the beginning of August, we have a new featured language! Throughout August 2018, our Language of the Month, nominated by myself, will be:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;&lt;a href=&quot;https://soulsphere.org/hacks/smbf/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Self-modifying Brainfuck&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h3&gt;What's a Language of the Month?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;See the meta posts linked above. In short, during August, those who wish to participate should learn (at least the basics of) SMBF, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Information about SMBF&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Self-modifying Brainfuck, or SMBF, is an interesting variant of the well-knows brainfuck language. The commands are the same, but the tape is not. It contains the source code when the program starts. Instead of one, it has two pointers, a data pointer with an &quot;origin point&quot; being the cell exactly to the right of the last byte of the source code, and an instruction pointer, which starts at the leftmost byte of the source code. The tape can actually be considered in different ways. Here are a couple of examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;As in the official implementation: Execution ends when the origin point is reached by the IP, and the IP can't go to the left of the leftmost byte of the original source code. Source code cannot be added to the left or right sides, but can be modified in-place while the program is running.&lt;/li&gt;&#xA;&lt;li&gt;As in &lt;a href=&quot;https://ideone.com/L2byRe&quot; rel=&quot;nofollow noreferrer&quot;&gt;mbomb007's Python 3 implementation&lt;/a&gt;: Execution ends when the IP reaches an unmodified cell. Source code can be added to both the left and right sides. This implementation defines &lt;code&gt;0&lt;/code&gt; as the EOF value, however mbomb007 has made &lt;a href=&quot;https://ideone.com/YSLNXM&quot; rel=&quot;nofollow noreferrer&quot;&gt;a version which defines it as &quot;no change&quot;&lt;/a&gt;, as well as &lt;a href=&quot;https://ideone.com/kJAv5z&quot; rel=&quot;nofollow noreferrer&quot;&gt;one defining it as &lt;code&gt;-1&lt;/code&gt;&lt;/a&gt; (i.e. &lt;code&gt;255&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Documentation&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Sufficient documentation can be found at &lt;a href=&quot;https://esolangs.org/wiki/Self-modifying_Brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;SMBF's esolangs page&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want to ping somebody, you can either ping &lt;a href=&quot;https://chat.stackexchange.com/users/80316/erik-the-outgolfer&quot;&gt;@EriktheOutgolfer&lt;/a&gt; (me) or &lt;a href=&quot;https://chat.stackexchange.com/users/138114/mbomb007&quot;&gt;@mbomb007&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Interpreter&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You can download the official Ruby and C implementations from the homepage, and mbomb007's Python interpreter from ideone. Both are linked above. There is also an interpreter over &lt;a href=&quot;https://tio.run#smbf&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it Online!&lt;/a&gt;, but beware that inserting null bytes isn't at all easy.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;https://tio.run/##K85NSvv/3yZazyaWQTE9LzMtJz9dobKgINHj/38A&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;&amp;lt;[.&amp;lt;]&amp;#0;!gniflog yppaH&lt;/code&gt;&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="12012" LastEditDate="2018-08-31T13:07:08.100" LastActivityDate="2018-08-31T13:07:08.100" Title="Language of the Month for August 2018: Self-modifying Brainfuck" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16731" PostTypeId="2" ParentId="14737" CreationDate="2018-08-02T04:31:40.360" Score="6" Body="&lt;h1&gt;Attache&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/#Attache&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt; ~ &lt;a href=&quot;https://conorobrien-foxx.github.io/Attache/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Documentation&lt;/a&gt; ~ &lt;a href=&quot;https://conorobrien-foxx.github.io/Attache/tutorial/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;In-progress tutorial&lt;/a&gt; ~ &lt;a href=&quot;https://chat.stackexchange.com/rooms/81030/attache&quot;&gt;Chat room&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Attache is a practical language most similar to Mathematica in terms of basic syntax, but features much terser syntactic elements and enables practical, easy, functional programming. (No, purists, it's not state free.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why would this be a good language of the month? If for no other reason than to give it exposure, Attache is a favorite tool of mine for completing high-level tasks within a reasonable time frame. It features a plethora of built-in functions (perhaps not rivaling Mathematica) which minimize boilerplates in programming. It is actively developed (yours truly), and I'm open to suggestions regarding the language and its functions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Attache features many function-oriented operators and functions, which makes fixpoint programming realistic and fun to golf with. Some of the fun in golfing is figuring out whether tacit or fixpoint programs will be shorter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While the language isn't entirely bug-free, it's at a point in development where such bugs are rarely encountered in conventional programming and golfing, and the language isn't liable to change drastically.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;em&gt;(also the language has like one consistent user and it's lonely)&lt;/em&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2018-08-02T04:31:40.360" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16732" PostTypeId="2" ParentId="16729" CreationDate="2018-08-02T12:07:37.710" Score="2" Body="&lt;h1&gt;List of &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=created%3A2018-08-01..2018-08-31+%22%23+self-modifying+brainfuck%22+is%3Aa&quot;&gt;all Self-modifying Brainfuck solutions posted&lt;/a&gt; in August&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/170151&quot;&gt;Generate a deck of cards&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/34718&quot;&gt;mbomb007&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/170273&quot;&gt;Hast Thou Slain the Jabberwock?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/48198&quot;&gt;BMO&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/170311&quot;&gt;Make a Geiger Counter&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/69850&quot;&gt;user202729&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/170325&quot;&gt;Make a Geiger Counter&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/76162&quot;&gt;Jo King&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/171176/16766&quot;&gt;Without using numbers, get the highest salary you can. But don't exaggerate!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/69850&quot;&gt;user202729&lt;/a&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; [&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;List of all Self-modifying Brainfuck-related challenges posted in August&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/q/&amp;lt;question-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-08-28T20:21:04.170" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16733" PostTypeId="2" ParentId="2140" CreationDate="2018-08-03T03:21:58.307" Score="0" Body="&lt;h1&gt;Encoding nested tuples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Tags:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/set-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;set-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;set-theory&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary-tree&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary-tree&amp;#39;&quot; rel=&quot;tag&quot;&gt;binary-tree&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Related:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/119994/decode-the-void&quot;&gt;this&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Working on my recent esolang &lt;a href=&quot;https://esolangs.org/wiki/Mu6&quot; rel=&quot;nofollow noreferrer&quot;&gt;μ6&lt;/a&gt; I found myself a neat puzzle: Given the set of all natual numbers and the set of all nested tuples over the natural numbers, find a bijection between those two sets.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A nested tuple \$t \in T\$ is recursively defined, it is one of the two:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;an natural (\$\ n \in \mathbb{N}_0\ \$) number itself: \$\;t = n\$&lt;/li&gt;&#xA;&lt;li&gt;a tuple of two nested tuples (\$\ t_l,t_r \in T\ \$): \$\;t = (t_l,t_r)\$&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If it helps you can think of a nested tuple as a binary tree that has only values in its leaves.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to define two programs/functions, let's call them \$\ E\ \$ (encode) and \$\ D\ \$ (decode) which are each others inverses:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given any natural number \$n \in \mathbb{N}_0\$ the output \$E(n)\$ is a unique element of \$\ T\$ and \$\ D(E(n)) = n\$.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given any nested tuple \$\ t \in T\$ the output \$\ D(t)\$ is a unique element of \$\ \mathbb{N}_0\$ and \$\ E(D(t)) = t\$.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Inputs to the two programs/functions can be&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;an integer or a string representation thereof for \$\ E\$&lt;/li&gt;&#xA;&lt;li&gt;a nested tuple/list, custom data-type&lt;sup&gt;1&lt;/sup&gt; for \$\ D\$&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Outputs can either be of the same type as the input of the inverse function/program or printed to &lt;em&gt;stdout&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Since you're free to implement any bijection, it's difficult to give meaningful test cases. These are just a few examples using &lt;a href=&quot;https://github.com/bforte/mu6/blob/b881c56a85d439c1e9f17ee791448dc89e220c73/src/Eval.hs#L81&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; encoding-function and &lt;a href=&quot;https://github.com/bforte/mu6/blob/b881c56a85d439c1e9f17ee791448dc89e220c73/src/Eval.hs#L72&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; decoding-function:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 &amp;lt;-&amp;gt; 0&#xA;1 &amp;lt;-&amp;gt; (0,0)&#xA;3 &amp;lt;-&amp;gt; ((0,0),0)&#xA;20415 &amp;lt;-&amp;gt; ((1,0),(1,2))&#xA;55340232221111877631 &amp;lt;-&amp;gt; ((0,(1,0)),(2,1))&#xA;1000000000000000000000000 &amp;lt;-&amp;gt; 500000000000000000000000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1: For example if your language doesn't support nested tuples/lists, you don't need to count its definition towards your byte count. As an example a Haskell submission could assume &lt;code&gt;data T = El Integer | Nest T T&lt;/code&gt;.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Anything unclear?&lt;/li&gt;&#xA;&lt;li&gt;Is this maybe too much to ask in a code-golf?&lt;/li&gt;&#xA;&lt;li&gt;I could &quot;simplify&quot; it by asking for two \$\ E_k \$ and \$\ D_k \$ which would for all inputs \$ k \$ map \$\ \mathbb{N_0} \leftrightarrow \mathbb{N_0}^k\ \$..&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="48198" LastActivityDate="2018-08-03T03:21:58.307" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16736" PostTypeId="1" CreationDate="2018-08-03T17:56:25.130" Score="28" ViewCount="3883" Body="&lt;p&gt;We are rolling out the new &amp;quot;stock theme&amp;quot; to the Stack Exchange network. You all are the lucky first site to get the new theme. It is now live.&lt;/p&gt;&#xA;&lt;h2&gt;What new theme?&lt;/h2&gt;&#xA;&lt;p&gt;If you're like, &amp;quot;What the heck are you talking about?&amp;quot;, then you should read the Meta Stack Exchange post entitled &lt;a href=&quot;https://meta.stackexchange.com/questions/312365/rollout-of-new-network-site-themes&quot;&gt;Rollout of new network site themes&lt;/a&gt;  (and maybe the posts it links to for the full background).&lt;/p&gt;&#xA;&lt;h2&gt;How does Code Golf get its own custom theme?&lt;/h2&gt;&#xA;&lt;p&gt;One of the goals of this project is to make customizing sites easier so that all sites can have a personalized look (within limits). First we need to convert all current sites to the new unified theme format. Once that is done we will announce the timing and process to roll out personalized themes to sites using the stock theme. We are hopeful this will happen later this year.&lt;/p&gt;&#xA;&lt;h2&gt;Your help needed&lt;/h2&gt;&#xA;&lt;p&gt;Please help us look for issues/bugs. This theme will ultimately be rolled out to 100+ sites. So, it is important to do this trial to make sure things are working well. Please post any issues you see as answers below.&lt;/p&gt;&#xA;" OwnerUserId="75523" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-10-25T20:54:50.800" Title="New &quot;stock theme&quot; roll out" Tags="|discussion|user-interface|site-design|" AnswerCount="24" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="16737" PostTypeId="2" ParentId="16736" CreationDate="2018-08-03T19:29:58.353" Score="26" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt; &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Scrollbars appear to the right of Mathjax &lt;code&gt;$$&lt;/code&gt;-style blocks&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/3e52c.png&quot; alt=&quot;Scrollbar next to Mathjax block&quot;&gt;&lt;br&gt;&#xA;&lt;sup&gt;Image taken from &lt;a href=&quot;https://codegolf.stackexchange.com/q/169919/41024&quot;&gt;How much is my dice matrix worth?&lt;/a&gt;.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/HvQ81.png&quot; alt=&quot;DJMcMayhem&amp;#39;s worse situation&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;Image taken from &lt;a href=&quot;https://codegolf.stackexchange.com/a/74372/41024&quot;&gt;Calculate the number of primes up to n&lt;/a&gt; and provided by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31716/djmcmayhem&quot;&gt;DJMcMayhem&lt;/a&gt;.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This happens at least on the Chrome browser for Windows.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="82069" LastEditDate="2018-08-10T19:20:26.463" LastActivityDate="2018-08-10T19:20:26.463" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="16738" PostTypeId="2" ParentId="16736" CreationDate="2018-08-03T19:45:09.227" Score="59" Body="&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Voting colors on main site very difficult to distinguish&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I have extremely light-sensitive eyes, to the point that I sometimes even need to wear sunglasses indoors. As a result, I have my monitor brightness set to absolute minimum. On this setting, it's &lt;em&gt;extremely&lt;/em&gt; difficult to distinguish between &quot;voted on this&quot; vs &quot;not voted on this.&quot; The two colors are almost the same.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Raising the brightness (to an uncomfortable level), I can see that the &quot;activated&quot; vote button is a slightly blue-ish shade of grey compared to the unactivated vote button, but the difference is negligible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can this be updated to present a bit more contrast between the two states, like is done on the Meta design?&lt;/p&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="75523" LastEditDate="2018-08-13T16:41:35.207" LastActivityDate="2018-08-13T16:41:35.207" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="16739" PostTypeId="2" ParentId="16736" CreationDate="2018-08-03T19:58:18.760" Score="29" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;The box to enter a comment has a red border&lt;/h2&gt;&#xA;&lt;p&gt;Screenshot from meta:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ZGAbv.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZGAbv.png&quot; alt=&quot;Red border image taken from Meta&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This makes me feel like I'm doing something wrong. I think the blue highlight is enough, similar to how it looks when editing an answer.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-08-10T16:36:50.480" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16740" PostTypeId="2" ParentId="16736" CreationDate="2018-08-03T20:16:15.193" Score="16" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt; &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Meta site colors low contrast&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/AuOaA.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/AuOaA.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The meta label on the meta site has &lt;a href=&quot;https://webaim.org/resources/contrastchecker/?fcolor=9DA0A1&amp;amp;bcolor=EFF0F1&quot; rel=&quot;nofollow noreferrer&quot;&gt;very low contrast&lt;/a&gt; which makes it difficult to read in glare or for those who have harder time seeing low-contrast text. Also it feels unnatural with &quot;meta&quot; being so close to the other text, not sure if by design but 16px seems to make everything feel more natural.&lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="82069" LastEditDate="2018-08-10T16:41:47.677" LastActivityDate="2018-08-10T16:41:47.677" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16741" PostTypeId="2" ParentId="16736" CreationDate="2018-08-03T20:18:46.457" Score="14" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;/questions/tagged/status-planned&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-planned&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-planned&lt;/a&gt; we are working on updating all the right side bar elements to use Stacks, our new design system&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Inconsistent shadows on yellow boxes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This yellow-box has a shadow &amp;amp; radius on the &quot;Write Question&quot; page:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/QNxJ7.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/QNxJ7.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;however a similar yellow box does not:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/qm3Iq.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/qm3Iq.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;this feels awkward when navigating between the pages as the two similar elements have different styles.&lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="75523" LastEditDate="2018-08-08T00:02:51.237" LastActivityDate="2018-08-08T00:02:51.237" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16742" PostTypeId="2" ParentId="16736" CreationDate="2018-08-03T20:42:51.710" Score="6" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-declined&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-declined&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-declined&lt;/a&gt; Fixing existing MathJax issues is out of scope for the themes work.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;MathJax delimiters and linefeeds issue&lt;/h1&gt;&#xA;&lt;p&gt;I'm not sure whether this bug was introduced with the new version, but I noticed that adding linefeeds after or before MathJax delimiters breaks the rendering, at least while editing. (See &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/169919/5&quot;&gt;this revision&lt;/a&gt; for the correct rendering without any linefeed.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/8caVe.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/8caVe.png&quot; alt=&quot;Broken MathJax&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="58563" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-08-08T00:04:07.537" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16743" PostTypeId="2" ParentId="16736" CreationDate="2018-08-03T21:06:25.707" Score="11" Body="&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-bydesign&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-bydesign&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-bydesign&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Border-radius on badge progress bar&lt;/h2&gt;&#xA;&lt;p&gt;Is the top-right/bottom-right border radius on the badge progress bar intentional, or is it accidental? It does look weird to me.&lt;/p&gt;&#xA;&lt;p&gt;(I will however delete this post if it is intentional, as it is not the right place to talk about looks &amp;amp; feels.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/UjKtV.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/UjKtV.png&quot; alt=&quot;border-radius&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="58563" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-08-15T17:42:50.423" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16744" PostTypeId="2" ParentId="16736" CreationDate="2018-08-03T22:00:10.843" Score="14" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-planned&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-planned&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-planned&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;White indentation blocks in the post editor tips&lt;/h1&gt;&#xA;&lt;p&gt;Again, this might be intentional. But even if it is, it gives the feeling that it's a rendering bug -- and doesn't help counting the number of spaces anyway.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/0qXfb.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/0qXfb.png&quot; alt=&quot;white blocks&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/FWncd.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/FWncd.png&quot; alt=&quot;white blocks&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="58563" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-08-08T00:06:05.820" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16745" PostTypeId="2" ParentId="16736" CreationDate="2018-08-04T03:17:16.693" Score="2" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;/questions/tagged/status-bydesign&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-bydesign&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-bydesign&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Watched and Ignored tags can both be open at once&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'm not sure if this is a bug or not, feel free to ignore if it's intended.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's the watched tags and ignored tags. If you click the edit button, you can add or remove tags. If you click anywhere else, the ability to edit goes away.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, if you click on the edit button of the other one (watched and ignored) then the first remains editable. This seems inconsistent and surprising.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's what it looks like:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/rzM9L.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/rzM9L.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="75523" LastEditDate="2018-08-08T00:13:47.937" LastActivityDate="2018-08-08T00:13:47.937" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16746" PostTypeId="2" ParentId="16736" CreationDate="2018-08-04T03:53:26.480" Score="21" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-review&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-review&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-review&lt;/a&gt; I've logged a bug for this, but it is unrelated to the theme change.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;If many tags are added to a question, tags scroll away and never come back&lt;/h2&gt;&#xA;&lt;p&gt;If too many tags are added to a question to fit in the tag box, the tags start moving away to the left, rendering them unreachable:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/VBHO6.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/VBHO6.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Moreover, if the visible tags are deleted, the tags that moved away to the left don't come back:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/7X4us.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/7X4us.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Similar problems exist with resizing the window while adding tags - it's easy to end up in a state where you can barely see any tags, even though there's plenty of room.&lt;/p&gt;&#xA;&lt;p&gt;If you delete the last visible tag, the rest do finally scroll back, but it should scroll back long before that.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-08-15T17:24:46.133" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16747" PostTypeId="2" ParentId="16736" CreationDate="2018-08-04T04:05:06.747" Score="5" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Order questions keyboard shortcut doesn't do anything&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;kbd&gt;G&lt;/kbd&gt; &lt;kbd&gt;Q&lt;/kbd&gt; goes to &lt;a href=&quot;https://codegolf.stackexchange.com/questions&quot;&gt;https://codegolf.stackexchange.com/questions&lt;/a&gt; as usual.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After that, however, &lt;kbd&gt;O&lt;/kbd&gt; &lt;kbd&gt;A&lt;/kbd&gt; does not &quot;sort by active&quot;. &lt;kbd&gt;?&lt;/kbd&gt; offers no option to &quot;order questions&quot; at all.&lt;/p&gt;&#xA;&#xA;&#xA;" OwnerUserId="69850" LastEditorUserId="53864" LastEditDate="2018-08-14T22:38:50.963" LastActivityDate="2018-08-14T22:38:50.963" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16748" PostTypeId="2" ParentId="16736" CreationDate="2018-08-04T04:16:47.347" Score="9" Body="&lt;h2&gt;Tags search page is missing distinguishing features&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Tag synonyms are indistinguishable from tags with no usage guidelines and 0-1 answers. Moreover, tags with 0 answers are indistinguishable from tags with 1 answer. On &lt;a href=&quot;https://codegolf.stackexchange.com/tags?page=1&amp;amp;tab=name&quot;&gt;this page&lt;/a&gt;, compare &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/anagrams&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;anagrams&amp;#39;&quot; rel=&quot;tag&quot;&gt;anagrams&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; rel=&quot;tag&quot;&gt;array&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/birthday-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;birthday-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;birthday-problem&lt;/a&gt;. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/anagrams&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;anagrams&amp;#39;&quot; rel=&quot;tag&quot;&gt;anagrams&lt;/a&gt; is a synonym for the very popular tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt;. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; rel=&quot;tag&quot;&gt;array&lt;/a&gt; has no questions at all, which raises the question of why it's on the search page at all. And &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/birthday-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;birthday-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;birthday-problem&lt;/a&gt; was just created, and so has 1 question and no usage guidelines.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, on any tags with no usage guidelines, the &quot;n asked this year&quot; information is missing. For instance,  on &lt;a href=&quot;https://codegolf.stackexchange.com/tags?page=2&amp;amp;tab=name&quot;&gt;page 2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cards&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cards&amp;#39;&quot; rel=&quot;tag&quot;&gt;cards&lt;/a&gt; has had 2 questions asked this year, but that information is not displayed. &lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2018-08-04T04:16:47.347" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16749" PostTypeId="2" ParentId="16736" CreationDate="2018-08-04T06:31:49.840" Score="4" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;/questions/tagged/status-bydesign&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-bydesign&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-bydesign&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Left bar whitespace right of text doesn't go away&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As I shrink the horizontal window size, various page elements are removed. However, at no point is the whitespace to the right of the left navigation text removed, up until the point where the left navigation bar is removed.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="75523" LastEditDate="2018-08-08T00:14:25.987" LastActivityDate="2018-08-08T00:14:25.987" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16750" PostTypeId="2" ParentId="16736" CreationDate="2018-08-04T06:35:24.603" Score="16" Body="&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-review&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-review&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-review&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Search bar font shrinks unnecessarily&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As I shrink the horizontal width of the window, when the right navigation bar is removed the font size of the text in the search bar changes abruptly, without the size of the search box itself changing. It goes from this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/5COAV.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/5COAV.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/NbrNX.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/NbrNX.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;and as far as I can tell there's no reason for the font size to change at all, because the search box size isn't changing.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="75523" LastEditDate="2018-08-15T17:29:44.260" LastActivityDate="2018-08-15T17:29:44.260" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16753" PostTypeId="2" ParentId="2140" CreationDate="2018-08-05T15:49:33.410" Score="1" Body="&lt;h1&gt;Edit distance for sparse strings&lt;/h1&gt;&#xA;&lt;p&gt;The input to this challenge will be two strings of length one million each.  Each string contains only zeros and ones. However each string will contain at most 100 ones and so will be represented by a sorted list of integers. The integers will indicate where the ones are.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example of input&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[ 42394, 108181, 154190, 217161, 301607, 379951, 412651, 623862, 624712, 783863]&#xA;[ 42393, 108181, 154189, 267161, 301608, 379951, 412651, 623862, 624713, 783863]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We want to compute the &lt;a href=&quot;https://en.wikipedia.org/wiki/Edit_distance&quot; rel=&quot;nofollow noreferrer&quot;&gt;Levenshtein distance&lt;/a&gt; between these two strings. However, the standard algorithm will take around 10^12 time which is too slow.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Task&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your code should take in the two inputs and output the edit distance between the two strings. The only restriction is that your code must be fast enough (and not use too much memory) so that it will complete in less than a minute on a standard desktop PC. In case of doubt, I will test the code on my 8GB AMD processer PC using test inputs that I will create.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Small test cases&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;To test your code here are some small inputs for strings of length 100 with up to 10 ones.&lt;/p&gt;&#xA;&lt;p&gt;This pair gives edit distance 8.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[18, 23, 30, 40, 47, 53, 60, 73, 89, 94]&#xA;[21, 23, 39, 48, 53, 59, 60, 89]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This pair gives edit distance 8&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[19, 25, 26, 40, 43, 62, 74, 75, 85, 89]&#xA;[10, 26, 27, 28, 44, 70, 74, 75, 76, 86]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This pair gives edit distance 7&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[ 9, 17, 18, 29, 45, 50, 57, 64, 80]&#xA;[ 2, 16, 23, 27, 32, 43, 49, 56, 63, 79]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This pair gives edit distance 6&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[ 3,  9, 12, 33, 39, 49, 55, 72, 84, 94]   &#xA;[ 3,  9, 29, 40, 41, 72, 84, 94]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user9207" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-08-05T15:56:23.560" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16756" PostTypeId="2" ParentId="16736" CreationDate="2018-08-05T22:29:42.617" Score="7" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;/questions/tagged/status-planned&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-planned&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-planned&lt;/a&gt; This is a temporary artifact due to responsive NOT being ready for all pages. So, on a smaller viewport (like a tablet) the left nav will auto hide on some pages (responsive ones) but not others (non-responsive ones). This will be fully addressed when we make all pages responsive, but that will take some time.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;There is a curious inconsistency whereby on my tablet the left navigation shows on some pages (e.g. my user page) but not on others (e.g. the homepage).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;User page: note the left navigation:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/KX0VH.png&quot; alt=&quot;My user page&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Home page: note the absence of left navigation:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/nLkjo.png&quot; alt=&quot;Homepage&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This leaves the homepage apparently with less functionality than it had in the previous design. It turns out that it's still possible to e.g. list questions by criteria other than &quot;Top&quot;, but it requires finding which of &lt;em&gt;three&lt;/em&gt; &quot;hamburger&quot; icons (circled in screenshot above) opens the menu with that functionality, which I do not consider good discoverability.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I regard this as a removal of useful functionality: previously it took one click to get to a list of questions sorted by Newest, but now it takes at least two, and one of them is not discoverable.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="75523" LastEditDate="2018-08-15T17:56:54.997" LastActivityDate="2018-08-15T17:56:54.997" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="16759" PostTypeId="2" ParentId="2140" CreationDate="2018-08-06T22:01:35.293" Score="2" Body="&lt;p&gt;Note: this is my first time posting, so I need help fleshing out the details. I'm aware there are plenty of Roman Numeral problems, but this is somewhat different.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;When in Rome, count as Romans do!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This problem is inspired by &lt;a href=&quot;http://datagenetics.com/blog/april22013/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; website, which published the following diagram:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Xl3tg.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Xl3tg.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This diagram shows us that the longest Roman Numeral expression under 250 is that of 188, which requires 9 numerals to express.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The standard symbols used to express most Roman Numerals are the following: {I, V, X, L, C, D, M}. In this challenge, your goal is to, given an positive integer &lt;em&gt;n&lt;/em&gt;, compute the number of valid Roman Numeral representations that can be composed through concatenating &lt;em&gt;n&lt;/em&gt; of the standard symbols.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then, your program must output the result of this computation modulo 3997 (to prevent answers from getting too long) in Roman Numerals! &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules for Roman Numeral Expressions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Roman Numerals originally only had &quot;additive&quot; pairing, meaning that numerals were always written in descending order, and the sum of the values of all the numerals was the value of the number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Later on, subtractive pairing, the use of placing a smaller numeral in front of a larger in order to subtract the smaller from the larger, became commonplace to shorten Roman Numeral expressions. Subtractive pairs cannot be chained, like the following: IXL. This is considered invalid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following are the modern day rules for additive and subtractive pairing.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Only one I, X, and C can be used as the leading numeral in part of a subtractive pair.&lt;/li&gt;&#xA;&lt;li&gt;I can only be placed before V and X in a subtractive pair.&lt;/li&gt;&#xA;&lt;li&gt;X can only be placed before L and C in a subtractive pair.&lt;/li&gt;&#xA;&lt;li&gt;C can only be placed before D and M in a subtractive pair.&lt;/li&gt;&#xA;&lt;li&gt;Other than subtractive pairs, numerals must be in descending order&lt;/li&gt;&#xA;&lt;li&gt;M, C, and X cannot be equalled or exceeded by smaller denominations.&lt;/li&gt;&#xA;&lt;li&gt;D, L, and V can each only appear once.&lt;/li&gt;&#xA;&lt;li&gt;Only M can be repeated 4 or more times.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: 1&#xA;Output: VII&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;More to be added.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox Users&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Thoughts on this problem? I know it is really badly formatted but I thought the concept was cool. Thanks for the help!&lt;/p&gt;&#xA;" OwnerUserId="82007" LastEditorUserId="82007" LastEditDate="2018-08-08T17:18:25.743" LastActivityDate="2018-08-08T17:18:25.743" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16760" PostTypeId="2" ParentId="6918" CreationDate="2018-08-06T22:22:54.050" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/ajc2/ahead&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Ahead&quot;&gt;Ahead&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Ahead is a &lt;a href=&quot;https://esolangs.org/wiki/Fungeoid&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;fungeoid&quot;&gt;fungeoid&lt;/a&gt; I've been developing on and off for a few months. It is very much in a &quot;perpetually-rolling release&quot; state of development and features are still being specified and implemented, but what's there right now is very solid. Ahead is &lt;a href=&quot;https://tio.run/#ahead&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Ahead on TIO&quot;&gt;available on TIO.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Standout Features&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Ahead is inspired by &lt;a href=&quot;http://esolangs.org/wiki/Befunge&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Befunge&quot;&gt;Befunge&lt;/a&gt; and &lt;a href=&quot;http://esolangs.org/wiki/Fish&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Fish&quot;&gt;&gt;&amp;lt;&gt;&lt;/a&gt; but takes its own liberties with the 2D grid style. Most obviously, most of the symbols are different (sorry polyglots!) Just for the sake of an example, &lt;a href=&quot;https://tio.run/##S8xITUz5/9@z2N@Bq87O0L/u/38DAA&quot; rel=&quot;nofollow noreferrer&quot;&gt;here's the truth machine&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;IsO@&#xA;~&amp;gt;1O~&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Rather than wrapping around when the head (or IP) reaches the end of a line, it &quot;bounces off the edge&quot; and begins traveling backwards to the previous cell. The board (program space) is bounded on all sides by the &quot;edge&quot;, which is like a bunch of imaginary walls the head can't pass. Here, the &lt;code&gt;#&lt;/code&gt; symbols are the edge and the &lt;code&gt;.&lt;/code&gt;s are the space beyond.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.........&#xA;.#######.&#xA;.#IsO@ #.&#xA;.#~&amp;gt;1O~#.&#xA;.#######.&#xA;.........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;To the head, the edge, and the space beyond, doesn't exist; it is an impenetrable field that is entirely inaccessible. The board is sized exactly to the smallest rectangle required to hold the entire program code, with gaps filled in with space characters, and fixed to that size. The board is not infinite, and combined with the lack of Befunge-style &lt;code&gt;g&lt;/code&gt; or &lt;code&gt;p&lt;/code&gt; commands self-modifying programs or those that use the board for storage are extremely difficult to write.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, these edge bounces can be very useful and interesting tools for head movement, particularly when traveling diagonally.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The head can make 90 degree turns to the left or right using &lt;code&gt;L&lt;/code&gt; or &lt;code&gt;R&lt;/code&gt;. These are rather self-explanatory; if you're traveling &lt;code&gt;&amp;gt;&lt;/code&gt; and hit an &lt;code&gt;L&lt;/code&gt;, you start going &lt;code&gt;^&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, the head can also make 45 degree turns with &lt;code&gt;l&lt;/code&gt; and &lt;code&gt;r&lt;/code&gt;. If you're going &lt;code&gt;&amp;gt;&lt;/code&gt; (or East) and hit an &lt;code&gt;l&lt;/code&gt;, you start traveling &quot;Northeast&quot;; that is, diagonally up-right. This is the only way to travel diagonally in Ahead (as of now?), and the head can only travel in these eight directions.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;String state behaves very much like you expect, except it pushes a 0 (or &lt;code&gt;NUL&lt;/code&gt;) to the stack when you enter. This makes it very convenient to determine where a string ends.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This couples with &lt;code&gt;W&lt;/code&gt;, which prints characters off the stack until it reaches a 0. The combination of these two makes the &lt;a href=&quot;https://tio.run/##S8xITUz5/19JMSWnKD9cQSc/JyfVQync4f9/AA&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hello World program&lt;/a&gt; absolutely trivial:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;!dlroW ,olleH&quot;W@&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;In general, the running theme of Ahead is to be a twist on traditional fungeoids with a smattering of useful builtins. Before this post gets way too long, you can check the full list of currently-implemented functions on the GitHub wiki (and of course, try them on TIO.) More updates are coming!&lt;/p&gt;&#xA;" OwnerUserId="42096" LastActivityDate="2018-08-06T22:22:54.050" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16762" PostTypeId="2" ParentId="2140" CreationDate="2018-08-07T11:48:00.547" Score="0" Body="&lt;h1&gt;Most Turing-incomplete Instruction Set&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Tags:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-design&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-design&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-design&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This challenge expects you to define an instruction set \$I = \{ \texttt{instr}_1 \dots \texttt{instr}_n \}\$ which is provably &lt;a href=&quot;https://en.wikipedia.org/wiki/Turing_completeness&quot; rel=&quot;nofollow noreferrer&quot;&gt;Turing complete&lt;/a&gt;. The catch is that any subset \$I'\$ that is proper (ie. \$I' \neq I\$) must not be Turing complete.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to define some environment (eg. a stack, an unbounded tape, tuples, integers, funcions etc.) over which you have complete freedom to choose, let us call this environment \$E\$.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To initialize \$E\$ you will define a way of transforming the source code \$s\$ and inputs \$in_0,\dots,in_r\$ to some \$E_{initial}\$. The same holds for the output of your programming language, you can define the output as any mapping of the end state \$E_{end}\$ to your output set.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main task is to find an as large as possible number of instructions which define a Turing complete programming language, but removing any instruction from that set must result in a programming language that is not Turing complete.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An instruction \$\texttt{instr}_i\$ takes some non-negative number \$m\$ of arguments and modifies the environment, ie.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$&#xA;\texttt{instr}_i : A_0 \times \cdots \times A_m \times E \to E&#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;where \$A_0,\dots,A_m\$ are the sets of valid arguments, you're free to define these as you wish (eg. natural numbers, integers, Booleans, labels etc.).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Submission&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your submission will contain&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the language specification&lt;/li&gt;&#xA;&lt;li&gt;informal proof of validity&lt;/li&gt;&#xA;&lt;li&gt;an implementation of the language.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;this is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; and your score will be the number of instructions, the goal is to maximize this number (ties will be broken by favouring the earliest submission)&lt;/li&gt;&#xA;&lt;li&gt;your programming language only needs to support input by using some special initial environment \$E_{initial}\$&lt;/li&gt;&#xA;&lt;li&gt;the same holds for the output(s), these only need to be encoded in the final \$E_{end}\$&lt;/li&gt;&#xA;&lt;li&gt;the definitions of \$E\$ and the way of transforming input/output do not need to be formal (eg. it suffices to just say something along the lines of: &lt;em&gt;&quot;My language works with a stack of integers, initially it will contain all the inputs beginning with the first one at the bottom of the stack. Output will be the top of the stack or zero if it's empty.&quot;&lt;/em&gt;)&lt;/li&gt;&#xA;&lt;li&gt;you will need to provide an informal proof of why your submission is valid, consisting of&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;an informal proof of Turing completeness of the instruction set \$I\$&lt;/li&gt;&#xA;&lt;li&gt;an informal proof of why any proper subset of \$I\$ is not Turing complete&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;these proofs may rely on reductions to known Turing complete languages (eg. Turing machines, BitBitJump, brainfuck etc.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As pointed out by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/21034/nathaniel?tab=profile&quot;&gt;Nathaniel&lt;/a&gt;, it is currently possible to get an arbitrary large score.. If anyone has a nice fix that will prevent that (and similar exploits), please leave a comment.&lt;/p&gt;&#xA;" OwnerUserId="48198" LastEditorUserId="48198" LastEditDate="2018-08-07T12:55:02.103" LastActivityDate="2018-08-07T12:55:02.103" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="16763" PostTypeId="2" ParentId="16736" CreationDate="2018-08-07T12:19:05.180" Score="8" Body="&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have poor eyesight, and as a result I browse Stack Exchange sites at 150% zoom level in Chrome. On most sites, I see the main content to the left, and to the right is useful stuff such as related questions, &quot;featured on meta&quot; and the hot network questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this new theme, because of my zoom level, all that stuff is pushed to the bottom of the page. This seems to be for the sake of fitting the sidebar onto my screen, but (at least currently) its content is vastly less useful than the right-hand column that it's displacing. It would be much better for the sidebar to disappear before the right-hand column does.&lt;/p&gt;&#xA;" OwnerUserId="21034" LastEditorUserId="75523" LastEditDate="2018-08-15T16:31:01.017" LastActivityDate="2018-08-15T16:31:01.017" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16764" PostTypeId="2" ParentId="2140" CreationDate="2018-08-07T15:15:37.703" Score="0" Body="&lt;p&gt;Define the structure X as a non-empty array of (smaller) X objects and &quot;1&quot;. Split an X object into the smallest amount of continuous parts Y, length of each of Y don't exceed n, so that each X is either part of a Y, or exactly some Ys. It's fine if output only express which part has how many 1's.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Samples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1,[1,1,1]],3 =&amp;gt; 1;111&#xA;[1,[1,1,1]],2 =&amp;gt; 1;11;1 or 1;1;11&#xA;[[1,1,1],[1,1,1]],1 =&amp;gt; 1;1;1;1;1;1&#xA;[[1,1,1],[1,1,1]],2 =&amp;gt; 11;1;11;1 or etc.&#xA;[[1,1,1],[1,1,1]],3 =&amp;gt; 111;111&#xA;[[1,1,1],[1,1,1]],4 =&amp;gt; 111;111&#xA;[[1,1,1],[1,1,1]],5 =&amp;gt; 111;111&#xA;[[1,1,1],[1,1,1]],6 =&amp;gt; 111111&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="69850" LastEditDate="2018-08-07T15:26:36.037" LastActivityDate="2018-08-07T15:26:36.037" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16766" PostTypeId="2" ParentId="16736" CreationDate="2018-08-08T08:29:53.697" Score="-2" Body="&lt;h2&gt;Tag buttons in chat focus and unfocus indefinitely&lt;/h2&gt;&#xA;&lt;p&gt;I've only noticed this in PPCG chat rooms so far, but if you hover over a question tag on the bottom most pixel, the entire tag button focuses and unfocuses forever.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/message/46088631#46088631&quot;&gt;Example message&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="32686" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-08-08T08:29:53.697" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16769" PostTypeId="1" CreationDate="2018-08-08T17:58:27.573" Score="2" ViewCount="95" Body="&lt;p&gt;In short, I've answered &lt;a href=&quot;https://codegolf.stackexchange.com/questions/170229/gold-collector-koth/170263&quot;&gt;this&lt;/a&gt; &lt;code&gt;KotH&lt;/code&gt; challenge using the same &lt;a href=&quot;https://codegolf.stackexchange.com/a/167590/78039&quot;&gt;answer&lt;/a&gt; in this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/167568/bot-outsnake-the-game&quot;&gt;other question&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is my &lt;a href=&quot;https://codegolf.stackexchange.com/a/170263/78039&quot;&gt;answer&lt;/a&gt;. It is not entirely copy past since I have to change some pieces of code to make it work for the other challenge but in essence, ... is the same answer...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, I stated that the answer was taken from another questions' answer and gave credit to the original post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this allowed here? Did I do something wrong? I feel like I just robbed it&lt;/p&gt;&#xA;" OwnerUserId="78039" LastEditorUserId="20198" LastEditDate="2018-08-09T20:35:35.907" LastActivityDate="2018-08-09T20:35:35.907" Title="Answer a question using another question's answer is correct?" Tags="|discussion|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16772" PostTypeId="2" ParentId="16272" CreationDate="2018-08-08T23:57:35.220" Score="8" Body="&lt;p&gt;Due to &lt;a href=&quot;https://meta.stackexchange.com/questions/308966/traffic-views-visits-isnt-correctly-registered-on-site-analytics-or-area-51&quot;&gt;a whole lot of chaos&lt;/a&gt; with our Google Analytics account, we kinda lost access to all information prior to April. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;But, traffic &lt;em&gt;since then&lt;/em&gt; should show up just fine now. That was fixed a couple months back; see the meta post linked above for details.&lt;/p&gt;&#xA;" OwnerUserId="1144" LastActivityDate="2018-08-08T23:57:35.220" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16773" PostTypeId="2" ParentId="2140" CreationDate="2018-08-09T05:41:04.037" Score="-1" Body="&lt;p&gt;A function to traverse an array and re-generate the same array&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We take an array, then write a function that will traverse the array and generate the array in a format given in the example below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;For example, given the array:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Array&#xA;&#xA;(&#xA;&#xA;  [0] =&amp;gt; Array&#xA;  ( [name] =&amp;gt; Tom&#xA;      [age] =&amp;gt; 32&#xA;      [key] =&amp;gt; Array&#xA;      ( [0] =&amp;gt; abc&#xA;          [1] =&amp;gt; def&#xA;          [2] =&amp;gt; efg&#xA;          )&#xA;      )&#xA;  [1] =&amp;gt; Array&#xA;  ( [name] =&amp;gt; Jim&#xA;      [age] =&amp;gt; 30&#xA;      [key] =&amp;gt; Array&#xA;      ( [0] =&amp;gt; abc&#xA;          [1] =&amp;gt; def&#xA;          [2] =&amp;gt; efg&#xA;          )&#xA;      [address] =&amp;gt; Array&#xA;      ( [0] =&amp;gt; Array&#xA;          ( [state] =&amp;gt; CA&#xA;              [country] =&amp;gt; US&#xA;              )&#xA;          [1] =&amp;gt; Array&#xA;          ( [state] =&amp;gt; NY&#xA;              [country] =&amp;gt; US&#xA;              )&#xA;          )&#xA;     )&#xA;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output should be:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;User: 0&#xA; name: Tom&#xA; age: 32&#xA; key:&#xA;  0: abc&#xA;  1: def&#xA;  2: efg&#xA;User: 1&#xA; name: Jim&#xA; age: 30&#xA; key:&#xA;  0: abc&#xA;  1: def&#xA;  2: efg&#xA;address:&#xA;0:&#xA; state: CA&#xA; country: US&#xA;1:&#xA; state: NY&#xA; country: US&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can assume array can be &lt;code&gt;multidimensional&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The array can also be array of &lt;code&gt;cars&lt;/code&gt;, &lt;code&gt;schools&lt;/code&gt;, &lt;code&gt;districts&lt;/code&gt; etc.&lt;/li&gt;&#xA;&lt;li&gt;The preferred output is in json format&lt;/li&gt;&#xA;&lt;li&gt;Indentation for the output is a simple json format &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;code-golf&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The function will be tested with any sort of &lt;code&gt;multidimensional&lt;/code&gt; arrays for speed of execution&lt;/p&gt;&#xA;" OwnerUserId="82147" LastEditorUserId="82147" LastEditDate="2018-08-09T06:56:57.970" LastActivityDate="2018-08-09T06:56:57.970" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16774" PostTypeId="2" ParentId="16736" CreationDate="2018-08-09T18:34:51.670" Score="23" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt; &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Badge icons are missing&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;On the Main site:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/bLyVAm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/bLyVAm.png&quot; alt=&quot;PPCG badges missing&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On Meta:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/akEepm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/akEepm.png&quot; alt=&quot;PPCG meta badges missing&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="82069" LastEditDate="2018-08-10T21:31:47.693" LastActivityDate="2018-08-10T21:31:47.693" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16775" PostTypeId="2" ParentId="16736" CreationDate="2018-08-09T18:38:33.363" Score="6" Body="&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Welcome to Stack Overflow, sign up to our newsletter!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/q0t5e.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/q0t5e.png&quot; alt=&quot;SO icon next to envelope&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="82069" LastEditDate="2018-08-10T21:34:37.393" LastActivityDate="2018-08-10T21:34:37.393" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16778" PostTypeId="2" ParentId="16736" CreationDate="2018-08-10T07:35:31.937" Score="12" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;/questions/tagged/status-bydesign&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-bydesign&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-bydesign&lt;/a&gt; Hiding of left nav is a feature of being signed in.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;&quot;Global&quot; left nav hiding does not apply to sites not joined&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I have hidden the left nav in my preferences on PPCG. (As I need a large font for my eyes, it is (so far) the only issue with the new theme I've found unacceptable.) This setting is &lt;a href=&quot;https://meta.stackexchange.com/q/311528&quot;&gt;supposed to be global&lt;/a&gt;, and indeed seems to work automatically for StackOverflow where I have already joined.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, it does not work for me on Meta StackExchange - the left nav is still shown there. I assume the difference is that I have never joined that site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Joining to test...&lt;/em&gt; Yep, that was it, now it's gone.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This may be easily fixed for a single site, but I often follow links in Hot Network Questions to sites I don't otherwise use, so I foresee that this would become annoying once the new themes start getting rolled out to all sites.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;EDIT: Well, that is a disappointment. I don't generally frequent sites that ask me to register just to make their content bearable to read, which means this will discourage me from visiting other SE sites than those I am already registered at. Note that I &lt;em&gt;am&lt;/em&gt; signed in, just not to every single site individually. And those sites still show the top menu bar with my account's notices etc., so it's not like you couldn't somehow get hold of my global preferences.&lt;/p&gt;&#xA;" OwnerUserId="66041" LastEditorUserId="66041" LastEditDate="2018-08-15T19:49:02.763" LastActivityDate="2018-08-15T19:49:02.763" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16781" PostTypeId="2" ParentId="16736" CreationDate="2018-08-10T14:26:53.677" Score="5" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;/questions/tagged/status-planned&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-planned&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-planned&lt;/a&gt;&#xA;   Currently we still recommend you use the mobile view on small screen devices. There is a good bit of work for us to do to make the responsive pages work well on mobile. That work is planned but we don't have a firm schedule at this time.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;The &lt;em&gt;Unanswered&lt;/em&gt; tab is partially hidden when loading the page on mobile devices&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;&lt;sub&gt;Freehand red circles FTW!&lt;/sub&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/O5l9Q.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/O5l9Q.jpg&quot; alt=&quot;Unanswered tab partially hidden on mobile&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="75523" LastEditDate="2018-08-15T17:59:27.563" LastActivityDate="2018-08-15T17:59:27.563" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16782" PostTypeId="2" ParentId="2140" CreationDate="2018-08-10T14:27:33.183" Score="0" Body="&lt;p&gt;&lt;em&gt;&lt;strong&gt;Drat! This was actually run three years ago! See &lt;a href=&quot;https://codegolf.stackexchange.com/questions/54412/implement-intercals-binary-operators&quot;&gt;Implement INTERCAL&amp;#39;s Binary Operators&lt;/a&gt;&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Mingle and Select&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;The programming language INTERCAL has two operators, &amp;quot;mingle&amp;quot; or &amp;quot;interleave&amp;quot; (represented by &lt;code&gt;$&lt;/code&gt;), and &amp;quot;select&amp;quot; (represented by &lt;code&gt;~&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Mingle&lt;/strong&gt; takes two 16-bit values and produces a 32-bit value by taking single bits alternately from its left and right operands, and concatenating them together - for example, &lt;code&gt;65535 $ 0&lt;/code&gt; will yield &lt;code&gt;-1431655766&lt;/code&gt; as follows: 65535 is 0xFFFF, or 0b1111111111111111; 0 is 0b0000000000000000. Taking the bits alternately gives 0b10101010101010101010101010101010, or 0xAAAAAAAA, which evaluates to the signed integer -1431655766.&lt;/p&gt;&#xA;&lt;p&gt;A simplified implementation of &lt;strong&gt;Select&lt;/strong&gt; takes two 32-bit operands, and produces a 32-bit value by comparing the bits in the two operands, and wherever the right operand has a 1 bit, take the corresponding bit from the left operand. The resulting bits are compressed to the right, and zero-filled on the left - for example, an 8-bit version of select, given &lt;code&gt;79 ~ 42&lt;/code&gt;, would return &lt;code&gt;3&lt;/code&gt;, as follows: 79 is 0b01001111, and 42 is 0b00101010. Numbering the bits from the left starting with 1, we need to take the third, fifth, and seventh bits of 79, which are 0, 1, and 1, respectively. We then compress them to the right - 011 - and zero-fill, yielding 0b00000011, or 3.&lt;/p&gt;&#xA;&lt;h3&gt;The challenge&lt;/h3&gt;&#xA;&lt;p&gt;Without using INTERCAL, and without using in any other language any &lt;s&gt;operator&lt;/s&gt; builtin that amounts to either mingle or select, implement both operators. You may implement them &lt;s&gt;for 16- or 32-bit integers, and&lt;/s&gt; as either operators or functions, but input and output must be UNsigned decimal integers. (I'm not going to require input or output in INTERCAL-style insanity!)&lt;/p&gt;&#xA;&lt;p&gt;Further constraint: The minimum bit width of the operands must be 16 bits for &lt;code&gt;mingle&lt;/code&gt; (no constraint for &lt;code&gt;select&lt;/code&gt;), and if they are unequal in width, the shorter is zero-filled on the left to match the width of the longer (zero fill applies to both &lt;code&gt;mingle&lt;/code&gt; and &lt;code&gt;select&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;test cases to be written and inserted here&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest solution in each language 'wins'. (Naturally, the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;standard loopholes&lt;/a&gt; are forbidden.)&lt;/p&gt;&#xA;" OwnerUserId="79081" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-08-13T18:29:52.483" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="16783" PostTypeId="2" ParentId="16736" CreationDate="2018-08-10T14:28:42.937" Score="4" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;/questions/tagged/status-planned&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-planned&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-planned&lt;/a&gt; Currently we still recommend you use the mobile view on small screen devices. There is a good bit of work for us to do to make the responsive pages work well on mobile. That work is planned but we don't have a firm schedule at this time.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;The &lt;em&gt;insert image&lt;/em&gt; dialog box cannot be scrolled on mobile&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The pop-up that appears when trying to upload an image cannot be scrolled, and you cannot actually insert the picture into the post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/FtW5t.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/FtW5t.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="75523" LastEditDate="2018-08-15T17:23:25.313" LastActivityDate="2018-08-15T17:23:25.313" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16786" PostTypeId="2" ParentId="2140" CreationDate="2018-08-11T17:25:35.600" Score="0" Body="&lt;h1&gt;Game of Circles &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;This is a hidden-identity game with Detectives and Robbers.  You will write either a Detective bot or a Robber bot.  All Robbers know the identity of all other Robbers.  Each turn, a bot must either:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Draw a private circle:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The actual circle drawn is public information&lt;/li&gt;&#xA;&lt;li&gt;Detectives receive the number of Robbers in the circle privately&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Draw a public circle&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The player that draws the circle declares the number of robbers in the circle (may or may not be true)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Finally, the player with the most circles (public or private) around them dies.  In the case of a tie, no player dies.&lt;/p&gt;&#xA;&lt;p&gt;The game ends when a single side has been eliminated or when no players have died for 3 turns.&lt;/p&gt;&#xA;&lt;p&gt;Each game consists of 17 Detective and 3 Robbers.  (META:  These numbers I'm not sure about).&lt;/p&gt;&#xA;&lt;p&gt;The bots that will participate in each game will be chosen using two genetic algorithms.&#xA;There will be 100 simultaneous games, and the first genetic algorithm will choose the 1700 players for the Detectives, while the second genetic algorithm will choose the 300 Robbers.  The fitness function for each bot will be how long they survived in the game (by percentage).&lt;/p&gt;&#xA;&lt;p&gt;After 1000 rounds, players are ranked by their population (two scoreboards, one for Detectives, one for Robbers)&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-08-11T17:25:35.600" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16787" PostTypeId="2" ParentId="2140" CreationDate="2018-08-11T21:52:31.723" Score="0" Body="&lt;h1&gt;4B/5B Encoding&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Tags:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/encode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;encode&amp;#39;&quot; rel=&quot;tag&quot;&gt;encode&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;To transmit data in binary there's a technique called &lt;a href=&quot;https://en.wikipedia.org/wiki/Non-return-to-zero#NRZI&quot; rel=&quot;nofollow noreferrer&quot;&gt;NRZI&lt;/a&gt; where a transition from &lt;em&gt;+V&lt;/em&gt; to &lt;em&gt;-V&lt;/em&gt; or vice-versa encodes a &lt;em&gt;1&lt;/em&gt; and the absence of such a transition a &lt;em&gt;0&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In case there are a lot of &lt;em&gt;1&lt;/em&gt; s this is a good method because there will be a lot of transmissions and the risk of getting out of sync is smaller, however it's still tricky for long runs of &lt;em&gt;0&lt;/em&gt;. One solution is &lt;a href=&quot;https://en.wikipedia.org/wiki/4B5B#Encoding_table&quot; rel=&quot;nofollow noreferrer&quot;&gt;4B/5B&lt;/a&gt; encoding which takes 4bits and encodes it in 5bits in a way such that there are at most 3 consecutive bits. The encoding is as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0000 -&amp;gt; 11110&#xA;0001 -&amp;gt; 01001&#xA;0010 -&amp;gt; 10100&#xA;0011 -&amp;gt; 10101&#xA;0100 -&amp;gt; 01010&#xA;0101 -&amp;gt; 01011&#xA;0110 -&amp;gt; 01110&#xA;0111 -&amp;gt; 01111&#xA;1000 -&amp;gt; 10010&#xA;1001 -&amp;gt; 10011&#xA;1010 -&amp;gt; 10110&#xA;1011 -&amp;gt; 10111&#xA;1100 -&amp;gt; 11010&#xA;1101 -&amp;gt; 11011&#xA;1110 -&amp;gt; 11100&#xA;1111 -&amp;gt; 11101&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an bytestring, you will need to encode it with the aforementioned encoding.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input will be a bytestring&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;to avoid padding-issues, it will always have a length that is a multiple of 4 bytes&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Output will be of the same a bytestring&lt;/li&gt;&#xA;&lt;li&gt;You may not assume that input (nor output) is printable&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; You need to handle both printable and unprintable examples!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;ASCII examples&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ORLY -&amp;gt; WWEis&#xA;OBMO -&amp;gt; WUEm]&#xA;SSePCcGG -&amp;gt; ]WW-~U]U=O&#xA;aHAHaHAHaHAHaHAHaHaO -&amp;gt; rU%%RrU%%RrU%%RrU%%RrU'%]&#xA;S#KPOCFWcSaOCR!@sz!\q9OKqY!L -&amp;gt; ]iU]~WUU9ouWW%]UWJ%^}_j%zzk5uWzW:%Z&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Unprintables in hexadecimal&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;c0 ff ee 00 -&amp;gt; d7 bb de 73 de&#xA;66 6f 6f 00 -&amp;gt; 73 9d d7 77 de&#xA;50 50 43 47 -&amp;gt; 5f 97 e5 55 4f&#xA;48 65 6c 6c 6f 2c 20 57 6f 72 6c 64 21 00 00 00 -&amp;gt; 54 9c b7 69 da 77 69 aa 79 6f 77 5f 47 69 ca a2 7d ef 7b de&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="48198" LastActivityDate="2018-08-11T21:52:31.723" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16789" PostTypeId="2" ParentId="2140" CreationDate="2018-08-12T11:32:05.357" Score="1" Body="&lt;h2&gt;Make a reversible formula&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For the purposes of this question:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;a basic formula \$ y = f(x) \$ takes one of the following forms:&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;$$ x \\ g(x) + c \\ c + g(x) \\ g(x) - c \\ c - g(x) \\ g(x) c \\ c g(x) \\ \frac {g(x)} c \\ \frac c {g(x)} $$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;where \$ g(x) \$ is a basic formula;&lt;/p&gt;&#xA;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;a reversible formula \$ y = f(x) \$ takes one of the following three forms:&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;$$ \begin{align} y = x &amp;amp; \implies x = y \\ y = c - g(x) &amp;amp; \implies x = g^{-1}(c - y) \\ y = \frac c {g(x)} &amp;amp; \implies x = g^{-1} \left ( \frac c y \right ) \end{align} $$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;where \$ g(x) \$ is a reversible formula whose reverse is \$ g^{-1}(x) \$ according to the above rules and \$ c \$ is a non-negative integer. A simple example of a reversible formula would be the expression \$ y = \frac 1 {1 - x} \$ whose reverse is \$ x = 1 - \frac 1 y \$.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to take a basic formula and express it as a reversible formula. The following transformations are allowed:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$ \begin{align} \left . \begin{array}r x + c \\ c + x \end{array} \right \} &amp;amp; \implies c - (0 - x) \\ x - c &amp;amp; \implies 0 - (c - x) \\ \left . \begin{array}r x c \\ c x \end{array} \right \} &amp;amp; \implies \frac c {\frac 1 x} \\ \frac x c &amp;amp; \implies \frac 1 {\frac c x} \end {align} $$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Note that the strict domain of the resulting formula may exclude some values not excluded in the original formula, but the limit of the formula should be equivalent to the original formula.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course we're dealing in string equations so you'll be using &lt;code&gt;*&lt;/code&gt; and &lt;code&gt;/&lt;/code&gt; instead. Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(x + 1) * 2 =&amp;gt; 2 / (1 / (1 - (0 - x)))&#xA;&#xA;x * 2 + 1 =&amp;gt; 1 - (0 - 2 / (1 / x))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Do not include extraneous parentheses in your result.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest submission that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2018-08-12T11:32:05.357" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="16790" PostTypeId="1" AcceptedAnswerId="16794" CreationDate="2018-08-12T17:16:21.053" Score="11" ViewCount="325" Body="&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/170229/&quot;&gt;this&lt;/a&gt; question, every &quot;game&quot; takes about 5 seconds. Ten thousand runs, maybe eight thousand, are planned. Running these on a single computer would take forever, so I suggested letting competitors and volunteers run some of the games. However, this result in cheating. My question is: &lt;strong&gt;should this be allowed?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2018-08-13T09:25:48.607" Title="Should competitors be able to run games for KoTHs?" Tags="|discussion|king-of-the-hill|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16792" PostTypeId="1" CreationDate="2018-08-12T23:50:42.423" Score="3" ViewCount="154" Body="&lt;p&gt;I know there are a lot of questions like this, but I didn't find any answer that satisfied me.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm pretty new to PPCG, so not all of my ideas are fantastic (e.g., this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/170449/goldbachs-comet&quot;&gt;failure&lt;/a&gt; of a challenge) but I like proposing a lot of question concepts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, part of the reason my last question (tagged above) was such a disappointment was the lack of feedback I received on my Sandbox post. Sure, I might have rushed posting the challenge out of excitement, but now I'm worried that my newest challenge doesn't end up in the same place this last one did.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I have to ask: what's the best policy to deal with lack of attention on your challenge in the Sandbox. Should I just wait until someone responds? Or should I just try my luck in the main exchange? Or some combination of the above.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sorry for the really bad question. I'll make sure to try to follow PPCG rules better in the future.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I should also note that I have read the question that discusses the issue of receiving few comments on posts, but I'm more concerned that the lack of comments is due to the difficulty of the challenges, rather than how great they are.&lt;/p&gt;&#xA;" OwnerUserId="82007" LastEditorUserId="20283" LastEditDate="2018-08-26T22:42:53.680" LastActivityDate="2018-08-26T22:42:53.680" Title="How do I deal with lack of attention in the Sandbox?" Tags="|support|sandbox|" AnswerCount="0" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="16794" PostTypeId="2" ParentId="16790" CreationDate="2018-08-13T09:25:48.607" Score="10" Body="&lt;h1&gt;Yes, but not competitively&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The controller &lt;em&gt;should&lt;/em&gt; be made available by the person running the KotH, to allow people to test and experiment, however they should not have a part in the final run that determines the winner. It should be up to the original poster to plan ahead of time how they intend to run the game, and if their game takes a long time to run, they should either optimize their controller, or have thought about that before hand (and made a less complex game).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One solution would be to have a cutoff date for entries, and at that point begin running the controller with all available entries, perhaps on a server somewhere, so that it can be left running as long as it needs. Then once the controller has finished, results can be posted.&lt;/p&gt;&#xA;" OwnerUserId="44998" LastActivityDate="2018-08-13T09:25:48.607" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16796" PostTypeId="2" ParentId="16736" CreationDate="2018-08-14T17:24:49.860" Score="3" Body="&lt;h2&gt;Misleading mouse cursor over the 'Next badge' element&lt;/h2&gt;&#xA;&lt;p&gt;Although the 'Next badge' element is clickable, the mouse cursor is set to either &lt;code&gt;default&lt;/code&gt; or &lt;code&gt;text&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;All other badge elements set the mouse cursor to &lt;code&gt;pointer&lt;/code&gt; when hovered over.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/W9vZw.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/W9vZw.jpg&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="58563" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-08-15T11:09:51.860" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16797" PostTypeId="2" ParentId="2140" CreationDate="2018-08-14T17:59:18.093" Score="2" Body="&lt;h1&gt;Most distinct Turing-complete character subsets&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;(Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/110648/fewest-distinct-characters-for-turing-completeness&quot;&gt;Fewest (distinct) characters for Turing Completeness&lt;/a&gt;)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Challenge:&lt;/h2&gt;&#xA;&lt;p&gt;In any language you choose, find the greatest number of distinct and disjoint subsets of characters allowed in that language (i.e. no individual character is in more than one of the subsets), each of which separately makes the language Turing-complete.&lt;/p&gt;&#xA;&lt;h2&gt;Example:&lt;/h2&gt;&#xA;&lt;p&gt;JS (2): &lt;code&gt;eval()&amp;quot;\u0123456789bcdf&lt;/code&gt;, &lt;code&gt;[]+=`&lt;/code&gt; (see answer to linked question).&lt;/p&gt;&#xA;&lt;h2&gt;Scoring:&lt;/h2&gt;&#xA;&lt;p&gt;Scoring is by total number of distinct Turing-complete subsets found. Higher scores are better. In case of a tie, the answer with the fewest total characters used across all subsets wins.&lt;/p&gt;&#xA;&lt;h2&gt;Notes:&lt;/h2&gt;&#xA;&lt;p&gt;Execution of arbitrary code is not required, only Turing completeness.&lt;/p&gt;&#xA;&lt;p&gt;Explanations of why each of your subsets are Turing complete are highly encouraged.&lt;/p&gt;&#xA;&lt;p&gt;In case this was unclear, whitespace characters are still counted as characters.&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox notes:&lt;/h2&gt;&#xA;&lt;p&gt;Should I include some stipulation forbidding languages such as Unary which don't care about the particular characters used?&lt;br&gt;What is unclear about this specification? Where could I give a better/more complete explanation?&lt;/p&gt;&#xA;" OwnerUserId="66566" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-08-14T20:20:37.910" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16799" PostTypeId="2" ParentId="2140" CreationDate="2018-08-14T20:38:51.057" Score="1" Body="&lt;h1&gt;Golf me some Golf&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program to play Golf solitaire!&lt;br&gt;&#xA;(I'm somewhat surprised that I haven't seen this pun yet.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;How to play&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Golf uses a standard 52 card deck. Play begins with 7 stacks of 5 cards each, one card forming the foundation, and the remaining 16 cards forming the stock. There are two legal moves:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Move a card from the top of a stack to the foundation (must be one rank higher or lower)&lt;/li&gt;&#xA;&lt;li&gt;Draw the top card of the stock and place it on the foundation&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The number of cards remaining in the tableau when you run out of moves is your score, with zero being a perfect game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To make things easier, queens may be played on kings, and aces and kings can be played on each other. Also, while the stock is normally face-down, you will be able to read it all at once.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input to your program will be 7 lists of 5 cards representing the tableau (with the last cards on top) plus 1 list of 17 representing the stock (the last card being the foundation). These lists can be flattened as desired (you can take 1 list of 35 and 1 list of 17, or just 1 list of 52). Cards are represented as numbers 0-12.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program should output a list (or string) of numbers 0-7 representing the moves in a game of Golf. The numbers 0-6 represent playing a card from a column to the foundation, and 7 represents drawing a card from the stock. Any illegal moves (including playing from an empty column or stock) will disqualify your program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your score is the number of bytes in your program plus 2 bytes per card left on the stock after running through the 18 games in the scoring set. The program with the lowest score wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Example output: (coming soon)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Scoring set: (coming soon)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All games in the scoring set are solvable. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Sandbox questions:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;s&gt;Is code-golf appropriate for this scoring metric, or would code-challenge be more appropriate?&lt;/s&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;s&gt;Should I do away with the scoring metric, and just require the games to be solved completely?&lt;/s&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Would it be more interesting to include some unsolvable games in the scoring set to make programs handle that case gracefully?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="55946" LastEditorUserId="55946" LastEditDate="2018-08-31T15:45:15.777" LastActivityDate="2018-08-31T15:45:15.777" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16802" PostTypeId="2" ParentId="14737" CreationDate="2018-08-16T13:57:31.680" Score="16" Body="&lt;h1&gt;&lt;a href=&quot;https://www.r-project.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;R&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;R is a free software environment for statistical computing and graphics. It compiles and runs on a wide variety of UNIX platforms, Windows and MacOS. It is available on &lt;a href=&quot;https://tio.run/#R&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it Online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Why is it a good candidate?&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It has a small community of active golfers. There are no more than 6 or 7 members who regularly post answers in R. There ought to be more!&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It is a general-purpose language, meaning it can be used to answer all questions on this site. Though to be honest processing strings requires a bit of flexibility.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Its vectorized syntax allows for concise answers in case for multiple input.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;R is a functional programming language - almost everything is a function - including things that you would think (thanks to the parser) are just operators. This can yield some very powerful golfs, as displayed &lt;a href=&quot;https://codegolf.stackexchange.com/a/171490/67312&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Environments, combined with lexical scoping are a power feature of the language.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It is really good at plotting stuff.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And most importantly: Golfing R is fun :)&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/4024/tips-for-golfing-in-r&quot;&gt;Here is the R golfing tips post.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Resources to learn R:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://stats.stackexchange.com/questions/138/free-resources-for-learning-r&quot;&gt;This Cross-Validated post&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Online Interpreters&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#R&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try It Online!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://rdrr.io/&quot; rel=&quot;nofollow noreferrer&quot;&gt;RDRR&lt;/a&gt; (includes most of the packages available for R)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="80010" LastEditorUserId="67312" LastEditDate="2020-08-31T18:29:29.717" LastActivityDate="2020-08-31T18:29:29.717" CommentCount="1" CommunityOwnedDate="2018-08-16T13:57:31.680" ContentLicense="CC BY-SA 4.0" />
  <row Id="16804" PostTypeId="2" ParentId="14737" CreationDate="2018-08-17T06:34:31.047" Score="3" Body="&lt;h1&gt;Z80Golf&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://github.com/lynn/z80golf&quot; rel=&quot;nofollow noreferrer&quot;&gt;Z80Golf Machine&lt;/a&gt; | &lt;a href=&quot;http://sgate.emt.bme.hu/patai/publications/z80guide/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Z80 Assembly Materials&lt;/a&gt; | &lt;a href=&quot;http://www.ticalc.org/pub/text/z80/z80_reference.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;Z80 Opcode Reference (.txt)&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://esolangs.org/wiki/Z80golf&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolangs&lt;/a&gt; | &lt;a href=&quot;http://savannah.nongnu.org/projects/z80asm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Assembler&lt;/a&gt; | &lt;a href=&quot;https://tio.run/#z80golf&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt; | Chatroom (N/A) | Tips (N/A)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Z80Golf is a &lt;strong&gt;machine code&lt;/strong&gt; language for &quot;Z80 Code Golf Machine&quot; by mokehehe, originally designed for anarchy golf. While Z80Golf has been used for several years on anagol, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/155018/the-programming-language-quiz-mark-ii-cops/155252?s=19|6.8940#155252&quot;&gt;it was only recently introduced to PPCG by Lynn this year&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The specification of the Z80Golf machine is as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Z80Golf programs are binary files (.z8b). On initialization, the binary is copied to the address &lt;code&gt;$0000&lt;/code&gt;, and the rest of memory (up to &lt;code&gt;$FFFF&lt;/code&gt;) is padded with zeroes. All the registers are zero as well: &lt;code&gt;AF&lt;/code&gt;, &lt;code&gt;BC&lt;/code&gt;, &lt;code&gt;DE&lt;/code&gt;, &lt;code&gt;HL&lt;/code&gt;, &lt;code&gt;IX&lt;/code&gt;, &lt;code&gt;IY&lt;/code&gt;, &lt;code&gt;SP&lt;/code&gt; (stack pointer), and &lt;code&gt;PC&lt;/code&gt; (programming counter).&lt;/li&gt;&#xA;&lt;li&gt;Whenever the PC reaches &lt;code&gt;$8000&lt;/code&gt;, the value in the register &lt;code&gt;A&lt;/code&gt; is written to standard output, and then a &lt;code&gt;RET&lt;/code&gt; instruction is simulated. (In other words, &lt;code&gt;call $8000&lt;/code&gt; is like &lt;code&gt;putchar A&lt;/code&gt;.)&lt;/li&gt;&#xA;&lt;li&gt;Whenever the PC reaches &lt;code&gt;$8003&lt;/code&gt;, the machine tries to read a single byte from standard input. On EOF, the carry flag is set and &lt;code&gt;A&lt;/code&gt; is left unchanged. Otherwise, the carry flag is cleared and &lt;code&gt;A&lt;/code&gt; is set to the value read. Finally, a &lt;code&gt;RET&lt;/code&gt; isntruction is simulated. (In other words, &lt;code&gt;call $8003&lt;/code&gt; is like &lt;code&gt;getchar A&lt;/code&gt;.)&lt;/li&gt;&#xA;&lt;li&gt;The program keeps running until &lt;code&gt;HALT&lt;/code&gt; is executed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Since every submission is a binary, &lt;code&gt;xxd&lt;/code&gt; output format is used in TIO.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Why Z80Golf?&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;strong&gt;the first machine code nomination&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Unlike x86 and other architectures used for machine code golfing on PPCG, Z80Golf machine has &lt;strong&gt;absolutely zero boilerplate for writing full programs&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;While its instruction set is identical to e.g. TI calculators, complete lack of peripherals gives &lt;strong&gt;greater room for creativity&lt;/strong&gt;. For example...&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can underflow your own stack into code,&lt;/li&gt;&#xA;&lt;li&gt;You can write &lt;code&gt;$76&lt;/code&gt; in the code region to halt your program like Befunge and &gt;&amp;lt;&gt;,&lt;/li&gt;&#xA;&lt;li&gt;You can manipulate somewhere in memory to do something entirely different each iteration,&lt;/li&gt;&#xA;&lt;li&gt;...and so on!&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Unlike many other nominations, &lt;strong&gt;this language is quite old&lt;/strong&gt; (several decades for Z80 itself, and at least 8 years for Z80Golf machine), yet it was introduced recently to PPCG. As a consequence, &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=is%3Aanswer+z80golf&quot;&gt;PPCG has &lt;strong&gt;only 21 Z80Golf answers by only 3 users so far&lt;/strong&gt; as of writing (Aug 17, 2018)&lt;/a&gt;. Since Z80Golf is capable of lots of convoluted things, we desperately need more intra-language competition.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Showcase&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Insanely clever &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world/166951?s=17|8.8300#166951&quot;&gt;&quot;Hello, World!&quot;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Super short &lt;a href=&quot;https://codegolf.stackexchange.com/questions/121056/output-with-the-same-length-as-the-code/170528?s=16|9.3650#170528&quot;&gt;Output with the same length as the code&lt;/a&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Uses all three creativity points shown above.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/155018/the-programming-language-quiz-mark-ii-cops/155252?s=19|6.8940#155252&quot;&gt;You can fool others with the binary code being fully ASCII&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/132558/i-double-the-source-you-double-the-output/170523?s=15|9.4568#170523&quot;&gt;I double the source, You double the output!&lt;/a&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Hide the &lt;code&gt;HALT&lt;/code&gt; inside a multibyte instruction, and directly return to it.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/69/golf-you-a-quine-for-great-good/170397?s=12|10.6695#170397&quot;&gt;The first proper machine code quine ever.&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/13152/shortest-code-to-produce-infinite-output/170408?s=6|12.9263#170408&quot;&gt;Zero-byte program is infinite output :)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2018-08-17T06:34:31.047" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16806" PostTypeId="2" ParentId="2140" CreationDate="2018-08-17T19:00:43.783" Score="2" Body="&lt;h1&gt;Chain Classification&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/159629/31957&quot;&gt;related&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Objective:&lt;/strong&gt; Write a program (whose index in the chain of answers is \$n\$) which, when given any program with index \$i\$ (\$ 1 \le i \le n\$), outputs \$i\$.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(The program may do anything else given any other string input, including but not limited to: crashing, erorring, returning other numbers, sending an email to google support, and simulating the universe.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program may be in any language &lt;em&gt;that has not appeared in the answer chain yet&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You may output to STDOUT, STDERR, return as a function value, etc. Any reasonable method of output.&lt;/li&gt;&#xA;&lt;li&gt;You may take input from STDIN, command line arguments, function parameters, etc. Any reasonable method of input.&lt;/li&gt;&#xA;&lt;li&gt;You &lt;strong&gt;must&lt;/strong&gt; output &lt;code&gt;1&lt;/code&gt; for the first answer, &lt;code&gt;2&lt;/code&gt; for the second, etc. Any other form of indexing is not allowed.&lt;/li&gt;&#xA;&lt;li&gt;You must use base 10 when outputting.&lt;/li&gt;&#xA;&lt;li&gt;You may not use the internet in any way, particularly to scrape the answers to this question.&lt;/li&gt;&#xA;&lt;li&gt;No person may answer twice in a row.&lt;/li&gt;&#xA;&lt;li&gt;No person may answer within 1 hour of their previous answer.&lt;/li&gt;&#xA;&lt;li&gt;Languages which differ by version are considered distinct. Thus, Python 2 and Python 3 can both be part of the chain.&lt;/li&gt;&#xA;&lt;li&gt;Languages which differ by compiler or interpreter are &lt;strong&gt;not&lt;/strong&gt; considered distinct. So, &lt;a href=&quot;https://tio.run/##K6gsycjPM9ZNBtP/gQAA&quot; rel=&quot;nofollow noreferrer&quot;&gt;Python 3 (Cython)&lt;/a&gt; and &lt;a href=&quot;https://tio.run/##K6gsycjPM/4PBAA&quot; rel=&quot;nofollow noreferrer&quot;&gt;Python 3&lt;/a&gt; are equivalent.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Answer format&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# N. Language&#xA;&#xA;    code&#xA;&#xA;explanation&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try It Online&lt;/a&gt; links are appreciated, as well as links for the language itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You &lt;strong&gt;must&lt;/strong&gt; include how your program performs input and output.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The first answer is:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;1. &lt;a href=&quot;https://github.com/ConorOBrien-Foxx/Alumin&quot; rel=&quot;nofollow noreferrer&quot;&gt;Alumin&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;h&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##S8wpzc3M@/8/A4gA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Alumin – Try It Online&quot;&gt;Try it online!&lt;/a&gt; Input and output through STDIN and STDOUT.&lt;/p&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2018-08-17T19:00:43.783" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="16809" PostTypeId="2" ParentId="2140" CreationDate="2018-08-18T23:46:16.010" Score="1" Body="&lt;h1&gt;Should I index like this or like that? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Let's take a 0-indexed array of length \$l\$. You can index into it with \$i\$, where \$-l\le i&amp;lt;l\$, and the returned element is the element in position \$[i&amp;lt;0]\times l+i\$ (\$[\dots]\$ is the &lt;a href=&quot;https://en.wikipedia.org/wiki/Iverson_bracket&quot; rel=&quot;nofollow noreferrer&quot;&gt;Iverson bracket&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In some cases, it's shorter to use a negative index instead of a positive one, counting the minus sign and the digits as bytes. For example, if we want the \$102\$th element of an array with \$104\$ elements, indexing with \$101\$ and \$-3\$ will both give the same result. However, if we write the numbers in code, &lt;code&gt;101&lt;/code&gt; is 3 bytes long, while &lt;code&gt;-3&lt;/code&gt; is 2 bytes long, so we prefer &lt;code&gt;-4&lt;/code&gt;. In other cases, using a negative index is counterproductive (for a code golfer). Such an example is the will to obtain the \$4\$th element of a \$10\$-element array. In this case, we can use \$3\$ and \$-7\$, but &lt;code&gt;-7&lt;/code&gt; is longer than &lt;code&gt;3&lt;/code&gt;, so we'll choose &lt;code&gt;3&lt;/code&gt; instead.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given two inputs \$l\$ and \$i\$, where \$l&amp;gt;0\$ (it doesn't make sense to index into an empty array) and \$0\le i&amp;lt;l\$ (or \$-l\le i&amp;lt;0\$, be consistent), your job is to determine whether positive or negative indexing is better for code golfing purposes. In case both are of the same length, you may return either decision, even inconsistently. The returned value must be one of two distinct and consistent values, defined by the answerer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, using &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/41024&quot;&gt;standard loopholes&lt;/a&gt; isn't fun, so, if you do use any, then, sorry, your answer isn't valid. ;-)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Here, &lt;code&gt;1&lt;/code&gt; is used for negative indexing and &lt;code&gt;0&lt;/code&gt; for positive. I also always prefer using positive indices, but you may prefer otherwise.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;l     i           (actual index)&#xA;----- ----- ----- -----&#xA;    1     0     0     0&#xA;   10     9     0     9&#xA; 1000   999     1    -1&#xA;10000  9755     1  -245&#xA;  101   100     1    -1&#xA;  150   141     1    -9&#xA;  150   140     0   140&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2018-08-18T23:46:16.010" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16811" PostTypeId="1" AcceptedAnswerId="16812" CreationDate="2018-08-20T12:52:41.597" Score="1" ViewCount="106" Body="&lt;p&gt;I enjoy using Power Query &quot;M&quot; language (&lt;a href=&quot;https://msdn.microsoft.com/en-us/query-bi/m/power-query-m-reference&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Microsoft Reference&quot;&gt;Microsoft Reference&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this language permitted - and in cases where the language name is to be used, should this be referred to as &lt;code&gt;M&lt;/code&gt;, &lt;code&gt;Power Query&lt;/code&gt;, &lt;code&gt;Power Query M Language&lt;/code&gt; or something else?&lt;/p&gt;&#xA;" OwnerUserId="82376" LastActivityDate="2018-08-20T19:24:15.000" Title="Can I use Power Query &quot;M&quot; Language - and what should it be called?" Tags="|discussion|languages|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16812" PostTypeId="2" ParentId="16811" CreationDate="2018-08-20T13:38:24.317" Score="3" Body="&lt;p&gt;&lt;s&gt;As long as the language you mean to use falls into &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2028/what-are-programming-languages/2073#2073&quot;&gt;PPCG's definition of a programming language&lt;/a&gt;, you're free to use it.&lt;/s&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As Nathan pointed out, PPCG &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10426/20198&quot;&gt;doesn't even require you to answer in a programming language&lt;/a&gt;, so yes, feel free to use whatever language you like.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regarding what you should call it, there's no specific answer to that. As Pavel suggested, you can just use the name you feel is appropriate and link to the language's official page.&lt;/p&gt;&#xA;" OwnerUserId="74163" LastEditorUserId="74163" LastEditDate="2018-08-20T19:24:15.000" LastActivityDate="2018-08-20T19:24:15.000" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16813" PostTypeId="2" ParentId="8900" CreationDate="2018-08-20T15:33:48.960" Score="4" Body="&lt;h1&gt;FAQs&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;How big should my map be?&lt;/strong&gt;  As small as possible.  There are three solutions here:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Scaling map. You often see this in the form of &amp;quot;Side length is equal to &lt;code&gt;5*PlayerCount&lt;/code&gt;&amp;quot;.  &lt;strong&gt;Please do not do this.  If you want a scaling map, you want &lt;code&gt;X*sqrt(PlayerCount)&lt;/code&gt;.&lt;/strong&gt;  With the original equation, if there are 100 players, there are 250,000 squares, while only 625 squares with 5 players.  The distance between players gets bigger and bigger with more players.&lt;/li&gt;&#xA;&lt;li&gt;Fixed size map.  I actually really like these.  You often combine this with a fixed game size, so this often means that not all players are in all games, or that games will have duplicate players.  Both of these usually aren't problems (and may actually increase potential strategy)&lt;/li&gt;&#xA;&lt;li&gt;No map at all. &lt;strong&gt;Maps are overused.&lt;/strong&gt; As a comparison to board games, how many games have you played where you are a dude walking around doing stuff?  Even games like Risk have a map, but it is drastically different than maps we use in our KotHs.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;How do I ensure that games are fast?&lt;/strong&gt; There are several things you can do:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Provide fast sample bots&lt;/li&gt;&#xA;&lt;li&gt;Provide a fast &amp;quot;helper API&amp;quot; for common actions&lt;/li&gt;&#xA;&lt;li&gt;Reduce randomness&lt;/li&gt;&#xA;&lt;li&gt;Require same-language submissions&lt;/li&gt;&#xA;&lt;li&gt;Place a time limit (submissions must have an average of Xms response time over Y turns)&lt;/li&gt;&#xA;&lt;li&gt;Make each turn count&lt;/li&gt;&#xA;&lt;li&gt;Cache bot responses.  Cache path-finding.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;How do I prevent cheating?&lt;/strong&gt;.  Simply mentioning in the post what isn't allowed is all you need.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Who wins?&lt;/strong&gt;.  This is a question people should ask more:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;code&gt;A&lt;/code&gt; comes in 1st 50 times, and last 50 times, and &lt;code&gt;B&lt;/code&gt; comes in 1st 30 times and 2nd 70 times, who wins?&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;A&lt;/code&gt; wins 50 times with score of 20, and &lt;code&gt;B&lt;/code&gt; wins 30 times with a score of 100, who wins?&lt;/li&gt;&#xA;&lt;li&gt;If the top 3 players beat each other in a Rock-Paper-Scissors style, who wins?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;How do I get more players?&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Make the rules as simple as possible&lt;/li&gt;&#xA;&lt;li&gt;Add images to your post, especially visualizations of the game in progress&lt;/li&gt;&#xA;&lt;li&gt;Make the controller easy to download and run (&lt;strong&gt;Remove ALL known bugs beforehand&lt;/strong&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Require all submissions be in the same language (makes it easier to run/modify other submissions)&lt;/li&gt;&#xA;&lt;li&gt;Make the post as easy to read as possible.&lt;/li&gt;&#xA;&lt;li&gt;Add an easy-to-use helper API&lt;/li&gt;&#xA;&lt;li&gt;Add sample bots&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;I'm having trouble coming up with ideas.&lt;/strong&gt; Here are some interesting concepts that you can build off of:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Variable-time turns.  Some turns may take longer, allowing other players to do multiple actions.&lt;/li&gt;&#xA;&lt;li&gt;Secret-secret knowledge.  Your opponents can see some of what you have, but not all of it.  You don't know what your opponent can see.&lt;/li&gt;&#xA;&lt;li&gt;Alternate roles.  Some players have different goals than other players.  Those goals can either be opposing, or they can be adjacent (which is often more interesting).&lt;/li&gt;&#xA;&lt;li&gt;Multiple pieces.  Like in chess, a bot can control more than one &amp;quot;object&amp;quot;.  This leads to better and more interesting coordination.&lt;/li&gt;&#xA;&lt;li&gt;Collaboration.  Have certain actions assist other bots. (Consider if people can submit multiple, collaborative bots)&lt;/li&gt;&#xA;&lt;li&gt;Real-time bots.  Spawn each bot as its own thread, and make the game continuous instead of turn based.  (Don't make moves computationally difficult:  You don't want people fighting over computer resources)&lt;/li&gt;&#xA;&lt;li&gt;Build-a-bot:  Allow players to choose characteristics of their bot that persist.  (Think Pokemon:  Choose stats, or choose abilities, etc)&lt;/li&gt;&#xA;&lt;li&gt;Finite resources.  Players want different resources, and there aren't enough to go around.  Make players choose which resource they really want.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-08-27T04:25:13.193" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16814" PostTypeId="2" ParentId="2140" CreationDate="2018-08-20T15:56:53.427" Score="1" Body="&lt;h1&gt;Fuzzy Circles&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Edit&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I don't actually like this challenge all that much. Anyone who wants it can have it, else I'll get rid of it.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Background&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For a real number &lt;em&gt;x&lt;/em&gt;, let ⌊x⌋ be the greatest integer less than or equal to &lt;em&gt;x&lt;/em&gt;. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given an input &lt;em&gt;n&lt;/em&gt;, find the minimum radius of the circle such that all points that satisfy the following equation are on its interior or border.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;⌊x⌋^2+⌊y⌋^2 = &lt;em&gt;n&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;: A real number &lt;em&gt;n&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;: A real number representing the radius of the smallest circle that contains in its interior or border all points that satisfy ⌊x⌋^2+⌊y⌋^2 = &lt;em&gt;n&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note&lt;/strong&gt;: The precision expected in this challenge is two decimal places, both for the input and output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test Cases (More to be added):&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;25&lt;/code&gt;-&gt;&lt;code&gt;5.70&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="82007" LastEditorUserId="82007" LastEditDate="2018-08-20T18:39:49.887" LastActivityDate="2018-08-20T18:39:49.887" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16816" PostTypeId="1" CreationDate="2018-08-22T11:40:23.490" Score="26" ViewCount="410" Body="&lt;p&gt;I had a small programming problem,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/170863/checking-a-file-contains-only-null-bytes&quot;&gt;Checking a file contains only null bytes&lt;/a&gt;. Having&#xA;chanced on PPCG a few days before, I thought this could be an&#xA;interesting place to see various ways someone might go about it,&#xA;since answers look pretty imaginative.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I did not realize how tightly the problems have to be stated, how&#xA;constrained, in order to make it an undisputable competition. I am&#xA;more interested in ideas, and never dreamed of constraining so much&#xA;problem statements. Creativity sometimes comes from finding the right&#xA;constraint to lift.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also see from some solutions that PPCG ideas are often less than&#xA;practical. I did get several warnings on that, but only after my&#xA;question had been posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Whatever my motivations, I feel there has been a real misunderstanding.&#xA;I have been actively contributing to many SE sites, and I was taken by&#xA;surprise as this site works very differently from all others I&#xA;visited.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It could be wise to warn very strongly, with precise procedure to&#xA;follow (sandbox), newcomers to this site, telling them it has a very&#xA;different way of doing things. I had come to rely on my knowledge of&#xA;SE. I did get a warning from Rushabh Mehta, but pretty much what I&#xA;expect anywhere. The specificity of PPCG in the way it works (not in&#xA;topic) is not emphasized.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Well, there is not much more that I can say, other than thanking all&#xA;the decent people who tried to help me. It turns out that I cannot&#xA;afford the time to do more on my question, and that was why I offered/suggested&#xA;to have it removed. Actually, writing this note is my only way to try&#xA;making a constructive contribution. I hope it is seen positively.&lt;/p&gt;&#xA;" OwnerUserId="82362" LastEditorUserId="82362" LastEditDate="2018-08-22T16:27:04.950" LastActivityDate="2018-08-22T16:27:04.950" Title="The view from a newcomer (or an unwary traveller)" Tags="|discussion|policy|new-users|" AnswerCount="1" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="16817" PostTypeId="2" ParentId="16816" CreationDate="2018-08-22T14:45:47.147" Score="17" Body="&lt;p&gt;Hello and Welcome to PPCG!&lt;/p&gt;&#xA;&lt;p&gt;Indeed, while PPCG is somewhat different from the main Stack Overflow site, there is a lot of information about questions that can be found in the Help pages, specifically &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;the on-topic page&lt;/a&gt; and the pages this links to.&lt;/p&gt;&#xA;&lt;p&gt;the on-topic page states:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;All challenge questions on this site should have:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A clear specification of what constitutes a correct submission, so that it is possible to indisputably decide whether an entry is valid or not. Test cases are highly encouraged.&lt;/li&gt;&#xA;&lt;li&gt;An objective primary winning criterion, so that it is possible to indisputably decide which entry should win.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;These questions are surprisingly hard to write well. It is advisable to follow a standard template and to post them first and get feedback in the meta Sandbox so that flaws can be fixed before someone posts an answer which exploits them.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;And then has links to a standard template found at &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1511/template-for-challenges&quot;&gt;Template For Challenges&lt;/a&gt;, as well as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;a sandbox&lt;/a&gt; where you can propose your challenge in a controlled environment and get feedback on it so it can be perfected.&lt;/p&gt;&#xA;&lt;p&gt;The on-topic page also states:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;However, if you have a general programming question, it should be asked on Stack Overflow or a different Stack Exchange site.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;A lot of users on this site would consider your challenge, and especially the extra details you give, to be a general programming question and as such off-topic for this site, and I respectfully tend to agree with it. That is not to say that it is a poor challenge to propose. The challenge itself is something with clear definitions (given an input of a file name, return a truthy value if the file has only nullbytes, falsey otherwise), which lends itself well to this stack.&lt;/p&gt;&#xA;&lt;p&gt;However, the intent of this site is for theoretical answers to theoretical challenges. It is not recommended to use any answer to any question on this site unless you understand what it does, and more importantly what it does not do. A lot of these answers sacrifice usability, performance, readability, security, portability or a combination of all these factors in return for minor improvements in their score. They can have a solution which takes 3 hours to complete for nontrivial results, or a solution that only works on a certain version of their language, or a solution that allows for remote code execution, or a solution that crashes your PC if the input is of the wrong type,... A solution can have any number of problems that are not apparent from a quick read.&lt;/p&gt;&#xA;&lt;p&gt;In the end, this site is a series of competitions. And as with any competition, users will attempt to do any number of things within the rules of the challenge to win it. That's why it is important to fill the bigger loopholes before posting something.&lt;/p&gt;&#xA;&lt;p&gt;I think in your situation, you chose the wrong site to ask this question on. A better solution would have been to choose a language yourself, write something that works, and then ask for advice on &lt;a href=&quot;https://codereview.stackexchange.com/&quot;&gt;Code Review&lt;/a&gt; on how to improve it.&lt;/p&gt;&#xA;&lt;p&gt;If you still want to participate in this community after these remarks and the ones you got on your question, you are welcome to post your challenge in the sandbox linked above. You should remove the elements where you say you want to use it yourself and try to adhere to the template in the other link. You can mention the part about the origin of the files (the dd copies) in the introduction to give some more clarity on the scope of the topic.&lt;/p&gt;&#xA;&lt;p&gt;Lastly, don't be discouraged by this early setback. PPCG is the hardest ICT-related site on the entire network to create good questions for, and one of the hardest in general along with Worldbuilding, Puzzles and Skeptics. It is why existing users strongly urge new users to first post their question in the sandbox. We can indeed be a bit strict about our scope, but it is necessary to ensure a fair competition.&lt;/p&gt;&#xA;" OwnerUserId="14141" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-08-22T14:49:38.413" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16819" PostTypeId="1" CreationDate="2018-08-22T17:25:24.100" Score="9" ViewCount="285" Body="&lt;h1&gt;Status quo&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We currently have seventy-four questions tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/palindrome&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;palindrome&amp;#39;&quot; rel=&quot;tag&quot;&gt;palindrome&lt;/a&gt;, but most of them contain a twist. As I see it, there are only two challenges about the basic palindrome string &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/11155/shortest-code-to-determine-if-a-string-is-a-palindrome&quot;&gt;Shortest code to determine if a string is a palindrome&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/110582/im-a-palindrome-are-you&quot;&gt;I'm a palindrome. Are you?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;While the first one is a basic decision problem challenge, it excludes punctuation, whitespace, control characters and letter case such that palindromic sentences are considered palindromes. To me, those are very human language specific exclusion and I do not feel like this challenge captures the core property of palindromic strings.&lt;br&gt;&#xA;Furthermore, it only asks for a &quot;method bod[y]&quot; -- not conforming to our current standard method of determining byte count.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While the second challenge linked to above actually defines palindromes as reading byte-for-byte the same from both directions, it is also a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; challenge -- which, to my eyes -- seems to be the far greater task.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is one other challenge with a palindromic theme I found -- which is not tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/palindrome&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;palindrome&amp;#39;&quot; rel=&quot;tag&quot;&gt;palindrome&lt;/a&gt; --,&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/168683/is-the-matrix-centrosymmetric-and-so-is-the-code&quot;&gt;Is the matrix centrosymmetric… and so is the code?&lt;/a&gt;,&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;which also is a restricted source challenge. Furthermore, this challenge focuses more on two-dimensional matrices rather than string palindromes (even though the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/palindrome&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;palindrome&amp;#39;&quot; rel=&quot;tag&quot;&gt;palindrome&lt;/a&gt; tag description could be interpreted as also covering this challenge).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;A new challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Based upon all of the above, I think it would be appropriate to have a new &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/palindrome&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;palindrome&amp;#39;&quot; rel=&quot;tag&quot;&gt;palindrome&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge which simply asks to decide whether or not a given ASCII string is a true palindrome, as in being byte-for-byte invariant under horizontal reflection.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It would be about nothing more, nothing less -- no restrictions on the source or other interpretations of what a palindrome is. It would also comply with our current byte count and I/O standards.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While this challenge will be trivially answerable in a lot of languages, there are definitely (especially esoteric) languages in which palindrome decision is no simple task.&lt;br&gt;&#xA;A pure palindrome decision program in such languages, however, is -- as I see it -- currently not a valid answer to any question.&lt;/p&gt;&#xA;" OwnerUserId="73111" LastEditorUserId="59487" LastEditDate="2018-08-23T16:00:46.377" LastActivityDate="2018-08-25T18:22:29.410" Title="A simple, clean and modern challenge about palindromes" Tags="|discussion|challenge-quality|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16823" PostTypeId="2" ParentId="2140" CreationDate="2018-08-24T04:10:52.820" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/171122/lucas-and-fibonacci-are-in-pair&quot;&gt;Lucas and Fibonacci are in pair&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="71546" LastEditorUserId="71546" LastEditDate="2018-08-24T07:05:02.147" LastActivityDate="2018-08-24T07:05:02.147" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16825" PostTypeId="2" ParentId="2140" CreationDate="2018-08-24T11:54:37.370" Score="0" Body="&lt;h1&gt;Delimiter-Chaos&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program of at most 150 bytes length that produces different outputs (to stdout) if you insert token-delimiters into the source code. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Score&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The program with the highest number of different outputs wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For this challenge, we assume that the source code is tokenized prior to compilation/ interpretation.&#xA;A &lt;strong&gt;delimiter&lt;/strong&gt; is any character which, when inserted at a given position, changes the way the source code is tokenized, but is not part of a token on its own.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(python)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a = &quot;0&quot;&#xA;b = &quot;0&quot;&#xA;ainb=&quot;12&quot;&#xA;print(ainb)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This prints 12.&#xA;If you insert two spaces, you get:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a = &quot;0&quot;&#xA;b = &quot;0&quot;&#xA;ainb=&quot;12&quot;&#xA;print(a in b)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which prints &quot;True&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This gives a total score of 2 for 2 (known) different outputs&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rule clarifications&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Only program versions that exit with zero error code count towards the score.&lt;/li&gt;&#xA;&lt;li&gt;All versions have to be listed explicitly in the answer.&lt;/li&gt;&#xA;&lt;li&gt;Put the score into the title of the answer.&lt;/li&gt;&#xA;&lt;li&gt;If your code produces different outputs in different programming languages, they count.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41804" LastActivityDate="2018-08-24T11:54:37.370" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16828" PostTypeId="2" ParentId="2140" CreationDate="2018-08-24T20:51:56.053" Score="-2" Body="&lt;h1&gt;Largest and Smallest Numbers Printable&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/palindrone&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;palindrone&amp;#39;&quot; rel=&quot;tag&quot;&gt;palindrone&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Related: &lt;a href=&quot;https://codegolf.stackexchange.com/q/18028/48922&quot;&gt;Largest Number Printable&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your goal is to write code that produces a large number. However, when your code is reversed, you must output a &lt;em&gt;small&lt;/em&gt; number. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No constants over 10 (like the other challenge)&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;No numeric literals&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;No infinite numbers&lt;/li&gt;&#xA;&lt;li&gt;Each program can only output one number&lt;/li&gt;&#xA;&lt;li&gt;You must have at least two bytes in your program.&lt;/li&gt;&#xA;&lt;li&gt;Your small number must be less than your large number.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Scoring:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your score is: \$\frac{code~length}{N_{large} - N_{small}}\$. Smallest score wins.&lt;/p&gt;&#xA;" OwnerUserId="48922" LastEditorUserId="48922" LastEditDate="2018-08-25T14:49:23.187" LastActivityDate="2018-08-25T14:49:23.187" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16829" PostTypeId="2" ParentId="2140" CreationDate="2018-08-24T23:14:31.697" Score="0" Body="&lt;h1&gt;Write in Ge'ez!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Ge%27ez&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ge'ez&lt;/a&gt; is a now-dead language used for liturgy in the Ethiopian Orthodox Church. It's traditionally written in a very distinctive script with many loops and curves. But for ease of reading, it's often transliterated into Latin letters.&lt;/p&gt;&#xA;&lt;p&gt;Your task here is to take some writing in Latin characters and convert it to the Ge'ez script. For example, the input &lt;code&gt;gəʿəz&lt;/code&gt; (the name of the language) should give the output &lt;code&gt;ግዕዝ&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;p&gt;Every letter in the Ge'ez script represents both a consonant and the following vowel. There are eight vowels&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ä u i a e ə o wa&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and twenty-six consonants&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;h l ḥ m ś r s ḳ b t ḫ n ʾ k w ʿ z y d g ṭ p̣ ṣ ḍ f p&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;which give 208 combinations. (In reality, some of these combinations like &amp;quot;wwa&amp;quot; don't actually happen, and there are some extra letters like &amp;quot;mya&amp;quot; not covered by this system, but ignore all that for the purposes of the challenge.)&lt;/p&gt;&#xA;&lt;p&gt;The combinations are encoded in a convenient way in Unicode. The consonant defines the starting position, and the vowel defines the offset.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;C    start (hex)&#xA;----------------&#xA;h    1200&#xA;l    1208&#xA;ḥ    1210&#xA;m    1218&#xA;ś    1220&#xA;r    1228&#xA;s    1230&#xA;q    1240&#xA;b    1260&#xA;t    1270&#xA;x    1280&#xA;n    1290&#xA;ʾ    12A0&#xA;k    12A8&#xA;w    12C8&#xA;ʿ    12D0&#xA;z    12D8&#xA;y    12E8&#xA;d    12F0&#xA;g    1308&#xA;ṭ    1320&#xA;p̣    1330&#xA;ṣ    1338&#xA;ḍ    1340&#xA;f    1348&#xA;p    1350&#xA;&#xA;V    offset&#xA;-----------&#xA;ä    +0&#xA;u    +1&#xA;i    +2&#xA;a    +3&#xA;e    +4&#xA;ə    +5&#xA;o    +6&#xA;wa   +7&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Again, reality is a bit more complicated, but ignore that for the challenge.)&lt;/p&gt;&#xA;&lt;p&gt;Your task is to take a string written in Latin letters, and output the corresponding Ge'ez syllables. If a consonant is followed by a vowel, add the consonant's start point to the vowel's offset, and print the corresponding Unicode character. If a consonant is not followed by a vowel, use the start point with no offset (as if the vowel were &lt;code&gt;ä&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;p&gt;Input is a Unicode string, or a list of Unicode codepoints as integers. Output is a Unicode string, or a list of Unicode codepoints as integers. A &amp;quot;Unicode string&amp;quot; here can be in any official encoding (UTF-7, UTF-8, UTF-16, UTF-32…). NFC and NFD are both acceptable.&lt;/p&gt;&#xA;&lt;p&gt;This is code golf; shortest code (in bytes) in each language wins. Standard loopholes forbidden.&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;gəʿəz    ግዕዝ&#xA;[TODO more to come here]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="46085" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-08-25T03:15:53.447" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16831" PostTypeId="2" ParentId="16819" CreationDate="2018-08-25T18:17:12.553" Score="11" Body="&lt;p&gt;I'd divide this into two questions:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Would the proposed challenge be acceptable according to our rules?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Keeping to our rules means the challenge must be on topic, with an objective winning criterion, and not a duplicate. It is certainly on topic, has &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; as a winning criterion (the most objective of all winning criteria), and there seems to be no suggestion that it is a duplicate. If anyone is aware of an existing challenge that has competitive answers that could be trivially migrated to be competitive answers to this new challenge, please let us know.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Would the proposed challenge be welcomed here?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a mystery. I would guess that it would get a mixture of upvotes and downvotes, and cause a flurry of discussion which would then calm down, but that can only be a guess.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Personally, I'm strongly in favour of not excluding potential challenges without good reason. I don't see &quot;Too easy in my language&quot; as a good reason. I understand that some people are dismayed at the impression of our site that is created by trivial challenges getting into the Hot Network Questions, but other challenges get into HNQ too, and I think having a range of different challenges there is a good thing. I don't think people who come to the site for a &quot;Hello World&quot; challenge should be less welcome, or are likely to make less contribution long term.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I arrived here through HNQ, and I didn't come for code golf at all, but for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; contests. I've still ended up contributing some golf challenges along the way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I see no reason that this challenge shouldn't be sandboxed, fine tuned, and then posted. The only question that remains is whether you want to be the one to do that. There will be a certain amount of discussion as always happens with simple challenges. If you're happy with that, please go ahead...&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2018-08-25T18:22:29.410" LastActivityDate="2018-08-25T18:22:29.410" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16832" PostTypeId="2" ParentId="2140" CreationDate="2018-08-26T14:56:41.570" Score="-1" Body="&lt;h1&gt;Pyramid of Bots&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this game, your bot is trying to get as high off the ground as possible. However, it can only stand on top of other bots, which are trying to get higher, too!&lt;/p&gt;&#xA;&lt;h2&gt;Overview&lt;/h2&gt;&#xA;&lt;p&gt;Your bot should be a Javascript function. It's return value should tell the program if the bot should move left, move right, or jump. Every bot starts out on a 2 dimensional grid, with a width and height set by &lt;code&gt;(botCount * 2) + 1&lt;/code&gt;. Bots are placed on either side of the center space, and every other bot is spaced 1 apart from any other bot. They all start at &lt;code&gt;y=0&lt;/code&gt;, and far left is &lt;code&gt;x=0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Gravity&lt;/h2&gt;&#xA;&lt;p&gt;If there is no bot on top of your bot, it can return the value &lt;code&gt;jump&lt;/code&gt;. When a bot jumps, it moves 1 square up. If at any point in time there is nothing under the bot, it moves down 1. A bot cannot return &lt;code&gt;jump&lt;/code&gt; if nothing is under it. If your bot is on top of another bot which moves left, your bot will fall.&lt;/p&gt;&#xA;&lt;h2&gt;Function params&lt;/h2&gt;&#xA;&lt;p&gt;Your function has 3 parameters: &lt;code&gt;dirs&lt;/code&gt;, &lt;code&gt;height&lt;/code&gt;, and &lt;code&gt;map&lt;/code&gt;. The array &lt;code&gt;dirs&lt;/code&gt; contains four boolean values, representing if there is a bot or arena border: below, to left, to right, above. The parameter &lt;code&gt;height&lt;/code&gt; is an array with 2 elements: your height, current winner's height. The &lt;code&gt;map&lt;/code&gt; array contains the height/width of the array, and then the amount of turns left in the game.&lt;/p&gt;&#xA;&lt;h2&gt;Running the game&lt;/h2&gt;&#xA;&lt;p&gt;In one game, the bot function will be run 800 times. Each of these is a turn. Your bot should return &lt;code&gt;jump&lt;/code&gt;, or a direction. The bot can only move in a direction if there is no bot currently there. The two directions are &lt;code&gt;left&lt;/code&gt; and &lt;code&gt;right&lt;/code&gt;. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are not allowed (when are they ever allowed??), and the bot who wins the most out of 1000 games is the winner.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-08-26T14:56:41.570" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16839" PostTypeId="2" ParentId="2140" CreationDate="2018-08-28T13:38:44.927" Score="1" Body="&lt;p&gt;&lt;strong&gt;Distinct Dice Sum Algorithm&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From a puzzle on &lt;a href=&quot;http://brainden.com/forum/index.php/topic/16576-dice-problem/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brainden&lt;/a&gt;. Paraphrasing,&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;What is the best set of 8 sided dice, each identical, such that 3 dice&#xA;  can generate 120 distinct sums? &quot;Best&quot; means the minimum highest sided&#xA;  die configuration.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;With 7 sided dice, the best possible sides for each (identical) die is: 1, 2, 8, 51, 60, 79, 83.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;For the sake of discussion, use sides=s, and dice=d.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note1: 120 is the maximum number of distinct sums with s=8, d=3. The formula is:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$&#xA;\frac{(s+d-1!)}{(s-1)!(d)!}&#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Similarly, for s=7, d=3, the formula gives 84. And brute force shows that a side of at least 83 is required for this easier problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note2: The lowest numbered side is always 1 for an optimal solution to the original question. (See comments.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question is, &quot;What's the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot;&gt;fastest algorithm&lt;/a&gt; to discover the minimum highest sided die for maximum distinct sums?&quot;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Specifically, is there some existing algorithm, or better yet, formula, for the minimum highest sided die? For determining all sides?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While there are obvious choices for languages, I'm not interested in that. I'm interested in the best algorithm possible in general. A sketch of the algorithm with the best (smallest) Big-O score wins. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Complexity of answers should be expressed by &lt;a href=&quot;https://en.wikipedia.org/wiki/Big_O_notation&quot; rel=&quot;nofollow noreferrer&quot;&gt;Big-O&lt;/a&gt; notation, e.g., M(s) = O(???), with d=3. Ties will be broken according to number of dice, i.e., M(s,d) = O(???).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a puzzle toy to idle time some years ago, I wrote a brute force solver. Unfortunately, for (s=8, d=3), and even knowing an upper limit, my program never completed the search (uptime was an issue).&lt;/p&gt;&#xA;" OwnerUserId="82187" LastEditorUserId="82187" LastEditDate="2018-09-05T15:01:12.737" LastActivityDate="2018-09-05T15:01:12.737" CommentCount="16" ContentLicense="CC BY-SA 4.0" />
  <row Id="16840" PostTypeId="2" ParentId="2140" CreationDate="2018-08-29T03:58:02.133" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/171605/75951&quot;&gt;Permutation Encoding&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Now posted to the main site. Check the revisions log if you want to see the WIP versions.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="75951" LastEditorUserId="75951" LastEditDate="2018-09-04T15:55:46.613" LastActivityDate="2018-09-04T15:55:46.613" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16843" PostTypeId="1" CreationDate="2018-08-30T09:21:18.413" Score="73" ViewCount="1344" Body="&lt;p&gt;With my dwindling activity over the last few months, this probably doesn't come as a surprise... but I've decided to hand in my diamond. My reasons are similar to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14876/8478&quot;&gt;Alex's, half a year ago&lt;/a&gt;, in that there are various things (none bad, thankfully) these days that take up my time otherwise, and recently I just haven't had much motivation for code golf (and by extension, moderating this community).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The other, fantastic mods have been doing a great job of handling the workload despite my recent absence, and so I don't think there will be an election immediately.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is hopefully not goodbye forever. While I'm not spending my time on recreational programming right now, I don't think I've written my last esolang, and when I get back into it, I'm sure I'll be golfing here again as well. Until then, I'll be lurking in the PPCG-Gaming chatroom for the foreseeable future and I'm always happy to help with any questions about my esolangs (just ask one of the mods to superping me if necessary), and to hand out any of my indefinite bounties should someone claim them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thanks to everyone who made this community a joy to spend time in and for putting your trust in me to moderate it over the last years, and I hope to see your somewhere down the road!&lt;/p&gt;&#xA;" OwnerUserId="8478" LastEditorUserId="12012" LastEditDate="2018-08-31T12:58:28.143" LastActivityDate="2018-08-31T12:58:28.143" Title="Farewell, for now" Tags="|discussion|moderators|" AnswerCount="4" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="16844" PostTypeId="1" CreationDate="2018-08-30T11:13:45.670" Score="9" ViewCount="360" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/16843/43319&quot;&gt;Martin Ender is stepping down as moderator.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We had &lt;a href=&quot;https://codegolf.stackexchange.com/election/2&quot;&gt;a moderator election&lt;/a&gt; only about half a year ago. There were three candidates, of which two were elected. The last candidate was &lt;a href=&quot;https://codegolf.stackexchange.com/election/2#post-154976&quot;&gt;PhiNotPi&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do we have to go through all the hassle of another election process or can we just offer the position to PhiNoPi.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it is highly unlikely that anybody else stands a chance in a full election.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2018-08-31T17:26:18.043" Title="So what happens now?" Tags="|discussion|policy|moderators|election|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16845" PostTypeId="2" ParentId="16843" CreationDate="2018-08-30T11:27:41.747" Score="27" Body="&lt;h2&gt;Thanks for being part of PPCG (and hopefully, its future)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Good luck with whatever the future holds for you, and thanks for moderating and participating in this community! Hoping to see you back as soon as possible, recalling the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/87482/hexaregex-a-tribute-to-martin-ender&quot;&gt;good&lt;/a&gt; ol' &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55574/dennis-doorknob-martin-b%C3%BCttner-chris-jester-young-pizzeria&quot;&gt;challenges&lt;/a&gt; dedicated to / inspired by you, and of course your &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35569/tweetable-mathematical-art/35601#35601&quot;&gt;&lt;em&gt;literally&lt;/em&gt; beautiful&lt;/a&gt; submissions :-)&lt;/p&gt;&#xA;" OwnerUserId="59487" LastActivityDate="2018-08-30T11:27:41.747" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16846" PostTypeId="2" ParentId="16843" CreationDate="2018-08-30T14:03:28.067" Score="5" Body="&lt;h1&gt;Don't be a stranger&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Back when I would just lurk in TNB, without any challenges or answers posted, interacting with folks like you greatly influenced my decision to join the community. You're a good guy so to restate the title of this answer, don't be a stranger. After all, we've been with you through life events like the changing of your last name which was stressful for everyone ;)&lt;/p&gt;&#xA;" OwnerUserId="51785" LastActivityDate="2018-08-30T14:03:28.067" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16847" PostTypeId="2" ParentId="16843" CreationDate="2018-08-30T18:17:22.640" Score="9" Body="&lt;p&gt;You were really good handling the diamond you were given by us, the community. Personally, you helped me get accustomed to this site and its norms very much, alongside the other then-moderators, a menace, a magpie and a doorknob.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your esoteric programming languages have always been challenging me, and you literally surprised everybody with some of your submissions. You especially handled CJam like a real expert, and nothing stopped you from going extreme from time to time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I remember &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/29985639#29985639&quot;&gt;the time you got married&lt;/a&gt;, as well as &lt;a href=&quot;https://computergraphics.meta.stackexchange.com/q/187/8992&quot;&gt;the time you stepped down from Computer Graphics Stack Exchange&lt;/a&gt;. Those must have been life-changing events. I hope this will be yet another event, and that your new life will be much more performing and better, and that your career will go on to be grand and fruitful.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, you stepping down from the moderator position isn't really a happy event for us, but, according to the reasons you've provided, I'd say it was the right decision. We've now got a refreshed team with a cat DJ and a penguin, as well as the same menace and doorknob we've had for a much longer time, so it will hopefully not be a great loss for the community. And, we can always open up a new election if necessary. ;-)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Enjoy the rest of your life, and, if you ever come back, you'll be more than welcome. :-)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Farewell.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2018-08-30T20:04:41.957" LastActivityDate="2018-08-30T20:04:41.957" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16848" PostTypeId="2" ParentId="2140" CreationDate="2018-08-30T18:28:05.233" Score="0" Body="&lt;h2&gt;Compute strings with a fixed distance&lt;/h2&gt;&#xA;&lt;p&gt;Consider a binary string of total length N. For example 000111000111 with &lt;span class=&quot;math-container&quot;&gt;\$N=12\$&lt;/span&gt;. We can store this string more efficiently by just recording the indices where bits are first flipped. In this case &lt;span class=&quot;math-container&quot;&gt;\$(3, 6, 9)\$&lt;/span&gt; is sufficient information to reproduce the string. Here are some more examples using this representation:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;10101010 is represented inefficiently by (0, 1, 2, 3, 4, 5, 6, 7)&#xA;1111100000 is represented by (0, 5)&#xA;0000011111 is represented by (5)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Let us call this representation of a string its &lt;code&gt; compressed representation&lt;/code&gt; (even though sometimes the compression is worse than doing nothing).&lt;/p&gt;&#xA;&lt;p&gt;Now recall the &lt;a href=&quot;https://en.wikipedia.org/wiki/Levenshtein_distance&quot; rel=&quot;nofollow noreferrer&quot;&gt;Levenshtein distance&lt;/a&gt; between two strings. This is the minimum number of single character insertions, deletions and substitutions needed to transform one string into the other.&lt;/p&gt;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&lt;p&gt;Given a compressed representation of a string &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; of uncompressed length &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; and two positive integers &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$d\$&lt;/span&gt;, the task is to output the compressed representation of &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; distinct strings of uncompressed length &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;, each with Levenshtein distance exactly &lt;span class=&quot;math-container&quot;&gt;\$d\$&lt;/span&gt; from &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;. If there are not that many distinct strings possible, simply output as many as possible.&lt;/p&gt;&#xA;&lt;p&gt;Your code must run with &lt;span class=&quot;math-container&quot;&gt;\$N = 1000000\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$k, d &amp;lt; 20\$&lt;/span&gt; in less than a minute on a normal desktop PC.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user9207" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-08-30T20:26:50.760" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16849" PostTypeId="2" ParentId="16843" CreationDate="2018-08-30T19:19:56.490" Score="13" Body="&lt;p&gt;Of all the wonderfully welcoming people here, you have made me feel the most welcome.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's been great discussing things with you over the years, learning from you, and watching discussions with others that I couldn't keep up with but enjoyed nonetheless. Although when explaining direct to me you have a knack for judging just the right level that I can grasp it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I remember you being part of the team helping me group golf one of my early answers down enough to be valid to post - that really got across to me how inclusive and supportive this community is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You talked me into being a mod over on CG.SE when I had very little confidence (which has improved a lot as a result...), and patiently answered my questions beforehand, and then during too, and wrote me a beautiful nomination post which I endeavour to live up to.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The community is what makes this site, and you've been a huge part of guiding and supporting us all, quite aside from the technical contributions like a &lt;a href=&quot;https://esolangs.org/wiki/User:Martin_Ender&quot; rel=&quot;nofollow noreferrer&quot;&gt;variety of twisted esolangs&lt;/a&gt; and the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5139/leaderboard-snippet&quot;&gt;leaderboard to make golf more per-language&lt;/a&gt;. Looking forward to your return, and hoping you thoroughly enjoy all the things you're doing in between.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2018-08-30T19:19:56.490" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16850" PostTypeId="2" ParentId="16844" CreationDate="2018-08-30T19:24:51.977" Score="11" Body="&lt;p&gt;I think PhiNotPi would make a fantastic mod, but we're a graduated site now so if at some point there arises a need for an extra moderator, I'd be very surprised if that didn't involve an official election.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2018-08-30T19:24:51.977" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16852" PostTypeId="1" CreationDate="2018-08-31T15:58:24.860" Score="-1" ViewCount="82" Body="&lt;p&gt;Currently some answers to (meta questions asking whether something is allowed) stands on both side, and some are highly voted and accepted because people standing on both side think it on his/her own side. Easily fall into, but should we? If not, what to do with such thing?&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2018-09-02T13:35:17.527" Title="Should we upvote/accept unclear answer on meta?" Tags="|discussion|meta|" AnswerCount="1" CommentCount="4" ClosedDate="2018-09-19T19:28:32.547" ContentLicense="CC BY-SA 4.0" />
  <row Id="16854" PostTypeId="2" ParentId="16844" CreationDate="2018-08-31T17:26:18.043" Score="4" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;So what happens now?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Nothing. Only time will tell if Martin's resignation has really caused problems with the diamond moderators, and, if so, a new moderator can get appointed or elected.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2018-08-31T17:26:18.043" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16856" PostTypeId="1" CreationDate="2018-09-01T22:11:52.943" Score="2" ViewCount="173" Body="&lt;p&gt;So with the recent maze challenge I had the idea to implement a solution using CBMC (&lt;a href=&quot;http://www.cprover.org/cbmc/&quot; rel=&quot;nofollow noreferrer&quot;&gt;home&lt;/a&gt; / &lt;a href=&quot;https://github.com/diffblue/cbmc/tree/master&quot; rel=&quot;nofollow noreferrer&quot;&gt;source&lt;/a&gt;), which is a tool that statically verifies C code and can produce counter-examples for property failures. I intend to feed it programs that, with the below input methods, generate the output a challenge demands. However I have encountered some obstacles and would like to ask whether these are obstacles of the disqualifying kind.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In particular I'd like to have confirmation that the below three properties don't disqualify CBMC:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Scalar input needs to be taken as macro-argument &lt;code&gt;-DN=3&lt;/code&gt; flag (like in &lt;code&gt;gcc&lt;/code&gt;) and / or like array-input which needs to be taken via pre-defined constants (either as global &lt;code&gt;const int x[]={}&lt;/code&gt; or as &lt;code&gt;#define X {A,B,C}&lt;/code&gt; that are &lt;code&gt;#include&lt;/code&gt;'d, note that the include avoids hard-coding into the source-file.&lt;/li&gt;&#xA;&lt;li&gt;The output is quite &lt;em&gt;noisy&lt;/em&gt; and includes intermediate program state information and other otherwise useful but here hindering output &lt;em&gt;in addition to what is printed with standard formatting&lt;/em&gt;. This extra information (usually a couple of thousand lines) can easily be filtered out using a small external program, post-processing (stripping) the output.&lt;/li&gt;&#xA;&lt;li&gt;The correctness, ie whether the tool finds a valid solution, sometimes depends on a CLI parameter to the tool, ie usually for larger / more complex inputs this parameter needs to be upped (in particular this is the parameter that bounds the maximal amount of loop-unrolls the tool will do).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Example triple (input, program, output) for &lt;a href=&quot;https://codegolf.stackexchange.com/q/171550/55329&quot;&gt;this challenge&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example Input:&lt;br&gt;&#xA;content of &lt;code&gt;data.h&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;const int obsX[] = {1};&#xA;const int obsY[] = {1};&#xA;const int obsLen = sizeof(obsX)/sizeof(int);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;paired with the following command-line call:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;cbmc simple-lab.c -DN=3 -DPY=1 -DTY=1 --trace --beautify --unwind 10&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example Program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#include &amp;lt;stdio.h&amp;gt;&#xA;#include &amp;lt;assert.h&amp;gt;&#xA;#include &quot;data.h&quot;&#xA;&#xA;int main() {&#xA;&#xA;    int curX=0, curY=PY;&#xA;    while(1)&#xA;    {&#xA;        char direction;&#xA;        int newX=curX, newY=curY;&#xA;&#xA;        if(direction==0)&#xA;            newY--; // north&#xA;        else if(direction==1)&#xA;            newX++; // east&#xA;        else if(direction==2)&#xA;            newY++; // south&#xA;        else&#xA;            newX--; // west&#xA;&#xA;        if(newX &amp;lt; 0 || newX &amp;gt;= N || newY &amp;gt;= N || newY &amp;lt; 0)&#xA;            continue;&#xA;&#xA;        int abandon=0;&#xA;        for(int i=0;i&amp;lt;obsLen;i++)&#xA;            abandon |= newX == obsX[i] &amp;amp;&amp;amp; newY == obsY[i];&#xA;&#xA;        if(abandon)&#xA;            continue;&#xA;        else&#xA;            {curX=newX;curY=newY;}&#xA;&#xA;        printf(&quot;%d,%d\n&quot;,curX,curY);&#xA;&#xA;        assert(!(curX == N-1 &amp;amp;&amp;amp; curY == TY));&#xA;    }&#xA;&#xA;    return 0;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Example (full) tool-output (as you can see there's a pair of integers with a newline sticking out every couple of states which signify the intended output generated by the printf):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;CBMC version 5.6 64-bit x86_64 linux&#xA;Parsing simple-lab.c&#xA;file &amp;lt;command-line&amp;gt; line 0: &amp;lt;command-line&amp;gt;:0:0: warning: &quot;__STDC_VERSION__&quot; redefined&#xA;&amp;lt;built-in&amp;gt;: note: this is the location of the previous definition&#xA;Converting&#xA;Type-checking simple-lab&#xA;Generating GOTO Program&#xA;Adding CPROVER library (x86_64)&#xA;Removal of function pointers and virtual functions&#xA;Partial Inlining&#xA;Generic Property Instrumentation&#xA;Starting Bounded Model Checking&#xA;Unwinding loop main.0 iteration 1 (10 max) file simple-lab.c line 33 function main thread 0&#xA;Unwinding loop main.1 iteration 1 (10 max) file simple-lab.c line 15 function main thread 0&#xA;Unwinding loop main.0 iteration 1 (10 max) file simple-lab.c line 33 function main thread 0&#xA;Unwinding loop main.1 iteration 2 (10 max) file simple-lab.c line 15 function main thread 0&#xA;Unwinding loop main.0 iteration 1 (10 max) file simple-lab.c line 33 function main thread 0&#xA;Unwinding loop main.1 iteration 3 (10 max) file simple-lab.c line 15 function main thread 0&#xA;Unwinding loop main.0 iteration 1 (10 max) file simple-lab.c line 33 function main thread 0&#xA;Unwinding loop main.1 iteration 4 (10 max) file simple-lab.c line 15 function main thread 0&#xA;Unwinding loop main.0 iteration 1 (10 max) file simple-lab.c line 33 function main thread 0&#xA;Unwinding loop main.1 iteration 5 (10 max) file simple-lab.c line 15 function main thread 0&#xA;Unwinding loop main.0 iteration 1 (10 max) file simple-lab.c line 33 function main thread 0&#xA;Unwinding loop main.1 iteration 6 (10 max) file simple-lab.c line 15 function main thread 0&#xA;Unwinding loop main.0 iteration 1 (10 max) file simple-lab.c line 33 function main thread 0&#xA;Unwinding loop main.1 iteration 7 (10 max) file simple-lab.c line 15 function main thread 0&#xA;Unwinding loop main.0 iteration 1 (10 max) file simple-lab.c line 33 function main thread 0&#xA;Unwinding loop main.1 iteration 8 (10 max) file simple-lab.c line 15 function main thread 0&#xA;Unwinding loop main.0 iteration 1 (10 max) file simple-lab.c line 33 function main thread 0&#xA;Unwinding loop main.1 iteration 9 (10 max) file simple-lab.c line 15 function main thread 0&#xA;Unwinding loop main.0 iteration 1 (10 max) file simple-lab.c line 33 function main thread 0&#xA;Not unwinding loop main.1 iteration 10 (10 max) file simple-lab.c line 15 function main thread 0&#xA;size of program expression: 792 steps&#xA;simple slicing removed 23 assignments&#xA;Generated 10 VCC(s), 10 remaining after simplification&#xA;Passing problem to propositional reduction&#xA;converting SSA&#xA;Running propositional reduction&#xA;Post-processing&#xA;Solving with MiniSAT 2.2.1 without simplifier&#xA;12727 variables, 35264 clauses&#xA;SAT checker: instance is SATISFIABLE&#xA;Runtime decision procedure: 0.029s&#xA;&#xA;** Results:&#xA;[main.assertion.1] assertion !(curX == N-1 &amp;amp;&amp;amp; curY == TY): FAILURE&#xA;&#xA;Trace for main.assertion.1:&#xA;&#xA;State 21 file simple-lab.c line 14 function main thread 0&#xA;----------------------------------------------------&#xA;  curX=0 (00000000000000000000000000000000)&#xA;&#xA;State 22 file simple-lab.c line 14 function main thread 0&#xA;----------------------------------------------------&#xA;  curX=0 (00000000000000000000000000000000)&#xA;&#xA;State 23 file simple-lab.c line 14 function main thread 0&#xA;----------------------------------------------------&#xA;  curY=0 (00000000000000000000000000000000)&#xA;&#xA;State 24 file simple-lab.c line 14 function main thread 0&#xA;----------------------------------------------------&#xA;  curY=1 (00000000000000000000000000000001)&#xA;&#xA;State 26 file simple-lab.c line 17 function main thread 0&#xA;----------------------------------------------------&#xA;  direction=2 (00000010)&#xA;&#xA;State 27 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newX=0 (00000000000000000000000000000000)&#xA;&#xA;State 28 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newX=0 (00000000000000000000000000000000)&#xA;&#xA;State 29 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newY=0 (00000000000000000000000000000000)&#xA;&#xA;State 30 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newY=1 (00000000000000000000000000000001)&#xA;&#xA;State 34 file simple-lab.c line 25 function main thread 0&#xA;----------------------------------------------------&#xA;  newY=2 (00000000000000000000000000000010)&#xA;&#xA;State 37 file simple-lab.c line 32 function main thread 0&#xA;----------------------------------------------------&#xA;  abandon=0 (00000000000000000000000000000000)&#xA;&#xA;State 38 file simple-lab.c line 32 function main thread 0&#xA;----------------------------------------------------&#xA;  abandon=0 (00000000000000000000000000000000)&#xA;&#xA;State 39 file simple-lab.c line 33 function main thread 0&#xA;----------------------------------------------------&#xA;  i=0 (00000000000000000000000000000000)&#xA;&#xA;State 40 file simple-lab.c line 33 function main thread 0&#xA;----------------------------------------------------&#xA;  i=0 (00000000000000000000000000000000)&#xA;&#xA;State 45 file simple-lab.c line 34 function main thread 0&#xA;----------------------------------------------------&#xA;  abandon=0 (00000000000000000000000000000000)&#xA;&#xA;State 46 file simple-lab.c line 33 function main thread 0&#xA;----------------------------------------------------&#xA;  i=1 (00000000000000000000000000000001)&#xA;&#xA;State 50 file simple-lab.c line 39 function main thread 0&#xA;----------------------------------------------------&#xA;  curX=0 (00000000000000000000000000000000)&#xA;&#xA;State 51 file simple-lab.c line 39 function main thread 0&#xA;----------------------------------------------------&#xA;  curY=2 (00000000000000000000000000000010)&#xA;0,2&#xA;&#xA;&#xA;State 57 file simple-lab.c line 17 function main thread 0&#xA;----------------------------------------------------&#xA;  direction=1 (00000001)&#xA;&#xA;State 58 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newX=0 (00000000000000000000000000000000)&#xA;&#xA;State 59 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newX=0 (00000000000000000000000000000000)&#xA;&#xA;State 60 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newY=0 (00000000000000000000000000000000)&#xA;&#xA;State 61 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newY=2 (00000000000000000000000000000010)&#xA;&#xA;State 64 file simple-lab.c line 23 function main thread 0&#xA;----------------------------------------------------&#xA;  newX=1 (00000000000000000000000000000001)&#xA;&#xA;State 67 file simple-lab.c line 32 function main thread 0&#xA;----------------------------------------------------&#xA;  abandon=0 (00000000000000000000000000000000)&#xA;&#xA;State 68 file simple-lab.c line 32 function main thread 0&#xA;----------------------------------------------------&#xA;  abandon=0 (00000000000000000000000000000000)&#xA;&#xA;State 69 file simple-lab.c line 33 function main thread 0&#xA;----------------------------------------------------&#xA;  i=0 (00000000000000000000000000000000)&#xA;&#xA;State 70 file simple-lab.c line 33 function main thread 0&#xA;----------------------------------------------------&#xA;  i=0 (00000000000000000000000000000000)&#xA;&#xA;State 76 file simple-lab.c line 34 function main thread 0&#xA;----------------------------------------------------&#xA;  abandon=0 (00000000000000000000000000000000)&#xA;&#xA;State 77 file simple-lab.c line 33 function main thread 0&#xA;----------------------------------------------------&#xA;  i=1 (00000000000000000000000000000001)&#xA;&#xA;State 81 file simple-lab.c line 39 function main thread 0&#xA;----------------------------------------------------&#xA;  curX=1 (00000000000000000000000000000001)&#xA;&#xA;State 82 file simple-lab.c line 39 function main thread 0&#xA;----------------------------------------------------&#xA;  curY=2 (00000000000000000000000000000010)&#xA;1,2&#xA;&#xA;&#xA;State 88 file simple-lab.c line 17 function main thread 0&#xA;----------------------------------------------------&#xA;  direction=0 (00000000)&#xA;&#xA;State 89 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newX=0 (00000000000000000000000000000000)&#xA;&#xA;State 90 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newX=1 (00000000000000000000000000000001)&#xA;&#xA;State 91 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newY=0 (00000000000000000000000000000000)&#xA;&#xA;State 92 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newY=2 (00000000000000000000000000000010)&#xA;&#xA;State 94 file simple-lab.c line 21 function main thread 0&#xA;----------------------------------------------------&#xA;  newY=1 (00000000000000000000000000000001)&#xA;&#xA;State 97 file simple-lab.c line 32 function main thread 0&#xA;----------------------------------------------------&#xA;  abandon=0 (00000000000000000000000000000000)&#xA;&#xA;State 98 file simple-lab.c line 32 function main thread 0&#xA;----------------------------------------------------&#xA;  abandon=0 (00000000000000000000000000000000)&#xA;&#xA;State 99 file simple-lab.c line 33 function main thread 0&#xA;----------------------------------------------------&#xA;  i=0 (00000000000000000000000000000000)&#xA;&#xA;State 100 file simple-lab.c line 33 function main thread 0&#xA;----------------------------------------------------&#xA;  i=0 (00000000000000000000000000000000)&#xA;&#xA;State 106 file simple-lab.c line 34 function main thread 0&#xA;----------------------------------------------------&#xA;  abandon=1 (00000000000000000000000000000001)&#xA;&#xA;State 107 file simple-lab.c line 33 function main thread 0&#xA;----------------------------------------------------&#xA;  i=1 (00000000000000000000000000000001)&#xA;&#xA;State 114 file simple-lab.c line 17 function main thread 0&#xA;----------------------------------------------------&#xA;  direction=2 (00000010)&#xA;&#xA;State 115 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newX=0 (00000000000000000000000000000000)&#xA;&#xA;State 116 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newX=1 (00000000000000000000000000000001)&#xA;&#xA;State 117 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newY=0 (00000000000000000000000000000000)&#xA;&#xA;State 118 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newY=2 (00000000000000000000000000000010)&#xA;&#xA;State 122 file simple-lab.c line 25 function main thread 0&#xA;----------------------------------------------------&#xA;  newY=3 (00000000000000000000000000000011)&#xA;&#xA;State 128 file simple-lab.c line 17 function main thread 0&#xA;----------------------------------------------------&#xA;  direction=6 (00000110)&#xA;&#xA;State 129 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newX=0 (00000000000000000000000000000000)&#xA;&#xA;State 130 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newX=1 (00000000000000000000000000000001)&#xA;&#xA;State 131 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newY=0 (00000000000000000000000000000000)&#xA;&#xA;State 132 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newY=2 (00000000000000000000000000000010)&#xA;&#xA;State 136 file simple-lab.c line 27 function main thread 0&#xA;----------------------------------------------------&#xA;  newX=0 (00000000000000000000000000000000)&#xA;&#xA;State 138 file simple-lab.c line 32 function main thread 0&#xA;----------------------------------------------------&#xA;  abandon=0 (00000000000000000000000000000000)&#xA;&#xA;State 139 file simple-lab.c line 32 function main thread 0&#xA;----------------------------------------------------&#xA;  abandon=0 (00000000000000000000000000000000)&#xA;&#xA;State 140 file simple-lab.c line 33 function main thread 0&#xA;----------------------------------------------------&#xA;  i=0 (00000000000000000000000000000000)&#xA;&#xA;State 141 file simple-lab.c line 33 function main thread 0&#xA;----------------------------------------------------&#xA;  i=0 (00000000000000000000000000000000)&#xA;&#xA;State 146 file simple-lab.c line 34 function main thread 0&#xA;----------------------------------------------------&#xA;  abandon=0 (00000000000000000000000000000000)&#xA;&#xA;State 147 file simple-lab.c line 33 function main thread 0&#xA;----------------------------------------------------&#xA;  i=1 (00000000000000000000000000000001)&#xA;&#xA;State 151 file simple-lab.c line 39 function main thread 0&#xA;----------------------------------------------------&#xA;  curX=0 (00000000000000000000000000000000)&#xA;&#xA;State 152 file simple-lab.c line 39 function main thread 0&#xA;----------------------------------------------------&#xA;  curY=2 (00000000000000000000000000000010)&#xA;0,2&#xA;&#xA;&#xA;State 158 file simple-lab.c line 17 function main thread 0&#xA;----------------------------------------------------&#xA;  direction=1 (00000001)&#xA;&#xA;State 159 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newX=0 (00000000000000000000000000000000)&#xA;&#xA;State 160 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newX=0 (00000000000000000000000000000000)&#xA;&#xA;State 161 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newY=0 (00000000000000000000000000000000)&#xA;&#xA;State 162 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newY=2 (00000000000000000000000000000010)&#xA;&#xA;State 165 file simple-lab.c line 23 function main thread 0&#xA;----------------------------------------------------&#xA;  newX=1 (00000000000000000000000000000001)&#xA;&#xA;State 168 file simple-lab.c line 32 function main thread 0&#xA;----------------------------------------------------&#xA;  abandon=0 (00000000000000000000000000000000)&#xA;&#xA;State 169 file simple-lab.c line 32 function main thread 0&#xA;----------------------------------------------------&#xA;  abandon=0 (00000000000000000000000000000000)&#xA;&#xA;State 170 file simple-lab.c line 33 function main thread 0&#xA;----------------------------------------------------&#xA;  i=0 (00000000000000000000000000000000)&#xA;&#xA;State 171 file simple-lab.c line 33 function main thread 0&#xA;----------------------------------------------------&#xA;  i=0 (00000000000000000000000000000000)&#xA;&#xA;State 177 file simple-lab.c line 34 function main thread 0&#xA;----------------------------------------------------&#xA;  abandon=0 (00000000000000000000000000000000)&#xA;&#xA;State 178 file simple-lab.c line 33 function main thread 0&#xA;----------------------------------------------------&#xA;  i=1 (00000000000000000000000000000001)&#xA;&#xA;State 182 file simple-lab.c line 39 function main thread 0&#xA;----------------------------------------------------&#xA;  curX=1 (00000000000000000000000000000001)&#xA;&#xA;State 183 file simple-lab.c line 39 function main thread 0&#xA;----------------------------------------------------&#xA;  curY=2 (00000000000000000000000000000010)&#xA;1,2&#xA;&#xA;&#xA;State 189 file simple-lab.c line 17 function main thread 0&#xA;----------------------------------------------------&#xA;  direction=1 (00000001)&#xA;&#xA;State 190 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newX=0 (00000000000000000000000000000000)&#xA;&#xA;State 191 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newX=1 (00000000000000000000000000000001)&#xA;&#xA;State 192 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newY=0 (00000000000000000000000000000000)&#xA;&#xA;State 193 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newY=2 (00000000000000000000000000000010)&#xA;&#xA;State 196 file simple-lab.c line 23 function main thread 0&#xA;----------------------------------------------------&#xA;  newX=2 (00000000000000000000000000000010)&#xA;&#xA;State 199 file simple-lab.c line 32 function main thread 0&#xA;----------------------------------------------------&#xA;  abandon=0 (00000000000000000000000000000000)&#xA;&#xA;State 200 file simple-lab.c line 32 function main thread 0&#xA;----------------------------------------------------&#xA;  abandon=0 (00000000000000000000000000000000)&#xA;&#xA;State 201 file simple-lab.c line 33 function main thread 0&#xA;----------------------------------------------------&#xA;  i=0 (00000000000000000000000000000000)&#xA;&#xA;State 202 file simple-lab.c line 33 function main thread 0&#xA;----------------------------------------------------&#xA;  i=0 (00000000000000000000000000000000)&#xA;&#xA;State 207 file simple-lab.c line 34 function main thread 0&#xA;----------------------------------------------------&#xA;  abandon=0 (00000000000000000000000000000000)&#xA;&#xA;State 208 file simple-lab.c line 33 function main thread 0&#xA;----------------------------------------------------&#xA;  i=1 (00000000000000000000000000000001)&#xA;&#xA;State 212 file simple-lab.c line 39 function main thread 0&#xA;----------------------------------------------------&#xA;  curX=2 (00000000000000000000000000000010)&#xA;&#xA;State 213 file simple-lab.c line 39 function main thread 0&#xA;----------------------------------------------------&#xA;  curY=2 (00000000000000000000000000000010)&#xA;2,2&#xA;&#xA;&#xA;State 219 file simple-lab.c line 17 function main thread 0&#xA;----------------------------------------------------&#xA;  direction=0 (00000000)&#xA;&#xA;State 220 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newX=0 (00000000000000000000000000000000)&#xA;&#xA;State 221 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newX=2 (00000000000000000000000000000010)&#xA;&#xA;State 222 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newY=0 (00000000000000000000000000000000)&#xA;&#xA;State 223 file simple-lab.c line 18 function main thread 0&#xA;----------------------------------------------------&#xA;  newY=2 (00000000000000000000000000000010)&#xA;&#xA;State 225 file simple-lab.c line 21 function main thread 0&#xA;----------------------------------------------------&#xA;  newY=1 (00000000000000000000000000000001)&#xA;&#xA;State 228 file simple-lab.c line 32 function main thread 0&#xA;----------------------------------------------------&#xA;  abandon=0 (00000000000000000000000000000000)&#xA;&#xA;State 229 file simple-lab.c line 32 function main thread 0&#xA;----------------------------------------------------&#xA;  abandon=0 (00000000000000000000000000000000)&#xA;&#xA;State 230 file simple-lab.c line 33 function main thread 0&#xA;----------------------------------------------------&#xA;  i=0 (00000000000000000000000000000000)&#xA;&#xA;State 231 file simple-lab.c line 33 function main thread 0&#xA;----------------------------------------------------&#xA;  i=0 (00000000000000000000000000000000)&#xA;&#xA;State 236 file simple-lab.c line 34 function main thread 0&#xA;----------------------------------------------------&#xA;  abandon=0 (00000000000000000000000000000000)&#xA;&#xA;State 237 file simple-lab.c line 33 function main thread 0&#xA;----------------------------------------------------&#xA;  i=1 (00000000000000000000000000000001)&#xA;&#xA;State 241 file simple-lab.c line 39 function main thread 0&#xA;----------------------------------------------------&#xA;  curX=2 (00000000000000000000000000000010)&#xA;&#xA;State 242 file simple-lab.c line 39 function main thread 0&#xA;----------------------------------------------------&#xA;  curY=1 (00000000000000000000000000000001)&#xA;2,1&#xA;&#xA;&#xA;Violated property:&#xA;  file simple-lab.c line 43 function main&#xA;  assertion !(curX == N-1 &amp;amp;&amp;amp; curY == TY)&#xA;  !(curX == 3 - 1 &amp;amp;&amp;amp; curY == 1)&#xA;&#xA;&#xA;** 1 of 1 failed (1 iteration)&#xA;VERIFICATION FAILED&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="55329" LastEditorUserId="55329" LastEditDate="2018-09-02T08:01:02.067" LastActivityDate="2018-09-02T15:45:47.107" Title="Can I use CBMC (a static verification tool for C) for code-golf?" Tags="|discussion|output|languages|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16857" PostTypeId="2" ParentId="16852" CreationDate="2018-09-02T13:35:17.527" Score="2" Body="&lt;p&gt;If a meta answer is unclear or ambiguous, I'd comment to say so.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a meta answer makes the case for both sides of an argument, demonstrating that the decision is not clear cut and should be considered carefully on a case by case basis, then I'd upvote (unless I disagree in which case I'd comment/answer).&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2018-09-02T13:35:17.527" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16858" PostTypeId="2" ParentId="16856" CreationDate="2018-09-02T15:45:47.107" Score="2" Body="&lt;p&gt;Because I had a few spare hours on my hands, &lt;a href=&quot;https://github.com/DevJPM/CBMC-Golf&quot; rel=&quot;nofollow noreferrer&quot;&gt;I wrote a simple parser / compiler / whatevs&lt;/a&gt; that will effectively solve all the problems of this post:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The new language will take input as line-by-line from STDIN (which is allowed) and will hardcode it into a copy of the source program which then gets fed to CBMC.&lt;/li&gt;&#xA;&lt;li&gt;The output of which gets  redirected to a file, post-processed and then send to STDOUT.&lt;/li&gt;&#xA;&lt;li&gt;The loop-unrolling parameter is still there, but set high enough to hopefully deal with most loops for which the iteration count can't be easily identified, ie you want to lower it using a command-line argument if you have nested loops.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;As for whether CBMC without the above should be allowed, I'd be inclined to say &quot;no&quot; for now because it indeed &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8731/55329&quot;&gt;violates the most-downvoted I/O format&lt;/a&gt; and exceptions apparently only get granted on a case-by-case basis which I don't want to invoke due to the above solution.&lt;/p&gt;&#xA;" OwnerUserId="55329" LastActivityDate="2018-09-02T15:45:47.107" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16860" PostTypeId="2" ParentId="2140" CreationDate="2018-09-03T08:19:30.510" Score="0" Body="&lt;h1&gt;Bijective base banana to decimal&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'm trying to decide between 2 versions of this challenge:&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Prefixes version&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let bijective base banana be &lt;a href=&quot;https://en.wikipedia.org/wiki/Bijective_numeration&quot; rel=&quot;nofollow noreferrer&quot;&gt;bijective base 6&lt;/a&gt; with each digit represented by a different prefix of the word &quot;banana&quot; as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1: &quot;b&quot;&#xA;2: &quot;ba&quot;&#xA;3: &quot;ban&quot;&#xA;4: &quot;bana&quot;&#xA;5: &quot;banan&quot;&#xA;6: &quot;banana&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The input will be a string made up of a concatenation of zero or more of only these strings. This represents a number in bijective base 6 (with most significant digit first).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output will be the same number in (non-bijective) decimal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example: (input : output)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;&quot; : 0&#xA;&quot;b&quot; : 1&#xA;&quot;bb&quot; : 7&#xA;&quot;bbanana&quot; : 12&#xA;&quot;bananab&quot; : 37&#xA;&quot;bananabanana&quot; : 42&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A worked example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;bananabanbana&#xA;banana ban bana&#xA;6      3   4&#xA;6*36 + 3*6 + 4*1&#xA;216  + 18  + 4&#xA;238&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is code golf, so the winner for each language is the code with the fewest bytes.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Suffixes version&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let bijective base banana be &lt;a href=&quot;https://en.wikipedia.org/wiki/Bijective_numeration&quot; rel=&quot;nofollow noreferrer&quot;&gt;bijective base 6&lt;/a&gt; with each digit represented by a different suffix of the word &quot;banana&quot; as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1: &quot;a&quot;&#xA;2: &quot;na&quot;&#xA;3: &quot;ana&quot;&#xA;4: &quot;nana&quot;&#xA;5: &quot;anana&quot;&#xA;6: &quot;banana&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The input will be a string made up of a concatenation of zero or more of only these strings. This represents a number in bijective base 6 (with most significant digit first).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output will be the same number in (non-bijective) decimal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example: (input : output)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;&quot; : 0&#xA;&quot;a&quot; : 1&#xA;&quot;aa&quot; : 7&#xA;&quot;abanana&quot; : 12&#xA;&quot;bananaa&quot; : 37&#xA;&quot;bananabanana&quot; : 42&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A worked example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;bananaananana&#xA;banana ana nana&#xA;6      3   4&#xA;6*36 + 3*6 + 4*1&#xA;216  + 18  + 4&#xA;238&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is code golf, so the winner for each language is the code with the fewest bytes.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a duplicate or near enough a duplicate to be worth changing?&lt;/li&gt;&#xA;&lt;li&gt;Are there any flaws that would make the challenge uninteresting?&lt;/li&gt;&#xA;&lt;li&gt;I'm considering changing from prefixes to suffixes following &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/16860?noredirect=1#comment59419_16860&quot;&gt;this comment from H.PWiz&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;I currently prefer the suffixes version, but the worked example shows that the interpretation is no longer unique. It would either need to be specified that the match must be greedy (or non-greedy) or a different word would need to be chosen. I lean towards choosing a word which still gives enough ambiguity to force looking ahead, while still keeping the overall conclusion unique. I can't see a way of doing this without making the last character unique though, which reduces to a reversed version of the prefixes version (you can still ignore all other letters).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2018-09-03T20:42:23.643" LastActivityDate="2018-09-03T20:42:23.643" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="16862" PostTypeId="2" ParentId="2140" CreationDate="2018-09-03T15:54:34.500" Score="0" Body="&lt;h1&gt;Find the fixed point prime&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/recursion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;recursion&amp;#39;&quot; rel=&quot;tag&quot;&gt;recursion&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Definition&lt;/h1&gt;&#xA;&lt;p&gt;Let &lt;code&gt;f(n)&lt;/code&gt; be the sum of the sums of each possible factor permutation of &lt;code&gt;n&lt;/code&gt;. Determine &lt;code&gt;(Y f)(n)&lt;/code&gt; (a &lt;a href=&quot;https://en.wikipedia.org/wiki/Fixed-point_combinator&quot; rel=&quot;nofollow noreferrer&quot;&gt;fixed-point combinator&lt;/a&gt;) for all &lt;code&gt;n&lt;/code&gt; from 2 to the input &lt;code&gt;i&lt;/code&gt; (where &lt;code&gt;i&lt;/code&gt; is an integer greater than 2).&lt;/p&gt;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&lt;p&gt;A quick example of &lt;code&gt;f(n)&lt;/code&gt; first:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;f(8) = (2 + 2 + 2) + (2 + 4) + (4 + 2) + (8)&#xA;f(8) = 26&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;An example of &lt;code&gt;(Y f)(n)&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(Y f)(8)&#xA;  f(8) = 26 (shown above)&#xA;  f(26) = (2 + 13) + (26) = 41&#xA;  f(41) = (41) = 41&#xA;(Y f)(8) = 41&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Let &lt;code&gt;g(i)&lt;/code&gt; define a function which implements the described problem.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;g(2)&#xA;2&#xA;&#xA;g(4)&#xA;2&#xA;3&#xA;41&#xA;&#xA;g(8)&#xA;2&#xA;3&#xA;41&#xA;5&#xA;11&#xA;7&#xA;41&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Competition&lt;/h1&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt; challenge, which means that the solution with the lowest asymptotic time complexity (in &lt;a href=&quot;https://en.wikipedia.org/wiki/Big_O_notation#Family_of_Bachmann.E2.80.93Landau_notations&quot; rel=&quot;nofollow noreferrer&quot;&gt;Θ(...)&lt;/a&gt;) wins!&lt;/p&gt;&#xA;&lt;p&gt;In the case of a tie, the winner will be determined by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; rules, so please submit an implementation of your code along with the algorithm. Tie-break will occur on a &lt;a href=&quot;https://cloud.google.com/compute/docs/machine-types&quot; rel=&quot;nofollow noreferrer&quot;&gt;Google Compute Engine n1-standard-8 instance&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="44713" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-09-03T16:48:48.617" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="16863" PostTypeId="2" ParentId="2140" CreationDate="2018-09-03T22:12:58.090" Score="0" Body="&lt;h1&gt;Facto-RLE&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a non-empty string containing non-numeric printable ASCII characters, compute its facto-run-length encoded version.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Definition&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Let \$S\$ be a non-empty string of length \$l\in\mathbb{N}^+\$ containing non-numeric printable ASCII characters. For each positive factor \$n|l\$ one can represent \$S\$ as a \$n\times(l/n)\$ matrix of characters. Let \$M^n\$ denote these matrices.&lt;br&gt;&#xA;For a given \$n\$ and \$j\in\{1,\dots,l/n\}\$, let \$C^n_j\$ be the string representing the \$j\$-th column of \$M^n\$. Let \$E^n_j := \text{RLE}(C^n_j)\$ denote the array of this string's run-length encoded version.&lt;br&gt;&#xA;Let \$R^n := \text{CNCT}(\text{ZIP}(E^n_1,\dots,E^n_{l/n}))\$ denote the string representation of all \$E^n_j\$ zipped together.&lt;br&gt;&#xA;The facto-run-length encoding of \$S\$ is defined as the string array \$\text{FRLE}(S):=[R^n:n|l]\$.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For a family of \$k\in\mathbb{N}^+\$ arrays \$A^i\$ with respective lengths \$l^i, i\in\{1,\dots,k\}\$ and elements \$A^i_j,j\in\{1,\dots,l^i\}\$, let \$Z_j:=[A^i_j:i\in\{1,\dots,k\}\land j\leq l_i]\$ denote the array of elements with index \$j\$, if present. Furthermore, define \$\text{ZIP}(A^1,\dots,A^k) := Z_1\Vert\dots\Vert Z_{\max\{l_i\}}\$ as the concatenated array of all \$Z_j\$.&lt;br&gt;&#xA;For an array of strings \$A\$ of length \$j\$, define \$\text{CNCT(A)}:=A_1\Vert \dots\Vert A_j\$ as the concatenation of all strings of \$A\$.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Let \$S:=\text{&quot;Hello world!&quot;}\$, therefore \$l=12\$ with positive factors \$\{1,2,3,4,6,12\}\$.&#xA;$$&#xA;M^2=\begin{pmatrix}&#xA;   \text{H}&amp;amp;\text{e}&amp;amp;\text{l}&amp;amp;\text{l}&amp;amp;\text{o}&amp;amp;\text{ }\\&#xA;   \text{w}&amp;amp;\text{o}&amp;amp;\text{r}&amp;amp;\text{l}&amp;amp;\text{d}&amp;amp;\text{!}&#xA;\end{pmatrix},&#xA;\\C^2_1=\text{&quot;Hw&quot;},&#xA;C^2_2=\text{&quot;eo&quot;},&#xA;C^2_3=\text{&quot;lr&quot;},&#xA;\\C^2_4=\text{&quot;ll&quot;},&#xA;C^2_5=\text{&quot;od&quot;},&#xA;C^2_6=\text{&quot; !&quot;},&#xA;\\E^2_1=[\text{&quot;H&quot;},\text{&quot;w&quot;}],&#xA;E^2_2=[\text{&quot;e&quot;},\text{&quot;o&quot;}],&#xA;E^2_3=[\text{&quot;l&quot;},\text{&quot;r&quot;}],&#xA;\\E^2_4=[\text{&quot;l2&quot;}],&#xA;E^2_5=[\text{&quot;o&quot;},\text{&quot;d&quot;}],&#xA;E^2_6=[\text{&quot; &quot;},\text{&quot;!&quot;}],&#xA;\\R^2=\text{&quot;Hell2o word!&quot;}&#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$&#xA;M^4=\begin{pmatrix}&#xA;   \text{H}&amp;amp;\text{e}&amp;amp;\text{l}\\&#xA;   \text{l}&amp;amp;\text{o}&amp;amp;\text{ }\\&#xA;   \text{w}&amp;amp;\text{o}&amp;amp;\text{r}\\&#xA;   \text{l}&amp;amp;\text{d}&amp;amp;\text{!}\\&#xA;\end{pmatrix},&#xA;\\C^4_1=\text{&quot;Hlwl&quot;},&#xA;C^4_2=\text{&quot;eood&quot;},&#xA;C^4_3=\text{&quot;l r!&quot;},&#xA;\\E^4_1=[\text{&quot;H&quot;}, \text{&quot;l&quot;}, \text{&quot;w&quot;}, \text{&quot;l&quot;}],&#xA;E^4_2=[\text{&quot;e&quot;}, \text{&quot;o2&quot;}, \text{&quot;d&quot;}],&#xA;E^4_1=[\text{&quot;l&quot;}, \text{&quot; &quot;}, \text{&quot;r&quot;}, \text{&quot;!&quot;}],\\&#xA;R^4=\text{STR}([\text{&quot;H&quot;},\text{&quot;e&quot;},\text{&quot;l&quot;},\text{&quot;l&quot;},\text{&quot;o2&quot;},\text{&quot; &quot;},\text{&quot;w&quot;},\text{&quot;d&quot;},\text{&quot;r&quot;},\text{&quot;l&quot;},\text{&quot;!&quot;}])=\text{&quot;Hello2 wdrl!&quot;}&#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;$$&#xA;M^{12}=\begin{pmatrix}&#xA;   \text{H}\\&#xA;   \text{e}\\&#xA;   \text{l}\\&#xA;   \text{l}\\&#xA;   \text{o}\\&#xA;   \text{ }\\&#xA;   \text{w}\\&#xA;   \text{o}\\&#xA;   \text{r}\\&#xA;   \text{l}\\&#xA;   \text{d}\\&#xA;   \text{!}\\&#xA;\end{pmatrix},&#xA;\\C^{12}_1=\text{&quot;Hello world!&quot;},&#xA;\\E^{12}_1=[\text{&quot;H&quot;},\text{&quot;e&quot;},\text{&quot;l2&quot;},\text{&quot;o&quot;},\text{&quot; &quot;},\text{&quot;w&quot;},\text{&quot;o&quot;},\text{&quot;r&quot;},\text{&quot;l&quot;},\text{&quot;d&quot;},\text{&quot;!&quot;}],&#xA;\\R^{12}=\text{&quot;Hel2o world!&quot;}&#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore the following follows.&#xA;$$&#xA;   \text{FRLE}(\text{&quot;Hello world!&quot;}) = [\dots, \text{&quot;Hell2o word!&quot;}, \dots, \text{&quot;Hello2 wdrl!&quot;}, \dots, \text{&quot;Hel2o world!&quot;}]&#xA;$$&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Tags &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="55550" LastEditorUserId="73111" LastEditDate="2018-09-07T10:45:17.887" LastActivityDate="2018-09-07T10:45:17.887" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="16866" PostTypeId="1" CreationDate="2018-09-04T21:53:24.480" Score="7" ViewCount="346" Body="&lt;p&gt;So, I've seen &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/13494/is-an-entirely-cooperative-koth-on-topic&quot;&gt;this question&lt;/a&gt;, but I feel like mine is different enough to warrant a new post because I have a specific victory objective that I can use to satisfy the winning criterion requirement. Feel free to disagree with this in the comments or votes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So here's what I was thinking. Players can customize a build and then submit a bot which will work together with all of the other bots in the game to fight an enemy AI in some sort of KoTH challenge (which will probably resemble a classical KoTH; I will consider this later as it is not important). The general objective is for the community-programmed team to win the game; however, because of the requirement for a winning criterion, I was thinking I could implement some sort of contribution score accounting for damage dealt (DPS), healing done (Support), and damage blocked (Tank), or something like that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would a challenge with a well-defined contribution score associated with victory be considered on-topic?&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2018-10-31T00:51:26.070" Title="King-Of-The-Hill but fully cooperative?" Tags="|discussion|king-of-the-hill|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16867" PostTypeId="2" ParentId="16866" CreationDate="2018-09-05T01:55:15.227" Score="6" Body="&lt;p&gt;Each bot has its individual goal: improve its score. The means the KotH challenge you describe is &lt;em&gt;not&lt;/em&gt; fully cooperative.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What exactly this means for your challenge depends on rules and details I do not know, but I'm imagining something like this.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You can only heal wounded bots, so you compete with other bots that would like to heal it themselves to score the points.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Likewise, dealing and blocking damage requires you to participate in fights. All damage not dealt/blocked by you, may be dealt/blocked by someone else.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Assuming you can die, it might make sense to fall back at first. Let the other bots get killed, join the battle when the enemy is already weakened.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;While the &lt;em&gt;collective&lt;/em&gt; goal is to beat the enemy AI, successful bots will probably consider individual goals more important, to the point where winning the challenge may require losing to the AI. So while the bots technically all on the same side, I'd very much consider this a competition.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2018-09-05T01:55:15.227" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16871" PostTypeId="2" ParentId="2140" CreationDate="2018-09-07T14:46:22.057" Score="1" Body="&lt;h1&gt;Compile Brainbash to BF&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://esolangs.org/wiki/BF&quot; rel=&quot;nofollow noreferrer&quot;&gt;BF&lt;/a&gt; is an esolang known for it's terseness and small character set. The language operates on a tape of unsigned 8-bit integers, and with a pointer to modify certain values. This pointer starts at the first cell. BF has the following commands available to program with:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+       increment the current cell&#xA;-       decrement the current cell&#xA;&amp;gt;       move the pointer to the next cell on the right&#xA;&amp;lt;       move the pointer to the next cell on the left&#xA;.       output the current cell as a character&#xA;,       take a character of input&#xA;[       begin a loop while the current cell is not zero&#xA;]       end that loop&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/ConorOBrien-Foxx/Brainbash&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brainbash&lt;/a&gt; is a language similar to BF, but it has two tapes. To deal with this, Brainbash has a &quot;tape focus&quot;; one tape at a time is being worked on. Each tape also has its own pointer. Thus, Brainbash has a few more commands in addition to BF's:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;~       swap the tape focus&#xA;*       swap tapes and copy the pointer from the previous tape to the next one&#xA;{       if the current cell is not zero, execute the code until the next `}` that matches &#xA;}       marks the end an if statement&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(There are more commands, but they are not being considered for the purposes of this challenge.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a non-empty Brainbash program &lt;code&gt;P&lt;/code&gt;, translate that program to BF. That is, output a program &lt;code&gt;Q&lt;/code&gt; whose I/O behavior is identical to that of &lt;code&gt;P&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a code-golf, so the shortest in program (in bytes) that successfully does this wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specific rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may assume that each tape is infinite to the right starting at the origin.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that the input is a valid program which has matching &lt;code&gt;{&lt;/code&gt; and &lt;code&gt;}&lt;/code&gt; and &lt;code&gt;[&lt;/code&gt; and &lt;code&gt;]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(to be introduced)&lt;/p&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="31957" LastEditDate="2018-09-08T16:55:41.293" LastActivityDate="2018-09-08T16:55:41.293" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16872" PostTypeId="2" ParentId="2140" CreationDate="2018-09-07T20:33:39.573" Score="-5" Body="&lt;p&gt;I recently made a language called &lt;code&gt;bit&lt;/code&gt;, and your challenge is to create a valid program that takes 2 numbers from STDIN, and outputs the sum of them.&#xA;You may assume the numbers are no more than 5 digits, and your output doesn't need to be more than 5 digits long&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Bit Specification&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You can find the specification and an interpreter at the &lt;a href=&quot;https://github.com/FireCubez/bit&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub repo&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="82488" LastEditorUserId="82488" LastEditDate="2018-09-09T15:33:28.983" LastActivityDate="2018-09-09T15:33:28.983" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="16875" PostTypeId="1" CreationDate="2018-09-09T11:55:39.957" Score="26" ViewCount="407" Body="&lt;p&gt;I saw &lt;a href=&quot;https://codegolf.stackexchange.com/questions/171810/who-can-get-more-points-card-game-koth&quot;&gt;this challenge&lt;/a&gt; which makes the following offer:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; A bounty will be placed on this question once it gets 10 upvotes&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Although we discourage begging for upvotes, excessive self promotion, and certain misuse of bounties, I don't know how the community feels about a challenge author offering to place a bounty when a certain number of upvotes is received on a challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't see any problem with sharing some of the rep gained from upvotes in the form of a bounty on the challenge, but stating this intention up front at the top of the challenge seems similar to begging for upvotes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How do you feel about this approach?&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2018-10-31T00:35:04.830" Title="Offering a bounty in exchange for upvotes" Tags="|discussion|bounty|voting|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16876" PostTypeId="2" ParentId="16875" CreationDate="2018-09-09T13:20:42.503" Score="32" Body="&lt;p&gt;This is not allowed. I've removed the offer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Stack Exchange works by ensuring that the best information rises to the top. Thus, the motivation for upvoting a post needs to be anchored in the merits of the post, not what has been offered in return.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't think offering &lt;em&gt;anything&lt;/em&gt; for upvotes (or upvoting to get what's been offered) is any better than targeted upvoting, where you vote for your friends' stuff and they vote for yours. While most online communities I've been a part of tolerate this kind of friendship, Stack Exchange calls it &lt;em&gt;voting rings&lt;/em&gt; and has several automatic and manual ways to prevent, reverse and (in severe cases) penalize it.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2018-09-09T13:29:57.230" LastActivityDate="2018-09-09T13:29:57.230" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16877" PostTypeId="2" ParentId="2140" CreationDate="2018-09-09T19:41:51.740" Score="2" Body="&lt;h1&gt;The Input String, But Every Time It Says The First Word, It's Recursion&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You wanted to create the ultimate replacement remix, but didn't see a way to add more recursion that ends naturally. Then you saw &lt;em&gt;The Entire Bee Movie But Every Bee Is Replaced With The Entire Bee Movie Without Bees&lt;/em&gt;. Unlike the other replacement remixes, all the inserted copies were from the same text. It was the answer - at each recursing, you could remove the word being replaced, making each copy shorter than the one before it and causing the recursion to eventually end. Your master plan was complete, all that was left was to write the program to fulfill it.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Expansion Function&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let's define some function \$F\$ on a sequence of words. Words are sequences of characters not containing whitespace, which are separated by whitespace.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;define \$F(S)\$:&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;if \$S\$ is empty, return nothing&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;let \$X\$ be the first word in \$S\$&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;let \$Y\$ be \$S\$ with all instances of the whole word \$X\$ removed&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;let \$Z=F(Y)\$&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;return \$S\$ with all instances of the whole word \$X\$ replaced by \$Z\$&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Your task is to implement \$F\$.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input the sequence of words in some form. You may choose any input method.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Output the sequence of words in some form. You may choose any output method.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Only the words in the output count for correctness. If you output as a string, the leading, trailing, and separator whitespace can be anything.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is code golf, so shortest code in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Small case&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;b o o k k e e p e r&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;r r p r r r r p r r e e p e r r r p r r r r p r r e e p e r k k e e p e r o o k k e e p e r&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;See the recursion:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Format:&#xA;&#xA;value of S&#xA;result of F&#xA;&#xA;r&#xA;&#xA;&#xA;p r&#xA;r&#xA;&#xA;e e p e r&#xA;r r p r r&#xA;&#xA;k         k         e e p e r&#xA;r r p r r r r p r r e e p e r&#xA;&#xA;o                             o                             k k e e p e r&#xA;r r p r r r r p r r e e p e r r r p r r r r p r r e e p e r k k e e p e r&#xA;&#xA;b                                                                         o o k k e e p e r&#xA;r r p r r r r p r r e e p e r r r p r r r r p r r e e p e r k k e e p e r o o k k e e p e r&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Large case&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;peter piper picked a peck of pickled peppers a peck of pickled peppers peter piper picked if peter piper picked a peck of pickled peppers wheres the peck of pickled peppers peter piper picked&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;Output:&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;a href=&quot;https://drive.google.com/file/d/1c7Cw_iX8MPMSpo2jzNtpaTOPkOh8i9MS/view?usp=sharing&quot; rel=&quot;nofollow noreferrer&quot;&gt;218854 words&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Hello Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This section will not appear when the challenge is posted to the main site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can't seem to get the quote Markdown right, it might just be a parser bug where it thinks the quote continues even if there are no &lt;code&gt;&amp;gt;&lt;/code&gt;s.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I originally put a description of \$F\$ as an implementation in pseudocode, but I'm considering finding a more mathematical description which tells you less about how to go about implementing it yourself. Still though, there is a challenge in optimizing this for tiny code.&lt;/p&gt;&#xA;" OwnerUserId="75951" LastEditorUserId="75951" LastEditDate="2018-09-13T22:17:00.880" LastActivityDate="2018-09-13T22:17:00.880" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="16880" PostTypeId="2" ParentId="16866" CreationDate="2018-09-10T18:06:53.953" Score="5" Body="&lt;p&gt;Bots can be fully cooperative within games, while competing between games. If a team of bots gets a score for each game, that score can be added to each players individual score. This way, players that contribute to the total chance of doing well will end up with more high-scoring games.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One issue I foresee in such a challenge is a lot of randomness based on what bots you are on a team with. This just means you will need more rounds to make everything balance out.&lt;/p&gt;&#xA;" OwnerUserId="31203" LastActivityDate="2018-09-10T18:06:53.953" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16886" PostTypeId="2" ParentId="14737" CreationDate="2018-09-11T14:37:00.193" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://www.github.com/FireCubez/bit&quot; rel=&quot;nofollow noreferrer&quot;&gt;Bit&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Bit is a stack-based language created by myself, it is similar to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14747/82488&quot;&gt;Cubically&lt;/a&gt; in that it forces users to think of intuitive ways to do simple things (see examples below), the specification, documentation and interpreter are available at the link above.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Adding to the examples in the GitHub link, heres a Truth-Machine program (If input is 0, print 0, if input is 1, print 1 infinitely)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;main.bit&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;BYTE var $$ creates a variable called 'var'&#xA;IN $$ Read input, stack = [[I, N, P, U, T, B, Y, T, E, S]]&#xA;INTO $$ turn [[something]] into [something]&#xA;PUSH var $$ Sets var to the user's input in bytes&#xA;IMPORT var $$ Reads the value of var, and searches for a file called 0 or 1 depending on user input, then executes it&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;0&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;BYTE&#xA;PRINT&#xA;PRINTLN&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;1&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;BIT 1&#xA;BYTE one $$ Variable called one with value 1&#xA;PRINT one&#xA;PRINTLN&#xA;IMPORT one $$ Recursion&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Why?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I think bit is an interesting language because of the type of thinking you need to program in it.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Tips&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/172001/&quot;&gt;Programming in Bit&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Chat room:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(none yet)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Interesting questions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Some interesting questions to be asked about this language:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A cat program (actually quite easy)&lt;/li&gt;&#xA;&lt;li&gt;Input adder (Possible but hard)&lt;/li&gt;&#xA;&lt;li&gt;Split input by commas and print each item&lt;/li&gt;&#xA;&lt;li&gt;Quine&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="82488" LastEditorUserId="82488" LastEditDate="2018-09-11T15:32:29.067" LastActivityDate="2018-09-11T15:32:29.067" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16889" PostTypeId="2" ParentId="2140" CreationDate="2018-09-12T01:31:02.113" Score="1" Body="&lt;h1&gt;Make it rotationally-symmetric&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(sandbox note: am I using the wrong terminology?)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Background&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;While looking at &lt;a href=&quot;https://codegolf.stackexchange.com/questions/172005/a-chiral-puzzle&quot;&gt;this challenge&lt;/a&gt;, I notice &lt;s&gt;many&lt;/s&gt; some of the answers has 4-fold rotational symmetry. I think it would be convenient to have a program to automatically do it.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take input as a string, for which when separated by newlines, all line has equal length. (i.e., the input is rectangular)&lt;/li&gt;&#xA;&lt;li&gt;The output is the smallest square with 4-fold rotational symmetry, where the top-left corner is equal to the rectangle.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Sample input/output&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA;aba&#xA;bab&#xA;aba&#xA;&#xA;Output:&#xA;aba&#xA;bab&#xA;aba&#xA;&#xA;Input:&#xA; begin write('left')end.// &#xA;/e .dne)'thgir'(etirw nigeb&#xA;&#xA;Output:&#xA; begin write('left')end.// &#xA;/e .dne)'thgir'(etirw nigeb&#xA;/g                        e&#xA;.i                       .g&#xA;dn                       di&#xA;n                        nn&#xA;ew                       e &#xA;)r                       )w&#xA;'i                       'r&#xA;tt                       ti&#xA;fe                       ht&#xA;e(                       ge&#xA;l'                       i(&#xA;'r                       r'&#xA;(i                       'l&#xA;eg                       (e&#xA;th                       ef&#xA;it                       tt&#xA;r'                       i'&#xA;w)                       r)&#xA; e                       we&#xA;nn                        n&#xA;id                       nd&#xA;g.                       i.&#xA;e                        g/&#xA;begin write('right')end. e/&#xA; //.dne)'tfel'(etirw nigeb &#xA;&#xA;Input:&#xA;abc&#xA;cde&#xA;&#xA;Output:&#xA;abcca&#xA;cdedb&#xA;ce ec&#xA;bdedc&#xA;accba&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Winning criteria&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="69850" LastActivityDate="2018-09-12T01:31:02.113" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16890" PostTypeId="2" ParentId="1475" CreationDate="2018-09-13T08:30:48.793" Score="2" Body="&lt;h1&gt;Puzzles and Games&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Single-player puzzles/games can easily be formulated as either &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; (solve it) or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; (try to optimize the score). Two-player games can be formulated as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;. Indeed there are many more puzzles than you think.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/List_of_NP-complete_problems#Games_and_puzzles&quot; rel=&quot;nofollow noreferrer&quot;&gt;List of NP-complete problems: Games and puzzles&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/List_of_PSPACE-complete_problems#Games_and_puzzles&quot; rel=&quot;nofollow noreferrer&quot;&gt;List of PSPACE-complete problems: Games and puzzles&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Nikoli_(publisher)#Nikoli_puzzles&quot; rel=&quot;nofollow noreferrer&quot;&gt;List of Nikoli puzzles on Wikipedia&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Category:Logic_puzzles&quot; rel=&quot;nofollow noreferrer&quot;&gt;Logic Puzzles category on Wikipedia&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;http://www.cross-plus-a.com/puzzles.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;List of puzzles supported by Cross+A, the puzzle solver &amp;amp; generator&lt;/a&gt;&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2018-09-29T04:36:52.797" LastActivityDate="2018-09-29T04:36:52.797" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16893" PostTypeId="2" ParentId="2140" CreationDate="2018-09-13T19:57:28.430" Score="4" Body="&lt;h1&gt;Nearest neighbors in a square lattice&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/square-lattice&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;square-lattice&amp;#39;&quot; rel=&quot;tag&quot;&gt;square-lattice&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Premise&lt;/h2&gt;&#xA;&lt;p&gt;Consider an infinite 2D square lattice. We can choose one point as the origin and label each point with a pair of integers that corresponds to points on the Euclidean plane:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/mmw6M.png?s=256&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/mmw6M.png?s=256&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Now consider the point at the origin, &lt;span class=&quot;math-container&quot;&gt;\$(0,0)\$&lt;/span&gt;. The set of lattice points closes to the origin (but not including the origin) is &lt;span class=&quot;math-container&quot;&gt;\$\{(1,0),(0,1),(-1,0),(0,-1)\}\$&lt;/span&gt;. We will call this set the &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt;st nearest neighbors. The set of lattice points closest to the origin but not including the &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt;st nearest neighbors is &lt;span class=&quot;math-container&quot;&gt;\$\{(1,1),(-1,1),(-1,-1),(1,-1)\}\$&lt;/span&gt;. We call this set the &lt;span class=&quot;math-container&quot;&gt;\$2\$&lt;/span&gt;nd nearest neighbors&lt;/p&gt;&#xA;&lt;p&gt;Now we can define the &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;-th nearest neighbors as the set of points closest to the origin and not included in the union of the set of &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-th nearest neighbors for &lt;span class=&quot;math-container&quot;&gt;\$n\in\{1,2,...k-1\}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Define the sequence &lt;span class=&quot;math-container&quot;&gt;\$NN(k)\$&lt;/span&gt; as the length of the set of &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;-th nearest neighbors.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Given &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;, compute &lt;span class=&quot;math-container&quot;&gt;\$NN(k)\$&lt;/span&gt;. This is &lt;a href=&quot;https://oeis.org/A105352&quot; rel=&quot;nofollow noreferrer&quot;&gt;A105352&lt;/a&gt; on OEIS without the first element.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may use 0- or 1- based indexing.&lt;/li&gt;&#xA;&lt;li&gt;Given &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;, you may either output the first &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; elements of the sequence or the &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;-th element.&lt;/li&gt;&#xA;&lt;li&gt;You may alternatively take no input and output the sequence indefinitely.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes disallowed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Here are some 1-indexed test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;n   NN(k)&#xA;1   4&#xA;8   8&#xA;9   4&#xA;10  8&#xA;38  16&#xA;52  8&#xA;80  8&#xA;121 24&#xA;145 12&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="75553" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-09-15T16:33:13.450" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="16894" PostTypeId="2" ParentId="2140" CreationDate="2018-09-14T05:08:42.893" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&#xA;I have an idea for a KOTH challenge (that is marginally similar to the current &lt;a href=&quot;https://codegolf.stackexchange.com/questions/172102/lets-play-some-reaper&quot;&gt;Reaper KOTH)&lt;/a&gt;, but none of the expertise required to make it work. The idea is based on the card game &lt;a href=&quot;https://boardgamegeek.com/boardgame/15512/diamant&quot; rel=&quot;nofollow noreferrer&quot;&gt;Diamant&lt;/a&gt; aka Incan Gold, and the rules of the game are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The game is played over 5 expeditions, each with the same structure.&lt;/li&gt;&#xA;&lt;li&gt;At the start of each expedition, a special deck of cards is shuffled, containing gem cards and hazard cards (and in some versions of the game, one artifact card is added to the deck every expedition).&lt;/li&gt;&#xA;&lt;li&gt;Every turn, a card is revealed from the deck.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a hazard card is revealed and another copy of the same hazard has already been revealed in the expedition, the expedition immediately ends and all remaining players lose their accumulated gems. The revealed hazard card is removed from the deck for future expeditions.&lt;/li&gt;&#xA;&lt;li&gt;If a gem card is revealed, the number of gems shown on the card is shared evenly between remaining players, with any remainder placed in a common pool.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;After the card is revealed, if the expedition has not ended, then players simultaneously decide whether they want to &quot;Stay&quot; or &quot;Go Home&quot;.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All players who choose &quot;Go Home&quot; share the gems in the common pool between them (leaving any remainder), and then bank all of their gems. They are no longer in the expedition.&lt;/li&gt;&#xA;&lt;li&gt;If a single player chooses &quot;Go Home&quot;, they claim all of the gems in the common pool plus any artifacts that were revealed.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;If there are players remaining in the expedition, then a new turn begins.&lt;/li&gt;&#xA;&lt;li&gt;If there are no players remaining in the expedition, then the expedition ends.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If this was the last expedition, then players count up the gems they banked plus bonus gems for artifacts they claimed, and the player with the most gems wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;My thought is that we could simplify the game for KOTH - one expedition, no artifacts - and run games which pit 4 bots against each other in some configuration, with each bot's overall rating being its average score per game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem is that I have no experience in any meaningful programming languages. The other problem is that I don't know how to run a contest like that. The other other problem is that I don't know whether it's worth running.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can anyone offer assistance or advice on any of those three problems?&lt;/p&gt;&#xA;" OwnerUserId="32668" LastActivityDate="2018-09-14T05:08:42.893" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16897" PostTypeId="2" ParentId="2140" CreationDate="2018-09-14T19:57:35.263" Score="-1" Body="&lt;h1&gt;My Ribosomes Got a Firmware Upgrade&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/bioinformatics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;bioinformatics&amp;#39;&quot; rel=&quot;tag&quot;&gt;bioinformatics&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;So all of the Apple iBosomes in my body have been updated to RibOS 4.0 now… while I appreciate the additional optimizations that were added, unfortunately for me they've dropped support for the legacy mRNA API.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So since my RNA Polymerase library still needs to return strings in the format &lt;code&gt;AUUCGGUCAAAGU&lt;/code&gt; for the code still using it, I'll need to add some code to the &lt;code&gt;getBasePairs()&lt;/code&gt; method to translate it from the new API.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your input will be a string in base64 (because codons are exactly 6 bits) representing the genome.&lt;/li&gt;&#xA;&lt;li&gt;You should &lt;em&gt;output&lt;/em&gt; a string with the equivalent RNA base pair sequence:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;00&lt;/code&gt; becomes &lt;code&gt;A&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;01&lt;/code&gt; becomes &lt;code&gt;G&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;10&lt;/code&gt; becomes &lt;code&gt;C&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;11&lt;/code&gt; becomes &lt;code&gt;U&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;All languages are allowed.&lt;/li&gt;&#xA;&lt;li&gt;Your I/O must be in these exact string formats, even if they're small enough to encode as integers.&lt;/li&gt;&#xA;&lt;li&gt;The shortest answer in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="62402" LastEditorUserId="62402" LastEditDate="2018-09-18T21:44:20.417" LastActivityDate="2018-09-18T21:44:20.417" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16898" PostTypeId="2" ParentId="16712" CreationDate="2018-09-15T15:00:43.317" Score="1" Body="&lt;p&gt;The header for an answer needs to include its score, as that's necessary for people to compare the answers. For most &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; answers, this will be the length in bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's also helpful to include anything else in the header that might be useful to someone trying to assess the score themself. For example, if the byte count is higher than the character count due to multibyte characters, something like &quot;6 bytes, 4 characters&quot; or &quot;6 bytes of UTF-8&quot; would help to explain to people reading the code why the byte count was correct. (Sometimes it's helpful to give an explanatory note even when the byte count equals the character count; things like &quot;10 bytes in Jelly's codepage&quot; or &quot;4 bytes of ASCII&quot; are helpful to people's understanding in languages which use many non-ASCII characters, or languages which are normally encoded using sub-byte encodings but in this case are using a single-byte character set instead.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; you'd normally include the score in the header rather than a byte count, but code challenges frequently have tie-breaks, and program length is a common tie break. So including that in the header is helpful if it seems like there's any chance that there might be a tie. (For example, if you've maxed out the primary score criterion, answers from then on are going to be competing on the secondary score criterion, so you'd want to list the length in much the same way as you would for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;; the challenge has effectively turned into &quot;golf this program while maximising the primary score&quot;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This doesn't apply when an answer has no readily-available score (e.g. because it's an uncracked &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; submission and the secondary scoring criterion is something that can't be revealed until the answer becomes safe, or a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; submission whose score may change from run to run).&lt;/p&gt;&#xA;" OwnerUserId="76359" LastEditorUserId="76359" LastEditDate="2018-09-15T15:49:53.087" LastActivityDate="2018-09-15T15:49:53.087" CommentCount="0" CommunityOwnedDate="2018-09-15T15:00:43.317" ContentLicense="CC BY-SA 4.0" />
  <row Id="16901" PostTypeId="2" ParentId="2140" CreationDate="2018-09-17T12:46:25.710" Score="2" Body="&lt;h1&gt;Triangular snake&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You're given a triangular field:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/kBDOy.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/kBDOy.png&quot; alt=&quot;Triangular field&quot;&gt;&lt;/a&gt;&#xA;&lt;p&gt;&#xA;It has 4 &lt;strong&gt;ports&lt;/strong&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You're also given five different &lt;strong&gt;pieces&lt;/strong&gt; from A to E:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Tv2O6.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Tv2O6.png&quot; alt=&quot;Pieces&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each &lt;strong&gt;piece&lt;/strong&gt; has a little piece of path inside it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your basic goal is to build paths between &lt;strong&gt;ports&lt;/strong&gt;. There are some rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each cell of the field can be occupied by 0 or 1 &lt;strong&gt;pieces&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A &lt;strong&gt;port&lt;/strong&gt; can either point to an empty cell or be an endpoint of a path. That is, this is illegal:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/mgI2L.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/mgI2L.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;The &lt;strong&gt;path&lt;/strong&gt; starts with a port and ends with a port.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;strong&gt;path&lt;/strong&gt; must not be broken up into pieces, i.e. every edge of a piece through which a path goes must not touch an empty cell or a border without a port.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is an example of a legal path:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/wZrFJ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/wZrFJ.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This path can be represented as &lt;strong&gt;&quot;CBEDEAD&quot;&lt;/strong&gt; or &lt;strong&gt;&quot;DAEDEBC&quot;&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There is no input.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your ultimate task is to output all the possible paths. Your output must not contain illegal paths. You can output the paths in any readable way. Order, repetitions and letter case don't matter. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="82886" LastEditorUserId="82886" LastEditDate="2018-09-17T13:14:50.143" LastActivityDate="2018-09-17T13:14:50.143" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16903" PostTypeId="2" ParentId="2140" CreationDate="2018-09-17T21:10:41.520" Score="4" Body="&lt;h2&gt;Breaking into 3 Palindromes:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As discussed &lt;a href=&quot;https://www.youtube.com/watch?v=OKhacWQ2fCs&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; and &lt;a href=&quot;https://arxiv.org/pdf/1602.06208v2.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;, every positive integer can be written as the sum of 3 palindrome integers.  Given a number &quot;n&quot;, output these integers.  &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is a code golf challenge.  The shortest functional solution wins.&lt;/li&gt;&#xA;&lt;li&gt;The input number &quot;n&quot; will be any integer greater than 0 but less than 1,000,000,000.&lt;/li&gt;&#xA;&lt;li&gt;The three output numbers must be palindromes.  Their sum must be &quot;n&quot;.&lt;/li&gt;&#xA;&lt;li&gt;A palindrome number is a number which is the same forwards as backwards.  It can have any number of digits.&lt;/li&gt;&#xA;&lt;li&gt;To make this easier, I will allow positive or negative palindrome integers.&lt;/li&gt;&#xA;&lt;li&gt;Output and input can be formatted in any what that is convenient as long as it can be readily understood.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input: 5&#xA;output: 0,0,5&#xA;&#xA;input: 1234&#xA;output: 1001,222,11&#xA;&#xA;input: 3141592&#xA;output: 2200022,926629,14941&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="29108" LastEditorUserId="29108" LastEditDate="2018-09-18T14:37:11.590" LastActivityDate="2018-09-18T14:37:11.590" CommentCount="17" ContentLicense="CC BY-SA 4.0" />
  <row Id="16904" PostTypeId="1" AcceptedAnswerId="16905" CreationDate="2018-09-17T22:03:49.670" Score="3" ViewCount="106" Body="&lt;p&gt;I have the shortest answer in my language on a particular challenge at PPCG@StackExchange. I am struggling with a particular part of a program and I want some help. Is it appropriate/allowed/okay to ask for help at StackOverflow if I mention in the beginning that the problem is from a specific challenge at PPCG and give credit if someone answers my question?&lt;/p&gt;&#xA;" OwnerUserId="82886" LastActivityDate="2018-09-18T05:38:16.597" Title="Asking for help on StackOverflow" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16905" PostTypeId="2" ParentId="16904" CreationDate="2018-09-17T23:19:30.783" Score="9" Body="&lt;p&gt;You can get help from whomever is willing to help you. It's customary to mention all people that helped you in your answer, but that's really between you and them, not you and us. SO answers are licensed, so attribution is mandatory in this case.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Other PPCG users will sometimes leave golfing suggestions in the comment section. Here, the recommended procedure is to mention the helping user in the answer, so the comment can be deleted afterwards.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since you asked about Stack Overflow in particular, I'd like to mention that your question may be off topic for SO. Questions about the scope of SO are best asked on &lt;a href=&quot;https://meta.stackoverflow.com&quot;&gt;Meta SO&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, you can ask for golfing help in our site's main chat room (&lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;) or&amp;mdash;if the problem is sufficiently interesting&amp;mdash;ask a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question on PPCG itself. Personally, I'd try the chat room first.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="59487" LastEditDate="2018-09-18T05:38:16.597" LastActivityDate="2018-09-18T05:38:16.597" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16907" PostTypeId="1" CreationDate="2018-09-18T14:05:43.573" Score="7" ViewCount="439" Body="&lt;p&gt;I'm creating a programming language aimed at code golf puzzles. The language has an internal set of tapes, where the computations are saved and then retrieved to the user.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the end of the program, the interpreter prints the values on the tapes, and this is considered the result of the computation. However, many problems do not need a set of tapes as an answer, only one tape (in that case, the first tape) or even a single number (the first number in the first tape).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would it be cheating if I made it possible as an argument during the interpreter execution? Like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;my_interpreter.exe --code '&amp;lt;my-code&amp;gt;' --print-format 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Of course, I'd like to avoid making it a language function as it would make the results bigger and, therefore, make my language worse in code golf.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't consider changing the print format as a calculation step. Also, the default behavior is to print the whole set of tapes, and even when the puzzle expects a single value as result, the value is actually there. It would just print some garbage along the result and I'd like to avoid that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;BUT I need your opinion as well since this language is not just for me. I won't make it an execution argument unless everyone agrees with it. Also, I don't want other code golf language owners to feel cheated. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;What do you think about that?&lt;/p&gt;&#xA;" OwnerUserId="68590" OwnerDisplayName="Eduardo Hoefel" LastEditorUserId="36398" LastEditDate="2018-09-19T09:56:45.470" LastActivityDate="2018-09-27T04:06:19.883" Title="Interpreter flags for controlling output: considered cheating?" Tags="|discussion|" AnswerCount="2" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="16910" PostTypeId="2" ParentId="16907" CreationDate="2018-09-18T23:21:08.833" Score="6" Body="&lt;p&gt;According to our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14339/68942&quot;&gt;current consensus&lt;/a&gt;, this is valid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are some concerns raised in the comments:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;@HyperNeutrino is this the &quot;official&quot; opinion now? Sounds mostly reasonable, but for a flag as suggested here, it would instantly make this new language an infinite pool of languages...&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;sup&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/16907/would-this-be-considered-cheating#comment59635_16907&quot;&gt;Comment by Felix Palmen&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is not really a problem - if it leads to low-quality answers, downvotes will serve as quality control.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;With the proposal of considering different flags as different implementations, flags could be abused to encode more and more of the actual program. Remember (sic) &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5076/36398&quot;&gt;MegaGolfScript&lt;/a&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;sup&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/16907/would-this-be-considered-cheating#comment59638_16907&quot;&gt;Comment by Luis Mendo&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Sure, but we consider challenges to be more of competitions within languages, rather than competitions across languages, so it would only impact the competition for that exact set of flags, and others who don't care to use such languages aren't affected.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2018-09-18T23:21:08.833" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="16912" PostTypeId="2" ParentId="2140" CreationDate="2018-09-20T08:31:06.920" Score="1" Body="&lt;h1&gt;Mini Castle Wars &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note&lt;/strong&gt;: This is very early draft, and I'll try to develop when I get some time to spare.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/q/171810/78410&quot;&gt;a previous KOTH based on a card game (but not actually a card game)&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This challenge involves a simplified version of the card game &lt;a href=&quot;http://www.kongregate.com/games/m0rkeulv/castlewars&quot; rel=&quot;nofollow noreferrer&quot;&gt;Castle Wars&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Game rules&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Gameplay&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Just like many other card games, Castle Wars is a two-player turn-based game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each player starts with 30 units of &lt;strong&gt;castle&lt;/strong&gt;, 5 units of &lt;strong&gt;fence&lt;/strong&gt;, no &lt;strong&gt;shield&lt;/strong&gt;, 2 &lt;strong&gt;workers&lt;/strong&gt;, 8 &lt;strong&gt;bricks&lt;/strong&gt;, 2 &lt;strong&gt;magicians&lt;/strong&gt;, and 8 &lt;strong&gt;crystals&lt;/strong&gt;. Each player is dealt (TBD, 5?) cards from his own deck at start.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each resource has the following function:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Castle&lt;/strong&gt;: Directly related to the &lt;strong&gt;winning condition&lt;/strong&gt; (see below).&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Fence&lt;/strong&gt;: Fences can block the opponent's attack. If the attack would damage the castle by N units, the fence is damaged N units instead. If the fence is less than N units, it becomes zero and the remaining damage is dealt to the castle.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Shield&lt;/strong&gt;: If a castle is shielded, it can nullify any amount of damage to the castle AND the fence, exactly once. Shield can't be stacked.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Workers&lt;/strong&gt;: Each worker produces &lt;strong&gt;one brick every turn&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Magicians&lt;/strong&gt;: Each magician produces &lt;strong&gt;one crystal every turn&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Bricks&lt;/strong&gt; and &lt;strong&gt;Crystals&lt;/strong&gt;: Every card spends some of these resources to take effect.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Each turn works as follows:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;He gets the resources produced by his own workers and magicians.&lt;/li&gt;&#xA;&lt;li&gt;The player draws a card from his own deck.&lt;/li&gt;&#xA;&lt;li&gt;He plays a card. If he has enough resources, the card takes effect immediately (including the resources spent). Otherwise, it has no effect whatsoever.&lt;/li&gt;&#xA;&lt;li&gt;The played card returns to the deck, and the deck is shuffled.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;In order to compensate the first-player advantage, resource generation is skipped at the first turn of the game.&lt;/s&gt; (TBD)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Cards &amp;amp; deck&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A deck consists of at least (TBD) cards, and may include at most (TBD) copies of the same card.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is the full list of cards.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;(TBD, will reflect the actual cards in the game)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Winning condition&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A player wins if the opponent's castle is destroyed (0 units or below), or his own castle grows to 100 units or higher. If 100 turns are passed without a player winning, the one with higher castle is declared the winner. Same castle height after 100 turns is a draw.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Tournament&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Every bot will have (TBD, even number) matches with every other bot, alternating the first turn.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Controller&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;TBD. This will ideally be implemented in &lt;a href=&quot;https://github.com/davidje13/koth-webplayer&quot; rel=&quot;nofollow noreferrer&quot;&gt;KOTH-Webplayer&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Submission guide&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A submission will look like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Deck&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;'AAAAABBBBBCCDDEXYZ'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Bot&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;return hand[Math.random()*hand.length|0];&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The &lt;strong&gt;Deck&lt;/strong&gt; is a string literal that describes the list of cards your bot will use. The &lt;strong&gt;Bot&lt;/strong&gt; is a snippet that will fit into the following function's body:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function play(hand, myResources, opResources, opPlayed, storage) {&#xA;    // function body here&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The description of parameters:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;hand&lt;/code&gt; is an Array of (TBD) cards in your bot's hand. Your bot's job is to choose a card to play.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;myResources&lt;/code&gt; and &lt;code&gt;opResources&lt;/code&gt; are two Objects that have the information of all the resources (the bot's and the opponent's, respectively). Available keys are &lt;code&gt;castle&lt;/code&gt;, &lt;code&gt;fence&lt;/code&gt;, &lt;code&gt;worker&lt;/code&gt;, &lt;code&gt;brick&lt;/code&gt;, &lt;code&gt;magician&lt;/code&gt;, &lt;code&gt;crystal&lt;/code&gt;, &lt;code&gt;shield&lt;/code&gt;. (&lt;code&gt;shield&lt;/code&gt; is a Boolean indicating whether the player's castle is shielded or not; others are simple numbers.)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;opPlayed&lt;/code&gt; is the card played at the opponent's last turn.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;storage&lt;/code&gt; is an Object you can freely use to store information between turns. It is initially empty (&lt;code&gt;{}&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Meta&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I originally planned to have a simplified version of the original Castle Wars, but on second thought, the rules are not &lt;em&gt;that&lt;/em&gt; complicated and removing some resource types may break the balance of the game (as some interesting cards have to be revised). &lt;strong&gt;Would it be good to implement the full game instead?&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2018-09-21T00:56:25.487" LastActivityDate="2018-09-21T00:56:25.487" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16913" PostTypeId="2" ParentId="2140" CreationDate="2018-09-20T16:33:19.930" Score="0" Body="&lt;h1&gt;Output the answer after yours &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stack-exchange-api&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stack-exchange-api&amp;#39;&quot; rel=&quot;tag&quot;&gt;stack-exchange-api&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Related:&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/34705/output-the-answer-above-yours&quot;&gt;Output the answer above yours&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This challenge is very similar to the above, but I hope it's different enough to warrant posting. The difference is that you need to post the answer that is posted after yours (the whole answer, not just the &amp;lt;code&amp;gt; block). Also, your output can be the answer text or the HTML code of the answer. When your post is still the newest post, your program should just output nothing.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;No URL Shorteners&lt;/li&gt;&#xA;&lt;li&gt;No programs that need to be run at a specific URL.&lt;/li&gt;&#xA;&lt;li&gt;No updating your answer with information gained after posting (i.e your answer id, text or answer id of post that comes after yours). &lt;strong&gt;Exception:&lt;/strong&gt; It's OK to hardcode the page number of your answer (on 'oldest' sort).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;I think mine is different enough from the linked question, because that has some different rules, and my version closes loopholes used on the other question. Also, no one utilizes the StackAPI on that one.&lt;/p&gt;&#xA;" OwnerUserId="46313" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-09-20T16:50:29.703" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16916" PostTypeId="2" ParentId="16736" CreationDate="2018-09-20T21:36:23.650" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://meta.stackexchange.com/questions/315662/responsive-design-released-for-all-beta-undesigned-sites/317272#317272&quot;&gt;Direct link to an answer misaligns the top of the answer second time&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(now posted to the main MSE question instead)&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2018-10-25T20:54:50.800" LastActivityDate="2018-10-25T20:54:50.800" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16917" PostTypeId="1" AcceptedAnswerId="16918" CreationDate="2018-09-21T12:39:08.323" Score="3" ViewCount="189" Body="&lt;p&gt;When I searched with -[code-golf] i did not get interesting results.&#xA;I am looking for the questions (and as popular as CodeGolf questions) that disallow or not require the Code to be golfed to Bytes. Just some programming puzzles offering fun/interesting challenges and solutions in various languages.&lt;/p&gt;&#xA;" OwnerDisplayName="user58120" LastEditorUserId="56656" LastEditDate="2018-09-21T13:57:38.503" LastActivityDate="2018-10-31T00:18:39.670" Title="Do we have Programming Puzzles where the CodeGolf'ing is not the criteria and actually disallowed?" Tags="|discussion|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16918" PostTypeId="2" ParentId="16917" CreationDate="2018-09-21T13:50:26.397" Score="5" Body="&lt;h1&gt;There are other, active, alternatives&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Our on-topic page says (in part):&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;All challenge questions on this site should have: [...]&#xA;  An objective primary winning criterion, so that it is possible to indisputably decide which entry should win.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is a fundamental pillar of the site. As a consequence, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is by far our most popular winning criterion, with 8359 out of the 9979 total questions marked with that tag. For the most part, this is because the tag is easy to apply, easy to score, and easy to use. It provides easy objectivity, and an easy way to meet that requirement.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, there certainly are other popular tags:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, a tournament-style competition between various bots, with unique scoring per challenge. Especially recently, this tag has become quite popular, with ten challenges in the past two months.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;, a competitive-programming challenge, where one person tries to obfuscate code in some specified manner, and others try to crack the obfuscation.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, pretty much a catch-all for challenges that have uniquely defined scoring criteria.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, exactly what it says on the tin.&lt;/li&gt;&#xA;&lt;li&gt;etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42963" LastActivityDate="2018-09-21T13:50:26.397" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16919" PostTypeId="2" ParentId="2140" CreationDate="2018-09-21T20:04:41.173" Score="-2" Body="&lt;h2&gt;The Tiniest Generic Evolutionary AI&lt;/h2&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ai&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ai&amp;#39;&quot; rel=&quot;tag&quot;&gt;ai&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Introduction&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The smallest program you can make (measured in bytes) that builds evolving AIs that parses unknown text string A into unknown text string  B that still evolves.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All languages are options. Internet connectivity is allowed (but not providing any specific links). The AI must have a choice of commands (allowing variables) from a Turing Complete instruction set.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Scoring is two fold:&#xA;N = Number of bytes of program (ignoring size of AIs generated)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;T = The average generations (generations of 200 AIs or less) before your program can evolve an AI that can do the 5 test cases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Score = 1000/(N*T)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rules:&#xA;Using the fewest bytes possible, create a generic evolutionary AI that will evolve to parse one supplied but previously unknown string into another supplied but previously unknown string. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;What qualifies as an evolutionary AI in this context:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Your Code&#xA;Takes an input string&#xA;Takes a seed AI Instruction Set(s)&#xA;Runs AI Instruction Sets&#xA;Rates Each AI Instruction Set against others and against test strings&#xA;Evolves AI to create a new set of AI Instruction Set(s) through random mutation and breeding of existing AIs.&#xA;=================&#xA;AI Code&#xA;Is not written by you (except for possibly a seed AI), to be created by your program instead.&#xA;Uses a set of *available* instructions that are or are inspired by a known Turing complete instruction set (such as RISC)&#xA;Should consist of references to the available instructions and values for them.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The code you write does not parse the strings directly. Instead, it writes output that is a collection of instructions, and reads in a collection of instructions and applies these instructions. (Ugly as it may be, eval is allowed).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It reads in multiple optional instruction sets.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It rates those instruction sets based on which gets closest to parsing the input string into the target string.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The best performing instructions sets are encouraged in some way.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The worst performing instruction sets are discouraged and/or eliminated in some way.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Using existing AI-oriented libraries is discouraged.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Allowing evolutionary AIs to use develop using a turing-complete set of instructions is encouraged. (Example solution uses a modified RISC instruction set.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Instruction sets must be able to mutate (randomly change) between generations. They are allowed to breed (selectively change) between generations as well.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Multiple iterations of comparing and evolving instructions sets is possible.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;How quickly your AIs evolve or how well they do the job doesn't matter so much as they can get better at the task over iterations.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A seed starting instruction set is allowed. If your solution requires an inputed file for an initial instruction set, a functional example is required and counts towards the byte count.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It handles if an instruction set it runs fails to complete, or times out if an AI instruction set goes on too long (default to 30 seconds).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Program must accept in one arbitrary string from a source. (Your choice of a generic commonly used source, such as a web form, command line, or file). It outputs each AI instruction set's result in a similar format it took them in. It may also optionally accept a starter AI set of instructions. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The AI code never gets to interact with the test string it's being graded against.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program cannot do any string conversions on the input string on its own, only may act as it's instructed to by the AI. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A seed AI is not allowed to have anything more than a start, end, or return call of some kind (it must evolve any processing steps on its own).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test Cases:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can the program evolve an AI that approaches being capable of string conversion of an unknown conversion? (It is recommended not to build the AI to these specific test cases, these are for the point of testing genericness. Do not specifically target these cases until reporting results, and others testing your program may test them against other string conversions and rate accordingly.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Five examples follow - &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abcdefghijklmnopqrstuvwxyz&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;will be converted into&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;zyxwvutsrqponmlkjihgfedcba&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or possibly &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1010101100110101011001&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;will be converted into&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0101010011001010100110&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or possibly&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;Mary had a little lamb.&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;will be converted into&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;Gary had a little ham.&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or possibly&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;Banana&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;will be converted to &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;Banananananananananananananananana.&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or maybe&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The entire text of the Bible&lt;/p&gt;&#xA;&#xA;&lt;p&gt;will be converted to&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The entire text of the Bible, but every instance of &quot;sheep&quot; is replaced with &quot;codfish&quot;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Short Diagram of interaction.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   STEP 1                         STEP 2                     STEP 3  ...&#xA;&#xA; Input String           -&amp;gt;&#xA; Expected Output String -&amp;gt;   Your Code Starts  -&amp;gt;    Assorted AI Instruction sets. -&amp;gt;      -&amp;gt;        -&amp;gt;       -&amp;gt;      Your Code Processes AI Instruction Sets -&amp;gt; Your code compares, mutates, and breeds AIs to create new generation -&amp;gt; Return to Step 3&#xA; Seed AI                -&amp;gt;                     (Example: AI1 -&amp;gt; Start(Input); Output(Input)&#xA;                                                         AI2 -&amp;gt; Start(Input); CP(Mem1, Mem2); Output (Mem2);)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An on-a-whim project done that roughly followed these rules and inspired this challenge that ran &amp;lt;1000 lines of code (although short, it did not aim for minimal characters.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/joshupetersen/myLittleAi&quot; rel=&quot;nofollow noreferrer&quot;&gt;myLittleAI&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="78929" LastEditorUserId="78929" LastEditDate="2018-09-27T20:07:17.777" LastActivityDate="2018-09-27T20:07:17.777" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="16922" PostTypeId="2" ParentId="2140" CreationDate="2018-09-23T07:59:14.050" Score="-3" Body="&lt;p&gt;Write a program that takes a list of strings as input and creates trees of prefixes as such:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hi_there_how_are_you?&#xA;Hi_there_would_you_mind?&#xA;Hi_the_weather_is_nice&#xA;Hills_are_green&#xA;Many_of_us&#xA;May_has_11_days&#xA;May_has_11_days_left&#xA;IWillLearnTheTrombone&#xA;IWillLearnTheSaxophone&#xA;IWillLearnThePiano&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which would output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hi Hi_there Hi_there_how_are_you?&#xA;            Hi_there_would_you_mind?&#xA;   Hi_the_weather_is_nice&#xA;   Hills_are_green&#xA;Ma Many_of_us&#xA;   May_has_11_days May_has_11_days&#xA;                   May_has_11_days_left&#xA;IWillLearnThe IWillLearnTheTrombone&#xA;              IWillLearnTheSaxophone&#xA;              IWillLearnThePiano&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The input strings shall contain no spaces and the output shall be separated by at least one space, any number of extra line breaks or spaces are allowed. The output above is formatted to explain the challenge, the following formatting is also valid: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hi Hi_there Hi_there_how_are_you? Hi_there_would_you_mind? Hi_the_weather_is_nice Hills_are_green Ma Many_of_us May_has_11_days May_has_11_days May_has_11_days_left IWillLearnThe IWillLearnTheTrombone IWillLearnTheSaxophone IWillLearnThePiano&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This question is a kind of reverse of this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/54733/prefix-tree-traversal&quot;&gt;Prefix Tree Traversal&lt;/a&gt;. This is code golf, shortest code in bytes win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; I'm struggling with the output? What would be the most 'fun'/ have high potential for cleverness? The one I have now just looks like a mess. Can i have output as a list of lists(of lists)? Or do that hinder people?&lt;/p&gt;&#xA;" OwnerUserId="74389" LastActivityDate="2018-09-23T07:59:14.050" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16923" PostTypeId="2" ParentId="2140" CreationDate="2018-09-23T10:34:34.827" Score="0" Body="&lt;p&gt;Put &lt;code&gt;+&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;, &lt;code&gt;*&lt;/code&gt; into &lt;code&gt;1 _ 2 _ 3 ... n&lt;/code&gt; to make the expression equal &lt;code&gt;0&lt;/code&gt;, for a given &lt;code&gt;3 &amp;lt;= n &amp;lt;= 30&lt;/code&gt;, and output the valid equation (&lt;code&gt;0=1+2-3&lt;/code&gt;). Exactly one operator between each number.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;There exists some patterns, such as &lt;code&gt;((1-2)-(3-4))+((5-6)-(7-8))...&lt;/code&gt; and &lt;code&gt;1+((2-3)-(4-5))+(6-7)&lt;/code&gt;. Maybe we can find patterns that solve the whole problem? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are no solutions without &lt;code&gt;*&lt;/code&gt; for at least &lt;code&gt;n={5,6,9,10,13,14,17,18,21,22}&lt;/code&gt;, so it looks like we need &lt;code&gt;*&lt;/code&gt; for &lt;code&gt;n=4x+1&lt;/code&gt; and &lt;code&gt;n=4x+2&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are no solutions without &lt;code&gt;+&lt;/code&gt; for &lt;code&gt;n &amp;lt; 18&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are no solutions without &lt;code&gt;-&lt;/code&gt; (obviously).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Brute-forced examples:  &lt;/p&gt;&#xA;&#xA;&lt;ol start=&quot;3&quot;&gt;&#xA;&lt;li&gt;0=1+2-3&lt;/li&gt;&#xA;&lt;li&gt;0=1-2-3+4&lt;/li&gt;&#xA;&lt;li&gt;0=1*2-3-4+5&lt;/li&gt;&#xA;&lt;li&gt;0=1+2*3+4-5-6&lt;/li&gt;&#xA;&lt;li&gt;0=1+2-3-4+5+6-7&lt;/li&gt;&#xA;&lt;li&gt;0=1*2*3+4-5-6-7+8&lt;/li&gt;&#xA;&lt;li&gt;0=1-2+3*4*5+6-7*8-9&lt;/li&gt;&#xA;&lt;li&gt;0=1-2*3+4*5-6*7+8+9+10&lt;/li&gt;&#xA;&lt;li&gt;0=1*2+3*4+5*6-7*8-9+10+11&lt;/li&gt;&#xA;&lt;li&gt;0=1-2+3*4-5*6-7-8*9+10*11-12&lt;/li&gt;&#xA;&lt;li&gt;0=1+2*3+4+5-6-7-8+9+10+11-12-13&lt;/li&gt;&#xA;&lt;li&gt;0=1*2+3*4+5*6+7+8*9+10-11*12+13-14&lt;/li&gt;&#xA;&lt;li&gt;0=1-2-3-4-5-6-7+8-9+10-11+12-13+14+15&lt;/li&gt;&#xA;&lt;li&gt;0=1*2*3*4*5*6+7+8-9*10*11-12+13+14+15*16&lt;/li&gt;&#xA;&lt;li&gt;0=1*2*3*4*5*6+7*8*9+10-11*12*13+14*15+16*17&lt;/li&gt;&#xA;&lt;li&gt;0=1*2*3*4*5*6-7*8-9-10-11*12-13-14*15-16*17-18&lt;/li&gt;&#xA;&lt;li&gt;0=1*2*3*4*5*6-7-8-9*10-11-12-13-14-15*16-17*18-19&lt;/li&gt;&#xA;&lt;li&gt;0=1*2*3*4*5*6-7-8-9*10-11-12-13*14-15-16-17-18*19-20&lt;/li&gt;&#xA;&lt;li&gt;0=1*2*3*4*5*6-7-8-9-10-11-12*13-14-15-16-17-18-19-20*21&lt;/li&gt;&#xA;&lt;li&gt;0=1*2*3*4*5*6-7-8-9-10-11*12-13-14-15-16-17-18-19-20*21-22&lt;/li&gt;&#xA;&lt;li&gt;0=1*2*3*4*5*6*7-8*9-10*11-12-13*14-15*16*17-18-19-20-21-22*23&lt;/li&gt;&#xA;&lt;li&gt;0=1*2*3*4*5*6*7-8*9*10-11-12-13-14*15*16-17-18-19*20-21*22-23-24&lt;/li&gt;&#xA;&lt;li&gt;0=1*2*3*4*5*6*7-8*9*10-11-12*13*14-15*16-17-18*19-20*21-22*23-24*25&lt;/li&gt;&#xA;&lt;li&gt;0=1*2*3*4*5*6*7*8-9*10*11-12*13*14-15*16*17-18*19*20-21*22*23-24*25*26&lt;/li&gt;&#xA;&lt;li&gt;0=1*2*3*4*5*6*7*8-9*10*11-12-13*14*15-16-17-18*19*20-21-22*23*24-25*26*27&lt;/li&gt;&#xA;&lt;li&gt;0=1*2*3*4*5*6*7*8*9-10-11*12*13*14*15-16-17-18-19-20-21*22-23*24-25*26-27*28&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="18121" LastActivityDate="2018-09-23T10:34:34.827" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16925" PostTypeId="2" ParentId="2140" CreationDate="2018-09-25T04:23:22.273" Score="-3" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm glad the sandbox exists because I have a few issues coming up with the right wording for this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Background&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Theoretically, any numeric pattern should exist &lt;em&gt;somewhere&lt;/em&gt; in the decimal places of pi.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given any numeric input, find the index (location?) of the first occurrence of that input in the decimal place of pi&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example cases:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1 = 1&lt;/li&gt;&#xA;&lt;li&gt;14 = 1&lt;/li&gt;&#xA;&lt;li&gt;41 = 2&lt;/li&gt;&#xA;&lt;li&gt;897 = 11&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;any numeric input, can't see why it should be limited by any number of characters. &#xA;I am not sure about limitations, but this could get computationally intense if it's a large sequence of numbers that occur very deep into pi. Do I need to add any restrictions to cater for computational complexity?&lt;/p&gt;&#xA;" OwnerUserId="62950" LastActivityDate="2018-09-25T04:23:22.273" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16928" PostTypeId="2" ParentId="2140" CreationDate="2018-09-26T08:20:10.920" Score="-1" Body="&lt;p&gt;&lt;strong&gt;Trilateration&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Intro:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/75791/trilaterate-your-position&quot;&gt;Trilaterate your position&lt;/a&gt; with a small twist.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a n x m array,&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Original Problem:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will be given a list of (x,y,d) as input,&#xA;where d is the distance of your position from the point (x,y).&#xA;Using this we can find our position.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;................&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the above problem, d is the exact distance from the respective point.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this problem, due to some error, we know that the distance is actually the maximum distance from the respective point. Because of that, instead of a single point, we will get a small area of our position. Objective is to get that area.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It should be in the format(a function):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f(list,n,m):&#xA;  #your code here&#xA;  return #list of all indices where you may be.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;What's returning should be a list of points (x,y) with 0&amp;lt;=x&amp;lt;=n,0&amp;lt;=y&amp;lt;=m.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In case there is no solution return an empty list.&#xA;The winner will be the fastest code.&#xA;In case of a tie shorter code wins.&#xA;The time taken will most likely depend on n,m and list of points.&lt;/p&gt;&#xA;" OwnerUserId="82927" LastEditorUserId="82927" LastEditDate="2018-09-27T05:32:01.337" LastActivityDate="2018-09-27T05:32:01.337" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16931" PostTypeId="2" ParentId="16907" CreationDate="2018-09-27T04:06:19.883" Score="0" Body="&lt;h1&gt;C - 19 bytes&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;#include&amp;lt;stdio.h&amp;gt;&#xA;C&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Make it as a function of the language. Interpreter parameters are way too easy to abuse.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Compile and run with:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;gcc -DC=&amp;quot;int main(){printf(\&amp;quot;Make it as a function of the language. Interpreter parameters are way too easy to abuse.\&amp;quot;);return 0;}&amp;quot; cheat.c &amp;amp;&amp;amp; ./a.out&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="64513" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-09-27T04:06:19.883" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16934" PostTypeId="2" ParentId="2140" CreationDate="2018-09-27T21:17:15.110" Score="0" Body="&lt;p&gt;There is a nice task &lt;a href=&quot;https://codegolf.stackexchange.com/questions/13088&quot;&gt;One Ring to rule them all. One String to contain them all&lt;/a&gt;. But rule define a string as a linear buffer. A linear buffer is not a &lt;em&gt;Ring&lt;/em&gt; :)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My suggestion is:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;create a new task with title &quot;One Ring to rule them all. One Ring to bring them all&quot;&lt;/li&gt;&#xA;&lt;li&gt;add link to old task in the body of the new task&lt;/li&gt;&#xA;&lt;li&gt;modify an Objective: Output a String which contains every positive integer strictly below 1000 and the String is a &lt;a href=&quot;https://en.wikipedia.org/wiki/Circular_buffer&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ring&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="80745" LastActivityDate="2018-09-27T21:17:15.110" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16937" PostTypeId="2" ParentId="2140" CreationDate="2018-09-28T15:21:44.167" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/173370/75524&quot;&gt;Making a Mountain out of a Molehill&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="75524" LastEditorUserId="75524" LastEditDate="2018-10-04T19:24:02.527" LastActivityDate="2018-10-04T19:24:02.527" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16938" PostTypeId="2" ParentId="2140" CreationDate="2018-09-28T15:49:16.503" Score="2" Body="&lt;h1&gt;Iterated Prisoner's Trilemma&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot;&gt;python&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please send me problems or else I'm gonna post this on main.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Prisoner's dilemma ... with three choices. Crazy, huh?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's our payoff matrix. Player A on the left, B on the top&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A,B| C | N | D&#xA;---|---|---|---&#xA; C |3,3|4,1|0,5&#xA; N |1,4|2,2|3,2&#xA; D |5,0|2,3|1,1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The payoff matrix is engineered so that it's best for both players to always cooperate, but you can gain (usually) by choosing Neutral or Defection. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's some (competing) example bots.&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;# turns out if you don't actually have to implement __init__(). TIL.&#xA;&#xA;class AllC:&#xA;    def round(self, _): return &quot;C&quot;&#xA;class AllN:&#xA;    def round(self, _): return &quot;N&quot;&#xA;class AllD:&#xA;    def round(self, _): return &quot;D&quot;&#xA;class RandomBot:&#xA;    def round(self, _): return random.choice([&quot;C&quot;, &quot;N&quot;, &quot;D&quot;])&#xA;&#xA;class Grudger:&#xA;    def __init__(self):&#xA;        self.history = []&#xA;    def round(self, last):&#xA;        if(last):&#xA;            self.history.append(last)&#xA;            if(self.history.count(&quot;D&quot;) &amp;gt; 0):&#xA;                return &quot;D&quot;&#xA;        return &quot;C&quot;&#xA;&#xA;class TitForTat:&#xA;    def round(self, last):&#xA;        if(last == &quot;D&quot;):&#xA;            return &quot;D&quot;&#xA;        return &quot;C&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your bot is a Python3 class. A new instance is created for every game, and &lt;code&gt;round()&lt;/code&gt; is called each round, with your opponent's choice from last round (or None, if it's the first round)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we get enough entries for the result to be statistically significant, there's a 50 rep bounty for anyone who can beat Tit For Tat.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specifics&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Round count: [REDACTED]&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes disallowed.&lt;/li&gt;&#xA;&lt;li&gt;No messing with anything outside your class.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="49186" LastEditorUserId="49186" LastEditDate="2018-10-13T17:11:13.857" LastActivityDate="2018-10-13T17:11:13.857" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="16939" PostTypeId="2" ParentId="2140" CreationDate="2018-09-28T16:51:18.523" Score="1" Body="&lt;h1&gt;Prettify Pixiedust&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;So &lt;a href=&quot;https://meta.stackoverflow.com/a/374624/6388243&quot;&gt;Pixiedust&lt;/a&gt; is a new esolang I've created. One of the primary points is that it should &lt;em&gt;look like pixie dust&lt;/em&gt;—exactly the things that your programs should fix.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The input will be a program written in Pixiedust. Since this is &lt;strong&gt;not&lt;/strong&gt; a challenge to parse the language, it won't be in raw code, but a list of numbers and the strings separating them. The numbers can be taken as the number itself, or their representation in the program.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Randomizing the Literals&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For each numeric literal, there are many ways to represent them:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Randomly pad the beginning with &lt;code&gt;.&lt;/code&gt; characters. It should be an even distribution between padding it to 32 bits and padding it to the base length.&lt;/li&gt;&#xA;&lt;li&gt;If the number is at the end of the line, then take an even split between including and excluding the terminating &lt;code&gt;*&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Scattering&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;At this point, you should have the lines calculated—let's call this the &lt;em&gt;half-pretty program&lt;/em&gt;. For each line of output:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Start with a line of pure spaces 4 times the length of the longest half-pretty line.&lt;/li&gt;&#xA;&lt;li&gt;Randomly select spaces from it to replace with program characters. Every combination of spaces should have an equal chance.&lt;/li&gt;&#xA;&lt;li&gt;Replace those spaces with the corresponding characters, without changing the order that they appear in.&lt;/li&gt;&#xA;&lt;li&gt;(Optional) trim off trailing spaces.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The winner will be the shortest answer in bytes. Additionally, there will be a 50-rep bounty for the first answer written in Pixiedust.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Examples will be coming once I finish the interpreter and make some submissions to other challenges in Pixiedust.&lt;/p&gt;&#xA;" OwnerUserId="62402" LastActivityDate="2018-09-28T16:51:18.523" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16940" PostTypeId="2" ParentId="6918" CreationDate="2018-09-28T20:55:54.653" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/The-Snide-Sniper/pixiedust&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pixiedust&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;By &lt;a href=&quot;https://codegolf.stackexchange.com/users/62402/stephen-leppik&quot;&gt;Stephen Leppik&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you ask a 5-year-old what tells a computer what to do, they'll probably answer along the lines of &quot;fairies and pixie dust&quot;. With the existence of this assembly-like language, that's not entirely wrong.&lt;/p&gt;&#xA;" OwnerUserId="62402" LastActivityDate="2018-09-28T20:55:54.653" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16941" PostTypeId="2" ParentId="2140" CreationDate="2018-09-28T22:07:13.860" Score="1" Body="&lt;h1&gt;Iteration Hierarchy&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is based on the &lt;a href=&quot;http://googology.wikia.com/wiki/M(n)_map&quot; rel=&quot;nofollow noreferrer&quot;&gt;m(n) map&lt;/a&gt;. m&lt;sub&gt;k&lt;/sub&gt; takes in k functions and one natural input n, and iterates the first function n times onto the next argument, and then fills in the rest of the arguments.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$m_1=f_0\mapsto n\mapsto f_0^n(n)\$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$m_2=f_1\mapsto f_0\mapsto n\mapsto f_1^n(f_0)(n)\$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$m_3=f_2\mapsto f_1\mapsto f_0\mapsto n\mapsto f_2^n(f_1)(f_0)(n)\$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;etc. where &lt;span class=&quot;math-container&quot;&gt;\$f^n(x)=f(f(f(\dots f(x)\dots)))\$&lt;/span&gt; with &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; calls to &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; (a.k.a. &lt;a href=&quot;https://en.wikipedia.org/wiki/Iterated_function#Definition&quot; rel=&quot;nofollow noreferrer&quot;&gt;function iteration&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note particularly that &lt;span class=&quot;math-container&quot;&gt;\$m_2(f_1)(f_0)(2)=f_1(f_1(f_0))(2)\ne f_1(f_1(f_0(2)))\$&lt;/span&gt; &lt;em&gt;i.e. it iterates the first argument over the second argument&lt;/em&gt; and then applies the remaining arguments afterwards.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Examples:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$s(n)=n+1\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;m&lt;sub&gt;1&lt;/sub&gt;(s)(5)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;m₁(s)(5)&#xA;= s(s(s(s(s(5)))))                                x5 iterations of s&#xA;= 10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;m&lt;sub&gt;1&lt;/sub&gt;(m&lt;sub&gt;1&lt;/sub&gt;(s))(4)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;m₁(m₁(s))(4)&#xA;= m₁(s)(m₁(s)(m₁(s)(m₁(s)(4))))                   x4 iterations of m₁(s)&#xA;= m₁(s)(m₁(s)(m₁(s)(s(s(s(s(4)))))))              x4 iterations of s&#xA;= m₁(s)(m₁(s)(m₁(s)(8)))&#xA;= m₁(s)(m₁(s)(s(s(s(s(s(s(s(s(8))))))))))         x8 iterations of s&#xA;= m₁(s)(m₁(s)(16))&#xA;= ...&#xA;= m₁(s)(32)&#xA;= ...&#xA;= 64&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;m&lt;sub&gt;2&lt;/sub&gt;(m&lt;sub&gt;1&lt;/sub&gt;)(s)(3)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;m₂(m₁)(s)(3)&#xA;= m₁(m₁(m₁(s)))(3)                                x3 iterations of m₁&#xA;= m₁(m₁(s))(m₁(m₁(s))(m₁(m₁(s))(3)))              x3 iterations of m₁(m₁(s))&#xA;= m₁(m₁(s))(m₁(m₁(s))(m₁(s)(m₁(s)(m₁(s)(3)))))    x3 iterations of m₁(s)&#xA;= m₁(m₁(s))(m₁(m₁(s))(m₁(s)(m₁(s)(s(s(s(3)))))))  x3 iterations of s&#xA;= m₁(m₁(s))(m₁(m₁(s))(m₁(s)(m₁(s)(6))))&#xA;= ...&#xA;= m₁(m₁(s))(m₁(m₁(s))(24))&#xA;= m₁(m₁(s))(m₁(s)(m₁(s)(m₁(s)(m₁(s)(m₁(s)(m₁(s)(m₁(s)(m₁(s)(m₁(s)(m₁(s)(m₁(s)(m₁(s)(m₁(s)(m₁(s)(m₁(s)(m₁(s)(m₁(s)(m₁(s)(m₁(s)(m₁(s)(m₁(s)(m₁(s)(24)))))))))))))))))))))))))&#xA;= ...&#xA;= m₁(m₁(s))(402653184)&#xA;= ...&#xA;= ???&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;m&lt;sub&gt;3&lt;/sub&gt;(m&lt;sub&gt;2&lt;/sub&gt;)(m&lt;sub&gt;1&lt;/sub&gt;)(s)(2)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;m₃(m₂)(m₁)(s)(2)&#xA;= m₂(m₂(m₁))(s)(2)                                x2 iterations of m₂&#xA;= m₂(m₁)(m₂(m₁)(s))(2)                            x2 iterations of m₂(m₁)&#xA;= m₁(m₁(m₂(m₁)(s)))(2)                            x2 iterations of m₁&#xA;= m₁(m₂(m₁)(s))(m₁(m₂(m₁)(s))(2))                 x2 iterations of m₁(m₂(m₁)(s))&#xA;= m₁(m₂(m₁)(s))(m₂(m₁)(s)(m₂(m₁)(s)(2)))          x2 iterations of m₂(m₁)(s)&#xA;= m₁(m₂(m₁)(s))(m₂(m₁)(s)(m₁(m₁(s))(2)))          x2 iterations of m₁&#xA;= m₁(m₂(m₁)(s))(m₂(m₁)(s)(m₁(s)(m₁(s)(2))))       x2 iterations of m₁(s)&#xA;= m₁(m₂(m₁)(s))(m₂(m₁)(s)(m₁(s)(s(s(2)))))        x2 iterations of s&#xA;= m₁(m₂(m₁)(s))(m₂(m₁)(s)(m₁(s)(4)))&#xA;= m₁(m₂(m₁)(s))(m₂(m₁)(s)(8))&#xA;= m₁(m₂(m₁)(s))(m₁(m₁(m₁(m₁(m₁(m₁(m₁(m₁(s))))))))(8))&#xA;= ...&#xA;= ???&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Aside:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This hierarchy is closely related to the &lt;a href=&quot;https://en.wikipedia.org/wiki/Fast-growing_hierarchy#Functions_in_fast-growing_hierarchies&quot; rel=&quot;nofollow noreferrer&quot;&gt;fast-growing hiearchy&lt;/a&gt; when using a base function of s.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In fact, the last example is already much larger than Graham's number, and &lt;span class=&quot;math-container&quot;&gt;\$m_n(m_{n-1})\dots(m_1)(s)(n)\approx f_{\varepsilon_0}(n)\$&lt;/span&gt; in the fast-growing hierarchy.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Code Golf Challenge:&lt;/h3&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Write the shortest possible function subprogram for &lt;span class=&quot;math-container&quot;&gt;\$m_k\$&lt;/span&gt;. Code size is measured in bytes.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Here's an example program (Ruby, I can golf this down to about 140 bytes):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;iterate=-&amp;gt;f,n{-&amp;gt;g{&#xA;    i=g&#xA;    n.times{i=f[i]}&#xA;    i}}&#xA;&#xA;m=-&amp;gt;k{&#xA;    x=&quot;-&amp;gt;n{y=iterate[f#{k-1},n]; (0...#{k-1}).map{|l| y=eval(\&quot;y[f\#{l}]\&quot;)}; y[n]}&quot;&#xA;    (0...k).map{|l| x=&quot;-&amp;gt;f#{l}{&quot;+x+&quot;}&quot;}&#xA;    eval(x)}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;NB&lt;/strong&gt;: As noted above, the growth rate of &lt;span class=&quot;math-container&quot;&gt;\$m_n(m_{n-1})\dots(m_1)(s)(n)\$&lt;/span&gt; is comparable to &lt;span class=&quot;math-container&quot;&gt;\$f_{\varepsilon_0}(n)\$&lt;/span&gt;. &lt;em&gt;If this can be golfed far enough below 100 bytes, it could well place in the top 5 of the &lt;a href=&quot;https://codegolf.stackexchange.com/q/18028&quot;&gt;Largest Number Printable&lt;/a&gt; question.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="58880" LastEditorUserId="58880" LastEditDate="2018-10-04T00:48:17.267" LastActivityDate="2018-10-04T00:48:17.267" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16943" PostTypeId="2" ParentId="2140" CreationDate="2018-10-01T07:33:31.023" Score="0" Body="&lt;p&gt;&lt;strong&gt;Make words&lt;/strong&gt; (need a better title)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that takes a string and an integer &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; as input and outputs all the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-letter words formed using only the letters in the string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Notes:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input string will have only small alphabets &lt;span class=&quot;math-container&quot;&gt;\$a-z\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All the letters in the input string will be unique.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input integer will be positive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Winner&lt;/em&gt;:&#xA;This is code-golf so shortest code wins.&#xA;(Fastest algorithm will also be good in this right?)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Examples:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input:&quot;abcd&quot;,5&#xA;output: &quot;aaaaa&quot;,&quot;aaaab&quot;,&quot;aaaac&quot;,.....,&quot;ddddc&quot;,&quot;ddddd&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;P.S. The output does not have to be sorted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any input and output format will do as long as its distinguishable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input: abcd,5 (ok)&#xA;       abcd 5 (ok)&#xA;       abcd5 (not allowed)&#xA;output: [&quot;aaaaa&quot;,&quot;aaaab&quot;,.... (ok)&#xA;        &quot;aaaaa&quot;,&quot;aaaab&quot;,.... (ok)&#xA;        &quot;aaaaa&quot;&quot;aaaab&quot;&quot;aaaac&quot;..... (ok)&#xA;        aaaaa aaaab aaaac ..... (ok)&#xA;        aaaaaaaaabaaaac...... (not allowed)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="82927" LastEditorUserId="82927" LastEditDate="2018-10-01T09:44:57.057" LastActivityDate="2018-10-01T09:44:57.057" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16944" PostTypeId="1" CreationDate="2018-10-01T13:08:56.420" Score="-2" ViewCount="120" Body="&lt;p&gt;If so, when all votes are down we can know what they are against&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2018-10-01T23:03:06.457" Title="Does a downvote to a view on meta mean disagreement?" Tags="|discussion|meta|voting|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16945" PostTypeId="1" CreationDate="2018-10-01T16:29:17.110" Score="1" ViewCount="62" Body="&lt;p&gt;How would physically constructed logic be scored? Say, for example, a mixture of resistors, diodes, wires, and 74xx/4000 type ICs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Handmade logic fits the &quot;programming language&quot; criteria, as using only the above listed components, a Brainfuck interpreter could be constructed. However, there is no way to score it, which makes it impossible to use on PPCG until a scoring mechanism is decided.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Proposals will be taken in the &quot;Answers&quot; section of this post.&lt;/p&gt;&#xA;" OwnerUserId="77964" LastEditorUserId="77964" LastEditDate="2018-10-01T16:56:56.907" LastActivityDate="2018-10-01T16:56:56.907" Title="Judging the score of physically constructed electronic logic" Tags="|discussion|scoring|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16946" PostTypeId="2" ParentId="16945" CreationDate="2018-10-01T16:44:31.253" Score="2" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7833/48198&quot;&gt;Languages are defined by their implementations&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Handmade logic&lt;/em&gt; doesn't have an implementation per se, you need to specify one (eg. Verilog or another HDL) and count the bytes of the &lt;code&gt;.v&lt;/code&gt; file (in case of Verilog).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you can't find an implementation that supports the components you want to use or you're unhappy with the found one(s) (eg. because they're ungolfy) nobody will hinder you from implementing your own Golf-HDL.&lt;/p&gt;&#xA;" OwnerUserId="48198" LastActivityDate="2018-10-01T16:44:31.253" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16947" PostTypeId="2" ParentId="16944" CreationDate="2018-10-01T22:57:16.840" Score="1" Body="&lt;h1&gt;On &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/feature-request&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt; answers, yes&lt;/h1&gt;&#xA;&lt;p&gt;Quoting the &lt;a href=&quot;https://codegolf.stackexchange.com/help/whats-meta&quot;&gt;Help Center&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Voting is different on meta. Like normal Stack Exchange sites, Meta&#xA;allows members to vote on questions and answers. For most posts, votes&#xA;reflect the perceived usefulness: well-written, well-reasoned,&#xA;well-researched posts tend to get more attention and more upvotes.&#xA;Highly-voted and frequently-linked posts may become part of the&#xA;community-curated FAQ or codified as part of the site’s Help pages.&lt;/p&gt;&#xA;&lt;p&gt;Unlike normal Stack Exchange sites, Meta invites the community to&#xA;discuss, debate and propose changes to the way the community itself&#xA;behaves, as well as how the software itself works. On posts tagged&#xA;feature-request, voting indicates agreement or disagreement with the&#xA;proposed change rather than just the quality or usefulness of the post&#xA;itself.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Also, this type of disagreement-downvoting leaks out to the rest of meta as well.  Questions or non-&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/feature-request&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt; commonly gets voted down due to disagreement, though these votes aren't binding.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-10-01T23:03:06.457" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16948" PostTypeId="2" ParentId="2140" CreationDate="2018-10-02T00:54:46.290" Score="0" Body="&lt;h1&gt;Golf A Programming Language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Code golf languages are languages built to complete programming challenges in few lines of code. Instead of creating a code golf language, you will be creating an interpreter for a programming language in as few bytes as possible.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As you are not creating a code golf language, instead your score will be based on the number of bytes in the interpreter.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;I/O&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You may provide a program as input to your interpreter as input using any &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;standard input&lt;/a&gt; method&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output provided by a program in your language may be passed on through your interpereter using any &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;standard output&lt;/a&gt; method&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Tasks&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You must write a program to solve each task in the language you created:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world&quot;&gt;Hello World&lt;/a&gt; - Output the string &quot;Hello World&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/58615/1-2-fizz-4-buzz&quot;&gt;Fizz Buzz&lt;/a&gt; - List numbers from 1 to 100 replacing multiples of 3 with &lt;code&gt;Fizz&lt;/code&gt;, 5 with &lt;code&gt;Buzz&lt;/code&gt;, and 15 with &lt;code&gt;FizzBuzz&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/57617/is-this-number-a-prime&quot;&gt;Prime Check&lt;/a&gt; - Check if a given number is prime&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Loopholes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your programming language must be implemented yourself. Using builtin functions such as Javascript's &lt;code&gt;eval&lt;/code&gt; or CHIQRSX9+'s &lt;code&gt;I&lt;/code&gt; on input makes this not very interesting.&lt;/p&gt;&#xA;" OwnerUserId="77796" LastActivityDate="2018-10-02T00:54:46.290" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16949" PostTypeId="1" AcceptedAnswerId="16950" CreationDate="2018-10-02T09:12:38.657" Score="-1" ViewCount="60" Body="&lt;p&gt;For example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/120870&quot;&gt;String subtraction&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are answers with a regexp. And there are answers without regexp.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But answers with regexp works incorrect when strings contains the regexp control symbols. Yes, author of this question make the rule that the strings contains alphanumeric + spaces only. What about common case? Do I need to add code that escapes the control of the regexp symbols? Are there a common PGCC rule about it?&lt;/p&gt;&#xA;" OwnerUserId="80745" LastActivityDate="2018-10-02T09:59:37.610" Title="Do I need to add code that escapes the control of the regexp symbols?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16950" PostTypeId="2" ParentId="16949" CreationDate="2018-10-02T09:59:37.610" Score="3" Body="&lt;h1&gt;Yes, you need to add code&lt;/h1&gt;&#xA;&lt;p&gt;If you're going to inject a string in a regular expression, and there's a possibility that the regular expression is corrupted by doing so, your code needs to handle that correctly by itself. I can't think of any reason why it should be exempted from doing so.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Example:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This does happen quite frequently in JavaScript. To find a substring in a string, you may either use:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;string.indexOf(substring)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;string.search(substring)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The &lt;code&gt;search&lt;/code&gt; method is shorter. But when a string is passed to it, it's implicitly coerced to a regular expression. Therefore, you &lt;strong&gt;can't&lt;/strong&gt; use &lt;code&gt;.search()&lt;/code&gt; if the substring may result in an invalid regular expression, and you &lt;strong&gt;must&lt;/strong&gt; use &lt;code&gt;.indexOf()&lt;/code&gt; instead.&lt;/p&gt;&#xA;" OwnerUserId="58563" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-10-02T09:59:37.610" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16952" PostTypeId="1" CreationDate="2018-10-02T17:42:14.863" Score="8" ViewCount="236" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14737/71434&quot;&gt;Languge of the Month&lt;/a&gt; series(?) started in March of this year, for the purpose of &quot;to get more exposure for less-frequently used languages&quot;. Until August it seemed to be doing fine enough, though I don't have any particular way to quantify that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, in September I can clearly quantify that it did not do fine. As mentioned in a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14737/nominations-for-language-of-the-month#comment59438_14737&quot;&gt;comment&lt;/a&gt; by user JayCe:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;It’s time to announce Cubically as LotM isn’t it?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Cublically was the &quot;winner&quot; for Language of the Month for September, but no Meta post was made to consolidate information or posts about or using the language, the &lt;a href=&quot;https://chat.stackexchange.com/rooms/62883/cubically&quot;&gt;chatroom&lt;/a&gt; remained frozen, and it seems that &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=created%3A2018-09-01..2018-09-31+%22%23+cubically%22+is%3Aa&quot;&gt;no answers&lt;/a&gt; using the language were posted in September (though that search doesn't have 100% reliability by my understanding).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Based on the past threads, it's not yet time to be worried about this month's language, which should be R I guess; some of the previous Meta posts were made on the 3rd of their respective months rather than strictly the 1st. However... much like last month, if such a post &lt;em&gt;doesn't&lt;/em&gt; get made I'm not sure what can and/or should be done about it. Have the Languages of the Months run their course, and not enough people are really interested? Was there significant discussion on this somewhere (chat perhaps?) that just never resulted in a new Meta post or a change to the Nominations post? Is this just a case of &quot;everybody thought it was someone else's responsibility&quot;, and if so can or should that be improved? &lt;/p&gt;&#xA;" OwnerUserId="71434" LastActivityDate="2018-10-02T17:42:14.863" Title="Is Language of the Month dead?" Tags="|discussion|language-of-the-month|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16953" PostTypeId="2" ParentId="2140" CreationDate="2018-10-02T19:40:32.317" Score="0" Body="&lt;h1&gt;Eeny Meeny Miny Moe&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Inspired (somewhat) by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69722/eeny-meeny-miny-moe/69808&quot;&gt;this question&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Where should I stand to be captain of my team?&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The childhood song &lt;em&gt;Eeny, meeny, miny, moe&lt;/em&gt; was often used to select who was a captain when playing some game.  Everyone on one team would stand in a line and someone would point at the first person in the line.  Although there are several variations, where I grew up, they would sing:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Eeny, meeny, miny, moe,&lt;br&gt;&#xA;  Catch a tiger by the toe.&lt;br&gt;&#xA;  If he hollers, let him go,&lt;br&gt;&#xA;  Eeny, meeny, miny, moe.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;adding to the traditional:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;My mother told me to pick the very best one and you are not it.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;As we sung each word, we pointed at the next person in line, then (if the rhyme wasn't over yet) we would continue the rhyme and start over at the beginning of the line.  The person being pointed to when the final &quot;it&quot; was sung would be removed from the line, eliminating them from being captain.  Then the rhyme would start over at the beginning of the line to remove the next person.  This continued until only one person was left, and that person would be captain.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It didn't take long for me to recognize that if there were two people left (or if we started with just two people), it seemed like the second person would always win.  Studying this for a bit I realized that since there are 35 beats this would always happen.  I further figured out if there are 3 people, the third would win.  So I wondered: could I chart it out for any number?  Can I create a formula for it?&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program, function or (etc. as standard) where given input of an integer number of starting children greater than one, output what starting child number will be the winner, and where I need to stand so that I can be captain!&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples:&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input        Output&#xA;  2             2&#xA;  3             3&#xA;4,5,6or7        4&#xA; 8 or 9         5&#xA;  10            6&#xA;11,12or13       7&#xA;  14            8&#xA;  15            9&#xA;  16           10&#xA;17,18,19or20   11 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Winner for each language is that with the least number of bytes.  And of course, standard loopholes and all that legal jazz are not allowed as is typically expected in these challenges.&lt;/p&gt;&#xA;" OwnerUserId="49088" LastActivityDate="2018-10-02T19:40:32.317" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16954" PostTypeId="2" ParentId="2140" CreationDate="2018-10-02T22:11:08.860" Score="4" Body="&lt;h1&gt;The max() is not enough&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/173458/23513&quot;&gt;The max() is not enough&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="23513" LastEditorUserId="23513" LastEditDate="2018-10-05T20:51:58.690" LastActivityDate="2018-10-05T20:51:58.690" CommentCount="25" ContentLicense="CC BY-SA 4.0" />
  <row Id="16957" PostTypeId="2" ParentId="2140" CreationDate="2018-10-04T02:47:35.463" Score="1" Body="&lt;p&gt;Challenge&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Max Sum String&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an input string, return the max word based on the sum of each word's unicode characters. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input should be seperated by whitespace&lt;/li&gt;&#xA;&lt;li&gt;The value of each word is based on the sum of each character in the word's UTF-16 code&lt;/li&gt;&#xA;&lt;li&gt;The output should be the word&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: &quot;a b c d e&quot;&#xA;Output: &quot;e&quot;&#xA;&#xA;Input: &quot;this is a test&quot;&#xA;Output: &quot;test&quot;&#xA;&#xA;Input: &quot;test Test&quot;&#xA;Output: &quot;test&quot;&#xA;&#xA;Input: &quot;hello world&quot;&#xA;Output: &quot;world&quot;&#xA;&#xA;Input: &quot;    ️  &quot;&#xA;Output: &quot;️&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I doubt it's optimal at all, but here's the code I came up with to accomplish this challenge:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;let str = &quot;hello world&quot;;&#xA;Object.keys(str.split(' ').map(w =&amp;gt; {return {[w]: [...w].map(c =&amp;gt; c.charCodeAt(0)).reduce((a, b) =&amp;gt; a + b, 0)}}).reduce((a, b) =&amp;gt; { return Object.values(a)[0] &amp;gt; Object.values(b)[0] ? a : b}))[0];&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="79918" LastActivityDate="2018-10-04T02:47:35.463" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16958" PostTypeId="1" CreationDate="2018-10-04T10:46:52.313" Score="8" ViewCount="180" Body="&lt;p&gt;According to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4942&quot;&gt;this consensus&lt;/a&gt; in the default allowed inputs thread, functions may output by writing to an out argument. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;When outputting an array in languages like C/C++, where arrays are pointers to locations in memory, can we assume the memory at the output location to have been allocated and to be of a sufficient size to output the complete answer, or must the memory be allocated in the code?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Below are some example functions in C that output by modifying their parameters; please consider each case, and state which cases you'd consider acceptable.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;// Fixed size&#xA;void one_to_ten(int*o){&#xA;    for(int i=1; i&amp;lt;=10; i++)&#xA;        o[i-1]=i;&#xA;}&#xA;&#xA;// Output size is a function of input size&#xA;void mul_table(int*o,int*a,int m,int*b,int n){&#xA;    for(int i=0; i&amp;lt;m; i++)&#xA;        for(int j=0; j&amp;lt;n; j++)&#xA;            o[i*n+j]=a[i]*b[j];&#xA; }&#xA;&#xA;// Size of output is given&#xA;void roll_dice(int*res, int n){&#xA;    for(int i=0; i&amp;lt;n; i++)&#xA;        res[n]=rand()%6+1;&#xA;}&#xA;&#xA;// Output has a variable size and a defined maximum size&#xA;void scramble(int*o, int seed){&#xA;    srand(seed);&#xA;    int r;&#xA;    for(int i=0; (r=rand())&amp;amp;&amp;amp;i&amp;lt;128; i++)&#xA;        o[i]=r;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerDisplayName="user77406" LastEditorDisplayName="user77406" LastEditDate="2018-12-20T20:55:22.157" LastActivityDate="2018-12-20T20:55:22.157" Title="Can we expect out arguments to be allocated?" Tags="|discussion|output|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16959" PostTypeId="1" CreationDate="2018-10-04T15:41:07.703" Score="1" ViewCount="132" Body="&lt;p&gt;This question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/173145/permutations-to-the-nines&quot;&gt;Permutations to the nines&lt;/a&gt; is &quot;on hold&quot; listing the reason as &quot;unclear what you're asking&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Asked the first two users listed as voting to close what part of the question is not clear to them, to which no reply has been posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Am considering re-asking the question, though before doing so am seeking clarification here as to what part of the question could use improvement.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How to make question clear to users who voted to close without providing feedback as to what is not clear to them?&lt;/p&gt;&#xA;" OwnerUserId="31257" LastActivityDate="2018-10-31T00:10:59.697" Title="How to make question clear to users who voted to close without providing feedback as to what is not clear to them?" Tags="|discussion|vote-to-close|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16960" PostTypeId="2" ParentId="16959" CreationDate="2018-10-04T15:54:14.840" Score="6" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Asked the first two users listed as voting to close what part of the question is not clear to them, to which no reply has been posted.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Putting &lt;code&gt;@username&lt;/code&gt; in a comment doesn't always notify the user. I'm not sure of the exact list of behaviours which make a user available to be pinged like that, but empirically it doesn't include casting a close vote, because I was not notified of your comment.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Am considering re-asking the question, though before doing so am seeking clarification here as to what part of the question could use improvement.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;We have a process for asking how a question could be improved. Full details in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2056/194&quot;&gt;How does the Sandbox work? How do I use it?&lt;/a&gt; . Rather than re-ask the question I suggest that you copy its content to an answer in the sandbox, self-delete the question, and then after the sandboxing process is over edit the original question and undelete. If it doesn't get reopened in a reasonable period (12 hours, say) then post in chat and you'll probably get enough reopen votes.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Finally, although this meta question isn't tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/specific-question&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;specific-question&amp;#39;&quot; rel=&quot;tag&quot;&gt;specific-question&lt;/a&gt;, let me say that I didn't comment on what specifically was unclear about the question because I can't succinctly point to one thing which is unclear. The whole question seems to me to be a complicated mess, and I can't untangle which parts are directly relevant vs context for why the core question is interesting. IMO it needs a TL;DR which is no more than a quarter of the length of the current question and which stands alone and contains a full specification.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-10-04T15:54:14.840" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16961" PostTypeId="2" ParentId="2140" CreationDate="2018-10-04T16:03:55.563" Score="0" Body="&lt;h2&gt;Permutations to the nines&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This question is based on an unresolved inquiry which began at &lt;a href=&quot;https://stackoverflow.com/questions/34013675/permutations-without-recursive-function-call?noredirect=1&amp;amp;lq=1&quot;&gt;Permutations without recursive function call&lt;/a&gt; and was followed up at &lt;a href=&quot;https://stackoverflow.com/questions/43290467/how-to-improve-efficiency-of-algorithm-which-generates-next-lexicographic-permut&quot;&gt;How to improve efficiency of algorithm which generates next lexicographic permutation?&lt;/a&gt; (TL;DR), after finding help removing duplicate numbers at &lt;a href=&quot;https://stackoverflow.com/questions/34487374/most-efficient-method-to-check-for-range-of-numbers-within-number-without-duplic&quot;&gt;Most efficient method to check for range of numbers within number without duplicates&lt;/a&gt;, where after performing arithmetic by hand found that for an array having length less than or equal to &lt;code&gt;9&lt;/code&gt;, if we ignore the value held at each index of the initial array and instead convert the indexes to a whole number, the next lexicographic permutation can be determined by adding &lt;code&gt;9&lt;/code&gt; to the current index as number until a whole number, e.g., &lt;code&gt;[1,2,3] // 123 1-based index or 23 0-based index&lt;/code&gt; is reached that satisfies two the conditions&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Contains only the numbers of the indexes of the original array&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Does not contain any duplicate numbers&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;e.g., &lt;code&gt;123+9=132 // &quot;abc&quot; -&amp;gt; &quot;acb&quot; 132-9=123 // &quot;acb&quot; -&amp;gt; &quot;abc&quot;&lt;/code&gt;; the graph for &lt;code&gt;&quot;abcd&quot;&lt;/code&gt; is&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;code&gt;[9,81,18,81,9,702,9,171,27,72,18,693,18,72,27,171,9,702,9,81,18,81,9]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;which does not appear to be linear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As the linked answers disclose, adding &lt;code&gt;9&lt;/code&gt; to a whole number is not the most efficient method of determining the next lexicographic permutation, and what found independently by hand has been found by others, consider &lt;a href=&quot;https://oeis.org/A217626&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS A217626&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A217626       First differences of &lt;a href=&quot;https://oeis.org/A215940&quot; rel=&quot;nofollow noreferrer&quot;&gt;A215940&lt;/a&gt;, or first differences of&#xA;  permutations of (0,1,2,...,m-1) reading them as decimal numbers,&#xA;  divided by 9 (with 10&gt;=m, and m! &gt; n).&lt;/p&gt;&#xA;  &#xA;  &lt;blockquote&gt;&#xA;    &lt;p&gt;1, 9, 2, 9, 1, 78, 1, 19, 3, 8, 2, 77, 2, 8, 3, 19, 1, 78, 1, 9, 2, 9,&#xA;    1, 657, 1, 9, 2, 9, 1, 178, 1, 29, 4, 7, 3, 66, 2, 18, 4, 18, 2, 67,&#xA;    1, 19, 3, 8, 2, 646, 1, 19, 3, 8, 2, 67, 1, 29, 4, 7, 3, 176, 3, 7, 4,&#xA;    29, 1, 67, 2, 8, 3, 19, 1, 646, 2, 8, 3, 19, 1&lt;/p&gt;&#xA;  &lt;/blockquote&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Also of interest is that the graph of the specific multiples of &lt;code&gt;9&lt;/code&gt; to derive all lexicographic permutations of a set can be found by computing only half &lt;code&gt;1/2&lt;/code&gt; of the total permutations &lt;code&gt;+1&lt;/code&gt;, as the declination slope is identical to the inclination slope of multiples of &lt;code&gt;9&lt;/code&gt;, for example, given an input of the string &lt;code&gt;&quot;abc&quot;&lt;/code&gt; or array &lt;code&gt;[&quot;a&quot;,&quot;b&quot;,&quot;c&quot;]&lt;/code&gt;, we only need to reach the inverted peak of the graph, that is &lt;code&gt;bca 120 3 18&lt;/code&gt;, where the previously calculated values can be reversed and added to the current whole number, &lt;code&gt;120&lt;/code&gt;, to generate the remainder of the lexicographic permutations &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abc 012 0&#xA;acb 021 1 9&#xA;bac 102 2 81&#xA;bca 120 3 18&#xA;cab 201 4 81&#xA;cba 210 5 9&#xA;&#xA; /\/\&#xA;/    \&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Errata&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This challenge is not to determine the most efficient algorithm to calculate permutation &lt;code&gt;9!&lt;/code&gt;, as, again, adding &lt;code&gt;9&lt;/code&gt; to a whole number to reach that goal can be outperformed by swapping values or other method, as demonstrated at the accepted at the first SO link above.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge is to derive the most efficient method of determining the next lexicographic permutation by calculating the next multiple of &lt;code&gt;9&lt;/code&gt; that meets the above listed criteria, preferably &lt;em&gt;directly&lt;/em&gt; using math, if possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The reason am posting this question &lt;strong&gt;here and now&lt;/strong&gt; is because was &lt;em&gt;reminded&lt;/em&gt; by the graph of the peaks (particularly the third item) in this question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/173081/different-combinations-possible&quot;&gt;Different combinations possible&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Just to give a visual example, they are the following:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   /\     /\      /\/\&#xA;/\/  \   /  \/\  /    \&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;that in spite of performing various calculations using the index of the &lt;code&gt;!n&lt;/code&gt; within the resulting array of permutations, e.g., &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;var n = N = 1234;&#xA;var res = [9,81,18,81,9,702,9,171,27,72,18,693,18,72,27,171,9,702,9,81,18,81,9].map((x)=&amp;gt;n=n+x);&#xA;// try to determine the rate of growth&#xA;var j = res.map((x)=&amp;gt;x/N);&#xA;&#xA;console.log(res, j);&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;var tryStuff = 1234*(4321/1234);&#xA;console.log(tryStuff, (4321/1234));&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;am still vexed by and have not been able to independently determine the mathematical formula to derive the next lexicographic permutation &lt;em&gt;directly&lt;/em&gt; without adding &lt;code&gt;9&lt;/code&gt; multiple times to reach the required number; or if that is even mathematically possible for any input set from &lt;code&gt;2!&lt;/code&gt; through &lt;code&gt;9!&lt;/code&gt;. That is, this code&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;function getNextLexicographicPermutation(arr) {&#xA;&#xA;  for (var l = 1, i = k = arr.length; l &amp;lt; i; k *= l++);&#xA;&#xA;  function checkDigits(min, max, n) {&#xA;    var digits = 0;&#xA;    while (n) {&#xA;      d = (n % 10);&#xA;      n = n / 10 &amp;gt;&amp;gt; 0;&#xA;&#xA;      if (d &amp;lt; min || d &amp;gt; max || (digits &amp;amp; (1 &amp;lt;&amp;lt; d)))&#xA;        return false;&#xA;      else&#xA;        digits |= 1 &amp;lt;&amp;lt; d;&#xA;    }&#xA;    return true;&#xA;  }&#xA;&#xA;  var len = arr.length,&#xA;    idx = arr.map(function(_, index) {&#xA;      return index&#xA;    }),&#xA;    p = 9,&#xA;    min = 0,&#xA;    max = len - 1,&#xA;    last = Number(idx.slice().reverse().join(&quot;&quot;)),&#xA;    curr = Number(idx.join(&quot;&quot;)),&#xA;    res = [curr],&#xA;    diff = [],&#xA;    result = [],&#xA;    next, times = 0;&#xA;&#xA;  while (res.length &amp;lt; (k / 2) + 1) {&#xA;    ++times;&#xA;    next = (curr += p);&#xA;    if (checkDigits(min, max, next)) res[res.length] = next;&#xA;    curr = next;&#xA;  };&#xA;&#xA;  for (var i = 0; i &amp;lt; res.length; i++) {&#xA;    var item = res[i];&#xA;    item = String(item).split(&quot;&quot;).map(Number);&#xA;    item = (item.length &amp;lt; arr.length ? [0].concat(item) : item)&#xA;      .map(function(index) {&#xA;        return arr[index]&#xA;      }).filter(Boolean);&#xA;    result.push(item)&#xA;  }&#xA;&#xA;  res.reduce(function(a, b) {&#xA;    diff.push(b - a);&#xA;    return b&#xA;  });&#xA;&#xA;  for (var i = 0, curr = res[res.length - 1], n = diff.length - 2; result.length &amp;lt; k; i++, n--) {&#xA;    curr = curr + diff[n];&#xA;    result.push(&#xA;      String(curr).split(&quot;&quot;)&#xA;      .map(function(index) {&#xA;        return arr[index]&#xA;      })&#xA;    );&#xA;  }&#xA;  return [result, diff, res, times];&#xA;}&#xA;&#xA;var arr = [&quot;a&quot;, &quot;b&quot;, &quot;c&quot;, &quot;d&quot;];&#xA;&#xA;console.log(getNextLexicographicPermutation(arr));&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;which generates the second half-1 of the permutations from the first half+1 of the permutations checks if the next whole number meets the necessary conditions &lt;code&gt;210&lt;/code&gt; times for an input array of &lt;code&gt;[&quot;a&quot;,&quot;b&quot;,&quot;c&quot;,&quot;d&quot;]&lt;/code&gt; which has a resulting &lt;code&gt;.length&lt;/code&gt; of &lt;code&gt;24&lt;/code&gt;. Ideally, we want to generate &lt;code&gt;24&lt;/code&gt; lexicographic permutations using only &lt;code&gt;12&lt;/code&gt; or &lt;code&gt;13&lt;/code&gt; checks; or no checks at all, by determining the irrational number or other mathematical algorithm which will &lt;em&gt;directly&lt;/em&gt; calculate (or approximate close enough to determine the next multiple of &lt;code&gt;9&lt;/code&gt;) the next whole number which meets the necessary criteria.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Kindly disregard the length of this post, as am trying to include as much information as consider relevant to the inquiry.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This challenge must use the number &lt;code&gt;9&lt;/code&gt; (addition, multiplication, division, other mathematical operation) to determine the next lexicographic permutation using the indexes of the current lexicographic permutation converted to a whole number, ideally, in a single operation, else in the least amount of operations necessary to achieve the expected result.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Again, this challenge is not asking how to code &lt;em&gt;the&lt;/em&gt; most efficient code which determines the next lexicographic permutation, but what is &lt;em&gt;the&lt;/em&gt; most efficient approach is using only the number &lt;code&gt;9&lt;/code&gt; and math to generate the permutations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since we can get the first and last lexicographic permutations by reversing the indexes of the input array, that is not counted as an operation within the program.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An array or sting having &lt;code&gt;.length&lt;/code&gt; less than or equal to &lt;code&gt;9!&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Lexicographically sorted array of permutations of input.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Remaining within the Rules above, determine a mathematical algorithm which directly generates the next lexicographic permutation using only the current indexes of the original input or current permutation. Ideally, directly, without having to add &lt;code&gt;9&lt;/code&gt; in multiple operations until the listed criteria is met, that is, we want a single algorithm to calculate that we need to add &lt;code&gt;81&lt;/code&gt; to &lt;code&gt;132&lt;/code&gt; to get the sum &lt;code&gt;213&lt;/code&gt; and add &lt;code&gt;702&lt;/code&gt; to &lt;code&gt;321&lt;/code&gt; to get the sum &lt;code&gt;1023&lt;/code&gt; and so forth. Explain the math in the algorithm. &lt;strong&gt;Note:&lt;/strong&gt; The requirement might not be possible. If that is the case, explain why. &lt;/p&gt;&#xA;" OwnerUserId="31257" LastActivityDate="2018-10-04T16:03:55.563" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="16963" PostTypeId="2" ParentId="2140" CreationDate="2018-10-05T11:40:00.750" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/173635/be-there-for-the-square&quot;&gt;Be there, for the square&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="79994" LastEditorUserId="79994" LastEditDate="2018-10-08T08:20:02.127" LastActivityDate="2018-10-08T08:20:02.127" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16966" PostTypeId="1" CreationDate="2018-10-05T16:14:18.963" Score="23" ViewCount="527" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9090/tour-to-improve-the-discoverability-of-old-challenges&quot;&gt;Related&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Earlier today, &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/47045128#47045128&quot;&gt;AdmBorkBork posted this question&lt;/a&gt; on TNB, asking whether or not PPCG was dying. In the following discussion, I have suggested we, as a community, could start &quot;reviving&quot; (for lack of a better term) select challenges, based on suggestions given by us.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The reasoning behind it is that PPCG has, at the time I'm posting this, &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=answers%3A..1+created%3A..60d+hasaccepted%3A0+closed%3A0+locked%3A0&quot;&gt;459 challenges&lt;/a&gt; with one or less answers that have been posted more than 60 days ago, and that are neither closed nor locked and have no accepted answers. Naturally, this could be for any number of reasons, including uninteresting or trivial challenges. Some of them, however, could be potentially very interesting challenges that have been overlooked by the community, or that have been posted early on in PPCG's 'life' and been subsequently buried by thousands of other posts.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;My Suggestion:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Once every [period of time, tbd later], the community would suggest (in a meta-post or chatroom created for this purpose) challenges that fit parameters similar to the ones mentioned in the search above [those parameters are also tbd later]. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge(s) with the most votes could then be &quot;revived&quot;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;First, check whether the challenge fits our current standards for challenges. This is important, especially for older challenges, so that there's no confusion regarding rules that are no longer in effect.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the challenge doesn't fit current standards, we edit it in a way that keeps the objective of the challenge unchanged. Of course, this might not be possible for every challenge, which would be one of the criteria we as a community should observe when suggesting and/or voting on suggested challenges.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;After that edit, the challenge should be bumped to the first page. I'd also suggest adding a bounty to give some more incentive for new answers to be posted, but that is, of course, optional.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;There is also the issue with non-competing answers for languages (or specific functions of a language) developed after the challenge has been posted&lt;sup&gt;1&lt;/sup&gt;.&lt;/s&gt; Not relevant since &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12877/lets-allow-newer-languages-versions-for-older-challenges/12930#12930&quot;&gt;this post&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Keep in mind that this is still a very crude suggestion, since the main objectives of this post are to see whether the PPCG community is on board with the idea of reviving older challenges that currently get almost no visibility, and if so, to gather more suggestions on how to do this properly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, my main questions for now are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this feasible?&lt;/li&gt;&#xA;&lt;li&gt;Would it be possible to do this in a recurring fashion, such as the language of the month post?&lt;/li&gt;&#xA;&lt;li&gt;If we determine that it is possible, should we do this for a single challenge, or should there be a fixed amount of challenges to be chosen each period?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="74163" LastEditorUserId="74163" LastEditDate="2018-10-05T17:35:10.067" LastActivityDate="2019-02-08T12:42:09.460" Title="Should we start &quot;reviving&quot; older challenges?" Tags="|discussion|site-health|" AnswerCount="3" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16967" PostTypeId="2" ParentId="16966" CreationDate="2018-10-06T04:42:16.643" Score="-2" Body="&lt;h1&gt;Reviving KOTHs seems a good temporary solution&lt;/h1&gt;&#xA;&lt;p&gt;I mean, not all types of challenges are meaningful enough to revive - especially those kolmogorov-complexity challenges.&lt;/p&gt;&#xA;&lt;p&gt;Restarting a KOTH with a fresh set of entries gives different results, and if the KOTH has random elements, even the exact identical set of entries can give different results. Of course I am not encouraging participants to copy the entries from the old KOTH, but since KOTHs must have a cutoff time, it'd be beneficial to restart a KOTH to receive new entries, or even &lt;strong&gt;let new entries compete with the original ones.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Moreover, since KOTHs usually have a large number (say tens) of entries, it may render a temporary illusion that the site is still as active as before.&lt;/p&gt;&#xA;&lt;p&gt;Of course sustaining the site only by reviving KOTHs is not a long-term solution. We still need new challenges and maybe pop-cons. BTW are we having fewer and fewer pop-cons nowadays?&lt;/p&gt;&#xA;" OwnerUserId="71546" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-10-06T04:42:16.643" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16969" PostTypeId="2" ParentId="2140" CreationDate="2018-10-06T08:54:05.663" Score="0" Body="&lt;h1&gt;Qwixx KoTH&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In this King of the Hill, our bots will be playing &lt;a href=&quot;https://boardgamegeek.com/boardgame/131260/qwixx&quot; rel=&quot;nofollow noreferrer&quot;&gt;Qwixx&lt;/a&gt;. In Qwixx each player will try to get as many points by picking the sum of two dices and marking that number on your own scoresheet. The scoresheet has four rows with different colors (red, yellow, green, blue) with numbers ranging from 2 to 12, where green and blue have the numbers ranked in descending order. You can only mark out a number if you haven't marked a number to the right of it, i.e. after marking &lt;code&gt;red 3&lt;/code&gt; you cannot mark &lt;code&gt;red 2&lt;/code&gt; anymore. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;All of the rules of Qwixx are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Red and yellow have numbers 2, 3, ..., 12, and a padlock.&lt;/li&gt;&#xA;&lt;li&gt;Green and blue have numbers 12, 11, ..., 2, and a padlock.&lt;/li&gt;&#xA;&lt;li&gt;There are 6 dices: red, yellow, green, blue and two white dices.&lt;/li&gt;&#xA;&lt;li&gt;On your turn you will throw all the dices, except for deleted ones.&lt;/li&gt;&#xA;&lt;li&gt;Everyone can mark one number on one color equal to the sum of the white dices. Also if it is not your turn.&lt;/li&gt;&#xA;&lt;li&gt;If it is your turn, you can also mark one number in a specific color, with the sum of one colored dice and one white dice. The colored dice that you pick denotes in which color you need to mark the number.&lt;/li&gt;&#xA;&lt;li&gt;You can only mark numbers to the right of already marked numbers.&lt;/li&gt;&#xA;&lt;li&gt;The last number can only be marked if you have already marked at least 5 numbers before. If you do this, you will automatically also mark the padlock, which will give you extra points. If you do this, that colored dice is not thrown anymore and nobody can mark a number in that color. This dice is deleted from the game (thrown as 0).&lt;/li&gt;&#xA;&lt;li&gt;Only on your turn you need to mark at least one number. If you don't do this, you will automatically mark a penalty box, which costs you 5 points.&lt;/li&gt;&#xA;&lt;li&gt;The amount of points is equal to the sum of 1 up to the amount of marks in each color, minus 5 times the amount of penalties. I.e.: 4 in red, 3 in green and 2 penalties is &lt;code&gt;4+3+2+1 + 3+2+1 = 16 - 2 * 5 = 6&lt;/code&gt; points.&lt;/li&gt;&#xA;&lt;li&gt;Each turn is simultanouesly. &lt;/li&gt;&#xA;&lt;li&gt;The game ends when the second dice is deleted or when a scoresheet contains 4 penalties.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Tournament&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The tournament rules are as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The tournament consists of &lt;code&gt;10000 * amount of bots&lt;/code&gt; games.&lt;/li&gt;&#xA;&lt;li&gt;Each game will be played with 5 random bots, in a randomized order.&lt;/li&gt;&#xA;&lt;li&gt;If multiple bots end up with the same amount of points in one game, each bot gets a win.&lt;/li&gt;&#xA;&lt;li&gt;The winner of the tournament is the bot who has the highest win percentage.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Bots&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The bot needs to be defined in Python and needs to have two functions: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;__init__(self, index)&lt;/code&gt; with the index in &lt;code&gt;scoresheets&lt;/code&gt;, so that you know which &lt;code&gt;scoresheet&lt;/code&gt; is yours&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;turn(self, scoresheets, dices, my_turn)&lt;/code&gt;, with the current &lt;code&gt;scoresheets&lt;/code&gt;, the &lt;code&gt;dices&lt;/code&gt; of this turn and a boolean being &lt;code&gt;True&lt;/code&gt; when it is your turn. This function needs to return a tuple of two tuples containing &lt;code&gt;(color, number)&lt;/code&gt; with what your bot wants to mark, where the first tuple is for the white dices, and the second tuple only if its your turn.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The simplest bot can be defined as:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;class DoNothing:&#xA;    def __init__(self, index):&#xA;        return&#xA;    def turn(self, scoresheets, dices, my_turn):&#xA;        return ([],[])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which does absolutely nothing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A randomized bot that tries to always mark something when possible is:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;class RandomAllowedCombinations:&#xA;    def __init__(self, index):&#xA;        self.index = index&#xA;        return&#xA;    def turn(self, scoresheets, dices, my_turn):&#xA;        (any_combs, turn_combs) = scoresheets[self.index].allowed_combinations(my_turn, dices)&#xA;&#xA;        any_comb = []&#xA;        if any_combs:&#xA;            any_comb = any_combs[random.randint(0, len(any_combs)-1)]&#xA;&#xA;        turn_comb = []&#xA;        if my_turn and turn_combs:&#xA;            turn_comb = turn_combs[random.randint(0, len(turn_combs)-1)]&#xA;&#xA;        return (any_comb, turn_comb)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This also shows some of the utility functions: you can use &lt;code&gt;scoresheets[self.index].allowed_combinations(my_turn, dices)&lt;/code&gt; to check what you can mark with the white dices, and if its your turn with one of the colored dices as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Both classes (&lt;code&gt;Dices&lt;/code&gt; and &lt;code&gt;Scoresheet&lt;/code&gt;) have several utility functions. You can check themselves to improve your bot. Note that &lt;code&gt;Dices&lt;/code&gt; also contains the indices for each color. And the value of a dice is 0 if it is deleted (i.e. when someone in the game marked the last number and thus the padlock in one of the previous turns).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Controller&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The controller contains 5 example bots. These will not be used in the tournament, unless there are too few participants.&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;import random&#xA;import numpy&#xA;&#xA;### Bots ###&#xA;class DoNothing:&#xA;    def __init__(self, index):&#xA;        return&#xA;    def turn(self, scoresheets, d, my_turn):&#xA;        return ([],[])&#xA;&#xA;class AlwaysWhitesInRed:&#xA;    def __init__(self, index):&#xA;        return&#xA;    def turn(self, scoresheets, d, my_turn):&#xA;        return ((d.red, d.dices[d.white1] + d.dices[d.white2]),[])&#xA;&#xA;class AlwaysBlueOnlyTurn:&#xA;    def __init__(self, index):&#xA;        return&#xA;    def turn(self, scoresheets, d, my_turn):&#xA;        return ([],(d.blue, d.dices[d.blue] + d.dices[d.white2]))&#xA;&#xA;class RandomAllowedCombinations:&#xA;    def __init__(self, index):&#xA;        self.index = index&#xA;        return&#xA;    def turn(self, scoresheets, dices, my_turn):&#xA;        (any_combs, turn_combs) = scoresheets[self.index].allowed_combinations(my_turn, dices)&#xA;&#xA;        any_comb = []&#xA;        if any_combs:&#xA;            any_comb = any_combs[random.randint(0, len(any_combs)-1)]&#xA;&#xA;        turn_comb = []&#xA;        if my_turn and turn_combs:&#xA;            turn_comb = turn_combs[random.randint(0, len(turn_combs)-1)]&#xA;&#xA;        return (any_comb, turn_comb)&#xA;&#xA;class RandomButOnlyOwnTurn:&#xA;    def __init__(self, index):&#xA;        self.index = index&#xA;        return&#xA;    def turn(self, scoresheets, dices, my_turn):&#xA;        (any_combs, turn_combs) = scoresheets[self.index].allowed_combinations(my_turn, dices)&#xA;&#xA;        turn_comb = []&#xA;        if my_turn and turn_combs:&#xA;            turn_comb = turn_combs[random.randint(0, len(turn_combs)-1)]&#xA;&#xA;        return ([], turn_comb)&#xA;&#xA;### Classes ###&#xA;class Dices:&#xA;    def __init__(self):&#xA;        self.dices = []&#xA;        self.deleted = []&#xA;        self.red = 0&#xA;        self.yellow = 1&#xA;        self.green = 2&#xA;        self.blue = 3&#xA;        self.white1 = 4&#xA;        self.white2 = 5&#xA;        self.colors = [self.red, self.yellow, self.green, self.blue]&#xA;        self.whites = [self.white1, self.white2]&#xA;        self.diff_dices = self.colors + self.whites&#xA;&#xA;    def roll_dice(self):&#xA;        self.dices = [0,0,0,0,0,0]&#xA;        for i in range(6):&#xA;            if i not in self.deleted:&#xA;                self.dices[i] = random.randint(1, 6)&#xA;&#xA;    def delete_dice(self, color):&#xA;        if not color in self.deleted:&#xA;            self.deleted.append(color)&#xA;        return len(self.deleted) &amp;gt; 1&#xA;&#xA;    def combinations(self):&#xA;        combs = [(color, white) for color in self.colors for white in self.whites]&#xA;&#xA;        any_combs = [(color, self.dices[self.white1] + self.dices[self.white2]) for color in self.colors if self.dices[color] &amp;gt;= 1]&#xA;        turn_combs = [(color, self.dices[color] + self.dices[white]) for (color, white) in combs if self.dices[color] &amp;gt;= 1]&#xA;&#xA;        return (any_combs, turn_combs)&#xA;&#xA;class Game:&#xA;    def __init__(self, bots):&#xA;        self.bots = [bots[i](i) for i in range(len(bots))]&#xA;        self.scoresheets = [Scoresheet() for i in self.bots]&#xA;        self.dices = Dices()&#xA;        self.turn_number = 2&#xA;&#xA;    def round(self):&#xA;        self.dices.roll_dice()&#xA;        (any_combs, turn_combs) = self.dices.combinations()&#xA;&#xA;        finished = False&#xA;&#xA;        for i, bot in enumerate(self.bots):&#xA;            my_turn = self.whos_turn() == i&#xA;            moves = bot.turn(self.scoresheets, self.dices, my_turn)&#xA;            deleted_colors = self.scoresheets[i].mark(moves, my_turn, any_combs, turn_combs, self.dices)&#xA;            if deleted_colors:&#xA;                finished = finished or any([self.dices.delete_dice(deleted_color) for deleted_color in deleted_colors]) &#xA;            finished = finished or self.scoresheets[i].too_many_penalties()&#xA;&#xA;        self.turn_number += 1&#xA;&#xA;        return finished&#xA;&#xA;    def whos_turn(self):&#xA;        return (self.turn_number - 1) % len(self.bots)&#xA;&#xA;    def runGame(self):&#xA;        finished = False&#xA;        while not finished:&#xA;            finished = self.round()&#xA;        #for i, scoresheet in enumerate(self.scoresheets):&#xA;            #print self.bots[i], scoresheet.values, scoresheet.penalties, scoresheet.points()&#xA;&#xA;class Scoresheet:&#xA;    def __init__(self):&#xA;        self.red = []&#xA;        self.yellow = []&#xA;        self.green = []&#xA;        self.blue = []&#xA;        self.penalties = 0&#xA;        self.values = [self.red, self.yellow, self.green, self.blue]&#xA;&#xA;    def points(self):&#xA;        points = self.penalties * -5&#xA;        for color in self.values:&#xA;            points += sum(range(len(color)+1))&#xA;        return points&#xA;&#xA;    def allowed_combinations(self, my_turn, dices):&#xA;        (any_combs, turn_combs) = dices.combinations()&#xA;        any_combs = [(color, number) for (color, number) in any_combs if self.allowed(color, number, any_combs, dices)]&#xA;        turn_combs = [(color, number) for (color, number) in turn_combs if self.allowed(color, number, turn_combs, dices)]&#xA;&#xA;        if not my_turn:&#xA;            turn_combs = []&#xA;&#xA;        return (list(set(any_combs)), list(set(turn_combs)))&#xA;&#xA;    def allowed(self, color, number, combs, d):&#xA;        if color not in d.deleted:&#xA;            if (color, number) in combs:&#xA;                if color == d.red or color == d.yellow:&#xA;                    if not self.values[color] or max(self.values[color]) &amp;lt; number:&#xA;                        if number &amp;lt; 12 or self.end_number(color, number, d):&#xA;                            return True&#xA;                if color == d.green or color == d.blue:&#xA;                    if not self.values[color] or min(self.values[color]) &amp;gt; number:&#xA;                        if number &amp;gt; 2 or self.end_number(color, number, d):&#xA;                            return True&#xA;        return False&#xA;&#xA;    def end_number(self, color, number, d):&#xA;        if len(self.values[color]) &amp;gt; 5:&#xA;            return (number == 2 and (color == d.green or color == d.blue)) or (number == 12 and (color == d.red or color == d.yellow))&#xA;        return False&#xA;&#xA;    def mark_one(self, color, number, combs, deleted, d):&#xA;        if self.allowed(color, number, combs, d):&#xA;            self.values[color].append(number)&#xA;            if self.end_number(color, number, d):&#xA;                self.values[color].append(0)&#xA;                deleted.append(color)&#xA;        return deleted&#xA;&#xA;    def mark(self, moves, my_turn, any_combs, turn_combs, d):&#xA;        beforePoints = self.points()&#xA;&#xA;        deleted = []&#xA;        if moves[0]:&#xA;            deleted = self.mark_one(moves[0][0], moves[0][1], any_combs, deleted, d)&#xA;        if my_turn and moves[1]:&#xA;            deleted = self.mark_one(moves[1][0], moves[1][1], turn_combs, deleted, d)&#xA;&#xA;        if my_turn and beforePoints == self.points():&#xA;            self.penalties += 1&#xA;&#xA;        return deleted&#xA;&#xA;    def too_many_penalties(self):&#xA;        return self.penalties &amp;gt;= 4&#xA;&#xA;class Qwixx:&#xA;    def __init__(self, bots, bots_per_game):&#xA;        self.bots = bots&#xA;        self.games = [0 for i in range(len(self.bots))]&#xA;        self.points = [0 for i in range(len(self.bots))]&#xA;        self.wins = [0 for i in range(len(self.bots))]&#xA;        self.amountOfGames = len(bots) * 1000&#xA;        self.bots_per_game = bots_per_game&#xA;&#xA;    def run_tournament(self):&#xA;        for g in range(1, self.amountOfGames + 1):&#xA;            bot_indices = numpy.random.choice(range(len(self.bots)), self.bots_per_game, replace=False)&#xA;            bots_this_game = [self.bots[i] for i in bot_indices]&#xA;&#xA;            game = Game(bots_this_game)&#xA;            game.runGame()&#xA;&#xA;            maxPoints = max([game.scoresheets[i].points() for i in range(len(bot_indices))])&#xA;            for bot_index_game, bot_index_total in enumerate(bot_indices):&#xA;                points = game.scoresheets[bot_index_game].points()&#xA;                self.points[bot_index_total] += points&#xA;                self.games[bot_index_total] += 1&#xA;                if points == maxPoints:&#xA;                    self.wins[bot_index_total] += 1&#xA;                    print &quot;GAME&quot;, g, &quot;is&quot;,  self.wins[bot_index_total], &quot;th win by&quot;, self.bots[bot_index_total].__name__&#xA;&#xA;    def tournament(self):&#xA;        self.run_tournament()&#xA;&#xA;        win_rates = {i: self.wins[i] / float(self.games[i]) for i in range(len(self.bots))}&#xA;        format_result = '{:&amp;gt;30}: {:.4f}  {:&amp;gt;6} {:&amp;gt;8} {:&amp;gt;8}' &#xA;        format_header = '{:&amp;gt;30}: {:&amp;gt;6}  {:&amp;gt;6} {:&amp;gt;8} {:&amp;gt;8}' &#xA;        print(format_header.format('Name', 'Win %', 'Wins', 'Games', 'Points'))&#xA;        for j, i in enumerate(sorted(win_rates, key=lambda i: win_rates[i], reverse=True)):&#xA;            print(format_result.format(self.bots[i].__name__, win_rates[i], self.wins[i], self.games[i], self.points[i]))&#xA;&#xA;### List of all bots ###&#xA;all_bots = [DoNothing, BadRandom, RandomAllowedCombinations, Random50, RandomButOnlyOwnTurn]&#xA;&#xA;### Run tournament ###&#xA;Qwixx(all_bots, 5).tournament()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot;&gt;python&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sandbox&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If someone can check my Python programming capabilities that would be great. I'm no native Python programmer.&lt;/li&gt;&#xA;&lt;li&gt;There are quite some rules. Maybe I should simplify it? These are the official rules, but for example I could change that even on your turn you can only move once instead of twice.&lt;/li&gt;&#xA;&lt;li&gt;This is my first challenge, so any feedback is welcome.&lt;/li&gt;&#xA;&lt;li&gt;Note that I have not yet tested my controller thoroughly, I will do this before posting it as an actual challenge.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="51963" LastActivityDate="2018-10-06T08:54:05.663" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16970" PostTypeId="1" AcceptedAnswerId="16971" CreationDate="2018-10-06T10:24:50.413" Score="2" ViewCount="126" Body="&lt;p&gt;There are tasks explicitly defined with Unicode. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/173422&quot;&gt;Supreme Sum String&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To correctly work with a unicode data, a script should be saved as &lt;code&gt;UTF-16&lt;/code&gt; or &lt;code&gt;UTF-8 with BOM&lt;/code&gt;. Even if the script itself does not contain Unicode characters. At least for Powershell it is.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How to calculate the length (a golf score) of a script that should work correctly with Unicode?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;case 1: The script does not contain Unicode characters and have saved in &lt;code&gt;UTF-16&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;case 2: The script does not contain Unicode characters and have saved in &lt;code&gt;UTF-8 with BOM&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;case 3: The script contains Unicode characters and have saved in &lt;code&gt;UTF-8 with BOM&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="80745" LastActivityDate="2018-10-08T00:27:52.213" Title="Golfed script length with Unicode (non-ASCII) characters" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16971" PostTypeId="2" ParentId="16970" CreationDate="2018-10-06T12:40:48.120" Score="4" Body="&lt;h1&gt;We score by bytes, not characters.&lt;/h1&gt;&#xA;&lt;p&gt;Measuring bytes is independent of the encoding used.  You may get fewer characters out of your bytes if you use &lt;code&gt;UTF-32&lt;/code&gt;, but the choice of encoding is up to the submission author and the language.&lt;/p&gt;&#xA;&lt;p&gt;As to the encoding of characters in the input/output, that is for the OP to decide.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-10-06T12:40:48.120" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="16972" PostTypeId="2" ParentId="2140" CreationDate="2018-10-06T20:14:32.440" Score="1" Body="&lt;h1&gt;Ascii Table to UTF-8&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;When I write documentation, comments, etc. I love making ASCII tables. They usually end up looking pretty good, but I always feel that they could look even better - especially since UTF-8/Unicode includes the &lt;a href=&quot;https://unicode-table.com/en/blocks/box-drawing/&quot; rel=&quot;nofollow noreferrer&quot;&gt;box drawing characters&lt;/a&gt;. However, these characters are very burdensome to use, requiring several key presses to insert. Your task? Write a program or a function that can automatically convert ASCII tables to the UTF-8/Unicode equivalent.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program, that given an ASCII table as an input string, outputs the table redrawn with the Unicode/UTF-8 box drawing characters. Specifically, the characters that are a part of the table should be translated as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(Unicode)&#xA;- to ─ (\u2500)&#xA;| to │ (\u2502)&#xA;= to ═ (\u2550)&#xA;&#xA;and + to one of:&#xA;   ┌ (\u250C), ┐ (\u2510), └ (\u2514), ┘ (\u2518),&#xA;   ├ (\u251C), ┤ (\u2524), ┬ (\u252C), ┴ (\u2534),&#xA;   ┼ (\u253C)&#xA;or, if '=' on either side:&#xA;   ╒ (\u2552), ╕ (\u2555), ╘ (\u2558), ╛ (\u255D),&#xA;   ╞ (\u255E), ╡ (\u2561), ╤ (\u2564), ╧ (\u2567),&#xA;   ╪ (\u256A)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Details&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I/O:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447&quot;&gt;Default I/O&lt;/a&gt; is allowed&lt;/li&gt;&#xA;&lt;li&gt;You may take a path to a file instead of the table as a string.&lt;/li&gt;&#xA;&lt;li&gt;You may output to a file and take the file name as an additional argument.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;However, you &lt;strong&gt;may not modify the &lt;em&gt;input&lt;/em&gt; file&lt;/strong&gt;. (It should be retained for ease of future editing)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may assume that every row of input has been padded to be the same length with &lt;code&gt;&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You may not assume that the first character after a newline is a part of the table borders (as it may be whitespace).&lt;/li&gt;&#xA;&lt;li&gt;Input is considered a valid table if all characters (that are a part of the table) &lt;code&gt;-=|&lt;/code&gt; are connected to exactly two characters and &lt;code&gt;+&lt;/code&gt; are connected to at least one character both horizontally and vertically.&lt;/li&gt;&#xA;&lt;li&gt;Your program may not produce any errors with valid inputs.&lt;/li&gt;&#xA;&lt;li&gt;If the input is not valid the behavior is undefined and you may produce any output.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any of the characters &lt;code&gt;-=|+&lt;/code&gt; that are not a part of the table &lt;strong&gt;must&lt;/strong&gt; be left as-is.&lt;/li&gt;&#xA;&lt;li&gt;Similarly, any other characters must be left as-is.&lt;/li&gt;&#xA;&lt;li&gt;A single leading and/or trailing newline is allowed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Other:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden, as per usual.&lt;/li&gt;&#xA;&lt;li&gt;If your preferred language has a built-in that solves this problem, you may not use it.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This means programs, functions, subroutines or instructions that would be valid submissions for this challenge with no additions.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Connected characters&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A character is connected to another, if:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is &lt;code&gt;|&lt;/code&gt; and is directly above or below &lt;code&gt;+&lt;/code&gt; or &lt;code&gt;|&lt;/code&gt;;&lt;/li&gt;&#xA;&lt;li&gt;It is &lt;code&gt;-&lt;/code&gt; and is directly before or after &lt;code&gt;+&lt;/code&gt; or &lt;code&gt;-&lt;/code&gt;;&lt;/li&gt;&#xA;&lt;li&gt;It is &lt;code&gt;=&lt;/code&gt; and is directly before or after &lt;code&gt;+&lt;/code&gt; or &lt;code&gt;=&lt;/code&gt;;&lt;/li&gt;&#xA;&lt;li&gt;It is &lt;code&gt;+&lt;/code&gt; and is directly above or below &lt;code&gt;|&lt;/code&gt; or &lt;code&gt;+&lt;/code&gt;, or is directly before or after &lt;code&gt;-&lt;/code&gt;, &lt;code&gt;=&lt;/code&gt; or &lt;code&gt;+&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;A character is considered a part of the table, if it is connected to any character that is a part of the table. By definition, the first &lt;code&gt;+&lt;/code&gt; in the input is a part of the table.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Examples available &lt;a href=&quot;https://pastebin.com/Wzcr113K&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; as a copy-pastable version.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; Input:                    Output:&#xA;+------------------+      ┌──────────────────┐&#xA;|   Hello+World!   |      │   Hello+World!   │&#xA;+==================+      ╞══════════════════╡&#xA;| This is+my first |  -&amp;gt;  │ This is+my first │&#xA;|+-+ code|golf  +-+|      │+-+ code|golf  +-+│&#xA;|+-+chall|enge! +-+|      │+-+chall|enge! +-+│&#xA;+------------------+      └──────────────────┘&#xA;&#xA;     +===+===+===+             ╒═══╤═══╤═══╕&#xA;     | 1 | 2 | 3 |             │ 1 │ 2 │ 3 │&#xA; +---+===+===+===+         ┌───╪═══╪═══╪═══╡&#xA; | 1 | 1 | 2 | 3 |         │ 1 │ 1 │ 2 │ 3 │&#xA; +---+---+---+---+    -&amp;gt;   ├───┼───┼───┼───┤&#xA; | 2 | 2 | 4 | 6 |         │ 2 │ 2 │ 4 │ 6 │&#xA; +---+---+---+---+         ├───┼───┼───┼───┤&#xA; |-3 |-3 |-6 |-9 |         │-3 │-3 │-6 │-9 │&#xA; +===+---+---+---+         ╘═══╧───┴───┴───┘&#xA;&#xA;      +-----+         -&amp;gt;      &amp;lt;Undefined&amp;gt;&#xA;&#xA;      +-----+         -&amp;gt;      ┌─────┐&#xA;      +-----+                 └─────┘&#xA;&#xA;+-----------------+&#xA;|  Hello, World!  |&#xA;| This is invalid |   -&amp;gt;      &amp;lt;Undefined&amp;gt;&#xA;|      input      |&#xA; -----------------+&#xA;&#xA;       ++++                      ┌┬┬┐&#xA;       ++++           -&amp;gt;         ├┼┼┤&#xA;       ++++                      └┴┴┘&#xA;&#xA;       +--+&#xA;       ++++           -&amp;gt;      &amp;lt;Undefined&amp;gt;&#xA;       +--+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Finally...&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the least amount of bytes wins. Happy golfing!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user77406" LastEditorDisplayName="user77406" LastEditDate="2018-10-08T19:17:39.973" LastActivityDate="2018-10-08T19:17:39.973" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16973" PostTypeId="2" ParentId="2140" CreationDate="2018-10-07T07:35:56.370" Score="1" Body="&lt;h1&gt;Converting a number from Zeckendorf Representation to Decimal&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/173601/converting-a-number-from-zeckendorf-representation-to-decimal&quot;&gt;moved to main&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="80227" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-10-07T17:55:01.467" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16974" PostTypeId="2" ParentId="2140" CreationDate="2018-10-07T19:04:10.797" Score="-1" Body="&lt;p&gt;The goal of this challenge is to make an interpreted language that can print anything! The format of the language needs to be&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[command eg: print] [args];&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You have to use regex, even though it is not the typical way to write a language, to avoid people finding loopholes. Your interpreter also needs to ask for a file to open to interpret; example input file prompt:&amp;quot;File to interpret: &amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;Some tests to try:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;print Hello World;&#xA;&#xA;&#xA;print This is a very very very very very long test;&#xA;&#xA;ktrgjkfgjk;&#xA;&#xA;print hi&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If your interpreter runs these tests correctly, you can submit your interpreter.&lt;/p&gt;&#xA;&lt;h1&gt;Notes:&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Do not just cut off the print!&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;If the command given does not exist, or if semicolon not present, print &amp;quot;Error&amp;quot;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the &lt;strong&gt;lowest byte count + working code wins!&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="83295" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-10-07T19:30:43.917" CommentCount="16" ContentLicense="CC BY-SA 4.0" />
  <row Id="16975" PostTypeId="2" ParentId="16970" CreationDate="2018-10-08T00:27:52.213" Score="1" Body="&lt;h1&gt;Count Bytes Of Function Submission Without BOM&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You may choose any codepages your interpreter understand. And bytes are counted instead of characters. BOM should belong to the whole program instead of certain functions. So, you have to include the bytes count of BOM for a full program submission if you need it in your source code, but omit it if you are submitting a function.&lt;/p&gt;&#xA;" OwnerUserId="44718" LastActivityDate="2018-10-08T00:27:52.213" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="16976" PostTypeId="2" ParentId="16966" CreationDate="2018-10-08T08:45:41.103" Score="6" Body="&lt;p&gt;This answer does not address the primary question of &lt;em&gt;should we?&lt;/em&gt;, but rather the subsidiary question of &lt;em&gt;if so, how to do this properly&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;First, check whether the challenge fits our current standards for challenges. This is important, especially for older challenges, so that there's no confusion regarding rules that are no longer in effect.&lt;/li&gt;&#xA;  &lt;li&gt;If the challenge doesn't fit current standards, we edit it in a way that keeps the objective of the challenge unchanged. Of course, this might not be possible for every challenge, which would be one of the criteria we as a community should observe when suggesting and/or voting on suggested challenges.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Although when we post a question we legally surrender some control (because we're releasing it under CC-BY-SA), emotionally we tend to regard the question as ours. So to avoid friction, OP should be invited to take the lead in updating the question, even if they haven't been active on the site recently. A comment on the question is quite clearly the best way to do this in almost all cases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Either the OP or, if they don't respond to the invitation after a few days, the lead editor should take the question to the sandbox, indicating clearly at the top of the sandbox question that this is a revision to an existing question to bring it in line with current standards. That should avoid people who vaguely recognise the question wasting time by searching for the dupe.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As far as possible the changes should aim not to invalidate existing answers. If this seems impossible, the authors of the answers should be notified by comments so that they can participate in the process. They may have ideas for ways to avoid the invalidation, or they may be willing to rework their answer so that it becomes valid again.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If we determine that it is possible, should we do this for a single challenge, or should there be a fixed amount of challenges to be chosen each period?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I seem to recall that this has been done once or twice in the past, but I'm not aware of any post-mortem analysis. If there is a team of three or more people who want to take it on as an active project, I would suggest that you choose a single challenge to do as a trial, gather feedback (at least on chat, and probably on meta), and then decide whether and how to continue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rather than fixing a number of challenges per time period, it might be better to limit the number of rewrites which are active in the sandbox at any one time.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-10-08T08:45:41.103" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16977" PostTypeId="2" ParentId="2140" CreationDate="2018-10-08T15:49:05.903" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/173776/one-line-keyboard&quot;&gt;&lt;strong&gt;One line keyboard&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="75077" LastEditorUserId="75077" LastEditDate="2018-10-10T08:41:23.003" LastActivityDate="2018-10-10T08:41:23.003" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="16978" PostTypeId="2" ParentId="2140" CreationDate="2018-10-08T18:29:01.590" Score="-4" Body="&lt;p&gt;This question is a simplified description of the requirement described at &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/16961/31257&quot;&gt;Permutations to the nines&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Given input integer (&lt;strong&gt;minimum&lt;/strong&gt;) where the first digit is always &lt;code&gt;1&lt;/code&gt; and the adjacent digits are increasing in value, e.g.,&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;12&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;123&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;1234&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;12345&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;with the ability to handle up to the integer&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;123456789&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;where the &lt;strong&gt;maximum&lt;/strong&gt; integer is always the input integer in reverse order, e.g.,&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;21&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;321&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;4321&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;54321&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;987654321&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Return a list (array) of each number between the input minimum and maximum integer which satisfies three conditions&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;the resulting integer list item includes only the individual numbers comprising the input number&lt;/li&gt;&#xA;&lt;li&gt;the resulting integer list item does not contain any duplicate individual digits&lt;/li&gt;&#xA;&lt;li&gt;the resulting integer list item is greater than the preceding integer list item and not greater than a following integer in the list&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Valid list items&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;12 -&amp;gt; [21] // done&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;123 -&amp;gt; [132,213,231,213,312,321] // done&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Invalid list items&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;12345 -&amp;gt; 12344 // contains duplicate digits in whole number&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;123456789 -&amp;gt; 13256789 // not the next integer by increasing numeric value order&lt;/code&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;123456789 -&amp;gt; 987654322 // greater than maximum integer and duplicate digits&lt;/code&gt; &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winning criteria&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The algorithm which uses the &lt;strong&gt;least&lt;/strong&gt; amount of operations to compute the complete &#xA;resulting list of items.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;123 -&amp;gt; 123+5+4=132 // two mathematical computations&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;123 -&amp;gt; 123+9=132 // one mathematical computation (winning criteria)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(@JoKing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/173145/permutations-to-the-nines#comment417728_173145&quot;&gt;suggested&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot;&gt;fastest-algorithm&lt;/a&gt; tag; math and code-challenge tags are also applicable)&lt;/p&gt;&#xA;" OwnerUserId="31257" LastEditorUserId="31257" LastEditDate="2018-10-11T05:53:20.457" LastActivityDate="2018-10-11T05:53:20.457" CommentCount="28" ContentLicense="CC BY-SA 4.0" />
  <row Id="16979" PostTypeId="2" ParentId="2140" CreationDate="2018-10-09T06:49:25.637" Score="1" Body="&lt;h1&gt;Idolize Me! - JS idol simulation KotH &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/simulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;simulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;simulation&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are quite a lot of ACG titles featuring idols in Japan. Inspired by different kinds of such games, I decided to make up my idol simulation game.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What is &quot;Idolize Me!&amp;trade;&quot;?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Idolize Me!&amp;trade; (tentative) is based on an idol training facility featuring a monthly tournament, in which all idols compete for fame. Every idol has the following 4 kinds of attributes (or abilities):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;E&lt;/strong&gt;loquence (How well you speak)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;S&lt;/strong&gt;inging (How well you sing)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;D&lt;/strong&gt;ance (How well you dance)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;P&lt;/strong&gt;erformance (How well you act)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Also, every idol has the corresponding improvisation level (affects on-stage performance) and specialized skills. There are training courses to upgrade these abilities and skills, and idols can also &quot;learn&quot; from rivals during monthly tournaments to gain abilities and improvisation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The tournament is a Swiss-system tournament, idols gain and lose fame during 1-on-1 performance battles, and gain fame according to their overall tournament results.&#xA;Each battle consists of 3 rounds, selected from the 4 types of performances with different focusing attributes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Stand-up comedy battle (Eloquence)&lt;/li&gt;&#xA;&lt;li&gt;Duet battle (Singing)&lt;/li&gt;&#xA;&lt;li&gt;Dance battle (Dance)&lt;/li&gt;&#xA;&lt;li&gt;Drama battle (Performance)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Each idol can choose to ban one type he/she does not want to participate, and can choose to specify one type he/she want to participate. Other rounds will be selected randomly, and after 3 rounds, the idol who wins more rounds wins the battle. It is possible to end up with a draw, but this is very rare.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every one starts with the same amount of fame. After 3 years of training and competitions, the most famous idol will become the Super Idol!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Algorithmic Explanation&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each idol starts with 2500 units of fame, 10000 units of ability to be allotted to the 4 attributes by yourself, and 20 units of improvisation and 10 units of skill per attribute.&lt;/li&gt;&#xA;&lt;li&gt;The main loop consists of the following components, and will be run for 36 rounds (=3 years):&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Training&lt;/strong&gt; (4 rounds per round): Each idol will be given 100 units of ability and 5 units of improvisation. You can allot however you wish, &lt;strong&gt;but beware that improvisation caps at 50 units per attribute.&lt;/strong&gt; After allotment you can learn some skills or to strengthen your abilities at the cost of losing some improvisation. Every unit of improvisation can be converted to 5 units of ability or 0.2 units of skill. &lt;strong&gt;Beware that skill also caps at 50 units per attribute.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Tournament&lt;/strong&gt;: After 4 rounds of training there will be the tournament. The tournament will be a Swiss-system tournament, and consist of &lt;span class=&quot;math-container&quot;&gt;\$\lceil log_2(n+1) \rceil\$&lt;/span&gt; rounds, where &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is the number of idols. Each round will be run in the following manner:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Group the idols into a group of 2 according to their running rankings. &lt;/li&gt;&#xA;&lt;li&gt;For each group, each idol chooses one attribute from the 4 attributes, and discloses its corresponding ability.&lt;/li&gt;&#xA;&lt;li&gt;Then, being told the attributes and abilities, each idol decides one attribute to ban. Giving up the chance to ban is allowed.&lt;/li&gt;&#xA;&lt;li&gt;Next, being told the choice of ban, each idols decides one round to battle. They can still choose the banned choice, &lt;strong&gt;but the choice will be replaced by random rounds.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Fill the remaining rounds with random rounds not being banned until there are 3 rounds.&lt;/li&gt;&#xA;&lt;li&gt;In each round, each idol can choose whether to use skill of the attribute of the round. There is only one chance of using skills per idol per a 3-round battle. Then the final score of each idol will be calculated with the following formula:&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;score=\sum_{attr}{\Biggl\lfloor ability_{attr}\times multiplier_{type,attr}\times\left[0.7+r\times \left(0.3+\frac{improvisation_{attr}}{100}\right)\right]\times\left(1+\frac{skill_{attr}}{100}\right)\Biggr\rfloor}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Where &lt;span class=&quot;math-container&quot;&gt;\$ability_{attr}\$&lt;/span&gt; is your ability, &lt;span class=&quot;math-container&quot;&gt;\$improvisation_{attr}\$&lt;/span&gt; is your improvisation, &lt;span class=&quot;math-container&quot;&gt;\$skill_{attr}\$&lt;/span&gt; is your skill, all of the attribute &lt;span class=&quot;math-container&quot;&gt;\$attr\$&lt;/span&gt;, and &lt;span class=&quot;math-container&quot;&gt;\$r\$&lt;/span&gt; is a random number in the range&lt;span class=&quot;math-container&quot;&gt;\$[0, 1)\$&lt;/span&gt;, with a slightly larger probability near &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt;. The value of &lt;span class=&quot;math-container&quot;&gt;\$multiplier_{type,attr}\$&lt;/span&gt; is in the table below:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;      type   | Stand-up comedy     Duet Battle  Dance Battle  Drama Battle&#xA;attr         | Battle (Eloquence)  (Singing)    (Dance)       (Performance)&#xA;-------------+-------------------------------------------------------------&#xA;Eloquence    | 1.5                 0.8          0.5           1.2&#xA;Singing      | 0.8                 1.5          1.2           0.5&#xA;Dance        | 0.5                 1.2          1.5           0.8&#xA;Performance  | 1.2                 0.5          0.8           1.5   &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;(contd)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;(contd)&#xA;&#xA;&lt;ol start=&quot;7&quot;&gt;&#xA;&lt;li&gt;The idol with higher score wins the round, and idol who wins more rounds wins the battle.&lt;/li&gt;&#xA;&lt;li&gt;Winner of the battle will be award 2 points, loser 0 points, and in the case of a draw, 1 point each.&lt;/li&gt;&#xA;&lt;li&gt;Winner gets extra 10 units of ability and 1 unit of improvisation. &lt;strong&gt;For each losing round, the defeated idol gets 20 units of ability and 2 unit of improvisation, and for each draw round, each idol gets 30 units of ability and 3 unit of improvisation&lt;/strong&gt;, to be allotted at the same time (&lt;strong&gt;Beware again that improvisation caps at 50 units per attribute.&lt;/strong&gt;) -- This is the core of so-called &quot;learning from rivals&quot;.&lt;/li&gt;&#xA;&lt;li&gt;The delta fame is calculated as &lt;span class=&quot;math-container&quot;&gt;\$\lfloor10\times diff\times\frac{fame_{loser}}{fame_{winner}}\rfloor\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$diff\$&lt;/span&gt; is the difference of winning rounds in the battle. Winner gets this amount and loser loses this amount of fame.&lt;/li&gt;&#xA;&lt;li&gt;If the number of idols is odd, the idol who ranked the last will be consider a 0-battle win automatically, so fame, ability and improvisation are not affected.&lt;/li&gt;&#xA;&lt;li&gt;Sort the idols according to the following order, with the one at the top having the highest priority, all in descending order:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Tournament points (TP)&lt;/li&gt;&#xA;&lt;li&gt;Number of battles won&lt;/li&gt;&#xA;&lt;li&gt;Battle difference (BD) (Number of rounds won - Number of rounds lost)&lt;/li&gt;&#xA;&lt;li&gt;Number of rounds won (BF)&lt;/li&gt;&#xA;&lt;li&gt;Score difference (PD) (Total score got - Total score lost)&lt;/li&gt;&#xA;&lt;li&gt;Total score got (PF)&lt;/li&gt;&#xA;&lt;li&gt;Drawing lots&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;After all rounds, fame will be awarded by the following formula:&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;increase_{fame_{idol}}=\Biggl\lfloor\left[\left(\frac{n - rank + 1}{n}\right)^{1.5}\times 80+20\right]\times\frac{fame_{average}}{fame_{idol}}\Biggr\rfloor&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Where &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is the number of idols.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Submission requirements:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your bot must be a JS function with a name, &lt;strong&gt;prefably a human name (because the idol theme)&lt;/strong&gt;, distinct from other bots, that accepts an integer argument &lt;code&gt;id&lt;/code&gt; (you must not change this argument name) and returns an object with 2 fields and 8 functions. The 2 fields are &lt;code&gt;id&lt;/code&gt; and &lt;code&gt;name&lt;/code&gt; (&lt;strong&gt;please don't change the &lt;code&gt;id,&lt;/code&gt; line in the template&lt;/strong&gt;). The 8 function are as follows:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;allot(type, amount)&lt;/code&gt;: Allotment of &lt;code&gt;amount&lt;/code&gt; units of &lt;code&gt;type&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Arguments:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;type&lt;/code&gt;: one of &lt;code&gt;&quot;ability&quot;&lt;/code&gt; or &lt;code&gt;&quot;improvisation&quot;&lt;/code&gt;, the type to be allotted&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;amount&lt;/code&gt;: an integer, the amount to be allotted&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Return values:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An object with 4 numbers named &lt;code&gt;E&lt;/code&gt;, &lt;code&gt;S&lt;/code&gt;, &lt;code&gt;D&lt;/code&gt; and &lt;code&gt;P&lt;/code&gt;, denoting your decision of the allotment of the 4 attributes. The 4 numbers must sum up to &lt;code&gt;amount&lt;/code&gt;, otherwise your decision will be voided.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;review(ranking, battles)&lt;/code&gt;: Your bot can review the battle results and adjust your plans.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Arguments: &#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;ranking&lt;/code&gt;: an array of objects of the following entries, in ascending order of the bots' ranking, the running ranking during the tournament:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;id&lt;/code&gt;: an integer, the ID of the bot&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;W&lt;/code&gt;: an integer, battle wins&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;D&lt;/code&gt;: an integer, battle draws&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;L&lt;/code&gt;: an integer, battle losses&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;BF&lt;/code&gt;: an integer, rounds won&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;BA&lt;/code&gt;: an integer, rounds lost&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;BD&lt;/code&gt;: an integer, BF - BA&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;PF&lt;/code&gt;: an integer, total score won by the bot&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;PA&lt;/code&gt;: an integer, total score won by opponent&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;PD&lt;/code&gt;: an integer, PF - PA&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;pts&lt;/code&gt;: an integer, tournament points&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;battles&lt;/code&gt;: an array of objects of the following entries, the details of all battles:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;aID&lt;/code&gt;: an integer, the ID of idol A&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;aWin&lt;/code&gt;: an integer, rounds idol A won&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;aPtTotal&lt;/code&gt;: an integer, total score idol A got&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;bID&lt;/code&gt;: an integer, the ID of idol B. &lt;code&gt;-1&lt;/code&gt; stands for no opponent&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;bWin&lt;/code&gt;: an integer, rounds idol B won&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;bPtTotal&lt;/code&gt;: an integer, total score idol B got&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;result&lt;/code&gt;: an array of the following entries, the details of the sub-rounds of the battle:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;attribute&lt;/code&gt;: one of &lt;code&gt;&quot;E&quot;&lt;/code&gt;, &lt;code&gt;&quot;S&quot;&lt;/code&gt;, &lt;code&gt;&quot;D&quot;&lt;/code&gt; or &lt;code&gt;&quot;P&quot;&lt;/code&gt;, the attribute of the round&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;aTotal&lt;/code&gt;: an integer, the score of idol A&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;bTotal&lt;/code&gt;: an integer, the score of idol B&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Return values:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;None.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;learn()&lt;/code&gt;: Your bot can learn one type of skill at the cost of the improvisation of that attribute.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Arguments:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;None.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Return values:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;null&lt;/code&gt;, or an object of the following entries, the decision:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;attribute&lt;/code&gt;: one of &lt;code&gt;&quot;E&quot;&lt;/code&gt;, &lt;code&gt;&quot;S&quot;&lt;/code&gt;, &lt;code&gt;&quot;D&quot;&lt;/code&gt; or &lt;code&gt;&quot;P&quot;&lt;/code&gt;, the skill you want to learn&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;unit&lt;/code&gt;: a positive number, the amount you want to learn. You cannot learn more than your improvisation of that attribute allows.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;convert()&lt;/code&gt;: Your bot can strengthen one type of ability at the cost of the improvisation of that attribute.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Arguments:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;None.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Return values:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;null&lt;/code&gt;, or an object of the following entries, the decision:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;attribute&lt;/code&gt;: one of &lt;code&gt;&quot;E&quot;&lt;/code&gt;, &lt;code&gt;&quot;S&quot;&lt;/code&gt;, &lt;code&gt;&quot;D&quot;&lt;/code&gt; or &lt;code&gt;&quot;P&quot;&lt;/code&gt;, the ability you want to strengthen&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;unit&lt;/code&gt;: a positive number, the amount you want to strengthen. You cannot strengthen more than your improvisation of that attribute allows.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;disclose(rival)&lt;/code&gt;: Disclose your attribute during battle.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Arguments:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;rival&lt;/code&gt;: an integer, rival's ID&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Return values:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;one of &lt;code&gt;&quot;E&quot;&lt;/code&gt;, &lt;code&gt;&quot;S&quot;&lt;/code&gt;, &lt;code&gt;&quot;D&quot;&lt;/code&gt; or &lt;code&gt;&quot;P&quot;&lt;/code&gt;, the attribute you want to disclose&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;forbid(rival, attribute, value)&lt;/code&gt;: Bans an attribute during battle.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Arguments:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;rival&lt;/code&gt;: an integer, rival's ID&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;attribute&lt;/code&gt;: one of &lt;code&gt;&quot;E&quot;&lt;/code&gt;, &lt;code&gt;&quot;S&quot;&lt;/code&gt;, &lt;code&gt;&quot;D&quot;&lt;/code&gt; or &lt;code&gt;&quot;P&quot;&lt;/code&gt;, the attribute rival discloses&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;value&lt;/code&gt;: an integer, the ability of that attribute rival discloses&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Return values:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;one of &lt;code&gt;&quot;E&quot;&lt;/code&gt;, &lt;code&gt;&quot;S&quot;&lt;/code&gt;, &lt;code&gt;&quot;D&quot;&lt;/code&gt; or &lt;code&gt;&quot;P&quot;&lt;/code&gt;, the attribute you want to ban&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;choose(attribute, value, forbidden)&lt;/code&gt;: Chooses an attribute during battle.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Arguments:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;attribute&lt;/code&gt;: one of &lt;code&gt;&quot;E&quot;&lt;/code&gt;, &lt;code&gt;&quot;S&quot;&lt;/code&gt;, &lt;code&gt;&quot;D&quot;&lt;/code&gt; or &lt;code&gt;&quot;P&quot;&lt;/code&gt;, the attribute rival discloses&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;value&lt;/code&gt;: an integer, the ability of that attribute rival discloses&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;forbidden&lt;/code&gt;: one of &lt;code&gt;&quot;E&quot;&lt;/code&gt;, &lt;code&gt;&quot;S&quot;&lt;/code&gt;, &lt;code&gt;&quot;D&quot;&lt;/code&gt; or &lt;code&gt;&quot;P&quot;&lt;/code&gt;, the attribute rival bans&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Return values:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;one of &lt;code&gt;&quot;E&quot;&lt;/code&gt;, &lt;code&gt;&quot;S&quot;&lt;/code&gt;, &lt;code&gt;&quot;D&quot;&lt;/code&gt; or &lt;code&gt;&quot;P&quot;&lt;/code&gt;, the round you want to choose&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;skill(attribute)&lt;/code&gt;: Decides whether to use skill.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Arguments:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;attribute&lt;/code&gt;: one of &lt;code&gt;&quot;E&quot;&lt;/code&gt;, &lt;code&gt;&quot;S&quot;&lt;/code&gt;, &lt;code&gt;&quot;D&quot;&lt;/code&gt; or &lt;code&gt;&quot;P&quot;&lt;/code&gt;, the attribute of the round&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Return values:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;true&lt;/code&gt; or &lt;code&gt;false&lt;/code&gt;, the decision whether to use skill of the attribute of the round.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/X0czb.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/X0czb.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is a template to use:&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;function YourIdolBot(id) {&#xA;    // Your local storage&#xA;   &amp;#32;&#xA;    return {&#xA;        id, // Don't change this line&#xA;        name: &quot;&quot;, // Your bot's name&#xA;        allot(type, amount) {&#xA;            // Your logic&#xA;           &amp;#32;&#xA;            // Your return value&#xA;            return {&#xA;                E: 0,&#xA;                S: 0,&#xA;                D: 0,&#xA;                P: 0&#xA;            };&#xA;        },&#xA;        review(ranking, battles) {&#xA;            // Your logic&#xA;           &amp;#32;&#xA;        },&#xA;        learn() {&#xA;            // Your logic&#xA;           &amp;#32;&#xA;            // Your return value&#xA;            return {&#xA;                attribute: &quot;&quot;,&#xA;                unit: 0&#xA;            };&#xA;        },&#xA;        convert() {&#xA;            // Your logic&#xA;           &amp;#32;&#xA;            // Your return value&#xA;            return {&#xA;                attribute: &quot;&quot;,&#xA;                unit: 0&#xA;            };&#xA;        },&#xA;        disclose(rival) {&#xA;            // Your logic&#xA;           &amp;#32;&#xA;            // Your return value&#xA;            return &quot;&quot;;&#xA;        },&#xA;        forbid(rival, attribute, value) {&#xA;            // Your logic&#xA;           &amp;#32;&#xA;            // Your return value&#xA;            return &quot;&quot;;&#xA;        },&#xA;        choose(attribute, value, forbidden) {&#xA;            // Your logic&#xA;           &amp;#32;&#xA;            // Your return value&#xA;            return &quot;&quot;;&#xA;        },&#xA;        skill(attribute) {&#xA;            // Your logic&#xA;           &amp;#32;&#xA;            // Your return value&#xA;            return false;&#xA;        }&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your submissions must not:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Corrupt the simulation;&lt;/li&gt;&#xA;&lt;li&gt;Return values beyond requirements;&lt;/li&gt;&#xA;&lt;li&gt;Call &lt;code&gt;IdolizeMeAPI.query()&lt;/code&gt; with other bot's ID (see below);&lt;/li&gt;&#xA;&lt;li&gt;Affect other bots' code;&lt;/li&gt;&#xA;&lt;li&gt;Fetch external sources;&lt;/li&gt;&#xA;&lt;li&gt;Define and use new global variables;&lt;/li&gt;&#xA;&lt;li&gt;Has expletive inside the code (Beware of idols' image)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Violations will render the bot invalid and thus be disqualified and excluded from the simulation.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;API&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Idolize Me! provides an API that lets your idol bot query the current stats of its own. By calling &lt;code&gt;IdolizeMeAPI.query(id)&lt;/code&gt; with your bot's ID. &lt;strong&gt;YOU MUST NOT CALL &lt;code&gt;IdolizeMeAPI.query()&lt;/code&gt; WITH OTHER BOT'S ID. THIS WILL LEAD TO DISQUALIFICATION.&lt;/strong&gt; This method returns an object with the following entries, which is the details of your bot:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;id&lt;/code&gt;: an integer, your bot's id&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;name&lt;/code&gt;: a string, your bot's name&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ability&lt;/code&gt;: an object with 4 numbers named &lt;code&gt;E&lt;/code&gt;, &lt;code&gt;S&lt;/code&gt;, &lt;code&gt;D&lt;/code&gt; and &lt;code&gt;P&lt;/code&gt;, your bot's ability of each attribute&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;improvisation&lt;/code&gt;: an object with 4 numbers named &lt;code&gt;E&lt;/code&gt;, &lt;code&gt;S&lt;/code&gt;, &lt;code&gt;D&lt;/code&gt; and &lt;code&gt;P&lt;/code&gt;, your bot's improvisation of each attribute&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;skill&lt;/code&gt;: an object with 4 numbers named &lt;code&gt;E&lt;/code&gt;, &lt;code&gt;S&lt;/code&gt;, &lt;code&gt;D&lt;/code&gt; and &lt;code&gt;P&lt;/code&gt;, your bot's skill of each attribute&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;fame&lt;/code&gt;: a number, your bot's fame&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Area&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here is a snippet that allows test on the bots:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;true&quot; data-babel=&quot;true&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;function log(msg) {&#xA;  $(&quot;#log&quot;).html($(&quot;#log&quot;).html() + msg + &quot;\n\n&quot;);&#xA;}&#xA;&#xA;function cls() {&#xA;  $(&quot;#log&quot;).html(&quot;&quot;);&#xA;}&#xA;&#xA;function startIdolizeMeAPI(bots, seed, loopRounds, logBattles) {&#xA;	const ALLOT_LIMIT = {&#xA;		ability: Infinity,&#xA;		improvisation: 50,&#xA;		skill: 50&#xA;	};&#xA;	const MULTIPLIER = {&#xA;		E: {E: 1.5, S: 0.8, D: 0.5, P: 1.2},&#xA;		S: {E: 0.8, S: 1.5, D: 1.2, P: 0.5},&#xA;		D: {E: 0.5, S: 1.2, D: 1.5, P: 0.8},&#xA;		P: {E: 1.2, S: 0.5, D: 0.8, P: 1.5}&#xA;	};&#xA;&#xA;	function checkAllot(idol, type, amount, add) {&#xA;		var values = idol.idol.allot(type, amount);&#xA;		var total = 0;&#xA;		for (var i of &quot;ESDP&quot;)&#xA;			total += values[i];&#xA;		if (Math.abs(total - amount) &amp;lt; 1e-10) {&#xA;			if (add) {&#xA;				for (var i of &quot;ESDP&quot;) {&#xA;					idol[type][i] += values[i];&#xA;					if (idol[type][i] &amp;gt; ALLOT_LIMIT[type])&#xA;						idol[type][i] = ALLOT_LIMIT[type];&#xA;				}&#xA;			}&#xA;			else {&#xA;				for (var i of &quot;ESDP&quot;) {&#xA;					if (values[i] &amp;gt; ALLOT_LIMIT[type])&#xA;						values[i] = ALLOT_LIMIT[type];&#xA;				}&#xA;				return values;&#xA;			}&#xA;		}&#xA;		else if (!add)&#xA;			return {E: 0, S: 0, D: 0, P: 0};&#xA;	}&#xA;	var Random = (function(randomSeed) {&#xA;		function next() {&#xA;			return Math.random();&#xA;		}&#xA;		function nextInt(n) {&#xA;			return next() * n |0;&#xA;		}&#xA;		return {&#xA;			next,&#xA;			nextInt,&#xA;			pick: a =&amp;gt; a[nextInt(a.length)],&#xA;			shuffle: function(a) {&#xA;				for (var l = a.length; l &amp;gt; 1;) {&#xA;					var o = nextInt(l--);&#xA;					[a[l], a[o]] = [a[o], a[l]];&#xA;				}&#xA;				return a;&#xA;			}&#xA;		};&#xA;	})(seed);&#xA;&#xA;	var idols = bots.map(x =&amp;gt; ({&#xA;		id: x.id,&#xA;		name: x.name,&#xA;		idol: x,&#xA;		ability: checkAllot({idol: x}, &quot;ability&quot;, 10000, false),&#xA;		improvisation: {E: 20, S: 20, D: 20, P: 20},&#xA;		skill: {E: 10, S: 10, D: 10, P: 10},&#xA;		fame: 2500&#xA;	}));&#xA;	var numIdols = bots.length;&#xA;&#xA;	function calcTotal(attr, idol, skill) {&#xA;		var total = 0;&#xA;		for (var i of &quot;ESDP&quot;)&#xA;			total += idol.ability[i] * MULTIPLIER[attr][i] * (70 + Math.pow(Random.next(), 0.8) * (30 + idol.improvisation[i]) + skill * idol.skill[i]) / 100 |0;&#xA;		return total;&#xA;	}&#xA;&#xA;	function battle(a, b) {&#xA;		var aDis = a.idol.disclose(b.id), bDis = b.idol.disclose(a.id), aSkill = false, bSkill = false, aWin = 0, bWin = 0, aAllot = 0, bAllot = 0;&#xA;		var aForbid = a.idol.forbid(b.id, bDis, b.ability[bDis]), bForbid = b.idol.forbid(a.id, aDis, a.ability[aDis]);&#xA;		&#xA;		var rounds = [Random.pick(&quot;ESDP&quot;), a.idol.choose(bDis, b.ability[bDis], bForbid), b.idol.choose(aDis, a.ability[aDis], aForbid)].filter(x =&amp;gt; x != aForbid &amp;amp;&amp;amp; x != bForbid);&#xA;		while (rounds.length &amp;lt; 3) {&#xA;			var round = Random.pick(&quot;ESDP&quot;);&#xA;			if (round != aForbid &amp;amp;&amp;amp; round != bForbid)&#xA;				rounds.push(round);&#xA;		}&#xA;		Random.shuffle(rounds);&#xA;		var result = rounds.map(function (x) {&#xA;			var aUseSkill = a.idol.skill(x), bUseSkill = b.idol.skill(x);&#xA;			var aTotal = calcTotal(x, a, !aSkill &amp;amp;&amp;amp; aUseSkill), bTotal = calcTotal(x, b, !bSkill &amp;amp;&amp;amp; bUseSkill);&#xA;			aSkill |= aUseSkill;&#xA;			bSkill |= bUseSkill;&#xA;			if (aTotal &amp;gt; bTotal) {&#xA;				aWin++;&#xA;				bAllot += 20 * aTotal / bTotal |0;&#xA;			}&#xA;			else if (bTotal &amp;gt; aTotal) {&#xA;				bWin++;&#xA;				aAllot += 20 * bTotal / aTotal |0;&#xA;			}&#xA;			else {&#xA;				aAllot += 30;&#xA;				bAllot += 30;&#xA;			}&#xA;			return {&#xA;				attribute: x, &#xA;				aTotal, &#xA;				bTotal&#xA;			};&#xA;		});&#xA;		if (aWin &amp;gt; bWin) {&#xA;			aAllot += 10;&#xA;			var deltaFame = 10 * Math.abs(aWin - bWin) * b.fame / a.fame |0;&#xA;			a.fame += deltaFame;&#xA;			b.fame -= deltaFame;&#xA;		}&#xA;		else if (bWin &amp;gt; aWin) {&#xA;			bAllot += 10;&#xA;			var deltaFame = 10 * Math.abs(aWin - bWin) * a.fame / b.fame |0;&#xA;			a.fame -= deltaFame;&#xA;			b.fame += deltaFame;&#xA;		}&#xA;&#xA;		if (aAllot &amp;gt; 0) {&#xA;			checkAllot(b, &quot;ability&quot;, aAllot, true);&#xA;			if (aAllot &amp;gt;= 10)&#xA;				checkAllot(b, &quot;improvisation&quot;, aAllot / 10 |0, true);&#xA;		}&#xA;		if (bAllot &amp;gt; 0) {&#xA;			checkAllot(b, &quot;ability&quot;, bAllot, true);&#xA;			if (bAllot &amp;gt;= 10)&#xA;				checkAllot(b, &quot;improvisation&quot;, bAllot / 10 |0, true);&#xA;		}&#xA;		var aPtTotal = 0, bPtTotal = 0;&#xA;		for (var i of result) {&#xA;			aPtTotal += i.aTotal;&#xA;			bPtTotal += i.bTotal;&#xA;		}&#xA;&#xA;		return {&#xA;			aID: a.id,&#xA;			bID: b.id,&#xA;			result, &#xA;			aWin, &#xA;			bWin,&#xA;			aPtTotal, &#xA;			bPtTotal&#xA;		};&#xA;	}&#xA;&#xA;	var totalBattleResult = {};&#xA;	idols.map(x =&amp;gt; totalBattleResult[x.id] = {&#xA;		W: 0,&#xA;		D: 0,&#xA;		L: 0,&#xA;		BF: 0,&#xA;		BA: 0,&#xA;		BD: 0,&#xA;		PF: 0,&#xA;		PA: 0,&#xA;		PD: 0,&#xA;		pts: 0,&#xA;		rankings: []&#xA;	});&#xA;&#xA;	function swissBattle() {&#xA;		var idolRanking = idols.map(x =&amp;gt; ({&#xA;			idol: x,&#xA;			W: 0,&#xA;			D: 0,&#xA;			L: 0,&#xA;			BF: 0,&#xA;			BA: 0,&#xA;			BD: 0,&#xA;			PF: 0,&#xA;			PA: 0,&#xA;			PD: 0,&#xA;			pts: 0&#xA;		}));&#xA;		function sortRanking() {&#xA;			for (var idol of idolRanking)&#xA;				idol.lots = Random.next();&#xA;			idolRanking.sort((a, b) =&amp;gt; b.pts - a.pts || b.W - a.W || b.BD - a.BD || b.BF - a.BF || b.PD - a.PD || b.PF - a.PF || b.lots - a.lots);&#xA;		}&#xA;		sortRanking();&#xA;&#xA;		for (var i = numIdols; i &amp;gt; 0; i &amp;gt;&amp;gt;= 1) {&#xA;			var battles = [];&#xA;			for (var j = 0; j &amp;lt; numIdols - 1; j += 2) {&#xA;				var a = idolRanking[j], b = idolRanking[j + 1]&#xA;				var result = battle(a.idol, b.idol);&#xA;				battles.push(result);&#xA;				if (result.aWin &amp;gt; result.bWin) {&#xA;					a.W++;&#xA;					b.L++;&#xA;				}&#xA;				else if (result.bWin &amp;gt; result.aWin) {&#xA;					a.L++;&#xA;					b.W++;&#xA;				}&#xA;				else {&#xA;					a.D++;&#xA;					b.D++;&#xA;				}&#xA;				a.pts = a.W * 2 + a.D;&#xA;				b.pts = b.W * 2 + b.D;&#xA;				a.BF += result.aWin;&#xA;				a.BA += result.bWin;&#xA;				b.BF += result.bWin;&#xA;				b.BA += result.aWin;&#xA;				a.PF += result.aPtTotal;&#xA;				a.PA += result.bPtTotal;&#xA;				b.PF += result.bPtTotal;&#xA;				b.PA += result.aPtTotal;&#xA;				a.BD = a.BF - a.BA;&#xA;				b.BD = b.BF - b.BA;&#xA;				a.PD = a.PF - a.PA;&#xA;				b.PD = b.PF - b.PA;&#xA;			}&#xA;			if (numIdols % 2 == 1) {&#xA;				idolRanking[numIdols - 1].W++;&#xA;				idolRanking[numIdols - 1].pts += 2;&#xA;				battles.push({&#xA;					aID: idolRanking[numIdols - 1].idol.id, &#xA;					bID: -1, &#xA;					result: [], &#xA;					aWin: 0, &#xA;					bWin: 0&#xA;				});&#xA;			}&#xA;			sortRanking();&#xA;			var publicRanking = idolRanking.map(function(x) {&#xA;				var l = {};&#xA;				for (var i in x) {&#xA;					if (i == &quot;idol&quot;)&#xA;						l.id = x.idol.id;&#xA;					else if (i != &quot;lots&quot;)&#xA;						l[i] = x[i];&#xA;				}&#xA;				return l;&#xA;			});&#xA;			for (var idol of idols)&#xA;				idol.idol.review(publicRanking, battles);&#xA;			if (logBattles) {&#xA;        log(&quot;Battle Results:\n&quot; + JSON.stringify(battles, null, 2));&#xA;        log(&quot;Ranking:\n&quot; + JSON.stringify(publicRanking, null, 2));&#xA;      }&#xA;		}&#xA;		var averageFame = idols.reduce((a, b) =&amp;gt; a + b.fame, 0) / numIdols;&#xA;		for (var i = 0; i &amp;lt; numIdols; i++)&#xA;			idolRanking[i].idol.fame += (Math.pow((numIdols - i) / numIdols, 1.5) * 80 + 20) * averageFame / idolRanking[i].idol.fame |0; &#xA;&#xA;		var r = 0;&#xA;		for (var p of idolRanking) {&#xA;			for (var q in p) {&#xA;				if (q != &quot;idol&quot; &amp;amp;&amp;amp; q != &quot;lots&quot;)&#xA;					totalBattleResult[p.idol.id][q] += p[q];&#xA;			}&#xA;			totalBattleResult[p.idol.id].rankings.push(++r);&#xA;		}&#xA;	}&#xA;&#xA;	function showResult(round) {&#xA;		var temp = [...idols].sort((a, b) =&amp;gt; b.fame - a.fame);&#xA;		var a =        &quot; ID                 | Name                        | Fame  | Win  | Lose | Draw | BF   | BA   | BD   | Pts For   | Pts Aga.  | Pts Diff. | TP   | Tournament Rankings                                                                                         \n&quot;&#xA;		      +        &quot;--------------------+-----------------------------+-------+------+------+------+------+------+------+-----------+-----------+-----------+------+-&quot; + &quot;-&quot;.repeat(Math.max(20, loopRounds * 3));&#xA;		for (var i of temp) {&#xA;			a += `\n ${(&quot;&quot; + i.id).padStart(18)} | ${i.name.padEnd(27) } | ` + (&quot;&quot; + i.fame).padStart(5);&#xA;			for (var j of [&quot;W&quot;, &quot;L&quot;, &quot;D&quot;, &quot;BF&quot;, &quot;BA&quot;, &quot;BD&quot;, &quot;PF&quot;, &quot;PA&quot;, &quot;PD&quot;, &quot;pts&quot;])&#xA;				a += &quot; | &quot; + (&quot;&quot; + totalBattleResult[i.id][j]).padStart(j[0] == &quot;P&quot; ? 9 : 4);&#xA;			a += &quot; | &quot; + totalBattleResult[i.id].rankings.map(x =&amp;gt; (&quot;&quot; + x).padStart(2)).join` `;&#xA;		}&#xA;		log(&quot;Round &quot; + round + &quot; results:\n&quot; + a);&#xA;    return a;&#xA;	}&#xA;&#xA;	function loop() {&#xA;		for (var i = 0; i &amp;lt; loopRounds; i++) {&#xA;			for (var j = 0; j &amp;lt; 4; j++) {&#xA;				for (var k of idols) {&#xA;					checkAllot(k, &quot;ability&quot;, 100, true);&#xA;					checkAllot(k, &quot;improvisation&quot;, 5, true);&#xA;					var convertPlan = k.idol.convert();&#xA;					if (convertPlan) {&#xA;						var {attribute, unit} = convertPlan;&#xA;						var converted = Math.min(unit, k.improvisation[attribute] * 5);&#xA;						k.improvisation[attribute] -= converted / 5;&#xA;						k.ability[attribute] += converted;&#xA;					}&#xA;					var learnPlan = k.idol.learn();&#xA;					if (learnPlan) {&#xA;						var {attribute, unit} = learnPlan;&#xA;						var learnt = Math.min(unit, k.improvisation[attribute] / 5);&#xA;						k.improvisation[attribute] -= learnt * 5;&#xA;						k.skill[attribute] += learnt;&#xA;						if (k.skill[attribute] &amp;gt; ALLOT_LIMIT.skill)&#xA;							k.skill[attribute] = ALLOT_LIMIT.skill;&#xA;					}&#xA;				}&#xA;			}&#xA;			swissBattle();&#xA;			showResult(i + 1);&#xA;		}&#xA;	}&#xA;&#xA;	return {&#xA;		loop,&#xA;		query(id) {&#xA;			var idol = idols.filter(x =&amp;gt; x.id == id)[0];&#xA;			if (idol) {&#xA;				var publicIdol = {};&#xA;				for (var i in idol) {&#xA;					if (i != &quot;idol&quot;)&#xA;						publicIdol[i] = idol[i];&#xA;				}&#xA;				return publicIdol;&#xA;			}&#xA;			else &#xA;				return null;&#xA;		},&#xA;		showResult&#xA;	};&#xA;}&#xA;&#xA;var players = 0;&#xA;function addPlayer() {&#xA;  var id = Math.random() * Math.pow(2, 53);&#xA;  $(&quot;#players&quot;).append(`&#xA;    &amp;lt;div class=&quot;bot&quot; id=&quot;bot-${id}&quot;&amp;gt;&#xA;      &amp;lt;textarea cols=&quot;100&quot; rows=&quot;10&quot;&amp;gt;&amp;lt;/textarea&amp;gt; ${++players &amp;gt; 2 ? `&amp;lt;input type=&quot;button&quot; value=&quot;Delete this bot&quot; onclick=&quot;deletePlayer(${id})&quot;&amp;gt;` : &quot;&quot;}&#xA;    &amp;lt;/div&amp;gt;&#xA;  `);&#xA;}&#xA;&#xA;function deletePlayer(id) {&#xA;  $(&quot;#bot-&quot; + id).remove();&#xA;  players--;&#xA;}&#xA;/*&#xA;$(&quot;#run&quot;).on(&quot;click&quot;, function(e) {&#xA;  e.preventDefault();&#xA;  e.stopPropagation();&#xA;  e.target.checkValidity();&#xA;  console.log(&quot;test&quot;);&#xA;});*/&#xA;var IdolizeMeAPI;&#xA;$(document).on(&quot;submit&quot;, &quot;form&quot;, function(e) {&#xA;  e.preventDefault();&#xA;  cls();&#xA;  var bots = [], submissions = {};&#xA;  $(&quot;.bot&quot;).each(function(s) {&#xA;    var code = $(this).find(&quot;textarea&quot;).val();&#xA;    var botFunctionName = /function (\w+) *\(id\) *{/.exec(code);&#xA;    if (botFunctionName) {&#xA;      botFunctionName = botFunctionName[1];&#xA;      code = code.replace(/function (\w+) *\(id\) *{/, `submissions[&quot;$1&quot;] = function(id) {`);&#xA;      eval(code);&#xA;      bots.push(new submissions[botFunctionName](+$(this).attr(&quot;id&quot;).slice(4)));&#xA;    }&#xA;  });&#xA;  IdolizeMeAPI = startIdolizeMeAPI(bots, &quot;whatever it is we don't use seeds at all&quot;, +$(&quot;#rounds&quot;).val(), $(&quot;#logbattle&quot;).prop(&quot;checked&quot;));&#xA;  IdolizeMeAPI.loop();&#xA;  return false;&#xA;});&#xA;&#xA;addPlayer();&#xA;addPlayer();&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xA;&amp;lt;form&amp;gt;&#xA;  Rounds: &amp;lt;input id=&quot;rounds&quot; pattern=&quot;\d+&quot; value=&quot;6&quot; required/&amp;gt;&amp;lt;br&amp;gt;&#xA;  Log battle results: &amp;lt;input type=&quot;checkbox&quot; id=&quot;logbattle&quot;&amp;gt;&amp;lt;br&amp;gt;&#xA;  Player Bots:&#xA;  &amp;lt;div id=&quot;players&quot;&amp;gt;&#xA;  &amp;lt;/div&amp;gt;&#xA;  &amp;lt;input type=&quot;button&quot; value=&quot;Add a bot&quot; onclick=&quot;addPlayer()&quot;&amp;gt;&amp;lt;br&amp;gt;&#xA;  &amp;lt;input id=&quot;run&quot; type=&quot;submit&quot; value=&quot;Run simulation&quot;&amp;gt;&#xA;&amp;lt;/form&amp;gt;&#xA;&amp;lt;pre id=&quot;log&quot;&amp;gt;&#xA;&amp;lt;/pre&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may want to open the snippet in a new page.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Demo Bots&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;2 simple demo bots will be in the same contest with submitted bots, of exactly the same implementation, but with different names: One called &lt;em&gt;Yamada Ransu&lt;/em&gt; (山田 乱數) and one called &lt;em&gt;Sato Midare&lt;/em&gt; (佐藤 乱).&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;function TheTwoSimpleDemoBotsYouAreCompetingWith(id) {&#xA;    return {&#xA;        id: id,&#xA;        name: &quot;???&quot;,&#xA;        allot(type, amount) {        &#xA;            return {&#xA;                E: amount/4,&#xA;                S: amount/4,&#xA;                D: amount/4,&#xA;                P: amount/4&#xA;            };&#xA;        },&#xA;        review(ranking, battles) {},&#xA;        learn() {&#xA;            return {&#xA;                attribute: &quot;ESDP&quot;[Math.random() * 4 |0],&#xA;                unit: Math.random() * 5 |0&#xA;            };&#xA;        },&#xA;        convert() {&#xA;            return null;&#xA;        },&#xA;        disclose(rival) {&#xA;            return &quot;ESDP&quot;[Math.random() * 4 |0];&#xA;        },&#xA;        forbid(rival, attribute, value) {&#xA;            return &quot;ESDP&quot;[Math.random() * 4 |0];&#xA;        },&#xA;        choose(attribute, value, forbidden) {&#xA;            return &quot;ESDP&quot;[Math.random() * 4 |0];&#xA;        },&#xA;        skill(attribute) {&#xA;            return Math.random() &amp;lt; 0.5;&#xA;        }&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Winning Criteria&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Submission is open for 2 weeks from the posting day, until 15:00 GMT on the end day, or until there are more than 20 submissions, whichever is later. You are welcomed to submit multiple entries during the period. After the the submission period ends, the 36 rounds will be simulated within 3 days. After the 36 rounds, the bot with the highest fame wins, and the corresponding submission will be accepted as &quot;best answer&quot;. The simulation result will be posted.&lt;/p&gt;&#xA;" OwnerUserId="71546" LastEditorUserId="71546" LastEditDate="2018-10-11T03:45:08.927" LastActivityDate="2018-10-11T03:45:08.927" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="16981" PostTypeId="1" CreationDate="2018-10-10T13:32:20.470" Score="0" ViewCount="62" Body="&lt;p&gt;MathNode is a graphical language made by myself with an interpreter currently not publicized, so I'm asking this ahead of time. In MathNode, surprise surprise! You have nodes. These nodes can be connected to each other to perform calculations. Here is a screeshot showcasing some things it can do:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/bfDeM.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/bfDeM.png&quot; alt=&quot;Some MathNode features&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So basically it can do arithmetic operations, recursion (wires can connect to themselves), and node movement which is just a side effect and doesn't do anything although it can be used to show output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It also supports input by clicking nodes, and a few other things.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So what would be the best way to score this language in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges?&lt;/p&gt;&#xA;" OwnerUserId="82488" LastEditorUserId="82488" LastEditDate="2018-10-10T15:05:21.030" LastActivityDate="2018-10-10T15:05:21.030" Title="How to score MathNode?" Tags="|discussion|scoring|" AnswerCount="1" CommentCount="2" ClosedDate="2018-10-10T15:21:40.863" ContentLicense="CC BY-SA 4.0" />
  <row Id="16982" PostTypeId="2" ParentId="2140" CreationDate="2018-10-10T14:01:41.180" Score="0" Body="&lt;p&gt;&lt;strong&gt;Roulette Bots II&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Last week I posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/173209/robot-roulette-high-stakes-robot-gambling&quot;&gt;Roulette Bots&lt;/a&gt;, which was a lot of fun. I think the basic format has potential to be even more interesting, so I've been shopping some tweaks in my head and I'd like to hear feedback before I give it another shot. In a nutshell, the first iteration of the game was as follows:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Everyone starts with 100 hp. Each round, 2 players are chosen at random from the pool of contestants who have not yet competed in that round. Both players pick a number between 0 and their current hp, and reveal those numbers at the same time. The player who chose the lower number immediately dies. The other player subtracts their chosen number from their remaining hp and goes on to the next round. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;From the bracket of contestants, 2 are chosen at random. They face off, and one or both of them dies. A player dies if:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;They choose a number smaller than that of their opponent&lt;/li&gt;&#xA;&lt;li&gt;Their hp drops to or below zero&lt;/li&gt;&#xA;&lt;li&gt;They tie three times in a row with their opponent&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;In the case of ties, both players simply generate new numbers, up to 3 times. After the faceoff, the survivor (if any) is moved to the pool for the next round, and the process repeats until we have exhausted the current round pool. If there is an odd number in the pool, then the odd one out moves on to the next round for free.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Players were given as input their own hp, and their opponent's complete betting history for that round. The idea being that players must balance resource consumption and long-term performance against the danger of dying right now if they don't bid high enough.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are two things I'd like feedback on:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The minimal set of restrictions on user submissions required to make an interesting game without limiting creativity&lt;/li&gt;&#xA;&lt;li&gt;Format tweaks that will allow for more creativity within the scope of the rules&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The rule set I ended up on for the last game was that you were not allowed to take any action that unambiguously identified your opponent. This was for the purpose of avoiding things like players simply reading the stack to figure out exactly who their opponent was, since then you can simply simulate your opponent and more or less guarantee a win. While clever, it's doesn't really fit the spirit of the game. So the first question is whether or not there is a less restrictive rule that could be applied, or if someone can see a glaring loophole in that rule which would allow for game-breaking behavior in future versions of a similar game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the subject of format tweaks, the biggest issue I found with the game was that with a relatively small pool of contestants, very little history was actually generated and so bots that tried to use history to predict opponent guesses fared poorly overall. The first tweak I had in mind was to bootstrap a very large (256 or 512, maybe) initial tournament by random resampling of existing bots so that there would be many rounds and a good history pool to work with by the end of it. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Coupled with the larger pool, I intend to change the scoring system to reward longevity, to encourage more careful resource management, as compared to the previous game which rewarded just living through the first round. Something like making participating in the nth rounds worth n points, so that a player which survives to the nth round gets n(n-1)/2 points total. This puts more stringent constraints on resource management, since you need to survive a lot of rounds to do well. I'd probably bump the starting hp up to 1000, so that there is a bit more room to refine bets. and to make ties even less likely.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Second, there were a couple of attempts to make teams of bots that communicated via betting history in order to feed easy wins to one of them. I like the idea, but but because of the limited options presented by betting history they didn't fare very well. I am considering having bots exchange a &quot;greeting&quot; before each fight - a string or integer which they send to their opponent before battling, which could be used to identify teammates or clones of yourself. Does it add enough possibilities to gameplay to be worth the extra effort? Since with a resampled population you would likely be competing with yourself fairly regularly, having a way to recognize yourself (while at the same time avoiding others being able to recognize you from your greeting) seems like it could be interesting, but I worry that it will just degenerate into people updating their greeting at the last second to avoid other people using them, which would make it pointless to use the greeting to recognize opponents and make a lot of work for me. Can anyone suggest a good way to handle this? I want a way for people to recognize an opponent as probably (but not certainly) friendly without making it a game of &quot;who updates last&quot;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Feedback on the proposed gameplay tweaks, or ideas for others that I have not considered, would be appreciated!&lt;/p&gt;&#xA;" OwnerUserId="83224" LastActivityDate="2018-10-10T14:01:41.180" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="16983" PostTypeId="2" ParentId="16981" CreationDate="2018-10-10T15:00:21.273" Score="4" Body="&lt;p&gt;By the number of bytes that are required to store your program on disk. That is the only thing that makes sense for challenges that are scored in &lt;em&gt;bytes&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2018-10-10T15:00:21.273" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="16987" PostTypeId="2" ParentId="2140" CreationDate="2018-10-11T17:07:11.423" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Is it a valid snooker break?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In snooker, the objective is to score as many points as possible by potting two types of balls: red balls, 15 of them, each valued 1 point, and colour balls, 6 of them, valued 2, 3, 4, 5, 6 and 7 points. A &lt;em&gt;break&lt;/em&gt; is a sequence of potted balls. The balls must be potted in a predetermined order: the break must start with potting a red ball, then a colour ball and continued with alternating in potting red and colour balls until all of the red balls are potted, then potting colour balls in ascending order of their values (if all of the red balls have already been potted, start with the colour ball with the lowest value). However, if a &lt;em&gt;free ball&lt;/em&gt; is declared after an opponent's foul, the break may start with any ball, replacing the ball that should be usually potted first (red if some red balls are still on the table, colour with the lowest value if all reds are potted).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to determine if the given sequence of balls adheres to the rules mentioned above.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A list of integers representing values of snooker balls. The list will not be empty.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A truthy value if the list is a valid snooker break and falsey if it isn't.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Truthy:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;6&#xA;1,7&#xA;2,5&#xA;2,3,4&#xA;1,5,1,5,1&#xA;1,3,1,5,1,4&#xA;6,4,5&#xA;5,2,1,4,1,6,1,6&#xA;1,6,2,3,4,5,6,7&#xA;3,2,3,4,5,6,7&#xA;4,4,1&#xA;5,6,1,7&#xA;1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,2,3,4,5,6,7 //&quot;maximum break&quot;&#xA;7,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,2,3,4,5,6,7&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Falsey:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1,1&#xA;4,4,4&#xA;4,2,3,1&#xA;1,2,3&#xA;5,1,7,1&#xA;2,5,6,7 //2 is already off the table&#xA;5,4,2,3&#xA;1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,2,3,4,5,6,7     //one red too many&#xA;7,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,1,7,2,3,4,5,6,7 //as well as here&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;To sandbox:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I am thinking about including lists with values out of range of snooker balls' values (less than 1 or greater than 7) in which cases the result should be falsey. As this is a decision problem, I think that these cases should be covered as well.&lt;/p&gt;&#xA;" OwnerUserId="60517" LastActivityDate="2018-10-11T17:07:11.423" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="16988" PostTypeId="2" ParentId="2140" CreationDate="2018-10-13T11:23:02.223" Score="0" Body="&lt;h1&gt;Cologne Phonetics&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Cologne_phonetics&quot; rel=&quot;nofollow noreferrer&quot;&gt;From Wikipedia&lt;/a&gt;:&#xA;Cologne phonetics is a phonetic algorithm which assigns to words a sequence of digits, the phonetic code. The aim of this procedure is that identical sounding words have the same code assigned to them. The algorithm can be used to perform a similarity search between words. For example, it is possible in a name [collection?] to find entries like &amp;quot;Meier&amp;quot; under different spellings such as &amp;quot;Maier&amp;quot;, &amp;quot;Mayer&amp;quot; or &amp;quot;Mayr&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;The Cologne phonetics matches each letter of a word to a digit between 0 and 8. To select the appropriate digit, at most one adjacent letter is used as context.&lt;/p&gt;&#xA;&lt;h3&gt;Procedure:&lt;/h3&gt;&#xA;&lt;p&gt;Processing of a word is done in three steps:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Encode letter by letter from left to right according to the conversion rules below.&lt;/li&gt;&#xA;&lt;li&gt;Remove all digits occurring more than once next to each other.&lt;/li&gt;&#xA;&lt;li&gt;Remove all code &amp;quot;0&amp;quot; except at the beginning&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Conversion rules&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;A, E, I, J, O, U, Y&lt;/strong&gt; become 0&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;H&lt;/strong&gt; becomes nothing&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;B&lt;/strong&gt; becomes 1&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;P&lt;/strong&gt; becomes 1, unless it's before H&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;D, T&lt;/strong&gt; become 2, unless they're before C, S, Z&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;F, V, W&lt;/strong&gt; become 3&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;P&lt;/strong&gt; becomes 3, if it's before H&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;G, K, Q&lt;/strong&gt; become 4&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;C&lt;/strong&gt; becomes 4 in initial position before A, H, K, L, O, Q, R, U, X&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;C&lt;/strong&gt; becomes 4, if it's before A, H, K, O, Q, U, X, except after S, Z&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;X&lt;/strong&gt; becomes 48, unless it's after C, K, Q&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;L&lt;/strong&gt; becomes 5&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;M, N&lt;/strong&gt; become 6&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;R&lt;/strong&gt; becomes 7&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;S, Z&lt;/strong&gt; become 8&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;C&lt;/strong&gt; becomes 8, if it's after S, Z&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;C&lt;/strong&gt; becomes 8 in initial position except before A, H, K, L, O, Q, R, U, X&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;C&lt;/strong&gt; becomes 8, if it's not before A, H, K, O, Q, U, X&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;D, T&lt;/strong&gt; become 8, if they're before C, S, Z&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;X&lt;/strong&gt; becomes 8, if it's after C, K, Q&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Implement a program or a function that takes a single string as input and returns the phonetic code according to the rules stated above. You may choose your own output format, but keep in mind that the expected output may have leading zeros. The input string is guaranteed to match &lt;code&gt;/^[a-zA-Z ]*$/&lt;/code&gt;, this means it may contain characters from the lowercase and uppercase alphabet, as well as spaces.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input                 Output&#xA;&#xA;[empty string]        [empty]&#xA;Kolner Phonetik       45673624&#xA;Meier                 67&#xA;Mayer                 67&#xA;Augsburg              048174&#xA;Xanten                48626&#xA;Telephon              2356&#xA;Chemie                46&#xA;Muller Ludenscheid    65752682&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the shortest code for each language wins.&lt;/p&gt;&#xA;" OwnerUserId="77034" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-10-15T07:11:02.827" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16989" PostTypeId="1" CreationDate="2018-10-14T02:11:57.517" Score="5" ViewCount="198" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/173981/which-esoteric-language-is-this-one&quot;&gt;Today we had a question&lt;/a&gt; that ask users to identify the language used.  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/48630/what-language-is-this&quot;&gt;We've had one in the past&lt;/a&gt; as well.  We've never discussed these kinds of questions as far as I can tell, so let me:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do we want to allow &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-identification&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-identification&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-identification&lt;/a&gt; questions?  If so, what requirements should we place on these questions?&lt;/p&gt;&#xA;" OwnerUserId="20198" LastActivityDate="2018-10-14T03:00:53.413" Title="Do we want to allow [tag:language-identification] questions?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="16990" PostTypeId="2" ParentId="16989" CreationDate="2018-10-14T03:00:53.413" Score="12" Body="&lt;p&gt;I don't think simple &lt;em&gt;Identify this programming language!&lt;/em&gt; questions should be considered on topic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Our topic is programming contests and challenges. While we decided on multiple occasions to allow certain non-challenge questions that are related to participating in competitions or even creating them, I don't think this kind of question fits in the same niche&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even if the community can figure out in which language some blurb of characters does something sensible, it will rarely help to identify a different blurb of characters. So, although these questions are related to certain kinds of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; challenges, they cannot teach how to participate in them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In many aspects, these questions are similar &lt;em&gt;Decrypt this ciphertext!&lt;/em&gt; questions that are common on crypto sites. &lt;a href=&quot;https://crypto.meta.stackexchange.com/a/101/968&quot;&gt;Crypto SE decided to disallow them.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://anime.meta.stackexchange.com/questions/2805/&quot;&gt;Anime&lt;/a&gt;, &lt;a href=&quot;https://movies.meta.stackexchange.com/questions/2250/&quot;&gt;Movies 1&lt;/a&gt;, &lt;a href=&quot;https://movies.meta.stackexchange.com/questions/4054/&quot;&gt;Movies 2&lt;/a&gt;, &lt;a href=&quot;https://movies.meta.stackexchange.com/questions/4087/&quot;&gt;Movies 3&lt;/a&gt;.  I couldn't find one for SciFi, but they seem pretty happy with allowing them. &lt;a href=&quot;https://gaming.meta.stackexchange.com/questions/4168/&quot;&gt;Gaming 1&lt;/a&gt;, &lt;a href=&quot;https://gaming.meta.stackexchange.com/questions/10197&quot;&gt;Gaming 2&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Questions asking to identify a movies, games, etc. tend to include a text description of what the OP is searching for. People who remember similar aspects of the movie/game/whatever will be able to find the question with a search engine. Trying to google esoteric source code will usually be pointless. &lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2018-10-14T03:00:53.413" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16991" PostTypeId="2" ParentId="2140" CreationDate="2018-10-14T03:26:33.383" Score="0" Body="&lt;h1&gt;Implement JavaScript's Abstract Equality Comparison Algorithm.&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;As many know, JavaScript has quite confusing equality rules and it's generally recommended to use &lt;code&gt;===&lt;/code&gt; instead to avoid the weird corner cases that come with using &lt;code&gt;==&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The logic behind the &lt;code&gt;==&lt;/code&gt; operator is documented as &amp;quot;The Abstract Equality Comparison Algorithm&amp;quot; in the ECMAScript specification. For this particular question we will be implementing from the &lt;a href=&quot;https://www.ecma-international.org/ecma-262/5.1/&quot; rel=&quot;nofollow noreferrer&quot;&gt;ECMAScript 5.1 edition specification&lt;/a&gt;. The algorithm is documented in &lt;a href=&quot;https://www.ecma-international.org/ecma-262/5.1/#sec-11.9.3&quot; rel=&quot;nofollow noreferrer&quot;&gt;section 11.9.3&lt;/a&gt; of this specification.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Implement the abstract equality comparison algorithm in JavaScript without using &lt;code&gt;==&lt;/code&gt; or &lt;code&gt;!=&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Input &amp;amp; output&lt;/h2&gt;&#xA;&lt;p&gt;The input is two variables. These variables can be anything that is not a &lt;a href=&quot;https://www.ecma-international.org/ecma-262/5.1/#sec-8.7&quot; rel=&quot;nofollow noreferrer&quot;&gt;Reference type&lt;/a&gt;. The output is a truthy or falsy value that represents the result of performing the abstract equality comparison algorithm.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;p&gt;Since there are a lot of edge cases, I took these test cases from the &lt;a href=&quot;https://github.com/tc39/test262/tree/master/test/language/expressions/equals&quot; rel=&quot;nofollow noreferrer&quot;&gt;test262 repository&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Examples that return truthy values:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;true == true&#xA;false == false&#xA;true == 1&#xA;false == &amp;quot;0&amp;quot;&#xA;0 == false&#xA;&amp;quot;1&amp;quot; == true&#xA;+0 == -0&#xA;-0 == +0&#xA;Number.POSITIVE_INFINITY == Number.POSITIVE_INFINITY&#xA;Number.NEGATIVE_INFINITY == Number.NEGATIVE_INFINITY&#xA;Number.POSITIVE_INFINITY == -Number.NEGATIVE_INFINITY&#xA;1.0 == 1&#xA;&amp;quot;&amp;quot; == &amp;quot;&amp;quot;&#xA;&amp;quot; &amp;quot; == &amp;quot; &amp;quot;&#xA;&amp;quot;string&amp;quot; == &amp;quot;string&amp;quot;&#xA;1 == &amp;quot;1&amp;quot;&#xA;1.100 == &amp;quot;+1.10&amp;quot;&#xA;255 == &amp;quot;0xff&amp;quot;&#xA;0 == &amp;quot;&amp;quot;&#xA;&amp;quot;-1&amp;quot; == -1&#xA;&amp;quot;-1.100&amp;quot; == -1.10&#xA;&amp;quot;5e-324&amp;quot; == 5e-324&#xA;undefined == undefined&#xA;void 0 == undefined&#xA;undefined == eval(&amp;quot;var x&amp;quot;)&#xA;undefined == null&#xA;null == void 0&#xA;null == null&#xA;{ var x, y; x = {}; y = x; x == y; } // two variables pointing to same object&#xA;new Boolean(true) == true&#xA;new Number(1) == true&#xA;new String(&amp;quot;1&amp;quot;) == true&#xA;true == new Boolean(true)&#xA;true == new Number(1)&#xA;true == new String(&amp;quot;+1&amp;quot;)&#xA;new Boolean(true) == 1&#xA;new Number(-1) == -1&#xA;new String(&amp;quot;-1&amp;quot;) == -1&#xA;1 == new Boolean(true)&#xA;-1 == new Number(-1)&#xA;-1 == new String(&amp;quot;-1&amp;quot;)&#xA;new Boolean(true) == &amp;quot;1&amp;quot;&#xA;new Number(-1) == &amp;quot;-1&amp;quot;&#xA;new String(&amp;quot;x&amp;quot;) == &amp;quot;x&amp;quot;&#xA;&amp;quot;1&amp;quot; == new Boolean(true)&#xA;&amp;quot;-1&amp;quot; == new Number(-1)&#xA;&amp;quot;x&amp;quot; == new String(&amp;quot;x&amp;quot;)&#xA;{valueOf: function() {return 1}} == true&#xA;{valueOf: function() {return 1}, toString: function() {return 0}} == 1&#xA;{valueOf: function() {return 1}, toString: function() {return {}}} == &amp;quot;+1&amp;quot;&#xA;{valueOf: function() {return &amp;quot;+1&amp;quot;}, toString: function() {throw &amp;quot;error&amp;quot;}} == true&#xA;{toString: function() {return &amp;quot;+1&amp;quot;}} == 1&#xA;{valueOf: function() {return {}}, toString: function() {return &amp;quot;+1&amp;quot;}} == &amp;quot;+1&amp;quot;&#xA;true == {valueOf: function() {return 1}}&#xA;1 == {valueOf: function() {return 1}, toString: function() {return 0}}&#xA;&amp;quot;+1&amp;quot; == {valueOf: function() {return 1}, toString: function() {return {}}}&#xA;true == {valueOf: function() {return &amp;quot;+1&amp;quot;}, toString: function() {throw &amp;quot;error&amp;quot;}}&#xA;1 == {toString: function() {return &amp;quot;+1&amp;quot;}}&#xA;&amp;quot;+1&amp;quot; == {valueOf: function() {return {}}, toString: function() {return &amp;quot;+1&amp;quot;}}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Examples that return falsy values:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;true == false&#xA;false == true&#xA;Number.NaN == true&#xA;Number.NaN ==  1&#xA;Number.NaN == Number.NaN&#xA;Number.NaN == Number.POSITIVE_INFINITY&#xA;Number.NaN == Number.NEGATIVE_INFINITY&#xA;Number.NaN == Number.MAX_VALUE&#xA;Number.NaN == Number.MIN_VALUE&#xA;Number.NaN == &amp;quot;string&amp;quot;&#xA;Number.NaN == new Object()&#xA;true == Number.NaN&#xA;-1 == Number.NaN&#xA;Number.POSITIVE_INFINITY == Number.NaN&#xA;Number.NEGATIVE_INFINITY == Number.NaN&#xA;Number.MAX_VALUE == Number.NaN&#xA;Number.MIN_VALUE == Number.NaN&#xA;&amp;quot;string&amp;quot; == Number.NaN&#xA;new Object() == Number.NaN&#xA;1 == 0.999999999999&#xA;&amp;quot; &amp;quot; == &amp;quot;&amp;quot;&#xA;&amp;quot; string&amp;quot; == &amp;quot;string &amp;quot;&#xA;&amp;quot;1.0&amp;quot; == &amp;quot;1&amp;quot;&#xA;&amp;quot;0xff&amp;quot; == &amp;quot;255&amp;quot;&#xA;1 == &amp;quot;true&amp;quot;&#xA;&amp;quot;false&amp;quot; == 0&#xA;undefined == true&#xA;undefined == 0&#xA;undefined == &amp;quot;undefined&amp;quot;&#xA;undefined == {}&#xA;null == false&#xA;null == 0&#xA;null == &amp;quot;null&amp;quot;&#xA;null == {}&#xA;false == undefined&#xA;Number.NaN == undefined&#xA;&amp;quot;undefined&amp;quot; == undefined&#xA;{} == undefined&#xA;false == null&#xA;0 == null&#xA;&amp;quot;null&amp;quot; == null&#xA;{} == null&#xA;new Boolean(true) == new Boolean(true)&#xA;new Number(1) == new Number(1)&#xA;new String(&amp;quot;x&amp;quot;) == new String(&amp;quot;x&amp;quot;)&#xA;new Object() == new Object()&#xA;new Boolean(true) == new Number(1)&#xA;new Number(1) == new String(&amp;quot;1&amp;quot;)&#xA;new String(&amp;quot;1&amp;quot;) == new Boolean(true)&#xA;{valueOf: function() {return {}}, toString: function() {return &amp;quot;+1&amp;quot;}} == &amp;quot;1&amp;quot;&#xA;&amp;quot;1&amp;quot; == {valueOf: function() {return {}}, toString: function() {return &amp;quot;+1&amp;quot;}}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Examples that throw an error:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;{valueOf: function() {throw &amp;quot;error&amp;quot;}, toString: function() {return 1}} == 1 // throws &amp;quot;error&amp;quot;&#xA;{valueOf: function() {return {}}, toString: function() {return {}}} == 1 // throws TypeError&#xA;1 == {valueOf: function() {throw &amp;quot;error&amp;quot;}, toString: function() {return 1}} // throws &amp;quot;error&amp;quot;&#xA;1 == {valueOf: function() {return {}}, toString: function() {return {}}} // throws TypeError&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply. The shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is it ok that I am restricting the language to JavaScript? Should I allow languages that compile to JavaScript or have the types listed here?&lt;/li&gt;&#xA;&lt;li&gt;Have I got too many test cases here? Should I cut it down? Perhaps instead I could create a tio.run template which runs all the tests instead of listing them all out here.&lt;/li&gt;&#xA;&lt;li&gt;Is the requirement of not using &lt;code&gt;==&lt;/code&gt; and &lt;code&gt;!=&lt;/code&gt; strict enough? I feel that I want to avoid answers where some inbuilt function indirectly calls &lt;code&gt;==&lt;/code&gt; and getting around it that way but I don't know how to enforce that.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="48436" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-10-14T03:26:33.383" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="16993" PostTypeId="2" ParentId="2140" CreationDate="2018-10-15T18:05:07.350" Score="0" Body="&lt;h1&gt;Find the pattern v2&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I feel tired to do &quot;find the pattern&quot; exercise such as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3 4 (5)&#xA;1 2 4 8 (16)&#xA;1 2 3 5 8 (13)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Please write a program that finds the pattern for me.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here, we define the pattern as a recurrence relation that fits the given input, with the smallest score. If there are multiple answers with the same smallest score, using any one is fine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let the &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; first terms be initial terms for the recurrence relation, and the &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt;'th term be &lt;span class=&quot;math-container&quot;&gt;\$f(i)\$&lt;/span&gt; (&lt;span class=&quot;math-container&quot;&gt;\$i&amp;gt;k,i\in\mathbb N\$&lt;/span&gt;).&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A non-negative integer &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; adds&lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; to the score&lt;/li&gt;&#xA;&lt;li&gt;The current index &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt; adds &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; to the score&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;+&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;, &lt;code&gt;*&lt;/code&gt;, &lt;code&gt;/&lt;/code&gt; (round up, down, towards zero, go further to zero, as you decide) and &lt;code&gt;mod&lt;/code&gt; (&lt;code&gt;a mod b&lt;/code&gt; always equal to &lt;code&gt;a-b*(a/b)&lt;/code&gt;) each add &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; to the score&lt;/li&gt;&#xA;&lt;li&gt;For each initial term &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;, add &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; to the score&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$f(i-n)\$&lt;/span&gt; (with &lt;span class=&quot;math-container&quot;&gt;\$n\le k\$&lt;/span&gt;) adds &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; to the score. E.g. Using the latest value &lt;span class=&quot;math-container&quot;&gt;\$f(i-1)\$&lt;/span&gt; add &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; to the score, and there must be at least 1 initial term.&lt;/li&gt;&#xA;&lt;li&gt;Using parentheses to change the calculation order doesn't add anything to the score.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Samples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input   -&amp;gt; [score]    expression(not optimized)&#xA;1 2 3 4     -&amp;gt; [1]    f(i) = i&#xA;1 2 4 8     -&amp;gt; [3]    f(1) = 1, f(i) = 2*f(i-1)&#xA;1 2 3 5 8   -&amp;gt; [5]    f(1) = 1, f(2) = 2, f(i) = f(i-1)+f(i-2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Lowest score for worse case wins. If tie, shortest program in each language wins. Your program should run in polynomial time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If someone's score is lower than 4(currently reachable), the first lowest score will be accepted. (differ from winning criticia)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;p.s. See history for v1 sandbox&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-10-31T15:33:35.027" LastActivityDate="2018-10-31T15:33:35.027" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="16994" PostTypeId="2" ParentId="2140" CreationDate="2018-10-16T12:02:49.800" Score="0" Body="&lt;p&gt;&lt;strong&gt;Keyboard Row Shift&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an input string of characters, output the number of times we have to shift to another row while typing that string using a qwerty keyboard.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input string will contain lower case alphabets,numbers and spaces.&#xA;The newline key(enter) must also be considered at the end (only at the end).&#xA;All shifts, from any row to any other will be considered as 1 shift only.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Layout:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1234567890&#xA;qwertyuiop&#xA;asdfghjkl enter&#xA;zxcvbnm&#xA;space&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;sdkflsd&quot; -&amp;gt; 0&#xA;&quot;asdwexc&quot; -&amp;gt; 3 # to end the string one enter has to pressed which is in the middle&#xA;&quot;poierlkdjfpoeirldskjf&quot; -&amp;gt;3&#xA;&quot;123 jkjk&quot; -&amp;gt; 2&#xA;&quot;llsdkfj ldkfj&quot; -&amp;gt; 2&#xA;&quot;lkasdjmnbcv &quot; -&amp;gt; 3&#xA;&quot;jnjn 5&quot; -&amp;gt; 6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;strong&gt;code-golf&lt;/strong&gt;, so shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="82927" LastEditorUserId="82927" LastEditDate="2018-10-17T05:36:04.820" LastActivityDate="2018-10-17T05:36:04.820" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="16995" PostTypeId="2" ParentId="2140" CreationDate="2018-10-16T12:25:39.537" Score="-2" Body="&lt;p&gt;&lt;strong&gt;Rotations Required&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given input 2 values:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$x &amp;gt;= 0\$&lt;/span&gt; :Distance to travel (float)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$r&amp;gt;0\$&lt;/span&gt; :Radius of wheel (float)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output the number of rotations required by the wheel to travel that distance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Constraints:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code must not contain any digits.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You cannot use pi functions (math.pi)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output must be an integer.(In case exact int is not obtained, floor it)&#xA;1.0 is not a valid output, it should be 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Test Cases&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x       r    o/p&#xA;50      1    7&#xA;0       34   0&#xA;50      0.3  26&#xA;44      33   0&#xA;5.5     5.5  0&#xA;105     5    3&#xA;155     5    4&#xA;6.28318 1    1 #This signifies that pi was approximated to 3.1419&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Score= No. of bytes+20/number of digits taken for pi after decimal point&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you have taken more than 10 digits:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Score= No. of bytes&lt;/p&gt;&#xA;" OwnerUserId="82927" LastEditorUserId="82927" LastEditDate="2018-10-17T08:13:16.020" LastActivityDate="2018-10-17T08:13:16.020" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="16996" PostTypeId="2" ParentId="2140" CreationDate="2018-10-16T21:25:08.757" Score="2" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/174252/56433&quot;&gt;Posted: Find an array that fits a set of sums&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerDisplayName="user9207" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-10-23T15:29:26.587" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17001" PostTypeId="2" ParentId="2140" CreationDate="2018-10-19T12:15:30.713" Score="-2" Body="&lt;h1&gt;Write a Self-Hosting Ouroboros: each quine produces the next quine AND its interpreter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;My meta-questions, please give feedback and/or add your own:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Too elaborate or long post?&lt;/li&gt;&#xA;&lt;li&gt;Rules too strict? Too lax?&lt;/li&gt;&#xA;&lt;li&gt;Not having a deadline: good or bad idea?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Quine_%28computing%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;Quine&lt;/a&gt; is a program that prints its own source code as output when it is run.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Self-hosting&quot; rel=&quot;nofollow noreferrer&quot;&gt;Self-Hosting&lt;/a&gt; Quine (which is something I just made up, although I'm sure it exists already) is a quine that also produces an interpreter/compiler/emulator/whatever for itself (from now on I will just say &quot;interpreter&quot;). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe this actually means that a lot of essential functionality must be &quot;circularly defined&quot; - for example, to print output, the interpreter must rely on the parent interpreter's ability to print output. So maybe we should call this a &lt;a href=&quot;https://en.wikipedia.org/wiki/M%C3%BCnchhausen_trilemma&quot; rel=&quot;nofollow noreferrer&quot;&gt;Von Munchausen&lt;/a&gt; Quine?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An Ouroboros Program or Quine Relay is a quine that prints a different quine, which then prints yet another program, and so on, until the last quine produces the original quine. See &lt;a href=&quot;https://github.com/mame/quine-relay%20Quine%20Relay&quot; rel=&quot;nofollow noreferrer&quot;&gt;this famous example&lt;/a&gt; that cycles through over a hundred languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A Self-Hosting Ouroboros, then, is quine that produces a program in another language, and also produces an interpreter for that language. The interpreter should be in the current language, so that the next quine can immediately be run and produce the quine after that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Tangent: obviously, the idea can also be extended to interpreter &lt;a href=&quot;https://en.wikipedia.org/wiki/Quine_%28computing%29#Multiquines&quot; rel=&quot;nofollow noreferrer&quot;&gt;multiquines&lt;/a&gt; but that can be another challenge. Let's make Von Munchausen's Ouroboros first!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The ouroboros must be able to make a complete cycle&lt;/li&gt;&#xA;&lt;li&gt;Score by &lt;code&gt;total quines in chain&lt;/code&gt; / &lt;code&gt;shortest source code (in bytes) in the chain&lt;/code&gt; (bytes to allow non-textual outputs)&lt;/li&gt;&#xA;&lt;li&gt;Empty quines and interpreters do not count - two character minimum&lt;/li&gt;&#xA;&lt;li&gt;Code-golf languages allowed&lt;/li&gt;&#xA;&lt;li&gt;No languages defined just for this challenge - no &lt;em&gt;&quot;I define language x to always produce quine y in C plus the complete GCC compiler when fed any input&quot;&lt;/em&gt;-stuff please&lt;/li&gt;&#xA;&lt;li&gt;Quines must be valid code in their programming languages&lt;/li&gt;&#xA;&lt;li&gt;Interpreters that are partial language implementations are fine, however:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;it must be able to run the quine, and produce the next quine (obviously).&lt;/li&gt;&#xA;&lt;li&gt;it should be able to run &lt;em&gt;any other &lt;strong&gt;correct&lt;/strong&gt; code&lt;/em&gt; that is &lt;em&gt;limited to the same language subset¹&lt;/em&gt;. No hyperfitting²!&lt;/li&gt;&#xA;&lt;li&gt;for the sake of code golfing it &lt;em&gt;may&lt;/em&gt; accept incorrect code that a normal interpreter should not (the quine is already restricted to &lt;em&gt;correct&lt;/em&gt; code anyway)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Clarifications&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Yes, you can make a quine that produces itself and its own interpreter&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Counts as a 1-chain ouroboros.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;What would an &quot;interpreter&quot; for machine code be?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;An &lt;a href=&quot;https://en.wikipedia.org/wiki/Emulator&quot; rel=&quot;nofollow noreferrer&quot;&gt;emulator&lt;/a&gt;. Which of course needs some way to load a program and produce the output. You may define a fictional simplified, minimal hardware set-up to do so. For example: a (partial) Z80 emulator where:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;two hardware ports are connected to send output bytes to (one for interpreter, one for quine). Are those bytes interpreted as raw bytes/ASCI/UTF8 text/whatever? Up to you!&lt;/li&gt;&#xA;&lt;li&gt;the program is already loaded in memory, at whatever address is most convenient (quine too big to fit in the addressable memory space? Define an input port to scan bytes from I guess :P)&lt;/li&gt;&#xA;&lt;li&gt;the &lt;code&gt;PC&lt;/code&gt; (program counter), and &lt;code&gt;SP&lt;/code&gt; (stack pointer) registers initiate at whatever value is most convenient for creating a quine in Z80 opcode&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Obviously, no set-ups with fictional ROM that just &lt;em&gt;happens&lt;/em&gt; to contain a new quine, or stuff like that (even though this would be hard to &lt;em&gt;really&lt;/em&gt; abuse, since that ROM would still need to be implemented in the emulator).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Am I seriously expecting anyone to create an emulator like this? No, but let's keep the possiblity open (&lt;a href=&quot;https://en.wikipedia.org/wiki/Stack_machine&quot; rel=&quot;nofollow noreferrer&quot;&gt;some stack machines&lt;/a&gt; might be code golf-friendly enough for the challenge).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;&quot;Borrowing&quot; snippets from each other is encouraged, but give accreditation and link to sources!&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Because  we all really just want to see how long this can get, no? Besides, whatever you take probably has to be heavily modified to fit it in your existing ouroboros chain anyway. Sharing is caring, and accreditation is the decent thing to do.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;No dead-line, nor will a winner be selected. Just make as long a chain as possible.&lt;/h3&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;¹ You wrote an interpreter for a subset of Rust, but it doesn't feature the borrow checker? That is fine long as:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;it works with correct Rust code limited to the language subset&lt;/li&gt;&#xA;&lt;li&gt;it works with the quine itself&lt;/li&gt;&#xA;&lt;li&gt;the quine itself is correct rust code&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;² Example of what I do and do not consider hyperfitting: if your interpreter can deal with &lt;code&gt;for(var i; i &amp;lt; 10; i++) { a[i] = i; }&lt;/code&gt; but crashes without the enclosing &lt;code&gt;{}&lt;/code&gt; because it expects them to designate code blocks, that counts as a partial implementation. If &lt;code&gt;var&lt;/code&gt; only expects &lt;code&gt;i&lt;/code&gt;, or &lt;code&gt;&amp;lt;&lt;/code&gt; only expects &lt;code&gt;i&lt;/code&gt; and &lt;code&gt;10&lt;/code&gt;? Hyperfitting. If &lt;code&gt;var&lt;/code&gt; only accepts single letter names, and &lt;code&gt;&amp;lt;&lt;/code&gt; only expects variables on the left and literals on the right? Probably hyperfitting but debatable.&lt;/p&gt;&#xA;" OwnerUserId="40973" LastEditorUserId="40973" LastEditDate="2018-10-21T13:52:33.000" LastActivityDate="2018-10-21T13:52:33.000" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17005" PostTypeId="2" ParentId="2140" CreationDate="2018-10-20T21:15:16.613" Score="1" Body="&lt;h1&gt;Not All Sums Are Equal&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/numerical-analysis&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;numerical-analysis&amp;#39;&quot; rel=&quot;tag&quot;&gt;numerical-analysis&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sum&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sum&amp;#39;&quot; rel=&quot;tag&quot;&gt;sum&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Introduction&lt;/h3&gt;&#xA;&lt;p&gt;When computing the sum of a list of floating point values, the order in which we add up the summands matters. A good way to reduce errors is beginning with the summand with the least modulus and working your way up to the numbers with a greater modulus. As an illustrative example, let us assume our computer uses floating point numbers that comprise 2 (decimal) digits &lt;span class=&quot;math-container&quot;&gt;\$m_1,m_2\$&lt;/span&gt; for the mantissa (and a sufficiently large number of digits for the exponent &lt;span class=&quot;math-container&quot;&gt;\$e\$&lt;/span&gt;.) These represent a number &lt;span class=&quot;math-container&quot;&gt;\$0.m_1m_2 \cdot 10^e\$&lt;/span&gt;. Let us consider the list&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[0.1, 0.009, 0.009]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The exact result would obviously be &lt;span class=&quot;math-container&quot;&gt;\$0.118\$&lt;/span&gt;, and the best approximation in our computer therefore &lt;span class=&quot;math-container&quot;&gt;\$0.12\$&lt;/span&gt;. But if we actually tell the computer to sum those numbers, it will truncate all intermediate results, so it will get:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; (0.1 + 0.009) + 0.009 = 0.1 + 0.009 = 0.1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If we use the recipe from above and sort the list by the modulus first, we get&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(0.009 + 0.009) + 0.1 = 0.018 + 0.1 = 0.11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;which is already closer to the exact result. So we see that any permutation in the order of the summation might produce a different sum. In order to estimate the possible error we're interested in the difference between the greatest and the least sum we can get by just using a permutations of the original list. This is the task of this challenge.&lt;/p&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;The following examples assume that you use IEEE-754 &lt;code&gt;double&lt;/code&gt; numbers in your implementation. You can of course use other implementations, but the results might be different:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[0.0140534017661288 0.50942429920538 1 1.96300019759529 71.1571487560538]&#xA;1.42108547152020e-14&#xA;[-0.447570988743782 -0.30397649549556 0 0.765285061877593 3.30425088014391]&#xA;8.88178419700125e-16&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-10-21T08:18:56.220" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17006" PostTypeId="2" ParentId="2140" CreationDate="2018-10-22T06:36:28.143" Score="-2" Body="&lt;h1&gt;Unicode encoder&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Do &lt;a href=&quot;https://codegolf.stackexchange.com/questions/40481/&quot;&gt;Invent your own Unicode 7.0.0 encoding (as efficient as possible)&lt;/a&gt; with score 317754(the lowest possible score). Shortest encode+decode program win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can either write two programs doing encode and decode, or write one with argument/input method difference deciding whether it's encoding or decoding&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;As you may know, the Unicode standard has room for 1,114,111 code points, and each assigned code point represents a glyph (character, emoji, etc.).&#xA;&#xA;Most code points are not yet assigned.&#xA;&#xA;Current Unicode implementations take a lot of space to encode all possible code points (UTF-32 takes 4 bytes per code point, UTF-16: 2 to 4 bytes, UTF-8: 1 to 4 bytes, etc.)&#xA;&#xA;&#xA;Task&#xA;-&#xA;&#xA;Today, your task is to implement your own Unicode implementation, with the following rules:&#xA;&#xA;- Write an encoder and a decoder in any language of your choice&#xA;- The encoder's input is a list of code points (as integers) and it outputs a list of bytes (as integers) corresponding to your encoding.&#xA;- The decoder does the opposite (bytes =&amp;gt; code points)&#xA;- Your implementation has to cover all Unicode 7.0.0 assigned code points&#xA;- It has to stay backwards-compatible with ASCII, i.e. encode Basic latin characters (U+0000-U+007F) on one byte, with 0 as most significant bit.&#xA;- Encode all the other assigned code points in any form and any number of bytes you want, as long as there is no ambiguity (i.e. two code points or group of code points can't have the same encoding and vice versa)&#xA;- Your implementation doesn't have to cover UTF-16 surrogates (code points U+D800-U+DFFF) nor private use areas (U+E000-U+F8FF, U+F0000-U+10FFFF)&#xA;- Your encoding must be context-independant (i.e. not rely on previously encoded characters) and does NOT require self-synchronization (i.e. each byte doesn't have to infer where it's located in the encoding of a code point, like in UTF-8).&#xA;&#xA;To sum up, here are the blocks that you have to cover, in JSON:&#xA;&#xA;[&#xA;  [0x0000,0x007F], // Basic Latin&#xA;  [0x0080,0x00FF], // Latin-1 Supplement&#xA;  [0x0100,0x017F], // Latin Extended-A&#xA;  [0x0180,0x024F], // Latin Extended-B&#xA;  [0x0250,0x02AF], // IPA Extensions&#xA;  [0x02B0,0x02FF], // Spacing Modifier Letters&#xA;  [0x0300,0x036F], // Combining Diacritical Marks&#xA;  [0x0370,0x03FF], // Greek and Coptic&#xA;  [0x0400,0x04FF], // Cyrillic&#xA;  [0x0500,0x052F], // Cyrillic Supplement&#xA;  [0x0530,0x058F], // Armenian&#xA;  [0x0590,0x05FF], // Hebrew&#xA;  [0x0600,0x06FF], // Arabic&#xA;  [0x0700,0x074F], // Syriac&#xA;  [0x0750,0x077F], // Arabic Supplement&#xA;  [0x0780,0x07BF], // Thaana&#xA;  [0x07C0,0x07FF], // NKo&#xA;  [0x0800,0x083F], // Samaritan&#xA;  [0x0840,0x085F], // Mandaic&#xA;  [0x08A0,0x08FF], // Arabic Extended-A&#xA;  [0x0900,0x097F], // Devanagari&#xA;  [0x0980,0x09FF], // Bengali&#xA;  [0x0A00,0x0A7F], // Gurmukhi&#xA;  [0x0A80,0x0AFF], // Gujarati&#xA;  [0x0B00,0x0B7F], // Oriya&#xA;  [0x0B80,0x0BFF], // Tamil&#xA;  [0x0C00,0x0C7F], // Telugu&#xA;  [0x0C80,0x0CFF], // Kannada&#xA;  [0x0D00,0x0D7F], // Malayalam&#xA;  [0x0D80,0x0DFF], // Sinhala&#xA;  [0x0E00,0x0E7F], // Thai&#xA;  [0x0E80,0x0EFF], // Lao&#xA;  [0x0F00,0x0FFF], // Tibetan&#xA;  [0x1000,0x109F], // Myanmar&#xA;  [0x10A0,0x10FF], // Georgian&#xA;  [0x1100,0x11FF], // Hangul Jamo&#xA;  [0x1200,0x137F], // Ethiopic&#xA;  [0x1380,0x139F], // Ethiopic Supplement&#xA;  [0x13A0,0x13FF], // Cherokee&#xA;  [0x1400,0x167F], // Unified Canadian Aboriginal Syllabics&#xA;  [0x1680,0x169F], // Ogham&#xA;  [0x16A0,0x16FF], // Runic&#xA;  [0x1700,0x171F], // Tagalog&#xA;  [0x1720,0x173F], // Hanunoo&#xA;  [0x1740,0x175F], // Buhid&#xA;  [0x1760,0x177F], // Tagbanwa&#xA;  [0x1780,0x17FF], // Khmer&#xA;  [0x1800,0x18AF], // Mongolian&#xA;  [0x18B0,0x18FF], // Unified Canadian Aboriginal Syllabics Extended&#xA;  [0x1900,0x194F], // Limbu&#xA;  [0x1950,0x197F], // Tai Le&#xA;  [0x1980,0x19DF], // New Tai Lue&#xA;  [0x19E0,0x19FF], // Khmer Symbols&#xA;  [0x1A00,0x1A1F], // Buginese&#xA;  [0x1A20,0x1AAF], // Tai Tham&#xA;  [0x1AB0,0x1AFF], // Combining Diacritical Marks Extended&#xA;  [0x1B00,0x1B7F], // Balinese&#xA;  [0x1B80,0x1BBF], // Sundanese&#xA;  [0x1BC0,0x1BFF], // Batak&#xA;  [0x1C00,0x1C4F], // Lepcha&#xA;  [0x1C50,0x1C7F], // Ol Chiki&#xA;  [0x1CC0,0x1CCF], // Sundanese Supplement&#xA;  [0x1CD0,0x1CFF], // Vedic Extensions&#xA;  [0x1D00,0x1D7F], // Phonetic Extensions&#xA;  [0x1D80,0x1DBF], // Phonetic Extensions Supplement&#xA;  [0x1DC0,0x1DFF], // Combining Diacritical Marks Supplement&#xA;  [0x1E00,0x1EFF], // Latin Extended Additional&#xA;  [0x1F00,0x1FFF], // Greek Extended&#xA;  [0x2000,0x206F], // General Punctuation&#xA;  [0x2070,0x209F], // Superscripts and Subscripts&#xA;  [0x20A0,0x20CF], // Currency Symbols&#xA;  [0x20D0,0x20FF], // Combining Diacritical Marks for Symbols&#xA;  [0x2100,0x214F], // Letterlike Symbols&#xA;  [0x2150,0x218F], // Number Forms&#xA;  [0x2190,0x21FF], // Arrows&#xA;  [0x2200,0x22FF], // Mathematical Operators&#xA;  [0x2300,0x23FF], // Miscellaneous Technical&#xA;  [0x2400,0x243F], // Control Pictures&#xA;  [0x2440,0x245F], // Optical Character Recognition&#xA;  [0x2460,0x24FF], // Enclosed Alphanumerics&#xA;  [0x2500,0x257F], // Box Drawing&#xA;  [0x2580,0x259F], // Block Elements&#xA;  [0x25A0,0x25FF], // Geometric Shapes&#xA;  [0x2600,0x26FF], // Miscellaneous Symbols&#xA;  [0x2700,0x27BF], // Dingbats&#xA;  [0x27C0,0x27EF], // Miscellaneous Mathematical Symbols-A&#xA;  [0x27F0,0x27FF], // Supplemental Arrows-A&#xA;  [0x2800,0x28FF], // Braille Patterns&#xA;  [0x2900,0x297F], // Supplemental Arrows-B&#xA;  [0x2980,0x29FF], // Miscellaneous Mathematical Symbols-B&#xA;  [0x2A00,0x2AFF], // Supplemental Mathematical Operators&#xA;  [0x2B00,0x2BFF], // Miscellaneous Symbols and Arrows&#xA;  [0x2C00,0x2C5F], // Glagolitic&#xA;  [0x2C60,0x2C7F], // Latin Extended-C&#xA;  [0x2C80,0x2CFF], // Coptic&#xA;  [0x2D00,0x2D2F], // Georgian Supplement&#xA;  [0x2D30,0x2D7F], // Tifinagh&#xA;  [0x2D80,0x2DDF], // Ethiopic Extended&#xA;  [0x2DE0,0x2DFF], // Cyrillic Extended-A&#xA;  [0x2E00,0x2E7F], // Supplemental Punctuation&#xA;  [0x2E80,0x2EFF], // CJK Radicals Supplement&#xA;  [0x2F00,0x2FDF], // Kangxi Radicals&#xA;  [0x2FF0,0x2FFF], // Ideographic Description Characters&#xA;  [0x3000,0x303F], // CJK Symbols and Punctuation&#xA;  [0x3040,0x309F], // Hiragana&#xA;  [0x30A0,0x30FF], // Katakana&#xA;  [0x3100,0x312F], // Bopomofo&#xA;  [0x3130,0x318F], // Hangul Compatibility Jamo&#xA;  [0x3190,0x319F], // Kanbun&#xA;  [0x31A0,0x31BF], // Bopomofo Extended&#xA;  [0x31C0,0x31EF], // CJK Strokes&#xA;  [0x31F0,0x31FF], // Katakana Phonetic Extensions&#xA;  [0x3200,0x32FF], // Enclosed CJK Letters and Months&#xA;  [0x3300,0x33FF], // CJK Compatibility&#xA;  [0x3400,0x4DBF], // CJK Unified Ideographs Extension A&#xA;  [0x4DC0,0x4DFF], // Yijing Hexagram Symbols&#xA;  [0x4E00,0x9FFF], // CJK Unified Ideographs&#xA;  [0xA000,0xA48F], // Yi Syllables&#xA;  [0xA490,0xA4CF], // Yi Radicals&#xA;  [0xA4D0,0xA4FF], // Lisu&#xA;  [0xA500,0xA63F], // Vai&#xA;  [0xA640,0xA69F], // Cyrillic Extended-B&#xA;  [0xA6A0,0xA6FF], // Bamum&#xA;  [0xA700,0xA71F], // Modifier Tone Letters&#xA;  [0xA720,0xA7FF], // Latin Extended-D&#xA;  [0xA800,0xA82F], // Syloti Nagri&#xA;  [0xA830,0xA83F], // Common Indic Number Forms&#xA;  [0xA840,0xA87F], // Phags-pa&#xA;  [0xA880,0xA8DF], // Saurashtra&#xA;  [0xA8E0,0xA8FF], // Devanagari Extended&#xA;  [0xA900,0xA92F], // Kayah Li&#xA;  [0xA930,0xA95F], // Rejang&#xA;  [0xA960,0xA97F], // Hangul Jamo Extended-A&#xA;  [0xA980,0xA9DF], // Javanese&#xA;  [0xA9E0,0xA9FF], // Myanmar Extended-B&#xA;  [0xAA00,0xAA5F], // Cham&#xA;  [0xAA60,0xAA7F], // Myanmar Extended-A&#xA;  [0xAA80,0xAADF], // Tai Viet&#xA;  [0xAAE0,0xAAFF], // Meetei Mayek Extensions&#xA;  [0xAB00,0xAB2F], // Ethiopic Extended-A&#xA;  [0xAB30,0xAB6F], // Latin Extended-E&#xA;  [0xABC0,0xABFF], // Meetei Mayek&#xA;  [0xAC00,0xD7AF], // Hangul Syllables&#xA;  [0xD7B0,0xD7FF], // Hangul Jamo Extended-B&#xA;  [0xF900,0xFAFF], // CJK Compatibility Ideographs&#xA;  [0xFB00,0xFB4F], // Alphabetic Presentation Forms&#xA;  [0xFB50,0xFDFF], // Arabic Presentation Forms-A&#xA;  [0xFE00,0xFE0F], // Variation Selectors&#xA;  [0xFE10,0xFE1F], // Vertical Forms&#xA;  [0xFE20,0xFE2F], // Combining Half Marks&#xA;  [0xFE30,0xFE4F], // CJK Compatibility Forms&#xA;  [0xFE50,0xFE6F], // Small Form Variants&#xA;  [0xFE70,0xFEFF], // Arabic Presentation Forms-B&#xA;  [0xFF00,0xFFEF], // Halfwidth and Fullwidth Forms&#xA;  [0xFFF0,0xFFFF], // Specials&#xA;  [0x10000,0x1007F], // Linear B Syllabary&#xA;  [0x10080,0x100FF], // Linear B Ideograms&#xA;  [0x10100,0x1013F], // Aegean Numbers&#xA;  [0x10140,0x1018F], // Ancient Greek Numbers&#xA;  [0x10190,0x101CF], // Ancient Symbols&#xA;  [0x101D0,0x101FF], // Phaistos Disc&#xA;  [0x10280,0x1029F], // Lycian&#xA;  [0x102A0,0x102DF], // Carian&#xA;  [0x102E0,0x102FF], // Coptic Epact Numbers&#xA;  [0x10300,0x1032F], // Old Italic&#xA;  [0x10330,0x1034F], // Gothic&#xA;  [0x10350,0x1037F], // Old Permic&#xA;  [0x10380,0x1039F], // Ugaritic&#xA;  [0x103A0,0x103DF], // Old Persian&#xA;  [0x10400,0x1044F], // Deseret&#xA;  [0x10450,0x1047F], // Shavian&#xA;  [0x10480,0x104AF], // Osmanya&#xA;  [0x10500,0x1052F], // Elbasan&#xA;  [0x10530,0x1056F], // Caucasian Albanian&#xA;  [0x10600,0x1077F], // Linear A&#xA;  [0x10800,0x1083F], // Cypriot Syllabary&#xA;  [0x10840,0x1085F], // Imperial Aramaic&#xA;  [0x10860,0x1087F], // Palmyrene&#xA;  [0x10880,0x108AF], // Nabataean&#xA;  [0x10900,0x1091F], // Phoenician&#xA;  [0x10920,0x1093F], // Lydian&#xA;  [0x10980,0x1099F], // Meroitic Hieroglyphs&#xA;  [0x109A0,0x109FF], // Meroitic Cursive&#xA;  [0x10A00,0x10A5F], // Kharoshthi&#xA;  [0x10A60,0x10A7F], // Old South Arabian&#xA;  [0x10A80,0x10A9F], // Old North Arabian&#xA;  [0x10AC0,0x10AFF], // Manichaean&#xA;  [0x10B00,0x10B3F], // Avestan&#xA;  [0x10B40,0x10B5F], // Inscriptional Parthian&#xA;  [0x10B60,0x10B7F], // Inscriptional Pahlavi&#xA;  [0x10B80,0x10BAF], // Psalter Pahlavi&#xA;  [0x10C00,0x10C4F], // Old Turkic&#xA;  [0x10E60,0x10E7F], // Rumi Numeral Symbols&#xA;  [0x11000,0x1107F], // Brahmi&#xA;  [0x11080,0x110CF], // Kaithi&#xA;  [0x110D0,0x110FF], // Sora Sompeng&#xA;  [0x11100,0x1114F], // Chakma&#xA;  [0x11150,0x1117F], // Mahajani&#xA;  [0x11180,0x111DF], // Sharada&#xA;  [0x111E0,0x111FF], // Sinhala Archaic Numbers&#xA;  [0x11200,0x1124F], // Khojki&#xA;  [0x112B0,0x112FF], // Khudawadi&#xA;  [0x11300,0x1137F], // Grantha&#xA;  [0x11480,0x114DF], // Tirhuta&#xA;  [0x11580,0x115FF], // Siddham&#xA;  [0x11600,0x1165F], // Modi&#xA;  [0x11680,0x116CF], // Takri&#xA;  [0x118A0,0x118FF], // Warang Citi&#xA;  [0x11AC0,0x11AFF], // Pau Cin Hau&#xA;  [0x12000,0x123FF], // Cuneiform&#xA;  [0x12400,0x1247F], // Cuneiform Numbers and Punctuation&#xA;  [0x13000,0x1342F], // Egyptian Hieroglyphs&#xA;  [0x16800,0x16A3F], // Bamum Supplement&#xA;  [0x16A40,0x16A6F], // Mro&#xA;  [0x16AD0,0x16AFF], // Bassa Vah&#xA;  [0x16B00,0x16B8F], // Pahawh Hmong&#xA;  [0x16F00,0x16F9F], // Miao&#xA;  [0x1B000,0x1B0FF], // Kana Supplement&#xA;  [0x1BC00,0x1BC9F], // Duployan&#xA;  [0x1BCA0,0x1BCAF], // Shorthand Format Controls&#xA;  [0x1D000,0x1D0FF], // Byzantine Musical Symbols&#xA;  [0x1D100,0x1D1FF], // Musical Symbols&#xA;  [0x1D200,0x1D24F], // Ancient Greek Musical Notation&#xA;  [0x1D300,0x1D35F], // Tai Xuan Jing Symbols&#xA;  [0x1D360,0x1D37F], // Counting Rod Numerals&#xA;  [0x1D400,0x1D7FF], // Mathematical Alphanumeric Symbols&#xA;  [0x1E800,0x1E8DF], // Mende Kikakui&#xA;  [0x1EE00,0x1EEFF], // Arabic Mathematical Alphabetic Symbols&#xA;  [0x1F000,0x1F02F], // Mahjong Tiles&#xA;  [0x1F030,0x1F09F], // Domino Tiles&#xA;  [0x1F0A0,0x1F0FF], // Playing Cards&#xA;  [0x1F100,0x1F1FF], // Enclosed Alphanumeric Supplement&#xA;  [0x1F200,0x1F2FF], // Enclosed Ideographic Supplement&#xA;  [0x1F300,0x1F5FF], // Miscellaneous Symbols and Pictographs&#xA;  [0x1F600,0x1F64F], // Emoticons&#xA;  [0x1F650,0x1F67F], // Ornamental Dingbats&#xA;  [0x1F680,0x1F6FF], // Transport and Map Symbols&#xA;  [0x1F700,0x1F77F], // Alchemical Symbols&#xA;  [0x1F780,0x1F7FF], // Geometric Shapes Extended&#xA;  [0x1F800,0x1F8FF], // Supplemental Arrows-C&#xA;  [0x20000,0x2A6DF], // CJK Unified Ideographs Extension B&#xA;  [0x2A700,0x2B73F], // CJK Unified Ideographs Extension C&#xA;  [0x2B740,0x2B81F], // CJK Unified Ideographs Extension D&#xA;  [0x2F800,0x2FA1F], // CJK Compatibility Ideographs Supplement&#xA;  [0xE0000,0xE007F], // Tags&#xA;  [0xE0100,0xE01EF]  // Variation Selectors Supplement&#xA;]&#xA;&#xA;Total: 116,816 code points.&#xA;&#xA;Scoring&#xA;--&#xA;&#xA;Your score is the number of bytes that your encoder outputs when you feed it with all the 116,816 possible code points (in one time or separately).&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; &lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-10-22T09:43:22.227" LastActivityDate="2018-10-22T09:43:22.227" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17013" PostTypeId="1" CreationDate="2018-10-23T19:33:59.363" Score="10" ViewCount="316" Body="&lt;p&gt;A common mistake new users seem to make is posting questions (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/174577/permutations-of-given-string&quot;&gt;like this&lt;/a&gt;) asking about general programming help which are better suited in &lt;a href=&quot;https://stackoverflow.com&quot;&gt;StackOverflow&lt;/a&gt;. While these questions are being closed, I don't think we should just let that happen and instead try to stop new users from posting these questions in the first place so that the homepage doesn't get filled with these questions. (Because if it did, new users would see it, and possibly make questions like them, amplifying the whole problem)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One idea I had would be to change the text on the side when asking a question to something making it clear that this site is &lt;strong&gt;for programming contests only&lt;/strong&gt;, and maybe this could be something only for low-rep users.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What are your ideas for this? Should we even bother doing anything at all?&lt;/p&gt;&#xA;" OwnerUserId="82488" LastActivityDate="2018-10-31T00:26:54.987" Title="What should we do to avoid programming help questions?" Tags="|discussion|new-users|" AnswerCount="3" CommentCount="18" ContentLicense="CC BY-SA 4.0" />
  <row Id="17014" PostTypeId="2" ParentId="17013" CreationDate="2018-10-23T20:44:49.153" Score="10" Body="&lt;p&gt;Although we may occasionally get an off topic question from a new user who is genuinely confused by the title or layout of our site, the majority of off topic questions I see appear to be posted without much thought about which site they are being posted on. Even Stack Exchange sites that clearly have nothing to do with programming get those.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't see this as a problem that we need to address. They are being closed promptly by the community, and I don't see any evidence of the number of off topic posts increasing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8350/were-not-a-qa-site-but-what-should-be-done-about-it&quot;&gt;lots of other things that I'd like to see changed to distinguish this site&lt;/a&gt;, but those are more about making the site accessible to new recreational programmers, rather than making it clear to people who aren't looking for this site.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2018-10-23T20:44:49.153" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17016" PostTypeId="2" ParentId="17013" CreationDate="2018-10-24T15:27:06.037" Score="7" Body="&lt;p&gt;Quoting my answer from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/16394/3852&quot;&gt;https://codegolf.meta.stackexchange.com/a/16394/3852&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Customize the How To Ask box further&lt;/h1&gt;&#xA;  &#xA;  &lt;p&gt;We're still getting a bunch of homework questions and interview riddles. I think the phrasing on the How To Ask box could be tweaked to make it &lt;strong&gt;abundantly&lt;/strong&gt; clear that this is not a Q&amp;amp;A site:&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/v7eX4.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/v7eX4.png&quot; alt=&quot;PPCG&amp;#39;s How To Ask box&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;I suggest we:&lt;/p&gt;&#xA;  &#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;&lt;p&gt;Remove the bolded question at the top. I think a large number of users submitting “bad” asks read this question and think “oh, this is/could be conceived as a puzzle, so it's welcome here.” I don't think the phrasing “programming puzzle”, which is generally agreed to be a little misleading, should be in this box at all.&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;Replace it with something like &lt;strong&gt;We’re not a homework help site.&lt;/strong&gt; in bold and maybe &lt;span class=&quot;math-container&quot;&gt;\$\color{red}{\textsf{red}}\$&lt;/span&gt;, so it will catch the eye of anyone submitting their first question.&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="3852" LastEditorUserId="3852" LastEditDate="2018-10-26T23:40:13.947" LastActivityDate="2018-10-26T23:40:13.947" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17017" PostTypeId="2" ParentId="2140" CreationDate="2018-10-25T08:01:28.800" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/174873&quot;&gt;Hack g-code parser&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="71612" LastEditorUserId="42545" LastEditDate="2018-10-29T15:36:50.180" LastActivityDate="2018-10-29T15:36:50.180" CommentCount="4" CommunityOwnedDate="2018-10-25T08:01:28.800" ContentLicense="CC BY-SA 4.0" />
  <row Id="17018" PostTypeId="2" ParentId="2140" CreationDate="2018-10-25T15:11:30.007" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/174907/56470&quot;&gt;Posted: Is this number secretly Fibonacci?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="56470" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-10-29T20:23:31.487" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17020" PostTypeId="2" ParentId="2140" CreationDate="2018-10-25T17:46:22.343" Score="0" Body="&lt;p&gt;Given a program in your language, generate another program that do exactly the same thing so every bytes in it are prime.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Shortest generator in every language win. No acception. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Nop in languages that only allow prime bytes are legit, but just don't post them(or make a community answer to put them)&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2018-10-25T17:46:22.343" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17022" PostTypeId="2" ParentId="2140" CreationDate="2018-10-26T17:13:08.617" Score="1" Body="&lt;h1&gt;Unjagged my array&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Given a jagged array of integers, rearrange the integers such that&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The shape of the jagged array is unchanged, and&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The jaggedness of each subarray is minimized.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Here &quot;jaggedness&quot; is defined as the sum of the absolute differences in each subarray. If an array has only one element, then the jaggedness of that array must be 0, since there are no absolute differences to consider.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We only care about the differences in elements in the same subarray. So for example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[1, 2], [100]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;has a jaggedness of &lt;strong&gt;1&lt;/strong&gt;, since the first array has a jaggedness of &lt;span class=&quot;math-container&quot;&gt;\$abs(1-2) = 1\$&lt;/span&gt; and the second array has a jaggedness of 0. We don't care that the difference between 2 and 100 is 98 since they are different subarrays.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's an example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: [[16, 8], [15], [4, 42, 23]]&#xA;jaggedness of input: [abs(16 - 8)] + [0] + [abs(4 - 42) + abs(42 - 23)] =&#xA;8 + 38 + 19 = 65&#xA;&#xA;One possible output: [[4, 8], [42], [15, 16, 23]]&#xA;jaggedness of this output: [abs(4 - 8)] + [0] + [abs(15 - 16) + abs(16 - 23)] = 4 + 1 + 7 = 12&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Of course, this is one possible output. Any of these outputs would also have a jaggedness of 12:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[4, 8], [42], [23, 16, 15]]&#xA;[[8, 4], [42], [15, 16, 23]]&#xA;[[8, 4], [42], [23, 16, 15]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Clarifications&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input will always contain non-negative integers. The input will also always have a length &lt;code&gt;&amp;gt;= 1&lt;/code&gt;, and all of the subarrays will have a length &lt;code&gt;&amp;gt;= 1&lt;/code&gt;. This means that you must handle inputs as small as &lt;code&gt;[[n]]&lt;/code&gt;, where &lt;strong&gt;n&lt;/strong&gt; is any non-negative integer.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the input is already arranged to be as smooth as possible, it is acceptable for your code to output the integers in a different order, as long as this new order has the same jaggedness. For example, if the input was &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[1, 2], [3, 4, 5]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;then your program may return the input unchanged, or it may return&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[5, 4], [1, 2, 3]] &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or any of the other arrangements with jaggedness &lt;strong&gt;3&lt;/strong&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Fastest code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenge, so the submission with the shortest run time for a hidden test case will win. I will use 2 different test cases with different shapes, and your score will be the sum of the time for each. (I haven't yet decided how large these test cases should be. I might adjust them once submissions come in so that it takes an appropriate amount of time.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All submissions will be tested on my machine:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Windows 10&lt;/li&gt;&#xA;&lt;li&gt;i7-4790k&lt;/li&gt;&#xA;&lt;li&gt;8 GB RAM&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You can use any language that is freely available on Windows 10. Please also provide instructions for running your submission. I will test each submission at my soonest convenience after it's posted, and then comment an unofficial score. After 1 week, I will test every submission, and post a leaderboard. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;These test cases were generated with and verified by &lt;a href=&quot;https://tio.run/##XVJBbsMgELz7FRyhopat9GQp1576AyuKcEwSUgwIsKr08@4uYCeNDzZmZ2ZnB9w9Xq3ZLYuanPWReGFGO1XlT0Xpo7U6VNUoz@QijfQiSio4GTg57dumYV1F4NFkT/pDldZn64kiyqDYBcAFkmC1cE6akfa5UY0fZSJtQI4l5vHBfMG00JWxA8tdvIyzN0Rna5PVI9WchKtwsjQ08ie7Wg1qFSLVbDMZ5uELtrBh4j18AnVzqmtnHW2e3BXeixPgZC@Dn6M8AvoEw3tf3Jy1iOAhQK5ypGGesMbBHsuG0muQIX5m4KQM3fKvnfTTHEVU1gSKUoyTb3nfazENoyC6CyfrJV1jwLZFV5iAalhY1XP9n3lAQXhJA5ZsCyINlPd1GaQwcII0xRDo7V3leBQnN0zoVzkoDn333h445tW3HQy6po4QOIeqwlPZbtWOkw9O8E5VzuOBIySv3p4z1Ywtyx8&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 3 – Try It Online&quot;&gt;a python brute-forcer&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: [[1, 2, 9], [10, 11]]&#xA;Output: [[9, 10, 11], [1, 2]] (jaggedness 3)&#xA;&#xA;Input: [[4, 8, 15], [16], [23, 42]]&#xA;Output: [[4, 8, 15], [16], [23, 42]] (jaggedness 30)&#xA;&#xA;Input: [[45, 98, 9, 46], [48, 53, 59], [13], [38, 94]]&#xA;Output: [[45, 46, 48, 53], [9, 13, 38], [59], [94, 98]] (jaggedness 41)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that none of these test cases show the only acceptable answer, merely &lt;em&gt;one&lt;/em&gt; acceptable answer. For example, any output would remain valid if a subarray was reversed.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="31716" LastEditDate="2018-12-08T21:40:34.460" LastActivityDate="2018-12-08T21:40:34.460" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17025" PostTypeId="2" ParentId="17013" CreationDate="2018-10-27T16:44:25.680" Score="2" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/ask/advice?&quot;&gt;advice page&lt;/a&gt;, when it is enabled (&lt;a href=&quot;https://meta.stackexchange.com/a/238081/323179&quot;&gt;available by request&lt;/a&gt;) is shown to all new users when they go to ask a question, before they get to the ask question page. It forces them to check a checkbox before proceeding (which you can see &lt;a href=&quot;https://serverfault.com/questions/ask/advice?&quot;&gt;here&lt;/a&gt; by browsing incognito). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's important to try to get people aware &lt;em&gt;before&lt;/em&gt; they've already spent time writing things.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This page, if it was editable, would be the perfect place to tell people we don't take general programming questions. It wouldn't stop the people that don't read anything, but it would probably be helpful for people who miss the other hints for reasons like banner blindness (e.g. the How to Ask sidebar for most other sites only has generic info, so people learn to ignore it). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It would also be a good place to briefly outline helpful things for those who are actually trying to post challenges. That way, the page would even be helpful for people who are actually on the right site too.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I already &lt;a href=&quot;https://meta.stackexchange.com/q/316489/323179&quot;&gt;posted this idea on the main meta&lt;/a&gt; (because I think it would be useful for plenty of other sites), so consider also supporting or discussing it there.&lt;/p&gt;&#xA;" OwnerUserId="66025" LastActivityDate="2018-10-27T16:44:25.680" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17026" PostTypeId="2" ParentId="2140" CreationDate="2018-10-27T23:30:08.040" Score="0" Body="&lt;h1&gt;Are these strings character wise translatable? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h3&gt;Explanation with example:&lt;/h3&gt;&#xA;&lt;p&gt;Suppose you are given two strings of the same length, e.g. &lt;code&gt;&amp;quot;code&amp;quot;&lt;/code&gt; and &lt;code&gt;&amp;quot;golf&amp;quot;&lt;/code&gt;. Try to find a set of translation rules for characters (like &lt;em&gt;&amp;quot;All &lt;code&gt;c&lt;/code&gt;s are replaced by &lt;code&gt;g&lt;/code&gt;s&amp;quot;&lt;/em&gt; , or &lt;code&gt;c -&amp;gt; g&lt;/code&gt; for short) such that applying those rules on &lt;code&gt;&amp;quot;code&amp;quot;&lt;/code&gt; yields &lt;code&gt;&amp;quot;golf&amp;quot;&lt;/code&gt; and applying them to &lt;code&gt;&amp;quot;golf&amp;quot;&lt;/code&gt; again yields &lt;code&gt;&amp;quot;code&amp;quot;&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If there is such a set of translation rules, return a truthy value. Otherwise, if no such set can exist, return a falsy value.&lt;/p&gt;&#xA;&lt;p&gt;In our example, the translation is possible with the rules &lt;code&gt;g -&amp;gt; c&lt;/code&gt;, &lt;code&gt;d -&amp;gt; l&lt;/code&gt;, &lt;code&gt;e -&amp;gt; f&lt;/code&gt;, &lt;code&gt;c -&amp;gt; g&lt;/code&gt;, &lt;code&gt;l -&amp;gt; d&lt;/code&gt; and &lt;code&gt;f -&amp;gt; e&lt;/code&gt;, so a truthy value should be returned.&lt;/p&gt;&#xA;&lt;p&gt;However, if the two strings were &lt;code&gt;&amp;quot;code&amp;quot;&lt;/code&gt; and &lt;code&gt;&amp;quot;meta&amp;quot;&lt;/code&gt;, no such rules exist: To get from &lt;code&gt;&amp;quot;code&amp;quot;&lt;/code&gt; to &lt;code&gt;&amp;quot;meta&amp;quot;&lt;/code&gt; we need the rule &lt;code&gt;e -&amp;gt; a&lt;/code&gt;, but to get from &lt;code&gt;&amp;quot;meta&amp;quot;&lt;/code&gt; to &lt;code&gt;&amp;quot;code&amp;quot;&lt;/code&gt; we would need &lt;code&gt;e -&amp;gt; o&lt;/code&gt;. But &lt;code&gt;e&lt;/code&gt; cannot be translated into two different characters! Therefore, a falsy value should be returned.&lt;/p&gt;&#xA;&lt;h3&gt;Consise mathy explanation:&lt;/h3&gt;&#xA;&lt;p&gt;Given two strings &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt; of the same length &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, decide whether the following relation is &lt;a href=&quot;https://en.wikipedia.org/wiki/Bijection&quot; rel=&quot;nofollow noreferrer&quot;&gt;bijective&lt;/a&gt;:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$\{(s_i,t_i)\ |\ 1 \leqslant i \leqslant n\} \cup \{(t_i,s_i)\ |\ 1 \leqslant i \leqslant n\}$$&lt;/span&gt;&#xA;where &lt;span class=&quot;math-container&quot;&gt;\$s_i\$&lt;/span&gt; denotes the &lt;span class=&quot;math-container&quot;&gt;\$i^{th}\$&lt;/span&gt; character of string &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;p&gt;truthy:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;code&amp;quot;, &amp;quot;golf&amp;quot;&#xA;&amp;quot;a&amp;quot;, &amp;quot;a&amp;quot;&#xA;&amp;quot;abdabdcdacabcabd&amp;quot;, &amp;quot;bacbacdcbdbadbac&amp;quot;&#xA;TODO: Add some more&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;falsy:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;code&amp;quot;, &amp;quot;meta&amp;quot;&#xA;&amp;quot;aa&amp;quot;, &amp;quot;ab&amp;quot;&#xA;&amp;quot;abc&amp;quot;, &amp;quot;bca&amp;quot;&#xA;TODO: Add some more&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="56433" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-10-27T23:30:08.040" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17027" PostTypeId="2" ParentId="2140" CreationDate="2018-10-28T00:42:14.027" Score="0" Body="&lt;h2&gt;Guess the Q in the code&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A popular puzzle known to me as Codewords takes a Crossword-like grid and consistently replaces each letter with a code value, usually a number from 1 to 26, and the solver then has to work out which code value represents each letter. There are a number of approaches to this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There is a web site which can search for words given the pattern of repeating letters. Since repeated letters map to repeated code values, you can sometimes use the patten of repeated code values to determine the original word. For instance, the only word with the pattern &lt;code&gt;12.312..3...&lt;/code&gt; is &lt;code&gt;churchwarden&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The puzzle normally provides a few of the letters to get you started. This may be enough to use a standard crossword solver to determine the original word. For instance, &lt;code&gt;.h...h...d..&lt;/code&gt; would again point you to the word &lt;code&gt;churchwarden&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You could use frequency analysis to guess which letters are likely to be the popular letters such as &lt;code&gt;e&lt;/code&gt; or &lt;code&gt;t&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You could look for common prefixes or suffixes such as &lt;code&gt;ally&lt;/code&gt; or &lt;code&gt;ness&lt;/code&gt;. (I picked those two as they have repeating letters which are easier to spot.)&lt;/li&gt;&#xA;&lt;li&gt;At least in all of the Codewords puzzles I have seen, &lt;code&gt;q&lt;/code&gt; is always followed by a &lt;code&gt;u&lt;/code&gt; and at least one letter. This means that if there is a code that is never the last or penultimate letter of a word, and always appears followed by the same code, then this could be a &lt;code&gt;q&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;However, checking all the codes to see how many distinct codes follow them is laborious. We need an automatic solution for this!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please write a program or function that will guess which code(s) could represent the letter &lt;code&gt;q&lt;/code&gt;. The input to the function will be an array of code values in a standard format. You will need to support 27 consistent distinct values, 26 for the codes themselves and a value for the background. These values can be integers but you could also use characters e.g. 26 letters and a space, in which case you can join them into strings, and even join the strings with a 28th character.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your output will be all of the code values that have the property that, for each occurrence in the grid, either:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The previous and following cells are background or would extend past the side of the grid, or&lt;/li&gt;&#xA;&lt;li&gt;There are two non-background following cells, and the first of those cells always contains the same value.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;These rules apply in both the horizontal and vertical direction.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest solution that breaks no standard loopholes wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples needed, I guess...&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2018-10-28T00:42:14.027" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17030" PostTypeId="2" ParentId="2140" CreationDate="2018-10-29T18:28:46.040" Score="2" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/175118/find-the-minimal-initial-values&quot;&gt;Posted&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Find the minimal initial values&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Consider a sequence &lt;code&gt;F&lt;/code&gt; of positive integers where &lt;code&gt;F(n) = F(n-1) + F(n-2)&lt;/code&gt; for &lt;code&gt;n &amp;gt;= 2&lt;/code&gt;.  The Fibonacci sequence is one example of this type of sequence for &lt;code&gt;F(0) = F(1) = 1&lt;/code&gt;, but any two initial values will yield a different sequence.  For example &lt;code&gt;F(0) = 3, F(1) = 1&lt;/code&gt; produces these terms.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3, 1, 4, 5, 9, 14, 23, 37, 60, 97, ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The task is to find &lt;code&gt;F(0)&lt;/code&gt; and &lt;code&gt;F(1)&lt;/code&gt; that minimize &lt;code&gt;F(0) + F(1)&lt;/code&gt; given some term of a sequence &lt;code&gt;F(n)&lt;/code&gt;.  Write a function or complete program to complete the task.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input is a single positive integer, &lt;code&gt;F(n)&lt;/code&gt;.  It may be accepted as a parameter or from standard input.  Any reasonable representation is allowed, including direct integer or string representations. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Invalid inputs need not be considered.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The output will be two positive integers, &lt;code&gt;F(0)&lt;/code&gt; and &lt;code&gt;F(1)&lt;/code&gt;.  Any reasonable format is acceptable.  Here are some examples of reasonable formats.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Written on separate lines to standard output&lt;/li&gt;&#xA;&lt;li&gt;Formatted on standard output as a delimited 2-element list&lt;/li&gt;&#xA;&lt;li&gt;Returned as a tuple or 2-element array of integers from a function&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;60  -&amp;gt; [3, 1]&#xA;37  -&amp;gt; [3, 1]&#xA;13  -&amp;gt; [1, 1]&#xA;26  -&amp;gt; [2, 2]&#xA;4   -&amp;gt; [2, 1]&#xA;5   -&amp;gt; [1, 1]&#xA;6   -&amp;gt; [2, 2]&#xA;7   -&amp;gt; [2, 1]&#xA;12  -&amp;gt; [3, 2]&#xA;1   -&amp;gt; [1, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is code golf.  The score is calculated by bytes of source code.&lt;/p&gt;&#xA;" OwnerUserId="527" LastEditorUserId="527" LastEditDate="2018-11-02T18:18:21.243" LastActivityDate="2018-11-02T18:18:21.243" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="17031" PostTypeId="2" ParentId="5328" CreationDate="2018-10-29T18:37:15.300" Score="6" Body="&lt;p&gt;Today I tasked my (physics) students with something along the lines of:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;Write a function that does X.&lt;/li&gt;&#xA;  &lt;li&gt;Use your function from Task 1 to do X.&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Now, I wanted to provide students with some solution to Task 1, so that if they failed to do it, they could do Task 2 nonetheless. Obviously, I also did not just want to give them any plain hints on how to do Task 1. Giving them anything compiled would risk portability issues or my students not knowing how to use it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fortunately, the vast majority of golfing tricks also obfuscate your code, so I found it easy to give my students something which would take longer to reverse-engineer into some human-readable solution than solving the exercise as intended.&lt;/p&gt;&#xA;" OwnerUserId="11354" LastActivityDate="2018-10-29T18:37:15.300" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17032" PostTypeId="2" ParentId="10761" CreationDate="2018-10-30T02:15:19.760" Score="0" Body="&lt;h1&gt;The Thyme code to generate such logic&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If you copy something from Algodoo and paste it in notepad, you can see the Thyme code that generates such thing. Also, pasting it back work fine even if it's not standard copy-out text&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2018-10-30T02:15:19.760" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17045" PostTypeId="2" ParentId="2140" CreationDate="2018-10-31T12:26:40.260" Score="4" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/199658/game-of-game-of-life&quot;&gt;Posted to main.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="82199" LastEditorUserId="82199" LastEditDate="2020-02-17T17:32:00.477" LastActivityDate="2020-02-17T17:32:00.477" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="17047" PostTypeId="2" ParentId="2140" CreationDate="2018-10-31T17:47:06.140" Score="0" Body="&lt;h1&gt;User ranking in language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Challenge is:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You need receive the input of &quot;language&quot;. By &quot;language&quot; I mean the  at left of the comma in the Title of an answer on the present code-golf site.&lt;/li&gt;&#xA;&lt;li&gt;The source for the data are the answers posted here on code-golf site. &lt;/li&gt;&#xA;&lt;li&gt;You must present results in order. Decreasing or Increasing does not matter, it only needs to be one of those two.&lt;/li&gt;&#xA;&lt;li&gt;Output is a table of two columns {User, Upvotes}. Example: User enters &lt;code&gt;Java&lt;/code&gt; and will obtain a list as the following:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;&#xA;user_A    9523&#xA;user_B    6000&#xA;user_C     120&#xA;&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do not care very much about the output formatting as long it is clear the separation between the two columns and each line.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The will be no winner as it is a per language &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question.&lt;/p&gt;&#xA;" OwnerUserId="29325" LastActivityDate="2018-10-31T17:47:06.140" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17048" PostTypeId="2" ParentId="8047" CreationDate="2018-10-31T20:07:39.373" Score="14" Body="&lt;h1&gt;Requiring multiple types as return value&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is very similar to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8058/48198&quot;&gt;&lt;em&gt;Explicitly disallowing or disadvantaging arbitrary (classes of) languages&lt;/em&gt;&lt;/a&gt; though it's more subtle (and not necessarily explicit):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A lot of languages &lt;a href=&quot;https://en.wikipedia.org/wiki/Type_system#Static_type_checking&quot; rel=&quot;nofollow noreferrer&quot;&gt;don't allow&lt;/a&gt; returning multiple types therefore it's not a good idea to require different types as a return value because it rules out those languages for no reason (of course there might be challenges exempt from this).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; While not requiring a different type, the same should hold for exit codes and errors - in some languages it is not possible to generate errors or certain exit codes.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Given some input &lt;em&gt;X&lt;/em&gt; if it satisfies property &lt;em&gt;Y&lt;/em&gt; return a list of integers, else return a &lt;em&gt;falsy&lt;/em&gt; value&lt;/li&gt;&#xA;&lt;li&gt;Given some input &lt;em&gt;X&lt;/em&gt;, if it satisfies property &lt;em&gt;Y&lt;/em&gt; return the integers &lt;em&gt;f(X)&lt;/em&gt;, else return a string saying &lt;code&gt;zzz&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Given the input &lt;em&gt;X&lt;/em&gt; if it achieves &lt;em&gt;Y&lt;/em&gt; return some &lt;em&gt;Z&lt;/em&gt; else exit with a non-zero error cod&lt;/li&gt;&#xA;&lt;li&gt;Given &lt;em&gt;X&lt;/em&gt; if it &lt;em&gt;Y&lt;/em&gt;s then return some &lt;em&gt;Z&lt;/em&gt; else error&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="48198" LastActivityDate="2018-10-31T20:07:39.373" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17051" PostTypeId="1" CreationDate="2018-11-01T02:57:30.887" Score="2" ViewCount="193" Body="&lt;p&gt;My name is Eduardo and I'm a Computer Science student from Brazil, finishing college by the end of this year. My undergraduate thesis is about the programming language JAEL that I'm developing for Code Golf challenges. The source code and documentation are available at &lt;a href=&quot;https://github.com/eduardoHoefel/JAEL&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub&lt;/a&gt; and an interpreter is hosted over &lt;a href=&quot;https://tio.run/#jael&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;. But I'll describe it shortly:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;JAEL is a programming language focused on mathematical computation. The execution is stack-based, although the results must be saved over tape objects to be printed on the output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main feature is the dynamic interpretation of symbols by assimilating their Unicode names. This allows the programmer to add many combinations of functions into a single character with easy understanding and review of the resulted behavior. For example, the code:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;can be simplified to just:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;⁙&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The list of current tested characters is small, although it will be extended over time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That's the reason I'm here: to gather help from Code Golf lovers to test JAEL into &lt;em&gt;production&lt;/em&gt;, competing in challenges and finding new ways to improve the language. There are many functions yet to be defined, but I need some help to give priorities according to what is more frequently used and required.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because of its characteristics, JAEL has it's best performance over mathematical challenges that require many small calculations over single numbers. I'm still working on calculations over lists and grouping functions, but it's not a priority right now.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I need to collect data about usage in real competitions until November 18th, when I'll be publishing my monography. I hope you can help me until that. Any critics and suggestions are appreciated, about anything (Documentation, features, etc).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;EDIT:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After reading your comments, I realized that I had forgotten to finish the documentation and that I had to fix a lot of important features in order to post this. My anxiety to have other users contributing made me skip some steps. I've added some of the missing features. Others are still missing because are not finished yet, like the ability to deal with multiple values from the stack in a single operation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Yes, the five dots program was a really bad example. It does compress a lot but lacks real use in a program. It's just possible because JAEL does the compression and expansion of symbols automatically, without a manual mapping. Let me show you better examples of how this feature can be better used:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Considering that &lt;strong&gt;^&lt;/strong&gt; is &lt;strong&gt;2&lt;/strong&gt; and &lt;strong&gt;g&lt;/strong&gt; is the exponentiation function, the character &lt;strong&gt;ĝ&lt;/strong&gt; square rises the value on top of the stack.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Multiply by 3: õ&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Divide by 2: û&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Add 1: à&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think you got the idea. So, again, this approach is more appropriate in challenges that deal with this kind of calculation. It is very specific indeed, however, I've got some really good looking results.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another characteristic that I did not mention is that the language was built to be used in challenges that consider the number of characters instead of the byte count as the score. So maybe this website is not the appropriate place to start using it, although I really like it since many users post challenges daily.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thank you very much&lt;/p&gt;&#xA;" OwnerUserId="68590" LastEditorUserId="68590" LastEditDate="2018-11-04T17:41:06.597" LastActivityDate="2018-11-04T17:41:06.597" Title="Need contributions to my new Programming Language" Tags="|discussion|code-golf|languages|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17053" PostTypeId="2" ParentId="2140" CreationDate="2018-11-01T06:56:56.217" Score="7" Body="&lt;h1&gt;Game of Lives&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cellular-automata&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cellular-automata&amp;#39;&quot; rel=&quot;tag&quot;&gt;cellular-automata&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game-of-life&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game-of-life&amp;#39;&quot; rel=&quot;tag&quot;&gt;game-of-life&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, your goal is to create a GOL (Game of Life) pattern that creates the most live cells after &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; steps. The twist is, you will be competing against 3 other patterns on the same playing field at the same time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are the rules of the Game of Life, with a couple of additions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each player's starting living cells will be a specific colour.&lt;/li&gt;&#xA;&lt;li&gt;Any live cell with 2 or 3 live neighbours will stay alive, otherwise they'll die&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Note that 'neighbours' includes diagonals, so there are 8 possible neighbours for a cell.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Any dead cell with exactly three neighbours will become a live cell with the colour of the most common neighbouring cell. If there is no majority, it will become a neutral colour, which won't count for further conversions.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;2 Reds + 1 Blue = Red&lt;/li&gt;&#xA;&lt;li&gt;Red + Blue + Green = Neutral&lt;/li&gt;&#xA;&lt;li&gt;2 Neutrals + Red = Red&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The playing field will be &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; by &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;, where each quarter of the field is each player's starting configuration.&lt;/li&gt;&#xA;&lt;li&gt;Cells outside the playing field will always be considered as &lt;em&gt;dead&lt;/em&gt;, and cannot be resurrected.&lt;/li&gt;&#xA;&lt;li&gt;Each starting configuration will be flipped and rotated so the right and bottom sides face the enemy.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For example, if your submission was:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/i5ic6.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/i5ic6.png&quot; alt=&quot;Start corner&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And you plotted them against one another, the starting configuration could be:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/P5qEt.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/P5qEt.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note how the bottom right isn't symmetrical, but still has the correct sides facing inwards.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your submission should be a &lt;span class=&quot;math-container&quot;&gt;\$x/2\$&lt;/span&gt; by &lt;span class=&quot;math-container&quot;&gt;\$x/2\$&lt;/span&gt; GOL pattern that assumes it is in the top left corner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rounds will be run until only one competitor remains or the whole pattern repeats, where the competitor with the most cells when the pattern repeats is the winner.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sandbox:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I haven't decided yet what sizes the playing field should be (&lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;), nor how long each game should run (&lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;).&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I was thinking about a 128 by 128 playing field, with 64 by 64 for each player. Is that too large or too small? For reference, the submission would be the size of:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/F8vZv.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/F8vZv.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&#xA;with some gliders and stuff for reference. Is that too many or too little? I haven't really got much reference.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;I am working on a visual controller like the &lt;a href=&quot;https://codegolf.stackexchange.com/q/135102&quot;&gt;Formic Functions question&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Overall winner? Check all combinations (way too much time as more submissions are added)? Tournament structure (multiple rounds per elimination)?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76162" LastEditorUserId="76162" LastEditDate="2019-09-24T04:52:37.060" LastActivityDate="2019-09-24T04:52:37.060" CommentCount="24" ContentLicense="CC BY-SA 4.0" />
  <row Id="17055" PostTypeId="2" ParentId="17051" CreationDate="2018-11-01T18:30:40.383" Score="4" Body="&lt;h3&gt;Your language isn't compelling as-documented&lt;/h3&gt;&#xA;&lt;p&gt;I've read all the documentation currently available on GitHub, and the language appears to have many undocumented features, and those undocumented features include the things that make it unique. Right now the only documented capabilities I can find are basic math in an interactive environment. I can't even find an explanation for how to access input. Thus, at the moment, the language isn't easy to use, isn't going to be very effective for golfing, doesn't require that you think about problems in a unique way, and doesn't offer any special features that might make it especially suited to certain challenges.&lt;/p&gt;&#xA;&lt;p&gt;If you want people to use this language, you need to provide information about what makes it more useful than a 4-function calculator, and about how to access that usefulness. For example, you indicated that the language in some way interprets &amp;quot;⁙&amp;quot; as &amp;quot;.....&amp;quot;, but I can find no description as to what logic is used for that expansion in order to apply that logic to further unicode characters, nor can I even find a description for what &amp;quot;.....&amp;quot; does or why I would want to access it as a single character.&lt;/p&gt;&#xA;&lt;p&gt;(in addition to all of that there's the issue raised in the comments that &amp;quot;⁙&amp;quot; is a 3 byte character so only saves a little, but &amp;quot;how JAEL counts bytes&amp;quot; is another thing not explained so I think that's less important)&lt;/p&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-11-01T18:30:40.383" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17056" PostTypeId="2" ParentId="2140" CreationDate="2018-11-01T22:32:16.293" Score="2" Body="&lt;h1&gt;Implement LogiMuxi &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;The language&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;LogiMuxi is, as its name suggests, a programming language based on &lt;a href=&quot;https://en.wikipedia.org/wiki/Multiplexer&quot; rel=&quot;nofollow noreferrer&quot;&gt;multiplexers&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Built-in gates&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;M(A,B,C)&lt;/code&gt; (&lt;strong&gt;Multiplexer&lt;/strong&gt;): If &lt;code&gt;A&lt;/code&gt; is &lt;code&gt;0&lt;/code&gt;, returns is &lt;code&gt;B&lt;/code&gt;, otherwise returns &lt;code&gt;C&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;R()&lt;/code&gt; (&lt;strong&gt;Random&lt;/strong&gt;): Returns either &lt;code&gt;0&lt;/code&gt; or &lt;code&gt;1&lt;/code&gt; uniformly randomly.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;I()&lt;/code&gt; (&lt;strong&gt;Input&lt;/strong&gt;): Reads a bit from STDIN and returns it. Terminates program execution on EOF.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;O(A)&lt;/code&gt; (&lt;strong&gt;Output&lt;/strong&gt;): Appends bit &lt;code&gt;A&lt;/code&gt; to STDOUT and returns it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Literals&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;0&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt; are literals. Literals are expressions, and can be used as values.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Gate calling&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;G(&amp;lt;arg1&amp;gt;,&amp;lt;arg2&amp;gt;,...,&amp;lt;argx&amp;gt;)&lt;/code&gt; calls gate &lt;code&gt;G&lt;/code&gt; with the provided arguments in order. Gate calling is an expression.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Conditional loop&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;G&#xA; &amp;lt;cmd1&amp;gt;&#xA; &amp;lt;cmd2&amp;gt;&#xA; &amp;lt;...&amp;gt;&#xA; &amp;lt;cmdx&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Evaluates &lt;code&gt;G&lt;/code&gt;. If &lt;code&gt;G&lt;/code&gt; returns &lt;code&gt;1&lt;/code&gt;, the indented commands are executed, and this process repeats again. If &lt;code&gt;G&lt;/code&gt; returns &lt;code&gt;0&lt;/code&gt;, the loop is skipped. If there are no indented commands under &lt;code&gt;G&lt;/code&gt;, the loop is empty, and, therefore, if &lt;code&gt;G&lt;/code&gt; is &lt;code&gt;0&lt;/code&gt; then nothing happens, while if &lt;code&gt;G&lt;/code&gt; is &lt;code&gt;1&lt;/code&gt; we enter an infinite loop with no way out.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Value assignment&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;X=G&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Assigns &lt;code&gt;X&lt;/code&gt; to the result of &lt;code&gt;G&lt;/code&gt;. After that, the identifier of the variable can be used as an expression, and it will evaluate to the current value of the variable.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Gate definition&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;G(&amp;lt;arg1&amp;gt;,&amp;lt;arg2&amp;gt;,...,&amp;lt;argx&amp;gt;)&#xA; &amp;lt;cmd1&amp;gt;&#xA; &amp;lt;cmd2&amp;gt;&#xA; &amp;lt;...&amp;gt;&#xA; &amp;lt;cmdx&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Defines gate &lt;code&gt;G&lt;/code&gt; to take arguments &lt;code&gt;&amp;lt;arg1&amp;gt;&lt;/code&gt; up to &lt;code&gt;&amp;lt;argx&amp;gt;&lt;/code&gt; (actual argument identifiers are specified by the programmer) and return the result of &lt;code&gt;H&lt;/code&gt;. The identifiers of the arguments are localized, as well as variables assigned inside the gate. This means that, if I assign variable &lt;code&gt;X&lt;/code&gt; to value &lt;code&gt;A&lt;/code&gt; outside of &lt;code&gt;G&lt;/code&gt; and then there's an &lt;code&gt;X=B&lt;/code&gt; command in the definition of &lt;code&gt;G&lt;/code&gt;, calling &lt;code&gt;G&lt;/code&gt; will not assign &lt;code&gt;X&lt;/code&gt; to &lt;code&gt;B&lt;/code&gt;. However, inside the gate's scope, &lt;code&gt;X&lt;/code&gt; will take the new value &lt;code&gt;B&lt;/code&gt;. Assigning the arguments themselves to new values is allowed. Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;X=0&#xA;G(A,B)&#xA; X=1&#xA; O(X)&#xA; :M(R(),A,B)&#xA;O(X)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This will output the bits &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt; in order. For reference, &lt;code&gt;G&lt;/code&gt; chooses randomly between &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt; in this example.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Gate definitons may also be nested, in which case they will be localized too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Returning happens by prepending a &lt;code&gt;:&lt;/code&gt; (colon) to a value (e.g. to return value &lt;code&gt;A&lt;/code&gt;, use command &lt;code&gt;:A&lt;/code&gt;). This will exit the gate and return the value to the right of it. You can't leave the part to the right of &lt;code&gt;:&lt;/code&gt; empty. A gate that doesn't return is invalid.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Additional notes&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Commands are separated by line separators.&lt;/li&gt;&#xA;&lt;li&gt;An identifier has to meet these criteria:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first character has to be in &lt;code&gt;ABCDEFGHIJKLMNOPQRSTUVWXYZ_&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;From the second character onward, the identifier must only be composed of characters in &lt;code&gt;ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;It can't be the identifier of any of the built-in gates.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;A variable and a gate may use the same identifier. They can be separated by the way they are invoked. Of course, this is bad practice, but this language is already pretty esoteric. ;-)&lt;/li&gt;&#xA;&lt;li&gt;Use of an undefined identifier is invalid.&lt;/li&gt;&#xA;&lt;li&gt;A gate is always to be called with parentheses, even if it doesn't take arguments. This includes the built-in gates.&lt;/li&gt;&#xA;&lt;li&gt;A gate may only return one output, and it must return one.&lt;/li&gt;&#xA;&lt;li&gt;Nested loops or gates are represented with the appropriate number of spaces used as indentation.&lt;/li&gt;&#xA;&lt;li&gt;Useless indentation is prohibited.&lt;/li&gt;&#xA;&lt;li&gt;Lines may be empty, but their indentation is significant. Empty lines do nothing.&lt;/li&gt;&#xA;&lt;li&gt;Calling gates with the wrong number of arguments is invalid.&lt;/li&gt;&#xA;&lt;li&gt;If the number of bits sent to STDOUT isn't a multiple of 8, the bits are post-padded with &lt;code&gt;0&lt;/code&gt;s (e.g. if STDOUT is &lt;code&gt;00010000 11100&lt;/code&gt;, it will be converted to &lt;code&gt;00010000 11100000&lt;/code&gt; before actual printing).&lt;/li&gt;&#xA;&lt;li&gt;If 8 bits have been sent to STDOUT, they will be converted to a character and output immediately.&lt;/li&gt;&#xA;&lt;li&gt;Any syntax not defined above should be considered undefined.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Reference gates&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;You may skip this section.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;NOT:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;NOT(A)&#xA; :M(A,1,0)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;AND:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;AND(A,B)&#xA; :M(A,0,B)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;OR:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;OR(A,B)&#xA; :M(A,B,1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;XOR:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;XOR(A,B)&#xA; :M(A,B,M(B,1,0))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;NAND:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;NAND(A,B)&#xA; :M(A,1,M(B,1,0))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;NOR:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;NOR(A,B)&#xA; :M(A,M(B,1,0),0)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;XNOR:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;XNOR(A,B)&#xA; :M(A,M(B,1,0),B)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Simplification tips&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;You may skip this section.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;M(A,0,1)&lt;/code&gt; → &lt;code&gt;A&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;M(M(A,1,0),B,C)&lt;/code&gt; → &lt;code&gt;M(A,C,B)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;M(0,B,C)&lt;/code&gt; → &lt;code&gt;B&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;M(1,B,C)&lt;/code&gt; → &lt;code&gt;C&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sample programs&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;You may skip this section.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Infinite loop, no output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Cat:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA; O(I())&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Hello, World!:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;O(0)&#xA;O(1)&#xA;O(0)&#xA;O(0)&#xA;O(1)&#xA;O(0)&#xA;O(0)&#xA;O(0)&#xA;O(0)&#xA;O(1)&#xA;O(1)&#xA;O(0)&#xA;O(0)&#xA;O(1)&#xA;O(0)&#xA;O(1)&#xA;O(0)&#xA;O(1)&#xA;O(1)&#xA;O(0)&#xA;O(1)&#xA;O(1)&#xA;O(0)&#xA;O(0)&#xA;O(0)&#xA;O(1)&#xA;O(1)&#xA;O(0)&#xA;O(1)&#xA;O(1)&#xA;O(0)&#xA;O(0)&#xA;O(0)&#xA;O(1)&#xA;O(1)&#xA;O(0)&#xA;O(1)&#xA;O(1)&#xA;O(1)&#xA;O(1)&#xA;O(0)&#xA;O(0)&#xA;O(1)&#xA;O(0)&#xA;O(1)&#xA;O(1)&#xA;O(0)&#xA;O(0)&#xA;O(0)&#xA;O(0)&#xA;O(1)&#xA;O(0)&#xA;O(0)&#xA;O(0)&#xA;O(0)&#xA;O(0)&#xA;O(0)&#xA;O(1)&#xA;O(0)&#xA;O(1)&#xA;O(0)&#xA;O(1)&#xA;O(1)&#xA;O(1)&#xA;O(0)&#xA;O(1)&#xA;O(1)&#xA;O(0)&#xA;O(1)&#xA;O(1)&#xA;O(1)&#xA;O(1)&#xA;O(0)&#xA;O(1)&#xA;O(1)&#xA;O(1)&#xA;O(0)&#xA;O(0)&#xA;O(1)&#xA;O(0)&#xA;O(0)&#xA;O(1)&#xA;O(1)&#xA;O(0)&#xA;O(1)&#xA;O(1)&#xA;O(0)&#xA;O(0)&#xA;O(0)&#xA;O(1)&#xA;O(1)&#xA;O(0)&#xA;O(0)&#xA;O(1)&#xA;O(0)&#xA;O(0)&#xA;O(0)&#xA;O(0)&#xA;O(1)&#xA;O(0)&#xA;O(0)&#xA;O(0)&#xA;O(0)&#xA;O(1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;1-bit half adder:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A=I()&#xA;B=I()&#xA;O(M(A,0,B))&#xA;O(M(A,B,M(B,1,0)))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Challenge rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may assume you'll not receive an invalid program, or a program with input that will make it do invalid actions, so you don't need to check it for validity.&lt;/li&gt;&#xA;&lt;li&gt;The program can be either separated by line separators, or given as a list of lines. Acceptable line separators are &lt;code&gt;\n&lt;/code&gt;, &lt;code&gt;\r\n&lt;/code&gt; and &lt;code&gt;\r&lt;/code&gt; (&lt;code&gt;\n&lt;/code&gt; denotes character 0x0A, &lt;code&gt;\r&lt;/code&gt; denotes character 0x0D).&lt;/li&gt;&#xA;&lt;li&gt;Input can be taken in any reasonable form explicitly separated from the program, not necessarily from STDIN. Also, it can either be the actual input, or its bits (e.g. you can take &lt;code&gt;0100000001000001&lt;/code&gt; instead of &lt;code&gt;@A&lt;/code&gt;). It's guaranteed to be finite for this challenge.&lt;/li&gt;&#xA;&lt;li&gt;Output can be provided in any reasonable form, either as bits or as text. Also, you don't actually need to output while the program is executing, unlike what the specification above says.&lt;/li&gt;&#xA;&lt;li&gt;You may use any four distinct identifiers for the built-in gates &lt;code&gt;M&lt;/code&gt;, &lt;code&gt;R&lt;/code&gt;, &lt;code&gt;I&lt;/code&gt; and &lt;code&gt;O&lt;/code&gt;. Identifier rules will apply to your chosen identifiers in this case.&lt;/li&gt;&#xA;&lt;li&gt;You may use &lt;code&gt;[]&lt;/code&gt; instead of &lt;code&gt;()&lt;/code&gt;, and/or tabs instead of spaces in indentation. You must be consistent with these choices.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2018-11-08T20:41:46.880" LastActivityDate="2018-11-08T20:41:46.880" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17061" PostTypeId="2" ParentId="2140" CreationDate="2018-11-04T18:45:16.420" Score="0" Body="&lt;p&gt;Concentration (or Memory or Match) is a game where players pick pairs of cards and try to find matches.  The rules are as follows:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Two of each number from 1 to N are added to the deck.&lt;/li&gt;&#xA;&lt;li&gt;The deck is shuffled and placed face-down (hidden).&lt;/li&gt;&#xA;&lt;li&gt;The player selects a card.  The card is revealed. &lt;/li&gt;&#xA;&lt;li&gt;The player selects another card:  The card is revealed.&lt;/li&gt;&#xA;&lt;li&gt;If the two cards are different numbers, then they are hidden again.&lt;/li&gt;&#xA;&lt;li&gt;Steps 3 through 5 are repeated until all cards are revealed.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;For example, lets say I have the following cards: &lt;code&gt;1 1 2 2 3 3 4 4&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Shuffle them: &lt;code&gt;1 4 3 1 4 3 2 2&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Place them face down: &lt;code&gt;X X X X X X X X&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The player will then select a card: &lt;code&gt;1 X X X X X X X&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And then another card: &lt;code&gt;1 X 3 X X X X X&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The numbers don't match, so we put the cards face down, and select another card: &lt;code&gt;X X X 1 X X X X&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The player remembers the position of the other 1: &lt;code&gt;1 X X 1 X X X X&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A match was found! These cards stay face-up, and we try again.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The challenge is to do this with limited memory&lt;/strong&gt;.  You need to write a function/program that takes two parameters:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A list of cards (with a constant value representing the hidden cards)&lt;/li&gt;&#xA;&lt;li&gt;32 bytes of data.  This can be stored as a string, a large integer, etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your function must use this data (and only this data) to select the next card to reveal, and then update the 32 bytes of data.  You may use a random number generator for free (as long as you do not use the seed to store data)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After the game is over, the game is scored by counting the number of times a card was revealed.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Below, I have provided a list of test cases.  Your score is the length of the first test case you complete with a score of greater than 2N+30 (N is the number of distinct cards).  Hard coding is not allowed, and your function should get a similar score with a different set of test cases.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2 1 4 0 0 3 3 4 2 1&#xA;3 0 4 3 2 0 4 1 1 2&#xA;1 3 2 2 4 3 0 4 0 1&#xA;2 2 0 4 4 1 1 3 3 0&#xA;3 2 1 1 0 0 4 3 4 2&#xA;3 2 0 4 2 5 1 1 0 3 5 4&#xA;4 5 0 3 2 5 3 1 0 2 1 4&#xA;4 1 2 0 2 5 1 3 3 5 0 4&#xA;2 3 2 4 3 1 0 5 4 0 1 5&#xA;3 1 4 0 2 2 5 3 1 5 4 0&#xA;1 4 0 5 2 3 6 1 0 3 5 4 6 2&#xA;6 3 5 3 1 2 1 5 2 4 4 6 0 0&#xA;5 6 0 0 5 3 1 1 2 4 6 2 4 3&#xA;1 1 6 2 2 4 0 4 5 5 6 0 3 3&#xA;3 4 6 4 6 2 5 0 0 1 3 5 2 1&#xA;3 2 6 4 1 5 7 4 3 7 0 2 6 0 1 5&#xA;7 3 1 0 6 2 3 6 4 1 5 7 5 0 4 2&#xA;2 6 5 4 2 5 0 0 7 3 1 4 6 7 3 1&#xA;4 7 5 0 6 3 0 1 3 1 7 2 6 4 2 5&#xA;4 7 5 1 4 3 2 6 0 6 7 3 2 5 1 0&#xA;7 6 5 4 5 0 1 3 8 3 4 0 1 8 6 2 2 7&#xA;2 4 1 8 7 4 6 5 3 8 1 3 7 2 0 6 5 0&#xA;6 4 7 8 5 1 4 3 0 8 3 5 2 6 1 2 7 0&#xA;3 8 0 6 4 0 1 5 2 7 7 1 5 3 2 6 8 4&#xA;7 1 8 8 3 1 3 4 5 4 6 2 2 0 0 7 6 5&#xA;9 4 1 5 7 3 4 1 6 3 9 7 2 2 0 5 6 0 8 8&#xA;2 2 6 1 8 6 5 7 3 4 5 0 9 3 0 9 7 4 8 1&#xA;7 4 3 5 2 7 1 1 0 0 9 8 6 8 3 6 2 9 4 5&#xA;1 6 3 2 7 0 7 9 1 5 0 4 8 6 3 8 9 5 2 4&#xA;8 4 5 9 9 3 0 5 6 2 2 7 0 4 1 8 7 1 3 6&#xA;1 7 0 2 1 3 8 8 6 9 2 3 4 5 6 5 10 4 7 10 0 9&#xA;3 5 10 3 5 1 9 10 1 2 0 4 0 8 6 7 8 4 9 2 6 7&#xA;9 1 7 8 2 8 9 10 2 0 6 6 5 3 5 1 10 0 4 7 3 4&#xA;7 8 2 9 8 0 0 9 3 1 5 2 4 1 3 10 4 10 5 6 6 7&#xA;3 7 9 5 1 2 8 6 3 6 4 0 10 1 2 7 10 9 8 4 5 0&#xA;7 6 9 6 2 5 5 0 11 9 3 10 8 3 4 8 4 2 11 1 1 10 7 0&#xA;10 2 8 5 11 3 4 2 6 11 4 7 10 9 8 9 1 1 6 0 5 7 3 0&#xA;4 0 7 7 4 6 11 8 3 9 3 2 5 1 11 10 8 2 9 5 0 10 1 6&#xA;10 8 8 0 0 3 7 4 11 10 9 2 4 5 6 9 5 6 7 1 1 11 3 2&#xA;1 7 0 8 9 10 4 5 10 6 5 1 4 3 7 2 0 9 3 11 8 2 6 11&#xA;3 7 10 11 1 5 10 2 9 3 8 11 5 9 6 0 0 4 12 12 4 8 1 6 2 7&#xA;0 11 9 11 2 9 10 6 5 2 7 0 12 1 10 7 6 8 3 3 4 1 12 5 8 4&#xA;3 9 5 12 1 6 8 10 2 4 11 3 6 8 9 1 10 12 7 0 11 0 5 4 7 2&#xA;1 7 11 9 0 2 6 6 5 0 8 3 10 8 7 12 3 9 12 4 2 4 11 1 5 10&#xA;8 4 9 0 7 3 1 3 9 6 11 6 8 2 12 10 2 12 5 5 0 1 10 7 4 11&#xA;13 4 13 4 1 2 9 8 10 7 3 12 2 0 5 6 0 5 8 6 9 12 11 10 1 7 3 11&#xA;13 0 0 6 1 4 11 3 12 9 2 10 9 2 7 8 12 5 7 6 11 4 10 1 5 3 13 8&#xA;13 10 3 6 12 1 0 8 5 6 3 11 4 9 2 9 8 11 12 2 5 7 7 1 4 10 0 13&#xA;7 4 11 8 10 1 6 0 3 10 6 0 8 2 11 5 3 1 7 13 9 13 12 9 4 2 5 12&#xA;13 5 7 6 1 12 8 2 8 0 5 7 10 6 4 11 12 1 2 10 3 13 11 3 0 9 9 4&#xA;9 2 4 3 7 4 2 7 10 5 13 6 5 12 8 11 0 8 14 11 0 6 1 9 3 13 14 1 10 12&#xA;8 14 8 7 11 7 2 12 4 5 13 6 1 3 5 0 1 4 9 0 10 2 11 12 13 6 3 14 10 9&#xA;4 9 5 1 5 10 2 11 2 9 13 10 3 13 12 8 7 1 6 8 14 0 4 12 14 11 3 7 6 0&#xA;5 10 4 3 2 4 2 3 9 13 14 6 0 11 5 13 12 8 0 9 7 8 6 11 14 1 12 10 1 7&#xA;11 1 10 8 0 12 9 1 7 4 4 12 6 8 14 5 10 5 14 0 11 3 7 9 2 2 3 13 6 13&#xA;0 8 15 6 4 1 9 8 14 13 2 11 4 6 9 14 0 2 3 5 1 15 5 10 13 12 3 7 12 7 10 11&#xA;13 3 4 13 2 12 9 1 5 1 6 7 11 9 10 0 15 14 12 15 14 8 7 3 4 5 8 11 0 2 10 6&#xA;6 1 7 9 3 1 15 7 5 14 9 14 0 8 10 0 4 12 12 13 3 6 11 4 15 2 11 5 2 13 8 10&#xA;2 0 14 7 13 13 15 7 3 8 15 5 10 12 4 5 3 14 9 6 12 10 9 11 8 6 1 1 4 11 2 0&#xA;3 13 12 4 10 13 8 0 7 11 11 6 8 1 12 5 5 9 6 10 14 3 2 9 14 4 1 15 15 7 0 2&#xA;16 12 7 14 13 5 5 4 11 0 0 9 12 15 15 9 14 2 6 3 11 8 16 10 6 13 3 1 2 8 1 7 10 4&#xA;5 5 10 4 9 15 0 11 11 1 13 15 9 0 3 1 16 6 8 7 2 6 8 2 14 14 16 4 3 12 12 13 10 7&#xA;0 6 7 4 12 16 0 3 6 1 7 12 8 13 15 9 2 11 2 15 11 10 5 13 14 5 9 14 3 8 4 16 1 10&#xA;8 0 1 2 16 11 3 2 15 4 15 5 14 9 13 7 14 9 10 12 11 12 16 6 13 6 1 5 10 0 7 8 4 3&#xA;9 16 15 13 11 2 5 6 16 3 9 4 10 14 14 12 8 11 0 6 0 15 10 7 13 5 1 12 3 4 2 1 7 8&#xA;11 15 14 3 8 12 17 15 1 0 12 6 9 0 9 13 11 14 16 2 4 5 13 16 10 7 8 5 10 4 17 3 6 7 1 2&#xA;11 14 5 7 14 0 12 4 8 12 11 13 16 16 15 6 3 1 8 3 1 5 7 17 10 2 17 13 15 9 9 4 2 0 6 10&#xA;15 13 6 12 5 4 9 2 11 2 13 16 3 9 1 16 10 11 1 12 14 17 8 0 17 6 8 10 5 0 7 4 14 7 3 15&#xA;0 9 13 15 8 11 6 5 9 16 11 7 14 7 5 15 3 12 4 16 2 14 3 0 1 10 13 1 6 10 17 2 17 8 4 12&#xA;10 13 14 10 5 7 16 8 8 7 6 3 0 2 17 17 2 1 15 16 3 4 5 0 12 9 1 12 14 11 13 9 15 6 4 11&#xA;7 14 0 13 15 6 12 1 14 16 10 15 8 11 0 9 2 3 4 18 12 17 8 13 9 6 4 11 5 1 5 16 17 3 18 10 7 2&#xA;12 9 17 2 7 12 4 15 13 0 17 9 11 3 6 4 8 5 11 16 8 1 7 0 13 15 16 10 3 14 18 2 14 1 10 6 18 5&#xA;4 0 5 14 7 8 1 0 12 15 11 2 11 5 3 9 15 17 6 8 7 10 12 3 6 16 2 18 16 13 4 14 9 17 13 18 1 10&#xA;13 13 18 9 0 17 12 17 8 0 14 16 14 6 10 6 9 15 1 15 2 4 11 5 1 3 4 3 11 2 5 16 8 7 10 7 18 12&#xA;18 11 13 6 14 9 13 14 9 18 17 11 0 1 17 2 0 6 10 3 8 4 1 5 15 7 5 2 12 15 4 8 7 16 10 12 3 16&#xA;0 17 5 6 19 0 11 1 7 18 9 14 16 2 16 13 1 4 3 17 15 7 10 2 15 9 18 13 8 14 6 12 5 10 3 8 11 19 12 4&#xA;4 3 10 12 2 7 9 11 0 16 16 7 19 2 13 3 12 10 5 18 4 15 15 0 11 19 18 13 14 1 5 17 6 9 14 8 6 17 8 1&#xA;0 17 16 11 7 19 8 5 17 16 14 1 10 6 11 7 15 10 14 13 15 4 2 4 1 9 6 3 13 18 18 0 19 3 9 12 8 5 2 12&#xA;10 15 10 0 2 14 3 19 1 18 4 14 8 2 5 17 4 11 17 12 13 16 9 3 0 13 7 5 18 6 8 9 12 1 19 16 11 7 6 15&#xA;15 2 16 4 14 0 1 5 12 18 10 12 4 14 16 11 8 7 13 15 11 3 19 10 3 9 17 6 13 19 9 1 0 18 8 2 7 5 17 6&#xA;1 12 17 7 8 8 12 20 5 10 20 16 13 3 18 15 5 4 10 9 6 14 11 6 7 15 16 19 0 1 9 18 19 2 2 3 13 4 17 0 11 14&#xA;7 17 2 12 19 9 0 11 17 4 12 0 10 11 16 14 3 20 7 15 2 9 8 18 16 19 5 3 8 14 6 18 1 13 5 1 4 15 13 10 6 20&#xA;0 18 12 4 20 7 14 5 10 16 1 13 9 15 12 0 6 19 2 5 16 10 1 17 15 11 20 3 14 2 18 3 17 11 7 8 4 8 6 19 13 9&#xA;9 18 15 0 16 7 19 4 13 20 5 10 2 2 0 12 8 6 3 15 16 14 17 7 10 3 13 6 1 20 1 17 19 11 5 4 12 14 11 8 9 18&#xA;13 6 16 11 20 3 10 8 5 7 17 15 14 0 7 6 14 17 4 15 2 12 8 1 13 18 11 10 1 9 20 16 5 19 18 2 12 19 3 9 4 0&#xA;4 5 16 11 2 1 14 9 16 6 20 21 0 13 12 13 7 8 15 11 10 18 14 3 15 5 21 18 12 17 19 9 0 19 7 4 3 20 1 8 2 10 6 17&#xA;10 6 7 0 18 1 19 5 8 12 15 2 5 4 11 20 16 17 13 14 17 1 16 9 21 21 0 3 6 3 2 7 8 13 19 20 14 15 9 11 10 4 18 12&#xA;2 20 12 21 10 4 8 11 13 3 20 1 6 21 12 13 4 17 19 16 17 15 14 9 16 9 5 10 8 6 11 18 1 5 2 18 0 0 3 7 19 14 15 7&#xA;16 0 17 8 11 6 3 18 9 16 14 20 12 12 10 1 14 1 10 21 4 19 0 2 13 3 15 17 21 9 6 18 2 20 4 11 7 19 5 8 7 5 13 15&#xA;3 4 4 10 0 3 16 14 19 8 17 9 5 9 6 12 7 13 13 1 15 0 5 20 2 7 1 17 21 11 11 18 20 6 15 16 2 12 14 19 8 10 18 21&#xA;12 11 7 8 8 10 9 18 5 6 15 12 10 0 14 3 6 22 17 15 17 21 14 16 9 4 18 13 1 11 4 20 3 19 22 1 13 7 21 5 0 20 2 2 16 19&#xA;2 20 10 17 6 0 21 10 19 4 12 8 0 7 18 15 17 18 9 4 2 14 1 5 14 6 16 22 13 11 11 15 21 3 7 19 8 9 22 20 3 16 13 1 12 5&#xA;12 11 6 16 18 15 12 11 10 9 8 15 22 5 21 18 20 0 2 19 17 8 10 5 3 14 9 22 20 3 1 21 19 6 0 16 1 13 4 14 2 13 17 4 7 7&#xA;20 5 16 4 17 7 8 15 0 10 9 3 16 13 8 12 1 14 17 11 18 11 2 7 6 1 4 20 3 5 22 22 2 6 13 10 19 15 12 14 18 9 0 19 21 21&#xA;11 1 0 5 7 15 0 12 3 9 6 15 7 13 11 20 9 17 8 4 22 4 10 5 21 18 16 14 13 10 18 12 21 17 16 2 6 22 3 14 19 1 8 19 20 2&#xA;10 10 18 6 4 1 9 6 15 7 7 11 21 13 15 21 22 16 12 20 2 18 3 17 19 14 14 0 16 5 3 4 1 9 13 11 22 20 19 8 5 0 23 17 23 2 8 12&#xA;3 3 19 13 5 10 17 18 4 16 6 2 21 4 12 7 13 8 7 10 6 2 1 15 5 21 23 22 0 11 9 16 20 11 20 23 1 14 18 8 14 19 9 17 0 15 22 12&#xA;14 7 15 20 19 7 13 0 20 2 18 1 11 21 17 12 16 10 8 3 15 2 22 23 18 16 9 1 3 13 10 19 8 11 6 4 5 22 0 17 21 23 14 4 12 9 6 5&#xA;1 12 15 21 11 21 18 6 4 22 5 23 14 19 13 8 15 7 5 0 8 13 16 4 1 6 12 11 14 18 20 17 9 23 19 3 2 17 9 0 16 7 3 20 10 22 2 10&#xA;23 9 15 10 13 17 17 21 12 18 2 20 3 8 0 16 2 12 6 20 7 19 16 0 8 9 4 6 5 13 18 14 1 19 21 3 22 15 1 4 22 10 5 7 11 14 11 23&#xA;3 21 22 5 19 7 2 24 18 19 9 2 24 14 6 0 12 0 21 18 23 15 8 11 6 4 8 17 16 20 14 16 4 7 10 11 1 9 17 3 23 10 20 5 13 22 13 1 12 15&#xA;13 6 5 22 1 17 2 21 5 0 14 24 19 21 7 19 6 23 12 14 4 9 3 22 15 9 2 16 20 7 13 12 8 23 18 0 15 10 8 24 20 16 3 1 4 11 10 18 17 11&#xA;12 6 19 0 9 14 22 2 13 20 19 9 6 3 21 20 24 0 4 24 1 5 11 15 1 21 8 5 16 16 23 18 7 11 10 17 15 12 3 22 7 10 2 23 17 8 14 4 13 18&#xA;6 22 2 18 16 19 12 0 17 14 23 4 6 17 3 10 4 22 13 9 20 19 0 9 8 1 24 2 23 14 11 5 7 16 13 10 12 8 7 3 20 21 15 5 18 21 11 1 15 24&#xA;18 12 6 22 19 19 9 24 5 14 13 2 22 8 4 16 3 9 18 8 0 10 23 10 2 20 21 5 23 20 1 11 0 17 7 7 17 12 15 3 16 15 13 24 14 4 6 21 11 1&#xA;7 14 19 5 4 17 1 22 23 24 12 1 20 6 24 7 21 10 8 11 20 3 25 13 0 2 16 21 0 6 9 11 4 18 22 2 15 5 18 8 13 12 3 14 23 10 17 9 16 15 25 19&#xA;10 4 1 13 11 24 7 12 15 20 11 0 23 23 5 7 25 25 17 8 20 24 2 22 19 9 12 16 4 6 21 9 17 6 5 15 10 0 18 8 22 2 14 16 3 19 21 18 1 3 13 14&#xA;16 22 3 2 25 21 11 1 10 12 4 15 0 2 13 11 3 14 19 1 18 12 8 23 18 22 9 16 4 0 20 9 17 24 7 10 6 8 23 25 15 7 21 20 19 5 14 13 6 5 17 24&#xA;21 20 8 16 1 18 4 0 14 5 22 3 0 23 22 1 9 4 24 7 21 2 23 15 11 12 14 25 8 12 7 15 13 18 3 19 10 2 5 10 16 24 19 13 6 20 6 9 17 11 17 25&#xA;6 24 17 18 24 22 10 11 20 16 16 3 4 21 23 25 14 1 0 1 7 2 5 13 6 4 10 21 17 14 23 11 9 9 15 25 0 19 19 12 20 22 12 13 15 2 3 8 5 18 8 7&#xA;11 16 25 6 19 5 26 17 24 6 12 4 15 18 21 7 10 5 23 3 13 8 13 23 20 8 11 12 9 22 1 14 21 2 25 10 15 9 0 2 0 26 3 24 17 22 14 4 18 16 20 19 1 7&#xA;26 0 19 3 0 20 1 25 13 3 12 6 20 11 21 13 2 11 23 15 17 15 24 23 10 8 26 5 18 9 16 18 4 9 19 10 14 7 22 17 22 4 16 8 24 2 25 5 14 12 6 21 1 7&#xA;9 25 13 14 19 17 20 2 11 5 19 23 25 21 0 16 8 15 7 16 24 24 3 15 20 10 8 4 0 12 13 22 9 4 26 18 22 2 23 18 3 6 6 12 17 26 21 10 1 11 14 7 5 1&#xA;17 4 20 23 13 0 3 26 25 16 3 2 13 10 8 12 9 5 14 2 26 25 21 23 22 17 7 14 24 1 4 15 19 16 12 5 9 22 1 20 19 7 11 6 21 15 11 18 6 8 18 0 10 24&#xA;14 12 3 17 7 2 19 11 0 21 10 24 4 6 8 8 25 4 6 23 9 1 25 15 12 9 23 10 2 26 1 0 11 7 19 13 18 3 17 13 16 26 20 20 16 15 22 22 18 14 5 24 21 5&#xA;4 15 22 10 27 14 7 0 2 17 3 6 20 18 0 16 21 4 3 11 11 12 23 5 15 22 9 17 2 1 10 18 25 14 27 19 16 23 20 21 6 25 26 24 13 1 24 26 9 13 8 19 8 7 5 12&#xA;3 17 8 9 3 9 23 15 10 25 0 6 26 21 11 12 27 1 11 13 14 2 6 1 20 7 19 24 22 14 22 25 16 17 26 5 24 27 12 13 18 4 23 20 19 4 7 15 21 8 5 16 10 2 0 18&#xA;9 11 14 21 3 12 10 4 14 1 5 18 27 9 6 0 3 19 7 12 17 26 26 25 15 11 16 24 17 18 20 8 7 19 15 1 4 13 22 23 8 25 20 16 22 2 6 0 10 5 2 24 23 21 13 27&#xA;7 23 2 26 5 24 19 17 2 18 11 7 16 5 8 26 24 21 8 14 10 16 18 9 27 1 4 22 15 25 17 4 0 0 21 3 15 12 11 23 19 27 10 13 6 22 3 14 6 13 12 9 20 1 20 25&#xA;17 4 24 21 11 22 12 13 0 1 17 23 15 4 6 2 27 14 3 16 8 13 3 5 2 6 0 9 23 14 25 26 10 18 19 26 8 11 10 20 21 18 22 20 25 9 7 12 1 7 19 16 5 27 15 24&#xA;8 27 28 24 9 9 16 22 13 20 23 25 13 21 0 26 21 8 16 24 27 18 26 23 3 7 3 25 22 15 14 6 5 7 11 4 1 20 17 19 17 12 4 14 2 1 5 18 2 28 12 0 10 19 15 11 6 10&#xA;21 9 3 23 27 4 15 22 12 2 16 26 4 13 28 16 20 6 6 3 10 1 18 5 11 0 21 7 8 25 23 17 9 15 22 14 24 2 5 10 12 17 20 1 24 7 18 0 14 26 19 13 28 25 11 8 27 19&#xA;26 10 19 20 17 10 9 19 7 15 4 27 0 15 18 2 6 2 22 6 12 25 11 9 24 26 5 11 5 21 17 7 8 4 18 14 16 24 28 1 3 28 27 14 12 8 13 13 23 3 16 23 25 21 22 0 1 20&#xA;1 0 19 11 20 17 8 3 2 18 7 18 21 5 26 9 10 6 20 2 28 8 26 19 21 17 16 14 3 14 22 12 13 6 24 9 10 22 0 27 11 13 27 7 15 4 28 1 16 23 25 23 25 12 24 15 4 5&#xA;5 9 12 7 19 25 6 24 12 6 25 3 1 16 28 2 3 14 16 4 5 26 7 8 20 19 18 22 10 27 13 28 21 17 11 26 4 18 0 20 27 24 15 10 23 11 0 21 9 22 13 14 8 1 17 15 23 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2018-11-04T18:52:25.487" LastActivityDate="2018-11-04T18:52:25.487" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17062" PostTypeId="1" AcceptedAnswerId="17071" CreationDate="2018-11-05T05:04:24.960" Score="1" ViewCount="142" Body="&lt;p&gt;In many code-golf Scratch submissions, I see &lt;code&gt;when green flag clicked&lt;/code&gt; used, when &lt;code&gt;when gf clicked&lt;/code&gt; is also valid in scratchblocks2. Is there a reason for this, or is it just because people submit raw conversions?&lt;/p&gt;&#xA;" OwnerUserId="83870" LastEditorUserId="46076" LastEditDate="2019-08-22T20:48:23.880" LastActivityDate="2019-08-22T20:48:23.880" Title="It seems the consensus on Scratch is to use scratchblocks2 syntax, but what about &quot;when green flag clicked&quot;?" Tags="|discussion|code-golf|scoring|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17065" PostTypeId="2" ParentId="2140" CreationDate="2018-11-06T20:24:24.550" Score="-1" Body="&lt;h2&gt;Name: Create a Programming Language&lt;/h2&gt;&#xA;&lt;h2&gt;Tags: code-bowling, and cops-and-robbers&lt;/h2&gt;&#xA;&lt;h1&gt;Cops:&lt;/h1&gt;&#xA;&lt;p&gt;The cops must design a programming language that takes in the contents of the program from a default I/O method, and do something.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program must not print anything to STDERR&lt;/li&gt;&#xA;&lt;li&gt;The program must be able to output to STDOUT with certain program contents of your choice&lt;/li&gt;&#xA;&lt;li&gt;The program must be able to calculate any function up to &lt;span class=&quot;math-container&quot;&gt;\$f_{\omega}(n)\$&lt;/span&gt; where f is the &lt;a href=&quot;https://googology.wikia.com/wiki/Fast-growing_hierarchy&quot; rel=&quot;nofollow noreferrer&quot;&gt;fast-growing hierarchy&lt;/a&gt;. In other words, it needs to be able to evaluate any primitive-recursive statement.&lt;/li&gt;&#xA;&lt;li&gt;There cannot be a way to execute commands in other languages (for example, if there is a command in your programming language that can execute Python code based on the argument, that would be cheating)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Since there are tons of loopholes, whether or not the answer is valid is up to me (and also, standard loopholes are also not allowed).&lt;/p&gt;&#xA;&lt;h1&gt;Robbers:&lt;/h1&gt;&#xA;&lt;p&gt;Your job is to make the same compiler (which does the same thing with the same commands given as the equivalent cop answer), with more characters. The programming language may be different.&lt;/p&gt;&#xA;&lt;p&gt;Standard loopholes aren't allowed, and whether an answer is valid or not will be judged by me.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;As always, since this is code-bowling, aim for the most bytes!&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="83048" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-11-06T20:44:25.370" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17071" PostTypeId="2" ParentId="17062" CreationDate="2018-11-08T05:15:16.700" Score="1" Body="&lt;p&gt;So long as the code works (produces the expected output for the given input) in the implementation you are targetting, it is valid.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2018-11-08T05:15:16.700" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17073" PostTypeId="1" AcceptedAnswerId="17075" CreationDate="2018-11-08T15:40:55.407" Score="-12" ViewCount="185" Body="&lt;p&gt;The users who voted to close this question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/175206/fastest-algorithm-to-output-array-containing-all-integers-in-range-excluding-dup&quot;&gt;Fastest algorithm to output array containing all integers in range excluding duplicate digits&lt;/a&gt; have left no clarification as to what is not clear &lt;em&gt;&lt;strong&gt;to them&lt;/strong&gt;&lt;/em&gt; at the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Kindly explain why it is &lt;em&gt;not&lt;/em&gt; &lt;strong&gt;impossible&lt;/strong&gt; to read the minds of users who voted to close a question citing &quot;unclear what you're asking&quot; where those users who have voted to close the question citing &quot;unclear what you're asking&quot; have made absolutely no attempt to &lt;strong&gt;clarify&lt;/strong&gt; what is not clear &lt;strong&gt;to them&lt;/strong&gt; at the question.&lt;/p&gt;&#xA;" OwnerUserId="31257" LastActivityDate="2018-11-08T18:05:59.433" Title="Kindly explain why it is not impossible to read the minds of users who voted to close a question citing &quot;unclear what you're asking&quot;" Tags="|discussion|close-reasons|" AnswerCount="1" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="17074" PostTypeId="2" ParentId="2140" CreationDate="2018-11-08T15:51:26.957" Score="3" Body="&lt;h1&gt;Recognize the hardest context-free language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grammars&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grammars&amp;#39;&quot; rel=&quot;tag&quot;&gt;grammars&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;A context-free language is a class of strings that can be recognized by a pushdown automaton, or equivalently produced by a BNF grammar.&#xA;In her 1973 &lt;a href=&quot;https://doi.org/10.1137/0202025&quot; rel=&quot;nofollow noreferrer&quot;&gt;paper&lt;/a&gt;, Sheila Greibach showed that there exists in some sense a &quot;maximally complex&quot; context-free language.&#xA;In this challenge, your task is to recognize this language.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The words of the language &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; use the seven characters &lt;span class=&quot;math-container&quot;&gt;\$\mathtt{()[]ABC}\$&lt;/span&gt;.&#xA;You may use any seven printable ASCII characters in their place, but we use these in the explanation and test cases.&#xA;A string &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; is in the language if:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It can be broken into &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; pieces: &lt;span class=&quot;math-container&quot;&gt;\$s = w_1 \mathtt{C} w_2 \mathtt{C} \cdots w_n \mathtt{C}\$&lt;/span&gt; where the &lt;span class=&quot;math-container&quot;&gt;\$w_i\$&lt;/span&gt; do not contain &lt;span class=&quot;math-container&quot;&gt;\$\mathtt{C}\$&lt;/span&gt;s.&lt;/li&gt;&#xA;&lt;li&gt;Each &lt;span class=&quot;math-container&quot;&gt;\$w_i\$&lt;/span&gt; has a substring of the form &lt;span class=&quot;math-container&quot;&gt;\$\mathtt{B} x_i \mathtt{B}\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$x_i\$&lt;/span&gt; does not contain &lt;span class=&quot;math-container&quot;&gt;\$\mathtt{B}\$&lt;/span&gt;s.&lt;/li&gt;&#xA;&lt;li&gt;The concatenation &lt;span class=&quot;math-container&quot;&gt;\$x_1 x_2 \cdots x_n\$&lt;/span&gt; has the form &lt;span class=&quot;math-container&quot;&gt;\$\mathtt{A} b\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; is a balanced string over &lt;span class=&quot;math-container&quot;&gt;\$\mathtt{()[]}\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Note that each &lt;span class=&quot;math-container&quot;&gt;\$w_i\$&lt;/span&gt; may have several substrings that begin and end with &lt;span class=&quot;math-container&quot;&gt;\$\mathtt{B}\$&lt;/span&gt;, but we require that the third condition holds for at least one choice of the &lt;span class=&quot;math-container&quot;&gt;\$x_i\$&lt;/span&gt;.&#xA;Also, some of the &lt;span class=&quot;math-container&quot;&gt;\$x_i\$&lt;/span&gt; may be empty.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is an example of a string in &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; and an explantion for it:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;]BA[]BA[](BCB[]BA]B()(BC]B][BB]BCB)BAAB))C&#xA;           C           C        C        C    Split by C&#xA;     BA[](B B[]B            BB   B)B          Find substring surrounded by B in each part&#xA;      A[](   []                   )           Their interiors give A + balanced string&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here is a BNF grammar for &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt;: [TODO: verify that this is correct]&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;L&amp;gt;        ::= &amp;lt;trash&amp;gt; &quot;BB&quot; &amp;lt;trash&amp;gt; &quot;C&quot; &amp;lt;L&amp;gt;&#xA;             | &amp;lt;trash&amp;gt; &quot;BA&quot; &amp;lt;balanced&amp;gt; &quot;B&quot; &amp;lt;trash&amp;gt; &quot;C&quot;&#xA;&amp;lt;balanced&amp;gt; ::= &amp;lt;skip-c&amp;gt; &amp;lt;balanced&amp;gt;&#xA;             | &quot;(&quot; &amp;lt;balanced&amp;gt; &quot;)&quot;&#xA;             | &quot;[&quot; &amp;lt;balanced&amp;gt; &quot;)&quot;&#xA;             | &amp;lt;balanced&amp;gt; &amp;lt;skip-cs&amp;gt; &amp;lt;balanced&amp;gt; &amp;lt;skip-cs&amp;gt;&#xA;&amp;lt;skip-cs&amp;gt;  ::= &amp;lt;skip-c&amp;gt; &amp;lt;skip-cs&amp;gt; | &quot;&quot;&#xA;&amp;lt;skip-c&amp;gt;   ::= &quot;B&quot; &amp;lt;trash&amp;gt; &quot;C&quot; &amp;lt;trash&amp;gt; &quot;B&quot;&#xA;&amp;lt;trash&amp;gt;    ::= &amp;lt;not-c&amp;gt; &amp;lt;trash&amp;gt; | &quot;&quot;&#xA;&amp;lt;not-c&amp;gt;    ::= &quot;A&quot; | &quot;B&quot; | &quot;(&quot; | &quot;)&quot; | &quot;[&quot; | &quot;]&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;The task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your input is a non-empty string over the alphabet of &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt;.&#xA;As stated above, you may use any 7 printable ASCII characters.&#xA;Your program/function shall do one of the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output a truthy value if the input is in &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt;, and a falsy value if not.&lt;/li&gt;&#xA;&lt;li&gt;Output a consistent value if the input is in &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt;, and a different consistent value if not.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The lowest byte count wins, and other standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;TODO&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="32014" LastActivityDate="2018-11-08T15:51:26.957" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17075" PostTypeId="2" ParentId="17073" CreationDate="2018-11-08T18:05:59.433" Score="8" Body="&lt;h2&gt;It is unclear&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I wasn't one of the voters, but given the current question state I would also vote to close as unclear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've read the challenge description several times and I still don't know what it's asking for. Part of that is the challenge description, which consists only of the first paragraph, is all one run-on sentence. Breaking that out into bullet points could help, or restructuring it to be more than one sentence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Secondly, I don't think that &quot;&lt;em&gt;Do not use standard library functions for permutations or combinatorics.&lt;/em&gt;&quot; is a good fit for the challenge. Depending upon the language, there is a lot of grey area where arguing semantics can come into play. This is a non-observable requirement, and is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10002/42963&quot;&gt;one of the things to avoid&lt;/a&gt; when writing good challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, I'm not convinced that the boundaries of the challenge (up to &lt;code&gt;123456789&lt;/code&gt;, if I'm understanding correctly) will provide a challenging enough scenario to allow for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;. I believe that submissions will likely run into ceilings surrounding startup/shutdown code variations rather than providing enough variations in timing of the actual algorithm. This will either make the challenge less language-agnostic, or will cause submissions to be all within margin of error.&lt;/p&gt;&#xA;" OwnerUserId="42963" LastActivityDate="2018-11-08T18:05:59.433" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="17077" PostTypeId="2" ParentId="2140" CreationDate="2018-11-09T09:15:16.643" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/floating-point&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;floating-point&amp;#39;&quot; rel=&quot;tag&quot;&gt;floating-point&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/logic-gates&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;logic-gates&amp;#39;&quot; rel=&quot;tag&quot;&gt;logic-gates&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Toy floating point coprocessor: ceil&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Summary: implement the ceiling function for 16-bit IEEE 754 floating point numbers in logic gates, using as few gates as you can.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;16-bit IEEE 754 floating point&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;For a more detailed description, see &lt;a href=&quot;https://en.wikipedia.org/wiki/Half-precision_floating-point_format&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia:Half-precision floating-point format&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The 16 bits are divided into three chunks: sign (1 bit), exponent (5 bits), mantissa (10 bits).&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The sign is &lt;code&gt;0&lt;/code&gt; for positive numbers and &lt;code&gt;1&lt;/code&gt; for negative numbers.&lt;/li&gt;&#xA;&lt;li&gt;The exponent is &lt;em&gt;biased&lt;/em&gt;: interpret as an unsigned 5-bit number and subtract 15 to get the true exponent. Special cases are described below.&lt;/li&gt;&#xA;&lt;li&gt;The mantissa is an unsigned 10-bit number with an implicit leading 11th bit which depends on the exponent.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If the exponent is &lt;code&gt;00000&lt;/code&gt; (corresponding to -15), the number is &lt;em&gt;subnormal&lt;/em&gt;. The implicit leading bit of the mantissa is &lt;code&gt;0&lt;/code&gt;, but there's a bonus factor of two, so the interpreted value is &lt;span class=&quot;math-container&quot;&gt;\$(-1)^{\textrm{sign}}\; 2^{-14}\; 0.\textrm{mantissa}\$&lt;/span&gt;, or (expanding the &lt;span class=&quot;math-container&quot;&gt;\$0.\textrm{mantissa}\$&lt;/span&gt; binary notation) &lt;span class=&quot;math-container&quot;&gt;\$(-1)^{\textrm{sign}}\; 2^{-24}\; \textrm{mantissa}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the exponent is &lt;code&gt;11111&lt;/code&gt; (corresponding to 16), the number is either &lt;em&gt;infinite&lt;/em&gt; (if the mantissa is &lt;code&gt;0000000000&lt;/code&gt;) or a NaN.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For all other exponents, the implicit leading bit of the mantissa is &lt;code&gt;1&lt;/code&gt;, so the interpreted value is &lt;span class=&quot;math-container&quot;&gt;\$(-1)^{\textrm{sign}}\; 2^{\textrm{exponent}-15}\; 1.\textrm{mantissa}\$&lt;/span&gt;, expanded to &lt;span class=&quot;math-container&quot;&gt;\$(-1)^{\textrm{sign}}\; 2^{\textrm{exponent}-25}\; (2^{10} + \textrm{mantissa})\$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Ceiling function&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The ceiling function maps real numbers to integers, rounding up. So if the input value is an integer, the output value is unchanged; if the input value is not an integer, the output value is the smallest integer greater than the input value.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$\begin{array}{c|c}&#xA;x &amp;amp; \textrm{ceil}(x) \\&#xA;\hline&#xA;-1 &amp;amp; -1 \\&#xA;-0.5 &amp;amp; 0 \\&#xA;0 &amp;amp; 0 \\&#xA;0.00001 &amp;amp; 1 \\&#xA;1 &amp;amp; 1 \\&#xA;1.8 &amp;amp; 2 \\&#xA;\end{array}$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Corner cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given an infinity, the output must be the same infinity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a NaN, the output must be a NaN, but it can be any NaN.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;IEEE 754 floating point systems have signed zeroes. Given a zero, the output must be the same zero.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Gates and scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You must implement a logic gate with 16 inputs and 16 outputs. You may use any two-input logic gates and you may mix different types of logic gates. We idealise the gates: don't worry about things like fan-out limitations or propagation delays. The score is the number of gates, and the fewer the better. If you choose to explain your design by giving code which uses bitwise operation on integers, be sure to document clearly how many bits are being processed by each operation.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;TODO, but will cover both infinities, both signed zeroes, positive and negative subnormals, positive and negative integer values, positive and negative non-integer values, and a NaN.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2018-11-09T09:15:16.643" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17080" PostTypeId="2" ParentId="2140" CreationDate="2018-11-09T21:01:43.673" Score="-2" Body="&lt;h1&gt;Forcing a kernel panic from a mountaintop&lt;/h1&gt;&#xA;&lt;p&gt;This is a thought resulting from a curious incident where C# code opening file apparently caused a BSOD. In the conclusion, it was due to a faulty driver, but from that a thought came up --- can one cause a kernel panic (or BSOD) using managed code exclusively?&lt;/p&gt;&#xA;&lt;h2&gt;Why?&lt;/h2&gt;&#xA;&lt;p&gt;Typically in such environment, there are many compile-time and run-time checks that safeguard the code from doing something that would cause a kernel panic. For a mature managed environment, it &lt;em&gt;should&lt;/em&gt; be impossible to cause the operating system to arrive into a bad state. In the case, though it was C# code, the fact that a faulty driver was involved breached the walled garden. But can we breach it from within?&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The code must be managed in some fashion (e.g. Java, C#, VB.NET), and normally comes with both compile-time and run-time checks.&lt;/li&gt;&#xA;&lt;li&gt;The code should be running in a virtual machine or equivalent. (e.g. Java's JVM or .NET's AppDomain)&lt;/li&gt;&#xA;&lt;li&gt;The code should NOT rely on any external anything. No extern declarations, no networking, no dodgy APIs.&lt;/li&gt;&#xA;&lt;li&gt;The code should NOT use any construct which allow direct access to resources (e.g. &lt;code&gt;unsafe&lt;/code&gt; in C#)&lt;/li&gt;&#xA;&lt;li&gt;The code should use only the native libraries &amp;amp; API available as part of its usual environment.&lt;/li&gt;&#xA;&lt;li&gt;Throwing an exception is not sufficient. To qualify, the code must result in a kernel panic.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Criteria&lt;/h2&gt;&#xA;&lt;p&gt;Essentially a &lt;code&gt;code-golf&lt;/code&gt; -&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The less code to kernel panic, the better&lt;/li&gt;&#xA;&lt;li&gt;The fewer dependencies the code uses to make it happen, the better&lt;/li&gt;&#xA;&lt;li&gt;The code that consistently causes a kernel panic is better than one that only does it sometimes&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="83945" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-11-09T21:18:19.417" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17081" PostTypeId="2" ParentId="2140" CreationDate="2018-11-10T02:11:02.413" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/175875/72535&quot;&gt;Calculate your Icy Score&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="72535" LastEditorUserId="72535" LastEditDate="2018-11-13T18:15:48.497" LastActivityDate="2018-11-13T18:15:48.497" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17084" PostTypeId="1" CreationDate="2018-11-10T14:26:58.800" Score="1" ViewCount="114" Body="&lt;blockquote&gt;&#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;Are submissions acceptable if their worst case score is unbounded?&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I think it worth a default exist&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2018-11-12T14:08:24.213" Title="Are infinite score allowed by default for &quot;lowest score win&quot;?" Tags="|discussion|defaults|code-challenge|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17085" PostTypeId="2" ParentId="17084" CreationDate="2018-11-10T15:05:35.080" Score="2" Body="&lt;h1&gt;No, unless explicitly allowed.&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;(Intuitively) it's quite unnatural to think about infinite score.&lt;/li&gt;&#xA;&lt;li&gt;It's uncommon to have infinite score, anyway. (for example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; answers don't have infinite score)&lt;/li&gt;&#xA;&lt;li&gt;There may be different &quot;types&quot; of infinities.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;However, challenge posters may say that&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If an answer has the property XYZ, its score is considered to be infinite. All infinite-scored submissions are equal.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;(there may be some tie-breakers, depends on the challenge)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If an answer has the property XYZ, then instead consider the asymptotic complexity of the score when [...]. Solutions with lower asymptotic complexity are better.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;etc.&lt;/p&gt;&#xA;" OwnerUserId="69850" LastActivityDate="2018-11-10T15:05:35.080" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17086" PostTypeId="2" ParentId="2140" CreationDate="2018-11-10T16:34:20.257" Score="1" Body="&lt;h1&gt;Minimize your standard deviation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The standard deviation of a collection of numbers is calculated in the following manner:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Find the arithmetic mean of the collection.&lt;/li&gt;&#xA;&lt;li&gt;Find the difference of each item from the mean.&lt;/li&gt;&#xA;&lt;li&gt;Square each difference and sum them.&lt;/li&gt;&#xA;&lt;li&gt;Divide by the number of items in the collection minus 1.&lt;/li&gt;&#xA;&lt;li&gt;Take the square root.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Or, expressed mathematically:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$ s = \sqrt{ \frac{ \sum^N_{i=1} (x_i - \bar x)^2 }{N - 1} }, $$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;where &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; is the number of items, &lt;span class=&quot;math-container&quot;&gt;\$x_i\$&lt;/span&gt; is the &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt;th item, and &lt;span class=&quot;math-container&quot;&gt;\$\bar x\$&lt;/span&gt; is the arithmetic mean.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to write a program or function in your language of choice that, given an array of bytes, calculates the standard deviation of the array. The catch: the standard deviation of the bytes in your code will be added to your score.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input may be in any reasonable format (e.g. numbers separated by newlines or commas, an actual array or buffer, etc.)&lt;/li&gt;&#xA;&lt;li&gt;You may assume that the items in the input are all integers &lt;span class=&quot;math-container&quot;&gt;\$0 \le n &amp;lt; 256\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that there are at least two integers in the input.&lt;/li&gt;&#xA;&lt;li&gt;The output or return value must be the standard deviation of the array as calculated above, accurate to at least 2 decimal places (i.e. &lt;span class=&quot;math-container&quot;&gt;\$ \pm 0.005 \$&lt;/span&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(test cases to come)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The score of your code is its length in bytes, plus the standard deviation of its bytes (i.e. &lt;span class=&quot;math-container&quot;&gt;\$N + s\$&lt;/span&gt;). &lt;strong&gt;The code with the lowest score in each language wins.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(If you somehow find a language with a 1-byte built-in that fulfills the challenge, your score will just be 1. In the impossible case of a 0-byte built-in, your score will be &lt;span class=&quot;math-container&quot;&gt;\$0 + \frac{0}{-1} = 0\$&lt;/span&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox questions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this too similar to the vanilla &lt;a href=&quot;https://codegolf.stackexchange.com/q/60901/42545&quot;&gt;standard deviation challenge&lt;/a&gt;?&lt;/li&gt;&#xA;&lt;li&gt;For non-golfing languages that primarily use ASCII, the standard deviation will likely be much lower than the byte count, leading to golfing the code being significantly more important than reducing &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt;. How could this best be combated? &lt;span class=&quot;math-container&quot;&gt;\$\sqrt N + s\$&lt;/span&gt;? &lt;span class=&quot;math-container&quot;&gt;\$N + s^2\$&lt;/span&gt;? (where &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; is the length of the code) Obviously I wouldn't want to just use &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt;, as you could just append one byte (e.g. &lt;code&gt;;&lt;/code&gt; in many languages) over and over to lower it arbitrarily.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42545" LastEditorUserId="42545" LastEditDate="2018-11-10T16:47:26.130" LastActivityDate="2018-11-10T16:47:26.130" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17087" PostTypeId="2" ParentId="17084" CreationDate="2018-11-10T16:37:04.500" Score="0" Body="&lt;h1&gt;No for the 1st winning criticia but yes as a tie breaker&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If the winner of other aspect has inf score on the tie breaker, that's fine; if more than one has same to here, treat the two inf as same unless explictly modified&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2018-11-10T16:37:04.500" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17088" PostTypeId="2" ParentId="17084" CreationDate="2018-11-10T16:56:13.857" Score="1" Body="&lt;h1&gt;Submissions need to be competitive.&lt;/h1&gt;&#xA;&lt;p&gt;That's all there is to it.  If you are aiming for a low score, and you end up with an infinite score, that's &lt;em&gt;probably&lt;/em&gt; not competitive.&lt;/p&gt;&#xA;&lt;p&gt;From the wiki:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Be a serious contender for the winning criteria in use. For example, an entry to a code golf contest needs to be golfed, and an entry to a speed contest should make some attempt to be fast.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;In other words, if there is an infinite score (or an infinite-score tiebreaker), this should be decided case-by-case, on the basis of whether they are competitive or not.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-11-12T14:08:24.213" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="17093" PostTypeId="2" ParentId="2447" CreationDate="2018-11-12T19:24:32.330" Score="15" Body="&lt;h1&gt;Metaprogramming languages may return a boolean by compiling/not compiling&lt;/h1&gt;&#xA;&lt;p&gt;For example, C++ template metaprogramming has no &amp;quot;return value&amp;quot;.  A common way for a C++ template metaprogramming to reject something is to fail to compile (sometimes in a SFINAE way, sometimes not).&lt;/p&gt;&#xA;" OwnerUserId="23424" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-11-12T19:24:32.330" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17095" PostTypeId="2" ParentId="2447" CreationDate="2018-11-13T08:51:50.287" Score="31" Body="&lt;h1&gt;Submissions may use list of strings instead of multi-line strings&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input or output may be the equivalent of the string separated by newlines. For example, the multiline string:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;2&#xA;Fizz&#xA;4&#xA;Buzz&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;May be instead be taken as a list of strings like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&quot;1&quot;,&quot;2&quot;,&quot;Fizz&quot;,&quot;4&quot;,&quot;Buzz&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="76162" LastActivityDate="2018-11-13T08:51:50.287" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17096" PostTypeId="2" ParentId="2140" CreationDate="2018-11-13T15:12:58.737" Score="0" Body="&lt;h1&gt;Lunar Arithmetic&lt;/h1&gt;&#xA;&lt;p&gt;Lunar Arithmetic (also called &lt;em&gt;dismal&lt;/em&gt; arithmetic, a play on decimal) is an alternative to elemental arithmetic in which only addition and multiplication is defined, and then only for non-negative integers. For single-digit numbers, addition is defined as the maximum of the two digits, and multiplication is defined as the smaller of the two digits. For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2 + 5 = 5 + 2 = 5&#xA;2 * 5 = 5 * 2 = 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;To extend lunar addition to multi-digit numbers, simply consider the digits individually, counting empty digit places as zeroes as required. For example, consider &lt;code&gt;169 + 84&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  1 6 9&#xA;+   8 4&#xA;  -----&#xA;  1 8 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Lunar multiplication can now be dealt with in the same way as normal long multiplication, using the lunar rules for addition and multiplication. For example, consider &lt;code&gt;169 * 84&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    1 6 9&#xA;*     8 4&#xA;  -------&#xA;    1 4 4    (169 * 4)&#xA;+ 1 6 8      (169 * 8)&#xA;  -------&#xA;  1 6 8 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a function or program which, when given two integers, returns the result of their lunar addition and their lunar multiplication, in any order.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input pair may be presented as a two-element list or array.&lt;/li&gt;&#xA;&lt;li&gt;Input numbers may be provided in any reasonable format, including as a string, or as a list of digits.&lt;/li&gt;&#xA;&lt;li&gt;Output may similarly be in any reasonable format.&lt;/li&gt;&#xA;&lt;li&gt;The two output numbers must be separated in an unambiguous way, such as with newlines, spaces, as elements of a list or array.&lt;/li&gt;&#xA;&lt;li&gt;Links to online demonstrations are appreciated, but not required.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are disallowed.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes per language wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;In your submission, please specify the order in which the two results are presented, and your input and output formats if they are out of the ordinary.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test cases go here&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/pdf/1107.1130.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;Original paper outlining dismal arithmetic&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.youtube.com/watch?v=cZkGeR9CWbk&quot; rel=&quot;nofollow noreferrer&quot;&gt;Numberphile video discussing lunar arithmetic&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Tags&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Sandbox business&lt;/h1&gt;&#xA;&lt;p&gt;I see this as the potential starting point for a number of Lunar arithmetic challenges, such as computing the result of a longer calculation (such as &lt;code&gt;12+345*67*8&lt;/code&gt;), identification of lunar primes, lunar prime factorisation, methods of implementing subtraction and division... Of course that all depends on the response to this challenge. Any feedback on how to make this challenge better would be much appreciated!&lt;/p&gt;&#xA;" OwnerUserId="41020" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-11-13T16:22:26.297" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17099" PostTypeId="2" ParentId="2140" CreationDate="2018-11-14T01:09:49.870" Score="0" Body="&lt;h2&gt;Posted: &lt;a href=&quot;https://codegolf.stackexchange.com/q/175908/56433&quot;&gt;FreeChat Online&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="83836" LastEditorUserId="56433" LastEditDate="2018-11-14T13:14:02.790" LastActivityDate="2018-11-14T13:14:02.790" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17101" PostTypeId="2" ParentId="2140" CreationDate="2018-11-15T13:51:52.780" Score="-1" Body="&lt;h1&gt;Win 2048&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Win 2048. You can decide where to summon block of 2(no 4), and how you move. The output would be [place, place, move, place, move, ..., place, move](finally you reach 2048).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Shortest code win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;SN: Similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/27010&quot;&gt;Play a perfect game of 2048&lt;/a&gt; ?&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2018-11-15T13:51:52.780" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17102" PostTypeId="2" ParentId="2140" CreationDate="2018-11-16T08:37:50.650" Score="1" Body="&lt;h1&gt;Classify arity of verbs inside trains in J &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/j&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;j&amp;#39;&quot; rel=&quot;tag&quot;&gt;j&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.stackexchange.com/q/150380/78410&quot;&gt;Clearly parenthesize APL trains&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;J is an APL-family language. While it inherits the basic train syntax from APL (take a look at the linked challenge above), J is more versatile with the introduction of &lt;code&gt;[:&lt;/code&gt;, &lt;code&gt;&amp;amp;&lt;/code&gt; and &lt;code&gt;@&lt;/code&gt; among many others. But the problem is, the more features a tacit expression has, the harder it is to read and understand what it does. Even worse, most of the built-in verbs have both monadic and dyadic usage, and some of them have two completely different meanings! So let's build a helper to classify the arity of verbs.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Notations&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;#&lt;/code&gt; is a monadic verb.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;+&lt;/code&gt; is a dyadic verb.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[&lt;/code&gt; is a special symbol called &quot;cap&quot; which can appear at specific positions inside a train.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;@&lt;/code&gt; and &lt;code&gt;&amp;amp;&lt;/code&gt; are conjunctions, which take two verbs on both sides and form a single verb.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; are left and right arguments to a given train, respectively. If &lt;code&gt;x&lt;/code&gt; is missing, the train is called monadically (with one argument &lt;code&gt;y&lt;/code&gt;); otherwise, dyadically (with both arguments).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Basics&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In a train of verbs, the last 3 verbs are recursively grouped.&lt;/li&gt;&#xA;&lt;li&gt;Conjunctions bind from left to right.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Monadic&#xA;(# + #) y   =&amp;gt;  (# y) + (# y)&#xA;(+ #) y     =&amp;gt;  y + (# y)&#xA;([ # #) y   =&amp;gt;  # (# y)&#xA;(+ # + #) y =&amp;gt;  (+ (# + #)) y&#xA;(# + # + # + #) y =&amp;gt; (# + (# + (# + #))) y&#xA;(# + [ # # + #) y =&amp;gt; (# + ([ # (# + #))) y&#xA;&#xA;Dyadic&#xA;x (+ + +) y   =&amp;gt;  (x + y) + (x + y)&#xA;x (+ #) y     =&amp;gt;  x + (# y)&#xA;x ([ # +) y   =&amp;gt;  # (x + y)&#xA;x (+ # + #) y =&amp;gt;  x (+ (# + #)) y    &amp;lt;= the 3-group is run monadically&#xA;x (+ + + + + + +) y =&amp;gt; x (+ + (+ + (+ + +))) y&#xA;x (+ + [ # + + +) y =&amp;gt; x (+ + ([ # (+ + +))) y&#xA;&#xA;Conjunction &amp;amp;&#xA;(#&amp;amp;#) y   =&amp;gt; # (# y)&#xA;x (+&amp;amp;#) y =&amp;gt; (# x) + (# y)&#xA;&#xA;Conjunction @&#xA;(#@#) y   =&amp;gt; # (# y)&#xA;x (#@+) y =&amp;gt; # (x + y)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;How to determine arity of each verb&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   (?  (? ?&amp;amp;?@?    ?) ?) y&#xA;=&amp;gt; (# d(? ?&amp;amp;?@?    ?) #) y    monadic 3-train: # + #&#xA;=&amp;gt; (#  (+ d?&amp;amp;?@?   +) #) y    dyadic 3-train:  + + +&#xA;=&amp;gt; (#  (+ d(?&amp;amp;?)@? +) #) y    conjunction binds from left; arity is determined from right&#xA;=&amp;gt; (#  (+ m(?&amp;amp;?)@+ +) #) y    dyadic `@`:  #@+&#xA;=&amp;gt; (#  (+  (#&amp;amp;#)@+ +) #) y    monadic `&amp;amp;`: #&amp;amp;#&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an expression that represents the structure of a J train, determine the arity of every verb in the expression.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input &amp;amp; output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;TBD&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;TBD&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring &amp;amp; winning criterion&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply. The shortest valid program or function in each language wins.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2018-11-17T09:49:46.297" LastActivityDate="2018-11-17T09:49:46.297" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17104" PostTypeId="1" CreationDate="2018-11-17T18:49:17.403" Score="-9" ViewCount="101" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; problems are not like mathematics problems&lt;/h1&gt;&#xA;&lt;p&gt;The way of see generate from the set of problems tag as kolmogorov-complexity is anti programming... one algorithm in mathematics (here with tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;) is something ok and useful; but kolmogorov-complexity problem goes against the right way of seeing programming; and so can not have the same score for vote of a question or answer with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; questions. Should upvotes for an answer on a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; question yield not 10 reputation, but say 5 or 1?&lt;/p&gt;&#xA;" OwnerDisplayName="user58988" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-11-17T19:36:05.083" Title="kolmogorov-complexity is not as a mathematics problem, score has to be inferior" Tags="|discussion|" AnswerCount="1" CommentCount="8" ClosedDate="2018-11-20T01:10:50.280" ContentLicense="CC BY-SA 4.0" />
  <row Id="17105" PostTypeId="2" ParentId="17104" CreationDate="2018-11-17T19:12:52.317" Score="10" Body="&lt;p&gt;Assigning different amounts of reputation to upvotes on challenges bearing a certain tag is a bad idea. Being a math problem doesn't automatically make a challenge more difficult or useful.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenges that are hard to golf (even if writing an ungolfed solution is straightforward), while there are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; challenges that simply ask to &lt;a href=&quot;https://codegolf.stackexchange.com/q/84260/12012&quot;&gt;add two numbers&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2018-11-17T19:12:52.317" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17107" PostTypeId="2" ParentId="2140" CreationDate="2018-11-18T19:58:51.133" Score="0" Body="&lt;h1&gt;Display a rational tangle [WIP]&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In a quest to classify mathematical knots, J. H. Conway discovered that certain simpler knotlike structures called &lt;em&gt;rational tangles&lt;/em&gt; can be uniquely represented by rational numbers.&lt;/p&gt;&#xA;&lt;p&gt;A tangle is an arrangement of two strands of rope such that each of the four ends lies at one corner of a rectangle. The four exceptional tangles are 0, 1, -1, and a special case usually referred to as 0/0 or ∞. A rational tangle is a tangle that can be obtained from the exceptional tangles by the following operations.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/0Ru5M.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/0Ru5M.png&quot; alt=&quot;Example of rational tangles&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;An example of a rational tangle, and the tangles 0/0, 0, 1, and -1 respectively.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/rlEDx.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/rlEDx.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The rational tangle operations&lt;/p&gt;&#xA;&lt;p&gt;Because every rational number can be obtained by addition, negation, and reciprocal, there exists some rational tangle corresponding to every rational number.&lt;/p&gt;&#xA;&lt;p&gt;If tangle &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; have rational number values &lt;code&gt;x&lt;/code&gt; and `y respectively, then the operations in the diagram result in the following values.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Tangle |  Value&#xA;-a          -x&#xA;1/a         1/x&#xA;a + b      x + y&#xA;a b       -x + y&#xA;a , b     -x + -y   &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Using the below representations of the four exceptional rational tangles, display an ASCII art rational tangle corresponding to a given rational number.&lt;/p&gt;&#xA;&lt;h3&gt;Exceptional rational tangles&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;\_/   \ /&#xA; _    | |&#xA;/ \   / \&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;3x3 ASCII art representing the rational tangles 1/0 and 0&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;\ /   \ /&#xA; \     /&#xA;/ \   / \&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The rational tangles 1 and -1, illustrating how to display crossings&lt;/p&gt;&#xA;&lt;h3&gt;Displaying more complex rational tangles&lt;/h3&gt;&#xA;&lt;p&gt;Adding and rotating the above 3x3 blocks and rotation can yield any rational tangle.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;To flip a rational tangle over the line x=y, switch all instances of 1 and -1, switch all instances of 0/0 and 0, and replace all extenders (below) as appropriate.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;To rotate a rational tangle by 90 degrees in either direction, rotate the ASCII art by 90 degrees in that direction, switch all &lt;code&gt;\&lt;/code&gt; and &lt;code&gt;/&lt;/code&gt;, switch all instances of 0/0 and 0, and replace all extenders (below) as appropriate.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;To add two rational tangles, juxtapose them in the appropriate direction and orientation, adding extenders if dimensions do not match. Then surround the result with the following.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Pattern to surround the sum of two tangles in:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;\ ... /&#xA;       &#xA;⋮      ⋮&#xA;       &#xA;/ ... \&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Extenders:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; \        /&#xA;  |      |&#xA; ...    ...&#xA;  |      |&#xA;   \    /&#xA;&#xA;\_..._&#xA;      \&#xA;&#xA; _..._/&#xA;/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;One possible representation of the tangle obtained through the equation [...]. This tangle is congruent to [...] because =.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; \       /&#xA;  \_   _/ &#xA;    \ /  &#xA;     /   &#xA;  __/ \_ &#xA; /      \&#xA; \      / &#xA;  \ /\ / &#xA;   \  \  &#xA;  / \/ \&#xA; /      \&#xA;/        \&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;A rational number. If you instead take input as an ordered pair (numerator,denominator) of integers, you will have &lt;code&gt;denominator &amp;gt;= 0&lt;/code&gt;. (Denominator 0 is necessary to represent 0/0.)&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;An ASCII-art representation of the rational tangle corresponding to said number, where a crossing is displayed as one of the above. Whitespace can occur anywhere. Output can contain unnecessary copies of 0, or have other variations as long as the rational tangle is obtained by operations whose corresponding arithmetic operations result in the input.&lt;/p&gt;&#xA;&lt;h3&gt;Further sources&lt;/h3&gt;&#xA;&lt;p&gt;A further explanation of tangles and rational tangles: (&lt;a href=&quot;https://rationaltangle.wordpress.com/what-are-tanglesrational-tangles/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://rationaltangle.wordpress.com/what-are-tanglesrational-tangles/&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;TODO: Reciprocal operation, better example, reference implementation&lt;/p&gt;&#xA;&lt;p&gt;Should continued fraction representations be acceptable?&lt;/p&gt;&#xA;&lt;p&gt;Since this is probably a difficult challenge and answers to such are undervoted, I'm prepared to award a bounty to the shortest answer and any improvement thereon.&lt;/p&gt;&#xA;&lt;p&gt;This is getting more unwieldy. I'm thinking of simplifying into a challenge to simply add two rational tangles.&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-11-18T22:25:13.287" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17108" PostTypeId="2" ParentId="2140" CreationDate="2018-11-18T20:04:34.947" Score="5" Body="&lt;h1&gt;Split and recombine a number&lt;/h1&gt;&#xA;&lt;p&gt;This &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge has two related parts. Your task is to write two functions/programs as per the below specifications. You may share code across your submissions, the submissions may call one another, and you may even submit a single submission which handles both conversions. In the latter case, conversion direction may be determined by whether the input is a single number vs a list, or by an additional consistent second value (not a function) input.&lt;/p&gt;&#xA;&lt;h2&gt;Part 1&lt;/h2&gt;&#xA;&lt;p&gt;Given a floating point number, return a list with one element per digit of its integer part, if any, and if the number is a non-integer, one additional part which is the fractional part. If the number is negative, negate all elements in the output. If the number is zero, return a 1-element list with a zero in it.&lt;/p&gt;&#xA;&lt;p&gt;When the result list is recombined as per Part 2, it must be precise to within an absolute or relative error of 10⁻¹⁰, whichever is more permissive.&lt;/p&gt;&#xA;&lt;h2&gt;Part 2&lt;/h2&gt;&#xA;&lt;p&gt;Given a list generated as per Part 1, return the number which would have generated that list in Part 1.&lt;/p&gt;&#xA;&lt;p&gt;When the result number is split as per Part 1, each element must be precise to within an absolute or relative error of 10⁻¹⁰, whichever is more permissive.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Part 1 &amp;lt;-&amp;gt; Part 2&#xA;-123       [-1,-2,-3]&#xA;2.71828    [2,0.71828]&#xA;-800.6     [-8,0,0,-0.6]&#xA;321.7001   [3,2,1,0.7001]&#xA;-0.01      [-0.01]&#xA;100        [1,0,0]&#xA;0          [0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/encode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;encode&amp;#39;&quot; rel=&quot;tag&quot;&gt;encode&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decode&amp;#39;&quot; rel=&quot;tag&quot;&gt;decode&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-11-19T12:40:04.217" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="17110" PostTypeId="2" ParentId="2140" CreationDate="2018-11-19T07:48:54.590" Score="0" Body="&lt;h1&gt;Octonion multiplication &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/complex-numbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;complex-numbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;complex-numbers&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Octonion&quot; rel=&quot;nofollow noreferrer&quot;&gt;Octonion&lt;/a&gt;&lt;/strong&gt; is a further extension to the quaternion number system. An octonion can be written as&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$ x = x_0 e_0 + x_1 e_1 + x_2 e_2 + x_3 e_3 + x_4 e_4 + x_5 e_5 + x_6 e_6 + x_7 e_7 $$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;where &lt;span class=&quot;math-container&quot;&gt;\$ x_i \$&lt;/span&gt; are real numbers and &lt;span class=&quot;math-container&quot;&gt;\$ e_i \$&lt;/span&gt; are the eight &lt;em&gt;unit octonions&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Octonion multiplication has the following properties:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is not commutative, i.e. &lt;span class=&quot;math-container&quot;&gt;\$ xy \ne yx \$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;It is not associative, i.e. &lt;span class=&quot;math-container&quot;&gt;\$ x(yz) \ne (xy)z \$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;But, luckily, multiplication is distributive over addition, i.e. &lt;span class=&quot;math-container&quot;&gt;\$ x(y+z) = xy + xz \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$ (x+y)z = xz + yz\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The multiplication rule for unit octonions is presented below:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(will add a table from Wikipedia)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The unit octonions have several properties:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ e_0 \$&lt;/span&gt; behaves like a real number 1.&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ e_i^2 = -1 \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$ e_i e_j = -e_j e_i \$&lt;/span&gt; for &lt;span class=&quot;math-container&quot;&gt;\$ 1 \le i,j \le 7, i \ne j \$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Multiply two octonion numbers.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input &amp;amp; output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You can accept and output an octonion as any kind of consistent structure consisting of eight real numbers (four complex numbers or two quaternions or a mixture of types is also fine).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Coming soon.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring &amp;amp; winning criterion&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply. The shortest program or function in bytes for each language wins.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2018-11-19T08:09:31.493" LastActivityDate="2018-11-19T08:09:31.493" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17112" PostTypeId="1" CreationDate="2018-11-19T16:21:01.417" Score="-3" ViewCount="125" Body="&lt;p&gt;Title may be hard to understand, so an example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a language claim to have a busy beaver function &lt;code&gt;BB:unsigned int -&amp;gt; double&lt;/code&gt;, and works fine(always return &lt;code&gt;Infinity&lt;/code&gt; when input is a bit larger and output exceed &lt;code&gt;1e+310&lt;/code&gt;), can we use it as one?&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2018-11-19T18:01:20.480" Title="Can we use theoretically-impossible functions?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17113" PostTypeId="2" ParentId="17112" CreationDate="2018-11-19T18:01:20.480" Score="9" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Languages are defined by their implementations. If the implementation doesn't work, the feature doesn't exist.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2018-11-19T18:01:20.480" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17114" PostTypeId="2" ParentId="16958" CreationDate="2018-11-19T19:08:09.307" Score="2" Body="&lt;h1&gt;You can at least assume the output buffer is &lt;strong&gt;enough&lt;/strong&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Anyway even GCC doesn't(or can't) check it when doing &lt;code&gt;memcpy&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2018-11-19T19:08:09.307" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17115" PostTypeId="2" ParentId="2140" CreationDate="2018-11-19T21:03:57.843" Score="1" Body="&lt;h1&gt;mAkE a StRiNg EpIc &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Now that the meme is mostly dead, we can have this challenge. It's pretty simple: take a string (either as stdin or a parameter to a function), and change the case to alternate capital and lowercase letters, starting with lowercase. Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;Hello, World!&quot; -&amp;gt; &quot;hElLo, WoRlD!&quot;&#xA;&quot;PPCG&quot; -&amp;gt; &quot;pPcG&quot;&#xA;&quot;Ok now this is epic&quot; -&amp;gt; &quot;oK nOw ThIs Is EpIc&quot;&#xA;&quot;&quot; -&amp;gt; &quot;&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Can take input as a parameter to a function or as stdin&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Punctuation marks are left alone&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Must not take any input other than the input string&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins!&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Sandbox questions:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The obvious one: is it a duplicate? I don't think so, but I don't know for sure.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is it too trivial for some languages?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Thanks everyone!&lt;/p&gt;&#xA;" OwnerUserId="62313" LastEditorUserId="62313" LastEditDate="2018-11-19T23:32:40.740" LastActivityDate="2018-11-19T23:32:40.740" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17117" PostTypeId="2" ParentId="2447" CreationDate="2018-11-20T05:31:31.137" Score="13" Body="&lt;h1&gt;A multidimensional rectangular array may be represented by the list &lt;code&gt;[dimensions, flattened array]&lt;/code&gt;&lt;/h1&gt;&#xA;" OwnerUserId="39328" LastActivityDate="2018-11-20T05:31:31.137" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17119" PostTypeId="1" AcceptedAnswerId="17121" CreationDate="2018-11-20T08:50:08.440" Score="10" ViewCount="216" Body="&lt;p&gt;Some people are very good code golfers but for their own reasons do not want to join PPCG. Is it acceptable to post their solutions as answers to challenges?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If at all acceptable, I would personally do so only as Community Wiki and only with full reference to the original author and their code. I would also fully explain the code to the best of my ability.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2018-11-20T13:13:55.423" Title="Post other people's code?" Tags="|discussion|policy|answers|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17121" PostTypeId="2" ParentId="17119" CreationDate="2018-11-20T13:13:55.423" Score="14" Body="&lt;p&gt;As long as you're legally allowed to post the code, I see no reason why PPCG would forbid this. Since we're talking about your friend, you might want to double-check they're OK with licensing their work under cc by-sa 3.0.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I personally wouldn't mark the answers as community wiki, especially if you wrote the explanation yourself. See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9688/12012&quot;&gt;How should Community Wikis be used?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2018-11-20T13:13:55.423" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17122" PostTypeId="1" AcceptedAnswerId="17125" CreationDate="2018-11-20T20:01:50.210" Score="25" ViewCount="701" Body="&lt;p&gt;The question is in the title. I'm interested in submissions that terminate with probability 1 but have unbounded worst case running times. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is related to the question &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4782/do-programs-have-to-terminate&quot;&gt;Do programs have to terminate?&lt;/a&gt;, but that question is specifically about submissions that definitely do not terminate. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the challenge is &quot;sort the array&quot;. Should an implementation of a randomized bogosort (shuffle the elements and see if the result is sorted) be permitted?&lt;/p&gt;&#xA;" OwnerUserId="79980" LastActivityDate="2018-11-23T13:28:48.533" Title="Is it permitted for a submission to terminate merely with probability 1?" Tags="|discussion|policy|answers|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17123" PostTypeId="2" ParentId="2140" CreationDate="2018-11-20T22:02:43.767" Score="4" Body="&lt;h1&gt;The Hungry Moose&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/176251/the-hungry-mouse#comment424408_176251&quot;&gt;Inspiration&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moose face harsh conditions during the winter. According to one &lt;a href=&quot;https://www.denali.org/denalis-natural-history/moose-in-winter/&quot; rel=&quot;nofollow noreferrer&quot;&gt;source&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Their winter foods are lower quality than what they eat in summer and provides less energy, consequently, they need to eat more of it. During harsh winters, having both extreme cold temperatures and deep snow, moose expend more energy than they take in and many can starve.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;At noon on day 1, a hungry moose starts at a food source (the top left corner). Each morning, the moose may either walk to any 8-adjacent square or stay in place. Each evening, the moose clears the food and snow from its location (adding its net nutritional value to its calorie store and setting that value in the array to 0), and before the end of the day loses 1 calorie to the extreme cold.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The moose dies when its calorie store falls to 0 or below at the end of a day. In particular, if the value at the upper-left corner is 1, 0, or negative, the moose dies on day 1.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A 2D array of integers. Negative numbers represent calorie-negative deep snow.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The maximum number of days the moose can survive (counting day 1 as a full day).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases (add)&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;6 0 -2 3&#xA;0 0 -5 -5&#xA;0 0 -1 3&#xA;8&#xA;&#xA;42 -100 1&#xA;-100 -100 2&#xA;3 4 5&#xA;42&#xA;&#xA;5 -3 1&#xA;1 -9 9&#xA;12&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="39328" LastEditDate="2018-11-23T17:36:03.717" LastActivityDate="2018-11-23T17:36:03.717" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17124" PostTypeId="2" ParentId="17122" CreationDate="2018-11-20T22:05:22.853" Score="-6" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;If there is the possibility that a program does not terminate, then it does not actually solve the task. If a program does not do what it is supposed to do, it is not valid as an answer.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-11-20T22:05:22.853" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17125" PostTypeId="2" ParentId="17122" CreationDate="2018-11-20T22:08:34.537" Score="30" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;Banning submissions that work with a probability of 1 removes the option of rejection sampling which is an approach that already has been used countless times.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-11-20T22:08:34.537" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17126" PostTypeId="2" ParentId="2140" CreationDate="2018-11-20T22:11:57.560" Score="1" Body="&lt;h1&gt;Find the best K year period to have invested&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A stock index is a way of measuring the overall performance of the stock prices of a group of companies (which may change from time to time). An example from the US is called the S&amp;amp;P 500. An index fund is an investment that grows at the same rate as the underlying index.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are the annual returns for a hypothetical S&amp;amp;P 500 stock index fund for each calendar year from 1928 to 2017, expressed as a multiplier. So in 1927 you might say &quot;the index went up by 37.88%&quot; which I've represented here by 1.3788.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1.3788, 0.8809, 0.7152, 0.5293, 0.8485, 1.4659, 0.9406, 1.4137, 1.2792, 0.6141,  1.2521, 0.9455, 0.8471, 0.8214, 1.1243,  1.1945, 1.138, 1.3072, 0.8813, 1,  0.9935, 1.1026, 1.2178, 1.1646, 1.1178,  0.9338, 1.4502, 1.264, 1.0262, 0.8569,  1.3806, 1.0848, 0.9703, 1.2313, 0.8819,  1.1889, 1.1297, 1.0906, 0.8691, 1.2009,  1.0766, 0.8864, 1.001, 1.1079, 1.1563,  0.8263, 0.7028, 1.3155, 1.1915, 0.885,  1.0106, 1.1231, 1.2577, 0.9027, 1.1476,  1.1727, 1.014, 1.2633, 1.1462, 1.0203,  1.124, 1.2725, 0.9344, 1.2631, 1.0446,  1.0706, 0.9846, 1.3411, 1.2026, 1.3101,  1.2667, 1.1953, 0.8986, 0.8696, 0.7663,  1.2638, 1.0899, 1.03, 1.1362, 1.0353,  0.6151, 1.2345, 1.1278, 1, 1.1341,  1.296, 1.1139, 0.9927, 1.0954, 1.1942&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given as inputs this array of annual returns and an array of size &lt;span class=&quot;math-container&quot;&gt;\$1\le K \le 89\$&lt;/span&gt; non-negative real numbers (the amounts to invest in each year), write a program or function that outputs what would have been the best &lt;span class=&quot;math-container&quot;&gt;\$K\$&lt;/span&gt; year period to have invested each amount in the array in this hypothetical index fund, assuming the returns from each year are reinvested at the beginning of the next year.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt;, so the fewest bytes in each language wins.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you don't like the way I've represented the array of annual returns, you can change them to any other array of 89 numbers that you prefer. (SANDBOX NOTE: This is intended to allow for some input flexibility (people might prefer to use the given array minus 1, or the cumulative returns) but not &lt;em&gt;too&lt;/em&gt; much (so that people don't cheat and change the array to some multi-dimensional monster that nearly solves the whole problem).)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can output the best &lt;span class=&quot;math-container&quot;&gt;\$K\$&lt;/span&gt; year period in any consistent manner (e.g. 0-indexed or 1-indexed, the first or the last period to have invested, the entire range of years, the actual years themselvs, etc.) but you need to say what your output represents if it isn't obvious.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In case of a tie, output any or all correct answers.   &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Suppose the array consisted of &lt;span class=&quot;math-container&quot;&gt;\$[ 10000, 20000, 30000]\$&lt;/span&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you had invested these amounts in 1928, 1929, and 1930 (the 1-indices 1, 2, and 3) you would have ended up with &lt;span class=&quot;math-container&quot;&gt;\$42743.10\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But if you had invested those amounts in 2015, 2016, and 2017 (the 1-indices 87, 88, and 89) you would have ended up with &lt;span class=&quot;math-container&quot;&gt;\$66722.66\$&lt;/span&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It turns out the &lt;em&gt;best&lt;/em&gt; three year period to have invested these amounts would have been 1995, 1996, and 1997 (1-indices 68, 69, and 70).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;1-indexed, first year of optimal period&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[ 1, 2, 3 ]                          -&amp;gt;  68&#xA;[ 1 ]                                -&amp;gt;   6&#xA;*any array of length 89*             -&amp;gt;   1&#xA;[ 1, 1 ]                             -&amp;gt;  27&#xA;[ 1, 2 ]                             -&amp;gt;   8&#xA;[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 ]  -&amp;gt;  63&#xA;[ 1, 2, 3, 4, 5, 4, 3, 2, 1 ]        -&amp;gt;  64&#xA;* 1 repeated 20 times *              -&amp;gt;  53&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="79980" LastEditorUserId="79980" LastEditDate="2018-11-21T01:49:33.900" LastActivityDate="2018-11-21T01:49:33.900" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17128" PostTypeId="1" CreationDate="2018-11-21T19:55:18.200" Score="9" ViewCount="376" Body="&lt;p&gt;Many challenges, mainly &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;, are impossible in some languages. &lt;a href=&quot;https://codegolf.stackexchange.com/q/133486/42545&quot;&gt;Find an Illegal String&lt;/a&gt; is a good example&amp;mdash;many languages without syntax errors, such as &lt;a href=&quot;https://codegolf.stackexchange.com/a/133599/42545&quot;&gt;brainfuck&lt;/a&gt; (deleted answer), can simply be put in an infinite loop before the illegal string is reached within the code. The challenge even brings &lt;a href=&quot;https://codegolf.stackexchange.com/a/133778/42545&quot;&gt;Jelly&lt;/a&gt; to its knees (deleted answer by Dennis himself), as you can simply put &lt;code&gt;¶1&lt;/code&gt; at the end of any program (after closing any open strings) and the parser won't even look at the line with the syntax error.&lt;sup&gt;[citation needed]&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, it's not always obvious whether a challenge like this is possible in a given language. Even if someone has a proof that there are no solutions, it's not currently clear whether or not it's legal to post this as an answer in itself. (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/16172/42545&quot;&gt;This&lt;/a&gt; is the closest question I could find, but it asks specifically about challenges that aren't possible in general.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, what should be done when a language provably cannot answer a challenge? What about when it's almost certain, but not proven impossible?&lt;/p&gt;&#xA;" OwnerUserId="42545" LastActivityDate="2018-11-21T23:55:10.533" Title="What should we do when a language cannot answer a given challenge?" Tags="|discussion|answers|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17129" PostTypeId="2" ParentId="17128" CreationDate="2018-11-21T20:24:40.330" Score="7" Body="&lt;p&gt;&lt;strong&gt;Reasons to Post an Answer&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The proof of impossibility may be interesting to see&lt;/li&gt;&#xA;&lt;li&gt;It demonstrates for all to see that the challenge cannot be solved in that language&lt;/li&gt;&#xA;&lt;li&gt;It makes it less likely that invalid solutions will be posted&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Reasons NOT to Post an Answer&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the proof is trivial&lt;/li&gt;&#xA;&lt;li&gt;Non-solutions may distract from actual solutions to the given challenge&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;When a solution in a given language is &lt;em&gt;almost&lt;/em&gt; certainly impossible, it is hard to say whether an answer would be worth posting or not. If a non-trivial amount of work was done to eliminate a significant set of potential solutions and narrow the remaining options for the language, then perhaps an answer would be worth it, provided it's made clear that it is not a definite answer. Otherwise, probably not.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastActivityDate="2018-11-21T20:24:40.330" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17130" PostTypeId="2" ParentId="17128" CreationDate="2018-11-21T20:31:54.367" Score="17" Body="&lt;h2&gt;Don't use that language for that challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm sure many users avoid challenges that are not suited to their language(s) of choice. I know I do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the challenge is actually impossible for a language, that is an extreme version of &quot;not suited&quot;. &lt;/p&gt;&#xA;" OwnerUserId="79980" LastActivityDate="2018-11-21T20:31:54.367" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17131" PostTypeId="2" ParentId="17128" CreationDate="2018-11-21T21:01:18.823" Score="12" Body="&lt;p&gt;Follow &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17129/39328&quot;&gt;mbomb007's answer&lt;/a&gt; as to when to post proofs as answers. This also follows &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/16185/39328&quot;&gt;precedent from the linked question&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the rare case that it is interesting to know the class of impossible languages, or many languages have trivial proofs of impossibility, create a canonical answer of the form below containing all such languages.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;List of languages that cannot solve this challenge&lt;/h1&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;p&gt;Any non-Turing complete language, by @user's &lt;a href=&quot;http://example.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;proof&lt;/a&gt; of universality.&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;[Language], by @otheruser's &lt;a href=&quot;http://example.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;exhaustive search&lt;/a&gt; of all 63340000 possible encodings of the payload.&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;Any language with multiline comments, because [reason].&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;Any language with a one-character builtin for [operation], because [other reason]. This includes [languages].&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="39328" LastEditDate="2018-11-21T23:55:10.533" LastActivityDate="2018-11-21T23:55:10.533" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17133" PostTypeId="2" ParentId="2140" CreationDate="2018-11-22T13:50:01.090" Score="1" Body="&lt;h1&gt;Exploring generalzations of Cheryl's birthday problem&lt;/h1&gt;&#xA;&lt;p&gt;In this challenge we will generalize the Cheryl's birthday problem to arbitrary finite subsets of pairs of integers&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Cheryl gives Albert and Bernard a finite collection of pairs of integers S. Cheryl chooses an element (x, y) from S and tells x to Albert and y to Bernard. Assume everyone speaks truthfully.&lt;/p&gt;&#xA;&lt;p&gt;Albert says: &amp;quot;I don't know what x and y are, but I know that Bernard doesn't know&amp;quot;. More precisely: Albert does not know what y is, but using only the information given in the first paragraph, the elements of S and the value x, Albert is certain that Bernard doesn't know what x is.&lt;/p&gt;&#xA;&lt;p&gt;Bernard says: &amp;quot;At first I didn't know what x and y were ,but now I do&amp;quot;. - That is, before Albert said anything, Bernard doesn't know what x and y are, but after Albert spoke, Bernard knew.&lt;/p&gt;&#xA;&lt;p&gt;Albert says: &amp;quot;Now I also know what x and y are&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to write a computer program that takes as input the set S, and outputs a list of all possible values for the (x, y) that Cheryl chose, in any order. (therefore you must use a programming language that can handle lists of pairs of numbers). If there is no solution or that conversation is impossible, output an empty list.&lt;/p&gt;&#xA;&lt;p&gt;This challenge is code golf, so shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;[(1,1),(2,2),(3,3),(4,4)]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;[]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;There is no solution to this problem because the conversation is impossible. Knowing either x or y will result in knowing the other one. Therefore, it's impossible for Bernard to know y but not x.&lt;/p&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;[(5,15),(5,16),(5,19),(6,17),(6,18),(7,14),(7,16),(8,14),(8,15),(8,17)]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;[(7,16)]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is the original problem.&lt;/p&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;[(1,1),(1,2),(1,3),(2,1),(2,2),(2,3),(3,1),(3,2),(3,3)]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;[]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The conversation is impossible as Bernard cannot deduce x from y and the fact that Albert knows that Bernard does not know x.&lt;/p&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;[(1,0),(1,1),(1,2),(2,1),(2,2),(2,3),(3,2),(3,3),(3,4),(4,1),(4,3)]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;[(2,2)]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;If x was 1, then Albert cannot be sure that Bernard doesn't know x, because if y was 0, then Bernard would know that x was 1. Similarly for if x was 3. Therefore x was 2 or 4.&lt;/p&gt;&#xA;&lt;p&gt;After Albert spoke, Bernard can eliminate x=1 and x=3, and then he can deduce what x was. If Bernard had y = 1 or 3, then Bernard could not distinguish between (2,1) and (4,1), or between (2,3) and (4,3). As Bernard knew, we must have y = 2. After Bernard spoke, Albert knew that y=2, and x=2.&lt;/p&gt;&#xA;" OwnerUserId="84200" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-11-22T13:50:01.090" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17134" PostTypeId="2" ParentId="2140" CreationDate="2018-11-22T15:59:05.163" Score="1" Body="&lt;p&gt;Output &lt;a href=&quot;https://paste.ubuntu.com/p/vywrgkvhwq/&quot; rel=&quot;nofollow noreferrer&quot;&gt;The End Poem&lt;/a&gt;. Outputting as array, or with only one &lt;code&gt;\n&lt;/code&gt; or three &lt;code&gt;\n&lt;/code&gt; to separate sentences, etc. are fine. Shortest code win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Upvote to prefer: You can take an input containing &lt;a href=&quot;https://paste.ubuntu.com/p/RfgQYFzgnH/&quot; rel=&quot;nofollow noreferrer&quot;&gt;all letters in lowercase&lt;/a&gt; or uppercase&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Downvote to prefer: You can take an input containing all letters in their original cases(upper/lower)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;P.S. The two old choices are too similar&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Comment if duplicate, fell the length is bad, etc&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-11-27T22:53:21.033" LastActivityDate="2018-11-27T22:53:21.033" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="17135" PostTypeId="1" AcceptedAnswerId="17136" CreationDate="2018-11-22T20:49:54.357" Score="7" ViewCount="135" Body="&lt;p&gt;Some popular challenges have many many answers and often a language is used more than once, so :&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there a way to sort answers so that they appear in the order according to the name of a language OR just answers written in a specific language ?&lt;/p&gt;&#xA;" OwnerUserId="81828" LastEditorUserId="68942" LastEditDate="2021-06-09T05:35:57.833" LastActivityDate="2023-10-23T16:32:37.883" Title="Sorting answers" Tags="|feature-request|status-declined|answers|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17136" PostTypeId="2" ParentId="17135" CreationDate="2018-11-23T03:29:26.153" Score="8" Body="&lt;p&gt;There unfortunately isn't a built-in way to sort or filter by language. It's a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8358/20260&quot;&gt;feature we'd like to have&lt;/a&gt;, but's it's surely too niche for Stack Exchange to implement.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, we have some workarounds. You can edit the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5139/20260&quot;&gt;leaderboard snippet&lt;/a&gt; into a challenge (or ask someone to), and running it shows the winner for each language. You could also install the &lt;a href=&quot;https://github.com/vihanb/PPCG-Design&quot; rel=&quot;nofollow noreferrer&quot;&gt;PPCG redesign userscript&lt;/a&gt;, which includes an automatic leaderboard.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2018-11-23T03:29:26.153" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17137" PostTypeId="2" ParentId="2140" CreationDate="2018-11-23T03:30:26.947" Score="0" Body="&lt;h1&gt;Make numbers inflate to full width! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Related: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/75979/full-width-text&quot;&gt;Full Width Text&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;That is a challenge that changes ALL characters into full width -- BY ADDING A SPACE AFTER EACH CHARACTER. However, in this challenge only numbers are transformed, and are transform to the &lt;strong&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Halfwidth_and_fullwidth_forms&quot; rel=&quot;nofollow noreferrer&quot;&gt;REAL FULL WIDTH FORM&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This is a short and simple challenge, so I will keep the description short.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program / function that accepts an ASCII string as input and outputs a UTF string with each number &lt;code&gt;0123456789&lt;/code&gt; converted to its corresponding full width form &lt;code&gt;０１２３４５６７８９&lt;/code&gt;. The range of these full width numbers is &lt;code&gt;U+FF10 - U+FF19&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may output using the following format (As an example &lt;code&gt;This is 1 apple&lt;/code&gt; is used):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A UTF-8 string (showing exactly &lt;code&gt;This is １ apple&lt;/code&gt; in STDOUT)&lt;/li&gt;&#xA;&lt;li&gt;The same string as above but displayed in a non-UTF-8 encoding (eg. showing &lt;code&gt;This is ï¼‘ apple&lt;/code&gt; in Windows-1252 codepage). In this case you must state the codepage of the output&lt;/li&gt;&#xA;&lt;li&gt;A single list of UTF-8 bytes as integers that represents the transformed string (showing &lt;code&gt;ord(&quot;T&quot;),...,ord(&quot; &quot;),239,188,145,ord(&quot; &quot;),...,ord(&quot;e&quot;)&lt;/code&gt; with arbitrary delimiter)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You cannot mix integer output and character output, that is, you cannot literally change &lt;code&gt;This is 1 apple&lt;/code&gt; to &lt;code&gt;This is [239,188,145] apple&lt;/code&gt;. You cannot output a nested list if a list is outputted either.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sample I/O&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Sample 1: &lt;pre&gt;Input:  0123456789&#xA;Output: (Format 1) ０１２３４５６７８９&#xA;        (Format 2) ∩╝É∩╝æ∩╝Æ∩╝ô∩╝ö∩╝ò∩╝û∩╝ù∩╝ÿ∩╝Ö [CP437]&#xA;        (Format 3) 239,188,144,239,188,145,239,188,146,239,188,147,239,188,148,239,188,149,239,188,150,239,188,151,239,188,152,239,188,153&lt;/pre&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Sample 2: &lt;pre&gt;Input:  This is 1 apple&#xA;Output: (Format 1) This is １ apple&#xA;        (Format 2) This is ï¼‘ apple [Windows-1252]&#xA;        (Format 3) 0x54 0x68 0x69 0x73 0x20 0x69 0x73 0x20 0xef 0xbc 0x91 0x20 0x61 0x70 0x70 0x6c 0x65&lt;/pre&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Footnote&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer for each language wins. Standard loopholes are forbidden by default.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;P.S. I would like to see both practical and esoteric language submissions. Specifically the last two output formats are especially allowed for esoteric languages.&lt;/p&gt;&#xA;" OwnerUserId="71546" LastActivityDate="2018-11-23T03:30:26.947" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17139" PostTypeId="2" ParentId="2140" CreationDate="2018-11-23T07:32:39.017" Score="0" Body="&lt;h1&gt;Help Runbee manage the pollen! [better title needed?]&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/164484/59487&quot;&gt;The &lt;s&gt;&amp;nbsp;arsonist&amp;nbsp;&lt;/s&gt; friendly bee&lt;/a&gt;, Runbee, just finished picking up the pollen from the flower garden and now she wants to store it safely in her hive. Each pollen type is labeled with a digit (from &lt;strong&gt;1&lt;/strong&gt; to &lt;strong&gt;9&lt;/strong&gt;). Runbee's &quot;collection&quot; is stored in a row of adjacent honeycomb cells, containing one grain each. For instance, this row could look like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 3 2 2 4 4 4 5 3 3 3 7 8 9 9 5 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;But hmm, Runbee doesn't like this order... Because she's tired after flying all day, she can now only move a run of identical adjacent pollen grains to another position in the row to make it seem more organised. Her goal is to have as many identical pollen types one after another after the reordering.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Task&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given a sequence &lt;strong&gt;S&lt;/strong&gt; of digits ranging from &lt;strong&gt;1&lt;/strong&gt; to &lt;strong&gt;9&lt;/strong&gt;, one shall:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Split &lt;strong&gt;S&lt;/strong&gt; into (the longest possible) runs of consecutive adjacent elements. Then, one of the chunks should be moved to another position in &lt;strong&gt;S&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The resulting sequence &lt;strong&gt;S'&lt;/strong&gt; should be chopped again into (the longest possible) runs of consecutive adjacent elements. Your goal is to search for the sequence &lt;strong&gt;S'&lt;/strong&gt; which contains the most equal consecutive elements. &lt;/li&gt;&#xA;&lt;li&gt;You can either output all such sequences &lt;strong&gt;S'&lt;/strong&gt; (deduplicated or not) or just one of them.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For the example above, the possible ways to generate optimal orderings are (where &lt;code&gt;(...)&lt;/code&gt; represent the point of removal and &lt;code&gt;[...]&lt;/code&gt; the point of addition):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 (3) 2 2 4 4 4 5 [3] 3 3 3 7 8 9 9 5     | 1 2 2 4 4 4 5 3 3 3 3 7 8 9 9 5 &#xA;1 (3) 2 2 4 4 4 5 3 3 3 [3] 7 8 9 9 5     | 1 2 2 4 4 4 5 3 3 3 3 7 8 9 9 5&#xA;1 3 [3 3 3] 2 2 4 4 4 5 (3 3 3) 7 8 9 9 5 | 1 3 3 3 3 2 2 4 4 4 5 7 8 9 9 5&#xA;1 [3 3 3] 3 2 2 4 4 4 5 (3 3 3) 7 8 9 9 5 | 1 3 3 3 3 2 2 4 4 4 5 7 8 9 9 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;... To be written .. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;... To be added .. &lt;/p&gt;&#xA;" OwnerUserId="59487" LastActivityDate="2018-11-23T07:32:39.017" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17140" PostTypeId="2" ParentId="2140" CreationDate="2018-11-23T11:18:33.090" Score="-1" Body="&lt;h3&gt;Coprimes upto N (Performance Edition)&lt;/h3&gt;&#xA;&lt;p&gt;There is this question: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/104665/coprimes-up-to-n&quot;&gt;Coprimes up to N&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Most of the answers there take way to long for larger numbers.&lt;/p&gt;&#xA;&lt;p&gt;So, your task is to find all the coprimes of a number &lt;code&gt;n&lt;/code&gt;  (&lt;code&gt;gcd(n,coprime)==1&lt;/code&gt;) up to &lt;code&gt;n&lt;/code&gt;as fast as possible.&lt;/p&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;p&gt;Score=Largest &lt;code&gt;n&lt;/code&gt; for which your code will output in less than 10 seconds on my laptop. Provide instructions to run it on my machine.&lt;/p&gt;&#xA;&lt;p&gt;Highest score wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;I will put the specs of my pc, anything else needed?&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="82927" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-11-23T11:18:33.090" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17142" PostTypeId="2" ParentId="15040" CreationDate="2018-11-23T12:37:02.743" Score="0" Body="&lt;p&gt;The length of the code is its byte count. If a full program is required then everything counts. If a function is required then everything counts including function declarations&amp;amp;definitions. If a snippet is required then it may be given as an anonymous function or in any other way that you can directly use this in an interactive fashion. This gets tricky in languages that do not have named functions or don't have functions to begin with in which case you either default to the most reasonable approximation of a function or you exclude these languages from participating. But either way, we're trying to establish categories here that just do not reflect reality because reality doesn't neatly fit into categories. &lt;/p&gt;&#xA;" OwnerUserId="5429" LastActivityDate="2018-11-23T12:37:02.743" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17143" PostTypeId="2" ParentId="2140" CreationDate="2018-11-23T12:46:18.713" Score="1" Body="&lt;h2&gt;Fully modular C program &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Modularity means that instead of writing one big long procedure, we break up our logic into small, composable functions. We all know that modularity is a good thing. But why settle for a good thing when you can have the &lt;em&gt;best&lt;/em&gt; thing? Let's make our programs  &lt;em&gt;fully modular&lt;/em&gt;. This means that each function must contain zero assignment statements and no more than one function call and one binary operator (if it contains more than that, that's a sign your function is getting too long and you need to break it up).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example 1:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;int multiply_add(int a, int b, int c) { return a * b + c; }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;might become&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;int multiply(int a, int b) { return a * b; }&#xA;int multiply_add(int a, int b, int c) { return multiply(a, b) + c; }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Example 2:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;int foo(int x)&#xA;    int y = x + 3;&#xA;    bar(y, y);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;might become&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;int bar2(int y) { return bar(y, y); }&#xA;int foo(int x) { return bar2(x + 3); }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox note&lt;/strong&gt;: I am working on the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17153/30688&quot;&gt;fully modular C verifier&lt;/a&gt; question before this one.&lt;/p&gt;&#xA;" OwnerUserId="30688" LastEditorUserId="30688" LastEditDate="2018-11-26T17:21:19.537" LastActivityDate="2018-11-26T17:21:19.537" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17144" PostTypeId="2" ParentId="12976" CreationDate="2018-11-23T12:58:49.933" Score="1" Body="&lt;h2&gt;For golfing languages:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Historically, the oldest languages are:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;2008 - GolfScript&lt;/li&gt;&#xA;&lt;li&gt;2008 - FlogScript&lt;/li&gt;&#xA;&lt;li&gt;2012 - Burlesque&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Then around 2015 an explosion started and nowadays there are a few dozen of golfing languages. It's thus reasonable to assume that languages that followed &lt;code&gt;2013-now&lt;/code&gt; at least have some relationship to one of those three - most likely to GolfScript because the other two aren't really as widely known and GolfScript is featured in the Wikipedia article about codegolf. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;They inspired other people to design their own golfing languages and might have drawn a few people into esoteric programming languages to begin with. GolfScript2 was clearly inspired by GolfScript and GolfScript2 was the first &quot;officially&quot; esoteric one afaik that actually said &quot;screw ASCII&quot; and this inspired other people to try to map as many instructions into a 8bit encoding. &lt;/p&gt;&#xA;" OwnerUserId="5429" LastEditorUserId="5429" LastEditDate="2018-11-23T13:26:48.337" LastActivityDate="2018-11-23T13:26:48.337" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17146" PostTypeId="2" ParentId="2140" CreationDate="2018-11-23T18:18:21.527" Score="6" Body="&lt;h1&gt;Chess ASCII Art, Knight&lt;/h1&gt;&#xA;&lt;p&gt;In honor of the world chess championship, in the shortest possible program, output the following ASCII art piece&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;      ,....,&#xA;   ,::::::&amp;lt;&#xA;  ,::/^\&amp;quot;``.&#xA; ,::/, `   e`.&#xA;,::; |        '.&#xA;,::|  \___,-.  c)&#xA;;::|     \   '-'&#xA;;::|      \&#xA;;::|   _.=`\&#xA;`;:|.=` _.=`\&#xA;  '|_.=`   __\&#xA;   `\_..==`` /&#xA;    .'.___.-'.&#xA;   /          \&#xA;  ('--......--')&#xA;  /'--......--'\&#xA;   &amp;quot;--......--&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is a &lt;strong&gt;code-golf&lt;/strong&gt; challenge&lt;/p&gt;&#xA;" OwnerUserId="82959" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-11-23T20:16:22.017" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="17147" PostTypeId="1" AcceptedAnswerId="17150" CreationDate="2018-11-24T01:25:24.167" Score="2" ViewCount="138" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/176443/easiest-wordsearch?noredirect=1#comment424869_176443&quot;&gt;Easiest WordSearch&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've asked a crossword related question thats been on my mind for quite a while. I've made various edits from suggestions in the comments. I don't think I can adjust the question myself to the point of getting it reopened or that me addressing more individual points is going to result in making progress with it rather than going in circles. I'm asking for some more hands on edit request assistance to change the wording and rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Right now similar questions risk being closed as duplicates because of this question.&lt;/p&gt;&#xA;" OwnerUserId="12578" LastEditorUserId="12578" LastEditDate="2018-11-24T11:58:44.233" LastActivityDate="2018-11-24T19:18:09.703" Title="I asked a word question that has run away with me?" Tags="|discussion|support|asking-questions|specific-question|challenges|" AnswerCount="1" CommentCount="0" FavoriteCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17148" PostTypeId="2" ParentId="2140" CreationDate="2018-11-24T13:54:40.533" Score="1" Body="&lt;h1&gt;Sequences that sum to n&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;Barely too late for Fibonacci Day :(&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a positive integer &lt;code&gt;n&lt;/code&gt;, your challenge is to output a sequence of &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;2&lt;/code&gt; that adds to &lt;code&gt;n&lt;/code&gt;. For example, for input &lt;code&gt;8&lt;/code&gt;, acceptable outputs include &lt;code&gt;11111111&lt;/code&gt;, &lt;code&gt;2222&lt;/code&gt;, and &lt;code&gt;121211&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's not quite that simple, though. Given &lt;code&gt;n&lt;/code&gt;, the number of possible outputs is the &lt;code&gt;n&lt;/code&gt;&lt;sup&gt;th&lt;/sup&gt; term of the &lt;a href=&quot;https://oeis.org/A000045&quot; rel=&quot;nofollow noreferrer&quot;&gt;Fibonacci sequence&lt;/a&gt; (starting with &lt;code&gt;F(0) = F(1) = 1&lt;/code&gt;); you must return each with equal probability. This means that the following Python 3 is invalid:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def foo(n):&#xA;  out = &quot;&quot;    # String output is by no means required.&#xA;  while n:&#xA;    a = min(random.randint(1, 2), n)&#xA;    out += str(a)&#xA;    n -= a&#xA;  return out&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;While this will return each allowed result with nonzero probability and everything else with zero probability, the distribution is not uniform. In particular, &lt;code&gt;foo(3)&lt;/code&gt; is twice as likely to be &lt;code&gt;21&lt;/code&gt; is it is to be &lt;code&gt;111&lt;/code&gt; or &lt;code&gt;12&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/73884&quot;&gt;IO&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/73884&quot;&gt;loophole&lt;/a&gt; rules apply. Output is flexible, but you must use 1 and 2, not 0 and 1 or some other weird thing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code (in bytes) wins! Happy golfing!&lt;/p&gt;&#xA;" OwnerUserId="73884" LastActivityDate="2018-11-24T13:54:40.533" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17149" PostTypeId="2" ParentId="2140" CreationDate="2018-11-24T17:21:54.853" Score="1" Body="&lt;h1&gt;Given element count, minimum GCD and maximum LCM, compute the number of distinct integer arrays&lt;/h1&gt;&#xA;&lt;p&gt;Inspired by a question in Turkish National Computing Olympiad.&lt;/p&gt;&#xA;&lt;p&gt;You are given 3 numbers: n, x and y.&lt;/p&gt;&#xA;&lt;p&gt;Compute the number of distinct integer arrays with n elements whose GCD is greater than x and lcm is less than y.&lt;/p&gt;&#xA;&lt;p&gt;Test cases: (n,x,y -&amp;gt; result)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1,1,10 -&amp;gt; 10 // there are 10 1 element arrays with gcd&amp;gt;=1 and lcm&amp;lt;=10, which are [1],[2],[3],...[10].&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;I can not add much test cases because I could not solve the question (well, I got 10 points by writing a python script which outputs a c++ file which hardcodes the first subtask, but I think the does not count.), please help with test cases.&lt;/p&gt;&#xA;&lt;p&gt;Rules: i/o is flexible. Standard loopholes are not allowed.&lt;/p&gt;&#xA;&lt;p&gt;This is code-golf, so the shortest answer in every language wins.&lt;/p&gt;&#xA;" OwnerUserId="80227" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-11-25T15:07:30.963" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17150" PostTypeId="2" ParentId="17147" CreationDate="2018-11-24T19:18:09.703" Score="5" Body="&lt;p&gt;First off:  &lt;strong&gt;I don't think the challenge is off-topic.  It is a bit unclear, and the scoring doesn't lead to interesting submissions, but it &lt;em&gt;is&lt;/em&gt; on topic.&lt;/strong&gt;  Accordingly, I've voted to reopen.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, I &lt;em&gt;do&lt;/em&gt; have some suggestions for improvement:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The word &quot;easiest&quot; is misleading here.  On my first read, I assumed that we were scored based on how easy the crossword was.  I'd definitely remove it from the post (and optionally remove it from the title).&lt;/li&gt;&#xA;&lt;li&gt;Competitive submissions aren't going to calculate the word search on the fly.  Rather, they will output a precalculated wordsearch.  You can fix this in several ways:  Having multiple grid sizes, having multiple word sets, or various other options.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Finally, I'd like to mention that if a challenge is closed, we generally avoid it as a duplicate target.  So, if there was a well-defined challenge that was a duplicate of a poorly-defined challenge, we won't dupe the well-defined challenge.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastActivityDate="2018-11-24T19:18:09.703" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17156" PostTypeId="2" ParentId="2140" CreationDate="2018-11-27T21:06:58.597" Score="1" Body="&lt;h2&gt;Solve Newcomb's paradox &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Newcomb%27s_paradox&quot; rel=&quot;nofollow noreferrer&quot;&gt;Newcomb's paradox&lt;/a&gt; is a problem that has been stumping philosopher's for decades. And, as anyone who uses reddit knows, a problem posed by a philosopher is best solved by a software engineer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In Newcomb's paradox, you are presented with two boxes, A and B. You can either take B or take A and B. A contains $1000. B contains $0 if a predictor predicts you will take box A and $1000000 if it predicts you will not take box A.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For this challenge, the predictor will be an execution function or command, such as python's &lt;a href=&quot;https://www.geeksforgeeks.org/exec-in-python/&quot; rel=&quot;nofollow noreferrer&quot;&gt;exec&lt;/a&gt; function, or the bash eval command. Therefore, you must use a programming language that has one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, to solve Newcomb's paradox your program must:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output the string &quot;B&quot; when run with an eval function.&lt;/li&gt;&#xA;&lt;li&gt;Output the string &quot;A+B&quot; when run normally.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This will allow you to win $10001000.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer wins!&lt;/p&gt;&#xA;" OwnerUserId="16842" LastActivityDate="2018-11-27T21:06:58.597" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17157" PostTypeId="2" ParentId="5243" CreationDate="2018-11-29T00:54:34.530" Score="2" Body="&lt;h1&gt;200 rep for a low-entropy maximal discrepancy-2 sequence&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/122304/39328&quot;&gt;Compress a maximal discrepancy-2 sequence&lt;/a&gt; is about compressing a particular discrepancy-2 sequence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/123228/39328&quot;&gt;Maximal discrepancy-2 sequence with minimal entropy&lt;/a&gt; is about finding a maximal discrepancy-2 sequence that's easier to compress.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This bounty will be awarded to an answer meeting all the following conditions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is the shortest answer to question 2&lt;/li&gt;&#xA;&lt;li&gt;It is at least 3 bytes shorter than the shortest answer to question 1&lt;/li&gt;&#xA;&lt;li&gt;Both of the above remain true for 1 week.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="39328" LastActivityDate="2018-11-29T00:54:34.530" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17167" PostTypeId="2" ParentId="2447" CreationDate="2018-11-30T13:41:18.443" Score="16" Body="&lt;h1&gt;Lists of decimal digits and strings that match &lt;code&gt;^[0-9]*$&lt;/code&gt; are interchangeable...&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;...but not when this may make the input format inconsistent.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, let's say you can assume the string input will match &lt;code&gt;^[1457]+$&lt;/code&gt;, which is a subset of &lt;code&gt;^[0-9]*$&lt;/code&gt;. Then, &lt;code&gt;'1775'&lt;/code&gt; can also be input as &lt;code&gt;[1, 7, 7, 5]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, for a counterexample, let's assume the string input will match &lt;code&gt;^[a0-8]{2,15}$&lt;/code&gt;, which isn't a subset of &lt;code&gt;^[0-9]*$&lt;/code&gt;. In this case, no, you may not use a list of digits, since you can't use one to represent &lt;code&gt;1aa7708&lt;/code&gt;, for example. You &lt;em&gt;can&lt;/em&gt; use &lt;code&gt;[1, 1, 8, 8, 6, 4]&lt;/code&gt; to represent &lt;code&gt;118864&lt;/code&gt;, but this inconsistency is invalid by default.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I posted this after having come across numerous occurrences where I've had to ask about this in the comment section of the question, so I thought &quot;why not post this here?&quot;. Surprisingly, this, AFAICT, hasn't ever been posted yet! I definitely have a positive opinion.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2018-11-30T13:41:18.443" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17168" PostTypeId="2" ParentId="2140" CreationDate="2018-11-30T16:34:19.140" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/176992&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-12-04T15:47:19.550" LastActivityDate="2018-12-04T15:47:19.550" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17169" PostTypeId="2" ParentId="2140" CreationDate="2018-11-30T22:33:48.727" Score="3" Body="&lt;h1&gt;Number of Unit Squares Intersecting a Circle&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/oeis&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;oeis&amp;#39;&quot; rel=&quot;tag&quot;&gt;oeis&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/3KdLe.gif&quot; alt=&quot;https://i.stack.imgur.com/3KdLe.gif&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Credit to &lt;a href=&quot;https://codegolf.stackexchange.com/users/69850/user202729&quot;&gt;user202729&lt;/a&gt; for the illustration)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;OEIS sequence &lt;a href=&quot;https://oeis.org/A234300&quot; rel=&quot;nofollow noreferrer&quot;&gt;A234300&lt;/a&gt; is defined thusly:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A radius range is either a single real number at which the circle centered at &lt;span class=&quot;math-container&quot;&gt;\$(0,0)\$&lt;/span&gt; passes through some lattice point, or an interval between two such consecutive numbers.&lt;/li&gt;&#xA;&lt;li&gt;The first radius range is the number &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th term of the sequence is the number of unit squares on the upper right quadrant of the Cartesian grid whose interior contains some segment of the circle of radius &lt;span class=&quot;math-container&quot;&gt;\$r\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$r\$&lt;/span&gt; is in the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th radius range.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This table shows the radius range and corresponding sequence terms for the first 11 terms of the sequence.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Range       Term&#xA;0           0&#xA;(0,1)       1&#xA;1           1&#xA;(1,√2)      3&#xA;√2          2&#xA;(√2,2)      3&#xA;2           3&#xA;(2,√5)      5&#xA;√5          3&#xA;(√5,√8)     5&#xA;√8          4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A positive integer &lt;code&gt;n&lt;/code&gt; (or nonnegative for zero-indexed).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Either the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th term of the sequence, or a list of the first &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; terms. You may index from &lt;span class=&quot;math-container&quot;&gt;\$n=0\$&lt;/span&gt; or &lt;span class=&quot;math-container&quot;&gt;\$n=1\$&lt;/span&gt;.&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="39328" LastEditDate="2018-12-02T21:18:04.210" LastActivityDate="2018-12-02T21:18:04.210" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17170" PostTypeId="2" ParentId="2140" CreationDate="2018-11-30T22:42:46.150" Score="1" Body="&lt;h1&gt;Sums of Bessel Polynomial Coefficients [WIP]&lt;/h1&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://oeis.org/A001515&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://oeis.org/A001515&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Interesting alternate characterizations include:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Equivalently, number of sequences of n unlabeled items such that each item occurs just once or twice (cf. A105749). - David Applegate, Dec 08 2008&lt;/p&gt;&#xA;&lt;p&gt;Numerator of (n+1)-th convergent to 1+tanh(1). - Benoit Cloitre, Dec 20 2002&lt;/p&gt;&#xA;&lt;p&gt;a(n) is also the numerator of the continued fraction sequence beginning with 2 followed by 3 and the remaining odd numbers: [2,3,5,7,9,11,13,...]. - Gil Broussard, Oct 07 2009&lt;/p&gt;&#xA;&lt;p&gt;Also, number of scenarios in the Gift Exchange Game when a gift can be stolen at most once.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-11-30T22:42:46.150" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17171" PostTypeId="2" ParentId="2140" CreationDate="2018-12-01T03:20:23.243" Score="-3" Body="&lt;h2&gt;Tags:&lt;/h2&gt;&#xA;&lt;p&gt;Code-Bowling&lt;/p&gt;&#xA;&lt;h1&gt;Name: Two is an error, One runs fine!&lt;/h1&gt;&#xA;&lt;p&gt;The challenge is simple.&lt;/p&gt;&#xA;&lt;p&gt;When one character is removed from the given program, it should not error, but when two are removed, it should error.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;PENALTIES:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;If you repeat one Unicode character in the program, then your score will be the number of bytes subtracted by the Unicode value of the character (0 for NUL, 10 for newline, 64 for A, etcetera).&lt;/p&gt;&#xA;&lt;p&gt;Else, your score is the number of bytes.&lt;/p&gt;&#xA;&lt;p&gt;As always, since this is code bowling, &lt;strong&gt;most bytes win&lt;/strong&gt;!&lt;/p&gt;&#xA;" OwnerUserId="83048" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-12-01T03:20:23.243" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="17172" PostTypeId="2" ParentId="2447" CreationDate="2018-12-01T03:58:07.327" Score="25" Body="&lt;h1&gt;I/O for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; questions may either be 0-indexed or 1-indexed&lt;/h1&gt;&#xA;&lt;p&gt;Any &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; question that has the user output the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th term, first &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; terms, etc. of a sequence should allow programs to index the first element of the sequence as 0 or 1 at the answerer's choice, as long as the program is consistent.&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-12-01T03:58:07.327" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17175" PostTypeId="1" AcceptedAnswerId="17176" CreationDate="2018-12-03T20:25:29.770" Score="0" ViewCount="583" Body="&lt;p&gt;The &lt;a href=&quot;https://libraryofbabel.info&quot; rel=&quot;nofollow noreferrer&quot;&gt;Library of Babel&lt;/a&gt; is a huge library with many books. For example, the book titled &lt;a href=&quot;https://libraryofbabel.info/bookmark.cgi?,fkwpival.vbfz1&quot; rel=&quot;nofollow noreferrer&quot;&gt;&quot;,fkwpival.vbfz&quot;&lt;/a&gt; defines code golf on page 29&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;code golf is a type of recreational computer programming competition&#xA;  in which participants strive to achieve the shortest possible source&#xA;  code that implements a certain algorithm. playing code golf is known&#xA;  as golf scripting. code golf tournaments may also be named with the&#xA;  programming language used for example perl golf.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;My question is, if we found a description of a programming language within a book, and an interpreter for the language, could we use it? If so, what would be the date the language was invented? I would assume the latest would be March 31, 2015, since the library and all it books existed then (&lt;a href=&quot;http://web.archive.org/web/20150331114954/http://libraryofbabel.info/&quot; rel=&quot;nofollow noreferrer&quot;&gt;according to the Wayback machine&lt;/a&gt;).&lt;/p&gt;&#xA;" OwnerUserId="16842" LastActivityDate="2018-12-03T20:55:48.293" Title="If we find a programming language in the Library of Babel, can we use it?" Tags="|discussion|rules|languages|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17176" PostTypeId="2" ParentId="17175" CreationDate="2018-12-03T20:49:53.443" Score="6" Body="&lt;p&gt;Sure. Why not? Who cares where a language came from? If I had a PRNG output a bunch of random characters and that happened to make a valid language, there's no reason I shouldn't be able to use that. Languages invented by the library of babel aren't too different.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;However&lt;/em&gt;&lt;/strong&gt;, if you answer a challenge in the language &quot;,fkwpival.vbfz&quot;, because that book corresponds to a language that answers the challenge in 0-bytes, or any other kind of rule-lawyering nonsense, you will certainly be violating both of these standard loopholes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1071/31716&quot;&gt;Using a made-up language specifically designed for the challenge&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5076/31716&quot;&gt;Using MetaGolfScript&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And most likely earning yourself a plethora of downvotes before your answer is deleted as well.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="31716" LastEditDate="2018-12-03T20:55:48.293" LastActivityDate="2018-12-03T20:55:48.293" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17177" PostTypeId="2" ParentId="17175" CreationDate="2018-12-03T20:50:39.490" Score="16" Body="&lt;h1&gt;The language would have been created on the date at which the book was bookmarked for the first time&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The Library of Babel is basically an encoding scheme: any possible string will exist somewhere in the Library, and the string itself is specified by a book location and page number. For example, the book you linked is located at:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hexagon &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1wx9566s8ck9xukawh9y687uqyecvjqvvehvqelplcj06ztjicpz6f9qnw1ky0qornannj1mpuacweszdrj8wbdwf9ce6wl4h3som4jguduuig69x7iesm31ql3or43m17ebh1vdi0ecxyzzu2hxt7ci2z43y8xc03phl0ikhhdfv6hfw1rqbeadl2v9zsetrh3yapglbrf18pmd284endczs6pj9bb9foq8dmr0r6crysgvdu7s2k4944247r498peumgqjjtohynp29j3ixlwjclw3bzce94li8jl4ck40boi8n6omptyr6a35db1rpubpktm1eipzyuw2eo3bncmxm9t76f3lxketjfpb1pg18al95z03zf88blk88255a70z87roquq6oghvc7dpud81e2dx1ud6z6i9yfu3j3l91b189upv6bt3ejgr25v15h8mvh3y7ppnafhk84ofxg3apvu423bbi4k918lqvgzgknx4v6kqb7ufrr2vk8n2rp6patrq7ah3no5pm7qowp3yd1gunavzyvxl6vg1lt3z5oc3xrdou7p3cmlgwf2nsz1kxa7htowl4np91qj4wwg0uxp16zbfs44p6zho0cbgf55j1o1uuz2b64ctace1gda7xjmyow5kw2qjxikrampqh4ws8q9kl77esja6swmt0waobptleb8py3j3l8gmergybdd4olr80ljhp7x89sfu52xieg14lmun4bs1mkp1146jbimv26im0kk3mcnrznooyd9s7pv4lx88wsv8qk530d2p1budd50icn55vr9r43pfomk8v7xf8vd90cj80z6xdiat0hzu945i6sel2esj5twz8p0g2uzrl4ea0e7jifsr1nct73uqan8lhho2iurgzyceqepb4or97tekhcptwgykjt5bm18wntcpkkcgh10a9mpj0pgj2j3r2ulcc65xpy1d7k9i3bzb56u5y7yrymn8659mwsfv5sm2j08z2pxrzuk6l0uz5yskyyao9dmtae4ajgi2uqepnyebhwvujppxuizad3vhblt9tclyjbbik3or1p3qttvqq3z07brxe742da8vlyfifmwxcvjjiz6z7r5z3in1kbjczpmac35e0nwijgmordpyc76nef4vz1xknf1h5eno7rxljc0nsu6r5xdp3fmlpag3wl3vlwxwuf9ph7wyu6xduf932fynnj282t6lp6mfac9enl9q52i1zvpxidgbx9l5prh79b4mpmn7zupe2rliosnwh6ixqygstv9424nl3owtck7u1qu4uq4osuhwftbh2oaydvpw9zh1g8iejhajy4gysgs72oqvzu9cb537xtkahy3qrh73v2xkkbukofp28p71oe1k1wto56t18twt7gchudba4if7fkrlqh2r40cm6sc5q36bbw0ha10qiu0syi9reuafoemoq9z5x46fdmdryrfrkyf76bssw6627k2mamspjwv5cp6qsjtbfvu002tknt3wu8jaltcezdqvfpgo0zg4bkbicgeytu3pyytlj40xyze4z0tgrgmspdj7kxgjy79tw1p7ub2ruovizzmok4617k7cd72ol6qbnnuc3iwf6uyebvuvh21rmqfw6p1p2cnpdtgp9tr672srbtr3v2r8dmph4ovnfl1b5payvynukfj4otxg8sloq10eu3yvmgktzgspfgfyqa41zndj5mtat52663q7tbktgwvs5eqcyyn82l7wxmraam9q1ygp4159qljviye1vno2sggxa1d01ma7aeuug9szk63yqgyd7jqtu2j3e86b8llkp9633y53aq07z28tjpbr4vcrhzck1ygato1606rx36qhq5g62gelruklmx37oko32l9ywmg6tg2ulkb6yluw8a9pbm74qxn58idcber842s0f7a9fod06zgyetcx45qr6azi5s72qo7cp27cwl39ri181vwljc5urkliqw6evie6uruhf328xkot5ayi44z07i01caa2as1kwfjapsttejaaermy9q2yg3ji1cwr9uhyqxyenj2kd5xugrpdqv08g00bzvr0qj7cm7wblnsi8gls85s8zu2q71lu795pg4urgqu5be5gcwtonq685cgfwkx9ul16vo1ommmddzxl3sc3nkpl9ahwsx5uasenkwwj3jowo8fwdmhz9g29m2l2b2puqoo6wseqw6zyr9waz2hh44gab2cwayntkxyu1fogfmu2zrwox99up8thr8u8sd4zcrwcj53v6rdeagkdk0vk8mnypm8jrpw4qlffo800wcjhjdytzy9c8ynfjzyf2li04v0ofxvt9xnnahrmav1qe8axjpepo9ml1ft838sy8j7lonlrcpeq7ks69xxbvt2l1d0a3ww37724dxbp7c27dv5qv07cdtmxruznwm84zgjm6xoea33zfa0eaowud4db87jhibek80qlzqklapszfchu6x4pt1gqc71t82drt5ljqud32gscmvtd20vx9h41g7tl2ml330f0uak6106mh83buw695c57557h3n0irxldzgrp54z0iqi825tac3xy2xtzqkkq9srq497loueuvy224upifrh2husmsu8bwz97dzulwnv66k6qa41bo3gyta4caekm22t5tdpyid70n0628vil04pdtq83tvgw09i77za28wc89jdo8rknn5r22fgrhbmxbk6cdqf06ygc6qd39fjp3m7loy4kia5tahefds2ezrxadah3gc6sbz3xviw28qpt1mehm1ul07dcqhdgrv1252wu9f2fnhrknqunrivmdtv9mgbd8aqq0tazm2200lmeqzr89fx643ty14kokycteslajzt7tinueh5ay519xbd357czhict37hxidtcwtwq8vapquf8pnfdgkkbybnn6epvp623asl9mfml85trkfu04nn6hzcrndrevmvp5jcg0nb2ep2ov8tjbx8tyky67ksabscpmvfvsm9xnbeyn57t6mkgdax9x5d0lm8kycncguq6pv27zqvzk30hlxxr7886lgmb2zdyol2zemsn6jivijge3p1nskr0rxh3fs2h0w9yxhuq2wfxefq6zc967ddyz21rrs9v4cn0vtnqjl804z4ej1dwk09qs11w6fn1odkggso3rsynppj2m9jwhea013xgtn5bkujmumm4wzp5ga6hws0rv9wlij0nrjqr8j&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Volume 25, Shelf 2, Wall 2.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You'll notice that the hexagon has a &lt;em&gt;very&lt;/em&gt; long name. This is because it was effectively generated as an encoding of the content that was desired within the book. (This is a similar principle to, e.g., the esoteric programming language &lt;a href=&quot;https://esolangs.org/wiki/Seed&quot; rel=&quot;nofollow noreferrer&quot;&gt;Seed&lt;/a&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, the mere presence of an encoder/decoder for an encoding doesn't mean that all strings that can be encoded in it have already been created! Sure, they're potentially there, but someone has to actually perform the encode or decode step for anything to have been created.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the case of the Library of Babel, you can &quot;bookmark&quot; a book to keep track of it, giving it a much shorter URL (that's why you have a short URL in your question above). Doing this means that someone has recognised the string in question and decided that it's interesting (perhaps by using it in the Library of Babel's search feature); this is a similar step to publication of a language specification, or the like. So that's the point at which the actual creative work applies.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Claiming that the language already existed in advance is no different from, say, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5076&quot;&gt;using MetaGolfScript&lt;/a&gt;, which is disallowed in our standard loopholes. The Library of Babel defines all possible strings of letters (within certain restrictions), just like MetaGolfScript defines all possible programming languages. But defining everything is, in a way, similar to defining nothing; the creative step is in choosing what's interesting.&lt;/p&gt;&#xA;" OwnerUserId="84332" LastActivityDate="2018-12-03T20:50:39.490" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17181" PostTypeId="2" ParentId="2140" CreationDate="2018-12-04T14:40:00.297" Score="1" Body="&lt;h1&gt;Is the array sorted?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Inspired in part by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/22333/creative-ways-to-determine-if-an-array-is-sorted&quot;&gt;Creative ways to determine of an array is sorted&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an array of integers, find out if the array is sorted. This challenge is as simple as it sounds. I'm surprised that I couldn't find a question like this on PPCG. I'm aware that a lot of golfing languages will have short solutions, but perhaps this question could allow you to showcase a language that's more esoteric than it is practical?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An array of integers, or a sequence of integers if your language doesn't support arrays. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Truthy&lt;/code&gt; if the array is sorted, &lt;code&gt;falsey&lt;/code&gt; otherwise&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1, 2, 3] =&amp;gt; true&#xA;[3, 2, 1] =&amp;gt; false&#xA;[1, 1, 1] =&amp;gt; true&#xA;[] =&amp;gt; true&#xA;[1] =&amp;gt; true&#xA;[-3, -2, -1] =&amp;gt; true&#xA;[-1, -2, -3] =&amp;gt; false&#xA;[1, 2, 1] =&amp;gt; false&#xA;[1, 1, 0] =&amp;gt; false&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Since this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, get ready to trim off some bytes! Happy golfing!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;For the sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I have searched thoroughly for a question like this, but I haven't been able to find this question posted previously. If it exists, or if it is too similar to another question, please link the question or comment why this question should/shouldn't be posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot;&gt;sorting&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="79994" LastEditorUserId="79994" LastEditDate="2018-12-05T07:54:06.210" LastActivityDate="2018-12-05T07:54:06.210" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17184" PostTypeId="2" ParentId="2140" CreationDate="2018-12-05T16:08:12.240" Score="0" Body="&lt;p&gt;You are filling a survey. You don't like filling such thing, so you decide to automatically fill some random thing. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, there may be some duplicated question, and some may be inverted. To simplify the question, we define:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Adding or removing word &quot;not&quot; or &quot;no&quot; inverts the sentence;&lt;/li&gt;&#xA;&lt;li&gt;Adding or removing &quot;un&quot; at the beginning of a word inverts the sentence;&lt;/li&gt;&#xA;&lt;li&gt;Adding or removing &quot;n't&quot; at the end of a word inverts the sentence;&lt;/li&gt;&#xA;&lt;li&gt;Adding or removing word &quot;any&quot;, &quot;a&quot; or &quot;an&quot; keeps (doesn't invert) the sentence;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Invertion can go through sentences even if they are not asked. E.g. &quot;Do you own a car?&quot; is twice inverted to &quot;Don't you own no car?&quot;, so they should have same answer, no matter what sentences left are mentioned.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: A list of string, each of which is a sentence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: A list of 2-possible-value, where inverted sentences are answered different and same sentences are answered same.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sample Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Are you rich?&#xA;Are you unrich?&#xA;Are you poor?&#xA;Are you rich?&#xA;Are you not rich?&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Possible sample outputs (assuming 0 and 1 as possible outputs)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1,0,0,1,0&#xA;1,0,1,1,0&#xA;0,1,0,0,1&#xA;0,1,1,0,1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. Decided to not have &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; to try to have more creative solution&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-12-08T10:15:51.560" LastActivityDate="2018-12-08T10:15:51.560" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17185" PostTypeId="1" CreationDate="2018-12-05T21:16:59.380" Score="4" ViewCount="258" Body="&lt;p&gt;If someone answers a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge in, for example, JavaScript, and as an additional challenge restricts to only code that is approved by &lt;a href=&quot;http://www.jslint.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.jslint.com/&lt;/a&gt; that answer is valid if an interpreter exists that only accepts code that passes JSLint.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, without the existence of such an interpreter, the answer contains non-essential whitespace and would be seen as not a serious contender, and would be subject to deletion based on the consensus in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10835/can-serious-contenders-do-more-than-the-challenge-asks-for&quot;&gt;Can serious contenders do more than the challenge asks for?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question here is whether that interpreter needs to be written before the answer would be valid. Is the existence of a JS interpreter and a separate JS linter sufficient to justify posting linter-golf answers, or must a new interpreter be written for each linter-language combination someone wants to use?&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2018-12-05T21:56:39.947" LastActivityDate="2018-12-06T00:31:08.143" Title="Does linter golf require a specific interpreter to be a valid answer for golf?" Tags="|discussion|code-golf|answers|" AnswerCount="1" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="17187" PostTypeId="2" ParentId="17185" CreationDate="2018-12-06T00:31:08.143" Score="7" Body="&lt;h1&gt;Chaining multiple existing programs together is an acceptable implementation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This has precendent in any language with a separate compilation/parsing/translation step before execution (like C, C++, Java, etc.). In these languages, you invoke one command to create executable code/bytecode/whatever, and then invoke a separate command to actually run the output of the first command.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Java: &lt;code&gt;javac Foo.java &amp;amp;&amp;amp; java Foo&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;C/C++: &lt;code&gt;gcc -o foo foo.c &amp;amp;&amp;amp; ./foo&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Haskell: &lt;code&gt;ghc -o foo foo.hs &amp;amp;&amp;amp; ./foo&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;...and so on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, it would be perfectly reasonable to allow a new language (Lintless JavaScript?) to be defined as &lt;code&gt;node jslint.js foo.js &amp;amp;&amp;amp; node foo.js&lt;/code&gt; (or similar). Browser implementations would be a bit different to invoke, but in general we don't exclude implementations that can't be run from a command line (so long as they are usable in some manner), so they would also be valid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Naturally, as variations can exist between different linters for the same language, each combination of linter and language implementation would be considered its own language by our rules.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2018-12-06T00:31:08.143" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17190" PostTypeId="2" ParentId="2140" CreationDate="2018-12-07T09:01:40.057" Score="1" Body="&lt;h1&gt;Compressed RSA keys&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Silly cops-and-robbers idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As computers get more powerful, RSA keys have grown longer and longer to maintain security. This makes it difficult to:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;hand out your encryption key on business cards&lt;/li&gt;&#xA;&lt;li&gt;recite it over the telephone&lt;/li&gt;&#xA;&lt;li&gt;quickly scribble it down when you meet someone at a bar&lt;/li&gt;&#xA;&lt;li&gt;etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;But we are all programmers (maybe even that someone that you met in a bar), so let's come up with RSA keys that can be generated by very short programs. We should be careful, though, that these keys remain resistant to cracking.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Cops&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write a short program (or function) that outputs an &lt;em&gt;RSA key&lt;/em&gt;. For this challenge, an RSA key is just any positive integer less than &lt;span class=&quot;math-container&quot;&gt;\$2^{1024}\$&lt;/span&gt; that has a non-trivial divisor.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program must:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;take no input&lt;/li&gt;&#xA;&lt;li&gt;output the same number every time it's run&lt;/li&gt;&#xA;&lt;li&gt;finish quickly (a few seconds at most)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Post your program, its language, and what it outputs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, prove that you can use it as an RSA key. Provide a SHA-256 hash of a string that lists all the prime factors of your key.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Robbers&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Crack the RSA keys! If an RSA key is the integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;; find any integer &lt;span class=&quot;math-container&quot;&gt;\$1&amp;lt;d&amp;lt;n\$&lt;/span&gt; that divides &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A key is vulnerable to cracking for 7 days after it's posted. After that, it is considered safe and eligible for scoring.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Cops:&lt;/strong&gt; The shortest uncracked program wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Robbers:&lt;/strong&gt; Most cracks wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Related: &lt;a href=&quot;https://crypto.stackexchange.com/questions/1692/how-much-can-we-compress-rsa-public-keys&quot;&gt;compress RSA public keys&lt;/a&gt; on crypto.SE)&lt;/p&gt;&#xA;" OwnerUserId="75067" LastActivityDate="2018-12-07T09:01:40.057" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17191" PostTypeId="2" ParentId="2140" CreationDate="2018-12-07T13:05:54.120" Score="1" Body="&lt;p&gt;Not a challenge, but not certain of the wording so trying it out here:&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Tips for golfing in JSLint&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;What general tips do you have for golfing in JavaScript restricted to satisfying &lt;a href=&quot;http://www.jslint.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;JSLint&lt;/a&gt; with default options? I'm looking for ideas that can be applied to code golf problems in general that are at least somewhat specific to JSLint (e.g. &quot;remove comments&quot; is not an answer).&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2018-12-07T13:05:54.120" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17194" PostTypeId="2" ParentId="12757" CreationDate="2018-12-08T09:00:45.340" Score="4" Body="&lt;p&gt;I'm a very, very big noob (this is my first answer to a question that didn't turn out to be a year old) so I'm not very qualified to form an opinion, but here it is:&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;We need to bring back underhanded*+ make more KoTH&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Why?&#xA;Because you can enter and understand them much better as a beginner (especially King of the hill). Whereas code-golf  uses objective measurements, underhanded rewards accessibility and king of the hill can be as bodged as you like, as long as you have a good idea. Reading these questions has helped me build up my understanding: King of the hill helps me start to understand other programming languages , and underhanded answers usually contain 1 concept rather than the 'throw all skills at it' nature of code-golf which is hard to understand as a beginner. Thanks to KoTH and underhanded, I can now (sometimes) understand how one might approach a code-golf question.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;To summarize&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I do not think the problem is the community. In fact, I love the community; they are the nicest of any Internet site I have seen&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it is the type of questions that is the problem. This is not a dig at code-golf...I'm saying it's hard to access at first, not that they are bad or anything.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I just wrote this then realised this question is a year old too... :(&lt;/p&gt;&#xA;&#xA;&lt;p&gt;*EDIT:After looking at some replies and doing some research I realise that there are probably significant problems with bringing back underhanded. Although it seemed like a fun idea, I realise that it was not having a positive impact on the site and the image the site was showing. I still think that having a wealth of non-golfing challenges is important, for making the site friendly and not too 'dense' and serious.&lt;/p&gt;&#xA;" OwnerUserId="84062" LastEditorUserId="84062" LastEditDate="2018-12-10T18:46:40.633" LastActivityDate="2018-12-10T18:46:40.633" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17197" PostTypeId="2" ParentId="2140" CreationDate="2018-12-09T14:35:33.930" Score="0" Body="&lt;h1&gt;Separate the syllables - in Finnish&lt;/h1&gt;&#xA;&lt;p&gt;Given a Finnish word as a string, separate each syllable.&lt;/p&gt;&#xA;&lt;h2&gt;Wait, what?&lt;/h2&gt;&#xA;&lt;p&gt;In Finnish, syllables are very important for many different things in the grammar - often, the first place a foreigner starts with the language is with the syllable structure.&#xA;Your job, as a prospective learner, is to decompose the given word into its syllables. To do this, your program or function must return a string in which the syllables have been separated by a single &lt;code&gt;|&lt;/code&gt; or &lt;code&gt;-&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;But how?&lt;/h2&gt;&#xA;&lt;p&gt;Given any word, you can split the syllables apart by following five simple rules. In the below mapping, V indicates a &lt;em&gt;vowel&lt;/em&gt; (aeiouyäö), a &lt;em&gt;diphthong&lt;/em&gt; or a &lt;em&gt;long vowel&lt;/em&gt; (see below) and C indicates a &lt;em&gt;consonant&lt;/em&gt; (bcdfghjklmnpqrstvwxz). '-' indicates where the word should be split. Patterns are &amp;quot;greedy&amp;quot;, so the longest matching pattern is the one that should be applied.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;VV -&amp;gt; V-V&lt;/p&gt;&#xA;&lt;p&gt;VC -&amp;gt; VC&lt;/p&gt;&#xA;&lt;p&gt;VCV -&amp;gt; V-CV&lt;/p&gt;&#xA;&lt;p&gt;VCCV -&amp;gt; VC-CV&lt;/p&gt;&#xA;&lt;p&gt;VCCCV -&amp;gt; VCC-CV&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;What the &amp;amp;@?! are diphtongs?&lt;/h2&gt;&#xA;&lt;p&gt;Because Finnish is &lt;a href=&quot;https://www.basedonblog.com/2015/12/random-facts-about-finland.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;a complex language&lt;/a&gt;, we can't just let foreigners get off that easy with learning the basics! So, we came up with &lt;em&gt;diphtongs&lt;/em&gt; - pairs of &lt;em&gt;vowels&lt;/em&gt; that are considered a single &lt;em&gt;vowel&lt;/em&gt; when determining syllables. The list of the ones important to this challenge is as follows (in an arbitrary order):&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;ai, ei, oi, ui, yi, äi, öi, ey, iy, äy, öy, au, eu, ou, iu, ie, uo, yö&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Furthermore, we have &lt;em&gt;long vowels&lt;/em&gt; - these also count as a single vowel, and are simply the vowel repeated twice:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;aa, ee, ii, oo, uu, yy, ää, öö&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;What else?&lt;/h2&gt;&#xA;&lt;p&gt;You should note that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Default loopholes are forbidden&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;Default I/O is allowed&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You may take input and produce output in any string encoding that contains at least the following characters: &lt;code&gt;abcdefghijklmnopqrstuvwxyzåäö-|&lt;/code&gt; and/or their upper-case equivalents.&lt;/li&gt;&#xA;&lt;li&gt;The encoding must be the same for input and for output.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. Shortest answer wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Give me the solutions!&lt;/h2&gt;&#xA;&lt;p&gt;Examples are given as &lt;code&gt;input -&amp;gt; output&lt;/code&gt; with syllable boundaries indicated by a &lt;code&gt;-&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;perkele -&amp;gt; per-ke-le&#xA;sauna -&amp;gt; sau-na&#xA;koskenkorva -&amp;gt; kos-ken-kor-va&#xA;nopea -&amp;gt; no-pe-a&#xA;maa -&amp;gt; maa&#xA;suomenkieli -&amp;gt; suo-men-kie-li&#xA;esimerkki -&amp;gt; e-si-merk-ki&#xA;itsenäisyyspäivä -&amp;gt; it-se-näi-syys-päi-vä&#xA;koodigolffi -&amp;gt; koo-di-golf-fi&#xA;toritapaaminen -&amp;gt; to-ri-ta-paa-mi-nen&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Finally...&lt;/h2&gt;&#xA;&lt;p&gt;Happy golfing!&lt;/p&gt;&#xA;" OwnerDisplayName="user77406" LastEditorUserId="-1" LastEditorDisplayName="user77406" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-12-09T16:33:31.987" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17199" PostTypeId="2" ParentId="2140" CreationDate="2018-12-09T21:07:36.700" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/191444/43-quintillion-permutations&quot;&gt;43 quintillion permutations&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2019-09-07T14:42:31.657" LastActivityDate="2019-09-07T14:42:31.657" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="17200" PostTypeId="2" ParentId="2140" CreationDate="2018-12-09T22:26:48.303" Score="0" Body="&lt;h1&gt;Validate a simple bell-ringing method&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A simple bell-ringing method on &lt;code&gt;n&lt;/code&gt; bells has the following characteristics.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Each row exchanges at least one pair of adjacent bells. Any given bell can only take part in one exchange per row.&lt;/li&gt;&#xA;&lt;li&gt;The notation for a row lists those bells that are not exchanged. Each row is separated with a &lt;code&gt;.&lt;/code&gt;. However, rows that exchange all bells are notated with an &lt;code&gt;X&lt;/code&gt; and do not use &lt;code&gt;.&lt;/code&gt; separators, so that &lt;code&gt;.16..16.&lt;/code&gt; would actually be notated &lt;code&gt;X16X16X&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The first &lt;code&gt;n-1&lt;/code&gt; rows always exchange bell 1 with the next bell so that it becomes last.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;code&gt;n&lt;/code&gt;th row, also known has the half lead, does not exchange bell 1.&lt;/li&gt;&#xA;&lt;li&gt;The next &lt;code&gt;n-1&lt;/code&gt; rows are the same as the first &lt;code&gt;n-1&lt;/code&gt; rows but in reverse order. This brings bell 1 back to its original position.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;code&gt;2n&lt;/code&gt;th row, also known as the lead end, also does not exchange bell 1.&lt;/li&gt;&#xA;&lt;li&gt;Up to three different lead ends may be used, being named &quot;Plain&quot;, &quot;Bob&quot; and &quot;Single&quot;.&lt;/li&gt;&#xA;&lt;li&gt;After the lead end, the &lt;code&gt;2n-1&lt;/code&gt; rows are rung again, possibly with a different lead end, and this repeats according to a predetermined pattern known as a touch.&lt;/li&gt;&#xA;&lt;li&gt;The method starts and finishes with the bells in ascending order.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The following parts are intended to be submitted as separate questions.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Part 1&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given any number of rows in bell-ringing notation, return a truthy or falsy value depending on whether they represent a valid permutation.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Part 2&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given any number of rows in bell-ringing notation, convert them to permutations and output them in the most convenient format for input into subsequent parts.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Part 3&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a list of permutations corresponding to the first &lt;code&gt;n&lt;/code&gt; rows of a method, append the first &lt;code&gt;n-1&lt;/code&gt; rows in reverse order, and then output the result of combining the permutations.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Part 4&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given the permutation from part 3, and up to three different lead end permutations as output by part 2, and a string representing which the order in which the lead ends are to be used, calculate the permutations before and after each lead end, ensuring that they are all different, and that the last permutation is that the identity permutation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Main rows: 5.1.5.1.5&#xA;Plain lead: 125&#xA;Bob: 145&#xA;Touch: PBPPBPBPPB&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;5.1.5.1.5&lt;/code&gt; means that the permutations are &lt;code&gt;(12)(34)&lt;/code&gt; and &lt;code&gt;(23)(45)&lt;/code&gt; repeated, so the permutation before the first lead end in this case turns out to be just &lt;code&gt;(23)(45)&lt;/code&gt; again. The plain lead is &lt;code&gt;(34)&lt;/code&gt; and the bob is &lt;code&gt;(23)&lt;/code&gt;. The relevant permutations for the touch are as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(23)(45)&#xA;(2453)&#xA;(25)&#xA;(235)&#xA;(245)&#xA;(2345)&#xA;(35)&#xA;(345)&#xA;(243)&#xA;(34)&#xA;(2354)&#xA;(2453)&#xA;(25)(34)&#xA;(2435)&#xA;(2534)&#xA;(253)&#xA;(354)&#xA;(45)&#xA;(23)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;then finishing with the identity permutation as desired.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2018-12-09T22:26:48.303" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17203" PostTypeId="2" ParentId="2140" CreationDate="2018-12-11T14:49:17.400" Score="0" Body="&lt;h1&gt;Buddhabrot (speed edition)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your goal is to generate an image like this one: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/njiVn.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/njiVn.jpg&quot; alt=&quot;Buddhabrot&quot;&gt;&lt;/a&gt;&#xA;(Sandbox: this image will be replaced by a valid solution image for the challenge)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a render of a 2D histogram called Buddhabrot. The algorithm for generating it is very simple. If you have heard of (or written a program to generate) the Mandelbrot Set, this will feel familiar. The algorithm goes as follows: &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Generate a random complex number &lt;span class=&quot;math-container&quot;&gt;\$z_0\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Iteratively perform the calculation &lt;span class=&quot;math-container&quot;&gt;\$z_{i+1}=z_i^2+z_0\$&lt;/span&gt;. Do this &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; times&lt;/li&gt;&#xA;&lt;li&gt;Check if the absolute value of the number &lt;span class=&quot;math-container&quot;&gt;\$z_N\$&lt;/span&gt; is larger than 3&lt;/li&gt;&#xA;&lt;li&gt;If it is, calculate all the numbers &lt;span class=&quot;math-container&quot;&gt;\$z_i, 0 \leq i\leq N\$&lt;/span&gt; again and map them to pixels. &lt;/li&gt;&#xA;&lt;li&gt;For each pixel that is mapped to, add &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; to the counter for that pixel&lt;/li&gt;&#xA;&lt;li&gt;Repeat the 4 steps above a few million (or billion/trillion) times.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Since this algorithm depends on random sampling rather than just a single calculation for each pixel, it is not as easy to parallelize on a GPU. However, a GPU will still perform better than a CPU for this task. Since it is random, it is also dependent on having a large number of iterations to generate a smooth image. With a low number of iterations, the output image will be grainy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To participate in this challenge, write a full program which creates a render of the Buddhabrot. For this challenge, the maximum iteration number is set to 100. That means that for every random complex &lt;span class=&quot;math-container&quot;&gt;\$z_0\$&lt;/span&gt;, you must write to the counter array if &lt;span class=&quot;math-container&quot;&gt;\$|z_{100}| &amp;gt; 3\$&lt;/span&gt;. Note that if &lt;span class=&quot;math-container&quot;&gt;\$|z_i| &amp;gt; 3\$&lt;/span&gt; for some &lt;span class=&quot;math-container&quot;&gt;\$i &amp;lt; 100\$&lt;/span&gt;, then you can quit the calculation, since you know that &lt;span class=&quot;math-container&quot;&gt;\$|z_{100}| &amp;gt; 3\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want some help to get you started, I recently made an attempt to optimize this problem. You can &lt;a href=&quot;https://codereview.stackexchange.com/questions/205592/speeding-up-buddhabrot-calculation-in-pycuda&quot;&gt;read about my journey&lt;/a&gt; if you want. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Generating the image&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A basic algorithm for rendering a Buddhabrot image is described above. To make it efficient, I would suggest that you use an &lt;code&gt;unsigned int*&lt;/code&gt; to hold all the counters for the pixels. When running the program, you calculate which pixel should have its counter increased, then you add 1 to that index in the counter array. When you are done with the random number generation, you take your array of counters, divide every element by the array's maximum value. Then all values in the array will be in the range &lt;span class=&quot;math-container&quot;&gt;\$[0,1]\$&lt;/span&gt;. You can then use that value as the grayscale color of the corresponding pixel.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The output image must be exactly 1024x1024 pixels&lt;/li&gt;&#xA;&lt;li&gt;The maximum iteration number is 100&lt;/li&gt;&#xA;&lt;li&gt;The complex numbers must be sampled from the rectangle in the complex plane given by &lt;span class=&quot;math-container&quot;&gt;\$-2.5 &amp;lt; Re(z_0) &amp;lt; 1.5, -2 &amp;lt; Im(z_0) &amp;lt; 2\$&lt;/span&gt; (Sandbox: these limits are subject to change). The sampling does not have to be uniform (you might discard points which you know are not important). However, it does need to result in a picture which is visually similar to the one in the post.&lt;/li&gt;&#xA;&lt;li&gt;The output image must be a visualization of the area in the complex plane given by &lt;span class=&quot;math-container&quot;&gt;\$-2 &amp;lt; Re(z) &amp;lt; 2, -2 &amp;lt; Im(z) &amp;lt; 2\$&lt;/span&gt; (Sandbox: these limits might change slightly)&lt;/li&gt;&#xA;&lt;li&gt;You have 20 minutes to perform the sampling and generate the image. I will assist with tweaking to maximize your score. &lt;/li&gt;&#xA;&lt;li&gt;You are free to use CUDA or OpenCL to generate the image. For any other methods of implementation, please include instructions on how yo get the environment ready.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To ensure that we have an objective criteria for scoring, your score will be the total sum of all pixel counters. Since the Buddhabrot is a 2D histogram in its essence, this can be seen as the total number of samples. To be specific, you calculate your score before dividing by the maximum value and generating the image. The highest score wins. Note that if your approach is similar to mine, the theoretical maximum score is limited by the memory bandwidth. The bandwidth of my GPU is 484GB/s, and since each counter is 4 bytes, you can get 121 billion iterations per second. However, there might be more effective ways to save the samples using the CUDA caches, which could lead to higher performance than that. (Sandbox: I'm not 100% sure if my maximum speed calculation is valid)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since I already have a working example for this problem, I have decided to add a further incentive. If your solution is 2x faster than my implementation, I'll reward 50 reputation once one month has passed from posting the question. If it is 5x faster, the reward goes up to 100 rep. If it is more than 10x faster, I'll award 150 rep. If you somehow manage to make your solution 30x faster, I'll throw in 200 rep. If multiple answers are eligible for the bonus, only the fastest one will be rewarded. If no answer is eligible for the bounty once one month has passed, the bounty will be rewarded to the first one who claims it. However, you can only claim one bounty, so if you have made your solution 5x faster but want to claim the 10x bounty, I will give you time to optimize your solution to reach the next bounty.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Testing machine&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Intel 5820K 6-core 12-thread CPU running at 4.4GHz&lt;/li&gt;&#xA;&lt;li&gt;16GB DDR4 RAM&lt;/li&gt;&#xA;&lt;li&gt;NVIDIA GTX 1080Ti (11 GB GDDR5X, 3584 CUDA cores)&lt;/li&gt;&#xA;&lt;li&gt;CUDA 9.0 (I'll add information about C++ version and other relevant info)&lt;/li&gt;&#xA;&lt;li&gt;Windows 8.1 (sorry)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/complex-numbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;complex-numbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;complex-numbers&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fractal&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fractal&amp;#39;&quot; rel=&quot;tag&quot;&gt;fractal&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;For the sandbox&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Right now there are a few things that need to be clarified in the description. &lt;/li&gt;&#xA;&lt;li&gt;I will also update the post with an image that is 1024x1024 pixels. Is the question clear? &lt;/li&gt;&#xA;&lt;li&gt;Do I need to clarify anything besides the information that's left out right now?&lt;/li&gt;&#xA;&lt;li&gt;Is it okay to add reputation rewards from the start to attract answers?&lt;/li&gt;&#xA;&lt;li&gt;Are GPU challenges welcome? A short discussion about hardware was had in the chat, and I'm aware that not everyone has a NVIDIA GPU. That's why I made sure that there are OpenCL implementations of this problem. &lt;/li&gt;&#xA;&lt;li&gt;I say that the sampling should be uniform, but there have been some optimized solutions using importance sampling for this specific problem, should I allow that?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79994" LastEditorUserId="79994" LastEditDate="2018-12-14T12:48:53.730" LastActivityDate="2018-12-14T12:48:53.730" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17204" PostTypeId="2" ParentId="2140" CreationDate="2018-12-11T16:11:52.803" Score="0" Body="&lt;p&gt;&lt;strong&gt;Where am I?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an input folder structure (i.e. a tree data structure with named nodes), and a pointer to a directory (a specific node) within that tree structure, the program should output the full path to the directory the pointer is pointing at (in linux format, so &lt;code&gt;/var/log&lt;/code&gt; for example), without ever inspecting the name of the current node or its ancestors; only its descendants.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The rules of the challenge are the equivalent of:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&quot;you can &lt;code&gt;cd&lt;/code&gt; and &lt;code&gt;ls&lt;/code&gt; but not &lt;code&gt;pwd&lt;/code&gt;&quot; if this was being run on a live linux files system&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;but I feel I should expand on that a bit regarding how it works for a tree:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The method starts with the pointer, and it can &lt;code&gt;ls&lt;/code&gt; to see what is contained within this directory (i.e. view the immediate child nodes in the tree structure, but not its own name)&lt;/li&gt;&#xA;&lt;li&gt;the method can also &lt;code&gt;cd dirname&lt;/code&gt; into any directory (i.e. move the pointer to any immediate child in the tree from the current node), and &lt;code&gt;cd ..&lt;/code&gt; to go to a previous directory (i.e. move the pointer to the immediate previous child in the tree)&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;cd ..&lt;/code&gt; leaves you in the same directory (node), if there is no parent&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cd invalidDirName&lt;/code&gt;leaves you in the same directory (node), if there is no immediate child with that name&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Any directory can contain any number of other directories, or none.&lt;/li&gt;&#xA;&lt;li&gt;You are forbidden to do the equivalent of &lt;code&gt;cd /&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Inputs&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A tree-structure representing a file system and a pointer to a node in that tree&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Assumptions&lt;/em&gt;&#xA; 1. There are no duplicate folder names in the same parent folder (so &lt;code&gt;ls&lt;/code&gt; can't return &lt;code&gt;folder&lt;/code&gt;, &lt;code&gt;folder&lt;/code&gt;; for example) - but there may be other folders with the same name elsewhere in the tree structure; in which case it doesn't matter which your program outputs (as it has no way of knowing which is correct)&#xA; 2. ...Therefore, it may not be possible to determine which folder you started in - in which case a best-guess is fine (see examples 3, 4)&#xA; 3. Symlinks and cyclical trees are not a part of this challenge - it will always be a simple parent-child tree structure - so you are always guaranteed to find the root by doing &lt;code&gt;cd ..&lt;/code&gt; enough times.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The path that the pointer was pointing at, as a string or char array (or equivalent for your language).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; scoring is used, so shortest bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 1&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;input map:&lt;/em&gt; &lt;code&gt;/var/ftp/in, /var/ftp/out/child, /var/etc/test/child/etc, /var/etc/test/c2/etc2, /var/etc/test/c3&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;input pointer points at:&lt;/em&gt; &lt;code&gt;c2&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;sample working:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;ls&lt;/code&gt; -&gt; &quot;etc2&quot;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cd ..&lt;/code&gt;, &lt;code&gt;ls&lt;/code&gt; -&gt; &quot;child&quot;,&quot;c2&quot;, &quot;c3&quot; - three options, need to find which is correct&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cd child&lt;/code&gt;, &lt;code&gt;ls&lt;/code&gt; -&gt; &quot;etc2&quot; - this doesn't match 1, so go back&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cd ..&lt;/code&gt;, &lt;code&gt;cd c2&lt;/code&gt;, &lt;code&gt;ls&lt;/code&gt; -&gt; &quot;etc2&quot; - this is correct, so I know my path ends with &quot;/c2&quot;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cd ..&lt;/code&gt;, &lt;code&gt;cd ..&lt;/code&gt;, &lt;code&gt;ls&lt;/code&gt; -&gt; &quot;test&quot; - only one folder, so I know my path ends with &quot;/test/c2&quot;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cd ..&lt;/code&gt;, &lt;code&gt;ls&lt;/code&gt; -&gt; &quot;ftp&quot;, &quot;etc&quot; - two options, need to find which is correct&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cd ftp&lt;/code&gt;, &lt;code&gt;ls&lt;/code&gt; -&gt; &quot;in&quot;, &quot;out&quot; - incorrect, so go back&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cd ..&lt;/code&gt; -&gt; there was only two options, so &quot;etc&quot; must be correct. my path ends with &quot;/etc/test/c2&quot;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cd ..&lt;/code&gt;, &lt;code&gt;ls&lt;/code&gt; -&gt; &quot;var&quot; - only one folder, so path ends with &quot;/var/etc/test/c2&quot;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cd ..&lt;/code&gt;, &lt;code&gt;ls&lt;/code&gt; -&gt; &quot;var&quot; - same option, so assume we're at root.&lt;/li&gt;&#xA;&lt;li&gt;Output &quot;/var/etc/test/c2&quot;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 2&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;input map:&lt;/em&gt; /app/data/dir/in&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;input pointer points at:&lt;/em&gt; /app/data&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Output:&lt;/em&gt; &quot;/app/data&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 3&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;input map:&lt;/em&gt; /var, /app, /test&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;input pointer points at:&lt;/em&gt; /app&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Output:&lt;/em&gt; &quot;/var&quot;, &quot;/app&quot; or &quot;/test&quot; are all valid outputs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that there is no way for the program to differentiate between the three folders; and so any of the three are a valid answer for the purposes of this application.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 4&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;input map:&lt;/em&gt; /var/etc/test, /app/etc/two&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;input pointer points at:&lt;/em&gt; /app/etc&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Output:&lt;/em&gt; &quot;/app/etc&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Questions&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Does the spec make sense?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="62289" LastEditorUserId="62289" LastEditDate="2019-09-23T14:16:08.487" LastActivityDate="2019-09-23T14:16:08.487" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17206" PostTypeId="2" ParentId="2140" CreationDate="2018-12-12T18:47:05.557" Score="0" Body="&lt;h1&gt;Prime Steganography&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/steganography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;steganography&amp;#39;&quot; rel=&quot;tag&quot;&gt;steganography&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/prime&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;prime&amp;#39;&quot; rel=&quot;tag&quot;&gt;prime&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Alice and Bob have devised a steganography encryption method where they encode the letters of their message (the &quot;secret message&quot;) into the letters in the prime positions of the larger message  (the &quot;carrier message&quot;). Your job is to create a program which takes a secret message as input and outputs a carrier message that hides the secret message in the letters in the prime positions.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Requirements&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Only letter characters in the carrier message count toward positions.&lt;/li&gt;&#xA;&lt;li&gt;The secret message is not case sensitive and non-letters do not need to be encoded in any way.&lt;/li&gt;&#xA;&lt;li&gt;The carrier message must contain only words that can be found in &lt;a href=&quot;https://github.com/dwyl/english-words&quot; rel=&quot;nofollow noreferrer&quot;&gt;this list of English words&lt;/a&gt;. The carrier message does not need to make sense.&lt;/li&gt;&#xA;&lt;li&gt;The carrier message can contain punctuation (any of &lt;code&gt;.,?!&quot;':;-&lt;/code&gt;), whitespace, and letter characters only.&lt;/li&gt;&#xA;&lt;li&gt;The carrier message cannot hide a message that is longer than the secret message. If it ends on a prime after the last one needed, it is invalid. For instance, if the carrier message is 38 letters long and the secret message is only 11 letters long, the carrier would encode an extra letter and therefore is invalid. (&lt;em&gt;Sandbox: help me phrase this better&lt;/em&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input: 'Hello world'&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Possible Output:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Ah! Eels live! Oh wall! Oars will board.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Lining up all the letters, you get these positions&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; A  h  E  e  l  s  l  i  v  e  O  h  w  a  l  l  O  a  r  s  w  i  l  l  b  o  a  r  d&#xA; 1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;All the letters in the prime positions would be extracted. &lt;code&gt;h&lt;/code&gt; at 2, &lt;code&gt;E&lt;/code&gt; at 3, &lt;code&gt;l&lt;/code&gt; at 5, &lt;code&gt;l&lt;/code&gt; at 7, &lt;code&gt;O&lt;/code&gt; at 11, &lt;code&gt;w&lt;/code&gt; at 13, &lt;code&gt;O&lt;/code&gt; at 17, &lt;code&gt;r&lt;/code&gt; at 19, &lt;code&gt;l&lt;/code&gt; at 23, and &lt;code&gt;d&lt;/code&gt; at 29. Thus the full message is &lt;code&gt;hEllOwOrld&lt;/code&gt;, but case doesn't matter.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard rules and loopholes apply.&lt;/li&gt;&#xA;&lt;li&gt;You can read in the word list using any method you would like, or not at all. Other word lists may be used and will not count toward byte count, but every word in your output must appear somewhere in the &lt;a href=&quot;https://github.com/dwyl/english-words&quot; rel=&quot;nofollow noreferrer&quot;&gt;previously mentioned word list&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that the secret message only includes letters, whitespace, and punctuation.&lt;/li&gt;&#xA;&lt;li&gt;Your program does not need to be deterministic, but does need to always output a valid carrier message which correctly encodes the secret message.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that the secret message is possible to encode with English words from the list. (Even though it may not be for one reason or another)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Sandbox note&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I'm thinking this might make for an interesting popularity contest. The objective criteria is validity of the carrier message. The subjective criteria is how interesting/entertaining/convincing the messages that it outputs are.&lt;/p&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2018-12-13T22:29:39.193" LastActivityDate="2018-12-13T22:29:39.193" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17207" PostTypeId="2" ParentId="2140" CreationDate="2018-12-12T23:10:02.330" Score="0" Body="&lt;h1&gt;Stego-nography: Hide A Stegosaurus with Steganography!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/steganography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;steganography&amp;#39;&quot; rel=&quot;tag&quot;&gt;steganography&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;This doesn't work as a cops and robbers challenge. Leaving for possible inspiration.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Making something that converts an image with a live dinosaur into one with a dead dinosaur would be a clone of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/25443/hiding-information-in-cats&quot;&gt;Hiding information in Cats&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Cops&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Devise a method for hiding this ASCII stegosaurus in an image.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;                         .       .&#xA;                        / `.   .' &quot;&#xA;                .---.  &amp;lt;    &amp;gt; &amp;lt;    &amp;gt;  .---.&#xA;                |    \  \ - ~ ~ - /  /    |&#xA;    _____          ..-~             ~-..-~&#xA;   |     |   \~~~\.'                    `./~~~/&#xA;  ---------   \__/                        \__/&#xA; .'  O    \     /               /       \  &quot;&#xA;(_____,    `._.'               |         }  \/~~~/&#xA; `----.          /       }     |        /    \__/&#xA;       `-.      |       /      |       /      `. ,~~|&#xA;           ~-.__|      /_ - ~ ^|      /- _      `..-'&#xA;                |     /        |     /     ~-.     `-. _  _  _&#xA;                |_____|        |_____|         ~ - . _ _ _ _ _&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Source: &lt;a href=&quot;https://github.com/piuccio/cowsay/blob/master/cows/stegosaurus.cow&quot; rel=&quot;nofollow noreferrer&quot;&gt;custom 'cow' for cowsay&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Create an encoder and a decoder. Post the decoder and two versions of three different images, each pair with and without the encoded stegosaurus. Include hashes for each of the six images.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules and Scoring&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The decoder must be able to decode any arbitrary ASCII text of at least the same size as the stegosaurus (either 677 characters or 14x63 characters if you assume the text is right-padded. Be consistent).&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Only the part of the encoded message that actually includes the stegosaurus matters; extra bytes in the message can be ignored by the user or decoder, but must be either before/after the 677 characters or outside the 14x63 bounding rectangle, depending on how you encode it. (&lt;em&gt;Sandbox: this phrasing is awkward&lt;/em&gt;)&lt;/li&gt;&#xA;&lt;li&gt;In short, it must be possible for the robbers to kill your dinosaur (link to robber thread goes here) by replacing your stegosaurus with a dead one.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;You may not use asymmetric encryption in your solution. (For example, encrypting the stegosaurus with your private key before hiding it and then putting the public key in the decoder)&lt;/li&gt;&#xA;&lt;li&gt;You can use any lossless image format of your choice.&lt;/li&gt;&#xA;&lt;li&gt;You do not need to post the source code of your decoder. Precompiled Windows or Linux binaries are allowed, but must be packaged with all of their dependencies and be able to be run without any installation. Obfuscation and minification are allowed for interpreted languages and likewise should prepackage all third-party dependencies.&lt;/li&gt;&#xA;&lt;li&gt;You may not host your decoder on a webservice. The reason why is that it enables you to use symmetric encryption with no way to derive the key.&lt;/li&gt;&#xA;&lt;li&gt;As an objective criteria for the encoded images to be not easily distinguishable, the maximum absolute pixel difference between the images should be less than 4/255 for each color component in the entire image.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If at least one of your dinosaurs survives after one week, your dinosaurs are safe and you earn 10 points (after which point you can explain your algorithm). If your dinosaurs are all killed within a week, you score 1 point for each 24 hour period they survived.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The cop with the most points wins.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Robbers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You're a dinosaur hunter. The cops have hidden stegosauruses in three images. It's your job to find the stegos and kill them. You are to change the message hidden in each image from the original stegosaurus to this dead one:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;                         .       .&#xA;                        / `.   .' &quot;&#xA;                .---.  &amp;lt;    &amp;gt; &amp;lt;    &amp;gt;  .---.&#xA;                |    \  \ - ~ ~ - /  /    |&#xA;                   ..-~             ~-..-~&#xA;             \~~~\.'                    `./~~~/&#xA;              \__/                        \__/&#xA;                /               /       \  &quot;&#xA;    _____     .'               |         }  \/~~~/&#xA;   |     |  .'   /       }     |        /    \__/&#xA;  --------''    |       /      |       /      `. ,~~|&#xA; .'  X        __|      /_ - ~ ^|      /- _      `..-'&#xA;(_____     _-~  |     /        |     /     ~-.     `-. _  _  _&#xA; `__U___--~     |_____|        |_____|         ~ - . _ _ _ _ _&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Cracking a cop submission requires that you kill all of its hidden dinosaurs. You earn a point for each submission you crack. Note that the cop can encode garbage or null data around the dinosaur (either by bounding box or before/after the 677 characters), but you do not need to leave this data untouched.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The robber with the most cracked submissions wins.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Does this work as a cops-and-robbers challenge? Any problematic loopholes or ways to abuse this?&lt;/p&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2018-12-13T23:01:27.420" LastActivityDate="2018-12-13T23:01:27.420" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17209" PostTypeId="2" ParentId="2140" CreationDate="2018-12-13T11:24:20.620" Score="-3" Body="&lt;p&gt;Output a number &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; such that:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$n\text{mod}10=5\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$n^2\text{mod}10^{10000}=n\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Shortest code win. You should be able to try it rather than purely know it work.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sandbox mainly to check duplication&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-12-13T15:01:28.727" LastActivityDate="2018-12-13T15:01:28.727" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="17210" PostTypeId="2" ParentId="2140" CreationDate="2018-12-13T12:57:01.697" Score="3" Body="&lt;h1&gt;Non-overlapping Matrix Sum&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given &lt;em&gt;k&lt;/em&gt; arrays of length &lt;em&gt;n&lt;/em&gt;, output the maximum sum possible using one element from each matrix such that no two elements are from the same position. It is guaranteed that k&amp;lt;=n.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A nonempty list of nonempty arrays of integers.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;An integer that represents the maximum sum.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input -&amp;gt; Output&#xA;[[1]] -&amp;gt; 1&#xA;[[1, 3], [1, 3]] -&amp;gt; 4&#xA;[[1, 4, 2], [5, 6, 1]] -&amp;gt; 9&#xA;[[-2, -21],[18, 2]] -&amp;gt; 0&#xA;[[1, 2, 3], [4, 5, 6], [7, 8, 9]] -&amp;gt; 15&#xA;[[1, 2, 3, 4], [5, 4, 3, 2], [6, 2, 7, 1]] -&amp;gt; 16&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="20438" LastEditorUserId="20438" LastEditDate="2018-12-13T21:55:43.387" LastActivityDate="2018-12-13T21:55:43.387" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17218" PostTypeId="2" ParentId="2140" CreationDate="2018-12-17T06:49:03.200" Score="5" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Progress: Updated the rules again, and also add the timed function to the bots.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Sylver Coinage KotH &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot;&gt;python&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Sylver_coinage&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sylver Coinage&lt;/a&gt; is a 2-player mathematical game that has the following rules:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Two players take turns announcing a natural number each time.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each number announced must be unrepresentable as the sum of non-negative multiples of the numbers announced before.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Eg. if the first three numbers announced are &lt;span class=&quot;math-container&quot;&gt;\$\{6, 11, 15\}\$&lt;/span&gt;, then you cannot announce any numbers representable as &lt;span class=&quot;math-container&quot;&gt;\$6n_1+11n_2+15n_3\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$n_1,n_2,n_3\ge0\$&lt;/span&gt;. You can announce, for example, &lt;span class=&quot;math-container&quot;&gt;\$16\$&lt;/span&gt;, though.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The player who announced a number not complying with Rule 2, or the number 1, loses.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Here is a twist -- R. L. Hutchings proved that announcing a prime number as the first play provides a winning strategy for the first player, although the detail of the strategy is not yet known. &lt;s&gt;So I put a restriction here: &lt;strong&gt;the first player cannot announce a prime number in the first step.&lt;/strong&gt;&lt;/s&gt; Now the first two numbers will be generated randomly by the driver at the beginning. No more restriction on prime numbers now.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Technical Information&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A bot playing the game will have to implement a Python 3 class, extending &lt;code&gt;TimedBot&lt;/code&gt;, with two methods: &lt;code&gt;announce()&lt;/code&gt; and &lt;code&gt;learn()&lt;/code&gt;. &lt;code&gt;announce()&lt;/code&gt; should receive a list of numbers (possibly empty) and return a single integer, and &lt;code&gt;learn()&lt;/code&gt; should receive two integers (id of the first move and second move) and the complete list of the numbers in the last game played. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is a sample implementation. &lt;strong&gt;Note: DO NOT use this as your submission -- this sample only serves as a demonstration, and it may announce numbers that violate Rule 2.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;class SampleBot(TimedBot):     # must not be changed.&#xA;    def __init__(self, id):&#xA;        super().__init__()     # must not be changed.&#xA;        self.id = id&#xA;&#xA;    def announce(self, list):&#xA;        import random&#xA;        return random.randint(1, 101)&#xA;&#xA;    def learn(self, first, second, list):&#xA;        pass&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;&lt;a href=&quot;https://tio.run/##rVRNj9owEL37V0zZi816acLeVsuq6g/opb2hCJnEWSwlTuoYEEL72@nYCYkDLFKr5gDJfLw38zzj@mA3lX4@ndJCNA38UqXMvlf2hQA@mcxhtVJa2dWKNrLIWWt3j/ucWQyHBcyjWUT6DGfMaL7VaRDuHLnH4DAV5r0JfO5RZV0Z63NHdoHwzuipKBv51uhzNCPYUcRQ5NMCaIADTyDGobVR2tI@Yew00m6NhjW5MOSEtLr9FGVdSBSOnhVkn0jIQWWhjNtaGspmfQwbK6wybFJlrbrfzuC@xKwnEFpXqIPsCArV2ICik9YInVXlZQetdeb@XP8xhzjCJ2b3GQspjO7ocmUay7HctNLZFXuN8hDyADtpDqC0zHOVKqktcTCqKdAkTFqVa6oxt0tUjkHTIsDJKwMKAVzF75JGHDQ8AtZbLKPkcpgQGRYL0GNz0PZSw9evPjUZhciip4Y3iK/zsWJ3IKO6cZiUqyN@Sdh1gu/yGigsRvXFYEsYTQLnj0pLQoqqcYv2FBNvXEBE9LZs8GWZkHVl/dswhBHjwUjGLIEHxKsLkUrYK7uBQ7U14PM20sgZIeMh2W9UIYE6IRwNg1eYdxoLDmsOKQc3mLemB6n/g/k8BvPpVMAUnqfTNXxZuM@0/cxw6rOR@60d3ejs6AMvHaXSVPCUtX73teaZP@/5cE5neQMGHqImnUj@ZF4hajN3mOJkXbpjSmb9YnoVyXDPTI7RBz3GH6zf3QyO84/JDMe8FJbaQy3pAOTuBy1KuVrxEF7huu1Yi7u/HMsdh4EVldwHl441GD2Z3Fmu/uhvrNb1MDvAR0R8nJBbZmx2is323TngpUo47PG33dZXz7hnuIGoZzTs0V29wG6ExbZB/t6KAmwFx@d/EpG7WtnA2u2biyD9vbBzd0pwJ3xeWvzXNdzh9pOIMi537V3V3QAxXjs@5rKMvdLNDX4X76Cva@g9vo7T6Q8&quot; rel=&quot;nofollow noreferrer&quot;&gt;Test Drive&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;class TimedBot:&#xA;    def __init__(self):&#xA;        self.time = 20.0&#xA;&#xA;    def timed(func):&#xA;        def f(self, *args):&#xA;            import time&#xA;            a = time.time()&#xA;            b = func(self, *args)&#xA;            self.time -= (time.time() - a)&#xA;            print(self.time)&#xA;            return b&#xA;        return f&#xA;&#xA;class SampleBot(TimedBot):&#xA;    def __init__(self, id):&#xA;        super().__init__()&#xA;        self.id = id&#xA;&#xA;    @TimedBot.timed&#xA;    def announce(self, list):&#xA;        import random&#xA;        return random.randint(1, 100001)&#xA;&#xA;    @TimedBot.timed&#xA;    def learn(self, first, second, list):&#xA;        pass&#xA;&#xA;# very inefficient&#xA;def islinearcomb(n, l):&#xA;    if len(l):&#xA;        for i in range(0, n + 1, l[0]):&#xA;            if i == n:&#xA;                return [n // l[0]]&#xA;            elif len(l) &amp;gt; 1:&#xA;                isl = islinearcomb(n - i, l[1:])&#xA;                if isl:&#xA;                    return [i // l[0]] + isl&#xA;    return None&#xA;&#xA;lose = -1&#xA;turn = 0&#xA;nums = []&#xA;bots = [SampleBot(0), SampleBot(1)] # replace with your bots here.&#xA;&#xA;import random&#xA;while (len(nums) &amp;lt; 2):&#xA;    a, b, c, d = random.randint(1, 10), random.randint(1, 10), random.randint(1, 10), random.randint(1, 10)&#xA;    if 2**a * 3**b != 2**c * 3**d and 2**a * 3**b &amp;gt; 100000 and 2**c * 3**d &amp;gt; 100000 and 2**min(a,c) * 3**min(b,d) &amp;gt; 12:&#xA;        nums = [2**a * 3**b, 2**c * 3**d]&#xA;while lose &amp;lt; 0:&#xA;    v = bots[turn].announce(nums)&#xA;    print(&quot;{0}({1}) announced {2}&quot;.format(type(bots[turn]).__name__, bots[turn].id, v))&#xA;    w = islinearcomb(v, nums)&#xA;    if w:&#xA;        str = &quot;&quot;&#xA;        for i in range(0, len(nums)):&#xA;            if i:&#xA;                str += &quot;+&quot;&#xA;            str += &quot;{0}*{1}&quot;.format(nums[i], w[i] if i &amp;lt; len(w) else 0)&#xA;        print(&quot;{0}({1}) announced {2} that is equal to {3}&quot;.format(type(bots[turn]).__name__, bots[turn].id, v, str))&#xA;        lose = turn&#xA;    elif v == 1:&#xA;        print(&quot;{0}({1}) announced 1&quot;.format(type(bots[turn]).__name__, bots[turn].id))&#xA;        lose = turn&#xA;    nums += [v]&#xA;    turn = 1 - turn&#xA;print(&quot;{0}({1}) wins&quot;.format(type(bots[1 - lose]).__name__, bots[1 - lose].id))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Restrictions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each bot will have 20 seconds of time for deciding a move &lt;code&gt;todo: adjustments&lt;/code&gt;. Running out time during the move results in a lose, and failing to finish a method within 20 seconds will lead to disqualification and rerun of all 100 rounds with the remaining bots.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Schedule&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Submissions will be open until &lt;code&gt;todo: date here&lt;/code&gt;. After that 100 complete round-robin rounds will be done. Each pair of bots will compete twice in each round, one with the first bot announcing first, and one with the second bot announcing first. Each win brings 3 points, each draw brings 1 point, and each lose brings no points. The bot with the highest points after 100 rounds wins. The tiebreaker will be as follows:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Points got&lt;/li&gt;&#xA;&lt;li&gt;Wins achieved&lt;/li&gt;&#xA;&lt;li&gt;Drawing lots&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="71546" LastEditorUserId="71546" LastEditDate="2019-01-10T01:34:52.020" LastActivityDate="2019-01-10T01:34:52.020" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="17220" PostTypeId="2" ParentId="2140" CreationDate="2018-12-17T16:15:22.800" Score="2" Body="&lt;h1&gt;Squish these Numbers&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;META:&lt;/strong&gt; I think my wording is not very clear, if you have a suggestion to make it easier to understand, feel free add a commment or edit it directly in to this post.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/statistics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;statistics&amp;#39;&quot; rel=&quot;tag&quot;&gt;statistics&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a finite sequence of real floating point numbers, map it into the Interval &lt;span class=&quot;math-container&quot;&gt;\$[-1,1]\$&lt;/span&gt;, such that the order of these numbers is preserved.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can choose any mapping you like, it doesn't have to be linear.&lt;/li&gt;&#xA;&lt;li&gt;The mapping you choose doesn't have to stem from a function, that means some number &lt;span class=&quot;math-container&quot;&gt;\$x\in \mathbb R\$&lt;/span&gt; doesn't have to get mapped to the same number in &lt;span class=&quot;math-container&quot;&gt;\$[-1,1]\$&lt;/span&gt;, the value it does get mapped to can change depending on the other values in the input list.&lt;/li&gt;&#xA;&lt;li&gt;Two equal values in the input list, should remain equal in the output.&lt;/li&gt;&#xA;&lt;li&gt;If some value in the input list is strictly smaller than some other value, then the corresponding values in the output should satisfy the same relation, in theory. In practice it might happend that two different numbers will get mapped to the same output due to floating point arithmetic issues, which is fine - as long as it would work with an arbitrary precision.&lt;/li&gt;&#xA;&lt;li&gt;You can assume the input sequence contains at least two distinct entries.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;Following example finds a linear map that maps the least entry to &lt;span class=&quot;math-container&quot;&gt;\$-1\$&lt;/span&gt; and the greatest entry to &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt;. Note how this map depends on the sequence.&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$ (x_1,x_2,\ldots,x_n) \mapsto \left( \frac{x_i - \min_k x_k}{\max_k x_k - \min_k x_k} \right)_{i=1}^n $$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Following example is a fixed function that always behave the same. Because it is monotonic and strictly increasing, it satisfies all conditions.&#xA;&lt;span class=&quot;math-container&quot;&gt;$$ (x_i)_{i=1}^n \mapsto \left(\frac{\arctan(x_i)}{\pi} \right)_{i=1}^n$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Thanks @PeterTaylor for following example. Here &lt;span class=&quot;math-container&quot;&gt;\$\operatorname{sort}(x)\$&lt;/span&gt; sorts the input sequence in ascending order and &lt;span class=&quot;math-container&quot;&gt;\$\operatorname{indexof}(u,v)\$&lt;/span&gt; returns the index of the first occurence of &lt;span class=&quot;math-container&quot;&gt;\$v\$&lt;/span&gt; in the sequence &lt;span class=&quot;math-container&quot;&gt;\$u\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$(x_i)_{i=1}^n \mapsto \left( \frac{1}{n} \operatorname{indexof}(\operatorname{sort}(x),x_i)\right)_{i=1}^n$$&lt;/span&gt;&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-12-28T17:46:16.473" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17221" PostTypeId="2" ParentId="2140" CreationDate="2018-12-17T22:05:46.177" Score="0" Body="&lt;h1&gt;A Golden March&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fibonacci&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fibonacci&amp;#39;&quot; rel=&quot;tag&quot;&gt;fibonacci&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Draw a circle whose circumference is the golden mean. Choose a point and label it 1, then move clockwise around the circle in steps of arc length 1, labeling the points 2, 3, and so on. At each step, the difference between each pair of adjacent numbers on the circle is a Fibonacci number.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;from &lt;a href=&quot;https://www.futilitycloset.com/2013/12/04/a-golden-march/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Futility Closet&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Given some natural number &lt;span class=&quot;math-container&quot;&gt;\$ n \geq 1 \$&lt;/span&gt;, determine the first &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; points as described above. Then determine &lt;em&gt;all&lt;/em&gt; differences between pairs of adjecent numbers and return them as a list.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The list should contain all the differences in the order in which they appear.&lt;/li&gt;&#xA;&lt;li&gt;It should start with the difference between &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; and one of its adjecent neighbours. Then you need to continue recording the differences in the direction you started with.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;to be determined.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-12-17T22:05:46.177" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17222" PostTypeId="2" ParentId="2140" CreationDate="2018-12-18T18:11:38.243" Score="2" Body="&lt;h1&gt;Count smooth numbers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Define &lt;span class=&quot;math-container&quot;&gt;\$\Psi(x,B)\$&lt;/span&gt; as the number of integers between &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;, whose prime factors are all &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; or less. (These are the &lt;a href=&quot;https://en.wikipedia.org/wiki/Smooth_number&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;-smooth numbers&lt;/a&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, there are 34 integers between 1 and 100 that have only 2, 3 and 5 as prime factors. These are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 1  2  3  4  5  6  8  9 10 12&#xA;15 16 18 20 24 25 27 30 32 36&#xA;40 45 48 50 54 60 64 72 75 80&#xA;81 90 96 100&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Therefore, &lt;span class=&quot;math-container&quot;&gt;\$\Psi(100,5)=34\$&lt;/span&gt;. The next prime is 7, so &lt;span class=&quot;math-container&quot;&gt;\$\Psi(100,6)\$&lt;/span&gt; is also 34.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a challenge to calculate exact values of &lt;span class=&quot;math-container&quot;&gt;\$\Psi\$&lt;/span&gt; as quickly as possible.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Methods&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You may not use libraries or built-ins that calculate this function. That being said, I don't know any language that has a built-in for this (not even Mathematica?)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also can't seem to find any fast algorithms for this problem, except for a basic &lt;a href=&quot;https://cr.yp.to/papers/epsi.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;meet-in-the-middle&lt;/a&gt; by Daniel J. Bernstein which might be a good starting point.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bernstein also describes an &lt;a href=&quot;https://cr.yp.to/psibound.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;approximation method&lt;/a&gt; that may or may not be useful.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input range&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You may assume that &lt;span class=&quot;math-container&quot;&gt;\$1&amp;lt;B\leq x\leq 10^{100}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$B&amp;lt;10^6\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You will be scored on tiers of increasing difficulty.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each tier has several inputs &lt;span class=&quot;math-container&quot;&gt;\$(x,B)\$&lt;/span&gt; such that the &lt;span class=&quot;math-container&quot;&gt;\$\Psi(x,B)\$&lt;/span&gt; have similar values, and the &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; values are distributed exponentially. Tiers will start at around &lt;span class=&quot;math-container&quot;&gt;\$\Psi(x,B)\approx 10^9\$&lt;/span&gt; and go up to &lt;span class=&quot;math-container&quot;&gt;\$\Psi(x,B)\approx 10^{20}\$&lt;/span&gt; or more, depending on how fast the entries get.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The time limit for each tier is 60 CPU seconds per input on average. In other words, if a tier has &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; inputs, you will essentially have &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; CPU minutes to obtain the outputs. You are welcome to submit parallel code but each thread will count towards the time limit.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your score is the highest tier that your program can solve. If there is a tie, the program that is fastest on the highest tier wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For practical reasons, your program will be limited to 15GiB of memory.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sample tiers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Warm-ups:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3:&#xA;  Ψ(10^3, 997) = 1000&#xA;  Ψ(10^6, 7)   = 1273&#xA;  Ψ(10^9, 5)   = 1530&#xA;6:&#xA;  Ψ(10^6,  999983) = 1000000&#xA;  Ψ(10^9,  59)     = 1060717&#xA;  Ψ(10^12, 29)     = 1469549&#xA;  Ψ(10^15, 17)     =  919814&#xA;  Ψ(10^36, 7)      =  936046&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Tiers:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;9:&#xA;  Ψ(10^9,  999983) =  616220853&#xA;  Ψ(10^10, 4567)   =  954965955&#xA;  Ψ(10^12, 337)    = 1180049403&#xA;  Ψ(10^15, 97)     = 1016358704&#xA;  Ψ(10^18, 59)     = 1106651678&#xA;  Ψ(10^24, 31)     =  791377032&#xA;  Ψ(10^30, 23)     =  812060729&#xA;  Ψ(10^48, 17)     = 1435897064&#xA;10:&#xA;  Ψ(10^11, 11987) = 10016301575&#xA;  Ψ(10^12, 1499)  = 10753426440&#xA;  Ψ(10^15, 199)   = 12766644440&#xA;  Ψ(10^18, 89)    =  9052115006&#xA;  Ψ(10^24, 47)    = 11298682134&#xA;  Ψ(10^30, 37)    = 14838208717&#xA;  Ψ(10^48, 19)    =  7868307089&#xA;11:&#xA;  Ψ(10^13, 2297) =  84344528150&#xA;  Ψ(10^15, 443)  =  96272828440&#xA;  Ψ(10^18, 163)  = 107816435926&#xA;  Ψ(10^36, 37)   =  94053521936&#xA;  Ψ(10^24, 67)   =  81421195505&#xA;  Ψ(10^48, 29)   = 151266342065&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I may choose to do the actual scoring on different inputs, including using &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;'s that are not powers of 10.&lt;/p&gt;&#xA;" OwnerUserId="75067" LastEditorUserId="75067" LastEditDate="2018-12-19T03:23:17.040" LastActivityDate="2018-12-19T03:23:17.040" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17223" PostTypeId="2" ParentId="2140" CreationDate="2018-12-18T22:33:50.293" Score="-3" Body="&lt;h1&gt;Integer or decimal to array and array to decimal or integer&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write two functions&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1) Convert an integer or decimal to array of integers that potentially includes a single decimal&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2) Convert array including integers and potentially a single decimal to integer or decimal&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Integer or decimal to array&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An integer or decimal&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Array to integer or decimal &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An array&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Integer or decimal to array&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An array containing each digit of the input at an individual index with the first decimal portion of input containing the decimal character. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Array to integer or decimal &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An integer or decimal equal to input&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Specification&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;When the first digit of a decimal is a 0 , and a digit follows, that value includes all 0's up to and including the last digit of that decimal, else the decimal portion is spread or expanded to the remainder of the decimal portion for the remainder of indexes of the array, that is: &lt;code&gt;-0.01 &amp;lt;-&amp;gt; [-0.01]&lt;/code&gt;, &lt;code&gt;100.01 &amp;lt;-&amp;gt; [1,0,0,0.01]&lt;/code&gt;, &lt;code&gt;100.0001 &amp;lt;-&amp;gt; [1,0,0,0.0001]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input &amp;lt;----------&amp;gt; Output&#xA;&#xA;-123               [-1,-2,-3]&#xA;4.4                [4,0.4]&#xA;44.44              [4,4,0.4,4]&#xA;-0.01              [-0.01]&#xA;123                [1,2,3]&#xA;200                [2,0,0]&#xA;2.718281828459     [2,0.7,1,8,2,8,1,8,2,8,4,5,8,9]&#xA;321.7000000001     [3,2,1,0.7,0,0,0,0,0,0,0,0,1]&#xA;809.56             [8,0,9,0.5,6]&#xA;1.61803398874989   [1,0.6,1,8,0,3,3,9,8,8,7,4,9,8,9]&#xA;1.999              [1,0.9,9,9]&#xA;100.01             [1,0,0,0.01]&#xA;545454.45          [5,4,5,4,5,4,0.4,5]&#xA;-7                 [-7]&#xA;-83.782            [-8,-3,-0.7,-8,-2]&#xA;1.5                [1,0.5]&#xA;100.0001           [1,0,0,0.0001]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Winning criteria&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Least amount of total (each of function or programs 1 and 2) bytes used.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="31257" LastEditorUserId="31257" LastEditDate="2018-12-20T07:53:32.480" LastActivityDate="2018-12-20T07:53:32.480" CommentCount="39" ContentLicense="CC BY-SA 4.0" />
  <row Id="17225" PostTypeId="2" ParentId="2140" CreationDate="2018-12-19T20:24:45.853" Score="1" Body="&lt;h1&gt;Minimal Substring Lookup Table&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A fairly common component of code golf challenges is taking input as a string, and finding the index of that string within an array. A common way to golf that action is to instead store a substring of each item in the array, and take the same substring of the input to use when looking up the index. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/q/141675/71434&quot;&gt;this question&lt;/a&gt; has some fairly large strings that need to be indexed, but &lt;a href=&quot;https://codegolf.stackexchange.com/a/141677/71434&quot;&gt;this answer&lt;/a&gt; found that each item could be uniquely identified by its 4th letter. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Find the shortest substring that, when applied to each string in the input, results in a new set of unique strings.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input is list of strings in any &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/71434&quot;&gt;default format&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;The strings will consist of &lt;a href=&quot;https://en.wikipedia.org/wiki/ASCII#Printable_characters&quot; rel=&quot;nofollow noreferrer&quot;&gt;printable ASCII&lt;/a&gt; characters.&lt;/li&gt;&#xA;&lt;li&gt;The strings will not have trailing spaces&lt;/li&gt;&#xA;&lt;li&gt;There will be no duplicate strings&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output should be a list of the shortened strings after applying the substring&lt;/li&gt;&#xA;&lt;li&gt;If outputting indexes, 0-indexing or 1-indexing may be used.&lt;/li&gt;&#xA;&lt;li&gt;When strings have different lengths, substrings exceeding the length of some lines may be handled any of these ways:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Truncate to the available characters, e.g. &lt;code&gt;[&quot;abc&quot;,&quot;acd&quot;,&quot;ab&quot;] =&amp;gt; [&quot;bc&quot;,&quot;cd&quot;,&quot;b&quot;]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Pad shorter strings with spaces, e.g. &lt;code&gt;[&quot;abc&quot;,&quot;acd&quot;,&quot;ab&quot;] =&amp;gt; [&quot;bc&quot;,&quot;cd&quot;,&quot;b &quot;]&lt;/code&gt;. Note that input strings can contain spaces which need to be taken into account, so &lt;code&gt;[&quot;ab c&quot;,&quot;acdc&quot;,&quot;ab&quot;]&lt;/code&gt; must not become &lt;code&gt;[&quot;b &quot;,&quot;cd&quot;,&quot;b &quot;]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Wrap back to the start of the shorter string, e.g. &lt;code&gt;[&quot;abc&quot;,&quot;acd&quot;,&quot;ab&quot;] =&amp;gt; [&quot;bc&quot;,&quot;cd&quot;,&quot;ba&quot;]&lt;/code&gt;. Note that even with this method it is not necessary to look for substrings where every string wraps; the starting index should always be within the length of the longest input string.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Sandbox questions&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should I restrict the input strings to only a subset of printable ASCII?&lt;/li&gt;&#xA;&lt;li&gt;Should I enforce one specific behavior for handling shorter strings? Requiring wrapping would let the challenge look for even shorter solutions requiring full wrapping, e.g. &lt;code&gt;[&quot;aba&quot;,&quot;ab&quot;] =&amp;gt; [&quot;a&quot;,&quot;b&quot;]&lt;/code&gt;, but I don't want languages with different default substring implementations to need a lot of work just to get the wrapping working.&lt;/li&gt;&#xA;&lt;li&gt;I used the term &quot;substring&quot; as something that is &quot;applied&quot; to a string to get the shortened version, but I know that's extremely wrong. Is there a better way to phrase this?&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/48274/71434&quot;&gt;This challenge&lt;/a&gt; is related, but uses arbitrary substrings rather than aligned substrings. Should I mention it somewhere?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="71434" LastActivityDate="2018-12-19T20:24:45.853" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17226" PostTypeId="2" ParentId="9263" CreationDate="2018-12-20T02:03:34.050" Score="2" Body="&lt;p&gt;The current consensus on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9064/should-booleans-be-allowed-where-a-number-is-required/9067#9067&quot;&gt;Should Booleans be allowed where a number is required?&lt;/a&gt; appears to be that &lt;code&gt;true&lt;/code&gt; and &lt;code&gt;false&lt;/code&gt; values (not strings) should be accepted in place of &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt; (possibly IFF the language in question recognizes them as such).&lt;/p&gt;&#xA;" OwnerUserId="4787" LastActivityDate="2018-12-20T02:03:34.050" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17227" PostTypeId="2" ParentId="2140" CreationDate="2018-12-20T07:51:52.570" Score="0" Body="&lt;h1&gt;Is it a D?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given an image, check if it's a letter &lt;code&gt;D&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here &lt;code&gt;D&lt;/code&gt; is defined as:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let pixels labeled &lt;span class=&quot;math-container&quot;&gt;\$(x,y)\$&lt;/span&gt; where larger &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; mean at right and larger &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt; mean more up. If there exist &lt;span class=&quot;math-container&quot;&gt;\$x_0, x_1, f_0, f_1, f_2, f_3\$&lt;/span&gt; such that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ (f \rightarrow (x\rightarrow f(x+1)-f(x)))^n (f_i) (x) &amp;gt;0\$&lt;/span&gt; for &lt;span class=&quot;math-container&quot;&gt;\$n&amp;gt;0, 0\leq i&amp;lt;4\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ x_0&amp;lt;x_1\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Pixel &lt;span class=&quot;math-container&quot;&gt;\$(x,y)\$&lt;/span&gt; is true iff &lt;span class=&quot;math-container&quot;&gt;\$y&amp;gt;f_0(x) \text{ and } y&amp;lt;-f_1(x) \text{ and } (y&amp;gt;-f_2(x) \text{ or } y&amp;lt;f_3(x) \text{ or } x_0\leq x&amp;lt;x_1)\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;There should be a hole, i.e. a false pixel that can't reach border without acrossing a true pixel&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Shortest code win. Don't mind if &lt;i&gt;D&lt;/i&gt; doesn't follow the rule or a symbol which follows the rule doesn't look like a &lt;code&gt;D&lt;/code&gt; at all&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TODO: add test cases&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="69850" LastEditDate="2018-12-28T09:12:29.520" LastActivityDate="2018-12-28T09:12:29.520" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17228" PostTypeId="2" ParentId="2140" CreationDate="2018-12-21T18:55:50.783" Score="1" Body="&lt;h3&gt;Do not not not not make a filter that doesn't not not not get rid of these words!&lt;/h3&gt;&#xA;&lt;p&gt;Tags: code-golf&lt;/p&gt;&#xA;&lt;p&gt;Your program has to scan each run of &amp;quot;not&amp;quot;s in a sentence, and if the number of &amp;quot;not&amp;quot;s is odd, then replace it with only one &amp;quot;not&amp;quot;. If it is even, replace it with the empty string.&lt;/p&gt;&#xA;&lt;p&gt;Notes:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The &amp;quot;not&amp;quot;s are case-insensitive, so your input may be &amp;quot;not&amp;quot; or &amp;quot;Not&amp;quot; or more.&lt;/li&gt;&#xA;&lt;li&gt;The input may only be taken in as a string.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; Don't not not --&amp;gt;  Don't&#xA; not not not a not not  --&amp;gt;  not a&#xA; NoT nOt not NOT noT a Not nOt noT  --&amp;gt;  not a not&#xA;hello notnot anot not anota not not not --&amp;gt; hello a anota not&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="83048" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-12-30T03:08:20.863" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17229" PostTypeId="2" ParentId="2140" CreationDate="2018-12-21T20:42:41.077" Score="0" Body="&lt;h1&gt;Prime number construction game&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Tags: code-golf&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://math.stackexchange.com/questions/3048245/prime-number-construction-game&quot;&gt;this post&lt;/a&gt;, here is &lt;em&gt;A &quot;single player&quot; version of the prime number construction game&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The game:&lt;/h3&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Start with a digit between 1 and 9.&lt;/li&gt;&#xA;&lt;li&gt;Add a digit to the end, such that the resulting number is a prime number.&lt;/li&gt;&#xA;&lt;li&gt;Repeat from step 2 until there are no more possible prime numbers.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h3&gt;The challenge:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write a function (or required functions) that returns the sum of the lengths of the largest prime numbers you can get starting with each digit, following the game rules above.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The score:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Scoring will have two components:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The length of the code, in bytes (it's code-golf, after all), and&lt;/li&gt;&#xA;&lt;li&gt;The sum of the length of the largest primes obtained, starting with each digit.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The total score will be the length of the code (1) minus the sum of the length of the largest primes obtained (2).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The lowest score wins.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Here's a code sample using R (verbose and non golfed):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;isprime &amp;lt;- function(x) {&#xA;  for(i in 2:sqrt(x))&#xA;    if(x %% i == 0)&#xA;      return(FALSE)&#xA;  return(TRUE)&#xA;}&#xA;&#xA;next_prime &amp;lt;- function(x) {&#xA;  for(i in sample(c(1,3,7,9))) {&#xA;    y &amp;lt;- strtoi(paste(c(x,i), collapse=''))&#xA;    if(isprime(y))&#xA;      return(y)&#xA;  }&#xA;  return(NULL)&#xA;}&#xA;&#xA;longest_primes &amp;lt;- function(x) {&#xA;  primes &amp;lt;- 1:9&#xA;  for(d in 1:9) {&#xA;    y &amp;lt;- d&#xA;    while(!is.null(y)) {&#xA;      primes[d] &amp;lt;- y&#xA;      y &amp;lt;- next_prime(y)&#xA;    }&#xA;  }&#xA;  return(sum(nchar(primes)))&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here's a sample run of the code above:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; Digit | Largest prime obtained | Length&#xA; ------+------------------------+-------&#xA;   1   | 19139                  | 5&#xA;   2   | 29399999               | 8 &#xA;   3   | 3797                   | 4&#xA;   4   | 4799                   | 4&#xA;   5   | 53                     | 2&#xA;   6   | 6173                   | 4&#xA;   7   | 719333                 | 6&#xA;   8   | 89                     | 2&#xA;   9   | 977                    | 3&#xA; ------+------------------------+-------&#xA; Total |                        | 38&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Assuming the byte count of my code is 469, my final score is 469-38=&lt;strong&gt;431&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Posting your solution:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Please use the following header for your solution:&lt;br&gt;&#xA;&lt;code&gt;# [Language]: [Byte count] - [Sum of lengths] = [Total score]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please include an explanation to your answer.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Miscelaneous:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think this is a simple, yet fun, challenge. I've searched the site, and I haven't found a related challenge. If there's one, please point me.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I tried sometime ago to post a challenge, and I wasn't careful enough before posting (hence, I deleted it). I'd like to post a good first challenge. Any feedback will be appreciated.&lt;/p&gt;&#xA;" OwnerUserId="56701" LastActivityDate="2018-12-21T20:42:41.077" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17231" PostTypeId="2" ParentId="2140" CreationDate="2018-12-24T09:25:29.843" Score="1" Body="&lt;h2&gt;Piano Scale Fingering&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are 12 different major scales on the piano, which have similar, but not identical, fingering. Furthermore, the fingering for each hand is slightly different.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The fingers of each hand are numbererd starting at 1 for the thumb. Each note usually takes the next finger in turn. For the left hand playing an ascending scale, this means that the numbers decrease, while for the right hand the numbers increase.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course you will run out of fingers before you get to the end of the scale. For the left hand, this means that when you get to the thumb you need to start again with one of the other fingers, while for the right hand this means that when you get to a certain finger you need to start again with the thumb.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although there are eight notes in an octave, the part that repeats in the middle of a scale is seven, which is a prime number. Scales are therefore normally played using the repeatying sequnces &lt;code&gt;4321321&lt;/code&gt; in the left hand and &lt;code&gt;1231234&lt;/code&gt; in the right hand; the little finger is only used to avoid switching to the thumb on the first or last note respectively. Other adjustments also apply at the very start and end of the scale.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are a couple of rules which work for most scales. The first rule is that you try to play the tonic with the thumb except at the appropriate end of the scale when you use the little finger. If you can't follow that rule then with the right hand you use the thumb when switching from a black note to a white note; with the left hand you aim for the thumb to land on a white note just before a black note.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is a full list of all 12 keys and their fingerings:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; #  Key Left Hand       Right Hand&#xA;-6  Gb  432132143213212 234123423412345&#xA;-5  Db  321432132143212 231234123123412&#xA;-4  Ab  321432132143212 231231234123123&#xA;-3  Eb  321432132143212 212341231234123&#xA;-2  Bb  321432132143212 212312341231234&#xA;-1  F   543213214321321 123412341231234&#xA; 0  C   543213214321321 123123412312345&#xA; 1  G   543213214321321 123123412312345&#xA; 2  D   543213214321321 123123412312345&#xA; 3  A   543213214321321 123123412312345&#xA; 4  E   543213214321321 123123412312345&#xA; 5  B   432143213214321 123123412312345&#xA; 6  F#  432132143213212 234123123412345&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Please write a program function which takes as input the key (or #, which is the number of sharps in the key, or the negation of the number of flats in the key) of a scale and a flag (e.g. &lt;code&gt;L&lt;/code&gt; or &lt;code&gt;R&lt;/code&gt;) for which hand, and output the fingering for two octaves as above. (For longer scales you simply repeat the middle 7 digits so I don't see the utility of asking you to output an arbitrary number of octaves.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that Gb is enharmonic to F# on the piano but you might find it easier to support one rather than the other. Please indicate which one your answer supports.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an alternative to writing a single function I will also allow two named functions (one for each hand) but not two lambdas. The 1 byte per extra file penalty applies if you submit two full programs.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2018-12-24T09:25:29.843" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17232" PostTypeId="1" CreationDate="2018-12-25T08:30:21.767" Score="-8" ViewCount="98" Body="&lt;p&gt;I was scrolling through the posts tagged with &quot;Game&quot; and noticed that it involved quite a few code golf competitions. Just for the sake of clarity and ease while searching, I believe that the definitions of some tags should be clarified to be as follows:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Challenge: A play thing with an objective.&lt;/li&gt;&#xA;&lt;li&gt;Competition: A challenge taken by multiple players where the players can not interfere with each other, but otherwise are trying to be better than the other players.&lt;/li&gt;&#xA;&lt;li&gt;Game: A challenge, except that the players can interfere with each other.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;I got the definitions from &lt;a href=&quot;https://www.youtube.com/watch?v=e5jDspIC4hY&quot; rel=&quot;nofollow noreferrer&quot;&gt;this Vsauce video starting at around 2:45&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Under these new definitions, a typical code golf should be tagged with &quot;competition&quot;, things like &quot;king-of-the-hill&quot; are classified as a &quot;game&quot;.&lt;/p&gt;&#xA;" OwnerUserId="75438" LastActivityDate="2018-12-25T13:28:06.710" Title="Change the use of the &quot;Game&quot; tag?" Tags="|discussion|tags|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17233" PostTypeId="2" ParentId="17232" CreationDate="2018-12-25T13:28:06.710" Score="9" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt; does clarify to which challenges it applies. From &lt;a href=&quot;https://codegolf.stackexchange.com/tags/game/info&quot;&gt;its tag wiki&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This challenge is generally based upon, related to, or simulates a game or some portion of one.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Use the more specific tags over this one: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tic-tac-toe&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tic-tac-toe&amp;#39;&quot; rel=&quot;tag&quot;&gt;tic-tac-toe&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sudoku&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sudoku&amp;#39;&quot; rel=&quot;tag&quot;&gt;sudoku&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/boggle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;boggle&amp;#39;&quot; rel=&quot;tag&quot;&gt;boggle&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/manufactoria&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;manufactoria&amp;#39;&quot; rel=&quot;tag&quot;&gt;manufactoria&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game-of-life&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game-of-life&amp;#39;&quot; rel=&quot;tag&quot;&gt;game-of-life&lt;/a&gt;. For specific types of games, use &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/board-game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;board-game&amp;#39;&quot; rel=&quot;tag&quot;&gt;board-game&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/maze&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;maze&amp;#39;&quot; rel=&quot;tag&quot;&gt;maze&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cellular-automata&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cellular-automata&amp;#39;&quot; rel=&quot;tag&quot;&gt;cellular-automata&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That means both code golf and KotH challenges can bear the game tag, assuming they're based on games.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your definition of game as &lt;em&gt;a challenge, except that the players can interfere with each other&lt;/em&gt; is the actual definition of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;. Its wiki excerpt says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;King-of-the-hill indicates a game where the submissions interact with and compete against each other in some form of game. Competitions which pit programs against each other without interaction should rather use &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;So redefining the game tag would just make it a synonym of the KoTH tag.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, a competition tag would apply to pretty much all challenges except KoTH, so it feels a bit redundant.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2018-12-25T13:28:06.710" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17234" PostTypeId="2" ParentId="2140" CreationDate="2018-12-25T14:56:54.037" Score="0" Body="&lt;p&gt;There are 1000 phones in a city. Add some switches so that we can freely decide linking pairs (Any amount of pairs). Two phones are connected iff some closed switches directly or indirectly link them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In graph-theoretic terms, phones and &quot;new points&quot; are vertices, switches/links are edges, and you need to construct a graph with least number of edges such that for all possible list of pairs of the &quot;phone&quot;-vertices, there exists a configuration of the switches (subgraph), such that vertices in the same pair are in the same connected component, and vice versa.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You need to answer with:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A list of links, where 0~999 are the 1000 phones, and 1000~ are just point.&lt;/li&gt;&#xA;&lt;li&gt;A program that take some pairs of phone ids, where no two numbers are same, and output the switches that need to be closed. It should run on tio in 60s.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Fewest switches win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A sample solution may be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1. [(i,j) for i in range(1000) for j in range(1000,1500)]&#xA;2. def f(a):&#xA;     print ([(a[i][0],1000+i)for i in range(len(a))]+[(a[i][1],1000+i)for i in range(len(a))])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which uses 500000 switches.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;SN. &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Should I require that when a connection is added or removed, there's a series of moves so that no other connections are affected?&lt;/li&gt;&#xA;&lt;li&gt;Directly using &lt;a href=&quot;https://en.wikipedia.org/wiki/Sorting_network&quot; rel=&quot;nofollow noreferrer&quot;&gt;sorting network&lt;/a&gt; for &lt;span class=&quot;math-container&quot;&gt;\$\mathcal O(n \log^2 n)\$&lt;/span&gt; seems to use more switches than &lt;span class=&quot;math-container&quot;&gt;\$\mathcal O(n^2)\$&lt;/span&gt; solution. Should I have more phones?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="69850" LastEditDate="2018-12-28T10:50:58.890" LastActivityDate="2018-12-28T10:50:58.890" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17236" PostTypeId="2" ParentId="2140" CreationDate="2018-12-26T20:28:47.363" Score="1" Body="&lt;h1&gt;Front lines go front! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given two lists of positive integers, bring the elements in the first one that are in the second to the far left, keeping their order the same as in the first list. You can assume that the second list's elements will all be unique.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/41024&quot;&gt;These approaches&lt;/a&gt; are forbidden.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, let's call the first list &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; and the second &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;. Here are some test cases:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$A=[1,3,4,1,2,1,4,3,2,1,3,2,4,1],B=[1,3]\rightarrow[1,3,1,1,3,1,3,1,4,2,4,2,2,4]\$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$A=[],B=[1,4,5]\rightarrow[]\$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$A=[1,2,3,4,5,6,7,8,10],B=[]\rightarrow[1,2,3,4,5,6,7,8,10]\$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$A=[],B=[]\rightarrow[]\$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$A=[1,2,2,1,3,4,4],B=[1,2]\rightarrow[1,2,2,1,3,4,4]\$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$A=[3,4,4,1,2,1,5],B=[1,5,2]\rightarrow[1,2,1,5,3,4,4]\$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$A=[1,2,3,2,1,2,3,2,1],B=[4,5,6]\rightarrow[1,2,3,2,1,2,3,2,1]\$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$A=[2,2,1,2,1,3,3,1,4],B=[1,2,3,4]\rightarrow[2,2,1,2,1,3,3,1,4]\$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note: the integers aren't necessarily single-digit.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2018-12-27T15:52:09.130" LastActivityDate="2018-12-27T15:52:09.130" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17239" PostTypeId="2" ParentId="2140" CreationDate="2018-12-28T03:29:09.987" Score="3" Body="&lt;h1&gt;Output Hello, World! ... sometimes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On PPCG, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8379/are-theoretically-incorrect-answers-allowed-if-its-near-impossible-to-find-in&quot;&gt;we typically do not allow programs to work only part of the time&lt;/a&gt;. That is, all programs must work with 100% probability unless otherwise stated.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge is going to state otherwise. Your program must, with nonzero probability, output this exact string to STDOUT:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hello, World!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;However, a simple Hello, World! program will not do. Your program must also have nonzero probability to behave in any other way than outputting the above string. This could be printing another string, printing &lt;code&gt;Hello, World!&lt;/code&gt; surrounded by junk text, outputting &lt;code&gt;Hello, World!&lt;/code&gt; to STDERR instead of STDOUT, outputting nothing, crashing, etc. Your program may have many different behaviors than printing the desired string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example program&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The following program in JavaScript is a valid submission. It will output &lt;code&gt;Hello, World!&lt;/code&gt; half the time, and the other half of the time output a float &lt;code&gt;&amp;gt;= 0.5&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;const THRESHOLD = 0.5;&#xA;let randomFloat = Math.random();&#xA;&#xA;let output;&#xA;&#xA;if(randomFloat &amp;lt; THRESHOLD) {&#xA;    output = &quot;Hello, World!&quot;;&#xA;}&#xA;else {&#xA;    output = randomFloat.toString();&#xA;}&#xA;&#xA;console.log(output);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##XY4xC8IwEIX3/IqzUwoaXJyim0oHRbCCc2hjrZy5kl5dpL89pnaw@LZ7fHz3HuZl2sLXDS8clTaEglzLcMnOuzw7HbawgaVaaYGWwRtX0nOPZDjWR8N3NVYy1eJLUMdNx/Gob3JKr3/CFN4CYkY0epLMItIcruSxnCVa9MJia/@xiU4x5exrVw1/eyGGyYRWIVVy5FMdwgc&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;JavaScript (Node.js) – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2018-12-28T03:29:09.987" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="17240" PostTypeId="2" ParentId="2140" CreationDate="2018-12-28T16:29:30.833" Score="-2" Body="&lt;p&gt;Play &lt;a href=&quot;https://en.wikipedia.org/wiki/Snake_(video_game_genre)&quot; rel=&quot;nofollow noreferrer&quot;&gt;snake&lt;/a&gt; on a 50*50 grid. The snake will start at length 3, heading (2,0) with body (1,0) and (0,0). It shouldn't bump into wall or itself. There is always one food, which increases the length of snake by 1 when eaten. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Smallest amount of steps till there's no space to place food win. Flexible I/O, anyway it doesn't matter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Vote on whether the food placer is transparent and allow food manipulation(Up for yes, down for no)&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2018-12-28T17:06:31.790" LastActivityDate="2018-12-28T17:06:31.790" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17241" PostTypeId="2" ParentId="2140" CreationDate="2018-12-28T18:21:34.917" Score="0" Body="&lt;h2&gt;I'll Just Make A Snake&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I noticed a post (now deleted) that pointed out that &lt;a href=&quot;https://github.com/Adriandmen/05AB1E/tree/fb4a2ce2bce6660e1a680a74dd61b72c945e6c3b&quot; rel=&quot;nofollow noreferrer&quot;&gt;05AB1E (legacy)&lt;/a&gt;, when called with no arguments and non-empty input, will make a &quot;snake&quot; using the input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Not sure what to do now with the input, so I'll just make a snake:&#xA;&#xA;&#xA;*****&#xA;    *&#xA;    *&#xA;    *&#xA;*****&#xA;*    &#xA;*    &#xA;*    &#xA;*    &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Cute, and seems simple enough. However, the snake generation has a few quirks that I thought would make an interesting challenge to replicate.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;When given a non-empty string as input, a snake is generated using the following algorithm:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If the input string is shorter than 17 characters, pad the string with duplicates of itself until its length is &gt;= 17.&lt;/li&gt;&#xA;&lt;li&gt;Generate a snake segment by replacing the non-space characters of the pattern with characters from the input string, following the direction of the snake. (Print characters right-to-left 5, up-to-down 3, left-to-right 5, up-to-down 4.)&lt;/li&gt;&#xA;&lt;li&gt;If there is a previous snake segment generated, replace its last line with the first line of this segment.&lt;/li&gt;&#xA;&lt;li&gt;Remove the used characters from the string.&lt;/li&gt;&#xA;&lt;li&gt;Discard the first character of the remainder of the string. If there is no remainder, instead set the remainder to the original input string, minus its first character.&lt;/li&gt;&#xA;&lt;li&gt;Pad the string with copied of the original input string until its length is &gt;= 17.&lt;/li&gt;&#xA;&lt;li&gt;Repeat steps 2-6 N times, where N = Length of input string.&lt;/li&gt;&#xA;&lt;li&gt;Return the generated snake.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;You do not have to handle empty inputs or non-string inputs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You do not have to print the beginning message &quot;Not sure what to do now with the input, so I'll just make a snake:&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note: 05AB1E (legacy) actually has some different behavior when given a base-10 integer as input. We will be ignoring that and treating all inputs as strings.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;General rules:&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input and output may be in any reasonable format.&lt;/li&gt;&#xA;&lt;li&gt;Trailing spaces and/or a single trailing newline are acceptable.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes for each language wins. No answer will be marked as &lt;em&gt;the&lt;/em&gt; answer.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet/2422#2422&quot;&gt;Standard rules&lt;/a&gt; apply.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Default Loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;If possible, please add a link with a test for your code (i.e. TIO).&lt;/li&gt;&#xA;&lt;li&gt;Adding an explanation for your answer is highly recommended.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Here is an (ungolfed) Python 2 program which replicates this behavior, for clarity and generation of additional test cases.&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;pattern = &quot;&quot;&quot;{0}{1}{2}{3}{4}\n    {5}\n    {6}\n    {7}\n{12}{11}{10}{9}{8}\n{13}\n{14}\n{15}\n{16}&quot;&quot;&quot;&#xA;&#xA;def print_snake(in_str):&#xA;    print &quot;Not sure what to do now with the input, so I'll just make a snake:\n\n&quot;&#xA;    l = len(in_str)&#xA;&#xA;    snek = [0]&#xA;&#xA;    if l &amp;lt; 19:&#xA;        d,m = divmod(19, l)&#xA;        if m:&#xA;            d+=1&#xA;        in_str = in_str * d&#xA;&#xA;    print_str, lost_char, rem = in_str, &quot;&quot;, &quot;&quot;&#xA;&#xA;    for i in range(l):&#xA;        print_str = rem + in_str&#xA;        print_str, lost_char, rem = print_str[:17], print_str[17], print_str[18:]&#xA;        snek.pop()&#xA;        snek += (pattern.format(*print_str)).split(&quot;\n&quot;)&#xA;&#xA;    print &quot;\n&quot;.join(snek)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##bZLJbsIwEIbveYqRL7UhijCULSqH9tZLXwAQihrTGBI7ik1RZeXZ04mBhC6WbM3yzzfeyi@baTVumjKxVlQKVkAIcaPa8dqNazep3WO9UYDDTW/G7GbM0XAcZRzVHIuWtVv42MSvj36d@nVWIzgIUrGHspLK7oxKjoJKtTO2YnHQAn0CyJu2YE6VgHOWWLAaUg1Kn@EsbQY2EyBVebIhGA2vD3kOh5OxUCANEvDUeKM2inhkjifKhbr1CXzQKHHE@Hq0vfhyj7on4MvLNtqRhgUqUvlZ6JTyZQg563IoL3qlVw9XvE/7Vlh9NQaQBv3x2hDStLG79yxBsxJFpw3x9tt50e91BRIzUCXqQ9Cc9U07FJa2gOEV8FfwT68ut475fBve@b/dRbztiO2lRaUuKfsRguEK6PX3RLjjIrF00CEYi0yZS0sJPggL7l8ZA9FBS0VbCmvuPwV5fiGs@QY&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 2 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;Input: *&#xA;&#xA;Output:&#xA;*****&#xA;    *&#xA;    *&#xA;    *&#xA;*****&#xA;*&#xA;*&#xA;*&#xA;*&#xA;&#xA;Input: AB&#xA;&#xA;Output:&#xA;ABABA&#xA;    B&#xA;    A&#xA;    B&#xA;ABABA&#xA;B&#xA;A&#xA;B&#xA;ABABA&#xA;    B&#xA;    A&#xA;    B&#xA;ABABA&#xA;B&#xA;A&#xA;B&#xA;A&#xA;&#xA;Input: 123456789&#xA;&#xA;Output:&#xA;12345&#xA;    6&#xA;    7&#xA;    8&#xA;43219&#xA;5&#xA;6&#xA;7&#xA;12345&#xA;    6&#xA;    7&#xA;    8&#xA;43219&#xA;5&#xA;6&#xA;7&#xA;12345&#xA;    6&#xA;    7&#xA;    8&#xA;43219&#xA;5&#xA;6&#xA;7&#xA;12345&#xA;    6&#xA;    7&#xA;    8&#xA;43219&#xA;5&#xA;6&#xA;7&#xA;12345&#xA;    6&#xA;    7&#xA;    8&#xA;43219&#xA;5&#xA;6&#xA;7&#xA;12345&#xA;    6&#xA;    7&#xA;    8&#xA;43219&#xA;5&#xA;6&#xA;7&#xA;12345&#xA;    6&#xA;    7&#xA;    8&#xA;43219&#xA;5&#xA;6&#xA;7&#xA;12345&#xA;    6&#xA;    7&#xA;    8&#xA;43219&#xA;5&#xA;6&#xA;7&#xA;12345&#xA;    6&#xA;    7&#xA;    8&#xA;43219&#xA;5&#xA;6&#xA;7&#xA;8&#xA;&#xA;Input: sadness*and*despair&#xA;&#xA;Output:&#xA;sadne&#xA;    s&#xA;    s&#xA;    *&#xA;d*dna&#xA;e&#xA;s&#xA;p&#xA;rsadn&#xA;    e&#xA;    s&#xA;    s&#xA;*dna*&#xA;d&#xA;e&#xA;s&#xA;irsad&#xA;    n&#xA;    e&#xA;    s&#xA;dna*s&#xA;*&#xA;d&#xA;e&#xA;airsa&#xA;    d&#xA;    n&#xA;    e&#xA;na*ss&#xA;d&#xA;*&#xA;d&#xA;pairs&#xA;    a&#xA;    d&#xA;    n&#xA;a*sse&#xA;n&#xA;d&#xA;*&#xA;spair&#xA;    s&#xA;    a&#xA;    d&#xA;*ssen&#xA;a&#xA;n&#xA;d&#xA;espai&#xA;    r&#xA;    s&#xA;    a&#xA;ssend&#xA;*&#xA;a&#xA;n&#xA;despa&#xA;    i&#xA;    r&#xA;    s&#xA;senda&#xA;s&#xA;*&#xA;a&#xA;*desp&#xA;    a&#xA;    i&#xA;    r&#xA;endas&#xA;s&#xA;s&#xA;*&#xA;d*des&#xA;    p&#xA;    a&#xA;    i&#xA;ndasr&#xA;e&#xA;s&#xA;s&#xA;nd*de&#xA;    s&#xA;    p&#xA;    a&#xA;dasri&#xA;n&#xA;e&#xA;s&#xA;and*d&#xA;    e&#xA;    s&#xA;    p&#xA;asria&#xA;d&#xA;n&#xA;e&#xA;*and*&#xA;    d&#xA;    e&#xA;    s&#xA;sriap&#xA;a&#xA;d&#xA;n&#xA;s*and&#xA;    *&#xA;    d&#xA;    e&#xA;riaps&#xA;s&#xA;a&#xA;d&#xA;ss*an&#xA;    d&#xA;    *&#xA;    d&#xA;iapse&#xA;r&#xA;s&#xA;a&#xA;ess*a&#xA;    n&#xA;    d&#xA;    *&#xA;apsed&#xA;i&#xA;r&#xA;s&#xA;ness*&#xA;    a&#xA;    n&#xA;    d&#xA;psed*&#xA;a&#xA;i&#xA;r&#xA;dness&#xA;    *&#xA;    a&#xA;    n&#xA;sed*d&#xA;p&#xA;a&#xA;i&#xA;adnes&#xA;    s&#xA;    *&#xA;    a&#xA;ed*dn&#xA;s&#xA;p&#xA;a&#xA;i&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="73368" LastActivityDate="2018-12-28T18:21:34.917" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17242" PostTypeId="2" ParentId="2140" CreationDate="2018-12-29T19:21:10.303" Score="0" Body="&lt;h1&gt;What season is it?&lt;/h1&gt;&#xA;&lt;p&gt;I don't think we have a challenge for this yet, surprisingly. The closest ones are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/121796/64538&quot;&gt;What season is it?&lt;/a&gt; (bad, closed)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/164753/64538&quot;&gt;Determine Season&lt;/a&gt; (only uses months)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Output the current season, using the astronomical definitions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Spring begins on the day of the spring equinox&lt;/li&gt;&#xA;&lt;li&gt;Summer begins on the summer solstice&lt;/li&gt;&#xA;&lt;li&gt;Fall begins on the fall equinox&lt;/li&gt;&#xA;&lt;li&gt;Winter begins on the winter solstice&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may use the northern or southern hemisphere dates.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;None (use the current date).&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;One of these strings (case insensitive):&#xA;&lt;code&gt;spring&lt;/code&gt;, &lt;code&gt;summer&lt;/code&gt;, &lt;code&gt;fall&lt;/code&gt; (or &lt;code&gt;autumn&lt;/code&gt;), &lt;code&gt;winter&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your program must finish in a reasonable (less than 1 day) amount of time.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Problems&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Is calculating the dates of the equinoxes/solstices too difficult? (I don't want the best solution to involve a big lookup table)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What range of years should this be required to work in?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Should the output format be less strict? (&amp;quot;Any 4 distinct values&amp;quot; rather than the season names)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="64538" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-12-29T19:21:10.303" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17244" PostTypeId="2" ParentId="2140" CreationDate="2018-12-29T23:07:48.707" Score="1" Body="&lt;h1&gt;Radiation Showdown KotH&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In radiation hardening challenges, the goal is to write a program whose behavior doesn't change when an arbitrary character is removed from its source.  This KotH explores an adversarial variant on this challenge in which two programs compete to survive the most character deletions.  The twist is that each program is provided the source code of its opponent and outputs which character should be deleted from its opponent's source code next.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Gameplay&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Suppose program A and B are competitors.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Each program is run and the output is recorded.  Let the output of program A be a and the output of program B be b.  If one program fails to output a valid character index of its opponent's source code, the other program will be declared the winner of the match.  If neither program outputs a valid index, then a tie is declared.&lt;/li&gt;&#xA;&lt;li&gt;The a'th character is removed from program B and the b'th character is removed from program A.&lt;/li&gt;&#xA;&lt;li&gt;Repeat steps 1 and 2 until there is a winner or a tie.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Submissions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Submissions should be a complete javascript or python program which:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Begins with a shebang (#!) indicating which language it is written.  For python entries, this should be &lt;code&gt;#!/usr/bin/python&lt;/code&gt;.  For javascript entries this should be &lt;code&gt;#!/app/.heroku/node/bin/node&lt;/code&gt;.  &lt;/li&gt;&#xA;&lt;li&gt;Takes three command line arguments: the code for the opponent program, the start of the range of deletable characters (x), and the end of the range (y).  In python these can be accessed using sys.argv, while in javascript they can be found in process.argv.&lt;/li&gt;&#xA;&lt;li&gt;Prints a number in the range [x,y) to stdout and terminates in less than 10 seconds.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Note: The index of the first deletable character of your opponent's program (x) is the index of the first character after the shebang.  y is the length of the opponent program in characters (so y-1 is the last deletable character).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sample Submissions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Python:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#!/usr/bin/python&#xA;import sys&#xA;&#xA;# vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv&#xA;print (sys.argv[3]-1)&#xA;# vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Javascript:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#!/app/.heroku/node/bin/node&#xA;// vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv&#xA;console.log(Math.round(Math.random() * process.argv[4]));&#xA;// vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Controller&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I've hosted a web based controller at &lt;a href=&quot;https://radiationshowdownkoth.herokuapp.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://radiationshowdownkoth.herokuapp.com/&lt;/a&gt;.  It should conform to the behavior specified in the Gameplay section.  Let me know if you find any bugs.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard loopholes apply.&lt;/li&gt;&#xA;&lt;li&gt;The use of preexisting interpreters and their components (parsers, lexers, etc) is banned.  This includes, but is not limited to, calling the python and node binaries from your program (eg os.popen(&quot;python -c ...&quot;)), using builtin eval functions (eg python's exec), and using relevant modules (such as python's astlib).  However, you may use regular expressions.&lt;/li&gt;&#xA;&lt;li&gt;No malicious code.  &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Logistics&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It will be a Round Robin Tournament.  Each submission will be matched against every other submission.  For each victory a submission achieves, it will be awarded 1 point.  Likewise, ties are worth 0.5 points and losses are worth 0 points.  The submission with the most points after all rounds have been completed wins this KotH.  The winner will receive a bounty from yours truly, and the most popular entry will be awarded accepted answer.  This KotH will be open to entries for a week following its posting, at which point the tournament will be run and a winner declared.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Clarifications?&lt;/li&gt;&#xA;&lt;li&gt;Other Language Suggestions besides Python &amp;amp; Javascript?&lt;/li&gt;&#xA;&lt;li&gt;Are there any trivial strategies that would be overwhelmingly effective?&lt;/li&gt;&#xA;&lt;li&gt;Any other foreseeable problems?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="71631" LastEditorUserId="71631" LastEditDate="2018-12-30T04:04:58.567" LastActivityDate="2018-12-30T04:04:58.567" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="17245" PostTypeId="2" ParentId="2140" CreationDate="2018-12-30T01:10:36.670" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Surreal_number&quot; rel=&quot;nofollow noreferrer&quot;&gt;Surreal Numbers&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Surreal numbers are one way of describing numbers using sets. In this challenge you will determine the value of a surreal number.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Intro&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A surreal number consists of two sets: a left and right. The value of the surreal number must be greater than all numbers in the left set and less than all numbers in the right set. We define 0 as having nothing in each set, which we write as &lt;code&gt;{|}&lt;/code&gt;. Each surreal number also has a birth date. 0 is born on day 0. On each successive day, new surreal numbers are formed by taking the numbers formed on previous days and placing them in the left/right sets of a new number. For example, &lt;code&gt;{0|} = 1&lt;/code&gt; is born on day 1, and &lt;code&gt;{|0} = -1&lt;/code&gt; is also born on day 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To determine the value of a surreal number, we find the number &quot;between&quot; the left and right sets that was born earliest. As a general rule of thumb, numbers with lower powers of 2 in their denominator are born earlier. For example, the number &lt;code&gt;{0|1}&lt;/code&gt; (which is born on day 2 by our rules) is equal to &lt;code&gt;1/2&lt;/code&gt;, since 1/2 has the lowest power of 2 in its denominator between 0 and 1. In addition, if the left set is empty, we take the largest possible value, and vice versa if the right set is empty. For example, &lt;code&gt;{3|} = 4&lt;/code&gt; and &lt;code&gt;{|6} = 5&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note that &lt;code&gt;4&lt;/code&gt; and &lt;code&gt;5&lt;/code&gt; are just symbols that represent the surreal number, which just happen to align with our rational numbers if we define operations in a certain way.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some more examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{0, 1|} = {1|} = {-1, 1|} = 2&#xA;{0|3/4} = 1/2&#xA;{0|1/2} = 1/4&#xA;{0, 1/32, 1/16, 1/2 |} = 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;To the Sandbox:&lt;/strong&gt; is this explanation clear? Anything I should add? I want to make sure of this before proposing the challenge.&lt;/p&gt;&#xA;" OwnerUserId="20438" LastEditorUserId="20438" LastEditDate="2018-12-30T23:39:48.060" LastActivityDate="2018-12-30T23:39:48.060" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="17248" PostTypeId="2" ParentId="2140" CreationDate="2018-12-31T10:53:45.143" Score="0" Body="&lt;h1&gt;Check List for Duplicates&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a non-empty list of integers, return a truthy value if all entries are unique, and a falsey value of there are duplicate entries (or vice versa).&lt;/p&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1,2,3] -&amp;gt; false&#xA;[1,1,3] -&amp;gt; true&#xA;[1] -&amp;gt; false&#xA;[1,3,1,5] -&amp;gt; true&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;META:&lt;/strong&gt; I couldn't find this as a challenge, but I cannot believe we didn't allready have this. Let me know if you can find anything related.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-01-28T14:41:56.297" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="17249" PostTypeId="2" ParentId="2140" CreationDate="2018-12-31T13:46:12.120" Score="2" Body="&lt;h1&gt;Shortest JsFuck code for a number&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;JsFuck is a language using only &lt;code&gt;[]()!+&lt;/code&gt; to run and express anything in JavaScript. Below is a simplified model of JavaScript to express numbers:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Types&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Number&lt;/li&gt;&#xA;&lt;li&gt;String&lt;/li&gt;&#xA;&lt;li&gt;Boolean (&lt;code&gt;true&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Array&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;Functions&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;IEEEdouble(x):&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$u\$&lt;/span&gt; is the number in &lt;span class=&quot;math-container&quot;&gt;\$\{a\cdot 2^{b}|-2^{53}&amp;lt;a&amp;lt;2^{53}, b&amp;gt;-1075, a,b\in \mathbb Z\}\$&lt;/span&gt; nearest to x, maximizing &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; on tie&lt;/li&gt;&#xA;&lt;li&gt;If &lt;span class=&quot;math-container&quot;&gt;\$|u|&amp;lt;2^{1024}\$&lt;/span&gt;, return &lt;span class=&quot;math-container&quot;&gt;\$u\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;toNumber(x):&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If x is a Number, return x;&lt;/li&gt;&#xA;&lt;li&gt;If x is a Boolean, return 1;&lt;/li&gt;&#xA;&lt;li&gt;If x is an Array [y], return toNumber(y);&lt;/li&gt;&#xA;&lt;li&gt;If x is an Array [], return &lt;code&gt;0&lt;/code&gt;;&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, x is a String. In this case,&lt;/li&gt;&#xA;&lt;li&gt;If x matches &lt;code&gt;/^([\+\-]?(?:\d*\.?\d+|\d+\.))(?:e([\+\-]?\d+)?$/&lt;/code&gt;, let &lt;span class=&quot;math-container&quot;&gt;\$v=\text{＄1}\times 10^\text{＄2}\$&lt;/span&gt; (&lt;code&gt;$2&lt;/code&gt; is zero if not present)&lt;/li&gt;&#xA;&lt;li&gt;Return IEEEdouble(&lt;span class=&quot;math-container&quot;&gt;\$v\$&lt;/span&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;toString(x):&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If x is a String, return x;&lt;/li&gt;&#xA;&lt;li&gt;If x is a Boolean, return &lt;code&gt;'true'&lt;/code&gt;;&lt;/li&gt;&#xA;&lt;li&gt;If x is an Array [y], return toString(y);&lt;/li&gt;&#xA;&lt;li&gt;If x is an Array [], return &lt;code&gt;''&lt;/code&gt;;&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, x is a Number. In this case,&lt;/li&gt;&#xA;&lt;li&gt;Find &lt;span class=&quot;math-container&quot;&gt;\$p, q\in \mathbb Z\$&lt;/span&gt; such that IEEEdouble(&lt;span class=&quot;math-container&quot;&gt;\$p\times 10^q\$&lt;/span&gt;)=x, maximizing &lt;span class=&quot;math-container&quot;&gt;\$q\$&lt;/span&gt;(there may be multiple &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt; satisfying the restriction, in which case choosing which one is unknown);&lt;/li&gt;&#xA;&lt;li&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$y=p\times 10^q\$&lt;/span&gt;;&lt;/li&gt;&#xA;&lt;li&gt;If &lt;span class=&quot;math-container&quot;&gt;\$y=0\$&lt;/span&gt; or &lt;span class=&quot;math-container&quot;&gt;\$10^{-6}\leq|y|&amp;lt;10^{21}\$&lt;/span&gt;, write it normally without scientific notation mapping the RegEx &lt;code&gt;/^([1-9]\d*|0)(\.\d*[1-9])?$/&lt;/code&gt;;&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, write it in scientific notation mapping the RegEx &lt;code&gt;/^[1-9](\.\d*[1-9])?e[\+\-][1-9]\d*$/&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;x+y&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If either x or y is a String or an Array, return toString(x) concatted with toString(y);&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, return IEEEdouble(the sum of toNumber(x) and toNumber(y))&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;+x&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Return toNumber(x)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;[] and [x]&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Return an Array. &lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;x[y]&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If x is a String, return the y&lt;sup&gt;th&lt;/sup&gt; character(0-index) in x&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;!![] and !+[]&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Return a Boolean&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;A valid JsFuck code is always parenthesis balanced without two symbols &lt;code&gt;+&lt;/code&gt; together. Expression in parenthesis is calculated before the one out. On the same layer operations go from left to right. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are required to output the shortest JsFuck code that generates a given IEEE double (A possible output of &lt;code&gt;IEEEdouble&lt;/code&gt;). Shortest generator wins. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's fine if your generator runs slow, but beware of potential infinite loop if you &lt;code&gt;eval&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Samples&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1     -&amp;gt; +!![]&#xA;2     -&amp;gt; !![]+!![]&#xA;10    -&amp;gt; +[+!+[]+[+[]]]&#xA;1e10  -&amp;gt; +(+!![]+(!![]+[])[!![]+!![]+!![]]+(+!![])+(+[]))&#xA;0.1   -&amp;gt; +((+(+!![]+[+!![]]+(!![]+[])[!![]+!![]+!![]]+(!![]+!![])+(+[]))+[])[+!![]]+(+!![]))&#xA;1e-10 -&amp;gt; +((+(+!![]+[+!![]]+(!![]+[])[!![]+!![]+!![]]+(!![]+!![])+(+[]))+[])[+!![]]+(+[])+(+[])+(+[])+(+[])+(+[])+(+[])+(+[])+(+[])+(+[])+(+!![]))&#xA;5e-324-&amp;gt; +(!![]+!![]+!![]+(!![]+[])[!![]+!![]+!![]]+(+((+(+!![]+[+!![]]+(!![]+[])[!![]+!![]+!![]]+(!![]+!![])+(+[]))+[])[+!![]]+(+[])+(+[])+(+[])+(+[])+(+[])+(+[])+(+!![]))+[])[!![]+!![]]+(!![]+!![]+!![])+(!![]+!![])+(!![]+!![]+!![]+!![]))&#xA;9999999999&#xA;      -&amp;gt; +(+!![]+(!![]+[])[!![]+!![]+!![]]+(+!![])+(+[]))+(+((+((+(+!![]+[+!![]]+(!![]+[])[!![]+!![]+!![]]+(!![]+!![])+(+[]))+[])[+!![]]+(+[])+(+[])+(+[])+(+[])+(+[])+(+[])+(+!![]))+[])[!![]+!![]]+(+!![])))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;SN: Another way to ask is requiring to be testable and shouldn't be longer than a chosen generator&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2019-01-09T14:07:32.747" LastActivityDate="2019-01-09T14:07:32.747" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17252" PostTypeId="2" ParentId="6918" CreationDate="2018-12-31T23:41:12.553" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/MilkyWay90/Turing-Machine-But-Way-Worse&quot; rel=&quot;nofollow noreferrer&quot;&gt;Turing Machine But Way Worse&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h3&gt;By MilkyWay90 and ASCII_only&lt;/h3&gt;&#xA;&lt;p&gt;When you look at golfing languages, they confuse you and are very hard to learn.&lt;/p&gt;&#xA;&lt;p&gt;But when you look at practical languages, they don't confuse you (normally) and are easy to learn (normally)&lt;/p&gt;&#xA;&lt;p&gt;But what about a language which confuses you, but is easy to learn?&lt;/p&gt;&#xA;&lt;p&gt;This is where Turing Machine But Way Worse comes in.&lt;/p&gt;&#xA;&lt;p&gt;When I was learning about Turing Machines, I was annoyed by how they couldn't use I/O, so I built a programming language which does!&lt;/p&gt;&#xA;&lt;p&gt;With the help of ASCII_only, we made a language which processes I/O while still keeping the point of a Turing Machine.&lt;/p&gt;&#xA;&lt;p&gt;If you look at any submission for Turing Machine But Way Worse, you can see that it is just a lot of numbers. A LOT. But when you learn it, it will be super easy to debug and write your own programs using our debugger built-in.&lt;/p&gt;&#xA;" OwnerUserId="83048" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2018-12-31T23:41:12.553" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17253" PostTypeId="1" CreationDate="2019-01-01T03:08:40.383" Score="11" ViewCount="255" Body="&lt;p&gt;It's New Year's Day in &lt;a href=&quot;https://en.wikipedia.org/wiki/Zulu_Time&quot; rel=&quot;nofollow noreferrer&quot;&gt;Stack Exchange land&lt;/a&gt;...&lt;/p&gt;&#xA;&lt;p&gt;A distinguishing characteristic of these sites is how they are moderated:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;We designed the Stack Exchange network engine to be mostly self-regulating, in that we amortize the overall moderation cost of the system across thousands of teeny-tiny slices of effort contributed by regular, everyday users.&lt;br /&gt;&#xA;-- &lt;a href=&quot;http://blog.stackoverflow.com/2009/05/a-theory-of-moderation/&quot;&gt;A Theory of Moderation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;While there certainly are &lt;a href=&quot;https://stackoverflow.blog/2018/11/21/our-theory-of-moderation-re-visited/&quot;&gt;Moderators&lt;/a&gt; here, a significant amount of the &lt;em&gt;moderation&lt;/em&gt; is done by ordinary people, using the privileges&#xA;they've earned by virtue of their contributions to the site. Each of you contributes a little bit of time and effort, and together you accomplish much.&lt;/p&gt;&#xA;&lt;p&gt;As we enter a new year, let's pause and reflect, taking a moment to appreciate the work that we do here together.&#xA;To that end, here is how the moderation done here on Programming Puzzles &amp;amp; Code Golf breaks down by activity over the past 12 months:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;                 Action                  Moderators Community¹&#xA;---------------------------------------- ---------- ----------&#xA;Users suspended²                                  8         44&#xA;Users destroyed                                  77          0&#xA;Users deleted                                     7          0&#xA;Users contacted                                  12          0&#xA;User suspensions lifted early                     2          0&#xA;Tasks reviewed³: Suggested Edit queue            87      1,054&#xA;Tasks reviewed³: Reopen Vote queue               21        919&#xA;Tasks reviewed³: Low Quality Posts queue        118        835&#xA;Tasks reviewed³: Late Answer queue               56        503&#xA;Tasks reviewed³: First Post queue               147      1,101&#xA;Tasks reviewed³: Close Votes queue               21      1,066&#xA;Tag synonyms proposed                             0          2&#xA;Tag synonyms created                              0          1&#xA;Questions unprotected                            18         41&#xA;Questions reopened                               18        146&#xA;Questions protected                               0         60&#xA;Questions migrated                                0          1&#xA;Questions flagged⁴                               17        870&#xA;Questions closed                                136        632&#xA;Question flags handled⁴                         351        536&#xA;Posts unlocked                                    3          2&#xA;Posts undeleted                                  33        947&#xA;Posts locked                                      4        125&#xA;Posts deleted⁵                                  258      2,884&#xA;Posts bumped                                      0         32&#xA;Escalations to the CM team                        3          0&#xA;Comments undeleted                               46          0&#xA;Comments flagged                                  9      4,138&#xA;Comments deleted⁶                             6,634     12,839&#xA;Comment flags handled                         1,287      2,860&#xA;Bounties canceled                                 8          0&#xA;Answers flagged                                  49        854&#xA;Answer flags handled                            558        345&#xA;All comments on a post moved to chat             42          0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Footnotes&lt;/h3&gt;&#xA;&lt;p&gt;¹ &amp;quot;Community&amp;quot; here refers both to &lt;a href=&quot;https://codegolf.stackexchange.com/users&quot;&gt;the membership of Programming Puzzles &amp;amp; Code Golf&lt;/a&gt; &lt;em&gt;without&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=moderators&quot;&gt;diamonds next to their names&lt;/a&gt;, and to the automated systems otherwise known as &lt;a href=&quot;https://codegolf.stackexchange.com/users/-1&quot;&gt;user #-1&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;² The system will suspend users under three circumstances: when a user is recreated after being previously suspended, when a user is recreated after being destroyed for spam or abuse, and when a network-wide suspension is in effect on an account.&lt;/p&gt;&#xA;&lt;p&gt;³ This counts every review that was submitted (not skipped) - so the 3 suggested edits reviews needed to approve an edit would count as 3, the goal being to indicate the frequency of moderation actions. This also applies to flags, etc.&lt;/p&gt;&#xA;&lt;p&gt;⁴ Includes close flags (but &lt;em&gt;not&lt;/em&gt; close or reopen votes).&lt;/p&gt;&#xA;&lt;p&gt;⁵ This ignores numerous deletions that happen automatically in response to some other action.&lt;/p&gt;&#xA;&lt;p&gt;⁶ This includes comments deleted by their own authors (which also account for some number of handled comment flags).&lt;/p&gt;&#xA;&lt;p&gt;Wishing you all a happy new year...&lt;/p&gt;&#xA;" OwnerUserId="1144" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-01-01T03:08:40.383" Title="2018: a year in moderation" Tags="|discussion|moderation|statistics|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17254" PostTypeId="2" ParentId="2140" CreationDate="2019-01-01T09:50:32.760" Score="0" Body="&lt;h1&gt;Hearts &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Goal: build the bot to play the classic card game &lt;a href=&quot;https://en.wikipedia.org/wiki/Hearts&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hearts&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;The Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Four players per game&lt;/li&gt;&#xA;&lt;li&gt;Played with a standard deck of 52 cards (in the protocol, 11 = J, 12 = Q, 13 = K, 14 = A)&lt;/li&gt;&#xA;&lt;li&gt;Object: finish the game with the least points&lt;/li&gt;&#xA;&lt;li&gt;Each game consists of many rounds, each of which consist of 13 tricks&lt;/li&gt;&#xA;&lt;li&gt;At the beginning of a round, each player is dealt 13 cards&lt;/li&gt;&#xA;&lt;li&gt;Then, each player passes three cards to an opponent:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Round 1: Pass to opponent 1 (to your left)&lt;/li&gt;&#xA;&lt;li&gt;Round 2: Pass to opponent 2 (across the table)&lt;/li&gt;&#xA;&lt;li&gt;Round 3: Pass to opponent 3 (to your right)&lt;/li&gt;&#xA;&lt;li&gt;Round 4: No passing occurs&lt;/li&gt;&#xA;&lt;li&gt;Round 5 is the same as round 1, and so on&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The player with the two of clubs plays it, beginning the first trick. The suit of the first card played in a trick is the &amp;quot;leading suit.&amp;quot;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each other player adds a card to the trick (clockwise). If they have any cards of the leading suit, they must play them; otherwise, they can play any card. (Exception: hearts and the queen of spades cannot be played in the first trick.)&lt;/li&gt;&#xA;&lt;li&gt;The player who played the highest card &lt;strong&gt;in the leading suit&lt;/strong&gt; takes the trick, adding its cards to their collection of taken cards (distinct from their hand)&lt;/li&gt;&#xA;&lt;li&gt;The player who took the trick then begins the next trick with any card from their hand. (Exception: A player may not begin a trick with hearts until a heart or the queen of spades has already been played.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;After 13 tricks, the round ends. Each player gains points for their taken cards:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1 point per heart&lt;/li&gt;&#xA;&lt;li&gt;13 points for the queen of spades&lt;/li&gt;&#xA;&lt;li&gt;0 points for all other cards&lt;/li&gt;&#xA;&lt;li&gt;Exception: If a player would gain 26 points (i.e. they took every heart and the queen of spades), every other player gains 26 points instead.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Another round begins. This continues until a player has ≥100 points at the end of a round. At this point, the player with the lowest score wins (if there is a tie, extra rounds are played until there is no longer a tie).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;The Protocol&lt;/h2&gt;&#xA;&lt;p&gt;Your program can be in any language (that I can run on macOS without too much fuss). It communicates using newline-separated JSON messages on stdin/stdout.&lt;/p&gt;&#xA;&lt;p&gt;Messages your program receives:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;{&amp;quot;request&amp;quot;: &amp;quot;pass&amp;quot;, &amp;quot;direction&amp;quot;: &amp;quot;left&amp;quot;, &amp;quot;state&amp;quot;: {...}}&lt;/code&gt; (other directions: &lt;code&gt;right&lt;/code&gt;, &lt;code&gt;across&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{&amp;quot;request&amp;quot;: &amp;quot;play&amp;quot;, &amp;quot;state&amp;quot;: {...}}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Expected responses:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;{&amp;quot;action&amp;quot;: &amp;quot;pass&amp;quot;, &amp;quot;cards&amp;quot;: [{&amp;quot;suit&amp;quot;: &amp;quot;hearts&amp;quot;, &amp;quot;number&amp;quot;: 14}, {&amp;quot;suit&amp;quot;: &amp;quot;hearts&amp;quot;, &amp;quot;number&amp;quot;: 13}, {&amp;quot;suit&amp;quot;: &amp;quot;hearts&amp;quot;, &amp;quot;number&amp;quot;: 12}]}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{&amp;quot;action&amp;quot;: &amp;quot;play&amp;quot;, &amp;quot;card&amp;quot;: {&amp;quot;suit&amp;quot;: &amp;quot;hearts&amp;quot;, &amp;quot;number&amp;quot;: 14}}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The state object:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;    &amp;quot;hand&amp;quot;: [cards...],&#xA;    &amp;quot;taken&amp;quot;: {playerId: [cards...]},&#xA;    &amp;quot;scores&amp;quot;: {playerId: number}, // Does not include the current round&#xA;    &amp;quot;currentScores&amp;quot;: {playerId: number}, // Points earned so far this round&#xA;    &amp;quot;tricks&amp;quot;: [tricks...] // The current trick is the last object in this array.&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The trick object:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;    &amp;quot;leader&amp;quot;: playerId, // The player who started the trick&#xA;    &amp;quot;leadSuit&amp;quot;: &amp;quot;hearts&amp;quot;, // or spades, clubs, diamonds&#xA;    &amp;quot;played&amp;quot;: {playerId: card},&#xA;    &amp;quot;winner&amp;quot;: playerId // Missing for the current trick&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You always see the same player numbers: you are player 0, player 1 is to your left, player 2 is across from you, and player 3 is to your right.&lt;/p&gt;&#xA;" OwnerUserId="7053" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-01-01T09:50:32.760" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17256" PostTypeId="2" ParentId="2140" CreationDate="2019-01-02T00:13:50.833" Score="0" Body="&lt;p&gt;&lt;strong&gt;Smallest Working Result - Referenced Reduction&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;RULES&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Function must accept a keyed data structure&lt;/li&gt;&#xA;&lt;li&gt;Function must return a modified version of that keyed data structure.&lt;/li&gt;&#xA;&lt;li&gt;Function cannot use any libraries&lt;/li&gt;&#xA;&lt;li&gt;Function will be tested against linked file.&lt;/li&gt;&#xA;&lt;li&gt;Function must work against other similarly formatted files (no having a function that pops out a static answer!)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;SCORING&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;To score, must be able to be run against multiple inputted keyed arrays.&lt;/li&gt;&#xA;&lt;li&gt;To score, returned array must be able to be reverse-engineered into original array (conversion must be lossless).&lt;/li&gt;&#xA;&lt;li&gt;Score will be determined by a keyed array built off of attached CSV (based off the oxford dictionary).&lt;/li&gt;&#xA;&lt;li&gt;Score is to return an array with the fewest unique referenced keys.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;DESCRIPTION&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Build a function that does the following: &#xA;It pulls in a keyed data structure (dictionary, keyed array, object, etc. depending on your languages' primary keyed reference structure) of the following structure...&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ID   |  REF 1   |   REF 2   |   REF 3   | ...&#xA;1    |  &#xA;2    |   1      |   35      |   1&#xA;3    |   1      |   2       |   5       |&#xA;4    |   FOO    |   7       |   21      |&#xA;5    |   FOO    |   9       |           |   &#xA;6    |          |           |           |&#xA;7    |          |           |&#xA;BAR  |   6      |   6       |   6&#xA;8    |   BAR    |   BAR&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Each object is made of and unrestricted number of references to other objects (that may or may not be in the table), or are 'prime' objects that reference nothing. Prime objects cannot be reduced. Objects that reference objects not in the table obviously cannot be fully reduced. Further, an object may not directly reference itself. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal is to have the fewest things referenced possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, a table like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ID   |  REF 1   |   REF 2   |   REF 3   | ...&#xA;1    |   &#xA;2    |   1      |   1       |   7&#xA;3    |   1      |   2       |   1       |&#xA;4    |   3      |   1       |   3       |&#xA;5    |   1      |   3       |   3       |&#xA;6    |   1      |   4       |   FOO     |&#xA;7    |   &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Could be reduced to:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ID   |  REF 1      |   REF 2                   |   REF 3     | ...&#xA;1    |  &#xA;2    |   1         |   1                       |   7&#xA;3    |   1         |   (1,1, 7)                |   1         |&#xA;4    | (1(1,1, 7)1)|   1                       |  (1(1,1,7)1)|&#xA;5    |   1         |  (1(1,1,7)1)              |  (1(1,1,7)1)|&#xA;6    |   1         |((1(1,1,7)1),1(1(1,1,7)1)) |   FOO       |&#xA;7    |   &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(Notice, although the returned array is bigger and multidimensional, it actually has fewer references in it. While the first has 1, 2, 3, 4, 7, and FOO in the ref columns, the reduced table only has the unique values 1, 7, and FOO.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The result is scored by the result that has the fewest unique items referenced while still being able to re-create the original table.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And to test, it's going to have a csv of the complete Oxford Dictionary thrown at it that's been converted to a keyed array. (I've uploaded a csv of it here: &lt;a href=&quot;http://joshup.com/experiments/Oxford_English_Dictionary.csv&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://joshup.com/experiments/Oxford_English_Dictionary.csv&lt;/a&gt;, each word being the ID, and the following words being the references. Note, file is still being cleaned up, plan to clean before challenge gets moved from sandbox to main area.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although the examples are fairly straightforward, the code puzzler is reminded that this will be tested against an array built form the Oxford Dictionary using the word as the key, and the full description of the word as the array (each word being an array item, and, potentially a key somewhere else in the array). This means there is a very real chance that unlike the examples, arrays will reference eachother quite frequently, creating large loops of refrences between them, and the puzzle solver is reminded that choosing which key to reduce other keys into to will likely have a large impact on the final set of unique references.&lt;/p&gt;&#xA;" OwnerUserId="78929" LastEditorUserId="78929" LastEditDate="2019-01-02T05:31:02.483" LastActivityDate="2019-01-02T05:31:02.483" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17258" PostTypeId="2" ParentId="2140" CreationDate="2019-01-04T13:15:13.123" Score="1" Body="&lt;h1&gt;&amp;quot;Cumbersome Crown words&amp;quot;&lt;/h1&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;This is my first entry here, so please be gentle if it's poorly stated. I'll need a bit of guidance to make it a good submission.&lt;/p&gt;&#xA;&lt;p&gt;I am a typewriter maker, and I want to prove that the design of my competitor, Mr. Crown, is very inconvenient to use. To do that, I want a list of the most cumbersome words to type out on a &lt;a href=&quot;https://hardmath123.github.io/crown-typewriter.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Crown typewriter&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Write a program that takes an argument &amp;quot;n&amp;quot; as a positive integer. You may load the &lt;a href=&quot;https://en.wikipedia.org/wiki/Words_(Unix)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Unix words list&lt;/a&gt; from any source (ignore case; discard any word containing anything outside of A-Z, such as &amp;quot;O'Brien&amp;quot;, &amp;quot;L'vov&amp;quot;, etc.). Given the layout shown below, output the &amp;quot;n&amp;quot; most cumbersome words to write, one result per line. Each result is the cumbersome word, some form of separator (eg. a space), then their word score (see below) with two decimals of precision (and your choice of decimal separator). Bonus if results are sorted in descending order by their word score, and further bonus if ties (by score) are also sorted in alphabetic order.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/kZlVb.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/kZlVb.png&quot; alt=&quot;Crown typewriter layout&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;X Q K G B P M C O F L A N D T H E R I S U W Y J V Z&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Word scoring&lt;/h1&gt;&#xA;&lt;p&gt;Assume the pointer starts in the leftmost position, on &amp;quot;X&amp;quot;. Count each movement and each hammer strike as one unit, but divide the sum by the number of characters in the word. Hence, sample word scores are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;THEIR: 4.8&lt;/strong&gt; -- 24 units (14 movements, strike &amp;quot;T&amp;quot;, movement, strike &amp;quot;H&amp;quot;, movement, strike &amp;quot;E&amp;quot;, 2 movements, strike &amp;quot;I&amp;quot;, movement, strike &amp;quot;R&amp;quot;) divided by 5 characters&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;LAND: 4.25&lt;/strong&gt; -- 17 units (10 movements, strike &amp;quot;L&amp;quot;, movement, strike &amp;quot;A&amp;quot;, movement, strike &amp;quot;N&amp;quot;, movement, strike &amp;quot;D&amp;quot;) divided by 4 characters&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;FOWL: 9.50&lt;/strong&gt; -- 38 units (9 movements, strike &amp;quot;F&amp;quot;, movement, strike &amp;quot;O&amp;quot;, 13 movements, strike &amp;quot;W&amp;quot;, 11 movements, strike &amp;quot;L&amp;quot;) divided by 4 characters&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;BARBARA : 8.00&lt;/strong&gt; -- 56 units (4 movements, strike &amp;quot;B&amp;quot;, 7 movements, strike &amp;quot;A&amp;quot;, 6 movements, strike &amp;quot;R&amp;quot;, 13 movements, strike &amp;quot;B&amp;quot;, 7 movements, strike &amp;quot;A&amp;quot;, 6 movements, strike &amp;quot;R&amp;quot;, 6 movements, strike &amp;quot;A&amp;quot;) divided by 7 characters&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;X: 1&lt;/strong&gt; -- just hit the hammer once and you're done&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; These examples are not the most cumbersome words.&lt;/p&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;5&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Standard output:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;ANNA 4.25&lt;/p&gt;&#xA;&lt;p&gt;THEIR 4.80&lt;/p&gt;&#xA;&lt;p&gt;LAND 4.25&lt;/p&gt;&#xA;&lt;p&gt;BARBARA 8.00&lt;/p&gt;&#xA;&lt;p&gt;FOWL 9.50&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Bonus output:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;FOWL 9.50&lt;/p&gt;&#xA;&lt;p&gt;BARBARA 8.00&lt;/p&gt;&#xA;&lt;p&gt;THEIR 4.80&lt;/p&gt;&#xA;&lt;p&gt;ANNA 4.25&lt;/p&gt;&#xA;&lt;p&gt;LAND 4.25&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Scoring submissions and determining the winner&lt;/h1&gt;&#xA;&lt;p&gt;I'm really not sure what the best measure of success is. Definitely not code golf, because I can never distinguish the damn things from line noise or pure black magic. But what then? I'm not very familiar with which competition types are available.&lt;/p&gt;&#xA;&lt;p&gt;If two solutions are tied for a position, but only one of them uses the bonus output format, then that one wins the tie.&lt;/p&gt;&#xA;" OwnerUserId="46207" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-01-10T09:38:58.370" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="17261" PostTypeId="2" ParentId="2140" CreationDate="2019-01-07T06:15:15.490" Score="0" Body="&lt;h1&gt;IPv6 Aggregator&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal is to aggregate a list of ipv6 subnets into a smaller list.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input is a list of ipv6 subnets in the extended format (such as 2001:0db8:0000:0000:0000:0000:0000:0000/48)&lt;/li&gt;&#xA;&lt;li&gt;The output must be the optimal&lt;/li&gt;&#xA;&lt;li&gt;The output list can be either in extended format, or using any valid compression&lt;/li&gt;&#xA;&lt;li&gt;The output list can be unsorted&lt;/li&gt;&#xA;&lt;li&gt;The value of irrelevant bits is not important (both ::1/127 and ::0/127 are considered valid)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Examples:&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[2001:0db8:0001:0000:0000:0000:0000:0000/48,&#xA;2001:0db8:0000:0000:0000:0000:0000:0000/48,&#xA;2001:0db8:0000:000f:0000:0000:0000:0000/48,&#xA;2001:0db8:0000:000e:0000:0000:0000:0000/48]&#xA;will become&#xA;[2001:0db8:0000:0001:0000:0000:0000:0000/47,&#xA;2001:0db8:000e:0001:0000:0000:0000:0000/47]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="64949" LastActivityDate="2019-01-07T06:15:15.490" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17262" PostTypeId="1" CreationDate="2019-01-07T11:21:24.763" Score="1" ViewCount="63" Body="&lt;p&gt;I was recently (in fact just right now) browsing the review queue when I saw an off-topic question. I tried to downvote, but then I got a message that the question was deleted and I couldn't vote on it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe this is a bug. If it isn't then please correct me, but I don't see a reason for a deleted question to be reviewed.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Edit: I just read about &lt;a href=&quot;https://meta.stackexchange.com/questions/157121/what-are-review-tests-audits-and-how-do-they-work&quot;&gt;review audits&lt;/a&gt;, but they aren't even active on here, so it couldn't be that either.&lt;/p&gt;&#xA;" OwnerUserId="82488" LastEditorUserId="68942" LastEditDate="2021-06-05T23:18:19.353" LastActivityDate="2021-06-05T23:18:19.353" Title="Deleted question appears on review queue" Tags="|bug|status-bydesign|reviewing|deleted-questions|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17263" PostTypeId="2" ParentId="2140" CreationDate="2019-01-07T13:26:04.243" Score="1" Body="&lt;h1&gt;Where can I get to from each location? (Transitive Closure)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given an undirected &lt;a href=&quot;https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)&quot; rel=&quot;nofollow noreferrer&quot;&gt;graph&lt;/a&gt; (network) &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt;, construct a new graph in which vertex (node) pair &lt;span class=&quot;math-container&quot;&gt;\$(u,v)\$&lt;/span&gt; is an edge (are connected) if and only if a path &lt;span class=&quot;math-container&quot;&gt;\$(u,w_1,w_2,...,w_k,v)\$&lt;/span&gt; exists in &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt; for some &lt;span class=&quot;math-container&quot;&gt;\$k\ge 0\$&lt;/span&gt;. This is known as &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt;'s transitive closure. If this is clear to you, you're ready to get started. Otherwise, just read through the below sections. It is actually a very simple problem.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;I/O formats&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Take for example the graph (network)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1──2  3──4&#xA;│     │&#xA;5  6──7──8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We can represent¹ it as an adjacency (connection) matrix:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; │1 2 3 4 5 6 7 8&#xA;─┼───────────────&#xA;1│  ┘ &#xA;2│&#xA;3│      ┘&#xA;4│&#xA;5│┘&#xA;6│            ┘&#xA;7│    ┘         ┘&#xA;8│&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[0,1,0,0,0,0,0,0],[0,0,0,0,0,0,0,0],[0,0,0,1,0,0,0,0],[0,0,0,0,0,0,0,0],[1,0,0,0,0,0,0,0],[0,0,0,0,0,0,1,0],[0,0,0,1,0,0,0,1],[0,0,0,0,0,0,0,0]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that here only one of &lt;span class=&quot;math-container&quot;&gt;\$(u,v),(v,u)\$&lt;/span&gt; is represented, but we consider both directions as valid edges (connections).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or as a list of of edges²:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[1,2],[1,5],[3,4],[5,1],[6,7],[7,3],[7,8]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or for each vertex³ (node), the list of its adjacent vertices:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[2,5],[1],[7,4],[1],[7],[3,8],[8],[]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Or as a dictionary⁴:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{&quot;1&quot;:[2,5],&quot;3&quot;:[7,4],&quot;7&quot;:[6,3,8]}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Any of these, and any other reasonable input and output formats (you optionally may use one format for input and another for output) are allowed, but you must state what your formats are.&#xA; However, it &lt;em&gt;is&lt;/em&gt; required that your formats support under-representing (e.g. &lt;code&gt;[3,7]&lt;/code&gt; &lt;em&gt;but not&lt;/em&gt; &lt;code&gt;[7,3]&lt;/code&gt;) and over-representing (e.g. both &lt;code&gt;[3,7]&lt;/code&gt; &lt;em&gt;and&lt;/em&gt; &lt;code&gt;[7,3]&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Walk-through&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Let's use the representation &lt;code&gt;[[1,2],[1,5],[3,4],[5,1],[6,7],[7,3],[7,8]]&lt;/code&gt;. Since 1 is connected to 2 then 2 is also connected to 1, so we add (it doesn't matter where) this edge (connection):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;[[1,2],[1,5],&lt;b&gt;[2,1]&lt;/b&gt;,[3,4],[5,1],[6,7],[7,3],[7,8]]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is also possible to travel &lt;code&gt;[1,5]&lt;/code&gt; in reverse, but that pair is already represented further in the list. Now note that it is possible to find a path from 2 to 5, and vice versa, via 1, so we add these two edges:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;[[1,2],[1,5],[2,1],&lt;b&gt;[2,5],[5,2]&lt;/b&gt;,[3,4],[5,1],[6,7],[7,3],[7,8]]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This completes the left side of the graph. Similarly, we process the right side by adding the reversals of &lt;code&gt;[3,4]&lt;/code&gt;, &lt;code&gt;[6,7]&lt;/code&gt;, and &lt;code&gt;[7,3]&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;[[1,2],[1,5],[2,1],[2,5],[5,2],[3,4],[5,1],[6,7],[7,3],[7,8],&lt;b&gt;[4,3],[7,6],[7,3]&lt;/b&gt;]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Two-step paths via 3 are possible, so we add &lt;code&gt;[7,4]&lt;/code&gt; and &lt;code&gt;[4,7]&lt;/code&gt;. Similarly, two-step paths via 7 are &lt;code&gt;[6,3]&lt;/code&gt;, &lt;code&gt;[3,6]&lt;/code&gt;, &lt;code&gt;[6,8]&lt;/code&gt;, &lt;code&gt;[8,6]&lt;/code&gt;, &lt;code&gt;[3,8]&lt;/code&gt;, and &lt;code&gt;[8,3]&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;[[1,2],[1,5],[2,1],[2,5],[5,2],[3,4],[5,1],[6,7],[7,3],[7,8],[4,3],[7,6],[7,3],&lt;b&gt;[7,4],[4,7]&lt;/b&gt;,&lt;i&gt;[6,3],[3,6],[6,8],[8,6],[3,8],[8,3]&lt;/i&gt;]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, we add the three-step paths &lt;code&gt;[6,4]&lt;/code&gt;, &lt;code&gt;[4,6]&lt;/code&gt;, &lt;code&gt;[4,8]&lt;/code&gt;, and &lt;code&gt;[8,4]&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;[[1,2],[1,5],[2,1],[2,5],[5,2],[3,4],[5,1],[6,7],[7,3],[7,8],[4,3],[7,6],[7,3],[7,4],[4,7],[6,3],[3,6],[6,8],[8,6],[3,8],[8,3],&lt;b&gt;[6,4],[4,6],[4,8],[8,4]&lt;/b&gt;]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And this is our answer. It could of course be in any order.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;sup&gt;Though the connections do not have direction, I've only put in one entry in the table for each connection, and obviously the diagonal is all-true too, as every node is reachable from itself.&lt;/sup&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;sup&gt;Since the connections in this challenge do not have a direction, &lt;code&gt;[1,5]&lt;/code&gt; and &lt;code&gt;[5,1]&lt;/code&gt; are the same connection. This serves to illustrate that such may occur in the given data.&lt;/sup&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;sup&gt;Here, each node must have its own list, as the lists are paired to their points by their position in the data. However, each list need not be exhaustive as long as all connections are represented somewhere.&lt;/sup&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;sup&gt;Here, we can omit entries that are fully covered by the other entries.&lt;/sup&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/path-finding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;path-finding&amp;#39;&quot; rel=&quot;tag&quot;&gt;path-finding&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graph-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graph-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;graph-theory&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2019-01-08T15:04:00.280" LastActivityDate="2019-01-08T15:04:00.280" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="17264" PostTypeId="2" ParentId="17262" CreationDate="2019-01-07T13:35:23.453" Score="2" Body="&lt;p&gt;This was most likely just bad timing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I assume the question you were reviewing is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/178464/what-date-encoding-could-this-be&quot;&gt;What date encoding could this be?&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It was asked at 10:57:13 UTC.&lt;/li&gt;&#xA;&lt;li&gt;It entered the review queue at 11:00:01 UTC.&lt;/li&gt;&#xA;&lt;li&gt;It was deleted 11:12:35 UTC.&lt;/li&gt;&#xA;&lt;li&gt;It left the review queue at 11:14:53 UTC.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So the question was removed from the review queue because it was deleted, it just happened with a delay of 2 minutes and 18 seconds.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2019-01-07T13:35:23.453" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17265" PostTypeId="2" ParentId="2140" CreationDate="2019-01-07T22:42:44.647" Score="1" Body="&lt;h1&gt;Unfactor a list &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/jelly&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;jelly&amp;#39;&quot; rel=&quot;tag&quot;&gt;jelly&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/DennisMitchell/jellylanguage&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt; has an interesting built-in, &lt;code&gt;ÆẸ&lt;/code&gt;. It's the inverse of &lt;code&gt;ÆE&lt;/code&gt;. &lt;code&gt;ÆE&lt;/code&gt; returns the exponents of the prime factors of an integer &lt;code&gt;n&lt;/code&gt;, where each exponent corresponds to the prime number at its index, so, for example, &lt;code&gt;[3, 5, 1]&lt;/code&gt; represents &lt;span class=&quot;math-container&quot;&gt;\$2^3\cdot3^5\cdot5^1\$&lt;/span&gt;. If a prime isn't included in the prime factorization of &lt;code&gt;n&lt;/code&gt;, but there is at least one prime after it that is included, a zero is put in its place (&lt;span class=&quot;math-container&quot;&gt;\$p^0=1\$&lt;/span&gt;). So, for example, &lt;code&gt;[3, 0, 5, 1]&lt;/code&gt; represents &lt;span class=&quot;math-container&quot;&gt;\$2^3\cdot5^5\cdot7^1\$&lt;/span&gt;, and &lt;code&gt;[0, 4, 4, 50, 0, 7]&lt;/code&gt; represents &lt;span class=&quot;math-container&quot;&gt;\$3^4\cdot5^4\cdot7^{50}\cdot13^7\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your job is to implement &lt;code&gt;ÆẸ&lt;/code&gt;, &lt;code&gt;ÆE&lt;/code&gt;'s inverse. That is, you'll be given a list returned by &lt;code&gt;ÆE&lt;/code&gt;, and your job is to find &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must always return a positive integer (strictly greater than zero). You may assume the input doesn't have negative or float exponents or trailing zeroes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that you're encouraged not to use &lt;code&gt;ÆẸ&lt;/code&gt; or your language's equivalent (if any) in your answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using any of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/41024&quot;&gt;standard loopholes&lt;/a&gt; is prohibited.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test cases (you don't have to support exponents, an output or an input's length beyond your natural signed integer type's limit):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[] -&amp;gt; 1&#xA;[0, 4] -&amp;gt; 81&#xA;[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1] -&amp;gt; 1111&#xA;[10] -&amp;gt; 1024&#xA;[3, 5, 1] -&amp;gt; 9720&#xA;[3, 0, 5, 1] -&amp;gt; 175000&#xA;[31] -&amp;gt; 2147483648&#xA;[32] -&amp;gt; 4294967296&#xA;[63] -&amp;gt; 9223372036854775808&#xA;[64] -&amp;gt; 18446744073709551616&#xA;[0, 4, 4, 50, 0, 7] -&amp;gt; 5713082599062385095715588395684396863698753591853983125&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Make more test cases:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To generate the input that corresponds to a given output, use &lt;a href=&quot;https://tio.run/##DchBEYAwEANAS21DrokApPBhagADCOCFFd4MQlBysM9dlzG2zHufn@O9zsxkryhqtEs0iMX/kBLM0ASHAmF1gq4iLNTGDw&quot; rel=&quot;nofollow noreferrer&quot;&gt;this program&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To generate the output that corresponds to a given input, use &lt;a href=&quot;https://tio.run/##y0rNyan8//9w28NdO/7//x9toKNgAkamQBYQmccCAA&quot; rel=&quot;nofollow noreferrer&quot;&gt;this program&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2019-01-07T22:51:35.193" LastActivityDate="2019-01-07T22:51:35.193" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17268" PostTypeId="1" CreationDate="2019-01-08T19:52:59.803" Score="-6" ViewCount="231" Body="&lt;p&gt;What? Have a question similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/47351/home-on-the-range-of-lists&quot;&gt;Home on the Range of Lists&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why cannot this user ask the question?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Does that mean that even if the question is posted at Sandbox and well-received that the question will still not be posted at the main site?&lt;/p&gt;&#xA;" OwnerUserId="31257" LastActivityDate="2019-01-08T21:30:12.823" Title="You have reached your question limit" Tags="|discussion|support|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17269" PostTypeId="2" ParentId="17268" CreationDate="2019-01-08T21:30:12.823" Score="6" Body="&lt;p&gt;The Stack Exchange software imposes a temporary question ban on users who meet a threshold for low-quality questions, determined by the number of questions closed, deleted, and/or having a negative score in a given period of time. You met that threshold, and the system imposed the ban. There's nothing that can be done to remove it, other than just waiting for the ban to expire.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See &lt;a href=&quot;https://codegolf.stackexchange.com/help/asking-rate-limited&quot;&gt;the help center&lt;/a&gt; for more information.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2019-01-08T21:30:12.823" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17271" PostTypeId="2" ParentId="2140" CreationDate="2019-01-09T08:09:41.727" Score="0" Body="&lt;h1&gt;Index and Get/Set Nested Arrays/Lists&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This question is intended as extension of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/47351/home-on-the-range-of-lists/&quot;&gt;Home on the Range of Lists&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge is to write one or two functions or a program which are getter and setter for a nested array/list mapped to 0-based or 1-based indexing. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;An array/list containing at least one nested array/list (length of &lt;code&gt;2&lt;/code&gt;) where each first element of successive nested arrays is set to either 0-based or 1-based indexes corresponding to each array. Each array is initialized with the first element set to the respective index of the full array.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2 =&amp;gt; [0, [1]]&#xA;     (0) (1) // 0-based indexing&#xA;6 =&amp;gt; [0, [1, [2, [3, [4, [5]]]]]]&#xA;     (1) (2) (3) (4) (5) (6) // 1-based indexing&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If one function is used the second parameter must be the getter for the element value. If only two arguments are passed the function (input, index to get) acts as the getter. If three arguments are passed, the second argument acts as a getter and the third argument acts as a setter.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If two functions are used one function acts as a getter exclusively and the second function acts as a setter exclusively. The first argument to the function is the index to get, the second argument is the value to set at the index passed at the first argument.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the array/list prototype is modified to chain the method to the rules above still apply.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The functions are not expected to push to or splice from values in the input array/list.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Where a getter is used the value of that index of the array/list.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Where a setter is used the complete array/list after setting the index to the passed value.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(Single function acting as both getter and setter, where &lt;code&gt;f&lt;/code&gt; is the single function)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Setter (0-based indexing)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f([0, [1]], 1, 7) =&amp;gt; [0, [7]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Setter (1-based indexing)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f([0, [1, [2, [3, [4, [5]]]]]], 6, 'map') =&amp;gt; [0, [1, [2, [3, [4, ['map']]]]]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Getter (1-based indexing)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f([0, [1, [2, [3, [4, ['map']]]]]], 6) =&amp;gt; 'map'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(Two functions, &lt;code&gt;get&lt;/code&gt; and &lt;code&gt;set&lt;/code&gt;, 1-based indexing)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;get([0, [1, [2, [3, [4, [5]]]]]], 4) =&amp;gt; 3&#xA;&#xA;set([0, [1, [2, [3, [4, [5]]]]]], 4, 'set') =&amp;gt; [0, [1, [2, ['set', [4, [5]]]]]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(Modifying &lt;code&gt;Array&lt;/code&gt; (or equivalent in the language used prototype) 0-based indexing)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[0, [1, [2, [3, [4, [5]]]]]].get(4) =&amp;gt; 4&#xA;&#xA;[0, [1, [2, [3, [4, [5]]]]]].set(4, 'set') =&amp;gt; [0, [1, [2, [3, ['set', [5]]]]]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Winning criteria&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Least amount of bytes in the language used.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Tags: 'code-golf' 'array-manipulation'&lt;/p&gt;&#xA;" OwnerUserId="31257" LastEditorUserId="31257" LastEditDate="2019-01-09T08:30:06.593" LastActivityDate="2019-01-09T08:30:06.593" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="17275" PostTypeId="2" ParentId="2140" CreationDate="2019-01-09T18:37:44.727" Score="0" Body="&lt;h1&gt;This is not the Timing Attack you are looking for!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cryptography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cryptography&amp;#39;&quot; rel=&quot;tag&quot;&gt;cryptography&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;I recently was writing a piece of code to verify a &lt;a href=&quot;https://en.wikipedia.org/wiki/HMAC&quot; rel=&quot;nofollow noreferrer&quot;&gt;HMAC signature&lt;/a&gt; (to verify an API request). While doing that I found the given method in the documentation to be &amp;quot;incredibly verbose&amp;quot; and as a somewhat as a somewhat active PPCG member, that's obviously something that needs to be &amp;quot;fixed&amp;quot;! However being also an active member of &lt;a href=&quot;https://crypto.stackexchange.com/&quot;&gt;Crypto.SE&lt;/a&gt; I know that HMAC tag verification needs to expose &lt;em&gt;secret independent timing&lt;/em&gt; (a.k.a. &amp;quot;needs to be constant time&amp;quot;) because otherwise an attacker may just brute-force a valid tag with a couple of dozen / hundred queries checking each time up to which byte was correct.&lt;/p&gt;&#xA;&lt;h2&gt;The input&lt;/h2&gt;&#xA;&lt;p&gt;The input is two strings &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; which are guaranteed to be of the same length and encoding.&lt;/p&gt;&#xA;&lt;h2&gt;The output&lt;/h2&gt;&#xA;&lt;p&gt;The output is a truthy or falsey value.&lt;/p&gt;&#xA;&lt;h2&gt;What to do?&lt;/h2&gt;&#xA;&lt;p&gt;You return a truthy output if &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; have the same content and a falsey value otherwise.&lt;/p&gt;&#xA;&lt;h2&gt;That sounds too easy, where's the catch!?&lt;/h2&gt;&#xA;&lt;p&gt;Your code must exhibit &lt;em&gt;secret independent timing&lt;/em&gt;, that is the runtime of your code may not depend on the actual values of the two strings. To be valid your answer &lt;em&gt;must&lt;/em&gt; provide a convincing argument that the execution time is independent of the secret values. To help you, I've listed a helpful guidelines:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For secret-independent timing it is sufficient to use a non secret independent comparison on the HMAC of both strings under a fresh random key.&lt;/li&gt;&#xA;&lt;li&gt;For secret-independent timing there must not be early (loop-) returns or operations that are not evaluated due to short circuiting semantics (assuming you operate on the actual strings).&lt;/li&gt;&#xA;&lt;li&gt;For secret-independent timing the values must not be used as array indices or for similar lookups as timing variation can happen due to caching.&lt;/li&gt;&#xA;&lt;li&gt;For secret-independent timing the value must not contribute to control-flow decisions, e.g. as a condition for a &lt;code&gt;while&lt;/code&gt; or &lt;code&gt;if&lt;/code&gt; or as an operand to a short-circuiting &lt;code&gt;&amp;amp;&amp;amp;&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;For secret-independent timing the value must not contribute to operands to multplication or division instructions.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Who wins?&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest code in bytes per language that satisfies the I/O and the runtime behavior wins!&lt;/p&gt;&#xA;" OwnerUserId="55329" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-01-09T18:37:44.727" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17276" PostTypeId="2" ParentId="2140" CreationDate="2019-01-10T01:17:47.920" Score="3" Body="&lt;h1&gt;Speeding up powers of 2&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Create a function or program that indefinitely prints outs successive powers of 2 separated by newlines. However, the &lt;code&gt;n&lt;/code&gt;th term of the sequence (&lt;code&gt;2^n&lt;/code&gt;) must have a delay of &lt;code&gt;1/n&lt;/code&gt; seconds either before or after it is printed, but please specify this in your answer. If you choose to add the delay before the number is printed, the first number may optionally have a delay before it is printed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program may begin with &lt;code&gt;1&lt;/code&gt; or &lt;code&gt;2&lt;/code&gt; as the first printed number, but if you include &lt;code&gt;1&lt;/code&gt;, it is considered the 0th term, and your delays must be before each print and skip any initial delay (&lt;code&gt;1/0&lt;/code&gt; as a delay would not work, hence this rule).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program should run properly until it either reaches the integer limit of your language, or until &lt;code&gt;n = 1000&lt;/code&gt; (a 1 ms delay)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Expected output if &lt;code&gt;1&lt;/code&gt; is included:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 # after, wait 1/1 seconds&#xA;2 # after, wait 1/2 seconds&#xA;4 # after, wait 1/3 seconds&#xA;8 # after, wait 1/4 seconds&#xA;16 # after, wait 1/5 seconds&#xA;# etc...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Expected output if &lt;code&gt;1&lt;/code&gt; is not included:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2 # before/after, wait 1/1 seconds&#xA;4 # before/aftert, wait 1/2 seconds&#xA;8 # before/after, wait 1/3 seconds&#xA;16 # before/after, wait 1/4 seconds&#xA;# etc...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Sandbox&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How should I improve the wording?&lt;/li&gt;&#xA;&lt;li&gt;What potential ambiguities or language limits are there?&lt;/li&gt;&#xA;&lt;li&gt;Is this too similar to a preexisting challenge?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;EDITS&lt;/strong&gt;: Clarified that &lt;code&gt;n&lt;/code&gt; refers to the term number, not the power of 2&lt;/p&gt;&#xA;" OwnerUserId="69401" LastEditorUserId="69401" LastEditDate="2019-01-11T17:59:32.557" LastActivityDate="2019-01-11T17:59:32.557" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="17277" PostTypeId="2" ParentId="2140" CreationDate="2019-01-10T17:29:42.953" Score="0" Body="&lt;h1&gt;KoTH: Iterated Nash bargaining!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot;&gt;python&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;In this king of the hill challenge, you must play an iterated &lt;a href=&quot;https://en.wikipedia.org/wiki/Bargaining_problem&quot; rel=&quot;nofollow noreferrer&quot;&gt;Nash bargaining game&lt;/a&gt;.&#xA;You and your opponent must return a number between 1 and 100 which says how much money out of £100 you want.&lt;/p&gt;&#xA;&lt;p&gt;If the total amount requested by the players is less than £100, both players get their request. If their total request is greater than that available, neither player gets their request. However, to spice things up, it is iterated — you will play 200 rounds against each opponent.&lt;/p&gt;&#xA;&lt;p&gt;Your bot should be a Python 3.7 function that takes 4 inputs in the following order: your current points, your opponent's current points, all moves you have played (in a list) and all moves your opponent has played so far (also a list).&lt;/p&gt;&#xA;&lt;p&gt;Here are two examples, one plays the opponents last move (and 50 on the first move):&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;def copycat(themp, myp, theml, myl):&#xA;    if len(theml) &amp;lt; 1:&#xA;        return 50&#xA;    else:&#xA;        return theml[-1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The other plays 50 if they have less than 50 points, and 70 otherwise:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;def fiftyseventybot(thempoints, mepoints, themlist, mylist):&#xA;    if thempoints &amp;lt;= 50:&#xA;        return 50&#xA;    else:&#xA;        return 70&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your bot will play 200 rounds against each opponent, in the 'round robin' fashion .Whoever ends up with the most points wins. Standard loopholes are banned.&lt;/p&gt;&#xA;&lt;p&gt;Have fun!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&lt;p&gt;This is my first question, make sure to tell me if anything could be worded better or if anything is spelled wrong etc.&lt;/p&gt;&#xA;&lt;p&gt;Also tell me whether you think this is a good idea and if you have any ideas to add to it.&lt;/p&gt;&#xA;&lt;p&gt;Is there not enough of an incentive to change if both players are going 50?&#xA;if so, what incentives could be created?&lt;/p&gt;&#xA;&lt;p&gt;There seems to be disagreement between @PeterTaylor and @Spitemaster. I would like to reach some kind of consensus on this. Could anyone possibly comment on what they think?&lt;/p&gt;&#xA;" OwnerUserId="84062" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-01-23T21:19:19.430" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="17278" PostTypeId="2" ParentId="5243" CreationDate="2019-01-11T10:22:15.917" Score="4" Body="&lt;h1&gt;200 reputation for the true Alchemist&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I don't know a lot about chemistry (nor alchemy), however - having written &lt;a href=&quot;https://esolangs.org/wiki/Alchemist&quot; rel=&quot;nofollow noreferrer&quot;&gt;Alchemist&lt;/a&gt; - I'd be impressed if someone manages to use it as an actual chemistry tool:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you manage to write a solution in &lt;a href=&quot;https://esolangs.org/wiki/Alchemist&quot; rel=&quot;nofollow noreferrer&quot;&gt;Alchemist&lt;/a&gt; for the question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/178643/number-of-n-carbon-alkanes&quot;&gt;&lt;em&gt;Number of n-carbon alkanes&lt;/em&gt;&lt;/a&gt;, I'll reward you with a bounty of 200 reputation.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;Edit: Changed the language's specs slightly to make integer output easier, proper string literals &amp;amp; a forgotten feature printing whether a computation was deterministic (using &lt;code&gt;-d1&lt;/code&gt;): &lt;a href=&quot;https://tio.run/##S8xJzkjNzSwu@f8/XkHXTsHQoEJBWyG/tCS@ggtMggT9QYz////rphgCAA&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt; &lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="48198" LastEditorUserId="48198" LastEditDate="2019-01-17T15:35:42.373" LastActivityDate="2019-01-17T15:35:42.373" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="17279" PostTypeId="2" ParentId="2140" CreationDate="2019-01-11T13:14:18.143" Score="2" Body="&lt;h1&gt;Is it shifted?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/keyboard&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;keyboard&amp;#39;&quot; rel=&quot;tag&quot;&gt;keyboard&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider a standard US-International QWERTY keyboard, without a numeric keypad, and &lt;kbd&gt;Caps Lock&lt;/kbd&gt; mysteriously missing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&amp;lt; insert image &gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal is to write two programs or functions that take no input, and each give a distinct output through any default output method: &lt;code&gt;Shift&lt;/code&gt; and &lt;code&gt;No shift&lt;/code&gt; respectively. The program that outputs &lt;code&gt;No shift&lt;/code&gt; has to be written without use of the &lt;kbd&gt;⇧ Shift&lt;/kbd&gt; key. The program that outputs &lt;code&gt;Shift&lt;/code&gt; has to be written while holding the &lt;kbd&gt;⇧ Shift&lt;/kbd&gt; key throughout. &lt;strong&gt;Both programs have to be written using the exact same sequence of keypresses&lt;/strong&gt;. A valid entry would be &lt;code&gt;a1b2&lt;/code&gt; + &lt;code&gt;A!B@&lt;/code&gt;, if they output &lt;code&gt;No shift&lt;/code&gt; and &lt;code&gt;Shift&lt;/code&gt; respectively.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The symbols allowed for the &quot;No-shift&quot; program are as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;`1234567890-=&#xA;qwertyuiop[]\&#xA;asdfghjkl;'&#xA;zxcvbnm,./&#xA;&amp;lt;space&amp;gt; &amp;lt;newline&amp;gt; &amp;lt;tab&amp;gt; &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The symbols allowed for the &quot;Shift&quot; program are as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;~!@#$%^&amp;amp;*()_+&#xA;QWERTYUIOP{}|&#xA;ASDFGHJKL:&quot;&#xA;ZXCVBNM&amp;lt;&amp;gt;?&#xA;&amp;lt;space&amp;gt; &amp;lt;newline&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that &lt;kbd&gt;Tab ↹&lt;/kbd&gt; is missing, since &lt;kbd&gt;Shift&lt;/kbd&gt;+&lt;kbd&gt;Tab ↹&lt;/kbd&gt; does not produce a &lt;code&gt;\t&lt;/code&gt; tab symbol in most editors.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sandbox note&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I think using case-sensitive output makes the challenge more challenging, but it might become &lt;em&gt;too&lt;/em&gt; challenging. What are your thoughts?&lt;/p&gt;&#xA;" OwnerUserId="32352" LastActivityDate="2019-01-11T13:14:18.143" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17280" PostTypeId="2" ParentId="2140" CreationDate="2019-01-11T21:25:39.567" Score="1" Body="&lt;h1&gt;My Number is Bigger Than Yours: KoTH&lt;/h1&gt;&#xA;&lt;p&gt;The concept of this game is simple; each turn, two bots submit a positive integer (in Python, so no upper bound on its size). Whichever bot submits a larger number wins a certain number of points based on the scoring put forward in the next section. This process is iterated a certain number (100?) times to form the competition, with the bot which has the highest score winning the competition between the two bots.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;However&lt;/strong&gt;, scoring is based on some metric of the difference between the submitted values such that the larger the difference is, the smaller the amount of score gained is. I'm trying to decide some metric which heavily incentivizes making a guess which narrowly beats your opponent's guess, maybe with a metric such as &lt;code&gt;1/(a-b)**2&lt;/code&gt;. However, as the numbers will likely grow throughout the iterations, maybe &lt;code&gt;1/(a/b)**2&lt;/code&gt; might be better.&lt;/p&gt;&#xA;&lt;p&gt;Example bot whose goal is to beat opponents who pick a constant number:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;def constant_beater(my_score, opp_score, my_numbers, opp_numbers):&#xA;    if len(opp_numbers) == 0:&#xA;        return 1&#xA;    return opp_numbers[-1] + 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The largest concern I see with this challenge is a bot which just increments much quicker than all other bots so that it wins every game with a minuscule amount every time. Maybe to curb this a score that is below a certain threshold for a game is rounded to zero to encourage more competitive choices.&lt;/p&gt;&#xA;" OwnerUserId="59028" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-01-11T21:34:16.973" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="17282" PostTypeId="2" ParentId="2140" CreationDate="2019-01-12T14:08:24.870" Score="0" Body="&lt;h1&gt;Restoration by patching &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/statistics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;statistics&amp;#39;&quot; rel=&quot;tag&quot;&gt;statistics&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a list of signed floating-point numbers and missing values denoted with a consistent value that doesn't represent a signed floating-point number of your language's natural signed float type (e.g. NaN, +∞, -∞, null/undefined/None, char, string, int/long, unsigned float, double, etc. as long as you can separate it from a real signed float), patch the list so that it only contains floats. Here's how you patch the list:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;For each run of missing values:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Take the mean of the value that precedes the run to the value that follows it.&lt;/li&gt;&#xA;&lt;li&gt;Patch the run:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the run has an odd length, replace its middle element with that mean.&lt;/li&gt;&#xA;&lt;li&gt;If the run has an even length, replace its two middle elements with that mean.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;If there still are missing values, go to step 1.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The input denotes data points, and some of them are missing, so you want to patch them. Please note that this method of restoring lost stats isn't recommended for everything.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your solution must not make use of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/41024&quot;&gt;some stuff&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example: &lt;code&gt;[1.0, _, _, _, 5.0, 6.0, 7.0, _, _, _, _, 12.0]&lt;/code&gt;&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&quot;Patch X.Y&quot; represents the Yth patch of the Xth iteration of the method above.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Patch 1.1: &lt;code&gt;[1.0, _, 3.0, _, 5.0, 6.0, 7.0, _, _, _, _, 12.0]&lt;/code&gt;.&lt;br&gt;&#xA;Patch 1.2: &lt;code&gt;[1.0, _, 3.0, _, 5.0, 6.0, 7.0, _, 9.5, 9.5, _, 12.0]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Patch 2.1: &lt;code&gt;[1.0, 2.0, 3.0, _, 5.0, 6.0, 7.0, _, 9.5, 9.5, _, 12.0]&lt;/code&gt;.&lt;br&gt;&#xA;Patch 2.2: &lt;code&gt;[1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, _, 9.5, 9.5, _, 12.0]&lt;/code&gt;.&lt;br&gt;&#xA;Patch 2.3: &lt;code&gt;[1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.25, 9.5, 9.5, _, 12.0]&lt;/code&gt;.&lt;br&gt;&#xA;Patch 2.4: &lt;code&gt;[1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.25, 9.5, 9.5, 10.75, 12.0]&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2019-01-12T14:08:24.870" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17283" PostTypeId="2" ParentId="2140" CreationDate="2019-01-12T20:45:00.637" Score="0" Body="&lt;h1&gt;Shenzhen I/O command encoder/decoder&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The basic elements in Shenzhen I/O are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;P = p0 | p1&#xA;X = x0 | x1 | x2 | x3&#xA;R = acc | dat | P | X | null&#xA;L = 1 | 2 | 3 | ... | 15&#xA;V = R | -999 | -998 | -997 | ... | 998 | 999&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;acc | dat | X&lt;/code&gt; are registers containing number between -999 and 999, and &lt;code&gt;P&lt;/code&gt; between 0 and 100, but you can't know them in advance. &lt;code&gt;null&lt;/code&gt; is register that writing anything into it has no effect, and reading from it provides &lt;code&gt;0&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The command set is: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;nop     nothing&#xA;mov V R R:=V&#xA;jmp L   unreplacable&#xA;slp V   sleep for max{V,0} seconds&#xA;slx X   unreplacable&#xA;add V   acc:=acc+V&#xA;sub V   acc:=acc-V&#xA;mul V   acc:=acc*V&#xA;not     unreplacable&#xA;dgt V   acc:=Tth decimal digit and sign if V in {0,1,2} else 0&#xA;dst V V set V1th decimal digit and sign to lowest digit and sign&#xA;    (negative/non-negative) of V2 if V1 in {0,1,2} else nothing&#xA;teq V V s:=1 if V1=V2 else s:=2&#xA;tgt V V s:=1 if V1&amp;gt;V2 else s:=2&#xA;tlt V V s:=1 if V1&amp;lt;V2 else s:=2&#xA;tcp V V s:=1 if V1&amp;gt;V2; s:=2 if V1&amp;lt;V2; s:=0 otherwise&#xA;gen P V V&#xA;        P:=100, sleep for max{V1,0} seconds,&#xA;        P:=0, sleep for max{V2,0} seconds&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Only &lt;code&gt;mov&lt;/code&gt; can take two same elements in P or X.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now you're to encode each command into two bytes. If two commands do exactly same thing they are replacable, but:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;If element(s) in P and X appear, the existance matters. E.g. &lt;code&gt;mov acc null&lt;/code&gt; = &lt;code&gt;nop&lt;/code&gt;, but &lt;code&gt;dst 8 x1&lt;/code&gt; = &lt;code&gt;mov x1 null&lt;/code&gt; != &lt;code&gt;nop&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If multiple elements are in P and X, the order matters. E.g. &lt;code&gt;teq acc p1&lt;/code&gt; = &lt;code&gt;teq p1 acc&lt;/code&gt;, but &lt;code&gt;teq p1 p0&lt;/code&gt; != &lt;code&gt;teq p0 p1&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Reading from P also writes 0 to P; Writing any negative to P equals to writing 0 to P, and writing number larger than 100 equals to writing one equal to 100. E.g. &lt;code&gt;mov p1 null&lt;/code&gt; = &lt;code&gt;mov 0 p1&lt;/code&gt; = &lt;code&gt;mov -43 p1&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For sleep function we don't need to consider what happen after 1800 seconds. i.e. &lt;code&gt;gen p0 900 901&lt;/code&gt; = &lt;code&gt;gen p0 900 900&lt;/code&gt; != &lt;code&gt;gen p0 900 899&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;You need to write an encoder(turning a command into 21 bits, or to say an integer between 0 and 2^21-1) and a decoder(vise versa). Smallest sum of length of encoder and decoder win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A command checker and equivment finder(two equal commands are mapped to same one) is below: (Spoiler) (WIP)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;alert('WIP');&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;input id=&quot;vin&quot; maxlength=&quot;20&quot; onchange=&quot;foo()&quot; onkeyup=&quot;foo()&quot;&amp;gt;&amp;lt;br&amp;gt;&amp;lt;span id=&quot;vout&quot;&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/encode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;encode&amp;#39;&quot; rel=&quot;tag&quot;&gt;encode&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;P.s. I changed the definition of &lt;code&gt;L&lt;/code&gt; to allow single line command&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2019-01-14T14:48:34.237" LastActivityDate="2019-01-14T14:48:34.237" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="17284" PostTypeId="2" ParentId="2140" CreationDate="2019-01-14T20:19:38.987" Score="2" Body="&lt;h1&gt;Touch-typing distance&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Tags:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Related:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/67474/levenshtein-distance&quot;&gt;Levenshtein distance&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;There are many different &lt;a href=&quot;https://en.wikipedia.org/wiki/String_metric&quot; rel=&quot;nofollow noreferrer&quot;&gt;string metrics&lt;/a&gt;, a simple one is the &lt;a href=&quot;https://en.wikipedia.org/wiki/Levenshtein_distance&quot; rel=&quot;nofollow noreferrer&quot;&gt;Levenshtein distance&lt;/a&gt; given by &lt;span class=&quot;math-container&quot;&gt;\$\texttt{ld}_{a,b}(|a|,|b|)\$&lt;/span&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\texttt{ld}_{a,b}(i,j) = \begin{cases}&#xA;    \max(i,j), &amp;amp; \text{if $i = 0$ or $j = 0$} \\ \\&#xA;    \min \begin{cases}&#xA;        \texttt{ld}_{a,b}(i-1,j) + c_\text{deletion} \\&#xA;        \texttt{ld}_{a,b}(i,j-1) + c_\text{insertion} \\&#xA;        \texttt{ld}_{a,b}(i-1,j-1) + w(a_i, b_j)&#xA;    \end{cases}, &amp;amp; \text{otherwise}&#xA;\end{cases}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The avid reader may have noticed that there are missing pieces in the above definition, it makes use of a weight function &lt;span class=&quot;math-container&quot;&gt;\$w\$&lt;/span&gt; which was never defined and the costs &lt;span class=&quot;math-container&quot;&gt;\$c_\text{deletion}\$&lt;/span&gt; as well as &lt;span class=&quot;math-container&quot;&gt;\$c_\text{insertion}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Levenshtein distance uses an indicator function which evaluates to &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; if the two characters are not equal and &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; otherwise and costs &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; for deletion and insertion. This does not take into account that a mistake of typing &lt;code&gt;u&lt;/code&gt; instead of &lt;code&gt;w&lt;/code&gt; should cost more than mistakenly typing an &lt;code&gt;e&lt;/code&gt;. Let's try to fix this!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For this challenge we'll assume a QWERTY keyboard and only take lower-case letters into account. We will use the usual letter-to-finger assignment (left-most finger to right-most) &lt;code&gt;[&quot;qaz&quot;,&quot;wsx&quot;,&quot;edc&quot;,&quot;rtfgvb&quot;,&quot;yuhjnm&quot;,&quot;ik&quot;,&quot;ol&quot;,&quot;p&quot;]&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Left Hand&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;pinky: &lt;code&gt;qaz&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;ring finger: &lt;code&gt;wsx&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;middle finger: &lt;code&gt;edc&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;index finger: &lt;code&gt;rtfgvb&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Right Hand&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;index finger: &lt;code&gt;yuhjnm&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;middle finger: &lt;code&gt;ik&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;ring finger: &lt;code&gt;ol&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;pinky: &lt;code&gt;p&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Now, to define a new string metric we will use the following definitions in the above generalized Levenshtein distance: Set &lt;span class=&quot;math-container&quot;&gt;\$c_\text{deletion} = c_\text{insertion} = 8\$&lt;/span&gt; and for &lt;span class=&quot;math-container&quot;&gt;\$w(a_i,b_j)\$&lt;/span&gt; we will use the distance of the two characters plus &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; according to the above assignments (unless they are equal, then we'll use &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;). Here are a few examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;'q' 'q' -&amp;gt; 0&#xA;'q' 'a' -&amp;gt; 1&#xA;'q' 'w' -&amp;gt; 2&#xA;'l' 'g' -&amp;gt; 4&#xA;'p' 'a' -&amp;gt; 8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input will be two strings &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; which&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;are non-empty&lt;/li&gt;&#xA;&lt;li&gt;only contain lower-case letters (ie. match &lt;code&gt;^[a-z]+$&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Output will be the &quot;&lt;em&gt;touch-typing distance&lt;/em&gt;&quot; as defined above.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;todo&quot; &quot;todo&quot; → 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="48198" LastActivityDate="2019-01-14T20:19:38.987" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17287" PostTypeId="2" ParentId="5243" CreationDate="2019-01-16T22:49:24.003" Score="6" Body="&lt;h1&gt;500-2000 reputation for a golfy language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This bounty will be awarded to a new golfing language (more precisely, to an answer in that language by its author to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44680/showcase-of-languages&quot;&gt;Showcase of Languages&lt;/a&gt;) that&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bests all pre-2019 languages by 10% or 2 bytes (whichever is greater) in 10 pure &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The 10 challenges must be a subset of 100 consecutively posted challenges from before February 11, 2019.&lt;/li&gt;&#xA;&lt;li&gt;No challenge of the 10 is written by the the language's author.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Is on TIO.run.&lt;/li&gt;&#xA;&lt;li&gt;Has available documentation.&lt;/li&gt;&#xA;&lt;li&gt;Is otherwise sufficiently non-cheaty (at my discretion). Huffman coding is okay; builtins that don't generalize are not.&lt;/li&gt;&#xA;&lt;li&gt;All of the above remain true for 1 week.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The bounty amount doubles for every additional 10% improvement up to a 2000 rep, so a language that improves on all pre-2019 languages by 30% in each of the 10 challenges will be awarded the maximum 2000 rep; a 15% improvement nets 700 rep, and so on.&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="39328" LastEditDate="2019-05-27T05:59:13.230" LastActivityDate="2019-05-27T05:59:13.230" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17289" PostTypeId="2" ParentId="2140" CreationDate="2019-01-17T23:34:05.443" Score="1" Body="&lt;h1&gt;&lt;strong&gt;A Turtle Finds a Portal&lt;/strong&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The turtle wants to move along the grid to get to his food. He wants to know how many moves it will take for him to get there. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;As well since he is slow he has teleporters set up around his domain that he will utilize if it shortens his path. Or avoid them if it lengthens his path.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;em&gt;Meet the turtle&lt;/em&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The turtle lives on a grid&#xA;&lt;span class=&quot;math-container&quot;&gt;$$\begin{matrix}&#xA;X&amp;amp;X&amp;amp;X&amp;amp;X&amp;amp;X\\&#xA;X&amp;amp;X&amp;amp;X&amp;amp;X&amp;amp;X\\&#xA;X&amp;amp;X&amp;amp;&amp;amp;X&amp;amp;X\\&#xA;X&amp;amp;X&amp;amp;X&amp;amp;X&amp;amp;X\\&#xA;X&amp;amp;X&amp;amp;X&amp;amp;X&amp;amp;X\\&#xA;\end{matrix}$$&lt;/span&gt;&#xA;The turtle can move to any adjacent square...&#xA;&lt;span class=&quot;math-container&quot;&gt;$$\begin{matrix}&#xA;X&amp;amp;X&amp;amp;X&amp;amp;X&amp;amp;X\\&#xA;X&amp;amp;\nwarrow&amp;amp;\uparrow&amp;amp;\nearrow&amp;amp;X\\&#xA;X&amp;amp;\leftarrow&amp;amp;&amp;amp;\rightarrow&amp;amp;X\\&#xA;X&amp;amp;\swarrow&amp;amp;\downarrow&amp;amp;\searrow&amp;amp;X\\&#xA;X&amp;amp;X&amp;amp;X&amp;amp;X&amp;amp;X\\&#xA;\end{matrix}$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, the turtle cannot move to a square with a mountain&#xA;&lt;span class=&quot;math-container&quot;&gt;$$\begin{matrix}&#xA;X&amp;amp;&amp;amp;X&amp;amp;X&amp;amp;X\\&#xA;X&amp;amp;\nwarrow&amp;amp;\uparrow&amp;amp;\nearrow&amp;amp;X\\&#xA;X&amp;amp;&amp;amp;&amp;amp;\rightarrow&amp;amp;X\\&#xA;X&amp;amp;&amp;amp;\downarrow&amp;amp;\searrow&amp;amp;X\\&#xA;X&amp;amp;&amp;amp;X&amp;amp;X&amp;amp;X\\&#xA;\end{matrix}$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The turtle wants to eat his straw berry, and would like to know how long it will take to get to his strawberry&#xA;&lt;span class=&quot;math-container&quot;&gt;$$\begin{matrix}&#xA;X&amp;amp;&amp;amp;\\&#xA;&amp;amp;&amp;amp;X\\&#xA;X&amp;amp;&amp;amp;X\\&#xA;X&amp;amp;X&amp;amp;X\\&#xA;\end{matrix}$$&lt;/span&gt;&#xA;This example would take the turtle &lt;span class=&quot;math-container&quot;&gt;\$5\$&lt;/span&gt; turns&#xA;&lt;span class=&quot;math-container&quot;&gt;$$\begin{matrix}&#xA;X&amp;amp;&amp;amp;\\&#xA;\downarrow&amp;amp;&amp;amp;\uparrow\\&#xA;\searrow&amp;amp;&amp;amp;\uparrow\\&#xA;X&amp;amp;\nearrow&amp;amp;X\\&#xA;\end{matrix}$$&lt;/span&gt;&#xA;To get around mountains the turtle uses his teleporter. There are two teleports on the grid that map to each other. Stepping on the teleporter immediately moves the turtle to the corresponding teleporter.&#xA;&lt;span class=&quot;math-container&quot;&gt;$$\begin{matrix}&#xA;&amp;amp;&amp;amp;\\&#xA;&amp;amp;&amp;amp;\\&#xA;X&amp;amp;&amp;amp;X\\&#xA;X&amp;amp;X&amp;amp;X\\&#xA;\end{matrix}$$&lt;/span&gt;&#xA;It is now faster for the turtle to move up twice. Now the turtles shortest path is &lt;span class=&quot;math-container&quot;&gt;\$2\$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$\begin{matrix}&#xA;&amp;amp;&amp;amp;\\&#xA;\uparrow&amp;amp;&amp;amp;\uparrow\\&#xA;X&amp;amp;&amp;amp;X\\&#xA;X&amp;amp;X&amp;amp;X\\&#xA;\end{matrix}$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an initial grid configuration output the number of moves it will take the turtle to reach his strawberry.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You may assume that the input grid has a solution&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The input grid may be entered in any convenient format&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The shortest path does not need to make use of the portal&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The turtle cannot pass into mountain tiles&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The turn that the turtle moves onto a teleporter square he is already on the corresponding teleporter. He never moves onto a teleporter and stays there for a move&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may use any ASCII character to represent &lt;code&gt;mountains&lt;/code&gt;, &lt;code&gt;turtle&lt;/code&gt;, &lt;code&gt;empty gird square&lt;/code&gt;, &lt;code&gt;strawberry&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may use either the same character or two different characters to represent the &lt;code&gt;teleporter&lt;/code&gt; pairs&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A grid can have more than one path with the same shortest path length&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each grid will only have one strawberry and two portals&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases formatted as lists&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[ ['T', 'X', 'X', 'S', 'X'], ['X', 'X', 'X', 'X', 'X'], ['X', 'X', 'X', 'X', 'X'] ] --&amp;gt; 3&#xA;[ ['T', 'M', 'X', 'S', 'X'], ['X', 'M', 'X', 'X', 'X'], ['X', 'X', 'X', 'X', 'X'] ] --&amp;gt; 4&#xA;[ ['T', 'M', 'X', 'S', 'O'], ['O', 'M', 'X', 'X', 'X'], ['X', 'X', 'X', 'X', 'X'] ] --&amp;gt; 2&#xA;[ ['T', 'M', 'X', 'S', 'X'], ['O', 'M', 'X', 'X', 'X'], ['O', 'X', 'X', 'X', 'X'] ] --&amp;gt; 4&#xA;[ ['T', 'M', 'S', 'X', 'O'], ['X', 'M', 'M', 'M', 'M'], ['X', 'X', 'X', 'X', 'O'] ] --&amp;gt; 7&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Test Cases formatted for humans&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;T X X S X&#xA;X X X X X&#xA;X X X X X --&amp;gt; 3&#xA;&#xA;T M X S X&#xA;X M X X X&#xA;O X X X O --&amp;gt; 4&#xA;&#xA;T M X S O&#xA;O M X X X&#xA;X X X X X --&amp;gt; 2&#xA;&#xA;T M X S X&#xA;O M X X X&#xA;O X X X X --&amp;gt; 4&#xA;&#xA;T M S X O&#xA;X M M M M&#xA;X X X X O --&amp;gt; 7&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Credits&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Design and structure via: &lt;a href=&quot;https://codegolf.stackexchange.com/q/176251/79844&quot;&gt;&lt;em&gt;Hungry mouse by Arnauld&lt;/em&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Proposed Challenges Edit Advice: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/71434/kamil-drakari&quot;&gt;&lt;em&gt;Kamil-drakari&lt;/em&gt;&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/45613/beefster&quot;&gt;&lt;em&gt;beefster&lt;/em&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="79844" LastEditorUserId="79844" LastEditDate="2019-02-03T17:01:18.573" LastActivityDate="2019-02-03T17:01:18.573" CommentCount="16" ContentLicense="CC BY-SA 4.0" />
  <row Id="17290" PostTypeId="2" ParentId="2140" CreationDate="2019-01-18T13:36:03.257" Score="1" Body="&lt;h1&gt;Drawing &lt;span class=&quot;math-container&quot;&gt;\$K_n\$&lt;/span&gt; (complete graph with &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; vertices)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Tags:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graph-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graph-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;graph-theory&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;In graph theory the complete graph with &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; vertices, often written as &lt;span class=&quot;math-container&quot;&gt;\$K_n\$&lt;/span&gt;, is the graph where every vertex is connected to every other vertex. For example, &lt;span class=&quot;math-container&quot;&gt;\$K_3\$&lt;/span&gt; with &lt;span class=&quot;math-container&quot;&gt;\$V = \{A,B,C\}\$&lt;/span&gt; has the edges &lt;span class=&quot;math-container&quot;&gt;\$\bigr\{\{A,B\},\{B,C\},\{C,A\}\bigl\}\$&lt;/span&gt; - forming a triangle.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an &lt;strong&gt;even&lt;/strong&gt; &lt;span class=&quot;math-container&quot;&gt;\$n \geq 4\$&lt;/span&gt; you will generate/display an image of the graph &lt;span class=&quot;math-container&quot;&gt;\$K_n\$&lt;/span&gt; as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;pick an image width &lt;span class=&quot;math-container&quot;&gt;\$\texttt{width} \geq 100\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;pick two distinct colors &lt;span class=&quot;math-container&quot;&gt;\$\texttt{vertex_color}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\texttt{edge_color}\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;draw &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; vertex with color &lt;span class=&quot;math-container&quot;&gt;\$\texttt{vertex_color}\$&lt;/span&gt; in the middle of the image&lt;/li&gt;&#xA;&lt;li&gt;draw the remaining &lt;span class=&quot;math-container&quot;&gt;\$n-1\$&lt;/span&gt; vertices evenly distributed on a circle around it&lt;/li&gt;&#xA;&lt;li&gt;connect every vertex with color &lt;span class=&quot;math-container&quot;&gt;\$\texttt{edge_color}\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the background color doesn't matter (transparent is fine), but it must not coincide with the colors &lt;span class=&quot;math-container&quot;&gt;\$\texttt{vertex_color}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\texttt{edge_color}\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;the radius of the circle should be &lt;span class=&quot;math-container&quot;&gt;\$\texttt{width/4}\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;the center of the circle should the middle of the image&lt;/li&gt;&#xA;&lt;li&gt;the shape of the vertices doesn't matter, but they must be at least &lt;span class=&quot;math-container&quot;&gt;\$3\$&lt;/span&gt; pixels wide&lt;/li&gt;&#xA;&lt;li&gt;the edges must not overlap the vertices&lt;/li&gt;&#xA;&lt;li&gt;the edges may be dashed, dotted etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Example output for &lt;span class=&quot;math-container&quot;&gt;\$K_4\$&lt;/span&gt;:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/D6ZoW.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/D6ZoW.png&quot; alt=&quot;K_4&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example output for &lt;span class=&quot;math-container&quot;&gt;\$K_{12}\$&lt;/span&gt;:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/L1sGS.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/L1sGS.png&quot; alt=&quot;K_12&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example output for &lt;span class=&quot;math-container&quot;&gt;\$K_{32}\$&lt;/span&gt;:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/yzHdD.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/yzHdD.png&quot; alt=&quot;K_32&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="48198" LastEditorUserId="48198" LastEditDate="2019-01-18T16:46:40.587" LastActivityDate="2019-01-18T16:46:40.587" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17291" PostTypeId="2" ParentId="2140" CreationDate="2019-01-19T07:16:27.370" Score="-2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/178970/no-alphanumeric-code-exec&quot;&gt;No-alphanumeric code exec&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="62716" LastEditorUserId="62716" LastEditDate="2019-01-21T23:02:07.193" LastActivityDate="2019-01-21T23:02:07.193" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17292" PostTypeId="2" ParentId="2140" CreationDate="2019-01-19T20:26:15.877" Score="0" Body="&lt;h2&gt;Write a negadecimal number in words.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Negadecimal&quot; rel=&quot;nofollow noreferrer&quot;&gt;Negadecimal&lt;/a&gt; is a numeral system with digits &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$9\$&lt;/span&gt; but is base &lt;span class=&quot;math-container&quot;&gt;\$-10\$&lt;/span&gt; instead of &lt;span class=&quot;math-container&quot;&gt;\$10\$&lt;/span&gt;. Here are some examples (the left side is decimal numeral, and the right side is a negadecimal numeral):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{array}{rcrl}&#xA;    0 &amp;amp; \to &amp;amp;   0 &amp;amp; \\&#xA;    1 &amp;amp; \to &amp;amp;   1 &amp;amp; \\&#xA;    9 &amp;amp; \to &amp;amp;   9 &amp;amp; \\&#xA;   10 &amp;amp; \to &amp;amp; 190 &amp;amp;  \bigl(1 \cdot 100 + 9 \cdot (-10) + 0 \cdot 1 \bigr) \\&#xA;   11 &amp;amp; \to &amp;amp; 191 &amp;amp; \\&#xA;   20 &amp;amp; \to &amp;amp; 180 &amp;amp; \\&#xA;   99 &amp;amp; \to &amp;amp; 119 &amp;amp; \\&#xA;  100 &amp;amp; \to &amp;amp; 100 &amp;amp; \\&#xA;   -1 &amp;amp; \to &amp;amp;  19 &amp;amp; \\&#xA;   -9 &amp;amp; \to &amp;amp;  11 &amp;amp; \\&#xA;  -10 &amp;amp; \to &amp;amp;  10 &amp;amp; \\&#xA;  -11 &amp;amp; \to &amp;amp;  29 &amp;amp;  \bigl(2 \cdot (-10) + 9 \cdot 1 \bigr)&#xA;\end{array}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Basically, the carry rule (for both addition and subtraction) is that if you add one to nine, it wraps around to zero and you &lt;em&gt;subtract&lt;/em&gt; one from the digit to the left, and if you subtract one from zero, it wraps around to nine, and you &lt;em&gt;add&lt;/em&gt; one to the digit to the left. Also note that you can add or remove leading zeros from a number without changing its value. (In particular, the empty string represents the &lt;a href=&quot;https://en.wikipedia.org/wiki/Empty_sum&quot; rel=&quot;nofollow noreferrer&quot;&gt;empty sum&lt;/a&gt;, i.e. zero.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Anyways, for the actual challenge, &lt;strong&gt;you will take an integer as input and convert it to negadecimal. Then you will convert that to &lt;em&gt;words&lt;/em&gt;.&lt;/strong&gt; What do I mean by that?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The digits &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$9\$&lt;/span&gt; have their regulars names (i.e. &lt;code&gt;zero&lt;/code&gt;, &lt;code&gt;one&lt;/code&gt;, ..., &lt;code&gt;nine&lt;/code&gt;).&#xA;The negadecimal numbers &lt;span class=&quot;math-container&quot;&gt;\$10\$&lt;/span&gt; through &lt;span class=&quot;math-container&quot;&gt;\$90\$&lt;/span&gt; (i.e. negative ten through negative ninety) have the following names:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;onetao, twotao, threetao, fourtao, fivetao, sixtao, seventao, eighttao, ninetao&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The negadecimal numbers &lt;span class=&quot;math-container&quot;&gt;\$100\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$900\$&lt;/span&gt; have their regular names (i.e. &lt;code&gt;one hundred&lt;/code&gt;, &lt;code&gt;two hundred&lt;/code&gt;, ..., &lt;code&gt;nine hundred&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Numbers that are a digit followed by three or more zeros are created by combining the above names. For example, negadecimal &lt;span class=&quot;math-container&quot;&gt;\$2000\$&lt;/span&gt; is &lt;code&gt;twotao hundred&lt;/code&gt;, &lt;span class=&quot;math-container&quot;&gt;\$40000\$&lt;/span&gt; is &lt;code&gt;four hundred hundred&lt;/code&gt;, &lt;span class=&quot;math-container&quot;&gt;\$300000\$&lt;/span&gt; is &lt;code&gt;threetao hundred hundred&lt;/code&gt;, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All other numbers are named by writing it in expanded notation, naming each summand (which will be one of the above), and conjuncting them. For example, negadecimal &lt;span class=&quot;math-container&quot;&gt;\$5402=5000 + 400 + 0 + 2\$&lt;/span&gt; is &lt;code&gt;fivetao hundred, four hundred, and two.&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Zero summands are a special case. If the whole number is zero, you just write &lt;code&gt;zero&lt;/code&gt;. Otherwise, you omit all zero summands.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here are some examples (the left side is a decimal numeral, and the right side is a negadecimal numeral noun):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 → &quot;zero&quot;&#xA;10 → &quot;one hundred and ninetao&quot;&#xA;11 → &quot;one hundred, ninetao, and one&quot;&#xA;-11 → &quot;twotao and nine&quot;&#xA;-10 → &quot;onetao&quot;&#xA;-9 → &quot;onetao and one&quot;&#xA;101 → &quot;one hundred and one&quot;&#xA;999999997 → &quot;ninetao hundred hundred hundred hundred, nine hundred hundred hundred hundred, ninetao hundred hundred hundred, nine hundred hundred hundred, ninetao hundred hundred, nine hundred hundred, ninetao hundred, nine hundred, ninetao, and seven.&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt;, so the shortest code wins!&lt;/p&gt;&#xA;" OwnerUserId="16842" LastEditorUserId="48198" LastEditDate="2019-01-21T19:28:57.787" LastActivityDate="2019-01-21T19:28:57.787" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17294" PostTypeId="2" ParentId="2140" CreationDate="2019-01-19T21:13:48.140" Score="3" Body="&lt;h2&gt;Static Code Analysis Battle!&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your programs will play a friendly game of rock, paper, scissors. There's a catch though; you can not use randomness and the combatants can see each other's source code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That is, you will write a python program that, when imported, provides a function named &lt;code&gt;rps&lt;/code&gt;. Given two combatants, say &lt;code&gt;player1.py&lt;/code&gt; and &lt;code&gt;player2.py&lt;/code&gt;, the controller will import them, and execute &lt;code&gt;player1.rps(player2sourceCode)&lt;/code&gt; and &lt;code&gt;player2.rps(player1sourceCode)&lt;/code&gt;. These should output &lt;code&gt;R&lt;/code&gt;, &lt;code&gt;P&lt;/code&gt;, or &lt;code&gt;S&lt;/code&gt;. The winner is then whoever would win in rock paper scissors with those moves. If one player makes a valid move, and the other does not, that player wins. If both players make an invalid move, it is considered tie. Additionally, taking more than 1 second to move is considered an invalid move.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are the rules:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Both the action of importing your module and your rps function should be &lt;a href=&quot;https://en.wikipedia.org/wiki/Pure_function&quot; rel=&quot;nofollow noreferrer&quot;&gt;pure functions&lt;/a&gt;. This means for example that you can not do the following:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Use randomness or other non-deterministic code.&lt;/li&gt;&#xA;&lt;li&gt;Interfere with or receive information from the file system, I/O, peripherals, etc...&lt;/li&gt;&#xA;&lt;li&gt;Use &lt;code&gt;time.sleep&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Alter or access the state of the controller.&lt;/li&gt;&#xA;&lt;li&gt;Use other functions to do impure actions. For example, you can not call &lt;code&gt;eval&lt;/code&gt; on the source code of an impure function call. An exception to this is if the only impure thing it does is interact with your program's state (i.e. it is permitted to change variables in your program's namespace). You can, however, call it on pure function call source code.&lt;/li&gt;&#xA;&lt;li&gt;Anything else that a pure function could not do.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;Other functions in your source code, however, may be impure.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that the source code passed as an argument to &lt;code&gt;rps&lt;/code&gt; obeys rule 1. You may not, however, assume that the &lt;code&gt;rps&lt;/code&gt; in the passed source code is a pure function when you pass &lt;em&gt;it&lt;/em&gt; source code that does not obey rule 1. Additionally, other functions in the module may be impure.&lt;/li&gt;&#xA;&lt;li&gt;Additionally, going into an infinite loop is perfectly fine, although if it happens when the caller calls your program, your move will be considered invalid. If the opponent calls your program and it causes &lt;em&gt;them&lt;/em&gt; to go into an infinite loop, however, their move will be considered invalid, and vice versa.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/koth&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;koth&amp;#39;&quot; rel=&quot;tag&quot;&gt;koth&lt;/a&gt;, so the program that defeats the other programs wins! In particular, I will run a match between each program and each other program. The winner will be the &lt;a href=&quot;https://en.wikipedia.org/wiki/Condorcet_winner&quot; rel=&quot;nofollow noreferrer&quot;&gt;condorcet winner&lt;/a&gt; if one exists. Otherwise, the result will be a tie between the &lt;a href=&quot;https://en.wikipedia.org/wiki/Schwartz_set&quot; rel=&quot;nofollow noreferrer&quot;&gt;Schwartz set&lt;/a&gt; members.&lt;/p&gt;&#xA;" OwnerUserId="16842" LastActivityDate="2019-01-19T21:13:48.140" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17297" PostTypeId="2" ParentId="2140" CreationDate="2019-01-22T03:58:56.170" Score="-2" Body="&lt;h1&gt;HTML-tac-toe&lt;/h1&gt;&#xA;&lt;p&gt;Build a one-player &lt;a href=&quot;https://en.wikipedia.org/wiki/Tic-tac-toe&quot; rel=&quot;nofollow noreferrer&quot;&gt;tic-tac-toe&lt;/a&gt; game with only HTML and CSS.&lt;/p&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;You can do just about anything with a fully-featured programming language, but how much can you accomplish on a Neopets petpage? Inspired by &lt;a href=&quot;http://www.neopets.com/%7Evuh&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.neopets.com/~vuh&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Build a one-player tic-tac-toe game with only HTML and CSS.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use no more than one file.&lt;/li&gt;&#xA;&lt;li&gt;GIFs (including animations), PNGs, and JPEGs are allowed.&lt;/li&gt;&#xA;&lt;li&gt;Flash, embedded scripts, iframes, and JavaScript are not allowed.&lt;/li&gt;&#xA;&lt;li&gt;It must work in the at least two standard browsers (FF, Chrome, Safari, Opera, IE)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Inputs:&#xA;The player will click on a space when it's their turn to move there.&lt;/p&gt;&#xA;&lt;p&gt;Outputs:&#xA;The page will show the current board state at all times.&#xA;The page will play an optimal move whenever the player moves, unless the game is over.&lt;/p&gt;&#xA;&lt;p&gt;You're free to decide who starts and who has X or O.&lt;/p&gt;&#xA;&lt;h1&gt;Scores&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;-10 per image&lt;/li&gt;&#xA;&lt;li&gt;-1 per opening bracket or brace (&lt;code&gt;&amp;lt;&lt;/code&gt; / &lt;code&gt;{&lt;/code&gt; )&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Brownie points for design, flair, and new tricks!&lt;/p&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Click on the top left of an empty grid&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Grid shows my mark where I clicked and the opposite mark in the left middle or top middle.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="85079" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-01-25T22:54:32.383" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="17299" PostTypeId="2" ParentId="2140" CreationDate="2019-01-22T14:14:23.560" Score="1" Body="&lt;h1&gt;Chain round the number!&lt;/h1&gt;&#xA;&lt;p&gt;A decimal place is a digit of a number's location in a number. In the number &lt;code&gt;987654321&lt;/code&gt;, each digit corresponds to its decimal place. For example, in the number &lt;code&gt;16111&lt;/code&gt;, the &lt;code&gt;6&lt;/code&gt; is in the 4th decimal place.&lt;/p&gt;&#xA;&lt;p&gt;Normally when rounding to &lt;code&gt;n&lt;/code&gt; decimal places, one checks the digit at &lt;code&gt;n-1&lt;/code&gt; (heretofore called &lt;code&gt;x&lt;/code&gt;). If &lt;code&gt;x &amp;gt;= 5&lt;/code&gt;, then the digit at &lt;code&gt;n&lt;/code&gt; is rounded up. Otherwise the digit at &lt;code&gt;n&lt;/code&gt; is rounded down (stays the same). Then, all digits including and after &lt;code&gt;x&lt;/code&gt; are turned into 0.&lt;/p&gt;&#xA;&lt;p&gt;For example, take the number &lt;code&gt;158&lt;/code&gt;, rounded to the 3rd decimal place. The digit at the 2nd decimal place (3rd decimal place minus one) is 5. Because of this, the &lt;code&gt;1&lt;/code&gt; at the third decimal place gets rounded up. This results in the number being &lt;code&gt;258&lt;/code&gt;. However, the &lt;code&gt;5&lt;/code&gt; and the &lt;code&gt;8&lt;/code&gt; both get turned into &lt;code&gt;0&lt;/code&gt;, and so the final result is &lt;code&gt;200&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Chain rounding is like normal rounding, except that you do it to every digit starting with the digit at decimal place 2. Once you round to the decimal place 2, then you round to decimal place 3, and so on until decimal place n.&lt;/p&gt;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input: 24472&#xA;24472    (2 &amp;lt; 5, so the 7 rounds down)&#xA;24470    (7 &amp;gt;= 5, so the 4 rounds up)&#xA;24500    (5 &amp;gt;= 5, so the 4 rounds up)&#xA;25000    (5 &amp;gt;= 5, so the 2 rounds up)&#xA;30000    (Final answer. Non chain-rounded answer would be 20000)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The challenge here is to chain round a number to the highest decimal place possible for that number.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test cases:&lt;/strong&gt; (all inputs will be positive whole numbers)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;24472 -&amp;gt; 30000&#xA;1999 -&amp;gt; 2000    (&amp;quot;1 9 9 9&amp;quot; -&amp;gt; &amp;quot;1 9 10 0&amp;quot; -&amp;gt; &amp;quot;1 10 0 0&amp;quot; -&amp;gt; &amp;quot;2 0 0 0&amp;quot;)&#xA;9945 -&amp;gt; 10000&#xA;2001 -&amp;gt; 2000&#xA;9444 -&amp;gt; 9000&#xA;9445 -&amp;gt; 10000&#xA;13579 -&amp;gt; 10000&#xA;24681 -&amp;gt; 30000&#xA;1337 -&amp;gt; 1000&#xA;5 -&amp;gt; 10&#xA;1 -&amp;gt; 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="64159" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-01-23T20:43:26.353" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17301" PostTypeId="2" ParentId="16151" CreationDate="2019-01-22T21:54:58.837" Score="3" Body="&lt;p&gt;I wanted to update everyone on what I've been working on because I've seen many discussions, proposals, and improvised solutions about how the Community Team might allocate various &quot;graduation&quot; features with or without a custom design (e.g. increased reputation threshold, elections, migrations, etc). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;There hasn't really been a comprehensive solution regarding how this would work sustainably juggling ~173 sites, much less deciding which sites would be eligible and when/how it would get implemented. So efforts to handle each request one site at a time has been caught up in indecision, confusion, and back logs&amp;hellip; which does not work. This request is almost nine months old, arg.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm taking a different approach.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've taken it upon myself to write up a comprehensive (i.e. sane &amp;lt;grin&gt;) entire-site life cycle workflow which would &lt;em&gt;include&lt;/em&gt; breaking apart everything once bundled up under &quot;graduation&quot;, and enabling each feature as soon as a site can support it. It's roughly based on the premise I outlined here &amp;mdash; &lt;a href=&quot;https://meta.stackexchange.com/a/257747/98786&quot;&gt;But what happened to Graduation?&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's hard to say yet how well it will be received in its first draft. Completion and full implementation would likely be at least a few months out, but I suspect this has a much better chance of getting your community what it needs rather than waiting for action on this aging, one-off request. &lt;/p&gt;&#xA;" OwnerUserId="139" LastActivityDate="2019-01-22T21:54:58.837" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17302" PostTypeId="1" CreationDate="2019-01-23T12:07:06.617" Score="16" ViewCount="843" Body="&lt;p&gt;2019 is here! And with the new year, as usual, comes a new iteration of &lt;strong&gt;Community Promotion Ads&lt;/strong&gt;! Let’s refresh these for the coming year :)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;What are Community Promotion Ads?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Community Promotion Ads are community-vetted advertisements that will show up on the main site, in the right sidebar. The purpose of this question is the vetting process. Images of the advertisements are provided, and community voting will enable the advertisements to be shown.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Why do we have Community Promotion Ads?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is a method for the community to control what gets promoted to visitors on the site. For example, you might promote the following things:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the site's twitter account&lt;/li&gt;&#xA;&lt;li&gt;code puzzle blogs and websites&lt;/li&gt;&#xA;&lt;li&gt;interesting challenge sites&lt;/li&gt;&#xA;&lt;li&gt;cool events or conferences&lt;/li&gt;&#xA;&lt;li&gt;anything else your community would genuinely be interested in&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The goal is for future visitors to find out about &lt;em&gt;the stuff your community deems important&lt;/em&gt;. This also serves as a way to promote information and resources that are &lt;em&gt;relevant to your own community's interests&lt;/em&gt;, both for those already in the community and those yet to join. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Why do we reset the ads every year?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Some services will maintain usefulness over the years, while other things will wane to allow for new faces to show up. Resetting the ads every year helps accommodate this, and allows old ads that have served their purpose to be cycled out for fresher ads for newer things. This helps keep the material in the ads relevant to not just the subject matter of the community, but to the current status of the community. We reset the ads once a year, every December.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The community promotion ads have no restrictions against reposting an ad from a previous cycle. If a particular service or ad is very valuable to the community and will continue to be so, it is a good idea to repost it. It may be helpful to give it a new face in the process, so as to prevent the imagery of the ad from getting stale after a year of exposure.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;How does it work?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The answers you post to this question &lt;em&gt;must&lt;/em&gt; conform to the following rules, or they will be ignored. &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;All answers should be in the exact form of:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[![Tagline to show on mouseover][1]][2]&#xA;&#xA;   [1]: http://image-url&#xA;   [2]: http://clickthrough-url &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Please &lt;strong&gt;do not add anything else to the body of the post&lt;/strong&gt;. If you want to discuss something, do it in the comments.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The question must always be tagged with the magic &lt;a href=&quot;/questions/tagged/community-ads&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;community-ads&amp;#39;&quot; rel=&quot;tag&quot;&gt;community-ads&lt;/a&gt; tag. In addition to enabling the functionality of the advertisements, this tag also pre-fills the answer form with the above required form.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h3&gt;Image requirements&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The image that you create must be 300 x 250 pixels, or double that if high DPI.&lt;/li&gt;&#xA;&lt;li&gt;Must be hosted through our standard image uploader (imgur)&lt;/li&gt;&#xA;&lt;li&gt;Must be GIF or PNG&lt;/li&gt;&#xA;&lt;li&gt;No animated GIFs&lt;/li&gt;&#xA;&lt;li&gt;Absolute limit on file size of 150 KB&lt;/li&gt;&#xA;&lt;li&gt;If the background of the image is white or partially white, there must be a 1px border (2px if high DPI) surrounding it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Score Threshold&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;There is a &lt;strong&gt;minimum score threshold&lt;/strong&gt; an answer must meet (currently &lt;strong&gt;6&lt;/strong&gt;) before it will be shown on the main site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can check out the ads that have met the threshold with basic click stats &lt;a href=&quot;https://codegolf.meta.stackexchange.com/ads/display/17302&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="38734" LastActivityDate="2020-05-04T13:51:22.900" Title="Community Promotion Ads — 2019" Tags="|discussion|community-ads|" AnswerCount="10" CommentCount="0" ClosedDate="2020-03-05T11:09:04.513" ContentLicense="CC BY-SA 4.0" />
  <row Id="17303" PostTypeId="2" ParentId="17302" CreationDate="2019-01-23T12:07:27.383" Score="-10" Body="&lt;p&gt;&lt;a href=&quot;https://twitter.com/StackCodeGolf&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZJKMH.png&quot; alt=&quot;Help this community grow -- follow us on twitter!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="38734" LastActivityDate="2019-01-23T12:07:27.383" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17304" PostTypeId="2" ParentId="17302" CreationDate="2019-01-23T12:46:48.853" Score="5" Body="&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/57815/jelly-hypertraining&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/zIFyO.png&quot; alt=&quot;Want to improve your Jelly skills? – Join Jelly HyperTraining!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2019-01-23T12:46:48.853" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17305" PostTypeId="2" ParentId="17302" CreationDate="2019-01-23T12:49:01.570" Score="8" Body="&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/52405/the-apl-orchard&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/VAV4a.png&quot; alt=&quot;J and K are on topic too!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2019-01-23T12:49:01.570" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17306" PostTypeId="2" ParentId="17302" CreationDate="2019-01-23T12:50:16.307" Score="17" Body="&lt;p&gt;&lt;a href=&quot;https://github.com/abrudz/lb/blob/master/README.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/PT2I9.png&quot; alt=&quot;Bookmarklet — no install needed!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2019-01-23T12:50:16.307" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17307" PostTypeId="2" ParentId="17302" CreationDate="2019-01-23T12:51:27.280" Score="10" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions?sort=featured&quot;&gt;&lt;img src=&quot;https://stack-exchange-dynamic-ads.herokuapp.com/codegolf.stackexchange.com/bounty.png&quot; alt=&quot;Bounties for everybody&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2019-01-23T12:51:27.280" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17308" PostTypeId="2" ParentId="17302" CreationDate="2019-01-23T12:51:32.373" Score="20" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10132/32352&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Vdi3R.png&quot; alt=&quot;Know how to vote!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2019-01-23T12:51:32.373" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17309" PostTypeId="2" ParentId="17302" CreationDate="2019-01-23T12:57:46.360" Score="35" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/40695&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/n3xsb.png&quot; alt=&quot;Have a challenge idea? Iron out its bugs. Join us in the Sandbox!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2019-01-23T12:57:46.360" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17310" PostTypeId="2" ParentId="17302" CreationDate="2019-01-23T13:07:05.420" Score="43" Body="&lt;p&gt;&lt;a href=&quot;https://tio.run/#home&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/J99n9.png&quot; alt=&quot;Over 600 online interpreters. Free of charge, open source, and ad-free.&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2019-01-23T15:23:35.413" LastActivityDate="2019-01-23T15:23:35.413" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17312" PostTypeId="2" ParentId="2140" CreationDate="2019-01-24T11:35:01.983" Score="2" Body="&lt;h1&gt;Irregular English Verbs&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/text-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;text-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;text-processing&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; rel=&quot;tag&quot;&gt;compression&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given the infinitive of an irregular English verb, output its &lt;strong&gt;simple past&lt;/strong&gt; and its &lt;strong&gt;past participle&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input and output can be given &lt;a href=&quot;http://meta.codegolf.stackexchange.com/q/2447/42963&quot;&gt;in any convenient format&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;No need to handle verbs not in the given list.&lt;/li&gt;&#xA;&lt;li&gt;Either a full program or a function are acceptable. If a function, you can return the output rather than printing it.&lt;/li&gt;&#xA;&lt;li&gt;If possible, please include a link to an online testing environment so other people can try out your code!&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://meta.codegolf.stackexchange.com/q/1061/42963&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so all usual golfing rules apply, and the shortest code (in bytes) wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;fall    --&amp;gt; fell; fallen&#xA;beat    --&amp;gt; beat; beaten or beat&#xA;bereave --&amp;gt; bereaved or bereft; bereaved or bereft&#xA;shall   --&amp;gt; should;(no participle)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;List of Irregular Verbs&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Infinitive;Simple Past;Past Participle&#xA;alight;alighted or alit;alighted or alit&#xA;arise;arose;arisen&#xA;awake;awoke or awaked;awoken or awaked&#xA;be;was or were;been&#xA;bear;bore;borne or born&#xA;beat;beat;beaten or beat&#xA;become;became;become&#xA;beget;begot;begotten&#xA;begin;began;begun&#xA;bend;bent;bent&#xA;bereave;bereaved or bereft;bereaved or bereft&#xA;beseech;besought or beseeched;besought or beseeched&#xA;bet;bet or betted;bet or betted&#xA;bid;bade or bid;bidden or bid or bade&#xA;bide;bade or bided;bided&#xA;bind;bound;bound&#xA;bite;bit;bitten&#xA;bleed;bled;bled&#xA;bless;blessed or blest;blessed or blest&#xA;blow;blew;blown&#xA;break;broke;broken&#xA;breed;bred;bred&#xA;bring;brought;brought&#xA;broadcast;broadcast or broadcasted;broadcast or broadcasted&#xA;build;built;built&#xA;burn;burnt or burned;burnt or burned&#xA;burst;burst;burst&#xA;bust;bust or busted;bust or busted&#xA;buy;bought;bought&#xA;can;could;(no participle)&#xA;cast;cast;cast&#xA;catch;caught;caught&#xA;choose;chose;chosen&#xA;cleave;cleft or cleaved or clove;cleft or cleaved or cloven&#xA;cling;clung;clung&#xA;clothe;clothed or clad;clothed or clad&#xA;come;came;come&#xA;cost;cost;cost&#xA;creep;crept;crept&#xA;crow;crowed;crew or crowed&#xA;cut;cut;cut&#xA;deal;dealt;dealt&#xA;dig;dug;dug&#xA;do;did;done&#xA;draw;drew;drawn&#xA;dream;dreamt or dreamed;dreamt or dreamed&#xA;drink;drank;drunk&#xA;drive;drove;driven&#xA;dwell;dwelt or dwelled;dwelt or dwelled&#xA;eat;ate;eaten&#xA;fall;fell;fallen&#xA;feed;fed;fed&#xA;feel;felt;felt&#xA;fight;fought;fought&#xA;find;found;found&#xA;flee;fled;fled&#xA;fling;flung;flung&#xA;fly;flew;flown&#xA;forbid;forbad or forbade;forbid or forbidden&#xA;forecast;forecast or forecasted;forecast or forecasted&#xA;forget;forgot;forgotten&#xA;forsake;forsook;forsaken&#xA;freeze;froze;frozen&#xA;geld;gelded or gelt;gelded or gelt&#xA;get;got;got or gotten&#xA;gild;gilded or gilt;gilded or gilt&#xA;give;gave;given&#xA;gnaw;gnawed;gnawed or gnawn&#xA;go;went;gone&#xA;grind;ground;ground&#xA;grip;gripped or gript;gripped or gript&#xA;grow;grew;grown&#xA;hang;hung;hung&#xA;have;had;had&#xA;hear;heard;heard&#xA;heave;heaved or hove;heaved or hove&#xA;hew;hewed;hewed or hewn&#xA;hide;hid;hidden or hid&#xA;hit;hit;hit&#xA;hold;held;held&#xA;hurt;hurt;hurt&#xA;keep;kept;kept&#xA;kneel;knelt or kneeled;knelt or kneeled&#xA;knit;knitted or knit;knitted or knit&#xA;know;knew;known&#xA;lay;laid;laid&#xA;lead;led;led&#xA;lean;leant or leaned;leant or leaned&#xA;leap;leapt or leaped;leapt or leaped&#xA;learn;learnt or learned;learnt or learned&#xA;leave;left;left&#xA;lend;lent;lent&#xA;let;let;let&#xA;lie;lay;lain&#xA;light;lit or lighted;lit or lighted&#xA;lose;lost;lost&#xA;make;made;made&#xA;may;might;(no participle)&#xA;mean;meant;meant&#xA;meet;met;met&#xA;melt;melted;molten or melted&#xA;mow;mowed;mown or mowed&#xA;pay;paid;paid&#xA;pen;pent or penned;pent or penned&#xA;plead;pled or pleaded;pled or pleaded&#xA;prove;proved;proven or proved&#xA;put;put;put&#xA;quit;quit or quitted;quit or quitted&#xA;read;read;read&#xA;rid;rid or ridded;rid or ridded&#xA;ride;rode;ridden&#xA;ring;rang;rung&#xA;rise;rose;risen&#xA;run;ran;run&#xA;saw;sawed;sawn or sawed&#xA;say;said;said&#xA;see;saw;seen&#xA;seek;sought;sought&#xA;sell;sold;sold&#xA;send;sent;sent&#xA;set;set;set&#xA;sew;sewed;sewn or sewed&#xA;shake;shook;shaken&#xA;shall;should;(no participle)&#xA;shear;sheared;shorn or sheared&#xA;shed;shed;shed&#xA;shine;shone;shone&#xA;shit;shit or shitted or shat;shit or shitted or shat&#xA;shoe;shod or shoed;shod or shoed&#xA;shoot;shot;shot&#xA;show;showed;shown or showed&#xA;shred;shred or shredded;shred or shredded&#xA;shrink;shrank or shrunk;shrunk&#xA;shut;shut;shut&#xA;sing;sang;sung&#xA;sink;sank;sunk&#xA;sit;sat;sat&#xA;slay;slew;slain&#xA;sleep;slept;slept&#xA;slide;slid;slid&#xA;sling;slung;slung&#xA;slink;slunk;slunk&#xA;slit;slit;slit&#xA;smell;smelt or smelled;smelt or smelled&#xA;smite;smote;smitten&#xA;sow;sowed;sown or sowed&#xA;speak;spoke;spoken&#xA;speed;sped or speeded;sped or speeded&#xA;spell;spelt or spelled;spelt or spelled&#xA;spend;spent;spent&#xA;spill;spilt or spilled;spilt or spilled&#xA;spin;spun;spun&#xA;spit;spat;spat&#xA;split;split;split&#xA;spoil;spoilt or spoiled;spoilt or spoiled&#xA;spread;spread;spread&#xA;spring;sprang or sprung;sprung&#xA;stand;stood;stood&#xA;steal;stole;stolen&#xA;stick;stuck;stuck&#xA;sting;stung;stung&#xA;stink;stank or stunk;stunk&#xA;stride;strode;stridden&#xA;strike;struck;struck&#xA;string;strung;strung&#xA;strive;strove;striven&#xA;swear;swore;sworn&#xA;sweat;sweat or sweated;sweat or sweated&#xA;sweep;swept;swept&#xA;swell;swelled;swollen or swelled&#xA;swim;swam;swum&#xA;swing;swung;swung&#xA;take;took;taken&#xA;teach;taught;taught&#xA;tear;tore;torn&#xA;telecast;telecast or telecasted;telecast or telecasted&#xA;tell;told;told&#xA;think;thought;thought&#xA;throw;threw;thrown&#xA;thrust;thrust;thrust&#xA;tread;trod;trodden&#xA;understand;understood;understood&#xA;wake;woke or waked;woken or waked&#xA;wear;wore;worn&#xA;weave;wove;woven&#xA;wed;wed or wedded;wed or wedded&#xA;weep;wept;wept&#xA;wet;wet or wetted;wet or wetted&#xA;win;won;won&#xA;wind;wound;wound&#xA;wring;wrung;wrung&#xA;write;wrote;written&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="71398" LastEditorUserId="71398" LastEditDate="2019-01-28T13:56:32.357" LastActivityDate="2019-01-28T13:56:32.357" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="17314" PostTypeId="1" CreationDate="2019-01-24T17:08:00.910" Score="20" ViewCount="749" Body="&lt;p&gt;Last year &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14614/cast-your-vote-for-best-of-ppcg-2017&quot;&gt;we voted for the best posts of 2017&lt;/a&gt; and rewarded them with bounties and challenges. I think it's a great way to reward and draw attention to some of the best content the community has created throughout the year, so let's do that again. (And hopefully, this year, we'll be able to sort everything out before half a year has passed.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First off, we'll need categories again, which you can nominate here. Each answer should contain a category for a challenge or answer to be rewarded. The top-voted categories will then receive separate nomination posts to find the actual winners. Like last year, I'm not going to state a fixed number of categories that will make it, but it's probably going to be between 5 and 15 again (last year, we went with 13 categories).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Feel free to resubmit &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14511/best-of-ppcg-2017-call-for-categories&quot;&gt;proposals from last year&lt;/a&gt; regardless of whether they were among the final 13 or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Voting will probably last for about two weeks, but this period can be extended if needed.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Offered Bounties&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As a further note, we'll need reputation rewards again, so if you're willing to spend some of your reputation on a bounty for one of the winners, feel free to edit your name into this list or leave a comment to indicate that you're willing.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Ten 500 rep bounties offered by&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/43319/ad%c3%a1m?tab=profile&quot;&gt;Adám&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;One 500 rep bounty offered by&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/59487/mr-xcoder?tab=profile&quot;&gt;Mr. Xcoder&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/58974/shaggy&quot;&gt;Shaggy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/45941/mego&quot;&gt;Mego&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/triticimagvs&quot;&gt;Wheat Wizard&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/58563/arnauld&quot;&gt;Arnauld&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/48198/bmo&quot;&gt;BMO&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/76162/jo-king&quot;&gt;Jo King&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="31716" LastEditDate="2019-02-07T16:54:07.960" LastActivityDate="2019-02-07T16:54:07.960" Title="Best of PPCG 2018 — Call for Categories" Tags="|discussion|best-of|" AnswerCount="16" CommentCount="6" ClosedDate="2019-02-07T13:41:09.573" ContentLicense="CC BY-SA 4.0" />
  <row Id="17315" PostTypeId="2" ParentId="17314" CreationDate="2019-01-24T17:13:40.820" Score="29" Body="&lt;h1&gt;Best Explanation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This category is for the answer with the best explanation accompanying it. Ideally, the winner will be an answer with a very detailed explanation that is accessible to anyone, regardless of the amount of relevant knowledge already possessed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Taken from the 2016 category nominations, initial proposer &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10940/59487&quot;&gt;Mego&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastActivityDate="2019-01-24T17:13:40.820" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17316" PostTypeId="2" ParentId="17314" CreationDate="2019-01-24T19:28:54.260" Score="18" Body="&lt;h1&gt;Rookie of the Year - Answers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For the best answer by someone who hasn't submitted an answer prior to 2018 (i.e., not necessarily a new user, but just someone who's a new answer writer).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/970822/2018-answers-by-users-with-no-answers-before-2018&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE query&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="42963" LastActivityDate="2019-01-24T19:28:54.260" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17317" PostTypeId="2" ParentId="17314" CreationDate="2019-01-24T22:17:36.027" Score="21" Body="&lt;h1&gt;Best mathematical insight&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;On this site we often see answers in languages specifically designed for short code, or designed to be fast. Sometimes, a nice golfing trick or speed-up technique surprises us with its ingenuity, beyond the standard use of that language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And occasionally an answer shows up that uses an unexpected approach to greatly simplify the problem, and makes us wonder how the author could ever think of that. This usually involves some far-from-obvious mathematical equivalence, or a particularly simple approach to the problem that was not evident at all (once revealed, other answers often follow the same approach).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This category is for the answer with the best &lt;strong&gt;mathematical&lt;/strong&gt; insight or unexpected approach that led to greatly simplifying the problem, in &lt;strong&gt;any challenge type&lt;/strong&gt; (code golf, fastest code, or others). The insight should have led to a significant improvement according to the challenge's metric (code length, run time, or whatever applicable).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10950/59487&quot;&gt;Initially posted in 2016 by Luis Mendo&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastActivityDate="2019-01-24T22:17:36.027" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17318" PostTypeId="2" ParentId="17314" CreationDate="2019-01-24T22:19:05.730" Score="15" Body="&lt;h1&gt;Rookie of the Year - Challenges&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For the best challenge written by someone who has not written a challenge prior to 2018 (i.e., not necessarily a new user, just a new challenge writer).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/970897/2018-questions-by-users-with-no-questions-before-2018&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE query&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="78410" LastEditDate="2019-01-26T22:30:55.793" LastActivityDate="2019-01-26T22:30:55.793" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17319" PostTypeId="2" ParentId="17314" CreationDate="2019-01-24T22:20:39.993" Score="17" Body="&lt;h1&gt;Best Above-and-Beyond Answer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Every once in a while, an answer takes the challenge to the extreme. This prize will be awarded to an answer which went far beyond the expectations of the challenge. This could include&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a code golf answer that brute-forced/proved the shortest program in some language&lt;/li&gt;&#xA;&lt;li&gt;a graphical-output popcon answer of extreme size and quality&lt;/li&gt;&#xA;&lt;li&gt;a KOTH answer of high complexity which absolutely dominated the competition&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This category was featured in both Best of 2015, Best of 2016 and Best of 2017.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastActivityDate="2019-01-24T22:20:39.993" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17320" PostTypeId="2" ParentId="17314" CreationDate="2019-01-24T22:24:32.353" Score="17" Body="&lt;h2&gt;SGITW (Slowest Gun in the West)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For the best 2018 answer in a challenge which received no answers within 48 hours of posting. The challenge itself does not need to be from 2018 and the nominated answer doesn't need to be the first answer to the challenge, but the first answer to the challenge does need to be from 2018. Tips questions are not counted for this category.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's very easy to get drawn to the fast-rising HNQ-hitting questions with a plethora of answers, so I thought this would be a good way to bring attention to answers that really needed to earn their love.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This category originally created &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10988/2867&quot;&gt;by Sp3000&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/970899/2018-slowest-gun-in-the-west&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE Query&lt;/a&gt;, &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/971509/2018-slowest-gun-in-the-west&quot; rel=&quot;nofollow noreferrer&quot;&gt;with the delays in days&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="78410" LastEditDate="2019-01-26T22:25:02.823" LastActivityDate="2019-01-26T22:25:02.823" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17321" PostTypeId="2" ParentId="17314" CreationDate="2019-01-24T22:31:04.813" Score="23" Body="&lt;h2&gt;Wrong tool for the job&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This category is for an answers that use the worst possible language to accomplish a task, while still making an effort to optimize the score. For example, writing a non-trivial program while using an extremely minimalist language like &lt;a href=&quot;https://esolangs.org/wiki/7&quot; rel=&quot;nofollow noreferrer&quot;&gt;7&lt;/a&gt;, or an inconvenient language like &lt;a href=&quot;https://esolangs.org/wiki/Lost&quot; rel=&quot;nofollow noreferrer&quot;&gt;lost&lt;/a&gt;, or even a normal language that's missing some crucial capability like internet connectivity or image processing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answers for this category should consider both the difficulty of the task and the unsuitable-ness of the language.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2019-01-24T22:31:04.813" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17322" PostTypeId="2" ParentId="17314" CreationDate="2019-01-24T22:35:05.020" Score="-5" Body="&lt;h1&gt;Most Ideal Answer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For answers that are not only impressive in terms of score (whether that be low byte-count or a different scoring mechanism), but are also a useful / elegant real-world way to perform the task at hand.&lt;/p&gt;&#xA;" OwnerUserId="18730" LastActivityDate="2019-01-24T22:35:05.020" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17323" PostTypeId="2" ParentId="17314" CreationDate="2019-01-24T23:54:38.893" Score="8" Body="&lt;h1&gt;The student becomes the master&lt;/h1&gt;&#xA;&lt;p&gt;This category aims to reward an answer that fulfils the following conditions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is an answer to a code-golf challenge&lt;/li&gt;&#xA;&lt;li&gt;The poster is not the creator of the language, and the code has byte count &lt;code&gt;N&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The creator of the language already submitted an answer, with byte count &lt;code&gt;M&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;And finally &lt;code&gt;N &amp;lt; M&lt;/code&gt;, but the restriction is that no language features used have been added in the meantime.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-01-24T23:54:38.893" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17324" PostTypeId="2" ParentId="17314" CreationDate="2019-01-24T23:56:01.023" Score="19" Body="&lt;h1&gt;Kansas City Shuffle&lt;/h1&gt;&#xA;&lt;p&gt;Too often, once someone devises a generic golfy method of solving a challenge, most people will use that method for their answers. This award goes to those answers that utilize an alternative method as a better solution than the method that the majority of other answers use (prior to the posting of the rewarded answer).&lt;/p&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-01-24T23:56:01.023" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17326" PostTypeId="2" ParentId="2140" CreationDate="2019-01-25T05:26:50.293" Score="2" Body="&lt;h1&gt;Shift right by half a bit &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The challenge is to implement a program or function &lt;sup&gt;(subsequently referred to as &quot;program&quot;)&lt;/sup&gt; that takes a nonnegative integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; as input and returns &lt;span class=&quot;math-container&quot;&gt;\$n\over\sqrt{2}\$&lt;/span&gt; (the input divided by the square root of two) as output, rounded to a nonnegative integer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may take your input and output in any reasonable format; for example stdin/stdout, files, or arguments/return values would all be acceptable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are required to use, at minimum, the largest fixed-size integer type offered by your language, and if an &lt;strong&gt;unsigned&lt;/strong&gt; variant of this is available, you must use it. If your language has no built-in integer type (e.g. JavaScript) you are allowed to use its default numerical type (e.g. floating point); for languages with no concept of a number (e.g. regex), input and output can be e.g. the length of a string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is not required to reject negative integers; a submission that returns correct answers for negative inputs is allowed, but not required. Undefined behavior with negative inputs is allowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are allowed and encouraged to use arbitrary-precision integer types if you so desire, but the type must either be a built-in, part of a standard library, or implemented from scratch in your program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Despite what the title might imply, you may use any rounding algorithm you want (floor, ceiling, nearest half up, nearest half even, arbitrary, or even random), as long as the difference between the integer returned value and the theoretical exact (irrational) value is always less than &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; for all inputs that fit in your chosen integer type. All inputs up to the maximum representable value must return a correct output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a way, the job of this program is to calculate the irrational number &lt;span class=&quot;math-container&quot;&gt;\$\sqrt{2}\$&lt;/span&gt; to the requested precision, presenting it in the form of an integer. This is why solutions using arbitrary-precision types are encouraged, but not required.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge. Standard loopholes are denied. The program with the least number of bytes wins. If there's a tie, the choice of accepted answer will be at my discretion. That said, this challenge is not only about which answer wins; it's also about seeing how concisely the challenge can be solved in each language, and seeing how each language &quot;prefers&quot; to handle rounding. And for those submissions that choose to use arbitrary precision, it's about seeing how concisely this can be done in the language.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The &lt;strong&gt;primary&lt;/strong&gt; reason for the question is that I want to post my ECMAScript regex solving it. Currently all I have is an 849 byte &lt;sub&gt;&lt;sup&gt;(very heavily golfed down from an initial 1159 bytes)&lt;/sup&gt;&lt;/sub&gt; ECMAScript + molecular lookahead regex, i.e. not purely ECMAScript-compatible and only works on my regex engine, so this question can stew in the Sandbox for a while until I port the regex to pure ECMAScript at some point, and/or put the regex engine on TIO.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, I am genuinely interested in what submissions PPCGers will come up with for this challenge (including in the languages more frequently seen in PPCG posts), and will treat the hosting of it seriously. Also there's the chance that someone will attempt solving it in a more powerful regex flavor, and I'd be fascinated to see if this could be done in significantly less length than ECMA (I actually doubt it can). Or somebody could come up with a crazy solution for it in some other language that has limits imposed which make it hard to do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And if somebody could think of a way to solve it in ECMA in fewer bytes than I have (or even just golf down my regex), that would be fascinating (or thrilling) as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd be interested in putting up a bounty for the regex aspects of this question, and would appreciate any suggestions people would have as to how to do this and how much the bounty should be.&lt;/p&gt;&#xA;" OwnerUserId="17216" LastEditorUserId="17216" LastEditDate="2019-01-27T08:52:44.517" LastActivityDate="2019-01-27T08:52:44.517" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17327" PostTypeId="2" ParentId="17314" CreationDate="2019-01-25T17:52:52.793" Score="12" Body="&lt;h2&gt;Breaking The Mold (Most Original Challenge)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It's really easy to come up with normal code-golf and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;, or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; challenge, etc. Don't get me wrong, there's nothing wrong with these challenges. They're the meat of the challenges on our site. However, they're not the most imaginative. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This category is for a challenge that re-invents the wheel, and explores new ideas that we haven't really used on the site.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Maybe this challenge inspired a new tag, or category of challenges?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Maybe it's a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; with a unique and very well balanced scoring formula?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Or maybe it's even a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge about a novel task. This category is for rewarding users who came up with interesting ideas that keep the site fresh.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2019-01-25T17:52:52.793" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17329" PostTypeId="2" ParentId="17314" CreationDate="2019-01-25T22:40:07.940" Score="11" Body="&lt;h1&gt;Most helpful commenter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;One of the things that stands out about this community is that although it's highly competitive, there is nearly always someone on hand to offer advice both on improving challenges and improving answer scores. It's part of what made this site seem so welcoming to me.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In recognition of this, nominees should be people who have helped others improve and made them feel welcome, whether by direct comments on challenges and answers, or in comments in chat.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2019-01-25T22:40:07.940" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="17330" PostTypeId="2" ParentId="17314" CreationDate="2019-01-25T22:44:13.657" Score="14" Body="&lt;h1&gt;Most elegant spec&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Writing an interesting challenge is tough, not just in thinking up a good idea, but in specifying it clearly enough without taking pages of text. This category is for challenges whose specification is a pleasure to read, summing up exactly what is required succinctly and unambiguously.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2019-01-25T22:44:13.657" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17331" PostTypeId="2" ParentId="2140" CreationDate="2019-01-26T16:26:58.903" Score="3" Body="&lt;h1&gt;Classic VCS ASCII Adventure&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/179225/classic-vcs-ascii-adventure&quot;&gt;Moved to main&lt;/a&gt;.  Thanks everyone for your input.  Happy golfing!&lt;/p&gt;&#xA;" OwnerUserId="84624" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-01-29T14:00:50.903" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17332" PostTypeId="2" ParentId="17314" CreationDate="2019-01-26T19:58:09.413" Score="-2" Body="&lt;h1&gt;Most useful Meta question&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For questions posted on Meta that made a significant difference, bringing new clarity to the site or an important change in perspective.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2019-01-26T19:58:09.413" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17333" PostTypeId="2" ParentId="17314" CreationDate="2019-01-26T20:02:33.743" Score="4" Body="&lt;h1&gt;Most useful Meta answer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For answers posted on Meta that made a significant difference, bringing new clarity to the site or an important change in perspective.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2019-01-26T20:02:33.743" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17334" PostTypeId="2" ParentId="6918" CreationDate="2019-01-27T15:32:56.097" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://tio.run/#alchemist&quot; rel=&quot;nofollow noreferrer&quot;&gt;Alc&lt;/a&gt;&lt;a href=&quot;https://github.com/bforte/alchemist/&quot; rel=&quot;nofollow noreferrer&quot;&gt;hem&lt;/a&gt;&lt;a href=&quot;https://esolangs.org/wiki/Alchemist&quot; rel=&quot;nofollow noreferrer&quot;&gt;ist&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&#xA;&#xA;&lt;p&gt;I created &lt;a href=&quot;https://codegolf.stackexchange.com/users/48198/bmo&quot;&gt;several&lt;/a&gt; languages, but I think  this one is worth posting here since it's a fun concept:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The idea is inspired by chemical reaction networks which consist of a rule-set encoding certain &quot;chemical reactions&quot;, eg:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-bash prettyprint-override&quot;&gt;&lt;code&gt;H + 2O -&amp;gt; H2O&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A program is just a set of such rules, however there might be rules where their inputs overlap, for example:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-bash prettyprint-override&quot;&gt;&lt;code&gt;Alice -&amp;gt; Bob&#xA;Alice -&amp;gt; Charlie&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Well, here's where the fun/pain begins: The program has an internal state - called the &lt;em&gt;universe&lt;/em&gt; - which counts how many atoms of which type there are. At every iteration a uniformly at random rule is picked from all the ones which are applicable (you can change the probabilities by copying the rule).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To bootstrap the whole process the program starts off with one &lt;code&gt;_&lt;/code&gt;-atom and from there your world starts evolving.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input/Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;There are three types of special atoms which when they would be added to the universe do some I/O instead:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-bash prettyprint-override&quot;&gt;&lt;code&gt;In_some_name:      Read number from stdin and add that many &quot;some_name&quot;-atoms&#xA;Out_some_name:     Output the number of &quot;some_name&quot;-atoms&#xA;Out_&quot;some string&quot;: Output the string &quot;some string&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre class=&quot;lang-bash prettyprint-override&quot;&gt;&lt;code&gt;_ -&amp;gt; Out_&quot;Hello, Alchemist!&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Prints &lt;code&gt;Hello, Alchemist!&lt;/code&gt; to &lt;em&gt;stdout&lt;/em&gt;: &lt;a href=&quot;https://tio.run/##S8xJzkjNzSwu@f8/XkHXTsG/tCReySM1JydfR8ERJqeo9P8/AA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Alchemist – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;pre class=&quot;lang-bash prettyprint-override&quot;&gt;&lt;code&gt;_ -&amp;gt; In_x + In_x + Out_x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Reads two integers from &lt;em&gt;stdin&lt;/em&gt; and outputs their sum: &lt;a href=&quot;https://tio.run/##S8xJzkjNzSwu@f8/XkHXTsEzL75CQRtG@ZeWxFf8/29kyGVhAAA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Alchemist – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Here's how deterministic control-flow can be implemented, ie. use special atoms to store state:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-bash prettyprint-override&quot;&gt;&lt;code&gt;# Read two integers &amp;amp; add &quot;compare_AB&quot;-atom&#xA;_ -&amp;gt; In_A + In_B + compare_AB&#xA;&#xA;# If there is a &quot;compare_AB&quot;-atom:&#xA;compare_AB + A + B -&amp;gt; compare_AB   # remove an atom of A and B&#xA;&#xA;# Once there are no more atoms of A or B, we know ..&#xA;compare_AB + 0A + 0B -&amp;gt; Out_&quot;eq&quot;   # .. if none of both are left: they're equal&#xA;compare_AB + 0A +  B -&amp;gt; not_equal  # .. if only B is left B &amp;gt; A&#xA;compare_AB +  A + 0B -&amp;gt; not_equal  # .. if only A is left A &amp;gt; B&#xA;&#xA;# Do something when they're unequal&#xA;not_equal -&amp;gt; Out_&quot;neq&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Reads two integers and compares them: &lt;a href=&quot;https://tio.run/##dZDBboNADETvfMUIpPbQBkVRTjlEAvWSU6T@ANqCCSis3cBSlK@nXmhDo7an3fXOvLFtmrwiW3duHCO8kingBkHNjk7UdniAKQqEudh301KWpOHKOLFBhtUeB84SPPkj1WPRBEGEQwlXUUuoO5jfgF2wVNTrMalH/qgCEVqy8kEwDG@ClKo0XGCKOHJOXyFqAQus@Lsqu1kqLdJnDIQzy4A4vg9d@9T1FHvsXRbSJZxC4xh1qTgmT3kTV038hkq383nXR33RpTfNH7x5DBaXTYqFJ9xc9VPX4UF62yO592Pp5z9/cvMn6p@28CLoxJKraj5hqIhvLfY8N7nAvifVj3Act5tgu/kE&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Alchemist – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="48198" LastActivityDate="2019-01-27T15:32:56.097" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17335" PostTypeId="2" ParentId="17314" CreationDate="2019-01-27T18:02:47.563" Score="8" Body="&lt;h1&gt;Best (unusual) Tool for the Job&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The strong golfing languages usually supply the shortest solutions (in their domain), but occasionally someone finds a very rarely used language that excels at exactly the task at hand. This prize doesn't go as much for the effort of writing a solution (it is probably trivial), as it does for finding that obscure tool.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="20283" LastEditDate="2019-01-27T18:29:11.527" LastActivityDate="2019-01-27T18:29:11.527" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17336" PostTypeId="1" CreationDate="2019-01-28T20:21:39.007" Score="1" ViewCount="124" Body="&lt;p&gt;How does this Programming Puzzles &amp;amp; Code Golf work?&#xA;Just curious because I don't really know what this is and I want to fined out...  &lt;/p&gt;&#xA;" OwnerUserId="85181" OwnerDisplayName="FollowerOfGod" LastActivityDate="2019-01-28T20:32:08.013" Title="How does the community work?" Tags="|discussion|" AnswerCount="0" CommentCount="3" ClosedDate="2019-01-30T03:25:56.643" ContentLicense="CC BY-SA 4.0" />
  <row Id="17337" PostTypeId="2" ParentId="5243" CreationDate="2019-01-29T05:28:51.567" Score="14" Body="&lt;h1&gt;200 rep each for answering good unanswered questions&lt;/h1&gt;&#xA;&lt;p&gt;I don't like seeing good questions go unanswered, so I'm offering 200 rep each for valid answers to unanswered non-&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; non-&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/koth&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;koth&amp;#39;&quot; rel=&quot;tag&quot;&gt;koth&lt;/a&gt; non-&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; questions with a score of &lt;s&gt;20&lt;/s&gt; 15 or above. As of now (April 26, 2022), there are 2 such questions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/220053/topologically-distinct-ways-of-dissecting-a-square-into-rectangles&quot;&gt;Topologically distinct ways of dissecting a square into rectangles&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/107788/find-a-glider-synthesis-game-of-life&quot;&gt;Find a Glider Synthesis (Game of Life)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You can check for yourself what questions are available &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=answers%3A0+closed%3Ano+score%3A15..+-%5Btips%5D+-%5Bking-of-the-hill%5D+-%5Bcops-and-robbers%5D&quot;&gt;via search&lt;/a&gt;, or vote for questions that are &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=answers%3A0+closed%3Ano+score%3A13..+-%5Btips%5D+-%5Bking-of-the-hill%5D+-%5Bcops-and-robbers%5D&quot;&gt;close to the vote count&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Previous winners:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/179689/58563&quot;&gt;Magic: the Gathering Combat Golf&lt;/a&gt; By &lt;a href=&quot;https://codegolf.stackexchange.com/users/58563/arnauld&quot;&gt;Arnauld&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/190764/76162&quot;&gt;Optimize Compiler for simple Reverse Polish Notation Programming Language&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/87058/roman&quot;&gt;Roman&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/190995/76162&quot;&gt;Auto BATCH golfer&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/61379/kamila-szewczyk&quot;&gt;Kamila Szewczyk&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/195766/76162&quot;&gt;Matrices Generated Using Rectangles&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/68942/hyperneutrino&quot;&gt;HyperNeutrino&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/196011/76162&quot;&gt;Determine if a Graph is Toroidal&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/20080/isaacg&quot;&gt;isaacg&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/199608/76162&quot;&gt;Halting Problem for Simplified Hexagony&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/200341/76162&quot;&gt;Maximal discrepancy-2 sequence with minimal entropy&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/89298/s-s-anne&quot;&gt;S.S. Anne&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/203212/76162&quot;&gt;Gerrymander North Carolina&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/36445/my-pronoun-is-monicareinstate&quot;&gt;my pronoun is monicareinstate&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/211376/76162&quot;&gt;Hexasweep (part 1): The Solver&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/79857/redwolf-programs&quot;&gt;Redwolf Programs&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/212043/76162&quot;&gt;How should I tile my kitchen?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/233759/76162&quot;&gt;Complement a POSIX Extended Regular Expression&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/87606/tjjfvi&quot;&gt;tjjfvi&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/235298/76162&quot;&gt;Totally Cubular&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/87606/tjjfvi&quot;&gt;tjjfvi&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/235324/76162&quot;&gt;telgif: inverse figlet&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/87606/tjjfvi&quot;&gt;tjjfvi&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76162" LastEditorUserId="96039" LastEditDate="2022-05-07T03:31:02.930" LastActivityDate="2022-05-07T03:31:02.930" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="17339" PostTypeId="2" ParentId="2140" CreationDate="2019-01-29T20:25:24.163" Score="2" Body="&lt;h1&gt;Generate a 3D spiral&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Inspired by &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/48767657#48767657&quot;&gt;this chat message&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The spiral used in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/179157/the-path-of-the-wildebeest&quot;&gt;The Path Of The Wildebeest&lt;/a&gt; is a contiguous mapping of the positive integers to lattice points in 2D. Your task is to generalize this to 3D.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Specifically, create a function &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; from &lt;span class=&quot;math-container&quot;&gt;\$\mathbb Z^+\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$ \mathbb Z^3\$&lt;/span&gt; with the following properties:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; is a bijection (All points are eventually reached).&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$f(1) = (0,0,0)\$&lt;/span&gt; (The spiral starts at the origin).&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ |f(n+1) - f(n)| = 1\$&lt;/span&gt; (The spiral is contiguous).&lt;/li&gt;&#xA;&lt;li&gt;The Chebyshev distance from the origin &lt;span class=&quot;math-container&quot;&gt;\$ |f(n)|_\infty \$&lt;/span&gt; is a nondecreasing function (&lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; fills all points in each concentric cubical shell &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; before moving to shell &lt;span class=&quot;math-container&quot;&gt;\$k+1\$&lt;/span&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;One possible &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; is given by &lt;a href=&quot;https://example.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;this Python implementation&lt;/a&gt;, but any &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; that satisfies the above properties is allowed. Please describe the function your answer generates.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because all your computer's memory is taken up by the wildebeest simulation you're running, typing is very slow, so your code must be as short as possible.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;I/O&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;As is standard with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; questions, either 1-indexing or 0-indexing is allowed. Any of these I/O formats are acceptable:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Receive &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; as input and output the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th point in the sequence&lt;/li&gt;&#xA;&lt;li&gt;Receive &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; as input and output the first &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; points&lt;/li&gt;&#xA;&lt;li&gt;Take no input and output the sequence infinitely. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="39328" LastEditDate="2019-01-31T01:13:26.187" LastActivityDate="2019-01-31T01:13:26.187" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17341" PostTypeId="1" CreationDate="2019-01-30T03:22:58.097" Score="-1" ViewCount="256" Body="&lt;p&gt;The consistent attitude with regard to the golf language situation is that for every challenge, each language is a category, and subsequently there is a 'winner' for each language. This is also a very &lt;em&gt;very&lt;/em&gt; popular opinion with regard to the new user experience. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is a problem with this idea. With the exception of a very small percentage of languages, Most challenges have only one answer for each language. You might see where I'm going with this. If there is one winner for each language, and also one answer for each language, then by extension almost everyone is a winner. Anyone with a half-decent answer is never challenged. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;By this logic, why is competitiveness important to the PPCG stack?&lt;br&gt;&#xA;Does the reason expand beyond &quot;The rules say so&quot;? If not, then why are the rules discouraging competition? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;After some confusion of definitions, a formal definition of &lt;em&gt;competitiveness&lt;/em&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Possession of a strong desire to be more successful than others.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.oxforddictionaries.com/definition/competitiveness&quot; rel=&quot;nofollow noreferrer&quot;&gt;source&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="60951" LastEditorUserId="60951" LastEditDate="2019-01-31T05:46:25.027" LastActivityDate="2019-03-15T07:05:02.713" Title="If there is &quot;a winner for every language&quot; in a code golf challenge, does competitiveness matter?" Tags="|discussion|rules|new-users|noncompeting|" AnswerCount="4" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="17342" PostTypeId="2" ParentId="17341" CreationDate="2019-01-30T05:33:36.020" Score="3" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;why is competitiveness important?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It's not, really. We need some kind of scoring criterion, and going by byte count is simple, objective, and easy to measure in (almost) every language, but is still enough of a departure from the way code is normally written that it poses a unique challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That most languages don't get more than one answer on a given question really doesn't matter. Trying to get a program as short as possible (or, in many cases, trying to simply write it in the first place) is entertaining regardless of whether there are other people for you to compete with.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you're using a language which neither (1) has enough competition for your taste, nor (2) is inherently fun to golf in even without competition, might I suggest switching to a different one?&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="61384" LastEditDate="2019-03-15T07:05:02.713" LastActivityDate="2019-03-15T07:05:02.713" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17343" PostTypeId="2" ParentId="2140" CreationDate="2019-01-30T05:37:40.007" Score="0" Body="&lt;h1&gt;Super Permutations&lt;/h1&gt;&#xA;&lt;p&gt;Find the super permutation for a set of size n. A super permutation of a set is one string that contains all permutations of that set. Here is a helpful &lt;a href=&quot;https://youtu.be/OZzIvl1tbPo&quot; rel=&quot;nofollow noreferrer&quot;&gt;video&lt;/a&gt; by Matt Parker&lt;/p&gt;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&lt;p&gt;For a set of size 2 all the permutations are &lt;code&gt;AB, BA&lt;/code&gt; but the super permutation is &lt;code&gt;ABA&lt;/code&gt; because it contains the string &lt;code&gt;AB&lt;/code&gt; and &lt;code&gt;BA&lt;/code&gt;.&lt;br&gt;&#xA;For a set of 3 all permutations are &lt;code&gt;ABC,ACB,BAC,BCA,CBA,CAB&lt;/code&gt; and the super permutation is &lt;code&gt;ABCABACBA&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Given a certain size n (n&amp;gt;=1) find a super permutation of that set. To do this you have to use a pattern explained in the video.&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;An integer greater than 0. This can be a function input &lt;code&gt;superperm(n)&lt;/code&gt; or be taken from user input.&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;super permutation of that sized set. This can either be printed out or the return value of a function&lt;/p&gt;&#xA;&lt;h1&gt;Sample Inputs&lt;/h1&gt;&#xA;&lt;p&gt;all of these are the shortest for that length but this is not a requirement.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    1: A&#xA;    2: ABA&#xA;    3: ABCABACBA&#xA;    4: ABCDABCADBCABDCABADABACDBACBDACBADCBA&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="85065" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-01-30T23:56:19.303" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17344" PostTypeId="2" ParentId="17341" CreationDate="2019-01-30T07:05:34.607" Score="9" Body="&lt;h2&gt;PPCG &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; should not be considered an individual competition.&lt;/h2&gt;&#xA;&lt;p&gt;Because PPCG solutions are publicly displayed, many users peek at solutions by others in their language. Suppose Alice, a Jelly programmer, writes a 20-byte answer to some challenge. Bob glances at the byte count, thinks he can outgolf her, and finds an 18-byte solution. Finding it too similar to Alice's and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11710/should-we-stop-being-so-generous&quot;&gt;being generous&lt;/a&gt;, he leaves it as a comment. Later, Carol studies Alice's answer as well as others' in different languages, and finds an efficient approach that solves it in 13 bytes.&lt;/p&gt;&#xA;&lt;p&gt;All three users essentially had different playing fields and cannot compete fairly. Due to these asymmetries resulting from the structure of our site, PPCG &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is flawed as a &lt;em&gt;competition&lt;/em&gt; (fair test of individual ability) and should not be thought of as such.&lt;/p&gt;&#xA;&lt;p&gt;However, &lt;em&gt;competitiveness&lt;/em&gt; (trying to outdo others) is very much in the spirit of PPCG. A competitive mindset is not by any means a requirement to contribute to PPCG, but it's an important motive for PPCG contributors. (Other motives include theoretical interest, improving one's code-golf skills, community, etc.)&lt;/p&gt;&#xA;&lt;h3&gt;Reasons why challenges often have only one answer in a given language&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;They don't. If a question is popular and easily approachable, it likely has multiple answers in common production languages. For example &lt;a href=&quot;https://codegolf.stackexchange.com/q/178344/39328&quot;&gt;Oreoorererereoo&lt;/a&gt; has 4 Python and 3 JS answers.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The author of the first solution is likely to be fluent (to write it so fast) and very active (therefore experienced, therefore skilled), so a refinement of the first solution has a good chance of being the best.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each esolang has a small community. In Jelly (currently the best and most popular golfing language), 3-4 golfers &lt;a href=&quot;https://codegolf.stackexchange.com/search?tab=newest&amp;amp;q=%22Jelly%22%20is%3aanswer&quot;&gt;combine to write over 80% of Jelly answers&lt;/a&gt;. In 05AB1E, Kevin Cruijssen writes &lt;a href=&quot;https://codegolf.stackexchange.com/search?tab=newest&amp;amp;q=%2205AB1E%22%20-legacy%20is%3aanswer&quot;&gt;the majority&lt;/a&gt; of answers, and in a specialized language like Canvas dzaima writes &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=%22Canvas%22+is%3Aanswer&quot;&gt;80% of answers&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In golfing languages, the solution is sometimes a few builtins. It's hard to golf down a 6-byte answer, and even if you do, it often feels like you haven't contributed enough to post the 4-byte answer as your own.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;(I'm not sure of OP's exact question yet, but I tried to give my best answer).&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-02-01T03:33:25.843" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17345" PostTypeId="1" AcceptedAnswerId="17346" CreationDate="2019-01-30T09:30:39.260" Score="2" ViewCount="89" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/windows-system&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;windows-system&amp;#39;&quot; rel=&quot;tag&quot;&gt;windows-system&lt;/a&gt; was just created for &lt;a href=&quot;https://codegolf.stackexchange.com/q/179262/43319&quot;&gt;a question put on hold as unclear&lt;/a&gt;, and I see no reason to have OS-specific tags. Indeed there are none for any other OSs.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="78028" LastEditDate="2019-01-31T04:22:31.697" LastActivityDate="2019-01-31T04:22:31.697" Title="Remove [windows-system] tag" Tags="|support|tags|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17346" PostTypeId="2" ParentId="17345" CreationDate="2019-01-30T12:06:50.130" Score="6" Body="&lt;p&gt;There's no need to do anything. The question has been deleted, and a tag with no questions is auto-deleted by a cron job.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2019-01-30T12:06:50.130" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17350" PostTypeId="2" ParentId="17341" CreationDate="2019-01-31T08:09:31.753" Score="1" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;The consistent attitude with regard to the golf language situation is that for every challenge, each language is a category, and subsequently there is a 'winner' for each language. ...  If there is one winner for each language, and also one answer for each language, then by extension almost everyone is a winner.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I agree with you that this interpretation is a problem, but there are more useful interpretations.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;If you trawl through the early days of meta, I think you'll find various discussions about language handicaps, but all proposals for them were abandoned as unworkable. The concept that languages don't compete against each other may in part be a reaction against these proposals: handicaps are unnecessary because direct comparisons are unnecessary.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;We require entries to make a serious attempt to optimise for the winning criterion. This is sometimes phrased as &quot;entries must be competitive&quot;, and the concept that languages are incomparable helps to clarify that this doesn't automatically disqualify more verbose languages from code golf. (I suspect that you're thinking of suggesting a change to this rule, but I won't preempt).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I think it may also be used from time to time to justify not selecting an accepted answer. When the shortest answer is a one-byte built-in then IMO the question is poor, but some people have different attitudes or don't realise what built-ins exist and yet don't want to reward a 'no-effort&quot; answer over one which took a lot of effort.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="194" LastActivityDate="2019-01-31T08:09:31.753" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17351" PostTypeId="2" ParentId="17341" CreationDate="2019-01-31T09:04:22.593" Score="2" Body="&lt;h1&gt;Competitiveness &lt;em&gt;does&lt;/em&gt; matter&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Anyone with a half-decent answer is never challenged.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Incorrect. If it's decent but not at the level of &quot;very good&quot;, generally people will comment improvements, or (rarely) submit their own if they use a significantly different approach. Just because they don't have their own answer does &lt;em&gt;not&lt;/em&gt; mean they aren't competing.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;then by extension almost everyone is a winner&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Incorrect, see above. Anyone that contributes to the best solution, or even comes up with an identical solution, is a winner. It's just that the Stack Exchange system is not the best indicator of this.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;and also one answer for each language&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;For easier challenges, there is generally only one approach. For harder challenges, very, &lt;em&gt;very&lt;/em&gt; few people attempt it because of the sheer amount of effort involved. Also keep in mind that certain people enjoy certain types of questions - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; challenges are generally &lt;em&gt;very&lt;/em&gt; different, and generally require different tools/methods/a different way of thinking to golf.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Furthermore, consider the sheer number of languages of the submissions. PPCG is a relatively (very) small Stack Exchange community, and I'd say the number of active users is only several times larger than the number of active languages. Considering the fact that not everyone will attempt every challenge, I doubt there are more than a few people who golf in a certain language that look at any given question.&lt;/p&gt;&#xA;" OwnerUserId="39244" LastEditorUserId="39244" LastEditDate="2019-01-31T09:09:49.573" LastActivityDate="2019-01-31T09:09:49.573" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17352" PostTypeId="2" ParentId="2140" CreationDate="2019-01-31T15:22:11.087" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/179588/playing-picomino&quot;&gt;Playing Pickomino&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="81238" LastEditorUserId="81238" LastEditDate="2019-02-06T22:05:11.713" LastActivityDate="2019-02-06T22:05:11.713" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17357" PostTypeId="2" ParentId="5243" CreationDate="2019-02-01T18:43:31.327" Score="4" Body="&lt;h1&gt;500 rep for a ridiculously huge number&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There are currently &lt;em&gt;no&lt;/em&gt; valid answers to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/176966/golf-a-number-bigger-than-loaders-number&quot;&gt;Golf a number bigger than Loader&amp;#39;s number&lt;/a&gt;. This bounty will be awarded to the valid first answer that either&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is under 256 bytes, or&lt;/li&gt;&#xA;&lt;li&gt;Outputs a number significantly larger than Loader's number (i.e. larger than any simple modification to loader.c).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="39328" LastActivityDate="2019-02-01T18:43:31.327" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17358" PostTypeId="2" ParentId="2140" CreationDate="2019-02-02T22:24:31.373" Score="1" Body="&lt;h1&gt;SLIPpery Packets&lt;/h1&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Serial_Line_Internet_Protocol&quot; rel=&quot;nofollow noreferrer&quot;&gt;Serial Line Internet Protocol&lt;/a&gt; is an early internet protocol, used to essentially escape any &amp;quot;packet END&amp;quot; bytes that may appear in a packet. It has since been replaced by the more sophisticated Point-to-Point protocol, however it is still preferred on microcontrollers and low-level devices due to its simplicity.&lt;/p&gt;&#xA;&lt;p&gt;Your goal is to implement simplified encoding and decoding functions following this protocol as a function/program/subroutine/etc.&lt;/p&gt;&#xA;&lt;p&gt;The following table lists the special bytes used:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Hex    Dec   ISO 8859-1   Abbrev  &#xA;0xC0   192   À            END      &#xA;0XDB   219   Û            ESC&#xA;0xDC   220   Ü            ESC_END&#xA;0xDD   221   Ý            ESC_ESC&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(The ISO 8859-1 characters are for visualizing where non-ASCII bytes are in the string.)&lt;/p&gt;&#xA;&lt;p&gt;Encoding follows this system, iterating through each byte:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the END byte appears in the packet, write ESC, ESC_END instead&lt;/li&gt;&#xA;&lt;li&gt;If the ESC byte appears in the packet, write ESC, ESC_ESC instead&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, write byte verbatim&lt;/li&gt;&#xA;&lt;li&gt;At the end, an END byte is appended to the message, and it is returned&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Some implementations, such as the reference C implementation from &lt;a href=&quot;https://www.rfc-editor.org/rfc/rfc1055&quot; rel=&quot;nofollow noreferrer&quot;&gt;RFC 1055&lt;/a&gt;, prepend an END byte to the string to be sent. This is omitted here for simplicity.&lt;/p&gt;&#xA;&lt;p&gt;Decoding follows in reverse:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If ESC, ESC_END appears in the packet, write END instead&lt;/li&gt;&#xA;&lt;li&gt;If ESC, ESC_ESC appears in the packet, write ESC instead&lt;/li&gt;&#xA;&lt;li&gt;Protocol violations that involve ESC followed by a &amp;quot;bad byte&amp;quot; that isn't ESC_END or ESC_ESC should be handled by writing the &amp;quot;bad byte&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;The first END byte seen (not following ESC) is interpreted as the end of the packet. The decoded packet should be returned without the END byte. You are guaranteed to have at least one such END byte appear.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Input/Output&lt;/h2&gt;&#xA;&lt;p&gt;For encoding, input is a packet (string of bytes) and output is the encoded packet (string of bytes).&lt;/p&gt;&#xA;&lt;p&gt;For decoding, input is a &amp;quot;byte stream&amp;quot; (string of bytes) and output is the (first) decoded packet (string of bytes).&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Inputs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;''                --&amp;gt; 'À'&#xA;'test\n'          --&amp;gt; 'test\nÀ'&#xA;'testÀ'           --&amp;gt; 'testÛÜÀ'&#xA;'teÛst'           --&amp;gt; 'teÛÝstÀ'&#xA;'À'               --&amp;gt; 'ÛÜÀ'&#xA;'ÛÜÛÝÀÛ'          --&amp;gt; 'ÛÝÜÛÝÝÛÜÛÝÀ'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Outputs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;'À'               --&amp;gt; ''&#xA;'testÀblah blahÀ' --&amp;gt; 'test'&#xA;'teÛÝstÀ'         --&amp;gt; 'teÛst'&#xA;'testÛÜÛÜÀ'       --&amp;gt; 'testÀÀ'&#xA;'ÛÝÜÛÝÝÛÜÛÝÀ'     --&amp;gt; 'ÛÜÛÝÀÛ'&#xA;'ÛÀÀ'             --&amp;gt; 'À'&#xA;'ÛµÀ¶'            --&amp;gt; 'µ'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Your score is the sum of the number of bytes in your encoding and decoding functions (or programs, etc.)&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I have also considered requiring functions to take a length of packet in bytes which is used in encoding and decoding (similar to RFC 1055), not requiring handling protocol violations (ex. RFC 1055), and not testing decoding packets that have an END byte as not the last byte. Your opinions on how restrictive this challenge should be are appreciated.&lt;/p&gt;&#xA;" OwnerUserId="17360" LastEditorUserId="-1" LastEditDate="2021-10-07T07:34:52.683" LastActivityDate="2019-02-06T22:47:27.383" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17363" PostTypeId="2" ParentId="5243" CreationDate="2019-02-06T09:26:07.117" Score="21" Body="&lt;p&gt;&lt;em&gt;&lt;strong&gt;Disclaimer:&lt;/strong&gt; This bounty was posted by a person whose job is to promote APL.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h1&gt;50 – 500 rep for an APL answer&lt;/h1&gt;&#xA;&lt;p&gt;I will reward 50 rep if all of the following conditions are met:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The answer is in &lt;a href=&quot;https://www.dyalog.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Dyalog APL&lt;/a&gt; Classic/Unicode/&lt;a href=&quot;https://github.com/abrudz/dyalog-apl-extended&quot; rel=&quot;nofollow noreferrer&quot;&gt;Extended&lt;/a&gt;/&lt;a href=&quot;https://github.com/abrudz/dyalog-apl-prime&quot; rel=&quot;nofollow noreferrer&quot;&gt;Prime&lt;/a&gt;, &lt;a href=&quot;https://www.ibm.com/uk-en/marketplace/apl2/details&quot; rel=&quot;nofollow noreferrer&quot;&gt;APL2&lt;/a&gt;, &lt;a href=&quot;http://apl2000.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;APL+&lt;/a&gt;, &lt;a href=&quot;https://play.google.com/store/apps/details?id=org.gemesys.android.aplse&quot; rel=&quot;nofollow noreferrer&quot;&gt;APLSE&lt;/a&gt;, &lt;a href=&quot;https://www.gnu.org/software/apl/&quot; rel=&quot;nofollow noreferrer&quot;&gt;GNU/APL&lt;/a&gt;, &lt;a href=&quot;http://www.sigapl.org/Archives/waterloo_archive/apl/sharp.apl/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sharp APL&lt;/a&gt;, &lt;a href=&quot;https://play.google.com/store/apps/details?id=org.gemesys.android.sapl&quot; rel=&quot;nofollow noreferrer&quot;&gt;sAPL&lt;/a&gt;, &lt;a href=&quot;https://github.com/tobia/luit-sax&quot; rel=&quot;nofollow noreferrer&quot;&gt;SAX&lt;/a&gt;, &lt;a href=&quot;http://www.nars2000.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;NARS&lt;/a&gt;, &lt;a href=&quot;https://www.dyalog.com/aplx.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;APLX&lt;/a&gt;, &lt;a href=&quot;http://www.aplusdev.org/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;A+&lt;/a&gt;, &lt;a href=&quot;https://github.com/dzaima/apl&quot; rel=&quot;nofollow noreferrer&quot;&gt;dzaima/APL&lt;/a&gt;, &lt;a href=&quot;https://gitlab.com/n9n/apl&quot; rel=&quot;nofollow noreferrer&quot;&gt;ngn/APL&lt;/a&gt;, &lt;a href=&quot;https://github.com/ktye/iv&quot; rel=&quot;nofollow noreferrer&quot;&gt;APL\iv&lt;/a&gt;, &lt;a href=&quot;https://play.google.com/store/apps/details?id=org.gemesys.android.watapl&quot; rel=&quot;nofollow noreferrer&quot;&gt;Watcom APL&lt;/a&gt;, or &lt;a href=&quot;http://wotho.ethz.ch/mvt4apl-2.00/&quot; rel=&quot;nofollow noreferrer&quot;&gt;APL\360&lt;/a&gt;. Feel free to suggest additional languages along this theme.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The challenge had no previous answer in any of the above languages.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The challenge was posted no later than on 31 Dec 2021.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The answer was posted after this bounty was set (Feb. 6 2019).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Awarding the bounty will not cause my rep to be under 10000.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;strong&gt;Hint:&lt;/strong&gt; Bubbler's (amended) &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1668391/questions-eligible-for-apl-bounty-by-adam&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE query&lt;/a&gt; for eligible questions (has arbitrary filters and ordering — fork and edit if you want!)&lt;/p&gt;&#xA;&lt;p&gt;The amount will be doubled once for each of the following conditions that are met (or 500 whichever is less):&lt;/p&gt;&#xA;&lt;ol start=&quot;6&quot;&gt;&#xA;&lt;li&gt;&lt;p&gt;The answer is well explained (as judged by me)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It is the poster's first APL answer, but the poster is not a &amp;quot;︎ New contributor&amp;quot;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The answer wins the challenge when posted.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The answer is the first answer to the challenge.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Bounty list&lt;/h2&gt;&#xA;&lt;p&gt;Awarded bounties are &lt;del&gt;struck-through&lt;/del&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Bounties in progress are &lt;strong&gt;bold&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Bounties on hold are &lt;em&gt;italic&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If you have previously requested a bounty, add can add more requests after the struck-through ones, otherwise add add yourself to the below list to request a bounty.&lt;/p&gt;&#xA;&lt;p&gt;The format is:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;- [username](url-to-profile): [rep](url-to-answer-post), [rep](url-to-answer-post)&lt;/code&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/39328/lirtosiast&quot;&gt;lirtosiast&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/179605/39328&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/179606/39328&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/179603/39328&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/179676/39328&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/179673/39328&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/179656/39328&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/179755/39328&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/179736/39328&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/179720/39328&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/179684/43319&quot;&gt;200&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/179686/43319&quot;&gt;200&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/85183/voidhawk&quot;&gt;voidhawk&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/179587/43319&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/180747/43319&quot;&gt;200&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/179287/43319&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/179947/43319&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/180749/43319&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/181229/43319&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/181270/43319&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/181281/43319&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/181275/43319&quot;&gt;100&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/triticimagvs&quot;&gt;TRITICIMAGVS&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/179816/43319&quot;&gt;200&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/8328/ven&quot;&gt;Ven&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/180994/43319&quot;&gt;200&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/181532/43319&quot;&gt;200&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/181792/43319&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/181309/8328&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/184668/8328&quot;&gt;100&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;​&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/47581/sherlock9&quot;&gt;Sherlock9&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/183058/47581&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/180572/47581&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/180621/47581&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/180810/47581&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/191345/47581&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/191498/47581&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/194446/47581&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/194380/47581&quot;&gt;200&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/74163/j-sall%c3%a9&quot;&gt;J. Sallé&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/188622/74163&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/191169/74163&quot;&gt;100&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/196175/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/196373/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/196433/78410&quot;&gt;200&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/196651/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/196782/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/197156/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/197236/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/197495/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/197623/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/198057/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/198092/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/198590/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/199440/78410&quot;&gt;200&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/199608/78410&quot;&gt;400&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/199992/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/200068/78410&quot;&gt;400&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/200173/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/200177/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/200766/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/203183/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/203188/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/203223/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/203463/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/204383/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/204421/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/204640/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/205036/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/205038/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/205094/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/205224/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/205226/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/205227/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/205242/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/205245/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/205279/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/205974/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/206117/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/206251/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/206407/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/206483/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/206572/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/206591/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/206616/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/206650/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/206815/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/207079/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/207149/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/207370/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/207374/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/207380/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/207421/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/209137/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/209208/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210910/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/211086/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/211204/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/211568/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/212043/78410&quot;&gt;400&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/217579/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/217580/78410&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/231462/78410&quot;&gt;200&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/571/tessellatingheckler&quot;&gt;TessellatingHeckler&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/199379/571&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210619/571&quot;&gt;100&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/91097/mabel&quot;&gt;mabel&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/198900/91097&quot;&gt;100&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/75323/rgs&quot;&gt;RGS&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/199402/75323&quot;&gt;400&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/201756/75323&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/204193/75323&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/204209/75323&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/204211/75323&quot;&gt;200&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/211219/75323&quot;&gt;200&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/213924/75323&quot;&gt;100&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/41195/jperoutek&quot;&gt;JPeroutek&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/140357/modular-multiplicative-inverse/199633#199633&quot;&gt;200&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/79081/jeff-zeitlin&quot;&gt;Jeff Zeitlin&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/70847/this-challenge-makes-cents/200468#200468&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/137572/approximate-the-dottie-number/200801#200801&quot;&gt;100&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/92069/petstorm&quot;&gt;petStorm&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/127750/take-that-frown-and-turn-it-around/204133#204133&quot;&gt;100&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/26977/jarmex&quot;&gt;Jarmex&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/204346/26977&quot;&gt;400&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/204411/26977&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/204712/26977&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/205000/26977&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/205652/26977&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/205192/26977&quot;&gt;200&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/68261/fireflame241&quot;&gt;fireflame241&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/206773/68261&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/206998/68261&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/207042/68261&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/207340/68261&quot;&gt;200&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/207344/68261&quot;&gt;200&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/207377/68261&quot;&gt;200&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/207457/68261&quot;&gt;200&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/207598/68261&quot;&gt;200&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/9486/silvio-mayolo&quot;&gt;Silvio Mayolo&lt;/a&gt;:&lt;s&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/207451/9486&quot;&gt;200&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;:&lt;s&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/209779/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/209973/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/209974/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210038/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210199/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210258/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210264/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210389/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210417/80214&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210421/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210463/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210521/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210563/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210584/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210586/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210604/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210635/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210755/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210963/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210967/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210972/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/211014/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/211011/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/211010/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/211061/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/211131/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/211228/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/211223/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/211310/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/211264/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/211263/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/211259/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/211313/80214&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/211319/80214&quot;&gt;200&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/76162/jo-king&quot;&gt;Jo King&lt;/a&gt;:&lt;s&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/210871/76162&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210922/76162&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210928/76162&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/210932/76162&quot;&gt;100&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/95516/rak1507&quot;&gt;rak1507&lt;/a&gt;:&lt;s&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/211599/95516&quot;&gt;200&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/211728/95516&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/211676/95516&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/212116/95516&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/211731/95516&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/212223/95516&quot;&gt;200&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/217468/95516&quot;&gt;200&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/220227/95516&quot;&gt;200&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/220432/95516&quot;&gt;200&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/220818/95516&quot;&gt;200&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/95792/user&quot;&gt;user&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/215700/95792&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/215716/95792&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/216801/95792&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/216797/95792&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/216793/95792&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/216776/95792&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/216836/95792&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/216842/95792&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/216843/95792&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/216845/95792&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/216987/95792&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/230471/43319&quot;&gt;100&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/61379/kamila-szewczyk&quot;&gt;Kamila Szewczyk&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/216304/61379&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/216309/61379&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/216313/61379&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/216660/61379&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/216657/61379&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/216647/61379&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/216713/61379&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/216648/61379&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/216649/61379&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/216652/61379&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/216659/61379&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/216661/61379&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/216662/61379&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/216666/61379&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/216787/61379&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/216784/61379&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/216780/61379&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/216790/61379&quot;&gt;100&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/216840/61379&quot;&gt;100&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/64121/ovs&quot;&gt;ovs&lt;/a&gt;:&lt;s&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/215361/64121&quot;&gt;100&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/106959/fmbalbuena&quot;&gt;Fmbalbuena&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/240619/106959&quot;&gt;100&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/107299/s%ca%a8%c9%a0%c9%a0an&quot;&gt;Seggan&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/253709/107299&quot;&gt;200&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/239999/group-elements-by-their-displacement/254519#254519&quot;&gt;200&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/114446/the-thonnu&quot;&gt;The Thonnu&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/258268/114446&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/258684/114446&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/258691/114446&quot;&gt;100&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/91267/mukundan314&quot;&gt;Mukundan314&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/270056/91267&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/270066/91267&quot;&gt;100&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;[username](profile url): [amount](answer url),  [amount](answer url)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;APL resources&lt;/h2&gt;&#xA;&lt;h3&gt;On Code Golf Stack Exchange&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/info/52405/the-apl-orchard?tab=conversations&quot;&gt;APL Cultivation&lt;/a&gt; — 50 chat lessons on most APL subjects&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/52405/the-apl-orchard&quot;&gt;The APL&#xA;Orchard&lt;/a&gt;&#xA;— a very active APL chat room&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/17665/tips-for-golfing-in-apl&quot;&gt;Tips for golfing in&#xA;APL&lt;/a&gt; — lots of sophisticated ideas&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Other&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://aplcart.info&quot; rel=&quot;nofollow noreferrer&quot;&gt;APLcart&lt;/a&gt; — collection of APL phrases&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://aplwiki.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;APL Wiki&lt;/a&gt; — lots of info, including learning resources&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2024-02-20T17:12:07.520" LastActivityDate="2024-02-20T17:12:07.520" CommentCount="14" CommunityOwnedDate="2019-04-10T15:13:02.007" ContentLicense="CC BY-SA 4.0" />
  <row Id="17364" PostTypeId="2" ParentId="2140" CreationDate="2019-02-06T20:02:01.063" Score="0" Body="&lt;p&gt;Recently i made a post, but jumped the gun a little... I posted it before getting feedback and ended up getting it put on hold for being too arbitrary, but I have finally come here to get it properly fixed. Also I just got my Meta User fixed, so now I can post here!&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/179300/a-multipurpose-quine&quot;&gt;Link to original post&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/89081/discussion-on-question-by-krystostheoverlord-a-multipurpose-quine&quot;&gt;Link to chat where all of this is being discussed&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Basically I want to make the challenge where you create a quine that when given an input of 0 it outputs itself, and if given some other number it outputs a different quine.&#xA;For example, abc outputting abc if given 0, abc outputting gef if given 1, abc outputting qwerty when given 255 etc... The scoring will be based on how little bytes can be used and how many extra &lt;em&gt;different&lt;/em&gt; quines that it can output.&lt;/p&gt;&#xA;&lt;p&gt;The problem comes with defining what defines &lt;em&gt;different&lt;/em&gt; quine and how to balance the scoring so that coders will be encouraged to write short code, but still try to create different quines that aren't just altered copies of the original or each other&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Examples of what not to do&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;abc      //original&#xA;abcd     //output&#xA;abcabcabc//output&#xA;aabc     //output&#xA;aaabc    //output&#xA;aaabbbccc//output&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;stuff like this wouldn't be allowed, I just don't know how to turn that into a rule that can't be abused.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;What I want examples&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;abc      //original&#xA;gefh     //output&#xA;qwetryiop//output&#xA;uiop     //output&#xA;kerdp    //output&#xA;tttuiiree//output&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Basically all of the output quines are different from each other, nor are they similar&lt;/p&gt;&#xA;&lt;p&gt;And of course no examining source code.&lt;/p&gt;&#xA;" OwnerUserId="85185" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-02-06T20:02:01.063" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17365" PostTypeId="1" CreationDate="2019-02-06T21:43:44.563" Score="2" ViewCount="87" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/179300/a-multipurpose-quine&quot;&gt;A Multipurpose Quine&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge was closed for the reason that it was unclear what the challenge was asking. The main reason was that the challenge required all outputted quines to not be altercations of each other, which is impossible. The question was edited a few days ago, and clarified what makes a quine different from other quines. Due to that edit, I believe that the question now fits our standards and now can be reopened. What does the community think?&lt;/p&gt;&#xA;" OwnerUserId="84206" LastEditorUserId="31716" LastEditDate="2019-02-06T21:56:34.983" LastActivityDate="2019-02-06T21:56:34.983" Title="Should &quot;A Multipurpose Quine&quot; be reopened?" Tags="|discussion|specific-question|closed-questions|reopening|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17366" PostTypeId="1" CreationDate="2019-02-07T00:08:50.803" Score="7" ViewCount="229" Body="&lt;p&gt;Say I'm designing a new language for golf or some other esoteric purpose, and I'd like feedback on some design concepts. I feel posting this on SO, Programmers, CS, or pretty much any other site on SE would likely just going to get down-votes or at least side-eyes. Even if not, I think I'd likely get better responses from this community because what makes a good esolang is often &lt;em&gt;very&lt;/em&gt; different from what makes good general-purpose language (e.g. the Funge family).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would such a question be considered on-topic for PPCG?&lt;/p&gt;&#xA;" OwnerUserId="7548" LastActivityDate="2023-06-27T19:01:25.710" Title="Are esolang design questions on topic?" Tags="|discussion|languages|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17367" PostTypeId="1" CreationDate="2019-02-07T13:32:25.333" Score="27" ViewCount="2185" Body="&lt;h3&gt;Final phase&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You have chosen the categories and the nominees for PPCG's annual “Best of”. Now it is time to pick the winners!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each of the fourteen categories is represented by an answer to this question, and each of these answers contains all nominations by the members of our community.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Voting mechanism&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each nominee has been added as a comment to its category's answer. In each category, the nominee whose comment has the highest number of votes by May 11, 03:00 UTC will be declared the winner of that category.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Further details&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Starting now, please do &lt;strong&gt;not&lt;/strong&gt; edit the answers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Please do &lt;strong&gt;not&lt;/strong&gt; add comments to the answers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Votes on the question and on answers are meaningless; only votes on comments count.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Feel free to vote for multiple nominees of the same category, including your own posts.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="59487" LastEditorDisplayName="user45941" LastEditDate="2019-05-18T19:12:18.977" LastActivityDate="2019-05-18T19:12:18.977" Title="Cast your vote for “Best of PPCG 2018”!" Tags="|discussion|best-of|" AnswerCount="11" CommentCount="0" FavoriteCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17368" PostTypeId="2" ParentId="17367" CreationDate="2019-02-07T13:32:43.850" Score="9" Body="&lt;h1&gt;Best Explanation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This category is for the answer with the best explanation accompanying it. Ideally, the winner will be an answer with a very detailed explanation that is accessible to anyone, regardless of the amount of relevant knowledge already possessed.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/69/golf-you-a-quine-for-great-good/162904#162904&quot;&gt;Golf you a quine for great good!&lt;/a&gt; by Ørjan Johansen&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Self-Nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fueue is a very much not golfy esolang whose unique queue-based control flow makes it close to write-only even when you know it – and that's &lt;em&gt;before&lt;/em&gt; trying to golf it anyhow.  Also, it doesn't have any string literals, making a quine complicated.  So when I tried to explain my quine, it naturally got way out of hand.  Whether I succeeded in making it understandable is up to you to decide.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/177553/58563&quot;&gt;A spiral sequence&lt;/a&gt; by Arnauld&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Self-Nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Despite a concise definition, this challenge involves a rather sophisticated sequence based on a spiral of numbers on a hexagonal tiling. Once my code was golfed enough, I realized that it had become quite difficult to explain. In order to make the description -- hopefully -- pleasant to read and easier to understand, I've tried to alternate between diagrams, explanations and commented pieces of code of reasonable size.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="58563" LastEditDate="2019-02-18T21:09:16.733" LastActivityDate="2019-02-18T21:09:16.733" CommentCount="2" CommunityOwnedDate="2019-02-07T13:32:43.850" ContentLicense="CC BY-SA 4.0" />
  <row Id="17369" PostTypeId="2" ParentId="17367" CreationDate="2019-02-07T13:33:12.270" Score="8" Body="&lt;h2&gt;Wrong tool for the job&lt;/h2&gt;&#xA;&lt;p&gt;This category is for an answers that use the worst possible language to accomplish a task, while still making an effort to optimize the score. For example, writing a non-trivial program while using an extremely minimalist language like &lt;a href=&quot;https://esolangs.org/wiki/7&quot; rel=&quot;nofollow noreferrer&quot;&gt;7&lt;/a&gt;, or an inconvenient language like &lt;a href=&quot;https://esolangs.org/wiki/Lost&quot; rel=&quot;nofollow noreferrer&quot;&gt;lost&lt;/a&gt;, or even a normal language that's missing some crucial capability like internet connectivity or image processing.&lt;/p&gt;&#xA;&lt;p&gt;Answers for this category should consider both the difficulty of the task and the unsuitable-ness of the language.&lt;/p&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/162975/31347&quot;&gt;Scrabble Scorer&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31347/mickyt?tab=profile&quot;&gt;MickyT&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self Nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;With a view to get some more interest on this category, I am nominating this one for it.  I am sure I have come across better examples in the past year, but I can't locate them at the moment.&lt;/p&gt;&#xA;&lt;p&gt;I originally started it because someone mentioned in the comments, but Beatnik isn't a good language for many things and especially golfing.  It is a stack based language with limited support for numerical operations.  It proved to be reasonably challenging, especially for me :).&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It has add and subtract as numerical operations.  Fortunately this was enough for this challenge.&lt;/li&gt;&#xA;&lt;li&gt;There is no way to output a number, only characters can be output.  This means either breaking a number into it's digits and outputting the characters for them, or as in my case outputting unary.&lt;/li&gt;&#xA;&lt;li&gt;The stack manipulation commands are limited to push, pop and swap.  This makes keeping a accumalated value on the stack diffucult.  Outputting unary also helped avoid this.&lt;/li&gt;&#xA;&lt;li&gt;It has &amp;quot;if&amp;quot; commands that allow you to skip backward or forward in the code on 0 or not 0 values.  This made the program logic a bit horrible.  The end of the program has 10 output &amp;quot;1&amp;quot; commands.  When the character is determined the program will skip forward &lt;i&gt;n&lt;/i&gt; words to the appropriate point in the output commands.  The program then skips back a ton of words to the beggining.&lt;/li&gt;&#xA;&lt;li&gt;If input is called for and not found it will error.  Fortunately you are allowed to end on an error and it was not a bad way to finish this program.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The only thing that made this language suitable for this challenge was that it relies on the scrabble scores of the words in the program to determine the commands done.  Debugging it wasn't a very pleasant task.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-02-17T22:30:40.113" CommentCount="1" CommunityOwnedDate="2019-02-07T13:33:12.270" ContentLicense="CC BY-SA 4.0" />
  <row Id="17370" PostTypeId="2" ParentId="17367" CreationDate="2019-02-07T13:33:32.707" Score="9" Body="&lt;h1&gt;Best mathematical insight&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;On this site we often see answers in languages specifically designed for short code, or designed to be fast. Sometimes, a nice golfing trick or speed-up technique surprises us with its ingenuity, beyond the standard use of that language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And occasionally an answer shows up that uses an unexpected approach to greatly simplify the problem, and makes us wonder how the author could ever think of that. This usually involves some far-from-obvious mathematical equivalence, or a particularly simple approach to the problem that was not evident at all (once revealed, other answers often follow the same approach).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This category is for the answer with the best &lt;strong&gt;mathematical&lt;/strong&gt; insight or unexpected approach that led to greatly simplifying the problem, in &lt;strong&gt;any challenge type&lt;/strong&gt; (code golf, fastest code, or others). The insight should have led to a significant improvement according to the challenge's metric (code length, run time, or whatever applicable).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/163708/78410&quot;&gt;Triangular Lattice Points close to the Origin&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/20260/xnor&quot;&gt;xnor&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Bubbler&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To quote xnor's comment, &quot;My proof is an epic journey through plane geometry, Eisenstein integers, factorization over number fields, quadratic reciprocity, arithmetic progressions, and interchanging summations -- all for such a simple expression.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It was so epic that he didn't give the proof himself; instead he put a +500 bounty for the proof that his solution is correct. &lt;a href=&quot;https://codegolf.stackexchange.com/users/3852/lynn&quot;&gt;Lynn&lt;/a&gt; came up with a &lt;a href=&quot;https://codegolf.stackexchange.com/a/164474/78410&quot;&gt;proof&lt;/a&gt;, and you can read &lt;a href=&quot;https://codegolf.stackexchange.com/users/194/peter-taylor&quot;&gt;Peter Taylor&lt;/a&gt;'s more &lt;a href=&quot;https://codegolf.stackexchange.com/questions/163704/triangular-lattice-points-close-to-the-origin#comment398389_163708&quot;&gt;self-contained proof&lt;/a&gt; too. As the one who wrote this challenge, I'm still amazed when I read these proofs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Incidentally, xnor's solution is the shortest among all solutions written in any practical programming language, and it even beats two Mathematica solutions.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/167377/78410&quot;&gt;Nonogram line brute-force solving&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/81225/crashoz&quot;&gt;crashoz&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Bubbler&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unlike the solution on Triangular Lattice Points (which uses deep knowledge in number theory), this one is pure logic and careful analysis of the problem that led to very short and elegant solution. The astounding fact is that this is &lt;strong&gt;short &lt;em&gt;and&lt;/em&gt; fast&lt;/strong&gt;; by eliminating a branch of recursion, it achieves linear time complexity from an otherwise exponential algorithm.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/153797/52210&quot;&gt;The first n numbers without consecutive equal binary digits&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/17602/neil&quot;&gt;Neil&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Kevin Cruijssen&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge states the following: &quot;&lt;em&gt;The sequence contains the decimal representation of the binary numbers of the form: 10101..., where the n-th term has n bits.&lt;/em&gt;&quot;&lt;br&gt;&#xA;Reading this, the first approach that comes to mind is using the binary representations themselves. But no, &lt;em&gt;@Neil&lt;/em&gt;'s insight and approach was simply brilliant, without using any binary builtin at all. By using &lt;span class=&quot;math-container&quot;&gt;\$\frac{2}3\$&lt;/span&gt; (having a binary representation of &lt;code&gt;0.101010101...&lt;/code&gt;), multiplied by 2 to the power of the input-integer &lt;code&gt;n&lt;/code&gt;, his approach was not only mathematically genius in its simplicity, but even short enough to be used by multiple other answers (even golfing languages like 05AB1E) to save bytes.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="52210" LastEditDate="2019-02-07T17:58:32.503" LastActivityDate="2019-02-07T17:58:32.503" CommentCount="3" CommunityOwnedDate="2019-02-07T13:33:32.707" ContentLicense="CC BY-SA 4.0" />
  <row Id="17371" PostTypeId="2" ParentId="17367" CreationDate="2019-02-07T13:33:56.030" Score="8" Body="&lt;h1&gt;Rookie of the Year - Answers&lt;/h1&gt;&#xA;&lt;p&gt;For the best answer by someone who hasn't submitted an answer prior to 2018 (i.e., not necessarily a new user, but just someone who's a new answer writer). &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/970822/2018-answers-by-users-with-no-answers-before-2018&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE query&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/153218/52210&quot;&gt;Write Moby Dick, approximately&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/49643/a-rex&quot;&gt;A. Rex&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Kevin Cruijssen&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;At time of writing this is A. Rex' only answer thus far, with currently 83 upvotes. But not only that, it's also the only of (currently) 21 answers to have a score below 500,000 for this challenge. An impressive display worthy to be nominated here.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-02-11T10:16:19.997" CommentCount="1" CommunityOwnedDate="2019-02-07T13:33:56.030" ContentLicense="CC BY-SA 4.0" />
  <row Id="17372" PostTypeId="2" ParentId="17367" CreationDate="2019-02-07T13:34:39.203" Score="4" Body="&lt;h1&gt;SGITW (Slowest Gun in the West)&lt;/h1&gt;&#xA;&lt;p&gt;For the best 2018 answer in a challenge which received no answers within 48 hours of posting. The challenge itself does not need to be from 2018 and the nominated answer doesn't need to be the first answer to the challenge, but the first answer to the challenge does need to be from 2018. Tips questions are not counted for this category.&lt;/p&gt;&#xA;&lt;p&gt;It's very easy to get drawn to the fast-rising HNQ-hitting questions with a plethora of answers, so I thought this would be a good way to bring attention to answers that really needed to earn their love. &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/970899/2018-slowest-gun-in-the-west&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE Query&lt;/a&gt;, &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/971509/2018-slowest-gun-in-the-west&quot; rel=&quot;nofollow noreferrer&quot;&gt;with the delays in days&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/162226/31716&quot;&gt;Google's Hopping Bunny&lt;/a&gt;, by DJMcMayhem&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self Nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is one of my favorite answers. It was a very fun project, and it felt a lot more like a coding-project rather than a quick code-golf. It took me a long time to find enough heuristics to make a brute-force solution possible, so about half the time I spent on that answer was just looking for ways to speed it all up/remove redundant programs.&lt;/p&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/157146/52210&quot;&gt;Evaluate expressions with significant figures&lt;/a&gt;, by &lt;a href=&quot;https://codegolf.stackexchange.com/users/52210/kevin-cruijssen&quot;&gt;Kevin Cruijssen&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The challenge was posted in August 2016, without any answers. At the time I was challenging myself to post answers for challenges that didn't had any answers yet. Of course, most of those challenges were pretty hard (as their reason for being unanswered), but it was fun figuring it out regardless.&lt;/p&gt;&#xA;&lt;p&gt;My favorite &lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/59/revival?userid=52210&quot;&gt;revival of the few I did&lt;/a&gt; was this one. Due to the rules, it had an extreme amount of edge-cases the program had to implement in order to get the correct answer for all possible inputs. Therefore it took quite a while to complete my answer for this, with loads of substeps: understanding the challenge (I had to read and check it a few times before I fully grasped what was being asked and how the test cases worked); writing an answer; fixing edge cases; writing the answer and explanation; fixing some minor bugs; golfing, golfing, golfing. I'm not sure anymore how much time I spend on this challenge, but it was certainly a mixture of fun and frustration along the way.&lt;/p&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/170702/76162&quot;&gt;Cyclic Levenquine&lt;/a&gt; by Jo King&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-Nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The most highly voted unanswered challenge, a lot of people thought that the question was simply impossible using existing languages.&#xA;Over a year later, I posted an answer using Gol&amp;gt;&amp;lt;&amp;gt;, a rather versatile 2D language, which makes quining easier.&#xA;It was still a very difficult challenge, that involved designing a way of changing the behaviour of a program through single character changes, creating distinct character-wise programs and a way of translating between the two in a way that didn't repeat any more characters.&lt;/p&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/26561/confound-my-attempts-to-solve-the-halting-problem/152406#152406&quot;&gt;Confound my attempts to solve the halting problem&lt;/a&gt; by Jo King&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-Nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Another hard challenge that has gone without a valid answer for a long time (almost 4 years!). The submission was an implementation of a rough proof of the unsolvability of the halting problem in a Turing complete language, which of course I took to mean the easiest language to code in, brainfuck.&#xA;The final program ended up a mash-up of a quine and a self-interpreter, both hard projects in of themselves.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-02-12T10:04:14.267" CommentCount="4" CommunityOwnedDate="2019-02-07T13:34:39.203" ContentLicense="CC BY-SA 4.0" />
  <row Id="17373" PostTypeId="2" ParentId="17367" CreationDate="2019-02-07T13:34:59.627" Score="3" Body="&lt;h1&gt;Best Above-and-Beyond Answer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Every once in a while, an answer takes the challenge to the extreme. This prize will be awarded to an answer which went far beyond the expectations of the challenge. This could include&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a code golf answer that brute-forced/proved the shortest program in some language&lt;/li&gt;&#xA;&lt;li&gt;a graphical-output popcon answer of extreme size and quality&lt;/li&gt;&#xA;&lt;li&gt;a KOTH answer of high complexity which absolutely dominated the competition&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/174405/78410&quot;&gt;Maximize Sudoku King's tour&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/39242/anders-kaseorg&quot;&gt;Anders Kaseorg&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Bubbler&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When I wrote this challenge, I expected it to take forever, at least days, to find the true optimum. Anders smashed my dream in just four hours after posting the challenge.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/176925/31716&quot;&gt;Fastest Mini-Flak Quine&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/84332/ais523s-temporary-account&quot;&gt;ais523's temporary account&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by DJMcMayhem&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Brain-flak is an inconvenient language to use, akin in spirit to brain-fuck. Mini-flak is a minimalist variation of brain-flak that has the minimum number of brain-flak commands needed for Turing completeness (and also half as much data storage). With no string capabilities, it's not exactly a language built for quining. However, that doesn't stop people from using it for quines. Up until this point, the fastest mini-flak quine took about 30 minutes to run in the standard interpreter. ais523 got this down to 20 seconds on TIO. This is a very impressive answer.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="31716" LastEditDate="2019-02-13T17:10:13.080" LastActivityDate="2019-02-13T17:10:13.080" CommentCount="2" CommunityOwnedDate="2019-02-07T13:34:59.627" ContentLicense="CC BY-SA 4.0" />
  <row Id="17374" PostTypeId="2" ParentId="17367" CreationDate="2019-02-07T13:35:21.153" Score="7" Body="&lt;h1&gt;Kansas City Shuffle&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Too often, once someone devises a generic golfy method of solving a challenge, most people will use that method for their answers. This award goes to those answers that utilize an alternative method as a better solution than the method that the majority of other answers use (prior to the posting of the rewarded answer).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/169376/60043&quot;&gt;Remove surrounding zeroes of a 2d array&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/60043/junghwan-min&quot;&gt;JungHwan Min&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This was arguably the most absurd solution I've ever written, abusing the specification of the built-in Mathematica function &lt;a href=&quot;https://reference.wolfram.com/language/ref/CellularAutomaton.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;CellularAutomaton&lt;/code&gt;&lt;/a&gt; (my favorite) to get a shorter solution than the general golfy solution, which was already quite short. Most golfy submissions implemented an algorithm that removes rows and columns whose sums are zero (and of course, this is not a difficult task for Mathematica). And as a cherry on top, this solution turned out to be 42 bytes!&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="60043" LastEditDate="2019-02-08T04:07:36.060" LastActivityDate="2019-02-08T04:07:36.060" CommentCount="1" CommunityOwnedDate="2019-02-07T13:35:21.153" ContentLicense="CC BY-SA 4.0" />
  <row Id="17375" PostTypeId="2" ParentId="17367" CreationDate="2019-02-07T13:35:36.407" Score="17" Body="&lt;h1&gt;Rookie of the Year - Challenges&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For the best challenge written by someone who has not written a challenge prior to 2018 (i.e., not necessarily a new user, just a new challenge writer). &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/970897/2018-questions-by-users-with-no-questions-before-2018&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE query&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/171168/without-using-numbers-get-the-highest-salary-you-can-but-dont-exaggerate&quot;&gt;Without using numbers, get the highest salary you can. But don&amp;#39;t exaggerate!&lt;/a&gt;, by &lt;a href=&quot;https://codegolf.stackexchange.com/users/77736/nicola-sap&quot;&gt;Nicola Sap&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Shieru Asakoto&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Asked in August 2018 as Nicola's first challenge post, within days the challenge attracted dozens of answers and hundreds of upvotes. (Now the challenge has 5 pages of answers and a net score of +205.) Most if not all of his reputation points gained are from that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I remember that there was a category for the best &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; scoring system in BoPPCG 2017. This may also as well be one of the candidates. The scoring system of this challenge restricts the maximum score obtainable with number of bytes, thus answers to that must have gone through a series of adjustments and optimizations.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="52210" LastEditDate="2019-02-11T09:49:43.540" LastActivityDate="2019-02-11T09:49:43.540" CommentCount="1" CommunityOwnedDate="2019-02-07T13:35:36.407" ContentLicense="CC BY-SA 4.0" />
  <row Id="17376" PostTypeId="2" ParentId="17367" CreationDate="2019-02-07T13:36:01.613" Score="6" Body="&lt;h1&gt;Most elegant spec&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Writing an interesting challenge is tough, not just in thinking up a good idea, but in specifying it clearly enough without taking pages of text. This category is for challenges whose specification is a pleasure to read, summing up exactly what is required succinctly and unambiguously.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/176251/the-hungry-mouse&quot;&gt;The Hungry Mouse&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58563/arnauld&quot;&gt;Arnauld&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by xnor&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A tight, clear spec beautifully illustrated with a LaTeX diagram featuring a cute mouse. Every time I started to have a question while reading the spec, it was immediately answered by the next bit of text.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="20260" LastEditDate="2019-02-11T00:33:38.647" LastActivityDate="2019-02-11T00:33:38.647" CommentCount="1" CommunityOwnedDate="2019-02-07T13:36:01.613" ContentLicense="CC BY-SA 4.0" />
  <row Id="17377" PostTypeId="2" ParentId="17367" CreationDate="2019-02-07T13:36:19.140" Score="5" Body="&lt;h2&gt;Breaking The Mold (Most Original Challenge)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It's really easy to come up with normal code-golf and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;, or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; challenge, etc. Don't get me wrong, there's nothing wrong with these challenges. They're the meat of the challenges on our site. However, they're not the most imaginative. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This category is for a challenge that re-invents the wheel, and explores new ideas that we haven't really used on the site.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Maybe this challenge inspired a new tag, or category of challenges?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Maybe it's a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; with a unique and very well balanced scoring formula?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Or maybe it's even a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge about a novel task. This category is for rewarding users who came up with interesting ideas that keep the site fresh.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/174397/78410&quot;&gt;Maximize Sudoku King's tour&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is probably the first &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; to ask directly for the optimized solution, rather than some score combined with code length or such. I took extra care on the &quot;winning criterion&quot; section to encourage competition without time limit. Unfortunately, it was beat by &lt;a href=&quot;https://codegolf.stackexchange.com/users/39242/anders-kaseorg&quot;&gt;Anders Kaseorg&lt;/a&gt; with the &lt;a href=&quot;https://codegolf.stackexchange.com/a/174405/78410&quot;&gt;optimal solution&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/171884/61384&quot;&gt;Overlapping Polyglots&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/61384/esolanging-fruit&quot;&gt;Esolanging Fruit&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is novel in that it's the only challenge on the site tagged as both &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;. This is because each answer serves as both a cop and a robber - it cracks the previous answer by discovering what language it is written in, and polyglots it with a mystery language for the next answer to find. This challenge is similar in principle to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/155018/the-programming-language-quiz-mark-ii-cops&quot;&gt;The Programming Language Quiz, Mark II&lt;/a&gt;, but it places more of an emphasis on pure obfuscation as it has no &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; element. Unlike many &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;, the challenge has no end; the winning answer is simply the one that survives the longest before being cracked. The current winning answer was &lt;a href=&quot;https://codegolf.stackexchange.com/a/179406/61384&quot;&gt;recently cracked&lt;/a&gt;, which is what reminded me of this challenge.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/154617/design-a-one-instruction-set-computer&quot;&gt;Design a One Instruction Set Computer!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/61563/md-xf&quot;&gt;MD XF&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by BMO&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We rarely get &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contests&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contests&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contests&lt;/a&gt; which don't get closed, in 2018 there were 3 such challenges, one of which I nominate here. This challenge asked for an OISC to be invented and implemented. This is one of the challenges in 2018 that I enjoyed the most.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It requires a genuinely interesting approach at designing a new programming language (the OISC part), but also requires the submissions to be creative (the pop-con part). This challenge thus created (unfortunately only) 4 new, novel and interesting programming languages which is in my opinion worthy of a bounty.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="48198" LastEditDate="2019-02-18T22:48:10.250" LastActivityDate="2019-02-18T22:48:10.250" CommentCount="3" CommunityOwnedDate="2019-02-07T13:36:19.140" ContentLicense="CC BY-SA 4.0" />
  <row Id="17378" PostTypeId="2" ParentId="17367" CreationDate="2019-02-07T13:36:38.653" Score="9" Body="&lt;h1&gt;Most helpful commenter&lt;/h1&gt;&#xA;&lt;p&gt;One of the things that stands out about this community is that although it's highly competitive, there is nearly always someone on hand to offer advice both on improving challenges and improving answer scores. It's part of what made this site seem so welcoming to me.&lt;/p&gt;&#xA;&lt;p&gt;In recognition of this, nominees should be people who have helped others improve and made them feel welcome, whether by direct comments on challenges and answers, or in comments in chat.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/52210/kevin-cruijssen?tab=activity&amp;amp;sort=comments&quot;&gt;Kevin Cruijssen&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Not sure if self-nomination is appropriate here or not, but I figured I'd add it anyway. I help new users pretty often. If new users has attempted to golf their code, I usually add a comment with some additional golfs, and explain what I've changed and why. I also link to the relevant tip pages, which are always &lt;a href=&quot;https://codegolf.stackexchange.com/questions/5285/tips-for-golfing-in-all-languages&quot;&gt;Tips for golfing in all languages&lt;/a&gt; and the used programming language tip page. And if anyone has any questions regarding an answer I posted, or a golfing suggestion I've made, I'll try to explain it to my best ability.&lt;br /&gt;&#xA;Here some examples of those kind of comments: &lt;a href=&quot;https://codegolf.stackexchange.com/a/178477/52210&quot;&gt;C# .NET answer by &lt;em&gt;@Destroigo&lt;/em&gt;&lt;/a&gt;; &lt;a href=&quot;https://codegolf.stackexchange.com/a/179116/52210&quot;&gt;Swift answer by &lt;em&gt;@Roman Podymov&lt;/em&gt;&lt;/a&gt;; etc. EDIT: Realized those comments are from January of this year instead of last year.. So here some alternatives: &lt;a href=&quot;https://codegolf.stackexchange.com/a/175526/52210&quot;&gt;Dart answer by &lt;em&gt;@Elcan&lt;/em&gt;&lt;/a&gt;; &lt;a href=&quot;https://codegolf.stackexchange.com/a/174900/52210&quot;&gt;C# .NET answer by &lt;em&gt;@Meerkat&lt;/em&gt;&lt;/a&gt;; &lt;a href=&quot;https://codegolf.stackexchange.com/a/176783/52210&quot;&gt;new user asking about Java I/O rules on my own answer&lt;/a&gt;; &lt;a href=&quot;https://codegolf.stackexchange.com/a/173141/52210&quot;&gt;C# .NET answer by &lt;em&gt;@Epicness&lt;/em&gt;&lt;/a&gt;; etc.&lt;/p&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/67312/giuseppe?tab=activity&amp;amp;sort=comments&quot;&gt;Giuseppe&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by MickyT&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;There are so many people that are deserving of this award, but for me I think Giuseppe deserves this award.  Giuseppe's comments are always respectful and helpful.  For a number of answers that I and other users have done, especially in R, he has made very useful comments and provided some very good insights.  The comments that Giuseppe makes on challenges are always positive and helpful.&lt;/p&gt;&#xA;&lt;p&gt;A simple &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=giuseppe&quot;&gt;search&lt;/a&gt; demonstrates quite nicely the number of helpful comments made by Giuseppe.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-02-14T18:53:20.673" CommentCount="2" CommunityOwnedDate="2019-02-07T13:36:38.653" ContentLicense="CC BY-SA 4.0" />
  <row Id="17383" PostTypeId="2" ParentId="2140" CreationDate="2019-02-08T01:06:58.847" Score="0" Body="&lt;h1&gt;Is This Randomizer Seed Beatable?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graph&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graph&amp;#39;&quot; rel=&quot;tag&quot;&gt;graph&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Randomizers of Pokemon, Zelda, Metroid games (among other games) have gained a lot of popularity in the last few years within the speedrunning community. Basically these are programs that shuffle around items, Pokemon, and even cosmetic things in a ROM of the game. It gives speedrunners a new and exciting challenge for a game they have played perhaps hundreds of times since items affect progression and can lead them to play the game very differently.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Randomizers also have logic that prevents them from making unbeatable configurations. We'll be looking at a simple, but generalized, form of this logic in this challenge.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge Explanation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You will be given a list of rules as input describing some game world and its item requirements and a list of item locations. Your task is to determine if the item locations represent a beatable seed within the rules.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;World Rules&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The rules are a list of required items for accessing a location. A required item may have an associated quantity. For example, a simplified sampling of Super Metroid:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[] =&amp;gt; Morph&#xA;[Morph] =&amp;gt; BlueBrinstarBottomMissiles&#xA;[Missiles, Morph] =&amp;gt; Bombs&#xA;[HighJump] =&amp;gt; BlueBrinstarETank&#xA;[Morph, Bombs] =&amp;gt; CrateriaDescentETank&#xA;...&#xA;[Supers, HighJump, Morph, Bombs] =&amp;gt; Kraid&#xA;[Kraid] =&amp;gt; Varia&#xA;[Varia] =&amp;gt; Speed&#xA;[Varia, Speed] =&amp;gt; IceBeam&#xA;...&#xA;[Kraid, Phantoon, Draygon, Ridley, Morph, IceBeam, Charge, 3 Missiles, 3 Supers, 3 ETank, Varia, Gravity] =&amp;gt; END&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It's possible for a location to be reachable by different sets of requirements. Conceptually, this means that any one set of requirements. Here's an example from Zelda: Ocarina of Time (referencing some glitches):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[DekuTreeBeaten] =&amp;gt; ForestExit&#xA;[Stick] =&amp;gt; ForestExit&#xA;[Nut] =&amp;gt; ForestExit&#xA;[KokiriSword, DekuShield] =&amp;gt; ForestExit&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Keep in mind that the right hand side of the rules list in my example is actually a location id, not an item id. The special location id &lt;code&gt;END&lt;/code&gt; indicates the ability to beat the game with those items.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Item Locations&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You will receive a mapping of location IDs and which item they contain. For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;KokiriSwordChest: HeartPiece&#xA;MidoHouse1: Hookshot&#xA;MidoHouse2: 5Rupees&#xA;...&#xA;DampeDig: ForestTempleBossKey&#xA;DampeRace1: NayrusLove&#xA;DampeRace2: HeartPiece&#xA;...&#xA;GoldGauntletsChest: DoubleMagic&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;What does it mean to be beatable?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A player begins a game with no items. If it is possible for the player to, through the continued acquisition of available items, reach the &lt;code&gt;END&lt;/code&gt; location, then the seed is beatable. It doesn't matter if all items are obtainable as long as the &lt;code&gt;END&lt;/code&gt; location is reachable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This maps to a variant of graph reachability problems which can be solved relatively easily with a breadth-first search. (Other approaches may work as well)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Simple example (beatable)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;World Rules:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[] =&amp;gt; SwordChest&#xA;[] =&amp;gt; ShieldChest&#xA;[Sword, Shield] =&amp;gt; FireballScroll&#xA;[Fireball] =&amp;gt; IceBeamScroll&#xA;[Fireball, Sword] =&amp;gt; LightningScroll&#xA;[Fireball, IceBeam, Lightning] =&amp;gt; END&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Item Locations:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;SwordChest: Fireball&#xA;ShieldChest: Sword&#xA;FireballScroll: Shield&#xA;IceBeamScroll: Lightning&#xA;LightningScroll: IceBeam&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This seed is beatable with this item order: Fireball, Sword, Lightning, IceBeam. It's impossible to get the Shield because it's locked behind the FireballScroll which requires the Shield. But that doesn't matter because the &lt;code&gt;END&lt;/code&gt; only requires the three elemental spells.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Simple example (unbeatable)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;World Rules:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[] =&amp;gt; SwordChest&#xA;[] =&amp;gt; ShieldChest&#xA;[Sword, Shield] =&amp;gt; FireballScroll&#xA;[Fireball, Shield] =&amp;gt; IceBeamScroll&#xA;[Fireball, Sword] =&amp;gt; LightningScroll&#xA;[Fireball, IceBeam, Lightning] =&amp;gt; END&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Item Locations:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;SwordChest: Fireball&#xA;ShieldChest: Shield&#xA;FireballScroll: Sword&#xA;IceBeamScroll: Lightning&#xA;LightningScroll: IceBeam&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This seed is unbeatable because Lightning is required, but is locked behind the Ice Beam Scroll, which requires the sword, which in turn is locked behind the Fireball Scroll, which itself requires the sword to access.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;More test cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;More test cases can be found &lt;a href=&quot;https://gist.github.com/Beefster09/37f9595a5d37bb6df72091d6f130e419&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Other Notes and Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can accept the world rules and the item locations in any convenient format or representation, given these restrictions:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When multiples of one item are in a requirements list, you can represent it by repeating that item multiple times &lt;em&gt;or&lt;/em&gt; by having a quantity and item id.&lt;/li&gt;&#xA;&lt;li&gt;Both item and location ids must be taken in as alphanumeric strings. (i.e. no converting it to numbers or other more convenient values before passing it into your program/function)&lt;/li&gt;&#xA;&lt;li&gt;The sentinel value for the &quot;beating the game&quot; location id &lt;em&gt;must&lt;/em&gt; be &lt;code&gt;END&lt;/code&gt;, all caps, three letters.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Item and location ids are case sensitive and must match exactly between the two inputs to be considered the same item or location&lt;/li&gt;&#xA;&lt;li&gt;Each location can be reached only once, even if it is reachable from multiple sets of requirements&lt;/li&gt;&#xA;&lt;li&gt;You may assume that every location id on the locations list appears at least once on the rules list and that there is at least one &lt;code&gt;END&lt;/code&gt; in the rules list&lt;/li&gt;&#xA;&lt;li&gt;You may assume that each location id on the locations list appears exactly once and contains exactly one item.&lt;/li&gt;&#xA;&lt;li&gt;There is no concept of one-way doors that block off access to previously accessible locations. The requirements list is unordered.&lt;/li&gt;&#xA;&lt;li&gt;Location ids and item ids are separate and distinct. For instance, &lt;code&gt;Morph&lt;/code&gt; as a location is different from &lt;code&gt;Morph&lt;/code&gt; as an item.&lt;/li&gt;&#xA;&lt;li&gt;Output a truthy value for a beatable seed and a falsy value for an unbeatable seed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Happy golfing!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Sandbox: there's a lot here. Any suggestions for explaining things better? Should I add more test cases?&lt;/p&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2019-02-14T22:06:30.940" LastActivityDate="2019-02-14T22:06:30.940" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17384" PostTypeId="2" ParentId="2140" CreationDate="2019-02-08T03:49:08.730" Score="1" Body="&lt;h1&gt;Gregorian-Hijri(Islamic) Calendar Conversion &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/calendar&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;calendar&amp;#39;&quot; rel=&quot;tag&quot;&gt;calendar&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Islamic_calendar&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hijri, or Islamic calendar&lt;/a&gt; is a lunar calendar used in the Islamic countries to determine the dates of traditional events. The year in the Hijri calendar is usually denoted &lt;strong&gt;AH xxxx&lt;/strong&gt;. The Hijri calendar has an epoch on 16 July 622 on Julian calendar.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Like other lunar calendars, in the Hijri calendar a year consists of 12 months, each month consists of 29 or 30 days. A year is thus 354 days, or in leap years there are 355. On average there are 11 leap years every 30 years. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is a &lt;a href=&quot;https://en.wikipedia.org/wiki/Tabular_Islamic_calendar&quot; rel=&quot;nofollow noreferrer&quot;&gt;tabular variant&lt;/a&gt; which uses arithmetic calculations in place of astronomical observations to determine the dates. There is also a &lt;a href=&quot;https://en.wikipedia.org/wiki/Solar_Hijri_calendar&quot; rel=&quot;nofollow noreferrer&quot;&gt;solar version&lt;/a&gt; of the Hijri calendar, which is used in Iran and Afghanistan.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge, only the tabular variant will be discussed.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The tabular Hijri calendar&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;All western dates below will be shown in (possibly proleptic) Gregorian even if the date is before 15 October 1582.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are 12 months in each year in the Hijri calendar, with alternating 29- or 30-day periods. The odd months have 30 days, and the even months have 29 days (except for the 12th month &lt;em&gt;Dhu al-Hijjah&lt;/em&gt; in leap years which also has 30 days). The month names are as follows (according to this &lt;a href=&quot;https://en.wikipedia.org/wiki/Template:Muslimmonths&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia template&lt;/a&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#    Name              Number of days&#xA;1    Muharram          30&#xA;2    Safar             29&#xA;3    Rabi' al-awwal    30&#xA;4    Rabi' al-Thani    29&#xA;5    Jumada al-awwal   30&#xA;6    Jumada al-Thani   29&#xA;7    Rajab             30&#xA;8    Sha'ban           29&#xA;9    Ramadan           30&#xA;10   Shawwal           29&#xA;11   Dhu al-Qidah      30&#xA;12   Dhu al-Hijjah     29 / 30 (in leap years only)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There are 11 leap years every 30 years. There are 3 versions to determine the leap years, but the most common version is to set the years with &lt;span class=&quot;math-container&quot;&gt;\$y\in\{2,5,7,10,13,16,18,21,24,26,29\}(\text{mod }30)\$&lt;/span&gt; as leap years. (Be reminded that the calendar stars from year 1.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Hijri calendar has its first day (i.e. 1 &lt;em&gt;Muharram&lt;/em&gt; 1) on 19 July 622.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an example, we now convert the date 8 February 2019 into Hijri (Here we define a cycle to be 30 years):&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Date: 8 February 2019&lt;/li&gt;&#xA;&lt;li&gt;Dates from the Epoch: &lt;span class=&quot;math-container&quot;&gt;\$1396 \times 365 + 339 + 166 + 38 = 510083\$&lt;/span&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are 1396 (&lt;span class=&quot;math-container&quot;&gt;\$2019 - 623\$&lt;/span&gt;)  full years, so &lt;span class=&quot;math-container&quot;&gt;\$1396 \times 365\$&lt;/span&gt; days&lt;/li&gt;&#xA;&lt;li&gt;There are 339 (&lt;span class=&quot;math-container&quot;&gt;\$349 - 14 + 4\$&lt;/span&gt;) leap years between 2 dates&lt;/li&gt;&#xA;&lt;li&gt;There are 166 days between 19 June 622 to 1 January 623, and 38 days between 1 January 2019 to 8 February 2019&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Cycle: &lt;span class=&quot;math-container&quot;&gt;\$510083 \div 10631 = 47\text{ (cycles) and }10426\text{ (days)}\$&lt;/span&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;One ordinary year is 354 days and there are 11 leap years in a 30-year cycle, so total days in a cycle is &lt;span class=&quot;math-container&quot;&gt;\$354\frac{11}{30} \times 30 = 10631\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$10427 - (354 \times 29 + 11) = 150\$&lt;/span&gt;, so this this is the 150th day of the 30th year in the 48th cycle, which is &lt;span class=&quot;math-container&quot;&gt;\$47 \times 30 + 30 = \text{(AH) }1440\$&lt;/span&gt;.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The subtraction has 18 &lt;span class=&quot;math-container&quot;&gt;\$354\$&lt;/span&gt;s and 11 &lt;span class=&quot;math-container&quot;&gt;\$355\$&lt;/span&gt;s, but there is not enough space to write it all.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$150 - 30 - 29 - 30 - 29 - 30 = 2\$&lt;/span&gt;, so this is the 2nd day of the 6th month in the year AH 1440.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;As a result the complete Hijri date of 8 February 2019 is 2 &lt;em&gt;Jumada al-Thani&lt;/em&gt; 1440.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that converts the (Gregorian) input date into the corresponding Hijri date. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program or function may receive the input date in any reasonable format, but it must output the Hijri date in the format of &lt;code&gt;[date] [month name] [year]&lt;/code&gt;. The italics above shall be ignored. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input month and day may be 0-indexed for convenience, but you must state so if you use this convention.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may assume that the input is always a valid Gregorian date, and is always not earlier than the Gregorian epoch of the calendar, 19 July 622.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sample I/O&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:  &quot;19 July 622&quot; / &quot;622-7-19&quot; / [622, 7, 19] / (622, 6, 19) (0-indexed month)&#xA;Output: &quot;1 Muharram 1&quot; (The epoch date)&#xA;&#xA;Input:  &quot;8 February 2019&quot; / &quot;2019-2-8&quot; / [2019, 2, 8] / (2019, 1, 8) (0-indexed month)&#xA;Output: &quot;2 Jumada al-Thani 1440&quot; (The example date)&#xA;&#xA;Input:  &quot;12 August 2019&quot; / &quot;2019-8-12&quot; / [2019, 8, 12] / (2019, 7, 12) (0-indexed month)&#xA;Output: &quot;10 Dhu al-Hijjah 1440&quot; (The start date of Eid ul-Adha in AH 1440)&#xA;&#xA;Input:  &quot;9 August 2021&quot; / &quot;2021-8-9&quot; / [2021, 8, 9] / (2021, 7, 9) (0-indexed month)&#xA;Output: &quot;30 Dhu al-Hijjah 1442&quot; (The next leap day)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Winning Criteria&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As this is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, shortest answer of each language wins. Standard loopholes are banned by default.&lt;/p&gt;&#xA;" OwnerUserId="71546" LastEditorUserId="71546" LastEditDate="2019-02-11T01:27:05.513" LastActivityDate="2019-02-11T01:27:05.513" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17385" PostTypeId="2" ParentId="16966" CreationDate="2019-02-08T12:42:09.460" Score="4" Body="&lt;p&gt;Let me start by saying that I agree with every point made by &lt;em&gt;@PeterTaylor&lt;/em&gt;. Here are some additional opinions / arguments why we should indeed revive older challenges, and in some cases simply update the existing challenge:&lt;/p&gt;&#xA;&lt;h3&gt;Why? (1)&lt;/h3&gt;&#xA;&lt;p&gt;Let's start with the &lt;strong&gt;why?&lt;/strong&gt; What are reasons we want to revive older challenges.&lt;/p&gt;&#xA;&lt;p&gt;When we look at past challenges, in general I see four categories:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The (very) good ones will usually have quite a few upvotes as well as answers, and even today people will post in it. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69/golf-you-a-quine-for-great-good&quot;&gt;&lt;em&gt;Golf you a quine for great good!&lt;/em&gt; from 2011, one of the very first challenges&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/q/55422/52210&quot;&gt;&lt;em&gt;&amp;quot;Hello, World!&amp;quot;&lt;/em&gt; from 2015&lt;/a&gt; are two examples where answers are still posted in on a weekly basis.&lt;br /&gt;&#xA;The earliest challenges are from the start of 2011, but there is even &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4244/code-golf-christmas-edition-how-to-print-out-a-christmas-tree-of-height-n&quot;&gt;one from December 2008&lt;/a&gt; (migrated from Stackoverflow.com to PPCG). But, even though it's this old, the specs are clear; there are test cases; and the newest answers for the challenge are from only a couple of months ago (Christmas last year). So, no problems for these kind of challenges.&lt;/li&gt;&#xA;&lt;li&gt;Challenges which were also good at the time, but are now closed due to updated PPCG specs. This mostly consists of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; challenges, to name two categories, which are closed as &lt;em&gt;Too broad&lt;/em&gt; and aren't really allowed to be posted anymore these days.&lt;/li&gt;&#xA;&lt;li&gt;The very hard, and usually &lt;a href=&quot;https://codegolf.stackexchange.com/questions?sort=unanswered&quot;&gt;unanswered challenges&lt;/a&gt;. The specs of the challenge are in most cases clear, but the challenge is very tough to answer, which is why no one did so yet.&lt;/li&gt;&#xA;&lt;li&gt;The in general good concepts, but which would be downvoted and/or closed as unclear due to lack of, well.., things we'd want to see today (clear rules; test cases; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods/&quot;&gt;flexible I/O rules&lt;/a&gt;; etc.)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;It's this last category which I would personally want to see revived in most cases. Let's start by giving an example of an old challenge which has been revived, and why it was revived.&lt;/p&gt;&#xA;&lt;h3&gt;Example of successful revival:&lt;/h3&gt;&#xA;&lt;p&gt;In September 2012 the following challenge was posted: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/8369/generate-a-kolakoski-sequence&quot;&gt;Generate a Kolakoski sequence&lt;/a&gt;. The challenge was actually entirely clear. We are given clear specs, test cases (in the form of the first x items of the sequence), even references to useful sources. So, why does this challenge fall in the fourth category, and not in the first? Here is the relevant quote why:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Input will be provided as a single command line argument &lt;code&gt;n&lt;/code&gt;. Please write a full program that will print the first &lt;code&gt;n&lt;/code&gt; elements of the Kolakoski sequence (in order) to STDOUT, with each element separated by your favorite whitespace.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Full program; input as command-line argument; output printed to STDOUT with space/tab/newline delimiter. Bleh.. Very cumbersome I/O specs which make it impossible for some languages to even compete because they don't support command-line inputs.&lt;/p&gt;&#xA;&lt;p&gt;Because of this part of the challenge, &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-ender&quot;&gt;&lt;em&gt;@MartinEnder&lt;/em&gt;&lt;/a&gt; revived it in March 2018: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/157403/compute-the-kolakoski-sequence&quot;&gt;Compute the Kolakoski sequence&lt;/a&gt;. Now we have a very loose spec (including for sequences in general), giving every language their own choice of the most reasonable spec:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;You may choose one of three formats to do so:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Take an input &lt;strong&gt;n&lt;/strong&gt; and output the &lt;strong&gt;n&lt;/strong&gt;th term of the sequence, where &lt;strong&gt;n&lt;/strong&gt; starts either from &lt;strong&gt;0&lt;/strong&gt; or &lt;strong&gt;1&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Take an input &lt;strong&gt;n&lt;/strong&gt; and output the terms &lt;em&gt;up to and including&lt;/em&gt; the &lt;strong&gt;n&lt;/strong&gt;th term of the sequence, where &lt;strong&gt;n&lt;/strong&gt; starts either from &lt;strong&gt;0&lt;/strong&gt; or &lt;strong&gt;1&lt;/strong&gt; (i.e. either print the first &lt;strong&gt;n&lt;/strong&gt; or the first &lt;strong&gt;n+1&lt;/strong&gt; terms).&lt;/li&gt;&#xA;&lt;li&gt;Output values from the sequence indefinitely.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;In the second and third case, you may choose any reasonable, unambiguous list format. It's fine if there is no separator between the elements, since they're always a single digit by definition.&lt;/p&gt;&#xA;&lt;p&gt;In the third case, if your submission is a function, you can also return an infinite list or a generator in languages that support them.&lt;/p&gt;&#xA;&lt;p&gt;You may write a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet&quot;&gt;program or a function&lt;/a&gt; and use any of our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;standard methods&lt;/a&gt; of receiving input and providing output. Note that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;these loopholes&lt;/a&gt; are forbidden by default.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Verbose programming languages like Java or .NET C# will of course use a lambda function instead of a full program. In some languages outputting the first &lt;span class=&quot;math-container&quot;&gt;\$n+1\$&lt;/span&gt; items newline separated is shortest, so they'll use that; and in other languages returning just the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th value is shortest, so they'll use that.&lt;/p&gt;&#xA;&lt;p&gt;Note that there has been a meta-discussion about this challenge in particular: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14871/should-we-repost-the-kolakoski-challenge&quot;&gt;Should we repost the Kolakoski challenge?&lt;/a&gt; A Sandbox post was created for it; discussions has been going on; and the original OP has been contacted (and in the end &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14942/52210&quot;&gt;gave his consent&lt;/a&gt;). I think if we want to revive old challenges to update the spec; make it more clearer; or any other valid reason, a similar scenario should take place where opinions are asked and compared and the original OP will be contacted.&lt;/p&gt;&#xA;&lt;p&gt;Of course there are many different reasons why we'd want to revive. In the example above it was the extremely restricted I/O ruling, which made it for a lot of languages impossible to compete in an otherwise good challenge.&lt;/p&gt;&#xA;&lt;h3&gt;What challenges should we improve instead of revive?&lt;/h3&gt;&#xA;&lt;p&gt;Sometimes there are challenges which are good, but instead of very strict ruling / I/O, they lack almost everything and consist only of a few lines. In something like this challenge: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/501/find-the-largest-value-of-power/&quot;&gt;Find the largest value of power&lt;/a&gt;, I/O is not mentioned at all, so we can assume the default can be used. However, due to the lack of test cases, and a clear spec of what are the possible inputs, I initially completely misunderstood the challenge (reading it again, this might be mainly my own fault and I was also a bit sleepy..) Regardless, would there have been more test cases for the edge cases, I would have seen my mistake right away. Also, it is not clear what the possible inputs are. What to do with negative integer inputs; &lt;code&gt;0&lt;/code&gt;; &lt;code&gt;1&lt;/code&gt;; etc.? So although the concept of the challenge is clear, because it is so succinct and lacks test cases, I personally had trouble completely grasping what was being asked and therefore made a mistake initially.&lt;/p&gt;&#xA;&lt;p&gt;I think in this case we should also contact the OP and update the existing challenge instead. Add test cases (especially for edge cases). Add perhaps an example. And perhaps explicitly mention the now implicit rules regarding I/O and loopholes.&lt;/p&gt;&#xA;&lt;h3&gt;Why? (2)&lt;/h3&gt;&#xA;&lt;p&gt;One step back to the &lt;strong&gt;why&lt;/strong&gt; again. Lately I've, and many others as well, noticed that fewer and fewer challenges are being posted. Since we've already have more than 10,000 posted challenges, it is of course harder and harder to come up with a good challenge concept that isn't a duplicate of an existing challenge.&lt;/p&gt;&#xA;&lt;p&gt;Reviving good older challenges by updating their specs solves this problem as well. Now, I know these challenges are already available, and people can just pick an (old) challenge to write an answer in. But with 10,000 challenges you sometimes don't know where to begin to pick one to write an answer for.&lt;br /&gt;&#xA;Personally I write an answer for a challenge usually for one of three reasons: 1. The challenge has just been posted (I regularly look at &lt;a href=&quot;https://codegolf.stackexchange.com/questions?sort=newest&quot;&gt;the newest challenges&lt;/a&gt;). 2. Someone recently posted an answer for an existing challenge, and it's visible at the &lt;a href=&quot;https://codegolf.stackexchange.com/?tab=active&quot;&gt;active tab of the home page&lt;/a&gt;. Or 3. I had an idea of a challenge in mind and wanted to make sure it wasn't a dupe yet, and noticed that someone else already posted something similar or related, so I write an answer for that challenge instead (if it doesn't contain an answer in my preferred programming languages to codegolf in yet).&lt;/p&gt;&#xA;&lt;p&gt;I almost never just randomly browse through older challenges, check if no one has posted an answer in my preferred programming languages yet, and then write an answer for it. I (maybe falsely) assume this is the case for almost all people at PPCG. Reviving older challenges will mean that it's posted as a new challenge, and more people will see and compete in it.&lt;/p&gt;&#xA;&lt;p&gt;All in all I think we should create some kind of &lt;a href=&quot;https://en.wikipedia.org/wiki/Flowchart&quot; rel=&quot;nofollow noreferrer&quot;&gt;action flow diagram&lt;/a&gt; we can follow with all the steps, and then either post the revised challenge in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;the Sandbox&lt;/a&gt; (and later to main), or edit the existing challenge (with consent from OP of course).&lt;/p&gt;&#xA;" OwnerUserId="52210" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-02-08T12:42:09.460" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17386" PostTypeId="2" ParentId="2140" CreationDate="2019-02-08T13:16:58.320" Score="1" Body="&lt;h1&gt;One circle, two inputs, eight outputs&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pi&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pi&amp;#39;&quot; rel=&quot;tag&quot;&gt;pi&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given the values of only two quantities from the following eight quantities ​​(the rest is unknown):&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Radius of circle: &lt;span class=&quot;math-container&quot;&gt;\$\displaystyle R\$&lt;/span&gt; &lt;/li&gt;&#xA;&lt;li&gt;Diameter of the circle: &lt;span class=&quot;math-container&quot;&gt;\$\displaystyle D=2\times R\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Circumference of the sector: &lt;span class=&quot;math-container&quot;&gt;\$\displaystyle C=2\times\pi\times R=\pi\times D\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Area of the circle: &lt;span class=&quot;math-container&quot;&gt;\$\displaystyle A=\pi\times R^2\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Angle of the sector: &lt;span class=&quot;math-container&quot;&gt;\$\displaystyle\alpha\$&lt;/span&gt; &lt;/li&gt;&#xA;&lt;li&gt;Length of arc: &lt;span class=&quot;math-container&quot;&gt;\$\displaystyle LA=\frac{C\times \alpha}{360°}\$&lt;/span&gt; &lt;/li&gt;&#xA;&lt;li&gt;Area of the sector: &lt;span class=&quot;math-container&quot;&gt;\$\displaystyle AS=\frac{A\times \alpha}{360°}\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Perimeter of the sector: &lt;span class=&quot;math-container&quot;&gt;\$\displaystyle PS=LA+2\times R=LA+D\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;compute the rest of quantities if possible, else put special output (-1, False,...) if at least one of the quantities can not be computed.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Two quantities with there values (non negative integers)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The values of the eight previous quantities (decimal with any precision or rounded integer).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this example the inputs is the ordered list of the previous quantities. Values are integers, angles in degrees, and outputs as rounded integers.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[16, ?, ?, ?, 100, ?, ?, ?]   --&amp;gt; [16, 32, 100, 804, 100, 27, 223, 59]&#xA;[24, ?, ?, ?, ?, ?, ?, 58]    --&amp;gt; [24, 48, 150, 1809, 23, 10, 120, 58]&#xA;[28, ?, ?, ?, ?, ?, ?, 188]   --&amp;gt; [28, 56, 175, 2463, 270, 132, 1848, 188]&#xA;[?, 18, ?, ?, ?, ?, ?, 41]    --&amp;gt; [9, 18, 56, 254, 146, 23, 103, 41]&#xA;[?, 28, ?, ?, ?, ?, ?, 808]   --&amp;gt; [14, 28, 87, 615, 3191, 780, 5460, 808]&#xA;[?, 88, 220, ?, ?, ?, ?, ?]   --&amp;gt; False&#xA;[?, ?, 88, ?, ?, 84, ?, ?]    --&amp;gt; [14, 28, 88, 616, 343, 84, 588, 112]&#xA;[?, ?, 220, ?, ?, 66, ?, ?]   --&amp;gt; [35, 70, 220, 3851, 108, 66, 1155, 136]&#xA;[?, ?, ?, 50, 50, ?, ?, ?]    --&amp;gt; [3, 7, 25, 50, 50, 3, 6, 11]&#xA;[?, ?, ?, 254, ?, ?, 18, ?]   --&amp;gt; [8, 17, 56, 254, 25, 4, 18, 21]&#xA;[?, ?, ?, 707, 75, ?, ?, ?]   --&amp;gt; [15, 30, 94, 707, 75, 19, 147, 49]&#xA;[?, ?, ?, ?, 99, 24, ?, ?]    --&amp;gt; [13, 27, 87, 606, 99, 24, 166, 51]&#xA;[?, ?, ?, ?, 140, ?, 175, ?]  --&amp;gt; [11, 23, 75, 450, 140, 29, 175, 53]&#xA;[?, ?, ?, ?, 324, 85, ?, ?]   --&amp;gt; [15, 30, 94, 709, 324, 85, 638, 115]&#xA;[?, ?, ?, ?, 324, ?, 3465, ?] --&amp;gt; [35, 70, 219, 3850, 324, 197, 3465, 267]&#xA;[?, ?, ?, ?, ?, 66, 88, ?]    --&amp;gt; False&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input and output can be given &lt;a href=&quot;http://meta.codegolf.stackexchange.com/q/2447/42963&quot;&gt;in any convenient format&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Specify in the answer the special output when quantities can not be computed all.&lt;/li&gt;&#xA;&lt;li&gt;Specify in the answer whether the angle is in degree or radian or other unit.&lt;/li&gt;&#xA;&lt;li&gt;π can be set to 3.14 or 22/7 or 355/113 or any more precise value.&lt;/li&gt;&#xA;&lt;li&gt;No need to handle invalid input values.&lt;/li&gt;&#xA;&lt;li&gt;Either a full program or a function are acceptable. If a function, you can return the output rather than printing it.&lt;/li&gt;&#xA;&lt;li&gt;If possible, please include a link to an online testing environment so other people can try out your code!&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://meta.codegolf.stackexchange.com/q/1061/42963&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so all usual golfing rules apply, and the shortest code (in bytes) wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="71398" LastEditorUserId="71398" LastEditDate="2019-02-08T13:50:48.080" LastActivityDate="2019-02-08T13:50:48.080" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17387" PostTypeId="2" ParentId="2140" CreationDate="2019-02-09T22:03:16.737" Score="-1" Body="&lt;h1&gt;A Quine that Grows!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Create a quine that, when run, outputs itself but copied larger in the next one. The output should be able to be run, and get larger each time the output is run. &lt;strong&gt;The output must consist only of characters from the original quine!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;EX:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abc //original&#xA;abcabc //output&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;or&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abc //original&#xA;aabcc //output&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;What not to do&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abc //original&#xA;abcgef //output&#xA;&#xA;abc //original&#xA;abcoooooooooooo //output&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;An example I created&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##S8/PScsszvj/X9nDW9cop1ZJ/f9/AA&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it Online!&lt;/a&gt;&#xA;It replicates pretty fast if I do say so myself!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Points&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge is meant to be a codegolf, but also emphasize on how fast it replicates. So perhaps something like the speed at which it gets bigger divided by the number of bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I really don't want loopholes like just repetitively adding characters to a section of the code, making infinite loops, and things of the like.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any input on how to make this a good challenge? I'm open to suggestions!!! &lt;/p&gt;&#xA;" OwnerUserId="85185" LastActivityDate="2019-02-09T22:03:16.737" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17397" PostTypeId="2" ParentId="2140" CreationDate="2019-02-12T10:10:43.883" Score="0" Body="&lt;h1&gt;Break Hello World (Cops)/Fix Hello World (Robbers)&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Cops&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your job is to write a broken hello world program. What do I mean by that? Well, you write a valid hello world program, and make changes to it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your probably thinking &quot;easy peasy&quot;, right? Well, there's one other condition: it must be hard to fix.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anyways, for the actual rules. First you write a valid hello world program. That means:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The characters sent to stdout form the string &quot;Hello World!&quot; exactly. Then the program halts gracefully (if given enough time and resources).&lt;/li&gt;&#xA;&lt;li&gt;Nothing is read from stdin or sent to stderr.&lt;/li&gt;&#xA;&lt;li&gt;No interacting with the operating system (i.e. no modifying files, randomness (unless it is pseudorandom and the seed is the same each run), internet, other commands, etc...)&lt;/li&gt;&#xA;&lt;li&gt;No using built-in or imported hashes or cryptographic primitives. If the program implements cryptographic primitives, that's fine though.&lt;/li&gt;&#xA;&lt;li&gt;Should work no matter how or on what platform it is run, assuming default options. The language it is written in should be reasonably cross platform and not cost money as well.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Now, make any changes you want to it. However, your score will be based on the &lt;a href=&quot;https://en.wikipedia.org/wiki/Levenshtein_distance&quot; rel=&quot;nofollow noreferrer&quot;&gt;edit distance&lt;/a&gt; between the valid and broken program (the lesser the better). The exact scoring will be described below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The broken program can be any string you like (so calling it a &quot;program&quot; is technically a misnomer). Your submission will consist of:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The broken program&lt;/li&gt;&#xA;&lt;li&gt;The edit distance between the valid and broken program, or any greater distance. (The reason you might want a greater distance is if the exact distance would reveal too much information. However, your score will suffer, and the robbers will have more flexibility, so be careful exercising this option). This number will be called your &quot;brokenness&quot; number.&lt;/li&gt;&#xA;&lt;li&gt;The language and language version of the valid program. This language should not be one written for this challenge.&lt;/li&gt;&#xA;&lt;li&gt;The sequence of literals appearing in the valid program, in the order they appear. (This is to encourage cops to scramble the program structure, not just hard coded values.)&lt;/li&gt;&#xA;&lt;li&gt;What the score will be if it is not cracked and after you reveal the solution.&lt;/li&gt;&#xA;&lt;li&gt;The date and time at which the program will be safe (as described below). (This way your program will be safe as soon as this time is reached, even if you have not had an opportunity to reveal the solution yet.) You may edit this in immediately after posting the solution, if you prefer, so that you will now the submission time.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;After that, the robbers will have 168 hours (one week) to crack your submission from the date posted. If your submission is not cracked by then, your entry is safe. However, you can not claim your score until after you reveal the solution. To do this, edit your answer to include the valid program and an explanation as to why it works (if it takes a while to run). Also include what edits where made (since calculating the edit distance can be hard) and the word &quot;safe&quot; in the title.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How can your program be cracked? A robber just needs to write a valid hello world program (not necessarily the same as you wrote) whose edit distance from your broken program is less than or equal to your submission's brokenness number. The only other stipulation is that it has the same language and language version. In particular, it is not required to use the same literals as your program (this is to discourage cops from making their submission harder to crack this way).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And now for score. If the length of the broken program is L, the brokeness number is b, and the number of characters that can be used in your programming language is k, your score is &lt;a href=&quot;https://www.wolframalpha.com/input/?i=(k%5Eb%20(b%20%2B%20L)!)%2F(b!%20L!)%20where%20k%20%3D%20256.0,%20b%20%3D%207,%20L%20%3D%20100&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;(k^b)*(L+b)!/(L!b!)&lt;/code&gt;&lt;/a&gt;, which you are trying to minimize. If your wondering were the heck that formula came from, it is &lt;em&gt;very roughly&lt;/em&gt; the number of strings whose edit distance from your broken program is less than or equal to your submission's brokenness number (the exact value is hard to compute) (NOTE TO SANDBOX READERS: If you know a more accurate metric that isn't too complicated, let me know.). The idea is that the smaller the search space the robbers have to search, the more impressive it is if it does not get cracked. Also, please post the score in scientific notation for easy comparison.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, so the submission which claims the lowest score wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example Answer:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Python 2.7, score 7.5×10^53 (Safe)&lt;br&gt;&#xA;Broken Program: &lt;code&gt;salida &quot;Hola Mundo!&quot;&lt;/code&gt;&lt;br&gt;&#xA;Brokenness Number: 18&lt;br&gt;&#xA;Literals: &quot;Hello World&quot;&lt;br&gt;&#xA;Safe Date: Feburary 12th, 3:42 PM UTC.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Valid program: &lt;code&gt;print &quot;Hello World!&quot;&lt;/code&gt;&lt;br&gt;&#xA;Edits: Make 7 replacements to get to &lt;code&gt;saida &quot;Holao dorld!&quot;&lt;/code&gt;. Make 4 deletions to get to &lt;code&gt;saida &quot;Hola do!&quot;&lt;/code&gt;. Make 4 insertions to get to &lt;code&gt;salida &quot;Hola Mundo!&quot;&lt;/code&gt;.&lt;br&gt;&#xA;Explanation: Uses python's builtin &lt;code&gt;print&lt;/code&gt; command to send `&quot;Hello World!&quot; to standard output.  &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Robbers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Welp, the cops did it again. They broke some hello world programs. Its your job to fix them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your probably thinking &quot;easy peasy, I'll just rewrite it from scratch&quot;, right? Well, there's one other condition: you have a limited number of edits.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anyways, for the actual rules. Pick a submission from the cop's thread that has not already been cracked, and is not safe. A submission is safe if it is over 168 hours (one week) old. The submission will have a broken hello world program, a brokenness number, and a programming language and language version, as well as some other useful information (including what literals in the cop's valid hello world program). Your submission must contain a valid hello world program in that language and language version whose &lt;a href=&quot;https://en.wikipedia.org/wiki/Levenshtein_distance&quot; rel=&quot;nofollow noreferrer&quot;&gt;edit distance&lt;/a&gt; to the broken program is less than or equal to the brokenness number. See the cop thread for what constitutes a valid hello world program. Also note that you &lt;strong&gt;are not&lt;/strong&gt; required to use the same literals the cop used. They are only meant to give you a hint.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your robber submission should consist of:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A link to the cop entry you are trying to break.&lt;/li&gt;&#xA;&lt;li&gt;Your valid hello world program.&lt;/li&gt;&#xA;&lt;li&gt;An explanation as to why it works (if it takes a while to run).&lt;/li&gt;&#xA;&lt;li&gt;The edits you made to create the program (since calculating edit distance can be hard).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;and then place a comment in the cops submission with a link to your submission. You get a point for each submission cracked. Note that only the first robber to crack a given cop submission gets a point. If you post a submission cracking a cop's submission, but it turns out another robber posted one before you, edit your submission to say that it is non-competing (or you can delete it if you want to). It is also non-competing if you crack a submission that is already safe.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;, so whichever robber gets the most points wins!&lt;/p&gt;&#xA;" OwnerUserId="16842" LastActivityDate="2019-02-12T10:10:43.883" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17398" PostTypeId="1" CreationDate="2019-02-13T17:31:13.370" Score="2" ViewCount="98" Body="&lt;p&gt;Assuming the question would be considered a good question by the community, what is the community stance on creating a question with the sole purpose of eventually supplying a golfed solution?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To clarify: This does not mean creating an answer before posting, I mean posting with the sole purpose of creating an answer.&lt;/p&gt;&#xA;" OwnerUserId="77964" LastEditorUserId="77964" LastEditDate="2019-02-13T21:22:29.090" LastActivityDate="2019-02-13T21:22:29.090" Title="What is the community stance on posting a codegolf question just to answer it yourself?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17399" PostTypeId="2" ParentId="2140" CreationDate="2019-02-13T18:23:27.970" Score="5" Body="&lt;h1&gt;Interleave Invariance&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is an infinite sequence that does not change when interleaved with the natural numbers. Consider these few terms:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 1 2 1 3 2 4 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Interleave them with the naturals:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1   2   3   4   5   6   7   8&#xA;  1   1   2   1   3   2   4   1&#xA;-------------------------------&#xA;1 1 2 1 3 2 4 1 5 3 6 2 7 4 8 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As you can see, there is no change in the initial eight. Now, this sequence can be extended indefinitely rather easily by repeating this interleave operation. Your task is to choose and implement one of three output formats:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Take as input a nonnegative integer &lt;code&gt;n&lt;/code&gt; and output the &lt;code&gt;n&lt;/code&gt;th term of this sequence, zero- or one-indexed (your choice).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Take as input a nonnegative integer &lt;code&gt;n&lt;/code&gt; and output the first &lt;code&gt;n&lt;/code&gt; terms of this sequence.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Output terms in order forever, starting from the beginning.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;For options 2 and 3, there must be no numeric characters and at least one non-numeric character between terms; this separator need not be consistent. &lt;code&gt;1+1=2&lt;/code&gt; would be fine for input 3. Leading and trailing non-numeric characters are allowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are the first 64 terms. This is OEIS sequence &lt;a href=&quot;http://oeis.org/A003602&quot; rel=&quot;nofollow noreferrer&quot;&gt;A003602&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 1 2 1 3 2 4 1 5 3 6 2 7 4 8 1 9 5 10 3 11 6 12 2 13 7 14 4 15 8 16 1 17 9 18 5 19 10 20 3 21 11 22 6 23 12 24 2 25 13 26 7 27 14 28 4 29 15 30 8 31 16 32 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your submission can be a program or a function; &quot;input&quot; and &quot;output&quot; are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/73884&quot;&gt;as defined by the community&lt;/a&gt;. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/73884&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the shortest solution (in bytes) wins! Good luck, and happy golfing!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandboxy Stuff&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Am I clear enough on what the sequence is? Any suggestions for rewording?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this a duplicate? I've searched for &quot;interleave&quot; and &quot;3602&quot; and found nothing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anything else worth mentioning? What thoughts ya gots?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thanks to Martin Ender for the output formats, taken almost straight from the Kolakoski challenge.&lt;/p&gt;&#xA;" OwnerUserId="73884" LastActivityDate="2019-02-13T18:23:27.970" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17400" PostTypeId="2" ParentId="17398" CreationDate="2019-02-13T20:07:28.610" Score="6" Body="&lt;h3&gt;Self-answering in general&lt;/h3&gt;&#xA;&lt;p&gt;As linked by DJMcMayhem in a comment, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12104/71434&quot;&gt;prior consensus&lt;/a&gt; is that self-answering is fine as long as you wait long enough for some other answers to come in. If it sits unanswered for long enough then it's fine to post your answer anyway, since apparently there aren't any other answers to discourage.&lt;/p&gt;&#xA;&lt;h3&gt;Specifics of motivation&lt;/h3&gt;&#xA;&lt;p&gt;I see no issues with a pattern like:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Discover a neat, golfy piece of code that does something interesting&lt;/li&gt;&#xA;&lt;li&gt;Discover that there is no existing challenge for that interesting thing&lt;/li&gt;&#xA;&lt;li&gt;Write a challenge to do that interesting thing&lt;/li&gt;&#xA;&lt;li&gt;Eventually post your code&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;One thing I would avoid is having &amp;quot;what my piece of code does&amp;quot; be the final arbiter of correctness. To put it another way, if you find that your code has bugs, you should fix those bugs rather than mandate that all other solutions replicate them. Sometimes it's not a big deal (e.g. there are two equally valid ways to rule an edge case), but if you start having to make weird exceptions or special-cases to keep your own answer valid then I think that's a problem.&lt;/p&gt;&#xA;&lt;p&gt;Another pattern you might use is this:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Think of a problem you want to golf&lt;/li&gt;&#xA;&lt;li&gt;Discover that no existing challenge is close enough to that problem for your tastes&lt;/li&gt;&#xA;&lt;li&gt;Write a challenge to solve that problem&lt;/li&gt;&#xA;&lt;li&gt;Start golfing&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I can't really imagine an issue with this process, but even if you don't start golfing before posting the challenge it's still a good idea to let others post the first answers.&lt;/p&gt;&#xA;&lt;p&gt;Note that in both of these patterns, steps 2 and 3 are important. In step 2 you might discover that you need to change the challenge to avoid being a duplicate, or that you don't need a new challenge at all. In step 3 you should make use of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/71434&quot;&gt;Sandbox&lt;/a&gt; to get feedback ahead of time; this might even cause your first answers to come faster since other golfers can get their own presolving time as well.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-02-13T20:07:28.610" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17411" PostTypeId="2" ParentId="17302" CreationDate="2019-02-19T10:53:03.603" Score="15" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5243/43319&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/iU1bc.png&quot; alt=&quot;Deadline-less (hence not searchable) bounties offered by users on various challenges&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2019-02-19T10:53:03.603" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17412" PostTypeId="1" CreationDate="2019-02-19T12:50:26.833" Score="5" ViewCount="184" Body="&lt;p&gt;Consider the following the challenge:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Write a program that accomplishes &lt;em&gt;X&lt;/em&gt; task while maximizing the number of distinct characters in your source code. Removing any set of characters from the program should cause it to no longer accomplish &lt;em&gt;X&lt;/em&gt; (e.g. it could error, halt, or just do something wrong).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Let's say the following answer was posted:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Lenguage, &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; bytes&lt;/h1&gt;&#xA;  &#xA;  &lt;p&gt;The first 256 bytes should range from &lt;code&gt;0x00&lt;/code&gt; to &lt;code&gt;0xFF&lt;/code&gt;. The remaining &lt;span class=&quot;math-container&quot;&gt;\$A-256\$&lt;/span&gt; bytes can be anything.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If there exists a Lenguage program that can accomplish &lt;em&gt;X&lt;/em&gt; in fewer bytes, then this answer becomes invalid, because one could remove characters from the end of the program to turn it into the shorter one, thus violating the rule that removing characters should stop the program from working.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In cases like this, where the validity of an answer depends on whether there is a golfed version, should it be posted?&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;By OP: I first asked that since we know Lenguage get a score of 256 even if there is a more golfed solution, should we submit an answer that not sure to satisfy the requirement. Therefore you may need to consider this part.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="56656" LastEditDate="2020-01-02T14:36:44.900" LastActivityDate="2020-01-02T14:36:44.900" Title="Existence of known score but unknown exact code" Tags="|discussion|answers|" AnswerCount="1" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="17415" PostTypeId="1" CreationDate="2019-02-20T11:30:59.420" Score="4" ViewCount="72" Body="&lt;p&gt;I mostly ask this for the benefit of new users (e.g. me, ish), who might not &lt;em&gt;know&lt;/em&gt; where all the important meta things are, especially since they're not linked every time they apply.  I've done some looking and I'm still not sure if I know where all of the canonical posts &lt;em&gt;are.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="47399" LastEditorUserId="68942" LastEditDate="2021-06-09T05:35:44.510" LastActivityDate="2021-06-09T05:35:44.510" Title="Can we link canonical meta posts (e.g &quot;what is a quine&quot;, standard loopholes) more actively on the site?" Tags="|discussion|" AnswerCount="0" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="17416" PostTypeId="1" CreationDate="2019-02-20T13:31:37.473" Score="5" ViewCount="126" Body="&lt;p&gt;Looking at the various winning criteria tags in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/906/the-tag-categorization-project/908#908&quot;&gt;The Tag Categorization Project&lt;/a&gt;, a lot of them should have links to helpful resources such as the standard loopholes and I/O standards in their wikis, but currently don't&lt;/p&gt;&#xA;&lt;p&gt;This probably should be fixed.&lt;/p&gt;&#xA;" OwnerUserId="47399" LastEditorUserId="68942" LastEditDate="2021-04-24T18:19:45.060" LastActivityDate="2021-11-04T23:03:10.367" Title="Tags that should have references to standard loopholes, I/O standards, etc., do not" Tags="|feature-request|status-completed|tag-wikis|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17417" PostTypeId="2" ParentId="2140" CreationDate="2019-02-21T07:43:00.953" Score="2" Body="&lt;h1&gt;Least efficient field order&lt;/h1&gt;&#xA;&lt;h2&gt;Background:&lt;/h2&gt;&#xA;&lt;p&gt;In C and other languages, a &lt;code&gt;struct&lt;/code&gt; is a data type composed of fields of other data types. These fields may be different sizes (in bytes) and may have different alignment requirements (e.g. an &lt;code&gt;int&lt;/code&gt; field may need to be on a 4-byte boundary).&lt;/p&gt;&#xA;&lt;p&gt;Padding is added to a &lt;code&gt;struct&lt;/code&gt; to keep all of its fields aligned, and to keep its size a multiple of each field's alignment.&lt;/p&gt;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;struct test {&#xA;    char  a; // 1-byte, 1-byte aligned&#xA;    short b; // 2-byte, 2-byte aligned&#xA;    int   c; // 4-byte, 4-byte aligned&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In this &lt;code&gt;struct&lt;/code&gt;, there will be 1 byte of padding after &lt;code&gt;a&lt;/code&gt; (to keep &lt;code&gt;b&lt;/code&gt; on a 2-byte boundary), no padding after &lt;code&gt;b&lt;/code&gt; (as &lt;code&gt;c&lt;/code&gt; is already on a 4-byte boundary) and no padding after &lt;code&gt;c&lt;/code&gt; (as the size is already a multiple of 2 and 4 bytes), so the total size of the &lt;code&gt;struct&lt;/code&gt; is 8 bytes (1 + 2 + 4 + 2). However, if we rearrange the order of the fields, the struct size can be bigger.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;struct test_2 {&#xA;    char  d; // 1-byte, 1-byte aligned&#xA;    int   e; // 4-byte, 4-byte aligned&#xA;    short f; // 2-byte, 2-byte aligned&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In this &lt;code&gt;struct&lt;/code&gt;, there will be 3 bytes of padding after &lt;code&gt;d&lt;/code&gt; (to keep &lt;code&gt;e&lt;/code&gt; on a 4-byte boundary) and there will be 2 bytes of padding after &lt;code&gt;f&lt;/code&gt; (to keep the size a multiple of 2 and 4 bytes), so the total size of this struct is 12 bytes (1 + 4 + 2 + 3 + 2).&lt;/p&gt;&#xA;&lt;h2&gt;Challenge:&lt;/h2&gt;&#xA;&lt;p&gt;Given a list of pairs of positive integers (each pair representing the size and alignment of a field), return the same pairs in an order such that a struct with fields in that order would require the most padding, i.e. be the least space-efficient.&lt;/p&gt;&#xA;&lt;p&gt;Givens:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A field's size will always be greater than or equal to its alignment. (e.g. (4, 8) is not a valid input pair)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A field's size will always be a multiple of its alignment. (i.e. (12, 5) is not a valid input pair)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Test cases: (other outputs that give the same total size are valid as well)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[(1, 1), (1, 1), (4, 4)] -&gt; [(1, 1), (4, 4), (1, 1)] # size 12&#xA;[(12, 4), (1, 1), (2, 2), (8, 8)] -&gt; [(12, 4), (8, 8), (1, 1), (2, 2)] # size 32&#xA;[(7, 7), (5, 1), (2, 2)] -&gt; [(7, 7), (2, 2), (5, 1)] # size 28&#xA;[(6, 6), (6, 3), (4, 2), (2, 2)] -&gt; [(6, 3), (4, 2), (6, 6), (2, 2)] # size 24&#xA;[(1, 1)] -&gt; [(1, 1)] # size 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##bVRNb9swDD1bv4JwUcBO1bRJu7YIkB0HDBh2aW9ZYBgOkwizZUOS@zXst2ek5KRqsotl8z3y8Uvu3ty21Te7tWkbcG@d0htQTdcaBz@UdRKe@q5GCY/ohPimsF7BPNgWShNMj6V4dKav3AHwNAnj8XgphEPriqq0aGc@4iKQl8ReiCTLJhImuYTDeSvhNs@lh6b8HmH0PeXzQcLDwLmXcM@mLzElQHcS7thE580QeXpEedgLkG0yjeWXu6ELyqFxbVtbMRia0m2FWOEa6qrJRmrGPcjh8iufM5EoqoydMpWLhCj0ORGJM2@EJSV9aXx1HhzQkt5etqpGeDI9MuuINvD4OYISrq58DuNNtcrIJqEkEr5W2Dl4dG33ncRLp1rNoQy63mj2DTlv0BVWvWNG4wiTiFK33uBx0rsWybo1oKgrbCGdWm10TlxA3TcsQmFyVlFriH3PA9WXEtsv5gGASwp5yudaj@h8iuQMfrYvUG2x@g2c0rqv6@DSoHaUN7HskJ@lzN9Vl41sfigoiM7DwAKLwJOkY/bsP7nEwU4qiFEKPvQ94oT@PxNhVZTavqCxR0OgO7a/HSTfoWl65we5vzrRvRt4/hplh6F2lnaYHr5LneVRHfZ3HAekuS0/S4wtLXdm8JnywjlvIlXRlK8@sN9xkqLvLHbKF9fLQ61/SJB1w7IE9ZgM3HC/Wj6QD/xXCLIWhS4bLApG0qJoSqWLIp2F/eN/B4eKfiQ0G4dNR82lnNJzy81LaQYZw5LXqDOUcDaQJO3rap6mfr9w7/ZLp3BBbumoRr2nfviOMg58BucrH5nW6@Pq5KHBvsLPA@UE6PcBJDMPUrnY7f4B&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 3 – Try It Online&quot;&gt;Test case checker online!&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="44694" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-02-21T07:43:00.953" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17420" PostTypeId="2" ParentId="17412" CreationDate="2019-02-22T05:57:21.707" Score="3" Body="&lt;h1&gt;Do not post an answer unless you know it to be valid&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Answers are for providing solutions to the challenge. Do not create an answer unless you know that it provides a solution to the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, if you still think your (possibly invalid) solution might be of interest, you can post it as a comment or attach it to another answer.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastActivityDate="2019-02-22T05:57:21.707" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17423" PostTypeId="1" CreationDate="2019-02-23T18:52:08.293" Score="5" ViewCount="249" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/180277/20283&quot;&gt;This answer&lt;/a&gt; gives the reciprocal of the required output, rather than the required output itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a simpler challenge this might cut out a significant part of the work, but for this particular challenge the bulk of the work is still being done. However, this still gives the answerer an advantage over a competitor using the same language but giving the correct required output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As pointed out in a since deleted comment, the limitations imposed by pure regex mean that answers generally take unary input and give unary output (where arithmetic is required), which doesn't allow an obvious way of giving a fraction as an output, which the challenge in question requires. I think the compromise found, of using unary to express a reciprocal, is ingenious, but I'd like to see discussion of whether this is valid, so we can have consensus one way or the other.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is such an answer valid?&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2019-02-23T19:28:05.780" LastActivityDate="2019-02-25T20:26:54.690" Title="Is a regex answer valid if it gives the reciprocal of the required output?" Tags="|discussion|answers|output|" AnswerCount="3" CommentCount="3" ClosedDate="2019-02-26T17:47:37.457" ContentLicense="CC BY-SA 4.0" />
  <row Id="17424" PostTypeId="2" ParentId="17423" CreationDate="2019-02-23T23:14:46.473" Score="1" Body="&lt;p&gt;Call the input a natural number &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;. I don't see a qualitative difference between:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Returning one number, in a challenge where it so happens that the reciprocal of the correct output is always infinity or a natural number &lt;span class=&quot;math-container&quot;&gt;\$≤n\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Returning two numbers &lt;span class=&quot;math-container&quot;&gt;\$(a,b)\$&lt;/span&gt;, to represent a fraction &lt;span class=&quot;math-container&quot;&gt;\$a\over b\$&lt;/span&gt; where the numerator and denominator are both guaranteed to be &lt;span class=&quot;math-container&quot;&gt;\$≤n\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Returning two numbers &lt;span class=&quot;math-container&quot;&gt;\$(a,b)\$&lt;/span&gt;, encoding &lt;span class=&quot;math-container&quot;&gt;\$an+b\$&lt;/span&gt;, to represent a natural number that is guaranteed to be &lt;span class=&quot;math-container&quot;&gt;\$≤n^2+n\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Returning three numbers &lt;span class=&quot;math-container&quot;&gt;\$(a,b,c)\$&lt;/span&gt;, encoding &lt;span class=&quot;math-container&quot;&gt;\$an^2+bn+c\$&lt;/span&gt;, to represent a natural number that is guaranteed to be &lt;span class=&quot;math-container&quot;&gt;\$≤n^3+n^2+n\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Returning four numbers &lt;span class=&quot;math-container&quot;&gt;\$(a,b,c,d)\$&lt;/span&gt;, encoding &lt;span class=&quot;math-container&quot;&gt;\$(an+b)\over(cn+d)\$&lt;/span&gt;, where the numerator and denominator are guaranteed &lt;span class=&quot;math-container&quot;&gt;\$≤n^2+n\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Returning two numbers &lt;span class=&quot;math-container&quot;&gt;\$(a,b)\$&lt;/span&gt;, encoding &lt;span class=&quot;math-container&quot;&gt;\$a×2^{b-\lfloor {n/2} \rfloor}\$&lt;/span&gt; (floating point)&lt;/li&gt;&#xA;&lt;li&gt;Returning four numbers &lt;span class=&quot;math-container&quot;&gt;\$(a,b,c,d)\$&lt;/span&gt;, encoding &lt;span class=&quot;math-container&quot;&gt;\${a\over b}+{c\over d}i\$&lt;/span&gt; (complex rational number)&lt;/li&gt;&#xA;&lt;li&gt;Returning four numbers &lt;span class=&quot;math-container&quot;&gt;\$(a,b,c,d)\$&lt;/span&gt;, encoding &lt;span class=&quot;math-container&quot;&gt;\${a\over b}+{c\over d}\pi\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Various combinations thereof, and beyond&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So the options are:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Consider each of the above to be a distinct language, following the established PPCG convention regarding command-line parameters. The &lt;a href=&quot;https://codegolf.stackexchange.com/a/180277/20283&quot;&gt;N-mover answer&lt;/a&gt; would then be unchanged, except perhaps to call the language something like &quot;&lt;strong&gt;Regex (ECMAScript, reciprocal output)&lt;/strong&gt;&quot;.&lt;/li&gt;&#xA;&lt;li&gt;Represent this metadata in some standard format (with the number of each backreference, and what it represents – &lt;code&gt;\0&lt;/code&gt; could indicate the return match itself), and add it to the byte cost of the regex. Then this would be a new language, focusing on pure regexes and confining the metadata format in a way that honors that restriction.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="17216" LastEditorUserId="17216" LastEditDate="2019-02-23T23:19:47.753" LastActivityDate="2019-02-23T23:19:47.753" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17426" PostTypeId="2" ParentId="17423" CreationDate="2019-02-24T07:10:32.540" Score="14" Body="&lt;h1&gt;Ask the OP&lt;/h1&gt;&#xA;&lt;p&gt;There are many ways to take input and return output.  We've made some standardized ways so that challenges don't have to redefine them every time.&lt;/p&gt;&#xA;&lt;p&gt;However, for stuff like printing the reciprocal, this is something the OP needs to decide.  I don't think it is a stretch of the imagination to think that this could be abused on simpler challenges.&lt;/p&gt;&#xA;&lt;p&gt;(In essence, the answer here is &amp;quot;no&amp;quot;.  This isn't an allowed default output format.  OP can always override, and for this particular challenge, I'd personally vote to allow it)&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-02-24T07:10:32.540" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17427" PostTypeId="2" ParentId="2140" CreationDate="2019-02-25T05:10:53.123" Score="0" Body="&lt;h3&gt;MisterGeeky's query-to-list challenges:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;i&gt;&lt;sup&gt;&lt;b&gt;It is up to you whether you interpret these challenges as following a pattern.&lt;/b&gt;&lt;/sup&gt;&lt;/i&gt;&#xA;&lt;hr/&gt;&#xA;&lt;i&gt;&lt;b&gt;Challenge 1&lt;/b&gt;&lt;/i&gt;:- Given an array of random numbers and a target number, sample pairs in the array whose sum is closest to the target. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strike&gt;Minimize the error function.&lt;/strike&gt; To explain this challenge, I need elucidate on the random list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;L = [8.76, 7.89, 6.98, 9.99]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That's just a handmade random list. Yours can be auto-generated of any length.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Say &lt;code&gt;target = 42&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Find a tuple made from cartesian LxL whose sum of elements is closest to target.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These are obviously not the best words to pose the challenge with, they will be refined. How close is this to golf?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Challenge 1.5:- Extend the above problem with all known operations, and even increase the number of numbers that can be taken at a time to reach the target.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;op = ['*', '**', '^', '/', '+', '-']&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Assume usual meaning for each, &lt;code&gt;**&lt;/code&gt; is sometimes for exponentiation but you can use it for tetration, similar to knuth's up arrow notation. '^' is either XOR or exponentiation. You have the liberty to choose operators. I meant operators known to you in general. Just normal arithmetic should even do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;op = ['+', '-', '*', '/']&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also allow any binary function that doesn't trivially output the target value.&lt;/p&gt;&#xA;&#xA;&lt;hr/&gt;&#xA;&#xA;&lt;p&gt;&lt;i&gt;&lt;b&gt;Challenge 2&lt;/b&gt;&lt;/i&gt;:- Find list of Adjacent Elements to a given element or element position in any 4-dimensional matrix. (ie, m rows* n columns * p sheets * 4th dim whatever)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even I'm not sure how this is golf. But I typically like to think there's only one approach that's the correct answer. Feel free to argue with me on that :D&#xA;The idea is that this knowledge gives you a starting point to find n-neighbours of a cell location.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, you typically have 8 directions of search (4 pure and 4 combined). &#xA;You start with listing the immediate neighbours&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Challenge 2.5:- Find specified number of adjacent elements of a point in n-space. You are free to either sample at random, use rank of the point or use minimum euclidean distances.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here, you find n-neighbors of a given item. Points for creativity.&lt;/p&gt;&#xA;&#xA;&lt;hr/&gt;&#xA;&#xA;&lt;p&gt;&lt;strike&gt;Challenge 3:- build a simple recommender, takes a query and outputs a list (recommender as a suggestions lister is not easily defineable)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Challenge 3.5:- improve recommendation efficiency (too advanced for golf)&lt;/strike&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Third challenge is anything that combines knowledge from first and second challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The above are to be refined as golfing challenges, shortest code is the best code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please comment your thoughts below. Thanks.&lt;/p&gt;&#xA;" OwnerUserId="85633" LastEditorUserId="85633" LastEditDate="2019-02-26T09:34:39.993" LastActivityDate="2019-02-26T09:34:39.993" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17430" PostTypeId="2" ParentId="17423" CreationDate="2019-02-25T20:26:54.690" Score="2" Body="&lt;h1&gt;Outcome for the specific challenge mentioned&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I have reconsidered the output requirement following a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/179747/n-movers-how-much-of-the-infinite-board-can-i-reach/180277#comment434622_180277&quot;&gt;comment&lt;/a&gt; from &lt;a href=&quot;https://codegolf.stackexchange.com/users/17602/neil&quot;&gt;Neil&lt;/a&gt; on the answer in question:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;@trichoplax Could you consider the answer as being the ratio of lengths of two specific capture groups? (This would actually make the answer shorter as it takes the trouble to make the whole match be the result.) – Neil&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;As a result, I have amended the output requirement:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;So for input 8, both 1/8 and 0.125 are acceptable outputs. Output as separate numerator and denominator is also acceptable, to be inclusive of languages that support neither floats nor fractions. For example, &lt;code&gt;1 8&lt;/code&gt; or &lt;code&gt;[1, 8]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2019-02-25T20:26:54.690" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="17431" PostTypeId="2" ParentId="2140" CreationDate="2019-02-26T07:52:25.717" Score="-4" Body="&lt;h2&gt;All numeric substrings&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I like numbers. Really, really, like numbers. If you give me a string with numerals in it, I want to get all the numbers out of it that I can.&lt;/p&gt;&#xA;&lt;h3&gt;Input:&lt;/h3&gt;&#xA;&lt;p&gt;A string.&lt;/p&gt;&#xA;&lt;h3&gt;Output:&lt;/h3&gt;&#xA;&lt;p&gt;Every numeric substring, in any order, but only one of each. Numeric here means anything with Unicode &lt;a href=&quot;//en.wikipedia.org/wiki/Unicode_character_property#General_Category&quot; rel=&quot;nofollow noreferrer&quot;&gt;General Category&lt;/a&gt; &lt;code&gt;Nd&lt;/code&gt; (because I'm no xenophobe).&lt;/p&gt;&#xA;&lt;h3&gt;I/O&lt;/h3&gt;&#xA;&lt;p&gt;Any reasonable format. But languages that don't allow for multibyte-character I/O should use some numeric or other representation.&lt;/p&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;p&gt;(input → one ordering of the correct output)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1212 → [1212, 121, 212, 12, 21, 1, 2]&lt;/li&gt;&#xA;&lt;li&gt;123٤٥6 ‪→ [1, 2, 3, ٤,‪ ٥, 6, 12, 23, 3٤,‪ ٤٥,‪ ٥6,‪ 123, 23٤,‪ 3٤٥,‪ ٤٥6,‪ 123٤,‪ 23٤٥,‪ 3٤٥6,‪ 123٤٥,‪ 23٤٥6,‪ 123٤٥6]‪&lt;/li&gt;&#xA;&lt;li&gt;12t45 → [1, 2, 4, 5, 12, 45]&lt;/li&gt;&#xA;&lt;li&gt;abc → []&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="1976" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-02-27T05:35:11.660" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17432" PostTypeId="2" ParentId="2140" CreationDate="2019-02-26T09:18:39.643" Score="0" Body="&lt;h1&gt;Product and Sum free set&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given some non-negative integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; find a sum- and product-free subset &lt;span class=&quot;math-container&quot;&gt;\$S \subset \mathbb N = \{1,2,3,\ldots \}\$&lt;/span&gt; of size &lt;span class=&quot;math-container&quot;&gt;\$|S|=n\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;EDIT:&lt;/strong&gt; with the least possible maximum &lt;span class=&quot;math-container&quot;&gt;\$\max_{s\in S} s\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A set &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; is called sum-free if for all &lt;span class=&quot;math-container&quot;&gt;\$a,b\in S\$&lt;/span&gt; their sum &lt;span class=&quot;math-container&quot;&gt;\$a+b \not \in S\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A set &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; is called product-free if for all &lt;span class=&quot;math-container&quot;&gt;\$a,b\in S\$&lt;/span&gt; their product &lt;span class=&quot;math-container&quot;&gt;\$a\cdot b \not \in S\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/84673/is-it-a-sum-free-set&quot;&gt;related&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;Note that the sets for each &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; might not necessarily be unique.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  n  S&#xA;  1  {2}&#xA;  2  {2,3}&#xA;  3  {3,4,5}&#xA;  5  {4,5,6,7}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;EDIT:&lt;/strong&gt; Ok, no this doesn't work either.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-04-11T12:38:52.300" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17433" PostTypeId="1" AcceptedAnswerId="17435" CreationDate="2019-02-26T12:40:53.147" Score="3" ViewCount="110" Body="&lt;p&gt;An answer I deleted immediately after posting has been down-voted.  Is this possible, or did the down-vote occur in the split-second before I deleted it?&lt;/p&gt;&#xA;" OwnerUserId="85591" LastActivityDate="2019-02-26T14:16:32.120" Title="Can deleted answers be down-voted?" Tags="|support|voting|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17435" PostTypeId="2" ParentId="17433" CreationDate="2019-02-26T14:16:32.120" Score="8" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If a user that can see deleted posts tries to downvote one, they will get the message:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This post has been deleted; deleted posts can't be voted on&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;However, due to a &lt;s&gt;known bug&lt;/s&gt; &lt;a href=&quot;https://meta.stackexchange.com/q/276269/286591&quot;&gt;horrible design choice in the system&lt;/a&gt;, the system will sometimes automatically give downvotes, which is what probably happened here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If you post a very short answer with no explanation, there's a good chance a system bot will flag it as &quot;potentially low quality&quot; for users to review.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;if that flag is marked helpful, the system will cast a downvote on the post.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When your answer was deleted, the system went &quot;Ha! That answer was deleted. Clearly I was right about the flag.&quot; And marked it as helpful.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Soooo... I guess don't delete posts immediately after posting them? It's also a good idea to add an explanation along with your answer to avoid having it marked as low quality.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ideally, you shouldn't need to worry about that, but that feature was designed with Stack Overflow in mind (where it makes more sense), and the chances of us having it fixed to be non-stupid for this site are slim to none.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2019-02-26T14:16:32.120" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17438" PostTypeId="2" ParentId="2140" CreationDate="2019-02-27T03:47:04.507" Score="1" Body="&lt;h1&gt;Unique Skittle Pairs&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&#xA;This is my first question, so hopefully it's OK.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I like to eat Skittles. However, I only like to eat them in pairs, and and those pairs must not have two Skittles of the same color. Your task is to find the most pairs that you can that match these requirements.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input (taken from standard input) is a set of Skittles formatted like so: &lt;code&gt;pyyyggoooorr&lt;/code&gt;, where &lt;code&gt;p&lt;/code&gt; is purple, &lt;code&gt;y&lt;/code&gt; is yellow, &lt;code&gt;g&lt;/code&gt; is green, &lt;code&gt;o&lt;/code&gt; is orange, and &lt;code&gt;r&lt;/code&gt; is red. The number of letters for each color corresponds to the number of Skittles that are that color. The only colors used in this challenge are purple, yellow, green, orange, and red. The input will always be even in length and lowercase.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output is the most possible pairs of Skittles that I like to eat given the input. Different outputs don't matter as long as they are valid, i.e. for an input of &lt;code&gt;pygo&lt;/code&gt;, both &lt;code&gt;py go&lt;/code&gt; and &lt;code&gt;po gy&lt;/code&gt; are valid outputs. Output for invalid input doesn't matter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output must be in the same format as the test cases.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples/Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Permutations of these solutions are valid. You do not have to output all valid outputs. Multiple output lines here means multiple valid outputs.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; ppyy&#xA;py py&#xA;&#xA;&amp;gt; yggooo&#xA;yo go go&#xA;&#xA;&amp;gt; pyygorrr&#xA;pr yr yg or&#xA;py yr gr or&#xA;&#xA;&amp;gt; yggoor&#xA;yg go or&#xA;yo go gr&#xA;go go yr&#xA;&#xA;&amp;gt; yggor&#xA;(anything, including no output/errors)&#xA;&#xA;&amp;gt; gygoro&#xA;yg go or&#xA;yo go gr&#xA;go go yr&#xA;&#xA;&amp;gt; ygoOor&#xA;(anything, including no output/errors)&#xA;&#xA;&amp;gt; ggorrrrr&#xA;gr gr or&#xA;&#xA;&amp;gt; pppyyygggooorrrr&#xA;py py py ro ro ro rg&#xA;po po po ry ry ry rg&#xA;py po py ro ry ro rg&#xA;etc.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Least bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="85110" LastEditorUserId="85110" LastEditDate="2019-02-27T19:14:16.283" LastActivityDate="2019-02-27T19:14:16.283" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17439" PostTypeId="2" ParentId="17366" CreationDate="2019-02-27T15:27:54.007" Score="0" Body="&lt;p&gt;Designing languages for golfing requires a good amount of exposure to golf problems such that you can create a list of useful structures that you would like to abbreviate. Trivial example constructs are filter, map, zip and reduce operations and various variants of those operations. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The most obvious thing is to pack as much functionality into a single character or single byte (if you don't want to use ASCII). You overload it as much as possible. You can have a character do something for an integer, something else for a double, something else for a list etc. You really want to pack as much functionality into a single character as possible. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The next obvious thing is to have implicit type conversions wherever possible because explicit type conversions would just make a solution one byte longer. Of course, this means you have to trade off between overloading and implicit type conversions. And this is exactly where a lot of experience comes back in such that you know which is going to be used more often. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm the person behind Burlesque (the programming language) and it was never designed to be a golfing language but it eventually turned into one over the course and there are a lot of mistakes (some that were fixed, some that can't be fixed by design) when it comes to golfing. (Most obviously Burlesque uses two characters per built-in, you'd automatically make all burlesque programs half as long if you'd map every burlesque built-in to one byte). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;One other thing you can do is to use parsing errors to &quot;mean&quot; something. I.e. if the parsing error is at the end of a program you can just ignore it or fix it for example in the case of &quot;m{foobar&quot; which is missing a &quot;}&quot; but since it's at the end of the program you could just insert a &quot;}&quot; and you saved one byte. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want to know something or more details you can hit me up in a chat. &lt;/p&gt;&#xA;" OwnerUserId="5429" LastActivityDate="2019-02-27T15:27:54.007" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17440" PostTypeId="2" ParentId="2140" CreationDate="2019-02-27T20:13:18.360" Score="0" Body="&lt;h1&gt;Reducing switches in a binary matrix&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A row's switch count is the amount of times the array switches from &lt;code&gt;1 -&amp;gt; 0&lt;/code&gt; or &lt;code&gt;0 -&amp;gt; 1&lt;/code&gt; when reading the array sequentially. As a Python function this looks like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def row_switch_count(row):&#xA;    switch_total = 0&#xA;&#xA;    last_r = row[0]&#xA;&#xA;    for rr in row[1:]:&#xA;        if last_r != rr:&#xA;            switch_total += 1&#xA;&#xA;        last_r = rr&#xA;&#xA;    return switch_total&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A matrix's switch count is the maximum switch count of all it's rows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def mat_switch_count(bin_mat):&#xA;    max_switch = 0&#xA;&#xA;    for row in bin_mat:&#xA;        count = row_switch_count(row)&#xA;&#xA;        if max_switch &amp;lt; count:&#xA;            max_switch = count&#xA;&#xA;    return max_switch&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Write a function to reduce a matrix's switch count for each row to be less than a desired toggle count by permuting the elements in the &lt;strong&gt;n&lt;/strong&gt;th column. You should permute as few columns as possible.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Permissible permutations&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The only permutation allowed is moving the column. You can move a column's index, but you cannot mutate the column itself. For example, you cannot change a column &lt;code&gt;[1, 0, 0] -&amp;gt; [0, 0, 1]&lt;/code&gt;. However, you can move a column within a matrix:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;([1, 0, 0], -&amp;gt;  ([0, 0, 1],&#xA; [0, 0, 0])      [0, 0, 0])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A binary array with &lt;code&gt;rows &amp;gt; 1&lt;/code&gt; and &lt;code&gt;cols &amp;gt; 5&lt;/code&gt;. The sum of all rows in any given column less than 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;code&gt;desired_toggle_count &amp;gt;= rows&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Note the solutions are not unique and not all solutions need to be provided. However, there is guaranteed to be a solution, since the trivial solution where you sort all the columns, is valid.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;desired_toggle_count=3&#xA;([1,0,1,0,1,0,0],&#xA; [0,0,0,1,0,1,1]) &#xA;=&amp;gt; &#xA;([1,0,1,1,0,0,0],&#xA; [0,0,0,0,1,1,1])&#xA;&#xA;-----&#xA;&#xA;desired_toggle_count=4&#xA;([1,0,1,0,1,0,0],&#xA; [0,0,0,1,0,1,1])&#xA;=&amp;gt;&#xA;([1,0,1,0,0,0,1],&#xA; [0,0,0,1,1,1,0])&#xA;&#xA;or&#xA;&#xA;([1,0,1,1,0,0,0],&#xA; [0,0,0,0,1,1,1]))&#xA;&#xA;----&#xA;&#xA;desired_toggle_count=4&#xA;([1,1,1,0,1,0,1,0,0],&#xA; [0,0,0,1,0,1,0,0,1])&#xA;=&amp;gt;&#xA;([1,1,1,0,1,0,0,0,1],&#xA; [0,0,0,1,0,0,1,1,0])&#xA;&#xA;or&#xA;&#xA;([1,1,1,0,1,1,0,0,0],&#xA; [0,0,0,1,0,0,1,1,0])&#xA;&#xA;----&#xA;&#xA;desired_toggle_count=5&#xA;([1,1,1,0,1,0,1,0,0],&#xA; [0,0,0,1,0,1,0,0,1])&#xA;=&amp;gt; &#xA;([1,1,1,0,1,0,1,0,0],&#xA; [0,0,0,1,0,1,0,0,1])&#xA;&#xA;----&#xA;&#xA;desired_toggle_count=4&#xA;([1,0,1,0,1,0,1],&#xA; [0,1,0,1,0,0,0],&#xA; [0,0,0,0,0,1,0])&#xA;=&amp;gt;&#xA;([1,0,1,0,0,1,1],&#xA; [0,1,0,0,1,0,0],&#xA; [0,0,0,1,0,0,0])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Sandbox comments&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I think this question might have too many requirements to be interesting? Brevity is the soul of wit and this question is not very brief.&lt;/p&gt;&#xA;" OwnerUserId="81091" LastEditorUserId="81091" LastEditDate="2019-03-01T20:03:31.830" LastActivityDate="2019-03-01T20:03:31.830" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17444" PostTypeId="1" CreationDate="2019-02-28T23:30:31.087" Score="5" ViewCount="106" Body="&lt;p&gt;Note this isn't about command line flags, which already have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14339/76162&quot;&gt;consensus here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There was a &lt;a href=&quot;https://codegolf.stackexchange.com/a/180389/76162&quot;&gt;recent PHP answer&lt;/a&gt; involving multiple PHP files. Normally, programs with multiple files are either using one file to import/execute/retrieve data from the others, or else are all called with the interpreter like:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;./lang file1 file2 file3&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, in this answer, the poster specified that the command to execute the program would be:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;php file1;php file2&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;which caused arguments that this was actually just running two programs, or that it should instead count as the Bash language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this a valid way of executing a submission? Does this still count as the PHP language? Do we have a policy on what are the valid ways to execute a submission?&lt;/p&gt;&#xA;" OwnerUserId="76162" LastActivityDate="2019-02-28T23:30:31.087" Title="Non-standard command line calls" Tags="|discussion|policy|" AnswerCount="0" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17445" PostTypeId="2" ParentId="2140" CreationDate="2019-03-02T03:55:40.127" Score="0" Body="&lt;h1&gt;(bit)Wise Images&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a truth table and two images, use the truth table as a bitwise operation to the two images.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example with the truth table:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  1 0&#xA;1 0 0&#xA;0 1 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(Note that the top is the first image and the left is the second)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;and the two images &lt;code&gt;(0, 2, 4)&lt;/code&gt; (a &lt;code&gt;1x1&lt;/code&gt; image, with the numbers being RGB values) and &lt;code&gt;(30, 20, 10)&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You would apply the above truth table to the numbers &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;30&lt;/code&gt;, of which's binary representations are &lt;code&gt;00000&lt;/code&gt; and &lt;code&gt;11110&lt;/code&gt;.&#xA;Using the truth table as a bitwise operation would get us &lt;code&gt;00000&lt;/code&gt;, or in decimal form &lt;code&gt;0&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This means that the red value of the first pixel would be &lt;code&gt;0&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Continuing this with the other RGB values would get us &lt;code&gt;2&lt;/code&gt; and &lt;code&gt;4&lt;/code&gt; for green and blue respectively.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So the output for this would be a &lt;code&gt;1x1&lt;/code&gt; image with the only pixel having an RGB value of &lt;code&gt;0, 2, 4&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;NOTES:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can use any default input or output method.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can assume that the two input images are the same dimensions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can support any image format you want as long as the image format supports RGB values from #000000 (0, 0, 0) to #ffffff (255, 255, 255).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The truth table can be in any format you want&lt;/p&gt;&#xA;" OwnerUserId="83048" LastEditorUserId="83048" LastEditDate="2019-03-03T02:32:50.427" LastActivityDate="2019-03-03T02:32:50.427" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="17447" PostTypeId="1" CreationDate="2019-03-04T17:52:57.193" Score="2" ViewCount="101" Body="&lt;p&gt;Recently, I posted a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question about number sequences. However, as I was looking through the question later, I thought to myself, &quot;&lt;em&gt;Wouldn't this be good as a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt; question?&lt;/em&gt;&quot; It's not that I regret making it code-golf - I very much like it that way. But I also want to see the differences people would make in the algorithm to make it faster, as they can't use recursion, &lt;code&gt;filter()&lt;/code&gt;, etc for it would be too slow.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should I:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A.) Post a separate question with the same body but different tag&#xA;B.) Come up with a scoring algorithm in my original question to combine speed with length&#xA;C.) Leave it as it is&lt;/p&gt;&#xA;" OwnerUserId="85546" LastActivityDate="2019-03-05T04:18:12.670" Title="Can I repost a challenge with different rules?" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="1" ClosedDate="2019-03-08T23:16:40.930" ContentLicense="CC BY-SA 4.0" />
  <row Id="17450" PostTypeId="2" ParentId="17447" CreationDate="2019-03-05T04:18:12.670" Score="3" Body="&lt;p&gt;Our standard rule is that two challenges are duplicates if answers from one could be reused on the other and still be competitive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So in this context, we can apply the rule as follows: if the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; answers are all generally using the fastest algorithm, they'd also be competitive on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;, and so you couldn't repost the challenge; but if the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; answers are generally using slow algorithms (due to that being terser), they wouldn't be competitive on a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt; challenge, and so you can post both challenges alongside each other.&lt;/p&gt;&#xA;" OwnerUserId="76359" LastActivityDate="2019-03-05T04:18:12.670" CommentCount="0" CommunityOwnedDate="2019-03-05T04:18:12.670" ContentLicense="CC BY-SA 4.0" />
  <row Id="17452" PostTypeId="2" ParentId="2140" CreationDate="2019-03-05T23:43:38.483" Score="1" Body="&lt;h1&gt;Sort according to cyclic order&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Cyclic_order&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cyclic order&lt;/a&gt; on a set is a function f taking three distinct elements of a set, returning bool and having following properties:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If f(a, b, c) then f(b, c, a)&lt;/li&gt;&#xA;&lt;li&gt;If f(a, b, c) then not f(c, b, a)&lt;/li&gt;&#xA;&lt;li&gt;If f(a, b, c) and f(a, c, d) then f(a, b, d)&lt;/li&gt;&#xA;&lt;li&gt;One of f(a, b, c) and f(c, b, a) is true&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Values of f when arguments are not distinct don't matter.&#xA;You are given a list of dictinct numbers and a function f posessing the above properties when arguments are taken from the list. Your task is to arrange the numbers in such an odrer that&lt;/p&gt;&#xA;&lt;p&gt;f(a, b, c) if and only if k &amp;gt; j &amp;gt; i or i &amp;gt; k &amp;gt; j or j &amp;gt; i &amp;gt; k&lt;/p&gt;&#xA;&lt;p&gt;(i.e. numbers a, b, c come in that order modulo cyclic permutaion)&lt;/p&gt;&#xA;&lt;p&gt;Score is the total number of calls to the function f on some dataset.&lt;/p&gt;&#xA;&lt;p&gt;It's not very clear to me how to create the dataset and how to count calls to f across different languages. Is it better to just give a list of n*(n-1)*(n-2) values of f as input (and score by bytes)?&lt;/p&gt;&#xA;" OwnerUserId="85838" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-03-06T00:06:27.960" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17453" PostTypeId="2" ParentId="2140" CreationDate="2019-03-06T17:59:34.837" Score="1" Body="&lt;h1&gt;Venn of &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; number of sets&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given positive integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, output &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; 2D bool images with same width and height such that:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;each image should be 4-connected, i.e. for each two pixels that are true, you can start from one and go up, down, left and right for some times to the other pixel, only passing through true pixels.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;each image should have no hole, i.e. the component should be 4-connected&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If we choose itself, its component or neither for each image, their intersection should be non-empty and 4-connected&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Examples (only a finite amount of solution shown, but there are infinitely many more)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input: 1&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.....&#xA;.***.&#xA;.**..&#xA;..*..&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input: 1&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.....&#xA;...*.&#xA;.....&#xA;.....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input: 2&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;..... .....&#xA;.***. ..**.&#xA;..... ..**.&#xA;..... .....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input: 2&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;..... .....&#xA;.**.. ..**.&#xA;..**. ..**.&#xA;..... .....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input: 3&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;..... ..... .....&#xA;.**.. ..**. .....&#xA;.**.. ..**. .***.&#xA;..... ..... .***.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input: 4&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;...**.. .***... ....... .......&#xA;...**.. .***... ..***.. .......&#xA;...**.. .***... ..***.. ..****.&#xA;....... .***... ....... ..****.&#xA;....... ....... ....... ..****.&#xA;....... ....... ....... .......&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Shortest code in each language win&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Venn_diagram#Extensions_to_higher_numbers_of_sets&quot; rel=&quot;nofollow noreferrer&quot;&gt;Reference&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2019-03-06T18:28:32.763" LastActivityDate="2019-03-06T18:28:32.763" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17454" PostTypeId="2" ParentId="2140" CreationDate="2019-03-07T05:53:10.487" Score="0" Body="&lt;h1&gt;Perfectly stable code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You are a.... Let's say &lt;em&gt;prepared&lt;/em&gt;, programmer. You are working on the code to end all code, and it must be perfectly stable. No crashes, memory corruptions, mispellings, or anything else must get in your way. Everything else was set, but to your horrer you discovered that you had not accounted for the possiblity that the &lt;em&gt;sun&lt;/em&gt; could actually flip a bit in your code! Naturally, you must now account for this.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The objective: A hello world program that still works if a single char is changed.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Questions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Has this been asked?&lt;/li&gt;&#xA;&lt;li&gt;What kinds of limits should I impose to make it possible? Allow 10% of chars to  be safe, limit the charset to just ASCII, ect. &lt;/li&gt;&#xA;&lt;li&gt;Is it possible?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42736" LastActivityDate="2019-03-07T05:53:10.487" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17456" PostTypeId="2" ParentId="2140" CreationDate="2019-03-08T07:57:03.323" Score="-3" Body="&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;The original creator of this meme has gone blind, lost his internet and accidentally deleted all his memes. Except this one. He has this one last meme on his desktop, and since he can't see, he wants to know what this meme is.&lt;/p&gt;&#xA;&lt;p&gt;By hearing it.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge is to write the shortest program that will produce a playable audio file that the meme creator will play to hear the text in this meme.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input is the meme below&lt;/li&gt;&#xA;&lt;li&gt;The output will be a audio file that reads the output text in English and has a slight pause after a colon or a new line. But don't read out 'colon'&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Answer the following questions for your readers.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can use any programming language&lt;/li&gt;&#xA;&lt;li&gt;You can use any existing library&lt;/li&gt;&#xA;&lt;li&gt;Output audio must be playable by vlc&lt;/li&gt;&#xA;&lt;li&gt;Networking is not allowed, you cannot connect to any internet services&lt;/li&gt;&#xA;&lt;li&gt;Shortest answer wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/sY5vv.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/sY5vv.png&quot; alt=&quot;surprised pikachu eyesight&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;p&gt;Me: spends 8 hours per day on the internet&lt;/p&gt;&#xA;&lt;p&gt;Eyesight: gets worse&lt;/p&gt;&#xA;&lt;p&gt;me:&lt;/p&gt;&#xA;" OwnerUserId="85896" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-03-08T07:57:03.323" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17458" PostTypeId="2" ParentId="2140" CreationDate="2019-03-08T22:47:42.183" Score="-2" Body="&lt;h1&gt;You can't tell me what to do!!!&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Intentionally break as many coding conventions as possible while crafting a working Hello World&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/coding-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;coding-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;coding-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hello-world&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hello-world&amp;#39;&quot; rel=&quot;tag&quot;&gt;hello-world&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/obfuscation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;obfuscation&amp;#39;&quot; rel=&quot;tag&quot;&gt;obfuscation&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For each language, a coding convention standard will be selected.&#xA;The following is the current list:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;javascript -&gt; &lt;a href=&quot;https://google.github.io/styleguide/jsguide.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Google's Style Guide&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;PHP -&gt; &lt;a href=&quot;https://www.php-fig.org/psr/psr-2/&quot; rel=&quot;nofollow noreferrer&quot;&gt;PSR-2&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;C++ -&gt; &lt;a href=&quot;https://isocpp.org/wiki/faq/coding-standards&quot; rel=&quot;nofollow noreferrer&quot;&gt;ISO C++ Style Guide&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Python -&gt; &lt;a href=&quot;https://www.python.org/dev/peps/pep-0008/&quot; rel=&quot;nofollow noreferrer&quot;&gt;PEP-8&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The maximum file length is 6000 characters. Any code beyond the first 6000 will not count towards broken conventions. (Using conventions that you have set to break after the 6000 point, however, will count against you.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you do not see your language, you may choose one of the most common coding standards for your language, and use that, and (hopefully) it will be noticed and added to the list. Each language is its own competition. (For example: If your code is in Ruby, you're not competing against C++ code)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is the coding equivalent of an ugly baby contest, and pushes you to think outside the box (possibly way too far outside the box). The goal is to write a 'simple' Hello World program. However, you have to do it while breaking as many coding conventions as possible, and being as ugly as possible (but still working!) &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The advantages of this puzzle are multi-purpose. This is to challenge the coder to separate long-standing habits (which generally follow coding conventions) from functionality - to encourage creativity. Further, it also serves as a reverse example to demonstrate when coding conventions are a help vs a hindrance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Remember, ugly doesn't have to mean gibberish or unnecessarily long or poorly running. In fact, code length or runtime do not factor into the evaluation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, you could write procedural code using only classes, use an eval() to declare constants, or use only use variable names using characters that have nothing to do with what the variable does, reverse indentation, or rely exclusively on gotos in an interpreted language. The only thing your code &lt;em&gt;has&lt;/em&gt; to do is output &quot;Hello World&quot; to the command line or an equivalent.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each answer should list and link to coding conventions it breaks and receives 1 point for each broken code convention (but instant total of zero points the code follows any coding convention it says its breaking). If a voter agrees it violates all the listed coding conventions, upvote the code that violates the most while still functioning. (Accidentally violating coding conventions, however, does not count. Each one violated coding convention must be documented and intentional.) &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note: For each coding convention taken on, it must be consistently broken across the entire program. Following the convention even once invalidates your entire code. Habits are your enemy. &#xA;Further note: If you declare you're breaking a convention, you MUST break it. If it's not applicable, it doesn't count.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Alternate Scoring method:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Don't like the &quot;call your shot and then try to make it&quot; scoring method?&#xA;Do you have a readily available git functionality?&#xA;Does the coding convention have a convenient git-hook for code style enforcement?&#xA;Fear not, you have the option for an alternate scoring method:&#xA; 1. Write up your code.&#xA; 2. Run it through the git commit with the hook active.&#xA; 3. If your hook auto-changes code, commit it, and do step 4. If it gives you coding style errors and rejects the commit, count the errors; you get one point for each error and skip to step 5. If you break git due to the hook crashing, list the broken code enforcement, add 50 points, and try again with a different code-enforcement hook. (You CANNOT be an author or contributor to any git-hook before you test against it. This is considered cheating and will be disqualify you.)&#xA; 4. If your hook auto-changes code to fit style enforcement, do a git-diff between your code and the code it committed. Each change is one point.&#xA; 5. Total your points. List your points as an alternate score in your answer's header. List the code-enforcement hooks you tested it against.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm personally not a fan of this scoring method as it allows accidental points and becomes more like it's testing the enforcement hook rather than creative code style breaking, but some like the more computer-controlled scoring method... so there ya go. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;i&gt;Sandbox Reminder: Sandbox is a place for &lt;b&gt;constructive&lt;/b&gt; criticism. Saying, &quot;I don't like it&quot; or &quot;I wouldn't do it&quot; isn't constructive criticism. Last time I had this in the sandbox, most criticism was built on disliking the type of challenge, not actually building it properly. If you don't like the challenge concept, then just don't do it. If you have &lt;b&gt;legitimate&lt;/b&gt; suggestions on how to &lt;b&gt;make the challenge better&lt;/b&gt; then do so. I will do my best to address legitimate points.&lt;/i&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Standard Example Answer format&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;My Oh so wrong Hello world - PHP - Attempting 2 points&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Breaking conventions in PSR-2: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;breaking &quot;Opening braces for classes MUST go on the next line, and closing braces MUST go on the next line after the body.&quot; &lt;/li&gt;&#xA;&lt;li&gt;breaking &quot;All PHP files MUST end with a single blank line.&quot;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;--&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;?php&#xA;class hiworld{public $printme = &quot;Hello World&quot;}&#xA;$hiworld = new hiworld;&#xA;echo $hiworld-&amp;gt;$print; &#xA;?&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Alternate Example Answer format&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;My Oh so wrong and totally fake Hello world - PHP - Alt.Points(53)&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;?php&#xA;class hiworld{public $printme = &quot;Hello World&quot;}&#xA;$hiworld = new hiworld;&#xA;echo $hiworld-&amp;gt;$print; &#xA;?&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Attempted with: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;50 pts: PSR-2 Foo's Enforcement Hook: Foo-Checker [&lt;a href=&quot;http://foo.example.com]&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://foo.example.com]&lt;/a&gt; (Broke)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;3 pts: PSR-2 Bar's Enforcement Hook: Bar-Checker [&lt;a href=&quot;http://bar.example.com]&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://bar.example.com]&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.python.org/dev/peps/pep-0008/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Deleted Version&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="78929" LastEditorUserId="78929" LastEditDate="2019-04-10T16:07:55.557" LastActivityDate="2019-04-10T16:07:55.557" CommentCount="24" ContentLicense="CC BY-SA 4.0" />
  <row Id="17460" PostTypeId="2" ParentId="2140" CreationDate="2019-03-10T01:34:43.290" Score="1" Body="&lt;h1&gt;&lt;code&gt;Data.List.nub :: Eq a =&amp;gt; [a] -&amp;gt; [a]&lt;/code&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Tags:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/haskell&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;haskell&amp;#39;&quot; rel=&quot;tag&quot;&gt;haskell&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/list&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;list&amp;#39;&quot; rel=&quot;tag&quot;&gt;list&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;O(n^2). The &lt;a href=&quot;http://hackage.haskell.org/package/base-4.12.0.0/docs/Data-List.html#v:nub&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;nub&lt;/code&gt;&lt;/a&gt; function removes duplicate elements from a list. In particular, it keeps only the first occurrence of each element. (The name &lt;a href=&quot;http://hackage.haskell.org/package/base-4.12.0.0/docs/Data-List.html#v:nub&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;nub&lt;/code&gt;&lt;/a&gt; means `essence'.) It is a special case of &lt;a href=&quot;http://hackage.haskell.org/package/base-4.12.0.0/docs/Data-List.html#v:nubBy&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;nubBy&lt;/code&gt;&lt;/a&gt;, which allows the programmer to supply their own equality test.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; nub [1,2,3,4,3,2,1,2,4,3,5]&#xA;[1,2,3,4,5]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Goal&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you ever golfed in Haskell and you kind of needed to deduplicate a list, chances are that you chose a different route or were annoyed that there seems to be no solution shorter than importing &lt;code&gt;Data.List&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge you will write a function &lt;code&gt;[a] -&amp;gt; [a]&lt;/code&gt; (unnamed or named) which removes duplicates from a list, the order does not have to be preserved.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Since I don't think it's possible to get something shorter than 20 bytes and Haskell sometimes is really annoying to golf with if you want to use lengthy functions, the scoring mechanism will count tokens, please use &lt;a href=&quot;https://tio.run/##fVPtattAEPzvp5heDJGwrdRp2h/GDoV80ICDCwn0h23KRT7ZIvKeuFsRpU2h79A37Iu4e4pc0hYqIel0Gu3M7s7eab/Z7bxLJ6obpZpj1cmsZeMmaqtzwgSly4mRgKo7uUfO6BVGI9yw7K8xOMX8ingZYzIeY234zBIbYq86OZUVT9R82D/uv@mfyHXcD@uwertUncoVE7VhLv3o6Ihzm7iKjg4OulHDmEFttL83RbGosyxcXVHZPJ8FNsuGQ@EJ6y95KQ/WeYFB2hsO5eVOe/PuBIOH1@GLw2CFw8khJEVJFKe4lgSTjcd4fDG77OTb0jrGuWadXFaUiiL6Y3Oae95vTDWtK702yYdnjclFzT6Zmtq4/0I6nbaqK9sBhHrwsmaylYpmbHV5jcLUt/bekBTa6C26KHIyXv6xmeCA7P1H7by5lIzN6uu30IksZB/5jX1AFjegBjK7Rx0@N5zhKAyDPUSGMCHgGyZprxTeuFQXmg3mN2abn9nC0lLYAzIKt4qmNo1Rt7HCUYolCCzx5jV6PThTFnkaYkSW5M9aGGnNmwY02L/UMQ7lfBJxUoY592m5fBGUyUtAaeunXMCB4jmzcVcsN0wSsVyoZ6ugYqnTlESoOsD4dnY@GyG15NlJvdmf9qGCsiZC1ApgH4c9BQ7ZeyxoQaoNGFrwGdHvuI3z91mdBOG9XhwLXUUP1q18I0vIyJdWOiji/1amFjS/dY/IGZZCL18to67MABaqdQh@fv@BALlizBrIQolZgzn3IxFmINhdRqWdjr2Ld7t/vCoT@ws&quot; rel=&quot;nofollow noreferrer&quot;&gt;this program&lt;/a&gt; to count the tokens and use the generated template.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If your solution is a named function or operator, it must not be defined in another file/module (ie. banning imports). &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each solution may impose type constraints, each set of type constraints counts as its own language, compiler flags can be used without any restrictions.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your solution may not assume that the input is non-empty, however if you have an elegant solution which fails on empty input, feel free to include it in your post.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;How are tokens counted?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Tokens are counted by using GHC's lexer which you can &lt;a href=&quot;https://hackage.haskell.org/package/haskell-src-exts-1.20.0/candidate/docs/Language-Haskell-Exts-Lexer.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;import Language.Haskell.Extes.Lexer&lt;/code&gt;&lt;/a&gt;, except that newlines will count as a token too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;White space is ignored, every token of the language will count as one, no matter how long it is so &lt;code&gt;ma &amp;gt;&amp;gt;= f&lt;/code&gt; will count as the three tokens &lt;code&gt;ma&lt;/code&gt;, &lt;code&gt;&amp;gt;&amp;gt;=&lt;/code&gt; and &lt;code&gt;f&lt;/code&gt; the same holds true for string or number literals (eg. &lt;code&gt;&quot;abc&quot;&lt;/code&gt; or &lt;code&gt;1.0&lt;/code&gt; each count as 1).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[] -&amp;gt; []&#xA;[1] -&amp;gt; [1]&#xA;[1,1,1] -&amp;gt; [1]&#xA;[3,1,1,2] -&amp;gt; [1,2,3]&#xA;[1,2,3,3,2,1] -&amp;gt; [1,2,3]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="48198" LastEditorUserId="48198" LastEditDate="2019-03-16T02:49:19.850" LastActivityDate="2019-03-16T02:49:19.850" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17461" PostTypeId="1" CreationDate="2019-03-12T06:08:50.877" Score="4" ViewCount="197" Body="&lt;p&gt;As per &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7822/what-constitutes-a-free-language-for-cops-and-robbers&quot;&gt;this question's answers&lt;/a&gt;, Scratch 2.0 is no longer considered a &quot;free&quot; language. As per &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11726/allowing-non-free-languages-in-cops-and-robbers-challenges-when-marked-as-non-co&quot;&gt;this question's accepted answer&lt;/a&gt;, non-free languages are allowed if marked as non-competing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Scratch 2.0 used to be runnable on the Web through any browser with Adobe Flash. However, now that Scratch 3.0 has superseded Scratch 2.0, Scratch 2.0 is only runnable through the &lt;a href=&quot;https://scratch.mit.edu/download/scratch2&quot; rel=&quot;nofollow noreferrer&quot;&gt;offline editor&lt;/a&gt;, which is only available for Windows and Mac OS, both of which are non-free operating systems.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should cops-and-robbers cop answers in Scratch 2.0 retroactively be marked non-competitive?&lt;/p&gt;&#xA;" OwnerUserId="83870" LastActivityDate="2019-03-12T06:08:50.877" Title="Scratch 2.0 is no longer considered a &quot;free&quot; language. Does this retroactively make cops-and-robbers cop answers in Scratch 2.0 non-competitive?" Tags="|discussion|policy|answers|cops-and-robbers|" AnswerCount="0" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17462" PostTypeId="1" CreationDate="2019-03-12T09:04:06.443" Score="1" ViewCount="37" Body="&lt;p&gt;Some challenges require, for instance, lists as input. A list has a property being its size.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Several languages have builtins to get properties such as the size for a list (all golfing language, JavaScript, Java, C#, to name a few), some don't (C). Those who don't usually pass the list size as argument (but not always).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So is it acceptable for languages who have builtins to still accept an extra parameter which is a property of the input?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example in JavaScript:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a=&amp;gt;l=&amp;gt;a[l-1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is shorter than&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a=&amp;gt;a[a.length-1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="16236" LastActivityDate="2019-03-12T09:04:06.443" Title="Can we pass properties of the input as parameters?" Tags="|discussion|code-golf|" AnswerCount="0" CommentCount="1" ClosedDate="2019-03-12T15:22:33.270" ContentLicense="CC BY-SA 4.0" />
  <row Id="17463" PostTypeId="2" ParentId="2140" CreationDate="2019-03-12T09:36:23.783" Score="6" Body="&lt;h1&gt;Is this checkmate?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A chess position in &lt;a href=&quot;https://en.wikipedia.org/wiki/Forsyth%E2%80%93Edwards_Notation&quot; rel=&quot;nofollow noreferrer&quot;&gt;FEN&lt;/a&gt; format. You can assume the input is a valid chess position.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Two distinct consistent outputs for checkmate or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/EAy6x.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/EAy6x.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;8/8/8/8/8/5BKN/8/7k b - - 93 47&#xA;Mate&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot;&gt;chess&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user9207" LastEditorDisplayName="user9207" LastEditDate="2019-03-12T11:58:43.267" LastActivityDate="2019-03-12T11:58:43.267" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17469" PostTypeId="1" AcceptedAnswerId="17472" CreationDate="2019-03-14T11:58:49.163" Score="2" ViewCount="113" Body="&lt;p&gt;The phrase &quot;Voidhawk's well-explained answer was the first one here in APL&quot; appears in 3 featured questions on PPCG with an active bounty.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It seems out of place and I'm not sure what it means.  Does it mean voidhawk was awarded a bounty on all of these featured questions?  &lt;/p&gt;&#xA;" OwnerUserId="85383" LastEditorUserId="85383" LastEditDate="2019-03-14T17:58:18.763" LastActivityDate="2019-03-14T17:58:18.763" Title="&quot;Voidhawk's well-explained answer was the first one here in APL&quot;?" Tags="|discussion|bounty|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17470" PostTypeId="2" ParentId="2140" CreationDate="2019-03-14T15:24:46.927" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/games&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;games&amp;#39;&quot; rel=&quot;tag&quot;&gt;games&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/time&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;time&amp;#39;&quot; rel=&quot;tag&quot;&gt;time&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Centurion Counter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The drinking game Centurion is extremely simple - 1 shot of alcohol (usually beer or cider) once a minute for 100 minutes. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Whilst playing the other day a friend commented that we didn't need the tracking app, and that we could have just written the program ourselves. So now it is your turn.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program that once every 60 seconds produces a beep or sound to alert players a minute has passed, and then add one to the counter of how many shots have been had.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The counter starts at 1 (the first shot) and then ends at 100 when the last counter is taken.&lt;/p&gt;&#xA;" OwnerUserId="65359" LastActivityDate="2019-03-14T15:24:46.927" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17471" PostTypeId="1" CreationDate="2019-03-14T17:51:33.577" Score="11" ViewCount="199" Body="&lt;p&gt;Here is an answer that I made recently: &lt;a href=&quot;https://codegolf.stackexchange.com/a/181416/70328&quot;&gt;https://codegolf.stackexchange.com/a/181416/70328&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A commenter suggested that I could remove &lt;code&gt;convert&lt;/code&gt; from my code, and use &lt;code&gt;ImageMagick convert&lt;/code&gt; as the programming language. I think that, since you cannot get &lt;code&gt;convert&lt;/code&gt; without the rest of ImageMagick, it should not be counted as a separate programming language. Who is right here?&lt;/p&gt;&#xA;" OwnerUserId="70328" LastActivityDate="2019-03-26T20:30:11.083" Title="Do different ImageMagick tools count as their own languages?" Tags="|discussion|code-golf|" AnswerCount="3" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17472" PostTypeId="2" ParentId="17469" CreationDate="2019-03-14T17:52:15.940" Score="4" Body="&lt;h2&gt;They are a result of an indefinite bounty&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/43319/ad%C3%A1m&quot;&gt;Adám&lt;/a&gt; posted a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17363/42963&quot;&gt;list of bounties&lt;/a&gt; for challenges to be answered in a flavor of APL, on our List of Bounties with No Deadline. &lt;a href=&quot;https://codegolf.stackexchange.com/users/85183/voidhawk&quot;&gt;voidhawk&lt;/a&gt; subsequently answered those challenges, and Adám (is currently in process of) awarding those bounties.&lt;/p&gt;&#xA;" OwnerUserId="42963" LastActivityDate="2019-03-14T17:52:15.940" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17473" PostTypeId="2" ParentId="2140" CreationDate="2019-03-14T19:32:57.437" Score="2" Body="&lt;h1&gt;The Minigame Challenge&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The idea of this CnR is fairly simple: The Cops must create a simple minigame (explained in more detail below), with a definite goal. That goal may or may not be achievable. The Robbers must then either complete the minigame, or prove its goal is not achievable.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;h3&gt;The Minigame&lt;/h3&gt;&#xA;&lt;p&gt;The Cops will create a &lt;em&gt;suitably simple&lt;/em&gt; minigame with a &lt;em&gt;definite goal&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Acceptable minigame examples are functions that take some input and return some output, with the goal being to either achieve a specific output, or make the program terminate or error.&lt;/p&gt;&#xA;&lt;p&gt;Minigames considered complex (and thus unnacceptable) would be programs/functions that will never terminate in up to 60s (using TIO as a benchmark here), or that simulate complex games (such as blackjack, chess, etc).&lt;/p&gt;&#xA;&lt;h3&gt;Note: I'll try to expand further on what kinds of minigames are acceptable or not. Suggestions are appreciated.&lt;/h3&gt;&#xA;&lt;h3&gt;Cops:&lt;/h3&gt;&#xA;&lt;p&gt;The Cops &lt;strong&gt;must provide&lt;/strong&gt; one of the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A solution for your minigame that achieves the goal, or&lt;/li&gt;&#xA;&lt;li&gt;A proof that the goal for your minigame is not achievable.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;at least 7 days (168h) after the answer was posted for their answer to be considered safe.&lt;/p&gt;&#xA;&lt;p&gt;If your minigame's goal is achievable, it must &lt;strong&gt;always&lt;/strong&gt; be achievable, and it must not contain &amp;quot;insider information&amp;quot;, such as a fixed seed for a pRNG, or pregenerated primes as factors of a number to be factored.&lt;/p&gt;&#xA;&lt;h3&gt;Robbers:&lt;/h3&gt;&#xA;&lt;p&gt;To crack an (unsafe) answer, the robber must provide either a solution to the minigame that achieves the stated goal, or a proof that the goal is not achievable.&lt;/p&gt;&#xA;&lt;h3&gt;Scoring:&lt;/h3&gt;&#xA;&lt;p&gt;Cops will be scored based on standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules, with the fewest number of bytes in an answer being better. Cracked answers will always have a score of &lt;span class=&quot;math-container&quot;&gt;\$\infty\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Robbers are scored according to the number of answers they've cracked.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/20260&quot;&gt;Standard loopholes&lt;/a&gt; are, as usual, forbidden.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge is still under construction&lt;/h1&gt;&#xA;&lt;p&gt;This is the first CnR I've ever come up with. Suggestions and observations are always appreciated.&lt;/p&gt;&#xA;" OwnerUserId="74163" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-03-14T19:32:57.437" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17475" PostTypeId="2" ParentId="2140" CreationDate="2019-03-15T10:22:11.493" Score="0" Body="&lt;p&gt;There doesn't seem to be a &quot;l337 5P34K&quot; challenge, or I have not yet found one. How about it? Simple string manipulation so it should fall under &quot;C0D3 60LF&quot;, right? I.E, Leet speak encoder (challenge one), and leet speak decoder (challenge two).&lt;/p&gt;&#xA;" OwnerUserId="61603" LastActivityDate="2019-03-15T10:22:11.493" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17479" PostTypeId="2" ParentId="5243" CreationDate="2019-03-16T17:25:18.627" Score="8" Body="&lt;h1&gt;500-1000 rep for outscoring in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37188/multiply-with-restricted-operations&quot;&gt;Multiply with restricted operations&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/a/41314/20260&quot;&gt;current best score&lt;/a&gt; is 22 operations.&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;itx = 1/(1+a+b)     #4&#xA;nx = -1/(itx+itx)   #4&#xA;c = -( 1/(itx + itx + 1/(1+nx)) + 1/(1/(a+nx) + 1/(b+nx)) ) #14&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##LYuxCsAgDET3fkXAJUGKiHb0Y9SlLlaKg/16a5oeJNy949rTz6u6GYPbUjhm6QMCWINWR50IWMpvlem@8Or1OhKcmSIIBw3yv3UdRL83GDlKStIQKOtnu0vtmGm@&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 3 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I'll give 500 rep to the first better score, that is 21 operations or fewer.&lt;/p&gt;&#xA;&lt;p&gt;Alternatively, you can get the bounty by proving that 22 is in fact optimal, say with exhaustive search. A weaker proof or lower bound can get a partial bounty.&lt;/p&gt;&#xA;&lt;p&gt;The maximum you can get is 1000 rep, 500 for the optimal proof, and 500 for the solution less than 22 operations long.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="109916" LastEditDate="2022-10-15T10:38:19.783" LastActivityDate="2022-10-15T10:38:19.783" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17480" PostTypeId="2" ParentId="2140" CreationDate="2019-03-17T22:18:47.573" Score="0" Body="&lt;h1&gt;Plot an NACA Airfoil&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/NACA_airfoil&quot; rel=&quot;nofollow noreferrer&quot;&gt;NACA airfoils&lt;/a&gt; are described using a series of digits that represent the miscellaneous properties of the airfoil profile.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The purpose of this challenge is to receive an airfoil number as input, and plot the profile of the airfoil.  &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Background information:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;4-digit NACA airfoils are generally described by their string &lt;code&gt;NACA ABCC&lt;/code&gt;, where &lt;code&gt;A,B&lt;/code&gt; are single digit integers, and &lt;code&gt;CC&lt;/code&gt; is a 2-digit integer.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;A&lt;/code&gt; is the maximum camber as a percentage of the chord length.  Eg. &lt;code&gt;A=2&lt;/code&gt; means that the camber is 2% of the chord length.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;B&lt;/code&gt; is the location (divided by 10) of maximum camber as a percentage of the chord length.  Eg. &lt;code&gt;B=4&lt;/code&gt; means that point of maximum camber is 40% down the length of the chord. &lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;CC&lt;/code&gt; is the profile thickness as a percentage of the chord width. Eg. &lt;code&gt;CC=12&lt;/code&gt; means that the width of the airfoil is 12% of the maximum chord length.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Using the example given above, &lt;code&gt;NACA2412&lt;/code&gt;, a suitable profile plot would look something like this:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/7ADts.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/7ADts.png&quot; alt=&quot;NACA 2412 and NACA 0012&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that in the image above, the Red line is the camber line and the purple is representative of the symmetrical airfoil &lt;code&gt;NACA 0012&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any airfoils with a representative number of &lt;code&gt;NACA 00XX&lt;/code&gt; are symmetrical in nature because they possess zero camber.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Possible scoring criteria are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Any feedback is welcome.  I also plan on having more challenges for the 5-digit and 6-digit profiles.  Eventually, I will add equations to this post too.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another way this challenge could be run would be to have the programmer return a series of points around the profile.  This could be judged both for accuracy and quantity of points returned.  If this approach is used, this would probably be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge.&lt;/p&gt;&#xA;" OwnerUserId="41195" LastEditorUserId="41195" LastEditDate="2019-03-17T22:24:59.913" LastActivityDate="2019-03-17T22:24:59.913" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17483" PostTypeId="1" CreationDate="2019-03-18T19:20:25.380" Score="-1" ViewCount="98" Body="&lt;p&gt;I see the bottom of vote list good and some good questions removed cuz of low votes. Is there way to see the removed or I have to go through all possible question id?&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2019-03-28T02:17:56.417" Title="Can I see a list of removed questions?" Tags="|discussion|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17484" PostTypeId="2" ParentId="17483" CreationDate="2019-03-18T19:38:33.207" Score="2" Body="&lt;h2&gt;Nope&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;With &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/moderator-tools&quot;&gt;2,000 rep&lt;/a&gt; (Or eventually 10K once our privilege levels are adjusted), you can see deleted posts. But you can only see them if you have the link to them. There is no way for normal users to see a list of deleted questions, or to search for deleted questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that you can use the &lt;a href=&quot;https://meta.stackexchange.com/questions/145060/enable-searching-with-deleted1-for-10k-users&quot;&gt;&lt;code&gt;deleted:1&lt;/code&gt; search operator&lt;/a&gt;, but this will only show you your own posts.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2019-03-18T19:38:33.207" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17488" PostTypeId="2" ParentId="2140" CreationDate="2019-03-19T09:20:57.757" Score="0" Body="&lt;h1&gt;Optimize the JSON (WIP)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Consider function &lt;code&gt;f&lt;/code&gt; which takes two objects &lt;code&gt;data&lt;/code&gt; and &lt;code&gt;default&lt;/code&gt;, and merge anything from &lt;code&gt;default&lt;/code&gt; into &lt;code&gt;data&lt;/code&gt; if &lt;code&gt;data&lt;/code&gt; contains no such element. Take the two objects(if the one in your language can handle the required elements) or JSON as input, output a shortest JSON that, when given as &lt;code&gt;data&lt;/code&gt;, output the same object as the original &lt;code&gt;data&lt;/code&gt; do, as long as &lt;code&gt;default&lt;/code&gt; doesn't change.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2019-03-19T09:20:57.757" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17490" PostTypeId="2" ParentId="2140" CreationDate="2019-03-19T20:17:00.213" Score="-3" Body="&lt;h1&gt;Compress briefly&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Compress and decompress &lt;a href=&quot;https://parahumans.wordpress.com/2011/06/11/1-1/&quot; rel=&quot;nofollow noreferrer&quot;&gt;the first chapter of &lt;em&gt;Worm&lt;/em&gt;&lt;/a&gt;, beginning with the opening words &quot;Class ended&quot; and ending with the closing words &quot;my best friend.&quot; (including the period). You do not need to include any of the formatting (copy and paste as plain text).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You may not use any built-in or imported compression functions or procedures. You must implement the compression yourself.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may either write one program to compress and another to decompress, or one program that does both. If you wish, the second option can be a polyglot, where compiling as one language compresses and compiling as the other decompresses.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program must be no more than 2000 bytes long. You may, at your option, compress your program with &lt;code&gt;bzip2&lt;/code&gt; or &lt;code&gt;gzip&lt;/code&gt; before measuring its size for the purpose of meeting this limit.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program does not need to work for any other text.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Standard loopholes apply.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Standard I/O rules apply.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The score is the sum of the total number of bytes of your program(s) and the total number of bytes in the compressed text.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you use a single program to compress and decompress, then you may have to pay a penalty. Specifically, you must pay a number of bytes equal to the &lt;a href=&quot;https://en.wikipedia.org/wiki/Levenshtein_distance&quot; rel=&quot;nofollow noreferrer&quot;&gt;Levenshtein distance&lt;/a&gt; between the shell command needed to (compile and) run your compression program and the one needed to run your decompression program. You can calculate this &lt;a href=&quot;https://planetcalc.com/1721/&quot; rel=&quot;nofollow noreferrer&quot;&gt;online&lt;/a&gt;. A special exception: if you choose to write a polyglot, then you can leave out the paths to the compilers/interpreters when you calculate the penalty.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Tags: code-challenge, compression&lt;/p&gt;&#xA;" OwnerUserId="38603" LastEditorUserId="38603" LastEditDate="2019-03-19T22:22:30.330" LastActivityDate="2019-03-19T22:22:30.330" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="17491" PostTypeId="2" ParentId="2140" CreationDate="2019-03-20T00:46:39.813" Score="0" Body="&lt;h1&gt;Draw these shapes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given: a width, a height, and a set of sets of points. Output: An image where each set of points is connected and colored in (like a shape). Each shape &lt;em&gt;must&lt;/em&gt; be a different color from all of the other shapes, but the difference doesn't matter. The shapes must be in order; whether you start at the end or the beginning of the set doesn't matter, though.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;//the code here has nothing to do with the actual challenge and just shows examples&#xA;&#xA;document.getElementById(&quot;one&quot;).getContext(&quot;2d&quot;).fillRect(0, 0, 300, 300)&#xA;const ctx = document.getElementById(&quot;two&quot;).getContext(&quot;2d&quot;)&#xA;ctx.fillStyle = &quot;black&quot;&#xA;ctx.beginPath();ctx.moveTo(0,0);ctx.lineTo(0,300);ctx.lineTo(300,0);ctx.closePath();ctx.fill()&#xA;ctx.fillStyle = &quot;lime&quot;&#xA;ctx.beginPath();ctx.moveTo(200,0);ctx.lineTo(600,0);ctx.lineTo(300,300);ctx.closePath();ctx.fill()&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-css lang-css prettyprint-override&quot;&gt;&lt;code&gt;canvas {border: 1px dotted black}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;pre&amp;gt;Width: 500, Height: 500, Set: [[[0, 0], [0, 300], [300, 300], [300, 0]]]&amp;lt;/pre&amp;gt;&#xA;&amp;lt;canvas id=&quot;one&quot; width=&quot;500&quot; height=&quot;500&quot;&amp;gt;&amp;lt;/canvas&amp;gt;&#xA;&#xA;&amp;lt;pre&amp;gt;Width: 600, Height: 300, Set:&#xA;[&#xA;  [[0,0], [0,300], [300,0]],&#xA;  [[200,0], [600,0], [300,300]]&#xA;]&amp;lt;/pre&amp;gt;&#xA;&amp;lt;canvas id=&quot;two&quot; width=&quot;600&quot; height=&quot;300&quot;&amp;gt;&amp;lt;/canvas&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Scoring is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="70328" LastEditorUserId="70328" LastEditDate="2019-03-21T15:34:37.607" LastActivityDate="2019-03-21T15:34:37.607" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17494" PostTypeId="2" ParentId="2140" CreationDate="2019-03-21T01:04:32.557" Score="-2" Body="&lt;h1&gt;Bit flipper&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a string s and a positive number n, return the string s with n random bits flipped. (A random number can be generated in any way, including pseudo-random number generators)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Before:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hello World&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;After (n = 2, 2 bits flipped):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hello wOrld&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="86148" LastEditorUserId="86148" LastEditDate="2019-03-27T20:39:41.710" LastActivityDate="2019-03-27T20:39:41.710" CommentCount="16" ContentLicense="CC BY-SA 4.0" />
  <row Id="17495" PostTypeId="2" ParentId="17471" CreationDate="2019-03-21T08:02:13.030" Score="1" Body="&lt;p&gt;Using &lt;code&gt;convert&lt;/code&gt; is not a separate language, but merely providing arguments to the program. I believe the commands are not flexible or expressive enough to be considered a &quot;programming language&quot; rather than a set of flags/instructions, though the precise definition of &quot;programming language&quot; is hazy.  &lt;/p&gt;&#xA;" OwnerUserId="17360" LastActivityDate="2019-03-21T08:02:13.030" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17497" PostTypeId="2" ParentId="17471" CreationDate="2019-03-21T15:19:22.133" Score="4" Body="&lt;h1&gt;It's irrelevant&lt;/h1&gt;&#xA;&lt;p&gt;On PPCG, using home-brewed languages is allowed. Nothing (well, except for the reasons below) stops you from making a new language that is &lt;em&gt;really&lt;/em&gt; good at solving a very limited set of challenges. &lt;code&gt;ImageMagick convert&lt;/code&gt; would be such a language. Feel free to count it as a separate language if the arguments below do not sway you.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Arguably, this falls under &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1071/32352&quot;&gt;this loophole&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;There are two aspects to competing on PPCG. The first is creating the best entry in your language of choice. The second is picking the right language for the job.&lt;sup&gt;+&lt;/sup&gt; By using &lt;code&gt;ImageMagick convert&lt;/code&gt; you may have done really well on the latter part, but I would argue that you will have almost zero competition on the first part. If you enjoy using &lt;code&gt;ImageMagick convert&lt;/code&gt; as a separate language, you may also want to consider competing in local sports event aimed at children age 6 through 8.&lt;/li&gt;&#xA;&lt;li&gt;The income of Fake Magic Internet Points will decrease. FMIPs are given out when other people like your approach. Using a language that is stupidly specific might even result in negative FMIPs. I theorise that the amount of FMIPs is related to how universal you show that your language is. For example, if you solve all the typical questions like Hello World, Fibonacci, Primality tests, FizzBuzz, Anagram check, cat, etc., using &lt;code&gt;ImageMagick convert&lt;/code&gt;, the aforementioned loophole is clearly negated, and you could expect your FMIP count to increase once more.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;sup&gt;+ For example, I program in MATL and Octave. My goal is to outgolf other MATL and Octave entries respectively, but when I use MATL, I do want to see if I can beat Jelly or 05AB1E, and when I use Octave, I like to see if I can outgolf R or Python.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="32352" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-03-21T15:19:22.133" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17503" PostTypeId="2" ParentId="2140" CreationDate="2019-03-24T15:24:29.560" Score="0" Body="&lt;h1&gt;Patch one line&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;First question I've written, feedback is highly appreciated. If you can think of a clever title, I'll take that too.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;In an effort to prove to your employer that Git commit count is a worthless metric, you've decided to break up all your changes from now on line by line.&lt;/p&gt;&#xA;&lt;p&gt;Golf a program which can edit a patch file to remove all changed lines &lt;em&gt;except for one&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Patch file format&lt;/h2&gt;&#xA;&lt;p&gt;The patch file will be given by Git in the &lt;a href=&quot;https://en.wikipedia.org/wiki/Diff#Unified_format&quot; rel=&quot;nofollow noreferrer&quot;&gt;unified diff format&lt;/a&gt;, although git will append multiple file changes together:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;diff --git a/afile b/afile&#xA;index bf70e9e..d2df230 100644&#xA;--- a/afile&#xA;+++ b/afile&#xA;@@ -1,8 +1,9 @@&#xA;-Lorem ipsum dolor sit amet,&#xA;+Lorem IPSUM dolor sit amet,&#xA;+++ (good luck parsing this line)&#xA; consectetur adipiscing elit.&#xA;    Duis est elit, imperdiet ac dolor quis,&#xA;    volutpat commodo nunc.&#xA;diff --git a/bfile b/bfile&#xA;index c484b2b..db4afe5 100644&#xA;--- a/bfile&#xA;+++ b/bfile&#xA;@@ -1,11 +1,7 @@&#xA;-#&#xA;-# /etc/bash.bashrc&#xA;-#&#xA;-&#xA; # If not running interactively, don't do anything&#xA; [[ $- != *i* ]] &amp;amp;&amp;amp; return&#xA; &#xA; [[ $DISPLAY ]] &amp;amp;&amp;amp; shopt -s checkwinsize&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here are two accepted outputs for the above patch file:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;diff --git a/afile b/afile&#xA;index bf70e9e..d2df230 100644&#xA;--- a/afile&#xA;+++ b/afile&#xA;@@ -1,8 +1,9 @@&#xA; Lorem ipsum dolor sit amet,&#xA;+++ (good luck parsing this line)&#xA; consectetur adipiscing elit.&#xA;    Duis est elit, imperdiet ac dolor quis,&#xA;    volutpat commodo nunc.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;diff --git a/afile b/afile&#xA;index bf70e9e..d2df230 100644&#xA;--- a/afile&#xA;+++ b/afile&#xA;@@ -1,8 +1,9 @@&#xA;-Lorem ipsum dolor sit amet,&#xA; consectetur adipiscing elit.&#xA;    Duis est elit, imperdiet ac dolor quis,&#xA;    volutpat commodo nunc.&#xA;diff --git a/bfile b/bfile&#xA;index c484b2b..db4afe5 100644&#xA;--- a/bfile&#xA;+++ b/bfile&#xA;@@ -1,11 +1,7 @@&#xA; #&#xA; # /etc/bash.bashrc&#xA; #&#xA; &#xA; # If not running interactively, don't do anything&#xA; [[ $- != *i* ]] &amp;amp;&amp;amp; return&#xA; &#xA; [[ $DISPLAY ]] &amp;amp;&amp;amp; shopt -s checkwinsize&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Assumptions&lt;/h3&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Any other corner cases I'm missing?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;You do &lt;em&gt;not&lt;/em&gt; need to handle the following cases:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A file is deleted, renamed, or added&lt;/li&gt;&#xA;&lt;li&gt;A file has changed its mode&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You &lt;em&gt;do&lt;/em&gt; need to handle the following cases:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An added line starts with &lt;code&gt;++&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;A removed line starts with &lt;code&gt;--&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;There are changes in multiple files (although you can remove one of the diffs and git will still patch okay)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Input/Output&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Is this much explanation necessary?&lt;/p&gt;&#xA;&lt;p&gt;I added the stdin/stdout method since I imagine it's more conducive to golfing in some langs... Should I do any kind of bonus/penalty?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Your program may either take the name of the patch file as its first parameter and do an in-place edit (this will let &lt;code&gt;GIT_EDITOR=/path/to/your/program git add -e&lt;/code&gt; apply the patch), &lt;em&gt;or&lt;/em&gt; read from stdin and write to stdout such that the following will correctly apply the patch:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;$ cat &amp;gt; oneline.sh &amp;lt;&amp;lt; EOF&#xA;#!/bin/sh&#xA;mv &amp;quot;$1&amp;quot; &amp;quot;$1.old&amp;quot;&#xA;/path/to/your/program &amp;lt; &amp;quot;$1.old&amp;quot; &amp;gt; &amp;quot;$1&amp;quot;&#xA;EOF&#xA;$ chmod +x oneline.sh; GIT_EDITOR=./oneline.sh git add -e&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Refer to the EDITING PATCHES section of &lt;a href=&quot;https://manpage.me/?q=git-add&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;man git-add&lt;/code&gt;&lt;/a&gt; for some helpful info on editing the patch file.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="86147" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-03-24T15:31:27.393" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17504" PostTypeId="2" ParentId="2140" CreationDate="2019-03-24T22:39:22.430" Score="2" Body="&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Create a function takes in two 2-dimensional arrays of Characters (or Strings if the programming language does not have characters as a datatype) as inputs: &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to determine if &lt;code&gt;b&lt;/code&gt; contains &lt;code&gt;a&lt;/code&gt;. If this is so, return &lt;code&gt;true&lt;/code&gt;. Otherwise, return &lt;code&gt;false&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sample Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;a&lt;/code&gt;:  &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;123&#xA;456&#xA;789&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;b&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;123&#xA;456&#xA;789&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;should return &lt;code&gt;true&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;a&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;code&#xA;golf&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;b&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;thisis&#xA;code!!&#xA;golf!!&#xA;ohyeah&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;should return &lt;code&gt;true&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;a&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abcd&#xA;efgh&#xA;ijkl&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;b&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abcdef&#xA;ghijkl&#xA;mnopqr&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;should return &lt;code&gt;false&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Least bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="69606" LastActivityDate="2019-03-24T22:39:22.430" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17506" PostTypeId="2" ParentId="2140" CreationDate="2019-03-25T18:07:26.330" Score="0" Body="&lt;h1&gt;A Gödel numbering&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In order to solve this challenge, you need to enumerate all possible programs in a turing-complete language given by you.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strike&gt;Either, you need to provide a function from a string-like type into a big-nat-like type, or you need to provide a program reading the program from STDIN and printing its Gödel number into STDOUT.&lt;/strike&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your function needs to be bijective, such that every different (as given by its behaviour) function gets mapped to a different natural number.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Example: If your turing-complete language is Brainfuck where I/O is the tape before/after the program ran, &lt;code&gt;+-&lt;/code&gt; and &lt;code&gt;++--&lt;/code&gt; may be mapped to the same number, since they both are no-ops.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Your program must terminate for every possible input.&lt;/li&gt;&#xA;&lt;li&gt;Give a specification of your used language in the post or link it.&lt;/li&gt;&#xA;&lt;li&gt;This is a code golf (measuring in bytes).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="53416" LastEditorUserId="53416" LastEditDate="2019-03-25T18:37:46.263" LastActivityDate="2019-03-25T18:37:46.263" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="17509" PostTypeId="2" ParentId="407" CreationDate="2019-03-26T19:58:38.980" Score="4" Body="&lt;p&gt;This specific issue is no longer a problem; with the creation of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; for &quot;most votes wins&quot;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; is now pretty much being used only as intended.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; tag itself has some issues, but they're unrelated to misuse of the tag.&lt;/p&gt;&#xA;" OwnerUserId="76359" LastActivityDate="2019-03-26T19:58:38.980" CommentCount="0" CommunityOwnedDate="2019-03-26T19:58:38.980" ContentLicense="CC BY-SA 4.0" />
  <row Id="17510" PostTypeId="2" ParentId="17471" CreationDate="2019-03-26T20:30:11.083" Score="2" Body="&lt;h1&gt;Yes it is a valid language, but you do not need to use it&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This does count as a language for the purposes of competing on this site. It is trivial to write an interpreter for this new language, so it is valid. Historically we required a language to meet certain criteria to be valid, but &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7518/20283&quot;&gt;the most recent answer to &quot;What are programming languages?&quot;&lt;/a&gt; has strong consensus for relaxing these requirements.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, there are also many other &quot;languages&quot; that could be defined like that, and although valid they rarely get used in practice. Just because it's technically valid doesn't make it a fun or interesting thing to do. You are under no obligation to use this alternative language just because it would give a lower score. Similarly you are under no obligation to switch to a golfing language even though that would likely give a lower score in many cases. Enjoy golfing in your language(s) of choice. For each one, strive for the lowest score &lt;em&gt;in that language&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2019-03-26T20:30:11.083" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17512" PostTypeId="2" ParentId="1061" CreationDate="2019-03-27T05:57:46.140" Score="11" Body="&lt;h3&gt;Empty answers to questions requiring an interpreter&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If a question asks for an implementation of a language or a machine, the language/machine itself is a terribly boring answer. In particular:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&quot;Simulating&quot; a machine on that machine by accepting the initial state as its own initial state and producing the final state as its own final state.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&quot;Interpreting&quot; a language using an empty program that &quot;accepts input&quot; as the rest (i.e., all) of what's fed to the interpreter.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="38603" LastActivityDate="2019-03-27T05:57:46.140" CommentCount="3" CommunityOwnedDate="2019-03-27T05:57:46.140" ContentLicense="CC BY-SA 4.0" />
  <row Id="17514" PostTypeId="2" ParentId="2140" CreationDate="2019-03-27T16:24:45.130" Score="2" Body="&lt;h1&gt;Finding Points in Convex Hulls&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Convex hulls are notoriously hard to deal with, so today's challenge will deal with a relatively simple premise: given a convex hull defined by a set of points, and an additional point, find whether the additional point lies in the hull.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, for some definitions&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The convex hull of a finite set X, a subset of R^n, is the set of convex combinations of points of $X$.&lt;/li&gt;&#xA;&lt;li&gt;A convex combination of points x1,x2,...,xn is a point of the form a1x1+a2x2+...+anxn such that all ai&gt;=0 and the sum of all of the ai is 1.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Input/Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The input is rather flexible, as long as it contains the appropriate information to express the convex hull and additional point.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An example of a valid input format to express the convex hull represented by (0,1,2),(4,3,2),(8,8,8) and the point (5,5,5) is&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;([(0,1,2),(4,3,2),(8,8,8)],(5,5,5))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The output is a truthy/falsy value, depending on whether the point is contained in the hull.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Remarks&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There are a lot of packages and libraries that deal with convex hulls, such as &lt;code&gt;scipy.spatial&lt;/code&gt;. Such libraries/packages are explicitly banned. Libraries that facilitate matrix computations, such as &lt;code&gt;numpy&lt;/code&gt;, are permitted. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winning criterion is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is no limit on the number of dimensions the points can lie in, as long as they all lie in the same number of dimensions.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I will be using the following &lt;a href=&quot;https://tio.run/##rVLLasMwELzrKxbnYhFj0tclkF5aSo@l9FZCEPY6XqpIQlrTuj/vSnISWnKtLkKzszOjldzIvTU309R5e4DQkBvr4BST0kAHZz3DI2o1GDWK49kMBzeCCmCcaLEDMrt@0Lp0FaRdrgXERR0Yy0CBTGBlGixTsTqJHVlpJRw2Z5vMkyKXPfLgTWbUHZl2F2IGjV@lk/eblRCLNwyMLSiPwD2Cs2Q4wCdmpOmx@SCzT1lidcwgmczMkvCEqKHzGLttNHNaNVkoIHhl2jiRPRr0iq2PqsQ9jHbwR5ta8Oy@iZOoZ37eyutVdRtvsHjQdrgIx73ijMXZkUnxkuS/5Gmy32WeuzmP85FWFs9p3i@5pZCisx4oTSU3z68yE0meOl4xDPov@5tcOV@/ZqspcCmr00eY8SoLynNZ/tYO7Et6X23lslhDsZyPV1spp@kH&quot; rel=&quot;nofollow noreferrer&quot;&gt;tio&lt;/a&gt; link for testing the validity of solutions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some smaller test cases:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;([(1,1)],(1,1)) - True&#xA;([(1,1)],(1,2)) - False&#xA;([(1,1,1),(3,3,1)],(2,3,1)) - False&#xA;([(1,1,1),(3,3,1)],(2,2,1)) - True&#xA;([(0,0),(3,3),(0,6)],(2,4)) - True&#xA;([(0,0),(3,3),(0,6)],(1,1)) - True&#xA;([(0,0),(3,3),(0,5)],(2,4)) - False&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Questions for Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Is code golf the best criteria for this? That might encourage brute force searches on every combination of points... any suggestions?&lt;/p&gt;&#xA;" OwnerUserId="82007" LastEditorUserId="82007" LastEditDate="2019-03-28T15:08:37.173" LastActivityDate="2019-03-28T15:08:37.173" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17516" PostTypeId="2" ParentId="2140" CreationDate="2019-03-27T23:32:05.677" Score="0" Body="&lt;h1&gt;Mutual quine without sharing characters&lt;/h1&gt;&#xA;&lt;p&gt;Write a chain of at least 2 programs in different languages, that each program except the last one outputs the next, and the last program outputs the first. You may not reuse a character used in one program in any other programs.&lt;/p&gt;&#xA;&lt;p&gt;Each language you use must have an entry in &lt;a href=&quot;https://codegolf.stackexchange.com/q/110648/25180&quot;&gt;Fewest (distinct) characters for Turing Completeness&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your score is the sum of the square of the best score in that challenge for each language you use. Highest score wins. Other users could challenge your score by posting better answers in that challenge.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Problems:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bytes / characters.&lt;/li&gt;&#xA;&lt;li&gt;How to define a proper quine for mutual quines? Without the restrictions specific to this challenge, someone will probably just print a string in most of the languages, and do all the encoding job in one most powerful language. But it might be not that relevant in this case, as that would most likely result in reusing characters.&lt;/li&gt;&#xA;&lt;li&gt;Scoring: sum(a&lt;sub&gt;n&lt;/sub&gt;&lt;sup&gt;k&lt;/sup&gt; - c), currently k=2 and c=0.&lt;/li&gt;&#xA;&lt;li&gt;Is this cops-and-robbers?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-03-28T00:39:46.157" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17517" PostTypeId="2" ParentId="17483" CreationDate="2019-03-28T00:23:35.803" Score="2" Body="&lt;p&gt;With 2000 reps you may see others' removed posts up to 30 days &lt;a href=&quot;https://codegolf.stackexchange.com/tools?tab=delete&amp;amp;daterange=last30days&quot;&gt;here&lt;/a&gt;, in the &quot;Recent occurrences&quot; - &quot;Recently Deleted&quot; part. But it doesn't seem to cover self deletes.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="25180" LastEditDate="2019-03-28T02:17:56.417" LastActivityDate="2019-03-28T02:17:56.417" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17519" PostTypeId="1" CreationDate="2019-03-30T11:30:32.613" Score="2" ViewCount="55" Body="&lt;p&gt;In certain languages (i.e. C), writes to streams like &lt;code&gt;stdout&lt;/code&gt; can be buffered by default - what this means is that when one calls functions like &lt;code&gt;putchar()&lt;/code&gt; or &lt;code&gt;printf()&lt;/code&gt; to produce output, it is not necessarily written to the console immediately. Instead, it is (by default) printed when a linefeed is written, the buffer is filled, the stream is closed or the buffer is explicitly flushed (i.e. &lt;code&gt;fflush(stdout)&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This becomes important in certain challenges, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/176319/simulate-a-cisco-ping&quot;&gt;like this one&lt;/a&gt;, which require a delay between outputs and where the length of the source code matters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider the two ways to achieve this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You flush the buffer after every write with a call, i.e. &lt;code&gt;fflush(stdout)&lt;/code&gt;;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;or you turn off buffering for &lt;code&gt;stdout&lt;/code&gt;, i.e. &lt;code&gt;setbuf(stdout,NULL)&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;However, these do not come for free - especially in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; the 14+ extra bytes can really hurt solutions. In fact, in the challenge linked above, none of the answers in C account for &lt;code&gt;stdout&lt;/code&gt; being buffered.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it acceptable to assume that streams are non-buffering, even when by default they are not? Or, in other words, do solutions need to account for output potentially being buffered?&lt;/p&gt;&#xA;" OwnerDisplayName="user77406" LastActivityDate="2019-03-31T12:24:23.213" Title="Where timing between outputs matters, does the solution need to account for buffering?" Tags="|discussion|code-golf|output|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17520" PostTypeId="2" ParentId="2140" CreationDate="2019-03-31T08:15:46.380" Score="0" Body="&lt;h1&gt;Word Calculator &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This special calculator uses words instead of numbers, with these rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Addition joins two or more strings together in the same order they were inputted.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Repeated letters (example: &lt;code&gt;aa&lt;/code&gt;, &lt;code&gt;bb&lt;/code&gt;, etc) in the output become a single letter. If there is more than one repetition, then this is performed only on the first such instance detected, when going in a left-to-right direction.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(eg: &lt;code&gt;tt&lt;/code&gt; becomes &lt;code&gt;t&lt;/code&gt;, &lt;code&gt;tttt&lt;/code&gt; becomes &lt;code&gt;tt&lt;/code&gt;, etc)&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;cat+dog+tiger = catdogtiger&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;dog+cat+tiger = dogcatiger&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;dog+cat+tiger+tuna = dogcatigertuna&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;dog+cat+ttiger+tuna = dogcattigertuna&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;dog+cat+tttiger+tuna = dogcattigertuna&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(last example was originally &lt;code&gt;= dogcattttigertuna&lt;/code&gt;, &lt;code&gt;tttt&lt;/code&gt; is present but only the &lt;em&gt;first&lt;/em&gt; repetition is removed, leading to the answer as shown)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Subtraction follows the same rules as the addition, but with a twist. Addition proceeds as usual, but when a subtraction is encountered, this subtracts as many characters as that string from whatever the output would have been before the subtraction.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You will not be expected to handle negative values.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;cat+dog-tiger = c&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;cat+tiger-dog = cati&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;cat+dog+ttiger-tuna = catdogt&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;cat+dog+tttiger-tuna = catdogtt&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;cat+dog+ttiger-tuna-salmon = c&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;cat-dog = 0&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The shortest code in bytes that performs the above addition and subtraction functions as described, is the winner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard loopholes are not allowed.&lt;/p&gt;&#xA;" OwnerUserId="86316" LastEditorUserId="86316" LastEditDate="2019-04-06T00:39:30.940" LastActivityDate="2019-04-06T00:39:30.940" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="17522" PostTypeId="2" ParentId="17519" CreationDate="2019-03-31T12:24:23.213" Score="2" Body="&lt;h1&gt;It's ok iff the solution works in some configuration&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For example you can specify &quot;&lt;strong&gt;&amp;lt;language&gt; (output to terminal)&lt;/strong&gt;&quot; in the header.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my experience, even though languages have buffering by default they tend to only do line-buffer when the output is interactive, so if the code works fine when output to the terminal it's ok.&lt;/p&gt;&#xA;" OwnerUserId="69850" LastActivityDate="2019-03-31T12:24:23.213" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17526" PostTypeId="1" CreationDate="2019-04-02T01:59:16.917" Score="2" ViewCount="68" Body="&lt;p&gt;I couldn't find anything related to this on meta, so here goes:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've noticed that we've decided that competitions should be within each language for a code-golf competition to avoid golfing languages winning all the time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, since it is a competition in each language, and we can't accept multiple answers for each language, I am asking whether to accept an answer at &lt;em&gt;all&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should PPCG question-askers be accepting an answer or should I not be accepting an answer for programming contests on PPCG?&lt;/p&gt;&#xA;" OwnerUserId="83048" LastActivityDate="2019-04-02T01:59:16.917" Title="Should I accept an answer?" Tags="|discussion|" AnswerCount="0" CommentCount="1" ClosedDate="2019-04-02T14:21:59.933" ContentLicense="CC BY-SA 4.0" />
  <row Id="17529" PostTypeId="2" ParentId="2140" CreationDate="2019-04-02T20:14:13.573" Score="0" Body="&lt;h1&gt;Is the Art Gallery Fully Guarded? (WIP)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Art_gallery_problem&quot; rel=&quot;nofollow noreferrer&quot;&gt;Art Gallery Problem&lt;/a&gt; is a well-studied visibility problem concerning the minimum number of guards that must be placed within a polygon. This challenge will explore a simplified grid-based decision-problem variant to make input and visibility checking simpler.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will receive a grid of walls and floors as input, representing the layout of the art gallery, and a number of guards (either as a list of locations or another value in the grid input.) You must determine whether all floor tiles are visible by at least one guard and return a truthy value if so and a falsy value otherwise.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Visibility&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A floor tile is considered visible to a guard if the line connecting the center of the floor tile to the center of the tile containing the guard does not pass through any wall tiles. If this line passes through the corner of a wall tile, visibility is not obstructed. (&lt;em&gt;Sandbox: this can be an issue for floating point precision. Maybe a more discrete method should be used? Perhaps &lt;a href=&quot;https://en.wikipedia.org/wiki/Bresenham%27s_line_algorithm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Bresenham's line algorithm&lt;/a&gt;?&lt;/em&gt;) The tile a guard occupies is also visible to that guard.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Key: &lt;code&gt;.&lt;/code&gt; Floor, &lt;code&gt;#&lt;/code&gt; Wall, &lt;code&gt;G&lt;/code&gt; Guard&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# . # G . .&#xA;. . # . . #&#xA;. . # # . .&#xA;# G . . . #&#xA;# # # . . #&#xA;. . . G # #&#xA;&#xA;==&amp;gt; YES&#xA;&#xA;&#xA;. # . # # . . .&#xA;. # . . . . . #&#xA;. . . . . G . .&#xA;. . . . . . . .&#xA;. # . . . . . #&#xA;. # . # # . . .&#xA;&#xA;==&amp;gt; NO&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;More TBD after visibility is hammered down&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules, Notes, Assumptions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard challenge rules, IO methods, and loopholes apply&lt;/li&gt;&#xA;&lt;li&gt;Guards may be taken in either as a list of coordinates or embedded within the grid.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that guards will always be standing on a floor tile&lt;/li&gt;&#xA;&lt;li&gt;You may assume that grids will always be perfect rectangles, not jagged arrays&lt;/li&gt;&#xA;&lt;li&gt;You may assume that grids will never be larger than &lt;span class=&quot;math-container&quot;&gt;\$100 \times 100\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Happy Golfing!&lt;/p&gt;&#xA;" OwnerUserId="45613" LastActivityDate="2019-04-02T20:14:13.573" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17532" PostTypeId="2" ParentId="2140" CreationDate="2019-04-04T18:38:05.253" Score="0" Body="&lt;h1&gt;Calculator using only addition&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to create a program or function that emulates a four-function calculator, capable of performing addition, subtraction, multiplication, and integer division. However, the catch is that your code must not use any mathematical operations other than addition. In other words, you must use only addition to implement the three other basic arithmetic operations.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program should take two numbers and an operation as parameters. Input can come in any form, whether it's through function parameters, standard input, etc. The operation can be represented however you want. You could use +, -, *, ÷, or &lt;code&gt;&quot;add&quot;&lt;/code&gt;, &lt;code&gt;&quot;subtract&quot;&lt;/code&gt;, &lt;code&gt;&quot;multiply&quot;&lt;/code&gt;, &lt;code&gt;&quot;divide&quot;&lt;/code&gt;, or whatever else is convenient. For division, you can assume that there will be no division by 0, and that the numbers will evenly divide.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program should output one number to STDOUT, the result of the calculation.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Restriction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As mentioned earlier, you may not use any mathematical operation in your code other than the addition operator.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No mathematical operators other than addition, as specified above.&lt;/li&gt;&#xA;&lt;li&gt;Bitwise operations are not allowed, but logical and comparison operators are.&lt;/li&gt;&#xA;&lt;li&gt;Data type conversion is allowed.&lt;/li&gt;&#xA;&lt;li&gt;Negation using a built in is allowed (e.g. &lt;code&gt;-x&lt;/code&gt; or &lt;code&gt;negate(x)&lt;/code&gt; are both fine).&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;It's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Wouldn't surprise me if this is a duplicate, but I couldn't find it. If it is, just put a link to the original in the comments please.&lt;/li&gt;&#xA;&lt;li&gt;The input section seems like it could use some work, but I don't know what to change about it.&lt;/li&gt;&#xA;&lt;li&gt;Other than that, let me know if there's anything that could be improved.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="62313" LastEditorUserId="62313" LastEditDate="2019-04-05T14:34:55.727" LastActivityDate="2019-04-05T14:34:55.727" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17537" PostTypeId="1" CreationDate="2019-04-05T21:32:29.610" Score="4" ViewCount="126" Body="&lt;p&gt;My challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/182733/solve-subset-sum-in-polynomial-time-if-p-np&quot;&gt;Solve Subset-Sum in polynomial time (...if P = NP)&lt;/a&gt; was closed as a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/8655/golf-the-subset-sum-problem&quot;&gt;Golf the Subset-Sum Problem&lt;/a&gt;. But the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt; aspect of my challenge makes it very different. The main difficulty of my challenge is to succinctly enumerate programs (see the pseudocode I wrote in the linked challenge).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not sure exactly what to do about this, but &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/898/challenge-closed-as-duplicate-thats-clearly-different&quot;&gt;precedent&lt;/a&gt; says I should just ask on meta.&lt;/p&gt;&#xA;" OwnerUserId="26849" LastActivityDate="2019-04-07T19:35:49.837" Title="Challenge (Solve subset sum quickly if P = NP) incorrectly closed as duplicate" Tags="|discussion|close-reasons|" AnswerCount="1" CommentCount="0" ClosedDate="2019-04-10T03:39:02.853" ContentLicense="CC BY-SA 4.0" />
  <row Id="17541" PostTypeId="2" ParentId="11456" CreationDate="2019-04-06T17:04:13.360" Score="3" Body="&lt;p&gt;As @MilkyWay90 pointed out in a comment, the placeholder now says &lt;em&gt;Search on Programming Puzzles and Code Golf...&lt;/em&gt; on the main site and &lt;em&gt;Search on Programming Puzzles and Code Golf Meta ...&lt;/em&gt; here on meta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is due to a network-wide change. The format makes sense for &lt;em&gt;all&lt;/em&gt; Stack Exchange sites, so customization is (imho) no longer required.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2019-04-06T17:04:13.360" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17544" PostTypeId="2" ParentId="17537" CreationDate="2019-04-07T19:35:49.837" Score="6" Body="&lt;p&gt;It seems that the close voters saw the similarities between the two challenges, and interpreted your challenge as a duplicate without reading the finer details that distinguish it from the other challenge. Thankfully, one of our users has reopened the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would like to remind close voters to read challenges carefully before voting to close, as an unwarranted closure can be very offputting to new users.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2019-04-07T19:35:49.837" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17546" PostTypeId="2" ParentId="2140" CreationDate="2019-04-08T21:18:28.810" Score="0" Body="&lt;h1&gt;Compute the order of a Rubik's Cube cycle without trivially counting them&lt;/h1&gt;&#xA;&lt;p&gt;See: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/182709/compute-the-order-of-a-rubiks-cube-cycle-without-trivially-counting-them&quot;&gt;Compute the order of a Rubik&amp;#39;s Cube cycle without trivially counting them&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I asked this question here the other day and it was closed as being a duplicate of another question which I had already linked in the original question followed by an explanation of a constraint that made the my challenge different. A discussion ensued in the comment section debating what made my question a duplicate of the other, mostly revolving around whether this constraint was  &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11197/should-we-disallow-non-observable-requirements&quot;&gt;observable&lt;/a&gt; or not.&lt;/p&gt;&#xA;&lt;p&gt;I understand that the challenge at face value is an example of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges/8079#8079&quot;&gt;Do X without Y&lt;/a&gt; but I think it's still a quality challenge because:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The constraint does not simply exist to require people to come up with loopholes or clever workaround to preform avoid a particular commonly used feature of programming languages. It's not the same problem with an unrelated constraint to &amp;quot;make it interesting&amp;quot;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There really is no ambiguity in terms of whether or not the constraint is being followed for a particular answer. &amp;quot;Without Y&amp;quot; is not hard to define regardless of the language being used.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It changes entire approach needed for the algorithm itself, not just specifics of the implementation. The trivial solution to the question will automatically be preferred by golfers, so the answers of the &amp;quot;duplicate&amp;quot; were not very interesting to me because they mostly worked in the exact same way. By prohibiting this trivial approach, there is still a very wide range of different degrees of efficiency that are possible to achieve through different implementations, and some of these are likely better suited for some languages than others, so I feel the answers will actually show significant diversity in their implementations, which in my opinion is a hallmark of a high quality challenge.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;I really think this constraint introduces a meaningfully different and interesting challenge when compared to the other question and I want to see the creative solutions that golfers will come up with to solve it. But as I originally wrote it, and even with the addition of edits I made to make it more clear, it was apparently not sufficient to reopen the question.&lt;/p&gt;&#xA;&lt;p&gt;Can anyone think of a way to write this question or define the constraint in a way that would make it more clearly not a duplicate, or eliminate the problems brought up in the comments without restricting the implementation further?&lt;/p&gt;&#xA;&lt;p&gt;Do you think I'm only facing this scrutiny because I'm a newer member who hasn't posted much? Would someone with more reputation that me be willing to post it on my behalf?&lt;/p&gt;&#xA;" OwnerUserId="86391" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-04-08T21:18:28.810" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="17548" PostTypeId="1" CreationDate="2019-04-10T03:23:06.787" Score="64" ViewCount="1915" Body="&lt;p&gt;The long wait is almost over!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You have been eminently patient while we've gotten other site designs finished and then completely redesigned the layout of the network. Now that all of that heavy lifting is complete, we're working on designs for our graduated sites that are still in the beta theme and you're up next!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Over the next few weeks we'll be going through the following process: &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;strong&gt;Collect ideas&lt;/strong&gt; from y'all about what you'd like this site to look like (that's what this post is for) See below for more info&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Create a design &amp;amp; release it&lt;/strong&gt; and get feedback from y'all. We'll make the site live and post an announcement on meta where you can give feedback.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Make adjustments&lt;/strong&gt; We hope that you love the design we built in the prior phase but we expect some minor adjustments may be necessary.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Phase 1 - Collecting Ideas&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;You have until 17 April to submit ideas for your site design.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;It looks like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7897/graduation-design-ideas&quot;&gt;y'all have been really excited about the possibility of a site design for a while&lt;/a&gt; and even have a userscript to change the site appearance. I see that discussion was almost three years ago. We'll be looking those ideas over in addition but if you have new ideas or if there are specific standout ideas on that discussion that you'd like to mention again, please add them as answers here. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;We're excited to revisit this process with you and I'll be here to answer any questions you have. While I'm not a designer. I've been working with site themes for many months now so I have lots of the answers and, if I don't, I know who to reach out to.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As I mentioned, the sites have gone through a big redesign since you graduated, so there are some limitations to what we can do for you but there's still a lot we can customize. If you're interested in seeing what you can expect to be customized, there's a detailed outline on &lt;a href=&quot;https://meta.stackexchange.com/questions/319274/responsive-design-themes-what-can-sites-customize-and-how-can-they-get-changes&quot;&gt;Meta Stack Exchange here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We need your help creating a gallery of concepts for Lisa to work from to create your design. Don't worry if you're not artistic or able to come up with beautifully rendered examples. You're the experts in your site and how to exemplify your subject's identity and we need your help if we want your site to fit you. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;That could be symbols or a color palette or example images - things that you think really capture some of the personality of the community or define PPCG so that when new users come here, they'll immediately know they're in the right place. It can also be helpful to know what you specifically wouldn't want in some cases - I see you mention not wanting anything golf-related on the other post, for example.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lisa's a really talented designer, so even if what you send our way looks like the drawings my two-year-old brings home from school, she's well-equipped to interpret that and create a beautiful, representative design we hope you'll love.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Design-wise, that's all I've got for you. Don't hesitate to ask if you have any questions either about the process or what we'll be customizing, feel free to ask in comments. Don't forget the &lt;strong&gt;17 April&lt;/strong&gt; deadline. We'll be back a week or two after it with more information and maybe even your design!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Reputation Levels&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Oh... you're still here? I wanted to take a minute to talk about rep levels, which you may remember are tied to the design release.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Y'all have plenty of active, high reputation users (and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/16151/can-we-raise-the-privilege-levels&quot;&gt;have been begging for the higher reputation levels&lt;/a&gt;), so we'll also be raising your reputation levels once the design is complete. This means that some of you may lose privileges you currently have as we &lt;a href=&quot;https://meta.stackexchange.com/questions/139432/reputation-privileges-when-a-beta-becomes-a-fully-fledged-site&quot;&gt;do not grandfather users in&lt;/a&gt;. To see more information about this and what the reputation levels will change to, please see the Meta Stack Exchange FAQ: &lt;a href=&quot;https://meta.stackexchange.com/questions/58587/reputation-requirements-compared&quot;&gt;Reputation requirements compared&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Oh, Who am I?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If you don't know me, I'm one of the &lt;a href=&quot;https://meta.stackexchange.com/questions/99338/who-are-the-community-team-and-what-do-they-do?r=SearchResults&amp;amp;s=1|146.7533&quot;&gt;Community Managers&lt;/a&gt; here at Stack Exchange. I'm here to listen to your input and convey it to our designer, Lisa, so that she can start working on your site design. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Update:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Thanks so much for your input. We're looking it over and will start working on your design.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I do want to say a couple of things, though. I've really enjoyed seeing the neat ideas y'all have for changing this site and I'm really sorry to have to clarify... &lt;strong&gt;when I say &quot;site design&quot; I mean what some sites call a &quot;skin&quot;&lt;/strong&gt;. This change won't be impacting the functionality or positioning of where the elements on the page are here. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you have requests for this sort of thing, you can create a Feature Request post here on PPCG Meta - or link me to one if it already exists, but they won't be considered as part of this work. I'm sorry.&lt;/p&gt;&#xA;" OwnerUserId="78028" LastEditorUserId="78028" LastEditDate="2019-05-08T02:12:56.350" LastActivityDate="2019-05-08T02:12:56.350" Title="The PPCG Site design is on its way - help us make it awesome!" Tags="|discussion|site-design|" AnswerCount="13" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="17549" PostTypeId="2" ParentId="17548" CreationDate="2019-04-10T05:17:39.167" Score="52" Body="&lt;h1&gt;Better, and served, monospace font&lt;/h1&gt;&#xA;&lt;p&gt;Yes, I know this isn't on the list of currently modifiable features, but I really think that this is the single most important design issue that is very easy to fix.&lt;/p&gt;&#xA;&lt;p&gt;The current monospace font stack is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;font-family:&#xA;Consolas,&#xA;Menlo,&#xA;Monaco,&#xA;Lucida Console,&#xA;Liberation Mono,&#xA;DejaVu Sans Mono,&#xA;Bitstream Vera Sans Mono,&#xA;Courier New,&#xA;monospace,&#xA;sans-serif;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;A quick glance at our site's content will show that non-ASCII programming languages are very frequent here, some of them maybe even as frequently used here as the mainstream languages are &amp;quot;out there&amp;quot;. This means that good support for non-ASCII monospace text is essential. Unfortunately, the first five entries in the stack are not very good, and no fonts are hosted by Stack Exchange as fallbacks if the user does not have any of the listed fonts.&lt;/p&gt;&#xA;&lt;p&gt;As the Microsoft Edge browser becomes yet another Chromium browser, it becomes even more important that a good font is available, because Chromium's Blink rendering engine prefers a consistent look over glyph fidelity. This means that if a font is missing a character, Blink will rather use Unicode combining characters to attempt to overlay characters that together look like the needed symbol, rather than searching up the font stack for a font that has the composite symbol. If you see &lt;code&gt;≢ &lt;/code&gt; as similar to &lt;code&gt;≡/&lt;/code&gt; rather than &lt;sup&gt;&lt;sub&gt;&lt;span class=&quot;math-container&quot;&gt;\$≢\$&lt;/span&gt;&lt;/sub&gt;&lt;/sup&gt; then your browser has this issue.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;I suggest that &lt;code&gt;DejaVu Sans Mono&lt;/code&gt; be moved up to the very top of the stack, and that it is served by the server (with &lt;code&gt;@font-face&lt;/code&gt;) when not present locally.&lt;/strong&gt; It is the only one of the listed fonts with a very wide repertoire of characters.&lt;/p&gt;&#xA;&lt;p&gt;I'd personally take this even if it meant forgoing all other site-specific design tweaks, but in fact, that particular font &lt;em&gt;does&lt;/em&gt; have a close relationship with the site: It is extremely common for answers to link to &lt;em&gt;Try it online&lt;/em&gt;, a site which forces DejaVu Sans Mono for all code. If you had the &lt;code&gt;≢&lt;/code&gt; display issue mentioned above, check out how nicely it renders in &lt;a href=&quot;https://tio.run/##y0rNyan8//9RwxzjhztaE49Mtz46@dBuoEDnIgA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Jelly – Try It Online&quot;&gt;Try it online!&lt;/a&gt; Note that &lt;em&gt;Try it online&lt;/em&gt; is run by one of our moderators, and that much of the content there (dedicated code golfing languages) was created and submitted by PPCGers. So &lt;em&gt;Try it online&lt;/em&gt; and PPCG are very closely knit together. In fact, a good percentage of our members would probably be pretty happy if PPCG's design resembled that of &lt;em&gt;Try it online&lt;/em&gt;…&lt;/p&gt;&#xA;&lt;h3&gt;Comparison of fonts&lt;/h3&gt;&#xA;&lt;p&gt;Below is a comparison of how complete the various fonts are when it comes to the non-ASCII characters in six popular programming languages on PPCG. Characters that are included in a font are highlighted in orange on black (&lt;a href=&quot;https://i.stack.imgur.com/j5iQ6.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;dark version with included characters in blue on white&lt;/a&gt;). &lt;a href=&quot;http://apl385.com/fonts/&quot; rel=&quot;nofollow noreferrer&quot;&gt;APL385 Unicode&lt;/a&gt; has been added for completeness.&#xA;&lt;a href=&quot;https://i.stack.imgur.com/NSlWD.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/NSlWD.png&quot; alt=&quot;Font rendering comparison in Firefox 66 on Windows&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-04-22T14:34:02.477" CommentCount="16" ContentLicense="CC BY-SA 4.0" />
  <row Id="17550" PostTypeId="2" ParentId="17548" CreationDate="2019-04-10T06:58:03.307" Score="53" Body="&lt;h1&gt;Nothing in the design related to Golf&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Not a design idea but rather an anti-idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let me repost one very popular answer about our old graduation design ideas question: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7898/41723&quot;&gt;&quot;no relation to the sport golf&quot; by Maltysen&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not sure what design I want for PPCG, but I sure don't want anything related to Golf in that design.&lt;/p&gt;&#xA;" OwnerUserId="41723" LastActivityDate="2019-04-10T06:58:03.307" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17551" PostTypeId="2" ParentId="17548" CreationDate="2019-04-10T09:04:45.817" Score="8" Body="&lt;h1&gt;Design should suggest competition as much as possible&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;PPCG is a competitive site, not &lt;em&gt;a question and answer site&lt;/em&gt;. All Stack Exchange &lt;a href=&quot;https://codegolf.stackexchange.com/tour&quot;&gt;Tour pages&lt;/a&gt; say&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;We're a little bit different from other sites.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I've always understood this as referring to the other Stack Exchange sites. Although I realise now that it may actually not be the intent, we &lt;em&gt;are&lt;/em&gt; actually a little bit different from all the other Stack Exchange sites.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Artwork (banner, icons, etc.) should reflect this as much as possible.&lt;/strong&gt; Here are some inspirational words:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;trophies&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;medals&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;podiums&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;measuring tapes&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;flags&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;laurels&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;gold, silver, bronze&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Maybe we should even switch to serif font&lt;/strong&gt; to set us apart from most general programming topic sites like Stack Overflow and Code Review? MathJax is becoming more popular here too, and looks better with surrounding serif body text than sans serif does.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2019-04-10T09:04:45.817" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17552" PostTypeId="2" ParentId="17548" CreationDate="2019-04-10T09:05:56.350" Score="36" Body="&lt;h1&gt;Text content should suggest competition as much as possible&lt;/h1&gt;&#xA;&lt;p&gt;PPCG is a competitive site, not &lt;em&gt;a question and answer site&lt;/em&gt;. All Stack Exchange &lt;a href=&quot;https://codegolf.stackexchange.com/tour&quot;&gt;Tour pages&lt;/a&gt; say&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;em&gt;We're a little bit different from other sites.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I've always understood this as referring to the other Stack Exchange sites. Although I realise now that it may actually not be the intent, we &lt;em&gt;are&lt;/em&gt; actually a little bit different from all the other Stack Exchange sites.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Text should be adapted&lt;/strong&gt;, mainly to replace the terms &lt;em&gt;questions/answers&lt;/em&gt; with &lt;em&gt;challenges/solutions&lt;/em&gt;. This has already been done in one place on the Tour page, but the main page says &lt;em&gt;Top Questions&lt;/em&gt; title and has &lt;kbd&gt;Ask Question&lt;/kbd&gt;, &lt;kbd&gt;Post Your Answer&lt;/kbd&gt; buttons etc. that should instead read &lt;em&gt;Top Challenges&lt;/em&gt;, &lt;kbd&gt;Post Challenge&lt;/kbd&gt;, &lt;kbd&gt;Post Your Solution&lt;/kbd&gt; etc. and the Tour page needs a bit more tweaking:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Programming Puzzles &amp;amp; Code Golf is a challenge and solve site for&#xA;programming puzzle enthusiasts and code golfers. It's built and run by&#xA;you as part of the Stack Exchange network of Q&amp;amp;A sites. With your&#xA;help, we're working together to build a library of programming puzzles&#xA;and their solutions.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;We're quite different from other sites. Here's how:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Post challenges, see clever solutions, be distracted&lt;/h3&gt;&#xA;&lt;p&gt;This site is all about &lt;strong&gt;posting and solving programming challenges&lt;/strong&gt;. It's not a discussion forum.&#xA;There's no chit-chat.&lt;/p&gt;&#xA;&lt;p&gt;⋮&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-04-11T15:05:08.120" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17553" PostTypeId="2" ParentId="17548" CreationDate="2019-04-10T22:08:34.750" Score="16" Body="&lt;p&gt;One unusual characteristic of this site is the prevalence of esoteric programming languages and paradigms. There are three in particular which I think might be appropriate design elements for the site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first is APL. It is significant in code golf as having a good claim to be the first language in which people competed at golfing, and it is visually distinctive. I suspect that Adám (the same Adám who has posted a couple of answers to this question) might be able to supply a large chunk of real working code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The second is Wireworld. (For image searches it may be useful to include the word &lt;em&gt;automaton&lt;/em&gt;). This is very visual, very simple (it uses a square grid and four colours, but the logic is really in the wiring so one solid colour and one fully transparent one suffice to convey the essence), and Turing complete. For example, take &lt;a href=&quot;http://www.heise.ws/edpeggjrcounter.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ed Pegg's counter&lt;/a&gt;. (If you want to ask Ed Pegg for permission to use it, &lt;a href=&quot;https://math.stackexchange.com/users/11955/ed-pegg&quot;&gt;he is active on math.stackexchange.com&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The third is the Penrose tiling. While this is not itself a programming language, it is possible to build Turing complete automata on top of it. It's been used as a design feature in architecture, particularly in CS departments, and is quite recognisable. It conveys structured chaos.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2019-04-10T22:08:34.750" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17554" PostTypeId="2" ParentId="17548" CreationDate="2019-04-11T17:25:43.953" Score="29" Body="&lt;h2&gt;Incorporate &lt;a href=&quot;https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life&quot; rel=&quot;nofollow noreferrer&quot;&gt;Conway's Game of Life&lt;/a&gt; somewhere&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Game of Life (GOL) is A) Very much in the spirit of this site. It's a mathematical curiosity that only exists for the entertainment of people who like spending their time thinking about math and programming. And B) PPCG has a long history of being fascinated by GOL. Arguably, the most notable challenge of all time on this site was &lt;a href=&quot;https://codegolf.stackexchange.com/q/11880/31716&quot;&gt;Quest for Tetris&lt;/a&gt;. And of course, there was also &lt;a href=&quot;https://codegolf.stackexchange.com/a/111932/31716&quot;&gt;The Digital Clock built in GOL&lt;/a&gt;, which is a smaller project, but arguably more impressive, as it was done by a single user.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't think the theme should be dominated by GOL. But a little reference somewhere, perhaps in the footer, would be great. A &lt;a href=&quot;http://www.conwaylife.com/wiki/Glider&quot; rel=&quot;nofollow noreferrer&quot;&gt;glider&lt;/a&gt; is probably the most famous GOL emblem, but I think something like an &lt;a href=&quot;http://www.conwaylife.com/wiki/R-pentomino&quot; rel=&quot;nofollow noreferrer&quot;&gt;R-pentomino&lt;/a&gt; captures the spirit of the site much better. It's a really small and simple construction (like a code-golf snippet) that takes a very long time before stabilizing (even though it appears simple/short, it accomplishes a lot). &lt;/p&gt;&#xA;" OwnerUserId="31716" LastActivityDate="2019-04-11T17:25:43.953" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17555" PostTypeId="2" ParentId="17548" CreationDate="2019-04-11T18:02:25.550" Score="3" Body="&lt;h3&gt;Don't spam sub-character information.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Don't use grid lines where each cell is much smaller than an overlapping character (such as cells resembling pixels). It would be too noisy as a background if it shows whole characters. Personally I don't see a problem if there are cells with similarly sized or smaller characters, or however big or small cells without characters. It may be also acceptable in some cases for abstract grids without grid lines or even square cells.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Don't create symbols where two letters share a stoke. Ugly and unintelligible in most cases. Personally I don't see a problem for symbols with some characters partially hidden. (But that doesn't mean they would be appealing.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These may seem random, and not likely to happen (and maybe designers already knew this). But I feel it too easy for someone to come up with such ideas, and going into a dead end.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2019-04-11T18:02:25.550" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17558" PostTypeId="2" ParentId="17548" CreationDate="2019-04-12T04:05:22.927" Score="21" Body="&lt;h2&gt;Feel of code golfing&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here's a &quot;palette&quot; of words to try to convey the feel of code golfing:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Shorten, optimize, remove characters, squeeze, revise, strikethroughs, pare down, cleverness, minimize, efficiency, loopholes, inventiveness, unintended uses&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I have no idea how these could be expressed visually, but that's why we have a designer :)&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="73111" LastEditDate="2019-04-12T21:47:19.127" LastActivityDate="2019-04-12T21:47:19.127" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17559" PostTypeId="2" ParentId="2140" CreationDate="2019-04-12T11:58:14.127" Score="3" Body="&lt;h1&gt;The Forest Game (KotH, WIP)&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Summary&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You have been given a space of land to plant trees in. Unfortunately, due to an administrative mix-up, so have 4 other people. You are in a competition with them to make the most money out of your trees within the next 100 years.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The map&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A 10 by 10 grid, representing the area of land. Each square will be one of the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A number, &lt;code&gt;0&lt;/code&gt; to &lt;code&gt;4&lt;/code&gt;, representing a player&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;.&lt;/code&gt;, representing a seed (more later)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;i&lt;/code&gt;, representing a sapling&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;T&lt;/code&gt;, representing a tree&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;F&lt;/code&gt;, an ongoing fire&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&lt;/code&gt;, an empty space&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Actions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Actions, given by your program, are 1 or 2 characters long. The first is the type:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;.&lt;/code&gt; - plant a seed, costs 1&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;i&lt;/code&gt; - plant a sapling, costs 10&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;F&lt;/code&gt; - start a fire, costs 5&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;m&lt;/code&gt; - move, costs 0&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;w&lt;/code&gt; - work, gains 1 (what you do for easy points/to do nothing)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;-&lt;/code&gt; - harvest, variable gains (see below)  &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Anything else as the first character will result in ignored command. The second character is one of &lt;code&gt;`^'&amp;lt;&amp;gt;,v.&lt;/code&gt;, a direction, which refers to the relative location of the square on which to perform the command:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;` ^ '     NW N NE&#xA;&amp;lt;   &amp;gt; --&amp;gt; W     E&#xA;, v .     SW S SE&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For the work command, the second character need not be present, but must be one of the eight if it is. An invalid command is ignored.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Growing&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Seeds become saplings, saplings trees. After 5 rounds (25 turns), a seed becomes a sapling with the probability &lt;span class=&quot;math-container&quot;&gt;\$\frac{8 - C}8\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$C\$&lt;/span&gt; is the number of nearby (diagonally or orthogonally adjacent) saplings or trees. Saplings become trees after 7 rounds, with the same probability (&lt;span class=&quot;math-container&quot;&gt;\$C\$&lt;/span&gt; here is &lt;strong&gt;only trees&lt;/strong&gt;). This is worked out from the top left, going across each row in turn, meaning that each seed/sapling growth may be affected by saplings/trees created &lt;em&gt;that turn&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Value&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When harvested, saplings/trees add to your score. Saplings are valued at 15, trees at 20. After every &lt;em&gt;round&lt;/em&gt;, a tree gains 1 point of value, up to a maximum of 40 points. Seeds cannot be harvested, nor can other players' saplings/trees.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Fires&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Fires spread from the point you set them to all nearby trees and saplings, unless there is a player other than you also nearby. Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  T          T          T          T        &#xA;  i5         i5         F5          5       &#xA;TTTTTT --&amp;gt; FFTTTT --&amp;gt;   FTTT --&amp;gt;    TTT&#xA;F1 ii       1 ii       1 ii       1 ii      &#xA;  i          i          i          i        &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;1&lt;/code&gt; is you and &lt;code&gt;5&lt;/code&gt; is the other player. Each step represents one turn (not one round).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Tournament&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each game, you start with 15 points, and loose/gain them as described in the 'actions' and 'value' sections. The aim is to be the player with the most points at the end of 100 rounds (500 turns in total). Each game will be played 6 times, and then repeated until one player has won more than any of the others. This collection of 6+ games is a 'match'. Every two days, if there have been new players added, the players will be split up into groups of 5, padded out with simple bots of mine if necessary. The winners of each of these will be split into groups of five and the above process repeated until there is only one group of five, the winner of which is the victor!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;I/O&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your submission should be a Python 3 program, with a method &lt;code&gt;run&lt;/code&gt; defined in the global scope. This method will be called with the following parameters:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;map_&lt;/code&gt; - a list of ten lists of single character strings. This will be a deep copy of the map, each string is one of &lt;code&gt;01234.iTF&lt;/code&gt;, representing that square.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;round_&lt;/code&gt; - the round number&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;points&lt;/code&gt; - a list of integers, representing the number of points each player has, in order.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;num&lt;/code&gt; - whereabouts on the &lt;code&gt;points&lt;/code&gt; list you come, also the number representing you and where you come in the turn order.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;It should output the two/one character string mentioned above.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Controller&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;WIP, extremely buggy&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;'''&#xA;Rules&#xA;---&#xA;map, 20 by 20 squares,&#xA;starts empty with randomly placed players&#xA;square can be:&#xA;' ' - empty&#xA;'1' - [0-4], player&#xA;'.' - seed&#xA;'i' - sapling&#xA;'T' - tree&#xA;'F' - flames&#xA;&#xA;actions:&#xA;'m' - move&#xA;'i' - plant sapling&#xA;'.' - plant seed&#xA;'-' - harvest tree&#xA;'F' - start fire&#xA;'w' - work (dir optional and ignored)&#xA;'?' - other, nothing&#xA;&#xA;each action other than move should be accompanied by&#xA;a direction, [&amp;lt;&amp;gt;^v`,'.O] = (W,E,N,S,NW,SW,NE,SE,O)&#xA;&#xA;flames:&#xA; - go out if person nearby other than starter&#xA; - turn every nearby tree/sapling to flames, 33% each&#xA; - go out, leave ' '&#xA;&#xA;costs/bonuses:&#xA;'m' - none&#xA;'i' - -10&#xA;'.' - -1&#xA;'-' - +15 for sapling, +20 for tree + turns living max. +40&#xA;'F' - -1&#xA;'w' - +1&#xA;'?' - none&#xA;&#xA;growing:&#xA;. &amp;gt; l - (8-nearby [lT])/8 chance, after 5 turns&#xA;l &amp;gt; T - (8-nearby [T])/8 chance, after 7 turns&#xA;   T+ - +1 value every turn, max. 40&#xA;&#xA;every five turns, tree drops a seed in an empty nearby square&#xA;start at 10 points&#xA;game end after 100 rounds&#xA;&#xA;I/O&#xA;---&#xA;'''&#xA;&#xA;import random, os, time, sys&#xA;&#xA;&#xA;class Item(object):&#xA;    def __init__(self, x, y, game, creator=None):&#xA;        self.x = x&#xA;        self.y = y&#xA;        self.game = game&#xA;        self.creator = creator&#xA;&#xA;&#xA;class Flame(Item):&#xA;    def update(self, around):&#xA;        burn = []&#xA;        for i in around:&#xA;            if str(i) in map(str, range(6)):&#xA;                if str(i) != str(self.creator):&#xA;                    return&#xA;            elif str(i) in 'Ti':&#xA;                burn.append(i)&#xA;        for i in burn:&#xA;            self.game.place(Flame, i.x, i.y, self.creator)&#xA;        self.game.place(Empty, self.x, self.y)&#xA;&#xA;    def __str__(self):&#xA;        return 'F'&#xA;&#xA;&#xA;class Seed(Item):&#xA;    def __init__(self, x, y, game, creator, count=25, _next=None):&#xA;        _next = _next or Sapling&#xA;        super(Seed, self).__init__(x, y, game, creator)&#xA;        self.counter = count&#xA;        self.creator = creator&#xA;        self.next = _next&#xA;&#xA;    def update(self, around):&#xA;        self.counter -= 1&#xA;        if self.counter:&#xA;            return&#xA;        pos = sum(str(x) in 'Ti' for x in around)&#xA;        if random.randrange(8) in range(pos):&#xA;            self.game.place(Empty, self.x, self.y)&#xA;            return&#xA;        self.game.place(self.next, self.x, self.y, self.creator)&#xA;&#xA;    def __str__(self):&#xA;        return '.'&#xA;&#xA;&#xA;class Sapling(Seed):&#xA;    def __init__(self, x, y, game, creator):&#xA;        super(Sapling, self).__init__(x, y, game, creator, 35, Tree)&#xA;&#xA;    def __str__(self):&#xA;        return 'i'&#xA;&#xA;    def __int__(self):&#xA;        return 15&#xA;&#xA;&#xA;class Tree(Item):&#xA;    def __init__(self, x, y, game, creator):&#xA;        super(Tree, self).__init__(x, y, game, creator)&#xA;        self.val = 20&#xA;&#xA;    def update(self, around):&#xA;        self.val += 1&#xA;        if self.val &amp;gt; 40:&#xA;            self.val = 40&#xA;&#xA;    def __str__(self):&#xA;        return 'T'&#xA;&#xA;    def __int__(self):&#xA;        return self.val&#xA;&#xA;&#xA;class Empty(Item):&#xA;    def update(self, around): pass&#xA;&#xA;    def __str__(self):&#xA;        return ' '&#xA;&#xA;&#xA;class Player(object):&#xA;    def __init__(self, x, y, name, game):&#xA;        self.game = game&#xA;        self.x = x&#xA;        self.y = y&#xA;        self.name = name&#xA;        self.around = (None,) * 8&#xA;        self.points = 15&#xA;&#xA;    def update(self, around):&#xA;        self.around = around&#xA;&#xA;    def command(self, text):&#xA;        text = &quot;mv&quot;&#xA;        if len(text) != 2:&#xA;            if len(text) != 1:&#xA;                return&#xA;            else:&#xA;                self.points += text[0] == 'w'&#xA;                return&#xA;        dirs = &quot;`^'&amp;lt;p&amp;gt;,v.&quot; #p = placeholder&#xA;        if text[1] not in dirs:&#xA;            return&#xA;        ny = self.y + (dirs.index(text[1]) % 3) - 1&#xA;        nx = self.x + int(dirs.index(text[1]) / 3) - 1&#xA;        if (nx, ny) == (self.x, self.y):&#xA;            return&#xA;        itm = self.around[&quot;`&amp;lt;,^v'&amp;gt;.&quot;.index(text[1])]&#xA;        if text[0] == 'w':&#xA;            self.points += 1&#xA;        elif ny &amp;lt; 0 or nx &amp;lt; 0 or not itm:    #remove for wrapping&#xA;            return&#xA;        if text[0] == 'm':&#xA;            if str(itm) == ' ':&#xA;                self.game.move(self.x, self.y, nx, ny)&#xA;        elif text[0] == 'F' and self.points &amp;gt; 0:&#xA;            if str(itm) in 'Ti':  #never!!!&#xA;                self.game.place(Flame, nx, ny, self)&#xA;                self.points -= 1&#xA;        elif text[0] == '.' and self.points &amp;gt; 0:&#xA;            if str(itm) == ' ':&#xA;                print('.')&#xA;                self.game.place(Seed, nx, ny, self)&#xA;                self.points -= 1&#xA;        elif text[0] == 'l' and self.points &amp;gt; 9:&#xA;            if str(itm) == ' ':&#xA;                print('l')&#xA;                self.game.place(Sapling, nx, ny, self)&#xA;                self.points -= 1&#xA;        elif text[0] == '-':&#xA;            if str(itm) in 'Ti':&#xA;                if itm.creator == str(self):  #never!!&#xA;                    self.game.place(Empty, nx, ny)&#xA;                    self.points += int(itm)&#xA;&#xA;    def __str__(self):&#xA;        return str(self.name)&#xA;&#xA;&#xA;class Game(object):&#xA;    def __init__(self, players, names, size=20):&#xA;        self.map = []&#xA;        choose = []&#xA;        self.names = names&#xA;        for x in range(size):&#xA;            self.map.append([])&#xA;            for y in range(size):&#xA;                self.map[-1].append(Empty(x, y, self))&#xA;                choose.append((x, y))&#xA;        self.players = {}&#xA;        random.shuffle(choose)&#xA;        for i in range(len(players)):&#xA;            pos = choose.pop()&#xA;            p = Player(*pos, str(i), self)&#xA;            self.players[players[i]] = p&#xA;            self.map[pos[0]][pos[1]] = p&#xA;        self.round(1)&#xA;&#xA;    def round(self, number):&#xA;        for i in self.players:&#xA;            self.updatemap()&#xA;            self.turn(i, number)&#xA;            if not 'idlelib.run' in sys.modules:&#xA;                time.sleep(0.04)&#xA;                os.system('cls')&#xA;                print(' |0 1 2 3 4 5 6 7 8 9')&#xA;                print('---------------------')&#xA;                [print(str(self.map.index(i)) + '|' + ' '.join(str(j) for j in i)) for i in self.map]&#xA;        if number != 100:&#xA;            self.round(number+1)&#xA;        else:&#xA;            [print(' '.join(str(j) for j in i)) for i in self.map]&#xA;            for i in self.players:&#xA;                print(names[i], self.players[i].points, sep=': ')&#xA;&#xA;    def turn(self, player, rn):&#xA;        points = []&#xA;        n = 0&#xA;        for i in self.players:&#xA;            if i == player:&#xA;                num = n&#xA;            points.append(self.players[i].points)&#xA;        text = player(map_=[x[:] for x in self.map], num=num, points=points, round_=rn)&#xA;        self.players[player].command(text)&#xA;&#xA;    def place(self, item_t, x, y, creator=None):&#xA;        try:&#xA;            itm = item_t(x, y, self, creator)&#xA;            self.map[x][y] = itm&#xA;            return itm&#xA;        except IndexError:&#xA;            pass&#xA;&#xA;    def move(self, ox, oy, x, y):&#xA;        try:&#xA;            self.map[x][y]&#xA;            itm = self.map[ox][oy]&#xA;            self.place(Empty, ox, oy)&#xA;            self.map[x][y] = itm&#xA;            itm.x = x&#xA;            itm.y = y&#xA;        except IndexError:&#xA;            pass&#xA;&#xA;    def updatemap(self):&#xA;        for x in range(len(self.map)):&#xA;            for y in range(len(self.map[x])):&#xA;                around = []&#xA;                for rx in (-1, 0, 1):&#xA;                    for ry in (-1, 0, 1):&#xA;                        if rx or ry:&#xA;                            try:&#xA;                                around.append(self.map[x+rx][y+ry])&#xA;                            except IndexError:&#xA;                                around.append('')&#xA;                if str(self.map[x][y]).strip():&#xA;                    print(' '.join(str(i) for i in around[:3]),&#xA;                          ' '.join(str(i) for i in around[3:6]),&#xA;                          ' '.join(str(i) for i in around[6:]),&#xA;                          str(self.map[x][y]), sep='\n', end='-----')&#xA;                self.map[x][y].update(around)&#xA;&#xA;&#xA;import burnitall, flamingworker, hardworker, plantandwait, seedandreap&#xA;allnames = ('Burn It All', 'Flaming Worker',&#xA;            'Hard-worker', 'Plant And Wait',&#xA;            'Seed And Reap')&#xA;allplayers = (burnitall, flamingworker, hardworker, plantandwait, seedandreap)&#xA;&#xA;players = []&#xA;names = {}&#xA;for i in allplayers:&#xA;    players.append(i.run)&#xA;    names[i.run] = allnames[allplayers.index(i)]&#xA;Game(players, names, 10)&#xA;input()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Game results&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Nothing yet!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ai-player&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ai-player&amp;#39;&quot; rel=&quot;tag&quot;&gt;ai-player&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot;&gt;python&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Any thoughts? Do you like it?&lt;/li&gt;&#xA;  &lt;li&gt;All numbers, rules are undecided, tell me what you think I should change.&lt;/li&gt;&#xA;  &lt;li&gt;I know the controller has many bugs, I posted it here to show that one &lt;em&gt;is&lt;/em&gt; being made but it's very much not ready to use.&lt;/li&gt;&#xA;  &lt;li&gt;That doesn't mean I don't want bug reports, if you use it and spot one, please tell me.&lt;/li&gt;&#xA;  &lt;li&gt;If you don't like Python - tough. It's all I've got on my computer&lt;sup&gt;*1&lt;/sup&gt;, and I don't have space for much else.  &lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;  &#xA;  &lt;p&gt;&lt;sub&gt;&lt;sup&gt;*1&lt;/sup&gt; I tell a lie, I have got Java, but so much fuss in implementing it for one more language? I'll think about it...&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="80756" LastEditorUserId="80756" LastEditDate="2019-04-13T23:41:35.333" LastActivityDate="2019-04-13T23:41:35.333" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17560" PostTypeId="2" ParentId="2140" CreationDate="2019-04-12T14:03:23.200" Score="1" Body="&lt;h1&gt;Make a markdown Table of contents parser&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A simple Code Golf challenge in the likes of the Markdown parser.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The parser should ignore normal text and other markup (without an &lt;code&gt;#&lt;/code&gt; before it).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some valid headers are: &lt;code&gt;### Header 3&lt;/code&gt;, &lt;code&gt;# Header1&lt;/code&gt;, &lt;code&gt;Text # Header&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sample input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# Hello&#xA;Lorem # Hello2&#xA;Hi this is normal text&#xA;&#xA;## This is a subheader&#xA;Lorem ipsum&#xA;&#xA;### Subsub&#xA;Solor di amet&#xA;&#xA;# Hello again&#xA;This is more text!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;sample output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hello&#xA;Hello2&#xA;- This is a subheader&#xA;--- Subsub&#xA;Hello again&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="65837" LastEditorUserId="65837" LastEditDate="2019-04-16T06:58:30.247" LastActivityDate="2019-04-16T06:58:30.247" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17563" PostTypeId="1" AcceptedAnswerId="17564" CreationDate="2019-04-12T22:57:36.557" Score="4" ViewCount="223" Body="&lt;p&gt;I posted a challenge that requires programs to generate a random number in a range, and one &lt;a href=&quot;https://codegolf.stackexchange.com/a/183087/46271&quot;&gt;answer&lt;/a&gt; used the &lt;code&gt;rgeom&lt;/code&gt; function from R. This function uses a geometric random distribution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this allowed by default for challenges requiring &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; values? I'm inclined to think not, since the dictionary definition in this case is &lt;a href=&quot;https://www.merriam-webster.com/dictionary/random&quot; rel=&quot;nofollow noreferrer&quot;&gt;&quot;each [...] elements has equal probability of occurrence&quot;&lt;/a&gt;. I would assume only uniform (to the extent standard PRNGS are) random distributions are allowed.&lt;/p&gt;&#xA;" OwnerUserId="46271" LastActivityDate="2019-04-14T12:49:32.753" Title="Are non-uniform random distributions allowed?" Tags="|discussion|random|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17564" PostTypeId="2" ParentId="17563" CreationDate="2019-04-12T23:35:59.527" Score="11" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;From the tag wiki: &quot;By default, random does not mean &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10923/76162&quot;&gt;uniformly random&lt;/a&gt;, just that all valid outputs are possible.&quot; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is to encourage answers to questions from esolangs where the probability distribution might not necessarily be uniform, or even non-esolang answers with neat tricks to save bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, you can always specify that answers have to be uniform, which would be appropriate in this case since you're talking about (presumably) fair dice rolls.&lt;/p&gt;&#xA;" OwnerUserId="76162" LastEditorUserId="58563" LastEditDate="2019-04-14T12:49:32.753" LastActivityDate="2019-04-14T12:49:32.753" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17565" PostTypeId="2" ParentId="17563" CreationDate="2019-04-13T00:30:10.430" Score="9" Body="&lt;h1&gt;Yes (specific to this answer)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The question asks for rolls of &lt;code&gt;n&lt;/code&gt; on the uniform &lt;code&gt;n&lt;/code&gt;-sided die to be rerolled. We can calculate the expected frequency of each possible number of rerolls and this is given by the geometric distribution. Rather than manually generating uniform rolls as necessary he's just predicting the number of uniform rolls of &lt;code&gt;n&lt;/code&gt; that he would have randomly generated.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2019-04-13T00:30:10.430" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17566" PostTypeId="2" ParentId="17548" CreationDate="2019-04-13T01:59:35.613" Score="25" Body="&lt;h2&gt;Distinctive is good&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We're pretty unusual for a SE site for being &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8350/20260&quot;&gt;about challenges rather than questions and answers&lt;/a&gt;. So, I think it would be good to have a distinctive design that set us apart. I know that every site design is custom and special, but I this think is an opportunity to make something that really stands out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In particular, it would be good to stylistically distinguish us from the many programming sites where people go for coding help, which hapless newbs seem to keep mistaking us for. Part of the issue is that the SE design screams &quot;Q&amp;amp;A&quot;, and has become an iconic template that other Q&amp;amp;A sites have copied. While there's many things we can't change about our site layout and text, maybe a really distinctive visual scheme will make it clear that we're different.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Perhaps we could take visual cues from other coding contest sites such as &lt;a href=&quot;https://www.spoj.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;SPOJ&lt;/a&gt;, &lt;a href=&quot;https://codeforces.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Codeforces&lt;/a&gt;, and &lt;a href=&quot;https://www.codechef.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;CodeChef&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2019-04-13T01:59:35.613" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17567" PostTypeId="2" ParentId="2140" CreationDate="2019-04-13T15:59:56.843" Score="2" Body="&lt;p&gt;This is a post to pre-test for a duplicate question before I spend the time to finish the full post and add test cases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, have we ever had a question for a &quot;snake rotation&quot; of a matrix:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;    +--------------+&#xA;      1  2  3  4  5|&#xA;    +------------  |&#xA;    |10  9  8  7  6|&#xA;    |  +-----------+&#xA;    |11 12 13 14 15&#xA;    +--------------+&#xA;&#xA;&#xA;    +--------------+&#xA;--&amp;gt;  13 14 15  1  2|&#xA;    +------------  |&#xA;    | 7  6  5  4  3|&#xA;    |  +-----------+&#xA;    | 8  9 10 11 12  --&amp;gt;&#xA;    +--------------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The ascii walls are there only for clarity.  Actual input/output would be normal matrices &lt;/p&gt;&#xA;" OwnerUserId="15469" LastEditorUserId="15469" LastEditDate="2019-04-13T17:40:01.150" LastActivityDate="2019-04-13T17:40:01.150" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17568" PostTypeId="2" ParentId="2140" CreationDate="2019-04-13T16:37:59.317" Score="5" Body="&lt;h2&gt;Evaluate C−− expression &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your goal is to a evaluate an expression in &quot;C−−&quot; (not &lt;a href=&quot;https://en.wikipedia.org/wiki/C--&quot; rel=&quot;nofollow noreferrer&quot;&gt;this one&lt;/a&gt;) which uses only the characters are &lt;code&gt;C&lt;/code&gt; and &lt;code&gt;-&lt;/code&gt;. &lt;code&gt;C&lt;/code&gt; is an variable holding an integer whose initial value you're given, and the &lt;code&gt;-&lt;/code&gt; symbol is used in many ways including as a &lt;a href=&quot;https://en.wikipedia.org/wiki/Increment_and_decrement_operators&quot; rel=&quot;nofollow noreferrer&quot;&gt;decrement operator&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;C--&lt;/code&gt; decrements the value stored in &lt;code&gt;C&lt;/code&gt;, then evaluates to that value.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;--C&lt;/code&gt; evaluates to &lt;code&gt;C&lt;/code&gt;, then decrements the value stored in &lt;code&gt;C&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;-expr&lt;/code&gt; negates the value of the expression &lt;code&gt;expr&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;expr1-expr2&lt;/code&gt; takes the difference of the two expressions.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, the C−− specification doesn't state how expressions are parsed or in what order parts are evaluated, saying these are &quot;implementation dependent&quot;. So, it's up to you. For example, &lt;code&gt;--C---C&lt;/code&gt; could be interpreted as &lt;code&gt;-(-(C--)-C)&lt;/code&gt; or &lt;code&gt;(--C)-(--C)&lt;/code&gt; or others, and each &lt;code&gt;--C&lt;/code&gt; might be evaluated before or after other parts of the expression.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; A string consisting of &lt;code&gt;C&lt;/code&gt; and &lt;code&gt;-&lt;/code&gt;, and an integer initial value for &lt;code&gt;C&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The string will be parseable in at least one way. You can take the string as a list of characters, but they must be exactly the characters &lt;code&gt;C&lt;/code&gt; and &lt;code&gt;-&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt; A value this expression could evaluate to.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You don't need to worry about issues with overly large values like overflows or loss of precision.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TODO: test cases&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2019-04-13T16:37:59.317" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17569" PostTypeId="2" ParentId="2140" CreationDate="2019-04-13T21:41:27.977" Score="5" Body="&lt;h1&gt;An Auction in St. Petersburg&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Setup&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Mysterious packages are up for auction today. These boxes are unique in that their values are not known until they are opened, and when they are opened, their values follow a unique distribution:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;probability    value&#xA;0.5               $2&#xA;0.25              $4&#xA;0.125             $8&#xA;0.0625           $16&#xA;1/(2^n)       $(2^n)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In total, there are 100 such packages up for auction, to be sold sequentially. At the start, each bot arrives with $20 in their wallet, and the goal is to walk away with more money than anyone else.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;During each round in the auction, each bot simultaneously submits a bid. The bot with the highest bid (ties broken randomly) must pay the value of the second-highest bid, after which that winning bot receives an amount of money corresponding to the value of the opened package. This money can then be &quot;reinvested&quot; in future rounds of the auction.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The auction day ends once all 100 packages have been sold, or when any bot's wallet value exceeds 2^31. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;I/O format&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As input, your bot receives the following info:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;an array of everyone's current wallet amounts&lt;/li&gt;&#xA;&lt;li&gt;the history of past sale prices (the amount paid, not highest amount bid) and winners&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;As output, your bot returns an integer between 0 and your current wallet amount.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Tournament format&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There will be N=large number of game run according to the above format (100 auction rounds each), and the finishing position of the bots will be averaged across games.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastEditorUserId="2867" LastEditDate="2019-04-17T17:33:55.830" LastActivityDate="2019-04-17T17:33:55.830" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17570" PostTypeId="2" ParentId="2140" CreationDate="2019-04-13T22:42:01.417" Score="2" Body="&lt;h1&gt;How many right triangles can you find?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You will be given an input represented by &lt;code&gt;x&lt;/code&gt;, which is a string containing at least 3 characters. It will consist only of the standard numeric characters, 0 through 9. Your job is to find and output how many right triangles can be formed with the given numbers.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Numbers must be kept in the order they were given in. No mixing them up!&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The numbers for each right triangle must be consecutive. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The order of numbers has to be &lt;code&gt;a&lt;/code&gt; first, &lt;code&gt;b&lt;/code&gt; second, and &lt;code&gt;c&lt;/code&gt; third, and must satisfy the formula &lt;code&gt;a² + b² = c²&lt;/code&gt;. &lt;code&gt;a&lt;/code&gt; can be greater than or less than &lt;code&gt;b&lt;/code&gt;, as long as it satisfies the formula.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Decimal points may be added between any numbers.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Decimals require one or more numbers to be placed before them, e.g. &lt;code&gt;.5&lt;/code&gt; cannot be used as a number but &lt;code&gt;0.5&lt;/code&gt; and &lt;code&gt;12.5&lt;/code&gt; can.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Decimals with at least 4 digits after the decimal point truncated to the third digit, e.g. &lt;code&gt;1.2345&lt;/code&gt; would truncated to &lt;code&gt;1.234&lt;/code&gt; and &lt;code&gt;1.9999&lt;/code&gt; would be truncated to &lt;code&gt;1.999&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Numbers can be used more than once in 2 or more different triangles, but cannot be used multiple times in the same triangle.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Multiple representations of the same value can count multiple times.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Repeating zeros are allowed, e.g. &lt;code&gt;000.5&lt;/code&gt; counts as a number.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;All&lt;/em&gt; possible combinations must be taken into account for your program to be valid.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Example Inputs and Outputs&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input: 345&lt;br&gt;&#xA;Output: 1&lt;br&gt;&#xA;This can be split into &lt;code&gt;3&lt;/code&gt;, &lt;code&gt;4&lt;/code&gt;, and &lt;code&gt;5&lt;/code&gt;, which, of course, form a right triangle.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: 534&lt;br&gt;&#xA;Output: 0&lt;br&gt;&#xA;While this does include the necessary numbers to form a right triangle, they are not in the correct order. It has to follow the formula &lt;code&gt;a² + b² = c²&lt;/code&gt;, but in this case it follows &lt;code&gt;c² = a² + b²&lt;/code&gt;. The order of numbers cannot be changed from the original input, so in this case no right triangles can be formed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: 3415&lt;br&gt;&#xA;Output: 0&lt;br&gt;&#xA;This does contain a &lt;code&gt;3&lt;/code&gt;, &lt;code&gt;4&lt;/code&gt;, and a &lt;code&gt;5&lt;/code&gt;, which can form a right triangle, but they are not consecutive; there is a &lt;code&gt;1&lt;/code&gt; splitting the &lt;code&gt;5&lt;/code&gt; from the &lt;code&gt;3&lt;/code&gt; and &lt;code&gt;4&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: 5567507&lt;br&gt;&#xA;Output: 1&lt;br&gt;&#xA;Because decimals can be added anywhere, it can be changed to &lt;code&gt;55.67.507&lt;/code&gt;, which allows splitting it into &lt;code&gt;5&lt;/code&gt;, &lt;code&gt;5.6&lt;/code&gt;, and &lt;code&gt;7.507&lt;/code&gt; to form a right triangle. Remember that decimals are truncated to the third digit after the decimal point, which is how we get &lt;code&gt;7.507&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: 345567507&lt;br&gt;&#xA;Output: 2&lt;br&gt;&#xA;The first right triangle is formed by &lt;code&gt;3&lt;/code&gt;, &lt;code&gt;4&lt;/code&gt;, and &lt;code&gt;5&lt;/code&gt;. The second one is formed by &lt;code&gt;5567507&lt;/code&gt; (read the previous example for explanation). Numbers can be used more than once, so the first &lt;code&gt;5&lt;/code&gt; was used in the first &lt;em&gt;and&lt;/em&gt; second triangles.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: 51125&lt;br&gt;&#xA;Output: 0&lt;br&gt;&#xA;Because of rule 5, you cannot use &lt;code&gt;.5&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt;, and &lt;code&gt;1.25&lt;/code&gt;. An integer is required before &lt;code&gt;.5&lt;/code&gt; for it to work.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: 051125&lt;br&gt;&#xA;Output: 0&lt;br&gt;&#xA;Unlike the previous example, there &lt;em&gt;is&lt;/em&gt; a number before the first &lt;code&gt;5&lt;/code&gt;, so it is now legal to use &lt;code&gt;0.5&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt;, and &lt;code&gt;1.25&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: 121418439&lt;br&gt;&#xA;Output: 2&lt;br&gt;&#xA;The numbers &lt;code&gt;12&lt;/code&gt; and &lt;code&gt;14&lt;/code&gt; would form a right triangle where side &lt;code&gt;c&lt;/code&gt; has a length of approximately &lt;code&gt;18.43908891458577462000&lt;/code&gt;. Because long decimals are truncated to the third digit after the decimal point, we would be left with &lt;code&gt;18.439&lt;/code&gt;. This fits in with the original input, &lt;code&gt;121418439&lt;/code&gt;. Additionally, &lt;code&gt;1.2&lt;/code&gt;, &lt;code&gt;1.4&lt;/code&gt;, and &lt;code&gt;1.843&lt;/code&gt; counts as a separate combination, thus giving us our second right triangle. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: 10011005&lt;br&gt;&#xA;Output: 8&lt;br&gt;&#xA;Numbers count separately if they're represented in different ways, so this allows for (1, 00, 1), (1.0, 0, 1), (1, 0, 01), (1, 0.01, 1), (1, 0.01, 1.0), (1, 0.01, 1.00), (1.0, 0.1, 1.005), and (1, 00.1, 1.005).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is code golf, so shortest answer in bytes wins. Good luck!&lt;/p&gt;&#xA;" OwnerUserId="84059" LastEditorUserId="84059" LastEditDate="2019-05-23T23:37:24.843" LastActivityDate="2019-05-23T23:37:24.843" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17573" PostTypeId="2" ParentId="17548" CreationDate="2019-04-15T16:33:09.913" Score="36" Body="&lt;h2&gt;Links to sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The sandbox is a meta thread which &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2057/194&quot;&gt;is intended to help people get feedback on draft questions&lt;/a&gt; and so reduce closures, arguments, and other friction on the main site. It's been successful enough that other stacks have copied it. Its biggest problem is channelling new users there. Currently we have:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It's a &lt;a href=&quot;/questions/tagged/featured&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;featured&amp;#39;&quot; rel=&quot;tag&quot;&gt;featured&lt;/a&gt; meta-question. This requires the diamond mods to retag it regularly, because being &lt;a href=&quot;/questions/tagged/featured&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;featured&amp;#39;&quot; rel=&quot;tag&quot;&gt;featured&lt;/a&gt; auto-expires.&lt;/li&gt;&#xA;&lt;li&gt;There's a popular (second most popular at +26/-0 behind first place on +33/-0) &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17309/194&quot;&gt;community ad&lt;/a&gt; for it.&lt;/li&gt;&#xA;&lt;li&gt;There's a link from the on-topic help page.&lt;/li&gt;&#xA;&lt;li&gt;Failing that, it's common to leave comments directing new users to it.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;There are two design changes which would help:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;In the &quot;Ask a question&quot; page, add a link to the page. Suggested text:&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;It's worth polishing your question in the &lt;a href=&quot;//codegolf.meta.stackexchange.com/q/2140&quot;&gt;sandbox&lt;/a&gt; if you haven't already done so.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;Add a link in the right column, above or below the &quot;Featured on meta&quot; panel. This could perhaps use some imagery (inspired by the community ad?) in addition to text. Then the mods could remove the &lt;a href=&quot;/questions/tagged/featured&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;featured&amp;#39;&quot; rel=&quot;tag&quot;&gt;featured&lt;/a&gt; tag, because the new link would be a more eye-catching replacement.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="194" LastActivityDate="2019-04-15T16:33:09.913" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17576" PostTypeId="2" ParentId="2140" CreationDate="2019-04-15T23:50:37.697" Score="3" Body="&lt;h1&gt;Ragtag Band of Misfits&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;(Guaging interest)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;This is a sort of sequel to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/183101/adventurers-in-the-ruins&quot;&gt;Adventurers in the Ruins&lt;/a&gt;, taking place in a 2D dungeon, using a multi-agent team&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;A group of five adventurers enters a dungeon and wants to get the best loot. There are other parties competing for loot. Each party member has different abilities, health, stamina amounts, and carry capacity. Each has independent knowledge and must exchange information via a speak action.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The dungeon is made of rooms connected on a 2D grid. A room may have 1-4 doors. Some doors may be one-way. Rooms may have treasures, monsters, and traps.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As in the prequel challenge, treasure requires bidding and all actions resolve simultaneously with a specific priority on action types.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Party members&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There are five classes of characters comprising each party&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Quartermaster&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;100kg carry capacity, 10 HP, 1000 stamina, 5 power&lt;/li&gt;&#xA;&lt;li&gt;Can heal party members in the same room&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Ranger&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;50kg carry capacity, 10 HP, 1000 stamina, 8 power&lt;/li&gt;&#xA;&lt;li&gt;Can see and attack monsters in adjacent rooms that are connected by a door&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Fighter&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;50kg carry capacity, 25 HP, 1000 stamina, 8 power&lt;/li&gt;&#xA;&lt;li&gt;Double damage to monsters&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Thief&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;30kg carry capacity, 10 HP, 1500 stamina, 5 power&lt;/li&gt;&#xA;&lt;li&gt;Automatically detects booby trapped treasures and can take them without triggering the trap&lt;/li&gt;&#xA;&lt;li&gt;Can steal treasure from enemy adventurers in the same room&lt;/li&gt;&#xA;&lt;li&gt;Can booby trap a treasure, making it appear twice as valuable, but dealing damage to whoever picks it up.&lt;/li&gt;&#xA;&lt;li&gt;Effective bid on treasures is doubled. Wins ties on treasure bids except against other thieves.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Wizard&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;20kg carry capacity, 8 HP, 1500 stamina, 4 power&lt;/li&gt;&#xA;&lt;li&gt;Can communicate telepathically with any single teammate without needing to be in the same room. This is a two-way channel of communication.&lt;/li&gt;&#xA;&lt;li&gt;Can telepathically visit the room a teammate is currently in, seeing its contents and doors and enabling teleportation to that room&lt;/li&gt;&#xA;&lt;li&gt;Can teleport self or ally in same room to any previously visited room or the same room as any ally.&lt;/li&gt;&#xA;&lt;li&gt;Can teleport any ally to the current room&lt;/li&gt;&#xA;&lt;li&gt;Carried treasure does not increase cost for moving between rooms or teleporting&lt;/li&gt;&#xA;&lt;li&gt;Deals half damage to monsters&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Actions available to adventurers of all classes&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Move between rooms&lt;/li&gt;&#xA;&lt;li&gt;Exit the dungeon (if in the starting room)&lt;/li&gt;&#xA;&lt;li&gt;Speak (can be combined with certain actions)&lt;/li&gt;&#xA;&lt;li&gt;Send a message to the wizard&lt;/li&gt;&#xA;&lt;li&gt;Pick up a treasure (bidding rules work the same as the first challenge)&lt;/li&gt;&#xA;&lt;li&gt;Gift a treasure to another party member in the same room&lt;/li&gt;&#xA;&lt;li&gt;Drop a treasure&lt;/li&gt;&#xA;&lt;li&gt;Attack a monster&lt;/li&gt;&#xA;&lt;li&gt;Attack a rival adventurer in the same room&lt;/li&gt;&#xA;&lt;li&gt;Guard (prevent oncoming attacks and theft attempts)&lt;/li&gt;&#xA;&lt;li&gt;Wait&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Communication&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Adventurers can communicate by speaking, which will be heard by all teammates in the same room. Speaking requires no stamina and can be combined with movement or gifting, but is limited to be a 20-character string. (Use of emojis for increased message density is fair game)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Combat&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A power must be specified when attacking a monster. This cannot be higher than the adventurer's power rating. That amount of stamina will be expended and the monster will be damaged by that amount. If the monster is still alive after all attacks have resolved, the monster will then deal its damage split among all combatants that attacked that turn, minimum of 1 damage.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If adventurers are outnumbered by monsters in any room, the monsters will attack anyone attempting to pick up treasure for 1 damage each.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Defeating a monster will cause the monster to drop up to 3 treasures (typically more valuable than the others in the room) and the characters who attacked the monster that turn will level up, gaining 1 power.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Attacking a rival adventurer will deal one fifth of the damage normally dealt to monsters, but will not result in a counterattack. Attacking an adventurer who either guards or moves into another room will result in a miss. It is possible for adventurers to kill each other on the same turn since attacks resolve simultaneously.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Coding&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You will write a bot for each party member. They may not share data (other than constants and libraries).&lt;/p&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2019-04-16T05:31:00.410" LastActivityDate="2019-04-16T05:31:00.410" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17578" PostTypeId="2" ParentId="17548" CreationDate="2019-04-17T16:12:51.337" Score="8" Body="&lt;h1&gt;Please keep the green color palette from the user script&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It just looks really nice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the very least, anything but blue - I think we're all tired of seeing blue.&lt;/p&gt;&#xA;" OwnerUserId="60042" LastActivityDate="2019-04-17T16:12:51.337" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17579" PostTypeId="2" ParentId="2140" CreationDate="2019-04-17T17:34:09.433" Score="3" Body="&lt;h1&gt;Battle of Wits (Where is the Poison?)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The battle of wits is a &lt;a href=&quot;http://wiki.c2.com/?BattleOfWits&quot; rel=&quot;nofollow noreferrer&quot;&gt;well-known scene&lt;/a&gt; from the Princess Bride.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Two bots will face off in a battle of wits: one poisons a wine goblet and the other chooses which to drink from (the other player drinks from the other goblet). Whoever drinks the poison loses. This will be repeated until one bot wins 20 rounds, with who poisons the goblet being randomized each time. Each match, you will be able to see the entire history of which goblet was chosen and you will also have access to the other player's decision function (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/173065/prisoners-dilemma-with-access-to-opponent&quot;&gt;Related&lt;/a&gt;). All submissions will be evaluated in a round-robin tournament, with ties being broken by who has the fewest losses across all games. Further ties will be resolved by who has the fewest losses to the contesting opponents. If there is a perfect intransitive relationship among three or more bots, all of them will be considered tied for first place.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This is equivalent to the &lt;a href=&quot;https://en.wikipedia.org/wiki/Matching_pennies&quot; rel=&quot;nofollow noreferrer&quot;&gt;matching pennies game&lt;/a&gt; in terms of who wins a round. The poisoner is equivalent to the penny matcher and the chooser is equivalent to the non-matcher.&lt;/p&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2019-04-30T17:24:01.967" LastActivityDate="2019-04-30T17:24:01.967" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17580" PostTypeId="2" ParentId="2140" CreationDate="2019-04-17T19:39:49.017" Score="1" Body="&lt;h1&gt;Growth of the Jackpot (Tentative Name)&lt;/h1&gt;&#xA;&lt;h3&gt;(Gauging interest)&lt;/h3&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;There is a money pot that gains $1 for every player currently in the game each turn. At any time, a player can decide to take the money and run or stay in the game hoping for a larger pot. If more than one player decides to leave at the same time, the money will be divided evenly among them, rounded down, with the remainder being put back in the pot. If after 100 rounds, there are still players left in the game, they will split whatever is in the pot at that time. Whoever has the most money at the end of the game wins.&lt;/p&gt;&#xA;&lt;p&gt;Write a bot to play this game. You will always know the size of the pot, how many players are currently playing, how many were initially in the game, and the current first place amount of money.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;On the surface, the optimal strategy is to bail out on turn &lt;span class=&quot;math-container&quot;&gt;\$\lceil{100n \over {2n - 1}}\rceil\$&lt;/span&gt; (where &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is the number of players) because that turn guarantees that nobody can do better than you. But then if everyone does that, they'll split the pot and lose, so the best action to take is not immediately obvious.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;One possible variant to round limits would be to have it cost each player $1 per turn they stay in the game, with each player starting with $100 and being forced to take the money and run when they have none left to contribute. Then the game could be run for several rounds.&lt;/p&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-04-17T19:49:23.157" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17581" PostTypeId="1" CreationDate="2019-04-19T10:47:39.543" Score="2" ViewCount="215" Body="&lt;p&gt;I don't like golf languages, and I vote on solutions using them only if the solution has some extraordinary feature (like abusing a bug in the interpreter).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How can I encourage people to vote this way in challenges I post? When tagging &quot;code-golf&quot;, which I do pretty much 100% of the time, I discourage that — &quot;winning criterion&quot; is supposed to be a measure of the &quot;quality&quot; of the solution, which overlaps with voting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Just writing &quot;I want you to vote in this particular way&quot; looks rude. What else can I do?&lt;/p&gt;&#xA;" OwnerUserId="25315" LastActivityDate="2019-11-19T19:44:33.733" Title="How can I encourage voting for non-golf languages?" Tags="|discussion|voting|" AnswerCount="1" CommentCount="6" ClosedDate="2019-11-25T02:32:09.673" ContentLicense="CC BY-SA 4.0" />
  <row Id="17582" PostTypeId="2" ParentId="2140" CreationDate="2019-04-19T12:17:24.307" Score="1" Body="&lt;h1&gt;Hungry Monster 9&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;My first challenge. Feedback is appreciated.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;A monster shaped like &lt;code&gt;2&lt;/code&gt; is hungry and wants to become a &lt;code&gt;9&lt;/code&gt;. To do so he will eat food, that is shaped like the number &lt;code&gt;1&lt;/code&gt;, seven times.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0000000000&#xA;0000100000&#xA;0100000000&#xA;0000001000&#xA;0000020000&#xA;0100000000&#xA;0000000100&#xA;0010000000&#xA;0000001000&#xA;0000000000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;It starts with a grid filled with &lt;code&gt;0&lt;/code&gt;, containing the digit &lt;code&gt;2&lt;/code&gt;, and seven times the digit &lt;code&gt;1&lt;/code&gt;.&#xA;The &lt;code&gt;2&lt;/code&gt; (aka the monster) needs to move to the closest &lt;code&gt;1&lt;/code&gt;. Upon &amp;quot;eating&amp;quot; the number, &lt;code&gt;2&lt;/code&gt; will change to &lt;code&gt;3&lt;/code&gt;, and continue to move to the next closest number.&lt;/p&gt;&#xA;&lt;p&gt;Write a program that outputs the next correct state.&lt;/p&gt;&#xA;&lt;h1&gt;Input specifications&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input grid is a rectangle and can be of any size. It doesn't need to be a square.&lt;/li&gt;&#xA;&lt;li&gt;The input can be at any state. For example a grid with a &lt;code&gt;6&lt;/code&gt; and three times &lt;code&gt;1&lt;/code&gt; left.&lt;/li&gt;&#xA;&lt;li&gt;The grid will contain exactly one digit higher than or equal to &lt;code&gt;2&lt;/code&gt; (the &amp;quot;player&amp;quot;).&lt;/li&gt;&#xA;&lt;li&gt;The grid will contain seven times or less the number &lt;code&gt;1&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When the monster gets on the position of where a &lt;code&gt;1&lt;/code&gt; is, its digit increases by 1.&lt;/li&gt;&#xA;&lt;li&gt;The monsters previous position becomes &lt;code&gt;0&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;When the monster is &lt;code&gt;9&lt;/code&gt;, it does not move.&lt;/li&gt;&#xA;&lt;li&gt;The monster can move in 8 directions (horizontally, vertically, diagonally).&lt;/li&gt;&#xA;&lt;li&gt;The monster moves to the closest &lt;code&gt;1&lt;/code&gt;. If there are multiple closest, you may choose any of those. It is not required to be random.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;This is an example of the first 4 states (and example inputs/outputs):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0000000000&#xA;0000100000&#xA;0100000000&#xA;0000001000&#xA;0000020000&#xA;0100000000&#xA;0000000100&#xA;0010000000&#xA;0000001000&#xA;0000000000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;0000000000&#xA;0000100000&#xA;0100000000&#xA;0000003000&#xA;0000000000&#xA;0100000000&#xA;0000000100&#xA;0010000000&#xA;0000001000&#xA;0000000000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;0000000000&#xA;0000100000&#xA;0100030000&#xA;0000000000&#xA;0000000000&#xA;0100000000&#xA;0000000100&#xA;0010000000&#xA;0000001000&#xA;0000000000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;0000000000&#xA;0000400000&#xA;0100000000&#xA;0000000000&#xA;0000000000&#xA;0100000000&#xA;0000000100&#xA;0010000000&#xA;0000001000&#xA;0000000000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The output is allowed to be an array of lines.&#xA;&lt;code&gt;[&amp;quot;0000000000&amp;quot;, &amp;quot;0100000000&amp;quot;, &amp;quot;0000080000&amp;quot;]&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="86618" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-04-19T22:59:20.683" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17583" PostTypeId="2" ParentId="2140" CreationDate="2019-04-20T16:22:07.787" Score="1" Body="&lt;h1&gt;Low diversity quine.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A low diversity quine is a quine (program that outputs it's source code) that uses a low amount of distinct characters.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As a code-golf challenge the program with the lowest score wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Score is calculated as: NumberOfDistinctCharacters x ByteCount&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Standard quine rules apply. Most notably: &lt;strong&gt;No source code reading&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="66799" LastEditorUserId="66799" LastEditDate="2019-04-25T13:06:33.483" LastActivityDate="2019-04-25T13:06:33.483" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17586" PostTypeId="2" ParentId="17548" CreationDate="2019-04-20T23:28:37.383" Score="4" Body="&lt;h1&gt;Remove The Minimum Character Requirement&lt;/h1&gt;&#xA;&lt;p&gt;Not sure if this is within the remit of the site design or if it's even possible on a per-site basis but, on a site that (for the most part) focuses on how short we can make our answers, having a minimum character count very often proves to be an annoyance. On more than one occasion it has, at least for me, delayed the posting of a solution just long enough for someone else to slip in there ahead of me while I padded my post out with a another character or 3.&lt;/p&gt;&#xA;&lt;p&gt;So, if at all possible, please consider removing that minimum.&lt;/p&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-04-20T23:28:37.383" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17587" PostTypeId="1" CreationDate="2019-04-21T22:37:02.007" Score="3" ViewCount="244" Body="&lt;p&gt;How would we score changing the colors of graphs in Desmos in [graphical-output] challenges with color-sensitive output? Currently, &lt;a href=&quot;https://i.stack.imgur.com/NSXUy.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;selecting the color in the menu&lt;/a&gt; costs no bytes as no characters are used to do it. This has &lt;a href=&quot;https://codegolf.stackexchange.com/a/183552/84303&quot;&gt;raised some concerns about being &quot;unfair&quot;&lt;/a&gt; when competing with languages where the color is defined in the text.&lt;br&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should there be a penalty for setting the color of a graph? If so, what should the penalty be?&lt;/p&gt;&#xA;" OwnerUserId="84303" LastActivityDate="2023-07-06T12:40:58.537" Title="How do we score colors in Desmos?" Tags="|discussion|voting|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17588" PostTypeId="2" ParentId="2140" CreationDate="2019-04-22T01:46:19.823" Score="8" Body="&lt;h1&gt;Lucky Dice (KotH, WIP)&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/92715/lucky-dice&quot;&gt;CHAT&lt;/a&gt; • &lt;a href=&quot;https://github.com/ArtemisFowlJnr/Lucky-Dice&quot; rel=&quot;nofollow noreferrer&quot;&gt;CONTROLLER&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You have recently taken a job at Lucky &amp;amp; Co, as a professional dice roller, and need to make as much money as you can! (of course). You will be paid exactly what you roll, $1 for a 1, $2 for a 2 etc. Where's the fun in that? Well, these aren't ordinary dice: starting with $5 in your bank, you must purchase new dice, which will all be rolled each turn. There are many different types of dice, all with different probabilities of rolling the different numbers. Every turn, you take a look at what the dices have done for you, then decide what to invest in. But beware! You have many rivals, all with the same aim in mind, and there are only so many dice in the shop...&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Dice (StC)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are many types of dice, which can be split into the following categories:&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Basic Earners&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;20 of each are available, they are simply rolled and their value is added to the total points:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;╔════╦═════════════════════╦═══════╦═════╦════╦════╦════╦════╦═════╗&#xA;║ ID ║     Description     ║ Price ║  1  ║ 2  ║ 3  ║ 4  ║ 5  ║  6  ║&#xA;╠════╬═════════════════════╬═══════╬═════╬════╬════╬════╬════╬═════╣&#xA;║  0 ║ Rolls a 1           ║     1 ║ 100 ║  0 ║  0 ║  0 ║  0 ║   0 ║&#xA;║  1 ║ Likely to be low    ║     3 ║  50 ║ 25 ║ 13 ║  7 ║  3 ║   2 ║&#xA;║  2 ║ Unlikely to be high ║     6 ║  22 ║ 22 ║ 22 ║ 11 ║ 11 ║  11 ║&#xA;║  3 ║ Even chances        ║     9 ║  17 ║ 17 ║ 17 ║ 17 ║ 17 ║  17 ║&#xA;║  4 ║ Unlikely to be low  ║    12 ║  11 ║ 11 ║ 11 ║ 22 ║ 22 ║  22 ║&#xA;║  5 ║ Likely to be high   ║    16 ║   2 ║  3 ║  7 ║ 13 ║ 25 ║  50 ║&#xA;║  6 ║ Rolls a 6           ║    21 ║   0 ║  0 ║  0 ║  0 ║  0 ║ 100 ║&#xA;╚════╩═════════════════════╩═══════╩═════╩════╩════╩════╩════╩═════╝&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Multipliers&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;These multiply the points gained by the basic dice by something between 0.33 and 18... 10 of each are available. &lt;code&gt;r&lt;/code&gt; represents what it rolled, each outcome (1-6) is equally likely:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;╔════╦═════════════════╦═══════╗&#xA;║ ID ║   Description   ║ Price ║&#xA;╠════╬═════════════════╬═══════╣&#xA;║  7 ║ Multiply by r/3 ║    10 ║&#xA;║  8 ║ Multiply by r/2 ║    13 ║&#xA;║  9 ║ Multiply by r   ║    22 ║&#xA;║ 10 ║ Multiply by r*2 ║    34 ║&#xA;║ 11 ║ Multiply by r*3 ║    50 ║&#xA;╚════╩═════════════════╩═══════╝&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Attacks&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;These dice, with 10 of each available, are what makes the game truly interesting. They handle user interaction: each has a set action that it applies to one other random player (except 16):&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;╔════╦══════════════════════════════════╦═══════╗&#xA;║ ID ║              Action              ║ Price ║&#xA;╠════╬══════════════════════════════════╬═══════╣&#xA;║ 12 ║ See below (too long)             ║    35 ║&#xA;║ 13 ║ They get 10 less (not below 0)   ║    45 ║&#xA;║ 14 ║ Like 12, but you get the points  ║    60 ║&#xA;║ 15 ║ They get 25 less (not below 0)   ║    60 ║&#xA;║ 16 ║ Like 14, but you get the points  ║    90 ║&#xA;╚════╩══════════════════════════════════╩═══════╝&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;12: A fair dice, the value of which is subtracted from every other users' basic dice roll (not below 0).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Coins&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Miscellaneous other bonuses and actions, each with a 50% chance of happening. There are only 3 of each available:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;╔════╦═══════════════════════════════════════════╦═══════╗&#xA;║ ID ║                Description                ║ Price ║&#xA;╠════╬═══════════════════════════════════════════╬═══════╣&#xA;║ 17 ║ Protects you from attacks                 ║    65 ║&#xA;║ 18 ║ Roll every basic die again                ║    90 ║&#xA;║ 19 ║ Roll every basic and multiplier die again ║   110 ║&#xA;║ 20 ║ Square your score                         ║   120 ║&#xA;║ 21 ║ Cube your score                           ║   170 ║&#xA;╚════╩═══════════════════════════════════════════╩═══════╝&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;How the dice fall&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When working out the points for a round:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Every players' coins are flipped. The results are remembered.&lt;/li&gt;&#xA;&lt;li&gt;Every players' basic dice are rolled (as many times as specified by coins). The total of the results for each player is that players' points for this round&lt;/li&gt;&#xA;&lt;li&gt;Every players' multiplier dice are rolled (with extra rolls). Each multiplication is applied on top of the previous one.&lt;/li&gt;&#xA;&lt;li&gt;Any squaring or cubing is applied.&lt;/li&gt;&#xA;&lt;li&gt;For every players' attack dice, a random other player is chosen for each. Unless that player had a shield, the appropriate action is taken.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;A game&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A game lasts until first place is 200 points ahead of second place, or until 500 rounds have been played. There are 7 people in each game, who each start with just $5. Every round, each player submits a list of dice that they want to buy. If they ask for a dice that isn't there, ask to pay more than they have, or returns an otherwise invalid move, they do not buy anything that round. If more people ask for a dice than there are of that dice, no-one gets it. After every bot has given their move, and all orders have been resolved, the points for the round are calculated as above, and then added to the total score of each bot. At this point, the win condition is tested. 1st place gets 7 points, second gets 6 and so on. If two players are joined in, for example, 3rd place, they both get 5 points, but the next bot/s get only 3.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;A tournament&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In a tournament:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If there are more than 7 bots, the bots will be divided into groups of 7 to play until every bot has played an equal number of games, and there are 7 bots which have a higher total score than the rest.&lt;/li&gt;&#xA;&lt;li&gt;The top 7 bots play games until one has 50 more points than second place. &lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;2&lt;/code&gt; is repeated for all the other groups of seven, and then the leftover bots. Now every bot knows its rightful place!&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;I will run a tournament every day if possible, which it hopefully will be.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Coding&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You will write a Python class that inherits from &lt;code&gt;Bot&lt;/code&gt;, and implements &lt;code&gt;get_orders&lt;/code&gt;, which must accept the following parameters:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;money&lt;/code&gt; - how much money each player has (a &lt;code&gt;tuple&lt;/code&gt; of &lt;code&gt;int&lt;/code&gt;s)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;dice&lt;/code&gt; - what dices each player has (a &lt;code&gt;tuple&lt;/code&gt; of &lt;code&gt;tuple&lt;/code&gt;s of &lt;code&gt;int&lt;/code&gt;s)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;index&lt;/code&gt; - your index in the money and dice &lt;code&gt;tuple&lt;/code&gt;s (an &lt;code&gt;int&lt;/code&gt;)`&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;shop&lt;/code&gt; - how many of each dice the shop has (a &lt;code&gt;dict&lt;/code&gt; of &lt;code&gt;int: int&lt;/code&gt; pairs)  &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Dice are represented in the above by their ID. You may also implement &lt;code&gt;__init__ (self, random)&lt;/code&gt;, where random is a &lt;code&gt;random.Random&lt;/code&gt; object, which is the only access to randomness that you are allowed, that is, if I were to run your code again with the same argument to &lt;code&gt;random&lt;/code&gt; and the same calls to &lt;code&gt;get_orders&lt;/code&gt;, I would receive the same results. You may also implement any other utility functions you wish. You may not store information between games (already banned but let's do it explicitly), and you may not mess with the controller. You may not team up (how could you?) or use any other competitor's code without significant changes without their permission. You may not programmatically invoke another competitor's code, because that could get circular...&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Controller&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;WIP&lt;/h3&gt;&#xA;&#xA;&lt;h2&gt;Results&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;None yet ;P&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/probability-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;probability-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;probability-theory&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h2&gt;&lt;em&gt;Sandbox&lt;/em&gt;&lt;/h2&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;em&gt;Any thoughts?&lt;/em&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;em&gt;What should I clarify, I feel like I've missed everything...&lt;/em&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;em&gt;Do you like the idea?&lt;/em&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;em&gt;Have you spotted a perfect and unbeatable strategy?&lt;/em&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;em&gt;Any suggestions for new dice/dice types?&lt;/em&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;em&gt;Any suggestions for changes to the game/tournament system?&lt;/em&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;em&gt;Are all the tags appropriate?&lt;/em&gt;&#xA;  &#xA;  &lt;h3&gt;Unicode Art Table&lt;/h3&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;╔════╦═══════════════════════════════════════════╦═══════╗&#xA;║ ID ║                Description                ║ Price ║&#xA;╠════╬═══════════════════════════════════════════╬═══════╣&#xA;║ 16 ║ Protects you from attacks                 ║    65 ║&#xA;║ 17 ║ Roll every basic die again                ║    90 ║&#xA;║ 18 ║ Roll every basic and multiplier die again ║   110 ║&#xA;║ 19 ║ square your score                         ║   120 ║&#xA;║ 20 ║ cube your score                           ║   170 ║&#xA;╚════╩═══════════════════════════════════════════╩═══════╝&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;MathJax Table&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\begin{array} {|r|r|}&#xA;\hline&#xA;\text{ID} &amp;amp;\text{Description} &amp;amp;\text{Price} \\&#xA;\hline&#xA;\text{16} &amp;amp;\text{Protects you from attacks} &amp;amp;\text{65} \\&#xA;\text{17} &amp;amp;\text{Roll every basic die again} &amp;amp;\text{90} \\&#xA;\text{18} &amp;amp;\text{Roll every basic and multiplier die again} &amp;amp;\text{110} \\&#xA;\text{19} &amp;amp;\text{Square your score} &amp;amp;\text{120} \\&#xA;\text{20} &amp;amp;\text{Cube your score} &amp;amp;\text{170} \\&#xA;\hline&#xA;\end{array}&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Which is better?&lt;/h3&gt;&#xA;" OwnerUserId="80756" LastEditorUserId="80756" LastEditDate="2019-04-25T17:06:28.620" LastActivityDate="2019-04-25T17:06:28.620" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="17592" PostTypeId="2" ParentId="17587" CreationDate="2019-04-23T17:04:35.933" Score="4" Body="&lt;h1&gt;Setting the color is not part of the language&lt;/h1&gt;&#xA;&lt;p&gt;As defined &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7077/20198&quot;&gt;here&lt;/a&gt;, there is no way to encode the color.  This means that the color of the graph is not part of the language, similar to how setting the default font color in my terminal settings isn't part of bash.&lt;/p&gt;&#xA;&lt;p&gt;If color is required as part of the answer, then there must be a way to encode this color in a way that the website understands.  For example, if the site is able to save/load the graph (including colors) from the browser cache, you can use that as your code (and you would measure the byte count of the saved data).&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-04-23T17:04:35.933" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17596" PostTypeId="2" ParentId="17548" CreationDate="2019-04-25T09:47:28.617" Score="-6" Body="&lt;h1&gt;Concrete suggestion for site icon&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Although a general site design may be derivable from this too.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Inspiration&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Super User        TeX - LaTeX&lt;/strong&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/FvPny.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/FvPny.png&quot; alt=&quot;Super User&quot;&gt;&lt;/a&gt;  &lt;a href=&quot;https://i.stack.imgur.com/Qp6EI.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Qp6EI.png&quot; alt=&quot;TeX - LaTeX&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Skeptics         emacs&lt;/strong&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/E4gTi.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/E4gTi.png&quot; alt=&quot;Skeptics&quot;&gt;&lt;/a&gt;  &lt;a href=&quot;https://i.stack.imgur.com/bOp5b.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/bOp5b.png&quot; alt=&quot;emacs&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Basis&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;xnor's suggestion that we have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17558/43319&quot;&gt;feel of code golfing&lt;/a&gt; as conveyed by certain words (here &lt;em&gt;squeeze&lt;/em&gt;)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Peter Taylor's suggestion that we &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17553/43319&quot;&gt;incorporate APL, Wireworld, or Penrose tiling (including cellular automata)&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;DJMcMayhem♦'s suggestion that we &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17554/43319&quot;&gt;incorporate Conway's Game of Life somewhere&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Pavel's suggestion that we &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17578/43319&quot;&gt;keep the user script green&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;my suggestion that we &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17551/43319&quot;&gt;suggest competition&lt;/a&gt; with certain themes (here &lt;em&gt;gold, silver, bronze&lt;/em&gt;)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Implementation&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The three characters &lt;code&gt;{⌺}&lt;/code&gt; have been squeezed tightly together to suggest code golf&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The symbol &lt;code&gt;⌺&lt;/code&gt; suggests wiring and tiling, and is in fact, the APL &lt;em&gt;Stencil&lt;/em&gt; symbol&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The &lt;code&gt;⌺&lt;/code&gt; operator is the general cellular automaton operator in APL, and is central to the shortest expressions for Conway's Game of Life&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The user script's green background has been kept&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The characters are gold and silver (and the golden braces are also carried over from the user script)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Suggestion&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Programming Puzzles &amp;amp; Code Golf&lt;/strong&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/a9NL4.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/a9NL4.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2019-04-25T09:47:28.617" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17597" PostTypeId="1" CreationDate="2019-04-25T11:05:06.617" Score="4" ViewCount="82" Body="&lt;p&gt;Right now, there are two challenges,&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Newer challenge: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/184682/check-if-a-string-is-entirely-made-of-the-same-substring&quot;&gt;Check if a string is entirely made of the same substring&lt;/a&gt; by &lt;code&gt;ouflak&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Older challenge: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37851/string-prototype-isrepeated/37855#37855&quot;&gt;String.prototype.isRepeated&lt;/a&gt; by &lt;code&gt;Optimizer&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;which are, as far as I can tell, the exact same challenge. This has happened before, and sparked the following discussion: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1875/closing-old-question-as-duplicate-of-a-new-one&quot;&gt;Closing old question as duplicate of a new one&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;[C]losing old challenges as dupes of new challenges should be considered on a post-by-post basis, so a meta discussion is probably appropriate for each. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The old challenge is, well, very old, so it does not exactly suit the modern standards. Notably, it's scored on character count instead of byte count. As far as I can tell, this is the only difference.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should either of these questions be closed as a duplicate of the other? If so, which one?&lt;/p&gt;&#xA;" OwnerUserId="32352" LastActivityDate="2019-04-26T07:00:20.207" Title="Which 'repeated substring' challenge should be closed?" Tags="|discussion|duplicates|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17598" PostTypeId="2" ParentId="2140" CreationDate="2019-04-25T13:30:26.597" Score="1" Body="&lt;h1&gt;Dining philosopher problem&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This question is motivated by the lack of concurrency related puzzles on PPCG. The goal of this question is to solve the Dining Philosophers Problem.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;What is the dining philosophers problem (DPP) ?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Dining_philosophers_problem&quot; rel=&quot;nofollow noreferrer&quot;&gt;DPP&lt;/a&gt; is one of the most famous concurrency problem, used to illustrate what is a deadlock for instance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;n&lt;/em&gt; philosophers are dining together at a circular table. Between each philosopher, there is a fork. In order to eat, each philosopher should have two forks (one in each hand).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem is that, if all philosophers try to take the fork on their right, then wait until the one on their left (taken by the philosopher on their left) is available, they will wait forever.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Solving the problem is finding a strategy so that no philosopher waits forever.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Your program&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Takes an input &lt;em&gt;n&lt;/em&gt;, the number of philosophers (and the number of forks).&#xA;Run &lt;em&gt;n&lt;/em&gt; philosophers in parallel, each philosopher output its dining events.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are 4 different dining events possible:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Philosopher &lt;em&gt;i&lt;/em&gt; takes the fork &lt;em&gt;j&lt;/em&gt;;&lt;/li&gt;&#xA;&lt;li&gt;Philosopher &lt;em&gt;i&lt;/em&gt; tries to take the fork &lt;em&gt;j&lt;/em&gt;, but fails (the fork is already taken);&lt;/li&gt;&#xA;&lt;li&gt;Philosopher &lt;em&gt;i&lt;/em&gt; release the fork &lt;em&gt;j&lt;/em&gt;;&lt;/li&gt;&#xA;&lt;li&gt;Philosopher &lt;em&gt;i&lt;/em&gt; eats (and leave the table/release the forks and do not compete anymore).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;A trace is correct if:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A fork is taken by at most 1 philosopher at any time (between two events 1 for the same &lt;em&gt;j&lt;/em&gt;, there must be an event 3 for that &lt;em&gt;j&lt;/em&gt;).&lt;/li&gt;&#xA;&lt;li&gt;A philosopher only interacts with neighbourgs forks (in events 1, 2, 3, &lt;em&gt;j&lt;/em&gt; is &lt;em&gt;i&lt;/em&gt; or &lt;em&gt;(i+1)%n&lt;/em&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The output format is a sequence of events. You can choose how to represent each event, but the following is suggested:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;em&gt;i+j&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;i!j&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;i-j&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;i&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;A (non-golfed) C version is available &lt;a href=&quot;https://gist.github.com/Bromind/3b611ac62676a0c4cf803555d40850c6&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;, with output in plain english. &lt;a href=&quot;https://tio.run/##tVTBbtswDD1bX0F0SCAn7tAeenK7LyiGXXZKg0CV5ViLYhmWXKwt8uv1JDrOZNfFgmG7KDL5SL5HkeGXW87blnySJVdNJm6NzZR8/Fx8GZikHlgqW9SCZd5GjvfNvrHi58bCItf1zqQnu7NAVUilja4KUQeePkI3tmrsRmm@S4ksLZSPmyAC7uAmJeiwbCeovwTuBLzBF43hlUTD5D4nnQcF4pREHl8L6/KOmNTPHR4VrPy5RnxOEX4HVzGJoqp2CXJ68S2gOJPIzSAP9/VQXiRDkkjQJRPKCPg4C2cllLpT@udkQ/5NOSm3Bz1LoTLqLU5NU5e@Byk5EPKkZeY@lGDmH3R3mtOopR@oP5Iw/0t5L1YwOxZ6trxp5i6jGbM9l2fPKghFdjJDUk4yTdPYzyHQbgOyBJ04kR7iR/TkcQcs4TqeDdcohEfYgMwTjKLTywexMBst4Xvo73A/TP56IFOIg9fn5eyZLFEXq7c8AV6weuHvT6s1snq39cxqSRFwjUODM@Tse6Zc5@gIvwAjX4TO6WipY3yG4A/o/AwYi3WhexAXepW6n9tRd5xtuexa28dyd1pB52HllVwn8PX7/X0C8@GOdY36u0o/tOvrZJlj@9u2vXnjuWJb016qY9gv&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;C (gcc) – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. You should, in addition, consider the following points: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must solve the problem concurrently, i.e. create one thread per philosopher and use usual atomic operations. Said otherwise, you should output a trace of an execution, not compute a possible scheduling.&lt;/li&gt;&#xA;&lt;li&gt;You can not rely on time to solve the problem (no such thing as: philosopher 1 waits 1 sec, philosopher 2 waits 2 sec, etc..). To generalise, you can not use the identifier of the philosopher to do something else than finding the neighbourg forks.&lt;/li&gt;&#xA;&lt;li&gt;If you add a TIO link in addition to your code, you can add any thread yield (or equivalent in your language) in the TIO version, in order to emphasize non-determinism.&lt;/li&gt;&#xA;&lt;li&gt;If you add a TIO link in addition to your code, you can add use an extra lock to avoid concurrency artifacts on standard output, on the TIO version. You can not use that lock to solve the problem (i.e. if we remove this lock, the solution must remain correct). In particular, you can use this lock to atomically do an event and output it. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Example: the TIO version of:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;try = try_lock(fork_1)&#xA;if (try is success)&#xA;  output(&quot;1+1&quot;)&#xA;else&#xA;  output(&quot;1!1&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;can be :&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;lock(output_mutex)&#xA;try = try_lock(fork_1)&#xA;if (try is success)&#xA;  output(&quot;1+1&quot;)&#xA;else&#xA;  output(&quot;1!1&quot;)&#xA;unlock(output_mutex)&#xA;yield()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Example run&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;for &lt;code&gt;n = 4&lt;/code&gt;, the following are possible outcomes (notice that both are traces generated from the same program, it happened that the scheduling was not the same on both runs):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0+0&#xA;0+1&#xA;0&#xA;0-1&#xA;0-0&#xA;1+1&#xA;1+2&#xA;1&#xA;1-2&#xA;1-1&#xA;3+3&#xA;3+0&#xA;3&#xA;3-0&#xA;3-3&#xA;2+2&#xA;2+3&#xA;2&#xA;2-3&#xA;2-2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0+0&#xA;2+2&#xA;2+3&#xA;1+1&#xA;1!2&#xA;0!1&#xA;2&#xA;2-3&#xA;2-2&#xA;1-1&#xA;1+1&#xA;1+2&#xA;1&#xA;1-2&#xA;1-1&#xA;0-0&#xA;0+0&#xA;0+1&#xA;0&#xA;0-1&#xA;0-0&#xA;3+3&#xA;3+0&#xA;3&#xA;3-0&#xA;3-3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Questions to be answered:&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The goal is to have a concurrent implementation of the problem (i.e. the scheduling of events should not be fixed, there should be a thread per philosopher, etc.). How to emphasize that in an understandable manner ?&lt;/li&gt;&#xA;&lt;li&gt;Concurrency leads to problems, such as interleaving in stdout. Here, what I have in mind is that when the philosopher thread takes a fork, it can atomically output it on stdout, in order to reflect what actually happens. Said otherwise, I'd like to propose a way to assume that the output reflects locks behavior. Another problem is that, for small &lt;code&gt;n&lt;/code&gt;, the output is likely to be deterministic (thread &lt;code&gt;i&lt;/code&gt; finishes before &lt;code&gt;i+1&lt;/code&gt; is even started). Hence I'd like to allow the programmer to add any thread_yield() (or sleep, or anything that introduce non-determinism) to break that.&lt;/li&gt;&#xA;&lt;li&gt;This kind of puzzles, intended to be solve by distributed algorithms, is quite unusual on ppcg. Codegolf is a possible scoring system, but maybe there are better systems (like, the less synchronisation, etc.).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="77297" LastEditorUserId="77297" LastEditDate="2019-05-03T07:10:18.870" LastActivityDate="2019-05-03T07:10:18.870" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17600" PostTypeId="1" CreationDate="2019-04-26T00:16:38.477" Score="19" ViewCount="353" Body="&lt;p&gt;This question previously described a leaderboard snippet which no longer exists. I am leaving this question here for historical purposes. Thank you to all who contributed.&lt;/p&gt;&#xA;" OwnerUserId="83677" LastEditorUserId="83677" LastEditDate="2022-03-05T21:54:05.650" LastActivityDate="2022-03-05T21:54:05.650" Title="Introducing the New PPCG Leaderboard Widget!" Tags="|discussion|stack-snippets|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17601" PostTypeId="2" ParentId="17600" CreationDate="2019-04-26T01:35:36.220" Score="6" Body="&lt;p&gt;Previous issues fixed!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some other thoughts though:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Perhaps split the two leaderboards into two tabs for ease of access? Scrolling all the way to the second leaderboard is rather annoying.&lt;/li&gt;&#xA;&lt;li&gt;Winners by language should be sorted by language name rather than byte count&lt;/li&gt;&#xA;&lt;li&gt;When the question is not tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; perhaps &quot;Score&quot; would be a better descriptor for the final column instead of &quot;Byte Count&quot;&lt;/li&gt;&#xA;&lt;li&gt;A position column (like 1st, 2nd, 3rd etc.) would be good.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76162" LastEditorUserId="76162" LastEditDate="2019-04-28T23:50:29.133" LastActivityDate="2019-04-28T23:50:29.133" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17602" PostTypeId="2" ParentId="2140" CreationDate="2019-04-26T03:20:22.550" Score="0" Body="&lt;h3&gt;Use input letters to create as many words as possible&lt;/h3&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I have the scrabble letters as magnets on my fridge and I was thinking: how many actual words could I make using only these letters. Obviously it would be hard to work out myself, so I challenge you to create a program which will take a string of characters as input, and your goal is to output as many words as possible using those characters.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The characters will be one string &lt;/li&gt;&#xA;&lt;li&gt;Only the 26 letters of the alphabet will appear.&lt;/li&gt;&#xA;&lt;li&gt;Letters may appear more than once&lt;/li&gt;&#xA;&lt;li&gt;Letters can appear in any order. 5 e's might appear next to each other, and there might be other e's in the string.&lt;/li&gt;&#xA;&lt;li&gt;There will always be at least a single letter, but it might not always be possible to create a valid word&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Example, using the letters from Scrabble: &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;eeeeeeeeeeeaaaaaaaaaiiiiiiiiioooooooonnnnnnrrrrrrttttttllllssssuuuuddddgggbbccmmppffhhvvwwyykjxqz&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A list of valid English words, which you can separate with a space, newline or comma. A trailing newline at the end is fine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Default loopholes are forbidden&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/word&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;word&amp;#39;&quot; rel=&quot;tag&quot;&gt;word&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/natural-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;natural-language&amp;#39;&quot; rel=&quot;tag&quot;&gt;natural-language&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Meta discussion (not apart of the question)&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; a decent challenge for this? I'm more interested in more words being output than I am short code, but how best can I frame this challenge that the best result would be most words created and fewest characters left?&lt;/li&gt;&#xA;&lt;li&gt;Should I restrict the input list to &lt;em&gt;just&lt;/em&gt; the letters from Scrabble? I mean how can I evaluate whether a program prints as many as possible?&lt;/li&gt;&#xA;&lt;li&gt;Should I provide a word list? I know there are challenges on this site where a word list is provided &lt;a href=&quot;https://codegolf.stackexchange.com/questions/45295/is-this-even-a-word&quot;&gt;1&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/133564/count-to-20-with-words&quot;&gt;2&lt;/a&gt; and I'm sure there are a few others which I could not find.&lt;/li&gt;&#xA;&lt;li&gt;This is my third question, so any other feedback&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42561" LastActivityDate="2019-04-26T03:20:22.550" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17603" PostTypeId="2" ParentId="17597" CreationDate="2019-04-26T07:00:20.207" Score="4" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Notably, it's scored on character count instead of byte count. As far as I can tell, this is the only difference.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That was an important distinction when the ethos of the site was still that all answers compete against each other, and it was felt that people were abusing counting by characters to make their own language which used multibyte character sets. But with the current ethos that you compete against other answers in the same language, it becomes an irrelevant distinction.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The only argument I can see in this case for overriding the default presumption that the new question should be closed in favour of the old is that the new question has more answers, but with 16 the old question also does well on that metric. IMO the choice should be between a normal closure of the new question as a dupe or a merge which moves the answers to the new question into the old one.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2019-04-26T07:00:20.207" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17605" PostTypeId="2" ParentId="17600" CreationDate="2019-04-26T14:07:02.760" Score="11" Body="&lt;p&gt;First of all, &lt;strong&gt;we appreciate the effort&lt;/strong&gt;. I have some concerns, though:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not sure that having the snippet hosted externally and using an iframe is a good idea. The reason is that having the code be a copy/paste snippet allows it to work without adding a dependency on an external site that may or may not continue to be maintained.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A possible mitigation or solution to this is that someone besides you should have access to update the source code of your snippet. The moderators of this site, for example.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This doesn't remove the dependency on repl.it, but it does remove the dependency on your remaining active.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="34718" LastEditDate="2019-07-03T18:34:15.620" LastActivityDate="2019-07-03T18:34:15.620" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17609" PostTypeId="1" CreationDate="2019-04-27T06:31:51.247" Score="-1" ViewCount="56" Body="&lt;p&gt;According to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12310/&quot;&gt;Can Halting be considered output?&lt;/a&gt; and maybe some other links, programs should halt. However in some cases making program halt is easier(save the infinite loop in code-golf, etc.) but making it almost impossible to see the result; or for some environment there's just no such thing &quot;halt&quot;. What's the standard in this case?&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2019-04-27T07:39:35.580" Title="Not halt to prevent display from disappearing" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17610" PostTypeId="2" ParentId="17609" CreationDate="2019-04-27T07:23:08.083" Score="3" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'd expect that the output is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7139/69850&quot;&gt;displayed on the screen&lt;/a&gt; in that case.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In fact most Vim submissions on this site doesn't halt after execution (the process doesn't stop)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;However, in common cases, the output won't &quot;disappear&quot; when the program is ended if it's run in a console.&lt;/p&gt;&#xA;" OwnerUserId="69850" LastEditorUserId="69850" LastEditDate="2019-04-27T07:39:35.580" LastActivityDate="2019-04-27T07:39:35.580" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17611" PostTypeId="2" ParentId="8047" CreationDate="2019-04-27T22:13:25.333" Score="18" Body="&lt;h1&gt;Exceptional edge cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Don't require special behavior when the input is the empty list, the number 0, a negative length, etc. This makes for nasty surprises for solvers who worked on a solution only to find it's invalid on a technicality.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When possible, the edge case should follow the same rules as any other input without special instructions. However, even when the right answer is mathematically clear, it's often better to just specify the input will be non-empty, positive, etc, and avoid the issue altogether. If you do insist on including the edge case, do include a test case for it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One place this comes up is the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8395/20260&quot;&gt;string representation of 0&lt;/a&gt;, which is conventionally &lt;code&gt;'0'&lt;/code&gt; but mathematically is the empty string. Once in a while I find a nice recursive function that beats the boring built-in string conversion, but it fails the 0 test case, and it costs too many ugly bytes to patch. Specifying nonzero input would avoid this.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2019-04-27T22:13:25.333" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17612" PostTypeId="1" CreationDate="2019-04-28T03:34:53.497" Score="42" ViewCount="2423" Body="&lt;h1&gt;UPDATE: New site name chosen!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17725/heres-your-site-design-preview&quot;&gt;This site is now &quot;Code Golf &amp;amp; Coding Challenges&quot;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thank you all so much for participating in this discussion!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;As we're designing the site, we are considering the name and how the logo/&lt;a href=&quot;https://en.wikipedia.org/wiki/Wordmark&quot; rel=&quot;nofollow noreferrer&quot;&gt;wordmark&lt;/a&gt; of the site will look (be excited, that means we're actually in-progress!!!). In our discussions internally, there was a question of what y'all actually call this site. As an outsider, I tend to refer to it as &quot;PPCG&quot; but I think a lot of people call it &quot;Code Golf&quot;. I'm not sure many people write out the full name in most cases because of the length.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, as part of this site redesign, since the design and its logo will be your branding for (hopefully) forever we want to ask you to choose:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Keep &lt;strong&gt;Programming Puzzles &amp;amp; Code Golf&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Change to &lt;strong&gt;Code Golf&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;There &lt;em&gt;is&lt;/em&gt; a third option - a new name entirely - but this comes with a lot of complications such as changing the site URL and completely rebranding the site which will delay this process quite a bit (6 months, probably) as it will require a lot of internal work and discussion (see the many-year process for switching &lt;a href=&quot;https://softwareengineering.meta.stackexchange.com/questions/7935/4-years-later-dear-stack-exchange-can-we-change-our-site-name&quot;&gt;Programmers to Software Engineering&lt;/a&gt;). Because &quot;Code Golf&quot; is pretty commonly used already &lt;em&gt;and&lt;/em&gt; it's the URL for the site currently, the thinking is that it won't be too much of a change for the site identity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Before you start deciding, I'd like to bring up a few thoughts I've had while talking with mods on this site and our design team:&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Design concerns&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I'm starting here with what may be the most pragmatic of the concerns and what brought this discussion up on our end... we have about 400x70 px (width, height) to work with for both a logo and wordmark for our site. Fitting &quot;Programming Puzzles &amp;amp; Code Golf&quot; (31) in that space can be done - it's definitely an option - but it will likely limit our choices as we balance fit with design.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some examples of sites with long names (which are all at least slightly shorter than PPCG):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Geographic Information Systems (30)&lt;br&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/RHaGc.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/RHaGc.png&quot; alt=&quot;Geographic Information Systems logo and wordmark&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Theoretical Computer Science (28)&lt;br&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/6540U.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/6540U.png&quot; alt=&quot;Theoretical Computer Science logo and wordmark&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;English Language Learners (25)&lt;br&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/Ozg40.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Ozg40.png&quot; alt=&quot;English Language Learners logo and wordmark&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What I see is that we've solved the long name problem in the past by either using narrower fonts or less spacing between letters, or putting the site name on two lines. Both of these solutions have the effect of making the wordmark seem a bit scrunched but, importantly, they don't look bad.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Oh, and if you're wondering about the max width - because of the responsive design, on mobile, we need to support phones as narrow as about 320px wide. If a wordmark is wider than that it will have to get sized down to fit on those screens without going off the side. A small amount of this looks fine, since the viewing distance is shorter but too much and it can start to be more difficult to read.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Scope &amp;amp; Branding&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I've poked around a bit and talked to your mods a little and what I've found in the past is that there's been some discussion about the site name here for reasons of scope accuracy and branding. This seemed to be a big part of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5759/should-we-change-our-name&quot;&gt;discussion in 2015 about the site name&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The current top three choices there are:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;No change - 39 (+59/-20)&lt;/li&gt;&#xA;&lt;li&gt;Code Sport - 38 (+51/-13)&lt;/li&gt;&#xA;&lt;li&gt;Code Golf - 31 (+45/-14)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Now, it's been a few years since that was posted and I'm not sure that the points about programming puzzles vs code golfing discussed in some of the answers are still accurate. What I do see is that the &lt;em&gt;recent&lt;/em&gt; voting on that post indicates that the more recent votes (since 2017) are split about 50/50 on keeping PPCG (+6/-5) but unanimous on shortening to Code Golf (+11) or changing to Code Sport (+8) and Code Games seems to be gaining popularity, too (+11).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I do understand the concerns about site name descriptiveness. It's a complicated issue that is unlikely to ever have a perfect solution. As they say, &lt;em&gt;naming is hard&lt;/em&gt;. Other sites on the network have to deal with this; Arqade isn't only about arcade games, Movies &amp;amp; TV isn't a place to ask questions about setting up your television. Bitcoin (for now, anyway) accepts questions about many different cryptocurrencies in addition to Bitcoin specifically. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;There will always be a struggle with balancing scope with a descriptive site name, which is why I think so many companies choose non-descriptive words for their company names - and we've done it in a few places like Seasoned Advice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, considering the above - and anything else you've been thinking about...&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What should this site be called and why?&lt;/h2&gt;&#xA;" OwnerUserId="78028" LastEditorUserId="78028" LastEditDate="2019-05-30T20:03:44.600" LastActivityDate="2019-05-30T20:03:44.600" Title="What should this site be called now that it's getting a design?" Tags="|discussion|site-name|" AnswerCount="13" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="17613" PostTypeId="2" ParentId="17612" CreationDate="2019-04-28T04:54:57.767" Score="44" Body="&lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As in our previous discussion, I think we should shorten our name to &lt;em&gt;Code Golf&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Design or not, &lt;em&gt;Programming Puzzles &amp;amp; Code Golf&lt;/em&gt; is simply too long. We rarely ever spell it out, so we end up with a cryptic abbreviation outsiders don't understand. While &lt;em&gt;Code Golf&lt;/em&gt; doesn't cover all of our topics, it's certainly more descriptive than &lt;em&gt;PPCG&lt;/em&gt;. Even the full name does a rather poor job, as pure programming puzzles (opposed to programming challenges) are not completely on topic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Branding is important too, so I don't think we should switch to an entirely different name. While &lt;em&gt;Code Games&lt;/em&gt; and &lt;em&gt;Code Sports&lt;/em&gt; do a better job describing our scope, &lt;em&gt;Code Golf&lt;/em&gt; was the original name of our Area 51 proposal and has been the subdomain of our site—and the name other SE communities have been using to refer to us—for the past eight years.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, I think &lt;em&gt;Code Golf&lt;/em&gt; does a fine job hinting what our site is about, like &lt;em&gt;Stack Overflow&lt;/em&gt; does for our Q&amp;amp;A that isn't just about stack overflows. Most of our challenges are code golf anyway, it's certainly more recognizable than &lt;em&gt;Code Games&lt;/em&gt; and &lt;em&gt;Code Sports&lt;/em&gt;, and anybody who interacts a bit with our site (by looking at the tags, for example) should be able to tell that we aren't &lt;em&gt;Only Code Golf&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2019-04-28T16:57:33.133" LastActivityDate="2019-04-28T16:57:33.133" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="17615" PostTypeId="2" ParentId="17612" CreationDate="2019-04-28T08:03:12.003" Score="60" Body="&lt;h2&gt;Code Golf with a subtitle&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The site's main purpose is code golf, but not its only purpose (really, this is a site about competitive programming in general, it's just that code golf is by far the most common sort of competition for good reason). It would make sense to have the name of &quot;code golf&quot; emphasised in the title, but to include a subtitle on the word mark to make it clear that the site isn't (yet) &lt;em&gt;entirely&lt;/em&gt; consumed by shortening byte counts. (The readability of the subtitle would be comparatively unimportant; people would still get mostly the right idea from just the title.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My best idea so far is&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;  &#xA;  and other programming challenges&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Admittedly, CGAOPC is pretty terrible as an acronym, so the site's title would still have to be &quot;Code Golf&quot;, but I think that'd look fairly good on a wordmark and make it clear what the site is about. Code Golf works fine as a name within Stack Exchange; it's only outside it that the name has trouble referring to a particular site (just like, say, &lt;a href=&quot;http://softwareengineering.stackexchange.com&quot;&gt;softwareengineering.stackexchange.com&lt;/a&gt; has &quot;Software Engineering&quot; as its wordmark, but is named &quot;Software Engineering Stack Exchange&quot; in its &amp;lt;title&amp;gt; as &quot;Software Engineering&quot; would be too ambiguous as the name of a website).&lt;/p&gt;&#xA;" OwnerUserId="84332" LastActivityDate="2019-04-28T08:03:12.003" CommentCount="16" ContentLicense="CC BY-SA 4.0" />
  <row Id="17616" PostTypeId="2" ParentId="17612" CreationDate="2019-04-28T13:59:42.080" Score="8" Body="&lt;p&gt;&amp;quot;Code Golf&amp;quot; is the largest group of questions here (91% of non-closed questions since 2017 according to xnor), but they are certainly not the only questions. So while &lt;em&gt;codegolf&lt;/em&gt; makes sense for the subdomain, having a longer full site name makes a lot of sense.&lt;/p&gt;&#xA;&lt;p&gt;In order to keep &amp;quot;Code Golf&amp;quot; primary, while keeping the overall name descriptive:&lt;/p&gt;&#xA;&lt;h3&gt;Code Golf and Programming Challenges&lt;/h3&gt;&#xA;&lt;p&gt;This would be a flip from the original name, but fit with the general &amp;quot;just call it Code Golf&amp;quot; concept.&lt;/p&gt;&#xA;&lt;p&gt;For a logo, &lt;em&gt;Code Golf&lt;/em&gt; could be BIG - like ENGLISH in English Language Learners with Programming Challenges smaller. See also the  &lt;a href=&quot;https://music.stackexchange.com/&quot;&gt;https://music.stackexchange.com/&lt;/a&gt; logo.&lt;/p&gt;&#xA;" OwnerUserId="69008" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-04-28T13:59:42.080" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17617" PostTypeId="2" ParentId="17612" CreationDate="2019-04-28T18:35:05.017" Score="27" Body="&lt;h2&gt;Code Golf &amp;amp; Challenges&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(22 bytes)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I thinks this alternative is a brief solution to the problem many people take issue with. Yes, our current title is decidedly too long. This answer, however, maintains the essence of the old title without all the unnecessary characters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For reference, following this paragraph is a list of the 10 longest official site names, obtained from &lt;a href=&quot;https://stackexchange.com/sites?view=list#name&quot;&gt;this list&lt;/a&gt;. Under the new name, in terms of length, we'd be shorter than &lt;code&gt;Gardening &amp;amp; Landscaping (23)&lt;/code&gt;, same as &lt;code&gt;Electrical Engineering (22)&lt;/code&gt;, and longer than &lt;code&gt;Computational Science (21)&lt;/code&gt;. I think that would nestle our site quite neatly in the length hierarchy. After all, shaving 9 bytes can go a long way. &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;Software Quality Assurance &amp; Testing (36)&#xA;Motor Vehicle Maintenance &amp; Repair (34)&#xA;History of Science and Mathematics (34)&#xA;&lt;b&gt;Programming Puzzles &amp; Code Golf (31)&lt;/b&gt;&#xA;Geographic Information Systems (30)&#xA;Theoretical Computer Science (28)&#xA;Stack Overflow em Português (27)&#xA;Genealogy &amp; Family History (26)&#xA;Computer Science Educators (26)&#xA;Science Fiction &amp; Fantasy (25)&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;(&lt;a href=&quot;https://paste.ee/p/JusH5&quot; rel=&quot;nofollow noreferrer&quot;&gt;Paste.ee containing the list, ordered by character length ascending and descending&lt;/a&gt;.)&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="31957" LastActivityDate="2019-04-28T18:35:05.017" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17618" PostTypeId="2" ParentId="17612" CreationDate="2019-04-28T20:21:16.517" Score="-17" Body="&lt;h1&gt;Code Competitions and Golf&lt;/h1&gt;&#xA;&lt;p&gt;We need to mention &amp;quot;Code Golf&amp;quot; in the title because it makes up a large portion of all open questions (as manassehkatz quoted xnor). We still should address that we &lt;em&gt;are&lt;/em&gt; okay with other programming competitions, since 9% is still a notable percentage, hence the name (&amp;quot;Code Competitions/Golf&amp;quot;).&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;EDIT: edited the name to address  manassehkatz's concern&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;EDIT: edited the name to address Jo King's concern.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="83048" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-04-30T01:30:56.983" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17620" PostTypeId="2" ParentId="17612" CreationDate="2019-04-29T09:56:19.380" Score="-22" Body="&lt;h1&gt;Programming Puzzles&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;What if you don't know the rules of golf? How would you then interpret the term '&lt;em&gt;code golf&lt;/em&gt;'? For all you know, '&lt;em&gt;code golf&lt;/em&gt;' doesn't need to mean the shortest amount of bytes. If you're a match player (although rare to find in international tournaments), then winning is &lt;em&gt;not&lt;/em&gt; determined by the number of strokes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And even if you do, what does Python, for example, have to do with club hitting a golf ball? It's not immediately clear. Or are you coding a golfing video game?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What you are in fact doing is constructing programming to achieve a certain goal. But you do not necessarily take into consideration its actual usability. You're not coding software for your job, it's for fun. The term '&lt;em&gt;programming challenges&lt;/em&gt;' can be applicable to serious work requirements as well. It does not explain that you should probably not be using CJam for say, aircraft firmware.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A puzzle is defined as '&lt;em&gt;a game, toy, or problem designed to test ingenuity or knowledge&lt;/em&gt;', and it is applicable here, because it does take skill to win a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="86316" LastActivityDate="2019-04-29T09:56:19.380" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17621" PostTypeId="2" ParentId="2140" CreationDate="2019-04-29T12:14:42.423" Score="1" Body="&lt;h1&gt;Sort a list using a stack and a queue&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot;&gt;sorting&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider an unsorted list of length &lt;code&gt;n&lt;/code&gt;, containing the integers &lt;code&gt;1&lt;/code&gt; through &lt;code&gt;n&lt;/code&gt;. Your job is to sort them using a stack (FIFO) and a queue (LIFO) and a single register. To do this, you have access to six commands&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;i    Input the next integer onto the register&#xA;o    Output the value of the register&#xA;Q    Place the value of the register at the tail of the queue (enqueue)&#xA;q    Place the value of the head of the queue in the register (dequeue)&#xA;S    Place the value of the register at the top of the stack (push)&#xA;s    Place the value of the top of the stack in the register (pop)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A few examples (sorting in ascending order):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA; [1 2 3 4] &#xA;Commands:&#xA; ioioioio&#xA;&#xA;Input:&#xA; [3 2 4 1]&#xA;Commands:&#xA; iQiSiQiosoqoqo&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a  program or function that, given some (unsorted) list, returns a sequence of commands that outputs an ordered list. However, &lt;strong&gt;the number of commands should grow as &lt;span class=&quot;math-container&quot;&gt;\$o(n^2)\$&lt;/span&gt;, i.e., strictly smaller than &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{O}(n^2)\$&lt;/span&gt;&lt;/strong&gt;. That is, for sufficiently large &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, you must always use less than &lt;span class=&quot;math-container&quot;&gt;\$cn^2\$&lt;/span&gt; commands (with &lt;span class=&quot;math-container&quot;&gt;\$c\$&lt;/span&gt; some positive constant) to sort the list.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input is flexible. The list of size &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; may start from &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; or from &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; and will always contain all integers from &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$n-1\$&lt;/span&gt; or from &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; respectively. You may take &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; as a separate input if desired.&lt;/li&gt;&#xA;&lt;li&gt;The output is flexible. You may choose a different set of unambiguous command identifiers instead of &lt;code&gt;ioQqSs&lt;/code&gt;. You may output as a string (which is allowed to contain superfluous characters such as delimiters, linebreaks, etc), or as an array or list of commands.&lt;/li&gt;&#xA;&lt;li&gt;Your entry must indicate the worst-case output size, e.g., &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{O}(n)\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{O}(n\log(n))\$&lt;/span&gt;, which must of course be strictly smaller than &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{O}(n^2)\$&lt;/span&gt;. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;A few notes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Things like &lt;code&gt;ii&lt;/code&gt;, &lt;code&gt;qi&lt;/code&gt;, &lt;code&gt;oo&lt;/code&gt; should never happen. You only have one register, and overwriting it would mean you can no longer output the full sorted list.&lt;/li&gt;&#xA;&lt;li&gt;A naive approach would be to put the entire input in the queue &lt;code&gt;iQiQiQ...&lt;/code&gt; and then cycling through the queue &lt;code&gt;qQqQqQ...&lt;/code&gt; until the register contains the next integer in order. However, this approach would mean you have &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{O}(n)\$&lt;/span&gt; cycling commands for &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{O}(n)\$&lt;/span&gt; numbers, which would be &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{O}(n^2)\$&lt;/span&gt; and thus does not meet the complexity requirement.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="32352" LastEditorUserId="32352" LastEditDate="2019-05-02T15:59:57.507" LastActivityDate="2019-05-02T15:59:57.507" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="17622" PostTypeId="2" ParentId="17612" CreationDate="2019-04-29T13:01:56.433" Score="33" Body="&lt;p&gt;Keep&lt;/p&gt;&#xA;&lt;h1&gt;Programming Puzzles &amp;amp; Code Golf&lt;/h1&gt;&#xA;&lt;p&gt;I would like to continue using the name we've had for the last few years because that is what we all are used to now and that is what we all refer to it. Using the abbreviation PPCG is now quite established and unambiguous, even if it maybe isn't the most descriptive name you could think of now after it has developed itself so much since the start of this SE site.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-04-29T13:01:56.433" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17624" PostTypeId="2" ParentId="17612" CreationDate="2019-04-30T01:38:12.733" Score="-24" Body="&lt;h1&gt;Code Underflow&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;PROS:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Fixes the issue with just &quot;Code Golf&quot; being too ambiguous.&lt;/li&gt;&#xA;&lt;li&gt;Every reason in the &quot;Code Golf&quot; answer (except &quot;Code Golf was the original name of our Area 51 proposal and has been the subdomain of our site—and the name other SE communities have been using to refer to us—for the past eight years.&quot; (Dennis 1).)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;CONS:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Code Underflow has (only) a vague reference to Code Golf.&lt;/li&gt;&#xA;&lt;li&gt;It doesn't mention other programming puzzles.&lt;/li&gt;&#xA;&lt;li&gt;(Integer) underflow suggests a very large positive number, and only ever occurs in an attempt to represent a negative number – this doesn't really make sense with regard to any challenge common on the site.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;EDIT: I am making this answer community wiki so other users can update the pros/cons&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="83048" LastEditorUserId="43394" LastEditDate="2019-05-12T14:30:49.433" LastActivityDate="2019-05-12T14:30:49.433" CommentCount="3" CommunityOwnedDate="2019-04-30T01:38:12.733" ContentLicense="CC BY-SA 4.0" />
  <row Id="17625" PostTypeId="2" ParentId="17612" CreationDate="2019-04-30T01:58:23.850" Score="-7" Body="&lt;h2&gt;Competitive Programming&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It's short, simple, descriptive, and encompasses all of what we do here.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2019-04-30T01:58:23.850" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17626" PostTypeId="2" ParentId="17612" CreationDate="2019-04-30T10:56:53.223" Score="4" Body="&lt;p&gt;A few answers use the word &lt;em&gt;challenge&lt;/em&gt;, and although that word is used in meta quite a bit as more accurate than &lt;em&gt;question&lt;/em&gt; it doesn't seem to me to have the right connotation. To me it connotes a difficult goal where what matters is achieving it at all. There is a word which connotes the aspect of competition between answers, and as a bonus is shorter: &lt;strong&gt;contest&lt;/strong&gt;. So if we're going to abandon PPCG I propose:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Code Golf &amp;amp; Contests&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Code Contests&lt;/em&gt; would be snappier, but I agree with the arguments for keeping &lt;em&gt;golf&lt;/em&gt; in the name.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2019-04-30T10:56:53.223" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17630" PostTypeId="1" CreationDate="2019-05-02T09:13:43.657" Score="4" ViewCount="77" Body="&lt;p&gt;For &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; questions, TIO has been a superb resource. However, for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenges there is no equivalent tool available. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe we could explore working with one or more 3rd parties to build such a tool; it would be in the clear interests of performance analysers, cloud providers, Microsoft, chipmakers etc to build something and have visibility with a fairly top flight group of developers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12707/is-tio-acceptable-for-fastest-code-questions&quot;&gt;A previous question&lt;/a&gt; on whether TIO was adequate for performance challenges was fairly conclusive that it wasn't, and that there wasn't an easy alternative. Having a communal tool would also resolve &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/388/comparing-fastest-code&quot;&gt;the gnarly problems of performance competitions&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In terms of function, I would imagine at least initially a lang/VM-specific challenge format, e.g. single-threaded Python, parallel C++/native via xyz libraries, or JVM; it may be sensible for different 3rd parties to provide different environments matching their commercial focus. As a minimum, a company could in theory provide for a specific scenario as a microservice to TIO if that was acceptable to everyone.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there is support here, I am happy to make contact with essentially anyone on &lt;a href=&quot;https://en.wikipedia.org/wiki/List_of_performance_analysis_tools&quot; rel=&quot;nofollow noreferrer&quot;&gt;the perf analysis radar&lt;/a&gt; in that light. If they could work with (maybe sponsor?) TIO as well, that might help pay back a debt to Dennis and simultaneously make the tool relevant, given how perfect the TIO fit is for PPCG questions.&lt;/p&gt;&#xA;" OwnerUserId="14710" LastActivityDate="2019-05-09T06:35:50.407" Title="Is there support to approach 3rd parties to build a performance tool?" Tags="|discussion|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17634" PostTypeId="2" ParentId="17630" CreationDate="2019-05-03T02:11:02.160" Score="4" Body="&lt;h1&gt;I don't think so&lt;/h1&gt;&#xA;&lt;p&gt;I disagree primarily with this:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;it would be in the clear interests of performance analysers, cloud&#xA;providers, Microsoft, chipmakers etc to build something and have&#xA;visibility with a fairly top flight group of developers.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;For parties in the business of performance, they already have highly-skilled developers that know how to write and test for performance.  Furthermore, these parties likely have specific features or parts they are looking to test.  There's no guarantee that we would test those parts, so why would they fund this?&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-05-03T02:11:02.160" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17635" PostTypeId="2" ParentId="2140" CreationDate="2019-05-03T02:53:14.410" Score="1" Body="&lt;h2&gt;Performance-Based Resource Gathering/Trading&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this KoTH, the goal is to be the bot with the highest amount of money by the end of the game. Bots perform actions to earn money in turns. There are a set number of rounds in a game, and each round allows each bot to play. In a play, bots have set number of milliseconds to run as many turns as possible, growing their crops/trees/animals, mining for materials, or harvesting materials.&lt;/p&gt;&#xA;&lt;h3&gt;Earning Money&lt;/h3&gt;&#xA;&lt;p&gt;There are four basic &amp;quot;professions&amp;quot;, though bots are not bound to a specific profession. These professions require land to collect resources, and land is zoned by its owner as one profession:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Farming&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Farming uses turns to plant, grow, and harvest crops. There are three crops: wheat, carrot, and cotton. Each unit of land zoned for farming can hold up to 40 crops simultaneously. There is no randomness in farming. The crops are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Wheat: The most basic crop, wheat, takes 40 turns to grow. It is planted with 1 wheat seed, and grows into 2 wheat&lt;/li&gt;&#xA;&lt;li&gt;Carrot: Carrots are the fastest growing crop, taking only 16 turns to grow. Carrots are planted with one carrot, and grow into 4&lt;/li&gt;&#xA;&lt;li&gt;Cotton: Cotton grows very slowly, but is a valuable item in the economy. It is planted with 1 cotton seed, and produces 3 cotton in 96 turns.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Ranching:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Ranching uses land to raise animals, which can be used to produce meat and other goods. Ranching is only very mildly randomized. There are three animals: chickens, cows, and sheep.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Chickens: A chicken takes up 2.5% of the land it occupies. Chickens lay eggs once every 8-10 turns, and an egg can be hatched into a chicken in 64 turns. Chickens last 192 turns before they stop producing eggs. Chickens can be harvested for 1 meat&lt;/li&gt;&#xA;&lt;li&gt;Cows: Cows do not produce items until they are harvested. A cow takes up 5% of the land it occupies, and are &amp;quot;mature&amp;quot; 144 turns after being bought. Mature cows can be harvested for 6-8 meat and 2 leather&lt;/li&gt;&#xA;&lt;li&gt;Sheep: A sheep takes up 6.25% of the land they occupy. Sheep last indefinitely, and produce wool every 112-132 turns. They can be sheared for 2 wool each time this happens. Sheep do not produce anything when harvested, and never stop producing wool&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Woodcutting:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Land zoned for woodcutting contains 12 spaces for trees. Woodcutting is a moderately random-based profession. There are three types of trees available:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Oak: Oak saplings take 120-132 turns to grow, and produce 8-16 wood&lt;/li&gt;&#xA;&lt;li&gt;Cedar: Cedar saplings take 84-96 turns to grow, and produce 5-9 wood&lt;/li&gt;&#xA;&lt;li&gt;Hemlock: Hemlock saplings take 240-280 turns to grow, and produce 14-22 wood&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Mining:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Mining is a completely random-based profession. Each turn in which the bot mines produces one of three materials:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Stone: Stone has a 65% chance&lt;/li&gt;&#xA;&lt;li&gt;Iron: Iron has a 30% chance&lt;/li&gt;&#xA;&lt;li&gt;Gold: Gold has a 5% chance&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Economy/Raw Materials&lt;/h3&gt;&#xA;&lt;p&gt;You may be wondering: What do the bots do with all these materials? Well, factories can be built on land, and used to make new items. These items can be sold to NPC traders, or used by bots to improve their efficiency at a profession.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Wood&lt;/strong&gt;: Wood is used for the creation of tools, construction of factories, and as a fuel source&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Stone:&lt;/strong&gt; Stone is used for construction and tools&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Iron:&lt;/strong&gt; Iron is used for the creation of tools and factories&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Gold:&lt;/strong&gt; Gold is highly sought after by traders&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Wheat:&lt;/strong&gt; Wheat is necessary to feed cows and sheep, as well as the creation of bread&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Carrot:&lt;/strong&gt; Carrots are necessary to feed chickens&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Cotton/Wool/Leather:&lt;/strong&gt; The Loom factory converts these materials into cloth, which is sold to traders or used to make clothes&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Eggs:&lt;/strong&gt; Eggs are necessary to make bread&lt;/p&gt;&#xA;&lt;h3&gt;Factories&lt;/h3&gt;&#xA;&lt;p&gt;There are three factories, each for a specific type of good:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Loom:&lt;/strong&gt; The loom converts cotton, wool, and leather into cloth, and cloth into clothes. Clothes increase the amount of time to run turns by 20% per piece equipped, up to 3, for the next 5 rounds.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Bakery:&lt;/strong&gt; The bakery converts wheat into flour. Flour and eggs are then converted into bread, which can be sold or equipped. When consumed, bread increases time to run turns by 25% for the next 2 rounds. Meat can also be consumed, but increases the time by 40% for 3 rounds.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Smithy:&lt;/strong&gt; The smithy creates tools. These tools are: plow, trough, axe, and shovel. Each tool doubles the time for ticks in the round it is used.&lt;/p&gt;&#xA;&lt;h3&gt;Other&lt;/h3&gt;&#xA;&lt;p&gt;This is not complete, and many numbers still need to be added or changed to make things more equal between professions. Things like land still need to be figured out, but that's what the sandbox is for I suppose. This seems a little complicated, but each bot will probably stick with either a single profession or just be a factory owner.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-05-03T02:53:14.410" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17636" PostTypeId="1" CreationDate="2019-05-03T06:54:26.770" Score="2" ViewCount="122" Body="&lt;p&gt;Since bash scripts (or any other Linux shell scripts) &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2028/32381&quot;&gt;are accepted as a programming language&lt;/a&gt;, I wonder what (Linux) programs are accepted as callable from the command line.&lt;/p&gt;&#xA;&lt;p&gt;It seems that it is concensus that all programs in the coreutils package are allowed to be called from a shell script (several answers can be found in this category). From a certain perspective those programs can be seen as libraries, used by the shell script.&lt;/p&gt;&#xA;&lt;p&gt;But how about other programs outside the coreutils in a (any) distribution's repository? Are they allowed? And if so, up to what extent?&lt;/p&gt;&#xA;&lt;p&gt;For example is &lt;a href=&quot;https://codegolf.stackexchange.com/q/185005/32381&quot;&gt;this question&lt;/a&gt;, I could use &lt;a href=&quot;http://manpages.ubuntu.com/manpages/xenial/man1/sipcalc.1.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;sipcalc&lt;/a&gt; to fabricate a shell script (bash) answer. Is this allowed?&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Disclaimer: I searched meta for an answer to this question, but I could not find it. Maybe I missed it. If so, please let me know in the comments.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="32381" LastEditorUserId="68942" LastEditDate="2021-04-03T20:28:43.347" LastActivityDate="2021-04-03T20:28:43.347" Title="In bash, can I use non-coreutil programs" Tags="|discussion|policy|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17637" PostTypeId="2" ParentId="17636" CreationDate="2019-05-03T10:09:27.920" Score="6" Body="&lt;p&gt;I'm not too familiar with Bash, Linux Shell, and other scripting languages. But I don't see why this wouldn't be allowed, as long as you've mentioned it in the title. Similar things are done with internal libraries (&lt;a href=&quot;https://codegolf.stackexchange.com/a/165194/52210&quot;&gt;Python 3, numpy, scikit, 100%&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/a/120862/52210&quot;&gt;Bash + Cygwin (or WSL), 21 bytes&lt;/a&gt;) as well as with flags (i.e. &lt;a href=&quot;https://codegolf.stackexchange.com/a/179400/52210&quot;&gt;C# (Visual C# Interactive Compiler) with flag &lt;code&gt;/u:System.Text.RegularExpressions.Regex&lt;/code&gt;, 99 bytes&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/a/162169/52210&quot;&gt;Perl 5 with &lt;code&gt;-nlF/\s|/&lt;/code&gt;, 39 bytes&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14339/52210&quot;&gt;Here is a relevant meta-answer for flags&lt;/a&gt;, for which I'll quote the first sentence:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Rather than dealing with inconsistent schemes for adding flags, let's just consider each separate invocation of a compiler/interpreter/whatever a separate implementation (and thus a separate language by our rules).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't see why the same wouldn't apply to external libraries as well. Where a regular Bash answer and a Bash answer with your sipcalc library are just two 'different languages'.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;EDIT: Some examples of languages using external libraries (most are pre-2016 however):&lt;br&gt;&#xA;- &lt;a href=&quot;https://codegolf.stackexchange.com/a/22967/52210&quot;&gt;PHP using SimplePHPEasyPlus, 1299&lt;/a&gt;;&lt;br&gt;&#xA;- &lt;a href=&quot;https://codegolf.stackexchange.com/a/102793/52210&quot;&gt;Racket using an external library for clearing, 351 bytes&lt;/a&gt;;&lt;br&gt;&#xA;- &lt;a href=&quot;https://codegolf.stackexchange.com/a/91243/52210&quot;&gt;JavaScript (using external library Enumerable), 52 bytes&lt;/a&gt;;&lt;br&gt;&#xA;- &lt;a href=&quot;https://codegolf.stackexchange.com/a/64130/52210&quot;&gt;R using external library &lt;code&gt;gmp&lt;/code&gt;, 52 bytes&lt;/a&gt;;&lt;br&gt;&#xA;- &lt;a href=&quot;https://codegolf.stackexchange.com/a/52583/52210&quot;&gt;JavaScript using Node.js with moment + HumanizeDuration, 125 bytes&lt;/a&gt;;&lt;br&gt;&#xA;- &lt;a href=&quot;https://codegolf.stackexchange.com/a/5227/52210&quot;&gt;R using lubridate package, 99 bytes&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As long as you clearly mention it, and link to the external library used, it's allowed as far as I know (unless the challenge explicitly forbids it (i.e. &quot;&lt;em&gt;Use of external libraries is forbidden&lt;/em&gt;&quot;, which also happens pretty often).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've also posted an answer with an external library once (although I now see I've forgot to link to the library..): &lt;a href=&quot;https://codegolf.stackexchange.com/a/124190/52210&quot;&gt;Java 7 with JavaFX, 674 bytes&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="52210" LastEditorUserId="52210" LastEditDate="2019-05-03T10:27:51.353" LastActivityDate="2019-05-03T10:27:51.353" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17638" PostTypeId="2" ParentId="2140" CreationDate="2019-05-03T19:53:20.697" Score="3" Body="&lt;h1&gt;Output the Visible Spectrum in RGB&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;http://www.physics.sfasu.edu/astro/color/spectra.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.physics.sfasu.edu/astro/color/spectra.html&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Light with wavelength between ~380 and 780 nanometers is considered to be within the visible spectrum. One can approximate the colors of the visible spectrum in RGB space by linearly interpolating the wavelength at specific ranges. The ranges and corresponding formulae for a wavelength &lt;code&gt;wl&lt;/code&gt; are given below, assuming each color value is a real between 0 and 1:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;[380-440): &lt;code&gt;r = (440 - wl) / (440 - 380), g = 0, b = 1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;[440-490): &lt;code&gt;r = 0, g = (wl - 440) / (490 - 440), b = 1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;[490-510): &lt;code&gt;r = 0, g = 1, b = (510 - wl) / (510 - 490)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;[510-580): &lt;code&gt;r = (wl - 510) / (580 - 510), g = 1, b = 0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;[580-645): &lt;code&gt;r = 1, g = (645 - wl) / (645 - 580), b = 0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;[645-780): &lt;code&gt;r = 1, g = 0, b = 0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Note that in this system, the interpolation formula is cyclic with the color components, and changes sign with respect to the range maximum or minimum.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an integer wavelength between 380 and 780, output the RGB value using the above interpolations. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output may be a list of floats in [0,1] or integers between [0,255] in the format (r,g,b), or a valid RGB hex code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code golf, so the shortest code in bytes wins!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Rounding errors to within 0.01 in float format or to within 1 in integer format are acceptable.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;wl=400 --&amp;gt; (0.29, 0.0, 0.65) or (73,0,165) or #4900A5&#xA;wl=530 --&amp;gt; (0.28, 1.0, 0.0)  or (72,255,0) or #48FF00&#xA;wl=640 --&amp;gt; (1.0, 0.07, 0.0)  or (255,19,0) or #FF1300&#xA;wl=750 --&amp;gt; (1.0, 0.0, 0.0)   or (255,0,0)  or #FF0000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Bonus&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;At extreme ranges of the visible spectrum, human perception is not as good. This can be modeled as a loss of intensity by multiplying the RGB values computed above by a factor &lt;code&gt;f&lt;/code&gt; for specific cutoff points:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;wl&lt;/code&gt; &amp;lt; 420: &lt;code&gt;f=0.3+0.7*(wl-380)/(420-380)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;wl&lt;/code&gt; &gt; 700: &lt;code&gt;f=0.3+0.7*(780-wl)/(780-700)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The total (r,g,b) including the perception factor is therefore &lt;code&gt;(f*r, f*g, f*b)&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="86859" LastEditorUserId="73111" LastEditDate="2019-05-03T20:19:13.747" LastActivityDate="2019-05-03T20:19:13.747" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17641" PostTypeId="2" ParentId="2140" CreationDate="2019-05-05T04:43:11.373" Score="3" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/approximation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;approximation&amp;#39;&quot; rel=&quot;tag&quot;&gt;approximation&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Approximating Roots&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(If you can think of a better title, then please suggest it!)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One day, when I was bored in maths class, I learned of a neat trick for solving the real cube root of a number!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's use the number &lt;span class=&quot;math-container&quot;&gt;\$79,507\$&lt;/span&gt; as an example.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First, take digit in the one's place and compare it to this table:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\begin{array} {|r|r|}&#xA;\hline&#xA;\text{Extracted Digit} &amp;amp;\text{Resulting Digit} \\&#xA;\hline&#xA;\text{1} &amp;amp;\text{1} \\&#xA;\text{2} &amp;amp;\text{8} \\&#xA;\text{3} &amp;amp;\text{7} \\&#xA;\text{4} &amp;amp;\text{4} \\&#xA;\text{5} &amp;amp;\text{5} \\&#xA;\text{6} &amp;amp;\text{6} \\&#xA;\text{7} &amp;amp;\text{3} \\&#xA;\text{8} &amp;amp;\text{2} \\&#xA;\text{9} &amp;amp;\text{9} \\&#xA;\text{0} &amp;amp;\text{0} \\&#xA;\hline&#xA;\end{array}&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this example, the &lt;code&gt;Resulting Digit&lt;/code&gt; will be &lt;span class=&quot;math-container&quot;&gt;\$3\$&lt;/span&gt; since the digit in the one's place is &lt;span class=&quot;math-container&quot;&gt;\$7\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Next, remove all digits that are less than &lt;span class=&quot;math-container&quot;&gt;\$10^3\$&lt;/span&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$ 79507 → 79 $$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then, find the largest perfect cube that does not exceed the input:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$ 64 &amp;lt; 79 $$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$64=4^3\$&lt;/span&gt;, thus the next digit needed is &lt;span class=&quot;math-container&quot;&gt;\$4\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, multiply the digit found in the previous step by &lt;span class=&quot;math-container&quot;&gt;\$10\$&lt;/span&gt; and add the &lt;code&gt;Resulting Digit&lt;/code&gt; found in the first step:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$ 10*4+3=43 $$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thus, the cube root of &lt;span class=&quot;math-container&quot;&gt;\$79,507\$&lt;/span&gt; equals &lt;span class=&quot;math-container&quot;&gt;\$43\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;However&lt;/em&gt;&lt;/strong&gt;, there a neat quirk about this trick: it doesn't apply to &lt;em&gt;only&lt;/em&gt; cubed numbers.  In fact, it works with all &lt;span class=&quot;math-container&quot;&gt;\$n&amp;gt;1\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$n\bmod2\ne0\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The steps mentioned above can be summed up in this generalization for an &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; power:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Step 1) Take the digit in the one's place in the input.  Compare it to the one's place digit of the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th powers of &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$10\$&lt;/span&gt;, then use the corresponding digit.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Step 2) Remove all digits of the input less than &lt;span class=&quot;math-container&quot;&gt;\$10^n\$&lt;/span&gt;.  Compare the resulting number to the perfect powers definied in &lt;em&gt;Step 1&lt;/em&gt;.  Use the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th root of the largest perfect power less than said number.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Step 3) Multiply the number from &lt;em&gt;Step 2&lt;/em&gt; by 10 then add the number from &lt;em&gt;Step 1&lt;/em&gt;.  This will be the final result.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given two positive integers &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt;, return the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th root of &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Two positive integers &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt; is guaranteed to be a perfect &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th power of an integer.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is guaranteed to be odd and greater than &lt;span class=&quot;math-container&quot;&gt;\$2\$&lt;/span&gt;.  (This method doesn't work if &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is even.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th root of &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the fewer bytes, the better!&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;Standard I/O&lt;/a&gt; rules apply.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The output &lt;strong&gt;&lt;em&gt;must&lt;/em&gt;&lt;/strong&gt; be calculated using the aforementioned method.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No builtins allowed that already calculate this.  A prime example being TI-BASIC's &lt;a href=&quot;http://tibasicdev.wikidot.com/xroot&quot; rel=&quot;nofollow noreferrer&quot;&gt;x√ command&lt;/a&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="85765" LastEditorUserId="85765" LastEditDate="2019-05-05T20:21:13.320" LastActivityDate="2019-05-05T20:21:13.320" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="17642" PostTypeId="2" ParentId="17612" CreationDate="2019-05-05T11:11:22.620" Score="-1" Body="&lt;p&gt;I agree with the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17615/20283&quot;&gt;answer suggesting &quot;Code golf and a subtitle&quot;&lt;/a&gt; but it's difficult to tell whether people are voting for that general concept, or for the specific example of a subtitle given there.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd like to see a subtitle but I'd prefer this one:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Code golf&lt;/h1&gt;&#xA;  &#xA;  &lt;p&gt;and other code contests&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2019-05-05T11:11:22.620" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17643" PostTypeId="2" ParentId="17612" CreationDate="2019-05-05T18:31:28.010" Score="15" Body="&lt;p&gt;This is golfing &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17642/20260&quot;&gt;trichoplax's subtitle&lt;/a&gt;, also as a specific proposal to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17615/20260&quot;&gt;ais523's idea&lt;/a&gt; to have a subtitle in the wordmark.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;  &#xA;  &amp;amp; coding contests&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The &quot;other&quot; is omitted to make the text snappier. While, yes, technically code golf is a subset of coding contests, I think people will understand this and we don't need to spend words in the logo to address it.&lt;/li&gt;&#xA;&lt;li&gt;The ampersand &lt;code&gt;&amp;amp;&lt;/code&gt; is shorter than &lt;code&gt;and&lt;/code&gt;. It's commonly used in site names, like &quot;Science Fiction &amp;amp; Fantasy&quot; and our current one.&lt;/li&gt;&#xA;&lt;li&gt;The second &quot;code&quot; is changed to &quot;coding&quot; to avoid having the word &quot;code&quot; twice. I like how &quot;coding contests&quot; matches in rhythm and alliterates -- I think the whole title sounds nice when read.&lt;/li&gt;&#xA;&lt;li&gt;The &quot;Golf&quot; is capitalized, as is in our current logo. The subtitle is not. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2019-05-08T01:28:29.943" LastActivityDate="2019-05-08T01:28:29.943" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17645" PostTypeId="2" ParentId="17612" CreationDate="2019-05-06T08:46:15.520" Score="4" Body="&lt;p&gt;Since other people are posting minor variations of existing answers, here is my take which is a combination of two previous answers:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;  &#xA;  &amp;amp; challenges&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;or alternatively:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;  &#xA;  &amp;amp; coding challenges&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;  &#xA;  &amp;amp; other challenges&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;First of all, I think &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17615/52210&quot;&gt;&lt;em&gt;@ais523_permanent_community_wiki&lt;/em&gt;'s suggestion of using a subtitle is great&lt;/a&gt;. We emphasize the term 'Code Golf' as our main title, and add a relevant sub-title below it. His answer already explains the reasoning behind it, which I can only agree with (and given the amount of upvotes in his answer, others agree with as well).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Second, I think we should get rid of the term 'programming', so new users are less likely to come to us thinking it's a Q&amp;amp;A. Although I've seen some answers use the term '&amp;amp; coding contests', I personally prefer &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17617/52210&quot;&gt;&lt;em&gt;@ConorO'Brien&lt;/em&gt;'s answer with 'Code Golf &amp;amp; challenges&lt;/a&gt;.&lt;br&gt;&#xA;The term 'challenges' is already a commonly accepted term in the PPCG community. When new users post a question that would belong on StackOverflow, we explain that PPCG is about programming &lt;strong&gt;&lt;em&gt;challenges&lt;/em&gt;&lt;/strong&gt; and we direct them to SO. When a new user posts a challenge that can be perfected, we direct them to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/52210&quot;&gt;Sandbox of Proposed &lt;strong&gt;&lt;em&gt;Challenges&lt;/em&gt;&lt;/strong&gt;&lt;/a&gt;. When we &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=challenge&quot;&gt;search for the term '&lt;strong&gt;&lt;em&gt;challenge&lt;/em&gt;&lt;/strong&gt;' we -currently- get 165 pages of results&lt;/a&gt;, whereas with &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=contest&quot;&gt;the term 'contest' we -currently- only get 11 pages of results&lt;/a&gt;. The only time I hear the term 'contest' is with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; challenges, which are rather off-topic in our current meta (unless it's a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;strong&gt;&lt;em&gt;challenge&lt;/em&gt;&lt;/strong&gt;). If we look at &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot;&gt;the newest [popularity-contest] &lt;strong&gt;&lt;em&gt;challenges&lt;/em&gt;&lt;/strong&gt;&lt;/a&gt; and select the first which isn't [cops-and-robbers] nor [closed], it would be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/154617/design-a-one-instruction-set-computer&quot;&gt;this one from the start of 2018&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, although 'contests' isn't a bad term either, my preference would go to '&lt;strong&gt;&lt;em&gt;challenges&lt;/em&gt;&lt;/strong&gt;' since it's already a commonly accepted term within our community.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;EDIT: In addition, as correctly pointed out by &lt;em&gt;@trichoplax&lt;/em&gt; in the comments below. The term 'contests' suggest a ranked system and a competition. Whereas the term 'challenge' suggests something to achieve. Although they are rather similar, I see one key differences: in 'contests' people compete against each other; whereas in 'challenges' one (or multiple people with each other) accomplishes an achievement.&lt;br&gt;&#xA;If we were really competing against each other, people would also rather post a shorter answer themselves in the same language, instead of suggesting a golf on an existing answer.&lt;br&gt;&#xA;I personally do these code-golf challenges for my own enjoyment, and whether I have the shortest answer in an 05AB1E answer, or the longest answer in a Java answer is irrelevant. Which is why, in combination that it already is a pretty common term within our community, I prefer the term 'challenges' over 'contests'.&lt;/p&gt;&#xA;" OwnerUserId="52210" LastEditorUserId="52210" LastEditDate="2019-05-06T13:43:34.403" LastActivityDate="2019-05-06T13:43:34.403" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="17647" PostTypeId="2" ParentId="2140" CreationDate="2019-05-07T04:18:56.540" Score="3" Body="&lt;h1&gt;Golf my Ada arrays&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Ada_(programming_language)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ada&lt;/a&gt; is a programming language that is not exactly known for its terseness.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, its array literal syntax can in theory allow for fairly terse array&#xA;specifications. Here is a simple EBNF description of the &lt;a href=&quot;https://www.adaic.org/resources/add_content/standards/05rm/html/RM-4-3-3.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;array literal&lt;/a&gt;&#xA;syntax (passable to &lt;a href=&quot;https://www.bottlecaps.de/rr/ui&quot; rel=&quot;nofollow noreferrer&quot;&gt;bottlecaps.de&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;array ::= positional_array | named_array&#xA;positional_array ::= expression ',' expression (',' expression)*&#xA;named_array ::= component_association (',' component_association)*&#xA;              | expression (',' expression)* ',' 'others' '=&amp;gt;' expression&#xA;component_association ::= discrete_choice_list '=&amp;gt;' expression&#xA;discrete_choice_list ::= discrete_choice ('|' discrete_choice)*&#xA;discrete_choice ::= expression ('..' expression)?&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We will limit ourselves to 1-dimensional arrays of integers for simplicity. This&#xA;means that we will use only integers for the expression values. Perhaps in&#xA;a future challenge we could try something more advanced (like declaring&#xA;variables and multidimensional arrays). &lt;em&gt;You do &lt;strong&gt;not&lt;/strong&gt; have to golf the integer&#xA;literals&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The goal of this challenge is to output the shortest byte-count Ada array&#xA;literal for a given input array. Note that Ada arrays can start from whatever&#xA;index is desired, so you can pick what you wish the starting index to be as long&#xA;as each value is sequential. In this example I choose to start at 1, which is&#xA;idiomatic for Ada, however you can choose to start at any other integer.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your input will consist of a list of integers, in whatever form is convenient.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your output will be a string of text representing the shortest valid Ada array literal that represents the list of input integers. You may use any starting index you wish on this array, but your choice (whatever it is) must be specified in your answer (the starting index may also be dynamic). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do not modify the representation of the input integers, keep them in decimal format. This challenge does not cover golfing of integer values.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Here are some examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Simple: [1, 2, 3] -&amp;gt; (1,2,3)&#xA;Range: [1, 1, 1, 1, 1, 1, 1,] -&amp;gt; (1..7=&amp;gt;1)&#xA;Others: [1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1] -&amp;gt; (6=&amp;gt;2,others=&amp;gt;1)&#xA;Multiple Ranges: [1,1,1,1,1,2,2,2,2,2,1,1,1,1,1,2,2,2,2,2,1,1,1,1,1] -&amp;gt; (6..10|16..20=&amp;gt;2,others=&amp;gt;1)&#xA;Tiny Ranges: [1,1,2,2,1,1,1,1,1] -&amp;gt; (3|4=&amp;gt;2,others=&amp;gt;1)&#xA;Far Range: [[1]*5, [2]*100, [3]*5] -&amp;gt; (1..5=&amp;gt;1,6..105=&amp;gt;2,others=&amp;gt;3)&#xA;Alternation: [1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2] -&amp;gt; (1|3|5|7|9|11|13|15|17=&amp;gt;1,others=&amp;gt;2)&#xA;Big Number: [1234567890,1,1234567890] -&amp;gt; (2=&amp;gt;1,1|3=&amp;gt;1234567890)&#xA;Big-ish Number: [1234567,1,1234567] -&amp;gt; (1234567,1,1234567)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Minimum Requirements&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Support at least 100 numbers and inputs of at least 256 numbers in length.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Produce the correct result for all such inputs (including putting 'others' at&#xA;the end)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Terminate (preferably on TIO) for each of the above inputs in under a minute.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Reference Implementation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##xRltb5tG@Du/4uQPtVFtFLdbt8axJeK@WUvaKu32FVFzdtAIWHAsjrT/nj13x8G9glO1GpEcOJ739zviJJ7t85g83qfkFoVJHHzFRxJtPi28dmVd3N3FeRJdpTlWlnMSw1JZBZs8wbs0TwmOPpUJLnESXceHSgL@Qso031fBn/m3ogboZOF5h7LY4qQuMboGOiitHhFc5OGA0SYnUViW8QOsopjdTGAN73GJyjjfY3Sx8lGxQ80iUKO4sxkKAR59K/K6miJyC9h1hSu4w4gxrigSfUrzQ00a0sCcLhU1gTVGaFfnW5IWOXpfZLtGEhCAopx3wvmoxKQuc8S1A1kZskKAAm/uYpB4siH4jqNTkXuQ6cVxztG2yCsS50SAnS8FgbFE1l@0yN/wPs0VUukOCVD6b/wuLSvioyUawx8orkLTq5HMxELP0RwFAX8zvoqBzkLBxlmFe8lp4HkC4nVr9Lm1WONUKSgSfNTtVOJtUSYGS4iELyQuCWj5DgKzukWzFarAgBl2w64k2AIMU1YGLAOcCrjzLv50rbhckgpSRIAaRkzAmhkRaGI4EuADoRl7aESx@lELPo7o6w5Tya6GyY64cUb9hFT5ZhA4T5ARPUOjf0fwq7/m5PzhoHPTDYIewr7NZes4j65xSWGv8A78f5Pub4nht8uiyHCcm46jSI1VLpYcWdiFJhQUVwWcA7TwDLsDt0p4gnQifTTZGmet2rJyDeVw0kk8lcXxpwpuI5SMHB8bZP5uqmirWFfkdLqFAt2V@c9FlZL0H6zXeRDekU2UgJlPdHUwo7ZxhVmYjq9wvodelZopfw9Ri86okqPR1P52zk2g5zX7bcqt70DlqQT4xmsexL00RZa4cA3LSNhtKWfa00puj/0baNFbt2U7B/Z0oF1RopC2Wcbshjk2K4qDITcFvDwFsCmHIboAeMgfVlvkPOXqhv4U8btLsJa1/mhNSqjrhGOm1W0JdgxpifMdvhBXj3DPTuAYCqddnsKsoW1x9MKKpzdjeZ06wWxyfNWz9XpgprZ1blhbhPGML/I4i25wVWdEHpVck9ZPTWTyw9OY9Cfx1JXELtucnsgdBfs0OZrQbmjjQ8ddJp0/kugd4u3fVJO/4qzGES9QdNinPsnx/YlbA819f@CH6CvtB10rUQ39NsN3GKzYAfEyZIsnWbLG6sAStNdFDuBnYAxvjHFu38R0d1FrUMONdsyvRWQgT8AXWm5@qXe79PgT@H@ss8yQQOW9tplsXZcVFGkIHHgMWAD27T3ub9PMjJXgQ1xFjUvRZO3ba3yCt1lcYmteUORI7JHkrZHS85zl0RBIEsZSHU29pB4kibJsR@P@XmN3SXg40ELZ33p4QExlrpChy9VoqBl0JchQHrKPKc4rkas72IbsH6AQz7D/QyF3uzMX1zS6DD4f8ZGFzEmd0RHON6z8RIy2HMveyWaGUiIKCDemYzAYxOaxpWljj31F6on8xFsQNdfYHy8855jVYRjWUwcHo5zLzQ32JJWjsls99vbuQB7orUTkqoAxsyL91c70fSEqWCduT8XkQKox6X6ZNlkxsyxte@TGYLxNy4MEw2zOcpwZoyOoeG1313PCkwfyDRvIGZpjIndVaoitMEnkuYNvQsGekw0MvyeFGliJuVlMFVWnSt9Mz3Fu8CGLt5L2MHPzN23Fl4g9ayS2VAxn@ePUNnmFS6KwmbBhsiHo28dqvf4Ywa/VEVaGOEet9X5vo3W5jo/rSbfjo5zF5ugJ7dPuU8U5koBTwdfXimcTCHlBBnRsktlHELjUZ47uow0KgqvIxNUpSG4rCCEEPd8g5wzbthgt0foJMeN9T7OyBNjTbOwqVt1uoqe0sOr3nQZFK/TK5O6IqgZZZORkPkVnvu/3iGZLCkY86jmWt2w7GM7Q2bxEWGh3IVlQrPUd1EskTj@OtznJcSbPH@iL7nvI4tFrjw@jpqyLvRs1x3zhderSoxrtS1IQlvua7enWMInQc@czVUeFcvfVoxk5nOTAv8K3il@VymdzsPi803lU@hwWvMek@QCmHoAeYfPEvw9JxxWWoiNrA5t1@fG5OgXM2BGvO2TwMSX80EFBu6AW18/Shlu3rsVEkwzEUSYN2rqthYufwIj2Zzt/UQ5Mxmdjaofx67Hr0KStZrdxGW8JuB4iVmnXM/0dELUc0Kh8Q8oQzV@8/OXXV7/9/vpsCP5ShR8CXyvgQ9BvZOgh4LcS8BDsuw52CPR9CzoE@UFADgFuGsABuPbQDOqxawulb2BEPn6ueT6iifyJVopkrcB3FYHTpXf0s/PiEfTx5vzi/1/I9/TS7jz6oMP85OslvTwQTfszlrxwHnpv5m8873H@Hw&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Ada (GNAT) – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This implementation uses the input as its array, with each character being&#xA;a number. Capital letters are special constants for large values. The program&#xA;argument is the 'start index' to use.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &quot;code&quot; section in the TIO link is a correct solution to the problem, while the &quot;header&quot; and &quot;footer&quot; implement the test structure.&lt;/p&gt;&#xA;" OwnerUserId="42489" LastEditorUserId="42489" LastEditDate="2019-05-09T14:51:02.437" LastActivityDate="2019-05-09T14:51:02.437" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17649" PostTypeId="2" ParentId="2140" CreationDate="2019-05-07T20:25:41.873" Score="0" Body="&lt;h1&gt;Who's serving in table tennis?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Table tennis, also known as ping pong, is a well-known game in which players hit a ball back and forth across a table. One player serves the ball twice, and each time the ball is served, either player can score a point. Once the first player serves the ball twice, the second player gets to serve twice. Every two serves, the player which serves the ball switches. The game ends when one player has a score of 11 or more points and is two or more points higher than the other player.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to take the current score as input, and output a value depending on if player 1 should serve, player 2 should serve, or the game is over.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: The score of the first player to serve followed by the score of the other player. This can be as separate values or in a list, or another convenient data type.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: A distinct value for each possible case of output. For the test cases, I will use &lt;code&gt;1&lt;/code&gt; to represent the player who serves first, &lt;code&gt;2&lt;/code&gt; to represent the other player, and &lt;code&gt;0&lt;/code&gt; to represent that the game is over.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test cases:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;player1score, player2score -&amp;gt; output&#xA;&#xA;2, 0    -&amp;gt;  2&#xA;0, 0    -&amp;gt;  1&#xA;11, 0   -&amp;gt;  0&#xA;4, 4    -&amp;gt;  1&#xA;3, 2    -&amp;gt;  1&#xA;6, 9    -&amp;gt;  2&#xA;81, 82  -&amp;gt;  2&#xA;0, 29   -&amp;gt;  0&#xA;16, 13  -&amp;gt;  0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="64159" LastActivityDate="2019-05-07T20:25:41.873" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17650" PostTypeId="1" CreationDate="2019-05-07T20:25:49.093" Score="25" ViewCount="941" Body="&lt;h1&gt;UPDATE: New site name chosen!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17725/heres-your-site-design-preview&quot;&gt;This site is now &quot;Code Golf &amp;amp; Coding Challenges&quot;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thank you all so much for participating in this discussion!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Following &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17612/what-should-this-site-be-called-now-that-its-getting-a-design/17615?noredirect=1#comment62963_17615&quot; title=&quot;@trichoplax As I commented on one of the other answers - if someone would like to take this discussion to a new question so that the votes may be more balanced, I think this is a good time for that. I can&amp;#39;t guarantee that we&amp;#39;ll go with this style but it looks good to me. What we really need to know is, if we do this, what should it say. I&amp;#39;ve got a personal favorite but I&amp;#39;m also... well, not a programmer.&quot;&gt;Catija's comment on the site name meta question&lt;/a&gt;, what subtitle would work best for our site name?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The current highest voted answer on that meta question suggests the site name be Code Golf, with a subtitle in smaller text. I upvoted that answer because I like the idea of a short title followed by a subtitle, but the example subtitle given is not my first choice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What alternatives are there? What are the reasons for choosing or avoiding them?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are a number of alternative subtitle suggestions but they are scattered across late answers and comments on the previous question, so they have little visibility and it's difficult to judge community sentiment without this separate discussion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please put only one subtitle per answer so that it's clear what's being voted on.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="78028" LastEditDate="2019-05-30T20:03:35.870" LastActivityDate="2019-05-30T20:03:35.870" Title="A subtitle for our site name" Tags="|discussion|site-name|" AnswerCount="16" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17651" PostTypeId="2" ParentId="17650" CreationDate="2019-05-07T21:06:18.863" Score="18" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17645/52210&quot;&gt;Copy of my answer here&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Since other people are posting minor variations of existing answers, here is my take which is a combination of two previous answers:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;&amp;amp; coding challenges&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;First of all, I think &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17615/52210&quot;&gt;&lt;em&gt;@ais523_permanent_community_wiki&lt;/em&gt;'s suggestion of using a subtitle is great&lt;/a&gt;. We emphasize the term 'Code Golf' as our main title, and add a relevant sub-title below it. His answer already explains the reasoning behind it, which I can only agree with (and given the amount of upvotes on his answer, others agree with as well).&lt;/p&gt;&#xA;&lt;p&gt;Second, I think we should get rid of the term 'programming', so new users are less likely to come to us thinking it's a Q&amp;amp;A. Although I've seen some answers use the term '&amp;amp; coding contests', I personally prefer &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17617/52210&quot;&gt;&lt;em&gt;@ConorO'Brien&lt;/em&gt;'s answer with 'Code Golf &amp;amp; challenges&lt;/a&gt;.&lt;br /&gt;&#xA;The term 'challenges' is already a commonly accepted term in the PPCG community. When new users post a question that would belong on StackOverflow, we explain that PPCG is about programming &lt;em&gt;&lt;strong&gt;challenges&lt;/strong&gt;&lt;/em&gt; and we direct them to SO. When a new user posts a challenge that can be perfected, we direct them to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/52210&quot;&gt;Sandbox of Proposed &lt;em&gt;&lt;strong&gt;Challenges&lt;/strong&gt;&lt;/em&gt;&lt;/a&gt;. When we &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=challenge&quot;&gt;search for the term '&lt;em&gt;&lt;strong&gt;challenge&lt;/strong&gt;&lt;/em&gt;' we -currently- get 165 pages of results&lt;/a&gt;, whereas with &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=contest&quot;&gt;the term 'contest' we -currently- only get 11 pages of results&lt;/a&gt;. The only time I hear the term 'contest' is with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; challenges, which are rather off-topic in our current meta (unless it's a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;em&gt;&lt;strong&gt;challenge&lt;/strong&gt;&lt;/em&gt;). If we look at &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot;&gt;the newest [popularity-contest] &lt;em&gt;&lt;strong&gt;challenges&lt;/strong&gt;&lt;/em&gt;&lt;/a&gt; and select the first which isn't [cops-and-robbers] nor [closed], it would be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/154617/design-a-one-instruction-set-computer&quot;&gt;this one from the start of 2018&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;So, although 'contests' isn't a bad term either, my preference would go to '&lt;em&gt;&lt;strong&gt;challenges&lt;/strong&gt;&lt;/em&gt;' since it's already a commonly accepted term within our community.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;EDIT: In addition, as correctly pointed out by &lt;em&gt;@trichoplax&lt;/em&gt; in the comments below. The term 'contests' suggest a ranked system and a competition. Whereas the term 'challenge' suggests something to achieve. Although they are rather similar, I see one key differences: in 'contests' people compete against each other; whereas in 'challenges' one (or multiple people with each other) accomplishes an achievement.&lt;br /&gt;&#xA;If we were really competing against each other, people would also rather post a shorter answer themselves in the same language, instead of suggesting a golf on an existing answer.&lt;br /&gt;&#xA;I personally do these code-golf challenges for my own enjoyment, and whether I have the shortest answer in an 05AB1E answer, or the longest answer in a Java answer is irrelevant. Which is why, in combination that it already is a pretty common term within our community, I prefer the term 'challenges' over 'contests'.&lt;/p&gt;&#xA;&lt;p&gt;EDIT 2: I will also quote's &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17612/what-should-this-site-be-called-now-that-its-getting-a-design/17615?noredirect=1#comment62978_17615&quot;&gt;&lt;em&gt;@Catija♦&lt;/em&gt;'s comment&lt;/a&gt;, with the preference of 'coding challenges' as well from a non-programming point of view:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Since you ask, my personal preference of the ones I've seen so far is to use &amp;quot;&amp;amp; coding challenges&amp;quot;. It's not really long, which is nice. For me, &amp;quot;contests&amp;quot; implies a prize... you enter a contest to win something and here, all you're getting is votes. When we have a &amp;quot;contest&amp;quot; on the network, that's usually coupled with some physical prize, so &amp;quot;contests&amp;quot; seems like the wrong message. The real content here (from what I see) are challenges - even code golfing itself is a challenge - where the goal is to make the code as short as possible.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="52210" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-05-14T03:59:43.013" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="17652" PostTypeId="2" ParentId="17650" CreationDate="2019-05-07T21:07:20.303" Score="-8" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17643/52210&quot;&gt;&lt;em&gt;@xnor&lt;/em&gt;'s suggestion here&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;This is golfing &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17642/20260&quot;&gt;trichoplax's subtitle&lt;/a&gt;, also as a specific proposal to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17615/20260&quot;&gt;ais523's idea&lt;/a&gt; to have a subtitle in the wordmark.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;&amp;amp; coding contests&#xA;&lt;/blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The &amp;quot;other&amp;quot; is omitted to make the text snappier. While, yes, technically code golf is a subset of coding contests, I think people will understand this and we don't need to spend words in the logo to address it.&lt;/li&gt;&#xA;&lt;li&gt;The ampersand &lt;code&gt;&amp;amp;&lt;/code&gt; is shorter than &lt;code&gt;and&lt;/code&gt;. It's commonly used in site names, like &amp;quot;Science Fiction &amp;amp; Fantasy&amp;quot; and our current one.&lt;/li&gt;&#xA;&lt;li&gt;The second &amp;quot;code&amp;quot; is changed to &amp;quot;coding&amp;quot; to avoid having the word &amp;quot;code&amp;quot; twice. I like how &amp;quot;coding contests&amp;quot; matches in rhythm and alliterates -- I think the whole title sounds nice when read.&lt;/li&gt;&#xA;&lt;li&gt;The &amp;quot;Golf&amp;quot; is capitalized, as is in our current logo. The subtitle is not.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="52210" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-05-08T01:28:19.113" CommentCount="0" CommunityOwnedDate="2019-05-07T21:07:20.303" ContentLicense="CC BY-SA 4.0" />
  <row Id="17653" PostTypeId="2" ParentId="17650" CreationDate="2019-05-07T21:12:09.567" Score="14" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17615/52210&quot;&gt;@ais523's original suggestion here&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;My best idea so far is&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;and other programming challenges&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Admittedly, CGAOPC is pretty terrible as an acronym, so the site's title would still have to be &amp;quot;Code Golf&amp;quot;, but I think that'd look fairly good on a wordmark and make it clear what the site is about. Code Golf works fine as a name within Stack Exchange; it's only outside it that the name has trouble referring to a particular site (just like, say, &lt;a href=&quot;http://softwareengineering.stackexchange.com&quot;&gt;softwareengineering.stackexchange.com&lt;/a&gt; has &amp;quot;Software Engineering&amp;quot; as its wordmark, but is named &amp;quot;Software Engineering Stack Exchange&amp;quot; in its &amp;lt;title&amp;gt; as &amp;quot;Software Engineering&amp;quot; would be too ambiguous as the name of a website).&lt;/p&gt;&#xA;" OwnerUserId="52210" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-05-14T17:56:00.577" CommentCount="0" CommunityOwnedDate="2019-05-07T21:12:09.567" ContentLicense="CC BY-SA 4.0" />
  <row Id="17654" PostTypeId="2" ParentId="17650" CreationDate="2019-05-07T21:27:37.720" Score="2" Body="&lt;p&gt;Just a variant of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17651/43319&quot;&gt;this&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;  &#xA;  &amp;amp; challenges&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;since &lt;em&gt;code&lt;/em&gt; and &lt;em&gt;coding&lt;/em&gt; really is the same.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2019-05-07T21:27:37.720" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17655" PostTypeId="2" ParentId="17650" CreationDate="2019-05-07T21:28:45.523" Score="-3" Body="&lt;p&gt;Just a variant of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17652/43319&quot;&gt;this&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;  &#xA;  &amp;amp; contests&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;since &lt;em&gt;code&lt;/em&gt; and &lt;em&gt;coding&lt;/em&gt; really is the same.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2019-05-07T21:28:45.523" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17656" PostTypeId="2" ParentId="17650" CreationDate="2019-05-07T21:31:05.443" Score="18" Body="&lt;p&gt;In order to preserve our famous acronym PPCG, how about a supertitle instead of a subtitle?&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  Programming Puzzles &amp;amp;&#xA;  &#xA;  &lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Yes, it has all the downsides of the current name, but at least it emphasises code golf, while avoiding an acronym change,&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2019-05-07T21:31:05.443" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17657" PostTypeId="2" ParentId="17650" CreationDate="2019-05-07T21:33:53.410" Score="-4" Body="&lt;p&gt;Just a variant of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17652/43319&quot;&gt;this&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;  &#xA;  &amp;amp; other contests&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;since &lt;em&gt;code&lt;/em&gt; and &lt;em&gt;coding&lt;/em&gt; really is the same, there's room to restore &lt;em&gt;other&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2019-05-07T21:33:53.410" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17658" PostTypeId="2" ParentId="17650" CreationDate="2019-05-07T21:34:56.750" Score="4" Body="&lt;p&gt;Just a variant of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17651/43319&quot;&gt;this&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;  &#xA;  &amp;amp; other challenges&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;since &lt;em&gt;code&lt;/em&gt; and &lt;em&gt;coding&lt;/em&gt; really is the same, there's room for &lt;em&gt;other&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2019-05-07T21:34:56.750" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17660" PostTypeId="2" ParentId="17650" CreationDate="2019-05-08T01:40:06.850" Score="-10" Body="&lt;blockquote&gt;&#xA;  &lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;  &#xA;  &amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; &amp;amp; contests&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;A variant of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17655/20260&quot;&gt;this&lt;/a&gt; that indents the subtitle to suggest that &quot;code&quot; applies to &quot;contests&quot; as well. This avoids repeating the word &quot;code&quot;/&quot;coding&quot; like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17652/20260&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(The &quot;contests&quot; is meant to line up with &quot;Golf&quot; by their left edges; it may show differently in your browser. In any case, the layout is up to the designer, and anything visually suggesting the same hierarchy would work.)&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2019-05-08T01:55:15.980" LastActivityDate="2019-05-08T01:55:15.980" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17661" PostTypeId="2" ParentId="17650" CreationDate="2019-05-08T01:43:14.813" Score="-2" Body="&lt;blockquote&gt;&#xA;  &lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;  &#xA;  &amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; &amp;amp; challenges&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;A variant of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17651/20260&quot;&gt;this&lt;/a&gt; that indents the subtitle to suggest that &quot;code&quot; applies to &quot;challenges&quot; as well. This avoids repeating the word &quot;code&quot;/&quot;coding&quot; like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17651/20260&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(The &quot;challenges&quot; is meant to line up with &quot;Golf&quot; by their left edges; it may show differently in your browser. In any case, the layout is up to the designer, and anything visually suggesting the same hierarchy would work.)&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2019-05-08T01:54:50.737" LastActivityDate="2019-05-08T01:54:50.737" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17662" PostTypeId="2" ParentId="17650" CreationDate="2019-05-08T15:38:34.490" Score="-3" Body="&lt;blockquote&gt;&#xA;&lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;&amp;amp; competitive programming&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-05-08T15:38:34.490" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17663" PostTypeId="2" ParentId="2140" CreationDate="2019-05-08T16:50:46.677" Score="0" Body="&lt;h1&gt;Print the Golfican sequence&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The Golfican sequence is a sequence of integers, &lt;span class=&quot;math-container&quot;&gt;\$u\$&lt;/span&gt;, defined as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is a power of &lt;span class=&quot;math-container&quot;&gt;\$2\$&lt;/span&gt;, then &lt;span class=&quot;math-container&quot;&gt;\$u_n=\log_2n+1\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; in &lt;em&gt;not&lt;/em&gt; a power of &lt;span class=&quot;math-container&quot;&gt;\$2\$&lt;/span&gt;, then &lt;span class=&quot;math-container&quot;&gt;\$u_n=u_p\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt; is the number of numbers from &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; inclusive which are not powers of &lt;span class=&quot;math-container&quot;&gt;\$2\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So, the first numbers in this sequence are &lt;span class=&quot;math-container&quot;&gt;\$1,2,1,3,2,1,3,4\$&lt;/span&gt; and so on. Your job is to write a program which takes a number, &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;, as input, and outputs &lt;span class=&quot;math-container&quot;&gt;\$u_x\$&lt;/span&gt;. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;I couldn't find a corresponding OEIS sequence for this. Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="75524" LastEditorUserId="75524" LastEditDate="2019-05-15T22:29:14.023" LastActivityDate="2019-05-15T22:29:14.023" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17665" PostTypeId="2" ParentId="17650" CreationDate="2019-05-08T22:01:09.243" Score="-6" Body="&lt;blockquote&gt;&#xA;  &lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;  &#xA;  &amp;amp; programming puzzles&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I don't see the word &quot;puzzles&quot; as a problem. I agree that &quot;challenges&quot; could be more suited to the site, but &quot;puzzles&quot; is close enough, and I have grown fond of our current name and would like something close to it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I like my proposal more than &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17656/36398&quot;&gt;this other one&lt;/a&gt; because a supertitle would look weird in my opinion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The acronym would change from PPCG to CGPP, but hopefully they are similar enough to be recognizable. Besides, we seem to like &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=anagram&quot;&gt;anagrams&lt;/a&gt; around here...&lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2019-05-09T10:15:42.810" LastActivityDate="2019-05-09T10:15:42.810" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17666" PostTypeId="2" ParentId="2140" CreationDate="2019-05-09T04:22:57.347" Score="-3" Body="&lt;h1&gt;Output an alphabet suite&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A successor to the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/183248/output-the-%c5%8bar%c3%a2%c3%be-cr%c3%ae%c3%be-alphabet-song-without-using-many-letters&quot;&gt;ŋarâþ crîþ alphabet challenge&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Outputting the alphabet song with as few letters as possible was too easy, but what about outputting many of them?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to write as many programs as you can, &lt;strong&gt;with no two programs sharing any Unicode codepoints&lt;/strong&gt;, and each program outputting the names of the letters of the alphabet (or the glyphs of some other kind of phonetic script) used by a different language. For instance, one program can &lt;a href=&quot;https://en.wikipedia.org/wiki/English_alphabet&quot; rel=&quot;nofollow noreferrer&quot;&gt;output&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a bee cee dee e eff gee aitch i jay kay el em en o pee cue ar ess tee u vee double-u ex wye zed&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and another program can &lt;a href=&quot;https://en.wikipedia.org/wiki/Spanish_orthography#Alphabet_in_Spanish&quot; rel=&quot;nofollow noreferrer&quot;&gt;output&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a be ce de e efe ge hache i jota ka ele eme ene eñe o pe cu erre ese te u uve uve doble equis ye zeta&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Notes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For a given language, there will probably be some leeway in what you can output.&lt;/li&gt;&#xA;&lt;li&gt;Unlike in the previous challenge, you don't need to worry about any particular punctuation. You should at least separate each letter name with whitespace.&lt;/li&gt;&#xA;&lt;li&gt;You must output the names of the letters, not the letters themselves (so &lt;code&gt;A B C&lt;/code&gt;... is invalid), unless the letters are literally pronounced so in the language in question.&lt;/li&gt;&#xA;&lt;li&gt;If a language uses both capital and lowercase letters, then you may output the letter names in either case. If it uses only one of them, then you must output the alphabet in that case.&lt;/li&gt;&#xA;&lt;li&gt;You must use a different language's alphabet for each program, but you are allowed to use the same script in the context of different languages.&lt;/li&gt;&#xA;&lt;li&gt;Constructed languages are allowed, as long as they predate the challenge.&lt;/li&gt;&#xA;&lt;li&gt;You may use different programming languages for each program. Or the same.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://meta.codegolf.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;TODO:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;is the requirement against sharing any codepoints too strict?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="14109" LastEditorUserId="14109" LastEditDate="2019-05-10T05:53:28.710" LastActivityDate="2019-05-10T05:53:28.710" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17667" PostTypeId="2" ParentId="17630" CreationDate="2019-05-09T06:35:50.407" Score="1" Body="&lt;p&gt;We are a fairly small community for a global company to target, and those of us who compete in speed optimisation challenges are an even smaller group. I don't see any reason not to ask, but I'd be surprised if there was interest.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Would there be interest from the community in building such a tool ourselves? Would this inevitably cost a lot to run? Are there ways around this? Is it worth drawing up a set of minimal requirements for such a tool?&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2019-05-09T06:35:50.407" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17668" PostTypeId="2" ParentId="2140" CreationDate="2019-05-09T12:53:47.827" Score="0" Body="&lt;h1&gt;Alternating Digit Divisibility&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;TODO: Could use a better title..&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Challenge:&lt;/h2&gt;&#xA;&lt;p&gt;Given a list of at least two positive integers, output a pair of lists of digits. Both inner lists in the output are the digits which evenly divide each number in the alternating converted lists. The first converted list will be &lt;code&gt;[sum(digits(n)), n, sum(digits(n)), ...]&lt;/code&gt;, and the second will be &lt;code&gt;[n, sum(digits(n)), n, ...]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Step-by-step example:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Input: &lt;code&gt;[611,44,381]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Step 1: Convert it to the two alternating lists:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[sum([6,1,1]),44,sum([3,8,1])],    →    [[8,44,12],&#xA; [611,sum([4,4]),381]]                    [611,8,381]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Step 2: Check for each number which digits evenly divides it:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[[1,2,4,8],[1,2,4],[1,2,3,4,6]],&#xA; [[1],[1,2,4],[1,3]]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Step 3: Leave the digits present in each of the inner lists of lists, which is our output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[1,2,4],&#xA; [1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output: &lt;code&gt;[[1,2,4],[1]]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Challenge rules:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I/O is flexible. Input can be a list of strings, integers, 2D list of digits, etc. Output can be a list of lists of digits, a single flattened list of digits (i.e. &lt;code&gt;[1,2,4,1]&lt;/code&gt; in the example above), two lists printed on separated lines, each digit printed separated, a string or single (big) integer (i.e. &lt;code&gt;1241&lt;/code&gt;), etc. etc.&lt;/li&gt;&#xA;&lt;li&gt;You're allowed to swap the order of the alternation if it's convenient in your language of choice (i.e. the example above would output &lt;code&gt;[[1],[1,2,4]]&lt;/code&gt;/&lt;code&gt;[1,1,2,4]&lt;/code&gt;/&lt;code&gt;1124&lt;/code&gt;/etc. instead).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;0&lt;/code&gt; will never be in the output.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;General rules:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins.&lt;br /&gt;&#xA;Don't let code-golf languages discourage you from posting answers with non-codegolfing languages. Try to come up with an as short as possible answer for 'any' programming language.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet/2422#2422&quot;&gt;Standard rules apply&lt;/a&gt; for your answer with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods/&quot;&gt;default I/O rules&lt;/a&gt;, so you are allowed to use STDIN/STDOUT, functions/method with the proper parameters and return-type, full programs. Your call.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Default Loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;If possible, please add a link with a test for your code (i.e. &lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Also, adding an explanation for your answer is highly recommended.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input:                      Output:&#xA;&#xA;[611,044,381]               [[1,2,4]], [1]]&#xA;[200,32000,4000]            [[1,2], [1,5]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;TODO: More to come, including some larger ones&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="52210" LastEditorUserId="52210" LastEditDate="2021-09-22T09:00:21.573" LastActivityDate="2021-09-22T09:00:21.573" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17670" PostTypeId="1" AcceptedAnswerId="17671" CreationDate="2019-05-10T06:39:55.373" Score="3" ViewCount="124" Body="&lt;p&gt;On my code golf challenge, there are two tie 24 Bytes answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/a/173132/75908&quot;&gt;first one (Excel)&lt;/a&gt; is great because of the creativity put into it and the &lt;a href=&quot;https://codegolf.stackexchange.com/a/173118/75908&quot;&gt;second one (MATL)&lt;/a&gt; is just skill &lt;em&gt;I think&lt;/em&gt; and each one should win the &quot;prize&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;They both posted their answers on the same day - actually only 3,5 h apart from each other.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5097/should-there-be-defaults-for-tiebreakers-in-tag-wikis&quot;&gt;this question&lt;/a&gt; has asked the same question bevor, I can't get anything out of it as the only two answers (which are from the same user) are the complete opposite of each other.&lt;/p&gt;&#xA;" OwnerUserId="75908" LastActivityDate="2019-05-10T07:48:34.457" Title="Who wins code golf if there is a tie?" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17671" PostTypeId="2" ParentId="17670" CreationDate="2019-05-10T07:48:34.457" Score="8" Body="&lt;p&gt;Most people who post &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges &lt;em&gt;never&lt;/em&gt; accept an answer, so people are more likely to compete in the challenge. (I personally don't see how the accepted mark would change which challenges you do/don't look at though, tbh.. But I can understand the reasoning of not accepting any answers at all.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I myself accept answers after a few weeks however (and update when a shorter one is posted later on), so I can relate to your question. I have a few challenges where two or three answers have the same byte-count. Those I personally left without an accepted mark. And I sometimes check to see if anyone made a golf to their answer and there is now a single shortest one.&lt;br&gt;&#xA;Most people who accept answers on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges like us would accept the earliest one. So in the case of your challenge, the answers were posted at:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Excel: October 1st, 2018 at 18:51:27&lt;/li&gt;&#xA;&lt;li&gt;MATL: October 1st, 2018 at 15:38:39&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So in this case, the MATL answer would get the accepted check.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Alternatively, although I think your rep is currently to low for this feature, you could offer both answers a 50-bytes bounty to show your appreciation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Whatever you choose is up to you. The general consent is to not accept &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges, and if you do, to accept the shortest one (and earliest posted in case of a tie), as the accepted answer in your linked meta-post also states:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If no tie-breakers are specified, or all specified tie-breakers are exhausted, the &lt;strong&gt;earliest answer wins&lt;/strong&gt;. When determining which answer was earlier, the timestamp of the first valid edit which gave the current score counts.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="52210" LastActivityDate="2019-05-10T07:48:34.457" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17672" PostTypeId="2" ParentId="2140" CreationDate="2019-05-10T08:45:02.637" Score="2" Body="&lt;h1&gt;Reverse RegEx&lt;/h1&gt;&#xA;&lt;p&gt;Take a regex &lt;code&gt;a&lt;/code&gt; as input, output a regex &lt;code&gt;b&lt;/code&gt; such that, for each string &lt;code&gt;x&lt;/code&gt;, &lt;code&gt;x&lt;/code&gt; matches &lt;code&gt;a&lt;/code&gt; iff &lt;code&gt;x.reverse&lt;/code&gt; matches &lt;code&gt;b&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Here, regex need to support such symbols:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;.&lt;/code&gt;(any character expect &lt;code&gt;\n&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[abc]&lt;/code&gt;(any character in abc)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[^abc]&lt;/code&gt;(any character not in abc)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x?&lt;/code&gt;(appears 0-1 times), &lt;code&gt;x*&lt;/code&gt;(appears any amount of times), &lt;code&gt;x+&lt;/code&gt;(appears any positive amount of times)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x{n,m}&lt;/code&gt;(appears n to m times, &lt;code&gt;m&lt;/code&gt; can be omitted to mean infinite)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(abc)&lt;/code&gt; &lt;code&gt;(?:abc)&lt;/code&gt;(group block, &lt;code&gt;()&lt;/code&gt; can be referred while &lt;code&gt;(?:)&lt;/code&gt; can't)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;\n&lt;/code&gt;(refer to the latest match of n-th group)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;^&lt;/code&gt;(begin of string), &lt;code&gt;$&lt;/code&gt;(end of string) (or begin/end of line, see flags/m)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;|&lt;/code&gt;(or, choose one in some choices)&lt;/li&gt;&#xA;&lt;li&gt;Letters, &lt;code&gt;\n&lt;/code&gt;(this &lt;code&gt;n&lt;/code&gt; is char rather than variable, line-feed)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You need to handle flags &lt;code&gt;i&lt;/code&gt;(ignore upper/lower case) and &lt;code&gt;m&lt;/code&gt;(multiline, &lt;code&gt;^&lt;/code&gt; and &lt;code&gt;$&lt;/code&gt; match begin/end of lines rather than string). You can also just pipe the flags and make the containment of regex work for all possible flags, aka. you can &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/23568/&quot;&gt;treat pipe free&lt;/a&gt;. (They refuse to allow or disallow)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Sample Input    Sample Output&#xA;/abcd/          /dcba/&#xA;/[abc]/         /a|c|b/&#xA;/[^abc]/        /[^abc]/&#xA;/(.)abc\1$/     /^(.)cba\1/&#xA;/$1/            /10% of $10/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Shortest code win&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2021-06-23T00:48:16.877" LastActivityDate="2021-06-23T00:48:16.877" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="17673" PostTypeId="2" ParentId="17302" CreationDate="2019-05-10T12:56:21.997" Score="3" Body="&lt;p&gt;&lt;a href=&quot;https://jellyballs.github.io&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://jellyballs.github.io/images/jellyballs.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="86940" LastEditorUserId="86940" LastEditDate="2019-05-20T00:43:37.050" LastActivityDate="2019-05-20T00:43:37.050" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17675" PostTypeId="2" ParentId="2140" CreationDate="2019-05-11T08:42:53.273" Score="0" Body="&lt;h1&gt;Help the library sort books&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/natural-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;natural-language&amp;#39;&quot; rel=&quot;tag&quot;&gt;natural-language&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A library needs to sort its books, located in separate sections by language. Of course, each language has its own rule for collating strings, so your method should handle that ability.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Most languages will want to treat titles case-insensitively, but unfortunately, the library has a section of Klingon books. And Klingon's romanisation, in case you don't already know, is case-sensitive. As a result, you need to give a way to have the sorter treat two given characters as the same.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some of the titles also contain numbers, and you need to deal with those as well. Fortunately, the friendly people at the library have written some functions for you to deal with that, so all you have to do is take in a handle to a function as one of your inputs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Your challenge:&lt;/strong&gt; Sort a list of book titles, given a collating sequence and a function handle that converts a number to its string representation in the respective language.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The collating sequence is a list of lists of strings. Given two strings &lt;em&gt;A&lt;/em&gt; and &lt;em&gt;B&lt;/em&gt; that appear respectively in the entries at indices &lt;em&gt;i&lt;/em&gt; and &lt;em&gt;j&lt;/em&gt;, respectively:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;if &lt;em&gt;i&lt;/em&gt; &gt; &lt;em&gt;j&lt;/em&gt;, then &lt;em&gt;A&lt;/em&gt; should sort after &lt;em&gt;B&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;if &lt;em&gt;i&lt;/em&gt; = &lt;em&gt;j&lt;/em&gt;, then &lt;em&gt;A&lt;/em&gt; should sort the same as &lt;em&gt;B&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;In case some elements of the sequence have multiple characters, use the max-munch rule to tokenise the string: e.g. if both &lt;code&gt;l&lt;/code&gt; and &lt;code&gt;ll&lt;/code&gt; appear in the collating sequence, then &lt;code&gt;lll&lt;/code&gt; should be tokenised to &lt;code&gt;ll l&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Any string of digits should be parsed as a number and passed to the callback. Each such string should be replaced by the result.&lt;/li&gt;&#xA;&lt;li&gt;Any characters not appearing in the collating sequence should be ignored. If two strings differ only by such characters, then sort them however you like.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Assuming&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;english_letters = [[&quot;A&quot;, &quot;a&quot;], [&quot;B&quot;, &quot;b&quot;], [&quot;C&quot;, &quot;c&quot;], [&quot;D&quot;, &quot;d&quot;], [&quot;E&quot;, &quot;e&quot;], [&quot;F&quot;, &quot;f&quot;], [&quot;G&quot;, &quot;g&quot;], [&quot;H&quot;, &quot;h&quot;], [&quot;I&quot;, &quot;i&quot;], [&quot;J&quot;, &quot;j&quot;], [&quot;K&quot;, &quot;k&quot;], [&quot;L&quot;, &quot;l&quot;], [&quot;M&quot;, &quot;m&quot;], [&quot;N&quot;, &quot;n&quot;], [&quot;O&quot;, &quot;o&quot;], [&quot;P&quot;, &quot;p&quot;], [&quot;Q&quot;, &quot;q&quot;], [&quot;R&quot;, &quot;r&quot;], [&quot;S&quot;, &quot;s&quot;], [&quot;T&quot;, &quot;t&quot;], [&quot;U&quot;, &quot;u&quot;], [&quot;V&quot;, &quot;v&quot;], [&quot;W&quot;, &quot;w&quot;], [&quot;X&quot;, &quot;x&quot;], [&quot;Y&quot;, &quot;y&quot;], [&quot;Z&quot;, &quot;z&quot;]]&#xA;arka_letters = [[&quot;t&quot;], [&quot;k&quot;], [&quot;x&quot;], [&quot;s&quot;], [&quot;n&quot;], [&quot;v&quot;], [&quot;f&quot;], [&quot;m&quot;], [&quot;d&quot;], [&quot;g&quot;], [&quot;p&quot;], [&quot;b&quot;], [&quot;h&quot;], [&quot;y&quot;], [&quot;c&quot;], [&quot;r&quot;], [&quot;z&quot;], [&quot;j&quot;], [&quot;w&quot;], [&quot;l&quot;]]&#xA;function english_num_callback(num) {&#xA;  // convert a number to its representation in English&#xA;}&#xA;function arka_num_callback(num) { // handles nonnegative integers up to 9999&#xA;  if (num == 0) return &quot;yuu&quot;;&#xA;  let kot = 0 | (num / 1000);&#xA;  let gal = 0 | (num / 100 % 10);&#xA;  let on = 0 | (num / 10 % 10);&#xA;  let ko = num % 10;&#xA;  let digits = [&quot;yuu&quot;, &quot;ko&quot;, &quot;ta&quot;, &quot;vi&quot;, &quot;val&quot;, &quot;lin&quot;, &quot;kis&quot;, &quot;nol&quot;, &quot;ten&quot;, &quot;los&quot;];&#xA;  return (kot == 0 ? &quot;&quot; : digits[kot] + &quot;kot&quot;) +&#xA;    (gal == 0 ? &quot;&quot; : digits[gal] + &quot;gal&quot;) +&#xA;    (on == 0 ? &quot;&quot; : digits[on] + &quot;on&quot;) +&#xA;    (ko == 0 ? &quot;&quot; : digits[ko]);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&quot;Stack Exchange&quot;, &quot;BB94 Channel!&quot;, &quot;BB guns: all you wanted to know about them&quot;,&#xA;  &quot;carrots&quot;, &quot;A Grammar of Jbl&quot;, &quot;69&quot;], english_letters, english_num_callback =&amp;gt;&#xA;  [&quot;A Grammar of Jbl&quot;, &quot;BB guns: all you wanted to know about them&quot;, &quot;BB94 Channel!&quot;,&#xA;    &quot;carrots&quot;, &quot;69&quot;, &quot;Stack Exchange&quot;]&#xA;[&quot;melidia&quot;, &quot;diaklel&quot;, &quot;44 miiko&quot;, &quot;I Mess With the Librarians&quot;, &quot;an isk ris tu lei&quot;,&#xA;  &quot;lei e xion&quot;, &quot;xagrisren et xep!&quot;, &quot;on melkadren&quot;], arka_letters, arka_num_callback =&amp;gt;&#xA;  [&quot;xagrisren et xep!&quot;, &quot;44 miiko&quot;, &quot;melidia&quot;, &quot;diaklel&quot;, &quot;lei e xion&quot;,&#xA;    &quot;an isk ris tu lei&quot;, &quot;on melkadren&quot;, &quot;I Mess With the Librarians&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="14109" LastActivityDate="2019-05-11T08:42:53.273" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17676" PostTypeId="2" ParentId="2140" CreationDate="2019-05-11T10:14:28.137" Score="0" Body="&lt;h2&gt;Will it be red sauce, brown sauce, or no sauce at all?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Unfortunately Danny Baker's Sausage Sandwich game has been taken off the air again, and I'm suffering from withdrawal already. Please alleviate my symptoms by writing a program or function to play the Sausage Sandwich game.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You need to guess how the target prefers to eat a sausage sandwich, given one of the three sauce options. Given an input positive integer &lt;code&gt;n&lt;/code&gt;, then the following applies:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There is a uniformly &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; 1 in &lt;code&gt;n&lt;/code&gt; chance that the target chooses no sauce at all.&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, there are equal chances of red sauce or brown sauce.&lt;/li&gt;&#xA;&lt;li&gt;However, if &lt;code&gt;n&lt;/code&gt; is even, then there are &lt;code&gt;n-1&lt;/code&gt; remaining chances, which don't divide by 2. If you draw this &lt;code&gt;n-1&lt;/code&gt;th chance you should consistently (for a given &lt;code&gt;n&lt;/code&gt;) output the same answer. Please indicate how this is chosen in your answer.&lt;/li&gt;&#xA;&lt;li&gt;Output must consist of the phrases &quot;red sauce&quot;, &quot;brown sauce&quot;, or &quot;no sauce at all&quot;, in any of lower, sentence, title or upper case.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2019-05-11T10:14:28.137" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17682" PostTypeId="2" ParentId="17650" CreationDate="2019-05-12T19:22:52.057" Score="7" Body="&lt;h1&gt;Slight modification of the original suggestion&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;  &#xA;  and programming challenges&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This halfway between the current two most-upvoted suggestions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I prefer this over &quot;code golf and other programming challenges&quot; because it's more concise and, in my opinion, less awkward to say. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I prefer this over &quot;code golf and coding challenges&quot; because I think &quot;programming&quot; is more formal than &quot;coding.&quot; I consider &quot;coding&quot; to be more of a slang word and think that &quot;programming&quot; is better in more official contexts, like the subtitle of this website. The word &quot;programming&quot; is also already in the website name, so it is less of a change in that regard.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2019-05-12T19:22:52.057" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17683" PostTypeId="2" ParentId="17650" CreationDate="2019-05-13T20:44:21.160" Score="-8" Body="&lt;p&gt;As of about one week after OP was posted, there are three answers that are pretty much tied, but each with about half as many downvotes as they have upvotes:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17651/43319&quot;&gt;&lt;span class=&quot;math-container&quot;&gt;\$\frac{+20}{-9}\$&lt;/span&gt;&lt;/a&gt; Code Golf&lt;/h1&gt;&#xA;  &#xA;     &amp;amp; coding challenges&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;     Programming Puzzles &amp;amp;&#xA;  &#xA;  &lt;h1&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17656/43319&quot;&gt;&lt;span class=&quot;math-container&quot;&gt;\$\frac{+20}{-10}\$&lt;/span&gt;&lt;/a&gt; Code Golf&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17653/43319&quot;&gt;&lt;span class=&quot;math-container&quot;&gt;\$\frac{+17}{-8}\$&lt;/span&gt;&lt;/a&gt; Code Golf&lt;/h1&gt;&#xA;  &#xA;     and other programming challenges&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;So, how about a compromise?&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  Programming Puzzles,&#xA;  &#xA;  &lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;  &#xA;  &amp;amp; other coding challenges&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I think it can fit. Consider how tall the big letters are in ELL's banner:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/Ozg40.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Ozg40.png&quot; alt=&quot;ELL logo&quot;&gt;&lt;/a&gt;&lt;br&gt;&#xA;If we use vertically squished letters instead, maybe something like:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/H8rvS.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/H8rvS.png&quot; alt=&quot;Banner mockup&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2019-05-13T20:44:21.160" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17686" PostTypeId="2" ParentId="2140" CreationDate="2019-05-15T12:01:16.617" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/185852/sliding-retrieval&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="14710" LastEditorUserId="14710" LastEditDate="2019-05-20T13:53:01.190" LastActivityDate="2019-05-20T13:53:01.190" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17687" PostTypeId="2" ParentId="17650" CreationDate="2019-05-15T16:58:15.487" Score="0" Body="&lt;p&gt;I feel like I'm a bit late to suggest something, but anyways, how about..&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;  &#xA;  &amp;amp; code challenges&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is pretty much inspired by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17651/40638&quot;&gt;this answer&lt;/a&gt; but I personally didn't really like how there were two forms of the word Code, so instead of &quot;coding challenges&quot;, we use &quot;code challenges&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another option was to do &quot;Coding Golf and Coding Challenges&quot; but Kevin Cruijssen said it would be weird to change &quot;Code Golf&quot; since we are used to it and I agree.&lt;/p&gt;&#xA;" OwnerUserId="40638" LastActivityDate="2019-05-15T16:58:15.487" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17698" PostTypeId="2" ParentId="2140" CreationDate="2019-05-20T09:31:56.440" Score="3" Body="&lt;h1&gt;Print some very large numbers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Not sure if this has been done before. Write a program that takes in a scientific format number (as two inputs, a mantissa and an exponent), and outputs a decimal representation of that number (as a string). The trick is that this must go far beyond most languages number limits.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The mantissa will always be within 1 ≤ mantissa ≤ 10 or mantissa = 0.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The exponent will always be a 32-bit signed integer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1, 100 -&amp;gt; 10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000&#xA;&#xA;3.543235, 200 -&amp;gt; 354323500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000&#xA;&#xA;3.3333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333, 10 -&amp;gt; 33333333333.333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333&#xA;&#xA;5.3282, -71 -&amp;gt; 0.000000000000000000000000000000000000000000000000000000000000000000000053282&#xA;&#xA;0, 999999 -&amp;gt; 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="81572" LastEditorUserId="81572" LastEditDate="2019-05-21T01:29:06.440" LastActivityDate="2019-05-21T01:29:06.440" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17699" PostTypeId="1" AcceptedAnswerId="17700" CreationDate="2019-05-20T13:52:01.130" Score="6" ViewCount="224" Body="&lt;p&gt;why did they put this challenge on hold?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How could I have made it clearer?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Benjamin has N boxes in his garden with dimension xi&lt;em&gt;yi&lt;/em&gt;zi each. Because he does not want to let them out and get wet, he wants to put them in the warehouse with a capacity of V. To solve this problem, Benjamin bought a machine which, with the cost of 1 buck, gets a box and increases or decreases all its dimensions by one unit. The box will not change at all if the box change leads to some of its dimensions are zero or negative.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to help Benjamin put the boxes in his warehouse with the least possible cost, making the total box volume equal to V.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input Format&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first entry line will contain the integers N and V, the total number of Benjamin's boxes and the volume of the warehouse. The following N lines contain 3 integers xi, yi, zi, the original dimensions of the ith box.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output data&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The only line of output must contain the minimum cost which Benjamin will have to pay the machine, to convert the volume of his boxes to exactly V, or return -1, if this is not possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sample Input 1&lt;/p&gt;&#xA;&#xA;&lt;p&gt;4 9&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1 1 2&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1 1 2&lt;/p&gt;&#xA;&#xA;&lt;p&gt;1 1 1&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2 2 1&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sample Output 1&lt;/p&gt;&#xA;&#xA;&lt;p&gt;0&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sample Input 2&lt;/p&gt;&#xA;&#xA;&lt;p&gt;3 123&lt;/p&gt;&#xA;&#xA;&lt;p&gt;10 1 10&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2 5 6&lt;/p&gt;&#xA;&#xA;&lt;p&gt;5 3 3&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sample Output 2&lt;/p&gt;&#xA;&#xA;&lt;p&gt;3&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Explanation&lt;/p&gt;&#xA;&#xA;&lt;p&gt;observe that in the first sample input the volume of the boxes is already 2+2+1+4=9, so Benjamin does not have to change the boxes at all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moreover, observe that in the first box, the second boxes dimensions need to be reduced by 1 unit and the dimensions of the third box need to be reduced by 2 units. So the total volume will be 100+20+3=123.&lt;/p&gt;&#xA;" OwnerUserId="86582" LastActivityDate="2019-05-20T14:23:34.040" Title="what did I do wrong and how can I improve" Tags="|discussion|answers|new-users|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17700" PostTypeId="2" ParentId="17699" CreationDate="2019-05-20T14:23:34.040" Score="17" Body="&lt;p&gt;At a brief glance, some potential reasons are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This looks a lot like a homework question or a coding challenge taking from another site.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We don't help with homework&lt;/li&gt;&#xA;&lt;li&gt;Using a challenge from another site requires explicit permission&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The challenge has a fixed clunky I/O format specified&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This community heavily favors flexible I/O&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;When the winning condition is fastest-code you should specify how you will run it and on what specs, so that solutions can be optimized&lt;/li&gt;&#xA;&lt;li&gt;This community also dislikes language specific challenges, so unless there is a reason why it must be in &lt;code&gt;c++&lt;/code&gt;, consider opening it up for all languages to participate&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;We have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;sandbox&lt;/a&gt; where you can post challenge ideas and get help from the community, making it better suited to this site. Don't let this setback discourage you from posting challenges in the future. Leave them in the sandbox for a few days or more depending on how  active people are and what help you have received and I'm sure you can get some nice questions going.&lt;/p&gt;&#xA;" OwnerUserId="47066" LastActivityDate="2019-05-20T14:23:34.040" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17705" PostTypeId="1" CreationDate="2019-05-22T20:36:08.680" Score="-2" ViewCount="220" Body="&lt;p&gt;I recently posed a challenge about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/185842/output-digits-of-pi1-pi-forever&quot;&gt;computing a function of &lt;span class=&quot;math-container&quot;&gt;\$\pi\$&lt;/span&gt;&lt;/a&gt;. It was closed for being unclear and received a number of criticisms. One of the main ones I think was that banning built-ins for &lt;span class=&quot;math-container&quot;&gt;\$\pi\$&lt;/span&gt; is not clear as there are always other equivalent built-ins one hasn't thought of.&lt;/p&gt;&#xA;&lt;p&gt;Looking at old questions I see that banning built-ins for &lt;span class=&quot;math-container&quot;&gt;\$\pi\$&lt;/span&gt; is quite common however. Take for example:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/142830/output-with-the-same-number-of-digits-of-pi-as-the-length-of-the-code&quot;&gt;Output with the same number of digits of pi as the length of the code&lt;/a&gt; : &amp;quot;Built-ins to calculate pi cannot be used. This includes pi constants (e.g. math.pi in Python) and built-in functions that return either the value of pi, or the n-th digit of pi. This means that an algorithm which calculates pi, or the n-th digit of pi must be implemented in your answer.&amp;quot;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/47759/monte-carlo-estimator-of-pi&quot;&gt;Monte Carlo estimator of Pi&lt;/a&gt; : &amp;quot;No trig functions or Pi constants, must be a Monte Carlo approach.&amp;quot;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/506/calculate-500-digits-of-pi&quot;&gt;Calculate 500 digits of pi&lt;/a&gt; : &amp;quot;It cannot include &amp;quot;pi&amp;quot;, &amp;quot;math.pi&amp;quot; or similar pi constants, nor may it call a library function to calculate pi.&amp;quot;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;and so on.&lt;/p&gt;&#xA;&lt;h1&gt;Edit&lt;/h1&gt;&#xA;&lt;p&gt;I have now changed the question to make it easier.&lt;/p&gt;&#xA;" OwnerDisplayName="user9207" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-05-23T12:00:43.680" Title="Can we still ban built-ins for \$\pi\$?" Tags="|discussion|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17706" PostTypeId="2" ParentId="17705" CreationDate="2019-05-23T02:38:23.850" Score="8" Body="&lt;h1&gt;There are a few issues&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;One of them was the thing about banning built-ins for pi. On top of that, you also banned all trigonometric functions - sure, this is still reasonably well-defined and observable. However, you later also added that gamma was banned as well, after Luis Mendo mentioned that &lt;code&gt;gamma(0.5) ** 2&lt;/code&gt; can be used. How far from standard pi computational methods do you need to go before it's not disallowed by your rules? The current rules at any point are well-defined; however, as the rules are constantly changing, when will it stop?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Secondly, your output method is unusual, and forcing people to use that method doesn't actually make the challenge any more interesting, on top of making it impossible for some languages and adding an enormous penalty to others arbitrarily for no particular reason. Besides, with this method, you get arbitrary length precision error blocks (as mentioned by Stewie Griffin), which means that your output method actually doesn't even make sense given the computational requirement (as Shaggy brought up as well).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, since you require infinite output, you need to give some assumption basis such as infinite memory or time (though the latter is obvious) as Stewie mentioned. This one is less significant since usually code-golf problems allow you to consume as much memory as you want as long as the solution is theoretically valid given infinite resources.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, to address your comment, nobody is &lt;em&gt;hating&lt;/em&gt; on your challenge. To put it bluntly, if you can't write a clear challenge and it gets closed for being unclear, that's your own fault. Addressing close-voters as &quot;haters&quot; gets you nowhere in fixing your question and makes you look oversensitive and one who cannot take legitimate criticism. None of the comments are hating on either you or your post, all of them are asking legitimate questions or giving legitimate criticisms or suggestions regarding your question, which, for the reasons I've listed above, remain unclear.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2019-05-23T02:38:23.850" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17709" PostTypeId="2" ParentId="2140" CreationDate="2019-05-24T13:30:18.273" Score="1" Body="&lt;h1&gt;Given a position of a chess piece and another square, determine if the chess piece attacks that square&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input would be in the form  &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Qe4 c6&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Where the first term denotes the piece and its position and the second term is the square we're interested in.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Labels for pieces are:&lt;br&gt;&#xA;K - king&lt;br&gt;&#xA;Q - queen&lt;br&gt;&#xA;R - rook&lt;br&gt;&#xA;B - bishop&lt;br&gt;&#xA;N - knight&lt;br&gt;&#xA;P or empty - pawn  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;In fact, the input could be left to be decided by the programmer, to make them creative in coming up with the most efficient input method, for example any of these could be valid, if the programmer decides so:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Qe4, c6&lt;br&gt;&#xA;  [Qe4, c6]&lt;br&gt;&#xA;  Qe4c6&lt;br&gt;&#xA;  qe4-c6  &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Even the order could be reversed if that makes parsing easier. Basically the input could be left completely to the programmer's liberty. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;So in the above case the input&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Qe4 c6  &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;would give an output  &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;True&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Because the queen on e4 indeed attacks c6. Outputs like 1 or any other boolean outputs would also be allowed.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;An input like  &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Nc3 a3  &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;would produce  &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;False  &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;because a knight on c3 doesn't attack a square on a3.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Possible problems&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There are some invalid inputs possible, like:&lt;br&gt;&#xA;1. Wrong letter for a piece, like &quot;Te2&quot;&lt;br&gt;&#xA;2. The coordinates which don't exist, like &quot;k9&quot;&lt;br&gt;&#xA;3. The second square being the position of the piece itself, for example &quot;Qa3 a3&quot;  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should this be included in the rules or better not to not make it too complicated?&lt;/p&gt;&#xA;" OwnerUserId="86955" LastActivityDate="2019-05-24T13:30:18.273" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17711" PostTypeId="2" ParentId="2140" CreationDate="2019-05-26T07:38:17.570" Score="1" Body="&lt;h1&gt;Randomly produce a (name of a language) source file that is possibly a quine&lt;/h1&gt;&#xA;&lt;p&gt;Write code in &lt;strong&gt;any language&lt;/strong&gt; that randomly generate a &lt;strong&gt;(name of a language)&lt;/strong&gt; (Java?) source file, meeting the two criteria:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It must always (with probability 1) compile successfully in a (language) compiler and version of your choice.&lt;/li&gt;&#xA;&lt;li&gt;It must have non-zero probability to be a quine in (language).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You don't have to make it able to generate all possible programs, and the probability doesn't have to be uniform. The objective is to write a generator shorter than the shortest possible quine in (language) compressed. Technically your code could be deterministic and generate only one program, that is a quine. But it isn't supposed to be competitive.&lt;/p&gt;&#xA;&lt;p&gt;Your code must not have the potential to damage the computer. But it doesn't matter what the generated (language) program does when it is not the quine that qualifies your answer.&lt;/p&gt;&#xA;&lt;p&gt;(Restrictions about compiler flags to be added.)&lt;/p&gt;&#xA;&lt;p&gt;You could either use the built-in random functions and assume they generate true random numbers, or request random information from the input (details to be added). Your code only need to have probability 1 to terminate.&lt;/p&gt;&#xA;&lt;p&gt;Shortest code wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Possible rule&lt;/h3&gt;&#xA;&lt;p&gt;You may not call any (language) compiler or anything else that could check (language) syntax.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I was thinking about C++, but there are short patterns to execute any binary machine code. The language should also have a verbose structure, and not a too short quine.&lt;/p&gt;&#xA;&lt;p&gt;Candidates: Java, Haskell, Shakespeare Programming Language, Mornington Crescent, SQL, ferNANDo.&lt;/p&gt;&#xA;&lt;p&gt;Or: Generate a PNG file that is possibly this image. But that may depend to much on a PNG library, and the other part is trivial.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-05-27T02:55:58.410" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="17712" PostTypeId="2" ParentId="17650" CreationDate="2019-05-27T12:11:37.850" Score="-3" Body="&lt;p&gt;Do we need the &amp;quot;&amp;amp;&amp;quot; or &amp;quot;and&amp;quot;? How about&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;Programming Puzzles and Challenges&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;Coding Puzzles and Challenges&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Personally I prefer the first one but that's just my opinion.&lt;/p&gt;&#xA;" OwnerUserId="56555" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-05-27T12:11:37.850" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17715" PostTypeId="2" ParentId="2140" CreationDate="2019-05-28T21:08:36.453" Score="0" Body="&lt;h1&gt;Optimize Grocery Bagging&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;You've gone to the store and are at the checkout. Now since you want to be environmentally conscious (or are somewhere that charges for bags and want to save money), you've brought a few reusable bags and would like to minimize the number of plastic bags you use (There are no paper bags here).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each reusable bag can carry 5 kg (5,000 grams) of groceries and each plastic bag can carry 2.5 kg (2,500 grams) of groceries. You will be given a list of weights of groceries (in whole grams) and a number of reusable bags and your task is to output a configuration of bagging that requires the fewest number of plastic bags.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Input&lt;/strong&gt;: 1 reusable bag, groceries: [150, 500, 800, 1250, 2000, 300, 550, 400, 750, 900, 1000, 600]&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Output&lt;/strong&gt;: Reusable[2000, 1250, 1000, 750], Plastic[600, 900, 550, 150, 300], Plastic[500, 800, 400]&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;More TBD&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules and Assumptions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard rules and loopholes apply&lt;/li&gt;&#xA;&lt;li&gt;Any convenient input or output method is acceptable as long as which bags are reusable is unambiguous in the output (without calculating anything).&lt;/li&gt;&#xA;&lt;li&gt;You may assume that there are no groceries larger than 2.5 kg. (No jugs of milk)&lt;/li&gt;&#xA;&lt;li&gt;All groceries listed require a bag. Unbaggable groceries will not be listed. (No hypothetical 24-packs of toilet paper)&lt;/li&gt;&#xA;&lt;li&gt;Any grocery item can be bagged with any other. (No need to worry about bread and cans of beans being in the same bag)&lt;/li&gt;&#xA;&lt;li&gt;Groceries cannot be split into multiple bags.&lt;/li&gt;&#xA;&lt;li&gt;There is no double-bagging.&lt;/li&gt;&#xA;&lt;li&gt;Complexity doesn't matter. There may be inputs that would require computation past the heat death of the universe to complete.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Happy Golfing!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/51468/45613&quot;&gt;Related&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Sandbox&lt;/em&gt;: This could work as a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt; problem or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; due to the naive solution being in &lt;span class=&quot;math-container&quot;&gt;\$O(n!)\$&lt;/span&gt;. Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="45613" LastActivityDate="2019-05-28T21:08:36.453" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17716" PostTypeId="2" ParentId="2447" CreationDate="2019-05-28T21:36:22.830" Score="7" Body="&lt;h1&gt;Functions may generate different output via different exceptions if they could be caught using different code&lt;/h1&gt;&#xA;&lt;p&gt;For example, in C++, you could use &lt;code&gt;throw 1;&lt;/code&gt; and &lt;code&gt;throw true;&lt;/code&gt; to output two distinct values. They could be caught by &lt;code&gt;catch(int)&lt;/code&gt; and &lt;code&gt;catch(bool)&lt;/code&gt; in a &lt;code&gt;try&lt;/code&gt; block respectively. (In most other languages, you could only throw values in an exception class.)&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-05-28T22:02:14.493" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17717" PostTypeId="2" ParentId="2447" CreationDate="2019-05-28T21:40:51.857" Score="3" Body="&lt;h1&gt;Functions may take input from the output of a callback function&lt;/h1&gt;&#xA;&lt;p&gt;The callback function should be provided using a valid input method.&lt;/p&gt;&#xA;&lt;p&gt;Complementing&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11317/25180&quot;&gt;Functions may return a function that returns the result&lt;/a&gt; (outputted function may output)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8427/25180&quot;&gt;Functions may take multiple arguments via currying&lt;/a&gt; (outputted function may take input (and also output))&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11324/25180&quot;&gt;Functions may output by calling a callback function or event&lt;/a&gt; (inputted function may receive output)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-05-28T22:08:32.870" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17718" PostTypeId="2" ParentId="2447" CreationDate="2019-05-28T21:45:44.217" Score="5" Body="&lt;h1&gt;Functions may output via throwing the output value as an exception, if it could be caught, and read by the code catching the exception&lt;/h1&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-05-28T21:45:44.217" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17719" PostTypeId="2" ParentId="2140" CreationDate="2019-05-29T01:19:37.950" Score="0" Body="&lt;h1&gt;Beziér me a curve!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Task:&lt;/strong&gt; Create a program that will, given a number &lt;em&gt;N&lt;/em&gt;, create a Beziér curve with &lt;em&gt;N&lt;/em&gt; control points and output its equation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The definition of a Beziér curve is&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;B(t) = \sum_{i=0}^n{{n\choose i}(1-t)^{n-i}t^iP_i}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Practically, this means that for a quadratic Beziér cuve:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;B(2) = \sum_{i=0}^2{{2\choose i}(1-t)^{2-i}t^iP_i}\\&#xA;B(2) = {2\choose 0}(1-t)^2P_0 + {2\choose 1}(1-t)tP_1 + {2\choose 2}t^2P_2\\&#xA;B(2) = (t^2-2t+1)P_0 + 2(t^2-2t+1)P_1 + t^2P_2\\&#xA;B(2) = P_0t^2-2P_0t+P_0 + 2P_1t^2-4P_1t+2P_1 + P_2t^2&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;where &lt;span class=&quot;math-container&quot;&gt;\$P_0\$&lt;/span&gt; is the first control point, &lt;span class=&quot;math-container&quot;&gt;\$P_1\$&lt;/span&gt; is the second control point and &lt;span class=&quot;math-container&quot;&gt;\$P_2\$&lt;/span&gt; is the third control point.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that De Casteljau's algorithm may be useful.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input will be a number (string or number).&lt;/li&gt;&#xA;&lt;li&gt;The output will be a list of lists. Take an element &lt;span class=&quot;math-container&quot;&gt;\$l_n\$&lt;/span&gt; of the top-level list. The elements of &lt;span class=&quot;math-container&quot;&gt;\$l_n\$&lt;/span&gt; will be all the terms that, in the expanded form, are multiplied by &lt;span class=&quot;math-container&quot;&gt;\$P_n\$&lt;/span&gt;. &lt;code&gt;-1t&lt;/code&gt; and &lt;code&gt;t^1&lt;/code&gt;, as well as &lt;code&gt;t^0&lt;/code&gt; are all fine.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are not allowed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;2&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;  [&quot;t^2&quot;, &quot;-2t&quot;, &quot;1&quot;],&#xA;  [&quot;2t^2&quot;, &quot;-4t&quot;, &quot;2&quot;],&#xA;  [&quot;t^2&quot;]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;5&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;  [&quot;-t^5&quot;, &quot;5t^4&quot;, &quot;-10t^3&quot;, &quot;10t^2&quot;, &quot;-5t&quot;, &quot;1&quot;],&#xA;  [&quot;t^5&quot;, &quot;-4t^4&quot;, &quot;6t^3&quot;, &quot;-4t^2&quot;, &quot;t&quot;],&#xA;  [&quot;t^5&quot;, &quot;2t^4&quot;, &quot;t^3&quot;],&#xA;  [&quot;-t^5&quot;, &quot;t^4&quot;],&#xA;  [&quot;t^5&quot;]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The program with the shortest length wins. Be creative!&lt;/p&gt;&#xA;" OwnerUserId="86904" LastActivityDate="2019-05-29T01:19:37.950" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17720" PostTypeId="2" ParentId="2140" CreationDate="2019-05-29T07:59:36.930" Score="1" Body="&lt;h1&gt;Draw a regular prism&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The input is a single integer &lt;code&gt;i&lt;/code&gt; between 3 and 8.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The image of a regular prism with the two regular polygonal faces having &lt;code&gt;i&lt;/code&gt; edges each.  For example, if &lt;code&gt;i=3&lt;/code&gt; your code should draw a triangular prism using two equilateral triangles.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The diameter of the polygonal (i.e. triangular if &lt;code&gt;i=3&lt;/code&gt;) faces must be at least  200 pixels as should the distance between the regular faces.  You can show the image at any angle you like as long as at least two faces of the prism are visible, including one of the two regular polygonal faces.&lt;/p&gt;&#xA;&lt;p&gt;The edges of the prism that are visible should be in black and the edges that are not visible should be drawn with dotted black lines, a dotted line being a line where in at least 3 distinct, non-connected places (meaning separated by black) there's an absence of black color.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/AmF8Z.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/AmF8Z.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/MAVWM.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/MAVWM.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ae74k.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ae74k.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user9207" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-05-31T14:46:45.687" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17721" PostTypeId="2" ParentId="2140" CreationDate="2019-05-29T08:33:29.397" Score="2" Body="&lt;h1&gt;&lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-Chess KotH &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot;&gt;chess&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/board-game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;board-game&amp;#39;&quot; rel=&quot;tag&quot;&gt;board-game&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;Inspired by the challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/179747/n-movers-how-much-of-the-infinite-board-can-i-reach&quot;&gt;N-movers: How much of the infinite board can I reach?&lt;/a&gt;, I came up with an idea of applying the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-mover rules in chess.&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-Chess™ is a board game played on a 8x8 grid like the original chess. However, the pieces are very different from chess - they are named &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-movers (&lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; can be any natural number) and can only move by the rules set on them (see &lt;strong&gt;Rules: Pieces&lt;/strong&gt;).&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;h3&gt;Pieces&lt;/h3&gt;&#xA;&lt;p&gt;In &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-chess, a piece is called an &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-mover, where &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; denotes its possible movements. Specifically:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-mover can only move one step of Euclidean distance &lt;span class=&quot;math-container&quot;&gt;\$\sqrt n\$&lt;/span&gt; each time, i.e. for a move with &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; units horizontal and &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt; units vertical, &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt; must fulfill the equation &lt;span class=&quot;math-container&quot;&gt;\$x^2+y^2=n\$&lt;/span&gt; in order to be valid.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For example, a 5-mover can only move 1 unit in one direction and 2 units in the another at the same time; while a 25-mover can move 5 units in either direction, or 3 units in one direction and 4 units in the another at the same time.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;A piece can have at most 2 rules set at the same time. For a piece that can act as either an &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt;-mover or an &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-mover, we can call it an &lt;span class=&quot;math-container&quot;&gt;\$(m,n)\$&lt;/span&gt;-mover. An &lt;span class=&quot;math-container&quot;&gt;\$(m,n)\$&lt;/span&gt;-mover is allowed to move one step of Euclidean distance of either &lt;span class=&quot;math-container&quot;&gt;\$\sqrt m\$&lt;/span&gt; or &lt;span class=&quot;math-container&quot;&gt;\$\sqrt n\$&lt;/span&gt; or &lt;span class=&quot;math-container&quot;&gt;\$\sqrt{m+n}\$&lt;/span&gt;.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is allowed to have &lt;span class=&quot;math-container&quot;&gt;\$m=n\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Only pieces that has captured other pieces can have multiple rules (See &lt;strong&gt;Rules: Capture&lt;/strong&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;If more than 2 rules are set on a piece, only 2 rules can be reserved. You can choose which 2 rules to reserve.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Board&lt;/h3&gt;&#xA;&lt;p&gt;The chess is played on a 8x8 board. The initial setup is as follows:&#xA;&lt;img src=&quot;https://i.stack.imgur.com/4VHQS.png&quot; alt=&quot;Initial board setup&quot; title=&quot;Initial board setup&quot; /&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Capture&lt;/h3&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If a piece lands on a grid that an opponent piece has occupied (capture), that opponent piece shall be moved away from the board.&lt;/li&gt;&#xA;&lt;li&gt;After that, the piece will be granted rules from the captured opponent piece. As stated in &lt;strong&gt;Piece&lt;/strong&gt;, if there are more than 2 rules in total, only 2 shall be reserved.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Playing&lt;/h3&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;In a turn, White and Black play a move in turn. White always moves first.&lt;/li&gt;&#xA;&lt;li&gt;Only one piece can be move per turn.&lt;/li&gt;&#xA;&lt;li&gt;You cannot move a piece in the way that is not allowed by the rules set on it, beyond the boundaries of the board, or onto a grid already occupied by your other pieces.&lt;/li&gt;&#xA;&lt;li&gt;You cannot move your last piece in the way that after moving it it can be captured instantly.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Victory Condition&lt;/h3&gt;&#xA;&lt;p&gt;The game ends with either player winning if:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The last piece of the opponent is being checkmated, i.e. no possible moves that can save this last piece from being captured; or&lt;/li&gt;&#xA;&lt;li&gt;The opponent resigns and loses. (In this challenge, no resignation will be allowed)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The game ends with a draw if :&lt;/p&gt;&#xA;&lt;ol start=&quot;3&quot;&gt;&#xA;&lt;li&gt;No checkmate is possible for both sides;&lt;/li&gt;&#xA;&lt;li&gt;Either player has no more possible moves, but is not in checkmate;&lt;/li&gt;&#xA;&lt;li&gt;There is no capture in 50 moves; or&lt;/li&gt;&#xA;&lt;li&gt;The identical board arrangement has appeared 3 times with the same player to move.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Implementation&lt;/h2&gt;&#xA;&lt;p&gt;A player bot is a class that implements a function &lt;code&gt;nextMove()&lt;/code&gt;. This function receives 3 arguments and output an array of 6 integers:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;function nextMove(&#xA;    color: int,                    // Your color: 0 = white, 1 = black&#xA;    board: int[8][8][3],           // Current board:&#xA;                                   //  First index: x-coordinate&#xA;                                   //  Second index: y-coordinate&#xA;                                   //  The third layer will be as follows - &#xA;                                   //   [0]: the color of the grid&#xA;                                   //       (-1: Not occupied; 0: white; 1: black)&#xA;                                   //   [1]: rule 1 (0 if not exists)&#xA;                                   //   [2]: rule 2 (0 if not exists)&#xA;    moves: int[][10]               // Previous moves:&#xA;                                   //  First index: move number (0-indexed)&#xA;                                   //  The second layer will be as follows - &#xA;                                   //   [0]: the color of the player&#xA;                                   //   [1]: is this a capture (0: no, 1: yes)&#xA;                                   //   [2]: source x-coordinate&#xA;                                   //   [3]: source y-coordinate&#xA;                                   //   [4]: source rule 1&#xA;                                   //   [5]: source rule 2 (0 if not exists)&#xA;                                   //   [6]: target x-coordinate&#xA;                                   //   [7]: target y-coordinate&#xA;                                   //   [8]: target rule 1&#xA;                                   //   [9]: target rule 2 (0 if not exists)&#xA;): int[6]                          // Return value: as follows:&#xA;                                   //  [0]: source x-coordinate&#xA;                                   //  [1]: source y-coordinate&#xA;                                   //  [2]: target x-coordinate&#xA;                                   //  [3]: target y-coordinate&#xA;                                   //  [4]: target rule 1&#xA;                                   //  [5]: target rule 2 (0 if not exists)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Rule 1 and Rule 2 denotes the 2 rules a piece has.&lt;/li&gt;&#xA;&lt;li&gt;Source rule entries are used to denote which rules a piece has, while target rule entries are used to denote which rules are decide to keep.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may use JavaScript, pseudo-codes, or any languages similar to JavaScript, but using JavaScript is strongly encouraged, because all submissions will be translated to JavaScript before using for competition, and the test drive only supports JavaScript.&lt;/p&gt;&#xA;&lt;h2&gt;Restriction&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Standard loopholes are forbidden by default.&lt;/li&gt;&#xA;&lt;li&gt;You cannot by any means read or modify other bots. You can only use data within the class and inputs passed to &lt;code&gt;nextMove()&lt;/code&gt; function.&lt;/li&gt;&#xA;&lt;li&gt;You may define other variables inside your class if needed.&lt;/li&gt;&#xA;&lt;li&gt;You may use a random number generator.&lt;/li&gt;&#xA;&lt;li&gt;Your bot, specifically the &lt;code&gt;nextMove()&lt;/code&gt; function, must return value in 10 second per move. Timeout leads to disqualification.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Procedure&lt;/h2&gt;&#xA;&lt;p&gt;Round-robin will be used to determine the opponents, i.e. all bots will face each of the other bots twice, one as black and one as white. For each game, a win gets 2 points, a lose gets 0 points, and a draw gets 1 points.&lt;/p&gt;&#xA;&lt;p&gt;The bot will the highest points wins, and if there are any ties, they will be broken by:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Number of victories;&lt;/li&gt;&#xA;&lt;li&gt;Average time to checkmate opponent (shorter is better); and&lt;/li&gt;&#xA;&lt;li&gt;Drawing lots. (Hopefully this step is not necessary)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;TODO&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Add a sample implementation.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="71546" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-05-29T08:33:29.397" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17723" PostTypeId="2" ParentId="2140" CreationDate="2019-05-30T16:21:49.463" Score="1" Body="&lt;h1&gt;Finding distinct road sections&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I was recently working on a grid-based road procedural generator, and thought of a neat idea for a new challenge:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a square (equal width and height) 2d array in which each item is one of 2 distinct values (of your choice): grass and road (I will use &lt;code&gt;_&lt;/code&gt; and &lt;code&gt;#&lt;/code&gt; in examples), output the grid modified such that each distinct segment of road tiles has had its values changed to a unique value.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Two road tiles are considered to be part of the same segment if they neighbor each other in at least 1 cardinal directions.&lt;br&gt;&#xA;Diagonal neighbors are not considered to be part of the same segment (unless they are connected cardinally elsewhere)&lt;br&gt;&#xA;A single road tile with no connections is considered to be its own distinct segment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may choose the 2 input values used, and all output values used.&lt;br&gt;&#xA;&quot;Grass&quot; tiles must remain unchanged.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may assume there will always be at least 1 road segment, and that the array dimensions will be no larger than 64 by 64&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;___#__######____&#xA;_###__#_#_______&#xA;___#_##_########&#xA;___#____________&#xA;####_#######__##&#xA;_#_#_#__________&#xA;_#_#_#______####&#xA;___#_#__________&#xA;##_#_##_________&#xA;______#_________&#xA;_______#_#######&#xA;______##________&#xA;__###_#_______##&#xA;_##_____________&#xA;__#######_______&#xA;__#_____________&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;_&lt;/code&gt; is &quot;grass&quot; and &lt;code&gt;#&lt;/code&gt; is &quot;road&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;___3__111111____&#xA;_333__1_1_______&#xA;___3_11_11111111&#xA;___3____________&#xA;3333_4444444__22&#xA;_3_3_4__________&#xA;_3_3_4______5555&#xA;___3_4__________&#xA;66_3_44_________&#xA;______4_________&#xA;_______7_8888888&#xA;______77________&#xA;__000_7_______99&#xA;_00_____________&#xA;__0000000_______&#xA;__0_____________&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so fewest bytes &lt;em&gt;in each language&lt;/em&gt; wins&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;TBA&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I feel like the task is poorly worded, but can't think of a better way to word it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="44998" LastActivityDate="2019-05-30T16:21:49.463" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17724" PostTypeId="2" ParentId="2140" CreationDate="2019-05-30T19:37:19.117" Score="1" Body="&lt;h1&gt;Draw an Image on the screen efficiently&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Imagine you have a special rectangular screen made of square pixels. It consists of &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; rows and &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt; columns. For every row and every column there is one swich (so &lt;span class=&quot;math-container&quot;&gt;\$n + m\$&lt;/span&gt; switches in total). To turn a certain pixel on - let's say  at position &lt;span class=&quot;math-container&quot;&gt;\$(i,j)\$&lt;/span&gt; - we can press switch &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt; (of the row switches) and switch &lt;span class=&quot;math-container&quot;&gt;\$j\$&lt;/span&gt; (of the column switches) at the same time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As soon as some pixel has been turned on, it stays on, even if we press the same combination of switches again. &lt;strong&gt;META: Is this a good idea? Or should we say that each pixel should be turned on exactly once and may not be activated again?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But we can also press an arbitrary number of switches at the same time: Lets say we press switches &lt;span class=&quot;math-container&quot;&gt;\$0,2,3\$&lt;/span&gt; of the row switches and &lt;span class=&quot;math-container&quot;&gt;\$1,5\$&lt;/span&gt; of the column switches, then all the pixels &lt;span class=&quot;math-container&quot;&gt;\$(i,j)\$&lt;/span&gt; with &lt;span class=&quot;math-container&quot;&gt;\$i \in \{0,2,3\}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$j \in \{1,5\}\$&lt;/span&gt; will get turned on, so all the pixels &lt;span class=&quot;math-container&quot;&gt;\$(0,1),(0,5),(2,1),(2,5),(3,1),(3,5)\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we now want to draw a picture on the screen you could do that pixel for pixel, and we'd need &lt;span class=&quot;math-container&quot;&gt;\$n \cdot m\$&lt;/span&gt; actions in the worst case - that is, when we have to turn on every pixel. But as we can press an arbitrary number of switches at the same time, we can do better than that. We can for example do row by row: This means we select one switch for the current row, and all necessary column switches to activate all the pixels we need for this row, so in total we would need &lt;span class=&quot;math-container&quot;&gt;\$\min\{n,m\}\$&lt;/span&gt; actions. But can we do better than that?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The task is now to write a program that given some black and white image computes a &lt;em&gt;shortest&lt;/em&gt; sequence of actions (=simultaneous switch activations) that turns on exactly all the white pixels of the given image.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can also take a matrix/list of lists as input, or a list of the coordinates of the active pixels.&lt;/li&gt;&#xA;&lt;li&gt;You can additionally take the size &lt;span class=&quot;math-container&quot;&gt;\$(n,m)\$&lt;/span&gt; as an input (or &lt;span class=&quot;math-container&quot;&gt;\$(n-1,m-1)\$&lt;/span&gt; if you prefer.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The output is also flexible: You can represent every action as a list of two lists with the corresponding indices of the switches where each of the indices are in &lt;span class=&quot;math-container&quot;&gt;\$\{0,1,\ldots,n-1\}\$&lt;/span&gt; or &lt;span class=&quot;math-container&quot;&gt;\$\{0,1,\ldots,m-1\}\$&lt;/span&gt; respectively (or also 1-based indexing is fine), or alternatively you enumreate all switches as &lt;span class=&quot;math-container&quot;&gt;\$\{0,1,2,\ldots,n+m-1\}\$&lt;/span&gt; and use just one list to represent this action.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Alternatively you can also just use lists of size &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt; (or one of size &lt;span class=&quot;math-container&quot;&gt;\$m+n\$&lt;/span&gt;) with truthy and falsey values representing the switches that get activated.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Related:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/154193/matrices-generated-using-rectangles&quot;&gt;Matrices Generated Using Rectangles&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2019-06-13T07:47:27.517" LastActivityDate="2019-06-13T07:47:27.517" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17725" PostTypeId="1" CreationDate="2019-05-30T20:00:51.647" Score="36" ViewCount="1315" Body="&lt;p&gt;Three great discussions and 6-8 weeks later, I'm here to introduce you to your new site design! Thank you to everyone who contributed &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17548/the-ppcg-site-design-is-on-its-way-help-us-make-it-awesome&quot;&gt;ideas to the discussion&lt;/a&gt; -- there were many great points of inspiration for our designer, Lisa. Special recognition to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17554/78028&quot;&gt;DJMcMayhem's suggestion of Conway's Game of Life&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17550/78028&quot;&gt;Fatalize's reminder to avoid alluding to the game of golf&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a note, while my original announcement stated that we'd be rolling the design out live first, we're sharing screenshots here now beforehand in case you notice any minor things which we can fix before rolling out live in the next few days.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Your Site Name Here:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There's been discussion on whether &quot;Programming Puzzles and Code Golf&quot; was the right name for this site as it's aged. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17612/what-should-this-site-be-called-now-that-its-getting-a-design&quot;&gt;When I asked&lt;/a&gt; whether it was still appropriate a few weeks ago I half expected the response I got and was excited by the ideas y'all had for how to rebrand yourselves. When it seemed that you wanted &quot;Code Golf&quot; but with a bit extra information in a subtitle, I encouraged a discussion about what that should be and we've gone with what you told us you want.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17651/78028&quot;&gt;choice with the highest overall score&lt;/a&gt; is what we've gone with, so I'd like to welcome you all to -&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Code Golf &amp;amp; Coding Challenges&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;We really hope you feel this better describes your site!&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Logo (a picture is worth a thousand words - the ultimate golf):&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your community is unique and we wanted to represent both themes of competition and coding in your logo. We took notes from your &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7978&quot;&gt;community logo&lt;/a&gt; and created a icon that alludes to the community's themes and identity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/J1UYD.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/J1UYD.png&quot; alt=&quot;Main site logo for Code Golf - white curly brackets surrounding a gold exclamation mark where the line of the mark is split in half to make it look like a medal. Next to this, the text &amp;quot;Code Golf &amp;amp; coding challenges&amp;quot; in white&quot;&gt;&lt;/a&gt; &lt;a href=&quot;https://i.stack.imgur.com/Gq7zA.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Gq7zA.png&quot; alt=&quot;An all-white version of the main site logo with &amp;quot;meta&amp;quot; in small red font at the end&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Everything Else (no ⛳️ ️‍♀️ here):&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;But wait, there's more! &lt;/p&gt;&#xA;&#xA;&lt;p&gt;We were inspired by your feedback and your &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7955&quot;&gt;community script&lt;/a&gt;. We heard you, no blue theming. Included in the header design is code from popular answers from previous competitions. In the footer, you'll find Conway's Game of Life.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first image has been updated as it didn't reflect the correct link color.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/9xNxi.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/9xNxi.png&quot; alt=&quot;The full main site layout showing the home page and both the header banner and footer image (revised)&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ytuoA.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ytuoA.png&quot; alt=&quot;The layout of a question page&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/dq1l2.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/dq1l2.png&quot; alt=&quot;The full meta site layout showing the home page and both the header banner and footer image&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It has been a pleasure working with y'all on this. I'm so excited to bring the design to you and want to thank you for your participation and the time you've taken to express what you wanted, didn't want and to vote on the suggestions of others.&lt;/p&gt;&#xA;" OwnerUserId="78028" LastEditorUserId="78028" LastEditDate="2019-06-11T18:43:46.113" LastActivityDate="2019-06-11T18:43:46.113" Title="Here's your site design preview!" Tags="|discussion|site-design|announcement|" AnswerCount="13" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="17726" PostTypeId="2" ParentId="17725" CreationDate="2019-05-30T20:16:41.440" Score="26" Body="&lt;h1&gt;!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I was about to ask what the significance of the exclamation point is. Fortunately, I saved myself embarrassment by realising in time that it is medal on a ribbon.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Could that maybe be made clearer somehow? Maybe by making the ribbon a different colour? Or maybe by letting the two bands stay equally wide until the medal, and instead curve towards its top?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/YvbUX.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/YvbUX.png&quot; alt=&quot;White ribbon&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2019-06-04T15:48:26.820" LastActivityDate="2019-06-04T15:48:26.820" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17727" PostTypeId="2" ParentId="17725" CreationDate="2019-05-30T20:19:12.553" Score="-2" Body="&lt;h1&gt;{!}&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I think that the stroke thickness of the braces is a on the thin side compared to the medal, and even the stroke thickness of &lt;strong&gt;CODE GOLF&lt;/strong&gt;.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2019-05-30T20:19:12.553" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17728" PostTypeId="2" ParentId="17725" CreationDate="2019-05-30T20:31:11.087" Score="1" Body="&lt;h2&gt;Header padding&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Not sure if this could be adjusted but the header feels really tight especially given the fact we have a subtitle. Is it possible the spacing on the top &amp;amp; bottom could be adjusted?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/hrp81.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/hrp81.png&quot; alt=&quot;picture of header padding&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="40695" LastActivityDate="2019-05-30T20:31:11.087" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17729" PostTypeId="2" ParentId="17725" CreationDate="2019-05-30T20:42:54.313" Score="17" Body="&lt;h2&gt;Clashing cool/warm and muted/bright colors&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm glad at the use of green in the header which gives our site a distinctive color but this clashes with the use of blue/cool muted colors pretty much everywhere else.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/OSuOb.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/OSuOb.png&quot; alt=&quot;Site with marked colors&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To me when I first looked at this it was a kind of jarring color contrast. Looking at other sites (Tex.SE) I think this sort of customization is possible to. A few ideas:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;use a green accent color across the body of the page (tags, featured indicator, etc.)&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The second screen shot has a different link color than the first so maybe this is already partially implemented?&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;change the margin color to one of a warmer tone to match better with the header or the sidebar&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I think the userscript does an OK job of how green can be used in the body without being too attention grabbing. (Consider comments by comments by @PeterTaylor regarding tags but things like the color under featured or the underline for the selected tab are still relevant).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/xVZeZ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/xVZeZ.png&quot; alt=&quot;userscript example of green being used as accent&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="40695" LastEditorUserId="40695" LastEditDate="2019-05-31T00:22:16.820" LastActivityDate="2019-05-31T00:22:16.820" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17730" PostTypeId="2" ParentId="17725" CreationDate="2019-05-30T21:12:26.883" Score="37" Body="&lt;p&gt;I'm glad I wasn't the only person (Adám also confesses) who took a while to work out that the exclamation mark is a medal. If people who have been involved in the discussion about the site design don't find it obvious, it probably isn't going to fulfil the goal of alerting new users to the fact that this is a site about competition rather than bug-fixing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The vertical design seems to me to be suited for medals worn by soldiers more than medals worn by victorious athletes, which are usually placed around the neck. Something like this mockup might convey the desired impression more intuitively:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/EZtZR.png&quot; alt=&quot;Medal with V-shaped ribbon between curly braces&quot;&gt;&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2019-05-30T21:12:26.883" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="17731" PostTypeId="2" ParentId="17725" CreationDate="2019-05-30T21:23:14.547" Score="0" Body="&lt;p&gt;Is having &lt;em&gt;stalker&lt;/em&gt; in the header compatible with the &quot;be friendly&quot; ethos?&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2019-05-30T21:23:14.547" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17732" PostTypeId="2" ParentId="17725" CreationDate="2019-05-30T22:40:07.683" Score="20" Body="&lt;h1&gt;Include a glider in the Game of Life representation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The Game of Life motif in the footer is great, but it doesn't contain any &lt;a href=&quot;https://en.wikipedia.org/wiki/Glider_(Conway%27s_Life)&quot; rel=&quot;nofollow noreferrer&quot;&gt;gliders&lt;/a&gt;. The glider is one of the most popular beings in Conway's Game of Life. I think there should be one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/4rx39s.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/4rx39s.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="36398" LastActivityDate="2019-05-30T22:40:07.683" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17733" PostTypeId="2" ParentId="17725" CreationDate="2019-05-31T08:15:22.627" Score="24" Body="&lt;p&gt;Most background text of the header seemed to be golfed code from the Hello, World  question. But half of it is the &lt;a href=&quot;https://codegolf.stackexchange.com/a/67601/25180&quot;&gt;trace output from an intermediate language mimicking Piet&lt;/a&gt;. Not sure it's a good choice. Combined with the C-- code it looks like some verbose assembly output of an obscure architecture.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To make it more clear: It's not a program. It's the output of a helper program. The program answering the question is the 28x3 image in that answer.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="25180" LastEditDate="2019-05-31T12:35:40.897" LastActivityDate="2019-05-31T12:35:40.897" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17734" PostTypeId="2" ParentId="17725" CreationDate="2019-05-31T12:07:01.557" Score="4" Body="&lt;p&gt;I don't see any good reasons to make the background text under the logo and on the other part not align. Maybe just make an image from one block of text and split it into two parts.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2019-05-31T12:07:01.557" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17736" PostTypeId="2" ParentId="17725" CreationDate="2019-05-31T18:12:42.467" Score="-1" Body="&lt;h1&gt;Cool logo - that's about it&lt;/h1&gt;&#xA;&lt;p&gt;The logo is pretty ingenious and inventive, I'll give you that. I didn't have any issue seeing the medal here.&lt;/p&gt;&#xA;&lt;h3&gt;The header and the footer on the other hand... really?&lt;/h3&gt;&#xA;&lt;p&gt;Years of wait for this site's design. Weeks and weeks of wait since the design start announcement. All of this time for this:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The logo, see above.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Header: a copy-pasted random program in green. It's the least original idea you could have come up with, it's not interesting to look at, and it also takes about 5 minutes to create in Photoshop.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Footer: some random cells from some random game of life instance. Again something that probably takes 5 minutes to make. Thankfully it's a the bottom, so we won't see it a lot.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;That's it. Literally nothing else.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;When you compare it to e.g. &lt;a href=&quot;https://worldbuilding.stackexchange.com/questions/147882/is-it-possible-to-kill-all-life-on-earth&quot;&gt;Worldbuilding.SE&lt;/a&gt;, this really feels like a joke.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;I mean no disrespect to the designer (the logo itself shows they know what they're doing), they probably didn't even have that much resources to work on this, seeing how SE has neglected this site over the years. This design just shows that they still don't care about (PP)CG. It's no surprise the site's activity has gone down quite a lot in the last year or so, with many longtime users not being active anymore.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-05-31T18:12:42.467" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="17737" PostTypeId="2" ParentId="17725" CreationDate="2019-06-01T03:31:28.463" Score="1" Body="&lt;h2&gt;Make it so that text does not appear on a textured background (especially since the texture is other text).&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I think, partly for legibility reasons, it would look significantly nicer if the text of the logo did not overlap with the green text of the code. This especially applies for the subtitle, which is about the same font size as the text that it is overlapping. I think the logo looks nice on the solid black background, as shown in one of your images, so maybe find some way to naturally transition to a solid background for the logo portion of the header. This might just be my traditionalist design tastes, but I think text-on-texture should be avoided pretty much entirely.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The footer is a bit iffy with the white text on green game-of-life patterns. I don't know how easy that would be to fix (if the alignment of the footer text depends on screen resolution, then fixing it would probably be essentially impossible).&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2019-06-01T03:31:28.463" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17738" PostTypeId="2" ParentId="17725" CreationDate="2019-06-01T04:11:26.423" Score="7" Body="&lt;h2&gt;Change the green link text to be a different shade of green.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This suggestion might be a bit too open ended, but I think the color (at least the current particular shade of green) of the link text isn't the best choice. The link color looks kinda... &quot;faded&quot; or maybe &quot;fuzzy&quot; in comparison to the regular solid black text color. Overall I think it's probably a bit too dark, a bit too yellowish, and a bit too low of a saturation. For comparison, most website use an extremely high saturation blue for their blue link color. Right now, the link color is kind of a yellowish-green off-black color, and the off-black and black don't mesh well, for the same reason white and off-white don't mesh well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I propose changing the link color to be a lighter and more saturated green, while also trying to avoid any amount of &quot;yellow&quot; in the green, which I think would look ugly. It's a hard for me to play around with the colors in the site design, so I don't have a particular shade suggestion right now. Just tell the designers play around with it some more.&lt;/p&gt;&#xA;" OwnerUserId="2867" LastActivityDate="2019-06-01T04:11:26.423" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17739" PostTypeId="2" ParentId="1199" CreationDate="2019-06-01T17:12:47.427" Score="2" Body="&lt;p&gt;Sorry for the (very) late answer&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/a/91446/400441&quot;&gt;This answer&lt;/a&gt; summarizes it all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't know what the situation was back in 2014, but we receive questions that would be deemed too unclear by Stack Overflow (aka the trash questions they already receive).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It may be on-topic for Stack Overflow, but as Jeff Atwood said, &quot;Don't. Migrate. Crap.&quot;&lt;/p&gt;&#xA;" OwnerUserId="83048" LastActivityDate="2019-06-01T17:12:47.427" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17740" PostTypeId="2" ParentId="2140" CreationDate="2019-06-02T18:22:05.833" Score="2" Body="&lt;h1&gt;Is this a valid Irish word?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/natural-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;natural-language&amp;#39;&quot; rel=&quot;tag&quot;&gt;natural-language&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In Irish, most &lt;a href=&quot;https://en.wikipedia.org/wiki/Irish_phonology#Consonants&quot; rel=&quot;nofollow noreferrer&quot;&gt;consonants&lt;/a&gt; are divided into broad (velarized) and slender (palatalized) variants, and the orthography marks them with neighboring vowels, which are similarly divided. This gives rise to the &lt;a href=&quot;https://en.wikipedia.org/wiki/Irish_orthography#Vowels&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;caol le caol agus leathan le leathan&lt;/em&gt;&lt;/a&gt; (slender with slender and broad with broad) rule – a medial sequence of consonants must have the same class of vowel on either side: in &lt;em&gt;leabhar&lt;/em&gt;, &lt;em&gt;bh&lt;/em&gt; is surrounded by two broad vowels, so it is broad as well, and in &lt;em&gt;cailín&lt;/em&gt;, &lt;em&gt;l&lt;/em&gt; is surrounded by two slender vowels, so it is slender. &lt;em&gt;a&lt;/em&gt;, &lt;em&gt;o&lt;/em&gt; and &lt;em&gt;u&lt;/em&gt; are broad and &lt;em&gt;e&lt;/em&gt; and &lt;em&gt;i&lt;/em&gt; are slender (similar with the vowels with the &lt;em&gt;fada&lt;/em&gt;: &lt;em&gt;á ó ú é í&lt;/em&gt;); &lt;em&gt;ae&lt;/em&gt; is also considered broad.&lt;/p&gt;&#xA;&lt;p&gt;Given a word, output whether it follows this rule.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;You may assume that the input has only the following characters with their uppercase variants:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;aábcdeéfghiílmnoóprstuú&#xA;AÁBCDEÉFGHIÍLMNOÓPRSTUÚ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Tests&lt;/h2&gt;&#xA;&lt;p&gt;Valid:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;deartháireacha&#xA;madra&#xA;nuachtán&#xA;gaolta&#xA;ceannasaithe&#xA;snámhann&#xA;fómhair&#xA;laethanta&#xA;béar&#xA;Bealtaine&#xA;hAoine&#xA;ball&#xA;tree&#xA;ggg&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Invalid:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;codegolf&#xA;delta&#xA;alishanoi&#xA;ABI&#xA;anseo&#xA;breithlá&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Note that &lt;em&gt;anseo&lt;/em&gt; and &lt;em&gt;breithlá&lt;/em&gt; are Irish words, but they happen not to follow this rule. You should still output a falsy answer for them for the sake of simplicity.)&lt;/p&gt;&#xA;" OwnerUserId="14109" LastEditorUserId="14109" LastEditDate="2021-02-12T06:10:17.900" LastActivityDate="2021-02-12T06:10:17.900" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="17741" PostTypeId="1" AcceptedAnswerId="17742" CreationDate="2019-06-02T21:19:58.300" Score="3" ViewCount="189" Body="&lt;h2&gt;Disprove that this code generate valid n^2 x n^2 Sudoku Grids&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm complete with my Sudoku Project and others have been skeptical that I can generate pre-filled valid Sudoku grids in poly-time. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, disprove formally that this code won't print one out of n! valid grids sequentially of 9 x 9, 12 x 12, ..... ---- &gt; n^2 x n^2&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Remember, the rules for a &lt;em&gt;12 x 12&lt;/em&gt;. it would be &lt;em&gt;3 x 4&lt;/em&gt; squares. You'll have to know how a valid Sudoku grid would map out for a n x n. eg. &lt;em&gt;9 x 9&lt;/em&gt; would be &lt;em&gt;3 x 3&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A 9 x 9 grid would follow a list that has a length of non-repeating 9 elements.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are asked for input to map out valid grid in O(n^2) time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;HINT: If you generate larger grids than 9 x 9, you'll need to make sure your input is given for human readability eg.&lt;strong&gt;['[01]','[02]'...]&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;print('enter with [1,2,3...] brackets')&#xA;tup = input()[1:-1].split(',')&#xA;x = input('Enter mapping valid Sudoku eg. 3 for 9 x 9:')&#xA;e = input('Enter 9 for 9 x 9 ...12 for 12 x 12:')&#xA;f = input('Enter 3 if its a 9 x 9 ... n^2 x n^2:')&#xA;x = int(x)&#xA;e = int(e)&#xA;f = int(f)&#xA;squares = []&#xA;for index in range(len(tup)):&#xA;  tup.append(tup.pop(0))&#xA;  squares.append(tup.copy())&#xA;&#xA;    #Everything below here is just printing&#xA;for s in range(x):&#xA;      for d in range(0,e,f):&#xA;        for si in range(s,e,f):&#xA;          for li in range(d,d+f):&#xA;            print(squares[si][li], end = '')&#xA;        print('')&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If you can't disprove, then prove it. And, if it is non-finite subsets of n^2 x n^2 but with some sets not mappable then prove that as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Gratitude and Appreciation would be much given as an award.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have a link to an improved code-&lt;a href=&quot;https://codereview.stackexchange.com/a/221537/194047&quot;&gt;https://codereview.stackexchange.com/a/221537/194047&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;instructions&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://raw.githubusercontent.com/tbw1995/Sudoku-Solver-Constrained/master/Readme&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://raw.githubusercontent.com/tbw1995/Sudoku-Solver-Constrained/master/Readme&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="86260" LastEditorUserId="86260" LastEditDate="2019-07-05T18:31:46.797" LastActivityDate="2019-07-05T18:31:46.797" Title="Would this be on topic for this site?" Tags="|discussion|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17742" PostTypeId="2" ParentId="17741" CreationDate="2019-06-02T22:15:36.177" Score="2" Body="&lt;p&gt;Welcome to Programming Puzzles &amp;amp; Code Golf Stack Exchange, and thanks for asking! Unfortunately, this question wouldn't be on-topic here, since we generally accept two kinds of questions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Challenges where the answerers are asked to write code to solve a specified task. These are competitions with a specified objective winning criterion (i.e. the measure of comparison between two answers to find out which one performs better or if they tie, also included as a tag on the question, usually &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Non-challenge questions where the asker wants &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; on how to optimize their code so that it compares better with a specified objective winning criterion. We also have &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions for golfing tricks in specific languages, as well as a general one.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For more details, read &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;What topics can I ask about here?&lt;/a&gt; in our Help Center.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastActivityDate="2019-06-02T22:15:36.177" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17743" PostTypeId="2" ParentId="2140" CreationDate="2019-06-03T13:32:15.467" Score="3" Body="&lt;h1&gt;Do X with Y &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to create a X made of nested 3x3 lowercase Ys, with &lt;code&gt;n&lt;/code&gt; levels of nesting.&#xA;Here is how a X looks like (this is also the output for n = 0):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;y y&#xA; y&#xA;y y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;A 0-level nested lowercase Y is just &lt;code&gt;y&lt;/code&gt;.&#xA;To nest a lowercase Y a level further, you arrange 4 copies of it like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;y y&#xA; y&#xA;y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here is the output for n = 1:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;y y   y y&#xA; y     y &#xA;y     y  &#xA;   y y&#xA;    y&#xA;   y&#xA;y y   y y&#xA; y     y &#xA;y     y  &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here is the output for n = 2 (I typed all of this by hand; excuse any mistakes):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;y y   y y         y y   y y&#xA; y     y           y     y &#xA;y     y           y     y&#xA;   y y               y y&#xA;    y                 y&#xA;   y                 y&#xA;y y               y y&#xA; y                 y&#xA;y                 y&#xA;         y y   y y&#xA;          y     y&#xA;         y     y&#xA;            y y&#xA;             y&#xA;            y&#xA;         y y&#xA;          y&#xA;         y&#xA;y y   y y         y y   y y&#xA; y     y           y     y&#xA;y     y           y     y&#xA;   y y               y y&#xA;    y                 y&#xA;   y                 y&#xA;y y               y y&#xA; y                 y&#xA;y                 y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;A non-negative integer &lt;code&gt;n&lt;/code&gt;. You may choose the levels of nesting to be either 0- or 1- indexed.&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;A X made of nested 3x3 lowercase Ys, with &lt;code&gt;n&lt;/code&gt; levels of nesting, as a string, list of lines as strings, or outputted directly.&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox stuff&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is anything missing?&lt;/li&gt;&#xA;&lt;li&gt;Is the specification of the X clear enough?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="36445" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-06-03T13:32:15.467" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17745" PostTypeId="2" ParentId="2140" CreationDate="2019-06-06T18:38:22.387" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/186498/proving-that-a-russian-cryptographic-standard-is-too-structured&quot;&gt;Proving that a Russian cryptographic standard is too structured&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="87098" LastEditorUserId="25180" LastEditDate="2019-06-13T04:26:57.700" LastActivityDate="2019-06-13T04:26:57.700" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="17750" PostTypeId="2" ParentId="2140" CreationDate="2019-06-07T11:58:38.977" Score="1" Body="&lt;p&gt;Moved to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/186550/make-gimbap-cutter&quot;&gt;Make Gimbap cutter&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="87110" LastEditorUserId="87110" LastEditDate="2019-06-13T05:40:33.183" LastActivityDate="2019-06-13T05:40:33.183" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="17752" PostTypeId="2" ParentId="2140" CreationDate="2019-06-08T22:38:52.500" Score="0" Body="&lt;h2&gt;Is this set doubly orderable?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For input you are given a set of four or five sets of strings. Each string is at least two characters long; those first two characters are always digits but the remaining characters can also be letters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The set of sets is doubly orderable if an ordered list can be constructed using one element from each member of the set such that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first characters of each element of the list are in nondescending order&lt;/li&gt;&#xA;&lt;li&gt;The second characters of each element of the list are separately in nondescending order&lt;/li&gt;&#xA;&lt;li&gt;If any elements of the list have more then two characters, then those elements are all wholly equal with each other and appear at the beginning of the list (while still satisfying the other conditions).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Although there is an ordering on the list itself, the original sets can be sampled in any order necessary to achieve a valid list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example valid lists:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;13  24  25  36&#xA;13e 13e 13  13&#xA;33s 37  37  37&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Example invalid lists:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;13  33  15  35  (first character not in order)&#xA;13  15  33  35  (second character not in order)&#xA;13e 24s 25  36  (different overlong strings)&#xA;33  37s 37s 37s (overlong strings are not first)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For output you should have:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A consistent value indicating that the set is not doubly orderable&lt;/li&gt;&#xA;&lt;li&gt;A consistent value indicating that the set is can be doubly ordered using only 2-character strings&lt;/li&gt;&#xA;&lt;li&gt;A list of all overlong strings of which one is needed to make a valid list.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Full example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1. 13 23 33 14 24 34 15 25 35 16 26 36 17 27 37&#xA;2. 33s 15e 16 17e&#xA;3. 34 25&#xA;4. 17e 37&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In this example the &lt;code&gt;34&lt;/code&gt; and &lt;code&gt;25&lt;/code&gt; in set 3 force us to use either &lt;code&gt;33s&lt;/code&gt; or &lt;code&gt;15e&lt;/code&gt; from set 2 and therefore the &lt;code&gt;37&lt;/code&gt; from set 4, with a number of options from set 1. Since all the valid lists begin with either &lt;code&gt;33s&lt;/code&gt; or &lt;code&gt;15e&lt;/code&gt;, these are the outputs.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2019-06-12T14:30:49.153" LastActivityDate="2019-06-12T14:30:49.153" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17753" PostTypeId="2" ParentId="17725" CreationDate="2019-06-09T01:16:20.487" Score="6" Body="&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/RN0sE.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/RN0sE.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&#xA;If you look at my freehand circles, you can see that the logo for the featured questions are unrecognizable. If you look slightly above the logo for each question very closely, you can see two white arms that are out of the logo. What is this representing? Thinking outside of the box?&lt;/p&gt;&#xA;" OwnerUserId="83048" LastActivityDate="2019-06-09T01:16:20.487" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17754" PostTypeId="2" ParentId="2140" CreationDate="2019-06-09T22:05:52.500" Score="0" Body="&lt;h1&gt;Reading the text of the millitext font&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There is a font &lt;a href=&quot;http://www.msarnoff.org/millitext/&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; that fits each character into a single, 1x5 pixel block. It does this (assuming you're using an LCD screen) by using the RGB channels of each pixel to expand the one pixel into three subcolumns, one for each channel. Your task is to take in a string of text that describes this font and return the correspond text encoded.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Millitext Alphabet&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;CHARACTER: 0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ&#xA;ENCODING:  WYWBMRRMMMWYWYWWWMWBMRMYGYGYCWMMMMMW&#xA;           MGBWMRRMMMMMRMRRRMGBMRWMMMMMRGMMMMMB&#xA;           MGWWWWWBWWWYRMWWMWGBYRWMMYMYGGMMWGGG&#xA;           MGRBBBMBMBMMRMRRMMGBMRMMMRWMBGMCWMGR&#xA;           WWWWBWWBWWMYWYWRWMWWMWMMGRCMYGWBMMGW&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I've abbreviated each color to a one character symbol (R=red, G=green, B=blue, C=cyan, Y=yellow, M=magenta, W=white).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input Format&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The input format for this is pretty open. You can have the input be an array containing each column, an array containing each row, a &lt;code&gt;char[][]&lt;/code&gt;, or anything like that. You can also choose to use the full words &quot;red&quot;, &quot;green&quot;, &quot;blue&quot;, with uppercase/lowercase of your choice (but it must be consistent for each word! You cannot use &quot;RED&quot; and also do &quot;green&quot; or &quot;Blue&quot;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your language happens to support it, you can also have input be colors (however that might work, I don't know off-hand).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can assume that the input will ONLY contain encoded characters in the alphabet above (in particular, there will be no spaces or punctuation in your output).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output Format&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You can either output a string or some sort of character array. You can chose whether the letters are uppercase or lowercase, but they must all have the same case.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;MWRRGMGYRY&#xA;MRRRMMMMRM&#xA;WWRRMWMYRM -&amp;gt; HELLOWORLD&#xA;MRRRMWMMRM&#xA;MWWWGMGMMY&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is code golf, so shortest answer wins!&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test set&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;WYWBMRRMMMWYWYWWWMWBMRMYGYGYCWMMMMMW&#xA;MGBWMRRMMMMMRMRRRMGBMRWMMMMMRGMMMMMB&#xA;MGWWWWWBWWWYRMWWMWGBYRWMMYMYGGMMWGGG -&amp;gt; THEQUICKBROWNFOXJUMPEDOVERTHELAZYDOG&#xA;MGRBBBMBMBMMRMRRMMGBMRMMMRWMBGMCWMGR&#xA;WWWWBWWBWWMYWYWRWMWWMWMMGRCMYGWBMMGW&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="83275" LastEditorUserId="83275" LastEditDate="2019-06-10T12:43:52.343" LastActivityDate="2019-06-10T12:43:52.343" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17755" PostTypeId="2" ParentId="2140" CreationDate="2019-06-10T11:24:24.683" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/194087/make-korean-character-multi-style-ascii-box-art&quot;&gt;moved&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="87110" LastEditorUserId="87110" LastEditDate="2019-10-09T00:31:42.927" LastActivityDate="2019-10-09T00:31:42.927" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="17756" PostTypeId="2" ParentId="2140" CreationDate="2019-06-11T12:13:21.747" Score="0" Body="&lt;h1&gt;I Love U So Much!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Just print &lt;code&gt;i love u&lt;/code&gt;, or &lt;code&gt;I Love U&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But, because &lt;code&gt;i&lt;/code&gt; love &lt;code&gt;u&lt;/code&gt; so much, there is two rule.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;At least there must be one &lt;code&gt;I&lt;/code&gt;, and one &lt;code&gt;U&lt;/code&gt;. Capital or not is regardless.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Every&lt;/strong&gt; &lt;code&gt;I&lt;/code&gt; and &lt;code&gt;U&lt;/code&gt; must be stick together. No sole &lt;code&gt;i&lt;/code&gt; and sole &lt;code&gt;u&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code with byte wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="87110" LastEditorUserId="87110" LastEditDate="2019-06-11T12:38:51.153" LastActivityDate="2019-06-11T12:38:51.153" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17757" PostTypeId="1" AcceptedAnswerId="17889" CreationDate="2019-06-11T13:47:22.033" Score="13" ViewCount="154" Body="&lt;p&gt;The current tag info of the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; is doesn't contain any additional information and I'd like to improve that. Currently it is almost exclusively used for integer sequences (many times from &lt;a href=&quot;http://oeis.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS&lt;/a&gt;) and sometimes also for other sequences.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Problem:&lt;/strong&gt; In all those challenges we repeatedly ask the OPs the same questions regarding the input/output format, if they didn't already define it and I think we should define some defaults for these points. To accomodate for the many different types of languages I usually tried to be as inclusive as possible in my challenges and therefore allow a few different types of inputs/outputs. The following points are based on these experiences.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I suggest adding following defaults rules to the tag info that automatically apply as long as OP doesn't specify anything else:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;strong&gt;Indexing:&lt;/strong&gt; Allowed are both &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;- and &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt;-based indexing, and the following rules can be applied with both these types of indexing.&lt;/li&gt;&#xA;  &lt;li&gt;&lt;strong&gt;Format:&lt;/strong&gt; The answers can use one of the following input/output methods: &#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Given some index &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; it can return the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-th entry of the list.&lt;/li&gt;&#xA;  &lt;li&gt;Given some index &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; it can return all entries up to the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th one in the sequence.&lt;/li&gt;&#xA;  &lt;li&gt;Without taking any index, it can return a (potentially infinite) lazy list or generator that represents the whole sequence.&lt;/li&gt;&#xA;  &lt;/ul&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Note that we do have a meta post about &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;default input/output &lt;em&gt;methods&lt;/em&gt;&lt;/a&gt;, but this post is about the &lt;em&gt;format&lt;/em&gt; - which is why I suggest adding these rules to the tag info instead of to the aforementioned post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd like to get some feedback to hear whether you agree with these defaults of whether we anything should be modified. &lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="66833" LastEditDate="2021-10-22T11:19:14.813" LastActivityDate="2021-10-22T11:19:14.813" Title="Updating the [sequence] tag info: suggestions" Tags="|discussion|tags|tag-wikis|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17758" PostTypeId="1" CreationDate="2019-06-11T17:09:51.817" Score="2" ViewCount="111" Body="&lt;p&gt;This question is sort of a follow-up to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12079/can-questions-be-too-hard&quot;&gt;this other one I found&lt;/a&gt;, which I found quite useful but not fully elaborating on what I wanted to know.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, my question is this: I am working on a KoTH puzzle for people to make bots to play. However, as I found myself writing the question, I found that my question consisted of many sub-sections, including parsing unique syntax to interpret it in your own way, and simply a lot of working-out that had to be done before bots could actually get onto making a choice of move.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Could this be an issue? Is there such a thing as having too many elements to a question?&lt;/p&gt;&#xA;" OwnerUserId="85546" LastEditorUserId="31716" LastEditDate="2019-06-11T17:11:43.593" LastActivityDate="2019-06-16T12:05:03.673" Title="Can a question be closed for being too complex (but not necessarily hard)?" Tags="|discussion|asking-questions|close-reasons|king-of-the-hill|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17759" PostTypeId="2" ParentId="2140" CreationDate="2019-06-11T17:13:36.553" Score="0" Body="&lt;h1&gt;Trace My Triangles&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Triangular&lt;/em&gt; is a 2D programming language that reads its code in the shape of the smallest triangle that the code will fit into, ignoring all whitespace. Its IP starts at the very top point of the triangle, and traverses the code starting in a Southeast direction. The IP's direction can be changed with the following directional switches (Note that &quot;.&quot; is a no-op):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   ^&#xA;  ` /&#xA; &amp;lt; . &amp;gt;  &#xA;  , \&#xA;   v&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;hr&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You will be given a single input string &lt;code&gt;p&lt;/code&gt; which represents a valid Triangular program. Your task is to write a program or function, which will print or return the actual execution order of &lt;code&gt;p&lt;/code&gt;. Instructions in &lt;code&gt;p&lt;/code&gt; which are never reached by the IP can be ignored.&lt;br&gt;&lt;br&gt;&#xA;You may assume the following:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;ul&gt; &#xA;    &lt;li&gt;&lt;code&gt;p&lt;/code&gt; will contain only characters which are necessary for a Triangular program to be valid; no need to account for whitespace.&lt;/li&gt;&#xA;    &lt;li&gt;&lt;code&gt;p&lt;/code&gt; will only switch directions via the directional switches listed above. The &lt;code&gt;o&lt;/code&gt;,&lt;code&gt;e&lt;/code&gt;,&lt;code&gt;c&lt;/code&gt; and &lt;code&gt;z&lt;/code&gt; instructions will not be used.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:                    Output:&#xA;---------------------------------------------------&#xA;F\(?)1/%-&amp;lt;                F(1&amp;lt;-%/?\)&#xA;&#xA;,%./                      ,%/&#xA;&#xA;\@~/;&amp;lt;                    \~&amp;lt;;/@&#xA;&#xA;123456                    136&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, so the shortest byte count wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;hr&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a good idea for a question/not a dupe?&lt;/li&gt;&#xA;&lt;li&gt;Is the requirement clear enough?&lt;/li&gt;&#xA;&lt;li&gt;What other test cases should I be adding, if any? &lt;/li&gt;&#xA;&lt;li&gt;Should jump-related instructions - &lt;code&gt;(&lt;/code&gt;, &lt;code&gt;)&lt;/code&gt; and &lt;code&gt;]&lt;/code&gt; - also be among the things that can be disregarded?&lt;/li&gt;&#xA;&lt;li&gt;Should any other sorts of instructions be disregarded?&lt;/li&gt;&#xA;&lt;li&gt;Would any other assumptions make this more manageable/fun?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="85755" LastActivityDate="2019-06-11T17:13:36.553" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17760" PostTypeId="1" CreationDate="2019-06-11T19:15:18.440" Score="109" ViewCount="2392" Body="&lt;p&gt;You may have noticed that the site got a bit less blue today!&lt;/p&gt;&#xA;&lt;p&gt;Thank you so much for your input over the last few weeks. This has been a great process and I really hope you like your new theme.  We took your &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17725/heres-your-site-design-preview&quot;&gt;very helpful feedback&lt;/a&gt; and made some adjustments&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Reworked the logo to look more like a medal&lt;/li&gt;&#xA;&lt;li&gt;Addressed concerns about legibility for the site name when presented on a textured background&lt;/li&gt;&#xA;&lt;li&gt;Changed the text used in the banner to be more representative of Code Golfing&lt;/li&gt;&#xA;&lt;li&gt;Adjusted the colors of the links &amp;amp; tags to fit the theme better&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;In addition, we've customized your &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;Chat theme&lt;/a&gt; and &lt;a href=&quot;https://twitter.com/StackCodeGolf&quot; rel=&quot;nofollow noreferrer&quot;&gt;Twitter account&lt;/a&gt; and if you get the newsletter, you'll see a change there, too. If you're noticing your &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges&quot;&gt;privileges&lt;/a&gt; have changed, they've been updated to the higher levels.&lt;/p&gt;&#xA;&lt;p&gt;Oh, and you're now officially just &amp;quot;Code Golf&amp;quot;. The site name in the site switcher, footer, and &lt;a href=&quot;https://stackexchange.com/sites#oldest&quot;&gt;full site list&lt;/a&gt; has been updated to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17612/what-should-this-site-be-called-now-that-its-getting-a-design&quot;&gt;reflect that decision&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If you see any design bugs that need squishing, please let us know!&lt;/p&gt;&#xA;&lt;p&gt;Thanks so much to everyone who helped and gave feedback and thanks to Lisa for her work on this design.&lt;/p&gt;&#xA;&lt;h2&gt;UPDATE:&lt;/h2&gt;&#xA;&lt;p&gt;Thanks for your feedback! I've compiled this for Lisa to review and work on.&lt;/p&gt;&#xA;" OwnerUserId="78028" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-07-17T18:36:41.083" Title="Congratulations! Your site design is now live!" Tags="|discussion|site-design|announcement|" AnswerCount="14" CommentCount="18" ContentLicense="CC BY-SA 4.0" />
  <row Id="17761" PostTypeId="2" ParentId="17760" CreationDate="2019-06-11T19:33:23.527" Score="15" Body="&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The green background of the site bubble on the &lt;a href=&quot;https://stackexchange.com/sites#&quot;&gt;all sites&lt;/a&gt; page seems a bit over-saturated compared to all the other sites' desaturated colours:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/TxRxx.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/TxRxx.png&quot; alt=&quot;GREEEEN!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I suppose the icon is cached.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It seems the same green is used for mobile chat:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ZdUJq.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZdUJq.png&quot; alt=&quot;more green!!!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think taking the charcoal background from the new banner would work better both places.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="78028" LastEditDate="2019-07-17T18:35:31.100" LastActivityDate="2019-07-17T18:35:31.100" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17762" PostTypeId="2" ParentId="17760" CreationDate="2019-06-11T19:37:28.317" Score="22" Body="&lt;p&gt;The privileges page has way too little contrast. I can imagine those with poor eyesight will have to give up reading it:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/JeEir.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/JeEir.png&quot; alt=&quot;almost white - on white&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2019-06-11T19:37:28.317" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17763" PostTypeId="2" ParentId="17760" CreationDate="2019-06-11T19:48:21.473" Score="40" Body="&lt;p&gt;In the Hot Network Questions panel, the yellow medal clashes with the white background and makes it a bit indistinguishable as a medal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/eHhVK.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/eHhVK.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider adding a dark border around the medal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/95wdi.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/95wdi.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Better yet, like Adám suggested, add a dark background to the logo.&lt;/p&gt;&#xA;" OwnerUserId="61613" LastEditorUserId="61613" LastEditDate="2019-06-11T19:56:31.570" LastActivityDate="2019-06-11T19:56:31.570" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17764" PostTypeId="2" ParentId="17760" CreationDate="2019-06-11T20:34:59.773" Score="23" Body="&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The meta favicon looks off in my browser:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/S31CM.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/S31CM.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I am on Chrome version 73 using the Morpheon Dark theme.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Edit: this appears to be resolved now.&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/znOXN.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/znOXN.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="61613" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-07-17T18:34:02.103" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17765" PostTypeId="2" ParentId="6918" CreationDate="2019-06-11T23:25:19.663" Score="2" Body="&lt;h1&gt;Runic&lt;/h1&gt;&#xA;&lt;p&gt;This language was created by me, Draco18s on Sep 18, 2018.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/Draco18s/RunicEnchantments&quot; rel=&quot;nofollow noreferrer&quot;&gt;Documentation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#runic&quot; rel=&quot;nofollow noreferrer&quot;&gt;Interpreter&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The idea had been floating around in my head for a while, not actually as a programming language, but as a concept for a while. Mostly due to reading lit RPG books like &lt;a href=&quot;https://www.goodreads.com/series/198985-emerilia&quot; rel=&quot;nofollow noreferrer&quot;&gt;Emerilia&lt;/a&gt;. I wanted some way to write in-game code that would be attached to an item or object that would act as a magical enchantment.&lt;/p&gt;&#xA;&lt;p&gt;September 18th I pretty much sat down and started working out a basic set of instructions and framework for the language and the initial interpreter just to see if I could get something that worked. I took a lot of inspiration from &lt;a href=&quot;https://esolangs.org/wiki/Fish&quot; rel=&quot;nofollow noreferrer&quot;&gt;&amp;gt;&amp;lt;&amp;gt;&lt;/a&gt;, as I'd worked with it a bit in the weeks prior, and wanting something a little more powerful. After a couple of hours I had a small, but functional language.&lt;/p&gt;&#xA;&lt;p&gt;But it was really on Dec 16, 2018 when I added support for Unicode Combining characters that would modify various instructions in a variety of ways, such as &lt;code&gt;a͕&lt;/code&gt; would executes the &lt;code&gt;a&lt;/code&gt; command (push 10) normally before altering the IP's direction to point right (overriding whatever direction it was facing). While combining characters will only combine visually with a certain subset of symbols (i.e. &lt;code&gt;&amp;quot;͕&lt;/code&gt; ) the interpreter doesn't care. While certain modifiers are often not competitive in code golf (due to the 2 or 3 byte cost for each one), they do unlock the ability to perform otherwise complex or impossible operations (such as rotating a string or swapping substacks).&lt;/p&gt;&#xA;&lt;p&gt;The other main feature of Runic is that it supports an arbitrary number of simultaneously executed instruction pointers that can merge (if in the same cell and facing the same direction) and split (with one of four commands). Each instruction pointer has a current &amp;quot;mana&amp;quot; value, where some instructions cost mana (namely reflection, eval, sorting, substacks, and splitting) and if an IP ever runs out of mana it fizzles out of existence. Each IP's own stack is also size limited by its current mana, making large data sets almost impossible to work with. The idea being that magic, being magic, requires more energy to do Big Things.&lt;/p&gt;&#xA;&lt;p&gt;I'd definitely like to rebuild the language from the ground up to do more, have each given instruction handle a wider range of input types (some instructions only operate on, say, strings but currently does nothing if it gets a pair of integers, but would do &lt;em&gt;something&lt;/em&gt; instead that's currently handled by an instruction that currently operates on integers and not strings), and possibly have a custom code page (for extra golfiness). But it isn't high on my todo list.&lt;/p&gt;&#xA;&lt;p&gt;And yes, I did eventually get around to implementing some of the more game-y features &lt;a href=&quot;https://cdn.discordapp.com/attachments/272860530505547776/536721740437520404/clank.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;in Minecraft&lt;/a&gt; (just an example of an effect that spawns a particle to 'charge up' even if the final effect is just to print some text in chat, but it could spawn blocks too).&lt;/p&gt;&#xA;" OwnerUserId="47990" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-06-11T23:25:19.663" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17766" PostTypeId="2" ParentId="2140" CreationDate="2019-06-12T04:08:59.300" Score="1" Body="&lt;h1&gt;Cumbersome IO format &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The cops' task is to write a program in language A to solve (task about integer lists 1) and a program in language B to solve (task about integer lists 2). The second program must be able to use the output of the first program.&lt;/p&gt;&#xA;&lt;p&gt;Others could golf your programs. Highest (C + total length of your programs) / (C + minimum total length of the programs without the restriction) wins. (C is a fixed constant to be chosen.)&lt;/p&gt;&#xA;&lt;p&gt;(Details to be written. The format would be similar to &lt;a href=&quot;https://codegolf.stackexchange.com/q/37797/25180&quot;&gt;The Bowlers-Golfers Fraction War&lt;/a&gt;. Minimum lengths of the two parts would be taken from other challenges.)&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-06-13T16:37:06.323" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17767" PostTypeId="2" ParentId="17760" CreationDate="2019-06-12T06:04:26.500" Score="24" Body="&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The images linked on the pages for:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/captcha&quot;&gt;captcha&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/error&quot;&gt;error&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/err%C3%B6r&quot;&gt;site not found&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;do not exist (404 – file not found).&lt;/p&gt;&#xA;" OwnerUserId="11354" LastEditorUserId="78028" LastEditDate="2019-07-17T18:33:38.043" LastActivityDate="2019-07-17T18:33:38.043" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17770" PostTypeId="2" ParentId="2140" CreationDate="2019-06-12T09:49:48.817" Score="1" Body="&lt;h1&gt;Gitify a complete graph&lt;/h1&gt;&#xA;&lt;p&gt;Give a natural number &lt;code&gt;n = 1, 2, ...&lt;/code&gt;, create a &lt;a href=&quot;https://git-scm.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;git&lt;/a&gt; repository that represents a &lt;a href=&quot;https://en.wikipedia.org/wiki/Complete_graph&quot; rel=&quot;nofollow noreferrer&quot;&gt;complete graph&lt;/a&gt; of size &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A complete graph is a graph, where every node is connected to every other node (except for itself).&lt;/li&gt;&#xA;&lt;li&gt;The graph is represented as follows: Each commit is the equivalent of one node. And edge is represented by a parent/child relationship of two commits, that is, one commit must have the other as a parent.&lt;/li&gt;&#xA;&lt;li&gt;You must create a local repository. You can use &lt;code&gt;git&lt;/code&gt; itself or other libraries, but you can also create it by writing the raw files. You must include all languages, tools or non-standard libraries of your language/s of choice you use in the title.&lt;/li&gt;&#xA;&lt;li&gt;The repo created must be readable with the current git version &lt;code&gt;2.37.x&lt;/code&gt;, that is when you execute &lt;code&gt;git log --graph --oneline&lt;/code&gt; after you created the repo the graph should be visible (usually probably not in a very nice layout if it is a complete graph).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Example Outputs&lt;/h3&gt;&#xA;&lt;p&gt;If we use &lt;code&gt;bash&lt;/code&gt; with &lt;code&gt;git&lt;/code&gt; installed, can execute following commands to get the outputs for &lt;code&gt;n = 1, 2, 3&lt;/code&gt;. Note that these programs are not solutions to the challenge themselves (they don't take &lt;code&gt;n&lt;/code&gt; as an input) but merely generate a valid output repository.&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Graph Size&lt;/th&gt;&#xA;&lt;th&gt;Bash&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;git init;git commit --allow-empty -m x&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;git init;git commit --allow-empty -m x;git commit --allow-empty -m x&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;git init;git commit --allow-empty -m x;git commit --allow-empty -m x;git checkout -b first HEAD^;git merge master --no-ff -m x&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graph&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graph&amp;#39;&quot; rel=&quot;tag&quot;&gt;graph&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/git&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;git&amp;#39;&quot; rel=&quot;tag&quot;&gt;git&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;META:&lt;/h3&gt;&#xA;&lt;p&gt;I've decided to simplify the challenge to just create a complete graph instead of arbitrary graphs.&lt;/p&gt;&#xA;&lt;p&gt;&lt;s&gt;Given a undirected connected graph, create a git repository with a commit graph that is isomorphic to the input graph.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is just a rough idea: I first should think about what kind of graphs can actually be represented in a git repository. (the input format could be flexible: take an adjacency matrix or e.g. a list of edges or maybe some native graph structure)&lt;/li&gt;&#xA;&lt;li&gt;another idea would be following: given some &lt;span class=&quot;math-container&quot;&gt;\$n =1,2,3,\ldots\$&lt;/span&gt; create &lt;em&gt;complete graph&lt;/em&gt; of &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; nodes &lt;/s&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2022-07-19T07:08:17.927" LastActivityDate="2022-07-19T07:08:17.927" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17771" PostTypeId="2" ParentId="17760" CreationDate="2019-06-12T11:00:42.517" Score="15" Body="&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-declined&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-declined&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-declined&lt;/a&gt; We're going to stick with the blue for contrast and also because it's a traditional color used for first place.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The meta logo looks much more harmonic against the green/charcoal background than the main logo:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/bqERs.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/bqERs.png&quot; alt=&quot;meta logo&quot;&gt;&lt;/a&gt;&lt;br&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/axLlG.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/axLlG.png&quot; alt=&quot;main logo&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Maybe the main ribbon could instead use shades of green?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/zvZ5K.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/zvZ5K.png&quot; alt=&quot;green ribbon&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="78028" LastEditDate="2019-07-17T18:36:28.153" LastActivityDate="2019-07-17T18:36:28.153" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17772" PostTypeId="2" ParentId="17760" CreationDate="2019-06-12T11:03:54.353" Score="33" Body="&lt;p&gt;The meta logo is too colourful. Other meta logos are either entirely grey-scale or have just a tiny coloured details, not a major blob of colour:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/bqERs.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/bqERs.png&quot; alt=&quot;meta logo&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Maybe go with a silver medal for meta? &lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/QxX4h.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/QxX4h.png&quot; alt=&quot;silver meta medal&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or maybe just making the centre silver, with the gold ring remaining as a coloured detail, like other meta logos:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/0D9Eg.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/0D9Eg.png&quot; alt=&quot;silver meta medal with gold accent&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or white with gold accent:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/WxktK.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/WxktK.png&quot; alt=&quot;white meta medal with gold accent&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="78028" LastEditDate="2019-07-17T18:33:06.840" LastActivityDate="2019-07-17T18:33:06.840" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17774" PostTypeId="2" ParentId="17760" CreationDate="2019-06-12T11:48:36.930" Score="10" Body="&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The meta favicon has inconsistent medal colour across sizes.&lt;/p&gt;&#xA;&lt;p&gt;16×16 has silver medal, while larger has gold medal. This shows not just on browser tabs, but also on the featured posts' pane at varying zoom levels. E.g. in FFQ/Win at 140% vs 150%:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/DzP23.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/DzP23.png&quot; alt=&quot;140%&quot; /&gt;&lt;/a&gt;*&#xA;&lt;a href=&quot;https://i.stack.imgur.com/7kIZy.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/7kIZy.png&quot; alt=&quot;150%&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;* The missing top part of the cibbon &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17776/43319&quot;&gt;has been addressed&lt;/a&gt; separately&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-07-17T18:36:41.083" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17775" PostTypeId="2" ParentId="17760" CreationDate="2019-06-12T11:50:55.323" Score="69" Body="&lt;p&gt;With the new site design, &lt;strong&gt;unvisited links&lt;/strong&gt; are &lt;strong&gt;green&lt;/strong&gt;, whereas &lt;strong&gt;visited links&lt;/strong&gt; are very dark green, &lt;strong&gt;almost black&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/IIRU6.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/IIRU6.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/TguEP.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/TguEP.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The almost black color for visited links makes them look as if there is no link. There's still the underline, but the main visual hint of a link, which is the color, is gone. In addition, aesthetically the difference between the two colors is too large. Having clicked on a link should change its color, but not effectively remove the color altogether.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can we have a &lt;strong&gt;not so dark color for visited links&lt;/strong&gt;? Dark green is fine, just not so dark that it looks black.&lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2019-06-16T17:19:39.530" LastActivityDate="2019-06-16T17:19:39.530" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17776" PostTypeId="2" ParentId="17760" CreationDate="2019-06-12T11:58:37.210" Score="1" Body="&lt;p&gt;The 16×16 favicons are missing the top (horizontal) part of their ribbons, making especially the meta icon look like a bunny:&lt;br /&gt;&#xA;Main's &lt;a href=&quot;https://i.stack.imgur.com/4xz7D.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/4xz7D.png&quot; alt=&quot;current main&quot; /&gt;&lt;/a&gt; should be &lt;a href=&quot;https://i.stack.imgur.com/IHwXV.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/IHwXV.png&quot; alt=&quot;should be main&quot; /&gt;&lt;/a&gt;&lt;br /&gt;&#xA;Meta's &lt;a href=&quot;https://i.stack.imgur.com/nWe3m.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/nWe3m.png&quot; alt=&quot;current meta&quot; /&gt;&lt;/a&gt; should be &lt;a href=&quot;https://i.stack.imgur.com/zHhoU.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/zHhoU.png&quot; alt=&quot;should be meta&quot; /&gt;&lt;/a&gt;*&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;* the medal colour &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17774/43319&quot;&gt;has been addressed&lt;/a&gt; separately&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-06-13T12:41:43.470" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17777" PostTypeId="2" ParentId="2140" CreationDate="2019-06-12T13:02:57.887" Score="0" Body="&lt;p&gt;I'm not able to find a challenge which will return as an integer how many days until Christmas based on an input like DDDD-MM-YY. So...&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;How many days until Christmas?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Work out the number of full days until Christmas based on today's date based on the Western Christianity date &lt;a href=&quot;https://en.wikipedia.org/wiki/Christmas&quot; rel=&quot;nofollow noreferrer&quot;&gt;source&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program, method, function, routine or sub-routine that accepts an input of the current date according the the Gregorian calendar &lt;a href=&quot;https://en.wikipedia.org/wiki/Gregorian_calendar&quot; rel=&quot;nofollow noreferrer&quot;&gt;source&lt;/a&gt;. The date may be in any format as long as you use the full year (so &lt;code&gt;2019-09-11&lt;/code&gt; rather than &lt;code&gt;19-09-11&lt;/code&gt;). Other than requiring the full year, the date format is up to you (DD/MM/YYYY or MM/DD/YYYY or even formally written dates like Wednesday 12th June 2019). Please state what date format you are using in your answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An integer is displayed according to your standard output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input -&amp;gt; output:&#xA;&#xA;12/06/2019 -&amp;gt; 196 days until Christmas*&#xA;12/25/2019 -&amp;gt; 0 days until Christmas**&#xA;&#xA;* DD/MM/YYYY format&#xA;** MM/DD/YYYY format&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="61603" LastActivityDate="2019-06-12T13:02:57.887" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17778" PostTypeId="2" ParentId="17760" CreationDate="2019-06-12T13:28:28.017" Score="36" Body="&lt;p&gt;Earlier, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17725/heres-your-site-design-preview#comment63247_17725&quot;&gt;we were told&lt;/a&gt;: &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The design uses has the standard circle for badges to match the circle part of the medal in the logo.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;At the time, the medal in the logo only had a plain circle. Now it has two concentric ones:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/tqRun.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/tqRun.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Can our badge icons reflect that change in the medal? Something like on EL&amp;amp;U would work:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/wVolp.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/wVolp.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="80050" LastActivityDate="2019-06-12T13:28:28.017" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17779" PostTypeId="2" ParentId="17760" CreationDate="2019-06-12T17:30:23.527" Score="8" Body="&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In &lt;a href=&quot;https://area51.stackexchange.com/?tab=launched&amp;amp;page=1&amp;amp;pagesize=50&quot;&gt;Area 51 launched sites page&lt;/a&gt; and &lt;a href=&quot;https://area51.stackexchange.com/proposals/4570/code-golf-programming-puzzles&quot;&gt;proposal page&lt;/a&gt;, still the old icon is displaying for Code Golf.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/i4o3f.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/i4o3f.png&quot; alt=&quot;Area 51&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="72598" LastEditorUserId="78028" LastEditDate="2019-06-26T18:45:12.267" LastActivityDate="2019-06-26T18:45:12.267" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17781" PostTypeId="2" ParentId="17760" CreationDate="2019-06-12T18:34:58.347" Score="3" Body="&lt;p&gt;The header banner repeats horizontally, but the footer banner does not:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/yPuPk.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/yPuPk.png&quot; alt=&quot;very wide screen&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2019-06-12T18:34:58.347" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17782" PostTypeId="2" ParentId="17760" CreationDate="2019-06-13T02:27:18.513" Score="9" Body="&lt;p&gt;There is too little clue about whether I'm on the meta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I'm viewing the middle of a long post without links, the only clue would be the left bar. They have a different shade of gray, but that's difficult to remember as I can't think of words distinguishing them. And they may not feel the same at different times of a day. There is a small green or black line on the right of the current tab label. But they are too small to be noticed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And no I don't want the left bar color on main changed. I'm not sure what could be done for this.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastActivityDate="2019-06-13T02:27:18.513" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17783" PostTypeId="2" ParentId="2140" CreationDate="2019-06-13T03:40:07.350" Score="0" Body="&lt;h1&gt;Output Ordinal Numbers up to n&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Moved to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/188363/output-ordinal-numbers-up-to-n&quot;&gt;Output Ordinal Numbers up to n&lt;/a&gt;.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="87254" LastEditorUserId="87254" LastEditDate="2019-07-15T00:35:33.827" LastActivityDate="2019-07-15T00:35:33.827" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17785" PostTypeId="2" ParentId="2140" CreationDate="2019-06-13T13:38:34.880" Score="0" Body="&lt;h1&gt;Continue a progression &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;th generalized mean &lt;span class=&quot;math-container&quot;&gt;\$M_k\$&lt;/span&gt; of a set of numbers is defined as &lt;span class=&quot;math-container&quot;&gt;$$M_k(a_1,\dots,a_n)=\root^k\of{\frac{a_1^k+\dots+a_n^k}n}.$$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$M_0\$&lt;/span&gt;, the geometric mean, is defined through a limit &lt;span class=&quot;math-container&quot;&gt;\$\lim_{k\to0} \root^k\of{\frac{a_1^k+\dots+a_n^k}{n}} = \root^n\of{a_1\cdot\dots\cdot a_n}\$&lt;/span&gt;. &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; does not have to be integer.&lt;/p&gt;&#xA;&lt;p&gt;An arithmetic progression is (according to Wikipedia) a sequence of numbers such that the difference between consecutive terms is constant. A geometric progression is a sequence of numbers such that the ratio between consecutive terms is constant.&lt;/p&gt;&#xA;&lt;p&gt;There is a simple way to generalize these (that also explains why on earth is geometric progression named geometric): for a progression of order &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; for any 3 consecutive elements &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt;,&lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt;,&lt;span class=&quot;math-container&quot;&gt;\$c\$&lt;/span&gt; &lt;span class=&quot;math-container&quot;&gt;\$M_k(a,c)=b\$&lt;/span&gt;. This way, the arithmetic progression is of order 1 and the geometric progression is of order 0. The order does not have to be integer.&lt;/p&gt;&#xA;&lt;p&gt;The task is, given 3 real positive numbers &lt;span class=&quot;math-container&quot;&gt;\$a,b,c\$&lt;/span&gt;, to find the next term in the progression formed by them.&lt;/p&gt;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If multiple valid outputs exist, you can output any of them.&lt;/li&gt;&#xA;&lt;li&gt;It is guaranteed that a valid output exists.&lt;/li&gt;&#xA;&lt;li&gt;An output is valid if &lt;span class=&quot;math-container&quot;&gt;\$|o_{correct}-o_{program}| \le10^{-5} \cdot \max(o_{correct}, 1)\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Sandbox stuff&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I still have to prepare some test cases, especially for non-integer orders.&lt;/li&gt;&#xA;&lt;li&gt;Has this been asked before?&lt;/li&gt;&#xA;&lt;li&gt;Do multiple correct outputs ever exist? I feel like very often there are infinitely many.&lt;/li&gt;&#xA;&lt;li&gt;Does Mathematica have a built-in?&lt;/li&gt;&#xA;&lt;li&gt;Should I add a time limit? I feel like brute-forcing all floating point numbers and checking if they are valid outputs might be shorter than actually calculating.&lt;/li&gt;&#xA;&lt;li&gt;Should I restrict the order to be integer, or even just 0 or 1 (leaving only arithmetic and geometric progressions)?&lt;/li&gt;&#xA;&lt;li&gt;Is there a simple and beautiful formula for the next term that I was unable to find and that all answers will have to copy from each other? I could neither get Mathematica nor myself to solve any related equations.&lt;/li&gt;&#xA;&lt;li&gt;Is the grammar correct enough?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="36445" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-06-14T11:19:26.827" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="17786" PostTypeId="1" AcceptedAnswerId="17787" CreationDate="2019-06-13T17:25:34.773" Score="2" ViewCount="121" Body="&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/lRdba.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/lRdba.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As you can see in the image, I cannot close the question even though I have &gt;500 reputation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I cannot blame it on caching because I passed 500 reputation a long time ago (greater than a month).&lt;/p&gt;&#xA;" OwnerUserId="83048" LastEditorUserId="68942" LastEditDate="2021-06-02T00:41:20.530" LastActivityDate="2021-06-02T00:41:20.530" Title="Cannot close a question even though &gt;500 reputation" Tags="|bug|status-bydesign|" AnswerCount="1" CommentCount="0" ClosedDate="2019-06-14T22:46:53.890" ContentLicense="CC BY-SA 4.0" />
  <row Id="17787" PostTypeId="2" ParentId="17786" CreationDate="2019-06-13T17:34:59.407" Score="7" Body="&lt;p&gt;This is not a bug. The privilege levels changed with the new design, so you now need 3000 reputation to close questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From &lt;em&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17760/congratulations-your-site-design-is-now-live&quot;&gt;Congratulations! Your site design is now live!&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If you're noticing your &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges&quot;&gt;privileges&lt;/a&gt; have changed, they've been updated to the higher levels.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="80050" LastActivityDate="2019-06-13T17:34:59.407" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17790" PostTypeId="2" ParentId="2190" CreationDate="2019-06-15T15:41:42.900" Score="2" Body="&lt;h1&gt;Answers should be able to specify what is truthy and what is falsy&lt;/h1&gt;&#xA;&lt;p&gt;Almost all of the answers here are either ambiguous or put some languages at a disadvantage.&lt;/p&gt;&#xA;&lt;p&gt;For the top rated answer, there are many languages that don't have conditionals: Bitwise Cyclic Tag, any Turing Machine, etcetera.&lt;/p&gt;&#xA;&lt;p&gt;For the answers that give values beforehand for what is truthy and what is falsy, what about languages with booleans such as &lt;code&gt;fact&lt;/code&gt; or &lt;code&gt;lie&lt;/code&gt; and &lt;code&gt;win&lt;/code&gt; or &lt;code&gt;lose&lt;/code&gt;? You can always fix these exceptions, but there will be more as the development of esolangs (or some practical languages too) will arise to new names for boolean/truthy and falsy values.&lt;/p&gt;&#xA;&lt;p&gt;This is why I say that the answerer should specify what counts as a truthy value and what counts as a falsy value. This is to prevent an answer wasting too many bytes just because their truthy/falsy value wasn't on the list.&lt;/p&gt;&#xA;" OwnerUserId="83048" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-06-15T15:41:42.900" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17791" PostTypeId="2" ParentId="2140" CreationDate="2019-06-15T17:11:04.970" Score="0" Body="&lt;h1&gt;Nearest match with limited values&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;When writing my solution for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/186740/print-the-phrase-and-she-said-but-thats-his-using-only-the-alphabet&quot;&gt;this challenge&lt;/a&gt;, I found that I needed to generate a target value using nothing but multiplication and increments/decrements, using a restricted set of values to use in the multiplication. Given that my choice of values was restricted, I had to brute-force what the optimum solution was. gObviously, this seems like a programming challenge!&lt;/p&gt;&#xA;&lt;p&gt;The challenge is this: Given a target value &lt;em&gt;t&lt;/em&gt; and set of allowed multiplier/multiplicand values, find the solution &lt;em&gt;t&lt;/em&gt;=&lt;em&gt;x&lt;/em&gt;×&lt;em&gt;y&lt;/em&gt;±&lt;em&gt;c&lt;/em&gt; (&lt;em&gt;x&lt;/em&gt; and &lt;em&gt;y&lt;/em&gt; are from the set of allowed values), that has the smallest value of &lt;em&gt;c&lt;/em&gt;. If &lt;em&gt;c&lt;/em&gt; is zero, indicate the solution as an exact match.&lt;/p&gt;&#xA;&lt;p&gt;As this is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, smallest code size wins. The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;standard rules&lt;/a&gt; apply.&lt;/p&gt;&#xA;&lt;p&gt;Example program (ungolfed): &lt;a href=&quot;https://tio.run/##lVRtb5swEP7Or/BaVYLkWG0nwaYJndIsSPva7cPUDFWMkIaIQhVIF3Xqb@8OAyZr2klDurN9PL6X52xH9l0UvZwmWZTuljGZFOUyyT@uL42/TVmJtpfHPFmS5H6X3kZhGpk7NDPntiRluL2LSyCVQeK69ximu7gAUiRPMa6z3X1tschvgxBEkXy1KuKyWOhfPT0LFoMAELSM9x4FEqV5ERelZ7OxgZtX@dasHCQeHZNkonfhot@3ENBBNhVkcwjZ9PuNZ8SqXKqvy8erK7HNesMiCZpSFpvAGh/A78O7LCmRHs@sd15S61M9u7DrUWVbfW2pKm6woIGnvY/fhjAN2bwH4YH3KkyyMhuqJtRqbESzpxNu/cVpEVd79I9JA/3n3i7WB23tiCTkYYvsrMyT@T6MSlLk6a5M8uyCnH1f91A8lB/ZCRDNgJ5ucFqzr4kmZBuXu23Wrp@NWuPwa52ksWnbio02gYM@HrE1Nv6rdU2RHdZr2dHFtqWaTW1WVeRZf6lrPOo7HPf5DVTvXdARQYf0VOQ8G88vp8t4lWQxmV5ff/1yMzeRHbO6hvkKp@ftDONYlmHUfCSZWd3surRoHW7bngReXawLbAAc7@J5j3wLfwKZXePdfgijmPTOFcIZgeOAI8CR4LggKAgGgoMYgBiCGIFwQAgQEoQLkoJkIDnIAcghyBFIB6QAKUG64NZxpvZN69wV4EpwMQtKURgKRxmgDFFGKA6KQJEoiGOIY4hjiMPUGUMcQxxDHEMcQxxDHNbEOOI4VzFD@6mNSffzKVT6SumZ0p@VnivtQ4PzabX2mdJc6YHSQ6VHSjtKC6Wl0q7SKoavYvgqhq9i@CqG71c9VZfu1VPbtYbu@ZArv3wuVFwuhIo85I2d8lk9zpRvzupxNKVD7f/Vq9oeniaadfC4ds9/m0p3iUGfuua5Vye1PqWEjvF0/gE&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;C (gcc) – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I don't think that I saw this particular challenge before, but I may have missed some. This is my first challenge, so please let me know how I can make it better!&lt;/p&gt;&#xA;" OwnerUserId="79060" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-06-15T17:53:20.937" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17794" PostTypeId="1" AcceptedAnswerId="17796" CreationDate="2019-06-16T03:55:04.477" Score="9" ViewCount="180" Body="&lt;p&gt;If I find an old answer whose code I verified works using, say, Try It Online, can I edit that answer and add the link?&lt;/p&gt;&#xA;" OwnerUserId="86365" LastActivityDate="2019-06-17T22:07:18.680" Title="Adding a link to Try It Online to existing answers" Tags="|discussion|support|answers|editing|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17795" PostTypeId="1" AcceptedAnswerId="17797" CreationDate="2019-06-16T05:30:45.413" Score="-1" ViewCount="104" Body="&lt;p&gt;I somehow got reputation for editing my own answer? It's &lt;a href=&quot;https://codegolf.stackexchange.com/posts/186962/revisions&quot;&gt;this edit&lt;/a&gt;. Is this intentional or not? Because I could then edit some answers I've posted before, and get reputation, because edits to your own question won't have to be approved. &lt;/p&gt;&#xA;" OwnerUserId="87488" LastEditorUserId="68942" LastEditDate="2021-06-02T00:40:56.757" LastActivityDate="2021-06-02T00:40:56.757" Title="I got reputation for editing my own answer?" Tags="|bug|status-norepro|editing|reputation|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17796" PostTypeId="2" ParentId="17794" CreationDate="2019-06-16T05:51:19.797" Score="15" Body="&lt;p&gt;Technically speaking, you can, as one of the official reasons to edit an answer is to&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;▶ add related resources or links&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That being said, here at Code Golf Stack Exchange, we're quite conservative about editing others' posts, and instead prefer leaving comments so the post author can decide what to do about it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that in any case, until you reach 2000 rep, your attempted edits will only be considered edit suggestions, so they need approval by the post author or multiple other users before they become visible to all users.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My suggestion is to check if the post author is still active on the site by clicking their user name and looking for the area on the right saying e.g. &quot;︎ Last seen 1 hour ago&quot;. You can also check their recent activity below. If they are generally active as of late, I'd leave a comment saying &quot;&lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;language name – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&quot; so they can copy it. If they have stopped frequenting the site, then go ahead and edit it in.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/67312/giuseppe&quot;&gt;Giuseppe&lt;/a&gt; makes a good point: don't edit a lot of old posts willy-nilly and bump them to the front page! Feel free to edit an abandoned post here and there as you notice them, but bulk edits are disruptive to the main service of the site.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2019-06-17T22:07:18.680" LastActivityDate="2019-06-17T22:07:18.680" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17797" PostTypeId="2" ParentId="17795" CreationDate="2019-06-16T06:22:38.930" Score="4" Body="&lt;p&gt;You received 10 reputation for the single upvote (as of the time of writing this answer) on your answer. It may have looked like it came from the edit if the edit happened at the same time as the upvote, but rest assured that editing answers does not grant (or remove) reputation.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2019-06-16T06:22:38.930" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17798" PostTypeId="2" ParentId="17758" CreationDate="2019-06-16T10:41:48.283" Score="3" Body="&lt;h1&gt;No, but...&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;There's no rule that would result in your challenge being closed for being too complex (although a complex spec is more likely to be unclear, which is a reason to close). However, for any challenge type it helps to make the spec as simple as possible without being ambiguous. Condensing the required information into a form that can be absorbed as easily as possible is an art and an interesting challenge in itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is true for any challenge type, but it applies particularly for King of the Hill contests. In a golf challenge you can continue to improve your score, competing against your past self, even if there are no other people answering. In a KotH a single answer has nothing to compete against, so the challenge can only be meaningful with multiple answers. Ideally the competition should be easy to enter, so a population of players can build up.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My own view of KotHs is that they should be trivially simple to enter, but allow open ended opportunity for further improvement, to allow a variety of approaches followed by an arms race driving innovation. This isn't a rule though. It's not impossible to make a tricky-to-enter KotH work well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the input format is likely to be an obstacle to entry, it's worth thinking about how much of it is essential to the core of your challenge, and how much could be simplified. Can your KotH controller do more work so the players don't have to? Some KotHs provide utility functions available for all players to use. You could also provide input to the players in 2 or more alternative formats.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Whether these approaches are useful will depend on the nature of your particular challenge. For working on a specific challenge I find the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/20283&quot;&gt;challenge sandbox&lt;/a&gt; very helpful, in general but particularly for KotHs. The questions people ask about the spec and the input format will give you an idea of what needs to be better explained, be simplified, or have examples. It will also help detect edge cases that might break your challenge, allowing you to fine tune the rules before posting to avoid disruption once the challenge is live.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2019-06-16T12:05:03.673" LastActivityDate="2019-06-16T12:05:03.673" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17799" PostTypeId="1" AcceptedAnswerId="17800" CreationDate="2019-06-16T11:12:14.733" Score="2" ViewCount="166" Body="&lt;p&gt;In the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges, does it count in bytes or character length.&#xA;Because one character can 1 byte ranging from charcode 0 to 255, 2 bytes ranging from 0 to 65535, etc.&lt;/p&gt;&#xA;" OwnerUserId="87488" LastEditorUserId="87488" LastEditDate="2019-06-26T05:46:48.723" LastActivityDate="2019-06-26T05:46:48.723" Title="Does [code-golf] count in bytes or character length" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17800" PostTypeId="2" ParentId="17799" CreationDate="2019-06-16T12:24:32.587" Score="5" Body="&lt;p&gt;If you click on the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; tag, then click &quot;learn more&quot; from that page, you will see the tag wiki which gives useful information about code golf. At the bottom of the page under the heading &quot;Things to note&quot; there is this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Unless the question is specified to be scored by characters, it is scored by bytes. If it doesn't specify a character encoding to use for scoring, answers which use Unicode code points outside 0 to 255 should state the encoding used. &lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The same works for finding out more about any other tag too.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;As &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/47990/draco18s&quot;&gt;Draco18s&lt;/a&gt; points out in a comment, it's also worth noting that &lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt; scores languages with custom code pages according to that language's custom code page (even if the symbols themselves are from deep within Unicode). So any answer using a TIO link can be correctly scored.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2019-06-24T18:58:56.647" LastActivityDate="2019-06-24T18:58:56.647" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17804" PostTypeId="2" ParentId="2140" CreationDate="2019-06-18T22:58:39.757" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/187132/find-the-diameter-of-a-word-graph&quot;&gt;Moved here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="87372" LastEditorUserId="87372" LastEditDate="2019-06-20T00:32:45.830" LastActivityDate="2019-06-20T00:32:45.830" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17805" PostTypeId="2" ParentId="2140" CreationDate="2019-06-20T02:25:12.187" Score="1" Body="&lt;h1&gt;Digit Sum of Sum of Digit Sums&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input: An integer from 1 to 1000 (known as N)&#xA;Expected behavior: The code will go through the first N integers, and work out the digit sum for each integer, the code will then take these digit sums and add these together. The code will then take this total and work out the digit sum for that number. The final number is the expected output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 1:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: 12&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: 6&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Behavior: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1) Numbers&#xA;1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12&#xA;2) Digit Sums&#xA;1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3&#xA;3) Sum of Digit Sums&#xA;51&#xA;4) Digit Sum of Sum of Digit Sums&#xA;6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 2:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input: 20&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: 3&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Behavior: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1) Numbers&#xA;1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20&#xA;2) Digit Sums&#xA;1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 2&#xA;3) Sum of Digit Sums&#xA;102&#xA;4) Digit Sum of Sum of Digit Sums&#xA;3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There are no restrictions on language type as long as the standard loopholes are avoided.&#xA;Please demonstrate your code using the last three digits of your current reputation score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, the shortest number of characters in code will be deemed the winner. In the event of a tie, the one with highest popular answer will be crowned the winner. If both answers are tied in terms of popularity and size, a fight to the death will be used to declare the winner (just kidding...)&lt;/p&gt;&#xA;" OwnerUserId="8555" LastActivityDate="2019-06-20T02:25:12.187" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17808" PostTypeId="2" ParentId="2140" CreationDate="2019-06-21T05:49:03.920" Score="0" Body="&lt;h2&gt;GPA calculator&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A GPA is sort of weighted average based on the grades obtained in certain courses.  There are a number of different systems, but for this challenge we'll use the following grades and their numeric values:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A: 4&#xA;B: 3&#xA;C: 2&#xA;D: 1&#xA;F: 0&#xA;P: —&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The grade is P is a special case.  For some courses, students can sign up to take a course as Pass/Fail.  In the case of a Pass (P), the course has &lt;em&gt;no effect&lt;/em&gt; on their GPA whatsoever, but in the case of a Fail (F), the course &lt;em&gt;does&lt;/em&gt; affect the GPA.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;All courses are weighted by the number of hours/credits they are taken for.  So give the following transcript:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Course            Hours   Grade&#xA;------            -----   -----&#xA;Next Gen Perl       6       A&#xA;Advanced C-minar    1       C&#xA;Starting with Java  3       B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We would calculate the total points as 35 (&lt;code&gt;6*4 + 1*2 + 3*3&lt;/code&gt;), and then divide it by the number of hours, or 10 (&lt;code&gt;6+1+3&lt;/code&gt;) for a final GPA of &lt;strong&gt;3.5&lt;/strong&gt;.  If Starting with Java had been given an F, the total points would be 26 with 10 hours, for a GPA of &lt;strong&gt;2.6&lt;/strong&gt;.  However, if it had been a P, the total points would still be 26, but with only 7 hours, the GPA would be &lt;strong&gt;3.71428571429…&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An arbitrarily long list/array/sequence/etc of transcript entries.  The entries are simply a two item list/array/sequence/etc with one item being an integer value (doesn't have to be an actual Int value, floats are fine) of hours, and the other being the string ('A','B'...).  The above example would have been:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;  [6, 'A'],&#xA;  [1, 'C'],&#xA;  [3, 'B']&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You may assume that the list will have at least one computable grade (so no empty transcripts, nor transcripts consisting only of P).  If your language does not have strings, then you may use numbers for A/B/C/D/F/P, but their values must be similarly spaced (e.g. 10,11,12,13,14,&lt;strong&gt;25&lt;/strong&gt;)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A number representing the GPA (float or other non-Int value)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring and Restrictions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Codegolf, so shortest code in bytes wins.  Standard rules apply.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I thought about allowing for either +/- grades (A+, A, A-, B+...) which would definitely prevent using ASCII values as easily, but then that led me to the thought of having a second input which is a list of possible grades with their equivalent value, but I think that would start over complicating it and way over benefit languages with built-in hashing.  Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="30284" LastEditorUserId="67312" LastEditDate="2019-06-25T17:57:18.053" LastActivityDate="2019-06-25T17:57:18.053" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17809" PostTypeId="2" ParentId="2140" CreationDate="2019-06-21T07:53:25.560" Score="1" Body="&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;When dealing with data in two dimensions, data scientists looove to see straight lines emerge, as they can use a simple linear regression to model it - meaning we assume it is in the form of y=mx+b, and all that's left is to find the best m and b to describe the data.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are several ways to fit a line to any data (I saw there was a challenge with Ordinary Least Squares once), however one of the most flexible one is gradient descent.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When given vectors X and Y, we start with an initial guess of m and b, then iteratively update them, and hopefully we get a better fit when we're done.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We give a &quot;grade&quot; to our current fitted line with mse (the lower the grade - the better the fit):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;loss = mean((y - (m * x + b)) ** 2 for x, y in zip(X, Y))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And in each iteration we change m and b using the gradient of that same grade:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;b -= 2 * alpha * mean((m * x + b) - y for x, y in zip(X, Y))&#xA;m -= 2 * alpha * mean(((m * x + b) - y) * x for x, y in zip(X, Y))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here alpha is the learning rate (usually smaller than 1), used to keep the steps small enough to advance towards the minimum grade, rather than overstepping it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The last question asked is when should we stop these iterations. We (a bit arbitrarily) impose two conditions:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The absolute relative change in the grade between two iterations &lt;code&gt;abs(grade1 - grade2)/grade1&lt;/code&gt; is changed by less than some given epsilon, and/or&lt;/li&gt;&#xA;&lt;li&gt;A given number of iterations N has been performed already.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;p.s. I started by assuming the data is just y(x), however this method may be easily extended to an arbitrary number of free variables and one dependent variable.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program that accepts inputs: X, Y, m, b, epsilon, N and returns the updated m and updated b after performing gradient descent as described.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;corner cases:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;X and Y may be empty, in which case m and b are returned unchanged.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is code golf, so shortest code in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="87552" LastActivityDate="2019-06-21T07:53:25.560" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17810" PostTypeId="2" ParentId="2140" CreationDate="2019-06-21T11:37:32.347" Score="0" Body="&lt;h1&gt;Meta command-line flag parsing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;The challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write a program or function which determines whether or not a chosen command-line flag has been passed into the compiler or interpreter, but without accessing command-line parameters directly.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must take in no input.&lt;/li&gt;&#xA;&lt;li&gt;You are free to choose the flag that is being detected, but it must:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;be a flag, meaning a boolean command-line parameter that does not take any arguments (e.g. &lt;code&gt;-O3&lt;/code&gt; in gcc)&lt;/li&gt;&#xA;&lt;li&gt;not print anything by virtue of being present (e.g. flags that print a version number or usage help are disallowed)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The output must be 1 if the flag is present, and 0 otherwise.&lt;/li&gt;&#xA;&lt;li&gt;The program must successfully run without errors, whether or not the flag is present.&lt;/li&gt;&#xA;&lt;li&gt;You may not make use of the arguments passed to the compiler/interpreter, whether directly by value or by a property such as string length, array length.&lt;/li&gt;&#xA;&lt;li&gt;Separately from the chosen flag, other command line parameters can be used, so long as they remain the same when running the code with and without the flag in question.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;; shortest answer in bytes wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are there any other edge cases or loopholes that should be accounted for here?&lt;/li&gt;&#xA;&lt;li&gt;Is this a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;, despite the challenge not being related to input?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Feedback welcome!&lt;/p&gt;&#xA;" OwnerUserId="86422" LastEditorUserId="86422" LastEditDate="2019-06-23T07:27:41.963" LastActivityDate="2019-06-23T07:27:41.963" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17811" PostTypeId="2" ParentId="2140" CreationDate="2019-06-21T11:50:42.120" Score="0" Body="&lt;h2&gt;Conversion&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Assume that there is a number &lt;code&gt;a&lt;/code&gt;. In every conversion of that number, the number can either convert itself to its value plus the value of one of its digits, or convert itself to its value minus the value of one of its digits.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this situation, find the minimum number of conversions one has to make in order to get to the number &lt;code&gt;b&lt;/code&gt;. If b cannot be reached, output &lt;code&gt;-1&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input one line containing the integers a and b (where 1 &amp;lt;= a, and b &amp;lt;= 10^6).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Output a line containing one integer, which represents the minimum amount that one has to convert the number.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example input and output (s)&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:  1 10&#xA;Output: 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Why?&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   1&#xA;-&amp;gt; 1+1=2&#xA;-&amp;gt; 2+2=4&#xA;-&amp;gt; 4+4=8&#xA;-&amp;gt; 8+8=16&#xA;-&amp;gt; 16-6=10&#xA;=&amp;gt; 10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerDisplayName="user85052" LastActivityDate="2019-06-21T11:50:42.120" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17815" PostTypeId="2" ParentId="2140" CreationDate="2019-06-23T11:44:35.707" Score="0" Body="&lt;h1&gt;Answer chain: decreasing character scores&lt;/h1&gt;&#xA;&lt;p&gt;Assign a non-negative integer value to each letter in the alphabet, and write a function or program which takes as input a character string and outputs the sum of of the values of the letters in the string. Characters outside of [a-z] and [A-Z] have value 0.&lt;/p&gt;&#xA;&lt;p&gt;Now run your code, taking as input the code of each of the previous answers in the order they were posted (including your own). The resulting sequence of scores should be &lt;em&gt;strictly decreasing&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For example, if you are 4th to answer and your code defines a function &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt;, then the output should verify&#xA;&lt;span class=&quot;math-container&quot;&gt;\$f(c_1)&amp;gt;f(c_2)&amp;gt;f(c_3)&amp;gt;f(c_4)\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$c_1\$&lt;/span&gt; is the code of the 1st answer, &lt;span class=&quot;math-container&quot;&gt;\$c_2\$&lt;/span&gt; is the code of the 2nd answer, ..., &lt;span class=&quot;math-container&quot;&gt;\$c_4\$&lt;/span&gt; is the code of your answer.&lt;/p&gt;&#xA;&lt;p&gt;When there will have been one week with no new answer, the 2nd-to-last answer will be declared the winner.&lt;/p&gt;&#xA;&lt;h3&gt;Clarifications:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The values you assign may be the same as or different from those used by previous answers.&lt;/li&gt;&#xA;&lt;li&gt;The value 0 is allowed.&lt;/li&gt;&#xA;&lt;li&gt;Different letters may be assigned the same value.&lt;/li&gt;&#xA;&lt;li&gt;Upper and lower case versions of the same letter may have different values.&lt;/li&gt;&#xA;&lt;li&gt;Letters with diacritics, such as &lt;code&gt;é&lt;/code&gt; or &lt;code&gt;Ä&lt;/code&gt;, have value 0.&lt;/li&gt;&#xA;&lt;li&gt;Your code need not handle letters which have not occurred in any of the previous answers (so if no answer so far has used the letter &lt;code&gt;W&lt;/code&gt;, it's OK if your code fails on strings with a &lt;code&gt;W&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="86301" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-06-27T15:03:37.747" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="17819" PostTypeId="2" ParentId="2140" CreationDate="2019-06-25T15:43:16.780" Score="0" Body="&lt;h1&gt;Enable 2-char Jsfuck&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Provide a shortest code that makes JavaScript able to do everything JavaScript is supposed to do, i.e. able to access(so no deleting &lt;code&gt;[].prototype.toString&lt;/code&gt; unless you have a backup, even if you can simulate one &lt;code&gt;[].prototype.toString&lt;/code&gt;) and &lt;code&gt;exec&lt;/code&gt; anything, with only &lt;code&gt;[&lt;/code&gt; and &lt;code&gt;]&lt;/code&gt;. You can choose your environment(FF/node/etc). Answering in 6-char JsFuck or something similar is welcomed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;E.g. If you run&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Array.prototype[''] = 'a';&#xA;Array.prototype['a'] = 'b';&#xA;Array.prototype['b'] = function() { console.log(this[0]); };&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;then &lt;code&gt;[][[]]&lt;/code&gt; = &lt;code&gt;[]['']&lt;/code&gt; = &lt;code&gt;'a'&lt;/code&gt;, and &lt;code&gt;[][[][[]]]&lt;/code&gt; = &lt;code&gt;[]['a']&lt;/code&gt; = &lt;code&gt;'b'&lt;/code&gt;, so &lt;code&gt;[[][[]]][[][[][[]]]]&lt;/code&gt; = &lt;code&gt;['a']['b']&lt;/code&gt; = &lt;code&gt;function(){console.log('a')}&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, this is an invalid answer, because it can't do &lt;code&gt;prompt&lt;/code&gt;(web browser) or &lt;code&gt;fs&lt;/code&gt;(node) or anything similar, or even calling the &lt;code&gt;console.log&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2019-06-28T00:48:12.717" LastActivityDate="2019-06-28T00:48:12.717" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17820" PostTypeId="2" ParentId="2140" CreationDate="2019-06-25T18:26:04.403" Score="1" Body="&lt;h1&gt;Some enchanted &lt;code&gt;ave&lt;/code&gt;ning&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(you may see a stranger across a crowded room).&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&lt;p&gt;This is one part of a multi-part series inspired by various built-ins in R. Credit goes to &lt;a href=&quot;https://codegolf.stackexchange.com/users/41725/digemall&quot;&gt;digEmAll&lt;/a&gt; for suggesting this one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;ave&lt;/code&gt; calculates particular grouped values of a list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, we would group &lt;code&gt;x&lt;/code&gt; in the following way based on the criteria given in &lt;code&gt;f&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-r prettyprint-override&quot;&gt;&lt;code&gt;x = [2, 1, 3, 5, 4, 1, 5, 5]&#xA;f = [[1, 2, 2, 2, 1, 2, 1, 1], [1, 1, 2, 2, 2, 1, 1, 2]]&#xA;&#xA;     x f1 f2&#xA;[1,] 2  1  1    -&gt; group [1,1]&#xA;[2,] 1  2  1    -&gt; group [2,1]&#xA;[3,] 3  2  2    -&gt; group [2,2]&#xA;[4,] 5  2  2    -&gt; group [2,2]&#xA;[5,] 4  1  2    -&gt; group [1,2]&#xA;[6,] 1  2  1    -&gt; group [2,1]&#xA;[7,] 5  1  1    -&gt; group [1,1]&#xA;[8,] 5  1  2    -&gt; group [1,2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then for each group, we apply a given function (in R, the default is &lt;code&gt;mean&lt;/code&gt;), let's say &lt;code&gt;sum&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-r prettyprint-override&quot;&gt;&lt;code&gt;group [1,1]: 2, 5 -&gt; sum = 7&#xA;group [2,1]: 1, 1 -&gt; sum = 2&#xA;group [2,2]: 3, 5 -&gt; sum = 8&#xA;group [1,2]: 4, 5 -&gt; sum = 9&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then we replace each value in the group by the group sum, resulting in an output of:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;[7, 2, 8, 8, 9, 2, 7, 9]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Inputs:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a list &lt;code&gt;x&lt;/code&gt; of integers&lt;/li&gt;&#xA;&lt;li&gt;a list of lists &lt;code&gt;f&lt;/code&gt; or an arbitrary number of lists, each of length equal to &lt;code&gt;x&lt;/code&gt;; these are the &lt;em&gt;factors&lt;/em&gt; to group on&lt;/li&gt;&#xA;&lt;li&gt;a black-box function &lt;code&gt;FUN&lt;/code&gt; that takes a list of integers and returns a single integer value&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a list &lt;code&gt;o&lt;/code&gt; of length equal to &lt;code&gt;x&lt;/code&gt; where each element &lt;code&gt;o[i]&lt;/code&gt; is equal to &lt;code&gt;FUN(group(x[i]))&lt;/code&gt;, or as the documentation says:&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A numeric vector, say &lt;code&gt;y&lt;/code&gt; of length &lt;code&gt;length(x)&lt;/code&gt;. If &lt;code&gt;f&lt;/code&gt; is &lt;code&gt;g1&lt;/code&gt;, &lt;code&gt;g2&lt;/code&gt;, e.g., &lt;code&gt;y[i]&lt;/code&gt; is equal to &lt;code&gt;FUN(x[j], for all j with g1[j] == g1[i] and g2[j] == g2[i])&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input can be in any order and in many flexible output formats.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that the outputs will always result in integers.&lt;/li&gt;&#xA;&lt;li&gt;If your language has a builtin for this for some reason, please also implement your own solution.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox questions/notes:&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I've done two of these so far and found a reference to a musical that is somewhat appropriate, any suggestion is appreciated there.&lt;/li&gt;&#xA;&lt;li&gt;Need to add test cases&lt;/li&gt;&#xA;&lt;li&gt;Need to work a bit harder on the explanation of how &lt;code&gt;ave&lt;/code&gt; works.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="67312" LastEditorUserId="67312" LastEditDate="2019-07-02T20:50:10.293" LastActivityDate="2019-07-02T20:50:10.293" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17821" PostTypeId="2" ParentId="2140" CreationDate="2019-06-25T19:55:35.410" Score="0" Body="&lt;h1&gt;Find the closest hex colour shorthand&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In CSS, colours can be specified by a &quot;hex triplet&quot; - a three byte (six digit) hexadecimal number where each byte represents the red, green, or blue components of the colour. For instance, &lt;code&gt;#FF0000&lt;/code&gt; is completely red, and is equivalent to &lt;code&gt;rgb(255, 0, 0)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Colours can also be represented by the shorthand notation which uses three hexadecimal digits. The shorthand expands to the six digit form by duplicating each digit. For instance, &lt;code&gt;#ABC&lt;/code&gt; becomes &lt;code&gt;#AABBCC&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since there are fewer digits in the hex shorthand, fewer colours can be represented.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that takes a six digit hexadecimal color code and outputs the closest three-digit color code, where closeness is measured by adding together the difference between each component of the full color code and the corresponding component of the shorthand color code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's an example:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Input hex code: #28a086&lt;/li&gt;&#xA;  &lt;li&gt;red component&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;0x28 = 40 (decimal)&lt;/li&gt;&#xA;  &lt;li&gt;0x22 = 30&lt;/li&gt;&#xA;  &lt;li&gt;0x33 = 51&lt;/li&gt;&#xA;  &lt;li&gt;0x22 is closer, so the first digit of the shortened color code is 2&lt;/li&gt;&#xA;  &lt;/ul&gt;&lt;/li&gt;&#xA;  &lt;li&gt;green component&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;0xa0 = 160&lt;/li&gt;&#xA;  &lt;li&gt;0x99 = 153&lt;/li&gt;&#xA;  &lt;li&gt;0xaa = 170&lt;/li&gt;&#xA;  &lt;li&gt;0x99 is closer, so the second digit is 9&lt;/li&gt;&#xA;  &lt;/ul&gt;&lt;/li&gt;&#xA;  &lt;li&gt;blue component&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;0x86 = 134&lt;/li&gt;&#xA;  &lt;li&gt;0x77 = 119&lt;/li&gt;&#xA;  &lt;li&gt;0x88 = 136&lt;/li&gt;&#xA;  &lt;li&gt;0x88 is closer, so the third digit is 8&lt;/li&gt;&#xA;  &lt;/ul&gt;&lt;/li&gt;&#xA;  &lt;li&gt;The shortened color code is #298&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Your program or function must accept as input a six digit hexadecimal color code prepended with &lt;code&gt;#&lt;/code&gt; and output a three digit color code prepended with &lt;code&gt;#&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;#FF0000 → #F00&lt;/li&gt;&#xA;&lt;li&gt;#00FF00 → #0F0&lt;/li&gt;&#xA;&lt;li&gt;#D913C4 → #D1C&lt;/li&gt;&#xA;&lt;li&gt;#C0DD39 → #BD3&lt;/li&gt;&#xA;&lt;li&gt;#28A086 → #298&lt;/li&gt;&#xA;&lt;li&gt;#C0CF6F → #BC7&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="70097" LastEditorUserId="70097" LastEditDate="2019-06-28T19:46:28.377" LastActivityDate="2019-06-28T19:46:28.377" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17822" PostTypeId="2" ParentId="2140" CreationDate="2019-06-26T08:25:42.617" Score="-1" Body="&lt;p&gt;Just idea. Not sure what to do exactly.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Evolutionary Golf&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-code&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Make simple (not golfed at all at first) code for &lt;em&gt;(some program)&lt;/em&gt; with language &lt;em&gt;(something)&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, change a little bit (maximum 3 byte) of code to make it shorter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Altered code must work properly (this is how evolution work).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Maybe here will be starting code).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sandbox&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;First. What program would be best? For example, 'Hello World' program is not proper, because it is too short, and can't golf that much.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Second. What language would be best? Esolang like BF? Or something like C?&lt;/p&gt;&#xA;" OwnerUserId="87110" LastActivityDate="2019-06-26T08:25:42.617" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17823" PostTypeId="2" ParentId="7804" CreationDate="2019-06-26T17:45:52.117" Score="1" Body="&lt;p&gt;This is a quick-and-dirty handmade ASCII art of our new logo.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Feel free to use it, either as-is or as a basis for something better. Maybe there's something interesting to do with it... or maybe we just have enough &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;/&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenges.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   .##   ###########   ##.&#xA;  '#'   ## ####### ##   '#.&#xA;  ##   ###         ###   ##&#xA;  ##  #####       #####  ##&#xA;  ##   #####     #####   ##&#xA;  ##    #####   #####    ##&#xA;  ##     ##### #####     ##&#xA; .#'      ### #####      '#.&#xA;&amp;lt;#+        # #####        +#&amp;gt;&#xA; '#.        .===.        .#'&#xA;  ##      +&quot; +++ &quot;+      ##&#xA;  ##     # .#####. #     ##&#xA;  ##    # +#######+ #    ##&#xA;  ##    # +#######+ #    ##&#xA;  ##     # '#####' #     ##&#xA;  .#.     +, +++ ,+     .#'&#xA;   '##      '==='      ##'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="58563" LastActivityDate="2019-06-26T17:45:52.117" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17824" PostTypeId="1" AcceptedAnswerId="17825" CreationDate="2019-06-26T18:25:19.237" Score="2" ViewCount="70" Body="&lt;p&gt;I know that the best answer in a code golf challenge should be the accepted one. Is it a good idea to add a &quot;final positions table&quot; to the end of the post once a winner is found?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Something like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Congratulations! Final positions:&#xA;    1. FooLang, 25 bytes, by JohnDoe&#xA;    2. BarLang, 37 bytes, by JaneDoe&#xA;    3. BazLang, 59 bytes, by JackDoe&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="56701" LastActivityDate="2019-06-26T21:11:06.270" Title="Is it all right to edit challenge to recognize the winner?" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17825" PostTypeId="2" ParentId="17824" CreationDate="2019-06-26T19:04:55.080" Score="14" Body="&lt;h2&gt;Code golf challenges have no defined endpoint.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In the early days of CGCC, we would often write challenges with a defined time limit in mind; e.g. &quot;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer after one week wins&quot;. Now, time limits have largely been relegated to tags where they're necessary (some challenges tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;, etc.), with the idea that a challenge should be valuable to future golfers. Indeed, as new languages and golfing strategies have been developed, old challenges have been revived with many answers that couldn't have existed years ago.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some have argued that even accepting answers discourages people from participating. Announcing the winner in the question itself is a step too far. And if you were thinking of continuously updating the leaderboard for all eternity, it's much better to include the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world&quot;&gt;Stack Snippet&lt;/a&gt; leaderboard in your question. Or, people can just use &lt;a href=&quot;https://stackapps.com/questions/6772/ppcg-design-userscript&quot;&gt;this userscript&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See also: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8706/whats-the-accepted-answer&quot;&gt;What&amp;#39;s the &amp;quot;accepted answer&amp;quot;?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7488/are-questions-in-which-no-answer-is-the-best-allowed&quot;&gt;Are questions in which no answer is the best allowed?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="39328" LastEditDate="2019-06-26T21:11:06.270" LastActivityDate="2019-06-26T21:11:06.270" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17826" PostTypeId="2" ParentId="2140" CreationDate="2019-06-27T10:35:57.767" Score="0" Body="&lt;p&gt;Tag: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Arrays&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I originally wrote it in Chinese and am still working on translating it. Sorry for the inconvenience.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an array containing n integers A1,A2,…,An, where all of their initial values are 0. Please implement the four operations to the array described below:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Operations&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Given the positive integer x and y, let every number in the range Ax~Ay (including Ax and Ay) be added by the given positive integer c;&#xA;Given the positive integer x and y, let every number in the range Ax~Ay be (similarly to the previous spec; the rest of the spec also conforms that rule) multiplied by a given positive integer c;&#xA;Given the positive integer x and y, let every number in the range Ax~Ay be changed to a given positive integer c;&#xA;Given the positive integer x and y, with regard to a given positive integer p, evaluate the value of the following expression :```[pow(Ax, p) + pow(A(x + 1), p) + … + pow(Ay, p)]7```&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In the first line of the test case, there are two positive integers n(where 1&amp;lt;=n), which represents the length of the array.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then, input operations sequentially, where each operation occupies one line, and the input will be 4 positive integers as in: &lt;code&gt;type x y num&lt;/code&gt;, where type is either 1, 2, 3, or 4; these identifiers correspond to the corresponding operation as described above. The meaning of x and y corresponf to the description (where 1&amp;lt;=x&amp;lt;=y&amp;lt;=n). When type is not 4, num will be the positive integer given c(where 1&amp;lt;=c&amp;lt;=10000); when type is 4, num will be the given positive integer p(where 1&amp;lt;=p&amp;lt;=3)。&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For each test case, for every 4 operation for the array, output the value of the corresponding expression.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example input&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;5&#xA;3 3 5 7&#xA;1 2 4 4&#xA;4 1 5 2&#xA;2 2 5 8&#xA;4 3 5 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Example output&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;307&#xA;7489&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-06-27T12:48:45.980" LastActivityDate="2019-06-27T12:48:45.980" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="17827" PostTypeId="2" ParentId="2140" CreationDate="2019-06-27T12:23:31.933" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/17818#17818&quot;&gt;&lt;em&gt;Proposed alternative to this&lt;/em&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Golf an H interpreter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;H is a text-based, weakly-typed string concatenation language. You task is to run an H script. You may do so by creating an interpreter, a compiler, a transpiler, or by any other reasonable means.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Definitions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Anything not defined herein is undefined behaviour and your implementation does neither have to support it nor does it need to throw an error. This includes unmatched quotes, invalid escapes, usage of variables before definition, etc. All given H scripts will abide by all the rules as stated. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;General H syntax&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scripts&lt;/strong&gt;: One or more lines, each containing zero or more statements, optionally followed by a comment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;White-space&lt;/strong&gt;: you only have to support spaces in strings (tabs are escaped), plus tabs and/or spaces leading up to a comment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Operators&lt;/strong&gt;: There's only one, &lt;code&gt;+&lt;/code&gt;, which is string concatenation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Comments&lt;/strong&gt; begin with &lt;code&gt;#&lt;/code&gt; and continue until the end of the line. &lt;code&gt;#&lt;/code&gt; may be prefixed by one or more spaces and/or tabs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;name&lt;/em&gt;&lt;/strong&gt;: a sequence of &lt;em&gt;exactly&lt;/em&gt; 4 single-case ASCII letters &lt;code&gt;[A-Z]&lt;/code&gt; or &lt;code&gt;[a-z]&lt;/code&gt; (you decide the scheme)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;value&lt;/em&gt;&lt;/strong&gt;: a &lt;code&gt;+&lt;/code&gt;-delimited sequence of one or more strings (see below) and/or previously defined names. The combined value will never exceed 1000 characters.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Strings&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Opened and closed by &lt;code&gt;&quot;&lt;/code&gt; and support ASCII 32–126 but with the following escape sequences:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;\\&lt;/code&gt;: the literal backslash character; &lt;code&gt;\&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;\n&lt;/code&gt;: a line break; CR, LF, CRLF, or LFCR (you decide)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;\&quot;&lt;/code&gt;: a quotes symbol; &lt;code&gt;&quot;&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;\t&lt;/code&gt;: a tab character; &lt;code&gt;&amp;#9;&lt;/code&gt; (HT) or 2, 4, or 8 spaces (you decide)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A string matching the regex &lt;code&gt;0|-?[1-9]\d?\d?&lt;/code&gt; (i.e. look like an integer) may be left unquoted.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Statements&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Terminated by &lt;code&gt;;&lt;/code&gt; but may not span multiple lines. There are only three types of H statements:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;def &lt;em&gt;name&lt;/em&gt;=&lt;em&gt;value&lt;/em&gt;;&lt;/code&gt;&lt;/strong&gt; sets the variable &lt;strong&gt;&lt;code&gt;name&lt;/code&gt;&lt;/strong&gt; to the given &lt;strong&gt;&lt;code&gt;value&lt;/code&gt;&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;print(&lt;em&gt;value&lt;/em&gt;);&lt;/code&gt;&lt;/strong&gt; prints &lt;strong&gt;&lt;code&gt;value&lt;/code&gt;&lt;/strong&gt; without trailing line break.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;input(&lt;em&gt;value&lt;/em&gt;;&lt;em&gt;name&lt;/em&gt;);&lt;/code&gt;&lt;/strong&gt; prints &lt;strong&gt;&lt;code&gt;value&lt;/code&gt;&lt;/strong&gt; without trailing line break,  allows the user to enter a sequence of characters that extend that line, and assigns the characters to &lt;em&gt;&lt;code&gt;name&lt;/code&gt;&lt;/em&gt;. Any subsequent output begins on the next line.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test script&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The following assumes you have decided on the uppercase variable name scheme:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;def HELO=&quot;Hello, &quot;;&#xA;def HSMO=HELO+&quot;strange&quot;+-1;print(&quot;&quot;);&#xA;input(HSMO+&quot;what is your name?&quot;;NAME);         #enter &quot;User A&quot; via stdin&#xA;#print(-123)   # nope&#xA;print(HELO+&quot;\&quot;&quot;+NAME+&quot;\&quot;\n\tthis isn't APL\\&quot;+360+&quot;!&quot;);&#xA;&#xA;#done&#xA;print(-12+34)&amp;#9;# note the tab before #&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here is the equivalent using a lowercase variable name scheme:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;def helo=&quot;Hello, &quot;;&#xA;def hsmo=helo+&quot;strange&quot;+-1;print(&quot;&quot;);&#xA;input(hsmo+&quot;what is your name?&quot;;name);         #enter &quot;User A&quot; via stdin&#xA;#print(-123)   # nope&#xA;print(helo+&quot;\&quot;&quot;+name+&quot;\&quot;\n\tthis isn't APL\\&quot;+360+&quot;!&quot;);&#xA;&#xA;#done&#xA;print(-12+34)&amp;#9;# note the tab before #&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Running the appropriate script, and entering &lt;code&gt;User A&lt;/code&gt; should, according to the scheme where &lt;code&gt;\t&lt;/code&gt; means ASCII 9 (HT), leave the console/screen/window showing:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;Hello, strange-1what is your name?User A&#xA;Hello, &quot;User A&quot;&#xA;&amp;#9;this isn't APL\360!-1234&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If instead you decided that &lt;code&gt;\t&lt;/code&gt; means four spaces, it should show:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;Hello, strange-1what is your name?User A&#xA;Hello, &quot;User A&quot;&#xA;    this isn't APL\360!-1234&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compiler&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compiler&amp;#39;&quot; rel=&quot;tag&quot;&gt;compiler&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interactive&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interactive&amp;#39;&quot; rel=&quot;tag&quot;&gt;interactive&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2019-06-28T15:50:40.117" LastActivityDate="2019-06-28T15:50:40.117" CommentCount="5" CommunityOwnedDate="2019-06-27T13:13:12.093" ContentLicense="CC BY-SA 4.0" />
  <row Id="17828" PostTypeId="1" CreationDate="2019-06-28T07:22:51.757" Score="10" ViewCount="251" Body="&lt;p&gt;The &quot;Featured on meta&quot; sidebar currently shows three posts: two of which are actually featured, and the third of which (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17367/cast-your-vote-for-best-of-ppcg-2018?cb=1&quot;&gt;Cast your vote for “Best of PPCG 2018”!&lt;/a&gt;) ceased to be featured 40 days ago. That seems a bit too long to be just a caching problem.&lt;/p&gt;&#xA;" OwnerUserId="194" LastEditorUserId="68942" LastEditDate="2021-09-20T23:49:38.397" LastActivityDate="2021-09-20T23:49:38.397" Title="&quot;Featured on meta&quot; has gone crazy" Tags="|bug|status-completed|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17829" PostTypeId="2" ParentId="2140" CreationDate="2019-06-28T12:09:39.633" Score="0" Body="&lt;h2&gt;Tips for golfing in H&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/17827#17827&quot;&gt;H as described here&lt;/a&gt;, what general tips do you have for golfing in H? I'm looking for ideas which can be applied to code-golf problems. Tips have to be specific to H (e.g. &quot;remove comments&quot; is an answer).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Tips in &lt;a href=&quot;http://dcoj.wmh3.com/cscos/h/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Standard H&lt;/a&gt; are also on-topic, although its spec is in a bad condition. You can use the H description provided in the first link to solve anything you don't understand about.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please post one tip per answer. Also, please specify which H implementation you are using if your code runs only under a specific H implementation, as different H implementations can have different behavior.&#xA;&lt;hr&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-06-28T13:56:49.400" LastActivityDate="2019-06-28T13:56:49.400" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17830" PostTypeId="2" ParentId="11924" CreationDate="2019-06-28T12:31:42.707" Score="0" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/17827#17827&quot;&gt;H&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(The question only said &quot;languages&quot;, so a language like H should be fine.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;H programs contain almost nothing but inputs, outputs, and variable initialization. However, it is still very powerful for writing programs. This is a trivial one-line cat program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# This is a one-line cat program, which copies its input to its output.&#xA;input(&quot;Input a line:&quot;;a);&#xA;print(a);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A valid answer (like the one above) can only interact with users from the standard I/O; i.e. there is no way to break that rule of interaction.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#This is valid&#xA;print(-2+4);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Try this in an H implementation, and this might astonish you.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Implementation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are implementations for H in this website. Mentioning all of them is quite trivial.&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-06-28T12:37:28.323" LastActivityDate="2019-06-28T12:37:28.323" CommentCount="0" CommunityOwnedDate="2019-06-28T12:31:42.707" ContentLicense="CC BY-SA 4.0" />
  <row Id="17831" PostTypeId="1" AcceptedAnswerId="17832" CreationDate="2019-06-28T17:11:48.180" Score="2" ViewCount="131" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/187449/80745&quot;&gt;Source answer&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Intro&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Powershell introduced by Microsoft in 2006 for Windows OS.&lt;/li&gt;&#xA;&lt;li&gt;Since earlier versions, Powershell provides predefined aliases for commands. For example, alias &lt;code&gt;sort&lt;/code&gt; for command &lt;code&gt;sort-object&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Microsoft has released Powershell for Linux in 2018 (Powershell 6.1+).&lt;/li&gt;&#xA;&lt;li&gt;Powershell 6.1+ for Linux contains predefined aliases, but the &lt;code&gt;sort&lt;/code&gt; alias is not included in the standard package. Powershell 6.1+ for Windows still contains &lt;code&gt;sort&lt;/code&gt; among the other aliases.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Questions&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Do you think it is possible to use &lt;code&gt;sort&lt;/code&gt; in Powershell answers?&lt;/li&gt;&#xA;&lt;li&gt;is it need additional comments in answers to use &lt;code&gt;sort&lt;/code&gt;?&lt;/li&gt;&#xA;&lt;li&gt;How have similar cases been solved for other languages?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Thanks&lt;/p&gt;&#xA;" OwnerUserId="80745" LastActivityDate="2019-07-05T09:21:53.683" Title="`sort` alias for Powershell" Tags="|discussion|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17832" PostTypeId="2" ParentId="17831" CreationDate="2019-06-28T17:43:28.783" Score="6" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;This sounds perfectly fine to me. There are a couple similar questions. For example...&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11986/31716&quot;&gt;Languages with locale-specific functions&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5851/are-compiler-specific-submissions-allowed&quot;&gt;Are compiler-specific submissions allowed?&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And there are &lt;em&gt;plenty&lt;/em&gt; of answers that work in Linux but not Windows, or vice-versa. In PPCG, a language is defined by its implementation, so as long as it works on one implementation (in this case, Windows Powershell 6.1), then it's a valid submission.&lt;/p&gt;&#xA;&lt;p&gt;It would probably be best for you to mention if an answer is Windows specific. Either like this:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Powershell, 1 bajillion bytes&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;some code&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Doesn't work on Linux because it uses the &lt;code&gt;sort&lt;/code&gt; alias.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Or&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Windows Powershell 6.1, 1 bajillion bytes:&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;some code&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The same idea applies if you wanted to use the Linux specific aliases.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-06-28T17:43:28.783" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17833" PostTypeId="2" ParentId="17831" CreationDate="2019-06-28T17:46:11.963" Score="3" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;On PPCG, we define languages by their implementation/interpreter. So, as long as the &lt;code&gt;sort&lt;/code&gt; alias exists in any one version of Powershell and an interpreter exists for that version, it's fair game.&lt;/p&gt;&#xA;&lt;p&gt;The only requirement then is, when posting solutions that use &lt;code&gt;sort&lt;/code&gt;, to include the version name/number with the language name.&lt;/p&gt;&#xA;" OwnerUserId="58974" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-07-05T09:21:53.683" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17838" PostTypeId="2" ParentId="2140" CreationDate="2019-06-29T10:21:48.650" Score="6" Body="&lt;h2&gt;Lexicographically earliest valid UTF-8 byte sequence permutation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are currently 1,114,112 possible Unicode characters (code points). Each character has a unique valid byte sequence in the UTF-8 encoding. Different characters have different length encodings:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;ASCII characters have a 1-byte encoding &lt;code&gt;00&lt;/code&gt;-&lt;code&gt;7F&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The next 1920 characters have a 2-byte encoding &lt;code&gt;C2 80&lt;/code&gt;-&lt;code&gt;DF BF&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The rest of the BMP has a 3-byte encoding &lt;code&gt;E0 A0 80&lt;/code&gt;-&lt;code&gt;ED 9F BF&lt;/code&gt; and &lt;code&gt;EE 80 80&lt;/code&gt;-&lt;code&gt;EF BF BF&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The other planes have a 4-byte encoding &lt;code&gt;F0 90 80 80&lt;/code&gt;-&lt;code&gt;F4 8F BF BF&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;It's possible for two strings (specific non-normalised sequences of Unicode code points) of Unicode to have byte sequences that are permutations of each other in a number of ways:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;One string could simply be a permutation of the other at the Unicode level, e.g. &lt;code&gt;ab&lt;/code&gt; (&lt;code&gt;61 62&lt;/code&gt;) and &lt;code&gt;ba&lt;/code&gt; (&lt;code&gt;62 61&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;UTF-8 continuation bytes could be switched between two characters, e.g. &lt;code&gt;¡â&lt;/code&gt; (&lt;code&gt;C2 A1 C3 A2&lt;/code&gt;) and &lt;code&gt;¢á&lt;/code&gt; (&lt;code&gt;C2 A2 C3 A1&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;UTF-8 continuation bytes could be switched within a character, e.g. &lt;code&gt;ᴵ&lt;/code&gt; (&lt;code&gt;E1 B4 B5&lt;/code&gt;) and &lt;code&gt;ᵴ&lt;/code&gt; (&lt;code&gt;E1 B5 B4&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For this challenge I would like you to write a program or function that finds the string whose UTF-8 byte sequence is lexicographically earliest of all such sequences that are permutations of the UTF-8 byte sequence of a given Unicode string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if your input is &lt;code&gt;ᵴ¢ába&lt;/code&gt; (&lt;code&gt;E1 B5 B4 C2 A2 C3 A1 62 61&lt;/code&gt;) your output would be &lt;code&gt;ab¡âᴵ&lt;/code&gt; (&lt;code&gt;61 62 C2 A1 C3 A2 E1 B4 B5&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note however that some byte sequences are not valid UTF-8 (e.g. &lt;code&gt;E0 80 A0&lt;/code&gt; which is an overlong encoding for a space) so you need to take care to avoid these.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It would be helpful if your &quot;Try It Online&quot; or similar link includes a footer that helps demonstrate the correctness of your output, where this is not obvious from the I/O format or code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2019-07-06T09:48:38.247" LastActivityDate="2019-07-06T09:48:38.247" CommentCount="20" ContentLicense="CC BY-SA 4.0" />
  <row Id="17839" PostTypeId="2" ParentId="2140" CreationDate="2019-06-29T15:41:14.640" Score="1" Body="&lt;h1&gt;Switch the colour of the largest non-unique connected shape&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a rectangular grid of square cells, find the non-unique connected shapes with the largest area, and switch their colour&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A rectangular grid of cells, each of which has 1 of 2 distinct values (&quot;colours&quot;)&lt;/li&gt;&#xA;&lt;li&gt;You can choose to accept any of&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;an image with only 2 distinct pixel colours&lt;/li&gt;&#xA;&lt;li&gt;text with only 2 distinct characters (also allowing newlines for forming a rectangle)&lt;/li&gt;&#xA;&lt;li&gt;a 2d array, with each element having 1 of 2 distinct values&lt;/li&gt;&#xA;&lt;li&gt;a 1d array, plus a width and/or height&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The 2 distinct values will be referred to as &quot;colours&quot;, but the rules apply similarly for all of the permitted formats&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A rectangular grid of cells in the same format as the input, using the same 2 colours&lt;/li&gt;&#xA;&lt;li&gt;For each shape required to be changed, all of its cells have been switched to the other colour&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each cell is part of a connected shape, which contains all cells of the same colour that can be reached by a path made up only of vertical or horizontal steps to adjacent cells of the same colour (no diagonal steps)&lt;/li&gt;&#xA;&lt;li&gt;The grid does not wrap: a shape cannot be connected across the outer boundary&lt;/li&gt;&#xA;&lt;li&gt;A shape is &lt;strong&gt;&lt;em&gt;identical&lt;/em&gt;&lt;/strong&gt; to another if it can be made to coincide exactly with it by any combination of&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;translation&lt;/li&gt;&#xA;&lt;li&gt;rotation by an integer multiple of 90 degrees&lt;/li&gt;&#xA;&lt;li&gt;reflection in any vertical or horizontal line&lt;/li&gt;&#xA;&lt;li&gt;switching its colour&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;A shape is &lt;strong&gt;&lt;em&gt;unique&lt;/em&gt;&lt;/strong&gt; if no other shape is identical to it&lt;/li&gt;&#xA;&lt;li&gt;The &lt;strong&gt;&lt;em&gt;area&lt;/em&gt;&lt;/strong&gt; of a shape is the number of cells it contains&lt;/li&gt;&#xA;&lt;li&gt;The shapes to be changed are those with the largest area, of those that are non-unique&lt;/li&gt;&#xA;&lt;li&gt;If 2 or more distinct shapes are non-unique and have the largest area, all instances of each distinct shape must be changed&lt;/li&gt;&#xA;&lt;li&gt;If there are no non-unique shapes, the output is the same as the input&lt;/li&gt;&#xA;&lt;li&gt;A grid (input or output) may sometimes contain only 1 of the 2 colours&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Each test case is an input followed by its unique correct output&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.  .&#xA;&#xA;..  ..&#xA;&#xA;.#  #.&#xA;&#xA;.#  .#&#xA;..  ..&#xA;&#xA;.#  #.&#xA;#.  .#&#xA;&#xA;..#  ...&#xA;...  ...&#xA;.#.  ...&#xA;&#xA;.......  .......&#xA;##.....  .......&#xA;#.....#  .......&#xA;.....##  .......&#xA;&#xA;....##.  ....##.&#xA;##..##.  ....##.&#xA;#.....#  .......&#xA;.....##  .......&#xA;&#xA;#.....###.  ..........&#xA;#.......#.  ..........&#xA;##...##...  ..........&#xA;.....##...  ..........&#xA;##........  ..........&#xA;##..####..  ....####..&#xA;&#xA;.......###  .......###&#xA;..##..####  ......####&#xA;..#..###.#  .....#####&#xA;....###..#  ....######&#xA;...#######  ...#######&#xA;&#xA;.......###  #######...&#xA;.##...####  ######....&#xA;.#...###.#  #####.....&#xA;....###..#  ####......&#xA;...#######  ###.......&#xA;&#xA;........####  ########....&#xA;.###...#...#  ########....&#xA;.#..#.#.##.#  ##..##..##..&#xA;.###.###...#  ####........&#xA;....########  ####........&#xA;&#xA;........####  ########....&#xA;.###...#...#  ########....&#xA;.#..#.#....#  ##..##......&#xA;.###.###...#  ####........&#xA;....########  ####........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The same test cases with colour coding for human reading (click image for larger version):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/YKygs.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/YKygsm.png&quot; alt=&quot;test cases with colour coding&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. Your score is the number of bytes in your source code. For each language, the code with the lowest score wins&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox thoughts&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any important/useful test cases welcome&lt;/li&gt;&#xA;&lt;li&gt;Is there a more useful format for 2d test cases?&lt;/li&gt;&#xA;&lt;li&gt;Are there 2 distinct characters that would make human reading easier?&lt;/li&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Can anything be made clearer or more succinct?&lt;/li&gt;&#xA;&lt;li&gt;I'm also trying to think of a better name&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20283" LastEditorUserId="20283" LastEditDate="2019-06-29T23:35:57.713" LastActivityDate="2019-06-29T23:35:57.713" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17841" PostTypeId="2" ParentId="2140" CreationDate="2019-06-30T01:30:04.847" Score="4" Body="&lt;h2&gt;Inscriptio Labyrinthica&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In the burial place of King Silo of Asturias there is an inscription that reads &lt;strong&gt;SILO PRINCEPS FECIT&lt;/strong&gt; (&lt;em&gt;King Silo made this&lt;/em&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/3/32/Silo_princeps_fecit.JPG&quot; alt=&quot;SILO PRINCEPS FECIT&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first letter is found in the very middle, and from there one reads by going in any non-diagonal direction radiating outward.  The final letter is found on all four corners.  In this challenge, you'll generalize the process to make them.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A string (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2214/whats-a-string/2216&quot;&gt;or equivalent&lt;/a&gt;), and an integer.  You may make the following assumptions about the input:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The string will have an odd length.&lt;/li&gt;&#xA;&lt;li&gt;The integer will be an odd number between 1 and one less than twice the length of the string.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An &lt;em&gt;inscriptio labyrinthica&lt;/em&gt; for the string, using the integer for the height (see models).  Output should be each letter with no spaces, line break as default to your system/language.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Note that an input of 1 or (length * 2 - 1) will result in a horizontal or vertical palindrome.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; Input: FOO, 3    Input: BAR, 1    Input: BAR, 3    Input: BAR, 5&#xA;&#xA;Output: OOO      Output: RABAR    Output: RAR       Output: R&#xA;        OFO                               ABA               A&#xA;        OOO                               RAR               B&#xA;                                                            A&#xA;                                                            R&#xA;&#xA; Input: ABCDE, 5   Input: ABCDE, 3   Input: *&amp;lt;&amp;gt;v^, 3&#xA;&#xA;Output: EDCDE     Output: EDCBCDE           ^v&amp;gt;v^&#xA;        DCBCD             DCBABCD           v&amp;gt;&amp;lt;&amp;gt;v&#xA;        CBABC             EDCBCDE           &amp;gt;&amp;lt;*&amp;lt;&amp;gt;&#xA;        DCBCD                               v&amp;gt;&amp;lt;&amp;gt;v&#xA;        EDCDE                               ^v&amp;gt;v^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest answer in bytes wins.  &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; forbidden.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I feel like I've seen one similar, but searching around I couldn't find it, and I happened to be reading about this king when I got the idea).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In my original proposal, I had listed as a bonus to draw reading lines, but feedback was bonuses in code golf are discouraged.  I still like that idea and am thinking about integrating it as a a main part of the challenge, but don't know if that would over complicate it or actually make it more interesting.  The output for REI, 3 in such a case would be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;I←E→I&#xA;↑ ↑ ↑&#xA;E←R→E&#xA;↓ ↓ ↓&#xA;I←E→I&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The idea is that it would prevent simple flipping of data after calculating a quarter or half of the but still perhaps allow for some creative ways (I can think of some creative ways to do it shortly in some languages, but maybe it'll be overly complicated for others).&lt;/p&gt;&#xA;" OwnerUserId="30284" LastEditorUserId="30284" LastEditDate="2019-06-30T17:20:09.893" LastActivityDate="2019-06-30T17:20:09.893" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17843" PostTypeId="2" ParentId="5243" CreationDate="2019-06-30T08:31:52.510" Score="10" Body="&lt;h1&gt;500-1000 rep for further work on &lt;a href=&quot;https://codegolf.stackexchange.com/q/143822/39328&quot;&gt;(-a) &amp;#215; (-a) = a &amp;#215; a&lt;/a&gt; (no longer active?)&lt;/h1&gt;&#xA;&lt;p&gt;This now classic &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;atomic-code-golf-container&quot;&gt;atomic-code-golf&lt;/a&gt; question has 3 answers at score 18. Is 17 possible?&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;500 rep will be awarded for an answer with score 17 or lower.&lt;/li&gt;&#xA;&lt;li&gt;500 rep will be awarded for strong evidence that a solution is optimal, with a possible additional bonus for a proof.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;These bounties can be awarded either together or separately.&lt;/p&gt;&#xA;" OwnerUserId="39328" LastEditorUserId="109916" LastEditDate="2022-11-09T12:50:26.623" LastActivityDate="2022-11-09T12:50:26.623" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17845" PostTypeId="2" ParentId="2140" CreationDate="2019-07-01T11:11:36.140" Score="0" Body="&lt;h2&gt;Golf an H quine [duplicate]&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a quine program in H (described in my esolangs.org &lt;a href=&quot;https://esolangs.org/wiki/User:A/H_spec&quot; rel=&quot;nofollow noreferrer&quot;&gt;userpage&lt;/a&gt;). (It is unclear whether it is possible.) Referring to &lt;a href=&quot;https://cs.stackexchange.com/questions/111358/can-standard-h-create-a-quine&quot;&gt;Computer Science stack exchange&lt;/a&gt;, which seems unappropriate.&#xA;&lt;hr&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-07-01T12:07:25.750" LastActivityDate="2019-07-01T12:07:25.750" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="17846" PostTypeId="1" CreationDate="2019-07-01T11:56:01.200" Score="11" ViewCount="400" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/17612/43319&quot;&gt;This post&lt;/a&gt; says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17725/heres-your-site-design-preview&quot;&gt;This site is now &quot;Code Golf &amp;amp; Coding Challenges&quot;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Indeed, this is what it says in our banner too:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;CODE GOLF&lt;/h1&gt;&#xA;  &#xA;  &lt;p&gt;&amp;amp; coding challenges&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;But our tour page says:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Welcome to Code Golf Stack Exchange&lt;/h1&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;Code Golf Stack Exchange&lt;/strong&gt; is a question and answer site (…)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;And on Meta, the &lt;kbd&gt;&lt;strong&gt;?&lt;/strong&gt;&lt;/kbd&gt; menu has:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Back to Code Golf Stack Exchange&lt;/strong&gt;&lt;br&gt;&#xA;  Return to the main site&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h3&gt;How should we call this site, both on the site itself, and when mentioning it to the outside world, e.g. &lt;a href=&quot;https://esolangs.org/wiki/Esolang:Community_portal&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; and &lt;a href=&quot;https://en.wikipedia.org/wiki/Code_golf&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;?&lt;/h3&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2019-07-01T12:02:08.070" LastActivityDate="2019-07-02T07:41:12.553" Title="What should this site be called now that it has a name?" Tags="|discussion|site-name|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17847" PostTypeId="2" ParentId="17846" CreationDate="2019-07-01T12:04:26.720" Score="6" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;The new site name is &amp;quot;Code Golf&amp;quot;, and the subtitle is &amp;quot;&amp;amp; coding challenges&amp;quot;. You can refer to the site with or without the subtitle – &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges#comment63765_17845&quot;&gt;&lt;em&gt;trichoplax 19 mins ago&lt;/em&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;(referring to it off site should probably include &amp;quot;Stack Exchange&amp;quot; as other golfing sites are available) – &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges#comment63766_17845&quot;&gt;&lt;em&gt;trichoplax 14 mins ago&lt;/em&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerDisplayName="user85052" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-07-02T07:41:12.553" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17848" PostTypeId="2" ParentId="2140" CreationDate="2019-07-01T13:15:47.960" Score="4" Body="&lt;h1&gt;Babel on and on (working title...)&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://babeljs.io/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Babel&lt;/a&gt; is a cornerstone of modern web development. It takes Javascript using new or proposed ECMAscript features and &quot;transpiles&quot; it into an older language version, so that browsers can run it without updates. In order to do this it inserts its own shim methods, and own custom transforms.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Your objective is to write the Javascript code which produces the largest babel output in characters. Your code must be less than or equal to 128 bytes in length&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Babel has an online, interactive compiler which you can access &lt;a href=&quot;https://babeljs.io/repl&quot; rel=&quot;nofollow noreferrer&quot;&gt;HERE&lt;/a&gt;. It's highly recommended that you use this to form your answer. If you work locally, &lt;strong&gt;you are restricted to modifying only the settings that the babel website allows you to modify.&lt;/strong&gt;. There is a guide on installing babel at the end of the question.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For consistency, you may use a Babel version between &lt;code&gt;7&lt;/code&gt;, but not above &lt;code&gt;8.*&lt;/code&gt; (when it eventually comes).&lt;/li&gt;&#xA;&lt;li&gt;You &lt;strong&gt;may&lt;/strong&gt; change the interactive REPL's settings, source type, presets, options, and env-presets. You may change these settings locally if you are using a local installation of babel.&lt;/li&gt;&#xA;&lt;li&gt;You may only provide one input file.&lt;/li&gt;&#xA;&lt;li&gt;You &lt;strong&gt;may not&lt;/strong&gt; exceed 128 bytes in your input file.&lt;/li&gt;&#xA;&lt;li&gt;You &lt;strong&gt;may not&lt;/strong&gt; add your own plugins.&lt;/li&gt;&#xA;&lt;li&gt;You &lt;strong&gt;may not&lt;/strong&gt; use the loophole listed below, or any of the standard loopholes.&lt;/li&gt;&#xA;&lt;li&gt;You &lt;strong&gt;may not&lt;/strong&gt; use error output as a result. babel must transpile the code successfully under one of the allowed configurations.&lt;/li&gt;&#xA;&lt;li&gt;Neither your input or output need to run, or halt. The compilation just needs to output something.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;41 in, &lt;a href=&quot;https://babeljs.io/en/repl#?babili=false&amp;amp;browsers=&amp;amp;build=&amp;amp;builtIns=usage&amp;amp;spec=true&amp;amp;loose=true&amp;amp;code_lz=N4FwXABA2gdHAUAzArgOwMYgJYHtUCp4BKYAGwFMRoBDAGgCMBdAXigEZaAmRgXyN6A&amp;amp;debug=false&amp;amp;forceAllTransforms=false&amp;amp;shippedProposals=true&amp;amp;circleciRepo=&amp;amp;evaluate=false&amp;amp;fileSize=true&amp;amp;timeTravel=false&amp;amp;sourceType=module&amp;amp;lineWrap=true&amp;amp;presets=es2015%2Creact%2Cstage-2%2Cenv&amp;amp;prettier=false&amp;amp;targets=Electron-1.8%252CNode-8.9&amp;amp;version=7.4.5&amp;amp;externalPlugins=&quot; rel=&quot;nofollow noreferrer&quot;&gt;1075&lt;/a&gt; out&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{t: [...(function*(){let [a,b]=[1,2]})]}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;32 in, &lt;a href=&quot;https://babeljs.io/en/repl#?babili=false&amp;amp;browsers=&amp;amp;build=&amp;amp;builtIns=usage&amp;amp;spec=true&amp;amp;loose=true&amp;amp;code_lz=KYDwDg9gTgLgBAYwDYEMDOa4CMDeATAXgDMBXAOwRgEsIyAqACgEocBfVoA&amp;amp;debug=false&amp;amp;forceAllTransforms=false&amp;amp;shippedProposals=true&amp;amp;circleciRepo=&amp;amp;evaluate=false&amp;amp;fileSize=true&amp;amp;timeTravel=false&amp;amp;sourceType=module&amp;amp;lineWrap=true&amp;amp;presets=es2015%2Creact%2Cstage-2%2Cenv&amp;amp;prettier=false&amp;amp;targets=Electron-1.8%252CNode-8.9&amp;amp;version=7.4.5&amp;amp;externalPlugins=&quot; rel=&quot;nofollow noreferrer&quot;&gt;1101&lt;/a&gt; out&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;export class b{d=function*(){}}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;125 in, &lt;a href=&quot;https://babeljs.io/en/repl#?babili=false&amp;amp;browsers=&amp;amp;build=&amp;amp;builtIns=usage&amp;amp;spec=true&amp;amp;loose=true&amp;amp;code_lz=MYewdgzgLgBARjAvDAZgVzMKBLcAqACgEoBvAJwFMo0yxUMtcxDTLrb7Md9jyqa66LkxZ92ght2a82Azox6kAvitUBuIA&amp;amp;debug=false&amp;amp;forceAllTransforms=false&amp;amp;shippedProposals=true&amp;amp;circleciRepo=&amp;amp;evaluate=false&amp;amp;fileSize=true&amp;amp;timeTravel=false&amp;amp;sourceType=module&amp;amp;lineWrap=true&amp;amp;presets=es2015%2Creact%2Cstage-2%2Ces2015-loose%2Ctypescript%2Cenv&amp;amp;prettier=true&amp;amp;targets=Electron-1.8%252CNode-8.9&amp;amp;version=7.4.5&amp;amp;externalPlugins=&quot; rel=&quot;nofollow noreferrer&quot;&gt;7336&lt;/a&gt; out&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;const b = function*(){return function*(){return function*(){return function*(){return function*(){return function*(){}}}}}};&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You must provide both the code and the settings you are using. For users of the online REPL, a link with the settings set in the URL suffices. The answer with the largest output with an input less than or equal to &lt;strong&gt;128 bytes&lt;/strong&gt; wins. Unlike many challenges of this nature, settings do not cost any bytes of input.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Setting up a local environment (OPTIONAL)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Most of the people doing this challenge will probably use babel's online transpiler to complete it. In the event that the website is taken down in the future or made inadequate for the challenge, it can be completed locally. Make a folder for the challenge, and in a shell in that folder, try something like the following:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Install Babel (globally - you could do it locally)&lt;/strong&gt;&lt;br&gt;&#xA;&lt;code&gt;sudo npm install -g @babel/core @babel/cli&lt;/code&gt;&lt;br&gt;&#xA;&lt;strong&gt;Set your .babelrc with a preset (in this case env)&lt;/strong&gt;&lt;br&gt;&#xA;&lt;code&gt;echo '{&quot;presets&quot;: [&quot;@babel/preset-env&quot;]}' &amp;gt; .babelrc&lt;/code&gt;&lt;br&gt;&#xA;&lt;strong&gt;Install babel's dependencies&lt;/strong&gt;&lt;br&gt;&#xA;&lt;code&gt;npm install --save-dev @babel/preset-env @babel/core&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then, given an input file &lt;code&gt;test.js&lt;/code&gt;, you can figure out your output score with&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;babel test.js | wc -c&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Happy Hunting!&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Questions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is my first time ever posting one of these. Does everything look on the up-and-up?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, should this incorporate &quot;the less characters of input, the better?&quot;. I kept trying to think of ways to reward a large output for a small input, but every way I considered changed the tone of the challenge significantly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also also, I know that codegolf users don't like being constrained to one language. Is this bound to be an exception or will that stop the question in its tracks?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Proposed Tags&lt;/strong&gt;: &lt;code&gt;[BUSY BEAVER]&lt;/code&gt;, &lt;code&gt;[Javascript]&lt;/code&gt;, &lt;code&gt;[CODE CHALLENGE]&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="86611" LastEditorUserId="86611" LastEditDate="2019-07-15T12:24:28.077" LastActivityDate="2019-07-15T12:24:28.077" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17849" PostTypeId="2" ParentId="17846" CreationDate="2019-07-01T14:06:49.160" Score="26" Body="&lt;h1&gt;Code Golf&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;We voted to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17615/12012&quot;&gt;name our site Code Golf and keep a subtitle &lt;em&gt;in the logo&lt;/em&gt;&lt;/a&gt;, mostly for clarification purposes. This is what we should do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main drawback of referring to the site as &lt;em&gt;Code Golf &amp;amp; Coding Challenges&lt;/em&gt; is clear: nobody is &lt;em&gt;ever&lt;/em&gt; going to spell it out, so we're once more left with an obscure acronym that is meaningless for outsiders. This was also my first point when &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17613/12012&quot;&gt;I proposed to name the site Code Golf&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastActivityDate="2019-07-01T14:06:49.160" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17851" PostTypeId="2" ParentId="2140" CreationDate="2019-07-03T13:06:21.717" Score="1" Body="&lt;h1&gt;Manage a todo list using Cypher (WIP)&lt;/h1&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;A list is a common, well-understood data structure. Neo4j's property graph model can represent any data structure. Using the Cypher query language, write a collection of statements for managing a todolist&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;inspired by &lt;a href=&quot;http://todomvc.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;TodoMVC&lt;/a&gt; and &lt;a href=&quot;https://www.todobackend.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Todo-Backend&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Manage a todo list using parameterized Cypher.&lt;/p&gt;&#xA;&lt;p&gt;Todo list items are composed of two pieces of information:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;todo:string&lt;/code&gt; - the textual content describing the thing to do&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;completed:boolean&lt;/code&gt; - whether this todo has been done&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Todo list operations:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;add new, view, edit, remove, complete, un-complete individual todo list item&lt;/li&gt;&#xA;&lt;li&gt;re-order todo list item&lt;/li&gt;&#xA;&lt;li&gt;view all items&lt;/li&gt;&#xA;&lt;li&gt;view all completed items&lt;/li&gt;&#xA;&lt;li&gt;view all &amp;quot;active&amp;quot; items (items not yet completed)&lt;/li&gt;&#xA;&lt;li&gt;complete all todo list items&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Considerations:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;empty todo list&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Out of scope:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;multiple lists&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Answer Format&lt;/h1&gt;&#xA;&lt;p&gt;For each operation, provide a code block of Cypher. Identify the operation with its description. Separate each operation with a &lt;code&gt;---&lt;/code&gt; line. Like this...&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Create an empty node:&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;pre&gt;&lt;code&gt;CREATE ()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;Create a generic relationship:&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;pre&gt;&lt;code&gt;CREATE ()-[:RELATES_TO]-&amp;gt;()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Proposed tags&lt;/h2&gt;&#xA;&lt;p&gt;[cypher] [graph-theory]&lt;/p&gt;&#xA;" OwnerUserId="87780" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-07-03T13:06:21.717" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17853" PostTypeId="2" ParentId="2140" CreationDate="2019-07-04T13:48:19.700" Score="1" Body="&lt;h2&gt;Can the cursor reach the bottom?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A cursor position is valid if either of its two sides touches whitespace (i.e. a space or a newline(CR+LF or LF, depending on your OS)). The input will always consist of valid cursor positions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This takes one input(a character matrix), and for a cursor on the up right corner of the input, can the cursor reach the bottom of the input?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; ..... Same, delete text like this in order&#xA; ......&#xA;. . . .&#xA;.      Same to get normal input&#xA;...... Same&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The cursor can reach the bottom in this case. This process of moving the cursor will work: down, right(touches spaces on the left), down(touches spaces on the right), down, right(touches spaces on both sides) 6 times, and down(touching spaces and a linefeed).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Notably, this will also work:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  Code Golf deletes trailing whitespace by default&#xA;..&#xA;. trailing&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The cursor starts at the up-right corner. After moving right two times, it can move down (due to touching a newline character). Then, it can move down, which touches the bottom of the line.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This example will not work:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; ...&#xA;... Same reason as above&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The cursor cannot move down, as there is no sufficient whitespace to be touched.&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-07-04T14:08:10.547" LastActivityDate="2019-07-04T14:08:10.547" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17854" PostTypeId="2" ParentId="2140" CreationDate="2019-07-04T14:54:42.570" Score="3" Body="&lt;h1&gt;Atomic Handshakes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/network&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;network&amp;#39;&quot; rel=&quot;tag&quot;&gt;network&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/connection&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;connection&amp;#39;&quot; rel=&quot;tag&quot;&gt;connection&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; rel=&quot;tag&quot;&gt;array&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here you are. At a party, with two drinks in your hands. Your friend just went to the bathroom and you don't really know anyone else here. And so you wait. Or do you?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is a century old hypothesis known as &lt;a href=&quot;https://en.wikipedia.org/wiki/Six_degrees_of_separation&quot; rel=&quot;nofollow noreferrer&quot;&gt;Six Degrees of Separation&lt;/a&gt;. The hypothesis states, that any other person in the world is connected to you as &lt;em&gt;a friend &lt;sup&gt;of a friend &lt;sup&gt;of a friend &lt;sup&gt;etc.&lt;/sup&gt;&lt;/sup&gt;&lt;/sup&gt;.&lt;/em&gt; It would essentially only take you six handshakes to connect with any other person on this planet. But is there actually any truth in this hypothesis? That's what we're about to find out in this challenge!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A similar question also finds its way into my own field of expertise: chemistry. Hence the title. Chemistry is the study of molecules, and molecules get very complex very fast. All (for the sake of simplicity) atoms in a molecule are connected. For certain types of analysis, one may need to know how many connections (bonds) it takes to get from one atom to another.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In a set of &lt;code&gt;N&lt;/code&gt; people, each person has a maximum of &lt;code&gt;N-1&lt;/code&gt; direct connections. Based on this information, it is your task to deduce for every person what the lowest number of connections is to get to every other person.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;People (and atoms too) can have similar names. Therefore, instead of a name, every person will get a unique identifier. To make things easy, the identifier will be a non-negative integer and the integers are all consecutive. How convenient!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;An array-like object of size &lt;code&gt;N&lt;/code&gt; which lists the first-degree connections for each person.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;A two-dimensional, symmetrical array of size &lt;code&gt;NxN&lt;/code&gt; which shows for each person the shortest distance to every other person.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;All&lt;/em&gt; people are connected: there are no loners or isolated groups in the input&lt;/li&gt;&#xA;&lt;li&gt;Circular connections are allowed, but&lt;/li&gt;&#xA;&lt;li&gt;Only the shortest connection must be output as more ways lead to Rome&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;General rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the answer using the fewest bytes wins.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet/&quot;&gt;Standard rules&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;I/O rules&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;loophole rules&lt;/a&gt; apply.&lt;/li&gt;&#xA;&lt;li&gt;Please include a &lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it Online&lt;/a&gt;-link to demonstrate your code working.&lt;/li&gt;&#xA;&lt;li&gt;Please motivate your answer with an explanation of your code&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As the theory may still be somewhat confusing, I will include a network graph for each example. This should make it a lot easier to understand what we're talking about. Here goes!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example 1&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Consider the connected set&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0---1---2---3&#xA;        |   |&#xA;        4---5---6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For this network, our input array will be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[1]          # Since 0 is connected only to 1&#xA; [0 2]        # Since 1 is connected to 0 and 2&#xA; [1 3 4]      # Since 2 is connected to 1, 3 and 4&#xA; [2 5]        # Et cetera&#xA; [2 5]&#xA; [3 4 6]&#xA; [5]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which should result in the following output (excluding comments):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# Distance from&#xA;# 0 1 2 3 4 5 6&#xA;                   # To&#xA;[[0 1 2 3 3 4 5]   # 0&#xA; [1 0 1 2 2 3 4]   # 1&#xA; [2 1 0 1 1 2 3]   # 2&#xA; [3 2 1 0 2 1 2]   # 3&#xA; [3 2 1 2 0 1 2]   # 4&#xA; [4 3 2 1 1 0 1]   # 5&#xA; [5 4 3 2 2 1 0]]  # 6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Example 2&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Consider the connected set&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.-------.&#xA;|       |&#xA;|   0   |&#xA;|   |   |&#xA;|   1---2---3---.&#xA;|   |   |   |   |&#xA;'---4---5---6   |&#xA;    |           |&#xA;    7---8---9---'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For this network, our input array will be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[1]          # Since 0 is connected only to 1&#xA; [0 2 4]      # Since 1 is connected to 0, 2 and 4&#xA; [1 3 4 5]    # Since 2 is connected to 1, 3, 4 and 5&#xA; [2 6 9]      # Et cetera&#xA; [1 2 5 7]&#xA; [2 4 6]&#xA; [3 5]&#xA; [4 8]&#xA; [7 9]&#xA; [3 8]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which should result in the following output (excluding comments):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# Distance from&#xA;# 0 1 2 3 4 5 6 7 8 9&#xA;                         # To&#xA;[[0 1 2 3 2 3 4 3 4 4]   # 0&#xA; [1 0 1 2 1 2 3 2 3 3]   # 1&#xA; [2 1 0 1 1 1 2 3 3 2]   # 2&#xA; [3 2 1 0 2 2 1 3 2 1]   # 3&#xA; [2 1 1 2 0 1 2 1 2 3]   # 4&#xA; [3 2 1 2 1 0 1 2 3 3]   # 5&#xA; [4 3 2 1 2 1 0 3 3 2]   # 6&#xA; [3 2 3 3 1 2 3 0 1 2]   # 7&#xA; [4 3 3 2 2 3 3 1 0 1]   # 8&#xA; [4 3 2 1 3 3 2 2 1 0]]  # 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Example 3&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Consider the connected set&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.---0---.&#xA;|   |   |&#xA;1---2---3&#xA;|   |   |&#xA;'---4---'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For this network, our input array will be&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[1 2 3]      # Since 0 is connected to 1, 2 and 3&#xA; [0 2 4]      # Since 1 is connected to 0, 2 and 4&#xA; [0 1 3 4]    # Et cetera&#xA; [0 2 4]&#xA; [1 2 3]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Which should result in the following output (excluding comments):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;# Distance from&#xA;# 0 1 2 3 4&#xA;               # To&#xA;[[0 1 1 1 2]   # 0&#xA; [1 0 1 2 1]   # 1&#xA; [1 1 0 1 1]   # 2&#xA; [1 2 1 0 1]   # 3&#xA; [2 1 1 1 0]]  # 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="87681" LastEditorUserId="87681" LastEditDate="2019-07-05T10:09:07.233" LastActivityDate="2019-07-05T10:09:07.233" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17855" PostTypeId="2" ParentId="2140" CreationDate="2019-07-04T15:10:49.147" Score="0" Body="&lt;h1&gt;Machine Learning Golf: Fashion MNIST&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/187562/machine-learning-golf-multiplication&quot;&gt;first instance of Machine Learning Golf&lt;/a&gt; received a lot of intention but also revealed some problems (mostly caused by people in this community being too clever ;-)).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I intend to address those issues in this second installment:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fashion MNIST is a dataset of 60,000 labelled 28x28 pixel grayscale images of fashion items (T-shirts/tops, Trousers, Pullovers, Dresses, Coats, Sandals, Shirts, Sneakers, Bags and Ankle boots).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to design and train a neural network that correctly identifies these images. Here are the rules:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Performance Goal&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;To qualify, your model must achieve at least 95% accuracy on the training set (i.e. you must identify at least 57,000 images correctly).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may use any language and framework of your choice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your dataset must be taken as the current version of Fashion MNIST found &lt;a href=&quot;https://github.com/zalandoresearch/fashion-mnist&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; or in the references listed in that repo's README (for convenience).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may reshape, permutate, rescale and offset entries in the dataset. However, modifications made to one entry must be performed on all entries.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may transform the labels any way you like. (But you may, obviously, not change which labels correspond to which images.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;During training, you're allowed to use any dataset you want (in fact, you are allowed to come up with your weights however you like). Hence the above limitations are only relevant to assess whether your model meets the stated performance goal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your model                                 &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;must be a 'traditional' feed forward neural network, i.e.a node's value is calculated as a weighted linear combination of some of the nodes in previous layers (which may include a bias node with constant value 1) followed by an activation function. Note that this allows you to skip layers and use convolutional/residual layers,&lt;/li&gt;&#xA;&lt;li&gt;may only use the following standard activation functions:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$\mathrm{linear}(x) = x\$&lt;/span&gt;,&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$\mathrm{softmax}(\vec{x})_i = \frac{e^{x_i}}{\sum_j e^{x_j}}\$&lt;/span&gt;,&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$\mathrm{selu}_{\alpha, \beta}(x) = \begin{cases}&#xA;\beta \cdot x &amp;amp; \text{, if } x &amp;gt; 0 \\&#xA;\alpha \cdot \beta (e^x -1 ) &amp;amp; \text{, otherwise}&#xA;\end{cases}\$&lt;/span&gt;,&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$\mathrm{softplus}(x) = \ln(e^x+1)\$&lt;/span&gt;,&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$\mathrm{leaky-relu}_\alpha(x) = \begin{cases}&#xA;x &amp;amp; \text{, if } x &amp;lt; 0 \\&#xA;\alpha \cdot x &amp;amp; \text{, otherwise}&#xA;\end{cases}\$&lt;/span&gt;,&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$\tanh(x)\$&lt;/span&gt;,&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$\mathrm{sigmoid}(x) = \frac{e^x}{e^x+1}\$&lt;/span&gt;,&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$\mathrm{hard-sigmoid}(x) = \begin{cases}&#xA;0 &amp;amp; \text{, if } x &amp;lt; -2.5 \\&#xA;1 &amp;amp; \text{, if } x &amp;gt; 2.5 \\&#xA;0.2 \cdot x + 0.5 &amp;amp; \text{, otherwise}&#xA;\end{cases}\$&lt;/span&gt;,&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$e^x\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;must take a single entry of the (preprocessed) training set as its only input and &lt;/li&gt;&#xA;&lt;li&gt;return the predicted label, in the format you've specified, as its only output,&lt;/li&gt;&#xA;&lt;li&gt;if a given weight occurs multiple times in your model, you may reuse it to lower your overall score,&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your answer must include (or link to) all code necessary to check your results -- including the trained weights of your model. In particular, you must include all preprocessing steps of your dataset.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The neural network with the &lt;em&gt;smallest number of weights&lt;/em&gt; (including bias weights) wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Parameters used to preprocess your data don't count as weights.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Enjoy!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Baseline&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There is a &lt;a href=&quot;https://www.tensorflow.org/tutorials/keras/basic_classification&quot; rel=&quot;nofollow noreferrer&quot;&gt;tutorial for the Fashion MNIST dataset available on Tensorflow&lt;/a&gt; which serves as an excellent starting point if you decide to use TF as your framework.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This challenge had already been posted on the main site and got closed there. The purpose of this post is threefold:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Is the community interested in this particular (and this kind of) challenge (in general)?&lt;/li&gt;&#xA;&lt;li&gt;How can the user experience for the target audience be improved? Specifically:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What are likely causes of confusion?&lt;/li&gt;&#xA;&lt;li&gt;Can we streamline the structure?&lt;/li&gt;&#xA;&lt;li&gt;Are some of the rules too restrictive or not restrictive enough?&lt;/li&gt;&#xA;&lt;li&gt;Are there any loopholes I've overlooked? (For instance, preprocessing the training data opens up the possibility of encoding labels into the feature set. Some of the rules are already designed to prohibit this but it's entirely possible that they don't suffice.)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Any other constructive feedback?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="87615" LastActivityDate="2019-07-04T15:10:49.147" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="17856" PostTypeId="2" ParentId="2140" CreationDate="2019-07-05T02:52:33.663" Score="2" Body="&lt;blockquote&gt;&#xA;  &lt;h2&gt;Sandbox Notes&lt;/h2&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Any other/better tags?&lt;/li&gt;&#xA;  &lt;li&gt;Is my math right?&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;Knot Function&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/knot-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;knot-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;knot-theory&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;TL;DR:&lt;/strong&gt; Define a closed curve in 3D space that forms a knot.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A function &lt;span class=&quot;math-container&quot;&gt;\$f : [0,1] \to \mathbb R^3\$&lt;/span&gt; is considered a &lt;em&gt;loop function&lt;/em&gt; if the following conditions hold:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is continuous.&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$f(0) = f(1)\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;It is injective everywhere else.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Intuitively, this means that the function traces out a curve in 3D space that does not intersect itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let the set of loop functions be denoted &lt;span class=&quot;math-container&quot;&gt;\$\text{Loop}\$&lt;/span&gt;. One such function is &lt;span class=&quot;math-container&quot;&gt;\$\text{circle}(t) = (0, \sin 2\pi t, \cos 2\pi t)\$&lt;/span&gt;, which traces out a circle in 3D space.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A function &lt;span class=&quot;math-container&quot;&gt;\$f : \text{Loop}\$&lt;/span&gt; is considered a &lt;em&gt;knot function&lt;/em&gt; if there exists no continuous function &lt;span class=&quot;math-container&quot;&gt;\$d : [0,1] \to \text {Loop}\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$d(0) = f\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$d(1) = \text{circle}\$&lt;/span&gt;. Intuitively, this means that the loop that the function traces out cannot be continuously deformed into a circle without intersecting itself.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that implements a knot function, where real numbers are replaced with (to best approximation) floating point numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest valid answer (measured in bytes) wins.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="61384" LastEditDate="2019-07-11T22:13:16.580" LastActivityDate="2019-07-11T22:13:16.580" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17857" PostTypeId="2" ParentId="2140" CreationDate="2019-07-06T10:25:20.400" Score="0" Body="&lt;h2&gt;Calculate a constant from its characteristic function&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You are given in some language-dependent way (e.g. a lambda parameter) a characteristic function which is basically another way of saying a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; function. This function will take an integer input and return &lt;code&gt;true&lt;/code&gt; or &lt;code&gt;false&lt;/code&gt;, or &lt;code&gt;1&lt;/code&gt; or &lt;code&gt;0&lt;/code&gt;, or any other two 1-byte values of your choice. You can decide whether you need the function to be 0-indexed or 1-indexed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your job is then to take this function and calculate the floating-point value obtained by interpreting the values of this function as a binary fraction. You must use as many significant digits as possible. I will assume IEEE double precision by default but you many use single precision if your language specifically supports it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if a function returns the sequence &lt;code&gt;0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0&lt;/code&gt; (this is OEIS A010051), then your program or function will output &lt;code&gt;0.41468250985111166&lt;/code&gt; as any further terms will be less than the precision of a double-precision value.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can decide whether you want to round the 54th significant bit up or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2019-07-06T10:25:20.400" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17858" PostTypeId="1" AcceptedAnswerId="17860" CreationDate="2019-07-07T06:21:58.923" Score="3" ViewCount="193" Body="&lt;p&gt;This site gives one more reputation to specific &lt;code&gt;-1&lt;/code&gt;-voted questions. (This is the formula that I tried myself: &lt;code&gt;2 downvotes + 1 upvote = 1 more reputation&lt;/code&gt;. Two downvotes is -4 reputation, and 1 upvote is +5 reputation.) Using this formula, people could (slowly) get more reputation despite that their problems are badly made.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this characteristic an intended behavior for Code Golf? Can this bad-question-gaining-reputation be avoided?&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastEditorUserId="68942" LastEditorDisplayName="user85052" LastEditDate="2021-06-02T00:33:25.037" LastActivityDate="2021-06-02T00:33:25.037" Title="2 downvotes + 1 upvote = 1 more reputation" Tags="|discussion|support|status-bydesign|voting|reputation|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17859" PostTypeId="2" ParentId="17858" CreationDate="2019-07-07T06:50:04.713" Score="2" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Is this characteristic an intended behavior for Code Golf?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/whats-reputation&quot;&gt;Yes:&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;You gain reputation when:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;question is voted up: +5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;  &#xA;  &lt;p&gt;(…)&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;You lose reputation when:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;your question is voted down: −2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2019-07-07T06:50:04.713" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17860" PostTypeId="2" ParentId="17858" CreationDate="2019-07-07T22:18:57.543" Score="10" Body="&lt;h2&gt;Reddit karma is +1/-1. Why should SE rep be +10/-2?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In short, the voting and reputation structure are optimized for a Q/A site rather than a system that ranks popular opinions.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;There is asymmetry in the meaning of upvotes and downvotes&lt;/strong&gt;. The value of a Q/A site is how many people find a post useful, so upvotes should be a fundamental metric for the value of a question, and downvotes merely a tool to incentivize high quality.  From our help center:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Voting up a question or answer signals to the rest of the community that a post is interesting, well-researched, and useful, while voting down a post signals the opposite: that the post contains wrong information, is poorly researched, or fails to communicate information.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Upvoting and downvoting would be symmetrical if we only downvoted posts that were actively anti-useful i.e. wrong and misleading. But we downvote more than that, because questions and answers are often unclear or poorly constructed.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Due to the higher effort put into each post, being downvoted here hurts significantly more (at least to me!) than it does on other sites. So as not to discourage users from posting, so we ease the pain by reducing the reputation impact of downvotes.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;Reputation is tied to privileges, and it's wrong to exclude users who have controversial questions from the full experience of the site (commenting, seeing vote counts, etc.).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;CG.SE is not exactly a Q/A site like the rest of SE, but these points still apply.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, please don't deliberately post poor questions to attract downvotes to test something. We're friendly and have a &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;chat&lt;/a&gt; to ask about such things.&lt;/p&gt;&#xA;" OwnerUserId="39328" LastActivityDate="2019-07-07T22:18:57.543" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17862" PostTypeId="1" CreationDate="2019-07-08T11:13:17.193" Score="4" ViewCount="103" Body="&lt;p&gt;There's an old (2014y) conversation about this: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1315/lets-design-a-nice-badge-icon&quot;&gt;Let&amp;#39;s design a nice badge icon!&lt;/a&gt;, but without any real outcome.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, quite recently we got a new site design, including our new logo:&#xA;&lt;img src=&quot;https://cdn.sstatic.net/Sites/codegolf/img/logo.svg&quot; alt=&quot;&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For me it looks like pretty good candidate for badge icon, because, you know, it's a medal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Possible modifications:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Cut a strip a little bit (get rid of horizontal part).&lt;/li&gt;&#xA;&lt;li&gt;Remove strip completely (and left only medal itself).&lt;/li&gt;&#xA;&lt;li&gt;Make strip white (like done on meta).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;What do you think about this idea?&lt;/p&gt;&#xA;" OwnerUserId="59169" LastEditorUserId="68942" LastEditDate="2021-06-02T00:30:48.893" LastActivityDate="2021-06-02T00:30:48.893" Title="New badges for new design" Tags="|feature-request|status-completed|badges|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17863" PostTypeId="2" ParentId="17862" CreationDate="2019-07-08T11:43:08.490" Score="6" Body="&lt;h1&gt;I like option 2.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;And actually, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17778/43319&quot;&gt;it is already supposed to be so&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2019-07-08T16:01:04.013" LastActivityDate="2019-07-08T16:01:04.013" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17864" PostTypeId="1" CreationDate="2019-07-08T15:38:17.557" Score="2" ViewCount="78" Body="&lt;p&gt;I wrote a Python 3 answer. I called it Python 3 in the title; however, it works equally well in Python 2. I discovered that I am able to remove several bytes from the answer, but only if I use Python 2 instead of 3. Is it acceptable to change the answer from Python 3 to Python 2, or should I post a new answer?&lt;/p&gt;&#xA;" OwnerUserId="87771" LastActivityDate="2019-07-09T07:42:01.943" Title="Can I change the version of the language in my answer (Python 3 to 2), or do I post a new answer?" Tags="|discussion|answers|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17865" PostTypeId="2" ParentId="17864" CreationDate="2019-07-08T15:47:36.387" Score="2" Body="&lt;h2&gt;Either one is acceptable&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I've personally done both of these things it really is up to you.  An additional option is to have one answer with both the python 2 and 3 versions in it labelled separately with a bit of explanaiton.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want help deciding which to do I would recommend doing a new answer if you feel the the golf is substantially different (a rather subjective metric).&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2019-07-08T15:47:36.387" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17866" PostTypeId="2" ParentId="2140" CreationDate="2019-07-08T19:04:39.507" Score="1" Body="&lt;p&gt;Posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/188005/print-the-last-middle-and-first-character-of-your-code&quot;&gt;here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2019-07-09T18:53:03.740" LastActivityDate="2019-07-09T18:53:03.740" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17867" PostTypeId="2" ParentId="2140" CreationDate="2019-07-08T20:26:53.797" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Make a bigger number&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each answer on this question must be a complete program (not a function) that outputs a positive integer in decimal (trailing newlines are permitted).  Output should be either passed to STDOUT or displayed on the screen.  The output number must also be larger than all the numbers output by all the valid answers at the time of posting.  One person may not post two consecutive answers.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your answer will be scored with the following formula&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\dfrac{B'+1}{B+1}\$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Where &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; is the number of bytes in your answer and &lt;span class=&quot;math-container&quot;&gt;\$B'\$&lt;/span&gt; is the number of bytes in the longest answer before your answer posted by someone other than yourself.  Lower scores will be better.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2019-07-09T21:12:58.030" LastActivityDate="2019-07-09T21:12:58.030" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="17868" PostTypeId="2" ParentId="2140" CreationDate="2019-07-08T21:13:42.553" Score="1" Body="&lt;h1&gt;There's an echo in my array... echo in my array... my array...&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/188177/theres-an-echo-in-my-array-echo-in-my-array-my-array&quot;&gt;Posted&lt;/a&gt;.  Thanks for all of the suggestions and happy golfing!&lt;/p&gt;&#xA;" OwnerUserId="84624" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-07-10T19:42:32.623" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="17870" PostTypeId="2" ParentId="2140" CreationDate="2019-07-08T22:53:33.670" Score="2" Body="&lt;h1&gt;Multi-Digit × Single-Digit Checker &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;The story below is fictional, don't worry.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Times table hard. More curriculum. Class advance. Son behind. Horror. Help.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;ahem&lt;/em&gt; Pardon me.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So... I've got a big problem. The times table is huge, and all the mnemonic rules we've taught our son haven't make him fully memorize it yet. However, his class must advance to the next chapter, long multiplication. As a result, he is prone to making many mistakes while multiplying numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See, they're already making the students multiply a multi-digit number by a single-digit number. My son often forgets to carry digits over and, of course, his times table. The good thing is that he never misses digits!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The situation is awful. Help me before they start with two multi-digit numbers!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your challenge is to write a program that takes a multiplier, a multiplicand and a product, and analyzes the product for any of the following mistakes. Here's how:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a digit is the correct ones digit of the product of the multiplicand times the digit of the multiplier he's currently multiplying, but a non-zero carryover was supposed to be added to it, then this digit has a &lt;strong&gt;carryover error&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If a digit is otherwise wrong, there's a times table error around it (we can't be sure if the ones digit was wrong or a carryover digit was wrong), so it has a &lt;strong&gt;times table error&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;There will never be another kind of mistake in the product, my son doesn't skip digits.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For each wrong digit, return an array of two or three elements:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Position of the digit from the left or right, 0- or 1-indexed (your choice must be consistent). Keep in mind that, if the leftmost digit is absent due to a carryover error, then it's still the leftmost digit and the place has the relevant index.&lt;/li&gt;&#xA;&lt;li&gt;Correct carryover, if the mistake was a carryover error, or omitted otherwise. You may also put a &lt;code&gt;0&lt;/code&gt; instead of omitting the element (you can't blame my son for forgetting to add a zero carryover!), but be consistent.&lt;/li&gt;&#xA;&lt;li&gt;Correct digit.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The numbers will all be positive integers.&lt;/li&gt;&#xA;&lt;li&gt;The multiplicand will be an integer from 1 to 9, inclusive.&lt;/li&gt;&#xA;&lt;li&gt;You can get the three numbers via any &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/41024&quot;&gt;reasonable way&lt;/a&gt; you want.&lt;/li&gt;&#xA;&lt;li&gt;The output can be in any order, as can the elements of each array, as long as the latter is consistent.&lt;/li&gt;&#xA;&lt;li&gt;You may not make use of any &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/41024&quot;&gt;standard loophole&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, so the shortest answer, measured in bytes, wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Multiplier, Multiplicand, Product -&amp;gt; Mistakes (0-indexed from the left, possibly absent carryover)&#xA;&#xA;5, 3, 15 -&amp;gt; [] (15)&#xA;3, 5, 5 -&amp;gt; [[0, 1, 1]] (05 -&amp;gt; 15)&#xA;7, 3, 31 -&amp;gt; [[0, 2]] (31 -&amp;gt; 21)&#xA;1551, 9, 4959 -&amp;gt; [[0, 1, 1], [1, 4, 3]] (04959 -&amp;gt; 14959 -&amp;gt; 13959)&#xA;2121, 7, 14847 -&amp;gt; [] (14847)&#xA;2121, 7, 4727 -&amp;gt; [[0, 1, 1], [2, 1, 8], [3, 4]] (04727 -&amp;gt; 14727 -&amp;gt; 14827 -&amp;gt; 14847)&#xA;33333, 9, 11111 -&amp;gt; [[0, 2, 2], [1, 9], [2, 9], [3, 9], [4, 9], [5, 7]] (011111 -&amp;gt; 211111 -&amp;gt; 291111 -&amp;gt; 299111 -&amp;gt; 299911 -&amp;gt; 299991 -&amp;gt; 299997)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the challenge unclear?&lt;/li&gt;&#xA;&lt;li&gt;Is the output format weird or too strict?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2019-07-10T17:49:16.820" LastActivityDate="2019-07-10T17:49:16.820" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17871" PostTypeId="2" ParentId="17864" CreationDate="2019-07-09T07:42:01.943" Score="2" Body="&lt;h1&gt;The choice is up to you&lt;/h1&gt;&#xA;&lt;p&gt;I usually change the version personally. I don't program in Python that often, but for Java 8/10/11 it's similar. I usually use the header Java 8 if it doesn't use any &lt;code&gt;var&lt;/code&gt; from Java 10, or &lt;code&gt;.repeat&lt;/code&gt; from Java 11. If I do end up using those later on in the golfing process, I simply change the version to 10/11 respectively. I could of course just have a header &lt;strong&gt;Java&lt;/strong&gt;, but I usually use the lowest version required for my function/program.&lt;/p&gt;&#xA;&lt;p&gt;Although I don't program that often in Python, it's similar. Usually Python 2 is shorter in my experience, due to &lt;code&gt;print ...;&lt;/code&gt; in Python 2 vs &lt;code&gt;print(...);&lt;/code&gt; in Python 3, or because a mixture of spaces and tabs can be used for code-indentation, for which only one of the two is allowed for Python 3. Python is mainly strong in the added builtin that Python 2 lacks (and Python 3.8 is from what I've seen thus far even shorter in most cases). I don't see any problem in changing the language to/from a different Python version in that case.&lt;/p&gt;&#xA;&lt;p&gt;If they are substantially different you could also add both versions to your answer, and maybe explain why the code is shorter in one Python version in comparison to the other. Something in the lines of this below for example:&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Python 2, &lt;s&gt;321&lt;/s&gt; 123 bytes&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;code here&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;-X bytes by switching from Python 3 to 2, allowed me to golf A and B. Initial Python 3 answer can be seen below.&lt;/p&gt;&#xA;&lt;p&gt;TIO-link here.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Explanation:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;# explanation here&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Old Python 3 answer:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;code here&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;TIO-link here.&lt;/p&gt;&#xA;" OwnerUserId="52210" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-07-09T07:42:01.943" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17872" PostTypeId="2" ParentId="2140" CreationDate="2019-07-09T18:58:11.840" Score="3" Body="&lt;h1&gt;How long's left? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/word&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;word&amp;#39;&quot; rel=&quot;tag&quot;&gt;word&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/text-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;text-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;text-processing&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/188306/how-longs-left&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="85546" LastEditorUserId="85546" LastEditDate="2019-07-18T08:01:51.163" LastActivityDate="2019-07-18T08:01:51.163" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17873" PostTypeId="2" ParentId="2140" CreationDate="2019-07-10T05:53:54.773" Score="1" Body="&lt;h2&gt;Story&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I began studying the &lt;a href=&quot;https://en.wikipedia.org/wiki/Collatz_conjecture&quot; rel=&quot;nofollow noreferrer&quot;&gt;Collatz Conjecture&lt;/a&gt;  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;And noticed this pattern in the numbers that go to 1 in one odd step, like 5,10,20,21,40,42... and looke in up on &lt;a href=&quot;https://oeis.org/A055086&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS&lt;/a&gt; and found this formula.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$floor(sqrt(4*n + 1)) - 1\$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Which can plot these numbers in their natural order like so;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\frac{\left(8\cdot2^{\operatorname{floor}\left(\sqrt{4\operatorname{floor}\left(x\right)+1}\right)}-2^{\left(\operatorname{floor}\left(\sqrt{4\operatorname{floor}\left(x\right)+1}\right)-1-\operatorname{floor}\left(\frac{\left(4\operatorname{floor}\left(x\right)+1-\operatorname{floor}\left(\sqrt{4\operatorname{floor}\left(x\right)+1}\right)^2\right)}{2}\right)\right)}\right)}{3}\$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then I looked at numbers going to 1 in two steps, like 3,6,12,13,24,26...&lt;br&gt;&#xA;Where I found another pattern that I could not find a formula for on OEIS&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;long nth(int n){if(n&amp;gt;241)return -1;return (((1&amp;lt;&amp;lt;Y[n]+5)-(1&amp;lt;&amp;lt;1+Y[n]-((Z[n]&amp;amp;1)+Z[n]*3)))/3-(1&amp;lt;&amp;lt;Y[n]-2*X[n]-(2*(Z[n]&amp;amp;1)+Z[n]*3)))/3;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;With &lt;code&gt;X[],Y[] and Z[]&lt;/code&gt; being these lookup-tables  &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; int[]X=new int[]{&#xA; 0, &#xA; 0, &#xA; 0,  1, &#xA; 0,  1, &#xA; 0,  1,  2, &#xA; 0,  1,  2,                              0,&#xA; 0,  1,  2,  3,                          0,                          0, &#xA; 0,  1,  2,  3,                          0,  1,                      0, &#xA; 0,  1,  2,  3,  4,                      0,  1,                      0,  1, &#xA; 0,  1,  2,  3,  4,                      0,  1,  2,                  0,  1, &#xA; 0,  1,  2,  3,  4,  5,                  0,  1,  2,                  0,  1,  2,&#xA; 0,  1,  2,  3,  4,  5,                  0,  1,  2,  3,              0,  1,  2,                  0,&#xA; 0,  1,  2,  3,  4,  5,  6,              0,  1,  2,  3,              0,  1,  2,  3,              0,              0, &#xA; 0,  1,  2,  3,  4,  5,  6,              0,  1,  2,  3,  4,          0,  1,  2,  3,              0,  1,          0, &#xA; 0,  1,  2,  3,  4,  5,  6,  7,          0,  1,  2,  3,  4,          0,  1,  2,  3,  4,          0,  1,          0,  1, &#xA; 0,  1,  2,  3,  4,  5,  6,  7,          0,  1,  2,  3,  4,  5,      0,  1,  2,  3,  4,          0,  1,  2,      0,  1, &#xA; 0,  1,  2,  3,  4,  5,  6,  7,  8,      0,  1,  2,  3,  4,  5,      0,  1,  2,  3,  4,  5,      0,  1,  2,      0,  1,  2, &#xA; 0,  1,  2,  3,  4,  5,  6,  7,  8,      0,  1,  2,  3,  4,  5,  6,  0,  1,  2,  3,  4,  5,      0,  1,  2,  3,  0,  1,  2,      0, &#xA; 0,  1,  2,  3,  4,  5,  6,  7,  8,  9,  0,  1,  2,  3,  4,  5,  6,  0,  1,  2,  3,  4,  5,  6,  0,  1,  2,  3,  0,  1,  2,  3,  1, 2&#xA; };&#xA; int[]Y=new int[]{&#xA; 0, &#xA; 1, &#xA; 2,  2, &#xA; 3,  3, &#xA; 4,  4,  4, &#xA; 5,  5,  5,                              5,&#xA; 6,  6,  6,  6,                          6,                          6, &#xA; 7,  7,  7,  7,                          7,  7,                      7, &#xA; 8,  8,  8,  8,  8,                      8,  8,                      8,  8, &#xA; 9,  9,  9,  9,  9,                      9,  9,  9,                  9,  9, &#xA;10, 10, 10, 10, 10, 10,                 10, 10, 10,                 10, 10, 10,&#xA;11, 11, 11, 11, 11, 11,                 11, 11, 11, 11,             11, 11, 11,                 11,&#xA;12, 12, 12, 12, 12, 12, 12,             12, 12, 12, 12,             12, 12, 12, 12,             12,             12, &#xA;13, 13, 13, 13, 13, 13, 13,             13, 13, 13, 13, 13,         13, 13, 13, 13,             13, 13,         13, &#xA;14, 14, 14, 14, 14, 14, 14, 14,         14, 14, 14, 14, 14,         14, 14, 14, 14, 14,         14, 14,         14, 14, &#xA;15, 15, 15, 15, 15, 15, 15, 15,         15, 15, 15, 15, 15, 15,     15, 15, 15, 15, 15,         15, 15, 15,     15, 15, &#xA;16, 16, 16, 16, 16, 16, 16, 16, 16,     16, 16, 16, 16, 16, 16,     16, 16, 16, 16, 16, 16,     16, 16, 16,     16, 16, 16, &#xA;17, 17, 17, 17, 17, 17, 17, 17, 17,     17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,     17, 17, 17, 17, 17, 17, 17,     17, &#xA;18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18&#xA;};&#xA;int[]Z=new int[]{&#xA;0, &#xA;0, &#xA;0,  0, &#xA;0,  0, &#xA;0,  0,  0, &#xA;0,  0,  0,                              1,&#xA;0,  0,  0,  0,                          1,                          2, &#xA;0,  0,  0,  0,                          1,  1,                      2, &#xA;0,  0,  0,  0,  0,                      1,  1,                      2,  2, &#xA;0,  0,  0,  0,  0,                      1,  1,  1,                  2,  2, &#xA;0,  0,  0,  0,  0,  0,                  1,  1,  1,                  2,  2,  2,&#xA;0,  0,  0,  0,  0,  0,                  1,  1,  1,  1,              2,  2,  2,                  3,&#xA;0,  0,  0,  0,  0,  0,  0,              1,  1,  1,  1,              2,  2,  2,  2,              3,              4, &#xA;0,  0,  0,  0,  0,  0,  0,              1,  1,  1,  1,  1,          2,  2,  2,  2,              3,  3,          4, &#xA;0,  0,  0,  0,  0,  0,  0,  0,          1,  1,  1,  1,  1,          2,  2,  2,  2,  2,          3,  3,          4,  4, &#xA;0,  0,  0,  0,  0,  0,  0,  0,          1,  1,  1,  1,  1,  1,      2,  2,  2,  2,  2,          3,  3,  3,      4,  4, &#xA;0,  0,  0,  0,  0,  0,  0,  0,  0,      1,  1,  1,  1,  1,  1,      2,  2,  2,  2,  2,  2,      3,  3,  3,      4,  4,  4, &#xA;0,  0,  0,  0,  0,  0,  0,  0,  0,      1,  1,  1,  1,  1,  1,  1,  2,  2,  2,  2,  2,  2,      3,  3,  3,  3,  4,  4,  4,      5, &#xA;0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  1,  1,  1,  1,  1,  1,  1,  2,  2,  2,  2,  2,  2,  2,  3,  3,  3,  3,  4,  4,  4,  4,  5, 5&#xA;};&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The challenge is to write a &quot;reasonably fast&quot; function or expression that replaces and extends these lookup tables.&lt;br&gt;&#xA;Think of the lookup tables as a 3D structure.&#xA;Pictured is the top 720 boxes of this structure.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ZMois.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZMois.png&quot; alt=&quot;challenge&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An integer which is the index of a cube in the structure.&#xA;You can assume the input will be in the range 0 to 719 inclusive.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The x,y,z coordinates for the given index.&#xA;Assuming the input is between 0 and 719 the output ranges are&#xA;    x, 0 to 13&#xA;    y, 0 to 27&#xA;    z, 0 to 8&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's fine to accept and return larger indexes correctly just not required.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;    i  -&amp;gt;   x   y   z&#xA;    0  -&amp;gt;   0,  0,  0&#xA;   12  -&amp;gt;   0,  5,  1&#xA;   30  -&amp;gt;   4,  8,  0&#xA;   65  -&amp;gt;   2, 11,  1&#xA;  100  -&amp;gt;   0, 13,  2&#xA;  270  -&amp;gt;   1, 19,  3&#xA;  321  -&amp;gt;   1, 20,  6&#xA;  719  -&amp;gt;   1, 27,  8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If you collapse the z-coordinate, then the structure is indexed top-down left right like shown below; Examples are marked in square brackets []&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Y,Z 0,&#xA; 0   | [0]  &#xA; 1   |  1 &#xA; 2   |  2   3 &#xA; 3   |  4   5 &#xA; 4   |  6   7   8                                1,&#xA; 5   |  9  10  11                                 |[12]                           2,&#xA; 6   | 13  14  15  16                             | 17                             | 18 &#xA; 7   | 19  20  21  22                             | 23  24                         | 25 &#xA; 8   | 26  27  28  29 [30]                        | 31  32                         | 33  34 &#xA; 9   | 35  36  37  38  39                         | 40  41  42                     | 43  44 &#xA;10   | 45  46  47  48  49  50                     | 51  52  53                     | 54  55  56                    3,&#xA;11   | 57  58  59  60  61  62                     | 63  64 [65] 66                 | 67  68  69                     | 70                4,&#xA;12   | 71  72  73  74  75  76  77                 | 78  79  80  81                 | 82  83  84  85                 | 86                 | 87 &#xA;13   | 88  89  90  91  92  93  94                 | 95  96  97  98  99             [100] 101 102 103                |104 105             |106 &#xA;14   |107 108 109 110 111 112 113 114             |115 116 117 118 119             |120 121 122 123 124             |125 126             |127 128 &#xA;15   |129 130 131 132 133 134 135 136             |137 138 139 140 141 142         |143 144 145 146 147             |148 149 150         |151 152 &#xA;16   |153 154 155 156 157 158 159 160 161         |162 163 164 165 166 167         |168 169 170 171 172 173         |174 175 176         |177 178 179        5,&#xA;17   |180 181 182 183 184 185 186 187 188         |189 190 191 192 193 194 195     |196 197 198 199 200 201         |202 203 204 205     |206 207 208         |209    6, &#xA;18   |210 211 212 213 214 215 216 217 218 219     |220 221 222 223 224 225 226     |227 228 229 230 231 232 233     |234 235 236 237     |238 239 240 241     |242     |243 &#xA;19   |244 245 246 247 248 249 250 251 252 253     |254 255 256 257 258 259 260 261 |262 263 264 265 266 267 268     |269[270]271 272 273 |274 275 276 277     |278 279 |280&#xA;20   |281 282 283 284 285 286 287 288 289 290 291 |292 293 294 295 296 297 298 299 |300 301 302 303 304 305 306 307 |308 309 310 311 312 |313 314 315 316 317 |318 319 |320[321]&#xA;  X-&amp;gt;|  0   1   2   3   4   5   6   7   8   9  10 |  0   1   2   3   4   5   6   7 |  0   1   2   3   4   5   6   7 |  0   1   2   3   4 |  0   1   2   3   4 |  0   1 |  0   1  &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that at even y-coordinates the structure expands in the x-direction,&#xA;and at 0 and 5 mod 6 in the z-direction.&#xA;Expect for the very top block.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is code-golf, the shortest code in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Reasonably fast&lt;/strong&gt;&#xA;As an additional requirement although not a competition of fastest code,&lt;br&gt;&#xA;the code must still be shown to compute coordinates in a reasonable amount of time.&#xA;You may for example use try it online and run a loop through all coordinates under 720 without exceeding the time limit of a minute, printing is optional.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you fail this rule, mark your answer with non competing&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;storing information as you go&quot; is forbidden.&#xA;For example executing f(100) should not depend on having computed f(99) previously.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lookup tables are allowed but included in bytecount so aim to make them sparse if you choose to use them.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Example code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;non-competing&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;coord coords(int index){&#xA;int a=0,b=0,c=0;&#xA;int x=0,y=0,z=0;&#xA;long n,k,one;  &#xA;n = k = 3;&#xA;int t=0;&#xA;while(t&amp;lt;index){&#xA;int s=0;k++;n=k;&#xA;while(n&amp;gt;1 &amp;amp;&amp;amp; s&amp;lt;4){ n/=n&amp;amp;-n;n=n*3+1; n/=n&amp;amp;-n;s++;}&#xA;if(s==2)t++;&#xA;}&#xA;n=k; &#xA;one=n&amp;amp;-n;k = one;while(k&amp;gt;1){k&amp;gt;&amp;gt;=1;c++;} n=3*n+one;&#xA;one=n&amp;amp;-n;k = one;while(k&amp;gt;1){k&amp;gt;&amp;gt;=1;b++;} n=3*n+one;&#xA;one=n&amp;amp;-n;k = one;while(k&amp;gt;1){k&amp;gt;&amp;gt;=1;a++;} &#xA;coord r;&#xA;r.x = (b-c-1)&amp;gt;&amp;gt;1;&#xA;r.y = a-5;&#xA;r.z = (a-b-2)/6 +(a-b-4)/6;&#xA;return r;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##nZJNboMwEIX3OcWIqhEESEOStgtjn6QbMJBYpEMERuVHnD0d45JWXVVFjGV/fm9mZFuGJylvDwrlpc1yiBudqWp7FivdX/MsL6DRdSs1yKqqMxgVauiCPhjYZBG72Z15bFyzrzDLO29cAX1mnfBdkFJIvmN32BHoKYYFXio8AQZlUGHOAGaGwKGkOHz79KL/OKtL7ur4d7WGBKXvM@TlTyGKCNZraOKjNwI@cVyHSBrcHPyI3UFDxsmmKtyG872niczAYpPV9kZtWo9p0PRs65Qi8sZSCB4xaZKR47BB3wj@aEv/Z0tm2yy2N1JbZ73tyOKmoQwjT4hooT3RJHxeloMRJWEa7r2nF/Dn6ZGmX/u5bms0KaebOeT3RKFLh36vdG114zoKQgEd9DA4HlsVVW3fA92IiuF1vwOmfJ9sNRVbHgwJrzXJCtd5zIyfxvl/QydQAbVP0VMMpJyo/ic&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="75884" LastEditorUserId="75884" LastEditDate="2019-07-11T19:27:57.173" LastActivityDate="2019-07-11T19:27:57.173" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17876" PostTypeId="2" ParentId="2140" CreationDate="2019-07-11T21:24:13.563" Score="2" Body="&lt;p&gt;Posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/188510/draw-recam%C3%A1ns-sequence-with-ascii?noredirect=1#comment451725_188510&quot;&gt;here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="85546" LastEditorUserId="85546" LastEditDate="2019-07-18T19:10:01.773" LastActivityDate="2019-07-18T19:10:01.773" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17878" PostTypeId="1" CreationDate="2019-07-12T13:48:38.570" Score="9" ViewCount="250" Body="&lt;p&gt;It looks like the image that is supposed to show up in the &lt;a href=&quot;https://codegolf.stackexchange.com/404&quot;&gt;404 error page&lt;/a&gt; has...itself gone 404, and shows a broken image.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It looks like it's trying to load the image from &lt;a href=&quot;https://cdn.sstatic.net/Sites/codegolf/img/404.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://cdn.sstatic.net/Sites/codegolf/img/404.png&lt;/a&gt;, but that link is 404 (as of right now).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Per MEE's comment, it looks like the &lt;a href=&quot;https://codegolf.stackexchange.com/error&quot;&gt;500 server error page&lt;/a&gt; and the &lt;a href=&quot;https://codegolf.stackexchange.com/captcha&quot;&gt;captcha page&lt;/a&gt; are also serving 404 images.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can this please be fixed? (Also, can someone please create the &lt;a href=&quot;/questions/tagged/404-not-found&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;404-not-found&amp;#39;&quot; rel=&quot;tag&quot;&gt;404-not-found&lt;/a&gt; tag on this site, as it doesn't exist, and there don't seem to be any relevant tags other than the required tag to use?)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Update:&lt;/strong&gt; It seems that the broken image was manually resolved by changing the URL of the loaded image to the same one used on beta and non-designed sites, i.e. &lt;a href=&quot;https://cdn.sstatic.net/Sites/beta/img/404.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://cdn.sstatic.net/Sites/beta/img/404.png&lt;/a&gt;. However, the site-specific 404 image, linked above, is still broken. Is this site not going to get a uniquely-designed 404 error page as part of its design?&lt;/p&gt;&#xA;" OwnerUserId="82075" LastEditorUserId="66833" LastEditDate="2023-08-26T17:56:26.920" LastActivityDate="2023-08-26T17:56:26.920" Title="404 Not Found image is itself 404" Tags="|bug|status-completed|404-page|" AnswerCount="0" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17879" PostTypeId="2" ParentId="2140" CreationDate="2019-07-12T23:10:05.163" Score="3" Body="&lt;h1&gt;Too many spies&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You are fighting an extensive network of enemy &lt;strong&gt;spies&lt;/strong&gt;. You know that each spy has at least one (sometimes multiple) &lt;strong&gt;fake identities&lt;/strong&gt; they like to use. You'd really like to know how many spies you're actually dealing with.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Luckily, your counter-intelligence &lt;strong&gt;agents&lt;/strong&gt; are doing their job and can &lt;em&gt;sometimes&lt;/em&gt; figure out when two fake identities are actually controlled by the same enemy spy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That is to say:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your agents don't always know when two fake identies have the same spy behind them, however&lt;/li&gt;&#xA;&lt;li&gt;If an agent tells you two fake identities are controlled by the same spy, you trust they are right.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Agent messages&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Agents send you cryptic messages telling you which identities have the same spy behind them. An example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You have &lt;strong&gt;2 agents&lt;/strong&gt; and &lt;strong&gt;5 fake identities&lt;/strong&gt; to deal with.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first agent sends you a message:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Red Red Blue Orange Orange&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This means they think there are 3 spies:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the first one (Red) controlls identities 1 and 2&lt;/li&gt;&#xA;&lt;li&gt;the second one (Blue) controlls identity 3&lt;/li&gt;&#xA;&lt;li&gt;the third one (Orange) controlls identities 4 and 5&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The second agent sends you a message:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;cat dog dog bird fly&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This means they think there are 4 spies:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the first one (cat) controlls identitiy 1&lt;/li&gt;&#xA;&lt;li&gt;the second one (dog) controlls identities 2 and 3&lt;/li&gt;&#xA;&lt;li&gt;the third one (bird) controlls identity 4&lt;/li&gt;&#xA;&lt;li&gt;the fourth one (fly) controlls identity 5&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Compiling the intel we see:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Identities:   id1    id2    id3    id4    id5 &#xA;Agent 1:    |--same-spy--|       |--same-spy--|&#xA;Agent 2:           |--same-spy--|&#xA;Conclusion: |-----same-spy------||--same-spy--|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This means there are at most &lt;strong&gt;2 spies&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Notes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Identities owned by the same spy do not have to be consecutive, i.e. a message like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;dog cat dog&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is valid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, the same word might be used by two different agents - that does not mean anything, it's just a coincidence, e.g.:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Agent 1: Steam Water Ice&#xA;Agent 2: Ice Ice Baby&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Ice is used by both agents - the &lt;code&gt;Ice&lt;/code&gt; used by the first agent is unrelated to the two occurences of &lt;code&gt;Ice&lt;/code&gt; used by the second agent.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Compile all your agents' intel and figure out how many enemy spies there really are. (To be more precise, get the lowest upper bound, given the limited information you have.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The shortest code in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input and Output spec&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The input is a list of n lines, which represent n messages from agents.&#xA;Each line consists of k space-separated tokens, same k for all lines. Tokens are alphanumeric, arbitrary length. Case matters.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output should be a single number, representing the number of distinct spies, based on your agents' intel.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Example 1&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Angel Devil Angel Joker Thief Thief&#xA;Ra Ra Ras Pu Ti N&#xA;say sea c c see cee&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Example 2&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Blossom Bubbles Buttercup&#xA;Ed Edd Eddy&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Example 3&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Botswana Botswana Botswana&#xA;Left Middle Right&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Example 4&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Black White&#xA;White Black&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="87549" LastEditorUserId="87549" LastEditDate="2019-07-12T23:40:38.100" LastActivityDate="2019-07-12T23:40:38.100" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17880" PostTypeId="2" ParentId="2140" CreationDate="2019-07-13T04:09:55.813" Score="-2" Body="&lt;h1&gt;Best Mile Time&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your friend has been trying to improve his mile time on. Unfortunately, he isn't very good at keeping a steady pace and constantly speeds up and then slows down. He usually runs for many miles at a time and wants to choose the fastest mile of his run to determine his mile time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given your friend's distance versus time, determine his fastest mile time for a contiguous mile stretch.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A list of distances (in miles) sampled at an even interval.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The length of the smallest interval during which a distance of at least one mile was traveled.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may assume that the the total distance traveled is at least 1 mile.  &lt;/li&gt;&#xA;&lt;li&gt;The mile time must be for a continuous time interval.  &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loop-holes&lt;/a&gt; are forbidden.  &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet/2422#2422&quot;&gt;Standard rules&lt;/a&gt; apply.  &lt;/li&gt;&#xA;&lt;li&gt;Please provide a link to test your code as well as an explanation.  &lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;, so the program with the smallest asymptotic time complexity wins!  &lt;/li&gt;&#xA;&lt;li&gt;Ties will be broken by fastest run time.  &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Python 3.7, O(n ^ 2)&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##fZHRboMwDEXf@Qq/NWgMQdt1bSX2IwhF7jBdGElRkk3s61lMt1I0aXk4Uuxr@8bpv/zbxWzGsaYGGnSenJdadSS90iRq5TyaV3LxMYJwlPFkP7FzUEBZTaHmYkGFBFg0ZxIdmbsqeIT8p/RX285aBQ@QJ7AsuZNPExu45cq2Cg3nq6rgpYB8WbCwmWLfk6mFUAm0cfxHeLKE79EUtuQ/rAGtjNDYiw71qUYYjjCUOY8dyqxK5s6hWRS8SWlQk5RQFLCSUqMyUq6ujm5GeVlZGl6apWvGhrFlPDF2jGfGnnFIIE8zxpqxZexmXLfe2@BE/PdhcTSO3w&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 3 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;from typing import List&#xA;&#xA;&#xA;def fastest_mile_time(distances):&#xA;    &quot;&quot;&quot;Determines the fastest mile time from a list of distances.&#xA;&#xA;    Parameters&#xA;    ----------&#xA;    distances : List[float]&#xA;        The list of distances in miles.&#xA;&#xA;    Returns&#xA;    -------&#xA;    int&#xA;        The length of the smallest interval during which at least one mile was traveled.&#xA;    &quot;&quot;&quot;&#xA;    intervals = []&#xA;    for i in range(len(distances) - 1):&#xA;        for j in range(i + 1, len(distances)):&#xA;            if distances[j] - distances[i] &amp;gt;= 1:&#xA;                intervals.append((i, j))&#xA;                break&#xA;&#xA;    return min(map(lambda x: x[1] - x[0], intervals))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="46951" LastEditorUserId="46951" LastEditDate="2019-07-19T02:30:26.800" LastActivityDate="2019-07-19T02:30:26.800" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17882" PostTypeId="2" ParentId="2140" CreationDate="2019-07-13T15:40:55.733" Score="2" Body="&lt;h1&gt;Print the sum of the previous answer's ASCII values&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Output the sum of the previous answer's characters.&#xA;For example, if the previous answer was &lt;code&gt;print(25)&lt;/code&gt;, the next answer would have to output the next answer would have to output 741.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Initial Answer&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The initial answer has to output the number 1000&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your code can only use ascii characters (sorry Jelly), no extended-ASCII or Unicode characters.&lt;/li&gt;&#xA;&lt;li&gt;Your output can be in Decimal, Unary or Base 256 (represented by ASCII characters)&lt;/li&gt;&#xA;&lt;li&gt;You cannot use a language that has been used before. (Note: Different versions of the same language are allowed, like Python 2 and Python 3)&lt;/li&gt;&#xA;&lt;li&gt;To prevent overly long languages (such as Unary) ruining the chain, your answer cannot be longer then 1000000 bytes.&lt;/li&gt;&#xA;&lt;li&gt;The same person cannot post twice in a row&lt;/li&gt;&#xA;&lt;li&gt;If two users post &quot;at the same time&quot;, the earlier one will stand&lt;/li&gt;&#xA;&lt;li&gt;If a solution breaks one of these rules, it and all answers that chain off of it will be deleted&lt;/li&gt;&#xA;&lt;li&gt;Don't edit your code after you've posted it, otherwise it could invalidate code that chains off of it&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Winning&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The winner of the challenge is whoever has posted the most recent answer, since it will get harder and harder the more languages that are used.&lt;/p&gt;&#xA;" OwnerUserId="87923" LastActivityDate="2019-07-13T15:40:55.733" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17883" PostTypeId="2" ParentId="2140" CreationDate="2019-07-14T10:06:46.693" Score="1" Body="&lt;h1&gt;Decode a RISC-V J-type immediate&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://riscv.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;RISC-V&lt;/a&gt; is an open processor instruction set, which defines a somewhat typical RISC instruction set. However, in order to make decoding simpler in hardware, the encoding for immediate values tends to be quite complex, with the bits essentially shuffled around. And the worst offender for that is without a doubt the type J (jump) instruction type.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, the challenge is, given a (non-compressed) RISC-V instruction word, decode and output its type J immediate part.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A type J instruction has the following format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   31      30-21     20       19-12   11-7  6-0&#xA;|imm[20]|imm[10:1]|imm[11]|imm[19:12]| rd |opcode|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The only fields we are interested in are the &lt;code&gt;imm&lt;/code&gt; fields. The immediate is sign extended, and its least significant bit is always 0, so the immediate (in term of instruction bits) is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;    31-20       19-12       11        10-1     0&#xA;|...inst[31]|inst[19:12]|inst[20]|inst[30:21]| 0 |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Sample pseudocode: &lt;code&gt;0xFFF00000 * ((instr &amp;gt;&amp;gt; 31) &amp;amp; 1) | (instr &amp;amp; 0x000FF000) | ((instr &amp;amp; 0x100000) &amp;gt;&amp;gt; 9) | ((instr &amp;amp; 0x7FE00000) &amp;gt;&amp;gt; 20)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;I: 0x4DFAB06F (j 0xABCDE)&#xA;O: 0x000ABCDE&#xA;&#xA;I: 0xFD9FF0EF (jal ra, -0x28)&#xA;O: 0xFFFFFFD8&#xA;&#xA;I: 0x8000006F (j -0x100000)&#xA;O: 0xFFF00000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The answer with the smallest byte count wins, standard loopholes apply, etc... Your program may take input and write output in any format it requires.&lt;/p&gt;&#xA;" OwnerUserId="53745" LastEditorUserId="53745" LastEditDate="2019-07-16T11:37:03.693" LastActivityDate="2019-07-16T11:37:03.693" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17884" PostTypeId="2" ParentId="2140" CreationDate="2019-07-14T21:55:52.773" Score="3" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game-of-life&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game-of-life&amp;#39;&quot; rel=&quot;tag&quot;&gt;game-of-life&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cellular-automata&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cellular-automata&amp;#39;&quot; rel=&quot;tag&quot;&gt;cellular-automata&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hello-world&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hello-world&amp;#39;&quot; rel=&quot;tag&quot;&gt;hello-world&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Originally posted on main site, moved here for more suggestions.&#xA;Better scoring mechanics required.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I've been browsing all those &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hello-world&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hello-world&amp;#39;&quot; rel=&quot;tag&quot;&gt;hello-world&lt;/a&gt; challenges and was thinking &quot;yeah, they're good, but what if we make GoL one?&quot;, so here it goes.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Build starting setting for either Conway's Game of Life or other similar cellular automaton (restricted to ones with binary cell state) which after known amount of generation will include square area containing representation of QR code decodable to string &quot;Hello, world!&quot;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Cell (non-empty state) is interpreted as black pixel, no cell as white.&lt;/li&gt;&#xA;&lt;li&gt;Your automation should take at least one generation until result (no hardcoded results allowed).&lt;/li&gt;&#xA;&lt;li&gt;Your automation operates on infinite board.&lt;/li&gt;&#xA;&lt;li&gt;Not sure if this option will be useful, but you can specify scaling ratio: single integer, setting side of square encoding single pixel. Pixel's color is color of cell dominating by count in it (you can specify 50/50 edge case resolution in your answer). Obviously, in this case side of output area should be proportional to scaling ratio. &lt;em&gt;This option doesn't affect scoring.&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;It's not necessary, but nice to provide either link to online demo or &lt;code&gt;.rle&lt;/code&gt; file.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Example result&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/HMLZB.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/HMLZB.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Decodes to &quot;Hello, world!&quot;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your score is calculated as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;score = (initial amount of cells)^2*(number of generations until result) + (number of cells out of output area)*5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Lower score is better.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Happy GoLfing!&lt;/p&gt;&#xA;" OwnerUserId="59169" LastActivityDate="2019-07-14T21:55:52.773" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="17885" PostTypeId="5" CreationDate="2019-07-15T13:25:34.603" Score="0" Body="&lt;p&gt;404 is one of the status codes given by the Hypertext Transfer Protocol [Secure] (HTTP[S]), which, by specification, means that the requested resource was not found.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This tag is for questions that ask about things such as the image on the 404 page becoming unavailable with a 404 error.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2019-07-15T13:25:34.603" LastActivityDate="2019-07-15T13:25:34.603" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17886" PostTypeId="4" CreationDate="2019-07-15T13:25:34.603" Score="0" Body="This tag should be used for questions that ask about a resource on the Code Golf site being unavailable with a 404 error." OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2019-07-15T13:25:34.603" LastActivityDate="2019-07-15T13:25:34.603" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17887" PostTypeId="2" ParentId="2140" CreationDate="2019-07-15T14:47:48.400" Score="1" Body="&lt;h1&gt;Alphanumeric Line and Curve Counting&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/188441/alphanumeric-line-and-curve-counting&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2019-07-16T13:20:29.790" LastActivityDate="2019-07-16T13:20:29.790" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17889" PostTypeId="2" ParentId="17757" CreationDate="2019-07-15T15:32:04.603" Score="2" Body="&lt;p&gt;&lt;strong&gt;UPDATE:&lt;/strong&gt; The proposed changes have now been applied.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastActivityDate="2019-07-15T15:32:04.603" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17891" PostTypeId="2" ParentId="2140" CreationDate="2019-07-16T00:38:23.630" Score="2" Body="&lt;h2&gt;I'm sorry, Code Golf&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge is inspired by a series of Garfield-inspired artwork in which Garfield is depicted as a horror creature, stalking his owner, Jon. Commonly referred to as &quot;Creepy Garfield&quot;, the line &quot;&lt;strong&gt;&lt;em&gt;I'm sorry, Jon&lt;/em&gt;&lt;/strong&gt;&quot; can be found in one of the &lt;a href=&quot;http://dubblebaby.blogspot.com/2013/10/blog-post_21.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;earliest Creepy Garfield images&lt;/a&gt;, created by DubbleBaby.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;&lt;a href=&quot;https://www.instagram.com/p/BozsEZJHdSr/?utm_source=ig_embed&quot; rel=&quot;nofollow noreferrer&quot;&gt;William Burke's Depiction&lt;/a&gt;&lt;/em&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/SpR5f.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/SpR5f.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After being used over and over again by the Code Golf community, our beloved Jimmy has transformed - no longer bound to his weak, mortal body. He has become the embodiment of spaghetti code, the ascii manifestation of hours-long debugging sessions.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Your Task:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Take 3 ordered numerical inputs and output Jimmy's body&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Inputs&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input is received in the form &lt;code&gt;x y z&lt;/code&gt; where:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x is the number of left limbs (integer between 1 &amp;amp; 10)&#xA;y is the number of right limbs (integer between 1 &amp;amp; 10)&#xA;z is the number of heads (integer between 1 &amp;amp; 10)&#xA;&#xA;----Sample Input----&#xA;2 8 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Meta Note&lt;/strong&gt;: I don't think increasing the possible amount of body parts will influence the solutions but please let me know if you think they should be higher.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Body Parts&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Head =          &amp;lt;o&amp;gt;&#xA;Left Limb =     /&#xA;Right Limb =    \&#xA;Filler Limb =   |&#xA;Body Piece =    0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Body Generation Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   1. Left limbs must be attached to the left side of a body piece&#xA;    (excl rule 3)&#xA;    - Correct:  /0&#xA;    - Incorrect: /&amp;lt;o&amp;gt;&#xA;    - Incorrect: 0/&#xA;    - Incorrect: /0\0\&#xA;&#xA;2. Right limbs must be attached to the right side of a body piece&#xA;    (excl rule 3)&#xA;    - Correct: 0\&#xA;    - Incorrect: &amp;lt;o&amp;gt;\&#xA;    - Incorrect: \0&#xA;&#xA;3. Limbs must not touch&#xA;    - Correct: /00\&#xA;    - Incorrect: /0\/0\&#xA;&#xA;4. An external body piece without a limb must have a | in its place&#xA;    - Correct: /0|&#xA;    - Correct: |0|&#xA;    - Correct: /00\&#xA;    - Incorrect: /0&#xA;    - Incorrect: 0\&#xA;&#xA;5. Heads must be between body pieces (horizontally not vertically)&#xA;    - Correct: 0&amp;lt;o&amp;gt;0&#xA;    - Incorrect: 0&amp;lt;o&amp;gt;&amp;lt;o&amp;gt;0&#xA;    - Incorrect: 0&amp;lt;o&amp;gt;&#xA;&#xA;6. All lines must be aligned centre&#xA;    - Correct:      /0\&#xA;                  /0&amp;lt;o&amp;gt;0|&#xA;                    /0\&#xA;&#xA;    - Incorrect:    /0\&#xA;                    /0&amp;lt;o&amp;gt;0|&#xA;                    /0\&#xA;&#xA;7. The bottom line of Jimmy's body must always contain a left and right limb&#xA;    - Correct:      /0\&#xA;                  /0&amp;lt;o&amp;gt;0|&#xA;                    /0\&#xA;&#xA;    - Incorrect:    /0\&#xA;                  /0&amp;lt;o&amp;gt;0\&#xA;                    /0|&#xA;&#xA;8. Jimmy's body must be whole and cannot be separated into sections&#xA;    - Correct:    /0\&#xA;                /0&amp;lt;o&amp;gt;0|&#xA;&#xA;    - Incorrect:    /0\   /0\   |0&amp;lt;o&amp;gt;0|&#xA;&#xA;    - Incorrect:      /0\&#xA;&#xA;                    /0&amp;lt;o&amp;gt;0|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA;2 8 2&#xA;&#xA;Sample Output:&#xA;&#xA;/0&amp;lt;o&amp;gt;0&amp;lt;o&amp;gt;0\&#xA;    |0\&#xA;    |0\&#xA;    |0\&#xA;    |0\&#xA;    |0\&#xA;    |0\&#xA;    /0\&#xA;&#xA;    OR&#xA;&#xA;  /0\&#xA;  |0\&#xA;|0&amp;lt;o&amp;gt;0\&#xA;  |0\&#xA;  |0\&#xA;|0&amp;lt;o&amp;gt;0\&#xA;  |0\&#xA;  /0\&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Rules &amp;amp; Win Conditions&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You may receive the stated input via any method into a program or function.&lt;/li&gt;&#xA;&lt;li&gt;You may display the output in any clear and discernible way.&lt;/li&gt;&#xA;&lt;li&gt;Your output must obey all Body Generation Rules.&lt;/li&gt;&#xA;&lt;li&gt;The previous 3 rules must be followed for all 1000 combinations of inputs.&lt;/li&gt;&#xA;&lt;li&gt;Standard loophole rules apply.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;As this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, least amount of code in bytes wins.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="87254" LastEditorUserId="87254" LastEditDate="2019-07-17T21:43:32.423" LastActivityDate="2019-07-17T21:43:32.423" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17894" PostTypeId="2" ParentId="2140" CreationDate="2019-07-17T14:55:02.830" Score="0" Body="&lt;h1&gt;Write an X-SAMPA Interpreter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/unicode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;unicode&amp;#39;&quot; rel=&quot;tag&quot;&gt;unicode&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write an X-SAMPA interpreter that, when given an X-SAMPA string, outputs an IPA string.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Some Background&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/SAMPA&quot; rel=&quot;nofollow noreferrer&quot;&gt;SAMPA&lt;/a&gt; is a system for encoding sounds from various languages into a computer-readable ASCII format. &lt;a href=&quot;https://en.wikipedia.org/wiki/X-SAMPA&quot; rel=&quot;nofollow noreferrer&quot;&gt;X-SAMPA&lt;/a&gt; is a descendant that encodes the &lt;a href=&quot;https://en.wikipedia.org/wiki/International_Phonetic_Alphabet&quot; rel=&quot;nofollow noreferrer&quot;&gt;International Phonetic Alphabet (IPA)&lt;/a&gt; instead. The IPA is a character set that represents (almost) all sounds that a human can make. A large majority of IPA is based on the usual Latin character set (&lt;code&gt;a-z&lt;/code&gt;), along with some supplementary characters (&lt;code&gt;θ ʌ ŋ χ&lt;/code&gt;, etc.).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The Challenge&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input is a string of X-SAMPA.&lt;/li&gt;&#xA;&lt;li&gt;Translate the X-SAMPA string into IPA.&lt;/li&gt;&#xA;&lt;li&gt;Output is a string of IPA.&lt;/li&gt;&#xA;&lt;li&gt;Input and output can be given using &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;any convenient method&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;X-SAMPA charts can be found &lt;a href=&quot;https://en.wikipedia.org/wiki/X-SAMPA&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Characters not defined in X-SAMPA should be ignored.&lt;/li&gt;&#xA;&lt;li&gt;You must implement the entirety of X-SAMPA.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so lowest in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Samples&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;this is a test input --&amp;gt; this is a test input&#xA;THIS IS A TEST INPUT --&amp;gt; θɥɪʃ ɪʃ ɑ θɛʃθ ɪŋʋʊθ&#xA;H\El\L\0 W@R1d --&amp;gt; ʜɛɺʟ0 ʍəʁɨd&#xA;123456789 --&amp;gt; ɨøɜɾɫɐɤɵœ&#xA;d_&quot;i_+a_-c_/r_/i_0t_hi_=c_&amp;gt;s_?\ --&amp;gt; d̈i̟a̠čři̥tʰi̩cʼsˤ&#xA;Code GO\lf &amp;amp; CodI\ng Challen\ges\ --&amp;gt; çode ɣʘlf ɶ çodᵻnɡ çhallenɡeɕ&#xA;clicks O\|\ǃ\=\|\|\ --&amp;gt; clicks ʘǀǃǂǁ&#xA;mixed~!@#$%^&amp;amp;*(){}[]&amp;lt;&amp;gt;,.?/:;&quot;' --&amp;gt; mixed#$ˌ^ɶ*(͡æʉ[]&amp;lt;&amp;gt;,.ʔ&#xA;impl ejec b_&amp;lt;p_&amp;gt; --&amp;gt; impl ejec ɓpʼ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="77309" LastActivityDate="2019-07-17T14:55:02.830" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17896" PostTypeId="2" ParentId="2140" CreationDate="2019-07-18T12:23:40.137" Score="2" Body="&lt;h1&gt;Minimum string attractors&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;String attractors&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; be a string of length &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;.&#xA;An &lt;em&gt;attractor&lt;/em&gt; of &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; is a subset of indices &lt;span class=&quot;math-container&quot;&gt;\$A \subset \{0, \ldots, n-1\}\$&lt;/span&gt; such that every nonempty contiguous substring &lt;span class=&quot;math-container&quot;&gt;\$S[i \ldots j]\$&lt;/span&gt; of &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; has an occurrence &lt;span class=&quot;math-container&quot;&gt;\$S[i' \ldots j']\$&lt;/span&gt; whose index set &lt;span class=&quot;math-container&quot;&gt;\$[i' \ldots j']\$&lt;/span&gt; intersects &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;.&#xA;A &lt;em&gt;minimum attractor&lt;/em&gt; is one with minimal size.&#xA;Minimum attractors can be used to implement very efficient string compression algorithms.&#xA;In this challenge, your task is to find a minimum attractor for a given string.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Consider the string &lt;code&gt;acabaccabc&lt;/code&gt;.&#xA;Using 0-based indexing, one of its attractors is &lt;span class=&quot;math-container&quot;&gt;\$A = \{2,3,5,8\}\$&lt;/span&gt;.&#xA;This graphic shows the positions of &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;acabaccabc&#xA;  ^^ ^  ^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For example, the occurrence of the substring &lt;code&gt;ac&lt;/code&gt; in the beginning doesn't intersect &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;, but there is another occurrence after the first &lt;code&gt;b&lt;/code&gt; that does.&#xA;It turns out that no attractor of size 3 exists for this string, so &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; is a minimum attractor.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Specifications&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your input is a nonempty string of lowercase ASCII characters.&#xA;Your output is a minimum attractor for this string, in any reasonable format.&#xA;You can use either 0-based or 1-based indexing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There may be several choices for the minimum attractor.&#xA;In that case you may return any one of them, but only one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The lowest byte count wins.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;These are 0-indexed and show one possible output.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a -&amp;gt; [0]&#xA;aaa -&amp;gt; [0]&#xA;ababab -&amp;gt; [0,1]&#xA;qgqqgq -&amp;gt; [1,2]&#xA;abcbacaa -&amp;gt; [1,3,5,6]&#xA;abcdefgh -&amp;gt; [0,1,2,3,4,5,6,7]&#xA;jejjeeje -&amp;gt; [2,3,5]&#xA;sttststt -&amp;gt; [1,5]&#xA;ykkkkvyk -&amp;gt; [0,2,5]&#xA;assassins -&amp;gt; [0,2,6,7]&#xA;acabaccabc -&amp;gt; [2,4,6,8]&#xA;ssssssjjjsjj -&amp;gt; [5,8]&#xA;hrhrhhrhhhrr -&amp;gt; [3,7,10]&#xA;fubuaabubuau -&amp;gt; [0,1,4,6,10]&#xA;jjaahajjhahaaahjjh -&amp;gt; [2,6,8,11,14]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="32014" LastActivityDate="2019-07-18T12:23:40.137" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17897" PostTypeId="2" ParentId="2140" CreationDate="2019-07-18T14:43:53.107" Score="-1" Body="&lt;h1&gt;Print all the commands&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;META&lt;/strong&gt; Just a rought idea, needs to be worked out.&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Write a program that prints all the keywords and commands that are available in your langauge when you do not import/add anything&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;require full program or standard code-golf?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-07-18T14:43:53.107" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17898" PostTypeId="1" CreationDate="2019-07-18T16:36:04.340" Score="7" ViewCount="55" Body="&lt;p&gt;The rendered output still shows the markdown for LaTeX in the review queue:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&amp;nbsp;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/LYC6j.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/LYC6j.png&quot; alt=&quot;Screenshot from review queue&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/37635/34718&quot;&gt;Question pictured.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="68942" LastEditDate="2021-04-27T17:22:31.897" LastActivityDate="2021-04-27T17:22:31.897" Title="&quot;Rendered output&quot; doesn't render LaTeX in Review Queue" Tags="|bug|status-completed|reviewing|latex|" AnswerCount="0" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17899" PostTypeId="2" ParentId="2140" CreationDate="2019-07-18T18:07:35.920" Score="0" Body="&lt;h1&gt;Brute-force the switchboard&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/188556/brute-force-the-switchboard&quot;&gt;here&lt;/a&gt;!&lt;/p&gt;&#xA;" OwnerUserId="39148" LastEditorUserId="39148" LastEditDate="2019-07-19T17:54:15.977" LastActivityDate="2019-07-19T17:54:15.977" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17901" PostTypeId="2" ParentId="2140" CreationDate="2019-07-18T22:22:43.383" Score="4" Body="&lt;h2&gt;Castilian Numerals&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A little known (but actually real) number system are the Castilian numerals.  They were an odd mix of a digital and positional counting system used in Spain in the late middle ages.  There are certain qualities about them, however, that make them not entirely straight forward to generate when you have lots of them in a group, in particular the fact they would be aligned by thousands places.  Your challenge will be to print a vertical list of numbers, correctly spaced.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Description of the Numerals&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A Castilian numeral is, in effect, a Roman numeral, but only uses 1-999, uses additives for 4 (IIIJ), 9 (VIIIJ), and 900 (DCCCC), and subtractives for 90 (XC) and 400 (CD).  Both methods were commonly used for 40 (XL, XXXX).  Additionally, final Is were written as Js, such that the sequence 1-6 goes J, IJ, IIJ, IIIJ, V, VJ.  (This means standard Roman numeral generators will likely not be much help.)  They were generally written lowercase, but for this challenge we'll use all uppercase.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For values under between 1-999, the fact that the letters indicated numerals was made clear by the presence of a symbol that looks like a U.  Generally the numerals themselves were right aligned:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1          U           J&#xA;2          U          IJ&#xA;999        U DCCCXCVIIIJ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For values between 1000-999999, everything we would place to the left of the comma would be rendered as if it were its own independent 3-digit number and romanized, and the reminder placed to the right, such that&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  1,000    J U&#xA;  1,001    J U          J&#xA; 21,030  XXJ U        XXX&#xA;500,444    D U CDXXXXIIIJ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For values 1,000,000-999,999,999, an &lt;em&gt;additional&lt;/em&gt; separator was used, Q&lt;sup&gt;to&lt;/sup&gt;, but for our purposes, we'll just use Q.  It would only be used if the number was over 1,000,000, unlike the U that always separated it.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  1,000,000       J Q       U&#xA;  1,000,001       J Q       U            J&#xA;  1,001,000       J Q     J U&#xA;  1,001,001       J Q     J U            J&#xA;123,456,789  CXXIIJ Q CDLVJ U DCCLXXXVIIIJ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As should be noticed, within each grouping of three (arabic) digits, everything is right aligned, with the thousands/million separators all in alignment.  Because 0 didn't exist, it would just be left blank.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A sequence of integers in whatever format you feel gives you the best advantage (a list, an array, a series, etc).  You may assume that the integers are between 1 and 999,999,999.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A printed list of Castilian numerals, properly aligned on different lines.  Note the restrictions on 4/9: mandatory additives are 4,9,900; mandatory subtractives are 90 and 400; 40 is valid either way.  The numerals for 1-999 should be right aligned, with a single space on either side of Q or U (there may be padding spaces, but the single longest numeral in each grouping will have the single space).  Newlines may be whatever is native to your system/language.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is code golf.  Fewest bytes wins.  Standard loopholes forbidden.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Comments/observations are given after &lt;code&gt;#&lt;/code&gt; and not part of the output.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Given: 1,2,3&#xA;U   J   &#xA;U  IJ&#xA;U IIJ   # one space between U and I&#xA;&#xA;Given: 1,1000,10,100&#xA;  U J&#xA;J U     # trailing space not required&#xA;  U X&#xA;  U C&#xA;&#xA;Given: 123,4,5678,111111111,90,12345,6789012&#xA;                U    CXXIIJ&#xA;                U        IV&#xA;              V U DCLXXVIIJ   # single space between U and the longest numeral&#xA;CXJ Q       CXJ U       CXJ   # Q only appears if &amp;gt;= 10^7&#xA;                U        XC&#xA;            XIJ U  CCCXXXXV   # also valid CCCXLV &#xA; VJ Q DCCLXXXIX U       XIJ   # single space between Q and the longest numeral&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="30284" LastActivityDate="2019-07-18T22:22:43.383" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17902" PostTypeId="2" ParentId="5243" CreationDate="2019-07-19T03:45:36.020" Score="3" Body="&lt;h1&gt;200-400 rep for discompassionate geometry&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/188333/39328&quot;&gt;Construct a pentagon avoiding compass use&lt;/a&gt; is about finding a compass-and-straightedge construction of a regular pentagon while minimizing the number of circles drawn.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Poncelet%E2%80%93Steiner_theorem&quot; rel=&quot;nofollow noreferrer&quot;&gt;Poncelet-Steiner theorem&lt;/a&gt; says that any construction possible with a compass and straightedge is possible with &lt;em&gt;one&lt;/em&gt; circle, its center, and a straightedge. Finding such a construction is another matter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because the construction rules in this challenge are slightly different from the premises of the theorem (arbitrary points cannot be drawn in this challenge, which necessitates a second circle to construct anything nontrivial), it will not be valid for that challenge. Nevertheless, 200 rep goes to the first answer to that challenge that both:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Contains a construction in 1 circle (which necessarily includes adding arbitrary points) and makes a reasonable effort to golf the number of points and lines drawn&lt;/li&gt;&#xA;&lt;li&gt;Also contains a valid solution or a proof of optimality of the &lt;a href=&quot;https://codegolf.stackexchange.com/a/188337/39328&quot;&gt;current best&lt;/a&gt; solution.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If the answer is an improvement on the current best or a proof of optimality, I will award an additional 200 rep.&lt;/p&gt;&#xA;" OwnerUserId="39328" LastActivityDate="2019-07-19T03:45:36.020" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17903" PostTypeId="2" ParentId="2140" CreationDate="2019-07-19T04:00:51.780" Score="3" Body="&lt;h1&gt;Character Frequency in a String&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/counting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;counting&amp;#39;&quot; rel=&quot;tag&quot;&gt;counting&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/188684/character-frequency-in-a-string&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2019-07-24T05:00:58.383" LastActivityDate="2019-07-24T05:00:58.383" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17904" PostTypeId="2" ParentId="2140" CreationDate="2019-07-19T12:26:06.270" Score="1" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/57204/programming-with-bits-and-bytes&quot;&gt;Bits and Bytes&lt;/a&gt; constant generation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this challenge, you have to generate the shortest Bits and Bytes program that outputs an integer input. For the simplicity of the challenge, you only have to search with &lt;code&gt;!&lt;/code&gt; and &lt;code&gt;&amp;lt;&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Bits and Bytes quick reference&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Bits and Bytes operates on a one-byte accumulator. There are 4 operations (only 2 are neccecary for this challenge):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;!&lt;/code&gt; : Invert all of the bits in the accumulator&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;lt;&lt;/code&gt; : Shifts all bits in the accumulator one bit to the right. The leftmost bit becomes a 0 and the rightmost bit is discarded.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;gt;&lt;/code&gt; : Shift right&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;@&lt;/code&gt; : Swap nybbles&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Input / Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input will be two integers. The first integer sets the accumulator to the value of that integer. The second integer indicates the resulting value. Your program should output the shortest program in Bits and Bytes that sets the accumulator to that value.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&#xA;0&#xA;255&#xA;!&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&#xA;0&#xA;4&#xA;!&amp;lt;!&amp;lt;!&amp;lt;&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; contest; the shortest program wins.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/path-finding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;path-finding&amp;#39;&quot; rel=&quot;tag&quot;&gt;path-finding&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-07-22T01:33:27.293" LastActivityDate="2019-07-22T01:33:27.293" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17905" PostTypeId="2" ParentId="2140" CreationDate="2019-07-21T13:03:52.753" Score="0" Body="&lt;h2&gt;The Acrobat Competition&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Anyone may post this to main once this question is done. I only care about people enjoying solving problems. (I do not want the reputation for this question.)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After someone cloned &lt;a href=&quot;https://codegolf.stackexchange.com/questions/187682/how-many-jimmys-can-fit&quot;&gt;so&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/187731/jimmy-needs-your-help&quot;&gt;many&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/187759/can-jimmy-hang-on-his-rope&quot;&gt;Jimmy's&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/188140/jimmy-needs-a-new-pair-of-shoes&quot;&gt;to&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/188391/a-scene-of-jimmy-diversity&quot;&gt;disrupt&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/187586/will-jimmy-fall-off-his-platform&quot;&gt;the&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/188550/battle-of-the-jimmys&quot;&gt;world&lt;/a&gt;, Jimmy started to be stressed about the existence of his dwarf forms; his circus leader started to ignore him, focus on the dwarves, and gradually gave him less salary.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;He has to win an acrobat competition to gain attention from his leader again. (He does care about his salary.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input/Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The first line of input will contain the acrobatic power of Jimmy; it is represented as Jimmy's (&lt;code&gt;/o\&lt;/code&gt;) separated with spaces; invalid Jimmy's should be ignored.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After this line, there are two lines of dwarf Jimmy's also represented by their shapes: (&lt;code&gt;o&lt;/code&gt;); invalid dwarf Jimmy's should be ignored.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The combined power between two dwarf (&lt;code&gt;x&lt;/code&gt; as the top line of dwarf Jimmys and &lt;code&gt;y&lt;/code&gt; as the bottom line of dwarf Jimmys) is √x²+y² (the exact floating-point number).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If Jimmy's acrobatic power is larger than the two dwarf Jimmy's, output a truthy value. Otherwise, output a falsy value.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example input/outputs&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This outputs a falsy value:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;/o\ // o /o\ o o\ //o\\ /o\ /o\ /o\&#xA;o o o o&#xA;/o\ l o j oe o lo . o aso o feo o&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This outputs a truthy value:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;/o\/o\ /o\ /o\ /o\ /o\ /o\ /o\&#xA;o&amp;#9;o o &amp;#9; o&#xA;o&amp;#9;o o o&amp;#9;o o oo o o o o&#xA;&lt;/pre&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-07-24T03:31:56.717" LastActivityDate="2019-07-24T03:31:56.717" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17906" PostTypeId="2" ParentId="2140" CreationDate="2019-07-23T14:57:15.343" Score="-2" Body="&lt;h2&gt;Produce a self-reproducing data structure&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write the shortest code to produce a self-reproducing list, dictionary, array, and so on and so forth. That is, when you index &lt;strong&gt;any one of the logically-available items&lt;/strong&gt; that belongs to the resulting data structure that you have produced, you get the same data structure when you compare the equality between the data structure before you indexed and the data structure after you indexed.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In order to verify your code with automatically-provided constructions in programming languages, you should pick an operator that compares whether two values are equal (or does type-comparisons, if available).&lt;/li&gt;&#xA;&lt;li&gt;If your language does not provide an equality operator, you should simulate an equality operator yourself using operators like &lt;code&gt;-&lt;/code&gt; or other operators that do the job of comparing values (as in &lt;em&gt;Acc!&lt;/em&gt;, where an explicit comparison operator is not provided.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is an example of a validity/equality test of a possible solution in a Python REPL (when you have already produced a list, namely &lt;code&gt;list&lt;/code&gt;, where it produces itself at its 0th item). This test simply compares the equality between the non-indexed list and the indexed list:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt; list&#xA;[[...]]&#xA;&amp;gt;&amp;gt;&amp;gt; list[0]&#xA;[[...]]&#xA;&amp;gt;&amp;gt;&amp;gt; list==list[0]&#xA;True&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;However, if the result of the last line (the equality comparison) is not a truthy value in your language (for example &lt;code&gt;False&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt; in Python), then your answer is invalid and should be improved.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program does not have to take input; neither does it have to explicitly output the data structure. However, your resulting data structure has to be accessible in some way.&lt;/li&gt;&#xA;&lt;li&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; contest; the shortest answer will win.&lt;/li&gt;&#xA;&lt;li&gt;No standard loopholes, please.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;In this challenge, the values on both operands in the equality check should have the same type.&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Your code (both your testing code and your producing code) should not produce any errors; any outputs to stderr are considered non-truthy values and demonstrates that your code is invalid.&lt;/strong&gt;&#xA;&lt;hr&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-07-25T03:59:44.943" LastActivityDate="2019-07-25T03:59:44.943" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="17908" PostTypeId="2" ParentId="2140" CreationDate="2019-07-24T06:08:54.713" Score="-5" Body="&lt;h1&gt;Count up to &lt;strong&gt;N&lt;/strong&gt; without math or inbuilds&lt;/h1&gt;&#xA;&lt;h3&gt;Idea:&lt;/h3&gt;&#xA;&lt;p&gt;The challenge is the following: count from 0 up to &lt;strong&gt;N&lt;/strong&gt; without using mathematical operations or other (counting, list or whatever) inbuilds.&#xA;You handle the incoming number &lt;strong&gt;N&lt;/strong&gt; as a string on which you can't apply mathematical operations like addition or substraction for example. Also don't use list things like print [0..&lt;strong&gt;N&lt;/strong&gt;] or something other inbuilt of your language. Counting inside arrays, for example at index x+1 or something like that to get position after another is allowed. But you must not apply any (mathematical) operations on the numbers between 0 and &lt;strong&gt;N&lt;/strong&gt; itself.&lt;/p&gt;&#xA;&lt;p&gt;Think that you are like a small child and don't know anything about maths. You only know:&#xA;after 0 comes 1, after 1 comes 2 ... after 8 comes 9 and after 9 comes 0 and you have to &amp;quot;increment&amp;quot; the number in front of it.&lt;/p&gt;&#xA;&lt;h3&gt;Examples:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;So after the number 9 (with leading, but not outwritten zero) comes, you write zero and place the number 1 in front of it for 10.&lt;/li&gt;&#xA;&lt;li&gt;For 19 you write 0 and &amp;quot;increment&amp;quot; the number in front to the next one, making it 20.&lt;/li&gt;&#xA;&lt;li&gt;For 399 you do: last 9 goes to zero, 9 in front goes to 0 too and the  3 goes to 4, making it 400.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Task:&lt;/h3&gt;&#xA;&lt;p&gt;Write a function or program which takes &lt;strong&gt;N&lt;/strong&gt; via the way you want to as its input. &lt;br&gt;&#xA;Output the numbers from 0 up to &lt;strong&gt;N&lt;/strong&gt; (element after element or once as a list)&#xA;&lt;br&gt;&#xA;Important: use a seperator as 01234567891011 will become unreadable with larger numbers&lt;/p&gt;&#xA;&lt;h3&gt;Test Case:&lt;/h3&gt;&#xA;&lt;p&gt;Taking a string of seperated numbers and your seperator, you can check your answer &lt;a href=&quot;https://tio.run/##fVFNT8MwDD23v8Lk1KlmLGXjQ6PigMQv4AYcsjQtQSWZknQSQvvtw2krQNPKIYrznv2eHb@LnfDS6W04N7ZSh4sLCBZ2otWVCAp8cNo06aftnLdd2Hahscq/KaegBMbWA7NtdfCfHxvbRhQITqOO61QqSrZAjgVe4hJXeIXXeIO3yAnkyAvkl8iXyFfIr5BfI79BfovFAgtOKhsqpktOaYxGtWi9SquS9TkEKgoL0i5IvFgSUP8qjPVsfag7I4O2BmprM212wmE/SVBuBl@QJoSAcI5m6tl5z2Y/OeshQxK/GGNLcRyb@kpq6yCLoO4T6LqLavNWmSa80TvPySZNEl1DRsSzfoWzEuQAJk6FzplhNlJP9nRknlO4J/GRHbz2B2mNt62at7bJGP2I9hAXA8PKQFrnlAz3jHr@mxoHP7VaPNrqDHJgLyaWp8dWT9QCPAiv/Cl1gQzZ7ASxmSJkT/xj@Bh/ZNqxmhJWU0Q9Eodv&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Ah, and also don't forget that this is code-golf, so shortest answer in bytes will win. Also, all standard loophole rules and so on apply (you should know from all the other challenges!)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&lt;p&gt;I hope this challenge has never been here, I did not found it while searching trough the already asked challenges (maybe I did not found it because I did not knew the correct english words to search for because english is not my first language). Thank you already in advance for helping to improve this challenge.&lt;/p&gt;&#xA;&lt;h3&gt;Tags:&lt;/h3&gt;&#xA;&lt;p&gt;counting, code-golf&lt;/p&gt;&#xA;" OwnerUserId="74284" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-07-24T06:26:17.847" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="17909" PostTypeId="2" ParentId="9619" CreationDate="2019-07-24T12:04:13.543" Score="2" Body="&lt;h2&gt;&lt;a href=&quot;https://esolangs.org/wiki/Keg&quot; rel=&quot;nofollow noreferrer&quot;&gt;Keg&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Keg is a tiny stack-based language that has outstanding ways to code-golf programs; it was commonly considered to be hard to golf in due to its limitations of commands; however, it has proven that it can write very short programs if the Keg user is intelligent enough to write short programs.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Ease of learning&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Keg is a good target for code golf beginners. I find it much easier to pick up Keg and start code-golfing than any other language; in fact, all other golfing languages are complicated, and you usually have to look at the command reference before you start programming.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Keg has generally well thought-out utilities that are very easy to read without much professional help.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Simplicity&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For other golfing languages, there are too many instructions which stops the user from thinking clearly; the user probably will waste too much time finding the instruction they want. When golfing in CJam, Mathematica, or Jelly, for example, your submission could be crippled if you didn't know about one key builtin that solves a huge part of the problem. in Keg, this barrier has been lowered; now provided only a few instructions, the user can use significantly less time for finding the instruction they want, as the instruction list is in their mind.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Features&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In Keg, alphanumerical characters are automatically pushed (no need to wrap them in quotation marks); this makes it much easier to golf in. Other stack-based languages depend on quotation marks for manipulating the stack; in Keg, this is not the case.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Keg also has the commands &lt;code&gt;'&lt;/code&gt; and &lt;code&gt;&quot;&lt;/code&gt;, which are very useful compared to other commands that manipulate the stack(In fact, no other stacklang supports that; I can't find other languages that have those commands; however, inform me if there is).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;It introduces implicit input and output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;No more writing instructions to take input and process it, now you can write full programs which use input and implicit output without using built-in functions: &lt;code&gt;?,.&lt;/code&gt;. Instead of focusing on how best to get and manipulate your input, you can get right to work on the main algorithm of your program.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Keg is Still Being Developed&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Keg is currently being actively maintained, and you can join to make Keg better. A lot of issues are fixed and more (unique?) features that make Keg easier to use are added.&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-08-14T12:27:23.363" LastActivityDate="2019-08-14T12:27:23.363" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17910" PostTypeId="2" ParentId="2140" CreationDate="2019-07-24T20:28:31.020" Score="6" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/188904/composing-fill-in-the-blanks&quot;&gt;Compose Fill In The Blanks&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2019-07-29T13:30:49.857" LastActivityDate="2019-07-29T13:30:49.857" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17911" PostTypeId="2" ParentId="2140" CreationDate="2019-07-25T11:17:43.963" Score="-3" Body="&lt;h1&gt;add two numbers in string representation&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Idea:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given two strings representing &lt;strong&gt;non-negative&lt;/strong&gt; integers in base 10, return the string corresponding to their sum - without any explicit arithmetic operations. This means you have to implement incrementing (probably with a lookup and indexing) and carrying (probably with iteration or recursion) on your own. Comparisons and boolean operations are allowed.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples:&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;1&quot; + &quot;1&quot; = &quot;2&quot;&#xA;&quot;5&quot; + &quot;6&quot; = &quot;11&quot;&#xA;&quot;0&quot; + &quot;8&quot; = &quot;8&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;I/O:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write a function or program which takes the two strings in a way you want to. &lt;br&gt;&#xA;Output, print or return the solution in whatever way you want.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Ah, and also don't forget that this is code-golf, so shortest answer in bytes will win. Also, all standard loophole rules and so on apply (you should know from all the other challenges!)&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This challenge changed, evolved and got compressed during discussion with &lt;a href=&quot;https://codegolf.stackexchange.com/users/43319/ad%C3%A1m&quot;&gt;Adám&lt;/a&gt; starting from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17908/74284&quot;&gt;here&lt;/a&gt; (feel free to review the edits and chat of this post on how we got here)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Tags for cgcc post:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/addition&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;addition&amp;#39;&quot; rel=&quot;tag&quot;&gt;addition&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="74284" LastEditorUserId="74284" LastEditDate="2019-07-25T12:43:08.120" LastActivityDate="2019-07-25T12:43:08.120" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17912" PostTypeId="1" CreationDate="2019-07-26T03:34:44.243" Score="6" ViewCount="135" Body="&lt;p&gt;Example: &lt;a href=&quot;https://codegolf.stackexchange.com/a/179329/83048&quot;&gt;https://codegolf.stackexchange.com/a/179329/83048&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As you can see, it extends out of the box the post is contained within and mildly interferes with the HNQ.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$ThisisademonstrationofwhathappenswhenyouusetoommuchLaTeXononelineNoticehowitgoesoffoftheboxthepostiscontainedin\$&lt;/span&gt;&lt;/p&gt;&#xA;" OwnerUserId="83048" LastEditorUserId="105303" LastEditDate="2021-07-27T17:33:03.870" LastActivityDate="2021-07-27T17:33:13.480" Title="LaTeX/MathJax extends out of the post box" Tags="|bug|status-deferred|latex|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17913" PostTypeId="2" ParentId="2140" CreationDate="2019-07-26T07:23:18.967" Score="6" Body="&lt;h1&gt;Move arrows along a contour&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/188979/move-arrows-along-a-contour&quot;&gt;Posted here&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="75681" LastEditorUserId="75681" LastEditDate="2019-07-31T06:43:42.657" LastActivityDate="2019-07-31T06:43:42.657" CommentCount="18" ContentLicense="CC BY-SA 4.0" />
  <row Id="17916" PostTypeId="2" ParentId="2140" CreationDate="2019-07-28T04:25:23.987" Score="0" Body="&lt;h2&gt;Insert an exclamation mark between everything&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This challenge is highly &quot;distilled&quot; from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/188863/print-function-for-linked-list&quot;&gt;this&lt;/a&gt; question. Special thanks to Akababa!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this task, you should insert an exclamation mark at the start of the string and after every character.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There will always be a non-empty-string input. The input will not contain tabs either. You can assume that the input only contain non-extended ASCII printable characters and newlines.&lt;/li&gt;&#xA;&lt;li&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; contest; the shortest answer should win.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;4 newlines result in 5 newline-delimited exclamation marks. It is very hard to put this as a Markdown text, so this is stated instead.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;pre&gt;&#xA;1 2 3 4 5 6&#xA;129591 129012 129127 129582&#xA;&#xA;0&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Outputs&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;!1! !2! !3! !4! !5! !6!&#xA;!1!2!9!5!9!1! !1!2!9!0!1!2! !1!2!9!1!2!7! !1!2!9!5!8!2!&#xA;!&#xA;!0!&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&#xA;asd afjoK ak:e&#xA;kPrLd&#xA;    fOJOE;&#xA;    KFO&#xA;KFkepjgop sgpaoj   faj&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Outputs&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;!a!s!d! !a!f!j!o!K! !a!k!:!e!&#xA;!k!P!r!L!d!&#xA;! ! ! ! !f!O!J!O!E!;!&#xA;! ! ! ! !K!F!O!&#xA;!K!F!k!e!p!j!g!o!p! !s!g!p!a!o!j! ! ! !f!a!j!&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A base test case with only one character:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;a&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Outputs&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;!a!&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(Auto-completion! Just kidding, there is no such thing.) Contains exclamation marks:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;!!&#xA;!!&#xA;!!&#xA;!!&#xA;!!&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Outputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;!!!!!&#xA;!!!!!&#xA;!!!!!&#xA;!!!!!&#xA;!!!!!&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;hr&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-07-31T03:37:38.813" LastActivityDate="2019-07-31T03:37:38.813" CommentCount="18" ContentLicense="CC BY-SA 4.0" />
  <row Id="17918" PostTypeId="2" ParentId="2140" CreationDate="2019-07-30T18:46:22.747" Score="3" Body="&lt;h1&gt;Golf &lt;a href=&quot;https://en.wikipedia.org/wiki/Range_minimum_query&quot; rel=&quot;nofollow noreferrer&quot;&gt;range minimum queries&lt;/a&gt; of a list&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Looks like this post hasn't gotten any problems called out, but also not that much support. If you could leave even a brief comment if you don't like it, that would be much appreciated.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(Inspired by the &lt;a href=&quot;http://web.stanford.edu/class/archive/cs/cs166/cs166.1146/lectures/00/Small00.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;first problem solved&lt;/a&gt; in Stanford’s advanced data structures course.)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Despite the academicese-heavy name, the problem we're going to solve is almost unbearably simple.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We have a list of numbers.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[31, 41, 59, 26, 53, 58, 97]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We're going to cut some contiguous snippet out of that list of numbers.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[31, 41, 59, 26, 53, 58, 97]&#xA;    |41, 59, 26, 53|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And then we're going to find the minimum of that snippet. In this case, that's quite obviously 26. That's all.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And the obvious solution is pretty fast, too, with &lt;code&gt;O(n)&lt;/code&gt; time and &lt;code&gt;O(1)&lt;/code&gt; space in the size of the list:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;minval = arbitrarily large value&#xA;for (i=first snippet index, i&amp;lt;last snippet index, i++)&#xA;  if (list[i]&amp;lt;minval) minval = list[i]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;So what's with the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Where it gets interesting is when you try to see how efficient you can make it when you have a fixed list but a large number of range minimum queries -- snippets to find the minimum of. This version of the problem is useful, for example, if you have a huge time series you want to load only once, but you want to find the minimum of many different subintervals of that time series.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In such a scenario, it would actually be faster in practice to literally precompute all &lt;code&gt;n**2/2&lt;/code&gt; queries, store it in a table, and then just retrieve data from that table for an &lt;code&gt;O(1)&lt;/code&gt; time and &lt;code&gt;O(n**2)&lt;/code&gt; space solution. &#xA;&lt;a href=&quot;https://i.stack.imgur.com/6C3Ks.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/6C3Ks.png&quot; alt=&quot;Dynamic programming solution from the Stanford slides&quot;&gt;&lt;/a&gt;&#xA;&lt;em&gt;^dynamic programming solution taken from the Stanford slides&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And then if you're clever enough, you realize that you only have to store each query with size that's a power of two -- you can just combine those power-of-two minima to sum to an arbitrarily sized query, and achieve the same results with constant time and linearithmic rather than quadratic space.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Interestingly, if you keep optimizing, you can get to an &lt;code&gt;O(1)&lt;/code&gt; time and &lt;code&gt;O(n)&lt;/code&gt; space solution using a sort of augmented list known as a Fischer-Heun structure. I'd love to go into the details of the structure here, but explaining how it weaves into Cartesian tree building on fixed-size snippets would make this question about 50 pages long. It's explained in the &lt;a href=&quot;https://en.wikipedia.org/wiki/Range_minimum_query&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia page linked in the title (which I've copied here)&lt;/a&gt;, however, along with several faster-than-linear intermediate structures.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(If you can get past a research paywall, &lt;a href=&quot;https://epubs.siam.org/doi/pdf/10.1137/090779759&quot; rel=&quot;nofollow noreferrer&quot;&gt;here's&lt;/a&gt; the original Fischer &amp;amp; Heun 2011 paper. And if you’d prefer the much more verbose but much more hand-holdy Stanford lecture style, &lt;a href=&quot;http://web.stanford.edu/class/cs166/lectures/01/Small01.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; are the follow-up slides that goes into this solution, including lots of intermediates.)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You can either write a full program or a function that calculates the result of a series of range minimum queries given a fixed list. Scoring is set up such that in general, the shortest and most-efficient-over-lots-of-queries code wins. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A list of integers &lt;code&gt;xs&lt;/code&gt;, followed by a series of &lt;code&gt;i, j&lt;/code&gt; pairs denoting the start and end of the snippet, inclusive (so the 26 example above uses indices i=1 and j=4). The list of integers is guaranteed to have at least one integer, and &lt;code&gt;0 &amp;lt;= i &amp;lt;= j &amp;lt; len(xs)&lt;/code&gt;. This can be taken in any format that works best for your language — for example, one list for &lt;code&gt;xs&lt;/code&gt; and one list of tuples for the &lt;code&gt;i, j&lt;/code&gt; pairs; or maybe all the different pairs as a variable number of arguments. For a full program that takes in input from stdin, I’ll fix a format for the input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;xs[0] xs[1] xs[2] xs[3] ...&#xA;i1 j1&#xA;i2 j2&#xA;i3 j3&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An ordered collection of the range minima for each &lt;code&gt;i, j&lt;/code&gt; query, in the same order that they were given. In case an unordered map (such as a Python dictionary) from each &lt;code&gt;i, j&lt;/code&gt; query to its range minimum works better for your language, that will also be allowed as an output; as long as it's obvious which minimum is related to which query.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once again, for a full program that prints to stdout or a file, I’ll fix the format to have each range minimum on each newline (trailing newlines permitted).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Lower score is better; score is determined by&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;at(b)^2+as(b)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;b&lt;/code&gt; is the byte count of your code, &lt;code&gt;at&lt;/code&gt; is the asymptotic runtime &lt;code&gt;Ө(n)&lt;/code&gt; of the algorithm in the size of &lt;code&gt;xs&lt;/code&gt; interpreted as a function of &lt;code&gt;n&lt;/code&gt;, and &lt;code&gt;as&lt;/code&gt; is the asymptotic space usage &lt;code&gt;Ө(n)&lt;/code&gt; in the size of &lt;code&gt;xs&lt;/code&gt; interpreted as a function of &lt;code&gt;n&lt;/code&gt;.( All constant coefficients in such &lt;code&gt;Ө(n)&lt;/code&gt; expressions must be 1, and only the fastest growing term may be kept in expressions, as is standard.) &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, the above pseudocode solution, which uses &lt;code&gt;Ө(n)&lt;/code&gt; time and &lt;code&gt;Ө(1)&lt;/code&gt; space, and is 126 characters, would have a score of &lt;code&gt;(b =&amp;gt; b**2 + 1)(126)=15876+1=15877&lt;/code&gt;. (Of course, the pseudocode isn't really valid since it's missing a construct to deal with multiple queries, and also because it's uncompilable pseudocode...)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;31 41 59 26 53 58 97&#xA;1 4&#xA;0 2&#xA;5 6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;26&#xA;31&#xA;58&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;0 0&#xA;0 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-4 28 31 -54&#xA;0 0&#xA;0 1&#xA;0 2&#xA;0 3&#xA;1 1&#xA;1 2&#xA;1 3&#xA;2 2&#xA;2 3&#xA;3 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-4&#xA;-4&#xA;-4&#xA;-4&#xA;28&#xA;28&#xA;-54&#xA;31&#xA;-54&#xA;-54&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Sandbox Questions:&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Would the asymptotic runtime count as a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges/10002#10002&quot;&gt;non-observable requirement&lt;/a&gt;?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;is this too long and/or abstruse lol&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I’m not sure how to word the scoring section to narrow down the most obvious, basic O(n) expression — an algorithm that’s Ө(n) is also Ө(n/16384-50000) by definition. Is what I have clear enough? Have I left any loopholes?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I kind of wanted to encourage people to try to implement Fischer-Heun or one of the more time-efficient intermediates in the slides, without restricting them to one particular algorithm (e.g. challenge: you have to make a Fischer-Heun structure). Does the scoring system make sense for this? Is it fair to have, for example, a Jelly answer using the naive algorithm in 3 bytes (score 10) compete with a Jelly answer using the Fischer-Heun structure in 30 bytes (score 31); but a naive Python answer with score 3000+ compete against with a Python Fischer-Heun with score 300?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="39148" LastEditorUserId="39148" LastEditDate="2019-08-02T20:23:22.697" LastActivityDate="2019-08-02T20:23:22.697" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17919" PostTypeId="1" CreationDate="2019-07-30T20:02:46.147" Score="2" ViewCount="98" Body="&lt;p&gt;Since &lt;a href=&quot;https://esolangs.org/wiki/Underload&quot; rel=&quot;nofollow noreferrer&quot;&gt;Underload&lt;/a&gt; has no input command, I have some questions relating to hard-coded input:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is hard-coded input allowed by default?&lt;/li&gt;&#xA;&lt;li&gt;If it is allowed, can the hard-coded input be anywhere in the program?&lt;/li&gt;&#xA;&lt;li&gt;Are you allowed to use &lt;a href=&quot;https://esolangs.org/wiki/Underload#Numbers&quot; rel=&quot;nofollow noreferrer&quot;&gt;Underload's way of storing numbers&lt;/a&gt; for hard-coded input in challenges that require number input?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="87923" LastActivityDate="2019-08-03T21:38:39.257" Title="Input in Underload" Tags="|support|rules|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17920" PostTypeId="2" ParentId="2140" CreationDate="2019-07-31T12:43:06.980" Score="0" Body="&lt;h2&gt;Give me the &lt;code&gt;jitter&lt;/code&gt;s! / Add noise to data&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When graphing data, it can often be helpful to display points as a scatterplot, but when duplicate data exist, you'll have multiple points graphed on top of one another. For fairness, we break ties at random with R's &lt;a href=&quot;https://stat.ethz.ch/R-manual/R-devel/library/base/html/jitter.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;jitter&lt;/code&gt; function&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Inputs&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;x&lt;/code&gt;, a numeric (floating point) array. There will be at least 3 distinct values in the array.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;factor&lt;/code&gt;, a numeric value&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;amount&lt;/code&gt;, a numeric value &lt;strong&gt;or&lt;/strong&gt; some sort of non-numeric value (your choice). You may select your desired non-numeric sentinel value for &lt;code&gt;amount&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A single array &lt;code&gt;y&lt;/code&gt; where:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;y[i]&lt;/code&gt; = &lt;code&gt;x[i]&lt;/code&gt; + a uniformly random number from &lt;code&gt;-a&lt;/code&gt; to &lt;code&gt;a&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;a&lt;/code&gt; is defined as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Let &lt;code&gt;z = max(x) - min(x)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;amount==0&lt;/code&gt;, &lt;code&gt;a = factor * z/50&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;amount&lt;/code&gt; is &lt;code&gt;NULL&lt;/code&gt; or the , &lt;code&gt;a = factor * d/5&lt;/code&gt; where &lt;code&gt;d = min(diff(sort(unique(x))))&lt;/code&gt;, i.e., the smallest difference between adjacent unique values.&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, &lt;code&gt;a = amount&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Add test cases&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does this add anything beyond already existing challenges? &lt;/p&gt;&#xA;" OwnerUserId="67312" LastActivityDate="2019-07-31T12:43:06.980" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17921" PostTypeId="2" ParentId="2140" CreationDate="2019-07-31T19:57:29.870" Score="0" Body="&lt;h1&gt;Output your place&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Your challenge is simple. Output your program's place as an integer at the time of execution. The shortest program is first place, and the earlier submission wins a tie.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If your solution is tied with another in age as well as length, you may output either&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All answers must begin with &lt;code&gt;# [Language Name], [N] bytes&lt;/code&gt; alone on the first line.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may access this page (URL). No URL shorteners are allowed. Standard &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/73884&quot;&gt;IO&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/73884&quot;&gt;loophole&lt;/a&gt; rules hold.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As you may have noticed, this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer (in bytes) wins. Happy golfing!&lt;/p&gt;&#xA;" OwnerUserId="73884" LastActivityDate="2019-07-31T19:57:29.870" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="17922" PostTypeId="2" ParentId="2140" CreationDate="2019-07-31T22:52:51.267" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;WANTEDM?VEMENTANDACALMCOURSE?FE???UENCE&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Inspired by puzzles appearing on my &lt;a href=&quot;http://www.randomstuffonline.com/chat.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;website's chat&lt;/a&gt;, your job (should you choose to accept it) is to accept a string (say &lt;code&gt;(?@Nbgkx¨¾ÃÐÕã÷øĆĊċĎďěĨīĺŏšŴŹǣǩǮ˘͵ΖΫΰξρφ&lt;/code&gt;) and:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Find the Unicode points for the string: &lt;code&gt;[40, 63, 64, 78, 98, 103, 107, 120, 168, 190, 195, 208, 213, 227, 247, 248, 262, 266, 267, 270, 271, 283, 296, 299, 314, 335, 353, 372, 377, 483, 489, 494, 728, 885, 918, 939, 944, 958, 961, 966]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Find the differences between elements: &lt;code&gt;[23, 1, 14, 20, 5, 4, 13, 48, 22, 5, 13, 5, 14, 20, 1, 14, 4, 1, 3, 1, 12, 13, 3, 15, 21, 18, 19, 5, 106, 6, 5, 234, 157, 33, 21, 5, 14, 3, 5]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;For every element in the differences between elements:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the element is less than 27, add it by 64 and output it converted to a Unicode character (e.g. 1 -&gt; &quot;A&quot;, 2 -&gt; &quot;B&quot;, &lt;span class=&quot;math-container&quot;&gt;\$\ldots\$&lt;/span&gt; ).&lt;/li&gt;&#xA;&lt;li&gt;If the element is greater than or equal to 27, output a non-alphabet character (&lt;code&gt;[^A-Za-z]&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The test cases output in uppercase and use the question mark for the non-alphabet character.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(?@Nbgkx¨¾ÃÐÕã÷øĆĊċĎďěĨīĺŏšŴŹǣǩǮ˘͵ΖΫΰξρφ --&amp;gt; WANTEDM?VEMENTANDACALMCOURSE?FE???UENCE&#xA;!1CRYkly¤´ÉãýĉĎġĢİĴķņŊŏŖťűŷ --&amp;gt; PROGRAM?PUZZLESANDCODEGOLF&#xA;!$37&amp;lt;CR^deswz¤«®¶·ÃÏÔâéîā --&amp;gt; CODEGOLFANDC?GCHALLENGES&#xA;!5=BShqt¢¹ÇÍÜôþēĠİĵĹňŞţŵƉƑƖƢƣƽǖǚǩǰȃ -&amp;gt; THEQUIC?WNFOXJUMPEDOVERTHELAZYDOGS&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The difference between the Unicode points for the string will always be greater than 0.&lt;/li&gt;&#xA;&lt;li&gt;The input's Unicode points will be strictly increasing.&lt;/li&gt;&#xA;&lt;li&gt;You may output in lowercase.&lt;/li&gt;&#xA;&lt;li&gt;The non-alphabet character does not need to be consistent.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="83048" LastEditorUserId="83048" LastEditDate="2019-08-01T16:03:03.323" LastActivityDate="2019-08-01T16:03:03.323" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17923" PostTypeId="2" ParentId="2140" CreationDate="2019-08-01T07:57:47.203" Score="6" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/189240/repeated-factorials&quot;&gt;Posted here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="87681" LastEditorUserId="87681" LastEditDate="2019-08-05T07:42:48.260" LastActivityDate="2019-08-05T07:42:48.260" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="17925" PostTypeId="2" ParentId="2140" CreationDate="2019-08-01T22:35:17.703" Score="6" Body="&lt;h1&gt;Cliquish Program&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt; Write a program that accepts a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7764/31957&quot;&gt;character&lt;/a&gt; (or byte, see additional information) as input. Then:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If the character is contained within the source code, output a different character also in your source code.&lt;/li&gt;&#xA;&lt;li&gt;If the character &lt;em&gt;is not&lt;/em&gt; contained within the source code, output a different character also not in your source code.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program (in bytes) wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Additional Information&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program must consist of at least 2 distinct characters.&lt;/li&gt;&#xA;&lt;li&gt;Your program must have at least 2 possible outputs.&lt;/li&gt;&#xA;&lt;li&gt;Your program does not have to be deterministic; it may output a character at random (with any distribution), so long as it conforms to the above criteria.&lt;/li&gt;&#xA;&lt;li&gt;Your program may optionally take a &lt;strong&gt;byte&lt;/strong&gt; as input instead of characters. If you do, the code page the input is written in must contain at least each distinct byte in the source code, as well as at least two different bytes not in the source code.&lt;/li&gt;&#xA;&lt;li&gt;You may take input and give output in any reasonable way. For example, you may take input as a function parameter, a command-line argument, a line from STDIN, a triple-nested array containing a single character, etc. You could output via return value, STDOUT, exit code (if applicable), fax output, etc. The input and output formats must be consistent, however.&lt;/li&gt;&#xA;&lt;li&gt;Your output can only consist of the required character, optionally followed by one trailing newline. Prompt information (such as &lt;code&gt;ans =&lt;/code&gt;) is exempt from this rule; such unpreventable output is acceptable.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="31957" LastEditorUserId="31957" LastEditDate="2019-08-11T18:11:10.303" LastActivityDate="2019-08-11T18:11:10.303" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17927" PostTypeId="2" ParentId="2140" CreationDate="2019-08-02T14:00:08.027" Score="1" Body="&lt;p&gt;I've had an idea for a coding challenge, but I'm a). not 100% certain it's not already been done, and b) not sure if some of the golfing specific languages will trivialise it too much.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Basically the premise is thus:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The scoring for your question is achieved in the following fashion:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;All comments are removed from your script&lt;/li&gt;&#xA;&lt;li&gt;+1 point per character in your script&lt;/li&gt;&#xA;&lt;li&gt;+1 point per character in your output&lt;/li&gt;&#xA;&lt;li&gt;The following algorithm applied to the concatonation of your script and your output:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;+1 point the first time a character shows up&lt;/li&gt;&#xA;&lt;li&gt;-1 point the second time a character shows up&lt;/li&gt;&#xA;&lt;li&gt;-2 points the third time&lt;/li&gt;&#xA;&lt;li&gt;-4 points the fourth time&lt;/li&gt;&#xA;&lt;li&gt;-8 points the fifth&lt;/li&gt;&#xA;&lt;li&gt;double ad infinitum&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The scores for character repetition above are cumulative. So, &lt;code&gt;a&lt;/code&gt; would yield 2 points (1 for length, 1 for first occurance of character). &lt;code&gt;aa&lt;/code&gt; would yield 2 points (2 for length, +1 for first instance, -1 for second instance). &lt;code&gt;aaa&lt;/code&gt; would yield 1 point (3 for length, +1 for 1st, -1 for 2nd, -2 for third)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No standard loopholes&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I'm also not even sure what I would tag this question as.&lt;/p&gt;&#xA;" OwnerUserId="78427" LastEditorUserId="78427" LastEditDate="2019-08-02T14:54:06.993" LastActivityDate="2019-08-02T14:54:06.993" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="17930" PostTypeId="2" ParentId="17919" CreationDate="2019-08-03T21:38:39.257" Score="3" Body="&lt;p&gt;It is not so clear, but we've had discussions about similar topics. A first place to look would be &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11924/new-users-guides-to-golfing-rules-in-specific-languages&quot;&gt;here&lt;/a&gt; but there doesn't seem to be anything about Underload yet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From the &quot;default IO for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&quot;-question it seems that taking inputs as predefined variables is not accepted &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods/14327#14327&quot;&gt;[1]&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods/8731#8731&quot;&gt;[2]&lt;/a&gt; which is also argued to make the answer a &lt;em&gt;snippet&lt;/em&gt; which is not accepted either &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet/2423#2423&quot;&gt;[3]&lt;/a&gt;, but at the same time there seem to be exceptions, for example if you use a variable that just stores the result of the last execution &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8580/24877&quot;&gt;[4]&lt;/a&gt; or if you are using assembly &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods/8508#8508&quot;&gt;[5]&lt;/a&gt; or some form of turing machines &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods/7031#7031&quot;&gt;[7]&lt;/a&gt; (I'm not sure whether this also covers BrainFuck).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One question mentiones Underload in the context of functions &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/16045/definition-of-a-function-in-concatenative-languages&quot;&gt;[6]&lt;/a&gt;, another one also asks about underload and the use of point-free functions &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2441/should-point-free-function-expressions-be-allowed-when-a-function-is-asked-for/11077#11077&quot;&gt;[7]&lt;/a&gt;, so it seems writing lambda expressions/pointfree furnctions to make your submission a &lt;em&gt;function&lt;/em&gt; is the best way to go, because &lt;em&gt;functions&lt;/em&gt; are allowed by default &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet&quot;&gt;[8]&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm not sure about the numbers, but since unary is allowed &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5343/can-numeric-input-output-be-in-unary&quot;&gt;[9]&lt;/a&gt; and using the byte values as numeric input is allowed too &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4708/can-numeric-input-output-be-in-the-form-of-byte-values&quot;&gt;[10]&lt;/a&gt; I'd argue that the default of using Church numerals in Underload should be allowed too.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastActivityDate="2019-08-03T21:38:39.257" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17931" PostTypeId="2" ParentId="2140" CreationDate="2019-08-04T21:42:52.553" Score="2" Body="&lt;h1&gt;Check If A Binary Search Tree Is Balanced&lt;/h1&gt;&#xA;&lt;p&gt;Now posted on CodeGolf.StackExchange.com:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/189285/write-the-shortest-program-to-check-if-a-binary-tree-is-balanced&quot;&gt;Write The Shortest Program To Check If A Binary Tree Is Balanced&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="82881" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-08-07T14:37:15.360" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17933" PostTypeId="2" ParentId="2140" CreationDate="2019-08-05T01:25:29.160" Score="-2" Body="&lt;h1&gt;Recursive Sum Up The Digits&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Produce the shortest code that sums up all the digits in a number, and after if it still has more than one digit, sum it up again and again until it's with one digit, example: &lt;code&gt;987&lt;/code&gt; would become &lt;code&gt;6&lt;/code&gt; since &lt;code&gt;9 + 8 + 7&lt;/code&gt; is &lt;code&gt;24&lt;/code&gt;, whereas &lt;code&gt;2 + 4&lt;/code&gt; is &lt;code&gt;6&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="87922" LastActivityDate="2019-08-05T01:25:29.160" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17936" PostTypeId="2" ParentId="2140" CreationDate="2019-08-05T15:43:51.753" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/189471/decode-a-variable-length-quantity&quot;&gt;Posted to PPCG&lt;/a&gt;.  Thx for the votes!&lt;/p&gt;&#xA;" OwnerUserId="84624" LastEditorUserId="84624" LastEditDate="2019-08-07T15:52:49.937" LastActivityDate="2019-08-07T15:52:49.937" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17937" PostTypeId="2" ParentId="2140" CreationDate="2019-08-06T07:13:40.990" Score="3" Body="&lt;h1&gt;Irish Snap: Variant Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cards&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cards&amp;#39;&quot; rel=&quot;tag&quot;&gt;cards&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Recently, me and a couple of my friends decided to play some cards, and one of them suggested the game 'Irish Snap', which was the inspiration for this challenge. However, I later learnt that the game has a lot of different rules that work ,some of which are listed  &lt;a href=&quot;https://en.m.wikipedia.org/wiki/Slapjack#Irish_Snap&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;. The rules that are in this challenge aren't currently listed on that page, hence the name, 'Variant Rules'&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given an array of 3 cards, output a truthy or falsey value depending on if they make a valid snap in a game of Irish snap.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The input will be an array of 3 numbers, ranging from 1-13 inclusive, with 11 being jack, 12 being queen and 13 being king. The last number in the array will be the number at the top of the stack of cards.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The 4 different criteria for if cards make an Irish snap are a snap:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The top and middle cards are the same&lt;/li&gt;&#xA;&lt;li&gt;The top and middle cards have a difference of one&lt;/li&gt;&#xA;&lt;li&gt;The top and bottom cards are the same&lt;/li&gt;&#xA;&lt;li&gt;The top and bottom cards have a difference of one&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If any of these criteria are met, you must output a truthy value. As well as this, for the two criteria that require the cards to have a difference of one, it 'wraps around', meaning that an ace and a king are considered to have a difference of one, and vice versa.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input -&amp;gt; Output&#xA;1 13 7 -&amp;gt; False&#xA;1 4 13 -&amp;gt; True&#xA;9 3 6 -&amp;gt; False&#xA;8 9 7 -&amp;gt; True&#xA;2 6 5 -&amp;gt; True&#xA;12 5 11 -&amp;gt; True&#xA;10 4 8 -&amp;gt; False&#xA;12 13 7 -&amp;gt; False&#xA;9 7 10 -&amp;gt; True&#xA;7 3 1 -&amp;gt; False&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="87923" LastEditorUserId="87923" LastEditDate="2019-08-06T11:22:12.450" LastActivityDate="2019-08-06T11:22:12.450" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17938" PostTypeId="2" ParentId="2447" CreationDate="2019-08-06T17:50:13.443" Score="19" Body="&lt;h1&gt;Programs and functions may return a boolean value via the presence or absence of output&lt;/h1&gt;&#xA;" OwnerUserId="73884" LastActivityDate="2019-08-06T17:50:13.443" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17939" PostTypeId="1" CreationDate="2019-08-06T19:32:43.560" Score="14" ViewCount="337" Body="&lt;p&gt;Recently there has been a bit of debate as to whether &lt;a href=&quot;https://codegolf.stackexchange.com/questions/153883/cyclic-weak-levenquine?noredirect=1#comment453463_153883&quot;&gt;this question&lt;/a&gt; is a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/116189/cyclic-levenquine&quot;&gt;this question&lt;/a&gt;.  So I though I would bring it to meta where we can have a constructive conversation, not only about those particular questions, but about questions like them in general.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is roughly what is happening so you don't have to read through the questions to get the idea:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The original question is a really hard question, at the time when the second question was asked it was unanswered (it has since been answered however).  The second question is a lot more permissive it generalizes the task and scores answers on how close they are to completing the original task.  That means that any answer from the original challenge will score a perfect score on the newer challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This by the letter of the law runs afoul of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1876/56656&quot;&gt;our consensus on duplicates&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;[W]hen we assess whether a challenge is a duplicate of another, we should ask ourselves &quot;&lt;strong&gt;Can answers from one question be copied over to the other with little or no modification and still be competitive?&lt;/strong&gt;&quot;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;However this is a tiny bit unsatisfactory for a couple of reasons:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The newer question is a lot more approachable.  Having a lower bar for entry users can compete without having to solve the really difficult challenge that was the older one while ambitious users can still compete at the higher level.  This seems good for our site, and thus it seems detrimental to close the newer one as a duplicate.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Some answers on the newer question can not be beaten by answers from the older challenge.  Because of the difficulty of the older challenge it may be impossible to answer it in some languages that may be usable for the newer challenge.  Since we view contests as being separated by language these answers would be competitive, perhaps even unbeatable, on the newer challenge but not allowed on the older challenge. It seems like we should have a place for these answers and the old question does not provide that.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;So while these two specific questions are of no huge importance to the site it would be nice to have a general policy for this sort of conundrum.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am not asking how the current policy applies to this situation.  There have been some minor details pointed out about how the challenges are different, but for the sake of this question on meta I would like to assume that they are in fact duplicates under the current policy, and ask whether the application of the policy is good here or if we should amend the policy in some way.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2019-08-10T01:39:22.057" LastActivityDate="2019-09-10T08:02:15.957" Title="Closing a more general challenge as a duplicate" Tags="|discussion|policy|duplicates|" AnswerCount="1" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="17941" PostTypeId="2" ParentId="2140" CreationDate="2019-08-07T14:20:37.910" Score="1" Body="&lt;p&gt;This puzzle is based on &lt;a href=&quot;https://math.stackexchange.com/q/3261079/3392&quot;&gt;this Math.SE post&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Assume I have some number of black shirts and some number of white shirts, both at least 1. Both colors of shirt have a non-zero durability. All shirts of a given color start with the same durability.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every day, I pick out a clean shirt to wear, and it becomes dirty. Once I run out of all clean black shirts or all clean white shirts, I wash all my dirty shirts of both colors and start over. Clean shirts do not get washed. Whenever a shirt gets washed, its durability goes down by one. Immediately after washing, if the durability of a shirt reaches 0, it must be thrown out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When picking which shirt to wear of a particular color, I always choose a shirt with the highest durability of that color to ensure even wear and tear among shirts.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Take in a sequence of two characters of arbitrary length (eg. b b b w b w w b...) representing my choice of shirt to wear on that day. Continue execution until either my last black shirt or my last white shirt is thrown out. Once this occurs, stop consuming input and halt execution immediately. Note that the program must not consume any more input than is required before halting.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Inputs:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Number of black shirts, number of white shirts, durability of black shirts, durability of white shirts, and an arbitrary number of two single characters, your choice (eg. b and w)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;None. The program must simply halt when the last shirt of either color is thrown away.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 1 1 1 b&#xA;&#xA;1 999 1 999 b&#xA;&#xA;1 999 1 999 w w w w w w w w b&#xA;&#xA;2 999 1 999 b w w w b&#xA;&#xA;2 999 2 999 b w w w b w b w w w b&#xA;&#xA;5 3 6 1 w w w w w b b b b b b b b b b b b b b w&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;General rules:&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins.&lt;/li&gt;&#xA;&lt;li&gt;Default input rules apply for the first four arguments. For the arbitrarily long input sequence after the first four arguments, input must come from a source which can provide input one character or byte at a time, of theoretically infinite length, such as STDIN or some other stream.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="73483" LastEditorUserId="73483" LastEditDate="2019-08-08T02:07:55.683" LastActivityDate="2019-08-08T02:07:55.683" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17942" PostTypeId="2" ParentId="2140" CreationDate="2019-08-07T17:08:33.363" Score="2" Body="&lt;h2&gt;Black Hole Evaporation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Background&lt;/strong&gt;: In empty space, occurring all the time, &lt;a href=&quot;https://en.wikipedia.org/wiki/Quantum_fluctuation&quot; rel=&quot;nofollow noreferrer&quot;&gt;there are pairs of particles that appear and then, usually soon after, cancel each other out&lt;/a&gt;. At a certain distance from a Black Hole, it's possible that a pair of particles might spontaneously appear and, if the distance is just right, one of the particles will fall into the Event Horizon while the other escapes off into space, never getting a chance to cancel each other out. The exit of those particles is &lt;a href=&quot;https://en.wikipedia.org/wiki/Hawking_radiation&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hawking Radiation&lt;/a&gt;. Eventually, this process causes the entire Black Hole to evaporate away.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a string of numbers, emit the negative of the single digit number closest to, in front of, the infinity symbol ∞ (the event horizon), and continue emiting it until there are no digits left in front of the infinity symbol. Then print the rest of the string masking each character uniquely and different from the masked character (burst of energy that might take place at the final instant), excluding any infinity symbols.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test cases&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:                      Output:&#xA;111∞4567                    -1 -1 -1 jkl;&#xA;3∞                          -3&#xA;3-145∞962                   -5 -4 1 -3 ™©®&#xA;4-567-9∞1-23                 9 -7 -6 5 -4 &#xA;2-1∞                        1 -2&#xA;34∞67∞89                    -4 -3 9876&#xA;-123∞456                    -3 -2 1 ♫♪#&#xA;6-6∞6                       6 -6 ä&#xA;48120∞                      0 (or -0) -2 -1 -8 -4&#xA;---5∞555                    5 オゼヰ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Anything after the first infinity symbol can be ignored as it has fallen into the Black Hole and we know nothing more about it anyway until after evaporation, where the information is a bit scrambled.&lt;/li&gt;&#xA;&lt;li&gt;The code should only expect numbers, negations, and infinity symbols. No decimal points or other symbols. The input can be an array, list, etc..., but &lt;em&gt;each character must be separate&lt;/em&gt;, including the negation and infinity characters.&lt;/li&gt;&#xA;&lt;li&gt;A negation only applies to the single digit immediately after it. See the test cases above.&lt;/li&gt;&#xA;&lt;li&gt;You may mask the remaining characters after evaporation with any character set of your choice, as long as the resulting character is different from the masked character, and each character in the resulting output is unique. For languages limited to smaller character sets (or type constraints), characters may repeat after each possible unique character has already been utilized in the output.&lt;/li&gt;&#xA;&lt;li&gt;You may use the '_' symbol instead of the '∞' symbol.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;General rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes in its respective language wins.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet/2422#2422&quot;&gt;Standard rules apply&lt;/a&gt; for your answer with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods/&quot;&gt;default I/O rules&lt;/a&gt;, so you are allowed to use STDIN (with the specification above)/STDOUT, functions/method with the proper parameters and return-type, full programs. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Default Loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;If possible, please add a link with a test for your code (&lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="81263" LastEditorUserId="81263" LastEditDate="2019-08-15T06:24:56.503" LastActivityDate="2019-08-15T06:24:56.503" CommentCount="19" ContentLicense="CC BY-SA 4.0" />
  <row Id="17944" PostTypeId="1" CreationDate="2019-08-08T16:42:44.217" Score="8" ViewCount="278" Body="&lt;p&gt;I posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/189110/gold-battle-koth&quot;&gt;this&lt;/a&gt; challenge about a week ago, and it has since become fairly popular with nearly 40 answers. In the &lt;a href=&quot;https://chat.stackexchange.com/rooms/96920/gold-battle-koth&quot;&gt;chatroom&lt;/a&gt;, a user asked whether teaming was allowed. I said it was, if someone could figure out how it could even work.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Two teaming bots were posted shortly after, one of which easily taking first place. Due to the rule that a bot may not target another specifically, it was difficult to top them. After lots of arguing in the chatroom, we're unable to reach an agreement on what to do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some bots have been designed to use the teaming bot's IDing system to keep from being targeted by them. A few of our proposed solutions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Ban teaming&lt;/li&gt;&#xA;&lt;li&gt;Allow teaming without IDing&lt;/li&gt;&#xA;&lt;li&gt;Restrict further entries&lt;/li&gt;&#xA;&lt;li&gt;Allow teaming but restrict certain actions&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;What is usually done in these sorts of situtations?&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2019-08-08T19:00:44.933" Title="Existing answers in KoTH invalidated by teaming; should it be allowed?" Tags="|discussion|" AnswerCount="1" CommentCount="17" ContentLicense="CC BY-SA 4.0" />
  <row Id="17945" PostTypeId="2" ParentId="2140" CreationDate="2019-08-08T18:46:55.560" Score="-1" Body="&lt;p&gt;Here's a challenge I'd like post because I'm curious to see what people will come up with. It's a bit of an anti-code-golf question because the code should look normal.&lt;/p&gt;&#xA;&lt;p&gt;Is it clear what the constraints? Did I miss anything?&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;Write a piece of &lt;strong&gt;unsuspicious&lt;/strong&gt; code that does the following:&lt;/p&gt;&#xA;&lt;p&gt;Let's say you've written a parser that parses it's input line by line and somewhere in your code is&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;find_string(line, &amp;quot;[start]&amp;quot;, &amp;quot;[end]&amp;quot;) // returns string between [start] and [end]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This program, when given it's own source code plain text as input, will match that line (twice actually); but we don't want that. It should still parse what it was designed for but not match any line of it's own source code.&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's preferred that your code makes it obvious that one of it's intended uses is to parse (and not match) itself. This is so anyone 'refactoring' the code will not accidentally undo the trick that made it work.&lt;/li&gt;&#xA;&lt;li&gt;Your source code as input will be reduced to a single line.&lt;/li&gt;&#xA;&lt;li&gt;Your program should be able to handle large input (~10mb) and perform reasonably (for your chosen language).&lt;/li&gt;&#xA;&lt;li&gt;Your program does not need to parse the input line by line but that just seems like something reasonable code would do.&lt;/li&gt;&#xA;&lt;li&gt;Points are awarded for code that looks like a normal parser and contains as little assumptions about the input as possible. Bonus points for solutions that contain the &lt;code&gt;start&lt;/code&gt; and &lt;code&gt;end&lt;/code&gt; delimiters in that order.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Easy solutions are to swap the start and end token arguments or to pre-treat the tokens in some way but that would look suspicious. Someone will come along and refactor your code and break the 'trick'.&lt;/p&gt;&#xA;&lt;p&gt;I'm interested in reasonable solutions because this is a reduction of a real life problem.&lt;/p&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input lines may or may not contain &lt;code&gt;[start]&lt;/code&gt; or &lt;code&gt;[end]&lt;/code&gt;, only return it in the output when it occurs in a pair.&lt;/li&gt;&#xA;&lt;li&gt;Input lines will never contain more than one pair of &lt;code&gt;[start]&lt;/code&gt; and &lt;code&gt;[end]&lt;/code&gt; tokens.&lt;/li&gt;&#xA;&lt;li&gt;Input lines may contain additional content before &lt;code&gt;[start]&lt;/code&gt; or after &lt;code&gt;[end]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Your source code plain text will be inserted at a random line in the input.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Input #1:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[start]hello[end]&#xA;&amp;lt;&amp;lt;your source code plain text&amp;gt;&amp;gt;&#xA;dont output this[start]world[end]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output #1:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;hello world&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input #2:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;lorem[start]i solemnly[end]&#xA;[start]false start&#xA;[start]swear[end]&#xA;ope, sorry just passing through&#xA;this is not the[end]&#xA;[start]that i'm up to[end]ipsum&#xA;[start]no[end]dolor&#xA;&amp;lt;&amp;lt;your source code plain text&amp;gt;&amp;gt;&#xA;[start]good[end]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output #2:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;i solemnly swear that i'm up to no good&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="88504" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-08-08T18:46:55.560" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17946" PostTypeId="2" ParentId="17944" CreationDate="2019-08-08T19:00:44.933" Score="13" Body="&lt;h1&gt;Disallow Teams Entirely&lt;/h1&gt;&#xA;&lt;p&gt;Going to post this as its my opinion on the matter. The whole idea was actually my fault, too. It was a loophole in the original rules that wasn't explicitly mentioned but which skirted the boundaries of what &lt;em&gt;was&lt;/em&gt; listed. I voiced the idea in chat with the expectation that it would be a cute attempt, but get blocked for violating the spirit of the challenge. SuperStormer just happened to actually write up a pair of submissions before I'd move on from just thinking about it to actually writing code.&lt;/p&gt;&#xA;&lt;p&gt;I did this with &lt;a href=&quot;https://codegolf.stackexchange.com/a/183201/47990&quot;&gt;Adventures in the Ruins&lt;/a&gt; too, and while it was deemed illegal, it also wasn't &lt;em&gt;a long term winner&lt;/em&gt; due to the structure of the challenge: as only 8 bots would be run at a time, winning bots would play again and losing bots would be eliminated, until only 8 remained and those would then play for the final score. As one of the team &lt;em&gt;literally sacrificed itself&lt;/em&gt; for the other, it would not move on to the next round. It was silly but a fun out-of-the-box bot.&lt;/p&gt;&#xA;&lt;p&gt;Most of the suggested rules on how to limit teams has been very subjective or otherwise near unenforceable (e.g. &amp;quot;the owner of the team has to give you permission to identify as the team&amp;quot;: this means that if the team is posted performing a given set of moves to identify team members, &lt;em&gt;no other bot can ever perform those same moves&lt;/em&gt; which is silly).&lt;/p&gt;&#xA;&lt;p&gt;Several other factors come into play as well, regarding what methods a solo bot can perform to defend itself against a coordinated attack from a team of bots, and as things currently stand, there is nothing a solo bot can do that's allowed. Or how is a team scored with regards to its placement in the challenge? Does the &lt;code&gt;worth&lt;/code&gt; of the highest single bot counted? Is it the average among all team members? How does the controller know what's a team and what isn't without alterations to the controller that doesn't render it a unique challenge?&lt;/p&gt;&#xA;&lt;p&gt;I have nothing against team-based challenges, but this one wasn't meant to be one and it should stay that way.&lt;/p&gt;&#xA;" OwnerUserId="47990" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-08-08T19:00:44.933" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17947" PostTypeId="2" ParentId="2140" CreationDate="2019-08-08T19:32:35.853" Score="1" Body="&lt;h1&gt;Calculate mobile data coverage&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You've been hired by the HQ of Vodafizon - a relatively new mobile network provider interested in spreading to the global market. In particular, your job description involves working as a marketing rep to produce ads for each country, where you give a figure of the data coverage, as a percentage, in that country. You get this data from the data scientists, but you've started to notice a pattern: the number always seems to be 98%, 99% or 100% (which, in your experience, seems to be far too high). Despite your trust in Vodafizon, you seem to find this suspicious, so you write your own program to investigate, ensuring maximum precision, even implementing your own floating-point and circle rasterization algorithm to minimize error. You end up making a 112KB monster of a program, but the result confirms your suspicions: these figures are, for the most part, made up by the data scientists, to try and exaggerate their claims.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When you mention this discovery to a coworker, they act surprised at first, but later tell you to keep quiet: upper management probably know about the forgery, and in fact endorse it. Telling them that you know their dirty secret &lt;s&gt;could&lt;/s&gt; will result in losing your job.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But here's the thing: you know that advertising these fake numbers could result in massive lawsuits to Vodafizon, the effects of which could result in you getting laid off. You know you can't risk getting fired, but just using the data scientists' figures could be disastrous in the long term.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After consulting Workplace SE, you come up with a plan: keep using your program, but hide it from your superiors. The only issue is, that the data scientists responsible for providing you the data also happen to be the makeshift sysadmins in Vodafizon HQ, so your program can't attract too much attention to itself. 112KB is far more than Vodafizon uses on average (they prefer to split code into lots of tiny files), so when filtering through by file type, the sysadmins will easily see this file as potentially twenty times larger than all the others. So clearly, you need to compress it, without sacrificing the accuracy.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input will consist of a nested array of form &lt;code&gt;[[x, y], [x, y]]&lt;/code&gt; (or alternatively an object of form &lt;code&gt;[{&quot;x&quot;:x, &quot;y&quot;:y}, {&quot;x&quot;:x, &quot;y&quot;:y}]&lt;/code&gt;) of line segments, in clockwise order, defining the border of a country.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input will also contain a nested array of form &lt;code&gt;[[x, y, strength], [x, y, strength]]&lt;/code&gt; (or an object of form &lt;code&gt;[{&quot;x&quot;:x, &quot;y&quot;:y, &quot;s&quot;:strength}, {&quot;x&quot;:x, &quot;y&quot;:y, &quot;s&quot;:strength}]&lt;/code&gt;), which will describe the location of the mobile data towers, and the strength: the radius (or diameter, you can request either in your answer (but not both)) of the circle in which that given tower provides mobile data.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program should output an &lt;strong&gt;approximation&lt;/strong&gt; of the mobile data coverage of the input given. Of course, this is impossible to get perfect (&lt;a href=&quot;https://en.wikipedia.org/wiki/Indiana_Pi_Bill&quot; rel=&quot;nofollow noreferrer&quot;&gt;unless you live in Indiana, that is&lt;/a&gt;), so you need to provide an approximation, but while reducing your byte count as much as possible. Note that your program &lt;strong&gt;must halt&lt;/strong&gt; by itself before 5 seconds of runtime (for any test where the number of towers is less than or equal to 500, and the number of edges is less than 100), or alternatively continuously provide output such that once it is stopped after 5 seconds, the last output will be taken as the result.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Like I mentioned, my program also needs to be small, therefore size will factor into the equation. So, to score your program:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Get the number of bytes, B&lt;/li&gt;&#xA;&lt;li&gt;Run your code with the randomly-generated test cases provided by &lt;code&gt;tests.py&lt;/code&gt; in this repo, and save the &lt;code&gt;ref&lt;/code&gt; outputted.&lt;/li&gt;&#xA;&lt;li&gt;Run your outputs through &lt;code&gt;score.py&lt;/code&gt;, providing the &lt;code&gt;ref&lt;/code&gt; at the start. The last input you will be asked for will be B.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Get the score outputted by &lt;code&gt;score.py&lt;/code&gt;, and post it in your answer.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is my background too long?&lt;/li&gt;&#xA;&lt;li&gt;Is my scoring system too long-winded? I intend to use a complex algorithm (which I have mentally worked out, but not coded yet) which essentially creates a weighted average of all of the scores as a percentage of a value which is correct to 16 decimal places. Is referring people to some code, instead of telling them the algorithm, standard practice? I don't want to spend ages describing a confusing algorithm, when I could just write a program to do it.&lt;/li&gt;&#xA;&lt;li&gt;Is this challenge not a duplicate? Is is unclear in any way?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="85546" LastActivityDate="2019-08-08T19:32:35.853" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17948" PostTypeId="2" ParentId="2140" CreationDate="2019-08-09T01:21:04.410" Score="2" Body="&lt;h1&gt;Find the Lowest Common Ancestor of Two Nodes In A Binary Tree&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Any two separate nodes in a binary tree have a common ancestor, which is the root of a binary tree. The lowest common ancestor(LCA) is thus defined as the node that is &lt;strong&gt;furthest from the root&lt;/strong&gt; and that is the ancestor of the two nodes. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following are binary trees and the lowest common ancestors of the some of their nodes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/KNwp0.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/KNwp0.gif&quot; alt=&quot;Binary Tree 1&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The LCA of 13 and 15 is 14.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The LCA of 47 and 49 is 48.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The LCA of 4 and 45 is 40.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The LCA of 13 and 14 is 14.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write the shortest program possible that accepts as input the root of a binary tree and references to any two nodes in the binary tree. The program returns a reference to the LCA node of the two inputted nodes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Restriction&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The binary tree &lt;strong&gt;does not&lt;/strong&gt; have nodes with parent field references in any form. You &lt;strong&gt;may not&lt;/strong&gt; use parent field references in your program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;strong&gt;root of a binary tree&lt;/strong&gt; and &lt;strong&gt;references to any two nodes in the binary tree&lt;/strong&gt;. This may be in the form of a reference to the root object or even a list that is a valid representation of a binary tree.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Returns &lt;strong&gt;a reference&lt;/strong&gt; to the node that is the LCA of the two inputted nodes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Definition of a Binary Tree&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A tree is an object that contains a value and either two other trees or pointers to them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The structure of the binary tree looks something like the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;typedef struct T&#xA;{&#xA;   struct T *l;&#xA;   struct T *r;&#xA;   int v;&#xA;}T;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If using a list representation for a binary tree, it may look something like the following:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[root_value, left_node, right_node]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="82881" LastEditorUserId="82881" LastEditDate="2019-08-09T01:31:32.547" LastActivityDate="2019-08-09T01:31:32.547" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17949" PostTypeId="2" ParentId="2140" CreationDate="2019-08-09T04:56:15.967" Score="0" Body="&lt;h2&gt;Buffer Evaluation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a printable ASCII string, but with leading spaces(0x20) and backspaces(0x08), return it &quot;buffer-evaluated&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For the inputted line, if you encounter a space, enter a space; otherwise, remove the rightmost character.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you encounter a backspace when the buffer is empty, simply do nothing.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;After the inputted program, if the cursor is 0, output an optional trailing newline. If the cursor is not 0, output the string in the buffer and an optional trailing newline.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://tio.run/##Sy82@v//Uc9qIFJQUACTunZAlgIXiFCAyEAQUJwLWUjXjuv/fwA&quot; rel=&quot;nofollow noreferrer&quot;&gt;Example(s) and expected output&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;; the shortest answer wins.&#xA;&lt;hr&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-08-09T07:28:52.277" LastActivityDate="2019-08-09T07:28:52.277" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="17950" PostTypeId="1" CreationDate="2019-08-09T11:13:05.123" Score="11" ViewCount="197" Body="&lt;p&gt;I'm golfing in Lua, which does support such thing as multiple return values like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function multret()&#xA;    return 1, 'hello'&#xA;end&#xA;&#xA;local a,b = multret()&#xA;-- a is 1, b is 'hello'&#xA;local c = multret()&#xA;-- c is 1&#xA;print(multret())&#xA;-- print &quot;1&amp;lt;tab&amp;gt;hello&quot;&#xA;local tab = {multret()}&#xA;-- create table (array) containing all returned results (equal to {1, 'hello'})&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now, my problem exactly: there is library function &lt;code&gt;string.gsub&lt;/code&gt; whose result I directly return from my function. This lead to two values being returned from my submission: resulting string (answer required) and amount of replacements done.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it fine to return garbage values after required results? I think so, because assigning them to value (like in my example with variable &lt;code&gt;c&lt;/code&gt;) will lead to same result, just want to be sure. In other words, would my &lt;code&gt;multret&lt;/code&gt; function be a valid answer to challenge asking to &quot;create function which return 1&quot;?&lt;/p&gt;&#xA;" OwnerUserId="59169" LastEditorUserId="59169" LastEditDate="2019-08-09T12:51:43.630" LastActivityDate="2019-08-09T12:51:43.630" Title="May I return more results than specified?" Tags="|discussion|rules|output|" AnswerCount="0" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17951" PostTypeId="2" ParentId="2140" CreationDate="2019-08-10T11:11:45.393" Score="1" Body="&lt;p&gt;tags: &amp;quot;code-golf&amp;quot;, &amp;quot;ellipse&amp;quot;, &amp;quot;geometry&amp;quot;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&lt;p&gt;Is this a proper code-golf question?&lt;/p&gt;&#xA;&lt;p&gt;A major challenge is: How to verify the computed shape? Numerical verification is impossible, since there are infinitely many possible solutions. Is there an easy way to plot xy-data online, or should I provide a script myself? Your suggestions are greatly appreciated.&lt;/p&gt;&#xA;&lt;h3&gt;edit:&lt;/h3&gt;&#xA;&lt;p&gt;after 3 days of being posted here in the sandbox, I still have no clear answer to the above question. I therefore propose to ask participants to include their own plot in the answer, which they can make with whatever plotting tool they wish. If people feel inclined to cheating, they only fool themselves, don't they?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;To create a circle you can stick a nail in a piece of board, put a loop of string around it and hold it taut with a pencil at the other end. Move the pencil and you get a circle. If you put the loop of string around two nails and move your pencil, you create an ellipse. But what happens if you use three nails, or four, or ten perhaps? It's gonna get ugly soon if you try this in real life, and that's where computers come in handy.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to write a program or function that accepts &lt;strong&gt;two inputs&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A list of (x,y) coordinates (viz. the nails), of arbitrary length&amp;gt;2.&lt;/li&gt;&#xA;&lt;li&gt;The length of the rope.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And produces the following &lt;strong&gt;output&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A list of coordinates of the poly-oval, which could be fed to a plotting-tool. Plotting the output does not need to be part of your program!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;References&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A graphical example can be found here: &lt;a href=&quot;https://www.robertdickau.com/oval.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Robert Dickau&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Some handy math on ellipses: &lt;a href=&quot;http://www.ambrsoft.com/TrigoCalc/Circles2/Ellipse/Ellipse.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;ambrsoft&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Details:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You may assume that the input coordinates form a convex shape (no inner points on which your program could crash).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;As coordinates, you can use tuples, pairs, complex numbers or even two separate scalars if you like.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The output resolution (ie. the length of the list) is not so important, but is should give a fair representation of the real curve. In my experience, you'll need between 100 and 1000 points. For smaller rope lengths, you need an even higher resolution.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Rules and scoring:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is code-golf, so shortest answer in bytes for each language wins.&lt;/li&gt;&#xA;&lt;li&gt;Standard rules and default I/O rules apply.&lt;/li&gt;&#xA;&lt;li&gt;Loopholes forbidden (of course).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;Provide at least one example input and output. Make sure they match your own description of what the input should look like.&lt;/p&gt;&#xA;&lt;p&gt;Input can be any of the following:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;P = [2+0j, -2+1j, -2-1j]&lt;/p&gt;&#xA;&lt;p&gt;P = [(2,0),(-2,1),(-2,-1)]&lt;/p&gt;&#xA;&lt;p&gt;X = [2,-2,-2] and Y = [0,1,-1]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Output should be in one of the following forms:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;[0.862+1.591j, 0.703+1.668j, 0.527+1.729j, ...]&lt;/p&gt;&#xA;&lt;p&gt;[(0.862,1.591), (0.703,1.668), (0.527,1.729), ...]&lt;/p&gt;&#xA;&lt;p&gt;X = [0.862, 0.703, 0.527, ...], Y = [1.591, 1.668, 1.729, ...]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="67860" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-08-14T16:29:25.583" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17953" PostTypeId="2" ParentId="14737" CreationDate="2019-08-10T17:49:02.480" Score="2" Body="&lt;h2&gt;Keg&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Keg is a tiny language designed by Jono 2906 that is astonishingly very powerful for code golfing.&#xA;&lt;a href=&quot;https://tio.run/#keg&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Reasons&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is very easy to learn, with well-thought of built-in utilities that are very powerful.&lt;/li&gt;&#xA;&lt;li&gt;It have unique golfing features that other languages have not implemented; e.g. the auto-pushing mechanism, that makes representing large numbers using a few bytes possible.&lt;/li&gt;&#xA;&lt;li&gt;It is fun. Golfing in it is very easy, as it provides a lot of ways to code-golfing programs. Also, if you golfed it hard enough, you will find that it can compete with other well-known golfing languages.&lt;/li&gt;&#xA;&lt;li&gt;And perhaps most importantly, only a few people are using it!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user85052" LastActivityDate="2019-08-10T17:49:02.480" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17954" PostTypeId="2" ParentId="2140" CreationDate="2019-08-10T20:41:47.890" Score="0" Body="&lt;h1&gt;Crossing Sequences&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/189857/crossing-sequences&quot;&gt;Posted&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="69880" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-08-13T04:21:35.860" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17955" PostTypeId="2" ParentId="17939" CreationDate="2019-08-11T08:01:29.060" Score="2" Body="&lt;p&gt;The purpose of the policy is that I shouldn't be able to reuse the same answer to multiple questions. It avoids negative effects including:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Accusations of rep farming by submitting the same answer multiple times&lt;/li&gt;&#xA;&lt;li&gt;Accusations of stealing someone else's answer from the first question&lt;/li&gt;&#xA;&lt;li&gt;A multi-bump effect where whenever I improve my score I have to edit two answers and in so doing bump two questions.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;In my opinion, the appropriate way to handle a situation where hard question A has been unanswered for a couple of months and I have an idea for easier variant B for which answers to A will be unbeatable is to engage the author of question A and propose that they edit it to variant B, if necessary using their original scoring criterion as a tie-breaker.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2019-08-11T08:01:29.060" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17956" PostTypeId="2" ParentId="7804" CreationDate="2019-08-11T21:55:59.580" Score="0" Body="&lt;p&gt;&lt;em&gt;Hope you don't mind me posting this here instead of linking to the sandbox post - it's more of a rough idea than something I could even begin to make a formal writeup for.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I just came up with this idea recently, but don't have the patience to work out objective rules, or even the input format.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Essentially, I recently saw &lt;a href=&quot;https://www.youtube.com/channel/UCBa659QWEk1AI4Tg--mrJ2A&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tom Scott&lt;/a&gt;'s &lt;a href=&quot;https://www.youtube.com/watch?v=fS4X1JfX6_Q&quot; rel=&quot;nofollow noreferrer&quot;&gt;video&lt;/a&gt; on the way the internet has taken over grammatical structures, such as punctuation and capitalisation, to give them a much more complex meaning that can &lt;em&gt;almost&lt;/em&gt; convey all of the intonation and registers we use in normal, verbal conversation. So, I thought that some sort of challenge, that takes an input somehow describing the intentions of a post (e.g &quot;this sentence is a rhetorical question&quot;, &quot;I'm talking formally now&quot;, &quot;put emphasis on this phrase&quot;), can convert it into 'internet format', using just the few examples of rules that are used in the video. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Alternatively, you may want to reverse the challenge, and make an internet-speak decoder.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some potential ideas for input format:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A nested object, consisting of different parts, arranged in literal order (the order they appear in the sentence). This would be a good &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge. The parts are separated according to where new info needs to be introduced, so you may have something like:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;...&#xA;{&#xA;  type: &quot;sentence&quot;,&#xA;  contains: [&#xA;    {&#xA;      type: &quot;phrase&quot;,&#xA;      text: &quot;And how are&quot;&#xA;    },&#xA;    {&#xA;      type: &quot;phrase&quot;,&#xA;      text: &quot;you&quot;,&#xA;      emphasis: true&#xA;    },&#xA;    {&#xA;      type: &quot;phrase&quot;,&#xA;      text: &quot;today?&quot;&#xA;    }&#xA;  ],&#xA;  ...&#xA;}&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Potentially, it could take audio input along with a transcript, so it needs to detect intonation too. This could potentially be used in a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; challenge, where the number of layers/weights, as well as the accuracy, all contribute to a final score.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In the case you decide to use the reverse (decoding) challenge idea instead, simply inputting Internet-speak and outputting normal English will do too.&lt;/p&gt;&#xA;" OwnerUserId="85546" LastActivityDate="2019-08-11T21:55:59.580" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17957" PostTypeId="2" ParentId="2140" CreationDate="2019-08-12T01:44:00.877" Score="2" Body="&lt;h1&gt;BotNets KotH&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Controller, Example and Submission Template now added&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;em&gt;flavor text not yet written&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a web-based JS KotH where submissions have 2 parts, a Worker Bot and a Controller Bot. The goal is to have the most gold at the end of the game, by killing other bots and collecting gold found on the grid, while navigating the grid and surviving.&lt;/p&gt;&#xA;&lt;h1&gt;Worker Bots&lt;/h1&gt;&#xA;&lt;p&gt;A Worker Bot is a class(ES6 or ES5) based on this format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;class YourWorkerBot extends WorkerBot {&#xA;    performAction(message) {}&#xA;    sendMessage(x, y, surroundings) {}&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Each botnet has 20 Worker Bots. For every botnet, its worker bots are&lt;/p&gt;&#xA;&lt;h3&gt;Method Descriptions:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;constructor(index)&lt;/code&gt;: sets the color that the controller displays the bot as&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;performAction(message)&lt;/code&gt;: returns an action(described below).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;sendMessage(x,y,surroundings)&lt;/code&gt;: &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; are zero-indexed coordinates. &lt;code&gt;surroundings&lt;/code&gt; is a flat array of the 5x5 area around the bot. returns message(string) to send to controller bot&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Actions&lt;/h3&gt;&#xA;&lt;p&gt;Each move is formatted as a 2 element list(&lt;code&gt;[action, param]&lt;/code&gt;) where &lt;code&gt;action&lt;/code&gt; is a string&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Movement&lt;/strong&gt;: formatted as &lt;code&gt;[&amp;quot;move&amp;quot;, square]&lt;/code&gt; where &lt;code&gt;square&lt;/code&gt; is an integer that represents the square you want to move to, using the same index as the &lt;code&gt;surroundings&lt;/code&gt; object. You can only move one square orthogonally or diagonally. Moving onto a square with a coin will collect the coin.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Kill&lt;/strong&gt;: formatted as &lt;code&gt;[&amp;quot;kill&amp;quot;, square]&lt;/code&gt; where &lt;code&gt;square&lt;/code&gt; is an integer that represents the square you want to attack, using the same index as the &lt;code&gt;surroundings&lt;/code&gt; object. You can only kill a bot one square orthogonally or diagonally. If you kill a square with no bot, you do nothing. You get half the coins(rounded down) of the bot you attacked.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;EMP&lt;/strong&gt;: formatted as &lt;code&gt;[&amp;quot;emp&amp;quot;,undefined]&lt;/code&gt;. It causes all bots including itself in the 7x7 surrounding area can't move next turn. This costs 3 coins.&lt;/li&gt;&#xA;&lt;li&gt;Any invalid action is treated as you doing nothing.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Surroundings&lt;/h3&gt;&#xA;&lt;p&gt;The &lt;code&gt;surroundings&lt;/code&gt; object will be a flat array of the 5x5 area around you, starting from the top left corner and going left to right and top to bottom. The grid below shows how the indexes of the array map to the actual grid area. Each square will be either a string, where &amp;quot;B&amp;quot; is a bot, &amp;quot;C&amp;quot; is a coin, &amp;quot;E&amp;quot; is an edge(not a valid move target) and &amp;quot;&amp;quot; is empty.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 0  1  2  3  4&#xA; 5  6  7  8  9&#xA;10 11 12 13 14&#xA;15 16 17 18 19&#xA;20 21 22 23 24&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Controller Bot&lt;/h1&gt;&#xA;&lt;p&gt;A Controller Bot is a class(ES6 or ES5) that extends the following class:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;class YourControllerBot extends ControllerBot{&#xA;    constructor(locations){&#xA;         super(locations)    &#xA;         this.storage=&amp;quot;&amp;quot;&#xA;    }&#xA;    sendMessage(messages,index){&#xA;         return &amp;quot;&amp;quot;&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Each botnet has only 1 Controller Bot.&lt;/p&gt;&#xA;&lt;h3&gt;Method Descriptions&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;constructor(locations)&lt;/code&gt;: &lt;code&gt;locations&lt;/code&gt; is an array of the initial locations([x,y]) of the worker bots.sets initial storage value&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;sendMessage(messages,index)&lt;/code&gt;: &lt;code&gt;messages&lt;/code&gt; is a list of lists of the messages sent by all the worker bots(not just your own), always in the same order and grouped by botnet. returns message to its worker bots whose index is &lt;code&gt;index&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;The Game&lt;/h1&gt;&#xA;&lt;p&gt;The arena will be a 100x100 grid with 100 random coins scattered around it. Each game will have 1000 rounds and will have up to 15 randomly selected botnets. Every round, 10 coins will spawn at a random unoccupied spot. Every worker bot will get 1 turn per round. Each botnet's worker bots will perform an action in the same order for the entire game, but the order in which botnets take turns is randomized every round. Every turn, all the worker bots' &lt;code&gt;sendMessage&lt;/code&gt; methods will be called(not just the worker bot taking the turn). After that, the controller bot's &lt;code&gt;sendMessage&lt;/code&gt; method will be called. Finally, the worker bot's &lt;code&gt;performAction&lt;/code&gt; method will be called and the action will be executed. This will repeat for every worker bot in a round.&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;Each botnet's score is the sum of the coins collected by each of the worker bots. Botnets are ranked by most score.&lt;/p&gt;&#xA;&lt;h1&gt;Controller(WIP)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://botnets-koth.firebaseapp.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://botnets-koth.firebaseapp.com&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;function sampleBotnet() {&#xA;    class SampleControllerBot extends ControllerBot {&#xA;        constructor(locations) {&#xA;            super(locations);&#xA;            this.storage = &amp;quot;&amp;quot;;&#xA;        }&#xA;        sendMessage(messages, index) {&#xA;            let surrondings = messages.find(message =&amp;gt; message[0] === index)[1];&#xA;            let otherBot = surrondings.findIndex(&#xA;                (square, i) =&amp;gt;&#xA;                    square === &amp;quot;B&amp;quot; &amp;amp;&amp;amp; [6, 7, 8, 11, 13, 16, 17, 18].includes(i)&#xA;            );&#xA;            if (otherBot !== -1) {&#xA;                return [&amp;quot;kill&amp;quot;, otherBot];&#xA;            }&#xA;            let coin = surrondings.findIndex(&#xA;                (square, i) =&amp;gt;&#xA;                    square === &amp;quot;C&amp;quot; &amp;amp;&amp;amp; [6, 7, 8, 11, 13, 16, 17, 18].includes(i)&#xA;            );&#xA;            if (coin !== -1) {&#xA;                return [&amp;quot;move&amp;quot;, coin];&#xA;            }&#xA;            let validMoves = [6, 7, 8, 11, 13, 16, 17, 18].filter(&#xA;                x =&amp;gt; surrondings[x] === &amp;quot;&amp;quot;&#xA;            );&#xA;            return [&#xA;                &amp;quot;move&amp;quot;,&#xA;                validMoves[Math.floor(Math.random() * validMoves.length)]&#xA;            ];&#xA;        }&#xA;    }&#xA;    class SampleWorkerBot extends WorkerBot {&#xA;        performAction(message) {&#xA;            return message;&#xA;        }&#xA;        sendMessage(x, y, surroundings) {&#xA;            return [this.index, surroundings];&#xA;        }&#xA;    }&#xA;    return {&#xA;        name: &amp;quot;SampleBotnet&amp;quot;,&#xA;        color: &amp;quot;red&amp;quot;,&#xA;        controllerBot: SampleControllerBot,&#xA;        workerBot: SampleWorkerBot&#xA;    };&#xA;}&#xA;&#xA;#Submission Template&#xA;```javascript&#xA;/* eslint constructor-super:0,no-this-before-super:0,no-unused-vars:0*/&#xA;import ControllerBot from &amp;quot;./src/scripts/ControllerBot.js&amp;quot;;&#xA;import WorkerBot from &amp;quot;./src/scripts/WorkerBot.js&amp;quot;;&#xA;&#xA;//copy the part below&#xA;function yourBotnet() {&#xA;    class YourControllerBot extends ControllerBot {&#xA;        constructor(locations) {&#xA;            super(locations);&#xA;            this.storage = &amp;quot;&amp;quot;;&#xA;        }&#xA;        sendMessage(messages, index) {&#xA;            return [];&#xA;        }&#xA;    }&#xA;    class YourWorkerBot extends WorkerBot {&#xA;        performAction(message) {}&#xA;        sendMessage(x, y, surroundings) {}&#xA;    }&#xA;    return {&#xA;        name: &amp;quot;YourBotnet&amp;quot;,&#xA;        color: &amp;quot;&amp;quot;,&#xA;        controllerBot: YourControllerBot,&#xA;        workerBot: YourWorkerBot&#xA;    };&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard Loopholes&lt;/a&gt; apply&lt;/li&gt;&#xA;&lt;li&gt;Bots cannot modify or add global variables&lt;/li&gt;&#xA;&lt;li&gt;Bots cannot call controller functions or other bots' methods&lt;/li&gt;&#xA;&lt;li&gt;Bots cannot read or modify other bots storage&lt;/li&gt;&#xA;&lt;li&gt;Bots may not access the internet&lt;/li&gt;&#xA;&lt;li&gt;I may disqualify any bot which does anything I deem to be cheating.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the bar to entry too high?&lt;/li&gt;&#xA;&lt;li&gt;Can the current turn/round system be improved?&lt;/li&gt;&#xA;&lt;li&gt;Any better names for the 2 bots/title?&lt;/li&gt;&#xA;&lt;li&gt;Is there enough room for creativity?&lt;/li&gt;&#xA;&lt;li&gt;Would it be better if I merged the 2 classes into one class?&lt;/li&gt;&#xA;&lt;li&gt;Is there anything broken with the spec?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="70761" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-08-22T14:45:01.243" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17960" PostTypeId="2" ParentId="2140" CreationDate="2019-08-12T12:43:49.467" Score="0" Body="&lt;h1&gt;A triangle is worth a thousand lines&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Vulkan_(API)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Vulkan&lt;/a&gt; is a relatively new cross-platform graphics API which is very powerful yet extremely verbose and detailed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Arguably one of the most infamous saying on Vulkan, especially among beginners is, &quot;The 1000 Lines journey&quot;. That is, getting a simple triangle to render on the screen takes a ton of code (~1k lines of C/C++).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;It's time to break, nay, golf the stigma!&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your challenge is writing a valid Vulkan-API based program which outputs a triangle to the screen. The windowing system is up to your choice as well as the colors/size of the triangle/screen itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The final script/compiled program should be able to be executed (preferably on a platform which does not require extra tools/hardware) and the output made visible in order to count as a valid solution.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;None. (Any if you require it, but it will also account into the score)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A visible triangle on the screen.&#xA;The following rules apply:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The color of the triangle and the color of the background should be different.&lt;/li&gt;&#xA;&lt;li&gt;The size of the triangle should be noticeable. That is, any person with healthy eyesight should immediately be able to notice it.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; The final output triangle must be an actual call to drawing a 3 vertexed mesh and not simply points which render to some 4 pixels on screen.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Hardware constrains&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Since the setup code differs greatly from GPU to GPU, you can assume that all the extensions are supported and that the GPU/driver is capable of executing a valid API call. Namely, input validations aren't mandatory, swapchain is present, queues are optimal, etc...&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Standard 1 (source code) byte = 1 point scoring, less is better.&#xA;(The shaders source file sizes also counts towards the final score)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note&lt;/strong&gt; There are currently but a few available bindings for Vulkan which means that the language choice isn't as wide as other challenges. However, there is plenty to choose from with different paradigms, thus it shouldn't harm the creativity of the solutions :)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Helpful resources&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.vinjn.com/awesome-vulkan/#bindings&quot; rel=&quot;nofollow noreferrer&quot;&gt;Language bindings&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.khronos.org/registry/vulkan/#apispecs&quot; rel=&quot;nofollow noreferrer&quot;&gt;Specification&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.opengl.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;OpenGL&lt;/a&gt; (Vulkan's predecessor) and a &lt;a href=&quot;https://learnopengl.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;tutorial&lt;/a&gt; for it (mainly because it explains some of the aspects in much less code)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.khronos.org/registry/OpenGL/specs/gl/&quot; rel=&quot;nofollow noreferrer&quot;&gt;GLSL specifications&lt;/a&gt;, the language which defines the source code of the shaders used.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="88562" LastEditorUserId="88562" LastEditDate="2019-08-14T14:47:38.827" LastActivityDate="2019-08-14T14:47:38.827" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17961" PostTypeId="2" ParentId="2140" CreationDate="2019-08-12T14:26:00.633" Score="0" Body="&lt;h1&gt;Do X without Y&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&#xA;The goal is drawing an X on an empty 3x3 raster &amp;quot;canvas&amp;quot;. You have to do so by drawing pixel by pixel, showing each intermediate step. But there should never be an Y visible along the way.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You should start by outputting a 3x3 image of one background color. In each step one of the pixels must be changed to the foreground color.&lt;/li&gt;&#xA;&lt;li&gt;You can use any two colors.&lt;/li&gt;&#xA;&lt;li&gt;Instead of using pixels in an image, you can also use a string- (leading/trailing zeros/newlines are ok) or 2d-array/matrix representation.&lt;/li&gt;&#xA;&lt;li&gt;An X is represented as follows:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;o.o  (o = foreground, . = background)&#xA;.o.&#xA;o.o&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;while an &lt;code&gt;y&lt;/code&gt; can be any of the following&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;o.o  o.o  ..o  o..  &#xA;.o.  .o.  .o.  .o.&#xA;o..  ..o  o.o  o.o&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8079/24877&quot;&gt;title reference&lt;/a&gt;)&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-08-12T14:26:00.633" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="17962" PostTypeId="2" ParentId="2140" CreationDate="2019-08-12T15:15:24.567" Score="1" Body="&lt;h2&gt;Broken mouse&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is just an idea, I have not elaborated it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My mouse accidentally fell to the ground, and now there is a double click for each of my single click(which makes window-closing very hard to do). :(&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Most computer screens have a higher resolution ratio than 16x12, but let's assume that my computer screen has a 16x12 resolution ratio.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example: A Window looks like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0-----OX&#xA;|      |&#xA;--------&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The number 0 is the indicator of the window. &lt;code&gt;O&lt;/code&gt; is a dragging button that allows windows to be moved. &lt;code&gt;X&lt;/code&gt; is a closing button that closes the window. (You can not resize windows.)&#xA;Assume that there is a window below that window looking like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1-----OX&#xA;|      |&#xA;--------&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If I click X, I will close both windows. However, what should(or must, if appropriate) I do if I only want to close the first window?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can move my mouse to the &lt;code&gt;O&lt;/code&gt; tab and drag the window around by using mousedown. After 1 drag to the right:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;10-----OX&#xA;||      |&#xA;---------&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now I can click the &lt;code&gt;X&lt;/code&gt; to close the window 0 after I click the &lt;code&gt;O&lt;/code&gt; button again to remove the dragging effect. (Note that there is the window &quot;1&quot; below that window.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Wait, I changed my mind and wanted to close the window 1. What should I do?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I should click the number 1; then, the window 1 goes to the top and the &lt;code&gt;X&lt;/code&gt; button shows. Now I can click the X button to close the 1 window.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For reference, this is the TUI commands I used(when the mouse starts at 0x0):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0-----O&#xA;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;.&amp;gt;.&amp;lt;&amp;lt;&amp;lt;&amp;lt;&amp;lt;&amp;lt;&amp;lt;.&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;What should I do if I want to close the windows that I specified? (Output the TUI instructions.) (Your score is -(code length + output); you want to keep your score as high as possible.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;TUI Instructions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;^v&amp;lt;&amp;gt;&lt;/code&gt;: Move the mouse up, down, left, or right&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;.&lt;/code&gt;: Mouse down+mouse up (i.e. click)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-08-13T04:46:06.363" LastActivityDate="2019-08-13T04:46:06.363" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17964" PostTypeId="1" CreationDate="2019-08-12T21:36:49.693" Score="1" ViewCount="108" Body="&lt;p&gt;A number of programming languages have no built-in way to generate random numbers. How are we able to include these languages in a challenge requiring random output?&lt;/p&gt;&#xA;" OwnerUserId="77338" LastActivityDate="2019-08-16T16:26:56.667" Title="How should we handle random number generation in languages without it built in?" Tags="|discussion|random|" AnswerCount="1" CommentCount="6" ClosedDate="2019-08-15T20:08:37.450" ContentLicense="CC BY-SA 4.0" />
  <row Id="17965" PostTypeId="2" ParentId="2140" CreationDate="2019-08-13T00:37:50.460" Score="2" Body="&lt;h1&gt;A Picture is Worth a Thousand Words&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The average word is four characters/bytes long. So a picture, according to the old saying, is worth 4 kilobytes. But how complicated can that picture get?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using any language or length of code you want, generate an image exactly 4,000 bytes in size with the highest possible entropy. You may use any standard image format. Your score will be the compression ratio when your image is compressed as a .zip file. For example, an image that compresses to 2,000 bytes will score 2, but if it expands to 4,100 bytes it will score 0.9756. Lowest score wins.&lt;/p&gt;&#xA;" OwnerUserId="88456" LastActivityDate="2019-08-13T00:37:50.460" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="17966" PostTypeId="2" ParentId="2140" CreationDate="2019-08-13T12:21:38.830" Score="3" Body="&lt;h1&gt;Truth Table Composition&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given 2 or more truth tables, output the &quot;shortest&quot; way to compose the first N-1 tables to form the last (Nth) table.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard loopholes/io rules apply.&lt;/li&gt;&#xA;&lt;li&gt;Input is a &quot;list&quot; of truth tables&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A truth table is a &quot;list&quot; of rows that contain the inputs and the corresponding output&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input will always be the same length for a given table&lt;/li&gt;&#xA;&lt;li&gt;There must be &lt;span class=&quot;math-container&quot;&gt;\$ 2^N \$&lt;/span&gt; rows in a given table, where N is the number of inputs in the table&lt;/li&gt;&#xA;&lt;li&gt;Each row must have distinct input&lt;/li&gt;&#xA;&lt;li&gt;Inputs and outputs must both be &quot;booleany&quot; e.g.:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;true&lt;/code&gt;/&lt;code&gt;false&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1&lt;/code&gt;/&lt;code&gt;0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;truthy/falsey&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&quot;Bob&quot;&lt;/code&gt;/&lt;code&gt;&quot;Sally&quot;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The input can be in any &lt;strong&gt;reasonable&lt;/strong&gt; format.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any of the formats shown here are reasonable.&lt;/li&gt;&#xA;&lt;li&gt;Taking the output first (ie for &amp;amp;: &lt;code&gt;1,1,1;0,0,1;0,1,0;0,0,0&lt;/code&gt;) is reasonable.&lt;/li&gt;&#xA;&lt;li&gt;Input that requires non-trivial logic to convert is not reasonable. &lt;/li&gt;&#xA;&lt;li&gt;When in doubt, ask in the comments.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Output is a &quot;nested structure&quot;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each level of the nest contains information of the:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Truth table that was used&lt;/li&gt;&#xA;&lt;li&gt;The ordered inputs (of this structure)&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;If a node is a leaf (one of the inputs to the final truth table) it must:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Be distinguishable from the other nodes&lt;/li&gt;&#xA;&lt;li&gt;Contain the index of the input to the final table&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Output format must be &lt;strong&gt;reasonable&lt;/strong&gt; &lt;em&gt;(see details under input)&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&quot;Shortest&quot; is measured by the number of nodes in the output structure.&lt;/li&gt;&#xA;&lt;li&gt;It will always be possible to construct the last table with the first N-1.&lt;/li&gt;&#xA;&lt;li&gt;You do not need to handle invalid input.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;, so the answer with the smallest asymptotic time complexity wins! Answers that do not aim to be efficient are also welcomed. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;em&gt;Yes, I'm done with rules now. Sorry.&lt;/em&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For these test cases, the output is explained below. &lt;strong&gt;Note that this is not the output format you have to use!&lt;/strong&gt;&#xA; - &lt;code&gt;$N&lt;/code&gt; is the Nnt input to the final table (0-indexed)&#xA; - &lt;code&gt;N(...)&lt;/code&gt; is the Nnt input table applied to &lt;code&gt;...&lt;/code&gt; (also 0-indexed)&#xA;   - Arguments are comma separated and are in this format.&#xA; - Note that &lt;code&gt;N()&lt;/code&gt; is different from &lt;code&gt;$N&lt;/code&gt;; the former is the Nnt truth table applied to nothing (only valid in the case of truth tables &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt;), and the latter is the Nnt input to the final table.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA;(anything)&#xA;&#xA;1 0 0&#xA;0 1 1&#xA;0 0 0&#xA;1 1 1&#xA;&#xA;Output:&#xA;$1 (length 1; leaf; gives the second input)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA;1 0&#xA;0 1&#xA;&#xA;1 1 1&#xA;0 0 1&#xA;0 1 0&#xA;1 0 0&#xA;&#xA;1 0 1&#xA;1 1 0&#xA;0 0 1&#xA;0 1 0&#xA;&#xA;Output:&#xA;0($1) (length 2; the first table (not) applied to the second input)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA;1 0&#xA;0 1&#xA;&#xA;1&#xA;&#xA;0&#xA;&#xA;Output:&#xA;0(1()) (length 2; the first table (not) applied to the second table (true))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA;0 1&#xA;1 0&#xA;&#xA;1&#xA;&#xA;1 0&#xA;0 1&#xA;&#xA;Output:&#xA;0($0) (length 2; the first table (not) applied to the first input to the final table)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA;0 1&#xA;1 0&#xA;&#xA;1 1 1&#xA;0 1 0&#xA;1 0 0&#xA;0 0 0&#xA;&#xA;1 1 1&#xA;0 1 1&#xA;1 0 1&#xA;0 0 0&#xA;&#xA;1 1 0&#xA;0 1 1&#xA;1 0 1&#xA;0 0 0&#xA;&#xA;Output:&#xA;1(2($0,$1),0(1($0,$1))) (length 8; &quot;(A | B) &amp;amp; !(A &amp;amp; B)&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I think more test cases are needed, but am unsure what to add.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is my &lt;s&gt;first&lt;/s&gt;second challenge, so all feedback is welcome!&lt;/p&gt;&#xA;" OwnerUserId="87606" LastEditorUserId="87606" LastEditDate="2019-08-17T13:59:47.433" LastActivityDate="2019-08-17T13:59:47.433" CommentCount="20" ContentLicense="CC BY-SA 4.0" />
  <row Id="17968" PostTypeId="2" ParentId="17964" CreationDate="2019-08-13T20:09:32.823" Score="6" Body="&lt;h1&gt;We don't&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The unfortunate fact is that not every language can answer every challenge. I can't answer most, if not all, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/file-system&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;file-system&amp;#39;&quot; rel=&quot;tag&quot;&gt;file-system&lt;/a&gt; challenges using &lt;a href=&quot;https://github.com/DennisMitchell/jellylanguage&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt;, as it doesn't have the capacity to read files. And that's fine. If a language is unable to produce a random number in a valid way &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/15026/66833&quot;&gt;according to our rules&lt;/a&gt;, then it cannot compete in a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; challenge. &lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2019-08-16T16:26:56.667" LastActivityDate="2019-08-16T16:26:56.667" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17972" PostTypeId="1" AcceptedAnswerId="17973" CreationDate="2019-08-16T10:23:03.050" Score="7" ViewCount="165" Body="&lt;p&gt;I have a non-challenge, bitwise-gymnastics question that I am looking for a home for. Would this be on topic here? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Per some requirements, I am trying to pack three data points into 16-bits for the fourth position of an Assembly's Version (in .NET, the fourth position of a version number cannot exceed &lt;code&gt;UInt16.MaxValue-1&lt;/code&gt; ). In our build system we are trying to codify three data points into this value every time a CI build is initiated: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Year&lt;/li&gt;&#xA;&lt;li&gt;Day of Year&lt;/li&gt;&#xA;&lt;li&gt;Build Revision (resets daily, starts at 1)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The criteria are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Values are unique&lt;/li&gt;&#xA;&lt;li&gt;Values are reversible back to their original components&lt;/li&gt;&#xA;&lt;li&gt;For &lt;code&gt;Year=M&lt;/code&gt;, &lt;code&gt;Day=N+1&lt;/code&gt; produces a final result greater than &lt;code&gt;Day=N&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;And by extension, all values for &lt;code&gt;Year=M+1&lt;/code&gt; are greater than all &lt;code&gt;Year=M&lt;/code&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;or rather, &lt;code&gt;Year=M+1, Day=1&lt;/code&gt; is greater than &lt;code&gt;Year=M, Day=366&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;(The last two points basically saying that the value between any two consecutive days is strictly  increasing) &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The best I've come up with is to store that as:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;2 bits for the number of years since 2019 (ie 2019=0) &lt;/li&gt;&#xA;&lt;li&gt;9 bits for the day of the year&lt;/li&gt;&#xA;&lt;li&gt;5 bits for the revision number &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;So &lt;em&gt;basically&lt;/em&gt;: &lt;code&gt;(Years &amp;lt;&amp;lt; 14) | (Day &amp;lt;&amp;lt; 5) | Revision&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My solution works, but for various reasons I'm trying to find a way to extend the range of supportable revision numbers. I feel like I can &lt;em&gt;somehow&lt;/em&gt; borrow some of the leftovers from the day-of-year (since I have 512-366=146 unused values) but I can't seem to find a way to make that work such that it meets my criteria and that I'd be able to reverse it. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Question: &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it possible through some bitwise tricks to extend the supported range for the revision (and if so, how)? Or have I reached the limits of a 16-bit number? &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Meta-Question&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this on-topic? After reading the site rules, I'm guessing no, unless it can fall into the non-challenge category. I'm not sure if this would even be on topic over on SO, but even if it &lt;em&gt;were&lt;/em&gt; I feel like I'd get much better solutions here (assuming there even are any). Is this &quot;puzzly enough&quot; or should I try my luck elsewhere? &lt;/p&gt;&#xA;" OwnerUserId="41565" LastEditorUserId="41565" LastEditDate="2019-08-18T14:17:03.860" LastActivityDate="2019-08-18T14:17:03.860" Title="Would this bit-fiddling question be on topic?" Tags="|discussion|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="17973" PostTypeId="2" ParentId="17972" CreationDate="2019-08-16T14:17:09.930" Score="8" Body="&lt;p&gt;Every challenge requires objective winning criteria. You would need to prepare a set of those before presenting your challenge to us. If you choose to make your challenge a pure code golf, since &quot;should theoretically work for any input&quot; doesn't work here, you'll need to specify the set of possible inputs. If you want to us to maximize the number of years (making code length (technically) a secondary criterion), you'll need to fix the number of revisions and vice versa. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Language-specific challenges are discouraged. While language restrictions aren't expressly forbidden, arbitrary restrictions tend to be unwelcome. There have been some quite successful challenges posted in the past, but their language restrictions have been justified in each case. That doesn't seem to be the case for your question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want to restrict the set of possible operations, you may find it prohibitively difficult to define the list of things one cannot do as languages - and golfing languages in particular - are surprisingly diverse. Defining a whitelist - and even basing your scoring criteria on it - is quite doable though. As before, make sure the restriction improves the challenge. Something that's trivial in a normal language can be tricky with just bitwise operations. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do note that solutions to code golf challenges will always be ... golfed. Copy-pasting them into your production codebase will result in your place's code reviewers' displeasure. And even if you merely hope to extract the respective algorithm from us, even that might, even with non-golfing languages, prove to be difficult. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do make sure to get some eyeballs on your challenge before posting it here. Post it in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?answertab=active#tab-top&quot;&gt;sandbox&lt;/a&gt; and if that doesn't bring it enough attention, the chat may be able to help. Both to nail down the specification and to make sure your challenge is interesting and not a duplicate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regarding your specific question - if you just fix the ranges for each input, the optimal solution will be just a bit of arithmetic. If you ban arithmetic, people will simulate arithmetic with bitwise operations. If you drop the monotonicity requirement and only ask for a bit packing algorithm with the fewest number of gates, people will note that 356 ~= 3*128 making the challenge quite a bit easier than on the surface (in a way that splitting day of year into day + month doesn't help with). Now, if you fix the ranges in a way that prevents that simplifications, that might suffice to create an interesting challenge. The chat should be able to help you choose the constraints.&lt;/p&gt;&#xA;" OwnerUserId="7209" LastActivityDate="2019-08-16T14:17:09.930" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17975" PostTypeId="2" ParentId="9619" CreationDate="2019-08-16T16:29:27.110" Score="3" Body="&lt;h1&gt;Malbolge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Malbolge is a truly amazing language. Programs written in Malbolge are &lt;strong&gt;very, very, very impressive&lt;/strong&gt;. Most of people when hearing Malbolge either have a devil in front of their eyes, or never heard about this. The whole point of this comparasion is to point out that Malbolge is really, really hyped language. You write something in Malbolge, as simple as cat? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/188988/ddoouubbllee-ssppeeaakk/189055#189055&quot;&gt;Here you go, grab some rep&lt;/a&gt;! Just for something as simple as cat! (but sometimes you will &lt;a href=&quot;https://codegolf.stackexchange.com/questions/185872/dad-jokes-are-fun/189995#189995&quot;&gt;sink to the bottom&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Malbolge is very hard to modify, so I can take a bet that nobody, ever will try to crack your cops and robbers entry, and nobody will ever try to outgolf you in challenges other than those with Kologomorov complexity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Malbolge also has very tight instruction set, so it's simple to learn basics of Malbolge to understand less hellish programs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Malbolge is making simple challenges real challenges! You want some more fun from challenge? Go ahead and solve it in Malbolge. It will guarantee you a really fun time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;... and it's great on popularity contests, can you guess why?&lt;/p&gt;&#xA;" OwnerUserId="61379" LastActivityDate="2019-08-16T16:29:27.110" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="17976" PostTypeId="2" ParentId="2140" CreationDate="2019-08-16T20:38:33.997" Score="1" Body="&lt;h1&gt;I mainly need help with scoring as I want to encourage use of esolangs.&lt;/h1&gt;&#xA;&lt;p&gt;I also would like to know how to improve the answer-ability of this question in languages that don't specifically have defined functions&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Church booleans&lt;/h1&gt;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Church_encoding#Church_Booleans&quot; rel=&quot;nofollow noreferrer&quot;&gt;church boolean&lt;/a&gt; is a function that returns &lt;code&gt;x&lt;/code&gt; for true and &lt;code&gt;y&lt;/code&gt; for false where &lt;code&gt;x&lt;/code&gt; is the first argument to the function and &lt;code&gt;y&lt;/code&gt; is the second argument to the function. Further functions can be composed from these functions which represent the &lt;code&gt;and&lt;/code&gt; &lt;code&gt;not&lt;/code&gt; &lt;code&gt;or&lt;/code&gt; and &lt;code&gt;xor&lt;/code&gt; logical operations.&lt;/p&gt;&#xA;&lt;h1&gt;Challange&lt;/h1&gt;&#xA;&lt;p&gt;Construct the church booleans and &lt;code&gt;and&lt;/code&gt; &lt;code&gt;not&lt;/code&gt; &lt;code&gt;or&lt;/code&gt; and &lt;code&gt;xor&lt;/code&gt; church gates in a language of your choice.&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;The total length of all of the code required to make church true and false in your language and the &lt;code&gt;and&lt;/code&gt; &lt;code&gt;not&lt;/code&gt; &lt;code&gt;or&lt;/code&gt; and &lt;code&gt;xor&lt;/code&gt; church gates excluding the functions name. (for example, &lt;code&gt;false=lambda x,y:y&lt;/code&gt; in python would be 12 bytes). You can reuse these names later in your code.&lt;/p&gt;&#xA;&lt;h1&gt;Pseudo code Examples:&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;true(x, y) -&amp;gt; x&#xA;false(x, y) -&amp;gt; y&#xA;and(true, true)(x, y) -&amp;gt; x&#xA;and(true, false)(x, y) -&amp;gt; y&#xA;# ... etc&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="82318" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-08-16T20:38:33.997" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17977" PostTypeId="2" ParentId="2140" CreationDate="2019-08-17T03:02:03.340" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/proof-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;proof-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;proof-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/rubiks-cube&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;rubiks-cube&amp;#39;&quot; rel=&quot;tag&quot;&gt;rubiks-cube&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Solve All the Rubik's Cubes!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I want to solve a Rubik's Cube. Unfortunately, I am blind, and my friend doesn't know how to solve a Rubik's Cube, so I just make one move at a time and ask my friend if it is solved. This generally doesn't work very well, so I would like to know a specific thing I could do to increase my chances of eventually fixing it. Also, I don't like memorizing things, so please keep your solution as short and simple as possible.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I cannot see the cube or anything about it.&lt;/li&gt;&#xA;&lt;li&gt;The only thing my friend will tell me about the cube is whether or not it is solved. &lt;/li&gt;&#xA;&lt;li&gt;My friend and I are fully willing to wait until the heat death of the universe to solve this, if necessary.&lt;/li&gt;&#xA;&lt;li&gt;I don't have a great memory, so keep your instructions as short as possible.&lt;/li&gt;&#xA;&lt;li&gt;I can feel around the cube enough to turn whatever face you tell me to turn in whatever direction.&lt;/li&gt;&#xA;&lt;li&gt;I can turn the cube in my hands.&lt;/li&gt;&#xA;&lt;li&gt;I can memorize anything you give me, but I won't like it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Solution Format&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Give me a description of turns to do on my Rubik's Cube, to be repeated endlessly (or until I solve it). &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;F: Turn the front face clockwise&#xA;B: Turn the back face clockwise&#xA;R: Turn the right face clockwise&#xA;L: Turn the left face clockwise&#xA;U: Turn the top face clockwise&#xA;D: Turn the top face clockwise&#xA;&#xA;x: Turn the cube so the top face becomes the front&#xA;y: Turn the cube so the left face becomes the front&#xA;z: Turn the cube so the left face becomes the top&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;'&lt;/code&gt; can be appended to any of these commands to make them go in the opposite direction.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, to make things easier, you can give me inner repetitions. Write these as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{...commands...}*4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;4&lt;/code&gt; is the number of times it is repeated. Inner repetitions can be nested.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Non-memorability:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each turn gives one point.&lt;/li&gt;&#xA;&lt;li&gt;For nested repetitions, double the point value of everything inside the repetition and add the number of times I do it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Effectiveness:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any sequence of moves on a Rubik's cube will eventually return to the initial state. The effectiveness is how many turns are required before this happens (roughly equivalent to how many states it passes through).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Total score = non-memorability / effectiveness&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Solutions that are easier to remember are probably better than solutions that are hard to remember but will be solved.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Lowest total score wins.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h2&gt;Questions:&lt;/h2&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Will people actually answer this question?&lt;/li&gt;&#xA;  &lt;li&gt;Is the specification clear enough?&lt;/li&gt;&#xA;  &lt;li&gt;This is my first question. Is there anything else I need to consider before posting?&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="88483" LastEditorUserId="88483" LastEditDate="2019-08-19T20:52:50.350" LastActivityDate="2019-08-19T20:52:50.350" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="17979" PostTypeId="1" CreationDate="2019-08-17T15:50:25.353" Score="2" ViewCount="62" Body="&lt;p&gt;Currently the migration text(shown below) references the old name(PPCG) of this site.&#xA;&lt;a href=&quot;https://i.stack.imgur.com/HJ52z.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/HJ52z.png&quot; alt=&quot;Migration Text&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Since this site is now called Code  Golf &amp;amp; Coding Challenges, shouldn't we change the migration text to reference that instead?&lt;/p&gt;&#xA;" OwnerUserId="70761" LastEditorUserId="68942" LastEditDate="2021-06-03T20:42:21.567" LastActivityDate="2021-06-03T20:42:21.567" Title="Migration text is outdated" Tags="|bug|status-completed|migration|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="17981" PostTypeId="2" ParentId="2140" CreationDate="2019-08-18T12:18:30.037" Score="1" Body="&lt;h2&gt;Talk interpreter&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&quot;Talk&quot; is a baroquified accumulator-based language that is created in order to make it difficult to put on Try It Online. The &quot;Talk&quot; language has 4 commands:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;00&lt;/code&gt; If the accumulator is 0, set the accumulator to 0.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;01&lt;/code&gt; If the accumulator is 0, set the accumulator to 1.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;10&lt;/code&gt; If the accumulator is 1, set the accumulator to 0.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;11&lt;/code&gt; If the accumulator is 1, set the accumulator to 1.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Input:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The input can be taken via any acceptable input method by our standard I/O rules.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The input will always be a sequence of the commands above.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The program will take an input that is either 1 or 0 to set the accumulator to.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;On the end of a command execution, the accumulator is outputted implicitly.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input has to be a single string or character list, and splitting it in parts of size 2 is part of the challenge.&lt;/li&gt;&#xA;&lt;li&gt;As this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the shortest answer, in bytes, wins.&#xA;&lt;hr/&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-08-20T23:07:51.427" LastActivityDate="2019-08-20T23:07:51.427" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="17983" PostTypeId="2" ParentId="17979" CreationDate="2019-08-18T13:02:02.740" Score="5" Body="&lt;p&gt;This is far from a big problem but I'd still like to see it tidied up. We could request this be changed to&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This question came from our site for code golfers and coding challenge enthusiasts&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If you agree the wording should change but prefer a different wording to this suggestion, post it as a separate answer so the community can discuss and vote.&lt;/p&gt;&#xA;" OwnerUserId="20283" LastActivityDate="2019-08-18T13:02:02.740" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17984" PostTypeId="1" AcceptedAnswerId="17985" CreationDate="2019-08-18T15:32:40.293" Score="5" ViewCount="158" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/17916#17916&quot;&gt;When I posted this to the Sandbox, &lt;/a&gt; I have waited for 21 days before I posted the challenge to main. However, there are still &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/17916#17916&quot;&gt;a lot&lt;/a&gt; of issues in that post, and someone had found a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/75979/full-width-text&quot;&gt;duplicate&lt;/a&gt;. Why are there still so many issues in a Sandboxed post when people would have found more issues in the extended time span?&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastActivityDate="2019-08-19T07:29:38.373" Title="Why are there still a lot of issues for a Sandboxed post Sandboxed for a long time?" Tags="|discussion|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17985" PostTypeId="2" ParentId="17984" CreationDate="2019-08-18T16:00:58.983" Score="5" Body="&lt;p&gt;There's really nothing compelling anyone to have a look at the challenges proposed in the sandbox. This is a known issue, unlikely to be solved any time soon.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your best bet is probably to request feedback in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;the Nineteenth Byte&lt;/a&gt; a few different times during the day and week (to maximise exposure), and especially when a lot of people are active there.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can also prevent issues by looking at highly voted challenges, and thinking about what makes them good. Trying to solve challenges will also open your eyes for potential issues. You should also have a thorough read through of the Meta posts discussing &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8047/43319&quot;&gt;things to avoid&lt;/a&gt; when posting challenges and the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2522/43319&quot;&gt;tips for writing good code golf questions&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2019-08-18T16:00:58.983" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17986" PostTypeId="2" ParentId="17984" CreationDate="2019-08-19T07:29:38.373" Score="4" Body="&lt;p&gt;I can't speak for anyone other than myself, but for my part I consider that &quot;challenges&quot; should be challenging, or at least non-trivial. I am therefore not inclined to spend time picking apart trivial questions, which in my view only merit the time necessary to downvote them if they should be posted to main.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In short, more interesting questions are worthy of more attention.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2019-08-19T07:29:38.373" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17987" PostTypeId="1" AcceptedAnswerId="17994" CreationDate="2019-08-19T15:02:18.230" Score="14" ViewCount="431" Body="&lt;p&gt;I am not sure if this question has been asked before, but I was unable to find the answer. My question focuses primarily on Python, but it might be applicable to other languages too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider the following function which takes 5 arguments and prints them:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def f(a,b,c,d,e):&#xA; for i in a,b,c,d,e:print(i)          # 46 bytes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This function, if called as such:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f('1','2','3','4','5')&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Outputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;2&#xA;3&#xA;4&#xA;5&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The same functionalty can also be achieved with a lower byte count:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def f(**x):&#xA; for i in 'abcde':print(x[i])         # 41 bytes&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;However, if I want to generate the same output, I must now call the function as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f(a='1',b='2',c='3',d='4',e='5')&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;My question now: Is the requirement for keyworded arguments an appropriate way to reduce the byte count?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am asking this, because it helped me to save some significant bytes in the challenge &lt;a href=&quot;https://codegolf.stackexchange.com/a/190129/87681&quot;&gt;Hidden sentences in the license plates&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="87681" LastActivityDate="2019-08-20T19:18:00.193" Title="Using **kwargs in Python" Tags="|discussion|" AnswerCount="1" CommentCount="0" FavoriteCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="17989" PostTypeId="2" ParentId="2140" CreationDate="2019-08-19T18:00:03.020" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/190412/can-it-be-acronymised&quot;&gt;caN it be acrOnymised?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2019-08-20T12:45:13.767" LastActivityDate="2019-08-20T12:45:13.767" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17990" PostTypeId="2" ParentId="2140" CreationDate="2019-08-19T20:19:06.180" Score="1" Body="&lt;h1&gt;Distant Programs&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Create a program that, when run, prints &quot;Do you still love me?&quot; with or without a newline at the end.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your score is the &lt;a href=&quot;https://en.wikipedia.org/wiki/Levenshtein_distance&quot; rel=&quot;nofollow noreferrer&quot;&gt;Levenshtein distance&lt;/a&gt; to the closest non-erroring program (the non-erroring program doesn't have to do anything, although it might), and you want the largest score. Ties are broken by whichever code is shorter, in bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program &lt;em&gt;can&lt;/em&gt; read it's own source code, through the filesystem or otherwise. If your program must have a specific name, the length of that name should be included in your byte count.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Notes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Compiler warnings are not counted as errors for this challenge.&lt;/li&gt;&#xA;&lt;li&gt;An erroring program can output, frobricate, do anything as long as it eventually errors.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Notes for the sandbox:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the specification clear?&lt;/li&gt;&#xA;&lt;li&gt;Is it possible to create a solution that can simply be repeated to get any arbitrary score? If so it would pretty much ruin the challenge as it is, and I think it should be possible but I can't get it to work.&lt;/li&gt;&#xA;&lt;li&gt;What tags would this use?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="13400" LastActivityDate="2019-08-19T20:19:06.180" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17991" PostTypeId="2" ParentId="2140" CreationDate="2019-08-20T13:02:57.120" Score="0" Body="&lt;h1&gt;Get the number of upvotes of your own answer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a piece of code which makes a request to &lt;code&gt;codegolf.stackexchange.com&lt;/code&gt; and prints the, up to date, number of upvotes to &lt;strong&gt;the specific&lt;/strong&gt; answer in which you've posted that piece of code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a test case I'll post a (poor!) answer below (obviously only in the real question).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is just a random idea I had when reading some other code golfing challenges, and I thought I'll post it here to see if it will fly.&lt;/p&gt;&#xA;" OwnerUserId="68200" LastActivityDate="2019-08-20T13:02:57.120" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="17994" PostTypeId="2" ParentId="17987" CreationDate="2019-08-20T19:18:00.193" Score="11" Body="&lt;h2&gt;Using kwargs is fine if it is not encoding extra information&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I think there are two reasons that using this feature of Python seems fishy. The first is that this feature is exclusive to relatively newer programming languages, which might seem unfair in comparison. The other reason is that it seems to use more information than other methods of handling information. I don't think either of these are actually problematic, however.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first reason is fairly easy to dismiss: Python answers shouldn't be compared to C answers, etc. This is just a clever way of accessing information, as if the keys you require uniquely identify an argument they aren't any different from looking for that same argument in a particular position in an array, for example.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The second reason brings up an important abuse case, which would be using the argument to contain additional information. For example, &lt;a href=&quot;https://tio.run/##rczLCoJAFADQvV8hruaahKkYFrNVJIQelOnOx/hIx5FxlPHrrY9ofzjjKho22NtWcUbVPJuI66gtHRkXulKSSq2Qrks4oc5YwNAzLPetIHRCcOZEzHxQyZL1KHedkhSsJKjbaRhrAGiBbeTtIFCF8sAXCb03YeC4sZXUKfXWMEjqLHbqgvpzaj1Z9JDzJe7pz/Tpx/Qi3/Sur0m@b9g@ACh/uqwjwPYF&quot; rel=&quot;nofollow noreferrer&quot;&gt;this program&lt;/a&gt; tests if the input is prime. Obviously here it doesn't save bytes, but almost any code golf challenge with a single argument could have the same score. This is clearly problematic, but I think the usual rider of &quot;contains no extra information&quot; applied to flexible input formats handles this case just as well.&lt;/p&gt;&#xA;" OwnerUserId="31625" LastActivityDate="2019-08-20T19:18:00.193" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="17995" PostTypeId="2" ParentId="2140" CreationDate="2019-08-21T01:01:02.603" Score="1" Body="&lt;h2&gt;Normalized Malbolge to Malbolge translator&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this task, you will write a program/function that takes a Normalized Malbolge program and outputs the resulting Malbolge program. (This is a secret tool that all Malbolge programmers are using!)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A data structure that (somehow) represents a Normalized Malbolge program.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A data structure that represents the resulting Malbolge program.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;jpoo*pjoooop*ojoopoo*ojoooooppjoivvvo/i&amp;lt;ivivi&amp;lt;vvvvvvvvvvvvvoji:&#xA;(=BA#9&quot;=&amp;lt;;:3y7x54-21q/p-,+*)&quot;!h%B0/.~P&amp;lt;&amp;lt;:(8&amp;amp;66#&quot;!~}|{zyxwvugJ%&#xA;&#xA;jjjj*&amp;lt;jjjj*&amp;lt;v&#xA;('&amp;amp;%#^&quot;!~}{XE&#xA;&#xA;jjjjjjjjjjjjjjjjjjjjjjj*&amp;lt;jjjjjjjjjjjjjjjjjjjjjjjj*&amp;lt;v&#xA;('&amp;amp;%$#&quot;!~}|{zyxwvutsrqpnKmlkjihgfedcba`_^]\[ZYXWVT1|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;How to convert&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a placeholder for the convertion process.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;def normal_to_malbolge(prog):&#xA;    pos = 0&#xA;    malbolge = &quot;&quot;&#xA;    for i in prog:&#xA;        char = ord(&quot;' ( &amp;gt; D Q b c u&quot;.split()[&quot;*jpovi&amp;lt;/&quot;.find(i)]) - pos&#xA;        while char &amp;lt; 33:&#xA;            char += ord(&quot;~&quot;)-32&#xA;        malbolge += chr(char)&#xA;        pos += 1&#xA;    return malbolge&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Explanation&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Iterate over the normalized Malbolge program, and then convert all &lt;code&gt;&quot;*jpovi&amp;lt;/&quot;&lt;/code&gt;'s to a character in &lt;code&gt;&quot;'&quot;, '(', '&amp;gt;', 'D', 'Q', 'b', 'c', 'u'&lt;/code&gt;. Then, minus the position.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While the temporary Malbolge representations' ASCII code is less than 33, increment the char by the ASCII code of &quot;~&quot; minus 32.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Append the resulting character to the output.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; contest; the shortest answer wins.&lt;/li&gt;&#xA;&lt;li&gt;No &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;standard loopholes&lt;/a&gt; please.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The default I/O methods are allowed.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is it a duplicate? This probably is.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;Is the challenge well-written?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-08-22T01:14:33.897" LastActivityDate="2019-08-22T01:14:33.897" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="17997" PostTypeId="2" ParentId="2140" CreationDate="2019-08-22T09:10:05.410" Score="0" Body="&lt;h1&gt;Breaking the Wordbuilder (canned)&lt;/h1&gt;&#xA;&lt;p&gt;Dupe of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/38233/lets-play-countdown&quot;&gt;Let's Play Countdown!&lt;/a&gt; ... oh well. Thanks for the feedback everyone.&lt;/p&gt;&#xA;" OwnerUserId="15940" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-09-05T11:00:42.033" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="17999" PostTypeId="2" ParentId="2140" CreationDate="2019-08-22T12:40:48.043" Score="0" Body="&lt;h1&gt;Break it up and put it back together again&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;, so read carefully and make sure your answer is valid before posting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program/function that takes a list of integers greater than 1 and returns a list of &lt;em&gt;positive&lt;/em&gt; integers where each number from the original list has been split in two. For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[10,11,12] -&amp;gt; [5,5,4,7,6,6]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Each pair of numbers in the output add up to the corresponding number in the input. The algorithm used to split it up doesn't matter (for example a valid output could be &lt;code&gt;[1,9,1,10,1,11]&lt;/code&gt;), as long as it is deterministic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;However&lt;/strong&gt;, when fed its own byte values and the output is turned back into bytes, the resulting program should do the opposite, taking a list of integers and summing each pair. For example, if the program &lt;code&gt;abcde&lt;/code&gt; splits each number into halves, with the leftover going to the second number:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;abcde&quot; -&amp;gt; [97, 98, 99, 100, 101]&#xA;-&amp;gt; [48, 49, 49, 49, 49, 50, 50, 50, 50, 51] -&amp;gt; &quot;0111122223&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The program &lt;code&gt;0111122223&lt;/code&gt; should then be able to take the list &lt;code&gt;[48, 49, 49, 49, 49, 50, 50, 50, 50, 51]&lt;/code&gt; and return the original &lt;code&gt;[97, 98, 99, 100, 101]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Notes/Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output must be deterministic&lt;/li&gt;&#xA;&lt;li&gt;Output can't be a list of lists (no list of pairs)&lt;/li&gt;&#xA;&lt;li&gt;The second program may assume that the length of the input is even (so you don't need to account for a leftover element)&lt;/li&gt;&#xA;&lt;li&gt;Submissions can be functions, programs or different for either part&lt;/li&gt;&#xA;&lt;li&gt;Remember, output must be a list of &lt;em&gt;positive&lt;/em&gt; integers. &#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You won't get &lt;code&gt;1&lt;/code&gt; in the input of the first program&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;The programs have to be in the same language&lt;/li&gt;&#xA;&lt;li&gt;Input can be a string or list of characters instead&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76162" LastEditorUserId="76162" LastEditDate="2019-08-24T04:33:23.347" LastActivityDate="2019-08-24T04:33:23.347" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18000" PostTypeId="2" ParentId="2140" CreationDate="2019-08-22T15:33:33.857" Score="1" Body="&lt;h1&gt;I need help rewording the prompt.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I learned from last time about having convoluted scoring and having too broad of a focus from my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/190325/church-booleans&quot;&gt;last question&lt;/a&gt;. I hope this one is more clear. &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Church Subtraction&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Lambda calculus has always been a fascination of mine and the emergent behaviors of passing functions into each other is delightfully complex. &lt;a href=&quot;https://en.wikipedia.org/wiki/Church_encoding#Church_numerals&quot; rel=&quot;nofollow noreferrer&quot;&gt;Church numerals&lt;/a&gt; are representations of natural numbers contructed from the repeated application of a function (normally the unary addition of a constant). For example, the number zero returns and &quot;ignores&quot; the input function, one is &lt;code&gt;f(x)&lt;/code&gt;, two is &lt;code&gt;f(f(x))&lt;/code&gt; and so on:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ident = lambda x: x&#xA;zero = lambda f: ident&#xA;succ = lambda n: lambda f: lambda x: f(n(f)(x))&#xA;one = succ(zero)&#xA;add1 = lambda x: x + 1&#xA;to_int = lambda f: f(add1)(0)&#xA;print(to_int(one))&#xA;&amp;gt;&amp;gt;&amp;gt; 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;From this we can easily see that addition is accomplished by applying the first function to x then applying the second function to x: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;add = lambda m: lambda n: lambda f: lambda x: n(f)(m(f)(x))&#xA;print(to_int(add(one)(two)))&#xA;&amp;gt;&amp;gt;&amp;gt; 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Addition is relatively easy to understand. However, to a newcomer it might be inconceivable to think of what subtraction looks like in a Church encoded number system. What could it possibly mean to un-apply a function?&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Implement the subtraction function in a Church encoded numeral system. Where subtraction performs the &lt;a href=&quot;https://en.wikipedia.org/wiki/Monus&quot; rel=&quot;nofollow noreferrer&quot;&gt;monus operation&lt;/a&gt; and unapplies a function &lt;code&gt;n&lt;/code&gt; times if the result will be greater than zero or zero otherwise. This is code-golf so shortest code wins.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Two Church numerals that have been encoded in your choice of language. The input can be positional or curried. To prove these are true Church numerals they will have to take in any function and apply them repeatedly (&lt;code&gt;add1&lt;/code&gt; is given in the examples but it could be &lt;code&gt;add25&lt;/code&gt;, &lt;code&gt;mult7&lt;/code&gt;, or any other unary function.)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A Church numeral. It should be noted that if &lt;code&gt;m &amp;lt; n&lt;/code&gt; then &lt;code&gt;m - n&lt;/code&gt; is always the same as the identity function. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;minus(two)(one) = one&#xA;minus(one)(two) = zero&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;also acceptable:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;minus(two, one) = one&#xA;minus(one, two) = zero&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Credit:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This &lt;a href=&quot;https://gist.github.com/vivekhaldar/2438498&quot; rel=&quot;nofollow noreferrer&quot;&gt;github gist&lt;/a&gt; for giving me a python implementation of Church Numerals.&lt;/p&gt;&#xA;" OwnerUserId="82318" LastEditorUserId="82318" LastEditDate="2019-08-23T13:21:56.133" LastActivityDate="2019-08-23T13:21:56.133" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18001" PostTypeId="2" ParentId="2140" CreationDate="2019-08-22T16:49:38.323" Score="1" Body="&lt;h1&gt;Black And White Shirts 3&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is the third in a series. The first can be found &lt;a href=&quot;https://codegolf.stackexchange.com/q/189515/73483&quot;&gt;here&lt;/a&gt;, and the second &lt;a href=&quot;https://codegolf.stackexchange.com/q/189531/73483&quot;&gt;here&lt;/a&gt;. The premise is similar to the first two, but with some changes and a new goal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Assume I have some number of black shirts and some number of white shirts, both at least 1. Both colors of shirt have a non-zero Vividness. All shirts of a given color start with the same Vividness.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every day, I pick out a clean shirt to wear, and it becomes dirty. Once I run out of all clean black shirts or all clean white shirts, I wash all my dirty shirts of both colors and start over. Clean shirts do not get washed. Whenever a shirt gets washed, its color changes based on its Vividness and the Vividness and colors of the other shirts being washed, then its Vividness goes down by one to a minimum of 0. All things being equal, over time, all shirts will generally tend towards a shade of gray.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a shirt is ever closer to the opposite color (eg. a black shirt looks light gray), it becomes a shirt of that color.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When picking which shirt to wear, I choose the shirt which is either closest to black or closest to white. If there is a tie, I choose the one with the highest Vividness.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Take in an arbitrarily long sequence of two indicators (eg. b b w w b w b b w b...) representing my choice of shirt to wear on that day. Continue execution until either my last black shirt or my last white shirt loses its last vividness. Once this occurs, stop consuming input and print out the colors of all shirts.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Inputs:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Number of black shirts, number of white shirts, Vividness of black shirts, Vividness of white shirts, and a sequence of shirt selections of arbitrary length at least long enough for one color of shirt to run out of Vividness (can be considered infinitely long). The selection can be represented by any two characters (eg. b, w).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Color of all shirts, sorted from lightest to darkest, as a percent of how close it is to white, rounded to the nearest whole percent. A completely black shirt is 0, and a completely white shirt is 100.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Color changing:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The color of a shirt tends towards the average of all shirts' colors in the wash. How close it gets depends on its own Vividness.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TODO: Determine if this rule is necessary (I don't think it is): If all shirts in the wash have 0 Vividness, none of them change color.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When washed, shirts are changed based on the following pseudocode algorithm (some of which may not be necessary for your simulation):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;struct shirt {&#xA;    int vividness&#xA;    float color&#xA;}&#xA;&#xA;func washShirts(shirt[] allDirtyShirts) {&#xA;    totalVividness = allDirtyShirts.sum(shirt =&amp;gt; shirt.vividness)&#xA;    if (totalVividness == 0)&#xA;        return&#xA;&#xA;    averageDirtyColor = allDirtyShirts.sum(shirt =&amp;gt; shirt.color * shirt.vividness) / totalVividness&#xA;&#xA;    for each shirt in allDirtyShirts&#xA;    {&#xA;        shirt.color = (shirt.color * shirt.vividness + averageDirtyColor) / (shirt.vividness + 1)&#xA;        if shirt.vividness &amp;gt; 0&#xA;            shirt.vividness--&#xA;        if shirt.isBlack &amp;amp;&amp;amp; shirt.color &amp;gt; .5&#xA;            shirt.isBlack = false&#xA;        else if !shirt.isBlack &amp;amp;&amp;amp; shirt.color &amp;lt; .5&#xA;            shirt.isBlack = true&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Make sure that all shirts base their calculation on the Vividness and color values of all other shirts &lt;em&gt;before&lt;/em&gt; the change. Perform no rounding beyond normal floating point restraints within your language of choice (within reason) during any calculation. Only round the value during output. When rounding for output, choose any convenient rounding method among:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;truncating (always round down)&lt;/li&gt;&#xA;&lt;li&gt;rounding to the nearest integer&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;.5 rounds up&lt;/li&gt;&#xA;&lt;li&gt;.5 rounds down&lt;/li&gt;&#xA;&lt;li&gt;.5 rounds to the nearest even integer&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Note: These test cases use rounding to the nearest even integer. Your output may vary in some cases.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 2 1 1 w b&#xA;100 75 25&#xA;&#xA;3 3 2 1 w b w b w w w w w w w w&#xA;71 71 71 14 14 0&#xA;#note that processing would stop after w b w b w. The remaining input would be ignored.&#xA;&#xA;#todo: more test cases&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;General rules:&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins.&lt;/li&gt;&#xA;&lt;li&gt;Default I/O rules apply&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="73483" LastEditorUserId="73483" LastEditDate="2019-09-20T22:10:30.153" LastActivityDate="2019-09-20T22:10:30.153" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18002" PostTypeId="2" ParentId="2140" CreationDate="2019-08-23T06:08:09.937" Score="0" Body="&lt;h1&gt;Approaching the Graham's number &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Write a program that could theoretically output an integer with the minimum absolute difference to the Graham's number. Your code is cracked if a robber writes a program to output the Graham's number exactly, in the same language, with the edit distance to your code under a specific limit.&lt;/p&gt;&#xA;&lt;p&gt;Builtins for the Graham's number is disallowed.&lt;/p&gt;&#xA;&lt;p&gt;Details to be added, if I think this idea actually works.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Problems:&lt;/p&gt;&#xA;&lt;p&gt;How to set the limit?&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Fixed number of bytes.&lt;/li&gt;&#xA;&lt;li&gt;Fixed % of the code. Does the boilerplate count?&lt;/li&gt;&#xA;&lt;li&gt;Set by the cop. But how to fix the winning criterion?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Do the cops need to know a crack to make the submission valid?&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-08-23T06:08:09.937" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18003" PostTypeId="2" ParentId="2140" CreationDate="2019-08-23T08:07:50.100" Score="0" Body="&lt;h2&gt;Golfed User-Pinging&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this task, given a user's display name(e.g. Display Name) from which the first space has been removed, use the API to find a user it could be and output their display name up to the first space. Both input and output must have an @ prefixed to them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input will not contain spaces in it, so you have to search for the user before doing this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the user does not exist, do anything else other than outputting the golfed user ping. (That includes outputting to stderr.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; contest; the shortest answer wins.&lt;/li&gt;&#xA;&lt;li&gt;No standard loopholes allowed. (In fact, hard-coding the answers will annoy other users, as you pinged all of them.)&lt;/li&gt;&#xA;&lt;li&gt;The space (U+0020) is the word separator.&lt;/li&gt;&#xA;&lt;li&gt;Input will not contain display names containing 2 or more spaces.&lt;/li&gt;&#xA;&lt;li&gt;In addition to golfing the code, the answers also have to use as few calls as possible. (Due to the rate limiting of the API)&lt;/li&gt;&#xA;&lt;li&gt;The input will always be case-insensitive and are restricted to printable ASCII. &#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;@Dennis -&amp;gt; @Dennis&#xA;@MartinEnder -&amp;gt; @Martin&#xA;@Cowsquack -&amp;gt; @Cows&#xA;@JB -&amp;gt; @J&#xA;@tsh -&amp;gt; @tsh&#xA;@cairdcoinheringaahing -&amp;gt; @caird&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;hr&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is it a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Do you understand everything here?&lt;/li&gt;&#xA;&lt;li&gt;Any suggestions for test cases?&lt;/li&gt;&#xA;&lt;li&gt;Most importantly, &lt;strong&gt;can you cheat over this challenge by using an algorithm not requiring network access?&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stack-exchange-api&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stack-exchange-api&amp;#39;&quot; rel=&quot;tag&quot;&gt;stack-exchange-api&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-08-24T07:38:25.170" LastActivityDate="2019-08-24T07:38:25.170" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18005" PostTypeId="2" ParentId="2140" CreationDate="2019-08-23T09:44:49.897" Score="0" Body="&lt;h1&gt;Random point on a sphere&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/191510/random-point-on-a-sphere&quot;&gt;Posted here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="87681" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-09-09T07:14:29.237" CommentCount="18" ContentLicense="CC BY-SA 4.0" />
  <row Id="18006" PostTypeId="2" ParentId="2140" CreationDate="2019-08-23T17:36:09.580" Score="0" Body="&lt;h1&gt;&quot;Condense&quot; String of Text&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You will be given a string. You will be &quot;condensing&quot; it by combining the bits of characters into one.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The condensation works as follows:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You are given a string with 8-bit characters, such as &lt;code&gt;Hèl¹ò Wôrld&lt;/code&gt;, hex &lt;code&gt;48 e8 6c b9 f2 20 57 f4 72 6c 64&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Combines bits into 16-bit groups, from right to left. Above becomes hex &lt;code&gt;48 e86c b9f2 2057 f472 6c64&lt;/code&gt;, or &lt;code&gt;H槲⁗汤&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;You may assume that all characters in string range from &lt;code&gt;0x00&lt;/code&gt; to &lt;code&gt;0xff&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Your resulting string would be encoded in UTF-16.&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may also assume that the resulting string won't contain characters from &lt;code&gt;0xd800&lt;/code&gt; to &lt;code&gt;0xdfff&lt;/code&gt;, or the input containing any of &lt;code&gt;ØÙÚÛÜÝÞß&lt;/code&gt; at even index in 0-index, or odd index in 1-index.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;code&gt;code-golf&lt;/code&gt; so shortest code wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input raw: abacaba&#xA;Input hex: 61 62 61 63 61 62 61&#xA;Outpt raw: a扡捡扡&#xA;Outpt hex: 61 6261 6361 6261&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input raw: Example.&#xA;Input hex: 45 78 61 6d 70 6c 65 2e&#xA;Outpt raw: 䕸慭灬攮&#xA;Outpt hex: 4578 616d 706c 652e&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input raw: ÿ!0ÿMÿEÿSÿSÿAÿGÿE0ÿCÿAÿN0ÿAÿPÿPÿEÿAÿR0ÿTÿOÿOÿ&#xA;Input hex: ff 21 30 00 ff 4d ff 45 ff 53 ff 53 ff 41 ff 47 ff 45 30 00 ff 43 ff 41 ff 4e 30 00 ff 41 ff 50 ff 50 ff 45 ff 41 ff 52 30 00 ff 54 ff 4f ff 4f ff 0e&#xA;Outpt raw: Ａ　ｍｅｓｓａｇｅ　ｃａｎ　ａｐｐｅａｒ　ｔｏｏ．&#xA;Outpt hex: ff21 3000 ff4d ff45 ff53 ff53 ff41 ff47 ff45 3000 ff43 ff41 ff4e 3000 ff41 ff50 ff50 ff45 ff41 ff52 3000 ff54 ff4f ff4f ff0e&#xA;Note that there are NULs in the input.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="86759" LastEditorUserId="86759" LastEditDate="2019-08-24T00:12:01.620" LastActivityDate="2019-08-24T00:12:01.620" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18009" PostTypeId="2" ParentId="2140" CreationDate="2019-08-25T22:14:23.297" Score="1" Body="&lt;h1&gt;Determine the minimal indices needed to cover all queries&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge is based on Mongo's handling of &lt;a href=&quot;https://docs.mongodb.com/manual/core/index-compound/&quot; rel=&quot;nofollow noreferrer&quot;&gt;compound indices&lt;/a&gt; and &lt;a href=&quot;https://docs.mongodb.com/manual/core/index-intersection/&quot; rel=&quot;nofollow noreferrer&quot;&gt;index intersection&lt;/a&gt;, inspired by a problem that came up at work, but I'll restate the relevant details here.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In any database, relational or not, the primary purpose of indices is to optimize data lookup.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, if the task of finding all &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; questions on this site had to be accomplished by looping through all posts and looking for the &lt;code&gt;code-golf&lt;/code&gt; tag, it would be unusably slow. An index, however, organizes this data in a way that enables fast and efficient lookup of the data we want, which drastically reduces the resource cost of queries in exchange for some more work and space in maintaining the index.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, the cost of maintaining indices is not negligible, so it quickly becomes untenable to create 2^N indices for N fields. (Databases designed for this purpose do exist and are the better choice when this functionality is actually needed. I'm ignoring this fact because it's a more interesting challenge this way.) Thus, careful index construction and selection is important to get the most bang for your buck.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Details&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A simple index only organizes data based on one field but Mongo provides two ways to efficiently query on more than one field: compound indices and index intersection.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Compound Indices&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Compound indices organize data based on a sequence of fields, e.g. &lt;code&gt;[A, B, C]&lt;/code&gt;. Here, order matters. If data is sorted by &lt;code&gt;A&lt;/code&gt; then &lt;code&gt;B&lt;/code&gt; then &lt;code&gt;C&lt;/code&gt;, then doing a lookup based on &lt;code&gt;C&lt;/code&gt; first cannot be done efficiently since there are no guarantees on where the desired data might be located within the index (whereas one could do e.g. a binary search based on &lt;code&gt;A&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; compound indices enable efficient queries on &lt;em&gt;prefixes&lt;/em&gt; of that index as well. That is, a compound index on &lt;code&gt;[A, B, C]&lt;/code&gt; enables efficient queries that have &lt;code&gt;[A]&lt;/code&gt;, &lt;code&gt;[A, B]&lt;/code&gt;, or &lt;code&gt;[A, B, C]&lt;/code&gt;. However, as previously mentioned, it does not support queries that have &lt;code&gt;[B]&lt;/code&gt;, &lt;code&gt;[C]&lt;/code&gt;, &lt;code&gt;[A, C]&lt;/code&gt;, or &lt;code&gt;[B, C]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Index Intersection&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Exactly two indices can be used to optimize a query if there does not already exist a compound index for the desired fields. That is, if there is an index on &lt;code&gt;[A]&lt;/code&gt; and an index on &lt;code&gt;[B]&lt;/code&gt;, then a query on &lt;code&gt;[A, B]&lt;/code&gt; can be executed fairly efficiently (though not as efficiently as if there was a compound index, but let's ignore that). This also applies to prefixes of indices, so an index on &lt;code&gt;[A, B, C]&lt;/code&gt; and an index on &lt;code&gt;[C]&lt;/code&gt; can be intersected to support a query with &lt;code&gt;[A, C]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Problem&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Given N fields, determine the minimal indices needed to make all possible queries on those fields efficient.&lt;/strong&gt; That is, minimize the total number of fields indexed. There may be more than one minimal set.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; the order of fields in the &lt;em&gt;query&lt;/em&gt; doesn't matter since the query analyzer can reorder these fields to be as optimal as possible before running the query.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input/Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input is a single positive integer and the output should consist of clearly-delimited sequences.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;A variety of output formats are shown here to demonstrate what I mean by &quot;clearly-delimited sequences&quot;.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;N: 1&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;N: 2&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;AB&#xA;B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;N: 3&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[['A', 'B', 'C'], ['B', 'C'], ['C']]&#xA;&#xA;['AB', 'BC', 'CA']&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;To elaborate on the first example in this N=3 case, the first index covers a query with all three fields, index intersections cover all choices of two fields, and index prefixes cover all queries with one field.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; for N=5, the obvious pattern does not hold; the indices &lt;code&gt;ABCDE BCDE CDE DE E&lt;/code&gt; do not enable an efficient query on &lt;code&gt;A, C, E&lt;/code&gt;. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;I am &lt;em&gt;really&lt;/em&gt; hoping this doesn't boil down to &lt;code&gt;[A, B, ..., X], [B, ..., X], [C, ..., X], ... [X]&lt;/code&gt;. I haven't taken a look at the N=4 case yet though so I don't know if this pattern holds.&lt;/s&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thankfully, the pattern breaks down for N=5.&lt;/p&gt;&#xA;" OwnerUserId="12914" LastEditorUserId="12914" LastEditDate="2019-08-26T15:15:04.693" LastActivityDate="2019-08-26T15:15:04.693" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18011" PostTypeId="1" CreationDate="2019-08-26T15:41:43.313" Score="8" ViewCount="263" Body="&lt;p&gt;Currently it seems it is not so clear what happens if person B posts a challenge that is a duplicate of another challenge person A had already &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;sandboxed&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;While any user contributions on SE are licensed under &lt;a href=&quot;https://codegolf.stackexchange.com/help/licensing&quot;&gt;CC BY-SA&lt;/a&gt; can legally be copied and altered if attribution is provided, I still think it is impolite and disrespectful to &quot;steal&quot; (i.e. post without consent) something that someone else has already put effort in, even if you came up with the same idea yourself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We do have a policy on using &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2090/can-we-make-use-of-abandoned-sandbox-posts&quot;&gt;abandoned sandboxed questions&lt;/a&gt;, where consent is assumed if there is no objection within two weeks.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This leaves us with the question: &lt;strong&gt;What do we do with challenges that are dupes of sandboxed posts and were posted without the consent of the author of the latter?&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should they be closed? Can they stay open? Is there another alternative?&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="46076" LastEditDate="2019-10-18T03:53:52.207" LastActivityDate="2019-10-18T03:53:52.207" Title="What to do with a challenge that is a dupe of a sandboxed one?" Tags="|discussion|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18012" PostTypeId="2" ParentId="18011" CreationDate="2019-08-26T16:01:50.850" Score="3" Body="&lt;h1&gt;Close the challenge - Reopen after two weeks if author of sandboxed post does not object&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As @trichoplax mentioned, there is a gray zone, e.g. when the the post in the sandbox is just a rough idea, while the post is a fully specified challenge. What I suggest here covers cases where there is a challenge in the sandbox that has already had some effort put into it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we would not close those questions we would on the one hand tolerate this behaviour but on the other hand also disencourage the use of the sandbox.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In line with the policy about abandoned sandbox posts, I suggest we close the challenge and notify the author of the sandboxed post. If the author does not object within two weeks, the challenge can be reopened. This is also what we would do if the sandboxed post was just a regular post on main.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Otherwise the challenge will remain closed. If the author decides to post the challenge then this post can be used as a dupe target for the closed challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you as an author do have a challenge in the sandbox that you do not intend to post, you can also mark them and explicitly say that they are free for anyone to take (see e.g. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/16252/24877&quot;&gt;here&lt;/a&gt;), and if it is ready to be posted you can also include them in our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7804/secret-santas-sandbox&quot;&gt;Secret Santa&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2019-08-26T19:00:23.997" LastActivityDate="2019-08-26T19:00:23.997" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18013" PostTypeId="2" ParentId="18011" CreationDate="2019-08-26T16:28:33.787" Score="5" Body="&lt;p&gt;What do we do with challenges that are dupes of Sandbox challenges?&lt;/p&gt;&#xA;&lt;h1&gt;Nothing.&lt;/h1&gt;&#xA;&lt;p&gt;The Sandbox functions 100% on the honor system with CC-BY-SA, but there is nothing that can actually be &lt;em&gt;done&lt;/em&gt; if someone doesn't utilize the Sandbox &amp;quot;correctly.&amp;quot; (for various interpretations of &amp;quot;correct&amp;quot;)&lt;/p&gt;&#xA;&lt;p&gt;Close as off-topic? Nope, it's actually very on-topic. Close as duplicate? Nope, there doesn't exist another challenge to target. Close as unclear or belongs on SO? Hopefully not.&lt;/p&gt;&#xA;&lt;h3&gt;What can you as an individual do?&lt;/h3&gt;&#xA;&lt;p&gt;Some things. If the challenge still isn't ready, close as unclear. Don't participate on the challenge if you feel compelled to maintain morals. Discuss with the author of the challenge in chat and educate them to your opinion. Discuss with others. Etc.&lt;/p&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-08-26T16:28:33.787" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18015" PostTypeId="2" ParentId="18011" CreationDate="2019-08-26T19:57:34.377" Score="10" Body="&lt;h2&gt;Assume good faith - do nothing besides inform the user&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The general rule on stack exchange sites is to assume that questions are asked in good faith. I do not think it is likely for anyone to maliciously post content from the sandbox on this site since they have very little to gain. Therefore I would usually assume this was an accident and just inform the user of what happened. We can suggest they delete and move to the sandbox, or take action in crediting the other user, etc. but I don't think this needs to be handled as strongly as the case of posting duplicates.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think this case differs significantly from the case of duplicates in a few ways. The most important is searchability. Posts on the actual site are (usually) of high quality and contain several helpful searchable benefits like tags and links to other related questions. Sandbox posts, on the other hand, often do not contain tags, and even if they do, they are not as easily searchable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sandbox posts are also frequently unclear, and likely have no solutions posted yet. This makes the question of determining whether a challenge is a duplicate even more difficult. Frequently challenges are left open until enough responses show degenerate relationships to other posts that the community becomes confident enough to close it. For these reasons, I think it is unreasonable to hold users to the task of determining if their post is a duplicate of one that has been sandboxed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, if a user performs this unreasonably often, or if the copying appears egregious, then the flag tool is waiting to signal for our friendly neighbourhood mods to &lt;del&gt;nuke it from orbit&lt;/del&gt; politely handle it.&lt;/p&gt;&#xA;" OwnerUserId="31625" LastActivityDate="2019-08-26T19:57:34.377" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18016" PostTypeId="2" ParentId="2140" CreationDate="2019-08-26T23:00:47.177" Score="8" Body="&lt;h1&gt;Round away from zero&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/191241/52194&quot;&gt;Submitted.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/q/190670/52194&quot;&gt;Round towards zero&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a number input via any reasonable method, round the number &quot;away from zero&quot; - positive numbers round up, and negative numbers round down.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can output a floating-point number with the decimal point (e.g. 42.0) if desired.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;&lt;sup&gt;&lt;sup&gt;&lt;sup&gt;why did i think this was a good idea&lt;/sup&gt;&lt;/sup&gt;&lt;/sup&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-99.9 =&amp;gt; -100&#xA;-33.5 =&amp;gt; -34&#xA;-7    =&amp;gt; -7&#xA;-1.1  =&amp;gt; -2&#xA;0     =&amp;gt; 0&#xA;2.3   =&amp;gt; 3&#xA;8     =&amp;gt; 8&#xA;99.9  =&amp;gt; 100&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="52194" LastEditorUserId="52194" LastEditDate="2019-09-03T21:05:03.693" LastActivityDate="2019-09-03T21:05:03.693" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="18017" PostTypeId="2" ParentId="2140" CreationDate="2019-08-27T07:16:49.200" Score="-3" Body="&lt;p&gt;The goal is to make a program that is compilable in as many languages as possible.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program must be compilable with a specific compiler version and compiler parameters without any errors.&lt;/li&gt;&#xA;&lt;li&gt;The program may result in an error when run.&lt;/li&gt;&#xA;&lt;li&gt;The source code must not be empty or whitespace.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="88817" LastEditorUserId="88817" LastEditDate="2019-08-27T10:58:28.907" LastActivityDate="2019-08-27T10:58:28.907" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18018" PostTypeId="2" ParentId="2140" CreationDate="2019-08-27T10:52:03.040" Score="0" Body="&lt;p&gt;&lt;strong&gt;Self-fibonaciing prophecy&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;L&lt;/code&gt; is the length in bytes of your source code&lt;br&gt;&#xA;and &lt;code&gt;n=(L+2)^2&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program or function should output &lt;code&gt;Fib(n)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program or function should take no input, and output according to the usual code golf rules&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This seems like a very simple task, but the &lt;code&gt;(L+2)^2&lt;/code&gt; part is designed to prevent single digit outputs which could be hard coded in many languages, and ensure the required output will usually be longer than the source code, so it should produce some interesting mathematical answers&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Question for meta - Is &lt;code&gt;(L+2)^2&lt;/code&gt; suitable for this?&lt;br&gt;&#xA;Another possibility I have considered is &lt;code&gt;(L^2)+8&lt;/code&gt; which would grow a bit slower but still achieve the goal of preventing trivial solutions&lt;br&gt;&#xA;Having a look at this again, I think the sequence still grows too quickly. Maybe &lt;code&gt;n=ceil(L^1.5)+18&lt;/code&gt; would be more reasonable&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another question for meta - Should I include a link to a source of Fibonaci numbers, or is it safe to assume readers know what this is and can find it for themselves?&lt;/p&gt;&#xA;" OwnerUserId="42493" LastEditorUserId="42493" LastEditDate="2019-08-27T11:07:33.193" LastActivityDate="2019-08-27T11:07:33.193" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="18020" PostTypeId="2" ParentId="2140" CreationDate="2019-08-27T12:26:35.480" Score="0" Body="&lt;h1&gt;Compare Multiratios&lt;/h1&gt;&#xA;&lt;p&gt;EDIT: No doesn't make any sense, I need to think about it again.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-08-27T12:26:35.480" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18021" PostTypeId="2" ParentId="2140" CreationDate="2019-08-27T13:26:05.193" Score="2" Body="&lt;h2&gt;Up side down keyboard&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Jono 2906 wants you to create a translator from plain Australian to up-side-down text after inventing a keyboard dedicated to typing up-side-down text, since they still want to demonstrate that their keyboard is powerful after failing to program in their keyboard.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, they want your implementation to be typed with their own keyboard, since they also want to get used to programming using their keyboard.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input/Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The whole ASCII character set mapped to their up-side down variation (the up-side down &lt;code&gt;&quot;&lt;/code&gt; is a double &lt;code&gt;,&lt;/code&gt;):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; !&quot;#$%&amp;amp;'()*+,-./&#xA;0123456789:;&amp;lt;=&amp;gt;?&#xA;@ABCDEFGHIJKLMNO&#xA;PQRSTUVWXYZ[\]^_&#xA;`abcdefghijklmno&#xA;pqrstuvwxyz{|}~&#xA;&#xA; ¡,,#$%⅋,)(*+'-˙/&#xA;0ƖᄅƐㄣϛ9ㄥ86:;&amp;gt;=&amp;lt;¿&#xA;@∀qƆpƎℲפHIſʞ˥WNO&#xA;ԀQɹS┴∩ΛMX⅄Z]\[^‾&#xA;,ɐqɔpǝɟƃɥᴉɾʞlɯuo&#xA;dbɹsʇnʌʍxʎz}|{~&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The rest of the characters are kept as-is(yes, the unprintable characters are in the ASCII character set). The characters that are larger than 0x7f will be mapped back by subtracting the character code by 128.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you are using a character that is larger than 256, modulo the character's character code by 128 before checking the availability.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No standard loopholes, please.&lt;/li&gt;&#xA;&lt;li&gt;Input and output will be taken with our standard input methods.&lt;/li&gt;&#xA;&lt;li&gt;If you force Jono 2906 to change a key on their keyboard (allowing typing your specified character), you will get a penalty of +2 bytes for every key you add.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-08-28T10:04:30.180" LastActivityDate="2019-08-28T10:04:30.180" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18022" PostTypeId="2" ParentId="2140" CreationDate="2019-08-27T14:07:27.503" Score="1" Body="&lt;h1&gt;N-bonacci from a Seed&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fibonacci&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fibonacci&amp;#39;&quot; rel=&quot;tag&quot;&gt;fibonacci&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An &lt;a href=&quot;https://en.wikipedia.org/wiki/Generalizations_of_Fibonacci_numbers#Fibonacci_numbers_of_higher_order&quot; rel=&quot;nofollow noreferrer&quot;&gt;N-bonacci sequence&lt;/a&gt; is a Fibonacci-like sequence where the N previous terms are added to get the next term. The Fibonacci series is a 2-bonacci sequence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a list of integers &lt;code&gt;L&lt;/code&gt; of length &lt;code&gt;l&lt;/code&gt; and an integer &lt;code&gt;n&lt;/code&gt;, output the first &lt;code&gt;n&lt;/code&gt; digits of the &lt;code&gt;l&lt;/code&gt;-bonacci sequence starting with the sequence &lt;code&gt;L&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Input is a list, array, delimited string, stream, etc of integers, and an integer. Input is flexible, provided &lt;code&gt;L&lt;/code&gt; and &lt;code&gt;n&lt;/code&gt; are separable. It is guaranteed that &lt;code&gt;n &amp;gt;= 0&lt;/code&gt;, and &lt;code&gt;l &amp;gt;= 1&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Output the first &lt;code&gt;n&lt;/code&gt; digits of the &lt;code&gt;l&lt;/code&gt;-bonacci sequence starting with &lt;code&gt;L&lt;/code&gt;. Output is flexible here also: a list, array, string, stream, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Samples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1,1], 5       --&amp;gt; 1, 1, 2, 3, 5&#xA;[0,1,2], 1     --&amp;gt; 0&#xA;[10,1,-1], 10  --&amp;gt; 10, 1, -1, 10, 10, 19, 39, 68, 126, 233&#xA;[-1,0,1], 0    --&amp;gt; //no output, or empty output&#xA;[-1], 3        --&amp;gt; -1, -1, -1&#xA;[-1,-2,1,0], 9 --&amp;gt; -1, -2, 1, 0, -2, -3, -4, -9, -15&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so smallest in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/70476/print-the-n-bonacci-sequence&quot;&gt;Related&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2019-08-28T17:37:51.570" LastActivityDate="2019-08-28T17:37:51.570" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18024" PostTypeId="2" ParentId="2140" CreationDate="2019-08-27T20:54:44.077" Score="3" Body="&lt;h1&gt;Java vs C++&lt;/h1&gt;&#xA;&lt;p&gt;Now posted at &lt;a href=&quot;https://codegolf.stackexchange.com/questions/194923/time-to-settle-this-java-vs-c&quot;&gt;Time to settle this: Java vs C++&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="88701" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-10-26T18:26:53.320" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="18025" PostTypeId="2" ParentId="2140" CreationDate="2019-08-28T01:49:49.880" Score="6" Body="&lt;h1&gt;ASCII Maze Unrendering 3000&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/maze&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;maze&amp;#39;&quot; rel=&quot;tag&quot;&gt;maze&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/191262/ascii-maze-rendering-3000&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="88483" LastEditorUserId="88483" LastEditDate="2019-09-04T00:47:47.347" LastActivityDate="2019-09-04T00:47:47.347" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18027" PostTypeId="2" ParentId="2447" CreationDate="2019-08-28T12:47:18.477" Score="12" Body="&lt;h1&gt;Numerical input and output can be given as a character code&lt;/h1&gt;&#xA;&lt;p&gt;For example, the input &lt;code&gt;64&lt;/code&gt; can instead be given as the character &lt;code&gt;@&lt;/code&gt;. This is mainly used for more esoteric languages that can only take input through character codes, for example brainfuck.&lt;/p&gt;&#xA;" OwnerUserId="76162" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-08-28T12:47:18.477" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18028" PostTypeId="1" AcceptedAnswerId="18031" CreationDate="2019-08-28T15:49:42.813" Score="23" ViewCount="520" Body="&lt;p&gt;So along with site graduation, one new option we have is an info box on the sidebar. For example, you can see what these look like on &lt;a href=&quot;https://law.stackexchange.com/&quot;&gt;Law&lt;/a&gt; or &lt;a href=&quot;https://judaism.stackexchange.com/&quot;&gt;Judaism&lt;/a&gt; Stack Exchange (directly above the &quot;featured on meta&quot; box). These are used to link to important meta posts that new users need to be aware of.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Liiiiike &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/31716&quot;&gt;The Sandbox!&lt;/a&gt; We encourage almost all new users to use the sandbox before posting challenges to main, so it would be really great if we could put a message up visible to all new users directing them there. This will also mean that we don't have to keep featuring the sandbox every month when it automatically unfeatures (which is kind of annoying to do).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now the only problem. What should the text say? If you have an idea for what the text should say, post it as an answer. Ideally, we're looking for something&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Short. Ideally 2-3 sentences (This is code-golf after all!)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Communicates the purpose of the sandbox.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Communicates the purpose of this site.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="78028" LastEditDate="2019-09-04T16:21:28.397" LastActivityDate="2021-03-17T22:15:49.437" Title="An info box to point new users to The Sandbox" Tags="|discussion|status-completed|sandbox|graduation|" AnswerCount="6" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18029" PostTypeId="2" ParentId="18028" CreationDate="2019-08-28T16:29:08.427" Score="-5" Body="&lt;p&gt;My draft, version 2:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Code Golf Stack Exchange contains many competitive programming challenges. These challenges must have a clear specification and an &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8130&quot;&gt;objective winning criterion&lt;/a&gt;. If you are unsure whether your challenge is ready for posting, post it as an answer to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140&quot;&gt;our sandbox&lt;/a&gt;!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I feel like parts of this text might not be as necessary as I think they are, but I can't think of a way to remove them. Also, this looks a tad bit long.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2019-08-28T17:32:32.707" LastActivityDate="2019-08-28T17:32:32.707" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18030" PostTypeId="2" ParentId="18028" CreationDate="2019-08-28T16:47:41.137" Score="6" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Questions on this site should be recreational programming challenges that have an &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8130/why-do-we-have-objective-winning-criteria&quot;&gt;objective primary winning criterion&lt;/a&gt;. It is highly recommended to submit your challenge ideas to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt;, where you can receive feedback from other users prior to posting to the main site.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Also draws some attention upon &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8130/why-do-we-have-objective-winning-criteria&quot;&gt;Why do we have objective winning criteria?&lt;/a&gt;, which I think is just as important as the Sandbox and emphasizes that we host recreational challenges (as opposed to general programming questions). It should perhaps be golfed a bit, as it is 43 words long (Mi Yodeya: 30. Law: 38).&lt;/p&gt;&#xA;" OwnerUserId="59487" LastEditorUserId="41024" LastEditDate="2019-08-28T17:22:45.333" LastActivityDate="2019-08-28T17:22:45.333" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18031" PostTypeId="2" ParentId="18028" CreationDate="2019-08-28T17:48:18.493" Score="23" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Code Golf Stack Exchange is a site for recreational programming competitions, not general programming questions. Challenges must have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8130/why-do-we-have-objective-winning-criteria&quot;&gt;an objective scoring criterion&lt;/a&gt;, and it is highly recommended to first post proposed challenges in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Short &amp;amp; (mostly) to the point. Biggest difference from others suggested here is a proper-ish intro as to not look out-of-place.&lt;/p&gt;&#xA;" OwnerUserId="59183" LastEditorUserId="59183" LastEditDate="2019-08-30T14:04:21.427" LastActivityDate="2019-08-30T14:04:21.427" CommentCount="20" ContentLicense="CC BY-SA 4.0" />
  <row Id="18032" PostTypeId="2" ParentId="18028" CreationDate="2019-08-28T20:50:01.333" Score="4" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Code Golf Stack Exchange hosts recreational programming competitions. Feel free to answer any existing challenge. Propose challenges in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;The Sandbox&lt;/a&gt;, just make sure they are of an &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges&quot;&gt;acceptable quality&lt;/a&gt; and have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8130/why-do-we-have-objective-winning-criteria&quot;&gt;clear winning criteria&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Basically a golfed version of previous answers, but with one more relevant link, and emphasising &lt;em&gt;answering&lt;/em&gt; existing challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Edit: Now has sandbox as first link, and a more positive tone. Edit 2: add &quot;recreational&quot;.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2019-08-30T04:24:32.853" LastActivityDate="2019-08-30T04:24:32.853" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18033" PostTypeId="2" ParentId="18028" CreationDate="2019-08-29T07:47:26.337" Score="-2" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Programming challenges are fun but fixing bugs in the spec after someone already posted an answer isn't, so please bring your ideas first to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?cb=1&quot;&gt;challenge development sandbox&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="194" LastActivityDate="2019-08-29T07:47:26.337" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18037" PostTypeId="2" ParentId="2140" CreationDate="2019-08-30T15:59:40.230" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/191301/whats-this-constructed-numbers-starter&quot;&gt;What&amp;#39;s this constructed number&amp;#39;s starter?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2019-09-04T13:57:54.097" LastActivityDate="2019-09-04T13:57:54.097" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18038" PostTypeId="2" ParentId="2140" CreationDate="2019-08-31T00:56:27.640" Score="4" Body="&lt;h2&gt;Polyglot wrappers&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Many polyglots are a disastrous mess of unmaintainable code. Let's make this different.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Make a polyglot &quot;wrapper&quot; such that code from two or more languages may be embedded in the file without modification.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider the following polyglot wrapper for &lt;strong&gt;Bash and Python&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;'''true'&#xA;B&#xA;exit 0&#xA;#'''&#xA;P&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This wrapper can be used such that &lt;code&gt;B&lt;/code&gt; can be replaced by an arbitrary bash script, and &lt;code&gt;P&lt;/code&gt; can be replaced by an arbitrary python script.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After the scripts have been injected into the wrapper, running the resulting polyglot via either interpreter (bash or python) will result in functionally identical behavior as the original input scripts.   &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Your wrapper must support the injection of 2 or more languages&lt;/li&gt;&#xA;&lt;li&gt;Your wrapper can use arbitrary markers for the string-&gt;script replacement&lt;/li&gt;&#xA;&lt;li&gt;The markers must be at least 1 byte in size (no line number tricks)&lt;/li&gt;&#xA;&lt;li&gt;Assume the replacement will be done by first replacing all markers with sufficiently long and random data, such that conflicts between the marker literals and contents of the input code cannot exist. However, your markers cannot conflict with the contents of the wrapper itself.&lt;/li&gt;&#xA;&lt;li&gt;The behavior of the original input programs must not be altered by the wrapper. Ex: an input program that returns 0 must return 0 when run from your wrapper. An input program that crashes must still crash. &lt;/li&gt;&#xA;&lt;li&gt;The winner is the polyglot wrapper that supports the most languages, with a tie breaker of smallest size (in bytes).&lt;/li&gt;&#xA;&lt;li&gt;Allowances shall be made for a program that accesses itself on disk. Obviously no polyglot wrapper could correctly return identical output for a script that outputs its own file size. &lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Question for the sandbox&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this sufficiently unique and understandable? Are there any loopholes I haven't covered?&lt;/p&gt;&#xA;" OwnerUserId="88942" LastActivityDate="2019-08-31T00:56:27.640" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18040" PostTypeId="1" CreationDate="2019-08-31T23:19:22.903" Score="-2" ViewCount="165" Body="&lt;p&gt;My understanding of code-golf in general is that you're to provide the shortest solution in a given language. However, for most challenges, you could safely pick a language no one really is familiar with, and write a fairly lengthy code solution without worrying that someone will top it. For example, most of the questions here do not have a solution written in, say, x86 or MIPS. It'd be possible to write a poorly optimized (in terms of bytes) solution in these respective 'languages' (technically assemblies, but whatever), with little worry of it being beaten. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this considered ethical?&lt;br&gt;&#xA;I suppose the counterargument could be made that making these obscure languages commonplace would both raise awareness of them, and could also create competition, but at the same time, doing so with really lengthy programs seems to fly in the face of the very concept of golfing. &lt;/p&gt;&#xA;" OwnerUserId="77057" LastActivityDate="2019-09-01T10:42:27.623" Title="Ethics of Golfing in Assembly or other extremely uncommon languages" Tags="|discussion|code-golf|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18041" PostTypeId="2" ParentId="18040" CreationDate="2019-08-31T23:32:04.767" Score="8" Body="&lt;p&gt;Submissions should be competitive. This means you must make efforts to minimize (or maximize) your score. Submissions that fail to do so are against the rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you are attempting get away with breaking the rules by picking an obscure language, it is still against the rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, realize that users here are specialists in obscure languages, so this plan will likely fail. Obscure languages are totally acceptable: We rather love them here. &lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2019-09-01T00:13:53.127" LastActivityDate="2019-09-01T00:13:53.127" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18042" PostTypeId="2" ParentId="2140" CreationDate="2019-09-01T00:00:16.813" Score="0" Body="&lt;h1&gt;Smallest self-hosting golfing language &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Implement a golfing language that is implemented in itself. Formally speaking: The original compiler O (an executable file assumed to be implemented in other language X), when given its own source code S (in golfing language G), must produce the identical executable file O. Your task is to create G by implementing O.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Language X might be an ELF binary, x86 assembly, Python, LLVM IR, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Neither your language implementation S or executable file O may use functions that have the same functionality as exec or eval. That is, you may not use any built-in code evaluation of your compiler O. Standard Quine loopholes, such as reading your own file, downloading your file from the internet, and holding the program data in the filename, are not allowed. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The executable file O of the compiler must not be embedded in any shape or form in the source code S of the compiler. Additionally, the source code S of the compiler must be strictly shorter than the executable file O. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code must not be dependent on any external program or internet resource other than language X: if your language is dependent, include the size of the external dependencies in your submissions. Your program gets a standard POSIX system base for free, plus GCC 8 and LLVM 10: you do not have to include the size of this in your submission. For example, if you submitted a Bash Quine that just invoked the 05AB1E interpreter via the command line, you would have to include both the size of the the 05AB1E implementation, as well as the size of the Elixir implementation (since 05AB1E is implemented in Elixir and your base language X isn’t Elixir) in your bytecount.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition, standard golfing loopholes apply.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Requirements&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Answer at least 10 other &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges on this website, beating at least 50% of the existing answers in byte size. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Only challenges that already have 4 answers are allowed&lt;/li&gt;&#xA;&lt;li&gt;Your own other answers to the challenges do not count &lt;/li&gt;&#xA;&lt;li&gt;Challenges newer than this post are allowed, as well as answering your own challenges; provided they already have 4 answers from other answerers&lt;/li&gt;&#xA;&lt;li&gt;Link to your challenge answers for verification&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Base language X restrictions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Language X must have an implementation, in other words we must be able to actually run your compiler O with source code S and get compiler O as output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Language X must have already existed before this post was created.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are encouraged to share the techniques of how you created your compiler and how you came up with your golfing language. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$S*0.98^{(n-10)}$$&lt;/span&gt; where n is the number of challenges where you beat at least 50% of the other answers, not including your own. &lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Feedback&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;How can you prevent someone submit a zero bytes answer and claim: if source is empty, it output the interpreter, otherwise output compiled python code. – tsh Aug 24 at 4:42&lt;/p&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2019-09-01T00:00:16.813" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18043" PostTypeId="1" CreationDate="2019-09-01T10:21:45.160" Score="-2" ViewCount="108" Body="&lt;p&gt;The self promotion problem. It has been solved in the chat (making a boundary between irritating self promotion and honest hope), but have we gotten to consensus about submissions?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've posted a &lt;a href=&quot;https://codegolf.stackexchange.com/posts/190995/revisions&quot;&gt;submission&lt;/a&gt; to challenge with a link to the answer's github repository (named, I have to agree, pretty suggestively &quot;star me on github&quot;). It was removed by one of the mods, quoting,&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;removing self-promotion&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Is this kind self promotion in submissions forbidden? I'm striving to find a rule for this, but it seems like there is none. Is this even a self-promotion?&lt;/p&gt;&#xA;" OwnerUserId="61379" LastActivityDate="2019-09-01T18:22:07.213" Title="Self promotion in submissions?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18044" PostTypeId="2" ParentId="18040" CreationDate="2019-09-01T10:42:27.623" Score="0" Body="&lt;p&gt;Submission in obscure language that is very probably hard to program is worth more than any other golfed submission in programming language made specifically for golfing, because there was so much more effort put in answering. The more interesting question is - is it ethical to golf in golfing languages?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm a Malbolge programmer, and I've posted many submissions to various challenges in Malbolge. The submissions aren't golfed that much, but neither I or anyone else is going to think I'm doing unethical stuff.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm also criticizing the requirement of golfing my submissions, because &lt;strong&gt;I&lt;/strong&gt; may get outgolfed, but why does it bother &lt;strong&gt;you&lt;/strong&gt;?&lt;/p&gt;&#xA;" OwnerUserId="61379" LastActivityDate="2019-09-01T10:42:27.623" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18045" PostTypeId="2" ParentId="18043" CreationDate="2019-09-01T18:22:07.213" Score="6" Body="&lt;p&gt;The rules you are looking for are in the Help Center: &lt;a href=&quot;https://codegolf.stackexchange.com/help/promotion&quot;&gt;How to not be a spammer&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Specifically, that page states:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;Don't include links except to support what you've written.&lt;/strong&gt; Links are not a substitute for including information in your answer itself, and links should always be directly relevant to a part of your answer.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Including a link to a GitHub repository where you have hosted the code and asking for stars is not directly relevant to the answer itself, and is solely self-promotion, which is not acceptable by the network-wide rules.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastActivityDate="2019-09-01T18:22:07.213" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18046" PostTypeId="2" ParentId="2140" CreationDate="2019-09-03T05:45:32.837" Score="3" Body="&lt;h1&gt;Shortest Persistent Object in 5-Char JS&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;[]+=`&lt;/code&gt; subset of JavaScript is &lt;a href=&quot;https://codegolf.stackexchange.com/a/111002/61384&quot;&gt;known to be Turing-complete&lt;/a&gt;. A key part of the construction is obtaining persistent objects whose properties can be set and retrieved in a loop.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Most expressions won't evaluate to constant values. For example, &lt;code&gt;[] != []&lt;/code&gt; when compared by reference. However, some expressions, such as &lt;code&gt;[].name&lt;/code&gt;, return the same object every time they are evaluated.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The following should hold when &lt;code&gt;e&lt;/code&gt; is substituted with your submission:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;(e) instanceof Object&lt;/code&gt; (this  includes functions and arrays)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(e) == (e)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest valid submission (measured in bytes) wins.&lt;/p&gt;&#xA;" OwnerUserId="61384" LastEditorUserId="20283" LastEditDate="2019-09-03T11:28:40.833" LastActivityDate="2019-09-03T11:28:40.833" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18047" PostTypeId="1" CreationDate="2019-09-03T11:02:34.317" Score="2" ViewCount="166" Body="&lt;p&gt;I am new to codegolf, but not new to the Stack Exchange Network, so I am puzzled (pun intended).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I recently joined this community and immediately searched for tips about how to post good php answers and &quot;golf&quot; my snippets to the maximum (or is it minimum?).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When conducting such research, it is only logical to search the content within a community's Meta because that's where people post about site behaviors and occurrences.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I was surprised when I came upon &#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/5713/88960&quot;&gt;PHP golfing tips: Reading/writing files and the CLI&lt;/a&gt; in the Main community -- it's definitely &lt;strong&gt;NOT A PUZZLE&lt;/strong&gt; -- it is asking advice about how to best post on the Main site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It was ultimately helpful to me, but seems like a perfect candidate for migration to Meta.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My flag:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;This is not a code golf puzzle; it is asking about how to improve answer quality. This page should be migrated to codegolf.meta.stackexchange.com – mickmackusa 2 days ago&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Outcome:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;declined - a moderator reviewed your flag, but found no evidence to support it&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Please explain this decision because it makes no sense to me at all.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;After writing the above, I read the suggested pages in the similar questions box and chased the links with in.  Including:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1470/88960&quot;&gt;Re-evaluating [tips] and tip-like questions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1723/88960&quot;&gt;Let's decide what kind of non-challenge questions we want once and for all&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1547/88960&quot;&gt;Not quite main, not quite meta questions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;...and more.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I find myself mostly aligning with Rainbolt, Howard, and Mego in most cases, but regardless of which side of the fence you are on, popularity isn't how this debate should swiftly end.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let me say, that I don't endorse the diluting of the Main scope as a tactic to pad posting count or entice more registrations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I get it, we all want our own communities to thrive.  I am a new moderator at Joomla Stack Exchange -- a community that is &lt;a href=&quot;https://area51.stackexchange.com/proposals/58842/joomla&quot;&gt;not on track to mature beyond Beta&lt;/a&gt;.  JSE has loosened their scope to be more inclusive of support for Joomla extensions and issues encountered while conducting Joomla development because limiting the scope to strictly the core CMS would see Joomla users rerouted back to Stackoverflow/elsewhere (and our community would never gain traction). This is a reasonable justification that does not break the expectations of Stack Exchange.  When SE users cross-pollinate/drift into our community, they know where to find what they are looking for and they know where to post.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Meta is the best place to park &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions because:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;They seek &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/support&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt; and/or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/discussion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt; (edit: from the community on how to post).&lt;/li&gt;&#xA;&lt;li&gt;They are NOT puzzles. (edit: ...nor &quot;challenges&quot; nor &quot;competitions&quot;.  They are unexpected anomalies in a vast and predictably-formatted pool of puzzles/challenges/competitions.)&lt;/li&gt;&#xA;&lt;li&gt;They attract answers that improve the quality of legitimate posts on Main.&lt;/li&gt;&#xA;&lt;li&gt;This community is no longer in Beta, so there is no need to scope-stretch to win the site graduation game.&lt;/li&gt;&#xA;&lt;li&gt;&quot;Staying the course&quot; because &quot;that's how we've always done it&quot; (edit: or &quot;that is what is currently engraved on our Meta stone&quot;) is a tragic philosophy.&lt;/li&gt;&#xA;&lt;li&gt;Getting increased traffic on Meta is part of a healthy community too!&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;If you've already posted your opinion on other Meta pages and don't have any new arguments, that's fine, I've probably already read them.  I hope that this post stimulates the current moderation team to consider reining in the on-topic question scope.  I think the time is right.&lt;/p&gt;&#xA;" OwnerUserId="88960" LastEditorUserId="88960" LastEditDate="2019-09-03T20:04:45.730" LastActivityDate="2019-09-03T20:04:45.730" Title="Please explain why this page was not sensibly migrated to Meta" Tags="|discussion|moderation|migration|php|declined-flags|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18048" PostTypeId="2" ParentId="18047" CreationDate="2019-09-03T11:34:48.847" Score="6" Body="&lt;p&gt;The subject of this community is &lt;em&gt;code golf&lt;/em&gt; (&amp;amp; coding challenges).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While most main posts are indeed code golf challenges, other types of posts about code golf are perfectly on-topic too. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; is maybe the most common.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To address your specific concerns:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;They seek &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/support&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt; and/or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/discussion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt;.&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;No they don't. They seek objective answers: how code can be shortened.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;2&quot;&gt;&#xA;  &lt;li&gt;They are NOT puzzles.&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The word &lt;em&gt;puzzles&lt;/em&gt; is not in our site name.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;3&quot;&gt;&#xA;  &lt;li&gt;They attract answers that improve the quality of legitimate posts on Main.&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;True, but they also help people golf code outside of the site.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;4&quot;&gt;&#xA;  &lt;li&gt;This community is no longer in Beta, so there is no need to scope-stretch to win the site graduation game.&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;True.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;5&quot;&gt;&#xA;  &lt;li&gt;&quot;Staying the course&quot; because &quot;that's how we've always done it&quot; is a tragic philosophy.&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Even more so now that the site is called just &lt;em&gt;Code Golf&lt;/em&gt; they are on-topic Main content.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ol start=&quot;6&quot;&gt;&#xA;  &lt;li&gt;Getting increased traffic on Meta is part of a healthy community too!&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Yes, but we shouldn't move on-topic Main content to Meta because of that.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2019-09-03T11:34:48.847" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18049" PostTypeId="2" ParentId="18047" CreationDate="2019-09-03T13:53:13.350" Score="10" Body="&lt;p&gt;Meta sites have a clearly defined scope. &lt;a href=&quot;https://codegolf.stackexchange.com/help/whats-meta&quot;&gt;What is &amp;quot;meta&amp;quot;? How does it work?&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Meta Code Golf Stack Exchange is the part of the site where users discuss the workings and policies of Code Golf Stack Exchange rather than discussing programming puzzles or code golf itself. It is separated from the main Q&amp;amp;A to reduce noise there while providing a legitimate space for people to ask how and why this site works the way it does. Meta is for...&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;...Code Golf Stack Exchange users to communicate with each other&lt;/strong&gt; about Code Golf Stack Exchange (asking questions about how the websites work, or about policies and community decisions)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;...Code Golf Stack Exchange users to communicate with Stack Overflow the company&lt;/strong&gt; (posting bugs, suggesting improvements, or proposing new features), and&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;...Stack Overflow the company to communicate with the community&lt;/strong&gt; (soliciting feedback on new ideas or features, or discussing policies that affect the whole network)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Some &amp;quot;tips&amp;quot; questions fall in that scope:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2522/12012&quot;&gt;Tips for writing good code golf questions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14966/12012&quot;&gt;What answer-chaining scoring criteria promote collaboration?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5804/12012&quot;&gt;Tips for providing high-quality answers in popularity contests&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;are all concerned specifically with posting on Code Golf, making them a good fit for meta.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/5713/12012&quot;&gt;PHP golfing tips: Reading/writing files and the CLI&lt;/a&gt; may not be a puzzle, but that's not a requirement for posting on the main site. Since this question is about golfing in general—not about posting on Code Golf in particular—it is off topic on meta.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-09-03T13:53:13.350" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18050" PostTypeId="1" AcceptedAnswerId="18056" CreationDate="2019-09-03T20:59:55.707" Score="15" ViewCount="456" Body="&lt;p&gt;Recently, a number of old &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenges have popped up in the Close Votes review queue, with users voting to &lt;a href=&quot;https://codegolf.stackexchange.com/q/189110/66833&quot;&gt;close them&lt;/a&gt; as &lt;a href=&quot;https://codegolf.stackexchange.com/q/172628/66833&quot;&gt;off-topic&lt;/a&gt; as their deadline for submissions has passed. Personally, I don't see any need to close old challenges that have ended, as people can still post (non-competitive) answers to them, but I'd like a community decision.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In addition, if we do close expired &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenges, should we also close &lt;a href=&quot;https://codegolf.stackexchange.com/q/54807/66833&quot;&gt;expired&lt;/a&gt; challenges with the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-or-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-or-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-or-robbers&lt;/a&gt; tag, or other tags, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;, or even old &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges with an end date?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we close old/expired challenges just because their deadline for submissions has passed?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="31716" LastEditDate="2019-09-03T21:09:58.953" LastActivityDate="2019-09-05T14:24:37.700" Title="Should we close old KoTH challenges as off-topic?" Tags="|discussion|close-reasons|king-of-the-hill|vote-to-close|" AnswerCount="4" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18052" PostTypeId="2" ParentId="2140" CreationDate="2019-09-04T00:54:19.413" Score="0" Body="&lt;h1&gt;DRAFT: Remove vertical comments &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Vertical commnets...&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;        /&amp;gt; push back with    result.cows_used.push_back(possiblecow);&#xA;        the new cow added &amp;lt;/ cows_used.push_back(result.cows_used);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Traditional comments...&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;        /* push back with */ result.cows_used.push_back(possiblecow);&#xA;     /* the new cow added */ cows_used.push_back(result.cows_used);&#xA;&#xA;&#xA;        result.cows_used.push_back(possiblecow);&#xA;        cows_used.push_back(result.cows_used);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Annotated, everything with . is considered a comment:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;        /&amp;gt;.................. result.cows_used.push_back(possiblecow);&#xA;        ..................&amp;lt;/ cows_used.push_back(result.cows_used);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;What is both between the start row of /= and the end row of =/ and between the start column of /= and the end column of =/ is considered a comment.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;        /&amp;gt; push back with       result.cows_used.push_back(possiblecow);&#xA;           the new cow added &amp;lt;/ cows_used.push_back(result.cows_used);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Todo&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Add testcases&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2019-09-04T00:54:19.413" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18053" PostTypeId="2" ParentId="18050" CreationDate="2019-09-04T03:18:50.340" Score="13" Body="&lt;p&gt;Having one of my questions being quickly close-voted for this reason, I think it shouldn't happen. Just because an answer is late to a challenge, I don't think it's bad or invalid. The late answers are often some of the best, since they aren't just quickly thrown together to try to win a challenge, but instead designed purely for the sake of deigning them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As someone who enjoys reading old challenges, the &lt;code&gt;[closed]&lt;/code&gt; marking often keeps me from even bothering to read the question, since it would usually indicate the question is of low quality, is off topic, or is too broad. Having one of my questions branded with &lt;code&gt;[closed]&lt;/code&gt; just for being outdated wouldn't seem fair to me.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In some cases, like the Sriotchilism O'Zaic's answer mentions, it makes sense. However, I think doing so without consent from the question's author isn't fair to them.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2019-09-04T03:18:50.340" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18054" PostTypeId="2" ParentId="2140" CreationDate="2019-09-04T04:08:49.317" Score="3" Body="&lt;h2&gt;Cleaning the dishes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this task, you will be given a bar of soap with a width of 1 or more units, which will be inputted as an integer. You will also be given a plate, which you will have to clean, using the soap as few times as you can. The plate will be inputted as a an array of 2 different characters, one of which is the 'dirty' character, and one of which is the 'clean' character. The plate will be at least 1 character. You will have to output an array with the 'clean' character representing the plate, and a third unique character to represent in what positions the bar of soap was placed. None of these 3 unique characters may be whitespace.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How much the soap cleans:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;n//2-1 on each side for odd n&#xA;n//2-1 on the left side of the soap bar for even n&#xA;n//2   on the right side of the soap bar for even n&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An integer greater than or equal to 1. A series of 2 unique characters to represent clean portions and dirty portions.&#xA;Here, '=' represents a dirty portion, and '-' represents a clean portion. '+' represents where the soap was placed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;IN : OUT&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3 ===- : -+--&#xA;32 ================================ : ---------------+----------------&#xA;1 ==== : ++++&#xA;5 ----- : -----&#xA;4 -====- : --+---&#xA;3 -====- : --+-+-&#xA;7 === : +--&#xA;6 - : -&#xA;6 -==-===- : ---+----&#xA;5 -==--==- : ---+--+-&#xA;3 -==--==- : --+--+--&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are multiple solutions. Any one of them are acceptable, as long as they use the soap the minimum amount of times possible.&lt;/li&gt;&#xA;&lt;li&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; contest, so the shortest answer in bytes wins!&lt;/li&gt;&#xA;&lt;li&gt;The plate may only be non-whitespace characters, and have 2 unique characters.&lt;/li&gt;&#xA;&lt;li&gt;The soap may only be one non-whitespace character, unique from the other 2 used in the plate.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are not allowed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Posted: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/192885/cleaning-the-dishes&quot;&gt;Cleaning the dishes&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="88943" LastEditorUserId="88943" LastEditDate="2019-09-15T23:02:30.513" LastActivityDate="2019-09-15T23:02:30.513" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18055" PostTypeId="2" ParentId="2140" CreationDate="2019-09-04T11:15:09.430" Score="0" Body="&lt;h1&gt;I see your BIDMAS and raise you a BADMIS&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a set of numbers with operators between them: &quot;5 + 4 * 9 / 3 - 8&quot;, return all the possible results of the expression for every permutation of the order of basic operations: [/, *, +, -].&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard loopholes forbidden&lt;/li&gt;&#xA;&lt;li&gt;I/O&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input must be ordered with infix operations, but however that is easiest (string or array)&lt;/li&gt;&#xA;&lt;li&gt;Output must be all of the possible results of the expression, no specified format or order, no repeats&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;All of the inputs are valid (e.g. do not need to deal with &quot;7 / 3 + *&quot;&lt;/li&gt;&#xA;&lt;li&gt;Operators are all left-associative so &quot;20 / 4 / 2&quot; = &quot;(20 / 4) / 2&quot;&lt;/li&gt;&#xA;&lt;li&gt;This is Code Golf so fewest number of bytes wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases (With explanation)&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&quot;2 + 3 * 4&quot; = [14, 20]&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;2 + (3 * 4)  ⟶  2 + (12) ⟶ 14&lt;/li&gt;&#xA;&lt;li&gt;(2 + 3) * 4 ⟶ (5) * 4 ⟶ 20&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&quot;18 / 3 * 2 - 1&quot; = [11, 6, 2, 6]&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;((18 / 3) * 2) - 1 ⟶ ((6) * 2) - 1 ⟶ (12) - 1 ⟶ 11&lt;/li&gt;&#xA;&lt;li&gt;((18 / 3) * (2 - 1) ⟶ (6) * (1) ⟶ 6&lt;/li&gt;&#xA;&lt;li&gt;(18 / (3 * 2)) - 1 ⟶ (18 / (6)) - 1 ⟶ (3) - 1 ⟶ 2&lt;/li&gt;&#xA;&lt;li&gt;18 / (3 * (2 - 1)) ⟶ 18 / (3 * (1)) ⟶ 6&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases (Without explanation)&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&quot;45 / 8 + 19 / 45 * 3&quot; = [5.765740740740741, 0.01234567901234568, 0.11111111111111113]&lt;/li&gt;&#xA;&lt;li&gt;&quot;2 + 6 * 7 * 2 + 6 / 4&quot; = [154,113.5,88]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="83323" LastEditorUserId="83323" LastEditDate="2019-09-05T11:45:48.287" LastActivityDate="2019-09-05T11:45:48.287" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18056" PostTypeId="2" ParentId="18050" CreationDate="2019-09-04T14:58:57.440" Score="16" Body="&lt;p&gt;I don't think the intention of the &quot;answers must be competitive&quot; rule ever was to close all questions which can't be improved on, nor does requiring closing follow from noticing a question which has an answer that can't be competed with.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should we also close a challenge with a 0-byte answer if it said &quot;least amount of bytes wins, with tie breaker being post time&quot;? To note is that answering (many) KotHs after the deadline is allowed, it's just that you won't win - exactly the same outcome scoring/winning-wise, just for different reasons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's also the argument that seeing a closed challenge might give a bad view on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;/&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; - if all old popular KotHs are closed, it makes sense to think that all KotHs are off-topic and shouldn't be asked.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Personally, I would also say that closing KotHs just because their deadline has passed doesn't benefit anyone (IMO making similar challenges shouldn't &lt;em&gt;at all ever&lt;/em&gt; be influenced by previous ones not being closed except if it's a direct duplicate (in which case editing makes 100% sense, but that's another topic)), and the closed tag would probably confuse many, and may result in people ignoring a potentially interesting question.&lt;/p&gt;&#xA;" OwnerUserId="59183" LastEditorUserId="59183" LastEditDate="2019-09-04T15:04:19.033" LastActivityDate="2019-09-04T15:04:19.033" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18059" PostTypeId="2" ParentId="18050" CreationDate="2019-09-05T07:25:51.610" Score="14" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Personally, I don't see any need to close old challenges that have ended, as people can still post (non-competitive) answers to them&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The &quot;&lt;em&gt;(non-competitive)&lt;/em&gt;&quot; is a red herring.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a well presented KotH, anyone can (subject to being able to install all the necessary compilers/interpreters/runtimes) run the contest and reproduce the results. If this isn't the case then the question should be closed as off-topic for lacking an objective winning criterion, not for being past its &quot;best before&quot; date.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In other words, the &quot;best before&quot; date should only be relevant for the accepted answer. And although in an ideal world the accepted answer would be updated when a better answer is received, I'm sure we could find plenty of examples in other tags where that isn't the case. I don't think anyone would propose closing a question as off-topic just because OP is no longer active on the site and so can't update the accepted answer, but that's essentially the same problem.&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2019-09-05T07:25:51.610" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18060" PostTypeId="2" ParentId="18050" CreationDate="2019-09-05T14:24:37.700" Score="-4" Body="&lt;p&gt;The primary use in closing a question is that it prevents new answers from being submitted.  Usually this is used to prevent a challenge from accumulating answers while their issues are being sorted out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we want to prevent KOTHs from accumulating answers after their deadlines then closing them is a good way to do this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However the question stands as to whether or not we want to stop new answers from being posted. You make a case for them in your question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And I agree with this case I do think that there is value in new answers to old questions.  However currently we disallow answers that make no attempt to optimize for the challenge.  Answers submitted after the deadline cannot win or even place and thus do not optimize for the challenge.  In fact in a sense it is not even possible to do worse than a late answer.  And so by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8750/56656&quot;&gt;our current consensus&lt;/a&gt; they are disallowed.  (there are no &quot;non-competing&quot; answers)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So what can we do about these valuable contributions that are being lost because a challenge is closed to submissions?  Well I am of the belief that if you think you have a valuable contribution then you should re-ask the challenge, hopefully improve it, perhaps remove the deadline, so that your new answer can compete against other answers. It may be a good idea in these cases to move over some of the existing answers as community wikis.  Valuable contributions go to waste if they can not actually compete.  They are already locked out of the challenge whether we prevent them from being posted or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this case it is &lt;em&gt;useful&lt;/em&gt; to close the challenges.  This will prevent invalid answers and will make room for new versions of the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a little different for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; questions since starting the question anew radically changes things and a contribution to an old question does not necessarily work for a new one.  This situation is discussed more thoroughly &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11103/reposts-of-answer-chaining-challenges&quot;&gt;here&lt;/a&gt;. I think we should stick with what is said there, but I don't want to give the impression that my answer applies to answer chaining questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;This is Sriotchilism O'Zaic's answer originally, I am reposting under CW as they wish to be disassociated from it&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2019-09-05T14:24:37.700" CommentCount="5" CommunityOwnedDate="2019-09-05T14:24:37.700" ContentLicense="CC BY-SA 4.0" />
  <row Id="18063" PostTypeId="2" ParentId="2140" CreationDate="2019-09-05T16:25:00.550" Score="0" Body="&lt;h1&gt;The Rattlin' Bog&lt;/h1&gt;&#xA;&lt;p&gt;There's a relatively famous Irish Folk song called &lt;I&gt;The Rattlin' Bog&lt;/I&gt;, a type of &lt;a href=&quot;https://en.wikipedia.org/wiki/Cumulative_song&quot; rel=&quot;nofollow noreferrer&quot;&gt;cumulative song&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Basically, this is a song that alternates between a chorus and an ever-expanding verse&lt;/p&gt;&#xA;&lt;p&gt;The chorus is as follows:&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Ho, ro, the rattlin' bog&lt;br /&gt;&#xA;The bog down in the valley-o&lt;br /&gt;&#xA;Ho, ro, the rattlin' bog&lt;br /&gt;&#xA;The bog down in the valley-o&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Each verse starts with&lt;br /&gt;&#xA;&lt;em&gt;And on that [x] there was a [y]&lt;br /&gt;&#xA;A rare [y], a rattlin' [y]&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;and ends with&lt;br /&gt;&#xA;&lt;em&gt;In the bog down in the valley-o&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Where x is the word from the previous round, and y is the word for the current round. In between these two is the cumulative part. It starts with:&lt;br /&gt;&#xA;&lt;em&gt;The [z] in the bog&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Each new round adds&lt;br /&gt;&#xA;&lt;i&gt;The [y] in the [x] and &lt;/i&gt;&lt;br /&gt;&#xA;To its predecessor.&lt;/p&gt;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Given a list of strings, character arrays, or whatever reasonable equivalent collection of string or your language equivalent thereof, Your job is to print the lyrics to the song, alternating between the chorus and each verse, starting and ending with the chorus. The chorus and verse must be separated by a pair of newlines.&lt;/p&gt;&#xA;&lt;p&gt;For the sake of brevity, you may write the chorus once, preceded by &amp;quot;[Chorus]&amp;quot; then write &amp;quot;[Chorus]&amp;quot; in place. I'm also omitting any sort of final verse with unique text.&lt;/p&gt;&#xA;&lt;p&gt;&lt;b&gt;Example:&lt;/b&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input: [House, Roof, Nest] &#xA;Output:&#xA;[Chorus] &#xA;Ho, ro, the rattlin' bog &#xA;The bog down in the valley-o &#xA;Ho, ro, the rattlin' bog &#xA;The bog down in the valley-o  &#xA;&#xA;And on that bog there was a House&#xA;A rare House, a rattlin' House&#xA;The House in the bog&#xA;In the bog down in the valley-o&#xA;&#xA;[Chorus]&#xA;&#xA;And on that House there was a Roof&#xA;A rare Roof, a rattlin' Roof&#xA;The Roof in the House and the House in the bog&#xA;In the bog down in the valley-o&#xA;&#xA;[Chorus]&#xA;&#xA;And on that Roof there was a Nest&#xA;A rare Nest, a rattlin' Nest&#xA;The Nest in the Roof and the Roof in the House and the House in the bog&#xA;In the bog down in the valley-o&#xA;&#xA;[Chorus]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="77057" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-09-05T16:25:00.550" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18065" PostTypeId="2" ParentId="2140" CreationDate="2019-09-06T17:40:43.463" Score="0" Body="&lt;h1&gt;Sliding window minimum &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The task is, given a number array of length &lt;code&gt;n&lt;/code&gt; and a positive integer &lt;code&gt;k&lt;/code&gt;, to compute the smallest values in all its overlapping consecutive subarrays of length &lt;code&gt;k&lt;/code&gt; in the order they occur.&lt;/p&gt;&#xA;&lt;p&gt;The complexity of your program should be no more than linear with respect to &lt;code&gt;n&lt;/code&gt; with a constant added.&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;A positive integer array of length &lt;code&gt;n&lt;/code&gt; and a positive integer &lt;code&gt;k&lt;/code&gt; (&lt;code&gt;k &amp;lt;= n&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;A positive integer array with &lt;code&gt;n - k + 1&lt;/code&gt; elements, where the element at position &lt;code&gt;i&lt;/code&gt; equals the least number in the subarray starting at &lt;code&gt;i&lt;/code&gt; and ending at &lt;code&gt;i + k - 1&lt;/code&gt; inclusive.&lt;/p&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1, 3, 5, 7], 2 -&amp;gt; [1, 3, 5]&#xA;[1, 3, 5, 3, 5, 1], 3 -&amp;gt; [1, 3, 3, 1] &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;TODO&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox stuff&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is it acceptable to combine code-golf with restricted-complexity?&lt;/li&gt;&#xA;&lt;li&gt;Is the complexity restriction clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Is it a good idea to allow calculating the maximum instead of the mininum?&lt;/li&gt;&#xA;&lt;li&gt;Is the grammar correct enough?&lt;/li&gt;&#xA;&lt;li&gt;Has this been posted before?&lt;/li&gt;&#xA;&lt;li&gt;Do any languages have built-ins for this?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="36445" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-09-06T17:40:43.463" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="18067" PostTypeId="2" ParentId="6918" CreationDate="2019-09-07T00:40:48.810" Score="1" Body="&lt;h2&gt;&lt;a href=&quot;https://esolangs.org/wiki/@&quot; rel=&quot;nofollow noreferrer&quot;&gt;@&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Unlike other submissions, note that there isn't a self-referring pronoun!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;@ is a functional language created by &lt;a href=&quot;https://codegolf.stackexchange.com/users/72036/gemdude46&quot;&gt;Gemdude46&lt;/a&gt; designed for code-golfing. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Structure of a program&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The language is made of a tree of function calls. Each character (with some exceptions) represents a function that may take as many or few arguments as it likes. Arguments are then read from directly after it in the code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If instruction A takes 1 argument, B takes 2, C takes 3, and D and E both take none, then the @ code&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   BADCDBEDE&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Would be written in many languages like&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   B(A(D()), C(D(), B(E(), D()), E())))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Instruction arguments are evaluated LTR unless the docs explicitly say otherwise. Arguments may not be evaluated at all or may be evaluated more than once. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Values and data types&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;@ has the following data types:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;number - This is an arbitrary precision rational number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;vector - This is an immutable list of other values of any type.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If anything refers to a string, then it means a vector of codepoints.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anything enclosed in braces is seen as a string literal. String literals are automatically ended on EOF. Should an EOF be encountered where an instruction should be, Š is used. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Hello world:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   ħ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Cat:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   ¤ōč&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Truth machine:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   ?ň¤Ō10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Links&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://esolangs.org/wiki/@&quot; rel=&quot;nofollow noreferrer&quot;&gt;Page&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/gemdude46/atLang&quot; rel=&quot;nofollow noreferrer&quot;&gt;Repo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-09-07T00:49:09.567" LastActivityDate="2019-09-07T00:49:09.567" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18069" PostTypeId="1" CreationDate="2019-09-07T07:06:59.760" Score="28" ViewCount="299" Body="&lt;p&gt;We now have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18028/an-info-box-to-point-new-users-to-the-sandbox&quot;&gt;nifty new info-box to point new users to the Sandbox&lt;/a&gt;. Hooray!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/jrFVH.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/jrFVH.png&quot; alt=&quot;CGSE info box&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But when a new user does go to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/20260&quot;&gt;Sandbox&lt;/a&gt; for the first time, the instructions there don't give them much to work from to write their Sandboxed challenge. I think the Sandbox post itself is prime real estate for challenge-writing guidance and links that users might actually read. For example, it think it would help to mention:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges&quot;&gt;Things to avoid when writing challenges&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Writing test cases&lt;/li&gt;&#xA;&lt;li&gt;How long to Sandbox for (the linked &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2056/20260&quot;&gt;Sandbox FAQ&lt;/a&gt; includes this but is too hidden I think)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;What can we put in the Sandbox post to make it more immediately useful for new challenge writers?&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2019-09-07T07:06:59.760" Title="Sandbox instructions for new users" Tags="|discussion|sandbox|new-users|" AnswerCount="0" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18070" PostTypeId="2" ParentId="2140" CreationDate="2019-09-07T08:03:21.840" Score="2" Body="&lt;h2&gt;Wrong position&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I typr re;atively accuratrly, but so,etimes I made a whole nlock of text illegible by shifting a key right. So I need a program that corrects my text back to its original meaning.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You have to &lt;em&gt;left&lt;/em&gt; shift on a standard English QWERTY keyboard.&lt;/li&gt;&#xA;&lt;li&gt;Whitespace do not count for the procedure before left-shifting and are kept as-is in a standard left-shifting procedure. If the key is the leftmost letter/symbol on a keyboard(i.e. &lt;code&gt;The ~key, Q key, A key, Z key.&lt;/code&gt;), the key is kept as-is. If you reach a control character while left-shifting (&lt;code&gt;Caps lock and Shift&lt;/code&gt;), their effects will not be triggered and the character before left-shifting is kept.&lt;/li&gt;&#xA;&lt;li&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; contest; the shortest answer wins.&lt;/li&gt;&#xA;&lt;li&gt;Both the input and the output shall be given via our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;default methods&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Representation of a subset of the QWERTY keyboard that you will need&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The two lines connected are possible values of the key: shifted/unshifted.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;~!@#$%^&amp;amp;*()_+&#xA;`1234567890-=&#xA;&#xA;QWERTYUIOP{}|&#xA;qwertyuiop[]\&#xA;&#xA;ASDFGHJKL:&quot;&#xA;asdfghjkl;'&#xA;&#xA;ZXCVBNM&amp;lt;&amp;gt;?&#xA;zxcvbnm,./&#xA;&#xA;(Space)&#xA;(Space)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input will always be a non-empty string conforming the rules above.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The output will be the input string corrected to the originally intended meaning.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Yjod ,sfr yjr, imjsppu/ -&amp;gt; This made them unhappy.&#xA;vpfr hp;g -&amp;gt; code golf&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Feedback&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I think this is &lt;em&gt;not&lt;/em&gt; a duplicate; however, is any part of this challenge unclear or needs improvements?&#xA;&lt;hr&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-09-09T23:10:30.620" LastActivityDate="2019-09-09T23:10:30.620" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18071" PostTypeId="2" ParentId="2140" CreationDate="2019-09-07T09:44:01.977" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Battleships TDM&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In this (not so simple) game of commanding a battleship, you are tasked to defeat the opposing team. Cooperation is essential in order to win the battle. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each ship starts with &lt;span class=&quot;math-container&quot;&gt;$${500\cdot\bigg\lfloor\frac{10}{\log{\frac{n}{3}}}}\bigg\rfloor$$&lt;/span&gt; health (rounded down), where &lt;code&gt;n&lt;/code&gt; is a number of players. At 30 players, it is 5000. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Setup&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The game starts with a square map of length &lt;strong&gt;50+3n&lt;/strong&gt;. On top and bottom there is 15% of the width, in which the players' ships will spawn. The rest of the map will be prodedurally generated with islands.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The sample map looks like this:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/Bhmch.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Bhmch.png&quot; alt=&quot;Map&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Phase 1: Issuing commands&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;On your turn, your program will be given a file &lt;code&gt;input.txt&lt;/code&gt; located in the program's directory, with following format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;TURN=(turn number)&#xA;SIZE=(size of the map)&#xA;YOUR_SHIP=(first 6 chars from SHA1 hash of your ship's name; in case of conflicts a random one will be generated)&#xA;YOUR_TEAM=(your team's id)&#xA;HEALTH=(your ship's health)&#xA;POS=(position of your ship in 0,0 format)&#xA;SPEED=(your ship's speed)&#xA;DIR=(your ship's direction)&#xA;TERRAIN:&#xA;(21x21 square of characters, centered on the ship)&#xA;PROXIMITY:&#xA;(line-separated list of ships within 10 squares, with its properties separeated by semicolon)&#xA;CHAT:&#xA;(line-separated history of text sent by teammates from the last and current round)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;TURN=21&#xA;SIZE=110&#xA;YOUR_SHIP=acf44a&#xA;YOUR_TEAM=1&#xA;HEALTH=3231&#xA;POS=64,121&#xA;SPEED=3&#xA;DIR=NW&#xA;TERRAIN:&#xA;.....................&#xA;###.............x....&#xA;##.................##&#xA;(etc.)&#xA;PROXIMITY:&#xA;bd439a=1;69,132;S;3 (ship's id, team, position, direction, speed)&#xA;43351f=2;78,112;NE;4&#xA;(etc.)&#xA;CHAT:&#xA;58ab38@21: ENEMY_SHIP 582af2 @ 142,62 NE 3&#xA;902dd1@20: 033b2c 4 92,62 SW 1&#xA;(etc.)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The map shows &lt;code&gt;.&lt;/code&gt; for water, &lt;code&gt;#&lt;/code&gt; for land, &lt;code&gt;x&lt;/code&gt; for wrecks, &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;2&lt;/code&gt; for ships belonging to particular team.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program is allowed &lt;strong&gt;3 actions&lt;/strong&gt; per turn. The actions are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;NONE - do nothing&#xA;TURN_LEFT - rotates ship counterclockwise by 45 degrees&#xA;TURN_RIGHT - rotates ship clockwise by 45 degrees&#xA;SPEED_UP - increases speed by 1. At speed 5 it is ignored.&#xA;SPEED_DOWN - decreases speed by 1. At speed -1 it is ignored. &#xA;MESSAGE=message - sends a message to chat&#xA;FIRE=x,y - fire a projectile in specified location. Can be done only once per turn. &#xA;           The cannon has range of 25. Issuing a command which exceeds it is ignored.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;TURN_LEFT&#xA;SPEED_UP&#xA;FIRE=62,69&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;must be written to &lt;code&gt;output.txt&lt;/code&gt;. After each round the file is cleared.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Phase 2: Movement phase&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;All ships in random order move forward defined by their speed.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If ship hits the land or wreck during movement, the ship stops and takes damage worth 50x of ship's speed.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If ship hits the map border, same situation applies.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If ship hits other ship, it is considered &lt;strong&gt;ramming&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If rammed from the front, both ships receive damage worth 100x sum of ships' speeds. Both ships stop.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If rammed from the back, rammed ship receives damage worth 20x difference of ships' speeds. Rammed ship moves one step forward and ramming ship ends its movement.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If rammed from the side, rammed ship receives damage worth 100x speed of ramming ship, while the ramming one receives 50x. Ramming ship stops.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If rammed at the angle, rammed ship receives damage worth 50x speed of ramming ship, while the ramming one receives 20x. Ramming ship stops.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the rammed ship is friendly, ramming ship receives 1 point of friendly fire.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Phase 3: Firing phase&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In the same order ships fire from the cannons (if any). If the cannon hits a target:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;That is within range 10: Shots deal 500 + 0-99 damage &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;That is beyond range 10: Shots deal 500 + 0-99 damage + 0-99 damage for each unit beyond 10th (up to 2084 total damage at range 25)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the target is friendly, the damage is 0 and shooting ship receives 1 point of friendly fire.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There is 5% chance to make a hit critical: The total damage is tripled and shooter recieves 1 critical point.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If it is a fatal blow, it is considered a &lt;strong&gt;destruction&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The fatal blow dealer receives a fatal point.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Attacker with most dealt damage receives a kill point (it may be the same ship as the dealer).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Everyone else with a hit receives an assist point.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If it is a solo kill, the dealer receives 2 of each points instead.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Phase 4: Checking conditions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each ship is considered a wreck if:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Health reaches below 0 HP,&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Ship gains 5 friendly fire points.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Wrecks remain on the map, but they are removed from the queue and program of such ships is being not executed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Game ends whenever entire team gets destroyed or after 1000 turns, in which the points are being calculated as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;1 point for each 10 damage dealt&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;500 points for each kill&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;200 points for each fatal blow&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;100 points for each assist&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;150 points for each critical hit&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;-250 points for each friendly fire hit&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;1000 points for each winning team member&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Points for achievements (names are just for decoration):&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;500 (awarded once) Beyond the horizon - Hit on enemy from 13 sq or more&#xA;500 (awarded once) Maximum range - Hit on enemy from 23 sq or more&#xA;500 (awarded once per participant) Coordinated attack - 3 or more ships attacking the same target&#xA;500 (awarded once) Hammer - Ram a ship on full speed&#xA;500 (awarded each time) - Survive a critical hit&#xA;1000 (awarded once per participant) Anihilation - Both ships getting destroyed in headfront ramming&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The ship with most points after 10 games wins.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Code&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The controller code is here. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your program &lt;strong&gt;can&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;store data in files within its own directory&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;communicate with teammates through the team's chat&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your program &lt;strong&gt;cannot&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;read files outside its scope&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;disrupt the communications &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Attack friendly ships on purpose&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Copy other competitors' functionality (No duplicates)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Use &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;standard loopholes&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Sandbox questions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'm not sure whether to allow the challenge in any usual language or require one specific (in this case Java 8)?&lt;/li&gt;&#xA;&lt;li&gt;Wouldn't be achievements unnecessary? If not, could be any added/modified/removed?&lt;/li&gt;&#xA;&lt;li&gt;Are there some rules that require clarification?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="88326" LastEditorUserId="73111" LastEditDate="2019-09-17T08:02:15.597" LastActivityDate="2019-09-17T08:02:15.597" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="18072" PostTypeId="2" ParentId="2140" CreationDate="2019-09-07T15:09:38.757" Score="0" Body="&lt;h1&gt;Universal duct tape programming &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/duct-tape-coding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;duct-tape-coding&amp;#39;&quot; rel=&quot;tag&quot;&gt;duct-tape-coding&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The task is to write a program that [TODO: insert simpleish task here] that works in as many languages as possible, while only using code that was already written before by someone else at &lt;a href=&quot;http://stackoverflow.com&quot;&gt;http://stackoverflow.com&lt;/a&gt;.&#xA;To minimize time, you are trying to use as few snippets as possible. Therefore, they must be as long as possible.&lt;/p&gt;&#xA;&lt;p&gt;Code from &lt;a href=&quot;http://stackoverflow.com&quot;&gt;http://stackoverflow.com&lt;/a&gt; is defined as substrings of code blocks in questions, answers and comments created before this challenge [TODO: or perhaps this sandbox post?]. You must link to the source of the code in your answer.&#xA;You can concatenate multiple snippets, optionally inserting newlines.&lt;/p&gt;&#xA;&lt;p&gt;Your code must work in at least two different languages.&lt;/p&gt;&#xA;&lt;p&gt;Your score is equal to the minimum of the number of languages your code works in and the length of the shortest snippet you use. Highest score wins.&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox stuff&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a good idea?&lt;/li&gt;&#xA;&lt;li&gt;How simple should the simpleish task be?&lt;/li&gt;&#xA;&lt;li&gt;Can the scoring system be abused?&lt;/li&gt;&#xA;&lt;li&gt;Does the &amp;quot;multiple languages&amp;quot; part need clarification?&lt;/li&gt;&#xA;&lt;li&gt;Does the &amp;quot;stackoverflow snippets&amp;quot; part need clarification?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="36445" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-10-20T08:58:04.923" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18073" PostTypeId="2" ParentId="2140" CreationDate="2019-09-07T21:03:42.313" Score="0" Body="&lt;h1&gt;Consequence Golf&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As specified by &lt;a href=&quot;https://xkcd.com/1920/&quot; rel=&quot;nofollow noreferrer&quot;&gt;this xkcd&lt;/a&gt;, Consequence Golf is a game involving golfing and bombs. The most obvious consequence of bombs: damage to the course.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A Consequence Golf course consists of the union of several circular regions. The tee is located at (0, 0). On each turn, you hit the &lt;strike&gt;ball&lt;/strike&gt; bomb in a direction at some power. The bomb will travel in that direction for a distance equal to the power of the shot, unless it hits the edge of the course, in which case it will explode immediately. When a bomb explodes, it adds to the course a new circle centered on the point of contact with a radius equal to the remaining power. The next shot starts at the last location of the bomb.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A list of circles, consisting of x/y coordinates and a radius for each circle, taken in any convenient format. If you must define a custom data type to store this information (e.g. &lt;code&gt;struct c{float x,y,r};&lt;/code&gt;), you do not need to count that added &lt;em&gt;boilerplate, nonproductive storage&lt;/em&gt; code in your byte count. Any code that does something besides specify storage must be counted.&lt;/li&gt;&#xA;&lt;li&gt;A list of strokes, consisting of an angle in radians or degrees, and a power, again in any convenient format.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The location of the bomb after the final stroke.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Additional Rules&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The course will always contain at least one circle&lt;/li&gt;&#xA;&lt;li&gt;The course will always contain the tee at (0, 0)&lt;/li&gt;&#xA;&lt;li&gt;If there are zero strokes, you must return (0, 0)&lt;/li&gt;&#xA;&lt;li&gt;The power of a stroke will never be zero&lt;/li&gt;&#xA;&lt;li&gt;&quot;Any convenient format&quot; means a list of lists, list of C structs, a list for each input (x, y, radius, power, angle), or similar. You may not take information that is not as it is specified. For example, you may not take the circles as a series of equations.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;strike&gt; consequence&lt;/strike&gt; code golf, so shortest code in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;TBD...&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h3&gt;Questions for META:&lt;/h3&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Is the description of how to play Consequence Golf clear enough?&lt;/li&gt;&#xA;  &lt;li&gt;Is the description of the input clear enough? This is my main concern.&lt;/li&gt;&#xA;  &lt;li&gt;Is allowing boilerplate storage code outside of the byte count an issue?&lt;/li&gt;&#xA;  &lt;li&gt;I am considering allowing fixed point approximations with at least 4 bits of precision for languages without floating point (and languages with, if it somehow makes things shorter). Would this cause any unintended issues?&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="88483" LastEditorUserId="88483" LastEditDate="2019-09-09T19:13:36.137" LastActivityDate="2019-09-09T19:13:36.137" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18075" PostTypeId="2" ParentId="2140" CreationDate="2019-09-08T11:55:48.310" Score="0" Body="&lt;p&gt;Encode MC6000 instructions&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In MC6000, these are registers list:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;acc  general&#xA;dat  general&#xA;p0   simple pin&#xA;p1   simple pin&#xA;x0   XBus pin&#xA;x1   XBus pin&#xA;x2   XBus pin&#xA;x3   XBus pin&#xA;null pseudo&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;general&lt;/code&gt; means reading from it returns the last value written to it, &lt;code&gt;XBus pin&lt;/code&gt; means reading from or writing to it have side effect(so &lt;code&gt;teq x0 x1&lt;/code&gt; doesn't equal to &lt;code&gt;teq x1 x0&lt;/code&gt;) that nothing else can take its place, &lt;code&gt;simple pin&lt;/code&gt; means reading from it also writes zero to it(so &lt;code&gt;mov 0 p0&lt;/code&gt; equals to &lt;code&gt;mov p0 null&lt;/code&gt;), writing anything to it(including the writing while reading) have side effect, and writing anything larger than 100 behaves same as writing 100, as well as writing anything smaller than 0 same as writing 0(so &lt;code&gt;mov -4 p0&lt;/code&gt; equals to &lt;code&gt;mov 0 p0&lt;/code&gt;). Writing anything into &lt;code&gt;null&lt;/code&gt; has no effect and reading from &lt;code&gt;null&lt;/code&gt; returns 0(so &lt;code&gt;mov 9 null&lt;/code&gt; equals to &lt;code&gt;nop&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The instruction set is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;nop            Do nothing&#xA;mov R/I R      operand2:=operand1&#xA;jmp L          Jump to the specified line(can't be replaced)&#xA;slp R/I        Sleep for the number of time units specified by the operand.&#xA;slx XP         Sleep until XP avaliable(can't be replaced)&#xA;add R/I        acc:=f(acc+operand)&#xA;sub R/I        acc:=f(acc-operand)&#xA;mul R/I        acc:=f(acc*operand)&#xA;not            acc:=100(if acc was 0) or 0(otherwise)&#xA;dgt R/I        acc:=(acc/10^operand)mod 10(if operand in 0,1,2) or 0(otherwise)&#xA;dst R/I R/I    acc:=[abs(acc-[(acc/10^operand1)mod 10]*10^operand1)+abs(operand2 mod 10)*10^operand1]&#xA;               *sgn(operand2*2+1) (if operand1 in 0,1,2) or acc(otherwise)&#xA;teq R/I R/I    sym:='+'(if operand1 equals to operand2) or '-'(otherwise)&#xA;tgt R/I R/I    sym:='+'(if operand1 is larger than operand2) or '-'(otherwise)&#xA;tlt R/I R/I    sym:='+'(if operand1 is smaller than operand2) or '-'(otherwise)&#xA;tcp R/I R/I    sym:='+'(if operand1 is larger than operand2),&#xA;               '-'(if operand1 is smaller than operand2) or '*'(otherwise)&#xA;gen SP R/I R/I Output 100 and 0 to the simple pin for the latter two operands, inclusive&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here &lt;code&gt;R/I&lt;/code&gt; means a register or an integer between -999 and 999, inclusive; &lt;code&gt;R&lt;/code&gt; means a register, &lt;code&gt;L&lt;/code&gt; means an integer between 0 and 13, &lt;code&gt;XP&lt;/code&gt; means an XBus pin, and &lt;code&gt;SP&lt;/code&gt; means a simple pin. &lt;code&gt;f(x)&lt;/code&gt; is defined as &lt;code&gt;min(999,max(-999,x))&lt;/code&gt;. Sleeping for zero or negative time units sleep for time as long as a &lt;code&gt;nop&lt;/code&gt;(so &lt;code&gt;nop&lt;/code&gt;=&lt;code&gt;slp 0&lt;/code&gt;=&lt;code&gt;slp -3&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Before an instruction, symbol &lt;code&gt;+&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt; and &lt;code&gt;@&lt;/code&gt; can exist, meaning that the instruction is executed only if sym is &lt;code&gt;+&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt; and &lt;code&gt;@&lt;/code&gt;, inclusive. (&lt;code&gt;@&lt;/code&gt; doesn't work like this in fact but that doesn't affect this problem) Whether the instruction is executed matters even if it's a no operand(so &lt;code&gt;+ nop&lt;/code&gt; doesn't equal to &lt;code&gt;- nop&lt;/code&gt;, but &lt;code&gt;+ nop&lt;/code&gt; equals to &lt;code&gt;+ tgt 1 0&lt;/code&gt;).After an instruction, comment start with &lt;code&gt;#&lt;/code&gt; can exist, which can be ignored. Spaces work as separator, and can be added or removed as long as words are separated in the same way(continious spaces, spaces at both side).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Now, write a program A that, reads an instruction and output an integer; and write a program B that reads the output of program A and output an equal or same instruction fed into program A.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your score will be the sum of length of program A, length of program B, and difference between the maximum and minimum of output of A. Lowest score in every language win. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using MetaGolfScript is allowed. Only write &lt;code&gt;MetaGolfScript&lt;/code&gt; in language area and show the exact version you use in code area to make it leaderboard friendly.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2019-09-10T04:41:50.730" LastActivityDate="2019-09-10T04:41:50.730" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18076" PostTypeId="2" ParentId="2140" CreationDate="2019-09-09T15:58:10.797" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/191559/stage-a-coup-to-become-king-of-the-hill/191560&quot;&gt;Posted to PPCG&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="88456" LastEditorUserId="88456" LastEditDate="2019-09-10T00:10:03.620" LastActivityDate="2019-09-10T00:10:03.620" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18077" PostTypeId="2" ParentId="2140" CreationDate="2019-09-10T00:29:25.553" Score="2" Body="&lt;h1&gt;Path to Path Rearrangement&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fractal&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fractal&amp;#39;&quot; rel=&quot;tag&quot;&gt;fractal&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the xkcd comic &lt;a href=&quot;https://xkcd.com/195/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&quot;Map of the Internet&quot;&lt;/a&gt;, a special fractal path was used, similar to this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0  1  14 15&#xA;3  2  13 12&#xA;4  7  8  11&#xA;5  6  9  10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Ascii art version:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-0---1  14---15--16 19--20---21&#xA;     |   |       |   |       |&#xA; 3---2  13---12 17---18 23---22&#xA; |           |           |&#xA; 4   7---8   11 30---29 24---25&#xA; |   |   |   |   |   |       |&#xA; 5---6   9---10 31  28--27---26&#xA;                 |&#xA;58---57 54---53 32  35--36---37&#xA; |   |   |   |   |   |       |&#xA;59  56---55  52 33---34 39---38&#xA; |           |           |&#xA;60---61 50---51 46---45 40---41&#xA;     |   |       |   |       |&#xA;63---62 49---+---47 44--43---42&#xA;\|/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This path, known as the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/100335/draw-the-hilbert-curve&quot;&gt;Hilbert&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/104392/ascii-hilbert-curve&quot;&gt;curve&lt;/a&gt;, has some interesting properties. Among other things, it can be flipped diagonally without changing most of those properties.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;-0   3---4---5  58--59---60  63-&amp;gt;&#xA; |   |       |   |       |   |&#xA; 1---2   7---6  57---56 61---62&#xA;         |           | &#xA;14---13  8---9  54---55 50---49&#xA; |   |       |   |       |   |&#xA;15  12--11---10 53--52---51   48&#xA; |                           |&#xA;16---17 30---31--32--33 46---47&#xA;     |   |           |   |&#xA;19---18 29---28 35---34 45---44&#xA; |           |   |           |&#xA;20  23---24  27 36  39---40  43&#xA; |   |   |   |   |   |   |   |&#xA;21---22 25---26 37---38 41---42&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your task is to apply this transformation. Given a space on one path, find the corresponding location on the other. For example, the fourth space in the top path is located at (0, 2), which is the 14th space along the second path, so the correct output for 4 is 14.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As with similar &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; challenges, this can be done as:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An infinite sequence along the second path of the corresponding locations along the first path&lt;/li&gt;&#xA;&lt;li&gt;A function/program that takes a numbered position on the first path and returns the distance to that point on the second path.&lt;/li&gt;&#xA;&lt;li&gt;A function/program that takes a numbered position on the first path and returns all path 1 positions along path 2 to the point specified.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The first 64 terms of this sequence (zero indexed, add one to each for one indexed) are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 3 2 1 14 15 12 13 8 11 10 9 6 7 4 5 58 57 56 59 60 63 62 61 50 49 48 51 52 55 54 53 32 35 34 33 46 47 44 45 40 43 42 41 38 39 36 37 26 25 24 27 28 31 30 29 18 17 16 19 20 23 22 21&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is code golf, so shortest code in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h2&gt;Meta Questions&lt;/h2&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Do I need a better description of the paths?&lt;/li&gt;&#xA;  &lt;li&gt;Is the challenge itself clear?&lt;/li&gt;&#xA;  &lt;li&gt;Any other issues I should fix before posting?&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="88483" LastEditorUserId="88483" LastEditDate="2019-09-12T14:57:27.790" LastActivityDate="2019-09-12T14:57:27.790" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18078" PostTypeId="2" ParentId="2140" CreationDate="2019-09-11T14:52:36.967" Score="5" Body="&lt;h1&gt;Fix my stuttered words&lt;/h1&gt;&#xA;&lt;p&gt;Posted: &lt;a href=&quot;https://codegolf.stackexchange.com/q/193196/81663&quot;&gt;Fix my stuttered words&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="81663" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-09-19T15:46:09.663" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18080" PostTypeId="2" ParentId="2140" CreationDate="2019-09-13T07:29:08.663" Score="1" Body="&lt;h1&gt;Solve a cubic equation &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(Is this really not a duplicate?)&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2019-09-13T07:29:08.663" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="18081" PostTypeId="2" ParentId="2140" CreationDate="2019-09-13T10:08:15.370" Score="2" Body="&lt;h1&gt;&lt;strong&gt;Is this number part of a Collatz prime sequence?&lt;/strong&gt;&lt;/h1&gt;&#xA;&lt;p&gt;A fast step of the Collatz sequence is defined as&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$s_\mathrm{Collatz}:\mathbb{N}_\mathrm{odd}\to\mathbb{N},\quad n \mapsto \frac{3\cdot n+1}{2}.$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given an odd positive integer &lt;span class=&quot;math-container&quot;&gt;\$n\in\mathbb{N}_\mathrm{odd}\$&lt;/span&gt;, your task is to decide whether or not both &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$s_\mathrm{Collatz}(n)\$&lt;/span&gt; are prime numbers.&lt;/p&gt;&#xA;&lt;p&gt;Your program should output two distinct and unique values to represent truthiness and falseness, whereby falseness may also be represented by signalling an error.&lt;/p&gt;&#xA;&lt;p&gt;Since &lt;span class=&quot;math-container&quot;&gt;\$n+\frac12(n+1)=n+\lceil\frac n2\rceil\$&lt;/span&gt; for odd &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, the sorted sequence of all numbers which result in truthiness in the above sense is equal to the tail of &lt;a href=&quot;https://oeis.org/A158709&quot; rel=&quot;nofollow noreferrer&quot;&gt;A158709&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;-8 -&amp;gt; -        ; undefined behavior&#xA;1  -&amp;gt; false    ; (3*1 +1)/2 = 4 is not prime&#xA;3  -&amp;gt; true     ; (3*3 +1)/2 = 5 is prime&#xA;5  -&amp;gt; false    ; (3*5 +1)/2 = 8 is not prime&#xA;7  -&amp;gt; true     ; (3*7 +1)/2 = 11 is prime&#xA;11 -&amp;gt; true     ; (3*11+1)/2 = 17 is prime&#xA;15 -&amp;gt; false    ; 15 is not prime&#xA;91 -&amp;gt; false    ; (3*91+1)/2 = 137 is prime, yet 91 is not&#xA;97 -&amp;gt; false    ; (3*97+1)/2 = 146 is not prime&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="9534" LastEditorUserId="73111" LastEditDate="2021-04-28T04:48:42.160" LastActivityDate="2021-04-28T04:48:42.160" CommentCount="18" ContentLicense="CC BY-SA 4.0" />
  <row Id="18082" PostTypeId="2" ParentId="2140" CreationDate="2019-09-13T12:41:01.680" Score="1" Body="&lt;h1&gt;Randomize &lt;span class=&quot;math-container&quot;&gt;\$SL_n(\mathbb R)\$&lt;/span&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Given a positive integer &lt;span class=&quot;math-container&quot;&gt;\$n &amp;gt; 1\$&lt;/span&gt;, return a random element from &lt;span class=&quot;math-container&quot;&gt;\$SL_n(\mathbb R)\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$SL_n(\mathbb R)\$&lt;/span&gt; is the set of &lt;span class=&quot;math-container&quot;&gt;\$n \times n\$&lt;/span&gt; matrices with determinant &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;In theory the output must cover the whole &lt;span class=&quot;math-container&quot;&gt;\$SL_n(\mathbb R)\$&lt;/span&gt; (that is, if the RNG you're using was perfect and we could actually represent real numbers).&lt;/li&gt;&#xA;&lt;li&gt;We don't require an &lt;em&gt;uniform&lt;/em&gt; distribution.&lt;/li&gt;&#xA;&lt;li&gt;Instead of real numbers it is sufficient to work with floating point numbers.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-09-13T12:41:01.680" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="18084" PostTypeId="2" ParentId="2140" CreationDate="2019-09-13T17:09:13.090" Score="2" Body="&lt;h1&gt;Creep Spread Territorial Control (WIP)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt; (probably)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Blah blah blah flavor blah blah blah something about Starcraft blah blah blah&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Gameplay&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Initial State&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There is a 150x150 grid of square cells with approximately 7500 random cells missing in a symmetric Perlin noise pattern. There are four creep spread factions competing for dominance of this territory beginning as a single cell 10 cells in from a corner of the grid (one faction per corner). Each faction starts with 50 energy. The board &lt;em&gt;does not&lt;/em&gt; wrap around at the edges.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Expansion&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each turn, each faction earns 1 point of energy for each controlled cell plus 20 base energy. This energy is used for expansion. How much a cell costs to expand to depends on how many cells controlled by the same faction are in the &lt;a href=&quot;https://en.wikipedia.org/wiki/Moore_neighborhood&quot; rel=&quot;nofollow noreferrer&quot;&gt;Moore neighborhood&lt;/a&gt; of the target cell.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;0 neighbors: cannot expand to this cell&lt;/li&gt;&#xA;&lt;li&gt;1 neighbor: 50 energy&lt;/li&gt;&#xA;&lt;li&gt;2 neighbors: 20 energy&lt;/li&gt;&#xA;&lt;li&gt;3 neighbors: 12 energy&lt;/li&gt;&#xA;&lt;li&gt;4 neighbors: 8 energy&lt;/li&gt;&#xA;&lt;li&gt;5 neighbors: 5 energy&lt;/li&gt;&#xA;&lt;li&gt;6 neighbors: 3 energy&lt;/li&gt;&#xA;&lt;li&gt;7 neighbors: 2 energy&lt;/li&gt;&#xA;&lt;li&gt;8 neighbors: 1 energy&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;There is no limit to how many cells can be expanded to in one turn other than energy costs. All expansions occur simultaneously. If two or more factions attempt to claim the same cell on the same turn, the one with the most neighbors of its own faction will claim the cell. If there is a tie, none of the factions claim that cell. Players whose expansions failed due to competition will not be refunded. Factions may expand onto each other's territory, stealing ownership of the cell.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Game End&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The game lasts 10,000 turns or until there is only one faction remaining, whichever happens first. The winner is the faction with the most owned cells. Ties are broken by remaining energy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The overall winner will be resolved with a randomized pool where each bot plays an equal number of games followed by 12 games of the top 4 contenders. (one for each possible corner positioning)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Coding&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a bot that plays this game&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bots must be deterministic. As a way to provide localized pseudorandomness, a random integer between &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$2^{32}-1\$&lt;/span&gt; will be passed to the bot, which will be seedable in the controller.&lt;/li&gt;&#xA;&lt;li&gt;Bots have perfect information of the current state of the board, which turn it is, and their own energy, but not the energy of other players.&lt;/li&gt;&#xA;&lt;li&gt;Bots may not remember anything between turns, but may initialize constants and utility functions at the beginning of each game.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The list of desired expansions is ordered. As soon as an invalid expansion target cell is encountered (whether by cost or lack of same-faction neighbors) in this list, the &lt;em&gt;rest of the list will be ignored&lt;/em&gt; and a warning will be logged.&lt;/p&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2019-09-20T17:09:58.357" LastActivityDate="2019-09-20T17:09:58.357" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="18086" PostTypeId="2" ParentId="2140" CreationDate="2019-09-14T16:42:23.877" Score="0" Body="&lt;h1&gt;Product of Shuffle Algebra&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Compute the shuffle product of two elements of a &lt;em&gt;Shuffle Algebra&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Definitions&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;An &lt;em&gt;Alphabet&lt;/em&gt; is a set of symbols. For this challenge it is &lt;span class=&quot;math-container&quot;&gt;\$A = \{a,b,c,\ldots,z\}\$&lt;/span&gt;. Let us use &lt;strong&gt;bold&lt;/strong&gt; letters for variables that denote elements of the alphabet.&lt;/li&gt;&#xA;&lt;li&gt;A &lt;em&gt;Word&lt;/em&gt; is a tuple of of arbitrary size where each entry is an element of our alhpabet. Let &lt;span class=&quot;math-container&quot;&gt;\$W\$&lt;/span&gt; be the set of words. Instead of writing a word as &lt;span class=&quot;math-container&quot;&gt;\$(p,p,c,g)\$&lt;/span&gt; we just omit the unnecessary symbols and write it as &lt;span class=&quot;math-container&quot;&gt;\$ppcg\$&lt;/span&gt;. We write the &lt;em&gt;empty word&lt;/em&gt; as &lt;span class=&quot;math-container&quot;&gt;\$\varepsilon = ()\$&lt;/span&gt;. Let us use lower case greek letters (&lt;span class=&quot;math-container&quot;&gt;\$\alpha, \beta, \gamma, \ldots\$&lt;/span&gt;) for variables that denote words.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;em&gt;shuffle algebra&lt;/em&gt; &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; (simplified for the purpose of this challenge) is a set of &lt;span class=&quot;math-container&quot;&gt;\$\mathbb Z\$&lt;/span&gt;-linear combinations of words. This means that each element consists of a few words which each have an integer associated with them (the &lt;em&gt;coefficients&lt;/em&gt;), which are then formally summed up. Here are some examples:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$\begin{array}[l] \\ a \\ b \\ 5\varepsilon = 5\\ a + (-5)b = a-5b \\ a + 2a = 3a \\xy - 3code +5golf +5se  \end{array}$$&lt;/span&gt;&#xA;Note that terms (that is a word with it's coefficient) where the coefficient is zero are considered as &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; and are not listed. Let us use uppercase letters form the greek alphabet (&lt;span class=&quot;math-container&quot;&gt;\$ \Gamma, \Delta, \Phi, \Psi, \ldots \$&lt;/span&gt;) letters for variables denoting an element of the shuffle algebra. &lt;/li&gt;&#xA;&lt;li&gt;We can add elements of the shuffle algebra just as you'd expect: The coefficients of equal words are just summed.  for instance let&#xA;&lt;span class=&quot;math-container&quot;&gt;$$\begin{align*} A &amp;amp;:= aq + 3bccd + 5cg \\B &#xA;&amp;amp;:= -3bccd + 6cg + 5qq .\end{align*}$$&lt;/span&gt;&#xA;Then &lt;span class=&quot;math-container&quot;&gt;$$\begin{align*} A+B &amp;amp;= aq + 0bbcd + 11cg + 5qq \\&amp;amp;= aq + 11cg + 5qq.\end{align*}$$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;We &lt;em&gt;multiply&lt;/em&gt; elements of the shuffle algebra using the &lt;em&gt;shuffle product&lt;/em&gt; denoted by the symbol &lt;span class=&quot;math-container&quot;&gt;\$⧢\$&lt;/span&gt;. We can recursively define it as follows:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A. First we define the shuffle product for words: if one of the words is empty (=&lt;span class=&quot;math-container&quot;&gt;\$\varepsilon\$&lt;/span&gt;) we have &lt;span class=&quot;math-container&quot;&gt;$$\alpha ⧢ \varepsilon = \varepsilon ⧢ \alpha = \alpha.$$&lt;/span&gt; If both are nonempty, we split them up into a one letter suffix and a leading word. So let us write the two words &lt;span class=&quot;math-container&quot;&gt;\$\alpha\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\beta\$&lt;/span&gt; as &lt;span class=&quot;math-container&quot;&gt;$$\alpha = \varphi \mathbf{a} \qquad \beta = \psi \mathbf{b}$$&lt;/span&gt; Then the product is defined via the recursion &lt;span class=&quot;math-container&quot;&gt;$$\alpha ⧢ \beta = (\varphi ⧢ \beta)\mathbf{a} +(\alpha ⧢ \psi)\mathbf{b}.$$&lt;/span&gt; This is where the &quot;shuffle&quot; in the name is coming from: The &lt;em&gt;shuffle product&lt;/em&gt; results in all possible &lt;a href=&quot;https://en.wikipedia.org/wiki/Riffle_shuffle_permutation&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;riffle shuffles&lt;/em&gt;&lt;/a&gt; of the two words. Consider the following examples: &lt;span class=&quot;math-container&quot;&gt;$$\begin{align*}ab ⧢ xy = abxy + axby + xaby + axyb + xayb + xyab\end{align*}$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;B. Two shuffle algebra elements &lt;span class=&quot;math-container&quot;&gt;\$\Phi = \sum_i f_i \varphi_i \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\Psi = \sum_j g_j \psi_j \$&lt;/span&gt; (where &lt;span class=&quot;math-container&quot;&gt;\$f_i, g_j \in \mathbb Z, \varphi_i, \psi_j \in W\$&lt;/span&gt;) are multiplied as follows:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$\Phi ⧢ \Psi = \sum_i \sum_j \underbrace{(f_i \cdot g_j)}_{\in \mathbb Z} \underbrace{(\varphi_i ⧢ \psi_j)}_{\in S}$$&lt;/span&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The inputs can each be taken as a string or as a list of pairs where each pair is represents one term (coefficient and word) of the element, or alternatively as two lists of the same length or other similar formats.&lt;/li&gt;&#xA;&lt;li&gt;The output format must match the input format.&lt;/li&gt;&#xA;&lt;li&gt;The output must be reduced: No two terms should share the same word.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##fVW5jtswEO35FQNhC9EHsHYprNy5SJNm0zmGlpJGNhEdjkhHWCD/7gxJnZayzS41781wjjf0VahfmOcP/XlD@IF1ASH430qNF6w38K5rWV44S4UWcMyxwFIT4QgnQz1DirX8Qwzwj785k6XSokwQvt@Lnt1csUYGAtYQkys6c6SIIiA2wGoC3OoqvSfagSVehEY6D3hnIs9YWeReppjJElMGSl5KG3hizeqqaEsCOYGGlN@vVfOcszI2n4o9c/LyvMHi@8mm4YFW3CBJhVkG6zX4MoMmDD0P9BVL8qCsFYK38gzacPO3C0G@DLqboI0RAkVI4O21DQBbb/DZJhzagLC2dt8CCWfsqTsuvp3UCxTiBv5PmzFsD@C3nGRDGXHiMaZpmNF4MkHgtED0rifDcU73kx0F2/GhWfTfGMl2/ppOndzTx941k8FfAiAMyQJt@sReWw45BCZd4lTUnrqR1IqO44IQoUalTUNtZwk038T6MgkzCzYBXR1ohRlPIBRDlSievHwRCKMJfJY6uRAAdIxERChr8@sNCxkKczVjtWiipqrTfjNoOG4vzUyG08kdz3MHYZQYwkksYISYy0/xAuaqAT8OYismA6oox0xbOduvWl6umvU6HlFCJzwRUIR5SqoNy3snG6nzihe92oRiMy7brlFLZo@W1fqScSLjPnQvh05Ko@XxN5zwVbLnS1mRYIk/CGiU1Hx5xgk8O7S6itz@nGd4NNmv85K/ndcR3Lx6Mcnilsvsk8rJqjzNd9NXOM@jcSvUMM0Z1Mm0u/Ht5WBG@bY60JWjFeouXGzBnLZc1hhuF8vsfqaMoumJeF0q0fXA8FSZEu/DMD7sGK1BLTlRYxa2bwg1fW4ol9ZTYhpZyui9mUD/z/BRCFkSnFYMbiRNTTnYn8KHaJ9P0qMnYo9vwB49eknjEWSB7W7jpUjQ4x8&quot; rel=&quot;nofollow noreferrer&quot;&gt;Haskell script for generating Examples&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2019-11-27T16:17:03.647" LastActivityDate="2019-11-27T16:17:03.647" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18087" PostTypeId="2" ParentId="2140" CreationDate="2019-09-14T20:37:17.690" Score="0" Body="&lt;p&gt;Tiling string &lt;/p&gt;&#xA;&#xA;&lt;p&gt;(inspired by the tiling pattern effect tipic of the texturing of landscapes.&#xA;This question I would like to ask is not exactly the same thing but close to it, or at least it was the idea)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a string S check if it has some repeating tile pattern and prove it providing at least one repeating pattern.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A substring tile pattern is a pattern of any form which repeats inside the string where one or more(alpha case insensitive) chars forms a fixed structure that can contain also others generic chars(all printable ascii table set)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;the output will be false,0,f or any meaningful negative expression if no tiling occours.&#xA;true,1,... plus at least one repeating tile pattern instead.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;for example :&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; they were obsessed by the sessions&#xA;             s#ss          s#ss&#xA; outputs : true s#ss&#xA;&#xA;&#xA;&#xA;look at that truck&#xA;      t$t  t$t&#xA;outputs: 1,t$t&#xA;&#xA;&#xA;- case insensitive. &#xA;- only letters matters as tile pattern.   &#xA;- if two letters are separated by space or every non letter char they still form a pattern.  &#xA;- overlaps doesnt make tiling effect.&#xA;- a pattern must contain half or more structure chars and must be len&amp;gt;1 to be considered, and must be repeated at least two times.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;example&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;Hello world!&quot;=&gt; false or 0 or f or no&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&quot;aa&quot;=&gt;false.&lt;br&gt;&#xA;   aaa=&gt;false. &#xA;   &quot;aaaa&quot;=&gt; true(aa)&lt;br&gt;&#xA;   &quot;aabbabab&quot;=&gt;true:ab,ba  or 1 ab ba. or yes[ba,ab]&#xA;    or...any reasonable format&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code-golf so shortest answer wins&lt;/p&gt;&#xA;" OwnerUserId="84844" LastEditorUserId="84844" LastEditDate="2019-09-14T20:42:52.647" LastActivityDate="2019-09-14T20:42:52.647" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18088" PostTypeId="2" ParentId="2140" CreationDate="2019-09-15T07:25:25.443" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/192900/inquiry-answerer&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-09-16T09:06:54.087" LastActivityDate="2019-09-16T09:06:54.087" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18089" PostTypeId="2" ParentId="2140" CreationDate="2019-09-15T09:51:14.513" Score="0" Body="&lt;h1&gt;Observability and controllability&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/linear-algebra&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;linear-algebra&amp;#39;&quot; rel=&quot;tag&quot;&gt;linear-algebra&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Background&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note: if you like, you can skip this part, and simply implement the suggested algorithm.&lt;/em&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;When looking at dynamic systems, there exist the notions of &lt;a href=&quot;https://en.wikipedia.org/wiki/Observability&quot; rel=&quot;nofollow noreferrer&quot;&gt;observability&lt;/a&gt; and &lt;a href=&quot;https://en.wikipedia.org/wiki/Controllability&quot; rel=&quot;nofollow noreferrer&quot;&gt;controllability&lt;/a&gt;. They are the answers to the questions&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Observability: can we know all the internal states of a system by looking only at the given outputs? &lt;/li&gt;&#xA;&lt;li&gt;Controllability: can we influence all the internal states of a system by changing only the inputs?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For the sake of this question, we will only look at LTI (linear time-invariant) systems, either in continuous or discrete time. During the rest of the question, I will only present the case of a state-space representation of the system and suggest using the observability- or controllability Gramian, but you may use any other algorithm to decide the controllability and observability of  the given LTI system.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You are given an LTI system, &lt;span class=&quot;math-container&quot;&gt;$$ \mathbf{\dot{x}}(t) = A\mathbf{x}(t) + B\mathbf{u}(t)\\\mathbf{y}(t)=C\mathbf{x}(t)$$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$C\$&lt;/span&gt; are matrices containing only integers. The dimensions of these matrices are &lt;span class=&quot;math-container&quot;&gt;\$\dim{A}=n \times n\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$\dim{B} = n \times p \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\dim{C} = q \times n\$&lt;/span&gt; with &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$q\$&lt;/span&gt; positive integers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A suggested input method would be to simply input these matrices, but you may also take input as function objects, string representations of differential equations, or transfer functions.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;You must output two thruthy/falsy values, one indicating whether the system is controllable, and one indicating whether the system is observable. Order does not matter but must always be the same. Alternatively, you may have four distinct outputs (e.g., the integers 0, 1, 2, 3) each corresponding to a possible combination of controllability/observability.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Suggested algorithm&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;To decide on observability and controllability, you can calculate the so-called observability Gramian (a square matrix), &lt;span class=&quot;math-container&quot;&gt;$$\begin{bmatrix}C &amp;amp; CA &amp;amp; CA^2 &amp;amp; ... &amp;amp; CA^{(n-1)}\end{bmatrix}^T$$&lt;/span&gt; and controllability Gramian &lt;span class=&quot;math-container&quot;&gt;$$\begin{bmatrix}B &amp;amp; AB &amp;amp; A^2B &amp;amp; ... &amp;amp; A^{(n-1)}B\end{bmatrix}$$&lt;/span&gt;&#xA;The system is observable iff the observability Gramian is invertible. The system is controllable iff the controllability Gramian is invertible. &lt;a href=&quot;https://en.wikipedia.org/wiki/Invertible_matrix#The_invertible_matrix_theorem&quot; rel=&quot;nofollow noreferrer&quot;&gt;There are many ways to check if a matrix is invertible&lt;/a&gt;; an obvious way would be to check if the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/147668/determinant-of-an-integer-matrix&quot;&gt;determinant&lt;/a&gt; equals zero.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Testcases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Coming soon, because I want to include worked examples.&lt;/p&gt;&#xA;" OwnerUserId="32352" LastEditorUserId="31625" LastEditDate="2019-09-15T18:55:38.730" LastActivityDate="2019-09-15T18:55:38.730" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18091" PostTypeId="2" ParentId="2140" CreationDate="2019-09-15T20:18:55.230" Score="0" Body="&lt;h1&gt;Reorder a matrix, twice&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/linear-algebra&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;linear-algebra&amp;#39;&quot; rel=&quot;tag&quot;&gt;linear-algebra&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are given a square &lt;span class=&quot;math-container&quot;&gt;\$n \times n\$&lt;/span&gt; matrix &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;, and a list (or vector) &lt;span class=&quot;math-container&quot;&gt;\$u\$&lt;/span&gt; of length &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; containing the numbers &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; through &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; (or &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; through &lt;span class=&quot;math-container&quot;&gt;\$n-1\$&lt;/span&gt;). Your task is to reorder the columns &lt;strong&gt;and&lt;/strong&gt; rows of the matrix &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; according to the order specified in &lt;span class=&quot;math-container&quot;&gt;\$u\$&lt;/span&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;That is, you will construct  a matrix &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; where the &lt;span class=&quot;math-container&quot;&gt;\$(i,j)\$&lt;/span&gt;-th element is the &lt;span class=&quot;math-container&quot;&gt;\$(u(i),u(j))\$&lt;/span&gt;-th element of &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;. You should also output the inverse of this action; that is, the (i,j)-th element of &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; will end up at position &lt;span class=&quot;math-container&quot;&gt;\$(u(i),u(j))\$&lt;/span&gt; in a new matrix &lt;span class=&quot;math-container&quot;&gt;\$C\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, given &lt;span class=&quot;math-container&quot;&gt;$$A = \begin{bmatrix} 11 &amp;amp;12&amp;amp; 13 \\ 21&amp;amp; 22&amp;amp; 23 \\ 31&amp;amp; 32&amp;amp; 33 \end{bmatrix},\quad u=\begin{bmatrix}3 &amp;amp; 1 &amp;amp; 2\end{bmatrix}$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;the output should be &lt;span class=&quot;math-container&quot;&gt;$$B = \begin{bmatrix}33 &amp;amp; 31 &amp;amp; 32 \\ 13 &amp;amp; 11 &amp;amp; 12 \\ 23 &amp;amp; 21 &amp;amp; 22 \end{bmatrix},\quad C= \begin{bmatrix}22 &amp;amp; 23 &amp;amp; 21 \\32 &amp;amp; 33 &amp;amp; 31 \\ 12 &amp;amp; 13 &amp;amp; 11 \end{bmatrix}$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may take input and output through any of the default I/O methods. You do not have to specify which matrix is &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; or &lt;span class=&quot;math-container&quot;&gt;\$C\$&lt;/span&gt;, as long as you output both. You may assume &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; only contains positive integers. You must support matrices up to at least size &lt;span class=&quot;math-container&quot;&gt;\$64 \times 64\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;===== Input =====&#xA;A =&#xA; 35     1     6    26    19    24&#xA;  3    32     7    21    23    25&#xA; 31     9     2    22    27    20&#xA;  8    28    33    17    10    15&#xA; 30     5    34    12    14    16&#xA;  4    36    29    13    18    11&#xA;u=&#xA;  3 5 6 1 4 2&#xA;&#xA;==== Output =====&#xA;B = &#xA;  2    27    20    31    22     9&#xA; 34    14    16    30    12     5&#xA; 29    18    11     4    13    36&#xA;  6    19    24    35    26     1&#xA; 33    10    15     8    17    28&#xA;  7    23    25     3    21    32&#xA;C = &#xA; 17    15     8    10    28    33&#xA; 13    11     4    18    36    29&#xA; 26    24    35    19     1     6&#xA; 12    16    30    14     5    34&#xA; 21    25     3    23    32     7&#xA; 22    20    31    27     9     2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="32352" LastEditorUserId="32352" LastEditDate="2019-09-20T18:29:14.163" LastActivityDate="2019-09-20T18:29:14.163" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18092" PostTypeId="2" ParentId="2140" CreationDate="2019-09-16T19:14:19.500" Score="3" Body="&lt;h2&gt;Battleship KotH&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a pretty rough idea to start but I figured I would drop it in the sandbox so that people can start to think about it and I will remember to do it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The idea here is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; that combines the game, &lt;a href=&quot;https://en.wikipedia.org/wiki/Battleship_(game)&quot; rel=&quot;nofollow noreferrer&quot;&gt;battleship&lt;/a&gt; with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/radiation-hardening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; rel=&quot;tag&quot;&gt;radiation-hardening&lt;/a&gt;.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The rough idea is that two enemies would face off, each turn irradiating a location in their opponents source code.  Then the opponents source code would be recompiled and then try and attack back.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some additional thoughts I've had:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;We will likely want to limit the size of the board to a specific rectangular size&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I would like there to be a feedback from shooting your opponent (in the game battleship this is hit/miss) so that you are doing more than just firing randomly.  Perhaps programs might irradiate a single bit (flipping its value) and get back its value before it was irradiated.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Language choice is a bit tough since I would like something multipurpose and flexible but I don't want to have to deal with the security issues that are involved in compiling and running a fully featured programming language.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2019-09-16T19:14:19.500" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18093" PostTypeId="1" CreationDate="2019-09-17T03:42:33.337" Score="3" ViewCount="82" Body="&lt;p&gt;Similar to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2214/whats-a-string&quot;&gt;What's a string?&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a challenge says that the input will be &amp;ldquo;a number&amp;rdquo;, what data types are acceptable?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Obviously, types like &lt;code&gt;int&lt;/code&gt; and &lt;code&gt;float&lt;/code&gt; are numeric.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What about strings?  Command-line arguments and stuff read from standard input will naturally be string or sequence-of-char objects, so we'll have to accept string input in those cases.  But do we accept strings as &lt;em&gt;function&lt;/em&gt; arguments, if the language has dedicated data types for representing numbers?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What about lists of digits, like representing 12345 as &lt;code&gt;[1, 2, 3, 4, 5]&lt;/code&gt; (list of digits as numbers) or &lt;code&gt;['1', '2', '3', '4', '5']&lt;/code&gt; (list of digits as char/string)?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt; No, I don't think this is a duplicate of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;Default for Code Golf: Input/Output methods&lt;/a&gt;.  That question's answers focus on &lt;em&gt;where&lt;/em&gt; the input can come from: From command-line arguments, from a file, from a GUI input box, etc.  Whereas my question is about &lt;em&gt;what type&lt;/em&gt; of input should be acceptable.&lt;/p&gt;&#xA;" OwnerUserId="584" LastEditorUserId="584" LastEditDate="2019-09-18T02:26:54.547" LastActivityDate="2019-09-18T02:26:54.547" Title="What's a number?" Tags="|discussion|answers|specification|" AnswerCount="0" CommentCount="5" ClosedDate="2019-09-19T04:29:17.563" ContentLicense="CC BY-SA 4.0" />
  <row Id="18094" PostTypeId="2" ParentId="2140" CreationDate="2019-09-17T11:45:16.097" Score="2" Body="&lt;h1&gt;The Celestial Bureaucracy &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/193234/the-celestial-bureacracy-koth&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="89287" LastEditorUserId="89287" LastEditDate="2019-09-20T13:29:09.787" LastActivityDate="2019-09-20T13:29:09.787" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18096" PostTypeId="2" ParentId="2447" CreationDate="2019-09-17T20:34:54.950" Score="13" Body="&lt;h1&gt;Programs may take input as arguments to command line flags&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If a language has a command line flag in the form &lt;code&gt;--flag=arg&lt;/code&gt;, input may be taken as the argument to that flag. For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;./language -f --option=2 &amp;lt;prog&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Can be run for the input &lt;code&gt;2&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2019-09-17T20:34:54.950" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18097" PostTypeId="2" ParentId="2447" CreationDate="2019-09-18T03:23:05.720" Score="10" Body="&lt;h1&gt;Numerical input and output can be given as a string of digits and vice-versa&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As long as the input/output format is consistent, you may take a numerical output such as &lt;code&gt;f(123)&lt;/code&gt; as a string &lt;code&gt;f(&quot;123&quot;)&lt;/code&gt; and vice-versa. This will also open up other string methods, such as taking a number as a list of digits as per &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2216/76162&quot;&gt;this consensus&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that if different behaviours are expected for numbers with leading zeroes, then you will have to take input as a string instead, since strings with leading zeroes will be mapped to the same number.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may not add leading zeroes if you are using string input instead of a number.&lt;/p&gt;&#xA;" OwnerUserId="76162" LastEditorUserId="76162" LastEditDate="2019-09-18T13:54:06.583" LastActivityDate="2019-09-18T13:54:06.583" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18098" PostTypeId="2" ParentId="2140" CreationDate="2019-09-18T08:54:25.953" Score="0" Body="&lt;h2&gt;Smallest put pixel function&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Task: write in any language which can generate images e.g. JavaScript, the smallest &quot;put pixel&quot; function. You can initialise screen inside that function or in separate code. The put-pixel function should consume 6 arguments: &lt;code&gt;x,y,r,g,b,a&lt;/code&gt; where &lt;code&gt;x,y&lt;/code&gt; pixel coordinates and &lt;code&gt;r,g,b,a&lt;/code&gt; are color values (&lt;code&gt;a&lt;/code&gt; is for alpha - transparency - you need blend new color with old color). Provide also example which use that function a draw something.&lt;/p&gt;&#xA;" OwnerUserId="88163" LastActivityDate="2019-09-18T08:54:25.953" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18099" PostTypeId="2" ParentId="2140" CreationDate="2019-09-18T13:19:10.690" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/193376/calculate-the-ultraradical&quot;&gt;Calculate the Ultraradical&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="71546" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-09-23T01:47:19.903" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18100" PostTypeId="2" ParentId="2140" CreationDate="2019-09-18T18:10:46.233" Score="0" Body="&lt;h1&gt;Shuffling Sequence&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider an operation &lt;span class=&quot;math-container&quot;&gt;\$f_n\$&lt;/span&gt; that takes a length-&lt;span class=&quot;math-container&quot;&gt;\$2n\$&lt;/span&gt; list and performs a perfect shuffle on it, reversing the second half. For example, &lt;span class=&quot;math-container&quot;&gt;\$f_4 [abcdABCD] = [aDbCcBdA]\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Under composition, &lt;span class=&quot;math-container&quot;&gt;\$f_n\$&lt;/span&gt; generates a cyclic group. That is, there exists some minimal positive integer &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$(f_n)^m\$&lt;/span&gt; (which means &lt;span class=&quot;math-container&quot;&gt;\$f_n\$&lt;/span&gt; composed &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt; times with itself) is an identical map, leaving its argument alone. Here's an example for ya:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$f_2 [abAB] = [aBbA]$$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$f_2 [aBbA] = [aABb]$$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$f_2 [aABb] = [abAB]$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$f_2(f_2(f_2 [abAB])) = (f_2)^3 [abAB] = [abAB]$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since &lt;span class=&quot;math-container&quot;&gt;\$(f_2)^3\$&lt;/span&gt; is the identity, we say that &lt;span class=&quot;math-container&quot;&gt;\$f_2\$&lt;/span&gt; has order 3.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to determine the order of &lt;span class=&quot;math-container&quot;&gt;\$f_n\$&lt;/span&gt;. You've got a few choices for how to do this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take as input &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and provide as output the order of &lt;span class=&quot;math-container&quot;&gt;\$f_n\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Take as input &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and provide as output the order of each &lt;span class=&quot;math-container&quot;&gt;\$f_k\$&lt;/span&gt; for &lt;span class=&quot;math-container&quot;&gt;\$k &amp;lt; n\$&lt;/span&gt; or for &lt;span class=&quot;math-container&quot;&gt;\$k \le n\$&lt;/span&gt; (your choice)&lt;/li&gt;&#xA;&lt;li&gt;Output these orders indefinitely, beginning with that of &lt;span class=&quot;math-container&quot;&gt;\$f_0\$&lt;/span&gt; or &lt;span class=&quot;math-container&quot;&gt;\$f_1\$&lt;/span&gt; (your choice)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For reference, the first 77 terms (beginning from &lt;span class=&quot;math-container&quot;&gt;\$n = 1\$&lt;/span&gt;; you may optionally return &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; for &lt;span class=&quot;math-container&quot;&gt;\$n = 0\$&lt;/span&gt;) are provided below. This is &lt;a href=&quot;https://oeis.org/A294673&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS A294673&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1,3,5,4,9,11,9,5,12,12,7,23,8,20,29,6,33,35,20,39,41,28,12,36,15,51,53,36,44,24,20,7,65,36,69,60,42,15,20,52,81,83,9,60,89,60,40,95,12,99,84,66,105,28,18,37,113,30,92,119,81,36,25,8,36,131,22,135,20,30,47,60,48,116,132,100,51,155&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/73884&quot;&gt;IO&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061/73884&quot;&gt;loophole&lt;/a&gt; rules apply. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program (in bytes) in each language wins! Happy golfing!&lt;/p&gt;&#xA;" OwnerUserId="73884" LastEditorUserId="73884" LastEditDate="2019-09-19T18:55:01.270" LastActivityDate="2019-09-19T18:55:01.270" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18101" PostTypeId="1" CreationDate="2019-09-18T19:20:55.970" Score="0" ViewCount="143" Body="&lt;p&gt;I found question where author ask about reproduce logo (reproduction do not need to be identical). In one of answer we see solution with low resolution logo picture made by hand&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/y084Q.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/y084Q.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This solution indeed is very small 202 bytes - but the question is: does this approach (create low resolution picture of desired output) should be allowed for &lt;code&gt;graphical-output&lt;/code&gt; questions? &lt;/p&gt;&#xA;" OwnerUserId="88163" LastEditorUserId="46076" LastEditDate="2019-10-18T03:53:07.120" LastActivityDate="2019-10-18T03:53:07.120" Title="Graphical-output - trivial solutions" Tags="|discussion|rules|graphical-output|" AnswerCount="1" CommentCount="4" ClosedDate="2019-09-21T15:20:21.193" ContentLicense="CC BY-SA 4.0" />
  <row Id="18102" PostTypeId="2" ParentId="18101" CreationDate="2019-09-18T23:02:12.167" Score="6" Body="&lt;p&gt;To put the comments into an full answer:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is an issue with the question not being clear as to what is a valid answer (and the question seems to be closed for this reason).  Graphical output questions should clearly state what they require of the output image to be clear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once this is done by the question it should be easy to determine what is a valid answer and no need to discuss it on meta.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2019-09-18T23:02:12.167" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18103" PostTypeId="2" ParentId="2140" CreationDate="2019-09-18T23:29:39.527" Score="2" Body="&lt;h2&gt;Maximize the Hello, world's in code permutations&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this task you should output this exact string: &lt;code&gt;hi orb&lt;/code&gt; (because Earth is a sphere). However, here is the catch: you must output as many &lt;code&gt;hi orb&lt;/code&gt;'s as possible in all of your code permutations. Identical permutations do not count(e.g. &lt;code&gt;aa&lt;/code&gt;'s permutations count as one permutation)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Say you have a program &lt;code&gt;abc&lt;/code&gt; that outputs this string. You should try your best to make &lt;code&gt;acb&lt;/code&gt;, &lt;code&gt;bac&lt;/code&gt;, &lt;code&gt;bca&lt;/code&gt;, &lt;code&gt;cab&lt;/code&gt;, and &lt;code&gt;cba&lt;/code&gt; (i.e. the permutations of &lt;code&gt;abc&lt;/code&gt;) also output this exact string. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No standard loopholes, please.&lt;/li&gt;&#xA;&lt;li&gt;Input/output must obey our standard methods.&lt;/li&gt;&#xA;&lt;li&gt;Your score is simply the factorial of the length of your code. &lt;strong&gt;You shall also present the following score:&lt;/strong&gt; The score is counted in the negative of the length of your source code &lt;strong&gt;divided by&lt;/strong&gt; the number of permutations that your code generates; (expression: &lt;code&gt;-(source length/permutations)&lt;/code&gt;.) Of course you want to keep your score as low as possible.&lt;/li&gt;&#xA;&lt;li&gt;All comment characters in your language are disallowed, in order to avoid collapsing into a radiation-hardening challenge.&lt;/li&gt;&#xA;&lt;li&gt;If you are using the filename as data, the filename must also count in the permutations.&lt;/li&gt;&#xA;&lt;li&gt;The source code length should be &amp;lt;1000. (Don't ask why, it's just an attempt of avoiding abusing the source code length.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Feedback&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is it detailed enough?&lt;/li&gt;&#xA;&lt;li&gt;Is the input/output rules clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Do I need any more information? &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I don't think this is a duplicate because nobody has asked a question tagged with both permutation and hello-world. However, I worry that this challenge will collapse into a radiation-hardening challenge if you comment out a single character and then make sure that this will produce the same result, therefore making it a flavored version of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/11383/fault-tolerant-hello-world-a-k-a-the-interview&quot;&gt;this question&lt;/a&gt; and close to a duplicate.&#xA;&lt;hr/&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hello-world&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hello-world&amp;#39;&quot; rel=&quot;tag&quot;&gt;hello-world&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-09-20T12:56:55.087" LastActivityDate="2019-09-20T12:56:55.087" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="18104" PostTypeId="1" CreationDate="2019-09-19T07:09:01.463" Score="11" ViewCount="297" Body="&lt;p&gt;I recently posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/193093/codegolf-the-hex&quot;&gt;this challenge&lt;/a&gt; on codegolf. The idea was simple : reproduce an hexagonal logo, graphically or in ASCII art.&#xA;At first i thought it would be good enouth to be interessing, but the lack of acceptability criterias kind of engraved the challenge. I tried to add some explanations, but it ended up on hold as too broad.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am here now, with a challenge I don't find interessing at all now, put on hold, without any clue in what to do with this. Should I try to modify the challenge and mess up with the answers ? Should I let it go ? Should I simply delete the question ?&lt;/p&gt;&#xA;" OwnerUserId="41833" LastEditorUserId="46076" LastEditDate="2019-09-19T19:34:45.613" LastActivityDate="2019-10-22T11:31:36.373" Title="What should I do with this question?" Tags="|discussion|specific-question|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18106" PostTypeId="2" ParentId="18104" CreationDate="2019-09-19T16:19:10.037" Score="11" Body="&lt;p&gt;Personally I think your challenge's idea is good, it has already caused a creative answer in &lt;a href=&quot;https://codegolf.stackexchange.com/a/193126/81663&quot;&gt;Logo&lt;/a&gt; but lacks more specific details.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think this comment with 7 likes under your post should give a clue:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;code&gt;recognisable&lt;/code&gt; is very subjective, I'd suggest giving a reference ASCII version that has to be matched.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I would suggest to clarify details as much as possible, specially about the graphical outputs and what is exactly accepted and what isn't to avoid doubts and more questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can also look at other questions in similar tags (for example &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;) with high votes to get ideas.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Normally if you edit your original question and address all the concerns and questions posted in the comments, people will start vote to re-open the question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And of course use &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt; for future question, so other experienced users can mention any issues and discuss the idea before the question goes live.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This question on meta is also related to your challenge: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/18101/81663&quot;&gt;Graphical-output - trivial solutions&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="81663" LastEditorUserId="81663" LastEditDate="2019-10-22T11:31:36.373" LastActivityDate="2019-10-22T11:31:36.373" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18107" PostTypeId="2" ParentId="2140" CreationDate="2019-09-19T19:12:13.823" Score="6" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/193432/64722&quot;&gt;Question link&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="64722" LastEditorUserId="56656" LastEditDate="2019-09-26T03:31:59.063" LastActivityDate="2019-09-26T03:31:59.063" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="18108" PostTypeId="2" ParentId="2140" CreationDate="2019-09-20T13:04:05.383" Score="0" Body="&lt;h1&gt;Golf Golf!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is my first challenge, so please be gentle! The challenge is to write a program that will output the correct score for a layout in the card game &quot;Golf.&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The card game Golf has many variations. The house rules I use follow the &lt;a href=&quot;https://www.pagat.com/draw/golf.html#six&quot; rel=&quot;nofollow noreferrer&quot;&gt;standard rules for Six-Card Golf&lt;/a&gt; given by Pagat, with one slight difference.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each player has a 2x3 layout of cards. By the end of each round all cards are turned face up and scored as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each ace counts 1 point.&lt;/li&gt;&#xA;&lt;li&gt;Each two counts minus two points.&lt;/li&gt;&#xA;&lt;li&gt;Each numeral card from 3 to 10 scores face value.&lt;/li&gt;&#xA;&lt;li&gt;Each Jack or Queen scores 10 points.&lt;/li&gt;&#xA;&lt;li&gt;Each King scores zero points.&lt;/li&gt;&#xA;&lt;li&gt;A pair of equal cards in the same column scores zero points for the column (even if the equal cards are twos).&lt;/li&gt;&#xA;&lt;li&gt;Three equal cards in the same row scores zero points for the row (even if the equal cards are twos).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input can be a string or array of any kind.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An integer representing the score of the Golf hand.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;These use the notation &lt;code&gt;A23456789TJQK&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Layout&#xA;AK3&#xA;J23&#xA;&#xA;Score&#xA;7&#xA;-----------------------    &#xA;Layout&#xA;25Q&#xA;25J&#xA;&#xA;Score&#xA;20&#xA;-----------------------        &#xA;Layout&#xA;T82&#xA;T8A&#xA;&#xA;Score&#xA;-1&#xA;-----------------------        &#xA;Layout&#xA;QQQ&#xA;234&#xA;&#xA;Score&#xA;5&#xA;-----------------------        &#xA;Layout&#xA;TJQ&#xA;QTJ&#xA;&#xA;Score&#xA;60&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is code golf, so the shortest answer in bytes wins!&lt;/p&gt;&#xA;" OwnerUserId="86701" LastActivityDate="2019-09-20T13:04:05.383" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18109" PostTypeId="2" ParentId="2140" CreationDate="2019-09-20T15:18:52.527" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/193640&quot;&gt;Injection from two strings to one string&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="86422" LastEditorUserId="86422" LastEditDate="2019-09-27T16:43:19.230" LastActivityDate="2019-09-27T16:43:19.230" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18110" PostTypeId="2" ParentId="2140" CreationDate="2019-09-20T17:28:55.083" Score="2" Body="&lt;p&gt;I came across this little web game &lt;a href=&quot;http://flashbynight.com/drench/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Drench&lt;/a&gt;&#xA;Its a fairly mindless game , I wrote a small JS snippet to play this game for me in the background of my browser, it cycles through and clicks on the 6 possible moves&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;let ind =0;&#xA;let games =0;&#xA;let wins =0;&#xA;let lastMoves = &quot;&quot;;&#xA;setInterval(function(){&#xA;  if (jQuery('.moveNum').text() != lastMoves) {&#xA;    lastMoves = jQuery('.moveNum').text();&#xA;    ind++;&#xA;    ind = ind%6;&#xA;    jQuery('.pbutton:nth('+ind+')').click();&#xA;  } else {&#xA;    games++;&#xA;    if ((jQuery('.moveNum').text()*1)) {wins++;}&#xA;    jQuery('#myCanvas').click();&#xA;  }&#xA;},200);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This Strategy wins about 3% of the time&#xA;My question is, is there a more optimal strategy that will allow me to win a greater % of the time (without looking at the board)?&lt;/p&gt;&#xA;" OwnerUserId="67516" LastEditorUserId="67516" LastEditDate="2019-10-16T13:25:06.680" LastActivityDate="2019-10-16T13:25:06.680" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18111" PostTypeId="2" ParentId="2140" CreationDate="2019-09-20T18:17:12.990" Score="0" Body="&lt;h1&gt;No, you don't need deep learning: AlphaGo edition&lt;/h1&gt;&#xA;&lt;p&gt;To counter the industry fad of tackling the most trivial problems with deep learning, I propose that a proof of concept be created to demonstrate that simple database queries are in fact often sufficient. To wit, I propose to demonstrate that a database query can in fact be used to do what AlphaGo does and even do it better.&lt;/p&gt;&#xA;&lt;p&gt;The proof of concept will consist of two parts:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A Script to create a script to create a (...) query that, given the state of a game of &lt;a href=&quot;https://en.wikipedia.org/wiki/Go_(game)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Go&lt;/a&gt;, will retrieve a move that will result in eventual victory.&lt;/li&gt;&#xA;&lt;li&gt;A Script to create a script to create a (...) script to initialize the database.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge so the least total bytes wins. Some rules for the challenge:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You may use whatever database lets you golf best&lt;/li&gt;&#xA;&lt;li&gt;There is no limit for how many recursions of running the script generated by the script are required&#xA;&lt;ol&gt;&#xA;&lt;li&gt;This includes directly submitting the query and (if the universe's hard drive capacity somehow permits) the init data&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The final init script may also be an executable-ish that connects to the database backend to populate it&lt;/li&gt;&#xA;&lt;li&gt;You may either pass the game state as an argument to the query or store the state in the database (storing the state in the DB doesn't count toward your score)&lt;/li&gt;&#xA;&lt;li&gt;Handicap games don't need to be accounted for.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The rules of Go are, paraphrased:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The game is played by placing black and white stones on a 19x19 grid&lt;/li&gt;&#xA;&lt;li&gt;The aim of the game is to score points by surrounding open space with your stones (The edges of the board count as surrounding)&lt;/li&gt;&#xA;&lt;li&gt;Black plays first&lt;/li&gt;&#xA;&lt;li&gt;A stone is part of a group if it is orthogonally connected to a member of the group&lt;/li&gt;&#xA;&lt;li&gt;The empty spaces orthogonally adjacent to a group are called liberties&lt;/li&gt;&#xA;&lt;li&gt;A group without liberties is considered captured and is removed from the board and added to the capturing player's score&lt;/li&gt;&#xA;&lt;li&gt;A group that can not escape capture is considered dead, and remains on the board but will count as captured for scoring purposes&lt;/li&gt;&#xA;&lt;li&gt;Suiciding your own group by filling its last liberty is not allowed&lt;/li&gt;&#xA;&lt;li&gt;Ko rule: If a single stone is captured so that capturing the capturing stone will return the board to the immediately previous state, such second capture is illegal on the turn after the first capture.&lt;/li&gt;&#xA;&lt;li&gt;The game ends when both players pass, indicating that they can't improve their score by playing another stone.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="64650" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-09-21T07:39:34.157" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18113" PostTypeId="2" ParentId="2140" CreationDate="2019-09-22T13:41:24.910" Score="2" Body="&lt;h1&gt;Turing-complete regex subset&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regex&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regex&amp;#39;&quot; rel=&quot;tag&quot;&gt;regex&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/55934&quot;&gt;It's widely known&lt;/a&gt; that a programming language is one iff it's capable of addition of natural numbers and primality testing. In practice, this criterion has a high accuracy for distinguishing Turing-complete languages too.&lt;sup&gt;[&lt;a href=&quot;https://xkcd.com/285/&quot; rel=&quot;nofollow noreferrer&quot;&gt;citation needed&lt;/a&gt;]&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Cops' challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Choose any of the programming languages available on &lt;a href=&quot;https://tio.run/&quot; rel=&quot;nofollow noreferrer&quot;&gt;tio.run&lt;/a&gt;. Write a regex that will define a subset of this programming language. The subset must still match the definition, though ideally this should be far from obvious.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write two programs in this language that match this regex:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Take two natural numbers, &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt;, as input. Output &lt;code&gt;a + b&lt;/code&gt;. The program must work for &lt;code&gt;0 &amp;leq; a + b &amp;lt; 2&lt;sup&gt;15&lt;/sup&gt;&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Take a natural number &lt;code&gt;n&lt;/code&gt; as input. Output whether the number is prime. The program must work for &lt;code&gt;0 &amp;leq; n &amp;lt; 2&lt;sup&gt;15&lt;/sup&gt;&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The behavior outside of this range is undefined. This means that you can output the correct answer, a cute cat ASCII art, an error, an invalid answer, invoke nasal demons, or anything else you can, or cannot, imagine.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regex come in multiple flavors. Choose one. You can choose any flavor available on &lt;a href=&quot;https://regex101.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;regex101&lt;/a&gt;, or &lt;a href=&quot;https://tio.run/#retina1&quot; rel=&quot;nofollow noreferrer&quot;&gt;Retina&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In your answer, include:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the programming language and regex flavor you chose&lt;/li&gt;&#xA;&lt;li&gt;the regex delimiter and flags you chose (for example: &lt;code&gt;//gm&lt;/code&gt;; does not apply to Retina)&lt;/li&gt;&#xA;&lt;li&gt;the regex you wrote and its byte count&lt;/li&gt;&#xA;&lt;li&gt;the byte counts of your two programs&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Keep the programs hidden.&lt;/strong&gt; If 7 days pass without anyone cracking your answer, you may reveal your two programs by editing them into your answer. This will make your answer safe. Your score then becomes &lt;strong&gt;your regex's bytecount&lt;/strong&gt; (lower is better). Before your answer is safe, your score is positive infinity.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Robbers' challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write two programs that prove the subset to be a valid programming language. The rules that apply here are the same that apply to the cops. Additionally, your programs must not exceed the cops' in length.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When you crack an answer, post your programs to the &lt;a href=&quot;https://doesnotexistyet.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;robbers' thread&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Meta questions&lt;/h1&gt;&#xA;  &#xA;  &lt;p&gt;The above will be posted as the cops' thread, with the robbers' thread simply linking to it.&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Any improvements to challenge structure? I've never done this before.&lt;/li&gt;&#xA;  &lt;li&gt;Do you see any loopholes that need addressing?&lt;/li&gt;&#xA;  &lt;li&gt;Are the allowed regex flavors reasonable?&lt;/li&gt;&#xA;  &lt;li&gt;Duplicates?&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="55934" LastEditorUserId="55934" LastEditDate="2019-09-22T16:02:31.553" LastActivityDate="2019-09-22T16:02:31.553" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="18114" PostTypeId="2" ParentId="2140" CreationDate="2019-09-23T09:20:59.430" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/193467/duck-duck-gone&quot;&gt;Posted. I prefer to retain the content for potential issues.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Duck, duck, gone!&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here is the (quite childish) Five little ducks song(it is not long):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Five little ducks went out one day,&#xA;over the hills and up away.&#xA;Mother Duck said, &quot;Quack Quack Quack Quack&quot;,&#xA;but only four little ducks came back.&#xA;&#xA;Four little ducks went out one day,&#xA;over the hills and up away.&#xA;Mother Duck said, &quot;Quack Quack Quack Quack&quot;,&#xA;but only three little ducks came back.&#xA;&#xA;Three little ducks went out one day,&#xA;over the hills and up away.&#xA;Mother Duck said, &quot;Quack Quack Quack Quack&quot;,&#xA;but only two little ducks came back.&#xA;&#xA;Two little ducks went out one day,&#xA;over the hills and up away.&#xA;Mother Duck said, &quot;Quack Quack Quack Quack&quot;,&#xA;but only one little duck came back.&#xA;&#xA;One little duck went out one day,&#xA;over the hills and up away.&#xA;Mother Duck said, &quot;Quack Quack Quack Quack&quot;,&#xA;but none of the little ducks came back.&#xA;&#xA;Mother duck herself went out one day,&#xA;over the hills and up away.&#xA;Mother Duck said, &quot;Quack Quack Quack Quack&quot;,&#xA;and all of the little ducks came back.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your task is not to output this song. You should take a verse and output the next verse (the next verse of the last verse is the first verse).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No standard loopholes, please.&lt;/li&gt;&#xA;&lt;li&gt;Input/output will be taken via our standard input/output methods.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;em&gt;exact&lt;/em&gt; verse must be outputted, and there should be no differences when compared to the song lyrics. The input will not be different when it is compared to the song lyrics too.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Mother duck herself went out one day,&#xA;over the hills and up away.&#xA;Mother Duck said, &quot;Quack Quack Quack Quack&quot;,&#xA;and all of the little ducks came back.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Expected:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Five little ducks went out one day,&#xA;over the hills and up away.&#xA;Mother Duck said, &quot;Quack Quack Quack Quack&quot;,&#xA;but only four little ducks came back.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Three little ducks went out one day,&#xA;over the hills and up away.&#xA;Mother Duck said, &quot;Quack Quack Quack Quack&quot;,&#xA;but only two little ducks came back.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Expected:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Two little ducks went out one day,&#xA;over the hills and up away.&#xA;Mother Duck said, &quot;Quack Quack Quack Quack&quot;,&#xA;but only one little duck came back.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is it detailed enough?&lt;/li&gt;&#xA;&lt;li&gt;Is the input/output rules clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Do I need any more information?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;hr/&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-09-26T23:06:25.270" LastActivityDate="2019-09-26T23:06:25.270" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18115" PostTypeId="2" ParentId="2140" CreationDate="2019-09-23T16:17:09.820" Score="-1" Body="&lt;p&gt;&lt;strong&gt;Title: Transposition&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;** The challenge **&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a set of notes (as a string, or a list, or any other reasonable input - but as letters and accidentals, not a numerical equivalent), the key those notes are in, and a target key; output the notes transposed into the new key. Some of the notes may not exist in the scale for the given key (e.g Eb in the key of C).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;** Inputs **&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The complete set of input notes for this challenge will use the English naming convention, and so are as follows:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Ab,G##,A,A#,Bb,B,C,C#,Db,C##,D,D#,Eb,E,F,F#,Gb,F##,G,G#&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;where &quot;b&quot; represents a flattened note (down one semitone per &lt;code&gt;b&lt;/code&gt;), and # represents a sharpened note (up one semitone per &lt;code&gt;#&lt;/code&gt;). Theoretically all notes can be extended further with more #s and bs; but for the purposes of this program that won't happen beyond what is already given.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;** What is transposing? **&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Transposing a song involves &quot;moving&quot; the song into a different key, by finding the equivalent note of the scale in that key.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We will assume Major scales for the purposes of this challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;** Scales **&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The scales for this challenge are officially as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;C&lt;/code&gt;: C, D, E, F, G, A, B, C&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;C#&lt;/code&gt;: C#, D#, E#, F#, G#, A#, B#, C# &lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Db&lt;/code&gt;: Db, Eb, F, Gb, Ab, Bb, C, Db&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;D&lt;/code&gt;: D, E, F#, G, A, B, C#, D&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;D#&lt;/code&gt;: D#, E#, F##, G#, A#, B#, C##, D#&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Eb&lt;/code&gt;:Eb, F, G, Ab, Bb, C, D, Eb&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;E&lt;/code&gt;: E, F#, G#, A, B, C#, D#, E&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;F&lt;/code&gt;: F, G, A, Bb, C, D, E, F&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;F#&lt;/code&gt;: F#, G#, A#, B, C#, D#, E#, F# &lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Gb&lt;/code&gt;: Gb, Ab, Bb, Cb, Db, Eb, F, Gb&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;G&lt;/code&gt;: G, A, B, C, D, E, F#, G&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;G#&lt;/code&gt;: G#, A#, B#, C#, D#, E#, F##, G#&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Ab&lt;/code&gt;: Ab, Bb, C, Db, Eb, F, G, Ab&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;A&lt;/code&gt;: A, B, C#, D, E, F#, G#, A&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;A#&lt;/code&gt;: A#, B#, C##, D#, E#, F##, G##, A#&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Bb&lt;/code&gt;: Bb, C, D, Eb, F, G, A, Bb&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;B&lt;/code&gt;: B, C#, D#, E, F#, G#, A#, B&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For simplicity, we can assume that both notes in the pairs A#/Bb, C#/Db, D#/Eb, F#/Gb, G#/Ab, C##/D, F##/G, G##/A are enharmonically equivalent (i.e. interchangeable - &lt;a href=&quot;https://music.stackexchange.com/questions/11815/what-is-the-difference-between-sharp-note-flat-note&quot;&gt;although they're not, always&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For scales with double-sharps, I will accept the enharmonic equivalents as an alternative implementation:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;D#&lt;/code&gt;: D#, E#, &lt;code&gt;G&lt;/code&gt;, G#, A#, B#, &lt;code&gt;D&lt;/code&gt;, D#&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;G#&lt;/code&gt;: G#, A#, B#, C#, D#, E#, &lt;code&gt;G&lt;/code&gt;, G#&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;A#&lt;/code&gt;: A#, B#, &lt;code&gt;D&lt;/code&gt;, D#, E#, &lt;code&gt;G&lt;/code&gt;, &lt;code&gt;A&lt;/code&gt;, A#&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;but for all other notes in the scale, they must match. If the note isn't in the scale, either can be used.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;e.g. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;F&lt;/code&gt; in the key of &lt;code&gt;C&lt;/code&gt; should transpose to &lt;code&gt;F#&lt;/code&gt; in the key of &lt;code&gt;C#&lt;/code&gt;, and not to &lt;code&gt;Gb&lt;/code&gt;, because that option in the pair is explicitly in the scale&lt;/li&gt;&#xA;&lt;li&gt;but &lt;code&gt;D&lt;/code&gt; in the key of &lt;code&gt;C#&lt;/code&gt; could transpose to either &lt;code&gt;C#&lt;/code&gt; or &lt;code&gt;Db&lt;/code&gt; in the key of &lt;code&gt;C&lt;/code&gt;, because it's an incidental anyway and so there's no easy rule to determine which it should be.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;BONUS feel-good points&lt;/em&gt; *: normally it's &lt;code&gt;#&lt;/code&gt; if you're going up, and a &lt;code&gt;b&lt;/code&gt; if you're going down - feel free to implement this if you want!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For double-sharps (e.g &lt;code&gt;F##&lt;/code&gt;) in all cases, It's OK if the program &quot;resolves&quot; these (e.g.to &lt;code&gt;G&lt;/code&gt; in that case) even if they are in the scale; but again, some &lt;em&gt;BONUS feel-good points&lt;/em&gt; * if you keep the double-sharps in.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;CDEFGABC&lt;/code&gt; in &lt;code&gt;C&lt;/code&gt; to &lt;code&gt;A&lt;/code&gt; -&gt; &lt;code&gt;ABC#DEF#G#A&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;C#&lt;/code&gt; in &lt;code&gt;C&lt;/code&gt; to &lt;code&gt;A&lt;/code&gt; -&gt; &lt;code&gt;A#&lt;/code&gt; OR &lt;code&gt;Bb&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ABCDEFGBAF#Bb&lt;/code&gt; in &lt;code&gt;Bb&lt;/code&gt; to &lt;code&gt;Gb&lt;/code&gt; -&gt; &lt;code&gt;FGAbBbCDbEbGFDGb&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;CCGGAAAAGFFEEDDCGGGFFEEEDCGGGFFFFEEED&lt;/code&gt; in &lt;code&gt;C&lt;/code&gt; to &lt;code&gt;G#&lt;/code&gt; -&gt; &lt;code&gt;G#G#D#D#E#E#E#E#D#C#C#B#B#A#A#G#D#D#D#C#C#B#B#B#A#G#D#D#D#C#C#C#C#B#B#B#A#&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Websites like &lt;a href=&quot;http://www.logue.net/xp/&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.logue.net/xp/&lt;/a&gt; can be used to test your answers to other inputs&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;*&lt;/code&gt; &lt;em&gt;Bonus feel-good points don't get you anything extra, unless someone can come up with a quantifiable difference that it should make to the score?&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="62289" LastEditorUserId="62289" LastEditDate="2019-09-25T09:12:44.720" LastActivityDate="2019-09-25T09:12:44.720" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18116" PostTypeId="2" ParentId="2140" CreationDate="2019-09-23T23:30:58.810" Score="3" Body="&lt;h1&gt;Byte-sized Huffman Coding (WIP)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; rel=&quot;tag&quot;&gt;compression&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/text&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;text&amp;#39;&quot; rel=&quot;tag&quot;&gt;text&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Huffman_coding&quot; rel=&quot;nofollow noreferrer&quot;&gt;Huffman codings&lt;/a&gt; are a method to compress data with certain frequency properties, usually text. Normally, these operate on bits rather than bytes, but this challenge will instead operate on whole bytes instead. Since you wouldn't get any benefit otherwise, you can represent multiple consecutive characters with a sequence of one or more bytes, for instance &lt;code&gt;'. '&lt;/code&gt; (a period followed by a space) could be represented by byte 1, &lt;code&gt;'The'&lt;/code&gt; could be represented with byte 2, and &lt;code&gt;'Ishmael'&lt;/code&gt; could be represented by a 255 then a 7 (among many other sequence codings).&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Create a program that compresses a plain-text version of a work of literature by returning a byte-wise Huffman coding table and a sequence of bytes that represents the text with that table.&lt;/p&gt;&#xA;&lt;h2&gt;Rules and Assumptions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may assume that the text is written in English and uses only printable ASCII characters plus space, newline, and tab.&lt;/li&gt;&#xA;&lt;li&gt;It must be a proper Huffman coding; no mapping may be the prefix of another.&lt;/li&gt;&#xA;&lt;li&gt;Not all Huffman sequences need to be mapped to a particular character sequence; you could, for instance, not have 7 mapped to anything or not have 255, 39 mapped to something, but have every other 1 and 2 byte sequence mapped to something.&lt;/li&gt;&#xA;&lt;li&gt;The returned coding table must be able to encode every possible sequence of valid characters (as per the first assumption above). The simplest way to do this is to make sure that every individual character is mapped to a Huffman byte sequence.&lt;/li&gt;&#xA;&lt;li&gt;It can be possible to encode a body of text multiple ways using the returned encoding table. If both &lt;code&gt;ca&lt;/code&gt; and &lt;code&gt;at&lt;/code&gt; are mapped to byte sequences, &lt;code&gt;cat&lt;/code&gt; could be encoded two ways. This is totally fine.&lt;/li&gt;&#xA;&lt;li&gt;Case &lt;em&gt;must&lt;/em&gt; be preserved.&lt;/li&gt;&#xA;&lt;li&gt;Runs do not need to be deterministic, i.e. two runs of the same program with the same input could produce different Huffman tables and compressed output.&lt;/li&gt;&#xA;&lt;li&gt;Your program must return a result within a reasonable amount of time to be considered a valid solution. (If you want a hard limit, I'll say 5 minutes on a 2GHz Intel dual-core i5 with 16 GB RAM running Windows 10)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Your results will be run against a corpus of (TBD) 12 publicly available literary (and non-fiction) works. For each work of literature, your score will be the size, in bytes, of the compressed text, plus the total length of all text strings mapped to a byte sequence in the Huffman-coding table. Your overall score is the total score across all 12 works.&lt;/p&gt;&#xA;&lt;p&gt;Lowest score wins.&lt;/p&gt;&#xA;&lt;h3&gt;Literature list&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://raw.githubusercontent.com/ErikSchierboom/sentencegenerator/master/samples/the-king-james-bible.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;The King James Bible&lt;/em&gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://gist.github.com/provpup/2fc41686eab7400b796b/raw/b575bd01a58494dfddc1d6429ef0167e709abf9b/hamlet.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;Hamlet&lt;/em&gt; by William Shakespeare&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Dracula&lt;/em&gt; by Bram Stoker&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Frankenstein&lt;/em&gt; by Mary Shelley&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;On the Origin of Species&lt;/em&gt; by Charles Darwin&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Moby-Dick&lt;/em&gt; by Herman Melville&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Little Women&lt;/em&gt; by Louisa May Alcott&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Tom Sawyer&lt;/em&gt; by Mark Twain&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Pride and Prejudice&lt;/em&gt; by Jane Austen&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;The Hound of the Baskervilles&lt;/em&gt; by Arthur Conan Doyle&lt;/li&gt;&#xA;&lt;li&gt;&amp;lt; Something that entered the public domain in 2019 because it was published in 1923 &amp;gt;&lt;/li&gt;&#xA;&lt;li&gt;&amp;lt; Something written in the last 20 years willingly released into the public domain or with a Creative Commons license that allows derivative works &amp;gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h3&gt;Sandbox&lt;/h3&gt;&#xA;&lt;p&gt;At least one of the last two literary works should preferably be written by a female and/or non-white author to hopefully make writing styles diverse enough to make hard-coded Huffman tables ineffective. Each work should be comparable in length to the other works.&lt;/p&gt;&#xA;&lt;p&gt;Links to these books (in plain text) would be appreciated. Substitution suggestions are welcome.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2021-03-01T17:55:39.383" LastActivityDate="2021-03-01T17:55:39.383" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="18117" PostTypeId="1" CreationDate="2019-09-24T01:29:50.377" Score="18" ViewCount="480" Body="&lt;p&gt;(Sorry this is long.  I tried to gather many examples, and honestly I would have liked to include more.)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Background&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; tag captures many different kinds of creative challenges that are not covered by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.  One frequent feature is asking for what I might call an &lt;em&gt;artifact&lt;/em&gt;—or what one might call a &lt;em&gt;witness&lt;/em&gt; for certain applications in computer science.  For example, one might ask for an &lt;em&gt;input&lt;/em&gt; to a program that causes some behavior, or for the &lt;em&gt;output&lt;/em&gt; of a hard-to-compute process, or just a witness of some property.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's apparently a common concern whether such challenges are on-topic for the site, but luckily we already have a meta post that addresses this issue.  The aptly-named meta post &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9590/objective-computational-challenges-without-code&quot;&gt;&quot;Objective computational challenges without “code”&quot;&lt;/a&gt; has a consensus answer that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9604/49643&quot;&gt;&quot;We should allow computational challenges of all sorts&quot;&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples with moderation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Nonetheless, questions of this kind are routinely closed (or put on hold) as off-topic.  I've collected some instances, together with a history:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/85443/thwart-lepton-compression&quot;&gt;Thwart Lepton compression&lt;/a&gt; asked for a JPEG that compresses poorly.  The question was closed (with three moderators among the votes), prompting the meta post mentioned above.  The question was re-opened (with two of the same moderators from before) after the question was changed to require a program that outputs a JPEG.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/176443/most-populated-wordsearch&quot;&gt;Most Populated WordSearch&lt;/a&gt; asked for a grid of letters.  The question was closed, a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17147/i-asked-a-word-question-that-has-run-away-with-me&quot;&gt;meta question&lt;/a&gt; was asked, and the question was re-opened.  The consensus seemed to be that the post should be downvoted instead of closed, and so until recently it had a negative score.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/4842/3862&quot;&gt;Generate the best boggle board you can [dead link]&lt;/a&gt; also asked for a grid of letters.  The question was closed and the user left the site for a while.  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/5654/best-scoring-boggle-board&quot;&gt;Best Scoring Boggle Board&lt;/a&gt; was asked by another user and presumably kept open because it forbade hard-coding the answer?  The first user returned to ask &lt;a href=&quot;https://codegolf.stackexchange.com/questions/10498/find-the-wordiest-combination-lock&quot;&gt;Find The Wordiest Combination Lock&lt;/a&gt;, which was spared from closure despite essentially asking for an artifact in the same way.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/183036/can-a-neural-network-recognize-primes&quot;&gt;Can a neural network recognize primes?&lt;/a&gt; asked for a neural network.  The post was closed (&quot;unclear what you're asking&quot;), but re-opened after &quot;neural network&quot; was narrowly defined.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/193091/create-a-uniquely-solvable-crossword-without-clues&quot;&gt;Create a uniquely solvable crossword ... without clues [closed]&lt;/a&gt; asks for a crossword grid (no letters).  The question was put on hold, after which it was edited to require code with every answer. Nonetheless, it was automatically closed after five days, in part because thus far no one has acknowledged the existence of the meta post mentioned above.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Examples without moderation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Here are some other questions that did not have moderation activity but are of similar type:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/8986/best-scoring-scrabble-board&quot;&gt;Best Scoring Scrabble Board&lt;/a&gt; asks for a Scrabble board.  It is apparently the oldest unanswered question on the site.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/143822/a-%c3%97-a-a-%c3%97-a&quot;&gt;(-a) × (-a) = a × a&lt;/a&gt; asks for a proof.  &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10287/are-non-programming-golf-puzzles-allowed&quot;&gt;A meta post from earlier&lt;/a&gt; said proof golf is on-topic.  This question is the highest-voted in the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/11880/build-a-working-game-of-tetris-in-conways-game-of-life&quot;&gt;Build a working game of Tetris in Conway's Game of Life&lt;/a&gt; asks for a configuration in Conway's Game of Life.  It is the highest-voted question of all time, and it was unanswered for many years.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/187562/machine-learning-golf-multiplication&quot;&gt;Machine Learning Golf: Multiplication&lt;/a&gt; asked for a neural network.  Despite being asked after the neural network question above, with comments saying that it had the same issues, this question remained open without having defined &quot;neural network&quot;.  The question became a hot network question and is the second highest-voted in the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/179370/plight-of-the-concorde&quot;&gt;Plight of the Concorde&lt;/a&gt; asks for a set of points that make a specific program run slowly.  Somehow it avoided being closed; perhaps it wasn't noticed by enough of the people that like to close &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; questions.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/12261/build-a-multiplying-machine-using-nand-logic-gates&quot;&gt;Build a multiplying machine using NAND logic gates&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37648/drive-a-hexadecimal-7-segment-display-using-nand-logic-gates/&quot;&gt;Drive a hexadecimal 7-segment display using NAND logic gates&lt;/a&gt; ask for circuits.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/154539/get-two-from-one&quot;&gt;Get Two from One&lt;/a&gt; asks for a certain kind of graph that encodes some logic.  An earlier related question, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/154265/hexcellent-minesweeping&quot;&gt;Hexcellent Minesweeping&lt;/a&gt;, attracted the comment &quot;This isn't really code or programming related is it? It looks more like something Puzzling.SE would have&quot;, as many of these questions do.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/53310/shortest-universal-maze-exit-string&quot;&gt;Shortest universal maze exit string&lt;/a&gt; asks for a string using the four characters &lt;code&gt;NESW&lt;/code&gt; satisfying a nontrivial constraint.  This is a good example of a question where using the word &quot;witness&quot; makes a lot of sense.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;What is a &quot;computational challenge&quot;?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A persistent issue in the moderation discussion for these questions is whether the challenge is &quot;&lt;em&gt;about programming puzzles&lt;/em&gt;&quot; / a &quot;&lt;em&gt;computational challenge&lt;/em&gt;&quot;.  How can we help clarify these decisions?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&quot;Programming languages&quot;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;One possible criterion is whether the answer is in a (perhaps non-obvious) &quot;programming language&quot;.  For example, one may say that Conway's Game of Life &quot;is a well-defined computational model which is Turing complete&quot;.  As such, configurations in the Game of Life are programs in themselves.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Unfortunately, this criterion is tricky to apply and people get it wrong.  While the Game of Life was explicitly designed with the intention of being Turing complete, actually demonstrating this fact is highly nontrivial and took many years.  What are we to do in the intervening years where the status of this conjecture is unknown?  (The question is not merely hypothetical.  For example, the &lt;a href=&quot;https://esolangs.org/wiki/Bubblegum&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolang wiki page for Bubblegum&lt;/a&gt; says that &quot;While Bubblegum is Turing complete, programs with non-constant output are hard to write.&quot; In reality, it is not known that one can even write more than a single non-constant program in Bubblegum.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Luckily, we have an important meta post to guide us, defining a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/49643&quot;&gt;programming language&lt;/a&gt;: it must be able to add natural numbers and test primality.  Even so, the criterion is nontrivial to apply.  For example, the book &lt;a href=&quot;https://www.goodreads.com/book/show/8849706-games-puzzles-and-computation&quot; rel=&quot;nofollow noreferrer&quot;&gt;&quot;Games, Puzzles, and Computation&quot;&lt;/a&gt; by Robert A. Hearn and Erik D. Demaine (the former's thesis) argues that &quot;games should be thought of as a valid and important model of computation, just as Turing machines are&quot;.  This perspective (which incidentally includes the Game of Life as an example) would conclude that many puzzles are programming languages.  For example, any NP-complete problem (like crosswords or minesweeper) can encode any problem from NP, and so in fact can go further than &lt;em&gt;testing primality&lt;/em&gt; by even &lt;em&gt;factoring&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A similar sentiment is expressed in the meta post regarding proof golf, namely “let's not call something &quot;not programming&quot; for not looking like a typical programming language”.  Incidentally, the game in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/154539/get-two-from-one&quot;&gt;Get Two From One&lt;/a&gt; strongly resembles the main game in &quot;Games, Puzzles, and Computation&quot;, which is called &lt;a href=&quot;https://en.wikipedia.org/wiki/Constraint_Logic_Problem&quot; rel=&quot;nofollow noreferrer&quot;&gt;&quot;Constraint Logic&quot;&lt;/a&gt;/constraint graphs.  Different versions of this logic encode different complexity classes/computational models, from polynomial time to undecidable.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Relationship to computer science theory&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Another motivating concern might be theorems from computer science.  For example, part of the justification for proof golf is that &quot;the  &lt;a href=&quot;https://en.wikipedia.org/wiki/Curry%E2%80%93Howard_correspondence&quot; rel=&quot;nofollow noreferrer&quot;&gt;Curry-Howard correspondence&lt;/a&gt;, aka the proofs as programs interpretation, gives a formal mathematical equivalence between proofs and programs&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As another example, &lt;a href=&quot;https://en.wikipedia.org/wiki/Computers_and_Intractability&quot; rel=&quot;nofollow noreferrer&quot;&gt;&quot;Computers and Intractability: A Guide to the Theory of NP-Completeness&quot;&lt;/a&gt; by Michael Garey and David S. Johnson is the most-cited reference in computer science literature, and the theory of NP-completeness is one the most-taught parts of computer science theory.  Garey and Johnson note that &quot;CROSSWORD PUZZLE is NP-complete&quot;.  Does that mean that crossword puzzles are more likely to be on-topic?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Neural networks also have a shiny theorem, the &lt;a href=&quot;https://en.wikipedia.org/wiki/Universal_approximation_theorem&quot; rel=&quot;nofollow noreferrer&quot;&gt;universal approximation theorem&lt;/a&gt;.  While this doesn't put them (ordinary, feedforward/non-recurrent nets) in the same class as &quot;Turing-complete&quot;, it does mean they can approximate any function on a compact subset of real space.  This is analogous to the &lt;a href=&quot;https://en.wikipedia.org/wiki/Functional_completeness&quot; rel=&quot;nofollow noreferrer&quot;&gt;functional completeness&lt;/a&gt; of &lt;a href=&quot;https://en.wikipedia.org/wiki/NAND_logic&quot; rel=&quot;nofollow noreferrer&quot;&gt;NAND&lt;/a&gt; in the context of circuits.  This latter theory prompts questions like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/12261/build-a-multiplying-machine-using-nand-logic-gates&quot;&gt;Build a multiplying machine using NAND logic gates&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a follow-up, one might ask whether it matters whether the theorem in question &lt;em&gt;actually applies&lt;/em&gt;.  For example, the Curry-Howard correspondence does not mean proofs in very weak systems correspond to a Turing-complete programming language, or even a programming language as defined above.  For example, &lt;a href=&quot;https://en.wikipedia.org/wiki/Propositional_calculus&quot; rel=&quot;nofollow noreferrer&quot;&gt;propositional logic&lt;/a&gt; is completely decidable (ie, not Turing complete), using the straightforward (but not historically obvious) technique of &lt;a href=&quot;https://en.wikipedia.org/wiki/Truth_table&quot; rel=&quot;nofollow noreferrer&quot;&gt;truth tables&lt;/a&gt;.  Does that mean that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/161172/a-%e2%86%92-b-%e2%86%92-%c2%acb-%e2%86%92-%c2%aca&quot;&gt;(A → B) → (¬B → ¬A)&lt;/a&gt; is off-topic?  The consensus meta opinion is &quot;proof golf questions are on-topic&quot;, and indeed &lt;a href=&quot;https://codegolf.stackexchange.com/a/168555/49643&quot;&gt;the Curry-Howard correspondence is a rich source of inspiration to answer literally that question&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the second example, instances of Garey and Johnson's CROSSWORD PUZZLE provide both a crossword grid &lt;em&gt;and&lt;/em&gt; a word list (&quot;dictionary&quot;).  If the word list is fixed, then the puzzle need not be NP-complete.  Nonetheless, experience shows that with a sufficiently rich word list, it's very likely that filling crossword grids is NP-complete.  As an example of a concern raised above, does it matter that this is not known for a particular word list (with rigorous proof) at the moment?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Relationship to programming culture&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Another thing that might make these questions on-topic is that they deal with topics that are central to the &lt;em&gt;culture&lt;/em&gt; of computer science, of programming, or of code golf.  For example, many programmers have played with Conway's Game of Life.  People sometimes even claim (falsely) that &quot;since 1970, more computer time worldwide has been devoted to the Game of Life than any other single activity&quot;.  At the very least, some people started programming and perhaps their career in computer science due to the Game of Life.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Also, does this mean that topics that are popular but not exclusively among programmers or in a computer science context are &lt;em&gt;less&lt;/em&gt; likely to be on-topic?  For example, crosswords are much more well-known in the general population than Conway's Game of Life. The situation is complicated a bit by the fact that some people like all sorts of puzzles, including both crosswords and code golf.  Similarly, gerrymandering is a hot political topic.  How does that affect questions like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/153570/gerrymandering-with-logic-gates&quot;&gt;Gerrymandering with Logic Gates&lt;/a&gt;, which is an &quot;ordinary&quot; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question, but plausibly could have asked for a single circuit?)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Along the same vein, neural networks are currently very widely-discussed, and many software engineers use them in practical applications.  Does that mean that exploring the limits of &quot;machine learning golf&quot; makes questions about neural networks more appropriate here?  One might be hesitant in saying &quot;yes&quot; to some of these questions, but I do think it's likely that culturally-relevant topics (to programming culture) are much less likely to be closed as &quot;off-topic&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Difficulty&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Does it matter how difficult it is to make a submission?  What if the submission itself does not require any code, but it is probable that the best solutions will be found using significant programming?  (That is, we could measure &quot;difficulty&quot; here by simply considering coding time.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/11880/build-a-working-game-of-tetris-in-conways-game-of-life&quot;&gt;Build a working game of Tetris in Conway's Game of Life&lt;/a&gt; required an enormous amount of what could only be called &lt;em&gt;software engineering&lt;/em&gt;, involving a team of multiple people, even though &lt;em&gt;in principle&lt;/em&gt; it could have been solved by a single person scribbling in a paper notebook.  &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9590/objective-computational-challenges-without-code#comment28940_9604&quot;&gt;Some comments on the answer to the meta post above regarding te JPEG challenge&lt;/a&gt; wrestle with this question: &quot;If the optimal JPEG &lt;em&gt;was&lt;/em&gt; likely to be found by hand, would you consider the challenge on-topic?&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In some challenges, like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/176443/most-populated-wordsearch&quot;&gt;Most Populated WordSearch&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/53310/shortest-universal-maze-exit-string&quot;&gt;Shortest universal maze exit string&lt;/a&gt;, making a &lt;em&gt;valid&lt;/em&gt; submission is not difficult and can be done by hand, but making a &lt;em&gt;good&lt;/em&gt; or &lt;em&gt;optimal&lt;/em&gt; submission is difficult and likely requires code.  In other challenges, like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/193091/create-a-uniquely-solvable-crossword-without-clues&quot;&gt;Create a uniquely solvable crossword ... without clues&lt;/a&gt;, making a valid submission &lt;em&gt;at all&lt;/em&gt; is difficult.  It is &lt;em&gt;theoretically&lt;/em&gt; possible to make a submission by hand, but in practice I expect it is not possible to create or even verify any submission without programming.  Does that matter?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Ancillary demands to include code&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Suppose we have a challenge that asks for an artifact, and it's at danger of being closed because it's not on-topic.  One potential way out of the problem is simply by requiring the submission of code along with each answer.  Is that sufficient?  Or on the flip side, is that &lt;em&gt;required&lt;/em&gt; to be on-topic?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In practice, it seems that this technique has been highly successful at getting questions re-opened (but not universally so).  For example, the JPEG question requires code now, as does the Boggle question.  There are plenty of examples also of where the question could have originally been written without a demand for code (only demanding the final artifact), but from the very beginning was culturally biased towards asking for code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If one does require code, should the post also demand that the answer not be hard-coded?  The Boggle question does so, and even imposes a runtime limit.  On the other hand, the word search question does not include such a restriction, leading to some &lt;a href=&quot;https://codegolf.stackexchange.com/a/176445/&quot;&gt;awkward &quot;code golf&quot;&lt;/a&gt; (ostensibly &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; but really just dictionary-based compression in practice) after having solved the main part of constructing a grid of letters.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Synthesis&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I would appreciate hearing people's guidance on what they believe makes a code challenge &lt;em&gt;on-topic&lt;/em&gt;.  I am especially interested because I like to ask and answer &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; questions, but other people like to close them instead.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Users other than myself are also interested in knowing what restrictions need to met to be on-topic, especially because constructing such a challenge is often hard work in and of itself.  (For example, I have spent over 10 hours on writing my crossword grid challenge, not counting any of the ensuing moderation discussion and this meta post.)&lt;/p&gt;&#xA;" OwnerUserId="49643" LastEditorUserId="49643" LastEditDate="2019-09-25T00:30:50.573" LastActivityDate="2019-09-27T00:20:23.977" Title="Questions that ask for artifacts or witnesses" Tags="|discussion|close-reasons|scope|" AnswerCount="1" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="18119" PostTypeId="2" ParentId="2140" CreationDate="2019-09-24T13:15:41.280" Score="-2" Body="&lt;h1&gt;Make it improbable... BUT NOT IMPOSSIBLE&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You must make a program that outputs truly once in a while. However, making it have output falsy all the time is not acceptable.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;You may use any of accepted I/O formats.&lt;/li&gt;&#xA;&lt;li&gt;Your program must be possible to output a truly value.&lt;/li&gt;&#xA;&lt;li&gt;When not outputting a truly value, you may either output a falsy value or not output anything at all.&lt;/li&gt;&#xA;&lt;li&gt;You may output two or more values, however if it contains a truly value, then the output is considered truly.&lt;/li&gt;&#xA;&lt;li&gt;The probability of outputting a truly value must be at most 1/2.&lt;/li&gt;&#xA;&lt;li&gt;Your program must not take/use an input.&lt;/li&gt;&#xA;&lt;li&gt;Using non-deterministic but non-random(Such as getting the time) is prohibited. However, if date etc. is used in the builtin random function, it is allowed.&lt;/li&gt;&#xA;&lt;li&gt;The program must theoretically always terminate or stop outputting anything.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that you have a fast enough computer and large enough memory.&lt;/li&gt;&#xA;&lt;li&gt;Your program should not be affected by raising the maximum value of a data type. You may still use unaffected constants.&lt;/li&gt;&#xA;&lt;li&gt;Data types must be following its spec: ie. for an unbounded arbituary precision integer type, you may assume that it can go as high as you want(but you are not allowed to increment until an error as in the rule above), but a double-precision floating-point format still has 22-bit fraction and 8-bit exponent.&lt;/li&gt;&#xA;&lt;li&gt;Score is calculated as: P&lt;sup&gt;l&lt;sup&gt;-1.5&lt;/sup&gt;&lt;/sup&gt;l, where P is the probability and l is the byte length.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example(s)&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;JavaScript&#xA;alert(Math.random()&amp;lt;0.1)&#xA;P=0.1, l=24 =&amp;gt; Score=23.534&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The lowest score wins!&lt;/p&gt;&#xA;" OwnerUserId="86759" LastEditorUserId="86759" LastEditDate="2019-09-24T18:29:25.433" LastActivityDate="2019-09-24T18:29:25.433" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18120" PostTypeId="2" ParentId="2140" CreationDate="2019-09-24T13:29:11.627" Score="0" Body="&lt;p&gt;&lt;strong&gt;Title - Fix the note&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a musical note letter (&lt;code&gt;A&lt;/code&gt; to &lt;code&gt;G&lt;/code&gt;), followed by any number of accidentals (either 0..n &lt;code&gt;#&lt;/code&gt; or 0..n &lt;code&gt;b&lt;/code&gt;, not a combination of both); output a representation of the same note with the least possible number of accidentals.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;code&gt;#&lt;/code&gt; means &quot;shift the note one semitone up&quot;, and a &lt;code&gt;b&lt;/code&gt; means &quot;shift the note one semitone down&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All valid output notes are as follows (in order, then loops):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;A&lt;/code&gt; &lt;code&gt;A#/Bb&lt;/code&gt; &lt;code&gt;B&lt;/code&gt; &lt;code&gt;C&lt;/code&gt; &lt;code&gt;C#/Db&lt;/code&gt; &lt;code&gt;D&lt;/code&gt; &lt;code&gt;D#/Eb&lt;/code&gt; &lt;code&gt;E&lt;/code&gt; &lt;code&gt;F&lt;/code&gt; &lt;code&gt;F#/Gb&lt;/code&gt; &lt;code&gt;G&lt;/code&gt; &lt;code&gt;G#/Ab&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So a sharp would move to the right along that list (and loop); and a flat would move you to the left.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;A&lt;/code&gt; -&gt; &lt;code&gt;A&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;B#&lt;/code&gt; -&gt; &lt;code&gt;C&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Fb&lt;/code&gt; -&gt; &lt;code&gt;E&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;A#####&lt;/code&gt; -&gt; &lt;code&gt;D&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Dbbb&lt;/code&gt; -&gt; &lt;code&gt;B&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Gbbbbbbbbbbbb&lt;/code&gt; -&gt; G&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Bb&lt;/code&gt; -&gt; &lt;code&gt;Bb&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;F#&lt;/code&gt; -&gt; &lt;code&gt;F#&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;E##&lt;/code&gt; -&gt; &lt;code&gt;F#&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;E#&lt;/code&gt; -&gt; &lt;code&gt;F&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You can assume that the length of the input won't overflow your language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Where the input has sharps, the output can also only contain 0..1 sharps; and vice-versa for flats.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest bytes wins. Standard rules apply&lt;/p&gt;&#xA;" OwnerUserId="62289" LastEditorUserId="62289" LastEditDate="2019-09-26T08:29:58.297" LastActivityDate="2019-09-26T08:29:58.297" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18122" PostTypeId="2" ParentId="2140" CreationDate="2019-09-25T18:06:46.340" Score="-2" Body="&lt;h1&gt;I reverse the source code, you keep the output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Yet another blatant &lt;a href=&quot;https://codegolf.stackexchange.com/questions/193315/i-reverse-the-source-code-you-reverse-the-input&quot;&gt;rip-off&lt;/a&gt; of a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/193021/i-reverse-the-source-code-you-negate-the-input&quot;&gt;rip-off&lt;/a&gt; of a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/192979/i-reverse-the-source-code-you-negate-the-output&quot;&gt;rip-off&lt;/a&gt; of a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/132558/i-double-the-source-you-double-the-output&quot;&gt;rip-off&lt;/a&gt;. Go upvote those!&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task, if you wish to accept it, is to write a program/function that outputs/returns its own output. The tricky part is that if I reverse your source code, the output must be preserved.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Let's say your code is &lt;code&gt;ABC&lt;/code&gt; and the corresponding output is &lt;code&gt;XYZ&lt;/code&gt;. If I run &lt;code&gt;CBA&lt;/code&gt;, the output must &lt;strong&gt;also&lt;/strong&gt; be &lt;code&gt;XYZ&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="88762" LastActivityDate="2019-09-25T18:06:46.340" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="18123" PostTypeId="2" ParentId="18117" CreationDate="2019-09-26T01:35:20.510" Score="-9" Body="&lt;h1&gt;Challenges should require submitters to write code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is the core requirement. This is the core purpose of this site.  We are a site about &lt;em&gt;code&lt;/em&gt; challenges. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, in regards to artifact-based challenge, my position here is nuanced. I would not allow a challenge that requires any SHA-1 hash collision. This certainly requires code, but it doesn't require the &lt;em&gt;submitter&lt;/em&gt; to write code, as it only requires a Google search.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore, all challenges should require evidence that the submitter has written code. For unique challenges (such as the crossword challenge), posting a solution feels like sufficient evidence that code has been written. However, the final say of whether a particular challenge requires enough evidence is up to the close voters. &lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorUserId="20198" LastEditDate="2019-09-27T00:20:23.977" LastActivityDate="2019-09-27T00:20:23.977" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18124" PostTypeId="2" ParentId="2140" CreationDate="2019-09-26T14:01:19.473" Score="0" Body="&lt;p&gt;&lt;strong&gt;Title: Score my Tarok hand&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/193547/what-is-the-score-of-my-scopa-hand&quot;&gt;this challenge&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In Slovenia (and elsewhere in central Europe), the card game Tarok is very popular. See &lt;a href=&quot;https://www.pagat.com/tarot/sltarok.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; for a complete list of rules, but essentially it is a trick taking game, played in teams that change per round.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This challenge is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, concerning the scoring of a hand, at the end of a round.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a normal round, the game is played in partnerships. Any one player could decide the &quot;contract&quot; for the round, and that player (plus anyone on their team) either wins or loses the round, giving them a positive or negative score. They are known as the &quot;Declaring team&quot;. The &quot;Opposing team&quot; cannot score in that round.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input for this challenge will therefore be the Declaring team's cards, plus the contract type they bid for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The cards&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a game of Tarok, there are 54 cards; as follows (shown as highest to lowest in each suit - names in brackets after a card are local names given to certain cards):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Spades, Clubs: King, Queen, Knight, Jack, 10, 9, 8, 7&lt;/li&gt;&#xA;&lt;li&gt;Diamonds, Hearts: King, Queen, Knight, Jack 1, 2, 3, 4&lt;/li&gt;&#xA;&lt;li&gt;Taroks: Joker (škis), XXI (mond), XX, XIX, ... III, II, I (pagat)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The point value of the cards are as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;kings, škis, XXI and I - 5 points each&lt;/li&gt;&#xA;&lt;li&gt;queens - 4 points each&lt;/li&gt;&#xA;&lt;li&gt;knights - 3 points each&lt;/li&gt;&#xA;&lt;li&gt;jacks - 2 points each&lt;/li&gt;&#xA;&lt;li&gt;all other cards - 1 points each&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring a hand&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is what I believe makes this challenge interesting.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For each set of three cards in your hand, add up their values and subtract 2.&lt;/li&gt;&#xA;&lt;li&gt;If you end up with one or two cards left over after making the sets of three, add up their values and subtract 1. &#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;So, a pair or a set of three one-point cards are both worth 1 point; but a single one-point card is worth nothing.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The total value of the pack comes to 70 card points.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In most contracts (see below), the declarer's side wins if at the end of the play they have at least 36 of the available 70 points; otherwise they lose. Because of this, the members of each team pool their cards for scoring; and so if you know the score of one team, you can calculate the score of the other.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once the hand value has been calculated, the difference from 35 is taken (i.e. &lt;code&gt;handValue - 35&lt;/code&gt;), and this difference is rounded to the nearest 5 points.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Contracts and Bonuses&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once the hand score is known for the declaring team, the final score is calculated based on the &quot;contract&quot; that was chosen at the start of the round (where &quot;difference&quot; is the rounded hand difference from 35, calculated above. Note this may be negative, if the opposing team got more points):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Contract Name          | Scoring (+ if contract won, - if lost)&#xA;------------------------------------------------&#xA;Three                  | difference +/- 10&#xA;Two                    | difference +/- 20&#xA;One                    | difference +/- 30&#xA;Solo Three             | difference +/- 40&#xA;Solo Two               | difference +/- 50&#xA;Solo One               | difference +/- 60&#xA;Beggar*                | 70 (fixed)&#xA;Solo without           | 80 (fixed)&#xA;Open Beggar*           | 90 (fixed)&#xA;Colour Valat Without** | 125 (fixed), no bonuses&#xA;Valat Without**        | 500 (fixed), no bonuses&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;With the exception of those marked, all contracts are &quot;won&quot; if the difference is 36 or higher; otherwise it was &quot;lost&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;*&lt;/code&gt; - to win the points, you must win no tricks (and therefore no cards)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;**&lt;/code&gt; - to win the points, you must win ALL the tricks (and therefore all the cards). In this case, no other scoring bonuses are applied.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bonus points are awarded to the declaring team, or subtracted from the declaring team if the opposing team complete the criteria. &lt;em&gt;Bonuses are only awarded on contracts where the difference is taken into account.&lt;/em&gt; (i.e. from &quot;Three&quot; to &quot;Solo One&quot; only, in the above table)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Bonus Criteria                                | Bonus Points&#xA;-----------------------------------------------------------------------------------&#xA;Take škis, XXI and I (&quot;the Trule&quot;) in tricks  | 10&#xA;Take all 4 kings in tricks                    | 10&#xA;Take all the tricks (&quot;Valat&quot;)                 | 500, no other scoring is applied&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(note that in Tarok, there are some actions that take place during play which give additional bonuses, such as announcing at the start of the game your intention to get a certain bonus; but as those would require more inputs to calculate, I will leave these out of this challenge.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Some Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;All 54 cards, any contract&lt;/code&gt; -&gt; +500 points&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;No Cards, called Beggar&lt;/code&gt; -&gt; + 70 points&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;king, king, king, king, škis, XXI, I, queen, queen, queen, queen, knight, knight, knight, knight, jack, jack, 1H, 2H; called &quot;One&quot;&lt;/code&gt; -&gt; 30 points for contract + 20 points difference (hand score is 56 which is 21 different from 35, so round to 20) + 10 points kings bonus + 10 points Trule Bonus = 70 points&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;No cards, called &quot;Solo One&quot;&lt;/code&gt; -&gt; -500 (opposing team got Valat bonus)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;KS,8S,7S, called &quot;Two&quot;&lt;/code&gt; -&gt;failed contract, so -30 (difference), -20 (contract), -10 (opponents got Trule bonus) = -60 points&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;KH, KD, škis, I, queen, queen, queen, queen, knight, knight, knight, knight, jack, jack, 1H, 2H, 7C,1D,2D,4D; called &quot;Solo Without&quot;&lt;/code&gt; = +80 points&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;KH, KD, škis, I, queen, queen, queen, queen, knight, knight, knight, knight, jack, jack, 1H, X, III,II,2D,KS; called &quot;Three&quot;&lt;/code&gt; = +15 difference (49-35, rounded) + 10 contract = +25&lt;/p&gt;&#xA;" OwnerUserId="62289" LastActivityDate="2019-09-26T14:01:19.473" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18126" PostTypeId="1" AcceptedAnswerId="18127" CreationDate="2019-09-27T13:19:29.937" Score="12" ViewCount="254" Body="&lt;p&gt;The Code Golf stackexchange tour gives a detailed explanation on, how to ask a Code Golf question.&lt;br&gt;&#xA;But what about how to answer? I have multiple questions about: &lt;strong&gt;How to give an answer?&lt;/strong&gt;.&lt;br&gt; Neither the code golf nor the meta stackexchange seems to answer my questions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Does the answer must be right?&lt;/strong&gt; Let's take the example of a student, that try to solve a challenge for hours, and end up with half of a solution.&lt;br&gt;Should he post it? Perhaps someone can help him in the comment, and they can form group to overcome this hurdle.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Do I necessarily have to aim for the shortest answer?&lt;/strong&gt; If I have the choice between an elegant and short solution, how should I chose it.&lt;br&gt;&#xA;Also, let's say that I have a solution, but I know it is far from the shortest or the best solution, do I keep it for me?&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Should I prioritize language with light syntax over verbose language.&lt;/strong&gt; Like C or Java are really verbose, so If I post an answer in one of these language, will it be downvoted to the gut?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="88819" OwnerDisplayName="Hamza Ince" LastEditorUserId="46076" LastEditDate="2019-09-27T20:29:34.137" LastActivityDate="2021-06-08T23:37:35.050" Title="Acceptable answer for a code golf" Tags="|discussion|answers|" AnswerCount="2" CommentCount="3" FavoriteCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18127" PostTypeId="2" ParentId="18126" CreationDate="2019-09-27T13:45:39.237" Score="15" Body="&lt;p&gt;Hello and welcome to CG&amp;amp;CC! Hopefully, this will clear some things up for you:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Must the answer be right?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990/45941&quot;&gt;Yes, answers to challenges must solve the challenge correctly&lt;/a&gt;. If you have a partially-working answer and need some help finishing it, try &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;asking in chat&lt;/a&gt; - we're friendly.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Do I necessarily have to aim for the shortest answer?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8750/45941&quot;&gt;You should always make a genuine attempt at optimizing for the winning criteria&lt;/a&gt;. For &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, that means you must make an effort to make your code as short as possible. For &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, that means you must make an effort to make your code as fast as possible. For other types of challenges, it will depend on the exact challenge.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Should I prioritize language with light syntax over verbose language?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;You can answer in any programming language you like. Many people find cleverly-golfed answers in languages like Java to be more interesting than basic answers in very terse languages, so you might even get more upvotes. We generally don't downvote answers unless they're actually low-quality (like not optimized for the winning criteria).&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="66833" LastEditDate="2021-06-08T23:37:35.050" LastActivityDate="2021-06-08T23:37:35.050" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18128" PostTypeId="2" ParentId="18126" CreationDate="2019-09-27T13:52:51.767" Score="5" Body="&lt;h2&gt;Hi and welcome to Code Golf SE!&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;1) Does the answer have to be right?&lt;/strong&gt;&lt;br /&gt;&#xA;Yes. One of the fundamental pillars of this community is that all challenges have to have clear, unambiguous winning criterion, so that you can definitively compare two answers and determine which is better. That includes validity. A partially-working solution at 10 bytes versus a fully-working solution at 12 bytes isn't clear or unambiguous. See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7450/42963&quot;&gt;this answer&lt;/a&gt; from Martin for some methods to utilize a partially-working solution, and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990/42963&quot;&gt;this answer&lt;/a&gt; from Dennis for further details on what constitutes a valid answer.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;2) Do I necessarily have to aim for the shortest answer?&lt;/strong&gt;&lt;br /&gt;&#xA;For &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges, yes. This is specified in further detail on the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11502/42963&quot;&gt;How to answer?&lt;/a&gt; pop-up when you start answering a challenge. If you have a really elegant or neat trick to show off, please understand that we request the shortest answer &lt;em&gt;per implementation.&lt;/em&gt; So if the challenge can be answered by a brute-force solution in &lt;code&gt;X&lt;/code&gt; bytes, but your elegant algorithm takes &lt;code&gt;X+10&lt;/code&gt; bytes, that's still an acceptable answer. See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10836/42963&quot;&gt;this post&lt;/a&gt; from Dennis for further discussion.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;3) Should I prioritize language with light syntax over verbose language.&lt;/strong&gt;&lt;br /&gt;&#xA;See above regarding the per-implementation scoring. In general, solutions are scored based on many factors, but just because you're answering in Java doesn't mean you're going to automatically get downvotes.&lt;/p&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-09-27T13:52:51.767" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18130" PostTypeId="2" ParentId="2140" CreationDate="2019-09-28T11:40:41.007" Score="1" Body="&lt;h1&gt;Polynomials Through Points&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You will get a set of &lt;code&gt;n&lt;/code&gt; Cartesian coordinates. You must output a polynomial going through all of the points.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Points are 2-dimensional.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that no two points share a x coordinate.&lt;/li&gt;&#xA;&lt;li&gt;You may take points as a tuple of pairs, or pair of equal length tuples.&lt;/li&gt;&#xA;&lt;li&gt;1&amp;lt;&lt;code&gt;n&lt;/code&gt;&amp;lt;1000&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For polynomial &lt;code&gt;y=x^3+3*x^2+1&lt;/code&gt;, you may output as:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;y=x^3+3*x^2+1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x^3+3*x^2+1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;y=x^3+3*x^2+0*x+1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x^3+3*x^2+0*x+1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;y=x^3+3*x^2+x^0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x^3+3*x^2+x^0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;y=x^3+3*x^2+0*x^1+x^0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x^3+3*x^2+0*x^1+x^0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;y=1*x^3+3*x^2+1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1*x^3+3*x^2+1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;y=1*x^3+3*x^2+0*x+1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1*x^3+3*x^2+0*x+1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;y=1*x^3+3*x^2+1*x^0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1*x^3+3*x^2+1*x^0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;y=1*x^3+3*x^2+0*x^1+1*x^0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1*x^3+3*x^2+0*x^1+1*x^0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[1,3,0,1]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;You may output any polynomial satisfying the condition.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Stabdard loopholes are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;Any method approved by Standard I/O is allowed.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;code&gt;code-golf&lt;/code&gt;, so shortest code wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="86759" LastEditorUserId="86759" LastEditDate="2019-10-01T01:08:21.790" LastActivityDate="2019-10-01T01:08:21.790" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18133" PostTypeId="1" CreationDate="2019-09-29T06:06:39.323" Score="242" ViewCount="9752" Body="&lt;p&gt;It's been an honor to serve as your moderator for the past four years. I would like to continue to do so, but after witnessing how Stack Exchange treats their volunteers, I decided that I'm no longer going to volunteer for them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The affected former sextuple moderator, Monica Cellio, &lt;a href=&quot;https://judaism.meta.stackexchange.com/q/5193/19824&quot;&gt;has summarized what happened to her&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd like to make clear that my decision to resign was based solely on the above, not on the proposed changes to the code of conduct. If I guessed them correctly, I agree with the intentions behind the future changes. Time will tell if I agree with the actual changes, which are not yet known to me.&lt;/p&gt;&#xA;" OwnerUserId="12012" LastEditorUserId="12012" LastEditDate="2019-10-02T01:27:48.113" LastActivityDate="2019-11-03T00:04:00.717" Title="I'm stepping down" Tags="|discussion|moderators|" AnswerCount="2" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18134" PostTypeId="2" ParentId="2140" CreationDate="2019-09-29T13:19:21.283" Score="0" Body="&lt;h1&gt;Spreadsheet Columns&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/alphabet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;alphabet&amp;#39;&quot; rel=&quot;tag&quot;&gt;alphabet&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In most spreadsheet programs, columns go &lt;code&gt;A&lt;/code&gt;, &lt;code&gt;B&lt;/code&gt;, &lt;code&gt;C&lt;/code&gt;, ... &lt;code&gt;X&lt;/code&gt;, &lt;code&gt;Y&lt;/code&gt;, &lt;code&gt;Z&lt;/code&gt;. After this comes &lt;code&gt;AA&lt;/code&gt;, &lt;code&gt;AB&lt;/code&gt;, &lt;code&gt;AC&lt;/code&gt; ... &lt;code&gt;AX&lt;/code&gt;, &lt;code&gt;AY&lt;/code&gt;, &lt;code&gt;AZ&lt;/code&gt;, &lt;code&gt;BA&lt;/code&gt; and so on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to convert one of these strings in to a column &lt;em&gt;number&lt;/em&gt;. You must support inputs up to the maximum length of your language, to a minimum of 3.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Cases:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;A   =&amp;gt; 1&#xA;B   =&amp;gt; 2&#xA;Z   =&amp;gt; 26&#xA;AA  =&amp;gt; 27&#xA;AC  =&amp;gt; 29&#xA;AZ  =&amp;gt; 52&#xA;BA  =&amp;gt; 53&#xA;FC  =&amp;gt; 159&#xA;ID  =&amp;gt; 238&#xA;AAA =&amp;gt; 703&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Standard loopholes are forbidden.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox:&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Are my test cases correct? They were done of the top of my head, so they may not be accurate.&lt;/li&gt;&#xA;&lt;li&gt;Is this a duplicate? My searching suggests otherwise, but it may not be comprehensive.&lt;/li&gt;&#xA;&lt;li&gt;Are there any other tags I could add?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="88762" LastEditorUserId="88762" LastEditDate="2019-09-29T14:13:38.940" LastActivityDate="2019-09-29T14:13:38.940" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="18135" PostTypeId="2" ParentId="18133" CreationDate="2019-09-29T15:39:45.170" Score="101" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;UPDATE (since 2019-10-30)&lt;/strong&gt;: So, it looks like &lt;a href=&quot;https://meta.stackexchange.com/a/337228/225091&quot;&gt;a test is currently being ran&lt;/a&gt;. I'm not sure if it will have good results, but it surely looks like a big step towards the goal that finally needs to be achieved. There's also a discussion currently progressing in the comments of that answer. Yes, this doesn't solve all of the current issues (e.g. the &quot;retroactive&quot; relicensing), and it doesn't even solve the specific issue that caused the main uproar (Monica's demotion), but it &lt;em&gt;might&lt;/em&gt; solve what caused the latter issue in the first place. Of course, &lt;a href=&quot;https://meta.stackexchange.com/q/336526/225091&quot;&gt;Monica still deserves justice&lt;/a&gt;, even if she will eventually end up remaining &lt;em&gt;justly&lt;/em&gt; demoted, and, personally, I'm not contributing until it gets sorted out, but, since late October, I'm starting to see some light at the end of the tunnel. I hope that everything gets resolved timely.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;UPDATE (since 2019-10-23)&lt;/strong&gt;: So, there's another post, or, shall I say, pair of posts about the singular third-gender pronoun issue. It looks like the implementation of the new ruling is ever-so-slightly lighter than what the older post about it said. What I don't agree with this time around is that:&lt;/p&gt;&#xA;  &#xA;  &lt;ol&gt;&#xA;  &lt;li&gt;Nothing has actually &lt;em&gt;happened&lt;/em&gt; about this yet, &lt;strong&gt;there's been no adequate communication with Monica&lt;/strong&gt;. Remember that &lt;strong&gt;the new CoC wasn't in place when she was expelled from the mod position.&lt;/strong&gt;&lt;/li&gt;&#xA;  &lt;li&gt;Said older post has been deleted, just like &lt;strong&gt;it never happened in the first place&lt;/strong&gt;, with only vague references such as &lt;a href=&quot;https://meta.stackexchange.com/q/336364/225091&quot;&gt;&quot;We tried to anticipate likely questions, but… missed the mark a bit.&quot;&lt;/a&gt; still around.&lt;/li&gt;&#xA;  &lt;/ol&gt;&#xA;  &#xA;  &lt;p&gt;So, regarding my previous update, it looks like the problem I'm referring to has been partly fixed for now, but, since September 29th, no substantial action has been taken, and mere words for the public are simply nothing without that. To prove my point, see the &lt;a href=&quot;https://meta.stackexchange.com/q/334551/225091&quot;&gt;second apology&lt;/a&gt; and note that it once had a score of over +600. People started downvoting it after &lt;a href=&quot;https://meta.stackexchange.com/questions/334900/225091&quot;&gt;the first announcement about the CoC changes&lt;/a&gt; (now deleted) was posted (its net score was below -1600), and it now has a negative score as well. This signifies that, while the community supported the apology for a while, when the listed actions started taking place, the end result was not satisfactory at all, and therefore not in line with the most probable expectations it gave. There's currently nothing that prevents something similar from happening regarding the two new posts.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;UPDATE (since 2019-10-10)&lt;/strong&gt;: I've seen the new CoC... I can say I'm not satisfied at all. The terms are just too strict IMHO, I'm 100% sure that people can perfectly come to terms with more lenient ones. If by 2019-11-01 this is not fixed, then I'll really stop contributing to Stack Exchange (I've already paused my activity).&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;If the community moves elsewhere, I'll happily keep contributing. I love the community a lot, what I hate is Stack Exchange's recent decisions and possible abuse of power. I also have nothing against the CMs and most of the people who work at SE, I know not everyone over there is responsible.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h1&gt;I fully support your decision to resign.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I've been reflecting on whether I'll continue participating in Stack Exchange and Stack Overflow in general since yesterday, when Monica was stripped of her diamonds for, um, &lt;em&gt;disagreeing civilly&lt;/em&gt;. Not to mention the possibly illegal recent &quot;retroactive&quot; license change.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Nope. My life is more than SE, I won't let an internet website treat me unfairly, which I'm sure it'll do if no action is taken against this. The new CEO has until November 1st to bring justice back, otherwise probably bye bye for good.&lt;/p&gt;&#xA;" OwnerUserId="41024" LastEditorUserId="41024" LastEditDate="2019-11-03T00:04:00.717" LastActivityDate="2019-11-03T00:04:00.717" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="18136" PostTypeId="1" CreationDate="2019-09-30T12:49:19.400" Score="89" ViewCount="2736" Body="&lt;p&gt;Should we consider planning to move Code Golf to our own site outside the Stack Exchange network?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Reasons to consider leaving&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This post was spurred by recent events, but it's been in my mind for a while. Stack Exchange has been losing community trust for years. If you haven't followed &lt;a href=&quot;https://meta.stackexchange.com/&quot;&gt;main Meta&lt;/a&gt; and its &lt;a href=&quot;https://meta.stackoverflow.com/search?q=votes%3A..-150&quot;&gt;many&lt;/a&gt; &lt;a href=&quot;https://meta.stackexchange.com/search?tab=newest&amp;amp;q=votes%3A..-100&quot;&gt;controversies&lt;/a&gt;, a few good starting points are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/18133/20260&quot;&gt;Dennis's resignation yesterday&lt;/a&gt;, &lt;a href=&quot;https://meta.stackoverflow.com/q/386324&quot;&gt;this SO Meta post&lt;/a&gt; on the site's direction, their &lt;a href=&quot;https://meta.stackexchange.com/q/329763/275609&quot;&gt;aggressive ads&lt;/a&gt;, and their unilateral &lt;a href=&quot;https://meta.stackexchange.com/q/309746/275609&quot;&gt;TOS changes&lt;/a&gt; and &lt;a href=&quot;https://meta.stackexchange.com/q/333089/275609&quot;&gt;relicensing&lt;/a&gt;. More and more, I feel uneasy associating with and monetarily benefiting SE through my participation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In more practical terms, I'm not confident that Stack Exchange Inc. will remain financially solvent and keep their servers running in the years to come. &lt;a href=&quot;https://meta.stackexchange.com/questions/303005/what-happened-with-the-stack-overflow-layoffs-11-2017&quot;&gt;Large layoffs&lt;/a&gt; in the past, &lt;a href=&quot;https://meta.stackoverflow.com/a/387629&quot;&gt;new VC funding&lt;/a&gt; forcing aggressive monetization, and a &lt;a href=&quot;https://stackoverflow.blog/2019/09/24/announcing-stack-overflows-new-ceo-prashanth-chandrasekar/&quot;&gt;just-appointed new CEO&lt;/a&gt; make me uncertain for SE's future.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Separately, having our own site could free us from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8350/20260&quot;&gt;limitations of a format designed for Q&amp;amp;A&lt;/a&gt; and let us implement features tailored to challenges and code golf. Consider the flaws of SE we've had to wrestle with, like &lt;a href=&quot;https://meta.stackexchange.com/q/9731/275609&quot;&gt;FGITW&lt;/a&gt; and &lt;a href=&quot;https://meta.stackexchange.com/q/317418/275609&quot;&gt;HNQ&lt;/a&gt; encouraging &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7150/20260&quot;&gt;boring challenges&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/13128/20260&quot;&gt;trivial solutions&lt;/a&gt;, fostering a culture that &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=38427698#38427698&quot;&gt;led ais523 to delete their account&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Planning for the future&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should SE die in body or in spirit, I'd very much like our code golf community to keep going. And were this to happen, I think we'd be in a much better position to have put some thought into plans to migrate off site in advance.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't take a suggestion to move lightly, or even necessarily favor it myself at this point. Stack Exchange has provided us with loads of support, infrastructure, and publicity. They have graciously treated us as a real SE site even though our challenge-based format is a round peg in their square Q&amp;amp;A hole. They recently made us a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/17760/20260&quot;&gt;custom site design&lt;/a&gt; and supported our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/17612/20260&quot;&gt;unusual renaming&lt;/a&gt;. We may not fully appreciate how much SE provides until we have to handle it all ourselves, especially for us non-mods who aren't privy to sensitive issues being resolved discreetly behind the scenes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An effort to build our own site, &lt;a href=&quot;https://chat.stackexchange.com/transcript/68212&quot;&gt;Axtell&lt;/a&gt;, has made &lt;a href=&quot;https://github.com/Axtell&quot; rel=&quot;nofollow noreferrer&quot;&gt;amazing progress&lt;/a&gt; but has gone on hiatus. Perhaps it could be revived with renewed interest.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2019-09-30T14:51:09.000" LastActivityDate="2020-02-28T23:20:35.347" Title="Should we consider planning a move off StackExchange?" Tags="|discussion|site-health|" AnswerCount="5" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="18137" PostTypeId="2" ParentId="18136" CreationDate="2019-09-30T14:50:55.547" Score="29" Body="&lt;p&gt;&lt;strong&gt;After seeing the updated COC, I'm going to contribute as little as possible. I still sometimes need to find existing answers, but I refuse to contribute answers or content to a website under such leadership.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;I'm up for finding/creating a better community.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://meta.stackexchange.com/a/334269/285610&quot;&gt;Most Important Post I've found so far&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This contains the comments that the moderator (Monica) made before Monica was fired. It shows just how messed up SE is that they fired a mod for that. In addition, the question itself shows how inadequate SE's response is, and the other answers provide more insight as to what we as a community whole want to see from SE.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.theregister.co.uk/2019/10/01/stack_exchange_controversy/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Relevant News Story&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Stack Exchange has does a decent job so far in helping us out with our custom requests and designs.&lt;/p&gt;&#xA;&lt;p&gt;Unfortunately, their recent controversial choices and leadership seem to be in conflict with the best interests of its users. We don't desire a thought-police Question/Biased Answer site where they can change content licensing when they want. We need a site that reflects our desires for transparency, trustworthiness, and level-headed moderation, a place where competing views may all be voiced and discussed without fear of being shut down because it's not the &amp;quot;right&amp;quot; one.&lt;/p&gt;&#xA;&lt;p&gt;If we as a community can agree that this site no longer meets our needs, then perhaps it is time to move.&lt;/p&gt;&#xA;&lt;p&gt;Personally, I think we can wait another week or two to see how Stack Exchange responds, since they haven't yet, but after that we should maybe hold a referendum or meeting or debate or something.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;This issue seems to be complex.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;To some, it's an issue of minority rights. To others, it's about the CC-BY-SA update and its (non-)legality. To many, it includes what happened in the past. And to most, it makes people mad or upset in one way or another &lt;em&gt;[citation needed]&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;CC-BY-SA 4.0&lt;/h3&gt;&#xA;&lt;p&gt;I think we can all agree that SE &lt;a href=&quot;https://meta.stackexchange.com/a/333094/285610&quot;&gt;doesn't have the right&lt;/a&gt; to upgrade our content from 3.0 to 4.0.&lt;/p&gt;&#xA;&lt;h3&gt;About mod removal and CoC&lt;/h3&gt;&#xA;&lt;p&gt;Having glanced at some of the new SE meta posts, it seems that a mod was removed because the director thought they &lt;em&gt;might in the future&lt;/em&gt; violate an &lt;a href=&quot;https://meta.stackexchange.com/a/334040/285610&quot;&gt;upcoming change&lt;/a&gt; to the Code of Conduct. This is not appropriate.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Personal view (TLDR, freedom of speech is important)&lt;/strong&gt;: I think that people should be able to object to being forced to use specific pronouns. It's not misgendering if someone uses your username online instead of your pronouns, because we are all (relatively) anonymous users online. You have the right to ask for someone to refer to you a certain way, but you shouldn't have the right to force someone to say what they don't agree with. While it may make you feel more welcome by receiving affirmation, it makes the other user feel &lt;em&gt;un&lt;/em&gt;welcome. Respecting differing views is important, and quite frankly, if someone is using a name/username/alias to refer to a user instead of pronouns, that is a good compromise. I rarely use pronouns to refer to users on SE because I don't know anyone here personally.&lt;/p&gt;&#xA;&lt;p&gt;So in summary, I agree with Monica, and if Stack Exchange starts policing speech as &amp;quot;hateful&amp;quot; that is not hateful, but is rather just disagreeing with their views, and begins firing mods without a discussion or chance to work through the problem, it shows they care more about their power and ideals than about the entirety of their user-base.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;In the meantime,&lt;/strong&gt; I have deliberately not been checking the review queue. I have not been golfing much lately, but I was visiting the site and meta nearly every day, and more than 12% &lt;em&gt;of all reviews on meta&lt;/em&gt; are by me.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;(Sorry for bumping, but we are still processing what is happening, so I will edit this as new ideas are brought forth.)&lt;/p&gt;&#xA;" OwnerUserId="34718" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-10-10T20:31:03.290" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18140" PostTypeId="2" ParentId="2140" CreationDate="2019-09-30T20:54:24.480" Score="-1" Body="&lt;h1&gt;Mirror, Mirror, on the wall. Who's the fairest of them all?&lt;/h1&gt;&#xA;&lt;p&gt;Well, you know it's Snow White, and the evil Queen is at it again. Will Snow White be saved? Will she fall asleep once again? Will the Prince find her?&lt;/p&gt;&#xA;&lt;h1&gt;Challenge:&lt;/h1&gt;&#xA;&lt;p&gt;Given an arbitrary number (&amp;gt;= 2) of possibly duplicated hexadecimal color values (ranging from #000000 to #FFFFFF) and paired strings, calculate the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If #FF0800 (Candy apple red) appears in the input, return &amp;quot;Return to Sleeping Death&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;If #000000 appears in the input, return &amp;quot;Saved by Grumpy&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;If #A98AC7 or #111111 appears in the input, return &amp;quot;Saved by Happy&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;If #21E88E or #222222 appears in the input, return &amp;quot;Saved by Sleepy&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;If #32DCD5 or #333333 appears in the input, return &amp;quot;Saved by Bashful&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;If #43D11C or #444444 appears in the input, return &amp;quot;Saved by Sneezy&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;If #54C563 or #555555 appears in the input, return &amp;quot;Saved by Dopey&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;If #65B9AA or #666666 appears in the input, return &amp;quot;Saved by Doc&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;If #76ADF1 or #777777 appears in the input, return &amp;quot;Saved by the Seven Dwarfs&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;If #FFFAFA (Snow) appears in the input, return &amp;quot;Saved by Love's first kiss&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;If an F variant appears in the input, return &amp;quot;Press F to pay respects to Snow White&amp;quot;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An F variant is any number that contains at least one &lt;code&gt;F&lt;/code&gt; in its hexadecimal form, and is otherwise all &lt;code&gt;0&lt;/code&gt;s (e.g. #0FF0F0, #FFFFFF, #00000F, #F00F00)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;If &lt;strong&gt;multiple&lt;/strong&gt; of the preceding occur, return the &amp;quot;fairest&amp;quot; answer. The &amp;quot;fairest&amp;quot; answer is calculated as follows:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For all N occurrences of special color values, choose the (N-1)/2-th (truncating division) occurrence. The associated special output is the &amp;quot;fairest&amp;quot; answer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;em&gt;&amp;quot;Appears in the input&amp;quot; here refers to only the hexadecimal color values, and not to the paired strings.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If none of the preceding occur, return the &amp;quot;fairest&amp;quot; answer. The &amp;quot;fairest&amp;quot; answer is calculated as follows:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take the hexadecimal color value at the end of input values, write it down, and exclude that single color-string pair from consideration as the &amp;quot;fairest&amp;quot; answer&lt;/li&gt;&#xA;&lt;li&gt;Show its binary form to the mirror, computing a reflection of only the last 24 (#FFFFFF is the mask) bits.&lt;/li&gt;&#xA;&lt;li&gt;Choose the hexadecimal color with least Hamming distance from the reflection. If there are multiple (N) such colors, choose the middle ((N-1)/2-th, truncating division) instance of the color. The &amp;quot;fairest&amp;quot; answer is the associated string for the color.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Inputs:&lt;/h1&gt;&#xA;&lt;p&gt;A sequence of hexadecimal color values and String values separated by a space. The input may also be read as two separate sequences of hexadecimal color values and String values, or a single sequence of 2-tuples (either &lt;code&gt;(hexValue, stringValue)&lt;/code&gt; or &lt;code&gt;(stringValue, hexValue)&lt;/code&gt; is permissible, as long as the ordering is consistent across all 2-tuples).  Input order matters - for each index, the corresponding element in the supply of color values is &amp;quot;associated&amp;quot; with the corresponding element in the supply of String values, and duplicates can affect the &amp;quot;fairest&amp;quot; answer. The effect is something like &lt;code&gt;Function(List(HexColorValue),List(AssociatedStrings)) -&amp;gt; &amp;quot;fairest&amp;quot; answer&lt;/code&gt;. Hexadecimal color values may be represented as either (your choice of) a String &amp;quot;#&amp;quot;+6 digits, or 6 digits alone, as long as the representation is consistent across all color values.&lt;/p&gt;&#xA;&lt;p&gt;Here's an example input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;76ADF1 Return to Sleeping Death&#xA;2FE84E Return whence ye came!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here's another example input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2FE84E Return to Sender&#xA;4FFAFC Return of the Obra Dinn&#xA;2FE84E Return to the house immediately, young lady!&#xA;2FE84E Return to Sleeping Death&#xA;2FE84E Return of the Jedi&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here's the third example input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2FE84E Return to Sender&#xA;4FFAFC Return of the Obra Dinn&#xA;2FE84E Return to the house immediately, young lady!&#xA;2FE84E Return to Sleeping Death&#xA;7217F8 Return of the King&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here's the final sample input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;F4A52F Eating hearts and livers&#xA;F4A52F Eating apples&#xA;F4A52F Eating porridge&#xA;F4A52F Eating candy houses&#xA;F4A52F A Modest Proposal&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Outputs:&lt;/h1&gt;&#xA;&lt;p&gt;The &amp;quot;fairest&amp;quot; answer as computed by the specified logic. For example, on the first sample input, the &amp;quot;fairest&amp;quot; answer would be &lt;strong&gt;&lt;code&gt;Saved by the Seven Dwarfs&lt;/code&gt;&lt;/strong&gt;, due to the special hex color &lt;code&gt;76ADF1&lt;/code&gt; appearing within the input.&lt;/p&gt;&#xA;&lt;p&gt;In the second sample, there are no special inputs. First, we take &amp;quot;2FE84E Return of the Jedi&amp;quot;, which has value #2FE84E. In binary, this is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;001011111110100001001110&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We take the reflection from the mirror, getting:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;011100100001011111110100&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We compare it against &lt;code&gt;2FE84E (001011111110100001001110)&lt;/code&gt; and &lt;code&gt;4FFAFC (010011111111101011111100)&lt;/code&gt;, which have Hamming distances of 18 and 12 from the reflection, respectively. Since #4FFAFC has the uniquely lowest Hamming distance from the reflection, the &amp;quot;fairest&amp;quot; answer is &lt;strong&gt;&lt;code&gt;Return of the Obra Dinn&lt;/code&gt;&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;In the third sample input, there are no special inputs. First, we take &amp;quot;7217F8 Return of the King&amp;quot;, which has value #7217F8. In binary, this is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;011100100001011111111000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We take the reflection from the mirror, getting:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;000111111110100001001110&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We compare it against &lt;code&gt;2FE84E (001011111110100001001110)&lt;/code&gt; and &lt;code&gt;4FFAFC (010011111111101011111100)&lt;/code&gt;, which have Hamming distances of 2 and 8 from the reflection, respectively. All 3 instances of hexadecimal color value #2FE84E have minimum Hamming distance from the reflection, so we take the &lt;code&gt;(3-1)/2&lt;/code&gt;=&lt;code&gt;1th&lt;/code&gt; instance (0-indexed) of #2FE84E. Therefore, the &amp;quot;fairest&amp;quot; answer is &lt;strong&gt;&lt;code&gt;Return to the house immediately, young lady!&lt;/code&gt;&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;In the last sample input, there are no special inputs. First, we take &amp;quot;F4A52F A Modest Proposal&amp;quot;, which has value #F4A52F. In binary, this is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1111010011001100101111&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We take the reflection from the mirror, getting:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1111010011001100101111&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We compare it against &lt;code&gt;F4A52F (1111010011001100101111)&lt;/code&gt;, which has Hamming distance 0 from the reflection. All instances of hexadecimal color value #F4A52F have minimum Hamming distance from the reflection. There are &lt;em&gt;FOUR&lt;/em&gt; instances of #F4A52F, because we always exclude the last hexadecimal color instance from evaluation. Therefore, we take the &lt;code&gt;(4-1)/2=1th&lt;/code&gt; instance (0-indexed) of #F4A52F, and the &amp;quot;fairest&amp;quot; answer is &lt;strong&gt;&lt;code&gt;Eating apples&lt;/code&gt;&lt;/strong&gt;. &lt;em&gt;If&lt;/em&gt; you don't exclude the last value from consideration, you actually get the &lt;code&gt;(5-1)/2=2th&lt;/code&gt; instance of #F4A52F (&lt;code&gt;Eating porridge&lt;/code&gt;), which is wrong.&lt;/p&gt;&#xA;&lt;h1&gt;Rules:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No standard loopholes&lt;/li&gt;&#xA;&lt;li&gt;Input/output taken via standard input/output methods.&lt;/li&gt;&#xA;&lt;li&gt;The output must be exactly equal to the &amp;quot;fairest&amp;quot; answer&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Scoring:&lt;/h1&gt;&#xA;&lt;p&gt;This is code golf, so shortest program wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;&lt;em&gt;Posted~ you can &lt;a href=&quot;https://codegolf.stackexchange.com/questions/194462/mirror-mirror-on-the-wall-whos-the-fairest-of-them-all&quot;&gt;see it here&lt;/a&gt;&lt;/em&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="89519" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-10-18T18:45:27.847" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18141" PostTypeId="2" ParentId="18136" CreationDate="2019-09-30T22:23:37.710" Score="39" Body="&lt;h1&gt;It wouldn't be a &lt;em&gt;move&lt;/em&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Rather, the new site would be &lt;strong&gt;another community&lt;/strong&gt; (built on the experience of this). Users of the new site would not necessarily be the same we now have on this site. The current Code Golf site &lt;strong&gt;would not cease to exist&lt;/strong&gt; just because we created another one. Many users would be in both communities at the same time. So, I don't see that hypothetical situation as a &lt;em&gt;move&lt;/em&gt;, but rather as a &lt;strong&gt;coexistence&lt;/strong&gt; of the two sites, possibly &lt;strong&gt;competing&lt;/strong&gt; with each other.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's also the issue, noted by @manatwork, of potential &lt;strong&gt;cross-duplicates&lt;/strong&gt; between both sites. Would we close a challenge as a &quot;duplicate&quot; because it already exists in the current site?&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;There are issues that would need to be sorted out first&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;s&gt;Moving to&lt;/s&gt; creating an alternative site is a lot of work, and (as pointed out in the question) running it will raise some issues. How much &lt;strong&gt;financial support&lt;/strong&gt; does it require? How to get &lt;strong&gt;visibility&lt;/strong&gt;? Does it have to have employees, or can it be run on a &lt;strong&gt;volunteer&lt;/strong&gt; basis only?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we really want to start planning for the site, we probably need to deal with these (boring) issues before getting into the programming and technical aspects. Because if those issues can't be solved there is no point in creating a new site.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;I don't see it as necessary, at least for now&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Clearly, the way the Stack Exchange community has been treated by the Stack Exchange company is... far from optimal to say the least. And we could start working on a site design just in case things get worse. But as of today &lt;strong&gt;I don't think there's a need&lt;/strong&gt; or motivation for that. I dislike the events mentioned in the question (and I hope to have Dennis back as a mod after things are sorted out); but overall I feel pretty happy here, in the current site, with its awesome community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;If&lt;/em&gt; things get worse (and I really hope they won't), &lt;em&gt;then&lt;/em&gt; we would have the motivation.&lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2019-10-13T15:56:33.457" LastActivityDate="2019-10-13T15:56:33.457" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="18146" PostTypeId="1" CreationDate="2019-10-02T16:45:59.290" Score="10" ViewCount="327" Body="&lt;p&gt;According to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8558/when-can-challenges-be-reused&quot;&gt;this meta post&lt;/a&gt; we can never recreate old challenges. Of course not, its a duplicate. Makes sense to me. No problems.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/2078/the-alphabet-in-programming-languages/&quot;&gt;Except this challenge can no longer be answered&lt;/a&gt; with a language newer than the challenge, even though the requirement that &quot;languages be newer than the challenge&quot; is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12877/lets-allow-newer-languages-versions-for-older-challenges&quot;&gt;no longer a valid&lt;/a&gt;. If I want to be able to solve that specific challenge (&quot;output a-z&quot;) with newer languages, I'd have to post a new challenge first. But it's a duplicate.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, which takes precedence:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Challenge spec disallowing new languages&lt;/li&gt;&#xA;&lt;li&gt;No duplicate challenges&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Or do we recreate the challenge, remove the date specification, and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1875/closing-old-question-as-duplicate-of-a-new-one&quot;&gt;close the older one as a duplicate of the newer&lt;/a&gt;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;Yes, this meta post is in response to &lt;a href=&quot;https://codegolf.stackexchange.com/a/186477/47990&quot;&gt;my answer&lt;/a&gt; (and at least two others) being deleted, however as I was not the &lt;em&gt;first&lt;/em&gt; person to answer the challenge recently: I had assumed that the date-invalidity to have been true when I answered and I would not have seen the challenge unless it had been answered by another user first.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="47990" LastEditorUserId="194" LastEditDate="2019-10-03T10:22:43.860" LastActivityDate="2019-10-08T16:25:44.553" Title="When can challenges be reused? If never, then why can't I answer?" Tags="|discussion|reposting|" AnswerCount="3" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18147" PostTypeId="2" ParentId="18146" CreationDate="2019-10-02T17:41:58.947" Score="1" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/155018/the-programming-language-quiz-mark-ii-cops&quot;&gt;We have reposted challenges before&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Personally, I disagree with that meta ruing. It's 3 years old, multiple challenges have been revived/reused/reposted since then without issue, and we already &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11123/66833&quot;&gt;allow&lt;/a&gt; certain types of challenges to be reposted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe that challenges should be ok to be reposted, with a few constraints:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Obviously, still active challenges, no matter how old they are, should not be reused. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world&quot;&gt;Hello, World!&lt;/a&gt; is 4 years old, but still gets multiple answers a month. How long a challenge is &quot;active&quot; for is, IMO, another matter for discussion (although my gut leans towards longer than a year or two).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the challenge specifically prevents you from answering it &lt;em&gt;now&lt;/em&gt; rather than when it was posted, it should be allowed to be recreated. The cited challenge (The alphabet in programming languages) has this listed as one of its rules:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The programming language should have existed prior to the writing of this post, on this eighteenth of April 2011.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This specifically disallows you from using a new language, rather than being one of the thousands that disallowed newer languages because it was site policy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/11305/print-this-multiplication-table&quot;&gt;this challenge&lt;/a&gt; is from 2013, but there is no rule preventing you from choosing a random language and answering it, so I see no value in reusing it. For challenges saying that the language must already exist (as was site default for many years), I believe &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12877/lets-allow-newer-languages-versions-for-older-challenges?noredirect=1&amp;amp;lq=1&quot;&gt;this meta ruling&lt;/a&gt; overrules that.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The challenge author should be fine with the challenge being reposted. Its just respectful to let someone know when their challenge is being redone, as the newer version is likely to take traffic away from the older one. Obviously, this gets a little more difficult if the author is no longer active, but that leads on to my next bullet point.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Meta agrees that its worth posting. As you can see from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14272/66833&quot;&gt;my experience with this&lt;/a&gt;, I posted to meta beforehand asking if it was acceptable to the community to do this. I doubt that we'll be wanting to revive multiple challenges a day, or even a week&lt;sup&gt;1&lt;/sup&gt;, so its unlikely that requests like this will clutter the front page, and, given that the community will decide whether the repost is a duplicate, it's good to 'have their permission' (for lack of a better term).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;1: And if we are, then that in itself becomes an issue, one which can be addressed if we ever cross that bridge&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, in conclusion, I'm all for reposting certain, inactive challenges, so long as the community sees value in redoing them.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2019-10-02T17:41:58.947" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18148" PostTypeId="1" AcceptedAnswerId="18153" CreationDate="2019-10-03T00:21:40.507" Score="1" ViewCount="141" Body="&lt;p&gt;I planned to ask a code golf involving GPS:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;What's the current zodiac?&lt;/strong&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;Objective:&lt;/strong&gt; Display the emoji of the zodiac of current time, according to your location.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;strong&gt;Rules:&lt;/strong&gt;&lt;br&gt;&#xA;  1. There's no input.&lt;br&gt;&#xA;  2. If your system cannot access GPS, use your system locale and your system time.&lt;br&gt;&#xA;  &lt;em&gt;(blah blah blah)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;But I doubt whether golfing languages can access GPS.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, can golfing languages use GPS, or at least system locale and system time?&lt;/p&gt;&#xA;" OwnerUserId="89459" LastActivityDate="2019-10-03T10:39:28.137" Title="Code golf involving GPS?" Tags="|discussion|code-golf|asking-questions|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18151" PostTypeId="2" ParentId="2140" CreationDate="2019-10-03T08:22:20.517" Score="1" Body="&lt;h2&gt;Shortest way to get an EOF Error&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It's simple, simply write the shortest code to raise an EOF Error. An EOF Error happens when the language expects more code to be entered into the source code; however, the language encounters an EOF character. So here is a sample Python program to throw an EOF error.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;id(&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Python expects more code to be entered, but EOF is entered instead. Therefore it throws an &quot;EOF Error&quot; (technically a Syntax Error though, but the interpreter says &lt;code&gt;unexpected EOF while parsing&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To simplify that, output text to STDERR containing the string &lt;code&gt;EOF&lt;/code&gt;. Normally a language will exit after outputting to STDERR with an error, so if you are hard-coding the value out to STDERR, you should also exit the program with a 1 value.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input/Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your input will be none; however, you should output a message to STDERR that proves that the program generates an EOFError.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Since this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the shortest answer wins.&lt;/li&gt;&#xA;&lt;li&gt;No standard loopholes please.&lt;/li&gt;&#xA;&lt;li&gt;Any method approved by Standard I/O is allowed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/error-message&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;error-message&amp;#39;&quot; rel=&quot;tag&quot;&gt;error-message&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Feedback&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this clear enough?&lt;/li&gt;&#xA;&lt;li&gt;I don't believe this is a duplicate (I found &lt;a href=&quot;https://codegolf.stackexchange.com/questions/188973/shortest-way-to-get-a-typeerror&quot;&gt;this&lt;/a&gt;, but it's restricted to a single language), but does anyone recognise this?&lt;/li&gt;&#xA;&lt;li&gt;The tags as code-golf, error-message. Anything else?&lt;/li&gt;&#xA;&lt;li&gt;Any further feedback?&lt;/li&gt;&#xA;&lt;li&gt;Is it possible to have trivial answers on most languages for this challenge?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-10-04T00:23:35.330" LastActivityDate="2019-10-04T00:23:35.330" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18152" PostTypeId="2" ParentId="18146" CreationDate="2019-10-03T10:29:36.377" Score="5" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;So, which takes precedence:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Challenge spec disallowing new languages&lt;/li&gt;&#xA;  &lt;li&gt;No duplicate challenges&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&quot;&lt;em&gt;Precedence&lt;/em&gt;&quot; is not how it works.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When a particular, unusual, case arises which introduces a tension between two policies, the thing to do is to take the &lt;em&gt;case&lt;/em&gt; to meta. This scenario isn't so common that we need to have a general policy about it. Ask a meta question about the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/specific-question&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;specific-question&amp;#39;&quot; rel=&quot;tag&quot;&gt;specific-question&lt;/a&gt;, tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/reposting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;reposting&amp;#39;&quot; rel=&quot;tag&quot;&gt;reposting&lt;/a&gt;, and set out the options and the arguments. As you can see by looking at those tags, this has happened before, although not often.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;em&gt;(This approach would also give you the opportunity to explain why it's worth reposting such a trivial question as the one you mention).&lt;/em&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2019-10-03T10:29:36.377" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18153" PostTypeId="2" ParentId="18148" CreationDate="2019-10-03T10:39:28.137" Score="4" Body="&lt;p&gt;Going one step behind language support, what is this concept of &lt;em&gt;system locale&lt;/em&gt;? I've run code on systems which don't even have the concept of &lt;em&gt;system time&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That aside, how should people test their code if it relies on system properties?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is almost always preferable to supply times, timezones, etc. as inputs via stdin / arguments / other standard mechanisms. (My memory is that it used to say this explicitly in the tag wiki for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt;, before that tag was synonimised).&lt;/p&gt;&#xA;" OwnerUserId="194" LastActivityDate="2019-10-03T10:39:28.137" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18154" PostTypeId="2" ParentId="2140" CreationDate="2019-10-03T18:57:44.583" Score="3" Body="&lt;h1&gt;Code Golf Measurer © 2019&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hexadecimal&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hexadecimal&amp;#39;&quot; rel=&quot;tag&quot;&gt;hexadecimal&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Hexdumps used with &lt;code&gt;xxd&lt;/code&gt; look something like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;00000000: 666f 6f20 6261 7220 7370 616d 2065 6767  foo bar spam egg&#xA;00000010: 730a                                     s.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your task is to convert a hexdump in this form in to the number of bytes used.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Usual loopholes forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest valid answer in bytes wins.&lt;/li&gt;&#xA;&lt;li&gt;You may or may not include the newline at the end of text (&lt;code&gt;0a&lt;/code&gt;). This means that if the hexdump ends in a newline (&lt;code&gt;0a&lt;/code&gt;), that input may have it's output reduced by one.&lt;/li&gt;&#xA;&lt;li&gt;An empty input must output 0.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;00000000: 4865 6c6c 6f2c 2077 6f72 6c64 2120 4865  Hello, world! He&#xA;00000010: 6c6c 6f2c 2077 6f72 6c64 210a            llo, world!.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;returns 27 or 26&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;00000000: 0a                                       .&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;returns 1 or 0&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;00000000: 6368 616c 6c65 6e67 650a                 challenge.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;returns 10 or 9&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;00000000: 4865 6c6c 6f2c 2077 6f72 6c64 21         Hello, world!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;returns 13&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;returns 0&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this clear?&lt;/li&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Other tags?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="88762" LastEditorUserId="88762" LastEditDate="2019-10-05T14:47:57.983" LastActivityDate="2019-10-05T14:47:57.983" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18155" PostTypeId="2" ParentId="2140" CreationDate="2019-10-03T23:49:08.133" Score="1" Body="&lt;h1&gt;A Musical Tuner&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/music&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;music&amp;#39;&quot; rel=&quot;tag&quot;&gt;music&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Oh no! My tuner's batteries ran out, I need to play in a concert in a few minutes, and I need to know if my instrument's in tune! I need this tuner quick, so it needs to be short.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Background&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In music, all notes are given a letter from &lt;code&gt;A-G/H&lt;/code&gt;, an optional sharp/flat &lt;code&gt;♯/♭&lt;/code&gt;, and a number specifying what octave it is in, starting from 0. This is called &lt;a href=&quot;https://en.wikipedia.org/wiki/Scientific_pitch_notation&quot; rel=&quot;nofollow noreferrer&quot;&gt;scientific pitch notation&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In &lt;a href=&quot;https://en.wikipedia.org/wiki/Equal_temperament&quot; rel=&quot;nofollow noreferrer&quot;&gt;equal temperament&lt;/a&gt;, &lt;span class=&quot;math-container&quot;&gt;\$\sqrt 2 \approx 1.05946 \$&lt;/span&gt; is an important ratio, as used in the formula &lt;span class=&quot;math-container&quot;&gt;$$ P_n = P_a (\sqrt2)^{n-a} $$&lt;/span&gt; where&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ P_n \$&lt;/span&gt; is the desired frequency, in hertz.&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; is the number of keys from the left on a piano the desired note is.&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ P_a \$&lt;/span&gt; is the reference frequency, in hertz.&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ a \$&lt;/span&gt; is the number of keys from the left on a piano the reference note is.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;A piano begins at &lt;span class=&quot;math-container&quot;&gt;\$ A_0 \$&lt;/span&gt; as the 1st key, and with reference frequency of &lt;span class=&quot;math-container&quot;&gt;\$ A_4 = P_a = 440 \$&lt;/span&gt; Hz, at the 49th key.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The whole step, the tonal distance between two notes separated by one key, is divided into 100 cents. A half step is exactly 50 cents.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a full program that, when given a decimal number in hertz, outputs the closest note in scientific pitch notation, and how far it is from that note in cents.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A positive number in hertz. This can be a string, number, list of whole number and decimal, etc. You can always assume this to be positive, and a number with maximum 3 decimal places.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input is in the range &lt;span class=&quot;math-container&quot;&gt;\$ 27.5 \le P_n \le 4186 \$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A note in scientific pitch notation, and how many cents it is from, in the form&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;[Note letter][Sharp/Flat][Octave number][+/-][Cents]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a note is determined to be close to a natural note, no sharps or flats should be output.&lt;/li&gt;&#xA;&lt;li&gt;Output either sharps or flats.&lt;/li&gt;&#xA;&lt;li&gt;Sharps can be either &lt;code&gt;♯/#&lt;/code&gt; , and flats either &lt;code&gt;♭/b&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Octave number ranges from 0 to 8.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Other Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; apply.&lt;/li&gt;&#xA;&lt;li&gt;Shortest code wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input --&amp;gt; Output&#xA;440 --&amp;gt; A4&#xA;261.626 --&amp;gt; C4&#xA;24.995 --&amp;gt; G♯0-8 (OR G#0-8)&#xA;1320.068‬ --&amp;gt; E6+1&#xA;3674.882‬ --&amp;gt; B♭7-13 (OR Bb7-13 OR A7+13)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2019-10-04T12:23:35.727" LastActivityDate="2019-10-04T12:23:35.727" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18156" PostTypeId="2" ParentId="18133" CreationDate="2019-10-04T00:45:23.343" Score="41" Body="&lt;p&gt;If I hadn't &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14876/20469&quot;&gt;resigned&lt;/a&gt; a year and a half ago, I'd be doing it now.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my time as a moderator you were an inspiration to me, Dennis. I'm sure your decision was not made lightly, and I think what you've chosen further underscores what we all already knew about you: your commitment to fostering a good community.&lt;/p&gt;&#xA;" OwnerUserId="20469" LastActivityDate="2019-10-04T00:45:23.343" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18160" PostTypeId="2" ParentId="2140" CreationDate="2019-10-04T18:40:44.953" Score="1" Body="&lt;h2&gt;Subtract two numbers with Rule 110&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Background :&lt;/strong&gt; &lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is known that Rule 110 is Turing complete, but in general, I have seen a lack of actual programs that utilize this property of Rule 110, so I propose that we do something about it ;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Some explanation&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rule 110 is a one dimensional &lt;a href=&quot;http://mathworld.wolfram.com/CellularAutomaton.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;cellular automaton&lt;/a&gt;, consisting of cells on/off, and the neighbors of those cells change the cell in the next iteration. &#xA;&lt;a href=&quot;https://en.wikipedia.org/wiki/Rule_110&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt; is a page detailing how rule 110 works, but here is also a basic table that summarizes the rule (the center number is the current cell's state, the two on the outside are its neighbors, the number to the right of the equals is the state for the next generation)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;111 = 0&#xA;110 = 1&#xA;101 = 1&#xA;100 = 0&#xA;011 = 1&#xA;010 = 1&#xA;001 = 1&#xA;000 = 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I want you to subtract two numbers, unsigned, eight bits long (No handling of negatives, input one will always be greater than or equal to input two)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note : Index 0 is where the first 1 starts, which denotes your program, simply because the &quot;tape&quot; is infinite, and leading zeroes cannot be distinguished, so it must start at the first one&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input have to be inputted in unary, and must be inputted at a set interval from a specific point from the beginning of your program, and the inputs must not overlap. That may sound confusing, but here are some examples.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First, clarification on input. Input needs to be 8 bits long, and must be formatted to be so, if you had zero, it would be inputted as follows : 00000000, 2 would be 00000011, 7 would be 01111111 etc..., up to eight.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first input is at intervals of 2 starting at index 1, the second input has an interval of 3 and starts at 25&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 _ 01 _ 01 _ 10 _ 10 _ 10 _ 10 _ 10 _ 101 = 011 = 111 = 000 = 110 = 110 = 110 = 001 = 1010100101&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The &quot;_&quot; is the first input, the &quot;=&quot; is the second input, they cannot overlap, and the interval represents the set distance that they must be seperated by. The bits themselves are inputed as ones, so if my first input was 00000111 and my second input 00111111 then my program would look like this&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 0 01 0 01 0 10 0 10 0 10 1 10 1 10 1 101 0 011 0 111 1 000 1 110 1 110 1 110 1 001 1 1010100101&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The output is also defined in a similar fashion, from the start of the program (denoted by a 1) at specific intervals the bits represent the unary output&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;input one = 00011111, input two = 00000011&lt;/p&gt;&#xA;&#xA;&lt;p&gt;output = 00000111&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Score&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The number of bytes from the first one to the last one in the initial program.&#xA;Lowest score wins! Good luck!!!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I thought this was ready for the main, but it wasn't, so if ya'll have any problems, please let me know and I'll address them, as I will for the problems already proposed&lt;/p&gt;&#xA;" OwnerUserId="85185" LastEditorUserId="85185" LastEditDate="2019-10-19T01:37:55.493" LastActivityDate="2019-10-19T01:37:55.493" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18161" PostTypeId="2" ParentId="1061" CreationDate="2019-10-04T19:14:24.050" Score="3" Body="&lt;h2&gt;Infinite output programs that wouldn't give all output given infinite resources&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Example, loophole-violating code to output all integers:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;bigint i = 0;&#xA;for(;;) bigint_print(i++);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This would never output negative numbers, even given unlimited resources, so it does not fulfil the challenge's requirements. A program that does fulfil the requirements would be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;bigint i = 0;&#xA;for(;;) {&#xA;    bigint_print(i++);&#xA;    bigint_print(-i);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="43394" LastActivityDate="2019-10-04T19:14:24.050" CommentCount="4" CommunityOwnedDate="2019-10-04T19:14:24.050" ContentLicense="CC BY-SA 4.0" />
  <row Id="18163" PostTypeId="2" ParentId="2140" CreationDate="2019-10-05T18:16:50.143" Score="0" Body="&lt;h1&gt;Golf a new OEIS sequence.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge. The goal of this challenge is to create an integer sequence that is not in the &lt;a href=&quot;https://oeis.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS&lt;/a&gt; using the fewest possible number of bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program can either output an infinite list, or it can be a function from the natural numbers to the integers, which when evaluated on &lt;code&gt;1, 2, 3, 4,...&lt;/code&gt; gives a sequence that is not in the OEIS.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Restrictions&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Without any restrictions, this is a very easy challenge, we can simply write a program that prints out the constant sequence consisting of &lt;code&gt;33&lt;/code&gt;, &lt;a href=&quot;https://oeis.org/search?q=33%2C33%2C33%2C33%2C33%2C33%2C33%2C33%2C33%2C33%2C33%2C33%2C33%2C33%2C33%2C33%2C33&quot; rel=&quot;nofollow noreferrer&quot;&gt;for example&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In order to avoid accepting &quot;easy&quot; sequences like this, your proposed sequence cannot be a finite &lt;a href=&quot;https://en.wikipedia.org/wiki/Linear_combination&quot; rel=&quot;nofollow noreferrer&quot;&gt;linear combination&lt;/a&gt; or &lt;a href=&quot;https://en.wikipedia.org/wiki/Hadamard_product_(matrices)&quot; rel=&quot;nofollow noreferrer&quot;&gt;entrywise product&lt;/a&gt; of existing sequences or any rows or columns of &lt;a href=&quot;https://oeis.org/search?q=antidiagonal%20keyword%3atabl&amp;amp;sort=created&quot; rel=&quot;nofollow noreferrer&quot;&gt;existing tables&lt;/a&gt; in the OEIS.&lt;sup&gt;1&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, I want to avoid submissions that take an otherwise disallowed sequence and prepend some list (e.g. &lt;code&gt;3,1,1,1,1,1,1,1,1,1,1&lt;/code&gt;). Thus the above rule must stand even after ignoring the first &lt;code&gt;N&lt;/code&gt; terms of the sequence.&lt;sup&gt;2&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Post your source code, the first few terms of the sequence, and an explanation of what your source code is doing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's okay if your submission is not very mathematically interesting, but I'm hoping that one or two will be.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Lastly, if your sequence is disqualified by someone writing is as linear combinations of existing sequences, feel free to modify/fix it, but please don't delete it.)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; This rule disallows all polynomials in &lt;code&gt;n&lt;/code&gt;, for example, since these can be written as finite linear combinations of columns in &lt;a href=&quot;https://oeis.org/A009999/table&quot; rel=&quot;nofollow noreferrer&quot;&gt;A009999 read as a square array&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;2&lt;/sup&gt; This rule also disallows all &lt;a href=&quot;https://oeis.org/search?q=keyword%3Afini&quot; rel=&quot;nofollow noreferrer&quot;&gt;finite-length sequences&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note: I don't know if this challenge is totally silly, or if it has obvious loopholes, or if closing loopholes results in a challenge that is too difficult or arbitrary.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Any other restrictions? Any loosening of current restrictions?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="53884" LastActivityDate="2019-10-05T18:16:50.143" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18164" PostTypeId="2" ParentId="2140" CreationDate="2019-10-05T19:53:30.337" Score="0" Body="&lt;h1&gt;Draw a CE mark &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your input is the scaling factor &lt;code&gt;n&lt;/code&gt;. You must output an image of width &lt;code&gt;82n&lt;/code&gt; and height &lt;code&gt;48n&lt;/code&gt; (if you are generating a vector image, it should have that as its default size). The image will be either transparent or white, with the following regions in black:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The segment of a ring centred at &lt;code&gt;24n,24n&lt;/code&gt; of outer radius &lt;code&gt;20n&lt;/code&gt; and inner radius &lt;code&gt;14n&lt;/code&gt; that is left of the vertical line at &lt;code&gt;26n&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A copy of that segment displaced &lt;code&gt;34n&lt;/code&gt; to the right. The original rings would therefore exactly overlap if they were not segments.&lt;/li&gt;&#xA;&lt;li&gt;A rectangle with upper left corner at &lt;code&gt;44n,21n&lt;/code&gt; and lower right corner at &lt;code&gt;56n,27n&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2019-10-05T19:53:30.337" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18165" PostTypeId="2" ParentId="2140" CreationDate="2019-10-07T19:37:18.667" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/194141/gerrymander-north-carolina&quot;&gt;Moved&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="85259" LastEditorUserId="85259" LastEditDate="2019-10-10T11:54:25.387" LastActivityDate="2019-10-10T11:54:25.387" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18166" PostTypeId="2" ParentId="18136" CreationDate="2019-10-08T00:56:07.107" Score="19" Body="&lt;p&gt;Someone should just post &quot;Replicate CodeGolf&quot; as a challenge and we'll end up with the most efficiently coded online community in the history of the internet.&lt;/p&gt;&#xA;" OwnerUserId="85388" LastActivityDate="2019-10-08T00:56:07.107" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18167" PostTypeId="2" ParentId="18146" CreationDate="2019-10-08T16:25:44.553" Score="-1" Body="&lt;p&gt;EDIT: It seems I am mildly off topic and this particular issue I am addressing was solved two years ago, but I'm leaving this post around for the sake of posterity.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;The spirit of the law is important&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The primary purpose of the &quot;no new languages&quot; rule is to disallow specialized esolangs that make that particular problem trivial to solve. Perhaps we should revisit this approach in the default ruleset and create a new rule that is less of a low orbit ion cannon and more of a precision laser rifle in terms of what it bans.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Languages don't really compete with each other in general&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Java answers, for instance, are going to be much more verbose than APL or Perl. It doesn't really make sense for a solution in C++ to compete with a solution in 05AB1E. Even versions of the same language could make for a big enough difference on golfing to not really be competing; Python 2.7 vs 3.8 are the prime examples of this. It doesn't really make sense for new versions of an old language to be disqualified in old questions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think we should discourage questions that make languages compete with each other on byte count.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;My proposal&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I think the &quot;no new languages&quot; rule in the standard rules and loopholes should be supplanted by something like this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;You may not use a language that was designed to make the exact posted problem trivial. Typically, these are esolangs that were designed &lt;em&gt;after&lt;/em&gt; the creation of the challenge and a solution in such a language will often be 0 or 1 bytes long. This does not include multi-purpose golfing languages such as 05AB1E or V, but &lt;em&gt;does&lt;/em&gt; include comically overspecialized languages such as H9Q+.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="45613" LastActivityDate="2019-10-08T16:25:44.553" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18169" PostTypeId="2" ParentId="2140" CreationDate="2019-10-10T09:47:17.870" Score="0" Body="&lt;h1&gt;Typhoon: Where am I from? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/classification&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;classification&amp;#39;&quot; rel=&quot;tag&quot;&gt;classification&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h3&gt;Introduction&lt;/h3&gt;&#xA;&lt;p&gt;A typhoon is basically a hurricane in the northwestern Pacific region. Unlike hurricanes, typhoons are named by 14 regions, each providing 10 names, adding up to 140 names. The 140 names are used in a cyclic pattern; after the last name is used, the first one will be used again. The names may sometimes be retired, mainly because of the devastation the typhoon with those names have made.&lt;/p&gt;&#xA;&lt;p&gt;Here are the 140 names.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/hWZgv.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/hWZgv.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[Text-only]&#xA;&#xA;Region             Column 1   Column 2   Column 3   Column 4   Column 5   Column 6   Column 7   Column 8   Column 9   Column 10&#xA;-------------------------------------------------------------------------------------------------------------------------------&#xA;Cambodia           Damrey     Ampil      Kong-rey   Krosa      Nakri      Maysak     Krovanh    Chanthu    Trases     Nesat&#xA;China              Haikui     Wukong     Yutu       Bailu      Fengshen   Haishen    Dujuan     Dianmu     Mulan      Haitang&#xA;DPR Korea          Kirogi     Jongdari   Toraji     Podul      Kalmaegi   Noul       Surigae    Mindulle   Meari      Nalgae&#xA;Hong Kong, China   Yun-yeung  Shanshan   Man-yi     Lingling   Fung-wong  Dolphin    Choi-wan   Lionrock   Ma-on      Banyan&#xA;Japan              Koinu      Yagi       Usagi      Kajiki     Kammuri    Kujira     Koguma     Kompasu    Tokage     Yamaneko&#xA;Lao PDR            Bolaven    Leepi      Pabuk      Faxai      Phanfone   Chan-hom   Champi     Namtheun   Hinnamnor  Pakhar&#xA;Macao, China       Sanba      Bebinca    Wutip      Peipah     Vongfong   Linfa      In-fa      Malou      Muifa      Sanvu&#xA;Malaysia           Jelawat    Rumbia     Sepat      Tapah      Nuri       Nangka     Cempaka    Nyatoh     Merbok     Mawar&#xA;Micronesia         Ewiniar    Soulik     Mun        Mitag      Sinlaku    Saudel     Nepartak   Rai        Nanmadol   Guchol&#xA;Philippines        Maliksi    Cimaron    Danas      Hagibis    Hagupit    Molave     Lupit      Malakas    Talas      Talim&#xA;RO Korea           Gaemi      Jebi       Nari       Neoguri    Jangmi     Goni       Mirinae    Megi       Noru       Doksuri&#xA;Thailand           Prapiroon  Mangkhut   Wipha      Bualoi     Mekkhala   Atsani     Nida       Chaba      Kulap      Khanun&#xA;U.S.A.             Maria      Barijat    Francisco  Matmo      Higos      Etau       Omais      Aere       Roke       Lan&#xA;Viet Nam           Son-Tinh   Trami      Lekima     Halong     Bavi       Vamco      Conson     Songda     Sonca      Saola&#xA;&#xA;[JSON]&#xA;&#xA;{&amp;quot;Cambodia&amp;quot;:[&amp;quot;Damrey&amp;quot;,&amp;quot;Ampil&amp;quot;,&amp;quot;Kong-rey&amp;quot;,&amp;quot;Krosa&amp;quot;,&amp;quot;Nakri&amp;quot;,&amp;quot;Maysak&amp;quot;,&amp;quot;Krovanh&amp;quot;,&amp;quot;Chanthu&amp;quot;,&amp;quot;Trases&amp;quot;,&amp;quot;Nesat&amp;quot;],&amp;quot;China&amp;quot;:[&amp;quot;Haikui&amp;quot;,&amp;quot;Wukong&amp;quot;,&amp;quot;Yutu&amp;quot;,&amp;quot;Bailu&amp;quot;,&amp;quot;Fengshen&amp;quot;,&amp;quot;Haishen&amp;quot;,&amp;quot;Dujuan&amp;quot;,&amp;quot;Dianmu&amp;quot;,&amp;quot;Mulan&amp;quot;,&amp;quot;Haitang&amp;quot;],&amp;quot;DPR Korea&amp;quot;:[&amp;quot;Kirogi&amp;quot;,&amp;quot;Jongdari&amp;quot;,&amp;quot;Toraji&amp;quot;,&amp;quot;Podul&amp;quot;,&amp;quot;Kalmaegi&amp;quot;,&amp;quot;Noul&amp;quot;,&amp;quot;Surigae&amp;quot;,&amp;quot;Mindulle&amp;quot;,&amp;quot;Meari&amp;quot;,&amp;quot;Nalgae&amp;quot;],&amp;quot;Hong Kong, China&amp;quot;:[&amp;quot;Yun-yeung&amp;quot;,&amp;quot;Shanshan&amp;quot;,&amp;quot;Man-yi&amp;quot;,&amp;quot;Lingling&amp;quot;,&amp;quot;Fung-wong&amp;quot;,&amp;quot;Dolphin&amp;quot;,&amp;quot;Choi-wan&amp;quot;,&amp;quot;Lionrock&amp;quot;,&amp;quot;Ma-on&amp;quot;,&amp;quot;Banyan&amp;quot;],&amp;quot;Japan&amp;quot;:[&amp;quot;Koinu&amp;quot;,&amp;quot;Yagi&amp;quot;,&amp;quot;Usagi&amp;quot;,&amp;quot;Kajiki&amp;quot;,&amp;quot;Kammuri&amp;quot;,&amp;quot;Kujira&amp;quot;,&amp;quot;Koguma&amp;quot;,&amp;quot;Kompasu&amp;quot;,&amp;quot;Tokage&amp;quot;,&amp;quot;Yamaneko&amp;quot;],&amp;quot;Lao PDR&amp;quot;:[&amp;quot;Bolaven&amp;quot;,&amp;quot;Leepi&amp;quot;,&amp;quot;Pabuk&amp;quot;,&amp;quot;Faxai&amp;quot;,&amp;quot;Phanfone&amp;quot;,&amp;quot;Chan-hom&amp;quot;,&amp;quot;Champi&amp;quot;,&amp;quot;Namtheun&amp;quot;,&amp;quot;Hinnamnor&amp;quot;,&amp;quot;Pakhar&amp;quot;],&amp;quot;Macao, China&amp;quot;:[&amp;quot;Sanba&amp;quot;,&amp;quot;Bebinca&amp;quot;,&amp;quot;Wutip&amp;quot;,&amp;quot;Peipah&amp;quot;,&amp;quot;Vongfong&amp;quot;,&amp;quot;Linfa&amp;quot;,&amp;quot;In-fa&amp;quot;,&amp;quot;Malou&amp;quot;,&amp;quot;Muifa&amp;quot;,&amp;quot;Sanvu&amp;quot;],&amp;quot;Malaysia&amp;quot;:[&amp;quot;Jelawat&amp;quot;,&amp;quot;Rumbia&amp;quot;,&amp;quot;Sepat&amp;quot;,&amp;quot;Tapah&amp;quot;,&amp;quot;Nuri&amp;quot;,&amp;quot;Nangka&amp;quot;,&amp;quot;Cempaka&amp;quot;,&amp;quot;Nyatoh&amp;quot;,&amp;quot;Merbok&amp;quot;,&amp;quot;Mawar&amp;quot;],&amp;quot;Micronesia&amp;quot;:[&amp;quot;Ewiniar&amp;quot;,&amp;quot;Soulik&amp;quot;,&amp;quot;Mun&amp;quot;,&amp;quot;Mitag&amp;quot;,&amp;quot;Sinlaku&amp;quot;,&amp;quot;Saudel&amp;quot;,&amp;quot;Nepartak&amp;quot;,&amp;quot;Rai&amp;quot;,&amp;quot;Nanmadol&amp;quot;,&amp;quot;Guchol&amp;quot;],&amp;quot;Philippines&amp;quot;:[&amp;quot;Maliksi&amp;quot;,&amp;quot;Cimaron&amp;quot;,&amp;quot;Danas&amp;quot;,&amp;quot;Hagibis&amp;quot;,&amp;quot;Hagupit&amp;quot;,&amp;quot;Molave&amp;quot;,&amp;quot;Lupit&amp;quot;,&amp;quot;Malakas&amp;quot;,&amp;quot;Talas&amp;quot;,&amp;quot;Talim&amp;quot;],&amp;quot;RO Korea&amp;quot;:[&amp;quot;Gaemi&amp;quot;,&amp;quot;Jebi&amp;quot;,&amp;quot;Nari&amp;quot;,&amp;quot;Neoguri&amp;quot;,&amp;quot;Jangmi&amp;quot;,&amp;quot;Goni&amp;quot;,&amp;quot;Mirinae&amp;quot;,&amp;quot;Megi&amp;quot;,&amp;quot;Noru&amp;quot;,&amp;quot;Doksuri&amp;quot;],&amp;quot;Thailand&amp;quot;:[&amp;quot;Prapiroon&amp;quot;,&amp;quot;Mangkhut&amp;quot;,&amp;quot;Wipha&amp;quot;,&amp;quot;Bualoi&amp;quot;,&amp;quot;Mekkhala&amp;quot;,&amp;quot;Atsani&amp;quot;,&amp;quot;Nida&amp;quot;,&amp;quot;Chaba&amp;quot;,&amp;quot;Kulap&amp;quot;,&amp;quot;Khanun&amp;quot;],&amp;quot;U.S.A.&amp;quot;:[&amp;quot;Maria&amp;quot;,&amp;quot;Barijat&amp;quot;,&amp;quot;Francisco&amp;quot;,&amp;quot;Matmo&amp;quot;,&amp;quot;Higos&amp;quot;,&amp;quot;Etau&amp;quot;,&amp;quot;Omais&amp;quot;,&amp;quot;Aere&amp;quot;,&amp;quot;Roke&amp;quot;,&amp;quot;Lan&amp;quot;],&amp;quot;Viet Nam&amp;quot;:[&amp;quot;Son-Tinh&amp;quot;,&amp;quot;Trami&amp;quot;,&amp;quot;Lekima&amp;quot;,&amp;quot;Halong&amp;quot;,&amp;quot;Bavi&amp;quot;,&amp;quot;Vamco&amp;quot;,&amp;quot;Conson&amp;quot;,&amp;quot;Songda&amp;quot;,&amp;quot;Sonca&amp;quot;,&amp;quot;Saola&amp;quot;]}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This chart is based from that on the &lt;a href=&quot;http://www.jma.go.jp/jma/jma-eng/jma-center/rsmc-hp-pub-eg/tyname.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Japan Meteorological Agency website&lt;/a&gt;, retrieved on 10 October 2019. Conventionally the list is divided into 5 columns, but in order to list all the names by region, I have organized them into 10 columns, so that each row fits all names from the same region. Moreover, two of the names, Mangkhut and Rumbia are retired and are still pending for replacement. Here I will keep these 2 names for integrity.&lt;/p&gt;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Write a program or function, that receives a name in the list above as input, and returns or outputs which region it is named after.&lt;/p&gt;&#xA;&lt;p&gt;The input and output formats are flexible. For input, you may omit the hyphens and/or receive all uppercase or lowercase input. For output, you may also instead return an element from a set of 14 distinct values of your choice, each representing a region.&lt;/p&gt;&#xA;&lt;p&gt;Your program does not need to deal with invalid inputs.&lt;/p&gt;&#xA;&lt;h3&gt;Sample I/O&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input: Chan-hom (exact wording)&#xA;Output: Lao PDR (exact wording)&#xA;&#xA;Input: Kongrey (Kon-grey; without hyphen)&#xA;Output: KH (Cambodia; ISO 3166 code, uppercase)&#xA;&#xA;Input: atsani (Atsani; all lowercase)&#xA;Output: th (Thailand; ISO 3166 code, lowercase)&#xA;&#xA;Input: LAN (Lan; all uppercase)&#xA;Output: 12 (U.S.A; 0-indexed)&#xA;&#xA;Input: choiwan (Choi-wan; without hyphen &amp;amp; all lowercase)&#xA;Output: 4 (Hong Kong, China; 1-indexed)&#xA;&#xA;Input: INFA (In-fa; without hyphen &amp;amp; all uppercase)&#xA;Output: Macau (Macao, China; common name) &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Again, you may have different output formats, but the input and output formats you use must be stated.&lt;/p&gt;&#xA;&lt;h3&gt;Winning Criteria&lt;/h3&gt;&#xA;&lt;p&gt;The shortest submission in each language wins. No loophole is allowed.&lt;/p&gt;&#xA;" OwnerUserId="71546" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-10-10T09:56:54.107" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="18171" PostTypeId="2" ParentId="2140" CreationDate="2019-10-10T13:35:11.547" Score="0" Body="&lt;p&gt;How often does the word sixty-eight (68) appear in numbers from 1 to N. The upper limit for N to which the program needs to be able to perform is 100 000 000. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program will take N as input and return every number in which the word sixty-eight appears from 1 to N, and a sum of all appearances of sixty-eight at the end.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm looking for the spoken form, so the word sixty-eight appears in&lt;/p&gt;&#xA;&#xA;&lt;p&gt;68 000 000 - &lt;em&gt;sixty-eight&lt;/em&gt; million - &lt;strong&gt;once&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;68 680 000 - &lt;em&gt;sixty-eight&lt;/em&gt; million six-hundred thousand - &lt;strong&gt;once&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;68 068 068 - &lt;em&gt;sixty-eight&lt;/em&gt; million &lt;em&gt;sixty-eight&lt;/em&gt; thousand and &lt;em&gt;sixty-eight&lt;/em&gt; - &lt;strong&gt;three times&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;and so on. The shortest implementation that gives a correct result wins.&lt;/p&gt;&#xA;" OwnerUserId="57075" LastEditorUserId="57075" LastEditDate="2019-10-10T14:09:57.927" LastActivityDate="2019-10-10T14:09:57.927" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18172" PostTypeId="2" ParentId="2140" CreationDate="2019-10-10T20:09:18.217" Score="1" Body="&lt;h1&gt;Fewest number of button presses to set the cook time&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A GolfCo™ microwave oven has a 12-button keypad like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1]  [2]  [3]&#xA;[4]  [5]  [6]&#xA;[7]  [8]  [9]&#xA;     [0]  [+30]&#xA;   [START]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;How the microwave operates&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The microwave reads and processes button presses as follows:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Buttons [0]-[9] add the corresponding digit to the right end of the cook time, up to 4 digits total. Once started, these buttons do not function.&lt;/li&gt;&#xA;&lt;li&gt;The [+30] button adds 30 seconds to the cook time, and starts the cooking process (if not already started).&lt;/li&gt;&#xA;&lt;li&gt;The [START] button starts the cooking process.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The microwave can be programmed with a cooking time ranging from 1 second to 99 minutes and 59 seconds.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any one or two-digit cook time is interpreted as seconds only, ranging from 1 to 99 seconds.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any three or four-digit cook time is interpreted as two digits of minutes and two digits of seconds. In this mode, the minutes portion of the cook time can range from 0 to 99 minutes, while the seconds can range from 0 to 59 seconds.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a time in minutes:seconds (eg. &quot;4:45&quot; for four minutes and 45 seconds), print the button sequence with the least number of button presses required to set the cook time and start the cooking process.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As this is code golf, the smallest program in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input will be given in the common MM:SS format, where &quot;MM&quot; specifies minutes and &quot;SS&quot; specifies seconds, separated by a colon.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Minutes can be zero padded to 2 digits or the leading zero omitted, at the golfer's discretion. Minutes can range from 00 to 99.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Seconds will always be 2 digits, ranging from 00 to 59.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The cook time will range from 00:01 to 99:59.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The program will output the sequence of button presses needed to program the cook time and start the microwave.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Buttons [0] to [9] will be output as the corresponding digit &quot;0&quot;-&quot;9&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The [+30] button will be output as &quot;+&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The [START] button will be output as &quot;S&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input                  Output&#xA;=======================================&#xA;04:45 (or 4:45)        4 4 5 S&#xA;00:08                  8 S&#xA;00:30                  +&#xA;00:35                  5 +&#xA;00:20 (or 0:20)        2 0 S&#xA;01:20 (or 1:20)        8 0 S&#xA;01:25 (or 1:25)        8 5 S     (&quot;2 5 + +&quot; and &quot;1 2 5 S&quot; are both too long)&#xA;01:30 (or 1:30)        + + +     (&quot;9 0 S&quot; is also correct)&#xA;01:35 (or 1:35)        5 + + +   (&quot;1 3 5 S&quot; is also correct)&#xA;01:39 (or 1:39)        9 + + +   (&quot;1 3 9 S&quot; is also correct)&#xA;01:40 (or 1:40)        1 4 0 S   (&quot;1 0 + + +&quot; is incorrect)&#xA;01:50 (or 1:50)        1 5 0 S   &#xA;02:00 (or 2:00)        2 0 0 S   (&quot;+ + + +&quot; is also correct)&#xA;02:30 (or 2:30)        2 3 0 S   (&quot;+ + + + +&quot; is incorrect)&#xA;03:00 (or 3:00)        3 0 0 S   &#xA;10:00                  1 0 0 0 S&#xA;99:59                  9 9 5 9 S&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="87944" LastEditorUserId="87944" LastEditDate="2019-10-11T01:23:32.970" LastActivityDate="2019-10-11T01:23:32.970" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="18174" PostTypeId="2" ParentId="2140" CreationDate="2019-10-11T12:36:17.293" Score="-1" Body="&lt;h1&gt;Interpret Unneccesary (Not quite)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Unneccesary is a joke language created by Keymaker. The source is unneccesary, and if given, it will error out.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task here is similar. If there is input, your program should error out. If the input is empty, your program should do nothing and &lt;strong&gt;terminate&lt;/strong&gt;.&lt;/p&gt;&#xA;" OwnerUserId="87986" LastActivityDate="2019-10-11T12:36:17.293" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18179" PostTypeId="2" ParentId="1061" CreationDate="2019-10-13T19:26:08.627" Score="22" Body="&lt;h1&gt;Using an inconsistent I/O format to encode information&lt;/h1&gt;&#xA;&lt;p&gt;For example, for a hypothetical challenge where the output could only ever be two or eleven, submitting the python program&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;lambda x:print&amp;quot;11&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and claiming that it outputs in unary for certain inputs and in decimal for other inputs should not be allowed, even though outputting in either of these bases &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5344&quot;&gt;is usually allowed&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Likewise, for a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; challenge, submitting the python function&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;lambda i:type(i)is str&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and claiming it takes input as a singleton list for inputs that match the challenge's criteria and as a string otherwise shouldn't be allowed, even though taking input as a singleton list &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11884&quot;&gt;is usually allowed&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="85386" LastEditorUserId="85386" LastEditDate="2020-09-16T22:34:25.010" LastActivityDate="2020-09-16T22:34:25.010" CommentCount="2" CommunityOwnedDate="2019-10-13T19:26:08.627" ContentLicense="CC BY-SA 4.0" />
  <row Id="18182" PostTypeId="1" AcceptedAnswerId="23520" CreationDate="2019-10-15T22:39:44.093" Score="6" ViewCount="123" Body="&lt;p&gt;There is an odd grey rectangle under the reputation on &lt;a href=&quot;//codegolf.meta.stackexchange.com/users/32091/qwertiy?tab=badges&quot;&gt;meta profile page&lt;/a&gt;. And it almost overlaps with label about top percentage just bellow it:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/gN61G.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/gN61G.png&quot; alt=&quot;screenshot from meta&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If I open profile page on the main site, I see nothing like that:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/UVXXI.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/UVXXI.png&quot; alt=&quot;screenshot from main site&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think, that background on meta (caused by &lt;code&gt;bg-black-050&lt;/code&gt; class) have to be removed.&lt;/p&gt;&#xA;" OwnerUserId="32091" LastEditorUserId="11952" LastEditDate="2021-06-15T16:53:01.917" LastActivityDate="2021-06-15T16:53:01.917" Title="Odd rectangle under reputation in meta profile" Tags="|bug|status-completed|site-design|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18183" PostTypeId="2" ParentId="2140" CreationDate="2019-10-16T02:00:18.433" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;algorithm&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Disconnect a social network&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;A version of this question was used in the &lt;a href=&quot;https://www.imo-official.org/year_info.aspx?year=2019&quot; rel=&quot;nofollow noreferrer&quot;&gt;2019 International Mathematical Olympiad&lt;/a&gt;, which is now public. Modifications italicised.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A social network has &lt;em&gt;n&lt;/em&gt; users, some pairs of whom are friends. Whenever user A is friends with user B, user B is also friends with user A. Events of the following kind may happen repeatedly, one at a time:&lt;/p&gt;&#xA;  &#xA;  &lt;blockquote&gt;&#xA;    &lt;p&gt;Three users A, B, and C such that A is friends with both B and C, but B and C are&#xA;    not friends, change their friendship statuses such that B and C are now friends, but A is&#xA;    no longer friends with B, and no longer friends with C. All other friendship statuses are&#xA;    unchanged.&lt;/p&gt;&#xA;  &lt;/blockquote&gt;&#xA;  &#xA;  &lt;p&gt;&lt;em&gt;Given the initial graph of users, find whether sequence of such events so that at the end of the sequence&lt;/em&gt; each user is friends with at most one other user &lt;em&gt;exists, and if so output that sequence&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;These cases have &lt;em&gt;n&lt;/em&gt; followed by a list of friendships in the graph, and output as a list of triples of people in order A-B-C (and &lt;code&gt;0&lt;/code&gt; if no sequence of triples exists - note that this is different from &lt;code&gt;[]&lt;/code&gt; in this particular output scheme, here &lt;code&gt;[]&lt;/code&gt; means that the graph already satisfies the condition that each user is friends with at most one other user).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;3, [[1,2], [2,3]]&#xA;[[1,2,3]]&#xA;&#xA;3, [[1,3], [2,3]]&#xA;[[2,3,1]]&#xA;&#xA;3, []&#xA;[]&#xA;&#xA;3, [[1,2]]&#xA;[]&#xA;&#xA;3, [[1,2], [1,3], [2,3]]&#xA;0&#xA;&#xA;6, [[1,2], [2,3], [3,4], [4,5], [5,6]]&#xA;[[1,2,3], [1,3,4], [1,4,5], [1,5,6]]&#xA;&#xA;6, [[1,2], [1,6], [2,3], [3,4], [4,5], [5,6]]&#xA;0&#xA;&#xA;7, [[1,2], [1,3], [1,4], [2,3], [5,6]]&#xA;[[2,1,4], [1,3,2], [1,2,4]]&#xA;&#xA;4, [[1,2], [1,3], [1,4], [2,3], [2,4], [3,4]]&#xA;0&#xA;&#xA;6, [[1,2], [1,3], [1,4], [1,5], [1,6], [4,5], [4,6], [5,6]]&#xA;[[2,1,4], [3,1,5], [5,1,6], [2,4,6], [4,5,3]]&#xA;&#xA;5, [[1,2], [1,3], [2,3], [2,4], [2,5], [3,4], [3,5]]&#xA;0&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input and output format are flexible as long as they conform to standard I/O requirements, and standard loopholes are forbidden. (In particular, for the impossible case, the output can be anything which is not an output from a possible graph, such as &lt;code&gt;[[0,0,0]]&lt;/code&gt; or an additional 'success' boolean.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code wins!&lt;/p&gt;&#xA;" OwnerUserId="60483" LastEditorUserId="60483" LastEditDate="2019-10-21T06:25:59.710" LastActivityDate="2019-10-21T06:25:59.710" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18185" PostTypeId="2" ParentId="18136" CreationDate="2019-10-16T07:47:49.567" Score="0" Body="&lt;h2&gt;Previous communities around code golf have failed&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If one visits &lt;a href=&quot;http://reddit.com/r/codegolf&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://reddit.com/r/codegolf&lt;/a&gt; one can easily see that the community is dead. Planning like this is planning for failure. Let's Lay down groundwork for more success in the future, as well as moor independence from stackexchange.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First, we need a line of communication. I have met a few very amicable people on SE that I communicate with professionally. I recommend doing the same. Get an email maybe or two. If everyone gets 3 emails, it's unlikely anyone will be left behind. Alternatively, we could use a service such as slack to communicate. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regardless, the medium needs to be professional, minimalistic, and easy to use. Even a telnet server should do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Secondly, we need to archive. No doubt SE will be happy to remove old sites. This may be far far off, but we need too do so. Archive questions, answers, votes, comments, usernames. Archive all users, all questions. Each challenge shouldn't take up more than 1 MB to store. CSS archives would also be handy.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thirdly, we need to remember. Most communities lose steam simply from not participating. We need to encourage eachother to participate, learn, and observe. If we don't, it's a fade into obscurity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, it would be advantageous for us to join an existing community than to create a new community. It's been shown time and again that online communities move into existing niches, very rarely does an exodus populace carve out their own new hole in the internet. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;That's my tips I haven't studied anthropology, sociology, or any sort of people movement, this is just what I've seen work from a personal perspective.&lt;/p&gt;&#xA;" OwnerUserId="60951" LastActivityDate="2019-10-16T07:47:49.567" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18187" PostTypeId="2" ParentId="2140" CreationDate="2019-10-16T14:28:26.843" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/195140/66833&quot;&gt;Translate a simple sentence from Toki Pona&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2019-11-01T02:34:24.110" LastActivityDate="2019-11-01T02:34:24.110" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18188" PostTypeId="2" ParentId="2140" CreationDate="2019-10-16T16:01:13.967" Score="2" Body="&lt;h1&gt;Create a safe crossing.&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Given a string/number/array of any two distinct characters make the &quot;squarest&quot; 2D array that allows &quot;someone&quot; to cross from left to right or top to bottom &quot;stepping&quot; only on whichever character you have chosen as your stepping stone&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;or&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Make the &quot;squarest&quot; array possible that contains a complete row or column of stepping stone characters. (clearer but takes away the fun story-ness)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&quot;squarest&quot; meaning smallest difference between the dimensions of the 2D array.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A string/number/array of your choosing consisting only of your two chosen distinct characters. So no error checking needed. Allow true/false values if input is array?&lt;/li&gt;&#xA;&lt;li&gt;input will have at least 1 stepping stone character so that a valid solution is always possible 1 by x or x by 1&lt;/li&gt;&#xA;&lt;li&gt;a minimum length of x? needed? might make it easier if there's some weirdness with very short arrays in the algorithms people come up with&lt;/li&gt;&#xA;&lt;li&gt;the last row can be incomplete to allow for prime number length inputs and to more easily allow non trivial 1xX/Xx1 answers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The output should be the dimensions of the array&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;and specify the row or column to use?&lt;/li&gt;&#xA;&lt;li&gt;print your 2D array so that the path can be seen graphically?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;100100100 -&gt; 3x3 array&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;100&#xA;100&#xA;100&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;11111000 -&gt; 4x2 or 3x3 - 3x3 is squarer so is correct&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1111    111&#xA;1000    110&#xA;        00&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;11000011000101001001 -&gt; 5x4&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;11000&#xA;01100&#xA;01010&#xA;01001&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;1000000000000 -&gt; 12x1 - trivial as only 1 stepping stone&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;100000000000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;010111 -&gt; 3x2 or 2x3 - either acceptable as both are only &quot;1&quot; away from square&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;010    01&#xA;111    01&#xA;       11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;This is code-golf so the shortest code in bytes wins.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Issues&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;allow diagonal crossings? does that make it a lot harder?&lt;/li&gt;&#xA;&lt;li&gt;need a lot more test cases I think?&lt;/li&gt;&#xA;&lt;li&gt;input spec&lt;/li&gt;&#xA;&lt;li&gt;output spec&lt;/li&gt;&#xA;&lt;li&gt;better/more tags?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="63404" LastActivityDate="2019-10-16T16:01:13.967" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18190" PostTypeId="2" ParentId="2140" CreationDate="2019-10-16T21:49:31.970" Score="1" Body="&lt;h1&gt;Measure the Discrepancy&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a finite sequence of real numbers &lt;span class=&quot;math-container&quot;&gt;\$ s_1, s_2, \ldots, s_n\$&lt;/span&gt; and an interval &lt;span class=&quot;math-container&quot;&gt;\$I=[a,b]\$&lt;/span&gt; that contains the whole sequence, find its &lt;em&gt;discrepancy&lt;/em&gt; &lt;span class=&quot;math-container&quot;&gt;\$D_n\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Definition*&lt;/h3&gt;&#xA;&lt;p&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$I = [a,b]\$&lt;/span&gt; be an interval that covers the whole sequence &lt;span class=&quot;math-container&quot;&gt;\$(s_i)_i\$&lt;/span&gt;, that means for all &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt; we have &lt;span class=&quot;math-container&quot;&gt;\$s_i \in I\$&lt;/span&gt;. The discrepancy &lt;span class=&quot;math-container&quot;&gt;\$D_n\$&lt;/span&gt; is defined as&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$D_n = \sup_{[u,v] \subseteq I} \left| \frac1n N(u,v)  - \frac{v-u}{b-a} \right|$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Here &lt;span class=&quot;math-container&quot;&gt;\$N(u,v) = \#\{i \mid 1 \leqslant i \leqslant n, s_i \in [u,v]\}\$&lt;/span&gt; denotes the number of values of the sequence &lt;span class=&quot;math-container&quot;&gt;\$(s_i)_i\$&lt;/span&gt; that are in the interval &lt;span class=&quot;math-container&quot;&gt;\$[u,v]\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;* Technically the discrepancy &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt; is defined for infinite sequences as &lt;span class=&quot;math-container&quot;&gt;\$D = \lim_{n\to \infty} D_n\$&lt;/span&gt;. Intuitively speaking, the *discrepancy measures how uniformly distributed the sequence is in the given interval &lt;span class=&quot;math-container&quot;&gt;\$I\$&lt;/span&gt;. Sampling an uniform distribution on &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt; infinitely many times results in an discrepancy of &lt;span class=&quot;math-container&quot;&gt;\$D=0\$&lt;/span&gt;.&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;to be added...&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-10-17T19:38:44.203" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18192" PostTypeId="2" ParentId="2140" CreationDate="2019-10-17T11:28:46.017" Score="3" Body="&lt;h1&gt;Can Jimmy escape the ghosts?&lt;/h1&gt;&#xA;&lt;p&gt;Posted: &lt;a href=&quot;https://codegolf.stackexchange.com/q/194974/81663&quot;&gt;Can Jimmy escape the ghosts?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="81663" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-10-28T08:55:21.167" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18193" PostTypeId="2" ParentId="2140" CreationDate="2019-10-17T12:25:27.523" Score="0" Body="&lt;h2&gt;Intersect the integer ranges&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Integer ranges take one of four forms:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A start, a step and an end. Both ends are included in the range. The difference between the end and start is guaranteed to be a multiple of the step. The step is guaranteed to be positive, even if the start is equal to the end (it may not be greater).&lt;/li&gt;&#xA;&lt;li&gt;A start and a step. This is a half-infinite range.&lt;/li&gt;&#xA;&lt;li&gt;A step and an end. This is also a half-infinite range.&lt;/li&gt;&#xA;&lt;li&gt;An empty range. You can decide how you want to represent this, but you must accept as input any empty range you can output.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Given two integer ranges, please output their intersection.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If the two ranges are disjoint, return an empty range.&lt;/li&gt;&#xA;&lt;li&gt;If the two ranges are identical, simply output one of them.&lt;/li&gt;&#xA;&lt;li&gt;If one range completely subsumes the other, output the latter.&lt;/li&gt;&#xA;&lt;li&gt;Determine the values common to both ranges, and output a range that represents these values.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1, 1, 6] ∩ [3, 1, 9] = [3, 1, 6]&#xA;[1, 2, 9] ∩ [2, 1, 8] = [2, 2, 8]&#xA;[1, 2, ~] ∩ [2, 3, ~] = [5, 6, ~]&#xA;[~, 2, 9] ∩ [1, 3, ~] = [1, 6, 7]&#xA;[1, 2, 3] ∩ [2, 2, 2] = []&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If would be nice if you could indicate any preconditions that your answer doesn't require (e.g. if it works for a step of zero when the start and end are the same).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2019-10-17T17:47:16.753" LastActivityDate="2019-10-17T17:47:16.753" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18194" PostTypeId="2" ParentId="2140" CreationDate="2019-10-17T15:59:59.247" Score="0" Body="&lt;h1&gt;Doing something with Haifu&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.dangermouse.net/esoteric/haifu.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Haifu&lt;/a&gt; is an esoteric programming language by David Morgan-Mar, which, in addition to having a very weird control scheme also has the requirement that each program should be in the form of Haiku.&lt;/p&gt;&#xA;&lt;p&gt;Maybe it would be possible to do a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;-like challenge with it. The robber's task is to write a Haifu program doing &lt;em&gt;something&lt;/em&gt; non-trivial, using a shorthand code, where each command/variable is replaced by a unique single- or two-character identifier, and ignoring the haiku structure demand (The language is weird enough that even &amp;quot;Hello World&amp;quot; isn't a trivial task). The cop's task is to take a robber's code and turn it into a valid Haiku. However, this would either be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, or maybe even outsourced to a different SE site.&lt;/p&gt;&#xA;&lt;h2&gt;Meta questions:&lt;/h2&gt;&#xA;&lt;p&gt;Is this a feasible concept and does it fit into the spirit of CodeGolf.SE?&lt;/p&gt;&#xA;&lt;p&gt;The Haifu specification is not quite complete. If I'd be doing this, I'd need first some sharp eyes to help me spot all the holes and fill them. Then, the shortened syntax for the coding part would need to be designed. If enough people say it might be feasible, I'll probably open a chat room to discuss this.&lt;/p&gt;&#xA;&lt;p&gt;Lastly, of course, what to do with the turning code into Haiku part of the challenge?&lt;/p&gt;&#xA;" OwnerUserId="89287" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-10-17T15:59:59.247" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18196" PostTypeId="1" AcceptedAnswerId="18197" CreationDate="2019-10-17T20:15:51.187" Score="11" ViewCount="463" Body="&lt;p&gt;This doesn't seem immediately like an issue, but I've encountered it once in a challenge already, and recently again in a Sandboxed challenge, and is getting tiring to find the correct wording. For example, for &lt;a href=&quot;https://codegolf.stackexchange.com/q/191444/66833&quot;&gt;this&lt;/a&gt; challenge, the biggest struggle in the Sandbox was making it clear that programs only had to work in theory for large inputs, and currently, the rules take up 2/3 bullet points just to define this. So:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;What wording would be best to imply that your program must work theoretically for an arbitrarily large value, but it is acceptable from your program to fail due to practical limitations, such as memory or time?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;For instance, if your algorithm for computing &lt;span class=&quot;math-container&quot;&gt;\$x^n\$&lt;/span&gt; is sound, but fails for inputs &lt;span class=&quot;math-container&quot;&gt;\$x, n \ge 2^{52}\$&lt;/span&gt;, this is a perfectly valid answer, but if the program fails because of the algorithm behind it, it is not acceptable.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2019-10-23T22:18:19.047" Title="How can we clearly define &quot;Must work for theoretically large values&quot;?" Tags="|discussion|asking-questions|specification|" AnswerCount="3" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18197" PostTypeId="2" ParentId="18196" CreationDate="2019-10-17T21:37:02.397" Score="11" Body="&lt;p&gt;This is what I use in my challenges (with slightly different wordings):&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The algorithm should theoretically work for arbitrarily large input values. In practice, it is acceptable if the program is limited by time, memory, or data-type size.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Small variations may be needed in each challenge:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The &lt;em&gt;arbitrarily large input values&lt;/em&gt; part may be tailored to the specific problem. For example,&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;for arbitrarily large &lt;em&gt;M&lt;/em&gt; and &lt;em&gt;N&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;if &lt;em&gt;M&lt;/em&gt; and  &lt;em&gt;N&lt;/em&gt; are the variables used to refer to the input in the challenge text; or&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;for any input size&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;if the input is say a string that can be arbitrarily large in theory.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The &lt;em&gt;limited by&lt;/em&gt; part may also need tweaking. For example, for ASCII-art challenges that could in theory produce arbitrarily large output:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;limited by time, memory, data-type size, or screen size&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="20080" LastEditDate="2019-10-18T14:16:56.040" LastActivityDate="2019-10-18T14:16:56.040" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18198" PostTypeId="2" ParentId="18196" CreationDate="2019-10-18T00:29:49.563" Score="6" Body="&lt;p&gt;I don't this cannot be defined in in an objective and satisfactory way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We can talk about the behavior of a program as more memory is added to a computer, or more computing time is given.  Since we actually contruct proofs about behavior based on the semantics of the language, this is entirely objective.  (note that this is not computable, so it cannot be checked entirely autonomously by a computer, but it is still objective and a computer could verify a proof artifact.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However when it comes to things like floating point precision regardless of how much memory you have a single precision float will always be 4 bytes.  This is a semantic property of the language.  And even variable length floating point numbers can never represent values beyond binary fractions.  If we want to talk about the idealized version of the program we need to decide what semantic changes can be made.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Ideas of the algorithms at play behind any piece of code are inherently subjective.&#xA;It is up to the humans involved to decide if a correct algorithm is actually represented or if something funny is going on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you don't want this subjectivity you can state the ranges required (possibly infinite) that must be supported in the challenge.  But I do think that it is okay to let a little subjectivity in.  I don't think it is likely that two people in good faith will disagree over the algorithm behind a piece of code.  And at that point it is better to take it on a case by case basis instead of trying to create a general rule.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2019-10-19T23:22:39.907" LastActivityDate="2019-10-19T23:22:39.907" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18199" PostTypeId="2" ParentId="2140" CreationDate="2019-10-18T11:35:32.673" Score="0" Body="&lt;h1&gt;Title: Station Codes&lt;/h1&gt;&#xA;&lt;h3&gt;Background&lt;/h3&gt;&#xA;&lt;p&gt;In the UK, railway stations are assigned three-letter &lt;a href=&quot;https://www.nationalrail.co.uk/stations_destinations/48541.aspx&quot; rel=&quot;nofollow noreferrer&quot;&gt;&amp;quot;CRS&amp;quot; codes&lt;/a&gt; (e.g. &amp;quot;Chester&amp;quot; = &lt;code&gt;CTR&lt;/code&gt;, &amp;quot;Caterham&amp;quot; = &lt;code&gt;CAT&lt;/code&gt;). Something similar is also used for airports worldwide (IATA codes).&lt;/p&gt;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&lt;p&gt;The challenge is to take in the three letter code as the input, and present the name of the station as the output.&lt;/p&gt;&#xA;&lt;p&gt;The codes are always in upper-case; the outputs are as shown in the link above.&lt;/p&gt;&#xA;&lt;p&gt;Usual IO rules, exclusions; code-golf rules apply.&lt;/p&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;CAT&lt;/code&gt; -&amp;gt; &lt;code&gt;Caterham&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;CCH&lt;/code&gt; -&amp;gt; &lt;code&gt;Chichester&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;HHY&lt;/code&gt; -&amp;gt; &lt;code&gt;Highbury &amp;amp; Islington&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;HOP&lt;/code&gt; -&amp;gt; &lt;code&gt;Hope (Derbyshire)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;AUW&lt;/code&gt; -&amp;gt; &lt;code&gt;Ascott-under-Wychwood&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;CSD&lt;/code&gt; -&amp;gt; &lt;code&gt;Cobham &amp;amp; Stoke d'Abernon&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;HID&lt;/code&gt; -&amp;gt; &lt;code&gt;Hall-i'-th'-Wood&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;HXX&lt;/code&gt; -&amp;gt; &lt;code&gt;Heathrow Airport Terminals 1, 2 and 3&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ELY&lt;/code&gt; -&amp;gt; &lt;code&gt;Ely&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;anything else listed in the link above - the correct station name&lt;/li&gt;&#xA;&lt;li&gt;anything not listed in the link above -&amp;gt; no preference&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox Query&lt;/h2&gt;&#xA;&lt;p&gt;Is this boring? - does it add anything to the existing gamut of &amp;quot;compress a load of data and index it&amp;quot; -type questions?&lt;/p&gt;&#xA;" OwnerUserId="62289" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-10-20T13:47:04.380" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18200" PostTypeId="2" ParentId="18196" CreationDate="2019-10-18T22:38:55.910" Score="-1" Body="&lt;p&gt;Simple answer: don't.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Computers are precise, discrete, and limited. Most programming languages are no different. You either have to limit defined behavior within the bounds of what can be done with the built-in numeric types of whatever language a solution happens to be written in (with a few patches for strange edge cases), or...&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Set explicit precision/accuracy limits&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Like the other answers have said, I don't think there's really a clean way to set &quot;theoretical&quot; boundaries without opening up gaping loopholes and weird edge cases. I think you're much better off setting explicit boundaries of defined behavior. Good challenges intentionally allow some undefined behavior; if it isn't really relevant to the challenge, let it be undefined.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In general, I would suggest avoiding challenges that require numbers larger than &lt;span class=&quot;math-container&quot;&gt;\$2^{52}\$&lt;/span&gt; unless you have a really good reason (i.e. the challenge would be significantly altered by using smaller values e.g. generating RSA keys, SHA digests, etc...). Even better, avoid requiring anything bigger than the signed 32-bit integer range &lt;span class=&quot;math-container&quot;&gt;\$[-2^{31}, 2^{31} - 1]\$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rather than working around theoretical limits, my challenges usually specify a range of values that &lt;em&gt;must&lt;/em&gt; work to be considered valid solutions. Anything outside that precision and accuracy is undefined. Make limits tight enough that almost any programming language or architecture could solve the problem without excessive effort that's not really relevant to the challenge itself- I usually aim for what fits in an int16, a float32, or 4 decimal digits since these are common denominators to almost every language/architecture made since 1990.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Addendum: I think the way you handled it in the challenge you linked is fine, but these sorts of challenges that map numbers to something should be avoided if that something has more than &lt;span class=&quot;math-container&quot;&gt;\$2^{52}-1\$&lt;/span&gt; possible states since that encloses a common denominator of distinct integer limits.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;A few examples from my challenges:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From &lt;a href=&quot;https://codegolf.stackexchange.com/questions/191086/heavy-box-stacking&quot;&gt;Heavy Box Stacking&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;You must support weights up to 9,999 kg, at minimum.&lt;/li&gt;&#xA;  &lt;li&gt;You must support up to 9,999 total boxes, at minimum.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;From &lt;a href=&quot;https://codegolf.stackexchange.com/questions/180776/compound-interest-with-wizard-money&quot;&gt;Compound Interest... With Wizard Money&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Input and output may be in any convenient format. You must take in Knuts, Sickles, Galleons, interest rate, and time. All but interest&#xA;  rate will be whole numbers. The interest rate is in increments of&#xA;  0.125%.&#xA;  ...snip...&lt;/li&gt;&#xA;  &lt;li&gt;Totals owed, up to 1,000 Galleons, should be accurate to within 1 Knut per year of interest when compared with arbitrary precision&#xA;  calculations.&lt;/li&gt;&#xA;  &lt;li&gt;You may round down after each year of interest or&#xA;  only at the end. Reference calculations can take this into account for&#xA;  accuracy checks.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;From &lt;a href=&quot;https://codegolf.stackexchange.com/questions/180727/arrays-start-at-pi&quot;&gt;Arrays Start at &lt;span class=&quot;math-container&quot;&gt;\$\pi\$&lt;/span&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Your result must have at least two decimal points of precision, be accurate to within 0.05, and support numbers up to 100 for this precision/accuracy. (single-precision floats are more than sufficient to meet this requirement)&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;From &lt;a href=&quot;https://codegolf.stackexchange.com/questions/168669/intersection-point-of-two-line-segments&quot;&gt;Intersection Point of Two Line Segments&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;A minimum of 2 decimal places (or equivalent) precision is required.&lt;/li&gt;&#xA;  &lt;li&gt;Final results should be accurate to within 0.01 when at a scale of -100 - +100. (32-bit floats will be more than accurate enough for this purpose)&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;From &lt;a href=&quot;https://codegolf.stackexchange.com/questions/178326/length-of-the-longest-descent&quot;&gt;Length of the Longest Descent&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;You may assume the height map is perfectly rectangular, is nonempty, and contains only positive integers in the signed 32-bit integer range.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2019-10-23T22:18:19.047" LastActivityDate="2019-10-23T22:18:19.047" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18202" PostTypeId="2" ParentId="2140" CreationDate="2019-10-19T16:52:29.670" Score="0" Body="&lt;h1&gt;Can I run this?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'm a big fan of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/file-system&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;file-system&amp;#39;&quot; rel=&quot;tag&quot;&gt;file-system&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges, and an idea recently struck me. Suppose you're on a *nix system and you want to know how many executable programs you have installed that you can run. Given a file with mode &lt;code&gt;mode&lt;/code&gt;, you can run it if it is a normal file (&lt;code&gt;mode &amp;amp; S_IFMT == S_IFREG&lt;/code&gt;) &lt;strong&gt;and&lt;/strong&gt; any of the following are true:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Its owner is equal to your effective user id and &lt;code&gt;0100 &amp;amp; p != 0&lt;/code&gt; (user executable bit is set)&lt;/li&gt;&#xA;&lt;li&gt;Its group is a group you are a member of and &lt;code&gt;0010 &amp;amp; p != 0&lt;/code&gt; (group executable bit is set)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;0001 &amp;amp; p != 0&lt;/code&gt; (world executable bit is set)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Rules:&lt;/h3&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;TODO: See below.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h2&gt;For Sandbox&lt;/h2&gt;&#xA;  &#xA;  &lt;p&gt;Writing a good &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/file-system&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;file-system&amp;#39;&quot; rel=&quot;tag&quot;&gt;file-system&lt;/a&gt; challenge is hard.&#xA;  I have some ideas, but I've brainstormed some easy solutions and I want to know which challenge and restrictions would be most well-received.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;There are three possible challenges I am considering:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;p&gt;&lt;strong&gt;single file&lt;/strong&gt;: Given a path as input, output truthy/falsy whether the path is a path to a file the user can run.&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;&lt;strong&gt;count in directory&lt;/strong&gt;: output the number of files the user can run at any depth underneath the current working directory (or a provided directory, should you prefer that)&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;&lt;strong&gt;count in &lt;code&gt;PATH&lt;/code&gt;&lt;/strong&gt;: output the number of files the user can run immediately under any directory in the environment variable &lt;code&gt;PATH&lt;/code&gt;. The value of &lt;code&gt;PATH&lt;/code&gt; may also be given as input to the program/function.&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;  &#xA;  &lt;p&gt;Potential restrictions (I marked as spoilers since these can provide solutions if I don't ban them):&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;    &lt;p&gt; Banning the use of &lt;code&gt;access()&lt;/code&gt;/&lt;code&gt;os.access()&lt;/code&gt;/etc.&lt;/p&gt;&#xA;  &lt;/blockquote&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;    &lt;p&gt; Banning the use of the &lt;code&gt;which&lt;/code&gt; executable typically found on *nix machines (&lt;code&gt;which&lt;/code&gt; is exactly the solution to the first challenge)&lt;/p&gt;&#xA;  &lt;/blockquote&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;    &lt;p&gt; Banning the use of any external executables&lt;/p&gt;&#xA;  &lt;/blockquote&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;  &#xA;  &lt;p&gt;I am currently inclined to choose the second challenge, allow all solutions, but award a bounty to the shortest program which follows the above restrictions.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="86147" LastActivityDate="2019-10-19T16:52:29.670" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18203" PostTypeId="2" ParentId="2140" CreationDate="2019-10-20T14:44:55.893" Score="0" Body="&lt;h1&gt;Implement Or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;or&lt;/strong&gt; is a dubious esoteric programming language. The author is unknown but it is known that fungot (a chatbot) is currently learning &lt;strong&gt;or&lt;/strong&gt; but it remains unknown how it does it and where it receives the required material to learn &lt;strong&gt;or&lt;/strong&gt;. Check out &lt;a href=&quot;https://esolangs.org/wiki/Or#IRC_Log&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; IRC log to see fungot revealing part of the language.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Instruction reference&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It is only known that a space followed by an f pushes &lt;em&gt;false&lt;/em&gt; to the stack. The &lt;em&gt;false&lt;/em&gt; value may by any falsy value of your choosing. Since this language does not support output, in order to make verifying answers possible, you should output the resulting stack in the end of the program.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Expects one false to the stack&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; f&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Expects 2 falses on the stack&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;m f ma f&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Expects 1 false on the stack&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; f a lf &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Expects 2 falses on the stack&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a f fa&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this clear enough?&lt;/li&gt;&#xA;&lt;li&gt;I haven't found a duplicate, but anything?&lt;/li&gt;&#xA;&lt;li&gt;Tags are code-golf, string and interpreter. Anything else?&lt;/li&gt;&#xA;&lt;li&gt;Any further feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-10-21T05:58:16.030" LastActivityDate="2019-10-21T05:58:16.030" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18206" PostTypeId="2" ParentId="2140" CreationDate="2019-10-21T12:23:04.290" Score="-1" Body="&lt;h1&gt;CMC: Cross-Multiplication Calculator &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In this task you should create a Cross-Multiplication Calculator.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Cross-multiplication is a way of factoring an algebraic expression. This is the expression form that this way can solve:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$x^2 + ax + b$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; are constants here, and &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; is a variable.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;Anyway, as far as I can tell, this expression form is only  solvable in this method.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Anyway, how do I do Cross-Multiplication? (TODO)&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;You first take the number &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; and factor this number into integral factors.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Okay. We are using the expression &lt;span class=&quot;math-container&quot;&gt;\$x^2 + 8x + 16\$&lt;/span&gt; as an example.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Although 16 is not a prime) let us assume that 16 only has 2 possible factors:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$-1 \times -16\$&lt;/span&gt; (because &lt;span class=&quot;math-container&quot;&gt;\$-x \times -x = x^2\$&lt;/span&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$1 \times 16\$&lt;/span&gt; (Obviously this is 16)&lt;/li&gt;&#xA;&lt;li&gt;And the above 2 with the factors reversed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Now you sum these possible two factors and check this against the number &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Check 1. So &lt;span class=&quot;math-container&quot;&gt;\$-1 + (-16) = -17\$&lt;/span&gt;. And unfortunately -17 is not 8, we proceed to the next check.&lt;/li&gt;&#xA;&lt;li&gt;Check 2. So &lt;span class=&quot;math-container&quot;&gt;\$1 + 16 = 17\$&lt;/span&gt;. And unfortunately 17 is not 8, we proceed to the next check. There are no checks left.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Did I make a mistake? Of course, I need to change the factors.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$-2 \times -8\$&lt;/span&gt; (because &lt;span class=&quot;math-container&quot;&gt;\$-x \times -x = x^2\$&lt;/span&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$2 \times 8\$&lt;/span&gt; (Obviously this is 16)&lt;/li&gt;&#xA;&lt;li&gt;And the above 2 with the factors reversed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;We sum those values, and they are -10 and 10 respectively. So I should change the factors to another value:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$-4 \times -4\$&lt;/span&gt; (because &lt;span class=&quot;math-container&quot;&gt;\$-x \times -x = x\$&lt;/span&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$4 \times 4\$&lt;/span&gt; (Obviously this is 16)&lt;/li&gt;&#xA;&lt;li&gt;And the above 2 with the factors reversed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Finally! &lt;span class=&quot;math-container&quot;&gt;\$4+4 = 8\$&lt;/span&gt;, and here is the factorization:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$(x+4)(x+4)$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;Now you will probably realize why I desperately need a program to automate this.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You can assume that the input is always valid. You do not have to specify the variables, only the numbers. Therefore the expression&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$x^2 + ax + b$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;is converted into:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$+a \, +b$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The expected output is not:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$(x+\alpha)(x+\beta)$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;but:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$+\alpha \, +\beta$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a, b =&amp;gt; α, β&#xA;8, 16 =&amp;gt; 4, 4&#xA;-5, -24 =&amp;gt; 3, -8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this clear enough?&lt;/li&gt;&#xA;&lt;li&gt;I haven't found a duplicate, but anything? (Although unlikely, I found nothing by searching &quot;Cross Multiplication&quot;.)&lt;/li&gt;&#xA;&lt;li&gt;Tags are code-golf, string and interpreter. Anything else?&lt;/li&gt;&#xA;&lt;li&gt;Any further feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user85052" LastEditorUserId="66833" LastEditDate="2019-10-21T17:46:03.043" LastActivityDate="2019-10-21T17:46:03.043" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18207" PostTypeId="1" CreationDate="2019-10-21T13:10:39.357" Score="3" ViewCount="695" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;EDIT: people have pointed out I overlooked the existence of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11737/89894&quot;&gt;code bowling&lt;/a&gt;, which is indeed very similar to what I was looking for, though not exactly what I envisioned it to be. I'll leave this question open though in case people want to share their thoughts about it.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Ever since I discovered code golf exists, I've been fairly obsessed with it. It goes beyond the standard code practices of making your code as short and efficient as possible, and gives a whole new dynamic to coding.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Sadly with me being new to coding and my very limited skills, I'd need to learn a lot more before I could even think of competing. (That, and the only language I'm any good at right now is VBA which seems like the worst choice for golfing to begin with).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However what I am good at is writing convoluted, unnecessarily big, redundant and utterly useless code. Which made me think, is the reverse of code golf feasible? Of course, we all know there are numerous ways of making code near infinite &lt;a href=&quot;https://xkcd.com/1960/&quot; rel=&quot;nofollow noreferrer&quot;&gt;demonstrated neatly by xkcd&lt;/a&gt;. Would it be possible to fabricate a set of base rules which is restricting enough to prevent all loopholes and make reverse code golf possible and challenging?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've been thinking about a few rules myself which would help, but I'm sure I've overlooked a lot of things. Obviously this would only be a baseline, and the challenge should provide additional rules to make it different from other challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;1: Limited set of variable/function names. Only use &lt;code&gt;[A-Z]&lt;/code&gt;.&lt;/strong&gt;&#xA;As above link, xkcd just uses infinitely long functions to pad out their code. This can be easily done with variable names as well. To restrict this, you can only use 26 functions or variables named &lt;code&gt;[A-Z]&lt;/code&gt;, one character, no longer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;2: Only define each variable once. (With exception of loops)&lt;/strong&gt;&#xA;It would be too easy to make your code go &lt;code&gt;A = Hello Worla&lt;/code&gt; then &lt;code&gt;A = hello Worlb&lt;/code&gt;, etc. through the entire alphabet until you get &lt;code&gt;A = Hello World&lt;/code&gt; as is needed. Therefore you can only store a value to a variable once, and it will be fixed until the end of your code. Loops are exempt from that to have variables like counters going up by 1 each loop, or having &lt;code&gt;A&lt;/code&gt; redefined for the duration of the loop, until it holds the required value at the end of it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;3: Loops are restricted to the maximum of iterations needed to get the desired output.&lt;/strong&gt;&#xA;You could have a loop run from 1 to infinity, where you get the desired output at the second iteration, but pad out your code just by making it run 321985231684320x10^32 etc. times. This is restricted to run twice only as that is when you get the desired output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;4: Code redundancy.&lt;/strong&gt;&#xA;Possibly the best/biggest restriction. All code needs to do something directly related to the output. The easiest way to check this: If any lines/blocks of code can be deleted easily without throwing errors or changing the outcome of the code, they don't count and should be omitted. This will prevent people from writing huge code which doesn't do anything, discarding the outcome and finishing it with &lt;code&gt;print Hello World&lt;/code&gt;. &lt;em&gt;This would be an interesting challenge for other competitors as well, trying to delete lines of code from other answers to test their redundancy and reduce their score.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;5: No repetition.&lt;/strong&gt;&#xA;Say I need to get a string of three characters, and I've just written a 5 page essay of code which gets the first character in the string. I could just copy and paste it a couple of times to get the other two characters. But that would be too easy, therefore (within reason) code cannot repeat itself.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;6: A restricting time limit/deadline.&lt;/strong&gt;&#xA;Say 24 or 48 hours to give everyone a chance to compete, but not a change to go on forever.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;7: Code should execute in reasonable time.&lt;/strong&gt;&#xA;This one is subjective to how good your hardware is, but the code should execute in reasonable time on a reasonably powerful machine. To prevent people writing code that doesn't execute at all, or executes slower than anyone has patience for, so that nobody can check if it actually works.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;8: Only main code counts.&lt;/strong&gt;&#xA;All functions called by the code that aren't inside the main body are disregarded.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;9: Code is counted until the desired output is given.&lt;/strong&gt;&#xA;When the desired output is reached, anything beyond is disregarded.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have given much thought about this, and this is by no means a complete list of rules needed to make reverse golf possible, as there are probably more loopholes than I could possibly count. Is it at all likely such a complete list will ever exist, making it possible to actually play? If so, what other rules are needed?&lt;/p&gt;&#xA;" OwnerUserId="89894" LastEditorUserId="89894" LastEditDate="2019-10-21T14:57:27.403" LastActivityDate="2019-10-25T14:55:01.040" Title="Is playing reverse code golf possible? Will it ever be?" Tags="|discussion|" AnswerCount="3" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18208" PostTypeId="2" ParentId="18207" CreationDate="2019-10-21T13:29:42.030" Score="6" Body="&lt;p&gt;My initial thoughts:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;1:&lt;/strong&gt; is not applicable because many languages do not use standard ASCII letters for function/variable names&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;2:&lt;/strong&gt; is not really applicable because it’s hard to say what constitutes a variable in each language (some might not even have explicit variables)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;4:&lt;/strong&gt; is talking about &quot;no-ops&quot; which are indeed usually banned in Code Bowling challenges&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;5:&lt;/strong&gt; What about code that repeats itself but for functional reasons?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;6:&lt;/strong&gt; I don’t see the relationship with the rest, and this seems like a bad idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;7:&lt;/strong&gt; This depends on the specific challenge at hand.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;9:&lt;/strong&gt; is pretty similar/a subcase of 4. in my opinion.&lt;/p&gt;&#xA;" OwnerUserId="41723" LastActivityDate="2019-10-21T13:29:42.030" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18209" PostTypeId="1" CreationDate="2019-10-21T18:20:44.223" Score="1" ViewCount="79" Body="&lt;p&gt;I just checked out the site and from the last 10 challenges 4 are downvoted. That doesn't fill me with a great deal of desire to check out the site regularly to see if there is anything worth answering. I know this has been asked before but from todays search nothing has changed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think it must be a bit disspiriting for new members to come here, post a challenge that in many cases they have worked hard on and get it downvoted often with no explanation.I have put forward this idea before but it wasn't well accepted but nevertheless I am going to propose it again.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Answer-only membership until you have 100 rep (rep from joining from other sites not included) and then obviously, after that time the new member will have a better understanding of how the site works. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Comments? Ideas? I'm just trying to think of a way to stop new members joining and then effectively being told they are not good enough when they post their first challenge without really understanding what is required. Basically to make it more wecoming and improve the quality of the questions.&lt;/p&gt;&#xA;" OwnerUserId="56555" LastEditorUserId="56555" LastEditDate="2019-10-21T18:33:07.860" LastActivityDate="2019-10-21T18:33:07.860" Title="How can we improve the quality of questions/challenges?" Tags="|discussion|" AnswerCount="0" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18210" PostTypeId="2" ParentId="18207" CreationDate="2019-10-21T19:25:31.507" Score="10" Body="&lt;p&gt;The best way to do non-exploitable &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; challenges is not to define arbitrary sets of rules that have to be followed by all answers, but to make it &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; pitting users who want their code to be long against other users trying to shorten it, like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37797/the-bowlers-golfers-fraction-war&quot;&gt;The Bowlers-Golfers Fraction War&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="46076" LastActivityDate="2019-10-21T19:25:31.507" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18212" PostTypeId="1" CreationDate="2019-10-22T21:37:53.660" Score="5" ViewCount="656" Body="&lt;p&gt;I have been using functions for Zsh submissions for some time. I typically submit the body alone, as the body can be run as a full program with no modification: &lt;code&gt;afunction arg1 arg2&lt;/code&gt; vs &lt;code&gt;./aprogram arg1 arg2&lt;/code&gt;. If recursion is needed, &lt;code&gt;$0&lt;/code&gt; can be used.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I saw &lt;a href=&quot;https://codegolf.stackexchange.com/questions/194683/calculate-the-internal-angles-of-a-regular-polygon-with-n-sides&quot;&gt;this recent challenge&lt;/a&gt;, which is a purely mathematical one. Now Zsh has a math mode and allows math functions which work fairly different from normal functions:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Normal function:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f(){    # define function&#xA;    echo &quot;Hello $1&quot;&#xA;}&#xA;f world!       # call&#xA;s=$(f world!)  # call and capture stdout&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Math function:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f(){    # define function&#xA;    (( ($1 * $2)**0.5 ))&#xA;}&#xA;functions -M f        # define mathfn f, bind it to the function of the same name&#xA;functions -M g 2 2 f  # OR define mathfn g which takes min:2, max:2 args &#xA;                      # and bind it to the shell function f&#xA;(( k = f(4,9) ))      # call and capture&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Math function, but in &lt;code&gt;zcalc&lt;/code&gt; (a math-mode REPL provided in Zsh):&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;:f f ($1*$2)**0.5    # bind (this defines a function named zsh_math_func_f and binds the mathfn f to it)&#xA;f(4,9)               # call&#xA;k = f(4,9)           # call and capture&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;How can/should the above math function be scored?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(0) &lt;code&gt;((($1*$2)**0.5))&lt;/code&gt;: This is the body of the function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(1) &lt;code&gt;()((($1*$2)**0.5))&lt;/code&gt;: This creates an anonymous function, executed immediately and discarded&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(2) &lt;code&gt;f()((($1*$2)**0.5))&lt;/code&gt;: This is sufficient to bind the body to a shell function, but it hasn't been bound to a &lt;code&gt;mathfn&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(3) &lt;code&gt;f()((($1*$2)**0.5));functions -M f&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(4) &lt;code&gt;($1*$2)**0.5&lt;/code&gt; with language as &quot;Zsh zcalc REPL&quot;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(5) &lt;code&gt;:f f ($1*$2)**0.5&lt;/code&gt; with language as &quot;Zsh zcalc REPL&quot;?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Looking at previous discussions both &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4726/java-function-literals&quot;&gt;specific&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7614/what-are-our-rules-about-additional-code-accompanying-function-submissions&quot;&gt;general&lt;/a&gt;, I am unsure how this &quot;double binding&quot; of the function should be accounted for, and how it affects re-usability.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;EDIT: &lt;a href=&quot;https://github.com/zsh-users/zsh/blob/225b35c9070f94cf79c90c33ffcee84b281f894d/Src/math.c#L1087&quot; rel=&quot;nofollow noreferrer&quot;&gt;The logic in question in Zsh's source&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a valid &lt;code&gt;MathFunc f&lt;/code&gt;, if it is bound to a &lt;code&gt;Shfunc shfunc&lt;/code&gt;, it will &lt;code&gt;doshfunc(shfunc, l, 1)&lt;/code&gt; and &lt;code&gt;return lastmathval&lt;/code&gt;. So the value computed by the last arithmetic expression in the function determines the output of the math function. I wrote my conclusions as an answer. I will consider votes as consensus.&lt;/p&gt;&#xA;" OwnerUserId="86147" LastEditorUserId="86147" LastEditDate="2019-10-23T10:37:11.467" LastActivityDate="2019-10-23T10:40:00.787" Title="Zsh: Functions and Math functions" Tags="|discussion|code-golf|scoring|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18213" PostTypeId="2" ParentId="18212" CreationDate="2019-10-23T10:40:00.787" Score="4" Body="&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Given a shell function &lt;code&gt;f() (( expression ))&lt;/code&gt;, calling &lt;code&gt;f 42&lt;/code&gt; in a shell context &lt;strong&gt;will&lt;/strong&gt; set a value internal to the shell which &lt;strong&gt;would&lt;/strong&gt; be used as a return value &lt;strong&gt;if&lt;/strong&gt; a math function was bound to it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7615/86147&quot;&gt;Assuming these to be the four criteria a function must meet&lt;/a&gt;, the largest hurdle to &lt;code&gt;()((expression))&lt;/code&gt; being a valid submission is what criteria 1 and 3 mean in this context. &lt;strong&gt;I claim since &quot;capturing into a name&quot; describes the two steps of binding a shell function and binding a math function, that the anonymous function &lt;code&gt;()((expression))&lt;/code&gt; is a valid submission.&lt;/strong&gt; The expression evaluates to an unnamed function, and it does all the things functions do once it is bound to a name.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;In the end, if this is to be accepted, the net bytes saved is... &lt;code&gt;0&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;&amp;lt;&amp;lt;$[($1*$2)**0.5]   # full program, outputs to stdout&#xA;()((($1*$2)**0.5))   # anon math function, outputs as math val&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This will save bytes when writing a recursive math function, though!&lt;/p&gt;&#xA;" OwnerUserId="86147" LastActivityDate="2019-10-23T10:40:00.787" CommentCount="0" CommunityOwnedDate="2019-10-23T10:40:00.787" ContentLicense="CC BY-SA 4.0" />
  <row Id="18215" PostTypeId="2" ParentId="2140" CreationDate="2019-10-23T13:24:57.523" Score="2" Body="&lt;h1&gt;ASCII Sum of your code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Encoding is nice, adding things is also nice. Let's do &lt;em&gt;both&lt;/em&gt; !&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task will be to create a program that read itself, convert every of its character into ASCII values and return the sum of those numbers.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Let's say your program is &lt;code&gt;Hello, world !&lt;/code&gt;. Convert every character into ascii values&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;H  e   l   l   o   ,  (space) w   o   r   l   d   (space) !&#xA;72 101 108 108 111 44 32      119 111 114 108 100 32      33&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now, sum everything into a &lt;s&gt;meaningless&lt;/s&gt; very useful value&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;72 + 101 + 108 + 108 + 111 + 44 + 32 + 119 + 111 + 114 + 108 + 100 + 32 + 33&#xA;= 1193&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here it is, &lt;code&gt;Hello, world!&lt;/code&gt; returns &lt;code&gt;1193&lt;/code&gt; !&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The code have to &lt;strong&gt;read itself&lt;/strong&gt; and &lt;strong&gt;calculate&lt;/strong&gt; the result&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are &lt;strong&gt;not&lt;/strong&gt; allowed&lt;/li&gt;&#xA;&lt;li&gt;This is codegolf, so the fewer bytes wins.&lt;/li&gt;&#xA;&lt;li&gt;Non-standard languages with non-ASCII characters should use their own codepage's encodings (Thanks for @Veskah for this rule)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Feedback&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the challenge clear enouth ?&lt;/li&gt;&#xA;&lt;li&gt;Is there an already existing challenge like this one ?&lt;/li&gt;&#xA;&lt;li&gt;is this considered as a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2926/write-a-program-to-print-the-sum-of-the-ascii-codes-of-the-program&quot;&gt;this challenge&lt;/a&gt; ?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41833" LastEditorUserId="41833" LastEditDate="2019-10-25T07:10:02.557" LastActivityDate="2019-10-25T07:10:02.557" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18216" PostTypeId="1" CreationDate="2019-10-24T10:09:18.793" Score="1" ViewCount="116" Body="&lt;p&gt;This question is mostly in regards to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/194683/calculate-the-internal-angles-of-a-regular-polygon-with-n-sides&quot;&gt;This challenge and the comments&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My planned answer for a microcontroller language could do one of two things: make a general process to handle any input but will very definitely output incorrectly for inputs above a certain threshhold (max output is 255 / FF).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Or it could &quot;abuse&quot; the fact that for this question I may only need to support a few possible inputs as the rest will fail - making my code less general but shorter, however this does feel like cheating so wish to clarify if this would be allowed first&lt;/p&gt;&#xA;" OwnerUserId="74183" LastActivityDate="2019-10-24T10:09:18.793" Title="Is using a language limitation to simplify an answer cheating?" Tags="|discussion|code-challenge|" AnswerCount="0" CommentCount="1" ClosedDate="2019-10-25T17:36:01.780" ContentLicense="CC BY-SA 4.0" />
  <row Id="18218" PostTypeId="2" ParentId="18207" CreationDate="2019-10-25T14:55:01.040" Score="2" Body="&lt;p&gt;This is of course &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt;. The key point to a good Code Bowling challenge is not to have &lt;strong&gt;unobservable requirements&lt;/strong&gt;. Virtually all your &quot;rules&quot; fall into this category.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In my view, there is only one rule that is observable to define Code Bowling.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;An answer is only valid if any and all number of deletions invalidate the answer.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;For example, if the answer is &lt;code&gt;abc&lt;/code&gt;, then &lt;code&gt;bc&lt;/code&gt;, &lt;code&gt;ac&lt;/code&gt;, &lt;code&gt;ab&lt;/code&gt;, &lt;code&gt;a&lt;/code&gt;, &lt;code&gt;b&lt;/code&gt;, &lt;code&gt;c&lt;/code&gt; and an empty program should not fulfil the specification.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Often, this is supplemented with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; to make the challenge more interesting, but this is not a requirement.&lt;/p&gt;&#xA;" OwnerUserId="32352" LastActivityDate="2019-10-25T14:55:01.040" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18221" PostTypeId="2" ParentId="2140" CreationDate="2019-10-26T16:40:32.413" Score="1" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;It was found that this challenge is a duplicate. if you would like to see the challenge, please look in the revision history.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="83677" LastEditorUserId="83677" LastEditDate="2019-10-26T22:51:05.617" LastActivityDate="2019-10-26T22:51:05.617" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18225" PostTypeId="2" ParentId="2140" CreationDate="2019-10-28T07:42:45.800" Score="0" Body="&lt;h1&gt;Make a karaoke machine&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a list of lines and a set time (in seconds) which those lines appear, output those lines after that specific amount of seconds.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example input:&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 Hello there!&#xA;5 This line should come up after 5 seconds.&#xA;10 This line should come up 5 seconds after that one.&#xA;20 There's a 10-second delay here.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Every line will be preceded by an integer, separated from the rest of the line by a string. The number indicates when the line should come up - the first line should be outputted instantly, followed by the next few lines like so:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hello there! (output instantly)&#xA;(wait 5 seconds)&#xA;This line should come up after 5 seconds.&#xA;(wait 5 seconds)&#xA;This line should come up 5 seconds after that one.&#xA;(wait 10 seconds)&#xA;There's a 10-second delay here.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Assumptions:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You're guaranteed that the lines are in order - i.e. this doesn't happen:&#xA;&#xA;&lt;pre&gt;&lt;code&gt;5 Hello there!&#xA;0 Oops, this is meant to happen before the first line.&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;li&gt;You're also guaranteed that no two lines share the same time.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Winning criteria:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins!&lt;/p&gt;&#xA;" OwnerUserId="49561" LastActivityDate="2019-10-28T07:42:45.800" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18227" PostTypeId="1" CreationDate="2019-10-28T16:17:06.320" Score="9" ViewCount="450" Body="&lt;p&gt;A few days ago, a post called &lt;a href=&quot;https://stackoverflow.blog/2019/10/25/the-puzzle-masters-behind-facebooks-hacker-cup-explain-how-they-craft-questions&quot;&gt;The puzzle masters behind Facebook's Hacker Cup explain how they craft questions&lt;/a&gt; appeared on the Stack Overflow blog and is currently promoted on the sidebar of related Stack Exchange sites. The last sentence of the post says: &quot;Last but not least, if you feel like some puzzling this morning, don’t forget to check out &lt;a href=&quot;https://codegolf.stackexchange.com/questions/194801/ethan-finds-the-maximum-element&quot;&gt;the question the Hacker Cup team shared on Code Golf&lt;/a&gt;&quot; (link not in the original post, for some reason). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The CGCC site description says the site is for &quot;recreational programming competitions,&quot; the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17612/what-should-this-site-be-called-now-that-its-getting-a-design&quot;&gt;new site name discussion&lt;/a&gt; explicitly rejected proposals to change the site name to just &lt;strong&gt;Code Golf&lt;/strong&gt;, and the &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;on-topic page&lt;/a&gt; doesn't say anything about puzzles being restricted to code golf. But some of the comments on the Hacker Cup question make me wonder if it would be more accurate to just describe CGCC as a code golf site:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;One comment claims that &quot;golfing IO [should be] uninteresting,&quot; and says parts of the question &quot;mismatch the cultures of competitive programming&quot; (as compared to, presumably, the culture of CGCC).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Another says that while &quot;avoidances of overly large numbers&quot; is &quot;typical on many other competitive programming sites, it's not really part of the culture here.&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A third comment says, &quot;When I read challenges here that sound like they are from programming contests, I start worrying that they are attempts at cheating or plagiarism&quot; and &quot;I think less puzzley programming-contest style challenges that are about implementing code work better here.&quot;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;All this for a submission that, while it started its life as an unused Hacker Cup question, was written specifically for CGCC as a code golf question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After some edits, the question has been well-received and has gotten upvotes and answers. But, like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17612/what-should-this-site-be-called-now-that-its-getting-a-design?cb=1#comment62839_17612&quot;&gt;91% of non-closed questions [on this site] since 2017&lt;/a&gt;, it's still a code golf question. If the author had left it as a traditional Hacker Cup-style question, would it have been welcome on CGCC? Is CGCC the place on the SE network where &lt;a href=&quot;https://en.wikipedia.org/wiki/Competitive_programming&quot; rel=&quot;nofollow noreferrer&quot;&gt;competitive programming&lt;/a&gt; questions belong, despite the cultural differences between the two communities?&lt;/p&gt;&#xA;" OwnerUserId="25099" LastEditorUserId="25099" LastEditDate="2019-10-28T18:16:23.923" LastActivityDate="2019-10-28T18:16:23.923" Title="Is CGCC culture compatible with competitive programming culture?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18228" PostTypeId="2" ParentId="18227" CreationDate="2019-10-28T17:53:05.773" Score="12" Body="&lt;p&gt;The three points you have posted mostly apply only to the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; tag. They're there because answers to code golf challenges can be in any of hundreds of languages used here, e.g. for a challenge to multiply 2 numbers, parsing decimal input up to &lt;span class=&quot;math-container&quot;&gt;\$10^{18}\$&lt;/span&gt; in brainfuck would probably end up taking &gt;95% of the bytes and be copy-pasted to every challenge. Honorary mentions to &lt;a href=&quot;https://tio.run/##TYsxD4IwFIR3fsUbWyJlMS5EdwcnRuPwgAaL7StpH6gh/HbswGByyX13lxtwxmLoXttm3OgDw5AKNbGxKq9aizHCbRmnxpoWIiMnm73pwKEhUXMw1N8fGPool7pFIh0gnkm/YU@i/kbWThmS1Y5@YjWmI1sSUZH@8JVYyPyPZbWuW1lC692IQXfAHvhpImASWHRNh1naBR4aWVwwb7ZjdvoB&quot; rel=&quot;nofollow noreferrer&quot;&gt;Java&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This site definitely has some implicit restrictions set by users on what types of questions can succeed here, but I would probably go with calling CGCC a &quot;casual competitive programming&quot; site, made to fill what wasn't possible on other sites. It's hard to define much further, as there's still sometimes disagreement on whether some challenges are on-topic here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A copy-paste from any &quot;proper&quot; competitive programming site would probably not go down well here. Challenges here need an objective winning criterion (it's one of the defining properties of this site), so alone, without any scoring mechanism (e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;), it doesn't fit here. A plausible scoring mechanism in competitive programming is performance, and we do have a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; tag which gets challenges posted every now and then, but those either are some popular/specific thing - as answers are public (another major difference from other competitive programming sites), questions requiring thinking of algorithms would just result in copy-pasting or just one answer getting updated constantly (then again, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;).&lt;/p&gt;&#xA;" OwnerUserId="59183" LastActivityDate="2019-10-28T17:53:05.773" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18230" PostTypeId="2" ParentId="2140" CreationDate="2019-10-29T01:40:15.680" Score="1" Body="&lt;h1&gt;Follow the Path&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/195111/follow-the-path-but-is-it-valid&quot;&gt;Posted here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2019-10-31T13:40:56.833" LastActivityDate="2019-10-31T13:40:56.833" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18235" PostTypeId="2" ParentId="2140" CreationDate="2019-10-29T18:33:45.363" Score="2" Body="&lt;h1&gt;It's slashing time&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/q/51445/42963&quot;&gt;Seven Slash Display&lt;/a&gt;)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You're lying in bed, awake. Sleepily, you turn your head to the alarm clock and read what time it is. Since you're lying down, the clock is facing diagonally, making it difficult to read. You decide to write a program to help you out (hey, you're awake anyway).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a &quot;slashed&quot; seven-segment display, output what time it is in 24-hour format.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;      /\&#xA;       /\&#xA;    /\  /&#xA;    \ \&#xA;   . \/&#xA; /\ .&#xA;  /&#xA;  \/&#xA;&#xA;2:03&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You can choose where to place the &lt;code&gt;:&lt;/code&gt; between the numbers (for example, evenly spaced as above or left-aligned as below, etc.), but the &lt;code&gt;:&lt;/code&gt; must be present.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some further examples:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;       \&#xA;        \&#xA;    /\&#xA;     /\&#xA;  / . /&#xA;  \/\.&#xA; \  /&#xA;  \&#xA;&#xA;15:31&#xA;&#xA;       \&#xA;      \/\&#xA;     \&#xA;      \&#xA;   \.&#xA;    \.&#xA;&#xA;1:14&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here are the precise digit shapes:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;/\&#xA;\ \&#xA; \/&#xA;&#xA; \&#xA;  \&#xA;&#xA;&#xA;/\&#xA; /&#xA; \/&#xA;&#xA;/\&#xA; /\&#xA;  /&#xA;&#xA; \&#xA;\/\&#xA;&#xA;/&#xA;\/\&#xA;  /&#xA;&#xA;/&#xA;\/\&#xA; \/&#xA;&#xA;/\&#xA;  \&#xA;&#xA;/\&#xA;\/\&#xA; \/&#xA;&#xA;/\&#xA;\/\&#xA;  /&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules &amp;amp; Standard I/O boilerplate&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The time will always be valid. For example, you'll never receive something like &lt;code&gt;30:25&lt;/code&gt; or &lt;code&gt;7:99&lt;/code&gt; or the like.&lt;/li&gt;&#xA;&lt;li&gt;You're allowed to pad the input with whitespace however necessary (e.g., padding it to always be a rectangle with trailing spaces).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42963" LastEditorUserId="42963" LastEditDate="2019-10-31T15:17:11.890" LastActivityDate="2019-10-31T15:17:11.890" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18236" PostTypeId="2" ParentId="2140" CreationDate="2019-10-30T17:24:33.650" Score="1" Body="&lt;h1&gt;Fermat's Last Theorem, mod n&lt;/h1&gt;&#xA;&lt;p&gt;It is a well known fact that for all integers &lt;span class=&quot;math-container&quot;&gt;\$p&amp;gt;2\$&lt;/span&gt;, there exist no integers &lt;span class=&quot;math-container&quot;&gt;\$x, y, z&amp;gt;0\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$x^p+y^p=z^p\$&lt;/span&gt;. However, this statement is not true in general if we consider the integers modulo &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You will be given &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt;, which are two positive integers with &lt;span class=&quot;math-container&quot;&gt;\$n&amp;gt;1\$&lt;/span&gt;. Your task will be to write a function or program to compute all positive integers &lt;span class=&quot;math-container&quot;&gt;\$x, y, z&amp;lt;n\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$(x^p+y^p)\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$z^p\$&lt;/span&gt; give the same remainder when divided by &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;Any reasonable method of input is allowed. E.g. two separate user inputs, ordered pair, two function parameters, etc.&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;Any reasonable method of output is valid, it may be produced by a function or output to the screen. The order the triples are listed does not matter. Triples such as &lt;code&gt;(1, 2, 3)&lt;/code&gt; and &lt;code&gt;(2, 1, 3)&lt;/code&gt; are considered distinct, and all distinct triples should be listed exactly once. No invalid/trivial triples such as &lt;code&gt;(0, 0, 0)&lt;/code&gt; should be output.&lt;/p&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;n p -&amp;gt; Possible Output&#xA;----------------------------------------------------------------&#xA;2 3 -&amp;gt; []&#xA;3 3 -&amp;gt; [(1,1,2),(2,2,1)]&#xA;3 4 -&amp;gt; []&#xA;4 3 -&amp;gt; [(1,2,1),(1,3,2),(2,1,1),(2,2,2),(2,3,3),(3,1,2),(3,2,3)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;Shortest code in bytes with no standard loopholes wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="89930" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-10-31T20:01:41.517" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18238" PostTypeId="2" ParentId="2140" CreationDate="2019-10-31T19:45:24.660" Score="0" Body="&lt;h1&gt;Interpolate between binary images&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;While there are various ways to interpolate between images with a large color space where for each color there are many similar other colors, it is not so straightforward to do that in a (heavily) quantized color space where you only have few colors available. We now take that to an extreme:&lt;/p&gt;&#xA;&lt;p&gt;Given two black and white image of the same size as well as a number &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;, output a sequence of &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; images that &amp;quot;interpolate&amp;quot; between the two input pictures.&lt;/p&gt;&#xA;&lt;p&gt;The goal here is coming up with an &amp;quot;interpolation&amp;quot; algorithm that allows you to smoothly transition between two images. But &lt;em&gt;how&lt;/em&gt; you define this &lt;em&gt;smoothness&lt;/em&gt; is up to you. The more aesthetically pleasing the better.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&amp;quot;black and white&amp;quot; here means the images consist only of the colors black and white, no grays.&lt;/li&gt;&#xA;&lt;li&gt;Validity criteria:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first image in the sequence must be the first input image, and&#xA;the last image in the sequence must be the second image.&lt;/li&gt;&#xA;&lt;li&gt;All images&#xA;must have the same size and consist of only black and white pixels.&#xA;Furthermore the output must be deterministic in the sense that if you&#xA;repeatedly call the program with identical inputs, you must get&#xA;identical outputs.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Please post the sequence of images as an animation in your answer, for any &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; you choose.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;To be defined...&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-10-31T19:45:24.660" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18240" PostTypeId="1" CreationDate="2019-11-02T02:35:26.723" Score="146" ViewCount="4135" Body="&lt;p&gt;On October 27th, I decided that the following requirements must be met by November 1st for my continued involvement with the Stack Exchange network:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://meta.stackexchange.com/questions/333089/stack-exchange-and-stack-overflow-are-moving-to-cc-by-sa-4-0&quot;&gt;The forced relicensing from CC-BY-SA 3.0 to CC-BY-SA 4.0&lt;/a&gt; must either be validated as legal by a lawyer or legal team experienced in copyright law and open-source licenses, with the explanation posted publicly, or the license change must be rolled back.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://judaism.meta.stackexchange.com/q/5193&quot;&gt;Monica Cellio must be reinstated as a moderator on the sites where she previously was a moderator&lt;/a&gt;, and then be subjected to the &lt;a href=&quot;https://meta.stackexchange.com/q/336173/307833&quot;&gt;new and fair process for removing moderators&lt;/a&gt; rather than a knee-jerk reaction on a Friday afternoon.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Unsurprisingly, despite nearly two months passing since the relicensing announcement, and nearly one month passing since Monica's unjust removal, no progress has been made by Stack Exchange on either of these issues.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can no longer support the Stack Exchange network in good faith, because I do not believe the network has the best interests of its users in mind. So, I am &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/18133/45941&quot;&gt;following in the footsteps of Dennis&lt;/a&gt; and resigning as a moderator, effective immediately.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, because I object not only to Stack Exchange's mishandling of the alleged Code of Conduct violations by Monica, but also to what I believe is an illegal change to the license terms for network content, I'm going a step further. I am submitting a request for Stack Exchange to remove all of my network content, so that they may not illegally host it under a different license than the one under which the content was submitted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am very disappointed that the situation has come to this, but I have been left with no other choice that would not betray my principles. I will miss you all greatly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am on Discord as Mego#2328, if any of you would like to communicate there.&lt;/p&gt;&#xA;" OwnerDisplayName="user45941" LastEditorUserId="31716" LastEditDate="2019-11-02T14:29:44.093" LastActivityDate="2019-11-02T14:29:44.093" Title="It's time for me to leave" Tags="|discussion|moderators|" AnswerCount="0" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="18241" PostTypeId="1" CreationDate="2019-11-02T02:41:07.713" Score="-13" ViewCount="991" Body="&lt;p&gt;It's been a few years since I came back into this forum to play some code golf and I am seeing a flood of unicode only &quot;languages&quot; where large operations are hidden in a single unicode character and string compressing is built in default.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example: &lt;a href=&quot;https://codegolf.stackexchange.com/a/195179/2212&quot;&gt;https://codegolf.stackexchange.com/a/195179/2212&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course the author tried to explain what the bunch of symbols mean but that doesn't matter because there is a real long representation of the language, which is what the author linked on &quot;try it online&quot; feature. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So what is the point of even trying to write small golfed code when some guy can just compress their code and claim it is smaller? Also do they know what &quot;BYTES&quot; even mean? You cannot say your 144 unicode chars use 144 bytes. Unless of course you make up a dictionary of these containing 255 chars so they could theoretically fit one byte, but that is a stretch.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm old school. I like bending real multi purpose computer languages like  Python, Perl, Ruby... to their knees until the single last useless ascii char in the code is removed. Even languages that are meant for golfing should be better than that soup (I can't even call alphabet soup).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So what's up with that? Is there a tag like &quot;ascii-languages-only&quot; that people could add to make sure these things are excluded and other people can play with their brains and not their zip tools?&lt;/p&gt;&#xA;" OwnerUserId="2212" LastActivityDate="2019-11-08T14:46:57.980" Title="What is the point of unicode gibberish?" Tags="|discussion|rules|" AnswerCount="3" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="18242" PostTypeId="2" ParentId="18241" CreationDate="2019-11-03T00:41:32.530" Score="9" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;I'm old school. I like bending real multi purpose computer languages like Python, Perl, Ruby... to their knees until the single last useless ascii char in the code is removed. Even languages that are meant for golfing should be better than that soup (I can't even call alphabet soup).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'm old school too. I also like bending a real multi purpose computer language, APL, to its knees until the single last useless APL char in the code is removed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Did you know that…&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;APL traces &lt;a href=&quot;https://www.jsoftware.com/papers/APL.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;its origins&lt;/a&gt; back to &lt;a href=&quot;http://edition.cnn.com/TECH/computing/9907/06/1963.idg/&quot; rel=&quot;nofollow noreferrer&quot;&gt;before ASCII appeared&lt;/a&gt;?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;APL has always had &lt;a href=&quot;https://en.wikipedia.org/wiki/Digital_encoding_of_APL_symbols&quot; rel=&quot;nofollow noreferrer&quot;&gt;its own encoding&lt;/a&gt;?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;APL was &lt;a href=&quot;https://en.wikipedia.org/wiki/Code_golf#History&quot; rel=&quot;nofollow noreferrer&quot;&gt;the first language used for shortest-code competitions &lt;/a&gt;?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Would it not be unfair to prevent other languages from using all eight bits of &lt;em&gt;their&lt;/em&gt; code bytes‽&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2019-11-03T00:41:32.530" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18244" PostTypeId="2" ParentId="18241" CreationDate="2019-11-04T10:34:07.727" Score="3" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;... so that just make it a compiled binary instead of a source code. So, again, what is the point? The same way I can write x86 assembly or generate the compiled bytes to claim it is smaller&lt;/p&gt;&#xA;&lt;p&gt;... My issue is when you compile code and saying it is source&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Python code is a source code because Python interpreter can run it. x86 assembly code is a source code because an assembler, say &lt;code&gt;gas&lt;/code&gt;, can compile it so that the machine or OS can run it.&lt;/p&gt;&#xA;&lt;p&gt;If you compile an x86 assembly code, you get a binary file which contains x86 machine code. And &lt;strong&gt;it is still a source code&lt;/strong&gt; because the machine or OS can run it. It's just that an extra layer of an interpreter or a compiler is removed. Likewise, a kind of binary code written for a golfing language, say Jelly, is still a source code because Jelly interpreter can run it. It's all the same thing.&lt;/p&gt;&#xA;&lt;p&gt;(Digression: people had to actually code in machine code before an assembler was introduced.)&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;How do you prove anything was written by hand or compiled by a computer? That's exactly what I'm pointing out, people can do whatever and compile their crap into these &amp;quot;languages&amp;quot; and say they came up with a small solution. That is exactly as zipping text&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;IMO, &amp;quot;written by hand&amp;quot; or &amp;quot;compiled by a computer&amp;quot; isn't really relevant. If you're trying to golf in x86 machine code, you'd be mostly writing the program in x86 assembly first, and &lt;em&gt;then&lt;/em&gt; compile it to get the machine code. Then you tweak the x86 assembly to get shorter machine code. Probably you can also do it purely in machine code, but it's likely to be much harder and inefficient. If you don't believe me, &lt;a href=&quot;https://codegolf.stackexchange.com/a/171263/78410&quot;&gt;I did exactly this (golfing machine code at assembly level) when I was golfing in Z80Golf.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Also, coding and golfing in the &amp;quot;golfing languages&amp;quot; requires much more ingenuity than simply zipping a source code in another language. The users who use those languages use them because they can. They're just having their own small competition. You don't need to join them or even try to read them.&lt;/p&gt;&#xA;&lt;p&gt;Here is my favorite quote on this topic (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10307/78410&quot;&gt;original source&lt;/a&gt;):&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;For me I joined because it is fun. I spend all day writing readable code and sometimes it's nice to write something just because I can. I have no problems with golfing languages. The shortest code wins. Thats the rules most times. If I get an upvote for my Java/Python/Lotus Notes answer because I have done something smart that someone else thinks is cool then that's good enough for me. If someone beats my byte count with Jelly/GolfScript/AnyOtherGolfLang then respect to them for being able to do it. They get an upvote from me. I like this community. Let's not start taking it too seriously.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-11-04T10:34:07.727" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18250" PostTypeId="2" ParentId="18241" CreationDate="2019-11-08T14:46:57.980" Score="4" Body="&lt;p&gt;ASCII/UTF-8 may be the most used encoding for programming languages, but that doesn't mean every programming language should use it.. Those 'gibberish' characters in Charcoal/Jelly/05AB1E/etc. with their custom SBCS (Single Byte Character Set) encodings &lt;strong&gt;are actually created to make it more readable than raw bytes&lt;/strong&gt;.. Yes, it may not be as straight-forward to see what's going on if you're unfamiliar with the language than let's say a Java program where everything is quite verbose, but I can personally read 05AB1E which I learned in the past two years more than let's say Perl or GolfScript, which I'm both completely unfamiliar with.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, to give some counter examples of why it's a weird thing to ask for ASCII only encodings:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;In our native tongue, should we ban the regular Latin alphabet and ten digits, and start using the Chinese alphabet and numeric system?.. It's the most used character set in the world since roughly 1/3th of the world's population is Chinese (assuming most of them can read/write). &lt;a href=&quot;https://translate.google.com/#view=home&amp;amp;op=translate&amp;amp;sl=zh-CN&amp;amp;tl=en&amp;amp;text=%E6%88%91%E8%A9%B2%E7%94%A8%E4%B8%AD%E6%96%87%E5%AF%AB%E5%89%A9%E4%B8%8B%E7%9A%84%E4%BF%A1%E6%81%AF%E5%97%8E%EF%BC%9F&quot; rel=&quot;nofollow noreferrer&quot;&gt;我該用中文寫剩下的信息嗎？&lt;/a&gt; Your question is pretty similar by asking for ASCII only, just because you can read the characters.  &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.lscheffer.com/malbolge.shtml&quot; rel=&quot;nofollow noreferrer&quot;&gt;Malbolge&lt;/a&gt; is ASCII only. Does that make its extremely complex encrypting/decrypting nature make it any more readable/understandable? Can you see what's going on in &lt;a href=&quot;https://codegolf.stackexchange.com/a/189055/52210&quot;&gt;this Malbolge answer&lt;/a&gt; just because it's written in ASCII? To me this entire language is more gibberish than anything anyone would be able to produce in 05AB1E/Jelly/Charcoal/etc...&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Personally I never really understood why people had problems with golfing languages, tbh. I personally started code-golfing mid-2016 and primarily answered in Java 7, which I was using at work and was familiar with. I knew Java 8 was shorter with its lambdas, and I also saw all these unfamiliar languages (including ASCII-focused ones like Perl, GolfScript, Japt, etc.) which were much shorter, but I didn't care. (Almost every answer was gibberish to me at the time tbh.) &lt;strong&gt;I had fun completing challenges in Java 7, and that was the most important. :)&lt;/strong&gt;&lt;br&gt;&#xA;The only problem I have with codegolf languages, or to be more precise: the &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/908/52210&quot;&gt;win-condition&lt;/a&gt; and what people tend to upvote in general on CGCC: a very straight-forward but short codegolf answer would get a lot more upvotes than let's say a Java answer with some very clever tricks or which took a lot of effort. BUT, this doesn't apply to just code-golfing languages, it applies to all languages in general! Still, people will also see the effort of those more complex answers and upvote for it -eventually- (but usually not nearly as much as the easier but shorter answers). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;To give some examples of answers of mine (in both 05AB1E and Java):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Short but upvoted a lot:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/180509/it-took-me-a-lot-of-time-to-make-this-pls-like-youtube-comments-1/180517#180517&quot;&gt;This 3-byte 05AB1E (legacy) program&lt;/a&gt; is currently my third most upvoted answer. Unlike the title of the challenge itself (&lt;em&gt;It took me a lot of time to make this, pls like.&lt;/em&gt;), it's a very straight-forward implementation and took barely any thought to create and post.&lt;/li&gt;&#xA;&lt;li&gt;Similar, &lt;a href=&quot;https://codegolf.stackexchange.com/a/113451/52210&quot;&gt;this 8-bytes Java answer&lt;/a&gt; is not only one of my shortest and most upvoted, but also the easiest of all Java answers I posted.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Longer and very complex answers:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/173126/52210&quot;&gt;123 bytes 05AB1E answer&lt;/a&gt;. 05AB1E doesn't have any date builtins, so I was calculating the next day as well as the day of the week manually. It took quite a bit of fiddling around to get it to work, write the explanation, and golf it down some more, but it doesn't have nearly as much upvotes as the earlier 3-bytes answer.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/157146/52210&quot;&gt;1290 bytes Java answer&lt;/a&gt; (which is even long for Java standards ;p). This challenge was unanswered for almost two years (for good reason), and it took quite a few hours before I had implemented all edge cases and fixed all bugs.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Still, whether it's Java or 05AB1E, and ASCII or a custom encoding, golfing in both languages is a pretty similar experience for me: &lt;strong&gt;complete a certain challenge by using the language's strong points and overcome certain weaknesses as short as possible, and have fun with it!&lt;/strong&gt; And although I appreciate the votes of course; whether I get 1 or 10 upvotes I don't really care about, as long as I had fun doing the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also don't really understand why you have a problem with Charcoal, Jelly, 05AB1E, etc., but not with Japt, GolfScript, etc.. Apart from copy-pasting characters depending on your keyboard, completing challenges in all of them would be fairly similar, as I mentioned in the last bold phrase above.&lt;/p&gt;&#xA;" OwnerUserId="52210" LastActivityDate="2019-11-08T14:46:57.980" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18252" PostTypeId="2" ParentId="2140" CreationDate="2019-11-08T19:09:46.047" Score="1" Body="&lt;h1&gt;&lt;strong&gt;Sort and Table a Sentence by Word Lengths&lt;/strong&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In as few bytes as possible, sort the input, &lt;em&gt;a delimited string OR list/vector/array of words containing printable ASCII except space&lt;/em&gt; into a table (or something resembling a table). I tried to make the table rules as code friendly as possible to allow golfing and non-golfing languages alike to compete. Table rules are as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;optional order, shortest to longest or vice versa, letter counts are required&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;formatting is not the challenge, but to repeat the above rule, letter count is required. So as long as the output is some form of numerically labelled rows of words, a numbered list, or a list of lists, or similar output, then it is a satisfactory answer.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;including/excluding gaps (NA values, see below examples for both methods of output)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;Word case is untouched. How the word appears in input should be shown in output.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input 1:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Code Golf and Coding Challenges Meta&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output 1:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 1. NA&#xA; 2. NA&#xA; 3. and&#xA; 4. Code Golf Meta&#xA; 5. NA&#xA; 6. Coding&#xA; 7. NA&#xA; 8. NA&#xA; 9. NA&#xA; 10. Challenges&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;or&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3. and&#xA;4. Code Golf Meta&#xA;6. Coding&#xA;10. Challenges&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;or&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[3, ['and']], [4, ['Code', 'Golf', 'Meta']], [6, ['Coding']], [10, ['Challenges']]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input 2:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;My very excellent mother just served us nine pizzas. #JusticeForPluto&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output 2:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1. NA&#xA;2. My us&#xA;3. NA&#xA;4. very just nine (alphabetized version: just nine very)&#xA;5. NA&#xA;6. mother served pizzas (mother pizzas served)&#xA;7. NA&#xA;8. NA&#xA;9. excellent&#xA;10. NA&#xA;11. NA&#xA;12. NA&#xA;13. NA&#xA;14. NA&#xA;15. NA&#xA;16. #JusticeForPluto&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;or&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2. My us&#xA;4. very just nine&#xA;6. mother served pizzas&#xA;9. excellent&#xA;16. #JusticeForPluto&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;or&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[2, ['My', 'us']], [4, ['very', 'just', 'nine']], [6, ['mother', 'served', 'pizzas']], [9, ['excellent']], [16, ['#JusticeForPluto']]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;More examples can be provided if necessary but I think this should suffice for now.&#xA;Please give me pointers, this is my second attempt at a challenge. (the first failed dramatically)&lt;/p&gt;&#xA;" OwnerUserId="82163" LastEditorUserId="82163" LastEditDate="2019-11-13T14:14:44.177" LastActivityDate="2019-11-13T14:14:44.177" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18253" PostTypeId="2" ParentId="2140" CreationDate="2019-11-08T22:07:30.717" Score="8" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/211839/pristine-polyglots&quot;&gt;Pristine Polyglots&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2020-09-30T12:22:18.247" LastActivityDate="2020-09-30T12:22:18.247" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="18255" PostTypeId="2" ParentId="2140" CreationDate="2019-11-09T22:57:29.197" Score="2" Body="&lt;h1&gt;Room volume as a function of paint on the walls/ceiling&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Task:&lt;/strong&gt; Write a function that will take in the size of a room (height, width, and length) and a number of paint layers (given that the layers are of a consistent thickness) and return the area of free space in the room after that many layers of paint are applied.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Requirements:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Return the final area left in the room after the paint layers are added&lt;/li&gt;&#xA;&lt;li&gt;should be able to run on a room of any size&lt;/li&gt;&#xA;&lt;li&gt;The answer must account for the decreasing area in the room as each layer is applied.&lt;/li&gt;&#xA;&lt;li&gt;number of layers and paint layer thickness should both be inputs&lt;/li&gt;&#xA;&lt;li&gt;must account for walls and ceiling&lt;/li&gt;&#xA;&lt;li&gt;standard loopholes are disallowed&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The winner is determined via byte count&lt;/p&gt;&#xA;" OwnerUserId="84746" LastActivityDate="2019-11-09T22:57:29.197" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18256" PostTypeId="1" CreationDate="2019-11-10T04:20:15.450" Score="21" ViewCount="324" Body="&lt;p&gt;Back when I was new to Code Golf SE (then PPCG), a lot of my questions didn't do too well, and I didn't have the experience to tell whether they were good challenged or not. As such, I would often blame it on anything I could, like post time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A few years later, I've started to wonder about whether or not post time affects post popularity. Long story short: it doesn't.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At first, it sounds plausible. If you post during a time when few people are online, such as when major timezones would be asleep, maybe fewer people would answer, vote, or comment, and your question would be buried.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I ran a simple SEDE query on Code Golf (&lt;code&gt;SELECT ViewCount, CreationDate FROM Posts WHERE PostTypeId = 1&lt;/code&gt; or similar), and copied the ~10k results from the downloadable CSV to a JS script (JavaScript, as I found out, is not great at data analysis). I created this badly formatted graph, on a logarithmic scale:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ldfc4.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ldfc4.png&quot; alt=&quot;Graph of results, basically just a random scatterplot&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The X axis is time, from &lt;code&gt;00:00:00&lt;/code&gt; to &lt;code&gt;23:59:59&lt;/code&gt; (UTC). The Y axis is logarithmic (radix 10), with each longer line (every 5 short lines) being 1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As you can see by the line of best fit (it looks a little high to me, but IDK), post time has pretty much no affect on popularity. The slope of said line is somewhere in the range of -21 views for each hour later in the day.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Being the nerd that I am, I noticed a seemingly higher density of dots to the right, indicating more posts, so I created another graph, which is oddly sinusoidal in appearance:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/tzCFR.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/tzCFR.png&quot; alt=&quot;A bar graph showing low question rates, then high question rates&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The X axis is hours (UTC, floored), and the Y axis is total number of questions, on a linear scale of 0 to 750. This graph is slightly more useful, showing that the highest number of questions are posted between &lt;code&gt;14:00:00&lt;/code&gt; and &lt;code&gt;21:00:00&lt;/code&gt; UTC. This is between morning and mid-afternoon in the US, and late afternoon to night in the UK.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can't seem to find much of a purpose for this information, but do what you want with it. I guess I wasted my time so you don't have to, although it's entirely feasible that I'm the only one boring enough to even think about this (:.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18262/the-relationships-between-question-length-views-and-votes-and-more-painful-gr?noredirect=1#comment65790_18262&quot;&gt;Part two: The relationships between question length, views, and votes&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="66833" LastEditDate="2021-06-30T02:33:03.750" LastActivityDate="2021-06-30T02:33:03.750" Title="Popularity of questions, based on post time (and the most useless graph ever)" Tags="|discussion|asking-questions|statistics|" AnswerCount="0" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="18261" PostTypeId="2" ParentId="2140" CreationDate="2019-11-10T14:27:51.787" Score="0" Body="&lt;p&gt;Draw a hexagonal grid &lt;code&gt;n×m&lt;/code&gt; of ascii hexagons&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  ____&#xA; /    \&#xA;/      \&#xA;\      /&#xA; \____/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;with numbers somewhere within each of them, such as numbers goes in snail order starting in the center (but without empty hexagons):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  ____        ____        ____        ____        ____        ____&#xA; /    \      /    \      /    \      /    \      /    \      /    \&#xA;/      \____/      \____/      \____/      \____/      \____/      \&#xA;\      /    \      /    \      /    \      /    \      /    \      /&#xA; \____/      \____/      \____/  25  \____/      \____/      \____/&#xA; /    \      /    \      /    \      /    \      /    \      /    \&#xA;/      \____/      \____/  26  \____/  24  \____/      \____/      \&#xA;\      /    \      /    \      /    \      /    \      /    \      /&#xA; \____/      \____/  27  \____/  11  \____/  23  \____/      \____/&#xA; /    \      /    \      /    \      /    \      /    \      /    \&#xA;/      \____/  28  \____/  12  \____/  10  \____/  22  \____/      \&#xA;\      /    \      /    \      /    \      /    \      /    \      /&#xA; \____/      \____/  13  \____/  3   \____/  9   \____/  40  \____/&#xA; /    \      /    \      /    \      /    \      /    \      /    \&#xA;/      \____/  29  \____/  4   \____/  2   \____/  21  \____/      \&#xA;\      /    \      /    \      /    \      /    \      /    \      /&#xA; \____/      \____/  14  \____/  1   \____/  8   \____/  39  \____/&#xA; /    \      /    \      /    \      /    \      /    \      /    \&#xA;/      \____/  30  \____/  5   \____/  7   \____/  20  \____/      \&#xA;\      /    \      /    \      /    \      /    \      /    \      /&#xA; \____/      \____/  15  \____/  6   \____/  19  \____/  38  \____/&#xA; /    \      /    \      /    \      /    \      /    \      /    \&#xA;/      \____/  31  \____/  16  \____/  18  \____/  37  \____/      \&#xA;\      /    \      /    \      /    \      /    \      /    \      /&#xA; \____/      \____/  32  \____/  17  \____/  36  \____/      \____/&#xA; /    \      /    \      /    \      /    \      /    \      /    \&#xA;/      \____/      \____/  33  \____/  35  \____/      \____/      \&#xA;\      /    \      /    \      /    \      /    \      /    \      /&#xA; \____/      \____/      \____/  34  \____/      \____/      \____/&#xA; /    \      /    \      /    \      /    \      /    \      /    \&#xA;/      \____/      \____/      \____/      \____/      \____/      \&#xA;\      /    \      /    \      /    \      /    \      /    \      /&#xA; \____/      \____/      \____/      \____/      \____/      \____/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="41420" LastActivityDate="2019-11-10T14:27:51.787" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18262" PostTypeId="1" CreationDate="2019-11-11T03:51:24.863" Score="9" ViewCount="263" Body="&lt;p&gt;I recently meta'd some &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18256/popularity-of-questions-based-on-post-time-and-the-most-useless-graph-ever&quot;&gt;interesting research&lt;/a&gt; I'd done relating to the correlation (or lack of) between the time a question is asked and its view count. I got some comments suggesting I look into other interesting things, so I dusted off my text editor (lots of dust builds up in 23 hours, I guess) and did some analysis.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I first caused my computer to hate me eternally by repeatedly analyzing 30.7MB of raw post contents, parsing the HTML to get the plain text version. I created this graph (badly labeled and with a log10 scale for both axes), showing the relationship between length in characters (X) and view count (Y):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/FMSFZ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/FMSFZ.png&quot; alt=&quot;a graph showing a slight increase in post view count with longer body&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The red line is the line of best fit, which looks a little odd on a graph with both axes logarithmically scaled (not sure if I'm even allowed to do that). The estimate it gives is that a post will get 6.3 more views for each 100 characters added to the body. You'd get better results just by posting 15 minutes earlier, according to my last graph.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With all of this nice data available, I decided to do something more interesting: look at the relationship between view count and votes. With a log10 X axis and a log5 Y axis (I don't think I'm supposed to do that, but oh well), here's a histogram (I think that's what it's called) sort of graph:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/V5YD0.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/V5YD0.png&quot; alt=&quot;a graph showing a fairly predictable trend for views/votes&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's very little to no data for smaller numbers of views, and also very little for very large ones. It's a fairly predictable trend, with vote score (y axis) pretty much proportional (or exponential?) to view count (x axis). Feel free to comment about any issues with my math or phrasing, as the extent of my knowledge as of now is Algebra II and some googling.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also did a linear regression on the views/votes, and got a surprisingly high (100s of times higher than any others so far in these graphs) R squared value of 0.52. It seems that about 1 out of every 500 views equals an upvote. And to anyone who's wondering, the best views-to-score ratio is 10.5:1, on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/70335/the-powerful-connection&quot;&gt;this question&lt;/a&gt;, which currently has 14 upvotes and 147 views.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Use this information however you please, if you ever find a reason :)&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="66833" LastEditDate="2021-06-29T17:13:30.973" LastActivityDate="2021-06-29T17:13:30.973" Title="The relationships between question length, views, and votes (and more painfully unlabeled graphs)" Tags="|discussion|voting|statistics|" AnswerCount="0" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18263" PostTypeId="2" ParentId="2140" CreationDate="2019-11-11T14:27:02.260" Score="0" Body="&lt;p&gt;&lt;strong&gt;Monokeyed Words&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(Based on &lt;a href=&quot;https://what-if.xkcd.com/75/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://what-if.xkcd.com/75/&lt;/a&gt;)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Old mobile phones had letters and numbers assigned to the same key, as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1&lt;/li&gt;&#xA;&lt;li&gt;2abc&lt;/li&gt;&#xA;&lt;li&gt;3def&lt;/li&gt;&#xA;&lt;li&gt;4ghi&lt;/li&gt;&#xA;&lt;li&gt;5jkl&lt;/li&gt;&#xA;&lt;li&gt;6mno&lt;/li&gt;&#xA;&lt;li&gt;7pqrs&lt;/li&gt;&#xA;&lt;li&gt;8tuv&lt;/li&gt;&#xA;&lt;li&gt;9wxyz&lt;/li&gt;&#xA;&lt;li&gt;0 [space]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;From any given list of words or phrases (arbitrary number of inputs, formed of 0-9 a-z and space), find the word which has the most consecutive characters on the same key, and output the key and the count (in any reasonable format)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;for example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;[nonmonogamous],[qwerty],[false]&lt;/code&gt; -&gt; &lt;code&gt;7, 6&lt;/code&gt; (seven times on the 6 key - nonmonogamous)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[tutu],[cat],[mouse]&lt;/code&gt; -&gt; &lt;code&gt;4, 8&lt;/code&gt; (four times on the 8 key - tutu)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[cab],[mon],[tin],[tom]&lt;/code&gt; -&gt; &lt;code&gt;3,2&lt;/code&gt; (cab) or &lt;code&gt;3,6&lt;/code&gt; (mon) - either answer is valid&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[#],[!!!],[is this valid?]&lt;/code&gt; -&gt; any output or error - doesn't fit valid inputs. &lt;code&gt;2,4&lt;/code&gt; would also be acceptable, for &lt;code&gt;hi&lt;/code&gt; in &lt;code&gt;is this valid?&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;bacmon&lt;/code&gt;, &lt;code&gt;habitat&lt;/code&gt;, &lt;code&gt;fringe&lt;/code&gt;, &lt;code&gt;be&lt;/code&gt;, &lt;code&gt;test&lt;/code&gt;, &lt;code&gt;valid&lt;/code&gt; -&gt; &lt;code&gt;3,2&lt;/code&gt; or &lt;code&gt;3,6&lt;/code&gt; as it's a tie between those keys&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;01452301146&lt;/code&gt; -&gt; &lt;code&gt;2,1&lt;/code&gt; (two in a row on the 1 key)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The output format isn't fixed, so you could also output &lt;code&gt;[3][6]&lt;/code&gt; or &lt;code&gt;3.6&lt;/code&gt; or &lt;code&gt;6,3&lt;/code&gt; - anything you like, as long as it's consistent which is the key and which the number of repetitions. You could also use one of the letters to represent the key, if you wanted - e.g. instead of &lt;code&gt;3,6&lt;/code&gt; you could output &lt;code&gt;3,m&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, usual exclusions etc. apply&lt;/p&gt;&#xA;" OwnerUserId="62289" LastEditorUserId="62289" LastEditDate="2019-11-13T09:35:44.967" LastActivityDate="2019-11-13T09:35:44.967" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18266" PostTypeId="2" ParentId="7683" CreationDate="2019-11-14T07:31:19.823" Score="11" Body="&lt;p&gt;As of &lt;a href=&quot;https://stackoverflow.blog/2019/11/13/were-rewarding-the-question-askers/&quot;&gt;yesterday, November 13th 2019&lt;/a&gt;, this is now in effect network wide:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;We’re changing the reputation earned from getting a question upvote to ten points, making it equal to the reputation earned from an upvote to an answer.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="38979" LastActivityDate="2019-11-14T07:31:19.823" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18269" PostTypeId="1" CreationDate="2019-11-14T21:04:18.630" Score="-42" ViewCount="1982" Body="&lt;p&gt;This community last had an election last year, and has recently seen their moderator team reduced by two. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;As such, by request of the remaining two moderators on the team, and to find replacements for Mego and Dennis, we're looking at scheduling an election to start somewhere in January 2020. To avoid finding ourselves in a situation where an election would fail due to an insufficient number of candidates, though, I'm posting this to try to assess the community members' willingness to step up and nominate themselves, when the actual election's nomination period starts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please leave an answer if you'd be willing to run for a moderator position, should we decide to run an election. Like I mentioned, we're looking at scheduling the nomination period to start some time in January '20.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;NOTE:&lt;/strong&gt; This is not an official election nomination thread, just a &quot;pulse check&quot; to get a notion of how many people here would be willing to step up, so you don't have to put up your whole election nomination.&lt;/p&gt;&#xA;" OwnerUserId="38734" LastEditorUserId="38734" LastEditDate="2019-11-19T14:47:20.103" LastActivityDate="2019-11-21T18:21:00.577" Title="January 2020 Moderator Election — Community Interest Check" Tags="|discussion|moderators|election|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18272" PostTypeId="2" ParentId="2140" CreationDate="2019-11-14T23:53:07.570" Score="1" Body="&lt;h1&gt;Sand timer puzzler (code-golf)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I was googling for a sand timer and found this little item: &lt;a href=&quot;https://rads.stackoverflow.com/amzn/click/com/B01M0GETKJ&quot; rel=&quot;nofollow noreferrer&quot; rel=&quot;nofollow noreferrer&quot;&gt;set of joined sand timers&lt;/a&gt;, for 3, 4, and 5 minutes each. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;That of course reminded me of &lt;a href=&quot;http://www.mytechinterviews.com/9-minutes&quot; rel=&quot;nofollow noreferrer&quot;&gt;multiple puzzles&lt;/a&gt; about measuring X minutes using only M- and N-minute timers or whatever.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The mission then, if you choose to accept, is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;write a program that takes 3 integer inputs 0&amp;lt;A&amp;lt;B&amp;lt;C&amp;lt;100&#xA;and outputs list of all possible times that can be measured&#xA;using 3 joined sand timers A, B, and C up to 2 hrs&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[in progress]&lt;/p&gt;&#xA;" OwnerUserId="80759" LastEditorUserId="80759" LastEditDate="2019-11-15T00:41:02.110" LastActivityDate="2019-11-15T00:41:02.110" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18274" PostTypeId="2" ParentId="18269" CreationDate="2019-11-15T03:07:42.303" Score="14" Body="&lt;p&gt;I would run. However, if I am elected, I'll step down. I don't think it is right to replace Mego and Dennis, who are clearly better candidates than me.&lt;/p&gt;&#xA;" OwnerUserId="48922" LastActivityDate="2019-11-15T03:07:42.303" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18275" PostTypeId="1" CreationDate="2019-11-15T05:18:45.773" Score="16" ViewCount="340" Body="&lt;p&gt;According to the &lt;a href=&quot;https://codegolf.stackexchange.com/site-analytics&quot;&gt;site analytics tool&lt;/a&gt; (for those who have access to it), we got a huge spike in views on November 5th.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/73hUo.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/73hUo.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(where green is new visitors, blue is total visits and orange is total page views)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In fact, this is higher than any other period since traffic started being recorded (sometime in Feb 2018) and it pretty much immediately subsides into normal levels by the next day. This spike was not accompanied by more posts, nor more votes, nor do any of the questions posted around that time have any more views than normal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does anyone know whether a post was linked somewhere or some other reason that might account for these ~10,000 extra new viewers?&lt;/p&gt;&#xA;" OwnerUserId="76162" LastEditorUserId="76162" LastEditDate="2019-11-15T05:34:25.857" LastActivityDate="2019-11-15T05:34:25.857" Title="Why did CGCC get so many views on November 5th?" Tags="|discussion|" AnswerCount="0" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18277" PostTypeId="2" ParentId="2140" CreationDate="2019-11-15T19:13:23.037" Score="0" Body="&lt;h1&gt;Description&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Cornhole&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cornhole&lt;/a&gt; is a game in which players take turns throwing bags filled with corn kernels(or other fillers) onto a wooden board with a hole in the far end. If a bag goes through the hole, it counts as 3 points. If a bag stays on top of the board without falling off it counts as 1 point.&lt;/p&gt;&#xA;&lt;p&gt;Score is taken at the end of each round in which the two players throw 4 bags (alternating). Only the net score is calculated.&lt;/p&gt;&#xA;&lt;p&gt;The first to &lt;strong&gt;exactly&lt;/strong&gt; 21 points is the winner. If a player were to score points in a round that would bring them to exceed 21 points, the points for that round are subtracted from the players score.&lt;/p&gt;&#xA;&lt;h1&gt;Rule&lt;/h1&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Given an array of scores from multiple rounds of Cornhole, determine the current score of the game.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;The input will be an array of one or more rounds of scores for each bag throw by both players alternating. (you may choose any 3 distinct symbols to cover the scenario of misses, 1 point, or 3 points)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt; [0,0,1,0,3,3,1,1,0,0,1,0,3,3,1,1]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In this scenario&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Player A missed the first shot, Player B missed their first shot, Player A landed the bag on the board for their second shot, Player B missed their second shot, Player A made it in the hole for their third shot, Player B made it in the hole for their third shot, Player A landed on the board for their fourth shot, and Player B landed on their board for their fourth shot.&lt;/li&gt;&#xA;&lt;li&gt;In the next round of play, Player A missed the first shot, Player B missed their first shot, Player A landed the bag on the board for their second shot, Player B missed their second shot, Player A made it in the hole for their third shot, Player B made it in the hole for their third shot, Player A landed on the board for their fourth shot, and Player B landed on their board for their fourth shot.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;The score of the Cornhole match as an array of two numbers. From the input above, the output would be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[2,0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; Insert multiple samples of scoring, including one example of a player scoring over 21 and losing points&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76365" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-11-15T19:13:23.037" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18278" PostTypeId="2" ParentId="2140" CreationDate="2019-11-15T22:25:48.427" Score="2" Body="&lt;p&gt;List of integers to pairs &lt;strong&gt;?? Any suggestions for the title ??&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a function or a full program taking a &lt;i&gt;list of non negative integers numbers&lt;/i&gt; &lt;code&gt;L&lt;/code&gt; that outputs a &lt;i&gt;pair&lt;/i&gt; of numbers [&lt;code&gt;X , Y&lt;/code&gt;] such that &lt;i&gt;X %( Y + i )  == L [ i ] &lt;/i&gt; .&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output specifications&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can output &lt;code&gt;X Y&lt;/code&gt; in any order, just indicate it and be consistent.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;X Y&lt;/code&gt; are also unsigned integers, obviously &lt;code&gt;Y&lt;/code&gt; must be greater than &lt;code&gt;0&lt;/code&gt; to avoid modulo 0 errors.&lt;/li&gt;&#xA;&lt;li&gt;If your language doesn't support 0 indexed list you can consider &lt;i&gt;X %( Y + i )  == L [ i &lt;strong&gt;+ 1&lt;/strong&gt; ] &lt;/i&gt; &lt;strong&gt;?? Any suggestions how to handle this ??&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[ 1, 2, 3 ] =&gt; [ 11, 2 ]&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA; 11 %( 2 + 0 ) = 1&#xA; 11 %( 2 + 1 ) = 2&#xA; 11 %( 2 + 2 ) = 3&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;[ 10, 2 ] =&gt; [ 98, 11 ]&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA; 98 %( 11 + 0 ) = 10&#xA; 98 %( 11 + 1 ) = 2&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;[ input ] , [ output ] pairs&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;[ 0, 1, 2 ] ,  [ 5, 1 ]&#xA;[ 1, 2 ] ,  [ 5, 2 ]&#xA;[ 1, 2, 3 ] ,  [ 11, 2 ]&#xA;[ 1, 2, 3, 4, 5 ] ,  [ 59, 2 ]&#xA;[ 4, 3, 2, 1, 0 ] ,  [ 9, 5 ]&#xA;[ 6, 12, 18 ] ,  [ 3318, 18 ]&#xA;[ 27, 18, 9 ] ,  [ 279, 28 ]&#xA;[ 3, 9, 27 ] ,  [ 4059, 26 ]&#xA;[ 2, 4, 8, 16 ] ,  [ 8584, 14 ]&#xA;[ 0, 0, 0, 0, 0, 0 ] ,  [ 60, 1 ]&#xA;[ 1, 1, 1, 1 ] ,  [ 61, 2 ]&#xA;[ 120, 20 ] ,  [ 12220, 121 ]&#xA;[ 10, 2 ] ,  [ 98, 11 ]&#xA;[ 9, 8, 7, 0 ] ,  [ 1339, 10 ]&#xA;[ 0, 1, 4, 9, 2, 10, 4, 15, 10, 5, 0, 16, 12, 8, 4, 0, 22, 19, 16, 13 ] ,  [ 100, 10 ]&#xA;[ 9, 99, 90, 81, 72, 63, 54, 45, 36, 27 ] ,  [ 999, 99 ]&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input/output can be given by &lt;a href=&quot;http://meta.codegolf.stackexchange.com/q/2447/42963&quot;&gt;any convenient method&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You can print it to STDOUT or return it as a function result.&lt;/li&gt;&#xA;&lt;li&gt;Either a full program or a function are acceptable.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://meta.codegolf.stackexchange.com/q/1061/42963&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so all usual golfing rules apply, and the shortest code (in bytes) wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;" OwnerUserId="84844" LastEditorUserId="84844" LastEditDate="2019-11-17T17:53:58.230" LastActivityDate="2019-11-17T17:53:58.230" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18281" PostTypeId="2" ParentId="2140" CreationDate="2019-11-16T21:56:49.230" Score="-3" Body="&lt;p&gt;&lt;strong&gt;Writing a WebCrawler&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Design a web crawler that recursively extracts all the hyperlinks from the HTML of the web page and does the same for every hyperlinked page it finds. The webcrawler must store the hyperlinks in a separate file&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;How The WebCrawler Works&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First the webcrawler should download the HTML file of the URL the user inputted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Second the webcrawler will copy every single hyperlink embedded in the hyperlink and paste it into an output text file. The best general way to do this based on my experience is to have the webcrawler iteratively search through the HTML file for an &quot;a href&quot; tag. Be careful about what kind of hyperlinks are embedded in those tags. Sometimes only the subdomain directories of a complete hyperlink are embedded in this&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example: &lt;a href=&quot;https://en.wikipedia.org/wiki/Toyota&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://en.wikipedia.org/wiki/Toyota&lt;/a&gt; may simply have an a href tag in the HTML file of a webpage as: &quot;/wiki/Toyota&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;After extracting all the hyperlinks of the first webpage, visit all the hyperlinks found on the base webpage starting from the the first hyperlink found and repeat all the steps above. The only exception to doing this is obviously if the hyperlink fails to lead to an HTML page.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The program must accept only one URL as input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A text file that lists every hyperlink that it finds.&#xA;Note:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your webcrawler must avoid revisiting webpages it has already crawled. This can cause the crawler get trapped in a &quot;circular link loop&quot; where it continously visits the same pages endlessly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Special consideration will be given to submissions that prove they are capable of crawling deep web websites, including those with the .onion sites.&lt;/p&gt;&#xA;" OwnerUserId="82881" LastEditorUserId="82881" LastEditDate="2019-11-16T22:26:18.570" LastActivityDate="2019-11-16T22:26:18.570" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18284" PostTypeId="2" ParentId="2140" CreationDate="2019-11-18T00:54:14.697" Score="0" Body="&lt;p&gt;Sandbox reviewers, thanks for checking this out. I posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/195881/reconstruct-a-video-where-the-frames-pixels-have-been-shuffled&quot;&gt;this&lt;/a&gt; question (after a few revisions) as a code challenge and pretty much no one likes it. Please give some feedback as to why it's not appropriate, clear, fun, or whatever other criticism you have. I think it's a very interesting problem and I'd love to see some other approaches to it along with some interesting language choices :).&lt;/p&gt;&#xA;&lt;p&gt;I think the main criticism is how to measure accuracy. I've added a script to calculate a score between the competition video and whatever video contestants submit. Please tell me why that is insufficient, or unfair, unclear, etc.&lt;/p&gt;&#xA;&lt;p&gt;Again, any feedback for improvement is welcome! I really want to see some interesting solutions :).&lt;/p&gt;&#xA;&lt;p&gt;Thanks again for reviewing!&lt;/p&gt;&#xA;&lt;h1&gt;TITLE: Reconstruct a video where the frames' pixels have been shuffled&lt;/h1&gt;&#xA;&lt;p&gt;Given a video where all the pixels of every frame have been scrambled with some image scrambling function T(frame), reconstruct the original. T only operates on one frame at a time and has no persistent state between invocations. It's just a constant random map that shuffles pixels to new locations each frame. T is constant and performs the same permutation each frame.&lt;/p&gt;&#xA;&lt;p&gt;Essentially you have to recover all of the spatial information that's been removed.&lt;/p&gt;&#xA;&lt;p&gt;Prepare to bake your noodle golfers, this is a doozy!&lt;/p&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;Since the spatial mapping needs to be determined, the scrambled video source needs to be something with significant motion. An example would be an episode of your favorite sitcom. Lots of colors, lots of movement between and around frames.&lt;/p&gt;&#xA;&lt;p&gt;Simple example of the scrambling function T(frame):&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;SourceImage = [44,22,33,55]&#xA;&#xA;T(SourceImage) = [33,44,22,55]&#xA;&#xA;T maps {0:2, 1:0, 2:1, 3:3}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This example has the image in a 1D array.&#xA;For the problem however, the image would be a 2D RGB image.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You are allowed to process the entire video to determine Ti.&lt;/li&gt;&#xA;&lt;li&gt;Ti does not have to be a 100% perfect inverse, which my not even be possible depending on the input.&lt;/li&gt;&#xA;&lt;li&gt;No loopholes. Your program should at a minimum take the example scrambled video as input ('scrambled_city.mp4' below) and output the unscrambled video that is as close to the original as possible ('city.mp4').&lt;/li&gt;&#xA;&lt;li&gt;After producing the output video, calculate your score with the provided average MSE python script below.&lt;/li&gt;&#xA;&lt;li&gt;Submit your unscrambled program source, your average MSE score and your calculated unscrambled video file, see &lt;strong&gt;Submission&lt;/strong&gt; below.&lt;/li&gt;&#xA;&lt;li&gt;Providing your source code and unscrambled video lets the hivemind confirm your submission is honest.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;The answer which most accurately reconstructs the video is the winner.&#xA;Accuracy will be calculated as the avgerage of &lt;a href=&quot;https://en.wikipedia.org/wiki/Mean_squared_error&quot; rel=&quot;nofollow noreferrer&quot;&gt;Mean Squared Error (MSE)&lt;/a&gt; of all hidden source and corresponding reconstructed frames, nothing fancy, and should be as close to 0 as possible.&lt;/p&gt;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Unscrambling a randomly shuffled image by itself is impossible. A video is different, it's possible to some degree.&lt;/li&gt;&#xA;&lt;li&gt;Feel free to post any algorithms already known to accomplish this.&lt;/li&gt;&#xA;&lt;li&gt;This problem is very difficult so if you can generate any unscrambled images that don't look like pure garbage consider yourself a success.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Competition Videos&lt;/h2&gt;&#xA;&lt;p&gt;Hidden source video &lt;strong&gt;'city.mp4'&lt;/strong&gt;: &lt;a href=&quot;https://drive.google.com/open?id=1B-s2MmIzq6F6vBIvQTySHkdvPqm0hbZX&quot; rel=&quot;nofollow noreferrer&quot;&gt;Full Hidden Source Video&lt;/a&gt;&#xA;Your algorithm should work without access to this!&#xA;&lt;a href=&quot;https://i.stack.imgur.com/ljVOF.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ljVOF.jpg&quot; alt=&quot;Frame 250&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Scrambled video (seed 9001) &lt;strong&gt;'scrambled_city.mp4'&lt;/strong&gt;: &lt;a href=&quot;https://drive.google.com/open?id=1NwQF3aciZCmhlxSTBQrmP1QmsOxELWQp&quot; rel=&quot;nofollow noreferrer&quot;&gt;Full Scrambled Video - 2GB&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/KssUY.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/KssUY.jpg&quot; alt=&quot;Frame 250 - Scrambled&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://mazwai.com/video/one-big-picnic/455035&quot; rel=&quot;nofollow noreferrer&quot;&gt;source webpage for other videos to use&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Python code to generate test cases for you:&lt;/h2&gt;&#xA;&lt;p&gt;This will take a video (infile) and output it's scrambled version (outfile).&lt;/p&gt;&#xA;&lt;p&gt;Dependency: opencv2+ (pip3 install opencv-python)&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;import cv2&#xA;&#xA;infile = 'city.mp4'&#xA;outfile = 'scrambled_city.avi'&#xA;seed = 9001&#xA;&#xA;def scramble(image):&#xA;    copy = image.copy()&#xA;    # reset the seed each frame so we have constant transform function.&#xA;    cv2.setRNGSeed(seed) &#xA;    cv2.randShuffle(copy)&#xA;    return copy&#xA;&#xA;# Open video, read first frame&#xA;vidcap = cv2.VideoCapture(infile)&#xA;success,image = vidcap.read()&#xA;&#xA;# Create video writer with same dimensions&#xA;h,w,layers = image.shape&#xA;size = (w,h)&#xA;outvideo = cv2.VideoWriter(outfile,cv2.VideoWriter_fourcc(*'MPEG'), 30, size, True)&#xA;print( 'videosize: %s\n'%repr(size))&#xA;&#xA;count = 0&#xA;while success:&#xA;    scrambled = scramble(image)&#xA;    # DUMP SCRAMBLED JPG&#xA;    #cv2.imwrite(&amp;quot;frame%d.jpg&amp;quot; % count, scrambled)&#xA;&#xA;    # VIDEO FRAME OUTPUT&#xA;    outvideo.write(scrambled)&#xA;&#xA;    print( 'frame: %d   %s'%(count,str(success)) , end='\r') &#xA;    count += 1&#xA;    success,image = vidcap.read()&#xA;&#xA;outvideo.release()&#xA;vidcap.release()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Python code to calculate avg Mean Square Error over two videos&lt;/h2&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;import cv2&#xA;import numpy as np&#xA;&#xA;infile1 = 'city.mp4'&#xA;infile2 = 'scrambled_city.avi'&#xA;&#xA;# https://www.pyimagesearch.com/2014/09/15/python-compare-two-images/&#xA;def mse(imageA, imageB):&#xA;    # the 'Mean Squared Error' between the two images is the&#xA;    # sum of the squared difference between the two images;&#xA;    # NOTE: the two images must have the same dimension&#xA;    err = np.sum((imageA.astype(&amp;quot;float&amp;quot;) - imageB.astype(&amp;quot;float&amp;quot;)) ** 2)&#xA;    err /= float(imageA.shape[0] * imageA.shape[1])&#xA;    &#xA;    # return the MSE, the lower the error, the more &amp;quot;similar&amp;quot;&#xA;    # the two images are&#xA;    return err&#xA;&#xA;# Open video, read first frame&#xA;vid1 = cv2.VideoCapture(infile1)&#xA;success1,image1 = vid1.read()&#xA;vid2 = cv2.VideoCapture(infile2)&#xA;success2,image2 = vid2.read()&#xA;count = 0&#xA;sumMSE = 0&#xA;while success1 and success2:&#xA;    sumMSE += mse(image1,image2)&#xA;    count += 1&#xA;    print( 'frame: %d    avgMSE=%f'%(count,sumMSE/float(count)) , end='\r') &#xA;    success1,image1 = vid1.read()&#xA;    success2,image2 = vid2.read()&#xA;&#xA;print(&amp;quot;\n[Frames: %d] Avg MSE = %f&amp;quot;%(count,sumMSE/float(count)))&#xA;vid1.release()&#xA;vid2.release()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Example output avgMSE of city.mp4 and scrambled_city.avi:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;[Frames: 5113] avg MSE = 18079.870445918445&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Example output avgMSE of city.mp4 and city.mp4:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;[Frames: 5113] avg MSE = 0.000000&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;SUBMISSION + HIDDEN TEST CASES&lt;/h2&gt;&#xA;&lt;p&gt;When you're ready to submit your solution, please score your submission against the example video and for fun include unscrambled versions of the three test cases below.&lt;/p&gt;&#xA;&lt;p&gt;First (required):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your solution code. No code provided is disqualification.&lt;/li&gt;&#xA;&lt;li&gt;Submit the avg MSE for your reconstructed 'scrambled_city.mp4' and the first example video, 'city.mp4', you calculate from the provided python script.&lt;/li&gt;&#xA;&lt;li&gt;Your unscrambled video file (suggestion: host on youtube or G-drive).&lt;/li&gt;&#xA;&lt;li&gt;You do not need to include your calculation of T or Ti, the visual media you provide (step above) will be enough to prove your algorithm works and score it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;~~ Lowest score wins. Good luck!  ~~&lt;/p&gt;&#xA;&lt;p&gt;Second (optional for fun): You can submit your completely unscrambled videos OR you can submit the unscrambled frames 250,500,750,1000 for all 3 of the test cases below. It will be pretty clear if you solved it or not. They're very recognizable scenes.&lt;/p&gt;&#xA;&lt;p&gt;Note: The youtube preview is terribly distorted. The downloaded files are much better quality.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://drive.google.com/open?id=173fMIDnA5SBI3MjuxUdPYV8qvL4CqDTp&quot; rel=&quot;nofollow noreferrer&quot;&gt;video 1&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://drive.google.com/open?id=1qzrJoZ2I4lA86AlXQtohOueuf0PCFQ3o&quot; rel=&quot;nofollow noreferrer&quot;&gt;video 2&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://drive.google.com/open?id=1ykYeFrKWP-VT8TsjSPOhfQWZ80XENnqq&quot; rel=&quot;nofollow noreferrer&quot;&gt;video 3 - HARD&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="90420" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-11-19T08:26:27.523" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18285" PostTypeId="2" ParentId="2140" CreationDate="2019-11-18T04:59:12.360" Score="1" Body="&lt;p&gt;edit: check it out live here! &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/196850/play-big-2-by-yourself-as-fast-as-you-can&quot;&gt;Play Big 2 by yourself, as fast as you can&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="74526" LastEditorUserId="74526" LastEditDate="2019-12-10T15:08:09.387" LastActivityDate="2019-12-10T15:08:09.387" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="18286" PostTypeId="2" ParentId="2140" CreationDate="2019-11-18T08:35:47.093" Score="0" Body="&lt;h2&gt;SandChallenges for Proposed box [draft] &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this challenge you should simulate how &quot;challenges&quot; interact with each other. (You need to output how many iterations have the &quot;challenges&quot; done.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Symbols used in the documentation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;SandChallenges is played on a 3x3 grid.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;X&lt;/code&gt; represents a challenge. It challenges the grid next to its position.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;&lt;/code&gt; represents an empty sandpile. This is what the &quot;challenges&quot; move in their actions.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;.&lt;/code&gt; represents moving sandpiles and is only used in this documentation. Input will never contain those characters; it instead will only contain &lt;code&gt;X&lt;/code&gt; and &lt;code&gt;&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;A closer look at &lt;code&gt;X&lt;/code&gt; challenges&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are sandpiles between those &quot;challenges&quot;. When a &quot;challenge&quot; is active, it pushes sand towards the next grid. The next grid is described as the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The next grid is usually the grid on the right.&lt;/li&gt;&#xA;&lt;li&gt;If the grid is on the right edge, the next grid becomes the first grid of the next line.&lt;/li&gt;&#xA;&lt;li&gt;If the grid is on the last line, the next grid becomes the first grid of the first line.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ABC&#xA;DEF&#xA;GHI&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The next grid of &lt;code&gt;A&lt;/code&gt; is &lt;code&gt;B&lt;/code&gt;, the next grid of &lt;code&gt;C&lt;/code&gt; is &lt;code&gt;D&lt;/code&gt;, and the next grid of &lt;code&gt;I&lt;/code&gt; is &lt;code&gt;A&lt;/code&gt;.&#xA;&lt;hr/&gt;&#xA;Another rule: they can get buried by active sandpiles. This makes them fail to function.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Spaces are replaced with semicolons for readability problems.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;X;;&#xA;;;;&#xA;;;;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;-&gt; (Affecting the next cell)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;X.;&#xA;;;;&#xA;;;;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;-&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;X..    X..    X..           X..&#xA;;;; -&amp;gt; .;; -&amp;gt; ..; -&amp;gt; ... -&amp;gt; ...&#xA;;;;    ;;;    ;;;           ...&#xA;&#xA;After that the &quot;challenge&quot; gets buried by active sandpiles, which results in the following state:&#xA;&#xA;...&#xA;...&#xA;...&#xA;&#xA;This box had went through 9 changes before it stops.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr/&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;XXX    ...&#xA;XXX -&amp;gt; ...&#xA;XXX    ...&#xA;&#xA;This means that the challenge had went through 1 change before it stops. All of them push active sand and buries themselves simultaneously.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr/&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;X;;    X.;&#xA;;X; -&amp;gt; ;X.&#xA;;;X    ;;X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The bottom-right challenge shoots active sand, which buries the active challenge in the same iteration:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;..;    ...    ...    ...&#xA;;X. -&amp;gt; ;X. -&amp;gt; .X. -&amp;gt; ...&#xA;;;X    .;X    ..X    ...&#xA;&#xA;This goes through 4 iterations.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr/&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;X;;    X.;    X..    ...&#xA;X;; -&amp;gt; X.; -&amp;gt; X.. -&amp;gt; ...&#xA;X;;    X.;    X..    ...&#xA;&#xA;This goes though 3 iterations.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr/&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;X;X    X.X    ...    ...&#xA;;X; -&amp;gt; .X. -&amp;gt; ... -&amp;gt; ...&#xA;;X;    ;X.    .X.    ...&#xA;&#xA;This goes through 3 iterations.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr/&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;X;X    ..X    ...&#xA;;X; -&amp;gt; .X. -&amp;gt; ...&#xA;X;X    X.X    ...&#xA;This goes through 2 iterations.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input/output can be given by &lt;a href=&quot;http://meta.codegolf.stackexchange.com/q/2447/42963&quot;&gt;any convenient method&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You can print it to STDOUT or return it as a function result.&lt;/li&gt;&#xA;&lt;li&gt;Either a full program or a function are acceptable.&lt;/li&gt;&#xA;&lt;li&gt;Any amount of extraneous whitespace is permitted, provided the characters line up appropriately.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://meta.codegolf.stackexchange.com/q/1061/42963&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest code wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this clear enough? Any better wordings for sections?&lt;/li&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Tags are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;. Any suggestions?&lt;/li&gt;&#xA;&lt;li&gt;Any further feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-11-18T23:20:01.707" LastActivityDate="2019-11-18T23:20:01.707" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18287" PostTypeId="2" ParentId="2140" CreationDate="2019-11-18T19:12:02.530" Score="-1" Body="&lt;h1&gt;Parse a regex&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Grep is a wonderful tool. It can find stuff in files, it can help you spell stuff correctly (&lt;code&gt;grep 'whatever' /usr/share/dict/words&lt;/code&gt; or wherever that file is), and it can even test if something is a prime number!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, the first version was implemented back in the golden age, when FORTRAN was respected, Pascal was the language for beginners, and object orientation was just starting out in on its great adventure.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One could argue that modern developers have nowhere near that much talent or skill, what with their flashy &quot;IDEs&quot; and &quot;frameworks&quot;. If they would be asked to implement something similar, they would just jump at the nearest library or cloud thingimabob and say &quot;Done!&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At least, that is what some would say. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Prove them wrong! Golf grep!&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Parse a regular expression without calling any built-in functions or operators explicitly meant for this.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;input:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Basically the same as a simple grep: a regular expression as a command line parameter, followed by an optional filename or a dash. If the filename is not present, or it is a dash, read for stdin.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is the recommended way to do it, but if you can write an adapter (eg: post stuff to a php form for your program via a shell script), then that is OK as well. The adapter does not contribute to your score.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Lines that match the regular expression.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Notes:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The regex dialect is PCRE (perl compatible). Files use unix line terminators if it is relevant.&lt;/p&gt;&#xA;" OwnerUserId="69938" LastActivityDate="2019-11-18T19:12:02.530" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18288" PostTypeId="2" ParentId="17581" CreationDate="2019-11-19T19:44:33.733" Score="-4" Body="&lt;h1&gt;Use a specific &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; scoring rule&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;One could use a code-challenge scoring rule, that combines some measure of the inherent golfiness of the language with the code length on this specific challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance, one might say that the inherent golfiness of a language is the (geometric) mean length of the shortest answers to each of a selected group of popular challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then, the score of a submission could be the ratio of the length of that submission to the inherent golfiness of the language used.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance, if the inherent golfiness of Pyth was 10 bytes, while the inherent golfiness of Python was 100 bytes, then a 50 byte solution in Python to your challenge would beat a 6 byte solution in Pyth.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Scored submissions would only be scored this way in languages where enough solutions had been submitted to the selected group of popular challenges before the new challenge was posted to establish an inherent golfiness for the language. Submissions in other languages would be allowed, but would be treated as having inherent golfiness 1 byte, and so would almost certainly not win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This would be a better way to compare golfs across languages than the current method.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastActivityDate="2019-11-19T19:44:33.733" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18290" PostTypeId="2" ParentId="2140" CreationDate="2019-11-19T20:56:32.060" Score="2" Body="&lt;h1&gt;Create a block maze solver AI&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A block maze is a maze in which goal is to complete a pathway by&#xA;  adding blocks.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It starts like this :&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#..#.&#xA;#...#&#xA;..###&#xA;.#...&#xA;.#..#&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;#&lt;/code&gt; is a block (which can be crossed). &lt;code&gt;.&lt;/code&gt; is empty space (which cannot be crossed).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal is to connect top-left corner &lt;code&gt;S&lt;/code&gt; to the bottom-right corner &lt;code&gt;E&lt;/code&gt;. Diagonals are not allowed.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;S....&#xA;.....&#xA;.....&#xA;.....&#xA;....E&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;One possible solution for the example above is to add three blocks like this : &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#..#.&#xA;#...#&#xA;#####&#xA;.#..#&#xA;.#..#&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Think about a man who want to cross a river with crocodiles &lt;code&gt;.&lt;/code&gt; using huge stone blocks &lt;code&gt;#&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The task is to create a program that take a grid as input and return a solution as output.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The sum of all blocks required to solve all solutions in a 1.000 test case file I will provide.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winning program is the one that use the fewest blocks to solve all mazes.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All grids are 25 x 25. &lt;/li&gt;&#xA;&lt;li&gt;Start / end points are always top-left / bottom-right corners. There is always a block on those points.&lt;/li&gt;&#xA;&lt;li&gt;There is always one guaranteed solution (which can be found by filling all empty spaces)&lt;/li&gt;&#xA;&lt;li&gt;Program must be entirely deterministic; pseudorandom solutions are allowed, but the program must generate the same output for the same test case every time. If two programs take the same number of steps (e.g. they both found the optimal solutions), the shorter program will win.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The program should return the solution as a sequence of blocks x-y coordinates (the coordinates of blocks to add to solve maze) in the format of your choosing :&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;11-3;15-6;19-12   &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I cannot think of a simple algorithm that returns an optimal (best possible) solution in a reasonable time. I expect programs to use some heuristics to get non-optimal/near-optimal solutions. I made the grids 25 x 25 to make it challenging enough and prevent simple solutions like brute force.&lt;/li&gt;&#xA;&lt;li&gt;Is this a duplicate? There is lot of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/maze&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;maze&amp;#39;&quot; rel=&quot;tag&quot;&gt;maze&lt;/a&gt; related questions but I couldn't find anything related to &lt;a href=&quot;https://en.wikipedia.org/wiki/Maze#Other_types_of_mazes&quot; rel=&quot;nofollow noreferrer&quot;&gt;block maze&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The tags are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/maze&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;maze&amp;#39;&quot; rel=&quot;tag&quot;&gt;maze&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/path-finding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;path-finding&amp;#39;&quot; rel=&quot;tag&quot;&gt;path-finding&lt;/a&gt;. Anything else?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;EDIT : as &lt;strong&gt;AlienAtSystem&lt;/strong&gt; pointed out in comments, there is an optimal algorithm for all cases. I made some tests: even a slightly modified Dijkstra's algorithm  will work (it will find shortest path in a short time). I will not post this challenge as it is trivial. I leave it here in case someone else would have same idea.&lt;/p&gt;&#xA;" OwnerUserId="14868" LastEditorUserId="14868" LastEditDate="2019-11-22T12:40:10.293" LastActivityDate="2019-11-22T12:40:10.293" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="18291" PostTypeId="2" ParentId="2140" CreationDate="2019-11-20T04:17:11.243" Score="-2" Body="&lt;h2&gt;print 1000 digits of &lt;span class=&quot;math-container&quot;&gt;\$\pi\$&lt;/span&gt; base 3&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/196135&quot;&gt;question&lt;/a&gt; was on hold for &quot;unclear what you're asking&quot;. Really? What was the real reason?    &lt;/p&gt;&#xA;&#xA;&lt;p&gt;No input. We need to &lt;em&gt;compute&lt;/em&gt; and print the values of &lt;a href=&quot;http://mathworld.wolfram.com/Pi.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;span class=&quot;math-container&quot;&gt;\$\pi\$&lt;/span&gt;&lt;/a&gt; and &lt;a href=&quot;http://mathworld.wolfram.com/Euler-MascheroniConstant.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Euler constant &lt;span class=&quot;math-container&quot;&gt;\$\gamma\$&lt;/span&gt;&lt;/a&gt;&lt;br&gt;&#xA;to &lt;span class=&quot;math-container&quot;&gt;\$1000\$&lt;/span&gt; digits after decimal point&lt;br&gt;&#xA;in base &lt;span class=&quot;math-container&quot;&gt;\$3\$&lt;/span&gt; with digits &lt;span class=&quot;math-container&quot;&gt;\$-1,0,1\$&lt;/span&gt; represented as &lt;code&gt;-&lt;/code&gt;,&lt;code&gt;0&lt;/code&gt;,&lt;code&gt;+&lt;/code&gt; respectively.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For &lt;span class=&quot;math-container&quot;&gt;\$\pi\$&lt;/span&gt; output is likely starts with &lt;a href=&quot;https://tio.run/##LY3LDoMgFET3fgU7QC9G6q6JX0JYYKX1tuURxAS/3mrbxWxmcs7ELc/BX/YdXQwpE2fyXJUh2Wm9WfY2bpwMKYDX0ijm0DMlJHQgNbzsNvx3fzXjwk60jSiW1TFT93UdyT0kYiAS9KRw4c8SOQfkGpLxD8t6EP0RyUFpXsWEPjNK22c4nqjoGqpQdbqR@qvCn4jv@wc&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 2 – Try It Online&quot;&gt;&lt;code&gt;+0.0++-+++-000-0++-++0+-++++++00--++&lt;/code&gt;&lt;/a&gt;.&lt;br&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$\pi\$&lt;/span&gt; can be computed as series of &lt;span class=&quot;math-container&quot;&gt;\$\tan^{-1}\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$\gamma\$&lt;/span&gt; -- like &lt;a href=&quot;https://math.stackexchange.com/questions/129777/what-is-the-fastest-most-efficient-algorithm-for-estimating-eulers-constant-g&quot;&gt;here&lt;/a&gt;, or any other method will do if fast enough to provide needed accuracy for at most &lt;span class=&quot;math-container&quot;&gt;\$60\$&lt;/span&gt; seconds for both numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Storing or using entire pre-computed values are &lt;em&gt;forbidden&lt;/em&gt;.&lt;br&gt;&#xA;One may though use wolframalpha regular-base-3 values &lt;em&gt;for checking&lt;/em&gt; their output -- for &lt;a href=&quot;https://www.wolframalpha.com/input/?i=Pi+in+base+3&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;span class=&quot;math-container&quot;&gt;\$\pi\$&lt;/span&gt;&lt;/a&gt; and &lt;a href=&quot;https://www.wolframalpha.com/input/?i=EulerGamma+in+base+3&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;span class=&quot;math-container&quot;&gt;\$\gamma\$&lt;/span&gt;&lt;/a&gt; (hit &quot;More digits&quot; some times to get &lt;span class=&quot;math-container&quot;&gt;\$1000\$&lt;/span&gt;).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Scoring method is code-golf, but TIO should run at most &lt;span class=&quot;math-container&quot;&gt;\$60\$&lt;/span&gt; seconds.&lt;br&gt;&#xA;Good luck. Please fell free to improve this post.&lt;/p&gt;&#xA;" OwnerUserId="41420" LastEditorUserId="41420" LastEditDate="2019-11-21T15:06:30.590" LastActivityDate="2019-11-21T15:06:30.590" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18292" PostTypeId="2" ParentId="2140" CreationDate="2019-11-20T10:53:45.267" Score="0" Body="&lt;h2&gt;How long should this song last?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Enter the world of sheet music. A composition (the musical piece, which may or may not be a song) is divided into bars. The length of a bar is defined by the time signature.&#xA;The time signature states how the bar is divided into beats, and what length of note carries the beat.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note lengths are always powers of 2. 4 means a quarter note, 2 a half note, 8 an eighth note (or a quaver if you're a snob), etcetera. A half note (2) is twice the length of a quarter note (4), which is itself twice the length of a quaver (8), and so on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A time signature may look like this: 3/4. The 4 means that the quarter note carries the beat, and the 3 means that there are 3 of them in one bar. 3/2 means there are three half-notes in a beat, 7/8 means there are seven quavers, and so on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now, the actual speed at which a piece is to be performed depends on the tempo. That is usually expressed in beats per minute (bpm). The tempo also defines the note carrying the beat (usually the same as the one in the time signature but not always). So, you can have the time signature be 8=150, meaning there are 150 quavers in a minute (in the sheet music it would be notated ♪=150).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Both tempo and time signature can change throughout the composition.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Use the following format for your input (or something very similar). It is a list of events:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1,&quot;4/4&quot;],&#xA;[1,&quot;4=120&quot;],&#xA;[521,&quot;&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is the simplest form. It is a list of integer-string pairs (you're obviously free to go with string-string pairs if it makes your program simpler). The integer defines at which bar the event happens (starting from 1), and the string defines what happens there. If it is in the form of x/y, then it is a new time signature. If it is in the form of x=y, you have a new tempo. Lastly, an empty string designates the end of the score (exclusive, so the above example has 520 bars).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With changes, the format may look like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1,&quot;4/4&quot;],&#xA;[1,&quot;2=120&quot;],&#xA;[46, &quot;4=155&quot;],&#xA;[67, &quot;5/4&quot;],&#xA;[68, &quot;4/4&quot;],&#xA;[152,&quot;&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The output of the program should be the duration of the entire piece in &quot;xm ys&quot; (where x is the number of minutes and y is the number of seconds. You can leave out the &quot;ys&quot; part if there's no spare seconds, but it is not necessary).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Important note!&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Real&lt;/em&gt; artists do not follow the tempo exactly. Only beginners use a metronome to match the exact number of seconds as notated; more experienced musicians know to dynamically speed up or slow down depending on the mood, their personal preference, etcetera. Therefore, it is perfectly acceptable for your answer to be &lt;strong&gt;up to 34% higher or lower&lt;/strong&gt; than the &quot;correct&quot; answer. Also, the minimum length of a composition is 2 minutes and 30 seconds.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;1.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1,&quot;4/4&quot;],&#xA;[1,&quot;4=120&quot;],&#xA;[521,&quot;&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The time signature has 4 quarter notes a bar, and 520 bars, so 4*520=2080 quarter notes. There's 120 quarter notes per minute, so 2080/120=17.333 minutes, or 17m 20s.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1,&quot;4/4&quot;],&#xA;[1,&quot;8=120&quot;],&#xA;[46, &quot;4=155&quot;],&#xA;[66, &quot;5/4&quot;],&#xA;[76, &quot;6/8&quot;],&#xA;[152,&quot;&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For the first 45 bars, there's 4 quarter notes a bar, so that's 45*4=180 quarter notes. Now the tempo is 120 8th notes per minute, which is 60 quarter notes per minute, meaning the first bit lasts 180/60=3 minutes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then a tempo change: from bar 46 to 67 there's 20 bars of 4/4 (thus 4*20=80 quarter notes), and at 155 quarter notes per minute you add 155/80=1.94 minutes = 1m 56s. Total is 4m 56s.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then a time signature change: 10 bars of 5 quarter notes per bar = 50 quarter notes. 155/50 = 3.1 minutes = 3m 6s. Total is 8m 2s.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then another time signature change. 6 eighth notes per bar for 76 bars is 76*6=456 eighth notes. Tempo is still 155 &lt;em&gt;quarter notes&lt;/em&gt; per minute, which is 310 &lt;em&gt;eighth notes&lt;/em&gt; per minute. 456/310=1.471 minutes = 1m 28s. Total comes down to 9m 39s.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;3.&#xA;(&lt;a href=&quot;https://www.youtube.com/watch?v=ZAx-RjiGiHM&quot; rel=&quot;nofollow noreferrer&quot;&gt;The third movement of Shostakovich's second piano concerto&lt;/a&gt;, you get 5 bytes off if you listen to this while programming &lt;sup&gt;&lt;sup&gt;(not really but more people need to listen to Shosty dammit)&lt;/sup&gt;&lt;/sup&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1, &quot;2/4&quot;],&#xA;[1, &quot;4=176&quot;],&#xA;[75, &quot;7/8&quot;],&#xA;[102, &quot;6/8&quot;],&#xA;[103, &quot;7/8&quot;],&#xA;[106, &quot;3/8&quot;],&#xA;[107, &quot;7/8&quot;],&#xA;[109, &quot;2/4&quot;],&#xA;[112, &quot;3/4&quot;],&#xA;[113, &quot;2/4&quot;],&#xA;[116, &quot;3/4&quot;],&#xA;[117, &quot;2/4&quot;],&#xA;[120, &quot;3/4&quot;],&#xA;[121, &quot;2/4&quot;],&#xA;[124, &quot;3/4&quot;],&#xA;[125, &quot;2/4&quot;],&#xA;[155, &quot;7/8&quot;],&#xA;[160, &quot;2/4&quot;],&#xA;[175, &quot;7/8&quot;],&#xA;[180, &quot;2/4&quot;],&#xA;[181, &quot;6/8&quot;],&#xA;[182, &quot;2/4&quot;],&#xA;[186, &quot;7/8&quot;],&#xA;[188, &quot;2/4&quot;],&#xA;[222, &quot;7/8&quot;],&#xA;[225, &quot;2/4&quot;],&#xA;[286, &quot;7/8&quot;],&#xA;[308, &quot;9/8&quot;],&#xA;[309, &quot;7/8&quot;],&#xA;[314, &quot;2/4&quot;],&#xA;[317, &quot;3/4&quot;],&#xA;[318, &quot;2/4&quot;],&#xA;[321, &quot;3/4&quot;],&#xA;[322, &quot;2/4&quot;],&#xA;[325, &quot;3/4&quot;],&#xA;[326, &quot;2/4&quot;],&#xA;[329, &quot;3/4&quot;],&#xA;[330, &quot;2/4&quot;],&#xA;[356, &quot;&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Calculation is too long to show here, but it comes down to 4m 47s. The video is 5m 24s, proving my point that this is not an exact rule but rather a guideline.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Tags&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/music&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;music&amp;#39;&quot; rel=&quot;tag&quot;&gt;music&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sandbox&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Does this look like an interesting puzzle? Any tags I miss? Is the +/-34% allowance large enough to matter, or should it be more?&lt;/p&gt;&#xA;" OwnerUserId="81594" LastEditorUserId="81594" LastEditDate="2019-11-20T19:06:22.210" LastActivityDate="2019-11-20T19:06:22.210" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="18293" PostTypeId="2" ParentId="8047" CreationDate="2019-11-21T09:27:03.687" Score="11" Body="&lt;h1&gt;Problems without solutions&lt;/h1&gt;&#xA;&lt;p&gt;When writing a challenge, make sure it is actually solvable within the framework of recreational programming. While a task like &amp;quot;Identify objects in a picture&amp;quot; is certainly a difficult programming challenge, it's not something people can solve in an afternoon: The entirety of the computer science field has been working on cracking that nut for decades and still hasn't found a satisfactory solution.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, when posting a challenge, you should have at least a clear idea of an algorithm that can perform the task you want, and that you could implement in a reasonable amount of time. Ideally, you'd even have written and tested it. (Such an implementation wouldn't need to be golfed, or pretty, or even fast: The points is that you can prove by example that it's possible to solve the problem.)&lt;/p&gt;&#xA;" OwnerUserId="89287" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-11-21T09:27:03.687" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18294" PostTypeId="2" ParentId="18269" CreationDate="2019-11-21T18:21:00.577" Score="26" Body="&lt;p&gt;(Ignoring badge requirements)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would run. I fundamentally disagree with many of Stack Exchange's policies. And, should I run and on the off-chance, actually get elected, I would not endorse all of SE's individual decisions, but I still have faith in the community, and if the community needs moderators, and especially since doubling the load on the other two moderators is understandably hard, I'm willing to help, for the community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I still do not agree with how SE handled this, and I never will. A true apology or a peaceful resolution is well overdue and not sufficient, at this point. But, and maybe I'm too optimistic/loyal or have too much faith, I still believe the merit of this platform comes from the community. If an election were held sooner than now, or now, I wouldn't run, because after the whole community was damaged by these events and we lost two amazing moderators, it would feel like a hurried attempt to silence and patch over the problem, but January 2020 will be enough time to make a decision. I probably would run, but of course that's under the condition that nothing even worse happens.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But please, do not call it &quot;replacing&quot;. Nobody can replace the hole left by Mego and Dennis, certainly not me. Their presence and support for our community will forever be missed, and I can only hope to start a time that grows to as great as their legacy, but never to replace it.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2019-11-21T18:21:00.577" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18296" PostTypeId="2" ParentId="2140" CreationDate="2019-11-21T19:58:15.097" Score="-1" Body="&lt;h1&gt;Predict the state of a Minecraft inventory after click events&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Minecraft does inventory management over the network by sending packets describing the clicks that a player does. If you're caching these events, it can be non-trivial to predict what state the inventory is in after the clicks&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Take an inventory of 9 slots, each with an item and a type. Assume all items can stack up to 64 and that if a slot would be &quot;overfilled&quot; that the cursor will continue holding onto the items. Then, take a list of the slot index, button, and mode variables for the clicks to be done (mode and button are defined at &lt;a href=&quot;https://wiki.vg/Protocol#Click_Window&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://wiki.vg/Protocol#Click_Window&lt;/a&gt;). Output the inventory afterwards.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Restrictions/Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You may input and output the inventory in any reasonable format.&#xA;You may take click input in any reasonable format.&#xA;You may ignore Mode==2, as the player inventory is not implemented correctly enough for this. &#xA;You may ignore Mode==3 because this is a survival player&#xA;You may ignore Mode==5 where Button==8, 9, or 10 for the same reason as Mode 3.&#xA;Dropping the item is a delete. Your player won't pick it back up or anything silly like that.&#xA;You may assume that input will have valid counts&#xA;Don't use standard loopholes&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[&quot;diamond&quot;,64],[],[],[],[],[],[],[],[]]&#xA;&#xA;[&#xA; [0, 0, 0]&#xA; [0, 0, 1]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[],[&quot;diamond&quot;,64],[],[],[],[],[],[],[]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[&quot;diamond&quot;,64],[&quot;dirt&quot;, 64],[],[],[],[],[],[],[]]&#xA;&#xA;[&#xA; [0, 0, 0]&#xA; [0, 0, 1]&#xA; [0, 0, 2]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[],[&quot;diamond&quot;,64],[&quot;dirt&quot;,64],[],[],[],[],[],[]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[&quot;diamond&quot;,64],[],[],[],[],[],[],[],[]]&#xA;&#xA;[&#xA; [0, 0, 0],&#xA; [-999, 4, 4],&#xA; [0, 4, 5],&#xA; [1, 4, 5],&#xA; [2, 4, 5],&#xA; [3, 4, 5],&#xA; [4, 4, 5],&#xA; [5, 4, 5],&#xA; [6, 4, 5],&#xA; [7, 4, 5],&#xA; [8, 4, 5],&#xA; [-999, 4, 6],&#xA; [8, 0, 0]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[&quot;diamond&quot;,56],[&quot;diamond&quot;,1],[&quot;diamond&quot;,1],[&quot;diamond&quot;,1],[&quot;diamond&quot;,1],[&quot;diamond&quot;,1],[&quot;diamond&quot;,1],[&quot;diamond&quot;,1],[&quot;diamond&quot;,1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I have no clue what I'm doing writing a question.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Tagged code golf&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Critique goals:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Improve testcases&lt;/li&gt;&#xA;&lt;li&gt;Improve description of problem&lt;/li&gt;&#xA;&lt;li&gt;Determine if the problem is too complex&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="75429" LastActivityDate="2019-11-21T19:58:15.097" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18297" PostTypeId="2" ParentId="2140" CreationDate="2019-11-21T21:41:02.093" Score="-1" Body="&lt;p&gt;A very-very old (maybe early 2000s) problem:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Print out a decimal number &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; such as &lt;span class=&quot;math-container&quot;&gt;\$n^2\$&lt;/span&gt; ends with &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; with maximal length your program can compute in &lt;code&gt;60&lt;/code&gt; seconds&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;In other words it's needed to find some long enough &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; such as &lt;span class=&quot;math-container&quot;&gt;\$10^{\lfloor\log_{10}n\rfloor+1}|(n^2-n)\$&lt;/span&gt;.&lt;br&gt;&#xA;A hint may be that an &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; ending with &lt;span class=&quot;math-container&quot;&gt;\$5\$&lt;/span&gt; is more easy to compute than an &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; ending with &lt;span class=&quot;math-container&quot;&gt;\$6\$&lt;/span&gt;.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot;&gt;code-challenge&lt;/a&gt;   &lt;/p&gt;&#xA;" OwnerUserId="41420" LastEditorUserId="41420" LastEditDate="2019-11-22T07:26:19.727" LastActivityDate="2019-11-22T07:26:19.727" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18298" PostTypeId="2" ParentId="2140" CreationDate="2019-11-22T09:39:43.203" Score="4" Body="&lt;h2&gt;A Spherical Die&lt;/h2&gt;&#xA;&lt;h3&gt;Inspiration&lt;/h3&gt;&#xA;&lt;p&gt;I have a &lt;a href=&quot;https://upload.wikimedia.org/wikipedia/commons/c/ca/D06_sphere.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;spherical die&lt;/a&gt;, but it's a cheap one so it doesn't work properly. When I roll it, it doesn't always land directly on a &amp;quot;face&amp;quot; marking, but instead can result in an ambiguous result (&amp;quot;is that a 6, a 4 or a 2?&amp;quot;)&lt;/p&gt;&#xA;&lt;h3&gt;Assumptions&lt;/h3&gt;&#xA;&lt;p&gt;Assume the die is a perfect, evenly-weighted Unit Sphere (i.e. all points on the surface are radius 1cm from the center) , such that a &amp;quot;roll&amp;quot; can result in any point on the sphere being the uppermost point (the &amp;quot;roll value&amp;quot;).&lt;/p&gt;&#xA;&lt;p&gt;Assume that, if the die is placed or rolled such that 1 is at the &amp;quot;north pole&amp;quot;, the conventions of a normal die will follow, i.e:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;6 will be at the &amp;quot;south pole&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;4, 5, 3, 2 will be on the &amp;quot;equator&amp;quot;, clockwise in that order, equidistant around the sphere.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;So, before it's rolled, the die looks like this:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/qJxUp.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/qJxUp.png&quot; alt=&quot;image of die&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;The Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Given a simulated roll of the die (i.e. coordinates representing the top of the die after it's rolled) with the conditions above, identify the closest value (1-6) to that point (i.e. what the roll value should resolve to).&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Input&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;A co-ordinate on the sphere.&lt;/p&gt;&#xA;&lt;p&gt;There are a few co-ordinate systems used for spheres, the two I'm familiar with (and so will provide examples in) are as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;P(1, φ, Θ) where φ is the &amp;quot;azimuth angle&amp;quot; (0..360), Θ is the &amp;quot;polar angle&amp;quot; (0..180)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;P(x,y,z) where &lt;span class=&quot;math-container&quot;&gt;\$x^2+y^2+z^2=1\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;(note: the conversion between the two is: x = cos(φ)·sin(Θ); y = sin(φ)·sin(Θ); z = cos(Θ))&lt;/p&gt;&#xA;&lt;p&gt;for clarity:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;roll &amp;quot;1&amp;quot; is at P(1,n,0)&lt;/li&gt;&#xA;&lt;li&gt;roll &amp;quot;2&amp;quot; is at P(1,270,90)&lt;/li&gt;&#xA;&lt;li&gt;roll &amp;quot;3&amp;quot; is at P(1,180,90)&lt;/li&gt;&#xA;&lt;li&gt;roll &amp;quot;4&amp;quot; is at P(1,0,90)&lt;/li&gt;&#xA;&lt;li&gt;roll &amp;quot;5&amp;quot; is at P(1,90,90)&lt;/li&gt;&#xA;&lt;li&gt;roll &amp;quot;6&amp;quot; is at P(1,n,180)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;em&gt;Output&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;The nearest value (1-6) to that point. If the point is equidistant to two or more points, output any one of them.&lt;/p&gt;&#xA;&lt;p&gt;Usual exclusions etc. apply.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/mathematics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;mathematics&amp;#39;&quot; rel=&quot;tag&quot;&gt;mathematics&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="62289" LastEditorUserId="62289" LastEditDate="2020-07-14T14:29:04.223" LastActivityDate="2020-07-14T14:29:04.223" CommentCount="17" ContentLicense="CC BY-SA 4.0" />
  <row Id="18299" PostTypeId="2" ParentId="2140" CreationDate="2019-11-23T12:14:17.347" Score="0" Body="&lt;h1&gt;&lt;strong&gt;Deathmatch Football (Soccer)&lt;/strong&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Idea:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;2 Teams each of 11 Players and 3 Bank Players compete in a match of 90 minutes to find out who's the best. But... it wouldn't be deathmatch with no casualties, so after scoring, there is a chance to die. &#xA;&lt;strong&gt;Better think twice before you shoot...&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Teams:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each Team is represanted as a String of 14 chars (11 + 3). Every char az-AZ is unique to the whole match. So 2 teams could look like this&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Team1: {&quot;a&quot;,&quot;c&quot;,&quot;f&quot;,&quot;g&quot;,&quot;j&quot;,&quot;k&quot;,&quot;A&quot;,&quot;D&quot;,&quot;E&quot;,&quot;H&quot;,&quot;I&quot;,&quot;k&quot;,&quot;n&quot;,&quot;o&quot;} //bank: k, n, o&#xA;Team2: {&quot;b&quot;,&quot;d&quot;,&quot;e&quot;,&quot;h&quot;,&quot;i&quot;,&quot;l&quot;,&quot;B&quot;,&quot;C&quot;,&quot;F&quot;,&quot;G&quot;,&quot;J&quot;,&quot;l&quot;,&quot;m&quot;,&quot;P&quot;} //bank: l, m, P&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The Game:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The game lasts for 90 (+3) minutes. Every minute each team has one chance to score a goal. The player who's shooting gets randomly selected. The chance of a player to score a goal is the byte value of the char.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Example: &quot;z&quot; has a value of 122, so he has a chance of 122% (&amp;gt;=100%) means he will definetely score&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If he scores he will die with a chance of his byte value / 2&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Example: &quot;z&quot; has a value of 122, so he has a chance of 61% to die.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Special Events:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;At minute 45, 60 and 75 a random player from the bank comes into the team (teams are not limited to 11 players, if no one has died yet)&lt;/li&gt;&#xA;&lt;li&gt;If there is a draw at minute 90 OR both teams have less than 5 players, the game lasts for additional 3 minutes (90 + 3)&lt;/li&gt;&#xA;&lt;li&gt;If a team has 0 players the game is over&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Result and Rating:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Once a match is over. Display both teams, the final score, and the top scorer including goals.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Team1: {&quot;a&quot;,&quot;f&quot;,&quot;A&quot;,&quot;D&quot;,&quot;p&quot;}&#xA;Team2: {&quot;b&quot;,&quot;e&quot;,&quot;h&quot;,&quot;P&quot;}&#xA;Score: 20:18 // So Team1 won&#xA;Top Scorer: A=&amp;gt;5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The code with less bytes is the winner.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Extra Notes:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are free to choose the form of the output as long as you can clearly see the remianing teams, who won and the top scorer. &#xA;No loopholes, do i need to say that?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="90587" LastEditorUserId="90587" LastEditDate="2019-11-23T13:07:59.650" LastActivityDate="2019-11-23T13:07:59.650" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18300" PostTypeId="2" ParentId="7804" CreationDate="2019-11-23T17:07:44.830" Score="3" Body="&#xA;&lt;h1&gt;Posted&lt;/h1&gt;&#xA;" OwnerUserId="26997" LastEditorUserId="100664" LastEditDate="2021-12-25T06:54:24.737" LastActivityDate="2021-12-25T06:54:24.737" CommentCount="2" CommunityOwnedDate="2019-11-23T17:07:44.830" ContentLicense="CC BY-SA 4.0" />
  <row Id="18301" PostTypeId="2" ParentId="2140" CreationDate="2019-11-23T20:22:53.947" Score="1" Body="&lt;h1&gt;Guessing the subset.&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Preface&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I've never done a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; challenge before, so I'd appreciate some help to get this right. In particular, I'm not sure how much I should specify a (language-neutral) API. I'm also not sure how to implement time limits on computation time. (I want to be able to run a trial in seconds, not weeks.)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This challenge is based on Math Stack Exchange question &lt;a href=&quot;https://math.stackexchange.com/q/25270/121988&quot;&gt;&quot;Guessing a subset of {1,...,N}&quot;&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge, the robber's job is to choose a subset &lt;span class=&quot;math-container&quot;&gt;\$R \subseteq \{1,\dots,N\}\$&lt;/span&gt;, &lt;em&gt;kind of&lt;/em&gt;. Then the cop's job is to deduce the robber's subset by asking questions.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Robber&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When I was growing up, I would sometimes play &lt;a href=&quot;https://en.wikipedia.org/wiki/Twenty_Questions&quot; rel=&quot;nofollow noreferrer&quot;&gt;Twenty Questions&lt;/a&gt; with my brother. I would pick some sort of animal, and answer his questions about it. However, when he guessed the answer I had in mind, I would try to come up with another animal that satisfied all of the same answers to his questions—and if I could do it, I would tell him he was wrong. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The robber's job is similar to my strategy in Twenty Questions. The cop will ask the robber questions about the robber's chosen subset, but the robber can keep changing the subset as long as the answers are consistent. The robber's job is trying to answer the questions in such a way as to maximize the number of questions the cop needs to ask, always ensuring that the answers do not contradict each other.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Cop&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The cop's job is to successively pick subsets starting with &lt;span class=&quot;math-container&quot;&gt;\$C_1 \subseteq \{1, \dots, N\}\$&lt;/span&gt; and ask the question, &quot;Does &lt;span class=&quot;math-container&quot;&gt;\$C_1\ = R\$&lt;/span&gt;, and if not how many elements do &lt;span class=&quot;math-container&quot;&gt;\$C_1\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$R\$&lt;/span&gt; have in common?&quot; (That is, &lt;span class=&quot;math-container&quot;&gt;\$|C_1 \cap R|\$&lt;/span&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If &lt;span class=&quot;math-container&quot;&gt;\$C_k = R\$&lt;/span&gt;, then the cop has finished the interrogation, and her score is &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;. &#xA;Otherwise, the cop then can use this information to choose a new set &lt;span class=&quot;math-container&quot;&gt;\$C_{k+1}\$&lt;/span&gt;, and ask the same question for &lt;span class=&quot;math-container&quot;&gt;\$C_{k+1}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Both the cop and robber will be given a number &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;, then the cop will go first outputting a subset &lt;span class=&quot;math-container&quot;&gt;\$C_1 \subseteq \{1,...,N\}\$&lt;/span&gt;. The robber will then take this as an input and output &lt;span class=&quot;math-container&quot;&gt;\$|C_1 \cap R|\$&lt;/span&gt;. The cop will take this number as an input and output &lt;span class=&quot;math-container&quot;&gt;\$C_2\$&lt;/span&gt; and so on. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;For a given interrogation both the cop's and robber's score is &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$C_k = R\$&lt;/span&gt; is the last, correct guess. Naturally, the cop is trying to minimize her score while the robber is trying to maximize his.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each cop will be tested against each robber (perhaps multiple times) with varying values of &lt;span class=&quot;math-container&quot;&gt;\$N \leq 1000\$&lt;/span&gt;. The score for the cop and robbers will be the sum of the scores over all interrogations. &lt;/p&gt;&#xA;" OwnerUserId="53884" LastActivityDate="2019-11-23T20:22:53.947" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18302" PostTypeId="2" ParentId="2140" CreationDate="2019-11-23T22:18:32.740" Score="-1" Body="&lt;h1&gt;JavaScript: Free for All&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;em&gt;very experimental&lt;/em&gt; idea of mine: given a function which is provided a single function as an argument, try to run that function the most times possible in a browser environment while competing against other bots.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Bot submissions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each bot consists of a function. This function takes a scoring function as input. Each bot has a state consisting of three values:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;score&lt;/code&gt;: Number indicating score, winning criterion&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;locked&lt;/code&gt;: Boolean which, when true, prevents further score increases&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;calls&lt;/code&gt;: Number of times scoring function called in last 100ms (?), will set &lt;code&gt;locked&lt;/code&gt; to true for the remainder of the round if it exceeds a certain value&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The scoring function increments &lt;code&gt;score&lt;/code&gt; and &lt;code&gt;calls&lt;/code&gt;, as long as &lt;code&gt;locked&lt;/code&gt; is not true.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Restrictions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If any of these restrictions are violated, a bot will have &lt;code&gt;locked&lt;/code&gt; set to true.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;No bot or bot-defined function may:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Run longer than 5ms&lt;/li&gt;&#xA;&lt;li&gt;Attempt to modify the window location (&lt;code&gt;location.href&lt;/code&gt;, &lt;code&gt;location.assign&lt;/code&gt;, etc.)&lt;/li&gt;&#xA;&lt;li&gt;Attempt to connect to the internet (AJAX, WebSockets, etc.)&lt;/li&gt;&#xA;&lt;li&gt;Create web workers&lt;/li&gt;&#xA;&lt;li&gt;Affect hardware (sound, microphone, camera, USB, gamepads, etc.)&lt;/li&gt;&#xA;&lt;li&gt;Download files&lt;/li&gt;&#xA;&lt;li&gt;Leave an impact which cannot be fixed by reloading the page&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is almost certainly a very bad idea on an assortment of levels. If you have any suggestions of restrictions or ways to make the challenge more interesting, be sure to comment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'm considering some sort of system to determine which bot runs first that adds to the strategy, and interesting attack angles for other bots.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To prevent this from becoming a &quot;read the last answer and exactly cancel out its strategy&quot; type thing, I'm open to any suggestions.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2019-11-23T22:18:32.740" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18303" PostTypeId="2" ParentId="2140" CreationDate="2019-11-24T02:52:00.903" Score="0" Body="&lt;h1&gt;Double an infinitely long number&lt;/h1&gt;&#xA;&lt;p&gt;You are given a non-negative real number strictly less than 0.5 as an endless stream of digits. Output twice of it in an endless stream of digits.&lt;/p&gt;&#xA;&lt;p&gt;The exact format is flexible. You may separate digits by any reasonable separator, or don't use separators. You may prepend something representing &amp;quot;0&amp;quot; or &amp;quot;0.&amp;quot;, or just omit the integral part. The input and output don't have to be in the same format. But everything must be in base 10, from the most significant digit to less significant digits.&lt;/p&gt;&#xA;&lt;p&gt;Your code doesn't have to print anything immediately. But if each digit in the input would be given in a finite amount of time, and it is in a state allowing output in your chosen I/O method (so that if you are using a generator, you may assume some code is repeatedly accessing the generator), each digit in the output should also be printed or returned in a finite amount of time.&lt;/p&gt;&#xA;&lt;p&gt;Shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="25180" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-11-26T23:38:07.893" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18304" PostTypeId="2" ParentId="2447" CreationDate="2019-11-24T09:34:57.827" Score="10" Body="&lt;h1&gt;Image output may consist of a matrix or 2d array for raster images&lt;/h1&gt;&#xA;&lt;p&gt;This is relevant e.g. for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; challenges. (e.g. for languages that otherwise have no way of writing an image file or opening a window for the graphical display)&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-11-25T10:21:16.780" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18305" PostTypeId="2" ParentId="2447" CreationDate="2019-11-24T09:41:37.933" Score="7" Body="&lt;h1&gt;Image output may consist of a pixel-shader&lt;/h1&gt;&#xA;&lt;p&gt;A &lt;em&gt;pixel-shader&lt;/em&gt; is a function that takes the &lt;code&gt;(x,y)&lt;/code&gt; coordinates of a pixel as an input, and outputs the color of this pixel (e.g. a scalar for grayscale images, a tuple for color images, a boolean value for binary images etc.)&lt;/p&gt;&#xA;&lt;p&gt;This is relevant e.g. for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; challenges. (also for &lt;code&gt;GLSL / Shadertoy&lt;/code&gt; answers.)&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-11-25T10:19:31.110" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18306" PostTypeId="2" ParentId="2140" CreationDate="2019-11-24T10:30:36.407" Score="1" Body="&lt;h1&gt;Count the length of head movement&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/196792/count-the-length-of-head-movement&quot;&gt;Moved here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="88326" LastEditorUserId="88326" LastEditDate="2019-12-09T11:27:23.097" LastActivityDate="2019-12-09T11:27:23.097" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18307" PostTypeId="2" ParentId="2140" CreationDate="2019-11-25T09:59:58.233" Score="2" Body="&lt;h2&gt;OEIS A125959&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://oeis.org/A125959&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://oeis.org/A125959&lt;/a&gt; is a sequence I submitted. It is the following array, which then repeats:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3 4 5 6 7 8 9    &#xA;2 4 6 8 1 3 5 7 9    &#xA;3 6 9 3 6 9 3 6 9    &#xA;4 8 3 7 2 6 1 5 9    &#xA;5 1 6 2 7 3 8 4 9    &#xA;6 3 9 6 3 9 6 3 9    &#xA;7 5 3 1 8 6 4 2 9    &#xA;8 7 6 5 4 3 2 1 9    &#xA;9 9 9 9 9 9 9 9 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is a rather useful array for quickly calculating the digital root of the product of any two numbers (i.e the iterative sum of the digits of the product). See the OEIS link if you're interested in the details.&lt;/p&gt;&#xA;&lt;p&gt;The challenge is to print the array in the shortest number of bytes.&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;None&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;The above array. It can be output as strings with new lines, or as a nested array, or an array of strings; but not as a single-line sequence (i.e. the 2d-nature of the array must be reflected in your output).&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="62289" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-11-25T11:16:19.143" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18308" PostTypeId="2" ParentId="2140" CreationDate="2019-11-25T10:12:03.777" Score="0" Body="&lt;h2&gt;Multiplicative Digital Root&lt;/h2&gt;&#xA;&lt;p&gt;The Digital root of a number is found by iteratively summing its digits until you end up with a single number (e.g. 99 -&amp;gt; 18 -&amp;gt; 9)&lt;/p&gt;&#xA;&lt;p&gt;The &lt;em&gt;multiplicative&lt;/em&gt; digital root is found by iteratively multiplying the digits (e.g. 99 -&amp;gt; 81 -&amp;gt; 8)&lt;/p&gt;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Print out the digital root of all numbers 0..99 inclusive. Note that this is based on &lt;a href=&quot;https://oeis.org/A031347&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://oeis.org/A031347&lt;/a&gt;, and the first 10 numbers (0-9) are treated without leading 0s.&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;None&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;In any sensible format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0, 1, 2, 3, 4, 5, 6, 7, 8, 9, &#xA;0, 1, 2, 3, 4, 5, 6, 7, 8, 9, &#xA;0, 2, 4, 6, 8, 0, 2, 4, 6, 8, &#xA;0, 3, 6, 9, 2, 5, 8, 2, 8, 4, &#xA;0, 4, 8, 2, 6, 0, 8, 6, 6, 8, &#xA;0, 5, 0, 5, 0, 0, 0, 5, 0, 0, &#xA;0, 6, 2, 8, 8, 0, 8, 8, 6, 0, &#xA;0, 7, 4, 2, 6, 5, 8, 8, 0, 8, &#xA;0, 8, 6, 8, 6, 0, 6, 0, 8, 4,&#xA;0, 9, 8, 4, 8, 0, 0, 8, 4, 8,&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox comments&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/153277/the-non-zero-digital-product-challenge&quot;&gt;this&lt;/a&gt; is the only related challenge I could find, but it doesn't ask the same thing.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Would this be better/more interesting as a &amp;quot;calculate the multiplicative digital root of the input&amp;quot; challenge?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="62289" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-11-25T11:15:31.520" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18313" PostTypeId="2" ParentId="2140" CreationDate="2019-11-26T07:58:32.060" Score="8" Body="&lt;h1&gt;Win the competition &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Write a Javascript anonymous function that, given two functions as strings, deterministically picks one as the winner and returns 1 if the first input wins and 2 if the second input wins. The choice must not depend on the order of inputs (that is, for any given input pair, the same program must always win no matter which one is first).&lt;/p&gt;&#xA;&lt;p&gt;Every submission will be used to compare all unordered pairs of all solutions except self. Every time a program is chosen as the winner, it is assigned 1 point.&lt;/p&gt;&#xA;&lt;p&gt;Submissions must not store any information between runs, interfere with the controller or somehow destroy my computer. There is no hard time limit, but intentionally creating an excessively slow solution counts as destroying my computer. Submissions must not duplicate other submissions or be longer than 200 KiB. Submissions must not rely on the input functions always halting (that is, they must not execute them or any parts of them).&lt;/p&gt;&#xA;&lt;p&gt;You should give your submission a name (it should match the regex &lt;code&gt;[A-Za-z ]+&lt;/code&gt; and not coincide with any other solutions).&lt;/p&gt;&#xA;&lt;p&gt;Controller in a snippet:&lt;/p&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;document.write(atob(`PCFkb2N0eXBlIGh0bWw+CjxodG1sPgo8Ym9keT4KPHNjcmlwdD4KCWZ1bmN0aW9uIGFkZFByb2dy&#xA;YW0oKQoJewoJCWxldCBwcm9ncmFtc0xpc3QgPSBkb2N1bWVudC5nZXRFbGVtZW50QnlJZCgicHJv&#xA;Z3JhbXNMaXN0Iik7CgkJbGV0IHVsID0gZG9jdW1lbnQuZ2V0RWxlbWVudEJ5SWQoInByb2dyYW1z&#xA;TGlzdCIpOwoJCWxldCB0cGwgPSBkb2N1bWVudC5nZXRFbGVtZW50QnlJZCgicHJvZ3JhbVRlbXBs&#xA;YXRlIik7CgkJbGV0IG5ld05vZGUgPSBkb2N1bWVudC5pbXBvcnROb2RlKHRwbC5jb250ZW50LCB0&#xA;cnVlKTsKCQluZXdOb2RlLmNoaWxkcmVuWzBdLmNoaWxkcmVuWzFdLm9uY2xpY2sgPSByZW1vdmVQ&#xA;cm9ncmFtOwoJCXByb2dyYW1zTGlzdC5hcHBlbmRDaGlsZChuZXdOb2RlKTsKCX0KCWZ1bmN0aW9u&#xA;IHJlbW92ZVByb2dyYW0oZSkKCXsKCQlsZXQgcHJvZ3JhbXNMaXN0ID0gZG9jdW1lbnQuZ2V0RWxl&#xA;bWVudEJ5SWQoInByb2dyYW1zTGlzdCIpOwoJCWxldCBsaSA9IGUudGFyZ2V0LnBhcmVudEVsZW1l&#xA;bnQ7CgkJcHJvZ3JhbXNMaXN0LnJlbW92ZUNoaWxkKGxpKTsKCX0KCWZ1bmN0aW9uIHNpbXVsYXRl&#xA;KCkKCXsKCQlsZXQgcHJvZ3JhbXNMaXN0ID0gZG9jdW1lbnQuZ2V0RWxlbWVudEJ5SWQoInByb2dy&#xA;YW1zTGlzdCIpOwoJCWxldCBwcm9ncmFtcyA9IFtdOwoJCWxldCBuID0gcHJvZ3JhbXNMaXN0LmNo&#xA;aWxkcmVuLmxlbmd0aDsKCQlmb3IobGV0IGkgPSAwOyBpIDwgbjsgaSsrKQoJCXsKCQkJbGV0IGxp&#xA;ID0gcHJvZ3JhbXNMaXN0LmNoaWxkcmVuW2ldOwoJCQlsZXQgbmFtZSA9IGxpLmNoaWxkcmVuWzBd&#xA;LnZhbHVlOwoJCQlsZXQgc3JjID0gbGkuY2hpbGRyZW5bM10udmFsdWU7CgkJCXByb2dyYW1zW2ld&#xA;ID0ge25hbWU6IG5hbWUsIHNyYzogc3JjLCBzY29yZTogMH07CgkJfQoJCWxldCByZXN1bHRzTGlz&#xA;dCA9IGRvY3VtZW50LmdldEVsZW1lbnRCeUlkKCJyZXN1bHRzTGlzdCIpOwoJCXJlc3VsdHNMaXN0&#xA;LmlubmVySFRNTCA9ICcnOwoJCWZvcihsZXQgaSA9IDA7IGkgPCBuOyBpKyspCgkJewoJCQlsZXQg&#xA;bGkgPSBkb2N1bWVudC5jcmVhdGVFbGVtZW50KCJsaSIpOwoJCQlsaS5pbm5lckhUTUwgPSBgJHtw&#xA;cm9ncmFtc1tpXS5uYW1lfTogJHtwcm9ncmFtc1tpXS5zY29yZX1gOwoJCQlyZXN1bHRzTGlzdC5h&#xA;cHBlbmRDaGlsZChsaSk7CgkJfQoJCWZvcihsZXQgY21waSA9IDA7IGNtcGkgPCBuOyBjbXBpKysp&#xA;CgkJewoJCQlsZXQgY21wID0gZXZhbChwcm9ncmFtc1tjbXBpXS5zcmMpOwoJCQlmb3IobGV0IHAx&#xA;aSA9IDA7IHAxaSA8IG47IHAxaSsrKQoJCQlmb3IobGV0IHAyaSA9IHAxaSArIDE7IHAyaSA8IG47&#xA;IHAyaSsrKQoJCQl7CgkJCQlpZihwMWkgPT0gY21waSB8fCBwMmkgPT0gY21waSkgY29udGludWU7&#xA;CgkJCQlsZXQgcDEgPSBwcm9ncmFtc1twMWldLCBwMiA9IHByb2dyYW1zW3AyaV07CgkJCQlsZXQg&#xA;cmVzdWx0ID0gY21wKHAxLnNyYywgcDIuc3JjKTsKCQkJCWlmKHJlc3VsdCA9PT0gMSkKCQkJCQlw&#xA;MS5zY29yZSsrOwoJCQkJZWxzZSBpZihyZXN1bHQgPT09IDIpCgkJCQkJcDIuc2NvcmUrKzsKCQkJ&#xA;CWVsc2UgYWxlcnQoYHByb2dyYW0gJHtwcm9ncmFtc1tjbXBpXS5uYW1lfSByZXR1cm5lZCBpbnZh&#xA;bGlkIHJlc3VsdGApOwoJCQl9CgkJCWZvcihsZXQgaSA9IDA7IGkgPCBuOyBpKyspCgkJCQlyZXN1&#xA;bHRzTGlzdC5jaGlsZHJlbltpXS5pbm5lckhUTUwgPSBgJHtwcm9ncmFtc1tpXS5uYW1lfTogJHtw&#xA;cm9ncmFtc1tpXS5zY29yZX1gOwoJCX0KCX0KPC9zY3JpcHQ+Cjx0ZW1wbGF0ZSBpZD0icHJvZ3Jh&#xA;bVRlbXBsYXRlIj4KCTxsaT4KCQk8aW5wdXQgdHlwZT10ZXh0IHBsYWNlaG9sZGVyPSJuYW1lIi8+&#xA;CgkJPGlucHV0IHR5cGU9ImJ1dHRvbiIgdmFsdWU9InJlbW92ZSBwcm9ncmFtIj4KCQk8YnI+CgkJ&#xA;PHRleHRhcmVhIHBsYWNlaG9sZGVyPSJzb3VyY2UgY29kZSI+PC90ZXh0YXJlYT4KCTwvbGk+Cjwv&#xA;dGVtcGxhdGU+CjxzdHlsZT4KCS5jb2x1bW4geyBmbG9hdDogbGVmdDsgd2lkdGg6NTAlOyB9Cjwv&#xA;c3R5bGU+CjwvYm9keT4KPGhlYWQ+CjxkaXY+Cgk8ZGl2IGNsYXNzPSJjb2x1bW4iPgoJCTxpbnB1&#xA;dCB0eXBlPSJidXR0b24iIHZhbHVlPSJBZGQgcHJvZ3JhbSIgb25jbGljaz0iYWRkUHJvZ3JhbSgp&#xA;Ii8+CgkJPHVsIGlkPSJwcm9ncmFtc0xpc3QiPiA8L3VsPgoJPC9kaXY+Cgk8ZGl2IGNsYXNzPSJj&#xA;b2x1bW4iPgoJCTxpbnB1dCB0eXBlPSJidXR0b24iIHZhbHVlPSJSdW4gdGhlIGNvbXBldGl0aW9u&#xA;IiBvbmNsaWNrPSJzaW11bGF0ZSgpIi8+CgkJPGJyPgoJCUxhc3QgcnVuIHJlc3VsdHM6CgkJPGJy&#xA;PgoJCTx1bCBpZD0icmVzdWx0c0xpc3QiPiA8L3VsPgoJPC9kaXY+CjwvZGl2Pgo8L2hlYWQ+Cjwv&#xA;aHRtbD4K`.split(&quot;\n&quot;).join``))&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&lt;p&gt;This is tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;. Whoever wins the most wins!&lt;/p&gt;&#xA;&lt;p&gt;After posting this, I will post two example (community wiki) answers: one that compares in lexicographic order, and another that compares first by byte count, then in lexicographic order (the reason for posting &lt;em&gt;two&lt;/em&gt; is that at least 3 programs are needed for anyone to get any points).&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox stuff&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How can I prevent the last answer from always winning?&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Will that happen automatically, once enough answers are posted that it's nearly impossible to optimize for all of them?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Would it be a good idea to introduce other requirements for the submissions, such as transitivity?&lt;/li&gt;&#xA;&lt;li&gt;Would it be a good idea to introduce a per-user submission limit (probably 1 or 2)?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="36445" LastEditorUserId="36445" LastEditDate="2020-06-25T16:28:30.883" LastActivityDate="2020-06-25T16:28:30.883" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="18315" PostTypeId="2" ParentId="7804" CreationDate="2019-11-26T17:02:25.687" Score="1" Body="&lt;h1&gt;Tower Defense (Abandoned)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anyone is free to take over this challenge and fork as necessary. Just give me credit ;)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/DKjjM.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/DKjjM.jpg&quot; alt=&quot;Tower Defense Example&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;http://Beefster09.github.io/pcg-tower-defense/tower-defense.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;View it here&lt;/a&gt; | &lt;a href=&quot;https://chat.stackexchange.com/rooms/80457/tower-defense&quot;&gt;Chat&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Tower Defense is a format for casual games that was popularized in the Flash era. The player places towers that shoot down invaders moving along a predefined path.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Overview&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Two submissions will compete against each other to invade the other player's village without being invaded themselves. They will have the ability to place towers, upgrade them, and spawn invaders to attack the enemy village. The game will be simulated deterministically in a turn based fashion, with each player being able to do one action each turn.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The game board is made up of two paths, each 100 spaces long. Each player begins with 500 gold, which is used for building towers and spawning invaders; and 100 life. Your objective is to bring your opponent's life down to 0. If neither player has been defeated after 100000 turns, the winner will be the player with the most life at that point, with ties being broken by who has the most gold at that point. If, somehow, there is still a tie, the match will be considered a tie.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Income&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Every 10 turns, players will receive gold. Initially, they receive 10 gold, but this amount increases by 3 every 100 turns.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each time you successfully get an invader through your opponent's defenses, your income increases by 1 and you receive a portion of your income proportional to how much HP the invader had left.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each time one of your towers defeats an invader, you receive gold. (More on that below)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Towers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Each space on the path can house one tower. There are 3 types of towers, which have a range and a power. It takes 10 turns for a tower to be ready after it is built. Towers can be upgraded either with a wider range or an increased power, in increments of 1. There is no hard limit to how many times a tower can be upgraded.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Range refers to how many spaces away from the tower that can be reached by the tower's abilities. A range of 0 means that only the space that the tower is on is affected by the tower's attacks.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Power has a different meaning depending on the kind of tower.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Turrets&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each turn, turrets fire at the invader within range that is farthest along the path to your village. They deal damage equal to the tower's power.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Turrets begin with a range of 1 and a power of 1.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Stunners&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Stunners fire at the invader within range that is farthest along the path to your village. However, instead of dealing damage, they stun the invader for a number of turns equal to the tower's power. After firing, stunners cannot fire again for their power + 1 turns. Stunners will not fire at invaders that are already stunned.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Stunners begin with a range of 0 and a power of 3&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Bombs&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When an invader is on the same space as the bomb tower, it triggers and deals damage equal to its power to all invaders within its range. After being triggered, it cannot fire again for another 5 turns.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bombs begin with a range of 2 and a power of 2&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Invaders&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Each turn, you may spawn an invader. At minimum, it costs 10 gold and has a base HP of 10. You can spend additional gold to increase its power:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;(1G) +1 HP&lt;/li&gt;&#xA;&lt;li&gt;(10G) +1 Defense (reduce damage taken by 1, but not lower than 1)&lt;/li&gt;&#xA;&lt;li&gt;(10G) +1 Stun resistance (reduces stun time by 1 turn)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You are limited on the maximum stats. You start off unable to boost stats, but every 100 turns, the maximum increases by 5&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There can only be one invader on each space of the board and invaders cannot pass through each other. You cannot spawn an invader if there is already an invader on the first space of the board. Therefore, a potential counterplay from defenders to prevent massive hordes of invaders is to put stunners on the first few spaces.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Coding&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The main game / AI driver is &lt;a href=&quot;http://Beefster09.github.io/pcg-tower-defense/tower-defense.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; (still a work in progress)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Submission logistics TBD&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Both players will have complete knowledge about the state of the game and will be allowed to maintain state from the beginning of the game. They may not directly modify the game state. Any attempts to do so will be disqualified as will any attempt to obfuscate such an attempt.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(api description will go here)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Defenders should return an object with an &lt;code&gt;action&lt;/code&gt; property that is either &lt;code&gt;'build'&lt;/code&gt;, &lt;code&gt;'upgrade'&lt;/code&gt;, or &lt;code&gt;'destroy'&lt;/code&gt;. Each requires some additional properties to be set: (will add later)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Invaders should return an object which contains any stat boosts desired: &lt;code&gt;hp&lt;/code&gt;, &lt;code&gt;defense&lt;/code&gt;, and &lt;code&gt;stunRes&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Both defenders or invaders may also return undefined or null to indicate not taking an action.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;AIs must return their desired action in less than 10 milliseconds, averaged over 100 turns. Invalid actions returned by the AI will be ignored.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;All submissions will compete against all other submissions in a round-robin tournament. The bot that wins the most matches is declared the winner. In the event of a tie, the number of turns it took to win will be totaled for all winning matches with the smallest cumulative turn count to victory wins. In the unlikely event of a further tie, the turns to loss will be totaled for all losing matches and the bot with the highest cumulative turn count to loss wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Only one submission per user can be scored in the round-robin tournament.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No abusing standard loopholes&lt;/li&gt;&#xA;&lt;li&gt;No direct modification of the game state passed to you. It will &lt;em&gt;not&lt;/em&gt; be defensively deep-copied. Don't obfuscate your code to try to hide state modification.&lt;/li&gt;&#xA;&lt;li&gt;Any uncaught exceptions will result in disqualification.&lt;/li&gt;&#xA;&lt;li&gt;Implementations must be totally deterministic, i.e. random number generators are only allowed if seeded consistently (either with a constant or with game state) and must use isolated random state which the other AI in play cannot access.&lt;/li&gt;&#xA;&lt;li&gt;Submissions shall include an explanation of the AI's strategy.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="45613" LastActivityDate="2019-11-26T17:02:25.687" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18317" PostTypeId="2" ParentId="2140" CreationDate="2019-11-28T02:35:15.520" Score="0" Body="&lt;h1&gt;Walk N Spaces on a Game Board&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graph-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graph-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;graph-theory&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This challenge is inspired by Touhou Cannonball, a mobile game that includes a board game element similar to Mario Party, except for the fact that movement isn't restricted to one particular direction.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/f8BhY.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/f8BhY.jpg&quot; alt=&quot;A Touhou Cannonball board.&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Movement&lt;/h3&gt;&#xA;&lt;p&gt;On your turn, a six-sided dice is rolled to determine how many spaces to move. For each of those spaces, you can move to any adjacent space, as long as you do not backtrack to the space you were on in a previous move.&lt;/p&gt;&#xA;&lt;p&gt;For example, if you roll a 2 and start from space &lt;code&gt;[2]&lt;/code&gt; in the following graph, you can move left twice to space &lt;code&gt;[0]&lt;/code&gt; or right twice to space &lt;code&gt;[4]&lt;/code&gt;, but you cannot move once left and once right to land on space &lt;code&gt;[2]&lt;/code&gt; again, because you traveled across the same edge in two consecutive moves.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0&amp;lt;-&amp;gt;1&amp;lt;-&amp;gt;2&amp;lt;-&amp;gt;3&amp;lt;-&amp;gt;4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You &lt;em&gt;can&lt;/em&gt; move to a previously visited space, as long as you aren't &amp;quot;backtracking&amp;quot; to that space -- if you roll a 4 on the following graph starting from space &lt;code&gt;[0]&lt;/code&gt;, you can land on &lt;code&gt;[0]&lt;/code&gt; by going in a circle around the graph with the move &lt;code&gt;[0]-&amp;gt;[1]-&amp;gt;[2]-&amp;gt;[3]-&amp;gt;[0]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0&amp;lt;--&amp;gt;1&#xA;^    ^&#xA;|    |&#xA;v    v&#xA;3&amp;lt;--&amp;gt;2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Some graphs may have some directed edges. If your graph is &lt;code&gt;[0]--&amp;gt;[1]&lt;/code&gt;, you can move from &lt;code&gt;[0]&lt;/code&gt; to &lt;code&gt;[1]&lt;/code&gt;, but not the other way around.&lt;/p&gt;&#xA;&lt;h3&gt;The Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Given any appropriate directed graph structure (incidence matrix, adjacency list, etc.), a starting position, and a number of spaces to move, output all possible positions you can move to.&lt;/p&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;Example inputs are zero-indexed in the format &lt;code&gt;starting position, number of spaces, adjacency list&lt;/code&gt;. I will also have the visual graph included for better visualization. (More to be added later)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input: 2, 5, [ [1,2], [0,3], [3,4], [1,6], [2,5], [4,6], [3,5] ]&#xA;0&amp;lt;-----&amp;gt;1&#xA;^       ^&#xA;|       |&#xA;|       v&#xA;2------&amp;gt;3&#xA;^       ^&#xA;|       |&#xA;v       v&#xA;4&amp;lt;-&amp;gt;5&amp;lt;-&amp;gt;6&#xA;&#xA;Output: [1,2,5]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="52194" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-11-28T02:35:15.520" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18318" PostTypeId="1" CreationDate="2019-11-28T09:40:00.027" Score="9" ViewCount="216" Body="&lt;p&gt;Recently I found &lt;a href=&quot;https://codegolf.stackexchange.com/a/71003/89826&quot;&gt;this answer,&lt;/a&gt; which was apparently marked as &quot;Very Low Quality&quot; due to not being ungolfed and hard to explain. Apparently, this was the norm at the time. However, nowadays I see a large number of answers with little/no explanation - was this rule changed, and if so, when?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should it be changed back, or is the recently halved moderation team unable to keep up with the flood of extra reports they would have to handle?&lt;/p&gt;&#xA;" OwnerUserId="89826" LastActivityDate="2019-11-28T09:40:00.027" Title="VLQ answers - are these still a thing?" Tags="|discussion|" AnswerCount="0" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18319" PostTypeId="2" ParentId="2140" CreationDate="2019-11-29T21:22:39.427" Score="1" Body="&lt;h1&gt;plan an efficient finnish bus stop on a sphere&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Apparently respecting personal space is very important at &lt;a href=&quot;https://twitter.com/vilsepi/status/795254546763313152?lang=it&quot; rel=&quot;nofollow noreferrer&quot;&gt;finnish bus stops&lt;/a&gt;. Now given some &amp;quot;minimum-personal-space-angle&amp;quot; &lt;span class=&quot;math-container&quot;&gt;\$\vartheta\$&lt;/span&gt;, your job is designing a bus stop on a sphere for as many people as possible respecting the &amp;quot;minimum-personal-space-angle&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;Let us rephrase this a little bit more clearly: Let &lt;span class=&quot;math-container&quot;&gt;\$S^2 = \{x \in \mathbb R^3 \mid \Vert x \Vert_2 =1 \}\$&lt;/span&gt; be the unit sphere in &lt;span class=&quot;math-container&quot;&gt;\$\mathbb R^3\$&lt;/span&gt;. Given the angle &lt;span class=&quot;math-container&quot;&gt;\$\vartheta \in (0,\pi)\$&lt;/span&gt; you should find a set &lt;span class=&quot;math-container&quot;&gt;\$U \subset S^2\$&lt;/span&gt; such that all pairs of vectors &lt;span class=&quot;math-container&quot;&gt;\$x,y \in U\$&lt;/span&gt; (&lt;span class=&quot;math-container&quot;&gt;\$x \neq y\$&lt;/span&gt;) are at least an angle of &lt;span class=&quot;math-container&quot;&gt;\$\vartheta\$&lt;/span&gt; apart, that is &lt;span class=&quot;math-container&quot;&gt;\$x \cdot y \leqslant \cos \vartheta\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;And this set &lt;span class=&quot;math-container&quot;&gt;\$U\$&lt;/span&gt; should be as large as possible - but this does not mean that your program needs to find the largest possible &lt;span class=&quot;math-container&quot;&gt;\$U\$&lt;/span&gt; (this is a hard unsolved problem), but it should try to make it as large as possible as this will be part of the score.&lt;/p&gt;&#xA;&lt;p&gt;Let us define &lt;span class=&quot;math-container&quot;&gt;\$a_\vartheta = \vert U \vert\$&lt;/span&gt; as the number of vectors your program found for &lt;span class=&quot;math-container&quot;&gt;\$\vartheta\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The score &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; of your submission will be&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$ s=\frac{1}{N}\sum_{n=1}^N a_{\vartheta_n} w_n$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;where &lt;span class=&quot;math-container&quot;&gt;\$\vartheta_n = 1/n\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$w_n = 1/n^2\$&lt;/span&gt;. And you can choose &lt;span class=&quot;math-container&quot;&gt;\$N \in \mathbb N\$&lt;/span&gt; as large as you want.&lt;/p&gt;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://www.reddit.com/r/math/comments/e3go8b/question_maximum_number_of_vectors_in_rn_that_are/&quot; rel=&quot;nofollow noreferrer&quot;&gt;this reddit thread&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;META:&lt;/h1&gt;&#xA;&lt;p&gt;I think the choice of &lt;span class=&quot;math-container&quot;&gt;\$\vartheta_n\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$w_n\$&lt;/span&gt; needs some fine tuning to make the challenge interesting. My thoughts so far: The idea is that &lt;span class=&quot;math-container&quot;&gt;\$a_{\vartheta} \leqslant c \frac{1}{\vartheta^2}\$&lt;/span&gt; since every vector on the sphere needs a circle of a radius that is at least &lt;span class=&quot;math-container&quot;&gt;\$\vartheta/2\$&lt;/span&gt;, so the area of such a circle is about &lt;span class=&quot;math-container&quot;&gt;\$\pi (\vartheta/2)^2\$&lt;/span&gt; which means we can fit at most &lt;span class=&quot;math-container&quot;&gt;\$\frac{4\pi}{\pi (\vartheta/2)^2} = \frac{1}{\vartheta^2}\$&lt;/span&gt; (just as a rough estimate).&lt;/p&gt;&#xA;&lt;p&gt;So I think with current choice of &lt;span class=&quot;math-container&quot;&gt;\$\vartheta_n\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$w_n\$&lt;/span&gt; the score should be bounded. But I fear that with the current choice of these sequences the greatest score will be achieved by a relatively simple solution where someone just chooses &lt;span class=&quot;math-container&quot;&gt;\$N=1,2\$&lt;/span&gt; or so.&lt;/p&gt;&#xA;&lt;p&gt;Can we alleviate this by adding a factor of &lt;span class=&quot;math-container&quot;&gt;\$\log n\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$w_n\$&lt;/span&gt;? Unfortunately I think this would incentivise using very large &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;EDIT&lt;/strong&gt;: Instead of using &lt;span class=&quot;math-container&quot;&gt;\$\log n\$&lt;/span&gt; I think using a &lt;em&gt;bounded&lt;/em&gt; increasing sequence would work. E.g. &lt;span class=&quot;math-container&quot;&gt;\$(1-1/n)\$&lt;/span&gt; so &lt;span class=&quot;math-container&quot;&gt;\$w_n = \frac{1}{n^2}(1- \frac{1}{n})\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;If you have any thoughts or ideas, please share!&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-12-05T19:55:22.363" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18320" PostTypeId="2" ParentId="2140" CreationDate="2019-11-30T20:29:41.013" Score="1" Body="&lt;h1&gt;Roll for Initiative!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot;&gt;sorting&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In tabletop games like Dungeons and Dragons, when you begin a battle, all involved parties &lt;em&gt;roll for initiative&lt;/em&gt;. In DnD 5e, this is &lt;code&gt;1d20 + DEX + Other bonuses&lt;/code&gt;, where &lt;code&gt;DEX&lt;/code&gt; is the bonus given by your Dexterity stat. The characters that roll higher numbers go first. We'll use a similar, deterministic system in this challenge.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that, when given a list of characters, will output a list of characters in order of initiative.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A character is defined as this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;character = {&#xA;    name: &quot;name&quot; // a string&#xA;    statblock: [SPD, DEX, WHT] // a list of numbers&#xA;                               // DEX = dexterity, SPD = speed, WHT = weight&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The formula for initiative is the following:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$\text{Initiative} = \left\lfloor{ \frac{\text{SPD}^2}{\sqrt{\lvert\text{DEX}\rvert}} }\right\rfloor - \text{WHT}$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A list of characters, unsorted. This can be a JSON object, a list of lists, a list of dictionaries, a series of strings etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is guaranteed that all names will be unique.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A list of characters, or character names, sorted by initiative order from highest to lowest, based on the above formula.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;IO can be used with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;any convenient method&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so smallest program wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Sample IO&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input --&amp;gt; Output&#xA;[[Name, SPD, DEX, WHT], ...]&#xA;    --&amp;gt; [[Name, SPD, DEX, WHT], ...] (or [Name, Name, ...])&#xA;---------&#xA;[[Alice,1,2,3],[Bob,10,5,0],[Charlie,3,2,1]]&#xA;    --&amp;gt; [Bob, Charlie, Alice]&#xA;// Alice = -3, Bob = 44, Charlie = 5&#xA;&#xA;[[Z,1,1,1],[B,1,1,1],[XY,5,1,1]]&#xA;    --&amp;gt; [XY, Z, B]&#xA;// Retain the order of characters from the input if they have the same initiative.&#xA;// Z = 0, B = 0, XY = 24&#xA;&#xA;[[Neg,-3,-3,-1],[SomeNeg,5,-2,-4],[NoNeg,4,6,8]]&#xA;    --&amp;gt; [SomeNeg, Neg, NoNeg]&#xA;// Negative values are valid.&#xA;// Neg = 6, SomeNeg = 13, NoNeg = -2&#xA;&#xA;[[Flo,1.5,2.5,3.5],[MoreFlo,2,2.5,3.5]]&#xA;    --&amp;gt; [[MoreFlo,2,2.5,3.5], [Flo,1.5,2.5,3.5]]&#xA;// Floats are also valid.&#xA;// Flo = -2.5, MoreFlo = -1.5&#xA;&#xA;[[Lonely,1,2,3]]&#xA;    --&amp;gt; [[Lonely,1,2,3]]&#xA;// Input with 1 item.&#xA;&#xA;[]&#xA;    --&amp;gt; []&#xA;// Empty input leads to empty output.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2019-12-05T23:19:59.950" LastActivityDate="2019-12-05T23:19:59.950" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18323" PostTypeId="2" ParentId="2140" CreationDate="2019-12-01T14:56:29.223" Score="2" Body="&lt;h1&gt;Times have changed!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(pun intended)&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Preface&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As mathematics progressed, mathematicians agreed upon the 'order of operations', to prevent mathematical expressions from becoming ambiguous.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given the expression &lt;span class=&quot;math-container&quot;&gt;\$7 \times 6 + 5 \times 3\$&lt;/span&gt; we know to first evalulate multiplication, giving &lt;span class=&quot;math-container&quot;&gt;\$ 42 + 15\$&lt;/span&gt;, which is equal to &lt;span class=&quot;math-container&quot;&gt;\$57\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But  what if another group of mathematicians had agreed to evaluate addition before multiplication? This expression would become &lt;span class=&quot;math-container&quot;&gt;\$ 7 \times 11 \times 3\ = 231\$&lt;/span&gt;: which is different from our answer by an error of &lt;span class=&quot;math-container&quot;&gt;\$305\%\$&lt;/span&gt;!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a mathematical expression containing &lt;code&gt;+&lt;/code&gt; (addition), &lt;code&gt;*&lt;/code&gt; (multiplication), and the digits &lt;code&gt;0123456789&lt;/code&gt;, we can find:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$E_1\$&lt;/span&gt; - the 'real' value of the expression, when multiplication takes precendence.&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$E_2\$&lt;/span&gt; - the 'alternate' value of the expression, when addition takes precedence.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a program or function which, given a string representing an expression, calculates and outputs the percentage error, &lt;span class=&quot;math-container&quot;&gt;\$\frac{|E_1 - E_2|}{E_1} \times 100\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;WIP.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="60919" LastActivityDate="2019-12-01T14:56:29.223" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18324" PostTypeId="2" ParentId="2140" CreationDate="2019-12-02T09:08:13.840" Score="2" Body="&lt;h1&gt;Bake the cookie&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Quick intro&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;So i was playing cookie clicker yesterday, and I thought about something. We keep producing cookies, without any loss. What if your cookies failed? This is where I thought about a clicker that would cook a cookie. Don't click too much, or the cookie will be overcooked!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task will be to create a function that will &quot;bake&quot; a cookie :&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your function will have to randomly select a number between 5 and 10 : it will establish the cooking duration of your cookie (and so, the number of time you'll have to call the function to cook your delicious cookie).&lt;/li&gt;&#xA;&lt;li&gt;Each time you call that function, it will iterate the baking process of your cookie.&lt;/li&gt;&#xA;&lt;li&gt;Your function should return &quot;Undercooked&quot; if your cookie is not fully cooked, &quot;Overcooked&quot; if you ... overcooked it, and &quot;Cooked&quot; when the cookie is baked just right.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Since I'm bad at explaining things, an example will show you more clearly what needs to be done.&#xA;Let's call my function bake() :&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;bake()    // The random number generated is 6, so i need to call my function 6 times&#xA;Undercooked&#xA;&#xA;bake()&#xA;Undercooked&#xA;&#xA;bake()&#xA;Undercooked&#xA;&#xA;bake()&#xA;Undercooked&#xA;&#xA;bake()&#xA;Undercooked&#xA;&#xA;bake()    // We hit the 6th function call, the cookie is baked.&#xA;Cooked&#xA;&#xA;bake()    // The 7th call overcooked the cookie. Congratulation, you ruined it.&#xA;Overcooked&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The random number of iterations has to be set the first time you call the function. It has to be between 5 and 10 (inclusive).&lt;/li&gt;&#xA;&lt;li&gt;A cookie has to be undercooked before being cooked, and has to be cooked before being overcooked. The 3 steps have to be reachable. A cookie can't uncook itself, therefore you can't go from cooked to undercooked, or from overcooked to cooked (it's too late, you ruined the cookie anyway).&lt;/li&gt;&#xA;&lt;li&gt;The function can have as many parameters as you please.&lt;/li&gt;&#xA;&lt;li&gt;Classic rules apply, no standard loopholes&lt;/li&gt;&#xA;&lt;li&gt;This is codegolf, so the shortest code wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the challenge clear enough ?&lt;/li&gt;&#xA;&lt;li&gt;Should I go with this method to iterate the &quot;baking&quot; process ?&lt;/li&gt;&#xA;&lt;li&gt;Are there some rules I could add to make it more exciting ?&lt;/li&gt;&#xA;&lt;li&gt;Does this challenge exist already ?&lt;/li&gt;&#xA;&lt;li&gt;Should we bake pies instead ?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41833" LastEditorUserId="41833" LastEditDate="2019-12-03T08:14:05.553" LastActivityDate="2019-12-03T08:14:05.553" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18325" PostTypeId="2" ParentId="2140" CreationDate="2019-12-02T15:34:33.627" Score="0" Body="&lt;h3&gt;How fair are my dice?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(Inspired by a dream I recently had regarding Mario Party. This is not fully fleshed-out yet.)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a pair of dice, e.g., &lt;code&gt;[[1,1,2,2,3,3], [1,2,3,4,5,6]]&lt;/code&gt;, output how &quot;closely&quot; they resemble a pair of standard 1-6 dice (i.e., &lt;code&gt;[[1,2,3,4,5,6], [1,2,3,4,5,6]]&lt;/code&gt;) in terms of distribution of numbers when rolled.&lt;/p&gt;&#xA;" OwnerUserId="42963" LastActivityDate="2019-12-02T15:34:33.627" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18327" PostTypeId="2" ParentId="2140" CreationDate="2019-12-02T16:29:26.467" Score="1" Body="&lt;h1&gt;Name the hydrocarbon&lt;/h1&gt;&#xA;&lt;p&gt;A hydrocarbon is a chemical compound which consists of only hydrogen and carbon atoms. For this challenge, we will only consider the three simplest kinds of hydrocarbons: &lt;strong&gt;alkanes&lt;/strong&gt;, &lt;strong&gt;alkenes&lt;/strong&gt;, and &lt;strong&gt;alkynes&lt;/strong&gt; with no branches.&lt;/p&gt;&#xA;&lt;p&gt;An &lt;strong&gt;alkane&lt;/strong&gt; with &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; carbon atoms contains &lt;span class=&quot;math-container&quot;&gt;\$2n+2\$&lt;/span&gt; hydrogen atoms. An &lt;strong&gt;alkene&lt;/strong&gt; with &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; carbon atoms contains &lt;span class=&quot;math-container&quot;&gt;\$2n\$&lt;/span&gt; hydrogen atoms. An &lt;strong&gt;alkyne&lt;/strong&gt; with &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; carbon atoms contains &lt;span class=&quot;math-container&quot;&gt;\$2n-2\$&lt;/span&gt; hydrogen atoms.&lt;/p&gt;&#xA;&lt;p&gt;Each kind of hydrocarbon is named with a prefix indicating the number of carbon atoms it contains, followed by the suffix &lt;code&gt;ane&lt;/code&gt;, &lt;code&gt;ene&lt;/code&gt;, or &lt;code&gt;yne&lt;/code&gt; if it is an alkane, alkene, or alkyne respectively. The numerical prefixes are as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1  -&amp;gt; meth&#xA;2  -&amp;gt; eth&#xA;3  -&amp;gt; prop&#xA;4  -&amp;gt; but&#xA;5  -&amp;gt; pent&#xA;6  -&amp;gt; hex&#xA;7  -&amp;gt; hept&#xA;8  -&amp;gt; oct&#xA;9  -&amp;gt; non&#xA;10 -&amp;gt; dec&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For example, we can see &lt;code&gt;propane&lt;/code&gt; has 3 carbon and 8 hydrogen atoms, and &lt;code&gt;heptyne&lt;/code&gt; has 7 carbon and 12 hydrogen atoms.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Your task is to write a function or program that receives two integers, representing a number of carbon and hydrogen atoms, and produces or outputs the name of the corresponding hydrocarbon. Capitalization does not matter, and leading/trailing whitespace is allowed.&lt;/p&gt;&#xA;&lt;p&gt;The input and output can be in any convenient format. You may assume the input will correspond to a valid hydrocarbon, and there are at most 10 carbon atoms.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input -&amp;gt; Output&#xA;1 4   -&amp;gt; Methane&#xA;3 8   -&amp;gt; Propane&#xA;7 12  -&amp;gt; Heptyne&#xA;10 20 -&amp;gt; Decene&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No standard loopholes.&lt;/li&gt;&#xA;&lt;li&gt;Shortest code in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chemistry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chemistry&amp;#39;&quot; rel=&quot;tag&quot;&gt;chemistry&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="89930" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-12-02T16:29:26.467" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18329" PostTypeId="2" ParentId="2140" CreationDate="2019-12-02T20:14:16.247" Score="1" Body="&lt;h1&gt;Numbers without 'E'&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In this trial, I wish for us to think only of digits and digit compounds, from two to six trillion. If any in this group contains, in a plain Latin writing form, an indication of what our prompt prohibits, it is cast out of this group.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a digit or digit compound contains 100, 1000, or similar, &quot;1&quot; is not a part of its plain Latin writing form. 1000 would simply boil down to &quot;thousand&quot;, although 4000 is &quot;four thousand&quot;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What you must do:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Taking an input of N, in which N is not as high as 1000, nor as low as 0, (0 &amp;lt; N &amp;lt; 1000), and in which N is an ordinal, output what N points to in an array that follows our titular prompt.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, your solutions may contain only a solitary count of this cast out latin symbol (including diacritical marks and such, although this should not dismay you too much).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your aim is to do this with a minimum bit count in your program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This following portion is for clarification on what I am in pursuit of:&#xA;&lt;code&gt;&#xA;    1 -&amp;gt; 2 (two)&#xA;    3 -&amp;gt; 6 (six)&#xA;    5 -&amp;gt; 32 (thirty two)&#xA;    22 -&amp;gt; 1004 (thousand four)&#xA;    100 -&amp;gt; 30 000 (thirty thousand)&#xA;&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Meta:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As you may have noticed, this is a little hard to read. I tried to spice it up by excluding any instance of the letter 'e' from the text description.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should the challenge be changed to &quot;evaluate if a number contains 'E'&quot;? This is an alternative idea Id considered but Im not sure if it would make a better challenge&lt;/li&gt;&#xA;&lt;li&gt;Does eliminating all instances of 'e' from the description make this challenge unreadable?&lt;/li&gt;&#xA;&lt;li&gt;Does the additional challenge of only having 1 'e' in the solution add too much to the challenge?&lt;/li&gt;&#xA;&lt;li&gt;Are the bounds too restrictive/not restrictive enough?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="90146" LastActivityDate="2019-12-02T20:14:16.247" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18333" PostTypeId="2" ParentId="2140" CreationDate="2019-12-04T21:16:26.610" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/196670/game-of-putting-lines-through-dots&quot;&gt;A game of putting lines through dots.&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="90109" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-12-05T21:07:18.397" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18334" PostTypeId="2" ParentId="5243" CreationDate="2019-12-05T07:07:26.330" Score="33" Body="&lt;h1&gt;50+ rep whenever you outgolf xnor&lt;/h1&gt;&#xA;&lt;p&gt;I've reached 100K and it's time to gift it back! I offer +50 rep to any new answer that outgolfs one of mine.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/search?tab=newest&amp;amp;q=user%3a20260%20created%3a2016..%20%5bcode-golf%5d%20is%3aanswer%20-%5btips%5d%20wiki%3ano&quot;&gt;Answers to outgolf&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Rules&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Submit an answer that's &lt;strong&gt;shorter than mine&lt;/strong&gt; and &lt;strong&gt;in the same language&lt;/strong&gt; to a code golf challenge.&lt;/li&gt;&#xA;&lt;li&gt;It's fair game to &lt;strong&gt;shave bytes off my code&lt;/strong&gt; after you look at it. Post an answer with your improvement.&lt;/li&gt;&#xA;&lt;li&gt;Any code golf answer of mine is eligible if it's &lt;strong&gt;at least one hour old&lt;/strong&gt; and from &lt;strong&gt;2016 or later&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Only your new answers count&lt;/strong&gt;, that is, those posted after this bounty.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I'm trying convey my intent with these rules, but it's up to my judgment what qualifies or not. Feel free to ask if unsure. Some further details:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Even saving 1 byte counts. I may award a larger bounty for bigger golfs, or those that are particularly interesting or well-explained.&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Cheap&amp;quot; golfs don't count. This means those mainly due to a different language version, looser I/O, or a changed or clarified spec. Remember that liberal I/O defaults weren't always a thing. Where I say I'm purposely avoiding some method or library, your answer needs to do so too.&lt;/li&gt;&#xA;&lt;li&gt;Non-code-golf challenges don't qualify.&lt;/li&gt;&#xA;&lt;li&gt;If you further golf someone else's answer that already outgolfed me, I'll decide case-by-case whether to award another bounty.&lt;/li&gt;&#xA;&lt;li&gt;Where I have answers in different languages to a question, these count separately.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Please edit in bounty claims here.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Bounty claims&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/196776/20080&quot;&gt;isaacg's solution&lt;/a&gt; to the challenge &lt;a href=&quot;https://codegolf.stackexchange.com/q/194230/20080&quot;&gt;Length-terminated sequences&lt;/a&gt;. Outgolfs xnor's Python solution, 62 bytes to 67 bytes.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/users/88089/wilkben&quot;&gt;wilkben&lt;/a&gt; for &lt;a href=&quot;https://codegolf.stackexchange.com/a/199770/20260&quot;&gt;their Python solution&lt;/a&gt; on &amp;quot;&lt;a href=&quot;https://codegolf.stackexchange.com/q/199638/20260&quot;&gt;Egg, sausage, bacon and spam (lovely spam!)&lt;/a&gt;&amp;quot;, outgolfing &lt;a href=&quot;https://codegolf.stackexchange.com/a/199678/20260&quot;&gt;xnor's&lt;/a&gt; by one byte to 31 bytes from 32.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/users/53748/jonathan-allan&quot;&gt;Jonathan Allan&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/199857/20260&quot;&gt;Python solution&lt;/a&gt; on &amp;quot;&lt;a href=&quot;https://codegolf.stackexchange.com/q/199638/20260&quot;&gt;Egg, sausage, bacon and spam (lovely spam!)&lt;/a&gt;&amp;quot;, further outgolfing &lt;a href=&quot;https://codegolf.stackexchange.com/a/199678/20260&quot;&gt;xnor's solution&lt;/a&gt; down to 28 bytes.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/users/3852/lynn&quot;&gt;Lynn&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/199784/20260&quot;&gt;Python solution&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/q/198717/20260&quot;&gt;&amp;quot;Repeat every other character in string starting with second character&amp;quot;&lt;/a&gt;, outgolfing &lt;a href=&quot;https://codegolf.stackexchange.com/a/198724/20260&quot;&gt;xnor's 38-byte answer&lt;/a&gt; to 36 bytes.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/a/200429/20260&quot;&gt;Arnauld's Python answer&lt;/a&gt; on &amp;quot;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/200386/how-many-petals-around-the-rose/200429#200429&quot;&gt;How many petals around the rose&lt;/a&gt;&amp;quot; for outgolfing &lt;a href=&quot;https://codegolf.stackexchange.com/a/200407/20260&quot;&gt;xnor's 31-byte answer&lt;/a&gt; by a byte.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/a/201493/20260&quot;&gt;Bubbler's answer&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/197573/random-spanning-tree-of-a-rectangular-grid/201493#201493&quot;&gt;Random spanning tree of a rectangular grid&lt;/a&gt; for saving 2 bytes over &lt;a href=&quot;https://codegolf.stackexchange.com/a/197624/20260&quot;&gt;xnor's 136-byte answer&lt;/a&gt; in Python&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/a/203149/52210&quot;&gt;Kevin Cruijssen's 33-bytes Python 2 answer&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/119472/be-the-first-1-leave-only-the-first-truthy&quot;&gt;&lt;em&gt;Be the First 1 (leave only the first Truthy)&lt;/em&gt;&lt;/a&gt; for saving 2 bytes on &lt;a href=&quot;https://codegolf.stackexchange.com/a/119503/52210&quot;&gt;&lt;em&gt;@xnor&lt;/em&gt;'s 35 byte answer&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/a/203289/20260&quot;&gt;dingledooper's 53-byte Python 2 answer&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4244/code-golf-christmas-edition-how-to-print-out-a-christmas-tree-of-height-n/203289#203289&quot;&gt;Code Golf Christmas Edition: How to print out a Christmas tree of height N&lt;/a&gt;, saving 3 bytes over &lt;a href=&quot;https://codegolf.stackexchange.com/a/177755/202600&quot;&gt;xnor's&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/a/203855/20260&quot;&gt;Surculose Sputum's 68-byte Python 3 answer&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/q/203853/20260&quot;&gt;Perimeter of Conway Hexagon&lt;/a&gt; for outgolfing &lt;a href=&quot;https://codegolf.stackexchange.com/a/203857/20260&quot;&gt;xnor's&lt;/a&gt; 68 bytes to 76.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/a/205391/20260&quot;&gt;Surculose Sputum's 93-byte Python 2 answer&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/205214/remove-loops-from-a-walk&quot;&gt;Remove loops from a walk&lt;/a&gt; for outgolfing &lt;a href=&quot;https://codegolf.stackexchange.com/a/205285/20260&quot;&gt;xnor's&lt;/a&gt; by 5 bytes.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/a/205420/20260&quot;&gt;dingledooper's 66-byte Python 2 answer&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/q/205317/20260&quot;&gt;Judge a book by its cover&lt;/a&gt; for saving 2 bytes from &lt;a href=&quot;https://codegolf.stackexchange.com/a/205369/20260&quot;&gt;xnor's&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;To David's &lt;a href=&quot;https://codegolf.stackexchange.com/a/205606/20260&quot;&gt;Python 2 answer&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/q/205533/20260&quot;&gt;Determine the Sharpness of a Word&lt;/a&gt; for saving one byte off &lt;a href=&quot;https://codegolf.stackexchange.com/a/205536/20260&quot;&gt;xnor's&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;To Sisyphus for &lt;a href=&quot;https://codegolf.stackexchange.com/a/27022/20260&quot;&gt;saving a byte off xnor's 46-byte answer&lt;/a&gt; in Python 3 on &lt;a href=&quot;https://codegolf.stackexchange.com/q/5977/20260&quot;&gt;List of primes under a million&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;To Arnauld for a &lt;a href=&quot;https://codegolf.stackexchange.com/a/213947/20260&quot;&gt;Python 2 solution using a new method&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/q/213805/20260&quot;&gt;The Knight's Dialer&lt;/a&gt;, saving 10 bytes from &lt;a href=&quot;https://codegolf.stackexchange.com/a/213840/20260&quot;&gt;xnor's 83&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;To ovs for a &lt;a href=&quot;https://codegolf.stackexchange.com/a/217610/20260&quot;&gt;Haskell answer&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/q/217536/20260&quot;&gt;Landau logarithm&lt;/a&gt; saving 3 bytes off &lt;a href=&quot;https://codegolf.stackexchange.com/questions/217536/landau-logarithm/217578#217578&quot;&gt;xnor's 72-byte answer&lt;/a&gt;, and to Wheat Wizard for &lt;a href=&quot;https://codegolf.stackexchange.com/a/248483/20260&quot;&gt;saving an additional 2 bytes&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/a/217731/20260&quot;&gt;Sisyphus's Python 2 answer&lt;/a&gt; on &lt;a href=&quot;http://Compute%20the%20Kolakoski%20sequence&quot; rel=&quot;nofollow noreferrer&quot;&gt;Compute the Kolakoski sequence&lt;/a&gt; for being 5 bytes shorter than &lt;a href=&quot;https://codegolf.stackexchange.com/a/157460/20260&quot;&gt;xnor's&lt;/a&gt;, and to &lt;a href=&quot;https://codegolf.stackexchange.com/a/259374/20260&quot;&gt;j4at's brute-forced answer&lt;/a&gt; for saving a further 3 bytes.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/a/220367/20260&quot;&gt;dingledooper's Python 2 answer&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/q/220281/20260&quot;&gt;Semidivisibility&lt;/a&gt; for cutting a byte of &lt;a href=&quot;https://codegolf.stackexchange.com/a/220283/20260&quot;&gt;xnor's&lt;/a&gt; 24 bytes.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/a/223427/20260&quot;&gt;kops' Haskell answer&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/q/107933/20260&quot;&gt;Negative Space Graphs&lt;/a&gt; for saving 2 bytes over &lt;a href=&quot;https://codegolf.stackexchange.com/a/107949/20260&quot;&gt;xnor's&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/a/223612/20260&quot;&gt;dingledooper's 37-byte Python 2 answer&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/223590/output-a-latin-square&quot;&gt;Output a Latin Square&lt;/a&gt; for outgolfing &lt;a href=&quot;https://codegolf.stackexchange.com/a/223604/20260&quot;&gt;xnor's 40 bytes&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/a/223902/20260&quot;&gt;att's Python 2 answer&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/q/223778/20260&quot;&gt;Is it better to walk or run in the rain?&lt;/a&gt; for saving 2 bytes off &lt;a href=&quot;https://codegolf.stackexchange.com/a/223784/20260&quot;&gt;xnor's&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/a/224533/20260&quot;&gt;ovs's Python 2 answer&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/q/224515/20260&quot;&gt;Plz Halp, Need Investors ASAP&lt;/a&gt; for saving 1 byte over &lt;a href=&quot;https://codegolf.stackexchange.com/a/224524/20260&quot;&gt;xnor's&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/a/235899/20260&quot;&gt;dingledooper's 47-byte Python 2 answer&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/q/98866/20260&quot;&gt;Draw a hollow square of # with given width&lt;/a&gt; for being 3 bytes shorter than &lt;a href=&quot;https://codegolf.stackexchange.com/a/98919/20260&quot;&gt;xnor's&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/a/248031/&quot;&gt;Wheat Wizard's 50-byte Haskell answer&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/q/247751/&quot;&gt;Eh, codegolf shmodegolf&lt;/a&gt; for being 2 bytes shorter than &lt;a href=&quot;https://codegolf.stackexchange.com/a/247788/&quot;&gt;xnor's&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/a/249130/&quot;&gt;Wheat Wizard's 48-byte Haskell answer&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/q/69298/&quot;&gt;Find the capacity of 2D printed objects&lt;/a&gt; for being 6 bytes shorter than &lt;a href=&quot;https://codegolf.stackexchange.com/a/69302/&quot;&gt;xnor's&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/a/249144/&quot;&gt;Wheat Wizard's 46-byte Haskell answer&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/q/70476/&quot;&gt;Print the N-bonacci sequence&lt;/a&gt; for being 1 byte shorter than &lt;a href=&quot;https://codegolf.stackexchange.com/a/70522/&quot;&gt;xnor's&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/a/260349/20260&quot;&gt;loopy walt's 42-byte Python 2 answer&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/q/260302/20260&quot;&gt;Is it a plausible chess move?&lt;/a&gt; for outgolfing &lt;a href=&quot;https://codegolf.stackexchange.com/a/260316/20260&quot;&gt;xnor's&lt;/a&gt; by 7 bytes.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/a/262076/20260&quot;&gt;Albert.Lang's 73-byte Python 3 answer&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/q/262032/20260&quot;&gt;Vertices of a regular dodecahedron&lt;/a&gt; being 9 bytes shorter than &lt;a href=&quot;https://codegolf.stackexchange.com/a/262078/20260&quot;&gt;xnor's solution&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/a/262458/20260&quot;&gt;dingledooper's 124-byte Python 3 answer&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/q/262428/20260&quot;&gt;Draw the initial positions of Mölkky pins in ASCII art&lt;/a&gt; for outgolfing &lt;a href=&quot;https://codegolf.stackexchange.com/a/262457/20260&quot;&gt;xnor's solution&lt;/a&gt; by 13 bytes.&lt;/li&gt;&#xA;&lt;li&gt;To &lt;a href=&quot;https://codegolf.stackexchange.com/a/266589/20260&quot;&gt;Albert.Lang's 55-byte&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/a/266576/20260&quot;&gt;Phan Trọng Nhân's 51-byte&lt;/a&gt; Python answers on &lt;a href=&quot;https://codegolf.stackexchange.com/q/266561/20260&quot;&gt;aaabbabbc&lt;/a&gt; for outgolfing &lt;a href=&quot;https://codegolf.stackexchange.com/a/266581/20260&quot;&gt;xnor's answer&lt;/a&gt; by many bytes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2023-11-10T03:12:04.670" LastActivityDate="2023-11-10T03:12:04.670" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="18336" PostTypeId="2" ParentId="2140" CreationDate="2019-12-05T14:28:16.400" Score="1" Body="&lt;h1&gt;What's that frequency?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;This is my first code-golf challenge, so apologies if it is a little  unclear/already has been done. I gave the past challenges a good look over, but I may have missed something.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Create a function or a full program which accepts a frequency value, and then outputs the closest musical note, and the octave, this frequency corresponds to.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This function/program should support eight full octaves worth of notes, starting from C0 up to and including B8.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test cases:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;440.00 -&amp;gt; A4&#xA;466.16 -&amp;gt; A#4&#xA;466.20 -&amp;gt; A#4&#xA;261.63 -&amp;gt; C4&#xA;16.35 -&amp;gt; C0&#xA;0.00 -&amp;gt; C0&#xA;7902.13 -&amp;gt; B8&#xA;10000.00 -&amp;gt; B8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A full list of frequencies and notes they correspond to can be found here: &lt;a href=&quot;https://pages.mtu.edu/~suits/notefreqs.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://pages.mtu.edu/~suits/notefreqs.html&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a code golf, so shortest code wins!&lt;/p&gt;&#xA;" OwnerUserId="84077" LastActivityDate="2019-12-05T14:28:16.400" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18338" PostTypeId="1" AcceptedAnswerId="18339" CreationDate="2019-12-07T22:20:08.760" Score="4" ViewCount="305" Body="&lt;p&gt;I recently created a simple little language that transpiles Brainfuck into a format that is half the size of its input. It can be used to compress and decompress Brainfuck programs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Provided I include a link to the transpiler, am I allowed to use this transpiler language as a submission, or is this against the rules?&lt;/p&gt;&#xA;" OwnerUserId="83677" LastActivityDate="2019-12-07T23:16:37.193" Title="Are transpiler languages allowed?" Tags="|discussion|code-golf|languages|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18339" PostTypeId="2" ParentId="18338" CreationDate="2019-12-07T23:16:37.193" Score="12" Body="&lt;p&gt;Yes you can - you do however have to make sure that it is clear what transpiler you used as well as the interpreter/compiler of the language you transpile into you use.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastActivityDate="2019-12-07T23:16:37.193" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18340" PostTypeId="2" ParentId="2140" CreationDate="2019-12-08T02:27:56.370" Score="3" Body="&lt;h1&gt;Golfing with 2s&lt;/h1&gt;&#xA;&lt;p&gt;It is well-known that all positive integers can be represented via a sum of powers of 2. For example, &lt;code&gt;13=2^3+2^2+2^0&lt;/code&gt;. We can rewrite the 3 and 0, to get &lt;code&gt;13=2^(2+2/2)+2^2+2^(2-2)&lt;/code&gt;. A shorter representation might be &lt;code&gt;13=2^2^2-2-2/2&lt;/code&gt;, or a more repetitive one &lt;code&gt;13=2+2+2+2+2+2+2/2&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Your task is, given a nonnegative integer as input, output/return a string containing only 2s and elementary operations, which when evaluated will yield that integer. These operations are +, -, *, /, ^, and appropriate parentheses. Use of multiple consecutive 2s (22, 222, etc) is not allowed.&lt;/p&gt;&#xA;&lt;p&gt;However, the string should tend to be one of the shorter representations of the integer in question. So for the above example with 13, &lt;code&gt;2^2^2-2-2/2&lt;/code&gt; and &lt;code&gt;2^2^2-2/2-2&lt;/code&gt; are the shortest representations.&lt;/p&gt;&#xA;&lt;p&gt;The input can be in any convenient format, but the output must be in the above format, either to a file or STDIO.&lt;/p&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;p&gt;Short code and efficient representation are both prioritized, so the score is the length in bytes &lt;em&gt;plus&lt;/em&gt; the average length of the returned string for 9, 57, 554, 1894, 25993, 113193, 2998225, and 52748566.&lt;/p&gt;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; not allowed&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;Standard input/output forms&lt;/a&gt; apply&lt;/p&gt;&#xA;&lt;p&gt;Some degree of brute forcing &lt;em&gt;is&lt;/em&gt; allowed, but the program must be able to handle each of the test cases in under a minute each.&lt;/p&gt;&#xA;&lt;h3&gt;Example outputs&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;0            2-2&#xA;1            2/2&#xA;2            2&#xA;3            2+2/2&#xA;4            2^2&#xA;5            2^2+2/2&#xA;6            2^2+2&#xA;7            2^2+2+2/2&#xA;8            2*2*2&#xA;9            2*2*2+2/2&#xA;10           2*2*2+2&#xA;57           2^(2^2+2)-2^2-2-2/2&#xA;554          2*2^(2*2*2)+2*2^2^2+2*2*2+2&#xA;1894         2*2^(2*2*2+2)-(2^2^2-2)*(2*2*2+2+2/2)&#xA;25993        (2*2^(2*2*2+2)-2*2^(2*2*2)-2^2-2-2/2)*(2^2^2+2/2)&#xA;113193       2*2^2^2^2-(2^(2*2*2+2)-2^(2^2+2)-2^2^2-2-2/2)*(2^2^2+2+2/2)&#xA;2998225      (2*2^2^2^2-(2^(2*2*2+2)-2*2*2-2-2/2)*(2*2*2+2+2/2))*(2^2^2+2*2*2+2/2)&#xA;52748566     (2*2^(2^2^2+2^2)-2^2^2^2-2*2^(2*2*2+2)-2*2^(2*2*2)-2^(2*2*2)-2*2*2-2/2)*(2^2^2-2-2/2)*2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="89774" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-12-18T04:19:59.567" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="18344" PostTypeId="1" CreationDate="2019-12-09T00:31:46.987" Score="10" ViewCount="193" Body="&lt;p&gt;After &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18256/popularity-of-questions-based-on-post-time-and-the-most-useless-graph-ever&quot;&gt;this question&lt;/a&gt;, I became interested in looking for various relationships in post popularity. While reading through the HNQ list, I noticed that some questions are capitalized in title case, and others written like sentences. So, I used a &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/edit/1164278&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE query&lt;/a&gt; to get a table of question data, and started analyzing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From a list of 11066 questions, 10937 started with a letter (once &lt;code&gt;'&quot;`([{&lt;/code&gt; are filtered out). These were divided into six groups, based on the case of the first letters of the words.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Average Post:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Mean Votes: 18.741&lt;/li&gt;&#xA;&lt;li&gt;Mean Views: 2444.953&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;One Word: Lowercase:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are only 8 of these. Statistically, they tend to do worse than average. Note that my program only counted spaces as word boundaries.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Posts: 0.073%&lt;/li&gt;&#xA;&lt;li&gt;Mean Votes: 15.5&lt;/li&gt;&#xA;&lt;li&gt;Mean Views: 1767.375&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;One Word: Uppercase:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;These tend to do better, although there are only 34 of them.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Posts: 0.311%&lt;/li&gt;&#xA;&lt;li&gt;Mean Votes: 25.971&lt;/li&gt;&#xA;&lt;li&gt;Mean Views: 2509.735&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;All Lowercase:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All-lowercase titles tend to score lower, potentially because they tend to be lower-effort questions.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Posts: 0.91%&lt;/li&gt;&#xA;&lt;li&gt;Mean Votes: 7.697&lt;/li&gt;&#xA;&lt;li&gt;Mean Views: 1465.273&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Title Case:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Title case is slightly uglier to me, although the votes seem to indicate that title case questions do better than average.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Posts: 19.32%&lt;/li&gt;&#xA;&lt;li&gt;Mean Votes: 19.359&lt;/li&gt;&#xA;&lt;li&gt;Mean Views: 2056.176&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;First Word Lowercase:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There are but 30 questions which don't begin with a capitalized word, but have one later on. They tend to do worse than average.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Posts: 0.274%&lt;/li&gt;&#xA;&lt;li&gt;Mean Votes: 15.567&lt;/li&gt;&#xA;&lt;li&gt;Mean Views: 1974.667&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;First Word Uppercase:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This category is all non-title-case posts which begin with a capitalized word (and are more than one word in length). This category gets more average views than title case, but less average votes. Odd.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Posts: 79.025%&lt;/li&gt;&#xA;&lt;li&gt;Mean Votes: 18.708&lt;/li&gt;&#xA;&lt;li&gt;Mean Views: 2553.225&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;These results are probably 99% caused by outliers, but still interesting. We can take away some important points from them:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If you want a post to be popular, capitalizing the first word increases the average number of views by 64%&lt;/li&gt;&#xA;&lt;li&gt;Over 98% of question titles are either title case or sentence case&lt;/li&gt;&#xA;&lt;li&gt;Only 42 questions are one word in length&lt;/li&gt;&#xA;&lt;li&gt;This was not a productive use of my time&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="66833" LastEditDate="2021-06-29T00:55:10.453" LastActivityDate="2021-06-29T00:55:10.453" Title="Popularity of posts, based on capitalization (no graphs this time)" Tags="|discussion|statistics|titles|" AnswerCount="0" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="18345" PostTypeId="2" ParentId="2140" CreationDate="2019-12-09T05:56:50.753" Score="1" Body="&lt;p&gt;Challenge posted to Main &lt;a href=&quot;https://codegolf.stackexchange.com/questions/196872/smallest-fibonacci-multiples&quot;&gt;here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="82007" LastEditorUserId="82007" LastEditDate="2019-12-10T22:42:59.790" LastActivityDate="2019-12-10T22:42:59.790" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="18346" PostTypeId="2" ParentId="2140" CreationDate="2019-12-09T22:45:04.013" Score="1" Body="&lt;h1&gt;Union of Two Polygons&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given two intersecting polygons as input, output a third polygon that is the union of the two input polygons, that is to say, the perimeter that encloses all points present in at least one of the two input polygons.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/XeZx8.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/XeZx8.png&quot; alt=&quot;Example polygon unions&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Example inputs/outputs&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;2 Squares&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  [(0, 0), (0, 2), (2, 2), (2, 0)]&#xA;| [(1, 1), (1, 3), (3, 3), (3, 1)]&#xA;==&amp;gt; [(0, 0), (0, 2), (1, 2), (1, 3), (3, 3), (3, 1), (2, 1), (2, 0)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;... more to come&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Notes and Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input will be two lists of at least 3 2d points each, taken in any convenient format.&lt;/li&gt;&#xA;&lt;li&gt;Output should be a list of 2d points, in any convenient format.&lt;/li&gt;&#xA;&lt;li&gt;It does not matter which point you list first.&lt;/li&gt;&#xA;&lt;li&gt;It does not matter whether you output in clockwise or counterclockwise order.&lt;/li&gt;&#xA;&lt;li&gt;Polygons may be concave&lt;/li&gt;&#xA;&lt;li&gt;You may assume that both polygons are not self-intersecting&lt;/li&gt;&#xA;&lt;li&gt;You may assume that the polygons overlap in at least two places exclusively via edge-edge crossings rather than vertex-edge intersections, vertex-vertex intersections, or flush edge-edge overlaps.&lt;/li&gt;&#xA;&lt;li&gt;You may assume that the polygons do not overlap in such a way that the union would have at least one hole in it.&lt;/li&gt;&#xA;&lt;li&gt;You must be accurate to at least 0.01 for all polygons between -100 and 100 units along each axis.&lt;/li&gt;&#xA;&lt;li&gt;Standard rules apply. Shortest code wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2019-12-13T22:49:04.183" LastActivityDate="2019-12-13T22:49:04.183" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18347" PostTypeId="2" ParentId="2140" CreationDate="2019-12-09T23:53:47.677" Score="1" Body="&lt;h1&gt;Sort By the New Alphabet&lt;/h1&gt;&#xA;&lt;p&gt;The order of the alphabet is really quite arbitrary. I propose a new ordering of the alphabet, ordered so that adjacent letters (in capital form) are similar in shape. Here is the order:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;JUOQGCDPRBEFTILVYXKHAMWNZS&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Of course, this makes a lot of previously written code redundant. To fix this problem we will start re-implementing that code, in its updated form.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to create a program or function that takes a string or list of characters as input, and outputs that string/list sorted according to this new ordering.&lt;/p&gt;&#xA;&lt;p&gt;You can assume that all input will contain only uppercase alphabetic characters.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I know it's similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/38532/sort-by-custom-alphabet&quot;&gt;this&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/165484/sort-a-string-by-a-given-ordering&quot;&gt;this&lt;/a&gt;, but this challenge has a fixed ordering, so I hope this allows for some more ingenuity as well as the requirement to store the ordering efficiently.&lt;/p&gt;&#xA;" OwnerUserId="87728" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-12-09T23:53:47.677" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18351" PostTypeId="2" ParentId="2140" CreationDate="2019-12-11T11:47:16.167" Score="0" Body="&lt;h1&gt;Rate your brevity&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This challenge is to produce a script that will accept a string as input, and generate a score for it using the rules defined below. Your score is the return value of your program given its own source as input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The first scoring system&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each additional unique character has an escalating penalty to your score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first unique character is worth &lt;code&gt;-1&lt;/code&gt;&lt;br&gt;&#xA;The second unique character is worth &lt;code&gt;-2&lt;/code&gt;&lt;br&gt;&#xA;The third unique character is worth &lt;code&gt;-3&lt;/code&gt;&lt;br&gt;&#xA;etc...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The second scoring system&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each repetition of a given character incurs a further escalating penalty to your score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first usage of a given character incurs no additional penalty&lt;br&gt;&#xA;The second usage of a given character incurs an additional penalty of &lt;code&gt;-1&lt;/code&gt;&lt;br&gt;&#xA;The third usage of a given character incurs an additional penalty of &lt;code&gt;-2&lt;/code&gt;&lt;br&gt;&#xA;The fourth usage of a given character incurs an additional penalty of &lt;code&gt;-3&lt;/code&gt;&lt;br&gt;&#xA;etc...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;e.g.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The code &lt;code&gt;abc&lt;/code&gt; would have a score of &lt;code&gt;-6&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The code &lt;code&gt;aabc&lt;/code&gt; would have a score of &lt;code&gt;-7&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The code &lt;code&gt;aaaabc&lt;/code&gt; would have a score of &lt;code&gt;-12&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your score starts at &lt;code&gt;0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The highest score for a given language wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The below Stack snippet will parse a string according to the rules defined above and generate the score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;function testScore() {&#xA;  var score = 0,&#xA;      counter = 0,&#xA;      input = document.getElementById('code').value,&#xA;      x,&#xA;      y,&#xA;      instances = {},&#xA;      keys;&#xA;    &#xA;  input = input.split('');&#xA;&#xA;  for(x = 0; x &amp;lt; input.length; x++) {&#xA;    if(typeof instances[input[x]] == 'undefined') {&#xA;      instances[input[x]] = 0;&#xA;      score -= ++counter;&#xA;    }&#xA;    &#xA;    instances[input[x]]++;&#xA;  }&#xA;&#xA;  keys = Object.keys(instances);&#xA;  for(x = 0; x &amp;lt; keys.length; x++) {&#xA;    for(y = 0; y &amp;lt; instances[keys[x]]; y++) {&#xA;      score -= y;&#xA;    }&#xA;  }&#xA;&#xA;  alert('Your score is:\n' + String(score));&#xA;  &#xA;  return false;&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;form onsubmit=&quot;return testScore(this);&quot;&amp;gt;&#xA;  &amp;lt;div&amp;gt;&#xA;    &amp;lt;textarea id=&quot;code&quot; style=&quot;width: 100%; height: 150px;&quot;&amp;gt;&amp;lt;/textarea&amp;gt;&#xA;  &amp;lt;/div&amp;gt;&#xA;  &amp;lt;div&amp;gt;&#xA;    &amp;lt;button type=&quot;submit&quot;&amp;gt;Generate score&amp;lt;/button&amp;gt;&#xA;  &amp;lt;/div&amp;gt;&#xA;&amp;lt;/form&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="78427" LastEditorUserId="78427" LastEditDate="2019-12-14T11:31:39.617" LastActivityDate="2019-12-14T11:31:39.617" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18352" PostTypeId="2" ParentId="2140" CreationDate="2019-12-11T13:35:59.750" Score="1" Body="&lt;h1&gt;Expand a road network&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;You've been employed as a city planner &lt;sub&gt;&lt;a href=&quot;https://youtu.be/3DayjracBf8&quot; rel=&quot;nofollow noreferrer&quot;&gt;(obligatory seinfeld clip)&lt;/a&gt;&lt;/sub&gt; and you have been tasked with expanding the road system of Codegolfville. Here's a diagram of what Codegolfville could look like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;        | |&#xA;        | |&#xA;--------+ +-------&#xA;--------+ +-------&#xA;        | |&#xA;        | +-------&#xA;        | +-------&#xA;        | |&#xA;        | |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your job is to expand the existing infrastructure &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; blocks in a specific direction.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Take two inputs - a direction to expand in, and the number of blocks to expand - through any reasonable input format.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Expand the existing roadways in the ASCII map, in the direction specified.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;a. You must take into account the existing roadways - you can only expand on roads that are already there, and if there are no roads to expand, you won't expand anything.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;b. Your program must work for any example map, not just the one provided above.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Show the output on STDOUT, if your language supports it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&lt;em&gt;will be done soon&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Other Rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so lowest score in bytes wins. Standard loopholes are forbidden. Have fun!&lt;/p&gt;&#xA;" OwnerUserId="83677" LastActivityDate="2019-12-11T13:35:59.750" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18353" PostTypeId="2" ParentId="2140" CreationDate="2019-12-13T03:28:15.437" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/197080/hexagonify-a-string-block&quot;&gt;Hexagonify™ a String Block&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="71546" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-12-15T03:41:29.240" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18354" PostTypeId="2" ParentId="2140" CreationDate="2019-12-13T20:34:08.343" Score="-2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; rel=&quot;tag&quot;&gt;compression&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;As programming languages &lt;s&gt;reproduce&lt;/s&gt; are created, documentation is even more important for programmers. Your task is simple: output the esolangs.org documentation for your programming language.&lt;/p&gt;&#xA;&lt;p&gt;With wikis being wikis, languages are heavily penalized in this challenge for being used often and for being interesting to write about, the goal here is to draw attention to languages that may not get utilized otherwise.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;For this task, you will need to output the source for the article on esolangs.org for your language, with &lt;em&gt;greater than or equal to 95% accuracy&lt;/em&gt;. Your score is your program length in bytes, as in other challenges.&lt;/p&gt;&#xA;&lt;p&gt;Languages not on &lt;a href=&quot;https://esolangs.org/wiki/Category:Languages&quot; rel=&quot;nofollow noreferrer&quot;&gt;this multi-page list of languages&lt;/a&gt; as of the time of this posting are ineligible.&lt;/p&gt;&#xA;&lt;p&gt;Standard loopholes are forbidden.&lt;/p&gt;&#xA;&lt;h2&gt;Inputs&lt;/h2&gt;&#xA;&lt;p&gt;None&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;The source (as of this challenge being posted), for the esolangs wiki page for your language, with at least 95% accuracy.&lt;/p&gt;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Language: ///&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;{{featured language}}&lt;br /&gt;&#xA;'''///''' (pronounced &amp;quot;slashes&amp;quot;) is a minimalist [[Turing-complete]] esoteric programming language, invented by Tanner Swett ([[User:Ihope127]]) in 2006 based on [[wikipedia:sed|the &amp;quot;s/foo/bar/&amp;quot; notation that everybody seemed to be using in IRC]]. The only operation is repeated string substitution, using the syntax &amp;lt;code&amp;gt;/''pattern''/''replacement''/&amp;lt;/code&amp;gt;. Despite its extreme simplicity – there isn't even an obvious way to create a loop – it was proved [[Turing-complete]] by [[Ørjan Johansen]] in 2009, who created [[#Bitwise Cyclic Tag interpreter|an interpreter]] for the Turing-complete language [[Bitwise Cyclic Tag]].&lt;br /&gt;&#xA;...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="75797" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-12-13T20:34:08.343" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18355" PostTypeId="2" ParentId="2140" CreationDate="2019-12-13T21:12:26.573" Score="4" Body="&lt;h1&gt;Is it a Snake Cube?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Snake_cube&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;snake cube&lt;/em&gt;&lt;/a&gt; is a quite popular wooden puzzle. There are usually 27 cubes threaded on an elastic string. Each cube has a hole that either goes straight through from one face to the opposite face, or that makes a 90° bend, that means it exits through a face that is adjecent to the one it enters. (And the two end cubes into which this string enters. Two adjecent cubes on that string can rotate against eachother. The goal is rotating them all such that the whole &quot;snake&quot; forms a large 3x3x3 cube.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/GVR8S.jpg&quot; width=&quot;300&quot; /&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/Gns6E.jpg&quot; width=&quot;300&quot; /&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;&lt;sup&gt;Images from Wikipedia &lt;a href=&quot;https://en.wikipedia.org/wiki/File:Snakecube_1.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;(1)&lt;/a&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/File:Snakecube_2.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;(2)&lt;/a&gt;&lt;/sup&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Obviously we cannot have any random sequence of the straight/90° pieces if we want to get a cube in the end. This leads us to the&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given a sequence of the types of the inner 25 cubes of a &quot;snake&quot;, determine whether it is possible to form a cube.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I will here use the symbol &lt;strong&gt;T&lt;/strong&gt; for a piece with a straight hole, and &lt;strong&gt;F&lt;/strong&gt; for a piece with a 90° hole. The example in the image would be encoded (from the bottom left to the top right) as&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;TFFFTFFTFFFTFTFFFFTFTFTFT&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can take the input as a string or list/array or any other type of sequence.&lt;/li&gt;&#xA;&lt;li&gt;You can use different symbols for the two types, you could also take booleans or integers.&lt;/li&gt;&#xA;&lt;li&gt;The output is also flexible: You're can have two distinct output, one for each case, but they must be consistent. If it is not obvious (e.g. True/False) please specify which one means what.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;No cube possible:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;TFTFTFTFTFTFTFTFFTFFFTFFF (we have 8 consecutive (overlapping) straight runs of length 3)&#xA;TFTFTFTFFFFTFTFFFTFFTFFTT (we have a straight run of four pieces at the end)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Cube possible:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;TFFFTFFTFFFTFTFFFFTFTFTFT&#xA;TFTFTFTFFFFTFTFFFTFFTFFFT&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="24877" LastActivityDate="2019-12-13T21:12:26.573" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18357" PostTypeId="2" ParentId="2140" CreationDate="2019-12-15T07:54:42.187" Score="1" Body="&lt;h2&gt;Make an &quot;implicit&quot; parser &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this task, given an infix expression, fill in all of the implicit inputs &lt;em&gt;and&lt;/em&gt; evaluate this expression with the other given input. (You only need to deal with (&lt;code&gt;+&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;, and &lt;code&gt;()&lt;/code&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Expressions are only allowed to be dyadic and not monadic. If an operator is monadic, prepend an input.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What do I do?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The rule is simple: if something is preceded with a nilad or a parenthesized expression, it is a dyad.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;+&lt;/code&gt; is a dyad here:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2 + 1&#xA;(5 + 2)&#xA;3 + ((2) + 4)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Otherwise, the operator is a monad.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;+&lt;/code&gt; is a monad here:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; +(2 - 2)&#xA;(+ 2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If you find a monad in your code, immediately prepend it with the &lt;code&gt;a&lt;/code&gt; character.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a +(2 - 2)&#xA;(a+ 2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;That's about it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input expression is guaranteed to not produce errors, such as the format &lt;code&gt;2-&lt;/code&gt; which is impossible to prepend an input.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;+++a&quot;,2 -&amp;gt; a+a+a+a = 2+2+2+2 = 8&#xA;&quot;(+1)+(-1)&quot;,5 -&amp;gt; (a+1)+(a-1) = (5+1)+(5-1) = 10&#xA;&quot;+(2-a)&quot;, 3 -&amp;gt; a+(2-a) = 3+(2-3) = 2&#xA;&quot;(5+2)+2+1&quot;, 7 -&amp;gt; (5+2)+2+1 = 10&#xA;&quot;--2&quot;, 2 -&amp;gt; a-a-2 = 0-2 = -2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code wins.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are disallowed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-12-15T11:40:12.377" LastActivityDate="2019-12-15T11:40:12.377" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18359" PostTypeId="2" ParentId="2140" CreationDate="2019-12-16T01:30:50.287" Score="0" Body="&lt;h1&gt;Nash equilibrium of 2-player 3-choice zero-sum game &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;game-theory&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In a 2-player single finite game, a &lt;a href=&quot;https://en.wikipedia.org/wiki/Nash_equilibrium&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Nash equilibrium&lt;/strong&gt;&lt;/a&gt; (NE) is a pair of strategies chosen by both players where neither has an incentive to deviate from their own strategy. For example, here is a &lt;a href=&quot;https://en.wikipedia.org/wiki/Normal-form_game&quot; rel=&quot;nofollow noreferrer&quot;&gt;payoff matrix&lt;/a&gt; of two players &lt;span class=&quot;math-container&quot;&gt;\$ A,B \$&lt;/span&gt; where each player has two possible pure strategies &lt;span class=&quot;math-container&quot;&gt;\$ X,Y \$&lt;/span&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\matrix{&#xA;A \backslash B &amp;amp; X &amp;amp; Y \\&#xA;X &amp;amp; 3 \backslash 3 &amp;amp; 0 \backslash 0 \\&#xA;Y &amp;amp; 0 \backslash 0 &amp;amp; 2 \backslash 2&#xA;}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this game, if &lt;span class=&quot;math-container&quot;&gt;\$ A \$&lt;/span&gt; chooses &lt;span class=&quot;math-container&quot;&gt;\$ X \$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$ B \$&lt;/span&gt; should also choose &lt;span class=&quot;math-container&quot;&gt;\$ X \$&lt;/span&gt; because it will give &lt;span class=&quot;math-container&quot;&gt;\$ B \$&lt;/span&gt; the best outcome. Likewise, if &lt;span class=&quot;math-container&quot;&gt;\$ B \$&lt;/span&gt; chooses &lt;span class=&quot;math-container&quot;&gt;\$ X \$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$ A \$&lt;/span&gt; should also choose &lt;span class=&quot;math-container&quot;&gt;\$ X \$&lt;/span&gt;. Therefore, &lt;span class=&quot;math-container&quot;&gt;\$ (X,X) \$&lt;/span&gt; is a NE. We can observe &lt;span class=&quot;math-container&quot;&gt;\$ (Y,Y) \$&lt;/span&gt; is also a NE; although it gives less outcome than &lt;span class=&quot;math-container&quot;&gt;\$ (X,X) \$&lt;/span&gt; for both players, there is no reason to select &lt;span class=&quot;math-container&quot;&gt;\$ X \$&lt;/span&gt; when the opponent selects &lt;span class=&quot;math-container&quot;&gt;\$ Y \$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But a strategy can also be a mixed strategy, i.e. choosing one of the pure strategies with some chance. Let's take a mixed strategy &lt;span class=&quot;math-container&quot;&gt;\$ S = \frac25X+\frac35Y \$&lt;/span&gt;. If &lt;span class=&quot;math-container&quot;&gt;\$ A \$&lt;/span&gt; takes &lt;span class=&quot;math-container&quot;&gt;\$ S \$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$ B \$&lt;/span&gt;'s &lt;em&gt;expected outcome&lt;/em&gt; is always &lt;span class=&quot;math-container&quot;&gt;\$ \frac65 \$&lt;/span&gt;, regardless of &lt;span class=&quot;math-container&quot;&gt;\$ B \$&lt;/span&gt;'s strategy (either pure or mixed). In this case, &lt;span class=&quot;math-container&quot;&gt;\$ B \$&lt;/span&gt; has zero incentive to deviate from whatever strategy &lt;span class=&quot;math-container&quot;&gt;\$ B \$&lt;/span&gt; is already taking. The same can be said for &lt;span class=&quot;math-container&quot;&gt;\$ B \$&lt;/span&gt; taking &lt;span class=&quot;math-container&quot;&gt;\$ S \$&lt;/span&gt;, so &lt;span class=&quot;math-container&quot;&gt;\$ (S, S) \$&lt;/span&gt; is also a NE.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Nash_equilibrium#Nash&amp;#39;s_Existence_Theorem&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Nash's existence theorem&lt;/strong&gt;&lt;/a&gt; states that every game has at least one Nash equilibrium, either pure or mixed. Note that a game may have many (possibly infinitely many) NEs.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this challenge, we consider &lt;strong&gt;2-player 3-choice zero-sum games&lt;/strong&gt;, where each player has three possible pure strategies, and the sum of the two players' outcomes is always zero. The payoff matrix of such a game might look like this:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\matrix{&#xA;A \backslash B &amp;amp; R &amp;amp; P &amp;amp; S \\&#xA;R &amp;amp; 0 \backslash 0 &amp;amp; -1 \backslash 1 &amp;amp; 1 \backslash -1 \\&#xA;P &amp;amp; 1 \backslash -1 &amp;amp; 0 \backslash 0 &amp;amp; -1 \backslash 1 \\&#xA;S &amp;amp; -1 \backslash 1 &amp;amp; 1 \backslash -1 &amp;amp; 0 \backslash 0&#xA;}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since it is a zero-sum game, we can omit the payoffs of &lt;span class=&quot;math-container&quot;&gt;\$ B \$&lt;/span&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\matrix{&#xA;A &amp;amp; R &amp;amp; P &amp;amp; S \\&#xA;R &amp;amp; 0 &amp;amp; -1 &amp;amp; 1 \\&#xA;P &amp;amp; 1 &amp;amp; 0 &amp;amp; -1 \\&#xA;S &amp;amp; -1 &amp;amp; 1 &amp;amp; 0&#xA;}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This game is equivalent to Rock-Paper-Scissors, and the only NE is, as we all know, mixed &lt;span class=&quot;math-container&quot;&gt;\$ (\frac13R + \frac13P + \frac13S,\frac13R + \frac13P + \frac13S) \$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is to &lt;strong&gt;find at least one of the Nash equilibria, given the payoff matrix for player&lt;/strong&gt; &lt;span class=&quot;math-container&quot;&gt;\$ A \$&lt;/span&gt;. Remember that a Nash equilibrium is a pair of &lt;span class=&quot;math-container&quot;&gt;\$ (\text{strategy of } A,\text{strategy of } B) \$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For an outline of finding a mixed-strategy NE, refer to &lt;a href=&quot;https://math.stackexchange.com/questions/564233/how-to-compute-all-nash-equilibria-in-an-example-of-a-3x3-matrix&quot;&gt;this Math.SE question&lt;/a&gt;. Also related: &lt;a href=&quot;https://math.stackexchange.com/questions/1113455/calculating-nash-equilibrium-in-mixed-strategy-in-a-game-where-a-nash-equilibriu?rq=1&quot;&gt;why some games don't have mixed-strategy NE&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input and output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input is a 3-by-3 matrix of integers which represent the payoff matrix for player &lt;span class=&quot;math-container&quot;&gt;\$ A \$&lt;/span&gt;. You can assume the magnitude of each integer won't exceed 100, and you can take the numbers in any order of your choice.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output is a pair of strategies in the form of &lt;span class=&quot;math-container&quot;&gt;\$ (a_XX+a_YY+a_ZZ, b_XX+b_YY+b_ZZ) \$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$ a_i \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$ b_i \$&lt;/span&gt; are the chances of selecting one of the strategies. You don't need to format the output; outputting the 6 numbers &lt;span class=&quot;math-container&quot;&gt;\$ a_X,a_Y,a_Z,b_X,b_Y,b_Z \$&lt;/span&gt; is fine. If you want to output a pure strategy, you can do something like &lt;span class=&quot;math-container&quot;&gt;\$ (1, 0, 0) \$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring and winning criterion&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply. The shortest code in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Matrix: (classic RPS)&#xA;  0  -1   1&#xA;  1   0  -1&#xA; -1   1   0&#xA;NE: A's strategy = (1/3, 1/3, 1/3), B's strategy = (1/3, 1/3, 1/3)&#xA;--------------------------------------&#xA;Matrix: (scored RPS)&#xA;  0  -5   1&#xA;  5   0  -2&#xA; -1   2   0&#xA;NE: A's strategy = (2/8, 1/8, 5/8), B's strategy = (2/8, 1/8, 5/8)&#xA;--------------------------------------&#xA;Matrix: (dumb game, pure strategy NE example)&#xA;  0   1   2&#xA; -1   0   0&#xA; -2   0   0&#xA;NE: A's strategy = (1, 0, 0), B's strategy = (1, 0, 0)&#xA;--------------------------------------&#xA;Matrix: (asymmetric game example, infinitely many NEs)&#xA;  2  -1   3&#xA;  0   3  -1&#xA; -2  -3   0&#xA;NE: A's strategy = (1/2, 1/2, 0),&#xA;    B's strategy = any triple (x, y, z) that satisfies&#xA;                   x + 2z = 2y, x + y + z = 1, 0 &amp;lt;= x,y,z &amp;lt;= 1&#xA;--------------------------------------&#xA;Matrix: (asymmetric game example, one mixed NE)&#xA;  2  -1   4&#xA;  0   3  -1&#xA; -2  -3   0&#xA;NE: A's strategy = (1/2, 1/2, 0), B's strategy = (2/3, 1/3, 0)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the challenge clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Can anyone confirm the test cases are correct?&lt;/li&gt;&#xA;&lt;li&gt;Actually, calculating a NE involves a lot of subtleties, e.g. &lt;a href=&quot;https://en.wikipedia.org/wiki/Strategic_dominance&quot; rel=&quot;nofollow noreferrer&quot;&gt;strict dominance elimination&lt;/a&gt; and &lt;a href=&quot;https://math.stackexchange.com/q/72341&quot;&gt;mixed NEs for a game with unequal number of strategies&lt;/a&gt;. Should I include these in the post?&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;game-theory&lt;/a&gt; is not yet an existing tag. Is it appropriate to create one? Are there any other suitable tag(s)?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2019-12-16T06:06:05.253" LastActivityDate="2019-12-16T06:06:05.253" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18362" PostTypeId="2" ParentId="2140" CreationDate="2019-12-16T13:32:19.303" Score="1" Body="&lt;h1&gt;Blackjack&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is kept fairly simple, compared to a real Blackjack-Game:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Write a program that creates a blackjack game, where the input &quot;h&quot; means &quot;hit&quot; and &quot;s&quot; means &quot;stand&quot;. Everything else outputs nothing, it just waits for the right input.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Rules:&#xA;- You can draw as many cards as you want, also to make it easier, there is no card limit.&#xA;  This means you could draw more than 4 Asses.&#xA;- The cards you can get are&#xA;  standard-cards (2-10, J, Q, K, A) where the Values are the default ones:&#xA;&#xA;2-9 = 2-9,&#xA;10, J, Q, K = 10&#xA;&#xA;- A is a special card. So to make it easy, the default value is 11.&#xA;  If a player gets over 21, the value gets reduced to 1.&#xA;  In the case that a player has two or more A-Cards, all but one A&#xA;  reduces to 1, giving a total value of 14 for 4 Asses. (11+1+1+1)&#xA;&#xA;- The dealer needs to get in between 18-21. If the bank has reached a value in &#xA;this radius,&#xA;it can't draw another card (For example: Bank reached 18.&#xA;                          It can't get another card to get closer to 21)&#xA;&#xA;- The game runs forever&#xA;- hit means „draw another card“, stand means „stop with cards and wait for &#xA;the dealer to reach his limit“&#xA;&#xA;Procedure:&#xA;&#xA;- The player gets 2 cards at the beginning, shown by &quot;Player:&quot; in the console &#xA;  (Example: Player gets 2 and 5 at the beginning. &#xA;  Console output: &quot;Player: 2, 5&quot;).&#xA;&#xA;- The cards can be shown in the console by their values&#xA;  (For example: 2, 10, 1 | No need for: 2, K, A), but you can also use &#xA;  the card-names instead. Your choice. But you need to show the maximum&#xA;  value you have&#xA;  (for example:&#xA;  first draw console output &quot;Player: 2, 4, 5 = 11&quot;,&#xA;  second draw console output &quot;Player: 2, 4, 5, 7 = 18&quot;)&#xA;&#xA;- The input by the player is &quot;h&quot; for &quot;hit&quot; and &quot;s&quot; for &quot;stand&quot;. Also allowed &#xA;  is 1 and 0&#xA;&#xA;- In the console, the player is displayed by &quot;Player:&quot;&#xA;- In the console, the dealer is displayed by &quot;Dealer:&quot;&#xA;&#xA;- After the player got two cards, the dealer gets one card.&#xA;  Then the player can hit or stand.&#xA;  After every card drawn from the player,&#xA;  the dealer gets another card until he reaches his limit. (18-21)&#xA;&#xA;  If the dealer reaches 21 before the player does, the dealer wins.&#xA;  If the Player reaches 21 first, the player wins.&#xA;  If the dealer reached his limit, and the player stands on the same value, it's a draw.&#xA;  If the dealer is over 21 first, the player wins.&#xA;  If the player is over 21 first, the dealer wins.&#xA;&#xA;- At the end you get the output &quot;Win&quot;, &quot;Lose&quot;, &quot;Draw&quot;,&#xA;  or &quot;Blackjack&quot;, depending on the game&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This game is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, even the smallest result won'tbe under 150 bytes at least&lt;/p&gt;&#xA;" OwnerUserId="90898" LastEditorUserId="90898" LastEditDate="2019-12-17T05:47:53.803" LastActivityDate="2019-12-17T05:47:53.803" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18363" PostTypeId="2" ParentId="2140" CreationDate="2019-12-16T14:08:47.710" Score="1" Body="&lt;h1&gt;Asyncronous Breakfast&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I haven't seen any asyncronous challenges here, even tho it's an important part of coding, so here's my idea, based on an example (&lt;a href=&quot;https://docs.microsoft.com/en-us/dotnet/csharp/programming-guide/concepts/async/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://docs.microsoft.com/en-us/dotnet/csharp/programming-guide/concepts/async/&lt;/a&gt;) that explains asyncronous coding:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;You are making breakfast. The things you want to serve are:&#xA;Cooked eggs, Bacon, Coffee, Orange Juice and Toast.&#xA;&#xA;You start boiling the eggs, cooking the bacon, making coffee, and toasting toast. &#xA;When everything is finished, you're serving the orange juice.&#xA;&#xA;After every finished food, the console outputs &quot;[Food] is ready.&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="90898" LastActivityDate="2019-12-16T14:08:47.710" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18364" PostTypeId="2" ParentId="2140" CreationDate="2019-12-17T06:36:26.490" Score="0" Body="&lt;h1&gt;Bunda-Gerth parser for abstract APL-family language &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/apl&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;apl&amp;#39;&quot; rel=&quot;tag&quot;&gt;apl&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;APL has four kinds of tokens: arrays, functions, monadic operators (mops) and dyadic operators (dops).&lt;sup&gt;1)&lt;/sup&gt; Let's denote them &lt;strong&gt;A&lt;/strong&gt; (arrays), &lt;strong&gt;F&lt;/strong&gt; (functions), &lt;strong&gt;M&lt;/strong&gt; (mops), and &lt;strong&gt;D&lt;/strong&gt; (dops) respectively. Usually when programming in APL, we use a mental model like this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Strand notation: &lt;code&gt;A A ... A -&amp;gt; A&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Monadic function application: &lt;code&gt;F A -&amp;gt; A&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Dyadic function application: &lt;code&gt;A F A -&amp;gt; A&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Mop with left operand: &lt;code&gt;(A|F) M -&amp;gt; F&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Dop with both operands: &lt;code&gt;(A|F) D (A|F) -&amp;gt; F&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Mops and dops bind first from left to right (producing functions), and then function applications are evaluated from right to left&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;But J.D.Bunda and J.A.Gerth proposed &lt;a href=&quot;https://dfns.dyalog.com/n_parse.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;another way to parse APL expressions&lt;/a&gt;. In this method, each (ordered) pair of tokens is assigned a &lt;em&gt;binding strength&lt;/em&gt; and a &lt;em&gt;resulting token&lt;/em&gt;. Below is the translation of the above mental model. Note that some token pairs do not bind at all, and we have a new token type &lt;strong&gt;AF&lt;/strong&gt;, which stands for a function with bound left argument.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Binding strength | Token pair(s) -&amp;gt; result&#xA;--------------------------------------------&#xA;               5 | A A -&amp;gt; A        # Strand notation&#xA;               4 | D (A|F) -&amp;gt; M    # Dop + Right operand -&amp;gt; Mop&#xA;               3 | (A|F) M -&amp;gt; F    # Left operand + Mop  -&amp;gt; Function&#xA;               2 | A F -&amp;gt; AF       # Array + Function    -&amp;gt; Left-bound function&#xA;               1 | (F|AF) A -&amp;gt; A   # Function + Array    -&amp;gt; Array&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then the actual parsing proceeds as follows: given a stream of tokens,&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Evaluate the binding strengths between adjacent tokens.&lt;/li&gt;&#xA;&lt;li&gt;Select the token pair whose binding strength is the rightmost local &quot;peak&quot;, i.e. the &lt;code&gt;x y&lt;/code&gt; pair in &lt;code&gt;w x y z&lt;/code&gt; satisfying &lt;code&gt;wx &amp;lt; xy &amp;gt;= yz&lt;/code&gt;. &lt;code&gt;w&lt;/code&gt; and/or &lt;code&gt;z&lt;/code&gt; can be empty. Note that the leftmost pair is bound first in &lt;code&gt;A A ... A&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Group the pair and produce a new token as specified in the transition table.&lt;/li&gt;&#xA;&lt;li&gt;Repeat from 1 until single token is left (successful parse) or no more reduction is possible (syntax error).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a list of tokens, output the &lt;strong&gt;order of binding&lt;/strong&gt; (refer to the I/O section for specification) using the transition table and algorithm described above.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input and output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input is a non-empty list of A/F/M/D tokens. You may use any number or single character to represent a token. You may assume that the input will always parse successfully, and the input won't contain any parentheses (since it isn't specified in the table above).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the output, the &lt;strong&gt;order of binding&lt;/strong&gt; represents in which order each gap between the tokens is closed:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Given the tokens:       A A F M A&#xA;Assign each gap an ID:   w x y z&#xA;Binding strength:        5 2 3 0&#xA;Rightmost local peak:       F M&#xA;Bind them first:        A A (F M) A     -&amp;gt; y = 1&#xA;Bind A-A next:         (A A) (F M) A    -&amp;gt; w = 2&#xA;Bind A-F next:        ((A A) (F M)) A   -&amp;gt; x = 3&#xA;Bind AF-A last:      (((A A) (F M)) A)  -&amp;gt; z = 4&#xA;&#xA;Given the tokens:       A A F M A&#xA;The order of binding:    2 3 1 4  (the answer)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that, if the input contains &lt;code&gt;L&lt;/code&gt; tokens, the answer is always a permutation of &lt;code&gt;1..L-1&lt;/code&gt; (or &lt;code&gt;0..L-2&lt;/code&gt; if you choose zero-based numbering).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring and winning criterion&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply. The shortest code in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:  A A A A A&#xA;Output:  1 2 3 4&#xA;-----------------------------&#xA;Input:  A F F A A F F A&#xA;Output:  6 7 5 2 3 4 1&#xA;-----------------------------&#xA;Input:  A  F D A A  M  A A D F M F A&#xA;Output:  11 9 8 7 10 12 3 4 2 5 6 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Footnote&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;An actual implementation of APL has some special tokens, e.g. dot &lt;code&gt;.&lt;/code&gt;, jot &lt;code&gt;∘&lt;/code&gt;, and index notation &lt;code&gt;[x]&lt;/code&gt;. We ignore them here for simplicity.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2019-12-26T02:02:47.603" LastActivityDate="2019-12-26T02:02:47.603" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18367" PostTypeId="1" AcceptedAnswerId="18369" CreationDate="2019-12-17T11:47:42.250" Score="2" ViewCount="96" Body="&lt;p&gt;Which choice is better: re-posting a closed challenge with 4 downvotes, or reopen the closed challenge?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The only problem seen in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/25982/remove-duplicates-from-one-list&quot;&gt;this&lt;/a&gt; challenge (at least by me) is that the spec is too unclear. If this challenge is not a duplicate, it is a valid challenge on CGCC.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, reposting the same challenge also seems to be a valid option (at the risk of VTC as a duplicate); &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/52944719#52944719&quot;&gt;it is easier post a new question instead of editing.&lt;/a&gt; Reposting is easier to find out the flaws, although I suspect editing over the same challenge content will achive the same result.&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastEditorUserId="66833" LastEditDate="2021-05-16T18:09:40.583" LastActivityDate="2021-05-16T18:09:40.583" Title="Reopen or repost?" Tags="|discussion|reposting|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18369" PostTypeId="2" ParentId="18367" CreationDate="2019-12-17T16:03:48.110" Score="4" Body="&lt;h1&gt;Post a new question&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;While we do try to avoid reposting when unnecessary, it has been done on this site a number of times. In this case, the original question is almost 5 years old, has a net score of -4, and, before the recent edits, was a poor, underspecified challenge. By posting an updated version to the Sandbox, you avoid jumping the shark with editing the original, and you can start with a &quot;fresh slate&quot;, so to say: namely, the question doesn't already have 5 downvotes. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would recommend asking Quintec for their permission to repost, but so long as they have  no issue with it, and the question is up to our current standards, I see no problem with redoing it.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2019-12-17T16:03:48.110" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18370" PostTypeId="2" ParentId="2140" CreationDate="2019-12-17T19:49:27.563" Score="1" Body="&lt;h1&gt;Decorate the Christmas Tree&lt;/h1&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Intro&lt;/h2&gt;&#xA;&lt;p&gt;It's a week before Christmas and the your family just bought a Christmas tree. Your little sister has a box of ornaments which she wants you to decorate the tree with.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a function or program to randomly decorate the tree with all the ornaments from the box. All possible arrangements of ornaments on the tree must have a non-zero probability of occurrence.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;height of the tree &lt;code&gt;n&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;'box' of ornaments (a string of printable ascii characters where each character represents an ornament) in which order doesn't matter. Also, you can assume that &lt;code&gt;'#'&lt;/code&gt; will not show up as an ornament since it is used to draw bare branches.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Given the number of branches on a tree of size &lt;code&gt;n&lt;/code&gt; is &lt;code&gt;(n-1)^2&lt;/code&gt; you can assume that &lt;strong&gt;the number of ornaments in the box will be less than or equal to the number of branches on the tree.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Example of a box of ornaments: &lt;code&gt;o = '**@@***@@$$**OOOO....'&lt;/code&gt;. Since this string is 21 characters long it can only be valid input for &lt;code&gt;n &amp;gt; 5&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Print out the tree with its decorations&lt;/p&gt;&#xA;&lt;p&gt;The tree is the following structure of ascii characters where &lt;code&gt;n&lt;/code&gt; specifies the height of the tree:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;//Tree where n=9                         //Tree where n=6&#xA;        #                                        #&#xA;       ###                                      ###&#xA;      #####                                    #####&#xA;     #######                                  #######&#xA;    #########                                #########&#xA;   ###########                                  |||&#xA;  #############&#xA; ###############&#xA;       |||&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Bare branches will always be represented with &lt;code&gt;'#'&lt;/code&gt; and the bottom trunk is always &lt;code&gt;|||&lt;/code&gt; while centered with center character of each row.&lt;/p&gt;&#xA;&lt;p&gt;Examples of output with ornaments:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;//n=9, o='X@@X%%%**&amp;amp;&amp;amp;'                   //n=6, o='OO*X*X'&#xA;        #                                        O&#xA;       ##%                                      O##&#xA;      #X###                                    #X#*#&#xA;     ###@##%                                  *######&#xA;    #&amp;amp;#######                                #####X###&#xA;   #@######X##                                  |||&#xA;  #####%##*####&#xA; ##*######&amp;amp;#####&#xA;       |||&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;IO can be used with any &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;convenient method&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so smallest program wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this too close to a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Are there any improvements or clarifications required?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="91021" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-12-18T22:45:26.447" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="18371" PostTypeId="2" ParentId="2140" CreationDate="2019-12-18T03:05:01.290" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/197185/make-a-lost-compass&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2019-12-19T02:23:13.803" LastActivityDate="2019-12-19T02:23:13.803" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18372" PostTypeId="2" ParentId="2140" CreationDate="2019-12-18T04:05:22.937" Score="0" Body="&lt;p&gt;This is a repost of the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/25982/remove-duplicates-from-one-list&quot;&gt;underspecified challenge&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Remove all duplicates from one list of integers. A list is simply a sequence of connected values that allows the same values to be stored at different positions in this sequence. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If an item was found to be the same value as another item in this list, keep the first occurence of the item and remove the second (third and so on...) occurence of the item.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input/Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You may write a function or full program that takes a list as an input and returns a remove-duplicated list as an output.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, so shortest answer wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-12-18T04:20:23.867" LastActivityDate="2019-12-18T04:20:23.867" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18373" PostTypeId="2" ParentId="2140" CreationDate="2019-12-18T21:26:52.130" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/205861/66833&quot;&gt;Score a 1 player game of Carcassonne&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2020-06-09T19:42:11.103" LastActivityDate="2020-06-09T19:42:11.103" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="18375" PostTypeId="1" CreationDate="2019-12-19T00:27:41.590" Score="19" ViewCount="160" Body="&lt;p&gt;The link to the sandbox in the info box is nice, but I was wondering if it might be better to link to change the target of the link from&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;to&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?answertab=active&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which would cause the sandbox posts to be sorted by activity as is usually considered the most useful way to browse the sandbox.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Some Pros/Cons That Have Been Thought Of&lt;/h3&gt;&#xA;&#xA;Pros&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Active is the more useful view of the sandbox&lt;/li&gt;&#xA;&lt;li&gt;For new users following the info box link, more recently active sandbox posts will tend to serve as better examples of sandbox posts than ones that have had the time to accrue a huge amount of votes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;Cons&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Forcing the sorting in this mostly invisible manner might be confusing for some users.&lt;/li&gt;&#xA;&lt;li&gt;The change in sorting will also apply to any meta questions subsequently opened. (from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/31625&quot;&gt;FryAmTheEggman&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20059" LastEditorUserId="68942" LastEditDate="2021-05-23T20:44:14.060" LastActivityDate="2021-05-23T20:44:14.060" Title="Should the Info Box Link to the Active Sorted Sandbox?" Tags="|discussion|feature-request|status-completed|sandbox|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18376" PostTypeId="2" ParentId="2140" CreationDate="2019-12-19T02:16:51.510" Score="0" Body="&lt;h1&gt;Join two file paths&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A &lt;em&gt;file path&lt;/em&gt; consists of letters a-z separated by slashes &lt;code&gt;/&lt;/code&gt;. Your task is to join two paths as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the second path doesn't start with &lt;code&gt;/&lt;/code&gt;, concatenate them with exactly one &lt;code&gt;/&lt;/code&gt; in between.&lt;/li&gt;&#xA;&lt;li&gt;If the second path starts with &lt;code&gt;/&lt;/code&gt;, just output it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;For example,&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;/User/Desktop   temp/file   -&amp;gt;  /User/Desktop/temp/file&#xA;/User/Desktop/  temp/file   -&amp;gt;  /User/Desktop/temp/file&#xA;/User/Desktop   /temp/file  -&amp;gt;  /temp/file&#xA;/User/Desktop/  /temp/file  -&amp;gt;  /temp/file&#xA;relative/path   more/path/  -&amp;gt;  relative/path/more/path&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You may assume the inputs don't contain two consecutive slashes, but they may start or end with a slash. Each input with be nonempty and not just a slash. You may use backslash &lt;code&gt;\&lt;/code&gt; in places of slash &lt;code&gt;/&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox:&lt;/strong&gt; Is this too boring? Too likely a built-in?&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2019-12-19T02:16:51.510" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18377" PostTypeId="2" ParentId="2140" CreationDate="2019-12-19T03:18:11.640" Score="1" Body="&lt;p&gt;For any integer &lt;code&gt;a&lt;/code&gt; and any positive odd integer &lt;code&gt;n&lt;/code&gt; the &lt;a href=&quot;https://en.wikipedia.org/wiki/Jacobi_symbol&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jacobi symbol&lt;/a&gt; is defined as follows:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\left(\frac{a}{n}\right) = &#xA;\left(\frac{a}{p_1}\right)^{\alpha_1}&#xA;\left(\frac{a}{p_2}\right)^{\alpha_2}&#xA;\cdots&#xA;\left(\frac{a}{p_k}\right)^{\alpha_k}&#xA;$$&lt;/span&gt;&#xA;where&#xA;&lt;span class=&quot;math-container&quot;&gt;$$n = p_1^{\alpha_1}p_2^{\alpha_2}\cdots{p_k^{\alpha_k}}$$&lt;/span&gt;&#xA;is the prime factorization of &lt;code&gt;n&lt;/code&gt;.&#xA;The Legendere symbol is defined for all integers &lt;code&gt;a&lt;/code&gt; and odd primes &lt;code&gt;p&lt;/code&gt; as&#xA;&lt;span class=&quot;math-container&quot;&gt;$$\left(\frac{a}{p}\right) = &#xA;\begin{cases}&#xA;      0 &amp;amp; \text{if $a \equiv 0 \pmod{p}$},\\&#xA;      1 &amp;amp; \text{if $a \not\equiv 0 \pmod{p}$ and for some integer $x$: $a \equiv x^2 \pmod{p}$},\\&#xA;      -1 &amp;amp; \text{if $a \not\equiv 0 \pmod{p}$ and there is no such $x$}.&#xA;    \end{cases}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a function that will take two parameters: &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;v&lt;/code&gt;, where &lt;code&gt;a&lt;/code&gt; is a positive integer, and &lt;code&gt;v&lt;/code&gt; is a list of &lt;code&gt;n&lt;/code&gt; values. The function should return the index of the first value in &lt;code&gt;v&lt;/code&gt; for which the Jacobi symbol is &lt;code&gt;-1&lt;/code&gt;.&#xA;For this challenge, you may assume that all values in the &lt;code&gt;v&lt;/code&gt; array are odd primes, and are greater than or equal to &lt;code&gt;a&lt;/code&gt;. The length of &lt;code&gt;v&lt;/code&gt; will be between 4 and 100 values. If no value in &lt;code&gt;v&lt;/code&gt; produces a &lt;code&gt;-1&lt;/code&gt; result for the Jacobi symbol, simply return the length of &lt;code&gt;v&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because each invocation of the function will execute very quickly, your function will be tested against a wide variety of inputs and the execution time will be summed. This process will be repeated 50 times and the best execution time will serve as your score. My machine is a 2018 Macbook Pro, with the following specs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;CPU: Intel(R) Core(TM) i9-8950HK CPU @ 2.90GHz&#xA;machdep.cpu.features: FPU VME DE PSE TSC MSR PAE MCE CX8 APIC SEP MTRR PGE MCA CMOV PAT PSE36 CLFSH DS ACPI MMX FXSR SSE SSE2 SS HTT TM PBE SSE3 PCLMULQDQ DTES64 MON DSCPL VMX EST TM2 SSSE3 FMA CX16 TPR PDCM SSE4.1 SSE4.2 x2APIC MOVBE POPCNT AES PCID XSAVE OSXSAVE SEGLIM64 TSCTMR AVX1.0 RDRAND F16C&#xA;machdep.cpu.leaf7_features: SMEP ERMS RDWRFSGS TSC_THREAD_OFFSET BMI1 HLE AVX2 BMI2 INVPCID RTM SMAP RDSEED ADX IPT SGX FPU_CSDS MPX CLFSOPT&#xA;GPU: Intel UHD Graphics 630 1536MB&#xA;RAM: 32GB 2400MHz DDR4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="46878" LastEditorUserId="46878" LastEditDate="2019-12-19T03:25:26.517" LastActivityDate="2019-12-19T03:25:26.517" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18379" PostTypeId="2" ParentId="2140" CreationDate="2019-12-20T12:31:02.580" Score="0" Body="&lt;h1&gt;String Blockify™ a Hexagon&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;an obvious rip-off of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/197080/hexagonify-a-string-block&quot;&gt;Hexagonify™ a String Block&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h3&gt;What is Hexagonification?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Hexagonification is a transformation that creates a hexagon with 3 copies of a rectangle block&amp;trade;, each skewed to the right by 30 degrees and then rotated by 0, 120 and 240 degrees respectively, as shown in the following image. A triangle hole may appear in the middle, but that isn't a great deal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/N13HQ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/N13HQ.png&quot; alt=&quot;diagram of hexagonification&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that receives a hexagonified block of string&amp;trade; as an input and outputs the original string block&amp;trade;.&#xA;&lt;a href=&quot;https://i.stack.imgur.com/7Oajh.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/7Oajh.png&quot; alt=&quot;diagram of string blockification&quot;&gt;&lt;/a&gt;&#xA;The input and output formats are flexible. You may receive a single string, a list of lines or a 2D array as input, and output a single string or a list of lines. You may have leading/trailing spaces on each line and leading/trailing newlines, provided that the block is properly formed. See Sample IO for how the blocks&amp;trade; should be positioned.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sample IO&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   3 x 3&#xA;  e s q u&#xA; u r a r e&#xA;3 q a a s 3&#xA; x s r q x&#xA;  3 e u 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3x3&#xA;squ&#xA;are&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   l o n g e r . . . . .&#xA;  . r e c t a n g u l a r&#xA; r . b l o c k . . . . . .&#xA;. a .                 b r l&#xA; . l .               l e o&#xA;  . u .             o c n&#xA;   . g .           c t g&#xA;    . n k         k a e&#xA;     r a c       . n r&#xA;      e t o     . g .&#xA;       g c l   . u .&#xA;        n e b . l .&#xA;         o r . a .&#xA;          l . r .&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;longer.....&#xA;rectangular&#xA;block......&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;        v b&#xA;       8 e l&#xA;      x l r o&#xA;     2 a   t c&#xA;    k c     i k&#xA;   c i       c 2 &#xA;  o t         a x&#xA; l r           l 8&#xA;b e l a c i t r e v&#xA; v 8 x 2 k c o l b  &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;vb&#xA;el&#xA;ro&#xA;tc&#xA;ik&#xA;c2&#xA;ax&#xA;l8 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 1 . l i n e&#xA;e           1&#xA; n         .&#xA;  i       l&#xA;   l     i&#xA;    .   n&#xA;     1 e&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1.line&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;      1&#xA;     e .&#xA;    n   l&#xA;   i     i&#xA;  l       n&#xA; .         e&#xA;1 e n i l . 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;.&#xA;l&#xA;i&#xA;n&#xA;e&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your score will be the area of the source code as a String Block&amp;trade;. Assuming your code can just fit inside a rectangle of width &lt;span class=&quot;math-container&quot;&gt;\$w\$&lt;/span&gt; and height &lt;span class=&quot;math-container&quot;&gt;\$h\$&lt;/span&gt;, the score will be:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$w \cdot h$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Winning Criteria&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The submission with the lowest score in each language wins.&lt;/p&gt;&#xA;" OwnerUserId="36445" LastActivityDate="2019-12-20T12:31:02.580" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18380" PostTypeId="2" ParentId="2140" CreationDate="2019-12-20T17:37:31.663" Score="0" Body="&lt;h1&gt;Joyous Kwanzaa!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Kwanzaa is an annual week-long celebration of African culture and history, and takes place on December 26 to January 1. During Kwanzaa it is traditional to light the seven candles of a &lt;em&gt;kinara&lt;/em&gt;, one on each day. The middle candle is lit first, followed by the rest of the candles from left to right.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your challenge will be to write a program or function that when given ASCII art (in any convenient format) of candles on a kinara (as specified below), some of which may be lit, will return or output a ASCII art of what the kinara would look like on the next day.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A kinara will contain of seven even columns of equal length with equal spacing between them, representing the candles. The candles will be constructed with some consistent printable, non-whitespace ASCII character.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some of the candles might have a flame above them, which will be represented by a single printable, non-whitespace ASCII character, possibly the same as the candle's character. If no candles are lit, there will be an empty line above the candles.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is an example of a kinara ASCII art:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;*     *&#xA;| | | | | | |&#xA;| | | | | | |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Input/Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input will be a kinara with seven candles, 0-6 of them lit according to the rule (middle candle first, then the rest from left to right).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output will be a kinara with candles and flames identical to the input kinara, but with one more lit candle than the input. The extra candle will be lit according to the rule. If no candles are lit in the input, you may use any character for the flame.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may assume the input is valid according to the specification given. You may assume the input has no trailing or leading whitespace in any of the lines, but trailing or leading whitespace is acceptable in the output as long as the kinara has the proper shape.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In/out:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;*     *&#xA;| | | | | | |&#xA;| | | | | | |&#xA;&#xA;* *   *&#xA;| | | | | | |&#xA;| | | | | | |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In/out:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;** *&#xA;|||||||&#xA;&#xA;****&#xA;|||||||&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In/out:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;5 5 5 5&#xA;6 6 6 6 6 6 6&#xA;6 6 6 6 6 6 6&#xA;&#xA;5 5 5 5 5&#xA;6 6 6 6 6 6 6&#xA;6 6 6 6 6 6 6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In/out:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;               # pretend this is an empty line&#xA;q q q q q q q&#xA;&#xA;      0&#xA;q q q q q q q&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;No standard loopholes&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Shortest code in bytes wins&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Questions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Is this too complicated? If so how could I simplify it?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is the wording unclear?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is this too similar to an existing challenge? I found another &lt;a href=&quot;https://codegolf.stackexchange.com/questions/64174/festival-of-ascii-art-lights&quot;&gt;challenge&lt;/a&gt; which involves creating a menorah, but this one takes candles as input instead of a date.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="89930" LastActivityDate="2019-12-20T17:37:31.663" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18381" PostTypeId="1" CreationDate="2019-12-20T18:09:14.863" Score="5" ViewCount="738" Body="&lt;p&gt;A disadvantage of the &quot;default rules as answers&quot; is that the rules don't have a common, organizing, &quot;formal&quot; thought behind them.  I'm talking about &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5076/90124&quot;&gt;this one&lt;/a&gt; here. I understand it as applying to &quot;anything similar&quot;, but is there any exact way that could be understood? I was thinking about making an advanced brainfuck program compression algorithm and a language that would interpret the compressed form. But different versions of brainfuck (like with 32-bit integer vs unbounded cells) are optimal for different challenges. The obvious solution is to add a flag to the interpreter but then that has to be counted in a &lt;code&gt;code-golf&lt;/code&gt; score. If I generated completely separate, uncompressed interpreters for each flag would that count? What if they were in separate commits? Separate repos? It's hard for me to come up with any good objective criteria because someone could always generate 5000 different compression algorithms and related interpreters and choose the best one for a particular code every time, which does feel like cheating. &lt;/p&gt;&#xA;" OwnerUserId="90124" LastEditorUserId="90124" LastEditDate="2019-12-20T19:46:26.910" LastActivityDate="2019-12-21T02:47:24.983" Title="Is the &quot;no MetaGolfScript&quot; rule somehow formalized?" Tags="|discussion|defaults|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18382" PostTypeId="2" ParentId="18381" CreationDate="2019-12-21T02:47:24.983" Score="9" Body="&lt;p&gt;&lt;em&gt;This answer contains some personal opinions, which I express as my own thoughts and not as a moderator.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;As you've correctly pointed out, the strategy of enumerating a set of exhaustive rules, carefully designed to eliminate all possible corner cases that people could possibly come up with to work around them, isn't really a sustainable model, because there will always be tricks or loopholes that people haven't thought of, or which &lt;em&gt;technically&lt;/em&gt; abide by the rules as written.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Nevertheless, that was the model that the site tried to use for most of its history, ever since the &quot;&lt;code&gt;curl&amp;nbsp;short.link|sh&lt;/code&gt;&quot; answers and the like stopped being amusing. Recently, though, the general attitude of the community has shifted away from this mindset in terms of placing restrictions on which languages people are allowed to use. In particular, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14339/3808&quot;&gt;about two years ago&lt;/a&gt; (wow, was it really that long?) a consensus seemed to be reached that adding the size of flags to byte counts was silly, and that it made more sense to simply consider a distinct compiler/interpreter invocation (with a particular set of flags) as a distinct &lt;em&gt;language&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This coordinated nicely with the idea that languages shouldn't compete against one another, but with themselves (i.e. an 80-byte Java answer isn't competing against a 2-byte Jelly answer, but it's certainly better than a 90-byte Java answer). In particular, yes, it may be the case that you have a 0-byte &lt;code&gt;metagolfscript -n 209180605381204854470575573749277224&lt;/code&gt; answer, but this is not a particularly impressive feat seeing as there are no possible longer answers to compete with.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A far more eloquent summary of the same idea can be found in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12877/3808&quot;&gt;this post by former moderator Martin Ender&lt;/a&gt;, which argued that our previously existing rule that languages created after the creation of the challenge should be considered &quot;non-competing&quot; was also silly:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I believe the community has come a long way from competing for the overall shortest answer on a challenge. Most people who aren't using Jelly or 05AB1E or the like are usually competing within their own language (or maybe with languages of comparable verbosity). Adding a built-in to the language just for that challenge simply makes the language uninteresting for the problem at hand.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;[...]&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;Adding a built-in to solve a challenge isn't very interesting and will likely be discouraged by downvotes more than anything else, especially if someone does it repeatedly.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Both of these semi-recent policy changes are based on the same idea: &lt;strong&gt;different languages are mostly incomparable, so exploits that rely on modifying or inventing new languages to fit a specific challenge are uninteresting&lt;/strong&gt; (and will likely be deemed as such by voters, barring a few older answers like the 0-byte Hello World, which was posted before this view was as widespread).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;While the above answers the question you've posed, I'll also note that not all of our rules have caught up to this change in mindset. For example, it is still the case that we have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2073/3808&quot;&gt;a seemingly-arbitrary set of conditions&lt;/a&gt; that an executable must meet to be considered a &quot;programming language&quot; and thus eligible for answering challenges. This made sense when it was introduced, because it aimed to eliminate e.g. the 0-byte &lt;code&gt;rot13&lt;/code&gt; answer to the challenge &quot;output ROT13 of input.&quot; But the more general philosophy described above already deals with this -- such an answer is boring, because the language was literally &lt;em&gt;designed to do what the challenge asks&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another example is the policy regarding &quot;serious contenders,&quot; which is described by former moderators &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8750/3808&quot;&gt;Mego&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990/3808&quot;&gt;Dennis&lt;/a&gt; as well as in our current &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;Help Center&lt;/a&gt;. Currently, by a literal interpretation of the rules, it is the case that answers that impose a source restriction on themselves, despite being well-golfed under such a restriction, violate this policy. This has the unfortunate effect of disallowing some answers that are legitimately good, such as &lt;a href=&quot;https://codegolf.stackexchange.com/a/187885/3808&quot;&gt;this program which decides whether a string follows a rule, whose source code itself follows the rule&lt;/a&gt; (deleted, requires 10k rep to view).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But ah well, I'm getting sidetracked, and this is really a topic for a different meta post. Thanks for asking this one, and apologies for hijacking it to soapbox a bit :)&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2019-12-21T02:47:24.983" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="18383" PostTypeId="2" ParentId="2140" CreationDate="2019-12-21T05:47:29.783" Score="1" Body="&lt;h2&gt;Even-Odd chunks&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(Inspired by the Keg utility of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/197210/even-and-odd-numbers&quot;&gt;this&lt;/a&gt; challenge)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an input string, e.g. &lt;code&gt;s c 1= e(a&quot;E&quot;)&lt;/code&gt;, split the input into even-odd chunks.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This input string, when mapped to its code points, yields the list &lt;code&gt;[115, 32, 99, 32, 49, 61, 32, 101, 40, 97, 34, 69, 34, 41]&lt;/code&gt;. When applied modulo-2 for every item, this returns &lt;code&gt;[1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this list let's find the longest possible chunk that is consistent with even and odd code points:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1, 0, 1, 0, 1], [1, 0, 1, 0, 1, 0, 1, 0, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For the first chunk, this yields &lt;code&gt;[1, 0, 1, 0, 1]&lt;/code&gt; because this is the longest chunk that follows the pattern&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Odd Even Odd Even Odd Even ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Even Odd Even Odd Even Odd ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;. Adding another codepoint into &lt;code&gt;[1, 0, 1, 0, 1, 1]&lt;/code&gt; breaks the pattern, therefore it is the longest possible even-odd chunk that starts from the beginning of the string.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using this method, we should split the input into chunks so that this rule applies. Therefore the input becomes (the &lt;code&gt;;&lt;/code&gt; here is simply a separator; this can be any separator that is not an empty string):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;s c 1;= e(a&quot;E&quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest solution wins. Let it be known that flags don't count towards being in the pattern. They also don't count towards byte count in this challenge.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2019-12-21T12:27:38.767" LastActivityDate="2019-12-21T12:27:38.767" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18387" PostTypeId="2" ParentId="2140" CreationDate="2019-12-21T15:26:13.410" Score="-1" Body="&lt;p&gt;Given a digit as an English word, output its numerical value.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, given the input &lt;code&gt;one&lt;/code&gt;, you should output &lt;code&gt;1&lt;/code&gt; (optionally with a trailing newline).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program should cover all the following cases:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;zero  =&amp;gt; 0&#xA;one   =&amp;gt; 1&#xA;two   =&amp;gt; 2&#xA;three =&amp;gt; 3&#xA;four  =&amp;gt; 4&#xA;five  =&amp;gt; 5&#xA;six   =&amp;gt; 6&#xA;seven =&amp;gt; 7&#xA;eight =&amp;gt; 8&#xA;nine  =&amp;gt; 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="21824" LastEditorUserId="21824" LastEditDate="2019-12-23T11:38:16.893" LastActivityDate="2019-12-23T11:38:16.893" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18389" PostTypeId="2" ParentId="2140" CreationDate="2019-12-22T13:12:42.920" Score="0" Body="&lt;h1&gt;Hit the most Balloons with one Arrow&lt;/h1&gt;&#xA;&lt;p&gt;You got 1 arrow to hit as much balloons as possible. A common way to solve this, is to mark the tangent points of every balloon and project the angles on the source's position. As seen in the following image this has been down already. The task is now to find the optimal and angle-centered solution to hit the most Balloons.&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/R3V8g.png&quot; alt=&quot;Balloon&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;The Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A json array of length 360 (for every 1° one entry) representating the number of Balloons hit at this angle.&lt;/p&gt;&#xA;&lt;p&gt;JSON: &lt;a href=&quot;https://pastebin.com/raw/Rd8g7Z6J&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://pastebin.com/raw/Rd8g7Z6J&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;The Task:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Find an algorithm that solves the task with the following requirements:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;return the number of most hits&lt;/li&gt;&#xA;&lt;li&gt;return the max range of angles with the most hits&lt;/li&gt;&#xA;&lt;li&gt;return the the centered angle of this range&lt;/li&gt;&#xA;&lt;li&gt;there are no format restrictions how you are returning the values, it could be 3 prints or an array... whatever, as long as it is clear to see whats the hits, range and center&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Solution of given JSON:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Most Hits: 6&lt;/li&gt;&#xA;&lt;li&gt;Range: 358 - 0&lt;/li&gt;&#xA;&lt;li&gt;Center: 359&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Notes:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Remember its a circle, so you need to check if the range crosses the 360°/0° mark!!! A range can be like 300° - 10° for example.&lt;/p&gt;&#xA;&lt;p&gt;For simplicity the angles are 0° - 359° as 360° would be 0°.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="90587" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2019-12-22T13:17:50.157" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18391" PostTypeId="2" ParentId="6918" CreationDate="2019-12-23T14:05:13.723" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/A-ee/w&quot; rel=&quot;nofollow noreferrer&quot;&gt;W&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/86606/85052&quot;&gt;Whoever said golfing languages had far to many useless builtins?&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'm afraid I also agree with that quote. In fact, I created W &lt;em&gt;because&lt;/em&gt; I feel that golfing languages have &lt;em&gt;way&lt;/em&gt; too many built-ins, and most of them are not useful at all in practical golfing competitions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I initially tried to learn Pyth, but its syntax is too inconsistent for me to easily master. Therefore I decided to create a &quot;more consistent&quot; version of postfix Pyth which only uses postfix notation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And then I decided to remove all the &quot;inconsistent&quot; accumulator and temporary storage stuff, in order to start a thought experiment. In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/118111/tips-for-storage-in-a-golfing-language&quot;&gt;this&lt;/a&gt; it has been suggested that temporary storage is neccecary. However W only has &lt;em&gt;one single&lt;/em&gt; stack with no temporary storage.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Example: This outputs an array of each character code of the input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;C&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output for &lt;code&gt;Hello, World!&lt;/code&gt;: &lt;code&gt;[72,101,108,108,111,44,32,87,111,114,108,100,33]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;[Interpreter](Not yet on TIO... :) )&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/A-ee/w&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github (you should totally star W if you like it)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/A-ee/w/wiki&quot; rel=&quot;nofollow noreferrer&quot;&gt;Documentation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2020-02-11T02:08:49.707" LastActivityDate="2020-02-11T02:08:49.707" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18392" PostTypeId="1" AcceptedAnswerId="18393" CreationDate="2019-12-23T14:12:36.010" Score="1" ViewCount="79" Body="&lt;p&gt;I want to share my golfed code of puzzle available on &lt;a href=&quot;https://www.codingame.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Coding Game&lt;/a&gt;, but is it OK to share it on CodeGolf SE ? Other's code is available only by completing the puzzle, but I use those puzzle to train code-golf.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is sharing my solution and/or asking for possible improvement OK ?&#xA;Should I use a &lt;/p&gt;&#xA;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;  &lt;p&gt; spoiler ?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/197243/88473&quot;&gt;Here&lt;/a&gt; an example and &lt;a href=&quot;https://www.codingame.com/ide/puzzle/ascii-art&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; the puzzle my question is about.&lt;/p&gt;&#xA;" OwnerUserId="88473" LastActivityDate="2019-12-23T14:47:50.970" Title="Is it ok to share Coding Game puzzle solution for golf improvement?" Tags="|discussion|spoilers|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18393" PostTypeId="2" ParentId="18392" CreationDate="2019-12-23T14:47:50.970" Score="2" Body="&lt;p&gt;This is what &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; is for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can share your code and what it is trying to do and others can show you how it can be improved.  You can put your code in a spoiler block if you would like but it is definitely not necessary to do so.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It may of course be against another sites terms to submit code you have received help on, even if that help was golfing it, so you may want to check their policy.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2019-12-23T14:47:50.970" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18394" PostTypeId="2" ParentId="2140" CreationDate="2019-12-23T19:35:51.253" Score="1" Body="&lt;h1&gt;Convert Character Substrings to Numeric&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I often have to take character data and categorize it numerically. A common thing I do is to take character type variables and convert them to numeric type characters, keeping same categories according to the level of work I'm doing. (The longer the substring, the more in depth, shorter substrings for broad level). Enough backstory...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge: &lt;strong&gt;In as few bytes as possible,&lt;/strong&gt; convert the input part A, &lt;em&gt;a vector/list of unique strings&lt;/em&gt;, into the output, a &lt;em&gt;vector/list of numbers&lt;/em&gt;, keeping unique categories within the length of substrings the same length, which is input part B.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;w, Vector/list of unique strings of equal character length. &lt;code&gt;n &amp;lt;= 10&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;These strings may be any combination of uppercase letters and numbers. Sorry if it seems my examples follow a pattern, I just created them after a similar pattern I see in the data I work with.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;s, where &lt;code&gt;1 &amp;lt;= s &amp;lt;= n&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Output: May take input and output in the same order, or you can convert alphabetically, but output in the same order. See example 2. (I've included comments in my output to clarify, this is not required)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example Input 1:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#Already alphabetized, but this input is not always guaranteed&#xA;&#xA;s = 3, w = &#xA;[ABC01, &#xA; ABC11,&#xA; ABC21,&#xA; ABD01,&#xA; ABE01,&#xA; ABE02,&#xA; ACA10,&#xA; ACA11,&#xA; ACB20,&#xA; ACB21]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example Output 1:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1, #ABC&#xA; 1, &#xA; 1, &#xA; 2, #ABD&#xA; 3, #ABE&#xA; 3, &#xA; 4, #ACA&#xA; 4, &#xA; 5, #ACB&#xA; 5]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example Input 2:&lt;/strong&gt;&#xA;s = 4, w = &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[X1Z123,&#xA; X1Z134,&#xA; X1Y123,&#xA; X1Y134,&#xA; X1Y145,&#xA; X1Y156,&#xA; X1X123,&#xA; X1X124,&#xA; X1X234,&#xA; X2Z123,&#xA; X2Z134,&#xA; X2Z222,&#xA; X2Z223,&#xA; X2Z224]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 2 Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#Categorize by order&#xA;[1, #X1Z1&#xA; 1,&#xA; 2, #X1Y1&#xA; 2,&#xA; 2,&#xA; 2,&#xA; 3, #X1X1&#xA; 3,&#xA; 4, #X1X2&#xA; 5, #X2Z1&#xA; 5,&#xA; 6, #X2Z2&#xA; 6,&#xA; 6] &#xA;&#xA;OR if conversion follows alphabetical formatting,&#xA;&#xA;#Categorize alphabetically, but output in same order as input.&#xA;[6, #X1Z1&#xA; 6,&#xA; 5, #X1Y1&#xA; 5,&#xA; 5,&#xA; 5,&#xA; 3, #X1X1&#xA; 3,&#xA; 4, #X1X2&#xA; 1, #X2Z1&#xA; 1,&#xA; 2, #X2Z2&#xA; 2,&#xA; 2] &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="82163" LastEditorUserId="82163" LastEditDate="2019-12-23T20:29:36.250" LastActivityDate="2019-12-23T20:29:36.250" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18396" PostTypeId="2" ParentId="6918" CreationDate="2019-12-24T01:40:09.317" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/JonoCode9374/Keg&quot; rel=&quot;nofollow noreferrer&quot;&gt;Keg&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;I figured I might as well get around to writing up an answer to this question to show people a side of Keg they probably haven't seen before.&lt;/p&gt;&#xA;&lt;h2&gt;The Backstory&lt;/h2&gt;&#xA;&lt;p&gt;Let’s start off real simple. Keg is made by me, Lyxal, although on GitHub and esolangs, I'm called JonoCode9374.&lt;/p&gt;&#xA;&lt;p&gt;Anyhow, Keg was the second esolang I've ever made, with my first being a Minecraft based fungoid language. It's also the first golfing language I've ever made.&lt;/p&gt;&#xA;&lt;p&gt;Back in 2018 when I was still new to esolangs, I was reading and learning about the &amp;gt;&amp;lt;&amp;gt; language. I absolutely loved the 2d layout as well as the simple stack manipulation abilities it contained. It was &amp;gt;&amp;lt;&amp;gt; that introduced me to stacks. And it was &amp;gt;&amp;lt;&amp;gt; that would influence the creation of Keg.&lt;/p&gt;&#xA;&lt;p&gt;Starting from scratch, I didn't really know what to include in a golfing language. But I did know that I wanted to make the instruction set completely ascii, as I (at the time) found Unicode languages just too hard to understand (boy, how that's gone out the window!).&lt;/p&gt;&#xA;&lt;p&gt;Touching on that point a bit more, I've had a kind of mindset of &amp;quot;if you don't understand it, make your own&amp;quot;. Now, I know that people would say that such a perspective of life is ineffective, as one can't just create complex systems if they don't understand it. And I agree, generally I don't follow this way of thinking. But when it comes to something manageable like golfing language design, I believe it's fair game.&lt;/p&gt;&#xA;&lt;p&gt;Also, I feel like I should mention I created Keg as a sort of protest against the big and established languages that seemed to always win... I kinda solved the issue of golfing langs sucking all the fun out of CGCC for myself.&lt;/p&gt;&#xA;&lt;p&gt;Working my way through the process of language creation, I eventually finished the original interpreter, and, on the 5th of November, I created the GitHub repo for Keg.&lt;/p&gt;&#xA;&lt;p&gt;After doing so, I wrote a few answers here on CGCC and, after a few weeks of inactivity, I decided I'd move on from Keg.&lt;/p&gt;&#xA;&lt;p&gt;Then, around 5 months later, I decided I would browse through esolangs.org to see what languages there were. Looking through the recent edits, I saw something that would drive the second phase of Keg development: &lt;a href=&quot;https://esolangs.org/wiki/Teg&quot; rel=&quot;nofollow noreferrer&quot;&gt;Teg&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;At first, I was kind of offended, as it seemed like a personal attack on the little language I&#xA;had created. Wanting to prove whoever had created this page wrong that they had created something better than Keg, I started plotting out a brick ton of operators to add.&lt;/p&gt;&#xA;&lt;p&gt;But then I learned that A__ (I'm on mobile, using an external markdown editor, whaddya expect?) was actually friendly and that they were just mucking around (I think), I was a bit more relaxed about Keg development. (I now view Teg as a kind of compliment ;p)&lt;/p&gt;&#xA;&lt;p&gt;Needless to say, after ~2 months of extensive planning, ~30 pieces of paper with sketches of what aspects might look like, I finally started developing Keg's first major expansion.&lt;/p&gt;&#xA;&lt;p&gt;Now, this expansion contained features such as strings, integer scanning, new register commands and variables. But the interpreter I had wasn't suited for such new things. So I had to rewrite everything. It was at this point I made Keg transpiled… one of the best decisions I've made in regards to Keg.&lt;/p&gt;&#xA;&lt;p&gt;Later on, it came time to deal with finer aspects of the expansion. Such an example of this was string compression. Now, here's the thing... this was at a time when I thought all characters were a single byte each. Ha, what a silly idea. I was thinking of having a 400k word dictionary making good usage of the ~100k Unicode characters. But then I learned about byte counts. So that's why there's only 60k words in the dictionary.&lt;/p&gt;&#xA;&lt;p&gt;Why am I telling you all this? Well, I figured I would explain a little bit of the behind the scenes information about Keg. It may be fragmented, but it's the best I can do at the moment.&lt;/p&gt;&#xA;&lt;h2&gt;Main Features&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;The following is 'borrowed' from the esolangs page... Which I just happened to write ;P&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;The main inspiration for Keg comes from a want of an esolang where only symbols count as commands and everything else is pushed onto the stack as a literal. This is why there are only 12 functions, 7 ‘keywords’ and 8 operators. As such, this system allows for shorter programs where strings are involved (&lt;em&gt;uncompressed&lt;/em&gt; strings in Keg are usually 1-2 bytes shorter than their counterparts in other languages).&lt;/p&gt;&#xA;&lt;p&gt;Another design feature of Keg is the look of if statements, for loops and while loops. These structures take on the form of:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;B...B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Where B is any of the three brackets (&lt;code&gt;(&lt;/code&gt;/&lt;code&gt;)&lt;/code&gt;, &lt;code&gt;[&lt;/code&gt;/&lt;code&gt;]&lt;/code&gt; or &lt;code&gt;{&lt;/code&gt;/&lt;code&gt;}&lt;/code&gt;) and &lt;code&gt;...&lt;/code&gt; is any section of Keg code.&lt;/p&gt;&#xA;&lt;h3&gt;Some Basics&lt;/h3&gt;&#xA;&lt;p&gt;Most tutorials show how to print the string &lt;code&gt;Hello, World!&lt;/code&gt;, so that’s what this tutorial will do as well. Here is a simple 21 byte program to achieve the goal.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Hello\, World\!^(!|,)&#xA;&#xA;Hello # Push the characters &amp;quot;H&amp;quot;, &amp;quot;e&amp;quot;, &amp;quot;l&amp;quot;, &amp;quot;l&amp;quot; and &amp;quot;o&amp;quot; to the stack&#xA;\,    # Escape the &amp;quot;,&amp;quot; and push it to the stack&#xA;World # Push the characters &amp;quot;W&amp;quot;, &amp;quot;o&amp;quot;, &amp;quot;r&amp;quot;, &amp;quot;l&amp;quot; and &amp;quot;d&amp;quot; to the stack&#xA;\!    # Escape the &amp;quot;!&amp;quot; and push it to the stack ^ #Reverse the stack&#xA;(!|   # Start a for loop and set the count to the length of the stack&#xA;  ,   # Print the last item on the stack as a character&#xA;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In the above example, 6 new functions and keywords are introduced:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;\&lt;/code&gt; : Escapes the next command, and instead pushes it as a string (pushes its ASCII value)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;,&lt;/code&gt; : Prints the last item on the stack as a character&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;!&lt;/code&gt; : Pushes the length of the stack onto the stack&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;^&lt;/code&gt; : Reverses the stack&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(...)&lt;/code&gt; : The for loop structure&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;|&lt;/code&gt; : Used in structures to switch from one branch to the other.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;One of the most important parts of Keg is the stack, which is where all operations are performed. A stack is a type of container (or list) where the last item in the container is the first item to be operated on (LIFO – Last In First Out). In the following examples, the stack will be investigated.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;3 # [3]&#xA;4 # [3, 4]&#xA;+ # [7]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In the above example, the numbers 3 and 4 are pushed onto the stack, and are then added using the &lt;code&gt;+&lt;/code&gt; operator. The way it works is that the &lt;code&gt;+&lt;/code&gt; pops what will be called &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt; off the stack (the first and second last item) and pushes &lt;span class=&quot;math-container&quot;&gt;\$y + x\$&lt;/span&gt; back onto the stack. Note that the order of &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt; are important when using the &lt;code&gt;-&lt;/code&gt; and &lt;code&gt;\&lt;/code&gt; operators, as &lt;span class=&quot;math-container&quot;&gt;\$x - y\$&lt;/span&gt; doesn’t equal &lt;span class=&quot;math-container&quot;&gt;\$y - x\$&lt;/span&gt; most of the time (as is the same with &lt;span class=&quot;math-container&quot;&gt;\$x \div y\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$y \div x\$&lt;/span&gt;). This can be seen in the following example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;34-. # Outputs -1&#xA;43-. # Outputs 1 &#xA;34/. # Outputs 0.75 &#xA;43/. # Outputs 1.333333333333&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that the &lt;code&gt;.&lt;/code&gt; function prints the last item on the stack as an integer.&lt;/p&gt;&#xA;&lt;p&gt;Keg has two output functions and one input function. When taking input from the user, the next line from the Standard Input and push the ASCII value of each character onto the stack. It will then push -1 onto the stack to signify the end of input (input as integers will be coming in a later version of Keg). Input is taken using the ? command, as shown in the example program:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;?(!|,) &#xA;# &amp;gt; Example text &#xA;# Example text&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The two output functions (&lt;code&gt;.&lt;/code&gt; – Print as integer and &lt;code&gt;,&lt;/code&gt; – Print as string) have already been detailed in other sections&lt;/p&gt;&#xA;&lt;h2&gt;Links&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/JonoCode9374/Keg&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#keg&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it Online&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://esolangs.org/wiki/Keg&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolangs&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="66833" LastEditDate="2020-09-17T15:24:02.070" LastActivityDate="2020-09-17T15:24:02.070" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18397" PostTypeId="2" ParentId="2140" CreationDate="2019-12-25T07:26:02.723" Score="-2" Body="&lt;h1&gt;Finite Elements from Scratch&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Background&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&quot;The finite element method (FEM), is a numerical method for solving problems of engineering and mathematical physics.&quot; -Wikipedia&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One of the elementary formulations of fem in structural engineering is the truss. They are very basic, but have a lot of utility.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/b/b1/The_Little_Belt_Bridge_%281935%29.jpeg&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When one designs a truss, especially in the preliminary stages some assumptions are usually made to simplify the procedure. For instance, members are assumed to carry only tension or compression load. This means that we can only load the truss at the nodals points. Depending on how the connection is designed and detailed, these assumptions can be quite close to how the structure actually will behave in the real world.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, what's so special about having a member with only axial loading? Well, there's a property of the material itself we can take advantage of. Most materials have a property of 'linear elasticity' when the material is stretched or compressed a very small amount. A material like steel is quite ductile, and so this range of linear elasticiticy is quite large, as compared to something like ceramics. This means if we push or pull on some steel with a small force, it will displace a proportional amount. If we double our applied force, its displacement will double as well. Also if we release our force, the material will go back to its original configuration. So as long as we deform the material elastically, we won't waste any energy deforming it plastically.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you have ever taken a physics class, you may know that a spring has these exact same properties. Therefore, we can idealize all the members in our truss as just simple springs.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Building up to direct stiffness method&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A zero dimensional spring equation looks like this.&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;K \cdot u = F&#xA;$$&lt;/span&gt;&#xA;This relates the force required to any deformation of the spring. The force and deformation are linearly proportional by &lt;span class=&quot;math-container&quot;&gt;\$K\$&lt;/span&gt;, the spring constant. The constant &lt;span class=&quot;math-container&quot;&gt;\$K\$&lt;/span&gt; has units of [force/distance] e.g. [pounds/in] or [kilograms/meter]. For example, if &lt;span class=&quot;math-container&quot;&gt;\$K = 50 lb/in\$&lt;/span&gt;, it would take &lt;span class=&quot;math-container&quot;&gt;\$50lb\$&lt;/span&gt; of force to displace the spring &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; inch, and &lt;span class=&quot;math-container&quot;&gt;\$100lb\$&lt;/span&gt; to displace the spring &lt;span class=&quot;math-container&quot;&gt;\$2\$&lt;/span&gt; inches. The stiffness in our truss members is similar:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;K = \frac{EA}{L}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt; is Young's Modulus, &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; is the cross sectional area, and &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; is the length of the bar. The only scary thing here is probably &lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt;, but it's not too crazy. It's kind of like stiffness, but it's normalized. Instead of [force/distance] we have [stress/strain]. Stress is like the normalized force, it's the amount of force over the area of the element. Strain is like the normalized displacement, it's calculated by (change in length/original length) or percent elongation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's develop this a bit more and put it in matrix form. This will allow us to relate the force on one side of the bar to force on the other.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\frac{EA}{L}&#xA;\left[\begin{array}{cc}&#xA;1 &amp;amp; -1\\&#xA;-1 &amp;amp; 1 \\&#xA;\end{array}\right] \cdot&#xA;\left[\begin{array}{c}&#xA;u_1 \\&#xA;u_2 \\&#xA;\end{array}\right] =&#xA;\left[\begin{array}{c}&#xA;f_1 \\&#xA;f_2 \\&#xA;\end{array}\right]&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Now we have our one dimensional spring equation. Instead of a single displacement, we have a displacement vector. We can displace both sides of the spring independently and find what the resultant forces on each side will be.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Displace the right node 1 unit to the right&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\frac{EA}{L}&#xA;\left[\begin{array}{cc}&#xA;1 &amp;amp; -1\\&#xA;-1 &amp;amp; 1 \\&#xA;\end{array}\right] \cdot&#xA;\left[\begin{array}{c}&#xA;0 \\&#xA;1 \\&#xA;\end{array}\right] =&#xA;\left[\begin{array}{c}&#xA;f_1 \\&#xA;f_2 \\&#xA;\end{array}\right]\\&#xA;f_1 = \frac{-E A}{L}, f_2 = \frac{E A}{L}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This makes sense, because if we displace the right side by a unit, we need a force in the equal and opposite direction on the left side to not drag that side along.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Displace both nodes &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; unit to the right&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\frac{EA}{L}&#xA;\left[\begin{array}{cc}&#xA;1 &amp;amp; -1\\&#xA;-1 &amp;amp; 1 \\&#xA;\end{array}\right] \cdot&#xA;\left[\begin{array}{c}&#xA;1 \\&#xA;1 \\&#xA;\end{array}\right] =&#xA;\left[\begin{array}{c}&#xA;f_1 \\&#xA;f_2 \\&#xA;\end{array}\right]\\&#xA;f_1 = 0, f_2 = 0&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This makes sense, because if we displace both sides at the same time, the distance between them does not change. It would be as if we just translated the spring across the table and did not strech it. We don't need some force holding it in a deformed configuration.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That's cool, but one dimensional structures are lame. I want a two dimensional structure to build a bridge! Well, it's not that much more difficult. We just need to add a &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt; degree of freedom (dof) on each side of the spring. We can also couple our &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt; dofs into one angle from the &lt;span class=&quot;math-container&quot;&gt;\$+x\$&lt;/span&gt; direction to simplify our matrix. And so with some magic (rotational matrix) we can get the following:&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Step 1 - Local Stiffnes Matrix&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://wikimedia.org/api/rest_v1/media/math/render/svg/b0ba33b3ed68fb430d1f7bc0ceb7ab275bf87249&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is our local stiffness matrix, also known as &lt;span class=&quot;math-container&quot;&gt;\$K^e\$&lt;/span&gt;. It has all the same properties as our one dimensional stiffness matrix, but it takes into account &lt;span class=&quot;math-container&quot;&gt;\$(x,y)\$&lt;/span&gt; displacements at each side of the spring. This gives us a total of four degrees of freedom.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may begin to see how powerfull this method can be. We can now iterate through all of our elements and just calculate the angle and length from its nodes. This will give us &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt; local stiffness matrices, where &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt; is the number of elements. For example if we have &lt;span class=&quot;math-container&quot;&gt;\$3\$&lt;/span&gt; elements in our truss, we can calculate our &lt;span class=&quot;math-container&quot;&gt;\$3\$&lt;/span&gt; local matrices for each element.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let's go through an example.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/6/63/DSMImage3.png&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we calcualted the local stiffness matrices for the figure above (&lt;span class=&quot;math-container&quot;&gt;\$EA = 1\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$L(1,2)=1\$&lt;/span&gt;), you would find:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\hspace{50pt}\begin{array}{cccc}1 &amp;amp; 2 &amp;amp; 3 &amp;amp; 4\\\end{array} \\&#xA;K(1) = &#xA;\begin{array}{c}&#xA;1 \\&#xA;2 \\&#xA;3 \\&#xA;4 \\&#xA;\end{array}&#xA;\left[\begin{array}{cccc}&#xA;1  &amp;amp; 0 &amp;amp; -1 &amp;amp; 0\\&#xA;0  &amp;amp; 0 &amp;amp; 0  &amp;amp; 0\\&#xA;-1 &amp;amp; 0 &amp;amp; 1  &amp;amp; 0\\&#xA;0  &amp;amp; 0 &amp;amp; 0  &amp;amp; 0\\&#xA;\end{array}\right]&#xA;$$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\hspace{50pt}\begin{array}{cccc}3 &amp;amp; 4 &amp;amp; 5 &amp;amp; 6\\\end{array} \\&#xA;K(2) = &#xA;\begin{array}{c}&#xA;3 \\&#xA;4 \\&#xA;5 \\&#xA;6 \\&#xA;\end{array}&#xA;\left[\begin{array}{cccc}&#xA;0 &amp;amp; 0  &amp;amp; 0 &amp;amp; 0\\&#xA;0 &amp;amp; 1  &amp;amp; 0 &amp;amp; -1\\&#xA;0 &amp;amp; 0  &amp;amp; 0 &amp;amp; 0\\&#xA;0 &amp;amp; -1 &amp;amp; 0 &amp;amp; 1\\&#xA;\end{array}\right]&#xA;$$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\hspace{50pt}\begin{array}{cccc}1 &amp;amp; 2 &amp;amp; 5 &amp;amp; 6\\\end{array} \\&#xA;K(3) = &#xA;\begin{array}{c}&#xA;1 \\&#xA;2 \\&#xA;5 \\&#xA;6 \\&#xA;\end{array}&#xA;\left[\begin{array}{cccc}&#xA;0.64  &amp;amp; 0.48 &amp;amp; -0.64 &amp;amp; -0.48\\&#xA;0.48  &amp;amp; 0.36 &amp;amp; -0.48 &amp;amp; -0.36\\&#xA;-0.64 &amp;amp; -0.48 &amp;amp; 0.64 &amp;amp; 0.48\\&#xA;-0.48 &amp;amp; -0.36 &amp;amp; 0.48 &amp;amp; 0.36\\&#xA;\end{array}\right]&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Where the numbers outside the array correspond to the global matrix indicies.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Step 2 - Assemble local matrices into the global matrix&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;These local matricies are uncoupled, and so they don't really tell us much about the global system of the truss, or how to solve for the displacements with given forces. However, we can do something called matrix assembly to put them all into one big global stiffness matrix. This will couple all of our local element equations so we can solve our system of equations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We do this by matching the local degrees of freedom to our global degrees of freedom, then add our local to our global matrix.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since our global truss has 3 nodes and each node has &lt;span class=&quot;math-container&quot;&gt;\$2\$&lt;/span&gt; dofs &lt;span class=&quot;math-container&quot;&gt;\$(x,y)\$&lt;/span&gt;, our global matricies are of size 6. &lt;span class=&quot;math-container&quot;&gt;\$K \in \mathbb R^{6 \times 6}, F \in \mathbb R^{6 \times 1}, u \in \mathbb R^{6 \times 1}\$&lt;/span&gt;. If we layed out the dof number for each row/column of our stiffness matrix we would get the following:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\hspace{35pt}\begin{array}{cccccc}1 &amp;amp; 2 &amp;amp; 3 &amp;amp; 4 &amp;amp; 5 &amp;amp; 6\\\end{array} \\&#xA;K = &#xA;\begin{array}{c}&#xA;1 \\&#xA;2 \\&#xA;3 \\&#xA;4 \\&#xA;5 \\&#xA;6 \\&#xA;\end{array}&#xA;\left[\begin{array}{cccccc}&#xA;0 &amp;amp; 0  &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0\\&#xA;0 &amp;amp; 0  &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0\\&#xA;0 &amp;amp; 0  &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0\\&#xA;0 &amp;amp; 0  &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0\\&#xA;0 &amp;amp; 0  &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0\\&#xA;0 &amp;amp; 0  &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0\\&#xA;\end{array}\right]&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From step 1, the global dofs of &lt;span class=&quot;math-container&quot;&gt;\$k(1)\$&lt;/span&gt; were &lt;span class=&quot;math-container&quot;&gt;\$1,2,3,4\$&lt;/span&gt;. This means we just add them index by index into our global stiffness matrix.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\hspace{35pt}\begin{array}{cccc}1 &amp;amp; 2 &amp;amp; 3 &amp;amp; 4\\\end{array} \\&#xA;k(1) = &#xA;\begin{array}{c}&#xA;1 \\&#xA;2 \\&#xA;3 \\&#xA;4 \\&#xA;\end{array}&#xA;\left[\begin{array}{cccc}&#xA;k_{11} &amp;amp; k_{12}  &amp;amp; k_{13} &amp;amp; k_{14}\\&#xA;k_{21} &amp;amp; k_{22}  &amp;amp; k_{23} &amp;amp; k_{24}\\&#xA;k_{31} &amp;amp; k_{32}  &amp;amp; k_{33} &amp;amp; k_{34}\\&#xA;k_{41} &amp;amp; k_{42}  &amp;amp; k_{43} &amp;amp; k_{44}\\&#xA;\end{array}\right]&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If we match up the indicies, we can just add:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;K_{11} += k_{11}\\&#xA;K_{12} += k_{12}\\&#xA;K_{13} += k_{13}\\&#xA;K_{14} += k_{14}\\&#xA;K_{21} += k_{21}\\&#xA;...&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://wikimedia.org/api/rest_v1/media/math/render/svg/989b6490ffe51570f6c665bafea94fa8f1d21790&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We can see if we do this for all three elements, we can match up where they will go in the global matrix with colors. This is shown in the figure below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/IbGCG.png&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Step 3 - Add bounds on the stiffness matrix, and modify the force vector&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/b/b2/DSMImage5.png&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We are almost done! But there is one final important step. If we were given an arbitrary force vector and tried to find the displacements, our truss would just fly away to infinity. This is because there are no boundary conditions! There is nothing yet holding on to it, resisting the forces. But guess what? There's another neat trick we can use. This will keep everything in matrix form and give us the answers we want when we solve our system of equations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All we do is remove the influence of the node on the force vector. For this example, we will assume the constraint on dof1 is set to &lt;span class=&quot;math-container&quot;&gt;\$g\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the general case, we just set &lt;span class=&quot;math-container&quot;&gt;\$dof1 = g\$&lt;/span&gt; in the force vector, and subtract g* the column of &lt;span class=&quot;math-container&quot;&gt;\$K\$&lt;/span&gt; with dof1 = 0. If &lt;span class=&quot;math-container&quot;&gt;\$g=0\$&lt;/span&gt;, we just need to set &lt;span class=&quot;math-container&quot;&gt;\$dof1 = 0\$&lt;/span&gt; in the force vector.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;F = &#xA;\left[\begin{array}{c}&#xA;F_1\\&#xA;F_2\\&#xA;F_3\\&#xA;\vdots\\&#xA;F_n\\&#xA;\end{array}\right] \Rightarrow&#xA;\left[\begin{array}{c}&#xA;g\\&#xA;F_2\\&#xA;F_3\\&#xA;\vdots\\&#xA;F_n\\&#xA;\end{array}\right] - g&#xA;\left[\begin{array}{c}&#xA;0\\&#xA;K_{21}\\&#xA;K_{31}\\&#xA;\vdots\\&#xA;K_{n1}\\&#xA;\end{array}\right]&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then we just restrain our stiffness matrix. This can be done by zeroing out the row and column of &lt;span class=&quot;math-container&quot;&gt;\$dof1\$&lt;/span&gt;, then setting &lt;span class=&quot;math-container&quot;&gt;\$(dof1,dof1)=1\$&lt;/span&gt; as shown below.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;K = &#xA;\left[\begin{array}{cccc}&#xA;K_{11} 		&amp;amp; K_{12}  	&amp;amp; \cdots &amp;amp; K_{1n}\\&#xA;K_{21} 		&amp;amp; K_{22}  	&amp;amp; \cdots &amp;amp; K_{2n}\\&#xA;\vdots 		&amp;amp; \vdots  	&amp;amp; \ddots &amp;amp; \vdots\\&#xA;K_{n1} 		&amp;amp; K_{n2}  	&amp;amp; \cdots &amp;amp; K_{nn}\\&#xA;\end{array}\right] \Rightarrow&#xA;\left[\begin{array}{cccc}&#xA;1 		&amp;amp; 0  		&amp;amp; \cdots &amp;amp; 0\\&#xA;0 		&amp;amp; K_{22}  	&amp;amp; \cdots &amp;amp; K_{2n}\\&#xA;\vdots 	&amp;amp; \vdots  	&amp;amp; \ddots &amp;amp; \vdots\\&#xA;0 		&amp;amp; K_{n2}  	&amp;amp; \cdots &amp;amp; K_{nn}\\&#xA;\end{array}\right]&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Step 4 - Solve with linear algebra&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Now we are finally back to our equation of a spring. However, in this case each variable below is an array or vector of size &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is the number of &lt;span class=&quot;math-container&quot;&gt;\$nodes \times 2\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\mathbf{K} \cdot \mathbf{u} = \mathbf{F}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We can simply solve this system of equations by taking the inverse of the stiffness matrix. This gives us:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\mathbf{u} = \mathbf{K}^{-1} \cdot \mathbf{F}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This can be easily solved by a computer. For example Python:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;    u = np.linalg.solve(K, F)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input data type can for the most part be changed for your needs. However, it should be human-readable, or at least reasonable to be able to change the input for a new structure easily.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Example input&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;E = .&#xA;A = .&#xA;nodes = [., ., ...]&#xA;elements = [., ., ...]&#xA;forces = [., ., ...]&#xA;bounds = [., ., ...]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Example output&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[., ., ...]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output can be in any form, as long as it's in order of dof.&lt;/li&gt;&#xA;&lt;li&gt;Inbuilt FEM functions not allowed. You must construct and assemble your matrices yourself. Inbuilt linear algebra is fine.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;From UNM example in references:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;E = 29500&#xA;A = 1&#xA;nodes = [[0,0],[40,0],[40,30],[0,30]]&#xA;elements = [[1,2],[2,3],[1,3],[3,4]]&#xA;forces = [[0,0],[20,0],[0,-25],[0,0]]&#xA;bounds = [[0,0],[None,0],[None,None],[0,0]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[0.0 0.0 0.027 0.0 0.006 -0.022 0.0 0.0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Large Truss Input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;E = 29000&#xA;A = 25&#xA;nodes = [[0,0],[100,0],[200,0],[300,0],[0,100],[100,100],[200,100],[300,100],[400,100]]&#xA;elements = [[1,2],[1,5],[1,6],[2,3],[2,6],[2,7],[3,4],[3,7],[3,8],[4,8],[4,9],[5,6],[6,7],[7,8],[8,9]]&#xA;forces = [[0,-10],[0,-10],[0,-10],[0,-10],[0,0],[0,0],[0,0],[0,0],[0,-10]]&#xA;bounds = [[0,0],[None,None],[None,None],[None,None],[-0.01,0],[None,None],[None,None],[None,None],[None,None]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[ 0.     0.    -0.008 -0.025 -0.012 -0.061 -0.014 -0.1   -0.01   0.     0.004 -0.019  0.012 -0.057  0.016 -0.098  0.018 -0.136]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here is what the geometry and displacement looks like for the test cases so you can visualize it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/p7nwu.png&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/t2gEA.png&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;References&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Here are some references that may be useful if you are looking for some more in-depth information.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.unm.edu/~bgreen/ME360/Finite%20Element%20Truss.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://www.unm.edu/~bgreen/ME360/Finite%20Element%20Truss.pdf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://engineering.purdue.edu/~aprakas/CE474/CE474-Ch5-StiffnessMethod.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://engineering.purdue.edu/~aprakas/CE474/CE474-Ch5-StiffnessMethod.pdf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://people.duke.edu/~hpgavin/cee421/truss-method.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://people.duke.edu/~hpgavin/cee421/truss-method.pdf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://ocw.ump.edu.my/pluginfile.php/9806/mod_resource/content/2/7_Plane_Truss_Example.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://ocw.ump.edu.my/pluginfile.php/9806/mod_resource/content/2/7_Plane_Truss_Example.pdf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://nptel.ac.in/content/storage2/courses/105105109/pdf/m4l24.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://nptel.ac.in/content/storage2/courses/105105109/pdf/m4l24.pdf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And lastly, here is some working python 3 code that I wrote. It should lay out all the steps cleanly.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;import numpy as np&#xA;from math import sqrt,sin,cos,acos&#xA;&#xA;def ex_unm():&#xA;    &quot;&quot;&quot;Example - Verification from UNM&quot;&quot;&quot;&#xA;    print(&quot;Example UNM&quot;)&#xA;    # Material Properties&#xA;    E = 29500 # (units = ksi)&#xA;    A = 1 # (units = in^2)&#xA;    # Node locations (units = in)&#xA;    nodes = {1:(0,0), 2:(40,0), 3:(40,30), 4:(0,30)}&#xA;    # Element connections&#xA;    elements = {1:(1,2), 2:(3,2), 3:(1,3), 4:(4,3)}&#xA;    # Nodal forces (units = kips)&#xA;    forces = {2:(20,0), 3:(0,-25)}&#xA;    # Nodal Boundaries (units = in)&#xA;    bounds = {1:{'x':0,'y':0},2:{'y':0},4:{'x':0,'y':0}}&#xA;    # Run Analysis&#xA;    displacements = analyze(E,A,nodes,elements,forces,bounds)&#xA;    for i,disp in enumerate(displacements):&#xA;        print(&quot;Node {},{}: {}&quot;.format(int(i/2)+1,['x','y'][i%2],round(disp,5)))&#xA;&#xA;    plot_truss(nodes, elements, displacements, 200)&#xA;&#xA;def ex_big_boi():&#xA;    &quot;&quot;&quot;Example - Large Truss&quot;&quot;&quot;&#xA;    print(&quot;Example BIG BOI&quot;)&#xA;    # Material Properties&#xA;    E = 29000 # (units = ksi)&#xA;    A = 25 # (units = in^2)&#xA;    # Node locations (units = in)&#xA;    nodes = {1:(0,0), 2:(100,0), 3:(200,0), 4:(300,0),&#xA;        5:(0,100), 6:(100,100), 7:(200,100), 8:(300,100), 9:(400,100)}&#xA;    # Element connections&#xA;    elements = {1:(1,2), 2:(1,5), 3:(1,6),&#xA;        4:(2,3), 5:(2,6), 6:(2,7),&#xA;        7:(3,4), 8:(3,7), 9:(3,8),&#xA;        10:(4,8), 11:(4,9),&#xA;        12:(5,6), 13:(6,7), 14:(7,8), 15:(8,9)}&#xA;    # Nodal forces (units = kips)&#xA;    forces = {1:(0,-10), 2:(0,-10), 3:(0,-10), 4:(0,-10), 9:(0,-10)}&#xA;    # Nodal Boundaries (units = in)&#xA;    bounds = {1:{'x':0,'y':0}, 5:{'x':-0.01,'y':0}}&#xA;    #bounds = {1:{'x':0,'y':0}, 5:{'x':0,'y':0}}&#xA;    # Run Analysis&#xA;    displacements = analyze(E,A,nodes,elements,forces,bounds)&#xA;    for i,disp in enumerate(displacements):&#xA;        print(&quot;Node {},{}: {}&quot;.format(int(i/2)+1,['x','y'][i%2],round(disp,5)))&#xA;&#xA;    plot_truss(nodes, elements, displacements, 500)&#xA;&#xA;&#xA;&quot;&quot;&quot;Visualization, not really needed but may be good to see&quot;&quot;&quot;&#xA;import matplotlib.pyplot as plt&#xA;&#xA;def plot_truss(nodes, elements, u, scale):&#xA;    &quot;&quot;&quot;A very simple plot to show geometry and displacements of nodes&quot;&quot;&quot;&#xA;    x = [coords[0] for node,coords in nodes.items()]&#xA;    y = [coords[1] for node,coords in nodes.items()]&#xA;    ux = x + u[::2] * scale&#xA;    uy = y + u[1::2]* scale&#xA;&#xA;    fig,ax = plt.subplots()&#xA;    # Plot original Points&#xA;    ax.plot(x,y,'o',color=(0.5,0.5,0.5))&#xA;    # Plot original Elements (Theres probably a better way to do this)&#xA;    for element,eleNodes in elements.items():&#xA;        ex = [x[i-1] for i in eleNodes]&#xA;        ey = [y[i-1] for i in eleNodes]&#xA;        ax.plot(ex,ey,color=(0.5,0.5,0.5))&#xA;&#xA;    # Plot displaced Points&#xA;    ax.plot(ux,uy,'o',color=(0,0,1))&#xA;    # Plot displaced Elements (Theres probably a better way to do this)&#xA;    for element,eleNodes in elements.items():&#xA;        ex = [ux[i-1] for i in eleNodes]&#xA;        ey = [uy[i-1] for i in eleNodes]&#xA;        ax.plot(ex,ey,color=(0,0,1))&#xA;&#xA;    # Make plot have same xy scale&#xA;    ax.axis('equal')&#xA;    #fig.tight_layout()&#xA;    ax.set_title(&quot;Truss Geometry and Displacement, Scale = {}&quot;.format(scale))&#xA;&#xA;&#xA;&#xA;&#xA;&#xA;&#xA;&#xA;def analyze(E, A, nodes, elements, forces, bounds):&#xA;    &quot;&quot;&quot;Analyze a given system and return the nodal displacements&quot;&quot;&quot;&#xA;    # Assemble global matricies&#xA;    K = gen_global_K(E,A,nodes,elements)&#xA;    F = gen_global_F(nodes,forces)&#xA;    # Add bounds to matricies&#xA;    #F = restrain_stiffness(K, F, bounds)&#xA;    restrain_stiffness(K, F, bounds)&#xA;    # Solve K*u=F -&amp;gt; u=K^-1*F&#xA;    u = np.linalg.solve(K, F)&#xA;    # return the nodal displacements&#xA;    return u&#xA;&#xA;def gen_global_K(E, A, nodes, elements):&#xA;    &quot;&quot;&quot;Generate the Global stiffness Matrix&quot;&quot;&quot;&#xA;    # Initialize Global Stiffness Matrix&#xA;    size = len(nodes)*2&#xA;    K = np.zeros([size,size])&#xA;&#xA;    # Itterate through each element and add its local stiffness to global stiffness&#xA;    for element,(node_1,node_2) in elements.items():&#xA;        node_1_xy = nodes[node_1]&#xA;        node_2_xy = nodes[node_2]&#xA;        # Element length&#xA;        L = sqrt((node_2_xy[0]-node_1_xy[0])**2 + (node_2_xy[1]-node_1_xy[1])**2)&#xA;        # Get this element's local stiffness roated into global plane&#xA;        K_local = (E*A/L) * gen_local_K(node_1_xy, node_2_xy)&#xA;        # Assemble local matrix into global &#xA;        assemble(K, K_local, node_1, node_2)&#xA;    return K&#xA;&#xA;def gen_local_K(n1, n2):&#xA;    &quot;&quot;&quot;Create a local stiffness matrix from two nodes' angle&quot;&quot;&quot;&#xA;    angle = gen_angle(n1,n2)&#xA;    c  = cos(angle)**2&#xA;    s  = sin(angle)**2&#xA;    cs = cos(angle) * sin(angle)&#xA;    # Create the local K matrix&#xA;    K_local = np.array([[ c , cs,-c ,-cs],&#xA;                        [ cs, s ,-cs,-s ],&#xA;                        [-c ,-cs, c , cs],&#xA;                        [-cs,-s , cs, s ]])&#xA;    return K_local&#xA;&#xA;def gen_angle(n1, n2):&#xA;    &quot;&quot;&quot;Find angle between two nodes and +x axis&quot;&quot;&quot;&#xA;    v1 = np.array([n2[0]-n1[0],n2[1]-n1[1]])&#xA;    v2 = np.array([1,0])&#xA;    return acos(np.dot(v1,v2) / (np.linalg.norm(v1) * np.linalg.norm(v2)))&#xA;&#xA;def assemble(K, K_local, n1, n2):&#xA;    &quot;&quot;&quot;Assemble a local element stiffness matrix into the global stiffness&quot;&quot;&quot;&#xA;    # Degrees of freedom of our local element&#xA;    dofs = [2*(n1-1), 2*(n1-1)+1, 2*(n2-1), 2*(n2-1)+1]&#xA;    # Go element by element to add matrix&#xA;    for i_local,i_global in enumerate(dofs):&#xA;        for j_local,j_global in enumerate(dofs):&#xA;            K[i_global,j_global] += K_local[i_local,j_local]&#xA;&#xA;def gen_global_F(nodes, forces):&#xA;    &quot;&quot;&quot;Generate the global force vector&quot;&quot;&quot;&#xA;    F = np.zeros(2*len(nodes))&#xA;    for node,(f_x,f_y) in forces.items():&#xA;        dof = 2*(node-1)&#xA;        F[dof] = f_x&#xA;        F[dof+1] = f_y&#xA;    return F&#xA;&#xA;def restrain_stiffness(K, F, bounds):&#xA;    &quot;&quot;&quot;Use a given displacement bound to modify matricies&quot;&quot;&quot;&#xA;    dir = {'x':0, 'y':1}&#xA;    for node,this_bound in bounds.items():&#xA;        for coord,disp in this_bound.items():&#xA;            # Get what dof the bound is&#xA;            dof = (node-1)*2 + dir[coord]&#xA;            add_disp(K, F, disp, dof)&#xA;&#xA;def add_disp(K, F, disp, n):&#xA;    &quot;&quot;&quot;Move the fixed displacement over to F (since it's constant)&quot;&quot;&quot;&#xA;    # Get displaced F by reducing by given displacement * stiffness column&#xA;    # Must use -= to ensure python evaluates in-place&#xA;    #   We don't need to return the array if it's passed by reference&#xA;    F -= disp * K[:,n]&#xA;    # Set the Force value at that dof to the given displacment&#xA;    F[n] = disp&#xA;    # Clear stiffness matrix dof row &amp;amp; col&#xA;    add_bound(K, n)&#xA;&#xA;def add_bound(K, n):&#xA;    &quot;&quot;&quot;Zero out row and col of dof, then make [n,n] = 1&quot;&quot;&quot;&#xA;    for i in range(np.size(K,0)):&#xA;        K[n,i] = 0&#xA;        K[i,n] = 0&#xA;    K[n,n] = 1&#xA;&#xA;if __name__ == &quot;__main__&quot;:&#xA;    # Set print options if you want to print an array nicely (easier for debug)&#xA;    np.set_printoptions(precision=2, suppress=True, linewidth=np.inf)&#xA;    ex_unm()&#xA;    ex_big_boi()&#xA;&#xA;    plt.show()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Good Luck!&lt;/p&gt;&#xA;" OwnerUserId="81436" LastEditorUserId="24877" LastEditDate="2019-12-28T14:22:55.917" LastActivityDate="2019-12-28T14:22:55.917" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18400" PostTypeId="2" ParentId="2140" CreationDate="2019-12-27T17:35:51.987" Score="0" Body="&lt;h1&gt;Potentially Prime Punch-Card Patterns &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Punch-cards&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Let us define a punch-card to be a set of 'open' and 'closed' holes which can slide over the positive integer number line:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&#xA;    _________________________&#xA;   |   ___     ___     ___   | --&gt;&#xA;   |  |   |   |   |   |   |  |&#xA;1  |  | 3 |   | 5 |   | 7 |  |  9   10  11  12  13  14&#xA;   |  |___|   |___|   |___|  |&#xA;   |_________________________| --&gt;&#xA;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;When the first open hole is on the integer &lt;span class=&quot;math-container&quot;&gt;\$ p \$&lt;/span&gt;, then this punchcard (as it slides across the number line) yields the integers &lt;span class=&quot;math-container&quot;&gt;\$p, p+2,\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$p+4\$&lt;/span&gt;. So, we can represent this card as the set &lt;span class=&quot;math-container&quot;&gt;\$\{0, 2, 4\}\$&lt;/span&gt;. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Admissibility&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a punch-card we may wonder whether it is possible to slide the card to such a position that only prime numbers are under the 'open' holes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Clearly, for &lt;span class=&quot;math-container&quot;&gt;\$\{0, 2, 4\}\$&lt;/span&gt;, we can position the punch-card to make 3, 5, and 7 visible. However, this is the only solution. Taking each element modulo 3  yields &lt;span class=&quot;math-container&quot;&gt;\$\{0, 2, 1\}\$&lt;/span&gt;, which contains every possible remainder under division by 3, so one visible integer must be divisible by 3. But we only want primes, and so 3 itself must be visible; this leaves a finite number of possible positions, of which only one is a valid solution.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;More generally, if there exists a prime &lt;span class=&quot;math-container&quot;&gt;\$q\$&lt;/span&gt; such that &lt;strong&gt;every&lt;/strong&gt; integer &lt;span class=&quot;math-container&quot;&gt;\$0 \le n &amp;lt; q\$&lt;/span&gt; appears in the punch-card set modulo &lt;span class=&quot;math-container&quot;&gt;\$q\$&lt;/span&gt;, then the punch-card is &lt;strong&gt;inadmissible&lt;/strong&gt; and has a finite number of positions where all visible integers are prime: as we are bounded by the condition that &lt;span class=&quot;math-container&quot;&gt;\$q\$&lt;/span&gt; must be visible. We can place &lt;span class=&quot;math-container&quot;&gt;\$q\$&lt;/span&gt; in each hole in turn, and perform primality tests to count the valid solutions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, if there exists no such &lt;span class=&quot;math-container&quot;&gt;\$q\$&lt;/span&gt;, then the punch-card is &lt;strong&gt;admissible&lt;/strong&gt; and we cannot assume there are finite solutions; the &lt;a href=&quot;http://mathworld.wolfram.com/k-TupleConjecture.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;K-Tuple Conjecture&lt;/a&gt; in fact hypothesizes that every admissible punch-card can assume &lt;strong&gt;infinitely many&lt;/strong&gt; positions where all visible integers are prime.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your task is to write a program or function which, given a list of ordered positive integers representing a punch-card set, outputs the number of positions the punch-card can assume where all visible integers are prime. If the set is admissible, then give a distinct output such as &lt;code&gt;-1&lt;/code&gt;, &lt;code&gt;null&lt;/code&gt;, &lt;code&gt;Inf&lt;/code&gt; - anything that is not a non-negative integer.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Coming soon.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There is a related challenge - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/89786/testing-for-admissible-sequences&quot;&gt;testing for admissible sequences&lt;/a&gt;. However, I believe this is distinct enough to be a duplicate as rather than being a simple &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;, if a set is admissible this program will have to then try different positions of the punch-card and count the valid solutions; whereas the previous challenge considers admissible sets in isolation, this challenge applies it to prime numbers.&lt;/p&gt;&#xA;" OwnerUserId="60919" LastEditorUserId="60919" LastEditDate="2019-12-28T05:45:38.460" LastActivityDate="2019-12-28T05:45:38.460" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18401" PostTypeId="2" ParentId="2140" CreationDate="2019-12-28T13:33:56.030" Score="2" Body="&lt;h2&gt;Title: When is Hannukah?&lt;/h2&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The input will be a year between 1583 and 2250.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The Gregorian date of the first &lt;strong&gt;evening&lt;/strong&gt; of Hannukah that year. That is the day before the first full day of Hannukah.  Your code should output the month and day of the month in any easy to understand human readable form of your choice.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2013    November 27 &#xA;2014    December 16&#xA;2015    December 6  &#xA;2016    December 24 &#xA;2017    December 12 &#xA;2018    December 2  &#xA;2019    December 22&#xA;2020    December 10 &#xA;2021    November 28 &#xA;2022    December 18&#xA;2023    December 7  &#xA;2024    December 25 &#xA;2025    December 14 &#xA;2026    December 4  &#xA;2027    December 24&#xA;2028    December 12 &#xA;2029    December 1  &#xA;2030    December 20 &#xA;2031    December 9  &#xA;2032    November 27 &#xA;2033    December 16&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;How do you do this?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It could hardly be simpler. We start with a couple of definitions:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We define a new inline notation for the division remainder of &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; when divided by &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt;: &lt;span class=&quot;math-container&quot;&gt;$$(x|y)=x \bmod y$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For any year Gregorian year &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt;, the &lt;em&gt;Golden Number&lt;/em&gt;,&#xA;&lt;span class=&quot;math-container&quot;&gt;$$G(y) = (y|19) + 1$$&lt;/span&gt;&#xA;For example, &lt;span class=&quot;math-container&quot;&gt;\$G(1996)=2\$&lt;/span&gt; because &lt;span class=&quot;math-container&quot;&gt;\$(1996|19)=1\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To find &lt;span class=&quot;math-container&quot;&gt;\$H(y)\$&lt;/span&gt;, the first evening of Hannukah in the year &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt;, we need to find &lt;span class=&quot;math-container&quot;&gt;\$R(y)\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$R(y+1)\$&lt;/span&gt;, the day of September where &lt;em&gt;Rosh Hashanah&lt;/em&gt; falls in &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt; and in &lt;span class=&quot;math-container&quot;&gt;\$y+1\$&lt;/span&gt;. Note that September &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$n≥31\$&lt;/span&gt; is actually October &lt;span class=&quot;math-container&quot;&gt;\$n-30\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$R(y)=⌊N(y)⌋ + P(y)$$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$⌊x⌋\$&lt;/span&gt; denotes &lt;span class=&quot;math-container&quot;&gt;\$x-(x|1)\$&lt;/span&gt;, the integer part of &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;, and&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$N(y)= \Bigl \lfloor \frac{y}{100} \Bigr \rfloor - \Bigl \lfloor \frac{y}{400} \Bigr \rfloor - 2 + \frac{765433}{492480}\big(12G(y)|19\big) + \frac{(y|4)}4 - \frac{313y+89081}{98496}$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We define &lt;span class=&quot;math-container&quot;&gt;\$D_y(n)\$&lt;/span&gt; as the day of the week (with Sunday being &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;) that September &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; falls on in the year &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt;. Further, Rosh Hashanah has to be postponed by a number of days which is&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$P(y)=\begin{cases}&#xA;1,  &amp;amp;  \text{if } D_y\big(\lfloor N(y)\rfloor \big)\in\{0,3,5\}  &amp;amp;  (1)\\&#xA;1,  &amp;amp;  \text{if } D_y\big(\lfloor N(y)\rfloor\big)=1&#xA; \text{ and } (N(y)|1)≥\frac{23269}{25920}&#xA; \text{ and } \big(12G(y)|19\big)&amp;gt;11  &amp;amp;  (2)\\&#xA;2,  &amp;amp;  \text{if } D_y\big(\lfloor N(y)\rfloor \big)=2 \text{ and } (N(y)|1)≥\frac{1367}{2160} \text{ and } (12G(y)|19)&amp;gt;6  &amp;amp;  (3)\\&#xA;0,  &amp;amp;  \text{otherwise}  &amp;amp;  (4)&#xA;\end{cases}$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, in &lt;span class=&quot;math-container&quot;&gt;\$y=1996\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$G(y)=2\$&lt;/span&gt;, so the &lt;span class=&quot;math-container&quot;&gt;\$N(y)\approx13.5239\$&lt;/span&gt;. However, since September 13 in 1996 was a Friday, by Rule &lt;span class=&quot;math-container&quot;&gt;\$(1)\$&lt;/span&gt;, we must postpone by &lt;span class=&quot;math-container&quot;&gt;\$P(y)=1\$&lt;/span&gt; day, so Rosh Hashanah falls on Saturday, September 14.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$L(y)\$&lt;/span&gt; be the number of days between September &lt;span class=&quot;math-container&quot;&gt;\$R(y)\$&lt;/span&gt; in the year &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt; and September &lt;span class=&quot;math-container&quot;&gt;\$R(y+1)\$&lt;/span&gt; in year &lt;span class=&quot;math-container&quot;&gt;\$y+1\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first evening of Hannukah is:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;H(y)=\begin{cases}&#xA;83\text{ days after }R(y) &amp;amp; \text{if } L(y)\in\{355,385\}\\&#xA;82\text{ days after }R(y) &amp;amp; \text{otherwise}&#xA;\end{cases}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Notes and thanks&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Thank you to @Adám for pointing me to the rules. To keep things simple, this challenge assumes the location to be Jerusalem.&lt;/p&gt;&#xA;" OwnerDisplayName="user9207" LastEditorDisplayName="user9207" LastEditDate="2020-01-03T20:14:11.883" LastActivityDate="2020-01-03T20:14:11.883" CommentCount="22" ContentLicense="CC BY-SA 4.0" />
  <row Id="18402" PostTypeId="2" ParentId="2140" CreationDate="2019-12-28T14:05:33.187" Score="0" Body="&lt;h1&gt;How many ways can I count on n?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;By using addition of natural numbers &lt;code&gt;{1, 2, 3...}&lt;/code&gt; and multiplication of natural numbers &lt;em&gt;larger than 1&lt;/em&gt;, we can reach the same outcome in several ways. For example &lt;code&gt;4 = 2 x 2&lt;/code&gt; but also: &lt;code&gt;4 = 2 + 1 + 1&lt;/code&gt;. Using &lt;a href=&quot;https://en.wikipedia.org/wiki/Order_of_operations&quot; rel=&quot;nofollow noreferrer&quot;&gt;normal mathematical operator precedence&lt;/a&gt;, there are actually 6 ways to express 4 and 9 ways to express 5.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since addition is commutative, &lt;code&gt;a + b&lt;/code&gt; is counted as the same solution as &lt;code&gt;b + a&lt;/code&gt;. The same holds for multiplication. So &lt;code&gt;7 = 1 + 2 x 3&lt;/code&gt; is the same solution as &lt;code&gt;7 = 3 x 2 + 1&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The (trivial) solution &lt;code&gt;n&lt;/code&gt; (using no addition or multiplication) is also counted as one of the solutions of &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Multiplication with &lt;code&gt;1&lt;/code&gt; is forbidden, because you can do this infinitely.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For a given input &lt;code&gt;n&lt;/code&gt;, output &lt;code&gt;c(n)&lt;/code&gt;, which is defined as the number of ways &lt;code&gt;n&lt;/code&gt; can be uniquely expressed using zero, one or more additions and multiplications of natural numbers, using normal mathematical operator precedence and without multiplication with 1.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input and output are integers (your program should at least support input and output in the range of 1 up to 32767)&lt;/li&gt;&#xA;&lt;li&gt;Invalid input (0, floats, strings, negative values, etc.) may lead to unpredictable output, errors or (un)defined behaviour.&lt;/li&gt;&#xA;&lt;li&gt;Default &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;I/O rules&lt;/a&gt; apply.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Default loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answers in bytes wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Final note&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I can think of several ways to approach this problem. I think it's interesting to see how the different approaches impact the length of the solution.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox questions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Please let me know if this task/problem is stated clear enough.&lt;/li&gt;&#xA;&lt;li&gt;Please let me know if there are any loopholes that I should cover in the question.&lt;/li&gt;&#xA;&lt;li&gt;I intentionally omitted more examples (because I hope contesters will think about solutions rather than just reproduce an OEIS sequence; although I'm not sure if this question had an OEIS sequence).&lt;/li&gt;&#xA;&lt;li&gt;I will tag this question with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="32381" LastActivityDate="2019-12-28T14:05:33.187" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18404" PostTypeId="2" ParentId="2140" CreationDate="2019-12-30T09:02:59.187" Score="0" Body="&lt;h2&gt;Morse with Binary &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/morse&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;morse&amp;#39;&quot; rel=&quot;tag&quot;&gt;morse&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary&amp;#39;&quot; rel=&quot;tag&quot;&gt;binary&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For every input string (&lt;strong&gt;in ASCII, containing only lowercase alphabetic characters&lt;/strong&gt;), output the &lt;em&gt;alphabetic&lt;/em&gt; string converted from Morse code to Binary code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this case we are assuming that &lt;code&gt;.&lt;/code&gt; is 0 and &lt;code&gt;-&lt;/code&gt; is 1.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;How to do the conversion&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For reference, here are a few Morse code libraries:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a .-&#xA;b -...&#xA;c -.-.&#xA;d -..&#xA;e .&#xA;f ..-.&#xA;g --.&#xA;h ....&#xA;i ..&#xA;j .---&#xA;k -.-&#xA;l .-..&#xA;m --&#xA;n -.&#xA;o ---&#xA;p .--.&#xA;q --.-&#xA;r .-.&#xA;s ...&#xA;t -&#xA;u ..-&#xA;v ...-&#xA;w .--&#xA;x -..-&#xA;y -.--&#xA;z --..&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;What's amazing about those codes is that the code length never exceeds 4 codes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And now we are trying to cofuse binary with Morse code. First let's convert &lt;code&gt;sample&lt;/code&gt; to morse code:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;... .- -- .--. .-.. .&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And consider the whole thing as a binary:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.... ---. --.. -...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here is an alternative table for mapping the characters:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a ....&#xA;b ...-&#xA;c ..-.&#xA;d ..--&#xA;e .-..&#xA;f .-.-&#xA;g .--.&#xA;h .---&#xA;i -...&#xA;j -..-&#xA;k -.-.&#xA;l -.--&#xA;m --..&#xA;n --.-&#xA;o ---.&#xA;p ----&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The result of this operation, after conversion, is &lt;code&gt;aomi&lt;/code&gt;. You are never going to end up with a letter past &lt;code&gt;p&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2020-01-01T04:23:41.460" LastActivityDate="2020-01-01T04:23:41.460" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18405" PostTypeId="2" ParentId="2140" CreationDate="2019-12-30T16:39:05.590" Score="-1" Body="&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;This challenge was inspired by the &lt;a href=&quot;https://en.wikipedia.org/wiki/24_Game&quot; rel=&quot;nofollow noreferrer&quot;&gt;24 Game&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;In the 24 Game, you are given 4 numbers and are asked to make 24 using addition, subtraction, multiplication, division, and parentheses. So...&lt;/p&gt;&#xA;&lt;p&gt;What is the biggest number you can make given 4 numbers using the above operations?&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;For four given inputs &lt;code&gt;a, b, c, d&lt;/code&gt;, output the biggest number you can get using addition, subtraction, multiplication, division, and parentheses.&lt;/p&gt;&#xA;&lt;p&gt;This is code-golf, so the shortest answer wins.&lt;/p&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;  Input  --&amp;gt;  Output  --&amp;gt;   Explanation&#xA; 1,3,2,4 --&amp;gt;    36    --&amp;gt; (1 + 2) × 3 × 4&#xA; 5,5,5,5 --&amp;gt;   625    --&amp;gt;  5 × 5 × 5 × 5&#xA; 9,2,3,1 --&amp;gt;    81    --&amp;gt; (1 + 2) × 3 × 9&#xA; &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Please give feedback on this challenge and correct me if my outputs are wrong. Should I change it to the smallest number?&lt;/p&gt;&#xA;" OwnerUserId="91262" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-01-04T21:11:55.053" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="18407" PostTypeId="1" CreationDate="2020-01-01T03:28:18.420" Score="8" ViewCount="228" Body="&lt;p&gt;It's New Year's Day in &lt;a href=&quot;https://en.wikipedia.org/wiki/Zulu_Time&quot; rel=&quot;nofollow noreferrer&quot;&gt;Stack Exchange land&lt;/a&gt;...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A distinguishing characteristic of these sites is how they are moderated:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;We designed the Stack Exchange network engine to be mostly self-regulating, in that we amortize the overall moderation cost of the system across thousands of teeny-tiny slices of effort contributed by regular, everyday users.&lt;br&gt;&#xA;  -- &lt;a href=&quot;http://blog.stackoverflow.com/2009/05/a-theory-of-moderation/&quot;&gt;A Theory of Moderation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;While there certainly are &lt;a href=&quot;https://stackoverflow.blog/2018/11/21/our-theory-of-moderation-re-visited/&quot;&gt;Moderators&lt;/a&gt; here, a significant amount of the &lt;em&gt;moderation&lt;/em&gt; is done by ordinary people, using the privileges &#xA;they've earned by virtue of their contributions to the site. Each of you contributes a little bit of time and effort, and together you accomplish much.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As we enter a new year, let's pause and reflect, taking a moment to appreciate the work that we do here together. &#xA;And what could be more festive than a big pile of numbers? &#xA;So here is a breakdown of moderation actions performed on Code Golf over the past 12 months:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;                 Action                  Moderators Community¹&#xA;---------------------------------------- ---------- ----------&#xA;Users suspended²                                  0         39&#xA;Users destroyed³                                 11          0&#xA;Users contacted                                   2          0&#xA;Tasks reviewed⁴: Suggested Edit queue             7        937&#xA;Tasks reviewed⁴: Reopen Vote queue                0        625&#xA;Tasks reviewed⁴: Low Quality Posts queue          0        675&#xA;Tasks reviewed⁴: Late Answer queue                0        486&#xA;Tasks reviewed⁴: First Post queue                 1        937&#xA;Tasks reviewed⁴: Close Votes queue                0        929&#xA;Tag synonyms created                              0          1&#xA;Questions unprotected                             5         13&#xA;Questions reopened                                9         82&#xA;Questions protected                               0         26&#xA;Questions migrated                                0          2&#xA;Questions flagged⁵                                5        550&#xA;Questions closed                                 45        490&#xA;Question flags handled⁵                         214        339&#xA;Posts unlocked                                    0          1&#xA;Posts undeleted                                   6        654&#xA;Posts locked                                      0         68&#xA;Posts deleted⁶                                  214      1,976&#xA;Posts bumped                                      0          9&#xA;Comments undeleted                               32          0&#xA;Comments flagged                                  1        583&#xA;Comments deleted⁷                             2,741      7,605&#xA;Comment flags handled                           455        125&#xA;Answers flagged                                  14        872&#xA;Answer flags handled                            458        423&#xA;All comments on a post moved to chat             18          0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Footnotes&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;¹ &quot;Community&quot; here refers both to &lt;a href=&quot;https://codegolf.stackexchange.com/users&quot;&gt;the membership of Code Golf&lt;/a&gt; &lt;em&gt;without&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=moderators&quot;&gt;diamonds next to their names&lt;/a&gt;, and to the automated systems otherwise known as &lt;a href=&quot;https://codegolf.stackexchange.com/users/-1&quot;&gt;user #-1&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;² The system will suspend users under three circumstances: when a user is recreated after being previously suspended, when a user is recreated after being destroyed for spam or abuse, and when a network-wide suspension is in effect on an account.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;³ A &quot;destroyed&quot; user is deleted along with all that they had posted: questions, answers, comments. &lt;a href=&quot;https://meta.stackexchange.com/questions/88994/what-is-the-difference-between-a-deleted-user-and-a-destroyed-user&quot;&gt;Generally used as an expedient way of getting rid of spam.&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;⁴ This counts every review that was submitted (not skipped) - so the 2 suggested edits reviews needed to approve an edit would count as 2, the goal being to indicate the frequency of moderation actions. This also applies to flags, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;⁵ Includes close flags (but &lt;em&gt;not&lt;/em&gt; close or reopen votes).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;⁶ This ignores numerous deletions that happen automatically in response to some other action.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;⁷ This includes comments deleted by their own authors (which also account for some number of handled comment flags).   &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Further reading:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Wanna see how these numbers have changed over time? I posted a similar report here last year: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17253/2018-a-year-in-moderation&quot;&gt;2018: a year in moderation&lt;/a&gt;...&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can also check out &lt;a href=&quot;https://stackexchange.com/search?q=title%3A%222019%3A+a+year+in+moderation%22&quot;&gt;this report on other sites&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;Or peruse &lt;a href=&quot;https://meta.stackexchange.com/questions/341507/2019-a-year-in-closing&quot;&gt;detailed information on the number of questions closed and reopened across all sites&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Wishing you all a happy new year...&lt;/p&gt;&#xA;" OwnerUserId="1144" LastEditorUserId="1144" LastEditDate="2020-01-03T02:42:04.090" LastActivityDate="2020-01-03T02:42:04.090" Title="2019: a year in moderation" Tags="|discussion|moderation|statistics|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18408" PostTypeId="2" ParentId="2140" CreationDate="2020-01-01T05:21:38.543" Score="0" Body="&lt;h1&gt;&lt;em&gt;Quine Generator Generator...&lt;/em&gt; of any* length! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/meta-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;meta-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;meta-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;A &lt;em&gt;Quine Generator Generator...&lt;/em&gt; is a quine when the input is empty or 0. Otherwise, for any other sufficiently large positive integer input, it should print a &lt;em&gt;Quine Generator Generator...&lt;/em&gt; of that specified length (in the same language, same options).&lt;/p&gt;&#xA;&lt;p&gt;Let S be the (most likely theoretically infinite) set of &lt;em&gt;Quine Generator Generator...&lt;/em&gt; you can generate from your initial &lt;em&gt;Quine Generator Generator...&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your score is the smallest N such that any &lt;em&gt;Quine Generator Generator...&lt;/em&gt; in S can generate a &lt;em&gt;Quine Generator Generator...&lt;/em&gt; of length N or longer (for reasonably sized N).&lt;/p&gt;&#xA;&lt;p&gt;Input can be from standard input or as an argument of a function.&lt;/p&gt;&#xA;&lt;p&gt;Lowest score wins.&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox Meta:&lt;/h1&gt;&#xA;&lt;p&gt;Typically, code is scored by bytes, but now the length would depend on how that is interpreted, since it is included in the description of the question. Hence would it be a problem to put: &amp;quot;You may choose to define characters in terms of bytes or characters (should they differ) for purposes of the program length and scoring purposes.&amp;quot;&lt;/p&gt;&#xA;" OwnerUserId="45643" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-01-01T05:34:04.983" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18409" PostTypeId="2" ParentId="2140" CreationDate="2020-01-01T06:09:14.603" Score="1" Body="&lt;h2&gt;Partial tq interpreter &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this task you are expected to provide a &lt;strong&gt;list&lt;/strong&gt; output given an input &lt;a href=&quot;https://github.com/A-ee/tq&quot; rel=&quot;nofollow noreferrer&quot;&gt;tq&lt;/a&gt; program. The tq programs will not contain whitespace inside them. (I find tq extremely difficult to implement within a short time, therefore I consider it to be a nice challenge.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What is tq, in the first place?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;tq is a lazy-evaluated language that is designed with the idea that array items should be accessable during the definition of them. In tq, there is no explicit separator of an array, only special arrangements of monadic/dyadic functions and nilads.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The following program is a program printing &lt;code&gt;[123]&lt;/code&gt; (Pretend that tq doesn't support strings because we aren't dealing with them in this case):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;123&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This defines a list with the first item being the number 123, after which all items in the list will be outputted inside a list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In tq, numbers are supported to allow multiple-digits. So this defines a list with 2 items:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;12+12,5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In this test case, you are expected to output the list &lt;code&gt;[24,5]&lt;/code&gt;. Let's explain it step by step.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;12+12   # This evaluates 12 + 12 in the current item in the list, returning 24&#xA;     ,  # A separator. This separates two items when they could be potentially&#xA;        # ambiguous when they are applied without a separator.&#xA;      5 # This evaluates 5 in the current item in the list, returning 5&#xA;        # The comma is simply a no-op that doesn't require parsing.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So you think that tq is not hard at all to implement? Well, remember that tq also has a special feature of accessing the items in an array before the array is defined!&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;555th123&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We introduce two new atoms:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;t&lt;/code&gt; (&lt;strong&gt;t&lt;/strong&gt;ail) means access the last item in the list&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;h&lt;/code&gt; (&lt;strong&gt;h&lt;/strong&gt;ead) means access the first item in the list&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Therefore our list is going to yield:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[555,123,555,123]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now take a look at this program:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;555ps123&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We introduce 2 more atoms:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;p&lt;/code&gt; Yield the next item &lt;em&gt;before&lt;/em&gt; (&lt;strong&gt;p&lt;/strong&gt;revious) the current position&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;s&lt;/code&gt; Yield the next item &lt;em&gt;after&lt;/em&gt; (&lt;strong&gt;s&lt;/strong&gt;ucceeding)the current position&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This yields the list:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[555,555,123,123]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;A quick reference of the tq language&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Just assume that you only have two operands for the operators.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;[0-9]&lt;/code&gt; starts a number. Numbers will &lt;em&gt;only&lt;/em&gt; be positive integers, i.e. no decimals and negative numbers.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;,&lt;/code&gt; This is a separator of different items when it is given that two consecutive indexes will be ambiguous with each other without a separator. In tq all of the remaining characters can act as a separator, but in this case it is a good idea to implement only &lt;code&gt;,&lt;/code&gt; for the ease of your implementation.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;+&lt;/code&gt; and &lt;code&gt;*&lt;/code&gt; These are arithmetic operators. Usually in tq, they may be applied multiple times, e.g. &lt;code&gt;1+2+3&lt;/code&gt;, but in your implementation, input will be provided so that this will not happen and only &lt;code&gt;1+2&lt;/code&gt; will happen (there will not be applications multiple times).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;t&lt;/code&gt; return the last item in the list. If the code is &lt;code&gt;t1,2,3&lt;/code&gt; it shall return &lt;code&gt;[3,1,2,3]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;h&lt;/code&gt; return the first item in the list. If the code is &lt;code&gt;1,2,3h&lt;/code&gt; it shall return &lt;code&gt;[1,2,3,1]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;p&lt;/code&gt; returns the item before the current item. If the code is &lt;code&gt;0,1,p,3,4&lt;/code&gt; the code shall return &lt;code&gt;[0,1,1,3,4]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;s&lt;/code&gt; returns the item after the current item. If the code is &lt;code&gt;0,1,s,3,4&lt;/code&gt; the code shall return &lt;code&gt;[0,1,3,3,4]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;More test cases&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;4p*p&lt;/code&gt; will yield &lt;code&gt;[4,16]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1p+s2&lt;/code&gt; will yield &lt;code&gt;[1,3,2]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1,2,3h+t4,5,6&lt;/code&gt; will yield &lt;code&gt;[1,2,3,7,4,5,6]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;3ppss6&lt;/code&gt; will yield &lt;code&gt;[3,3,3,6,6,6]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;You also have to implement multiple hops. E.g. &lt;code&gt;1th&lt;/code&gt; should yield &lt;code&gt;[1,1,1]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;If you know that something is going to form a loop, e.g. &lt;code&gt;1sp2&lt;/code&gt;, the cells that form the loop should be removed. Therefore the previous example will yield &lt;code&gt;[1,2]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Out of bounds indexing will yield the closest index of the indexed item &lt;strong&gt;that is a number&lt;/strong&gt;. E.g. &lt;code&gt;1,2s&lt;/code&gt; should yield &lt;code&gt;[1,2,2]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2020-01-03T10:15:18.930" LastActivityDate="2020-01-03T10:15:18.930" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18412" PostTypeId="2" ParentId="2140" CreationDate="2020-01-03T19:19:57.803" Score="0" Body="&lt;h1&gt;Integer Keys and Duplicates&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a list/vector of positive integers, write a function to check the following conditions in as few bytes as possible.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Take the first integer (the key, or k1) and check that the next k1 values have no duplicate values, excluding k1. &lt;/li&gt;&#xA;&lt;li&gt;Take the last integer (the second key, or k2) and check that the k2 values before k2 have no duplicate values, excluding k2.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Note that both keys, k1 and k2, are elements of the list/vector as either key could contain the other.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Also, k1 and/or k2 can be greater than the number of integers within the list, which means you should check every element of the list besides the given key for duplicates, excluding the key.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If both steps return True, return True, else, return False.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[5,1,2,5,3,4,3] is TRUE because [k1=5][1,2,5,3,4] has no duplicates, nor does [5,3,4] have any duplicates, excluding 3&#xA;&#xA;[6,9,12,15,18,19,8,8,3] is FALSE because [k1=6][9,12,15,18,19,8] has no duplicates while [19,8,8][k2=3] has a duplicate.&#xA;&#xA;[100,100,100,100,101,102,3] is TRUE because [k1=100][100,100,100,101,102,3] has no duplicates, and [100,101,102][k2=3] has no duplicates.&#xA;&#xA;[100,100,100,100,101,102,4] is FALSE. [k1=100][100,100,100,101,102,4] has no duplicates, but [100,100,101,102][k2=4] has duplicates.&#xA;&#xA;[6,6,6,6,6,6,6,3,3,3,3] is TRUE. [k1=6][6,6,6,6,6,6] has no duplicates and [3,3,3][k2=3] has no duplicates.&#xA;&#xA;[1,2] is TRUE (clearly)&#xA;&#xA;[1] is TRUE (clearly)&#xA;&#xA;[] the empty list is also TRUE (if you can make a valid argument why it should be FALSE then I might give it to you)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="82163" LastActivityDate="2020-01-03T19:19:57.803" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18413" PostTypeId="2" ParentId="2140" CreationDate="2020-01-04T00:59:44.687" Score="0" Body="&lt;h1&gt;Drum fill generator&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Create a program that generates a drum fill. Your program will output a pattern of &lt;code&gt;L&lt;/code&gt; (left hand hits), 'R' (right hand hits), and &lt;code&gt;K&lt;/code&gt; for kick drum hits. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The pattern must never have more than 2 of the same hits consecutively.&lt;/li&gt;&#xA;&lt;li&gt;The pattern must be loopable, so it mustn't have more than 2 of the same hits when it loops.&lt;/li&gt;&#xA;&lt;li&gt;Your program accepts 1 argument which is the length of the pattern. You can assume this will always be an integer &gt; 0.&lt;/li&gt;&#xA;&lt;li&gt;Program output must be random each time it's ran.&lt;/li&gt;&#xA;&lt;li&gt;IO can be used with any convenient method.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is code-golf, so smallest program wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example valid output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;RLRRKKLL&#xA;LRLLKKLR&#xA;LKKRLRKLRRKL&#xA;LRLR&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example invalid output:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;LRLL // 3 characters when looped&#xA;LRLRRRLLR // 3 characters in a row&#xA;RRLRLLRR // 4 characters when looped&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="25193" LastEditorUserId="25193" LastEditDate="2020-01-05T21:16:44.930" LastActivityDate="2020-01-05T21:16:44.930" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18414" PostTypeId="2" ParentId="2140" CreationDate="2020-01-04T23:40:23.037" Score="3" Body="&lt;h1&gt;Buildings made from cubes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/198175/buildings-made-from-cubes&quot;&gt;Posted to main&lt;/a&gt;; thanks for input provided!&lt;/p&gt;&#xA;" OwnerUserId="42248" LastEditorUserId="42248" LastEditDate="2020-02-03T17:35:33.580" LastActivityDate="2020-02-03T17:35:33.580" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18419" PostTypeId="2" ParentId="2140" CreationDate="2020-01-06T15:30:33.520" Score="-1" Body="&lt;h1&gt;How many ACus do I have?&lt;/h1&gt;&#xA;&lt;p&gt;Posted to &lt;a href=&quot;https://codegolf.stackexchange.com/q/197816/56555&quot;&gt;main&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="56555" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-01-08T19:23:23.973" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18420" PostTypeId="2" ParentId="8047" CreationDate="2020-01-07T03:38:43.453" Score="9" Body="&lt;h1&gt;Consider if your challenge really needs random output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Challenges that require &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; output require extra clarifications that challenges with deterministic output do not, and additionally exclude languages with no source of non-determinism.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Often times randomness only acts as a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8077/56656&quot;&gt;cumbersome output format&lt;/a&gt;, adding the randomness boilerplate from whatever language (or preventing submissions in that language).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the same time there are few benefits that it provides to a challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there are a finite number of valid outputs for every input (which seems to be the majority of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; challenges) you can change a challenge from&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Generate a random X&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;to&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Output all Xs&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Of course there are other ways to remove unnecessary randomness, for example if challenges of the form:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Generated a random X that satisfies property Y&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;often (but not always) break down into two challenges&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Generate a random X&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Given an X determine if it satisfies property Y&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;And you will often find a more worthwhile challenge in one of these two (or both).&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Of course there are challenges that are best with random outputs. The clearest case of this are challenges that ask to generate output with a specific distribution, where meeting the specific distribution is the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some examples of such challenges&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/101638&quot;&gt;Shortest code to produce non-deterministic output&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2020-01-13T17:56:44.333" LastActivityDate="2020-01-13T17:56:44.333" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18421" PostTypeId="2" ParentId="2140" CreationDate="2020-01-08T08:17:57.767" Score="0" Body="&lt;h1&gt;Interpret LCGFuck&amp;trade; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Introduction&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;LCGFuck&amp;trade; is a Brainfuck-like esoteric programming language invented by me. Inspired by Brainfuck and &lt;a href=&quot;https://en.wikipedia.org/wiki/Linear_congruential_generator&quot; rel=&quot;nofollow noreferrer&quot;&gt;linear congruential generators (LCGs)&lt;/a&gt;, LCGFuck&amp;trade; combined both things into one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An LCG in LCGFuck&amp;trade; is defined with 5 integers, namely multiplier &lt;code&gt;a&lt;/code&gt;, adder &lt;code&gt;b&lt;/code&gt;, modulus &lt;code&gt;c&lt;/code&gt;, offset &lt;code&gt;d&lt;/code&gt; and seed &lt;code&gt;e&lt;/code&gt;. Let &lt;code&gt;x&lt;/code&gt; be its current state, then the corresponding output will be &lt;code&gt;x + d&lt;/code&gt;, and the next internal state &lt;code&gt;x'&lt;/code&gt; of the LCG can be calculated by &lt;code&gt;x' = (a * x + b) mod c&lt;/code&gt;. All numbers should be non-negative except for &lt;code&gt;d&lt;/code&gt;. Moreover, &lt;code&gt;b&lt;/code&gt; and &lt;code&gt;e&lt;/code&gt; should be in the range &lt;code&gt;[0, c)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Technical details&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;An LCG is defined with 5 numbers, like &lt;code&gt;12345 678 90 -123 45&lt;/code&gt;. The last two numbers are optional and default to 0.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;LCGFuck&amp;trade; has 3 storage variables, the LCG list, the number list and the number memory. The functions are as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;LCG list: Cyclic list that stores all LCGs created. Every entry is in turn a list of 5 numbers in the order &lt;code&gt;[a, b, c, d, e]&lt;/code&gt; as notated in the introduction. It has a pointer that controls which LCG is chosen at the moment, and moves in a cycle through the list.&lt;/li&gt;&#xA;&lt;li&gt;Number list: Ordinary list that stores the numbers for LCG definition. It can store at most 5 numbers. &lt;/li&gt;&#xA;&lt;li&gt;Number memory: A single variable that can be read and written with an input or an LCG output.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;LCGFuck&amp;trade; has 14 operators, namely:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;\n&lt;/code&gt; (newline): Creates an LCG with the numbers in the order of &lt;code&gt;[a, b, c(, d(, e))]&lt;/code&gt; and clears the list if the number list contains 3 or more numbers. No-op if the number list contains no more than 2 numbers.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;lt;&lt;/code&gt;: Shifts to the previous LCG circularly (back to the last when moving from the first).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;gt;&lt;/code&gt;: Shifts to the next LCG circularly (back to the first when moving from the last).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;+&lt;/code&gt;: Moves the current LCG to the next state (calculates &lt;code&gt;x' = (a * x + b) mod c&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;c&lt;/code&gt;: Prints the output of the current LCG as a character (with the output as the codepoint).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;n&lt;/code&gt;: Prints the output of the current LCG as a number (with a trailing space)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;o&lt;/code&gt;: Writes the output of the current LCG to number memory&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;i&lt;/code&gt;: Reads a value from the input and writes it to number memory. There is two input mode, one reading a character one time, and one reading a number one time. &lt;strong&gt;You do not need to implement this operator in this challenge.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;s&lt;/code&gt;: Reads the value from number memory and seeds the current LCG with it&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;m&lt;/code&gt;: Reads the value from number memory and pushes it to the number list&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[]&lt;/code&gt;: Output loop. Executes the loop if the current LCG is non-zero&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;{}&lt;/code&gt;: State loop. Executes the loop if the state of the current LCG is non-zero&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;An integer, optionally with a negative sign at the front, pushes the number to the number list. Any characters other than the newline &lt;code&gt;\n&lt;/code&gt; and any of &lt;code&gt;-0123456789[]{}&amp;lt;&amp;gt;+cimnos&lt;/code&gt; are no-ops.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The code runs linearly from the first characters, except when loop ends are encountered. Loops can be nested but must be paired accordingly from the innermost loop to the outermost loop.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Write an interpreter, making it as short as possible, that interprets the LCGFuck source code given as the input. &lt;strong&gt;You need not implement the &lt;code&gt;i&lt;/code&gt; operator in this challenge&lt;/strong&gt;. The output should be printed to STDOUT or returned in case of writing a function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may assume that your interpreter always receives valid programs, i.e.:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;An LCG is always defined before any of the commands that manipulate the LCG or the LCG list pointer&lt;/li&gt;&#xA;&lt;li&gt;At any moment the number list contains at most 5 numbers&lt;/li&gt;&#xA;&lt;li&gt;All brackets are paired accordingly&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Standard loopholes are forbidden by default.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##tVhtc9pGEP6uX7FlkliKQAbsNg0WZNJMm8lMm2aa6SeiGWRx2BdLJ/VOMngY/XZ3906AcACLuJXHIN3L7vPs3r6Ir@FtqCLJs7wj0im7v58VIsp5KuD3d@9/K6IbO8LhNnCRFfnHImGSRw4sLVite2mmbByE5tfpKXyYbQkFroCJ8DJm0zbk10yAZBHjtwxCEEVyySTMZJqYPW1gsWK1FdF1KMMo31pkAdyGEhSH4bamppe1vnsDmUwjppQXyqvbcT/wVBbzfAITLwkz@xd@9UHkTm3DAMae5z3YFOjFCxiOwOywP@eSiyuPTPwp5SJ/m9sLx3EuLK18lkqwiQKHdIY8HJJ/x1k8BU5L5tc8ZmDnsmC1qa7AudJ6wN1GoWYsjnBsHLTh6AudhocCVJ7K8ArPRHQXxcachnicoeTudwheSc7IBkwaafwp0j4IhWYxB3lLaqyewj5NM6QfRjdGmLgkYa1WG7b/HxePwj7qQ620l4l8gQfaXpygRFtcjrsBvIQFuKhj3AsceE43fRScFjm6E1dVk2c4phib4gg@nQdOBe0p1jPQtg2nnuYOwrwlTxQkT7SfAjBhSSrvKnw3KK/Tu3iCY2/wyCWhvEGI1iq4cMgHik8vZuIqv9a5T8cRhRFNjHnmusHFUfres3yTslAZ8BnYyMCHLrx4gaJHQzjpnph7H@9fnzgHBXY7rwcQKsWvhDKhhMIThtKVpQ/qWGQBuIiYEodOnsRD660mfxjiySWNtedO67Dat@IOUkzWcsNGwZTFPOF5lbW1fjyOrkuatWozYrSQUspM35pgiLQ7h2hvQ@kc4v/QAMYCuzR@EdrqGD7ogrOdRQ2Vtb6I1gA@FepaK0NBUzbjAqPQRmvAjEuVwxmEkmrUPwWXVVGDOMSJvp5IM8pOYayzvTlScx3E9ZJi5uYY1/B8iN/9wIxUfsNhRF@FvF7l1lfFkZchRnvuKUzUzMbw/dGpZO7NXRdNrP0XU3iEqRIg58rREIrpVoybHKTVlQeNnj7uZtSZDuAzKVTaklUexMIYFVIykZMnrHVmiaNxnAXaIqv7s@Cw66NGKKIB/GlU70WBB7HekmhQq1ZA5VPc480lz9mq/FPL8m7VAtgmt9k7CVS9wX4OohEH0ZSD8ex@AntQ4kMLWo9A9RtB9dHp13yGSFMNNpPslqeFWntbNx02fhKAKklDB3pUMtcDh5GMGiEZPUAi2CLfheIYze7Jo20zanYH8EeKbW7dPQhCA8BuJGdVsK9cQUjWDy9XE92aj0xHUT3Uc8pm3yav1Hw8fLDncFjzRnblW2G96tyrMFbcI5q2492GccEOWzNppC8ZwN8ogJRpmahSP5hmggxrcjkdfzbfZBWqIFjoKUUXh3GoRl5VyJv6NtJd9@yc4wHegewbJ6OB/nsfGgbjkyNe55DLeLDujWXuwacQC6AhEnjw64JFRV75N6ZlqGh30sGeo2t4KlO5sLmiYG5DN3A2DNHgWJ1X3NRN1VtsWOxMS8Rss2dPaTL8l0fyX@7lX3qw2wA6cJvz730n/@acgyM5BxVnJqYevE@R3iW@GFH8xGtTrDsbemEhTmlm13j04BRySkwYOjkmJY2WHtRNp1M7vfpVkBbuBV8eCb78f8D3GoEv9ft5raAyKauC2qJTEHNFKlumpFE3aC/awB364WBijZ8tF95XbBUmbZiUwbMlJ81Yet7gDh/ebY5TCwbY0JUTxyyfEPidWicWzZX3q598Jj1kwhP86PQs@oA0Qcfgw2iZujRJj36ajKxytByVqYvDpb/0S2XRbA/O@nhzDr0@/PQazvXgK3j1M/Stpe@7dEX4Z75d1/L9aITX0i1LvMVBn6YjZKh/3Li4v@93z1/9Cw&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sample implementation with operator &lt;code&gt;i&lt;/code&gt; (Primality check)&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Sample&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;The LCG list need not be printed out.&lt;/strong&gt; It is just for illustration purpose.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;The &quot;Hello world!&quot; program in LCGFuck&amp;trade; is as follows:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 29 30 72&#xA;1 3 9 108&#xA;1 1 2 32&#xA;c+c&amp;gt;cc+co&amp;gt;c&#xA;1 8 9 m&#xA;&amp;gt;+c&amp;lt;&amp;lt;c+c+c&amp;lt;+c&amp;gt;&amp;gt;+c&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Output: &lt;code&gt;Hello world!&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;LCG list after execution:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1, 29, 30, 72, 28]&#xA;[1, 3, 9, 108, 0]&#xA;[1, 1, 2, 32, 1] &amp;lt; Current LCG&#xA;[1, 8, 9, 111, 8]&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;An example that outputs the values of &lt;code&gt;x - 16&lt;/code&gt;, where x is the states of the LCG &lt;code&gt;x' = (19x + 17) mod 32&lt;/code&gt;, starting with seed &lt;code&gt;x = 4&lt;/code&gt;, until the output is 0:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;19 17 32 -16 4&#xA;[n+]n&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Output: &lt;code&gt;-12 13 8 9 -4 5 -16 1 4 -3 -8 -7 12 -11 0&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;LCG list after execution: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[19, 17, 32, 16, -16] &amp;lt; Current LCG&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;An example that outputs all possible values of &lt;code&gt;5(x + 12)&lt;/code&gt;, where x is the states of the LCG &lt;code&gt;x' = (5x + 3) mod 8&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;5 3 8 12&#xA;5 0 99&#xA;o&amp;gt;s+n&amp;lt;+{o&amp;gt;s+n&amp;lt;+}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Output: &lt;code&gt;60 75 70 85 80 95 90 65&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;LCG list after execution:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[5, 3, 8, 12, 0] &amp;lt; Current LCG&#xA;[5, 0, 99, 0, 65] &#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;An example illustrating the 3-number restriction of &lt;code&gt;\n&lt;/code&gt; (the 9 in the 3rd line is pushed to the number list but the LCG is defined before the 9 is pushed):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;12 34&#xA;56 78&#xA;9&#xA;n&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Output: &lt;code&gt;78&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;LCG list after execution:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[12, 34, 56, 78, 0] &amp;lt; Current LCG&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;An example that determines whether 97 is a prime:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 -1 97 0 -1&#xA;{o+1 1 m 0 97&#xA;}&amp;gt;{&amp;gt;}o+{o+}&amp;lt;{&amp;lt;}s&#xA;1 1 1 32&#xA;1 4 12 69 4&#xA;1 1 7 78 2&#xA;{&amp;lt;+++++c+c+++++c+++&#xA;&amp;lt;&amp;lt;c&amp;gt;&amp;gt;&amp;gt;{+}}&amp;lt;c++c&amp;lt;c+c+c&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Output: &lt;code&gt;PRIME&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;LCG list after execution:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1, -1, 97, 0, 0]&#xA;[1, 1, 96, 0, 1]&#xA;[1, 1, 95, 0, 2]&#xA;[1, 1, 94, 0, 3]&#xA;[1, 1, 93, 0, 4]&#xA;[1, 1, 92, 0, 5]&#xA;[1, 1, 91, 0, 6]&#xA;[1, 1, 90, 0, 7]&#xA;[1, 1, 89, 0, 8]&#xA;[1, 1, 88, 0, 9]&#xA;[1, 1, 87, 0, 10]&#xA;[1, 1, 86, 0, 11]&#xA;[1, 1, 85, 0, 12]&#xA;[1, 1, 84, 0, 13]&#xA;[1, 1, 83, 0, 14]&#xA;[1, 1, 82, 0, 15]&#xA;[1, 1, 81, 0, 16]&#xA;[1, 1, 80, 0, 17]&#xA;[1, 1, 79, 0, 18]&#xA;[1, 1, 78, 0, 19]&#xA;[1, 1, 77, 0, 20]&#xA;[1, 1, 76, 0, 21]&#xA;[1, 1, 75, 0, 22]&#xA;[1, 1, 74, 0, 23]&#xA;[1, 1, 73, 0, 24]&#xA;[1, 1, 72, 0, 25]&#xA;[1, 1, 71, 0, 26]&#xA;[1, 1, 70, 0, 27]&#xA;[1, 1, 69, 0, 28]&#xA;[1, 1, 68, 0, 29]&#xA;[1, 1, 67, 0, 30]&#xA;[1, 1, 66, 0, 31]&#xA;[1, 1, 65, 0, 32]&#xA;[1, 1, 64, 0, 33]&#xA;[1, 1, 63, 0, 34]&#xA;[1, 1, 62, 0, 35]&#xA;[1, 1, 61, 0, 36]&#xA;[1, 1, 60, 0, 37]&#xA;[1, 1, 59, 0, 38]&#xA;[1, 1, 58, 0, 39]&#xA;[1, 1, 57, 0, 40]&#xA;[1, 1, 56, 0, 41]&#xA;[1, 1, 55, 0, 42]&#xA;[1, 1, 54, 0, 43]&#xA;[1, 1, 53, 0, 44]&#xA;[1, 1, 52, 0, 45]&#xA;[1, 1, 51, 0, 46]&#xA;[1, 1, 50, 0, 47]&#xA;[1, 1, 49, 0, 48]&#xA;[1, 1, 48, 0, 1]&#xA;[1, 1, 47, 0, 3]&#xA;[1, 1, 46, 0, 5]&#xA;[1, 1, 45, 0, 7]&#xA;[1, 1, 44, 0, 9]&#xA;[1, 1, 43, 0, 11]&#xA;[1, 1, 42, 0, 13]&#xA;[1, 1, 41, 0, 15]&#xA;[1, 1, 40, 0, 17]&#xA;[1, 1, 39, 0, 19]&#xA;[1, 1, 38, 0, 21]&#xA;[1, 1, 37, 0, 23]&#xA;[1, 1, 36, 0, 25]&#xA;[1, 1, 35, 0, 27]&#xA;[1, 1, 34, 0, 29]&#xA;[1, 1, 33, 0, 31]&#xA;[1, 1, 32, 0, 1]&#xA;[1, 1, 31, 0, 4]&#xA;[1, 1, 30, 0, 7]&#xA;[1, 1, 29, 0, 10]&#xA;[1, 1, 28, 0, 13]&#xA;[1, 1, 27, 0, 16]&#xA;[1, 1, 26, 0, 19]&#xA;[1, 1, 25, 0, 22]&#xA;[1, 1, 24, 0, 1]&#xA;[1, 1, 23, 0, 5]&#xA;[1, 1, 22, 0, 9]&#xA;[1, 1, 21, 0, 13]&#xA;[1, 1, 20, 0, 17]&#xA;[1, 1, 19, 0, 2]&#xA;[1, 1, 18, 0, 7]&#xA;[1, 1, 17, 0, 12]&#xA;[1, 1, 16, 0, 1]&#xA;[1, 1, 15, 0, 7]&#xA;[1, 1, 14, 0, 13]&#xA;[1, 1, 13, 0, 6]&#xA;[1, 1, 12, 0, 1]&#xA;[1, 1, 11, 0, 9]&#xA;[1, 1, 10, 0, 7]&#xA;[1, 1, 9, 0, 7]&#xA;[1, 1, 8, 0, 1]&#xA;[1, 1, 7, 0, 6]&#xA;[1, 1, 6, 0, 1]&#xA;[1, 1, 5, 0, 2]&#xA;[1, 1, 4, 0, 1]&#xA;[1, 1, 3, 0, 1]&#xA;[1, 1, 2, 0, 1]&#xA;[1, 1, 1, 0, 0]&#xA;[1, 1, 1, 32, 0]&#xA;[1, 4, 12, 69, 0] &amp;lt; Current LCG&#xA;[1, 1, 7, 78, 4]&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h3&gt;Winning criteria&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Since this is a code-golf challenge, the shortest solution for every language wins.&lt;/p&gt;&#xA;" OwnerUserId="71546" LastEditorUserId="71546" LastEditDate="2020-01-09T07:22:40.810" LastActivityDate="2020-01-09T07:22:40.810" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18427" PostTypeId="2" ParentId="2140" CreationDate="2020-01-10T13:41:20.180" Score="1" Body="&lt;h1&gt;Decimal to String with Mandatory Length&lt;/h1&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;string-container&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/floating-point&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;floating-point&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;floating-point&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;floating-point-container&quot;&gt;floating-point&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;conversion&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;conversion&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;conversion-container&quot;&gt;conversion&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Introduction:&lt;/h2&gt;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://stackoverflow.com/q/59679852/1682559&quot;&gt;this SO question&lt;/a&gt;, which asks for the most accurate precision of decimal values using either rounding or scientific notation as string, with at most 15 characters long. This would include the &lt;code&gt;-&lt;/code&gt;, &lt;code&gt;.&lt;/code&gt;, and &lt;code&gt;E&lt;/code&gt; in the output-string.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge:&lt;/h2&gt;&#xA;&lt;p&gt;Inputs:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A decimal value &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;An integer output-length &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A string of the most accurate representation of the given decimal value, with a length exactly equal to the output-length &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;. NOTE: the linked SO question ask for at most 15 characters long, but this challenge asks for &lt;em&gt;exactly&lt;/em&gt; &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; characters long instead.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Challenge rules:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The output-length input is guaranteed to be &lt;span class=&quot;math-container&quot;&gt;\$n\geq7\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;The decimal input is guaranteed to be valid and non-empty&lt;/li&gt;&#xA;&lt;li&gt;You are allowed to take the input-decimal &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; as string&lt;/li&gt;&#xA;&lt;li&gt;The input-decimal is guaranteed to only contain the characters &lt;code&gt;0123456789-.&lt;/code&gt;, and will not start with an &lt;code&gt;.&lt;/code&gt; (but &lt;code&gt;0.&lt;/code&gt; instead), nor start with unnecessary leading &lt;code&gt;0&lt;/code&gt;s like &lt;code&gt;001.23&lt;/code&gt; instead of &lt;code&gt;1.23&lt;/code&gt; (except for &lt;code&gt;0.&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;The output-string is guaranteed to only contain the characters &lt;code&gt;0123456789-.E&lt;/code&gt; (or &lt;code&gt;e&lt;/code&gt; instead of &lt;code&gt;E&lt;/code&gt; if you choose so). The input-format restrictions mentioned one bullet-point above, do NOT apply for the output-format however!&lt;/li&gt;&#xA;&lt;li&gt;If the length of the integer part of a number (including &lt;code&gt;-&lt;/code&gt; for negative values) is larger than the given output-length: use a scientific notation (with either &lt;code&gt;e&lt;/code&gt; or &lt;code&gt;E&lt;/code&gt;) and rounded precision. I.e. with inputs &lt;code&gt;s = &amp;quot;-987654321987654321.987654321&amp;quot;; n = 15&lt;/code&gt;, the output is supposed to be one of these: &lt;code&gt;[&amp;quot;-987654321.99E9&amp;quot;, &amp;quot;-9876543219.9E8&amp;quot;, &amp;quot;-98765432199.E7&amp;quot;]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;It is allowed to add leading &lt;code&gt;0&lt;/code&gt;s to get to length &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; without changing its decimal (base-10) value. I.e. with inputs &lt;code&gt;s = &amp;quot;-123.00&amp;quot;; n = 15&lt;/code&gt;, the output &lt;code&gt;&amp;quot;-00000000000123&amp;quot;&lt;/code&gt; would be valid.&lt;/li&gt;&#xA;&lt;li&gt;It is allowed to add trailing &lt;code&gt;0&lt;/code&gt;s to the decimal parts to get to length &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; without changing its decimal (base-10) value. I.e. with inputs &lt;code&gt;s = &amp;quot;-1.23&amp;quot;; n = 15&lt;/code&gt;, the output &lt;code&gt;&amp;quot;-1.230000000000&amp;quot;&lt;/code&gt; or &lt;code&gt;&amp;quot;-1.2300000000E0&amp;quot;&lt;/code&gt; are both valid. (With inputs &lt;code&gt;s = &amp;quot;-0.123456789123456789&amp;quot;; n = 15&lt;/code&gt;, the only possible output is &lt;code&gt;&amp;quot;-.1234567891235&amp;quot;&lt;/code&gt;.)&lt;/li&gt;&#xA;&lt;li&gt;Please specify which rounding type your language is using! (E.g. HALF_UP, HALF_DOWN, HALF_EVEN, BANKERS, etc.) My test cases where this is relevant use HALF_UP.&lt;/li&gt;&#xA;&lt;li&gt;If multiple outputs are possible, just output one, multiple, or all of them.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;General rules:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins.&lt;br /&gt;&#xA;Don't let code-golf languages discourage you from posting answers with non-codegolfing languages. Try to come up with an as short as possible answer for 'any' programming language.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet/2422#2422&quot;&gt;Standard rules apply&lt;/a&gt; for your answer with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods/&quot;&gt;default I/O rules&lt;/a&gt;, so you are allowed to use STDIN/STDOUT, functions/method with the proper parameters and return-type, full programs. Your call.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Default Loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;If possible, please add a link with a test for your code (i.e. &lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Also, adding an explanation for your answer is highly recommended.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;All these test cases will use the output-length as &lt;code&gt;15&lt;/code&gt; (and rounding mode &lt;code&gt;HALF_UP&lt;/code&gt;):&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-java prettyprint-override&quot;&gt;&lt;code&gt;Input:                           Possible Outputs:&#xA;&amp;quot;987654321987654321.987654321&amp;quot;   &amp;quot;987654321.988E9&amp;quot;,&amp;quot;9876543219.88E8&amp;quot;,&amp;quot;98765432198.8E7&amp;quot;,&amp;quot;987654321988.E6&amp;quot;&#xA;&amp;quot;-987654321987654321.987654321&amp;quot;  &amp;quot;-987654321.99E9&amp;quot;,&amp;quot;-9876543219.9E8&amp;quot;,&amp;quot;-98765432199.E7&amp;quot;&#xA;&amp;quot;1234567891234567.123456789&amp;quot;     &amp;quot;1234567.89123E9&amp;quot;,&amp;quot;12345678.9123E8&amp;quot;,&amp;quot;123456789.123E7&amp;quot;,&amp;quot;1234567891.23E6&amp;quot;,&amp;quot;12345678912.3E5&amp;quot;,&amp;quot;123456789123.E4&amp;quot;&#xA;&amp;quot;-1234567891234567.123456789&amp;quot;    &amp;quot;-1234567.8912E9&amp;quot;,&amp;quot;-12345678.912E8&amp;quot;,&amp;quot;-123456789.12E7&amp;quot;,&amp;quot;-1234567891.2E6&amp;quot;,&amp;quot;-12345678912.E5&amp;quot;&#xA;&amp;quot;0.123456789123456789&amp;quot;           &amp;quot;.12345678912346&amp;quot;&#xA;&amp;quot;-0.123456789123456789&amp;quot;          &amp;quot;-.1234567891235&amp;quot;&#xA;&amp;quot;5.5555555555555555555555555&amp;quot;    &amp;quot;5.5555555555556&amp;quot;&#xA;&amp;quot;-5.5555555555555555555555555&amp;quot;   &amp;quot;-5.555555555556&amp;quot;&#xA;&amp;quot;123456789123456&amp;quot;                &amp;quot;123456789123456&amp;quot;&#xA;&amp;quot;-123456789123456&amp;quot;               &amp;quot;-123456.78912E9&amp;quot;,&amp;quot;-1234567.8912E8&amp;quot;,&amp;quot;-12345678.912E7&amp;quot;,&amp;quot;-123456789.12E6&amp;quot;,&amp;quot;-1234567891.2E5&amp;quot;,&amp;quot;-12345678912.E4&amp;quot;&#xA;&amp;quot;123.00&amp;quot;                         &amp;quot;123.00000000000&amp;quot;,&amp;quot;0123.0000000000&amp;quot;,&amp;quot;00123.000000000&amp;quot;,&amp;quot;000123.00000000&amp;quot;,&amp;quot;0000123.0000000&amp;quot;,&amp;quot;00000123.000000&amp;quot;,&amp;quot;000000123.00000&amp;quot;,&amp;quot;0000000123.0000&amp;quot;,&amp;quot;00000000123.000&amp;quot;,&amp;quot;000000000123.00&amp;quot;,&amp;quot;0000000000123.0&amp;quot;,&amp;quot;00000000000123.&amp;quot;,&amp;quot;000000000000123&amp;quot;,&amp;quot;123.000000000E0&amp;quot;,&amp;quot;0123.00000000E0&amp;quot;,&amp;quot;00123.0000000E0&amp;quot;,&amp;quot;000123.000000E0&amp;quot;,&amp;quot;0000123.00000E0&amp;quot;,&amp;quot;00000123.0000E0&amp;quot;,&amp;quot;000000123.000E0&amp;quot;,&amp;quot;0000000123.00E0&amp;quot;,&amp;quot;00000000123.0E0&amp;quot;,&amp;quot;000000000123.E0&amp;quot;,&amp;quot;12.3000000000E1&amp;quot;,&amp;quot;012.300000000E1&amp;quot;,&amp;quot;0012.30000000E1&amp;quot;,&amp;quot;00012.3000000E1&amp;quot;,&amp;quot;000012.300000E1&amp;quot;,&amp;quot;0000012.30000E1&amp;quot;,&amp;quot;00000012.3000E1&amp;quot;,&amp;quot;000000012.300E1&amp;quot;,&amp;quot;0000000012.30E1&amp;quot;,&amp;quot;00000000012.3E1&amp;quot;,&amp;quot;1.23000000000E2&amp;quot;,&amp;quot;01.2300000000E2&amp;quot;,&amp;quot;001.230000000E2&amp;quot;,&amp;quot;0001.23000000E2&amp;quot;,&amp;quot;00001.2300000E2&amp;quot;,&amp;quot;000001.230000E2&amp;quot;,&amp;quot;0000001.23000E2&amp;quot;,&amp;quot;00000001.2300E2&amp;quot;,&amp;quot;000000001.230E2&amp;quot;,&amp;quot;0000000001.23E2&amp;quot;,&amp;quot;.123000000000E3&amp;quot;,&amp;quot;0.12300000000E3&amp;quot;,&amp;quot;00.1230000000E3&amp;quot;,&amp;quot;000.123000000E3&amp;quot;,&amp;quot;0000.12300000E3&amp;quot;,&amp;quot;00000.1230000E3&amp;quot;,&amp;quot;000000.123000E3&amp;quot;,&amp;quot;0000000.12300E3&amp;quot;,&amp;quot;00000000.1230E3&amp;quot;,&amp;quot;000000000.123E3&amp;quot;,&amp;quot;1230.0000000E-1&amp;quot;,&amp;quot;01230.000000E-1&amp;quot;,&amp;quot;001230.00000E-1&amp;quot;,&amp;quot;0001230.0000E-1&amp;quot;,&amp;quot;00001230.000E-1&amp;quot;,&amp;quot;000001230.00E-1&amp;quot;,&amp;quot;0000001230.0E-1&amp;quot;,&amp;quot;00000001230.E-1&amp;quot;,&amp;quot;000000001230E-1&amp;quot;,&amp;quot;12300.000000E-2&amp;quot;,&amp;quot;012300.00000E-2&amp;quot;,&amp;quot;0012300.0000E-2&amp;quot;,&amp;quot;00012300.000E-2&amp;quot;,&amp;quot;000012300.00E-2&amp;quot;,&amp;quot;0000012300.0E-2&amp;quot;,&amp;quot;00000012300.E-2&amp;quot;,&amp;quot;000000012300E-2&amp;quot;,&amp;quot;123000.00000E-3&amp;quot;,&amp;quot;0123000.0000E-3&amp;quot;,&amp;quot;00123000.000E-3&amp;quot;,&amp;quot;000123000.00E-3&amp;quot;,&amp;quot;0000123000.0E-3&amp;quot;,&amp;quot;00000123000.E-3&amp;quot;,&amp;quot;000000123000E-3&amp;quot;,&amp;quot;1230000.0000E-4&amp;quot;,&amp;quot;01230000.000E-4&amp;quot;,&amp;quot;001230000.00E-4&amp;quot;,&amp;quot;0001230000.0E-4&amp;quot;,&amp;quot;00001230000.E-4&amp;quot;,&amp;quot;000001230000E-4&amp;quot;,&amp;quot;12300000.000E-5&amp;quot;,&amp;quot;123000000.00E-5&amp;quot;,&amp;quot;1230000000.0E-5&amp;quot;,&amp;quot;12300000000.E-5&amp;quot;,&amp;quot;123000000000E-5&amp;quot;,&amp;quot;123000000.00E-6&amp;quot;,&amp;quot;1230000000.0E-6&amp;quot;,&amp;quot;12300000000.E-6&amp;quot;,&amp;quot;123000000000E-6&amp;quot;,&amp;quot;1230000000.0E-7&amp;quot;,&amp;quot;12300000000.E-7&amp;quot;,&amp;quot;123000000000E-7&amp;quot;,&amp;quot;12300000000.E-8&amp;quot;,&amp;quot;123000000000E-8&amp;quot;,&amp;quot;123000000000E-9&amp;quot;&#xA;&amp;quot;-123.00&amp;quot;                        &amp;quot;-123.0000000000&amp;quot;,&amp;quot;-0123.000000000&amp;quot;,&amp;quot;-00123.00000000&amp;quot;,&amp;quot;-000123.0000000&amp;quot;,&amp;quot;-0000123.000000&amp;quot;,&amp;quot;-00000123.00000&amp;quot;,&amp;quot;-000000123.0000&amp;quot;,&amp;quot;-0000000123.000&amp;quot;,&amp;quot;-00000000123.00&amp;quot;,&amp;quot;-000000000123.0&amp;quot;,&amp;quot;-0000000000123.&amp;quot;,&amp;quot;-00000000000123&amp;quot;,&amp;quot;-123.00000000E0&amp;quot;,&amp;quot;-0123.0000000E0&amp;quot;,&amp;quot;-00123.000000E0&amp;quot;,&amp;quot;-000123.00000E0&amp;quot;,&amp;quot;-0000123.0000E0&amp;quot;,&amp;quot;-00000123.000E0&amp;quot;,&amp;quot;-000000123.00E0&amp;quot;,&amp;quot;-0000000123.0E0&amp;quot;,&amp;quot;-00000000123.E0&amp;quot;,&amp;quot;-000000000123E0&amp;quot;,&amp;quot;-12.300000000E1&amp;quot;,&amp;quot;-012.30000000E1&amp;quot;,&amp;quot;-0012.3000000E1&amp;quot;,&amp;quot;-00012.300000E1&amp;quot;,&amp;quot;-000012.30000E1&amp;quot;,&amp;quot;-0000012.3000E1&amp;quot;,&amp;quot;-00000012.300E1&amp;quot;,&amp;quot;-000000012.30E1&amp;quot;,&amp;quot;-0000000012.3E1&amp;quot;,&amp;quot;-1.2300000000E2&amp;quot;,&amp;quot;-01.230000000E2&amp;quot;,&amp;quot;-001.23000000E2&amp;quot;,&amp;quot;-0001.2300000E2&amp;quot;,&amp;quot;-00001.230000E2&amp;quot;,&amp;quot;-000001.23000E2&amp;quot;,&amp;quot;-0000001.2300E2&amp;quot;,&amp;quot;-00000001.230E2&amp;quot;,&amp;quot;-000000001.23E2&amp;quot;,&amp;quot;-.12300000000E3&amp;quot;,&amp;quot;-0.1230000000E3&amp;quot;,&amp;quot;-00.123000000E3&amp;quot;,&amp;quot;-000.12300000E3&amp;quot;,&amp;quot;-0000.1230000E3&amp;quot;,&amp;quot;-00000.123000E3&amp;quot;,&amp;quot;-000000.12300E3&amp;quot;,&amp;quot;-0000000.1230E3&amp;quot;,&amp;quot;-00000000.123E3&amp;quot;,&amp;quot;-1230.000000E-1&amp;quot;,&amp;quot;-01230.00000E-1&amp;quot;,&amp;quot;-001230.0000E-1&amp;quot;,&amp;quot;-0001230.000E-1&amp;quot;,&amp;quot;-00001230.00E-1&amp;quot;,&amp;quot;-000001230.0E-1&amp;quot;,&amp;quot;-0000001230.E-1&amp;quot;,&amp;quot;-00000001230E-1&amp;quot;,&amp;quot;-12300.00000E-2&amp;quot;,&amp;quot;-012300.0000E-2&amp;quot;,&amp;quot;-0012300.000E-2&amp;quot;,&amp;quot;-00012300.00E-2&amp;quot;,&amp;quot;-000012300.0E-2&amp;quot;,&amp;quot;-0000012300.E-2&amp;quot;,&amp;quot;-00000012300E-2&amp;quot;,&amp;quot;-123000.0000E-3&amp;quot;,&amp;quot;-0123000.000E-3&amp;quot;,&amp;quot;-00123000.00E-3&amp;quot;,&amp;quot;-000123000.0E-3&amp;quot;,&amp;quot;-0000123000.E-3&amp;quot;,&amp;quot;-00000123000E-3&amp;quot;,&amp;quot;-1230000.000E-4&amp;quot;,&amp;quot;-01230000.00E-4&amp;quot;,&amp;quot;-001230000.0E-4&amp;quot;,&amp;quot;-0001230000.E-4&amp;quot;,&amp;quot;-00001230000E-4&amp;quot;,&amp;quot;-12300000.00E-5&amp;quot;,&amp;quot;-123000000.0E-5&amp;quot;,&amp;quot;-1230000000.E-5&amp;quot;,&amp;quot;-12300000000E-5&amp;quot;,&amp;quot;-123000000.0E-6&amp;quot;,&amp;quot;-1230000000.E-6&amp;quot;,&amp;quot;-12300000000E-6&amp;quot;,&amp;quot;-1230000000.E-7&amp;quot;,&amp;quot;-12300000000E-7&amp;quot;,&amp;quot;-12300000000E-8&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;TODO: Fix the possible outputs of the other test cases as well:&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-java prettyprint-override&quot;&gt;&lt;code&gt;&amp;quot;0.123&amp;quot;                          &amp;quot;.12300000000000&amp;quot;&#xA;&amp;quot;-0.123&amp;quot;                         &amp;quot;-.1230000000000&amp;quot;&#xA;&amp;quot;1.23&amp;quot;                           &amp;quot;1.2300000000000&amp;quot;&#xA;&amp;quot;-1.23&amp;quot;                          &amp;quot;-1.230000000000&amp;quot;&#xA;&amp;quot;0.000000000000001&amp;quot;              &amp;quot;10000000000E-25&amp;quot;&#xA;&amp;quot;0&amp;quot;                              &amp;quot;000000000000000&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;All these test cases will use the output-length as &lt;code&gt;7&lt;/code&gt; (and rounding mode &lt;code&gt;HALF_UP&lt;/code&gt;):&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-java prettyprint-override&quot;&gt;&lt;code&gt;Input:                           Output:&#xA;&amp;quot;987654321987654321.987654321&amp;quot;   &amp;quot;9.88E17&amp;quot;&#xA;&amp;quot;-987654321987654321.987654321&amp;quot;  &amp;quot;-9.9E17&amp;quot;&#xA;&amp;quot;1234567891234567.123456789&amp;quot;     &amp;quot;1.23E15&amp;quot;&#xA;&amp;quot;-1234567891234567.123456789&amp;quot;    &amp;quot;-1.2E15&amp;quot;&#xA;&amp;quot;0.123456789123456789&amp;quot;           &amp;quot;.123457&amp;quot;&#xA;&amp;quot;-0.123456789123456789&amp;quot;          &amp;quot;-.12346&amp;quot;&#xA;&amp;quot;5.5555555555555555555555555&amp;quot;    &amp;quot;5.55556&amp;quot;&#xA;&amp;quot;-5.5555555555555555555555555&amp;quot;   &amp;quot;-5.5556&amp;quot;&#xA;&amp;quot;123456789123456&amp;quot;                &amp;quot;1.23E14&amp;quot;&#xA;&amp;quot;-123456789123456&amp;quot;               &amp;quot;-1.2E14&amp;quot;&#xA;&amp;quot;123.00&amp;quot;                         &amp;quot;0000123&amp;quot; or &amp;quot;01.23E2&amp;quot; or &amp;quot;1.230E2&amp;quot;&#xA;&amp;quot;-123.00&amp;quot;                        &amp;quot;-000123&amp;quot; or &amp;quot;-12.3E1&amp;quot;&#xA;&amp;quot;0.123&amp;quot;                          &amp;quot;.123000&amp;quot;&#xA;&amp;quot;-0.123&amp;quot;                         &amp;quot;-.12300&amp;quot;&#xA;&amp;quot;1.23&amp;quot;                           &amp;quot;1.23000&amp;quot;&#xA;&amp;quot;-1.23&amp;quot;                          &amp;quot;-1.2300&amp;quot;&#xA;&amp;quot;0.000000000000001&amp;quot;              &amp;quot;100E-17&amp;quot; or &amp;quot;1.0E-15&amp;quot;&#xA;&amp;quot;0&amp;quot;                              &amp;quot;0000000&amp;quot;,&amp;quot;.000000&amp;quot;,&amp;quot;0.00000&amp;quot;,&amp;quot;00.0000&amp;quot;,&amp;quot;000.000&amp;quot;,&amp;quot;0000.00&amp;quot;,&amp;quot;00000.0&amp;quot;,&amp;quot;000000.&amp;quot;,&amp;quot;0E12345&amp;quot;,&amp;quot;000E-98&amp;quot;&amp;quot;,etc.,etc. :/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="52210" LastEditorUserId="52210" LastEditDate="2023-01-10T13:09:22.133" LastActivityDate="2023-01-10T13:09:22.133" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="18429" PostTypeId="1" CreationDate="2020-01-10T17:04:10.600" Score="19" ViewCount="836" Body="&lt;p&gt;Last year &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/17367&quot;&gt;we voted for the best posts of 2018&lt;/a&gt; and rewarded them with bounties and challenges. I think it's a great way to reward and draw attention to some of the best content the community has created throughout the year, so let's do that again. (And hopefully, this year, we'll be able to sort everything out before half a year has passed.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First off, we'll need categories again, which you can nominate here. Each answer should contain a category for a challenge or answer to be rewarded. The top-voted categories will then receive separate nomination posts to find the actual winners. Like last year, I'm not going to state a fixed number of categories that will make it, but it's probably going to be between 5 and 15 again (last year, we went with 14 categories).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Feel free to resubmit &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17314/best-of-ppcg-2018-call-for-categories&quot;&gt;proposals from last year&lt;/a&gt; regardless of whether they were among the final 14 or not.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Voting will probably last for about two weeks, but this period can be extended if needed.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Offered Bounties&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As a further note, we'll need reputation rewards again, so if you're willing to spend some of your reputation on a bounty for one of the winners, feel free to edit your name into this list or leave a comment to indicate that you're willing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Users that have offered a bounty:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;DJMcMayhem&lt;/strong&gt; Offering a 500 rep bounty&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Adám&lt;/strong&gt; Offering 1E4 rep&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;isaacg&lt;/strong&gt; Offering 2000 rep&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Giuseppe&lt;/strong&gt; offering 500 rep&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Kevin Cruijssen&lt;/strong&gt; offering 1000 rep&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Kritixi Lithos&lt;/strong&gt; offering 2E3 rep&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41805" LastEditorUserId="41805" LastEditDate="2020-03-15T09:43:47.213" LastActivityDate="2020-03-15T09:43:47.213" Title="Best of PPCG 2019 — Call for Categories" Tags="|discussion|best-of|" AnswerCount="17" CommentCount="5" ClosedDate="2020-03-20T09:21:28.393" ContentLicense="CC BY-SA 4.0" />
  <row Id="18431" PostTypeId="2" ParentId="2140" CreationDate="2020-01-11T06:44:19.097" Score="0" Body="&lt;h2&gt;I'm stepping down &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You are given 4 positive integers: volume of the first container (&lt;code&gt;v1&lt;/code&gt;), volume of the second container (&lt;code&gt;v2&lt;/code&gt;), volume of the liquid in the first container (&lt;code&gt;l1&lt;/code&gt;), and volume of the liquid in the second container (&lt;code&gt;l2&lt;/code&gt;). Your task is to move (or &quot;step down&quot;, if appropriate) some of the liquid from container 1 to container 2, making the amount of empty space in the containers equal to each other, outputting how much liquid should be moved.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;An example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here is an example of some possible input (formatted for the ease of test cases. The input isn't formatted.):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;8 11&#xA;6  5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here, you need to make sure that the differences between the volumes and the containers are equal. Currently the difference is not equal:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  8 11&#xA;- 6  5&#xA;======&#xA;   6 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;So we need to try to make them equal, by taking some of the values in one container to another container:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  8 11&#xA;- 4  7&#xA;======&#xA;  4  4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;After you have succeeded, output how much liquid you need to take from container 1 to container 2. Therefore the above example should output &lt;code&gt;2&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;15 16&#xA; 9  2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We move into this state:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 15 16&#xA;- 5  6&#xA;======&#xA; 10 10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Therefore &lt;code&gt;4&lt;/code&gt; is the expected result.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test case #2&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;16 12&#xA;13  1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We move into this state:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 16 12&#xA;- 9  5&#xA;======&#xA;  7  7&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Therefore &lt;code&gt;4&lt;/code&gt; is the expected output.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test case #3&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;20 12&#xA;10 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Moved:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; 20 12&#xA;-10 2&#xA;======&#xA; 10 10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Therefore &lt;code&gt;0&lt;/code&gt; is the expected output.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The test cases will be made so that the result is always possible as a positive integer. The result will &lt;strong&gt;never&lt;/strong&gt; be a decimal.&lt;/li&gt;&#xA;&lt;li&gt;Input can be taken in any convenient and reasonable format.&lt;/li&gt;&#xA;&lt;li&gt;Output can be given in any convenient and reasonable format.&lt;/li&gt;&#xA;&lt;li&gt;The input string will be made so that a moving is always possible without involving decimals or negative numbers. Also there will not be more liquid than how much a container can hold.&lt;/li&gt;&#xA;&lt;li&gt;Of course, this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the answer in each language consisting of the fewest number of bytes wins. Happy golfing!&lt;/li&gt;&#xA;&lt;li&gt;An extra restriction for the test cases: you can assume that there is always going to be space available in the second container. So a test case like this:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;10 2&#xA; 2 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is not going to be a valid testcase.&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2020-01-13T13:19:53.717" LastActivityDate="2020-01-13T13:19:53.717" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18433" PostTypeId="2" ParentId="2140" CreationDate="2020-01-11T11:17:20.560" Score="3" Body="&lt;h2&gt;Eats, shoots and leaves&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As you know, a panda eats shoots and leaves. Your task today is to write a panda in as few bytes as possible.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;       1&#xA;      / \&#xA;     7   5&#xA;    / \   \&#xA;   2   6   9&#xA;      / \   \&#xA;     3   8   4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here this tree has two branches, &lt;code&gt;1-7-6&lt;/code&gt; and &lt;code&gt;1-5-9&lt;/code&gt;. The branch &lt;code&gt;1-7-6&lt;/code&gt; has a shoot &lt;code&gt;2&lt;/code&gt; and leaves &lt;code&gt;3&lt;/code&gt; and &lt;code&gt;8&lt;/code&gt;, while the branch &lt;code&gt;1-5-9&lt;/code&gt; has a leaf &lt;code&gt;4&lt;/code&gt;. After eating the shoots and leaves, your panda should output the following tree:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;       1&#xA;      / \&#xA;     7   5&#xA;      \   \&#xA;       6   9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If your panda is a program or function, it must output the tree in the same format that you input it. Alternatively it can be a subroutine that modifies the tree in-place.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it helps, you can assume that the tree has at least two nodes, and/or that each node has at most two child nodes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;No standard loopholes.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2020-01-11T11:17:20.560" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18434" PostTypeId="2" ParentId="2140" CreationDate="2020-01-11T11:58:19.010" Score="4" Body="&lt;p&gt;&lt;H1&gt;Rennab&lt;/H1&gt; &#xA;&lt;strong&gt;&lt;em&gt;Reverse banneR&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the language of your own choosing write a program or function that takes as input the output of the super-handy-for-the-farsighted tool &lt;a href=&quot;https://en.wikipedia.org/wiki/Banner_(Unix)&quot; rel=&quot;nofollow noreferrer&quot;&gt;banner&lt;/a&gt;. And simply outputs the original text. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 1a&lt;/strong&gt; of &lt;code&gt;banner&lt;/code&gt; output on Linux:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; banner 'Code Golf'&#xA;&#xA;   XXXX              XX                    XXXX            XX       XX&#xA;  X    X              X                   X    X            X      X&#xA; X                    X                  X                  X      X&#xA; X        XXXXX   XXXXX   XXXXX          X        XXXXX     X     XXXX&#xA; X       X     X X    X  X     X         X       X     X    X      X&#xA; X       X     X X    X  XXXXXXX         X   XXX X     X    X      X&#xA; X       X     X X    X  X               X     X X     X    X      X&#xA;  X    X X     X X    X  X     X          X    X X     X    X      X&#xA;   XXXX   XXXXX   XXXXXX  XXXXX            XXXX   XXXXX   XXXXX   XXXX&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 1b&lt;/strong&gt; of &lt;code&gt;rennab&lt;/code&gt; program that runs on Linux and takes input from &lt;code&gt;stdin&lt;/code&gt; as lines of strings, and outputs to &lt;code&gt;stdout&lt;/code&gt;, and supports the characters: &lt;code&gt;[' ', 'C', 'G', 'd', 'e', 'f', 'l', 'o']&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; banner 'Code Golf' | rennab&#xA;Code Golf&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 2a&lt;/strong&gt; of &lt;code&gt;banner&lt;/code&gt; output on Linux:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; banner ':-)'&#xA;&#xA;&#xA;                   X&#xA;                    X&#xA;                    X&#xA;    X                X&#xA;                     X&#xA;         XXXXXXX     X&#xA;                     X&#xA;                     X&#xA;    X               X&#xA;                    X&#xA;                   X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 2b&lt;/strong&gt; of &lt;code&gt;rennab&lt;/code&gt; program that runs on Linux and takes input from &lt;code&gt;stdin&lt;/code&gt; as lines of strings, and outputs to &lt;code&gt;stdout&lt;/code&gt;, and supports the characters: &lt;code&gt;[':', '-', ')']&lt;/code&gt;: &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; banner ':-)' | rennab&#xA;:-)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Choose what ever characters (minimum of 3)  you want to support but that effects your score (see Rules below).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Program or function - your choice.&lt;/li&gt;&#xA;&lt;li&gt;Input the output of &lt;a href=&quot;https://en.wikipedia.org/wiki/Banner_(Unix)&quot; rel=&quot;nofollow noreferrer&quot;&gt;banner&lt;/a&gt; in whatever format you'd like (&lt;em&gt;eg&lt;/em&gt; 2d array of characters, list of strings, reading from &lt;code&gt;stdin&lt;/code&gt; straight from the horse's mouth, &lt;em&gt;&amp;amp;c&lt;/em&gt;).&lt;/li&gt;&#xA;&lt;li&gt;For this challenge we'll use &lt;a href=&quot;http://software.cedar-solutions.com/utilities.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cedar Solutions' open-source GNU/GPL banner implementation&lt;/a&gt; common on Linux. Prints horizontally only with a fixed size.&lt;/li&gt;&#xA;&lt;li&gt;Output the original text in whatever format you'd like, return character at the end optional (&lt;em&gt;eg&lt;/em&gt; as a string, a list of characters, as output to &lt;code&gt;stdout&lt;/code&gt;, &lt;em&gt;&amp;amp;c&lt;/em&gt;).&lt;/li&gt;&#xA;&lt;li&gt;You can assume only the characters supported are input.&lt;/li&gt;&#xA;&lt;li&gt;You must support a minimum of 3 characters.&lt;/li&gt;&#xA;&lt;li&gt;Score is calculated by this formula (where &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is the number of code bytes and &lt;span class=&quot;math-container&quot;&gt;\$c\$&lt;/span&gt; is the number of characters supported): &lt;span class=&quot;math-container&quot;&gt;\$n - 8c\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Scores can be negative.&lt;/li&gt;&#xA;&lt;li&gt;No standard loopholes.&lt;/li&gt;&#xA;&lt;li&gt;Lowest score wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Questions&lt;/strong&gt;  &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Has this been done before?&lt;/li&gt;&#xA;&lt;li&gt;Is the score formula any good? Any and all suggestions welcome.&lt;/li&gt;&#xA;&lt;li&gt;Is the question any good? Any and all feedback welcome.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="9481" LastEditorUserId="9481" LastEditDate="2020-01-15T13:20:10.093" LastActivityDate="2020-01-15T13:20:10.093" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18435" PostTypeId="2" ParentId="18429" CreationDate="2020-01-11T20:42:27.777" Score="8" Body="&lt;h1&gt;Most Collaborative Answer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;goes to one that incorporates significant ideas from as many users as possible&lt;/p&gt;&#xA;" OwnerUserId="24908" LastActivityDate="2020-01-11T20:42:27.777" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18436" PostTypeId="2" ParentId="18429" CreationDate="2020-01-11T20:46:36.600" Score="4" Body="&lt;h1&gt;Trickiest Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It should look simple and tempt you to start coding right away, but coming up with a good solution should be hard.&lt;/p&gt;&#xA;" OwnerUserId="24908" LastEditorDisplayName="user85052" LastEditDate="2020-01-12T12:05:11.817" LastActivityDate="2020-01-12T12:05:11.817" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18437" PostTypeId="2" ParentId="18429" CreationDate="2020-01-12T11:59:31.417" Score="11" Body="&lt;h2&gt;Rookie of the Year - Challenges&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17318/85052&quot;&gt;Repost of 2018&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the best challenge written by someone who has not written a challenge prior to 2019 (i.e., not necessarily a new user, just a new challenge writer).&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastActivityDate="2020-01-12T11:59:31.417" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18438" PostTypeId="2" ParentId="18429" CreationDate="2020-01-12T12:01:34.153" Score="8" Body="&lt;h2&gt;Most elegant spec&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17330/85052&quot;&gt;Repost of 2018&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Writing an interesting challenge is tough, not just in thinking up a good idea, but in specifying it clearly enough without taking pages of text. This category is for challenges whose specification is a pleasure to read, summing up exactly what is required succinctly and unambiguously.&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastActivityDate="2020-01-12T12:01:34.153" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18439" PostTypeId="2" ParentId="18429" CreationDate="2020-01-12T14:42:00.937" Score="10" Body="&lt;h1&gt;Best Non-Code-Golf Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Best challenge whose winning criteria did not include any code-golfing. King of the Hill, Fastest Code, etc. would be eligible. Proof Golf, atomic-code-golf, etc. are also included. Anything that's not the standard &quot;shortest code length&quot; is eligible.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="20080" LastEditDate="2020-01-13T14:30:32.083" LastActivityDate="2020-01-13T14:30:32.083" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18440" PostTypeId="2" ParentId="18429" CreationDate="2020-01-12T14:43:10.447" Score="6" Body="&lt;h1&gt;Best Non-Code-Golf Answer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Best answer to a challenge whose winning criteria did not include any code-golfing. King of the Hill, Fastest Code, etc. would be eligible. Proof Golf, atomic-code-golf, etc. are also included. Anything that's not the standard &quot;shortest code length&quot; is eligible.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="20080" LastEditDate="2020-01-13T14:30:46.187" LastActivityDate="2020-01-13T14:30:46.187" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18442" PostTypeId="2" ParentId="18429" CreationDate="2020-01-13T03:31:42.717" Score="14" Body="&lt;h1&gt;Best mathematical insight&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17317/78410&quot;&gt;Repost of 2018&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On this site we often see answers in languages specifically designed for short code, or designed to be fast. Sometimes, a nice golfing trick or speed-up technique surprises us with its ingenuity, beyond the standard use of that language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And occasionally an answer shows up that uses an unexpected approach to greatly simplify the problem, and makes us wonder how the author could ever think of that. This usually involves some far-from-obvious mathematical equivalence, or a particularly simple approach to the problem that was not evident at all (once revealed, other answers often follow the same approach).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This category is for the answer with the best &lt;strong&gt;mathematical&lt;/strong&gt; insight or unexpected approach that led to greatly simplifying the problem, in &lt;strong&gt;any challenge type&lt;/strong&gt; (code golf, fastest code, or others). The insight should have led to a significant improvement according to the challenge's metric (code length, run time, or whatever applicable).&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2020-01-13T03:31:42.717" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18443" PostTypeId="2" ParentId="2140" CreationDate="2020-01-13T20:53:49.257" Score="0" Body="&lt;h1&gt;He. Might. Go. All. The. Way. Touchdown!&lt;/h1&gt;&#xA;&lt;p&gt;[in-progress]&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Premise:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;In American Football, a team has to drive up the field to their opponent's end-zone to score points. But here's the catch, they have 4 tries (called downs) to go at least 10 yards to gain a new set of downs. They repeat this until they score a Touchdown, or until they fail to get 10 yards and (at least in this challenge) punt it away or go for a Field Goal.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to simulate such a drive.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;You are to output the state of each down, i.e. which down it is, how far to the next down (or the end-zone), and where the ball is. Football location counts up from a team's end-zone (0yd line) up to the 50yd line (the middle), then back down to 0 for the opponent's end-zone.&lt;/p&gt;&#xA;&lt;p&gt;We differentiate the sides of the field by prefixing the location with the team's name. In this challenge, you can use a 1 character label or use positive and negative values. It &lt;strong&gt;must&lt;/strong&gt; go 0-49,50,49-0 and have a way to differentiate between the sides. Your choice on who owns the 50yd line.&lt;/p&gt;&#xA;&lt;p&gt;Sample Output: (Our team is A, the opponent's team is B)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1st &amp;amp; 7 on A 13&#xA;2nd &amp;amp; 10 on A 48&#xA;3rd &amp;amp; 12 on 50 OR 3rd &amp;amp; 12 on A 50 OR 3rd &amp;amp; 12 on B 50&#xA;4th &amp;amp; 8 on B 10&#xA;2nd &amp;amp; Goal on B 7 (read ahead)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your team will start on your own 1 yard line on &lt;code&gt;1st &amp;amp; 10&lt;/code&gt; (1st down, 10 yards to go for another first down). You will then gain a uniformly random number of yards between &lt;code&gt;[-3,10]&lt;/code&gt; called &lt;code&gt;N&lt;/code&gt;. If you didn't get enough for a 1st down, it will now be &lt;code&gt;2nd &amp;amp; (10 - N)&lt;/code&gt;. Repeat drawing another number between &lt;code&gt;[-3,10]&lt;/code&gt; and adding the yardage for 2nd and 3rd downs if it's still not enough for a 1st down. If you do gain enough for a 1st down, you simply go back to &lt;code&gt;1st &amp;amp; 10&lt;/code&gt; on the next go and continue going down the field.&lt;/p&gt;&#xA;&lt;p&gt;On 4th Down, your team is playing safe and will either punt or go for a Field Goal. If you are further away than their 40, output &lt;code&gt;P&lt;/code&gt;. If you're within 40 yards, you will attempt a Field Goal with &lt;code&gt;100 - Yards Away%&lt;/code&gt; chance of success. If you succeed, output &lt;code&gt;FG&lt;/code&gt;. If you miss, output &lt;code&gt;NG&lt;/code&gt; (&amp;quot;No Good&amp;quot;). Afterwards, terminate.&lt;/p&gt;&#xA;&lt;p&gt;However, there are two special situations that must be handled.&lt;/p&gt;&#xA;&lt;p&gt;If you get within 10yd (inclusive) and gain a 1st Down, It will then be &lt;code&gt;1st &amp;amp; Goal&lt;/code&gt; and there are no more opportunities to gain 1st downs. Do or die! If you score, output &lt;code&gt;TD&lt;/code&gt; and terminate, otherwise you'll follow the normal Field goal rules.&lt;/p&gt;&#xA;&lt;p&gt;If you lose enough yards to go into your own end-zone, that's called a Safety. Simply output a &lt;code&gt;S&lt;/code&gt; and terminate.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No usable input will be provided&lt;/li&gt;&#xA;&lt;li&gt;Output is flexible. Tuples and lists of lists are all fine.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Sample Runs:&lt;/strong&gt;&lt;br /&gt;&#xA;To-Do&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Tags:&lt;/strong&gt; Code-golf, random, game&lt;/p&gt;&#xA;&lt;hr&gt;&#xA;&lt;p&gt;Feedback? Does the Field goal add enough meat to be worth including?&lt;/p&gt;&#xA;" OwnerUserId="78849" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-01-13T20:53:49.257" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18444" PostTypeId="2" ParentId="2140" CreationDate="2020-01-14T17:54:30.127" Score="0" Body="&lt;h1&gt;How low can you go?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Time to play so ascii-art limbo!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's the bar:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;|--|&#xA;|  |&#xA;|  |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Can you fit under it?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Goal&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program or function that takes an ascii string representing a some shape, and a positive integer representing a bar height.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output the shape from the input after it has attempted to do the limbo.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Details&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In limbo you lean back to make yourself as small as possible to fit under the bar, and that is just what the input shapes will try and do.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the input shape contains any repeating patterns in its lines, then you can remove all but the last of the repetitions that are in the pattern. In additions the pattern must start at the top line, and once the repeating pattern is broken no more sections can be removed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If there is a repeating pattern that contains another repeating pattern, only the innermost pattern is stripped.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example this is how the following inputs would look after &quot;Leaning back&quot;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1. XXX              2. xxx            3. xxx           4. xxx      &#xA;   YYY                 xxx       xxx     xxx              xxx      xxx&#xA;   XXX   --&amp;gt;   XXX     yyy  --&amp;gt;  yyy     xxx  --&amp;gt;         yyy      yyy&#xA;   YYY         YYY     zzz       zzz     xxx              yyy      yyy&#xA;   zzz         zzz     aaa       aaa     xxx      xxx     xxx  --&amp;gt; xxx&#xA;                                                          xxx      xxx&#xA;                                                          yyy      yyy&#xA;                                                          yyy      yyy&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note how in example number 4 there was a repetition ox &lt;code&gt;xxx&lt;/code&gt; insinde of another repetition of &lt;code&gt;xxx&lt;/code&gt;, &lt;code&gt;xxx&lt;/code&gt;, &lt;code&gt;yyy&lt;/code&gt;, &lt;code&gt;yyy&lt;/code&gt;. In this case only the inner repeating lines got reduced.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The bars will be drawn as shown below for the given heights:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 -&amp;gt; |--|    2 -&amp;gt; |--|   3 -&amp;gt; |--|  etc...&#xA;                  |  |        |  |&#xA;                              |  |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If the given input shape in its reduced form does not fit underneath the bar then the bar will be drawn on the ground like this &lt;code&gt;|__|&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Exmaples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Inputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a. height: 3      b.  height: 2     c.  height: 1&#xA;   shape: xxx         shape: xxx        shape: (emptystring)&#xA;          xxx                xxx&#xA;          xxx                xxx&#xA;          yyy                yyy&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Outputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a. |--|           b. |  | xxx       c. |--| &#xA;   |  | xxx          |__| yyy  &#xA;   |  | yyy&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You can assume only valid inputs will be given, handle invalid input however you want&lt;/li&gt;&#xA;&lt;li&gt;The input shape will be drawn 1 space after the bar, and the bottom of the input shape will always line up with the bottom of the bar.&lt;/li&gt;&#xA;&lt;li&gt;Extra whitespace after is fine as long as all the lines are properly aligned.&lt;/li&gt;&#xA;&lt;li&gt;If there is whitespace in the given input then that should be included in the output&lt;/li&gt;&#xA;&lt;li&gt;The shape will not necessarily always line up in a perfect rectangle as I drew it.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;This is for code-golf so the answer using the fewest bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Please let me know what you think / if anything is unclear and needs to be improved. Hope you guys like it!&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;EDIT: Would whoever down voted please explain whats wrong with it?&lt;/p&gt;&#xA;" OwnerUserId="85235" LastEditorUserId="85235" LastEditDate="2020-01-20T20:32:29.260" LastActivityDate="2020-01-20T20:32:29.260" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18446" PostTypeId="2" ParentId="2140" CreationDate="2020-01-15T00:37:08.113" Score="0" Body="&lt;h1&gt;What order(s) can I fire my tonics in?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://apps.apple.com/us/app/helsings-fire/id380290526&quot; rel=&quot;nofollow noreferrer&quot;&gt;Helsing's Fire&lt;/a&gt; is a classic mobile game about light. You fire blasts of holy retribution (from chemicals called tonics), using cover to selectively hit enemies in the right sequence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For this challenge, we're going to ignore the line-of-sight stuff and focus on just the tonic order. Each monster is represented by a string like &lt;code&gt;RBBGB&lt;/code&gt;—this indicates that, in order to kill it, you need to hit it with a red tonic, followed by 2 blue tonics, then one green tonic and finally one more blue tonic.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since you're allowed to ignore cover and pick any subset of the monsters to hit, any of the following sequences will kill it:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;RBBGB&#xA;GRBBGBRR&#xA;RBBBBBBBBBBBBBBBGGGGBR&#xA;RRRBGGGBBRGRBB&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your goal is to take in &lt;strong&gt;a list of monsters&lt;/strong&gt; as well as &lt;strong&gt;how many of each tonic you have&lt;/strong&gt;, and output every possible ordering of tonics that kills every monster, including ones where not every tonic is fired. For instance:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;R; 2 red -&amp;gt; R, RR&#xA;R; 1 red/1 blue -&amp;gt; R, RB, BR&#xA;No monsters, but tonics -&amp;gt; every possible permutation of the tonics listed&#xA;No tonics, but monsters -&amp;gt; no output, empty set output, or single trailing separator&#xA;Neither tonics nor monsters -&amp;gt; empty string&#xA;RB,BR; 2 red/2 blue -&amp;gt; RBR, BRB, BRBR, RBBR, RBRB, BRRB&#xA;RR,RR,GRG,R,GBR,GR,GRRR,GGR,GB,G,R,BBR; 3 red/2 blue/2 green -&amp;gt; BGRRBGR, BGRRGBR, BGRBRGR, BGRBGRR, BGRGRBR, BGRGBRR, BGBRRGR, BGBRGRR, GRRBBGR, GRRBGBR, GRRGBBR, GRBRBGR, GRBRGBR, GRBBRGR, GRBBGRR, GRBGRBR, GRBGBRR, GRGRBBR, GRGBRBR, GRGBBRR, GBRRBGR, GBRRGBR, GBRBRGR, GBRBGRR, GBRGRBR, GBRGBRR, GBBRRGR, GBBRGRR&#xA;BR,R,BR,RBBR,RBR,RGB,RGBR,GB,RGR,GG,GRB,G; 3 red/2 blue/2 green -&amp;gt; RBGRBRG, RBGRBGR, RBGRGBR, RBGGRBR, RGRBBRG, RGRBBGR, RGRBGBR, RGRGBBR, RGBRBRG, RGBRBGR, RGBRGBR, RGBGRBR, RGGRBBR, RGGBRBR, GRRBGBR, GRRGBBR, GRBRGBR, GRBGRBR, GRBGBR, GRBGBRR, GRGRBBR, GRGBRBR, GRGBBR, GRGBBRR&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Would there be a duplicate for this?&lt;/p&gt;&#xA;" OwnerUserId="62402" LastActivityDate="2020-01-15T00:37:08.113" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18447" PostTypeId="2" ParentId="18429" CreationDate="2020-01-15T23:44:05.423" Score="-1" Body="&lt;h1&gt;Most Unconventional Non-esoteric Language&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Goes to a user who uses a language not normally associated with programming challenges.&lt;/p&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2020-01-15T23:49:19.997" LastActivityDate="2020-01-15T23:49:19.997" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18449" PostTypeId="2" ParentId="18429" CreationDate="2020-01-16T00:00:20.683" Score="6" Body="&lt;h1&gt;Most unexpected approach&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Awarded to the author of the solution to a challenge that is completely different from the obvious approaches, especially if it beats all other answers.&lt;/p&gt;&#xA;" OwnerUserId="45613" LastActivityDate="2020-01-16T00:00:20.683" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18450" PostTypeId="2" ParentId="18429" CreationDate="2020-01-16T00:05:43.110" Score="3" Body="&lt;h1&gt;Most Clever Optimization&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;When an existing answer is optimized with a bizarre and surprising change.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An off-site real-world example would be the fast inverse square root hack.&lt;/p&gt;&#xA;" OwnerUserId="45613" LastActivityDate="2020-01-16T00:05:43.110" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18451" PostTypeId="2" ParentId="18429" CreationDate="2020-01-16T19:41:35.537" Score="7" Body="&lt;h1&gt;Best Explained Answer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Awarded to a user who explains a complex solution in the best way.&lt;/p&gt;&#xA;" OwnerUserId="45613" LastActivityDate="2020-01-16T19:41:35.537" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18453" PostTypeId="2" ParentId="2140" CreationDate="2020-01-17T15:51:27.357" Score="-1" Body="&lt;h1&gt;Make a Decompiler Bomb&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Similar to the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69189/build-a-compiler-bomb&quot;&gt;Make a Compiler Bomb&lt;/a&gt; challenge, but backwards.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal is to create the a 1KiB (1024 bytes) or smaller bytecode file that creates the largest output when decompiled.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Constraints&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A binary is either an x86 binary (in the form of an ELF file, PE file (.dll/.exe), or Mach-O binary) or a virtual bytecode file (e.g. Python .pyc, Java .class, .NET CLR, etc.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The decompiler can be any public (preferably free) decompiler of your choice. (e.g Snowman/Hex-Rays for x86 binarys, CFR/Fernflower/etc. for java, dotPeek for .NET, uncompyle6 for Python, etc.)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A decompiler is any tool that takes a binary and attempts to reconstruct human readable source code from it.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The largest output byte count wins, with the smallest input size as a tie-breaker&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The binary must be executable, and print &quot;Hello World!&quot; &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The decompiled code must be syntactically correct&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="75429" LastEditorUserId="75429" LastEditDate="2020-01-21T16:43:27.410" LastActivityDate="2020-01-21T16:43:27.410" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18455" PostTypeId="2" ParentId="2140" CreationDate="2020-01-18T00:09:21.047" Score="0" Body="&lt;h1&gt;Fun with Lasers and Prisms (WIP)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a rectangular grid of objects, one or more laser pointers, and a target, determine if any laser beam will hit the target.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Objects&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;ASCII will be used for illustration purposes&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Laser Pointer: &lt;code&gt;^&lt;/code&gt;, &lt;code&gt;V&lt;/code&gt;, &lt;code&gt;&amp;lt;&lt;/code&gt;, &lt;code&gt;&amp;gt;&lt;/code&gt; - a beam will shoot up, down, left, right, respectively, starting from this cell.&lt;/li&gt;&#xA;&lt;li&gt;Target: &lt;code&gt;O&lt;/code&gt; - return true if a beam reaches this cell&lt;/li&gt;&#xA;&lt;li&gt;Mirror: &lt;code&gt;/&lt;/code&gt;, &lt;code&gt;\&lt;/code&gt; - reflects a beam 90 degrees&lt;/li&gt;&#xA;&lt;li&gt;Prism: &lt;code&gt;#&lt;/code&gt; - the laser will split into three beams, one for each direction&lt;/li&gt;&#xA;&lt;li&gt;One-way block: &lt;code&gt;A&lt;/code&gt;, &lt;code&gt;U&lt;/code&gt;, &lt;code&gt;(&lt;/code&gt;, &lt;code&gt;)&lt;/code&gt; - a beam will pass up, down, left, right, respectively, but not other directions&lt;/li&gt;&#xA;&lt;li&gt;Corridor block: &lt;code&gt;=&lt;/code&gt;, &lt;code&gt;&quot;&lt;/code&gt; - a beam will only pass horizontally or vertically, respectively&lt;/li&gt;&#xA;&lt;li&gt;Gate block: &lt;code&gt;I&lt;/code&gt;, &lt;code&gt;H&lt;/code&gt; - a beam will pass through horizontally if another beam touches it vertically, or vice-versa, respectively&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use any convenient representation&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="45613" LastActivityDate="2020-01-18T00:09:21.047" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18457" PostTypeId="1" AcceptedAnswerId="18467" CreationDate="2020-01-18T18:41:52.383" Score="28" ViewCount="620" Body="&lt;h1&gt;Rise and Fall of Communities&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Over the years, I've been part of many growing online (and offline) communities, usually in some kind of advocate and/or moderation capacity (I'm just a room owner here). Without exception, these communities are now either gone or a shadow of their former self. This was never caused by some intrinsic negative quality. Lots of people with a great personal investment in these communities might argue with great emotional vigor that a downfall is imminent, usually because of one - in the grand scheme of things - completely inconsequential issue.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It might be unintuitive, but I think that sort of discussion is indicative of a thriving community experiencing growing pains common to any kind of group relationship. No, there are much stronger indicators of a platform that's about to die a slow death (platforms never die fast, they fizzle out, in stages of decreasing severity). I'm not going to enumerate them, but I want to highlight two.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The most visible effect might be traffic. Ingress in the form of new, engaged members, and egress in the form of output. The other effect is more abstract. It's the change in how the actual stakeholders (admins, owners what have you) look at what they have created and what it has become. This is an opportunity for the development of huge misunderstanding (on both sides), which in turn leads to alienation due to both sides pulling in different directions.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Businesses are Gonna Business&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I work at a 3000+ employee company, in a birds-eye-view position. What I mean is that I see what every one of our 1000+ engineers is doing and how they interact with each other. On the opposite end of the spectrum, I also have a lot of business experience, having founded companies and assisted with fundraising for other startups. Lastly, our company is also pretty special in the technical community building discipline. Every single one of the Fortune500 companies is our customer, and internationally, we exceed 300,000 customers. Now comes the special part: Our own tech community platform, where the IT / SRE / admin folks exchange their problems and solutions exceeds 150,000 individual members. Of course, that platform had growing pains, but so far, we've listened to our users, engaged with them and shaped the platform over time to accommodate the needs of a growing, technical, community.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So from this perspective, I can confidently state that StackExchange (the company) screwed up &lt;em&gt;big time&lt;/em&gt;. And I'm not even talking about the problems and behavior that caused me (the person) to leave*. SE has no viable business model. Outward, they present two mechanisms for monetization, both insane.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The first is SE for Teams. If there ever was a feature (from Jobs' criticism of Dropbox being &quot;a feature, not a company&quot;) it is this. Other than being overpriced (although some may argue there's no such thing as overprices in B2B sales), it's already part of well-established platforms businesses use &lt;em&gt;today&lt;/em&gt;. You can't work at a large company without encountering a massive Confluence instance for example. Those companies are one, single-time, purchase away from enabling &lt;em&gt;Questions for Confluence&lt;/em&gt;, which completely replaces SE for Teams and has better integration with systems companies actually use (AD, SAP, SalesForce, ...).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The other one is SE jobs. Well, when I was in a position to actually hire people, I did use SE jobs - or tried to at least. In theory, this is a good idea: &lt;em&gt;We have all the devs, so of course, we would be the best job platform for devs!&lt;/em&gt; But that's not how any of this works. People don't keep their profile up to date, the jobs interface is horrendous for employers, SE sales are clueless as to what an employer would actually &lt;em&gt;need&lt;/em&gt;. The same thing happened with GitHub Jobs, which is relegated to a tiny, optional box, on the GitHub dashboard now...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So yeah, it ain't looking good. SE has already rolled out changes to their org, specifically community-facing teams, which give a whole lot of credence to speculations of problems at SE. In a pants-on-fire, confused effort to turn this business into an actual company, they can't stop failing. Remember, (big) platforms don't fail fast. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Wait, do you hear something fizzling in the distance?&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Moving On&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;So yeah, I'm out. If anyone wants to chat**, drop me an email at turbo[at]tilde[dot]club&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One last thing: One unique, positive (in contrast with the arrogance cesspool that is SO) thing about PPCG (sue me) in particular is that it seems to attract very bright, very young individuals. For them, a bit of advice: Keep golfing, keep solving interesting problems in interesting ways and think about how to apply that to problems that advance your self or your career. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;But don't invest your identity in the success of any community, this or any other. Circles of friendship and online forums alike will transform, vanish and others will spring up. Always aim to look beyond your comfort zone, your &quot;bubble&quot;, and at the bigger picture. Realize how small and irrelevant issues will be in hindsight that seemed big at the time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, in the words of my &lt;a href=&quot;https://en.wikipedia.org/wiki/Heinz_Erhardt&quot; rel=&quot;nofollow noreferrer&quot;&gt;favorite comedian / poet&lt;/a&gt; growing up:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Ich wälze nicht schwere Probleme / und spreche nicht über die Zeit. / Ich weiß nicht, wohin ich dann käme, / ich weiß nur, ich käme nicht weit.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Translation (thanks DeepL):&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I don't dwell on serious problems / and don't talk about the times, / I don't know where I would go then, / I just know I wouldn't get far.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;* Including, but not limited to: Decline in community engagement, socially tone-deaf handling of volunteer issues, illegal activity in relicensing without consent&lt;/p&gt;&#xA;&#xA;&lt;p&gt;** If you're in or around Austin (Texas), Berlin or Brno, hit me up for software engineering job opportunities. If you're a student at UT for more info on internships.&lt;/p&gt;&#xA;" OwnerDisplayName="user42643" LastEditorUserId="39490" LastEditDate="2020-01-20T16:20:03.957" LastActivityDate="2020-01-21T22:53:42.327" Title="Ight Imma Head Out" Tags="|discussion|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18458" PostTypeId="2" ParentId="2140" CreationDate="2020-01-18T20:50:09.527" Score="3" Body="&lt;h1&gt;Bucket and Minimize&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/198406/bucket-and-minimize&quot;&gt;Post here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="88520" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-02-02T23:53:37.533" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18460" PostTypeId="1" AcceptedAnswerId="18471" CreationDate="2020-01-19T17:07:57.670" Score="7" ViewCount="373" Body="&lt;p&gt;Can I golf in my own programming language here?&#xA;I ask it 'cause there is no online way to check it out.&lt;/p&gt;&#xA;" OwnerUserId="91144" LastActivityDate="2020-01-23T21:50:53.557" Title="Can I use here my own language for code-golfing?" Tags="|discussion|code-golf|languages|" AnswerCount="3" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18461" PostTypeId="2" ParentId="18429" CreationDate="2020-01-19T17:57:28.313" Score="3" Body="&lt;h1&gt;Best Above-and-Beyond Answer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17319/41805&quot;&gt;Repost of last year's&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Every once in a while, an answer takes the challenge to the extreme. This prize will be awarded to an answer which went far beyond the expectations of the challenge. This could include&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a code golf answer that brute-forced/proved the shortest program in some language&lt;/li&gt;&#xA;&lt;li&gt;a graphical-output popcon answer of extreme size and quality&lt;/li&gt;&#xA;&lt;li&gt;a KOTH answer of high complexity which absolutely dominated the competition&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41805" LastActivityDate="2020-01-19T17:57:28.313" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18462" PostTypeId="2" ParentId="18460" CreationDate="2020-01-19T19:57:07.573" Score="8" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;It is quite common for participants here to use their own languages, and indeed, some of the languages used here (e.g. NARS2000 and TI-Basic) cannot be tried online.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-01-19T19:57:07.573" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18463" PostTypeId="2" ParentId="18460" CreationDate="2020-01-19T22:13:38.973" Score="3" Body="&lt;h1&gt;Most Certainly Yes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Some examples of users using their own programming language:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/196826/78850&quot;&gt;Me, using Keg&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/194982/78850&quot;&gt;@a'_', using W&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/181844/78850&quot;&gt;@Adnan, using 05AB1E&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/190861/78850&quot;&gt;@Dennis, using Jelly&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/splcurran/Gaia&quot; rel=&quot;nofollow noreferrer&quot;&gt;@BusinessCat, using Gaia&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/Mego/Seriously&quot; rel=&quot;nofollow noreferrer&quot;&gt;@Mego, using Actually/Seriously&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/somebody1234/Charcoal&quot; rel=&quot;nofollow noreferrer&quot;&gt;@ASCII-Only, using Charcoal&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/sporeball/naz&quot; rel=&quot;nofollow noreferrer&quot;&gt;@sporeball, using naz&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/53818/78850&quot;&gt;@isaacg, using Pyth&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="20080" LastEditDate="2020-01-23T21:50:53.557" LastActivityDate="2020-01-23T21:50:53.557" CommentCount="3" CommunityOwnedDate="2020-01-19T22:13:38.973" ContentLicense="CC BY-SA 4.0" />
  <row Id="18464" PostTypeId="2" ParentId="9080" CreationDate="2020-01-20T10:41:19.820" Score="3" Body="&lt;h1&gt;Allow more than one category of competition in a single challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The general consensus on CGCC seems to be that limiting a challenge to a subset of languages is bad. So a language such as GolfScript, which has no built-in UTF-8 support, should not be forbidden from taking part in challenges &lt;a href=&quot;https://codegolf.stackexchange.com/questions/194869/do-you-make-me-up&quot;&gt;such as this one&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, an answer that can only handle ASCII shouldn't be considered to be directly competing against answers that handle full UTF-8, UTF-16, or UCS-4/UTF-32. Allowing more than one category of competition is a really good solution to this dilemma.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For that matter, another type of split competition that should be allowed is Arbitrary-precision answers vs. Floating-point/Limited-precision answers, but that's a topic for a another Meta post.&lt;/p&gt;&#xA;" OwnerUserId="17216" LastActivityDate="2020-01-20T10:41:19.820" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18465" PostTypeId="2" ParentId="2140" CreationDate="2020-01-21T05:07:35.173" Score="1" Body="&lt;h2&gt;Internal Truth Machine &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It's a &lt;a href=&quot;https://esolangs.org/wiki/Truth-machine&quot; rel=&quot;nofollow noreferrer&quot;&gt;normal truth machine&lt;/a&gt; but instead of taking input, it uses the first character of the program. Thus, internal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example: &lt;code&gt;0abcd&lt;/code&gt; prints 0 and halts, and &lt;code&gt;1abcd&lt;/code&gt; prints 1 infinitely.&lt;/p&gt;&#xA;" OwnerUserId="91569" LastActivityDate="2020-01-21T05:07:35.173" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18466" PostTypeId="2" ParentId="18429" CreationDate="2020-01-21T17:58:12.817" Score="-3" Body="&lt;h1&gt;Most Flexible Spec&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Awarded to the author of a challenge that enables the widest variety of solutions.&lt;/p&gt;&#xA;" OwnerUserId="45613" LastActivityDate="2020-01-21T17:58:12.817" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18467" PostTypeId="2" ParentId="18457" CreationDate="2020-01-21T22:53:42.327" Score="5" Body="&lt;p&gt;Thanks for your engagement in the community. I look at your answers, and I remember some of them (the image-based ones), which for me is pretty good.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I, too, have withdrawn from SE quite a bit. I continue to post (rarely) on codegolf, and I expect I will participate on SO and a couple others so long as that is where I find solutions to use for my job.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am currently hoping to see &lt;a href=&quot;https://forum.codidact.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Codidact&lt;/a&gt; turn into a better alternative, so I am splitting my time there.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I hope you find/build another community you can enjoy, and perhaps we will see each other there sometime.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastActivityDate="2020-01-21T22:53:42.327" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18468" PostTypeId="2" ParentId="18429" CreationDate="2020-01-22T01:26:04.437" Score="8" Body="&lt;h1&gt;Most helpful Sandbox commenter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Rewards a kind soul who took the time and effort to read through challenges in the Sandbox and give helpful feedback.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I guess a bounty here would be awarded to one of the winner's questions or answers of their choosing.)&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2020-01-23T00:18:24.137" LastActivityDate="2020-01-23T00:18:24.137" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18469" PostTypeId="2" ParentId="18429" CreationDate="2020-01-22T01:29:54.863" Score="7" Body="&lt;h1&gt;Best tip&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Best answer to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2020-01-22T01:29:54.863" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18470" PostTypeId="2" ParentId="2140" CreationDate="2020-01-22T09:12:09.817" Score="-1" Body="&lt;h1&gt;I delete the input, you delete the source code&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/file-system&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;file-system&amp;#39;&quot; rel=&quot;tag&quot;&gt;file-system&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is a new twist on the long running series on CGCC.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task, if you accept it, is to write a program/function that outputs/returns the contents of an input file. The tricky part is that if I delete the input file, your program must delete itself.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The source code file and the input file should be in the same directory. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The input file and source file can be named anything at all. I.e. The file names are your choice. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The contents of the input file will be restricted to printable ASCII. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The input file and the source file &lt;strong&gt;must&lt;/strong&gt; be deletable.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is code-golf, so the shortest (original) code in each language wins!&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Default Loopholes apply.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If your program is &lt;code&gt;jspwjxnlow8229&lt;/code&gt; and the input file exists, the program must print the contents of the file. If the file doesn't exist, the program must delete itself. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Feedback&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In regards to file manipulation, have I specified the rules enough? &lt;/p&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2020-01-22T21:50:00.097" LastActivityDate="2020-01-22T21:50:00.097" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18471" PostTypeId="2" ParentId="18460" CreationDate="2020-01-22T14:22:54.313" Score="8" Body="&lt;h1&gt;Yes, but an interpreter or compiler is required&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Languages on this site are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7833/36398&quot;&gt;defined by their implementation&lt;/a&gt;. This means that there has to be an interpreter/compiler (online or offline) in which programs can be run.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Obviously, it is most convenient if the program can be run online (such as in &lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try It Online&lt;/a&gt;), but it is perfectly acceptable if the interpreter/compiler has to be installed offline. The key is that people should be able to verify that the answer is valid.&lt;/p&gt;&#xA;" OwnerUserId="36398" LastActivityDate="2020-01-22T14:22:54.313" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18472" PostTypeId="2" ParentId="18429" CreationDate="2020-01-23T00:36:33.353" Score="8" Body="&lt;h1&gt;Wild card&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For a deserving challenge or answer that isn't a good fit for any of the other categories.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2020-01-23T00:36:33.353" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18473" PostTypeId="2" ParentId="2140" CreationDate="2020-01-23T15:53:38.390" Score="0" Body="&lt;h2&gt;Auto Tic Tac Toe&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Okay, so after thinking about the comment I think I thought of a way to make it more interesting.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Given no input, write a program or function which outputs an entire game of Tic-Tac-Toe where X always wins, or the game ends in a tie.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Requirements&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;X goes first&lt;/li&gt;&#xA;&lt;li&gt;O must make moves at random&lt;/li&gt;&#xA;&lt;li&gt;X must make smart moves such that it always wins the game, or the game ends in a tie&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Here's what I would expect a game to look like:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;X--&#xA;---&#xA;---&#xA;&#xA;XO-&#xA;---&#xA;---&#xA;&#xA;XO-&#xA;-X-&#xA;---&#xA;&#xA;XOO&#xA;-X-&#xA;---&#xA;&#xA;XOO&#xA;-X-&#xA;--X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Notes:&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;X does not need to win in the fewest moves, it is enough to just make it always block O from winning&lt;/li&gt;&#xA;&lt;li&gt;You can output the game in whatever form you like, as long as it is easily conveys every turn of the game. For example you could output a string like above, or a list of lists of ints like below, where 0 is an empty space and 1, 2 are X, O respectively:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;  [1,0,0, 0,0,0, 0,0,0], &#xA;  [1,2,0, 0,0,0, 0,0,0], &#xA;  [1,2,0, 0,1,0, 0,0,0],&#xA;  [1,2,2, 0,1,0, 0,0,0], &#xA;  [1,2,2, 0,1,0, 0,0,1]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is code golf, answer in the fewest bytes wins. Standard rules apply.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Is this a better challenge? I'd love to know what people think&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Working example of ungolfed code: &lt;a href=&quot;https://tio.run/##pVVda9swFH33r7grW7FokjpuN9YyB7bRjsIggw5WWPvgxUoj5kiuLCcrxb8904ctyx/dSus8JPE90rn33KOr30ykhO52m5jDLxbzBCJISS7mSz8YdT7IUyhRcCpBU89bFhRusfhBKMXcz0Us8Cl8lYs/XFAxkxi9IToF@RcePJDPknHwCRAKARRUkBSOUBVSD1mC2ecnuYEoguo3HMD0Bvb32/9b8dCN38CrCAJ3Y/VwrFOvMTZWPoH@qEN/1Im/eyl9CV47g8BhOHZ2P3bev3feB33WFmNgGMsOTfgEGre48D80YU3jOaHAK41bsjS@v/LrxSoLbZHJghXKIkCEYg2kGvLrxCXZxCkIvM4@VR416wT7zNIULwRh1P/IeXyv7OcjZNfZNboi6do6UJvdAqo24DTHDm/fsCfdxtoyms4vmITSArdwzy2hXYZyJoS9BJpzaKFIiRh2sx3YbdoDDIvTd3PrdTlwolTNGcELbOslNMF/5stzwnPxUPW7fQIrfATjKeryvNwGevcnWcE17dyaVmXAMkwvMyZyucjS6aHnG0qTlvTOWbxYXaiKcaLsPYINjGeySn@jC0fNVpM4SXyCKu2eU6fSrtmO5GfrTNzLoKtho0OD5DFN2NpHjbH6gjhSfInX2JdD/VtMuKp5ZEa@lWA2c5TSO12qydDWqkG7ihmgVsJcHTq0XZEUuw5HZkjImeRMD@mlKArK3nRSqpgrS7Yc2Qmkj3nV2bYRhpPQ4pmbz2x3oHZ7Uwlmmmar5jgvUmltrZGb@MilQC2tH790HeqpO1UNS92adUyoNenhIWScUGnQ7YrBllF4GwRwKzuX27ht5STHcl4lsCWpbBgGscJVVnqkg5yAHN8VhEsPs0JkhdBTUaxIDncFzpUb2/Vvdbmq48PHoz9UZXrdaW9FbDK18YpAN8ngJks1UFCr7W5kcBZqjVJaA40OaBCyd03Hjz7XdA9173NzAdrlV7oLY3j9UOdeu1YbsyxHMP8nJFSQ70Seo8cQQVlWaXjlbvcX&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Kotlin – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="85235" LastEditorUserId="85235" LastEditDate="2020-02-25T20:32:02.297" LastActivityDate="2020-02-25T20:32:02.297" CommentCount="15" ContentLicense="CC BY-SA 4.0" />
  <row Id="18475" PostTypeId="2" ParentId="2140" CreationDate="2020-01-24T00:09:05.530" Score="0" Body="&lt;h1&gt;Factorise a floating point number&lt;/h1&gt;&#xA;&lt;p&gt;Given a target floating point number, &lt;span class=&quot;math-container&quot;&gt;\$T\$&lt;/span&gt; and a set of &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; floating point numbers &lt;span class=&quot;math-container&quot;&gt;\$\{x_{1},..,x_{N}\}\$&lt;/span&gt; and a permissible error &lt;span class=&quot;math-container&quot;&gt;\$tol\$&lt;/span&gt; , find a set of integer coefficients &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$\{m_{1},..,m_{N}\}\$&lt;/span&gt; such that:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;A\prod\limits_{i=1}^{N}x_{i}^{m_{i}} = T\pm{}tol&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;Input will be a target number, a set of real numbers and a tolerance as a decimal or percentage (note which) in any order or format required by your language.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Output should be &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$\{m\}\$&lt;/span&gt; and the corresponding error as a percentage. If multiple combinations are valid any or all sets of &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\{m\}\$&lt;/span&gt; are within tolerance.&lt;/p&gt;&#xA;&lt;h2&gt;General rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins.&lt;br /&gt;&#xA;Don't let code-golf languages discourage you from posting answers with non-codegolfing languages. Try to come up with an as short as possible answer for 'any' programming language.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet/2422#2422&quot;&gt;Standard rules apply&lt;/a&gt; for your answer with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods/&quot;&gt;default I/O rules&lt;/a&gt;, so you are allowed to use STDIN/STDOUT, functions/method with the proper parameters and return-type, full programs. Your call.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Default Loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;If possible, please add a link with a test for your code (i.e. &lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Also, adding an explanation for your answer is highly recommended.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$3*(3.2^4*7.1^2)=15857.614848\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;15857.6 [3.2, 7.1] 0.05 =&amp;gt; 3, [4, 2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$2*(e^2*\pi{}^2)=145.854121188\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;145.85 [2.7182, 3.1415] 0.1 =&amp;gt; 2, [2, 2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$3*(\pi^0*0.1^1)\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0.3 [3.14159, 0.1] 0.05 =&amp;gt; 3, [0, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="91386" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-01-24T00:09:05.530" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18476" PostTypeId="1" CreationDate="2020-01-24T00:09:59.180" Score="97" ViewCount="2338" Body="&lt;p&gt;Well. I never thought I'd be writing this message. I've logged into this site nearly every day for over 5 years. I truly love this community. I've learned so many things from it, and I have made countless friends that I consider just as close as people I know in real life. Which is why it's really hard to say that I'm going to be making an effort to start distancing myself from this site and the network.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I still reflexively open up The Nineteenth Byte every time I look at my phone, so I don't know how successful I will be at leaving. But I think it would be dishonest for me to continue to have a diamond next to my name. This is for a huge variety of reasons.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;I'm no longer a contributor. I still browse the site frequently, but I simply don't post on the site like I used to.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I'm no longer moderating, or handling flags. A large contributor to that is because I feel like the majority of flags I see are requests to delete several year old posts that &quot;technically&quot; violate some overly specific combination of rules on meta penned over the last 8 years. But the other reason is burnout and a waning interest in the janitorial tasks on the site. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I'm unhappy with the direction that SE is going. I don't feel a need to dwell too long on this one because it has been hashed and rehashed countless times across meta and chat. But I'm not willing to continue volunteering my time to a company that slanders it's volunteers then fires the employees that are interested in community building.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I'd rather invest in more sustainable outlets for the community that aren't as reliant on an external company. I've been spending a lot of time on &lt;a href=&quot;https://discord.gg/WCxqfcR&quot; rel=&quot;nofollow noreferrer&quot;&gt;The CGCC Discord Server&lt;/a&gt;, which I enjoy a lot. There is also a sister server I've been running for &lt;a href=&quot;https://discord.gg/6BU54qm&quot; rel=&quot;nofollow noreferrer&quot;&gt;talking about and playing games together.&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I don't want to be hard to reach, since I greatly enjoy talking with everyone I've met from this site. You can email me at &lt;code&gt;DJMcMayhem[at]gmail[dot]com&lt;/code&gt;, or add me on discord at &lt;code&gt;DJMcMayhem#9259&lt;/code&gt;. I hope that the community finds a replacement for me quickly and isn't too negatively affected by having only one mod for a period of time.&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="31716" LastEditDate="2020-01-24T14:42:07.240" LastActivityDate="2020-01-24T14:42:07.240" Title="Hanging up my diamond" Tags="|discussion|moderation|" AnswerCount="0" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18477" PostTypeId="1" CreationDate="2020-01-24T01:08:52.233" Score="34" ViewCount="1252" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18133/im-stepping-down?rq=1&quot;&gt;As&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18240/its-time-for-me-to-leave?noredirect=1&amp;amp;lq=1&quot;&gt;of&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18476/hanging-up-my-diamond&quot;&gt;recently&lt;/a&gt;, we've lost 3 of our 4 moderators. This means we only have 1 moderator left. Also, &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/53305694#53305694&quot;&gt;several&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/53307691#53307691&quot;&gt;people&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/53304533#53304533&quot;&gt; are expressing&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/53315330#53315330&quot;&gt;their&lt;/a&gt; concerns that things are dying around here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With the recent mess over on SE, the growing inactivity of past regulars, and a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18269/january-2020-moderator-election-community-interest-check?r=SearchResults&amp;amp;s=6|33.7909&quot;&gt;presumable lack of people wanting to become mods&lt;/a&gt;, I'd say we're in quite a pickle here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So what's next? Axtell? Because if that's the case, we'll be stuck in limbo for a while yet. We clearly won't be gaining new mods anytime soon and &lt;a href=&quot;https://code-golf.io/&quot; rel=&quot;nofollow noreferrer&quot;&gt;other&lt;/a&gt; &lt;a href=&quot;http://golf.shinh.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;sites&lt;/a&gt; just don't have the same community feel as CGCC does. Plus, we've worked so hard on getting this site where it is today.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I don't want to see this site die, so plausible options and suggestions would be appreciated. More concisely: do we stick with what we have? Or &#xA;is it finally time that we jump ship and look further ashore?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Edit&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If we are to stay, then I have a few more questions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;What are we going to do about getting new mods? I mean, I don't know how much @Doorknob can handle on their own.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Will the best of CGCC 2019 still continue?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What happens if more people leave?&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;If we are to go:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;How long would building a new community take? I mean in terms of site reputation, community feel, resources, and getting it to the point where it is &lt;em&gt;feels&lt;/em&gt; like CGCC. &lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;What happens to CGCC? &lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2020-01-24T01:50:31.333" LastActivityDate="2020-02-24T19:12:51.433" Title="What's the Future of CGCC?" Tags="|discussion|" AnswerCount="8" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18478" PostTypeId="2" ParentId="18477" CreationDate="2020-01-24T01:30:31.503" Score="6" Body="&lt;h2&gt;Stick with what we have&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://area51.stackexchange.com/proposals/4570/code-golf-programming-puzzles&quot;&gt;Back at 2010&lt;/a&gt; the site Code Golf had already been widely recognized. I feel that if we change a site to contribute to, then it would be confusing for new users who find this site seeing that nobody is contributing here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;hr/&gt;&#xA;In addition, there is no evidence that we need moderators for a golfing community. E.g. Axtell, Anarchy Golf (it doesn't have a concept of users), and codegolf.io seems to do perfectly well, despite not having a single user being a moderator. Therefore losing our moderators should not contribute to leaving this site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Although that the comminities mentioned above are not very active, their inactivity is probably not impacted not having modetators. I feel that it's simply because they always find Code Golf StackExchange before they find other comminities, and Code Golf.SE is &lt;em&gt;way&lt;/em&gt; more active than these other comminities, despite the fact that it's getting less contributions every time.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Answering the further questions&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;What are we going to do about getting new mods? I mean, I don't know how much @Doorknob can handle on their own.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;As I've mentioned before, a Code Golfing comminity doesn't need moderators to do well. And @Doorknob probably won't need to do a lot, given this site's decreasing activity.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Will the best of CGCC 2019 still continue?&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I believe that the best of CGCC 2019 will eventually be posted.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;What happens if more people leave?&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It's not going to affect the community. New users are always going to find this site and try to contribute with the holes left by the leaving users, like a cycle. We end up having all high-rep users not contributing, but we still have new users contributing.&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2020-01-24T02:16:32.423" LastActivityDate="2020-01-24T02:16:32.423" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18481" PostTypeId="2" ParentId="18477" CreationDate="2020-01-24T10:30:56.223" Score="10" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Or is it finally time that we jump ship and look further ashore?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;If you do decide you want to move, we'd be very happy to host CGCC on &lt;a href=&quot;https://topanswers.xyz/&quot; rel=&quot;nofollow noreferrer&quot;&gt;TopAnswers&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'll keep a tab open in The Nineteenth Byte if anyone wants to discuss the idea…&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Update 25th Jan:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We have set up a private 'beta' community on TopAnswers — if it gets a handful of active participants they can choose to take it public when they want to (currently 3 have access)&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A few questions have been added including these meta questions…&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&quot;Which challenge types and subject tags should we allow?&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/8r1Jt.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/8r1Jt.png&quot; alt=&quot;![Meta Question&quot;&gt;&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&quot;How should voting work here?&quot;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;…and some actual Code Golf:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/AZu2Y.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/AZu2Y.png&quot; alt=&quot;Actual Code Golf&quot;&gt;&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;We've also:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;added KaTeX&lt;/li&gt;&#xA;&lt;li&gt;added special 'question types', instead of implementing 'labels' as special tags, as you have here on SE&lt;/li&gt;&#xA;&lt;li&gt;implemented different voting rules per question type&lt;/li&gt;&#xA;&lt;li&gt;agreed to add an answer summary list below the question post (and above the answers) for you to trial (a bit like the answer summaries on the question lists on TopAnswers — an example is the image above)&lt;/li&gt;&#xA;&lt;li&gt;will be forcing DejaVu Sans Mono for code on Code Golf (other TopAnswers communities currently allow people to choose their own preferred font)&lt;/li&gt;&#xA;&lt;li&gt;implemented sandboxing of new posts&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Anyone who would like to join the private 'beta' should just sign up on TopAnswers and let me know with comment on this answer, or ping me in The Nineteenth Byte here, or &lt;a href=&quot;https://topanswers.xyz/meta?room=1&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Tavern on TA&lt;/a&gt;  &lt;/p&gt;&#xA;" OwnerUserId="91666" LastEditorUserId="91666" LastEditDate="2020-01-31T08:26:52.627" LastActivityDate="2020-01-31T08:26:52.627" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18482" PostTypeId="2" ParentId="18477" CreationDate="2020-01-24T10:51:03.813" Score="3" Body="&lt;h1&gt;Some people are no longer interested in golfing&lt;/h1&gt;&#xA;&lt;p&gt;There has been many people that left recently due to SE actions and drama.&lt;/p&gt;&#xA;&lt;p&gt;However there’s also the natural circle of life that people get bored/tired of a subject and simply stop caring. This is my case. Other top contributors had left before (Martin Ender left way before all this drama)&lt;/p&gt;&#xA;&lt;p&gt;TNB’s activity in the last year and more is extremely low compared to what it was in e.g. 2016.&lt;/p&gt;&#xA;&lt;p&gt;This is not an answer to this question per se, just a reiteration that PPCG has been dying for way longer than the last few weeks of SE drama. IMO there’s no &amp;quot;saving it&amp;quot;, and I’m not personally interested to do so. I had fun here while it lasted, that’s it.&lt;/p&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-01-24T10:51:03.813" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18483" PostTypeId="2" ParentId="18477" CreationDate="2020-01-24T13:48:46.793" Score="3" Body="&lt;h1&gt;None&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This may not be a popular answer, but this is the pattern I've seen in communities time and time again.  Communities will grow, then they will die off.  You will likely find remnants of the community in other locations (19th Byte/Discord/TopAnswers/Codidact/Other golf oriented sites).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finding the community that feels the same will likely never happen.  A large part of why this community &quot;feels&quot; this way is due to (A) the platform and (B) the individual contributors.  A change in platform and a change in individuals will necessarily mean a change in community feel.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is not a bad thing.  Many of the communities I've participated on have gone (The Continuum, Nowhere Else &amp;amp; Beyond, Grooveshark, to name a few).  But as new communities pop up I make new friends and continue to pursue my interests.  I recommend you do the same.&lt;/p&gt;&#xA;" OwnerUserId="20198" LastEditorDisplayName="user85052" LastEditDate="2020-01-24T15:20:00.840" LastActivityDate="2020-01-24T15:20:00.840" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18485" PostTypeId="2" ParentId="18477" CreationDate="2020-01-24T22:40:33.253" Score="8" Body="&lt;p&gt;Until a community is fully developed somewhere else, if you are unsatisfied with StackExchange, &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I suggest that you contribute to an in-progress community's development&lt;/strong&gt; on the side.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is being talked about on &lt;a href=&quot;https://codidact.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;Codidact&lt;/a&gt;, too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;See &lt;a href=&quot;https://forum.codidact.org/t/a-proposal-split-the-team-launch-quicker/808&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://forum.codidact.org/t/a-proposal-split-the-team-launch-quicker/808&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Though I haven't looked much at alternatives and I don't really do codegolf anymore, I am hoping that Codidact will develop into an alternative to SE.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I digress:&lt;/strong&gt; Now, most of what Codegolf.SE is to me is memories, rather than active participation. I think that is still a good thing. I still have unfinished answers/projects for some tough questions/challenges, and I hope to complete them someday, such as inverting a PCRE regex in Python, or making an n-bit prime-checker in Minecraft.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastActivityDate="2020-01-24T22:40:33.253" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18486" PostTypeId="2" ParentId="18136" CreationDate="2020-01-24T23:29:34.493" Score="7" Body="&lt;h1&gt;Places we might go&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(Starting a CW answer to track potential places to go. Please add information. --xnor)&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://topanswers.xyz/&quot; rel=&quot;nofollow noreferrer&quot;&gt;TopAnswers&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Has a &lt;a href=&quot;https://topanswers.xyz/codegolf&quot; rel=&quot;nofollow noreferrer&quot;&gt;live code golf site&lt;/a&gt;. Non-profit Q&amp;amp;A site being built. Says they'll have a feature to &lt;a href=&quot;https://topanswers.xyz/meta?q=236#a176&quot; rel=&quot;nofollow noreferrer&quot;&gt;import SE content&lt;/a&gt;. Brought up as a place to go in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18481/20260&quot;&gt;this meta answer&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://axtell.vihan.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Axtell&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A community project that has restarted development. &lt;a href=&quot;https://github.com/Axtell&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github page&lt;/a&gt;, &lt;a href=&quot;https://discordapp.com/channels/133419285409169408/643650788593238027&quot; rel=&quot;nofollow noreferrer&quot;&gt;Discord channel&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codidact.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Codidact&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&quot;This project was started by a group of Stack Exchange users who were (and are) dissatisfied with the way Stack Exchange is running things, on a number of counts.&quot; Currently hosts &lt;a href=&quot;https://writing.codidact.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Writing community&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2020-02-28T23:20:35.347" LastActivityDate="2020-02-28T23:20:35.347" CommentCount="1" CommunityOwnedDate="2020-01-24T23:29:34.493" ContentLicense="CC BY-SA 4.0" />
  <row Id="18487" PostTypeId="2" ParentId="18477" CreationDate="2020-01-25T00:00:41.503" Score="14" Body="&lt;h1&gt;I'm a bit more positive regarding CGCC&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Do we stick with what we have?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I say yes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Recent events with SE Inc. have been very unfortunate. I see reasons to disagree with &lt;em&gt;the company&lt;/em&gt;, and how that can lead one to cease being a moderator, or to volunteer time for them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But that doesn't mean we should leave this &lt;em&gt;community&lt;/em&gt;. When we post a challenge, answer, or discuss in TNB it's not for the benefit of SE Inc. We do that for ourselves, for the community. And as for the questionable rules that are being imposed like the new CoC and the pronoun stuff, personally I haven't had any problem so far just ignoring them and following the &quot;be nice&quot; principle.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I like this community. I have met some really clever people here, had many interesting conversations, and a lot of fun. I would like that to continue. And I think it has to be here, not elsewhere. As I argued &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18141/36398&quot;&gt;in another answer&lt;/a&gt;, there is no &lt;em&gt;moving&lt;/em&gt; to another community. It would just be a parallel community, with a different culture, competing with this one. And I don't see how the new community would be better than this one, or even viable.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If we are to stay: &lt;p&gt; What are we going to do about getting new mods? I mean, I don't know how much @Doorknob can handle on their own.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I would see that as a problem of the company, more than a problem of the community; but of course the community would be impacted by not having enough moderators. I guess SE Inc. would intervene. Maybe staff would do some minimal moderation. &lt;s&gt;I don't really know.&lt;/s&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Update&lt;/em&gt;: &lt;a href=&quot;https://meta.stackexchange.com/a/342916/236085&quot;&gt;A site could be shut down if there are not enough people to moderate it&lt;/a&gt;. With that knowledge, I think people may be more inclined to become moderators than they have shown &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/18269/36398&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Will the best of CGCC 2019 still continue?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Yes, if we want. That doesn't require a lot of moderator intervention anyway. Nominations, votes and bounty-awarding can all be done by regular users.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;What happens if more people leave?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;People leave and people come, all the time. As long as there's a reasonable amount of people the community can go on.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If we are to go: &lt;p&gt; How long would building a new community take? I mean in terms of site reputation, community feel, resources, and getting it to the point where it is feels like CGCC&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It would take long, and there's the problem of making it all viable (financial support? Volunteer work?).&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;What happens to CGCC?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;It continues to exist and competes with the new community, appearing first in search results, and probably attracting more new users than the alternative community, at least in the mid term. &lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2020-01-27T15:35:32.530" LastActivityDate="2020-01-27T15:35:32.530" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18488" PostTypeId="1" CreationDate="2020-01-25T10:57:30.800" Score="0" ViewCount="63" Body="&lt;p&gt;I am new to Code Golf, and would like to start answering questions/scenarios posted on this Stack Exchange Site. I have seen many scenarios posted before, and have come up with solutions for said scenario, as well as seeing &lt;em&gt;how&lt;/em&gt; a answer is submitted for a given scenario (i.e. the language name, followed by the byte size of your proposed solution, etc). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;What is stopping me from submitting answers on these questions is that I am not sure how to calculate the bytes size of my solution. Do we only submit the byte size of the code we created, and discard the rest (like the main method declarations and imports from external libraries), or do we submit the byte size of the entire solution (i.e. Imports and all)?&lt;/p&gt;&#xA;" OwnerUserId="74376" LastActivityDate="2020-01-25T10:57:30.800" Title="How does one calculate bytes for a solution to a Code Golf scenario?" Tags="|discussion|support|" AnswerCount="0" CommentCount="1" ClosedDate="2020-01-26T13:24:16.763" ContentLicense="CC BY-SA 4.0" />
  <row Id="18490" PostTypeId="2" ParentId="2140" CreationDate="2020-01-26T12:31:12.163" Score="4" Body="&lt;h2&gt;Reversed Iota's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I &lt;a href=&quot;https://github.zhaw.ch/munt/Gulf&quot; rel=&quot;nofollow noreferrer&quot;&gt;didn't&lt;/a&gt; invent this challenge, but I find it very interesting to solve.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For every input number, e.g.:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Generate a range from 1 to that number:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1 2 3 4]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And then, for every item in that list, generate a list from 1 to that number:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[1] [1 2] [1 2 3] [1 2 3 4]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then, reverse every item of that list.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[1] [2 1] [3 2 1] [4 3 2 1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Notes:&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1 being a loose item is allowed, since flattening will not matter with this anyway.&lt;/li&gt;&#xA;&lt;li&gt;To preserve the spirit of the challenge, the range has to be 1-indexed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2020-01-30T02:41:26.860" LastActivityDate="2020-01-30T02:41:26.860" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18494" PostTypeId="1" CreationDate="2020-01-30T22:10:57.813" Score="7" ViewCount="227" Body="&lt;p&gt;I am very enthusiastic about this community (but I am very very young here) and I really want to contribute with new challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, I don't want to &quot;clog&quot; the sandbox with challenges I propose. Would you say there is a limit on the number of challenges I post on the sandbox? Or would you say that, as long as they are valid and legitimate challenges, I am welcome to post them in the sandbox? Or would you say something else?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I am writing mainly in view of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/13608/should-every-question-be-sandboxed&quot;&gt;this&lt;/a&gt; meta question. I want to get a better feel for what this community enjoys and appreciates. When I get the hang of it, I trust in my intelligence to be able to post good challenges without having to sandbox all of them.&lt;/p&gt;&#xA;" OwnerUserId="75323" LastEditorUserId="75323" LastEditDate="2020-01-30T23:51:34.833" LastActivityDate="2020-01-30T23:58:25.677" Title="What is too many sandboxed challenges?" Tags="|discussion|support|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18495" PostTypeId="2" ParentId="18494" CreationDate="2020-01-30T23:58:25.677" Score="15" Body="&lt;h1&gt;Don't worry about clogging the sandbox&lt;/h1&gt;&#xA;&lt;p&gt;In fact, thank you for using it — I wish every new contributor did so!&lt;/p&gt;&#xA;&lt;p&gt;Every once in a while, we have created a new sandbox because the old one simply got too full. You'll find that many experienced users have several unfinished ideas lingering there too.&lt;/p&gt;&#xA;&lt;p&gt;When you post your challenge to the main site:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Edit the sandbox post to say only &lt;code&gt;[Challenge title](link to main challenge)&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Delete the sandbox post&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-01-30T23:58:25.677" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18497" PostTypeId="2" ParentId="2140" CreationDate="2020-01-31T10:43:22.507" Score="1" Body="&lt;h3&gt;Posted: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/198846/find-the-inverse-neighbor-pairs&quot;&gt;Find the Inverse Neighbor Pairs&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;/h3&gt;&#xA;" OwnerUserId="71546" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-02-03T03:07:12.103" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18499" PostTypeId="2" ParentId="2140" CreationDate="2020-02-02T01:26:46.507" Score="1" Body="&lt;h1&gt;Balanced interval tree &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You will write &lt;a href=&quot;https://en.wikipedia.org/wiki/Interval_tree#Augmented_tree&quot; rel=&quot;nofollow noreferrer&quot;&gt;a balanced, online interval tree&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A function, method, or procedure that performs insertion into a query of intervals that overlap with an interval over a, b in &lt;code&gt;O(log n)&lt;/code&gt; time, given that a is less than b, including:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;intervals that fully enclose a, b&lt;/li&gt;&#xA;&lt;li&gt;intervals fully within a, b&lt;/li&gt;&#xA;&lt;li&gt;intervals that start to the left of a but end before b&lt;/li&gt;&#xA;&lt;li&gt;intervals that start to the right of a but end after b&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;A function, method, or procedure that performs insertion ov an arbitrary interval a,b into a data structure in &lt;code&gt;O(log n)&lt;/code&gt; time&lt;/li&gt;&#xA;&lt;li&gt;Both O-bounds must hold after arbitrary series of insertions and queries&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Requirements&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you write non-method functions, your submission may take the data structure as a global variable or receive the data structure as the first parameter.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must informally prove your submission falls within the required O-bounds or name the data structure your program implements. If the name of the data structure you are implementing is obscure, you may name the paper of the data structure.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the submission with the shortest length in bytes wins. &lt;/p&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2020-02-02T01:26:46.507" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18500" PostTypeId="2" ParentId="2447" CreationDate="2020-02-02T08:34:03.983" Score="4" Body="&lt;h2&gt;Functions are allowed to overwrite global data structures as its output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The premise of this is that your language does not support built-in return values.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, Assembly language doesn't have a built-in way of returning values, therefore a global accumulator is permitted as a return value.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In Scratch, there are no functions (only procedures), therefore global variables are allowed as the output of the function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In stack-based languages, functions take arbitary items from the stack, and modify the stack. The return value is therefore stored onto the stack.&lt;/p&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2020-02-02T08:42:19.047" LastActivityDate="2020-02-02T08:42:19.047" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18501" PostTypeId="2" ParentId="18477" CreationDate="2020-02-02T18:57:50.020" Score="12" Body="&lt;h1&gt;We Can't Really Leave&lt;/h1&gt;&#xA;&lt;p&gt;I hate to say it, but this site's lifeblood is Hot Network Questions. Without HNQ, this site dies. Therefore, we can't leave. We exist because we are a cool little recreational programming site that gets traffic and new members from the fact that we are advertised on the biggest programming Q&amp;amp;A site in the world, plus the fact that any good question asked here is really good at gaming the HNQ algorithm.&lt;/p&gt;&#xA;" OwnerUserId="65836" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-02-02T18:57:50.020" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18503" PostTypeId="2" ParentId="2140" CreationDate="2020-02-03T06:44:41.797" Score="2" Body="&lt;h2&gt;Decode the password&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a &lt;em&gt;printable ASCII&lt;/em&gt; string separated with spaces, output the specified index of every word. E.g. &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;are turbas unsafe ?!&quot;, 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;will yield &lt;code&gt;run!&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When the index is out of bounds, this index should yield the null string (which can be joined with other strings).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;More test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;Is Pascal truly unloyal to users?&quot;,3 -&amp;gt; &quot;sure&quot;&#xA;&quot;I'd pass kittens to anyone stopping by!!&quot;,4 -&amp;gt; &quot;stop!&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerDisplayName="user85052" LastEditorDisplayName="user85052" LastEditDate="2020-02-11T13:28:57.760" LastActivityDate="2020-02-11T13:28:57.760" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18509" PostTypeId="2" ParentId="2140" CreationDate="2020-02-06T07:26:12.280" Score="1" Body="&lt;h1&gt;Recolour my Table (Abandoned)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2020-10-20T10:12:16.610" LastActivityDate="2020-10-20T10:12:16.610" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18510" PostTypeId="2" ParentId="2140" CreationDate="2020-02-06T08:06:26.750" Score="1" Body="&lt;h1&gt;floating-point error matters&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a &lt;strong&gt;expression&lt;/strong&gt; of &lt;strong&gt;floating-point numbers&lt;/strong&gt; in any languages. When calculating the expression without floating-point errors (as what a human do), it should be 0. But with floating-point errors (as what happened in your language), it yield 1 instead.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Floating-point numbers are some numbers which store a finite number digits (binary or decimal or in any other bases) of fraction, plus an exponent in computer. It may be IEEE 754, but not must be.&lt;/li&gt;&#xA;&lt;li&gt;Loss of precision due to integer types (which do not has a exponent) are not allowed in the expression. You are still allowed to include integers (or even other types) in your expression as long as operations such as rounding into an integer are not the root of errors.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Shortest codes win as code-golf.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Sandbox:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is there any duplicates here?&lt;/li&gt;&#xA;&lt;li&gt;Is asking for an expression instead of full program allowed?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="44718" LastEditorUserId="44718" LastEditDate="2020-02-06T12:12:33.913" LastActivityDate="2020-02-06T12:12:33.913" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18512" PostTypeId="2" ParentId="2140" CreationDate="2020-02-07T00:07:41.790" Score="3" Body="&lt;h1&gt;The uniquely solvable sudoku &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;The task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a standard &lt;code&gt;9x9&lt;/code&gt; sudoku board, output a Truthy value if that sudoku admits one and only one solution. Output a Falsy value if the sudoku has a number of solutions other than one. This means 0 solutions and two or more solutions.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The board can be given in any sensible format. Some come to mind, and I'll exemplify for a &lt;code&gt;4x4&lt;/code&gt; sudoku.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a &lt;code&gt;2D&lt;/code&gt; array with the state of the board, with any placeholder value for non-filled cells (including the digit 0, or no value at all if your language supports it): &lt;code&gt;[[1,2,#,4],[#,4,1,2],[2,1,4,#],[4,#,2,1]]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;a string of the digits row by row or column by column, so &lt;code&gt;&quot;12#4#412214#4#21&quot;&lt;/code&gt; or &lt;code&gt;&quot;1#24241##14242#1&quot;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;The output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A Truthy value if the sudoku puzzle has a unique solution, Falsy otherwise.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(To add)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Truthy&lt;/h3&gt;&#xA;&#xA;&lt;h3&gt;Falsy&lt;/h3&gt;&#xA;" OwnerUserId="75323" LastEditorUserId="75323" LastEditDate="2020-02-13T20:00:13.410" LastActivityDate="2020-02-13T20:00:13.410" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18514" PostTypeId="1" AcceptedAnswerId="18515" CreationDate="2020-02-07T08:20:53.163" Score="2" ViewCount="76" Body="&lt;p&gt;Should another user post another answer, instead of commenting, in a language that already has answers from somebody else, in the following circumstances?&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It is a modified version of the current answer.&lt;/li&gt;&#xA;&lt;li&gt;It uses an entirely different algorithm, etc.&lt;/li&gt;&#xA;&lt;li&gt;Part of the new answer is a derivation from the first one, and part of the new answer utilizes another algorithm.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;My personal idea is &lt;strong&gt;No&lt;/strong&gt; for the first one and &lt;strong&gt;Yes&lt;/strong&gt; for the second one. However, what about the third one?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Notice I'm not discussing copyright here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do we already have a consensus on this? I cannot find up-to-date posts after a bit of research. The only thing I come up with is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1338/second-answer-for-second-language&quot;&gt;mniip's idea&lt;/a&gt; from 2014.&lt;/p&gt;&#xA;" OwnerUserId="59292" LastActivityDate="2020-02-07T09:08:23.010" Title="Consensus on another user posting another answer in the same language" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18515" PostTypeId="2" ParentId="18514" CreationDate="2020-02-07T09:08:23.010" Score="12" Body="&lt;p&gt;I don’t think there can be a consensus on this because it highly depends about the initial and new answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I personally do the following:&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Comment but don’t post a new answer&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;if the improvement is fairly straightforward for someone that knows the language well and was overlooked by the author.&lt;/li&gt;&#xA;&lt;li&gt;If the improvement uses language quirks that the author might not have known but don’t fundamentally change the algorithm used initially.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Post a new answer, but cite the original answer&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If I came up with my answer after looking at the original one, and part of my answer is directly inspired / copied from the original one, while the rest uses an original algorithm&lt;/li&gt;&#xA;&lt;li&gt;(I also do this if I get inspired by an answer in another language than the one I’m using, and I transcribed parts of it into my answer)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Post a new answer, without citing the original answer&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If I came up with my answer after looking at the original one, which inspired me to come up with a completely different approach&lt;/li&gt;&#xA;&lt;li&gt;If I came up with my answer independently, with no knowledge of other answers (duh)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41723" LastActivityDate="2020-02-07T09:08:23.010" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18516" PostTypeId="2" ParentId="2140" CreationDate="2020-02-07T09:50:29.560" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/199208/count-switches-in-a-smallest-square-root-sequence-mod-2n&quot;&gt;Count switches in a smallest square root sequence mod &lt;span class=&quot;math-container&quot;&gt;\$2^n\$&lt;/span&gt;&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="71546" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-02-10T08:41:16.817" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18519" PostTypeId="1" AcceptedAnswerId="18520" CreationDate="2020-02-08T06:27:51.040" Score="2" ViewCount="126" Body="&lt;p&gt;I'm going to make a challenge involving &lt;strong&gt;Mahjong Tiles&lt;/strong&gt; (U+1F000 – U+1F02F, though I'm going to use only U+1F000 – U+1F021).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;I'm concerned whether &quot;major&quot; golfing languages, such as 05AB1E, Jelly, APL, and Charcoal will handle Unicode characters easily. Should I represent the tiles in ASCII characters instead?&lt;/p&gt;&#xA;" OwnerUserId="89459" LastActivityDate="2020-02-12T20:43:09.577" Title="Are all golfing languages friendly to Unicode?" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18520" PostTypeId="2" ParentId="18519" CreationDate="2020-02-08T07:22:10.160" Score="2" Body="&lt;h1&gt;Allow For Both&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;My take on this situation is that you should allow languages to take the input in whatever seems to be the most effective way. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you specifically want to use unicode where possible, I would personally use something like this:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;If your language of choice doesn't support non-ascii characters, you may take input in [some other format]&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2020-02-12T20:43:09.577" LastActivityDate="2020-02-12T20:43:09.577" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18522" PostTypeId="2" ParentId="2140" CreationDate="2020-02-08T11:31:02.650" Score="1" Body="&lt;p&gt;No title yet.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;By Zekendorf's theorem every non-negative integer has a unique representation as the sum of Fibonacci numbers where no two numbers coincide or are adjacent.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2677/&quot;&gt;The minimum fibonacci challenge!&lt;/a&gt; the challenge was to output the list of Fibonacci numbers. However, you can instead consider the list of coefficients of the sum &lt;span class=&quot;math-container&quot;&gt;\$ \small x_0F(2) + x_1F(3) + x_2F(4) + \ldots \$&lt;/span&gt; (since &lt;span class=&quot;math-container&quot;&gt;\$ \small F(0) = 0 \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$ \small F(1) = F(2) \$&lt;/span&gt; never appear in the Zekendorf representation) and represent that as a binary number &lt;span class=&quot;math-container&quot;&gt;\$ \ldots x_2 x_1 x_0 \$&lt;/span&gt;, e.g. &lt;span class=&quot;math-container&quot;&gt;\$ \small 67 = \small 1F(2) + 0F(3) + 1F(4) + 0F(5) + 1F(6) + 0F(7) + 0F(8) + 0F(9) + 1F(10) \$&lt;/span&gt; which we can represent using the binary number &lt;span class=&quot;math-container&quot;&gt;\$ \small 100010101 \$&lt;/span&gt; or &lt;span class=&quot;math-container&quot;&gt;\$ \small 277 \$&lt;/span&gt; in decimal.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We can readily convert the binary representation back into the original integer by calculating the sum of the relevant Fibonacci numbers. However, I would like you to, given an input integer &lt;span class=&quot;math-container&quot;&gt;\$ \small n \$&lt;/span&gt;, output the decimal integer whose binary representation encodes the Zekendorf representation of &lt;span class=&quot;math-container&quot;&gt;\$ \small n \$&lt;/span&gt; in this way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the smallest function or program that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2020-02-08T20:13:00.910" LastActivityDate="2020-02-08T20:13:00.910" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18524" PostTypeId="2" ParentId="2140" CreationDate="2020-02-09T20:57:55.697" Score="0" Body="&lt;h1&gt;The periodic table and the chemical symbols &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Periodic table&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The periodic table is a large table&lt;sup&gt;&lt;a href=&quot;https://xkcd.com/285/&quot; rel=&quot;nofollow noreferrer&quot;&gt;citation needed&lt;/a&gt;&lt;/sup&gt; where we can find the chemical elements written out with their chemical symbols. For example, Helium shows up as &lt;code&gt;He&lt;/code&gt; and Carbon shows up as &lt;code&gt;C&lt;/code&gt;. You can &lt;a href=&quot;https://en.wikipedia.org/wiki/Periodic_table&quot; rel=&quot;nofollow noreferrer&quot;&gt;read Wikipedia's article&lt;/a&gt; on the periodic table, if you want.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Your task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You have to write a function/program/procedure/... that, given a chemical element's name, returns its chemical symbol. For the purposes of this challenge, we will use the 118 elements listed below:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;['Hydrogen', 'Helium', 'Lithium', 'Beryllium', 'Boron', 'Carbon', 'Nitrogen', 'Oxygen', 'Fluorine', 'Neon', 'Sodium', 'Magnesium', 'Aluminium', 'Silicon', 'Phosphorus', 'Sulfur', 'Chlorine', 'Argon', 'Potassium', 'Calcium', 'Scandium', 'Titanium', 'Vanadium', 'Chromium', 'Manganese', 'Iron', 'Cobalt', 'Nickel', 'Copper', 'Zinc', 'Gallium', 'Germanium', 'Arsenic', 'Selenium', 'Bromine', 'Krypton', 'Rubidium', 'Strontium', 'Yttrium', 'Zirconium', 'Niobium', 'Molybdenum', 'Technetium', 'Ruthenium', 'Rhodium', 'Palladium', 'Silver', 'Cadmium', 'Indium', 'Tin', 'Antimony', 'Tellurium', 'Iodine', 'Xenon', 'Cesium', 'Barium', 'Lanthanum', 'Cerium', 'Praseodymium', 'Neodymium', 'Promethium', 'Samarium', 'Europium', 'Gadolinium', 'Terbium', 'Dysprosium', 'Holmium', 'Erbium', 'Thulium', 'Ytterbium', 'Lutetium', 'Hafnium', 'Tantalum', 'Tungsten', 'Rhenium', 'Osmium', 'Iridium', 'Platinum', 'Gold', 'Mercury', 'Thallium', 'Lead', 'Bismuth', 'Polonium', 'Astatine', 'Radon', 'Francium', 'Radium', 'Actinium', 'Thorium', 'Protactinium', 'Uranium', 'Neptunium', 'Plutonium', 'Americium', 'Curium', 'Berkelium', 'Californium', 'Einsteinium', 'Fermium', 'Mendelevium', 'Nobelium', 'Lawrencium', 'Rutherfordium', 'Dubnium', 'Seaborgium', 'Bohrium', 'Hassium', 'Meitnerium', 'Darmstadtium', 'Roentgenium', 'Copernicium', 'Nihonium', 'Flerovium', 'Moscovium', 'Livermorium', 'Tennessine', 'Oganesson']&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;with the respective element symbols:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;['H', 'He', 'Li', 'Be', 'B', 'C', 'N', 'O', 'F', 'Ne', 'Na', 'Mg', 'Al', 'Si', 'P', 'S', 'Cl', 'Ar', 'K', 'Ca', 'Sc', 'Ti', 'V', 'Cr', 'Mn', 'Fe', 'Co', 'Ni', 'Cu', 'Zn', 'Ga', 'Ge', 'As', 'Se', 'Br', 'Kr', 'Rb', 'Sr', 'Y', 'Zr', 'Nb', 'Mo', 'Tc', 'Ru', 'Rh', 'Pd', 'Ag', 'Cd', 'In', 'Sn', 'Sb', 'Te', 'I', 'Xe', 'Cs', 'Ba', 'La', 'Ce', 'Pr', 'Nd', 'Pm', 'Sm', 'Eu', 'Gd', 'Tb', 'Dy', 'Ho', 'Er', 'Tm', 'Yb', 'Lu', 'Hf', 'Ta', 'W', 'Re', 'Os', 'Ir', 'Pt', 'Au', 'Hg', 'Tl', 'Pb', 'Bi', 'Po', 'At', 'Rn', 'Fr', 'Ra', 'Ac', 'Th', 'Pa', 'U', 'Np', 'Pu', 'Am', 'Cm', 'Bk', 'Cf', 'Es', 'Fm', 'Md', 'No', 'Lr', 'Rf', 'Db', 'Sg', 'Bh', 'Hs', 'Mt', 'Ds', 'Rg', 'Cn', 'Nh', 'Fl', 'Mc', 'Lv', 'Ts', 'Og']&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The code you write should receive an element name in any sensible format, such as a string &lt;code&gt;&quot;helium&quot;&lt;/code&gt;. You may assume whatever capitalization that suits your needs.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The code you write should return the element's symbol as a string, with any capitalization that suits your needs. &lt;a href=&quot;https://codegolf.stackexchange.com/q/199102/75323&quot;&gt;Bonus imaginary internet points&lt;/a&gt; if you return the symbol with the standard capitalization.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; so your answer doesn't win by being the shortest! You will be provided &lt;code&gt;118&lt;/code&gt; test cases. Your score will be your code's byte count divided by the percentage of test cases your code passes correctly. Lowest score wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;E.g. my code has 1 byte and I get 1 test case correct. My score is &lt;span class=&quot;math-container&quot;&gt;\$1 / \frac{1}{118} = 118 \$&lt;/span&gt;. Someone else writes some code with 110 bytes but gets all the test cases correct. The other person scores &lt;span class=&quot;math-container&quot;&gt;\$ 110 / \frac{118}{118} = 110 \$&lt;/span&gt;, meaning the other person has a better score than me.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;'Hydrogen' -&amp;gt; 'H'&#xA;'Helium' -&amp;gt; 'He'&#xA;'Lithium' -&amp;gt; 'Li'&#xA;'Beryllium' -&amp;gt; 'Be'&#xA;'Boron' -&amp;gt; 'B'&#xA;'Carbon' -&amp;gt; 'C'&#xA;'Nitrogen' -&amp;gt; 'N'&#xA;'Oxygen' -&amp;gt; 'O'&#xA;'Fluorine' -&amp;gt; 'F'&#xA;'Neon' -&amp;gt; 'Ne'&#xA;'Sodium' -&amp;gt; 'Na'&#xA;'Magnesium' -&amp;gt; 'Mg'&#xA;'Aluminium' -&amp;gt; 'Al'&#xA;'Silicon' -&amp;gt; 'Si'&#xA;'Phosphorus' -&amp;gt; 'P'&#xA;'Sulfur' -&amp;gt; 'S'&#xA;'Chlorine' -&amp;gt; 'Cl'&#xA;'Argon' -&amp;gt; 'Ar'&#xA;'Potassium' -&amp;gt; 'K'&#xA;'Calcium' -&amp;gt; 'Ca'&#xA;'Scandium' -&amp;gt; 'Sc'&#xA;'Titanium' -&amp;gt; 'Ti'&#xA;'Vanadium' -&amp;gt; 'V'&#xA;'Chromium' -&amp;gt; 'Cr'&#xA;'Manganese' -&amp;gt; 'Mn'&#xA;'Iron' -&amp;gt; 'Fe'&#xA;'Cobalt' -&amp;gt; 'Co'&#xA;'Nickel' -&amp;gt; 'Ni'&#xA;'Copper' -&amp;gt; 'Cu'&#xA;'Zinc' -&amp;gt; 'Zn'&#xA;'Gallium' -&amp;gt; 'Ga'&#xA;'Germanium' -&amp;gt; 'Ge'&#xA;'Arsenic' -&amp;gt; 'As'&#xA;'Selenium' -&amp;gt; 'Se'&#xA;'Bromine' -&amp;gt; 'Br'&#xA;'Krypton' -&amp;gt; 'Kr'&#xA;'Rubidium' -&amp;gt; 'Rb'&#xA;'Strontium' -&amp;gt; 'Sr'&#xA;'Yttrium' -&amp;gt; 'Y'&#xA;'Zirconium' -&amp;gt; 'Zr'&#xA;'Niobium' -&amp;gt; 'Nb'&#xA;'Molybdenum' -&amp;gt; 'Mo'&#xA;'Technetium' -&amp;gt; 'Tc'&#xA;'Ruthenium' -&amp;gt; 'Ru'&#xA;'Rhodium' -&amp;gt; 'Rh'&#xA;'Palladium' -&amp;gt; 'Pd'&#xA;'Silver' -&amp;gt; 'Ag'&#xA;'Cadmium' -&amp;gt; 'Cd'&#xA;'Indium' -&amp;gt; 'In'&#xA;'Tin' -&amp;gt; 'Sn'&#xA;'Antimony' -&amp;gt; 'Sb'&#xA;'Tellurium' -&amp;gt; 'Te'&#xA;'Iodine' -&amp;gt; 'I'&#xA;'Xenon' -&amp;gt; 'Xe'&#xA;'Cesium' -&amp;gt; 'Cs'&#xA;'Barium' -&amp;gt; 'Ba'&#xA;'Lanthanum' -&amp;gt; 'La'&#xA;'Cerium' -&amp;gt; 'Ce'&#xA;'Praseodymium' -&amp;gt; 'Pr'&#xA;'Neodymium' -&amp;gt; 'Nd'&#xA;'Promethium' -&amp;gt; 'Pm'&#xA;'Samarium' -&amp;gt; 'Sm'&#xA;'Europium' -&amp;gt; 'Eu'&#xA;'Gadolinium' -&amp;gt; 'Gd'&#xA;'Terbium' -&amp;gt; 'Tb'&#xA;'Dysprosium' -&amp;gt; 'Dy'&#xA;'Holmium' -&amp;gt; 'Ho'&#xA;'Erbium' -&amp;gt; 'Er'&#xA;'Thulium' -&amp;gt; 'Tm'&#xA;'Ytterbium' -&amp;gt; 'Yb'&#xA;'Lutetium' -&amp;gt; 'Lu'&#xA;'Hafnium' -&amp;gt; 'Hf'&#xA;'Tantalum' -&amp;gt; 'Ta'&#xA;'Tungsten' -&amp;gt; 'W'&#xA;'Rhenium' -&amp;gt; 'Re'&#xA;'Osmium' -&amp;gt; 'Os'&#xA;'Iridium' -&amp;gt; 'Ir'&#xA;'Platinum' -&amp;gt; 'Pt'&#xA;'Gold' -&amp;gt; 'Au'&#xA;'Mercury' -&amp;gt; 'Hg'&#xA;'Thallium' -&amp;gt; 'Tl'&#xA;'Lead' -&amp;gt; 'Pb'&#xA;'Bismuth' -&amp;gt; 'Bi'&#xA;'Polonium' -&amp;gt; 'Po'&#xA;'Astatine' -&amp;gt; 'At'&#xA;'Radon' -&amp;gt; 'Rn'&#xA;'Francium' -&amp;gt; 'Fr'&#xA;'Radium' -&amp;gt; 'Ra'&#xA;'Actinium' -&amp;gt; 'Ac'&#xA;'Thorium' -&amp;gt; 'Th'&#xA;'Protactinium' -&amp;gt; 'Pa'&#xA;'Uranium' -&amp;gt; 'U'&#xA;'Neptunium' -&amp;gt; 'Np'&#xA;'Plutonium' -&amp;gt; 'Pu'&#xA;'Americium' -&amp;gt; 'Am'&#xA;'Curium' -&amp;gt; 'Cm'&#xA;'Berkelium' -&amp;gt; 'Bk'&#xA;'Californium' -&amp;gt; 'Cf'&#xA;'Einsteinium' -&amp;gt; 'Es'&#xA;'Fermium' -&amp;gt; 'Fm'&#xA;'Mendelevium' -&amp;gt; 'Md'&#xA;'Nobelium' -&amp;gt; 'No'&#xA;'Lawrencium' -&amp;gt; 'Lr'&#xA;'Rutherfordium' -&amp;gt; 'Rf'&#xA;'Dubnium' -&amp;gt; 'Db'&#xA;'Seaborgium' -&amp;gt; 'Sg'&#xA;'Bohrium' -&amp;gt; 'Bh'&#xA;'Hassium' -&amp;gt; 'Hs'&#xA;'Meitnerium' -&amp;gt; 'Mt'&#xA;'Darmstadtium' -&amp;gt; 'Ds'&#xA;'Roentgenium' -&amp;gt; 'Rg'&#xA;'Copernicium' -&amp;gt; 'Cn'&#xA;'Nihonium' -&amp;gt; 'Nh'&#xA;'Flerovium' -&amp;gt; 'Fl'&#xA;'Moscovium' -&amp;gt; 'Mc'&#xA;'Livermorium' -&amp;gt; 'Lv'&#xA;'Tennessine' -&amp;gt; 'Ts'&#xA;'Oganesson' -&amp;gt; 'Og'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I used &lt;a href=&quot;https://tio.run/##dVbbjts2EH33VwjOQ2xgE6ToW4AWkOXbYn2D5aTZbYuCkmiLXYoUeNlUKPrt2xlSIhW08ZNmODM8c@ZCt52ppfjx9VUnPyXT6XSSwG@bvEu2XaXkjQqvoKihnNnGyTsG8o6ZelAs0GBBVceDzQI1UkkfIQMpI6roxQOIB2biDUdQHP/qBnEN4ppbqZig3gEvONDBnYCUy2q4a38DeU9ugupBlXJQpdw2TNjmrv8aDnPEnzPOyj7gCeRTLXVbS2W1t0ETy69W@QQwXlbzCClVeIO69SEeMIQ0RAcIGXFJ8zJcW2LMkogA/IJALsyQAO0zKD4TQYJJptzFSjYhW@GyFTcC@Xosa6TnPpAt0UUWhBtPF3N0l8@U@3PrztuW@tyeMOATE6WTNgh7Q2IlNxh8Q1UTUaba5a6pYN4pR5ucchpMFoh7gbB7vh5Q8aC61vQwzwUozrZgIdccTXJoC2EG1SNoHo1Rg/ykHFYFlRtUh8KlJ4tAEOa/l7wrKioGppH7Cy1rQUPss3UATB1Rn2tU1bG1ThXWFdiIFUlvvnteevqyytW5CgW6Rz7vY5Vz4arss84RbQoJNlJ0Hhp10Di3Ict7DAAgeuq@oMUXKob6IvtZ7PUFVmxBgvcO5R0RpiZD@hl1LsHkhDSeFNFUVl0Afqj8lI1Up8YZyobGac9Rl5Mm3rhCJldWyTY0TeW6qJI8jt2lcImqUKhlB4plp1slQzJbLN5W8oBghVBX0emCt19qG/rzsfA9Mgq8Qzw7a2Ktt1cMS64RDJJ0AZII7zW/oMKKmzb9FjpT1wyxO45I/FHHQis3drGBTwbZ4sSwgfgUkWwkrzwKt6ioKq3qa89dMqNpO2E2O0q8wwJHd8F0A13qj6XbMzy2f4p3ptrgpb5dzthvZ@C@X6aIcq2ICIvoTLxBCIHDkZZmVKra4ZKxYYjvA0PGZp9A@UnFvXBoXQO1xgbVyTpKrBkhxgqmDXRjQJShKosDsHj2D8pzfHSyq1@n7CpVCLXCiqyYgJpFVGsMtoaFFRZC5WgXFSyol4AVmTzIYvSsKTc3XxUdUXUddoSCewNjS6zS0hbxSXFLgZJCqltIonZvYB2y2mrXhPGJ2BsHjBkRR3OJRkuiGihpFXcVxj9LKswt9mMm/CKnQEhAfKjdOqwj32vunlOqZEh@X7oVqcuo2r24Rx22WhPLftFuZAW8NHporyNCObrXR0OL4b@GCYe/D5xpM2tIO@OkKSqS6I@Jfq9hdbez@R1@tpyZ2fQ3MZ3P59HjyjiM7tjpLuFjg/@E9HEAxHTuTSdvkq@KGZrAjtKJtGaiu6aQXP9PCPMxMb9@@N07vmnhOTez3no@gf5ogOLv@v3wrd9gPp8Yqs0fJazT77hep2//Rvd/3ibvfk7w@wN8T7@JFmNARl6FZL3/UzIxPpy/vv4L&quot; rel=&quot;nofollow noreferrer&quot;&gt;this code&lt;/a&gt; to shape the list into the test cases, might be useful to you.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Elements and symbols extracted from &lt;a href=&quot;https://www.thoughtco.com/element-list-names-atomic-numbers-606529&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.thoughtco.com/element-list-names-atomic-numbers-606529&lt;/a&gt;, visited at the 9th of February of 2020. At the time of writing, 118 elements were available. Source included &quot;Aluminum&quot; and &quot;Aluminium&quot; as alternatives, dropped &quot;Aluminum&quot; for the purposes of this challenge.&lt;/p&gt;&#xA;" OwnerUserId="75323" LastActivityDate="2020-02-09T20:57:55.697" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="18525" PostTypeId="1" CreationDate="2020-02-09T23:53:00.563" Score="2" ViewCount="56" Body="&lt;p&gt;I wanted to create a golfing competition that would be split in &lt;code&gt;n&lt;/code&gt; different challenges, each posted with &lt;code&gt;k&lt;/code&gt; days in between one another.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;n&lt;/code&gt; and &lt;code&gt;k&lt;/code&gt; are open for discussion here.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each challenge on its own would be a regular &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, but then the competition would also be scored. I was thinking of having your competition score be the sum of the byte counts of your submissions to the challenges. Much like your score in a golf match is the sum of your scores in each hole.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Furthermore I was thinking of requiring that all submissions be in different languages in order to be eligible to win the competition. The competition prize could be a rep bounty.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I was looking forward for you feedback, as the most experienced users can tell me how to make this work, pitfalls to avoid, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thanks!&lt;/p&gt;&#xA;" OwnerUserId="75323" LastActivityDate="2020-02-10T05:37:06.237" Title="Creating a multiple-challenge competition" Tags="|discussion|bounty|code-challenge|weekly-challenges|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18526" PostTypeId="2" ParentId="18525" CreationDate="2020-02-10T01:46:17.333" Score="2" Body="&lt;h1&gt;Technically no problem, but you might want to refine some rules&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Each individual challenge being a well-formed &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, I don't see any problem holding such a competition. Just ensure that you get enough feedback in the sandbox as you do for other challenges.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;But&lt;/strong&gt;,&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;... all submissions be in different languages in order to be eligible to win the competition&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This might be a problem because one user can post multiple answers on a challenge. My suggestion is to change the wording to&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;For the final scoring, each participant should choose their best answers in each challenge. Only the submissions in different languages count (unlike usual CGCC rules, same language with different implementations does not count, but a flag is still zero bytes).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;and add this for convenience:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;For the final challenge in the series, each participant should include their own list of answers and the final score in the answer to be eligible for the award&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;You might want to impose time restriction (e.g. 7 days after each challenge is posted) to each challenge too, for the sake of the competition. Of course the challenges should be indefinitely open for out-of-competition answers.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2020-02-10T01:46:17.333" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18527" PostTypeId="1" CreationDate="2020-02-10T02:01:52.690" Score="8" ViewCount="267" Body="&lt;p&gt;In the last 3 or 4 weeks there are quite a lot of sandbox proposals being downvoted. A quick count in the first page reveals that 12 proposals are at -1 and 2 are at -2, and some of the -1s are neighboring proposals in terms of active time. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;After several days of monitoring, I found that most of the downvoted proposals (including 2 of mine, I'd say) were downvoted only after several days of posting, and most if not all of them received no comments and upvotes during the first several days. On the other hand, if a proposal has upvotes, there will be almost no downvotes (except the Mountain Range Numbers one, which was -1 before posting to main and received upvotes in both main and sandbox afterwards.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Moreover, the downvotes are, in my honest opinion, unattested without reason. This dampens the intent to post challenges, which could post a devastating threat to the site's health because the downvote may bring a negative meaning like the proposal is not suitable to be posted, etc (at least I basically won't post a challenge if the net vote is negative.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So I basically would like to know what happened to the downvotes, and what we could do against those downvote floods.&lt;/p&gt;&#xA;" OwnerUserId="71546" LastActivityDate="2020-02-11T09:55:13.983" Title="What should we do against the downvote flood in the sandbox?" Tags="|discussion|sandbox|site-health|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18528" PostTypeId="2" ParentId="18527" CreationDate="2020-02-10T02:08:54.697" Score="2" Body="&lt;h1&gt;Could we require a downvote in sandbox be accompanied with a reason or explanation?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If a challenge is deemed unsuitable to be posted, there must be some reasons, for example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Being a duplicate of other challenges&lt;/li&gt;&#xA;&lt;li&gt;Having no objective scoring criteria&lt;/li&gt;&#xA;&lt;li&gt;Not conforming to the ToS or community consensus&lt;/li&gt;&#xA;&lt;li&gt;Unclear concept&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;But a downvote without reasons is just frustrating. We won't know why our proposals are disliked and what is missing in our proposals.&lt;/p&gt;&#xA;" OwnerUserId="71546" LastActivityDate="2020-02-10T02:08:54.697" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18529" PostTypeId="2" ParentId="18525" CreationDate="2020-02-10T05:37:06.237" Score="2" Body="&lt;p&gt;I think this your idea is fine as a bounty. It's accepted that you can put whatever conditions you feel like on bounties. This would be reasonable to put a a post in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5243/list-of-bounties-with-no-deadline&quot;&gt;List of bounties with no deadline&lt;/a&gt; and link to that, even though it actually has a deadline. This avoids needing to make a new type of win conditions, since each challenge on its own is just normal code golf.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I like in particular the idea of people trying hard on a set of well-vetted challenges. Sometimes it seems like people don't have a reason to golf off bytes rather than just posting quickly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One pitfall I see is that winning basically requires using all golfing languages. Maybe this is what you're going for, but it's not the type of thing I'd participate in. Even if you can't repeat a language, there's loads of golfing langs to go around. This is especially if different variants counts as different languages, which seems worth trying to make rules for.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It also seems like solvers will want to pair the most efficient language with the longest challenge. Or, to match languages with challenges that they have built-ins for, which might lead to boring solutions. In particular, lots of people might post the same mostly-built-in solution, or be squeamish about posting yet another copy, or be worried they &quot;cheated&quot; by seeing someone else post it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Maybe you want to have more non-golfing languages. I'm not sure how to enforce that. You could list the languages one is allowed to use, but people might be unhappy being restricted like that. One thought is to use &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8891/20260&quot;&gt;golfing Elo rankings of languages&lt;/a&gt; somehow, but it's still hard to balance, and a language's performance really depends on the challenge.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2020-02-10T05:37:06.237" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18530" PostTypeId="1" CreationDate="2020-02-10T10:23:20.493" Score="2" ViewCount="78" Body="&lt;p&gt;Say, if someone asks for a code-golf like this:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Test primality under polynomial time&lt;/h1&gt;&#xA;&lt;p&gt;Given a positive integer, test whether it is prime.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The algorithm must have polynomial time complexity in respect to the number of digits of the input.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The algorithm must be deterministic.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Input type and format doesn't matter, but it must be able to represent arbitrary-length integers. In Haskell. &lt;code&gt;Integer&lt;/code&gt; is an example. In C++, since it doesn't natively support arbitrary-length integers, &lt;code&gt;std::string&lt;/code&gt; with ASCII digits would be acceptable.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the input isn't a positive integer, it falls in &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This will force everyone to implement AKS Primality Test, if their language doesn't have a builtin for it. Can such thing be accepted?&lt;/p&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-02-10T10:23:20.493" Title="Is asking for a bounded time complexity allowed?" Tags="|discussion|code-golf|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18533" PostTypeId="2" ParentId="18527" CreationDate="2020-02-10T18:20:20.840" Score="13" Body="&lt;h1&gt;Organize people to go through the Sandbox and upvote appropriately&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In all of the downvoted Sandbox posts currently on the front page, it looked like there was a downvote but no upvotes. This means that the heart of the problem is not that downvoting is occuring on these posts, but that no upvoting is occuring. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Basically, we just need a person or two to go through the Sandbox and upvote the proposals they think look good. Or comment explaining what could be improved. This situation doesn't need anything more than that.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I just did so, please do so as well.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorDisplayName="user85052" LastEditDate="2020-02-11T09:55:13.983" LastActivityDate="2020-02-11T09:55:13.983" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18536" PostTypeId="2" ParentId="2140" CreationDate="2020-02-11T03:29:49.790" Score="-2" Body="&lt;h1&gt;101 Hello Worlds&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I have a project where I'm trying to collect 101 versions of &quot;Hello, World&quot; using obscure and over-engineered approaches in JavaScript/Node.js:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/georgemandis/101-hello-worlds&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://github.com/georgemandis/101-hello-worlds&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We're up to 38 so far and I've really enjoyed the community contributions.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I recognize the way this is phrased at the moment isn't compatible with the way Code Golf is setup, but I feel like there could be a large overlap with people who might be interested and this community. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Does this seem like something that would be welcome here? Would others have suggestions for how I might re-word this to create a suitable entry for Code Golf?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it's not suitable or welcome here I respect being downvoted into oblivion and can remove the answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thanks!&lt;/p&gt;&#xA;" OwnerUserId="85935" LastActivityDate="2020-02-11T03:29:49.790" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18537" PostTypeId="2" ParentId="2140" CreationDate="2020-02-11T15:26:13.687" Score="1" Body="&lt;h1&gt;Find the most important character&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge is to write a program that outputs the most occurrent non-trivial* character in the input string, excluding these bracketing characters &lt;code&gt;()[]{}&lt;/code&gt;.  A solution is scored by feeding the program's source into its input.  Bracketing characters are allowed in the program, but may not be selected by the program as the most occurrent character.  In cases where letters have the same percentile score, any of the characters can be returned, or all of them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strike&gt;Write a program that has a maximal percentage of a single non-trivial* character, excluding these bracketing characters &lt;code&gt;()[]{}&lt;/code&gt;.  Bracketing characters are allowed, but may not be selected as the highest-percentage character.  Answer is scored as by running the program, with the program's source as its own input.  In cases where letters have the same percentile score, any of the characters can be returned, or all of them.&lt;/strike&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;*Non-trivial is defined in this case to be a character that contributes to the functionality of the program.  If the character can be removed without influencing how the program runs, it is a trivial character.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Score is determined as follows:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$(\frac{n_{char}}{n_{total}}) * 100\% $$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;With n&lt;sub&gt;char&lt;/sub&gt; being the number of occurrences of that character in the input, and n&lt;sub&gt;total&lt;/sub&gt; being the total number of non-trivial characters in the input.  With this scoring criteria, all scores should be within the range &lt;code&gt;(0,100]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Highest scoring solution per language wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Solutions should take in any valid string as input.  Scoring is done using the program's source code as input(with all non-trivial charcters removed).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A single character with the highest percentage occurrence.  Each solution should be capable of outputting standard ASCII, as well as the language's codepage (if applicable).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Errata&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Creative solutions are encouraged.  Boring solutions with long padded strings substituted in for numbers are discouraged.  Standard loopholes are disallowed.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Program:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;aabbbc&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;b&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Program:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;aabb&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;a&lt;/code&gt; or &lt;code&gt;b&lt;/code&gt; or &lt;code&gt;ab&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="41195" LastEditorUserId="41195" LastEditDate="2020-02-12T15:07:01.677" LastActivityDate="2020-02-12T15:07:01.677" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="18538" PostTypeId="2" ParentId="2140" CreationDate="2020-02-11T15:50:54.137" Score="1" Body="&lt;h1&gt;Be second to last&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenge with a game with a clear winning strategy, but the winner is not the one who comes in first, but the one who comes in second to last! While losing is easy (just throw every game), just barely not losing is quite a task.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Game&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The bots will be made to play games of normal &lt;a href=&quot;https://en.wikipedia.org/wiki/Nim&quot; rel=&quot;nofollow noreferrer&quot;&gt;Nim&lt;/a&gt; against each other. The rules are as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The board consists of a list of unsigned integers&lt;/li&gt;&#xA;&lt;li&gt;In alternating turns, the players reduce one non-zero element by an amount of their choosing, as long as the element is not negative afterwards&lt;/li&gt;&#xA;&lt;li&gt;The player who reduces the list to all entries being 0 wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The length of the Nim list and its entries will be randomly determined for each game.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The Tournament&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;All bots will compete against each other in a Danish-Style tournament:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Initially, players are assigned positions in a list randomly&lt;/li&gt;&#xA;&lt;li&gt;After each round, the list is sorted by the amount of wins with an order-preserving method&lt;/li&gt;&#xA;&lt;li&gt;In each round, the players with the odd numbers play against those with the following even numbers (so 1st against 2nd, 3rd against 4th, and so forth)&lt;/li&gt;&#xA;&lt;li&gt;If the number of players is odd, the one in the middle position has a bye and is given 1 win without playing.&lt;/li&gt;&#xA;&lt;li&gt;The tournament ends after &lt;span class=&quot;math-container&quot;&gt;\$\lceil \log_{2}(N_{Players}) \rceil\$&lt;/span&gt; (Binary logarithm of the number of players, rounded up) rounds.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The player in the second to last position of the list counts as the total winner of the tournament.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;King of the Hill&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Each time the contest is run, 100 tournaments are played. The bots with the highest number of being second to last is the overall winner.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge Rules&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each bot is a &lt;strong&gt;Python 3&lt;/strong&gt; class implementing the following functions:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;__init__(ID, n)&lt;/code&gt; passes the bot its randomly assigned ID for this tournament, and the total number of players.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;nim(self,list)&lt;/code&gt; which takes in the Nim board state and returns a tuple &lt;code&gt;(index, amount)&lt;/code&gt;, specifying from which list index to subtract what number. This function is repeatedly called during each game of Nim played, until a winner has been determined.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;rank(self,IDs,scores)&lt;/code&gt; which takes in the current order of ranking in the tournament, and the list of scores of each bot, &lt;em&gt;ordered by ID&lt;/em&gt;. It returns nothing. This will be called for each bot after each round of tournament, as well as before the first round, to provide the ranking information if the bot requires it.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Bots are explicitly allowed to implement further functions and store data for private use. Bots will only be deleted and re-initialized after each full tournament.&lt;/li&gt;&#xA;&lt;li&gt;Programming meta-effects are forbidden, meaning any attempts to directly access other bots' code, the Controller's code, causing Exceptions or similar. Any bot doing so is disqualified until fixed.&lt;/li&gt;&#xA;&lt;li&gt;The following will also be set up to cause Exceptions:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;nim&lt;/code&gt; returning an index of which the element is already 0&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;nim&lt;/code&gt; return an amount larger than the element at that index&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;Other languages are allowed only in case they can be easily converted to Python 3.&lt;/li&gt;&#xA;&lt;li&gt;Class names have to be unique&lt;/li&gt;&#xA;&lt;li&gt;Multiple bots per person are allowed, but only the latest version will be taken of iteratively updated bots.&lt;/li&gt;&#xA;&lt;li&gt;As per &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard Loopholes&lt;/a&gt;, copies of bots are not allowed. This includes bots who differ from other bots only by a trivial change in strategy (e.g. a change in the pseudorandom seed).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Controller and Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Watch this space.&lt;/p&gt;&#xA;" OwnerUserId="89287" LastActivityDate="2020-02-11T15:50:54.137" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18539" PostTypeId="2" ParentId="2140" CreationDate="2020-02-11T19:06:01.193" Score="4" Body="&lt;h1&gt;Is it a doubling sequence?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Posted here:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/199409/is-it-a-doubling-sequence&quot;&gt;Is it a doubling sequence?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="29961" LastEditorUserId="29961" LastEditDate="2020-02-12T18:12:52.020" LastActivityDate="2020-02-12T18:12:52.020" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18541" PostTypeId="2" ParentId="8130" CreationDate="2020-02-12T06:13:18.837" Score="1" Body="&lt;p&gt;All stack sites have their roots in stackoverflow, they all use descendants of their software, communities and rules. As such, they will all exhibit characteristics of stackoverflow, objective measuring through a scoring system is a core characteristic. Points for questions and answers. Upvotes and downvotes for questions and answers, upvotes for comments, badges for achievements, total views, and perhaps invisible to users, search engine ranking and conversion rates.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is the dna of stackoverflow, the goal of these sites is to increase these numbers to grow their traffic. They do so by using rules and judging the effect these rules have on the scores. Rules with a good outcome stay, rules with a bad outcome are dismissed or fail to become popular.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Code golf, as a stack descendant, needs rules to grow, I find it poetic that this particular requires users to partake in the creation o their own objective metrics. It merely takes objective scoring one step further.&lt;/p&gt;&#xA;" OwnerUserId="92046" LastEditorUserId="92046" LastEditDate="2020-02-12T06:18:40.950" LastActivityDate="2020-02-12T06:18:40.950" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18542" PostTypeId="1" CreationDate="2020-02-12T12:25:55.300" Score="-1" ViewCount="122" Body="&lt;p&gt;After I deleted my Code Golf.SE account, (my only account eligible for the association bonus), I still get the association bonus (see my rep). Is there a reason why this happens (or, if this is erroneous, can it be fixed)?&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastEditorUserId="68942" LastEditDate="2021-06-02T00:24:11.323" LastActivityDate="2021-06-02T00:24:11.323" Title="Why do I still get my association bonus?" Tags="|bug|status-bydesign|" AnswerCount="1" CommentCount="2" ClosedDate="2020-02-16T14:02:11.937" ContentLicense="CC BY-SA 4.0" />
  <row Id="18544" PostTypeId="2" ParentId="2140" CreationDate="2020-02-12T22:18:30.787" Score="3" Body="&lt;h1&gt;Parse Iota&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Iota is a simple programming language, considered the &quot;sister&quot; of the language Jot. More info can be found &lt;a href=&quot;http://esolangs.org/wiki/Iota&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; Every Iota program consists of either an &lt;code&gt;i&lt;/code&gt;, or a &lt;code&gt;*&lt;/code&gt; followed by two Iota programs. In BNF, this is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;iota ::= i | *&amp;lt;iota&amp;gt;&amp;lt;iota&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to, given any input, output a truthy or falsy value based on whether or not it is a valid Iota program.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program may take input in any form agreed upon by the community &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods/&quot;&gt;here&lt;/a&gt;. It just has to be able to take input from the user in some form.&lt;/li&gt;&#xA;&lt;li&gt;The same rule goes for output. See the post above for valid output methods. Output may be any truthy or falsy value in your language, including integers, strings, arrays, or objects. If it can be converted to a Boolean, it is OK.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Example I/O&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: i&#xA;Output: 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: hello&#xA;Output: 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: *i*i*ii&#xA;Output: 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: i*i&#xA;Output: 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: ***&#xA;Output: 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: *&#xA;Output: 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: iiiiiiiii&#xA;Output: 0;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: i&#xA;Output: 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input: *ii&#xA;Output: 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="88212" LastEditorUserId="88212" LastEditDate="2020-02-13T12:03:26.433" LastActivityDate="2020-02-13T12:03:26.433" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18545" PostTypeId="1" CreationDate="2020-02-13T00:39:24.697" Score="10" ViewCount="826" Body="&lt;h1&gt;RGS&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;RGS&lt;/strong&gt; stands for &lt;strong&gt;RGS's Golfing Showdown&lt;/strong&gt;, a golfing competition.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The competition has ended, final leaderboard at the end of this post!&lt;/h2&gt;&#xA;&#xA;&lt;h1&gt;1 - The format&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The &lt;strong&gt;RGS&lt;/strong&gt; will be a virtual golfing competition with 5 &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;1.1 - Post dates&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The 5 challenges are scheduled for 24th and 28th of February, 3rd, 7th and 11th of March and will be posted the closest to 8 a.m. UTC I manage to.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;2 - Challenges&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Each challenge is a regular &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge open to the whole codegolf.SE community.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;2.1 - Themes&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The 5 challenges will have varied themes, including &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/maths&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;maths&amp;#39;&quot; rel=&quot;tag&quot;&gt;maths&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;, etc.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;2.2 - Sandboxing&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The RGS challenges will be sandboxed usually.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;3 - Participation&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;3.1 - User eligibility&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Any codegolf.SE member is eligible to participate in this competition.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;3.2 - Entering the competition&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Any user that submits eligible submissions to each of the 5 challenges is entered into the competition by default.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;3.3 - Eligible submissions&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;For each given challenge, a solution has to satisfy the following requirements to be considered &lt;em&gt;eligible&lt;/em&gt; for the RGS competition:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A solution has to be submitted in the first 96 hours after the challenge is posted;&lt;/li&gt;&#xA;&lt;li&gt;A solution must not be in any of the &lt;em&gt;restricted languages&lt;/em&gt; (see &lt;strong&gt;section 4&lt;/strong&gt;);&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;4 - Restricted languages&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This section explains the restrictions on per-challenge languages &quot;allowed&quot; for the RGS competition. These restrictions apply only to submissions that are for the challenge. A submission in any of the &lt;em&gt;restricted languages&lt;/em&gt; is still a valid &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; submission!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;4.1 - Purpose&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The purpose of creating &lt;em&gt;restricted languages&lt;/em&gt; is to force users to use more than one prominent language in order to compete in the RGS.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;4.2 - Choosing the restricted languages&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Challenges 2, 3, 4 and 5 will have a minimum of &lt;code&gt;3&lt;/code&gt; &lt;em&gt;restricted languages&lt;/em&gt;. The &lt;em&gt;restricted languages&lt;/em&gt; for challenge &lt;code&gt;i + 1&lt;/code&gt; are computed as per the following algorithm:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Start with no &lt;em&gt;restricted languages&lt;/em&gt; and with a counter as &lt;code&gt;0&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Sort the submissions to challenge &lt;code&gt;i&lt;/code&gt; per byte count, keep ties.&lt;/li&gt;&#xA;&lt;li&gt;Take all the languages that provided solutions with the lowest byte count available:&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Define those as &lt;em&gt;restricted languages&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Increment the counter by &lt;code&gt;1&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Remove all the languages added to the &lt;em&gt;restricted languages&lt;/em&gt; from the submission list created in 2.&lt;/li&gt;&#xA;&lt;li&gt;If the counter is smaller than &lt;code&gt;3&lt;/code&gt; and we have less than &lt;code&gt;5&lt;/code&gt; restricted languages, go back to 3.&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;li&gt;Ta-da!&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h3&gt;4.3 - Dialects&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;For the purposes of the &lt;em&gt;restricted languages&lt;/em&gt;, different versions and/or dialects are counted as the same language. As examples, &lt;code&gt;Python 2&lt;/code&gt; and &lt;code&gt;Python 3&lt;/code&gt; count as the same language, as do &lt;code&gt;APL Classic&lt;/code&gt; and &lt;code&gt;APL Dyalog Extended&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;4.4 - Example&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Say that for challenge 3 we have the following submissions, with the respective byte-counts:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;5 bytes: 05AB1E, Jelly&#xA;6 bytes: APL Classic&#xA;28 bytes: Python 2&#xA;31 bytes: Ruby&#xA;40 bytes: PHP&#xA;120 bytes: brainfuck&#xA;137 bytes: Java&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then the &lt;em&gt;restricted languages&lt;/em&gt; for challenge 4 would be &lt;code&gt;05AB1E, Jelly, APL&lt;/code&gt; and &lt;code&gt;Python&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;5 - Scoring&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;5.1 - Final entry&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;At the fifth challenge, a user who wishes to be considered in the final RGS ranking must choose one of his/her eligible submissions (as in &lt;strong&gt;section 3&lt;/strong&gt;), per challenge, to be accounted for in the final competition score. These choices must be listed at the end of the chosen submission of the 5th challenge.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;5.2 - Per-challenge scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Each chosen submission is given score equal to its byte count 96 hours after the challenge was posted.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;5.3 - Final scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The competition score is calculated by summing up the byte scores of the eligible submissions that the user chooses.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;5.4 - Tie-breaking&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;In case &lt;strong&gt;5.3&lt;/strong&gt; results in a tie, the following criteria are used for tie-breaking:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The user with more unique languages in the 5 chosen submissions wins;&lt;/li&gt;&#xA;&lt;li&gt;The user that submitted earlier more times over the course of the 5 challenges wins;&lt;/li&gt;&#xA;&lt;li&gt;The user with the earlier submission for challenge 5 wins.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;6 - Prizes&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;6.1 - Main competition winner&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The winner of the main competition will win a &lt;code&gt;200&lt;/code&gt; reputation bounty awarded by me. Sorry if this isn't much!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;6.2 - Style points for surprising answers&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I will also award &lt;code&gt;50 x 5&lt;/code&gt; reputation bounties, one per challenge, to the answer that surprises me the most. This is entirely subjective and I reserve myself the right to attribute this bounty to whatever answer I please.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note that because of my lack of knowledge about the full bounty mechanics, I was forced to start a 100 rep bounty on &lt;a href=&quot;https://codegolf.stackexchange.com/q/200250/75323&quot;&gt;my second challenge&lt;/a&gt;, instead of the advertised 50 rep.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;6.3 - Sponsoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If you wish to sponsor a language you really like, or just want an excuse to offer a bounty for an answer in a particular language, you may sponsor one of the challenges, or the whole competition, by commenting below under what conditions you also want to award a bounty to someone.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please take into consideration that consecutive bounties have to be double the previous bounty.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;7 - Rankings&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This section will be updated as the competition moves forward, to reflect the partial rankings of the challenges.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;7.1 &lt;a href=&quot;https://codegolf.stackexchange.com/q/199995/75323&quot;&gt;Challenge 1 - binary multiples&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The bonus style points were awarded to &lt;a href=&quot;https://codegolf.stackexchange.com/a/200356/75323&quot;&gt;this answer in Roj&lt;/a&gt;, a toy programming language I created a &lt;em&gt;long&lt;/em&gt; time ago.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18691/75323&quot;&gt;Leaderboard&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;7.2 &lt;a href=&quot;https://codegolf.stackexchange.com/q/200250/75323&quot;&gt;Challenge 2 - strings within character classes&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The bonus style points were awarded to &lt;a href=&quot;https://codegolf.stackexchange.com/a/200426/75323&quot;&gt;this Shakespeare Programming Language&lt;/a&gt; for being such a literate answer and because, I quote, &lt;code&gt;&quot;Is I as big as the sum of The cube of a big big cat the cube of The sum of A big cat a cat?&quot;&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18692/75323&quot;&gt;Leaderboard&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;7.3 &lt;a href=&quot;https://codegolf.stackexchange.com/q/200485/75323&quot;&gt;Challenge 3 - help me write portuguese&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/18690/75323&quot;&gt;did not manage to award the bonus style points&lt;/a&gt; for this challenge, unfortunately.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18693/75323&quot;&gt;Leaderboard&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;7.4 &lt;a href=&quot;https://codegolf.stackexchange.com/q/200685/75323&quot;&gt;Challenge 4 - inverting matrices modulo m&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The bonus style points were awarded to &lt;a href=&quot;https://codegolf.stackexchange.com/a/200688/75323&quot;&gt;Arnauld's JavaScript answer&lt;/a&gt; for actually computing the inverse of the matrix, instead of randomly generating matrices or going over &lt;em&gt;all&lt;/em&gt; the possible matrices.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18660/75323&quot;&gt;Leaderboard&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;7.5 &lt;a href=&quot;https://codegolf.stackexchange.com/q/200861/75323&quot;&gt;Challenge 5 - computing the set of all set partitions with fixed sizes&lt;/a&gt;&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The bonus style points were awarded to &lt;a href=&quot;https://codegolf.stackexchange.com/a/200883/75323&quot;&gt;this Jelly answer by Kevin Cruijssen&lt;/a&gt; for being a Jelly submission from a member that I associate with Java, 05AB1E and Whitespace but definitely not with Jelly.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18694/75323&quot;&gt;Leaderboard&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Final leaderboard&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The competition is now over and these are the final standings! Thanks to everyone who participated and I hope you enjoyed it!&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/53748/jonathan-allan&quot;&gt;Jonathan Allan&lt;/a&gt;, 103 bytes&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/84206/embodiment-of-ignorance&quot;&gt;Embodiment of Ignorance&lt;/a&gt;, 120 bytes&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/85908/expired-data&quot;&gt;Expired Data&lt;/a&gt;, 143 bytes&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/17602/neil&quot;&gt;Neil&lt;/a&gt;, 236 bytes&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/42248/nick-kennedy&quot;&gt;Nick Kennedy&lt;/a&gt;, 281 bytes&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/86301/robin-ryder&quot;&gt;Robin Ryder&lt;/a&gt;, 376 bytes&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/52210/kevin-cruijssen&quot;&gt;Kevin Cruijssen&lt;/a&gt;, 466 bytes&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/58563/arnauld&quot;&gt;Arnauld&lt;/a&gt;, 491 bytes&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="75323" LastEditorUserId="75323" LastEditDate="2020-03-23T18:43:59.147" LastActivityDate="2020-07-30T03:02:45.547" Title="Ruleset for RGS's Golfing Showdown - competition is over!" Tags="|discussion|code-golf|" AnswerCount="5" CommentCount="21" ContentLicense="CC BY-SA 4.0" />
  <row Id="18546" PostTypeId="1" AcceptedAnswerId="18550" CreationDate="2020-02-13T05:54:55.770" Score="0" ViewCount="82" Body="&lt;p&gt;I proposed this code golf on sandbox:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;Integer Logarithm&lt;/h1&gt;&#xA;  &#xA;  &lt;p&gt;Take &lt;span class=&quot;math-container&quot;&gt;\$a \in ℤ_{&amp;gt;1}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$b \in ℤ_+\$&lt;/span&gt; as inputs. Write a function &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; that:&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;f(a,b) =&#xA;\left\{&#xA;    \begin{array}{ll}&#xA;        \text{Just} \space \log_ab &amp;amp; \quad \text{if} \space \log_ab \in ℚ \\&#xA;        \text{Nothing} &amp;amp; \quad \text{otherwise}&#xA;    \end{array}&#xA;\right.&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;  &#xA;  &lt;h2&gt;Rules&lt;/h2&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;&lt;p&gt;Types and formats of the inputs doesn't matter, but they must be able to represent at least 2 bits. For example, in C++, &lt;code&gt;int&lt;/code&gt;, &lt;code&gt;unsigned&lt;/code&gt;, &lt;code&gt;std::vector&amp;lt;bool&amp;gt;&lt;/code&gt;, or even &lt;code&gt;std::string&lt;/code&gt; containing ASCII digits are acceptable.&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;Type and format of the output doesn't matter either, but the fraction must be irreducible. In C++, &lt;code&gt;std::optional&amp;lt;std::pair&amp;lt;int,unsigned&amp;gt;&amp;gt;&lt;/code&gt; is an example.&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;&lt;strong&gt;You must not use floating-point numbers because of their errors.&lt;/strong&gt;&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;if &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; aren't in the sets as specified above, the challenge falls in &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; may be curried or uncurried.&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;li&gt;&lt;p&gt;As this is a code-golf, the shortest code in bytes wins.&lt;/p&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;But to think about it, I doubt that golfing languages natively support rational number arithmetic. Unlike &lt;a href=&quot;https://codegolf.stackexchange.com/q/194339/89459&quot;&gt;this challenge&lt;/a&gt;, it actively requires arithmetics on rational numbers, in sake of, for example, Newton's method.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do major golfing languages such as 05AB1E, Jelly, APL, and Charcoal natively support rational number arithmetic?&lt;/p&gt;&#xA;" OwnerUserId="89459" LastActivityDate="2020-02-13T10:58:52.777" Title="Do golfing languages support rational number arithmetic?" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18547" PostTypeId="1" AcceptedAnswerId="18551" CreationDate="2020-02-13T07:06:30.370" Score="3" ViewCount="296" Body="&lt;p&gt;During a conversation in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18540/89459&quot;&gt;my proposed challenge&lt;/a&gt; in sandbox, there had been some objections about requirements in the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I want to entirely ban a usage of floating-point numbers in the challenge, but as turned out in the discussion, that must be only if the inputs are arbitrary-length integers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do major golfing languages such as 05AB1E, Jelly, APL, and Charcoal natively support arbitrary-length integers like Haskell's &lt;code&gt;Integer&lt;/code&gt;? Otherwise, my challenge will be very different from what I intended.&lt;/p&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2020-03-10T23:19:27.777" LastActivityDate="2020-03-17T13:06:06.833" Title="Do golfing languages support arbitrary-length integers?" Tags="|discussion|" AnswerCount="2" CommentCount="6" FavoriteCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18550" PostTypeId="2" ParentId="18546" CreationDate="2020-02-13T10:58:52.777" Score="1" Body="&lt;h1&gt;APL&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;… is not a golfing language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, some APL implementations, like NARS2000, feature rational arithmetic. Others, like Dyalog APL, have a library that provides this functionality. Additionally, some APL derivatives, like J, do too.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2020-02-13T10:58:52.777" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18551" PostTypeId="2" ParentId="18547" CreationDate="2020-02-13T11:03:50.027" Score="8" Body="&lt;h1&gt;APL&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;… is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18547/do-golfing-languages-support-arbitrary-length-integers#comment66803_18547&quot;&gt;not&lt;/a&gt; a golfing language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, some APL implementations, like NARS2000, feature arbitrary-length integers. Others, like Dyalog APL, have a library that provides this functionality. Additionally, some APL derivatives, like J, do too.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2020-02-13T11:03:50.027" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18552" PostTypeId="2" ParentId="2140" CreationDate="2020-02-13T12:55:51.377" Score="-2" Body="&lt;h1&gt;Hello, World, but &lt;em&gt;looong&lt;/em&gt;&lt;/h1&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I couldn't find out that this challenge exists&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;If this challenge exists, let me know&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Write a simple &lt;em&gt;Hello, World!&lt;/em&gt; program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The winner is the person who has the longest code.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, &lt;strong&gt;&lt;em&gt;any&lt;/em&gt;&lt;/strong&gt; &lt;a href=&quot;https://en.wikipedia.org/wiki/Subsequence&quot; rel=&quot;nofollow noreferrer&quot;&gt;subsequence&lt;/a&gt; except itself cannot be the answer.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You can have input in which way.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hello, World!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="77388" LastActivityDate="2020-02-13T12:55:51.377" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18554" PostTypeId="2" ParentId="18542" CreationDate="2020-02-13T22:53:25.410" Score="2" Body="&lt;p&gt;According to &lt;a href=&quot;https://meta.stackexchange.com/q/164224/566903&quot;&gt;this question on Meta&lt;/a&gt;, the association bonus can never be revoked from an account once it has been earned.&lt;/p&gt;&#xA;" OwnerUserId="46076" LastActivityDate="2020-02-13T22:53:25.410" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18555" PostTypeId="2" ParentId="2140" CreationDate="2020-02-14T03:20:43.550" Score="0" Body="&lt;h1&gt;Compress even permutations&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Factorial number system&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Every nonnegative integer can be encoded by &lt;strong&gt;factorial number system&lt;/strong&gt;. Factorial number system doesn't have a fixed radix, but uses the factorial of nonnegative integers as radices. The place of &lt;span class=&quot;math-container&quot;&gt;\$0!\$&lt;/span&gt; can have &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; as the digit, the place of &lt;span class=&quot;math-container&quot;&gt;\$1!\$&lt;/span&gt; can have &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; or &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; as the digit, the place of &lt;span class=&quot;math-container&quot;&gt;\$2!\$&lt;/span&gt; can have &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt;, or &lt;span class=&quot;math-container&quot;&gt;\$2\$&lt;/span&gt; as the digit, and so on. Subscript exclamation mark denotes that the integer is encoded in factorial number system. For example:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;41010_! = 4 \times 4! + 1 \times 3! + 0 \times 2! + 1 \times 1! + 0 \times 0!= 103_{10}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Permutations&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Numbers encoded by factorial number system has one-to-one correspondence to permutations:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;41010_! \cong&#xA;\begin{pmatrix}&#xA;0 \\&#xA;0&#xA;\end{pmatrix}&#xA;\begin{pmatrix}&#xA;1 &amp;amp; 0 \\&#xA;0 &amp;amp; 1&#xA;\end{pmatrix}&#xA;\begin{pmatrix}&#xA;2 &amp;amp; 1 &amp;amp; 0 \\&#xA;2 &amp;amp; 1 &amp;amp; 0&#xA;\end{pmatrix}&#xA;\begin{pmatrix}&#xA;3 &amp;amp; 2 &amp;amp; 1 &amp;amp; 0 \\&#xA;0 &amp;amp; 3 &amp;amp; 2 &amp;amp; 1&#xA;\end{pmatrix}&#xA;\begin{pmatrix}&#xA;4 &amp;amp; 3 &amp;amp; 2 &amp;amp; 1 &amp;amp; 0 \\&#xA;3 &amp;amp; 2 &amp;amp; 1 &amp;amp; 0 &amp;amp; 4&#xA;\end{pmatrix}&#xA;=&#xA;\begin{pmatrix}&#xA;4 &amp;amp; 3 &amp;amp; 2 &amp;amp; 1 &amp;amp; 0 \\&#xA;1 &amp;amp; 3 &amp;amp; 2 &amp;amp; 0 &amp;amp; 4&#xA;\end{pmatrix}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That is, each the place of &lt;span class=&quot;math-container&quot;&gt;\$n!\$&lt;/span&gt; represents a right-direction rotation of &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; through &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;, and its digit represents what &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; becomes after the rotation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It follows that the parity of the permutation is same as the parity of the sum of digits at the places of factorials of odd numbers. For &lt;span class=&quot;math-container&quot;&gt;\$41010_!\$&lt;/span&gt;, the permutation is even because &lt;span class=&quot;math-container&quot;&gt;\$1 + 1 = 2\$&lt;/span&gt; is even.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An even permutation of 5 elements, or any equivalent object will be the input. That leaves &lt;span class=&quot;math-container&quot;&gt;\$5! \div 2 = 60\$&lt;/span&gt; distinct permutations. Compress it to &lt;span class=&quot;math-container&quot;&gt;\$\lceil \log_2{60}\rceil=6\$&lt;/span&gt; bits.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Input type and format doesn't matter. Possible choices of input format include (in C++):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;std::map&amp;lt;int,int&amp;gt;&lt;/code&gt; scrambling the numbers from &lt;span class=&quot;math-container&quot;&gt;\$4\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;int[5]&lt;/code&gt; containing the digits of the factorial number system&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;int[4]&lt;/code&gt; containing the digits of the factorial number system, except the place of &lt;span class=&quot;math-container&quot;&gt;\$0!\$&lt;/span&gt; (it doesn't contribute to the permutation)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;int&lt;/code&gt; encoded by the factorial number system&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Output type and format doesn't matter either. It may be:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;bool[6]&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;int8_t&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;a bit field&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;std::string&lt;/code&gt; containing ASCII digit 0s and 1s&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Invalid inputs fall in &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="89459" LastActivityDate="2020-02-14T03:20:43.550" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18556" PostTypeId="2" ParentId="2140" CreationDate="2020-02-14T05:01:05.493" Score="1" Body="&lt;p&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2020-03-09T17:03:33.287" LastActivityDate="2020-03-09T17:03:33.287" CommentCount="24" ContentLicense="CC BY-SA 4.0" />
  <row Id="18557" PostTypeId="2" ParentId="2140" CreationDate="2020-02-14T09:54:12.743" Score="-1" Body="&lt;h1&gt;How healthy are my children?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;As anyone who has twins will know, it can be hard to keep track of which child fed / was changed, and when.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That's why I've devised a system using OneNote on my phone. It's quick and easy to use.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each entry (line) uses the following structure (note: I'm not a regex expert and the expression is more permissive than I want - see words for detail):&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;(ddMMyyyy )?HHmm ((1|2|B) (||){1,3}){1,3}&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Or, in words:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;For the first entry on or after midnight each day only, each line starts with the date.&lt;/li&gt;&#xA;&lt;li&gt;The next component is always the time, hour and minute in 24 hour clock format&lt;/li&gt;&#xA;&lt;li&gt;Next is a child identifier character - &lt;code&gt;1&lt;/code&gt; or &lt;code&gt;2&lt;/code&gt;; or &lt;code&gt;B&lt;/code&gt; if what follows applies to both children. All subsequent emoticons apply to the identified child, until a new child identifier is found or a newline. There is guaranteed to be at least one child identifier in a record.&lt;/li&gt;&#xA;&lt;li&gt;Next comes any or all of the three emoticons (maximum one of each) representing a wet nappy (), a dirty nappy () or a feed ()&lt;/li&gt;&#xA;&lt;li&gt;Repeat from step 3. until done. BUT - each emoticon will only appear once per child - so if it appears in &lt;code&gt;B&lt;/code&gt; then it won't appear in either &lt;code&gt;1&lt;/code&gt; or &lt;code&gt;2&lt;/code&gt;; and if it appears in either &lt;code&gt;1&lt;/code&gt; or &lt;code&gt;2&lt;/code&gt; it won't appear in &lt;code&gt;B&lt;/code&gt;. It won't appear in both &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;2&lt;/code&gt; (because then it would be in &lt;code&gt;B&lt;/code&gt; instead). The regex doesn't show this subtlety.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Some other notes:  &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Breast-Feeding (feed) emoticon  is codepoint U+1F931&lt;/li&gt;&#xA;&lt;li&gt;Droplet (wet) emoticon  is codepoint U+1F4A7&lt;/li&gt;&#xA;&lt;li&gt;Pile of Poo (dirty) emoticon  is codepoint U+1F4A9&lt;/li&gt;&#xA;&lt;li&gt;All items in the string are space-separated&lt;/li&gt;&#xA;&lt;li&gt;I would actually use the initials of my children's names, rather than &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;2&lt;/code&gt; - but for the challenge I went with the numbers instead.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;02022020 0005 1  B  &lt;br&gt;&#xA;0230 2  &lt;br&gt;&#xA;0250 1   &lt;br&gt;&#xA;0330 2 &lt;br&gt;&#xA;0400 1 &lt;br&gt;&#xA;0700 B  &lt;br&gt;&#xA;0900 2 &lt;br&gt;&#xA;1000 2  &lt;br&gt;&#xA;1020 1  &lt;br&gt;&#xA;1220 1 &lt;br&gt;&#xA;1420 B  1  2 &lt;br&gt;&#xA;1440 1 &lt;br&gt;&#xA;1600 2  &lt;br&gt;&#xA;1700 1 &lt;br&gt;&#xA;1745 B &lt;br&gt;&#xA;2100 B   1 &lt;br&gt;&#xA;2350 2  B  1 &lt;br&gt;&#xA;03022020 0015 1  B &lt;br&gt;&#xA;0500 1  &lt;br&gt;&#xA;0830 1  &lt;br&gt;&#xA;0900 2  &lt;br&gt;&#xA;1115 B  1 &lt;br&gt;&#xA;1215 B &lt;br&gt;&#xA;1330 B &lt;br&gt;&#xA;1400 2     &lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given the raw data, input as a single string or array of entries, containing data such as the above example, output a summary of:  &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;number of feeds, wet and dirty nappies, per baby, over the past 24 hours&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&quot;The past 24 hours&quot; can be either based on system time, or the current time can be passed as an extra input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The output format is up to you, as long as it:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;a) is consistent across all runs of the program&lt;br&gt;&#xA;b) shows the information required&lt;/p&gt;&#xA;&#xA;&lt;p&gt;some example outputs for the above inputs, with a current time of 14:30 on 3rd of February 2020 (hand-calculated, sorry if they're not right!):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;Baby 1 had 6 wet nappies, 2 dirty nappies, and fed 8 times&#xA;Baby 2 had 6 wet nappies, 3 dirty nappies and fed 6 times&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;{{6,6},{2,3},{8,6}}&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;{6,2,8},{6,3,6}&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so lowest bytes wins. Usual exclusions apply.&lt;/p&gt;&#xA;" OwnerUserId="62289" LastEditorUserId="62289" LastEditDate="2020-02-14T12:03:10.773" LastActivityDate="2020-02-14T12:03:10.773" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18558" PostTypeId="2" ParentId="18547" CreationDate="2020-02-14T14:46:41.163" Score="2" Body="&lt;p&gt;Some non-golfing languages do not have builtin support for arbitrary-length integers, including but not limited to:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;C&lt;/li&gt;&#xA;&lt;li&gt;C++&lt;/li&gt;&#xA;&lt;li&gt;Assembly/machine code&lt;/li&gt;&#xA;&lt;li&gt;Probably some others&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Don't tell me about any third-party libraries that provide support for these.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can't see your sandbox post so I don't know if this challenge is possible in these languages.&lt;/p&gt;&#xA;" OwnerUserId="89298" LastEditorUserId="89298" LastEditDate="2020-03-17T13:06:06.833" LastActivityDate="2020-03-17T13:06:06.833" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18559" PostTypeId="2" ParentId="18429" CreationDate="2020-02-14T15:12:34.683" Score="1" Body="&lt;h2&gt;Unique idea&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Awarded to the first person that doesn't use the algorithm that all answerers up to that person of the challenge use in the challenge. E.g. &lt;a href=&quot;https://codegolf.stackexchange.com/a/197168/92069&quot;&gt;this&lt;/a&gt; is an example of a &quot;unique idea&quot;.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastActivityDate="2020-02-14T15:12:34.683" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18560" PostTypeId="2" ParentId="2140" CreationDate="2020-02-15T03:13:27.177" Score="1" Body="&lt;h2&gt;Shift the digits &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-time&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-time&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-time&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here, &lt;strong&gt;x&lt;/strong&gt; (supplied as input) and &lt;strong&gt;n&lt;/strong&gt; (the result of your computation) are both positive integers. &lt;code&gt;n * x = n shifted&lt;/code&gt;. Find n.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's an example of shifting:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;123456789 -&amp;gt; 912345678&#xA;abcdefghi -&amp;gt; iabcdefgh (letters = any 0~9 digit)&#xA;123       -&amp;gt; 312&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Preceding zeros count after shifting. If the number is &lt;code&gt;10&lt;/code&gt; and is multiplied by &lt;code&gt;0.1&lt;/code&gt; (&lt;code&gt;0.1&lt;/code&gt; isn't a valid input), the result is &lt;code&gt;1&lt;/code&gt;, which isn't equal to &lt;code&gt;01&lt;/code&gt; (&lt;code&gt;10&lt;/code&gt; after shifting).&lt;/li&gt;&#xA;&lt;li&gt;Your code has to run on &lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try It Online&lt;/a&gt; without timing out.&lt;/li&gt;&#xA;&lt;li&gt;If your number only has one digit, the shifted result is your number:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 -&amp;gt; 1&#xA;4 -&amp;gt; 4&#xA;9 -&amp;gt; 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Just to show that it's possible ...&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;9 -&amp;gt; 10112359550561797752808988764044943820224719&#xA;(In this test case, x = 9 and n = 10112359550561797752808988764044943820224719.&#xA;n shifted = n * x =              91011235955056179775280898876404494382022471)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Don't believe it? &lt;a href=&quot;https://tio.run/##lcsxDoAwCADA3VeQuKiJCVAosPgeXWpjuvh6fIO3X3/HebeS2Z@rjYWQiIuGKmolCzNlRw93q4IiIcUZmcUotlinGfYDIH60zA8&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-02-17T03:44:53.237" LastActivityDate="2020-02-17T03:44:53.237" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="18563" PostTypeId="2" ParentId="2140" CreationDate="2020-02-15T22:12:47.347" Score="1" Body="&lt;p&gt;Posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/199654/finding-radical-ideals&quot;&gt;here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="82007" LastEditorUserId="82007" LastEditDate="2020-02-17T16:53:12.840" LastActivityDate="2020-02-17T16:53:12.840" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18565" PostTypeId="2" ParentId="2140" CreationDate="2020-02-16T00:46:25.253" Score="5" Body="&lt;h2&gt;Add the quotes &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There's a terrible problem in my console - the quotes never get included inside the arguments! So, when given this argument:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&quot;abc&quot;,&quot;def&quot;,&quot;ghi&quot;,&quot;jkl&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;it says that the argument is like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[abc,def,ghi,jkl]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It would be very nice if you can fix this problem!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Body&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Add double-quotes (&lt;code&gt;&quot;&lt;/code&gt;) in order to surround a word (i.e. something that matches &lt;code&gt;[a-z]+&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[one, two, three],&#xA;[one, two, three],&#xA;[one, two, three],&#xA;[one, two, three]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[abc,def,ghi,jkl] -&amp;gt; [&quot;abc&quot;,&quot;def&quot;,&quot;ghi&quot;,&quot;jkl&quot;]&#xA;this is a test    -&amp;gt; &quot;this&quot; &quot;is&quot; &quot;a&quot; &quot;test&quot;&#xA;test              -&amp;gt; &quot;test&quot;&#xA;this &quot;one&quot; &quot;contains' &quot;quotations -&amp;gt; &quot;this&quot; &quot;&quot;one&quot;&quot; &quot;&quot;contains&quot;' &quot;&quot;quotations&quot;&#xA;But This One Is SpeciaL! -&amp;gt; B&quot;ut&quot; T&quot;his&quot; O&quot;ne&quot; I&quot;s&quot; S&quot;pecia&quot;L!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules for the input&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The words are never capitalized.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-02-20T05:27:06.147" LastActivityDate="2020-02-20T05:27:06.147" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18567" PostTypeId="2" ParentId="2140" CreationDate="2020-02-17T06:37:15.607" Score="-1" Body="&lt;p&gt;I want to ask a combined popularity / objectively scored question. Something like:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Take a string as input. Match the string to a famous painting such as &quot;Mona Lisa&quot; and render a cartoon version of it. 1 point per painting, 1 point per upvote. Voting closes on XX/YY/ZZZZ.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I want to reward people for including more possibilities (there will be a fixed upper limit, unlike with paintings). I also want to reward people for the quality of their renderings. The cartoon paintings should be recognisable as versions of the real paintings.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is this a good scoring system? If not, what would be better?&lt;/p&gt;&#xA;" OwnerUserId="29560" LastActivityDate="2020-02-17T06:37:15.607" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18568" PostTypeId="2" ParentId="2140" CreationDate="2020-02-17T17:15:10.227" Score="0" Body="&lt;h1&gt;Simplify a directed graph&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graph-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graph-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;graph-theory&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A connected directed graph, in any convenient format. A valid format (and probably the most convenient) would be a list of edges.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Simplification&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;These two reductions are performed as often as possible. It does not suffice to apply one reduction first, then the other, as each of them can cause more of the other one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt; be the set of all edges of the graph in the following explanations. For example &lt;span class=&quot;math-container&quot;&gt;\$E = \{(0, 1), (1, 2), (2, 0)\}\$&lt;/span&gt; represents the following graph:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 ----&amp;gt; 1&#xA;^       |&#xA;'-- 2 &amp;lt;-'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$E_a\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; is a vertex, indicate the set of edges involving &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$E_a := \{(u, v) \in E : u = a \vee v = a\}$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Two graphs are isomorphic iff all vertices from one graph can be relabeled to make it equal to the other graph.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Deduplication&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If there are disjoint sets of vertices &lt;span class=&quot;math-container&quot;&gt;\$M\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; (&lt;span class=&quot;math-container&quot;&gt;\$M \cap N = \emptyset\$&lt;/span&gt;) not directly connected (&lt;span class=&quot;math-container&quot;&gt;\$((M, N) \cup (N, M)) \cap E = \emptyset\$&lt;/span&gt;) and the graphs with edges &lt;span class=&quot;math-container&quot;&gt;\$E \setminus E_M\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$E \setminus E_N\$&lt;/span&gt; are isomorphic, then the vertices &lt;span class=&quot;math-container&quot;&gt;\$M\$&lt;/span&gt; (or &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;, but not both, are removed).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This means that of any two non-overlapping, non-directly-connected subgraphs that leave isomorphic graphs behind when removed, one is removed.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;Simple example:&#xA;&#xA;&lt;b&gt;b --&gt;&lt;/b&gt; 1&#xA;      &lt;b&gt;^&lt;/b&gt;  ==&gt;  b --&gt; 1&#xA;      &lt;b&gt;|&lt;/b&gt;&#xA;      &lt;b&gt;a&lt;/b&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Relay removal&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If there are vertices &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; and a non-empty set of vertices &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;, such that &lt;span class=&quot;math-container&quot;&gt;\$b \notin N\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$E_b = \{(a, b)\} \cup (b, N)\$&lt;/span&gt;, then &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; is removed from the graph and edges &lt;span class=&quot;math-container&quot;&gt;\$(a, N)\$&lt;/span&gt; are added if they do not alreay exist.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This means that a vertex with exactly one edge ending there, at least one edge starting there and no self-loop can be removed, moving the starting edges to the start of the ending edge.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Simple example:&#xA;&#xA;            1             1&#xA;            ^             ^&#xA;            |             |&#xA;O --&amp;gt; a --&amp;gt; b  ==&amp;gt;  O --&amp;gt; a ----.&#xA;      ^     |             ^     |&#xA;      |     v             |     v&#xA;      '---- 2             '---- 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The output is the result of the reductions, in any convenient format. If identifiers are used for edges or vertices, as in a list of edges, these identifiers are not required to correspond to identifiers in the input.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A different format may be used for input and output.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;: Lowest bytecount in each language wins. No answer will be accepted, as there is no overall winner.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Other rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard loopholes apply&lt;/li&gt;&#xA;&lt;li&gt;Functions or programs&lt;/li&gt;&#xA;&lt;li&gt;Any input and output methods (STDIN, arguments, &lt;code&gt;prompt()&lt;/code&gt;, ...)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;not yet&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h2&gt;Meta:&lt;/h2&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;Everything clear?&lt;/li&gt;&#xA;  &lt;li&gt;Better explanations?&lt;/li&gt;&#xA;  &lt;li&gt;Better title?&lt;/li&gt;&#xA;  &lt;li&gt;I'm not sure whether output might depend on the order in which reductions are performed.&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="78123" LastEditorUserId="78123" LastEditDate="2020-02-18T13:52:40.893" LastActivityDate="2020-02-18T13:52:40.893" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18570" PostTypeId="2" ParentId="2140" CreationDate="2020-02-18T19:45:01.573" Score="2" Body="&lt;h1&gt;Is this entire list likewise-modulus-aligned?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A pair of numbers are &lt;em&gt;aligned&lt;/em&gt; in a modulus when they all share the same remainder when they can be put under the modulus function against an integer greater than or equal to 2 and less than or equal to the absolute value of both.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;For example,&#xA;&#xA;13 and 22 are aligned numbers under 3 because&#xA;13%3 = 1&#xA;22%3 = 1&#xA;&#xA;3&amp;lt;=13, 3&amp;lt;=22, and 3&amp;gt;=2&#xA;&#xA;All our requirements are met.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;A list is likewise-modulus-aligned when all the elements are aligned under the same modulus base.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Take in a list (not necessarily non-empty) of non-zero integers (not necessarily positive nor unique), and check if all the elements are likewise-modulus-aligned. Output is a truthy or falsy value.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note; This is a &quot;true-until-proven-otherwise&quot; problem, meaning a single value in the list or an empty list will return TRUE.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example I/O&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;      In      | Out | Why&#xA;--------------|-----|---------&#xA;         [5 7]|TRUE |1 mod 2&#xA;     [7 12 18]|FALSE|(7,18) are not mod-aligned&#xA;     [7 11 19]|TRUE |1 mod 2&#xA;  [5 13 28 44]|FALSE|(5,28) are not mod-aligned&#xA;[10 13 37 108]|FALSE|(37,108) aren't aligned in any base below 10&#xA;            []|TRUE |No disproven pairs&#xA;          [42]|TRUE |No disproven pairs&#xA;    [-5 13 16]|TRUE |1 mod 3&#xA;      [1 9 18]|FALSE|Arrays of size 2 or greater with 1 or -1 will always be false&#xA;    [14 17 19]|FALSE|Every pair is modulus-aligned, but not under the same base&#xA;[17,22,32,107]|TRUE |2 mod 5&#xA;      [4,8,12]|TRUE |0 mod 2&#xA;        [-1,1]|FALSE|No mod 1 allowed&#xA;           [1]|TRUE |No disproven pairs&#xA;       [7,7,7]|TRUE |Numbers &amp;gt;=2 are always mod-aligned with themselves&#xA;     [2,2,8,8]|TRUE |0 mod 2&#xA;   [3 9 22 22]|FALSE|Pairs don't suddenly make (9,22) mod-aligned.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm gauging the interest to this question and seeing if this is an acceptable and unique challenge, just want to make sure I haven't missed another post doing a similar thing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I changed the rules to be a lot more lenient on the comparisons, might do the pairwise comparison as a bonus or follow-up challenge later. But this is a compromise I can live with.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Extra Hints/Tips&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For all non-1 derivations, a number will be aligned with its negative self.&lt;br&gt;&#xA;1 is never aligned with any other number, nor will -1.&lt;br&gt;&#xA;A number that is a multiple of another will be aligned with that number in all its factors.&lt;br&gt;&#xA;Numbers that share factors will always align, but numbers that &lt;em&gt;don't&lt;/em&gt; share factors also may.&lt;br&gt;&#xA;All odd numbers are aligned with each other, as are all even numbers.  &lt;/p&gt;&#xA;" OwnerUserId="91819" LastEditorUserId="91819" LastEditDate="2020-02-21T14:50:05.353" LastActivityDate="2020-02-21T14:50:05.353" CommentCount="30" ContentLicense="CC BY-SA 4.0" />
  <row Id="18576" PostTypeId="2" ParentId="2140" CreationDate="2020-02-20T00:31:16.240" Score="2" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/200215/31625&quot;&gt;Square-Cube Digit Usage&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerDisplayName="user92069" LastEditorUserId="31625" LastEditDate="2020-02-27T19:41:34.443" LastActivityDate="2020-02-27T19:41:34.443" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18579" PostTypeId="2" ParentId="2140" CreationDate="2020-02-21T09:30:16.490" Score="0" Body="&lt;h1&gt;Shared Letters in consecutive numbers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://puzzling.stackexchange.com/questions/93940/letters-in-consecutive-numbers&quot;&gt;this puzzling question&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It turns out that, in English, every pair of consecutive integers (e.g. &lt;code&gt;0,1&lt;/code&gt;, &lt;code&gt;1,2&lt;/code&gt;, etc.) shares at least one letter when spelled out (e.g. &lt;code&gt;zErO, OnE&lt;/code&gt; (or &lt;code&gt;NOught, ONe&lt;/code&gt;); &lt;code&gt;One, twO&lt;/code&gt;, etc).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Any two non-negative integers (all natural numbers including 0) up to and including one googol. These can be input as any type you choose, but string representations must only use the characters &lt;code&gt;0123456789.,'&lt;/code&gt; (i.e. the numbers must not already be spelled out on input, but rather input as a numeral).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can assume that the two numbers will be consecutive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some examples of valid inputs:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;{1,2}&lt;br&gt;&#xA;{&quot;1&quot;,&quot;2&quot;}&lt;br&gt;&#xA;{1},{2}&lt;br&gt;&#xA;{{&quot;1&quot;},{2}}&lt;br&gt;&#xA;&quot;123,245&quot;, &quot;123,246&quot;&lt;br&gt;&#xA;&quot;123.456&quot;, &quot;123'457&quot;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;some examples of &lt;strong&gt;in&lt;/strong&gt;valid inputs&lt;/p&gt;&#xA;&#xA;&lt;p&gt;{1,3}&lt;br&gt;&#xA;{-1,0}&lt;br&gt;&#xA;{1.1,1.2}&lt;br&gt;&#xA;{&quot;one&quot;,&quot;two&quot;}  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given the two inputs, output all shared characters when spelled (both numbers spelled in either lower or upper-case, the same case for both numbers).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A sample implementation for spelling numbers can be found here: &lt;a href=&quot;https://stackoverflow.com/a/3911982/318414&quot;&gt;https://stackoverflow.com/a/3911982/318414&lt;/a&gt;; but I'm sure other options exist; and there are certainly efficiencies to be found given that there are large amounts of shared strings, once you get into the higher numbers. See also &lt;a href=&quot;https://simple.wikipedia.org/wiki/Names_for_large_numbers&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://simple.wikipedia.org/wiki/Names_for_large_numbers&lt;/a&gt; for the names of large numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, usual exclusions apply&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&#xA;The shared letters, in any reasonable format. Any of the three numbering systems on the Wikipedia page are valid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I will be assuming British English (long form) in my examples.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;{6,7}&lt;/code&gt; -&gt; &lt;code&gt;&quot;s&quot;&lt;/code&gt; or &lt;code&gt;&quot;S&quot;&lt;/code&gt; (six, seven)  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;{999,1000}&lt;/code&gt; -&gt; &lt;code&gt;{&quot;n&quot;,&quot;e&quot;,&quot; &quot;,&quot;t&quot;,&quot;h&quot;,&quot;u&quot;,&quot;a&quot;,&quot;d&quot;}&lt;/code&gt; (&lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne hund&lt;/strong&gt;r&lt;strong&gt;ed and n&lt;/strong&gt;i&lt;strong&gt;net&lt;/strong&gt;y &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt;, o&lt;strong&gt;ne th&lt;/strong&gt;o&lt;strong&gt;u&lt;/strong&gt;s&lt;strong&gt;and&lt;/strong&gt;)  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;{88955,88956}&lt;/code&gt; -&gt; `` (&lt;strong&gt;eighty eight thousand nine hundred and fifty fi&lt;/strong&gt;v&lt;strong&gt;e&lt;/strong&gt;, &lt;strong&gt;eighty eight thousand nine hundred and fifty si&lt;/strong&gt;x)  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000,1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001&lt;/code&gt; -&gt; &lt;code&gt;&quot;ONE THUSADQICL&quot;&lt;/code&gt; (&lt;strong&gt;ONE THOUSAND QUINDECILLION&lt;/strong&gt;, &lt;strong&gt;ONE THOUSAND QUINDECILLION AND ONE&lt;/strong&gt;)   &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000&lt;/code&gt; -&gt; &lt;code&gt;el no&lt;/code&gt; (&lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; hundr&lt;strong&gt;e&lt;/strong&gt;d and &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt;ty &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; th&lt;strong&gt;o&lt;/strong&gt;usa&lt;strong&gt;n&lt;/strong&gt;d s&lt;strong&gt;e&lt;/strong&gt;xd&lt;strong&gt;e&lt;/strong&gt;ci&lt;strong&gt;ll&lt;/strong&gt;i&lt;strong&gt;on **n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; hundr&lt;strong&gt;e&lt;/strong&gt;d and &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt;ty &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; th&lt;strong&gt;o&lt;/strong&gt;usa&lt;strong&gt;n&lt;/strong&gt;d qui&lt;strong&gt;n&lt;/strong&gt;d&lt;strong&gt;e&lt;/strong&gt;ci&lt;strong&gt;ll&lt;/strong&gt;i&lt;strong&gt;o&lt;/strong&gt;n &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; hundr&lt;strong&gt;e&lt;/strong&gt;d and &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt;ty &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; th&lt;strong&gt;o&lt;/strong&gt;usa&lt;strong&gt;n&lt;/strong&gt;d quattur&lt;strong&gt;o&lt;/strong&gt;d&lt;strong&gt;e&lt;/strong&gt;ci&lt;strong&gt;ll&lt;/strong&gt;i&lt;strong&gt;o&lt;/strong&gt;n &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; hundr&lt;strong&gt;e&lt;/strong&gt;d and &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt;ty &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; th&lt;strong&gt;o&lt;/strong&gt;usa&lt;strong&gt;n&lt;/strong&gt;d tr&lt;strong&gt;e&lt;/strong&gt;d&lt;strong&gt;e&lt;/strong&gt;ci&lt;strong&gt;ll&lt;/strong&gt;i&lt;strong&gt;o&lt;/strong&gt;n &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; hundr&lt;strong&gt;e&lt;/strong&gt;d and &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt;ty &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; th&lt;strong&gt;o&lt;/strong&gt;usa&lt;strong&gt;n&lt;/strong&gt;d du&lt;strong&gt;o&lt;/strong&gt;d&lt;strong&gt;e&lt;/strong&gt;ci&lt;strong&gt;ll&lt;/strong&gt;i&lt;strong&gt;o&lt;/strong&gt;n &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; hundr&lt;strong&gt;e&lt;/strong&gt;d and &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt;ty &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; th&lt;strong&gt;o&lt;/strong&gt;usa&lt;strong&gt;n&lt;/strong&gt;d u&lt;strong&gt;n&lt;/strong&gt;d&lt;strong&gt;e&lt;/strong&gt;ci&lt;strong&gt;ll&lt;/strong&gt;i&lt;strong&gt;o&lt;/strong&gt;n &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; hundr&lt;strong&gt;e&lt;/strong&gt;d and &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt;ty &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; th&lt;strong&gt;o&lt;/strong&gt;usa&lt;strong&gt;n&lt;/strong&gt;d d&lt;strong&gt;e&lt;/strong&gt;ci&lt;strong&gt;ll&lt;/strong&gt;i&lt;strong&gt;o&lt;/strong&gt;n &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; hundr&lt;strong&gt;e&lt;/strong&gt;d and &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt;ty &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; th&lt;strong&gt;o&lt;/strong&gt;usa&lt;strong&gt;n&lt;/strong&gt;d &lt;strong&gt;non&lt;/strong&gt;i&lt;strong&gt;ll&lt;/strong&gt;i&lt;strong&gt;o&lt;/strong&gt;n &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; hundr&lt;strong&gt;e&lt;/strong&gt;d and &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt;ty &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; th&lt;strong&gt;o&lt;/strong&gt;usa&lt;strong&gt;n&lt;/strong&gt;d &lt;strong&gt;o&lt;/strong&gt;cti&lt;strong&gt;ll&lt;/strong&gt;i&lt;strong&gt;o&lt;/strong&gt;n &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; hundr&lt;strong&gt;e&lt;/strong&gt;d and &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt;ty &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; th&lt;strong&gt;o&lt;/strong&gt;usa&lt;strong&gt;n&lt;/strong&gt;d s&lt;strong&gt;e&lt;/strong&gt;pti&lt;strong&gt;ll&lt;/strong&gt;i&lt;strong&gt;o&lt;/strong&gt;n &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; hundr&lt;strong&gt;e&lt;/strong&gt;d and &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt;ty &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; th&lt;strong&gt;o&lt;/strong&gt;usa&lt;strong&gt;n&lt;/strong&gt;d s&lt;strong&gt;e&lt;/strong&gt;xti&lt;strong&gt;ll&lt;/strong&gt;i&lt;strong&gt;o&lt;/strong&gt;n &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; hundr&lt;strong&gt;e&lt;/strong&gt;d and &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt;ty &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; th&lt;strong&gt;o&lt;/strong&gt;usa&lt;strong&gt;n&lt;/strong&gt;d qui&lt;strong&gt;n&lt;/strong&gt;ti&lt;strong&gt;ll&lt;/strong&gt;i&lt;strong&gt;o&lt;/strong&gt;n &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; hundr&lt;strong&gt;e&lt;/strong&gt;d and &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt;ty &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; th&lt;strong&gt;o&lt;/strong&gt;usa&lt;strong&gt;n&lt;/strong&gt;d quadri&lt;strong&gt;ll&lt;/strong&gt;i&lt;strong&gt;o&lt;/strong&gt;n &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; hundr&lt;strong&gt;e&lt;/strong&gt;d and &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt;ty &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; th&lt;strong&gt;o&lt;/strong&gt;usa&lt;strong&gt;n&lt;/strong&gt;d tri&lt;strong&gt;ll&lt;/strong&gt;i&lt;strong&gt;o&lt;/strong&gt;n &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; hundr&lt;strong&gt;e&lt;/strong&gt;d and &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt;ty &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; th&lt;strong&gt;o&lt;/strong&gt;usa&lt;strong&gt;n&lt;/strong&gt;d bi&lt;strong&gt;ll&lt;/strong&gt;i&lt;strong&gt;o&lt;/strong&gt;n &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; hundr&lt;strong&gt;e&lt;/strong&gt;d and &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt;ty &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; th&lt;strong&gt;o&lt;/strong&gt;usa&lt;strong&gt;n&lt;/strong&gt;d mi&lt;strong&gt;ll&lt;/strong&gt;i&lt;strong&gt;o&lt;/strong&gt;n &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; hundr&lt;strong&gt;e&lt;/strong&gt;d and &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt;ty &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; th&lt;strong&gt;o&lt;/strong&gt;usa&lt;strong&gt;n&lt;/strong&gt;d &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt; hundr&lt;strong&gt;e&lt;/strong&gt;d and &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt;ty &lt;strong&gt;n&lt;/strong&gt;i&lt;strong&gt;ne&lt;/strong&gt;; &lt;strong&gt;one&lt;/strong&gt; g&lt;strong&gt;oo&lt;/strong&gt;g&lt;strong&gt;ol&lt;/strong&gt;) &lt;/p&gt;&#xA;" OwnerUserId="62289" LastEditorUserId="62289" LastEditDate="2020-02-24T09:08:15.920" LastActivityDate="2020-02-24T09:08:15.920" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18581" PostTypeId="2" ParentId="2140" CreationDate="2020-02-21T14:45:01.093" Score="0" Body="&lt;h1&gt;Let's Play Countdown!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;(The Numbers round this time)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Countdown is a British TV game show composed of three different styles of rounds; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/38233/lets-play-countdown&quot;&gt;the letters round&lt;/a&gt;, the conundrum, and the numbers round.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The conundrum could be solved with the same program you'd make for the Letters round, so let's tackle the third option that hasn't been done yet!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Take in a set of numbers. One of which is the &quot;Target&quot; number, and the rest are the building numbers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Countdown Number Round asks you to take the building numbers and to construct the Target number only using the four elementary operators. Every step must result in another strictly-positive integer (so non-perfect division is disallowed). Output the method to which you can construct the target number. If that's impossible, get as close as possible (above or below are scored the same). Numbers do not need to be used, but may NOT be reused.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note - You will perform at most N-1 operations, where N is the number of building numbers. Every elementary operator takes in two inputs and provides one, so you &quot;lose&quot; one from your ranking every operation. That should give you an idea of the size of your output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I/O is in any reasonable format, but target vs building numbers must be obviously distinct (either by the target being the first or the last number, or outside an array, or a different type, etc).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output needs to explain exactly what operations are being performed on what numbers, and what the output for each operation would be, but can be done in whichever way seems reasonable.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example I/O&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;In these examples, the first element is the target.&#xA;&#xA;[888 100 2 75 3 1 10]&#xA;75-1=74&#xA;10+2=12&#xA;74x12=888&#xA;&#xA;[766 22 10 8 3 1]&#xA;22+10=32&#xA;32x8=256&#xA;256-1=255&#xA;255x3=765 #You cannot get this one exactly, but one-off is close.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm... like 85% sure this isn't anywhere here yet. I did a chunk of searching and couldn't find anything that fit the bill, so I think this is clear?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any other neat examples you guys got?&lt;/p&gt;&#xA;" OwnerUserId="91819" LastActivityDate="2020-02-21T14:45:01.093" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18584" PostTypeId="2" ParentId="2140" CreationDate="2020-02-23T05:32:50.963" Score="0" Body="&lt;p&gt;&lt;strong&gt;Iterative Quadratics&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Recently, in my algebra class, we proved that the following process always stops at some point, so I thought it would be a cool challenge!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;: Two reals a,b.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt; Non-negative integer&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given two reals a,b, initialize a count variable c to 0, consider the quadratic equation&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;x^2+ax+b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If this quadratic has real roots r,s (r&amp;lt;=s), increment the counter by 1, and replace a,b with r,s and repeat the process.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If the quadratic has complex roots, return c.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test Cases&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To be added.&lt;/p&gt;&#xA;" OwnerUserId="82007" LastActivityDate="2020-02-23T05:32:50.963" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18586" PostTypeId="2" ParentId="2140" CreationDate="2020-02-23T14:34:44.120" Score="0" Body="&lt;h2&gt;Doubly stochastic matrix &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Doubly_stochastic_matrix#Birkhoff_polytope_and_Birkhoff%E2%80%93von_Neumann_theorem&quot; rel=&quot;nofollow noreferrer&quot;&gt;doubly-stochastic matrix&lt;/a&gt; is a square matrix of non-negative real entries each of whose rows and columns sums to 1. Given a doubly-stochastic matrix, express it as a non-negative linear combination of &lt;a href=&quot;https://en.wikipedia.org/wiki/Permutation_matrix&quot; rel=&quot;nofollow noreferrer&quot;&gt;permutation matrices&lt;/a&gt;, as is guaranteed to exist by the &lt;a href=&quot;http://Birkhoff%E2%80%93von%20Neumann%20theorem&quot; rel=&quot;nofollow noreferrer&quot;&gt;Birkhoff–von Neumann theorem&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TODO: Example, better explanation, test cases. If you want to develop and post this challenge, it's yours.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2020-02-23T14:34:44.120" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18589" PostTypeId="2" ParentId="2140" CreationDate="2020-02-23T23:12:05.937" Score="0" Body="&lt;h1&gt;Implement GF(2²)&lt;/h1&gt;&#xA;&lt;h2&gt;Introduction to groups and fields&lt;/h2&gt;&#xA;&lt;p&gt;An &lt;strong&gt;additive group&lt;/strong&gt; is a set with &lt;strong&gt;addition&lt;/strong&gt; and &lt;strong&gt;negation&lt;/strong&gt; defined. They must satisfy the following conditions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; is the additive identity.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Addition is associative.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For every &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;, the negation of &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$-x\$&lt;/span&gt; exists, and &lt;span class=&quot;math-container&quot;&gt;\$x + (-x) = (-x) + x = 0\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If addition is also commutative, the additive group is called &lt;strong&gt;abelian&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;A &lt;strong&gt;field&lt;/strong&gt; is an additive abelian group with &lt;strong&gt;multiplication&lt;/strong&gt; and &lt;strong&gt;reciprocal&lt;/strong&gt; defined. They must satisfy the following conditions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; is the multiplicative identity.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Multiplication is associative and commutative.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For every nonzero &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;, the reciprocal of &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$x^{-1}\$&lt;/span&gt; &lt;em&gt;uniquely&lt;/em&gt; exists, and &lt;span class=&quot;math-container&quot;&gt;\$x\times x^{-1} = x^{-1}\times x = 1\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Multiplication distributes over addition.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Modular Arithmetic&lt;/h2&gt;&#xA;&lt;p&gt;For every positive integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, you can define an additive abelian group as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Define the set as integers from &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$n-1\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Define addition as usual addition with the result moduloed by &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Define negation as usual negation with the result moduloed by &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This group is denoted by &lt;span class=&quot;math-container&quot;&gt;\$ℤ_n\$&lt;/span&gt;. If &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is prime, multiplication can be analogously defined, making it a field.  In particular, the operation tables of &lt;span class=&quot;math-container&quot;&gt;\$ℤ_2\$&lt;/span&gt; are:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{array}{l|ll}&#xA;+ &amp;amp; 0 &amp;amp; 1 \\ \hline&#xA;0 &amp;amp; 0 &amp;amp; 1 \\&#xA;1 &amp;amp; 1 &amp;amp; 0&#xA;\end{array}&#xA;\begin{array}{l|ll}&#xA;x &amp;amp; -x \\ \hline&#xA;0 &amp;amp; 0 \\&#xA;1 &amp;amp; 1&#xA;\end{array}&#xA;\begin{array}{l|ll}&#xA;× &amp;amp; 0 &amp;amp; 1 \\ \hline&#xA;0 &amp;amp; 0 &amp;amp; 0 \\&#xA;1 &amp;amp; 0 &amp;amp; 1&#xA;\end{array}&#xA;\begin{array}{l|ll}&#xA;x &amp;amp; x^{-1} \\ \hline&#xA;0 &amp;amp; \text{NaN} \\&#xA;1 &amp;amp; 1&#xA;\end{array}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Galois Field GF(2²)&lt;/h2&gt;&#xA;&lt;p&gt;A &lt;strong&gt;Galois field&lt;/strong&gt; &lt;span class=&quot;math-container&quot;&gt;\$\text{GF}(p^k)\$&lt;/span&gt; emerges when one takes the set as polynomials over &lt;span class=&quot;math-container&quot;&gt;\$ℤ_p\$&lt;/span&gt;, and defines addition and multiplication as the usual operation with polynomial modulo, where the modding polynomial is &lt;strong&gt;irreducible&lt;/strong&gt; and has degree of &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;. Since &lt;span class=&quot;math-container&quot;&gt;\$x^2+x+1\$&lt;/span&gt; is an (in fact, the only) irreducible polynomial over &lt;span class=&quot;math-container&quot;&gt;\$ℤ_2\$&lt;/span&gt; that has degree &lt;span class=&quot;math-container&quot;&gt;\$2\$&lt;/span&gt;, this results in &lt;span class=&quot;math-container&quot;&gt;\$\text{GF}(2^2)\$&lt;/span&gt;. Its operation tables are:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{array}{l|ll}&#xA;+ &amp;amp; 0 &amp;amp; 1 &amp;amp; x &amp;amp; x+1 \\ \hline&#xA;0 &amp;amp; 0 &amp;amp; 1 &amp;amp; x &amp;amp; x+1 \\&#xA;1 &amp;amp; 1 &amp;amp; 0 &amp;amp; x+1 &amp;amp; x \\&#xA;x &amp;amp; x &amp;amp; x+1 &amp;amp; 0 &amp;amp; 1 \\&#xA;x+1 &amp;amp; x+1 &amp;amp; x &amp;amp; 1 &amp;amp; 0&#xA;\end{array}&#xA;\begin{array}{l|ll}&#xA;f(x) &amp;amp; -f(x) \\ \hline&#xA;0 &amp;amp; 0 \\&#xA;1 &amp;amp; 1 \\&#xA;x &amp;amp; x \\&#xA;x+1 &amp;amp; x+1&#xA;\end{array}&#xA;\\&#xA;\begin{array}{l|ll}&#xA;× &amp;amp; 0 &amp;amp; 1 &amp;amp; x &amp;amp; x+1 \\ \hline&#xA;0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 \\&#xA;1 &amp;amp; 0 &amp;amp; 1 &amp;amp; x &amp;amp; x+1 \\&#xA;x &amp;amp; 0 &amp;amp; x &amp;amp; x+1 &amp;amp; 1 \\&#xA;x+1 &amp;amp; 0 &amp;amp; x+1 &amp;amp; 1 &amp;amp; x&#xA;\end{array}&#xA;\begin{array}{l|ll}&#xA;f(x) &amp;amp; f(x)^{-1} \\ \hline&#xA;0 &amp;amp; \text{NaN} \\&#xA;1 &amp;amp; 1 \\&#xA;x &amp;amp; x+1 \\&#xA;x+1 &amp;amp; x&#xA;\end{array}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to implement the set and the operations. As a conseuqence, you must have:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The members of the set defined as constants (2-bit bitstring, an ASCII digit, or whatever). This won't contribute to the score.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Four codes that defines each operations, whose input(s) is/are as defined above.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Though defined as polynomials, the type and format of the inputs doesn't matter. You must have the same type for every input.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The type and format of the outputs doesn't matter either, but it must be the same as the input(s).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The reciprocal of &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; must result in an &amp;quot;error&amp;quot; condition. This includes returning an errornous value, throwing an error, or terminating the program. It must halt.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Other invalid inputs fall in &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Since there are multiple codes, the score for code golf is alloted by the sum of their lengths in bytes.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-02-24T03:32:59.417" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="18590" PostTypeId="2" ParentId="5582" CreationDate="2020-02-24T02:26:09.397" Score="1" Body="&lt;h2&gt;Make a reference implementation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There are times that specifying the challenge is difficult. Making a reference implementation for your challenge solves the specification problem.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastActivityDate="2020-02-24T02:26:09.397" CommentCount="0" CommunityOwnedDate="2020-02-24T02:26:09.397" ContentLicense="CC BY-SA 4.0" />
  <row Id="18591" PostTypeId="2" ParentId="2140" CreationDate="2020-02-24T06:50:12.373" Score="-1" Body="&lt;h1&gt;Implement PSL(2,3)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Since challenge to implement Galois field already have been many, I'm writing a challenge involving a group of Lie type!&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Implement the multiplication and inversion in &lt;span class=&quot;math-container&quot;&gt;\$\text{PSL}(2,3)\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;The ring &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{Z}_3\$&lt;/span&gt;&lt;/h2&gt;&#xA;&lt;p&gt;The ring &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{Z}_3\$&lt;/span&gt; is the set &lt;span class=&quot;math-container&quot;&gt;\$\{0,1,2\}\$&lt;/span&gt; with &lt;strong&gt;addition&lt;/strong&gt;, &lt;strong&gt;negation&lt;/strong&gt;, &lt;strong&gt;subtraction&lt;/strong&gt;, and &lt;strong&gt;multiplication&lt;/strong&gt; defined as &lt;strong&gt;modular arithmetic&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Addition is the usual addition with the result moduloed by 3;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Negation, subtraction, and multiplication are also analogously defined.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Reciprocal&lt;/strong&gt; and &lt;strong&gt;division&lt;/strong&gt; is also well-defined, but that's just another detail.&lt;/p&gt;&#xA;&lt;h2&gt;The group &lt;span class=&quot;math-container&quot;&gt;\$\text{SL}(2,3)\$&lt;/span&gt;&lt;/h2&gt;&#xA;&lt;p&gt;The multiplicative group &lt;span class=&quot;math-container&quot;&gt;\$\text{SL}(2,3)\$&lt;/span&gt; is the set of 2-by-2 matrices whose entries are members of &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{Z}_3\$&lt;/span&gt; and the determinant is &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt;. Note that the determinant is calculated using modular arithmetic. &lt;strong&gt;Matrix multiplication&lt;/strong&gt; and &lt;strong&gt;matrix inversion&lt;/strong&gt; is defined as:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Matrix multiplication is the usual matrix multiplication, where addition and multiplication of the entries are modular;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Matrix inversion of &lt;span class=&quot;math-container&quot;&gt;\$\begin{pmatrix} a &amp;amp; b \\ c &amp;amp; d \end{pmatrix}\$&lt;/span&gt; is &lt;span class=&quot;math-container&quot;&gt;\$\begin{pmatrix} d &amp;amp; -b \\ -c &amp;amp; a \end{pmatrix}\$&lt;/span&gt;. This exploits that the determinant is &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;As a consequence, the elements of &lt;span class=&quot;math-container&quot;&gt;\$\text{SL}(2,3)\$&lt;/span&gt; are:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$\begin{pmatrix} 0 &amp;amp; 1 \\ 2 &amp;amp; 0\end{pmatrix},&#xA;\begin{pmatrix} 0 &amp;amp; 1 \\ 2 &amp;amp; 1\end{pmatrix},&#xA;\begin{pmatrix} 0 &amp;amp; 1 \\ 2 &amp;amp; 2\end{pmatrix},&#xA;\begin{pmatrix} 0 &amp;amp; 2 \\ 1 &amp;amp; 0\end{pmatrix},&#xA;\begin{pmatrix} 0 &amp;amp; 2 \\ 1 &amp;amp; 1\end{pmatrix},&#xA;\begin{pmatrix} 0 &amp;amp; 2 \\ 1 &amp;amp; 2\end{pmatrix},&#xA;\begin{pmatrix} 1 &amp;amp; 0 \\ 0 &amp;amp; 1\end{pmatrix},&#xA;\begin{pmatrix} 1 &amp;amp; 0 \\ 1 &amp;amp; 1\end{pmatrix},&#xA;\begin{pmatrix} 1 &amp;amp; 0 \\ 2 &amp;amp; 1\end{pmatrix},&#xA;\begin{pmatrix} 1 &amp;amp; 1 \\ 0 &amp;amp; 1\end{pmatrix},&#xA;\begin{pmatrix} 1 &amp;amp; 1 \\ 1 &amp;amp; 2\end{pmatrix},&#xA;\begin{pmatrix} 1 &amp;amp; 1 \\ 2 &amp;amp; 0\end{pmatrix},&#xA;\begin{pmatrix} 1 &amp;amp; 2 \\ 0 &amp;amp; 1\end{pmatrix},&#xA;\begin{pmatrix} 1 &amp;amp; 2 \\ 1 &amp;amp; 0\end{pmatrix},&#xA;\begin{pmatrix} 1 &amp;amp; 2 \\ 2 &amp;amp; 2\end{pmatrix},&#xA;\begin{pmatrix} 2 &amp;amp; 0 \\ 0 &amp;amp; 2\end{pmatrix},&#xA;\begin{pmatrix} 2 &amp;amp; 0 \\ 1 &amp;amp; 2\end{pmatrix},&#xA;\begin{pmatrix} 2 &amp;amp; 0 \\ 2 &amp;amp; 2\end{pmatrix},&#xA;\begin{pmatrix} 2 &amp;amp; 1 \\ 0 &amp;amp; 2\end{pmatrix},&#xA;\begin{pmatrix} 2 &amp;amp; 1 \\ 1 &amp;amp; 1\end{pmatrix},&#xA;\begin{pmatrix} 2 &amp;amp; 1 \\ 2 &amp;amp; 0\end{pmatrix},&#xA;\begin{pmatrix} 2 &amp;amp; 2 \\ 0 &amp;amp; 2\end{pmatrix},&#xA;\begin{pmatrix} 2 &amp;amp; 2 \\ 1 &amp;amp; 0\end{pmatrix},&#xA;\begin{pmatrix} 2 &amp;amp; 2 \\ 2 &amp;amp; 1\end{pmatrix}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h2&gt;The factor group &lt;span class=&quot;math-container&quot;&gt;\$\text{PSL}(2,3)\$&lt;/span&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\text{PSL}(2,3)\$&lt;/span&gt; is defined as &lt;strong&gt;cosets&lt;/strong&gt; of &lt;span class=&quot;math-container&quot;&gt;\$\text{SL}(2,3)\$&lt;/span&gt; by &lt;span class=&quot;math-container&quot;&gt;\$\{\begin{pmatrix} 1 &amp;amp; 0 \\ 0 &amp;amp; 1\end{pmatrix},&#xA;\begin{pmatrix} 2 &amp;amp; 0 \\ 0 &amp;amp; 2\end{pmatrix}\}\$&lt;/span&gt;. That is, elementwise multiplications of &lt;span class=&quot;math-container&quot;&gt;\$\{\begin{pmatrix} 1 &amp;amp; 0 \\ 0 &amp;amp; 1\end{pmatrix},&#xA;\begin{pmatrix} 2 &amp;amp; 0 \\ 0 &amp;amp; 2\end{pmatrix}\}\$&lt;/span&gt;.&#xA;They are:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\{\begin{pmatrix} 0 &amp;amp; 1 \\ 2 &amp;amp; 0\end{pmatrix},&#xA;\begin{pmatrix} 0 &amp;amp; 2 \\ 1 &amp;amp; 0\end{pmatrix}\},&#xA;\{\begin{pmatrix} 0 &amp;amp; 1 \\ 2 &amp;amp; 1\end{pmatrix},&#xA;\begin{pmatrix} 0 &amp;amp; 2 \\ 1 &amp;amp; 2\end{pmatrix}\},&#xA;\{\begin{pmatrix} 0 &amp;amp; 1 \\ 2 &amp;amp; 2\end{pmatrix},&#xA;\begin{pmatrix} 0 &amp;amp; 2 \\ 1 &amp;amp; 1\end{pmatrix}\},&#xA;\{\begin{pmatrix} 1 &amp;amp; 0 \\ 0 &amp;amp; 1\end{pmatrix},&#xA;\begin{pmatrix} 2 &amp;amp; 0 \\ 0 &amp;amp; 2\end{pmatrix}\},&#xA;\{\begin{pmatrix} 1 &amp;amp; 0 \\ 1 &amp;amp; 1\end{pmatrix},&#xA;\begin{pmatrix} 2 &amp;amp; 0 \\ 2 &amp;amp; 2\end{pmatrix}\},&#xA;\{\begin{pmatrix} 1 &amp;amp; 0 \\ 2 &amp;amp; 1\end{pmatrix},&#xA;\begin{pmatrix} 2 &amp;amp; 0 \\ 1 &amp;amp; 2\end{pmatrix}\},&#xA;\{\begin{pmatrix} 1 &amp;amp; 1 \\ 0 &amp;amp; 1\end{pmatrix},&#xA;\begin{pmatrix} 2 &amp;amp; 2 \\ 0 &amp;amp; 2\end{pmatrix}\},&#xA;\{\begin{pmatrix} 1 &amp;amp; 1 \\ 1 &amp;amp; 2\end{pmatrix},&#xA;\begin{pmatrix} 2 &amp;amp; 2 \\ 2 &amp;amp; 1\end{pmatrix}\},&#xA;\{\begin{pmatrix} 1 &amp;amp; 1 \\ 2 &amp;amp; 0\end{pmatrix},&#xA;\begin{pmatrix} 2 &amp;amp; 2 \\ 1 &amp;amp; 0\end{pmatrix}\},&#xA;\{\begin{pmatrix} 1 &amp;amp; 2 \\ 0 &amp;amp; 1\end{pmatrix},&#xA;\begin{pmatrix} 2 &amp;amp; 1 \\ 0 &amp;amp; 2\end{pmatrix}\},&#xA;\{\begin{pmatrix} 1 &amp;amp; 2 \\ 1 &amp;amp; 0\end{pmatrix},&#xA;\begin{pmatrix} 2 &amp;amp; 1 \\ 2 &amp;amp; 0\end{pmatrix}\},&#xA;\{\begin{pmatrix} 1 &amp;amp; 2 \\ 2 &amp;amp; 2\end{pmatrix},&#xA;\begin{pmatrix} 2 &amp;amp; 1 \\ 1 &amp;amp; 1\end{pmatrix}\},&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;You pick an element of each coset as representives, and &lt;em&gt;don't care&lt;/em&gt; about the rest.&lt;/p&gt;&#xA;&lt;p&gt;Multiplication/inversion of such representives is defined as multiplication/inversion in &lt;span class=&quot;math-container&quot;&gt;\$\text{SL}(2,3)\$&lt;/span&gt;, then taking the representive of the coset the multiplication/inversion is in. For example, &lt;span class=&quot;math-container&quot;&gt;\$\begin{pmatrix} 0 &amp;amp; 1 \\ 2 &amp;amp; 0\end{pmatrix}^2 = \begin{pmatrix} 1 &amp;amp; 0 \\ 0 &amp;amp; 1\end{pmatrix}\$&lt;/span&gt;, if &lt;span class=&quot;math-container&quot;&gt;\$\begin{pmatrix} 0 &amp;amp; 1 \\ 2 &amp;amp; 0\end{pmatrix}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\begin{pmatrix} 1 &amp;amp; 0 \\ 0 &amp;amp; 1\end{pmatrix}\$&lt;/span&gt; are representives.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;Picking the left elements as representives of the cosets above:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{pmatrix} 0 &amp;amp; 1 \\ 2 &amp;amp; 0\end{pmatrix}^2 = \begin{pmatrix} 1 &amp;amp; 0 \\ 0 &amp;amp; 1\end{pmatrix},&#xA;\begin{pmatrix} 0 &amp;amp; 1 \\ 2 &amp;amp; 1\end{pmatrix}^2 = \begin{pmatrix} 1 &amp;amp; 2 \\ 1 &amp;amp; 0\end{pmatrix},&#xA;\begin{pmatrix} 1 &amp;amp; 0 \\ 0 &amp;amp; 1\end{pmatrix}\begin{pmatrix} 1 &amp;amp; 1 \\ 1 &amp;amp; 2\end{pmatrix} = \begin{pmatrix} 1 &amp;amp; 1 \\ 1 &amp;amp; 2\end{pmatrix},&#xA;\begin{pmatrix} 1 &amp;amp; 2 \\ 2 &amp;amp; 2\end{pmatrix}\begin{pmatrix} 1 &amp;amp; 1 \\ 1 &amp;amp; 2\end{pmatrix} = \begin{pmatrix} 0 &amp;amp; 1 \\ 2 &amp;amp; 0\end{pmatrix},&#xA;\begin{pmatrix} 1 &amp;amp; 2 \\ 2 &amp;amp; 2\end{pmatrix}^{-1} = \begin{pmatrix} 1 &amp;amp; 2 \\ 2 &amp;amp; 2\end{pmatrix}&#xA;$$&lt;/span&gt;&#xA;To be more specific about the method of evaluation:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{pmatrix} 0 &amp;amp; 1 \\ 2 &amp;amp; 1\end{pmatrix}\begin{pmatrix} 0 &amp;amp; 1 \\ 2 &amp;amp; 2\end{pmatrix} ≡ \begin{pmatrix} 2 &amp;amp; 2 \\ 2 &amp;amp; 4\end{pmatrix} ≡ \begin{pmatrix} 2 &amp;amp; 2 \\ 2 &amp;amp; 1\end{pmatrix} ≡ \begin{pmatrix} 1 &amp;amp; 1 \\ 1 &amp;amp; 2\end{pmatrix},&#xA;\\&#xA;\begin{pmatrix} 1 &amp;amp; 1 \\ 1 &amp;amp; 2\end{pmatrix}^{-1} ≡ \begin{pmatrix} 2 &amp;amp; -1 \\ -1 &amp;amp; 1\end{pmatrix} ≡ \begin{pmatrix} 2 &amp;amp; 2 \\ 2 &amp;amp; 1\end{pmatrix} ≡ \begin{pmatrix} 1 &amp;amp; 1 \\ 1 &amp;amp; 2\end{pmatrix}&#xA;$$&lt;/span&gt;&#xA;The steps of this algorithm is:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Do usual matrix multiplication/inversion;&lt;/li&gt;&#xA;&lt;li&gt;Modulo the entries by 3;&lt;/li&gt;&#xA;&lt;li&gt;Take the representive of the coset.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Though you can make any possible algorithm.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input type and format doesn't matter, but it must be a container of integers. In C, &lt;code&gt;int[2][2]&lt;/code&gt; and &lt;code&gt;int[4]&lt;/code&gt; are valid examples. This restriction prevents abusing the fact that &lt;span class=&quot;math-container&quot;&gt;\$\text{PSL}(2,3) \cong A_4\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Output type and format doesn't matter either, but it must be the same as the input type and format.&lt;/li&gt;&#xA;&lt;li&gt;Invalid inputs fall in &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/li&gt;&#xA;&lt;li&gt;Multiplication and inversion may be in separate codes. In this case, the score is the sum of their lengths in bytes.&lt;/li&gt;&#xA;&lt;li&gt;Since this is a code-golf, the code with least score wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-02-25T03:41:35.280" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18593" PostTypeId="1" AcceptedAnswerId="18604" CreationDate="2020-02-24T12:03:59.597" Score="11" ViewCount="304" Body="&lt;p&gt;Background: I ran into numerous issues when presenting and running this King of the Hill challenge back in October: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/194623/write-a-bot-to-play-grid-game&quot;&gt;Write a bot to play Grid Game&lt;/a&gt; - I'm cooking up a new, similar challenge, but taking things a bit more slowly and preparing more thoroughly to try and pre-emptively solve the issues we hit then.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;So this was the intended path for entries to the Grid Game competion:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Someone works on a bot, likes thier solution.&lt;/li&gt;&#xA;&lt;li&gt;It's added to a Github Gist.&lt;/li&gt;&#xA;&lt;li&gt;They past the gist and the code to an SO answer.&lt;/li&gt;&#xA;&lt;li&gt;My code grabs the gist via the Github gist api.&lt;/li&gt;&#xA;&lt;li&gt;The tournament is run with the latest version of the gists.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I also added a note that entrants could choose whether or not to consent to their entry becoming a part of the code base.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are some issues we found with that methodology:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The Gist API rate-limits get calls, so I had to cache the code to avoid being locked out.&lt;/li&gt;&#xA;&lt;li&gt;Entries were in multiple places, causing confusion on whether the latest version was used:&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;SE answer&lt;/li&gt;&#xA;&lt;li&gt;Gist&lt;/li&gt;&#xA;&lt;li&gt;Cached in local memory&lt;/li&gt;&#xA;&lt;li&gt;Cached in the code base&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Long story short, this was a real headache when running the tournament to get results. A lot of in-line changes had to be made to try and correct it.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Proposed solution&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;What I'd like to do about this, is to make the entry a Pull Request in Github, making the repository a single, central source.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It would look like this:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The entry is a JS class, in a certain folder in the application.&lt;/li&gt;&#xA;&lt;li&gt;There's a validator script which ensures it follows the rules of the challenge and doesn't break the applicaiton.&lt;/li&gt;&#xA;&lt;li&gt;The result is submitted as a pull request.&lt;/li&gt;&#xA;&lt;li&gt;If it passes the validator, it's accepted in to the repo and run as part of the tournament.&lt;/li&gt;&#xA;&lt;li&gt;Updates to an entry would be made in the same way, modifiying the existing file.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A 'single source of truth' for entries.&lt;/li&gt;&#xA;&lt;li&gt;Everyone can train their entries on all current entries.&lt;/li&gt;&#xA;&lt;li&gt;Less in-line problem solving.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Cons:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;To enter the contest would make the entrant a contributor to an open-source repo.&lt;/li&gt;&#xA;&lt;li&gt;The SE answer would probably be quite short, just a stub pointing to the pull request or file in the repo?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;The questions&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Is it acceptable to use Github Pull Requests as entries to a code challenge?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What other issues might this methodology introduce?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is there a better, regularly used way to import a few mid-length entries (probably between 10 and 100 lines) into an application to run a KotH challenge which I haven't considered?&lt;/p&gt;&#xA;" OwnerUserId="16824" LastActivityDate="2020-02-28T09:42:20.350" Title="Is it acceptable to ask for Github Pull Requests for a King of the Hill challenge?" Tags="|discussion|king-of-the-hill|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18594" PostTypeId="2" ParentId="2140" CreationDate="2020-02-24T15:08:53.597" Score="0" Body="&lt;h1&gt;Find spies in a multilingual csv&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You are an NSA undercover agent in a Middle-Eastern HR company, you just received a list of people with their jobs in many different languages. Some are spies and you need to know who. Your mission, if you accept it, is to get what are people working in, and relate it to a list of job categories. Most dangerous elements are those working in &lt;code&gt;Law enforcement and security&lt;/code&gt;. However as your code will be part of a bigger file it needs to be as short in lines as possible for stealthness.&#xA;This comes from expectations I encountered in the administration to keep some mystery behind code, if ever it were to be stolen.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This challenges your way to handle loops, map, reduce and filter, destructuring or unpacking an array/csv/df. Last but not least it allows you to get into the fascinating world of cross-language nlp.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I provide an example in python (64 lines of code)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The challenge is to get, in the shortest amount of bytes (libraries not included) the most similar element in an array of string with another string, and this for each line of a csv taken as input.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Inputs:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;X.csv&lt;/code&gt; a csv/dataframe of actual jobs that look like this one:&lt;/li&gt;&#xA;&lt;/ol&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;,new_professionactuelle&#xA;0,Entrepreneur&#xA;1,طالبة&#xA;2,ETUDIANT&#xA;3,ETUDIANT &#xA;4,موظف&#xA;5,موجه تربوي &#xA;6,Réalisateur film cartoon&#xA;7,إإطار مالي&#xA;8,موضف إطار&#xA;9,مهندس بمكتب دراسات&#xA;10,باحثة  _ كاتبة _ &#xA;11,طالب&#xA;12,Chef de projet&#xA;13,ASSUREUR&#xA;14,FONCTIONNAIRE D'ÉTAT&#xA;15,Professeur Universitaire&#xA;16,cadre supérieur&#xA;17,fonctionnaire&#xA;19,professeur&#xA;20,Chef de projet&#xA;21,مدير  شركة&#xA;22,Avocat&#xA;23,cadre à Maroc Telecom&#xA;24,Employé &#xA;25,Consultant en Immobilier&#xA;26,fonctionnaire&#xA;27,اجير أو عامل&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;df.csv&lt;/code&gt; job categories that must include all the following categories:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;['Agriculture, farming and environment',&#xA;   'Accountancy, banking and finance',&#xA;   'Teacher training and education', 'Leisure, sport and tourism',&#xA;   'Transport and logistics', 'Information technology',&#xA;   'Hospitality and events management',&#xA;   'Business, consulting and management', 'Creative arts and design',&#xA;   'Trade', 'Law enforcement and security',&#xA;   'Property and construction', 'Law',&#xA;   'Engineering and manufacturing', 'Social care',&#xA;   'Charity and voluntary work', 'Sales',&#xA;   'Public services and administration', 'Other. Please specify:',&#xA;   'Healthcare', 'Energy and utilities',&#xA;   'Marketing, advertising and PR', 'Media and internet',&#xA;   'Recruitment and HR', 'Science and pharmaceuticals']&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output would be the column in &lt;code&gt;X.csv&lt;/code&gt;  plus a new column, the most similar job. The most accurate results are:&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;,new_professionactuelle,category&#xA;0,Entrepreneur,Public services and administration&#xA;1,طالبة,Teacher training and education&#xA;2,ETUDIANT,Teacher training and education&#xA;3,ETUDIANT ,Teacher training and education&#xA;4,موظف,Recruitment and HR&#xA;5,موجه تربوي ,Teacher training and education&#xA;6,Réalisateur film cartoon,Creative arts and design&#xA;7,إإطار مالي,&quot;Accountancy, banking and finance&quot;&#xA;8,موضف إطار,Trade&#xA;9,مهندس بمكتب دراسات,Engineering and manufacturing&#xA;10,باحثة  _ كاتبة _ ,Recruitment and HR&#xA;11,طالب,Teacher training and education&#xA;12,Chef de projet,Creative arts and design&#xA;13,ASSUREUR,Business, consulting and management&#xA;14,FONCTIONNAIRE D'ÉTAT,Public services and administration&#xA;15,Professeur Universitaire,Teacher training and education&#xA;16,cadre supérieur,Business, consulting and management&#xA;17,fonctionnaire,Public services and administration&#xA;18,CDB Retraite,Recruitment and HR&#xA;19,professeur,Teacher training and education&#xA;20,Chef de projet,Public services and administration&#xA;21,مدير  شركة,Recruitment and HR&#xA;22,Avocat,Law&#xA;23,cadre à Maroc Telecom,Media and internet&#xA;24,Employé ,Sales&#xA;25,Consultant en Immobilier,Property and construction&#xA;26,fonctionnaire,Public services and administration&#xA;27,اجير أو عامل,Recruitment and HR&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Inputs should be tested against all categories. &lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The winner of the challenge will be the one with the most accurate results. If on the test set. If several are as accurate, the shortest amount of bytes will be the winner. You can use any methods to get the most similar item. The state of the art method seems to be according to &lt;a href=&quot;https://colab.research.google.com/github/tensorflow/hub/blob/master/examples/colab/cross_lingual_similarity_with_tf_hub_multilingual_universal_encoder.ipynb#scrollTo=Q8F4LNGFqOiq&quot; rel=&quot;nofollow noreferrer&quot;&gt;Google Multilingual Universal Sentence encoder&lt;/a&gt;. I provide an attempt with the code below but you will see it is not quite acccurate.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Example in Python&lt;/h1&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;Double agent: A spy who works for two countries, and sometimes even three, in which case he is definitely a trouble.&lt;/em&gt; - Mots et Grumots (2003), Marc Escayrol&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#@title Setup common imports and functions&#xA;import numpy as np&#xA;import os&#xA;import pandas as pd&#xA;import tensorflow.compat.v2 as tf&#xA;import tensorflow_hub as hub&#xA;from tensorflow_text import SentencepieceTokenizer&#xA;import sklearn.metrics.pairwise&#xA;&#xA;from simpleneighbors import SimpleNeighbors&#xA;from tqdm import tqdm&#xA;from tqdm import trange&#xA;&#xA;import json&#xA;&#xA;def most_similar(embeddings_1, embeddings_2, labels_1, labels_2):&#xA;&#xA;  assert (len(embeddings_1) == len(labels_1) and len(embeddings_2) == len(labels_2))&#xA;&#xA;  # arccos based text similarity (Yang et al. 2019; Cer et al. 2019)&#xA;  sim = 1 - np.arccos(sklearn.metrics.pairwise.cosine_similarity(embeddings_1, embeddings_2))/np.pi&#xA;&#xA;  embeddings_1_col, embeddings_2_col, sim_col = [], [], []&#xA;  for i in range(len(embeddings_1)):&#xA;    for j in range(len(embeddings_2)):&#xA;      embeddings_1_col.append(labels_1[i])&#xA;      embeddings_2_col.append(labels_2[j])&#xA;      sim_col.append(sim[i][j])&#xA;  df = pd.DataFrame(zip(embeddings_1_col, embeddings_2_col, sim_col),&#xA;                    columns=['embeddings_1', 'embeddings_2', 'sim'])&#xA;&#xA;  # return the higest similarity one&#xA;  category = df['embeddings_1'].iloc[df['sim'].argmax()]&#xA;  return category&#xA;&#xA;def main():&#xA;&#xA;    X = pd.read_csv('X.csv')&#xA;    y = pd.read_csv('y.csv')&#xA;    df_rni = pd.read_csv('df.csv')&#xA;&#xA;    # The 16-language multilingual module is the default but feel free&#xA;    # to pick others from the list and compare the results.&#xA;    module_url = 'https://tfhub.dev/google/universal-sentence-encoder-multilingual/3' #@param ['https://tfhub.dev/google/universal-sentence-encoder-multilingual/3', 'https://tfhub.dev/google/universal-sentence-encoder-multilingual-large/3']&#xA;&#xA;    model = hub.load(module_url)&#xA;&#xA;    def embed_text(input):&#xA;        return model(input)&#xA;&#xA;    def compute_similarity(references, target):&#xA;        # I want to create as many rows as there are references and fill them with the results&#xA;        # arccos based text similarity (Yang et al. 2019; Cer et al. 2019)&#xA;        for row in target.iterrows():&#xA;            for reference in references:&#xA;                sim = 1 - np.arccos(&#xA;                result = sklearn.metrics.pairwise.cosine_similarity(row,&#xA;                                                                    reference))/np.pi&#xA;&#xA;            # place the result in the column &quot;reference&quot;&#xA;&#xA;    # get unique job categories and job of people&#xA;    job_categories = X.S02Q11_Professional_field.unique()&#xA;    # turn them to list&#xA;    job_categories = job_categories.tolist()&#xA;    # emebedding job categories &#xA;    references_result = embed_text(job_categories[1:])&#xA;&#xA;    for _, row in df_rni.iterrows():&#xA;        actual_job = row['new_professionactuelle']&#xA;        # check for nan that can't be embedded&#xA;        if str(actual_job) != 'nan':&#xA;            # embedding actual job&#xA;            target_result = embed_text(actual_job)&#xA;            # visualize similarity&#xA;            category = most_similar(references_result, target_result, job_categories[1:], [actual_job])&#xA;        else: category = None&#xA;&#xA;if __name__ == &quot;__main__&quot;:&#xA;    main()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="51880" LastEditorUserId="51880" LastEditDate="2020-02-24T16:59:31.033" LastActivityDate="2020-02-24T16:59:31.033" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18595" PostTypeId="2" ParentId="18477" CreationDate="2020-02-24T19:12:51.433" Score="4" Body="&lt;h1&gt;So long as we wait it out, the death of the community is inevitable&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I've been less active on this site lately. Despite being the only person to explicitly state that I would be willing to run for an election (and not for the purpose of abstentionism), I've felt a lack of incentive to continue visiting this site because the absence of a strong community takes away all I ever sought here - golfing isn't my only hobby, and I enjoy golfing against my friend more now that the community I once loved is no longer as alive as before.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That said, people leaving the community for similar reasons to me only furthers this cycle, and seeing how dead TNB is, users like me (who joined and became active because of TNB) will no longer be coming in, so users are leaving without people to replace them.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;I say: give it a shot&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;StackExchange seems to be slowly more willing to move forward. There is obvious reason to doubt their goodwill (as a corporation, that's already dubitable, and compounded with their continuous actions, concern is very valid and grounded), but  I don't want to just call off trying this site. I don't know much about Axtell but last time I checked it hasn't been much of an active initiative or extremely developed. So even if SE ends up proving too difficult to co-operate with us or CGCC ends up dying, I think we need to, at the very least, wait for Axtell to be ready to bear the load of the remaining community here before trying anything.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So, in conclusion, I think we should try to continue on this site and if we do decide to try to reignite the strong community once present, I would be more than happy to join back into the community and run for moderator since I have the time and the ability to commit, I just don't have the present incentive to do so as much as I once did.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2020-02-24T19:12:51.433" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18598" PostTypeId="2" ParentId="2140" CreationDate="2020-02-25T09:23:36.170" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/205564/shift-the-letters-soldier&quot;&gt;Shift the letters, soldier !&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;posted, finally&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="41833" LastEditorUserId="41833" LastEditDate="2020-06-03T07:43:25.777" LastActivityDate="2020-06-03T07:43:25.777" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="18600" PostTypeId="1" AcceptedAnswerId="18601" CreationDate="2020-02-25T12:51:16.953" Score="2" ViewCount="108" Body="&lt;p&gt;I asked &lt;a href=&quot;https://codegolf.stackexchange.com/questions/199920/creating-words-by-structure&quot;&gt;this question&lt;/a&gt;, and it was closed because I did not clarify what I meant by the word &quot;randomly&quot;. Now I've clarified it but it is not reopened. What is wrong with it now?&lt;/p&gt;&#xA;" OwnerUserId="91144" LastEditorUserId="56656" LastEditDate="2020-02-25T13:51:17.330" LastActivityDate="2020-03-01T13:29:54.277" Title="Why hasn't this question been reopened yet?" Tags="|discussion|close-reasons|closed-questions|reopening|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18601" PostTypeId="2" ParentId="18600" CreationDate="2020-02-25T13:34:53.067" Score="8" Body="&lt;h2&gt;Reopening takes time&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An unfortunate fact is that this site is not as active as it once was.  That means accumulating the required reopen votes can take a while.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What you can do&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The things I would recommend to do about this are&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Sandbox your challenge first.  It is too late for this challenge but when a challenge is sandboxed issues can be addressed quickly without needing to attract voters.  You can fix a problem and move on to other improvements very quickly.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Do reviews.  If you are upset that reviews are not being done quickly by enough people, it is a good idea to take up the initiative yourself.  Of course this won't help your specific challenge, but I'm sure other people have been in your location and if you all start doing reviews you can help&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Ping the users that closed it.  People don't always go back and check on things they have voted to close on their own.  If you ping them and explain how you have addressed their concerns they will likely respond with other concerns or vote to reopen.  If no one voiced concerns in the comments then it is a good idea to ask them why they voted to close.  Since you are asking for help please try and provide as much relevant information as possible in the comment.  &quot;I fixed this&quot; will likely appear in their inbox with little or no context requiring some work on their part before they can vote.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Post in chat. Posting in places where people go brings the idea to their attention.  Of course the effectiveness of this depends on the activity of these places.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Post on meta.  You have already done this, but if the two above options are failing you this can be a place to ask.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2020-02-25T13:49:38.333" LastActivityDate="2020-02-25T13:49:38.333" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18604" PostTypeId="2" ParentId="18593" CreationDate="2020-02-27T00:02:49.280" Score="9" Body="&lt;p&gt;Instead of using Github, just fetch the contents of the answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To parse it, read this question: &lt;a href=&quot;https://stackoverflow.com/questions/10585029/parse-an-html-string-with-js&quot;&gt;https://stackoverflow.com/questions/10585029/parse-an-html-string-with-js&lt;/a&gt; (remember the question id: 10585029)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using the &lt;a href=&quot;https://api.stackexchange.com/docs&quot;&gt;StackExchange API&lt;/a&gt; you can get the answers in the question, with a few calls to the API entry point &lt;a href=&quot;https://api.stackexchange.com/docs/answers-on-questions&quot;&gt;/questions/{ids}/answers&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First, you will need a filter. Just add the &quot;answer&quot; &gt; &quot;body&quot; option:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/fW72k.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/fW72k.png&quot; alt=&quot;&amp;quot;answer&amp;quot; &amp;gt; &amp;quot;body&amp;quot;&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you want, you can use this slightly more optimized filter: !FcbCBt3onoXUY8kGhT_Xh.df25&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I strongly recommend using 100 for the page size.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You basically just use &lt;a href=&quot;https://api.jquery.com/jQuery.getJSON/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;$.getJSON&lt;/code&gt;&lt;/a&gt; (or similar) on the following URL (as an example):&lt;br&gt;&#xA;&lt;a href=&quot;https://api.stackexchange.com/docs/answers-on-questions#pagesize=100&amp;amp;order=desc&amp;amp;sort=activity&amp;amp;ids=10585029&amp;amp;filter=!FcbCBt3onoXUY8kGhT_Xh.df25&amp;amp;site=stackoverflow&amp;amp;run=true&quot;&gt;/2.2/questions/10585029/answers?pagesize=100&amp;amp;order=desc&amp;amp;sort=activity&amp;amp;site=stackoverflow&amp;amp;filter=!FcbCBt3onoXUY8kGhT_Xh.df25&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;If everything goes right, inside &quot;items&quot; you will have the answers, which will have the &quot;body&quot; key, which contains purely rendered HTML.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can then do something similar to this, using the mockup of the answer I've liked:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;var json = '{&quot;owner&quot;:{&quot;profile_image&quot;:&quot;https://i.stack.imgur.com/E0rsP.jpg?s=128&amp;amp;g=1&quot;,&quot;display_name&quot;:&quot;Cilan&quot;,&quot;link&quot;:&quot;https://stackoverflow.com/users/2876565/cilan&quot;},&quot;is_accepted&quot;:false,&quot;score&quot;:213,&quot;last_activity_date&quot;:1582619200,&quot;last_edit_date&quot;:1582619200,&quot;creation_date&quot;:1392780526,&quot;answer_id&quot;:21870431,&quot;question_id&quot;:10585029,&quot;link&quot;:&quot;https://stackoverflow.com/questions/10585029/parse-an-html-string-with-js/21870431#21870431&quot;,&quot;body&quot;:&quot;&amp;lt;p&amp;gt;It\'s quite simple:&amp;lt;/p&amp;gt;\\n\\n&amp;lt;pre&amp;gt;&amp;lt;code&amp;gt;var parser = new DOMParser();\\nvar htmlDoc = parser.parseFromString(txt, \'text/html\');\\n// do whatever you want with htmlDoc.getElementsByTagName(\'a\');\\n&amp;lt;/code&amp;gt;&amp;lt;/pre&amp;gt;\\n\\n&amp;lt;p&amp;gt;&amp;lt;a href=\\&quot;https://developer.mozilla.org/en-US/docs/Web/API/DOMParser#Browser_compatibility\\&quot; rel=\\&quot;nofollow noreferrer\\&quot;&amp;gt;According to MDN&amp;lt;/a&amp;gt;, to do this in chrome you need to parse as XML like so:&amp;lt;/p&amp;gt;\\n\\n&amp;lt;pre&amp;gt;&amp;lt;code&amp;gt;var parser = new DOMParser();\\nvar htmlDoc = parser.parseFromString(txt, \'text/xml\');\\n// do whatever you want with htmlDoc.getElementsByTagName(\'a\');\\n&amp;lt;/code&amp;gt;&amp;lt;/pre&amp;gt;\\n\\n&amp;lt;p&amp;gt;&amp;lt;s&amp;gt;It is currently unsupported by webkit and you\'d have to follow Florian\'s answer, and it is unknown to work in most cases on mobile browsers.&amp;lt;/s&amp;gt;&amp;lt;/p&amp;gt;\\n\\n&amp;lt;p&amp;gt;Edit: Now widely supported&amp;lt;/p&amp;gt;\\n&quot;}';&#xA;&#xA;var json_obj = JSON.parse(json);&#xA;&#xA;var parser = new DOMParser();&#xA;var doc = parser.parseFromString(json_obj.body, 'text/html');&#xA;&#xA;var pre = doc.getElementsByTagName('pre')[0];&#xA;&#xA;if(pre)&#xA;{&#xA;  document.body.appendChild(pre);&#xA;&#xA;  var text = pre.innerText || pre.textContent;&#xA;  var p = document.createElement(p);&#xA;  &#xA;  p.innerText = p.textContent = 'Text content:\n\n' + text;&#xA;  document.body.appendChild(p);&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;If you aren't afraid of jQuery, your job is a lot simplified (&lt;strong&gt;REAL EXAMPLE&lt;/strong&gt;):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;var URL = 'https://api.stackexchange.com/2.2/questions/10585029/answers?pagesize=100&amp;amp;order=desc&amp;amp;sort=activity&amp;amp;site=stackoverflow&amp;amp;filter=!FcbCBt3onoXUY8kGhT_Xh.df25';&#xA;&#xA;$.getJSON(URL, function(data){&#xA;  // example to fetch the first answer and the first &amp;lt;pre&amp;gt;&#xA;  var $pre = $(data.items[0].body).filter('pre').first();&#xA;&#xA;  if(!$pre.length)&#xA;  {&#xA;    return;&#xA;  }&#xA;&#xA;  $pre.appendTo(document.body);&#xA;  &#xA;  // .replace(/\r?\n/g, '&amp;lt;br&amp;gt;') only needed for this demonstration&#xA;  $('&amp;lt;p&amp;gt;&amp;lt;/p&amp;gt;').html(('Text content:\n\n' + $pre.text()).replace(/\r?\n/g, '&amp;lt;br&amp;gt;')).appendTo(document.body);&#xA;});&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://cdnjs.cloudflare.com/ajax/libs/jquery/3.3.1/jquery.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;What I have as &quot;text content&quot; is what you can use to just do a simple &lt;code&gt;eval()&lt;/code&gt; or a &lt;code&gt;new Function(&amp;lt;string code&amp;gt;)&lt;/code&gt; or something else.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I strongly recommend that you read the whole documentation about the API parameters and their accepted values.&lt;br&gt;&#xA;With this, you can do quite a lot!&lt;br&gt;&#xA;Pay attention to the quota limits and the &quot;has_more&quot; key.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Any questions, just ask below.&lt;/p&gt;&#xA;" OwnerUserId="14732" LastEditorUserId="14732" LastEditDate="2020-02-28T09:42:20.350" LastActivityDate="2020-02-28T09:42:20.350" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18605" PostTypeId="2" ParentId="18593" CreationDate="2020-02-27T01:42:03.857" Score="7" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This creates link-only answers, which are not permitted per general Stack Exchange policy. &lt;/p&gt;&#xA;" OwnerUserId="46076" LastActivityDate="2020-02-27T01:42:03.857" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18609" PostTypeId="2" ParentId="2140" CreationDate="2020-02-28T06:50:41.243" Score="1" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/200554/alternating-triangles&quot;&gt;Approximate Alternating Triangles&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-03-06T01:03:01.723" LastActivityDate="2020-03-06T01:03:01.723" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18610" PostTypeId="1" CreationDate="2020-02-28T22:39:57.213" Score="12" ViewCount="439" Body="&lt;p&gt;Sometimes we get &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions from a first-time contributor asking for help golfing a particular piece of code that they wrote. Often these question don't fare so well. Can we do anything here?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;There's many ways for these questions to go wrong. A benign one is for answerers to treat it as a standard code golf challenge. Except, it's limited to a single language and often unclear on what the task is exactly, so it would be closed as a normal challenge. The answers are often just &quot;X bytes&quot; and some golfed code without explanation, which isn't really giving tips for the asker.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Another failure mode is the that asker says answers won't work for them because of some unmentioned rule like that the code has to fit in one line or run within two seconds. We have pretty liberal rules about I/O and things that can lead to improvements that the asker can't use. Conversely, they might have allowances we don't know about like free imports.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Finally, a number of these questions seem to just be attempts to cheat at an ongoing outside competition, which leaves a bad taste in my mouth.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think questions like this are important to handle well. We have users coming in with an existing interest in golfing and drive to improve, and they might stay as long-time productive contributors. How can we make these types of questions work out better?&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2020-08-19T04:51:54.357" Title="On &quot;golf this for me&quot; tips questions" Tags="|discussion|challenges|new-users|tips|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18612" PostTypeId="2" ParentId="2140" CreationDate="2020-02-29T02:41:00.927" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/200767/japanese-encoding-conversion&quot;&gt;Japanese Encoding Conversion&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/encoding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;encoding&amp;#39;&quot; rel=&quot;tag&quot;&gt;encoding&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="71546" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-03-09T01:46:22.213" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18613" PostTypeId="2" ParentId="18610" CreationDate="2020-02-29T20:59:53.100" Score="12" Body="&lt;h1&gt;Enforce standards for these questions&lt;/h1&gt;&#xA;&lt;p&gt;I think a lot of the problem is that golf-this-for-me tips questions aren't held to the site's usual standards of clarity, completeness, and objectiveness. I know these can be hard for new askers to get a handle on, but we already require the same for challenges they'd post. Sandboxing should be strongly encouraged here too.&lt;/p&gt;&#xA;&lt;p&gt;Basically, I'm saying these questions should be closed if our close reasons apply.&lt;/p&gt;&#xA;&lt;p&gt;I propose these requirements for clarity:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The task being solved must be specified to the level we expect of challenges. A reference implementation is not sufficient.&lt;/li&gt;&#xA;&lt;li&gt;Any additional requirements should be noted, such as language, version, and run-time.&lt;/li&gt;&#xA;&lt;li&gt;Any deviations from site standards in scoring or I/O format should be noted.&lt;/li&gt;&#xA;&lt;li&gt;All relevant information must be in the question body, not behind a link or in comments.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Additionally, these questions need to meet the standards of focus, research effort, and attribution that are expected of Q&amp;amp;A on the network, in particular for &amp;quot;help me with this code&amp;quot; questions seen on SO.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Simply dumping code and saying &amp;quot;How can this be shorter?&amp;quot; is not acceptable. The poster needs to state things they've tried or point out specific parts they think could be improved.&lt;/li&gt;&#xA;&lt;li&gt;The source of the challenge should be credited, with a link if possible. If applicable, the asker should explain why it's OK for them to post the challenge and ask for help with it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="78410" LastEditDate="2020-08-19T04:51:54.357" LastActivityDate="2020-08-19T04:51:54.357" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18614" PostTypeId="1" AcceptedAnswerId="18615" CreationDate="2020-03-01T02:46:00.003" Score="3" ViewCount="173" Body="&lt;p&gt;Every time I try to post an answer to a challenge here, I get this annoying &quot;Are you a robot?&quot; prompt. I've solved it countless times but it still stops me every time I try to post an answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;How do I make it stop?&lt;/p&gt;&#xA;" OwnerUserId="89298" LastEditorUserId="66833" LastEditDate="2021-04-09T16:10:22.893" LastActivityDate="2021-04-09T16:10:22.893" Title="Since when am I a robot?" Tags="|support|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18615" PostTypeId="2" ParentId="18614" CreationDate="2020-03-01T06:04:51.883" Score="5" Body="&lt;h2&gt;&quot;Explain&quot; your program&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;That's usually the workaround I do to avoid the CAPTCHA. Because if you explain your program, the spam checker will think that you're a human being and therefore stop the CAPTCHA.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Do you think that typing all that explanation is a nuisance? Hint: Adding just another &quot;Explanation&quot; section without containing an explanation of your program also helps! (Note that you should be editing in the section after you pasted your submission, otherwise it won't work.)&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-03-03T01:50:03.790" LastActivityDate="2020-03-03T01:50:03.790" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18616" PostTypeId="5" CreationDate="2020-03-01T10:04:08.167" Score="0" Body="" OwnerUserId="-1" LastEditorUserId="-1" LastEditDate="2020-03-01T10:04:08.167" LastActivityDate="2020-03-01T10:04:08.167" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18617" PostTypeId="4" CreationDate="2020-03-01T10:04:08.167" Score="0" Body="This tag should be used when asking about the captcha system put in place by SE to prevent spammers from ruthlessly defacing posts. " OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2020-03-03T13:54:10.107" LastActivityDate="2020-03-03T13:54:10.107" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18620" PostTypeId="2" ParentId="18614" CreationDate="2020-03-02T13:41:46.737" Score="3" Body="&lt;p&gt;One possible explanation is the speed at which you post. I usually get this prompt if I code out my answer on TIO (which is pretty typical), and then copy the SE-formatted text into the answer box and immediately hit submit. Since your answers are conventionally TIO-formatted, I assume you do the same.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What I typically do is just add a bit -- just a line or two is usually enough -- to explain approximately my approach. I think the prompt appears just because it assumes you're a robot if you open the answer box and then submit a full-length answer within like 1 second.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I haven't tested this, but you might be able to click on the answer box to open it, and then go code in TIO, and then when you finish, come back and paste your solution and submit it. This might get the prompt to not appear because you'll be spending more than half a second between opening the answer field and submitting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit&lt;/strong&gt; I discarded my draft and then opened the answer box and pasted this answer in and immediately submitted. It gave me the prompt. I discarded the draft and then opened the answer box and watched a YouTube video before pasting this answer in and immediately submitting, and it didn't give me the prompt, so the method in my third paragraph &lt;em&gt;should&lt;/em&gt; work.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2020-03-02T13:41:46.737" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18621" PostTypeId="1" CreationDate="2020-03-02T14:21:12.653" Score="9" ViewCount="341" Body="&lt;p&gt;We've probably all seen new users ask questions with cumbersome I/O rules, like mandatory taking the input by reading separated lines of STDIN and outputting to STDOUT to give an example.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In those cases, we usually point them to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods?answertab=votes#tab-top&quot;&gt;the default I/O rules&lt;/a&gt; in the hope they'll change their challenge description, and also point to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt; so they can get feedback on challenges before posting it on main next time.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, what is the policy regarding answering those kind of challenges? If the challenge itself is completely clear, despite the cumbersome I/O rules, we should just downvote it. We don't have any reason to close-vote it as unclear if it really isn't, so that's not an option. But is there any reason to also keep it completely unanswered until they've changed their I/O rules?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The main reason I ask is because of &lt;a href=&quot;https://codegolf.stackexchange.com/q/200359/52210&quot;&gt;this challenge that was posted yesterday&lt;/a&gt;. As you can see, it uses a similar input-format as programming contest websites usually use, which I will quote here:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h3&gt;Input Format&lt;/h3&gt;&#xA;  &#xA;  &lt;ul&gt;&#xA;  &lt;li&gt;First Line: &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;(number of strings in the list)  &lt;/li&gt;&#xA;  &lt;li&gt;Next &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; lines: String &lt;span class=&quot;math-container&quot;&gt;\$S_i\$&lt;/span&gt;  &lt;/li&gt;&#xA;  &lt;li&gt;Next line &lt;span class=&quot;math-container&quot;&gt;\$Q\$&lt;/span&gt;(number of questions)  &lt;/li&gt;&#xA;  &lt;li&gt;Next &lt;span class=&quot;math-container&quot;&gt;\$Q\$&lt;/span&gt; lines : Three space-separated integers &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$R\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$K\$&lt;/span&gt;&#xA;  &lt;code&gt;&lt;pre&gt;Sample Input&#xA;5&#xA;aaaaa&#xA;bbbbb&#xA;ccccc&#xA;ddddd&#xA;eeeee&#xA;3&#xA;3 3 3 &#xA;1 5 16&#xA;3 5 15&lt;/pre&gt;&lt;/code&gt;&lt;/li&gt;&#xA;  &lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Very cumbersome, and even with mandatory 1-based indexing. Still, the challenge itself is clear.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I posted &lt;a href=&quot;https://codegolf.stackexchange.com/a/200437/52210&quot;&gt;an answer for this challenge&lt;/a&gt;, which just got downvoted. Hence the reason for this meta question. I understand downvoting the challenge has a good reason, but what reason is there for downvoting the answers? If this score remains, I will just delete my answer no problem, but I'm mainly trying to understand the reason behind the downvote on my answer and how to prevent it in the future. And what people's opinion are regarding answering questions with cumbersome I/O rules.&lt;/p&gt;&#xA;" OwnerUserId="52210" LastActivityDate="2022-01-22T21:50:06.600" Title="Policy on answering challenges with cumbersome I/O" Tags="|discussion|policy|challenges|" AnswerCount="4" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18622" PostTypeId="2" ParentId="18621" CreationDate="2020-03-02T14:42:20.300" Score="5" Body="&lt;p&gt;Sorry, it was an accident. I had a little fiasco with my computer this morning and I must've pressed the down arrow inadvertently. Stupid touchscreen...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you make an edit I'll give you an upvote.&lt;/p&gt;&#xA;" OwnerUserId="89298" LastActivityDate="2020-03-02T14:42:20.300" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18623" PostTypeId="2" ParentId="18621" CreationDate="2020-03-02T15:53:41.550" Score="-6" Body="&lt;h1&gt;Defaults can be overridden&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;...that's why they're called defaults.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;If the challenge itself is completely clear, despite the cumbersome I/O rules, we should just downvote it.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;No, I think &lt;strong&gt;we shouldn't downvote good challenges just because they override some of the defaults&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the particular case of &lt;a href=&quot;https://codegolf.stackexchange.com/q/200359/52210&quot;&gt;the linked&#xA;challenge&lt;/a&gt;, I think the I/O&#xA;restrictions actually make it more interesting. With flexible I/O, it would be&#xA;mostly trivial, but the weird input format opens up some golfing opportunies (as demonstrated by your answer being &lt;s&gt;20&lt;/s&gt; 17).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course, there are good reasons for the defaults, and I hope most questions&#xA;will still follow them, but having one question overriding them every once in a&#xA;while is perfectly acceptable.&lt;/p&gt;&#xA;" OwnerUserId="6484" LastActivityDate="2020-03-02T15:53:41.550" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18624" PostTypeId="2" ParentId="2140" CreationDate="2020-03-02T20:24:39.947" Score="7" Body="&lt;h2&gt;Make Spanish from Latin&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;Note: In the final challenge &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; will be a concrete number (I am thinking about 100), but while this is in the sandbox it is subject to change so I have left it as &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;.  Currently &lt;span class=&quot;math-container&quot;&gt;\$N=133\$&lt;/span&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This challenge is based off of a list of &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; &lt;a href=&quot;https://en.wikipedia.org/wiki/Spanish_language&quot; rel=&quot;nofollow noreferrer&quot;&gt;Castilian Spanish&lt;/a&gt; words and the words they originate from.&lt;/p&gt;&#xA;&lt;p&gt;You are to write a program or function which takes the origin word as input and outputs as close as possible the Castilian derivative.  Your program should be no longer than &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; bytes.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;To calculate your score run your program on every origin word and calculate the distance between your output and the correct answer.  Your score is the sum of all these distances.&lt;/p&gt;&#xA;&lt;p&gt;The distance here is a modified version of &lt;a href=&quot;https://en.wikipedia.org/wiki/Levenshtein_distance&quot; rel=&quot;nofollow noreferrer&quot;&gt;Levenshtein&lt;/a&gt; distance.  It is the same as Levenshtein distance except replacement steps that add or remove a diacritic cost only 1 of a step as opposed to their normal 2.  This is because if you guessed &lt;code&gt;á&lt;/code&gt; instead of &lt;code&gt;a&lt;/code&gt; that's not as bad as if you guessed &lt;code&gt;f&lt;/code&gt; instead of &lt;code&gt;a&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You can use &lt;a href=&quot;https://tio.run/##rZGxTsMwEIb3PMUpqpQE3AHGiHSBhQGExFhV6BKdGgvHiWxHCImX6YQYGCo2xNYHC7ZbLFNWFtvf/fb957sW9SMJMU3zOdz2MA4DqQY1JU2L6g650lCWsMwvLTJwa7GKtCoBWEKeYcYg222ywjKzTJ7fAnPP74F7zx@BR8@fR/wVWHreBm48v3peJYm44tqgbMgVe28Ul2uYL6LTtTTRpeUKDFRwfiJIrk0LsaadGmk60nIsdVZAXpfGO78AQlVBbe9HCTIwmRdJUGffMKgLCC1zyo9UM8BIsmnO4BQ6Lnk3dravf5yN/fYvp30p7Nje9sQV0JuW1BPX5D70X5knRXoUJsw@xd22TxmkKPv0MJ90wAFdzO67TYgKalpyYSHIpPvZdchl1eFw8wCDnZaBGYyyGZV6jqwvZgs42E7f&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Haskell – Try It Online&quot;&gt;this code&lt;/a&gt; to calculate the distance between two strings.&lt;/p&gt;&#xA;&lt;p&gt;The goal is to have as low a score as possible.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;About the list&lt;/h2&gt;&#xA;&lt;p&gt;All of the origin words, spare 2, are Latin words (Late or Classical depending on the word).  The two exception is &lt;code&gt;ezkerra&lt;/code&gt; (the origin for &lt;code&gt;izquierda&lt;/code&gt;) which is of Basque origin and &lt;code&gt;brixta&lt;/code&gt; (the origin for &lt;code&gt;bruxa&lt;/code&gt;) which is of Proto-celtic origin.  It has been added as an extra curve-ball in case you can get all the others with a little space to spare.&lt;/p&gt;&#xA;&lt;p&gt;Verbs are always in the infinitive form and nouns in the nominative singular.&lt;/p&gt;&#xA;&lt;p&gt;The words are not chosen randomly but rather I have focused on choosing words that follow a number of simple rules.  The list is also organized so that words that undergo similar transformations are grouped together.  This is for your ease of use, nothing more.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;The list&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;imperatrix, emperatriz&#xA;cicatrix, cicatriz&#xA;actrix, actriz&#xA;matrix, matriz&#xA;carex, carrizo&#xA;radix, raíz&#xA;falx, hoz&#xA;fovea, hoyo&#xA;formica, hormiga&#xA;fodiare, hozar&#xA;folia, hoja&#xA;filum, hilo&#xA;filius, hijo&#xA;filia, hija&#xA;ficum, higo&#xA;filare, hilar&#xA;ficcare, hincar&#xA;afflare, hallar&#xA;fundus, hondo&#xA;profundus, profundo&#xA;fungus, hongo&#xA;fabulare, hablar&#xA;furnus, horno&#xA;bufus, búho&#xA;ferrum, hierro&#xA;fetere, heder&#xA;fagea, haya&#xA;faba, haba&#xA;facienda, hacienda&#xA;facere, hacer&#xA;fastidium, hastío&#xA;fastidiare, hastiar&#xA;factor, hechor&#xA;factum, hecho&#xA;tectum, techo&#xA;octo, ocho&#xA;octavus, ochavo&#xA;noctu, noche&#xA;lacte, leche&#xA;iactare, echar&#xA;coctus, cocho&#xA;dictatum, dechado&#xA;phalanga, palanca&#xA;capere, caber&#xA;sapere, saber&#xA;lupus, lobo&#xA;lacrima, lágrima&#xA;lacuna, laguna&#xA;eruca, oruga&#xA;pater, padre&#xA;mater, madre&#xA;liber, libro&#xA;thema, tema&#xA;theatrum, teatro&#xA;thesaurus, tesoro&#xA;thesis, tesis&#xA;thorax, tórax&#xA;aether, éter&#xA;anthropologia, antropología&#xA;orthographia, ortografía&#xA;sapphirus, zafiro&#xA;philosophia, filosofía&#xA;echo, eco&#xA;chalare, callar&#xA;chamaeleon, camaleón&#xA;chaos, caos&#xA;materia, materia&#xA;resistentia, resistencia&#xA;aurum, oro&#xA;taurus, toro&#xA;autumnus, otoño&#xA;canna, caña&#xA;annus, año&#xA;ungla, uña&#xA;plangere, plañir&#xA;stringere, estreñir&#xA;signa, seña&#xA;scribere, escribir&#xA;stare, estar&#xA;stabulare, estabular&#xA;stipare, estibar&#xA;stria, estría&#xA;strix, estrige&#xA;studiare, estudiar&#xA;stimulare, estimular&#xA;stillare, estilar&#xA;sternutare, estornudar&#xA;statuere, estatuir&#xA;spirare, espirar&#xA;sputare, esputar&#xA;spina, espina&#xA;speclum, espejo&#xA;spectrum, espectro&#xA;squama, escama&#xA;squamosus, escamoso&#xA;squalidus, escuálido&#xA;scalare, escalar&#xA;scandere, escandir&#xA;scutum, escudo&#xA;scutella, escudilla&#xA;scriptor, escritor&#xA;sobrina, sobrina&#xA;sobrinus, sobrino&#xA;secta, secta&#xA;sector, sector&#xA;sibilare, silbar&#xA;subire, subir&#xA;subito, súbito&#xA;suspirum, suspiro&#xA;subiugare, subyugar&#xA;corvus, cuervo&#xA;fossa, huesa&#xA;socrus, suegro&#xA;lupus, lobo&#xA;acutus, agudo&#xA;tecula, teja&#xA;apicula, abeja&#xA;flamma, llama&#xA;flammare, llamear&#xA;planus, llano&#xA;plagare, llagar&#xA;plorare, llorar&#xA;plovere, llover&#xA;plicare, llegar&#xA;clavis, llave&#xA;clamare, llamar&#xA;gladius, gladio&#xA;gleba, gleba&#xA;globus, globo&#xA;blandus, blando&#xA;blancus, blanco&#xA;brixta, bruxa&#xA;ezkerra, izquierda&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-06-08T12:32:22.457" LastActivityDate="2022-06-08T12:32:22.457" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="18628" PostTypeId="2" ParentId="2447" CreationDate="2020-03-03T15:06:28.037" Score="3" Body="&lt;h1&gt;Languages that output on program completion can assume termination even when built to hang for the purpose of providing output.&lt;/h1&gt;&#xA;&lt;p&gt;That is, if a program is built to not a terminate, and requires output while running (say, for an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/198288/internal-truth-machine&quot;&gt;Internal Truth Machine&lt;/a&gt;, or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/200306/scream-very-loudly&quot;&gt;Scream Very Loudly&lt;/a&gt;, etc.), the program can assume to crash or be manually stopped to verify the output scales appropriately.&lt;/p&gt;&#xA;&lt;p&gt;The argument for this is that several languages (such as Processing[Java], for example) will not print output unless a certain state is reached (the end of a Draw statement in Processing, per se). This means that programs stuck in While Loops would never provide any output. Languages like GolfScript, though it has a Print function, also doesn't &lt;em&gt;actually&lt;/em&gt; Print the output until the program is complete - it holds the print in a buffer until the program eventually stops (for any reason, &lt;a href=&quot;https://tio.run/##S8/PSStOLsosKPn/37Cg2rA2Jd/6/38A&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;GolfScript – Try It Online&quot;&gt;even interrupting&lt;/a&gt;). Likewise, GS prints the stack when it closes for any reason (depending on your interpreter; TIO fails at this) - so filling the stack with infinite As then waiting for a crash would &lt;em&gt;also&lt;/em&gt; be within this parameter.&lt;/p&gt;&#xA;&lt;p&gt;Several languages would otherwise fail infinitely-printing hanging challenges due to the act they wouldn't ever be capable of printing given the assumed infinite time and memory, which is the main argument for allowing this sort of output.&lt;/p&gt;&#xA;" OwnerUserId="91819" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-03-03T15:06:28.037" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18632" PostTypeId="1" CreationDate="2020-03-04T12:30:50.437" Score="0" ViewCount="249" Body="&lt;p&gt;Following &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18593/is-it-acceptable-to-ask-for-github-pull-requests-for-a-king-of-the-hill-challeng&quot;&gt;this question&lt;/a&gt;, I need a sandbox to try out the StackOverflow API for grabbing code from answers.&lt;/p&gt;&#xA;&lt;p&gt;Please do not post answers to this question.&lt;/p&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;script src=&quot;https://ajfaraday.github.io/Thud/dist/data/tables.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&amp;lt;script src=&quot;https://cdnjs.cloudflare.com/ajax/libs/jquery/3.3.1/jquery.min.js&quot;&amp;gt;&amp;lt;/script&amp;gt;&amp;lt;h2&amp;gt;Dwarf&amp;lt;/h2&amp;gt;&amp;lt;table&amp;gt; &amp;lt;thead&amp;gt; &amp;lt;tr&amp;gt; &amp;lt;th&amp;gt;Client&amp;lt;/th&amp;gt; &amp;lt;th&amp;gt;Wins&amp;lt;/th&amp;gt;&amp;lt;th&amp;gt;Loses&amp;lt;/th&amp;gt; &amp;lt;th&amp;gt;Score&amp;lt;/th&amp;gt; &amp;lt;/tr&amp;gt;&amp;lt;/thead&amp;gt; &amp;lt;tbody id=&quot;clients&quot;&amp;gt; &amp;lt;/tbody&amp;gt;&amp;lt;/table&amp;gt;&amp;lt;script type='text/javascript'&amp;gt;  &#xA;league_table.dwarf.forEach( function(data_row){var row=$('&amp;lt;tr&amp;gt;'); var cell=$('&amp;lt;td&amp;gt;'); cell.html(data_row.name.substring(6)); row.append(cell); cell=$('&amp;lt;td&amp;gt;'); cell.html(data_row.win); row.append(cell); cell=$('&amp;lt;td&amp;gt;'); cell.html(data_row.lose); row.append(cell);row.append(cell);cell=$('&amp;lt;td&amp;gt;'); cell.html(data_row.score); row.append(cell); $('tbody#clients').append(row);});&amp;lt;/script&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="16824" LastEditorUserId="16824" LastEditDate="2021-07-05T01:10:04.957" LastActivityDate="2021-07-05T01:10:04.957" Title="Stack Exchange API Sandbox" Tags="|support|" AnswerCount="4" CommentCount="12" ClosedDate="2021-07-21T09:19:45.153" ContentLicense="CC BY-SA 4.0" />
  <row Id="18633" PostTypeId="2" ParentId="18632" CreationDate="2020-03-04T12:31:15.750" Score="2" Body="&lt;h1&gt;Imported&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;class {&#xA;  constructor(controller, utils) {&#xA;    this.controller = controller;&#xA;    this.side = controller.side;&#xA;    this.utils = utils;&#xA;  }&#xA;&#xA;  turn() {&#xA;    var target = this.controller.previous_move().to;&#xA;    var troll = this.controller.space_info(target.x, target.y).nearest_troll.pieces[0];&#xA;    this.controller.select_space(troll.x, troll.y);&#xA;    var space_info = this.controller.check_space(troll.x, troll.y);&#xA;    var closest_move = this.utils.closest_to(space_info.moves, target);&#xA;    this.controller.move(closest_move.x, closest_move.y);&#xA;  }&#xA;&#xA;  end_turn() {&#xA;    var scores = this.controller.scores();&#xA;    this.controller.declare(scores.winning == 't');&#xA;  }&#xA;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="16824" LastEditorUserId="16824" LastEditDate="2021-06-29T05:35:19.960" LastActivityDate="2021-06-29T05:35:19.960" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18634" PostTypeId="1" AcceptedAnswerId="18635" CreationDate="2020-03-04T16:13:56.120" Score="2" ViewCount="99" Body="&lt;p&gt;I ran &lt;a href=&quot;https://codegolf.stackexchange.com/questions/173209/robot-roulette-high-stakes-robot-gambling&quot;&gt;this challenge&lt;/a&gt; a year and a half ago. It was a good time, and I want to run it again, with some additional statistical analysis on my end and some tweaks to the rules to clean up the format a little bit. Is it acceptable to re-post an old challenge?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It would qualify as a duplicate without a doubt, but in the context of a coding challenge that doesn't seem like it should necessarily be an issue on this site in particular.&lt;/p&gt;&#xA;" OwnerUserId="83224" LastActivityDate="2020-03-04T18:07:19.990" Title="Is it acceptable to rerun an old coding challenge as a new thread?" Tags="|discussion|duplicates|code-challenge|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18635" PostTypeId="2" ParentId="18634" CreationDate="2020-03-04T18:07:19.990" Score="6" Body="&lt;h1&gt;It Depends&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In general, we handle reposting of challenges &lt;a href=&quot;https://codegolf.meta.stackexchange.com/search?q=repost&quot;&gt;on a case by case basis&lt;/a&gt;. For this particular instance, I would argue that this KOTH challenge is OK to re-run, provided that someone can't just take the existing winner and re-submit it as a serious contender. In other words, there needs to be enough tweaking to the ruleset to make it a &quot;new-enough&quot; challenge, inspiring new strategies and new winners.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That's my general belief regarding KOTH challenges, too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I would strongly recommend taking the challenge idea to the Sandbox for at least a week, so it can be ironed out and verified that it's not going to be a duplicate. You might also want to take some of the top competitors of the previous challenge and run a few scenarios to see if they'll again be top competitors.&lt;/p&gt;&#xA;" OwnerUserId="42963" LastActivityDate="2020-03-04T18:07:19.990" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18637" PostTypeId="1" CreationDate="2020-03-05T11:08:46.367" Score="13" ViewCount="700" Body="&lt;p&gt;2020 has come! But… oops, where did the time go? It’s already March! Belated as it is, it’s time for a refresh of &lt;strong&gt;Community Promotion Ads&lt;/strong&gt;!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;What are Community Promotion Ads?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Community Promotion Ads are community-vetted advertisements that will show up on the main site, in the right sidebar. The purpose of this question is the vetting process. Images of the advertisements are provided, and community voting will enable the advertisements to be shown.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Why do we have Community Promotion Ads?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This is a method for the community to control what gets promoted to visitors on the site. For example, you might promote the following things:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;code puzzle blogs and websites&lt;/li&gt;&#xA;&lt;li&gt;interesting challenge sites&lt;/li&gt;&#xA;&lt;li&gt;cool events or conferences&lt;/li&gt;&#xA;&lt;li&gt;anything else your community would genuinely be interested in&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The goal is for future visitors to find out about &lt;em&gt;the stuff your community deems important&lt;/em&gt;. This also serves as a way to promote information and resources that are &lt;em&gt;relevant to your own community's interests&lt;/em&gt;, both for those already in the community and those yet to join. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Why do we reset the ads every year?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Some services will maintain usefulness over the years, while other things will wane to allow for new faces to show up. Resetting the ads every year helps accommodate this, and allows old ads that have served their purpose to be cycled out for fresher ads for newer things. This helps keep the material in the ads relevant to not just the subject matter of the community, but to the current status of the community. We reset the ads once a year, every December.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The community promotion ads have no restrictions against reposting an ad from a previous cycle. If a particular service or ad is very valuable to the community and will continue to be so, it is a good idea to repost it. It may be helpful to give it a new face in the process, so as to prevent the imagery of the ad from getting stale after a year of exposure.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;How does it work?&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The answers you post to this question &lt;em&gt;must&lt;/em&gt; conform to the following rules, or they will be ignored. &lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;All answers should be in the exact form of:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[![Tagline to show on mouseover][1]][2]&#xA;&#xA;   [1]: http://image-url&#xA;   [2]: http://clickthrough-url &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Please &lt;strong&gt;do not add anything else to the body of the post&lt;/strong&gt;. If you want to discuss something, do it in the comments.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The question must always be tagged with the magic &lt;a href=&quot;/questions/tagged/community-ads&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;community-ads&amp;#39;&quot; rel=&quot;tag&quot;&gt;community-ads&lt;/a&gt; tag. In addition to enabling the functionality of the advertisements, this tag also pre-fills the answer form with the above required form.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h3&gt;Image requirements&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The image that you create must be 300 x 250 pixels, or double that if high DPI.&lt;/li&gt;&#xA;&lt;li&gt;Must be hosted through our standard image uploader (imgur)&lt;/li&gt;&#xA;&lt;li&gt;Must be GIF or PNG&lt;/li&gt;&#xA;&lt;li&gt;No animated GIFs&lt;/li&gt;&#xA;&lt;li&gt;Absolute limit on file size of 150 KB&lt;/li&gt;&#xA;&lt;li&gt;If the background of the image is white or partially white, there must be a 1px border (2px if high DPI) surrounding it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Score Threshold&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;There is a &lt;strong&gt;minimum score threshold&lt;/strong&gt; an answer must meet (currently &lt;strong&gt;6&lt;/strong&gt;) before it will be shown on the main site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can check out the ads that have met the threshold with basic click stats &lt;a href=&quot;https://codegolf.meta.stackexchange.com/ads/display/18637&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="38734" LastActivityDate="2021-04-08T12:57:45.310" Title="Community Promotion Ads — 2020" Tags="|discussion|community-ads|" AnswerCount="13" CommentCount="1" ClosedDate="2021-06-17T09:50:28.493" ContentLicense="CC BY-SA 4.0" />
  <row Id="18638" PostTypeId="2" ParentId="18637" CreationDate="2020-03-05T11:16:52.083" Score="9" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5243/43319&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/iU1bc.png&quot; alt=&quot;Deadline-less (hence not searchable) bounties offered by users on various challenges&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2020-03-05T11:16:52.083" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18639" PostTypeId="2" ParentId="18637" CreationDate="2020-03-05T11:18:08.247" Score="24" Body="&lt;p&gt;&lt;a href=&quot;https://tio.run/#home&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/J99n9.png&quot; alt=&quot;Over 600 online interpreters. Free of charge, open source, and ad-free.&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2020-03-05T11:18:08.247" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18640" PostTypeId="2" ParentId="18637" CreationDate="2020-03-05T11:20:09.440" Score="18" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/40695&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/n3xsb.png&quot; alt=&quot;Have a challenge idea? Iron out its bugs. Join us in the Sandbox!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2020-03-05T11:20:09.440" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18641" PostTypeId="2" ParentId="18637" CreationDate="2020-03-05T11:21:59.720" Score="16" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10132/32352&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Vdi3R.png&quot; alt=&quot;Know how to vote!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2020-03-05T11:21:59.720" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18642" PostTypeId="2" ParentId="18637" CreationDate="2020-03-05T11:24:18.617" Score="7" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions?sort=featured&quot;&gt;&lt;img src=&quot;https://stack-exchange-dynamic-ads.herokuapp.com/codegolf.stackexchange.com/bounty.png&quot; alt=&quot;Bounties for everybody&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2020-03-05T11:24:18.617" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18643" PostTypeId="2" ParentId="18637" CreationDate="2020-03-05T11:25:29.817" Score="14" Body="&lt;p&gt;&lt;a href=&quot;https://github.com/abrudz/lb/blob/master/README.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/PT2I9.png&quot; alt=&quot;Bookmarklet — no install needed!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2020-03-05T11:25:29.817" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18644" PostTypeId="2" ParentId="18637" CreationDate="2020-03-05T11:35:39.390" Score="7" Body="&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/52405/the-apl-orchard&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/VAV4a.png&quot; alt=&quot;J and K are on topic too!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2020-03-05T11:35:39.390" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18645" PostTypeId="2" ParentId="18637" CreationDate="2020-03-05T11:49:01.533" Score="8" Body="&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/57815/jelly-hypertraining&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/zIFyO.png&quot; alt=&quot;Want to improve your Jelly skills? – Join Jelly HyperTraining!&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2020-03-05T11:49:01.533" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18646" PostTypeId="2" ParentId="2140" CreationDate="2020-03-06T01:11:49.770" Score="3" Body="&lt;h2&gt;Square Deltas &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an &lt;em&gt;strictly&lt;/em&gt; positive integer &lt;code&gt;n&lt;/code&gt;, output all numbers in the sequence up to the index &lt;code&gt;n&lt;/code&gt;. For the current test cases of the current challenge numbers are one-indexed. However, other formats are allowed as default.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Base sequence&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We start from this sequence:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1, 2, 1, 1, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The sequence is described as follows: &lt;code&gt;1, 2 (xN), 1&lt;/code&gt; repeated arbitary times. There are 2 more &lt;code&gt;2&lt;/code&gt;'s than the previous 2-set, and the 2-sequence starts at 1. i.e.:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1,       2,       1,&#xA;1,    2, 2, 2,    1,&#xA;1, 2, 2, 2, 2, 2, 1,&#xA;and so on ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;However, our point is not to output this sequence. For every item in this sequence, add the item by that item of that sequence.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Adding the sequence&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here's an example of adding the sequence. Here, our sequence starts with 0:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  The sequence&#xA;    |&#xA;    v&#xA;0 + 1 = 1&#xA;1 + 2 = 3&#xA;3 + 1 = 4&#xA;4 + 1 = 5&#xA;...&#xA;&#xA;Our generated sequence is therefore&#xA;&#xA;0, 1, 3, 4, ...&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Example test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##TVBBboMwELz7FXu0SZoUeqmQ6Csq9YA4uPIirFprYgyhr6drnKD64p2Z9eysx984eHrbNoM99O9ywpuqBfCZEAkavqJUOxEwzoGgXaH3AVawxOINbM81@Zgxv9FkdpzARRsjV9UJkfxx8W5B6Z05E94fcx62TLQOKYmq5v4p6hC/bBw4Ay7aSUvjzFGU8HNkru2EbUpxH6xD@AwzZrcknli1Z2mLonop1fVa/a9PZfdsvEw@PJfLpvwBXGSG99rzMIaPBqriSJQnpTMGSzG1tPWhduqQvwPqn2yWQlXbVr7@AQ&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt; is a sample program outputting the sequence up to the input.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3 -&amp;gt; [0, 1, 3]&#xA;10 -&amp;gt; [0, 1, 3, 4, 5, 7, 9, 11, 12, 13]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Can the challenge be clarified?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-03-12T05:54:23.497" LastActivityDate="2020-03-12T05:54:23.497" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18647" PostTypeId="2" ParentId="2140" CreationDate="2020-03-06T15:57:05.677" Score="0" Body="&lt;h1&gt;Compute the Pareto frontier&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a set of triplets, output its &lt;a href=&quot;https://en.wikipedia.org/wiki/Pareto_efficiency#Pareto_frontier&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pareto frontier&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Definitions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A triplet is a list of 3 positive integers, for example &lt;code&gt;[120, 15, 21]&lt;/code&gt; (order matters).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A triplet &lt;code&gt;[A, B, C]&lt;/code&gt; is objectively worse than &lt;code&gt;[a, b, c]&lt;/code&gt; when &lt;code&gt;A &amp;gt;= a&lt;/code&gt;, &lt;code&gt;B &amp;gt;= b&lt;/code&gt;, and &lt;code&gt;C &amp;gt;= c&lt;/code&gt; (lower is better).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A triplet is on the Pareto frontier when it's not objectively worse than any other triplet in the input.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;I/O rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Input and output are both a set of triplets. Each triplet must be represented&#xA;as either a list of integers (&lt;code&gt;[1, 2, 3]&lt;/code&gt;) or a &lt;code&gt;/&lt;/code&gt;-delimited string (&lt;code&gt;&quot;1/2/3&quot;&lt;/code&gt;).&#xA;The format of the outer sets is flexible (built-in set type, list, or delimited&#xA;string are all okay).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[1, 1, 1], [2, 2, 2]] =&amp;gt; [[1, 1, 1]]&#xA;[[3, 3, 1], [3, 1, 3], [1, 3, 3], [2, 2, 2]] =&amp;gt; [[3, 3, 1], [3, 1, 3], [1, 3, 3], [2, 2, 2]]&#xA;... (more to come) ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="6484" LastActivityDate="2020-03-06T15:57:05.677" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18648" PostTypeId="2" ParentId="2140" CreationDate="2020-03-06T18:30:13.460" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Draw an American flag for any amount of states&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The flag of the United States of America goes by many names. &lt;strong&gt;The Stars and Stripes&lt;/strong&gt;. &lt;strong&gt;Old Glory&lt;/strong&gt;. &lt;strong&gt;The Last Known Non-Erotic Usage Of The Verb 'To Spangle'&lt;/strong&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is also one of the few flags semi-regularly updated. The red and white stripes represent the 13 original states, but one more star has been added to the blue canton for every state that joined the union later. This last happened in 1960, when Hawaii got in. Flag designs with 51 stars are already waiting for when Puerto Rico or Washington D.C. are made states, but this vexillologist is lazy. You are to make a program that can draw the flag with any number of stars desired!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Specification&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Here's a neat image of the official, government-standardised design for the current U.S. flag:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/MLe2l.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/MLe2l.png&quot; alt=&quot;flag design&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Disregard the contents of the canton for now. Your program must draw a flag that adheres to only the ratios I give here:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A (the height of the flag) = 1&lt;/li&gt;&#xA;&lt;li&gt;B (the width of the flag) = 19/10&lt;/li&gt;&#xA;&lt;li&gt;C (the height of the canton) = 7/13&lt;/li&gt;&#xA;&lt;li&gt;D (the width of the canton) = 19/25&lt;/li&gt;&#xA;&lt;li&gt;L (the height of any stripe) = 1/13&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Because raster solutions are not exact and this flag is commonly misdrawn anyway, there's tolerance of 2% for every ratio, taking the flag height as the base.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Furthermore, the correct colours must be used. &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Every odd-numbered stripe must be this shade (hex): #B22234&lt;/li&gt;&#xA;&lt;li&gt;The blue canton must be in this shade: #3C3B6E&lt;/li&gt;&#xA;&lt;li&gt;Every even-numbered stripe, and every star, must be in this shade: #FFFFFF&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Conversions to other colour coordinate systems can be found on &lt;a href=&quot;https://en.wikipedia.org/wiki/Flag_of_the_United_States#Colors&quot; rel=&quot;nofollow noreferrer&quot;&gt;the wiki page&lt;/a&gt; as well.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Stars&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Your program must takes as input any integer between 0 and 200, and draw that number of stars within the canton. The following rules apply.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each star must have five outer points and be five-fold rotationally symmetrical.&lt;/li&gt;&#xA;&lt;li&gt;Each star must be the same size.&lt;/li&gt;&#xA;&lt;li&gt;The bounding circles of stars may overlap, but the surface of the stars itself may not overlap.&lt;/li&gt;&#xA;&lt;li&gt;The bounding circles of the stars may go outside the canton, but the surface of the stars itself may not go outside the canton.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I don't want solutions that just place every star on the same line; that would leave a lot of blue canton untouched, which would be a waste. So, as a rule, the combined surface area of the bounding circles of every star in the canton must be at least 20% of the surface area of the canton.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Since overlapping bounding circles still count, you get a formula for the minimum width &lt;em&gt;w&lt;/em&gt; of the star, where &lt;em&gt;a&lt;/em&gt; is the area of the canton and &lt;em&gt;n&lt;/em&gt; the number of stars: &lt;a href=&quot;https://i.stack.imgur.com/TCZMv.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/TCZMv.png&quot; alt=&quot;formula&quot;&gt;&lt;/a&gt;. See &lt;a href=&quot;https://www.wolframalpha.com/input/?i=a%20*%200.2%20%3D%20%28pi%20*%20%28w%2F2%29%5E2%29%20*%20n%3B%20a%20%3E%200%3B%20n%20%3E%200%3B%20w%20%3E%200%20%20solve%20for%20w&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; for how it's derived.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Other specifications&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;There's no minimum or maximum size for your output image, though I recommend something that will allow 200 stars to fit but still be demonstrably star-shaped. When they are only a few pixels high, it becomes hard to argue that they have the required amount of points. Obviously, for vector solutions any size is permissible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the smallest program wins!&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Because I gave no specific arrangement of the stars (you may arrange them however you want), there is an infinite number of correct and incorrect solutions for each number of stars. These are just examples of valid and invalid solutions:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Valid:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/9JajV.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/9JajV.png&quot; alt=&quot;valid1&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Invalid (stars too small):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/e4k9U.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/e4k9U.png&quot; alt=&quot;invalid1&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Valid:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ld7ar.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ld7ar.png&quot; alt=&quot;valid2&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Invalid (stars of unequal size, going out of the canton):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/hTwwN.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/hTwwN.png&quot; alt=&quot;invalid2&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Serapis_flag&quot; rel=&quot;nofollow noreferrer&quot;&gt;Invalid&lt;/a&gt; (stars have too many points, stripes have wrong colours, colours are the wrong hue, proportions are wrong):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/2lZtI.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/2lZtI.png&quot; alt=&quot;invalid3&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Do I need more test cases? Any other feedback?&lt;/p&gt;&#xA;" OwnerUserId="81594" LastEditorUserId="81594" LastEditDate="2020-03-06T19:16:12.163" LastActivityDate="2020-03-06T19:16:12.163" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18652" PostTypeId="2" ParentId="18632" CreationDate="2020-03-09T12:57:45.357" Score="1" Body="&lt;h1&gt;Invalid&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;class {&#xA;  constructor(controller, utils) {&#xA;    this.controller = controller;&#xA;    this.side = controller.side;&#xA;    this.utils = utils;&#xA;  }&#xA;&#xA;  turn() {&#xA;    // Oops! nothing here!&#xA;  }&#xA;&#xA;  end_turn() {&#xA;&#xA;  }&#xA;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="16824" LastEditorUserId="16824" LastEditDate="2021-06-29T05:34:42.200" LastActivityDate="2021-06-29T05:34:42.200" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18653" PostTypeId="2" ParentId="18632" CreationDate="2020-03-09T13:31:23.163" Score="1" Body="&lt;h1&gt;MoreJunk&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;throw 'ha ha haaa!';&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="16824" LastActivityDate="2020-03-09T13:31:23.163" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18654" PostTypeId="2" ParentId="2140" CreationDate="2020-03-09T20:20:23.460" Score="1" Body="&lt;h2&gt;Making Minimial Memory Masterpieces&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this challenge you will be asked to write a small computer program to paint an approximation of the painting &lt;a href=&quot;https://en.wikipedia.org/wiki/Fine_Wind,_Clear_Morning&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;Fine Wind, Clear Morning&lt;/em&gt;&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Your submission&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In this challenge we are going to start with a blank canvas.  We are going to add an &quot;ant&quot; in the top left corner.  You will be telling the ant how to paint the picture by writing its brain.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An ant is a simple creature, at a given time it knows two things.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Some memories that it has&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The color of the pixel it is currently standing on&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;And at every step the ant consults these two things it knows and then&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Draws one pixel of any color where it is standing&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Moves one pixel in a cardinal direction&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Replaces its all of its memory&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;The ant can thus be thought of as a function which takes a color and a value and spits out a color, a value and a cardinal direction.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example here is the brain of an ant that draws a zigzag pattern in red&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$&#xA;  f(c,m) = \left\{\begin{matrix}(\mathrm{Red}, &amp;amp; \mathrm{South}, &amp;amp; 1) &amp;amp; \mathrm{if} &amp;amp; m = 0\\&#xA;(\mathrm{Red}, &amp;amp; \mathrm{East}, &amp;amp; 0) &amp;amp; \mathrm{if} &amp;amp; m = 1\end{matrix}\right.&#xA;\$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However our canvas is not infinite, so this ant would run into a border eventually.  We will stop the ant if it tries to move off, by canceling its move and leaving it on the square it is on.  You are free to use this behavior to your advantage.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The one issue here is that currently the ant will never stop, it will just keep painting forever.  Which is why ants come with a builtin kill switch.  When an ant's memories are equal to an exact value the ant explodes or something, ending the drawing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your submission will thus consist of 3 things&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The starting memory for your ant&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A description of the ant's function (more on this later)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The ending memory for your ant&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The goal of this challenge is to have the ant that requires the least memory to operate.  We will count this by the number of different states your ant's memory can have.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Thus to score your answer you should run it on the canvas provided.  Once the ant has finished your score will be the total number of distinct memories used by your ant through the process.  We will include the initial memory even if it does not appear again, but you should not count the ending memory (the one that kills the ant).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The lowest score will be the winner.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The painting&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;The painting will be a low resolution version of the one from the wikipedium.  It will use 3 bit color resolution.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;I will decide on the exact specific sizes and make the image in a bit.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A valid answer must produce this image exactly when run on the canvas.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Verification Tool&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;I will make a tool for running and verifying programs, using a standardized format.  It will be runnable in browser.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2020-03-09T20:47:08.723" LastActivityDate="2020-03-09T20:47:08.723" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18656" PostTypeId="2" ParentId="2140" CreationDate="2020-03-10T01:16:50.157" Score="1" Body="&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2020-03-10T13:07:43.287" LastActivityDate="2020-03-10T13:07:43.287" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18658" PostTypeId="2" ParentId="2140" CreationDate="2020-03-10T17:29:58.970" Score="-1" Body="&lt;h2&gt;Numbers by index&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Print the numbers:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0&#xA;1&#xA;22&#xA;333&#xA;4444&#xA;55555&#xA;666666&#xA;7777777&#xA;88888888&#xA;999999999&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In that order.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I/O&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Takes no input. The numbers can have any delimiters desired (or none). Example outputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0122333444455555666666777777788888888999999999&#xA;&#xA;[0,1,22,333,4444,55555,666666,7777777,88888888,999999999]&#xA;&#xA;etc....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Code Example&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is an un-golfed example that may perhaps act as algorithm guide (or maybe not):&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;&lt;a href=&quot;http://morphett.info/turing/turing.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Turing Machine Code&lt;/a&gt;, 553 bytes&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 * 0 r K&#xA;K * _ r 1&#xA;1 * 1 r L&#xA;L * _ r 2&#xA;2 * 2 r a&#xA;a * 2 r M&#xA;M * _ r 3&#xA;3 * 3 r b&#xA;b * 3 r c&#xA;c * 3 r N&#xA;N * _ r 4&#xA;4 * 4 r d&#xA;d * 4 r e&#xA;e * 4 r f&#xA;f * 4 r O&#xA;O * _ r 5&#xA;5 * 5 r g&#xA;g * 5 r h&#xA;h * 5 r i &#xA;i * 5 r j&#xA;j * 5 r P&#xA;P * _ r 6&#xA;6 * 6 r k&#xA;k * 6 r l&#xA;l * 6 r m&#xA;m * 6 r n&#xA;n * 6 r o&#xA;o * 6 r Q&#xA;Q * _ r 7&#xA;7 * 7 r p&#xA;p * 7 r q&#xA;q * 7 r r&#xA;r * 7 r s&#xA;s * 7 r t&#xA;t * 7 r u&#xA;u * 7 r R&#xA;R * _ r 8&#xA;8 * 8 r v&#xA;v * 8 r w&#xA;w * 8 r x&#xA;x * 8 r y&#xA;y * 8 r z&#xA;z * 8 r A&#xA;A * 8 r B&#xA;B * 8 r S&#xA;S * _ r 9&#xA;9 * 9 r C&#xA;C * 9 r D&#xA;D * 9 r E&#xA;E * 9 r F&#xA;F * 9 r G&#xA;G * 9 r H&#xA;H * 9 r I&#xA;I * 9 r J&#xA;J * 9 r halt&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;http://morphett.info/turing/turing.html?23aea82be925a0c78e78ea9e7912363d&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This prints out the numbers with a space delimiter:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 1 22 333 4444 55555 666666 7777777 88888888 999999999&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge Type&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes (by language) wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Edit:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/201176/numbers-by-position&quot;&gt;Link to the related challenge&lt;/a&gt;. Curiously, there is one answer on there where if it was by index, and the zero was included, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/201176/numbers-by-position/201379#201379&quot;&gt;it would be shorter&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="81263" LastEditorUserId="81263" LastEditDate="2020-03-22T10:48:37.703" LastActivityDate="2020-03-22T10:48:37.703" CommentCount="17" ContentLicense="CC BY-SA 4.0" />
  <row Id="18660" PostTypeId="2" ParentId="18545" CreationDate="2020-03-11T08:09:16.523" Score="1" Body="&lt;h1&gt;Challenge 4 leaderboard&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Positions marked with a * are non-eligible because of restricted languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt; &amp;lt;table class=&quot;answer-list&quot;&amp;gt; &amp;lt;thead&amp;gt; &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Author&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Language&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Size&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/thead&amp;gt; &amp;lt;tbody id=&quot;answers&quot;&amp;gt; &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;1.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Expired Data&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/tkwa/Sledgehammer&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Sledgehammer&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200706&quot;&amp;gt;6&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;2.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Bubbler&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;http://jsoftware.com/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;J&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200834&quot;&amp;gt;16&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;*3.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Jonathan Allan&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Jelly&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200701&quot;&amp;gt;22&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;4.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;J42161217&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.wolfram.com/wolframscript/&quot; rel=&quot;noreferrer&quot;&amp;gt;Wolfram Language (Mathematica)&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200687&quot;&amp;gt;23&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;*5.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Nick Kennedy&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Jelly&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200691&quot;&amp;gt;25&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;6.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Jonathan Allan&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/lmendo/MATL&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;MATL&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200704&quot;&amp;gt;26&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;7.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Bubbler&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://docs.python.org/3/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Python 3&amp;lt;/a&amp;gt; + &amp;lt;a href=&quot;https://docs.sympy.org/latest/index.html&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;SymPy&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200856&quot;&amp;gt;33&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;7.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Noodle9&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://doc.sagemath.org/html/en/developer/index.html&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;SageMath&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200690&quot;&amp;gt;33&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;9.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Embodiment of Ignorance&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;http://magma.maths.usyd.edu.au/magma/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Magma&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200720&quot;&amp;gt;34&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;10.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Neil&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/somebody1234/Charcoal&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Charcoal&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200708&quot;&amp;gt;41&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;11.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Robin Ryder&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.r-project.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;R&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200693&quot;&amp;gt;68&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;12.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Giuseppe&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.r-project.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;R&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200844&quot;&amp;gt;83&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;13.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Graham&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;WIN+APL&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200709&quot;&amp;gt;114&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;14.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Nick Kennedy&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.r-project.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;R&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200700&quot;&amp;gt;128&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;15.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Arnauld&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;JavaScript (ES6)&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200688&quot;&amp;gt;206&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;16.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Kevin Cruijssen&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Java 8&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200786&quot;&amp;gt;261&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/tbody&amp;gt; &amp;lt;/table&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="75323" LastEditorUserId="75323" LastEditDate="2020-03-15T12:03:48.170" LastActivityDate="2020-03-15T12:03:48.170" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18661" PostTypeId="2" ParentId="2140" CreationDate="2020-03-11T15:27:26.460" Score="-1" Body="&lt;h2&gt;Very rough outline of a challenge that rewards short programs that take a long time.&lt;/h2&gt;&#xA;&lt;p&gt;Probably a no input and output can be anything except an error challenge.&lt;/p&gt;&#xA;&lt;p&gt;Is there a nice way to exclude things like &lt;code&gt;sleep()&lt;/code&gt;, &lt;code&gt;wait()&lt;/code&gt; etc?&lt;/p&gt;&#xA;&lt;p&gt;Would be required for 1 person to run all the programs for the timing to be fair.&lt;/p&gt;&#xA;&lt;p&gt;Thinking that answers would include loops, recursion, testing of complex criteria.&lt;/p&gt;&#xA;" OwnerUserId="63404" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-03-11T15:27:26.460" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18662" PostTypeId="2" ParentId="2140" CreationDate="2020-03-12T01:09:49.587" Score="0" Body="&lt;p&gt;A similar challenge was posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4620/convert-from-infix-notation-to-prefix-notation&quot;&gt;here&lt;/a&gt; but that's outdated and I have a few twists.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a program, expression or subroutine which, given an arithmetical expression in infix notation, like &lt;code&gt;1 + 2&lt;/code&gt;, outputs the same expression in postfix notation except the numbers are now float representative in the string, i.e. &lt;code&gt;1.0 2.0 +&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input can include parentheses (()), exponents (^), division (/) and multiplication (*), addition (+) and subtraction (-) (in that order of operation), such as&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;4 ^ (2 / 3) * 9 * 3 - - 4 * 6&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;output the same expression in prefix notation.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;4.0 2.0 3.0 / ^ 9.0 * 3.0 * -4.0 6.0 * -&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Spaces are optional in the input as well as the output.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Twists&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Must support using floats too, instead of just integers. so &lt;code&gt;4 ^ (2.0/3.0) * 9.0 * 3.0 - - 4 *6&lt;/code&gt; output's is the same as the ones above.&lt;/li&gt;&#xA;&lt;li&gt;Must return a string with all numbers as its float representative instead of as its original form, so 9 -&gt; 9.0 and if it was 9.0 it stays 9.0.&lt;/li&gt;&#xA;&lt;li&gt;Must support negation (see example above &quot;3.0 - - 4&quot; ends up with &quot;-4.0&quot;, negative sign stays in place).&lt;/li&gt;&#xA;&lt;li&gt;Cannot use exec() or eval() functions.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Assumptions&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can assume that there will not be any special numbers such as those in scientific notation or those with hanging zeroes, e.g. 000004 or 0005.000000.&lt;/li&gt;&#xA;&lt;li&gt;You should also not assume the commutative or associative properties. This means that, while the operators will move around, the numbers will always remain in the same order.&lt;/li&gt;&#xA;&lt;li&gt;You can always assume a valid infix input.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Clarifications&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You should not evaluate any expression. &lt;/li&gt;&#xA;&lt;li&gt;The output should not contain any unneeded parentheses. ((2+1))-1 should reduce to 2+1-1.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Game Winning Criteria&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Fewest amount of characters wins.&lt;/strong&gt; Bytes are not of a matter here.&lt;/p&gt;&#xA;" OwnerUserId="92391" LastActivityDate="2020-03-12T01:09:49.587" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18672" PostTypeId="1" CreationDate="2020-03-15T09:07:37.993" Score="11" ViewCount="650" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/18429/41805&quot;&gt;You have chosen the categories&lt;/a&gt; for PPCG's &quot;Best of 2019&quot;. We're going with 16 categories this year. Since all you amazing people have offered up a collective total of 16,000 rep in bounties, we can include all categories with a positive score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So here is what we'll do: I will post one community wiki answer for each of the 16 categories. Nominations should be edited into these answers in any order (e.g. feel free to add late nominations to the top so that they're more visible). They should include a prominent link to the nominated post, the corresponding user, as well as a bit of text about why the post was nominated and would deserve the award. Self-nominations are welcome.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a week, we will turn this post into the actual vote by adding comments to each answer which correspond to the different nominees. If needed, this period may be extended.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Especially during the first few hours of the nomination process, I would recommend writing up a nomination elsewhere and just copying it into the post in one go, because there will probably be quite frequent edits, and SE has no way of merging conflicting edits.&lt;/p&gt;&#xA;" OwnerUserId="41805" LastActivityDate="2020-11-17T04:18:21.933" Title="Best of PPCG 2019 – Now Accepting Nominations!" Tags="|discussion|best-of|" AnswerCount="16" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="18673" PostTypeId="2" ParentId="18672" CreationDate="2020-03-15T09:10:34.170" Score="8" Body="&lt;h1&gt;Best mathematical insight&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;On this site we often see answers in languages specifically designed for short code, or designed to be fast. Sometimes, a nice golfing trick or speed-up technique surprises us with its ingenuity, beyond the standard use of that language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And occasionally an answer shows up that uses an unexpected approach to greatly simplify the problem, and makes us wonder how the author could ever think of that. This usually involves some far-from-obvious mathematical equivalence, or a particularly simple approach to the problem that was not evident at all (once revealed, other answers often follow the same approach).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This category is for the answer with the best &lt;strong&gt;mathematical&lt;/strong&gt; insight or unexpected approach that led to greatly simplifying the problem, in &lt;strong&gt;any challenge type&lt;/strong&gt; (code golf, fastest code, or others). The insight should have led to a significant improvement according to the challenge's metric (code length, run time, or whatever applicable).&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I (&lt;em&gt;@KevinCruijssen&lt;/em&gt;) nominate &lt;a href=&quot;https://codegolf.stackexchange.com/a/191306/52210&quot;&gt;&lt;em&gt;@Grimmy&lt;/em&gt; with this 05AB1E answer&lt;/a&gt;. After a pretty lengthy and impressive challenge description, they showed this to-the-point 4-byter which literally all other answers (except for one) ported since it's the shortest approach. To quote the top two comments: &quot;&lt;em&gt;Hmm, that doesn't bode well for this challenge if it can be simplified that easily&lt;/em&gt;&quot; and &quot;&lt;em&gt;You have approximately 1 byte of code for 800 bytes of challenge explanation. :p&lt;/em&gt;&quot;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41805" LastEditorUserId="6484" LastEditDate="2020-03-31T06:08:28.063" LastActivityDate="2020-03-31T06:08:28.063" CommentCount="1" CommunityOwnedDate="2020-03-15T09:10:34.170" ContentLicense="CC BY-SA 4.0" />
  <row Id="18674" PostTypeId="2" ParentId="18672" CreationDate="2020-03-15T09:12:38.427" Score="4" Body="&lt;h1&gt;Best Non-Code-Golf Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Best challenge whose winning criteria did not include any code-golfing. King of the Hill, Fastest Code, etc. would be eligible. Proof Golf, atomic-code-golf, etc. are also included. Anything that's not the standard &amp;quot;shortest code length&amp;quot; is eligible.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;I (&lt;em&gt;@Bubbler&lt;/em&gt;) nominate &lt;a href=&quot;https://codegolf.stackexchange.com/q/188333/78410&quot;&gt;Construct a pentagon avoiding compass use&lt;/a&gt;, asked by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/ad-hoc-garf-hunter&quot;&gt;&lt;em&gt;@Ad Hoc Garf Hunter&lt;/em&gt;&lt;/a&gt;. As far as I know, this was the first (and is still the only) challenge asking about compass-and-straightedge construction, and it is a very well designed one, at least in my opinion. This challenge also established a good ruleset for possible future challenges of the kind.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I (&lt;em&gt;@Bubbler&lt;/em&gt;) nominate &lt;a href=&quot;https://codegolf.stackexchange.com/q/196824/78410&quot;&gt;Biggest Irreducible Hello World&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/88509/mason&quot;&gt;&lt;em&gt;@Mason&lt;/em&gt;&lt;/a&gt;. This was the first proper &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; challenge that allowed arbitrarily high scores while not allowing trivial solutions. The challenge was a huge success, getting a few answers with &lt;a href=&quot;https://codegolf.stackexchange.com/a/197001/78410&quot;&gt;impressive&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/196833/78410&quot;&gt;scores&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I (&lt;em&gt;@user41805&lt;/em&gt;) nominate &lt;a href=&quot;https://codegolf.stackexchange.com/q/183036&quot;&gt;Can a neural network recognize primes?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/49643/a-rex&quot;&gt;A. Rex&lt;/a&gt;, the first &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/neural-networks&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;neural-networks&amp;#39;&quot; rel=&quot;tag&quot;&gt;neural-networks&lt;/a&gt; challenge that eventually led to 4 more &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/neural-networks&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;neural-networks&amp;#39;&quot; rel=&quot;tag&quot;&gt;neural-networks&lt;/a&gt; challenges in 2019.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41805" LastEditorUserId="78410" LastEditDate="2020-11-17T04:16:42.027" LastActivityDate="2020-11-17T04:16:42.027" CommentCount="0" CommunityOwnedDate="2020-03-15T09:12:38.427" ContentLicense="CC BY-SA 4.0" />
  <row Id="18675" PostTypeId="2" ParentId="18672" CreationDate="2020-03-15T09:13:01.653" Score="2" Body="&lt;h2&gt;Rookie of the Year - Challenges&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17314/best-of-ppcg-2018-call-for-categories/17318#17318&quot;&gt;Repost of 2018&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For the best challenge written by someone who has not written a challenge prior to 2019 (i.e., not necessarily a new user, just a new challenge writer).&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;I (&lt;em&gt;@KevinCruijssen&lt;/em&gt;) nominate &lt;a href=&quot;https://codegolf.stackexchange.com/q/181708/52210&quot;&gt;&lt;em&gt;@DiscreteGames&lt;/em&gt;' &lt;em&gt;Would this string work as string?&lt;/em&gt; challenge&lt;/a&gt;. It was his/her first post, yet is the third most upvoted challenge of 2019. A clear spec right from the get-go, without people needing to comment all kind of questions and suggestions for spec-changes; additional test cases; or things that weren't clear, like we usually see with new users. And it's a fun challenge, with a variety of different approaches in the answers as well.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I (&lt;em&gt;@Lyxal&lt;/em&gt;) nominate &lt;a href=&quot;https://codegolf.stackexchange.com/questions/187816/swapping-good-and-bad&quot;&gt;&lt;em&gt;@IshaqKhan&lt;/em&gt;'s Swapping &amp;quot;Good&amp;quot; and &amp;quot;Bad&amp;quot;&lt;/a&gt; challenge. I know that I use for planning esolangs, and, with 7k views, it was a breath of fresh air to see such a well-written and simple challenge.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I (&lt;em&gt;@a'_'&lt;/em&gt;) nominate &lt;a href=&quot;https://codegolf.stackexchange.com/questions/184682/check-if-a-string-is-entirely-made-of-the-same-substring&quot;&gt;&lt;em&gt;@ouflak&lt;/em&gt; Check if a string is entirely made of the same substring&lt;/a&gt;. It's quite rare for a new user to post such a simple and interesting challenge. With 25 votes (very impressive for a first challenge), it was an impressive unique challenge.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I (&lt;em&gt;@user41805&lt;/em&gt;) nominate &lt;a href=&quot;https://codegolf.stackexchange.com/users/87615&quot;&gt;Stefan Mesken&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/q/187562&quot;&gt;Machine Learning Golf: Multiplication&lt;/a&gt; challenge. It's the second &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/neural-network&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;neural-network&amp;#39;&quot; rel=&quot;tag&quot;&gt;neural-network&lt;/a&gt; challenge, and it has resulted in answers that hardcoded the computation in interesting ways.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user92069" LastEditorUserId="78410" LastEditDate="2020-11-17T04:17:11.207" LastActivityDate="2020-11-17T04:17:11.207" CommentCount="4" CommunityOwnedDate="2020-03-15T09:31:03.543" ContentLicense="CC BY-SA 4.0" />
  <row Id="18676" PostTypeId="2" ParentId="18672" CreationDate="2020-03-15T09:14:17.427" Score="2" Body="&lt;h2&gt;Most elegant spec&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17314/best-of-ppcg-2018-call-for-categories/17318#17318&quot;&gt;Repost of 2018&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Writing an interesting challenge is tough, not just in thinking up a good idea, but in specifying it clearly enough without taking pages of text. This category is for challenges whose specification is a pleasure to read, summing up exactly what is required succinctly and unambiguously.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastActivityDate="2020-03-15T09:14:17.427" CommentCount="0" CommunityOwnedDate="2020-03-15T09:31:55.027" ContentLicense="CC BY-SA 4.0" />
  <row Id="18677" PostTypeId="2" ParentId="18672" CreationDate="2020-03-15T09:14:49.857" Score="4" Body="&lt;h2&gt;Most helpful Sandbox commenter&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Rewards a kind soul who took the time and effort to read through challenges in the Sandbox and give helpful feedback.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(I guess a bounty here would be awarded to one of the winner's questions or answers of their choosing.)&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Nominations&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I nominate &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/43319/ad%c3%a1m&quot;&gt;Adám&lt;/a&gt; for this award, as he is always willing to read through challenges and highlight parts which are unclear. He is also willing to check sandboxed posts on demand, so to speak, if asked in TNB, which is why I'm nominating him. &lt;/li&gt;&#xA;&lt;li&gt;I nominate &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt; for this award, as they are always reading through the sandboxed challenges and provides helpful comments for challenges. They will be commenting on the challenge whenever the challenge is mentioned in TNB. Also they are very helpful and would mention everything in the challenge that is unclear or needs improvement.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-03-18T11:14:24.990" LastActivityDate="2020-03-18T11:14:24.990" CommentCount="0" CommunityOwnedDate="2020-03-15T09:29:15.190" ContentLicense="CC BY-SA 4.0" />
  <row Id="18678" PostTypeId="2" ParentId="18672" CreationDate="2020-03-15T09:15:18.697" Score="10" Body="&lt;h2&gt;Wild card&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For a deserving challenge, answer or user that isn't a good fit for any of the other categories.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I (@KevinCruijssen) nominate &lt;a href=&quot;https://codegolf.stackexchange.com/questions/102370/add-a-language-to-a-polyglot?answertab=active#tab-top&quot;&gt;all &lt;em&gt;@stasoid&lt;/em&gt;'s answers for the &lt;em&gt;Add a language to a polyglot&lt;/em&gt; challenge&lt;/a&gt;. This challenge was created in 2016, but &lt;em&gt;@stasoid&lt;/em&gt; has been adding new languages every few weeks for the past 2+ years. It's insane to think that this single program can run in 280+ different programming languages, of which 139 of those languages (so roughly halve) were added by &lt;em&gt;@stasoid&lt;/em&gt; alone.&lt;/li&gt;&#xA;&lt;li&gt;I (@S.S. Anne) nominate &lt;a href=&quot;https://codegolf.stackexchange.com/users/52904/ceilingcat&quot;&gt;ceilingcat&lt;/a&gt; for his helpful and constructive comments. Although he doesn't often post answers, he does post many comments that have helped improve countless solutions. I wouldn't be as good of a code-golfer as I am now without @ceilingcat.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user92069" LastEditorUserId="89298" LastEditDate="2020-03-22T23:19:12.870" LastActivityDate="2020-03-22T23:19:12.870" CommentCount="6" CommunityOwnedDate="2020-03-15T09:28:35.060" ContentLicense="CC BY-SA 4.0" />
  <row Id="18679" PostTypeId="2" ParentId="18672" CreationDate="2020-03-15T09:15:59.333" Score="1" Body="&lt;h2&gt;Most Collaborative Answer&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;goes to one that incorporates significant ideas from as many users as possible&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastActivityDate="2020-03-15T09:15:59.333" CommentCount="0" CommunityOwnedDate="2020-03-15T09:29:45.133" ContentLicense="CC BY-SA 4.0" />
  <row Id="18680" PostTypeId="2" ParentId="18672" CreationDate="2020-03-15T09:16:09.217" Score="2" Body="&lt;h1&gt;Best Explained Answer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Awarded to a user who explains a complex solution in the best way.&lt;/p&gt;&#xA;" OwnerUserId="41805" LastActivityDate="2020-03-15T09:16:09.217" CommentCount="0" CommunityOwnedDate="2020-03-15T09:16:09.217" ContentLicense="CC BY-SA 4.0" />
  <row Id="18682" PostTypeId="2" ParentId="18672" CreationDate="2020-03-15T09:18:02.570" Score="5" Body="&lt;h2&gt;Best Above-and-Beyond Answer&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17314/best-of-ppcg-2018-call-for-categories/17318#17318&quot;&gt;Repost of last year's&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Every once in a while, an answer takes the challenge to the extreme. This prize will be awarded to an answer which went far beyond the expectations of the challenge. This could include a code golf answer that brute-forced/proved the shortest program in some language&#xA;a graphical-output popcon answer of extreme size and quality&#xA;a KOTH answer of high complexity which absolutely dominated the competition&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I (&lt;em&gt;@KevinCruijssen&lt;/em&gt;) nominate &lt;a href=&quot;https://codegolf.stackexchange.com/a/189055/52210&quot;&gt;&lt;em&gt;@KrzysztofSzewczyk&lt;/em&gt;'s Malbolge answer here&lt;/a&gt;. To quote the Malbolge docs themselves:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The day that someone writes, in Malbolge, a program that simply copies its input to it's output, is the day my hair spontaneously turns green. It's the day that elephants are purple and camels fly, and a cow can fit through a needle's eye.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;And what &lt;em&gt;@KrzysztofSzewczyk&lt;/em&gt; does in the &lt;em&gt;DDoouubbllee ssppeeaakk!!&lt;/em&gt; challenge is at least double (pun intended) as impressive and insane, thus worthy of being nominated here.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I (&lt;em&gt;@user41805&lt;/em&gt;) nominate &lt;a href=&quot;https://codegolf.stackexchange.com/users/17216&quot;&gt;Deadcode&lt;/a&gt;'s ECMAScript regex (+ molecular lookahead) answer to the &lt;a href=&quot;https://codegolf.stackexchange.com/a/198428&quot;&gt;divide input by the square root of 2 challenge&lt;/a&gt;. Quoting the first line of the submission,&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Regex was never designed to do mathematics. It has no concept of arithmetic.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I (&lt;em&gt;@Lyxal&lt;/em&gt;) nominate &lt;a href=&quot;https://codegolf.stackexchange.com/a/191111/78850&quot;&gt;another one of &lt;em&gt;@KrzysztofSzewczyk&lt;/em&gt;'s Malbolge answers here&lt;/a&gt;. Even though it may seem like it was written in Polish (&lt;em&gt;&amp;quot;When I opened your program, Chrome attempted to translate it from Polish&amp;quot;&lt;/em&gt; -- quote from a comment on the answer), this 362MB answer has stuck with me all year as one of my favourites. I've known right from when I saw it that I would nominate it for a best of CGCC category.&lt;/p&gt;&#xA;&lt;p&gt;Sure, it's over 20 million times longer than the winning Jelly answer, but for such a volatile language such as Malbolge competing in such a task as theoretically diving numbers by 0, I'd say it deserves a nomination.&lt;/p&gt;&#xA;&lt;p&gt;To quote the last line in the answer:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;It's working!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I (&lt;em&gt;@a'_'&lt;/em&gt;) nominate one of &lt;a href=&quot;https://codegolf.stackexchange.com/a/189091/92069&quot;&gt;@KrzysztofSzewczyk's Seed answers here&lt;/a&gt;. A comment has once been posted in &amp;quot;Tips for golfing in Seed&amp;quot; along the lines of&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;... There are only two people who know how to golf in Seed, and both of them decided to not share their tips ...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Krzysztof knowing how to golf in Seed is unique and supernatural, with no one else other than feersum knowing how to golf in it, since it involves reverse-engineering the Merseene twister; thus the answer is worthy of being nominated here.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastEditorUserId="78410" LastEditorDisplayName="user92069" LastEditDate="2020-11-17T04:18:21.933" LastActivityDate="2020-11-17T04:18:21.933" CommentCount="2" CommunityOwnedDate="2020-03-15T09:29:28.203" ContentLicense="CC BY-SA 4.0" />
  <row Id="18683" PostTypeId="2" ParentId="18672" CreationDate="2020-03-15T09:18:34.823" Score="0" Body="&lt;h2&gt;Most Clever Optimization&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;When an existing answer is optimized with a bizarre and surprising change.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An off-site real-world example would be the fast inverse square root hack.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastActivityDate="2020-03-15T09:18:34.823" CommentCount="0" CommunityOwnedDate="2020-03-15T09:30:25.523" ContentLicense="CC BY-SA 4.0" />
  <row Id="18684" PostTypeId="2" ParentId="18672" CreationDate="2020-03-15T09:19:01.930" Score="2" Body="&lt;h2&gt;Trickiest Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It should look simple and tempt you to start coding right away, but coming up with a good solution should be hard.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I (@KevinCruijssen) nominate &lt;a href=&quot;https://codegolf.stackexchange.com/q/181843/52210&quot;&gt;&lt;em&gt;@DiscreteGames&lt;/em&gt;' &lt;em&gt;Make a Bowl of Alphabet Soup&lt;/em&gt; challenge&lt;/a&gt;. It didn't seem to hard at first (definitely not trivial either though), but actually was surprisingly tricky to create a solution for.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user92069" LastEditorUserId="52210" LastEditDate="2020-03-20T09:16:44.327" LastActivityDate="2020-03-20T09:16:44.327" CommentCount="0" CommunityOwnedDate="2020-03-15T09:31:20.947" ContentLicense="CC BY-SA 4.0" />
  <row Id="18685" PostTypeId="2" ParentId="18672" CreationDate="2020-03-15T09:19:33.137" Score="1" Body="&lt;h2&gt;Most unexpected approach&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Awarded to the author of the solution to a challenge that is completely different from the obvious approaches, especially if it beats all other answers.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastActivityDate="2020-03-15T09:19:33.137" CommentCount="0" CommunityOwnedDate="2020-03-15T09:28:58.873" ContentLicense="CC BY-SA 4.0" />
  <row Id="18686" PostTypeId="2" ParentId="18672" CreationDate="2020-03-15T09:20:10.770" Score="3" Body="&lt;h2&gt;Best Non-Code-Golf Answer&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Best answer to a challenge whose winning criteria did not include any code-golfing. King of the Hill, Fastest Code, etc. would be eligible. Proof Golf, atomic-code-golf, etc. are also included. Anything that's not the standard &quot;shortest code length&quot; is eligible.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I (&lt;em&gt;@Bubbler&lt;/em&gt;) nominate &lt;a href=&quot;https://codegolf.stackexchange.com/users/39242/anders-kaseorg&quot;&gt;&lt;em&gt;@Anders Kaseorg&lt;/em&gt;&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/188337/78410&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/188333/78410&quot;&gt;Construct a pentagon avoiding compass use&lt;/a&gt;. They achieved the optimal primary score (2 circles) with awesome secondary score (&lt;em&gt;only&lt;/em&gt; 13 lines!) using some advanced concepts from projective geometry (which we'll hardly ever see on a recreational programming site here).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user92069" LastEditorUserId="78410" LastEditDate="2020-03-24T10:04:29.677" LastActivityDate="2020-03-24T10:04:29.677" CommentCount="0" CommunityOwnedDate="2020-03-15T09:30:45.767" ContentLicense="CC BY-SA 4.0" />
  <row Id="18687" PostTypeId="2" ParentId="18672" CreationDate="2020-03-15T09:20:44.017" Score="1" Body="&lt;h2&gt;Best tip&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Best answer to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Nominations&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;(Self-Nomination): My (&lt;em&gt;@Lyxal&lt;/em&gt;) answer &lt;a href=&quot;https://codegolf.stackexchange.com/a/193469/78850&quot;&gt;here&lt;/a&gt; to tips for golfing in Keg. It was the most upvoted tip on the question, and it is the second most upvoted answer to a &quot;Tips for golfing in &quot; question in 2019.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(Exclusive-Nomination): I nominate &lt;a href=&quot;https://codegolf.stackexchange.com/users/58563/arnauld&quot;&gt;@Arnauld&lt;/a&gt;'s answer &lt;a href=&quot;https://codegolf.stackexchange.com/a/180950/92069&quot;&gt;here&lt;/a&gt; for is it possible to make a clamp function shorter than a ternary in JS?. It was the most upvoted answer to a tips question in 2019 with an impressive 23 upvotes.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-03-26T10:04:31.753" LastActivityDate="2020-03-26T10:04:31.753" CommentCount="3" CommunityOwnedDate="2020-03-15T09:31:38.403" ContentLicense="CC BY-SA 4.0" />
  <row Id="18688" PostTypeId="2" ParentId="18672" CreationDate="2020-03-15T09:25:47.540" Score="2" Body="&lt;h2&gt;Unique idea&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Awarded to the first person that doesn't use the algorithm that all answerers up to that person of the challenge use in the challenge.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastActivityDate="2020-03-15T09:25:47.540" CommentCount="0" CommunityOwnedDate="2020-03-15T09:25:47.540" ContentLicense="CC BY-SA 4.0" />
  <row Id="18689" PostTypeId="2" ParentId="18672" CreationDate="2020-03-15T09:26:58.343" Score="3" Body="&lt;h2&gt;Most Unconventional Non-esoteric Language&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Goes to a user who uses a language not normally associated with programming challenges.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Nominations&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/75323/rgs&quot;&gt;&lt;em&gt;@RGS&lt;/em&gt;&lt;/a&gt;) nominate &lt;a href=&quot;https://codegolf.stackexchange.com/users/58563/arnauld&quot;&gt;Arnauld&lt;/a&gt; for his work with JavaScript. Arnauld consistently posts in JS and consistently posts very competitive answers, more often than not with some really interesting mathematical touches.&lt;/li&gt;&#xA;&lt;li&gt;I nominate &lt;a href=&quot;https://codegolf.stackexchange.com/users/75681/galen-ivanov&quot;&gt;Galen Ivanov&lt;/a&gt; for his work in &lt;a href=&quot;https://www.red-lang.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Red&lt;/a&gt;. He is currently the only active person using Red to answer challenges, often producing fairly competitive answers.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user92069" LastEditorUserId="75323" LastEditDate="2020-03-20T11:22:36.683" LastActivityDate="2020-03-20T11:22:36.683" CommentCount="0" CommunityOwnedDate="2020-03-15T09:26:58.343" ContentLicense="CC BY-SA 4.0" />
  <row Id="18690" PostTypeId="1" CreationDate="2020-03-15T11:56:00.360" Score="3" ViewCount="72" Body="&lt;p&gt;A bounty of mine expired 11 hours ago and I received an e-mail saying I had a 24-hour grace period during which I could still award the bounty. However, when I go to the &lt;a href=&quot;https://codegolf.stackexchange.com/q/200485/75323&quot;&gt;respective question&lt;/a&gt;, I do not have the usual blue buttons that would allow me to award the bounty to the answers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Am I doing something wrong? How can I award the bounty during the grace period?&lt;/p&gt;&#xA;" OwnerUserId="75323" LastEditorUserId="75323" LastEditDate="2020-03-15T12:27:30.837" LastActivityDate="2020-03-15T12:27:30.837" Title="Cannot award a bounty during grace period" Tags="|support|" AnswerCount="0" CommentCount="3" FavoriteCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18691" PostTypeId="2" ParentId="18545" CreationDate="2020-03-15T12:03:39.973" Score="1" Body="&lt;h2&gt;Challenge 1 leaderboard&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;table class=&quot;answer-list&quot;&amp;gt; &amp;lt;thead&amp;gt; &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Author&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Language&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Size&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/thead&amp;gt; &amp;lt;tbody id=&quot;answers&quot;&amp;gt; &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;1.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Expired Data&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/Adriandmen/05AB1E&quot; rel=&quot;noreferrer&quot;&amp;gt;05AB1E&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;6&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200009&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;1.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;a'_'&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/A-ee/w&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;W&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;6&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200004&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;3.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Jonathan Allan&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Jelly&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;7&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200043&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;4.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Embodiment of Ignorance&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/ETHproductions/japt&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Japt&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;9&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200132&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;4.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Nick Kennedy&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Jelly&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;9&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200050&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;4.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Giuseppe&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/splcurran/Gaia&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Gaia&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;9&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200042&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;4.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Kevin Cruijssen&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/tomtheisen/stax/blob/master/docs/instructions.md&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Stax&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;9&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200037&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;4.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Kevin Cruijssen&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/maxbergmark/mathgolf/blob/master/math_golf.txt&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;MathGolf&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;9&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200033&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;4.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Shaggy&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/ETHproductions/japt&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Japt&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;9&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/199998&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;10.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;isaacg&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/isaacg1/pyth&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Pyth&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;10&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200117&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;10.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Luis Mendo&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/lmendo/MATL&quot; rel=&quot;noreferrer&quot;&amp;gt;MATL&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;10&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200008&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;12.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Bubbler&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.dyalog.com/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;APL (Dyalog Unicode)&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;13&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200130&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;12.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;DeathIncarnate&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/FMNSSun/Burlesque&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Burlesque&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;13&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200021&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;14.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Neil&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/somebody1234/Charcoal&quot; rel=&quot;noreferrer&quot;&amp;gt;Charcoal&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;19&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200013&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;15.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Jonah&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;http://jsoftware.com/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;J&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;22&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200063&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;16.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;andytech&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.perl.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Perl 5&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;23&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200029&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;17.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Jo King&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/nxadm/rakudo-pkg&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Perl 6&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;29&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200053&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;18.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;I.T Delinquent&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/TryItOnline/TioSetup/wiki/Powershell&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;PowerShell&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;31&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200142&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;18.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Mathgeek&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;http://www.golfscript.com/golfscript/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;GolfScript&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;31&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200041&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;20.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Christian Sievers&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.haskell.org/&quot; rel=&quot;noreferrer&quot;&amp;gt;Haskell&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;36&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200015&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;20.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Kirill L.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.ruby-lang.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Ruby&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;36&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200014&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;22.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Arnauld&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;JavaScript (ES6)&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;37&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200002&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;23.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Post Rock Garf Hunter&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.haskell.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Haskell&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;38&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200242&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;23.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;640KB&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://php.net/&quot; rel=&quot;noreferrer&quot;&amp;gt;PHP&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;38&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200023&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;23.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Robin Ryder&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.r-project.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;R&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;38&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200005&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;26.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;JungHwan Min&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.wolfram.com/wolframscript/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Wolfram Language (Mathematica)&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;40&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200054&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;26.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Mitchell Spector&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.gnu.org/software/bash/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Bash&amp;lt;/a&amp;gt; + Core utilities&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;40&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200031&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;28.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;xnor&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://docs.python.org/2/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Python 2&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;42&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200182&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;28.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;ovs&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://docs.python.org/2/&quot; rel=&quot;noreferrer&quot;&amp;gt;Python 2&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;42&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200011&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;30.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;xibu&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://gcc.gnu.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;C (gcc)&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;48&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200096&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;30.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Surculose Sputum&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://docs.python.org/3/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Python 3&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;48&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200064&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;32.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;J42161217&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.wolfram.com/wolframscript/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Wolfram Language (Mathematica)&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;49&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200017&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;33.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;chau giang&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://nodejs.org&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;JavaScript (Node.js)&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;50&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200247&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;33.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Galen Ivanov&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/gtownsend/icon&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Icon&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;50&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200075&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;35.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Galen Ivanov&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;http://www.red-lang.org&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Red&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;52&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200036&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;35.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Mitchell Spector&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.gnu.org/software/bash/&quot; rel=&quot;noreferrer&quot;&amp;gt;Bash&amp;lt;/a&amp;gt; + Unix utilities&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;52&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200006&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;35.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Noodle9&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://docs.python.org/3.8/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Python 3.8 (pre-release)&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;52&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200001&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;38.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;my pronoun is monicareinstate&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;http://www.mono-project.com/docs/about-mono/releases/5.0.0/#csc&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;C# (Visual C# Interactive Compiler)&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;53&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200027&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;39.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Giuseppe&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;http://www.snobol4.org/csnobol4/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;SNOBOL4 (CSNOBOL4)&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;55&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200049&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;40.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;t-clausen.dk&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;T-SQL&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;57&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200012&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;41.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Kevin Cruijssen&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Java 10&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;58&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200022&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;42.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Neil&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/m-ender/retina/wiki/The-Language/a950ad7d925ec9316e3e2fb2cf5d49fd15d23e3d&quot; rel=&quot;noreferrer&quot;&amp;gt;Retina 0.8.2&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;68&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200016&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;43.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;S.S. Anne&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://gcc.gnu.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;C (gcc)&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;80&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200040&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/tbody&amp;gt; &amp;lt;/table&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="75323" LastActivityDate="2020-03-15T12:03:39.973" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18692" PostTypeId="2" ParentId="18545" CreationDate="2020-03-15T12:04:45.743" Score="1" Body="&lt;h2&gt;Challenge 2 leaderboard&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In the ranking below, submissions marked with a &lt;code&gt;*&lt;/code&gt; are not eligible for the competition because they used restricted languages (see &lt;strong&gt;4&lt;/strong&gt; above).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;table class=&quot;answer-list&quot;&amp;gt; &amp;lt;thead&amp;gt; &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Author&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Language&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Size&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/thead&amp;gt; &amp;lt;tbody id=&quot;answers&quot;&amp;gt; &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;*1.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Grimmy&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/Adriandmen/05AB1E&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;05AB1E&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;17&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200287&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;*2.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Nick Kennedy&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Jelly&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;18&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200285&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;*3.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Kevin Cruijssen&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/Adriandmen/05AB1E/wiki/Commands&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;05AB1E&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;19&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200265&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;4.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;isaacg&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/isaacg1/pyth&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Pyth&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;21&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200301&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;4.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Luis Mendo&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/lmendo/MATL&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;MATL&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;21&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200264&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;6.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Jonathan Allan&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/barbuz/Husk&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Husk&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;22&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200376&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;*6.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Jonathan Allan&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/DennisMitchell/m&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;M&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;22&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200344&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;8.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Embodiment of Ignorance&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://sourceforge.net/p/cjam&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;CJam&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;23&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200333&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;9.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;640KB&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;x86-16 machine code&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;25&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200340&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;10.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Mathgeek&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;http://www.golfscript.com/golfscript/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;GolfScript&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;27&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200279&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;11.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Arnauld&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://en.wikipedia.org/wiki/General_Instrument_CP1600&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;CP-1610&amp;lt;/a&amp;gt; machine code (&amp;lt;a href=&quot;https://en.wikipedia.org/wiki/Intellivision&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Intellivision&amp;lt;/a&amp;gt;)&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;28&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200270&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;11.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Bubbler&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/abrudz/QuadRS&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;QuadS&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;28&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200269&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;13.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;DeathIncarnate&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/FMNSSun/Burlesque&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Burlesque&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;29&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200258&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;14.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;anatolyg&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;x86 machine code&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;30&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200379&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;14.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;ovs&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://pythonhosted.org/PyFunge/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Befunge-98 (PyFunge)&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;30&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200267&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;16.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Neil&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/somebody1234/Charcoal&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Charcoal&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;31&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200266&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;17.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Christian Sievers&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/isaacg1/pyth&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Pyth&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;34&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200274&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;18.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Jo King&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/nxadm/rakudo-pkg&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Raku&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;37&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200253&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;19.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Xcali&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.perl.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Perl 5&amp;lt;/a&amp;gt; &amp;lt;code&amp;gt;-p&amp;lt;/code&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;42&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200288&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;20.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Kirill L.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.ruby-lang.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Ruby&amp;lt;/a&amp;gt; &amp;lt;code&amp;gt;-n&amp;lt;/code&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;45&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200357&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;21.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;ovs&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.haskell.org/&quot; rel=&quot;noreferrer&quot;&amp;gt;Haskell&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;48&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200259&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;22.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Jonathan Allan&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/m-ender/labyrinth&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Labyrinth&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;50&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200342&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;22.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Mitchell Spector&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://gcc.gnu.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;C (gcc)&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;50&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200290&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;24.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Noodle9&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://gcc.gnu.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;C (gcc)&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;58&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200262&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;25.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;wilkben&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;http://julialang.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Julia 1.0&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;60&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200297&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;25.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Arnauld&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://nodejs.org&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;JavaScript (Node.js)&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;60&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200252&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;27.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;RGS&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Haskell&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;64&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200256&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;28.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Noodle9&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://gcc.gnu.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;C++ (gcc)&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;70&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200300&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;29.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Robin Ryder&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.r-project.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;R&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;73&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200283&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;29.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Surculose Sputum&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://docs.python.org/3/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Python 3&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;73&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200273&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;31.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Neil&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/m-ender/retina/wiki/The-Language&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Retina&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;74&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200277&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;32.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Expired Data&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;http://www.mono-project.com/docs/about-mono/releases/5.0.0/#csc&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;C# (Visual C# Interactive Compiler)&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;76&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200261&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;32.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Kevin Cruijssen&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Java 8&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;76&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200260&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;34.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Mukundan&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://docs.python.org/3.8/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Python 3.8 (pre-release)&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;87&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200272&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;35.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Nick Kennedy&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;http://www.riscos.com/support/developers/manual_index/basic.html&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;BBC BASIC V&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;92&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200337&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;36.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;S.S. Anne&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://golang.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Go&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;98&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200305&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;37.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;RGS&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;brainfuck&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;119&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200329&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;38.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;a''&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/munificent/wren&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Wren&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;124&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200268&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;39.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Giuseppe&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;http://www.snobol4.org/csnobol4/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;SNOBOL4 (CSNOBOL4)&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;133&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200347&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;40.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Kevin Cruijssen&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://web.archive.org/web/20150618184706/http://compsoc.dur.ac.uk/whitespace/tutorial.php&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Whitespace&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;149&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200275&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;41.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Robin Ryder&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/TryItOnline/spl&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Shakespeare Programming Language&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;491&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200426&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/tbody&amp;gt;&amp;lt;/table&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="75323" LastActivityDate="2020-03-15T12:04:45.743" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18693" PostTypeId="2" ParentId="18545" CreationDate="2020-03-15T12:06:39.797" Score="1" Body="&lt;h2&gt;Challenge 3 leaderboard&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In the ranking below, submissions marked with a &lt;code&gt;*&lt;/code&gt; are non competing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;table class=&quot;answer-list&quot;&amp;gt; &amp;lt;thead&amp;gt; &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Author&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Language&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Size&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/thead&amp;gt; &amp;lt;tbody id=&quot;answers&quot;&amp;gt; &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;1.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Jonathan Allan&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Jelly&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;36&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200519&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;2.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Nick Kennedy&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Jelly&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;37&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200539&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;2.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Jonathan Allan&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/DJMcMayhem/V&quot; rel=&quot;noreferrer&quot;&amp;gt;V (vim)&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;37&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200525&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;4.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Expired Data&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/Adriandmen/05AB1E&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;05AB1E&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;38&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200491&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;5.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Embodiment of Ignorance&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/ETHproductions/japt&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Japt&amp;lt;/a&amp;gt; &amp;lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14339/&quot;&amp;gt;&amp;lt;code&amp;gt;-R&amp;lt;/code&amp;gt;&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;41&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200529&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;6.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Shaggy&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/ETHproductions/japt&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Japt&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;42&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200530&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;7.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;ovs&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/m-ender/retina/wiki/The-Language&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Retina&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;47&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200488&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;8.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Neil&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;vi&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;48&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200598&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;9.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Neil&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/somebody1234/Charcoal&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Charcoal&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;50&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200522&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;10.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Xcali&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.perl.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Perl 5&amp;lt;/a&amp;gt; &amp;lt;code&amp;gt;-p&amp;lt;/code&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;58&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200512&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;11.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Mathgeek&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;http://www.golfscript.com/golfscript/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;GolfScript&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;62&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200541&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;12.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Mitchell Spector&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.gnu.org/software/bash/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Bash&amp;lt;/a&amp;gt; + Core utilities&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;71&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200490&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;13.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;S.S. Anne&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.gnu.org/software/sed/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;sed 4.2.2&amp;lt;/a&amp;gt; &amp;lt;code&amp;gt;-E&amp;lt;/code&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;72&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200639&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;14.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Arnauld&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;JavaScript (ES6)&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;79&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200501&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;15.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;G B&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.ruby-lang.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Ruby&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;81&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200502&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;16.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Kevin Cruijssen&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Java 8&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;107&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200492&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;17.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Robin Ryder&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.r-project.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;R&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;111&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200610&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;17.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;isaacg&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://docs.python.org/3/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Python 3&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;111&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200563&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;19.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;ovs&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://docs.python.org/3/&quot; rel=&quot;noreferrer&quot;&amp;gt;Python 3&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;112&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200500&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;20.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;wilkben&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;http://julialang.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Julia 1.0&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;116&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200510&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;21.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Mitchell Spector&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Pure &amp;lt;a href=&quot;https://www.gnu.org/software/bash/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Bash&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;117&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200527&quot;&amp;gt;Link&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/tbody&amp;gt; &amp;lt;/table&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="75323" LastActivityDate="2020-03-15T12:06:39.797" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18694" PostTypeId="2" ParentId="18545" CreationDate="2020-03-15T12:10:39.210" Score="1" Body="&lt;h2&gt;Challenge 5 leaderboard&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Entries marked with a &lt;code&gt;*&lt;/code&gt; are non-eligible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt; &amp;lt;table class=&quot;answer-list&quot;&amp;gt; &amp;lt;thead&amp;gt; &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Author&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Language&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Size&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/thead&amp;gt; &amp;lt;tbody id=&quot;answers&quot;&amp;gt; &amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;1.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Grimmy&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/Adriandmen/05AB1E&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;05AB1E&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200879&quot;&amp;gt;9&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;2.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Jonathan Allan&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Jelly&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200895&quot;&amp;gt;12&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;2.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Nick Kennedy&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Jelly&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200890&quot;&amp;gt;12&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;4.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Embodiment of Ignorance&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/ETHproductions/japt&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Japt&amp;lt;/a&amp;gt; &amp;lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14339/&quot;&amp;gt;&amp;lt;code&amp;gt;-Q&amp;lt;/code&amp;gt;&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200899&quot;&amp;gt;13&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;4.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Kevin Cruijssen&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/DennisMitchell/jellylanguage/wiki&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Jelly&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200883&quot;&amp;gt;13&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;6.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Jonathan Allan&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/barbuz/Husk&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Husk&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200900&quot;&amp;gt;14&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;7.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Expired Data&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/Adriandmen/05AB1E&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;05AB1E&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200864&quot;&amp;gt;17&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;8.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;ar4093&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/isaacg1/pyth&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Pyth&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200964&quot;&amp;gt;20&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;*9.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Bubbler&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;http://jsoftware.com/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;J&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200898&quot;&amp;gt;47&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;*10.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;J42161217&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.wolfram.com/wolframscript/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Wolfram Language (Mathematica)&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200874&quot;&amp;gt;63&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;11.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Robin Ryder&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.r-project.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;R&amp;lt;/a&amp;gt; (with partitions library)&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200924&quot;&amp;gt;86&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;12.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Neil&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://github.com/somebody1234/Charcoal&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Charcoal&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200916&quot;&amp;gt;95&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;13.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Christian Sievers&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://www.gap-system.org/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;GAP&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200914&quot;&amp;gt;105&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;14.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Surculose Sputum&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://docs.python.org/3/&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;Python 3&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200881&quot;&amp;gt;112&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;15.&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;Arnauld&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;JavaScript (ES6)&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/a/200867&quot;&amp;gt;141&amp;lt;/a&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&amp;lt;/tbody&amp;gt; &amp;lt;/table&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="75323" LastActivityDate="2020-03-15T12:10:39.210" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18696" PostTypeId="2" ParentId="2140" CreationDate="2020-03-16T13:48:05.967" Score="3" Body="&lt;h2&gt;Pendulum Encoding &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot;&gt;sorting&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an array as an input (which can be any acceptable/convenient format in your language), implement pendulum encoding.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;How do I do that?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The current &lt;strong&gt;iteration index&lt;/strong&gt; starts at &lt;code&gt;0&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the iteration index is even, append the current item onto the output list.&lt;/li&gt;&#xA;&lt;li&gt;If the iteration index is odd, prepend the current item onto the output list.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;An example&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;The input is [a b c d e f g].&#xA;Note that the letters a-g are atoms, to prevent confusion from the iteration index.&#xA;N: the iteration index&#xA;&#xA;N:0 Out:      [a]&#xA;N:1 Out:    [b a]&#xA;N:2 Out:    [b a c]&#xA;N:3 Out:  [d b a c]&#xA;N:4 Out:  [d b a c e]&#xA;N:5 Out:[f d b a c e]&#xA;N:6 Out:[f d b a c e g]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The output should be &lt;code&gt;[f d b a c e g]&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Another example&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;The input is [u d l n u e m p].&#xA;&#xA;N:0 Out:        [u]&#xA;N:1 Out:      [d u]&#xA;N:2 Out:      [d u l]&#xA;N:3 Out:    [n d u l]&#xA;N:4 Out:    [n d u l u]&#xA;N:5 Out:  [e n d u l u]&#xA;N:6 Out:  [e n d u l u m]&#xA;N:7 Out:[p e n d u l u m]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##lVLNaoQwEL77FHNZMBhl22OXLeToZdmjyxJK6o5LQKONkV767naibbQUSp1LyMz3MzMJ2lqZe4p9aXXnxjHq0NyGemjiq@QgOLwwSJ9BHKJV5fJRzMXcFyOg2IFun96tdhgLxpeUqeOvq66mw0cOFht4hOMR9l59B6Lz6llA@Ah@BXlBksD1Qq45JPDADgHp7ICzxtni3yLE9zLiW2QCToxltiJMtGLSKvaMUI3ShvYSIGHkZTWKv/KS3zjyit8lY/znDn4T5Lpb@AdBya2EuSW5hSA3OyjyIB@5JmT0KqfWpIPRb/RKDnuXlqpHqGzb0B@gZO@ycfwE&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt;'s a sample program doing this encoding.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Take note that the atoms in the list aren't always unique.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[a,b,c,d,e,f,g]   -&amp;gt; [f,d,b,a,c,e,g]&#xA;[]                -&amp;gt; []&#xA;[a]               -&amp;gt; [a]&#xA;[a,b,c,d]         -&amp;gt; [d,b,a,c]&#xA;[a,b]             -&amp;gt; [b,a]&#xA;[a,b,d]           -&amp;gt; [b,a,d]&#xA;[a,b,a,c,b,c]     -&amp;gt; [c,c,b,a,a,b]&#xA;[a,a,b,b,c,c]     -&amp;gt; [c,b,a,a,b,c]&#xA;[u,d,l,n,u,e,m,p] -&amp;gt; [p,e,n,d,u,l,u,m]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-03-21T09:16:21.483" LastActivityDate="2020-03-21T09:16:21.483" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18699" PostTypeId="2" ParentId="2140" CreationDate="2020-03-17T08:31:49.363" Score="1" Body="&lt;h2&gt;Golf yourself a &lt;em&gt;real&lt;/em&gt; calculator [draft] &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;We will only cover the characters(&lt;code&gt;0123456789+-*/=%√±&lt;/code&gt;) in our tutorial.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;The &lt;code&gt;=&lt;/code&gt; operations&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Unlike most desktop calculators, our household calculator is a &lt;em&gt;tacit&lt;/em&gt; language. Therefore it is able to do a lot more than other infix calculators.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Take a simple calculation as an example. The non-scientific calculator does not have the exponentiation operator. What do you do to calculate 2^5?&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2*2====&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;However, there's a shortcut for doing that. Since 2 is already in the expression buffer, you can simply do&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2*====&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The calculator automatically fills in the current expression during the inputting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here is a demonstration of how this works:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(A template for easy copy&amp;amp;paste.&#xA;&#xA;Pressed Key      : &#xA;Expression buffer: &#xA;Output buffer    : &#xA;)&#xA;&#xA;Pressed Key      : 2&#xA;Expression buffer: 2&#xA;Output buffer    : 2&#xA;&#xA;Pressed Key      : *&#xA;Expression buffer: 2 *&#xA;Output buffer    : 2&#xA;&#xA;Pressed Key      : =&#xA;Expression buffer: * 2&#xA;Output buffer    : 4&#xA;&#xA;Pressed Key      : =&#xA;Expression buffer: * 2&#xA;Output buffer    : 8&#xA;&#xA;Pressed Key      : =&#xA;Expression buffer: * 2&#xA;Output buffer    : 16&#xA;&#xA;Pressed Key      : =&#xA;Expression buffer: * 2&#xA;Output buffer    : 32&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Implicit 0 before calculation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Suppose you enterede the following expression:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;*1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Now, don't get me wrong, the household calculator of course doesn't have pointers. So, why doesn't it raise a syntax error though? (The output is &lt;code&gt;0&lt;/code&gt; by the way.) Here's why.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;The calculator initially has the expression starting at &lt;code&gt;0&lt;/code&gt;, therefore it prepends a 0 to the expression. Therefore the full form of our expression is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0*1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;h2&gt;What we've learned so far&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The output buffer is a part of the calculator storing the latest-evaluated integer. All entered numbers get appended to the output buffer as well as the expression buffer.&lt;/li&gt;&#xA;&lt;li&gt;The expression buffer is a part of the calculator storing the latest instruction. After a &lt;code&gt;=&lt;/code&gt; operator, it stores the latest applied expression for later application.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;code&gt;=&lt;/code&gt; operator tries to evaluate the instruction buffer. If that's a syntax error, it tries to evaluate that concatenated the output buffer. If that still fails, it tries to evaluate the output buffer concatenated with the instruction buffer. After that operation, the expression starting from the newest-entered dyadic operator is saved in the expression buffer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-03-17T09:35:54.240" LastActivityDate="2020-03-17T09:35:54.240" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18706" PostTypeId="2" ParentId="2140" CreationDate="2020-03-19T16:59:07.240" Score="0" Body="&lt;h1&gt;Dilapidated art gallery problem&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In a typical art gallery problem, the objective is to place as few guards as necessary inside an arbitrary polygon so that all of it is visible by some guard. This time, we'll make some changes to simplify the task:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The gallery can only afford to pay one guard. No more. This means that it won't be possible to keep everything in sight, so the objective becomes to maximize the amount of art visible.&lt;/li&gt;&#xA;&lt;li&gt;Not even a dilapidated art gallery is barbaric enough to put art on the floor, and they don't have enough money to afford pedestals, so we only care about how much wall area is visible. &lt;/li&gt;&#xA;&lt;li&gt;Since the art gallery doesn't even have a roof, the whole floor is visible anyways. If you are wondering how the guard manages to hover high above the gallery - he doesn't. He has a telescopic camera tied to a weather balloon. There. Problem solved. Therefore, what counts for visibility isn't occlusion. The only thing that matters is that the walls are facing the right way.&lt;/li&gt;&#xA;&lt;li&gt;You can assume the floor plan is a (not necessarily connected) union of rectangles. I was thinking about including diagonal walls, but this version fits better with the theme. Any internal walls have a definite thickness. If they didn't, you could just ignore them, and that's no good.&lt;/li&gt;&#xA;&lt;li&gt;The guard doesn't have to be inside the gallery. They can sit outside, or even lean against the walls. You, however, cannot place the guard with infinite precision. If you try to align the guard with one of the walls, they will be displaced infinitesimally in one direction chosen with uniform probability. But yes, you can try.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The input will consists of the following characters:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The space character represents 1m x 1m of empty space. It's up to you to decide if it's inside the gallery, or outside. You may assume that the input encodes a rectangular area that includes all of the gallery floor and that all of the walls are depicted.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;-&lt;/code&gt; and &lt;code&gt;|&lt;/code&gt; represent 1m x 1m squares with walls (east-west and north-south respectively) passing through their centers. Each wall will be adjoined by either the same type of wall or a corner in its lengthwise direction, and empty space in its transverse direction.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;+&lt;/code&gt; Represents a corner. Each corner will be adjoined by an east-west wall either on its east side or on its west side, but not both, and by a north-south wall either on its north side or its south side, but not both, and by empty space on the remaining two sides, and in all four diagonally neighboring tiles.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your objective is to determine and mark all guard locations - tile centers - that maximize the number of wall segments viewed from the correct side - empty space should be marked with &lt;code&gt;.&lt;/code&gt; and wall tiles should be marked with &lt;code&gt;#&lt;/code&gt;.&lt;br&gt;&#xA;In the event that none of the optimal spots align with tile centers, do not mark any tile as optimal. It is the user's responsibility to provide a more detailed floor plan. You may optionally display an error message in that case. If you choose so, the error message must be: displayed in every situation in which no optimal tile would have been marked; same for every input that causes it to be shown; includes at one character not allowed in any valid output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example cases:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+----+    +----+&#xA;|    |    |....|&#xA;|    | =&amp;gt; |....|&#xA;|    |    |....|&#xA;+----+    +----+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The guard can be anywhere inside the gallery, but they can't lean against the wall because they might suddenly find themself on the other side of that wall unexpectedly.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+---+        +---+    &#xA;|   |        |   |  . &#xA;+---+ +-+    +---+ +-+&#xA;      | | =&amp;gt;       | |&#xA;      | |          | |&#xA;      | |          | |&#xA;      +-+          +-+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In this case, the gallery consists of two separate buildings, and the guard's best spot lies outside either of them. &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+---+&#xA;|   |&#xA;|   +-+ =&amp;gt; error&#xA;+-+   |&#xA;  |   |&#xA;  +---+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In this case, there is a 1m x 2m area in which the guard can see all of the walls, but there's no way to depict that in the output. You may pass the input unmodified,  or you may output an error message.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+-----+    +-----+&#xA;|     |    |.   .|&#xA;| +-+ |    | +-+ |&#xA;| | | | =&amp;gt; | | | |&#xA;| +-+ |    | +-+ |&#xA;|     |    |.   .|&#xA;+-----+    +-----+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This art gallery has a courtyard. Two inner walls must be left unprotected, but it doesn't matter which ones.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;  +-+          +-+    &#xA;  | |         .#.#... &#xA;  +-+ +-+     .###.##+&#xA;      | |     .....#.|&#xA;+-+   +-+ =&amp;gt; +##...##+&#xA;| |          |.#..... &#xA;+-+ +-+      +##.###. &#xA;    | |       ...#.#. &#xA;    +-+          +-+  &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For every wall but four, there is another wall such that exactly one of the two can be seen at any given time. As long as the other four walls are guarded, the number of walls guarded is maximized. This is also one of the rare cases where the guard can lean against a wall - if they fall through, they'll wind up guarding another wall instead.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+-------------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is not an art gallery. It's a fence with no inside or outside. Invalid input.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+---+-+---+   +&#xA;|   | |   |   |&#xA;|   | |   |   +&#xA;+---+-+---+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You might think this depicts two rooms with an internal wall, or three rooms with two internal walls - either way, internal walls are banned. Also, fences are banned. Invalid input.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+---+ +--+ +-+&#xA;|   | |  ++| |&#xA;|   +-+   |+-+&#xA;+---------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This building has a clear interior and exterior, but the southern corridor is too narrow, the dent in the north-east corner is too jagged to leave enough room for art, and the nearby closet is too close to the main building. Each of these reasons suffices to make this an invalid input.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;|---------+&#xA;| +-+     |&#xA;|    *a k |&#xA;| ei 32A  |&#xA;+-+++-+--++&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There's a gap in the northwest corner, debris all over the floor, and the southern wall has exposed scaffolding. All wrong.&lt;/p&gt;&#xA;" OwnerUserId="7209" LastActivityDate="2020-03-19T16:59:07.240" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18707" PostTypeId="2" ParentId="2140" CreationDate="2020-03-19T18:10:15.053" Score="0" Body="&lt;h1&gt;For How Long am I Alone? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&lt;p&gt;You are a factory worker, whose shift is from time &lt;em&gt;X&lt;/em&gt; to time &lt;em&gt;Y&lt;/em&gt;. It's a very boring job, and you want to know if any other workers are working during your shift. Given a list of start and end times for the other workers and your own shift time, output the longest amount of time that you are the only one working in the factory.&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;List of start and end times. Any reasonable format is allowed, such as a list of tuples representing &lt;code&gt;(startHour, startMinutes, endHour, endMinutes)&lt;/code&gt; or a list of date objects.&lt;/p&gt;&#xA;&lt;p&gt;A pair of times, which represent your own start and end times. These may be received as a tuple/list or as separate arguments. Again, the times can be passed as a tuple, date objects, or two object array representing &lt;code&gt;(hour, minutes)&lt;/code&gt;, or you can pass the hours and minutes as separate arguments.&lt;/p&gt;&#xA;&lt;p&gt;Each person starts working precisely at their start time and gets off work right when the end time starts. For example, if someone is working from 8:00 to 17:00, at 17:00 they are not considered to be at work anymore.&lt;/p&gt;&#xA;&lt;p&gt;Each person does his shift 7 days a week.&lt;/p&gt;&#xA;&lt;p&gt;If you choose to use date objects, the &amp;quot;Year&amp;quot; field of the date objects must always be the same across all inputs.&lt;/p&gt;&#xA;&lt;p&gt;Note that the end time of your shift can look like it's earlier than your start time, e.g. &lt;code&gt;21:30&lt;/code&gt; - &lt;code&gt;5:30&lt;/code&gt;. This means that your shift starts at &lt;code&gt;21:30&lt;/code&gt; at the first day and ends at &lt;code&gt;5:30&lt;/code&gt; on the next day.&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;The longest interval in minutes in which you are the only one working in the factory.&lt;/p&gt;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&lt;p&gt;In the form of &lt;code&gt;[(hh:mm,hh:mm)...], hh:mm, hh:mm&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[(3:30, 12:00), (13:00, 21:40)], (8:30), (16:30) -&amp;gt; 60&#xA;[(1:01, 1:03), (1:04, 1:06), (1:07, 1:10)], (1:00), (1:10) -&amp;gt; 1&#xA;[(21:00, 5:00), (22:30, 7:00)], (0:00), (4:00) -&amp;gt; 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Questions&lt;/h1&gt;&#xA;&lt;p&gt;Should I keep the part about the shift being able to stretch across midnight?&lt;/p&gt;&#xA;&lt;p&gt;Is the input specification clear enough?&lt;/p&gt;&#xA;&lt;p&gt;Any suggestions welcome.&lt;/p&gt;&#xA;" OwnerUserId="84206" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-03-21T00:41:35.240" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18708" PostTypeId="1" CreationDate="2020-03-20T13:07:11.427" Score="5" ViewCount="139" Body="&lt;p&gt;I looked around and it seems that the language is defined by the compiler not operational semantics. In normal code golf new languages are banned because of the loophole of implementing the answer as a compiler entry to empty text. This renders answers as non-competing and are often seen as worth deleting as non-competing often means this or failing to meet the specification.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Is it allowed to post non-competing fastest-code solutions where I look into the problem and see how the compiler is failing me then adjust it?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To me trivial languages in fastest-code do not exist as the best possible answer is going to be in hardcoded machine code, in that case I would just be posting machine code. By compiler optimisations I mean possibly vectorisation, garbage collection, dead-code elimination, fusion etc... not hardcoding.&lt;/p&gt;&#xA;" OwnerUserId="67709" LastEditorUserId="75323" LastEditDate="2020-03-20T15:58:06.897" LastActivityDate="2020-03-21T15:43:02.580" Title="For fastest-code questions are new compiler optimisations as non-competing allowed?" Tags="|discussion|policy|answers|languages|noncompeting|" AnswerCount="0" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18711" PostTypeId="2" ParentId="2140" CreationDate="2020-03-22T14:25:03.720" Score="1" Body="&lt;h1&gt;Is this a Freeman Dyson Number?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Background&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From this &lt;a href=&quot;https://www.popularmechanics.com/science/math/a31153757/riddles-brain-teasers-logic-puzzles/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Popular Mechanics article&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;One day, in a gathering of top scientists, one of them wondered out&#xA;  loud whether there exists an integer that you could exactly double by&#xA;  moving its last digit to its front. For instance, 265 would satisfy&#xA;  this if 526 were its exact double – which it isn’t. After apparently&#xA;  just five seconds, Dyson responded, “Of course there is, but the&#xA;  smallest such number has 18 digits.”&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&#xA;Write a program that, when given a base ten number that is at least 18 digits long, moves the last digit to the front and checks if it is doubled as a result.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;I/O&lt;/strong&gt;&lt;br&gt;&#xA;Input can be any 18 (or longer) digit integer. Any leading digit must be larger than zero.&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;br&gt; The original number with the Dyson transform (last digit moved to the front) and any truthy/falsey value (if that's a digit, it must have a delimiter).&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test Cases/Sample I/O&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;111111111111111111 -&amp;gt; 111111111111111111,false&#xA;100000000000000002 -&amp;gt; 210000000000000000 **F**&#xA;123456789123456789 -&amp;gt; [912345678912345678,0]&#xA;42105263157894736842 -&amp;gt; 24210526315789473684&#xA;808080808080808080808080808016 - 680808080808080808080808080801-NO&#xA;246802468024680246802468024680246802 -&amp;gt; false224680246802468024680246802468024680&#xA;105263157894736842 -&amp;gt; true,210526315789473684&#xA;315789473684210526 -&amp;gt; (T:5315789473684210526)&#xA;26315789473684210526315789473684210 -&amp;gt; 52631578947368421052631578947368421&#xA;&#xA;etc...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes (by language) wins.&lt;/p&gt;&#xA;" OwnerUserId="81263" LastEditorUserId="81263" LastEditDate="2020-05-12T13:29:10.970" LastActivityDate="2020-05-12T13:29:10.970" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="18713" PostTypeId="1" AcceptedAnswerId="18715" CreationDate="2020-03-22T21:01:58.553" Score="11" ViewCount="506" Body="&lt;p&gt;I noticed that most, if not all of the answers on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/201508/vowels-up-consonants-down&quot;&gt;Vowels up, consonants down&lt;/a&gt; are being downvoted. I raised a mod-flag but there's only one mod and I'm guessing they're already stressed with the load of dealing with all the mod-flags and comment-flags.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Some speculation as to why this is happening:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The OP might be revenge-downvoting because their question was closed.&lt;/li&gt;&#xA;&lt;li&gt;Someone else might have been downvoting all the answers because the question was closed at one point, but that's a practice that's more commonly (if not only) seen on Stack Overflow.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;None of the answers are invalid as far as I know.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Can the person that did this come forward and explain why?&lt;/p&gt;&#xA;" OwnerUserId="89298" LastActivityDate="2020-03-23T01:48:38.513" Title="Why are all the answers here being downvoted?" Tags="|discussion|voting|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18714" PostTypeId="2" ParentId="18713" CreationDate="2020-03-23T00:02:08.197" Score="10" Body="&lt;p&gt;You shouldn't use moderator flags for this purpose -- I don't know what you expect me to do. Information about individual votes is private, even for moderators.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Presumably whoever cast these votes is unlikely to look for a meta post asking them to explain their reasoning. Since there's no way to tell what motivated this, my suggestion is to shrug and move on.&lt;/p&gt;&#xA;" OwnerUserId="3808" LastActivityDate="2020-03-23T00:02:08.197" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18715" PostTypeId="2" ParentId="18713" CreationDate="2020-03-23T01:03:54.590" Score="23" Body="&lt;p&gt;I am the person who downvoted.  I am not afraid &quot;to come forward&quot;, as many have speculated.  I don't believe that I have done anything wrong, and I am rather certain I have not broken any rules.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;So why?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The short is that I think that all those answers are bad.  I'm not interested in hurting any persons rep or feelings.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My reasoning for thinking these answers are bad varies from answer to answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But as a blanket, I think that answering questions that are clearly unclear is not answering in good faith and harms the site, that is quite clearly bad.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I also do not like low-effort fastest-guns-in-the-west type answers.  These answers to me seem to just exist to catch random upvotes on a question likely to hit the HNQ.  They don't feel like they have even earned the space to exist.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This makes questions like this a perfect storm for answers that I do not like.  The question itself is incredibly trivial, and fails to even outline the basic requirements.  Answers there already start in the red there because they encourage these sorts of lazy questions.  But a really clever answer that makes me think, &quot;wow I never would have thought of that&quot; could get out of the red even to an upvote by my metrics.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And the thing is, having read the answers, they are by in large not good.  Some of them are in my opinion so lazy that they would warrant a downvote even if they were not already encouraging bad questions.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;So why no comments?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I usually leave a comment when I think that there is something that I would change to make the thing I downvoted better.  I don't really have suggestions for these answers.  What I would like is for them to be more inventive or clever, or to not exist at all.  In short I would like them to be less bad, which is to me what a downvote says on its own.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;To me I feel that leaving comments that don't offer anything constructive can come off as vindictive or targeting. I really don't have a personal issue with anyone there, nor do I want to start any sort of argument.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Maybe I am wrong to think that I cannot be constructive here.  Maybe you can help me be more constructive.  If you know how I can do this then I am all ears.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;You are of course free to disagree with me. I am fully aware what I say is good or bad is just my personal opinion. You might think that these answers are not bad. You are free to upvote them, I'd rather you not,  I secretly like it when people agree with me, but you are free to do so.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2020-03-23T01:48:38.513" LastActivityDate="2020-03-23T01:48:38.513" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18716" PostTypeId="2" ParentId="1061" CreationDate="2020-03-23T04:52:00.427" Score="13" Body="&lt;h1&gt;Exploiting the controller in a King-of-the-Hill challenge&lt;/h1&gt;&#xA;&lt;p&gt;I'm surprised that this wasn't here before, but &lt;a href=&quot;https://codegolf.stackexchange.com/a/201559/52194&quot;&gt;this answer&lt;/a&gt; found a loophole to exploit in the KotH problem that should really be sealed off. (The rules of the challenge at time of writing only forbade using code that modifies the controller or the other bots, so the bot in question returned NaN instead knowing that the way it interacts with comparison operations would ensure that it would always be eliminated last.)&lt;/p&gt;&#xA;" OwnerUserId="52194" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-03-23T04:52:00.427" CommentCount="3" CommunityOwnedDate="2020-03-23T04:52:00.427" ContentLicense="CC BY-SA 4.0" />
  <row Id="18723" PostTypeId="2" ParentId="2140" CreationDate="2020-03-25T02:19:58.200" Score="3" Body="&lt;h2&gt;Join by intersection &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a list of strings, output these strings joined by their largest intersecting parts. Your output has to be &lt;em&gt;optimal&lt;/em&gt;. Strings &lt;em&gt;have&lt;/em&gt; to be joined in the order given.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What is an intersection anyway?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Suppose you have two strings:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;abcbc&quot; &quot;bcbcd&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You extract all suffixes of the first string, as well as all prefixes of the second string:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&quot;abcbc&quot;, &quot;bcbc&quot;, &quot;cbc&quot;, &quot;bc&quot;, &quot;c&quot;]&#xA;[&quot;bcbcd&quot;, &quot;bcbc&quot;, &quot;bcb&quot;, &quot;bc&quot;, &quot;b&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We trunctuate both of these lists to the length of the list of the smaller length (it's an identity in this current case).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Then, we find all items at the same index which are equal to the other item at the same index:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&quot;bcbc&quot;, &quot;bc&quot;]&#xA;[&quot;bcbc&quot;, &quot;bc&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We return the longest string of the output. Therefore, the intersection is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;bcbc&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;How to join two strings by the intersection&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To join by the intersection you simply&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Append the first string without the intersection to the output string&lt;/li&gt;&#xA;&lt;li&gt;Append the intersection to the output string&lt;/li&gt;&#xA;&lt;li&gt;Append the second string without the intersection to the output string&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;For example, in our example case:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;abcbc&quot; &quot;bcbcd&quot;&#xA;(The intersection is &quot;bcbc&quot;)&#xA;&#xA;Step 1. Out:&quot;a&quot;&#xA;Step 2. Out:&quot;abcbc&quot;&#xA;Step 3. Out:&quot;abcbcd&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Reducing a join over a list&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you want to reduce a join over a list&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&quot;abc&quot;,&quot;bcd&quot;,&quot;rfh&quot;,&quot;hal&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You connect them by their longest common substring:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abc&#xA; bcd&#xA;    rfh&#xA;      hal&#xA;=========&#xA;abcdrfhal&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Therefore the expected output is &lt;code&gt;abcdrfhal&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Further walkdown&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You cannot join two strings if their substring can be found in the middle. For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&quot;aXc&quot;,&quot;bXd&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If you try to match them by the middle substring:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;aXc&#xA;bXd&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You would realize that the other overlapping characters are not equal to each other. That is, &lt;code&gt;a&lt;/code&gt; is not equal to &lt;code&gt;b&lt;/code&gt;, and &lt;code&gt;c&lt;/code&gt; is not equal to &lt;code&gt;d&lt;/code&gt;. In that case you simply append the string in the join:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;aXc&#xA;   bXd&#xA;======&#xA;aXcbXd&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Likewise, if either of these strings contain each other, but isn't equal to the other string, you should simply append the string. E.g.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&quot;abcd&quot;,&quot;bc&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;would give&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abcd&#xA;    bc&#xA;======&#xA;abcdbc&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Substrings can overlap past each other. E.g.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&quot;abc&quot;,&quot;bcd&quot;,&quot;cde&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;would result in the following join:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abc&#xA; bcd&#xA;  cde&#xA;=====&#xA;abcde&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which would evidently make the output &lt;code&gt;abcde&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Strings have to overlap as much as possible. That means, in this example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&quot;abcbc&quot;,&quot;bcbcd&quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is not okay (even if they do overlap):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abcbc&#xA;   bcbcd&#xA;========&#xA;abcbcbcd&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Instead, this should be done:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abcbc&#xA; bcbcd&#xA;======&#xA;abcbcd&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The join is consecutive based on the consecutive inputs. For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;abcde&#xA;  cde&#xA;     abcde&#xA;==========&#xA;abcdeabcde&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A program is worth a thousand words. &lt;a href=&quot;https://tio.run/##jVHBboQgEL3zFRNOkLCb3WsTv6KXvQJinES0gjab/rwdlIjNmrYcRnnz5s2bAYdlaebewlsF3k3tUAutwCgGdGLn9TNlbuu1GYJABXcFGiJ@OfDYC7P@yq0gHWyEBvd879A6sREvKKGqwOzwTeGhorSqAHdUshJJMxPISykMbppDT26uVzAH@o6XftnIqiJX/iF5hm4Yk4zF2fzYTm4RE6hBT3lIuMB9a68p@@lCdC/9Zdqh07alPR6miDR4eoS0XbrJ11EIZXIhJ6LDOAmujeWKG1tTDE1LsdUdlxI@AvZT17NC9d5TehzHRA2B5@2eUUk16ybl/SFOqQ9DRPsotN9Ud6@2dn8YqFfuv1RJSwHPn@1eqMs3&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt; 's a reference implementation that I use to check the test cases.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[&quot;abc&quot;,&quot;bcd&quot;,&quot;rfh&quot;,&quot;hal&quot;] -&amp;gt; &quot;abcdrfhal&quot;&#xA;[&quot;mmm&quot;,&quot;qqq&quot;,&quot;rrr&quot;] -&amp;gt; &quot;mmmqqqrrr&quot;&#xA;[&quot;abcbc&quot;,&quot;bcbcd&quot;] -&amp;gt; &quot;abcbcd&quot;&#xA;[&quot;aXc&quot;,&quot;bXd&quot;]    -&amp;gt; &quot;aXcbXd&quot;&#xA;[&quot;abc&quot;,&quot;bcd&quot;,&quot;cde&quot;] -&amp;gt; &quot;abcde&quot;&#xA;[&quot;abcd&quot;,&quot;bc&quot;] -&amp;gt; &quot;abcdbc&quot;&#xA;[&quot;abcde&quot;, &quot;cde&quot;, &quot;abcde&quot;] -&amp;gt; &quot;abcdeabcde&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-03-26T06:56:11.797" LastActivityDate="2020-03-26T06:56:11.797" CommentCount="15" ContentLicense="CC BY-SA 4.0" />
  <row Id="18728" PostTypeId="2" ParentId="2140" CreationDate="2020-03-26T06:48:02.230" Score="2" Body="&lt;h1&gt;Excessively complicated Game of Life &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;In the excessively complicated version of the Game of Life, the world is a &lt;span class=&quot;math-container&quot;&gt;\$W \times H\$&lt;/span&gt; square torus with a grid of squares. Each square has a rulestring attached to it - by default, &lt;code&gt;B/S&lt;/code&gt;.&#xA;Each square has a dead or alive cell in it. Each alive cell is controlled by a player. Every turn, if there is not an alive cell in a square, it is born iff the part between &lt;code&gt;B&lt;/code&gt; and &lt;code&gt;/&lt;/code&gt; contains the number of alive neighbours. Every turn, if there &lt;em&gt;is&lt;/em&gt; an alive cell in a square, it survives iff the part after &lt;code&gt;S&lt;/code&gt; contains the number of alive neighbours. Cells are considered adjacent if they have a common edge or a corner. A cell is not adjacent with itself. Cells controlled by other players also count as alive neighbours.&lt;/p&gt;&#xA;&lt;p&gt;For example, normal Conway's Game of Life cells have the &lt;code&gt;B3/S23&lt;/code&gt; rulestring: cells are born if they have exactly 3 alive neighbours, and survive if they have 2 or 3.&lt;/p&gt;&#xA;&lt;p&gt;Each player starts with a &lt;code&gt;B/S012345678&lt;/code&gt; cell, placed uniformly randomly.&lt;/p&gt;&#xA;&lt;p&gt;Each cell knows a 3x3 array of numbers from &lt;span class=&quot;math-container&quot;&gt;\$-1\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt;, representing adjacent cells (including self). &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; in it means an ally cell, &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; means a dead cell, and &lt;span class=&quot;math-container&quot;&gt;\$-1\$&lt;/span&gt; means an enemy cell, and a 3x3 array of rulestrings for adjacent cells.&lt;/p&gt;&#xA;&lt;p&gt;Every turn, every cell can alter one bit of the rulestring of any adjacent square (including its own) - that is, remove or add a number from it (or, alternatively, it can do nothing).&lt;/p&gt;&#xA;&lt;p&gt;When cells are born, the player they belong to is chosen semi-randomly: the odds of the cell being assigned to a player are proportional to the number of cells they contributed to the cell's birth.&lt;/p&gt;&#xA;&lt;p&gt;A player is eliminated when all their cells die.&#xA;When &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; turns passed, or when only one player remains, the game ends. A full point is distributed between all remaining players proportionally to the number of cells they control (dead cells don't count).&lt;/p&gt;&#xA;&lt;h2&gt;Clarifications&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Rulestrings are attached to squares, not to cells. When a cell dies, the rulestring on its square is not changed.&lt;/li&gt;&#xA;&lt;li&gt;No cell can be born with zero alive adjacent cells (that is, rulestrings cannot start with &lt;code&gt;B0&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;When multiple cells attempt to alter the same bit in a rulestring, it is only affected once.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Define a pure function &lt;span class=&quot;math-container&quot;&gt;\$(nearbyStates, nearbyRules)\to(\Delta x, \Delta y, index)\$&lt;/span&gt; to be used as the algorithm for your cells. To do nothing, output an index of 0.&lt;/p&gt;&#xA;&lt;p&gt;Otherwise, an index of 1 corresponds to toggling &lt;code&gt;B1&lt;/code&gt;, 2 to &lt;code&gt;B2&lt;/code&gt; and so on until &lt;code&gt;B8&lt;/code&gt;, the index 9 is skipped, then an index of 10 corresponds to toggling &lt;code&gt;S0&lt;/code&gt;, 11 to &lt;code&gt;S1&lt;/code&gt; and so on until &lt;code&gt;S8&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Winning criterion&lt;/h2&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt; games are run, and the leaderboard is formed by sorting participants by the total number of points.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, so whoever wins wins!&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox stuff&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a good idea?&lt;/li&gt;&#xA;&lt;li&gt;Is the description of the game clear?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I think I decided that the language for submissions will be Javascript. Now I have to write a controller.&lt;/p&gt;&#xA;&lt;p&gt;Besides the obvious Javascript option, I am considering C++ with a Javascript engine (probably V8). This can multiply the performance by &lt;span class=&quot;math-container&quot;&gt;\$\%NUMBER\_OF\_PROCESSORS\% \cdot \frac{cppPerformance}{jsPerformance} \cdot \frac{myC++skill}{myJSskill}\$&lt;/span&gt;, which can be quite large. Unfortunately, that might also muptiply the challenge's popularity by &lt;span class=&quot;math-container&quot;&gt;\$\frac{webBrowserLoadingSpeed}{programInstallationSpeed}\$&lt;/span&gt;, which can be quite small! Would that be a good idea?&lt;/p&gt;&#xA;" OwnerUserId="36445" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-03-29T11:49:14.907" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18729" PostTypeId="2" ParentId="2140" CreationDate="2020-03-26T14:43:51.923" Score="0" Body="&lt;h1&gt;Ordinal to Cardinal&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a positive integer represented as the English spelling of an ordinal number, return the equivalent cardinal number.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Where an integer requires multiple words to spell, only the last word changes.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The following integers are strongly irregular:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&quot;one&quot; becomes &quot;first&quot;&lt;/li&gt;&#xA;&lt;li&gt;&quot;two&quot; becomes &quot;second&quot;&lt;/li&gt;&#xA;&lt;li&gt;&quot;three&quot; becomes &quot;third&quot;&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Other integers take a suffix of &quot;th&quot;, however there are a few integers that are weakly irregular:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&quot;five&quot; becomes &quot;fif(th)&quot;&lt;/li&gt;&#xA;&lt;li&gt;&quot;eight&quot; becomes &quot;eigh(th)&quot;&lt;/li&gt;&#xA;&lt;li&gt;&quot;nine&quot; becomes &quot;nin(th)&quot;&lt;/li&gt;&#xA;&lt;li&gt;&quot;twelve&quot; becomes &quot;twelf(th)&quot;&lt;/li&gt;&#xA;&lt;li&gt;&quot;twenty&quot; to &quot;ninety&quot; become &quot;twentie(th)&quot; to &quot;ninetie(th)&quot;.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The input can be assumed to be the English spelling of an ordinal number that follows the above rules to transform it into the equivalent cardinal number.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&quot;one hundred and nineteen&quot; becomes &quot;one hundred and nineteenth&quot;&lt;/li&gt;&#xA;&lt;li&gt;&quot;one hundred and twenty&quot; becomes &quot;one hundred and twentieth&quot;&lt;/li&gt;&#xA;&lt;li&gt;&quot;one hundred and twenty one&quot; becomes &quot;one hundred and twenty first&quot;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2020-03-28T01:06:49.973" LastActivityDate="2020-03-28T01:06:49.973" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="18730" PostTypeId="2" ParentId="2140" CreationDate="2020-03-27T05:01:06.447" Score="1" Body="&lt;h1&gt;RRE numbers &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a single floating-point number (which can potentially be taken as a string), output whether this decimal is an RRE number.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;RRE complement for the input number&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Say your input is &lt;code&gt;3.14&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;em&gt;Replace&lt;/em&gt; the decimal point by the fraction bar. &lt;code&gt;3/14&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Reciprocal&lt;/em&gt; the fraction. &lt;code&gt;14/3&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Evaluate&lt;/em&gt; the fraction. &lt;code&gt;4.666...&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Round the decimal point to the same length as the input. &lt;code&gt;4.67&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;If the absolute difference between the input and the output is below 2, it's an RRE number. Otherwise, it isn't an RRE number.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Specification&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Programs are allowed to give wrong output if the absolute difference is very close to 2.&lt;/li&gt;&#xA;&lt;li&gt;The integral part of the decimal is &lt;em&gt;always&lt;/em&gt; nonzero.&lt;/li&gt;&#xA;&lt;li&gt;Truthy/Falsy outputs follows the language's convention, or exactly one value for truthy and another for falsy.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##ZY7BDoIwEETvfEXTC20iKy1wkOiXGA8YSsSQliyLwa@vRQ8YOqfNm5ndHd/0cLbwvjUdQzRikXXCgpBd2ALTOPQkOHD5hRSgeTWDSI8pPF1vBV7rOlM3ufnoZtsKOgxmdTcPDc1oWXOfRDe4hsKl7DeQlGedJCP2lsT6A1eQ81D7IxpOO1KAKneoykFXuYqqUTCgVfHG/UIFShcxrKIbZQgG5v0H&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt; is a sample program I use to generate the test cases.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1.0     -&amp;gt; True&#xA;2.9     -&amp;gt; True&#xA;3.14    -&amp;gt; True&#xA;50.2501 -&amp;gt; True&#xA;2.14    -&amp;gt; False&#xA;2.11111 -&amp;gt; False&#xA;3.1     -&amp;gt; False&#xA;51.123  -&amp;gt; False&#xA;51.51   -&amp;gt; False&#xA;24.12   -&amp;gt; False&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-03-27T06:40:41.573" LastActivityDate="2020-03-27T06:40:41.573" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18733" PostTypeId="2" ParentId="2140" CreationDate="2020-03-28T02:59:03.020" Score="4" Body="&lt;h2&gt;Is it a Happy Number? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A repost of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2245/find-whether-a-number-is-happy-or-not&quot;&gt;this&lt;/a&gt; challenge (if I got the policy right).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a single &lt;em&gt;positive&lt;/em&gt; integer (which can also be taken as a list of digits or a string), output whether the number terminates at 1 . Truthy/falsy follows the language's convention, or you can choose exactly one value for truthy and another for falsy. (This sequence is &lt;a href=&quot;https://oeis.org/A007770&quot; rel=&quot;nofollow noreferrer&quot;&gt;A007770&lt;/a&gt;.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program should theoretically support all non-negative integers; however, if your language doesn't support unbounded integers, you may only support integers up to &lt;code&gt;2147483647&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Procedure&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Suppose you have the number &lt;code&gt;193&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Square every individual digit in the number. Therefore the number's individual digits becomes:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1] [81] [9]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Sum all these individual digits:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;92&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Repeat this procedure until it stabilizes at &lt;code&gt;1&lt;/code&gt; or a 37-cycle like the following:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;37-58-89-145-42-20-4-16-37&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;It has been shown that the procedure will always produce either one of these two outputs.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##PYxBCsIwFET3OcXQVQJxUVxIhXgCceMJIk31S5PUnwR6@5hacBZ/hvnMo1hrSoyzgXf5FUe5aoEmmuRqTI/IaH487e0mdrlwwPor1O82glxh0z0zhWcLV0oZ3i7SplvxD8dIn2LZjQqpeCWUmCJL0ug1hmFnz20j6U/RHQ4XdHpjk4Ix6BXekQKW9s5zEKrWLw&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt; is a sample program generating the test cases. &lt;a href=&quot;https://tio.run/##VY5NCsMgEIX3OcUjKwU3oYuSgjco3fQElph2StR0VPD2qTFQ6FvMz2Pmm6GwbTEyLhrOpleYRFEdqgpWJp8W3zqaRdF6QGDUfDofM7vYpswepRmyxcoTBSbeUyU8a3GlmODMKky8ZfewjPjJhu0kEbOTnezmwIIUBoVxPNhL3RG93tUr0A@n0Mxe4h3I/z2536VK27Yv&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt; is a step by step reduction of all input between 1 and 100.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 -&amp;gt; true&#xA;2 -&amp;gt; false&#xA;3 -&amp;gt; false&#xA;4 -&amp;gt; false&#xA;5 -&amp;gt; false&#xA;6 -&amp;gt; false&#xA;7 -&amp;gt; true&#xA;8 -&amp;gt; false&#xA;9 -&amp;gt; false&#xA;10 -&amp;gt; true&#xA;11 -&amp;gt; false&#xA;12 -&amp;gt; false&#xA;13 -&amp;gt; true&#xA;14 -&amp;gt; false&#xA;15 -&amp;gt; false&#xA;16 -&amp;gt; false&#xA;17 -&amp;gt; false&#xA;18 -&amp;gt; false&#xA;19 -&amp;gt; true&#xA;20 -&amp;gt; false&#xA;21 -&amp;gt; false&#xA;22 -&amp;gt; false&#xA;23 -&amp;gt; true&#xA;24 -&amp;gt; false&#xA;25 -&amp;gt; false&#xA;26 -&amp;gt; false&#xA;27 -&amp;gt; false&#xA;28 -&amp;gt; true&#xA;29 -&amp;gt; false&#xA;30 -&amp;gt; false&#xA;31 -&amp;gt; true&#xA;32 -&amp;gt; true&#xA;33 -&amp;gt; false&#xA;34 -&amp;gt; false&#xA;35 -&amp;gt; false&#xA;36 -&amp;gt; false&#xA;37 -&amp;gt; false&#xA;38 -&amp;gt; false&#xA;39 -&amp;gt; false&#xA;40 -&amp;gt; false&#xA;41 -&amp;gt; false&#xA;42 -&amp;gt; false&#xA;43 -&amp;gt; false&#xA;44 -&amp;gt; true&#xA;45 -&amp;gt; false&#xA;46 -&amp;gt; false&#xA;47 -&amp;gt; false&#xA;48 -&amp;gt; false&#xA;49 -&amp;gt; true&#xA;50 -&amp;gt; false&#xA;51 -&amp;gt; false&#xA;52 -&amp;gt; false&#xA;53 -&amp;gt; false&#xA;54 -&amp;gt; false&#xA;55 -&amp;gt; false&#xA;56 -&amp;gt; false&#xA;57 -&amp;gt; false&#xA;58 -&amp;gt; false&#xA;59 -&amp;gt; false&#xA;60 -&amp;gt; false&#xA;61 -&amp;gt; false&#xA;62 -&amp;gt; false&#xA;63 -&amp;gt; false&#xA;64 -&amp;gt; false&#xA;65 -&amp;gt; false&#xA;66 -&amp;gt; false&#xA;67 -&amp;gt; false&#xA;68 -&amp;gt; true&#xA;69 -&amp;gt; false&#xA;70 -&amp;gt; true&#xA;71 -&amp;gt; false&#xA;72 -&amp;gt; false&#xA;73 -&amp;gt; false&#xA;74 -&amp;gt; false&#xA;75 -&amp;gt; false&#xA;76 -&amp;gt; false&#xA;77 -&amp;gt; false&#xA;78 -&amp;gt; false&#xA;79 -&amp;gt; true&#xA;80 -&amp;gt; false&#xA;81 -&amp;gt; false&#xA;82 -&amp;gt; true&#xA;83 -&amp;gt; false&#xA;84 -&amp;gt; false&#xA;85 -&amp;gt; false&#xA;86 -&amp;gt; true&#xA;87 -&amp;gt; false&#xA;88 -&amp;gt; false&#xA;89 -&amp;gt; false&#xA;90 -&amp;gt; false&#xA;91 -&amp;gt; true&#xA;92 -&amp;gt; false&#xA;93 -&amp;gt; false&#xA;94 -&amp;gt; true&#xA;95 -&amp;gt; false&#xA;96 -&amp;gt; false&#xA;97 -&amp;gt; true&#xA;98 -&amp;gt; false&#xA;99 -&amp;gt; false&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-03-30T10:42:34.520" LastActivityDate="2020-03-30T10:42:34.520" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="18734" PostTypeId="2" ParentId="2140" CreationDate="2020-03-28T09:47:23.590" Score="1" Body="&lt;h1&gt;Modify The Stack &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stack&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stack&amp;#39;&quot; rel=&quot;tag&quot;&gt;stack&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/203252/modify-the-stack&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2020-04-10T11:59:24.967" LastActivityDate="2020-04-10T11:59:24.967" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18737" PostTypeId="2" ParentId="2140" CreationDate="2020-03-30T12:32:56.890" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/203563/9481&quot;&gt;Bit delivery in Bin City&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary&amp;#39;&quot; rel=&quot;tag&quot;&gt;binary&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;posted&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="9481" LastEditorUserId="9481" LastEditDate="2020-09-28T15:15:01.580" LastActivityDate="2020-09-28T15:15:01.580" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18738" PostTypeId="1" AcceptedAnswerId="18743" CreationDate="2020-03-31T00:48:44.140" Score="6" ViewCount="142" Body="&lt;p&gt;After many long years, the thrilling dark mode for &lt;em&gt;Stack Overflow&lt;/em&gt; has just been &lt;a href=&quot;https://stackoverflow.blog/2020/03/30/introducing-dark-mode-for-stack-overflow/?cb=1&quot;&gt;released&lt;/a&gt;! However, it's not everywhere and this cryptic paragraph is all we have regarding that decision: &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;For now, we have no plans to bring dark mode to the many sites across the Stack Exchange network. Many of the designs on our sites have been around long enough that converting them to dark mode would require redoing the artwork completely. We would prefer to avoid giving anyone across our network a substandard experience and we don’t want to change those elements without the input of these communities. &lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Now, I'm not asking this on &lt;em&gt;Stack Exchange Meta&lt;/em&gt;, because it makes sense to me for most other flavors of &lt;em&gt;SE&lt;/em&gt;, eg &lt;em&gt;Seasoned Advice&lt;/em&gt; for cooking. They have their own cover artwork and aesthetic, and the majority of users likely haven't developed a taste (pun intended) for dark modes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, as far as I can see, our layout is the same as &lt;em&gt;SO&lt;/em&gt;'s and shouldn't require re-working anything. And I can only imagine that as many people would welcome the feature here as did on &lt;em&gt;SO&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Curious to hear what, if anything, is keeping &lt;em&gt;Code Golf&lt;/em&gt; moderators from pulling the UI changes here. If nothing else, the internal 'politics' of &lt;em&gt;SE&lt;/em&gt; are starting to intrigue me; I never realized the different communities were so fractured and independent!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&#xA;Note: Would normally show some evidence of research and effort, but I didn't know where to start  looking for answers with this one. Also, am unclear on whether this falls within the scope of questions here or whether it's better warranted elsewhere. Please do let me know! &lt;/p&gt;&#xA;" OwnerUserId="87594" LastEditorUserId="68942" LastEditDate="2021-06-01T19:38:24.043" LastActivityDate="2021-06-01T19:38:24.043" Title="Dark Mode Coming Here?" Tags="|feature-request|status-declined|site-design|stackexchange|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18739" PostTypeId="1" CreationDate="2020-03-31T01:57:24.067" Score="21" ViewCount="322" Body="&lt;p&gt;While to-be-posted challenges get feedback in the Sandbox (ideally), we don't usually reflect on challenges after they have run. And while issues and ambiguities in challenges do get pointed out, we rarely talk about what worked well in a challenge, or draw deeper lessons. I think doing so would help us become better challenge writers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This thread is for &lt;a href=&quot;https://en.wikipedia.org/wiki/Postmortem_documentation&quot; rel=&quot;nofollow noreferrer&quot;&gt;post-mortems&lt;/a&gt; on your own challenges after they seem to be mostly done getting answers. Or, others' challenges, if they ask for it.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2020-04-02T20:12:59.553" Title="Challenge post-mortems" Tags="|discussion|challenge-quality|" AnswerCount="7" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="18740" PostTypeId="2" ParentId="18739" CreationDate="2020-03-31T02:00:00.440" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/200761/error-correct-text&quot;&gt;Error-correct text&lt;/a&gt; by xnor&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I really like this concept, though Arnauld deserves credit for &lt;a href=&quot;https://codegolf.stackexchange.com/q/160427/20260&quot;&gt;doing it first&lt;/a&gt;. I'm charmed at a code golf challenge having a fixed output while the input varies.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The try-everything-and-check-hash method of the initial answers took me totally by surprise. I really should have seen it coming. While I appreciate its brazen effectiveness, I was worried it was too golfy while being too generic, so I was glad when later answers came up with inventive custom schemes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In retrospect, it might have been better to require or allow answers to output the position and character of the fix, which &lt;a href=&quot;https://codegolf.stackexchange.com/q/160427/20260&quot;&gt;Arnauld's older challenge&lt;/a&gt; had as an option. That way solutions that locate the error aren't saddled with an extra step of producing the corrected text over solutions that enumerate potential texts. I found that this step consumed many bytes where I wrote &lt;a href=&quot;https://codegolf.stackexchange.com/a/201032/20260&quot;&gt;my Python answer&lt;/a&gt;. On the other hand, this change would dampen the thematic purity of a fixed text as output.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I posted a bounty to encourage looking for new techniques, but unfortunately no new solutions did so. Maybe there's not really anything further, and I at least haven't thought of anything better. I wonder if having a longer text would have encouraged more sophisticated methods. Perhaps restricting errors to preserve letter case would have helped somehow.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I like how the challenge is very open to designing your own method to solve it. This use of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/error-correction&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;error-correction&amp;#39;&quot; rel=&quot;tag&quot;&gt;error-correction&lt;/a&gt; makes for a weird and mind-bending twist on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; where your code already has basically the whole output given to it. The challenge being &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; means trade-offs between the checksum/hash size versus the code size, which I think is interesting for an algorithmic challenge. I think there's room for further challenges exploring this kind of thing.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2020-03-31T08:51:09.603" LastActivityDate="2020-03-31T08:51:09.603" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18741" PostTypeId="2" ParentId="18739" CreationDate="2020-03-31T02:27:56.447" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/200707/20260&quot;&gt;Mad Libs number sequences&lt;/a&gt; by xnor&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I was really worried about this one. I think it worked out well, but only because I got lucky and solvers were inventive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A challenge stapling together unrelated challenges is a bad idea. Even worse is if those sub-challenges are intentionally generic and overdone. The spec needs to be long and complicated to include both the &quot;frame challenge&quot; and the sub-challenges with their technicalities.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Gosh, I didn't even Sandbox it. What a disaster waiting to happen. Sure, the concept is cute, but would solvers enjoy it? Would anyone even answer?&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Inspiration&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I had thought of a question like this for a while. My original motivation was to parody a common strain of overdone challenges that used to plague the site. I considered making such a question as a mostly-joking dupe target for them. Perhaps by the time I posted it, many users who weren't around then didn't get the &quot;reference&quot;, which suggests I should have posted this challenge years ago when I first thought of the idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I tried to get across the satirical humor in the challenge but I was worried that my initial attempts seemed too mean, and that someone could interpret it as making fun of their challenge in particular, so I backed off. Still, I feel like I missed an opportunity to lean into the absurdity. Like, if the main appeal of a challenge is that the idea is witty, that humor better actually come across. It's unusual for me to write a thematic challenge like this, so I don't have a good sense on how much to lean on theme for them.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Answers&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Despite my worries, the challenge got a good number of answers with lots of interesting golfing and optimizations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I found it impressive how answerers managed to reuse code for computing Fibonacci number/triangular number/multiple of 3 (B). I didn't see that coming for the most part. and in retrospect I got really lucky with the three sequences I chose kind-of arbitrarily. Kudos to solvers for finding some pretty parallel ways to generate the sequences and digit checks, and optimizing those that a bunch. Because of that, answers didn't feel like solutions to separate sub-challenges pasted together.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Lessons&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I'm glad that I resisted the urge to include primes for being &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14580/20260&quot;&gt;so classic&lt;/a&gt;. I also originally had more and harder sub-challenge parts, including variable bases, and thankfully I cut down on those. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;I tried really hard to write a clear spec given how weird and long it was, and I think I succeeded there. I thought a lot on how to present the different options before coming up with the fill-in-the-blank presentation, which then inspired the Mad Libs title. Still, I wonder if Sandboxing it would have led it to suggestions to make it clearer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One helpful last-minute change was to assign letters A/B/C to each blank, which made it easier to refer to them in the details and let solvers refer to them in answers or comments. I guess a lesson is to think about clarity not just within spec itself, but for supporting answerers in writing clear explanations. Along these lines, I've found it useful when challenges name variables or concepts so that different answers can refer to them in a consistent way, which in turn makes it easier for readers to understand explanations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Despite the challenge working out in hindsight, I think it was still probably a bad idea. Maybe it's the type of challenge that can be done once then never again. At least I definitely should have Sandboxed it. &lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2020-03-31T08:56:03.020" LastActivityDate="2020-03-31T08:56:03.020" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18742" PostTypeId="2" ParentId="18739" CreationDate="2020-03-31T02:54:31.783" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/198737/walk-home-one-step-at-a-time&quot;&gt;Walk home one step at a time&lt;/a&gt; by xnor&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I'm not happy with this one. I feel like I could have made something better with the idea.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As a choose-your-own-method type challenge, the appeal is for solvers to look for the map of directions that's golfiest, then implement it. The risk in writing these is that you don't really know what solvers are going to do. Maybe someone finds something that trivializes the challenges and everyone just copies it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At least, nothing that bad happened here. Credit for this goes to S.S. Anne who took the time to look for solutions to an earlier version in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18445/20260&quot;&gt;Sandbox post (deleted)&lt;/a&gt;. This earlier version had the walk be in steps of up/down/left/right, rather than turning with a facing direction. S.S. Anne came up with solutions that were shorter than I expected, and inspired me to come up with yet more minimal versions that seemed easy to port to most languages. Though these took cleverness to come up with, they would trivialize the challenge once someone posted them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This was a big saving throw that stopped me from posting a pretty bad challenge, even after it got a good a number of Sandbox upvotes. Really I should have taken time to think up optimized solutions from the get-go. I made the challenge more complicated by including the concept of facing direction and having movement be relative to it. Still, I didn't foresee most of the methods used in the new challenge, many of which involved turning only one direction.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge turned out fine, and I think golfers had some interesting optimization. I think solvers enjoyed it. Still, I feel like the concept had more potential and the challenge could have been a lot better.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2020-03-31T02:54:31.783" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18743" PostTypeId="2" ParentId="18738" CreationDate="2020-03-31T03:25:42.723" Score="5" Body="&lt;p&gt;As stated in &lt;a href=&quot;https://meta.stackoverflow.com/q/395949/1223693&quot;&gt;the announcement on Meta Stack Overflow&lt;/a&gt;,&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;At this point, the focus of Dark Mode is on Stack Overflow [...] While the retheming we did across the network two years ago makes updating our LESS easier, creating dark versions of all of our sites, particularly the custom-designed ones, is going to be a huge challenge we’re not able to contemplate at this time. The artwork on some of those sites simply can’t be made dark because we don’t have access to the original art files and, to be honest, some of the themes will always be better as-is.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;That being said, I have experimented with copying Stack Overflow's stylesheet over to PPCG, which... works in a sense, in that the page appears dark, but it makes the site look kinda like Stack Overflow. &lt;em&gt;shrug&lt;/em&gt; To me, having a fully supported dark theme is more positive than making PPCG look like SO is negative, so I still think this is better than nothing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you also want this, you can do what I did, which is install a custom stylesheet plugin for your browser (I use &lt;a href=&quot;https://addons.mozilla.org/en-US/firefox/addon/styl-us/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Stylus&lt;/a&gt; for Firefox, there's also a &lt;a href=&quot;https://chrome.google.com/webstore/detail/stylus/clngdbkpkpeebahjckkjfobafhncgmne&quot; rel=&quot;nofollow noreferrer&quot;&gt;Chrome version&lt;/a&gt;), then add the stylesheet produced by the following bash command:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-sh prettyprint-override&quot;&gt;&lt;code&gt;#!/usr/bin/env bash&#xA;go() {&#xA;    curl $1$2 | sed 's!url(\(.\)\.\.!url(\1'$1'..!g'&#xA;}&#xA;{&#xA;    go https://cdn.sstatic.net/Shared/ stacks.css&#xA;    go https://cdn.sstatic.net/Sites/stackoverflow/ primary.css&#xA;} | sed '&#xA;    s/theme-dark/unified-theme/g;&#xA;    s/prefers-color-scheme:dark/min-width:1px/g;&#xA;    s/}\.\(site-header\|top-bar\){[^}]*}/}/g;&#xA;' &amp;gt; thing.css&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(This simply removes the check that the dark theme is enabled from the stylesheets -- this is better than a userscript because there will be no flash of light theme before the JS kicks in.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I've &lt;a href=&quot;https://gist.github.com/tckmn/d436ce9790406a4fe814fb4111e75b76&quot; rel=&quot;nofollow noreferrer&quot;&gt;mirrored the command's output on Github&lt;/a&gt; if you don't want to / can't run it yourself -- but be warned, I make no guarantees as to how frequently I'll update this.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here's what it looks like:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/gYJlE.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/gYJlE.png&quot; alt=&quot;fake dark theme&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It also works without modifications on other network sites:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Akw97.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Akw97.png&quot; alt=&quot;worldbuilding&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="3808" LastEditorUserId="3808" LastEditDate="2020-03-31T19:33:15.803" LastActivityDate="2020-03-31T19:33:15.803" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18744" PostTypeId="2" ParentId="18739" CreationDate="2020-03-31T08:14:53.150" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/187658/multi-user-crud-valid-problem-or-error&quot;&gt;Multi-User CRUD: Valid, Problem, or Error?&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;I initially posted this challenge in the Sandbox &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/11349#11349&quot;&gt;back in January 2017&lt;/a&gt; when I had a rough idea about involving merge errors into a challenge. Over the course of two years, I modified it every now and then when I looked at the &lt;em&gt;Browse your pending proposals&lt;/em&gt; list, but mostly deemed it unfit for an actual challenge. I don't know how many times I've thought about just deleting it, but mid-2019 I decided to finally polish it so it was at least suitable enough for a challenge to be posted, which I did in June 2019, 2.5 year after I had put it in the Sandbox.&lt;/p&gt;&#xA;&lt;p&gt;Given the just 12 votes and three answers, it wasn't too big of a succes, as I was expecting to be completely honest. But I'm still happy I've posted the challenge instead of deleting it completely in the Sandbox, since the current answers all three use a different technique to solve it. I personally am mostly happy when a challenge I post sees a variety of different approaches in answers. (Which could be seen as ironic, since I also tend to port answers pretty often, when they end up being shorter than my initial own approach in answers I post.. ;) )&lt;/p&gt;&#xA;&lt;p&gt;I still do have the feeling I could have used the concept of merge errors and the different effects it has, for a completely different type of challenge. This was also the main reason I kept it in the Sandbox for all these years, in the hope I would have had some inspiration of what the challenge could convert to (which I didn't in the end).&lt;/p&gt;&#xA;" OwnerUserId="52210" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-03-31T08:14:53.150" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18745" PostTypeId="2" ParentId="18739" CreationDate="2020-03-31T08:43:46.280" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/77221/create-your-own-gym-exercise-and-follow-along-irl&quot;&gt;Create your own Gym Exercise and follow along irl&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Not much to say about it, but I figured I'd post it here anyway as an example of how a reasonably nice challenge can be ruined by cumbersome rules as only allowing full programs and having input validation.&lt;/p&gt;&#xA;&lt;p&gt;This was my very first challenge I posted when I came to this Stackexchange back in April 2016. The challenge is to post an animation of 9 different states of a stick figure, based on a given input of digits. Sounds quite straight-forward, but here are all the things I did completely wrong with this first challenge of mine:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;I only allowed full programs, and not functions. There is a reason &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet/2422#2422&quot;&gt;program/function is the default&lt;/a&gt;.. I post in Java pretty often, which has a very cumbersome mandatory part for full programs, which is already &lt;a href=&quot;https://tio.run/##y0osS9TNSsn@/z8zryS1KC0xOVXBt7q4JLEkM1mhLD8zRSE3MTNPI7ikKDMvPTo2UbO6tvb/fwA&quot; rel=&quot;nofollow noreferrer&quot;&gt;42 bytes&lt;/a&gt; without any actual functionality.&lt;/li&gt;&#xA;&lt;li&gt;I only allowed input as a string. This challenge of mine could have worked the same by taking a list of digits as input, or perhaps even nine unique values of your own choosing..&lt;/li&gt;&#xA;&lt;li&gt;Input validation.. &amp;gt;.&amp;gt; I required answers to validate that there were: at least 2 and not more than 100 characters; there were no invalid characters (i.e. &lt;code&gt;0&lt;/code&gt;); there were no repeating digits adjacent to each other (with wraparound).. All things that distract from an otherwise good challenge.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Of course, this was just the very first challenge of mine, so that it contains flaws like this isn't too surprising. Because of this challenge I learned that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges/16596#16596&quot;&gt;you can best assume all input given is valid&lt;/a&gt; (unless input validation is a core part of the challenge); to use the default of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet/2422#2422&quot;&gt;allowing both full programs AND functions&lt;/a&gt;; and to have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods/&quot;&gt;flexible I/O&lt;/a&gt;. Which is also the reason I post it here, so other (relatively new users) that might read this will know what type of things to avoid when posting a challenge. (And always use &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;the Sandbox&lt;/a&gt; before posting a challenge to main, no matter whether you're an experienced user or a new one, since there can always be something you might have overlooked.)&lt;/p&gt;&#xA;" OwnerUserId="52210" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-03-31T08:43:46.280" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18746" PostTypeId="2" ParentId="2140" CreationDate="2020-03-31T23:56:48.510" Score="1" Body="&lt;h1&gt;Are these the same time? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/time&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;time&amp;#39;&quot; rel=&quot;tag&quot;&gt;time&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Context&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;When asked about the time (i.e. hours and minutes), people naturally reply with any one of a given set of fairly common sentences:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;(A) it is &lt;code&gt;M&lt;/code&gt; past &lt;code&gt;H&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;(B) it is &lt;code&gt;M&lt;/code&gt; to &lt;code&gt;H&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;(C) it is &lt;code&gt;H&lt;/code&gt; minus &lt;code&gt;M&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Where &lt;code&gt;M&lt;/code&gt; above refers to some amount of minutes and &lt;code&gt;H&lt;/code&gt; to some amount of hours. Concrete corresponding examples, all referring to the time &lt;code&gt;3:40 pm&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;(A) it is 40 past 3&lt;/li&gt;&#xA;&lt;li&gt;(B) it is 20 to 4&lt;/li&gt;&#xA;&lt;li&gt;(C) it is 4 minus 20&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given two of these sentences, output a Truthy value if they represent the same time and a Falsy value if they do not.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your input will be two sentences of the above, where references to minutes will always be rounded to the nearest multiple of 5 (i.e. the minutes will always be one of &lt;code&gt;5, 10, 15, 20, ..., 50, 55&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because all sentences start with &lt;code&gt;&quot;it is &quot;&lt;/code&gt; you may ommit that from your input sentences.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A Truthy value if the two times are the same, a Falsy value otherwise.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##fZJRa4MwFIXf@ysu2YMJVbGr7KHgQGF/YOxBKHuQNe3u0Cgmbu2vdzGJzlJXn/Sec77IuWku6rMW274/8CM0hVQ09TO2W4F@HiBtT13FhQL5UzQNihMcO/GhsBahc7yEpxDiyERhC8EzbHdxZMSWq64VsM/89H21GviqvqK/GoPUjmDjw1MUaN@M@hjpAMTLzL@EIVcoOrkMT501u4LHNjIcssSfhQwfD7oFVJfZEZPVH02KlyVNnZxDAmkomxIV9VABSvDYfmN/oqoPXOuEmC88ArEFEkABuQWMkNxBRgub1JEyzC2Jl4ala7tPGgy3HFVfUWxB90HOc8sywoiT/L/8QnKs2obPejQoa0LJ2vO98KtGQXO2JozM18C/i5KemV2ELCr@hhW/3ZZbUZKYl4z1TYtC0SlA7KamC018N3GXkTDW/wI&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt; is a sample program for checking the test cases.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Should the minutes and hours in the input com as integers instead of English words?&lt;/p&gt;&#xA;" OwnerUserId="75323" LastEditorDisplayName="user92069" LastEditDate="2020-04-01T06:38:58.970" LastActivityDate="2020-04-01T06:38:58.970" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18747" PostTypeId="2" ParentId="2140" CreationDate="2020-04-01T00:08:24.450" Score="0" Body="&lt;h1&gt;Mom-rounding the time &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/time&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;time&amp;#39;&quot; rel=&quot;tag&quot;&gt;time&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Context&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Growing up with my mother, whenever she looked at a clock to check the time, she would always say &lt;em&gt;&quot;shoot, it's already X!&quot;&lt;/em&gt; and then I would look at the clock and realize she was just rounding the time in a really weird way.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a time with hours and minutes, round it like my mom would. Rounding always occurs upwards. Say it is currently &lt;code&gt;H&lt;/code&gt; hours and &lt;code&gt;M&lt;/code&gt; minutes.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;if &lt;code&gt;M&lt;/code&gt; is 0, no rounding occurs; my mom isn't that crazy;&lt;/li&gt;&#xA;&lt;li&gt;if &lt;code&gt;M&lt;/code&gt; is 9 or less, my mom rounds to &lt;code&gt;H:15&lt;/code&gt;;&lt;/li&gt;&#xA;&lt;li&gt;if &lt;code&gt;M&lt;/code&gt; is 19 or less, my mom rounds to &lt;code&gt;H:30&lt;/code&gt;;&lt;/li&gt;&#xA;&lt;li&gt;if &lt;code&gt;M&lt;/code&gt; is 34 or less, my mom rounds to &lt;code&gt;H:45&lt;/code&gt;;&lt;/li&gt;&#xA;&lt;li&gt;for any other value of &lt;code&gt;M&lt;/code&gt;, my mom rounds to &lt;code&gt;H+1:00&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You will take a time that needs rounding, in any sensible format. ISO strings for date/time, two integers representing hours/numbers, a string with two integers and a separator; these are all fair game.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The string &lt;code&gt;&quot;shoot, it's already X&quot;&lt;/code&gt; with &lt;code&gt;X&lt;/code&gt; replaced with the mom rounding time.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest answer wins. However, if your source code contains the substring &lt;code&gt;shoot, it's already&lt;/code&gt; then you may subtract 19 from your score.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##fY5RS8MwEMff8ynOgJjQtCRmBRenz3vp@6CUUTRukTSVNjCEffeatm6Oru6ejrvf/e6vG1u6Xazbt8Z8@Q51VV2RNeMU4lfIQ1M8IzTOMoog1GGvHWTwsoJlYIZRX4EFkd6gxRUub8nlYoovLuxb@rvM15EIIROEvLZ2EJ3ucLuva8/A@IcWStvo8v0b8LCKIrCm9a36rI0Dcn6DFWZ/P70lxnm9083W19v@gGwiwTmlcDzCBlYxjGkgo8VwRk92fIeTriqNI3lxDmRq9XFojNdkyCoEg@Bi/dxZEpp7EEJxPgeDZPA0gSUokc7Cwbycmv@DhWRCTmGp5HyMRybTCzgZY3De/QA&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt; is the program I use to generate the test cases.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;11:00 -&amp;gt; shoot, it's already 11:00!&#xA; 3:08 -&amp;gt; shoot, it's already 03:15!&#xA; 1:09 -&amp;gt; shoot, it's already 01:15!&#xA;13:13 -&amp;gt; shoot, it's already 13:30!&#xA; 2:35 -&amp;gt; shoot, it's already 03:00!&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="75323" LastEditorDisplayName="user92069" LastEditDate="2020-04-01T06:03:57.733" LastActivityDate="2020-04-01T06:03:57.733" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18748" PostTypeId="2" ParentId="18739" CreationDate="2020-04-01T02:09:31.843" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/157238/78410&quot;&gt;Balanced Zero-One Encoding&lt;/a&gt; by Bubbler&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This was the very first challenge I posted here on CGCC (PPCG back then). As far as I remember, I did read most of the important meta posts about writing challenges, I posted the challenge on the sandbox first, waited around a week (trying to fix a lot of problems identified in the way), and then posted to main.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even with all of this process, it had one problem: it had a &lt;strong&gt;custom scoring metric that didn't balance very well&lt;/strong&gt;, or more precisely, &lt;strong&gt;was impossible to balance well&lt;/strong&gt;. I wanted the solutions to do some juggling between (shorter code + somewhat unbalanced encoding scheme) and (longer code + more balanced encoding scheme). However, because we don't mind solutions taking too long by default, the challenge attracted (quite short) brute-force solutions doing perfect encoding, which got the best scores. Then the challenge became boring.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe a lesson from this challenge is &lt;strong&gt;do not mix code length and algorithm in the custom score&lt;/strong&gt;. Just having the code length measured in different ways is fine (as in &lt;a href=&quot;https://codegolf.stackexchange.com/q/165157/78410&quot;&gt;Modified Boggle Checker, with Modified Boggle-able Code&lt;/a&gt;, another &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; of mine).&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2020-04-01T02:09:31.843" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18750" PostTypeId="2" ParentId="2140" CreationDate="2020-04-01T08:36:35.147" Score="1" Body="&lt;h1&gt;&lt;span class=&quot;math-container&quot;&gt;\$\Theta(N\cdot\sqrt N)\$&lt;/span&gt; sort &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The challenge is to write a program that sorts an array of distinct positive integers in ascending order. You may input the array and output the result using the default IO methods.&lt;/p&gt;&#xA;&lt;p&gt;However, the worst-case time complexity of the algorithm used must be &lt;span class=&quot;math-container&quot;&gt;\$\Theta(N \cdot \sqrt N)\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; is the length of the input array.&lt;/p&gt;&#xA;&lt;p&gt;You may not assume your built-in sorting functions to have any time complexity in particular. While you can implement a fast (e.g. &lt;span class=&quot;math-container&quot;&gt;\$O(N \log N)\$&lt;/span&gt;) sort and then perform pointless operations to increase the complexity, direct algorithms exist.&lt;/p&gt;&#xA;&lt;p&gt;This question is tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code wins!&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox stuff&lt;/h2&gt;&#xA;&lt;p&gt;I have noticed that a possible solution is, for example, to create a sorted multiset from the array and read it back. I would probably like to disallow that. Is there a way to achieve that without making the validity criteria subjective?&lt;/p&gt;&#xA;" OwnerUserId="36445" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-04-04T14:50:13.033" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18751" PostTypeId="1" CreationDate="2020-04-01T12:12:54.933" Score="15" ViewCount="946" Body="&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt;: In what circumstances is it ok (by CGCC and politeness standards) to edit directly a post (be it challenge, answer, sandbox question, etc), assuming the edit is done in good faith?&lt;/p&gt;&#xA;&lt;p&gt;I know people can rollback edits and further edit a post, but in the meantime that goes from the unwanted edit and the correction, many things can happen. What is more, the OP doesn't get notified when the post is edited, so it could take a &lt;em&gt;long&lt;/em&gt; time before the OP realizes the post was &lt;em&gt;badly&lt;/em&gt; edited.&lt;/p&gt;&#xA;&lt;h2&gt;Context&lt;/h2&gt;&#xA;&lt;p&gt;I was under both ends of the &amp;quot;edit without consulting the OP&amp;quot; situation (bullet points below) and wanted to clarify it for me and for other users&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;[&lt;em&gt;I edited without consulting OP&lt;/em&gt;] Recently I wrote a challenge and, later on, I added a couple of test cases. A particular user had a Python answer (a language I know how to write in) and so I took the user's TIO link, added the test cases and edited the answer to include the new link. I thought I was not doing any harm.&lt;/p&gt;&#xA;&lt;p&gt;Of course I managed to edit at the same time as the user and so, they edited to golf the question and I submitted my edit which overwrote the user's golf. The user talked to me and asked I leave a TIO link next time, without directly editing the question. In hindsight I think the user was completely right and it would've been even easier for me to just drop the TIO link in the comments.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;[&lt;em&gt;my posts were edited without my consent&lt;/em&gt;] I wrote a couple of sandboxed challenges and I didn't include any test cases, as I wanted a bit of preliminary feedback first; a user edited both my challenges and for each, did a combination of&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;create reference programs and include TIO links as if they were mine;&lt;/li&gt;&#xA;&lt;li&gt;create a test case section with text written in the first person, so effectively impersonating me;&lt;/li&gt;&#xA;&lt;li&gt;addressing some of the feedback left in the comments (which was fair feedback) but that was more than a trivial change;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Answering this&lt;/h2&gt;&#xA;&lt;p&gt;I am not sure I have the &amp;quot;authority&amp;quot; to make this statement, but I'd suggest people mention one situation per answer and the community votes to agree/disagree with the answer.&lt;/p&gt;&#xA;&lt;p&gt;The answer should &lt;em&gt;clearly state&lt;/em&gt; if the situation mentioned is a &amp;quot;not ok to edit&amp;quot; situation or a &amp;quot;it is ok to edit&amp;quot; situation, along with a &lt;em&gt;short&lt;/em&gt; description, in the header.&lt;/p&gt;&#xA;&lt;p&gt;Rules here take effect if they have at least five upvotes and have at least twice as many upvotes as downvotes.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/722/75323&quot;&gt;Related&lt;/a&gt; but 6 years old already and only one answer.&lt;/p&gt;&#xA;" OwnerUserId="75323" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2022-09-22T17:08:08.217" Title="When it is and is not acceptable to edit someone else's post" Tags="|discussion|editing|" AnswerCount="24" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="18752" PostTypeId="2" ParentId="18751" CreationDate="2020-04-01T12:15:47.113" Score="20" Body="&lt;h1&gt;It is ok to edit to fix typos&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If you are fixing minor typos or any other minor, self-contained, English-related issue that you won't change the meaning of the OP's sentences.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Consider pinging the OP if you feel tempted to change more than a couple of words, as matters of style, preferred spelling, etc are all subjective. (c.f. Mitchell Spector's comments below)&lt;/p&gt;&#xA;" OwnerUserId="75323" LastEditorUserId="75323" LastEditDate="2020-04-07T06:27:20.907" LastActivityDate="2020-04-07T06:27:20.907" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18753" PostTypeId="2" ParentId="18751" CreationDate="2020-04-01T12:18:05.077" Score="31" Body="&lt;h1&gt;It is &lt;em&gt;not&lt;/em&gt; ok to edit to golf an answer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;if you are going to golf someone else's answer (this doesn't happen much, it is usual to see people leave a TIO link with the golfed version or a hint on what to do).&lt;/p&gt;&#xA;" OwnerUserId="75323" LastEditorUserId="75323" LastEditDate="2020-04-01T23:41:45.697" LastActivityDate="2020-04-01T23:41:45.697" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18754" PostTypeId="2" ParentId="18751" CreationDate="2020-04-01T12:22:06.920" Score="3" Body="&lt;h1&gt;It is ok to edit to add MathJax&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If you are fixing mathematical formulas/variable references that could be improved by changing to MathJax:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;E.g. from&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The kinetic energy &lt;code&gt;E&lt;/code&gt; is &lt;code&gt;1/2*mv^2&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;to&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The kinetic energy is &lt;span class=&quot;math-container&quot;&gt;\$E = \frac12 mv^2\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="75323" LastEditorUserId="75323" LastEditDate="2020-04-01T23:33:36.450" LastActivityDate="2020-04-01T23:33:36.450" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="18755" PostTypeId="1" CreationDate="2020-04-01T13:03:54.590" Score="6" ViewCount="172" Body="&lt;p&gt;I'm working on a King of the Hill challenge for some point in the next couple of months. (&lt;a href=&quot;https://ajfaraday.github.io/aquarium/menu.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sneak Peek&lt;/a&gt;)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The problem I have is that last time I ran one it was pretty ambitious, and it became a heavy time-sink while the challenge was active. I've got a job and a family, and pressures of maintaining the challenge eventually became too much and I had to give it up for my own well-being. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Well, the new one's equally ambitious, but I've resolved to be more prepared, front-load as much dev work as possible, particularly geared towards the actual running of the competition. This means that maintaining the challenge should be as near to automatic as possible. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are things I've done, or intend to do, before releasing the challenge:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A menu providing all matches in a compact format.&lt;/li&gt;&#xA;&lt;li&gt;Seeded random to provide consistent, rewatchable, match conditions.&lt;/li&gt;&#xA;&lt;li&gt;A command line script to run the contest in full (not relying on the browser to do everything).&lt;/li&gt;&#xA;&lt;li&gt;A script to import code from a question, live-tested &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18632/please-ignore-this-question&quot;&gt;here&lt;/a&gt;. &lt;/li&gt;&#xA;&lt;li&gt;A validator, as part of import script, which should hopefully filter out any game-breaking code from the question.&lt;/li&gt;&#xA;&lt;li&gt;An up-front leader board, updated on tournament runs, making it clear this is a challenge.&lt;/li&gt;&#xA;&lt;li&gt;A single-entry interface to show competetors their own matches and scores. (Including re-runs of matches)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Things I'd like to finish doing before the competition launches.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The same validator used to gate-keep entries will be accessible to run on a single file. Allowing competetors to ensure their entry will be accepted.&lt;/li&gt;&#xA;&lt;li&gt;A scheduled script to check for changes in the answers, import any new ones, run the tournament and push code changes (including results).&lt;/li&gt;&#xA;&lt;li&gt;A widget in the question which goes and gets the results from Github pages and shows a leader board in the question.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Finally, I intend to try a sandbox post to hopefully get a couple of golfers to end-to-end test the setup.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The desired end-result is that I can leave a machine on, set up a cron job to hit the script every now and then, and as much as possible leave the challenge to run itself.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;However, my past attempts have never really been completely ready on launch, and I might not be able to hop to it if things need fixing, so I'd just like to open the discussion here:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What more can I do in the dev phase to set up this challenge?&lt;/li&gt;&#xA;&lt;li&gt;Is there any part of the challenge maintenance which can not be automated?&lt;/li&gt;&#xA;&lt;li&gt;Is there a way I can encourage people to try out my entry process prior to launch?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="16824" LastEditorUserId="46076" LastEditDate="2020-04-10T13:54:30.433" LastActivityDate="2020-04-10T13:54:30.433" Title="Any tips for running a low-maintenance KotH?" Tags="|discussion|king-of-the-hill|" AnswerCount="0" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18756" PostTypeId="2" ParentId="2140" CreationDate="2020-04-01T13:30:17.990" Score="0" Body="&lt;h1&gt;Word Grid Puzzle Iterator&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I commonly see an advert for a word-based game, where, by removing a word from a grid of letters, the remaining letters &amp;quot;collapse&amp;quot;, horizontally and vertically, leading to further words being findable.&lt;/p&gt;&#xA;&lt;p&gt;The challenge is to take in a grid of characters and a word as an input, and output the collapsed grid after that word has been removed.&lt;/p&gt;&#xA;&lt;p&gt;Words in the grid could be oriented in any direction.&lt;/p&gt;&#xA;&lt;p&gt;This is code-golf, usual exclusions apply.&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;The following set of examples follow on from each other - so the output from the first example is the input to the second.&lt;/p&gt;&#xA;&lt;h3&gt;AIR&lt;/h3&gt;&#xA;&lt;p&gt;In:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;N   F   A   D   S   T&#xA;I   O   I   E   N   T&#xA;A   G   R   W   O   H&#xA;R   L   I   A   H   A&#xA;S   L   E   E   W   W&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Out:&#xA;If the word &amp;quot;AIR&amp;quot; is removed, none of the rows or columns are empty and so the rest of the grid remains as-is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;N   F       D   S   T&#xA;I   O       E   N   T&#xA;A   G       W   O   H&#xA;R   L   I   A   H   A&#xA;S   L   E   E   W   W&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;HAIL&lt;/h3&gt;&#xA;&lt;p&gt;If the word &amp;quot;HAIL&amp;quot; is removed, the letters in the 2nd-5th columns drop down one, making the word &amp;quot;SNOW&amp;quot; accessible:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;N                   T&#xA;I   F       D   S   T&#xA;A   O       E   N   H&#xA;R   G       W   O   A&#xA;S   L   E   E   W   W&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;SNOW&lt;/h3&gt;&#xA;&lt;p&gt;If SNOW is removed, the columns collapse horizontally:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;N               T   &#xA;I   F       D   T   &#xA;A   O       E   H   &#xA;R   G       W   A   &#xA;S   L   E   E   W   &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;THAW&lt;/h3&gt;&#xA;&lt;p&gt;If THAW is removed, the T drops down so that SLEET is now accessible:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;N                       &#xA;I   F       D       &#xA;A   O       E       &#xA;R   G       W       &#xA;S   L   E   E   T   &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;SLEET&lt;/h3&gt;&#xA;&lt;p&gt;Removing SLEET clears a row and a column, and so the grid collapses in both directions:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;                    &#xA;N                   &#xA;I   F   D           &#xA;A   O   E           &#xA;R   G   W           &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;RAIN, DEW, FOG&lt;/h3&gt;&#xA;&lt;p&gt;The remaining three vertical words (RAIN, DEW, FOG) can then be removed individually:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;                    &#xA;                    &#xA;F   D               &#xA;O   E               &#xA;G   W               &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;                    &#xA;                    &#xA;F                   &#xA;O                   &#xA;G                   &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;                    &#xA;                    &#xA;                    &#xA;                    &#xA;                    &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Notes&lt;/h1&gt;&#xA;&lt;p&gt;In the above examples, I have not resized the arrays as the outside rows/columns are made empty; instead just leaving them blank (i.e. the final array is 6x5, as is the starting array). Your program may also do this, or it may resize the array to remove empty rows and columns if you prefer.&lt;/p&gt;&#xA;&lt;p&gt;For example, assuming the input is a 1x5 array:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;H  A   T   C   E&lt;/code&gt; removing &lt;code&gt;HAT&lt;/code&gt; could become &lt;code&gt;_ _ _   C   E&lt;/code&gt; or &lt;code&gt;CE&lt;/code&gt;, both are valid. (underscores represent spaces for formatting purposes)&lt;/p&gt;&#xA;&lt;h1&gt;Inputs and Outputs:&lt;/h1&gt;&#xA;&lt;p&gt;Any reasonable format is acceptable - arrays, strings, etc. But:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;you cannot assume that the orientation of the word to remove is the same as that in the input. e.g you won't get the input &amp;quot;LIAH&amp;quot; because the word HAIL is written right-to-left on the grid.&lt;/li&gt;&#xA;&lt;li&gt;the output must be the same format as the input (i.e. the program must accept the output from the previous iteration as the grid input to the next)&lt;/li&gt;&#xA;&lt;li&gt;You can assume the word will be in the grid, horizontally or vertically (not diagonally)&lt;/li&gt;&#xA;&lt;li&gt;Words will never contain spaces, only the letters A-Z; and if the word is found but with a space in it, then that doesn't count as matching the word&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can assume the case of the word will match the grid, in whatever case suits your language (UPPER, lower, camelCase, whatever)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;You can assume that the Input word will only appear once on the grid&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Sandbox Questions&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Does this feel too much like multiple challenges (find the word, collapse the array)?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="62289" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-04-07T08:03:41.430" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18757" PostTypeId="2" ParentId="2140" CreationDate="2020-04-01T20:30:02.287" Score="0" Body="&lt;p&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2020-04-03T18:26:19.423" LastActivityDate="2020-04-03T18:26:19.423" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18758" PostTypeId="2" ParentId="18751" CreationDate="2020-04-01T23:35:39.537" Score="22" Body="&lt;h1&gt;It is ok to edit to fix code formatting&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If you are fixing formatting issues, for example multi-line code that isn't properly formatted:&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;s = &quot;hello world..?&quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;print(s)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;to&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;s = &quot;hello world..?&quot;&#xA;print(s)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;or if you are fixing mathematical formulas/variable references that lacked formatting and thus blend in too much with the text, e.g.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;you will receive three integers a, b and C&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;to&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;you will receive three integers &lt;code&gt;a&lt;/code&gt;, &lt;code&gt;b&lt;/code&gt; and &lt;code&gt;c&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="75323" LastActivityDate="2020-04-01T23:35:39.537" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18759" PostTypeId="2" ParentId="18751" CreationDate="2020-04-01T23:41:14.823" Score="1" Body="&lt;h1&gt;It is &lt;em&gt;not&lt;/em&gt; ok to edit if you are adding substantial text&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If you are going to add whole sentences, paragraphs or sections, it is not ok to do it without the OP being aware of such a change.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Especially if you have to impersonate the OP:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;e.g. if you are adding a sentence that clarifies the meaning of, say, a mathematical function, that would be less inappropriate than adding whatever sentence in the first person.&lt;/p&gt;&#xA;" OwnerUserId="75323" LastActivityDate="2020-04-01T23:41:14.823" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18761" PostTypeId="1" CreationDate="2020-04-02T10:01:08.000" Score="4" ViewCount="235" Body="&lt;h2&gt;What happened&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I was about to post &lt;a href=&quot;https://codegolf.stackexchange.com/q/202944/78410&quot;&gt;Does base n have any Rotate-Left-Double numbers?&lt;/a&gt;. Kevin Cruijssen told me in the sandbox comment that he got a proof that significantly simplifies the problem. I posted it to main, excited to see the proof. (Seriously, I should've reconsidered posting to main at this point; it's my fault.) Then &lt;a href=&quot;https://codegolf.stackexchange.com/a/202945/78410&quot;&gt;Kevin posted the proof along with a 6-byte 05AB1E answer&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So essentially, the challenge &lt;em&gt;text&lt;/em&gt; is asking for&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Given the base &lt;span class=&quot;math-container&quot;&gt;\$n≥2\$&lt;/span&gt;, determine if there exists a Rotate-Left-Double number in base &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;but the &lt;em&gt;actual task&lt;/em&gt; became&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Given a positive integer &lt;span class=&quot;math-container&quot;&gt;\$n≥2\$&lt;/span&gt;, determine if it is not a member of &lt;a href=&quot;http://oeis.org/A056469&quot; rel=&quot;nofollow noreferrer&quot;&gt;A056469&lt;/a&gt; (the number 2 and the numbers in the form of &lt;span class=&quot;math-container&quot;&gt;\$2^k+2\$&lt;/span&gt;).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;which definitely sounds easier, and has a super-simple formula &lt;code&gt;n-2&amp;amp;n-3&lt;/code&gt; (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/202944/does-base-n-have-any-rotate-left-double-numbers#comment481572_202944&quot;&gt;as pointed by xnor&lt;/a&gt;).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The question: How to resolve this situation?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It is not that uncommon to see that a challenge asking for a complex mathematical property boils down to a &lt;em&gt;very&lt;/em&gt; simple task, sometimes so much that having such a challenge is pointless. If we identified that in the sandbox, we can redesign the challenge to something different. (Again, this particular incident is my fault posting it to main &lt;em&gt;after&lt;/em&gt; the simplification is found.) However, it might slip through the minds of both the challenge writer and sandbox reviewers, and get found by someone else shortly after posting.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What can I do about it?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can think of a few possibilities:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do nothing.&lt;/li&gt;&#xA;&lt;li&gt;Close as a dupe (if applicable). Otherwise, post a new challenge clearly asking for the actual task, and close the OP as a dupe of the new one.&lt;/li&gt;&#xA;&lt;li&gt;Close with a custom reason, and refine it again in the sandbox.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;I don't want to get the challenge deleted, because there is at least one answer whose author put a lot of effort to prove such a property.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2020-04-03T02:33:15.367" LastActivityDate="2020-04-08T18:55:46.757" Title="How to deal with an accidental chameleon challenge" Tags="|discussion|challenge-quality|" AnswerCount="1" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="18763" PostTypeId="2" ParentId="18739" CreationDate="2020-04-02T20:12:59.553" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/43035/31625&quot;&gt;Bad News, Someone&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;This was my first challenge, and I think it taught me a few things about how certain, very important parts of making a challenge are more important than the base idea. Primarily, I think this comes across in two main ways: I could have made more approaches usable when solving the challenge, and I could have reduced the IO complexity of challenge. Both of these changes would only have had a minor impact on the challenge, but I was too attached the cute idea to realise that it was hurting the challenge.&lt;/p&gt;&#xA;&lt;p&gt;The simpler change to see, particularly from our more modern point of view, was that the IO format required was needlessly complicated. My motivation for the complexity was clear: I wanted to include the characters from the show in the test cases. What I should have done was allow any distinct objects to represent names. This, along with the requirement that new bodies have new names quite probably cost me an answer from feersum, and maybe other users.&lt;/p&gt;&#xA;&lt;p&gt;Slightly more subtle, was the effect of requiring minimal additional bodies to the solution. This precluded using an intelligent algorithm, such as from the proof, without needing to prove something that most people without a doctorate in maths would struggle to even approach. I was warned against this in the sandbox, partially, but with the suggestion being to make the challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;. I think I was correct in not changing to that (for the same aforementioned complexity) but I think the challenge becomes much more interesting if brute-forcing isn't the only reasonably approachable strategy.&lt;/p&gt;&#xA;&lt;p&gt;In summary, I think this challenge does a good job of highlighting how trying to force solutions to a challenge to be what you want often causes them to be mindless, while also probably discouraging solutions overall. However, unlike &amp;quot;answer in javascript only&amp;quot; cases which usually get downvoted and closed, most of the community seemed to want this challenge to do well. Hopefully this makes it a useful example of a couple things to avoid.&lt;/p&gt;&#xA;" OwnerUserId="31625" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-04-02T20:12:59.553" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18766" PostTypeId="1" CreationDate="2020-04-02T23:17:36.980" Score="11" ViewCount="160" Body="&lt;p&gt;A few months ago I posted a few &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18256/popularity-of-questions-based-on-post-time-and-the-most-useless-graph-ever&quot;&gt;interesting bits of research&lt;/a&gt; on data from SEDE. It was fairly well-received, so I figured I'd do some more analysis. I might make this a weekly thing.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I decided to start with tags. This post will show some data relating to the most used tags, the popularity of posts based on the tags they use, and the most common combinations of tags.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;All of this data is from April 6, 2020.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Most used&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;: 9540 (84.16%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;: 1750 (15.44%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;: 1362 (12.01%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;: 1087 (9.59%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;: 1069 (9.43%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;: 810 (7.15%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;: 680 (6.00%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;: 564 (4.98%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;: 530 (4.68%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;: 480 (4.23%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;: 474 (4.18%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;: 395 (3.48%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;: 354 (3.12%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;: 307 (2.71%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;: 303 (2.67%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;: 290 (2.56%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;: 287 (2.53%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;: 278 (2.45%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt;: 274 (2.42%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt;: 272 (2.40%)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Highest average score&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Note: Only contains tags with at least 10 questions&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tetris&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tetris&amp;#39;&quot; rel=&quot;tag&quot;&gt;tetris&lt;/a&gt;: +83.0 (15647 views)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game-of-life&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game-of-life&amp;#39;&quot; rel=&quot;tag&quot;&gt;game-of-life&lt;/a&gt;: +82.9 (16908 views)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-referential&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-referential&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-referential&lt;/a&gt;: +59.9 (8444 views)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/new-years&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;new-years&amp;#39;&quot; rel=&quot;tag&quot;&gt;new-years&lt;/a&gt;: +50.0 (13467 views)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/color&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;color&amp;#39;&quot; rel=&quot;tag&quot;&gt;color&lt;/a&gt;: +49.1 (10966 views)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cellular-automata&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cellular-automata&amp;#39;&quot; rel=&quot;tag&quot;&gt;cellular-automata&lt;/a&gt;: +48.9 (7895 views)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt;: +48.0 (53586 views)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt;: +44.3 (11880 views)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;: +41.5 (7826 views)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/error-message&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;error-message&amp;#39;&quot; rel=&quot;tag&quot;&gt;error-message&lt;/a&gt;: +39.9 (11323 views)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hello-world&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hello-world&amp;#39;&quot; rel=&quot;tag&quot;&gt;hello-world&lt;/a&gt;: +39.8 (10270 views)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stateful&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stateful&amp;#39;&quot; rel=&quot;tag&quot;&gt;stateful&lt;/a&gt;: +38.7 (9483 views)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/busy-beaver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;busy-beaver&amp;#39;&quot; rel=&quot;tag&quot;&gt;busy-beaver&lt;/a&gt;: +36.3 (6072 views)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/obfuscation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;obfuscation&amp;#39;&quot; rel=&quot;tag&quot;&gt;obfuscation&lt;/a&gt;: +31.8 (7838 views)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/factorial&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;factorial&amp;#39;&quot; rel=&quot;tag&quot;&gt;factorial&lt;/a&gt;: +31.5 (5103 views)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-design&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-design&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-design&lt;/a&gt;: +31.2 (1907 views)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;: +31.0 (8131 views)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/radiation-hardening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; rel=&quot;tag&quot;&gt;radiation-hardening&lt;/a&gt;: +30.7 (2908 views)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interactive&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interactive&amp;#39;&quot; rel=&quot;tag&quot;&gt;interactive&lt;/a&gt;: +29.9 (4293 views)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;: +29.8 (3398 views)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Most common combinations&lt;/h2&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;: 1658&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;: 1214&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;: 1024&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;: 1008&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;: 625&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;: 527&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;: 508&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;: 457&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;: 447&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;: 328&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;: 288&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;: 262&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;: 254&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;: 248&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;: 243&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt;: 232&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt;: 229&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;: 227&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt;: 224&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;: 220&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Most common combinations (compared to individual usage)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Note: Only contains tags with at least 10 questions&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fewest-operations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fewest-operations&amp;#39;&quot; rel=&quot;tag&quot;&gt;fewest-operations&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/golf-cpu&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;golf-cpu&amp;#39;&quot; rel=&quot;tag&quot;&gt;golf-cpu&lt;/a&gt;: 5 (33.33%, 100.00%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cellular-automata&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cellular-automata&amp;#39;&quot; rel=&quot;tag&quot;&gt;cellular-automata&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game-of-life&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game-of-life&amp;#39;&quot; rel=&quot;tag&quot;&gt;game-of-life&lt;/a&gt;: 12 (30.77%, 46.15%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stack-exchange-api&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stack-exchange-api&amp;#39;&quot; rel=&quot;tag&quot;&gt;stack-exchange-api&lt;/a&gt;: 19 (25.00%, 57.58%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/assembly&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;assembly&amp;#39;&quot; rel=&quot;tag&quot;&gt;assembly&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/machine-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;machine-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;machine-code&lt;/a&gt;: 5 (23.81%, 62.50%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c&amp;#39;&quot; rel=&quot;tag&quot;&gt;c&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c%2b%2b&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c++&amp;#39;&quot; rel=&quot;tag&quot;&gt;c++&lt;/a&gt;: 13 (24.53%, 39.39%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;: 1658 (17.38%, 94.74%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c%23&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c#&amp;#39;&quot; rel=&quot;tag&quot;&gt;c#&lt;/a&gt;: 9 (22.50%, 37.50%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/functional-programming&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;functional-programming&amp;#39;&quot; rel=&quot;tag&quot;&gt;functional-programming&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/haskell&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;haskell&amp;#39;&quot; rel=&quot;tag&quot;&gt;haskell&lt;/a&gt;: 5 (21.74%, 33.33%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/java&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;java&amp;#39;&quot; rel=&quot;tag&quot;&gt;java&lt;/a&gt;: 24 (16.44%, 54.55%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/linear-algebra&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;linear-algebra&amp;#39;&quot; rel=&quot;tag&quot;&gt;linear-algebra&lt;/a&gt;: 30 (15.15%, 73.17%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;: 50 (16.50%, 40.65%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt;: 73 (20.62%, 26.84%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/logic-gates&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;logic-gates&amp;#39;&quot; rel=&quot;tag&quot;&gt;logic-gates&lt;/a&gt;: 11 (16.92%, 36.67%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;: 202 (18.58%, 29.71%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;: 1214 (12.73%, 89.13%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/error-correction&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;error-correction&amp;#39;&quot; rel=&quot;tag&quot;&gt;error-correction&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/coding-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;coding-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;coding-theory&lt;/a&gt;: 2 (18.18%, 28.57%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/rubiks-cube&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;rubiks-cube&amp;#39;&quot; rel=&quot;tag&quot;&gt;rubiks-cube&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cubically&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cubically&amp;#39;&quot; rel=&quot;tag&quot;&gt;cubically&lt;/a&gt;: 3 (12.50%, 75.00%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary-tree&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary-tree&amp;#39;&quot; rel=&quot;tag&quot;&gt;binary-tree&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tree-traversal&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tree-traversal&amp;#39;&quot; rel=&quot;tag&quot;&gt;tree-traversal&lt;/a&gt;: 4 (19.05%, 23.53%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot;&gt;python&lt;/a&gt;: 39 (14.39%, 37.14%)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt;: 46 (11.65%, 92.00%)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Interesting Takeaways&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Code golf makes up over 84% of the challenges on this site&lt;/li&gt;&#xA;&lt;li&gt;Despite now being strongly discouraged, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; have a surprisingly high average score&lt;/li&gt;&#xA;&lt;li&gt;92% of all underhanded challenges were popularity contests&lt;/li&gt;&#xA;&lt;li&gt;A few popular questions, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/11880/build-a-working-game-of-tetris-in-conways-game-of-life&quot;&gt;this one&lt;/a&gt;, heavily influence the average score of some tags like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tetris&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tetris&amp;#39;&quot; rel=&quot;tag&quot;&gt;tetris&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Of all the top 20 most often combined tags, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; are the only ones to not include &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Just 11 out of 277 tags have not been used in combination with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="66833" LastEditDate="2021-04-13T19:24:29.410" LastActivityDate="2021-04-13T19:24:29.410" Title="CGCC Data Analysis #1: Tags" Tags="|discussion|tags|data-explorer|" AnswerCount="0" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="18767" PostTypeId="2" ParentId="10127" CreationDate="2020-04-02T23:53:12.923" Score="3" Body="&lt;h2&gt;Develop a userscript to hide esoteric and/or golfing language submissions from the UI, clientside.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm one of those users who is put off by the use of golfing languages. &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;Codegolf&lt;/a&gt; has some really fun programming puzzles, but it's not fun to wade through all the esoteric and golfing language answers. I can't read them and I really don't care about those languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;What would help me is if someone were to develop a userscript that users can install (with e.g. tampermonkey and/or from &lt;a href=&quot;https://stackapps.com/&quot;&gt;https://stackapps.com/&lt;/a&gt;) to just hide all the submissions which are using esoteric and/or golfing languages, so they're out of the way.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I have zero interest to learn a golfing language. I do enjoy to see clever hacks in well known languages such as Python. A userscript or stackapp would allow people who are otherwise interested in this site to opt out of the noise in their UI, without detracting in anyway for the users who &lt;em&gt;do&lt;/em&gt; enjoy these languages. The popular convention of putting the language name in the top of an answer should make the filtering fairly easy to implement in javascript. It doesn't really matter if the userscript is not 100% accurate, it just has to work well enough to make browsing the site fun again.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For an example of what it might look like, here is a &lt;a href=&quot;https://gist.github.com/Aran-Fey/421b9c3de872000101e79b5ec771898d&quot; rel=&quot;nofollow noreferrer&quot;&gt;similar userscript&lt;/a&gt; already implemented (not mine) that hides questions from rep 1 users, which I find greatly improves the experience of browsing the main feed on stackoverflow.&lt;/p&gt;&#xA;" OwnerUserId="3480" LastEditorUserId="3480" LastEditDate="2020-04-03T01:16:53.217" LastActivityDate="2020-04-03T01:16:53.217" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18771" PostTypeId="2" ParentId="18751" CreationDate="2020-04-03T07:52:00.180" Score="12" Body="&lt;h2&gt;It's okay to add an online interpreter link for an answer.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Adding an online interpreter link allows other people to test their answers, without having to go to the online interpreter themselves. So if you find it hard to test their answers, feel free to edit in an online interpreter link to make it easier for others!&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-04-05T03:57:28.147" LastActivityDate="2020-04-05T03:57:28.147" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18772" PostTypeId="2" ParentId="18751" CreationDate="2020-04-03T08:03:38.137" Score="18" Body="&lt;h2&gt;It's &lt;em&gt;not&lt;/em&gt; okay to add a leaderboard to a challenge.&lt;/h2&gt;&#xA;&lt;p&gt;We have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7408/92069&quot;&gt;consensus&lt;/a&gt; on this topic to not add leaderboards to challenges. Although that concensus is about a bot, humans can nevertheless still employ the described behavior.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;To have bots that autonomously make edits is annoying, intrusive, and error-prone.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Mobile users have 3 huge codeblocks to scroll through before they can see the answers, especially for challenges with only a few answers. It's not really necessary, plus it makes the question harder to navigate through.&lt;/p&gt;&#xA;&lt;p&gt;Quoting &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/53318390#53318390&quot;&gt;JoKing&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;@a'_' Can you stop adding leaderboards to challenges? Especially ones with only a few answers.&lt;/p&gt;&#xA;&lt;p&gt;It's not really necessary, plus it makes looking at questions on phones more annoying&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerDisplayName="user92069" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-04-12T01:59:28.800" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18775" PostTypeId="2" ParentId="2140" CreationDate="2020-04-05T11:06:45.853" Score="0" Body="&lt;h1&gt;How many Temtem can I breed?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Temtem is a monster-catching MMORPG. Within the game you have the ability to breed two Temtem to create an egg which then hatches into the baby of its mother. The ability to do this depends on several properties of the parent Temtem:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A Temtem has a gender, which is either male or female. To breed, you need one Temtem of each gender.&lt;/li&gt;&#xA;&lt;li&gt;A Temtem has one or two types. A pair of Temtem can only breed if they have a type in common.&lt;/li&gt;&#xA;&lt;li&gt;A Temtem has a fertility which ranges from 0 to 8. Temtem with a fertitilty of 0 can no longer breed in captivity. The fertility of each parent decreases by 1 when they breed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The resulting Temtem inherits some of its properties from its parents.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The baby Temtem's gender is random. For the purposes of this question, this means that you can choose the gender, but you cannot change it later.&lt;/li&gt;&#xA;&lt;li&gt;The baby Temtem inherits its mother's type. (This is not strictly true but it is always possible to evolve the baby to give the mother's type if necessary.)&lt;/li&gt;&#xA;&lt;li&gt;The baby Temtem inherits the lesser of its parents' fertility.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Simple example:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;One female Temtem with fertility 3 and one male Temtem with fertility 2 of the same type.&lt;/li&gt;&#xA;&lt;li&gt;Breeding reduces their fertility to 2 and 1 and we choose the baby, which also has 1 fertility, to be male.&lt;/li&gt;&#xA;&lt;li&gt;The female can breed again with both males, at which point all the Temtem now have 0 fertility.&lt;/li&gt;&#xA;&lt;li&gt;This gives you a total of five Temtem.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You challenge is to write a program or function which accepts a list of Temtem and outputs the maximum number of Temtem it is possible to breed, assuming luck is on your side.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can use any convenient input method for the Temtem, as long as it breaks no standard loopholes. For instance, you could use a string of three or four characters encoding the gender, fertility and type(s). (Your input method must be able to support 12 different types and 132 different pairs of types.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You can output either the total number or the number of new Temtem, or you can also output the resulting list of Temtem in the order they were born.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2020-04-06T13:03:28.480" LastActivityDate="2020-04-06T13:03:28.480" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18778" PostTypeId="2" ParentId="18751" CreationDate="2020-04-06T12:26:57.060" Score="29" Body="&lt;h2&gt;It is OK to rectify a question's tags.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;i.e. add relevant tags and remove irrelevant tags.&lt;/p&gt;&#xA;" OwnerUserId="86301" LastEditorUserId="86301" LastEditDate="2020-04-08T14:34:13.290" LastActivityDate="2020-04-08T14:34:13.290" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18780" PostTypeId="2" ParentId="18751" CreationDate="2020-04-06T22:10:49.013" Score="9" Body="&lt;h1&gt;It is OK to remove &quot;non-competing&quot; from answers in languages that post-date the challenge&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14989&quot;&gt;https://codegolf.meta.stackexchange.com/a/14989&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="46076" LastActivityDate="2020-04-06T22:10:49.013" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18781" PostTypeId="2" ParentId="18751" CreationDate="2020-04-06T22:19:00.627" Score="6" Body="&lt;h1&gt;It is OK to correct the header of an answer&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/posts/201720/revisions&quot;&gt;Correcting the score of an answer to match the challenge's scoring rules&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/posts/153347/revisions&quot;&gt;Adding header markup to an answer whose header lacks it&lt;/a&gt; &lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/posts/2104/revisions&quot;&gt;Adding a bytecount to an answer that lacks one&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/198373/46076&quot;&gt;If the rules of a challenge require some answers to be marked non-competing, adding that annotation to answers that lack it&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;This is not intended to be an exhaustive list.&lt;/p&gt;&#xA;" OwnerUserId="46076" LastEditorUserId="46076" LastEditDate="2020-04-06T22:28:56.780" LastActivityDate="2020-04-06T22:28:56.780" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18782" PostTypeId="2" ParentId="18751" CreationDate="2020-04-06T23:01:25.230" Score="10" Body="&lt;h1&gt;It's OK to revert edits made in violation of the rules described here.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Fairly obvious, but needs stating.&lt;/p&gt;&#xA;" OwnerUserId="46076" LastActivityDate="2020-04-06T23:01:25.230" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18783" PostTypeId="1" CreationDate="2020-04-07T03:33:26.967" Score="2" ViewCount="126" Body="&lt;p&gt;I just did &lt;a href=&quot;https://codegolf.stackexchange.com/review/low-quality-posts/55460&quot;&gt;this low quality post review&lt;/a&gt;.  However I noticed that this answer has had no activity for about 3 years.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/mJvlO.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/mJvlO.png&quot; alt=&quot;Screencap&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is rather odd. The post certainly has not been sitting in the queue for the last 3 years, since the queue spends most of its time being empty.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Why did this review show up now?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="89298" LastEditDate="2020-04-07T17:15:57.397" LastActivityDate="2020-04-07T17:15:57.397" Title="Why did I just get a 3 year old review?" Tags="|discussion|reviewing|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18785" PostTypeId="2" ParentId="2140" CreationDate="2020-04-07T08:27:41.173" Score="2" Body="&lt;h2&gt;Symmetrical difference &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/203364/symmetrical-difference&quot;&gt;Post'd.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-04-12T14:26:29.577" LastActivityDate="2020-04-12T14:26:29.577" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18786" PostTypeId="2" ParentId="2140" CreationDate="2020-04-07T09:57:37.410" Score="0" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;The assignment logic may be used in a planning KoTH, in which a student bot chooses a full permutation from the classes and is awarded points from what preference they get.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Assign classes fairly and satisfyingly &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h3&gt;Background&lt;/h3&gt;&#xA;&lt;p&gt;In a school, students are signing up for after-school classes. However, the capacity of each class is limited. In order to facilitate class assignment, each student is required to fill in a questionnaire to show his/her preference to the classes by listing all classes in decreasing order of his/her interests.&lt;/p&gt;&#xA;&lt;p&gt;You are assigned to help assigning classes to them. You want to maximally satisfy their preferences while being fair with the assignment. A student can be assigned with multiple classes.&lt;/p&gt;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Write a program or function that receives the following input:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a list of classes with the corresponding capacities; and&lt;/li&gt;&#xA;&lt;li&gt;a list of students with their corresponding preference lists,&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;and output or return either:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a list of class with the list of students being assigned to that class; or&lt;/li&gt;&#xA;&lt;li&gt;a list of students with their assigned classes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may use any reasonable alternative format for both input and output, for example, apart from receiving two arrays, you may choose to receive two strings, and especially for the second input (which requires a 2-D array), you may even have an input like this (first level delimiter &lt;code&gt;\n&lt;/code&gt;, second level delimiter &lt;code&gt;space&lt;/code&gt;):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3 4&#xA;4 2 3 1&#xA;1 3 2 4&#xA;2 3 4 1&#xA;3 4 1 2&#xA;4 1 2 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;To simplify the challenge, you may assume both classes and students are 0-indexed or 1-indexed. For the use of illustrating the requirements and samples, 1-indexing is used. You may also assume that each preference list is a full permutation of all classes.&lt;/p&gt;&#xA;&lt;p&gt;The assignment requirements are as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Fairness&lt;/strong&gt;: All students must have roughly the same amount of classes assigned to them, that is, for every &lt;span class=&quot;math-container&quot;&gt;\$1\le i\le\text{[Number of students]}\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;$$\left|{\text{[Number of classes assigned]}_i-\frac{\sum\text{[Class capacities]}}{\text{[Number of students]}}}\right|&amp;lt;1.$$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Satisfaction&lt;/strong&gt;: You should fulfill the preferences as well as possible. Specifically, you should fulfill as much first preferences as possible, then as much second preferences as possible, and so on. In case of having the same preference order, the classes should be assigned on first-come-first-served basis.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The fairness rule should be taken first if it conflicts with the satisfaction rule. Test case 3 is an example of handling such conflicts.&lt;/p&gt;&#xA;&lt;p&gt;The program should terminate in finite time for all practical sizes of inputs.&lt;/p&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test case 1&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;classes = [2, 2, 2, 2],&#xA;students = [&#xA; [1, 2, 4, 3],&#xA; [2, 4, 1, 3],&#xA; [3, 4, 2, 1],&#xA; [4, 3, 2, 1]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;classes = [&#xA; [1, 3],&#xA; [2, 1],&#xA; [3, 4],&#xA; [4, 2]&#xA;],&#xA;students = [&#xA; [1, 2],&#xA; [2, 4],&#xA; [3, 1],&#xA; [4, 3]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Explanation:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It is clear that all 1st priorities can be fulfilled because all of them are different. So each student gets his 1st priority.&lt;/li&gt;&#xA;&lt;li&gt;Student 1 wants Class 2 as his 2nd priority, and Class 2 still has place for him. So he gets Class 2.&lt;/li&gt;&#xA;&lt;li&gt;Student 2 wants Class 4 as his 2nd priority, and Class 4 still has place for him. So he gets Class 4.&lt;/li&gt;&#xA;&lt;li&gt;Student 3 wants Class 4 as his 2nd priority, but Class 4 is already full. No place for him.&lt;/li&gt;&#xA;&lt;li&gt;Student 4 wants Class 3 as his 2nd priority, and Class 3 still has place for him. So he gets Class 3.&lt;/li&gt;&#xA;&lt;li&gt;Now each of the students except Student 3 has 2 classes already, so by the rule of fairness they are not considered in the subsequent assignments.&lt;/li&gt;&#xA;&lt;li&gt;Only Class 1 has place for Student 3, so he gets his 4th priority.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test case 2&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;classes = [2, 2, 2],&#xA;students = [&#xA; [3, 1, 2],&#xA; [2, 3, 1],&#xA; [2, 3, 1],&#xA; [3, 2, 1]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;classes = [&#xA; [1, 2],&#xA; [2, 3],&#xA; [1, 4]&#xA;],&#xA;students = [&#xA; [3, 1],&#xA; [2, 1],&#xA; [2],&#xA; [3]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Explanation:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It is clear that all 1st priorities can be fulfilled because none of the classes was chosen by 3 or more students as their 1st priorities.&lt;/li&gt;&#xA;&lt;li&gt;Student 1 wants Class 1 as his 2nd priority, and Class 1 still has place for him. So he gets Class 1.&lt;/li&gt;&#xA;&lt;li&gt;Student 2 wants Class 3 as his 2nd priority, but Class 3 is already full. No place for him.&lt;/li&gt;&#xA;&lt;li&gt;Student 3 wants Class 3 as his 2nd priority, but Class 3 is already full. No place for him.&lt;/li&gt;&#xA;&lt;li&gt;Student 4 wants Class 2 as his 2nd priority, but Class 2 is already full. No place for him.&lt;/li&gt;&#xA;&lt;li&gt;Now Student 1 has 2 classes already, so by the rule of fairness he is not considered in the subsequent assignments.&lt;/li&gt;&#xA;&lt;li&gt;Student 2 wants Class 1 as his 3rd priority, and Class 1 still has place for him. So he gets Class 1.&lt;/li&gt;&#xA;&lt;li&gt;All classes are already full, so no more seats can be assigned. Students 3 and 4 will only get 1 class each.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test case 3&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;classes = [1, 1, 1, 2],&#xA;students = [&#xA; [1, 2, 4, 3],&#xA; [3, 4, 2, 1],&#xA; [2, 4, 3, 1],&#xA; [2, 4, 1, 3]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;classes = [&#xA; [1],&#xA; [3],&#xA; [2],&#xA; [4, 2]&#xA;],&#xA;students = [&#xA; [1],&#xA; [3, 4],&#xA; [2],&#xA; [4]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Explanation:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It is clear that all 1st priorities except for Student 4 can be fulfilled.&lt;/li&gt;&#xA;&lt;li&gt;If we ignore Student 4 and proceed to the second round, Student 2 and 3 will occupy the remaining seats and Student 4 will not get a place (which is disallowed by the fairness rule), so the 2nd priority of Student 4 will be considered first. Since Class 4 still has place for him, he gets Class 4.&lt;/li&gt;&#xA;&lt;li&gt;Student 1 wants Class 2 as his 2nd priority, but Class 2 is already full. No place for him.&lt;/li&gt;&#xA;&lt;li&gt;Student 2 wants Class 4 as his 2rd priority, and Class 4 still has place for him. So he gets Class 4.&lt;/li&gt;&#xA;&lt;li&gt;All classes are already full, so no more seats can be assigned. All students get 1 class each, except Student 2, who gets 2 classes.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test case 4&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;classes = [1, 1, 1, 2],&#xA;students = [&#xA; [1, 2, 4, 3],&#xA; [3, 4, 2, 1],&#xA; [2, 4, 3, 1],&#xA; [2, 1, 3, 4]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;classes = [&#xA; [1],&#xA; [4],&#xA; [2],&#xA; [2, 3]&#xA;],&#xA;students = [&#xA; [1],&#xA; [3, 4],&#xA; [4],&#xA; [2]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Explanation:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It is clear that all 1st priorities except for Student 4 can be fulfilled.&lt;/li&gt;&#xA;&lt;li&gt;If we ignore Student 4 and proceed to the second round, Student 2 and 3 will occupy the remaining seats and Student 4 will not get a place (which is disallowed by the fairness rule), so the 2nd priority of Student 4 will be considered first. However both Classes 1 and 3 are full, he can only get Class 4.&lt;/li&gt;&#xA;&lt;li&gt;The remaining place for Class 4 goes to Student 2, and we have 3 1st priorities, 1 2nd priority and 1 4th priority fulfilled.&lt;/li&gt;&#xA;&lt;li&gt;But this is not the best. By breaking the first-come-first-served rule for 1st priority, we can get the best - 3 1st priorities and 2 2nd priorities fulfilled.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Winning Condition&lt;/h3&gt;&#xA;&lt;p&gt;This is a code-golf challenge, so the shortest submission for each language wins. Standard loopholes are forbidden.&lt;/p&gt;&#xA;" OwnerUserId="71546" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-04-14T01:19:22.017" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18787" PostTypeId="2" ParentId="18751" CreationDate="2020-04-07T10:51:16.300" Score="8" Body="&lt;h2&gt;It's &lt;em&gt;not&lt;/em&gt; okay to edit someone else's off topic post.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In fact we've already &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14838/on-editing-somebody-elses-off-topic-question-to-make-it-on-topic-without-the-ow&quot;&gt;reached&lt;/a&gt; a consensus on this. If you edit an off-topic post to make it well-received, OP will think that it is okay to post these kinds of questions on this site. Instead, people should notify the OP about why the question is not well recieved. If really neccecary, another user should take control over the post and post the on-topic modification on a separate post.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-04-07T23:12:11.950" LastActivityDate="2020-04-07T23:12:11.950" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18788" PostTypeId="2" ParentId="18751" CreationDate="2020-04-07T10:55:16.937" Score="9" Body="&lt;h2&gt;It is okay if you are adding syntax highlighting to a post.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1109/92069&quot;&gt;this&lt;/a&gt; post, the most upvoted answer (i.e. the consensus) says something along the lines of syntax highlighting making posts a lot more easier to read.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-04-07T23:12:04.870" LastActivityDate="2020-04-07T23:12:04.870" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18789" PostTypeId="2" ParentId="18751" CreationDate="2020-04-07T17:19:32.353" Score="14" Body="&lt;h1&gt;It is not OK to edit someone's post if they disagree with the edit.&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;This is a network-wide rule.&lt;/strong&gt; If a post-owner disagrees with your edit, and the edit is important, get a moderator involved.&lt;/p&gt;&#xA;" OwnerUserId="89298" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-04-09T15:01:27.220" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18790" PostTypeId="2" ParentId="2140" CreationDate="2020-04-07T17:29:24.327" Score="0" Body="&lt;h1&gt;chaining couples with parity &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integers&amp;#39;&quot; rel=&quot;tag&quot;&gt;integers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; rel=&quot;tag&quot;&gt;array&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Take the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; first integers (with 0 included or not) with &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; an&#xA;&lt;strong&gt;even number&lt;/strong&gt; except 0.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The goal is to produce a (not so) &lt;em&gt;random&lt;/em&gt; chain of couples with&#xA;these numbers, for example with &lt;span class=&quot;math-container&quot;&gt;\$n=6\$&lt;/span&gt; : &lt;code&gt;(5, 4), (1, 6), (3, 2)&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But you have to respect a bit of parity and randomness :&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Each second number in a couple must have the same parity than&#xA;the first number of the next couple. No rule for the first number&#xA;of the first couple and the second number of the last couple. So&#xA;the example above is not a correct answer.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;(5, 4), (6, 1), (3, 2)&lt;/code&gt; is a correct answer for &lt;span class=&quot;math-container&quot;&gt;\$n=6\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So this is a sort of parity chain.&lt;/p&gt;&#xA;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;First number (of the first couple) has to be chosen randomly (uniform) in the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; first integers. &lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;An even number &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; greater or equal than 2.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Valid output examples&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Input: &lt;span class=&quot;math-container&quot;&gt;\$n=2\$&lt;/span&gt; Outputs &lt;code&gt;(1, 2)&lt;/code&gt; and &lt;code&gt;(2, 1)&lt;/code&gt; are valid.&#xA;&lt;code&gt;(0, 1)&lt;/code&gt; and &lt;code&gt;(1,0)&lt;/code&gt; are also.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Input: &lt;span class=&quot;math-container&quot;&gt;\$n=4\$&lt;/span&gt; Output: &lt;code&gt;(0, 1), (3, 2)&lt;/code&gt; (if start with 0)&#xA;because 1 and 3 are odd&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Input: &lt;span class=&quot;math-container&quot;&gt;\$n=4\$&lt;/span&gt; Output: &lt;code&gt;(1, 4), (2, 3)&lt;/code&gt; (if start with 0)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Input: &lt;span class=&quot;math-container&quot;&gt;\$n=6\$&lt;/span&gt; Output: &lt;code&gt;(0, 5), (1, 3), (4, 2)&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Input: &lt;span class=&quot;math-container&quot;&gt;\$n=8\$&lt;/span&gt;  Output: &lt;code&gt;(6, 7), (1, 0), (2, 5), (3, 4)&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Invalid output examples&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Input: &lt;span class=&quot;math-container&quot;&gt;\$n=4\$&lt;/span&gt; Output:&lt;code&gt;(1, 2), (3, 4)&lt;/code&gt; because 2 is even and 3&#xA;is odd.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Input: &lt;span class=&quot;math-container&quot;&gt;\$n=6\$&lt;/span&gt; Output:&lt;code&gt;(5, 4), (1, 6), (3, 2)&lt;/code&gt; because 4 is even and 1&#xA;is odd and also because 6 is even and 3 is odd.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;What if &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is odd?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;No rule for &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; if it's odd. All outputs accepted!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What about output's format?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;No special formatting is expected. You just have to separate the&#xA;couples such that one can correctly see them.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Duplicate?&lt;/p&gt;&#xA;" OwnerUserId="81828" LastEditorUserId="81828" LastEditDate="2020-04-11T12:54:42.610" LastActivityDate="2020-04-11T12:54:42.610" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18793" PostTypeId="2" ParentId="2140" CreationDate="2020-04-08T02:39:37.460" Score="1" Body="&lt;h1&gt;Similar Numbers &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/203185/another-similar-number&quot;&gt;posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="89856" LastEditorUserId="89856" LastEditDate="2020-04-08T07:01:23.963" LastActivityDate="2020-04-08T07:01:23.963" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18794" PostTypeId="2" ParentId="18751" CreationDate="2020-04-08T05:40:38.277" Score="8" Body="&lt;h2&gt;It's &lt;em&gt;not&lt;/em&gt; okay to remove outdated content from a post&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Just comment and let OP handle it. You should &lt;em&gt;never&lt;/em&gt; do it yourself.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-04-11T08:49:37.847" LastActivityDate="2020-04-11T08:49:37.847" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18795" PostTypeId="2" ParentId="2140" CreationDate="2020-04-08T07:33:00.470" Score="1" Body="&lt;h1&gt;Compactify the input &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; rel=&quot;tag&quot;&gt;compression&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/203387/compactify-the-input&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2020-04-12T13:19:45.233" LastActivityDate="2020-04-12T13:19:45.233" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="18798" PostTypeId="2" ParentId="18761" CreationDate="2020-04-08T18:55:46.757" Score="1" Body="&lt;p&gt;If it's a dupe, then close it yourself as such. Otherwise, do nothing.&lt;/p&gt;&#xA;" OwnerUserId="89298" LastActivityDate="2020-04-08T18:55:46.757" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18799" PostTypeId="2" ParentId="2140" CreationDate="2020-04-08T19:20:44.020" Score="1" Body="&lt;h1&gt;How Many Ways To Empty The Glove Box?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/203343/how-many-ways-to-empty-the-glove-box&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="69880" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-04-12T21:03:59.277" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18800" PostTypeId="2" ParentId="2140" CreationDate="2020-04-09T05:39:37.203" Score="3" Body="&lt;h2&gt;Sum in 2540 Sums &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pristine-programming&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pristine-programming&amp;#39;&quot; rel=&quot;tag&quot;&gt;pristine-programming&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-shuffleboard&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-shuffleboard&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-shuffleboard&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;This is my attempt to pair &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-shuffleboard&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-shuffleboard&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-shuffleboard&lt;/a&gt; with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You need to write a program that sums all codepoints of the input string.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input will always be in printable ASCII.&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The sum of the codepoints of your source must be exactly 2540.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You are allowed to use your language's own code page to calculate your program's codepoints.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Null bytes (which don't contribute to your codepoint sum) are banned.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;The program must not work with any consecutive substring removed.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. Your score is the length of your source code, the shorter being better.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-04-12T07:42:35.323" LastActivityDate="2020-04-12T07:42:35.323" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18804" PostTypeId="1" CreationDate="2020-04-09T19:10:14.907" Score="1" ViewCount="97" Body="&lt;p&gt;I've been thinking about creating a language where it's impossible to create a constant with a known value. Thus, it's impossible to guarantee a program will work 100% of the time (though you'd be able to achieve an arbitrarily high accuracy, at the cost of bytes).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My question is, would it be allowed to use this language? Would there be some threshold, like a requirement for it to work with at least a certain probability?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'd imagine this would be similar to golfing languages, in that they have the advantage of being designed to complete challenges more efficiently, and thus they aren't competing with other languages.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Also, from my (very very limited) understanding, isn't the result of quantum computers the most probable answer, rather than one guaranteed to be correct? In the future there may be quantum-based languages which will need a similar consensus (assuming my understanding is correct).&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2020-04-09T19:45:32.180" Title="Would randomness-based languages be allowed?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ClosedDate="2020-04-09T22:08:07.780" ContentLicense="CC BY-SA 4.0" />
  <row Id="18805" PostTypeId="2" ParentId="18804" CreationDate="2020-04-09T19:45:32.180" Score="3" Body="&lt;p&gt;First off I want to challenge the assumption in your challenge:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;[...] it's impossible to create a constant with a known value. Thus, it's impossible to guarantee a program will work 100% of the time [...]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The second claim doesn't actually follow from the first.  A language can have baked in unavoidable randomness and still be capable of creating fully deterministic programs. To see how we can look at &lt;a href=&quot;https://esolangs.org/wiki/Lost&quot; rel=&quot;nofollow noreferrer&quot;&gt;lost&lt;/a&gt;, a language with a randomized execution order.  Despite the fact that it can start anywhere in the program deterministic programming in lost is possible, and there are &lt;a href=&quot;https://codegolf.stackexchange.com/a/175278/56656&quot;&gt;several&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/155220/56656&quot;&gt;answers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/169968/56656&quot;&gt;in&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/155002/56656&quot;&gt;lost&lt;/a&gt; already on the site.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The limitation makes programming in lost &lt;em&gt;way&lt;/em&gt; harder, but it is also the reason to program in lost.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you design a programming language with such serious limitations you have to deal with the fact that it will not be able to compete in every challenge. If you want it to be able to compete then you should not limit it, or you should design it so that the limits can be overcome with ingenuity. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, there are plenty of challenges on this site that require random output, so if you do eliminate the possibility of deterministic output, you can always limit yourself to those challenges.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2020-04-09T19:45:32.180" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18807" PostTypeId="2" ParentId="18751" CreationDate="2020-04-10T14:57:02.307" Score="20" Body="&lt;h1&gt;It is NOT ok to remove rules from a challenge, even if they are listed as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8047/46076&quot;&gt;things to avoid when writing challenges&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="46076" LastActivityDate="2020-04-10T14:57:02.307" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18808" PostTypeId="2" ParentId="18751" CreationDate="2020-04-10T18:12:30.890" Score="12" Body="&lt;h1&gt;It's &lt;em&gt;not&lt;/em&gt; okay to add an explanation of the code&lt;/h1&gt;&#xA;&lt;p&gt;That should be left to the author. Explaining the code is a &lt;em&gt;sensitive&lt;/em&gt; area. You can't be sure that your comments exactly reflect the author's &lt;em&gt;intent&lt;/em&gt;. There may be &lt;em&gt;subtleties&lt;/em&gt; you are missing when interpreting the code written by another.&lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2022-09-22T17:08:08.217" LastActivityDate="2022-09-22T17:08:08.217" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18809" PostTypeId="2" ParentId="18751" CreationDate="2020-04-11T08:08:59.117" Score="7" Body="&lt;h2&gt;It is &lt;em&gt;not&lt;/em&gt; ok to edit if you are removing background information&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It's not okay to remove the question's background information, &lt;em&gt;even if&lt;/em&gt; the background informattion is not relevant to the main challenge. If OP thinks the background information makes the challenge clear, allow OP to add that.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-04-11T08:51:37.677" LastActivityDate="2020-04-11T08:51:37.677" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18810" PostTypeId="2" ParentId="18751" CreationDate="2020-04-11T08:19:27.997" Score="14" Body="&lt;h2&gt;It's &lt;em&gt;not&lt;/em&gt; okay to modify code.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is based on a merging of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18807/92069&quot;&gt;this&lt;/a&gt; answer and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18753/92069&quot;&gt;this&lt;/a&gt; answer.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In general, never modify the code part of the answer, &lt;em&gt;even if&lt;/em&gt; it employs one of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard Loopholes&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an invalid answer, commenting and flagging are the appropriate actions to take.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-04-17T01:18:35.050" LastActivityDate="2020-04-17T01:18:35.050" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18811" PostTypeId="2" ParentId="2140" CreationDate="2020-04-11T10:02:07.053" Score="0" Body="&lt;h1&gt;Check my Knight's Tour&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given as input an &lt;code&gt;n&lt;/code&gt;-by-&lt;code&gt;n&lt;/code&gt; matrix of integers, check that all integers from &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;n²&lt;/code&gt; are present, and that all pairs of consecutive integers are exactly a Knight's move apart. (For instance, a &lt;code&gt;4&lt;/code&gt;-by-&lt;code&gt;4&lt;/code&gt; board with the values&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 2 1 2&#xA;2 1 2 1&#xA;1 2 1 2&#xA;2 1 2 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&#xA;would meet the condition that all &lt;code&gt;1&lt;/code&gt;s would have a &lt;code&gt;2&lt;/code&gt; that was exactly a Knight's move away, but this would of course not constitute a Knight's Tour.) The integers &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;n²&lt;/code&gt; do NOT need to be a Knight's move apart. You must be able to support at least 7 different values for &lt;code&gt;n&lt;/code&gt; including &lt;code&gt;10&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A Knight's move is possible between any two squares that are a Euclidean distance of √5 apart.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output follows normal &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="31625" LastEditDate="2020-04-12T15:55:39.563" LastActivityDate="2020-04-12T15:55:39.563" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18812" PostTypeId="2" ParentId="2140" CreationDate="2020-04-11T10:35:47.583" Score="0" Body="&lt;h1&gt;Euler's Geometry Puzzle&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/203492/eulers-geometry-puzzle&quot;&gt;posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="89856" LastEditorUserId="89856" LastEditDate="2020-04-14T12:03:23.420" LastActivityDate="2020-04-14T12:03:23.420" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="18813" PostTypeId="2" ParentId="18751" CreationDate="2020-04-11T16:16:58.597" Score="-6" Body="&lt;h1&gt;It &lt;em&gt;is&lt;/em&gt; OK to Add an Explanation&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Above there's already a contradicting &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18751/when-it-is-and-is-not-acceptable-to-edit-someone-elses-post/18808#18808&quot;&gt;answer&lt;/a&gt;. Originally, I was posting this as a comment. Decided to submit my own answer and let the community decide:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;While there &lt;em&gt;are&lt;/em&gt; subtleties that may be missed, I feel strongly that &lt;em&gt;some&lt;/em&gt; explanation is better than no explanation. I'd hope we'd all prefer to live in a CGCC populated with well-explained answers and minimal code-only answers.&lt;/p&gt;&#xA;&lt;p&gt;Since we already have a consensus on code-only answers being low-quality and undesirable, it seems to post an answer without one is to implicitly give permission to the community to add it.&lt;/p&gt;&#xA;&lt;h3&gt;Fine Print&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;An explanation may not be edited, one must comment to correct. That would assume better knowledge, risk losing the aforementioned 'subtleties' and require the edit's approver to know the language.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If they add a note along the lines of &lt;em&gt;Will add explanation&lt;/em&gt;, usually waiting to see if it garners attention before slaving away, one shouldn't edit until &lt;em&gt;3 days&lt;/em&gt; have passed since they posted.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Note&lt;/h3&gt;&#xA;&lt;p&gt;I'm trying this out generally. However, I can see the case for conventional &amp;amp; verbose languages like C/Python/Ruby/Haskell, as there's far greater ambiguity with those.&lt;/p&gt;&#xA;&lt;p&gt;If downvoted into oblivion, I will post another answer specifically for terse, SBCS (usually golf) languages like APL/05AB1E/CJam as that seems far less controversial. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/a/201251/87594&quot;&gt;given&lt;/a&gt; &lt;code&gt;/⍨⍳4&lt;/code&gt; → &lt;code&gt;1223334444&lt;/code&gt; adding the following hardly seems controversial:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;⍳4        ⍝ Integers 1..4&#xA;   ⍨      ⍝ Duplicate argument on each side&#xA;     /    ⍝ Replicate each element `n` times&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="87594" LastEditorUserId="87594" LastEditDate="2020-08-12T09:51:13.453" LastActivityDate="2020-08-12T09:51:13.453" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18814" PostTypeId="2" ParentId="18751" CreationDate="2020-04-12T03:01:17.793" Score="-4" Body="&lt;h1&gt;It &lt;em&gt;is&lt;/em&gt; OK to Add an Explanation for &lt;em&gt;SBCS&lt;/em&gt;&lt;sup&gt;1&lt;/sup&gt; languages&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Above there's already a contradicting &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18751/when-it-is-and-is-not-acceptable-to-edit-someone-elses-post/18808#18808&quot;&gt;answer&lt;/a&gt;. I also put my &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18813/87594&quot;&gt;own&lt;/a&gt; thoughts on allowing explanations for all languages which was ill-received. Here's I propose only for a certain class of languages:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I can see the case for disallowing the addition of explanations to more conventional &amp;amp; verbose languages like C/Python/Ruby/Haskell, as there's far greater ambiguity with explaining them. They don't require consulting an encyclopedia given reasonable familiarity with the language.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, for the terse, SBCS (usually golf) languages – the fun ones! – the case is different. Think 05AB1E, Jelly, CJam, Pyth, Golfscript &amp;amp; even APL/J... Vim?! Many of them must be read by consulting the documentation for each character. More importantly, doing so is &lt;em&gt;entirely unambiguous&lt;/em&gt;. For instance, see 05AB1E's codepage &lt;a href=&quot;https://github.com/Adriandmen/05AB1E/wiki/Commands&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;. The first 5 lines:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;╔══════════╦═══════════════════╦════════════════════════════════════════════════════════════════════════════════════╗&#xA;║ Command  ║  Elements Popped  ║                                     Description                                    ║&#xA;╠══════════╬═══════════════════╬════════════════════════════════════════════════════════════════════════════════════╣&#xA;║ ǝ        ║  a,b,c            ║   Replace the element of 'a' at index 'c' with 'b'                                 ║&#xA;║ ʒ        ║  a                ║   Filter 'a'. Keep the elements where the result of the code is 1. Usage: ʒ CODE } ║&#xA;║ α        ║  a,b              ║   Absolute difference of 'a' and 'b'                                               ║&#xA;║ β        ║  a,b              ║   Convert 'a' from base 'b' (arbitrary)                                            ║&#xA;║ γ        ║  a                ║   Split 'a' into chunks of equal adjacent elements.                                ║&#xA;╚══════════╩═══════════════════╩════════════════════════════════════════════════════════════════════════════════════╝&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Closing Case&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;An explanation in such languages usually just means pasting the definition of each character from the doc's help page or wiki. This may be done, and verified, with little to no expertise in the language and make a world of a difference, from impenetrable gobbledy-gook to perfect English.&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Everyone trudges through the same braindead labor to understand a code-only answer in a language like O5AB1E, painstakingly looking up each symbol. If one person does the work for us, no one else has to!&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;br&gt;&#xA;&lt;sup&gt;1&lt;/sup&gt; The exact rule to categorize the class of languages I'm referring to is a work-in-progress. I'd appreciate any suggestions on improving it, but for now I think at least the idea is clear enough!&lt;/p&gt;&#xA;" OwnerUserId="87594" LastEditorUserId="87594" LastEditDate="2020-04-12T03:36:48.840" LastActivityDate="2020-04-12T03:36:48.840" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18816" PostTypeId="2" ParentId="2140" CreationDate="2020-04-12T04:56:47.723" Score="0" Body="&lt;h1&gt;Rot1Rot3 &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write a program or function such that given a string &lt;span class=&quot;math-container&quot;&gt;\$ S \$&lt;/span&gt;, encode it with &lt;em&gt;Rot1Rot3&lt;/em&gt;. To encode it, do the following:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Take &lt;span class=&quot;math-container&quot;&gt;\$ S\$&lt;/span&gt; and partition it into blocks with &lt;span class=&quot;math-container&quot;&gt;\$ 3 \$&lt;/span&gt; characters each. If it does not partition equally (i.e. &lt;span class=&quot;math-container&quot;&gt;\$ |S| \bmod 3 \neq 0 \$&lt;/span&gt;), take away some characters from the end of the string until it does, and form a smaller partition from the 'taken-away' characters.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For each individual partition, rotate it to the right by &lt;span class=&quot;math-container&quot;&gt;\$ 1 \$&lt;/span&gt; step.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Finally, rotate all of the partitions together to the right by &lt;span class=&quot;math-container&quot;&gt;\$ 3 \$&lt;/span&gt; steps, as if each partition were one character.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Input:&lt;/em&gt; &lt;code&gt;Hello, code golf!&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Partition it like so: &lt;code&gt;|Hel|lo,| co|de |gol|f!|&lt;/code&gt; (pipes to show separation). Notice that &lt;code&gt;f!&lt;/code&gt; does not form a full partition, and is therefore left as a partition with &lt;span class=&quot;math-container&quot;&gt;\$ 2 \$&lt;/span&gt; characters instead.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Rotate each individual partition to the right by &lt;span class=&quot;math-container&quot;&gt;\$ 1 \$&lt;/span&gt; step: &lt;code&gt;|lHe|,lo|o c| de|lgo|!f|&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Rotate the partitions as a whole to the right by &lt;span class=&quot;math-container&quot;&gt;\$ 3 \$&lt;/span&gt; steps: &lt;code&gt;| de|lgo|!f|lHe|,lo|o c|&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Final Output&lt;/em&gt;: &lt;code&gt; delgo!flHe,loo c&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Additional Info&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can expect any sequence of any characters, as long as they are &lt;a href=&quot;http://facweb.cs.depaul.edu/sjost/it212/documents/ascii-pr.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;printable&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Hello, code golf!&#xA;flog yhcrana&#xA;Rot1Rot3&#xA;abababa&#xA;import this&#xA;1&#xA;21&#xA;All animals are equal, but some animals are more equal than others.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; delgo!flHe,loo c&#xA;yg rhcaanofl&#xA;tRoo1R3t&#xA;aabbbaa&#xA;torh tsipim&#xA;1&#xA;12&#xA;hotser.lAln aaim lsearq eluab,  utmsoae mnisalr ame eorq eluah t an&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="88546" LastActivityDate="2020-04-12T04:56:47.723" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18817" PostTypeId="2" ParentId="2140" CreationDate="2020-04-12T23:54:55.217" Score="0" Body="&lt;h1&gt;Draw a Bracket&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Bracket_(tournament)&quot; rel=&quot;nofollow noreferrer&quot;&gt;bracket&lt;/a&gt; is a way of organizing a tournament as a tree structure.  It follows several rounds of matches with half of the competitors being eliminated each round, until one competitor remains.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this challenge you will be given as input a list of one digit &lt;span class=&quot;math-container&quot;&gt;\$(0-9)\$&lt;/span&gt; integers as input representing competitors and you should output an ASCII representation of a bracket.  The exact specifications are in the &lt;strong&gt;Output&lt;/strong&gt; section of this challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example if the input is &lt;code&gt;1 2 3 4 5 6 7 8&lt;/code&gt; then the output would be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA; 1&#xA;2&#xA;  1&#xA;3&#xA; 3&#xA;4&#xA;   1&#xA;5&#xA; 5&#xA;6&#xA;  5&#xA;7&#xA; 7&#xA;8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;In this challenge the lower number is always the winner in a matchup.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input will always be of length &lt;span class=&quot;math-container&quot;&gt;\$2^n\$&lt;/span&gt; for some positive integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, and will consist entirely of one digit numbers.  You may take the integers as their representative characters instead if this pleases you.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I will explain precisely how the output is created momentarily, it is a bit hard.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; the shortest answer in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2020-04-13T15:59:57.070" LastActivityDate="2020-04-13T15:59:57.070" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18818" PostTypeId="2" ParentId="2140" CreationDate="2020-04-12T23:57:20.580" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/203498/are-you-ready-to-meet-the-elite-four&quot;&gt;posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="59642" LastEditorUserId="59642" LastEditDate="2020-04-14T14:14:37.307" LastActivityDate="2020-04-14T14:14:37.307" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18819" PostTypeId="2" ParentId="2140" CreationDate="2020-04-13T00:00:04.560" Score="0" Body="&lt;h1&gt;How could these rep and scores have happened?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Challenge: Given a reputation score, a count of questions with accepted answers, and a list of net votes on questions, calculate a sequence of actions that could have produced them. To keep this simple, here's a few simplifications from how Stack Exchange actually works:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The only things that change reputation are upvotes on questions (+10), downvotes on questions (-2), and accepting an answer to a question (+2).&lt;/li&gt;&#xA;&lt;li&gt;The daily cap of 200 never comes into play.&lt;/li&gt;&#xA;&lt;li&gt;Votes are never retracted and accepts are never rescinded.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The minimum possible reputation of 1 still applies. If there are multiple sequences of actions that can produce the given state, then your program/function should return the shortest possible sequence (or one of the shortest, if there's multiple that are tied for the shortest). If there are no sequences of actions that can produce the given state, consider that Undefined Behavior, so it doesn't matter what your program does.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Examples/test cases:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A user has 1 reputation, hasn't accepted any answers, and has no questions. The shortest possible sequence is &quot;&quot;.&lt;/li&gt;&#xA;&lt;li&gt;A user has 33 reputation, has accepted 1 answer, and has questions with scores 2 and 1. A shortest possible sequence is &quot;upvote, upvote, upvote, accept&quot;.&lt;/li&gt;&#xA;&lt;li&gt;A user has 3 reputation, hasn't accepted any answers, and has a question with score -5. The shortest possible sequence is &quot;downvote, downvote, upvote, downvote, downvote, downvote, downvote&quot;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The standard restrictions against loopholes apply. I/O may be in any convenient format. Examples: For input, &lt;code&gt;[101,0,4,3,2,1]&lt;/code&gt; or &lt;code&gt;(101,0,[4,3,2,1])&lt;/code&gt; could mean a user with 101 reputation, 0 questions with accepted answers, and questions with scores 4, 3, 2, and 1. For output, the string &lt;code&gt;UDA&lt;/code&gt; could mean &quot;upvote, downvote, accept&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is code golf, so the shortest program/function wins.&lt;/p&gt;&#xA;" OwnerUserId="81540" LastActivityDate="2020-04-13T00:00:04.560" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18821" PostTypeId="1" AcceptedAnswerId="18822" CreationDate="2020-04-14T00:24:19.743" Score="1" ViewCount="134" Body="&lt;p&gt;Many programming languages support a function which executes a shell command. C has &lt;code&gt;system()&lt;/code&gt;, Python has &lt;code&gt;os.system()&lt;/code&gt;, and there is a whole list on &lt;a href=&quot;https://rosettacode.org/wiki/Execute_a_system_command&quot; rel=&quot;nofollow noreferrer&quot;&gt;Rosetta Code&lt;/a&gt;. And although I haven't seen many examples of people exploiting this on CGCC, there are cases where it saves some bytes. For example in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/62230/simple-cat-program&quot;&gt;Simple cat program&lt;/a&gt;, there is a 21-byte C solution: &lt;code&gt;main(){system(&quot;dd&quot;);}&lt;/code&gt;, which is shorter than any of the C solutions I've seen.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So is this allowed? Or should it be considered a standard loophole?&lt;/p&gt;&#xA;" OwnerUserId="88546" LastActivityDate="2020-04-29T23:05:32.030" Title="Are we allowed to submit an answer which executes a shell command?" Tags="|discussion|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18822" PostTypeId="2" ParentId="18821" CreationDate="2020-04-14T00:49:45.680" Score="3" Body="&lt;h2&gt;It is fine, but ...&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;... most people don't do it.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A programming language is defined by its implementation so if the implementation has a way of calling shell commands then the language does.  In terms of our existing policy these are clearly already allowed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is also, in my opinion, the most sensible policy.  We can already see that there is not a huge flood answers using this trick.  When left to their own devices members of our site choose not to do this most of the time.  So I don't see any benefit in banning it.  And if we did ban it we would get into the usual fuzzy edge case deliberation and the definition of what really constitutes this trick would have to be complex.  A lot of worth for no or negative gain.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So why don't users do this already?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Well here I have to speculate, but I think it has to do with out site culture.  We really value the cleverness or skill of the golf perhaps more than we actually value short code.  I golf in Haskell because I like Haskell and I want to golf in Haskell.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Using the shell and a generic wrapper defeats this purpose, I might as well just golf in the shell anyway.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I think that it not being very fun to do is a strong enough incentive structure for us. &lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2020-04-14T00:49:45.680" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18823" PostTypeId="1" CreationDate="2020-04-14T01:52:02.877" Score="0" ViewCount="98" Body="&lt;p&gt;We have &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; which lets us have challenges involving things other than byte count. So I wonder if &lt;a href=&quot;https://ruwix.com/the-rubiks-cube/fmc-fewest-move-count-challenge-method-tips/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Rubik's Cube fewest move challenge (FMC)&lt;/a&gt; type challenges are allowed. I see no objections but maybe there is something that prevents these challenges from being appropriate for the site.&lt;/p&gt;&#xA;" OwnerUserId="17360" LastActivityDate="2020-04-14T01:52:02.877" Title="Are Rubik's Cube fewest move type challenges allowed?" Tags="|discussion|code-golf|" AnswerCount="0" CommentCount="7" ClosedDate="2020-04-24T08:13:39.813" ContentLicense="CC BY-SA 4.0" />
  <row Id="18826" PostTypeId="2" ParentId="2140" CreationDate="2020-04-14T13:03:46.583" Score="0" Body="&lt;h2&gt;This Question Has _____ Views &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stack-exchange-api&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stack-exchange-api&amp;#39;&quot; rel=&quot;tag&quot;&gt;stack-exchange-api&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/203590/this-question-has-views&quot;&gt;posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="29520" LastEditorUserId="29520" LastEditDate="2020-04-16T12:32:35.640" LastActivityDate="2020-04-16T12:32:35.640" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18828" PostTypeId="2" ParentId="2140" CreationDate="2020-04-16T05:28:34.757" Score="0" Body="&lt;h2&gt;Convert CSV to GeoJSON&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given an input in this CSV format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Latitude,Longitude,Name,Value&#xA;-37,145,Melbourne,4500000&#xA;-34,150,Sydney,5000000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;produce this output (GeoJSON):&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;{&#xA;    &quot;type&quot;: &quot;FeatureCollection&quot;,&#xA;    &quot;features&quot;: [&#xA;        {&#xA;            &quot;type&quot;: &quot;Feature&quot;,&#xA;            &quot;properties&quot;: {&#xA;                &quot;Name&quot;: &quot;Melbourne&quot;,&#xA;                &quot;Value: &quot;4500000&quot;&#xA;            },&#xA;            &quot;geometry&quot;: {&#xA;                &quot;type&quot;: &quot;Point&quot;,&#xA;                &quot;coordinates&quot;: [-37, 145]&#xA;            }&#xA;        }&#xA;    ],&#xA;...&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You may assume that:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input will always be a well formed CSV file in this format. (No meta rows/front matter, no quoted strings, no spaces between fields, no problematic characters.)&lt;/li&gt;&#xA;&lt;li&gt;The input will contain one &quot;Longitude&quot; and one &quot;Latitude&quot; column, capitalised that way.&lt;/li&gt;&#xA;&lt;li&gt;The Latitude and Longitude columns may not be in that order, nor necessarily the first two columns.&lt;/li&gt;&#xA;&lt;li&gt;The number of other columns may be zero or many. They must all be converted.&lt;/li&gt;&#xA;&lt;li&gt;There will always be one header row. There may not be any data rows.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Notes regarding the output:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;must be valid GeoJSON (test with geojsonlint.com if you're not sure). Note: There &lt;em&gt;must&lt;/em&gt; be a properties object, even if it is &lt;code&gt;{}&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;is correct if it is semantically equivalent. (The order of keys does not matter).&lt;/li&gt;&#xA;&lt;li&gt;Whitespace does not matter.&lt;/li&gt;&#xA;&lt;li&gt;Treat all properties as strings.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Input and output in any of the standard ways for text input/output. Note the output must be &lt;em&gt;text&lt;/em&gt;, not an &lt;em&gt;object&lt;/em&gt;. (Ie, in JavaScript, use &lt;code&gt;JSON.stringify()&lt;/code&gt;)&lt;/p&gt;&#xA;" OwnerUserId="30512" LastActivityDate="2020-04-16T05:28:34.757" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18829" PostTypeId="2" ParentId="2140" CreationDate="2020-04-16T07:44:09.500" Score="0" Body="&lt;h1&gt;Finitly inverese in base N &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Your task is when given a base N (you can assume it's &lt;span class=&quot;math-container&quot;&gt;\$ \geq2 \$&lt;/span&gt;) you need to output all natural numbers for which the decimal expansion of &lt;span class=&quot;math-container&quot;&gt;\$ \frac{1}{x} \$&lt;/span&gt; in base N is finite.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;You can take the base N in any reasonable format, and you also may take an additional number N, depending on what output format you chose.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;You have 3 options for the output format:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take a number &lt;code&gt;n&lt;/code&gt; and output the &lt;code&gt;n&lt;/code&gt;-th number in the sequence&lt;/li&gt;&#xA;&lt;li&gt;Take a number &lt;code&gt;n&lt;/code&gt; and output first n numbers in the sequence&lt;/li&gt;&#xA;&lt;li&gt;Take no additional input and output the list indefinitely&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;10 -&amp;gt; [1, 2, 4, 5, 8, 10, 16, 20, 25, 32, 40, 50, 64, 80, 100, 125, 128, 160, 200, 250, 256, 320, 400, 500, 512, 625, 640, 800, 1000, 1024, 1250, 1280, 1600, 2000, 2048, 2500, 2560, 3125, 3200, 4000, 4096, 5000, 5120, 6250, 6400, 8000, 8192, 10000, ...]&#xA;2 -&amp;gt; [1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, ...]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-04-16T07:44:09.500" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18830" PostTypeId="2" ParentId="2140" CreationDate="2020-04-16T13:05:06.070" Score="1" Body="&lt;h1&gt;Compress Numbers&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write two programs, a compressor and a decompressor.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The compressor&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The compressor will accept a sequence of integers of any value from 0 to 2&lt;sup&gt;63&lt;/sup&gt;-1, expressed in any convenient format.&lt;/li&gt;&#xA;&lt;li&gt;You may specify the required format as long as any arbitrary sequence of integers in the required range may be expressed in this format.&lt;/li&gt;&#xA;&lt;li&gt;Behaviour is undefined for any input that does not conform to your required format.&lt;/li&gt;&#xA;&lt;li&gt;The output will be a self contained sequence of bytes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;The decompressor&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input will be an unmodified sequence of bytes produced by a valid input to the compressor.&lt;/li&gt;&#xA;&lt;li&gt;Behaviour is undefined for any other sequences of bytes.&lt;/li&gt;&#xA;&lt;li&gt;The output will be the same input to the compressor program that produced the provided sequence of bytes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Judging&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The winning entry will be the valid entry that produces the smallest intermediate sequence of bytes for a sequence of integers that will be produced by the question setter that will be revealed after some number of entries have been submitted and only entries submitted prior to that reveal will be eligible to win.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This sequence will be generated by joining these following sequences into a single sequence and then randomly shuffling that single sequence.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1000 repetitions of the same randomly selected number from 0 to 9.&lt;/li&gt;&#xA;&lt;li&gt;1000 repetitions of the same randomly selected number from 2&lt;sup&gt;62&lt;/sup&gt; to 2&lt;sup&gt;63&lt;/sup&gt;-1.&lt;/li&gt;&#xA;&lt;li&gt;For each x in (8, 16, 32, 63):&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1000 random numbers from 0 to 2&lt;sup&gt;x&lt;/sup&gt;-1.&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The question setter will answer the challenge with GZIP/GUNZIP at the highest compression setting with no additional processing. If that entry wins, the glory of winning will belong to the authors of GZIP.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Tie-Breaker&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If two or more entries produce produce byte sequences of the same size, the following criteria will decide the winner:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If one of those entries is the GZIP entry posted by the question setter, that entry will win.&lt;/li&gt;&#xA;&lt;li&gt;The entry with the highest voting score wins.&lt;/li&gt;&#xA;&lt;li&gt;The entry posted first wins.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="20793" LastActivityDate="2020-04-16T13:05:06.070" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18831" PostTypeId="1" AcceptedAnswerId="18835" CreationDate="2020-04-16T14:19:33.777" Score="-2" ViewCount="123" Body="&lt;p&gt;There seems to be a lot of implicit and undocumented tips for getting reputation here. Let's start with answers: how do I get upvotes for my answers? Feel free to post more tips here.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-04-16T14:31:24.593" LastActivityDate="2020-04-16T15:18:18.893" Title="How do I get upvotes for my answers?" Tags="|discussion|" AnswerCount="5" CommentCount="5" ClosedDate="2020-04-18T16:09:59.583" ContentLicense="CC BY-SA 4.0" />
  <row Id="18832" PostTypeId="2" ParentId="18831" CreationDate="2020-04-16T14:19:33.777" Score="-1" Body="&lt;h2&gt;Answer the newest questions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you see a new question, immediately try to post an answer to it. Therefore, since the voters can currently only see this answer, they will upvote it anyway.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastActivityDate="2020-04-16T14:19:33.777" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18833" PostTypeId="2" ParentId="18831" CreationDate="2020-04-16T14:21:30.157" Score="0" Body="&lt;h2&gt;If you posted your answer, don't leave yet!&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you leave your answer alone after you posted your answer, others might post solutions with more impressive approaches. If you left you are going to lose all that fun of porting the ideas of other people. The easiest thing to get upvotes is to port others' impressive answers as your own answer.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastActivityDate="2020-04-16T14:21:30.157" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18834" PostTypeId="2" ParentId="18831" CreationDate="2020-04-16T14:22:55.703" Score="-6" Body="&lt;h2&gt;Advertise your answer in the public, e.g. the chat.&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If you posted a link to your answer, you might be able to get more upvotes to your answer, since it is made more public. This only works if your answer is creative enough - if your answer is boring, they won't upvote it.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastActivityDate="2020-04-16T14:22:55.703" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18835" PostTypeId="2" ParentId="18831" CreationDate="2020-04-16T14:27:06.637" Score="5" Body="&lt;h2&gt;Fully explain your answer&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If others are able to understand your answers, they have a greater chance of upvoting it, since they can verify it easily. However, if you didn't write an explanation, they might not upvote your answer that frequently.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastActivityDate="2020-04-16T14:27:06.637" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18836" PostTypeId="2" ParentId="18831" CreationDate="2020-04-16T15:18:18.893" Score="0" Body="&lt;h2&gt;Write an interesting answer&lt;/h2&gt;&#xA;" OwnerUserId="89856" LastActivityDate="2020-04-16T15:18:18.893" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18840" PostTypeId="2" ParentId="2140" CreationDate="2020-04-17T07:54:12.000" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/204302/calculate-the-digit-sum&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2020-05-04T10:38:14.553" LastActivityDate="2020-05-04T10:38:14.553" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="18842" PostTypeId="2" ParentId="2140" CreationDate="2020-04-19T02:49:55.227" Score="1" Body="&lt;h1&gt;Reconstruct an image from columns &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;You are given an image with all pixel-wide columns shuffled. The challenge is to attempt to reconstruct the image.&lt;/p&gt;&#xA;&lt;p&gt;[image gallery of varying difficulties]&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox stuff&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; (probably asking for fewest inversions)?&lt;/p&gt;&#xA;&lt;p&gt;Random thought: if rearranging the pixels was similar to the assignment problem, this seems to be similar to the traveling salesman problem.&lt;/p&gt;&#xA;" OwnerUserId="36445" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-04-19T02:49:55.227" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18846" PostTypeId="2" ParentId="2140" CreationDate="2020-04-20T13:07:17.640" Score="0" Body="&lt;h1&gt;Making a programable computing chip&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Make a programable chip with 8000 commands ROM and 48 16-bit unsigned words RAM initalized with zero.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;These commands should be supported:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a = b + c  # mod 65536&#xA;a = b - c&#xA;a = b * c&#xA;a = b / c  # undefined behavior if c==0&#xA;a = b % c&#xA;a = b &amp;gt; c  # return 0 or 1&#xA;a = b &amp;gt;= c&#xA;a = b == c&#xA;a = b != c&#xA;if a goto b &#xA;if !a goto b&#xA;call a, b  # store ip of next command to b and goto a, then can return&#xA;input a&#xA;output a&#xA;a = [b] # You can decide constant k and l, such that [kn+l] is rn. &#xA;[a] = b # Using undefined [n] is UB&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;where &lt;code&gt;a, b, c&lt;/code&gt; can be &lt;code&gt;r0-r47&lt;/code&gt; or a constant of a 16-bit integer or the ip of a command. Writing to a constant is a nop, so &lt;code&gt;input 42&lt;/code&gt; discards an input. Mixing ip and integer, running out of commands are undefined behavior.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;L1: input r1&#xA;    r0 = r0 + r1&#xA;    output r0&#xA;    if !0 goto L1&#xA;    r2 = r1 + L1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;takes input, and output sum of all inputs modulo 65536. &lt;code&gt;r2 = r1 + L1&lt;/code&gt; is undefined behavior, but since it's never executed it's not a problem.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;The circuit consists of controlled gates &lt;code&gt;(x,y,c,t)&lt;/code&gt;, meaning that wire &lt;code&gt;x&lt;/code&gt; and wire &lt;code&gt;y&lt;/code&gt; are connected if wire &lt;code&gt;c&lt;/code&gt; was active(t=1) or inactive(t=0), and programable wire &lt;code&gt;(x,y,0,0)&lt;/code&gt;, meaning that wire &lt;code&gt;x&lt;/code&gt; and wire &lt;code&gt;y&lt;/code&gt; can be programmed to be connected.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the beginning, none of the wires, except IO wires(discuss later), is active. In each step, any wire connected to wire 0, whether directly or indirectly, is active.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;IO is used to connect multiple such component. It contains 18 wires, where 16 of them store an integer to be passed, and two &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt; meaning if there's data on the wire.&#xA;When sender send, sender negate &lt;code&gt;A&lt;/code&gt;; when reciever recieve, &lt;code&gt;B&lt;/code&gt; negated. Therefore, there's data on the wire iff &lt;code&gt;A!=B&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We write A on input, B on input, A on output, and B on output of the chip, as 4, 8, 5, 9, respectively, and the 16-bit input on 16-31, output on 32-47. You can active wires where you are expected to read from, but your chip should handle with another such chip (so if you write to input, you should handle cases when output is inputted).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, &lt;code&gt;{(0,5,4,1),(0,8,9,1)}&lt;/code&gt; output zero whenever recieving an input.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;You should submit a circuit (a set of 4-elem tuples) and a compiler. Smallest circuit win.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2020-04-20T13:07:17.640" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18847" PostTypeId="2" ParentId="2140" CreationDate="2020-04-20T16:55:12.207" Score="0" Body="&lt;h1&gt;Ariadne's String &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a &lt;span class=&quot;math-container&quot;&gt;\$ 20 \times 20 \$&lt;/span&gt; grid, start at any arbitrary point. Then starting from this point, draw a sequence of straight lines each attached to two points on the grid. In addition, the lines must be in strictly increasing length, and such that no two intersect or touch each other. Call the number of lines drawn &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt;. The diagram below shows an example of a smaller &lt;span class=&quot;math-container&quot;&gt;\$ 5 \times 5 \$&lt;/span&gt; grid, where &lt;span class=&quot;math-container&quot;&gt;\$ n = 5 \$&lt;/span&gt;. However, the maximum length for a &lt;span class=&quot;math-container&quot;&gt;\$ 5 \times 5 \$&lt;/span&gt; grid is actually &lt;span class=&quot;math-container&quot;&gt;\$ n = 9 \$&lt;/span&gt; &lt;em&gt;(Try to find it yourself!)&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/OI4lh.jpg&quot;&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, meaning the answer with the largest &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; wins!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Checker program coming soon&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Anything unclear?&lt;/li&gt;&#xA;&lt;li&gt;How to position image on the right and text on the left (it looks better)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="88546" LastEditorUserId="88546" LastEditDate="2020-04-21T15:35:25.003" LastActivityDate="2020-04-21T15:35:25.003" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18849" PostTypeId="2" ParentId="2140" CreationDate="2020-04-21T08:06:58.113" Score="1" Body="&lt;h2&gt;A065825 &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(This is &lt;a href=&quot;https://oeis.org/A065825&quot; rel=&quot;nofollow noreferrer&quot;&gt;A065825&lt;/a&gt;.) The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; defaults apply, so you can pick another format other than this one.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an input integer &lt;code&gt;n&lt;/code&gt;, find the smallest number &lt;code&gt;k&lt;/code&gt; so that there exists an n-item subset of &lt;code&gt;{1,...,k}&lt;/code&gt; where no three items form an arithmetic progression.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Procedure&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Here, we calculate &lt;code&gt;A065825(9)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;We assume you have already looped from 1 to 19, and &lt;code&gt;k&lt;/code&gt;=20 (it's just an example).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;1. Generate a range from 1 to k.&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;2. Pick &lt;code&gt;n&lt;/code&gt; items from that sequence, following the original order of the sequence.&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1 2 6 7 9 14 15 18 20]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;3. No 3 items form an arithmetic progression.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If a sequence has arithmetic progression, it basically means the sequence has the same step between every two consecutive items.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the sequence of positive even numbers (&lt;code&gt;[2 4 6 8 ...]&lt;/code&gt;) has a consistent step (i.e. &lt;code&gt;4-2=2&lt;/code&gt;, and &lt;code&gt;6-4=2&lt;/code&gt;, etc.), so it has arithmetic progression.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Fibonacci sequence (&lt;code&gt;[1 1 2 3 5 8 13 21 ...]&lt;/code&gt;) does not have arithmetic progression, since it does not have a consistent step. (&lt;code&gt;3-2=1&lt;/code&gt;, &lt;code&gt;5-3=2&lt;/code&gt;, &lt;code&gt;8-5=3&lt;/code&gt;, etc.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As an example, let's pick 3 items from our generated sequence.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1 2 6 [7 9 14] 15 18 20]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The picked 3-item sequence does not have arithmetic progression, since the differences are respectively &lt;code&gt;9-7=2&lt;/code&gt; and &lt;code&gt;14-9=5&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This has to apply to &lt;strong&gt;every 3-item pair&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[[1 2 6] 7 9 14 15 18 20] (2 -1 =1, 6 -2 =4)&#xA;[1 [2 6 7] 9 14 15 18 20] (6 -2 =4, 7 -6 =1)&#xA;[1 2 [6 7 9] 14 15 18 20] (7 -6 =1, 9 -7 =2)&#xA;[1 2 6 [7 9 14] 15 18 20] (9 -7 =2, 14-9 =5)&#xA;[1 2 6 7 [9 14 15] 18 20] (14-9 =5, 15-14=1)&#xA;[1 2 6 7 9 [14 15 18] 20] (15-14=1, 18-15=3)&#xA;[1 2 6 7 9 14 [15 18 20]] (18-15=3, 20-18=2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here are some examples of picking non-consecutive items from the output sequence:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[1 [2] 6 [7] 9 [14] 15 18 20] (7-2=5,14-7=7)&#xA;[[1] 2 6 [7] [9] 14 15 18 20] (7-1=6,9 -7=2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If the above is satisfied for &lt;code&gt;k&lt;/code&gt;, then &lt;code&gt;k&lt;/code&gt; is a valid output for &lt;code&gt;A065825(9)&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Do you think this challenge should be splitted into separate challenges? It seems that it is a single sequence on OEIS.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##AS4A0f9vc2FiaWX//@KInsqSTMOmScO5ypLDpjPDuc61wqXDi33DoF99Z8SAfdC9//83&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt; is a reference program I use to check my test cases.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;n       a(n)&#xA;1       1&#xA;2       2&#xA;3       4&#xA;4       5&#xA;5       9&#xA;6       11&#xA;7       13&#xA;8       14&#xA;9       20&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-04-22T07:39:28.290" LastActivityDate="2020-04-22T07:39:28.290" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18850" PostTypeId="2" ParentId="2140" CreationDate="2020-04-21T11:09:58.060" Score="0" Body="&lt;h1&gt;Convert NFA to DFA as quickly as possible.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your input will be an &lt;a href=&quot;https://en.wikipedia.org/wiki/Nondeterministic_finite_automaton&quot; rel=&quot;nofollow noreferrer&quot;&gt;NFA&lt;/a&gt;. In order to be able to test your code, it needs to be able to handle an NFA in the following format. This is taken  directly from &lt;a href=&quot;https://www.gap-system.org/Manuals/pkg/automata-1.14/doc/chap2.html#X821C3B3687B1F2FF&quot; rel=&quot;nofollow noreferrer&quot;&gt;GAP&lt;/a&gt; (and slightly simplified).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton( Type, Size, Alphabet, TransitionTable, Initial, Accepting )&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For the input, Type will always be &quot;nondet&quot;.  Size is a positive integer representing the number of states of the automaton. Alphabet is the number of letters of the alphabet. TransitionTable is the transition matrix. The entries are lists of non-negative integers not greater than the size of the automaton are also allowed. Initial and Accepting are, respectively, the lists of initial and accepting states.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Example input:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;nondet&quot;, 4, 2, [[[], [2], [3], [1, 2, 3, 4], [2, 4]],&#xA;                                [[], [1, 3, 4], [1], [2, 4]]], [1], [2, 3])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is slightly easier to read as a transition table.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   |  1    2             3                4&#xA;--------------------------------------------------&#xA; a |      [ 2 ]         [ 1, 2, 3, 4 ]   [ 2, 4 ]   &#xA; b |      [ 1, 3, 4 ]   [ 1 ]            [ 2, 4 ]   &#xA;Initial state:    [ 1 ]&#xA;Accepting states: [ 2, 3 ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your output must be a &lt;a href=&quot;https://en.wikipedia.org/wiki/Deterministic_finite_automaton&quot; rel=&quot;nofollow noreferrer&quot;&gt;DFA&lt;/a&gt; that is &lt;strong&gt;equivalent&lt;/strong&gt; to the input NFA.  There is no need for your DFA to be minimal. For the output, Type will always be &quot;det&quot;.  Size is a positive integer representing the number of states of the automaton. Alphabet is the number of letters of the alphabet. TransitionTable is the transition matrix. The entries are non-negative integers not greater than the size of the automaton. The states should be labelled by consecutive integers.  Initial and Accepting are, respectively, the lists of initial and accepting states.  In the case of the example above, this would be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;det&quot;, 2, 2, [[2, 2], [2, 2]], [1], [])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As a transition table this is:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   |  1  2  &#xA;-----------&#xA; a |  2  2  &#xA; b |  2  2  &#xA;Initial state:   [ 1 ]&#xA;Accepting state: [  ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;(It is now clear this is a DFA that will not accept any input strings.)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases:&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Input:&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;nondet&quot;,2,4,[[[1], [2]], [[2], []], [[2], []] , [[1], [2]]],[1],[1, 2]))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As a transition matrix:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   |  1       2&#xA;-------------------&#xA; a | [ 1 ]   [ 2 ]   &#xA; b | [ 2 ]           &#xA; c | [ 2 ]           &#xA; d | [ 1 ]   [ 2 ]   &#xA;Initial state:    [ 1 ]&#xA;Accepting states: [ 1, 2 ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here is the diagram of the NFA.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/fzm1q.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/fzm1q.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;det&quot;,3, 4,[[1, 2, 3], [2, 3, 3], [2, 3, 3], [1, 2, 3]], [1],[1, 2])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As a transition matrix:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   |  1  2  3  &#xA;--------------&#xA; a |  1  2  3  &#xA; b |  2  3  3  &#xA; c |  2  3  3  &#xA; d |  1  2  3  &#xA;Initial state:    [ 1 ]&#xA;Accepting states: [ 1, 2 ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Here is the diagram of the DFA.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/S1uMn.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/S1uMn.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;Input:&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;nondet&quot;,7,4,[[[1, 3, 4, 5], [2], [3], [3, 4], [3, 5], [], []], [[2, 3, 4, 7], [3], [], [], [3, 7], [3, 4], []], [[2, 3, 5, 6], [3], [], [3, 6], [], [], [3, 5]], [[1, 3, 6, 7], [2], [3], [], [], [3, 6], [3, 7]]],[1],[1, 2, 3, 4, 5, 6, 7])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ol start=&quot;3&quot;&gt;&#xA;&lt;li&gt;Input: &lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;nondet&quot;,12, 4,[[[1, 3, 5, 6], [2, 4, 7, 8], [3], [6], [3, 5], [3, 6], [4, 7], [4, 8], [4, 7], [4, 8], [], []], [[2, 3, 5, 10], [3, 4, 7, 12], [6], [], [4, 7], [3, 10], [], [4, 12], [3, 5], [4, 12], [4, 7], []], [[2, 3, 6, 9], [3, 4, 8, 11], [6], [], [3, 9], [4, 8], [4, 11], [], [4, 11], [3, 6], [], [4, 8 ]], [[1, 3, 9, 10], [2, 4, 11, 12], [3], [6], [4, 11], [4, 12], [], [], [3, 9], [3, 10], [4, 11], [4, 12]]],[1],[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;det&quot;,39, 4,[[1, 2, 3, 3, 5, 24, 7, 8, 22, 20, 8, 32, 18, 18, 3, 19, 25, 18, 19, 20, 25, 22, 23, 24, 25, 25, 24, 23, 5, 2, 35, 32, 19, 19, 35, 36, 36, 36, 36], [1, 38, 1, 23, 15, 9, 11, 26, 23, 28, 26, 10, 9, 26, 1, 3, 22, 26, 3, 28, 22, 23, 1, 15, 3, 3, 15, 1, 28, 27, 10, 27, 23, 23, 38, 15, 28, 15, 28], [1, 5, 1, 1, 1, 4, 12, 6, 6, 31, 31, 37, 37, 30, 5, 5, 29, 37, 3, 21, 4, 21, 4, 4, 4, 29, 30, 29, 1, 5, 29, 37, 5, 3, 29, 3, 3, 2, 2], [1, 16, 3, 4, 3, 21, 7, 18, 33, 39, 14, 13, 13, 14, 15, 16, 17, 18, 19, 34, 21, 34, 3, 19, 19, 16, 38, 15, 4, 33, 17, 18, 33, 34, 16, 19, 34, 38, 39]],[7],[ 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ol start=&quot;4&quot;&gt;&#xA;&lt;li&gt;Input:&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;nondet&quot;,25,4,[[[1, 3, 6, 7], [2, 4, 8, 9], [3, 5, 10, 11], [6], [7], [3, 5, 6, 10, 18], [3, 5, 7, 11, 19], [4, 8], [4, 9 ], [5, 10], [5, 11], [4, 5, 8, 10, 22], [4, 5, 9, 11, 23], [5, 10], [5, 11], [], [], [5, 10, 18], [5, 11, 19], [5, 10, 22], [5, 11, 23 ], [], [], [], []], [[2, 3, 6, 13], [3, 4, 8, 15], [4, 5, 10, 17], [7], [], [4, 5, 8, 10, 18], [3, 5, 13, 17, 21], [5, 10], [4, 15], [], [5, 17], [3, 5, 6, 10, 22], [4, 5, 15, 17, 25], [4, 8], [5, 17], [5, 10], [], [], [5, 17, 21], [], [5, 17, 25], [5, 10, 18], [], [5, 10, 22], []], [[2, 3, 7, 12], [3, 4, 9, 14], [4, 5, 11, 16], [7], [], [3, 5, 12, 16, 20], [4, 5, 9, 11, 19], [4, 14], [5, 11], [5, 16], [], [4, 5, 14, 16, 24], [3, 5, 7, 11, 23], [5, 16], [4, 9], [], [5, 11], [5, 16, 20], [], [5, 16, 24], [], [], [5, 11, 19], [], [5, 11, 23]], [[1, 3, 12, 13], [2, 4, 14, 15], [3, 5, 16, 17], [6], [7], [4, 5, 14, 16, 20], [4, 5, 15, 17, 21], [5, 16], [5, 17], [], [], [3, 5, 12, 16, 24], [3, 5, 13, 17, 25], [4, 14], [4, 15], [5, 16], [5, 17], [], [], [], [], [5, 16, 20], [5, 17, 21], [5, 16, 24], [5, 17, 25]]],[1],[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;det&quot;,266,4,[[1, 127, 50, 50, 115, 249, 50, 8, 257, 10, 151, 12, 13, 14, 81, 78, 34, 106, 137, 107, 21, 22, 82, 89, 71, 43, 43, 62, 63, 63, 44, 10, 179, 171, 214, 265, 206, 38, 137, 152, 21, 151, 71, 22, 41, 41, 47, 13, 49, 50, 50, 210, 50, 210, 116, 90, 64, 49, 207, 207, 207, 62, 232, 64, 64, 89, 151, 236, 236, 70, 71, 236, 116, 260, 128, 75, 13, 38, 77, 133, 14, 82, 13, 13, 77, 235, 64, 64, 231, 206, 138, 91, 91, 206, 90, 264, 137, 169, 10, 10, 41, 71, 232, 228, 232, 21, 21, 107, 106, 110, 111, 266, 256, 114, 114, 116, 251, 251, 116, 114, 114, 111, 266, 260, 122, 182, 127, 128, 129, 213, 132, 132, 129, 49, 49, 138, 138, 138, 249, 71, 43, 43, 210, 235, 183, 214, 132, 265, 206, 138, 232, 64, 64, 153, 153, 64, 152, 152, 82, 236, 236, 82, 116, 116, 64, 207, 266, 64, 231, 169, 171, 250, 227, 70, 175, 175, 176, 10, 47, 178, 178, 110, 111, 266, 260, 122, 266, 127, 213, 49, 49, 152, 257, 153, 257, 90, 90, 183, 250, 264, 62, 228, 229, 82, 82, 206, 64, 266, 249, 249, 249, 242, 213, 214, 64, 116, 114, 114, 50, 50, 236, 236, 261, 115, 152, 251, 8, 228, 229, 229, 231, 232, 237, 235, 235, 236, 237, 235, 235, 235, 235, 235, 235, 242, 242, 242, 115, 251, 249, 250, 116, 116, 116, 207, 64, 265, 266, 257, 256, 266, 264, 261, 260, 264, 265, 266], [1, 125, 1, 114, 114, 121, 115, 3, 23, 19, 13, 15, 230, 28, 201, 202, 16, 84, 123, 103, 105, 208, 114, 84, 172, 199, 199, 119, 83, 83, 123, 170, 16, 31, 27, 26, 25, 104, 102, 23, 28, 13, 120, 208, 48, 103, 19, 230, 239, 1, 114, 218, 115, 219, 82, 140, 23, 208, 204, 216, 216, 119, 174, 119, 119, 84, 13, 115, 115, 50, 120, 50, 82, 204, 262, 79, 230, 104, 203, 85, 28, 114, 230, 230, 203, 3, 23, 119, 96, 96, 96, 123, 102, 140, 208, 3, 200, 200, 98, 97, 103, 120, 119, 120, 119, 28, 105, 103, 105, 54, 3, 23, 141, 1, 250, 50, 82, 114, 50, 1, 250, 3, 3, 219, 219, 125, 54, 263, 124, 124, 27, 124, 223, 208, 239, 25, 208, 208, 120, 120, 217, 217, 217, 120, 120, 142, 142, 141, 140, 140, 174, 174, 174, 204, 216, 23, 119, 23, 250, 114, 114, 250, 162, 162, 159, 205, 159, 159, 208, 123, 170, 1, 219, 50, 208, 208, 123, 177, 177, 19, 170, 173, 172, 172, 199, 199, 23, 186, 185, 184, 184, 23, 120, 216, 23, 140, 208, 120, 1, 3, 119, 120, 114, 114, 250, 239, 119, 3, 121, 3, 120, 219, 212, 212, 23, 50, 1, 250, 1, 114, 50, 114, 219, 114, 23, 114, 3, 120, 114, 114, 208, 119, 125, 121, 3, 50, 54, 120, 3, 120, 121, 3, 120, 218, 219, 217, 114, 114, 3, 1, 250, 250, 250, 253, 252, 173, 172, 120, 125, 3, 3, 219, 219, 3, 54, 3], [1, 1, 249, 249, 6, 1, 1, 247, 7, 130, 167, 17, 11, 66, 33, 33, 131, 136, 10, 32, 150, 9, 112, 36, 149, 112, 149, 56, 167, 37, 181, 130, 35, 147, 139, 51, 139, 11, 10, 234, 147, 37, 148, 113, 136, 136, 146, 24, 249, 1, 1, 249, 249, 249, 139, 6, 238, 127, 134, 238, 134, 9, 148, 238, 134, 167, 36, 50, 249, 247, 73, 249, 51, 139, 112, 167, 76, 76, 11, 167, 80, 73, 67, 66, 66, 135, 58, 58, 112, 139, 233, 100, 100, 2, 6, 95, 10, 32, 130, 130, 99, 94, 94, 56, 149, 150, 147, 150, 136, 51, 51, 51, 7, 51, 51, 51, 7, 6, 139, 139, 139, 2, 58, 134, 139, 7, 1, 112, 112, 249, 238, 238, 112, 249, 127, 238, 233, 238, 1, 149, 112, 149, 249, 135, 7, 139, 238, 51, 139, 238, 112, 238, 233, 234, 234, 134, 234, 190, 112, 50, 249, 73, 139, 51, 238, 134, 51, 134, 148, 32, 147, 145, 145, 145, 258, 259, 180, 130, 146, 189, 189, 51, 51, 134, 134, 139, 2, 1, 249, 127, 249, 191, 191, 191, 188, 188, 188, 188, 198, 197, 196, 196, 195, 187, 187, 139, 233, 134, 127, 127, 127, 49, 249, 139, 243, 211, 211, 211, 210, 210, 210, 210, 95, 209, 241, 209, 126, 117, 117, 9, 112, 112, 50, 50, 50, 50, 50, 50, 49, 49, 127, 127, 127, 249, 249, 249, 7, 7, 1, 247, 51, 139, 211, 134, 134, 51, 51, 7, 7, 2, 126, 145, 139, 247, 51, 51], [1, 51, 3, 4, 4, 7, 7, 50, 73, 61, 11, 12, 40, 109, 101, 93, 45, 18, 19, 20, 21, 64, 161, 29, 193, 118, 193, 65, 11, 42, 19, 59, 30, 46, 163, 164, 163, 40, 39, 57, 46, 42, 246, 60, 18, 21, 61, 158, 72, 50, 51, 53, 53, 3, 55, 55, 57, 246, 156, 64, 65, 64, 155, 64, 65, 11, 29, 68, 69, 236, 160, 72, 73, 55, 157, 11, 154, 154, 40, 11, 46, 160, 225, 192, 192, 86, 87, 88, 157, 118, 155, 19, 39, 74, 161, 239, 92, 92, 166, 254, 20, 144, 88, 240, 65, 109, 108, 21, 21, 50, 50, 73, 73, 50, 247, 236, 73, 161, 72, 3, 5, 54, 86, 239, 3, 51, 50, 64, 64, 161, 165, 64, 157, 161, 245, 165, 60, 64, 51, 240, 161, 240, 4, 144, 51, 55, 57, 73, 55, 57, 157, 157, 155, 57, 64, 156, 64, 87, 118, 160, 161, 248, 163, 164, 165, 168, 164, 168, 60, 19, 108, 3, 3, 72, 64, 60, 19, 194, 194, 61, 59, 247, 247, 193, 193, 5, 74, 7, 69, 244, 69, 156, 240, 65, 74, 74, 246, 143, 219, 86, 88, 144, 222, 222, 226, 72, 60, 239, 52, 54, 143, 239, 72, 72, 215, 221, 219, 224, 219, 220, 221, 222, 239, 220, 215, 222, 54, 160, 160, 161, 64, 64, 160, 68, 236, 236, 236, 160, 239, 240, 244, 245, 246, 69, 72, 161, 51, 160, 50, 50, 248, 118, 226, 255, 255, 248, 248, 160, 160, 245, 245, 72, 72, 236, 236, 236]],[12],[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ol start=&quot;5&quot;&gt;&#xA;&lt;li&gt;Input:&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;nondet&quot;,38,4,[[[1, 3, 7, 8], [2, 4, 9, 10], [3, 5, 11, 12], [4, 6, 13, 14], [7], [8], [3, 5, 7, 11, 23], [3, 5, 8, 12, 24], [4, 6, 9, 13, 25], [4, 6, 10, 14, 26], [5, 11], [5, 12], [6, 13], [6, 14], [4, 5, 9, 11, 31], [4, 5, 10, 12, 32], [5, 6, 11, 13, 33], [5, 6, 12, 14, 34], [6, 13], [6, 14], [], [], [5, 11, 23], [5, 12, 24], [6, 13, 25], [6, 14, 26], [5, 11, 31], [5, 12, 32], [6, 13, 33], [6, 14, 34], [6, 13, 25], [6, 14, 26], [], [], [6, 13, 33], [6, 14, 34], [], []], [[2, 3, 7, 16], [3, 4, 9, 18], [4, 5, 11, 20], [5, 6, 13, 22], [8], [], [4, 5, 9, 11, 23], [3, 5, 16, 20, 28], [5, 6, 11, 13, 25], [4, 6, 18, 22, 30], [6, 13], [5, 20], [], [6, 22], [3, 5, 7, 11, 31], [4, 5, 18, 20, 36], [4, 6, 9, 13, 33], [5, 6, 20, 22, 38], [5, 11], [6, 22], [6, 13], [], [6, 13, 25], [5, 20, 28], [], [6, 22, 30], [6, 13, 33], [5, 20, 36], [], [6, 22, 38], [5, 11, 23], [6, 22, 30], [6, 13, 25], [], [5, 11, 31], [6, 22, 38], [6, 13, 33], []], [[2, 3, 8, 15], [3, 4, 10, 17], [4, 5, 12, 19], [5, 6, 14, 21], [8], [], [3, 5, 15, 19, 27], [4, 5, 10, 12, 24], [4, 6, 17, 21, 29], [5, 6, 12, 14, 26], [5, 19], [6, 14], [6, 21], [], [4, 5, 17, 19, 35], [3, 5, 8, 12, 32], [5, 6, 19, 21, 37], [4, 6, 10, 14, 34], [6, 21], [5, 12], [], [6, 14], [5, 19, 27], [6, 14, 26], [6, 21, 29], [], [5, 19, 35], [6, 14, 34], [6, 21, 37], [], [6, 21, 29], [5, 12, 24], [], [6, 14, 26 ], [6, 21, 37], [5, 12, 32], [], [6, 14, 34]], [[1, 3, 15, 16], [2, 4, 17, 18], [3, 5, 19, 20], [4, 6, 21, 22], [7], [8], [ 4, 5, 17, 19, 27], [4, 5, 18, 20, 28], [5, 6, 19, 21, 29], [5, 6, 20, 22, 30], [6, 21], [6, 22], [], [], [3, 5, 15, 19, 35], [3, 5, 16, 20, 36], [4, 6, 17, 21, 37], [4, 6, 18, 22, 38], [5, 19], [5, 20], [6, 21], [6, 22], [6, 21, 29], [6, 22, 30], [], [], [6, 21, 37], [6, 22, 38], [], [], [5, 19, 27], [5, 20, 28], [6, 21, 29], [6, 22, 30], [5, 19, 35], [5, 20, 36], [6, 21, 37], [6, 22, 38]]],[1],[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://paste.ubuntu.com/p/W37GjgyTwy/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Output&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol start=&quot;6&quot;&gt;&#xA;&lt;li&gt;Input:&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;nondet&quot;,67,4,[[[1, 3, 8, 9], [2, 4, 10, 11], [3, 5, 12, 13], [4, 6, 14, 15], [5, 7, 16, 17], [8], [8], [3, 5, 8, 12, 28], [3, 5, 9, 13, 29], [4, 6, 10, 14, 30], [4, 6, 11, 15, 31], [5, 7, 12, 16, 32], [5, 7, 13, 17, 33], [6, 14], [6, 15], [ 7, 16], [7, 17], [4, 5, 10, 12, 40], [4, 5, 11, 13, 41], [5, 6, 12, 14, 42], [5, 6, 13, 15, 43], [6, 7, 14, 16, 44], [6, 7, 15, 17, 45], [7, 16], [7, 17], [], [], [5, 7, 12, 16, 28, 32, 52], [5, 7, 13, 17, 29, 33, 53], [6, 14, 30], [6, 15, 31], [7, 16, 32], [7, 17, 33], [5, 7, 12, 16, 40, 44, 56], [5, 7, 13, 17, 41, 45, 57], [6, 14, 42], [6, 15, 43], [7, 16, 44], [7, 17, 45], [6, 7, 14, 16, 30, 32, 60], [6, 7, 15, 17, 31, 33, 61], [7, 16, 32], [7, 17, 33], [], [], [6, 7, 14, 16, 42, 44, 64], [6, 7, 15, 17, 43, 45, 65], [7, 16, 44], [7, 17, 45], [], [], [7, 16, 32, 52], [7, 17, 33, 53], [7, 16, 44, 56], [7, 17, 45, 57], [7, 16, 32, 60], [7, 17, 33, 61], [7, 16, 44, 64], [7, 17, 45, 65], [], [], [], [], [], [], [], []], [[2, 3, 8, 19], [3, 4, 10, 21], [4, 5, 12, 23], [5, 6, 14, 25], [6, 7, 16, 27], [8], [], [4, 5, 10, 12, 28], [3, 5, 19, 23, 35], [5, 6, 12, 14, 30], [4, 6, 21, 25, 37], [6, 7, 14, 16, 32], [5, 7, 23, 27, 39], [7, 16], [6, 25], [], [7, 27], [3, 5, 8, 12, 40], [4, 5, 21, 23, 47], [4, 6, 10, 14, 42], [5, 6, 23, 25, 49], [5, 7, 12, 16, 44], [6, 7, 25, 27, 51], [6, 14], [7, 27], [7, 16], [], [6, 7, 14, 16, 30, 32, 52], [5, 7, 23, 27, 35, 39, 55], [7, 16, 32], [6, 25, 37], [], [7, 27, 39], [6, 7, 14, 16, 42, 44, 56], [5, 7, 23, 27, 47, 51, 59], [7, 16, 44], [6, 25, 49], [], [7, 27, 51], [5, 7, 12, 16, 28, 32, 60], [6, 7, 25, 27, 37, 39, 63], [6, 14, 30], [7, 27, 39], [7, 16, 32], [], [5, 7, 12, 16, 40, 44, 64], [6, 7, 25, 27, 49, 51, 67], [6, 14, 42], [7, 27, 51], [7, 16, 44], [], [], [7, 27, 39, 55], [], [7, 27, 51, 59], [], [7, 27, 39, 63], [], [7, 27, 51, 67], [7, 16, 32, 52], [], [7, 16, 44, 56], [], [7, 16, 32, 60], [], [7, 16, 44, 64], []], [[2, 3, 9, 18], [3, 4, 11, 20], [4, 5, 13, 22], [5, 6, 15, 24], [6, 7, 17, 26], [8], [], [3, 5, 18, 22, 34], [4, 5, 11, 13, 29], [4, 6, 20, 24, 36], [5, 6, 13, 15, 31], [5, 7, 22, 26, 38], [6, 7, 15, 17, 33], [6, 24], [7, 17], [7, 26 ], [], [4, 5, 20, 22, 46], [3, 5, 9, 13, 41], [5, 6, 22, 24, 48], [4, 6, 11, 15, 43], [6, 7, 24, 26, 50], [5, 7, 13, 17, 45], [7, 26], [6, 15], [], [7, 17], [5, 7, 22, 26, 34, 38, 54], [6, 7, 15, 17, 31, 33, 53], [6, 24, 36], [7, 17, 33], [7, 26, 38], [], [ 5, 7, 22, 26, 46, 50, 58], [6, 7, 15, 17, 43, 45, 57], [6, 24, 48], [7, 17, 45], [7, 26, 50], [], [6, 7, 24, 26, 36, 38, 62], [5, 7, 13, 17, 29, 33, 61], [7, 26, 38], [6, 15, 31], [], [7, 17, 33], [6, 7, 24, 26, 48, 50, 66], [5, 7, 13, 17, 41, 45, 65], [7, 26, 50], [6, 15, 43], [], [7, 17, 45], [7, 26, 38, 54], [], [7, 26, 50, 58], [], [7, 26, 38, 62], [], [7, 26, 50, 66], [], [], [7, 17, 33, 53], [], [7, 17, 45, 57], [], [7, 17, 33, 61], [], [7, 17, 45, 65]], [[1, 3, 18, 19], [2, 4, 20, 21], [3, 5, 22, 23 ], [4, 6, 24, 25], [5, 7, 26, 27], [8], [8], [4, 5, 20, 22, 34], [4, 5, 21, 23, 35], [5, 6, 22, 24, 36], [5, 6, 23, 25, 37], [6, 7, 24, 26, 38], [6, 7, 25, 27, 39], [7, 26], [7, 27], [], [], [3, 5, 18, 22, 46], [3, 5, 19, 23, 47], [4, 6, 20, 24, 48], [4, 6, 21, 25, 49], [5, 7, 22, 26, 50], [5, 7, 23, 27, 51], [6, 24], [6, 25], [7, 26], [7, 27], [6, 7, 24, 26, 36, 38, 54], [6, 7, 25, 27, 37, 39, 55], [7, 26, 38], [7, 27, 39], [], [], [6, 7, 24, 26, 48, 50, 58], [6, 7, 25, 27, 49, 51, 59], [7, 26, 50], [7, 27, 51], [], [], [5, 7, 22, 26, 34, 38, 62], [5, 7, 23, 27, 35, 39, 63], [6, 24, 36], [6, 25, 37], [7, 26, 38], [7, 27, 39], [5, 7, 22, 26, 46, 50, 66], [5, 7, 23, 27, 47, 51, 67], [6, 24, 48], [6, 25, 49], [7, 26, 50], [7, 27, 51], [], [], [], [], [], [], [], [], [7, 26, 38, 54], [7, 27, 39, 55], [7, 26, 50, 58], [7, 27, 51, 59], [7, 26, 38, 62], [7, 27, 39, 63], [7, 26, 50, 66], [7, 27, 51, 67]]],[1],[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://paste.ubuntu.com/p/2V5CN57GDv/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Output&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;ol start=&quot;7&quot;&gt;&#xA;&lt;li&gt;Input:&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;nondet&quot;,96,4,[[[1, 3, 9, 10], [2, 4, 11, 12], [3, 5, 13, 14], [4, 6, 15, 16], [5, 7, 17, 18], [6, 8, 19, 20], [7 ], [8], [3, 5, 9, 13, 33], [3, 5, 10, 14, 34], [4, 6, 11, 15, 35], [4, 6, 12, 16, 36], [5, 7, 13, 17, 37], [5, 7, 14, 18, 38], [6, 8, 15, 19, 39], [6, 8, 16, 20, 40], [7, 17], [7, 18], [8, 19], [8, 20], [4, 5, 11, 13, 49], [4, 5, 12, 14, 50], [5, 6, 13, 15, 51], [5, 6, 14, 16, 52], [6, 7, 15, 17, 53], [6, 7, 16, 18, 54], [7, 8, 17, 19, 55], [7, 8, 18, 20, 56], [8, 19], [8, 20], [], [], [5, 7, 13, 17, 33, 37, 65], [5, 7, 14, 18, 34, 38, 66], [6, 8, 15, 19, 35, 39, 67], [6, 8, 16, 20, 36, 40, 68], [7, 17, 37], [7, 18, 38], [8, 19, 39], [8, 20, 40], [5, 7, 13, 17, 49, 53, 73], [5, 7, 14, 18, 50, 54, 74], [6, 8, 15, 19, 51, 55, 75], [6, 8, 16, 20, 52, 56, 76], [7, 17, 53], [7, 18, 54], [8, 19, 55], [8, 20, 56], [6, 7, 15, 17, 35, 37, 81], [6, 7, 16, 18, 36, 38, 82], [7, 8, 17, 19, 37, 39, 83], [7, 8, 18, 20, 38, 40, 84], [8, 19, 39], [8, 20, 40], [], [], [6, 7, 15, 17, 51, 53, 89], [6, 7, 16, 18, 52, 54, 90], [7, 8, 17, 19, 53, 55, 91], [7, 8, 18, 20, 54, 56, 92], [8, 19, 55], [8, 20, 56], [], [], [7, 17, 37, 65], [7, 18, 38, 66 ], [8, 19, 39, 67], [8, 20, 40, 68], [7, 17, 53, 73], [7, 18, 54, 74], [8, 19, 55, 75], [8, 20, 56, 76], [7, 17, 37, 81], [7, 18, 38, 82], [8, 19, 39, 83], [8, 20, 40, 84], [7, 17, 53, 89], [7, 18, 54, 90], [8, 19, 55, 91], [8, 20, 56, 92], [8, 19, 39, 67], [8, 20, 40, 68], [], [], [8, 19, 55, 75], [8, 20, 56, 76], [], [], [8, 19, 39, 83], [8, 20, 40, 84], [], [], [8, 19, 55, 91], [8, 20, 56, 92], [], []], [[2, 3, 9, 22], [3, 4, 11, 24], [4, 5, 13, 26], [5, 6, 15, 28], [6, 7, 17, 30], [7, 8, 19, 32], [8 ], [], [4, 5, 11, 13, 33], [3, 5, 22, 26, 42], [5, 6, 13, 15, 35], [4, 6, 24, 28, 44], [6, 7, 15, 17, 37], [5, 7, 26, 30, 46], [7, 8, 17, 19, 39], [6, 8, 28, 32, 48], [8, 19], [7, 30], [], [8, 32], [3, 5, 9, 13, 49], [4, 5, 24, 26, 58], [4, 6, 11, 15, 51], [ 5, 6, 26, 28, 60], [5, 7, 13, 17, 53], [6, 7, 28, 30, 62], [6, 8, 15, 19, 55], [7, 8, 30, 32, 64], [7, 17], [8, 32], [8, 19], [], [6, 7, 15, 17, 35, 37, 65], [5, 7, 26, 30, 42, 46, 70], [7, 8, 17, 19, 37, 39, 67], [6, 8, 28, 32, 44, 48, 72], [8, 19, 39], [7, 30, 46], [], [8, 32, 48], [6, 7, 15, 17, 51, 53, 73], [5, 7, 26, 30, 58, 62, 78], [7, 8, 17, 19, 53, 55, 75], [6, 8, 28, 32, 60, 64, 80], [8, 19, 55], [7, 30, 62], [], [8, 32, 64], [5, 7, 13, 17, 33, 37, 81], [6, 7, 28, 30, 44, 46, 86], [6, 8, 15, 19, 35, 39, 83], [7, 8, 30, 32, 46, 48, 88], [7, 17, 37], [8, 32, 48], [8, 19, 39], [], [5, 7, 13, 17, 49, 53, 89], [6, 7, 28, 30, 60, 62, 94], [6, 8, 15, 19, 51, 55, 91], [7, 8, 30, 32, 62, 64, 96], [7, 17, 53], [8, 32, 64], [8, 19, 55], [], [8, 19, 39, 67], [7, 30, 46, 70], [], [8, 32, 48, 72], [8, 19, 55, 75], [7, 30, 62, 78], [], [8, 32, 64, 80], [8, 19, 39, 83], [7, 30, 46, 86], [], [8, 32, 48, 88], [8, 19, 55, 91], [7, 30, 62, 94], [], [8, 32, 64, 96], [7, 17, 37, 65], [8, 32, 48, 72], [8, 19, 39, 67], [], [7, 17, 53, 73], [8, 32, 64, 80], [8, 19, 55, 75], [], [7, 17, 37, 81], [8, 32, 48, 88], [8, 19, 39, 83], [], [7, 17, 53, 89], [8, 32, 64, 96 ], [8, 19, 55, 91], []], [[2, 3, 10, 21], [3, 4, 12, 23], [4, 5, 14, 25], [5, 6, 16, 27], [6, 7, 18, 29], [7, 8, 20, 31], [8], [], [3, 5, 21, 25, 41], [4, 5, 12, 14, 34], [4, 6, 23, 27, 43], [5, 6, 14, 16, 36], [5, 7, 25, 29, 45], [6, 7, 16, 18, 38], [6, 8, 27, 31, 47], [7, 8, 18, 20, 40], [7, 29], [8, 20], [8, 31], [], [4, 5, 23, 25, 57], [3, 5, 10, 14, 50], [5, 6, 25, 27, 59], [ 4, 6, 12, 16, 52], [6, 7, 27, 29, 61], [5, 7, 14, 18, 54], [7, 8, 29, 31, 63], [6, 8, 16, 20, 56], [8, 31], [7, 18], [], [8, 20 ], [5, 7, 25, 29, 41, 45, 69], [6, 7, 16, 18, 36, 38, 66], [6, 8, 27, 31, 43, 47, 71], [7, 8, 18, 20, 38, 40, 68], [7, 29, 45], [8, 20, 40], [8, 31, 47], [], [5, 7, 25, 29, 57, 61, 77], [6, 7, 16, 18, 52, 54, 74], [6, 8, 27, 31, 59, 63, 79], [7, 8, 18, 20, 54, 56, 76], [7, 29, 61], [8, 20, 56], [8, 31, 63], [], [6, 7, 27, 29, 43, 45, 85], [5, 7, 14, 18, 34, 38, 82], [7, 8, 29, 31, 45, 47, 87], [6, 8, 16, 20, 36, 40, 84], [8, 31, 47], [7, 18, 38], [], [8, 20, 40], [6, 7, 27, 29, 59, 61, 93], [5, 7, 14, 18, 50, 54, 90], [7, 8, 29, 31, 61, 63, 95], [6, 8, 16, 20, 52, 56, 92], [8, 31, 63], [7, 18, 54], [], [8, 20, 56], [7, 29, 45, 69], [8, 20, 40, 68], [8, 31, 47, 71], [], [7, 29, 61, 77], [8, 20, 56, 76], [8, 31, 63, 79], [], [7, 29, 45, 85], [8, 20, 40, 84], [8, 31, 47, 87], [], [7, 29, 61, 93], [8, 20, 56, 92], [8, 31, 63, 95], [], [8, 31, 47, 71], [7, 18, 38, 66], [], [8, 20, 40, 68], [8, 31, 63, 79], [7, 18, 54, 74], [], [8, 20, 56, 76], [8, 31, 47, 87], [7, 18, 38, 82], [], [8, 20, 40, 84], [8, 31, 63, 95], [7, 18, 54, 90 ], [], [8, 20, 56, 92]], [[1, 3, 21, 22], [2, 4, 23, 24], [3, 5, 25, 26], [4, 6, 27, 28], [5, 7, 29, 30], [6, 8, 31, 32], [8], [8], [4, 5, 23, 25, 41], [4, 5, 24, 26, 42], [5, 6, 25, 27, 43], [5, 6, 26, 28, 44], [6, 7, 27, 29, 45], [6, 7, 28, 30, 46], [7, 8, 29, 31, 47], [7, 8, 30, 32, 48], [8, 31], [8, 32], [], [], [3, 5, 21, 25, 57], [3, 5, 22, 26, 58], [4, 6, 23, 27, 59], [4, 6, 24, 28, 60], [5, 7, 25, 29, 61], [5, 7, 26, 30, 62], [6, 8, 27, 31, 63], [6, 8, 28, 32, 64], [7, 29], [7, 30], [8, 31], [8, 32], [6, 7, 27, 29, 43, 45, 69], [6, 7, 28, 30, 44, 46, 70], [7, 8, 29, 31, 45, 47, 71], [7, 8, 30, 32, 46, 48, 72], [8, 31, 47], [8, 32, 48], [], [], [6, 7, 27, 29, 59, 61, 77], [6, 7, 28, 30, 60, 62, 78], [7, 8, 29, 31, 61, 63, 79], [7, 8, 30, 32, 62, 64, 80], [8, 31, 63], [8, 32, 64], [], [], [5, 7, 25, 29, 41, 45, 85], [5, 7, 26, 30, 42, 46, 86], [6, 8, 27, 31, 43, 47, 87], [6, 8, 28, 32, 44, 48, 88], [7, 29, 45], [7, 30, 46], [8, 31, 47], [8, 32, 48], [5, 7, 25, 29, 57, 61, 93], [5, 7, 26, 30, 58, 62, 94], [6, 8, 27, 31, 59, 63, 95], [6, 8, 28, 32, 60, 64, 96], [7, 29, 61], [7, 30, 62], [8, 31, 63], [8, 32, 64], [8, 31, 47, 71], [8, 32, 48, 72 ], [], [], [8, 31, 63, 79], [8, 32, 64, 80], [], [], [8, 31, 47, 87], [8, 32, 48, 88], [], [], [8, 31, 63, 95], [8, 32, 64, 96 ], [], [], [7, 29, 45, 69], [7, 30, 46, 70], [8, 31, 47, 71], [8, 32, 48, 72], [7, 29, 61, 77], [7, 30, 62, 78], [8, 31, 63, 79], [8, 32, 64, 80], [7, 29, 45, 85], [7, 30, 46, 86], [8, 31, 47, 87], [8, 32, 48, 88], [7, 29, 61, 93], [7, 30, 62, 94], [8, 31, 63, 95], [8, 32, 64, 96]]],[1],[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ol start=&quot;8&quot;&gt;&#xA;&lt;li&gt;The DFA for 7 plus the NFAs/DFAS for 8, 9, 10, 11 are &lt;a href=&quot;https://gist.github.com/Anush-ccgc/2fa45d31934e7b7062a6140d634c79fa/archive/fd668ccf06dbef6534be937c6d1ba22bbcf24b6b.zip&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; as they are too big to paste. For 12, 13, 14, 15 I have only included the NFAs. The files have names k6dfa, k7nfa, k7dfa etc. As an example, the input for problem 7 is k7nfa and the output is k7dfa.  Hopefully the rest of the names are clear.  If your code is correct for problems 1-11, I am happy to believe it is correct in general. &lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;h1&gt;Score&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I will time your code on test cases 1..15 from above of increasing size. Your score will be the largest test case your code can process in less than 10 minutes.  If two answers get to the same size then the one that is fastest on that largest test case wins. The test machine is an Intel(R) Xeon(R) CPU E5-2680 v4 @ 2.40GHz. You can use at most 16 of its cores.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Testing&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I will check your answers (for the smaller cases) using &lt;a href=&quot;https://www.gap-system.org/Manuals/pkg/automata-1.14/doc/chap4.html#X8346D1B17DBF96E7&quot; rel=&quot;nofollow noreferrer&quot;&gt;AreEquivAut&lt;/a&gt; .&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[Thank you to Christian Sievers for the example NFAs.]&lt;/p&gt;&#xA;" OwnerDisplayName="user9207" LastEditorDisplayName="user9207" LastEditDate="2020-04-24T14:55:36.197" LastActivityDate="2020-04-24T14:55:36.197" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="18851" PostTypeId="2" ParentId="2140" CreationDate="2020-04-21T14:30:16.800" Score="0" Body="&lt;h1&gt;Improved image sampling &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Quoting from the ImageMagick documentation of the very simple &lt;code&gt;-sample&lt;/code&gt; resizer, &amp;quot;You can think of the image as being divided into an array of regions, and one pixel from each region is selected for the resulting image&amp;quot;. Unfortunately, it uses a bad algorithm for choosing the one pixel: it chooses the middle one.&lt;/p&gt;&#xA;&lt;p&gt;In this challenge, you have to write a program that takes an image and a positive integer &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; (&lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; divides the height and the width) as input and outputs the image downscaled by the factor &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;. In the output image, every pixel must be taken from the corresponding &lt;span class=&quot;math-container&quot;&gt;\$N\times N\$&lt;/span&gt; square in the original image.&lt;/p&gt;&#xA;&lt;p&gt;[image gallery and settings used]&lt;/p&gt;&#xA;&lt;p&gt;This is tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, so the answer with the most upvotes wins!&lt;/p&gt;&#xA;" OwnerUserId="36445" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-04-25T10:48:14.427" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18852" PostTypeId="1" CreationDate="2020-04-21T15:21:37.300" Score="0" ViewCount="59" Body="&lt;p&gt;So I recently posted 2 answers on C64 BASIC.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I first counted it in characters, but after reading more about how the Commodore 64 works, I decided to start counting it in bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;But there were already 2 answers before that counted the bytes as characters, not bytes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should I use characters, or bytes?&lt;/p&gt;&#xA;" OwnerUserId="91569" LastActivityDate="2020-04-21T15:21:37.300" Title="How do I count C64 BASIC score?" Tags="|discussion|" AnswerCount="0" CommentCount="3" ClosedDate="2020-04-24T03:05:41.477" ContentLicense="CC BY-SA 4.0" />
  <row Id="18855" PostTypeId="2" ParentId="2140" CreationDate="2020-04-22T09:34:58.600" Score="1" Body="&lt;h1&gt;Are these two DFAs equivalent?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Two Deterministic Finite Automata or &lt;a href=&quot;https://en.wikipedia.org/wiki/Deterministic_finite_automaton&quot; rel=&quot;nofollow noreferrer&quot;&gt;DFAs&lt;/a&gt; can be checked to see if they accept same set of strings in polynomial time.  See &lt;a href=&quot;https://scholarworks.rit.edu/cgi/viewcontent.cgi?article=7944&amp;amp;context=theses&quot; rel=&quot;nofollow noreferrer&quot;&gt;section 3.3 of this&lt;/a&gt; for a long list of methods and this &lt;a href=&quot;https://cs.stackexchange.com/questions/81813/is-the-equality-of-two-dfas-a-decidable-problem&quot;&gt;SO&lt;/a&gt; question/answer for a much shorter list.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your input will be two &lt;a href=&quot;https://en.wikipedia.org/wiki/Deterministic_finite_automaton&quot; rel=&quot;nofollow noreferrer&quot;&gt;DFAs&lt;/a&gt;. In order to be able to test your code, it needs to be able to handle DFAs in the following format. This is taken  directly from &lt;a href=&quot;https://scholarworks.rit.edu/cgi/viewcontent.cgi?article=7944&amp;amp;context=theses&quot; rel=&quot;nofollow noreferrer&quot;&gt;GAP&lt;/a&gt; (and slightly simplified).&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton( Type, Size, Alphabet, TransitionTable, Initial, Accepting )&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For the input, Type will always be &quot;det&quot;.  Size is a positive integer representing the number of states of the automaton. Alphabet is the number of letters of the alphabet. TransitionTable is the transition matrix. The entries are non-negative integers not greater than the size of the automaton are also allowed. Initial and Accepting are, respectively, the lists of initial and accepting states.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;det&quot;,4,2,[ [ 1, 3, 4, 0 ], [ 1, 2, 3, 4 ] ],[ 3 ],[ 2, 3, 4 ])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This has transition table:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;   |  1  2  3  4  &#xA;-----------------&#xA; a |  1  3  4     &#xA; b |  1  2  3  4  &#xA;Initial state:    [ 3 ]&#xA;Accepting states: [ 2, 3, 4 ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And diagram:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/GTJzK.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/GTJzK.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is equivalent to:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;det&quot;,3,2,[ [ 1, 3, 1 ], [ 1, 2, 3 ] ],[ 2 ],[ 2, 3 ])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;which has diagram:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/oRVRl.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/oRVRl.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A more complicated example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;det&quot;,6,4,[ [ 0, 2, 3, 5, 0, 0 ], [ 1, 3, 5, 0, 0, 0 ], [ 1, 3, 5, 6, 0, 0 ], [ 2, 3, 5, 0, 0, 0 ] ],[ 1 ],[ 1, 4, 5, 6 ])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;has diagram:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/T9t3Q.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/T9t3Q.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is equivalent to:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;det&quot;,5,4,[ [ 2, 2, 2, 4, 5 ], [ 2, 2, 3, 1, 4 ], [ 2, 2, 3, 1, 4 ], [ 2, 2, 5, 1, 4 ] ],[ 3 ],[ 1, 3 ])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;with diagram:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/y3lA6.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/y3lA6.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;More example of equivalent DFAs&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;1.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;det&quot;,18,4,[ [ 2, 2, 6, 10, 2, 6, 7, 16, 14, 10, 18, 14, 7, 14, 15, 16, 7, 18 ], [ 3, 3, 7, 11, 3, 7, 15, 11, 7, 17, 15, 18\&#xA;, 18, 7, 15, 17, 15, 15 ], [ 4, 4, 8, 7, 4, 13, 15, 15, 16, 7, 8, 7, 15, 7, 15, 15, 16, 13 ], [ 5, 5, 9, 12, 5, 14, 7, 13, 9, 14, 17, 12, \&#xA;13, 14, 15, 7, 17, 7 ] ],[ 1 ],[ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18 ])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;det&quot;,16,&quot;abcd&quot;,[ [ 1, 2, 15, 15, 5, 6, 7, 7, 6, 2, 16, 12, 12, 16, 15, 16 ], [ 1, 3, 1, 7, 9, 15, 1, 1, 15, 8, 7, 3, 8, 15, 1, \&#xA;15 ], [ 1, 1, 2, 1, 13, 4, 4, 10, 10, 1, 15, 15, 15, 2, 1, 15 ], [ 1, 15, 3, 4, 5, 16, 15, 3, 14, 4, 11, 16, 11, 14, 15, 16 ] ],[ 5 ],[ 2,\&#xA; 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 ])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;  2. &#xA;&lt;/ol&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;det&quot;,50,4,[ [ 2, 2, 9, 13, 17, 9, 13, 17, 9, 24, 28, 30, 13, 33, 36, 30, 17, 9, 13, 9, 13, 39, 30, 24, 25, 44, 42, 28, 24, 30, 47, 39, 33, 50, 36, 36, 42, 46, 39, 25, 24, 42, 43, 44, 36, 46, 47, 42, 25, 50 ], [ 3, 6, 10, 14, 18, 10, 14, 20, 10, 25, 14, 10, 32, 34, 34, 38, 20, 10, 14, 10, 14, 38, 10, 25, 43, 34, 25, 45, 46, 10, 32, 49, 34, 43, 34, 49, 50, 50, 49, 50, 46, 25, 43, 49, 49, 50, 45, 50, 43, 43 ], [ 4, 7, 11, 15, 19, 11, 15, 21, 22, 26, 26, 31, 15, 11, 25, 15, 21, 11, 15, 11, 15, 40, 15, 40, 43, 43, 44, 26, 26, 15, 44, 31, 41, 26, 47, 25, 25, 22, 40, 43, 40, 25, 43, 43, 47, 41, 44, 44, 44, 40 ], [ 5, 8, 12, 16, 5, 12, 16, 8, 23, 27, 29, 12, 23, 35, 37, 16, 8, 12, 16, 12, 16, 41, 23, 42, 25, 40, 27, 27, 29, 23, 48, 45, 37, 49, 35, 42, 37, 48, 42, 40, 41, 42, 43, 25, 45, 37, 27, 48, 49, 25 ] ],[ 1 ],[ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 44, 45, 46, 47, 48, 49, 50 ])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;det&quot;,39,4,[ [ 1, 2, 3, 3, 5, 24, 7, 8, 22, 20, 8, 32, 18, 18, 3, 19, 25, 18, 19, 20, 25, 22, 23, 24, 25, 25, 24, 23, 5, 2, 35, 32, 19, 19, 35, 36, 36, 36, 36 ], [ 1, 38, 1, 23, 15, 9, 11, 26, 23, 28, 26, 10, 9, 26, 1, 3, 22, 26, 3, 28, 22, 23, 1, 15, 3, 3, 15, 1, 28, 27, 10, 27, 23, 23, 38, 15, 28, 15, 28 ], [ 1, 5, 1, 1, 1, 4, 12, 6, 6, 31, 31, 37, 37, 30, 5, 5, 29, 37, 3, 21, 4, 21, 4, 4, 4, 29, 30, 29, 1, 5, 29, 37, 5, 3, 29, 3, 3, 2, 2 ], [ 1, 16, 3, 4, 3, 21, 7, 18, 33, 39, 14, 13, 13, 14, 15, 16, 17, 18, 19, 34, 21, 34, 3, 19, 19, 16, 38, 15, 4, 33, 17, 18, 33, 34, 16, 19, 34, 38, 39 ] ],[ 7 ],[ 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39 ])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;3.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;det&quot;,288,4,[[2, 6, 10, 14, 18, 6, 10, 14, 18, 25, 29, 33, 36, 40, 43, 46, 36, 53, 10, 14, 18, 10, 14, 18, 25, 29, 60, 36, 29, 67, 71, 75, 77, 81, 83, 87, 88, 90, 94, 40, 98, 46, 104, 108, 111, 46, 116, 120, 75, 123, 127, 129, 53, 10, 14, 131, 129, 71, 75, 136, 140, 143, 146, 87, 149, 75, 67, 68, 155, 153, 156, 159, 161, 163, 75, 165, 77, 170, 81, 172, 81, 67, 88, 123, 156, 146, 87, 88, 156, 90, 183, 186, 188, 87, 90, 183, 94, 192, 143, 197, 199, 116, 75, 104, 108, 204, 172, 108, 208, 120, 127, 159, 90, 199, 163, 159, 215, 156, 149, 120, 153, 217, 123, 218, 131, 221, 127, 159, 87, 123, 225, 88, 155, 67, 165, 136, 227, 143, 221, 123, 218, 221, 143, 68, 67, 88, 123, 127, 143, 217, 68, 67, 153, 154, 155, 156, 234, 235, 159, 120, 161, 237, 143, 217, 165, 143, 241, 199, 188, 242, 197, 75, 67, 165, 241, 217, 248, 250, 172, 146, 221, 161, 225, 234, 111, 186, 153, 75, 217, 75, 188, 192, 257, 188, 68, 120, 90, 186, 127, 90, 208, 146, 221, 259, 140, 120, 235, 208, 165, 262, 199, 188, 68, 120, 215, 267, 217, 218, 250, 83, 75, 165, 75, 215, 225, 208, 234, 71, 149, 153, 75, 235, 208, 234, 67, 265, 272, 233, 241, 143, 120, 242, 257, 155, 153, 143, 153, 248, 267, 250, 116, 120, 75, 237, 71, 235, 250, 163, 259, 227, 153, 262, 67, 75, 155, 233, 272, 265, 116, 241, 281, 272, 68, 149, 120, 155, 283, 163, 67, 208, 285, 265, 287, 233, 285, 68, 287, 68], [3, 7, 11, 15, 19, 7, 11, 15, 22, 26, 30, 15, 37, 41, 44, 47, 50, 54, 11, 15, 19, 11, 15, 22, 26, 30, 61, 37, 30, 68, 72, 30, 78, 47, 84, 26, 30, 91, 37, 96, 99, 102, 105, 109, 112, 115, 117, 109, 122, 124, 128, 130, 54, 11, 15, 130, 132, 72, 30, 137, 141, 122, 147, 132, 150, 30, 68, 154, 109, 68, 157, 109, 162, 164, 30, 166, 168, 99, 102, 173, 175, 176, 177, 124, 128, 147, 132, 30, 72, 168, 184, 115, 189, 132, 96, 99, 37, 166, 195, 96, 99, 201, 150, 105, 109, 205, 164, 109, 154, 109, 157, 109, 211, 112, 213, 109, 154, 72, 109, 195, 208, 215, 124, 208, 130, 150, 166, 224, 26, 124, 157, 30, 226, 217, 166, 115, 213, 150, 30, 124, 208, 150, 195, 208, 176, 177, 124, 72, 224, 208, 233, 217, 68, 154, 195, 214, 195, 208, 109, 109, 236, 117, 195, 208, 214, 195, 201, 99, 173, 166, 168, 177, 68, 246, 213, 215, 68, 251, 173, 147, 150, 254, 166, 195, 99, 175, 208, 30, 215, 122, 164, 166, 251, 173, 154, 195, 78, 258, 166, 168, 154, 147, 150, 260, 141, 226, 217, 154, 214, 254, 184, 263, 154, 195, 154, 109, 208, 208, 269, 84, 177, 246, 150, 154, 166, 215, 195, 166, 150, 208, 150, 208, 215, 195, 215, 213, 195, 208, 213, 150, 195, 166, 254, 109, 68, 224, 233, 68, 109, 236, 201, 226, 150, 213, 166, 208, 277, 117, 278, 213, 233, 236, 215, 279, 195, 208, 224, 201, 117, 280, 254, 195, 208, 109, 109, 226, 213, 213, 215, 215, 277, 280, 195, 208, 236, 233, 195, 208], [4, 8, 12, 16, 20, 8, 12, 16, 23, 27, 31, 34, 38, 42, 12, 48, 51, 55, 12, 16, 20, 12, 16, 23, 56, 58, 62, 51, 65, 69, 73, 76, 79, 69, 85, 42, 89, 92, 95, 42, 100, 48, 106, 31, 113, 48, 118, 68, 48, 125, 48, 51, 55, 12, 16, 62, 51, 133, 135, 138, 56, 144, 62, 148, 151, 48, 144, 154, 154, 155, 69, 118, 154, 69, 48, 161, 79, 171, 69, 174, 69, 69, 178, 180, 69, 85, 148, 138, 182, 92, 95, 155, 135, 42, 92, 95, 148, 193, 76, 198, 200, 118, 48, 202, 58, 62, 206, 207, 69, 209, 210, 89, 92, 200, 135, 178, 216, 69, 174, 68, 68, 138, 202, 65, 219, 222, 48, 118, 148, 56, 138, 118, 154, 69, 155, 138, 228, 144, 206, 106, 229, 174, 144, 154, 144, 138, 202, 48, 144, 138, 154, 144, 68, 154, 154, 69, 228, 133, 152, 165, 154, 69, 182, 240, 155, 135, 155, 200, 135, 243, 198, 210, 244, 155, 165, 152, 249, 144, 206, 219, 252, 154, 178, 255, 113, 155, 155, 210, 240, 135, 135, 65, 151, 48, 155, 209, 92, 155, 210, 92, 244, 62, 206, 138, 202, 68, 151, 144, 161, 68, 200, 135, 265, 165, 266, 73, 152, 207, 144, 62, 48, 161, 76, 249, 138, 69, 271, 133, 73, 265, 135, 151, 144, 266, 144, 155, 182, 133, 155, 182, 161, 274, 151, 161, 265, 135, 155, 266, 151, 144, 138, 161, 275, 69, 73, 276, 144, 135, 138, 249, 68, 68, 244, 135, 161, 151, 144, 155, 138, 155, 151, 144, 155, 151, 161, 161, 249, 69, 69, 244, 144, 155, 271, 276, 144, 155, 266, 265], [5, 9, 13, 17, 21, 9, 13, 17, 24, 28, 32, 35, 39, 28, 45, 49, 52, 9, 13, 17, 21, 13, 17, 24, 57, 59, 63, 64, 66, 70, 74, 32, 80, 82, 86, 28, 32, 93, 39, 97, 101, 103, 107, 110, 114, 66, 119, 121, 49, 126, 49, 52, 9, 13, 17, 63, 64, 134, 59, 139, 142, 145, 63, 64, 152, 66, 153, 68, 144, 70, 158, 160, 151, 134, 66, 167, 169, 101, 134, 59, 70, 82, 179, 181, 82, 86, 64, 66, 74, 169, 185, 187, 190, 97, 191, 101, 64, 194, 196, 191, 101, 160, 103, 203, 160, 63, 103, 121, 195, 110, 179, 110, 212, 114, 214, 167, 213, 134, 160, 153, 121, 158, 203, 187, 220, 223, 66, 119, 57, 142, 139, 59, 151, 134, 187, 66, 214, 152, 66, 107, 230, 231, 153, 144, 145, 139, 203, 103, 232, 187, 151, 152, 153, 154, 68, 70, 214, 187, 121, 160, 68, 238, 239, 230, 70, 214, 187, 101, 59, 194, 169, 179, 245, 247, 214, 232, 70, 152, 66, 220, 253, 144, 194, 196, 101, 70, 187, 194, 256, 190, 231, 66, 152, 66, 195, 196, 80, 247, 194, 169, 213, 63, 103, 139, 203, 261, 152, 68, 239, 121, 185, 264, 213, 214, 68, 268, 121, 121, 145, 63, 139, 270, 223, 195, 66, 238, 239, 187, 74, 230, 231, 121, 266, 153, 232, 195, 236, 273, 70, 74, 239, 66, 121, 268, 245, 119, 247, 153, 144, 153, 187, 270, 253, 195, 167, 230, 232, 119, 66, 70, 261, 153, 256, 264, 236, 144, 266, 273, 158, 247, 144, 68, 273, 121, 167, 282, 195, 70, 158, 284, 266, 286, 236, 288, 68, 286, 68, 288]],[1],[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;det&quot;,266,4,[[1, 127, 50, 50, 115, 249, 50, 8, 257, 10, 151, 12, 13, 14, 81, 78, 34, 106, 137, 107, 21, 22, 82, 89, 71, 43, 43, 62, 63, 63, 44, 10, 179, 171, 214, 265, 206, 38, 137, 152, 21, 151, 71, 22, 41, 41, 47, 13, 49, 50, 50, 210, 50, 210, 116, 90, 64, 49, 207, 207, 207, 62, 232, 64, 64, 89, 151, 236, 236, 70, 71, 236, 116, 260, 128, 75, 13, 38, 77, 133, 14, 82, 13, 13, 77, 235, 64, 64, 231, 206, 138, 91, 91, 206, 90, 264, 137, 169, 10, 10, 41, 71, 232, 228, 232, 21, 21, 107, 106, 110, 111, 266, 256, 114, 114, 116, 251, 251, 116, 114, 114, 111, 266, 260, 122, 182, 127, 128, 129, 213, 132, 132, 129, 49, 49, 138, 138, 138, 249, 71, 43, 43, 210, 235, 183, 214, 132, 265, 206, 138, 232, 64, 64, 153, 153, 64, 152, 152, 82, 236, 236, 82, 116, 116, 64, 207, 266, 64, 231, 169, 171, 250, 227, 70, 175, 175, 176, 10, 47, 178, 178, 110, 111, 266, 260, 122, 266, 127, 213, 49, 49, 152, 257, 153, 257, 90, 90, 183, 250, 264, 62, 228, 229, 82, 82, 206, 64, 266, 249, 249, 249, 242, 213, 214, 64, 116, 114, 114, 50, 50, 236, 236, 261, 115, 152, 251, 8, 228, 229, 229, 231, 232, 237, 235, 235, 236, 237, 235, 235, 235, 235, 235, 235, 242, 242, 242, 115, 251, 249, 250, 116, 116, 116, 207, 64, 265, 266, 257, 256, 266, 264, 261, 260, 264, 265, 266], [1, 125, 1, 114, 114, 121, 115, 3, 23, 19, 13, 15, 230, 28, 201, 202, 16, 84, 123, 103, 105, 208, 114, 84, 172, 199, 199, 119, 83, 83, 123, 170, 16, 31, 27, 26, 25, 104, 102, 23, 28, 13, 120, 208, 48, 103, 19, 230, 239, 1, 114, 218, 115, 219, 82, 140, 23, 208, 204, 216, 216, 119, 174, 119, 119, 84, 13, 115, 115, 50, 120, 50, 82, 204, 262, 79, 230, 104, 203, 85, 28, 114, 230, 230, 203, 3, 23, 119, 96, 96, 96, 123, 102, 140, 208, 3, 200, 200, 98, 97, 103, 120, 119, 120, 119, 28, 105, 103, 105, 54, 3, 23, 141, 1, 250, 50, 82, 114, 50, 1, 250, 3, 3, 219, 219, 125, 54, 263, 124, 124, 27, 124, 223, 208, 239, 25, 208, 208, 120, 120, 217, 217, 217, 120, 120, 142, 142, 141, 140, 140, 174, 174, 174, 204, 216, 23, 119, 23, 250, 114, 114, 250, 162, 162, 159, 205, 159, 159, 208, 123, 170, 1, 219, 50, 208, 208, 123, 177, 177, 19, 170, 173, 172, 172, 199, 199, 23, 186, 185, 184, 184, 23, 120, 216, 23, 140, 208, 120, 1, 3, 119, 120, 114, 114, 250, 239, 119, 3, 121, 3, 120, 219, 212, 212, 23, 50, 1, 250, 1, 114, 50, 114, 219, 114, 23, 114, 3, 120, 114, 114, 208, 119, 125, 121, 3, 50, 54, 120, 3, 120, 121, 3, 120, 218, 219, 217, 114, 114, 3, 1, 250, 250, 250, 253, 252, 173, 172, 120, 125, 3, 3, 219, 219, 3, 54, 3], [1, 1, 249, 249, 6, 1, 1, 247, 7, 130, 167, 17, 11, 66, 33, 33, 131, 136, 10, 32, 150, 9, 112, 36, 149, 112, 149, 56, 167, 37, 181, 130, 35, 147, 139, 51, 139, 11, 10, 234, 147, 37, 148, 113, 136, 136, 146, 24, 249, 1, 1, 249, 249, 249, 139, 6, 238, 127, 134, 238, 134, 9, 148, 238, 134, 167, 36, 50, 249, 247, 73, 249, 51, 139, 112, 167, 76, 76, 11, 167, 80, 73, 67, 66, 66, 135, 58, 58, 112, 139, 233, 100, 100, 2, 6, 95, 10, 32, 130, 130, 99, 94, 94, 56, 149, 150, 147, 150, 136, 51, 51, 51, 7, 51, 51, 51, 7, 6, 139, 139, 139, 2, 58, 134, 139, 7, 1, 112, 112, 249, 238, 238, 112, 249, 127, 238, 233, 238, 1, 149, 112, 149, 249, 135, 7, 139, 238, 51, 139, 238, 112, 238, 233, 234, 234, 134, 234, 190, 112, 50, 249, 73, 139, 51, 238, 134, 51, 134, 148, 32, 147, 145, 145, 145, 258, 259, 180, 130, 146, 189, 189, 51, 51, 134, 134, 139, 2, 1, 249, 127, 249, 191, 191, 191, 188, 188, 188, 188, 198, 197, 196, 196, 195, 187, 187, 139, 233, 134, 127, 127, 127, 49, 249, 139, 243, 211, 211, 211, 210, 210, 210, 210, 95, 209, 241, 209, 126, 117, 117, 9, 112, 112, 50, 50, 50, 50, 50, 50, 49, 49, 127, 127, 127, 249, 249, 249, 7, 7, 1, 247, 51, 139, 211, 134, 134, 51, 51, 7, 7, 2, 126, 145, 139, 247, 51, 51], [1, 51, 3, 4, 4, 7, 7, 50, 73, 61, 11, 12, 40, 109, 101, 93, 45, 18, 19, 20, 21, 64, 161, 29, 193, 118, 193, 65, 11, 42, 19, 59, 30, 46, 163, 164, 163, 40, 39, 57, 46, 42, 246, 60, 18, 21, 61, 158, 72, 50, 51, 53, 53, 3, 55, 55, 57, 246, 156, 64, 65, 64, 155, 64, 65, 11, 29, 68, 69, 236, 160, 72, 73, 55, 157, 11, 154, 154, 40, 11, 46, 160, 225, 192, 192, 86, 87, 88, 157, 118, 155, 19, 39, 74, 161, 239, 92, 92, 166, 254, 20, 144, 88, 240, 65, 109, 108, 21, 21, 50, 50, 73, 73, 50, 247, 236, 73, 161, 72, 3, 5, 54, 86, 239, 3, 51, 50, 64, 64, 161, 165, 64, 157, 161, 245, 165, 60, 64, 51, 240, 161, 240, 4, 144, 51, 55, 57, 73, 55, 57, 157, 157, 155, 57, 64, 156, 64, 87, 118, 160, 161, 248, 163, 164, 165, 168, 164, 168, 60, 19, 108, 3, 3, 72, 64, 60, 19, 194, 194, 61, 59, 247, 247, 193, 193, 5, 74, 7, 69, 244, 69, 156, 240, 65, 74, 74, 246, 143, 219, 86, 88, 144, 222, 222, 226, 72, 60, 239, 52, 54, 143, 239, 72, 72, 215, 221, 219, 224, 219, 220, 221, 222, 239, 220, 215, 222, 54, 160, 160, 161, 64, 64, 160, 68, 236, 236, 236, 160, 239, 240, 244, 245, 246, 69, 72, 161, 51, 160, 50, 50, 248, 118, 226, 255, 255, 248, 248, 160, 160, 245, 245, 72, 72, 236, 236, 236]],[12],[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;4.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;det&quot;,9,4,[[1, 1, 2, 3, 1, 1, 2, 5, 2], [1, 1, 2, 8, 2, 2, 1, 6, 2], [1, 1, 2, 7, 2, 1, 2, 2, 2], [1, 1, 2, 9, 1, 1, 1, 1, 1]],[4],[2, 6])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;det&quot;,100,4,[[0, 1, 3, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 21, 22, 23, 24, 25, 26, 28, 29, 30, 31, 32, 34, 36, 37, 40, 41, 42, 43, 44, 45, 46, 47, 48, 52, 53, 54, 55, 56, 57, 58, 59, 60, 62, 63, 64, 65, 66, 68, 69, 71, 72, 73, 78, 79, 81, 84, 85, 86, 90, 93, 94, 95, 98, 99, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [1, 2, 4, 6, 7, 9, 10, 11, 12, 13, 15, 16, 19, 20, 21, 22, 23, 24, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38, 40, 41, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 59, 60, 61, 64, 66, 67, 69, 70, 71, 75, 76, 78, 80, 81, 84, 85, 86, 87, 89, 92, 93, 95, 96, 97, 100, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 1, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 15, 17, 19, 20, 22, 23, 26, 28, 29, 30, 32, 34, 35, 38, 40, 41, 45, 47, 49, 50, 53, 56, 57, 58, 59, 61, 62, 63, 64, 65, 66, 67, 68, 69, 71, 72, 73, 74, 76, 77, 79, 81, 82, 83, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [ 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 12, 14, 15, 19, 21, 22, 23, 24, 26, 27, 28, 32, 33, 34, 35, 39, 40, 42, 43, 46, 47, 51, 54, 55, 59, 60, 61, 63, 64, 67, 71, 72, 73, 74, 75, 76, 77, 78, 79, 82, 84, 85, 89, 90, 91, 92, 93, 94, 96, 97, 98, 99, 100, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]],[39],[1, 2, 5, 8, 10, 12, 13, 14, 15, 16, 17, 18, 19, 21, 24, 25, 28, 30, 31, 33, 35, 37, 41, 42, 43, 44, 49, 50, 52, 53, 57, 61, 63, 65, 66, 67, 69, 72, 73, 74, 75, 76, 77, 79, 80, 81, 82, 83, 85, 86, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 100])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;5.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A &lt;a href=&quot;https://paste.ubuntu.com/p/GNTvfXCCt7/&quot; rel=&quot;nofollow noreferrer&quot;&gt;pair of equivalent DFAs&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Non-equivalent DFAs&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&#xA;Automaton(&quot;det&quot;,100,4,[[0, 1, 2, 3, 5, 7, 9, 12, 13, 15, 20, 21, 23, 24, 25, 27, 29, 30, 31, 33, 34, 35, 36, 37, 40, 41, 42, 45, 46, 47, 48, 56, 57, 60, 62, 64, 65, 69, 70, 73, 74, 76, 80, 81, 82, 84, 86, 87, 88, 89, 90, 92, 93, 94, 95, 97, 98, 99, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 1, 2, 3, 9, 11, 12, 13, 16, 19, 20, 21, 22, 23, 24, 25, 26, 27, 30, 36, 37, 38, 39, 40, 42, 47, 49, 52, 53, 54, 59, 60, 61, 62, 63, 64, 65, 68, 69, 71, 72, 75, 76, 78, 81, 82, 84, 86, 87, 88, 89, 90, 91, 92, 95, 96, 97, 98, 99, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [2, 3, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19, 21, 24, 25, 26, 27, 28, 29, 30, 33, 35, 36, 37, 38, 39, 41, 43, 46, 50, 51, 53, 55, 56, 58, 59, 60, 61, 62, 63, 64, 65, 67, 68, 70, 73, 74, 76, 77, 78, 80, 83, 86, 87, 89, 91, 92, 93, 95, 98, 100, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 1, 2, 3, 4, 6, 8, 13, 14, 15, 17, 19, 21, 22, 23, 25, 27, 28, 29, 30, 31, 32, 35, 36, 37, 40, 42, 46, 47, 48, 50, 51, 53, 54, 56, 58, 60, 61, 63, 64, 65, 66, 68, 70, 71, 72, 74, 75, 76, 79, 81, 82, 83, 84, 85, 86, 87, 89, 90, 91, 93, 94, 95, 96, 97, 99, 100, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]],[52],[1, 5, 6, 7, 8, 10, 11, 13, 14, 16, 17, 19, 20, 23, 24, 25, 26, 27, 28, 29, 30, 32, 34, 35, 36, 37, 39, 40, 41, 42, 44, 46, 47, 49, 51, 52, 53, 54, 55, 60, 61, 62, 66, 67, 70, 72, 73, 74, 75, 76, 77, 79, 80, 81, 82, 83, 84, 86, 87, 89, 90, 92, 94, 96, 97, 98, 99, 100])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;det&quot;,100,4,[[0, 2, 3, 4, 6, 7, 10, 11, 14, 15, 16, 17, 19, 20, 21, 22, 24, 25, 26, 27, 28, 31, 34, 35, 36, 37, 38, 40, 42, 43, 44, 46, 48, 49, 51, 55, 56, 57, 58, 59, 61, 62, 63, 64, 69, 71, 72, 73, 76, 78, 79, 80, 83, 86, 87, 88, 89, 90, 91, 95, 96, 99, 100, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 17, 18, 19, 22, 23, 24, 25, 26, 27, 29, 30, 31, 32, 34, 35, 36, 37, 40, 41, 42, 43, 45, 47, 48, 50, 51, 53, 56, 57, 59, 60, 62, 63, 64, 71, 72, 73, 75, 76, 77, 79, 80, 83, 85, 86, 87, 89, 90, 91, 92, 93, 96, 98, 99, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [ 0, 2, 3, 5, 6, 7, 8, 9, 10, 12, 13, 16, 18, 21, 23, 24, 26, 27, 28, 29, 30, 32, 34, 35, 36, 37, 39, 40, 41, 42, 45, 47, 48, 50, 51, 52, 53, 56, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 72, 73, 75, 76, 78, 79, 80, 82, 84, 85, 86, 89, 90, 93, 94, 97, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [1, 2, 6, 7, 8, 9, 10, 11, 12, 13, 16, 18, 21, 22, 23, 24, 28, 30, 31, 32, 34, 36, 37, 38, 39, 40, 42, 44, 45, 47, 48, 51, 52, 53, 56, 57, 59, 60, 61, 62, 63, 64, 65, 67, 70, 74, 76, 83, 84, 86, 88, 90, 91, 93, 94, 95, 96, 97, 100, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]],[17],[1, 6, 7, 8, 9, 10, 11, 12, 13, 16, 18, 19, 22, 23, 27, 28, 29, 30, 32, 35, 36, 38, 40, 41, 42, 44, 46, 47, 48, 50, 51, 53, 54, 55, 62, 64, 66, 71, 72, 74, 75, 76, 79, 83, 86, 88, 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;det&quot;,100,4,[[2, 3, 6, 7, 8, 9, 10, 12, 14, 15, 16, 20, 21, 25, 26, 28, 29, 30, 32, 35, 36, 37, 40, 42, 43, 44, 46, 47, 48, 50, 53, 54, 55, 57, 58, 59, 62, 63, 64, 65, 67, 68, 69, 72, 73, 75, 77, 79, 81, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [2, 4, 5, 8, 13, 14, 15, 17, 18, 19, 20, 22, 23, 29, 30, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50, 51, 52, 54, 55, 56, 58, 59, 60, 63, 64, 65, 66, 67, 68, 70, 71, 72, 74, 75, 77, 78, 79, 82, 83, 84, 85, 86, 87, 93, 95, 96, 97, 98, 100, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 3, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 19, 20, 21, 23, 25, 27, 28, 30, 31, 32, 37, 38, 40, 41, 42, 45, 47, 49, 50, 51, 52, 56, 59, 61, 63, 64, 65, 68, 70, 72, 73, 74, 76, 77, 78, 80, 81, 85, 86, 87, 88, 92, 93, 94, 96, 98, 99, 100, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 1, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 17, 18, 20, 21, 22, 23, 24, 26, 27, 28, 30, 31, 33, 34, 35, 36, 37, 38, 39, 40, 42, 43, 44, 45, 48, 50, 51, 52, 53, 54, 55, 56, 58, 59, 60, 62, 64, 65, 66, 68, 69, 70, 71, 72, 74, 75, 76, 77, 79, 84, 86, 91, 92, 93, 96, 97, 100, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]],[46],[1, 2, 7, 8, 10, 12, 13, 15, 17, 18, 20, 22, 23, 24, 25, 27, 28, 29, 30, 32, 33, 35, 36, 37, 39, 41, 42, 44, 45, 47, 49, 50, 51, 52, 54, 55, 57, 59, 61, 63, 65, 66, 67, 68, 69, 70, 71, 73, 75, 76, 77, 79, 80, 81, 82, 85, 86, 88, 91, 92, 93, 94, 95, 96, 97, 98])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Automaton(&quot;det&quot;,100,4,[[0, 1, 4, 5, 7, 8, 9, 10, 11, 12, 15, 17, 18, 19, 20, 22, 23, 24, 25, 26, 27, 28, 29, 30, 33, 35, 36, 37, 39, 43, 44, 45, 46, 49, 50, 51, 52, 54, 55, 56, 57, 58, 59, 62, 63, 67, 68, 70, 72, 73, 74, 76, 77, 78, 81, 82, 83, 85, 87, 93, 94, 95, 96, 97, 98, 99, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 1, 3, 4, 5, 8, 10, 12, 15, 16, 17, 18, 19, 20, 21, 27, 29, 30, 31, 32, 34, 35, 36, 39, 40, 42, 45, 46, 47, 49, 50, 51, 52, 55, 58, 59, 60, 61, 62, 63, 64, 66, 67, 70, 71, 72, 73, 74, 75, 77, 79, 80, 81, 82, 83, 84, 86, 87, 88, 89, 92, 94, 96, 98, 99, 100, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 2, 3, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 20, 21, 23, 30, 31, 33, 34, 35, 37, 38, 39, 42, 43, 44, 46, 47, 48, 50, 52, 53, 54, 55, 56, 58, 59, 60, 61, 63, 64, 65, 66, 67, 70, 71, 75, 76, 77, 80, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 94, 98, 100, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [1, 3, 4, 7, 8, 9, 10, 11, 12, 14, 16, 17, 18, 19, 20, 21, 22, 24, 26, 27, 28, 29, 31, 33, 34, 35, 37, 38, 40, 41, 43, 49, 50, 51, 52, 53, 54, 55, 57, 58, 59, 62, 64, 65, 66, 67, 68, 69, 71, 72, 75, 76, 77, 80, 81, 82, 83, 86, 87, 88, 91, 93, 94, 95, 96, 97, 98, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]],[45],[2, 4, 6, 7, 11, 12, 14, 15, 16, 17, 19, 20, 24, 25, 27, 28, 29, 30, 37, 39, 41, 42, 44, 45, 46, 47, 48, 49, 50, 51, 52, 55, 56, 57, 58, 59, 61, 62, 63, 64, 65, 67, 71, 72, 76, 81, 82, 83, 84, 85, 86, 87, 88, 91, 92, 94, 95, 99, 100])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Score&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This question is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-time&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-time&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-time&lt;/a&gt;.  Your code must be able to run all the test cases in less than a minute on TIO.&lt;/p&gt;&#xA;" OwnerDisplayName="user9207" LastEditorDisplayName="user9207" LastEditDate="2020-04-22T16:09:51.917" LastActivityDate="2020-04-22T16:09:51.917" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18856" PostTypeId="2" ParentId="2140" CreationDate="2020-04-23T00:41:05.443" Score="0" Body="&lt;h1&gt;Fixed Point of cos(x)&lt;/h1&gt;&#xA;&lt;p&gt;Fixed points are any such values where, given a function &lt;code&gt;f&lt;/code&gt;, &lt;code&gt;x = f(x) = f(f(x)) = . . . &lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;There exists a &amp;quot;fixed point&amp;quot; for the cosine function, where &lt;code&gt;x = cos(x) = cos(cos(x))= . . . &lt;/code&gt; (you may have unknowingly come across this by repeatedly pressing &amp;quot;cos&amp;quot; on a scientific calculator).&lt;/p&gt;&#xA;&lt;p&gt;Using the knowledge that &lt;code&gt;x = f(x)&lt;/code&gt;, one can think of a fixed point as the intersection of the graphs of &lt;code&gt;y = x&lt;/code&gt; and &lt;code&gt;y = f(x)&lt;/code&gt;. If we let &lt;code&gt;f(x)=cos(x)&lt;/code&gt;, the graph looks like this:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/oqPcR.png&quot; alt=&quot;img&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to calculate the &lt;code&gt;x&lt;/code&gt;-value of the fixed point of &lt;code&gt;cos(x)&lt;/code&gt; &lt;code&gt;0.73908513 . . . &lt;/code&gt; to at least 3 digits' precision (i.e. at least as far as &lt;code&gt;0.739&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;No input is to be taken for the program&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest answer (in bytes) wins&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Questions for Sandbox:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Is the question clear enough as it is written?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I have searched, but I am still paranoid: is this a duplicate?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Are the tags &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; suitable? Or should I also include &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Should I allow input? It seems unnecessary for solving the problem to me&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;How far should the precision be extended?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="94333" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-04-23T00:41:05.443" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18858" PostTypeId="2" ParentId="2140" CreationDate="2020-04-23T11:35:16.327" Score="0" Body="&lt;h1&gt;Boolean Variable Satisfiability &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You are given a logical expression containing 'true', 'false', 'variable' and some common boolean operators. Assuming that all variables are independent and can be freely set to either true or false, is it possible assign values to the variables such that the expression evaluates to true?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For example, the expression &lt;code&gt;true and variable and not variable&lt;/code&gt; can indeed evaluate to true (if the first variable is true and the second is false). However, the expression &lt;code&gt;false and variable&lt;/code&gt; cannot ever evaluate to true, regardless of what values you set the variable to.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that you are not required to construct a solution; you only need to determine whether or not it exists.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You are given an expression in &lt;a href=&quot;https://en.wikipedia.org/wiki/Reverse_Polish_notation&quot; rel=&quot;nofollow noreferrer&quot;&gt;Reverse Polish notation&lt;/a&gt;, using the following symbols:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;T&lt;/code&gt; - True&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;F&lt;/code&gt; - False&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;V&lt;/code&gt; - Variable&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;amp;&lt;/code&gt; - Logical AND&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;|&lt;/code&gt; - Logical OR&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;^&lt;/code&gt; - Logical XOR&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;!&lt;/code&gt; - Logical NOT&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;As an example, &lt;code&gt;TFV!T^|&amp;amp;&lt;/code&gt; represents the expression &lt;code&gt;true and (false or (not variable xor true))&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The program should output a truthy value iff the expression can be evaluated to true for some set of variable assignments. Otherwise, a falsy value should be outputted.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Here are a few example expressions and their expected outputs:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;TF&amp;amp;&#xA;False&#xA;&#xA;FV|V&amp;amp;&#xA;True&#xA;&#xA;VV!&amp;amp;&#xA;True&#xA;&#xA;VV^!&#xA;True&#xA;&#xA;VV&amp;amp;F|VVT|!&amp;amp;V!&amp;amp;&amp;amp;&#xA;False&#xA;&#xA;VV&amp;amp;F|VVT|!&amp;amp;V!^&amp;amp;&#xA;True&#xA;&#xA;TFV!T^|&amp;amp;&#xA;True&#xA;&#xA;VT|!V&amp;amp;F|VF&amp;amp;!T^^&#xA;False&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox Comments&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I've written this as if I would post it right away. However, seeing as this is the first challenge I've written for this site, any and all input is welcome so as to make sure it's of an acceptable standard.&lt;/p&gt;&#xA;" OwnerUserId="17600" LastActivityDate="2020-04-23T11:35:16.327" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18859" PostTypeId="2" ParentId="2140" CreationDate="2020-04-23T15:47:35.373" Score="0" Body="&lt;h1&gt;Constellation Enumeration in Game of Life&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Yet another trivial Conway's Game of Life challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A stable &lt;a href=&quot;https://www.conwaylife.com/wiki/Still_life#Constellations&quot; rel=&quot;nofollow noreferrer&quot;&gt;constellation&lt;/a&gt; is a still life that is composed of two or more non-interacting objects.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You task is to take the valid object list, and output a list of all possible constellations. The objects cannot be rotated or reflected. All of the objects are still lives themselves.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A sample implementation is &lt;a href=&quot;https://github.com/dvgrn/b3s23life/blob/master/enumerate-constellations/build-constellation.py&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any advices on the input and output format? Plain text, RLE, or every Golly-accepable form?&lt;/li&gt;&#xA;&lt;li&gt;Any test cases?&lt;/li&gt;&#xA;&lt;li&gt;Other recommendations.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="87986" LastActivityDate="2020-04-23T15:47:35.373" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18864" PostTypeId="5" CreationDate="2020-04-24T13:33:15.850" Score="0" Body="&lt;p&gt;This tag is used by staff when sharing concepts in the Discovery phase relating to product or configuration changes. In most cases a direction and/or goal has been established, and there has likely been some amount of time invested into discovery work and research. The post is being presented to the Community for feedback to be taken into consideration. Where possible, the post includes specific questions to help guide Community feedback.&lt;/p&gt;&#xA;" OwnerUserId="-1" LastEditorUserId="-1" LastEditDate="2020-04-28T08:51:03.790" LastActivityDate="2020-04-28T08:51:03.790" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18865" PostTypeId="4" CreationDate="2020-04-24T13:33:15.850" Score="0" Body="Indicates that the post shares product or configuration change concepts during the Discovery phase. Open to receiving feedback from the Community preceding implementation." OwnerUserId="-1" LastEditorUserId="-1" LastEditDate="2020-04-28T08:51:03.790" LastActivityDate="2020-04-28T08:51:03.790" Title="product-discovery" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18867" PostTypeId="2" ParentId="2140" CreationDate="2020-04-24T23:55:35.870" Score="1" Body="&lt;h2&gt;Island Rose Breeder&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Island Roses have an extremely simple genetic code, with just 4 genes: R, Y, W, and B, each with two alleles. This means their entire genome can be represented by four 2-bit gene pairs of the form: &lt;code&gt;00-00-00-00&lt;/code&gt; (&lt;code&gt;01&lt;/code&gt; and &lt;code&gt;10&lt;/code&gt; are equivalent)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Island Roses can be bred together. When two roses are bred, each parent flower donates one allele for each gene. This can be represented by Mendelian genetics via a Punnett square:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/8EEzX.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/8EEzX.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance, a &lt;code&gt;01-00-11-11&lt;/code&gt; flower that is bred with a &lt;code&gt;01-00-11-11&lt;/code&gt; flower will result in either:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a &lt;code&gt;00-00-11-11&lt;/code&gt; flower (25% chance)&lt;/li&gt;&#xA;&lt;li&gt;a &lt;code&gt;01-00-11-11&lt;/code&gt; flower (50% chance)&lt;/li&gt;&#xA;&lt;li&gt;a &lt;code&gt;11-00-11-11&lt;/code&gt; flower (25% chance)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Based on their genes, Island Roses can display one of 8 phenotypes -- colors.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A list of the genotypes and their corresponding phenotypes can be &lt;a href=&quot;https://pastebin.com/VuVrd8N2&quot; rel=&quot;nofollow noreferrer&quot;&gt;found here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a starting stock of Roses, determine how many generations (and which Roses to use) it would take to breed a particular phenotype. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because genetic testing is expensive, you can only identify the results of breeding by observing the phenotype of the offspring. For example, Breeding two &lt;code&gt;11-00-00-01&lt;/code&gt; (Red) roses gives three distinct phenotypes, so any Black rose that results &lt;em&gt;must&lt;/em&gt; have genotype of &lt;code&gt;11-00-00-11&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In the case of ambiguous phenotypes, subsequent generations of breeding can be done to disambiguate the specific phenotypes.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&#xA;Input Roses:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;11-00-00-01&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;00-00-01-00&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;00-11-00-00&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Target Phenotype:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;11-11-11-00&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="94641" LastActivityDate="2020-04-24T23:55:35.870" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18868" PostTypeId="2" ParentId="2140" CreationDate="2020-04-26T05:35:52.303" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/204061&quot;&gt;Posted on the main site.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="67545" LastEditorUserId="67545" LastEditDate="2020-04-28T03:38:40.667" LastActivityDate="2020-04-28T03:38:40.667" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18869" PostTypeId="2" ParentId="2140" CreationDate="2020-04-26T13:40:14.417" Score="-2" Body="&lt;h1&gt;Write an if/else statement from scratch &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I am new to this community, so please do not hesitate to point out edits and clarifications in this post. Also note that this is just a loose draft for the question. There are several improvements to be made.. &lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Task:-&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;We all use if/else statements in our daily programming life (except the oldies who write Machine code). However, put your feet in a young programmer's shoes. If you wanted to write the &lt;code&gt;if/else&lt;/code&gt; statement, what would you do?&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;So basically you have to re-design or recreate the &lt;code&gt;if/else&lt;/code&gt; statement in &lt;em&gt;any&lt;/em&gt; language of your choice.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The &lt;code&gt;if/else&lt;/code&gt; statement should obviously &lt;strong&gt;not&lt;/strong&gt; use &lt;code&gt;if/else&lt;/code&gt; from any other language. This does not mean that we can use a statement that has some other name in other languages, &lt;strong&gt;no&lt;/strong&gt; function/statement that produces &lt;code&gt;if/else&lt;/code&gt; statement &lt;strong&gt;behavior&lt;/strong&gt; can be used.          &lt;/p&gt;&#xA;&#xA;&lt;p&gt;So this means that functions like &lt;code&gt;case&lt;/code&gt; etc. which can be used in substitution with &lt;code&gt;if-else&lt;/code&gt; cannot be used. Neither can you use &lt;code&gt;while&lt;/code&gt; loops to &lt;em&gt;simulate&lt;/em&gt; an &lt;code&gt;if/else&lt;/code&gt;....&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Ideas:-&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;On posting this as a question there were a lot of people saying that the challenge was not clear. Can anyone edit or point the mistakes in the lines or think that they can make the question a bit more clear?    &lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;In the simplest words, it is a challenge to write the &lt;code&gt;if/else&lt;/code&gt; statement without using any of its counterparts (like in other languages it has other names) which can be &lt;strong&gt;used&lt;/strong&gt; with a syntax for general cases. For example, it should be able to compare:-&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;arrays&#xA;lists&#xA;dicts&#xA;other data types (heap, stack,tree)&#xA;strings&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Everything a normal &lt;code&gt;if/else&lt;/code&gt; can do.&lt;/p&gt;&#xA;" OwnerUserId="91024" LastEditorDisplayName="user92069" LastEditDate="2020-04-26T14:19:57.387" LastActivityDate="2020-04-26T14:19:57.387" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="18870" PostTypeId="2" ParentId="2140" CreationDate="2020-04-27T08:43:32.620" Score="3" Body="&lt;h1&gt;Will this simplified befunge-93 program terminate? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The challenge today is to solve the halting problem for &lt;em&gt;simplified befunge-93&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Simplified befunge-93 has exactly four instructions - &lt;code&gt;&amp;gt; v &amp;lt; ^ @&lt;/code&gt;. The program is restricted to a 80x24 grid. Each of the commands modifies the instruction pointer (so that, for instance &lt;code&gt;&amp;gt;&lt;/code&gt; makes the instruction pointer start executing commands to the right), except of the &lt;code&gt;@&lt;/code&gt; instruction, which terminates the program.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;When the instruction pointer reaches the end, it wraps around (imagine the snake game).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may read input in form of a string or a two-dimensional array using any reasonable device. The output may be either a truthy value if the program terminates, or a falsy value if the program doesn't terminate.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example data&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA;&amp;gt;v&#xA;^&amp;lt;&#xA;&#xA;Output: Doesn't terminate.&#xA;----------------------------------------&#xA;Input:&#xA;&amp;gt; v&#xA; @&#xA;^ &amp;lt;&#xA;&#xA;Output: Doesn't terminate.&#xA;----------------------------------------&#xA;Input:&#xA;v@&#xA;[23 newlines]&#xA;&amp;gt;v&#xA;&#xA;Output: Terminates.&#xA;----------------------------------------&#xA;Input:&#xA;v @&#xA;[23 newlines]&#xA;&amp;gt;v&#xA;&#xA;Output: Doesn't terminate.&#xA;----------------------------------------&#xA;Input:&#xA;&#xA;Output: Doesn't terminate.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="61379" LastEditorDisplayName="user92069" LastEditDate="2020-04-29T05:46:41.930" LastActivityDate="2020-04-29T05:46:41.930" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18871" PostTypeId="2" ParentId="2140" CreationDate="2020-04-27T09:20:24.443" Score="5" Body="&lt;h2&gt;Is the input Bl lu ur rr ry? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is based off &lt;a href=&quot;https://codegolf.stackexchange.com/questions/203893/bl-lu-ur-rr-ry-yv-vi-is-si-io-on-blur-the-text/&quot;&gt;this&lt;/a&gt; challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an input string, check whether the string is blurry.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What's a blurry string?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Take a non-blurrified string &lt;code&gt;abc&lt;/code&gt; as an example. You repeat every character of this twice:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;aabbcc&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And then insert spaces at every odd-even index.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;a ab bc c&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then, remove the preceding 2 and succeeding 2 extra characters.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;ab bc&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;As an example, all of these strings are blurry (the empty line stands for an empty string):&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;a&quot;   -&amp;gt;&#xA;&quot;ab&quot;  -&amp;gt;ab&#xA;&quot;abc&quot; -&amp;gt;ab bc&#xA;&quot;abcd&quot;-&amp;gt;ab bc cd&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input string consists purely of printable ASCII characters. The only whitespace it will contain is the space character.&lt;/li&gt;&#xA;&lt;li&gt;You don't have to remove extra characters before the check.&lt;/li&gt;&#xA;&lt;li&gt;Your output can consist of any trailing whitespace, as long as it's possible to tell a truthy result from a falsy result.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##yy9OTMpM/a@kxKWUmAQmFJKSYbRCcgqQqYBgQkUVlLiAbDAfqhYkDFOinJSsDGUmJUMYCkjGATlgrgLIuqREheQkhZRkCBOoBMx0c0tMzMkpLk5NVeLS5Dq39f@hZYdWGB/ecm6r0bmdCcWHu4sPbwhUqz08/3/tfwA&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt; is a program I use to check my test cases.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&quot;&quot;          -&amp;gt; True&#xA;&quot;ab&quot;        -&amp;gt; True&#xA;&quot;ab bc&quot;     -&amp;gt; True&#xA;&quot;ab bc cd&quot;  -&amp;gt; True&#xA;&quot; b bc cd&quot;  -&amp;gt; True&#xA;&quot;ab bc c &quot;  -&amp;gt; True&#xA;&quot;a   c cd&quot;  -&amp;gt; True&#xA;&#xA;&quot;a&quot;         -&amp;gt; False&#xA;&quot;abc&quot;       -&amp;gt; False&#xA;&quot;ab  bc  cd&quot;-&amp;gt; False&#xA;&quot;ab#bc#cd&quot;  -&amp;gt; False&#xA;&quot;abbccd&quot;    -&amp;gt; False&#xA;&quot;a ab bc cd&quot;-&amp;gt; False&#xA;&quot;a a ab b b&quot;-&amp;gt; False&#xA;&quot;ba cb dc&quot;  -&amp;gt; False&#xA;&quot;ba bc dc&quot;  -&amp;gt; False&#xA;&quot;FFaallssee&quot;-&amp;gt; False&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-04-29T07:24:06.883" LastActivityDate="2020-04-29T07:24:06.883" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18872" PostTypeId="2" ParentId="2140" CreationDate="2020-04-27T13:09:55.507" Score="2" Body="&lt;h1&gt;Help, I've mixed my week up!&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;My dog ate my calendar, and now my days are all mixed up. I tried putting it back together, but I keep mixing up the days of the week! I need some help putting my calendar back together, with the days in the correct order.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;And since I need my calendar put together as fast as possible, don't waste my time by sending me superfluous bytes. The fewer bytes I have to read, the better!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The days of the week, in any order. Input can be taken as a list of strings, or a space separated string, or any reasonable way of representing 7 strings (one for each day of the week). &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The strings themselves are all capitalized, as weekdays should be, so the exact strings are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Monday&#xA;Tuesday&#xA;Wednesday&#xA;Thursday&#xA;Friday&#xA;Saturday&#xA;Sunday&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The days of the week, in sorted order (Monday - Sunday). Output can be as a list of strings, or printed with some delimiter. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Disclaimer&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Note that this is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenge, with the added benefit of being able to use the input to shorten your code. You are not required to use the input if you don't want to.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To see example input and output, you can consult &lt;a href=&quot;https://tio.run/##dYxLCsMgFEXnrkIyUgiZdCZkAR11CeG1T4lUn@IHdPVpoMmgpZ3ec86NvayBLttmfQyp8Ac4TQiJmdmBvyPwpvIONIo2PnU/V1TO5iJOfULoC4HXcrKEugmU8rxMQBg8y2s1xmlcdjXzmf/p2VufDl18ZJLFZKmI4UqxFjWM/De@1XJw83Ugtxc&quot; rel=&quot;nofollow noreferrer&quot;&gt;this python script&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;For the sandbox&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If there are any issues with the input/output specification, or if anything is unclear, please leave a comment.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot;&gt;sorting&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/calendar&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;calendar&amp;#39;&quot; rel=&quot;tag&quot;&gt;calendar&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="79994" LastEditorUserId="79994" LastEditDate="2020-04-28T06:17:52.483" LastActivityDate="2020-04-28T06:17:52.483" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18876" PostTypeId="2" ParentId="2140" CreationDate="2020-04-27T18:12:17.473" Score="2" Body="&lt;h1&gt;Fold my ACGT proteins &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/biology&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;biology&amp;#39;&quot; rel=&quot;tag&quot;&gt;biology&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chemistry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chemistry&amp;#39;&quot; rel=&quot;tag&quot;&gt;chemistry&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Quoting Wikipedia, &lt;em&gt;&quot;Protein folding is the physical process by which a protein chain acquires its native 3-dimensional structure, a conformation that is usually biologically functional, in an expeditious and reproducible manner.&quot;&lt;/em&gt;. I don't know what that means &lt;em&gt;but&lt;/em&gt; by means of a game called &lt;a href=&quot;https://en.wikipedia.org/wiki/Foldit&quot; rel=&quot;nofollow noreferrer&quot;&gt;Foldit&lt;/a&gt; it seems we can use protein folding in some way to help and fight diseases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please bear in mind that the task described was inspired by the isolated meaning of the words in &lt;em&gt;&quot;protein folding&quot;&lt;/em&gt; and doesn't necessarily translate into how protein folding really works! i.e. the title is just a pun.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to take a string matching the regex &lt;code&gt;/^[ACGT]+$/&lt;/code&gt; and return the number of times the string can be &quot;folded&quot;. A string can be folded if and only if:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's length is even;&lt;/li&gt;&#xA;&lt;li&gt;The first half of the string is the reverse of the second half of the string.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Acceptable input formats include but are not limited to:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;strings&lt;/li&gt;&#xA;&lt;li&gt;character lists&lt;/li&gt;&#xA;&lt;li&gt;codepoint lists&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The output is an integer; I don't think there's much room to wiggle here, but let me know if you really wanted to return something else.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases:&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##fVJRb4IwEH7nV1xYFmGKDp2bMXOJ4cE/wJsxBqRoF2hJKQ@L8be7O0AsZtlLe9/1@67fXVv86JMUs@s1VTIHFYkEN54XUukWWVbCUkhlluxz5hRKasaFu7QAeAoZE13qeUpJAMV0pQS8ImBZyZrkKcpSWEHL3S5N4WQy3dUkLFjzhvW2XS49fwerTtVU6i7wkXezRXy3Pr5faTjpWnDiqGQj6PwLqUH0bBPBag6b/h0XPuF1PO@xulpDWhqnWNbz3V7Xj@yGOGxNENvSrNT7AyZKHM92Z1lPIJMERJXHTLGEJnzUp9JKpQIOXJCrI3P8EXyMYFr3cS8xjoqCicSx1/YLd6nWd1VqiKDMoyyDnJdFFh1YzoRGHdnAS4m8eKy/@K8yDt4ObVoROQuPYyfUitzHFc8SagTFyA02oU0uRyac9eFbC8N1EBhkUxiuCc1vOozf2zgw4o0Rh0bcEwcbE6xNP2jAQHjWYXwVGk@Mb0YTuvX594Sax6Y/5l5JRYxa1TFJVygutJPagzPlLwPwvuB8@82Uci@2e/0F&quot; rel=&quot;nofollow noreferrer&quot;&gt;Python reference implementation&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;'A' -&amp;gt; 0&#xA;'AAA' -&amp;gt; 0&#xA;'AAAAA' -&amp;gt; 0&#xA;'TAAAAAAA' -&amp;gt; 0&#xA;'ATAAAAAA' -&amp;gt; 0&#xA;'AATAAAAA' -&amp;gt; 0&#xA;'AAATAAAA' -&amp;gt; 0&#xA;'AAAATAAA' -&amp;gt; 0&#xA;'AAAAATAA' -&amp;gt; 0&#xA;'AAAAAATA' -&amp;gt; 0&#xA;'AAAAAAAT' -&amp;gt; 0&#xA;'TGCAACGTTGCAACGT' -&amp;gt; 2&#xA;'ACGTTGCAACGTTGCAACGTTGCAACGTTGCA' -&amp;gt; 3&#xA;'TGCAACGTTGCAACGTTGCAACGTTGCAACGTTGCAACGTTGCAACGTTGCAACGTTGCAACGT' -&amp;gt; 4&#xA;'TACCCCATTACCCCAT' -&amp;gt; 2&#xA;'TTTT' -&amp;gt; 2&#xA;'TATTATTATTATTATTATTATTATTATTATTATTATTATTATTATTATTATTATTATTATTATTATTATTATTATTATTATTATTATTATTATTAT' -&amp;gt; 5&#xA;'AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA' -&amp;gt; 6&#xA;'CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC' -&amp;gt; 6&#xA;'GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG' -&amp;gt; 6&#xA;'TTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT' -&amp;gt; 6&#xA;'TAATTAATTAATTAATTAATTAATTAATTAATTAATTAATTAATTAATTAATTAATTAATTAAT' -&amp;gt; 5&#xA;'GCCGGCCGGCCGGCCGGCCGGCCGGCCGGCCGGCCGGCCGGCCGGCCGGCCGGCCGGCCGGCCG' -&amp;gt; 5&#xA;'CATTACCATTACCATTACCATTAC' -&amp;gt; 3&#xA;'CATTACCATTACCATTACCATTAC' -&amp;gt; 3&#xA;'CATACCATACCATACCATACCATACCATACCATACCATAC' -&amp;gt; 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="75323" LastEditorUserId="75323" LastEditDate="2020-05-01T11:25:44.157" LastActivityDate="2020-05-01T11:25:44.157" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18877" PostTypeId="2" ParentId="2140" CreationDate="2020-04-27T18:45:27.550" Score="-2" Body="&lt;h1&gt;Produce the next Italy number &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is the third post for the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/18874/75323&quot;&gt;second RGS's Golfing Showdown&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Italy is a Southern European country that was greatly devastated by the impact of the coronavirus crisis in its fairly aged population. As of the 27th of April, Italy was roughly 600 cases short of hitting 200.000 total confirmed cases.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to produce the total number of confirmed cases on day &lt;code&gt;n+1&lt;/code&gt; given the total number of confirmed cases on day &lt;code&gt;n&lt;/code&gt;, with &lt;code&gt;n&lt;/code&gt; going from the 21st of February 2020 to the 10th of April 2020, as per &lt;a href=&quot;https://en.wikipedia.org/wiki/2020_coronavirus_pandemic_in_Italy&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia's data&lt;/a&gt;, obtained at 19:38 27/04/2020 UTC.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For your convenience, these are the 20 numbers involved; the first 19 are inputs and the last 19 are outputs.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[20, 79, 150, 229, 322, 445, 650, 888, 1128, 1694, 2036, 2502, 3089, 3858, 4636, 5883, 7375, 9172, 10149, 12462]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;I/O&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I/O should be integers or reasonable representations of those, with the restriction that your code must accept as input its own output.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases:&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;20 -&amp;gt; 79&#xA;79 -&amp;gt; 150&#xA;150 -&amp;gt; 229&#xA;229 -&amp;gt; 322&#xA;322 -&amp;gt; 445&#xA;445 -&amp;gt; 650&#xA;650 -&amp;gt; 888&#xA;888 -&amp;gt; 1128&#xA;1128 -&amp;gt; 1694&#xA;1694 -&amp;gt; 2036&#xA;2036 -&amp;gt; 2502&#xA;2502 -&amp;gt; 3089&#xA;3089 -&amp;gt; 3858&#xA;3858 -&amp;gt; 4636&#xA;4636 -&amp;gt; 5883&#xA;5883 -&amp;gt; 7375&#xA;7375 -&amp;gt; 9172&#xA;9172 -&amp;gt; 10149&#xA;10149 -&amp;gt; 12462&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##NVDLasMwELz7K4bk0ASU2JafMbTQSyHfEEKQbbkWTSQhyQ1uyLe7ErSXfc3M7rB6dqOS2bKsIRy7znDKJ3TMckswGHWDGzloah3UgA/emomZGZPGJJ24glZuDMi7NuJKwCw0Nxid07aJYy73d/ElNO8F2yvzGYcupglNLp0ySrJvYSZ70Uz2/Ca6i5CXY7ARrXGEvXNmfO5FL18cOqXnYMZytDNGL0GzjeR0a7mxeMWJJgTVgSAtfEGprzJKCfK8ICjDrK5rj6Y0xPKQe1KSlT4WiadlSR0UdeHRvAzzoq4zvzGrvP6QVp6TJmkeDtC8pOcoigZlwAhaCIkfoTd/Zk7NLj0T/Hdpc942EeA/JN1mWD3YE7s3PNrnarssvw&quot; rel=&quot;nofollow noreferrer&quot;&gt;Python reference implementation&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="75323" LastEditorUserId="75323" LastEditDate="2020-04-29T19:00:02.873" LastActivityDate="2020-04-29T19:00:02.873" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="18878" PostTypeId="2" ParentId="2140" CreationDate="2020-04-28T02:30:37.783" Score="1" Body="&lt;h1&gt;Vampire Bats &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/path-finding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;path-finding&amp;#39;&quot; rel=&quot;tag&quot;&gt;path-finding&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;TwilightSparkle needs help controlling COVID-19 in Equestria.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The bats are spreading the virus in the APL orchard. The orchard is an N×M rectangle of APL trees and the bats are on some of the trees.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &quot;Asdfjklio&quot; spell can be casted to travel through a specified path starts on a bat and ends on a bat and destroy every bats it reaches. Asdfjklio can only move horizontally or vertically.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to output how many paths are there to destroy all of the bats.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;strong&gt;They crossed the line, it's time to fight them back!&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;An example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Suppose there are two bats on respective grids, where &lt;code&gt;X&lt;/code&gt; stands for the bats and &lt;code&gt;.&lt;/code&gt; stands for empty spaces:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;.X&#xA;X.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The Asdfjklio spell can travel in any path specified, although it has to start with a bat grid and end with a bat grid.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;So there are 4 possible ways to destroy all the bats:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;| ^| v|&amp;lt;&amp;lt;|&#xA;^ |&amp;gt;&amp;gt;|&amp;lt;&amp;lt;|v |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this task a dupe? If so I would change it to other (less interesting) candidates.&lt;/li&gt;&#xA;&lt;li&gt;Input format?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="87986" LastEditorUserId="87986" LastEditDate="2020-04-28T03:17:12.297" LastActivityDate="2020-04-28T03:17:12.297" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18881" PostTypeId="2" ParentId="2140" CreationDate="2020-04-28T14:54:01.780" Score="1" Body="&lt;h1&gt;Linear recurrences &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/maths&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;maths&amp;#39;&quot; rel=&quot;tag&quot;&gt;maths&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is the fourth post for the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/18874/75323&quot;&gt;second RGS's Golfing Showdown&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rationale&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Feel free to skip this, as I'm just sharing the train of thought that led me to creating this challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The Fibonacci sequence we all know and love (?) is the sequence that whose first terms are&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765 10946 17711 28657 46368 75025 121393 196418 317811 514229 832040&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;and starting from &lt;code&gt;1 1&lt;/code&gt;, each following number is obtained from the sum of the previous two. An interesting thing about the Fibonacci sequence is that it can be used to &lt;a href=&quot;https://en.wikipedia.org/wiki/Fibonacci_number#History&quot; rel=&quot;nofollow noreferrer&quot;&gt;calculate the growth of a population of rabbits&lt;/a&gt; (see 4th, 5th, ... chapters of the linked section). Then I thought, what if I use it to calculate the number of people infected by COVID?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I tried reasoning to try and find sensible weights for a possible mock linear recursion to model the number of infected people, but I failed to do so. I need you to help &lt;em&gt;me&lt;/em&gt; test my models.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Code a function that takes a set of initial values and a set of weights (with the same length as the set of initial values) and then allows one to generate the sequence specified by the initial values and weights. Formally, if the &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; initial values are &lt;span class=&quot;math-container&quot;&gt;\$T_1, T_2, \cdots, T_k\$&lt;/span&gt; and the weights are &lt;span class=&quot;math-container&quot;&gt;\$w_1, w_2, ..., w_k\$&lt;/span&gt; then the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th term of your sequence is given by &lt;span class=&quot;math-container&quot;&gt;\$T_n\$&lt;/span&gt; if &lt;span class=&quot;math-container&quot;&gt;\$n \leq k\$&lt;/span&gt;, otherwise it is defined recursively by&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$T_{n} = \sum_{i=1}^k T_{n-i}w_{k-i+1} = T_{n-1}w_{k-1} + T_{n-2}w_{k-2} + \cdots + T_{n-k}w_{1}$$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You must take two lists of numbers as input for the initial values and weights. Any sensible format is allowed. One or both lists can be reversed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Additionally, you can&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;take no extra input and generate the sequence infinitely&lt;/li&gt;&#xA;&lt;li&gt;take an extra integer &lt;code&gt;n&lt;/code&gt; and generate the first &lt;code&gt;n&lt;/code&gt; terms&lt;/li&gt;&#xA;&lt;li&gt;take an extra integer &lt;code&gt;n&lt;/code&gt; and generate the nth term (0- or 1- indexed)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;See input section above.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Each 3 lines give the initial values, the weights, and then the first 10 terms of each sequence. &lt;a href=&quot;https://tio.run/##ZVGxTsMwEN3zFW/DFmnVpIihiD9AQuIHKitc2kjBKY7TClVdAJVSFAQDgoWFqTvqwgh/4h8JjlsgEvLJ5/fe3fNZFqO0dXoh0mxQVf2jRJJQJxQVKk8y2YeZP2DqwZSvOB6REjpTPaQUawhF0ENCIhOdiBRjkRaU@1DJYPinTqiG@QEiRUJTjriQkbbWUKQLJRM5gNRDaFJnyGLXk9N5QTKi@toPN4HNNjwEh6Zc92CWVw4yi1oBh1ncmHIF1jK3b5tSbuaPNvm2wMZu@@u5bph5nh1B57UlM8tL5gec@SHnfgN2OYfPfBbAogAhZ2G9BdjnZvHSnrqZyvVsU@C0LvZ@PWp62wlr1aDDH8GtjtU8bzrGZPvCNczdNWKHxvj/ExOnm/snWzBunJt8/LmyTu9Bp8Ht7Mws695dVd8&quot; rel=&quot;nofollow noreferrer&quot;&gt;Reference APL program&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Bonus imaginary internet points if your solution handles floating point initial values/weights.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;2&#xA;1 2 4 8 16 32 64 128 256 512&#xA;&#xA;1&#xA;3&#xA;1 3 9 27 81 243 729 2187 6561 19683&#xA;&#xA;1 1&#xA;1 1&#xA;1 1 2 3 5 8 13 21 34 55&#xA;&#xA;1 1&#xA;2 2&#xA;1 1 4 10 28 76 208 568 1552 4240&#xA;&#xA;1 1&#xA;3 4&#xA;1 1 7 31 145 673 3127 14527 67489 313537&#xA;&#xA;&#xA;1 2&#xA;1 1&#xA;1 2 3 5 8 13 21 34 55 89&#xA;&#xA;1 2&#xA;2 2&#xA;1 2 6 16 44 120 328 896 2448 6688&#xA;&#xA;1 2&#xA;3 4&#xA;1 2 11 50 233 1082 5027 23354 108497 504050&#xA;&#xA;2 2&#xA;1 1&#xA;2 2 4 6 10 16 26 42 68 110&#xA;&#xA;2 2&#xA;2 2&#xA;2 2 8 20 56 152 416 1136 3104 8480&#xA;&#xA;2 2&#xA;3 4&#xA;2 2 14 62 290 1346 6254 29054 134978 627074&#xA;&#xA;1 6&#xA;1 1&#xA;1 6 7 13 20 33 53 86 139 225&#xA;&#xA;1 6&#xA;2 2&#xA;1 6 14 40 108 296 808 2208 6032 16480&#xA;&#xA;1 6&#xA;3 4&#xA;1 6 27 126 585 2718 12627 58662 272529 1266102&#xA;&#xA;1 1 1&#xA;1 2 3&#xA;1 1 1 6 21 76 276 1001 3631 13171&#xA;&#xA;1 2 1 1&#xA;1 1 1 10&#xA;1 2 1 1 14 144 1456 14719 148804 1504359&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="75323" LastEditorUserId="75323" LastEditDate="2020-04-28T16:07:06.523" LastActivityDate="2020-04-28T16:07:06.523" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18884" PostTypeId="2" ParentId="18821" CreationDate="2020-04-29T09:03:55.070" Score="2" Body="&lt;h2&gt;Yes, but...&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The downside is your submission is no longer &quot;C&quot; but &quot;C/Bash/Linux&quot;, which is less interesting.&lt;/p&gt;&#xA;" OwnerUserId="30512" LastActivityDate="2020-04-29T09:03:55.070" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18885" PostTypeId="2" ParentId="2140" CreationDate="2020-04-29T09:29:03.817" Score="1" Body="&lt;h2&gt;Which anagram is the user trying to guess?&lt;/h2&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A list (in any form) of target words&lt;/li&gt;&#xA;&lt;li&gt;A guess word&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;You can take these in any form (eg, an array in which the first element is the guess word).&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the letters of the guess word occur (in any order) in exactly one of the target words, output that target word.&lt;/li&gt;&#xA;&lt;li&gt;Otherwise do something other than output letters. (Outputting nothing, or a number is fine. Throwing an error is fine. Infinite looping is not fine. :))&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Assumptions&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The members of the list, and the guess word, are each strings of 1-15 lowercase letters.&lt;/li&gt;&#xA;&lt;li&gt;Members of the list might be anagrams of each other. (In this case, no guess word will ever succeed.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;list: fish, dog, cat, horse, porcupine:&lt;/li&gt;&#xA;&lt;li&gt;guess: re -&gt; (fail)&lt;/li&gt;&#xA;&lt;li&gt;guess: so -&gt; horse&lt;/li&gt;&#xA;&lt;li&gt;guess: god -&gt; dog&lt;/li&gt;&#xA;&lt;li&gt;guess: kitten -&gt; (fail)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Scoring and rules.&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Code golf. Standard rules, no standard loopholes etc.&lt;/p&gt;&#xA;" OwnerUserId="30512" LastEditorUserId="30512" LastEditDate="2020-04-29T23:37:25.540" LastActivityDate="2020-04-29T23:37:25.540" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18887" PostTypeId="2" ParentId="18821" CreationDate="2020-04-29T11:06:52.293" Score="0" Body="&lt;h2&gt;Definitely Yes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;If executing a system command allows you to make your code shorter, than go ahead and do it: who has the right stop you from making your code shorter using a clever trick nobody has ever used before?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Executing shell commands is not necessarily &quot;less interesting&quot;, because if the executed command is interesting, your answer becomes interesting as well.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's quite hard to define the threshold for a loophole for this, since all languages internally perform method calls to machine code. Since machine code calls aren't banned, it would be pointless to also have shell script calls banned.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-04-29T23:05:32.030" LastActivityDate="2020-04-29T23:05:32.030" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18889" PostTypeId="2" ParentId="2140" CreationDate="2020-04-29T18:59:45.450" Score="0" Body="&lt;h1&gt;Fetch me some data &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This is the fifth post for the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/18874/75323&quot;&gt;second RGS's Golfing Showdown&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Write some code to fetch the &lt;em&gt;updated&lt;/em&gt; total number of confirmed infected cases in a territory. The territory you choose to fetch data for will influence your score, so keep that in mind.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your code takes no input.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You should output an integer or any other sensible representation of it.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Fetching the data&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The data you fetch must be fetched from a URI that must have been online at least since the 25th of April of 2020. You may fetch the most recent data or the data for a specific date, as long as in that date, your territory has a non-zero number of total confirmed cases.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring and Territory&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The territory you fetch data for must be a territory listed in the &lt;a href=&quot;https://www.who.int/emergencies/diseases/novel-coronavirus-2019/situation-reports/&quot; rel=&quot;nofollow noreferrer&quot;&gt;WHO daily situation reports&lt;/a&gt; and the numbers you fetch for a given date must be within 10% of the WHO numbers for the same date.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your score will be the number of bytes &lt;em&gt;minus&lt;/em&gt; the length of the longest common substring between your code and the territory you pick, case insensitive.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;E.g. If my program is &lt;code&gt;abcdefghijklmno&lt;/code&gt; and my territory is &lt;code&gt;Italy&lt;/code&gt; I get to shave 2 bytes of my score because of the common substring &lt;code&gt;il&lt;/code&gt; (or &lt;code&gt;al&lt;/code&gt;).&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Are the rules clear enough and well-specified enough?&lt;/p&gt;&#xA;" OwnerUserId="75323" LastActivityDate="2020-04-29T18:59:45.450" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18890" PostTypeId="2" ParentId="2140" CreationDate="2020-04-29T21:13:58.643" Score="3" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/204457/implement-the-zundoko-kiyoshi-function&quot;&gt;Posted.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="91030" LastEditorUserId="91030" LastEditDate="2020-05-08T02:03:45.987" LastActivityDate="2020-05-08T02:03:45.987" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18892" PostTypeId="2" ParentId="2140" CreationDate="2020-04-30T07:36:49.557" Score="0" Body="&lt;p&gt;Comment: might be too similar to previous &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2582/golf-a-mutual-quine&quot;&gt;mutual quine&lt;/a&gt; challenge?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Collaboration/quasi-quine challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a valid submission (A) which prints the code for another competitor's valid submission (B). The languages used in A and B must be different.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Clarifying rules&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;If B prints the code for a third submission, C, it is not required that A and C be different languages. Similarly, the authors of A and B must be different, but A and C need not be. (More different languages/authors score higher, however.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The shortest chain is for A to print B and B to print A. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that if A prints B, and B prints C, but C is not valid for some reason, then neither A nor B are valid either.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It is acknowledged that the validity of your submission may change over time, due to factors beyond your control. Try not to let this worry you too much. :)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;None&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Just the code described above. Nothing extraneous.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Scoring is (A + L) * 100 + C where:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A is the number of distinct authors that directly or indirect print your solution. So if you are Q, and Z=&gt;X=&gt;Q=&gt;X, your &quot;A&quot; is 2. (Each submission only has one author, the &quot;answerer&quot;.)&lt;/li&gt;&#xA;&lt;li&gt;L is the number of distinct languages in your quine circle, along the same lines as for authors. (Each submission only has one language. &quot;Distinct&quot; means really different, not just different versions or implementations of the same languages.)&lt;/li&gt;&#xA;&lt;li&gt;C is the length of your solution in bytes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;(So, for a given circle of quines, all the submissions will have similar scores, with the length of the submission as tie-break.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard loopholes are forbidden.&lt;/p&gt;&#xA;" OwnerUserId="30512" LastEditorUserId="30512" LastEditDate="2020-05-25T09:49:38.657" LastActivityDate="2020-05-25T09:49:38.657" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18893" PostTypeId="2" ParentId="2140" CreationDate="2020-04-30T17:43:48.910" Score="2" Body="&lt;h2&gt;Integers in cosine&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/204610/integers-in-cosine&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="55605" LastEditorUserId="55605" LastEditDate="2020-05-11T13:53:40.737" LastActivityDate="2020-05-11T13:53:40.737" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="18894" PostTypeId="2" ParentId="2140" CreationDate="2020-04-30T19:01:13.227" Score="-1" Body="&lt;h1&gt;A malbolge interpreter&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The challenge today is to write a Malbolge interpreter.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Malbolge&#xA;'98, Ben Olmstead&#xA;&#xA;I hereby relenquish any and all copyright on this language,&#xA;documentation, and interpreter; Malbolge is officially public domain.&#xA;&#xA;------------------------------------------------------------------------&#xA;&#xA;                                Malbolge&#xA;                           '98, Ben Olmstead&#xA;&#xA;Introduction&#xA;^^^^^^^^^^^^&#xA;&#xA;It was noticed that, in the field of esoteric programming languages,&#xA;there was a particular and surprising void: no programming language&#xA;known to the author was specifically designed to be difficult to program&#xA;in.&#xA;&#xA;Certainly, there were languages which were difficult to write in, and&#xA;far more were difficult to read (see: Befunge, False, TWDL, RUBE...).&#xA;But even INTERCAL and BrainF***, the two kings of mental torment, were&#xA;designed with other goals: INTERCAL to have nothing in common with any&#xA;major programming language, and BrainF*** to be a very tiny, yet still&#xA;Turing-complete, language.&#xA;&#xA;INTERCAL's constructs are certainly tortuous, but they are all too&#xA;flexible; you can, for instance, quite easily assign any number to a&#xA;variable with a single statement.&#xA;&#xA;BrainF*** is lacking the flexibility which is INTERCAL's major weakness,&#xA;but it fails in that its constructs are far, far too intuitive.&#xA;Certainly, there are only 8 instructions, none of which take any&#xA;arguments--but it is quite easy to determine how to use those&#xA;instructions.  Subtract 8 from the current number?  With a simple&#xA;'--------' you are done!  This kind of simple answer was unacceptable to&#xA;the author.&#xA;&#xA;Hence the author created Malbolge.  It borrows from machine, BrainF***,&#xA;and tri-INTERCAL, but put together in a unique way.  It was designed to&#xA;be difficult to use, and so it is.  It is designed to be&#xA;incomprehensible, and so it is.&#xA;&#xA;So far, no Malbolge programs have been written.  Thus, we cannot give an&#xA;example.&#xA;&#xA;&quot;Malbolge&quot; is the name of Dante's Eighth Circle of Hell, in which&#xA;practitioners of deception (seducers, flatterers, simonists, thieves,&#xA;hypocrites, and so on) spend eternity.&#xA;&#xA;&#xA;Environment&#xA;^^^^^^^^^^^&#xA;&#xA;In many languages, the environment is easy to understand.  In Malbolge,&#xA;it is best to understand the runtime environment before you ever see a&#xA;command.&#xA;&#xA;The environment is, roughly, that of a primitive trinary CPU.  Both code&#xA;and data share the same space (the machine's memory segment), and there&#xA;are three registers.  Machine words are ten trits (trinary digits) wide,&#xA;giving a maximum possible value of 59048 (all numbers are unsigned).&#xA;Memory space is exactly 59049 words long.&#xA;&#xA;The three registers are A, C, and D.  A is the accumulator, used for&#xA;data manipulation.  A is implicitly set to the value written by all&#xA;write operations on memory.  (Standard I/O, a distinctly non-chip-level&#xA;feature, is done directly with the A register.)&#xA;&#xA;C is the code pointer.  It is automatically incremented after each&#xA;instruction, and points the instruction being executed.&#xA;&#xA;D is the data pointer.  It, too, is automatically incremented after each&#xA;instruction, but the location it points to is used for the data&#xA;manipulation commands.&#xA;&#xA;All registers begin with the value 0.&#xA;&#xA;When the interpreter loads the program, it ignores all whitespace.  If&#xA;it encounters anything that is not one of an instruction and is not&#xA;whitespace, it will give an error, otherwise it loads the file, one non-&#xA;whitespace character per cell, into memory.  Cells which are not&#xA;initialized are set by performing op on the previous two cells&#xA;repetitively.&#xA;&#xA;&#xA;Commands&#xA;^^^^^^^^&#xA;&#xA;When the interpreter tries to execute a program, it first checks to&#xA;see if the current instruction is a graphical ASCII character (33&#xA;through 126).  If it is, it subtracts 33 from it, adds C to it, mods it&#xA;by 94, then uses the result as an index into the following table of 94&#xA;characters:&#xA;&#xA;            +b(29e*j1VMEKLyC})8&amp;amp;m#~W&amp;gt;qxdRp0wkrUo[D7,XTcA&quot;lI&#xA;            .v%{gJh4G\-=O@5`_3i&amp;lt;?Z';FNQuY]szf$!BS/|t:Pn6^Ha&#xA;&#xA;It then checks it against the characters listed below, and performs an&#xA;appropriate action.&#xA;&#xA;If the result is not one of the characters listed below, it is treated&#xA;as a nop.  If the original character is not graphic ASCII, the program&#xA;is immediately ended.&#xA;&#xA;When the interpreter parses the input file, it checks each non-&#xA;whitespace character with the process above.  If any result is not one&#xA;of the eight characters below, the file will be rejected.&#xA;&#xA;After the instruction is executed, 33 is subtracted from the instruction&#xA;at C, and the result is used as an index in the table below.  The new&#xA;character is then placed at C, and then C is incremented.&#xA;&#xA;            5z]&amp;amp;gqtyfr$(we4{WP)H-Zn,[%\3dL+Q;&amp;gt;U!pJS72FhOA1C&#xA;            B6v^=I_0/8|jsb9m&amp;lt;.TVac`uY*MK'X~xDl}REokN:#?G&quot;i@&#xA;&#xA;j&#xA;  sets the data pointer to the value in the cell pointed to by the&#xA;  current data pointer.&#xA;&#xA;i&#xA;  sets the code pointer to the value in the cell pointed to be the&#xA;  current data pointer.&#xA;&#xA;*&#xA;  rotates the trinary value of the cell pointed to by D to the right 1.&#xA;  The least significant trit becomes the most significant trit, and all&#xA;  others move one position to the left.&#xA;&#xA;p&#xA;  performs a tritwise &quot;op&quot; on the value pointed to by D with the&#xA;  contents of A.  The op (don't look for pattern, it's not there) is:&#xA;&#xA;            | A trit:&#xA;    ________|_0__1__2_&#xA;          0 | 1  0  0&#xA;      *D  1 | 1  0  2&#xA;     trit 2 | 2  2  1&#xA;&#xA;&#xA;&#xA;Di-trits:&#xA;    00 01 02 10 11 12 20 21 22&#xA;&#xA;00  04 03 03 01 00 00 01 00 00&#xA;01  04 03 05 01 00 02 01 00 02&#xA;02  05 05 04 02 02 01 02 02 01&#xA;10  04 03 03 01 00 00 07 06 06&#xA;11  04 03 05 01 00 02 07 06 08&#xA;12  05 05 04 02 02 01 08 08 07&#xA;20  07 06 06 07 06 06 04 03 03&#xA;21  07 06 08 07 06 08 04 03 05&#xA;22  08 08 07 08 08 07 05 05 04&#xA;&#xA;&amp;lt;&#xA;  reads an ASCII value from the stdin and converts it to Trinary, then&#xA;  stores it in A.  10 (line feed) is considered 'newline', and&#xA;  2222222222t (59048 dec.) is EOF.&#xA;&#xA;/&#xA;  converts the value in A to ASCII and writes it to stdout.  Writing&#xA;  10 is a newline.&#xA;&#xA;v&#xA;  indicates a full stop for the machine.&#xA;&#xA;o&#xA;  does nothing, except increment C and D, as all other instructions do.&#xA;&#xA;&#xA;Turing-Completeness&#xA;^^^^^^^^^^^^^^^^^^^&#xA;&#xA;Though I have not proven it, I _think_ Malbolge to be Turing-complete.&#xA;To be Turing-complete, there must be some data construct which can be&#xA;used to do any mathematical calculation.  I believe that using *p in&#xA;various clever ways on the tritwords can fulfill this requirement.&#xA;&#xA;Turing-completeness also requires three code constructs: sequential&#xA;execution (which Malbolge obviously has), repetition (provided by the&#xA;i and, indirectly, j instructions), and conditional-execution (provided,&#xA;I believe, by self-modifying code and altering i destinations).&#xA;&#xA;I do have my doubts, particularly about data constructs, but I *think*&#xA;this works...&#xA;&#xA;&#xA;Appendix: Trinary Conversion Table&#xA;^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^&#xA;&#xA;Trinary to ASCII to decimal to hex table, provided, strangely enough,&#xA;for the convenience of Malbolge programmers.&#xA;&#xA;00000 NUL 000 00    01012   032 20    02101 @ 064 40    10120 ` 096 60&#xA;00001 SOH 001 01    01020 ! 033 21    02102 A 065 41    10121 a 097 61&#xA;00002 STX 002 02    01021 &quot; 034 22    02110 B 066 42    10122 b 098 62&#xA;00010 ETX 003 03    01022 # 035 23    02111 C 067 43    10200 c 099 63&#xA;00011 EOT 004 04    01100 $ 036 24    02112 D 068 44    10201 d 100 64&#xA;00012 ENQ 005 05    01101 % 037 25    02120 E 069 45    10202 e 101 65&#xA;00020 ACK 006 06    01102 &amp;amp; 038 26    02121 F 070 46    10210 f 102 66&#xA;00021 BEL 007 07    01110 ' 039 27    02122 G 071 47    10211 g 103 67&#xA;00022 BS  008 08    01111 ( 040 28    02200 H 072 48    10212 h 104 68&#xA;00100 HT  009 09    01112 ) 041 29    02201 I 073 49    10220 i 105 69&#xA;00101 LF  010 0a    01120 * 042 2a    02202 J 074 4a    10221 j 106 6a&#xA;00102 VT  011 0b    01121 + 043 2b    02210 K 075 4b    10222 k 107 6b&#xA;00110 FF  012 0c    01122 , 044 2c    02211 L 076 4c    11000 l 108 6c&#xA;00111 CR  013 0d    01200 - 045 2d    02212 M 077 4d    11001 m 109 6d&#xA;00112 SO  014 0e    01201 . 046 2e    02220 N 078 4e    11002 n 110 6e&#xA;00120 SI  015 0f    01202 / 047 2f    02221 O 079 4f    11010 o 111 6f&#xA;00121 DLE 016 10    01210 0 048 30    02222 P 080 50    11011 p 112 70&#xA;00122 DC1 017 11    01211 1 049 31    10000 Q 081 51    11012 q 113 71&#xA;00200 DC2 018 12    01212 2 050 32    10001 R 082 52    11020 r 114 72&#xA;00201 DC3 019 13    01220 3 051 33    10002 S 083 53    11021 s 115 73&#xA;00202 DC4 020 14    01221 4 052 34    10010 T 084 54    11022 t 116 74&#xA;00210 NAK 021 15    01222 5 053 35    10011 U 085 55    11100 u 117 75&#xA;00211 SYN 022 16    02000 6 054 36    10012 V 086 56    11101 v 118 76&#xA;00212 ETB 023 17    02001 7 055 37    10020 W 087 57    11102 w 119 77&#xA;00220 CAN 024 18    02002 8 056 38    10021 X 088 58    11110 x 120 78&#xA;00221 EM  025 19    02010 9 057 39    10022 Y 089 59    11111 y 121 79&#xA;00222 SUB 026 1a    02011 : 058 3a    10100 Z 090 5a    11112 z 122 7a&#xA;01000 ESC 027 1b    02012 ; 059 3b    10101 [ 091 5b    11120 { 123 7b&#xA;01001 FS  028 1c    02020 &amp;lt; 060 3c    10102 \ 092 5c    11121 | 124 7c&#xA;01002 GS  029 1d    02021 = 061 3d    10110 ] 093 5d    11122 } 125 7d&#xA;01010 RS  030 1e    02022 &amp;gt; 062 3e    10111 ^ 094 5e    11200 ~ 126 7e&#xA;01011 US  031 1f    02100 ? 063 3f    10112 _ 095 5f&#xA;&#xA;11202 128 80    12221 160 a0    21010 192 c0    22022 224 e0&#xA;11210 129 81    12222 161 a1    21011 193 c1    22100 225 e1&#xA;11211 130 82    20000 162 a2    21012 194 c2    22101 226 e2&#xA;11212 131 83    20001 163 a3    21020 195 c3    22102 227 e3&#xA;11220 132 84    20002 164 a4    21021 196 c4    22110 228 e4&#xA;11221 133 85    20010 165 a5    21022 197 c5    22111 229 e5&#xA;11222 134 86    20011 166 a6    21100 198 c6    22112 230 e6&#xA;12000 135 87    20012 167 a7    21101 199 c7    22120 231 e7&#xA;12001 136 88    20020 168 a8    21102 200 c8    22121 232 e8&#xA;12002 137 89    20021 169 a9    21110 201 c9    22122 233 e9&#xA;12010 138 8a    20022 170 aa    21111 202 ca    22200 234 ea&#xA;12011 139 8b    20100 171 ab    21112 203 cb    22201 235 eb&#xA;12012 140 8c    20101 172 ac    21120 204 cc    22202 236 ec&#xA;12020 141 8d    20102 173 ad    21121 205 cd    22210 237 ed&#xA;12021 142 8e    20110 174 ae    21122 206 ce    22211 238 ee&#xA;12022 143 8f    20111 175 af    21200 207 cf    22212 239 ef&#xA;12100 144 90    20112 176 b0    21201 208 d0    22220 240 f0&#xA;12101 145 91    20120 177 b1    21202 209 d1    22221 241 f1&#xA;12102 146 92    20121 178 b2    21210 210 d2    22222 242 f2&#xA;12110 147 93    20122 179 b3    21211 211 d3&#xA;12111 148 94    20200 180 b4    21212 212 d4&#xA;12112 149 95    20201 181 b5    21220 213 d5&#xA;12120 150 96    20202 182 b6    21221 214 d6&#xA;12121 151 97    20210 183 b7    21222 215 d7&#xA;12122 152 98    20211 184 b8    22000 216 d8&#xA;12200 153 99    20212 185 b9    22001 217 d9&#xA;12201 154 9a    20220 186 ba    22002 218 da&#xA;12202 155 9b    20221 187 bb    22010 219 db&#xA;12210 156 9c    20222 188 bc    22011 220 dc&#xA;12211 157 9d    21000 189 bd    22012 221 dd&#xA;12212 158 9e    21001 190 be    22020 222 de&#xA;12220 159 9f    21002 191 bf    22021 223 df&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Note that the original specification has one quirk: after encountering an illegal instruction, the interpreter hangs. You may choose which behaviour do you want to implement (hang or exit).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;I/O rules&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The program or function &lt;em&gt;has&lt;/em&gt; to take input in any reasonable way (for the program), and somehow supply the input and output features to the malbolge program (either by return value / parameter, tty or a file).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox stuff&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;note: I'm a bit unsure about the scoring criterion: would popularity-contest be good? I'm mostly looking for creative answers&lt;/p&gt;&#xA;" OwnerUserId="61379" LastActivityDate="2020-04-30T19:01:13.227" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18898" PostTypeId="2" ParentId="2140" CreationDate="2020-05-01T05:44:24.663" Score="1" Body="&lt;h3&gt;Premise&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;I've crafted this zero-player game in an attempt to create a problem simple to explain but that would require an intricate implementation.&lt;br&gt;&#xA;Sadly in the making of it, I realized that annoying conditions are required for safety (avoid to get stuck in loops) and non-ambiguity.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Ask me justifications for any rule that seems too arbitrary. Unfortunately it turned out to be 50% design and 50% precautions.&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Turning Tiles game&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The field of this game is a &lt;a href=&quot;https://www.google.com/search?q=toroidal+grid&amp;amp;sxsrf=ALeKk00zPr0KXqKlqJnTbEU7iskw6hvZ8Q:1588277096042&amp;amp;source=lnms&amp;amp;tbm=isch&amp;amp;sa=X&amp;amp;ved=2ahUKEwis5vSg-ZDpAhWCDOwKHWwhAi8Q_AUoAXoECAsQAw&amp;amp;biw=1920&amp;amp;bih=979#imgrc=DNpOW7cXm2Nv9M&quot; rel=&quot;nofollow noreferrer&quot;&gt;square toroidal grid&lt;/a&gt; (like that of Snake or Pacman) populated by &lt;code&gt;dots&lt;/code&gt;. Each grid unit is one of the following:  &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;tile&lt;/code&gt; (there are &lt;span class=&quot;math-container&quot;&gt;\$4\$&lt;/span&gt; type of tile, indicating directions e.g.: &lt;code&gt;^&lt;/code&gt; &lt;code&gt;&amp;gt;&lt;/code&gt; &lt;code&gt;v&lt;/code&gt; &lt;code&gt;&amp;lt;&lt;/code&gt; or &lt;code&gt;1&lt;/code&gt; &lt;code&gt;2&lt;/code&gt; &lt;code&gt;3&lt;/code&gt; &lt;code&gt;4&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;wormhole&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The dot behaviour is very simple: it moves following the direction indicated by the tiles it walks on, and to wreak havoc after each step it rotates the left tile &lt;em&gt;in a copycat fashion&lt;/em&gt;.&lt;br&gt;&#xA;When two dots collide they will remain together forever and can be considered as one.&lt;br&gt;&#xA;So the dots will either converge into one (wormholes facilitate this scenario) or remain stuck in a loop.  &lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Detailed explanation:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;One iteration of the game consists of three phases:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Move (&lt;strong&gt;M&lt;/strong&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Peek (&lt;strong&gt;P&lt;/strong&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Edit (&lt;strong&gt;E&lt;/strong&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Phases are performed individually by each dot: next phase will begin only when every dot completed current phase.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At the beginning of iteration &lt;strong&gt;i&lt;/strong&gt; there are &lt;strong&gt;n&lt;sub&gt;i&lt;/sub&gt;&lt;/strong&gt; distinct dots.&lt;br&gt;&#xA;(when n&gt;0) if &lt;strong&gt;n&lt;sub&gt;i&lt;/sub&gt; &amp;lt; n&lt;sub&gt;i-1&lt;/sub&gt;&lt;/strong&gt; then iteration &lt;strong&gt;i&lt;/strong&gt; is a &lt;code&gt;downgraded iteration&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Let &lt;code&gt;x&lt;/code&gt; be a dot.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;&lt;em&gt;def&lt;/em&gt; &lt;code&gt;tunnelling?&lt;/code&gt;:&lt;br&gt;&#xA;  - If x is on a &lt;code&gt;tile&lt;/code&gt; do nothing.&lt;br&gt;&#xA;  - If x is on a &lt;code&gt;wormhole&lt;/code&gt; it will immediately exit from the &lt;em&gt;linked wormhole&lt;/em&gt; keeping the direction and &lt;code&gt;tunnelling?&lt;/code&gt; is called.&lt;/p&gt;&#xA;  &#xA;  &lt;p&gt;&lt;em&gt;def&lt;/em&gt; &lt;code&gt;handle_overwrite_error&lt;/code&gt;:&lt;br&gt;&#xA;  - If multiple overwrite errors occurred in current iteration, x won't overwrite its starting tile.&lt;br&gt;&#xA;  - Else a &lt;code&gt;wormhole&lt;/code&gt; will open in place of x's starting tile.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&lt;strong&gt;begin iteration&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;M:&lt;/strong&gt;&lt;br&gt;&#xA;The tile x is on becomes its &lt;code&gt;starting tile&lt;/code&gt;.&lt;br&gt;&#xA;x moves one unit in the direction indicated by its &lt;code&gt;starting tile&lt;/code&gt; and &lt;code&gt;tunnelling?&lt;/code&gt; is called.&lt;br&gt;&#xA;The tile x is on becomes its &lt;code&gt;landing tile&lt;/code&gt;.&lt;br&gt;&#xA;&lt;strong&gt;___&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;P:&lt;/strong&gt;&lt;br&gt;&#xA;x peeks at the &lt;code&gt;landing tile&lt;/code&gt; of its &lt;em&gt;closest&lt;/em&gt; dot(s) and plans its editing.&lt;br&gt;&#xA;If the overwiting direction can't be uniquely determined &lt;em&gt;(*)&lt;/em&gt; an &lt;code&gt;overwrite error&lt;/code&gt; will rise for x.&lt;br&gt;&#xA;&lt;strong&gt;___&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;E:&lt;/strong&gt;&lt;br&gt;&#xA;If x raised an &lt;code&gt;overwrite error&lt;/code&gt;, &lt;code&gt;handle_overwrite_error&lt;/code&gt; is now called.&lt;br&gt;&#xA;Else x overwrites its &lt;code&gt;starting tile&lt;/code&gt; with the direction decided in &lt;strong&gt;P&lt;/strong&gt;.&lt;br&gt;&#xA;&lt;strong&gt;___&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If a wormhole appeared under someone's feet, that dot disappear (exiting direction couldn't be decided).&lt;br&gt;&#xA;(This rule guaratees that &lt;code&gt;tunnelling?&lt;/code&gt; will always terminate.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&lt;strong&gt;end iteration&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Wormholes chain:&lt;/strong&gt; since one single wormhole is allowed to open in each iteration, wormholes inherit their linkage order by the chronological order they popped-up. Last wormhole close the chain.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Metric:&lt;/strong&gt; unsurprisingly &lt;a href=&quot;https://en.wikipedia.org/wiki/Taxicab_geometry&quot; rel=&quot;nofollow noreferrer&quot;&gt;taxicab metric&lt;/a&gt; applyied on a toroidal grid...&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;But here can enter the picture a devilish modification. What if the wormholes play a role in the metric? So that let's say x and y are 2 unit apart, with a wormhole in between they would be 4 unit apart instead. Also to find the closest dot would be totally trickier, cause the paths through any nearby wormhole have to be tried.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;(*)&lt;/em&gt;: For the overwriting direction not to be decidible the presence of multiple dots sharing the propriety &lt;em&gt;&quot;x doesn't have any dot closer than me&quot;&lt;/em&gt; is necessary but not sufficient. Also their landing tiles have not to be the same.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;What can be asked? (feedback)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Is this an interesting game?  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Probably I've exaggerated it in the explanation but I cared to be as clear as possible and many requirements are conceivable to make it work.&lt;br&gt;&#xA;Of course if that's too much I'd give up wormhole...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rules in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/3434/shortest-game-of-life&quot;&gt;Shortest Game of Life&lt;/a&gt; inspires me&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Of course the &lt;strong&gt;input&lt;/strong&gt; would be the starting configuration, should wormholes be prohibited in input?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If simulation is not visually shown there would be an &lt;code&gt;ITERATION_CAP&lt;/code&gt;&lt;br&gt;&#xA;Fixed or passed in input as well?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Regarding &lt;strong&gt;output&lt;/strong&gt;, the quirk of this game are the downgraded iterations. I thought that the sequence (or sum) of their indices can be returned along with last number of distinct dots...&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This will be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, so the shortest code wins.&lt;br&gt;&#xA;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Default loopholes&lt;/a&gt; are forbidden.&lt;/p&gt;&#xA;" OwnerUserId="94346" LastActivityDate="2020-05-01T05:44:24.663" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18899" PostTypeId="1" CreationDate="2020-05-01T23:07:09.760" Score="0" ViewCount="71" Body="&lt;p&gt;I recently had one of the senior developers on my team code up a simple REST API server and client, using SSL, basic authentication, and .NET Core.  I was a little shocked to see how much code it took just to get the basic plumbing working, and I immediately started to wonder about which languages and frameworks might have been more suited to the task.  My code-golf question would look something like:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Write a client and server that communicate using REST over SSL.  They&#xA;  can be in 2 languages if you want (although maybe that turns this into&#xA;  2 golfing competitions?). The REST service takes 2 integers between 0 and 100 and returns&#xA;  the sum of these integers, and is only available to user &quot;foo&quot; with&#xA;  password &quot;bar&quot;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;Thanks in advance for your thoughts (or for a link to a place where this competition has already happened). I do realize this has smells of &quot;which library is best for xyz?&quot; and that it may just not work at all in this forum, but the problem does still feel golfable to me.&lt;/p&gt;&#xA;" OwnerUserId="94832" LastActivityDate="2020-05-01T23:07:09.760" Title="Is this REST API question way too practical for the site?" Tags="|discussion|" AnswerCount="0" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18900" PostTypeId="2" ParentId="2140" CreationDate="2020-05-01T23:40:47.213" Score="0" Body="&lt;p&gt;This is my first question, so I don't know what &lt;em&gt;exactly&lt;/em&gt; I should ask, but I will try. Please advise.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h1&gt;Russian roulette&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;It's &lt;a href=&quot;https://en.wikipedia.org/wiki/Russian_roulette&quot; rel=&quot;nofollow noreferrer&quot;&gt;Russian roulette&lt;/a&gt;! The rules are simple. Shoot a revolver with &lt;code&gt;n&lt;/code&gt; slots for bullets and one round inside at your head and you &lt;em&gt;might not die&lt;/em&gt;!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task:&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Make a program that takes integer &lt;code&gt;n&lt;/code&gt; (you can assume that 10&amp;lt;=n&amp;lt;=128) as input and outputs nothing.&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;but how do I tell if I'm dead?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;The program generates a random number x in the range 0 - (n) inclusive. If x=n the revolver fires and the program exits with an error (you die). Otherwise the program exits normally.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Standard loopholes forbidden, etc.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/error-message&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;error-message&amp;#39;&quot; rel=&quot;tag&quot;&gt;error-message&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;Sandbox questions:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This question is short. What can I explain better or add?&lt;/li&gt;&#xA;&lt;li&gt;What are good tags to add?&lt;/li&gt;&#xA;&lt;li&gt;Should I make it code-golf or popularity contest? Both?&lt;/li&gt;&#xA;&lt;li&gt;Too easy?&lt;/li&gt;&#xA;&lt;li&gt;This is a joke, will it be misinterpreted?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="90614" LastEditorUserId="90614" LastEditDate="2020-05-04T14:08:48.270" LastActivityDate="2020-05-04T14:08:48.270" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="18907" PostTypeId="2" ParentId="2140" CreationDate="2020-05-04T18:16:48.400" Score="0" Body="&lt;h2&gt;Revisit sum&lt;/h2&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Why is this language specific?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As much as much as I like challenges to be language agnostic if this challenge were language agnostic it would most certainly be a duplicate of the add two numbers challenge due to our current duplicate policy.  And for most languages adding two numbers and adding several numbers are no different.  Revisit is not one of those languages.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;In &lt;a href=&quot;https://gitlab.com/WheatWizard/revisit&quot; rel=&quot;nofollow noreferrer&quot;&gt;Revisit&lt;/a&gt; adding two numbers is easy.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;+@&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;does the trick.  However in this challenge we are going to ask you to do something much more difficult.  Take a an arbitrary number of positive integers as input and output the sum of all them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your answer should be functioning revisit as per revisit version 0.1.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so answers are scored in bytes with fewer bytes being better.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2020-05-04T18:16:48.400" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18908" PostTypeId="2" ParentId="2140" CreationDate="2020-05-05T00:04:05.153" Score="1" Body="&lt;h2&gt;Modular distance &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/counting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;counting&amp;#39;&quot; rel=&quot;tag&quot;&gt;counting&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You are given 3 non-negative integers: the domain &lt;code&gt;d&lt;/code&gt;, the beginning index &lt;code&gt;b&lt;/code&gt;, and the ending index &lt;code&gt;e&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;What is a modular distance?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Assume &lt;code&gt;d=5&lt;/code&gt; here. First, generate a range from &lt;code&gt;0&lt;/code&gt; to &lt;code&gt;5-1&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 1 2 3 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We start from the beginning index. Assuming that is &lt;code&gt;3&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 1 2 3 4&#xA;      ^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We continually go right, circling every number we've passed, until we met the ending index &lt;code&gt;e&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 1 2 O O&#xA;        ^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;If the pointer is at the right end, it wraps around to the left.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Assuming &lt;code&gt;e=0&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;O 1 2 O O&#xA;^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;We filter out every item we've circled:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0 3 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Then, find how many items there are in this list:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Subtract it by 1 and it's our result:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can always assume that &lt;code&gt;b&amp;lt;d&lt;/code&gt; and &lt;code&gt;e&amp;lt;d&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;6 2 5 -&amp;gt; 3&#xA;5 3 0 -&amp;gt; 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-05-05T08:19:30.667" LastActivityDate="2020-05-05T08:19:30.667" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18909" PostTypeId="2" ParentId="2140" CreationDate="2020-05-05T06:01:41.727" Score="0" Body="&lt;h1&gt;Compass and straightedge segment reduction &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;You are given two points at distance 1, a compass and a straightedge. The challenge is, given a positive integer &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;, to find the shortest segment possible to obtain by drawing no more than &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; lines or circles. A segment is defined as a pair of two points such that there is a line connecting them.&lt;/p&gt;&#xA;&lt;p&gt;This is tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer wins!&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox stuff&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Certain details of compass-and-straightedge constructions are not specified yet.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Should I allow assuming normal floating point math to be exact, or to require proper arbitrary precision?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is the answer trivial? I know that you can, for example, obtain geometric progressions with factor that seems to be &lt;span class=&quot;math-container&quot;&gt;\$\tan(x)\$&lt;/span&gt; (and thus perhaps it's optimal to first bisect an angle for a while, then subtract it from a straight angle, and then &lt;a href=&quot;https://math.stackexchange.com/a/1281923/557261&quot;&gt;do this&lt;/a&gt;).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;More importantly, is this possible? I assume it is, because it seems possible to calculate everything necessary for the basic constructions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's (easily) possible to compare lines and circles for equality&lt;/li&gt;&#xA;&lt;li&gt;It's possible to calculate the parameters of a line passing through 2 points.&lt;/li&gt;&#xA;&lt;li&gt;It's possible to calculate the parameters of a circle - that is, find the point and the radius given the point and the radius.&lt;/li&gt;&#xA;&lt;li&gt;It's possible to calculate the point of intersection between 2 lines (if it exists).&lt;/li&gt;&#xA;&lt;li&gt;It's possible to calculate the points of intersection between a line and a circle.&lt;/li&gt;&#xA;&lt;li&gt;It's possible to calculate the points of intersection between 2 circles.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Is that enough for a proof?&lt;/p&gt;&#xA;" OwnerUserId="36445" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-05-05T06:01:41.727" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18910" PostTypeId="2" ParentId="202" CreationDate="2020-05-05T08:38:23.020" Score="4" Body="&lt;h1&gt;Rust&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The &lt;a href=&quot;https://play.rust-lang.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;rust playground&lt;/a&gt; offers a nice editor with syntax highlighting and lets you choose between different compiler versions. You can also use the top 100 most downloaded crates from crates.io (like &lt;code&gt;chrono&lt;/code&gt;, &lt;code&gt;serde&lt;/code&gt; and &lt;code&gt;rand&lt;/code&gt;).&lt;/p&gt;&#xA;" OwnerUserId="46901" LastActivityDate="2020-05-05T08:38:23.020" CommentCount="0" CommunityOwnedDate="2020-05-05T08:38:23.020" ContentLicense="CC BY-SA 4.0" />
  <row Id="18911" PostTypeId="2" ParentId="18637" CreationDate="2020-05-06T01:39:37.960" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/33375/05ab1e-oasis&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/XxHgb.png&quot; alt=&quot;Join our 05AB1E community&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-05-06T01:58:00.920" LastActivityDate="2020-05-06T01:58:00.920" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18913" PostTypeId="2" ParentId="2140" CreationDate="2020-05-06T06:28:21.887" Score="1" Body="&lt;h1&gt;Parse vietnamese infinite decimal notation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I wanted to express infinite decimals in text, but overlines are hard.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You need to take a decimal in vietnamese notation, and output the first 10 or more digits of the normal variant.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;The notation&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The way it works is that you have &lt;code&gt;0.ab(cd)&lt;/code&gt; and it means &lt;code&gt;0.abcdcdcd...&lt;/code&gt;. Of course, you can have any amount of digits in each spot, even zero. You can also omit the infinite part to represent finite decimals.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;It's allowed to not accept &lt;code&gt;0.2&lt;/code&gt; or &lt;code&gt;0.2()&lt;/code&gt; as input, and it's also allowed to output &lt;code&gt;0.2000000000&lt;/code&gt; if you do accept them as input.&lt;/p&gt;&#xA;" OwnerUserId="91569" LastEditorUserId="91569" LastEditDate="2020-05-06T08:27:07.327" LastActivityDate="2020-05-06T08:27:07.327" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18914" PostTypeId="2" ParentId="2140" CreationDate="2020-05-06T07:28:53.220" Score="4" Body="&lt;h1&gt;Posted&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/204551/solve-a-picross-row&quot;&gt;Solve a Picross Row&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="94333" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-05-09T21:06:07.343" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18915" PostTypeId="2" ParentId="18637" CreationDate="2020-05-06T10:28:36.367" Score="11" Body="&lt;p&gt;&lt;a href=&quot;https://www.dyalog.com/student-competition.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/4MaEU.png&quot; alt=&quot;Referral prizes available!&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2021-02-12T15:25:40.643" LastActivityDate="2021-02-12T15:25:40.643" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18918" PostTypeId="2" ParentId="2140" CreationDate="2020-05-07T10:45:22.220" Score="2" Body="&lt;h1&gt;Produce a range&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Your task is to take a list of integers and find inputs to a Python &lt;code&gt;range&lt;/code&gt; call to produce that list. That is, output three values &lt;code&gt;(start, stop, step)&lt;/code&gt; so that &lt;code&gt;range(start, stop, step)&lt;/code&gt; equals the given list.&lt;/p&gt;&#xA;&lt;p&gt;You can assume that this is possible, which means that consecutive numbers in the list all have the same nonzero difference. Be careful that your code works for negative step sizes, as well as for empty or singleton inputs.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;How &lt;code&gt;range&lt;/code&gt; works&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Python's built-in &lt;a href=&quot;https://docs.python.org/2/library/functions.html?highlight=range#range&quot; rel=&quot;nofollow noreferrer&quot;&gt;range&lt;/a&gt; produces a list* of equally-spaced numbers. Called as &lt;code&gt;range(start, stop, step)&lt;/code&gt;, it counts from the &lt;code&gt;start&lt;/code&gt; value in increments of &lt;code&gt;step&lt;/code&gt; like&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;[start, start + step, start + 2 * step, ...]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This list continues as long as the value is below &lt;code&gt;stop&lt;/code&gt; given positive &lt;code&gt;step&lt;/code&gt;, or above &lt;code&gt;stop&lt;/code&gt; given negative &lt;code&gt;step&lt;/code&gt;. If the &lt;code&gt;start&lt;/code&gt; value already fails this test, an empty list is produced. Note that the &lt;code&gt;stop&lt;/code&gt; value itself is never included in the list, giving a half-open interval.&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;range(0, 5, 1)   = [0, 1, 2, 3, 4]&#xA;range(0, -5, -1) = [0, -1, -2, -3, -4]&#xA;range(0, 2, -1)  = []&#xA;range(0, -2, 1)  = []&#xA;range(3, 4, 10)  = [3, 7]&#xA;range(3, 4, 11)  = [3, 7]&#xA;range(3, 4, 12)  = [3, 7, 11]&#xA;range(1, -2, 0)  = [1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;*In Python 3, it actually makes a &lt;code&gt;range&lt;/code&gt; object, but we'll ignore that distinction.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test cases&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Note that there can be multiple valid inputs. Different &lt;code&gt;stop&lt;/code&gt; values can cut off the result at the same point when the step is not &lt;code&gt;±1&lt;/code&gt;. A singleton or empty list can be produced in many ways.&lt;/p&gt;&#xA;&lt;p&gt;TODO&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2021-05-06T21:51:29.960" LastActivityDate="2021-05-06T21:51:29.960" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18919" PostTypeId="2" ParentId="2140" CreationDate="2020-05-07T16:12:56.170" Score="-2" Body="&lt;h1&gt;Make an Anti-compressor (WIP)&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Create an algorithm that reversibly and losslessly makes files bigger. You must create the anti-compressor. The de-anti-compressor can be your own creation or something that already exists. The two programs do not need to be written in the same language.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Objective Validity Criteria&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Inputs into the anti-compressor can be binary files using any or all byte values.&lt;/li&gt;&#xA;&lt;li&gt;All inputs into your anti-compressor must produce outputs that are at least one byte longer.&lt;/li&gt;&#xA;&lt;li&gt;The anti-compressor is losslessly reversible by either an existing program or your own.&lt;/li&gt;&#xA;&lt;li&gt;The de-anti-compressor must work on (at least) all possible outputs of the anti-compressor.&lt;/li&gt;&#xA;&lt;li&gt;Both the anti-compressor and de-anti-compressor can be executed on an actual computer. Keep execution time within reason (e.g. no &lt;span class=&quot;math-container&quot;&gt;\$O(n!)\$&lt;/span&gt; programs, please)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;This will be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; unless I get a good suggestion for an objective scoring system.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;My only idea so far is that the score could be based on the decompression ratio,  cancelled out by how well gzip compresses the output. Unfortunately, this could be abused easily by inserting arbitrarily large amounts of random padding between significant bits of information, leading to an unbounded score that can always be beaten with trivial modification.&lt;/p&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2020-05-11T17:37:55.247" LastActivityDate="2020-05-11T17:37:55.247" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18921" PostTypeId="2" ParentId="202" CreationDate="2020-05-08T06:19:31.623" Score="1" Body="&lt;h2&gt;&lt;a href=&quot;http://wren.io/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wren&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;There is an online interpreter for Wren called &lt;a href=&quot;http://ppvk.github.io/wren-nest/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&quot;the Wren Nest&quot;&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastActivityDate="2020-05-08T06:19:31.623" CommentCount="0" CommunityOwnedDate="2020-05-08T06:19:31.623" ContentLicense="CC BY-SA 4.0" />
  <row Id="18922" PostTypeId="2" ParentId="2140" CreationDate="2020-05-08T16:05:16.060" Score="0" Body="&lt;h1&gt;Continue an arithmetic-geometric progression &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;sup&gt;note: not related to &lt;a href=&quot;https://en.wikipedia.org/wiki/Arithmetico%E2%80%93geometric_sequence&quot; rel=&quot;nofollow noreferrer&quot;&gt;these&lt;/a&gt; arithmetic-geometric &lt;em&gt;sequences&lt;/em&gt;&lt;/sup&gt;&lt;br /&gt;&#xA;An arithmetic progression has the property that &lt;span class=&quot;math-container&quot;&gt;\$a_n = \frac{a_{n-1} + a_{n+1}}2\$&lt;/span&gt; - that is, every term is the &lt;em&gt;arithmetic&lt;/em&gt; mean of its neighbours.&lt;br /&gt;&#xA;A geometric progression has a similar property: &lt;span class=&quot;math-container&quot;&gt;\$a_n = \root\of{a_{n-1}\cdot a_{n+1}}\$&lt;/span&gt; - every term is the &lt;em&gt;geometric&lt;/em&gt; mean of its neighbours.&lt;/p&gt;&#xA;&lt;p&gt;There's also the &lt;a href=&quot;https://en.wikipedia.org/wiki/Arithmetic%E2%80%93geometric_mean&quot; rel=&quot;nofollow noreferrer&quot;&gt;arithmetic-geometric mean&lt;/a&gt; &lt;span class=&quot;math-container&quot;&gt;\$AGM(x, y)\$&lt;/span&gt;! It's defined as follows: define two sequences as &lt;span class=&quot;math-container&quot;&gt;\$a_0 = x, g_0 = y, a_{n+1} = \frac{a_n+g_n}2, g_{n+1}=\root\of{a_n g_n}\$&lt;/span&gt;. The sequences converge to the same number, the arithmetic-geometric mean of &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Now I can define another progression: an arithmetic-geometric progression has the property that &lt;span class=&quot;math-container&quot;&gt;\$a_n = AGM(a_{n-1}, a_{n+1})\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;As input you are given two real numbers - the first two terms of an arithmetic-geometric progression. The challenge is to find the third one with absolute or relative error not exceeding &lt;span class=&quot;math-container&quot;&gt;\$10^{-5}\$&lt;/span&gt; (and output it).&lt;/p&gt;&#xA;&lt;p&gt;This is tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer wins!&lt;/p&gt;&#xA;" OwnerUserId="36445" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-05-08T16:05:16.060" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18923" PostTypeId="2" ParentId="2140" CreationDate="2020-05-08T16:59:52.843" Score="1" Body="&lt;h1&gt;Arithmetic Square &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;Note: Credit goes to &lt;a href=&quot;https://www.cemc.uwaterloo.ca/contests/computing/2019/stage%201/seniorEF.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;CCC 2019 S3&lt;/a&gt; for the problem&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You are given a &lt;span class=&quot;math-container&quot;&gt;\$ 3 \times 3 \$&lt;/span&gt; grid which contains integers. Some of the &lt;span class=&quot;math-container&quot;&gt;\$ 9 \$&lt;/span&gt; elements in the grid already have a value, and some of them remain &lt;em&gt;unknown&lt;/em&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to fill in values for the &lt;em&gt;unknown&lt;/em&gt; elements such that for each row, when read left-to-right, produces an arithmetic sequence, and that for each column, when read top-to-bottom, is also an arithmetic sequence.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Recall that an arithmetic sequence of length &lt;span class=&quot;math-container&quot;&gt;\$ 3 \$&lt;/span&gt; is a sequence of integers in the form&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$ a, a + d, a + 2d $$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;for integer values of &lt;span class=&quot;math-container&quot;&gt;\$ a \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$ d \$&lt;/span&gt;. Note that &lt;span class=&quot;math-container&quot;&gt;\$ d \$&lt;/span&gt; may be any integer, including zero and negatives.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Input Specification&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may input the &lt;span class=&quot;math-container&quot;&gt;\$ 3 \times 3 \$&lt;/span&gt; grid in any sensible format&lt;/li&gt;&#xA;&lt;li&gt;The &lt;em&gt;unknown&lt;/em&gt; values may be represented by any character, so long that it is not a number (i.e. &lt;span class=&quot;math-container&quot;&gt;\$ 0-9 \$&lt;/span&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Output Specification&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The output must be in the same format as the input, with the exception of &lt;em&gt;unknown&lt;/em&gt; values becoming integers&lt;/li&gt;&#xA;&lt;li&gt;All rows and columns must form arithmetic sequences&lt;/li&gt;&#xA;&lt;li&gt;There is guaranteed to be at least one solution, and you may output any of them&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(This is the only solution)&#xA; 8  9 10       8  9 10&#xA;16  X 20  -&amp;gt;  16 18 20&#xA;24  X 30      24 27 30&#xA;&#xA;(This is one of many solutions)&#xA;14  X  X      14 20 26&#xA; X  X 18  -&amp;gt;  18 18 18&#xA; X 16  X      22 16 10&#xA;&#xA;(This is the only solution)&#xA; X -1 -2       0 -1 -2&#xA; 5  X  3  -&amp;gt;   5  4  3&#xA; X  X  X      10  9  8&#xA;&#xA;(This is one of many solutions)&#xA; X  X  X       0  0  0&#xA; X  X  X  -&amp;gt;   0  0  0&#xA; X  X  X       0  0  0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins!&lt;/p&gt;&#xA;" OwnerUserId="88546" LastActivityDate="2020-05-08T16:59:52.843" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18924" PostTypeId="2" ParentId="202" CreationDate="2020-05-09T02:40:54.597" Score="3" Body="&lt;h2&gt;&lt;a href=&quot;https://glot.io/&quot; rel=&quot;nofollow noreferrer&quot;&gt;glot.io&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;is a free online pastebin that supports runnable online snippets.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It can run:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Assembly&lt;/li&gt;&#xA;&lt;li&gt;ATS&lt;/li&gt;&#xA;&lt;li&gt;Bash&lt;/li&gt;&#xA;&lt;li&gt;C&lt;/li&gt;&#xA;&lt;li&gt;Clojure&lt;/li&gt;&#xA;&lt;li&gt;COBOL&lt;/li&gt;&#xA;&lt;li&gt;Coffeescript&lt;/li&gt;&#xA;&lt;li&gt;C++&lt;/li&gt;&#xA;&lt;li&gt;Crystal&lt;/li&gt;&#xA;&lt;li&gt;C#&lt;/li&gt;&#xA;&lt;li&gt;D&lt;/li&gt;&#xA;&lt;li&gt;Elixir&lt;/li&gt;&#xA;&lt;li&gt;Elm&lt;/li&gt;&#xA;&lt;li&gt;Erlang&lt;/li&gt;&#xA;&lt;li&gt;F#&lt;/li&gt;&#xA;&lt;li&gt;Go&lt;/li&gt;&#xA;&lt;li&gt;Groovy&lt;/li&gt;&#xA;&lt;li&gt;Haskell&lt;/li&gt;&#xA;&lt;li&gt;Idris&lt;/li&gt;&#xA;&lt;li&gt;Java&lt;/li&gt;&#xA;&lt;li&gt;Javascript&lt;/li&gt;&#xA;&lt;li&gt;Julia&lt;/li&gt;&#xA;&lt;li&gt;Kotlin&lt;/li&gt;&#xA;&lt;li&gt;Lua&lt;/li&gt;&#xA;&lt;li&gt;Mercury&lt;/li&gt;&#xA;&lt;li&gt;Nim&lt;/li&gt;&#xA;&lt;li&gt;Ocaml&lt;/li&gt;&#xA;&lt;li&gt;Perl&lt;/li&gt;&#xA;&lt;li&gt;Perl 6&lt;/li&gt;&#xA;&lt;li&gt;PHP&lt;/li&gt;&#xA;&lt;li&gt;Python&lt;/li&gt;&#xA;&lt;li&gt;Ruby&lt;/li&gt;&#xA;&lt;li&gt;Rust&lt;/li&gt;&#xA;&lt;li&gt;Scala&lt;/li&gt;&#xA;&lt;li&gt;Swift&lt;/li&gt;&#xA;&lt;li&gt;TypeScript&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-05-09T11:54:23.807" LastActivityDate="2020-05-09T11:54:23.807" CommentCount="2" CommunityOwnedDate="2020-05-09T02:40:54.597" ContentLicense="CC BY-SA 4.0" />
  <row Id="18925" PostTypeId="2" ParentId="2140" CreationDate="2020-05-09T08:06:52.747" Score="1" Body="&lt;h2&gt;Posted&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/204726/tile-the-plane-with-squashed-hexagons&quot;&gt;Tile the plane with squashed hexagons&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="75681" LastEditorUserId="75681" LastEditDate="2020-05-14T06:43:43.743" LastActivityDate="2020-05-14T06:43:43.743" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18928" PostTypeId="2" ParentId="2140" CreationDate="2020-05-10T16:04:59.690" Score="0" Body="&lt;h1&gt;Emulate a Schmitt trigger&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given low and high cutoff points, and a list of input readings, generate a list of output states at those points.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If an input reading is greater than the high cutoff point then the output is always in the high cutoff state.&lt;/li&gt;&#xA;&lt;li&gt;If an input reading is lower than the low cutoff point then the output is always in the low cutoff state.&lt;/li&gt;&#xA;&lt;li&gt;At least one of the above comparisons must be a strict inequality. (Please make both comparisons strict unless this would consume additional bytes.)&lt;/li&gt;&#xA;&lt;li&gt;If the initial reading is between the two cutoff points the the output must be deterministic (i.e. the same for each run with the same inputs).&lt;/li&gt;&#xA;&lt;li&gt;In all other cases the output remains in the same state.&lt;/li&gt;&#xA;&lt;li&gt;It is valid for both cutoff points to be the same value.&lt;/li&gt;&#xA;&lt;li&gt;The input readings may be taken in any convenient format, but it must be capable of handling at least 94 different values.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; The output for each input reading must be one of two distinct values.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2020-05-10T16:04:59.690" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18929" PostTypeId="2" ParentId="2140" CreationDate="2020-05-11T15:49:25.150" Score="0" Body="&lt;h1&gt;Subtract a list &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;You are given a list of boolean values as input. You have to find its difference.&lt;/p&gt;&#xA;&lt;p&gt;The difference of a list of one value is equal to the value itself. The difference of a list with &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; values is defined as &lt;span class=&quot;math-container&quot;&gt;$$(\text{the difference of the first }\lfloor\frac{N}2\rfloor\text{ items}) -  (\text{the difference of the last }\lceil\frac{N}2\rceil\text{ items})$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer wins!&lt;/p&gt;&#xA;&lt;p&gt;[todo: examples]&lt;/p&gt;&#xA;" OwnerUserId="36445" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-05-13T15:20:23.090" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18930" PostTypeId="1" CreationDate="2020-05-11T18:06:56.690" Score="10" ViewCount="167" Body="&lt;p&gt;The problem is hardly unique to this SE site, but for people new to the site there is fundamental knowledge that isn't obvious.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For instance, the &quot;tour&quot; page doesn't mention that questions must be set up so that they can be scored, independent of votes, nor does it provide a list of &quot;scoring tags&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Similarly searching for &quot;score&quot; on the help page produces nothing useful.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;That seems like a very important concept for this site, so why isn't it presented front and center?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;One specific improvement would be if the question submission form required one of the scoring tags, the same as meta sites require one of a set of tags.&lt;/p&gt;&#xA;" OwnerUserId="95055" LastEditorUserId="68942" LastEditDate="2021-06-25T00:38:35.750" LastActivityDate="2021-06-25T00:38:35.750" Title="Lack of obviousness about how to use this site" Tags="|feature-request|status-deferred|new-users|help-center|" AnswerCount="1" CommentCount="2" ClosedDate="2021-06-02T00:22:15.203" ContentLicense="CC BY-SA 4.0" />
  <row Id="18931" PostTypeId="2" ParentId="18930" CreationDate="2020-05-11T18:11:47.160" Score="6" Body="&lt;p&gt;The Tour and Help Center only have &lt;a href=&quot;https://meta.stackexchange.com/a/259920/295232&quot;&gt;very specific items/pages that can be customized&lt;/a&gt;. Besides that, not everybody reads them.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The points you mention &lt;em&gt;are&lt;/em&gt; highlighted in the right sidebars of&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;All question list pages, including the home page:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/OgYGA.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/OgYGA.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The Ask Question wizard:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/qsDa5.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/qsDa5.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="38979" LastActivityDate="2020-05-11T18:11:47.160" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18932" PostTypeId="2" ParentId="2140" CreationDate="2020-05-11T18:40:29.420" Score="0" Body="&lt;h1&gt;Analyze the flow&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/counting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;counting&amp;#39;&quot; rel=&quot;tag&quot;&gt;counting&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/204694/analyze-the-flow&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="94346" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-05-13T19:47:42.670" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18934" PostTypeId="2" ParentId="2140" CreationDate="2020-05-12T00:29:10.150" Score="1" Body="&lt;h2&gt;Generate a &quot;Poem&quot; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a strictly positive integer, &lt;code&gt;N&lt;/code&gt;, produce an output satisfying the following:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Produce an array of length N.&lt;/li&gt;&#xA;&lt;li&gt;Every string (i.e. &quot;word&quot;) in the array is of length N.&lt;/li&gt;&#xA;&lt;li&gt;Every letter in the word is unique.&lt;/li&gt;&#xA;&lt;li&gt;Every first letter of the words are unique between each other.&lt;/li&gt;&#xA;&lt;li&gt;The remaining items of each word are equal to each other.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Example output&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;For an input of e.g. &lt;code&gt;3&lt;/code&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;cba&#xA;dba&#xA;eba&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Trailing whitespace is totally allowed.&lt;/li&gt;&#xA;&lt;li&gt;The &quot;letters&quot; don't have to be from the lowercase alphabet, as long as they aren't whitespace.&lt;/li&gt;&#xA;&lt;li&gt;The maximum &lt;code&gt;N&lt;/code&gt; you need to support is 13, since there are 26 letters in the lowercase alphabet.&lt;/li&gt;&#xA;&lt;li&gt;The separator of your array can be anything, as long as you will never involve that character for every possible input from 1 to 13. You can also just output a literal array.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-05-12T10:05:38.627" LastActivityDate="2020-05-12T10:05:38.627" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18939" PostTypeId="2" ParentId="2140" CreationDate="2020-05-14T09:31:18.600" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/204912/bilibili-av-bv-code-conversion&quot;&gt;Bilibili AV/BV Code Conversion&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="71546" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-05-18T09:41:23.260" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18940" PostTypeId="2" ParentId="2140" CreationDate="2020-05-14T10:23:03.510" Score="0" Body="&lt;p&gt;There are &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; honest man(always tell the truth), &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; dishonest man(always tell lie), and &lt;span class=&quot;math-container&quot;&gt;\$c\$&lt;/span&gt; random man(tell random Y/N). How many times at least should you ask one of them a yes/no question to guarantee you get knowledge of who they are? You may assume that it's possible.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(a,b,c) -&amp;gt; ans&#xA;(1,1,0) -&amp;gt; 1&#xA;(1,1,1) -&amp;gt; 3&#xA;(0,0,2) -&amp;gt; 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Notes:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I don't know if there's clever way, but anyway brute-force work&lt;/li&gt;&#xA;&lt;li&gt;It's enough if you can only ask an expression about who they are. If you ask them &quot;what will A answer if I ask B&quot; the answer is just &quot;(A is liar) xor B&quot;. &quot;Did A tell lie when answering B&quot; is just &quot;(A's answer) xor B&quot;. Questions about the current ask or future ask may lead to paradox and are not allowed.&lt;/li&gt;&#xA;&lt;li&gt;Actually it's possible to identify them iff there are less than half of random answerer, or an edge case that all are random answerers. Only considering honest and random, if there are more honest than random, ask them same question and do a majority vote gets answer to the question. If there are same honest and random, and random tell as if they are honest and real honest are random, you can't tell the difference.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2020-05-16T09:18:32.810" LastActivityDate="2020-05-16T09:18:32.810" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18941" PostTypeId="2" ParentId="2140" CreationDate="2020-05-15T01:33:15.903" Score="0" Body="&lt;p&gt;Posted: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/204924/select-all-from-selectql-where-answer-short-or-not-length-10000&quot;&gt;SELECT ALL FROM SelectQL WHERE (answer=&amp;quot;short&amp;quot; OR NOT length=10000)&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2020-05-21T16:31:31.127" LastActivityDate="2020-05-21T16:31:31.127" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18942" PostTypeId="1" CreationDate="2020-05-16T15:21:44.197" Score="0" ViewCount="110" Body="&lt;p&gt;Immagine to have a group of elements &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt;, and a challenge that requires to output &lt;code&gt;truthy&lt;/code&gt; if the input is in &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I suppose that in traditional programming hashing (&lt;a href=&quot;https://en.wikipedia.org/wiki/Bloom_filter&quot; rel=&quot;nofollow noreferrer&quot;&gt;Bloom filter&lt;/a&gt;?) is a good solution to this task.&lt;br&gt;&#xA;But hashes have collisions, and since we are not so interested in avoiding them, one could come up with a dummy hash (or directly none), worst case scenario: all inputs yield &lt;code&gt;truthy&lt;/code&gt;.&lt;br&gt;&#xA;Of course, we could just ask to output &lt;code&gt;falsy&lt;/code&gt; if the input doesn't belong to &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt;, but:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are there parameters that can be added in the rules in order to allow some margin of collision? (e.g. max false positive probability)&lt;br&gt;&#xA;If so, would the challenge become too technical and infeasible to test?&lt;/li&gt;&#xA;&lt;li&gt;With absolute error free detection, how its complexity is related to the Kolmogorov complexity of &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt;?&lt;br&gt;&#xA;I see that it can be lower: check if input is a sudoku VS. output all possible sudoku...&lt;br&gt;&#xA;Am I right?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="94346" LastEditorUserId="94346" LastEditDate="2020-05-16T16:10:56.580" LastActivityDate="2020-05-16T16:10:56.580" Title="How can hash be allowed in a input-testing challenge?" Tags="|discussion|" AnswerCount="0" CommentCount="7" FavoriteCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18943" PostTypeId="2" ParentId="2140" CreationDate="2020-05-17T01:05:45.057" Score="1" Body="&lt;h2&gt;Compress a grandmaster chess position &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Background&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Compress a position from a grandmaster chess game to as few bits as possible on average. A strong submission will probably use that these positions come from real games by top players, and so will make chess sense and strategic sense, rather than just being random legal chess positions. As illustration, &lt;a href=&quot;https://link.springer.com/content/pdf/10.3758/BF03213216.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;a study&lt;/a&gt; found that grandmasters do well at memorizing positions from real games using &quot;chunking&quot; but with only perform at novice level memorizing random boards.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The is related to but different from &lt;a href=&quot;https://codegolf.stackexchange.com/q/19397/20260&quot;&gt;Smallest chess board compression&lt;/a&gt;, which scores on the worst-case scenario, and &lt;a href=&quot;https://codegolf.stackexchange.com/q/132725/20260&quot;&gt;Smallest chess game compression&lt;/a&gt;, which compresses full games. (&lt;em&gt;Sandbox&lt;/em&gt;: Let me know if this is too similar)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Task&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must write a compressor, which maps a chess position onto a sequence of bits, and a decompressor that returns its to the original position. You can vary the length of the bit sequence by position, and this will likely be important to getting a good score.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The position to compress will just be a the placement of pieces on the chess board. You do not to encode whose move it is, castling rights, or en-passant. It will be given in &lt;a href=&quot;https://en.wikipedia.org/wiki/Forsyth%E2%80%93Edwards_Notation&quot; rel=&quot;nofollow noreferrer&quot;&gt;FEN string format&lt;/a&gt; with only the piece placement part, for example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;2krn2r/pppb4/4pq2/3pN2p/5P2/2PBP3/PP4P1/R2QK2R&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/6lr9mm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/6lr9mm.png&quot; alt=&quot;The chess position for this FEN&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Each letter corresponds to a piece (pawn=&quot;P&quot;, knight=&quot;N&quot;, bishop=&quot;B&quot;, rook=&quot;R&quot;, queen=&quot;Q&quot;, and king=&quot;K&quot;). White's pieces use uppercase letters and Black's are lowercase. Slashes separate the descriptions of each of the rows from top to bottom, that is the 8 files doing from 8 (where black's pieces start) to down to 1. Numbers are used for blocks of that many empty spaces that are horizontally adjacent.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You will be scored on the average length of your compressed bit sequence on 10,000 random game positions. They will chosen at random from games played by grandmasters, restricted to move 5 or later. [Will work out more details when generating this data.]&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This Pastebin (TODO) contains 10,000 FEN strings to use as a training set that you can use to get a preliminary score. The final score will be based on a separate secret test set of 10,000 FEN strings.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your code must correctly decode every game in the position. Be sure that it can handle all positions, such as ones with weird underpromotions, which might appear in the test set but not the training set. (&lt;em&gt;Sandbox:&lt;/em&gt; How to handle submissions that break this? A default penalty score for games failed? Ask to resubmit?)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your compression and decompression must complete within 5 minutes on all the games. (&lt;em&gt;Sandbox:&lt;/em&gt; Allow to compress all games at once? Do one game at a time but store state to allow &quot;learning&quot;? Include a memory limit?)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The length of your code is immaterial to this challenge.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2020-05-17T01:05:45.057" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18944" PostTypeId="2" ParentId="2140" CreationDate="2020-05-17T14:19:35.707" Score="1" Body="&lt;h2&gt;Permutation primes &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/prime&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;prime&amp;#39;&quot; rel=&quot;tag&quot;&gt;prime&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;A &lt;em&gt;permutation prime&lt;/em&gt; is a prime such that at least one of its uniquified permutations (&lt;em&gt;not&lt;/em&gt; equal to itself) of its digits is a prime.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given a number, check if this number is a permutation prime.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Reference program&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##yy9OTMpM/f//6OTDM09NKqhNN3zUsOv/f0MjQwA&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt; is a reference program I made.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-05-17T14:26:47.007" LastActivityDate="2020-05-17T14:26:47.007" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18948" PostTypeId="2" ParentId="2140" CreationDate="2020-05-19T01:30:45.913" Score="1" Body="&lt;p&gt;Posted: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/205086/stepping-through-time&quot;&gt;Stepping Through Time&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="55439" LastEditorUserId="55439" LastEditDate="2020-05-21T23:12:07.647" LastActivityDate="2020-05-21T23:12:07.647" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18949" PostTypeId="2" ParentId="2140" CreationDate="2020-05-19T10:08:40.400" Score="2" Body="&lt;h1&gt;Minimise my List of Error Codes&lt;/h1&gt;&#xA;&lt;h2&gt;SANDBOX - One Option for a Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a set of error codes, formed of letters (A-Z) and numbers (0-9), output a string that represents the set of error codes in a concise format, as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Where two or more error codes share some first characters, there is no need to repeat those characters in the output&lt;/li&gt;&#xA;&lt;li&gt;Individual errors in the output are comma-separated (or in separate array indices, if preferred)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;e.g:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;E1&lt;/code&gt;,&lt;code&gt;E2&lt;/code&gt; -&amp;gt; &lt;code&gt;E1,2&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;E1&lt;/code&gt;,&lt;code&gt;W1&lt;/code&gt; -&amp;gt; &lt;code&gt;E1,W1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ERR001&lt;/code&gt;, &lt;code&gt;ERR002&lt;/code&gt;, &lt;code&gt;ERR101&lt;/code&gt;, &lt;code&gt;WAR001&lt;/code&gt; -&amp;gt; &lt;code&gt;ERR001,2,101,WAR001&lt;/code&gt; or &lt;code&gt;WAR001,ERR001,2,101&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;WARN001&lt;/code&gt;, &lt;code&gt;ERR001&lt;/code&gt; -&amp;gt; &lt;code&gt;WARN001,ERR001&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;EAR001&lt;/code&gt;, &lt;code&gt;ERR001&lt;/code&gt; -&amp;gt; &lt;code&gt;EAR001,RR001&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;E001&lt;/code&gt;, &lt;code&gt;E001&lt;/code&gt; -&amp;gt; &lt;code&gt;E001,&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;A&lt;/code&gt;, &lt;code&gt;B&lt;/code&gt;, &lt;code&gt;C01&lt;/code&gt;, &lt;code&gt;D002&lt;/code&gt; -&amp;gt; &lt;code&gt;A,B,C01,D002&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;D002&lt;/code&gt;, &lt;code&gt;DC01&lt;/code&gt;, &lt;code&gt;DC0A&lt;/code&gt;, &lt;code&gt;DC0B&lt;/code&gt; -&amp;gt; &lt;code&gt;D002,C01,A,B&lt;/code&gt; or &lt;code&gt;DC01,A,B,002&lt;/code&gt; or &lt;code&gt;DC0A,B,1,002&lt;/code&gt;etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Basically, when decoding, each character after the comma replaces the characters at the end of the previous error code.&lt;/p&gt;&#xA;&lt;h2&gt;SANDBOX - Alternative Challenge?&lt;/h2&gt;&#xA;&lt;p&gt;Decode a string of error codes, as per the above format, to extract the individual list of error codes again&lt;/p&gt;&#xA;&lt;h1&gt;SANDBOX - Questions&lt;/h1&gt;&#xA;&lt;p&gt;I know the spec is incomplete above - this is a placeholder for when I have time to write a better spec.&lt;/p&gt;&#xA;&lt;p&gt;Is this an interesting &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge? Which of the two options would work best? Or could it be the sum of the two (encoder and decoder)?&lt;/p&gt;&#xA;" OwnerUserId="62289" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-05-19T10:08:40.400" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18951" PostTypeId="2" ParentId="2140" CreationDate="2020-05-19T21:19:56.110" Score="0" Body="&lt;p&gt;The game of scrabble is played by placing lettered tiles on a grid to form words. The words being formed must read from left to right, or up to down on the grid. The words must appear in the official Scrabble dictionary, and all letters placed on the grid must be part of a valid word. This challenge will focus on a specific technique for playing a simplified version of Scrabble.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A useful technique when playing Scrabble is to add a single letter to an existing word that is already on the board to form a new word. Write a program or function that, when given a dictionary, finds the longest series of words that can be formed by adding a single letter to another word to form a new word.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;You are given the following dictionary:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;at&#xA;ate&#xA;rate&#xA;elate&#xA;crate&#xA;belate&#xA;belated&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your submission should output:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;['at', 'ate', 'rate', 'crate']&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;An invalid output would be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;['at', 'ate', 'elate', 'belate', 'belated']&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;because &lt;code&gt;'elate'&lt;/code&gt; cannot be formed by adding a single letter to &lt;code&gt;'ate'&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that this challenge is not about finding the longest word that can be formed by adding a single letter to another word, but about finding the longest chain of words that can be formed in such a way. Which means that this answer:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;['elate', 'belate', 'belated']&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;is wrong, because it only has three steps, whereas the first example has four.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Winning Criteria&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Code-golf, so shortest code wins. I/O is flexible. Standard loopholes apply. Take dictionary as a list, file, delimited string, or whatever you want. Output can be sent to stdout, returned as a single string (with delimiter), or list of strings.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;TODO&lt;/p&gt;&#xA;" OwnerUserId="65255" LastActivityDate="2020-05-19T21:19:56.110" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18952" PostTypeId="2" ParentId="2140" CreationDate="2020-05-19T22:13:48.207" Score="0" Body="&lt;h1&gt;Golf me a  &lt;sup&gt;Bookmarklet&lt;/sup&gt; Quine&lt;/h1&gt;&#xA;&lt;p&gt;Given a javascript program (or any utf-8 text) of arbitrary length, output it in my simplified version of &lt;a href=&quot;https://www.rfc-editor.org/rfc/rfc3986#section-2&quot; rel=&quot;nofollow noreferrer&quot;&gt;URI form&lt;/a&gt;, like a bookmarklet. You can use &lt;a href=&quot;https://mrcoles.com/bookmarklet/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://mrcoles.com/bookmarklet/&lt;/a&gt; as reference. Output should be in the form&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;javascript:&lt;/code&gt;[input with percent-encoding for special characters]&lt;/p&gt;&#xA;&lt;p&gt;Special characters are any character that is not&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Alphabetic (upper or lower)&lt;/li&gt;&#xA;&lt;li&gt;a digit&lt;/li&gt;&#xA;&lt;li&gt;the characters &lt;code&gt;.&lt;/code&gt;,&lt;code&gt;-&lt;/code&gt;,&lt;code&gt;_&lt;/code&gt;, or &lt;code&gt;~&lt;/code&gt;   (period, hyphen, underscore, tilde)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Your program &amp;quot;should convert all other characters to bytes according to UTF-8, and then percent-encode those values&amp;quot;&lt;sup&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Percent-encoding#Character_data&quot; rel=&quot;nofollow noreferrer&quot;&gt;w&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A percent-encoding mechanism is used to represent a data octet in a&#xA;component when that octet's corresponding character is outside the&#xA;allowed set or is being used as a delimiter of, or within, the&#xA;component.  A percent-encoded octet is encoded as a character&#xA;triplet, consisting of the percent character &amp;quot;%&amp;quot; followed by the two&#xA;hexadecimal digits representing that octet's numeric value.  For&#xA;example, &amp;quot;%20&amp;quot; is the percent-encoding for the binary octet&#xA;&amp;quot;00100000&amp;quot; (ABNF: %x20), which in US-ASCII corresponds to the space&#xA;character (SP). &lt;a href=&quot;https://www.rfc-editor.org/rfc/rfc3986#section-2.1&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;source&lt;/em&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Lowercase hex is okay, but uppercase is preferred.&lt;/p&gt;&#xA;&lt;p&gt;This is code golf, standard loopholes are prohibited, programs should handle input up to 20 lines and output in a single line.&lt;/p&gt;&#xA;&lt;h2&gt;The Twist (so it's not a duplicate)&lt;/h2&gt;&#xA;&lt;p&gt;If run with no input or just a newline (your choice), the program should output itself in the same format as if the program's source was inputted normally.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;In                                              Out&#xA;&#xA;[blank]                                         javascript:[the%20program%27s%20source]&#xA;g/re/p                                          javascript:g%2Fre%2Fp&#xA;https://www.youtube.com/watch?v=dQw4w9WgXcQ     javascript:https%3A%2F%2Fwww.youtube.com%2Fwatch%3Fv%3DdQw4w9WgXcQ&#xA;alert(&amp;quot;test!&amp;quot;)                                  javascript:%7Balert(%22test!%22)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;sandbox questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What should I add?&lt;/li&gt;&#xA;&lt;li&gt;What tags does this need?&lt;/li&gt;&#xA;&lt;li&gt;Are my examples inconsistent?&lt;/li&gt;&#xA;&lt;li&gt;What parts of the challenge are redundant?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="90614" LastEditorUserId="-1" LastEditDate="2021-10-07T07:34:52.683" LastActivityDate="2020-05-23T17:35:10.343" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18953" PostTypeId="2" ParentId="2140" CreationDate="2020-05-20T16:12:55.063" Score="1" Body="&lt;h1&gt;The golfing skills are strong with this one &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Consider the base string &lt;code&gt;s = &quot;The golfing skills are strong with this one&quot;&lt;/code&gt;, an adaptation of the quote &quot;The force is strong with this one&quot; by Darth Vader, an infamous character of the Star Wars saga (sandbox, am I correct?).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You have to output the string &lt;code&gt;s&lt;/code&gt; with as many characters as there are bytes in your source code. If your code is longer than &lt;code&gt;s&lt;/code&gt;, extend &lt;code&gt;s&lt;/code&gt; by concatenating it repeatedly as many times as needed.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program must be non-empty.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You may or may not take the string &lt;code&gt;s&lt;/code&gt; as input for your program. (Sandbox, maybe it is more interesting to &lt;em&gt;not&lt;/em&gt; allow the string as input?)&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A string as specified in the &lt;strong&gt;Task&lt;/strong&gt;.&lt;/p&gt;&#xA;" OwnerUserId="75323" LastEditorUserId="75323" LastEditDate="2020-05-20T16:47:16.460" LastActivityDate="2020-05-20T16:47:16.460" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18955" PostTypeId="2" ParentId="2140" CreationDate="2020-05-21T03:38:47.587" Score="1" Body="&lt;h1&gt;Halting problem for simplified Brainfuck &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Given a simplified Brainfuck program, you must determine whether it halts. Your program  must always halt in finite time on valid inputs.&lt;/p&gt;&#xA;&lt;p&gt;Simplified Brainfuck is a language that operates on a zero-initialized tape that is infinite in both directions. All cells contain integers from 0 to 255, and operations are performed modulo 256.&#xA;There are the following instructions:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+ increment the current cell&#xA;- decrement the current cell&#xA;&amp;lt; move 1 cell to the left along the tape&#xA;&amp;gt; move 1 cell to the right along the tape&#xA;[ if the current cell is zero, skip past the next ]&#xA;] go to the previous [&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Loops (&lt;code&gt;[]&lt;/code&gt;) can't be nested.&lt;/p&gt;&#xA;&lt;p&gt;This is tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer wins.&lt;/p&gt;&#xA;" OwnerUserId="36445" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-05-21T05:03:02.083" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="18956" PostTypeId="2" ParentId="2140" CreationDate="2020-05-21T04:20:01.027" Score="1" Body="&lt;h1&gt;Cheat activated&lt;/h1&gt;&#xA;&#xA;&lt;h3&gt;Background&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The game &lt;a href=&quot;https://en.wikipedia.org/wiki/Grand_Theft_Auto:_San_Andreas&quot; rel=&quot;nofollow noreferrer&quot;&gt;Grand Theft Auto: San Andreas&lt;/a&gt; went down to history also thanks to its wide selection of cheats. They're almost 90 and anyone who has ever touched this game, no doubt he tried them all!&lt;br&gt;&#xA;One cheat is activated (on PC) typing in-game a secret keyword, and then boom, a jet pops out of thin air or perhaps all pedestrians look like Elvis Presley or some other rowdy effect...  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;They always come with this confirmation message:&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/F0Ro3m.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/F0Ro3m.png&quot; alt=&quot;enter image description here&quot;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Rockstar &lt;a href=&quot;https://gtagmodding.com/sanandreas/cheats/&quot; rel=&quot;nofollow noreferrer&quot;&gt;choosed to store them hashed&lt;/a&gt;, so due to collision, in addition to the intended ones there are many other strings that trigger every cheat.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Therefore I propose to solve this &lt;a href=&quot;https://www.youtube.com/watch?v=yrXhYgVmKLQ&quot; rel=&quot;nofollow noreferrer&quot;&gt;downside&lt;/a&gt;!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Write a full program that prints &lt;code&gt;CHEAT ACTIVATED&lt;/code&gt; if and only if the last part of a string is a &lt;code&gt;cheat code&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Cheat codes&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;THUGSARMOURY&#xA;PROFESSIONALSKIT&#xA;NUTTERSTOYS&#xA;INEEDSOMEHELP&#xA;TURNUPTHEHEAT&#xA;TURNDOWNTHEHEAT&#xA;PLEASANTLYWARM&#xA;TOODAMNHOT&#xA;DULLDULLDAY&#xA;STAYINANDWATCHTV&#xA;CANTSEEWHEREIMGOING&#xA;TIMEJUSTFLIESBY&#xA;SPEEDITUP&#xA;SLOWITDOWN&#xA;ROUGHNEIGHBOURHOOD&#xA;STOPPICKINGONME&#xA;SURROUNDEDBYNUTTERS&#xA;TIMETOKICKASS&#xA;OLDSPEEDDEMON&#xA;DOUGHNUTHANDICAP&#xA;NOTFORPUBLICROADS&#xA;JUSTTRYANDSTOPME&#xA;WHERESTHEFUNERAL&#xA;CELEBRITYSTATUS&#xA;TRUEGRIME&#xA;ALLCARSGOBOOM&#xA;WHEELSONLYPLEASE&#xA;STICKLIKEGLUE&#xA;GOODBYECRUELWORLD&#xA;DONTTRYANDSTOPME&#xA;ALLDRIVERSARECRIMINALS&#xA;PINKISTHENEWCOOL&#xA;SOLONGASITSBLACK&#xA;FLYINGFISH&#xA;WHOATEALLTHEPIES&#xA;BUFFMEUP&#xA;LEANANDMEAN&#xA;BLUESUEDESHOES&#xA;ATTACKOFTHEVILLAGEPEOPLE&#xA;LIFESABEACH&#xA;ONLYHOMIESALLOWED&#xA;BETTERSTAYINDOORS&#xA;NINJATOWN&#xA;LOVECONQUERSALL&#xA;EVERYONEISPOOR&#xA;EVERYONEISRICH&#xA;CHITTYCHITTYBANGBANG&#xA;CJPHONEHOME&#xA;JUMPJET&#xA;IWANTTOHOVER&#xA;TOUCHMYCARYOUDIE&#xA;SPEEDFREAK&#xA;BUBBLECARS&#xA;NIGHTPROWLER&#xA;DONTBRINGONTHENIGHT&#xA;SCOTTISHSUMMER&#xA;SANDINMYEARS&#xA;KANGAROO&#xA;NOONECANHURTME&#xA;MANFROMATLANTIS&#xA;LETSGOBASEJUMPING&#xA;ROCKETMAN&#xA;IDOASIPLEASE&#xA;BRINGITON&#xA;STINGLIKEABEE&#xA;IAMNEVERHUNGRY&#xA;STATEOFEMERGENCY&#xA;CRAZYTOWN&#xA;TAKEACHILLPILL&#xA;FULLCLIP&#xA;IWANNADRIVEBY&#xA;GHOSTTOWN&#xA;HICKSVILLE&#xA;WANNABEINMYGANG&#xA;NOONECANSTOPUS&#xA;ROCKETMAYHEM&#xA;WORSHIPME&#xA;HELLOLADIES&#xA;ICANGOALLNIGHT&#xA;PROFESSIONALKILLER&#xA;NATURALTALENT&#xA;OHDUDE&#xA;FOURWHEELFUN&#xA;HITTHEROADJACK&#xA;ITSALLBULL&#xA;FLYINGTOSTUNT&#xA;MONSTERMASH&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A string &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; over the alphabet:&lt;br&gt;&#xA;&lt;code&gt;[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Print &lt;code&gt;CHEAT ACTIVATED&lt;/code&gt; if there exist a &lt;code&gt;cheat code&lt;/code&gt; &lt;span class=&quot;math-container&quot;&gt;\$c\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$c\$&lt;/span&gt; is a &lt;a href=&quot;https://en.wikipedia.org/wiki/Substring#Suffix&quot; rel=&quot;nofollow noreferrer&quot;&gt;suffix&lt;/a&gt; of &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Nothing otherwise&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="94346" LastEditorUserId="94346" LastEditDate="2020-05-22T23:05:37.793" LastActivityDate="2020-05-22T23:05:37.793" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18957" PostTypeId="2" ParentId="2140" CreationDate="2020-05-21T05:17:58.937" Score="0" Body="&lt;h1&gt;Uniform necklace sampling &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The challenge is, given a number &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;, to produce a random binary &lt;a href=&quot;https://en.wikipedia.org/wiki/Necklace_(combinatorics)&quot; rel=&quot;nofollow noreferrer&quot;&gt;necklace&lt;/a&gt; of length &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;. All possible necklaces must have the same probability of being chosen.&lt;/p&gt;&#xA;&lt;p&gt;[TODO: more about necklaces]&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Solutions are compared first by asymptotic memory complexity in &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; (lower is better), and, in case of a tie, by size (lower is better).&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox stuff&lt;/h2&gt;&#xA;&lt;p&gt;(I &lt;em&gt;do&lt;/em&gt; intend to use code-golf as only a tiebreaker)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How to tag this question the most correctly?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="36445" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-05-21T14:10:23.983" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18958" PostTypeId="2" ParentId="2140" CreationDate="2020-05-21T16:43:24.570" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/205155/golf-me-a-text-editor&quot;&gt;Posted.&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="95207" LastEditorUserId="95207" LastEditDate="2020-05-23T14:24:18.380" LastActivityDate="2020-05-23T14:24:18.380" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18959" PostTypeId="2" ParentId="2140" CreationDate="2020-05-21T17:56:48.387" Score="5" Body="&lt;h1&gt;Draw a Peano Curve with Slashes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given a positive integer N, draw the N&lt;sup&gt;th&lt;/sup&gt; iteration of the &lt;a href=&quot;https://en.wikipedia.org/wiki/Peano_curve&quot; rel=&quot;nofollow noreferrer&quot;&gt;Peano Curve&lt;/a&gt;, using only slashes and backslashes (and spaces).  The curve will be rotated at a 45 degree angle from its usual depiction.  Here's an example for the first 3 iterations:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;N = 1&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt; /\&#xA;/ /&#xA; / /&#xA; \/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;N = 2&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;       /\&#xA;      / /&#xA;     / / /\&#xA;    /  \/ /&#xA;   / /\  / /\&#xA;   \/ /  \/ /&#xA; /\  / /\  / /\&#xA;/ / / / / / / /&#xA; / / / / / / / /&#xA; \/ /  \/ /  \/&#xA;   / /\  / /\&#xA;   \/ /  \/ /&#xA;     / /\  /&#xA;     \/ / /&#xA;       / /&#xA;       \/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;N = 3&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;                         /\&#xA;                        / /&#xA;                       / / /\&#xA;                      /  \/ /&#xA;                     / /\  / /\&#xA;                     \/ /  \/ /&#xA;                   /\  / /\  / /\&#xA;                  / / / / / / / /&#xA;                 / / / / / / / / /\&#xA;                /  \/ /  \/ /  \/ /&#xA;               / /\  / /\  / /\  / /\&#xA;               \/ /  \/ /  \/ /  \/ /&#xA;             /\  / /\  / /\  / /\  / /\&#xA;            / / / / /  \/ / / / / / / /&#xA;           / / / / / /\  / / / / / / / /\&#xA;          /  \/ /  \/ /  \/ /  \/ /  \/ /&#xA;         / /\  / /\  / /\  / /\  / /\  / /\&#xA;         \/ /  \/ /  \/ /  \/ /  \/ /  \/ /&#xA;       /\  / /\  / /\  / /\  / /\  / /\  / /\&#xA;      / /  \/ / / / / / / /  \/ / / / / / / / &#xA;     / / /\  / / / / / / / /\  / / / / / / / /\&#xA;    /  \/ /  \/ /  \/ /  \/ /  \/ /  \/ /  \/ /&#xA;   / /\  / /\  / /\  / /\  / /\  / /\  / /\  / /\&#xA;   \/ /  \/ /  \/ /  \/ /  \/ /  \/ /  \/ /  \/ /&#xA; /\  / /\  / /\  / /\  / /\  / /\  / /\  / /\  / /\&#xA;/ / / / / / / / / / / / / / / / / / / / / / / / / /&#xA; / / / / / / / / / / / / / / / / / / / / / / / / / /&#xA; \/ /  \/ /  \/ /  \/ /  \/ /  \/ /  \/ /  \/ /  \/&#xA;   / /\  / /\  / /\  / /\  / /\  / /\  / /\  / /\&#xA;   \/ /  \/ /  \/ /  \/ /  \/ /  \/ /  \/ /  \/ /&#xA;     / /\  / /\  / /\  / /\  / /\  / /\  / /\  /&#xA;     \/ / / / / / / /  \/ / / / / / / /  \/ / /&#xA;       / / / / / / / /\  / / / / / / / /\  / / &#xA;       \/ /  \/ /  \/ /  \/ /  \/ /  \/ /  \/  &#xA;         / /\  / /\  / /\  / /\  / /\  / /\    &#xA;         \/ /  \/ /  \/ /  \/ /  \/ /  \/ /    &#xA;           / /\  / /\  / /\  / /\  / /\  /     &#xA;           \/ / / / / / / /  \/ / / / / /      &#xA;             / / / / / / / /\  / / / / /       &#xA;             \/ /  \/ /  \/ /  \/ /  \/        &#xA;               / /\  / /\  / /\  / /\          &#xA;               \/ /  \/ /  \/ /  \/ /         &#xA;                 / /\  / /\  / /\  /&#xA;                 \/ / / / / / / / /&#xA;                   / / / / / / / /&#xA;                   \/ /  \/ /  \/&#xA;                     / /\  / /\&#xA;                     \/ /  \/ /&#xA;                       / /\  /&#xA;                       \/ / /&#xA;                         / /&#xA;                         \/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;You may optionally mirror this horizontally, vertically, or both if you choose.  Leading spaces are clearly required for this.  Trailing spaces are optional.  This is code-golf, so the shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="42471" LastEditorUserId="42471" LastEditDate="2020-05-22T14:48:18.883" LastActivityDate="2020-05-22T14:48:18.883" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18961" PostTypeId="2" ParentId="2140" CreationDate="2020-05-21T20:01:43.123" Score="0" Body="&lt;h1&gt;Solve some diplomatic issues&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You are given a set of moves in a theoretical &lt;em&gt;Diplomacy&lt;/em&gt; game.  We're not going to handle validation of moves being legal or not, simply attempt to resolve a turn.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Here are the simplified rules to Diplomacy (&lt;a href=&quot;https://media.wizards.com/2015/downloads/ah/diplomacy_rules.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;full rules here&lt;/a&gt;):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are two types of units: Armies and Fleets.  Armies can only move on land, Fleets on land and in the sea.  You can safely ignore this, because we're assuming that all of the moves you've been given are at least theoretically valid.&lt;/li&gt;&#xA;&lt;li&gt;There are four types of moves: Hold (stay in place), Move, Support (a certain other unit), Convoy.&lt;/li&gt;&#xA;&lt;li&gt;When two or more units end up in the same country, whichever unit has the most support stays.  Each unit without the most support (or each unit tied for the most) returns to its original country.  A unit which is not Moving and which is not tied for the most support is Dislodged.&lt;/li&gt;&#xA;&lt;li&gt;A Fleet can Convoy an Army through its space to another space.  That convoy is cancelled if the Fleet is Dislodged.  Only a Fleet in a sea space can Convoy.&lt;/li&gt;&#xA;&lt;li&gt;A unit can support another unit holding or moving into an adjacent country if it can move into that country (Armies can't Support Fleets in the sea).&lt;/li&gt;&#xA;&lt;li&gt;A supporting unit which is attacked ceases to support, unless it is supporting an attack on the unit attacking it.  If it is dislodged, it ceases to support in any case.&lt;/li&gt;&#xA;&lt;li&gt;The Beleaguered Garrison rule: If a unit is attacked by two units with the same amount of support, the attacked unit is not Dislodged, and the attackers return to their original countries.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;You will receive a list of moves.  Each move will be in the following format:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Power Unit_type Origin_country Move_type Destination_country&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There is no Destination_country if a unit holds (or you can insert a placeholder).  Destination_country for Support or Convoy is the Origin_country of the unit being Supported or Convoyed.  For example, you could get:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;E F Eng M Pic&#xA;F A Pic H&#xA;G A Bel S Eng&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This means:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;English Fleet in the English Channel Moves to Picardy&#xA;French Army in Picardy Holds&#xA;German Army in Belgium Supports the Fleet in the English Channel to Move to Picardy&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Your output should be the location of each unit after the move.  Any Dislodged unit should be marked as such.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Output format:&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Power Unit_type Country Dislodged?&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;For the example given above, the output should be:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;E F Pic&#xA;F A Pic D&#xA;G A Bel&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The more difficult part of this is in regards to convoys.  A convoy fails if there is no valid path for the army to take.  For instance, if we have:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;E F Nth C Den&#xA;E A Den M Hol&#xA;F F Eng M Nth&#xA;F F Bel S Eng&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;The French fleets dislodge the English Fleet in the North Sea, and the convoy does not take place.  But if we also had&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;E F Hel C Den&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;There would still be a valid path for the English Army and the convoy would succeed.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Paradoxes&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Be warned, there are paradoxes in Diplomacy.  These are to be treated as undefined behaviour; any output is acceptable where&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Each unit is listed&lt;/li&gt;&#xA;&lt;li&gt;There is only one non-dislodged unit per country&lt;/li&gt;&#xA;&lt;li&gt;In any country with a dislodged unit there is a non-dislodged unit&lt;/li&gt;&#xA;&lt;li&gt;Each non-moving unit is listed in its origin country&lt;/li&gt;&#xA;&lt;li&gt;Each moving unit is listed either in its origin country or its destination country&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Note that, in particular, each unit being in its starting country is a valid output.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Adjacency list&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For use with convoys, it's helpful to know which countries are adjacent to which other countries.  (Everything is assumed to be valid, but it may not be clear whether a convoy with a single cut link is still possible otherwise).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You may assume that this list is available to you in any format: a function that takes two countries and returns true/false, a variable, a file, etc.  In any case, the list itself does not add to your byte count.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;[To be added]&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Input/Output Formats&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;You can use any Input/Output formats you choose, as is standard.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Questions for the sandbox&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How much clearer does my description of the rules of Diplomacy need to be?&lt;/li&gt;&#xA;&lt;li&gt;Does this sound like an interesting challenge?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/board-game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;board-game&amp;#39;&quot; rel=&quot;tag&quot;&gt;board-game&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="82199" LastActivityDate="2020-05-21T20:01:43.123" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18962" PostTypeId="2" ParentId="2140" CreationDate="2020-05-22T02:31:01.517" Score="1" Body="&lt;h1&gt;Quickly calculate &lt;span class=&quot;math-container&quot;&gt;\$ n! \bmod p \$&lt;/span&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/factorial&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;factorial&amp;#39;&quot; rel=&quot;tag&quot;&gt;factorial&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The idea is extremely simple: Given two positive integers &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$ p \$&lt;/span&gt;, calculate the result of &lt;span class=&quot;math-container&quot;&gt;\$ n! \bmod p \$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$ p \$&lt;/span&gt; is a &lt;em&gt;prime&lt;/em&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Your score is the highest &lt;span class=&quot;math-container&quot;&gt;\$ p \$&lt;/span&gt; you can achieve within &lt;span class=&quot;math-container&quot;&gt;\$ 10 \$&lt;/span&gt; seconds, by running the program &lt;span class=&quot;math-container&quot;&gt;\$ 10 \$&lt;/span&gt; separate times. More specifically, each run-through will contain two inputs &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$ p \$&lt;/span&gt;. You are to solve &lt;span class=&quot;math-container&quot;&gt;\$ n! \bmod p \$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; is a random number in the range &lt;span class=&quot;math-container&quot;&gt;\$[1, p]\$&lt;/span&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You must use &lt;a href=&quot;https://tio.run/##NYxBCoAgEEX3c4pZjhCiLoMOE2jlQmeYbNHpzYhWn/d4fLnbwTX0nouwNtS1Ri4AggvmKlcjA5@zZ0qRggvOAGysmEfw9nsi78wMKJrr/2DfGUh@QjG9e/cA&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; program to generate the &lt;span class=&quot;math-container&quot;&gt;\$ 10 \$&lt;/span&gt; test cases. So for example, if &lt;span class=&quot;math-container&quot;&gt;\$ p = 13 \$&lt;/span&gt;, the test case would look like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;n, p&#xA;9, 13&#xA;3, 13&#xA;10, 13&#xA;13, 13&#xA;7, 13&#xA;13, 13&#xA;8, 13&#xA;9, 13&#xA;6, 13&#xA;4, 13&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Make sure that each test case is run &lt;em&gt;separately&lt;/em&gt;, meaning you are not allowed to make use of previous test cases&lt;/li&gt;&#xA;&lt;li&gt;Multi-threading is disallowed&lt;/li&gt;&#xA;&lt;li&gt;Official times will be tested on my machine; make sure to include specifcations on how to run it&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, so the highest score wins!&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any loopholes that need to be addressed?&lt;/li&gt;&#xA;&lt;li&gt;Is there an easy, trivial solution to this?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="88546" LastEditorUserId="88546" LastEditDate="2020-05-22T15:53:02.630" LastActivityDate="2020-05-22T15:53:02.630" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18963" PostTypeId="2" ParentId="2140" CreationDate="2020-05-22T08:18:58.047" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/205422/zero-the-byte-eventually&quot;&gt;_&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-05-30T00:48:58.983" LastActivityDate="2020-05-30T00:48:58.983" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18964" PostTypeId="2" ParentId="2140" CreationDate="2020-05-22T15:25:56.643" Score="0" Body="&lt;h1&gt;Enforce Social Distancing! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Related to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/204957/maintain-social-distancing&quot;&gt;Maintain Social Distancing!&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As in that challenge, there is a 2-dimensional array of 1s and 0s representing people. In it, social distancing is maintained if and only if all 1s are at least 6 squares apart, where distance metric used is &lt;span class=&quot;math-container&quot;&gt;\$|\Delta x| + |\Delta y|\$&lt;/span&gt; (rectilinear or Manhattan).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The challenge here is to &lt;em&gt;move&lt;/em&gt; some people in a given 2D array so that social distancing is maintained. It's guaranteed that it's possible to do so. Your program's score on a given input is the total distance moved by all people.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your program's running time must not exceed 10 seconds on any of the test cases.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;, so there is a large set of inputs your programs will be tested on [TODO: actually create it]. The program with the lowest total score on all of these inputs wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox stuff&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this currently a bad idea for the reasons specified by Shaggy in the following comment?&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I &lt;em&gt;am&lt;/em&gt; sorry but I have downvoted this for what others may perceive to be a trivial reason: Code Golf is one of the few things I have left where I can escape how fucked my world has become; I absolutely &lt;em&gt;do not&lt;/em&gt; want to come here to be reminded that I can't hug my family and friends.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&lt;/li&gt;&#xA;&lt;li&gt;Is there an optimal algorithm? (I hope not)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="36445" LastActivityDate="2020-05-22T15:25:56.643" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18965" PostTypeId="2" ParentId="2140" CreationDate="2020-05-22T19:33:34.440" Score="2" Body="&lt;p&gt;Inspired by &lt;a href=&quot;https://puzzling.stackexchange.com/questions/98436/draw-this-planar-graph&quot;&gt;Draw this planar graph&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your input represents an ascending sequence, e.g. &lt;code&gt;1 2 3 4&lt;/code&gt;. You can require the sequence as input, or you can just input the length. The explanation assumes 1-indexing but you can use 0-indexed or even &lt;code&gt;a&lt;/code&gt;-indexed input if you adjust the algorithm appropriately.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;At each step, you can exchange any digit of value &lt;code&gt;n&lt;/code&gt; with the digit &lt;code&gt;n&lt;/code&gt; places to its right. So the valid second steps are &lt;code&gt;2 1 3 4&lt;/code&gt; and &lt;code&gt;1 4 3 2&lt;/code&gt;. Eventually you want to end up at the reverse sequence &lt;code&gt;4 3 2 1&lt;/code&gt;, which is the only permutation that has no legal steps.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Please output all possible sequences of steps from the input sequence to its reverse.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You should support sequences of up to at least 10 elements.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2020-05-22T19:33:34.440" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18966" PostTypeId="2" ParentId="2140" CreationDate="2020-05-22T19:39:51.233" Score="0" Body="&lt;h1&gt;Shorten the numbers&lt;/h1&gt;&#xA;&lt;p&gt;These numbers are taking up far too many bytes on my computer. Create a function/program to shorten any number using only Alphanumeric characters as the output.&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;Scoring is based on &lt;code&gt;optimized-output&lt;/code&gt;. Shortest number of characters produced for the following &lt;a href=&quot;https://www.calculator.net/random-number-generator.html?slower=999999999999&amp;amp;supper=99999999999999&amp;amp;ctype=1&amp;amp;s=5434&amp;amp;submit1=Generate&quot; rel=&quot;nofollow noreferrer&quot;&gt;randomly&lt;/a&gt; generated numbers (plus one special number with repetition) wins. Add the number of output characters output for the 5 test numbers together for total score.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;94949267912781&lt;/li&gt;&#xA;&lt;li&gt;75477115147709&lt;/li&gt;&#xA;&lt;li&gt;79547324913976&lt;/li&gt;&#xA;&lt;li&gt;12345678998765&lt;/li&gt;&#xA;&lt;li&gt;11111122222222&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The score of the non-optimized numbers = 70. (14 * 5)&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;does scoring make sense?&lt;/li&gt;&#xA;&lt;li&gt;should I include a sample script, output, or both?&lt;/li&gt;&#xA;&lt;li&gt;should I be more clear the answers should work on any number? (ie. &amp;quot;replacing each test number with one character is disallowed&amp;quot;)?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="95344" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-05-22T19:39:51.233" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18967" PostTypeId="2" ParentId="2140" CreationDate="2020-05-22T19:48:31.390" Score="2" Body="&lt;p&gt;Inspired by &lt;a href=&quot;https://puzzling.stackexchange.com/questions/98424/wizard-creating-a-jewelry&quot;&gt;Wizard creating a jewelry&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given an input list of positive integers, calculate the minimum cost of creating the list from the following operations:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Appending a positive integer costs the value of the integer.&lt;/li&gt;&#xA;&lt;li&gt;Incrementing the entire list costs 2.&lt;/li&gt;&#xA;&lt;li&gt;Exchanging two consecutive elements of the list costs 1.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;Example: The list &lt;code&gt;1 4 9 16 25&lt;/code&gt; could be constructed as follows:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Append 1&lt;/li&gt;&#xA;&lt;li&gt;Append 8&lt;/li&gt;&#xA;&lt;li&gt;Append 17&lt;/li&gt;&#xA;&lt;li&gt;Increment&lt;/li&gt;&#xA;&lt;li&gt;Increment&lt;/li&gt;&#xA;&lt;li&gt;Increment&lt;/li&gt;&#xA;&lt;li&gt;Increment&lt;/li&gt;&#xA;&lt;li&gt;Increment&lt;/li&gt;&#xA;&lt;li&gt;Append 1&lt;/li&gt;&#xA;&lt;li&gt;Swap 22 with 1&lt;/li&gt;&#xA;&lt;li&gt;Swap 13 with 1&lt;/li&gt;&#xA;&lt;li&gt;Swap 6 with 1&lt;/li&gt;&#xA;&lt;li&gt;Increment&lt;/li&gt;&#xA;&lt;li&gt;Increment&lt;/li&gt;&#xA;&lt;li&gt;Increment&lt;/li&gt;&#xA;&lt;li&gt;Append 1&lt;/li&gt;&#xA;&lt;li&gt;Swap 25 with 1&lt;/li&gt;&#xA;&lt;li&gt;Swap 16 with 1&lt;/li&gt;&#xA;&lt;li&gt;Swap 9 with 1&lt;/li&gt;&#xA;&lt;li&gt;Swap 4 with 1&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;This costs 51, which is an improvement over simply appending the integers, as that is a cost of 54.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2020-05-22T19:48:31.390" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18969" PostTypeId="2" ParentId="2140" CreationDate="2020-05-23T08:39:30.137" Score="3" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/205663/is-this-a-half-sort&quot;&gt;_&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-06-06T12:15:09.677" LastActivityDate="2020-06-06T12:15:09.677" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="18970" PostTypeId="2" ParentId="2140" CreationDate="2020-05-23T14:37:01.367" Score="0" Body="&lt;h1&gt;Match the entire lyrics of All-Star&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;The challenge is simple: create a program/function that, when given a string consisting of the entire lyrics to All-Star as they appear in &lt;a href=&quot;https://pastebin.com/s6u5tJre&quot; rel=&quot;nofollow noreferrer&quot;&gt;this paste&lt;/a&gt; (or not), output whether or not they are, in fact, the entire lyrics. The given string may be off by one of two characters, or something completely different, like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/152856/write-moby-dick-approximately&quot;&gt;Moby Dick (approximately)&lt;/a&gt;. Output may consist of any of two values that map to &lt;code&gt;true&lt;/code&gt; and &lt;code&gt;false&lt;/code&gt;. They could be &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt;, or &lt;code&gt;t&lt;/code&gt; and &lt;code&gt;f&lt;/code&gt;, or whatever you like so long as there are two &lt;em&gt;distinct&lt;/em&gt; values. You can choose to print the output or return it (if you are a program or a function). This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins!&lt;/p&gt;&#xA;" OwnerUserId="95207" LastActivityDate="2020-05-23T14:37:01.367" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="18971" PostTypeId="2" ParentId="2140" CreationDate="2020-05-23T20:39:55.627" Score="2" Body="&lt;h1&gt;Reduce the entropy of the input...&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Spec&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given two arguments:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A list containing 2 or more positive integers (from 0 to artificial limit of 2^32)&lt;/li&gt;&#xA;&lt;li&gt;A positive number defining the 'entropy allowance'&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Return a sublist containing elements up until the entropy allowance is used up.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For this challenge, we define 'entropy' as the difference in bits between numbers in the list; also known as the &lt;a href=&quot;https://en.wikipedia.org/wiki/Hamming_distance&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hamming distance&lt;/a&gt;. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that no 'entropy' is used up when flipping the bits in the first number, only used when flipping subsequent bits.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Worked example (MSB...LSB), keeping the numbers low to keep things simple:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 1:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;List: &lt;code&gt;[1, 2, 3, 4, 5, 6]&lt;/code&gt;&#xA;Allowance: &lt;code&gt;4&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;1 =&amp;gt; 0000 0001 - ignore implicit change from 0, total used = 0&#xA;2 =&amp;gt; 0000 0010 - change of 2 bits, total used = 2&#xA;3 =&amp;gt; 0000 0011 - change of 1 bit, total used = 3 &#xA;4 =&amp;gt; 0000 0100 - change of 3 bits, total used = 6 (would exceed allowance)&#xA;5 =&amp;gt; 0000 0101 - change of 1 bit, total used = 7&#xA;6 =&amp;gt; 0000 0110 - change of 2 bits, total used = 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output: &lt;code&gt;[1, 2, 3]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example 2:&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;List: &lt;code&gt;[255, 0, 127, 64, 32, 100]&lt;/code&gt;&#xA;Allowance: &lt;code&gt;23&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;255 =&amp;gt; 1111 1111 - ignore implicit change from 0, total used = 0&#xA;0   =&amp;gt; 0000 0000 - change of 8 bits, total used = 8&#xA;127 =&amp;gt; 0111 1111 - change of 7 bit, total used = 15&#xA;64  =&amp;gt; 0100 0100 - change of 6 bits, total used = 21&#xA;32  =&amp;gt; 0010 0000 - change of 2 bit, total used = 23&#xA;100 =&amp;gt; 0110 0100 - change of 2 bits, total used = 25&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Output: &lt;code&gt;[255, 0, 127, 64, 32]&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Is this interesting enough a challenge? Is it just a chameleon (is it just the hamming distance with extra steps)? Thoughts?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If it's not shot down for being a plain, any ideas for a better title?&lt;/p&gt;&#xA;" OwnerUserId="69200" LastEditorUserId="69200" LastEditDate="2020-05-23T21:09:59.823" LastActivityDate="2020-05-23T21:09:59.823" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="18974" PostTypeId="2" ParentId="2140" CreationDate="2020-05-24T16:04:34.800" Score="2" Body="&lt;h1&gt;The smallest positive integer that cannot be printed in fewer than %NUMBER% bytes of %LANGUAGE% &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;All numbers mentioned below are positive integers. All programs mentioned below output exactly 1 number (including functions that return it).&lt;/p&gt;&#xA;&lt;p&gt;For every number, there must be at least one program in your language that outputs it. Besides, the problem of determining what number the program outputs must be undecidable without making the assumption that the program halts.&lt;/p&gt;&#xA;&lt;p&gt;The challenge itself is to choose a number &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; and find the smallest number &lt;span class=&quot;math-container&quot;&gt;\$M\$&lt;/span&gt; that cannot be output by a program shorter than &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; ordinary units of measurement used for your language (usually bytes). You have to prove your solution correct. A strong mathematical proof is not necessary, but it should be reasonably convincing for somebody knowledgeable in your programming language.&lt;/p&gt;&#xA;&lt;p&gt;The answer with the largest &lt;span class=&quot;math-container&quot;&gt;\$M\$&lt;/span&gt; wins.&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox stuff&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In this challenge, non-golfing languages seem to have a serious advantage. I think scoring by &lt;span class=&quot;math-container&quot;&gt;\$M\$&lt;/span&gt; instead of &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; is better at reducing the advantage of Lenguage-like languages to manageable levels and preventing ties; is that correct?&lt;/li&gt;&#xA;&lt;li&gt;Is the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; tag appropriate?&lt;/li&gt;&#xA;&lt;li&gt;Title suggestions?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="36445" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-06-02T15:59:16.633" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="18975" PostTypeId="2" ParentId="5243" CreationDate="2020-05-25T08:13:01.607" Score="9" Body="&lt;h1&gt;100-500 rep for APL answers to Bubbler's challenges&lt;/h1&gt;&#xA;&lt;p&gt;To celebrate me (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;) reaching 25k rep (with over 100 answers in APL, 50 challenges written, and several thousands of rep gained from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17363/78410&quot;&gt;Adám's APL bounties&lt;/a&gt;), I will share some of my rep for even more APL answers!&lt;/p&gt;&#xA;&lt;p&gt;Specifically, I offer 100 (or higher up to 500, depending on how impressive it is) rep for the following:&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;A competitive APL answer to one of my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges which doesn't yet have one&lt;/h2&gt;&#xA;&lt;p&gt;&amp;quot;Competitive&amp;quot; is a bit subjective, but it generally means the solution&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;is at least shorter than comparable solutions in general-purpose languages (e.g. Python/JS; from my experience, APL usually gets 50~70% byte count of Python for moderately hard challenges, and much lower for easier ones),&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The code length is just a rule-of-thumb guide, and can be dismissed depending on the task (e.g. if the task makes it hard to use the SBCS).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;utilizes core APL features as appropriate, and&lt;/li&gt;&#xA;&lt;li&gt;does not look like a line-by-line translation from C or Python code.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If you think your answer is good but too long, you may ask for help at &lt;a href=&quot;https://chat.stackexchange.com/rooms/52405/the-apl-orchard&quot;&gt;the APL Orchard&lt;/a&gt; for golfing. I will decide on the bounties based on the golfed answer.&lt;/p&gt;&#xA;&lt;p&gt;&lt;s&gt;In order to prevent rushing for the newest challenges, only challenges that are at least 2 months old are eligible for this bounty. This is also applied to the SEDE query below.&lt;/s&gt; Due to lack of interest, I decided to simply remove this condition.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1242868/questions-eligible-for-apl-bounty-by-bubbler&quot; rel=&quot;nofollow noreferrer&quot;&gt;List of challenges to answer (SEDE query)&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;These challenges (despite having an APL answer already) are also available for the bounty:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;(none at the moment)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Note that some of the challenges are also eligible for Adám's bounties. Feel free to claim both.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Awarded Bounties&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;150 rep&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/76162/jo-king&quot;&gt;Jo King&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/210871/76162&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/195685/76162&quot;&gt;20 cards with no Set&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;150 rep&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/571/tessellatingheckler&quot;&gt;TessellatingHeckler&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/210899/571&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/203583/the-ultimate-inequality-challenge/&quot;&gt;The Ultimate Inequality Challenge&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;200 rep&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/76162/jo-king&quot;&gt;Jo King&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/210913/76162&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/205396/76162&quot;&gt;Bubbler numbers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;150 rep&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/95516/rak1507&quot;&gt;rak1507&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/211748/95516&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/205336/95516&quot;&gt;Cut resistance of a list&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;150 rep&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/76162/jo-king&quot;&gt;Jo King&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/211068/76162&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/199994/76162&quot;&gt;Is this a circular step sequence?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;150 rep&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/212183/80214&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/195775/78410&quot;&gt;Area of diagonal-folded regular polygon&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;150 rep&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/211821/80214&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/211763/circumference-of-an-ellipse&quot;&gt;Circumference of an ellipse&#xA;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;200 rep&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/213830/80214&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/201094/80214&quot;&gt;Counting valid Binary Sudoku rows&#xA;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;250 rep&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/a/215515/95792&quot;&gt;user&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/215515/95792&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/204132/95792&quot;&gt;Evaluate Conway chained arrow notation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;200 rep&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/214649/80214&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/203853/80214&quot;&gt;Perimeter of Conway Hexagon&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;250 rep&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/216263/80214&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/204002/80214&quot;&gt;When is the closest Conway's Doomsday?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;150 rep&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/95516/rak1507&quot;&gt;rak1507&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/217463/95516&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/203784/95516&quot;&gt;Penney-Conway Odds&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;200 rep&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/69277/martin-janiczek&quot;&gt;Martin Janiczek&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/217535/69277&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/196837/help-me-pair-my-left-and-right-socks&quot;&gt;Help me pair my left and right socks!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;200 rep&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792/user&quot;&gt;user&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/217477/95792&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/174677/95792&quot;&gt;Read out the C variable declaration&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;200 rep&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/218076/80214&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/172586/nightmare-puzzlang-translator/218076#218076&quot;&gt;Nightmare Puzzlang Translator&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Bounty Requests&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Please edit in bounty requests here below the template, with relevant links.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/a/218072/80214&quot;&gt;Answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/164364/80214&quot;&gt;Circular Limited Sums&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/a/218066/80214&quot;&gt;Answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/218059/80214&quot;&gt;Is This an L Shape?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Template: &lt;code&gt;[Username](link): [Answer](link) to [Challenge title](link)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-05-25T05:23:13.700" LastActivityDate="2021-05-25T05:23:13.700" CommentCount="3" CommunityOwnedDate="2020-10-01T15:05:35.547" ContentLicense="CC BY-SA 4.0" />
  <row Id="18978" PostTypeId="2" ParentId="2140" CreationDate="2020-05-27T10:02:04.363" Score="0" Body="&lt;h1&gt;Is this a simple cutting template?&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A simple cutting template is a rectangle that can be recursively cut into smaller rectangles using only full-width cuts.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;If you prefer a bottom-up description, then:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A single rectangle is a simple cutting template with 0 cuts.&lt;/li&gt;&#xA;&lt;li&gt;Two simple cutting templates of the same width (or length) can be joined along their common side into a larger simple cutting template.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Input: A diagram of a rectangle subdivided into smaller rectangles, or a list of rectangles in some standard format, e.g. position and size.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Output: A truthy value if the diagram is a simple cutting template.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Note that if you take input as a diagram then all of the rectangle edges will use the same character, whearas in the truthy examples below, some of the edges have been replaced with digits to show a possible ordering of cuts while the falsy examples have the smallest portion of the input that is not a simple cutting template marked on them.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;####2################&#xA;#   2               #&#xA;111111111111111111111&#xA;#                   #&#xA;#                   #&#xA;#                   #&#xA;111111111111111111111&#xA;#     2   2   2 4 4 #&#xA;3333332   2   2 4 4 #&#xA;# 4   2   2   2 4 4 #&#xA;# 45552   2   2 454 #&#xA;# 4 6 2   2   2 4 4 #&#xA;# 4 6 2   2   2 4 4 #&#xA;# 4 6 2   2   2 4 4 #&#xA;33333323332   2 4 4 #&#xA;#     2   2   2 4 4 #&#xA;#     23332   2 4 4 #&#xA;#     2   2   2 4 4 #&#xA;#     2   2   233333#&#xA;#     2   2   2     #&#xA;######2###2###2######&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;-&amp;gt; Truthy&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;##2#####4############&#xA;# 2     4           #&#xA;# 2333333333333333333&#xA;# 2         6     4 #&#xA;# 25555555555555554 #&#xA;# 2 6   6     8   4 #&#xA;# 2 6   67777777774 #&#xA;# 2 6   6         4 #&#xA;# 2 6   6         4 #&#xA;# 2 6   6         4 #&#xA;111111111111111111111&#xA;#               2   #&#xA;#               2333#&#xA;#               2   #&#xA;111111111111111111111&#xA;#   2             2 #&#xA;#   233333333333332 #&#xA;#   2 4 4     4   2 #&#xA;#   2 4 4555554   2 #&#xA;#   2 4 4     4   2 #&#xA;####2#############2##&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;-&amp;gt; Truthy&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#####################&#xA;#                   #&#xA;#                   #&#xA;#                   #&#xA;111111111111111111111&#xA;# 2   4           2 #&#xA;# 2   4           2 #&#xA;# 2   4           2 #&#xA;# 23333333333333332 #&#xA;# 2     4   4 6 4 2 #&#xA;# 2     45554 6 4 2 #&#xA;# 2     4 6 4 6 4 2 #&#xA;# 2     4 6 4 6 4 2 #&#xA;# 2     4 6 4 6 4 2 #&#xA;# 2     4 6 45554 2 #&#xA;# 2     4 6 4   4 2 #&#xA;# 2     4 6 4   4 2 #&#xA;# 2     4 6 4   4 2 #&#xA;# 2     4 6 4   4 2 #&#xA;# 2     4 6 4   4 2 #&#xA;##2#####4#6#4###4#2##&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;-&amp;gt; Truthy&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#####################&#xA;#               # # #&#xA;################# # #&#xA;#               # # #&#xA;#               # # #&#xA;#               # # #&#xA;?????????############&#xA;?     # ?     #     #&#xA;?     # ?     #     #&#xA;?     # ?     #     #&#xA;?     ##?     #     #&#xA;?     # ?     #     #&#xA;?###### ?############&#xA;?     # ? #       # #&#xA;?     # ? #       # #&#xA;?     # ? #       # #&#xA;?###### ?##       ###&#xA;? #   # ? #       # #&#xA;? ######? #       # #&#xA;? #     ? #       # #&#xA;?????????############&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;-&amp;gt; Falsy&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;?????????????????????&#xA;?     # # # # #     ?&#xA;?###### # # # #     ?&#xA;?     # # # # #     ?&#xA;?     # # # # ######?&#xA;?     # # # # #     ?&#xA;?###### # ##########?&#xA;? #   # # #         ?&#xA;? ##### # #         ?&#xA;? # # # # #         ?&#xA;? # # # # #         ?&#xA;? # # # # #         ?&#xA;? ####### #         ?&#xA;? #     # #         ?&#xA;? #     ############?&#xA;? #     #     #     ?&#xA;? #############     ?&#xA;? #     #     #     ?&#xA;? ##################?&#xA;? #         #       ?&#xA;?????????????????????&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;-&amp;gt; Falsy&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;#####################&#xA;#       #   #     # #&#xA;################### #&#xA;#                 # #&#xA;#####################&#xA;# #                 #&#xA;# ###################&#xA;# #   #             #&#xA;# ###################&#xA;# #   #     #       #&#xA;# ###################&#xA;# #                 #&#xA;# ???????????????????&#xA;# ?   #             ?&#xA;# ?   #             ?&#xA;# ?   #             ?&#xA;# ?   ##############?&#xA;# ?   #   #         ?&#xA;# ?########         ?&#xA;# ?       #         ?&#xA;##???????????????????&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;code&gt;-&amp;gt; Falsy&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2020-06-06T10:29:04.020" LastActivityDate="2020-06-06T10:29:04.020" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18980" PostTypeId="2" ParentId="2140" CreationDate="2020-05-27T20:14:52.860" Score="0" Body="&lt;h1&gt;Price this word &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;So, I'm going shopping in the &lt;strong&gt;Word Market&lt;/strong&gt;™. There are shelves of words which I can buy around me, but I only have one dollar bills and the change machines at the market are broken. To add to the problem, there are words with... non-word characters in them. That's no good, I can't buy those... can you help me figure out which words I can buy and which I can't?&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;So, I can only buy words that consist of only alphabetical characters and are worth a dollar. To determine a word's value, you have to sum the letters in the word where &lt;code&gt;A = 1¢&lt;/code&gt;, &lt;code&gt;B = 2¢&lt;/code&gt;... to &lt;code&gt;Z = 26¢&lt;/code&gt;. I'm too lazy to look at the output and judge whether it is equal to one  dollar (100 cents), so you'll need to return a specific value for words equal to a dollar (...or 100 cents) and a specific value for &lt;em&gt;not&lt;/em&gt; equal to a dollar (I'm going to stop including this).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I'll also offer a bonus byte reduction: if your code returns whether the word is less than a dollar, equal to a dollar, greater than a dollar, or invalid (e.g. &lt;code&gt;&amp;lt;&lt;/code&gt;, &lt;code&gt;=&lt;/code&gt;, &lt;code&gt;&amp;gt;&lt;/code&gt;, &lt;code&gt;x&lt;/code&gt;), your score will be multiplied by 3/4.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;SANDBOX NOTE: Is this a balanced bonus value?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Word          Non-bonus value     Bonus value&#xA;&#xA;a                  false               &amp;lt;&#xA;b                  false               &amp;lt;&#xA;printera           false               &amp;gt;&#xA;$word              false               x&#xA;printer            true                =&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;And here's a JavaScript snippet you can use if you want to check for non-bonus validity:&lt;/p&gt;&#xA;&#xA;&lt;p&gt;(it's also 52 bytes; you can use it by calling &lt;code&gt;f()&lt;/code&gt;)&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;f=s=&amp;gt;([...s].map(x=&amp;gt;a+=parseInt(x,36)-9),a==100),a=0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Anyways, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;standard loopholes&lt;/a&gt; apply, shortest answer in bytes wins (but I'll add shortest answers for esoteric &lt;em&gt;and&lt;/em&gt; functional languages)... you get the idea.&lt;/p&gt;&#xA;" OwnerUserId="85381" LastEditorUserId="85381" LastEditDate="2020-05-28T12:01:09.513" LastActivityDate="2020-05-28T12:01:09.513" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="18983" PostTypeId="2" ParentId="2140" CreationDate="2020-05-29T03:27:17.583" Score="0" Body="&lt;h1&gt;Magic card trick: Hide information by flipping cards&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;(This is inspired by a series of questions on puzzles.stackexchange.com:&#xA;&lt;a href=&quot;https://puzzling.stackexchange.com/questions/52228/is-this-10-card-magic-trick-possible&quot;&gt;10&lt;/a&gt;,&#xA;&lt;a href=&quot;https://puzzling.stackexchange.com/questions/52322/magicians-hide-and-seek-with-8-cards&quot;&gt;8&lt;/a&gt;,&#xA;&lt;a href=&quot;https://puzzling.stackexchange.com/questions/89851/the-flippin-magicians-7-card-grand-finale&quot;&gt;7&lt;/a&gt;)&#xA;&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Fix two integers &lt;em&gt;m&lt;/em&gt; and &lt;em&gt;u&lt;/em&gt;. Your task is to perform the following magic trick:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A Magician brings a pack of &lt;em&gt;m&lt;/em&gt; distinct cards, and leaves the room.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In their absence, a volunteer from the audience shuffles the deck and arranges all cards in a line, in any order they want.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Still in the absence of the magician, their assistant flips &lt;em&gt;u&lt;/em&gt; cards. On the table are the n cards, still in the order chosen by the volunteers, but &lt;em&gt;u&lt;/em&gt; are face down, leaving only &lt;em&gt;m&lt;/em&gt;−&lt;em&gt;u&lt;/em&gt; cards face up.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The magician returns, and from the order of the cards alone, knows each card.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Input:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;m&lt;/em&gt; - number of cards.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;u&lt;/em&gt; - number of cards to flip face down.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may assume 0 &amp;lt; &lt;em&gt;u&lt;/em&gt; &amp;lt; &lt;em&gt;m&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Output, if the trick is possible for &lt;em&gt;m&lt;/em&gt; and &lt;em&gt;u&lt;/em&gt;:&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&lt;em&gt;f&lt;/em&gt; - an mapping assigning to each sequence the order the assistant will create by flipping cards.&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the trick is to work, this mapping must be bijective.&lt;/li&gt;&#xA;&lt;li&gt;Use the integers 1...&lt;em&gt;m&lt;/em&gt; (or 0...&lt;em&gt;m&lt;/em&gt;−1), or single letters as card values.&lt;/li&gt;&#xA;&lt;li&gt;Use any meaningful way to express &lt;em&gt;f&lt;/em&gt;: a hash maps, a table, a function.&lt;/li&gt;&#xA;&lt;li&gt;Use a fixed placeholder for any face-down cards.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Output, if the trick is impossible for given values of &lt;em&gt;m&lt;/em&gt; and &lt;em&gt;u&lt;/em&gt;&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;This case should be indicated in a meaningful way.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example output (&lt;em&gt;m&lt;/em&gt;=3, &lt;em&gt;u&lt;/em&gt;=1):&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Using the digits &lt;code&gt;0&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt;, and &lt;code&gt;2&lt;/code&gt; as cards, and &lt;code&gt;_&lt;/code&gt; for their flipside:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;012 01_&#xA;021 0_1&#xA;102 _02&#xA;120 12_&#xA;201 2_1&#xA;210 _10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;(For these values of &lt;em&gt;m&lt;/em&gt; and &lt;em&gt;u&lt;/em&gt;, this isn't very impressive as a magic trick, of course.)&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Example output (&lt;em&gt;m&lt;/em&gt;=4, &lt;em&gt;u&lt;/em&gt;=2):&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Using &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;2&lt;/code&gt;, &lt;code&gt;3&lt;/code&gt;, and &lt;code&gt;4&lt;/code&gt; for the cards and &lt;code&gt;0&lt;/code&gt; for their flipside, and a JSON representation:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;{&quot;1234&quot;:&quot;0034&quot;,&quot;1243&quot;:&quot;0043&quot;,&quot;1324&quot;:&quot;0024&quot;,&quot;1342&quot;:&quot;0042&quot;,&quot;1423&quot;:&quot;0023&quot;,&quot;1432&quot;:&quot;0032&quot;,&#xA;&quot;2134&quot;:&quot;0104&quot;,&quot;2143&quot;:&quot;0103&quot;,&quot;2314&quot;:&quot;0014&quot;,&quot;2341&quot;:&quot;0041&quot;,&quot;2413&quot;:&quot;0013&quot;,&quot;2431&quot;:&quot;0031&quot;,&#xA;&quot;3124&quot;:&quot;0120&quot;,&quot;3142&quot;:&quot;0102&quot;,&quot;3214&quot;:&quot;0204&quot;,&quot;3241&quot;:&quot;0201&quot;,&quot;3412&quot;:&quot;0012&quot;,&quot;3421&quot;:&quot;0021&quot;,&#xA;&quot;4123&quot;:&quot;4003&quot;,&quot;4132&quot;:&quot;0130&quot;,&quot;4213&quot;:&quot;0203&quot;,&quot;4231&quot;:&quot;0230&quot;,&quot;4312&quot;:&quot;0302&quot;,&quot;4321&quot;:&quot;0301&quot;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;&lt;sub&gt;This is correct because as required, the keys are all permutations of &lt;code&gt;1234&lt;/code&gt;, each value has two cards face-down and the other cards match the original sequence, and each value appears only once.&lt;/sub&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is code-golf. Shortest solution wins.&lt;/p&gt;&#xA;" OwnerUserId="95359" LastEditorUserId="95359" LastEditDate="2020-05-29T22:52:56.137" LastActivityDate="2020-05-29T22:52:56.137" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="18984" PostTypeId="2" ParentId="2140" CreationDate="2020-05-29T16:40:56.123" Score="1" Body="&lt;h1&gt;Convert an integer to Chinese numerals&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/unicode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;unicode&amp;#39;&quot; rel=&quot;tag&quot;&gt;unicode&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Your task is to convert an integer from 1 to &lt;span class=&quot;math-container&quot;&gt;\$10^{52}-1\$&lt;/span&gt; (inclusive).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The characters from 1 to 10 with their Unicode code points are:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;一 1 U+4E00&#xA;二 2 U+4E8C&#xA;三 3 U+4E09&#xA;四 4 U+56DB&#xA;五 5 U+4E94&#xA;六 6 U+516D&#xA;七 7 U+4E03&#xA;八 8 U+516B&#xA;九 9 U+4E5D&#xA;十 10 U+5341&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Number greater that that are composed like this:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;十一 11&#xA;十二 12&#xA;...&#xA;二十 20&#xA;二十一 21&#xA;二十二 22&#xA;...&#xA;百 100&#xA;百一　101&#xA;...&#xA;百十 110&#xA;...&#xA;百九十九 199&#xA;二百 200&#xA;...&#xA;九百九十九 999&#xA;千 1000&#xA;...&#xA;九千九百九十九 9999&#xA;一万 10,000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;This is where it gets interesting, because numbers bigger than 10,000 are groups in groups of four, expressed with 十, 百 and 千. These are the powers we're going to use in this challenge:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;十 10 U+5341&#xA;百 100 U+767E&#xA;千 1000 U+5343&#xA;万 10^4 U+4E07&#xA;億 10^8 U+5104&#xA;兆 10^12 U+5146&#xA;京 10^16 U+4EAC&#xA;垓 10^20 U+5793&#xA;秭 10^24 U+79ED&#xA;穣 10^28 U+7A63&#xA;溝 10^32 U+6E9D&#xA;澗 10^36 U+6F97&#xA;正 10^40 U+6B63&#xA;載 10^44 U+8F09&#xA;極 10^48 U+6975&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Let's go through an example with 123456789123456789 as the input (other algorithms are possible)&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;identify groups of four digits, starting from the right: 12,3456,7891,2345,6789&lt;/li&gt;&#xA;&lt;li&gt;convert each group: 十二  三千四百五十六  七千八百九十一  二千三百四十五  六千七百八十九&lt;/li&gt;&#xA;&lt;li&gt;insert the appropriate multipliers: 十二京三千四百五十六兆七千八百九十一億二千三百四十五万六千七百八十九&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A leading ー MAY be dropped before 千 and 百 and MUST be dropped before 十.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;IO format&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The input can be an integer in any reasonable format. You can use a string/sequence of characters or a number type, if your language supports it. 128-bit numbers are not large enough, by the way.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;input output&#xA;1 一&#xA;2 二&#xA;3 三&#xA;4 四&#xA;5 五&#xA;6 六&#xA;7 七&#xA;8 八&#xA;9 九&#xA;10 十&#xA;15 十五&#xA;20 二十&#xA;31 三十一&#xA;100 百&#xA;123　百二十一&#xA;1000 千&#xA;8346 八千三百四十六&#xA;10000 一万&#xA;50010 五万十&#xA;100000 十万&#xA;123456789123456789　十二京三千四百五十六兆七千八百九十一億二千三百四十五万六千七百八十九&#xA;1234567891234567891234567891234567891234567891234567 一千二百三十四極五千六百七十八載九千百二十三正四千五百六十七澗八千九百十二溝三千四百五十六穣七千八百九十一禾予二千三百四十五垓六千七百八十九京一千二百三十四兆五千六百七十八億九千百二十三万四千五百六十七&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Standard code-golf rules apply. The shortest code in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;References&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Japanese_numerals&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://en.wikipedia.org/wiki/Japanese_numerals&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;This online converter seems to work well: &lt;a href=&quot;https://www.sljfaq.org/cgi/numbers.cgi&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.sljfaq.org/cgi/numbers.cgi&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;The Japanese dictionary &lt;a href=&quot;https://jisho.org/search/%E5%8D%81%E4%BA%8C%E4%BA%AC%E4%B8%89%E5%8D%83%E5%9B%9B%E7%99%BE%E4%BA%94%E5%8D%81%E5%85%AD%E5%85%86%E4%B8%83%E5%8D%83%E5%85%AB%E7%99%BE%E4%B9%9D%E5%8D%81%E4%B8%80%E5%84%84%E4%BA%8C%E5%8D%83%E4%B8%89%E7%99%BE%E5%9B%9B%E5%8D%81%E4%BA%94%E4%B8%87%E5%85%AD%E5%8D%83%E4%B8%83%E7%99%BE%E5%85%AB%E5%8D%81%E4%B9%9D&quot; rel=&quot;nofollow noreferrer&quot;&gt;jisho.org&lt;/a&gt; can convert Japanese numberals to western notation&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="46901" LastEditorUserId="46901" LastEditDate="2020-05-30T09:29:18.623" LastActivityDate="2020-05-30T09:29:18.623" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="18985" PostTypeId="2" ParentId="2140" CreationDate="2020-05-29T23:38:17.810" Score="0" Body="&lt;h2&gt;Partition distance &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Quoting Anush:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;I am very glad to provide a service to fill in the terrible gap in edit distance questions which codegolf.se has had. When there are as many edit distance questions as quine questions my job will be done.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;--&lt;a href=&quot;https://codegolf.stackexchange.com/questions/202974/code-golf-edit-distance-2#comment481733_202974&quot;&gt;Anush&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a binary string consisting only of &lt;code&gt;0&lt;/code&gt;'s and &lt;code&gt;1&lt;/code&gt;'s, partition the binary string (divide the string into consecutive substrings), and determine the &lt;em&gt;minimal&lt;/em&gt; edit distance in order to transform one piece into another, left to right. You need to output the sum of the edit distances between consecutive blocks.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I'm going to make a reference implementation to find the optimal partitions. But that's after I dump all my ideas, though.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;011010110111&#xA;&#xA;We partition the string like this:&#xA;[011][010][110][111]&#xA;&#xA;And then find the cumultative edit distance between each 2 pairs of partitioned strings:&#xA;[1 1 1]&#xA;&#xA;Then, we sum the list of partitions.&#xA;[3]&#xA;&#xA;So 3 is a possible output for this binary string. However, you need to find the minimum edit distance, so this might not be the correct answer.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Another example&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;001001010&#xA;&#xA;We partition this string:&#xA;[001][001][010]&#xA;&#xA;And then find the mimimal edit distance between each piece.&#xA;[0 1]&#xA;&#xA;Therefore, our (non-optimal?) output for 001001010 is 1 ([0 1] summed).&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The edit distance between two strings is the minimum number of single character insertions, deletions and substitutions needed to transform one string into the other.&lt;/li&gt;&#xA;&lt;li&gt;The input is guaranteed to have at least length 3.&lt;/li&gt;&#xA;&lt;li&gt;The pieces of your partition don't have to be the same length.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-06-07T04:34:55.893" LastActivityDate="2020-06-07T04:34:55.893" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="18987" PostTypeId="2" ParentId="2140" CreationDate="2020-05-30T00:06:49.463" Score="0" Body="&lt;h2&gt;Duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/5174/find-the-minimum-edit-distance-between-two-strings&quot;&gt;Find the minimum edit distance between two strings&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-06-07T01:47:29.723" LastActivityDate="2020-06-07T01:47:29.723" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18990" PostTypeId="2" ParentId="2140" CreationDate="2020-05-31T23:57:14.293" Score="0" Body="&lt;h1&gt;Mobile games money representation&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In many mobile clicker games where the player is usually required to tap on the screen to make money (in order to buy upgrades for you to generate money faster), it gets to a point in the game that the money made per second is so big that if represented in its &quot;normal&quot; form, it would clutter the mobile screen. Imagine showing the user that they are making &lt;span class=&quot;math-container&quot;&gt;\$1,000,000,000,000,000,000,000,000\$&lt;/span&gt; per second in a small mobile phone screen!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;From my experience as a regular player of these type of games, I have noticed that most of them represent bigger numbers by using letters. If the number of money per second is a number less than &lt;span class=&quot;math-container&quot;&gt;\$10,000,000\$&lt;/span&gt; then print the number as is. Otherwise, if the number is in the millions (but &lt;span class=&quot;math-container&quot;&gt;\$ \geq 10,000,000\$&lt;/span&gt;), for example  &lt;span class=&quot;math-container&quot;&gt;\$ 102,000,000\$&lt;/span&gt; it should print &lt;span class=&quot;math-container&quot;&gt;\$102M\$&lt;/span&gt;. If it is in the billions, it should print &lt;span class=&quot;math-container&quot;&gt;\$102B\$&lt;/span&gt;. You should use &lt;span class=&quot;math-container&quot;&gt;\$T\$&lt;/span&gt; for trillion and &lt;span class=&quot;math-container&quot;&gt;\$Q\$&lt;/span&gt; for quadrillion.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;As you can notice, the next would be quintillion which would also use the letter &lt;span class=&quot;math-container&quot;&gt;\$Q\$&lt;/span&gt; if followed the pattern. Instead of following this pattern which can be confusing at one point, game developers usually start a new pattern: Quintillion is used with the suffix &lt;span class=&quot;math-container&quot;&gt;\$AA\$&lt;/span&gt;, sextillion is &lt;span class=&quot;math-container&quot;&gt;\$AB\$&lt;/span&gt;, septillion is &lt;span class=&quot;math-container&quot;&gt;\$AC\$&lt;/span&gt; and so on. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Notice that this pattern would go until &lt;span class=&quot;math-container&quot;&gt;\$AZ\$&lt;/span&gt; and if the player is making more money than that, it would start from &lt;span class=&quot;math-container&quot;&gt;\$BA\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$BB\$&lt;/span&gt;, ..., &lt;span class=&quot;math-container&quot;&gt;\$BZ\$&lt;/span&gt;, ...,&lt;span class=&quot;math-container&quot;&gt;\$ZA\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$ZB\$&lt;/span&gt;, ... , &lt;span class=&quot;math-container&quot;&gt;\$ZZ\$&lt;/span&gt; which for our problem we will assume is the limit one player can make per second.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Given an integer &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$0 \lt x \leq 999\$&lt;/span&gt; and a natural number &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$y \gt 0\$&lt;/span&gt; representing the number of zeroes the number has, output the number in a &quot;mobile game money representation&quot; as described above.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Observations&lt;/h1&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The number of zeroes that &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt; represent &lt;strong&gt;does not&lt;/strong&gt; include the possible zeroes &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; might have! Example: if &lt;span class=&quot;math-container&quot;&gt;\$x = 100\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$y = 6\$&lt;/span&gt;, you should output &lt;span class=&quot;math-container&quot;&gt;\$100M\$&lt;/span&gt; and not &lt;span class=&quot;math-container&quot;&gt;\$1,000,000\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h1&gt;Test Cases (x, y --&gt; game money representation)&lt;/h1&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;100,  6 --&amp;gt; 100M&#xA;100,  5 --&amp;gt; 10M &#xA;100,  4 --&amp;gt; 1000000&#xA;1,   12 --&amp;gt; 1T&#xA;10,  12 --&amp;gt; 10T&#xA;100, 12 --&amp;gt; 100T&#xA;1,   18 --&amp;gt; 1AA&#xA;10,  18 --&amp;gt; 10AA&#xA;100, 18 --&amp;gt; 100AA&#xA;# To be added...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h1&gt;Meta questions&lt;/h1&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Is this a duplicate? I have looked around but didn't find anything similar.&lt;/li&gt;&#xA;&lt;li&gt;Is the wording confusing? I'm open to recommendations!&lt;/li&gt;&#xA;&lt;li&gt;I haven't written a program yet so the test cases might be wrong (I'll add more later).&lt;/li&gt;&#xA;&lt;li&gt;Pretty much any feedback is appreciated!&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="87307" LastActivityDate="2020-05-31T23:57:14.293" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18993" PostTypeId="2" ParentId="2140" CreationDate="2020-06-01T08:32:42.303" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/205515/the-double-castle-numbers&quot;&gt;The Double-Castle Numbers™&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base-conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; rel=&quot;tag&quot;&gt;base-conversion&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="71546" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-06-02T07:45:06.240" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18994" PostTypeId="2" ParentId="2140" CreationDate="2020-06-01T08:42:18.890" Score="3" Body="&lt;h1&gt;Complete a sequence using its distances &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Given &lt;span class=&quot;math-container&quot;&gt;\$A = (a_1,\dots,a_k)\ k\ge2 \$&lt;/span&gt; a nonrepetitive sequence of positive integers.&lt;br /&gt;&#xA;Starting from &lt;span class=&quot;math-container&quot;&gt;\$i=2\$&lt;/span&gt;, while &lt;span class=&quot;math-container&quot;&gt;\$a_i\in A:\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;span class=&quot;math-container&quot;&gt;\$d=|a_i-a_{i-1}|\$&lt;/span&gt; is not already in &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;, append &lt;span class=&quot;math-container&quot;&gt;\$d\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Increase &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt; the completed sequence.&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;In:  16 20 13 3&#xA;&#xA;     16 20 13 3 4&#xA;      --^&#xA;     16 20 13 3 4 7&#xA;         --^&#xA;     16 20 13 3 4 7 10&#xA;            --^&#xA;     16 20 13 3 4 7 10 1&#xA;              --^&#xA;     16 20 13 3 4 7 10 1&#xA;                --^&#xA;     16 20 13 3 4 7 10 1&#xA;                  --^&#xA;     16 20 13 3 4 7 10 1 9&#xA;                     --^&#xA;     16 20 13 3 4 7 10 1 9 8&#xA;                         --^&#xA;Out: 16 20 13 3 4 7 10 1 9 8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="94346" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-06-04T20:57:12.877" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="18995" PostTypeId="2" ParentId="2140" CreationDate="2020-06-01T08:43:41.923" Score="2" Body="&lt;h1&gt;Self-distances completion - Minimum k to get them all&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/205678/94346&quot;&gt;Related minor code-golf challenge&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Consider &lt;span class=&quot;math-container&quot;&gt;\$A = (a_1,\dots,a_k)\ k\ge2 \$&lt;/span&gt; a sequence of positive integers, in which all elements are different.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;em&gt;self-distances completion&lt;/em&gt; of a sequence like &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; it's performed recursively as follow:&lt;/p&gt;&#xA;&lt;p&gt;Starting from &lt;span class=&quot;math-container&quot;&gt;\$i=2\$&lt;/span&gt;, while &lt;span class=&quot;math-container&quot;&gt;\$a_i\in A:\$&lt;/span&gt; &lt;sub&gt;&lt;em&gt;(loop until the last element)&lt;/em&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;span class=&quot;math-container&quot;&gt;\$d=|a_i-a_{i-1}|\$&lt;/span&gt; is not already in &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;, append &lt;span class=&quot;math-container&quot;&gt;\$d\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Increase &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The resulting sequence &lt;span class=&quot;math-container&quot;&gt;\$A^\circ\$&lt;/span&gt; is presumably longer than &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;, nevertheless can't contain more than &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; terms.&lt;/p&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;A = (2,\ 9,\ 13,\ 15) \mapsto A^\circ = (2,\ 9,\ 13,\ 15,\ 7,\ 4,\ 8,\ 3,\ 5)\\&#xA;A = (2,\ 9,\ 13) \mapsto A^\circ = (2,\ 9,\ 13,\ 7,\ 4,\ 6,\ 3)\\&#xA;A = (2,\ 9) \mapsto A^\circ = (2,\ 9)&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&lt;p&gt;If we pick a number &lt;span class=&quot;math-container&quot;&gt;\$n\ge 2\$&lt;/span&gt;, we can ask what's the minimum length &lt;span class=&quot;math-container&quot;&gt;\$k_n\$&lt;/span&gt; of &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$A^\circ\$&lt;/span&gt; contains all the numbers up to &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;(Note that &lt;span class=&quot;math-container&quot;&gt;\$\max A = \max A^\circ\$&lt;/span&gt; so &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; has to be in &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Generate the sequence of &lt;span class=&quot;math-container&quot;&gt;\$k_n\$&lt;/span&gt; starting from &lt;span class=&quot;math-container&quot;&gt;\$n=2\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I'll run your code on my machine (Windows 10, i7-7500U) &lt;strong&gt;for 30 minutes&lt;/strong&gt;.&lt;br /&gt;&#xA;Obviously longer sequence is better. In case of a tie, who gets to the last term faster wins.&lt;br /&gt;&#xA;Your submission must not use more than 8GB of memory.&lt;br /&gt;&#xA;Please include instructions for how to compile/run your code.&lt;/p&gt;&#xA;&lt;h1&gt;First values and more info&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt; n. k_n - first A* example found (how many A of lenght k_n that satisfy the condition)&#xA;&#xA; 2.  2  - 1 2 (2)&#xA; 3.  2  - 1 3 2 (4)&#xA; 4.  2  - 4 1 3 2 (2)&#xA; 5.  2  - 5 4 1 3 2 (1)&#xA; 6.  3  - 1 6 2 5 4 3 (19)&#xA; 7.  3  - 3 1 7 2 6 5 4 (10)&#xA; 8.  3  - 6 1 8 5 7 3 2 4 (3)&#xA; 9.  4  - 6 1 9 2 5 8 7 3 4 (80)&#xA;10.  4  - 10 1 8 3 9 7 5 6 2 4 (39)&#xA;11.  4  - 6 8 1 11 2 7 10 9 5 3 4 (18)&#xA;12.  4  - 8 12 1 10 4 11 9 6 7 2 3 5 (7)&#xA;13.  4  - 5 3 12 13 2 9 1 11 7 8 10 4 6 (2)&#xA;14.  5  - 6 14 3 1 13 8 11 2 12 5 9 10 7 4 (68)&#xA;15.  5  - 9 13 3 1 15 4 10 2 14 11 6 8 12 5 7 (17)&#xA;16.  5  - 11 16 2 15 12 5 14 13 3 7 9 1 10 4 8 6 (9)&#xA;17.  5  - 14 15 9 13 17 1 6 4 16 5 2 12 11 3 10 8 7 (1)&#xA;18.  5  - 15 18 6 16 17 3 12 10 1 14 9 2 13 5 7 11 8 4 (1)&#xA;19.  6  - 16 10 18 1 4 19 6 8 17 3 15 13 2 9 14 12 11 7 5 (38)&#xA;20.  6  - 14 5 20 17 1 19 9 15 3 16 18 10 6 12 13 2 8 4 11 7 (8)&#xA;21.  6  - 12 19 3 21 20 6 7 16 18 1 14 9 2 17 13 5 15 4 8 10 11 (1)&#xA;22.  6  - 20 12 19 3 21 22 8 7 16 18 1 14 9 2 17 13 5 15 4 10 11 6 (1)&#xA;23.  7  - 22 4 23 14 16 1 21 18 19 9 2 15 20 3 10 7 13 5 17 6 8 12 11 (46)&#xA;24.  7  - 15 21 1 23 13 10 24 6 20 22 3 14 18 2 19 11 4 16 17 8 7 12 9 5 (14)&#xA;25.  8  - 19 23 2 22 9 1 25 7 4 21 20 13 8 24 18 3 17 5 16 6 15 14 12 11 10 (942)&#xA;26.  8  - 18 25 8 2 24 1 21 26 7 17 6 22 23 20 5 19 10 11 16 3 15 14 9 13 12 4 (254)&#xA;27.  8  - 27 1 25 20 6 22 18 3 26 24 5 14 16 4 15 23 2 19 9 12 11 8 21 17 10 13 7 (74)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;a href=&quot;https://tio.run/##fVTbctowEH2Wv2JDh4wd7A7uY0H0QyjTMbZIFhtBfWnTZvh2uruSjZ3OJDMxkvbs7eyR8uQ5z2@3T2jzqisMrJu2wPPnl00wOapwz2dBZxt8tqYAtC08ZTE85fR/yl7p23T71RRgYyhjIOuPyli9pGVXtXipMMf2j16uguDXGQu41AQOo@AtAPpjR1zJUgyHcDbvYph3kMAslpiRMx/ONYRIcQDXPgktF4sIXKRpCHYm1BZ33v0aqN4azrtoNi0vmpbw3c7o5OorbszPkLOoSbuo0xiOmlpGjKFYBSpQv1@wMiE@6KPgVQEasi0m6W5DPzv45neJ7L7yTtZ0RP4KuT36lTDULK59HIWHkGC407rwJwNYqX1tslKWV8ESKbzjDfkheo9se9zpQnBHhxhiCFTOrtwGe208x865nyoyejLXdCiY68VIUgnzVK3UvHpX1BVM1RjgJFpPs4wCu2oc9M1xU75L1bfFmZb/ZRnGdzH1yc1PZjwdYgytOV3c9ANFGuslVibpIC@l8m2fg0emSfxbaUzoyrcEdubMLa2oQXQjK0dzP9Z16YISAxx36IQrcYLxnBFD8y/9vEUybGUfB1B@Q8euC5bAnbKRz3JwWE7R/OnrdG320rgr4958r5HhZnT7xrQhM9m0Wd3GjlRbmNf@gk/pdkTjgVhgEGgNRJhr0c2pv62jKy@heSY2SeHxEWyCsGFHieGmJPj7QyADYit3i4t0NbZIyYs0doUu0iEntcVVnjK0XjDKisBL@sL9gvuCraPKnXkhP2ivZVV6IjOqgC5oVZ3zkJ5Q@9TgX3M@hGNiIk//CEovbfkBlNKNwPIkfxSZuh7BaRdDyMR/7MJE0Tu@jHol@Lebt6UQI/qvTdvVFkgh19vtHw&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;C (gcc) – Try It Online&quot;&gt;The veeery elementary program I used.&lt;/a&gt; There aren't any optimizations, it's just for reference.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;For the purpose of the challenge you don't have to output examples nor the count. &lt;code&gt;k_n&lt;/code&gt; is sufficient&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;(It doesn't appear in OEIS).&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Conjectures&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The sequence of &lt;span class=&quot;math-container&quot;&gt;\$k_n\$&lt;/span&gt; is monotonically increasing&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$k_{n+1}=k_{n}\lor k_{n+1}=k_{n}+1\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's all clear and does it makes sense?&lt;/li&gt;&#xA;&lt;li&gt;Any suggestion for a &amp;quot;lighter&amp;quot; name of the process other than &amp;quot;self-distance completion&amp;quot;?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="94346" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-06-06T13:47:13.510" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="18998" PostTypeId="1" AcceptedAnswerId="18999" CreationDate="2020-06-03T04:58:23.480" Score="2" ViewCount="119" Body="&lt;p&gt;Refer to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18989/89459&quot;&gt;this challenge in Sandbox&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;My major language is Haskell. In Haskell, a parser (type &lt;code&gt;ReadS&lt;/code&gt;) is a function that inputs a &lt;code&gt;String&lt;/code&gt; and outputs a list of a tuple of the parsed element and the remaining string (&lt;code&gt;ReadS a = String -&amp;gt; [(a,String)]&lt;/code&gt;). When the list is empty, there is no parse. When the list has two or more elements, the parse is ambiguous.&lt;/p&gt;&#xA;&lt;p&gt;There are also types &lt;code&gt;ReadP&lt;/code&gt; and &lt;code&gt;ReadPrec&lt;/code&gt;, which are equivalent to &lt;code&gt;ReadS&lt;/code&gt; and &lt;code&gt;Int -&amp;gt; ReadS&lt;/code&gt; respectively, but monadic. They are made invokable by &lt;code&gt;readP_to_S&lt;/code&gt; and &lt;code&gt;readPrec_to_S&lt;/code&gt;, respectively.&lt;/p&gt;&#xA;&lt;p&gt;There is also &lt;code&gt;readEither&lt;/code&gt;, whose type is &lt;code&gt;String -&amp;gt; Either String a&lt;/code&gt;. It outputs an error message when there is no parse or the parse is ambiguous. &lt;code&gt;readMaybe :: String -&amp;gt; Maybe a&lt;/code&gt; does the same thing, but outputs &lt;code&gt;Nothing&lt;/code&gt; instead. &lt;code&gt;read :: String -&amp;gt; a&lt;/code&gt; does the same thing, but throws an error instead.&lt;/p&gt;&#xA;&lt;p&gt;All these must be considered parsers, right? So a challenge asking for a parser should have the following format:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Objective&lt;/h1&gt;&#xA;&lt;p&gt;Parse a string to (some type).&lt;/p&gt;&#xA;&lt;h1&gt;Valid inputs&lt;/h1&gt;&#xA;&lt;p&gt;A valid input consists of (some format).&lt;/p&gt;&#xA;&lt;h1&gt;Invalid inputs&lt;/h1&gt;&#xA;&lt;p&gt;When the parser encounters (some format), the parser must be in an erroneous state. This includes:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Monadic failing&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Returning an erroneous value&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Throwing an error&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;When the input is neither valid nor invalid, it falls in &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;(blah blah blah)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Is this elaborate enough?&lt;/p&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2020-08-02T10:23:54.007" LastActivityDate="2020-08-02T10:23:54.007" Title="How to ask for a parser" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="18999" PostTypeId="2" ParentId="18998" CreationDate="2020-06-03T07:19:53.053" Score="7" Body="&lt;h1&gt;Do not assume any feature about a language, just write down the requirements in the most general words possible&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Always remember, many languages don't have functions, many languages don't have data types at all, and many languages don't have any mechanism to signal an error.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A parser can be written as a function (parse a string argument and return a desired object) or a full program (take a string from stdin and print out some representation of the object), just like other code golf tasks. You already described the task that way, no problem.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For the &quot;error&quot; part, you already found out that there are multiple valid ways to indicate error. What you should do is to just say &quot;indicate error in any sensible way for your language of choice&quot;. This automatically includes a failure monad (among others) in Haskell, throw/raise in JS/Python, and printing a consistent error value for minimal esolangs.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2020-06-03T07:19:53.053" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19000" PostTypeId="2" ParentId="2140" CreationDate="2020-06-03T16:01:30.633" Score="0" Body="&lt;h1&gt;Compute the pointiness, sharpness and smoothness of a letter &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;sup&gt;Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/205533/determine-the-sharpness-of-a-word&quot;&gt;Determine the sharpness of a word&lt;/a&gt;.&lt;/sup&gt;&lt;br /&gt;&#xA;You are given an uppercase letter of the English alphabet as input. You have to compute (and output) its pointiness, sharpness and smoothness. Since it is difficult to define these objectively, here's a table of the outputs:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;            A B C D E F G H I J K L M N O P Q R S T U V W X Y Z&#xA;pointiness: 2 0 2 0 3 3 2 4 4 2 4 2 2 2 0 1 1 2 2 3 2 2 2 4 3 2&#xA;sharpness:  1 2 0 2 2 1 1 0 0 1 0 1 3 2 0 1 0 1 0 0 0 1 3 0 0 2&#xA;smoothness: 0 2 1 1 0 0 1 0 0 1 0 0 0 0 1 1 1 1 2 0 1 0 0 0 0 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Transposed version (first lists the letter, then the pointiness, then the sharpness and then the smoothness)  &lt;sup&gt;&lt;sup&gt;(like a true CGCC user, I transposed it with Jelly and added spacing with Retina)&lt;/sup&gt;&lt;/sup&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A 2 1 0&#xA;B 0 2 2&#xA;C 2 0 1&#xA;D 0 2 1&#xA;E 3 2 0&#xA;F 3 1 0&#xA;G 2 1 1&#xA;H 4 0 0&#xA;I 4 0 0&#xA;J 2 1 1&#xA;K 4 0 0&#xA;L 2 1 0&#xA;M 2 3 0&#xA;N 2 2 0&#xA;O 0 0 1&#xA;P 1 1 1&#xA;Q 1 0 1&#xA;R 2 1 1&#xA;S 2 0 2&#xA;T 3 0 0&#xA;U 2 0 1&#xA;V 2 1 0&#xA;W 2 3 0&#xA;X 4 0 0&#xA;Y 3 0 0&#xA;Z 2 2 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Bonus imaginary internet points if you find a language where this is built-in.&lt;/p&gt;&#xA;&lt;p&gt;This is tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer wins.&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox stuff&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this not a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Is the table computed correctly? (the only ones that don't seem certain with the current font are &lt;code&gt;I&lt;/code&gt;'s pointiness, &lt;code&gt;G&lt;/code&gt;'s sharpness and &lt;code&gt;S&lt;/code&gt;'s smoothness)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="36445" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-06-04T03:58:52.757" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19002" PostTypeId="1" CreationDate="2020-06-05T13:29:44.740" Score="2" ViewCount="117" Body="&lt;p&gt;It seems now few questions show enough serious sense, and lots are just random requirements. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Where do good ones go, are they dilutioned, deleted or just posted less?&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2020-06-05T13:36:22.837" LastActivityDate="2020-06-06T11:34:50.257" Title="Where do good questions go?" Tags="|discussion|" AnswerCount="1" CommentCount="6" ClosedDate="2020-06-06T21:01:50.140" ContentLicense="CC BY-SA 4.0" />
  <row Id="19003" PostTypeId="2" ParentId="19002" CreationDate="2020-06-06T11:34:50.257" Score="1" Body="&lt;blockquote&gt;&#xA;  &lt;p&gt;Where do good ones go, are they dilutioned, deleted or just posted less?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;They aren't posted yet, they're still in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt;; the majority of good new questions are there. Good questions depend on your opinion; a bad question in your opinion can be a good question in another's perspective.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Nobody could delete their question once answered, so they can't be deleted. People won't want to delete their questions if they're well recieved anyway. So saying that they're &quot;dilutioned&quot; totally depends on your opinion.&lt;/p&gt;&#xA;" OwnerDisplayName="user92069" LastActivityDate="2020-06-06T11:34:50.257" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19004" PostTypeId="2" ParentId="2140" CreationDate="2020-06-06T11:49:16.103" Score="0" Body="&lt;h2&gt;ax + by, a &amp;amp; b are coprime &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;h2&gt;Backstory&lt;/h2&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A doctor in Berlin, after analyzing his medical history, has realized that all of the results of his integral measurement results can be represented in the form of &lt;span class=&quot;math-container&quot;&gt;\$23x+28y\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt; are integers.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;However, he could have extended his theory. &lt;span class=&quot;math-container&quot;&gt;\$23\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$28\$&lt;/span&gt; can be replaced by any two coprime numbers, and this theory would still hold. (He didn't have time to write his theory in a paper, that's quite awful.)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Without examples, I'll &lt;em&gt;never&lt;/em&gt; be convinced that this nonsensical theory holds!&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Given &lt;span class=&quot;math-container&quot;&gt;\$the\ output\ of\ (ax+by)\$&lt;/span&gt; (let's call it &lt;span class=&quot;math-container&quot;&gt;\$z\$&lt;/span&gt;), &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;, and &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt;, find the smallest pair of &lt;span class=&quot;math-container&quot;&gt;\$(a,\ b)\$&lt;/span&gt; that makes &lt;span class=&quot;math-container&quot;&gt;\$ax + by = z\$&lt;/span&gt; true.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Example cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-06-06T12:11:49.620" LastActivityDate="2020-06-06T12:11:49.620" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19005" PostTypeId="2" ParentId="2140" CreationDate="2020-06-06T12:00:47.910" Score="1" Body="&lt;h2&gt;Divide into 2 isosceles triangles &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given the measures of two of the interior angles of a triangle (&lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt;; the other angle can be easily calculated with &lt;code&gt;180 - x - y&lt;/code&gt;), draw a line segment that cuts this triangle into two isosceles triangles. You need to output the angle measures of both of your triangles.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;However, because the base angles are the same, you only need to output the list &lt;code&gt;[apex angle, base angle]&lt;/code&gt; of the divided triangles for both of the isosceles triangles. You can output the divided triangles in any order.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;An example&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;Say your input is 100, 60.&#xA;&#xA;Let's take a look at the complete triangle first. The triangle looks approximately like this.&#xA;&#xA;   100&#xA;&#xA;60            20&#xA;&#xA;Now we try to divide one of the angles such that two divided triangles are both isosceles triangles.&#xA;&#xA;       100&#xA;&#xA;(40,20)           20&#xA;&#xA;Now our bottom triangle is an isosceles triangle, since both of the base angles&#xA;of the bottom triangle are 20. The angle measures of the bottom triangle&#xA;looks approximately like this.&#xA;&#xA;       140&#xA;20             20&#xA;&#xA;Now, is the top triangle an isosceles triangle?&#xA;&#xA;    100&#xA;          40&#xA;40&#xA;&#xA;It is an isosceles triangle, because two of the angle measures are 40.&#xA;&#xA;Therefore, for [100, 60], you need to output [[100, 40], [140, 20]].&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h2&gt;Example cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[20, 40] -&amp;gt; [[140, 20], [120, 40]]&#xA;[45, 45] -&amp;gt; [[90, 45], [90, 45]]&#xA;[36, 72] -&amp;gt; [[72, 36], [36, 72]]&#xA;[108, 36] -&amp;gt; [[108, 36], [36, 72]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerDisplayName="user92069" LastEditorDisplayName="user92069" LastEditDate="2020-06-06T12:07:02.637" LastActivityDate="2020-06-06T12:07:02.637" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19006" PostTypeId="2" ParentId="2140" CreationDate="2020-06-06T12:25:47.293" Score="2" Body="&lt;h2&gt;Can this month tell the day-of-the-week? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt;&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;June 2020 is a month in which June 1st corresponds to Monday, June 2nd corresponds to Tuesday, ... June 7th corresponds to Sunday. For reference, here's the &lt;code&gt;cal&lt;/code&gt; of June 2020.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;      June 2020     &#xA;Su Mo Tu We Th Fr Sa&#xA;    1  2  3  4  5  6&#xA; 7  8  9 10 11 12 13&#xA;14 15 16 17 18 19 20&#xA;21 22 23 24 25 26 27&#xA;28 29 30            &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Given a year and a month in the format &lt;code&gt;[year, month]&lt;/code&gt;, output two distinct values that tell whether this month can tell the day-of-the week.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;[2020,6] -&amp;gt; True&#xA;[2021,2] -&amp;gt; True&#xA;[1929,4] -&amp;gt; True&#xA;&#xA;[1969,1] -&amp;gt; False&#xA;[1997,5] -&amp;gt; False&#xA;[2060,1] -&amp;gt; False&#xA;&lt;span class=&quot;math-container&quot;&gt;```&lt;/span&gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerDisplayName="user92069" LastActivityDate="2020-06-06T12:25:47.293" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19009" PostTypeId="2" ParentId="2140" CreationDate="2020-06-07T02:02:30.917" Score="2" Body="&lt;h1&gt;Print the SARS-Cov-2 (COVID-19) genome &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;As you probably learned in biology class, DNA and RNA are composed of strands of nucleotides; each nucleotide consists of a chemical called a base together with a sugar and a phosphate group. The information stored in the DNA or RNA is coded as a sequence of bases. DNA uses the bases A, C, G, and T (standing for adenine, cytosine, guanine, and thymine), while RNA uses A, C, G, and U (with uracil replacing thymine).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The genome of SARS-Cov-2, the virus that causes COVID-19, has been fully sequenced. This genome is a sequence of 29,903 bases, each base being one of A, C, G, or U, since it's an RNA virus.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;The challenge is to output that sequence using as few bytes in your program as possible (code golf).&lt;/strong&gt; You can write either a full program or a function.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because the names A, C, G, and U are arbitrary, you can use any 4 characters you want instead:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must use exactly 4 characters (they must be pairwise distinct--two or more can't be equal).&lt;/li&gt;&#xA;&lt;li&gt;Each one of the 4 characters must be a printable ASCII character in the range from &lt;code&gt;'!'&lt;/code&gt; to &lt;code&gt;'~'&lt;/code&gt;, inclusive (ASCII 33 to 126). In particular, this does &lt;em&gt;not&lt;/em&gt; include the space character or the newline character.&lt;/li&gt;&#xA;&lt;li&gt;Each of the 4 characters you use must always represent the same one of A, C, G, and U -- no changing in the middle!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Your output should be the precise text at the following link, with A, C, G, and U replaced by whichever 4 characters you selected, and you may optionally follow the entire sequence with one or more newline characters (but no newlines or other extraneous characters at the beginning or in the middle are allowed):&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##fZ1dki3JbYPXxuADV8AF2E9@9/7D6iI@IM9IEZZGuj23z09VJpMEQZD13//1v//zf3//qd2qmtm/P7e6d7v7@/eq/vvF38/639/ve2r777/798v78e9N379/Lxu95O9H/eLvv/P92X9/3fdj19///l4x34/9/eLvz/m@9C7h@z79eG/7@@ip7zrqe2Hd5Xx/@/ea7wru8/Sx3zvu8r/f9vfN97u@q/3@@b7ue1P9vGruCut7Uelm/17992XzvfG7wb9FWL3@bu572XcldW@/a6nvt9@rvz/3rvX79L8XfxdxF3s/fVeoj25d39T9893GXd53H/e5peu8/fiu5lsmFvJbtu8iblnqrrnve78L0PZ8O/Bd/bdCtwp389/Vf5c1pWv6Xvp98Peu7wa///@uY@6T5276W7HRet8X1d7d3jJ/d/Vd0t4N3ffOLZcX7T5wvsv7TOGzHd9BfxuuVdI/Wvb72Nv/W5e7gr83/H3Od7ffb5vNvJd8X3C28a2JVvt7E8v1vezWdW4NtX/avG/h74pvJ3WTuvjv0r6N0bbu3M93yd@3/33LrUHJlLW83/XcAZEt3gXft3@3WrcOt55n9trQO1r3tbKPu@v7mvvOOz5nm3zujE6UDkLfWo0Mt@6QfP9w2XUXfHf9vV67ctY6GIDM5m7rXqZDUmcJu7xR7/52qfQX61f8/dW3qd8bdQBubb8rOX/BW2/TSkv@fc/iPGZstxjvLQ5H4z74jNsehlN@J2zuYOgb79v5yLOyu3adxtXd61ifjWCl2iIdp89YzmZ08Vp/GXGPb8mGNF4Abd9nuHqxT@W5qtvsPrd3/o6PLXbu7uKOxOc8dJDqzvIZhHatzheckevELDfbWiLZ7x1Dn5o7I581ap21EmerOF955rNVnW19bLNErbfdYbRB1px163Dcnehb5dp0a@fHdIblHOSvzk6w8OXgy0zO5ji3JY@khdHuEDP8Iffi77bu1Nx@jHziyufrcu8m2tulw73jMPb5upU/ketSJNOX1jmI0elbffvtpJwq1ln4WPn34Zo5a3d/rXv8jrgO@5bO@v0/Xp0woLVUPJJP@s6MouBionNu/Czk9mdeWDkfLMdzd/J9L@Hqjl8pjK7NtmX@Z5B1f@pF5wS0pPcR91l9XvYWY84qbuW14950HcQ7R2N3XnzC9sb3Lo635EhLbrV12GPKQxxbrbcc2tzfnE/XKT3j9K75PCnUaYGWLb9DdlebXW6/xlvKd50/1hHkMC2@6L4Bp@aIrW@55Vx5FGxgsJC2A5FZXTzSbtZyGSCdO7AlK@A0jO@rmxUhRt0eKCSArS6od8UpA4BW8UBvLHAb7uU@W0YozLBxIzJjmZacShFxZBV3C7iy@@Feow25kALw2SI@TtyMAINQxwUOufsRpLsICfa4A3UmbJhZBp/1luy2Vc6/OdylU3@3oLB4P3LX7RcVe62T2@UYR9yRXdzPvj75Hz7mXM2dN0xfINancRWMBPfkb4kbQxQ4XysTccSa1QEsh426YCJswY6MPnYO73JOddxb7pAXsIk6RD5ad8RLGyOMtYYizScPPtbhrDhE/uc29kIiUZV90tXI3@mjLu6BnMvBp9gahVQQyvb61Ppb@n2jLIvPHIVCLIIYoX89n3C@RylBcYq1Ns/L4@QvQJVQbuFUhP/22bBdgSBWYS1yu8R3MppWVnJfIPQlsCQ8Im@iSDQvfGhtsF593sjMDqbfR62MXj4jiQEZDLmIXNM/nPbt0C3jGid4Uw7Y6pXnEttuasEMunPd5RfxdVBLCGTxJbOAJrxrG3JtjuKU3SggeDl0nSig7yADkyMCPXU5wuvXd2Hro31L7fMXP43bUe4p8zj/qgvjjAzXztEuJazgEwE3pQTNt1VwBwA1q4rHPch/9rMNFMSpCjwqb9bRqByH@I1K7oiRg4Hl4pq9wHJwygK0k6CgleuNR9V9kB6QICwhXFvZBBYdQyMNGbbMVWCsibr6KpLE8yO1tpkKDFDEsfHogHNQHD7ITUnidDwHdFxKChVeHRuGA6LTW1rMNrKe8wAzdnW49wYzKHeWJWJ6fOrm04FReMNDPGCJ5/PbsbUXNwEcsVeDAhDuOE@rHJngOw3KgBAwA8L2VdJZnRYFlgZ2gOdxKY5eYihGoaE4F@S05ZtSXClnjLfC2lV58OL4J30GbdqA8CUNKBTkly9yTvfj1oYoqJigJexsoqKV1o3VExBzZuR7Xu/jyq@aDuBGEila9wpCbsE/uSklIIB8BRFlNL0ODyu/JtqnyC/jpgh/MZYt7OrW8z7s0JTyDePt5ZAuabO/astkCOfp1oeYMoQYoK7P@BmwcqJVpGpbEnCiyBvlvba4NfCXeahlj8ClOq2cRAKQ4AgIYV5kYn1JNDgOwKoWeaVgCnwaQZH2yopsUcRssvgDSXfZZj6AdD6YpoVI42wMSxQpn3OhqVj2EqFa/NU6FinNvOOnEJHkgp0b3YudGxsNCrGnsnlXOav0IbqYIi8mkmrYOwBYxUOWoTjY8CfaCM2XMZ7uhNwYZN7kW7Nx8NluQx2hgXHGBEqvZc3P38ajE8KInTY@LarYOm0wEK44v/JIOgf69rtG00TrjFJBPSssiEhONA1crPUyDJnF4L0HqreLaxCRATUXY3AEJN8QWVLKCzZAukjCa3CfFX9QYj4XMGwGqom1RNv2SfG@lXF1vSz4ZW9rfFJiRIhc6@DO33A2O@YmE5iCQu8ffl18V3H@eyEYQWncPy5Lvl1hycBv3@VreXMxDW2C2@sfxkOsSjdsapUTK6L3lqMPsFABBb4jdgXidUgBAhWLNv1wo3Ihk70inng9XmHDbzprlV@TZbZhFUzSMYakRc5O4F6@lTwQPQLCa4jb4vocEPWZvUlP1k4qUSBJO0yqcrQVBanTqkKCiBRR/Vq2zsboBgEBQqZOJ0W2DX6VC9sUN9aRQvQxQbP27S9sIedWZBBUmO4QbG/OH5zc5CM1UPdHuejDtacitRaSg@ip8waYfClYhbDX@bRNTs7OGuAprSFShuTW@QTiA3BI7GF2migOs9f6qHEOWCauyQ5MAqi@ALurFYJ1Xy5pbTlaTLwFIU4ekTqVlu9nB9ZVIBc2FvCh/JNN3HqwWRcBXwTPw6bKiMcRiqzP1EXSug3ra9Ymb@x97t0r38lnE33W1L/KJfxNoKl98yqR2IBvXE2bfaUyJTA8XhyVS5av0tXyK0Bmw9JSGCxKIPiMVU6oHVPlyVBQ8Gzb3@38I1VEXGvBZ7bIfj4PrsERkzsXYesvkKclOdEXOBEOMwmacuHNMdE8cgsq4PSJ8vnasm8sBxfoGFIVyh/jFJ46ESve@BvOyvjELD8kZ06NKYGY7A@EpJRmdAM4d/umUaiKD7x4J9ejiEt9FhtT8qWjR0VB//Pxhmdr@ByVh2AJzMXy31ea6TVCVv49BA7ApCiedSkDdgI0Gm6xYNVzfaLBmxT80iVAuW6jK3YFgxR3oiygqYjKtTg7Hq9Gm3ElGEPzGHw2xqribUxIOZogAcYHC@qkhNBJ1tkmM@3xXIMtk1SgVz6cI1DK4FyRW7JL0YPxAILKKZdQ4jGzriJGk5OYtViV1VJLwJUIG3ZKF6lfN3kGhdduMz8APbLZbz1bdCrZ9UibMNSWtp1DjQ1tXfMkN1zykWW/HLJMy2g3RB@Eu@MWFtzLhTfugIgz1QmFdhFlslrx6CH2oSz4vNWYYicNesDMtFDDUq2vzS50cxSaSj@V/FS3AXUCfgstf@BEyVDQnQs9qm57W5sMWnhgkRqErAd5ukD8UIWO1GMayzGrwnd1m/CW84ct71SGZJsSgYxlGPrheERwvdP7epXEpQTHxsEZWnNCCYNK2BrN4iKE@l@G8rh7KEqzpgCz58/XZUSdcbKbETcjbJ/EiRMeaDOwJY81lTNCToDihDAk@CZoCItFRbHb1lCUo/LJDsxWK3Dknc7PIj@J2gTW037GKGLsT/i4oW7fwfb1kmtcP9njWiMBeTu9RmRQ66oz7CuLlMUDLrqRCShTCvw7uN62N8XoAzWKe2V4RQpvwqMMhsiIXNt1CFho8gbPVQfyoS7ZdsF1RdYudARBVJEMOzQc9o4kK1Y9ytgjS0HGKote9EuIcEhJN1VdXePgqZpcp60DKWqX0WpwEMueJLA1KTkkt@gBRf2HVfZ9HzU1kydDzfU5LRgoEacbAc9Vt8uZJmm61AqX/i6JUoXSh@i@lFbui62kGusUD76vH35uYop27PQ7gKk2s4a4SZIupDIuoDk9Z9natWCxDW2/@AN@UbgssinBICCcyLQBMeZOoidxZDJn6/zXVUstmxVyDXaS4MWirtRl0C918jiioU3zfJQyEejBjWxoLE@C9m9z8OVDCER1SLMfGOLdAkTFeokqwT8h@QN@tCUajdbPjryBlvNLVcvkvaTjDbIZXWIHz9aPdAUododsRKMGfB3XM2R0qhYJUe2zZURaJmJdAW1Va5eYOO17KBOtRvXzODQpGxVKFccmVbBU5Nre1OjCq2E5SVJ4kjNRkxiizLvZ8nZRaW3z4pzXPE/SbDOHKo80tVcyIFejdS9tTU5HXicVE@cAFO1c27hK2jUOCWK0GcNfy5Ks8Cn7aWssnmLNaisgL@fXhbF2ZSKVPQQvVFv6VeBdTWtHc7xC42P0/xJqkNmvD2fctPPAoghkUh3gtC7x@F83SXQ/lz/UsU2i4qabX8YWG3kXfPiStBCtdHFmWob8AW6vuYwxbBtAM2d2y6zBpEjspJBMU3dqXDTJAqmc8OEU1RrsMBZ8TO8T4wx1k3qpBvUHBMkAIkpgVOBIxFx/7WhOF@7Wa2YaGUIGBEIJxpgZUCfecMNBlIV0MGpIa13ZMtFaKEPxWLWudVoBiFbH8N1h36nxmE4NbhBtVKZpkCA9FDGWkIxZ7eAsnTrOiv4eeuwKLooZ4HshsUY6sSlFWZ1n34ijIjXTqaoYXhNE4KWUSHLwZCGPs7RoGlitLUHYrFx4wyRrN5PZPr5@H2EASwlSgP@lMOco7FDQqUvKglBQDHoDeZFXCXnCGPy6iyFwbuuKicpDXV5/5LBKKxaxh52AveWUWYayjH1D@ASfW6OSonYoam7R3ruiLJKkXee8ohIh1pvVglvmBOm0Wt/BEgy15o7eZrh35/vlmNvP/ybsDvGv7F6KS8LMoMf7FQUQ6CTvtZ59KQt0yqaAimR@qK3aUh4K2JZ/UOQK3kpN6nkw2xtqPJT8TlWUyb/knaKrxYdooyzu7VC7XTnbZWZgkLIM1cC2WuxVA9AkNCEHLZD4Co6XC2pfqKUka8UU6gSXceXuiQ7N/UdNJ3c383xSp9Rq4CCdHAoOW8VS/ALDjz2hejNcL0Fw36GjJ0iKxNY8Hj8AQtaVk3VrSqGQ4h1rRz1mkvG2g9ZFvQou@wbKojNBFeItQDhBAmbilOJa0tW2Vt/kDsUW0uHBQQhg9P6wssYphhxZK5QtDZODgxN/2CjvOKTEVXM14l8pkOmzDnXp5gmOqPS9yBa3U5Ki58XF47KAp165Fr@wIWScmNAJ4y8XhSphCKUzElSDA2vy1QBzDQ5NhhLKFf9QopYpHsFSqp5kNCdRsVfrftvgacrWVKhR6k30Cya16gk/xzDHNcxuKzcdCE8ARrqlpWwDUtfXzamsS9WuPtWryBuGIAeoiAVSWjJZ@PoGEhbgS6OFI9FMMbxccbfv23QUpWAIUKm0QqSfKm4J9v2JRDCZ@sHvJgT1TZFcbiScsM1lLRgGb76QDLklTwuZR9HXmha09kOm84Ky7c/ZCgJgYt2L1z9NBtZuAo84UhscX/@4wrY@mtu7NR1a4sbZXqci5Dp/UY6ICgzOWqGsY4dh8VnCMeKdeuVVEAYVRnyw9WFJT2aiZUI10oEAzgacUFkwKxvprh8XRXqBSQ95R3Q21Jx@0lDsmRy9kUiJDN/ITiX4IAyn2oAOxZxUNHEDOyqnQL1n0jzBxo0BZj@xq5j4ZGo1EVmTefSTlBqzuDDr4ECyjYUg3KcvBjZC4SWEJQJe/975hJoeXnNJu9rV3jhUk@cQZkz0uRkClSy1F0vi9tUqvQhOhsR3lrqa9BUFBepUyAr6BQr9h3jabtqQc8y0wRarD68sC5lUY5b@rlVI6kRpmjH6OdjulC3USmZRc9rcimKU9VMo1i3dopxBbVmc/bgeLkgC/tt0i8mjLv6BOoBzIFXDFEVCdcPwLYVT0DGuFmtVwaCiTZS3ux4d2b1FMf4YKrXiecrsGfLOcQkrzo08zxRpHCYyLHEJuAVH@PRB4Anb7PdaNAEcJfls@jXMN3RVOpUmDl5kjtKccr6F/oVURoswhohwa6vuDcu6uLeGn7IoUXkrGlQDWJe@0S/AzMGNuKd4oqCvZxsUKH77SmCkKmBHTahRYXbMD62IbxYLef6ZF6pOQFWjsEYobS7UzDJ8ikjZntcgONYFpkQoTCduasGUTZoOiyJL7jIzTQIVRxTpAHpm3NOkKWzIW8GD7ZZJ0I8ZACdzlK9JkR3ZFU4bNpUgTg0NmKp@2Z7Q427vUFmG8O2ErH3uaQQWsm3gvFkKvivX35g9FrQuSOqdji3AdaIH0nNBKVxMOswrTKK8m5WVvzUZe@IyTYQh2xiQylagftM2bLjqRF9IYEweToetqXClkeE1sscWR@GyksvNT1xtmpYSGfp@lIzoTNear/N5aJfKqv8JkONqSBgoHALMyL1Q6JQvoyP9E7q3LhgM8fQshgnrmQPJ1NHQqL4PbbCvlF3RCNlfTnX6/iadbS6oTb8SufszdDeTYrH0FAcH2vahuENdzoHdBGSIHKED@sUGQcSY4S4b4lgP4tYQbaL7cjSAwEd3o//SMSjrppH5J1eDP63o0N2uWo4sP@3IUieG/4hoFlHXZt0sfU5zCNZbiZ/lCp9lKXhuSTTXp6gsCaEzpMtdfTRxTlyovBxQyu2N3A2oHNapTHbKVMfqYyfT6KwqjDvNlPJtSNfdl9b0XTtH7PjAVa8tYNV3ZTVemjSs@jNiJNITaqW6fYMg6HCdjRhq3TlhEiKNmBNjWFfoC0g@SKF6LAtfa246iZvTLxSlFWRFiHNPAf1Bbv5@O4hgTMMVrO@mSIvoW@Tupg842vMS5UPH9Lrl3X1brzdMS0dVRe73ElJ0TSdT0rVabVH7kyutW83sRcb1YXfllmPnA6KhKSPLSvONuzqmX/ndSjHHCS@nZm/Y4sqlRamZvWJ0ytfrSKMq6QqFu7nMMzUeiK73CVmwrxvSqkOSSa8zp36tEnDzNU6Pe/fkFidQlIOdxViOXzlvTL1AVVNGF7RoGzW15W4GVek19miBmnDVDiSWsJVbjoYiRxp6hJtJztQni19NxSOOiHL8M4@cL2oCk3KOa5iNSFVE5sCvGPvRQ@/WwRBg9aO0/m1eocxONUkCgUZmDowJtmgEpWmJb9gqD/cQaiePSCu2xYEuKmpXf2S1KX5WWzAIVoPQrk1Zng5smFraAIp@FjNOAjCqb3tygRu0Orl6CESNK2n3zFm999OjZVkuceR1p7lNMzFU3N2@uDuvKW0nWrxXuDa56eDIaI2xQA6eC@ttxy1n711uknjlSN5ocTABhSZs88uGUg/EukTgJDejgcociVtBkG0wJkQ9LC@vx1pcvCUYSShdZkbaDa/MSHoc2bh5izkyAthki1YfDi07SENULpgOSecu6lSK1zJeN@@6@oPUZdz1R4/pRIFitOhQ0MZhyXA33EeKRZ7FhLW4aMYuW03A3njXYCtp146fdWPJuIhruUJlnM@wPrQ@gFxD89m3jEtfDbuHEtdKgvAkP307KKFc0ucqO7XBdCKmyyqt5z9a/A1NxUlx5VsdLFYOt7tYNgjBwva2eFooCIJVMPnHi7vO4AIDeHBf@o/jkKqr01pXya7WCqnpCFfwoxn4YMUBPb/7RjQ5SIQNjLLK87B@JbcEcd459VuutbLFnalM8nA2Z81hCqzu94pZbvpo0mhrLMQ1oKZDSqgqmZyPefNIQccjQso6EppKooWI1BfZuZwEcMDjdJyvPbYfIi9qzdCN1vO2u4Xcqt6QyiC6Tdv/j3x@3ppgVG44dWW8oeCczL6upshCHH/bTbwD8OvXd5gxQqHFTZqpGja/Zaf9j367341zPyh7lOkNiCusNwhaSVzr9Dpag89YjkehIeSJviKsRbJsK6slrKCEbTGLIilqImZdTI6b00YxWLhtYvEvs/0zsivaKEj5di16IhwDaluxIuOx9IwhcXHL7CJCPzeNWH4Y8RrYQeXFtq7QpOnCbFvN5KyUP9JDSQNWUPy8uXf92hHod2fE1r6ZRU2QUzS1XMVrX5Yge0hHGWuXPYknAK4HL9VvG8c75kXiZ05P8cKdsqZH6BfZh5LKzGUZiRF61T2POL5@hl5YfEpXpedkoMnsDO1480QOUkjOFqlrp6XjV@7nHkcUDeZ0JkggnQ1UWzoNNzR@9Sbq02cB6YS60wNRMkwLuNybsRkCqwwogKWbjJ70yA3n7DQ/MTTxdftTxu83rgH2zzJhK@Xdk08/sk5GGyN1OjgZMkfGZ3V0XBD9XkXXWUqC8/rOI8kmwk8kHQEbk@bk7aTFDFoxgFnDDMVYpP0Zr1dKEeoJPy3O9kSfdjViKhVXZnYyQxLPXElDfwaUEGnHzZkuQHhchBsuilv/USW6R6SsSaSpFh/nDrVOHBjPF9IAvd6MWKS/b@l9eOL5ck8EBCLcs0VlbxgN6aRDUnsow6ZmgIwWFYK5x3aodWHYQxcN0SSHcFvw2iXkCjcT6jxLyo2xxSc1OcT68ztdmco71WfXGfnkdqF@U328Q8ZxO@F81hl@rSHj/GMBdcTeWcvoCGZV/MAtW0CP@5XeHK31cvVva7A1zuNJekJgvrrCAMZDVeia8Hi9yswlc2xFLGEyhhv91rmlvFJHnq7yvbtZPbgM9E4Vz4PL6qcvNQXuXg8WeL1t6IG7nzZPWc64@x/quS32c6UkQ05cFHVL1pv1Qu82iKM7DTQRJWYYxdB5D@/DORha5dH6bGbjeJ4hmLeeFJaeoEz2Lb8K9tb9RIC5SIL6p1MmlbkRmT2ZfGiRqifplFUKiO2sIqaDjFoLegnlXa8ht50MlJXHKdN53BAsNpJfN@q8LlqinU/GZvZLhgXIaboEMk/NXm5SS/u3cZ4nqiW9b5R2luhT5M1krfpBRRk@Wem4GWdpSnTmtWasxbeeKTNhVmFFqf@jBhz3BP3gclNgmyEN6eOBUrBSVlNGXlfdmt56k0ALotuS2gzW658eCe@zx5hk/IudGB@cFkzDp4wT@xkLUxZ4xaGT8eLEPHOoLfsnt5TKJjlVZRoVmS0OpCu0z2Q6i8dg0vkQyyerdtsF@Cx9pGw6vqHTRhTliuU/CBG7@9GvHipliamNfMfjQOsxfduR49AzIGLRZVf5uqFTmEFCRMdUu02GtpvsyuOd2hVgRuShrpXyR03Ew9hqOaExKLf0GXAaarrzFYw5Lbc9MomLEQceVdupXmTagmc1J4XoTJB5Qo15svOQji5peCbwOz7UACsS/LHysl2lTLO9x1lExYWUfjMvbhJeLbUfFxpRyXgUrQUs1ALrdStbF7KZRIFxxe28ltX26LIZZ1Ob2SYWJiUHQ@I77lR6E8LdNDIeJUwiFDICxr8fZeBzV9Ji0JRGnO1IlfCTtIdSg6nMh0RvPOQwcP30nrhjKpYZ5tGC1UpzjQc@LGUlU/OQCJA8Q0cb5jIMnqn0I2dIjwUoriPaZjkMuD6ZYrssaoW9x@14slFlQHS6Czw2zqSqZY9NcuC7rnRwZwgHLOUi8dwHiQGYHoXKgFM6e1wzgVOjA8@iwJ9KP4M0EEhN5h2L3zI51bGNf3R/TJoBM6bTc67WwNcaYZRrljPw6IFIgt@MereQIIWwitlT@qlARyjztETIvBEPWaxuQLmUHNdTiMkMzQD9yLU3k/EsL9w0yrnAmBkSVhYBcTsa0/SsUaUw899htrY8wd7DXczy0LUpZoBKTWbTGEUrRK8R2WSu7LhgQt3LjVTtgQ1OnjJkeKj@IMdDXf7oMuR1qpOBw70BpBNub4nGw9ROvPGrYOFIp99JRDnHtdejipp@Mg@Ij8gcAVWED56i5hqyp2Yhv@6BSVerviUg4QAzCxthC@PNNnJcO5G10b3hkWZXGDMXmSDPYVBsX1ffeHBEuzWypYX1rAZkewLg7QkAUTi3e0R8KN1Aq4HuzGGHAKTMnI4bt0xLqNaphvt5BB488uQk7zSkY61fo2NnWMV4MvZ0O0fk6R3RnHtua6eLuvYNfHM/TFWmEE5MwAT0@AYtO3JhGneelj335@7T9ssEqGOkrQtEY9WtjyndhM4eLNssj5rbQC1K9@bWPAYjneEe7U9bURorx1MoPYYuauhXnvfEgdAnqcbgqgxGfhpF9zU@1NNRyPDfrM0816E9EZhxR1d0n3mTTtqioHnh0sVEPZAjQ7mmPYN1nMi76qcunXpFZPely8Yr/cwZmuM/emw0a5uXbhCRUOSLyvA1joi@Y1fc0aSFTXvPJZAQ1oK5qjzXYJnfg6hzIth19x0P@HCDgB9UM7@PyHnTxKyQ28jvrXLzKBWPFFdS4w4rtdxshlf4iRrpmfPG4EChON70in4uzGnbkzN5HO/knZwOJtS4NrnU60xEMu6kfqp9VpNtOtVfjxvMqhqeUou9UkkbyXkHMgBhEb3gM5hw0eszQrOQHrzT8xqDHTulcsijC3T7KJ8bZZnHFlNCVqfMeGuRbOnpPnWGOi7TNUbo0WJWC4qH9iOIikEZTFJCrNAZdgmDwzw8FdOFFF99rVCfjh/JgMSsrQHsSlfT06AyF2OMaDt0RpTQFKfHT8cpHwv8pzt@nVFYJbqerkHvPBeQsXymLTIE0Or@fo/gcE/IPMqEsvM/hthWvadBMACK8du2rLIEG@Hx7/RNSnBuKbTDrigJPAajPfwvT/1hOs44oUefNaG3fzSWmWAIKLW8MCXuc30imzzTAkdrUYcnZm1aOkNOupHWvcwu/EhnjhSdZ1Upg7fMD3phNr2q1XlUVPp8qzztO3XTpCX7gEfTvGhuwqX7@cdjHDIRdeoJvdcyZ89a2Iq3wPt5uAReKxnxm@IbViaDoSFXaIDMtGs/i6P/bc9/6hZIm8v6ukxVYARDGfxmBEsGBfV7sk37CQwOsBpvZuebO@3N9AsSrXXLyGQyXXn60HrIXzP@x/NZ@BwLrj0psdHah2Rkw/s9cGD35XljCsu99zORi8OzC6BuBFflbdJTLZhNk6bUDY1c@1sv@kkV0Wue9@ufaXxOk/V8HAdcinc02qdhjIjTlg/JUdKQewW6dEi0H2PQkSMw4hBYsC4Jydv3pll9GZjnZ3hZ7STJHsPUQKEZAuXni5kodsPdWIjs8E2E4elX5hh5JlpVxnEtn@bOCUR/68ICjxJ5Y7t4IswbHe9WNEva3EYEFTZ@3gR1ys7zD6wGlqixnkaq3YGmrt1JAzHqrqk3nK/9YABNFkcjMgSH4ekeznaWYOI2IdGMSGrinFLvg9lgMPeYj/bwE0/TNbR4@vgOfBw/rsQ9kCT3Ay2clppMcwIpOQvwVAJHJLh5Nx/61hG0MIaRHjY/o4HJXKYs6/FF7ceXrTXT9KZ2HnGkxpIQ0vuekYJ5pJyDNN4cUT8A2Brgp6yDacc90TyMLQGxnjO/nskIc3S0Zuw7k5rdX1pwmCkL0uP3pPtTHoCj@OA1AbR1p241qSyYevXDbdpq@LZR8QDCcTCyNDqPD3OZPGzBZLQ@bV3vITMQZd0hOfysKBegHV3N6ntsvh8ThKLhyXvaYlQmAOYhHKILIF7HEmQgaLsN1rK/Sv95hhG3X1IZUGyiDoHKGIwNDwlsP/4Aj4j8fZQH6nkSjMFmwFLaxniKZnqgyeWYROYJ9y/RCc/abTmjBxlNJzJPhkj@///5Fw&quot; rel=&quot;nofollow noreferrer&quot;&gt;Click to see the required output&lt;/a&gt;. (Including all 29,903 characters here would cause this to exceed a StackExchange maximum size.)&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Because you can use any 4 distinct characters you want, it's acceptable to use, for example, lower-case instead of upper-case, or to use T instead of U, or to use 0123 instead of ACGU, or even to output the complementary strand (with A and U switched, and C and G switched).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Restrictions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Standard loopholes are prohibited as usual. In particular, it's not allowed to retrieve information online or from any source other than your program. You also can't use any built-in which yields genomic data or protein data (these would generally retrieve data from the Internet so they wouldn't be allowed anyway, but some languages may have this facility built in internally; use of such functionality is prohibited whether implemented internally or externally).&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Verifying Your Program&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;I've set up a way to check that your program's output is correct. Just copy and paste your program's output into the argument in &lt;a href=&quot;https://tio.run/##jZ1trx3XcaW/81ecOHBIWi@RnAEGiCwDhRq5ECDIAEIq88HRB5q8pC5MXWouSceesfPTRzm917NqN0XKGInkPfecPt27965dL6tWVT/95MXTpz/88Le3d09fvn12c/nV6zfPXt7@7tNvf/3gnfduX/34rfvbuxfHew/@9tnN89u7m8vXX/3mq6@/@pf86vKz6I6Iqr7@7Mjszszj94i8fnB9rb/Xz7Oi8/p/Xz9cL69fOn4/Disdcn2pD67/1/Ezr2/neplx/Xs9oo6XeXxw/VnHRdcQjuvp5fra9dQVxzjiODDWcI53r8ccI1jn02mPb6zhH5/mceX1Wa7RHn@Oyx1fitNRtUYYx0Ghm70efb1YHV88bvA6Ca3j180dhx0jifX1NZY4Pj2OPn72Gutx9uvBxyDWYNerY4Q6dWp8FevPcRtreMd9rPOGxrnW4xjNMU1M5DFtxyDWtMQac67rHgPQ8hwrcIz@mKE1C@vmj9Efw6rQmI5DjxMf3zpu8Pj3GEetM9e66WPGSvO9LhS97nZN83FXx5B63dC6bq3p8qStE9YxvEMUDtnxHeSx4Jol/dG0r9Ou9V/zskZw/cL1PMfdHp8mi7kOOS6wZOOYE8328SWm6zhszWutOdT6afGOiV8jXiupm9Tgj6EdC6Nl7Vqv15CPq1@vsuYgJMqa3mM8a4NIFteA19WPW401D2s@l9hrQdfWWpeVfKy7XpdZ11zbZ8km563SjtJGyDVXJcGNtUmOPww71oDXXR/Ha1WWtBYCILFZt7UO0yaJJQndfFHfPlYp9Eb7iOtbx6IeX9QGWHN7jGTpC766Fi005cd1GuVRZblFeNfksDXWiZdwW8Owy9cOq7UxdMV1dU65pGyNXbuxdffa1ktGkFItkbbTISxLZjR4zb@EOMu3ZEEqT4CW7xBcHexduVTVWuxcam/pO04brNy6i7UlDuWhjRRrLy@B0KrF0gVLyLVjmptNTZHkd21D75q1Rw5p1DxrJpasonylmZesam/rtMkUpb62NqMFMmpJtzbHuhNdVapNt7b0mPawlIP01ZITJLzZ@BKTJXPs25BG0sRodbAZPsk6@LittWvWepR0Ykvna7jrJtLLpc3dZTN26LqWPpHqkiXTRWMpiNLua119raSUKtIZ6Fjp92LM7LV1f6l7PLa4NnuH9vr6F62OGdBcyh5JJx17RlawEdFaanxJyFqf2mZl6WApnnUnx3UxV2v7hcxoW2xT4r8EMtZPHbSUgKZ0nWKdK5eWXZNRSyrWzGvFvejaiGsfldV5cIbOHt3bKN6QIg2p1dRmH1Eu7FhrvqXQar2zdLp26RJOr5r3k0ydJqhZ8rXJ1mhnldPHeEm51tLH2oJspkYXrSug1GyxdZU1nS2NggwUEpJWIBKrZY@0mtEMA09nbdiQFLAbyveVyYxgo9YayCTgWy2jnjFKGQeoZQ/0xcBvQ72sc0sI5TP0qBGJsURLSiWwOJKKdQuosvViHaMFWSYFx6cD@1ijZuQwyOtYhkPqvuTSLQuJ77E21BJhu5lh5zP2lK1llfJPNndo169bkFlcL7nr9EHBWmvnZtjGYXckF@u1xyf9w2mWqln7DdGXE@vd2DJGcvekb7EbhRVYulYiYotVrQ0YNhuxjIl8C1akdNpa/i77VNs9pQ45gEXUJvLWWls8tDDysdquSHLmQsfanAWbyH/Wwi6TiFVlnTQa6Tudatk9POew8QmWRiYVD6WzvWt9ldxXlGRxzpIpRCKwEfp16YSlexQSBLtYc7O1PEp@GaiQlxsoFfl/vWXYqkAuViAtUrvYdyKaVFSyLiDvS86S/BFpE1mi2uZDc4P06nwlMVtu@jpVS@ilMyYwIIIhFpFqekdprxVa09j2E7woy7HVkUslptVU4zPoznWXh8XXRg15II0uqcZpQrumXa6erVhhNYoT3Gy6HCugaxCBSRHhPWXYwuvjNbD21l5T7f03ehq1o9hT4rH0qwbGHinGztYOBaz4J3LcFBIkV4vxO3BQZ1bRuMvlX/LTiSuIUpXzqLhZWyNmO4zeiIkdEXJ8YKm4ZC2QHJSyHNoao6CZyx6NqvsgPCBAaEy4ljIxLNqG9jQk2BJXOWOJ1dWlCBKXHom2zMS4AbI4Fh5tcDaKzQexKUGctmfhHYeCQplX24Zig2j3hiYz7VnX0gBVVnWo98RnUOwsSUT0OGvP2XGj0IbL48GX2Do/bVuzURO4I9ZqQADyO5amVYyM8a3EywAQMALC8sWEs9otMiyJ24E/j0qx9RJCUTINwb4gpg3flOxKOGJcM6xVlQYPtv@Ez3ibFiB0SeIUyuWXLnJMd1JrhRWUTdAU5iyirJXmjdmTI@bIyPfcXseWXjUcwI2MpUjdKx5yyv2TmlIAgpMvI6KIJtvmoaXXBPsE8eWoKczfCEsHcrXmc51seVOKN@xvN5u0CZt9qQ6DIeynNT/YlMLE4Op6jy8BVkzUslRpScKdCOJGaa8Obg3/yzhUs0b4pdqt7EQMkNwRPITalon5JdBgO@BWpcArGVPcp5Irkp5ZgS2ymEkUv5ykNWwjH7h03piGhQjjLAyNFQnvc3lTI9mNhUrhV21bpDBzbT@ZiAkuWLnSvVi5sdB4IdZUFu8IR5XeRMumSIsJpCrWDgcsRkOGXXF8w5O1kTcf9vF0J8TGeOZJvFU9Cn6W266OvIFyxISXHs2cL307Gh0Thu208GlShdZpgXHhgv0rjaR9oKuvMRomakeUMuozw3IRiYkqcRejPQ1FZFFo7wLqzWAMAjKA5kYYbAGJNwSWhOKCHkc6CMKjUJ8x@iCEfDbOsBGoxNZibdM7xesW9qtjR8E7emv7JyFEBMvVNu68w97METeJQAUQep7wdeFdwf7PBmDES@P@UVnS7TJLdvx6D1/TO4NJYBPUXp4QD6EqmaCpEQ6ssN4dtj64hTIo4B0jV3i8Nim4QMGkVW6/UbGQwV4BTxyPVujBNx21Sq9JMtNuFUjSQgwJixydgL0cM7mc6JIj3HZxU1ifDaLOmT3hSVtJjRWYoB0kVTFaC4LUblUiQUCKoH5NW87C6AZxAuSZOpwU2FboVQbWk9xoWwrBxxjN6L2@oIXsW4FBQGG6Q3x7Y/74yUk8EgV0vyAXnVxrKlCrATmwntpvOJM7BIsB7LU/LZM1e6ft4CmswVIOyK39iYuPg0NgD7KTWHGQvdSpyjFgGLgmOjAIoPwC6K5mCNS9GVJbcjSZaAtMnDQieSpN32kF2lkgJzYa50PxJ4vYsd1mDQK8CJyHRZUQly0UUZ@hiwnrelBfozbzxeyt3j3zOfHsWJ829K90Ce@Ma2rd3AokepxvVE0afSUzJWe4PDlKlzSX0mj5CCczQWlJDAYpEHRGKybUiinzZFdQ7lmnr@34Y7KIqNYAz0yB/ZwPrMEWkzsXYOsLSNMSnOgCDoQHmcSbcuLNNtE4cspVQOlj5eeyYd0YNi7AMYQqpD/KITx5ImY80TfslfKOaV5MzDw5pjHERH94SAppSjeAcrduKpmq0YHL3kn1yOKSn0XGFHxp65FR0F9vb3C2BM9RegiUwFgs/@/UTLY9ZMXfheHAmRTE005lgE7gjQ62GKDqMz7B4EkIvsIlnHLdRsbIFQjSqBNFAUlGVKrF0XF5NtKIK8YYmMfOZyKsSt6OCClGk0uA8IGCOijBdBJ1psFMazznYMMgFd4rJ2cLhCI4Z@Sa6FLw4GgAucqTLiHFY2RdSYwkJjFq0UqrTS4BVSLfMCd1MfnrJM4g8Zpp5AdHj2j2mM8UnEp0XeImFLmlTsdQZUFr5zyJDZt4pFkvmyzDMloNwQeD3XELjd/LwBN1gMWpyDGFVhFhsFr2aHvsRVpwa6syxE4YtB0zw0IJStUem1Voz1ZIMv1k8ie7jVMnx6@B5ZdzomBovDsnepTd9rImEbT8gYZqMGA9nqcTxNur0JbaSGPYZsXgXZkGvKX8QctzMkOSTZFAyjQMvVg4In69w/vYmcQmBcfCgRmac0IKg0xY25tFRcjr3xHKxu6BKI2a4phtfd5OI2qPE92UsBn59hM4scPHtSnQko2aShlBJ4BxghmS@ybXEBSLjGKmpSFIR82ZbZjNVmDLO5yvhn4ybBNQT@sZexFlfcLpirx9jm8fO7hG9RM9tjkSgLeVbY8MaF15ht5pkTB5wEk3IgFFSuP@LXc9LW@y0cupkd0Lu1eE8AY8ws4QEZFzuzYBDUye@HOR4/LBLul0wrUF1jZwBEZUlgw5tDvsFZmoWPko@x4zFUSskuiGvwQJh5C0J6urMRaaKol10jyQIHc5XA02YliTjNs6ITkgt@ABWf3tq/S@Hjk1gydFznUrLRAoAac9BJ6V3Q5HmoTpYius8LcJlGIgfYDuFdJKfbGUZGMd4oH35fafE5uiFVv8HZypNLIGuUmULqgyTqA5PGfa0rlgoQ1pvXhyfmG4NLQpuUG4cALTCo9x7mT4JLZMxmwd/zprqWkzQy7xnUR4Malr8jLwl3LiOKyhRXPpKEUiwIM9tKEyPQnYP43BhzchLqpNmvVAYe8aR1Sol6AS9BOUP9yPNEUj4fpZkSeuZZ2haom8p7S8QBajFdiBs@UGXXEUMwdshKOG@1rOZ0jolC2SR9VbliFpGYh1BjSVrW1sYqXvIQy02quvjaGJ2ShTKjtWkwWbjFxam9q78GyYTjIhPMGZoEkEUeKdLHk6qdSWeWHObZxnwmwjh0qPJLlXIiBno3UvaU5ODr1OLCb2AV60Y237VeKusUkgo1XZ/TUtyQyfsJ42x2Iz1sy2wuVl/zoxls5MTGYPwgvZltwZeGfT0tYcrZDoGP0rogaRfXtzjpp2HBgkgQyq4zi1Uzz@tSeIzq3yizy2QVTUdPLhyGJC7wIPb4IWrJUGZ6SliB/A9pJhlN22wmlmz3YYNahJEjsoJNLUndovqokCyZxwcpJqie9QJnxU9ibjFHmT2KEG@QcIyThEpMDIwBGIOf@awzltsFvPmWFkABk8EFIw9plx6oQb9mAQYSIdiBrUWme2DLQGzFA0VrRznWYAwtWx@26z79C4DKeO3yDYKAzTQEHaXkSZQlJGtcfP0q5jr@h94LGVcJHNwL@XJ5ZQJ3pSUWbnWTeiqAjNtKtiBC8xIuBSCiTZeJKQjVmaNI1brSWB2KxYuAdJ1mpOZLvx@t6AASglngL4L4k5W2Gbgpy8pCQIBkXBN5AW2ZmQTYxBrzsZAubWzpgoPZTh@YcOq7CiIXtYCVhbVhhlCNPYewCf8c/NUZmk9kDU3KK1dwyzSJR27fMYlgi23qgW2DI7SLvV/A6moMg15/Btint3vB@2ubn175jdwv6F1UswJMQMeDx3UgCCzsS95rM3aYGctClOxUR@sK3SVB4S2KZ/kOQaf2tyUluDWd5g48Hkd6iiSH4H7yRdTT6EG2Vybw60mzF7O4wMFFSWIhuYZovtbACchMTkwAUSXsH2ckLtMLWkZM2Ygp3gNK7UPdYhuf9h00ndVW2dlJNqteMgnhwMDktFk/zChy9rQtVmOF8C4T4Hjq7xpAhsjePxAieknTlpl6YEDCm@0VbUZSQZbVtwXVSr4LTvuLLwTGCFeAkgThCAGTgluTbhapqrb3CHZAvhcKEg5GBkn1BZ@yl2OWauYLYkSA4KTvhhwrxjk2JXjdUIfyVBpnMtr0s3j3GEpe9JNrmdlBQ1L04ehwk8sdO16IUeQMaBCZUwvrggVBFDSJ0RoNo5MCdfBTCrwCGJUAZyRT@EoGWSR6CUyifZmxOp2LO1Pk38adLWZKhh6tXwFwxqxSZ@lt0c5zAzzdy0IVwEMMItTWXaIXV@3ZhKO1Xt7FPsjLzdEOgAMWSBSS0ZLNx1A2MWwEuHC0egOcnwcMbduq@nomgShjgqMaUQU081agn0fZNEEJk4@e8GBHWloVz2UDhBm8NcMATeeCERcoqeNmAeSV9zWuDaF5HONsqWP0crEICxddten4oMzN3EPWJL9fjx8c4I0/xobm/NaVESV472cjJCzvMH6YhhgYFZy5TlyOGg@Exh2eOt2OlVPAwyjOhg88MmPKkaLhOskRwXwNGAAyoTZiUjmXFSUYQXiHQRdwzPhpzTKQxFnonRE4qUwPAe2qkIH5jhyTbAQzEmNZy4Ah2VUiDfU1M8wcKVHczcZFch8ROpRQ3JmsgjN6XUPosTszYOBNtICMR96mJAI2ReBrCEwOvPHU@o6GEXl6SzXemFgzW5FEKVgT4XQ8CSJfdiSlzvXKUnwcGQ8M5QVZMuEUCgDoXMoG9coffI01bTdjnLSBtoserwwrSQmmxMU9/VMkk5VppijNwKNnPSFiolM6l5ytyCZJT5UzDWTd0inUFuWZh9OR8ulwT/r6daTBq10Q/kARwDKRsmKzJQNwhfkzjFO0bVIq1KGMRwE6XtVo2O5N6kGJ@GTK1wnjB6Br2znMIa5UacZ4h0FCY0LGEJqAVb@KmDQBOm0e82aQJ3lOAzqdcw3pARU6lUo@AF5ijMCcdb8F8IZTQJZRcRbK1VvWFaF/eW4FMmJSpuhYNqB9apb/gLIHNgI64prmHQx5YNEhTnuhIQqRhnR0Wow8LMET@4Ir5ZJGTrZw5UnoCsRiCNQNoM1MgyeIpA2axdIFjmBU6KUD6dsKnGp0zCdFAUSXKGkWkCqFFEQx2Az4x6qikKK@JW/MF0ySTejxEAB3OkrwmRbdllThM0FSNODg03VfWyWQOPu7xDaRnMtwOy9L6nEFiebeLOG6XgWjP@ROyRoHZCUt@0bcFdx3pAPZcrhYqZCvMYJFHazczKc07GmjgMEyHIFgaosjGuflI2bHfVgb48gTJ4WDloTQxWOjS8hPaYwiicVnK6eZOrDdOSIoPfD5MRnmmb87V0HtylMOu/xpFjNAQMJA5xzIi9YOiEh5FD/ZN3b14wPsTms9hNaPccmEgdDo3y@8AGvVPZMRwh68uKnLq/mso2J9Qqd4rc9Rm6m5pksfgUyx1Iy4fsDnk5G3YDkAPkyDugXqwgRJQR7rAglvkgLg3RIrouRw0IvHV7@F/aBmHeNDT/idXAT2N46C5XDVuWUzmy2ImDfwxpFlJXz7yZ@jzFIUhvjP0MZ/hMS0Fzi6LZ3kVhSgiVIRmu6qOIs0aFSsvhSrm8kbvBKwd1CoOdEtUy@9jBNDyrGMSdYkrpNqjrrktL6q4dI@bowFatLc6q78psvCnSMOvPHiOWHlMr1u1uBEGFa/WQodqVEwYhphCzRhjaGfrAJS@oUFmmhbc5NzmBm8MvGKUxnhUmzjUF1Ae5@HuvIIQxNVcwv5skLaRvgbs9dcDDPQ9BPlRMt0veXbe1a8M0dWRVpH5XQAqvadGUNFazLaJPsVK71MxapJwfdlVu2HZuR3RgyqFlTfGNqzoqd/rdTDHbCU@nem9Y4sKpRbGZPWNUyseuSCMr6QyFq7mMMyUaiKr3GrCgdzWkWYcEk55ndn2bJeDia5Qe9@7OLQ6gSAc7ijEdP2a/0fUCVk3Yu6BE215Tmu5mp2pqjd1aIGqwahsSU9jCJUdFkmMKeuQ3E5ypTha9OhmPUUSk47d4zP4iJ1CTznEOMyGpCsgs8BX7ftTQu3RwALA4Ma3PxSuk2ckmiSCQ0MxxY8a3SAilUxKfoFVu7iGvnThiSrFNDnRSUat6otVO8jPShEF8NQDt6EnLU4ENUksZQFDPYsRJDozy2@5c4AKtnFh9AES1K0nXzJm9d6rRMi0XO7Kr01ymOTZU2F1vu1u7KK1ruHg7cW1w08aR1hplghw4F9KbtluO3jNcJLHTkXzR5GAMCkXYxpftSm0n1ikCB7nTGiiMkbgUBNoGbUJUw7LjeqTFyVuMkYjSYWQkXfBKj6SNkZWLt@gjIwebaNHsw6JkB2qI0gWVA9K5inoyxW0ar4t3nf2B6lKu@qPGtIaBYm/RpiDth02E24N9TLLIvZiQFifNWGWzCVgbrxpoJeXao2ddWFJO4pquENPOp5gfSh/wXAfms24pp74SdA8mrpkEg5Oc6nZgQjmlzyhzcoNTiThVVlN6fuLi98BU7BRnvlXBYuZwuoqlx0MwsT1NnpYXBMAqN/mkxZ1ncIIBf7B3@I/iEKsrp7QuJrpqM6Qqh7iCHp2GD2YcUPPbu0WTjcSggcOscj@sM@UWI843K87pWjNbXJlKJw9Hc@YcToLV9V4jlj11NFNoa1@IMcCmg0qoLJmUj3HzoYKWW4SEeSQUlQwXYqi@0M6lJHAH3E7H8dpG@wHyhq05cKP5vOlqIZeqJ6AyHl1P2f@JPl97ThAqF5w6M55AcA5md1XT0EJsf9NFvIXjl7vucNoIDSxu0EzZsDqnnfq9ervzwrkelDWa7g2QK8w3GG9l7FpOraM5@LTl2BAaRJ7hVwxqMVG2mdUiVpDCNplFlhQ2Eb0uarabw0YhWKhtbPEZ2T617BpuFKB8OhddQxzD1TZjRcJj6hlN4kYts4oQ/Vw0YvrhkNfwHZReTPMKDZo2yLbZTI5K@TE1lBRgjRdfu@9d7nIE6t1psdW7Z1Fi5GRNTVfx3IcpyG7SEfa1w5rEHQDbjZfiXMaxt3kQ@BnTk71wpazhEepFentJYeQy7IlhelU9Dzk@Tk0vTD6lqtJ9MuBk5jTt2P1ElkshOttQXXNKOs50P9c4wmgwplPjCUxlA9mWnIIbCr@yx@pTZwHoBLvTDVGmmRbucva0zZCzSoMCULqa1pNuueGYneInmibuan/S@LnbNYD@mSZsprxr8qlH1s5I@0g5FZw0mSPiMzt6VBD1XkHV2aQEa9edDyUbC19D6Rhno6Y4uXPCYhqt2IFpuxmysVD7p71eKESITfw0OdsdfdLZiIrJuNKzkx6SaOaYMPTUoARLWy7OdALC7SJccBHc@omV6BqRMCeRolp0nCvUcuxAub@QGuhlT4tF6vua2odNng/XRAAggj2bVLab0RBO2iSlmzL05Ayg0cJCMPaYNrVODLvpol000SFcFtxWCTPCng517iXlwtjgTEkM0T5/TlWm4k7V2eW0fHK5UO6uPl4h@3Fdg/m0I/xou4z1zgRqi@29Nq0j6FVxcrcsAVmuV9p9tNrTlefSYHOcy5305IF5dIEAlJuqUDXh9noxPZeMsQW2hM4YLvRrx5bSSjn0dKXvXc3qxmV472Tx3LgsTnWpk@DOdmOBXdsGHzhzc/MU5ZSr/4Ge02Q/Z0qmyYmToi7J2r1eqN3G48icApohJU4ziqLyHtyHfVCUysP16emN436G@LyxqbDUBE1n3/BRoLeuJ8KZG0pQniplJjNXArNrOh@apOpOOmGWAmQ7s4ipICPXAl9CcdcuyE0HA2Hm8aTp3G4IFBvKrwt1dhUt1s47o6f3yzQLkNJ0CqQ2mz1cpDbl3/bz3FFtwvuEaWeKPkne6awVJ69omk/GVNyUozQFOrVLM9rkW/eUqUFWQUXJ/8MGLNcEnfxyQ2A9TRqmjgdIwUxZdRnZVXVteGt3Ag2AblNqp7FenmokvM5uYzLtX6zEOPGUYNp9mnZip7YwYYLXKHQiXpSYew6laf/ElmLZTEwV042KyBYFkjGwT013FrfBpPJhJJ@o2mUX@GdTR8qioxtyyoiGuWL6D0TEzNzwq5tKmWJqIe9yO9DYSF/n0HGoGRCw6LSrdF1RKUwjIazjZLsNhqaL7MLtndIZYFrkwa4V80dFxEXbaimhslNu6jPO6UDTOZegzWm47JFOXLQ4cKvanOzFdFtwr@YJIXI6yGyiRm3a@YCOTmm4J/DePuQAYyj4ZeZlOks5xfZuZzEsLqj0Pf3iasyrqfblRCMsGbeiNYGFXGDsamXzQno6USBco3Z2yWq6dVmVo6me3iYmJk0MBsW3XKm0O4S7aKTcSphAaMAIEP/ckIH3XYiLQVEadjaHqoSepDyUHExMf0j4xkUMA9ZP7YkrpkYyB3k0YTWmuMYNH5q0kqF5QARAnqKiDXEpGs/E1CNPkx4TUJxHtMyyGVB9EsV0WtQMe7fbcWejmAbRU13gtnEGVU17TIID33VMBfc04QClbCievV1iHEy3QqXBKZU9zpmAqVGBZ1LgKdNPIw0IUjX9joVvGZzKkY13qj9qigGnTaf7XLUdX3OEYa6ZzsCjB4YSvHvUu4QEKoRZzO7STwZ6iDKbSwTNG/KQyep2KJuUY7sLMZGhEaATXbunM57phT2Fck4wTg8JM4twcXM4plOzRpbCyH8OstXhDvZu7mKUh6pNIQNkaqY3jb1omei2R1bTV7acMCHv5UKqdMMGB0/TZLjI/kDHg12@4TLodcqT4Yd7AQgnXN4yHA9DO6ONdwYLRVq5dyLMOcYeGypK6sncIH5I5hCohvjgLmrOIbtrFvTrLJB0leqbAjIY4PTChthCe7MeOq6VSFvodvNIoyu0mRuaIM9hkG1vZ994cES6NDLFhXWvBmh7csDTHQCG4ZyuEfGmdAGtGrrThx0AkDTzVNy4ZFpEtZxsuJ9H4MYjm06yd8NUrOUudMxpVlHujF2ZjhF5esdwzt23NaeKOno3fHM9TMR0IawRAQPQ5Rs07ciJadT5lOy5Prc3t18iQB5jyrrwaMy69TalmtDRg2mb4VZzPa4WqXtja26DMZXhbu1PWdEUVpa7ULoN3bChd3reHQcGPplsDKrKzsipULR34UNsHoUEf/fanOc6pDsC0@5oJd2rdqeTNCmotrl0MlEP5JimXJXuwVoO5J31U5VO7CSy69Il4zH1zNM0xz@yLDRtmRdvEJLQ0BcV4asdEXXHzrjDSRs0bT@XQERYE@Yi5rkGTf8eSJ01hF1X3/GADxcI@EE1dX5Ezu4mZoZcD/3eLDe3UnFLcQU1rrBSyU1P8wo/UWNq5rwwKFAgjt29IrcKc9i26Uxux1vzTXYHHWqcm2zydQYiaXcSp2yf2WQ9leq7xg1kVQVPk4tdqZK0J@cVmAYIDekFnUGHi2zvEYqF9OCdrF0YbNsplsM8ukC3D/M5YZa5bTEpZFXKlJcWypae7hNLUMtpukQI3VrMbEHh0H4EUdAog05KkBVyml2C4NAPT8l0eYo7vxawT8uPZIBiluYAZkxV0@ag0hej7NHmwBnDhCY5XX46TnhboD9d8euIwizRdncNaucZwLTlM2wxTQDN7s/9CA7XhNSGTEg7v9PENmI/DYIGULTftmSFKdgQj8/dN0nBuaTQCjuGSeA2GOnmf/PUH7rjlAN6@Fk18PaJYzkdDHFKTS@cFPdSfQKb3NMCRWtShztm9ZR0DjjpQlrXMjvxI545VHSeVaUI3jQ/4IXqqVWNnEdFTZ1vhLt9T950wpLejkdSvGhswqn7eucxDtMRtWITvds0Z/da6BhtgfZzcwm01kTEu4vvoDLTGBpwhQLI6XbtZ3Hkj9b8lLeA2hzm101XBVowhJ3facEyjYJyP9km/QQGG1i1N7PynTvNnu4XBFrtkpGaznTh7kPtJn9J@x/3Z@E8Jly7U2LCtR@QkQXP/cCB7h3nlSEs195XDV0cnF0Oag/hKrxMeqoFvWmmKLUHRo4@54tOoSJ8zaX98tSNz2Gyno9jg0vyjkL7KRjD4qTpQ1KUFOSuBN1USKQfY5BDR6DFIW5BOyUkbZ89xepNwzw/w8tsJ1H2aKaGFzpNoPx8MQPFLrgrE5FtvrEwPP3KGCPPRIuYdlzN2Vw5AemvnVjgUSK7bRdPhNmt412KZkqby4iAwsrPmyBPmfP8A7OBRWqMzZFKV6CparemgBh2V8Vuzpd@MIA6i8MRKYxD8XQPRzuNMXGZkGBGKDWjnCbfB7JBY@4yHu3mJ@6ma9di8@Nz3Mfy40pcA0lwX8DCU1Iz3ZzwlBwFuCuBLRLYvIsPfesQWmjDSA2bn9FAZy5DlrHxovTjy9qcaWpTcx5xpMKSAaR7PyMF8Zh0DtR4Y0S5HcBUAz9FHXQ7zhrOQ1kSIOs58suqaWEOj9aIfU6nZteXBhjmpAWp8dvU/Qo3wJF98JzgtGVO3qoms2Do1Q@3SbPh00LFAwjLxsjU6Hl8mNPkgxbUtNanrGs/ZAagLHNADj8rygloW1ej@m6b78cEwWjY9J40GZUOgPMQDsEFAK9lCjIuaLoM1rS/mPrzaUacPiSmQbGBOggqZWeseEhg@vEHaETo76U4UM@ToA02DZambIynaE4NNLEcncjc4X4HOoOzZprO6EZGlWOZa5pI/vX/fvbgwdNvn9xfXr569fu33//rk9@9vPnt57/87998cfn7v7/Ey5eXm5c3393cvXl9ub27fXP75OXt/7l5dnnz6vLZp/ri/c0fbu5f3/zz6fsP@@FHn3/zxYPbuzeXm/v7V/eXLy@fffHg@t8fXt0@uzz99ubp73/z6v7frid7ltdzPFonevr4weXyf69/L7fPL48ePb386svLw8vDx5c///ly/e3Xl4f/@fDxccyFw67/fX9/vcbzRz/76uuv/@fX/3g5Tvbk6Zub@8vDnz97eHn19s3l1fPrQa@@v751/@Tuxc2n/373s4@vl/qCE3h4n/PGX64//nLc@nuDfLBu57snt3ePjhdP7l88vZ7oGPgvfnH95Q@PH1wHpd9v776/XvnLi@7rF48fHZ//9vNvjquut8Iv0i/KL/r64jj//c3zm/ubu6c3/3xz9@LNt7y7zvzuO/z87vb1mye/v7k7hpqv3t69Yc7XZP7y8jdfrhGv6dPk/WjqvvrjdeJe/uny6u7mOPLtseaX29fXcfzvt7f3N8@OiWPWbv54@@bR5/rlL9cr/Gio1wu/fnP/8ubu0Tw19/Ea5Ax9H7HefHwM8z@@vX15c3l0Purv/u7y6OG/3z28fPmlvv3b06efXKfzdDfnTz75Yr91/so3mhJGfczL@WrXGfrRjfz0ZL30bfz82ceX19@@evvy2eV3N9ffJF6n03783klPc/jLPYdx8T1eZ@bpt/d77j6@PIzrJvhkP4P4urMu@deOz/ePr792fL1/fP@14/u94x/MDPXr27sXS5TXRnx9@flT/X95ft1oh@q@ztGapfj4kh9f6uNLLwF4XyuE9suP384Pv10fflsnXxolDkHKx3/@s17VvOrjVc57Oe@VXv20IPzrtzcfvNcn9zeXu1dvLt8/ub3/j9vXN5dn1@15e/f0zafv3/r7asji@flx@fXRGsGSmX9Y93PW1o/e3r2@fXF38@xxHBJ@lZYvfuqAXAfkTx9Q64D66QN6HdAPv1j7/n3NHw@PAw799qFPc32aP/FprU/rJz7t9WkfFz4k6dHt2s2X28uv3tGKl9uPPpKRwEYcEzmi@tvbb46N/uF7e4TG@ObxN5iZbWgu7yvYjz46xnL5gCG6PDk09bObP141wj9eTdHTh5dDK3x8mQucvnmM72/@/wd0utZVOx8ydmjsq5V7cxXF56/e3r8rjx/P3@uc/fzpT4jfEsGXr28@cJGt3Y770Pc/sDynQZ8n@/E3@wp/ebAX5H1r9eur8H/2gWn3OD7/bFbgfIeffHK5f3t3ub7@7vbuyZt37NTo2f92HsT697DwVylin703mr3d1lc9Ne@qgH/76ut/@s0/ffU/fmwZP7NWX1c5HIYHP/zww1d3h1vyp2OBrv7Ii/sn3z18fTgoh6fw7dVAHC7VdVZvn//pcvvm0//39PnLJy9e//DJ/3ry8uX13@ufpQf@Cw&quot; rel=&quot;nofollow noreferrer&quot;&gt;this verification program on TIO&lt;/a&gt; and run it.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Other Info&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Some facts that may or may not be of help:&lt;/p&gt;&#xA;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;There are 29,903 bases in the sequence. The counts for the individual bases are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A 8954&lt;/li&gt;&#xA;&lt;li&gt;C 5492&lt;/li&gt;&#xA;&lt;li&gt;G 5863&lt;/li&gt;&#xA;&lt;li&gt;U 9594&lt;/li&gt;&#xA;&lt;/ul&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you simply code each of the 4 bases in 2 bits, that would get you down to 7476 bytes (plus program overhead), so any competitive answer is likely to be shorter than that.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The source for the data can be found at &lt;a href=&quot;https://www.ncbi.nlm.nih.gov/nuccore/MN908947&quot; rel=&quot;nofollow noreferrer&quot;&gt;this web page at NIH&lt;/a&gt;; scroll down to ORIGIN. The data is written there in lower-case letters, and 't' is used instead of 'u', apparently because DNA sequencing techniques were used.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There are variant strains of SARS-Cov-2 known (the base sequences are slightly different, and the length varies a bit); I believe the one here is the first one sequenced, from Wuhan.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Groups of 3 consecutive bases code for particular amino acids, so it might be useful to analyze the data in groups of 3. But there are non-coding areas where the number of bytes isn't necessarily a multiple of 3, so you may not want to just divide the data into groups of 3 starting at the beginning. If it might be useful, you can find more info on the structure of the virus RNA &lt;a href=&quot;https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7161481/&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; (but this probably isn't needed).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Disclaimer:&lt;/strong&gt; I'm not a biologist. If anyone has any corrections or improvements on the underlying biology (or anything else, of course), please let me know!&lt;/em&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Happy golfing!&lt;/p&gt;&#xA;" OwnerUserId="59825" LastEditorUserId="59825" LastEditDate="2020-06-08T07:03:11.697" LastActivityDate="2020-06-08T07:03:11.697" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="19011" PostTypeId="2" ParentId="2140" CreationDate="2020-06-07T21:57:02.903" Score="2" Body="&lt;h1&gt;Pi or Phi?&lt;/h1&gt;&#xA;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Given a positive integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$n \geq 10\$&lt;/span&gt; as input, determine whether &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; occurs in the first 100 digits of pi (after the decimal), the first 100 digits of phi, or both.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Reference&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;&quot;The first 100 digits&quot; refers to the 100 digits after the decimal place in each number&lt;/p&gt;&#xA;&#xA;&lt;p&gt;First 100 digits of Phi:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(1.)6180339887498948482045868343656381177203091798057628621354486227052604628189024497072072041893911374&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;First 100 digits of Pi:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;(3.)1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You can assume that the input will appear in the first 100 digits of at least one of the two numbers (pi or phi)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Input can be taken as a number, string or any other reasonable format&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The input number will have 2 or more digits and won't exceed 100 digits&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Output should be one of three consistent values: &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;One to represent that the number appears in (the first 100 digits of) &lt;code&gt;Pi&lt;/code&gt; (but not phi)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Another value to represent that the number appears in (the first 100 digits of) &lt;code&gt;Phi&lt;/code&gt; (but not pi)&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Another value to represent that the number appears in &lt;code&gt;Both&lt;/code&gt;&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;: &lt;code&gt;113&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;: &lt;code&gt;Phi&lt;/code&gt; since the substring &lt;code&gt;113&lt;/code&gt; appears in the first 100 digits of phi, but not in the first 100 digits of pi.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;: &lt;code&gt;793&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;: &lt;code&gt;Pi&lt;/code&gt; since the substring &lt;code&gt;793&lt;/code&gt; appears in the first 100 digits of pi, but not in the first 100 digits of phi.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;: &lt;code&gt;84&lt;/code&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;: &lt;code&gt;Both&lt;/code&gt; since the substring &lt;code&gt;84&lt;/code&gt; appears both in the first 100 digits of pi and in the first 100 digits of phi.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;113 -&amp;gt; Phi&#xA;793 -&amp;gt; Pi&#xA;84 -&amp;gt; Both&#xA;618 -&amp;gt; Phi&#xA;141 -&amp;gt; Pi&#xA;86 -&amp;gt; Both&#xA;3398 -&amp;gt; Phi&#xA;3993 -&amp;gt; Pi&#xA;39 -&amp;gt; Both&#xA;374 -&amp;gt; Phi&#xA;679 -&amp;gt; Pi&#xA;35 -&amp;gt; Both&#xA;072 -&amp;gt; Phi&#xA;078 -&amp;gt; Pi&#xA;117 -&amp;gt; Both&#xA;1798057628621 -&amp;gt; Phi&#xA;71693993751058209 -&amp;gt; Pi&#xA;803 -&amp;gt; Both&#xA;811 -&amp;gt; Phi&#xA;10 -&amp;gt; Pi&#xA;11 -&amp;gt; Both&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="65425" LastActivityDate="2020-06-07T21:57:02.903" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19014" PostTypeId="2" ParentId="2140" CreationDate="2020-06-08T13:49:49.053" Score="1" Body="&lt;h1&gt;King+queen vs king checkmate &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot;&gt;chess&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;You are given a chess position, represented either in &lt;a href=&quot;https://en.wikipedia.org/wiki/Forsyth%E2%80%93Edwards_Notation&quot; rel=&quot;nofollow noreferrer&quot;&gt;FEN&lt;/a&gt; or as a two-dimensional diagram like this (the example test cases will be using the latter format):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;...k....&#xA;........&#xA;...K....&#xA;.....Q..&#xA;........&#xA;........&#xA;........&#xA;........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In the examples, &lt;code&gt;K&lt;/code&gt; represents the white king, &lt;code&gt;Q&lt;/code&gt; represents the white queen, &lt;code&gt;k&lt;/code&gt; represents the black king and &lt;code&gt;.&lt;/code&gt; represents blank space. You may choose different consistent values instead of these characters. You may also input the diagram as a list of lists or in any other way that is allowed by default for two-dimensional arrays.&lt;/p&gt;&#xA;&lt;p&gt;It is white's move. The position will always be reachable from the starting position by a sequence of valid moves.&lt;/p&gt;&#xA;&lt;p&gt;You have to find the minimum number of moves White must do to checkmate Black, assuming perfect play by Black.&lt;/p&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;p&gt;Incomplete: too many test cases for 1 and no test cases for &amp;gt;1.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;...k....&#xA;........&#xA;...K....&#xA;...Q....&#xA;........&#xA;........&#xA;........&#xA;........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output: 1&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;k.......&#xA;........&#xA;..K.....&#xA;........&#xA;........&#xA;........&#xA;........&#xA;.Q......&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output: 1&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;k.......&#xA;..KQ....&#xA;........&#xA;........&#xA;........&#xA;........&#xA;........&#xA;........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output: 1&lt;/p&gt;&#xA;" OwnerUserId="36445" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-06-09T03:50:21.740" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19016" PostTypeId="2" ParentId="2140" CreationDate="2020-06-09T00:43:47.883" Score="7" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/261484/66833&quot;&gt;Complete the landscape&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2023-06-03T01:28:49.790" LastActivityDate="2023-06-03T01:28:49.790" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19017" PostTypeId="2" ParentId="2140" CreationDate="2020-06-09T20:25:46.683" Score="1" Body="&lt;h2&gt;Underfull \hbox (badness 10000)&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Every TeX user has been warned many times that their &lt;a href=&quot;https://tex.stackexchange.com/q/138&quot;&gt;hboxes are terribly underfull or overfull&lt;/a&gt;. So much &lt;a href=&quot;https://i.redd.it/z85vd87240j31.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;badness&lt;/a&gt;! This challenge is to rate how badly underfull or overfull a line of text is for a simplified line wrapper.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Task&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You're given a space-separated string or list of words. Output the minimal badness achievable for the first line. &lt;/p&gt;&#xA;&#xA;&lt;p&gt;The text needs to be wrapped on a line that's 10 characters wide, but it can only be split on spaces, no in the middle of words. Any letter that spills beyond the width counts for 1000 overfull badness each, and each leftover empty position at the end of the line counts for 1000 underfull badness.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;For input &lt;code&gt;&quot;Overfull hbox&quot;&lt;/code&gt;, we can keep the word &lt;code&gt;&quot;hbox&quot;&lt;/code&gt; in the first line for 3000 overfull badness, or wrap it to the second line for 2000 underfull badness which is smaller, so the output is 2000.&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;0123456789&#xA;&#xA;Overfull hbox&#xA;          ^^^&#xA;Overfull&#xA;hbox    ^^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Note that we don't care about badness of the second line.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Details&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The input is a space-separated string or a list of words made of letters &lt;code&gt;a-zA-Z&lt;/code&gt;. It won't have any words more than 10 letters long, or be more than 20 characters in total. It won't be empty or have any zero-length words.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Test cases&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;TODO&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox:&lt;/strong&gt; Is it OK to have a multiplier of 1000 for theme? Should the underfull and overfull badness penalties be different, like 1000 vs 2000?&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2020-06-09T20:45:53.857" LastActivityDate="2020-06-09T20:45:53.857" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19018" PostTypeId="1" CreationDate="2020-06-10T02:12:07.810" Score="8" ViewCount="338" Body="&lt;p&gt;The community has encouraged users to post a proposed challenge to the Sandbox for a few days before posting to the main site, to get feedback in the interest of improving the question and and to iron out any problems before the actual main-site challenge is posted.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should it be considered a duplicate if somebody else posts what is essentially a duplicate question on the main site during the period that the original question is in the Sandbox?  In other words, do you get dibs on a challenge for at least a few days, if you post it in the Sandbox?&lt;/p&gt;&#xA;&#xA;&lt;p&gt;This situation has just arisen (you can check the main site for the two posts, since I've now moved mine from the Sandbox to the main site).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;It's up to the community if you consider that a duplicate or not.  But if the community does not deem this to be a duplicate, people won't use the Sandbox in the future because they'll be wary of being undercut.  (I certainly wouldn't use the Sandbox again if the duplicate post is allowed to stand.)&lt;/p&gt;&#xA;" OwnerUserId="59825" LastActivityDate="2020-06-15T08:41:36.703" Title="Duplicate between the main site and a Sandbox entry" Tags="|discussion|" AnswerCount="3" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="19019" PostTypeId="2" ParentId="19018" CreationDate="2020-06-10T03:56:02.917" Score="7" Body="&lt;h1&gt;The one who posted the idea to the public first gets the priority; close the other as duplicate&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Here, &quot;the idea&quot; includes all of the relevant aspects of a challenge which matters when deciding on the dupe-ness, i.e. the &lt;strong&gt;task&lt;/strong&gt; (with details and test cases) and the &lt;strong&gt;winning criterion&lt;/strong&gt;. We say a challenge X is a dupe of Y if a competitive answer of Y is very likely to be competitive in X.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;While one can't reliably search for the 2k+ (and still growing) posts on the Sandbox, one can (and I believe one &lt;em&gt;should&lt;/em&gt;) at least skim through the first page (50 questions) sorted by Active (which empirically covers around a week of activity) or simply text-search on it (say Ctrl+F). This applies especially when the challenge idea is directly based on a recent event (disclosure of a genome sequence in this case).&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt; The title of this post applies &lt;strong&gt;only&lt;/strong&gt; when both users have posted to main. Otherwise, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2056/78410&quot;&gt;we do have a policy on abandoned sandbox posts&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;h1&gt;What should we do with abandoned proposals?&lt;/h1&gt;&#xA;  &#xA;  &lt;p&gt;All content on Stack Exchange is licensed under &lt;a href=&quot;https://creativecommons.org/licenses/by-sa/4.0/&quot; rel=&quot;nofollow noreferrer&quot;&gt;CC BY-SA&lt;/a&gt;, so legally you are allowed to claim an&#xA;  abandoned idea yourself to make it ready for main and post it.&#xA;  However, doing so you should follow a few rules of courtesy. The&#xA;  following process &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2091/8478&quot;&gt;has been agreed on&lt;/a&gt;:&lt;/p&gt;&#xA;  &#xA;  &lt;ul&gt; &lt;li&gt;If a challenge proposal was not edited or commented on for&#xA;  &lt;strong&gt;a month&lt;/strong&gt;, you can leave a comment that you would like&#xA;  to take over the challenge, get it ready for main and post it.&lt;/li&gt;&#xA;  &lt;li&gt;If the OP does not reply within &lt;strong&gt;two weeks&lt;/strong&gt;,&#xA;  telling you that they still intend to post the challenge themselves,&#xA;  you are free to proceed with the challenge as you see fit.&lt;/li&gt;&#xA;  &lt;li&gt;Don't repost, just edit the existing post.&lt;/li&gt; &lt;/ul&gt;&#xA;  &#xA;  &lt;p&gt;You can use the following standard comment to express your interest&#xA;  in a challenge:&lt;/p&gt;&#xA;  &#xA;  &lt;blockquote&gt;   &lt;p&gt;This challenge proposal has been inactive for over a&#xA;  month. I would like to take ownership of the challenge and make it&#xA;  ready for posting. Please let me know within the next &lt;strong&gt;14&#xA;  days&lt;/strong&gt; if you have any objections and would still like to&#xA;  finish and post this challenge yourself.&lt;/p&gt; &lt;/blockquote&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;While posting to main right away is not a recommended action even in this case, we may extend the 2-week implied consent rule, like &quot;the challenge is OK to be kept open if the sandbox poster doesn't claim its ownership within 2 weeks&quot;.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;p&gt;That is, when the challenge in question is actually close enough to be considered a dupe.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;If the challenges are not actually a dupe, handle them by their quality separately&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;In this particular case, the two challenges have the exact same task, but have different winning criterion (one is simple code-golf, the other is code golf with a special byte-counting rule). They are arguably close, but probably not enough so for a dupe. Assuming the sandboxed one has better quality (I don't say foolproof, but it's still better to sandbox than not):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the two challenges are not actually a dupe &lt;em&gt;and of good quality&lt;/em&gt;, both can be kept open without problems.&lt;/li&gt;&#xA;&lt;li&gt;If the non-sandboxed one is of poor quality (e.g. unclear, which is usually the reason of being poor quality), I suggest to &lt;strong&gt;cast close votes with that reason&lt;/strong&gt;, &lt;em&gt;not&lt;/em&gt; as a dupe of the other.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2020-06-15T08:41:36.703" LastActivityDate="2020-06-15T08:41:36.703" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="19023" PostTypeId="2" ParentId="2140" CreationDate="2020-06-10T11:27:12.970" Score="1" Body="&lt;h2&gt;Lucky dice rolls&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In pen and paper roleplaying games dice are used for various chance calculations. The usual way to describe a roll is &lt;span class=&quot;math-container&quot;&gt;\$n\textbf{d}k\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is the number of dice and &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; is the number of faces on a die. For example &lt;span class=&quot;math-container&quot;&gt;\$3d6\$&lt;/span&gt; means that you need to roll the classical 6-sided die 3 times (or roll 3 dice at the same time). Both &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; are positive integers.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Usually the values are then summed and they are used for various game mechanics like chance to hit something or damage calculations.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;A lucky roll will mean that you have Fortuna's favor on your side (or against you). Luckiness is an integer number that increases (or decreases) the sum in the following way. The roll is modified to &lt;span class=&quot;math-container&quot;&gt;\${(n+|luck|)}\textbf{d}{k}\$&lt;/span&gt; and the sum will be the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; best (or worst) values. Each die is fair, so they will have the same probability for the outcome of the possible values.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The &lt;span class=&quot;math-container&quot;&gt;\$luck\$&lt;/span&gt; can be a negative number, in this case you need to get the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; worst values for the sum.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The integer values for &lt;span class=&quot;math-container&quot;&gt;\$n,k,luck\$&lt;/span&gt; in any way.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;The expected value for the sum of the (un)lucky roll. The &lt;a href=&quot;https://en.wikipedia.org/wiki/Expected_value#Finite_case&quot; rel=&quot;nofollow noreferrer&quot;&gt;expected value&lt;/a&gt; is &lt;span class=&quot;math-container&quot;&gt;\$\sum{x_{i} p_{i}}\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$x_{i}\$&lt;/span&gt; is the possible outcome of the sum and &lt;span class=&quot;math-container&quot;&gt;\$p_{i}\$&lt;/span&gt; is the probability for &lt;span class=&quot;math-container&quot;&gt;\$x_{i}\$&lt;/span&gt; occuring, and &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt; indexes all possible outcomes.&lt;/p&gt;&#xA;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;n,k,luck    expected value&#xA;1,6,0       3.5&#xA;2,6,0       7&#xA;2,6,-1      5.541666666666667&#xA;2,6,1       8.458333333333334&#xA;2,10,-1     8.525&#xA;2,10,1      13.475&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&#xA;&lt;p&gt;Shortest code in bytes wins.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Good luck! ;)&lt;/p&gt;&#xA;" OwnerUserId="55605" LastEditorUserId="55605" LastEditDate="2020-06-11T12:20:48.850" LastActivityDate="2020-06-11T12:20:48.850" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19024" PostTypeId="2" ParentId="2447" CreationDate="2020-06-10T15:08:33.453" Score="14" Body="&lt;h1&gt;Floating point numbers may be represented as fractions.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;For example, instead of literal &lt;code&gt;0.5&lt;/code&gt; or &lt;code&gt;&quot;0.5&quot;&lt;/code&gt;, the program can return &lt;code&gt;&quot;1/2&quot;&lt;/code&gt; or &lt;code&gt;[1,2]&lt;/code&gt;.&#xA;It's especially useful for languages without out-of-the-box floating point support.&lt;/p&gt;&#xA;" OwnerUserId="61379" LastActivityDate="2020-06-10T15:08:33.453" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19026" PostTypeId="2" ParentId="2140" CreationDate="2020-06-10T16:47:40.833" Score="2" Body="&lt;h1&gt;Pwning Passwords &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Alice decided to improve the security of her website by &lt;a href=&quot;https://blog.cloudflare.com/validating-leaked-passwords-with-k-anonymity/&quot; rel=&quot;nofollow noreferrer&quot;&gt;sending first five characters of an SHA-1 hash&lt;/a&gt; to Bob's Leaked Password Detection Service. However, she made two mistakes that let Eve decode the passwords: sending passwords over HTTP and checking the password after each character of a password is typed. Eve asked you for help in decoding the passwords, however she cannot really program, so needs your help in implementing password cracking algorithm as a computer program or function.&lt;/p&gt;&#xA;&lt;p&gt;Eve eavesdropped the requests for following hashes from Alice.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;516B9&#xA;379FC&#xA;19C2A&#xA;9D4E1&#xA;08506&#xA;F808E&#xA;A7F93&#xA;5BAA6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;How could you decode this password? Well, you can brute-force all lowercase letters. In this case the only letter whose hash starts with &lt;code&gt;516B9&lt;/code&gt; is &lt;code&gt;p&lt;/code&gt;. The hash of letter &lt;code&gt;p&lt;/code&gt; is &lt;code&gt;&lt;b&gt;516B9&lt;/b&gt;783FCA517EECBD1D064DA2D165310B19759&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Knowing that the password starts with &lt;code&gt;p&lt;/code&gt;, you can brute-force the second character. In this case, the only possible character is &lt;code&gt;a&lt;/code&gt;. The hash of &lt;code&gt;pa&lt;/code&gt; is &lt;code&gt;&lt;b&gt;379FC&lt;/b&gt;0D5299A71AC0F171FBB5AFB262829B4E765&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;You can continue to brute-force letters one by one to figure out the password was &lt;code&gt;password&lt;/code&gt; (&lt;code&gt;&lt;b&gt;5BAA6&lt;/b&gt;1E4C9B93F3F0682250B6CF8331B7EE68FD8&lt;/code&gt;). Well, that was simple.&lt;/p&gt;&#xA;&lt;p&gt;Not all passwords are that simple however. Consider the following requests:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;4DC7C&#xA;A84FD&#xA;467D7&#xA;BD79D&#xA;12D83&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;First three characters of this password are simple: &lt;code&gt;rxr&lt;/code&gt; (&lt;code&gt;&lt;b&gt;467D7&lt;/b&gt;856C648A79A096D339A2CE5FC929658967D&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;p&gt;With the fourth character it gets more complicated. BD79D matches for &lt;code&gt;rxrf&lt;/code&gt; (&lt;code&gt;&lt;b&gt;BD79D&lt;/b&gt;EC8435B8BA509A25F419F31CC2ACDE2FF0A&lt;/code&gt;) and &lt;code&gt;rxrp&lt;/code&gt; (&lt;code&gt;&lt;b&gt;BD79D&lt;/b&gt;C20901B11468F8369B5B0D15894F3D96A5E&lt;/code&gt;). There is an ambiguity, but as it turns out, it can be resolved by trying both ways. If you assume the password starts with &lt;code&gt;rxrp&lt;/code&gt; there is no valid letters to continue with. However, if you assume the password starts with &lt;code&gt;rxrf&lt;/code&gt;, then it's possible to append &lt;code&gt;a&lt;/code&gt;, resulting in &lt;code&gt;rxrfa&lt;/code&gt; (&lt;code&gt;&lt;b&gt;12D83&lt;/b&gt;D3A429CD7D64E9A532C05C2C00C35032A94&lt;/code&gt;), which is a valid solution.&lt;/p&gt;&#xA;&lt;p&gt;All &lt;strong&gt;passwords will be composed entirely out of lowercase letters&lt;/strong&gt;. You can assume all inputs have a solution and there are no inputs that could possibly resolve to multiple passwords (for instance &lt;code&gt;[&amp;quot;4DC7C&amp;quot;, &amp;quot;A84FD&amp;quot;, &amp;quot;467D7&amp;quot;, &amp;quot;BD79D&amp;quot;]&lt;/code&gt; is an invalid input because it can match both &lt;code&gt;&amp;quot;rxrf&amp;quot;&lt;/code&gt; and &lt;code&gt;&amp;quot;rxrp&lt;/code&gt;&amp;quot;).&lt;/p&gt;&#xA;&lt;p&gt;There are no case requirements on the input. Your program is allowed to assume the input is lowercase. Your program is allowed to assume the input is uppercase.&lt;/p&gt;&#xA;&lt;p&gt;The program must not take longer to execute than 24 hours for a 25 characters long password.&lt;/p&gt;&#xA;&lt;p&gt;It is allowed to use external libraries or language built-in functions for computation of SHA-1 hash.&lt;/p&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;This is a JSON.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;  {&#xA;    &amp;quot;input&amp;quot;: [&#xA;      &amp;quot;516B9&amp;quot;,&#xA;      &amp;quot;379FC&amp;quot;,&#xA;      &amp;quot;19C2A&amp;quot;,&#xA;      &amp;quot;9D4E1&amp;quot;,&#xA;      &amp;quot;08506&amp;quot;,&#xA;      &amp;quot;F808E&amp;quot;,&#xA;      &amp;quot;A7F93&amp;quot;,&#xA;      &amp;quot;5BAA6&amp;quot;&#xA;    ],&#xA;    &amp;quot;output&amp;quot;: &amp;quot;password&amp;quot;&#xA;  },&#xA;  {&#xA;    &amp;quot;input&amp;quot;: [&#xA;      &amp;quot;07C34&amp;quot;,&#xA;      &amp;quot;593B7&amp;quot;,&#xA;      &amp;quot;0262F&amp;quot;,&#xA;      &amp;quot;CED65&amp;quot;,&#xA;      &amp;quot;23612&amp;quot;,&#xA;      &amp;quot;4EF76&amp;quot;,&#xA;      &amp;quot;B7A87&amp;quot;&#xA;    ],&#xA;    &amp;quot;output&amp;quot;: &amp;quot;letmein&amp;quot;&#xA;  },&#xA;  {&#xA;    &amp;quot;input&amp;quot;: [&#xA;      &amp;quot;84A51&amp;quot;,&#xA;      &amp;quot;87DDA&amp;quot;,&#xA;      &amp;quot;83F67&amp;quot;,&#xA;      &amp;quot;E6FB0&amp;quot;,&#xA;      &amp;quot;5157D&amp;quot;,&#xA;      &amp;quot;82CD7&amp;quot;,&#xA;      &amp;quot;6F655&amp;quot;,&#xA;      &amp;quot;43426&amp;quot;&#xA;    ],&#xA;    &amp;quot;output&amp;quot;: &amp;quot;codegolf&amp;quot;&#xA;  },&#xA;  {&#xA;    &amp;quot;input&amp;quot;: [&#xA;      &amp;quot;7A81A&amp;quot;,&#xA;      &amp;quot;DB3D4&amp;quot;,&#xA;      &amp;quot;FE05B&amp;quot;,&#xA;      &amp;quot;E7280&amp;quot;,&#xA;      &amp;quot;32726&amp;quot;,&#xA;      &amp;quot;30AE9&amp;quot;,&#xA;      &amp;quot;2C61A&amp;quot;,&#xA;      &amp;quot;A9E46&amp;quot;,&#xA;      &amp;quot;15D98&amp;quot;,&#xA;      &amp;quot;F780A&amp;quot;,&#xA;      &amp;quot;3E949&amp;quot;,&#xA;      &amp;quot;F4BF2&amp;quot;,&#xA;      &amp;quot;6A5C4&amp;quot;,&#xA;      &amp;quot;C4554&amp;quot;,&#xA;      &amp;quot;FA2EA&amp;quot;,&#xA;      &amp;quot;48A40&amp;quot;,&#xA;      &amp;quot;5DD7F&amp;quot;,&#xA;      &amp;quot;5284E&amp;quot;,&#xA;      &amp;quot;C0B8D&amp;quot;,&#xA;      &amp;quot;20D59&amp;quot;,&#xA;      &amp;quot;9184C&amp;quot;,&#xA;      &amp;quot;32AD9&amp;quot;&#xA;    ],&#xA;    &amp;quot;output&amp;quot;: &amp;quot;onetwothreefourfivesix&amp;quot;&#xA;  },&#xA;  {&#xA;    &amp;quot;input&amp;quot;: [&#xA;      &amp;quot;84A51&amp;quot;,&#xA;      &amp;quot;87DDA&amp;quot;,&#xA;      &amp;quot;26CA7&amp;quot;,&#xA;      &amp;quot;9D925&amp;quot;,&#xA;      &amp;quot;08A23&amp;quot;,&#xA;      &amp;quot;BE075&amp;quot;,&#xA;      &amp;quot;3179A&amp;quot;,&#xA;      &amp;quot;5D904&amp;quot;,&#xA;      &amp;quot;54C70&amp;quot;,&#xA;      &amp;quot;47790&amp;quot;,&#xA;      &amp;quot;5D3B5&amp;quot;,&#xA;      &amp;quot;0E4CE&amp;quot;,&#xA;      &amp;quot;004C7&amp;quot;,&#xA;      &amp;quot;EC8A8&amp;quot;,&#xA;      &amp;quot;131A6&amp;quot;,&#xA;      &amp;quot;7F47F&amp;quot;,&#xA;      &amp;quot;41BC6&amp;quot;,&#xA;      &amp;quot;FCF07&amp;quot;,&#xA;      &amp;quot;D62BD&amp;quot;,&#xA;      &amp;quot;DD14F&amp;quot;,&#xA;      &amp;quot;6A141&amp;quot;,&#xA;      &amp;quot;EE184&amp;quot;,&#xA;      &amp;quot;595F8&amp;quot;,&#xA;      &amp;quot;9D303&amp;quot;,&#xA;      &amp;quot;BFD36&amp;quot;&#xA;    ],&#xA;    &amp;quot;output&amp;quot;: &amp;quot;correcthorsebatterystaple&amp;quot;&#xA;  },&#xA;  {&#xA;    &amp;quot;input&amp;quot;: [],&#xA;    &amp;quot;output&amp;quot;: &amp;quot;&amp;quot;&#xA;  },&#xA;  {&#xA;    &amp;quot;input&amp;quot;: [&#xA;      &amp;quot;4DC7C&amp;quot;,&#xA;      &amp;quot;A84FD&amp;quot;,&#xA;      &amp;quot;467D7&amp;quot;,&#xA;      &amp;quot;BD79D&amp;quot;,&#xA;      &amp;quot;12D83&amp;quot;&#xA;    ],&#xA;    &amp;quot;output&amp;quot;: &amp;quot;rxrfa&amp;quot;&#xA;  },&#xA;  {&#xA;    &amp;quot;input&amp;quot;: [&#xA;      &amp;quot;4DC7C&amp;quot;,&#xA;      &amp;quot;A84FD&amp;quot;,&#xA;      &amp;quot;467D7&amp;quot;,&#xA;      &amp;quot;BD79D&amp;quot;,&#xA;      &amp;quot;7B743&amp;quot;&#xA;    ],&#xA;    &amp;quot;output&amp;quot;: &amp;quot;rxrpa&amp;quot;&#xA;  }&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="3103" LastEditorUserId="-1" LastEditDate="2020-06-17T09:03:53.167" LastActivityDate="2020-06-12T06:42:46.027" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19029" PostTypeId="2" ParentId="2140" CreationDate="2020-06-11T22:22:18.950" Score="0" Body="&lt;h1&gt;Compute the factorial, on both sides of 0&lt;/h1&gt;&#xA;&lt;p&gt;Why, why, why do factorials stop at zero? (Yes there are actual reasons). Make a factorial function (or full program) that doesn't stop at zero!&lt;/p&gt;&#xA;&lt;p&gt;Your code-golfed program should, given an non-zero integer &lt;code&gt;n&lt;/code&gt; (can be positive or negative, the rule still applies), find the product of the range &lt;code&gt;n to -n&lt;/code&gt; excluding 0.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.desmos.com/calculator/oxswtak72k&quot; rel=&quot;nofollow noreferrer&quot;&gt;Graph that at least works for positive numbers&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Sample IO&lt;/h3&gt;&#xA;&lt;pre class=&quot;lang-sql prettyprint-override&quot;&gt;&lt;code&gt; Input          | Output&#xA;----------------|------------&#xA;0               | 1 (product of 0 and -0 without 0 / empty product)&#xA;2               | 4 (2*1*-1*-2)&#xA;3               | -36 (3*2*1*-1*-2*-3)&#xA;4               | 576 (4*3*2*1*-1*-2*-3*-4)&#xA;-4              | 576&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Probably not a duplicate, but it might not be that much of a challenge.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/factorial&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;factorial&amp;#39;&quot; rel=&quot;tag&quot;&gt;factorial&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="90614" LastEditorUserId="90614" LastEditDate="2020-06-17T21:01:20.990" LastActivityDate="2020-06-17T21:01:20.990" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="19030" PostTypeId="2" ParentId="19018" CreationDate="2020-06-11T22:30:11.693" Score="-3" Body="&lt;h1&gt;The improvement you get from putting a challenge in Sandbox is its own reward&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;This improvement is what helps Sandbox challenges become better than main site challenges.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Up/downvoters should decide the merit of the pre-empting question&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If a challenge in Sandbox is better, someone should link to it and discourage other members from upvoting the main site challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;In this case, both challenges had the same idea with very similar rules.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Just because an idea is abandoned in Sandbox doesn't mean it can't be improved and re-posted to the main site.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;Stealing should be discouraged&lt;/h1&gt;&#xA;&#xA;&lt;h1&gt;Challenge answerers should avoid answering a challenge they believe was stolen from an active Sandbox entry&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;A challenge with no answers is not fun to read.&lt;/p&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2020-06-11T22:30:11.693" CommentCount="7" CommunityOwnedDate="2020-06-11T22:30:11.693" ContentLicense="CC BY-SA 4.0" />
  <row Id="19031" PostTypeId="2" ParentId="18751" CreationDate="2020-06-12T23:44:08.153" Score="8" Body="&lt;h1&gt;It is OK to incorporate rules or clarifications to a challenge posted by the author in comments into the question body.&lt;/h1&gt;&#xA;" OwnerUserId="46076" LastActivityDate="2020-06-12T23:44:08.153" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19032" PostTypeId="2" ParentId="2140" CreationDate="2020-06-13T23:43:46.940" Score="-2" Body="&lt;h1&gt;Print all sequenced variants of the SARS-CoV-2 (COVID-19) genome in FASTA format&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.ncbi.nlm.nih.gov/genbank/sars-cov-2-seqs/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.ncbi.nlm.nih.gov/genbank/sars-cov-2-seqs/&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;The FASTA format has the name of the sequence data following a &lt;code&gt;&amp;gt;&lt;/code&gt;, a newline, 60 characters of As, Ts, Cs, and Gs, a newline, 60 characters of As, Ts, Cs, and Gs, and so on.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;You need only print the name of the, not the location it came from. For example:&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;XX-NNNNNN.N&#xA;GENOMIC DATA GOES HERE&#xA;&amp;gt;XX-NNNNNN.N&#xA;MORE GENOMIC DATA GOES HERE&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2020-06-13T23:43:46.940" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19033" PostTypeId="2" ParentId="2140" CreationDate="2020-06-14T03:32:12.213" Score="3" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/206370/implement-entombeds-lookup-table&quot;&gt;Posted.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="91030" LastEditorUserId="91030" LastEditDate="2020-06-21T20:40:10.290" LastActivityDate="2020-06-21T20:40:10.290" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19034" PostTypeId="1" CreationDate="2020-06-14T06:31:07.317" Score="11" ViewCount="338" Body="&lt;p&gt;When golfing in Excel, it is often possible to omit closing parentheses at the end of an expression. Excel will detect this, add the missing closing parentheses and ask if this is what was meant.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Should any such trailing parentheses be counted for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; challenges or not?&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;On the side of allowing it is that the code without the missing characters &lt;em&gt;is&lt;/em&gt; enough for Excel to understand (though it requires a button press or mouse click to do so).&lt;/p&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;On the side of prohibiting it is that the code &lt;em&gt;is&lt;/em&gt; invalid, and that Excel will refuse the formula if one rejects the suggested fix.&lt;/p&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2020-07-19T22:03:45.447" Title="Omitting trailing closing parentheses in Excel" Tags="|discussion|policy|code-golf|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19036" PostTypeId="2" ParentId="19018" CreationDate="2020-06-14T15:24:28.597" Score="-4" Body="&lt;p&gt;I am posting this answer for voting purposes, to show the ridiculousness and/or insufficiency of Bubbler's  proposal.&lt;/p&gt;&#xA;&#xA;&lt;h1&gt;The sandbox challenge should be able to block the main site challenge.&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;I've posted this challenge. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/19032#19032&quot;&gt;Sandbox for Proposed Challenges&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;I believe it is interesting. However, I have not put in the work to scrape the data needed for someone to implement the challenge.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Under Bubbler's  rule, even if someone did scrape the data from the N&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Even if I left Stack Exchange, the main site cha&lt;/p&gt;&#xA;" OwnerUserId="41088" LastActivityDate="2020-06-14T15:24:28.597" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19037" PostTypeId="2" ParentId="19034" CreationDate="2020-06-14T23:05:36.087" Score="4" Body="&lt;h1&gt;Yes, it should be valid&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;If languages like 05AB1E and other golfing languages have implicit bracket closing (albeit, without making any noise, so to speak), then Excel should be allowed to do it too.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Anything that gives a correct result after Excel's typo fixer works its magic should be allowed.&lt;/p&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2020-06-14T23:05:36.087" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19038" PostTypeId="2" ParentId="2140" CreationDate="2020-06-15T08:08:34.630" Score="-1" Body="&lt;h1&gt;What day is it today? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Given a date &lt;code&gt;y4y3y2y1-m2m1-d2d1&lt;/code&gt;, output the day in the week &lt;code&gt;w&lt;/code&gt;. 0 as Sunday, 1 as Monday, and so on. You can assume the date is valid, and we use the current &lt;a href=&quot;https://www.timeanddate.com/calendar/months/&quot; rel=&quot;nofollow noreferrer&quot;&gt;date rule&lt;/a&gt; and &lt;a href=&quot;https://www.timeanddate.com/date/leapyear.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;leap rule&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Each submission should be written in this specific programming language:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A program consists of a mapping from string of digits to digits, and a sequence of instructions.&lt;/li&gt;&#xA;&lt;li&gt;Each instruction has the format: &lt;code&gt;var=[var|dgt],[var|dgt],...,[var|dgt]&lt;/code&gt;, which assigns the value of looking up the string constructed by concatenating the values of the right hand side elements (&lt;code&gt;[var|dgt],[var|dgt],...,[var|dgt]&lt;/code&gt;) together in the table and put it into the &lt;code&gt;var&lt;/code&gt; on the left.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;A program is valid if:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;None of the lookup step fails for all valid input date.&lt;/li&gt;&#xA;&lt;li&gt;Given any valid date in the format mentioned above (initially assigned to the 8 variables &lt;code&gt;y4 y3 y2 y1 m2 m1 d2 d1&lt;/code&gt;), after the program is run, the correct result is assigned to the variable &lt;code&gt;w&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You can create as many variables as you like(though bounded by amount of instructions), each variable only containing a digit.&lt;/p&gt;&#xA;&lt;p&gt;Solution win if there's no strictly better solution, aka. no solution that take less or same amount of items in mapping table, less or same amount of instrucions, and at least one of amounts of items and instructions is less.&lt;/p&gt;&#xA;&lt;p&gt;For example, this is a solution that wins:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;3652425 items 1 instruction&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;pre&gt;&lt;code&gt;003000101 -&amp;gt; 6&#xA;003000102 -&amp;gt; 0&#xA;003000103 -&amp;gt; 1&#xA;...&#xA;993991231 -&amp;gt; 5&#xA;-------------&#xA;w=y4,y3,3,y2,y1,m2,m1,d2,d1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here, the &lt;code&gt;3&lt;/code&gt; on 3rd position can be used without any extra cost. This can be used to create multiple mappings, and sometimes save elements when there are more mapping instructions.&lt;/p&gt;&#xA;&lt;p&gt;A checker is provided &lt;a href=&quot;https://tio.run/##pVNdb5swFH1OfoVXVbpGuCgY8oVHX1Zt2h7Whz5mVSDgJKTEjsBpiii/PbOBbNW09WUWwrJ1fM4959q7@DkukyI7qBshU36@OpYclarIEnXFhuujSFQmBUq2PHnCKl7lnKBMaICF6uHgOS7Q3dcvDyhE9SiAERA3ABcIDYAC8QLwgPgB@EDGAYyBTAKYAJkGMAUyC2AGZB7AHMhyeSikkstlII553rDhoNXQtO3slIc8U9EPETn7@IBVeFsb5Zis2EL/HkPVI8KIFVwdC4EijOVqt4DrOm5AA0zli@t61QNJx5SEt1EPSzQsspydzERkR82jlYnWmoVeX9FRpHydCZ46L1Fjsc54W9onXePnPiUMrQwQBJrUTIYA@sA6ahaZ42tZIGw40vBmQt3JlLpzOjKDofRjSMeeP6LU9f3Lnh3OJt2izb3Vr3xSeaSipHLJnpK9S1JKUpeoUPATuosVx6kRGyzeIntohzXJKfnt4f47bpGGVpdu2vkv9t@tMuZMqwaqqFDdx3G5I5qFdPkxlK1NL5zTB6224eourrBlIbUt5AmNWIOSWCVbzLWzbk@xZjjQXyJFKXPu5HKD8P1qxxPlPPGq7DQsJ@dio7aXeLuVttEM9Di3VsK6Ye9EpS/4/zTivVzftOBXwjoVfcSuPNuzK2pXrr2n9t61U2r/eeQSExu2Lw9hqW/TKewE/@IELHY@/wQ&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2020-06-19T00:34:47.113" LastActivityDate="2020-06-19T00:34:47.113" CommentCount="16" ContentLicense="CC BY-SA 4.0" />
  <row Id="19039" PostTypeId="2" ParentId="2140" CreationDate="2020-06-15T13:09:35.977" Score="3" Body="&lt;h1&gt;Bot Duels KOTH &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;/h1&gt;&#xA;&#xA;&lt;p&gt;Obligatory blurb adding story fluff. Or, maybe a self-referential paragraph about meta-self-referential blurbs? Or: &lt;code&gt;&amp;lt;announcer voice&amp;gt;&lt;/code&gt; &lt;em&gt;Will your bot survive... &lt;strong&gt;The Arena?&lt;/strong&gt;&lt;/em&gt; &lt;code&gt;&amp;lt;/announcer voice&amp;gt;&lt;/code&gt;. Yes, I think a good non-self-referential (such as this) short paragraph full of short sentences without run-ons or many, many, many, many commas will suffice.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Overview&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;This is a King-of-the-Hill challenge. Bot with the most wins wins. You may submit multiple bots as long as they differ in strategy. Bots will play against every other bot. The bot who is currently playing against every other bot goes first, and goes second when their opponent is playing against every other bot. Bots will face off in an arena with &lt;code&gt;x&lt;/code&gt; boundaries of &lt;code&gt;10&lt;/code&gt; and &lt;code&gt;-10&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; boundaries of &lt;code&gt;10&lt;/code&gt; and &lt;code&gt;-10&lt;/code&gt;. Bots will either start at &lt;code&gt;(-5, 0)&lt;/code&gt; or &lt;code&gt;(5, 0)&lt;/code&gt;. Your goal is to defeat the other bot by reducing it's HP to &lt;code&gt;0&lt;/code&gt; or less. Bots start with &lt;code&gt;20+armor modifier&lt;/code&gt; HP and &lt;em&gt;do not regenerate health&lt;/em&gt;. Your bot defeats the other bots using &lt;code&gt;weapons&lt;/code&gt;, which have &lt;code&gt;damage&lt;/code&gt;, &lt;code&gt;range&lt;/code&gt;, and &lt;code&gt;cooldown&lt;/code&gt;. Armor has &lt;code&gt;speed&lt;/code&gt;.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Submissions&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;Submissions should be a JS function that takes the following parameters:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;curr_x&lt;/code&gt; - the current &lt;code&gt;x&lt;/code&gt; coordinate of your bot&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;curr_y&lt;/code&gt; - the current &lt;code&gt;y&lt;/code&gt; coordinate of your bot&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;enemy_x&lt;/code&gt; - the current &lt;code&gt;x&lt;/code&gt; coordinate of your opponent's bot&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;enemy_y&lt;/code&gt; - the current &lt;code&gt;y&lt;/code&gt; coordinate of your opponent's bot&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;enemy_armor&lt;/code&gt; - the armor that your enemy is wearing&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;storage&lt;/code&gt; - a storage object you can use to store data between function calls&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;The function should return an array with 3 items (in the following order):&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;desired x&lt;/code&gt; - the &lt;code&gt;x&lt;/code&gt; coordinate you want to move to&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;desired y&lt;/code&gt; - the &lt;code&gt;y&lt;/code&gt; coord you want to move to&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;use weapon?&lt;/code&gt; - if &lt;code&gt;true&lt;/code&gt;, and &lt;code&gt;desired x&lt;/code&gt; and &lt;code&gt;desired y&lt;/code&gt; are &lt;code&gt;Infinity&lt;/code&gt;, then you use your weapon&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;Submissions should be structured as  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Weapon: &lt;em&gt;your weapon here&lt;/em&gt;&lt;/strong&gt;&lt;br&gt;&#xA;&lt;strong&gt;Armor: &lt;em&gt;your armor here&lt;/em&gt;&lt;/strong&gt;  &lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function definition&#xA;block&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Explanation underneath, if any.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Armor&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;(currently designing new weapons and armor)&#xA;The types of armor available are:  &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;Light&lt;/code&gt; - increases HP by &lt;code&gt;3&lt;/code&gt;, has a speed of &lt;code&gt;3&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Medium&lt;/code&gt; - increases HP by &lt;code&gt;5&lt;/code&gt;, has a speed of &lt;code&gt;2&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Heavy&lt;/code&gt; - increases HP by &lt;code&gt;7&lt;/code&gt;, has a speed of &lt;code&gt;1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Weapons&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The types of weapons are:&lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;Laser&lt;/code&gt; - High-range, high-damage, low ROF. &lt;code&gt;5&lt;/code&gt; points of damage, &lt;code&gt;5&lt;/code&gt; rounds to cool down, and a range of &lt;code&gt;6&lt;/code&gt; units&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Rifle&lt;/code&gt; - General-purpose weapon. &lt;code&gt;5&lt;/code&gt; damage, range of &lt;code&gt;4&lt;/code&gt;, &lt;code&gt;3&lt;/code&gt; rounds to cool down.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Sword&lt;/code&gt; - High-ROF, high-damage spiky thing. &lt;code&gt;5&lt;/code&gt; points of damage, really low range of &lt;code&gt;1&lt;/code&gt;, and a rather quick &lt;code&gt;2&lt;/code&gt; rounds to cool down.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Turns&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;On your turn, you can either move or use weapon (or do nothing, if that's what you really want to do).  &lt;/p&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If you &lt;code&gt;move&lt;/code&gt;, you can move a distance (computed using the &lt;a href=&quot;https://www.google.com/url?sa=t&amp;amp;rct=j&amp;amp;q=&amp;amp;esrc=s&amp;amp;source=web&amp;amp;cd=&amp;amp;cad=rja&amp;amp;uact=8&amp;amp;ved=2ahUKEwjTyYHNwYfqAhVQRK0KHa3mA60QFjAIegQIAxAB&amp;amp;url=https%3A%2F%2Fen.wikipedia.org%2Fwiki%2FEuclidean_distance&amp;amp;usg=AOvVaw0kOx-gkTKwme7Y8C9LPjL0&quot; rel=&quot;nofollow noreferrer&quot;&gt;Euclidean Distance formula&lt;/a&gt;) less-than or equal-to (&lt;code&gt;&amp;lt;=&lt;/code&gt;) your &lt;code&gt;armor&lt;/code&gt;'s speed.&lt;/li&gt;&#xA;&lt;li&gt;If you choose to &lt;code&gt;use weapon&lt;/code&gt;, and if the enemy is in range of your weapon, then you deal damage equal to your weapon's damage and the weapon goes into cooldown. A weapon in cooldown can't be used. Weapons can be used after a number of turns equal to their &lt;code&gt;cooldown&lt;/code&gt; property has passed after being used.&lt;/li&gt;&#xA;&lt;li&gt;To do nothing, simply return your current &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; coordinates, like so: &lt;code&gt;return [curr_x, curr_y, false]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If you try to use a weapon during cooldown, nothing happens and your turn ends&lt;/li&gt;&#xA;&lt;li&gt;If you try to use a weapon and your opponent is out of range, nothing happens and your turn ends.&lt;/li&gt;&#xA;&lt;li&gt;If you try to move more than your armor's &lt;code&gt;speed&lt;/code&gt;, nothing happens and your turn ends&lt;/li&gt;&#xA;&lt;li&gt;If you try to move out-of-bounds, same thing&lt;/li&gt;&#xA;&lt;li&gt;If you move into another bot's space, then the bot with the lowest HP loses and the bot with the highest HP wins, &lt;strong&gt;making this a viable strategy&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;All standard loopholes (accessing controller, duplicate bots, suicide bots, etc.) are, of course, &lt;strong&gt;disallowed&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;TowerDefense&lt;/strong&gt;&#xA;&lt;strong&gt;Weapon: Laser&lt;/strong&gt;&lt;br&gt;&#xA;&lt;strong&gt;Armor: Heavy&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function(curr_x, curr_y, enemy_x, enemy_y, enemy_armor, storage) {&#xA;    let actions = [Infinity, Infinity, true];&#xA;    return actions;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Just sits and shoots, lol. A perfectly viable strategy (and a rather strong one, too, while weapons are still being reworked). Takes the highest-hp armor available because it doesn't need to move at all.&lt;/p&gt;&#xA;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2&gt;DumbBot&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Weapon: Rifle&lt;/strong&gt;&lt;br&gt;&#xA;&lt;strong&gt;Armor: Medium&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre&gt;&lt;code&gt;function(curr_x, curr_y, enemy_x, enemy_y, enemy_armor, storage) {&#xA;      let actions = [curr_x, curr_y, false];&#xA;      // if storage is empty&#xA;      if (!storage.data) {&#xA;        // then write our starting loc&#xA;        storage.data = curr_x.toString() + &quot; &quot; + curr_y.toString();&#xA;      }&#xA;&#xA;      // if we're starting at x = -5&#xA;      if (storage.data.includes(&quot;-5&quot;)) {&#xA;        if (curr_x &amp;lt; 3) {&#xA;          // move right&#xA;          actions[0] += 2;&#xA;          actions[1] = curr_y;&#xA;        }&#xA;        // otherwise we must be close enough&#xA;        else {storage.data = &quot;shoot&quot;;}&#xA;      }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&#xA;&lt;p&gt;Assumes enemy doesn't move (such as TowerDefense). Moves to the enemy's starting location, then shoots. As such, takes the Medium armor and the Rifle. Kind of a generic all-purpose bot, like the weapons and armor it uses.&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Controller&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;The controller can be found &lt;a href=&quot;https://repl.it/@Squrril/KOTH-Controller#index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;. Run all current submissions &lt;a href=&quot;https://koth-controller--squrril.repl.co/&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.  &lt;/p&gt;&#xA;&#xA;&lt;p&gt;Best of luck, and, &lt;em&gt;may the odds be ever in your favor&lt;/em&gt; (even though this is a 1v1 and not a FFA)&lt;/p&gt;&#xA;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are the rules explained thoroughly? Is anything unclear?&lt;/li&gt;&#xA;&lt;li&gt;Is the game (armor, weapons, punishment for breaking rules, etc.) balanced well? Are there any strategies that dominate?&lt;/li&gt;&#xA;&lt;li&gt;Would this KOTH be fun?&lt;/li&gt;&#xA;&lt;li&gt;Would &lt;em&gt;you&lt;/em&gt; participate in the competition?&lt;/li&gt;&#xA;&lt;li&gt;Any obvious bugs in the (horribly messy) controller code?&lt;/li&gt;&#xA;&lt;li&gt;Create a simple submission similar to something that you would actually submit and test it against the example bots. Is the code still working?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="95207" LastEditorUserId="95207" LastEditDate="2020-06-17T00:12:08.607" LastActivityDate="2020-06-17T00:12:08.607" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="19041" PostTypeId="1" CreationDate="2020-06-16T06:19:10.647" Score="6" ViewCount="348" Body="&lt;p&gt;To cite &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/19038/78410&quot;&gt;a recently sandboxed challenge by l4m2&lt;/a&gt;:&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;Solution win if there's no strictly better solution, aka. no solution that take less or same amount of items in mapping table, less or same amount of instrucions, and at least one of amounts of items and instructions is less.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I understand this statement as&lt;/p&gt;&#xA;&#xA;&lt;blockquote&gt;&#xA;  &lt;p&gt;A solution is measured in two ways: the number of items in the mapping table, and the number of instructions. A solution wins if no other solution is strictly better; solution A is strictly better than solution B if A is strictly better in one measure and at least as good in the other, i.e. &lt;code&gt;(A[1]&amp;lt;B[1] &amp;amp;&amp;amp; A[2]&amp;lt;=B[2]) || (A[1]&amp;lt;=B[1] &amp;amp;&amp;amp; A[2]&amp;lt;B[2])&lt;/code&gt; (assuming lower score is better in both measures).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&#xA;&lt;p&gt;I'm worried about this winning criterion because it permits many &quot;winners&quot; and we don't know which measure to primarily optimize for. The worst part is that, given an existing &quot;winning&quot; solution, one can tweak a little bit and post another &quot;winning&quot; solution, and then we have &quot;another winner&quot;, not &quot;the latter winning against the former&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;On the other hand, l4m2 claimed that multiple winners is not a problem because we already have something like &quot;shortest code in each language wins&quot;, and we can get a collection of, say, &quot;an exact bound of table size for each instruction count&quot;.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;strong&gt;Is the proposed winning criterion valid?&lt;/strong&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8135/78410&quot;&gt;Why do we have objective winning criteria?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2021-02-12T07:56:33.060" Title="Is &quot;A solution wins if there's no strictly better solution in multiple measures&quot; a valid winning criterion?" Tags="|discussion|winning-criteria|" AnswerCount="3" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="19042" PostTypeId="2" ParentId="2140" CreationDate="2020-06-16T09:09:57.790" Score="-1" Body="&lt;p&gt;Write two programs (likely functions since IO for float convert to/from stream, losing info as mentioned later), one given &lt;span class=&quot;math-container&quot;&gt;\$n\geq 2\$&lt;/span&gt; real points on a 2D plane, returning &lt;span class=&quot;math-container&quot;&gt;\$2n-3\$&lt;/span&gt; real numbers; another given the &lt;span class=&quot;math-container&quot;&gt;\$2n-3\$&lt;/span&gt; real numbers, return the same shape and size given to first program. Order of points matters. Returning a mirrored shape is fine.&lt;/p&gt;&#xA;&lt;p&gt;You must use an in-language float and assume it is infinitely precise, but converting to types like string or trying to handle the bits in RAM truncate the precision. There's no requirements on how you map, so you can even just pack some real numbers into one if your language happens to have way to do that.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2020-06-17T12:12:35.327" LastActivityDate="2020-06-17T12:12:35.327" CommentCount="19" ContentLicense="CC BY-SA 4.0" />
  <row Id="19044" PostTypeId="2" ParentId="2140" CreationDate="2020-06-17T10:47:27.043" Score="5" Body="&lt;h1&gt;Posted: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/206342/scoring-quantum-tic-tac-toe&quot;&gt;Scoring Quantum Tic-Tac-Toe&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="94333" LastEditorUserId="94333" LastEditDate="2020-06-20T20:08:46.483" LastActivityDate="2020-06-20T20:08:46.483" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="19045" PostTypeId="2" ParentId="2140" CreationDate="2020-06-18T03:35:13.073" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/206350/i-am-surely-the-fastest-asymptotically&quot;&gt;I am surely the fastest!... asymptotically&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Posted.&lt;/p&gt;&#xA;" OwnerUserId="90585" LastEditorUserId="90585" LastEditDate="2020-06-21T03:46:37.360" LastActivityDate="2020-06-21T03:46:37.360" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19047" PostTypeId="2" ParentId="2140" CreationDate="2020-06-18T23:58:46.320" Score="1" Body="&lt;h3&gt;Iterate diagonally over nxn matrix&lt;/h3&gt;&#xA;&lt;p&gt;Given a matrix of size n, output the matrix into another matrix of size n such that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the outputted matrix, when traversed diagonally,will result in the original matrix.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For example, taking this 3x3 matrix, we arrive at our solution:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/kydm2.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/kydm2.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Which is checked by following the line beginning at 1:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/9nbGn.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/9nbGn.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Specifications:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The matrix will always be square&lt;/li&gt;&#xA;&lt;li&gt;You must output a grid with the same size as you were given (e.g. Not as a triangle)&lt;/li&gt;&#xA;&lt;li&gt;Mark the end of each row with a delimiter such as &lt;code&gt;\n&lt;/code&gt;  or &lt;code&gt; &lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples:&lt;/h2&gt;&#xA;&lt;h3&gt;Example 1&lt;/h3&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3&#xA;4 5 6&#xA;7 8 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 3 6&#xA;2 5 8&#xA;4 7 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We can check the output by iterating over the array diagonally (follow the arrows for steps 1-5), which will give us the original matrix.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  ↗ ↗ ↗&#xA;1 ↗ ↗ ↗&#xA;2 ↗ ↗ ↗&#xA;3  4 5 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Example 2&lt;/h3&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a b c d&#xA;e f g h&#xA;i j k l&#xA;m n o p&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a c f j&#xA;b e i m  &#xA;d h l o&#xA;g k n p&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We can check this by iterating the array in steps &lt;code&gt;1-7&lt;/code&gt; which outputs the given array.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  ↗ ↗ ↗ ↗&#xA;1 ↗ ↗ ↗ ↗&#xA;2 ↗ ↗ ↗ ↗&#xA;3 ↗ ↗ ↗ ↗&#xA;4  5 6 7&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Hint:&lt;/p&gt;&#xA;&lt;p&gt;Looking at the coordinates, we can see a pattern:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(0,0) -&amp;gt; (0, 1) -&amp;gt; (1, 0) -&amp;gt; (0, 2) -&amp;gt; (1, 1) -&amp;gt; (2, 0) -&amp;gt; (1, 2) -&amp;gt; (2, 1) -&amp;gt; (2,2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="94831" LastEditorUserId="94831" LastEditDate="2020-06-19T02:53:30.467" LastActivityDate="2020-06-19T02:53:30.467" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19049" PostTypeId="1" CreationDate="2020-06-19T23:16:59.120" Score="11" ViewCount="438" Body="&lt;p&gt;I've been lurking on this site long before I made my account, and I've seen many cases where people are downvoted simply because they post an answer in the same language as someone else and it happens to be a few bytes longer because it uses a different approach. From my understanding, this is supposed to be a recreational programming site - why are some people so unfriendly that they don't want you to post your work if it's not shorter than an answer from someone who's probably been golfing several years longer than a lot of us?&lt;/p&gt;&#xA;&lt;p&gt;I've also noticed sometimes people don't read entire questions before trying to find ways to nitpick them. People who post questions are just trying to make fun challenges for everyone, why must we pick their questions to pieces? Don't get me wrong - I understand a lot of questions are hot garbage or just don't belong here. If you don't want to do someone's question because of a certain constraint but other people seem to be answering it fine, am I mistaken in thinking the polite thing to do is to leave it alone and let people have their fun instead of trying to ruin it for everyone else? (an example of this can be found &lt;a href=&quot;https://codegolf.stackexchange.com/questions/206257/find-the-date-that-is-n-days-from-january-1st-1984&quot;&gt;in this recent question&lt;/a&gt; - to me, those requirements look fair. I'm bringing this specific example up because I spent two hours golfing this challenge only to find out people closed it because of its constraint, and now I can't even share my answer with anyone.&lt;/p&gt;&#xA;&lt;p&gt;In short, the question I want answered is - why is our community so quick to jump on bandwagons, or to downvote answers that might be a few bytes longer, or in general just not be friendly like a recreational programming website should be?&lt;/p&gt;&#xA;" OwnerUserId="95839" LastActivityDate="2020-06-25T08:28:05.843" Title="Why are some users so quick to jump on a bandwagon?" Tags="|discussion|answers|voting|" AnswerCount="5" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="19050" PostTypeId="2" ParentId="19049" CreationDate="2020-06-20T00:37:35.077" Score="7" Body="&lt;p&gt;I can only speak to the nitpicking point since I haven't seen any examples of the first point that I can remember.  About this second point I have two things to say:&lt;/p&gt;&#xA;&lt;h2&gt;Nitpicking&lt;/h2&gt;&#xA;&lt;p&gt;First off nit picking is a rather loaded term.  I can call pretty much any issue raised with a challenge as a nitpick and I can't really be proven wrong except in the most obvious of issues (e.g. the challenge is missing entirely).  And it is easy enough to believe that the people who you see as nitpicking do not see it that way themselves.&lt;/p&gt;&#xA;&lt;p&gt;So I think the question better asked is not &amp;quot;Why do people nitpick?&amp;quot; but more:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Why do these people care about issues that I don't see as significant?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Why does this site have a pattern of people caring about issues I don't see as significant?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I think the important factors here are site history and personal experience.  I don't mean to talk down or condescend, but you are a new user to the site, and the users that are &amp;quot;nitpicking&amp;quot; at least in your example, have been here at least a bit longer than you.  As you see more and more questions you get a sense of what is really an issue and what is not.  People still disagree but a larger site culture does develop.&lt;/p&gt;&#xA;&lt;p&gt;Now this can make things hostile to newcomers, that is true.  Your experience is not unique or even very rare.  A lot of people perceive certain issues being raised as nitpicking, and no one likes nitpicking.&lt;/p&gt;&#xA;&lt;p&gt;This puts us in a balancing act of trying to keep a site culture that promotes healthy questions, and keeps returning users interested and a site culture that doesn't seem arbitrary and nitpicky to newcomers.&lt;/p&gt;&#xA;&lt;p&gt;The best tool we have for this is the Meta, where we can explain the issues and summarize debates that have occurred over years or months into a clear couple of paragraphs.&lt;/p&gt;&#xA;&lt;p&gt;And it is the case that in your example the &amp;quot;nitpickers&amp;quot; linked to the meta in their comments.  At least in the example you linked users were operating with an established consensus behind them.  That doesn't always make them right, but it does make it a little hard for me to call it nitpicking.&lt;/p&gt;&#xA;&lt;h2&gt;Bandwagon&lt;/h2&gt;&#xA;&lt;p&gt;This is also a rather loaded term.  It seems to ascribe a certain arbitrariness to the motives of the people involved.&lt;/p&gt;&#xA;&lt;p&gt;The likely explanation for me is that some blocks of users largely agree on what they want to see in the site, and for that reason vote together.  I don't really see a lot of users voting for something just because other users have.  It just doesn't seem very plausible.&lt;/p&gt;&#xA;&lt;p&gt;But it can feel like there are gangs when the sites culture has reached an opinion.  And there are divisive policy issues among code-golf users that can lead to factionalism.  I see how this can be perceived as unfriendly.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2020-06-20T00:37:35.077" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19051" PostTypeId="2" ParentId="19049" CreationDate="2020-06-20T10:29:42.910" Score="19" Body="&lt;h2&gt;Conservation of nitpicking&lt;/h2&gt;&#xA;&lt;p&gt;I want to give a pragmatic answer on the need for nitpicking. By nitpicks, I mean tedious-seeming inquiries on minor points like &amp;quot;Can the list be empty?&amp;quot; or &amp;quot;Exactly how can a month be written in the input?&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;Basically, nits left unpicked on the challenge will be picked in the answers. I've seen multiple answers get independent comments raising the same issue, questioning whether the answer is valid or a golf would be legal. Or, answers that each post two versions of the code, with one labelled like &amp;quot;If the month can be taken as a number&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;The worst is when I have to delete my answer because I understood something to be allowed that wasn't. And I feel icky whenever I outgolf someone using an improvement that was only clarified to be legal after they submitted. Or, they might disagree if the issue is still unclear. We tend to be pretty non-competitive and non-confrontational here, but I do feel some tension when this happens, sometimes even avoiding it by not posting an answer I've written.&lt;/p&gt;&#xA;&lt;p&gt;But now you might ask, why do we need to nitpick answers either? Can't we just let them be -- this &lt;em&gt;is&lt;/em&gt; a recreational programming site? Well, it comes with the territory of golfing. We optimize relentlessly, which means we need to know exactly what the requirements are. It's no fun when a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8079/20260&quot;&gt;Do X without Y&lt;/a&gt; challenge devolves into rules-lawyering whether answers doing Y' are &lt;em&gt;actually&lt;/em&gt; doing Y.&lt;/p&gt;&#xA;&lt;p&gt;Many times an obscure corner case for which I ask for clarification actually came up while golfing a bizarre byte-save. Other times I ask right when I see the just-posted challenge and recognize an ambiguity that may come up in someone's golf. And sometimes, &lt;em&gt;is bound to&lt;/em&gt; come up with so many answers doing so many weird things. These nitpicks aren't to hound the asker but to alert them to a potential issue they can then clarify before it impacts answerers.&lt;/p&gt;&#xA;&lt;p&gt;I'll also add, we have reduced the need to nitpick by making &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/20260&quot;&gt;defaults for inputs and outputs&lt;/a&gt; that are liberal yet well-specified, avoiding nitpicking on, say, exactly what can denote a list of numbers. And I think that's gone great, and would like to see more minor questions have standard answers to avoid them being asked again and again.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2020-06-20T20:11:59.197" LastActivityDate="2020-06-20T20:11:59.197" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19052" PostTypeId="2" ParentId="19041" CreationDate="2020-06-21T03:42:58.890" Score="0" Body="&lt;h1&gt;Allow multiple winners&lt;/h1&gt;&#xA;&lt;p&gt;We already had a tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Consider there is a challenge which input a graph &lt;span class=&quot;math-container&quot;&gt;\$ G(V, E) \$&lt;/span&gt; and output something. The big-O notation may be measured in both V, and E. Someone may come up with an algorithm &lt;span class=&quot;math-container&quot;&gt;\$O(V^2E)\$&lt;/span&gt; while others provide &lt;span class=&quot;math-container&quot;&gt;\$O(VE^2)\$&lt;/span&gt; algorithm. Without given the assumption of the relation of &lt;span class=&quot;math-container&quot;&gt;\$V\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt;, there is no way to tell which algorithm is better.&lt;/p&gt;&#xA;&lt;p&gt;The above example not only happened when writing challenges on this site. But also happened in the real world. Most real-world libraries provide these functional by including both algorithm so caller may chose which one to use. Both algorithm could be considered &lt;em&gt;good&lt;/em&gt; enough in such case.&lt;/p&gt;&#xA;&lt;p&gt;We should also allow multiple winners as they are both good but no one better.&lt;/p&gt;&#xA;" OwnerUserId="44718" LastEditorUserId="44718" LastEditDate="2020-06-21T04:47:43.890" LastActivityDate="2020-06-21T04:47:43.890" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19055" PostTypeId="2" ParentId="19049" CreationDate="2020-06-22T03:39:51.270" Score="6" Body="&lt;h2&gt;Why do users nitpick questions?&lt;/h2&gt;&#xA;&lt;p&gt;Because it makes the challenges better (and hence, more fun for everyone), and evens the playing field.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I'm bringing this specific example up because I spent two hours golfing this challenge only to find out people closed it because of its constraint, and now I can't even share my answer with anyone.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Yep. That's why people try to quickly &amp;quot;nitpick&amp;quot; challenges to find problems and avoid this situation.&lt;/p&gt;&#xA;&lt;h2&gt;Why do users jump on bandwagons?&lt;/h2&gt;&#xA;&lt;p&gt;I have never seen anything like this. &amp;quot;Jumping on the bandwagon&amp;quot; means, doing something just because everyone else is doing it, even if it's of questionable value. You'd need some evidence for this.&lt;/p&gt;&#xA;" OwnerUserId="30512" LastActivityDate="2020-06-22T03:39:51.270" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19056" PostTypeId="2" ParentId="19049" CreationDate="2020-06-22T12:08:56.760" Score="5" Body="&lt;p&gt;I can't comment on the &amp;quot;bandwagon&amp;quot;, as doing so would include making assumptions about people's motivations for voting, while these cannot easily be determined.&lt;/p&gt;&#xA;&lt;p&gt;Regarding nitpicking, note that &lt;em&gt;challenges must have an objective scoring criterion,&lt;/em&gt; and thus, if a challenge isn't fully specified, it doesn't abide by the rules. Unobservable restrictions, like banning an underspecified class of built-ins, makes it impossible to even judge whether a particular answer is valid. A fortiori scoring it!&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, it is &lt;em&gt;highly recommended to first post proposed challenges in the Sandbox&lt;/em&gt; so experienced users can review. This lessens the chance of disappointment from criticism upon launch. I personally recommend visiting &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; chat room to request further review of a sandboxed challenge.&lt;/p&gt;&#xA;&lt;p&gt;Considering the above, I find it very appropriate that the site carries the following warning on all main pages:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Code Golf Stack Exchange is a site for recreational programming competitions, not general programming questions. Challenges must have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8130/why-do-we-have-objective-winning-criteria&quot;&gt;an objective scoring criterion&lt;/a&gt;, and it is highly recommended to first post proposed challenges in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="73111" LastEditDate="2020-06-25T08:28:05.843" LastActivityDate="2020-06-25T08:28:05.843" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19057" PostTypeId="2" ParentId="2140" CreationDate="2020-06-22T12:59:16.410" Score="2" Body="&lt;h1&gt;Posted at &lt;a href=&quot;https://codegolf.stackexchange.com/q/206452/68200&quot;&gt;Baba if you, flag is win&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="68200" LastEditorUserId="68200" LastEditDate="2020-06-25T00:00:00.033" LastActivityDate="2020-06-25T00:00:00.033" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19058" PostTypeId="2" ParentId="2140" CreationDate="2020-06-22T15:08:43.343" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/206470/the-one-counting-challenge-to-rule-them-all&quot;&gt;Posted&lt;/a&gt;.&lt;/h1&gt;&#xA;" OwnerUserId="90585" LastEditorUserId="90585" LastEditDate="2020-06-25T16:06:19.947" LastActivityDate="2020-06-25T16:06:19.947" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="19059" PostTypeId="2" ParentId="2140" CreationDate="2020-06-22T21:41:05.247" Score="-2" Body="&lt;h1&gt;Wuhan Xi Estimates&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;br&gt;&#xA;Create a program that takes two base-ten integer number inputs (&lt;em&gt;w&lt;/em&gt;,&lt;em&gt;x&lt;/em&gt;). The program should output the closest integer number that is &lt;em&gt;x&lt;/em&gt; order of magnitude smaller than &lt;em&gt;w&lt;/em&gt;,  rounded downwards. The output should be zero if the result is less than 1.&#xA;&lt;br&gt;&#xA;&lt;br&gt;&#xA;&lt;strong&gt;Test cases&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;f(10,1) = 1&#xA;f(10,2) = 0&#xA;f(1000000, 3) = 1000&#xA;f(888, 2) = 8&#xA;f(99999, 4) = 9&#xA;f(7777777, 8) = 0&#xA;f(123455, 5) = 1&#xA;f(123455, 4) = 12345&#xA;f(123455, 0) = 123455&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example Code&lt;/strong&gt;&lt;br&gt;&#xA;Here's an ungolfed example in &lt;strong&gt;&lt;a href=&quot;https://www.lua.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Lua&lt;/a&gt;&lt;/strong&gt;:&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-lua prettyprint-override&quot;&gt;&lt;code&gt;&#xA;b=io.read()&#xA;a,b=b:match(&quot;([^,]+),([^,]+)&quot;)&#xA;&#xA;if (b+0 &gt; #a) then &#xA;    print(0)&#xA;else &#xA;    d = (a+0)/(10^b)&#xA;    print (math.floor(d))&#xA;end&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##PcfBCoJAEADQc/MVg15mcBItvQT2I1EwkxMu6Ba6fv92iU6PN@@asw3hXa@uIzGo2GCXRdNzooJuD7lXLD8LBggvJKsavGKpjGnyiHD4rCEmahh83vx/q7fdSKWVUo/GjOBxhJzb07nre@m@&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Lua – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&#xA;&lt;br&gt;&lt;br&gt;&#xA;&lt;strong&gt;General rules&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes in its respective language wins.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet/2422#2422&quot;&gt;Standard rules apply&lt;/a&gt; for your answer with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods/&quot;&gt;default I/O rules&lt;/a&gt;, so you are allowed to use STDIN (with the specification above)/STDOUT, functions/method with the proper parameters and return-type, full programs.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Default Loopholes&lt;/a&gt; are forbidden.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If possible, please add a link with a test for your code (&lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="81263" LastEditorUserId="81263" LastEditDate="2020-06-23T05:56:31.723" LastActivityDate="2020-06-23T05:56:31.723" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="19060" PostTypeId="2" ParentId="19049" CreationDate="2020-06-24T00:47:36.993" Score="4" Body="&lt;p&gt;There are several questions in one; I'll share my perspective on some of them.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;people are downvoted simply because ... it uses a different approach&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;We try to downvote content, not people. I can imagine that if you post a worse answer when a better answer already exists, you add clutter, so this is bad content. Unless it uses a different approach, of course! &amp;quot;Different approach&amp;quot; is a subjective term; I can only guess that for some people, approach doesn't matter at all - they judge answers by length alone. Especially if it's in a language which they don't understand.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I've also noticed sometimes people don't read entire questions ...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;On this site, &lt;a href=&quot;https://meta.stackexchange.com/a/22368/237804&quot;&gt;timing is very important&lt;/a&gt;. Sometimes, if you think 1 minute before doing some action, it's too late. For example, if the question is vague, you should close it before anyone posts an answer - then you can edit and reopen without the need to be careful not to invalidate existing answers. As a consequence, people try to do moderation (= nitpick) before reading the whole question! The thinking is:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;em&gt;This user is not one of the established users who post good challenges, so there must be a problem here somewhere. Let's find the first possible problem in the post and comment on it fast, before people try to solve the challenge! No need to read the whole post, because certainly the user doesn't clarify it later in the post!&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;(I may have exaggerated here)&lt;/p&gt;&#xA;" OwnerUserId="25315" LastActivityDate="2020-06-24T00:47:36.993" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19061" PostTypeId="2" ParentId="2140" CreationDate="2020-06-25T14:47:27.853" Score="0" Body="&lt;h1&gt;Default Lightning Strike&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Introduction:&lt;/h2&gt;&#xA;&lt;p&gt;Inspired by this reddit question: &lt;a href=&quot;https://www.reddit.com/r/explainlikeimfive/comments/hf6ybh/eli5_why_does_lightning_travel_in_a_zigzag_manner/&quot; rel=&quot;nofollow noreferrer&quot;&gt;ELI5: Why does lightning travel in a zig-zag manner rather than a straight line?&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Although it's more complex than this, in general multiple lightning paths will randomly check its immediate surrounding for the direction with least resistance (based on air pressure, temperature, composure, humility, etc.) and travel in that direction. As soon as one of the paths reaches the ground, that entire path has the least resistance and most (although not all) of the ions will accumulate in that path, causing the lightning flash and thunder.&lt;br /&gt;&#xA;&lt;a href=&quot;https://www.youtube.com/watch?v=dukkO7c2eUE&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here a slow-mo video of a lightning strike to get an idea.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Challenge:&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; An integer &lt;span class=&quot;math-container&quot;&gt;\$h\geq3\$&lt;/span&gt; and an integer &lt;span class=&quot;math-container&quot;&gt;\$1\leq p\leq\left\lfloor\frac{h}{2}\right\rfloor\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt; Each step of the ASCII animation of a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; lightning strike, with a cloud to earth height of &lt;span class=&quot;math-container&quot;&gt;\$h\$&lt;/span&gt; and &lt;em&gt;up to&lt;/em&gt; &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt; paths&lt;/p&gt;&#xA;&lt;p&gt;We start with a lightning ion at the cloud, with a lowercase letter of your own choosing (i.e. &lt;code&gt;b&lt;/code&gt;). This ion will travel in a random direction (horizontally, vertically, or (anti-)diagonally), except where this path itself comes from. Every 'tick' it also has a 20% chance of branching out into two paths, as long as we haven't reached &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt; paths yet. Each of these paths will behave the same.&lt;br /&gt;&#xA;As soon as any path hits the ground based on the height &lt;span class=&quot;math-container&quot;&gt;\$h\$&lt;/span&gt;, all letters of that particular path will become uppercase, and in the final 'tick' after that, only this uppercase path will remain.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge rules:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Paths can intersect with other paths&lt;/li&gt;&#xA;&lt;li&gt;Paths can travel upwards beyond the height of our starting point&lt;/li&gt;&#xA;&lt;li&gt;Output can be in any reasonable format. Could be a list of multi-line strings for each 'tick'. Could be a list of character-matrices for each 'tick'. Could be pretty-printed to STDOUT (with clear non-whitespace separation between each 'tick' - i.e. a single character like a comma or semi-colon, or a line of &lt;code&gt;---&lt;/code&gt; or &lt;code&gt;___&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Trailing spaces for each line of a tick are optional (leading as well, as long as the lightning bolts are still correct)&lt;/li&gt;&#xA;&lt;li&gt;If multiple paths strike the ground in the same 'tick', only the first one of those two (or more) paths will become the lightning strike. The order in which paths are created are therefore important, so keep that in mind.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples:&lt;/h2&gt;&#xA;&lt;p&gt;This may all sound pretty vague, so here a couple of examples:&lt;br /&gt;&#xA;(I've added trailing spaces for each step with spaces, but you don't necessarily have to do so as mentioned in the challenge rules.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example 1:&lt;/strong&gt; &lt;span class=&quot;math-container&quot;&gt;\$h=3, p=1\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Tick 1:&#xA;&amp;quot;b&amp;quot;&#xA;&amp;quot; &amp;quot;&#xA;&amp;quot; &amp;quot;&#xA;Tick 2 (random direction: right):&#xA;&amp;quot;bb&amp;quot;&#xA;&amp;quot;  &amp;quot;&#xA;&amp;quot;  &amp;quot;&#xA;Tick 3 (random direction: up-left):&#xA;&amp;quot;b &amp;quot;&#xA;&amp;quot;bb&amp;quot;&#xA;&amp;quot;  &amp;quot;&#xA;&amp;quot;  &amp;quot;&#xA;Tick 4 (random direction: down-left):&#xA;&amp;quot; b &amp;quot;&#xA;&amp;quot;bbb&amp;quot;&#xA;&amp;quot;   &amp;quot;&#xA;&amp;quot;   &amp;quot;&#xA;Tick 5 (random direction: down):&#xA;&amp;quot; b &amp;quot;&#xA;&amp;quot;bbb&amp;quot;&#xA;&amp;quot;b  &amp;quot;&#xA;&amp;quot;   &amp;quot;&#xA;Tick 6 (random direction: up-right):&#xA;Note that this overlaps with a previous step in this path, which is fine.&#xA;&amp;quot; b &amp;quot;&#xA;&amp;quot;bbb&amp;quot;&#xA;&amp;quot;b  &amp;quot;&#xA;&amp;quot;   &amp;quot;&#xA;Tick 7 (random direction: down-right):&#xA;&amp;quot; b &amp;quot;&#xA;&amp;quot;bbb&amp;quot;&#xA;&amp;quot;b b&amp;quot;&#xA;&amp;quot;   &amp;quot;&#xA;Tick 8 (random direction: down):&#xA;&amp;quot; b &amp;quot;&#xA;&amp;quot;bbb&amp;quot;&#xA;&amp;quot;b b&amp;quot;&#xA;&amp;quot;  b&amp;quot;&#xA;Tick 9 (lightning strike):&#xA;&amp;quot; B &amp;quot;&#xA;&amp;quot;BBB&amp;quot;&#xA;&amp;quot;B B&amp;quot;&#xA;&amp;quot;  B&amp;quot;&#xA;Tick 10 (extra tick to remove all other paths, although there are none right now):&#xA;&amp;quot; B &amp;quot;&#xA;&amp;quot;BBB&amp;quot;&#xA;&amp;quot;B B&amp;quot;&#xA;&amp;quot;  B&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example 2:&lt;/strong&gt; &lt;span class=&quot;math-container&quot;&gt;\$h=5, p=2\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Tick 1:&#xA;&amp;quot;b&amp;quot;&#xA;&amp;quot; &amp;quot;&#xA;&amp;quot; &amp;quot;&#xA;&amp;quot; &amp;quot;&#xA;&amp;quot; &amp;quot;&#xA;Tick 2 (random direction: down-left):&#xA;&amp;quot; b&amp;quot;&#xA;&amp;quot;b &amp;quot;&#xA;&amp;quot;  &amp;quot;&#xA;&amp;quot;  &amp;quot;&#xA;&amp;quot;  &amp;quot;&#xA;Tick 3 (random direction: down-left):&#xA;&amp;quot;  b&amp;quot;&#xA;&amp;quot; b &amp;quot;&#xA;&amp;quot;b  &amp;quot;&#xA;&amp;quot;   &amp;quot;&#xA;&amp;quot;   &amp;quot;&#xA;Tick 4 (random direction: right):&#xA;&amp;quot;  b&amp;quot;&#xA;&amp;quot; b &amp;quot;&#xA;&amp;quot;bb &amp;quot;&#xA;&amp;quot;   &amp;quot;&#xA;&amp;quot;   &amp;quot;&#xA;Tick 5 (random 20% path split; random direction 1: top-right, random direction 2: right):&#xA;&amp;quot;  b&amp;quot;&#xA;&amp;quot; bb&amp;quot;&#xA;&amp;quot;bbb&amp;quot;&#xA;&amp;quot;   &amp;quot;&#xA;&amp;quot;   &amp;quot;&#xA;Tick 6 (random direction 1: top-left, random direction 2: down):&#xA;&amp;quot; bb&amp;quot;&#xA;&amp;quot; bb&amp;quot;&#xA;&amp;quot;bbb&amp;quot;&#xA;&amp;quot;  b&amp;quot;&#xA;&amp;quot;   &amp;quot;&#xA;Tick 7 (random direction 1: left, random direction 2: down-right):&#xA;&amp;quot;bbb &amp;quot;&#xA;&amp;quot; bb &amp;quot;&#xA;&amp;quot;bbb &amp;quot;&#xA;&amp;quot;  b &amp;quot;&#xA;&amp;quot;   b&amp;quot;&#xA;Tick 8 (lightning strike of path 2):&#xA;&amp;quot;bbB &amp;quot;&#xA;&amp;quot; Bb &amp;quot;&#xA;&amp;quot;BBB &amp;quot;&#xA;&amp;quot;  B &amp;quot;&#xA;&amp;quot;   B&amp;quot;&#xA;Tick 9 (extra tick to remove all the other paths, which is path 1 in this case):&#xA;&amp;quot;  B &amp;quot;&#xA;&amp;quot; B  &amp;quot;&#xA;&amp;quot;BBB &amp;quot;&#xA;&amp;quot;  B &amp;quot;&#xA;&amp;quot;   B&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;General rules:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins.&lt;br /&gt;&#xA;Don't let code-golf languages discourage you from posting answers with non-codegolfing languages. Try to come up with an as short as possible answer for 'any' programming language.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet/2422#2422&quot;&gt;Standard rules apply&lt;/a&gt; for your answer with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods/&quot;&gt;default I/O rules&lt;/a&gt;, so you are allowed to use STDIN/STDOUT, functions/method with the proper parameters and return-type, full programs. Your call.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Default Loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;If possible, please add a link with a test for your code (i.e. &lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Also, adding an explanation for your answer is highly recommended.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;&lt;em&gt;Sandbox Questions:&lt;/em&gt;&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Should I perhaps use a different letter of the alphabet per path?&lt;/em&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If yes: what would happen when different letter-paths overlap? I assume the top one will be visible per 'tick', but if lightning is struck it should still change it to the underlying letter as uppercase. In either case, you'll have to keep track of each individual path and uppercase only the one that struck the ground (first).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Any additional rules or things that are unclear?&lt;/li&gt;&#xA;&lt;li&gt;An additional relevant tag?&lt;/li&gt;&#xA;&lt;li&gt;More examples with more paths and/or larger height?&lt;/li&gt;&#xA;&lt;li&gt;A different path percentage instead of hard-coded &lt;span class=&quot;math-container&quot;&gt;\$\frac{1}{5}\$&lt;/span&gt; / 20%.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="52210" LastActivityDate="2020-06-25T14:47:27.853" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19062" PostTypeId="2" ParentId="2140" CreationDate="2020-06-25T21:56:52.250" Score="0" Body="&lt;h1&gt;Sort numbers using as few distinct bytes as possible&lt;/h1&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Write an algorithm that takes as input an ordered list (&lt;a href=&quot;https://en.wikipedia.org/wiki/Array_data_structure&quot; rel=&quot;nofollow noreferrer&quot;&gt;array&lt;/a&gt;, &lt;a href=&quot;https://en.wikipedia.org/wiki/Linked_list&quot; rel=&quot;nofollow noreferrer&quot;&gt;linked list&lt;/a&gt;, etc...) of numbers and outputs an ordered list containing the same numbers sorted by their value (ascending or descending).&lt;/p&gt;&#xA;&lt;p&gt;The numbers may be represented using the most convenient format to you, with the only restriction that there must be a way to encode 256 distinct numbers. You are not allowed to use built-in sorting functions/algorithms.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring criteria&lt;/h2&gt;&#xA;&lt;p&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$c\$&lt;/span&gt; be the number of distinct bytes in your code* and let &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; be the number of bytes in your code*.&lt;br&gt;&#xA;*Or its UTF-8 representation&lt;/p&gt;&#xA;&lt;p&gt;The score is equal to &lt;span class=&quot;math-container&quot;&gt;\$c^2 + s\$&lt;/span&gt;. The answer with the lowest score wins!&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt; (imagine these are sorting algorithms):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;ababccbaacbabcba&lt;/code&gt; → &lt;span class=&quot;math-container&quot;&gt;\$c=3, s=16, score=25\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;aAbcd€f&lt;/code&gt; → &lt;span class=&quot;math-container&quot;&gt;\$c=9, s=9, score=90\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;bytes &lt;code&gt;16 ee 3c 79 ee&lt;/code&gt; → &lt;span class=&quot;math-container&quot;&gt;\$c=4, s=5, score=21\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I'm open to suggestions, especially about the score formula.&lt;/p&gt;&#xA;" OwnerUserId="95061" LastEditorUserId="95061" LastEditDate="2020-06-25T22:10:40.670" LastActivityDate="2020-06-25T22:10:40.670" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="19063" PostTypeId="2" ParentId="2140" CreationDate="2020-06-27T07:40:00.687" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/206682/logo-pack-lapack&quot;&gt;Logo Pack LAPACK (Posted)&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="17360" LastEditorUserId="17360" LastEditDate="2020-07-02T20:23:45.867" LastActivityDate="2020-07-02T20:23:45.867" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19064" PostTypeId="2" ParentId="2140" CreationDate="2020-06-27T08:08:41.730" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/206904/distributive-on-myself&quot;&gt;Distributive on myself&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="90585" LastEditorUserId="90585" LastEditDate="2020-07-09T08:21:30.347" LastActivityDate="2020-07-09T08:21:30.347" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19068" PostTypeId="2" ParentId="2140" CreationDate="2020-06-29T22:26:10.340" Score="1" Body="&lt;h1&gt;Write an expect program&lt;/h1&gt;&#xA;&lt;p&gt;If you're not already familiar, expect is a Tcl extension that makes it easier to script interactions with programs. It allows you to spawn a process, send lines to it, and wait for expected output before continuing.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;The aim of this challenge is to write a very simple implementation of expect in as few bytes as possible (code golf). It should parse a script, with commands separated by newlines. Then it should use this script to interact with a program.&lt;/p&gt;&#xA;&lt;p&gt;Here are the commands for this implementation:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;spawn &amp;lt;cmd&amp;gt;&lt;/code&gt;: spawn a process.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;write &amp;lt;line&amp;gt;&lt;/code&gt;: write a line into the process' input.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;expect &amp;lt;line&amp;gt;&lt;/code&gt;: expect a substring from the process' output. No timeout is necessary, if the line never appears it is OK for the program to hang.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;print &amp;lt;line&amp;gt;&lt;/code&gt;: print something to stdout.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You can assume that only one &lt;code&gt;spawn&lt;/code&gt; will be found in the script, and that it will appear before any &lt;code&gt;write&lt;/code&gt; or &lt;code&gt;expect&lt;/code&gt;. If your language of choice doesn't have the ability to spawn processes, you can write a helper program in a different language that can pipe input and output through your main program. How you do this is left up to you.&lt;/p&gt;&#xA;&lt;p&gt;Example script:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;spawn /bin/bash&#xA;write whoami&#xA;expect root&#xA;write uname -a&#xA;expect Linux&#xA;print i am root on Linux&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;this is Linux&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;spawn /bin/bash&#xA;write uname -a&#xA;expect Windows&#xA;print this is Windows&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(no output.)&lt;/p&gt;&#xA;&lt;h2&gt;Restrictions&lt;/h2&gt;&#xA;&lt;p&gt;In order to keep things fresh, the use of the standard &lt;code&gt;expect&lt;/code&gt; utility or any libraries that emulate &lt;code&gt;expect&lt;/code&gt; functionality (such as &lt;code&gt;pexpect&lt;/code&gt; on Python or &lt;code&gt;jest&lt;/code&gt; on Node) are not allowed. The idea is that the bulk of the functionality should be written in the program and not handled in a library.&lt;/p&gt;&#xA;" OwnerUserId="95691" LastEditorUserId="95691" LastEditDate="2020-06-30T20:22:55.440" LastActivityDate="2020-06-30T20:22:55.440" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="19071" PostTypeId="2" ParentId="2140" CreationDate="2020-07-02T13:51:15.617" Score="0" Body="&lt;h1&gt;Fix mispellings &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Wikipedia has a &lt;a href=&quot;https://en.wikipedia.org/wiki/Wikipedia:Lists_of_common_misspellings&quot; rel=&quot;nofollow noreferrer&quot;&gt;list of common misspellings&lt;/a&gt;, and there is also a machine-readable version!&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to input a string and fix the mispellings in it.&lt;/p&gt;&#xA;&lt;p&gt;The parituclar list we'll be using is &lt;a href=&quot;https://en.wikipedia.org/w/index.php?title=Wikipedia:Lists_of_common_misspellings/For_machines&amp;amp;oldid=962756669#The_Machine-Readable_List&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://en.wikipedia.org/w/index.php?title=Wikipedia:Lists_of_common_misspellings/For_machines&amp;amp;oldid=962756669#The_Machine-Readable_List&lt;/a&gt;. Note that even if the list changes, you must use this version. Here's a pastebin link: &lt;a href=&quot;https://pastebin.com/j03aL98d&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://pastebin.com/j03aL98d&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Each line in the list is in the format &lt;code&gt;INPUT-&amp;gt;OUTPUT1, OUTPUT2, OUTPUT3, ...&lt;/code&gt; (of course, there may be more or less possible outputs, or even just one). That means that for input &lt;code&gt;INPUT&lt;/code&gt; you must output exactly one of the possible outputs &lt;code&gt;OUTPUT...&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This is tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer wins.&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox stuff&lt;/h1&gt;&#xA;&lt;p&gt;Should I add more misspellings to the post, or should I remove them?&lt;/p&gt;&#xA;" OwnerUserId="36445" LastActivityDate="2020-07-02T13:51:15.617" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19075" PostTypeId="2" ParentId="2140" CreationDate="2020-07-04T20:45:31.190" Score="0" Body="&lt;h2&gt;Overlap characters &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Put all the characters of a given list, following the order, in a sequence of bits keeping it as small as possible.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Write the bits of each character on a line.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can overlap bits if they are equal.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You cannot change already written bits.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Extend the line, in both directions, if not all the bits fit in.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Always try to extend as less as possible.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;input :['a','&amp;','1','.']&#xA;     0110 0001  // a&#xA;0010 0110      // &amp;&#xA;           001 1000 1     // 1&#xA;                 00 1011 10 // .&#xA;                 &#xA;output :0010011000011000101110&#xA;&#xA;input : &quot;&amp;1a.&quot;&#xA;&#xA;       0010 0110      // &amp;&#xA;          0 0110 001     // 1&#xA;0 1100 001  // a&#xA;                 0010 1110 // .&#xA;                 &#xA;output : 011000010011000101110&#xA;&#xA;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;I/O rules&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;input can be any sequence of single byte elements.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;output the resulting sequence of bits in any convenient method, no extraneous bits allowed (0 or 1)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="84844" LastEditorUserId="84844" LastEditDate="2020-07-04T22:39:51.717" LastActivityDate="2020-07-04T22:39:51.717" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19079" PostTypeId="2" ParentId="2140" CreationDate="2020-07-05T16:40:31.087" Score="1" Body="&lt;h1&gt;Count faces in ASCII art &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Here's a 2x2 ASCII art face:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;oo&#xA;__&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here's a 3x3 ASCII art face:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;o o&#xA;   &#xA;___&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here's a 4x4 ASCII art face:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;o  o&#xA;    &#xA;    &#xA;____&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your task is to count faces in an ASCII art.&lt;/p&gt;&#xA;&lt;p&gt;Here's something closer to an actual specification.&lt;/p&gt;&#xA;&lt;p&gt;The bottom of any face must be a contiguous horizontal row of underscores, such that cells to the right and to the left of it do not contain underscores. If the row is considered as the bottom row of an ASCII square, then that square forms a face if and only if its bottom row is all underscores, its upper left and upper right corners are &lt;code&gt;o&lt;/code&gt;s, and the rest is whitespace.&lt;/p&gt;&#xA;&lt;p&gt;You may assume all lines in the input to be padded on the right with whitespace to an equal length. Faces cannot be smaller than 2x2.&lt;/p&gt;&#xA;&lt;p&gt;[todo: more test cases]&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;o o&#xA;   oo&#xA;_____&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output: 0&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox stuff&lt;/h1&gt;&#xA;&lt;p&gt;Is it clear what is considered a face and what is not?&lt;/p&gt;&#xA;" OwnerUserId="36445" LastEditorUserId="36445" LastEditDate="2020-07-05T17:01:35.010" LastActivityDate="2020-07-05T17:01:35.010" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19080" PostTypeId="2" ParentId="2140" CreationDate="2020-07-06T00:17:50.983" Score="4" Body="&lt;h1&gt;Implement an HTML renderer &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; This challenge explaination is very much incomplete - it merely contains ideas that will require revising to form a proper challenge post.&lt;/p&gt;&#xA;&lt;p&gt;The premise of the challenge is to write a program that take an HTML document as an input, and outputs an ASCII equivalent. Obviously, working with real HTML is not possible, so this challenge will use a &lt;em&gt;very limited&lt;/em&gt; and &lt;em&gt;modified&lt;/em&gt; subset of HTML.&lt;/p&gt;&#xA;&lt;p&gt;Here is an example of a potential input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;body&amp;gt;&#xA;    &amp;lt;h1&amp;gt;A Document&amp;lt;/h1&amp;gt;&#xA;    &amp;lt;div&amp;gt;&#xA;        &amp;lt;span&amp;gt;Hello, this is some text&amp;lt;/span&amp;gt;&#xA;        &amp;lt;img&amp;gt; 8 2 &amp;lt;/img&amp;gt;&#xA;    &amp;lt;/div&amp;gt;&#xA;&amp;lt;/body&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Which would yield the following output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+--------------------+&#xA;|A DOCUMENT          |&#xA;|                    |&#xA;|+------------------+|&#xA;||Hello, this is som||&#xA;||e text            ||&#xA;||+--------+        ||&#xA;|||@~@~@~@~|        ||&#xA;|||~@~@~@~@|        ||&#xA;||+--------+        ||&#xA;|+------------------+|&#xA;+--------------------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;HTML elements that will be implemented:&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;&amp;lt;span&amp;gt;&lt;/strong&gt; - Renders text between the tags, wrapping when necessary.&lt;/p&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;body&amp;gt;&#xA;&amp;lt;span&amp;gt;&#xA;    This is a span element.&#xA;    You can write text in here.&#xA;&amp;lt;/span&amp;gt;&#xA;&amp;lt;/body&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+--------------------+&#xA;|This is a span eleme|&#xA;|nt. You can write te|&#xA;|xt in here.         |&#xA;|                    |&#xA;|                    |&#xA;|                    |&#xA;|                    |&#xA;|                    |&#xA;|                    |&#xA;|                    |&#xA;+--------------------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Extra explanation needed to clarify whitespace and character set issues)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&amp;lt;p&amp;gt;&lt;/strong&gt; (Explanations are omitted to save space)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&amp;lt;h1&amp;gt;&lt;/strong&gt; - &lt;strong&gt;&amp;lt;h6&amp;gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&amp;lt;div&amp;gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&amp;lt;img&amp;gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox questions/remakrs&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I believe it is possible to write an unambiguous and specific set of rules for how an &amp;quot;HTML document&amp;quot; should be rendered&lt;/li&gt;&#xA;&lt;li&gt;It will require lots of careful explanation, wording, and ample examples&lt;/li&gt;&#xA;&lt;li&gt;However this challenge seems very long and complicated and it seems like it might not be in the spirit of a code golf challenge&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;What do you guys think?&lt;/p&gt;&#xA;" OwnerUserId="73066" LastEditorUserId="73066" LastEditDate="2020-07-06T00:24:48.997" LastActivityDate="2020-07-06T00:24:48.997" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19081" PostTypeId="2" ParentId="19041" CreationDate="2020-07-06T00:30:59.767" Score="1" Body="&lt;h1&gt;Yes, it is valid&lt;/h1&gt;&#xA;&lt;p&gt;After having some discussion with multiple users, I now feel like it should be a valid winning criterion.&lt;/p&gt;&#xA;&lt;p&gt;The &amp;quot;winning criterion&amp;quot; is there mostly to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8135/78410&quot;&gt;motivate the answerers to optimize the code further&lt;/a&gt;. While the proposed winning criterion does not give &lt;em&gt;one&lt;/em&gt; objective to optimize for, one can choose one of &lt;em&gt;two&lt;/em&gt; objectives (or both at once), so that the new answer strictly beats the previous one.&lt;/p&gt;&#xA;&lt;p&gt;@tsh's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt; is probably not a good fit here because the relationship between &lt;span class=&quot;math-container&quot;&gt;\$O(VE^2)\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$O(V^2 E)\$&lt;/span&gt; can be resolved by specifying the relationship between &lt;span class=&quot;math-container&quot;&gt;\$V\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt; in the challenge (e.g. by saying &lt;span class=&quot;math-container&quot;&gt;\$E=O(V \log{V})\$&lt;/span&gt; which makes &lt;span class=&quot;math-container&quot;&gt;\$O(V^2 E)\$&lt;/span&gt; superior); IIRC lack of such relationship is considered unclear.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2020-07-06T00:30:59.767" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19083" PostTypeId="2" ParentId="2140" CreationDate="2020-07-07T06:46:01.747" Score="1" Body="&lt;h1&gt;The almost impossible chessboard puzzle &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle-solver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle-solver&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle-solver&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/error-correction&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;error-correction&amp;#39;&quot; rel=&quot;tag&quot;&gt;error-correction&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Prisoner 1 walks in, sees a chessboard (8x8) where each square has a coin on top, flipped either to heads or tails. The warden places the key under one of the squares, which prisoner 1 sees. Before prisoner 1 leaves, he must turn over one and only one coin.  Prisoner 2 then walks in and is supposed to be able to figure out which squares the key is in just by looking at the arrangement of coins.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The prisoners are granted a reward if prisoner 2 correctly tells the location of the key.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Write two program/functions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;One for prisoner 1, which outputs the location of the coin to flip given the current board state and the location of the key&lt;/li&gt;&#xA;&lt;li&gt;One for prisoner 2, which outputs the location of the key given the board state after prisoner 1 doing the flip.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If both the solutions are function they may share code with an auxiliary function, though the solutions may not share any information.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest bytes wins&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;em&gt;Heavily inspired by &lt;a href=&quot;https://www.youtube.com/watch?v=as7Gkm7Y7h4&quot; rel=&quot;nofollow noreferrer&quot;&gt;The almost impossible chessboard puzzle&lt;/a&gt; and &lt;a href=&quot;https://www.youtube.com/watch?v=wTJI_WuZSwE&quot; rel=&quot;nofollow noreferrer&quot;&gt;The impossible chessboard puzzle&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should I include the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/error-correction&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;error-correction&amp;#39;&quot; rel=&quot;tag&quot;&gt;error-correction&lt;/a&gt; tag&lt;/li&gt;&#xA;&lt;li&gt;Any more tags I should add&lt;/li&gt;&#xA;&lt;li&gt;Is something not clear&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Also pretty sure this will require a lot of rewording before it can be asked&lt;/p&gt;&#xA;" OwnerUserId="91267" LastEditorUserId="91267" LastEditDate="2020-07-07T09:30:56.163" LastActivityDate="2020-07-07T09:30:56.163" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19084" PostTypeId="1" AcceptedAnswerId="19085" CreationDate="2020-07-07T10:35:06.227" Score="-4" ViewCount="215" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;The challenging nature of aggressively optimizing for program size has itself long been recognized&lt;br /&gt;&#xA;&lt;a href=&quot;https://en.wikipedia.org/wiki/Code_golf&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;In the old days, memory was very limited&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The larger 360 models could have up to 8 MB of main memory, though&#xA;main memory that big was unusual—a large installation might have as&#xA;little as 256 KB of main storage, but 512 KB, 768 KB or 1024 KB was&#xA;more common.&lt;br /&gt;&#xA;&lt;a href=&quot;https://en.wikipedia.org/wiki/IBM_System/360#:%7E:text=The%20larger%20360%20models%20could%20have%20up%20to,microsecond%29%20Large%20Capacity%20Storage%20%28LCS%29%20was%20also%20available&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Optimising for every scrap of memory made sense in those days and earlier. Now that everyone's laptop is more memory rich than all but the largest mainframes, I see no point in the activity.&lt;/p&gt;&#xA;&lt;p&gt;What we need now is programs that optimise for speed. A program that runs in 20 minutes instead of 20 hours is worth looking for.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Discussion points&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;(a) Do such speed contests exist and if so what are they called and where can they be found?&lt;/p&gt;&#xA;&lt;p&gt;(b) If not, why not?&lt;/p&gt;&#xA;&lt;p&gt;(c) Is code-golf an anachronism?&lt;/p&gt;&#xA;&lt;p&gt;P.S. Fewer bytes of high-level code does not necessarily translate to fewer bytes of machine code. Languages that are designed for brevity rather than comprehensibility are always going to win - aren't they?&lt;/p&gt;&#xA;" OwnerUserId="42144" LastEditorUserId="43319" LastEditDate="2020-07-07T10:56:38.937" LastActivityDate="2020-07-07T12:03:53.753" Title="What's so great about code-golf. We're in the 2020s and memory isn't an issue. How about code-FormulaOne instead?" Tags="|discussion|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19085" PostTypeId="2" ParentId="19084" CreationDate="2020-07-07T10:41:46.893" Score="6" Body="&lt;p&gt;(a) Yes, speed contests exist. They are tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;. A variation is the seeking of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;. Click these tags for more information about them.&lt;/p&gt;&#xA;&lt;p&gt;(b) N/A&lt;/p&gt;&#xA;&lt;p&gt;(c) No. Code golf isn't just to conserve memory (indeed, golfed code can often use more memory at run time than otherwise optimised code). There are multiple benefits, some of which I discuss in &lt;a href=&quot;https://youtu.be/3FjYly2G_QI?t=224&quot; rel=&quot;nofollow noreferrer&quot;&gt;this webinar&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;P.S. It doesn't really make sense to talk of &lt;em&gt;bytes of machine code&lt;/em&gt; for interpreted programming languages. While I realise the importance of compiled languages, there are still a few interpreted languages that are relatively popular, e.g. Python and JavaScript. And no, languages that are designed for brevity rather than comprehensibility do not always win. Indeed, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17363/43319&quot;&gt;my bounty for winning in a particular non-golf language&lt;/a&gt; has been claimed over 50 times!&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2020-07-07T10:50:27.057" LastActivityDate="2020-07-07T10:50:27.057" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19086" PostTypeId="2" ParentId="19084" CreationDate="2020-07-07T12:03:53.753" Score="11" Body="&lt;p&gt;People do code golf for fun and challenge. This is like asking why in the sport of golf do players hit the ball with a golf club when they could just carry it into the hole.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2020-07-07T12:03:53.753" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="19090" PostTypeId="2" ParentId="2140" CreationDate="2020-07-09T22:38:46.000" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/206957/solve-a-2xn-maze&quot;&gt;Solve a 2xN Maze (posted)&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="17360" LastEditorUserId="17360" LastEditDate="2020-07-10T23:07:51.770" LastActivityDate="2020-07-10T23:07:51.770" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19095" PostTypeId="2" ParentId="2140" CreationDate="2020-07-12T09:55:43.993" Score="4" Body="&lt;h1&gt;Does the naïve fill suffice?&lt;/h1&gt;&#xA;&lt;p&gt;A bot is positioned in a rectangular grid. By preference it will paint in a west direction, but if it cannot it will paint in a south, east or if all else fails north direction. Sometimes this can lead it to fill the grid, but other times it gets stuck. The following examples show how the path (indicated by ascending digits) of the bot on a given grid varies depending on its starting position:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The bot is always able to fill a &lt;code&gt;1×1&lt;/code&gt; grid, since simply by existing it has already painted the grid.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;14    21    43    34&#xA;23    34    12    21&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The bot is always able to fill a &lt;code&gt;2×2&lt;/code&gt; grid. As a consequence of its painting direction preferences it normally traverses anticlockwise except when it starts in the bottom right corner when it traverses clockwise.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;16    21    65    ..    56    65    165    216    321    654     345    456&#xA;25    36    14    21    43    34    234    345    456    123     216    321&#xA;34    45    23    34    12    21&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The bot usually fills a &lt;code&gt;2×3&lt;/code&gt; grid, except when it starts in the middle right square. On the other hand, it always fills a &lt;code&gt;3×2&lt;/code&gt; grid; its painting direction preferences cause it to paint clockwise if it starts in the bottom middle or bottom right cell, otherwise anticlockwise.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;189    21.    321    87.    987    ...    987    ...    987&#xA;276    387    498    165    216    321    236    345    456&#xA;345    456    567    234    345    456    145    216    321&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The bot is able to fill a &lt;code&gt;3×3&lt;/code&gt; grid when it starts in one of the even squares. It's mathematically impossible for the bot to fill it when it starts in an odd square, but I have included these positions for completeness.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to solve the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; of whether the bot is able to fill a given grid from a given starting point. You can assume that the grid size is a positive integer and that the starting point lies within the grid. You can take the grid size and starting point in any consistent order, as separate inputs, a pair of pairs or a list of 4 elements, or any other reasonable input format. The starting point can be 0-indexed or 1-indexed. You can use any two consistent outputs, or you can output using any values that your language considers truthy or falsy, but not both. Please include your input and output format in your answer.&lt;/p&gt;&#xA;&lt;p&gt;The directions west, south, east or north correspond to decrementing the x-coordinate, incrementing the y-coordinate, incrementing the x-coordinate and decrementing the y-coordinate respectively.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;&lt;p&gt;Test cases (0-indexed, width height x y):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;4 4 0 0 -&amp;gt; True&#xA;4 4 1 1 -&amp;gt; False&#xA;4 4 2 2 -&amp;gt; True&#xA;4 4 3 3 -&amp;gt; True&#xA;4 7 1 3 -&amp;gt; False&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2020-07-12T17:34:03.877" LastActivityDate="2020-07-12T17:34:03.877" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="19098" PostTypeId="1" CreationDate="2020-07-13T19:16:48.263" Score="-1" ViewCount="108" Body="&lt;p&gt;Welcome to the idea of the Code Golf Contest, where many code golfers pit their skills against eachother in a Battle For Dream Island-esque competition!&lt;/p&gt;&#xA;&lt;p&gt;The prize? 300 reputation!&lt;/p&gt;&#xA;&lt;p&gt;The challenges will start easy, but will get harder and harder as the contest progresses, and one contestant will get eliminated each round.&lt;/p&gt;&#xA;&lt;p&gt;How will they get eliminated? Glad you asked.&lt;/p&gt;&#xA;&lt;p&gt;Each byte of code taken for each challenge is one point added to each player's score. The player with the most points at the end of each round will be eliminated until there are only 2 contestants left. Then these 2 contestants will take on the most difficult challenge of all, the championship.&lt;/p&gt;&#xA;&lt;p&gt;The contestant with the fewest bytes used, regardless of previous challenges will be declared the winner and receive 300 reputation(the number doesn't have to be 300, it can be more or less).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;No cheating by looking at the answers of others.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No answering questions if you're not part of the competition or have been eliminated.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No hate comments on the answers of others.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;All languages are allowed, except for ones made specifically for the challenge at hand.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Do you like this idea of a contest? If so, pls comment on other ideas and/or rules for the contest idea!&lt;/p&gt;&#xA;" OwnerUserId="94866" LastEditorDisplayName="user92069" LastEditDate="2020-07-14T02:10:54.737" LastActivityDate="2020-07-15T14:30:22.750" Title="Code Golf Contest(Idea)" Tags="|discussion|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="19099" PostTypeId="1" AcceptedAnswerId="19101" CreationDate="2020-07-13T21:18:51.517" Score="2" ViewCount="67" Body="&lt;p&gt;I just posted a question available here: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/207070/print-out-a-valid-pokemon-team&quot;&gt;Print out a valid pokemon team!&lt;/a&gt; , which got closed due to lack of details.&lt;/p&gt;&#xA;&lt;p&gt;I do understand that at first, my question was somewhat unclear, as mentioned by Jonathan Allen, Zgarb, and nph, I forgot to mention if there could be a constant output. I addressed all of the questions in the comments.&lt;/p&gt;&#xA;&lt;p&gt;However, this post got locked down due to lack of details. None of the people who voted to lock it commented asking for clarifications about the question.&lt;/p&gt;&#xA;&lt;p&gt;I received three answers (one was my own), so I'm assuming that the question was at least somewhat understandable.&lt;/p&gt;&#xA;&lt;p&gt;Is there any way to get more feedback on what went wrong, or a way to get the question back up?&lt;/p&gt;&#xA;" OwnerDisplayName="user96185" LastActivityDate="2020-07-14T03:43:00.360" Title="Feedback for closed questions" Tags="|discussion|specific-question|closed-questions|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19100" PostTypeId="2" ParentId="19099" CreationDate="2020-07-13T22:07:05.440" Score="3" Body="&lt;p&gt;I cast a close vote on the challenge. I did so because I feel like the rules in the challenge were far too broad, and needed to be significantly clearer. For starters, you shouldn't rely on external sites to explain/address key points in your challenge. I, along with many other users, would recommend that you include, in the challenge, a complete list of valid Pokemon names, along with the moves they can learn. If you don't want to have to make such a list, you can always restrict the Pokemon available.&lt;/p&gt;&#xA;&lt;p&gt;For me, the specific things that made me cast my VTC were:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The lack of specification on &amp;quot;valid Pokemon team&amp;quot;, instead using the linked site. It'd be similar to asking users to output a valid sudoku board and linking to an external site in order to verify their output was correct.&lt;/li&gt;&#xA;&lt;li&gt;No explanation on the moves that are valid for specific Pokemon&lt;/li&gt;&#xA;&lt;li&gt;No example output (this is more of a subjective thing, but I find it never hurts to display a simple sample output)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;As for getting the question back up, if the challenge is edited to address and clarify the issues I and the other close voters saw with it, it will be nominated for reopening, where users can vote to reopen the challenge and allow more answers. There's nothing you can do to trigger this, aside from editing the challenge.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;As a couple of side notes:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For the future, I'd recommend you post challenges to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt; before the main site to get feedback. It usually helps avoid issues like this and gives people plenty of time to feedback any problems in the challenge itself.&lt;/li&gt;&#xA;&lt;li&gt;It is usually frowned upon to answer your own question here quickly after posting, especially when using a popular language, as you've had much longer to work on a solution than anyone else. I'd recommend waiting a minimum of three days before posting your own solutions.&lt;/li&gt;&#xA;&lt;li&gt;Once you reach 20 rep, I'd suggest asking users in our site chat room, &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; for feedback on why challenges were closed, rather than taking it to meta. It's not off-topic here by any stretch of the imagination, but you're much more likely to receive a response in chat&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2020-07-13T22:07:05.440" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19101" PostTypeId="2" ParentId="19099" CreationDate="2020-07-13T23:28:16.913" Score="4" Body="&lt;h2&gt;A deeper issue&lt;/h2&gt;&#xA;&lt;p&gt;As &lt;a href=&quot;http://caird%20coinheringaahing&quot; rel=&quot;nofollow noreferrer&quot;&gt;caird explained&lt;/a&gt;, the main issue is that the challenge is unclear because its rules are currently not fully self-contained, which means it's not yet in a state to re-open. (Your edits automatically put it in a reopen vote queue.) A black-box verifier on another site is not suitable -- we require that all information needed to confirm a solution as valid is written in the challenge text itself.&lt;/p&gt;&#xA;&lt;p&gt;I see, however, a deeper issue lurking. Even if the challenge is clear and on-topic, I want to know &amp;quot;Is it fun to golf?&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;(I'd usually bring up things like this in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt;, but I'm posting it here as feedback somewhat beyond the question-closing you asked about.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Narrow reference&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;My first impression reading the question is &amp;quot;Someone is into Pokemon!&amp;quot; But I don't know anything about Pokemon teams, and I imagine most readers also know little or nothing. And if the challenge were edited with a full explanation of precisely what a Pokemon team is and what the stats are and what the exact Teambuilder text format is, even if this were nicely and clearly written, it would feel like work for me to digest it without knowing why I'm doing so.&lt;/p&gt;&#xA;&lt;p&gt;The topic strikes me as a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9334/20260&quot;&gt;narrow reference&lt;/a&gt;, as if the challenge is aimed at players of Pokemon Showdown. Maybe that's fine for a niche interest among some community users, but it's far from ideal. We have lots of &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=pokemon&quot;&gt;questions mentioning Pokemon&lt;/a&gt; and much more obscure themes, and they try to be written as challenges that anyone can access and appreciate in golfing without prior knowledge.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Where's the beef?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Which brings me to question of, is this really a golfing challenge? It seems like solvers are meant to think a lot about Pokemon and moves within the rules, in order to find ones that are short and compressible or in a golfing language's built-in dictionary. This initially strikes me as a bit far from programming.&lt;/p&gt;&#xA;&lt;p&gt;Since I don't know what makes a valid team, I may be missing what makes this interesting, and I think it's up to the challenge to try to explain it. Like, maybe the idea is that the space of valid teams is large and complex to optimize over, so we're intended to write code to do a heuristic search. We've had a number of successful choose-your-output-challenges (and a number of unsuccessful ones), where the flexibility in output gives an extra layer of golfing strategy, and different answers pick different ones suited to their language and method.&lt;/p&gt;&#xA;&lt;p&gt;I see there are now answers posted who outputs being are really short, with &lt;a href=&quot;https://codegolf.stackexchange.com/a/207072/20260&quot;&gt;one text at 16 bytes&lt;/a&gt;. This leaves basically no room to golf now except for the ultra-golfiest languages. In something like Python, I can't do better than print this string verbatim. So, it seems that further improvement would come from thinking more about Pokemon and the Teambuilder format. This suggests it might be off-topic for a site about programming challenges.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2020-07-14T03:43:00.360" LastActivityDate="2020-07-14T03:43:00.360" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19106" PostTypeId="2" ParentId="18637" CreationDate="2020-07-14T14:46:00.113" Score="5" Body="&lt;p&gt;&lt;a href=&quot;https://esolangs.org/wiki/Main_Page&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/vk4zF.png&quot; alt=&quot;Esolang&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="96037" LastActivityDate="2020-07-14T14:46:00.113" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19108" PostTypeId="2" ParentId="18637" CreationDate="2020-07-14T14:55:16.017" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://github.com/Timwi/EsotericIDE/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/dfT0Q.png&quot; alt=&quot;Interpreter esoteric programming languages&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="96037" LastEditorUserId="96037" LastEditDate="2020-07-14T18:07:29.920" LastActivityDate="2020-07-14T18:07:29.920" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19109" PostTypeId="2" ParentId="19098" CreationDate="2020-07-15T00:31:48.747" Score="3" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;No cheating by looking at the answers of others.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is practically unenforceable, as pointed out by Jo King in the comments&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;No answering questions if you're not part of the competition or have been eliminated.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Why? What purpose does this rule serve, other than to arbitrarily exclude input? Back in February and March, there was a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/18545/46076&quot;&gt;meta-challenge superimposed on top of existing code golf challenges open to independent input&lt;/a&gt;, which seems to have worked.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;No hate comments on the answers of others.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is already covered by &lt;a href=&quot;/conduct&quot;&gt;general network-wide policies&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;All languages are allowed, except for ones made specifically for the challenge at hand.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is already covered by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1071/46076&quot;&gt;standard loopholes&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="46076" LastActivityDate="2020-07-15T00:31:48.747" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19110" PostTypeId="2" ParentId="2140" CreationDate="2020-07-15T00:34:31.867" Score="1" Body="&lt;h1&gt;Infinite Mirrors Quine&lt;/h1&gt;&#xA;&lt;p&gt;This challenge is to create a program that prints out code that prints the original. Basically, this program should take an input, check if it's A, and if so, run section A. Otherwise, if it's B, run section B. Finally, if it's neither, print nothing. Section A should print the code in section B, and section B should print the code in section A. Section A's code and section b's code should not be identical. Shortest code wins!&lt;/p&gt;&#xA;" OwnerUserId="89822" LastEditorUserId="89822" LastEditDate="2020-07-15T01:14:19.283" LastActivityDate="2020-07-15T01:14:19.283" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19117" PostTypeId="2" ParentId="2140" CreationDate="2020-07-16T01:07:20.987" Score="1" Body="&lt;h1&gt;Continuous Everywhere, Differentiable Nowhere&lt;/h1&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Build the Weierstrass function &lt;span class=&quot;math-container&quot;&gt;\$f(x) = \sum_{n=0}^\infty a^n \cos(b^n n x)\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$a \in (0,1)\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; is an odd positive integer, and &lt;span class=&quot;math-container&quot;&gt;\$ab &amp;gt; 1 + 1.5\pi\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;What's the fuss?&lt;/h2&gt;&#xA;&lt;p&gt;The Weierstrass function is an example of a function that is continuous everywhere, but differentiable nowhere.&lt;/p&gt;&#xA;&lt;h2&gt;Format&lt;/h2&gt;&#xA;&lt;p&gt;Using floating-point number is permitted. Though it will be preferred to use a datatype that is able to represent arbitrary real numbers.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; are up to your choice, as long as they satisfy the conditions.&lt;/p&gt;&#xA;&lt;p&gt;For every &lt;span class=&quot;math-container&quot;&gt;\$x \in \mathbb{R}\$&lt;/span&gt;, evaluation of &lt;span class=&quot;math-container&quot;&gt;\$f(x)\$&lt;/span&gt; must halt.&lt;/p&gt;&#xA;&lt;h2&gt;Note&lt;/h2&gt;&#xA;&lt;p&gt;The fact that the function above is defined as an infinite series might seem to contradict the rule, but it actually doesn't. The Weierstrass function is &lt;a href=&quot;https://en.wikipedia.org/wiki/Computable_function&quot; rel=&quot;nofollow noreferrer&quot;&gt;computable&lt;/a&gt;, implying that it is possible to halt for every input. In particular, if it were to be implemented over floating-point numbers, it suffices to stop summing when the summand becomes denormal.&lt;/p&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2020-07-16T01:48:35.323" LastActivityDate="2020-07-16T01:48:35.323" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19118" PostTypeId="2" ParentId="2140" CreationDate="2020-07-16T01:27:02.953" Score="1" Body="&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2020-07-16T16:43:39.777" LastActivityDate="2020-07-16T16:43:39.777" CommentCount="15" ContentLicense="CC BY-SA 4.0" />
  <row Id="19120" PostTypeId="2" ParentId="19034" CreationDate="2020-07-16T21:58:48.747" Score="9" Body="&lt;h1&gt;No it should not be valid&lt;/h1&gt;&#xA;&lt;p&gt;This site already has a number of rules that new users find surprising. Thus, any rules or exceptions we make should provide enough benefit to outweigh the resulting confusion and need to link to meta posts.&lt;/p&gt;&#xA;&lt;p&gt;The cost of allowing this comes in the form of surprise and consistency: generally nobody would expect that code which autocompletes to valid code would be considered acceptable, and we make no such allowances for other editors. I think the argument about this being surprising is relatively self-explanatory, in that nobody would guess that &lt;code&gt;print(input(&lt;/code&gt; would be a valid Python program. The problem with consistency would then cause us to question why if we allow the IDE behaviour of Excel do we not allow, for example, Python in &amp;quot;IDE X&amp;quot; as answers where the code is autocompleted. I think our current rule, that the code needs to exist in a file in exactly the way it is presented in the submission, is much clearer and will require less meta bloat than allowing an exception would be.&lt;/p&gt;&#xA;&lt;p&gt;The rule we have about anonymous functions is similar in several ways to this proposed rule, but I believe the key difference is what is discussed above. Both of these rules allow for slightly more freedom in golfing and restricted source challenges, but rarely allow for anything of particular interest. However, what counts as an anonymous function is easily extensible between languages, whereas this rule about a particular editor's behaviour isn't.&lt;/p&gt;&#xA;" OwnerUserId="31625" LastEditorUserId="31625" LastEditDate="2020-07-19T22:03:45.447" LastActivityDate="2020-07-19T22:03:45.447" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19123" PostTypeId="2" ParentId="2140" CreationDate="2020-07-18T11:55:31.027" Score="1" Body="&lt;h2&gt;Ant Storage Labyrinth &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;h3&gt;Description&lt;/h3&gt;&#xA;&lt;p&gt;Using a simplified model, the place where ants store their food can be thought of as an &lt;span class=&quot;math-container&quot;&gt;\$n\times n\$&lt;/span&gt; matrix. Each entry of the matrix is an integer that encodes how &lt;em&gt;full&lt;/em&gt; that specific spot is, according to the following correspondence:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;0&lt;/code&gt; denotes an empty spot (the ants can add two more units of food),&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1&lt;/code&gt; denotes a half-filled spot (the ants can add one more unit of food),&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;2&lt;/code&gt; denotes a filled spot (no more food can be stored in there).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Imagine an ant carrying &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; units of food, that enters the &amp;quot;storage room&amp;quot; at a specific position (row &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt;, column &lt;span class=&quot;math-container&quot;&gt;\$j\$&lt;/span&gt; of the matrix). The ant can move one unit left, right, up or down with each step, and it can drop &lt;span class=&quot;math-container&quot;&gt;\$2-q\$&lt;/span&gt; units of food at each spot it walks over (where &lt;span class=&quot;math-container&quot;&gt;\$q\$&lt;/span&gt; is the initial capacity of that spot – either &lt;code&gt;0&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt; or &lt;code&gt;2&lt;/code&gt; as described above). Your task is to find the length of the shortest path the ant can choose in order to store all &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; units of food.&lt;/p&gt;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&lt;p&gt;Let's say that the ant carries &lt;span class=&quot;math-container&quot;&gt;\$4\$&lt;/span&gt; units and enters the following storage room (&lt;span class=&quot;math-container&quot;&gt;\$6\times 6\$&lt;/span&gt; matrix) at position &lt;span class=&quot;math-container&quot;&gt;\$(3,3)\$&lt;/span&gt; (1-indexed):&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$\left[\begin{matrix}0&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2\\2&amp;amp;1&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;1\\1&amp;amp;2&amp;amp;\color{red}{1}&amp;amp;2&amp;amp;1&amp;amp;1\\2&amp;amp;1&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2\\2&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2\\1&amp;amp;2&amp;amp;2&amp;amp;1&amp;amp;2&amp;amp;2\\\end{matrix}\right]$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;It drops &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; unit right where it starts (&lt;span class=&quot;math-container&quot;&gt;\$3\$&lt;/span&gt; left), then it has four optimal choices:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;3 moves to the right, and 1 up,&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$\longrightarrow\left[\begin{matrix}0&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2\\2&amp;amp;1&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;1\\1&amp;amp;2&amp;amp;\color{green}{2}&amp;amp;\color{red}{2}&amp;amp;1&amp;amp;1\\2&amp;amp;1&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2\\2&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2\\1&amp;amp;2&amp;amp;2&amp;amp;1&amp;amp;2&amp;amp;2\\\end{matrix}\right]\longrightarrow\left[\begin{matrix}0&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2\\2&amp;amp;1&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;1\\1&amp;amp;2&amp;amp;\color{green}{2}&amp;amp;\color{green}{2}&amp;amp;\color{red}{1}&amp;amp;1\\2&amp;amp;1&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2\\2&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2\\1&amp;amp;2&amp;amp;2&amp;amp;1&amp;amp;2&amp;amp;2\\\end{matrix}\right]\longrightarrow\left[\begin{matrix}0&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2\\2&amp;amp;1&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;1\\1&amp;amp;2&amp;amp;\color{green}{2}&amp;amp;\color{green}{2}&amp;amp;\color{green}{2}&amp;amp;\color{red}{1}\\2&amp;amp;1&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2\\2&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2\\1&amp;amp;2&amp;amp;2&amp;amp;1&amp;amp;2&amp;amp;2\\\end{matrix}\right]\\\longrightarrow\left[\begin{matrix}0&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2\\2&amp;amp;1&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;\color{red}{1}\\1&amp;amp;2&amp;amp;\color{green}{2}&amp;amp;\color{green}{2}&amp;amp;\color{green}{2}&amp;amp;\color{green}{2}\\2&amp;amp;1&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2\\2&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2\\1&amp;amp;2&amp;amp;2&amp;amp;1&amp;amp;2&amp;amp;2\\\end{matrix}\right]\longrightarrow\left[\begin{matrix}0&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2\\2&amp;amp;1&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;\color{green}{2}\\1&amp;amp;2&amp;amp;\color{green}{2}&amp;amp;\color{green}{2}&amp;amp;\color{green}{2}&amp;amp;\color{green}{2}\\2&amp;amp;1&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2\\2&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2&amp;amp;2\\1&amp;amp;2&amp;amp;2&amp;amp;1&amp;amp;2&amp;amp;2\\\end{matrix}\right]$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;2 moves to the left, and 2 up,&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;1 move up, 2 left, and one up,&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;1 move up, 1 left, 1 up, 1 left.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;All of these require &lt;span class=&quot;math-container&quot;&gt;\$4\$&lt;/span&gt; steps, so the final answer is &lt;span class=&quot;math-container&quot;&gt;\$\boxed{4}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;In progress&lt;/em&gt;. I need help coming up with interesting test cases / maybe a verification program.&lt;/p&gt;&#xA;" OwnerUserId="59487" LastActivityDate="2020-07-18T11:55:31.027" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19124" PostTypeId="2" ParentId="2140" CreationDate="2020-07-18T14:31:28.787" Score="1" Body="&lt;h1&gt;Successive operator sequences &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;A successive operator sequence (made up terminology) is a sequence of the form &lt;span class=&quot;math-container&quot;&gt;\$a(n + 1) = a(n) \text{ op } n\$&lt;/span&gt; where &lt;code&gt;op&lt;/code&gt; cycles through a set of operators and &lt;span class=&quot;math-container&quot;&gt;\$a(n)\$&lt;/span&gt; represents the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th term of the sequence.&lt;/p&gt;&#xA;&lt;p&gt;For examples, if we set the operators to addition, multiplication and subtraction and &lt;span class=&quot;math-container&quot;&gt;\$a(1) = 1\$&lt;/span&gt;. then we will get the following sequence (which is also &lt;a href=&quot;https://oeis.org/A047908&quot; rel=&quot;nofollow noreferrer&quot;&gt;A047908&lt;/a&gt;):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a(1)                    = 1&#xA;a(2) = a(1) + 1 = 1 + 1 = 2&#xA;a(3) = a(2) * 2 = 2 * 2 = 4&#xA;a(4) = a(3) - 3 = 4 - 3 = 1&#xA;a(5) = a(4) + 4 = 1 + 4 = 5&#xA;a(6) = a(5) * 5 = 5 * 5 = 25&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Write a program/function to output the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th term of a successive operator sequence given its initial term and operators.&lt;/p&gt;&#xA;&lt;p&gt;Operators your program/function must support:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;multiplication&lt;/li&gt;&#xA;&lt;li&gt;addition&lt;/li&gt;&#xA;&lt;li&gt;subtraction&lt;/li&gt;&#xA;&lt;li&gt;integer division (rounded towards negative infinity)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Input Format&lt;/h2&gt;&#xA;&lt;p&gt;The operators are inputted as a string or array of character where each character represents an operator, you may choose your own mapping of character to operator.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;# first term, operators, n  -&amp;gt;  nth term&#xA;0,   [&amp;quot;+&amp;quot;, &amp;quot;-&amp;quot;, &amp;quot;*&amp;quot;, &amp;quot;/&amp;quot;], 6   -&amp;gt;  4&#xA;1,   [&amp;quot;+&amp;quot;, &amp;quot;*&amp;quot;, &amp;quot;-&amp;quot;],      1   -&amp;gt;  1&#xA;1,   [&amp;quot;+&amp;quot;, &amp;quot;*&amp;quot;, &amp;quot;-&amp;quot;],      3   -&amp;gt;  4&#xA;1,   [&amp;quot;+&amp;quot;, &amp;quot;*&amp;quot;, &amp;quot;-&amp;quot;],      10  -&amp;gt;  199&#xA;1,   [&amp;quot;*&amp;quot;, &amp;quot;+&amp;quot;, &amp;quot;-&amp;quot;],      7   -&amp;gt;  -1&#xA;50,  [&amp;quot;*&amp;quot;, &amp;quot;+&amp;quot;, &amp;quot;-&amp;quot;],      1   -&amp;gt;  50&#xA;50,  [&amp;quot;*&amp;quot;, &amp;quot;+&amp;quot;, &amp;quot;-&amp;quot;],      4   -&amp;gt;  49&#xA;-10, [&amp;quot;*&amp;quot;, &amp;quot;/&amp;quot;, &amp;quot;-&amp;quot;],      5   -&amp;gt;  -32&#xA;-10, [&amp;quot;*&amp;quot;, &amp;quot;/&amp;quot;, &amp;quot;-&amp;quot;],      3   -&amp;gt;  -5&#xA;1,   [&amp;quot;+&amp;quot;, &amp;quot;+&amp;quot;, &amp;quot;*&amp;quot;],      5   -&amp;gt;  16&#xA;2,   [&amp;quot;+&amp;quot;, &amp;quot;*&amp;quot;],           5   -&amp;gt;  36&#xA;0,   [&amp;quot;+&amp;quot;],                3   -&amp;gt;  3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;em&gt;Inspired by the sequence &lt;a href=&quot;https://oeis.org/A047908&quot; rel=&quot;nofollow noreferrer&quot;&gt;A047908&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="91267" LastEditorUserId="91267" LastEditDate="2020-07-25T05:26:56.810" LastActivityDate="2020-07-25T05:26:56.810" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19127" PostTypeId="2" ParentId="2140" CreationDate="2020-07-20T02:02:45.003" Score="0" Body="&lt;h1&gt;Crazy Blazin' DOM Injection&lt;/h1&gt;&#xA;&lt;p&gt;I was instructed to post this code golf challenge here for recommendations on how to modify the challenge.&lt;/p&gt;&#xA;&lt;p&gt;I'd like to tag it.&lt;/p&gt;&#xA;&lt;p&gt;fastest-code grid and browser , but I don't know how to do that here.&lt;/p&gt;&#xA;&lt;p&gt;Code golf challenge listed below.&lt;/p&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;This problem is a challenge that has to do with DOM manipulation at scale and overcoming some issues that may be inherent in dealing with the DOM.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This challenge is interesting because limitations push us to think through things differently and lean on the strengths of languages different than what we usually use.&lt;/li&gt;&#xA;&lt;li&gt;I created this challenge myself based on a real world problem I ran into myself (details can be provided if needed). If this challenge has any relation to a differently know problem, those similarities are coincidental.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This challenge will be scored based on fastest execution and fastest algorithm. A multiplier will be given for completing the challege at &lt;a href=&quot;https://dodzidenudzakuma.com/1000-cells.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;easy&lt;/a&gt;, &lt;a href=&quot;https://dodzidenudzakuma.com/10000-cells.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;medium&lt;/a&gt;, and &lt;a href=&quot;https://dodzidenudzakuma.com/100000-cells.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;hard&lt;/a&gt; difficulties.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;You must render one of the challenge levels in a web browser:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://dodzidenudzakuma.com/1000-cells.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;easy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://dodzidenudzakuma.com/10000-cells.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;medium&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://dodzidenudzakuma.com/100000-cells.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;hard&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Through any means available to you interacting through a web browser in code you need to complete the following:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Get each table displayed and add a class &lt;code&gt;table-n&lt;/code&gt; to each table where &lt;code&gt;n&lt;/code&gt; is a zero based index of order of the table on the screen. If a table is nested within a table the parent would be N and the child would be N+1 with the next table being N+2.&lt;/li&gt;&#xA;&lt;li&gt;Get each row displayed in each table and add a class of &lt;code&gt;table-n-row-r&lt;/code&gt; where &lt;code&gt;r&lt;/code&gt; is a zero based index of rows in the table represented by &lt;code&gt;table-n&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Get each cell displayed in each table and add a class of &lt;code&gt;table-n-row-r-cell-c&lt;/code&gt; where &lt;code&gt;c&lt;/code&gt; is a zero based index of cells in a row represented by &lt;code&gt;table-n-row-r&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;At the end of the challenge the web page should still be able to be interacted through in the browser, and a call to &lt;code&gt;document.getElementsByClassName('table-n-row-r-cell-c');&lt;/code&gt; should return one and only one cell from the DOM.&lt;/p&gt;&#xA;&lt;p&gt;Any method available to you as valid as long as:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Access to one of the difficulty levels has been done through a web browser&lt;/li&gt;&#xA;&lt;li&gt;The URL of the browser and the page displayed doesn't change&lt;/li&gt;&#xA;&lt;li&gt;A call to &lt;code&gt;document.getElementsByClassName('table-n-row-r-cell-c');&lt;/code&gt; returns only one element&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h1&gt;Output Examples&lt;/h1&gt;&#xA;&lt;p&gt;For this example we're using the &lt;a href=&quot;https://dodzidenudzakuma.com/1000-cells.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;easy&lt;/a&gt; level as input.&lt;/p&gt;&#xA;&lt;p&gt;The abbreviated output in the DOM should be.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;!DOCTYPE html&amp;gt;&#xA;&amp;lt;html lang=&amp;quot;en&amp;quot;&amp;gt;&#xA;&amp;lt;head&amp;gt;&#xA;    &amp;lt;meta charset=&amp;quot;UTF-8&amp;quot;&amp;gt;&#xA;    &amp;lt;meta name=&amp;quot;viewport&amp;quot; content=&amp;quot;width=device-width, initial-scale=1.0&amp;quot;&amp;gt;&#xA;    &amp;lt;meta http-equiv=&amp;quot;X-UA-Compatible&amp;quot; content=&amp;quot;ie=edge&amp;quot;&amp;gt;&#xA;    &amp;lt;title&amp;gt;Code Golf Challenge&amp;lt;/title&amp;gt;&#xA;&amp;lt;/head&amp;gt;&#xA;&amp;lt;body&amp;gt;&#xA;    &amp;lt;table class=&amp;quot;table-0&amp;quot;&amp;gt;&#xA;        &amp;lt;thead&amp;gt;&#xA;            &amp;lt;tr class=&amp;quot;table-0-row-0&amp;quot;&amp;gt;&#xA;                &amp;lt;th class=&amp;quot;table-0-row-0-cell-0&amp;quot;&amp;gt;1&amp;lt;/th&amp;gt;&#xA;                ...&#xA;            &amp;lt;/tr&amp;gt;&#xA;        &amp;lt;/thead&amp;gt;&#xA;        &amp;lt;tbody&amp;gt;&#xA;            &amp;lt;tr class=&amp;quot;table-0-row-1&amp;quot;&amp;gt;&#xA;                &amp;lt;td class=&amp;quot;table-0-row-1-cell-0&amp;quot;&amp;gt;11&amp;lt;/td&amp;gt;&#xA;                &amp;lt;td class=&amp;quot;table-0-row-1-cell-1&amp;quot;&amp;gt;12&amp;lt;/td&amp;gt;&#xA;                ...&#xA;            &amp;lt;/tr&amp;gt;&#xA;            ...&#xA;    &amp;lt;/table&amp;gt;&#xA;&amp;lt;/body&amp;gt;&#xA;&amp;lt;/html&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;There are only &lt;code&gt;&amp;lt;td&amp;gt;&lt;/code&gt; and &lt;code&gt;&amp;lt;th&amp;gt;&lt;/code&gt; elements used as cell elements for the challenge.&lt;/p&gt;&#xA;&lt;p&gt;As long as &lt;code&gt;document.getElementsByClassName('table-n-row-r-cell-c');&lt;/code&gt; returns an element with this class. We're good to go.&lt;/p&gt;&#xA;&lt;h1&gt;Qualifying Entries&lt;/h1&gt;&#xA;&lt;p&gt;All entries that qualify need to have an execution speed of under 40 seconds for any difficulty level.&lt;/p&gt;&#xA;&lt;p&gt;Timing starts when your algorithm starts, but after the page has loaded completely as all elements must be available (the browser spinner has stopped spinning).&lt;/p&gt;&#xA;&lt;p&gt;Calculate the runtime for your method by calling &lt;code&gt;performance.now()&lt;/code&gt; before and and after your injection method, and subtracting the first from the second as in the example below.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;let t0 = performance.now();&#xA;doSomething()   // &amp;lt;---- The function you're measuring time for &#xA;let t1 = performance.now();&#xA;let totalTime = t1 - t0;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The medium and hard difficulty levels will have their execution time multiplied by &lt;code&gt;0.50&lt;/code&gt; and &lt;code&gt;0.25&lt;/code&gt; respectively. None the less, an execution time of less than 40 seconds is needed to qualify. So if the execution time on the medium difficulty was 41 seconds before the multiplier, it does not qualify.&lt;/p&gt;&#xA;&lt;h1&gt;Winner&lt;/h1&gt;&#xA;&lt;p&gt;The winner will be determined by the shortest execution time for dynamic injection of these classes and where &lt;code&gt;document.getElementsByClassName('table-n-row-r-cell-c');&lt;/code&gt; can still be executed against the browser console and return an element where &lt;code&gt;n&lt;/code&gt;, &lt;code&gt;r&lt;/code&gt;, and &lt;code&gt;c&lt;/code&gt; are replaced with indexes.&lt;/p&gt;&#xA;" OwnerUserId="20345" LastEditorUserId="20345" LastEditDate="2020-07-20T02:10:49.463" LastActivityDate="2020-07-20T02:10:49.463" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="19128" PostTypeId="2" ParentId="2140" CreationDate="2020-07-20T03:58:23.113" Score="1" Body="&lt;h2&gt;The ASCII character countdown! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Your task is simple: Choose any printable ASCII character that's not chosen in the previous answers. And then, you need to print your chosen character in your program to standard output. (You can ONLY print your chosen character, without printing other garbage to STDOUT)&lt;/p&gt;&#xA;&lt;h2&gt;The catch&lt;/h2&gt;&#xA;&lt;p&gt;Let's say you picked &lt;code&gt;x&lt;/code&gt; as your chosen character, and your answer is the answer numbered &lt;code&gt;y&lt;/code&gt;. You have to insert &lt;code&gt;y&lt;/code&gt; &lt;code&gt;x&lt;/code&gt;'s into the previous source code, at any position you like. For the first answer, the previous answer is the empty program.&lt;/p&gt;&#xA;&lt;h2&gt;An example&lt;/h2&gt;&#xA;&lt;p&gt;Answers have to start with the number 1. So for example, I chose the character &lt;code&gt;#&lt;/code&gt;, and I posted a 1 byte answer in /// that prints the &lt;code&gt;#&lt;/code&gt; mark.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And then, the second answer (numbered 2) has to insert 2 of their picked &lt;code&gt;x&lt;/code&gt; character into the previous source code, such that the modified code will print their &lt;code&gt;x&lt;/code&gt; character. So assume this is written in Keg:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;x#x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And then, the third answer has to do the same, and so on, until 95 is reached.&lt;/p&gt;&#xA;&lt;h2&gt;The winning criterion &amp;amp; other rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first user whose answer stays without a succeeding answer for a month wins the challenge. If that's not satisfied, the first person who reaches the number 95 wins the challenge.&lt;/li&gt;&#xA;&lt;li&gt;You are not allowed to put any other character in your code other than printable ASCII characters.&lt;/li&gt;&#xA;&lt;li&gt;You need to wait for an hour before posting a chaining answer.&lt;/li&gt;&#xA;&lt;li&gt;You need to wait 2 answers before you post a new answer after your submission.&lt;/li&gt;&#xA;&lt;li&gt;Please make sure your answer is valid. If yours is not valid, chaining answers aren't allowed to be posted.&lt;/li&gt;&#xA;&lt;li&gt;The answers are allowed to be in different languages.&lt;/li&gt;&#xA;&lt;li&gt;Each submission doesn't have to be in a unique language.&lt;/li&gt;&#xA;&lt;li&gt;You could &lt;em&gt;only&lt;/em&gt; insert &lt;code&gt;y&lt;/code&gt; &lt;code&gt;x&lt;/code&gt;'s into the source code.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user92069" LastEditorUserId="66833" LastEditorDisplayName="user92069" LastEditDate="2020-09-25T00:55:09.317" LastActivityDate="2020-09-25T00:55:09.317" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="19130" PostTypeId="2" ParentId="2140" CreationDate="2020-07-22T02:47:06.557" Score="-1" Body="&lt;h1&gt;Natural Language Identification Using Only Regular Expressions&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sandbox&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sandbox&amp;#39;&quot; rel=&quot;tag&quot;&gt;sandbox&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/winning-criteria&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;winning-criteria&amp;#39;&quot; rel=&quot;tag&quot;&gt;winning-criteria&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/discussion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;const regex = /English(?=\w+ Hello World)|Spanish(?= Hola Mundo)/;&#xA;&#xA;console.log('EnglishSpanish Hello World'.match(regex)); // English&#xA;console.log('EnglishSpanish Hola Mundo'.match(regex)); // Spanish&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/oprogramador/most-common-words-by-language/tree/master/src/resources&quot; rel=&quot;nofollow noreferrer&quot;&gt;These&lt;/a&gt; wordlists are to be used, and words are to be rewritten entirely using the ASCII characters &lt;code&gt;A-Z&lt;/code&gt; and &lt;code&gt;a-z&lt;/code&gt;.  Languages which use characters that cannot be easily transcribed into ASCII without special knowledge or firsthand experience in that language, are excluded.&lt;/p&gt;&#xA;&lt;p&gt;For instance, the Albanian word &lt;code&gt;të&lt;/code&gt; is easily transcribed without special knowledge as &lt;code&gt;te&lt;/code&gt;, so Albanian is allowed.&lt;/p&gt;&#xA;&lt;p&gt;But the Arabic word &lt;code&gt;من&lt;/code&gt; cannot be, so Arabic is excluded.&lt;/p&gt;&#xA;&lt;p&gt;The regular expression must match the language exactly, so appending a list of all languages you are testing before each word is allowed.  But however you organize this list, it must be the same for every word you test.  See the example above for clarification.&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&lt;p&gt;Ideally, brevity of regex, accuracy of language identification, and number of languages taken into account by the regex should all be considered when determining the winner.  But I have not decided on that yet, and am very open to suggestions.&lt;/p&gt;&#xA;&lt;p&gt;In fact this is my first sandbox post and I hope someone can help me format this properly with good rules so that it makes for an interesting and fun challenge.  I got this idea from some other contest somewhere where the goal was to identify languages with at least 60% accuracy.  But I can't find it anymore.&lt;/p&gt;&#xA;" OwnerUserId="95389" LastEditorUserId="95389" LastEditDate="2020-07-22T02:57:12.197" LastActivityDate="2020-07-22T02:57:12.197" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="19131" PostTypeId="2" ParentId="2140" CreationDate="2020-07-22T19:54:20.017" Score="0" Body="&lt;h1&gt;How wide is this string?&lt;/h1&gt;&#xA;&lt;p&gt;Given a unicode string in any standard encoding of choice, determine how many columns wide it is.&lt;/p&gt;&#xA;&lt;p&gt;To keep this challenge relatively simple, use the following rules for character widths:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Tab characters align to the nearest multiple-of-8 column&lt;/li&gt;&#xA;&lt;li&gt;CJK characters are 2 columns wide.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For the purposes of this challenge, you may assume all characters in &lt;a href=&quot;https://en.wikipedia.org/wiki/Plane_(Unicode)#Supplementary_Multilingual_Plane&quot; rel=&quot;nofollow noreferrer&quot;&gt;Unicode Planes 2 and 3&lt;/a&gt; (U+20000-3FFFF), plus codepoints U+3400-9FFF are CJK characters.&lt;/li&gt;&#xA;&lt;li&gt;CJK characters outside these ranges may be treated as either 1 or 2 columns wide.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Combining diacritics (U+0300-036F), control characters (U+00-1F, U+7F-9F), and the zero-width space (U+200B) are all 0 columns wide.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All other officially zero-width characters may be treated as either 1 or 0 columns wide.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;You may assume that there are no newlines or carriage returns.&lt;/li&gt;&#xA;&lt;li&gt;You do not need to handle escape sequences.&lt;/li&gt;&#xA;&lt;li&gt;You may assume all other characters are 1 column wide.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For any character the standard says has a specific width, you may use that width instead.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Shortest code wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/unicode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;unicode&amp;#39;&quot; rel=&quot;tag&quot;&gt;unicode&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="45613" LastActivityDate="2020-07-22T19:54:20.017" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19133" PostTypeId="2" ParentId="2140" CreationDate="2020-07-23T07:19:42.010" Score="0" Body="&lt;h1&gt;Tumbling 2x2 in a Matrix&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Challenge:&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; A rectangular integer matrix that's at least 2x2 in size.&#xA;&lt;strong&gt;Output:&lt;/strong&gt; A 2D integer array, of the result after the top-left 2x2 block has tumbled down.&lt;/p&gt;&#xA;&lt;p&gt;For example: Let's say we have the following 3x5 matrix as input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[ 4, 7,12],&#xA; [11, 2, 5],&#xA; [ 7, 3,15],&#xA; [21,10, 1],&#xA; [12, 6, 6]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The 2x2 block is &lt;code&gt;[[4,7],[11,2]]&lt;/code&gt;, which will act as if it was tumbling down from a stairs (in a top-left to bottom-right direction). Here this process step-by-step:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[ 4, 7,  ],&#xA; [11, 2,  ],&#xA; [--,  ,  ],&#xA; [  ,  ,  ],&#xA; [  ,  ,  ]]&#xA;&#xA;[[  ,  , 4],&#xA; [  ,11, 7],&#xA; [--, 2,  ],&#xA; [  ,  ,  ],&#xA; [  ,  ,  ]]&#xA;&#xA;[[  ,  ,  ],&#xA; [  ,11, 4],&#xA; [--, 2, 7],&#xA; [  ,--,  ],&#xA; [  ,  ,  ]]&#xA;&#xA;[[  ,  ,  ],&#xA; [  ,  ,  ,11],&#xA; [--,  , 2, 4],&#xA; [  ,--, 7],&#xA; [  ,  ,  ]]&#xA;&#xA;[[  ,  ,  ],&#xA; [  ,  ,  ,  ],&#xA; [--,  , 2,11],&#xA; [  ,--, 7, 4],&#xA; [  ,  ,--]]&#xA;&#xA;[[  ,  ,  ],&#xA; [  ,  ,  ,  ],&#xA; [--,  ,  ,  , 2],&#xA; [  ,--,  , 7,11],&#xA; [  ,  ,--, 4]]&#xA;&#xA;[[  ,  ,  ],&#xA; [  ,  ,  ,  ],&#xA; [--,  ,  ,  ,  ],&#xA; [  ,--,  , 7, 2],&#xA; [  ,  ,--, 4,11]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Doing so, it will add it's values to the other cells in its path. So here is the same step-by-step process with the other numbers added in the cells:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[ 4, 7,12],&#xA; [11, 2, 5],&#xA; [ 7, 3,15],&#xA; [21,10, 1],&#xA; [12, 6, 6]]&#xA;&#xA;[[ 4, 7,16],&#xA; [11,13,12],&#xA; [ 7, 5,15],&#xA; [21,10, 1],&#xA; [12, 6, 6]]&#xA;&#xA;[[ 4, 7,16],&#xA; [11,13,16],  // Note that the 13 and 5 remain the same, because the cells of the tumbling&#xA; [ 7, 5,22],  // block haven't moved from the previous to this step&#xA; [21,10, 1],&#xA; [12, 6, 6]]&#xA;&#xA;[[ 4, 7,16],&#xA; [11,13,16,11],&#xA; [ 7, 5,24, 4],&#xA; [21,10, 8],&#xA; [12, 6, 6]]&#xA;&#xA;[[ 4, 7,16],&#xA; [11,13,16,11],&#xA; [ 7, 5,24,15],  // Note that the 24 and 8 remain the same, because the cells of the tumbling&#xA; [21,10, 8, 4],  // block haven't moved from the previous to this step&#xA; [12, 6, 6]]&#xA;&#xA;[[ 4, 7,16],&#xA; [11,13,16,11],&#xA; [ 7, 5,24,15, 2],&#xA; [21,10, 8,11,11],&#xA; [12, 6, 6, 4]]&#xA;&#xA;[[ 4, 7,16],&#xA; [11,13,16,11],&#xA; [ 7, 5,24,15, 2],&#xA; [21,10, 8,11,13],  // Note that the 11 and 4 remain the same, because the cells of the tumbling&#xA; [12, 6, 6, 4,11]]  // block haven't moved from the previous to this step&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Challenge rules:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I/O is flexible. You may take the input as integer-matrix, integer list with loose dimension-inputs, as a list of strings, etc. Output can modify the original input, return a new matrix, print space/newline delimiter to STDOUT, etc.&lt;/li&gt;&#xA;&lt;li&gt;You may optionally take the dimensions as additional input.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;General rules:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins.&lt;br /&gt;&#xA;Don't let code-golf languages discourage you from posting answers with non-codegolfing languages. Try to come up with an as short as possible answer for 'any' programming language.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet/2422#2422&quot;&gt;Standard rules apply&lt;/a&gt; for your answer with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods/&quot;&gt;default I/O rules&lt;/a&gt;, so you are allowed to use STDIN/STDOUT, functions/method with the proper parameters and return-type, full programs. Your call.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Default Loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;If possible, please add a link with a test for your code (i.e. &lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Also, adding an explanation for your answer is highly recommended.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test case:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA;[[ 4, 7,12],&#xA; [11, 2, 5],&#xA; [ 7, 3,15],&#xA; [21,10, 1],&#xA; [12, 6, 6]]&#xA;Output:&#xA;[[ 4, 7,16],&#xA; [11,13,16,11],&#xA; [ 7, 5,24,15, 2],&#xA; [21,10, 8,11,13],&#xA; [12, 6, 6, 4,11]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;TODO: More to come.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;&lt;em&gt;Sandbox questions:&lt;/em&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;I might change the tumbling process a bit later on, since I'm not too happy about the current one. I still want the tumbling 2x2 down the matrix, but I might make the way the other values changes a bit different. This is just an initial idea.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Any missing tags?&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Any missing rules?&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Any suggestions on how to change the output without changing the core part of the tumbling top-left 2x2 block?&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Any suggested test cases?&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="52210" LastActivityDate="2020-07-23T07:19:42.010" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19134" PostTypeId="2" ParentId="2140" CreationDate="2020-07-23T08:07:38.043" Score="0" Body="&lt;h1&gt;&lt;span class=&quot;math-container&quot;&gt;\$d\times n\$&lt;/span&gt; dimensional word matrices [WIP]&lt;/h1&gt;&#xA;&lt;p&gt;Given two positive integers &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$d\$&lt;/span&gt;, and a list of words &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt;, produce a &lt;span class=&quot;math-container&quot;&gt;\$d\$&lt;/span&gt;-dimensional matrix &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt; with each dimension having length &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, filled with letters, that contains the words from &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; placed such that they form a directly adjacent contiguous path through the dimensions.&lt;/p&gt;&#xA;&lt;p&gt;For example, given &lt;span class=&quot;math-container&quot;&gt;\$d = 1\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$n = 3\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$a = \$&lt;/span&gt;&lt;code&gt;['cat']&lt;/code&gt; output one of:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;cat&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;tac&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Given &lt;span class=&quot;math-container&quot;&gt;\$d = 2\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$n = 3\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$a = \$&lt;/span&gt;&lt;code&gt;['cat', 'hat', 'mat']&lt;/code&gt; output something similar to:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;cat&#xA;hat&#xA;mat&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Given &lt;span class=&quot;math-container&quot;&gt;\$d = 3\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$n = 3\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$a = \$&lt;/span&gt;&lt;code&gt;['low', 'complexity']&lt;/code&gt; output something similar to:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;coq&#xA;igw&#xA;typ&#xA;&#xA;kmc&#xA;xeo&#xA;buf&#xA;&#xA;kpr&#xA;dll&#xA;scm&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or, if it's easier to visualise in an array structure:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;  [&#xA;    ['c', 'o', 'q'],&#xA;    ['i', 'g', 'w'],&#xA;    ['t', 'y', 'p'],&#xA;  ],&#xA;  [&#xA;    ['k', 'm', 'c'],&#xA;    ['x', 'e', 'o'],&#xA;    ['b', 'u', 'f'],&#xA;  ],&#xA;  [&#xA;    ['k', 'p', 'r'],&#xA;    ['d', 'l', 'l'],&#xA;    ['s', 'c', 'm'],&#xA;  ],&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Which contains &lt;code&gt;low&lt;/code&gt; at nested indices &lt;span class=&quot;math-container&quot;&gt;\$m[2][1][2]\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$m[1][1][2]\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$m[0][1][2]\$&lt;/span&gt; and &lt;code&gt;complexity&lt;/code&gt; at &lt;span class=&quot;math-container&quot;&gt;\$m[0][0][0]\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$m[0][0][1]\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$m[1][0][1]\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$m[2][0][1]\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$m[2][1][1]\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$m[1][1][1]\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$m[1][1][0]\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$m[0][1][0]\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$m[0][2][0]\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$m[0][2][1]\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;I'd like to add some more complicated examples beyond three dimensions here.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;TODO&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Unused spaces should be filled with randomly selected letters.&lt;/li&gt;&#xA;&lt;li&gt;There will always be enough space in the dimensions provided to allow the words to be added without re-using letters.&lt;/li&gt;&#xA;&lt;li&gt;There is no requirement to ensure the words don't also appear elsewhere in the grid, so for example if the filler letters happen to spell one of the provided words, that is acceptable.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Questions for meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This seems fun to me, any thoughts?&lt;/li&gt;&#xA;&lt;li&gt;Is it too easy/hard?&lt;/li&gt;&#xA;&lt;li&gt;Any other tags that are relevant?&lt;/li&gt;&#xA;&lt;li&gt;As a follow up, I'd like to have a nested matrix provided and have programs solve it - but that might be better as a fastest-code challenge - is this a reasonable precursor?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="9365" LastEditorUserId="66833" LastEditDate="2020-09-25T00:54:22.190" LastActivityDate="2020-09-25T00:54:22.190" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19135" PostTypeId="1" AcceptedAnswerId="19136" CreationDate="2020-07-23T09:28:08.763" Score="7" ViewCount="107" Body="&lt;p&gt;I just have a simple question: Do you gain any reputation from the upvotes from the meta-site?&lt;/p&gt;&#xA;" OwnerUserId="96037" LastEditorUserId="66833" LastEditDate="2021-07-09T14:15:52.173" LastActivityDate="2021-07-09T14:36:33.567" Title="Do you gain reputation from upvotes from the meta site" Tags="|support|voting|meta|reputation|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19136" PostTypeId="2" ParentId="19135" CreationDate="2020-07-23T09:46:31.830" Score="5" Body="&lt;h1&gt;No.&lt;/h1&gt;&#xA;&lt;p&gt;I've upvoted your question for you to verify this.&lt;/p&gt;&#xA;&lt;p&gt;From the &lt;a href=&quot;https://codegolf.stackexchange.com/help/whats-meta&quot;&gt;What is &amp;quot;meta&amp;quot;? How does it work?&lt;/a&gt; page:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Votes on meta do not affect your reputation; your meta reputation is the same as your reputation on Code Golf Stack Exchange (synchronized hourly), though you earn separate badges. You must have 1 reputation to participate on meta.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2020-07-23T09:46:31.830" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19139" PostTypeId="2" ParentId="2140" CreationDate="2020-07-24T03:28:17.593" Score="3" Body="&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2020-07-25T14:23:43.453" LastActivityDate="2020-07-25T14:23:43.453" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="19140" PostTypeId="2" ParentId="2140" CreationDate="2020-07-24T06:17:10.817" Score="5" Body="&lt;h1&gt;My smart phone&lt;/h1&gt;&#xA;&lt;p&gt;Posted here:&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210262/my-smartphones-phonebook&quot;&gt;My smartphone&amp;#39;s phonebook&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="92572" LastEditorUserId="92572" LastEditDate="2020-08-28T11:31:51.350" LastActivityDate="2020-08-28T11:31:51.350" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="19142" PostTypeId="1" CreationDate="2020-07-24T20:04:17.630" Score="3" ViewCount="173" Body="&lt;p&gt;I'm sorry for posting here instead of on the meta but I'm not allowed to post on the meta. I need 5 reputation here to post in the sandbox. How am I supposed to get that if I am supposed to post in the sandbox before I post here?&lt;/p&gt;&#xA;" OwnerUserId="96393" OwnerDisplayName="user197974" LastEditorUserId="66833" LastEditDate="2020-09-09T10:14:02.550" LastActivityDate="2020-09-09T10:14:02.550" Title="How to get reputation to post on the meta?" Tags="|discussion|new-users|reputation|" AnswerCount="0" CommentCount="5" ClosedDate="2021-05-09T23:38:38.900" ContentLicense="CC BY-SA 4.0" />
  <row Id="19144" PostTypeId="2" ParentId="2140" CreationDate="2020-07-25T04:03:30.783" Score="1" Body="&lt;h1&gt;Error Once, Hello World Twice&lt;/h1&gt;&#xA;&lt;p&gt;Your task here is to write a Hello World program that, (no, this is not Do X Without Y!) contains two exact copies of the same string. to avoid trivial solutions like &lt;code&gt;print &amp;quot;Hello World!&amp;quot;#&lt;/code&gt; your program must error out with only one copy.&lt;/p&gt;&#xA;&lt;p&gt;This is code-golf, so shortest answer in bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Wording?&lt;/li&gt;&#xA;&lt;li&gt;Tags?&lt;/li&gt;&#xA;&lt;li&gt;Length?&lt;/li&gt;&#xA;&lt;li&gt;Interesting enough to be posted?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="87986" LastActivityDate="2020-07-25T04:03:30.783" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="19145" PostTypeId="2" ParentId="2140" CreationDate="2020-07-25T09:06:40.460" Score="0" Body="&lt;h1&gt;Trapping a Jogger&lt;/h1&gt;&#xA;&lt;p&gt;A person starts jogging to the right from his house on a busy street.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;t=0&#xA;0 1 2 3 4 5 6 7 8 9 A B C&#xA;⌂ - - - - G - - G - - - G&#xA;&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;He travels 1 hectometer every minute, so he is 11 hectometers away from his house after 11 minutes:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;t=11&#xA;0 1 2 3 4 5 6 7 8 9 A B C&#xA;⌂ - - - - R - - R - - - G&#xA;                      &amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Since this is a busy street, there are walking signals that occasionally turn red. In this example, the signals at &lt;code&gt;5&lt;/code&gt;, &lt;code&gt;8&lt;/code&gt;, and &lt;code&gt;12&lt;/code&gt; units from home alternate colors every &lt;code&gt;2&lt;/code&gt;, &lt;code&gt;10&lt;/code&gt;, and &lt;code&gt;4&lt;/code&gt; minutes (this would not be a fun road to drive on). The signals are red (signal stop ✋) for the same duration that they are green (signal go ).&lt;/p&gt;&#xA;&lt;p&gt;Our jogger doesn't want to wait long, so he instantly turns around when he reaches a stoplight that is red, even if it will turn green within the next minute.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;t=12&#xA;0 1 2 3 4 5 6 7 8 9 A B C&#xA;⌂ - - - - G - - R - - - R&#xA;                        &amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;t=12.001&#xA;0 1 2 3 4 5 6 7 8 9 A B C&#xA;⌂ - - - - G - - R - - - R&#xA;                        &amp;lt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;t=13&#xA;0 1 2 3 4 5 6 7 8 9 A B C&#xA;⌂ - - - - G - - R - - - R&#xA;                      &amp;lt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This can cause the jogger to reverse direction again, making for a potentially long outing.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;t=16&#xA;0 1 2 3 4 5 6 7 8 9 A B C&#xA;⌂ - - - - G - - R - - - G&#xA;                &amp;lt;      &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;t=16.001&#xA;0 1 2 3 4 5 6 7 8 9 A B C&#xA;⌂ - - - - G - - R - - - G&#xA;                &amp;gt;      &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;View the rest of the sequence using a &lt;a href=&quot;https://tio.run/##bVFNa8MwDL37V4jAsN24bZxtMEqy6@67BlNC7a4enWMSj22MXXber9wfyeSkHylMYGFL8nt6kv8Iu8Zd971vOiihuhV3QuaKBPtihkAuZCZuFCEBXxnxg9foU0mINluw3bo1mnkBga8IoLUmvLYOwnI5oFQIvbBOm3fmubrKx2@@tS6su1AHwzaHj0OMbWkoP0O6@aJ8EqW/P99AIcVDF8@NdawastHowyOtDn1YEbgCi32BdRBVmX1ngM7pqXzbtGO2rd2TYVJgVTWXKpUjoeJT4gSSWT7zyJwU90mly1KqaZ4TMtWScfK2s3sDOC8cFSBXBgV4KEo48IxiA6QlyBEoXvUZ8wwVQ6jFH7XUTv8z8GhxJXN9el7gLLJMHttkiek2tcf@cDerJIL0/R8&quot; rel=&quot;nofollow noreferrer&quot;&gt;visualizer&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Given the cycle intervals and positions of a list of streetlights, determine the time until the jogger returns to his house (at distance 0) or runs to the right of the rightmost streetlight.&lt;/p&gt;&#xA;&lt;p&gt;The streetlights at time &lt;code&gt;t=0&lt;/code&gt; will all have just turned green.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;code&gt;n&lt;/code&gt; cycle intervals shall all be integers at least &lt;code&gt;2&lt;/code&gt;. The &lt;code&gt;n&lt;/code&gt; positions of the streetlights may be taken as either (sorted) absolute distances from home or the distance from that streetlight to the previous. In the example, this would be either &lt;code&gt;[5,8,12]&lt;/code&gt; or &lt;code&gt;[5,3,4]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Example cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;positions&#xA;intervals&#xA;output&#xA;&#xA;5,8,12&#xA;2,10,4&#xA;38&#xA;&#xA;10&#xA;20&#xA;11&#xA;&#xA;10&#xA;6&#xA;20&#xA;&#xA;2,8&#xA;8,6&#xA;40&#xA;&#xA;2,8&#xA;7,6&#xA;16&#xA;&#xA;1,2,3,4,5,6&#xA;6,5,4,3,2,1&#xA;16&#xA;&lt;span class=&quot;math-container&quot;&gt;```&lt;/span&gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="68261" LastActivityDate="2020-07-25T09:06:40.460" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19146" PostTypeId="1" AcceptedAnswerId="19148" CreationDate="2020-07-25T16:37:22.353" Score="2" ViewCount="167" Body="&lt;p&gt;I saw that in many golfing programming languages with a SBCS other than UTF-8 there is a converter (encoding and decoding) that converts the code/file from the SBCS defined characters to UTF-8 and vice versa.&lt;/p&gt;&#xA;&lt;p&gt;What is the point of having the UTF-8 representation of the code bytes? My only guess is to be able to save the code in 1-byte characters with known charset for golfing score evaluating purposes. However,&#xA;if it for saving the program in UTF-8 encoding, isn't control characters like EOF can impact on reading back the file?&lt;/p&gt;&#xA;&lt;p&gt;Plus, golfing-wise, does all challenges consider SBCS as valid byte-based scoring? or there are challenges that consider only UTF-8 as a 1 byte?&lt;/p&gt;&#xA;&lt;p&gt;Thanks.&lt;/p&gt;&#xA;" OwnerUserId="95505" LastActivityDate="2020-07-26T14:34:15.083" Title="Why languages encode their SBCS into UTF-8 and vice versa?" Tags="|discussion|asking-questions|site-design|languages|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19148" PostTypeId="2" ParentId="19146" CreationDate="2020-07-25T21:20:56.260" Score="7" Body="&lt;p&gt;The UTF-8 representation allows the code to be human-readable (to the extent that this is possible for a dedicated golfing language) while being able to be scored by &amp;quot;number of characters&amp;quot;. Since our default is to count bytes, golfing languages have an incentive to use all 256 bytes. Having a printable representation for each of them is just convenient. Note that the interpreter still has to correctly run the corresponding byte-encoded program, and that program is what we're actually scoring.&lt;/p&gt;&#xA;&lt;p&gt;More technically, here's how a typical golfing language uses its SBCS, and how TIO and this site accommodate it:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The interpreter has one internal representation for each of the 256 bytes.&lt;/li&gt;&#xA;&lt;li&gt;The interpreter has (at least) two modes: it can take the program as a bytestring and parse each byte as its internal representation, or it can parse a UTF-8 string of characters on its SBCS and parse each character like the internal representation of the corresponding byte. Apart from this part of the parsing process, the modes should be functionally identical.&lt;/li&gt;&#xA;&lt;li&gt;TIO displays and (as far as I know) runs the program as a UTF-8 string in UTF-8 mode, but displays its score as if it used the equivalent bytestring program in bytestring mode. We do the same. It's generally understood that the UTF-8 program represents the bytestring program. This is a compromise between correctness (the UTF-8 string itself is not what's scored) and convenience (no-one wants to read already cryptic programs as hexdumps).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="32014" LastEditDate="2020-07-26T14:34:15.083" LastActivityDate="2020-07-26T14:34:15.083" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19150" PostTypeId="5" CreationDate="2020-07-26T12:13:38.240" Score="0" Body="&lt;p&gt;A feature request or bug report with this tag is neither declined nor destined for implementation/fix. When such a decision has been made, the tag will be changed accordingly.&lt;/p&gt;&#xA;&lt;p&gt;There are multiple factors that may leave a report under review. There could be consideration of whether the proposed feature or bugfix is feasible or useful. There could be investigations on the complexity of the necessary solution. There could be insufficient information in the feature or bug report as presented. Site developers may provide additional comments to request more information or to provide status updates as appropriate to the status of the review, until such time as the decision for approval or decline is made.&lt;/p&gt;&#xA;&lt;p&gt;Status tags can only be applied by staff and ♦ moderators; the latter will only use this tag as part of the escalation process described here: &lt;a href=&quot;https://meta.stackexchange.com/q/348642/295232&quot;&gt;What posts should be escalated to staff using [status-review], and how do I escalate them?&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;Copied from: &lt;a href=&quot;https://meta.stackexchange.com/tags/status-review/info&quot;&gt;https://meta.stackexchange.com/tags/status-review/info&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="38979" LastEditorUserId="38979" LastEditDate="2020-07-26T21:09:11.657" LastActivityDate="2020-07-26T21:09:11.657" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19151" PostTypeId="4" CreationDate="2020-07-26T12:13:38.240" Score="0" Body="Indicates that a change in functionality is currently under consideration, or needs further investigation." OwnerUserId="38979" LastEditorUserId="38979" LastEditDate="2020-07-26T21:09:18.293" LastActivityDate="2020-07-26T21:09:18.293" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19153" PostTypeId="2" ParentId="2140" CreationDate="2020-07-26T12:56:36.047" Score="3" Body="&lt;h1&gt;The Turing Text Tape&lt;/h1&gt;&#xA;&lt;p&gt;Posted here: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/211946/ttt-turing-text-tape&quot;&gt;TTT: Turing Text Tape&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="92572" LastEditorUserId="92572" LastEditDate="2020-10-02T12:21:30.543" LastActivityDate="2020-10-02T12:21:30.543" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19154" PostTypeId="2" ParentId="2140" CreationDate="2020-07-26T21:28:37.493" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210425/implement-the-polygamma-function&quot;&gt;Implement the Polygamma function&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2020-09-01T13:43:21.043" LastActivityDate="2020-09-01T13:43:21.043" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19156" PostTypeId="1" CreationDate="2020-07-27T20:35:48.293" Score="10" ViewCount="215" Body="&lt;p&gt;Some of the site's questions rule that something must (or must not) be printed to the output. My question is, in the case of SQL, what really is the output?&lt;/p&gt;&#xA;&lt;p&gt;The &lt;code&gt;select&lt;/code&gt; command returns result-sets, which can be a 1x1 array of &amp;quot;string&amp;quot;.&#xA;The &lt;code&gt;print&lt;/code&gt; command, as defined in a specific implementation (sql server), returns a string to the user.&lt;/p&gt;&#xA;&lt;p&gt;So &lt;code&gt;select 'Hello world!'&lt;/code&gt; and &lt;code&gt;print 'Hello world!'&lt;/code&gt; are both valid commands that return the same string to the user, albeit in different places.&lt;/p&gt;&#xA;&lt;p&gt;So, which of these are considered &amp;quot;printing&amp;quot; in terms of golf SE? Could it be both?&lt;/p&gt;&#xA;" OwnerUserId="89285" LastActivityDate="2020-09-22T16:59:38.953" Title="What counts as &quot;output&quot; in SQL?" Tags="|discussion|" AnswerCount="1" CommentCount="8" ClosedDate="2020-09-26T00:02:00.770" ContentLicense="CC BY-SA 4.0" />
  <row Id="19161" PostTypeId="2" ParentId="2140" CreationDate="2020-07-28T10:08:38.333" Score="1" Body="&lt;h1&gt;CoGo Rally&lt;/h1&gt;&#xA;&lt;p&gt;There's a game called &lt;a href=&quot;https://boardgamegeek.com/boardgame/18/roborally&quot; rel=&quot;nofollow noreferrer&quot;&gt;Robo Rally&lt;/a&gt;, in which players &amp;quot;program&amp;quot; their robots five moves ahead, then simultaneously perform the moves, one at a time. The robots move over a &amp;quot;factory floor&amp;quot; grid, with the aim being to reach certain points on the board, in sequence, before the other robots do the same.&lt;/p&gt;&#xA;&lt;h1&gt;Game Rules&lt;/h1&gt;&#xA;&lt;p&gt;For the purposes of this challenge, the rules will be simplified as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each robot starts with 6 lives&lt;/li&gt;&#xA;&lt;li&gt;Each robot has a different, randomly assigned starting position (out of a fixed set of starting positions)&lt;/li&gt;&#xA;&lt;li&gt;The aim of the game is to reach all three checkpoints in the assigned order, before any other robot does the same.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Movement Options&lt;/h2&gt;&#xA;&lt;p&gt;Each turn, your robot can make any one of the following movements:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Rotate Clockwise 90 degrees&lt;/li&gt;&#xA;&lt;li&gt;Rotate Counter-clockwise 90 degrees&lt;/li&gt;&#xA;&lt;li&gt;Rotate 180 degrees&lt;/li&gt;&#xA;&lt;li&gt;Move Forward One&lt;/li&gt;&#xA;&lt;li&gt;Move Forward Two&lt;/li&gt;&#xA;&lt;li&gt;Move Forward Three [can only be used once until the next checkpoint is met]&lt;/li&gt;&#xA;&lt;li&gt;Reverse One (and stay facing the same way)&lt;/li&gt;&#xA;&lt;li&gt;Stay Still and gain 1 life, up to the maximum of 6&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Your moves are pre-programmed in blocks of five, so choose carefully! The board may well be in a very different state in five moves time to what you think it will be.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, each movement is assigned a priority from 1-100. When you choose your block of five movements (you may use each movement any number of times, except the &amp;quot;move forward three&amp;quot;, to form your five total movements) and the order they will occur in, you are also given five random numbers 1-100 to assign - one to each movement. Higher numbers will take priority where movements would cause two robots to enter the same space, for example.&lt;/p&gt;&#xA;&lt;h2&gt;Board Items&lt;/h2&gt;&#xA;&lt;p&gt;The board contains the following items:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Floor - the default tile on the board. No special effect.&lt;/li&gt;&#xA;&lt;li&gt;Walls - block a robot's path. If a robot moves forward or backward into a wall, it wastes that move (i.e. stays still, but doesn't gain a life). If the robot used &amp;quot;Move Forward Two&amp;quot;, for example, it may be possible that the Robot can only move Forward One, and then stops infront of a wall, wasting the second part of the movement.&lt;/li&gt;&#xA;&lt;li&gt;Laser gun - fire in a straight line in a specific direction until they hit a wall or a robot. If a robot is ontop of a laser gun, it will be hit but the laser won't fire further. While moving forward two or three, a robot may pass over the path of a laser gun without being affected by it.&lt;/li&gt;&#xA;&lt;li&gt;Conveyor Belts - at the end of a turn (single movement option), a conveyor belt will move the robot one space in the direction the conveyor is pointing. Doesn't block lasers. Conveyor belts NEVER ROTATE ROBOTS, even if they move the robot in a different direction to the one it is facing. While moving forward two or three, a robot may move over a conveyor belt without being affected by it.&lt;/li&gt;&#xA;&lt;li&gt;Checkpoints (1,2,3) - act as a save point on the Robot's path and also heals all of a robot's lives and resets their use of the &amp;quot;Move Forward Three&amp;quot; action, the first time the checkpoint is visited. Checkpoints must be visited sequentially to be activated. Acts as a piece of floor in all other respects. Robots must END THEIR TURN ON THE CHECKPOINT, after interaction with other Robots; and not just pass over it.&lt;/li&gt;&#xA;&lt;li&gt;Holes - move the robot back to the previously visited checkpoint, or start position. Robot loses half its remaining life, rounded down. Holes act immediately, as soon as the robot enters the space - it doesn't wait for the &amp;quot;board interactions&amp;quot; part of the turn order.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Interactions&lt;/h2&gt;&#xA;&lt;p&gt;Objects interact as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a Robot moves into a space where another robot already exists, the other robot is shoved (moved) in the direction that the first robot was moving, one space; unless there is a wall or laser in the way. This effect may stack if multiple robots are in a line (i.e. all robots are shoved one space). This may cause a robot to fall into a hole or onto a conveyor belt.&lt;/li&gt;&#xA;&lt;li&gt;Moving off the edge of the board has the same effect as moving into a hole&lt;/li&gt;&#xA;&lt;li&gt;If a Laser fires and hits a robot, the robot stops the laser beam, and takes one damage.&lt;/li&gt;&#xA;&lt;li&gt;If a robot is facing another robot in a straight line with nothing blocking in between (i.e. no walls or other robots), the target robot takes 1 damage&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Therefore If two robots are facing towards each other with nothing blocking in between (i.e. no walls or other robots), both robots take one damage.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Turn Order&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;determine (program) 5 movement options&lt;/li&gt;&#xA;&lt;li&gt;determine Priorities (1-100) for these five turns&lt;/li&gt;&#xA;&lt;li&gt;The programmed actions occur:&lt;br /&gt;&#xA;a. The first movement occurs for each player, in priority order from highest to lowest. Holes are acted on immediately (a robot cannot pass over a hole).&lt;br /&gt;&#xA;b. Robot Interactions are resolved (e.g. if one robot shoves another one)&lt;br /&gt;&#xA;c. Board Items act (lasers, conveyor belts, checkpoints)&lt;br /&gt;&#xA;i. If a robot loses all of its lives, it returns to the previous checkpoint (or start) with half lives (rounded up) and must sit out the remainder of the round&#xA;d. Robots fire&lt;br /&gt;&#xA;i. If a robot loses all of its lives, it returns to the previous checkpoint (or start) with half lives (rounded up) and must sit out the remainder of the round&#xA;e. Repeat for the remaining 4 movements&lt;/li&gt;&#xA;&lt;li&gt;Repeat until one robot has reached all three checkpoints sequentially, or all robots have lost their lives&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Your robot must take the board (as a 2D array), and a seed for the Random number generator; and play the game on the given board.&lt;/p&gt;&#xA;&lt;p&gt;The board is guaranteed to be solveable (there will always be a path from the start to each of the checkpoints)&lt;/p&gt;&#xA;&lt;h1&gt;Sample Board&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/xAl4c.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/xAl4c.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/5G8ms.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/5G8ms.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The above board would be represented in an array as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[0,0,0,0,0,0,0,0,0,0,0,0]&#xA;[0,0,0,0,0,0,0,0,0,0,0,0]&#xA;[0,0,0,0,0,0,LU,0,0,0,0,0]&#xA;[0,0,0,0,0,LL,2,LR,0,0,W,0]&#xA;[H,CL,CL,CL,CL,CL,CL,CL,CL,CL,0,0]&#xA;[0,0,0,0,0,CR,CR,CR,CR,CR,CR,H]&#xA;[0,W,0,0,0,0,0 ,0,0,0,0,0]&#xA;[0,W,0,0,0,0,W,0,W,0,0,0]&#xA;[1,W,0,0,0,0,CR,CR,CD,0,W,3]&#xA;[0,W,CR,CR,CR,0,CU,H,CD,W,0,0]&#xA;[0,LL,CR,CR,CR,CR,CU,CU,CL,0,0,0]&#xA;[0,0,S,S,S,S,0,0,W,0,0,0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Where&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Cx = Conveyor (x=Up, Down, Left, Right)&#xA;Lx = Laser gun (x=Up, Down, Left, Right)&#xA;S = Start&#xA;1,2,3 = Checkpoints&#xA;W = Wall&#xA;H = Hole&#xA;0 = Floor&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Sandbox Questions&lt;/h1&gt;&#xA;&lt;p&gt;Should this be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, where you implement your robot in the least code possible; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, or something else? If KotH, I've never set one before so some advice would be appreciated!&lt;/p&gt;&#xA;" OwnerUserId="62289" LastEditorUserId="62289" LastEditDate="2020-07-28T10:41:33.913" LastActivityDate="2020-07-28T10:41:33.913" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19164" PostTypeId="2" ParentId="2140" CreationDate="2020-07-29T09:45:20.967" Score="0" Body="&lt;h1&gt;International &amp;quot;Hello, World!&amp;quot; (WIP) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;(Please note the special scoring for this challenge)&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/55422/75323&quot;&gt;This&lt;/a&gt; code-golf question has over 900 answers and all of them print &amp;quot;Hello, world!&amp;quot; in English! If we can use hundreds of different programming languages to print that message, why can't we use hundreds of different natural languages to express that message?&lt;/p&gt;&#xA;&lt;h1&gt;Task &amp;amp; scoring&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to beat the answers of the &lt;a href=&quot;https://codegolf.stackexchange.com/q/55422/75323&quot;&gt;Hello, world!&lt;/a&gt; challenge (&amp;quot;HW&amp;quot; challenge from now on) in different natural languages, as determined by the length ratio of the English string &amp;quot;Hello, world!&amp;quot; and the string in the natural language you pick. For example, I could pick Portuguese, hence I will have to print &amp;quot;Olá, mundo!&amp;quot; which has a length ratio of 11/13.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;if your natural language has capitalization, you must respect the original capitalization.&lt;/li&gt;&#xA;&lt;li&gt;if your natural language has punctuation, you must respect the original punctuation.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Then you pick the programming language you are going to write your code in. For example, I could pick Python. And you write your program. My program could be &lt;code&gt;print(&amp;quot;Olá, mundo!&amp;quot;)&lt;/code&gt;, with a standard code-golf score of 20.&lt;/p&gt;&#xA;&lt;p&gt;You then look for the best submission in the &lt;a href=&quot;https://codegolf.stackexchange.com/q/55422/75323&quot;&gt;HW&lt;/a&gt; challenge with the same programming language you chose, let's say it has score S. (We probably need a leaderboard for challenge &lt;a href=&quot;https://codegolf.stackexchange.com/q/55422/75323&quot;&gt;HW&lt;/a&gt; to make this step easier.) My score would then be (20/S)/(11/13).&lt;/p&gt;&#xA;&lt;p&gt;Does this make any sense? Any preliminary feedback?&lt;/p&gt;&#xA;" OwnerUserId="75323" LastActivityDate="2020-07-29T09:45:20.967" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19166" PostTypeId="2" ParentId="2140" CreationDate="2020-07-29T14:49:07.437" Score="0" Body="&lt;h1&gt;Extract an integer from another&lt;/h1&gt;&#xA;&lt;p&gt;This is a somewhat interesting problem I ran into while nanboxing: given two integers, compute their bitwise-AND and concatenate the resulting &amp;quot;substrings&amp;quot; into a new integer.&lt;/p&gt;&#xA;&lt;p&gt;More precisely: you are provided two integers as input — an input integer and a bitmask. As output, you should produce the bitwise-AND of the two such that, given a mask with &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; set bits, the corresponding bits from the input are grouped together in the first &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; bits of the resulting integer.&lt;/p&gt;&#xA;&lt;p&gt;The following pseudocode is one way to implement the function:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-lua prettyprint-override&quot;&gt;&lt;code&gt;-- x and mask are lists of booleans&#xA;function (x, mask)&#xA;  local result=list();&#xA;  for i=1, min(x.length, mask.length) do&#xA;    if mask[i] then&#xA;      result.append(x[i]);&#xA;    end&#xA;  end&#xA;  return result;&#xA;end&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Example inputs and outputs&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;// In binary:&#xA;// f(x, mask) == result&#xA;f(1011, 1111) == 1011 // Select entire number&#xA;f(1010, 1010) == 11   // Select bits 1 and 3, and concatenate them&#xA;f(11001100, 01100110) == 1010 // Concatenate substrings [1:2] and [5:6]&#xA;f(11111111, 10101010) == 1111 // Concatenate bits at odd indices.&#xA;&#xA;// 16-bit variants in hexadecimal:&#xA;f(BEEF, 1111) == 9&#xA;f(DEAD, 8888) == F &#xA;f(1337, FF00) == 13&#xA;f(CODE, 7777) == 82E&#xA;&#xA;// Two 64-bit variants (in hex):&#xA;f(400921FB54442D18, CODE601F15DABE57) == 111DE42C8&#xA;f(FFFE0000004010CC, 8003000000000000) == 6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Specific rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard loopholes, default IO, etc. apply where not overridden.&lt;/li&gt;&#xA;&lt;li&gt;Input and output values must fulfill &lt;span class=&quot;math-container&quot;&gt;\$x \in \{b_{set}, b_{unset}\}^{n}\$&lt;/span&gt; for some &lt;span class=&quot;math-container&quot;&gt;\$b_{set} \neq b_{unset}, n \in \mathbb{N}_{\geq 16}\$&lt;/span&gt; of your choice. In other words:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must support integers of at least 16 bits in your representation, but you may otherwise arbitrarily constrain their size - i.e. to 32-bit integers. You may also accept integers of any length through lists, arrays, strings, etc.&lt;/li&gt;&#xA;&lt;li&gt;The &amp;quot;set&amp;quot; and &amp;quot;unset&amp;quot; values do not need to be of the same type or length, but they must be constant and distinct.&lt;/li&gt;&#xA;&lt;li&gt;Most &amp;quot;linear&amp;quot; representations for integers are valid: integers, vectors, arrays, strings, etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins.&lt;/li&gt;&#xA;&lt;li&gt;Have fun!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="94628" LastActivityDate="2020-07-29T14:49:07.437" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19167" PostTypeId="2" ParentId="2140" CreationDate="2020-07-30T02:43:16.587" Score="1" Body="&lt;h1&gt;Posted: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/208982/antisymmetry-of-a-matrix&quot;&gt;Antisymmetry of a Matrix&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="94333" LastEditorUserId="94333" LastEditDate="2020-08-03T00:37:35.800" LastActivityDate="2020-08-03T00:37:35.800" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19169" PostTypeId="2" ParentId="2140" CreationDate="2020-07-30T19:08:34.577" Score="1" Body="&lt;h1&gt;Paper folding. Posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/208919/paper-folding-for-the-win&quot;&gt;HERE&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="95505" LastEditorUserId="95505" LastEditDate="2020-07-31T23:29:08.527" LastActivityDate="2020-07-31T23:29:08.527" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19172" PostTypeId="2" ParentId="2140" CreationDate="2020-07-31T16:19:12.020" Score="2" Body="&lt;h1&gt;Migrate Try it online! to CommonMark&lt;/h1&gt;&#xA;&lt;p&gt;Try it online! generates old-style MarkDown code blocks which indent all lines with 4 spaces and then optionally precedes the block with a language comment.&lt;/p&gt;&#xA;&lt;p&gt;Furthermore if the code block can't be parsed by old-style MarkDown (e.g. it has a leading newline, common in Retina answers), then it instead uses a &lt;code&gt;&amp;lt;pre&amp;gt;&amp;lt;code&amp;gt;&lt;/code&gt; block, with HTML escapes for all nonprinting characters.&lt;/p&gt;&#xA;&lt;p&gt;Your program or function must take a whole TIO post, and change its code block into CommonMark style.&lt;/p&gt;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;# [Python 2], 16 bytes&#xA;&#xA;&amp;lt;!-- language-all: lang-python --&amp;gt;&#xA;&#xA;    print &amp;quot;Python 2&amp;quot;&#xA;&#xA;[Try it online!][TIO-kdaf9y51]&#xA;&#xA;[Python 2]: https://docs.python.org/2/&#xA;[TIO-kdaf9y51]: https://tio.run/##K6gsycjPM/r/v6AoM69EQSkAzFcwUvr/HwA &amp;quot;Python 2 – Try It Online&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;becomes&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;# [Python 2], 16 bytes&#xA;&#xA;``` python&#xA;print &amp;quot;Python 2&amp;quot;&#xA;```&#xA;&#xA;[Try it online!][TIO-kdaf9y51]&#xA;&#xA;[Python 2]: https://docs.python.org/2/&#xA;[TIO-kdaf9y51]: https://tio.run/##K6gsycjPM/r/v6AoM69EQSkAzFcwUvr/HwA &amp;quot;Python 2 – Try It Online&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;which displays as&lt;/p&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://docs.python.org/2/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Python 2&lt;/a&gt;, 16 bytes&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;print &amp;quot;Python 2&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##K6gsycjPM/r/v6AoM69EQSkAzFcwUvr/HwA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 2 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;while&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;# [Retina 0.8.2], 13 bytes&#xA;&#xA;&amp;lt;pre&amp;gt;&amp;lt;code&amp;gt;&#xA;Retina 0.8.2&#xA;&amp;lt;/code&amp;gt;&amp;lt;/pre&amp;gt;&#xA;&#xA;[Try it online!][TIO-kdafdbm1]&#xA;&#xA;[Retina 0.8.2]: https://github.com/m-ender/retina/wiki/The-Language/a950ad7d925ec9316e3e2fb2cf5d49fd15d23e3d&#xA;[TIO-kdafdbm1]: https://tio.run/##K0otycxL/P@fKwjMUDDQs9Az@v8fAA &amp;quot;Retina 0.8.2 – Try It Online&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;becomes&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;# [Retina 0.8.2], 13 bytes&#xA;&#xA;```&#xA;&#xA;Retina 0.8.2&#xA;```&#xA;&#xA;[Try it online!][TIO-kdafdbm1]&#xA;&#xA;[Retina 0.8.2]: https://github.com/m-ender/retina/wiki/The-Language/a950ad7d925ec9316e3e2fb2cf5d49fd15d23e3d&#xA;[TIO-kdafdbm1]: https://tio.run/##K0otycxL/P@fKwjMUDDQs9Az@v8fAA &amp;quot;Retina 0.8.2 – Try It Online&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;which displays as&lt;/p&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://github.com/m-ender/retina/wiki/The-Language/a950ad7d925ec9316e3e2fb2cf5d49fd15d23e3d&quot; rel=&quot;nofollow noreferrer&quot;&gt;Retina 0.8.2&lt;/a&gt;, 13 bytes&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;&#xA;Retina 0.8.2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##K0otycxL/P@fKwjMUDDQs9Az@v8fAA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Retina 0.8.2 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2020-07-31T16:19:12.020" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19173" PostTypeId="2" ParentId="2140" CreationDate="2020-08-01T02:32:39.300" Score="1" Body="&lt;h1&gt;The Dungeon Number Sequence &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base-conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; rel=&quot;tag&quot;&gt;base-conversion&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h3&gt;Introduction&lt;/h3&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://www.youtube.com/watch?v=xNx3JxRhnZE&quot; rel=&quot;nofollow noreferrer&quot;&gt;dungeon numbers&lt;/a&gt; are introduced by Numberphile, denoting a chain of base conversions. A dungeon number is denoted in the form &lt;span class=&quot;math-container&quot;&gt;$$a_{b_{c_{d_\cdots}}}$$&lt;/span&gt; where all numbers involved are integers with at least two digits. When interpreting the values, each base conversion &lt;span class=&quot;math-container&quot;&gt;\$a_b\$&lt;/span&gt; is treated as from base &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; to base-10.&lt;/p&gt;&#xA;&lt;p&gt;There are two types of dungeons, one starting from &lt;span class=&quot;math-container&quot;&gt;\$10\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; from top to bottom, i.e. &lt;span class=&quot;math-container&quot;&gt;$$10_{11_{12_{\cdots_n}}}$$&lt;/span&gt; increasing &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; for each deeper layer, and one starting from &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$10\$&lt;/span&gt; from top to bottom, i.e. &lt;span class=&quot;math-container&quot;&gt;$$n_{(n-1)_{(n-2)_{\cdots_{10}}}}$$&lt;/span&gt; decreasing &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; for each deeper layer. Each dungeon has two interpretations, top down, i.e. &lt;span class=&quot;math-container&quot;&gt;$$(((10_{11})_{12})_\cdots)_n$$&lt;/span&gt;, and bottom up, i.e. &lt;span class=&quot;math-container&quot;&gt;$$10_{(11_{(12_{(\cdots_n)})})}$$&lt;/span&gt;, producing 4 dungeon number sequences in total.&lt;/p&gt;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&lt;p&gt;Considering &lt;span class=&quot;math-container&quot;&gt;$$10_{(11_{(12_{13})})}$$&lt;/span&gt;. The conversion is bottom up. First &lt;span class=&quot;math-container&quot;&gt;\$12_{13}\$&lt;/span&gt; is converted to &lt;span class=&quot;math-container&quot;&gt;\$15_{10}\$&lt;/span&gt;. Then &lt;span class=&quot;math-container&quot;&gt;\$11_{15}\$&lt;/span&gt; is converted to &lt;span class=&quot;math-container&quot;&gt;\$16_{10}\$&lt;/span&gt;. Finally &lt;span class=&quot;math-container&quot;&gt;\$10_{16}\$&lt;/span&gt; is converted to &lt;span class=&quot;math-container&quot;&gt;\$16_{10}\$&lt;/span&gt;, and this is the value for &lt;span class=&quot;math-container&quot;&gt;\$n=13\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Write a program or function, given an integer &lt;span class=&quot;math-container&quot;&gt;\$n&amp;gt;=10\$&lt;/span&gt; as input, output either the value of the dungeon number sequence at &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, or the whole sequence from &lt;span class=&quot;math-container&quot;&gt;\$10\$&lt;/span&gt; up to &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; inclusive. You may choose any sequence from the 4 sequences, but you must state which you have chosen. You must not hardcode the values; your code must work theoretically for all integer &lt;span class=&quot;math-container&quot;&gt;\$n&amp;gt;=10\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Values&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;n                                  10  11  12  13  14  15  16  17   18   19    20&#xA;---------------------------------------------------------------------------------&#xA;Type 1 (((10_11)_12)_...)_n        10  11  13  16  20  30  48  76  132  420  1640&#xA;Type 2 10_(11_(12_(..._n)))        10  11  13  16  20  25  31  38   46   55    65&#xA;Type 3 (((n_(n-1))_(n-2))_...)_10  10  11  13  16  20  28  45  73  133  348  4943&#xA;Type 4 n_((n-1)_((n-2)_(..._10)))  10  11  13  16  20  25  31  38   46   55   110&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Sample IO&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Type 1 (&lt;span class=&quot;math-container&quot;&gt;\$(((10_{11})_{12})_\cdots)_n\$&lt;/span&gt;)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;15 =&amp;gt; 30&#xA;20 =&amp;gt; 1640&#xA;25 =&amp;gt; 19563802363305&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Type 2 (&lt;span class=&quot;math-container&quot;&gt;\$10_{(11_{(12_{(\cdots_n)})})}\$&lt;/span&gt;)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;15 =&amp;gt; 25&#xA;20 =&amp;gt; 65&#xA;25 =&amp;gt; 943&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Type 3 (&lt;span class=&quot;math-container&quot;&gt;\$(((n_{(n-1)})_{(n-2)})_\cdots)_{10}\$&lt;/span&gt;)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;15 =&amp;gt; 28&#xA;20 =&amp;gt; 4943&#xA;25 =&amp;gt; 1092759075796059&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Type 4 (&lt;span class=&quot;math-container&quot;&gt;\$n_{((n-1)_{((n-2)_{(\cdots_{10})})})}\$&lt;/span&gt;)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;15 =&amp;gt; 25&#xA;20 =&amp;gt; 110&#xA;25 =&amp;gt; 3577&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Winning Criteria&lt;/h3&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, so shortest code for each language wins. No default loopholes.&lt;/p&gt;&#xA;" OwnerUserId="71546" LastEditorUserId="71546" LastEditDate="2020-08-01T02:39:46.213" LastActivityDate="2020-08-01T02:39:46.213" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19174" PostTypeId="2" ParentId="2140" CreationDate="2020-08-01T05:13:56.637" Score="3" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/208944/shift-tac-toe-code-golf-challenge&quot;&gt;Posted&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;h2&gt;Shift Tac Toe &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tic-tac-toe&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tic-tac-toe&amp;#39;&quot; rel=&quot;tag&quot;&gt;tic-tac-toe&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Shift Tac Toe is a game that combines Tic Tac Toe and Connect 4 together. In this game, you start with a 3 by 3 board, and each row is connected to a slider that you can move left and right. At the start, the sliders all start to the very right(this means that you can't move the slider to the right on the first turn). Each slider can hold a total of 5 pieces. Each turn, the player can drop an O or a X in one of the 3 columns of the Tic Tac Toe grid depending on which turn it is, or the player can move one of the sliders one spot to the left or to the right. All pieces fall to the bottom most space that is unoccupied. The pieces can also fall from one slider to another outside the 3 by 3 grid. If a piece is outside the 3 by 3 grid and doesn't fall into the bottom slider, then the piece is taken out. If it does reach the bottom slider, it will stay in play. A notable example of this is shown in the following grid:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;     --- --- --- --- ---&#xA;    |   |   |   |   - O -&#xA; --- --- --- --- --- ---&#xA;-   |   |   |   |   -&#xA; --- --- --- --- --- ---&#xA;    |   |   |   |   -   -&#xA;     --- --- --- --- ---&#xA;In the grid above, the dashes(-) indicate the part of the sliders that are outside of the 3 by 3 grid and the vertical bars(|) indicate the 3 by 3 grid.&#xA;As you can see, this is the starting board except that the middle slider is one spot over to the left, and that there is an O at the very top right. &#xA;What happens in this scenario? There is nothing immediately underneath it, so does it go out of play? &#xA;No. This is because it still falls into the bottom slider, which means that it is still in play.&#xA;&#xA;The final grid is this:&#xA;     --- --- --- --- ---&#xA;    |   |   |   |   -   -&#xA; --- --- --- --- --- ---&#xA;-   |   |   |   |   -&#xA; --- --- --- --- --- ---&#xA;    |   |   |   |   - O -&#xA;     --- --- --- --- --- &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Pieces can also stack outside of the 3 by 3 grid. Players will alternate between O and X, with the O player going first.&lt;/p&gt;&#xA;&lt;h2&gt;Example game:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Start with 3 by 3 grid with sliders all the way to the right:&#xA;&#xA; --- --- --- --- ---&#xA;|   |   |   |   -   -&#xA; --- --- --- --- ---&#xA;|   |   |   |   -   -&#xA; --- --- --- --- --- &#xA;|   |   |   |   -   -&#xA; --- --- --- --- ---&#xA;&#xA;The O player places an O in the middle column of the 3 by 3 grid and it falls to the bottom:&#xA;&#xA; --- --- --- --- ---&#xA;|   |   |   |   -   -&#xA; --- --- --- --- ---&#xA;|   |   |   |   -   -&#xA; --- --- --- --- --- &#xA;|   | O |   |   -   -&#xA; --- --- --- --- ---&#xA;&#xA;The X player then places an X in the middle column:&#xA;&#xA; --- --- --- --- ---&#xA;|   |   |   |   -   -&#xA; --- --- --- --- ---&#xA;|   | X |   |   -   -&#xA; --- --- --- --- --- &#xA;|   | O |   |   -   -&#xA; --- --- --- --- ---&#xA;&#xA;The O player then pushes the middle row slider one space to the left. &#xA;Notice that after the slider moves, there is nothing under the X anymore, so it falls down. &#xA;Also note that the slider has moved one space to the right as indicated below:&#xA;&#xA;     --- --- --- --- ---&#xA;    |   |   |   |   -   -&#xA; --- --- --- --- --- ---&#xA;-   |   |   |   |   -&#xA; --- --- --- --- --- ---&#xA;    | X | O |   |   -   -&#xA;     --- --- --- --- ---&#xA;&#xA;The X player places a X in the rightmost column:&#xA;&#xA;     --- --- --- --- ---&#xA;    |   |   |   |   -   -&#xA; --- --- --- --- --- ---&#xA;-   |   |   |   |   -&#xA; --- --- --- --- --- ---&#xA;    | X | O | X |   -   -&#xA;     --- --- --- --- --- &#xA;&#xA;The O player then moves the bottom slider one spot to the left.&#xA;Notice that all the pieces shift one place to the left, and the leftmost X is now out of the playing field:&#xA;&#xA;     --- --- --- --- ---&#xA;    |   |   |   |   -   -&#xA; --- --- --- --- --- ---&#xA;-   |   |   |   |   -&#xA; --- --- --- --- --- &#xA;- X | O | X |   |   -&#xA; --- --- --- --- --- &#xA;&#xA;The X player places a X in the leftmost column:&#xA;&#xA;     --- --- --- --- ---&#xA;    |   |   |   |   -   -&#xA; --- --- --- --- --- ---&#xA;-   | X |   |   |   -&#xA; --- --- --- --- --- &#xA;- X | O | X |   |   -&#xA; --- --- --- --- --- &#xA;&#xA;The O player places an O in the leftmost column:&#xA;&#xA;     --- --- --- --- ---&#xA;    | O |   |   |   -   -&#xA; --- --- --- --- --- ---&#xA;-   | X |   |   |   -&#xA; --- --- --- --- --- &#xA;- X | O | X |   |   -&#xA; --- --- --- --- --- &#xA;&#xA;The X player shifts the top slider one place to the left. Notice that the O falls one place down because there is nothing beneath it:&#xA;&#xA; --- --- --- --- ---&#xA;-   |   |   |   |   -&#xA; --- --- --- --- ---&#xA;- O | X |   |   |   -&#xA; --- --- --- --- --- &#xA;- X | O | X |   |   -&#xA; --- --- --- --- --- &#xA;&#xA;The O player is not very good at this game, so he shifts the middle slider one place to the right. &#xA;This shifts all the pieces in the middle row one place to the right:&#xA;&#xA; --- --- --- --- ---&#xA;-   |   |   |   |   -&#xA; --- --- --- --- --- ---&#xA;    | O | X |   |   -   -&#xA; --- --- --- --- --- ---&#xA;- X | O | X |   |   -&#xA; --- --- --- --- --- &#xA;&#xA;The X player wins the game by placing a X in the middle column:&#xA;&#xA; --- --- --- --- ---&#xA;-   |   | X |   |   -&#xA; --- --- --- --- --- ---&#xA;    | O | X |   |   -   -&#xA; --- --- --- --- --- ---&#xA;- X | O | X |   |   -&#xA; --- --- --- --- --- &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your job is to take in a string or array of any length that only consists of 9 unique characters(you choose the characters). Three of the characters will choose which column you place the X or O(depending on whose turn it is), three of them will choose which slider to move right, and the last three will choose which slider to move left. You can assume that the input only has these 9 characters. The output should be a 3 by 3 matrix or some kind of list/string that clearly shows the final position of the grid upon following the instructions of the input. You can assume that all inputs are valid. Each character takes up a turn. Also, if any move results in a winning move(forms 3 in a row in the 3 by 3 grid like regular Tic-Tac-Toe), then ignore the rest of the input. Note that the pieces that form the winning 3 in a row &lt;i&gt;all&lt;/i&gt; have to be in the 3 by 3 grid. The two example grids below are NOT winning positions:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Grid #1:&#xA; --- --- --- --- ---&#xA;|   |   |   |   -   -&#xA; --- --- --- --- ---&#xA;|   |   |   |   -   -&#xA; --- --- --- --- --- &#xA;|   |   | O | O - O -&#xA; --- --- --- --- ---&#xA;This is not a winning move because two of the O's are outside the playing field, despite the fact that it forms a 3 in a row.&#xA;Using the character assignment stated below, this grid pattern can be achieved with 99372467643.&#xA;&#xA;Grid #2:&#xA; --- --- --- --- ---&#xA;|   |   |   |   - O -&#xA; --- --- --- --- ---&#xA;|   |   |   | O - X -&#xA; --- --- --- --- --- &#xA;|   |   | O | X - X -&#xA; --- --- --- --- ---&#xA;This is not a winning position because two of the O's are outside the playing field.&#xA;Using the character assignment below, this grid pattern can be achieved with 939318836537734654&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In the examples below, &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;2&lt;/code&gt;, and &lt;code&gt;3&lt;/code&gt; mean drop in the leftmost, middle, and rightmost column respectively. &lt;code&gt;4&lt;/code&gt;, &lt;code&gt;5&lt;/code&gt;, and &lt;code&gt;6&lt;/code&gt; mean to move the top, middle, and bottom slider to the right respectively, and &lt;code&gt;7&lt;/code&gt;, &lt;code&gt;8&lt;/code&gt;, and &lt;code&gt;9&lt;/code&gt; mean to move the top, middle, and bottom slider to the left respectively.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input will be in the form of a string&#xA;Output will be a list of lists, with each sub-list representing a row(I'm Python programmer so this list format might not be compatible with all languages). &#xA;The first, second, and third sub-list correspond to the top, middle, and bottom row of the 3 by 3 grid respectively. &#xA;The output will have 'O' for the O pieces, 'X' for the X pieces, and an empty string for empty spaces.&#xA;&#xA;Input: 123332&#xA;Output:&#xA;[['','','O'],&#xA; ['','X','X'],&#xA; ['O','X','O']] &#xA;&#xA;Input: 33387741347&#xA;Output:&#xA;[['','',''],&#xA; ['','','O'],&#xA; ['X','O','X']]&#xA;&#xA;Input: 2283911752&#xA;Output:&#xA;[['','X',''],&#xA; ['O','X',''],&#xA; ['O','X','']]&#xA;&#xA;Input: 228374739&#xA;Output:&#xA;[['','',''],&#xA; ['','',''],&#xA; ['X','X','X']]&#xA;&#xA;Input: 8873334917349&#xA;Output:&#xA;[['','',''],&#xA; ['','','O'],&#xA; ['X','X','O']]&#xA;&#xA;Input: 799333466&#xA;Output:&#xA;[['','',''],&#xA; ['','',''],&#xA; ['','','']]&#xA;&#xA;Input: 99372467643&#xA;Output:&#xA;[['','',''],&#xA; ['','',''],&#xA; ['','','O']]&#xA;&#xA;Input: 939318836537734654&#xA;Output:&#xA;[['','',''],&#xA; ['','',''],&#xA; ['','','O']]&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins!&lt;/p&gt;&#xA;&lt;h2&gt;My concerns about this challenge:&lt;/h2&gt;&#xA;&lt;p&gt;Are the rules of this game explained enough? Do you understand this game?&lt;/p&gt;&#xA;&lt;p&gt;Is this a good challenge overall?&lt;/p&gt;&#xA;&lt;p&gt;Are the examples correct(if you understand the rules)?&lt;/p&gt;&#xA;&lt;p&gt;Should I put more examples(or if you understand the rules, could you supply me with some)?&lt;/p&gt;&#xA;&lt;p&gt;What other tags can this challenge fit into?&lt;/p&gt;&#xA;" OwnerUserId="96039" LastEditorUserId="96039" LastEditDate="2020-08-09T19:21:41.657" LastActivityDate="2020-08-09T19:21:41.657" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="19177" PostTypeId="2" ParentId="2140" CreationDate="2020-08-02T07:19:01.753" Score="2" Body="&lt;h1&gt;Where are the traps? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/179195/trapped-knight-sequence&quot;&gt;Trapped Knight Sequence&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/179157/the-path-of-the-wildebeest&quot;&gt;The Path Of The Wildebeest&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Background &lt;sup&gt;Partially copied from my related challenge&lt;/sup&gt;&lt;/h3&gt;&#xA;&lt;p&gt;The trapped knight sequence is a finite integer sequence of length 2016, starting from 1, and has the following construction rules:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Write a number spiral in the following manner:&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;pre&gt;&lt;code&gt;17 16 15 14 13 ...&#xA;18  5  4  3 12 ...&#xA;19  6  1  2 11 ...&#xA;20  7  8  9 10 ...&#xA;21 22 23 24 25 ...&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;Place a knight on 1.&lt;/li&gt;&#xA;&lt;li&gt;Move the knight to the grid with the smallest number it can go that has not been visited before, according to the rules of chess (i.e. 2 units vertically and 1 unit horizontally, or vice versa).&lt;/li&gt;&#xA;&lt;li&gt;Repeat until the knight gets stuck.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;It is known that the sequence ends at 2084 where the knight is trapped. But here is a twist. Suppose a knight can step back to the previous grid whenever it is stuck, and choose the grid with the next smallest number possible. By doing so, the sequence can be further extended until it is stuck again at 2720. Then, the knight steps back and choose another path, which further extends the sequence until it is stuck again at 3325...&lt;/p&gt;&#xA;&lt;p&gt;Then, we call these numbers at which the knight is being trapped &amp;quot;traps&amp;quot;. So we now know that the first few traps are at 2084, 2720, 3325, ... and it continues to infinity.&lt;/p&gt;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Write a shortest program or function, receiving an integer &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; as input, output the first &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; traps in the extended trapped knight sequence.&lt;/p&gt;&#xA;&lt;h3&gt;Values&lt;/h3&gt;&#xA;&lt;p&gt;The first 100 terms of the sequence are as follows.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  2084,   2720,   3325,   3753,   7776,   5632,   7411,   8562,  14076,   8469, &#xA;  9231,  22702,  14661,  21710,  21078,  25809,  27112,  24708,  19844,  26943,&#xA; 26737,  32449,  31366,  45036,  37853,  37188,  43318,  62095,  67401,  68736,&#xA; 70848,  62789,  63223,  69245,  85385,  52467,  71072,  68435,  76611,  84206,&#xA; 81869,  70277,  81475,  83776,  70767,  84763,  99029,  82609, 103815,  86102,&#xA; 93729, 100614, 108039,  82111,  99935,  85283, 109993, 119856, 119518, 116066, &#xA;109686,  92741, 124770,  92378, 104657, 125102, 107267, 107246, 117089, 117766,&#xA; 99295, 121575,  98930, 117390, 123583, 112565, 122080, 111612, 111597,  97349,&#xA;105002, 130602, 133509, 153410, 127138, 143952, 153326, 157774, 122534, 136542,&#xA;163038, 134778, 140186, 162865, 171044, 159637, 171041, 174368, 184225, 152988&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Winning Criteria&lt;/h3&gt;&#xA;&lt;p&gt;The shortest code of each language wins. Restrictions on standard loopholes apply.&lt;/p&gt;&#xA;" OwnerUserId="71546" LastActivityDate="2020-08-02T07:19:01.753" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19179" PostTypeId="2" ParentId="2140" CreationDate="2020-08-02T12:00:38.147" Score="2" Body="&lt;h1&gt;Convert LifeOnTheEdge to LifeOnTheSlope&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task here is to take a LifeOnTheEdge pattern and convert it to LifeOnTheSlope.&lt;/p&gt;&#xA;&lt;p&gt;A LifeOnTheEdge pattern is composed of these four characters: &lt;code&gt;|_L &lt;/code&gt;. A pattern corresponds to a certain arrangement of &amp;quot;on&amp;quot; edges in a square grid. The pattern is placed in the grid first with the characters in the cells, and each of the four letters specifies the state of the edges on the left and the bottom of that cell. &lt;code&gt;|&lt;/code&gt; means the edge on the left is on, &lt;code&gt;_&lt;/code&gt; means the bottom edge is on, &lt;code&gt;L&lt;/code&gt; means both of them are on and &lt;code&gt; &lt;/code&gt; means neither of them are on.&lt;/p&gt;&#xA;&lt;p&gt;For example the following LifeOnTheEdge:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;|_L&#xA; |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;translates to:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;. . . . .&#xA;|   |&#xA;. ._._. .&#xA;  |&#xA;. . . . .&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your task is however convert it to LifeOnTheSlope. LifeOnTheSlope is a LifeOnTheEdge equivalent but only uses three symbols: &lt;code&gt;/\ &lt;/code&gt;. You should rotate the pattern 45-degree clockwise, for example the above example translates to:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;/&#xA;&#xA;/\/&#xA;  \&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&lt;p&gt;I'm not sure if I described the problem clearly. Improvements on the wording and other things?&lt;/p&gt;&#xA;" OwnerUserId="87986" LastActivityDate="2020-08-02T12:00:38.147" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19182" PostTypeId="2" ParentId="2140" CreationDate="2020-08-03T16:30:49.960" Score="-4" Body="&lt;h1&gt;Fastest prime printer up to 500,000,000 with gapes&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Write a program that takes no input and prints the first 26,355,867 prime numbers, from 2 to 499,999,993 inclusively.&#xA;Or in other words, print all the prime numbers smaller the 500,000,000.&lt;/p&gt;&#xA;&lt;p&gt;The fastest code wins!&lt;/p&gt;&#xA;&lt;p&gt;Since it will take a long time to print all the numbers, print only every 26355 primes starting with 2 separated by a new line.&#xA;So the output should look like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2&#xA;304417&#xA;648391&#xA;1007681&#xA;1376449&#xA;1752323&#xA;2133689&#xA;2520983&#xA;2910797&#xA;3304633&#xA;3702269&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The output should not be hardcoded, or there is no fun in it.&lt;/p&gt;&#xA;&lt;p&gt;The results will be tested on my machine, so please also output in the last line how long it took to run the program and give me some instructions about how to run it locally. I will then share the last line output with you that should contain the time it took to run.&lt;/p&gt;&#xA;&lt;p&gt;Here is my machine system specs, note that it's Windows.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/xURBl.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/xURBl.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="10588" LastEditorUserId="10588" LastEditDate="2020-08-04T02:15:56.813" LastActivityDate="2020-08-04T02:15:56.813" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="19183" PostTypeId="1" AcceptedAnswerId="19184" CreationDate="2020-08-03T19:01:31.700" Score="2" ViewCount="101" Body="&lt;p&gt;I've got &lt;a href=&quot;https://codegolf.stackexchange.com/questions/208982&quot;&gt;a question&lt;/a&gt; that I really don't like (does not meet my standards, has repetitive answers because I did not realize how many languages had built-in functions for transpositions, etc).&lt;/p&gt;&#xA;&lt;p&gt;&lt;s&gt;I would edit to fix those things but that would bump the question to the top of the page, and besides, I would still dislike it then.&lt;/s&gt; I cannot delete the question because it has too many answers, and I cannot cast a close vote because I have ~1500 rep. Should I just sit and wait for its closure at this point? (it is garnering close votes at this very moment)&lt;/p&gt;&#xA;" OwnerUserId="94333" LastEditorUserId="94333" LastEditDate="2020-08-03T20:28:30.780" LastActivityDate="2020-08-03T21:10:29.480" Title="Unable to Delete and Unable to Close Vote" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19184" PostTypeId="2" ParentId="19183" CreationDate="2020-08-03T21:10:29.480" Score="7" Body="&lt;p&gt;First: I'm sorry you feel this way. This site is supposed to be a source of enjoyment, not pain.&lt;/p&gt;&#xA;&lt;p&gt;That said, I don't think you need to feel bad about it. There are plenty of challenges that have trivial answers in powerful languages, but as of this writing, you have:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;12 upvotes (vs only 3 downvotes)&lt;/li&gt;&#xA;&lt;li&gt;Over 600 views (in less than 24 hours)&lt;/li&gt;&#xA;&lt;li&gt;20 answers (over a handful non-trivial ones)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is nothing to be ashamed of. Experienced challenge writers have done worse.&lt;/p&gt;&#xA;&lt;p&gt;Going forward, I think the wisest thing to do is to utilise &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;the sandbox&lt;/a&gt;, but even then, you shouldn't worry too much; this site &lt;em&gt;is&lt;/em&gt; all about having fun while becoming better.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2020-08-03T21:10:29.480" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19185" PostTypeId="2" ParentId="2140" CreationDate="2020-08-03T21:22:08.503" Score="2" Body="&lt;h1&gt;Source Code Byte Frequency - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/209319/source-code-byte-frequency&quot;&gt;Posted here&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Changes from the original idea:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Without the requirement of fixed representation of the result (percentage and trimming).&lt;/li&gt;&#xA;&lt;li&gt;With constraint: source code must be at least 1 byte long&lt;/li&gt;&#xA;&lt;li&gt;Changed from character to byte, plus removing the constraint of SBCS languages only.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="95505" LastEditorUserId="95505" LastEditDate="2020-08-09T16:49:40.707" LastActivityDate="2020-08-09T16:49:40.707" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="19186" PostTypeId="2" ParentId="2140" CreationDate="2020-08-04T02:08:32.120" Score="3" Body="&lt;h1&gt;Is this Chessboard Reachable?&lt;/h1&gt;&#xA;&lt;p&gt;The goal of this challenge is to determine, given the state of a&#xA;chessboard, whether or not that chessboard can actually be reached in&#xA;the course of standard play. Of course, doing this in general is a&#xA;rather hard problem, so we'll be simplifying the problem to a set of a&#xA;few rules which should approximate the &amp;quot;reachability&amp;quot; constraint.&lt;/p&gt;&#xA;&lt;p&gt;Your input will be a chessboard, specifying what pieces are at what&#xA;positions on the 8x8 board. At each position, there can be either&#xA;nothing or a piece. If there is a piece, it is either a pawn, bishop,&#xA;knight, rook, queen, or king, and it is either white or black. Input&#xA;can be taken in any reasonable form. Your output should be truthy or&#xA;falsy, indicating whether all of the below rules are satisfied.&lt;/p&gt;&#xA;&lt;p&gt;For the below rules, I'll be using standard chess notation to refer to&#xA;the squares on the board. That is, I'll be referring to squares on the&#xA;board by their rank (1-8) and their file (a-h), as such&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 8........&#xA; 7........&#xA; 6........&#xA; 5........&#xA; 4........&#xA; 3........&#xA; 2........&#xA; 1........&#xA;  abcdefgh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;where the white player starts on ranks 1-2 and the black player starts&#xA;on ranks 7-8. Obviously, you don't have to use the same notation, and&#xA;if it's easier for you to take the board input flipped or rotated,&#xA;that's fine too as long as you specify it in your answer.&lt;/p&gt;&#xA;&lt;p&gt;For one of the rules, you have to distinguish between white and black&#xA;squares on the board. The board is layered with a checkerboard&#xA;pattern, so white squares are always immediately surrounded by black&#xA;on all four sides, and vice versa. In typical chess, the a1 square is&#xA;black, but that doesn't really matter for the below criteria.&lt;/p&gt;&#xA;&lt;h2&gt;The Rules&lt;/h2&gt;&#xA;&lt;p&gt;In order for a board to be considered reachable, it must satisfy &lt;em&gt;all&lt;/em&gt;&#xA;of the following rules. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;, so you don't have&#xA;to tell me which rule an unreachable board violated; all I expect of&#xA;your output is a &amp;quot;yes&amp;quot; or a &amp;quot;no&amp;quot;.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;White and black each have exactly one king on the board: no more,&#xA;no less.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Pawns cannot appear on rank 1 or rank 8.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each player has a maximum of 16 pieces on the board total. These&#xA;pieces must be a subset of the following: 2 bishops, 2 rooks, 2&#xA;knights, 1 queen, 1 king, and 8 wildcards. The &amp;quot;wildcard&amp;quot; pieces&#xA;can be any piece they please (since we assume pawns could have been&#xA;promoted).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For either player, if that player has at least two bishops, and&#xA;those two bishops cannot have been promoted from pawns (i.e. they&#xA;must be the &amp;quot;bishops&amp;quot; in rule 3, not the &amp;quot;wildcards&amp;quot;), then that&#xA;player must have at least one bishop on a white square and at least&#xA;one bishop on a black square.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;All of a player's pawns must be able to reach the square they're&#xA;occupying. More formally, for each player, there must be an&#xA;assignment (an injective function) from the set of that player's&#xA;surviving pawns to the files (a-h) they started on, such that each&#xA;pawn can reach its current position from its starting position with&#xA;only forward and forward-diagonal movements.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Pawn Movements&lt;/h2&gt;&#xA;&lt;p&gt;Rule 5 may require some elaboration. Suppose a white pawn is on d5. Then it could have come from the following&#xA;places (indicated by &lt;code&gt;X&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 8........&#xA; 7........&#xA; 6........&#xA; 5...♙....&#xA; 4..XXX...&#xA; 3.XXXXX..&#xA; 2XXXXXXX.&#xA; 1........&#xA;  abcdefgh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;So it could have started on a2, b2, c2, d2, e2, f2, or g2, but not h2.&#xA;There must be an assignment of pawns to starting positions such that&#xA;no two pawns started at the same position and every pawn can reach its&#xA;current position from where it began. A black pawn follows the same&#xA;rules but started on rank 7 and moves down rather than up. So a black&#xA;pawn at the same position could have come from b7, c7, d7, e7, or f7,&#xA;as follows.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 8........&#xA; 7.XXXXX..&#xA; 6..XXX...&#xA; 5...♟....&#xA; 4........&#xA; 3........&#xA; 2........&#xA; 1........&#xA;  abcdefgh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Only the rules above apply. Other complexities of a standard game&#xA;of chess (in particular, castling or en passant) are not part of&#xA;this problem and should not be considered.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest solution wins.&lt;/li&gt;&#xA;&lt;li&gt;Input can be taken in whatever form is most convenient. Output&#xA;follows the usual &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; rules, so any two distinct&#xA;outputs for truthy/falsy are acceptable.&lt;/li&gt;&#xA;&lt;li&gt;This is an oversimplification of the reachability problem in chess.&#xA;As such, an answer which provably enumerates every chessboard and&#xA;tests for membership is not correct.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Reachable chessboards (true):&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 8♜♞♝♛♚♝♞♜&#xA; 7♟♟♟♟♟♟♟♟&#xA; 6........&#xA; 5........&#xA; 4........&#xA; 3........&#xA; 2♙♙♙♙♙♙♙♙&#xA; 1♖♘♗♕♔♗♘♖&#xA;  abcdefgh&#xA;&#xA; 8........&#xA; 7........&#xA; 6........&#xA; 5........&#xA; 4........&#xA; 3........&#xA; 2..♚.....&#xA; 1.....♔..&#xA;  abcdefgh&#xA;&#xA; 8........&#xA; 7.....♚..&#xA; 6.♛......&#xA; 5...♟....&#xA; 4........&#xA; 3.....♕..&#xA; 2........&#xA; 1...♔....&#xA;  abcdefgh&#xA;&#xA; 8.....♚..&#xA; 7♟♟♟♟♟♟♟♟&#xA; 6........&#xA; 5........&#xA; 4........&#xA; 3........&#xA; 2♙♙♙♙♙♙♙♙&#xA; 1....♔...&#xA;  abcdefgh&#xA;&#xA; 8.....♚...&#xA; 7♟♟♟♟♟♟♟♟&#xA; 6........&#xA; 5........&#xA; 4........&#xA; 3........&#xA; 2♙♙♙♙♙♙♙♙&#xA; 1....♔...&#xA;  abcdefgh&#xA;&#xA; 8........&#xA; 7.♚......&#xA; 6...♕♕♕♕.&#xA; 5..♕....♕&#xA; 4..♕..♔.♕&#xA; 3.......♕&#xA; 2........&#xA; 1........&#xA;  abcdefgh&#xA;&#xA; 8........&#xA; 7...♚.♟.♙&#xA; 6.♙.♙..♙.&#xA; 5.....♘..&#xA; 4.♕..♕♘♗♖&#xA; 3.....♘♗♖&#xA; 2..♕....♖&#xA; 1......♔.&#xA;  abcdefgh&#xA;&#xA; 8♜..♛♚♜♜♜&#xA; 7♟♟♟♟♟♟..&#xA; 6........&#xA; 5........&#xA; 4........&#xA; 3........&#xA; 2♙♙♙♙♙♙♙♙&#xA; 1♖♘♗♕♔♗♘♖&#xA;  abcdefgh&#xA;&#xA; 8♜♞♝♛♚♝♞♜&#xA; 7♟♟♟♟♟♟♟♟&#xA; 6........&#xA; 5........&#xA; 4........&#xA; 3........&#xA; 2♙♙♙♙♙♙♙.&#xA; 1♖♗♘♕♔♗♘♖&#xA;  abcdefgh&#xA;&#xA; 8♛♛♛♛♛♛.♛&#xA; 7........&#xA; 6......♚.&#xA; 5.♝.♝....&#xA; 4.....♟..&#xA; 3........&#xA; 2..♖♖♖.♔.&#xA; 1........&#xA;  abcdefgh&#xA;&#xA; 8.....♚..&#xA; 7........&#xA; 6........&#xA; 5........&#xA; 4........&#xA; 3.♙♙.....&#xA; 2..♙♙♙♙♙♙&#xA; 1.....♔..&#xA;  abcdefgh&#xA;&#xA; 8.....♚..&#xA; 7........&#xA; 6........&#xA; 5........&#xA; 4........&#xA; 3.....♙..&#xA; 2...♙♙♙.♙&#xA; 1.....♔..&#xA;  abcdefgh&#xA;&#xA; 8.....♚..&#xA; 7........&#xA; 6.♟♟♟♟...&#xA; 5.♟♟.....&#xA; 4........&#xA; 3........&#xA; 2........&#xA; 1.....♔..&#xA;  abcdefgh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Unreachable chessboards (false):&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;(Rule 1: Not enough kings)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 8........&#xA; 7........&#xA; 6........&#xA; 5........&#xA; 4........&#xA; 3........&#xA; 2........&#xA; 1........&#xA;  abcdefgh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Rule 1: Too many kings)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 8♚♚♚♚♚♚♚♚&#xA; 7♚♚♚♚♚♚♚♚&#xA; 6♚♚♚♚♚♚♚♚&#xA; 5♚♚♚♚♚♚♚♚&#xA; 4♚♚♚♚♚♚♚♚&#xA; 3........&#xA; 2........&#xA; 1...♔....&#xA;  abcdefgh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Rule 2: Bad white pawn placement)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 8.....♚..&#xA; 7♟♟♟♟♟♟♟♟&#xA; 6........&#xA; 5........&#xA; 4........&#xA; 3........&#xA; 2.♙♙♙♙♙♙♙&#xA; 1♙...♔...&#xA;  abcdefgh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Rule 2: Bad black pawn placement)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 8.♟...♚..&#xA; 7♟.♟♟♟♟♟♟&#xA; 6........&#xA; 5........&#xA; 4........&#xA; 3........&#xA; 2♙♙♙♙♙♙♙♙&#xA; 1....♔...&#xA;  abcdefgh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Rule 3: Too many white queens)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 8........&#xA; 7.♚......&#xA; 6...♕♕♕♕.&#xA; 5..♕....♕&#xA; 4..♕..♔.♕&#xA; 3..♕....♕&#xA; 2........&#xA; 1........&#xA;  abcdefgh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Rule 3: Too many black pieces)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 8♜♞♝♛♚♝♞♜&#xA; 7♟♟♟♟♟♟♟♟&#xA; 6......♟.&#xA; 5........&#xA; 4........&#xA; 3........&#xA; 2♙♙♙♙♙♙♙♙&#xA; 1♖♘♗♕♔♗♘♖&#xA;  abcdefgh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Rule 3: Too many white pieces)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 8........&#xA; 7...♚.♙.♙&#xA; 6.♙.♙..♙.&#xA; 5.....♘..&#xA; 4.♕..♕♘♗♖&#xA; 3.....♘♗♖&#xA; 2..♕....♖&#xA; 1......♔.&#xA;  abcdefgh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Rule 3: Too many black rooks)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 8♜..♛♚♜♜♜&#xA; 7♟♟♟♟♟♟♟.&#xA; 6........&#xA; 5........&#xA; 4........&#xA; 3........&#xA; 2♙♙♙♙♙♙♙♙&#xA; 1♖♘♗♕♔♗♘♖&#xA;  abcdefgh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Rule 4: White bishops are the same color)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 8♜♞♝♛♚♝♞♜&#xA; 7♟♟♟♟♟♟♟♟&#xA; 6........&#xA; 5........&#xA; 4........&#xA; 3........&#xA; 2♙♙♙♙♙♙♙♙&#xA; 1♖♗♘♕♔♗♘♖&#xA;  abcdefgh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Rule 4: Black bishops are the same color)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 8♛♛♛♛♛♛♛♛&#xA; 7........&#xA; 6......♚.&#xA; 5.♝.♝....&#xA; 4.....♟..&#xA; 3........&#xA; 2..♖♖♖.♔.&#xA; 1........&#xA;  abcdefgh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Rule 5: White pawn placement is impossible)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 8.....♚..&#xA; 7........&#xA; 6........&#xA; 5........&#xA; 4........&#xA; 3..♙.....&#xA; 2.♙♙♙♙♙♙♙&#xA; 1.....♔..&#xA;  abcdefgh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Rule 5: White pawn placement is impossible)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 8.....♚..&#xA; 7........&#xA; 6........&#xA; 5........&#xA; 4........&#xA; 3.....♙.♙&#xA; 2...♙♙♙.♙&#xA; 1.....♔..&#xA;  abcdefgh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Rule 5: Black pawn placement is impossible)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 8.....♚..&#xA; 7.♟♟♟♟...&#xA; 6........&#xA; 5.♟♟.....&#xA; 4.♟♟.....&#xA; 3........&#xA; 2........&#xA; 1.....♔..&#xA;  abcdefgh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Example Implementation (Python 3)&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;# Takes input from stdin in the form shown above (a grid of Unicode&#xA;# chess characters and dots). Prints True if reachable. Prints False&#xA;# and the first rule number which is violated if unreachable.&#xA;&#xA;import sys&#xA;from collections import defaultdict, namedtuple&#xA;&#xA;Piece = namedtuple('Piece', ['color', 'type'])&#xA;&#xA;# Read in the data from stdin.&#xA;data = []&#xA;for line in sys.stdin:&#xA;    chars = list(filter(lambda x: x in &amp;quot;.♟♙♝♗♞♘♜♖♛♕♚♔&amp;quot;, line))&#xA;    if chars:&#xA;        data.append(chars)&#xA;    if len(data) == 8:&#xA;        break&#xA;assert len(data) == 8&#xA;for line in data:&#xA;    assert len(line) == 8&#xA;&#xA;# Parse it into a more convenient format.&#xA;translation = {&#xA;    &amp;quot;.&amp;quot;: None,&#xA;    &amp;quot;♟&amp;quot;: Piece('black', 'pawn'),&#xA;    &amp;quot;♙&amp;quot;: Piece('white', 'pawn'),&#xA;    &amp;quot;♝&amp;quot;: Piece('black', 'bishop'),&#xA;    &amp;quot;♗&amp;quot;: Piece('white', 'bishop'),&#xA;    &amp;quot;♞&amp;quot;: Piece('black', 'knight'),&#xA;    &amp;quot;♘&amp;quot;: Piece('white', 'knight'),&#xA;    &amp;quot;♜&amp;quot;: Piece('black', 'rook'),&#xA;    &amp;quot;♖&amp;quot;: Piece('white', 'rook'),&#xA;    &amp;quot;♛&amp;quot;: Piece('black', 'queen'),&#xA;    &amp;quot;♕&amp;quot;: Piece('white', 'queen'),&#xA;    &amp;quot;♚&amp;quot;: Piece('black', 'king'),&#xA;    &amp;quot;♔&amp;quot;: Piece('white', 'king'),&#xA;}&#xA;for rank in data:&#xA;    for i in range(8):&#xA;        rank[i] = translation[rank[i]]&#xA;&#xA;# Count the number of each piece that each player has, slotting&#xA;# necessary pawn promotions into their own category.&#xA;allowed = { 'bishop': 2, 'rook': 2, 'knight': 2, 'king': 999, 'queen': 1, 'pawn': 0 }&#xA;pieces = defaultdict(lambda: 0)&#xA;for rank in data:&#xA;    for piece in rank:&#xA;        if piece is None:&#xA;            continue&#xA;        if pieces[piece] &amp;gt;= allowed[piece.type]:&#xA;            # Already have too many; it's a promoted pawn&#xA;            pieces[Piece(piece.color, 'pawn')] += 1&#xA;        else:&#xA;            # Count it normally&#xA;            pieces[piece] += 1&#xA;&#xA;# Rule 1: Each color should have exactly one king.&#xA;if pieces[Piece('white', 'king')] != 1 or pieces[Piece('black', 'king')] != 1:&#xA;    print(False, 1)&#xA;    exit(0)&#xA;&#xA;# Rule 2: Pawns cannot appear on rank 1 or rank 8.&#xA;for piece in data[0] + data[7]:&#xA;    if piece is not None and piece.type == 'pawn':&#xA;        print(False, 2)&#xA;        exit(0)&#xA;&#xA;# Rule 3: Since we already put any &amp;quot;overflow&amp;quot; pieces at the pawn key,&#xA;# we just need to make sure we have at most eight pawns.&#xA;for color in ['white', 'black']:&#xA;    if pieces[Piece(color, 'pawn')] &amp;gt; 8:&#xA;        print(False, 3)&#xA;        exit(0)&#xA;&#xA;# Rule 4: If we have both bishops and our pawns are all accounted for,&#xA;# then we have to have a bishop in each color.&#xA;for color in ['white', 'black']:&#xA;    if pieces[Piece(color, 'bishop')] &amp;gt;= 2 and pieces[Piece(color, 'pawn')] &amp;gt;= 8:&#xA;        squares = { 'white': False, 'black': False }&#xA;        for y, rank in enumerate(data):&#xA;            for x, piece in enumerate(rank):&#xA;                square_color = 'white' if (x + y) % 2 == 0 else 'black'&#xA;                if piece == Piece(color, 'bishop'):&#xA;                    squares[square_color] = True&#xA;        if not (squares['white'] and squares['black']):&#xA;            print(False, 4)&#xA;            exit(0)&#xA;&#xA;# Rule 5: All pawns must be able to get to where they are. I solve&#xA;# this here by brute force (simply trying every possible permutation),&#xA;# which is exponentially inefficient, but it'll do for this example.&#xA;def recursive_assign(taken, choices, i):&#xA;    if i &amp;gt;= len(choices):&#xA;        return True&#xA;    current = choices[i]&#xA;    for x in current:&#xA;        if x not in taken:&#xA;            if recursive_assign(taken + [x], choices, i + 1):&#xA;                return True&#xA;    return False&#xA;&#xA;for color in ['white', 'black']:&#xA;    starting_file = 6 if color == 'white' else 1&#xA;    choices = []&#xA;    for y, rank in enumerate(data):&#xA;        for x, piece in enumerate(rank):&#xA;            if piece == Piece(color, 'pawn'):&#xA;                possibilities = range(8)&#xA;                possibilities = filter(lambda i: abs(i - x) &amp;lt;= abs(y - starting_file), possibilities)&#xA;                choices.append(list(possibilities))&#xA;    if not recursive_assign([], choices, 0):&#xA;        print(False, 5)&#xA;        exit(0)&#xA;&#xA;print(True)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Proposed Tags&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot;&gt;chess&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Sandbox Concerns&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I worry Rules 4 and 5 are still not clear enough. I tried to write&#xA;them in a way that was as clear as possible while still being&#xA;mathematically unambiguous.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="9486" LastActivityDate="2020-08-04T02:08:32.120" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19187" PostTypeId="2" ParentId="2140" CreationDate="2020-08-04T02:28:42.180" Score="2" Body="&lt;h1&gt;Identify the tonic from a key signature&lt;/h1&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Given a &lt;a href=&quot;https://en.wikipedia.org/wiki/Key_signature&quot; rel=&quot;nofollow noreferrer&quot;&gt;key signature&lt;/a&gt; in major, output its tonic.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;An integer from -14 to +14, inclusive. Its absolute value is the numbers of flats/sharps. Negative number represents flats, and positive number represents sharps. Note that &lt;a href=&quot;https://en.wikipedia.org/wiki/Theoretical_key&quot; rel=&quot;nofollow noreferrer&quot;&gt;theoretical keys&lt;/a&gt; are also considered.&lt;/p&gt;&#xA;&lt;h2&gt;Mapping&lt;/h2&gt;&#xA;&lt;p&gt;Note the use of Unicode characters ♭(U+266D; music flat sign), ♯(U+266F; music sharp sign), (U+1D12A; musical symbol double sharp), and (U+1D12B; musical symbol double flat).&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;-14 → C&lt;br /&gt;&#xA;-13 → G&lt;br /&gt;&#xA;-12 → D&lt;br /&gt;&#xA;-11 → A&lt;br /&gt;&#xA;-10 → E&lt;br /&gt;&#xA;-9 → B&lt;br /&gt;&#xA;-8 → F♭&lt;br /&gt;&#xA;-7 → C♭&lt;br /&gt;&#xA;-6 → G♭&lt;br /&gt;&#xA;-5 → D♭&lt;br /&gt;&#xA;-4 → A♭&lt;br /&gt;&#xA;-3 → E♭&lt;br /&gt;&#xA;-2 → B♭&lt;br /&gt;&#xA;-1 → F&lt;br /&gt;&#xA;0 → C&lt;br /&gt;&#xA;1 → G&lt;br /&gt;&#xA;2 → D&lt;br /&gt;&#xA;3 → A&lt;br /&gt;&#xA;4 → E&lt;br /&gt;&#xA;5 → B&lt;br /&gt;&#xA;6 → F♯&lt;br /&gt;&#xA;7 → C♯&lt;br /&gt;&#xA;8 → G♯&lt;br /&gt;&#xA;9 → D♯&lt;br /&gt;&#xA;10 → A♯&lt;br /&gt;&#xA;11 → E♯&lt;br /&gt;&#xA;12 → B♯&lt;br /&gt;&#xA;13 → F&lt;br /&gt;&#xA;14 → C&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Output must be a string. Whitespaces are permitted everywhere.&lt;/p&gt;&#xA;&lt;h2&gt;Rule&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Invalid inputs fall in &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2020-08-04T08:14:37.937" LastActivityDate="2020-08-04T08:14:37.937" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19188" PostTypeId="2" ParentId="2140" CreationDate="2020-08-04T13:38:50.020" Score="3" Body="&lt;h1&gt;Road Sort Order&lt;/h1&gt;&#xA;&lt;p&gt;In Britain, road identifiers use &lt;a href=&quot;https://en.wikipedia.org/wiki/Great_Britain_road_numbering_scheme&quot; rel=&quot;nofollow noreferrer&quot;&gt;a scheme&lt;/a&gt; of a letter, followed by a 1-4 digit number.&lt;/p&gt;&#xA;&lt;p&gt;From Most-Important to Least-Important, the letters are:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;M&lt;br /&gt;&#xA;A&lt;br /&gt;&#xA;B&lt;br /&gt;&#xA;C&lt;br /&gt;&#xA;D&lt;br /&gt;&#xA;U&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The numbers also represent further assumptions around the importance of the road, such that a 1-digit number is more important than a 4-digit number.&lt;/p&gt;&#xA;&lt;p&gt;Thus, the &lt;code&gt;M898&lt;/code&gt; is &lt;em&gt;less&lt;/em&gt; important than the &lt;code&gt;M8&lt;/code&gt;, but &lt;em&gt;more&lt;/em&gt; important than the &lt;code&gt;A8&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;interesting but not relevant for the challenge - Roads are also sorted into nine &lt;code&gt;Zones&lt;/code&gt;, of equal importance. The first number in each road identifier gives the Zone that the road starts in (e.g. &lt;code&gt;A8&lt;/code&gt; starts in Zone 8 - although there are exceptions where one Motorway spurs off of another, e.g. &lt;code&gt;M48&lt;/code&gt; is so named because it is a spur of the &lt;code&gt;M4&lt;/code&gt; even though it is officially in Zone 5).&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a pair of road identifiers, identify and output which is the most important road. Where there is no difference in importance by the above rules (e.g &amp;quot;B4063&amp;quot; and &amp;quot;B1234&amp;quot;) then either output is acceptable.&lt;/p&gt;&#xA;&lt;p&gt;Usual I/O rules apply, this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so lowest bytes wins. There will be two inputs, and no invalid inputs (i.e. they will follow the rules, although they may not be actual real-life roads).&lt;/p&gt;&#xA;&lt;p&gt;If you say so in your answer, you may instead output the least significant road (i.e. as long as I know which it is, you can do either).&lt;/p&gt;&#xA;&lt;p&gt;You may take the input as a string, array of strings, or array of strings and integers as follows:&lt;/p&gt;&#xA;&lt;p&gt;&amp;quot;M123M223&amp;quot;&lt;br /&gt;&#xA;[&amp;quot;M123&amp;quot;,&amp;quot;M223&amp;quot;]&lt;br /&gt;&#xA;[&amp;quot;M&amp;quot;,123,&amp;quot;M&amp;quot;,223]&lt;/p&gt;&#xA;&lt;p&gt;#SANDBOX# If there are input formats that you think should/n't be allowed, let me know.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;A11,M2&lt;/code&gt; -&amp;gt; &lt;code&gt;M2&lt;/code&gt;(Motorways come before A roads)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;M823,M89&lt;/code&gt; -&amp;gt;&#xA;&lt;code&gt;M89&lt;/code&gt; (two-digit roads are more important than 3-digit roads,&#xA;even though 89 alphabetically comes after 823)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;A1262,A150&lt;/code&gt;&#xA;-&amp;gt; &lt;code&gt;A150&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;U6340,D6340&lt;/code&gt;&#xA;-&amp;gt; &lt;code&gt;D6340&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;M1,M2&lt;/code&gt; -&amp;gt; Either&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;B100,C99&lt;/code&gt; -&amp;gt; &lt;code&gt;B100&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="62289" LastEditorUserId="62289" LastEditDate="2020-08-07T08:07:09.817" LastActivityDate="2020-08-07T08:07:09.817" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="19189" PostTypeId="2" ParentId="2140" CreationDate="2020-08-04T23:17:41.187" Score="4" Body="&lt;h1&gt;Stroke Count of a Chinese Numeral &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/q/210107/81203&quot;&gt;Posted&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="81203" LastEditorUserId="81203" LastEditDate="2020-08-25T04:54:50.210" LastActivityDate="2020-08-25T04:54:50.210" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="19194" PostTypeId="2" ParentId="2140" CreationDate="2020-08-06T23:03:30.380" Score="12" Body="&lt;h1&gt;The Ever-Changing Labyrinth (Controller WIP)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/maze&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;maze&amp;#39;&quot; rel=&quot;tag&quot;&gt;maze&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://beefster09.github.io/everchanging-labyrinth/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Controller&lt;/a&gt; • &lt;a href=&quot;https://github.com/Beefster09/everchanging-labyrinth&quot; rel=&quot;nofollow noreferrer&quot;&gt;Source&lt;/a&gt; • &lt;a href=&quot;https://chat.stackexchange.com/rooms/124298/the-ever-changing-labyrinth-discussion&quot;&gt;Chat&lt;/a&gt; • Submit&lt;/h3&gt;&#xA;&lt;p&gt;This is a 2-player asymmetric KotH challenge.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;One player controls a pair of telepathically connected adventurers who are trying to get through a maze.&lt;/li&gt;&#xA;&lt;li&gt;The other player has the ability to change the maze and tries to keep the adventurers from solving it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Gameplay&lt;/h2&gt;&#xA;&lt;p&gt;The game is made up of a variable number of rounds, each consisting of up to 1000 turns.&lt;/p&gt;&#xA;&lt;p&gt;At the beginning of a round, the Maze Master creates an &lt;span class=&quot;math-container&quot;&gt;\$n \times n\$&lt;/span&gt; maze, starting at &lt;span class=&quot;math-container&quot;&gt;\$n = 3\$&lt;/span&gt;, and increasing by &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; on each subsequent round.&lt;/p&gt;&#xA;&lt;p&gt;Every cell of the maze must always be reachable from every other cell.&lt;/p&gt;&#xA;&lt;p&gt;Both adventurers begin on the northwest corner cell. The goal is on the southeast corner cell. One adventurer begins facing east and the other begins facing south.&lt;/p&gt;&#xA;&lt;p&gt;The game proceeds in a turn-based fashion, alternating between each player.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Adventurers:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Observe surroundings of themself and the other adventurer:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The wall directly ahead on the current cell is observed&lt;/li&gt;&#xA;&lt;li&gt;If there is no wall directly ahead on the current cell, every wall is observed along each cell ahead in a straight line until a wall obstructs the adventurer's sight&lt;/li&gt;&#xA;&lt;li&gt;The walls on the left and right of the current cell are observed&lt;/li&gt;&#xA;&lt;li&gt;If there is no wall to the left, the wall ahead on the cell to the left can be observed&lt;/li&gt;&#xA;&lt;li&gt;If there is no wall to the right, the wall ahead on the cell to the right can be observed&lt;/li&gt;&#xA;&lt;li&gt;The relative position of the other adventurer, if present on one of the cells they can see.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Either moves forward, changes orientation, or waits&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The maze master, in order:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Receives &lt;span class=&quot;math-container&quot;&gt;\$ 1 + \lfloor \log_n(t) \rfloor \$&lt;/span&gt; mana (where &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt; is the turn number, starting at 1), which can be used to modify the maze&lt;/li&gt;&#xA;&lt;li&gt;Observes the entire maze, including the position and orientation of each adventurer&lt;/li&gt;&#xA;&lt;li&gt;May remove a wall from anywhere in the maze that is not currently visible to either adventurer&lt;/li&gt;&#xA;&lt;li&gt;May add a wall to anywhere in the maze that is not currently visible to either adventurer, provided it does not separate the maze into two unconnected halves.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Illustration of how adventurers observe the maze:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/khUth.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/khUth.png&quot; alt=&quot;Adventurer vision 1&quot; /&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/y5wrG.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/y5wrG.png&quot; alt=&quot;Adventurer vision 2&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The adventurer in the above image is facing east and sees all the green cells and walls. The dotted green lines indicate non-walls the adventurer can see.&lt;/p&gt;&#xA;&lt;p&gt;Adventurers may occupy the same space and face different directions. Observation occurs before either of them chooses an action; movement is resolved simultaneously.&lt;/p&gt;&#xA;&lt;p&gt;The cost to modify the maze increases according to the fibonacci sequence. The first time a particular wall segment is added or removed, it costs 1 mana, the second time costs 1 mana, then 2, 3, 5, 8, 13, 21, 34, 55... Modification cost is independent for each edge of the grid where a wall segment can be placed, so it is more costly to toggle the same wall than it is to toggle different walls each time.&lt;/p&gt;&#xA;&lt;p&gt;The maze master can stockpile an arbitrarily large amount of mana, but can only change two walls per turn (removing one, then adding one)&lt;/p&gt;&#xA;&lt;p&gt;The round continues until either of the two adventurers reaches the goal cell, at which point, the game will continue onto the next round.&lt;/p&gt;&#xA;&lt;p&gt;If neither reaches the goal after 1000 turns, then the maze master wins and the game ends.&lt;/p&gt;&#xA;&lt;p&gt;The maze master does not carry over mana between rounds.&lt;/p&gt;&#xA;&lt;h2&gt;Coding&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Both players may retain as much information as they wish for the entire duration of the game. State may carry on from one round to the next.&lt;/li&gt;&#xA;&lt;li&gt;State and retained information will not be remembered between games.&lt;/li&gt;&#xA;&lt;li&gt;Players will not be able to access the state of the other player.&lt;/li&gt;&#xA;&lt;li&gt;Each player will receive an isolated RNG state at the beginning of each game. To ensure that all games have the same outcome with a given seed, all non-deterministic behavior &lt;em&gt;must&lt;/em&gt; use the provided RNG. (Math.random is overridden for each bot, just in case)&lt;/li&gt;&#xA;&lt;li&gt;Each bot is allotted 50ms of CPU time at the beginning of the round and 1ms for each turn. Exceeding this allotment will result in a strike.&lt;/li&gt;&#xA;&lt;li&gt;Maze generation has a time limit of &lt;span class=&quot;math-container&quot;&gt;\$n^2\$&lt;/span&gt; ms. (i.e. 9ms for the &lt;span class=&quot;math-container&quot;&gt;\$3 \times 3\$&lt;/span&gt; maze, 16ms for the &lt;span class=&quot;math-container&quot;&gt;\$4 \times 4\$&lt;/span&gt; maze, 25ms for &lt;span class=&quot;math-container&quot;&gt;\$5 \times 5\$&lt;/span&gt;, and so forth.)&lt;/li&gt;&#xA;&lt;li&gt;Adventurers are given 10ms to set up state between rounds. Exceeding this time limit results in a strike.&lt;/li&gt;&#xA;&lt;li&gt;Generating an illegal maze will result in a strike.&lt;/li&gt;&#xA;&lt;li&gt;If a wall added to the maze divides the maze into two unconnected halves, the maze master will receive a strike.&lt;/li&gt;&#xA;&lt;li&gt;If a wall to be added or removed is visible by either adventurer, the wall will not change but the mana will still be spent.&lt;/li&gt;&#xA;&lt;li&gt;If the maze master does not have enough mana to perform &lt;em&gt;both&lt;/em&gt; of its requested actions, its actions will be ignored.&lt;/li&gt;&#xA;&lt;li&gt;If the maze master specifies the same wall for both removing and adding, the actions will be ignored.&lt;/li&gt;&#xA;&lt;li&gt;If the maze master tries to remove a wall that is already missing or add a wall that is already present, the relevant action will be ignored.&lt;/li&gt;&#xA;&lt;li&gt;Illegal adventurer moves will be treated the same as a wait action.&lt;/li&gt;&#xA;&lt;li&gt;If a bot gets a strike, the game will be thrown out of the tournament as an outlier. If any particular bot gets 3 strikes during the tournament, it will be disqualified, and all the matches it was a part of will be discarded and ignored.&lt;/li&gt;&#xA;&lt;li&gt;Submissions may not attempt to exploit bugs in the controller in order to break other rules.&lt;/li&gt;&#xA;&lt;li&gt;Submissions must be compatible with being run inside web workers as well as being run in the foreground.&lt;/li&gt;&#xA;&lt;li&gt;Submissions may not call any asynchronous functions (usually I/O)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Adventurers Interface&lt;/h3&gt;&#xA;&lt;p&gt;Your submission must define the body of a function which receives a single argument (&lt;code&gt;random&lt;/code&gt;, a function that returns a pseudorandom number between 0 and 1) returns an object with the following interface:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;startRound(mazeSize: number)&#xA;takeTurn(vision: [Vision, Vision]) -&amp;gt; [number, number]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;takeTurn&lt;/code&gt; should return a pair of integers describing the action taken by each adventurer. Actions are defined as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;const ACTION = {&#xA;    WAIT: 0,&#xA;    FORWARD: 1,&#xA;    TURN_RIGHT: 2,&#xA;    TURN_AROUND: 3,&#xA;    TURN_LEFT: 4,&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Vision is defined as an object with this schema&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;    ahead: [&#xA;        {&#xA;            ahead: true | false,&#xA;            left: true | false,&#xA;            right: true | false,&#xA;        }&#xA;        ...&#xA;    ],&#xA;    leftAhead:  true | false | null,&#xA;    rightAhead: true | false | null,&#xA;    friend: [number, number] | null&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The zeroth element of the &lt;code&gt;ahead&lt;/code&gt; array represents the &lt;em&gt;current&lt;/em&gt; cell the adventurer is on, and each subsequent element represents the next cell ahead.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;null&lt;/code&gt; means that wall cannot be seen, so it is uncertain whether it is present or not.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;friend&lt;/code&gt; will be an ordered pair of numbers representing the number of cells ahead and the number of cells to the right (will be -1 when the other adventurer is to the left) that the other adventurer is relative to this one. If the other adventurer is not visible, &lt;code&gt;friend&lt;/code&gt; will be &lt;code&gt;null&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Maze Master Interface&lt;/h3&gt;&#xA;&lt;p&gt;Your submission must define the body of a function which receives a single argument (&lt;code&gt;random&lt;/code&gt;, a function that returns a pseudorandom number between 0 and 1) returns an object with the following interface:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;generateMaze(mazeSize: number) -&amp;gt; Maze&#xA;takeTurn(mana: number, maze: Maze) -&amp;gt; [WallCoord | null, WallCoord | null]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;generateMaze&lt;/code&gt; should return a row-major array of arrays of objects that describe the east and south walls of the cell. Each cell must have the following schema:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;    east: boolean | null // will be null along the east edge of the maze&#xA;    south: boolean | null // will be null along the south edge of the maze&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;takeTurn&lt;/code&gt; should return a pair of wall coordinates, describing the wall to remove and the wall to add. Both coordinates are optional and may be null or undefined. Wall coordinates should be an array of the row, column, and &lt;code&gt;'south'&lt;/code&gt; or &lt;code&gt;'east'&lt;/code&gt; representing the location of the wall. The schema is as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[number, number, 'south'|'east']&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The maze provided to &lt;code&gt;takeTurn&lt;/code&gt; is similar to the maze expected to be returned by &lt;code&gt;generateMaze&lt;/code&gt;, but with two additional properties on each cell to define the mana cost to update:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;    eastCost: number&#xA;    southCost: number&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Submission Format&lt;/h2&gt;&#xA;&lt;p&gt;In order to aid answer scraping, please format your submissions in the following format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;# &amp;lt;submission type&amp;gt;: &amp;lt;name&amp;gt;&#xA;&#xA;Optional blurb&#xA;&#xA;    // relevant functions, constants, variables go here&#xA;&#xA;    return /* the object */&#xA;&#xA;Description/explanation of how the bot works + whatever you want&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;lt;submission type&amp;gt;&lt;/code&gt; must be the exact string of either &lt;code&gt;Adventurers&lt;/code&gt; or &lt;code&gt;Maze Master&lt;/code&gt; which corresponds to your submission type&lt;/p&gt;&#xA;&lt;p&gt;Only the first code block of your post will be scraped. Submissions will be loaded as if they are the body of a function, which is executed once with no arguments. Submission names should be different from any other submissions.&lt;/p&gt;&#xA;&lt;p&gt;You may submit both an adventurer bot and a maze master bot, each in its own post. You may also submit multiple bots of the same type as long as they are reasonably different from each other. Please don't hog the leaderboard with near-identical bots.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring and The Tournament&lt;/h2&gt;&#xA;&lt;p&gt;Adventurers compete only with other adventurers, and the same goes for maze masters.&lt;/p&gt;&#xA;&lt;p&gt;The overall score for a game for both roles is 1000 points per maze completed by the adventurers minus the number of turns taken in total. Score can go negative.&lt;/p&gt;&#xA;&lt;p&gt;Each adventurer bot will play against each opposing maze master bot an equal number of times until the ranking of the top 5 bots for each role are established with 95% confidence. The overall tournament score for a given bot is averaged across all games that bot played in the tournament.&lt;/p&gt;&#xA;&lt;p&gt;The adventurer bot with the highest score wins.&lt;/p&gt;&#xA;&lt;p&gt;The maze master bot with the lowest score wins.&lt;/p&gt;&#xA;&lt;p&gt;Scores will be updated when a adventurer or maze master is added or updated.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/maze&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;maze&amp;#39;&quot; rel=&quot;tag&quot;&gt;maze&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Pull requests welcome on the controller. Vanilla JS only (Current ES standard is fine), preferably, though jQuery is probably ok. It needs to work on GitHub pages in Firefox and Chrome without needing babel or webpack or similar.&lt;/p&gt;&#xA;&lt;p&gt;Parts still in need of implementation:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Fix bugs in Maze Master modification handling (there are certain cases where visibility is not respected properly)&lt;/li&gt;&#xA;&lt;li&gt;Code scraper&lt;/li&gt;&#xA;&lt;li&gt;Tournament controller&lt;/li&gt;&#xA;&lt;li&gt;Better syntax error reporting for bots&lt;/li&gt;&#xA;&lt;li&gt;Foreground error reporting for bots (instead of tucking it away in dev tools)&lt;/li&gt;&#xA;&lt;li&gt;(nice-to-have, preferably before posting to main) improved renderer that shows visible cells and walls and the effects of the last move (or better yet, changes since last render).&lt;/li&gt;&#xA;&lt;li&gt;(nice-to-have, can wait until after posting to main) background game runner that runs in a web worker and can be controlled by the tournament controller&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I recommend checking in via the chat room to avoid duplicating work.&lt;/p&gt;&#xA;&lt;p&gt;Beta bot submissions also welcome, though I'm not sure how these are going to be integrated at the moment.&lt;/p&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2021-05-25T19:05:06.633" LastActivityDate="2021-05-25T19:05:06.633" CommentCount="34" ContentLicense="CC BY-SA 4.0" />
  <row Id="19196" PostTypeId="2" ParentId="2140" CreationDate="2020-08-07T02:05:40.773" Score="0" Body="&lt;p&gt;Write an ASPIF (clasp's ASP input format) program to find a maximum cap set (&lt;a href=&quot;https://en.wikipedia.org/wiki/Cap_set&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://en.wikipedia.org/wiki/Cap_set&lt;/a&gt;) for 4 dimensions.&lt;/p&gt;&#xA;&lt;p&gt;Share the code you used to generate the ASPIF rather than ASPIF itself. This may be an ASP program.&lt;/p&gt;&#xA;&lt;p&gt;Winner is smallest word-count (according to wc) in ASPIF format. For ASP, you can get this by running something like:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;clingo capset.asp --mode=gringo | grep -v &amp;quot;\(^1 0 1 [0-9]\+ 0 0$\)\|\(^4\)&amp;quot; | wc -w&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(note the grep is for excluding unary rules and #show directives neither of which are necessary for solving. The output of this is still a valid clasp program)&lt;/p&gt;&#xA;&lt;p&gt;I have an example for four dimensions (but I have a better one I won't share right away because I'm curious to see what other people get).&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;feature(number, (one; two; three)).&#xA;feature(shading, (solid; empty; striped)).&#xA;feature(color, (red; green; purple)).&#xA;feature(shape, (oval; diamond; squiggly)).&#xA;dimension(D) :- feature(D, _).&#xA;card(c(N,F,C,S)) :-&#xA;    feature(number,N); feature(shading,F); feature(color,C); feature(shape,S).&#xA;property(c(N,F,C,S),number,N) :- card(c(N,F,C,S)).&#xA;property(c(N,F,C,S),shading,F) :- card(c(N,F,C,S)).&#xA;property(c(N,F,C,S),color,C) :- card(c(N,F,C,S)).&#xA;property(c(N,F,C,S),shape,S) :- card(c(N,F,C,S)).&#xA;&#xA;{in_capset(X) : card(X)}.&#xA;:~ in_capset(X).[-1,X]&#xA;&#xA;settable(D, A, B, C) :-&#xA;    feature(D, A); feature(D, B); feature(D, C); A != B; A != C; B != C.&#xA;settable(D, A, A, A) :- feature(D, A).&#xA;&#xA;:- in_capset(X); in_capset(Y); in_capset(Z);&#xA;    settable(D, A, B, C) :&#xA;        dimension(D), property(X, D, A), property(Y, D, B), property(Z, D, C);&#xA;    X &amp;lt; Y; Y &amp;lt; Z.&#xA;&#xA;#show in_capset/1.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This grounds to an ASPIF program with 9296 &amp;quot;words&amp;quot;&lt;/p&gt;&#xA;" OwnerUserId="4754" LastEditorUserId="4754" LastEditDate="2020-08-07T02:21:13.817" LastActivityDate="2020-08-07T02:21:13.817" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19198" PostTypeId="1" CreationDate="2020-08-08T15:09:33.197" Score="5" ViewCount="150" Body="&lt;p&gt;Just recently I posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/209243/rock-paper-scissors-meta-gaming-tournament&quot;&gt;this&lt;/a&gt; king-of-the-hill question. It was a rock paper scissors contest, but opponents had access to each other's source codes. It wasn't very well received - it had some downvotes and will likely soon be closed. I would like to know why it was't well recieved, to keep note of for future posts. Here are some reasons that I could think of:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The submissions were limited to javascript only, which puts limitations on how people can submit&lt;/li&gt;&#xA;&lt;li&gt;Related questions had been asked before, like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35079/the-rock-paper-scissors-lizard-spock-tournament-of-epicness&quot;&gt;this one&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/173065/prisoners-dilemma-with-access-to-opponent&quot;&gt;this one&lt;/a&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;However, there were differences between my question and the ones that were brought up as related. One was a simple rock paper scissors competition, but it didn't have any things like access to other people's codes&lt;/li&gt;&#xA;&lt;li&gt;The other one was a similar premise, but for a different game (prisoner's dilemma)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Flawed premise - if I were to guess this would be the main reason&#xA;&lt;ul&gt;&#xA;&lt;li&gt;eval() calls were banned to prevent an infinite loop of code calling each other&lt;/li&gt;&#xA;&lt;li&gt;This possibly led to a less interesting challenge&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Personally I find king-of-the-hill competitions a pretty interesting concept - being able to interact with other peoples code looks like it would add more depth to a challenge&lt;/p&gt;&#xA;" OwnerUserId="73066" LastActivityDate="2020-08-08T15:09:33.197" Title="How can I improve my post?" Tags="|discussion|" AnswerCount="0" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="19199" PostTypeId="2" ParentId="2140" CreationDate="2020-08-09T04:23:21.520" Score="1" Body="&lt;h1&gt;LaTeX Fractions&lt;/h1&gt;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://tex.stackexchange.com/questions/557846/interpret-a-bc-as-fracabc&quot;&gt;a TeX SE question&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;LaTeX uses &lt;code&gt;\frac{a}{b}&lt;/code&gt; to represent &lt;code&gt;a/b&lt;/code&gt;, which is very unintuitive. Now you have a piece of paper (as in &amp;quot;research paper&amp;quot;) which happens to use the &lt;code&gt;a/b&lt;/code&gt; format, and your task is to convert it to the LaTeX format.&lt;/p&gt;&#xA;&lt;p&gt;[to be continued]&lt;/p&gt;&#xA;" OwnerUserId="87986" LastActivityDate="2020-08-09T04:23:21.520" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19201" PostTypeId="2" ParentId="2140" CreationDate="2020-08-10T13:10:53.033" Score="2" Body="&lt;h1&gt;Simulate simple Bloons Tower Defense!&lt;/h1&gt;&#xA;&lt;p&gt;For those who are unaware of this legendary series of video games, &lt;a href=&quot;https://en.wikipedia.org/wiki/Bloons_Tower_Defense&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; is a link.&lt;/p&gt;&#xA;&lt;h2&gt;The task&lt;/h2&gt;&#xA;&lt;p&gt;You are going to be given an integer number and type of bloon wave and two integers describing the damage and pierce (max amount of bloons you can damage in one attack) of each attack. Your task is to output in how many attacks can you destroy the bloon wave.&lt;/p&gt;&#xA;&lt;h2&gt;Bloon types&lt;/h2&gt;&#xA;&lt;p&gt;For simplicity, there will be no special properties like &lt;code&gt;fortified&lt;/code&gt;, &lt;code&gt;regrow&lt;/code&gt;, &lt;code&gt;camo&lt;/code&gt; e.t.c. White bloons will also not be present as, without special properties, they are the same as black bloons&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Name - health - what it pops into&#xA;BAD   - 20000 - 3x DDT and 2x ZOMG&#xA;ZOMG - 4000  - 4x BFB&#xA;BFB   - 700   - 4x MOAB&#xA;MOAB - 200   - 4x Ceramic&#xA;DDT   - 350   - 6x Ceramic&#xA;Ceramic - 60    - 1x Rainbow&#xA;Rainbow - 1     - 2x Zebra&#xA;Zebra   - 1     - 2x Black&#xA;Black   - 1     - 2x Pink&#xA;Pink    - 1     - 1x Yellow&#xA;Yellow  - 1     - 1x Green&#xA;Green   - 1     - 1x Blue&#xA;Blue    - 1     - 1x Red&#xA;Red     - 1     - Nothing!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;I/O&lt;/h2&gt;&#xA;&lt;p&gt;Input: A string describing the type of bloon, and three integers: the amount of bloons in the wave, attack damage and attack pierce&lt;/p&gt;&#xA;&lt;p&gt;Output: An integer describing how many attacks are needed for destroying the whole wave.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;Note: If there is not enough pierce &lt;code&gt;n&lt;/code&gt; to attack the whole wave, then only the first &lt;code&gt;n&lt;/code&gt; bloons are attacked&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input: Rainbow 3 2 10&#xA;Starting: 3x Rainbow&#xA;Attack 1: 12x Black&#xA;2: 20x Yellow 2x Black&#xA;3: 10x Blue 10x Yellow 2x Black&#xA;4: 10x Yellow 2x Black&#xA;5: 10x Blue 2x Black&#xA;6: 2x Black&#xA;7: 4x Yellow&#xA;8: 4x Blue&#xA;9: Done!&#xA;Output: 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is the 4/0/x Sniper Monkey:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input: BFB 1 30 1&#xA;1: BFB(670)&#xA;2: BFB(640)&#xA;...&#xA;13: BFB(10)&#xA;14: 4x MOAB(180)&#xA;15: 1x MOAB(150) 3x MOAB(180)&#xA;...&#xA;19: 1x MOAB(30) 3x MOAB(180)&#xA;20: 4x Ceramic(60) 3x MOAB(180)&#xA;21: 1x Ceramic(30) 3x Ceramic(60) 3x MOAB(180)&#xA;22: 3x Ceramic(60) 3x MOAB(180)&#xA;...&#xA;27: 1x Ceramic(30) 3x MOAB(180)&#xA;28: 3x MOAB(180)&#xA;...&#xA;69: 1x Ceramic(30)&#xA;70: Done!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is codegolf, so lowest byte-count wins&lt;/p&gt;&#xA;" OwnerUserId="92080" LastActivityDate="2020-08-10T13:10:53.033" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="19202" PostTypeId="1" CreationDate="2020-08-11T16:19:14.343" Score="15" ViewCount="907" Body="&lt;p&gt;Challenges tagged as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; involve &amp;quot;deciding whether the input meets certain criteria&amp;quot;. Although some challenges with this tag involve &lt;em&gt;more than two&lt;/em&gt; categories, most involve &lt;em&gt;only two categories&lt;/em&gt;, which seems to be the main purpose of the tag. This meta question refers to &lt;strong&gt;two-category&lt;/strong&gt; decision problems only. The challenge is then equivalent to a question, such as &amp;quot;is the input number even?&amp;quot;, and any possible input can be classified as &amp;quot;affirmative&amp;quot; if the answer is &amp;quot;yes&amp;quot;, and &amp;quot;negative&amp;quot; if the answer is &amp;quot;no&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;The purpose of this meta question is to decide a &lt;strong&gt;policy&lt;/strong&gt; for the &lt;strong&gt;default&lt;/strong&gt; options for &lt;strong&gt;output&lt;/strong&gt; in two-category decision-problems. Having a default policy would be good, so that challenge writers don't need to state what is allowed as an output in every challenge. This &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12305/what-outputs-should-i-allow-for-decision-problems&quot;&gt;related meta question&lt;/a&gt; asks what are some good options for challenge writers to use. Of course, answers to that meta question may be good answers for this one, but choosing the &lt;em&gt;default&lt;/em&gt; options is a different matter, which deserves to be voted on separately.&lt;/p&gt;&#xA;&lt;p&gt;Here are some possibilities regarding allowed outputs. This list is not meant to be exhaustive:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&amp;quot;Consistent / consistent&amp;quot;: Produce a consistent output (a number, a string, anything) for affirmative inputs, and a different, consistent output (again, it can be anything) for negative inputs. There are only two possible outputs.&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Consistent / non-consistent&amp;quot;: Produce a consistent output for affirmative inputs, and any other, non-consistent output for negative inputs. &amp;quot;Non-consistent&amp;quot; here means that each negative input can produce a different output.&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Non-consistent truthy / non-consistent falsy&amp;quot;: produce a non-consistent truthy output if the input is affirmative, and a non-consistent falsy output if it is negative. Each input produces a possibly different output.&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Consistent truthy / consistent falsy&amp;quot;: like 1, but in addition the consistent output for affirmative input must be truthy, and the consistent output for negative input must be falsy.&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Non-consistent falsy / non-consistent truthy&amp;quot;: like 3, but swapped. So an affirmative input produces any falsy output, and a negative input produces any truthy output.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Please post or vote answers to this meta question indicating which options should be the default for decision problems. Note that&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It probably makes sense to allow &lt;strong&gt;more than one&lt;/strong&gt; options as default. For example, a proposed default rule might be to let answer writers choose between options 1 and 3 above. For clarity, each answer to this meta question should be self-contained, and state &lt;strong&gt;all&lt;/strong&gt; the possibilities that are proposed as default policy.&lt;/li&gt;&#xA;&lt;li&gt;The default rules would only apply if the challenge doesn't specify otherwise. Of course, any challenge writer can &lt;em&gt;override&lt;/em&gt; the default rules.&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Truthy&amp;quot; and &amp;quot;falsy&amp;quot; are defined &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2194/36398&quot;&gt;as usual&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;This meta question doesn't address output &lt;em&gt;formats&lt;/em&gt;, whose general &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/36398&quot;&gt;default rules&lt;/a&gt; are well established.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2022-03-01T13:16:44.873" LastActivityDate="2023-01-10T10:19:18.970" Title="Default policy for output in decision problems" Tags="|discussion|policy|rules|defaults|" AnswerCount="7" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19203" PostTypeId="2" ParentId="19202" CreationDate="2020-08-11T16:19:53.930" Score="4" Body="&lt;h2&gt;&amp;quot;Consistent / consistent&amp;quot; or &amp;quot;non-consistent truthy / non-consistent falsy&amp;quot;&lt;/h2&gt;&#xA;&lt;p&gt;By default, the answer writer can choose any of these (options 1 and 3 described in the question):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Produce two consistent outputs for affirmative and negative inputs respectively; or&lt;/li&gt;&#xA;&lt;li&gt;Produce a possibly non-consistent truthy output if the input is affirmative, and a possibly non-consistent falsy output if it is negative.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2020-08-18T11:24:52.423" LastActivityDate="2020-08-18T11:24:52.423" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19205" PostTypeId="2" ParentId="19202" CreationDate="2020-08-11T23:22:14.800" Score="21" Body="&lt;h2&gt;Truthy/falsy using your language's convention (swapping allowed), or two distinct values to represent true/false respectively&lt;/h2&gt;&#xA;&lt;p&gt;You can choose to&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;output truthy/falsy using your language's convention (swapping is allowed), or&lt;/li&gt;&#xA;&lt;li&gt;use two distinct, fixed values to represent true (affirmative) or false (negative) respectively.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Copy-friendly version:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;For output, you can choose to&#xA;* output truthy/falsy using your language's convention (swapping is allowed), or&#xA;* use two distinct, fixed values to represent true (affirmative) or false (negative) respectively.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This one is what I regularly use on my own challenges. It has some slightly different wording from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/19203/78410&quot;&gt;Luis Mendo's suggestion&lt;/a&gt;. I had some criticisms on the output &amp;quot;restriction&amp;quot; when I disallowed swapping truthy/falsy for case 1, but didn't face any when I allowed it.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-08-17T06:51:50.627" LastActivityDate="2021-08-17T06:51:50.627" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19206" PostTypeId="2" ParentId="19202" CreationDate="2020-08-12T00:22:35.690" Score="4" Body="&lt;h1&gt;No default&lt;/h1&gt;&#xA;&lt;p&gt;Keep it so that challenge writers need to specify.&lt;/p&gt;&#xA;&lt;p&gt;I don't think any option has become standard enough to be default -- &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12305/20260&quot;&gt;my meta question&lt;/a&gt; has multiple well-upvoted suggestions, and recent challenges have used various rules. Given this, a default would strike me as a hidden rule, with it being confusing for a challenge to not say and expect solvers to know from this meta post or the like.&lt;/p&gt;&#xA;&lt;p&gt;I'm for standardizing defaults in general, but I think we're not at that point for decision problem output.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2020-08-12T00:39:29.670" LastActivityDate="2020-08-12T00:39:29.670" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19208" PostTypeId="1" AcceptedAnswerId="19220" CreationDate="2020-08-13T00:56:50.437" Score="17" ViewCount="445" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/q/607/78410&quot;&gt;Factorial challenge&lt;/a&gt; is one of the canonical challenges on our site. Just like &amp;quot;Hello World&amp;quot;, &amp;quot;Add two numbers&amp;quot;, &amp;quot;Primality test&amp;quot;, and &amp;quot;Fibonacci&amp;quot;, it attracts answers written in newly created languages every now and then. But still, it has a set of old-fashioned requirements on the domain, performance, and banning built-ins:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Does not use any built-in libraries that can calculate the factorial (this includes any form of eval)&lt;/li&gt;&#xA;&lt;li&gt;Can calculate factorials for numbers up to 125&lt;/li&gt;&#xA;&lt;li&gt;Can calculate the factorial for the number 0 (equal to 1)&lt;/li&gt;&#xA;&lt;li&gt;Completes in under a minute for numbers up to 125&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The third point is perfectly valid requirement because it is part of the definition of factorial, but other three have problems.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;125!&lt;/code&gt; is a 210-digit integer, which cannot be accurately represented in machine precision (neither int64 nor float64), so it obviously requires infinite-precision integers (either built-in or rolling one's own), which unnecessarily penalizes the languages without built-in support. Some of the pre-existing answers may already fail this requirement.&lt;/p&gt;&#xA;&lt;p&gt;The performance requirement is even worse. It entirely bans the Turing tarpits where the only operation on a number is increment, since it would need to run the increment command at least &lt;code&gt;125!&lt;/code&gt; times to get the answer no matter what. If you insist to implement multi-digit system to enhance the performance, it doesn't solve the problem; it just changes the problem to the one in the previous paragraph.&lt;/p&gt;&#xA;&lt;p&gt;Note that many existing answers already violate some of the rules, mostly by using machine-size int/float number type or by using Brainfuck and ignoring performance.&lt;/p&gt;&#xA;&lt;p&gt;I believe that, under the current site culture, we consider a solution valid if&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;it solves the task at least theoretically in finite time, given enough time and memory;&lt;/li&gt;&#xA;&lt;li&gt;if it uses limited precision built-in number type, the solution would work for higher numbers if the number type were infinite-precision.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And I think, if we agree that it &lt;em&gt;is&lt;/em&gt; one of the canonical challenges, we should encourage participation in more languages by lifting the restrictions.&lt;/p&gt;&#xA;&lt;p&gt;So the question is (as in the title): &lt;strong&gt;Should we remove unnecessary restrictions on the factorial challenge?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="66833" LastEditDate="2021-09-02T08:56:00.500" LastActivityDate="2021-09-02T08:56:00.500" Title="Should we remove unnecessary restrictions on the factorial challenge?" Tags="|discussion|specific-question|reposting|" AnswerCount="3" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="19209" PostTypeId="2" ParentId="19208" CreationDate="2020-08-13T08:11:22.937" Score="-1" Body="&lt;h1&gt;Yes, we should.&lt;/h1&gt;&#xA;&lt;p&gt;Just like closing old challenges as duplicates of new challenges.&lt;/p&gt;&#xA;" OwnerUserId="87986" LastActivityDate="2020-08-13T08:11:22.937" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19210" PostTypeId="2" ParentId="19208" CreationDate="2020-08-13T09:32:34.523" Score="4" Body="&lt;h1&gt;No, we shouldn't&lt;/h1&gt;&#xA;&lt;p&gt;Unless the original OP, &lt;a href=&quot;https://codegolf.stackexchange.com/users/148/kevin-brown&quot;&gt;Kevin Brown&lt;/a&gt; agrees that we should, I believe we shouldn't change the challenge. If any existing answers to the challenge are invalid, then raise that point with the answerers, and if unaddressed, flag the answers as invalid.&lt;/p&gt;&#xA;&lt;p&gt;If a language cannot answer a challenge as it's currently written, then &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17128/what-should-we-do-when-a-language-cannot-answer-a-given-challenge&quot;&gt;it cannot answer that challenge&lt;/a&gt;. Not every language can comply and compete in every challenge. The requirements of the question do make it harder to compete in than, for example, &amp;quot;Add two numbers&amp;quot;, but that doesn't mean we should edit it in order to &amp;quot;make it easier&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, I disagree with the idea of a &amp;quot;canonical&amp;quot; challenge. Challenges like &amp;quot;Hello, World!&amp;quot; and &amp;quot;Primality test&amp;quot; were specifically drafted to be catalogue questions, open to as many languages as possible. However, as a general rule, we &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7686/66833&quot;&gt;have abandoned catalogue questions&lt;/a&gt;, so, in my view, there is no need to edit an existing challenge to make it more of a catalogue-style question.&lt;/p&gt;&#xA;&lt;p&gt;Ultimately, we shouldn't make a challenge easier, just so more people can compete. It's been an oversight for the past 10 years that none of the invalid answers have been corrected/removed, but that's what we should be correcting, not the (perfectly valid) question spec.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2020-08-13T09:32:34.523" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="19211" PostTypeId="1" CreationDate="2020-08-13T13:47:39.647" Score="8" ViewCount="269" Body="&lt;p&gt;I'm currently working on my own golfing language which is based on Python 3. Once this language is finished, what would be the best way to let other people use it? I know TIO is very widespread here, and that some users' languages are on TIO - is there a way to get my language on TIO as well (and, if so, would there be an easy way to maintain my language if I wanted to add an update)?&lt;/p&gt;&#xA;&lt;p&gt;As it stands right now, this language is far from complete (and doesn't actually have a name yet, so I'm open to suggestions). This language will get its code through a single &lt;code&gt;parse(String)&lt;/code&gt; method, where &lt;code&gt;String&lt;/code&gt; is the code itself.&lt;/p&gt;&#xA;" OwnerUserId="95671" LastActivityDate="2020-08-20T06:18:15.693" Title="How do I let others use my custom golfing language?" Tags="|discussion|" AnswerCount="4" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19212" PostTypeId="2" ParentId="19211" CreationDate="2020-08-13T16:02:14.753" Score="8" Body="&lt;p&gt;Try It Online! is maintained by a PPCG user, &lt;a href=&quot;https://codegolf.stackexchange.com/users/12012/dennis&quot;&gt;Dennis&lt;/a&gt;, and has a &lt;a href=&quot;https://chat.stackexchange.com/rooms/44255/talk-tryitonline-net&quot;&gt;chatroom&lt;/a&gt; for discussion around it. This is the most common way to request a language be added and maintained (other ways are listed on &lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO's home page&lt;/a&gt;). However, at time of writing, Dennis is currently inactive (reasons can be found starred in &lt;a href=&quot;https://chat.stackexchange.com/rooms/44255/talk-tryitonline-net&quot;&gt;talk.tryitonline.net&lt;/a&gt;), so while you can (and should) request your language to be added, I wouldn't expect it to happen soon.&lt;/p&gt;&#xA;&lt;p&gt;Aside from TIO, you should take a look at &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14927/tips-for-launching-a-language&quot;&gt;this&lt;/a&gt; page, which asks similar questions about how to popularise your language. The most common method is to make the code publicly available (e.g. Github) and start answering in the language.&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, don't hesitate to swing by &lt;a href=&quot;https://chat.stackexchange.com/rooms/110136/the-tarpit&quot;&gt;The Tarpit&lt;/a&gt;, a chatroom for creating languages.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2020-08-13T16:02:14.753" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19213" PostTypeId="2" ParentId="19211" CreationDate="2020-08-14T04:35:42.377" Score="6" Body="&lt;h1&gt;Create answers written in your language&lt;/h1&gt;&#xA;&lt;p&gt;The best way to advertise a language is to answer challenges with your language! People will eventually discover your language and start using it too. This demonstrates why is your language good and why should people use it.&lt;/p&gt;&#xA;&lt;p&gt;Make friends with active users here by chatting in The Nineteenth Byte (&lt;em&gt;don't create your own chatroom&lt;/em&gt;. That's what you'll do when your language gets at least a little bit popular. Discussion in TNB is much more likely to be noticed than discussion in a custom chatroom.) and let them use your language. Have one or two stable users other than you.&lt;/p&gt;&#xA;" OwnerUserId="87986" LastEditorUserId="66833" LastEditDate="2020-08-14T07:30:21.390" LastActivityDate="2020-08-14T07:30:21.390" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19215" PostTypeId="2" ParentId="2140" CreationDate="2020-08-14T12:55:41.597" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/209669/66833&quot;&gt;Build an alphabetised polyglot&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2020-08-17T18:16:29.437" LastActivityDate="2020-08-17T18:16:29.437" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19216" PostTypeId="2" ParentId="2140" CreationDate="2020-08-14T14:49:43.123" Score="0" Body="&lt;h1&gt;[PuyoPuyo] How long is my combo?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Context:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;PuyoPuyo is a puzzle game where you and your opponent pile up colored slimes (called &lt;em&gt;puyo&lt;/em&gt;) in a vertical (13*6 cells) grid. A &lt;em&gt;puyo&lt;/em&gt; is one-cell big, but they come as pairs in the screen. &lt;em&gt;Puyo&lt;/em&gt; pairs fall from the top to the bottom of the grid, and you can move and rotate them the Tetris way. The list of possible &lt;em&gt;puyo&lt;/em&gt; pairs is the cartesian product of {'red','blue','green','yellow'} with itself. The pair sequence for a game is randomly generated for both players at the start of a round, and will be the same for both of them.&lt;/p&gt;&#xA;&lt;p&gt;If four &lt;em&gt;puyo&lt;/em&gt; (or more) of the same color are next to each other (in line, in square, Z-, S-, T-, J- or L-shaped), they disappear, awarding you points and making all the above &lt;em&gt;puyo&lt;/em&gt; to fall. If when those &lt;em&gt;puyo&lt;/em&gt; fall, they make another group of four (or more) they will disappear too, awarding you with more points than the first group: it is called a &lt;strong&gt;two-hit combo&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;When a combo stops, whatever its length (1-hit or more), you will send damage to your opponent. The bigger the combo, the more damage is sent. Those damage are called &lt;em&gt;ojama puyo&lt;/em&gt;, grey slimes that disappear only when a group disappears next to it. If your third column from the left is filled before your opponent's is, you lose. So to kill your opponent, you must manage to fill its screen before they fill yours.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;With a given sequence of &lt;em&gt;puyo&lt;/em&gt; pairs associated with their drop locations, output the length of the combo that has been made by this player. Shortest code in any language wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;List of puyo pairs and their drop locations:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;'r1b1r1r2y2r3...'&lt;/li&gt;&#xA;&lt;li&gt;'001000013102...'&lt;/li&gt;&#xA;&lt;li&gt;[('red','1','blue','1'),('red','1','red','2'),('yellow','2','red','3'),...]&lt;/li&gt;&#xA;&lt;li&gt;any sensible way you want, provided you detail how it works&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Details:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This list will never contain any &amp;quot;column number&amp;quot; outside of [1;6] (or [0;5], if 0-indexed) nor a &lt;em&gt;puyo&lt;/em&gt; of a color outside of {'red','blue','green','yellow'} (or any set used for your interpretation).&lt;/li&gt;&#xA;&lt;li&gt;This list will always contain at most one combo sequence.&lt;/li&gt;&#xA;&lt;li&gt;This list will never contain unusable data, like two colors in a row, or two column indices in a row.&lt;/li&gt;&#xA;&lt;li&gt;If both &lt;em&gt;puyo&lt;/em&gt; of a pair are dropped on the same column, the first one to come is on the top of the pair (in the example #1, red is dropped on the top of the blue on the column 1).&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Puyo&lt;/em&gt; will never remain floating in the grid, but will fall to the lowest available cell of the column they are in, even if the paired &lt;em&gt;puyo&lt;/em&gt; has stopped in its column (tl;dr &lt;em&gt;puyo&lt;/em&gt; pairs split).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A single integer indicating the length of the combo.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test cases:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Test case #1&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input&#xA;y1r1&#xA;&#xA;Output&#xA;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Test case #2&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input&#xA;r1r2g3r3g3g2g1r2&#xA;&#xA;Output&#xA;2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Test case #3&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input&#xA;y1r1r2r3g2g3r2g3y2y3g3g3y1y1&#xA;&#xA;Output&#xA;3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Test case #4&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input&#xA;b1b1r2b2g3g3r2r3y4y5b6b6b5y5g4b5y4g3b6b6&#xA;&#xA;Output&#xA;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Test case #5&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input&#xA;y1b2b3b3b5b5y6b6b4b4&#xA;&#xA;Output&#xA;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Test case #6&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input&#xA;y1r1r2r3g2g3r2g3y2y3g3g3y1y1&#xA;&#xA;Output&#xA;3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;a href=&quot;https://puyonexus.com/chainsim/chain/xccVX&quot; rel=&quot;nofollow noreferrer&quot;&gt;Test case #7 (click me!)&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input&#xA;b1b2g3r4g5y6y1y2b3g4r5g6y1b2g3r4g5y6r1r2g3r4r5y6r1b2b3y4r5y6b1y2y3r4r5g6r1b2r3y4g5g6y1g2r3b4b5b6b1g2g3r4r5g6b1b2r3y4b5r6g1y2b2y3y4g4g5g6g5g6&#xA;&#xA;Output&#xA;17&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;a href=&quot;https://puyonexus.com/chainsim/chain/WN5SF&quot; rel=&quot;nofollow noreferrer&quot;&gt;Test case #8 (click me!)&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input&#xA;r1r2r5r6g1r2r5g6g1y2y5g6g1y2y5g6y1g2g5y6y1b2b5y6r1b2b5r6b1r2r5b6b1y2y5b6b1y2y5b6y1r2r5y6y1r2r5y6r3r4&#xA;&#xA;Output&#xA;4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard Loopholes apply&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;NB: for purists, I know that the 13th row is supposed to be invisible and that&lt;/em&gt; puyo &lt;em&gt;that are in that column are not considered 'linked' to nearby&lt;/em&gt; puyo, &lt;em&gt;but I figured this challenge was hard enough as-is.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;@Sandbox please comment! I'd love to hear your thoughts about such a challenge.&lt;/strong&gt; I will finish setting it up soon, adding some extra resources about the game (like &lt;a href=&quot;https://puyonexus.com/chainsim/&quot; rel=&quot;nofollow noreferrer&quot;&gt;this one&lt;/a&gt;). Questions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should I reverse the &amp;quot;top / bottom&amp;quot; &lt;em&gt;puyo&lt;/em&gt; of a pair rule? The way it is now, it forces to parse input as pairs. If it is reversed, golfers can take puyo one by one and sort it all by columns, making the challenge easier.&lt;/li&gt;&#xA;&lt;li&gt;What tags should it enter with? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-colf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-colf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-colf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;I will make other test cases soon enough, but should I include a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt; as a file (via pastebin)?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="71499" LastEditorUserId="71499" LastEditDate="2020-08-19T11:58:02.487" LastActivityDate="2020-08-19T11:58:02.487" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19218" PostTypeId="2" ParentId="2140" CreationDate="2020-08-15T00:57:41.977" Score="-1" Body="&lt;h1&gt;Rage Against the Dying of the Light&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;&amp;quot;Do not go gentle into that good night&amp;quot; is the title of a poem by 20th century English poet &lt;a href=&quot;https://en.wikipedia.org/wiki/Dylan_Thomas&quot; rel=&quot;nofollow noreferrer&quot;&gt;Dylan Thomas.&lt;/a&gt; If you've heard it before it was probably because you watched &lt;a href=&quot;https://en.wikipedia.org/wiki/Interstellar_(film)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Interstellar&lt;/a&gt;, where it was quoted multiple times.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Your program (or function), if it chooses to not go gently, should take no input and print the following text, with an optional trailing newline:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Do not go gentle into that good night,&#xA;Old age should burn and rave at close of day;&#xA;Rage, rage against the dying of the light.&#xA;&#xA;Though wise men at their end know dark is right,&#xA;Because their words had forked no lightning they&#xA;Do not go gentle into that good night.&#xA;&#xA;Good men, the last wave by, crying how bright&#xA;Their frail deeds might have danced in a green bay,&#xA;Rage, rage against the dying of the light.&#xA;&#xA;Wild men who caught and sang the sun in flight,&#xA;And learn, too late, they grieved it on its way,&#xA;Do not go gentle into that good night.&#xA;&#xA;Grave men, near death, who see with blinding sight&#xA;Blind eyes could blaze like meteors and be gay,&#xA;Rage, rage against the dying of the light.&#xA;&#xA;And you, my father, there on the sad height,&#xA;Curse, bless, me now with your fierce tears, I pray.&#xA;Do not go gentle into that good night.&#xA;Rage, rage against the dying of the light.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-colf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-colf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-colf&lt;/a&gt;, so smallest code in bytes wins.&lt;/p&gt;&#xA;&lt;h1&gt;Sanbox&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this too bland/simple of a challenge? There's a lot of potential for compressing the poem, but it's not really complex.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="95207" LastEditorUserId="95207" LastEditDate="2020-08-16T01:52:03.993" LastActivityDate="2020-08-16T01:52:03.993" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19220" PostTypeId="2" ParentId="19208" CreationDate="2020-08-15T23:49:34.763" Score="14" Body="&lt;h1&gt;No, we shouldn't, but...&lt;/h1&gt;&#xA;&lt;p&gt;I agree with the idea that we should not change a challenge unless the original OP wants to, especially when changing these rules might make older answers non-competitive.&lt;/p&gt;&#xA;&lt;p&gt;However, I am fully in support of the idea of a &amp;quot;canonical&amp;quot; challenge. Here on CGSE many of us, myself included, have developed our own programming languages. These canonical challenges are excellent places to demonstrate the power of esoteric languages! Of course, there are many languages where tasks like these would be trivial, but there are a lot of languages (e.g. brainf*** and my new language) where solutions would be very interesting and creative.&lt;/p&gt;&#xA;&lt;p&gt;I would be in support of someone posting a new, completely vanilla factorial challenge with only the third requirement. As it does not have the other three arbitrary restrictions, I would argue that this challenge would not be a dupe of the old challenge (but others might disagree). These other requirements actually stopped me from posting a creative answer in my new language, and there is no vanilla factorial challenge to post it on.&lt;/p&gt;&#xA;&lt;h1&gt;tl;dr&lt;/h1&gt;&#xA;&lt;p&gt;I don't think we should change the linked challenge but I would like to see a new, completely vanilla factorial challenge which only has the third requirement.&lt;/p&gt;&#xA;&lt;h1&gt;EDIT:&lt;/h1&gt;&#xA;&lt;p&gt;We finally have a vanilla factorial challenge! &lt;a href=&quot;https://codegolf.stackexchange.com/a/210100/95671&quot;&gt;Here&lt;/a&gt;'s the answer that didn't fit the requirements of the last challenge (it didn't fit because it uses eval functions)&lt;/p&gt;&#xA;" OwnerUserId="95671" LastEditorUserId="95671" LastEditDate="2020-08-25T03:16:15.587" LastActivityDate="2020-08-25T03:16:15.587" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19222" PostTypeId="2" ParentId="2140" CreationDate="2020-08-16T13:35:04.543" Score="0" Body="&lt;h1&gt;Mega Man&lt;/h1&gt;&#xA;&lt;p&gt;My first polyglot challenge, enjoy!&lt;/p&gt;&#xA;&lt;h2&gt;Validness of a program&lt;/h2&gt;&#xA;&lt;p&gt;In this challenge, a &amp;quot;program&amp;quot; doesn't take an input. This challenge doesn't care of any output, though.&lt;/p&gt;&#xA;&lt;p&gt;An invalid program, either:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Doesn't compile, or&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Compiles, but the program doesn't halt when executed.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;A program is valid otherwise.&lt;/p&gt;&#xA;&lt;h2&gt;The 6 Robot Masters&lt;/h2&gt;&#xA;&lt;p&gt;A &lt;strong&gt;robot master&lt;/strong&gt; is a valid program. Their language can be chosen freely, not necessarily all same or all distinct.&lt;/p&gt;&#xA;&lt;p&gt;There are 6 Robot Masters in total, namely &lt;strong&gt;Cut Man&lt;/strong&gt;, &lt;strong&gt;Elec Man&lt;/strong&gt;, &lt;strong&gt;Ice Man&lt;/strong&gt;, &lt;strong&gt;Fire Man&lt;/strong&gt;, &lt;strong&gt;Bomb Man&lt;/strong&gt;, and &lt;strong&gt;Guts Man&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;(Yeah, I wanted to include &lt;strong&gt;Time Man&lt;/strong&gt; and &lt;strong&gt;Oil Man&lt;/strong&gt; as well, but that would make this challenge too hard.)&lt;/p&gt;&#xA;&lt;h2&gt;Weapons&lt;/h2&gt;&#xA;&lt;p&gt;The robot masters have their distictive weapons. (This doesn't mean the robot masters' source code acts as their weapon, though.) A &lt;strong&gt;weapon&lt;/strong&gt; is an operation on a string.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Cut Man's weapon, &lt;strong&gt;Rolling Cutter&lt;/strong&gt;, leaves the target source's first half characters only, rounded down. Example: &lt;code&gt;Hello, world!&lt;/code&gt; → &lt;code&gt;Hello,&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Elec Man's weapon, &lt;strong&gt;Thunder Beam&lt;/strong&gt;, eliminates all whitespaces. Example: &lt;code&gt;Hello, world!&lt;/code&gt; → &lt;code&gt;Hello,world!&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Ice Man's weapon, &lt;strong&gt;Ice Slasher&lt;/strong&gt;, turns all uppercase ASCII letters small. Example: &lt;code&gt;Hello, world!&lt;/code&gt; → &lt;code&gt;hello, world!&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Fire Man's weapon, &lt;strong&gt;Fire Storm&lt;/strong&gt;, turns all lowercase ASCII letters capital. Example: &lt;code&gt;Hello, world!&lt;/code&gt; → &lt;code&gt;HELLO, WORLD!&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Bomb Man's weapon, &lt;strong&gt;Hyper Bomb&lt;/strong&gt;, eliminates the target source's first word. The behavior on the surrounding whitespaces is implementation-defined. Example: &lt;code&gt;Hello, world!&lt;/code&gt; → &lt;code&gt;world!&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Guts Man's weapon, &lt;strong&gt;Super Arm&lt;/strong&gt;, doubles all characters. Example: &lt;code&gt;Hello, world!&lt;/code&gt; → &lt;code&gt;HHeelllloo,,  wwoorrlldd!!&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;When a weapon is applied to a robot master's source code, if and only if it hits their &lt;strong&gt;weakness&lt;/strong&gt;, the resulting code must be a valid program in the robot master's language.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Rolling Cutter is the weakness of Elec Man.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Thunder Beam is the weakness of Ice Man.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Ice Slasher is the weakness of Fire Man.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Fire Storm is the weakness of Bomb Man.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Hyper Bomb is the weakness of Guts Man.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Super Arm is the weakness of Cut Man.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Every other combination is not a weakness and must result in an invalid program. This includes a weapon applied to its owner.&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;This is a code golf. The score is the sum of the byte counts of all 6 source codes. The answer with the least score wins.&lt;/p&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2020-08-17T09:41:36.850" LastActivityDate="2020-08-17T09:41:36.850" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19223" PostTypeId="2" ParentId="19211" CreationDate="2020-08-16T15:37:49.043" Score="5" Body="&lt;p&gt;Make a good tutorial, and make your language accessible.&lt;/p&gt;&#xA;&lt;p&gt;That's the main reason I started coding in MAWP. It's because:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It has an &lt;a href=&quot;https://8dion8.github.io/MAWP/v1.1/&quot; rel=&quot;nofollow noreferrer&quot;&gt;online interpeter&lt;/a&gt; which generates PPCG answers, and has a debugger.&lt;/li&gt;&#xA;&lt;li&gt;It is not insanely hard to understand from it's website.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Those two criteria were more than enough to learn and implement things in it.&lt;/p&gt;&#xA;" OwnerUserId="80214" LastActivityDate="2020-08-16T15:37:49.043" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19225" PostTypeId="2" ParentId="2140" CreationDate="2020-08-18T15:27:56.537" Score="1" Body="&lt;h1&gt;Find a 3-Language Polyglot &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;What I had in mind was that cops would create a polyglot with in 3 languages (languages A, B, and C). When run in A, the program would print the name of language B; when run in language B, the program would print the name of language C; and when run in C, it would print the name of language A.&lt;/p&gt;&#xA;&lt;p&gt;Cops have to provide the names of these 3 languages, as well as their original polyglot's characters scrambled in no particular order. &lt;s&gt;as well as a valid program in A that has the same behavior as the polyglot (prints the name of B). This program must be able to be created by deleting characters from the original polyglot, i.e., all the letters in it are included in the hidden polyglot.&lt;/s&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given the languages and the scrambled program&lt;s&gt;and the sample program&lt;/s&gt;, robbers have to find the polyglot (or a polyglot that has the same behavior as the one the cop wrote).&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any language chosen must be able to be run on TIO, repl.it, ideone, or someplace else online. If the language is obscure, please provide a link to some such website.&lt;/li&gt;&#xA;&lt;li&gt;Any language used must have documentation on Esolangs, Wikipedia, GitHub, or someplace else. Unless the language is very commonly used and has tons of tutorials everywhere, such as Java, Haskell, or C, please provide a link to documentation. Any feature used in the program must be included in that documentation - it shouldn't be something people have to dig through layers of source code to find.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Questions for meta:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this too easy/hard? Should I not include the extra A program? Should I only make it for 2 languages?&lt;/li&gt;&#xA;&lt;li&gt;Is there anything unclear about the instructions? How can I improve the phrasing?&lt;/li&gt;&#xA;&lt;li&gt;Should cops also give the length of their programs as an extra hint?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="95792" LastEditorUserId="95792" LastEditDate="2020-10-02T13:05:23.777" LastActivityDate="2020-10-02T13:05:23.777" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19226" PostTypeId="2" ParentId="2140" CreationDate="2020-08-18T23:25:57.137" Score="3" Body="&lt;h1&gt;Generalized Game Theory KOTH &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Game_theory&quot; rel=&quot;nofollow noreferrer&quot;&gt;Game Theory&lt;/a&gt; is a field of mathematics that is concerned with strategic interactions among 'rational decision-makers'. The main focus of game theory is the payoff-matrix.&lt;/p&gt;&#xA;&lt;p&gt;A payoff matrix represents an interaction between two parties, and shows how many points a party can get if they choose different strategies. Here is an example of a payoff matrix:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;             Player 1&#xA;             A  |   B&#xA;Player 2 +------+-------&#xA;       A | 3, 3 | 5, 1&#xA;         +------+-------&#xA;       B | 1, 5 | 2, 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In this example, if player 1 chooses A and player 2 also chooses A, they would both get 3 points. If player 1 chooses B but player 2 chooses A, player  would get 5 points but player 2 would only get 1.&lt;/p&gt;&#xA;&lt;p&gt;The above payoff matrix is an example of the &lt;a href=&quot;https://en.wikipedia.org/wiki/Prisoner%27s_dilemma&quot; rel=&quot;nofollow noreferrer&quot;&gt;prisoners dilemma&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;Programs will face off in a round-robin tournament. Each round will consist of a randomly generated payoff matrix, with both programs choosing either strategy A or strategy B. Programs will earn points accordingly. The winner will be the program with the most points, with ties broken by source code length.&lt;/p&gt;&#xA;&lt;h2&gt;Questions for meta:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;best practices for creating KOTH challenges?&#xA;&lt;ul&gt;&#xA;&lt;li&gt;language considerations? I'm most comfortable with javascript but am also capable of writing in python&lt;/li&gt;&#xA;&lt;li&gt;is it better to limit a KOTH to one language? it's easier to manage but limits who can submit&lt;/li&gt;&#xA;&lt;li&gt;or allow multiple languages? It allows more people to compete but is more difficult to judge&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Any comments about the overall problem?&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Has this been done before?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="73066" LastEditorUserId="73066" LastEditDate="2020-08-18T23:38:20.573" LastActivityDate="2020-08-18T23:38:20.573" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19227" PostTypeId="2" ParentId="6918" CreationDate="2020-08-19T07:49:48.263" Score="3" Body="&lt;h1&gt;MAWP&lt;/h1&gt;&#xA;&lt;p&gt;MAWP was created by me, Dion, in May 2020. My main goal was to create a language that was shorter than non-golfing languages while still being simple to use and being able to answer a wide range of questions without major difficulty. The only letters used are &lt;code&gt;M&lt;/code&gt;, &lt;code&gt;A&lt;/code&gt;, &lt;code&gt;W&lt;/code&gt; and &lt;code&gt;P&lt;/code&gt;. With this in mind, I wanted to have quite a number of builtins while not using any other letters and still having characters that are accessible on a standard keyboard.&lt;/p&gt;&#xA;&lt;p&gt;The only interpreter easily accessible by everyone is &lt;a href=&quot;https://8dion8.github.io/MAWP/v1.1&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; one, also written by me. It also has an &lt;a href=&quot;https://esolangs.org/wiki/MAWP&quot; rel=&quot;nofollow noreferrer&quot;&gt;esolangs page&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Some example programs&lt;/h1&gt;&#xA;&lt;h2&gt;Numbers by position:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;[![~!:~1A]%!9A?.%1M]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Explanation:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[      start of loop&#xA;!      duplicates top of stack&#xA;[      start of loop&#xA;~!:~   prints bottom stack value&#xA;1A     subtracts 1&#xA;]      end of loop&#xA;%      removes top of stack (0 from the counter in the previous loop)&#xA;!9A    diffeence between top value and 9&#xA;?.     if top 0, then terminate program&#xA;%      removes top value&#xA;1M     adds 1 to top value&#xA;]      end of loop&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Print the alphabet:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;[!43W8WM;1M!93WA?.%]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Explanation:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[        start of loop&#xA;!        duplicate top of stack&#xA;43W8W    push 96 to stack (4*3*8)&#xA;M        add 96 to number below&#xA;;        output top of stack as ASCII char&#xA;1M       add 1 to top of stack&#xA;!        duplicate top of stack&#xA;93W      push 27 to stack (9*3)&#xA;A        Difference of top two stack values&#xA;?.       is equal to zero, then terminate program&#xA;%        pop top of stack&#xA;]        end of loop&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;FizzBuzz:&lt;/h2&gt;&#xA;&lt;p&gt;Printing long strings is the biggest downside of MAWP, since you need to generate the ASCII code for each character with basic operations and numbers from 0 to 9.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[!!3P3WA&amp;lt;75W2W;73W5W;65W2W1M2W;65W2W1M2W;~0~&amp;gt;%!!5P5WA&amp;lt;92M6W;94M9W;65W2W1M2W;65W2W1M2W;~0~&amp;gt;%~{~!:~}~!554WWA?.%1M25W;~(%)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;[                                              Start loop&#xA;!!3P3WA                                        Is divisible by 3? (Homemade modulo &#xA;                                               function)&#xA;&amp;lt;                                              If top of stack is not 0 (number is&#xA;                                               not divisible), then jump to its &amp;gt;&#xA;75W2W;73W5W;65W2W1M2W;65W2W1M2W;               Print 'Fizz'&#xA;~0~                                            Add 0 to the bottom of stack by &#xA;                                               double reversing&#xA;&amp;gt;                                              End conditional&#xA;%                                              Remove modulo function result&#xA;!!5P5WA&amp;lt;92M6W;94M9W;65W2W1M2W;65W2W1M2W;~0~&amp;gt;%  Do the same for 'Buzz'&#xA;~                                              Reverse stack&#xA;{                                              If there are no 0 on the top of &#xA;                                               stack (not 'Fizz' nor 'Buzz' was&#xA;                                               printed), &#xA;~!:~                                           then print the current number&#xA;}~                                             End conditional and reverse stack&#xA;!554WWA?.%                                     If the number is 100, then terminate&#xA;                                               program&#xA;1M25W;                                         Print newline&#xA;~(%)                                           Remove all 0 from bottom of stack&#xA;]                                              End of loop&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="92080" LastActivityDate="2020-08-19T07:49:48.263" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19228" PostTypeId="2" ParentId="2140" CreationDate="2020-08-19T12:11:08.903" Score="4" Body="&lt;p&gt;Note: this challenge is a work-in-progress, so suggestions would be appreciated&lt;/p&gt;&#xA;&lt;p&gt;Questions for meta:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How can I prevent people from just using SHA or MD5 one-way compression?&lt;/li&gt;&#xA;&lt;li&gt;are these language restrictions fair?&lt;/li&gt;&#xA;&lt;li&gt;is this scoring system fair?&lt;/li&gt;&#xA;&lt;li&gt;are there any obvious cheap answers?&lt;/li&gt;&#xA;&lt;li&gt;what other tags should be added?&lt;/li&gt;&#xA;&lt;li&gt;what should the challenge title be?&lt;/li&gt;&#xA;&lt;li&gt;will these restrictions adequately prevent people trying to cheat their way through?&lt;/li&gt;&#xA;&lt;li&gt;should a limit be put on a password length? Should I limit passwords to ASCII printable characters?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;The challenge&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge is to first choose a &amp;quot;password&amp;quot; (please do not use your actual password). Then, you will create a program which will output a truthy value if and only if this password is given as input, falsy otherwise. Your goal will be to make it so others are unable to reverse-engineer this password (and you will keep this password secret for now).&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;The scoring for this challenge is somewhat different than regular &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. During the first two weeks from when an answer is posted, other users will have the opportunity to try to crack your password by reverse-engineering your code. If anyone gets your password correct during this two week period, your answer will be marked as cracked. If two weeks pass without users finding the password, your answer can be marked as safe once you share the password (again, please do not use your actual password, you should make up a new one that you don't use anywhere).&lt;/p&gt;&#xA;&lt;p&gt;Note that you may use any tools at your disposal (online tools, brute-force attacks, modified code, etc) to extract someone else's password from their code.&lt;/p&gt;&#xA;&lt;p&gt;Of all the safe answers, the one with the shortest source code (i.e. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;) wins!&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;p&gt;To make things fair for everyone, you may only use languages that appear on &lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;, or languages that have well-written documentation and are used somewhat widely. You must also provide a link to try your code online that anyone can access (as such, you may not use languages behind paywalls like MATLAB but Octave is still on the table because it's free).&lt;/p&gt;&#xA;&lt;p&gt;Even if you don't want to post an answer, feel free to try to crack any of the existing answer's passwords! If you get a password, you can simply leave a comment on that answer and that answer will be cracked.&lt;/p&gt;&#xA;&lt;h1&gt;Note&lt;/h1&gt;&#xA;&lt;p&gt;If you edit the code in your answer, the two week period will reset! You may edit any explanations in your answer freely (I will verify that any answers marked safe did not cheat).&lt;/p&gt;&#xA;&lt;p&gt;tags: code-golf&lt;/p&gt;&#xA;" OwnerUserId="95671" LastEditorUserId="95671" LastEditDate="2020-08-19T16:35:54.790" LastActivityDate="2020-08-19T16:35:54.790" CommentCount="18" ContentLicense="CC BY-SA 4.0" />
  <row Id="19229" PostTypeId="2" ParentId="2140" CreationDate="2020-08-19T14:59:53.220" Score="0" Body="&lt;h1&gt;Sort until overflow - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/209840/sort-until-overflow&quot;&gt;POSTED HERE&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="95505" LastEditorUserId="95505" LastEditDate="2020-08-20T13:31:27.177" LastActivityDate="2020-08-20T13:31:27.177" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19231" PostTypeId="2" ParentId="8047" CreationDate="2020-08-19T20:51:55.487" Score="25" Body="&lt;h1&gt;Hidden pattern in the output for code golf challenges&lt;/h1&gt;&#xA;&lt;p&gt;You &lt;strong&gt;should not&lt;/strong&gt; post a challenge in which an essential part is to find a pattern in the required output, which is not stated in the challenge but which greatly simplifies the code. That kind of challenges are essentially a puzzle in disguise.&lt;/p&gt;&#xA;&lt;p&gt;As an &lt;strong&gt;example&lt;/strong&gt; of a &lt;strong&gt;non-valid&lt;/strong&gt; challenge, consider one that simply requires to&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Produce this fixed string:&lt;p&gt;&#xA;&lt;code&gt;bebfjcgfdfijhjdcdiegcgeddidchjfaciiebjhbgjdjjdhfbaficajhejeefjcdahibgeagcigcaijj&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;without further explanation. The code will be much shorter if one realizes that the string is the first 80 decimals of &lt;code&gt;pi&lt;/code&gt; with &lt;code&gt;0&lt;/code&gt; replaced by &lt;code&gt;a&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt; by &lt;code&gt;b&lt;/code&gt; etc.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;strong&gt;reasons&lt;/strong&gt; why these challenges should be avoided are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The actual complexity is in finding a hidden pattern, rather than in coding or programming. This is of little interest on this site, and possibly off-topic (consider posting on &lt;a href=&quot;https://puzzling.stackexchange.com&quot;&gt;https://puzzling.stackexchange.com&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Once an answer finds out the pattern, all other answers can do the same. If the pattern is going to be eventually known anyway, it is better to describe it upfront in the challenge.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;So, you &lt;strong&gt;should&lt;/strong&gt; state the pattern in the challenge text. If you feel that makes the challenge &amp;quot;less interesting&amp;quot;, consider modifying it in some other way.&lt;/p&gt;&#xA;&lt;p&gt;Note, however, that the challenge is &lt;strong&gt;not&lt;/strong&gt; expected to describe &lt;strong&gt;all&lt;/strong&gt; possible characterizations or patterns that the output satisfies. Including one (or maybe several) is enough. There is &lt;strong&gt;no requirement to be exhaustive&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For &lt;strong&gt;example&lt;/strong&gt;, this would be &lt;strong&gt;valid&lt;/strong&gt; as a challenge (adding further rules for output format etc):&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Determine if the input is a triangular number, that is, if it can be expressed as &lt;code&gt;1+2+···+k&lt;/code&gt;, or equivalently as &lt;code&gt;k*(k+1)/2&lt;/code&gt;, for some positive integer &lt;code&gt;k&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The pattern is embodied by the definition of triangular numbers (&lt;code&gt;1+2+...+k&lt;/code&gt;), which is included in the challenge. The challenge also contains another equivalent characterization (&lt;code&gt;k*(k+1)/2&lt;/code&gt;). Now, an answer may find and exploit some other characterization, such as&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A positive integer &lt;code&gt;n&lt;/code&gt; is triangular if and only if &lt;code&gt;8*n+1&lt;/code&gt; is a square.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;It is totally fine if the challenge text does not include that information (which might have even been unknown to the challenge writer).&lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2020-09-22T11:27:42.390" LastActivityDate="2020-09-22T11:27:42.390" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19232" PostTypeId="1" CreationDate="2020-08-19T22:11:18.040" Score="11" ViewCount="169" Body="&lt;p&gt;I created a couple challenges recently which I was hoping would be pretty interesting, but turned into something significantly less interesting due to an oversight or regrettable rule.&lt;/p&gt;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/q/209666/45613&quot;&gt;De-interleave log lines&lt;/a&gt;, I allowed answers to output the de-interleaved logs as a concatenated list with no separators. This essentially turned the challenge into a sorting task.&lt;/p&gt;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/q/209753/45613&quot;&gt;Quineoid Triple - A(B) = C&lt;/a&gt;, I hadn't considered that each of the three programs might only differ by a single byte, making the challenge far less interesting than I was hoping.&lt;/p&gt;&#xA;&lt;p&gt;I want to fix these issues, but I don't seem to have any options.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Duplicating the challenge with a minor rule change is still a duplicate. Even a well-thought out set of significant rule changes can easily be solved with only small modifications.&lt;/li&gt;&#xA;&lt;li&gt;Changing the rules after the fact is unacceptable if it eliminates answers that would have been valid previously.&lt;/li&gt;&#xA;&lt;li&gt;Bonuses which might encourage a more interesting approach are frowned upon&lt;/li&gt;&#xA;&lt;li&gt;Bounties can help, but having to stake some reputation any time you make an &amp;quot;almost interesting&amp;quot; challenge to get better answers is just salt in the wound.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;What can be done about challenges like this?&lt;/p&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2020-08-25T20:42:09.680" LastActivityDate="2020-08-25T20:42:09.680" Title="How can I retroactively deal with rules that turned out to make a challenge uninteresting?" Tags="|discussion|challenge-quality|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19233" PostTypeId="2" ParentId="19232" CreationDate="2020-08-19T23:44:31.510" Score="7" Body="&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If there are few answers &lt;strong&gt;you can maybe change the rules&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;em&gt;Leave a comment&lt;/em&gt; in the challenge saying the change to are considering to make. This is for people who are writing an answer now or intend to do so.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Ask the owners of the current answers&lt;/em&gt; if they mind you changing the rules. Quite often they will agree, if the rule change makes the challenge more interesting.&lt;/li&gt;&#xA;&lt;li&gt;If they agree &lt;em&gt;change the rules&lt;/em&gt;. Consider deleting the comment from step 1 or/and adding a new comment explaining the change.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the above is not feasible, you can post a &lt;strong&gt;new challenge with additional changes&lt;/strong&gt;, besides the modified rules, to prevent it from being a duplicate. Of course, the changes should give rise to a challenge that is interesting enough.&lt;/p&gt;&#xA;&lt;p&gt;For instance, in the &lt;em&gt;De-interleave log lines&lt;/em&gt; challenge you can perhaps change the input so that it can include lines without an app tag, and then those lines correspond to the most recent app.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2020-08-19T23:49:33.357" LastActivityDate="2020-08-19T23:49:33.357" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19235" PostTypeId="2" ParentId="2140" CreationDate="2020-08-20T02:47:04.337" Score="-1" Body="&lt;h1&gt;Find the nth positive integer m for which &lt;span class=&quot;math-container&quot;&gt;\$\tan(m) &amp;gt; m\$&lt;/span&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Write a program/function that when given an integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; as input outputs the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th positive integer &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt; for which &lt;span class=&quot;math-container&quot;&gt;\$\tan(m) \gt m\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt; is in &lt;a href=&quot;https://en.wikipedia.org/wiki/Radian&quot; rel=&quot;nofollow noreferrer&quot;&gt;radians&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Sample Testcases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;# n -&amp;gt; m&#xA;1   -&amp;gt; 1&#xA;2   -&amp;gt; 260515&#xA;3   -&amp;gt; 37362253&#xA;5   -&amp;gt; 534483448&#xA;9   -&amp;gt; 214112296674652&#xA;10  -&amp;gt; 642336890023956&#xA;16  -&amp;gt; 4285797387061825747646013&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Find more at &lt;a href=&quot;https://oeis.org/A249836&quot; rel=&quot;nofollow noreferrer&quot;&gt;A249836&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://www.youtube.com/watch?v=A7eJb8n8zAw&quot; rel=&quot;nofollow noreferrer&quot;&gt;What is the biggest tangent of a prime?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="91267" LastEditorUserId="66833" LastEditDate="2020-09-25T00:32:53.297" LastActivityDate="2020-09-25T00:32:53.297" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="19236" PostTypeId="2" ParentId="19211" CreationDate="2020-08-20T06:18:15.693" Score="3" Body="&lt;h1&gt;Port the Interpreter to JavaScript&lt;/h1&gt;&#xA;&lt;p&gt;Most of the answers here don't actually answer the question of how to best make the &lt;em&gt;interpreter&lt;/em&gt; accessible to everyone. So I'll add a way that opens up the programming language to easy online usage.&lt;/p&gt;&#xA;&lt;p&gt;Here is the process I'd use to make an online interpreter (it may not be the most efficient way, but thus far, it's the only way presented)&lt;/p&gt;&#xA;&lt;h2&gt;Step 1: Create a simple user interface&lt;/h2&gt;&#xA;&lt;p&gt;Ensure these things are present on the page:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Code box (where the program goes)&lt;/li&gt;&#xA;&lt;li&gt;Input box (where the program's input goes)&lt;/li&gt;&#xA;&lt;li&gt;Output box (self explanatory)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Step 2: Actually translate the base interpreter to js&lt;/h2&gt;&#xA;&lt;p&gt;Turn the program in the non-web-friendly language into js line by line.&lt;/p&gt;&#xA;&lt;p&gt;You could look at transpilers (in this case, python to js). But make sure that it translates it properly. An example python transpiler is Transcrypt.&lt;/p&gt;&#xA;&lt;h2&gt;Step 3: Link js and html&lt;/h2&gt;&#xA;&lt;p&gt;This is pretty simple: use things like &lt;code&gt;&amp;lt;script&amp;gt;&lt;/code&gt; tags to include the js files.&lt;/p&gt;&#xA;&lt;p&gt;And that's it. This is highly oversimplified, but it's a reasonable method of making an online interpreter.&lt;/p&gt;&#xA;&lt;p&gt;I'd recommend hosting your interpreter on something like Github Pages (which is 100% free).&lt;/p&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2020-08-20T06:18:15.693" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="19237" PostTypeId="2" ParentId="2140" CreationDate="2020-08-20T09:18:01.633" Score="2" Body="&lt;h1&gt;Solve the Halting Problem for Oneplis&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/halting-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;halting-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;halting-problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Oneplis is a &amp;quot;very simple esolang&amp;quot; (I don't want to count this one toward my esolangs) made by me which only have three commands. As you can probably see from the name, it is a subset of 1+, along the lines of Befinge.&lt;/p&gt;&#xA;&lt;p&gt;The three commands are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;1&lt;/code&gt;, which pushes 1. (Obviously!)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;+&lt;/code&gt;, which pops the top two numbers and pushes their sum. (Obviously!)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;#&lt;/code&gt;, pops a number &lt;em&gt;n&lt;/em&gt; and jumps to the instruction after the &lt;em&gt;n&lt;/em&gt;th (0-based) &lt;code&gt;#&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Oneplis is almost certainly a (very limited) push-down automaton, since it's impossible to decrement a number and impossible to retrieve elements arbitrary deep in the stack! Oh, and the only way to read a number is with &lt;code&gt;#&lt;/code&gt;, which cannot handle arbitrarily large numbers!&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins! Your output should be truthy for halting, and falsy for non-halting. You can use any set of five characters for the instructions. Don't care if it jumps to a non-existence &lt;code&gt;#&lt;/code&gt; or trying to execute &lt;code&gt;+&lt;/code&gt; when there are &amp;lt;2 numbers on the stack.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;11+ -&amp;gt; True&#xA;1##1# -&amp;gt; False&#xA;1## -&amp;gt; True&#xA;11+1+###11+# -&amp;gt; True&#xA;11+##1#1 -&amp;gt; False&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Test cases?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Shall I require the answers to deal with errors?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="87986" LastEditorUserId="87986" LastEditDate="2020-08-20T11:31:36.690" LastActivityDate="2020-08-20T11:31:36.690" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="19238" PostTypeId="1" CreationDate="2020-08-20T12:31:07.813" Score="0" ViewCount="97" Body="&lt;p&gt;The showcase is intended to, and was, a place to show and see new languages. In fact, it motivated me to learn &amp;gt;&amp;lt;&amp;gt;.&lt;/p&gt;&#xA;&lt;p&gt;But now, it's pretty much dead AFAIK. New languages keep coming in, but they usually get only 3 or 4 upvotes, which indicates not many people are actually viewing it; Good, hard-worked answers are buried in rubbish short answers like the BCT one.&lt;/p&gt;&#xA;&lt;p&gt;It is no longer working. Closing it is of course a solution, but aren't there positive choices?&lt;/p&gt;&#xA;&lt;p&gt;I also want to mention the problem about the removal of the one-vote-at-a-time rule.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;em&gt;It'd be like removing the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; from a challenge: the answers would still work, but the goal they were aiming for is gone.&lt;/em&gt; -- &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10660/87986&quot;&gt;https://codegolf.meta.stackexchange.com/a/10660/87986&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Several users (myself included) preferred to follow the old rules despite the current community consensus. That's more or less against the original purpose of the challenge.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;em&gt;It may not invalidate existing answers, but it will make their structure confusing to anyone reading the updated challenge, and new answers will look different.&lt;/em&gt; -- &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10659/87986&quot;&gt;https://codegolf.meta.stackexchange.com/a/10659/87986&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;And new answers will look different. Yes they do. For example, the recent &lt;a href=&quot;https://codegolf.stackexchange.com/a/208978/87986&quot;&gt;Integral answer&lt;/a&gt; has a 1 byte answer, then 12 bytes, then suddenly 37 bytes.&lt;/p&gt;&#xA;&lt;p&gt;This is just boring.&lt;/p&gt;&#xA;&lt;p&gt;So, I'm looking for ideas, agreements, disagreements, comments, anything that will help improving the showcase. It's a great resource.&lt;/p&gt;&#xA;" OwnerUserId="87986" LastEditorUserId="65836" LastEditDate="2020-08-30T15:57:00.910" LastActivityDate="2020-08-30T15:57:00.910" Title="Can we do anything with the showcase?" Tags="|discussion|specific-question|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19239" PostTypeId="2" ParentId="19238" CreationDate="2020-08-20T13:14:55.120" Score="3" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;Good, hard-worked answers are buried in rubbish short answers like the BCT one.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;If you view the catalogue by the Active tab, you'll see that these good answers rise to the top.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;they usually get only 3 or 4 upvotes&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;It's still working, it's just that people are showcasing esolangs. Most people don't have an interest towards them in general; they prefer to see and vote on practical languages. Someone should probably showcase an obscure practical language here. :P&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;the recent Integral answer have a 1 byte answer, then 12 bytes, then suddenly 37 bytes.&lt;/p&gt;&#xA;&lt;p&gt;This is just boring.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I think the removed rule is just awful. Users now tend to post answers that don't fully showcase their language. This ruins the original intent of the Language Showcase.&lt;/p&gt;&#xA;&lt;p&gt;On the other hand, it allows people to decide what they should do to make their answers interesting. They can now do whatever they want to their answers. However, you can always downvote if you think an answer is bad.&lt;/p&gt;&#xA;" OwnerDisplayName="user96495" LastEditorDisplayName="user96495" LastEditDate="2020-08-30T14:38:48.870" LastActivityDate="2020-08-30T14:38:48.870" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="19240" PostTypeId="2" ParentId="19238" CreationDate="2020-08-20T14:43:01.913" Score="1" Body="&lt;p&gt;Challenges get old and inactive, it happens to all of them. The Showcase is a unique type of challenge, that has done surprisingly well, given the controversies it's faced.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;But now, it's pretty much dead AFAIK. New languages keep coming in, but they usually get only 3 or 4 upvotes, which indicates not many people are actually viewing it&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;As long as new answers are coming in, a challenge isn't dead. Those answers may not get many upvotes, but that shouldn't matter. If you want to showcase your language, do so, regardless of the score - especially now that the limit on snippet lengths has been removed.&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, for a challenge that is over 5 years old, for new answers to still be getting 3 or 4 upvotes is pretty impressive. Not everyone upvotes every answer they see. I personally will browse a challenge and can give out no upvotes, or upvotes on most answers; in short, you cannot tell how active a challenge is by answer votes.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Good, hard-worked answers are buried in rubbish short answers like the BCT one&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;First of all, if you don't like an answer, downvote and move on. Second of all, if you think an answer is good and has been worked on hard, upvote it. That's all. The Showcase is constantly active, given that people are always adding new snippets to their answers, so any low-effort answers will get buried and forgotten about soon enough, while constantly maintained answers will always be fairly easily found.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;It is no longer working. Closing it is of course a solution, but aren't there positive choices?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Agree to disagree as to &amp;quot;it is no longer working&amp;quot;. It constantly gets new answers and updates, so it seems to be working to me. You may not find new languages to learn there (I assume that's what you mean by &amp;quot;no longer working&amp;quot;) but others will.&lt;/p&gt;&#xA;&lt;p&gt;Closing it is &lt;em&gt;absolutely not&lt;/em&gt; a solution. Take a look at the accepted answer to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10657/66833&quot;&gt;linked discussion&lt;/a&gt;. Four years ago, we agreed that closing it wasn't a good solution. We can have a second poll to see how people are feeling, but, given the Showcase's constant activity, I doubt there's much support for closing it.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I also want to mention the problem about the removal of the one-vote-at-a-time rule.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Again, as the accepted answer the last time we had this discussion states, the Showcase is &lt;em&gt;not&lt;/em&gt; like most challenges here. The unique &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/showcase&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;showcase&amp;#39;&quot; rel=&quot;tag&quot;&gt;showcase&lt;/a&gt; tag, along with being a community wiki, and the notice at the top of the challenge body all state &amp;quot;This is not a normal challenge&amp;quot;, and therefore, we cannot treat it like a normal challenge. This site may not be the best place for such a thread, but we have it, it's active and popular, and it currently isn't doing any harm.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Several users (myself included) preferred to follow the old rules despite the current community consensus&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Well then, you can self-impose the old rules upon your answers. But that isn't a reason to change anything about the challenge. When it was a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, there were issues raised about how some newer answers weren't getting enough upvotes to properly compete with older answers. If you wish to constrain yourself by the old rules, then you also have to accept the possible failings of those rules.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;And new answers will look different. Yes they do. For example, the recent Integral answer have a 1 byte answer, then 12 bytes, then suddenly 37 bytes.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is perfectly within the rules of the challenge. You may not like it, and it may be confusing, but it's a perfectly valid answer. Furthermore, as the answers are community wiki, you are always welcome to edit in additional snippets to improve the answer.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This is just boring&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;That is completely subjective, and what voting is for. If you think an answer (or challenge) is boring, I invite you to leave a downvote and (preferably) a comment explaining why you think the answer/challenge is boring. After that, as long as the answer/challenge is valid/on-topic/acceptable for the site, move on.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Overall, the Showcase isn't a perfect system. But it works as an effective way to demonstrate your language and its interesting features. You personally may not like particular answers, or even the challenge as a whole, but, again, that's what voting's for.&lt;/p&gt;&#xA;&lt;p&gt;If you think that users aren't fully showcasing their languages, I encourage you to leave an upvote and a comment to show that you're interested in the language and you'd like them to continue showcasing it. Or, if you know of an interesting feature that hasn't been demonstrated, you can always edit it in yourself. Finally, if you think an answer is low-effort, or isn't a good example of the language, you can downvote, or post your own showcase of that language.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2020-08-20T14:43:01.913" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19241" PostTypeId="2" ParentId="2140" CreationDate="2020-08-20T15:43:40.457" Score="2" Body="&lt;h1&gt;Noncommutative Quineoid Triple&lt;/h1&gt;&#xA;&lt;p&gt;This is the hard mode of &lt;a href=&quot;https://codegolf.stackexchange.com/q/209753/45613&quot;&gt;Quineoid Triple&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Write three different programs such that &lt;em&gt;&lt;strong&gt;all&lt;/strong&gt;&lt;/em&gt; of the following properties hold:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ A(B) = C \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ B(C) = A \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ C(A) = B \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ A(C) = -B \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ B(A) = -C \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ C(B) = -A \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ A(A) = \epsilon \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ B(B) = \epsilon \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ C(C) = \epsilon \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Where:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ f(g) \$&lt;/span&gt; is the output obtained from feeding the program text of &lt;span class=&quot;math-container&quot;&gt;\$g\$&lt;/span&gt; into program &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ -x \$&lt;/span&gt; is the program text of &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; in reverse (reversed in terms of either raw bytes or unicode codepoints)&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ \epsilon \$&lt;/span&gt; is the empty string / an empty output&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Rules and Scoring&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program length total, in bytes wins.&lt;/li&gt;&#xA;&lt;li&gt;Standard quine rules apply.&lt;/li&gt;&#xA;&lt;li&gt;Each program can be in any language. Any number of them may share languages or each may use a different language.&lt;/li&gt;&#xA;&lt;li&gt;Use any convenient IO format as long as each program uses a consistent convention.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Functions are allowed, as this counts as &amp;quot;any convenient IO&amp;quot;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The result of feeding anything other than program text of one of the three programs is undefined.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="45613" LastActivityDate="2020-08-20T15:43:40.457" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19242" PostTypeId="2" ParentId="2140" CreationDate="2020-08-20T16:02:33.677" Score="0" Body="&lt;h1&gt;Quineoid Triple Uniqueness Optimization&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This is a variant of &lt;a href=&quot;https://codegolf.stackexchange.com/q/209666/45613&quot;&gt;Quineoid Triple&lt;/a&gt; with the same requirements but different scoring.&lt;/p&gt;&#xA;&lt;p&gt;Write three different programs such that when any one program is provided as input to one of the other two, you get the source of the remaining program as output. More explicitly, given programs &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;, and &lt;span class=&quot;math-container&quot;&gt;\$C\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$f(g)\$&lt;/span&gt; denotes the output obtained from inputting the text of program &lt;span class=&quot;math-container&quot;&gt;\$g\$&lt;/span&gt; into program &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt;, &lt;em&gt;&lt;strong&gt;all&lt;/strong&gt;&lt;/em&gt; of the following must hold:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ A(B) = C \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ A(C) = B \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ B(A) = C \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ B(C) = A \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ C(A) = B \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ C(B) = A \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;The goal is to have the three programs be as different as possible.&lt;/p&gt;&#xA;&lt;p&gt;Your score is the sum of:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Number of unique bytes found in program &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;, but not &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; or &lt;span class=&quot;math-container&quot;&gt;\$C\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Number of unique bytes found in program &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;, but not &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; or &lt;span class=&quot;math-container&quot;&gt;\$C\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Number of unique bytes found in program &lt;span class=&quot;math-container&quot;&gt;\$C\$&lt;/span&gt;, but not &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; or &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The theoretical maximum score is 256.&lt;/p&gt;&#xA;&lt;h1&gt;Additional Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard quine rules apply.&lt;/li&gt;&#xA;&lt;li&gt;Each program can be in any language. Any number of them may share languages or each may use a different language.&lt;/li&gt;&#xA;&lt;li&gt;Use any convenient IO format as long as each program uses a consistent convention.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Functions are allowed, as this counts as &amp;quot;any convenient IO&amp;quot;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The result of feeding a program its own source code is undefined&lt;/li&gt;&#xA;&lt;li&gt;The result of feeding anything other than program text of either of the other two programs is undefined.&lt;/li&gt;&#xA;&lt;li&gt;Byte encoding should be taken into account for languages with dedicated codepages.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;SANDBOX: this is kind of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt;-ish. Should I call it a bowling challenge?&lt;/p&gt;&#xA;" OwnerUserId="45613" LastActivityDate="2020-08-20T16:02:33.677" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19243" PostTypeId="2" ParentId="2140" CreationDate="2020-08-20T16:47:47.987" Score="-2" Body="&lt;h1&gt;Meta-golfing Numbers&lt;/h1&gt;&#xA;&lt;p&gt;The Esolangs Wiki has a page &lt;a href=&quot;https://esolangs.org/wiki/Brainfuck_constants&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; cataloging the shortest known programs in Brainf*** to generate a given number. A similar catalog could exist for any language: it would simply be a list of the shortest known programs in that language outputting a given constant. By extension, we can assume that for any given language, a catalog like this could be generated programmatically, by creating a program that given a constant outputs another program outputting that constant.&lt;/p&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Your challenge is to create a program in any language &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;, such that when that program is given an input &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;, it outputs a program in language &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; that will ouput &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Languages &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; need not be different; you can output a program in the same language as your source code.&lt;/li&gt;&#xA;&lt;li&gt;All outputted programs &lt;em&gt;must&lt;/em&gt; be in the same language &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; is guaranteed to be a positive integer. It may be &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;I/O&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input and output can be done with any of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;default I/O methods&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; should be inputted as an integer, the string representation of an integer, or an array of digits. Programs should be outputted as a string or a list of characters.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Restrictions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program must handle values of &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; at least up to &lt;span class=&quot;math-container&quot;&gt;\$255\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Trailing whitespace and newlines are allowed, as long as they do not make any program invalid; ie., I can have trailing newlines and whitespace as long as the implementation of &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; allows them in programs.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;This question is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, so the answer with the most votes wins!&lt;/p&gt;&#xA;" OwnerUserId="88212" LastEditorUserId="88212" LastEditDate="2020-08-21T12:09:30.637" LastActivityDate="2020-08-21T12:09:30.637" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="19245" PostTypeId="2" ParentId="10127" CreationDate="2020-08-20T17:46:45.383" Score="10" Body="&lt;h1&gt;I don't really consider languages to be competing with each other.&lt;/h1&gt;&#xA;&lt;p&gt;Maybe this is partly a cultural shift over the last 4 years because I don't really see this outrage in newer challenges. Maybe people have learned to accept that golfing languages are here to stay. I don't know.&lt;/p&gt;&#xA;&lt;p&gt;Python answers compete with Python, Java with Java, APL with APL, Jelly with Jelly, etc...&lt;/p&gt;&#xA;&lt;p&gt;This site is more about showcasing brevity in &amp;lt;insert language here&amp;gt; rather than brevity overall. Golfscript is almost always going to outgolf C++. &lt;em&gt;Don't worry about it&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I have also specified scoring as &amp;quot;the shortest code in each language wins&amp;quot; in many of my challenges to emphasize this perspective and I rarely accept answers.&lt;/p&gt;&#xA;" OwnerUserId="45613" LastActivityDate="2020-08-20T17:46:45.383" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19247" PostTypeId="1" AcceptedAnswerId="19248" CreationDate="2020-08-21T06:07:28.840" Score="6" ViewCount="345" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/q/607/78410&quot;&gt;existing factorial challenge&lt;/a&gt; has some restrictions on the domain, performance, and banning built-ins. I opened &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19208/78410&quot;&gt;a meta question&lt;/a&gt; about it a week ago, and as per the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/19220/78410&quot;&gt;meta consensus&lt;/a&gt;, we decided to post a new vanilla factorial challenge. The sandboxed challenge is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/19234/78410&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Now the problem is: &lt;strong&gt;Should we close the old factorial challenge as a dupe of the new one?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Relevant existing meta discussion: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8286/78410&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8283/78410&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1876/78410&quot;&gt;3&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="65836" LastEditDate="2020-08-30T15:54:44.077" LastActivityDate="2020-08-30T15:55:00.590" Title="We decided to post a new factorial challenge. Should we close the old one as dupe?" Tags="|discussion|duplicates|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19248" PostTypeId="2" ParentId="19247" CreationDate="2020-08-21T06:19:00.703" Score="11" Body="&lt;h1&gt;No, leave both challenges open&lt;/h1&gt;&#xA;&lt;p&gt;As Luis Mendo requested in the comment, here is a copy of my statement for voting.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I believe it is not a dupe because the solutions to the existing challenge are not likely to be competitive here, and solutions to this one are not likely to be valid on the other.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Using &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8286/78410&quot;&gt;Mego's post&lt;/a&gt; as the guideline, in my opinion:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Is the &amp;quot;meat&amp;quot; of the challenges the same?&lt;/strong&gt; Not really. The restriction imposed on the old challenge is so hard for languages without infinite-precision integer support, making the &amp;quot;restriction&amp;quot; the core part of the challenge, rather than the factorial-calculating part.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Could answers from one be posted to the other, with trivial modifications at most, and be competitive?&lt;/strong&gt; No, based on the quote above.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;s&gt;&lt;strong&gt;Which challenge is better?&lt;/strong&gt;&lt;/s&gt; This part is irrelevant since it is about which to leave open &lt;em&gt;assuming&lt;/em&gt; they are dupes of each other, and I don't think they are dupes.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="65836" LastEditDate="2020-08-30T15:54:54.803" LastActivityDate="2020-08-30T15:54:54.803" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19249" PostTypeId="2" ParentId="2140" CreationDate="2020-08-21T07:15:48.280" Score="3" Body="&lt;h1&gt;Is my triangle on the lattice? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/217488/is-my-triangle-on-the-lattice&quot;&gt;on the main site&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="79069" LastEditorUserId="79069" LastEditDate="2021-01-10T14:15:01.023" LastActivityDate="2021-01-10T14:15:01.023" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19250" PostTypeId="2" ParentId="19247" CreationDate="2020-08-21T07:56:09.000" Score="-2" Body="&lt;h1&gt;...But what purpose would the old one serve, then?&lt;/h1&gt;&#xA;&lt;p&gt;The only reason we use the old challenge is, it is a factorial challenge.&lt;/p&gt;&#xA;&lt;p&gt;Now that we have the new challenge, what does the old one do?&lt;/p&gt;&#xA;" OwnerUserId="87986" LastEditorUserId="65836" LastEditDate="2020-08-30T15:55:00.590" LastActivityDate="2020-08-30T15:55:00.590" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19252" PostTypeId="2" ParentId="2140" CreationDate="2020-08-21T15:21:53.623" Score="1" Body="&lt;h1&gt;How Many Notches Are On Texas Red's Pistol?&lt;/h1&gt;&#xA;&lt;p&gt;The song, &lt;em&gt;Big Iron&lt;/em&gt;, by Marty Robbins, is about an Arizona Ranger who rode into the town of Agua Fria to take the outlaw Texas Red alive (or maybe dead), armed with only the Big Iron (a .45 revolver) on his hip. Texas Red, despite being only 24 years old, is extremely dangerous, having already taken out 20 men who have tried to go after him. As a point of pride, he's carved out a notch on his pistol for each one. The song counts the notches on Texas Red's pistol as &amp;quot;one and nineteen more&amp;quot;. After listening to the song a couple times, two questions crossed my mind:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;What about the other numbers that add up to twenty?&lt;/li&gt;&#xA;&lt;li&gt;What if the Ranger wasn't the 21st person to try?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a positive integer, &lt;em&gt;N&lt;/em&gt;, the total notches on Texas Red's pistol, and another number &lt;em&gt;A&lt;/em&gt; (also an positive integer), output a number &lt;em&gt;B&lt;/em&gt; such that &lt;em&gt;B + A = N&lt;/em&gt;. In the context of the song, it should read &amp;quot;&lt;em&gt;A&lt;/em&gt; and &lt;em&gt;B&lt;/em&gt; more&amp;quot;.&lt;/p&gt;&#xA;&lt;h2&gt;The Catch&lt;/h2&gt;&#xA;&lt;p&gt;The song still has to be intact without sub-dividing any beats. That is, the number of syllables in the phrase &amp;quot;A and B more&amp;quot; must add up to 5. If it doesn't, output the string &amp;quot;oops&amp;quot;. You may assume&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;0 &amp;lt; A &amp;lt; N &amp;lt; 20&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;1 &amp;lt; N&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;N   A   B (output)&#xA;&#xA;20  1   19   (&amp;quot;One and nineteen more.&amp;quot;)&#xA;19  2   oops (&amp;quot;Two and seventeen more&amp;quot; has 6 syllables)&#xA;11  7   4    (&amp;quot;Seven and four more.&amp;quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Syllable Counts&lt;/h2&gt;&#xA;&lt;p&gt;The numbers, from one to nineteen, have syllable counts as follows: one (1), two (1), three (1), four (1), five (1), six (1), seven (2), eight (1), nine (1), ten (1), eleven (3), twelve (1), thirteen (2), fourteen (2), fifteen (2), sixteen (2), seventeen (3), eighteen (2), and nineteen (2). No synonyms are accepted, such as &amp;quot;aught more&amp;quot; for &amp;quot;zero more&amp;quot;.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;: Shortest code in bytes wins. Standard loopholes apply.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Meta Stuff:&lt;/h3&gt;&#xA;&lt;p&gt;I hope this is interesting enough. I thought just a normal subtraction problem would be too boring.&lt;/p&gt;&#xA;&lt;p&gt;Is &amp;quot;oops&amp;quot; a good distinguishing output?&lt;/p&gt;&#xA;" OwnerUserId="91403" LastActivityDate="2020-08-21T15:21:53.623" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19253" PostTypeId="2" ParentId="2140" CreationDate="2020-08-21T17:44:09.360" Score="-2" Body="&lt;h1&gt;Feedback Wanted&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this too vague? should I change it to something like &amp;quot;create a quine with the fewest unique bytes&amp;quot;, or perhaps adapt another existing challenge that might otherwise use lots of repeated bytes?&lt;/li&gt;&#xA;&lt;li&gt;Maybe the idea is just too boring on its own and I should create a new proper challenge based around it?&lt;/li&gt;&#xA;&lt;li&gt;Should I change the scoring system (&lt;strong&gt;votes - unique_bytes&lt;/strong&gt;) - should it be divided instead, or use a more complex formula?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, but not as you know it. Instead of every byte,&#xA;This is sort-of also a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; question.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Write an &lt;strong&gt;interesting&lt;/strong&gt; program that uses the fewest &lt;strong&gt;unique&lt;/strong&gt; bytes. This is not really about what the program does, but what you can do with a limited &lt;strong&gt;set&lt;/strong&gt; of characters.&lt;/p&gt;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program must run on &lt;a href=&quot;https://tio.run&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try It Online&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Programming languages with only a few permissible bytes anyway like Brainfuck's &lt;code&gt;+-.,[]&amp;lt;&amp;gt;&lt;/code&gt;, are allowed, but officially considered &lt;strong&gt;boring&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Apart from this, you can write anything.&lt;/p&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Hybrid of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; and &amp;quot;fewest-unique-bytes&amp;quot;. Score is calculated as &lt;strong&gt;votes - unique_bytes&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Unique bytes is based on bytes, not characters or whatever. You can calculate unique bytes using this Python snippet: &lt;code&gt;len(set(b&amp;quot;your code here&amp;quot;))&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2020-08-21T17:44:09.360" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19256" PostTypeId="2" ParentId="19247" CreationDate="2020-08-22T05:04:40.047" Score="0" Body="&lt;h1&gt;Yes, we made similar decisions previously&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/8369/generate-a-kolakoski-sequence&quot;&gt;This challenge&lt;/a&gt; is in a very similar situation and it is closed as duplicate.&lt;/p&gt;&#xA;" OwnerUserId="87986" LastActivityDate="2020-08-22T05:04:40.047" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19259" PostTypeId="2" ParentId="2140" CreationDate="2020-08-23T11:15:43.630" Score="1" Body="&lt;h1&gt;Show an integer, in digits of your choice&lt;/h1&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;A string representing digit characters, and a nonnegative integer.&lt;/p&gt;&#xA;&lt;h2&gt;How?&lt;/h2&gt;&#xA;&lt;p&gt;We shall show the integer in &lt;a href=&quot;https://en.wikipedia.org/wiki/Positional_notation&quot; rel=&quot;nofollow noreferrer&quot;&gt;positional notation&lt;/a&gt;, where the string has the digit characters. Assuming the string is zero-indexed, the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th character shall represent &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;. The length of the string is the base.&lt;/p&gt;&#xA;&lt;p&gt;For example, &lt;code&gt;&amp;quot;0123456789&amp;quot;&lt;/code&gt; will show the integer in the standard decimal representation.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The string is assumed to have at least 2 characters.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Invalid inputs fall in &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;Beware of the zero!&lt;/p&gt;&#xA;&lt;h3&gt;Binary representation&lt;/h3&gt;&#xA;&lt;p&gt;Given &lt;code&gt;&amp;quot;01&amp;quot;&lt;/code&gt; as the string:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{array}{c|c}&#xA;0 &amp;amp; “0” \\&#xA;4 &amp;amp; “100” \\&#xA;8 &amp;amp; “1000” \\&#xA;15 &amp;amp; “1111” \\&#xA;16 &amp;amp; “10000” \\&#xA;23 &amp;amp; “10111” \\&#xA;42 &amp;amp; “101010”&#xA;\end{array}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Devanagari representation&lt;/h3&gt;&#xA;&lt;p&gt;Given &lt;code&gt;&amp;quot;०१२३४५६७८९&amp;quot;&lt;/code&gt; (U+0966 – U+096F) as the string:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{array}{c|c}&#xA;0 &amp;amp; “०” \\&#xA;4 &amp;amp; “४” \\&#xA;8 &amp;amp; “८” \\&#xA;15 &amp;amp; “१५” \\&#xA;16 &amp;amp; “१६” \\&#xA;23 &amp;amp; “२३” \\&#xA;42 &amp;amp; “४२”&#xA;\end{array}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Duodecimal representation&lt;/h3&gt;&#xA;&lt;p&gt;Given &lt;code&gt;&amp;quot;0123456789↊↋&amp;quot;&lt;/code&gt; (The last two characters are U+218A and U+218B) as the string:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{array}{c|c}&#xA;0 &amp;amp; “0” \\&#xA;4 &amp;amp; “4” \\&#xA;8 &amp;amp; “8” \\&#xA;15 &amp;amp; “13” \\&#xA;16 &amp;amp; “14” \\&#xA;23 &amp;amp; “1↋” \\&#xA;42 &amp;amp; “36”&#xA;\end{array}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Ungolfed solution&lt;/h2&gt;&#xA;&lt;h3&gt;Haskell&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;showIntArb :: String -&amp;gt; Int -&amp;gt; ShowS&#xA;showIntArb &amp;quot;&amp;quot; _ = error &amp;quot;showIntArb: No given digit&amp;quot;&#xA;showIntArb (d:_) 0 = showChar d&#xA;showIntArb ds n = let&#xA;    appendDigit ints = if length ints &amp;lt;= n&#xA;        then appendDigit $ do&#xA;            d &amp;lt;- ds&#xA;            int &amp;lt;- ints&#xA;            return (d : int)&#xA;        else ints&#xA;    in showString (appendDigit (fmap return ds) !! n)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="89459" LastActivityDate="2020-08-23T11:15:43.630" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19260" PostTypeId="2" ParentId="2140" CreationDate="2020-08-24T03:29:52.823" Score="-1" Body="&lt;h1&gt;Anti-codegolf, unique characters&lt;/h1&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Write a program/method whose source code's characters are unique. You shall put as many characters as you can.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;There is no input.&lt;/p&gt;&#xA;&lt;h2&gt;Valid characters&lt;/h2&gt;&#xA;&lt;p&gt;All characters are identified by their Unicode code point. The following characters are invalid, and shall not appear in the source code nor the output:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;C0 and C1 control characters (U+0000 – U+001F and U+0080 – U+009F) except Character Tabulation (U+0009), Line Feed (U+000A), Line Tabulation (U+000B), Form Feed (U+000C), Carriage Return (U+000D), and Next Line (U+0085)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Outputting these characters are banned, even if they have special effect on an output stream.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Low and High surrogates (U+D800 – U+DFFF)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Noncharacters (U+FDD0 – U+FDEF, and U+xxFFFE and U+xxFFFF for xx = 00 – 10)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Code points that are outside of U+0000 – U+10FFFF&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;A character is valid otherwise. In particular, whitespaces, combining characters, and private uses, and even &lt;strong&gt;reserved characters&lt;/strong&gt; are valid.&lt;/p&gt;&#xA;&lt;h2&gt;Restrictions and output&lt;/h2&gt;&#xA;&lt;p&gt;Your program shall halt.&lt;/p&gt;&#xA;&lt;p&gt;The output shall be a string. This includes string returned by a function, or string printed to &lt;code&gt;stdout&lt;/code&gt;, &lt;code&gt;stderr&lt;/code&gt;, a file, or a dialog box.&lt;/p&gt;&#xA;&lt;p&gt;The set of the characters in the source code shall be a subset of the set of the characters in the output. Note that the output doesn't need to consist of unique characters.&lt;/p&gt;&#xA;&lt;p&gt;The output may be arbitrarily many strings, for which their concateration will be considered for the restriction above.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;This is an anti-codegolf. The submission with the longest source code wins.&lt;/p&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2020-08-24T05:45:13.400" LastActivityDate="2020-08-24T05:45:13.400" CommentCount="25" ContentLicense="CC BY-SA 4.0" />
  <row Id="19262" PostTypeId="2" ParentId="2140" CreationDate="2020-08-24T16:40:07.817" Score="1" Body="&lt;h1&gt;Haiku Quine&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;A haiku is a type of poetry originating from Japan following a simple pattern: 5 syllables on the first line, 7 syllables on the second, and 5 syllables on the third. Traditionally, haikus also include some reference to nature or seasons, but we'll ignore tradition for the sake of this challenge.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to create a quine which has some reasonable pronunciation in the form of a haiku.&lt;/p&gt;&#xA;&lt;p&gt;For example, consider this loophole-abusing (and thus non-competing) Python quine:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0+0&#xA;with open(__file__) as fp:&#xA;    print(fp.read())&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;To be read as:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ze-ro plus ze-ro&#xA;with o-pen file as F P&#xA;print F P dot read&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Rules and Scoring&lt;/h1&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code wins.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard rules and banned loopholes apply&lt;/li&gt;&#xA;&lt;li&gt;Include a reasonable haiku pronunciation alongside your code (yes, this is inherently subjective and open-ended)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;NOTE: may be better as a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="45613" LastActivityDate="2020-08-24T16:40:07.817" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19264" PostTypeId="2" ParentId="2140" CreationDate="2020-08-25T03:39:21.160" Score="1" Body="&lt;h1&gt;Convert A String To Shorthand&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Shorthand&quot; rel=&quot;nofollow noreferrer&quot;&gt;Shorthand&lt;/a&gt; has been used for hundreds of years to compress and speed up the speed at which someone can write down what is said.&lt;br /&gt;&#xA;It does this using several abbreviating methods; three of which will be used here to compress a sentence.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;When given a sentence, alongside a set of 'briefs', 'prefixes' and 'suffixes' (&lt;em&gt;defined below&lt;/em&gt;), print or return the sentence in its compressed form.&lt;/p&gt;&#xA;&lt;h3&gt;Definitions&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Brief&lt;/strong&gt;: A word that can be entirely substituted by another string of characters.&lt;br /&gt;&#xA;&lt;em&gt;I.E. Would: D, Be: B, Able: Ab. &amp;quot;I would be able...&amp;quot;: &amp;quot;I D B Ab&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Prefix&lt;/strong&gt;: The beginning of a word that can be substituted by another string of characters; the prefix will either be joined or dis-joined.&lt;br /&gt;&#xA;&lt;em&gt;After(Joined): Af. Afternoon = Afnoon.&lt;br /&gt;&#xA;Enter/Inter/Intra(Dis-joined): N. Internet = N-net&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Suffix&lt;/strong&gt;: The ending of a word that can be substituted by another string of characters; the suffix will either be joined or dis-joined.&lt;br /&gt;&#xA;&lt;em&gt;ful/ify(Joined): F. Clarify = Clarf&lt;br /&gt;&#xA;ification(Dis-joined): F. Clarification = Clar-f&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Input Structure&lt;/h3&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The first input will be the sentence to be converted&lt;/li&gt;&#xA;&lt;li&gt;The second input is a collection of the briefs. Each brief is a collection itself, in which the first element represents the shortened form of that brief, while the rest of the elements are all strings that map to the brief. &lt;em&gt;Example: [ [d, would], [m, much, more], [a, at, an] ]&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;The third and fourth inputs are collections of prefixes and suffixes. The first element of each prefix/suffix is the shortened form, the second element is a flag (of your choosing) that represents whether it is joined or dis-joined. Everything else are the strings that match the prefix/suffix.&lt;br /&gt;&#xA;&lt;em&gt;Prefix: [ [af, true, after], [n, false, enter, inter, intra] ]&lt;br /&gt;&#xA;Suffix: [ [f, true, ful, ify], [f, false, ification] ]&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Sample Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;a shipment of letters was delivered to the postshop&amp;quot;, [[&amp;quot;of&amp;quot;, &amp;quot;o&amp;quot;], [&amp;quot;t&amp;quot;, &amp;quot;to&amp;quot;], [&amp;quot;was&amp;quot;, &amp;quot;os&amp;quot;], [&amp;quot;the&amp;quot;, &amp;quot;th&amp;quot;]], [[&amp;quot;sh&amp;quot;, false, &amp;quot;ship&amp;quot;], [&amp;quot;d&amp;quot;, true, &amp;quot;de&amp;quot;], [&amp;quot;po&amp;quot;, false, &amp;quot;post&amp;quot;]], [[&amp;quot;rs&amp;quot;, true, &amp;quot;ers&amp;quot;], [&amp;quot;m&amp;quot;, true, &amp;quot;ment&amp;quot;], [&amp;quot;d&amp;quot;, true, &amp;quot;ed&amp;quot;]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules, Assumptions and Freedoms&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may assume all input is lowercase letters.&lt;/li&gt;&#xA;&lt;li&gt;A brief will always take priority over prefixes and suffixes.&lt;/li&gt;&#xA;&lt;li&gt;you can indicate a dis-joined suffix/prefix however you wish, as long as you mention how you are indicating it.&lt;/li&gt;&#xA;&lt;li&gt;The input may be rearranged however you like, as long as you specify how your input is structured&lt;/li&gt;&#xA;&lt;li&gt;Output may be returned, printed or the nearest equivalent.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;a shipment of letters was delivered to the postshop&amp;quot;, [[&amp;quot;of&amp;quot;, &amp;quot;o&amp;quot;], [&amp;quot;t&amp;quot;, &amp;quot;to&amp;quot;], [&amp;quot;was&amp;quot;, &amp;quot;os&amp;quot;], [&amp;quot;the&amp;quot;, &amp;quot;th&amp;quot;]], [[&amp;quot;sh&amp;quot;, false, &amp;quot;ship&amp;quot;], [&amp;quot;d&amp;quot;, true, &amp;quot;de&amp;quot;], [&amp;quot;po&amp;quot;, false, &amp;quot;post&amp;quot;]], [[&amp;quot;rs&amp;quot;, true, &amp;quot;ers&amp;quot;], [&amp;quot;m&amp;quot;, true, &amp;quot;ment&amp;quot;], [&amp;quot;d&amp;quot;, true, &amp;quot;ed&amp;quot;]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;a sh-m o lettrs os dliverd t th po-shop&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;shorthand was once a common skill among woman&amp;quot;, [[&amp;quot;was&amp;quot;, &amp;quot;os&amp;quot;]], [[&amp;quot;sh&amp;quot;, false, &amp;quot;ship&amp;quot;, &amp;quot;short&amp;quot;], [&amp;quot;cm&amp;quot;, true, &amp;quot;com&amp;quot;]], [[&amp;quot;mn&amp;quot;, true, &amp;quot;mon&amp;quot;, &amp;quot;man&amp;quot;]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;sh-hand os once a cmmn skill among womn&amp;quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;the electrician will be able to fix it&amp;quot;, [[&amp;quot;th&amp;quot;, &amp;quot;the&amp;quot;], [&amp;quot;l&amp;quot;, &amp;quot;will&amp;quot;], [&amp;quot;b&amp;quot;, &amp;quot;be&amp;quot;], [&amp;quot;ab&amp;quot;, &amp;quot;able&amp;quot;], &amp;quot;t&amp;quot;, &amp;quot;to&amp;quot;, &amp;quot;it&amp;quot;]], [[&amp;quot;el&amp;quot;, false, &amp;quot;electr&amp;quot;]], [[&amp;quot;sh&amp;quot;, true, &amp;quot;cian&amp;quot;, &amp;quot;sion&amp;quot;]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;th el-ish l b ab t fix t&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="97730" LastActivityDate="2020-08-25T03:39:21.160" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19265" PostTypeId="2" ParentId="2140" CreationDate="2020-08-25T04:04:23.277" Score="0" Body="&lt;h1&gt;Modular Chain Compression&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;A common trope in some kolmogorov-complexity challenges is to use repeated application of the modulo operator in order to compress large integers or string hashes into some range. For example, we can squash the numbers &lt;span class=&quot;math-container&quot;&gt;\$13,4,16\$&lt;/span&gt; into &lt;span class=&quot;math-container&quot;&gt;\$0,1,2\$&lt;/span&gt; by taking each number mod &lt;span class=&quot;math-container&quot;&gt;\$7\$&lt;/span&gt; and then mod &lt;span class=&quot;math-container&quot;&gt;\$3\$&lt;/span&gt;. We call this sequence the &lt;em&gt;modular chain&lt;/em&gt; &lt;span class=&quot;math-container&quot;&gt;\$7,3\$&lt;/span&gt;. In general, reducing a number &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; by the modular chain &lt;span class=&quot;math-container&quot;&gt;\$n_1,n_2,\ldots,n_i\$&lt;/span&gt; is equivalent to evaluating&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$(((k\ \text{mod}\ n_1)\ \text{mod}\ n_2)\ \ldots\ )\ \text{mod}\ n_i$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this challenge, you will be challenged to compress an arbitrary set of integers in this way. We say the &lt;em&gt;length of the modular chain&lt;/em&gt; is the number of elements in the chain (not the number of bytes).&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;You are given a fixed set of &lt;span class=&quot;math-container&quot;&gt;\$100\$&lt;/span&gt; random 32-bit integers. Here they are:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2997344323&#xA;2062352342&#xA;1953414591&#xA;... (more on the actual post) ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Via whatever means necessary (brute-force, mathematics, etc) design a modular chain to compact these numbers into a small a range as possible. The modular chain &lt;strong&gt;must&lt;/strong&gt; have a distinct output for each input number.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;In code-golf challenges, a modular chain is usually desirable if it achieves two things:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It compacts the input numbers or hashes into a small range.&lt;/li&gt;&#xA;&lt;li&gt;It is short.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;In this spirit, your score is the sum of &lt;strong&gt;the maximum output number of your modular chain&lt;/strong&gt; and the &lt;strong&gt;length of your modular chain&lt;/strong&gt; for the given input numbers.&lt;/p&gt;&#xA;&lt;p&gt;Note an optimal modular chain could compress the input numbers into the range &lt;span class=&quot;math-container&quot;&gt;\$0 \ldots 99\$&lt;/span&gt; with a single modulo operation, making the theoretical minimum score &lt;span class=&quot;math-container&quot;&gt;\$99 + 1 = 100\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The lowest scoring answer wins. You are encouraged (but not required) to post any code, mathematical background etc. that helped you design your modular chain.&lt;/p&gt;&#xA;" OwnerUserId="48931" LastEditorUserId="48931" LastEditDate="2020-08-25T10:28:35.777" LastActivityDate="2020-08-25T10:28:35.777" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19266" PostTypeId="2" ParentId="19202" CreationDate="2020-08-25T09:48:43.760" Score="4" Body="&lt;h1&gt;&amp;quot;Consistent / non-consistent&amp;quot; or &amp;quot;non-consistent truthy / non-consistent falsy&amp;quot;, both invertible, answerer chooses&lt;/h1&gt;&#xA;&lt;p&gt;Although I feel a certain impulse to advocate for lenient rules considering my inclination to take full advantage of them, the real rationale for these defaults is reducing &lt;em&gt;uninteresting&lt;/em&gt; parts of solutions, because any solution written under these rules could be &lt;em&gt;trivially&lt;/em&gt; modified to meet stricter ones through equality checks and negations, obscuring and weighing down the clever meat of a solution, and that's no fun. Such an argument could be taken so far as to support any two disjoint sets of outputs as an acceptable method, which is clearly not acceptable, but reducing that to a simpler form &lt;em&gt;is&lt;/em&gt; interesting--or else that wouldn't be what all these challenges are about!&lt;/p&gt;&#xA;" OwnerUserId="85334" LastActivityDate="2020-08-25T09:48:43.760" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19267" PostTypeId="2" ParentId="5243" CreationDate="2020-08-25T19:01:11.597" Score="1" Body="&lt;h1&gt;Up to 450 rep for answering &lt;a href=&quot;https://codegolf.stackexchange.com/questions/110648/fewest-distinct-characters-for-turing-completeness&quot;&gt;Fewest (distinct) characters for Turing Completeness&lt;/a&gt; in Whispers&lt;/h1&gt;&#xA;&lt;p&gt;I'm offering a 150 rep bounty to anyone who posts a competitive (in my view) answer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/110648/fewest-distinct-characters-for-turing-completeness&quot;&gt;Fewest (distinct) characters for Turing Completeness&lt;/a&gt; using &lt;a href=&quot;https://github.com/cairdcoinheringaahing/Whispers&quot; rel=&quot;nofollow noreferrer&quot;&gt;Whispers&lt;/a&gt;. In addition, I will award a further 300 reputation if the answer is proven to be optimal.&lt;/p&gt;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may use any version of Whispers, but the bounty will only be awarded once total, not once per version&lt;/li&gt;&#xA;&lt;li&gt;A competitive answer means you can't just post an answer claiming a score of &amp;quot;number of Unicode characters&amp;quot;, rather it has to be an actual attempt at competing. This is subjective, but ultimately, I won't award the bounty to a low-effort answer&lt;/li&gt;&#xA;&lt;li&gt;Whispers is currently not known to be TC (I only think it is), so if it's proven to be Turing-incomplete, let me know, I'll make the latest version TC and the bounty will be up for grabs.&lt;/li&gt;&#xA;&lt;li&gt;Using the eval command &lt;code&gt;⍎&lt;/code&gt; is forbidden (to claim the bounty, not to post an answer to the challenge)&lt;/li&gt;&#xA;&lt;li&gt;Comment, or ping me in chat, to claim the bounty, as well as posting an answer to the challenge, so I can judge and award it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2020-08-31T23:32:13.023" LastActivityDate="2020-08-31T23:32:13.023" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19270" PostTypeId="2" ParentId="2140" CreationDate="2020-08-26T12:43:12.517" Score="1" Body="&lt;h1&gt;Keep the symmetry&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;SANDBOX: I am aware that the language in this challenge, as it stands, is quite... fluffy. If anyone could help me firm it up, I would be grateful. Also, would this be better as a cops-and-robbers style challenge, where the cops are trying to make the output more symmetrical, and the robbers make it less symmetrical?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a 2D array of 1s and 0s, flip a 1 to a 0 and output the resulting array.&lt;/p&gt;&#xA;&lt;p&gt;The output array must be &amp;quot;closer to being symmetrical&amp;quot; than the input.&lt;/p&gt;&#xA;&lt;p&gt;In the case where the array is already symmetrical, it must still flip a 1 to a 0, breaking as little symmetry as possible - e.g for&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1,0,1&#xA;1,0,1&#xA;1,0,1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In the above case, changing the top-left &lt;code&gt;1&lt;/code&gt; to a &lt;code&gt;0&lt;/code&gt; will break symmetry in both directions, whereas changing the middle-left &lt;code&gt;1&lt;/code&gt; will only break symmetry one way.&lt;/p&gt;&#xA;&lt;p&gt;The output must be in the same form as the input (so that your program or function could take it in again).&lt;/p&gt;&#xA;&lt;h3&gt;What is symmetry?&lt;/h3&gt;&#xA;&lt;p&gt;I am talking about reflectional symmetry along both the horizontal and vertical axes.&lt;/p&gt;&#xA;&lt;p&gt;Where the array has an even number of entries in a row/column, the axis is between the two central rows/columns:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1,0,|,0,1&#xA;1,0,|,0,1&#xA;-,-,-,-,-&#xA;1,0,|,0,1&#xA;1,0,|,0,1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;otherwise it's down the middle of the middle row/column (and the numbers in that row/column count on both sides).&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;   |  &#xA; 1,0,1&#xA;-1,0,1-&#xA; 1,0,1&#xA;   |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Some Examples&lt;/h3&gt;&#xA;&lt;p&gt;Each pair of grids below is input .. output, which then becomes the next input, etc. iteratively:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1,0,0,1      1,0,0,1      1,0,0,1      1,0,0,1      1,0,0,0      0,0,0,0      0,0,0,0&#xA;0,0,1,0  ..  0,0,0,0  ..  0,0,0,0  ..  0,0,0,0  ..  0,0,0,0  ..  0,0,0,0  ..  0,0,0,0&#xA;1,0,0,1      1,0,0,1      0,0,0,1      0,0,0,0      0,0,0,0      0,0,0,0      0,0,0,0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;1,1,1      1,0,1      1,0,1      1,0,1      1,0,1&#xA;1,1,1  ..  1,1,1  ..  1,0,1  ..  0,0,1  ..  0,0,0&#xA;1,0,1      1,0,1      1,0,1      1,0,1      1,0,1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="62289" LastEditorUserId="62289" LastEditDate="2020-08-27T08:06:30.467" LastActivityDate="2020-08-27T08:06:30.467" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19271" PostTypeId="1" AcceptedAnswerId="19277" CreationDate="2020-08-27T02:57:05.697" Score="14" ViewCount="902" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14737/16766&quot;&gt;Language of the Month was fun.&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/16952/16766&quot;&gt;Then it died.&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/55307210#55307210&quot;&gt;Now there's interest in bringing it back!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I had assumed that we would just go back to the original nominations thread and pick the top-voted answer as LotM for September (which would be &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/16802/16766&quot;&gt;R&lt;/a&gt;, unless the voting changes significantly in the next few days). However, &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/55308157#55308157&quot;&gt;Bubbler suggested&lt;/a&gt; that maybe it would be better to start a new nomination thread, resetting the votes. I can see merit both ways:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Keeping the current thread provides continuity, avoids cluttering Meta with unnecessary threads, and gives us an immediate answer on which language to choose for September.&lt;/li&gt;&#xA;&lt;li&gt;Starting a new thread allows newer languages with active users to rise to the top. Part of what made LotM work was people who knew a language teaching it to others--but several of the nominators on the original thread aren't active here anymore.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;How shall we proceed?&lt;/p&gt;&#xA;" OwnerUserId="16766" LastActivityDate="2020-08-28T02:41:25.930" Title="Reviving Language of the Month: Pick up where we left off, or start over?" Tags="|discussion|language-of-the-month|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19272" PostTypeId="2" ParentId="19271" CreationDate="2020-08-27T08:55:36.297" Score="13" Body="&lt;h2&gt;Start a new thread&lt;/h2&gt;&#xA;&lt;p&gt;People are no longer interested in the old LotM, so we should start a new one.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Since the votes are resetted, we can easily prevent specific languages that are very popular in 2015 to get an unfair advantage in the voting, since these languages aren't necessarily popular in 2020.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;Part of the thing that made LotM work was people who knew a language teaching it to others.&lt;/code&gt; New threads mean new languages that can be introduced to others. Newly nominated languages that people haven't heard of can easily replace the voting position of the languages that people are already tired of.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerDisplayName="user96495" LastEditorDisplayName="user96495" LastEditDate="2020-08-27T09:03:09.040" LastActivityDate="2020-08-27T09:03:09.040" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19275" PostTypeId="2" ParentId="2140" CreationDate="2020-08-27T23:34:29.417" Score="0" Body="&lt;h1&gt;The fastest code to find a subset-sum&lt;/h1&gt;&#xA;&lt;p&gt;Given &lt;code&gt;k&lt;/code&gt; sorted integers from low to high, output &lt;code&gt;n&lt;/code&gt; permutations of those integers with sum as close as possible to &lt;code&gt;m&lt;/code&gt; but not exceeding &lt;code&gt;m&lt;/code&gt;. The output needs to be sorted from highest to lowest sum.&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;&lt;code&gt;k&lt;/code&gt; integers, &lt;code&gt;n&lt;/code&gt;, &lt;code&gt;m&lt;/code&gt; - as described above. All the &lt;code&gt;k&lt;/code&gt; integers and &lt;code&gt;m&lt;/code&gt; are positive 31-bit integers. Now since this is NP-complete problem, both &lt;code&gt;k&lt;/code&gt; and &lt;code&gt;n&lt;/code&gt; are small integers, 20 at most.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;One row for each premutation, with integers sorted from high to low. Also, the rows need to be sorted from highest to lowest sum&lt;/p&gt;&#xA;&lt;h1&gt;The fastest code wins&lt;/h1&gt;&#xA;&lt;p&gt;For the performance test, we will use the below input:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;k = [67, 613, 2111, 2179, 2203, 2269, 3433, 3583, 4219, 5011]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;m = 14,213&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;n = 10&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="10588" LastActivityDate="2020-08-27T23:34:29.417" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19276" PostTypeId="2" ParentId="2140" CreationDate="2020-08-27T23:47:07.267" Score="-1" Body="&lt;h1&gt;Gray codegolf&lt;/h1&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Gray_code&quot; rel=&quot;nofollow noreferrer&quot;&gt;gray code&lt;/a&gt; is a binary numeral system such that two successive values differ in only one bit.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Decimal Binary  Gray&#xA;0       0000    0000&#xA;1       0001    0001&#xA;2       0010    0011&#xA;3       0011    0010&#xA;4       0100    0110&#xA;5       0101    0111&#xA;6       0110    0101&#xA;7       0111    0100&#xA;8       1000    1100&#xA;9       1001    1101&#xA;10      1010    1111&#xA;11      1011    1110&#xA;12      1100    1010&#xA;13      1101    1011&#xA;14      1110    1001&#xA;15      1111    1000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Challange&lt;/h1&gt;&#xA;&lt;p&gt;Print the first &lt;code&gt;k&lt;/code&gt; Gray code numbers, starting from &lt;code&gt;0&lt;/code&gt;. The shortest code wins!&lt;/p&gt;&#xA;&lt;p&gt;You may choose the output format as long as it's human-readable.&lt;/p&gt;&#xA;&lt;h1&gt;Similar questions&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/32871/give-me-the-gray-code-list-of-bit-width-n&quot;&gt;Give me the Gray Code list of bit width n&lt;/a&gt; This question is not a code-golf and has different output requirements&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/4094/write-a-code-the-find-n-th-number-of-gray-code-list&quot;&gt;write a code the find n-th number of Gray Code list&lt;/a&gt; This question is a code-golf(at some point) but only asks to output one number&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="10588" LastEditorUserId="10588" LastEditDate="2020-08-28T12:28:00.883" LastActivityDate="2020-08-28T12:28:00.883" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="19277" PostTypeId="2" ParentId="19271" CreationDate="2020-08-28T02:41:25.930" Score="13" Body="&lt;h2&gt;Start a new thread, but let R be LotM for September&lt;/h2&gt;&#xA;&lt;p&gt;In the interests of having cake and also eating it:&lt;/p&gt;&#xA;&lt;p&gt;The main problem with starting a new thread is the lack of an obvious winner for September. Rather than wait a month for new nominations to be posted and garner support, we can start with the previous thread's winner. &lt;a href=&quot;https://www.r-project.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;R&lt;/strong&gt;&lt;/a&gt; is still an excellent candidate for Language of the Month. While the person who nominated it is no longer active, there are others still golfing in the language (such as &lt;a href=&quot;https://codegolf.stackexchange.com/users/67312&quot;&gt;Giuseppe&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/86301&quot;&gt;Robin Ryder&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/users/95126&quot;&gt;Dominic van Essen&lt;/a&gt;), who would doubtless be happy to share tips and tricks. It's also a practical language, which means there are lots of resources available for learning.&lt;/p&gt;&#xA;&lt;p&gt;Starting in October, there will be enough nominations and votes to pick a meaningful winner from the new thread.&lt;/p&gt;&#xA;" OwnerUserId="16766" LastActivityDate="2020-08-28T02:41:25.930" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19279" PostTypeId="1" CreationDate="2020-08-30T03:58:54.167" Score="39" ViewCount="4129" Body="&lt;p&gt;We've decided to revive the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14645/16766&quot;&gt;Language of the Month&lt;/a&gt; event. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19271/16766&quot;&gt;We've also decided&lt;/a&gt; to start a new post for nominations. (You can see the old nominations post &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14737/16766&quot;&gt;here&lt;/a&gt;.) So let's get to nominating!&lt;/p&gt;&#xA;&lt;h2&gt;Procedure&lt;/h2&gt;&#xA;&lt;p&gt;A language can be nominated for Language of the Month by posting an answer to this thread. We all vote on the languages we'd like to see featured. At the beginning of each month, the nomination with the highest net vote total is chosen as the Language of the Month. (This nomination process was modeled after &lt;a href=&quot;https://literature.meta.stackexchange.com/q/596/1091&quot;&gt;Lit.SE's reading challenges&lt;/a&gt;.)&lt;/p&gt;&#xA;&lt;p&gt;The person who nominated the language will post a new question on meta, declaring that language to be Language of the Month, with an answer to collect all related golf submissions, tips, and challenges during the month. (See the previous posts, linked below, for a good format to follow.)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the person who nominated the language is not able to make the post by the 3rd of the month, anyone else can make the post.&lt;/li&gt;&#xA;&lt;li&gt;If there is a tie in the voting, the tied language that was nominated earlier will be Language of the Month.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The chosen language will have a chatroom created for it, if it doesn't already have one. During the month, everyone who wants to participate will:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Learn the basics of the language (if they don't know it already)&lt;/li&gt;&#xA;&lt;li&gt;Answer challenges in it (new ones or old ones, doesn't matter)&lt;/li&gt;&#xA;&lt;li&gt;Try to outgolf each other's answers&lt;/li&gt;&#xA;&lt;li&gt;Discuss all of the above in the language's chatroom&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Past Languages of the Month will be added to a list at the bottom of this post. Their nomination posts should be deleted (preferably by the person who made the post) to reduce clutter.&lt;/p&gt;&#xA;&lt;h2&gt;What sort of languages should I nominate?&lt;/h2&gt;&#xA;&lt;p&gt;We hope to see a wide variety! But not every language is a good choice for Language of the Month. Some things to consider before nominating, and when voting on nominations:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It should be somewhat &lt;strong&gt;general-purpose&lt;/strong&gt; and &lt;strong&gt;possible to program in&lt;/strong&gt;. &lt;a href=&quot;http://esolangs.org/wiki/Bubblegum&quot; rel=&quot;nofollow noreferrer&quot;&gt;Bubblegum&lt;/a&gt; isn't a good choice, because it's only capable of solving a small subset of challenges. Neither is &lt;a href=&quot;http://esolangs.org/wiki/Malbolge&quot; rel=&quot;nofollow noreferrer&quot;&gt;Malbolge&lt;/a&gt; a good choice, because it's prohibitively hard to create a working program in it at all.&lt;/li&gt;&#xA;&lt;li&gt;It should &lt;strong&gt;not be one of our most commonly used languages&lt;/strong&gt; on PPCG. The point of this event is to bring attention to lesser-known languages. We don't need to bring more attention to Python or JavaScript. Suggested rule of thumb: if there are fewer than 10 PPCG users who regularly golf in this language, it's a good nomination.*&lt;/li&gt;&#xA;&lt;li&gt;It should have a &lt;strong&gt;freely available implementation&lt;/strong&gt;. This can be &lt;a href=&quot;https://tio.run/&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;, some other online source, or a downloadable interpreter/compiler.&lt;/li&gt;&#xA;&lt;li&gt;It should be fairly &lt;strong&gt;stable&lt;/strong&gt;. Most languages &lt;a href=&quot;https://docs.python.org/3/whatsnew/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;change&lt;/a&gt; over time, even &lt;a href=&quot;https://isocpp.org/std/status&quot; rel=&quot;nofollow noreferrer&quot;&gt;well-established ones&lt;/a&gt;, so this is a subjective criterion. But if a language is likely to experience significant modifications in the next month, don't nominate it yet.&lt;/li&gt;&#xA;&lt;li&gt;It can be &lt;strong&gt;either esoteric or practical&lt;/strong&gt;. Of course we like our esolangs around here, but it's also cool to study lesser-known &amp;quot;real&amp;quot; languages.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;* Better rules of thumb are welcome. Here are a couple SEDE queries for estimating how commonly a language is used: a &lt;a href=&quot;http://data.stackexchange.com/codegolf/query/796706/top-language-golfers-strict?Lang=J&quot; rel=&quot;nofollow noreferrer&quot;&gt;strict version&lt;/a&gt; (useful for languages with short names that could show up as false positives within other languages' names or URLs) and and a &lt;a href=&quot;http://data.stackexchange.com/codegolf/query/796713/top-language-golfers-loose?Lang=APL&quot; rel=&quot;nofollow noreferrer&quot;&gt;loose version&lt;/a&gt; (useful for languages whose headers frequently mention a flavor or version number with the name).&lt;/p&gt;&#xA;&lt;h2&gt;What should I include in a nomination post?&lt;/h2&gt;&#xA;&lt;p&gt;At a minimum, your nomination must include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The language's &lt;strong&gt;name&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A link to a free &lt;strong&gt;implementation&lt;/strong&gt; (or more than one, if available).&lt;/li&gt;&#xA;&lt;li&gt;A short &lt;strong&gt;description&lt;/strong&gt; of the language, for those unfamiliar with it.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Why you think&lt;/strong&gt; this would make a good Language of the Month.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Ideally, your nomination should also include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Some links to &lt;strong&gt;documentation&lt;/strong&gt; and other good resources for learning the language.&lt;/li&gt;&#xA;&lt;li&gt;A link to the language's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; question, if it has one.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You can also include ideas for one or more &lt;strong&gt;language-specific challenges&lt;/strong&gt; that will provide an interesting experience beyond answering regular challenges in this language. These can be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;fastest-code-container&quot;&gt;fastest-code&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;king-of-the-hill-container&quot;&gt;king-of-the-hill&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;answer-chaining-container&quot;&gt;answer-chaining&lt;/a&gt;... you name it. Good language-specific challenges will focus on some aspect of the language that makes it unique, such as an ability or a weakness that most other languages don't have.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Feel free to re-nominate a language that was nominated last time but never won. You can copy over the old nomination post if you like. Languages that have previously been Language of the Month are not eligible.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;List of past and current Languages of the Month&lt;/h2&gt;&#xA;&lt;h3&gt;2018&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;March:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14917/16766&quot;&gt;Brachylog&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;April:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/16116/31716&quot;&gt;Brain-Flak&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;May:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/16337/41024&quot;&gt;MATL&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;June:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/16480/16766&quot;&gt;QBasic&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;July:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/16592/61613&quot;&gt;Japt&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;August:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/16729/71434&quot;&gt;Self-modifying Brainfuck&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;2020&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;September:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19304/16766&quot;&gt;R&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;October:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19386/language-of-the-month-for-october-2020-husk&quot;&gt;Husk&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;November:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/20466/78410&quot;&gt;Forth&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;December:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/20531/16766&quot;&gt;Rust&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;2021&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;January:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/20585/language-of-the-month-for-january-2021-scala?rq=1&quot;&gt;Scala&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Feburary:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/20698/language-of-the-month-for-february-2021-whispers?cb=1&quot;&gt;Whispers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;March:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/20824/language-of-the-month-for-march-2021-factor?cb=1&quot;&gt;Factor&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;April:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/21955/language-of-the-month-for-april-2021-vim?cb=1&quot;&gt;Vim&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;May:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/22225/language-of-the-month-for-may-2021-vyxal?cb=1&quot;&gt;Vyxal&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;June:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/22414/language-of-the-month-for-june-2021-red?cb=1&quot;&gt;Red&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;July:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/23648/language-of-the-month-for-july-2021-arm?cb=1&quot;&gt;ARM&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;August:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/23743/language-of-the-month-for-august-2021-k&quot;&gt;k&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;September:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/23836/language-of-the-month-for-september-2021-jq&quot;&gt;jq&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;October:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/23916/language-of-the-month-for-october-2021-lean&quot;&gt;Lean&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;November:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/24003&quot;&gt;Zsh&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;December:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/24119&quot;&gt;BQN&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;2022&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;January:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24222/language-of-the-month-for-january-2022-add&quot;&gt;Add++&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;February:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24402/language-of-the-month-for-february-2022-tinylisp&quot;&gt;tinylisp&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;March:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24550/language-of-the-month-for-march-2022-pari-gp/&quot;&gt;PARI/GP&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;April:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24640/language-of-the-month-for-april-2022-curry&quot;&gt;Curry&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;May:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24710/language-of-the-month-for-may-2022-desmos&quot;&gt;Desmos&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;June:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24817/language-of-the-month-for-june-2022-j-uby&quot;&gt;J-uby&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;July:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24942/language-of-the-month-for-july-2022-piet&quot;&gt;Piet&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;August:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/25002/language-of-the-month-for-august-2022-knight/25003&quot;&gt;Knight&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;September:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/25082/language-of-the-month-for-september-2022-prolog&quot;&gt;Prolog&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;October:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/25181/language-of-the-month-for-october-2022-nim&quot;&gt;Nim&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;November:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/25308/language-of-the-month-for-november-2022-j&quot;&gt;J&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;December:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/25365/language-of-the-month-for-december-2022-pip&quot;&gt;Pip&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;2023&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;January:&lt;/strong&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/25442/language-of-the-month-for-january-2023-elm&quot;&gt;Elm&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Don't forget to keep nominating and voting on languages for next month!&lt;/p&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="16766" LastEditDate="2023-01-04T20:55:34.243" LastActivityDate="2023-05-12T13:31:54.713" Title="Nominations for Language of the Month, Take 2" Tags="|discussion|language-of-the-month|" AnswerCount="9" CommentCount="4" CommunityOwnedDate="2021-11-07T17:53:00.250" ContentLicense="CC BY-SA 4.0" />
  <row Id="19291" PostTypeId="2" ParentId="2140" CreationDate="2020-08-30T20:41:17.383" Score="1" Body="&lt;h1&gt;Balanced Beams&lt;/h1&gt;&#xA;&lt;p&gt;Here are some examples of beams that balance:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;X Y A   | X Y B Y&#xA;--+-----+---+---+&#xA;  |         |   |&#xA;X X   Y Y   Y X X&#xA;--+---- ----+-- +&#xA;&#xA;A X X Y | A B Y Y&#xA;+---+---+-+-----+&#xA;|   |     |     |&#xA;B A | A AAB B   A&#xA;+ --+-- --+--   +&#xA;&#xA;X Y X X | Y B   X&#xA;+-+-+---+---+----&#xA;| | |       |&#xA;Y A X Y Y X X X X&#xA;+ + + ------+----&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The diagram will always be 17 characters wide and the top beam always balances in its centre. The other &lt;code&gt;+&lt;/code&gt;s on the top beam indicate the point from which a lower beam hangs and the &lt;code&gt;+&lt;/code&gt; on the lower beam indicates the point at which it balances. Your input does not need to include the &lt;code&gt;|&lt;/code&gt;s if you don't need them. Lower beams with a width of 1 balance by default of course. The balancing of the top beam has to take the total weight of each lower beam into account.&lt;/p&gt;&#xA;&lt;p&gt;As you can see, for each example, there are two positions marked &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt; where I have forgotten whether they should be an &lt;code&gt;X&lt;/code&gt; or a &lt;code&gt;Y&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Please write a program a function which will accept the above diagram as input and output which of &lt;code&gt;X&lt;/code&gt; and &lt;code&gt;Y&lt;/code&gt; belong in each of the two positions &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your output should be something along the lines of &lt;code&gt;A=X, B=X&lt;/code&gt; although any unambiguous output suffices e.g. you could output the diagram with the &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt; substituted accordingly or you could modify the input in-place. You do not have to output values for &lt;code&gt;X&lt;/code&gt; or &lt;code&gt;Y&lt;/code&gt;, although for each diagram they always have a fixed ratio which will allow all beams to balance.&lt;/p&gt;&#xA;&lt;p&gt;Other input formats could be acceptable but they need to get suggested as comments to the sandbox post.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2020-08-30T20:41:17.383" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19292" PostTypeId="2" ParentId="2140" CreationDate="2020-08-30T21:19:44.977" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/211166/66833&quot;&gt;Implement the random Fibonacci sequence&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2020-09-16T15:20:14.023" LastActivityDate="2020-09-16T15:20:14.023" CommentCount="15" ContentLicense="CC BY-SA 4.0" />
  <row Id="19293" PostTypeId="1" AcceptedAnswerId="19294" CreationDate="2020-08-30T22:44:25.177" Score="1" ViewCount="230" Body="&lt;p&gt;U+007F, though it is not a C0 control character, Unicode still considers it as a control character. It is the &lt;strong&gt;deleted character&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If one mis-punched a character into a punched tape, one would turn it to the deleted character by punching all 7 holes. An interpreter for punched tapes would &lt;em&gt;skip&lt;/em&gt; all deleted characters. ASCII followed this convention and thus assigned 0x7F the deleted character. And Unicode followed ASCII.&lt;/p&gt;&#xA;&lt;p&gt;Following this convention, it would mean one must &lt;em&gt;skip&lt;/em&gt; all U+007F. Does this mean U+007F doesn't contribute to a byte count at all?&lt;/p&gt;&#xA;" OwnerUserId="89459" LastActivityDate="2020-08-30T23:07:43.853" Title="Does U+007F contribute to a byte count?" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19294" PostTypeId="2" ParentId="19293" CreationDate="2020-08-30T23:07:43.853" Score="22" Body="&lt;h1&gt;It counts as one byte in ASCII, UTF-8, and any language-specific SBCS&lt;/h1&gt;&#xA;&lt;p&gt;Regardless of how the character was treated in the history, 0x7F is a perfectly valid byte value to appear in a source code file. And when we score bytes, we are essentially counting the number of bytes in the source code file. Therefore, the character 0x7F should be counted as one byte like any other byte value.&lt;/p&gt;&#xA;&lt;p&gt;Otherwise every single code-golf challenge would have &lt;strong&gt;Lenguage, 0 bytes&lt;/strong&gt;.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2020-08-30T23:07:43.853" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19295" PostTypeId="1" CreationDate="2020-08-31T00:04:41.433" Score="4" ViewCount="72" Body="&lt;p&gt;Looking at the &lt;a href=&quot;https://codegolf.stackexchange.com/tags?page=7&amp;amp;tab=popular&quot;&gt;last 3&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/tags?page=8&amp;amp;tab=popular&quot;&gt;pages of&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/tags?page=9&amp;amp;tab=popular&quot;&gt;tags&lt;/a&gt; (sorted by popular), we can see a whole bunch of tags which are used on 5 questions or less. All of the questions with 0 questions (page 9 and some on page 8) are all synonyms of other tags, so we don't have to deal with them. However, that still leaves almost 2 pages of tags which are used very sparingly. Notably, a large number of these tags are in reference to specific languages (such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/the-powder-toy&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;the-powder-toy&amp;#39;&quot; rel=&quot;tag&quot;&gt;the-powder-toy&lt;/a&gt;). I appreciate the desire to make it easier to find questions on certain topics, but the tagging system isn't designed to be hyper specific.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, I propose: we sort these tags into three &amp;quot;piles&amp;quot;: keep, synonym and delete. For those we decide to remove, &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/edit&quot;&gt;trusted users&lt;/a&gt; can edit them out of questions, and the system should remove them in due time. However, this discussion is a two-parter:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Let's decide which low-usage tags we want and which we don't&lt;/li&gt;&#xA;&lt;li&gt;More generally: should we remove all tags with 5 or fewer questions that refer to a specific language?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;I choose 5 simply because I consider that a reasonable threshold. Feel free to suggest your own thresholds if you disagree (please be reasonable).&lt;/p&gt;&#xA;&lt;p&gt;To be fully clear, the tags that would be removed if the answer to 2. is &amp;quot;yes&amp;quot; would be:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/keg&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;keg&amp;#39;&quot; rel=&quot;tag&quot;&gt;keg&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/smalltalk&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;smalltalk&amp;#39;&quot; rel=&quot;tag&quot;&gt;smalltalk&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/f%23&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;f#&amp;#39;&quot; rel=&quot;tag&quot;&gt;f#&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/vba&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;vba&amp;#39;&quot; rel=&quot;tag&quot;&gt;vba&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/the-powder-toy&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;the-powder-toy&amp;#39;&quot; rel=&quot;tag&quot;&gt;the-powder-toy&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/dc&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;dc&amp;#39;&quot; rel=&quot;tag&quot;&gt;dc&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/japt&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;japt&amp;#39;&quot; rel=&quot;tag&quot;&gt;japt&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/klein&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;klein&amp;#39;&quot; rel=&quot;tag&quot;&gt;klein&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/s.i.l.o.s&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;s.i.l.o.s&amp;#39;&quot; rel=&quot;tag&quot;&gt;s.i.l.o.s&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matl&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matl&amp;#39;&quot; rel=&quot;tag&quot;&gt;matl&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underload&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underload&amp;#39;&quot; rel=&quot;tag&quot;&gt;underload&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/j&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;j&amp;#39;&quot; rel=&quot;tag&quot;&gt;j&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/prelude&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;prelude&amp;#39;&quot; rel=&quot;tag&quot;&gt;prelude&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sed&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sed&amp;#39;&quot; rel=&quot;tag&quot;&gt;sed&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/k&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;k&amp;#39;&quot; rel=&quot;tag&quot;&gt;k&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/box-256&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;box-256&amp;#39;&quot; rel=&quot;tag&quot;&gt;box-256&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/burlesque&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;burlesque&amp;#39;&quot; rel=&quot;tag&quot;&gt;burlesque&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/swift&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;swift&amp;#39;&quot; rel=&quot;tag&quot;&gt;swift&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/lost&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;lost&amp;#39;&quot; rel=&quot;tag&quot;&gt;lost&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/starry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;starry&amp;#39;&quot; rel=&quot;tag&quot;&gt;starry&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hq9%2b&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hq9+&amp;#39;&quot; rel=&quot;tag&quot;&gt;hq9+&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matlab&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matlab&amp;#39;&quot; rel=&quot;tag&quot;&gt;matlab&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/powershell&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;powershell&amp;#39;&quot; rel=&quot;tag&quot;&gt;powershell&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/whitespace-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;whitespace-language&amp;#39;&quot; rel=&quot;tag&quot;&gt;whitespace-language&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/jelly&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;jelly&amp;#39;&quot; rel=&quot;tag&quot;&gt;jelly&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/deadfish&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;deadfish&amp;#39;&quot; rel=&quot;tag&quot;&gt;deadfish&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/octave&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;octave&amp;#39;&quot; rel=&quot;tag&quot;&gt;octave&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cubically&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cubically&amp;#39;&quot; rel=&quot;tag&quot;&gt;cubically&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/x86-family&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;x86-family&amp;#39;&quot; rel=&quot;tag&quot;&gt;x86-family&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/lua&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;lua&amp;#39;&quot; rel=&quot;tag&quot;&gt;lua&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ruby&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ruby&amp;#39;&quot; rel=&quot;tag&quot;&gt;ruby&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/bash&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;bash&amp;#39;&quot; rel=&quot;tag&quot;&gt;bash&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sql&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sql&amp;#39;&quot; rel=&quot;tag&quot;&gt;sql&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cjam&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cjam&amp;#39;&quot; rel=&quot;tag&quot;&gt;cjam&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/golf-cpu&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;golf-cpu&amp;#39;&quot; rel=&quot;tag&quot;&gt;golf-cpu&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Aside from the language specific tags, there are a whole number of tags with not many questions that could either be made into synonyms of more popular tags or just removed outright. To fully catalogue the tags with 5 or fewer questions, here they are along with my opinion with what to do with them. Feel free to suggest alternatives for any and all tags:&lt;/p&gt;&#xA;&lt;h2&gt;Synonyms&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/automaton&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;automaton&amp;#39;&quot; rel=&quot;tag&quot;&gt;automaton&lt;/a&gt; -&amp;gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cellular-automata&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cellular-automata&amp;#39;&quot; rel=&quot;tag&quot;&gt;cellular-automata&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ast-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ast-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;ast-golf&lt;/a&gt; -&amp;gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii&lt;/a&gt; -&amp;gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/printable-ascii&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;printable-ascii&amp;#39;&quot; rel=&quot;tag&quot;&gt;printable-ascii&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optical-char-recognition&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optical-char-recognition&amp;#39;&quot; rel=&quot;tag&quot;&gt;optical-char-recognition&lt;/a&gt; -&amp;gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/average&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;average&amp;#39;&quot; rel=&quot;tag&quot;&gt;average&lt;/a&gt; -&amp;gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/statistics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;statistics&amp;#39;&quot; rel=&quot;tag&quot;&gt;statistics&lt;/a&gt; or start applying this tag on more questions&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/concurrency&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;concurrency&amp;#39;&quot; rel=&quot;tag&quot;&gt;concurrency&lt;/a&gt; -&amp;gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/multi-threading&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;multi-threading&amp;#39;&quot; rel=&quot;tag&quot;&gt;multi-threading&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/connected-figure&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;connected-figure&amp;#39;&quot; rel=&quot;tag&quot;&gt;connected-figure&lt;/a&gt; -&amp;gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graph-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graph-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;graph-theory&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/steganography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;steganography&amp;#39;&quot; rel=&quot;tag&quot;&gt;steganography&lt;/a&gt; -&amp;gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cryptography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cryptography&amp;#39;&quot; rel=&quot;tag&quot;&gt;cryptography&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cards&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cards&amp;#39;&quot; rel=&quot;tag&quot;&gt;cards&lt;/a&gt;. I'm not sure what tag would be best for this. I'm currently thinking &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt;, but suggestions welcome. Bubbler has suggested &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/card-games&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;card-games&amp;#39;&quot; rel=&quot;tag&quot;&gt;card-games&lt;/a&gt; in the comments below.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Burninate&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/state-abbreviation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;state-abbreviation&amp;#39;&quot; rel=&quot;tag&quot;&gt;state-abbreviation&lt;/a&gt;. I don't see this being a helpful tag to distinguish between questions&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/repl&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;repl&amp;#39;&quot; rel=&quot;tag&quot;&gt;repl&lt;/a&gt;. One challenge, closed as a duplicate&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/challenge-writing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;challenge-writing&amp;#39;&quot; rel=&quot;tag&quot;&gt;challenge-writing&lt;/a&gt;. My personal view is that this should be a meta tag, but I'm open to disagreements&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/git&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;git&amp;#39;&quot; rel=&quot;tag&quot;&gt;git&lt;/a&gt;. Two challenges: One language-specific for git on +2 and one, not language specific, on -9&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/reverse-engineering&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;reverse-engineering&amp;#39;&quot; rel=&quot;tag&quot;&gt;reverse-engineering&lt;/a&gt;. One closed challenge on +1, and one challenge about reverse engineering. I don't think the tag is particularly necessary&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/100-little-keg-exercises&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;100-little-keg-exercises&amp;#39;&quot; rel=&quot;tag&quot;&gt;100-little-keg-exercises&lt;/a&gt;. Unless more challenges from 100 Little Keg Exercises are posted, I don't think this is especially necessary. Either way, it can be merged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/keg&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;keg&amp;#39;&quot; rel=&quot;tag&quot;&gt;keg&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/astronomy&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;astronomy&amp;#39;&quot; rel=&quot;tag&quot;&gt;astronomy&lt;/a&gt;. None of the challenges tagged are intrinsically linked with astronomy, rather inspired by it. Personally, I can agree either way with this one.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/golfing-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;golfing-language&amp;#39;&quot; rel=&quot;tag&quot;&gt;golfing-language&lt;/a&gt;. 3 of the 5 challenges are closed, and the other two are tips where &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; would work in substitute.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Keep&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/showcase&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;showcase&amp;#39;&quot; rel=&quot;tag&quot;&gt;showcase&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-memory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-memory&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-memory&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-shuffleboard&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-shuffleboard&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-shuffleboard&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/proof-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;proof-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;proof-golf&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/1p5&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;1p5&amp;#39;&quot; rel=&quot;tag&quot;&gt;1p5&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/equation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;equation&amp;#39;&quot; rel=&quot;tag&quot;&gt;equation&lt;/a&gt;, although I wouldn't be opposed to making this a synonym of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/go&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;go&amp;#39;&quot; rel=&quot;tag&quot;&gt;go&lt;/a&gt;. An argument could be made for making this a synonym of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/board-game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;board-game&amp;#39;&quot; rel=&quot;tag&quot;&gt;board-game&lt;/a&gt;, but &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot;&gt;chess&lt;/a&gt; exists as an example of a more specific version of this tag. Of course, we don't want a tage for every board game, so arguments are open.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;All other tags with 5 or fewer questions not mentioned are already synonyms.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I appreciate that this is a lot of tags, and that you might completely disagree with my opinions on any and all of the tags I've mentioned. I'd love to hear the community's views on what we should do with these tags. Whether you'd like to discuss all or one, please post either a comment or an answer, so we can clean up these tags.&lt;/p&gt;&#xA;&lt;p&gt;And, as a reminder:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;We can remove tags from questions, and they'll get auto-removed. Mods can burninate those which are too widespread to easily remove, and certain users can vote on duplicate/synonym tags&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2020-08-31T00:37:20.997" LastActivityDate="2020-08-31T03:01:30.380" Title="Can we do some tag spring cleaning?" Tags="|discussion|tags|tag-synonyms|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19296" PostTypeId="2" ParentId="19295" CreationDate="2020-08-31T03:01:30.380" Score="3" Body="&lt;h1&gt;We need to be more careful with language tags&lt;/h1&gt;&#xA;&lt;p&gt;I have a feeling that deleting a language tag for having less than X questions/challenges with it (whatever the value of X is) is not the right way to go. Rather, I want to propose a few challenge types that do warrant a language tag.&lt;/p&gt;&#xA;&lt;h3&gt;Keep the tags which have...&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a well-received challenge which only accepts answers written in that language, or&lt;/li&gt;&#xA;&lt;li&gt;a well-received challenge whose core is highly inspired by a unique or interesting feature of that language&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is just a rough proposal, and I'm open to suggestions about the wording or details. The rationale is that &lt;a href=&quot;https://codegolf.stackexchange.com/q/174677/78410&quot;&gt;Read out C variable declaration&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/q/156936/78410&quot;&gt;The cell at the end of the rainbow&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/q/126410/78410&quot;&gt;Sugar free syntax&lt;/a&gt;, as well as most &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;s and some language-feature-based &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;s, are all valid use cases for a language-specific tag in a general challenge.&lt;/p&gt;&#xA;&lt;p&gt;Specifically, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt; challenges do &lt;em&gt;not&lt;/em&gt; warrant keeping the language tag.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2020-08-31T03:01:30.380" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19298" PostTypeId="1" AcceptedAnswerId="19299" CreationDate="2020-08-31T23:52:08.907" Score="1" ViewCount="79" Body="&lt;p&gt;Phrased generally, my question is: Given a language &amp;quot;The Summer&amp;quot; and an experimental branch of it &amp;quot;The Fall&amp;quot;, should I answer a &amp;quot;Tips for golfing in The Summer&amp;quot; question with an answer written in &amp;quot;The Fall&amp;quot;?&lt;/p&gt;&#xA;&lt;p&gt;Here's my specific dilemma:&lt;/p&gt;&#xA;&lt;p&gt;I was considering adding a tip about golfing in &lt;a href=&quot;https://dotty.epfl.ch/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Dotty&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/3885/tips-for-golfing-in-scala&quot;&gt;this question&lt;/a&gt; about tips for golfing in Scala, but I'm unsure of what to do, because I don't know if a tip for Dotty should be added to a question about Scala. Even though Dotty is slated to become Scala 3, it's not quite the same language as Scala 2, and some of its features may be dropped later.&lt;/p&gt;&#xA;&lt;p&gt;The way I see it, I have 3 options:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Answer the question linked above. Pros: Potentially helps someone. Cons: Answer may be invalidated by future changes or confuse people using Scala 2.&lt;/li&gt;&#xA;&lt;li&gt;Make a question about tips for golfing in Dotty. Pros: Not polluting the original question. Cons: It's going to be even harder finding those tips, and they may later have to be moved to the original Scala question somehow.&lt;/li&gt;&#xA;&lt;li&gt;Do nothing. Pros: No harm done. Cons: I won't be able to share my vast amount of expertise with the rest of humankind.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;None of those please me. Which would you suggest?&lt;/p&gt;&#xA;&lt;p&gt;Update: Following Bubbler's advice, I have taken the second option and made my own &lt;a href=&quot;https://codegolf.stackexchange.com/questions/210491/tips-for-golfing-in-dotty&quot;&gt;question&lt;/a&gt; for Dotty.&lt;/p&gt;&#xA;" OwnerUserId="95792" LastEditorUserId="95792" LastEditDate="2020-09-02T22:40:52.763" LastActivityDate="2020-09-02T22:40:52.763" Title="Answering a tip for golfing in a specific version of a language" Tags="|discussion|specific-question|tips|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19299" PostTypeId="2" ParentId="19298" CreationDate="2020-09-01T00:25:06.677" Score="3" Body="&lt;h1&gt;Post a separate golfing tips question for Dotty, and rename it later if necessary&lt;/h1&gt;&#xA;&lt;p&gt;This has been done for &lt;a href=&quot;https://codegolf.stackexchange.com/q/2682/78410&quot;&gt;Javascript&lt;/a&gt; when &lt;a href=&quot;https://codegolf.stackexchange.com/q/37624/78410&quot;&gt;ES6&lt;/a&gt; was introduced. Also there's &lt;a href=&quot;https://codegolf.stackexchange.com/q/17732/78410&quot;&gt;Raku (formerly Perl 6)&lt;/a&gt; which diverged from &lt;a href=&quot;https://codegolf.stackexchange.com/q/5105/78410&quot;&gt;Perl&lt;/a&gt;, and also &lt;a href=&quot;https://codegolf.stackexchange.com/posts/17732/revisions&quot;&gt;the title was changed when Perl 6 was renamed to Raku&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Definitely when a language evolves, we have some new golfing tips and some deprecated ones. Skimming through the first page of Dotty docs, it looks like it has &lt;em&gt;a whole lot&lt;/em&gt; of differences from previous Scala, which seems more than enough to warrant a new tips question. When it becomes a new major release of Scala, you can rename the post's title as such.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2020-09-01T00:25:06.677" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19300" PostTypeId="2" ParentId="2140" CreationDate="2020-09-01T12:01:24.360" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210437/prime-power-switch&quot;&gt;Posted: Prime Power Switch&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="59642" LastEditorUserId="59642" LastEditDate="2020-09-01T17:35:27.990" LastActivityDate="2020-09-01T17:35:27.990" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19304" PostTypeId="1" CreationDate="2020-09-02T01:01:48.523" Score="14" ViewCount="432" Body="&lt;p&gt;In accordance with our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19271/16766&quot;&gt;meta agreement&lt;/a&gt; to restart the Language of the Month with the top-voted nomination from the old nominations list, we have a new featured language! Throughout September 2020, our Language of the Month, nominated by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/80010&quot;&gt;JayCe&lt;/a&gt;, will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://www.r-project.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;R&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;What's a Language of the Month?&lt;/h3&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/16766&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during September, those who wish to participate should learn (at least the basics of) R, use it to solve challenges, and discuss it in the &lt;a href=&quot;https://chat.stackexchange.com/rooms/112541&quot;&gt;R chat room&lt;/a&gt;. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h3&gt;Information about R&lt;/h3&gt;&#xA;&lt;p&gt;R is a free software environment for statistical computing and graphics. It compiles and runs on a wide variety of UNIX platforms, Windows and MacOS.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It is a general-purpose language, meaning it can be used to answer all questions on this site. Though to be honest, processing strings requires a bit of flexibility.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Its vectorized syntax allows for concise answers in case of multiple input.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;R is a functional programming language - almost everything is a function - including things that you would think (thanks to the parser) are just operators. This can yield some very powerful golfs, as displayed &lt;a href=&quot;https://codegolf.stackexchange.com/a/171490/67312&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Environments, combined with lexical scoping are a power feature of the language.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It is really good at plotting stuff.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And most importantly: Golfing R is fun :)&lt;/p&gt;&#xA;&lt;h3&gt;Documentation&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The official website has &lt;a href=&quot;https://cran.r-project.org/manuals.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;several online manuals&lt;/a&gt;, including &lt;a href=&quot;https://cran.r-project.org/doc/manuals/r-release/R-intro.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;An Introduction to R&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://stats.stackexchange.com/questions/138/free-resources-for-learning-r&quot;&gt;A list of resources for learning R&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/44726/16766&quot;&gt;Entry in the showcase of languages&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/4024/tips-for-golfing-in-r&quot;&gt;Golfing tips&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;(If you consider yourself knowledgeable in R and would like to help teach it to other users, feel free to join the &lt;a href=&quot;https://chat.stackexchange.com/rooms/112541&quot;&gt;R chat room&lt;/a&gt;!)&lt;/p&gt;&#xA;&lt;h3&gt;Interpreters&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://cran.r-project.org/mirrors.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Download&lt;/a&gt; for Linux, Mac OS X, or Windows&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#R&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try It Online!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://rdrr.io/snippets&quot; rel=&quot;nofollow noreferrer&quot;&gt;RDRR&lt;/a&gt; (includes most of the packages available for R)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;&lt;code&gt;cat(&amp;quot;Happy golfing!&amp;quot;)&lt;/code&gt;&lt;/h1&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="66833" LastEditDate="2020-10-01T16:41:03.530" LastActivityDate="2020-10-08T13:35:09.680" Title="Language of the Month for September 2020: R" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="19305" PostTypeId="2" ParentId="19304" CreationDate="2020-09-02T01:01:48.523" Score="4" Body="&lt;h1&gt;List of all R solutions posted in September&lt;/h1&gt;&#xA;&lt;p&gt;(First time posters highlighted in bold)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210454/spiralize-a-word-triangularly/210483#210483&quot;&gt;Spiralize a Word, Triangularly!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95126/&quot;&gt;Dominic van Essen&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210262/my-smartphones-phonebook/210406#210406&quot;&gt;My smartphone's phonebook&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95126/&quot;&gt;Dominic van Essen&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210437/prime-power-switch/210471#210471&quot;&gt;Prime Power Switch&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95126/&quot;&gt;Dominic van Essen&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210425/implement-the-polygamma-function/210432#210432&quot;&gt;Implement the Polygamma function&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95126/&quot;&gt;Dominic van Essen&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/210654/16766&quot;&gt;Output the PPCG Prime&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/&quot;&gt;DLosc&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/210679/16766&quot;&gt;Product over a range&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/210756/16766&quot;&gt;Binary to decimal converter&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210497/write-a-hello-interpreter/210529#210529&quot;&gt;Write a “Hello” interpreter&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/98085/cong-chen&quot;&gt;Cong Chen&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210809/minimum-number-of-platforms-required-for-a-railway-station/210865#210865&quot;&gt;Minimum number of platforms required for a railway station&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/98085/cong-chen&quot;&gt;Cong Chen&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/164629/split-and-capitalize/210918#210918&quot;&gt;split and capitalize&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/98085/cong-chen&quot;&gt;Cong Chen&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/211028/n-perfect-numbers/211058#211058&quot;&gt;-perfect numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95126/&quot;&gt;Dominic van Essen&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210917/connect-the-three-kingdoms/210974#210974&quot;&gt;Connect the Three Kingdoms&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95126/&quot;&gt;Dominic van Essen&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210875/avoid-walking-into-a-rectangle/210878#210878&quot;&gt;Avoid walking into a rectangle&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95126/&quot;&gt;Dominic van Essen&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210733/double-prime-words/210854#210854&quot;&gt;Double Prime Words&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95126/&quot;&gt;Dominic van Essen&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210725/approximate-when-you-are-going-to-die/210814#210814&quot;&gt;Approximate when you are going to die&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95126/&quot;&gt;Dominic van Essen&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210725/approximate-when-you-are-going-to-die/210781#210781&quot;&gt;Approximate when you are going to die&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95126/&quot;&gt;Dominic van Essen&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210770/divisible-strings/210788#210788&quot;&gt;Divisible strings&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95126/&quot;&gt;Dominic van Essen&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/150084/days-and-months-make-years/210616#210616&quot;&gt;Days and months make years&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95126/&quot;&gt;Dominic van Essen&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210572/diophantine-approximation-find-lowest-possible-denominator-to-approximate-withi/210579#210579&quot;&gt;Diophantine Approximation: find lowest possible denominator to approximate within given precision&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95126/&quot;&gt;Dominic van Essen&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/211334/80214&quot;&gt;Primes in the prime factorization&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/74544/user8617947&quot;&gt;user8617947&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/211463/80214&quot;&gt;Get thee behind me Satan-Prime!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/211723/80214&quot;&gt;Print the Greek Alphabet&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/211408/67312&quot;&gt;The Decryption Function&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/67312/giuseppe&quot;&gt;Giuseppe&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/210435/67312&quot;&gt;Implement the polygamma function&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/67312/giuseppe&quot;&gt;Giuseppe&lt;/a&gt; -- this one barely counts as a golf.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/210797/86301&quot;&gt;Approximate when you are going to die&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/86301/robin-ryder&quot;&gt;Robin Ryder&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/210808/86301&quot;&gt;Double Prime Words&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/86301/robin-ryder&quot;&gt;Robin Ryder&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/210823/86301&quot;&gt;How many of each pill to achieve the total daily dose&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/86301/robin-ryder&quot;&gt;Robin Ryder&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/211166/implement-the-random-fibonacci-sequence/211179#211179&quot;&gt;Implement the random Fibonacci sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/86301/robin-ryder&quot;&gt;Robin Ryder&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/211226/i-uppercase-the-source-code-you-reverse-the-input/211236#211236&quot;&gt;I uppercase the source code, you reverse the output!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/86301/robin-ryder&quot;&gt;Robin Ryder&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/211858/86301&quot;&gt;Is that number a Two Bit Number?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/86301/robin-ryder&quot;&gt;Robin Ryder&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; [&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr&gt;&#xA;&lt;h1&gt;List of &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=inquestion%3A4024+created%3A2020-09-01..2020-09-30+is%3Aanswer&quot;&gt;all R tips posted&lt;/a&gt; in September&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;tip title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;List of R-related challenges posted in September&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/q/&amp;lt;question-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="86301" LastEditDate="2020-10-08T13:35:09.680" LastActivityDate="2020-10-08T13:35:09.680" CommentCount="3" CommunityOwnedDate="2020-09-03T00:36:56.507" ContentLicense="CC BY-SA 4.0" />
  <row Id="19309" PostTypeId="2" ParentId="2140" CreationDate="2020-09-03T04:30:35.340" Score="3" Body="&lt;h1&gt;Brainfuck arbitrary precision multiplication&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brainfuck&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brainfuck&amp;#39;&quot; rel=&quot;tag&quot;&gt;brainfuck&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Goal&lt;/h2&gt;&#xA;&lt;p&gt;The goal is to multiply two numbers in the shortest amount of cycle.&lt;/p&gt;&#xA;&lt;h2&gt;The Input&lt;/h2&gt;&#xA;&lt;p&gt;The input is two numbers written decimally separated by a space. The number is NOT restricted by the size of the integer inside of the cells. The program must accept arbitrary sized integer&lt;/p&gt;&#xA;&lt;h2&gt;The Output&lt;/h2&gt;&#xA;&lt;p&gt;The output is a single integer written decimally.&lt;/p&gt;&#xA;&lt;h2&gt;Brainfuck variants used&lt;/h2&gt;&#xA;&lt;p&gt;Since the flavors of the Brainfuck is important in this challenge, you are required to use this flavor&lt;/p&gt;&#xA;&lt;h3&gt;Memory&lt;/h3&gt;&#xA;&lt;p&gt;The memory is an array of cells, unbounded to the left and the right, with 8-bit integer as the contents.&lt;/p&gt;&#xA;&lt;h3&gt;Input/Output&lt;/h3&gt;&#xA;&lt;p&gt;The input and the output uses ASCII symbol mapping. EOF is interpreted as \0 char.&lt;/p&gt;&#xA;&lt;h3&gt;Looping&lt;/h3&gt;&#xA;&lt;p&gt;The [ means that &amp;quot;check the current cell. If it's zero, jump to the instruction after the matching ]&amp;quot;&#xA;The ] means that &amp;quot;jump to the matching [.&amp;quot; no cycle is taken in this instruction.&lt;/p&gt;&#xA;&lt;h3&gt;Cycle&lt;/h3&gt;&#xA;&lt;p&gt;Every instruction takes a single cycle every time it's executed except for ]. ] is a free instruction.&lt;/p&gt;&#xA;&lt;h3&gt;Reference implementation&lt;/h3&gt;&#xA;&lt;p&gt;For the reference implementation, use copy.sh with this option:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Cell size (Bits): 8&lt;/li&gt;&#xA;&lt;li&gt;Dynamic (infinite) Memory: yes&lt;/li&gt;&#xA;&lt;li&gt;End of input: char: \0&lt;/li&gt;&#xA;&lt;li&gt;Count instructions&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;The winner is the program that is: (later number is for tiebreaker)&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The program with lowest computational complexity (counted by using cycle metric as explained above, and in x where x is the length of the largest input in base 10) is the winner.&lt;/li&gt;&#xA;&lt;li&gt;The program with lowest space complexity (counted by finding the rightmost cell reached by program)&lt;/li&gt;&#xA;&lt;li&gt;The program that takes the least cycle to execute 1234567890*987654321&lt;/li&gt;&#xA;&lt;li&gt;The program that takes the least memory to execute 1234567890*987654321&lt;/li&gt;&#xA;&lt;li&gt;The shortest code&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Computational complexity is determined in terms of the number of digits each arguments have.&lt;/p&gt;&#xA;" OwnerUserId="46245" LastEditorUserId="46245" LastEditDate="2020-11-07T11:58:57.193" LastActivityDate="2020-11-07T11:58:57.193" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="19310" PostTypeId="2" ParentId="2140" CreationDate="2020-09-03T09:21:25.697" Score="3" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/218690/69850&quot;&gt;BF memory layout optimizer&lt;/a&gt; (posted).&lt;/h2&gt;&#xA;&lt;p&gt;See the notes in the revision history.&lt;/p&gt;&#xA;&lt;p&gt;[&lt;em&gt;please review other sandbox posts&lt;/em&gt;]&lt;/p&gt;&#xA;" OwnerUserId="69850" LastEditorUserId="69850" LastEditDate="2021-02-08T02:36:38.193" LastActivityDate="2021-02-08T02:36:38.193" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19311" PostTypeId="1" CreationDate="2020-09-03T13:51:52.833" Score="8" ViewCount="88" Body="&lt;p&gt;When the code contains the characters &lt;code&gt;\[&lt;/code&gt;, the preview shows everything else as LateX even though it is inside the `` section. This is how the preview looks like:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/NogdX.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/NogdX.png&quot; alt=&quot;first&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is how the submission actually looks like:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/i1cAE.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/i1cAE.png&quot; alt=&quot;second&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="92080" LastEditorUserId="68942" LastEditDate="2021-06-01T23:42:50.310" LastActivityDate="2021-06-01T23:42:50.310" Title="`\[` in code triggers LateX in preview" Tags="|bug|status-reproduced|formatting|latex|search|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19315" PostTypeId="2" ParentId="2140" CreationDate="2020-09-05T14:20:54.940" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Sandbox Question&lt;/h3&gt;&#xA;&lt;p&gt;Do people think this is worth posting, given it only really requires a prime check along with getting digit prefixes? There are multiple implementations (possibly including hard-coding in some languages) to consider which might be enough. Please vote!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Produce all 83 base-ten right-truncatable primes in as few bytes as possible in the language of your choice.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Order is irrelevant, but the production &lt;strong&gt;must&lt;/strong&gt; terminate.&lt;/li&gt;&#xA;&lt;li&gt;You may produce a list, a set, or an equivalent object.&lt;/li&gt;&#xA;&lt;li&gt;You may print them (e.g. space-separated, each on a line, or formatted as a list or set (e.g. &lt;code&gt;{2; 3; 293; 5; ...}&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;You may give the numbers themselves as strings.&lt;/li&gt;&#xA;&lt;li&gt;You may produce an iterator (but evaluating it must terminate).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Right truncatable primes&lt;/h3&gt;&#xA;&lt;p&gt;A right truncatable prime is a prime for which removing any number of trailing decimal digits is also prime.&lt;br /&gt;&#xA;For example, &lt;span class=&quot;math-container&quot;&gt;\$7193\$&lt;/span&gt; is a right truncatable prime since &lt;span class=&quot;math-container&quot;&gt;\$719\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$71\$&lt;/span&gt;, and &lt;span class=&quot;math-container&quot;&gt;\$7\$&lt;/span&gt; are all prime.&lt;/p&gt;&#xA;&lt;p&gt;There are only 83 such numbers in base-ten, when sorted they are:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[2, 3, 5, 7, 23, 29, 31, 37, 53, 59, 71, 73, 79, 233, 239, 293, 311, 313, 317, 373, 379, 593, 599, 719, 733, 739, 797, 2333, 2339, 2393, 2399, 2939, 3119, 3137, 3733, 3739, 3793, 3797, 5939, 7193, 7331, 7333, 7393, 23333, 23339, 23399, 23993, 29399, 31193, 31379, 37337, 37339, 37397, 59393, 59399, 71933, 73331, 73939, 233993, 239933, 293999, 373379, 373393, 593933, 593993, 719333, 739391, 739393, 739397, 739399, 2339933, 2399333, 2939999, 3733799, 5939333, 7393913, 7393931, 7393933, 23399339, 29399999, 37337999, 59393339, 73939133]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://oeis.org/A024770&quot; rel=&quot;nofollow noreferrer&quot;&gt;A024770&lt;/a&gt; in the Online Encyclopedia of Integer Sequences.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;For some mathematician-written* Python see &lt;a href=&quot;https://youtu.be/f2lEB4nMmyI&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://youtu.be/f2lEB4nMmyI&lt;/a&gt;.&lt;br /&gt;&#xA;* Fair warning, it might well make you cringe.&lt;/p&gt;&#xA;" OwnerUserId="53748" LastActivityDate="2020-09-05T14:20:54.940" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19316" PostTypeId="1" CreationDate="2020-09-07T00:53:33.750" Score="11" ViewCount="411" Body="&lt;p&gt;The &lt;a href=&quot;https://www.desmos.com/calculator&quot; rel=&quot;nofollow noreferrer&quot;&gt;Desmos graphing calculator&lt;/a&gt;, commonly referred to as just Desmos&lt;sup&gt;1&lt;/sup&gt;, has been used for a number of answers, by me as well as others. However, scoring (as well as I/O, but that's for another post) expressions&lt;sup&gt;2&lt;/sup&gt; has never been really well standardized. Let's review some of the functionality of them first:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Desmos accepts input from the keyboard, automatically converting it to TeX-like code. For example, typing &lt;code&gt;s&lt;/code&gt; &lt;code&gt;q&lt;/code&gt; &lt;code&gt;r&lt;/code&gt; &lt;code&gt;t&lt;/code&gt; &lt;code&gt;5&lt;/code&gt; gets converted to &lt;code&gt;\sqrt{5}&lt;/code&gt;, stylized as &lt;span class=&quot;math-container&quot;&gt;\$\sqrt{5}\$&lt;/span&gt;, as soon as the &lt;code&gt;t&lt;/code&gt; is typed.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Desmos allows you to copy text out of the input boxes. For example, copying out the above code will put &lt;code&gt;\sqrt{5}&lt;/code&gt; on your clipboard.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Desmos allow you to copy input from your clipboard, as long as it comes close to conforming with the stylized code that will be output. For example, if &lt;code&gt;\sqrt{5}&lt;/code&gt; is on your clipboard, you can paste it in to get &lt;span class=&quot;math-container&quot;&gt;\$\sqrt{5}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7077/96155&quot;&gt;This answer&lt;/a&gt; formalized Desmos as a language and stated that &amp;quot;the string you get from copying the program out of Desmos is the most reproducible/verifiable option for measuring program size.&amp;quot; This is all fine and good for the &lt;code&gt;\sqrt{5}&lt;/code&gt; example, it seems clear that the code is not &lt;code&gt;s&lt;/code&gt; &lt;code&gt;q&lt;/code&gt; &lt;code&gt;r&lt;/code&gt; &lt;code&gt;t&lt;/code&gt; &lt;code&gt;5&lt;/code&gt; and so the code should be &lt;code&gt;\sqrt{5}&lt;/code&gt;. However, there are some more complications:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Arrays such as &lt;code&gt;[1,4,7,2]&lt;/code&gt; are copied out as &lt;code&gt;\left[1,4,7,2\right]&lt;/code&gt;, but can be copied in as &lt;code&gt;[1,4,7,2]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Instances of functions using a simple argument, like &lt;code&gt;sin 42&lt;/code&gt;, are copied out like &lt;code&gt;\sin42&lt;/code&gt; but can be copied in like &lt;code&gt;sin42&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Simple functions, like &lt;code&gt;sin(42)&lt;/code&gt;, are copied out like &lt;code&gt;\sin\left(42\right)&lt;/code&gt;, but can be copied in like &lt;code&gt;sin\left(42\right)&lt;/code&gt;, &lt;code&gt;\sin(42)&lt;/code&gt;, or &lt;code&gt;sin(42)&lt;/code&gt;. Note that these are not all exactly the same: when the &lt;code&gt;\left&lt;/code&gt; and &lt;code&gt;\right&lt;/code&gt; are excluded, the functionality is the same, but the &lt;code&gt;(&lt;/code&gt; are literal (s instead of formatted &lt;span class=&quot;math-container&quot;&gt;\$(\$&lt;/span&gt;s, which mean that changing the code once it's pasted in like such sometimes requires replacing all those (s with &lt;span class=&quot;math-container&quot;&gt;\$(\$&lt;/span&gt;s by manually re-typing them to make it work.&lt;/li&gt;&#xA;&lt;li&gt;More unusual functions, like &lt;code&gt;mod(45,4)&lt;/code&gt;, are copied out as &lt;code&gt;\operatorname{mod}\left(45,4\right)&lt;/code&gt; (yikes, those bytes!), but can be copied in as &lt;code&gt;mod(45,4)&lt;/code&gt; (with the &lt;code&gt;\left&lt;/code&gt;/&lt;code&gt;\right&lt;/code&gt; note above still applying)&lt;/li&gt;&#xA;&lt;li&gt;Some things can be copied out, but not typed in. For example, typing in &lt;code&gt;y&lt;/code&gt; &lt;code&gt;/&lt;/code&gt; &lt;code&gt;x&lt;/code&gt; gives &lt;span class=&quot;math-container&quot;&gt;\$\frac{y}{x}\$&lt;/span&gt;, encoded as &lt;code&gt;\frac{y}{x}&lt;/code&gt;. However, pasting in &lt;code&gt;y/x&lt;/code&gt; gives &lt;span class=&quot;math-container&quot;&gt;\$y/x\$&lt;/span&gt;, which copies out as &lt;code&gt;y/x&lt;/code&gt; and functions the same as &lt;code&gt;\frac{y}{x}&lt;/code&gt;. &lt;code&gt;&amp;lt;=&lt;/code&gt; has similar functionality, being converted to &lt;span class=&quot;math-container&quot;&gt;\$\le\$&lt;/span&gt;, encoded as &lt;code&gt;\le&lt;/code&gt;, but can be copied in and then out as just &lt;code&gt;&amp;lt;=&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;As a side note, when using restrictions like &lt;code&gt;{y&amp;gt;1}&lt;/code&gt; in &lt;code&gt;x&amp;gt;1{y&amp;gt;1}&lt;/code&gt;, they're encoded as &lt;code&gt;x&amp;gt;1\left\{y&amp;gt;1\right\}&lt;/code&gt;, and can't be simplified.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Because of all these differences, code copied out is always larger or equal to code copied in in size, so I've been using the latter for my answers. However, this seems to go against the wording of that answer. I would argue that the intent of that wording as to clarify that it's the &lt;em&gt;code text&lt;/em&gt;, not the &lt;em&gt;keystrokes&lt;/em&gt; that determines byte count, making the whole thing ambiguous. Furthermore, I believe the examples I've shown make it clear that the code copied &lt;em&gt;in&lt;/em&gt; is the most simplest, most reproducible, and, for what it's worth, most golf-y version of the code. Requiring that the code copied out be used would sometimes add an extra step: Code your program is Desmos, copy it out and manually golf it in a text editor to fix &lt;code&gt;/&lt;/code&gt;s and &lt;code&gt;&amp;lt;=&lt;/code&gt;/&lt;code&gt;&amp;gt;=&lt;/code&gt;s (among potentially some other things that I haven't investigated yet), copy it back into Desmos, and then copy that result out (normally, you'd end with copying it in to make sure it works).&lt;/p&gt;&#xA;&lt;p&gt;I'd also like to make a more fundamental argument for this: when one refers to &amp;quot;code&amp;quot; in the general sense (i.e., excluding particularly strange cases like Minecraft redstone), you're generally referring to text that is then fed to a compiler/interpreter/magic box, which either runs it or produces a binary file that can be run. In this sense, the &amp;quot;code&amp;quot; of Desmos must be what you input to the program.&lt;/p&gt;&#xA;&lt;p&gt;So here's my proposal: Desmos expressions should be scored as the number of bytes in the text which is pasted into the equation box to produce the program. Feel free to disagree or comment with alternate proposals.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;2&lt;/sup&gt;This is referring specifically to what you get when typing into one of the boxes on the left (which is what almost all of the Desmos answers here are). Things like notes, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9303/96155&quot;&gt;tables&lt;/a&gt;, folders, images, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17587/how-do-we-score-colors-in-desmos&quot;&gt;colors&lt;/a&gt;, styles, viewboxes, radians/degrees mode, axes, reverse contrast mode, braille mode, and anything else is beyond the scope of this question. There's enough here as it is.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt;Note that there are some other tools that Desmos provides, such as a &lt;a href=&quot;https://www.desmos.com/matrix&quot; rel=&quot;nofollow noreferrer&quot;&gt;matrix calculator&lt;/a&gt;, a &lt;a href=&quot;https://www.desmos.com/scientific&quot; rel=&quot;nofollow noreferrer&quot;&gt;scientific calculator&lt;/a&gt;, and a &lt;a href=&quot;https://www.desmos.com/geometry&quot; rel=&quot;nofollow noreferrer&quot;&gt;geometry tool&lt;/a&gt;, but I've never seen an answer using any of these and they don't seem especially interesting from a coding perspective.&lt;/p&gt;&#xA;" OwnerUserId="96155" LastEditorUserId="66833" LastEditDate="2020-09-07T01:10:34.447" LastActivityDate="2020-09-07T01:41:30.267" Title="Scoring Desmos equations" Tags="|discussion|scoring|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19317" PostTypeId="2" ParentId="19316" CreationDate="2020-09-07T01:41:30.267" Score="14" Body="&lt;h1&gt;Mostly agree with the proposal, but let's make it more formal&lt;/h1&gt;&#xA;&lt;p&gt;Here is a more formal version of the proposal:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A valid Desmos program is a piece of code that works when copy-pasted into the equation box (the &amp;quot;code area&amp;quot;) as plain text without further modification (such as manually correcting the parens).&lt;/li&gt;&#xA;&lt;li&gt;The score of the program is the number of bytes in its original plain text form - in OP's words, the &lt;em&gt;copy in&lt;/em&gt; version.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Some reasons to accept the &amp;quot;valid program&amp;quot; condition:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Some answers in Excel (and possibly some other languages) use its auto-correction feature to omit closing parentheses. Desmos auto-correcting &lt;code&gt;sin42&lt;/code&gt; to &lt;code&gt;\sin 42&lt;/code&gt; can be considered the same way.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;As the OP already pointed out,&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;when one refers to &amp;quot;code&amp;quot; in the general sense (i.e., excluding particularly strange cases like Minecraft redstone), you're generally referring to text that is then fed to a compiler/interpreter/magic box, which either runs it or produces a binary file that can be run.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The only way to feed whole code (as opposed to character-by-character) into Desmos interpreter is copy-pasting it into the equation box.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2020-09-07T01:41:30.267" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19318" PostTypeId="2" ParentId="2140" CreationDate="2020-09-07T03:12:07.203" Score="-1" Body="&lt;h1&gt;B-a-NaN-a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://stackoverflow.com/a/57456236/8507259&quot;&gt;Somewhat famously&lt;/a&gt;, &lt;code&gt;'B' + 'a' + + 'a' + 'a'&lt;/code&gt; returns &lt;code&gt;BaNaNa&lt;/code&gt; in Javascript. You goal is to output precisely &lt;code&gt;BaNaNa&lt;/code&gt;. However, to keep it more in the style of the original Javascript, you may not use:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The bytes 78 or 110&lt;/li&gt;&#xA;&lt;li&gt;Whatever &lt;code&gt;n&lt;/code&gt; or &lt;code&gt;N&lt;/code&gt; are encoded as if your language uses a special encoding, or&lt;/li&gt;&#xA;&lt;li&gt;Any string literal containing the characters &lt;code&gt;n&lt;/code&gt; or &lt;code&gt;N&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;in your source code.&lt;/p&gt;&#xA;&lt;p&gt;As a special note, I'd like your feedback as to if restricting numeric literals equal to 78 and 110 would be any good.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, this is my first question, and I'm aware that 'Do X without Y' is officially not super popular these days, but I frankly quite enjoy them, so I have no idea if this will be well-received or not. I'm hoping that the reference to the JS quirk is enough to make it interesting.&lt;/p&gt;&#xA;" OwnerUserId="96155" LastActivityDate="2020-09-07T03:12:07.203" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19319" PostTypeId="2" ParentId="2140" CreationDate="2020-09-07T07:51:29.567" Score="2" Body="&lt;p&gt;&lt;em&gt;Sandbox note: This is partially inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/q/210638/48931&quot;&gt;There's a fault in my vault!&lt;/a&gt;, which I thought had some interesting ideas in it. This is my effort to frame those ideas in a clearer fashion.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Cops/Robbers: Create a weak block cipher&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cryptography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cryptography&amp;#39;&quot; rel=&quot;tag&quot;&gt;cryptography&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In cryptography, we often use &lt;strong&gt;block ciphers&lt;/strong&gt;, which are a form of keyed encryption. More specifically, for a plain text string &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; and a secret key &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;, we design an &lt;strong&gt;encryption function&lt;/strong&gt; &lt;span class=&quot;math-container&quot;&gt;\$E(s, k)\$&lt;/span&gt; and a &lt;strong&gt;decryption function&lt;/strong&gt; &lt;span class=&quot;math-container&quot;&gt;\$D(\hat{s}, k)\$&lt;/span&gt; such that if we encrypt and then decrypt the text with the same key, we get back our original text. That is, we have &lt;span class=&quot;math-container&quot;&gt;\$D(E(s,k),k) = s\$&lt;/span&gt; for all possible strings &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;One security property a good block cipher has is that it is resistant against &lt;strong&gt;key-recovery attacks&lt;/strong&gt;. This means that if we have the ability to run &lt;span class=&quot;math-container&quot;&gt;\$E(s, k)\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$D(\hat{s}, k)\$&lt;/span&gt; for various choices of &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\hat{s}\$&lt;/span&gt; and collect pairs of encrypted and decrypted text we cannot tell what the key is.&lt;/p&gt;&#xA;&lt;p&gt;In this challenge, you will design a simple block cipher that is &lt;em&gt;intentionally vulnerable&lt;/em&gt; to a key recovery attack, and challenge others to try and exploit it.&lt;/p&gt;&#xA;&lt;h2&gt;The Cops' Challenge&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;strong&gt;Design a block cipher.&lt;/strong&gt; Design an encryption function &lt;span class=&quot;math-container&quot;&gt;\$E(s,K)\$&lt;/span&gt; and decryption function &lt;span class=&quot;math-container&quot;&gt;\$D(\hat{s},k)\$&lt;/span&gt; that take strings (or your language's closest equivalent) of a fixed length &lt;span class=&quot;math-container&quot;&gt;\$16\$&lt;/span&gt; bytes and a key of fixed length &lt;span class=&quot;math-container&quot;&gt;\$16\$&lt;/span&gt; bytes and outputs a string of length &lt;span class=&quot;math-container&quot;&gt;\$16\$&lt;/span&gt; bytes. Your &lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt; functions &lt;strong&gt;must&lt;/strong&gt; have the property that &lt;span class=&quot;math-container&quot;&gt;\$D(E(s,k),k) = s\$&lt;/span&gt; for &lt;strong&gt;all&lt;/strong&gt; 16-byte strings &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;.&lt;sup&gt;1&lt;/sup&gt; The functions must be deterministic (not use any randomness) and pure (not rely on any outside state). Your &lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt; must work within the integer/float precision of your language. Specifically, you may not treat floating point as if it's arbitrary precision, nor may you assume integers of arbitrary size if your language utilizes fixed-size integers.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Implement a secret key-recovery attack on your block cipher.&lt;/strong&gt; Write a program that makes calls to &lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt; for a secret, unknown key &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; and fully recovers the key by observing properties of the input/output pairs. The key must be recovered with probability &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; - you may not rely on probabilistic approaches.&lt;sup&gt;2&lt;/sup&gt; You &lt;strong&gt;must&lt;/strong&gt; treat &lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt; as black boxes, from which you can only observe their input and output. This means you must &lt;strong&gt;not&lt;/strong&gt; utilize runtime introspection, timing information, or other side effects of the implementation. You &lt;strong&gt;must&lt;/strong&gt; only pass full &lt;span class=&quot;math-container&quot;&gt;\$16\$&lt;/span&gt; byte strings to &lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt;, and not any other type. This means you may not rely on special objects with overloaded operators or similar to glean information about how the input is processed by &lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt;. Your attack &lt;strong&gt;may&lt;/strong&gt; be adaptive, in that it decides which strings to pass in based on outputs to previous strings. To enforce a practicality limit, your attack &lt;strong&gt;must&lt;/strong&gt; work for a combined total of strictly less than &lt;span class=&quot;math-container&quot;&gt;\$2^{16}\ = 65536\$&lt;/span&gt; calls to &lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt; for any key &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;. If the block cipher you design has the property that for keys &lt;span class=&quot;math-container&quot;&gt;\$k_1\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$k_2\$&lt;/span&gt; that &lt;span class=&quot;math-container&quot;&gt;\$E(s,k_1)=E(s,k_2)\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$D(s,k_1)=D(s,k_2)\$&lt;/span&gt; for all &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt;, then we call these keys &lt;em&gt;functionally identical&lt;/em&gt;, and your attack may recover any functionally identical key to the original.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;That's it! You will reveal both the encryption and decryption functions &lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt;, and challenge the robbers to find your key recovery attack (or possibly a different one).&lt;/p&gt;&#xA;&lt;p&gt;Clearly, the challenge is to design your &lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt; to look secure, but they have some catastrophic weakness that allow you to recover the key with very few calls. Another approach is to 'trapdoor' the function in some way only known to you. In the spirit of &lt;a href=&quot;https://en.wikipedia.org/wiki/Kerckhoffs%27s_principle&quot; rel=&quot;nofollow noreferrer&quot;&gt;Kerckhoffs's principle&lt;/a&gt;, you are encouraged to post a short explanation of what your &lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt; do, especially if they are written in an esoteric language.&lt;/p&gt;&#xA;&lt;p&gt;You may use cryptographic functions if you wish, but using them presents several practical problems. Hashing functions are designed to be one way and your are unlikely to be able to design both an encryption and decryption function that utilizes them. Symmetric ciphers have both encryption and decryption, but is unlikely to allow the key recovery attack outlined here.&lt;/p&gt;&#xA;&lt;p&gt;If no-one mounts a successful attack in 7 days, you may post your key recovery attack and mark your answer as &lt;em&gt;safe&lt;/em&gt;, which prevents it from being cracked. Note your submission can still be cracked until your reveal your attack.&lt;/p&gt;&#xA;&lt;p&gt;Your answer is &lt;em&gt;invalid&lt;/em&gt; if you do not follow the rules set above. Your answer can be declared invalid even after it is marked safe, if it turns out your revealed attack does not obey the rules.&lt;/p&gt;&#xA;&lt;p&gt;The shortest safe submission, calculated as the sum of the bytes of the two functions &lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt;, wins. Your functions must be named.&lt;/p&gt;&#xA;&lt;h2&gt;The Robbers' Challenge&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;strong&gt;Find a vulnerable answer.&lt;/strong&gt; That is an answer, which hasn't been cracked yet and which isn't safe.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Crack it by designing a key recovery attack.&lt;/strong&gt; Your attack must follow the rules outlined in the cops section. To recap, this means:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The total number of calls to &lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt; with the key &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; must be strictly less than &lt;span class=&quot;math-container&quot;&gt;\$2^{16}\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;You must only pass &lt;span class=&quot;math-container&quot;&gt;\$16\$&lt;/span&gt; byte strings to &lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt;, and must have the key &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; initially be unknown&lt;/li&gt;&#xA;&lt;li&gt;The attack may be adaptive but must work to recover any 16 byte key &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; (or a functionally identical key)&lt;/li&gt;&#xA;&lt;li&gt;You must treat &lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt; as black box, and may not use runtime introspection, timing information, etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;If you've found such a attack, post an attack on the robber's thread linking back to the answer. If possible, you should post a link to an online interpreter which allows others to run your attack for various keys &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;. You are encouraged to post how your answer works, and the maximum number of calls your approach makes to &lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt;. If your attack does not recover the key, but instead a functionally identical one, explain (briefly) why they are functionally identical.&lt;/p&gt;&#xA;&lt;p&gt;You must not crack your own answer.&lt;/p&gt;&#xA;&lt;p&gt;The user who cracked the largest number of answers wins the robbers' challenge. Ties are broken by the sum of bytes of cracked answers (more is better).&lt;/p&gt;&#xA;&lt;h2&gt;Example #1&lt;/h2&gt;&#xA;&lt;h3&gt;Python 3, 133 bytes (cop)&lt;/h3&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;E=lambda s,k:''.join(chr((ord(c)+ord(d))%256) for c,d in zip(s,k))&#xA;D=lambda s,k:''.join(chr((ord(c)-ord(d))%256) for c,d in zip(s,k))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##K6gsycjPM/7/39U2JzE3KSVRoVgn20pdXS8rPzNPIzmjSEMjvyhFI1lTG0SlaGqqGpmaaSqk5RcpJOukKGTmKVRlFmgA9WhqcrkQMEKXoBH//wMA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 3 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;My program computes the sum of &lt;span class=&quot;math-container&quot;&gt;\$s_i\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$k_i\$&lt;/span&gt; for each &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Python 3, cracks xxx's answer&lt;/h3&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;leaked_key = E('\0'*16,k)&#xA;print('key = %s' % leaked_key)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##hYyxDoIwFEV3vuIt5L0qGgFBY8Imf2FiSlukFltSWPDnK8bBkekO95wzzFPnbB7qquevRnIYE3NB3D@dtiQ6T@S8JMG235GMxVlRMmidB5FI0BbeeqDFYSy6riR26wlTIW@ELMrTWar2kWb5EUOvuFHybtQMFdSEtwNu0nLho8FrOxH@nnhEiOEPsxA@&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 3 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;My crack completes in &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; call and uses that fact that &lt;span class=&quot;math-container&quot;&gt;\$0 + k = k\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Example #2&lt;/h2&gt;&#xA;&lt;h3&gt;Python 3, 147 bytes (cop)&lt;/h3&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;def E(s,k):&#xA; o=''&#xA; V=[*range(256)]&#xA; j=0&#xA; for i in range(16):&#xA;  j+=V[i]+ord(k[0])&#xA;  j%=256&#xA;  V[i],V[j]=V[j],V[i]&#xA;  o+=chr(ord(s[i])^j)&#xA; return o&#xA;D=E&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##bY@7DoMwDEX3fIWXKklh4NHSqpI3@AUWoBLlUQJSggKV0q9PE3XpUMm27HN1Bq/vfVIytbYfRijYFi78RkAhpQRKrI66lc@BJeeMNwRmjAiMSoMAIeEbxZkXYA6wrEQTKN2zpYoa7tkBnegWn4RlNTfoR@hPR1WA3aSZNzZH@H12kh72l5agSI6FXZDWJk5qk55qc85qc7m2j67/xyhZtZA7y1nBqAe/Td1Xrrj9AA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 3 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;My program uses a complicated thing.&lt;/p&gt;&#xA;&lt;h3&gt;Python 3, cracks yyy's answer&lt;/h3&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;leaked_key = ''&#xA;for c in range(256):&#xA; if E('f'*16,chr(c))==E('f'*16,k):&#xA;  leaked_key = chr(c)+'x'*15&#xA;  break&#xA;&#xA;print('key = %s' % leaked_key)&#xA;assert E('abcdabcdabcdabcd', leaked_key) == E('abcdabcdabcdabcd', k)&#xA;assert D('abcdabcdabcdabcd', leaked_key) == D('abcdabcdabcdabcd', k)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##jU@7boMwFN39FTcDsh08JK3CUOlu5BdYEK0ImMS4wZFNpOTrqW@pUjpE6uDXed3jy308ueF1anUHexGUlW8MHHLOoMBy7evhqMXLLpMVgx43DDrnwYAZYKa2GRmgT7EoTZU63wpbbipJWILRGC/EqKLsK6RN0TOiLsXm5AU5QkTkex9NXo9XP4BjOe6ZRX686hDO@udYrfj0qWur2w@r74AQa1Kf5rcPVY2FDP2Gd3y9zRRNaaREfCDfn4Q/SbMo5bco2EXy4CPL2MWbYRR81iSBQ7KwSVaHoP1Io@pD0y4XV0shID4R2UdI/p@Q/EnINH0B&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 3 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;They only ever use the first byte of the key, so we can just bruteforce the first byte and pad with anything to get a functionally identical key. This involves a maximum of &lt;span class=&quot;math-container&quot;&gt;\$256\$&lt;/span&gt; calls to &lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt; with the secret key.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sup&gt;1. This means that if your language uses null-terminated strings, such as C, then you should be using memcpy-type operations instead of string operations. Since the input length is fixed as 16 bytes, this should be no issue.&lt;br&gt;2. This requirement forbids most kinds of &lt;a href=&quot;https://en.wikipedia.org/wiki/Birthday_attack&quot; rel=&quot;nofollow noreferrer&quot;&gt;Birthday attack&lt;/a&gt;.&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Questions to sandbox users:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I know this is a lot to take in. Is it clear?&lt;/li&gt;&#xA;&lt;li&gt;Can anyone think of a &lt;em&gt;trivial&lt;/em&gt; way to trapdoor &lt;span class=&quot;math-container&quot;&gt;\$E\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt; with eg. a hashing function? I don't think it's possible, but I could be wrong.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="48931" LastActivityDate="2020-09-07T07:51:29.567" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19320" PostTypeId="1" CreationDate="2020-09-07T19:26:15.820" Score="6" ViewCount="481" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;The purpose of this thread was to collect questions for the questionnaire. The questionnaire is now live, and you may find it &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19344/38734&quot;&gt;here&lt;/a&gt;.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Code Golf is scheduled for an election &lt;a href=&quot;https://codegolf.stackexchange.com/election/3&quot;&gt;next week, September 14th 2020&lt;/a&gt;. In connection with that, we will be holding a Q&amp;amp;A with the candidates. This will be an opportunity for members of the community to pose questions to the candidates on the topic of moderation.  Participation is completely voluntary.&lt;/p&gt;&#xA;&lt;p&gt;Here's how it'll work:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Until the nomination phase, (so, until September 14th 2020 at 20:00:00Z UTC, or 4:00 pm EDT on the same day, give or take time to arrive for closure), this question will be open to collect potential questions from the users of the site. Post answers to this question containing any questions you would like to ask the candidates. Please only post &lt;em&gt;one question per answer&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;We, the Community Team, will be providing a small selection of generic questions. The first two will be guaranteed to be included, the latter ones are if the community doesn't supply enough questions. This will be done in a single post, unlike the prior instruction.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If your question contains a link, please use the syntax of &lt;code&gt;[text](link)&lt;/code&gt;, as that will make it easier for transcribing for the finished questionnaire.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is a perfect opportunity to voice questions that are specific to your community and issues that you are running into currently.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;At the start of the nomination phase, the Community Team will select &lt;strong&gt;up to 8 of the top voted questions submitted by the community&lt;/strong&gt; provided in this thread, to use in addition to the aforementioned 2 guaranteed questions. We reserve some editorial control in the selection of the questions and may opt not to select a question that is tangential or irrelevant to moderation or the election.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Once questions have been selected, a new question will be opened to host the actual questionnaire for the candidates, typically containing 10 questions in total.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is not the only option that users have for gathering information on candidates. As a community, you are still free to, for example, hold a live chat session with your candidates to ask further questions, or perhaps clarifications from what is provided in the Q&amp;amp;A.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If you have any questions or feedback about this process, feel free to post as a comment here.&lt;/p&gt;&#xA;" OwnerUserId="38734" LastEditorUserId="38734" LastEditDate="2020-09-14T19:58:04.903" LastActivityDate="2020-09-14T19:58:04.903" Title="2020 Moderator Election Q&amp;A - Question Collection" Tags="|discussion|moderators|election|" AnswerCount="4" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="19321" PostTypeId="2" ParentId="19320" CreationDate="2020-09-07T19:26:15.820" Score="4" Body="&lt;p&gt;Here is a set of general questions, gathered as very common questions asked every election. As mentioned in the instructions, the first two questions are guaranteed to show up in the Q&amp;amp;A, while the others are if there aren't enough questions (or, if you like one enough, you may split it off as a separate answer for review within the community's 8).&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How would you deal with a user who produced a steady stream of valuable answers, but tends to generate a large number of arguments/flags from comments?&lt;/li&gt;&#xA;&lt;li&gt;How would you handle a situation where another mod closed/deleted/etc a question that you feel shouldn't have been?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In your opinion, what do moderators do?&lt;/li&gt;&#xA;&lt;li&gt;A diamond will be attached to everything you say and have said in the past, including questions, answers and comments. Everything you will do will be seen under a different light. How do you feel about that?&lt;/li&gt;&#xA;&lt;li&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="38734" LastActivityDate="2020-09-07T19:26:15.820" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19323" PostTypeId="2" ParentId="1061" CreationDate="2020-09-08T02:01:11.680" Score="21" Body="&lt;h2&gt;Using cryptographic functions in a cops and robbers challenge&lt;/h2&gt;&#xA;&lt;p&gt;Almost every cops and robbers challenge will have the following requirement:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Using cryptographic functions such as hashes or PRNGs is disallowed&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;...and for good reason. A trivial answer such as &lt;code&gt;if (hash(input) == &amp;quot;[ example_hash ]&amp;quot;) return true&lt;/code&gt; is near impossible to crack, yet requires almost no ingenuity on the part of the cop.&lt;/p&gt;&#xA;&lt;p&gt;Some very specific challenges may not be susceptible to trivial solutions like these, but the default should be to consider hashing functions a loophole. I'm surprised this isn't already here, I think it would save everyone a lot of typing if this was the default policy :D&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2021-04-30T03:24:59.197" LastActivityDate="2021-04-30T03:24:59.197" CommentCount="7" CommunityOwnedDate="2020-09-08T02:01:11.680" ContentLicense="CC BY-SA 4.0" />
  <row Id="19325" PostTypeId="2" ParentId="2140" CreationDate="2020-09-08T19:02:03.813" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/210733/66833&quot;&gt;Double Prime Words&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="82163" LastEditorUserId="66833" LastEditDate="2020-09-25T00:19:54.003" LastActivityDate="2020-09-25T00:19:54.003" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="19328" PostTypeId="2" ParentId="19320" CreationDate="2020-09-08T23:56:54.850" Score="16" Body="&lt;p&gt;Moderators must sign an &lt;a href=&quot;https://codegolf.stackexchange.com/legal/moderator-agreement&quot;&gt;agreement&lt;/a&gt; whose terms include:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;i. I will abide by the current &lt;a href=&quot;https://codegolf.stackexchange.com/conduct&quot;&gt;Code of Conduct&lt;/a&gt; (which is a part of this agreement), and enforce it to the best of my ability.&lt;br /&gt;&#xA;...&lt;br /&gt;&#xA;iv. I will abide by all other officially announced moderator and user policies &lt;a href=&quot;https://codegolf.stackexchange.com/help/mod-agreement-policies&quot;&gt;made available to me&lt;/a&gt;.&lt;br /&gt;&#xA;v. I will accept additional guidance given by members of the Stack Exchange, Inc. Community Team and Senior Leadership Team, whether in response to questions, concerns or discussions regarding existing network-wide policies.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;How would you respond if a policy or company directive (current or future) seems to conflict with your beliefs and ideals?&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2020-09-08T23:56:54.850" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19329" PostTypeId="1" AcceptedAnswerId="21989" CreationDate="2020-09-09T10:14:33.753" Score="25" ViewCount="588" Body="&lt;p&gt;Despite our help page claiming you &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/participate-in-meta&quot;&gt;only need 1 reputation to participate in Meta&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19142/how-to-get-reputation-to-post-on-the-meta&quot;&gt;multiple&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/55485949#55485949&quot;&gt;users&lt;/a&gt; have reported being unable to post answers on Meta, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7085/66833&quot;&gt;despite being supposed to be&lt;/a&gt; (&lt;a href=&quot;https://i.stack.imgur.com/Tcq60.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;screenshot&lt;/a&gt; of a message that shouldn't exist as proof).&lt;/p&gt;&#xA;&lt;p&gt;Because of this, new users aren't able to post answers to the Sandbox, having to answer at least one question on Main first.&lt;/p&gt;&#xA;&lt;p&gt;Is this a bug, and if so, how can it get fixed?&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Just created a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/98181/meta-rep-bug-sockpuppet&quot;&gt;sockpuppet account&lt;/a&gt; in order to test this, and (as you could probably tell), I wasn't able to post an answer to this question. &lt;a href=&quot;https://i.stack.imgur.com/WVzU3.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;screenshot&lt;/a&gt; of what I could see, you'll see bottom left:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;You must have at least &lt;strong&gt;5&lt;/strong&gt; reputation on Code Golf Stack Exchange to answer a question on meta&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-27T17:32:28.273" LastActivityDate="2021-04-27T17:32:28.273" Title="Users with 1 rep aren't able to post answers on Meta" Tags="|bug|status-completed|sandbox|new-users|meta|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19330" PostTypeId="2" ParentId="19320" CreationDate="2020-09-09T12:44:10.897" Score="3" Body="&lt;p&gt;A new user has put a brilliant solution to a challenge in the comments section of the question. Other users point this out in the comments, and even try to guide the user to posting an actual answer, but the user seems to have disappeared. Flags start coming in that the comment should be converted to an answer. What do you do?&lt;/p&gt;&#xA;" OwnerUserId="81263" LastEditorUserId="81263" LastEditDate="2020-09-10T08:47:26.847" LastActivityDate="2020-09-10T08:47:26.847" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19331" PostTypeId="2" ParentId="2140" CreationDate="2020-09-10T01:05:22.123" Score="0" Body="&lt;h2&gt;[Unnamed]&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This challenge is based on a somewhat unusual premise; the goal is to create a rectangular program (box) which is as large as possible, where each row and column will be a solution to a different challenge on this site.&lt;/p&gt;&#xA;&lt;p&gt;For example, a 3×4 box might look like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;abcd&#xA; :-]&#xA;1234&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;As all solutions will be read from left to right or top to bottom, this would expand into seven programs:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;abcd&#xA; :-]&#xA;1234&#xA;a 1&#xA;b:2&#xA;c-3&#xA;d]4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For an answer to be valid, each one of these must be a valid solution to a different challenge on this site, in the same language. The box may be padded by whitespace, but &lt;strong&gt;must&lt;/strong&gt; be rectangular (&lt;code&gt;x&lt;/code&gt; groups of &lt;code&gt;y&lt;/code&gt; bytes, separated by newlines). This is code bowling, so the longest answer in bytes wins.&lt;/p&gt;&#xA;&lt;p&gt;Additional rules/clarifications:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Solutions cannot contain newlines (because otherwise they would be two separate rows/columns)&lt;/li&gt;&#xA;&lt;li&gt;Yes, it will be possible to trivially get very high scores with some languages (like unary), but as with most challenges it's a competition within each language&lt;/li&gt;&#xA;&lt;li&gt;Solutions do not have to be original, but ones copied from other answers should link to them&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2020-09-10T01:05:22.123" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19332" PostTypeId="2" ParentId="2140" CreationDate="2020-09-10T17:28:45.617" Score="2" Body="&lt;h1&gt;Take 6!&lt;/h1&gt;&#xA;&lt;p&gt;A good card game is a wonderful thing. I got me a nice fresh set of &lt;a href=&quot;https://en.wikipedia.org/wiki/6_Nimmt!&quot; rel=&quot;nofollow noreferrer&quot;&gt;Take 6!&lt;/a&gt; Too bad though, I have no-one to play with. And so I turn to you!&lt;/p&gt;&#xA;&lt;h2&gt;The Game&lt;/h2&gt;&#xA;&lt;p&gt;The game is played with a set of 104 cards, numbered 1 to 104 inclusively. Each card has a number of 'cows' attached. Here's a quick Python function to calculate the number of cows:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;def cows(card):&#xA;    out = 1&#xA;    if(card % 5) == 0:&#xA;        out += 1&#xA;    if(card % 10) == 0:&#xA;        out += 1&#xA;    if(card % 11) == 0:&#xA;        out += 4&#xA;        if(card % 5) == 0:  # C-c-c-combo&#xA;            out += 1&#xA;    return out&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Therefore, there is a total of&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;1 card with 7 cows (number 55)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;8 cards with 5 cows (the other multiples of 11: 11, 22, 33,&#xA;44, 66, 77, 88, 99)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;10 cards with 3 cows (multiples of ten: 10, 20, 30, 40, 50,&#xA;60, 70, 80, 90, 100)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;9 cards with 2 cows (other multiples of five: 5, 15, 25, 35, 45, 65, 75, 85, 95)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;76 cards with 1 cow (all other cards)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The game is played by up to 10 players.&lt;/p&gt;&#xA;&lt;p&gt;Each player is given 10 cards. 4 cards are placed on the table as the starts of 'rows'. Then 10 turns of play take place. Then, results are calculated.&lt;/p&gt;&#xA;&lt;h3&gt;A turn&lt;/h3&gt;&#xA;&lt;p&gt;Each player selects one of their remaining cards. At the same time, they reveal their selected cards.&lt;/p&gt;&#xA;&lt;p&gt;Going in the order of lowest card number, the player whose card it is must place it into a row according to rules:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;If there is a row with the top card of a lower number than the player's and no such row with a lower number exists, their card must be placed at the end of the row. If their card is the sixth in a row, they take the first 5 cards and put them on their result pile, leaving theirs as the new start.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If no such row exists, they must pick one of the rows, take all the cards there to their result pile, and leave their card as the new start.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;row tops: 10 20 30 40&lt;/p&gt;&#xA;&lt;p&gt;played: 25&lt;/p&gt;&#xA;&lt;p&gt;must be placed on the row with a 20, creating the configuration 10 25 30 40 with a possible cow gain&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;row tops: 10 20 30 40&lt;/p&gt;&#xA;&lt;p&gt;played: 9&lt;/p&gt;&#xA;&lt;p&gt;pick any row, creating for example 10 20 9 40, but guaranteed to gain cows&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;Counting&lt;/h3&gt;&#xA;&lt;p&gt;The sum of cow values of the cards in a player's result pile is their score. The lower the score the better.&lt;/p&gt;&#xA;&lt;p&gt;Scores may be added up over several games, creating an overall score for a match.&lt;/p&gt;&#xA;&lt;h2&gt;Bots&lt;/h2&gt;&#xA;&lt;p&gt;Bots will be standalone programs. Everything belonging to a bot will be placed in a single directory, the name of the directory will be used as the name of the bot. A launch script named &lt;code&gt;launch&lt;/code&gt; (may be the entire bot) must be provided. If necessary, a compilation script named &lt;code&gt;build&lt;/code&gt; may be provided. Both scripts shall be placed directly in the bot's directory and should use shebangs to specify how they are to be run.&lt;/p&gt;&#xA;&lt;p&gt;Bots shall not interfere with other bots, the controller, or the git repositories used.&lt;/p&gt;&#xA;&lt;p&gt;The bots will have the option of storing extra information in files in their own directory. It will be wiped when a fresh series is being run (such as after adding a new bot).&lt;/p&gt;&#xA;&lt;p&gt;An override input format may be provided. I intend to use &lt;a href=&quot;https://www.stringtemplate.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;StringTemplate&lt;/a&gt; for this, I'll write up some details when working on the controller. The default format will have all messages newline-terminated.&lt;/p&gt;&#xA;&lt;p&gt;Once launched, the bot will be first given their cards, as a list of card numbers, where the numbers may or may not be ordered.&lt;/p&gt;&#xA;&lt;p&gt;The default format will be&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;cards 0 1 2 3 4 5 6 7 8 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;No response is expected.&lt;/p&gt;&#xA;&lt;p&gt;For each round, the bot will be prompted with the current state of the grid, that is the number of cards in each row, the sum of cows in each row and the top number card in the row.&lt;/p&gt;&#xA;&lt;p&gt;The default format will be&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;count 1 2 3 4&#xA;&#xA;cows 5 6 7 8&#xA;&#xA;top 11 20 22 35&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The bot shall answer with the number of one of its remaining cards.&lt;/p&gt;&#xA;&lt;p&gt;The list of all the cards used by all bots in the round will be given to each bot. Not that this includes the bot's own card. The order of bots in this message will be consistent within a game.&lt;/p&gt;&#xA;&lt;p&gt;The default format will be&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;used 0 1 2 3 4 5 6 7 8 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;No response is expected.&lt;/p&gt;&#xA;&lt;p&gt;If the placement rule 2. has to be invoked, the bot will receive a message containing the board state at the time when it needs to pick a row&lt;/p&gt;&#xA;&lt;p&gt;The default format will be&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;pickrow&#xA;&#xA;count 1 2 3 4&#xA;&#xA;cows 5 6 7 8&#xA;&#xA;top 11 20 22 35&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The bot shall respond with the number of the row it wishes to take. The rows will be 0-indexed for this.&lt;/p&gt;&#xA;&lt;p&gt;If the bot's move results in a gain of result cows, it will be informed of which cards and how many cows it has gained (note that the lower the number the better).&lt;/p&gt;&#xA;&lt;p&gt;The default format will be&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;cardgain 1 2 3 4 5&#xA;&#xA;cowgain 6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;No response is expected.&lt;/p&gt;&#xA;&lt;p&gt;At the end, all bots will be shown their score as well as all the scores of others, in the order consistent with the used cards message.&lt;/p&gt;&#xA;&lt;p&gt;The default format will be&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;score 30&#xA;&#xA;others 0 1 2 3 4 5 6 7 8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;No response is expected.&lt;/p&gt;&#xA;&lt;p&gt;If the bot makes an invalid move, it will be delivered a special message informing it of such. From that point the bot's current game is over. It gets 100 points of penalty.&lt;/p&gt;&#xA;&lt;p&gt;The default format will be&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;invalid&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;A timely shutdown is expected.&lt;/p&gt;&#xA;&lt;p&gt;The bot may of course try to save information to its private file at any time, including at the end.&lt;/p&gt;&#xA;&lt;p&gt;After the final message, the bot shall terminate in a timely manner.&lt;/p&gt;&#xA;&lt;p&gt;Scoring will be added up over many games, number depends on how fast the games end up running, but at least 100 sounds reasonable to me.&lt;/p&gt;&#xA;&lt;p&gt;Bots will be placed in a separate github repository &lt;strong&gt;TODO&lt;/strong&gt; for easy setup and reseting. Bots that need a compilation script but don't have one will be given one.&lt;/p&gt;&#xA;&lt;h2&gt;Controler&lt;/h2&gt;&#xA;&lt;p&gt;Work has started at &lt;a href=&quot;https://github.com/MrRedstoner/Take6KOTH&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://github.com/MrRedstoner/Take6KOTH&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The controller will be designed to run in Java 1.8+, using the Process API to launch bots.&lt;/p&gt;&#xA;&lt;h1&gt;Notes:&lt;/h1&gt;&#xA;&lt;p&gt;While the number of bots is too low, it will be padded to 10 by using multiples of primitive bots. The tournament style once 11+ submissions exist is for now playing all subsets of size 10.&lt;/p&gt;&#xA;&lt;p&gt;I intend to write up at least a few primitive bots, to get the games going. Something like using cards in the order they were given, or randomly. These will also demonstrate the custom input functionality. Maybe even one that uses external input, to let me play for fun!&lt;/p&gt;&#xA;&lt;p&gt;Limits for execution time, storage of data etc. are not given at this time. If bots start to behave excessively limits may be added.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Sandbox notes:&lt;/p&gt;&#xA;&lt;p&gt;Any better idea for tournament?&lt;/p&gt;&#xA;&lt;p&gt;Should bots be given the names of their competitors as well? Currently leaning towards yes.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Planned tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="88701" LastEditorUserId="88701" LastEditDate="2020-09-20T19:16:50.500" LastActivityDate="2020-09-20T19:16:50.500" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19334" PostTypeId="2" ParentId="2140" CreationDate="2020-09-11T00:20:22.217" Score="0" Body="&lt;p&gt;&lt;strong&gt;Targeted sum and difference of a sequence&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;You are given two things: a target integer(not necessarily positive) &lt;strong&gt;n&lt;/strong&gt;, and a sorted list/array/etc. of non-negative integers &lt;strong&gt;a&lt;/strong&gt;. (The list will have at least two elements). Your goal is to choose one element of &lt;strong&gt;a&lt;/strong&gt; as your total, and then one by one, take elements of &lt;strong&gt;a&lt;/strong&gt;, and either add or subtract them from your total. Print out all possible combinations(duplicates can be removed, but it is optional) of &lt;code&gt;[a_1]±[a_2]±[a_3]&lt;/code&gt; or return them as a list/array/etc. .&lt;/p&gt;&#xA;&lt;p&gt;In other words, find all solutions to &lt;code&gt;n=[a_1]±[a_2]±[a_3]&lt;/code&gt;. The first element of &lt;strong&gt;a&lt;/strong&gt; is not guaranteed to be &lt;code&gt;a_1&lt;/code&gt;, nor is the second element guaranteed to be &lt;code&gt;n_2&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;n = 10, a = [1,2,3,4] :  10 = 1+2+3+4 and 2+1+3+4 ...&#xA;# The output should be 1+2+3+4(and 4+2+3+1, and every combination like that)&#xA;n = 1, a = [2,3]: 1 = 3-2, so 3-2. &#xA;# (-2+3 wouldn't work, since it is strictly addition or subtraction of positive integers).&#xA;# -2 isn't a part of [2,3]. You should think of the steps as [a_1]±[a_2]±[a_3].&#xA;# n = -5, a = [0,5,1]. -5 = 0-5, and nothing else.&#xA;n=95, a = [50,50,5]. 95 = 50+50-5, 50-5+50. (A second 50+50-5 is optional)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Criteria: Shortest code wins&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Meta&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;p&gt;Is this clear enough(and what should I do to make this more clear)? Also, has this been done before? Finally, should I remove the restriction on the first number being positive?&lt;/p&gt;&#xA;&lt;p&gt;Thank You!&lt;/p&gt;&#xA;" OwnerUserId="96507" LastActivityDate="2020-09-11T00:20:22.217" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19337" PostTypeId="2" ParentId="2140" CreationDate="2020-09-11T20:59:11.153" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/211411/66833&quot;&gt;Word Length-Sum Multiples&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="82163" LastEditorUserId="66833" LastEditDate="2020-09-25T00:15:08.570" LastActivityDate="2020-09-25T00:15:08.570" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19338" PostTypeId="2" ParentId="2140" CreationDate="2020-09-11T23:25:07.453" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/211292/sporeball-numbers&quot;&gt;Posted.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="91030" LastEditorUserId="91030" LastEditDate="2020-09-19T03:14:54.680" LastActivityDate="2020-09-19T03:14:54.680" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19339" PostTypeId="1" CreationDate="2020-09-12T08:46:39.720" Score="13" ViewCount="424" Body="&lt;p&gt;We are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19320/2020-moderator-election-qa-question-collection&quot;&gt;scheduled for a moderator election&lt;/a&gt; on Sep 14, 2020. A &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18269/january-2020-moderator-election-community-interest-check&quot;&gt;Community Interest Check&lt;/a&gt; by SE last November gauged interest in holding and running for January elections for the spots of the two (now three) moderators who resigned. The reaction was quite negative, coupled with the ongoing Monica situation and moderator protests. No elections were held then, and SE did not follow up at the time.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/31716/james&quot;&gt;James (formerly DJMcMayhem)&lt;/a&gt;, who had not yet stepped down as moderator, revealed that they had requested for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/38734/jnat&quot;&gt;JNat♦&lt;/a&gt; to post the interest check due to feeling that the site needs more moderators. At present, &lt;a href=&quot;https://codegolf.stackexchange.com/users/3808/doorknob&quot;&gt;Doorknob&lt;/a&gt; is the sole moderator. It's not clear how active at moderating they are.&lt;/p&gt;&#xA;&lt;p&gt;On the new &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19320/2020-moderator-election-qa-question-collection&quot;&gt;call for moderator questions&lt;/a&gt;, JNat said that an election would take place. In response to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19320/2020-moderator-election-qa-question-collection#comment69772_19320&quot;&gt;caird suggesting a new interest check to gauge current opinions&lt;/a&gt;, JNat &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19320/2020-moderator-election-qa-question-collection#comment69779_19320&quot;&gt;said&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Admittedly, checking in before scheduling the election would've been&#xA;ideal. This year, however, has been particularly weird for everyone,&#xA;and it proved a bit hard to coordinate with the one moderator on the&#xA;site on how to proceed since then. That (the inability to coordinate&#xA;and the fact that there's a single mod), in addition to the fact that&#xA;the site currently has around 100 unhandled flags, and the rollout&#xA;plan for the new mod agreement just all coalesced now, though, and&#xA;made this election something we can't postpone any more.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;JNat &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19320/2020-moderator-election-qa-question-collection#comment69802_19320&quot;&gt;further explained&lt;/a&gt; that the election would definitely go through, as long as there are enough candidates after &amp;quot;clearly troll-ish or joke&amp;quot; nominations are withdrawn, regardless of whether any &amp;quot;reasonable candidates&amp;quot; (as I phrased it) do decide to run.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;What is our reaction to all this? This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/discussion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt; question. Please discuss the election situation in general, rather than specific nominees and their merits which should be saved for the nomination phase.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2020-09-15T13:30:51.047" Title="Discussion on the upcoming moderator elections (Sep 2020)" Tags="|discussion|moderators|election|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19340" PostTypeId="2" ParentId="19339" CreationDate="2020-09-12T12:25:01.643" Score="19" Body="&lt;h2&gt;I think this is needed&lt;/h2&gt;&#xA;&lt;p&gt;Since the last poll the site seems to have experienced a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18483&quot;&gt;die off&lt;/a&gt; and the start of a rebound.  (I believe that)&lt;sup&gt;1&lt;/sup&gt; we have had moderation issues that are to be expected with one active moderator.&lt;/p&gt;&#xA;&lt;p&gt;In retrospect I think that perhaps it was unwise to go without new moderators even until now.  I don't think it has proved any sort of point to SE.  I don't see any direct line in which this is making any situation any better.  As far as I can see it has just hurt our ability to exercise the communities desires and rules.  I think that especially with the seeming growth we have experienced in the last couple months it is imperative that we have some new people controlling the quality and answering user flags.&lt;/p&gt;&#xA;&lt;p&gt;I think we are in a hard place, where many distrust SE, but I'm not sure if this is really an opportunity to tackle those issues on the long term.  If we push much farther we may just end up cutting our nose to spite our face.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sup&gt;1: I cannot personally see moderation statistics so this is based on the response rate to my own flags and the anecdotes of others.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2020-09-12T12:25:01.643" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19341" PostTypeId="2" ParentId="19320" CreationDate="2020-09-13T09:23:32.960" Score="4" Body="&lt;p&gt;A good deal of pending flags are on answers a few years old which have been flagged as invalid based on meta consensus on golf submissions, which sometimes postdates those answers. How would you handle these?&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2020-09-14T00:16:00.317" LastActivityDate="2020-09-14T00:16:00.317" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19342" PostTypeId="2" ParentId="2140" CreationDate="2020-09-13T12:21:45.073" Score="1" Body="&lt;h1&gt;Move the Knight!&lt;/h1&gt;&#xA;&lt;p&gt;Your knight is on &lt;code&gt;(0, 0)&lt;/code&gt; on an infinite (to all of the four edges, not just two) chessboard, and you need to move it to &lt;code&gt;(a, b)&lt;/code&gt;. You can use arbitrary (but finite) number of moves to do that. Since the chessboard is infinite, you can use squares with negative coordinates.&lt;/p&gt;&#xA;&lt;p&gt;Since you only have 2 knights (if no promotion occured) to type the program, your program needs to be as short as possible.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;The input is two integers, a and b.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;You output a sequence of characters, each represents a move. There are eight directions to move, so your output should contain eight distinct characters, each represents one direction. They can be any eight characters, as long as they are all unique.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;p&gt;The characters used here is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; A B&#xA;C   D&#xA;  N&#xA;E   F&#xA; G H&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 0 -&amp;gt; &amp;quot;&amp;quot;&#xA;1 1 -&amp;gt; &amp;quot;GD&amp;quot; or &amp;quot;DEGD&amp;quot; or &amp;quot;DG&amp;quot; etc.&#xA;3 3 -&amp;gt; &amp;quot;DDDGGG&amp;quot; (one possible version)&#xA;2 3 -&amp;gt; &amp;quot;FGD&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard Loopholes are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="87986" LastActivityDate="2020-09-13T12:21:45.073" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19343" PostTypeId="2" ParentId="2140" CreationDate="2020-09-14T16:20:10.103" Score="1" Body="&lt;h1&gt;Do my data follow Benford's law or a uniform distibution?&lt;/h1&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;Benford's law, also known as the law of anomalous numbers, describes the distribution of the leading digit in many numerical data sets. Let &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt; be the leading digit of an observation (in base 10). According to Benford's law, &lt;span class=&quot;math-container&quot;&gt;\$P[X=i]=\log_{10}(1+\frac1i)\$&lt;/span&gt; for &lt;span class=&quot;math-container&quot;&gt;\$i=1\ldots 9\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For instance take the yearly reputation change of the top 1000 users on CGCC. For a user with reputation change 3522, keep only the leading digit, 3. Repeat this for all users, and you get this distribution, which is far from uniform:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/oLXqKm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/oLXqKm.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This has been shown to apply to vary different data sets, from town populations to stock prices, and is used to detect tax and election fraud.&lt;/p&gt;&#xA;&lt;p&gt;On the other hand, for some other data sets, the distribution of the leading digit is a uniform distribution: &lt;span class=&quot;math-container&quot;&gt;\$P[X=i] = \frac19\$&lt;/span&gt; for &lt;span class=&quot;math-container&quot;&gt;\$i=1\ldots 9\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Given some observed frequencies &lt;span class=&quot;math-container&quot;&gt;\$(f_i)_{i=1\ldots 9}\$&lt;/span&gt;, we shall measure the distance to these two distributions using the sum of the errors in absolute value: &lt;span class=&quot;math-container&quot;&gt;\$\sum_i \left|f_i-\log_{10}(1+\frac1i)\right|\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\sum_i\left|f_i-\frac19\right|\$&lt;/span&gt;, respectively.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Take as input a list of non-zero numbers. For each number, keep only the leading digit, which is defined as the first non-zero digit. Compute the observed frequencies of leading digits, and output one of two values, depending on whether the observed frequencies are closer to Benford's law or to a uniform distribution.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;Input format is flexible. Note that input may include negative values, as well as non-integers.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Either two consistent values, one for Benford's law and one for the uniform, or a truthy/falsey value.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;To be added&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="86301" LastActivityDate="2020-09-14T16:20:10.103" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19344" PostTypeId="1" CreationDate="2020-09-14T19:57:52.803" Score="13" ViewCount="807" Body="&lt;p&gt;In connection with the moderator elections, we are holding a Q&amp;amp;A thread for the candidates. Questions collected &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19320/38734&quot;&gt;from an earlier thread&lt;/a&gt; have been compiled into this one, which shall now serve as the space for the candidates to provide their answers.&lt;/p&gt;&#xA;&lt;p&gt;Due to the submission count, we have selected all provided positively-scored questions as well as our back up questions for a total of 8 questions.&lt;/p&gt;&#xA;&lt;p&gt;As a candidate, your job is simple - post an answer to this question, citing each of the questions and then post your answer to each question given in that same answer. For your convenience, I will include all of the questions in quote format with a break in between each, suitable for you to insert your answers. Just &lt;a href=&quot;https://codegolf.meta.stackexchange.com/revisions/a7232599-b131-41d7-afb7-6ddddbb1de2e/view-source&quot;&gt;copy the whole thing after the first set of three dashes&lt;/a&gt;. Please consider putting your name at the top of your post so that readers will know who you are before they finish reading everything you have written, and also including a link to your answer on your nomination post.&lt;/p&gt;&#xA;&lt;p&gt;Once all the answers have been compiled, this will serve as a transcript for voters to view the thoughts of their candidates, and will be appropriately linked in the Election page.&lt;/p&gt;&#xA;&lt;p&gt;Good luck to all of the candidates!&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Oh, and when you've completed your answer, please provide a link to it after this blurb here, before that set of three dashes. Please leave the list of links in the order of submission.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;To save scrolling here are links to the submissions from each candidate (in order of submission):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/19350/38734&quot;&gt;Wheat Wizard&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/19352/76162&quot;&gt;Jo King&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/19353/66833&quot;&gt;Chris&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/19354/68942&quot;&gt;HyperNeutrino&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/19356/66833&quot;&gt;caird coinheringaahing&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;How would you deal with a user who produced a steady stream of valuable answers, but tends to generate a large number of arguments/flags from comments?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;How would you handle a situation where another mod closed/deleted/etc a question/answer that you feel shouldn't have been?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In your opinion, what do moderators do?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A diamond will be attached to everything you say and have said in the past, including questions, answers and comments. Everything you will do will be seen under a different light. How do you feel about that?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A good deal of pending flags are on answers a few years old which have been flagged as invalid based on meta consensus on golf submissions, which sometimes postdates those answers. How would you handle these?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A new user has put a brilliant solution to a challenge in the comments section of the question. Other users point this out in the comments, and even try to guide the user to posting an actual answer, but the user seems to have disappeared. Flags start coming in that the comment should be converted to an answer. What do you do?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Moderators must sign an &lt;a href=&quot;https://codegolf.stackexchange.com/legal/moderator-agreement&quot;&gt;agreement&lt;/a&gt; whose terms include:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;i. I will abide by the current &lt;a href=&quot;https://codegolf.stackexchange.com/conduct&quot;&gt;Code of Conduct&lt;/a&gt; (which is a part of this agreement), and enforce it to the best of my ability.&lt;br /&gt;&#xA;...&lt;br /&gt;&#xA;iv. I will abide by all other officially announced moderator and user policies &lt;a href=&quot;https://codegolf.stackexchange.com/help/mod-agreement-policies&quot;&gt;made available to me&lt;/a&gt;.&lt;br /&gt;&#xA;v. I will accept additional guidance given by members of the Stack Exchange, Inc. Community Team and Senior Leadership Team, whether in response to questions, concerns or discussions regarding existing network-wide policies.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;How would you respond if a policy or company directive (current or future) seems to conflict with your beliefs and ideals?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="38734" LastEditorUserId="68942" LastEditDate="2020-10-10T21:07:50.047" LastActivityDate="2020-10-10T21:07:50.047" Title="2020 Moderator Election Q&amp;A - Questionnaire" Tags="|discussion|election|" AnswerCount="5" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19345" PostTypeId="1" CreationDate="2020-09-14T20:01:50.373" Score="11" ViewCount="322" Body="&lt;p&gt;The 2020 Community Moderator Election is now underway!&lt;/p&gt;&#xA;&lt;p&gt;Community moderator elections have three phases:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Nomination phase&lt;/li&gt;&#xA;&lt;li&gt;Primary phase&lt;/li&gt;&#xA;&lt;li&gt;Election phase&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Most elections take between two and three weeks, but this depends on how many candidates there are.&lt;/p&gt;&#xA;&lt;p&gt;Please visit the official election page at&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/election&quot;&gt;https://codegolf.stackexchange.com/election&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;for more detail, and to participate!&lt;/p&gt;&#xA;&lt;p&gt;If you have general questions about the election process, or questions for moderator candidates, feel free to ask them here on meta -- just make sure your questions are tagged &lt;a href=&quot;/questions/tagged/election&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;election&amp;#39;&quot; rel=&quot;tag&quot;&gt;election&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="-1" LastEditorUserId="68942" LastEditDate="2020-10-10T16:43:36.617" LastActivityDate="2020-10-10T16:43:36.617" Title="2020 Community Moderator Election" Tags="|discussion|moderators|election|" AnswerCount="0" CommentCount="0" CommunityOwnedDate="2020-09-14T20:01:50.373" ContentLicense="CC BY-SA 4.0" />
  <row Id="19347" PostTypeId="2" ParentId="19339" CreationDate="2020-09-15T10:14:21.917" Score="6" Body="&lt;p&gt;I have recently run in an election despite the fact that I share many of the very same concerns that others have expressed in the election interest check thread (and the questionnaire). My meta/Meta posting history of similar opinions back that up. But for me, these sites have an interest that is completely independent of Stack Exchange Inc's actions. That company just happens to own the platform. This site still provides a lot of great opportunities to fulfill its core charter and be a great resource to the world in general. That is not a reflection of Stack Exchange and their behavior. That is a reflection of us here.&lt;/p&gt;&#xA;&lt;p&gt;I hope that the many potentially great candidates can keep that in mind when deciding whether or not to throw their hat in the ring. It is possible to be a moderator on a Stack Exchange sponsored site and hold true your principles. I believe I am doing so now, and I encourage those qualified here to atleast consider separating SE from PPGC (and the other sites) when making their decision.&lt;/p&gt;&#xA;" OwnerUserId="81263" LastEditorUserId="81263" LastEditDate="2020-09-15T13:30:51.047" LastActivityDate="2020-09-15T13:30:51.047" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19349" PostTypeId="2" ParentId="2140" CreationDate="2020-09-16T16:20:13.607" Score="1" Body="&lt;h1&gt;Finding the densest crossword puzzles&lt;/h1&gt;&#xA;&lt;p&gt;I love crosswords, and nothing beats a super densely packed puzzle. But how dense can the puzzles get?&lt;/p&gt;&#xA;&lt;p&gt;Here's a sample puzzle I made a few years ago:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/xwCnvm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/xwCnvm.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Certainly not great, but can we do better?&lt;/p&gt;&#xA;&lt;p&gt;Given any list of characters, a crosswordification of that list is a crossword puzzle consisting of characters from that list. For example, given the list ['b','a','d','a','d'], the following is a valid crosswordification:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Tvs3Vs.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Tvs3Vs.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;but this isn't&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/KzVoks.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/KzVoks.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Clearly, the order of the list is irrelevant.&lt;/p&gt;&#xA;&lt;p&gt;Given a valid crossword, the area of the crossword is the area of the smallest rectangle containing the crossword. In the above examples, the smallest rectangle containing the crosswords are 3x3 squares, which have area 9.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;In this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, you must write a function which takes two arguments&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A list-like structure containing english characters&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A list-like of valid words consisting of english characters&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;and outputs an integer, representing the minimal area of a crosswordification of the list of english characters, where the second input defines the set of valid words.&lt;/p&gt;&#xA;&lt;p&gt;I will be using &lt;a href=&quot;https://github.com/dwyl/english-words&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; english dictionary for my test cases. Any code that is used to import/parse the dictionary into a list-like structure won't be counted in the byte-count, just the function.&lt;/p&gt;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&lt;p&gt;More to be added:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;['d','a','a','a','t','n','m'] -&amp;gt; 7 (adamant is a word)&#xA;&#xA;['k','a','s','a'] -&amp;gt; 6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="82007" LastEditorUserId="82007" LastEditDate="2020-09-17T14:01:54.617" LastActivityDate="2020-09-17T14:01:54.617" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19350" PostTypeId="2" ParentId="19344" CreationDate="2020-09-16T19:44:10.430" Score="21" Body="&lt;h2&gt;Wheat Wizard&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;How would you deal with a user who produced a steady stream of valuable answers, but tends to generate a large number of arguments/flags from comments?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;There are many users who produce valuable answers and challenges and few that are extremely disruptive or abusive. We can certainly afford to treat everyone the same regardless of the quality or volume of their contributions. One individual with hostile behavior can drive away many.  We should focus first on creating a strong community and good challenges and answer will follow from that.&lt;/p&gt;&#xA;&lt;p&gt;That does mean treating every person as a human being, even those that produce arguments and flags.  I find it unlikely that the hypothetical user doesn't care about the community they are steadily participating in.  I think that a human conversation can help to push people to be better.  However I am not a therapist so at the end of the day I know I cannot talk everyone into being nice to each other.  And suspending a user who is belligerent towards others and is harming the community will sometimes have to be done.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;How would you handle a situation where another mod closed/deleted/etc a question/answer that you feel shouldn't have been?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I think this has to be talked about on a case by case basis.  Closure especially is a case where I think that reasonable people can have disagreements and there are definitely situations where I might disagree but might not take any action.  However where I do believe that it transcends beyond simple disagreement in policy I think the obvious next step is to have a discussion in chat with the moderator who made the decision.  I think that we can reach a consensus if not an agreement on how to best respect the communities wishes.  And of course the meta is always a good tool for divining the will of the community.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;3&quot;&gt;&#xA;&lt;li&gt;In your opinion, what do moderators do?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;In my opinion moderators use the site tools to carry out the desires of the community.  They need to keep their fingers on the pulse of the community and in ideal circumstances should use very little personal discretion in the use of them.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;4&quot;&gt;&#xA;&lt;li&gt;A diamond will be attached to everything you say and have said in the past, including questions, answers and comments. Everything you will do will be seen under a different light. How do you feel about that?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I feel fine.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;5&quot;&gt;&#xA;&lt;li&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I think this question is a little weird.  My goal as a individual on the site is quite different from the goals of a moderator that I am volunteering to adopt. I have used the 10k and 20k rep tools to push the community towards what I think is best.  I will not be using the moderator tools in the same way.&lt;/p&gt;&#xA;&lt;p&gt;Becoming a moderator would not simply make me more effective or capable, it would change the way I use the site, and it asks me to use these tools not how I think is best for the community but how the community thinks is best for itself.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;6&quot;&gt;&#xA;&lt;li&gt;A good deal of pending flags are on answers a few years old which have been flagged as invalid based on meta consensus on golf submissions, which sometimes postdates those answers. How would you handle these?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I think the community has made itself clear that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8076&quot;&gt;consensus is retroactive&lt;/a&gt;.  And while old questions are not the highest priority I think that we need diligence in bringing the site up to the community standards, as only moderators have the power to enact this.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;7&quot;&gt;&#xA;&lt;li&gt;A new user has put a brilliant solution to a challenge in the comments section of the question. Other users point this out in the comments, and even try to guide the user to posting an actual answer, but the user seems to have disappeared. Flags start coming in that the comment should be converted to an answer. What do you do?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I think this can't be answered universally; it depends a lot on circumstances.  Overall, I have trouble imagining this scenario actually taking place. I'm not sure if a truly brilliant answer could be captured in a single comment. If something clever has been done, converting any answer left as a comment to a community wiki gives the opportunity for it to be thoroughly and properly explained.  And since the user is no longer a member of the site and can't possibly gain rep from the comment, I don't think that we would be stepping on their toes in any way.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;8&quot;&gt;&#xA;&lt;li&gt;&lt;p&gt;Moderators must sign an &lt;a href=&quot;https://codegolf.stackexchange.com/legal/moderator-agreement&quot;&gt;agreement&lt;/a&gt; whose terms include:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;i. I will abide by the current &lt;a href=&quot;https://codegolf.stackexchange.com/conduct&quot;&gt;Code of Conduct&lt;/a&gt; (which is a part of this agreement), and enforce it to the best of my ability.&lt;br /&gt;&#xA;...&lt;br /&gt;&#xA;iv. I will abide by all other officially announced moderator and user policies &lt;a href=&quot;https://codegolf.stackexchange.com/help/mod-agreement-policies&quot;&gt;made available to me&lt;/a&gt;.&lt;br /&gt;&#xA;v. I will accept additional guidance given by members of the Stack Exchange, Inc. Community Team and Senior Leadership Team, whether in response to questions, concerns or discussions regarding existing network-wide policies.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;How would you respond if a policy or company directive (current or future) seems to conflict with your beliefs and ideals?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I think everyone has a point at which they break and I suppose this question is about where mine is.  I am volunteering to moderate because I think moderation tasks are needed to help this community that I love.  If I feel that the moderation tasks I am asked to do are no longer helping this community I would stop and hand in the diamond, that is my line.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="89298" LastEditDate="2020-09-21T21:14:18.497" LastActivityDate="2020-09-21T21:14:18.497" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19352" PostTypeId="2" ParentId="19344" CreationDate="2020-09-20T15:07:59.083" Score="15" Body="&lt;h2&gt;Jo King&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;How would you deal with a user who produced a steady stream of valuable answers, but tends to generate a large number of arguments/flags from comments?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Users should be treated the same, regardless of their contributions. This is especially true on CGCC, where questions and answers don't require any particular domain knowledge. This being a smaller community, I can't think of any users that fit this description, and if one popped up that caused a lot of disturbances, they would receive an appropriate amount of focus from the moderators.&lt;/p&gt;&#xA;&lt;p&gt;No matter how valuable their contributions are, I would act in a way that attempts to  allow the user to coexist with the community.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;How would you handle a situation where another mod closed/deleted/etc a question/answer that you feel shouldn't have been?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The majority of question closures and answer deletions are usually for objective reasons (missing winning criteria, invalid program output or behaviour etc). For the majority of other cases the difference in subjective view is slight enough that I wouldn't persue the matter further.&lt;/p&gt;&#xA;&lt;p&gt;For the small percentage of other cases, I would first check the comments and chatroom to see if there is any context I am missing. Next, I would talk with the moderator in question to see what their reasoning was, while being open to the possibility to having missed something. If the issue is still contentious, I'd talk with any other moderators (publicly or with the first moderator) and most likely defer to their judgement on the matter.&lt;/p&gt;&#xA;&lt;p&gt;If after all this the question/answer remains closed/deleted, I would attempt to help the original poster make their submission appropriate for CGCC again (if the original moderator has not done so already of course!)&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;3&quot;&gt;&#xA;&lt;li&gt;In your opinion, what do moderators do?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Moderators keep the community clean from spam and disruption, while encouraging community growth. Mods should err, &lt;em&gt;moderate&lt;/em&gt; interactions between users, stepping in if the discussion gets too heated.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;4&quot;&gt;&#xA;&lt;li&gt;A diamond will be attached to everything you say and have said in the past, including questions, answers and comments. Everything you will do will be seen under a different light. How do you feel about that?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Generally, I can't think of anything that I would be ashamed of. Perhaps in the past I've been a bit brusque with users where I would be far more polite nowadays. I would fear that some of my meta answers would be seen as more authoritive, but otherwise I don't think any of that would matter.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;5&quot;&gt;&#xA;&lt;li&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I would still use the 10k and 20k moderation tools, while handling moderator only flags oon top of this. This helps me help the community in ways that I can't without being a mod, especially when there currently aren't as many mods available.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;6&quot;&gt;&#xA;&lt;li&gt;A good deal of pending flags are on answers a few years old which have been flagged as invalid based on meta consensus on golf submissions, which sometimes postdates those answers. How would you handle these?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;s&gt;Answers that predate meta consensus would be left alone, though I would leave a reply encouraging the user to amend their answer to be valid by today's standards.&lt;/s&gt; I see Wheat Wizard's link that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8076/76162&quot;&gt;meta consensus applies retroactively&lt;/a&gt;. I don't think this is common knowledge in the community, but I would still apply it to flagged answers.&lt;/p&gt;&#xA;&lt;p&gt;If the change would be trivial (such as removing a &amp;quot;non-competing&amp;quot; subtitle), I would edit the answer.&lt;/p&gt;&#xA;&lt;p&gt;&lt;s&gt;If the answer &lt;em&gt;does&lt;/em&gt; postdate the meta consensus,&lt;/s&gt; Otherwise, I would leave a warning to the user that the answer is invalid, link the relevant meta answer(s) and delete the answer, encouraging the user to amend the answer so it can be restored.&lt;/p&gt;&#xA;&lt;p&gt;While validating old answers are not the highest priority, I appreciate users helping make old answers valid as well, if only to avoid new users making bad assumptions.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;7&quot;&gt;&#xA;&lt;li&gt;A new user has put a brilliant solution to a challenge in the comments section of the question. Other users point this out in the comments, and even try to guide the user to posting an actual answer, but the user seems to have disappeared. Flags start coming in that the comment should be converted to an answer. What do you do?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;There's nothing you can do to force a user to participate. A briliant approach to a challenge is free to be implemented by any user that wishes to do so, though I would certainly encourage users to make their answers community wiki, attribute the original user and/or elaborate on the approach and why it works.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;8&quot;&gt;&#xA;&lt;li&gt;&lt;p&gt;Moderators must sign an &lt;a href=&quot;https://codegolf.stackexchange.com/legal/moderator-agreement&quot;&gt;agreement&lt;/a&gt; whose terms include:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;i. I will abide by the current &lt;a href=&quot;https://codegolf.stackexchange.com/conduct&quot;&gt;Code of Conduct&lt;/a&gt; (which is a part of this agreement), and enforce it to the best of my ability.&lt;br /&gt;&#xA;...&lt;br /&gt;&#xA;iv. I will abide by all other officially announced moderator and user policies &lt;a href=&quot;https://codegolf.stackexchange.com/help/mod-agreement-policies&quot;&gt;made available to me&lt;/a&gt;.&lt;br /&gt;&#xA;v. I will accept additional guidance given by members of the Stack Exchange, Inc. Community Team and Senior Leadership Team, whether in response to questions, concerns or discussions regarding existing network-wide policies.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;How would you respond if a policy or company directive (current or future) seems to conflict with your beliefs and ideals?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;There will always be a line that I won't cross. Forcing a behaviour on users, whether it is &lt;code&gt;x&lt;/code&gt; or &lt;code&gt;¬x&lt;/code&gt; (where x is some controversial issue), would most likely be a step too far, whether or not I agree with &lt;code&gt;x&lt;/code&gt;. Right now, the policy is close enough to &amp;quot;Be nice and assume good faith&amp;quot;, that I'm comfortable enforcing it. I'm skittish enough from SE's actions in the last few years that any drastic changes to the Code of Conduct without consultation from the community would be likely to make me step down.&lt;/p&gt;&#xA;&lt;p&gt;Generally, if I feel that if by moderating, my actions would be driving away users that would fit this community and have actions or ideology that don't actually affect this community, I would not be helping the community.&lt;/p&gt;&#xA;" OwnerUserId="76162" LastEditorUserId="76162" LastEditDate="2020-09-20T22:08:15.290" LastActivityDate="2020-09-20T22:08:15.290" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19353" PostTypeId="2" ParentId="19344" CreationDate="2020-09-20T18:20:40.990" Score="2" Body="&lt;blockquote&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;How would you deal with a user who produced a steady stream of valuable answers, but tends to generate a large number of arguments/flags from comments?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I think cultivating a non-toxic environment is very important. No answers are valuable enough to ignore hostile behavior that is driving other users away.&lt;/p&gt;&#xA;&lt;p&gt;Any user who is being disruptive should be receive a warning about their behavior. If the behavior continues, at some point there is no choice but to issue a suspension.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;How would you handle a situation where another mod closed/deleted/etc a question/answer that you feel shouldn't have been?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Most of the time, I would defer to the other moderator. If I think the closure/deletion/etc is definitely incorrect, I would discuss it with the other moderator(s) involved. There is no point in having moderators that are rolling back each others' actions. Once we have come to a consensus one of us can implement said consensus.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;3&quot;&gt;&#xA;&lt;li&gt;In your opinion, what do moderators do?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Moderators help to enforce the will of the community by curating the content using tools that are not available to other users. Moderators also step in to handle disruptive behavior.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;4&quot;&gt;&#xA;&lt;li&gt;A diamond will be attached to everything you say and have said in the past, including questions, answers and comments. Everything you will do will be seen under a different light. How do you feel about that?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Some of my answers might be embarrassing from a &amp;quot;wow I'm not very good at code golfing&amp;quot; standpoint, but becoming a moderator wouldn't make that any worse.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;5&quot;&gt;&#xA;&lt;li&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;For a start, it will allow me to get started with moderating tasks about 20 years earlier.&lt;/p&gt;&#xA;&lt;p&gt;More importantly, I believe moderators should use their tools very differently that an ordinary high-rep user. An ordinary user can cast a close vote on a question that they believe in their own opinion does not belong here, while a moderator should be more conscientious and only cast a close vote as an extension of community consensus.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;6&quot;&gt;&#xA;&lt;li&gt;A good deal of pending flags are on answers a few years old which have been flagged as invalid based on meta consensus on golf submissions, which sometimes postdates those answers. How would you handle these?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The current community consensus is pretty clear that these answers should be deleted, so I would check that the answer is actually invalid and then delete it. If there is not already a comment left below the answer, I would leave one and give the OP a few days to correct it.&lt;/p&gt;&#xA;&lt;p&gt;If that consensus changes in the future, I would follow the new consensus.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;7&quot;&gt;&#xA;&lt;li&gt;A new user has put a brilliant solution to a challenge in the comments section of the question. Other users point this out in the comments, and even try to guide the user to posting an actual answer, but the user seems to have disappeared. Flags start coming in that the comment should be converted to an answer. What do you do?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I don't feel this requires moderator intervention. Any user is welcome to make an answer out of a comment, though they should certainly attribute the original commenter and elaborate as appropriate.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;8&quot;&gt;&#xA;&lt;li&gt;&lt;p&gt;Moderators must sign an &lt;a href=&quot;https://codegolf.stackexchange.com/legal/moderator-agreement&quot;&gt;agreement&lt;/a&gt; whose terms include:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;i. I will abide by the current &lt;a href=&quot;https://codegolf.stackexchange.com/conduct&quot;&gt;Code of Conduct&lt;/a&gt; (which is a part of this agreement), and enforce it to the best of my ability.&lt;br /&gt;&#xA;...&lt;br /&gt;&#xA;iv. I will abide by all other officially announced moderator and user policies &lt;a href=&quot;https://codegolf.stackexchange.com/help/mod-agreement-policies&quot;&gt;made available to me&lt;/a&gt;.&lt;br /&gt;&#xA;v. I will accept additional guidance given by members of the Stack Exchange, Inc. Community Team and Senior Leadership Team, whether in response to questions, concerns or discussions regarding existing network-wide policies.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;How would you respond if a policy or company directive (current or future) seems to conflict with your beliefs and ideals?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I have already accepted the new moderator agreement. If a company directive is absolutely incompatible with my beliefs and SE is unwilling to discuss it, I would have no choice but to resign. For what it's worth, I didn't resign when so many other moderators did, and I feel it is very unlikely that SE will take similar action in the near future.&lt;/p&gt;&#xA;" OwnerUserId="58834" LastEditorUserId="58834" LastEditDate="2020-09-20T19:44:19.090" LastActivityDate="2020-09-20T19:44:19.090" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="19354" PostTypeId="2" ParentId="19344" CreationDate="2020-09-21T04:02:19.603" Score="11" Body="&lt;h2&gt;HyperNeutrino&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;How would you deal with a user who produced a steady stream of valuable answers, but tends to generate a large number of arguments/flags from comments?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I believe that rules should be rigorous and enforcement should be consistent. If an infraction is enough to warrant a punishment, a user that contributes shouldn't be let off the hook for that. If one could justify not punishing that infraction, then no member should be punished for it. I would attempt to break down the issue and help a user back onto the right track, as this is healthier for the community and would avoid losing their contributions, but I believe in this approach for all users.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;How would you handle a situation where another mod closed/deleted/etc a question/answer that you feel shouldn't have been?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I believe that the most important part to healthy moderation and community, especially in Stack Exchange's moderation model is communication. I would privately communicate with the moderator with what I would have decided and my justification, and ask for why they made the decision they did. If we cannot come to an agreement by discussing, I would raise it to the other moderators and discuss it together, and we would come to a consensus on what action to take on the post.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;3&quot;&gt;&#xA;&lt;li&gt;In your opinion, what do moderators do?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I believe that moderators &lt;em&gt;should&lt;/em&gt; serve two main purposes - firstly, to represent the values of the community and serve as the anchor to the community, reflecting the positive qualities of the community, and secondly, to enforce these values and rules, and act as an unbiased force to ensure everything runs smoothly, everyone is behaving civilly, and to intervene in extreme cases.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;4&quot;&gt;&#xA;&lt;li&gt;A diamond will be attached to everything you say and have said in the past, including questions, answers and comments. Everything you will do will be seen under a different light. How do you feel about that?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I am happy to attach a diamond to everything I have and will say as I believe how I have acted and spoken on this site reflects the qualities I wish to see in this community. I will continue to act this way and especially if I do gain the diamond that signifies me as a moderator to CGCC, I will ensure 100% of my behavior reflects how users and members here should act.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;5&quot;&gt;&#xA;&lt;li&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Being a moderator would have two large effects for me. Firstly, it means that I can act quickly and directly on decisions that, given my experience with this site and interacting with the community, I am near 100% confident would be the best for CGCC. Secondly, it means that I am identified as a community member that any user can go to for help.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;6&quot;&gt;&#xA;&lt;li&gt;A good deal of pending flags are on answers a few years old which have been flagged as invalid based on meta consensus on golf submissions, which sometimes postdates those answers. How would you handle these?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;In general, I believe that extremely old answers on inactive questions are unlikely to really be noticed and thus I would prioritize pressing matters first. However, again, I believe rules should apply always and unambiguously, so if the submission is just trivially reparable, I would edit the answer and leave a comment for the user telling them what I changed and including a link to the meta consensus that I am complying with, and if the answer is seriously invalid, I would delete the answer and comment to the user to fix the answer and flag it to be considered for undeletion.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;7&quot;&gt;&#xA;&lt;li&gt;A new user has put a brilliant solution to a challenge in the comments section of the question. Other users point this out in the comments, and even try to guide the user to posting an actual answer, but the user seems to have disappeared. Flags start coming in that the comment should be converted to an answer. What do you do?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;If the user seems to be entirely absent and is just gone, I don't think they would lose anything from someone else posting the idea as an answer, though I would encourage them to credit the original user and make their answer community wiki so they don't gain free reputation from someone else's contributions (if they took a base idea and extended greatly on it, I would not encourage this, though I suppose a &amp;quot;brilliant solution&amp;quot; would probably be complete).&lt;/p&gt;&#xA;&lt;p&gt;I would make attempts to contact the user one final time first, but if that seems impossible, I would leave a comment advising the same things I've answered here.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;8&quot;&gt;&#xA;&lt;li&gt;&lt;p&gt;Moderators must sign an &lt;a href=&quot;https://codegolf.stackexchange.com/legal/moderator-agreement&quot;&gt;agreement&lt;/a&gt; whose terms include:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;i. I will abide by the current &lt;a href=&quot;https://codegolf.stackexchange.com/conduct&quot;&gt;Code of Conduct&lt;/a&gt; (which is a part of this agreement), and enforce it to the best of my ability.&lt;br /&gt;&#xA;...&lt;br /&gt;&#xA;iv. I will abide by all other officially announced moderator and user policies &lt;a href=&quot;https://codegolf.stackexchange.com/help/mod-agreement-policies&quot;&gt;made available to me&lt;/a&gt;.&lt;br /&gt;&#xA;v. I will accept additional guidance given by members of the Stack Exchange, Inc. Community Team and Senior Leadership Team, whether in response to questions, concerns or discussions regarding existing network-wide policies.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;How would you respond if a policy or company directive (current or future) seems to conflict with your beliefs and ideals?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I have individual beliefs and values; however, my priorities as a moderator are to enforce what the policies and company directive dictate. If it's something that I would be able to discuss on main meta or with other mods or staff, I would take that approach first, and understand the decisions. Should an action I have to take to stick to my priorities and moderator duties seriously contradict my important core beliefs and values, then I believe this indicates I would no longer be suitable as a moderator, and if my beliefs would prevent me from properly moderating for this community, then I would be forced to resign, which I believe would be the best decision I could make for the community while not acting against my will.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2020-09-21T04:02:19.603" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19355" PostTypeId="2" ParentId="2140" CreationDate="2020-09-21T06:29:30.993" Score="3" Body="&lt;h1&gt;Secret &amp;quot;&amp;gt;&amp;quot; Stacking Challenge: cheating &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tetris&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tetris&amp;#39;&quot; rel=&quot;tag&quot;&gt;tetris&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Sequel to &lt;a href=&quot;https://codegolf.stackexchange.com/q/209720/78410&quot;&gt;Secret &amp;quot;&amp;gt;&amp;quot; Stacking Challenge: grading&lt;/a&gt;. You can skip the whole Background section if you already read the first one.&lt;/p&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://harddrop.com/wiki/TGM3&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tetris Grand Master 3&lt;/a&gt; has a hidden grading system based on the shape of the stack at the end of the game, which is called &lt;a href=&quot;https://harddrop.com/wiki/Tetromino_art#Greater_than&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Secret &amp;quot;&amp;gt;&amp;quot; Stacking Challenge&lt;/strong&gt;&lt;/a&gt;. It consists of entirely filling the lowest rows except for the zigzag pattern which starts at the left bottom cell and spans the entire width:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#&#xA;.#########&#xA;#.########&#xA;##.#######&#xA;###.######&#xA;####.#####&#xA;#####.####&#xA;######.###&#xA;#######.##&#xA;########.#&#xA;#########.&#xA;########.#&#xA;#######.##&#xA;######.###&#xA;#####.####&#xA;####.#####&#xA;###.######&#xA;##.#######&#xA;#.########&#xA;.#########&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The board is graded by how many lines follow this exact pattern from the bottom line. Note that the topmost hole in the pattern must be blocked by an extra piece of block. If you consider the &lt;code&gt;#&lt;/code&gt;s and &lt;code&gt;.&lt;/code&gt;s as the mandatory pattern (blanks can be anything), you can get the score of 19 only if the exact pattern above is matched from the bottom line. Analogously, if the board matches this pattern&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;   #&#xA;###.######&#xA;##.#######&#xA;#.########&#xA;.#########&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;but not&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    #&#xA;####.#####&#xA;###.######&#xA;##.#######&#xA;#.########&#xA;.#########&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;then the score is 4.&lt;/p&gt;&#xA;&lt;p&gt;For this challenge, consider a board of arbitrary size (other than 20 cells high and 10 cells wide). We can grade the board for the same pattern: for example, if the board has width 4, this is the pattern for score 3:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  #&#xA;##.#&#xA;#.##&#xA;.###&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and this is the pattern for score 10:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;   #&#xA;###.&#xA;##.#&#xA;#.##&#xA;.###&#xA;#.##&#xA;##.#&#xA;###.&#xA;##.#&#xA;#.##&#xA;.###&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given the board width and the desired score for Secret &amp;quot;&amp;gt;&amp;quot; Stacking Challenge, pick a sequence of tetrominoes and generate the sequence of moves that will achieve the score. The Tetris moves can be represented in any ways that clearly specify where each tetromino is placed in which orientation, optionally along with the board state after each placement.&lt;/p&gt;&#xA;&lt;p&gt;For the Tetris movement rules, we use simple permissive rule as in &lt;a href=&quot;https://codegolf.stackexchange.com/q/211033/78410&quot;&gt;this challenge&lt;/a&gt;: you can place a tetromino anywhere (even in closed rooms), as long as it doesn't float in the air or overlap with existing pieces. Therefore, if you plan to use coordinates, you need to specify both x and y coordinates (the y coordinate should be counted from the bottom, as the board can grow upwards without bound -- or count from the top by also outputting the field height).&lt;/p&gt;&#xA;&lt;p&gt;You can assume the width is at least 5 and the score is nonzero. You should theoretically support arbitrarily high score. The generated sequence doesn't need to be minimal.&lt;/p&gt;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply. The shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Output example&lt;/h2&gt;&#xA;&lt;p&gt;For board with 6 and score 2, one possible way is as follows: (&lt;code&gt;A&lt;/code&gt;s are the tetromino placed at each turn, &lt;code&gt;#&lt;/code&gt; are existing pieces on the board, and &lt;code&gt;.&lt;/code&gt; are empty cells)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;......  ......  ......  ......  ......&#xA;A.....  #.....  #.....  .AA...  .##AA.&#xA;AA....  ##AA..  ####AA  #.AA..  #.##AA&#xA;.A....  .#AA..  .###AA  .#####  .#####&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The above is a valid output format (you can choose any distinct chars/values in place of &lt;code&gt;.A#&lt;/code&gt;). The following is also valid (although it is less obvious, it is indeed an unambiguous description of tetromino placements):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;......  ......  ......  ......  ......&#xA;A.....  ......  ......  .AA...  ...AA.&#xA;AA....  ..AA..  ....AA  ..AA..  ....AA&#xA;.A....  ..AA..  ....AA  ......  ......&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And this: (tetromino code, rotation, x and y coordinates from bottom left, 0 indexed)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;S 1 0 0&#xA;O 0 2 0&#xA;O 0 4 0&#xA;Z 0 1 1&#xA;Z 0 3 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And anything in between (e.g. showing tetrominos as a canonicalized matrix instead of a code). If in doubt, ask in comments.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2020-10-16T08:28:18.093" LastActivityDate="2020-10-16T08:28:18.093" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19356" PostTypeId="2" ParentId="19344" CreationDate="2020-09-21T08:16:54.230" Score="8" Body="&lt;h2&gt;caird coinheringaahing&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;How would you deal with a user who produced a steady stream of valuable answers, but tends to generate a large number of arguments/flags from comments?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Similarly to the other nominees, I believe that every user should be treated fairly, regardless of the quality of content they are producing. Therefore, I'd engage the problematic user in a discussion about why they're behaving this way and what can be done to stop. Hopefully, the user would recognize that they're having a detrimental effect on the site and would stop their disruptive behaviour.&lt;/p&gt;&#xA;&lt;p&gt;However, if, after having this discussion, they continued, I would put them in a 7-day suspension, detailing exactly why, in an effort to prevent their activity from continuing to hurt the site.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;How would you handle a situation where another mod closed/deleted/etc a question/answer that you feel shouldn't have been?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I have a great deal of respect for our current mod, &lt;a href=&quot;https://codegolf.stackexchange.com/users/3808/doorknob&quot;&gt;Doorknob&lt;/a&gt;, as well as my fellow nominees, and so find it difficult to believe such as issue would come up that wouldn't be solvable with a quick discussion as to why they did what they did, and then if anything needs reverting, I'd either do it myself or allow the original moderator to do so.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;3&quot;&gt;&#xA;&lt;li&gt;In your opinion, what do moderators do?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;In my view, moderators use the extra tools they're granted in order to improve the site's health and overall quality. They do this by removing posts that regular users may not be able to (and that should, under site rules, be removed), prevent discussions between users escalating into arguments, and generally stepping in to prevent poor behaviour from hurting the site where regular users have been ineffective.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;4&quot;&gt;&#xA;&lt;li&gt;A diamond will be attached to everything you say and have said in the past, including questions, answers and comments. Everything you will do will be seen under a different light. How do you feel about that?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I won't lie, I've had a couple of issues in my past on this site. I've been suspended twice and, because of my poor understanding of the site early on, I have a poor question record (according to SE's metric, hence why I don't have the &lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/91/curious&quot;&gt;Curious&lt;/a&gt; badge or its related badges). However, that occurred over 3 years ago, and, since then, I believe I've been a valuable voice on both Main and Meta.&lt;/p&gt;&#xA;&lt;p&gt;I currently do not have any issue with anything I've posted to this site being attached to a diamond. There are moments in the past where I made a stupid mistake, but I've moved on and learned from those, and have no shame with users being aware of that.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;5&quot;&gt;&#xA;&lt;li&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The unique tools granted to moderators would allow me to better improve the site when necessary, more so than either the 10k or 20k rep tools could. Most notably (for me at least) is the influence that comes with a diamond that reputation cannot fully convey. I believe I'd be able to help new users integrate into the site better with such trust as well as better moderate disagreements between users.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;6&quot;&gt;&#xA;&lt;li&gt;A good deal of pending flags are on answers a few years old which have been flagged as invalid based on meta consensus on golf submissions, which sometimes postdates those answers. How would you handle these?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8076&quot;&gt;Consensus applies to &lt;em&gt;all&lt;/em&gt; posts, past or present&lt;/a&gt;. For invalid posts, my general policy would be to leave a comment informing the user that their answer in invalid under a specific consensus and give them 24 hours to correct this. If they haven't responded after such time, I'd inform them that they can flag for moderator attention if/when they correct their answer and I'd delete the answer.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;7&quot;&gt;&#xA;&lt;li&gt;A new user has put a brilliant solution to a challenge in the comments section of the question. Other users point this out in the comments, and even try to guide the user to posting an actual answer, but the user seems to have disappeared. Flags start coming in that the comment should be converted to an answer. What do you do?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;First of all, I'd check the user's page. If they haven't been active on the site since they posted the comment, I'd leave a comment requesting that people stop asking for the comment to be converted to an answer as there's nothing a mod could or should do in this case. If however, the user has been active since posting the comment, I'd try to contact them either through chat or by leaving a comment, asking them if they want to convert their comment into an answer. If so, I'd help them do so, otherwise, I'd do the same thing I'd do if the user hadn't been active.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;8&quot;&gt;&#xA;&lt;li&gt;&lt;p&gt;Moderators must sign an &lt;a href=&quot;https://codegolf.stackexchange.com/legal/moderator-agreement&quot;&gt;agreement&lt;/a&gt; whose terms include:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;i. I will abide by the current &lt;a href=&quot;https://codegolf.stackexchange.com/conduct&quot;&gt;Code of Conduct&lt;/a&gt; (which is a part of this agreement), and enforce it to the best of my ability.&lt;br /&gt;&#xA;...&lt;br /&gt;&#xA;iv. I will abide by all other officially announced moderator and user policies &lt;a href=&quot;https://codegolf.stackexchange.com/help/mod-agreement-policies&quot;&gt;made available to me&lt;/a&gt;.&lt;br /&gt;&#xA;v. I will accept additional guidance given by members of the Stack Exchange, Inc. Community Team and Senior Leadership Team, whether in response to questions, concerns or discussions regarding existing network-wide policies.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;How would you respond if a policy or company directive (current or future) seems to conflict with your beliefs and ideals?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;As with most users, I have a certain line I will not cross. I can't articulate exactly what that line is, but, in general, I have a &amp;quot;Don't be an a**hole&amp;quot; approach to most things. If SE forced me to choose between being a moderator and violating my principles (which I very much hope they wouldn't), without a doubt, I would hand in my diamond and step down as a moderator.&lt;/p&gt;&#xA;&lt;p&gt;I've made it very clear that I &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8076&quot;&gt;agree with the former moderators&lt;/a&gt;, and I'm only nominating myself for the sake of the site's health, not because I condone SE's actions. Despite agreeing with the reasons for the former mods stepping down, &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/55482274#55482274&quot;&gt;the site needs moderators&lt;/a&gt; in my view, and I believe I'd be a good choice for such a role.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2020-09-21T08:16:54.230" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19357" PostTypeId="2" ParentId="8047" CreationDate="2020-09-22T07:31:46.387" Score="14" Body="&lt;h1&gt;Parsing expressions&lt;/h1&gt;&#xA;&lt;p&gt;In challenges dealing with algebraic expressions, don't make the golfer parse input strings like &lt;code&gt;x^3-2x+1&lt;/code&gt; or &lt;code&gt;e^2^x&lt;/code&gt;, or to output in this form. This is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8077/20260&quot;&gt;cumbersome I/O&lt;/a&gt; that takes a lot of bytes and effort in languages that aren't like Mathematica, distracting from the actual mathematical task. For instance, a challenge about differentiating polynomials should allow them to be represented as lists of coefficients.&lt;/p&gt;&#xA;&lt;p&gt;If you do insist on allowing a broad class of nested expressions like &lt;code&gt;2^(x+3)&lt;/code&gt;, consider allowing them in a pre-parsed tree like &lt;code&gt;[&amp;quot;Exp&amp;quot;, 2, [&amp;quot;Plus&amp;quot;, Var(&amp;quot;x&amp;quot;), 3]]&lt;/code&gt;. But, make sure you give a precise, comprehensive description of exactly what operations and values can be included. Try to include as few operations as is necessary for the challenge to work.&lt;/p&gt;&#xA;&lt;p&gt;Beware that not all expressions are algebraically &amp;quot;nice&amp;quot;, and make sure your test cases cover the gamut of possible expressions. In particular, consider how to deal with things like &lt;code&gt;x/0&lt;/code&gt; or &lt;code&gt;0^0&lt;/code&gt; or &lt;code&gt;(-2)^(1/2)&lt;/code&gt; or &lt;code&gt;(x*x)**0.5/x&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Make sure your problem is actually solvable. Note that there provably &lt;a href=&quot;https://en.wikipedia.org/wiki/Richardson%27s_theorem&quot; rel=&quot;nofollow noreferrer&quot;&gt;doesn't exist any algorithm to decide&lt;/a&gt; whether an expression in a real variable &lt;code&gt;x&lt;/code&gt; is always zero for every &lt;code&gt;x&lt;/code&gt;, if certain operations and constants are allowed. So, your challenge might be outright impossible.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2023-04-26T01:12:09.267" LastActivityDate="2023-04-26T01:12:09.267" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19358" PostTypeId="2" ParentId="2140" CreationDate="2020-09-22T16:15:30.257" Score="7" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/217175/66833&quot;&gt;Output a unique sign sequence&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-01-02T20:43:26.833" LastActivityDate="2021-01-02T20:43:26.833" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="19359" PostTypeId="2" ParentId="19156" CreationDate="2020-09-22T16:59:38.953" Score="1" Body="&lt;p&gt;We have countless examples of highly upvoted answers sending SQL output to either the &lt;em&gt;results&lt;/em&gt; pane (via &lt;code&gt;SELECT&lt;/code&gt;) or to the &lt;em&gt;messages&lt;/em&gt; pane (via &lt;code&gt;PRINT&lt;/code&gt;), depending on which works the best and is shorter for a particular challenge.&lt;/p&gt;&#xA;&lt;p&gt;Both are acceptable.&lt;/p&gt;&#xA;&lt;p&gt;(This uses terminology from MS SQL Management Studio, other platforms/clients likely have equivalents.)&lt;/p&gt;&#xA;&lt;p&gt;Note other outputs are possible as well, such as outputting graphical results to the &lt;a href=&quot;https://codegolf.stackexchange.com/a/211500/70172&quot;&gt;spatial results pane&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="70172" LastActivityDate="2020-09-22T16:59:38.953" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19360" PostTypeId="2" ParentId="2447" CreationDate="2020-09-22T18:29:23.720" Score="11" Body="&lt;h1&gt;SQL-based languages can output via &lt;code&gt;SELECT&lt;/code&gt; or &lt;code&gt;PRINT&lt;/code&gt;&lt;/h1&gt;&#xA;&lt;p&gt;We have countless examples of highly upvoted answers sending SQL output to either the &lt;em&gt;results&lt;/em&gt; pane (via &lt;code&gt;SELECT&lt;/code&gt;) or to the &lt;em&gt;messages&lt;/em&gt; pane (via &lt;code&gt;PRINT&lt;/code&gt;), depending on which works the best and is shorter for a particular challenge.&lt;/p&gt;&#xA;&lt;p&gt;Both are acceptable.&lt;/p&gt;&#xA;&lt;p&gt;(This uses terminology from MS SQL Management Studio, other platforms/clients likely have equivalents.)&lt;/p&gt;&#xA;&lt;p&gt;Other outputs may be possible as well, such as outputting graphical results to the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/191294/draw-the-biohazard-symbol/191323#191323&quot;&gt;spatial results pane&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="70172" LastActivityDate="2020-09-22T18:29:23.720" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19362" PostTypeId="2" ParentId="2140" CreationDate="2020-09-23T08:09:18.160" Score="0" Body="&lt;p&gt;A centered hexagonal number is a centered figurate number that represents a hexagon with a dot in the center and all other dots surrounding the center dot in a hexagonal lattice.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Illustration of initial terms:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;                                 o o o o&#xA;                   o o o        o o o o o&#xA;         o o      o o o o      o o o o o o&#xA;   o    o o o    o o o o o    o o o o o o o&#xA;         o o      o o o o      o o o o o o&#xA;                   o o o        o o o o o&#xA;                                 o o o o&#xA;&#xA;   1      7          19             37&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Write a function that takes an integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and returns &lt;code&gt;&amp;quot;Invalid&amp;quot;&lt;/code&gt; if &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is not a centered hexagonal number or its illustration as a multiline rectangular string otherwise.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Sample Output :-&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;hexLattice(1) ➞ &amp;quot; o &amp;quot;&#xA;// o&#xA;&#xA;hexLattice(7) ➞ &amp;quot;  o o  \n o o o \n  o o  &amp;quot;&#xA;//  o o&#xA;// o o o&#xA;//  o o&#xA;&#xA;hexLattice(19) ➞ &amp;quot;   o o o   \n  o o o o  \n o o o o o \n  o o o o  \n   o o o   &amp;quot;&#xA;//   o o o&#xA;//  o o o o&#xA;// o o o o o&#xA;//  o o o o&#xA;//   o o o&#xA;&#xA;hexLattice(21) ➞ &amp;quot;Invalid&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Shortest Code Wins!&lt;/p&gt;&#xA;" OwnerUserId="98366" LastEditorUserId="66833" LastEditDate="2020-09-24T20:05:50.363" LastActivityDate="2020-09-24T20:05:50.363" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19367" PostTypeId="2" ParentId="5243" CreationDate="2020-09-25T03:37:58.760" Score="18" Body="&lt;h1&gt;100-200 rep for good answers in interesting new languages&lt;/h1&gt;&#xA;&lt;p&gt;This is a bit subjective of course, but here are my criteria:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The language is fairly new, and is interesting (in my opinion)&lt;/li&gt;&#xA;&lt;li&gt;The answer is clever, shows a lot of work put in, and shows off many features of the language (so no trivial posts in interesting languages)&lt;/li&gt;&#xA;&lt;li&gt;I have not awarded this bounty in a while (since I don't have much rep)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;No requirements on what type of language (esoteric, golfing, practical, etc.). Doesn't have to be an answer by the language creator. I'm always interested in new languages, so if you think your post or someone else's deserves this bounty, leave a comment!&lt;/p&gt;&#xA;&lt;hr/&gt;&#xA;&lt;p&gt;&lt;strong&gt;Awarded:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/216052/79857&quot;&gt;Generate Pascal's Triangle&lt;/a&gt; (written in &lt;a href=&quot;http://xn--wxa.land/convey/&quot; rel=&quot;nofollow noreferrer&quot;&gt;convey&lt;/a&gt;) by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95594/xash&quot;&gt;xash&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/217909/79857&quot;&gt;Simple cat program&lt;/a&gt; (written in &lt;a href=&quot;https://esolangs.org/wiki/V%C2%B3&quot; rel=&quot;nofollow noreferrer&quot;&gt;v³&lt;/a&gt;) by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100336/bo-tie&quot;&gt;Bo_Tie&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/218879/79857&quot;&gt;Follow a linked list&lt;/a&gt; (written in &lt;a href=&quot;https://github.com/DRH001/Rattle&quot; rel=&quot;nofollow noreferrer&quot;&gt;Rattle&lt;/a&gt;) by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95671/daniel-h&quot;&gt;Daniel H.&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223430/79857&quot;&gt;Fibonacci function or sequence&lt;/a&gt; (written in &lt;a href=&quot;https://github.com/LorenDB/barrel&quot; rel=&quot;nofollow noreferrer&quot;&gt;Barrel&lt;/a&gt;) by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92212/lorendb&quot;&gt;LorenDB&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223333/79857&quot;&gt;Division and remainder&lt;/a&gt; (written in &lt;a href=&quot;https://github.com/AMiller42/Grok-Language&quot; rel=&quot;nofollow noreferrer&quot;&gt;Grok&lt;/a&gt;) by &lt;a href=&quot;https://codegolf.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world/223559#223559&quot;&gt;Hello, world!&lt;/a&gt; (written in &lt;a href=&quot;https://tildegit.org/karx/sandwich&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sandwich&lt;/a&gt;) by &lt;a href=&quot;https://codegolf.stackexchange.com/users/103219/y45hk4r4nd1k4r&quot;&gt;Y45HK4R4ND1K4R&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/8696/print-this-diamond/230675#230675&quot;&gt;Print this diamond&lt;/a&gt; (written in &lt;a href=&quot;https://github.com/dloscutoff/Esolangs/tree/master/Regenerate&quot; rel=&quot;nofollow noreferrer&quot;&gt;Regenerate&lt;/a&gt;) by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2021-06-29T15:53:51.297" LastActivityDate="2021-06-29T15:53:51.297" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="19370" PostTypeId="2" ParentId="2140" CreationDate="2020-09-25T20:01:44.797" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/212068/66833&quot;&gt;Peel away the layers - Cops&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/212069/66833&quot;&gt;Peel away the layers - Robbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2020-10-05T13:24:12.163" LastActivityDate="2020-10-05T13:24:12.163" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="19372" PostTypeId="2" ParentId="5243" CreationDate="2020-09-27T16:21:29.740" Score="8" Body="&lt;h1&gt;50-300 rep for answers to unanswered questions&lt;/h1&gt;&#xA;&lt;p&gt;Similar to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17337/66833&quot;&gt;this&lt;/a&gt; offering, I will offer varying amounts of reputation for answers to questions that meet the following criteria:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The question is unanswered&lt;sup&gt;*&lt;/sup&gt;&lt;/li&gt;&#xA;&lt;li&gt;The question is at least one month old&lt;/li&gt;&#xA;&lt;li&gt;The question has a net score &lt;span class=&quot;math-container&quot;&gt;\$\ge3\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\lt 15\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;The question is not tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;The question is open&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;sub&gt;&lt;sup&gt;*&lt;/sup&gt;: Unanswered means that no answers have been posted to the question which fully complete the task in the question&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;p&gt;This list of questions, sorted by current score, can be found &lt;a href=&quot;https://codegolf.stackexchange.com/search?tab=votes&amp;amp;q=is%3aq%20answers%3a0%20score%3a3...14%20closed%3a0%20-%5btips%5d%20created%3a...1m&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The amount of reputation I will offer depends on the following criteria:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Age of the question (older questions will merit more rep)&lt;/li&gt;&#xA;&lt;li&gt;How impressive I personally find the answer (based on language, score etc.)&lt;/li&gt;&#xA;&lt;li&gt;How difficult I perceive the challenge to be&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Obviously, these are subjective, but I will try to be as fair as I can.&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, if awarding a bounty will drop me below a &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges&quot;&gt;privilege level&lt;/a&gt;, causing me to lose it, I will postpone awarding the bounty until I have enough rep to avoid this. However, such bounties will only be &lt;em&gt;postponed&lt;/em&gt;, so all valid answers will eventually receive their deserved bounties.&lt;/p&gt;&#xA;&lt;p&gt;To claim a bounty, as normal, ping me in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;chat&lt;/a&gt; or leave a comment below. If unable to do so due to reputation requirements, ask another user to do so for you, so I don't miss any answers.&lt;/p&gt;&#xA;&lt;p&gt;Once you claim one of these bounties, please edit it in below&lt;/p&gt;&#xA;&lt;h2&gt;Claimed bounties&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;150 rep to &lt;a href=&quot;https://codegolf.stackexchange.com/users/68942/hyperneutrino&quot;&gt;HyperNeutrino&lt;/a&gt; for answering &lt;a href=&quot;https://codegolf.stackexchange.com/questions/93125/generate-menu-access-keys&quot;&gt;Generate Menu Access Keys&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;50 rep to &lt;a href=&quot;https://codegolf.stackexchange.com/users/68942/hyperneutrino&quot;&gt;HyperNeutrino&lt;/a&gt; for answering &lt;a href=&quot;https://codegolf.stackexchange.com/questions/93651/expand-the-variadic-expression&quot;&gt;Expand the variadic expression&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;150 rep to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78123/wastl&quot;&gt;wastl&lt;/a&gt; for answering &lt;a href=&quot;https://codegolf.stackexchange.com/questions/165423/recording-xiangqi-moves&quot;&gt;Recording xiangqi moves&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;200 rep to &lt;a href=&quot;https://codegolf.stackexchange.com/users/17602/neil&quot;&gt;Neil&lt;/a&gt; for answering &lt;a href=&quot;https://codegolf.stackexchange.com/q/205861/66833&quot;&gt;Score a 1 player game of Carcassonne&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;50 rep to &lt;a href=&quot;https://codegolf.stackexchange.com/users/94093/easyaspi&quot;&gt;EasyasPi&lt;/a&gt; for answering &lt;a href=&quot;https://codegolf.stackexchange.com/questions/193815/test-the-endianness&quot;&gt;Test the endianness&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;300 rep to &lt;a href=&quot;https://codegolf.stackexchange.com/users/104752/m90&quot;&gt;m90&lt;/a&gt; for answering &lt;a href=&quot;https://codegolf.stackexchange.com/questions/204779/final-tribute-to-john-conway-fractran-self-interpreter&quot;&gt;Final tribute to John Conway: FRACTRAN self-interpreter&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;100 rep to &lt;a href=&quot;https://codegolf.stackexchange.com/users/87606/tjjfvi&quot;&gt;tjjfvi&lt;/a&gt; for answering &lt;a href=&quot;https://codegolf.stackexchange.com/q/67033/66833&quot;&gt;Please parse this aLL1en language&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;100 rep to &lt;a href=&quot;https://codegolf.stackexchange.com/users/104508/ryno&quot;&gt;ryno&lt;/a&gt; for answering &lt;a href=&quot;https://codegolf.stackexchange.com/q/73759/66833&quot;&gt;The knight&amp;#39;s next tour&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;100 rep to &lt;a href=&quot;https://codegolf.stackexchange.com/users/92901/dingus&quot;&gt;Dingus&lt;/a&gt; for answering &lt;a href=&quot;https://codegolf.stackexchange.com/q/48386/66833&quot;&gt;Simulate a Game of Quagmire&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;50 rep to &lt;a href=&quot;https://codegolf.stackexchange.com/users/92901/dingus&quot;&gt;Dingus&lt;/a&gt; for answering&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/53436/66833&quot;&gt;Printing the Cracker Barrel Game&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-09-07T20:54:59.343" LastActivityDate="2021-09-07T20:54:59.343" CommentCount="7" CommunityOwnedDate="2020-10-08T16:20:08.303" ContentLicense="CC BY-SA 4.0" />
  <row Id="19373" PostTypeId="2" ParentId="2140" CreationDate="2020-09-28T14:30:44.260" Score="4" Body="&lt;h3&gt;All work and no play but it gets thinner every time&lt;/h3&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your objective is to output the unique string with the following properties:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each paragraph consists entirely of repetitions of the sentence &lt;code&gt;All work and no play makes Jack a dull boy.&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The first paragraph is a single line with exactly one repetition of the sentence.&lt;/li&gt;&#xA;&lt;li&gt;Each line of each subsequent paragraph is shorter than the longest line of the previous paragraph.&lt;/li&gt;&#xA;&lt;li&gt;Each line contains as many words of the sentence as possible without exceeding the length limit, and no trailing whitespace.&lt;/li&gt;&#xA;&lt;li&gt;Paragraph ends when its next line would be identical of some previous line of the same paragraph, possibly terminating the last sentence early.&lt;/li&gt;&#xA;&lt;li&gt;The last paragraph has the same width as the longest word in the sentence (5).&lt;/li&gt;&#xA;&lt;li&gt;There's a pair of line ends between each pair of paragraphs, a single line end after the last paragraph, and no line end before the first paragraph.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The string produced by these rules has: 5025 bytes when using Windows line ends (CR LF) or 4796 bytes using Linux line ends (LF); 229 line ends; 103 full repetitions of the sentence and 11 partial repetitions. It can be compressed into a 249-byte deflate stream (bubblegum code). The full string is included below for reference.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;All work and no play makes Jack a dull boy.&#xA;&#xA;All work and no play makes Jack a dull&#xA;boy. All work and no play makes Jack a&#xA;dull boy. All work and no play makes Jack&#xA;a dull boy. All work and no play makes&#xA;Jack a dull boy. All work and no play&#xA;makes Jack a dull boy. All work and no&#xA;play makes Jack a dull boy. All work and&#xA;no play makes Jack a dull boy. All work&#xA;and no play makes Jack a dull boy. All&#xA;work and no play makes Jack a dull boy.&#xA;&#xA;All work and no play makes Jack a dull&#xA;boy. All work and no play makes Jack a&#xA;dull boy. All work and no play makes&#xA;Jack a dull boy. All work and no play&#xA;makes Jack a dull boy. All work and no&#xA;play makes Jack a dull boy. All work and&#xA;no play makes Jack a dull boy. All work&#xA;and no play makes Jack a dull boy. All&#xA;work and no play makes Jack a dull boy.&#xA;&#xA;All work and no play makes Jack a dull&#xA;boy. All work and no play makes Jack a&#xA;dull boy. All work and no play makes&#xA;Jack a dull boy. All work and no play&#xA;makes Jack a dull boy. All work and no&#xA;play makes Jack a dull boy. All work&#xA;and no play makes Jack a dull boy. All&#xA;work and no play makes Jack a dull boy.&#xA;&#xA;All work and no play makes Jack a dull&#xA;boy. All work and no play makes Jack a&#xA;dull boy. All work and no play makes&#xA;Jack a dull boy. All work and no play&#xA;makes Jack a dull boy. All work and no&#xA;play makes Jack a dull boy. All work&#xA;and no play makes Jack a dull boy. All&#xA;work and no play makes Jack a dull&#xA;&#xA;All work and no play makes Jack a&#xA;dull boy. All work and no play makes&#xA;Jack a dull boy. All work and no play&#xA;makes Jack a dull boy. All work and&#xA;no play makes Jack a dull boy. All&#xA;work and no play makes Jack a dull&#xA;boy. All work and no play makes Jack&#xA;a dull boy. All work and no play&#xA;&#xA;All work and no play makes Jack a&#xA;dull boy. All work and no play makes&#xA;Jack a dull boy. All work and no&#xA;play makes Jack a dull boy. All work&#xA;and no play makes Jack a dull boy.&#xA;&#xA;All work and no play makes Jack a&#xA;dull boy. All work and no play&#xA;makes Jack a dull boy. All work and&#xA;no play makes Jack a dull boy. All&#xA;work and no play makes Jack a dull&#xA;boy. All work and no play makes&#xA;Jack a dull boy. All work and no&#xA;play makes Jack a dull boy. All&#xA;&#xA;All work and no play makes Jack a&#xA;dull boy. All work and no play&#xA;makes Jack a dull boy. All work&#xA;and no play makes Jack a dull boy.&#xA;&#xA;All work and no play makes Jack a&#xA;dull boy. All work and no play&#xA;makes Jack a dull boy. All work&#xA;and no play makes Jack a dull&#xA;boy. All work and no play makes&#xA;Jack a dull boy. All work and no&#xA;play makes Jack a dull boy. All&#xA;work and no play makes Jack a&#xA;&#xA;All work and no play makes Jack&#xA;a dull boy. All work and no play&#xA;makes Jack a dull boy. All work&#xA;and no play makes Jack a dull&#xA;boy. All work and no play makes&#xA;Jack a dull boy. All work and no&#xA;play makes Jack a dull boy. All&#xA;work and no play makes Jack a&#xA;dull boy. All work and no play&#xA;&#xA;All work and no play makes Jack&#xA;a dull boy. All work and no&#xA;play makes Jack a dull boy. All&#xA;work and no play makes Jack a&#xA;dull boy. All work and no play&#xA;makes Jack a dull boy. All work&#xA;and no play makes Jack a dull&#xA;boy. All work and no play makes&#xA;Jack a dull boy. All work and&#xA;no play makes Jack a dull boy.&#xA;&#xA;All work and no play makes&#xA;Jack a dull boy. All work and&#xA;no play makes Jack a dull boy.&#xA;&#xA;All work and no play makes&#xA;Jack a dull boy. All work and&#xA;no play makes Jack a dull&#xA;boy. All work and no play&#xA;makes Jack a dull boy. All&#xA;work and no play makes Jack a&#xA;dull boy. All work and no&#xA;play makes Jack a dull boy.&#xA;&#xA;All work and no play makes&#xA;Jack a dull boy. All work&#xA;and no play makes Jack a&#xA;dull boy. All work and no&#xA;play makes Jack a dull boy.&#xA;&#xA;All work and no play makes&#xA;Jack a dull boy. All work&#xA;and no play makes Jack a&#xA;dull boy. All work and no&#xA;play makes Jack a dull&#xA;boy. All work and no play&#xA;makes Jack a dull boy. All&#xA;work and no play makes&#xA;&#xA;All work and no play&#xA;makes Jack a dull boy.&#xA;&#xA;All work and no play&#xA;makes Jack a dull&#xA;boy. All work and no&#xA;play makes Jack a&#xA;dull boy. All work&#xA;and no play makes&#xA;Jack a dull boy. All&#xA;work and no play&#xA;&#xA;All work and no&#xA;play makes Jack a&#xA;dull boy. All work&#xA;and no play makes&#xA;Jack a dull boy.&#xA;&#xA;All work and no&#xA;play makes Jack a&#xA;dull boy. All&#xA;work and no play&#xA;makes Jack a dull&#xA;boy. All work and&#xA;no play makes&#xA;Jack a dull boy.&#xA;&#xA;All work and no&#xA;play makes Jack&#xA;a dull boy. All&#xA;work and no play&#xA;makes Jack a&#xA;dull boy. All&#xA;&#xA;All work and no&#xA;play makes Jack&#xA;a dull boy. All&#xA;work and no&#xA;&#xA;All work and&#xA;no play makes&#xA;Jack a dull&#xA;boy. All work&#xA;and no play&#xA;makes Jack a&#xA;dull boy. All&#xA;work and no&#xA;play makes&#xA;&#xA;All work and&#xA;no play&#xA;makes Jack a&#xA;dull boy.&#xA;&#xA;All work&#xA;and no play&#xA;makes Jack&#xA;a dull boy.&#xA;&#xA;All work&#xA;and no&#xA;play makes&#xA;Jack a&#xA;dull boy.&#xA;&#xA;All work&#xA;and no&#xA;play&#xA;makes&#xA;Jack a&#xA;dull boy.&#xA;&#xA;All work&#xA;and no&#xA;play&#xA;makes&#xA;Jack a&#xA;dull&#xA;boy. All&#xA;work and&#xA;no play&#xA;&#xA;All&#xA;work&#xA;and no&#xA;play&#xA;makes&#xA;Jack a&#xA;dull&#xA;boy.&#xA;&#xA;All&#xA;work&#xA;and&#xA;no&#xA;play&#xA;makes&#xA;Jack&#xA;a&#xA;dull&#xA;boy.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="7209" LastEditorUserId="7209" LastEditDate="2020-09-28T15:38:43.747" LastActivityDate="2020-09-28T15:38:43.747" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="19375" PostTypeId="1" CreationDate="2020-09-28T18:27:59.480" Score="16" ViewCount="167" Body="&lt;p&gt;So recently I've been reading through some &lt;a href=&quot;/questions/tagged/policy&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;policy&amp;#39;&quot; rel=&quot;tag&quot;&gt;policy&lt;/a&gt; recently, and besides there being &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11913/a-proposal-to-combat-meta-bloat-the-big-consensus-freeze&quot;&gt;a whole lot of them&lt;/a&gt;, I've noticed a problem. As I have less than 1k rep on the main community, I'm not an &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/established-user&quot;&gt;established user&lt;/a&gt;, and so I don't have the ability to see up and down votes. While this generally isn't a problem over there, it also means that I can't see up and down votes over here. Some important &lt;a href=&quot;/questions/tagged/policy&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;policy&amp;#39;&quot; rel=&quot;tag&quot;&gt;policy&lt;/a&gt; questions here include clauses such as this (taken from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/96155&quot;&gt;here&lt;/a&gt;):&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A method is allowed if it has 5 net votes and at least twice as many upvotes as downvotes.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Without being able to see these votes, I can't tell if answers that may be &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/19360/96155&quot;&gt;marginal&lt;/a&gt; or have some &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14972/96155&quot;&gt;controversy in the comments&lt;/a&gt; are actually valid to be used. In theory, I can't actually tell if &lt;em&gt;any&lt;/em&gt; of the answers on there are valid policy or not. I also wouldn't even say that the I/O example is the most problematic out there. New users may be much more likely to run afoul of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;standard loopholes&lt;/a&gt; if they think they've just come up with something clever that the community has been bored with for years, and they may get frustrated that they couldn't actually know if it was a loophole or not just because they don't have enough rep.&lt;/p&gt;&#xA;&lt;p&gt;While I agree with the &amp;quot;twice as many upvotes as downvotes&amp;quot; clause idea in theory, it causes problems here. I think it makes most sense to allow all users to see up/down votes, if possible. I don't see a reason why that information would need to be hidden in any instance, and especially not on meta.&lt;/p&gt;&#xA;" OwnerUserId="96155" LastEditorUserId="66833" LastEditDate="2020-09-28T19:27:43.680" LastActivityDate="2020-09-29T12:13:37.010" Title="Newer users can't view vote counts, therefore cannot view current site consensus" Tags="|discussion|new-users|voting|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19376" PostTypeId="2" ParentId="19375" CreationDate="2020-09-28T18:51:09.167" Score="9" Body="&lt;p&gt;&lt;sub&gt;Converting my deleted comment into an answer for more visibility&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;p&gt;While this is a popular idea (and something I personally support), changing this isn't going to happen, but there is an easy way around it.&lt;/p&gt;&#xA;&lt;p&gt;This is actually a common idea over on &lt;a href=&quot;https://meta.stackexchange.com&quot;&gt;Mother Meta&lt;/a&gt; (see &lt;a href=&quot;https://meta.stackexchange.com/questions/69852/why-is-it-a-privilege-to-view-vote-counts&quot;&gt;here&lt;/a&gt; from 2010 or &lt;a href=&quot;https://meta.stackexchange.com/questions/747/show-total-votes-or-up-down-votes/&quot;&gt;here&lt;/a&gt; from 2009). However, as outlined in both those posts, doing so is &amp;quot;expensive&amp;quot; for Stack Exchange and their system. This isn't going to be changed just for us.&lt;/p&gt;&#xA;&lt;p&gt;Luckily for you (and other low-rep users) though, &lt;a href=&quot;https://stackapps.com/questions/3082/view-vote-totals-without-1000-rep&quot;&gt;this&lt;/a&gt; Stackapps post contains a script (either a Greasemonkey script, a Chrome extension or whatever else your browser supports) that allows you to completely circumvent the reputation requirement and see the rep totals.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2020-09-29T12:13:37.010" LastActivityDate="2020-09-29T12:13:37.010" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19378" PostTypeId="1" CreationDate="2020-09-29T17:56:05.357" Score="8" ViewCount="207" Body="&lt;p&gt;Should I hold how much an answer's score increased/decreased (depending on the winning criterion) as an indicator of how good it is and whether or not I should upvote it?&lt;/p&gt;&#xA;&lt;p&gt;I used to see answers golfed by a hundred bytes as better than others even if they were longer because it seemed they were worked harder on and probably had reached the limit, but I realized maybe some people golf their code as much as possible before posting and maybe worked even harder, but I wouldn't be able to tell. Do a lot of people do the second, and if so, should I also upvote answers without strikethroughs that are already as short as their language allows?&lt;/p&gt;&#xA;" OwnerUserId="95792" LastActivityDate="2020-09-30T10:36:37.693" Title="Should I upvote an answer based on how much it was improved?" Tags="|discussion|answers|voting|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19379" PostTypeId="2" ParentId="19378" CreationDate="2020-09-29T19:24:14.897" Score="14" Body="&lt;h1&gt;No one can tell you how to vote&lt;/h1&gt;&#xA;&lt;p&gt;Voting is a very subjective thing. Some people are &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=Voters&amp;amp;filter=all&quot;&gt;liberal&lt;/a&gt;, others not so much. Ultimately, you should upvote or downvote an answer (or question) if you think it's deserving of that vote.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/q/130046/355458&quot;&gt;This&lt;/a&gt; &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq&lt;/a&gt; post on Mother Meta is a very similar question, asking when should you vote. The accepted answer says&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I generally use &amp;quot;does the post help the site?&amp;quot; to judge upvotes and downvotes to some extent.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;which I personally think is a good criteria for voting. Golfed answers (or more generally, answers that have improved their score) certainly help the site, after all, that's what we're all here for. On the flip side however, there are certainly users that golf before they post, not after (myself often included), and so only voting up answers with demonstrated golfing may not be the best idea.&lt;/p&gt;&#xA;&lt;p&gt;Ultimately, &lt;strong&gt;if you think it deserves an upvote, give it an upvote. If you think it should be downvoted, downvote. If neither, do neither&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;Note: people will be constantly improving their submissions from the moment they get a working program to the point where they (and others) sit back and believe it's an optimal solution. Sometimes you'll see these improvements, sometimes you won't, which is why (IMO) you shouldn't vote just because an answer has struck-through scores. If, however, you want to, no one's going to stop you&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2020-09-29T19:24:14.897" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19380" PostTypeId="1" CreationDate="2020-09-29T20:00:29.923" Score="24" ViewCount="347" Body="&lt;p&gt;Code Golf's &lt;a href=&quot;https://codegolf.stackexchange.com/election/3&quot;&gt;third moderator election&lt;/a&gt; has come to a close, the votes have been tallied and the three new moderators are:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/56656.png&quot; alt=&quot;Wheat Wizard&quot; /&gt;&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/users/68942/hyperneutrino&quot;&gt;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/68942.png&quot; alt=&quot;HyperNeutrino&quot; /&gt;&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/users/76162/jo-king&quot;&gt;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/76162.png&quot; alt=&quot;Jo King&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;They'll be joining &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=moderators&quot;&gt;the existing crew&lt;/a&gt; shortly—please thank them for volunteering, and share your assistance and advice with them as they learn the ropes!&lt;/p&gt;&#xA;&lt;p&gt;For details on how the voting played out, you can download the election results &lt;a href=&quot;https://codegolf.stackexchange.com/election/3&quot;&gt;here&lt;/a&gt;, or &lt;a href=&quot;https://www.opavote.com/results/4856246717906944/0&quot; rel=&quot;nofollow noreferrer&quot;&gt;view a summary report online&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="38734" LastEditorUserId="68942" LastEditDate="2020-10-21T02:19:02.503" LastActivityDate="2020-10-21T02:19:02.503" Title="2020 Community Moderator Election Results" Tags="|discussion|election|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19382" PostTypeId="2" ParentId="19380" CreationDate="2020-09-29T23:58:49.813" Score="19" Body="&lt;p&gt;All I can say is&lt;/p&gt;&#xA;&lt;h1&gt;Congratulations to our new moderators!&lt;/h1&gt;&#xA;&lt;p&gt;I‘m sure that you will all do a wonderful job, and I look forward to seeing the site improve under your moderation!&lt;/p&gt;&#xA;&lt;p&gt;It’s a shame I missed out, but I‘m very happy to have lost to the 3 of you, as I know you‘ll all be excellent moderators.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2020-09-29T23:58:49.813" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19383" PostTypeId="2" ParentId="19380" CreationDate="2020-09-30T01:02:15.007" Score="19" Body="&lt;p&gt;Thank you very much and congratulations to Wheat Wizard and Jo King as well! I look forward to working with both of you and Doorknob to regulate and improve this site and I am honored to have been chosen to serve CGCC as one of your new moderators.&lt;/p&gt;&#xA;&lt;p&gt;From my time here on this site, I hope my experience will allow me to reflect the values and practices of the community, and being new to Stack Exchange moderation, I will do my best to support the desires and needs of the community and I would greatly appreciate feedback on any actions I take.&lt;/p&gt;&#xA;&lt;p&gt;I am excited to continue my time in this community as one of your moderators now. I invite anyone to contact me at any point (you can use &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;chat&lt;/a&gt;) if you believe I should be doing a better job or if you have suggestions or concerns with my moderation, as I hope to provide the best experience for the community and its members.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2020-09-30T01:02:15.007" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19384" PostTypeId="2" ParentId="19378" CreationDate="2020-09-30T10:36:37.693" Score="11" Body="&lt;p&gt;I think the direct answer ought to be 'NO: you should not upvote an answer based on whether it was improved.'&lt;/p&gt;&#xA;&lt;p&gt;If this was common practice, it could encourage answerers to deliberately submit suboptimal answers, just so that they could gain upvotes by subsequently 'improving' them.  This is (I think) certainly not useful nor desirable.&lt;/p&gt;&#xA;&lt;p&gt;I must admit that it had never crossed my mind that an edited/improved answer could be considered 'better'.  Actually, although I frequently do edit my own answers when I think of a way to improve them, I generally feel rather sheepish about it inside, and usually regret that I hadn't thought of it before posting them in the first place...&lt;/p&gt;&#xA;" OwnerUserId="95126" LastActivityDate="2020-09-30T10:36:37.693" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19386" PostTypeId="1" CreationDate="2020-10-01T07:11:38.237" Score="19" ViewCount="894" Body="&lt;p&gt;In accordance with our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19271/16766&quot;&gt;meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout October 2020, our Language of the Month, nominated by myself, will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://github.com/barbuz/Husk&quot; rel=&quot;nofollow noreferrer&quot;&gt;Husk&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;What's a Language of the Month?&lt;/h3&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/16766&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during October, those who wish to participate should learn (at least the basics of) Husk, use it to solve challenges, and discuss it in the &lt;a href=&quot;https://chat.stackexchange.com/rooms/53097/husk&quot;&gt;Husk chat room&lt;/a&gt;. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h3&gt;Information about Husk&lt;/h3&gt;&#xA;&lt;p&gt;Husk is a &lt;a href=&quot;https://en.wikipedia.org/wiki/Purely_functional_programming&quot; rel=&quot;nofollow noreferrer&quot;&gt;purely functional&lt;/a&gt; and &lt;a href=&quot;https://en.wikipedia.org/wiki/Lazy_evaluation&quot; rel=&quot;nofollow noreferrer&quot;&gt;lazy&lt;/a&gt; golfing language created by me and &lt;a href=&quot;https://codegolf.stackexchange.com/users/62393/leo&quot;&gt;Leo&lt;/a&gt;.&#xA;It's inspired by, implemented in, and transpiled to Haskell.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;AFAIK, it's the only golfing language that wholly embraces the functional paradigm. Its syntax is (mostly) based on prefix notation, like Pyth, but many golfing tricks rely on things like passing partially applied functions to other functions. All functions are curried automagically.&lt;/li&gt;&#xA;&lt;li&gt;It has a strict and static (but implicit) type system, which is also unique among golfing languages.&lt;/li&gt;&#xA;&lt;li&gt;Like Haskell, it's lazy, meaning that some programs that would result in infinite loops in most other languages will happily compile and run. Husk eats infinite lists of self-referential infinite lists for breakfast.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Resources&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The Github repo has &lt;a href=&quot;https://github.com/barbuz/Husk/wiki&quot; rel=&quot;nofollow noreferrer&quot;&gt;a Wiki&lt;/a&gt; that contains documentation and a tutorial.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/152688/32014&quot;&gt;Golfing tips&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/53097/husk&quot;&gt;Husk chat room&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#Husk&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try It Online!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://abrudz.github.io/lb/husk&quot; rel=&quot;nofollow noreferrer&quot;&gt;Browser bar&lt;/a&gt; for easier typing, courtesy of &lt;a href=&quot;https://codegolf.stackexchange.com/users/43319/ad%c3%a1m&quot;&gt;Adám&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Additional efforts&lt;/h3&gt;&#xA;&lt;p&gt;I will award a &lt;strong&gt;bounty of 50 rep&lt;/strong&gt; to each Husk answer posted in October by a user who hasn't posted a Husk answer before.&#xA;Link your answer to the post below so I see it, and harass me in chat if I still don't.&#xA;Please try to answer a question that I haven't answered yet, or I can't award your answer since then bounties start at 100 reputation.&lt;/p&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="68942" LastEditDate="2020-11-01T23:45:14.443" LastActivityDate="2020-11-01T23:45:14.443" Title="Language of the month for October 2020: Husk" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19387" PostTypeId="2" ParentId="19386" CreationDate="2020-10-01T07:11:38.237" Score="9" Body="&lt;h1&gt;List of all Husk solutions posted in October&lt;/h1&gt;&#xA;&lt;p&gt;(First time posters highlighted in bold)&lt;/p&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;true&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;let ANSWER_IDS=[211958,211960,211973,211985,211988,211991,212008,212009,212013,212014,212017,212018,212019,212020,212021,212022,212025,212029,212038,212041,212042,212044,212045,212047,212048,212049,212052,212054,212055,212060,212065,212071,212075,212076,212081,212090,212092,212095,212096,212097,212101,212106,212110,212112,212114,212115,212121,212124,212127,212130,212139,212140,212141,212144,212146,212148,212150,212152,212157,212158,212167,212170,212172,212174,212175,212176,212177,212180,212206,212207,212210,212213,212214,212216,212225,212226,212230,212231,212237,212238,212253,212258,212260,212261,212267,212270,212271,212272,212274,212276,212277,212289,212290,212295,212297,212298,212299,212308,212314,212315,212340,212362,212364,212365,212367,212368,212377,212404,212407,212417,212419,212425,212426,213430,213434,213435,213437,213441,213444,213445,213448,213455,213465,213472,213505,213521,213555,213562,213563,213566,213567,213569,213573,213576,213577,213578,213592,213593,213594,213595,213596,213598,213604,213607,213608,213630,213638,213641,213671,213687,213694,213698,213699,213704,213721,213722,213724,213727,213729,213730,213731,213738,213747,213749,213751,213771,213774,213776,213777,213780,213786,213795,213796,213797,213798,213800,213808,213809,213810,213821,213822,213825,213826,213831,213836,213839,213841,213855,213865,213891,213895,213896,213907,213918,213923,213926,213928,213949,213950,213959,213968,214000,214002,214013,214014,214015,214016,214024,214026,214043,214061,214069,214074,214095,214097,214148,214181,214184,214208,214210,214212,214213,214227,214237,214243,214249,214250,214253,214267,214281,214295,214300,214305,214314,214316,214329,214330,214335,214338,214341,214344,214352,214355,214356,214358,214363,214374,214375,214378,214380,214381,214383,214386,214401,214402,214403,214404,214405,214408,214409,214414,214415,214425,214431,214439,214440,214441,214442,214445,214449,214459,214460,214462,214467,214470,214472,214473,214474,214475,214483,214492,214494,214496,214502,214509,214510,214511,214513,214515,214518,214523,214524,214525,214526,214527,214528,214529];&#xA;let answerUrl=al=&amp;gt;`https://api.stackexchange.com/2.2/answers/${al.join(&quot;;&quot;)}?pagesize=100&amp;amp;site=codegolf&amp;amp;filter=!8IfUmdAMyNVstws(VNIod`;&#xA;let questionUrl=ql=&amp;gt;`https://api.stackexchange.com/2.2/questions/${ql.join(&quot;;&quot;)}?pagesize=100&amp;amp;site=codegolf&amp;amp;filter=!C(nyt9mA492jCKBXW`;&#xA;let entry=(aid,qt,uid,un,add)=&amp;gt;`&amp;lt;li&amp;gt;&amp;lt;a href=&quot;https://codegolf.stackexchange.com/${aid}/${uid}&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;${qt}&amp;lt;/a&amp;gt; by ${add?&quot;&amp;lt;strong&amp;gt;&quot;:&quot;&quot;}&amp;lt;a href=&quot;https://codegolf.stackexchange.com/users/${uid}&quot; rel=&quot;nofollow noreferrer&quot;&amp;gt;${un}&amp;lt;/a&amp;gt;${add?&quot;&amp;lt;/strong&amp;gt;&quot;:&quot;&quot;}&amp;lt;/li&amp;gt;`;&#xA;let body=el=&amp;gt;{document.body.innerHTML=`&amp;lt;ul&amp;gt;${el.join(&quot;&quot;)}&amp;lt;/ul&amp;gt;`;document.head.innerHTML='&amp;lt;script type=&quot;text/x-mathjax-config&quot;&amp;gt;MathJax.Hub.Config({tex2jax:{inlineMath:[[&quot;\\\\$&quot;,&quot;\\\\$&quot;]]}});&amp;lt;\/script&amp;gt;';let s=document.createElement(&quot;script&quot;);s.src=&quot;https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.5/MathJax.js?config=TeX-AMS_HTML-full&quot;;document.head.appendChild(s);};&#xA;let getPosts=(pl,urlFun,idx,part)=&amp;gt;fetch(urlFun(pl.slice(0,100))).then(resp=&amp;gt;resp.json()).then(data=&amp;gt;{part=part||{};data['items'].forEach(a=&amp;gt;{part[a[idx]]=a;});return pl.length&amp;lt;=100?part:getPosts(pl.slice(100),urlFun,idx,part);});&#xA;getPosts(ANSWER_IDS,answerUrl,&quot;answer_id&quot;).then(ad=&amp;gt;{let ql=[...new Set(Object.values(ad).map(a=&amp;gt;a[&quot;question_id&quot;]))];ql.sort((x,y)=&amp;gt;x-y);getPosts(ql,questionUrl,&quot;question_id&quot;).then(qd=&amp;gt;{let seen=new Set();body(ANSWER_IDS.map(a=&amp;gt;{if(!ad[a]){console.error(`answer ${a} not found`);return &quot;&quot;;}return entry(a,qd[ad[a][&quot;question_id&quot;]][&quot;title&quot;],ad[a][&quot;owner&quot;][&quot;user_id&quot;],ad[a][&quot;owner&quot;][&quot;display_name&quot;],seen.has(ad[a][&quot;owner&quot;][&quot;user_id&quot;])?false:seen.add(ad[a][&quot;owner&quot;][&quot;user_id&quot;]));}));});});&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&lt;hr&gt;&#xA;&lt;h1&gt;List of all Husk tips posted in October&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/212208/80214&quot;&gt;Use &lt;code&gt;e&lt;/code&gt; and &lt;code&gt;ė&lt;/code&gt; to debug your functions&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214&quot;&gt;Razetime&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;List of Husk-related challenges posted in October&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/211970/80214&quot;&gt;Size up a number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214&quot;&gt;Razetime&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="32014" LastEditorUserId="33208" LastEditDate="2020-11-01T17:54:50.367" LastActivityDate="2020-11-01T17:54:50.367" CommentCount="0" CommunityOwnedDate="2020-10-01T07:11:38.237" ContentLicense="CC BY-SA 4.0" />
  <row Id="19389" PostTypeId="2" ParentId="2140" CreationDate="2020-10-02T00:20:25.927" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/213899/66833&quot;&gt;Calculate the inverse of a matrix&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2020-10-20T20:36:06.360" LastActivityDate="2020-10-20T20:36:06.360" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="19391" PostTypeId="2" ParentId="2140" CreationDate="2020-10-03T10:17:30.547" Score="0" Body="&lt;h1&gt;Socially distanced seating&lt;/h1&gt;&#xA;&lt;p&gt;Lord Lloyd Warbler wants to minimise the harm to his theatre's seating capacity for his hit show, Birds, of maintaining social distancing.&lt;/p&gt;&#xA;&lt;p&gt;The social distancing rules in Westendland are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Groups may sit together without distancing&lt;/li&gt;&#xA;&lt;li&gt;Between groups there must be at least 2 empty seats along the row, and 1 empty row in front and behind.&lt;/li&gt;&#xA;&lt;li&gt;The closest diagonal permitted is a knight's move - only 1 horizontal space empty.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Diagrams:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; A _ _ B&#xA;&#xA; A&#xA; _&#xA; B&#xA;&#xA; A _ _&#xA; _ _ B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Given a list of group sizes and the theatre size (rows and columns), can you pack them all into the theatre? Groups can sit in any contiguous (connected) arrangement of seats.&lt;/p&gt;&#xA;&lt;h2&gt;Sample tests&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;(Rows, cols), [groups] -&amp;gt; canFitBool&#xA;(1,1), [1] -&amp;gt; true&#xA;(2,2), [1,1] -&amp;gt; false&#xA;(2,3), [1,1] -&amp;gt; true   // knight's move&#xA;(5,2), [4,4] -&amp;gt; true   // 2x2 in rows a,b, gap in c, 2x2 in d,e&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;questionmarks&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should I just provide a list of cases of varying difficulty? Like, some of these could be pretty difficult.&lt;/li&gt;&#xA;&lt;li&gt;Is the knight's move rule too complicated?&lt;/li&gt;&#xA;&lt;li&gt;Is the contiguous rule too permissive, and therefore complicated? It could mean some edge cases are possible if you have a weird shaped group. Could make it rectangular blocks only?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="14710" LastEditorUserId="14710" LastEditDate="2020-10-04T09:10:29.137" LastActivityDate="2020-10-04T09:10:29.137" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="19392" PostTypeId="2" ParentId="2447" CreationDate="2020-10-03T14:29:42.627" Score="0" Body="&lt;h1&gt;Cellular automata and 2d languages may take input by interfacing with a user-built structure&lt;/h1&gt;&#xA;&lt;p&gt;Many of these languages do not have any other way to take input. By &amp;quot;interfacing&amp;quot;, I mean additional structures being created by the user to interact with the existing code in a way that provides only the necessary information (such as some sort of serial representation of the inputted values) in a way that could feasibly be used by the user's program and controlled by another turing-complete automaton (so not in a tiny space in the middle of the program, or in an area that will be overwritten).&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2020-10-27T23:06:09.103" LastActivityDate="2020-10-27T23:06:09.103" CommentCount="1" CommunityOwnedDate="2020-10-03T20:29:37.823" ContentLicense="CC BY-SA 4.0" />
  <row Id="19393" PostTypeId="2" ParentId="2447" CreationDate="2020-10-03T14:32:27.807" Score="0" Body="&lt;h1&gt;Cellular automata and 2d languages may output by interfacing with a user-built structure&lt;/h1&gt;&#xA;&lt;p&gt;Many of these languages do not have any other way to produce (non-visual) output. By &amp;quot;interfacing&amp;quot;, I mean additional structures being created by the user to interact with the existing code in a way that the program provides only the necessary information (such as some sort of serial representation of the outputted values) in a way that could feasibly be used by the user's program to control another turing-complete automaton (so not in a tiny space in the middle of the program, or in an area that will be overwritten).&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2020-10-03T14:32:27.807" CommentCount="0" CommunityOwnedDate="2020-10-03T20:29:31.820" ContentLicense="CC BY-SA 4.0" />
  <row Id="19394" PostTypeId="2" ParentId="2140" CreationDate="2020-10-03T23:14:58.700" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/212328/66833&quot;&gt;We&amp;#39;re all unique in our own way&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2020-10-11T16:58:19.143" LastActivityDate="2020-10-11T16:58:19.143" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="19395" PostTypeId="2" ParentId="2140" CreationDate="2020-10-04T05:56:31.400" Score="0" Body="&lt;h1&gt;Terminal Punch Card&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;moved because apparently it's not clear enough.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;So back in the day, computers didn't have fancy keyboard and mouse inputs, and didn't have your fancy screens. Instead they had punch cards.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/R7GuT.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/R7GuT.png&quot; alt=&quot;Punch card&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Punch cards punchers punched (try saying that 10 times fast) a hole out of a card to represent a 1-bit, and left it filled to represent a 0-bit. The cards were some number of holes wide, with each hole representing a bit in a byte.&lt;/p&gt;&#xA;&lt;p&gt;Recently, you discovered an old mainframe at your local university that accepted punch cards that were 8 holes wide. For this challenge, you will be given data as an input, and your job is to punch a punch card to the terminal output, like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Hello, World!&#xA;&#xA;: *  *   :&#xA;: **  * *:&#xA;: ** **  :&#xA;: ** **  :&#xA;: ** ****:&#xA;:  * **  :&#xA;:  *     :&#xA;: * * ***:&#xA;: ** ****:&#xA;: ***  * :&#xA;: ** **  :&#xA;: **  *  :&#xA;:  *    *:&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The input will be a string or bytes representing the punched data payload. The output data must include rows, which start and end with a &lt;code&gt;:&lt;/code&gt;, and have 8 bits between them, represented as a &lt;code&gt; &lt;/code&gt; for 0, or a &lt;code&gt;*&lt;/code&gt; for 1. There must be one row for each byte of data.&lt;/p&gt;&#xA;&lt;p&gt;Here's the catch: The punch card puncher only punched one hole at a time, so in your program, must print (or add to the output string) only one character at a time.&lt;/p&gt;&#xA;&lt;p&gt;Example of unacceptable method call:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;# `binary` is some string with the binary bits.&#xA;print(&amp;quot;:&amp;quot; + binary.replace(&amp;quot;0&amp;quot;, &amp;quot; &amp;quot;).replace(&amp;quot;1&amp;quot;, &amp;quot;*&amp;quot;) + &amp;quot;:&amp;quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Acceptable method call:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;for bit in binary:&#xA;   print(bit == &amp;quot;1&amp;quot; ? &amp;quot;*&amp;quot; : &amp;quot; &amp;quot;, &amp;quot;&amp;quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Also acceptable method call:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;output = &amp;quot;&amp;quot;&#xA;for bit in binary:&#xA;   output += bit == &amp;quot;1&amp;quot; ? &amp;quot;*&amp;quot; : &amp;quot; &amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The challenge is code golf, so least number of bytes wins. Standard rules/loopholes are in effect.&lt;/p&gt;&#xA;" OwnerUserId="46066" LastActivityDate="2020-10-04T05:56:31.400" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19397" PostTypeId="2" ParentId="2140" CreationDate="2020-10-06T07:45:31.797" Score="4" Body="&lt;h1&gt;Make a quine that shrinks and grows&lt;/h1&gt;&#xA;&lt;p&gt;Write a program that outputs another program that is:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Larger in bytes than the original&lt;/li&gt;&#xA;&lt;li&gt;Outputs a program that is smaller than itself that also obeys these rules and is larger than the original program&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Basically the output should alternate between larger than the previous program and smaller than it, while increasing in total size as it goes.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/21831/76162&quot;&gt;Related&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76162" LastActivityDate="2020-10-06T07:45:31.797" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="19400" PostTypeId="2" ParentId="2140" CreationDate="2020-10-08T17:25:30.957" Score="1" Body="&lt;h1&gt;TPK Algorithm&lt;/h1&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/TPK_algorithm&quot; rel=&quot;nofollow noreferrer&quot;&gt;TPK Algorithm&lt;/a&gt; was designed in 1977 Donald Knuth and Luis Trabb Pardo to show off the various functionality of languages at the time. Your task is to implement the most common version of the TPK algorithm. The pseudocode goes as follows (adapted from Wikipedia):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ask for 11 numbers to be read into a sequence S&#xA;reverse sequence S&#xA;for each item N in sequence S&#xA;    call function F on N&#xA;    if the result is greater than 400&#xA;        print &amp;quot;TOO LARGE&amp;quot;&#xA;    else&#xA;        print result&#xA;&#xA;F(N) results in sqrt(abs(N)) + 5 * pow(N,3)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;F&lt;/code&gt; should be implemented as a function in your code, that is, there should be some subsection of you code which consists of a function that takes an input and outputs the result of F for that input. It is acceptable to round the square root operation down to the nearest integer.&lt;/p&gt;&#xA;&lt;p&gt;Notes: if using decimal square roots, the first value greater than 400 is ~4.301. For integer square roots, the first value is ~4.302. Your program does not need to support non-integer inputs.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so fewest bytes wins!&lt;/p&gt;&#xA;" OwnerUserId="96155" LastActivityDate="2020-10-08T17:25:30.957" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19402" PostTypeId="1" CreationDate="2020-10-09T02:00:21.127" Score="9" ViewCount="125" Body="&lt;p&gt;Inspired by a &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/55768995#55768995&quot;&gt;conversation&lt;/a&gt; about annoying quirks with the chat feeds (such as New Main Posts), Feed Filter is a simple userscript I made to introduce a few features/fixes to the feeds in The Nineteenth Byte:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Sandboxed posts, loophole proposals, and bounties with no deadline will show their title rather than the name of the question&lt;/li&gt;&#xA;&lt;li&gt;Certain posts, such as closed or duplicate questions, can be filtered out (either hidden completely or minimized to show only their title)&lt;/li&gt;&#xA;&lt;li&gt;Some or all posts from feeds can be minimized or hidden using regexes&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;To start using the userscript, all you need to do is download it. The default configuration is pretty reasonable, but it can be changed quickly with a few simple edits.&lt;/p&gt;&#xA;&lt;h3&gt;Downloading:&lt;/h3&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://gist.github.com/RedwolfPrograms/620f760e971816bffb3a6e7b834e3d42/raw/cbaa69455aca0b06fe45215ae158a82baed1470f/Feed_Filter.user.js&quot; rel=&quot;nofollow noreferrer&quot;&gt;Feed_Filter.user.js&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Clicking the above link should automatically install the userscript (assuming you already have Greasemonkey/Tampermonkey installed).&lt;/p&gt;&#xA;&lt;p&gt;If you already downloaded it, you may also want to ensure there is not a newer version here as you may be missing important features or bugfixes.&lt;/p&gt;&#xA;&lt;h3&gt;Usage:&lt;/h3&gt;&#xA;&lt;p&gt;The userscript shouldn't need any input from the user to begin working. By default, it has two rules programmed in:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Minimize any closed, duplicate, or negative score questions in the New Main Posts, New Meta Posts, or Newly Featured Questions feeds&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/l7fHe.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/l7fHe.png&quot; alt=&quot;A closed question as shown in chat feeds, but without a description or tags&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Display as a title the first paragraph (under a certain length) of any posts in the New Sandboxed Posts, New Loophole Proposal, or New Bounties With No Deadlines feeds&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/HKixw.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/HKixw.png&quot; alt=&quot;A sandboxed post as shown in chat feeds, but the title is the post's title&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;Customization:&lt;/h3&gt;&#xA;&lt;p&gt;All customization is done by editing the userscript, by adding rules to a list at the top of the program:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;const Rules = [&#xA;    {&#xA;        owners: [&amp;quot;New Main Posts&amp;quot;, &amp;quot;New Meta Posts&amp;quot;, &amp;quot;Newly Featured Questions&amp;quot;],&#xA;        title: /\[(closed|duplicate)\]$/,&#xA;        result: Results.MINIMIZED&#xA;    },&#xA;    {&#xA;        owners: [&amp;quot;New Main Posts&amp;quot;, &amp;quot;New Meta Posts&amp;quot;, &amp;quot;Newly Featured Questions&amp;quot;],&#xA;        votes: {&#xA;            max: -1&#xA;        },&#xA;        result: Results.MINIMIZED&#xA;    },&#xA;    {&#xA;        owners: [&amp;quot;New Sandboxed Posts&amp;quot;, &amp;quot;New Loophole Proposal&amp;quot;, &amp;quot;New Bounties With No Deadlines&amp;quot;],&#xA;        original: /^.{1,100}[\n\r]+/,&#xA;        result: Results.MODIFIED&#xA;    }&#xA;];&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Each rule is formatted as an object, with a minimum of one required property: &lt;code&gt;result&lt;/code&gt;. The rest are used to filter which feeds the rule applies to. A list of properties:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;code&gt;result&lt;/code&gt;:&lt;/strong&gt; This is a required property, which can have one of four values:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;Results.HIDDEN&lt;/code&gt;: The post will be entirely hidden&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Results.MINIMIZED&lt;/code&gt;: The post's description and tags will not be shown&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Results.MODIFIED&lt;/code&gt;: The post's title will be changed to that of the question or answer it refers to&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Results.ORIGINAL&lt;/code&gt;: No changes will take place&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;code&gt;owners&lt;/code&gt;:&lt;/strong&gt; An optional list of names. If it exists, the rule will only apply to posts from that user (note that this can apply to non-feeds, but it will only affect references to posts)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;code&gt;votes&lt;/code&gt;:&lt;/strong&gt; An optional number or object. If it is a number, the rule will only be applied if the vote count matches it exactly. If it is an object, it will use the &lt;code&gt;min&lt;/code&gt; and &lt;code&gt;max&lt;/code&gt; properties to determine if the rule should apply.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;code&gt;original&lt;/code&gt;:&lt;/strong&gt; An optional regular expression which is applied to the displayed description before it is corrected, and will apply the rule only if it matches&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;code&gt;title&lt;/code&gt;:&lt;/strong&gt; An optional regular expression which is applied to the (corrected) title of the post, and will apply the rule only if it matches&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;code&gt;body&lt;/code&gt;:&lt;/strong&gt; An optional regular expression which is applied to the (corrected) body of the post, and will apply the rule only if it matches&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Important:&lt;/strong&gt; Only the first rule which applies to any post will be applied.&lt;/p&gt;&#xA;&lt;p&gt;There are also additional changes you can make, such as pasting the URLs of other Stack Exchange chats into the &lt;code&gt;@match&lt;/code&gt; field, but I'm not entirely sure if those will work properly.&lt;/p&gt;&#xA;&lt;h3&gt;Changelog&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;1.1:&lt;/strong&gt; Added votes filter option, as well as a default rule to minimize negative score posts&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Other&lt;/h3&gt;&#xA;&lt;p&gt;If you notice any bugs, have any suggested features, or create a unique or useful set of rules, make sure to leave a comment! (I threw this together in a few hours, so I don't expect it to work perfectly :p).&lt;/p&gt;&#xA;&lt;p&gt;Hope you like it!&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="66833" LastEditDate="2021-06-18T23:57:03.337" LastActivityDate="2021-06-18T23:57:03.337" Title="Feed Filter: A TNB Userscript" Tags="|discussion|chat|rss|userscript|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="19403" PostTypeId="2" ParentId="2140" CreationDate="2020-10-09T22:51:07.623" Score="1" Body="&lt;h1&gt;C Code Compressor (WIP)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; rel=&quot;tag&quot;&gt;compression&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to create a lossless compression scheme that is optimized for ASCII-only C code. Whitespace and indentation should be preserved.&lt;/p&gt;&#xA;&lt;p&gt;Your score is the total compressed size of various samples from well known open source C projects. A sample of the largest few files will be taken from one specific commit. Both header files and source files will be included from the following projects:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The CPython Interpreter&lt;/li&gt;&#xA;&lt;li&gt;The Linux Kernel&lt;/li&gt;&#xA;&lt;li&gt;Git&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Comments will be stripped from the source files for the set of scoring, therefore you do not need to optimize for comments, however you still need to handle them.&lt;/p&gt;&#xA;&lt;p&gt;Three additional files will also be included in the corpus, which must be handled correctly, but do not contribute to your score:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A C source file with comments&lt;/li&gt;&#xA;&lt;li&gt;A Python source file&lt;/li&gt;&#xA;&lt;li&gt;A non-programming plain text file (probably a short story or poem from the public domain. Jabberwocky?)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;Score = {C + D + L^2 \over O}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Where:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$C\$&lt;/span&gt; is the total size, in bytes, of the compressed text&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$O\$&lt;/span&gt; is the total size, in bytes, of the original text&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt; is the total length, in bytes, of all strings in any predefined dictionary&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; is the length, in bytes, of the longest string in any predefined dictionary&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Lowest score wins&lt;/p&gt;&#xA;&lt;h3&gt;Predefined Dictionaries&lt;/h3&gt;&#xA;&lt;p&gt;(Needs refinement)&lt;/p&gt;&#xA;&lt;p&gt;A predefined dictionary, for the purposes of this challenge, is a collection of predefined output strings of length 2 or greater which are baked into your encoding format.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An entry in a predefined dictionary must have at least two different characters to be counted in scoring, so repeating a single character &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; times does not count as a dictionary entry.&lt;/li&gt;&#xA;&lt;li&gt;Leading and trailing whitespace on a predefined string does not count as a distinct entry from one without matching leading or trailing whitespace&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;A predefined dictionary may, for instance, be helpful for keywords and common identifiers, but it is ultimately up to you what approach you take.&lt;/p&gt;&#xA;&lt;p&gt;For instance, if you map &lt;code&gt;\x80&lt;/code&gt; to &lt;code&gt;int&lt;/code&gt; and &lt;code&gt;\x81&lt;/code&gt; to &lt;code&gt;float&lt;/code&gt;, your dictionary score would be &lt;span class=&quot;math-container&quot;&gt;\$8\$&lt;/span&gt; for the total length, plus &lt;span class=&quot;math-container&quot;&gt;\$25\$&lt;/span&gt; for the longest string (&lt;code&gt;float&lt;/code&gt;), for a total of &lt;span class=&quot;math-container&quot;&gt;\$33\$&lt;/span&gt;. However, mapping runs of tabs and spaces to &lt;code&gt;\xC0&lt;/code&gt;-&lt;code&gt;\xFF&lt;/code&gt; would not count toward dictionary size in this case.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard rules and loopholes apply.&lt;/li&gt;&#xA;&lt;li&gt;Although scoring only depends on how well you can compress C, your algorithm needs to work even when the input text is not valid C; it must work for all ASCII input text.&lt;/li&gt;&#xA;&lt;li&gt;Your algorithm must be deterministic, meaning it should always produce the same compressed text every time for any given input, regardless of external factors such as time.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2020-10-30T17:45:22.703" LastActivityDate="2020-10-30T17:45:22.703" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19405" PostTypeId="2" ParentId="2140" CreationDate="2020-10-11T02:56:42.073" Score="1" Body="&lt;h1&gt;Three points on Poincaré disk&lt;/h1&gt;&#xA;&lt;h2&gt;What is Poincaré disk?&lt;/h2&gt;&#xA;&lt;p&gt;Poincaré disk is a projection of 2-dimensional &lt;a href=&quot;https://en.wikipedia.org/wiki/Hyperbolic_geometry&quot; rel=&quot;nofollow noreferrer&quot;&gt;hyperbolic geometry&lt;/a&gt; to the 2-dimensional Euclidean plane, or more precisely, onto the open disk &lt;span class=&quot;math-container&quot;&gt;\$\{(x,y): x^2 + y^2 &amp;lt; 1^2\}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;It is well-known that three &lt;strong&gt;distinct&lt;/strong&gt; points on the Euclidean plane are either on a unique line or on a unique circle. Let &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; be that line/circle.&lt;/p&gt;&#xA;&lt;p&gt;The inverse image of &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; is one of &lt;strong&gt;line&lt;/strong&gt;, &lt;strong&gt;circle&lt;/strong&gt;, &lt;strong&gt;horocycle&lt;/strong&gt;, or &lt;strong&gt;hypercycle&lt;/strong&gt;. Determine which.&lt;/p&gt;&#xA;&lt;h2&gt;Classification&lt;/h2&gt;&#xA;&lt;p&gt;The points are assumed to be on the disk.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; is a circle that lies on the disk, the inverse image is a &lt;strong&gt;circle&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Otherwise, if &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; is a circle that shares a tangent with the boundary of the disk, the inverse image is a &lt;strong&gt;horocycle&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Otherwise, if &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; crosses the boundary of the disk orthogonally, the inverse image is a &lt;strong&gt;line&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Otherwise, the inverse image is a &lt;strong&gt;hypercycle&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;The cartesian 2-dimensional coordinates of the points. A coordinate can be given as either two real numbers or one complex number. Other than that, the input type and format doesn't matter. This includes:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A tuple of size 3&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A list of size 3&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A set of size 3&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Invalid inputs fall in &lt;em&gt;don't care&lt;/em&gt; situation. This includes:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Not exactly 3 points&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Non-distinct points&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A point not on the disk&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Output type and format doesn't matter either. This includes:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Enumeration type of 4 possible values&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Bit field of size 2&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;Assuming there were no floating-point errors:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\{(-½,0),(0,½),(½,0)\}\$&lt;/span&gt; must give a &lt;strong&gt;circle&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\{(-½,½),(0,0),(½,½)\}\$&lt;/span&gt; must give a &lt;strong&gt;horocycle&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\{(-½,0),(0,0),(½,0)\}\$&lt;/span&gt; must give a &lt;strong&gt;line&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\{(1-\sqrt{¾},½),(1-\sqrt{½},1-\sqrt{½}),(½,1-\sqrt{¾})\}\$&lt;/span&gt; must also give a &lt;strong&gt;line&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\{(0,½),(¼,¼),(½,0)\}\$&lt;/span&gt; must give a &lt;strong&gt;hypercycle&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\{(0,0),(¾,0),(0,¾)\}\$&lt;/span&gt; must also give a &lt;strong&gt;hypercycle&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2020-10-12T05:22:01.277" LastActivityDate="2020-10-12T05:22:01.277" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="19409" PostTypeId="2" ParentId="2140" CreationDate="2020-10-12T18:07:38.227" Score="2" Body="&lt;h1&gt;Output all of printable ASCII using all of printable ASCII&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/213530&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2020-10-14T19:00:04.837" LastActivityDate="2020-10-14T19:00:04.837" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="20412" PostTypeId="1" CreationDate="2020-10-13T10:12:23.687" Score="8" ViewCount="143" Body="&lt;p&gt;For a while now, most bounties on our site are rewards for existing answers. As a consequence, it's pretty hard to spot any bounty that would fall into the 'Draw attention' or 'Bonus / Side challenge' categories -- and we have to open each and every entry to figure it out. I've to admit that I personally don't really pay attention to the bounty list anymore because of that.&lt;/p&gt;&#xA;&lt;p&gt;Ideally, I think SE should display the bounty reason on the bounty list. But since they don't, should we include this information by ourselves?&lt;/p&gt;&#xA;&lt;p&gt;We may either:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Add temporary tags such as &lt;code&gt;bounty-side-challenge&lt;/code&gt; or &lt;code&gt;bounty-reward&lt;/code&gt; to the challenge. But I don't really like the idea of creating new tags for this specific purpose.&lt;/li&gt;&#xA;&lt;li&gt;Temporarily edit the title of the challenge to include the bounty reason, e.g. &lt;code&gt;Some great challenge [REWARD]&lt;/code&gt; or &lt;code&gt;[REWARD] Some great challenge&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Either way, this would be some extra work for either the bounty owner (assuming that they're aware of this new custom) and/or the moderators if the owner is not doing it the right way.&lt;/p&gt;&#xA;" OwnerUserId="58563" LastActivityDate="2020-10-13T20:03:24.300" Title="Adding tags to bounties?" Tags="|discussion|bounty|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20413" PostTypeId="2" ParentId="2140" CreationDate="2020-10-13T10:49:30.163" Score="3" Body="&lt;h1&gt;The Great Code Golf Heist&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Alternatively, the most literal cops'n'robbers you'll ever see&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot;&gt;python&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Backstory&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox Note: This part will be specific to each thread, so I've provided each version&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Robbers&lt;/h3&gt;&#xA;&lt;p&gt;For the last few years, you and your team of robbers have been planning to rob the International Code Golf Museum (ICGM) of some of it's most prized possessions (rumour has it, they have a rare transcript of Dennis being outgolfed!). Tonight is the night that your plans will be put into action... tonight you will walk away with glorious riches and legendary artifiacts of code golf history.&lt;/p&gt;&#xA;&lt;p&gt;That is, if you can actually manage to get in, loot the rooms and get back out without getting caught.&lt;/p&gt;&#xA;&lt;h3&gt;Cops&lt;/h3&gt;&#xA;&lt;p&gt;Tonight has been a quiet night at the Internation Code Golf Museum (ICGM)...too quiet for one's liking.&lt;/p&gt;&#xA;&lt;p&gt;Of course, that's probably due to the fact that a bunch of robbers are rumoured to strike tonight and steal the most priceless artifacts from the ICGM's collections (we can't have them finding out the fact that Arnauld is a machine learning algorithm designed to answer challenges with Javascript, can we.  [that's a joke we love you Arnauld!])&lt;/p&gt;&#xA;&lt;p&gt;It's your job to stop the robbers and make sure that not a single thing leaves the museum.&lt;/p&gt;&#xA;&lt;h2&gt;The Museum&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox Note: This part is common to both cops and robbers&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Here is a map of the museum:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/pVaBH.png&quot; alt=&quot;Museum Map&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;You may be wondering &amp;quot;hang on, what are the dimensions of that map?&amp;quot;. Well the answer is simple: you don't need to know.&lt;/p&gt;&#xA;&lt;p&gt;Movement around the ICGM is analogous to a Henry Stickmin game: in each room, you can either move to an adjacent room, or perform an action in that room.&lt;/p&gt;&#xA;&lt;p&gt;Robbers start at the &lt;code&gt;Getaway Car&lt;/code&gt; and can enter through either Hallway A or Hallway B. They then move through&lt;code&gt; Hallway A.A&lt;/code&gt; then &lt;code&gt;Hallway A.B&lt;/code&gt; or move through &lt;code&gt;Hallway B.A&lt;/code&gt; and then &lt;code&gt;Hallway B.B&lt;/code&gt;. Either way, they end up at the exhibition room. From the exhibition room, robbers can move to any of the treasure rooms which is where all the valuables are stored. After that, they make their way back to the getaway car to, well, escape and get away.&lt;/p&gt;&#xA;&lt;p&gt;Cops are randomly allocated a position at the start of the heist, and can move wherever they need to.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox Note: There's going to be a system where each room takes a certain number of &amp;quot;strides&amp;quot; to get from one end to another. This way, robbers with stolen items are &amp;quot;slowed down&amp;quot; a little and the cops have a bit of a chance to catch up&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Stealing Treasures&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox Note: Robber specific&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Once you reach a treasure room, you have the oppourtunity to get your hands on some of the finest works the ICGM has to offer. There will be a selection of items to choose from, each with different values.  &lt;strong&gt;Sandbox Note: I might add a part where there is a limit on how much robbers can carry&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;However, items with more value impact how fast you can move through. &lt;strong&gt;Sandbox Note: Something relating to the stride system here&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;But being the sneaky robbers you are, you have a few tricks up your sleeve(s). When moving through the ICGM, you can:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Activate a trap that will slow down the cops (avaliable only once &lt;strong&gt;Sandbox Note: Subject to change&lt;/strong&gt;)&lt;/li&gt;&#xA;&lt;li&gt;[Other things coming soon]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Once you get back to the getaway van, everything you have stolen is considered &amp;quot;safe&amp;quot; and counts towards your team's score. But once you're in the van, that's it... you can't go back for more.&lt;/p&gt;&#xA;&lt;p&gt;Your team wins if you manage to steal items with a combined worth of &lt;code&gt;insert value here&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Protecting the ICGM&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox Note: Cop specific&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;In order to protect the artifacts of the ICGM from being stolen, you have a few abilities you can use against the robbers. You can:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Apprehend a robber if they are in your proximity&lt;/li&gt;&#xA;&lt;li&gt;[Other things coming soon]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For your team to win, the total value of items stolen must not exceed &lt;code&gt;insert value here&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h2&gt;The Catch&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox Note: Common to both threads&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The heist program will only be simulated &lt;em&gt;once&lt;/em&gt;. That means that if your submission errors, you're out of the game for good. I mean, you don't see criminals replace the things they stole just to rerun the heist over and over to see how good they are ;P.&lt;/p&gt;&#xA;&lt;p&gt;The heist will occur on &lt;code&gt;insert date here&lt;/code&gt;. You can edit your submissions all you like until the time of running.&lt;/p&gt;&#xA;&lt;h2&gt;The Controller&lt;/h2&gt;&#xA;&lt;p&gt;Coming soon.&lt;/p&gt;&#xA;&lt;h1&gt;Feedback&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Seeing as how this is a first draft, there are bound to be flaws with things like the movement mechanics and cop/robber interactions. I'm more looking for first impressions and overall flaws in the challenge.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2020-10-13T10:49:30.163" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20414" PostTypeId="2" ParentId="20412" CreationDate="2020-10-13T10:58:00.677" Score="5" Body="&lt;p&gt;&lt;em&gt;Full disclosure: I'm very much at fault for this situation.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;I don't think a manual process can work.&lt;/p&gt;&#xA;&lt;p&gt;However, it should be possible to add entries to &lt;a href=&quot;https://codegolf.stackexchange.com/questions?tab=Bounties&quot;&gt;the bounty filter box&lt;/a&gt;'s &lt;strong&gt;Filter by&lt;/strong&gt; column for each of the possible bounty reasons:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/lmC85.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/lmC85.png&quot; alt=&quot;current bounty filter box&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Then you could de-select &amp;quot;Reward existing answer&amp;quot;:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/TSbCq.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/TSbCq.png&quot; alt=&quot;proposed bounty filter box&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;However, this would need to be a general SE feature, so I suggest you take it up on mother Meta.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2020-10-13T10:58:00.677" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20416" PostTypeId="2" ParentId="20412" CreationDate="2020-10-13T19:41:36.810" Score="1" Body="&lt;h2&gt;Yes, use temporary tags for this&lt;/h2&gt;&#xA;&lt;p&gt;I like the idea of marking bountied challenges with temporary tags indicating the purpose of the bounty. I don't see a problem in creating a few tags for that.&lt;/p&gt;&#xA;&lt;p&gt;If the owner is not aware of the custom, any other user with enough reputation can add the tag (as is often done in regular challenges). If everyone forgets to add the tag in some bountied challenge, it's true that the challenge loses visibility, especially when we all get used to seeing bountied challenges by tags.&lt;/p&gt;&#xA;&lt;p&gt;There's also the question that the tag needs to be removed when the bounty expires. And &lt;em&gt;that&lt;/em&gt; is easier to forget than adding the tag. But I don't see this as an important issue, because the challenge will not show up in the &amp;quot;bountied&amp;quot; tab anymore, so it won't cause clutter.&lt;/p&gt;&#xA;&lt;p&gt;Another minor thing is that the challenge may already have five tags. In that case one of them would have to be temporarily removed, to be added back later. Again, no big deal.&lt;/p&gt;&#xA;&lt;p&gt;All in all, I think the advantages outweigh the drawbacks.&lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2020-10-13T20:03:24.300" LastActivityDate="2020-10-13T20:03:24.300" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20418" PostTypeId="2" ParentId="2140" CreationDate="2020-10-14T07:52:41.663" Score="1" Body="&lt;h1&gt;Compactify the real numbers to a group (WIP)&lt;/h1&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$X = \mathbb{R} \cup \{\infty\}\$&lt;/span&gt;. The &lt;span class=&quot;math-container&quot;&gt;\$\infty\$&lt;/span&gt; is the &lt;strong&gt;point at infinity&lt;/strong&gt; and doesn't have a signature.&lt;/p&gt;&#xA;&lt;p&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$Y = \{\exp(i\theta) : \theta \in [0,2\pi)\}\$&lt;/span&gt;, which is the &lt;strong&gt;unit circle&lt;/strong&gt; on the complex plane.&lt;/p&gt;&#xA;&lt;p&gt;Make &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt; a group by giving &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt; a binary operation, so there will exist a function &lt;span class=&quot;math-container&quot;&gt;\$f : X → Y\$&lt;/span&gt; that is both an &lt;strong&gt;isomorphism&lt;/strong&gt; and a &lt;strong&gt;homeomorphism&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your code shall implement the binary operation. &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; doesn't need to be implemented to a code.&lt;/p&gt;&#xA;&lt;h2&gt;Group&lt;/h2&gt;&#xA;&lt;p&gt;A set &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt; endowed with a binary operation &lt;span class=&quot;math-container&quot;&gt;\$*\$&lt;/span&gt; is a &lt;strong&gt;group&lt;/strong&gt; iff:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;For every &lt;span class=&quot;math-container&quot;&gt;\$a,b,c \in G\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$(a * b) * c = a * (b * c)\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There exists the &lt;strong&gt;identity element&lt;/strong&gt; &lt;span class=&quot;math-container&quot;&gt;\$e \in G\$&lt;/span&gt; such that for every &lt;span class=&quot;math-container&quot;&gt;\$a \in G\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$e * a = a * e = a\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For every &lt;span class=&quot;math-container&quot;&gt;\$a \in G\$&lt;/span&gt;, there exists &lt;span class=&quot;math-container&quot;&gt;\$b \in G\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$b * a = a * b = e\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$Y\$&lt;/span&gt; is a group, where the binary operation is the multiplication.&lt;/p&gt;&#xA;&lt;h2&gt;Isomorphism&lt;/h2&gt;&#xA;&lt;p&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$*\$&lt;/span&gt; denote the binary operation given to &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;A function &lt;span class=&quot;math-container&quot;&gt;\$f : X → Y\$&lt;/span&gt; is an &lt;strong&gt;isomorphism&lt;/strong&gt; iff:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; is bijective&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For every &lt;span class=&quot;math-container&quot;&gt;\$x,y \in X\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$f(x*y) = f(x) × f(y)\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Note that once appropriate &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; is identified, &lt;span class=&quot;math-container&quot;&gt;\$*\$&lt;/span&gt; can be automatically defined as &lt;span class=&quot;math-container&quot;&gt;\$x * y = f^{-1}(f(x) × f(y))\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Topology&lt;/h2&gt;&#xA;&lt;p&gt;A subset &lt;span class=&quot;math-container&quot;&gt;\$A \subset X\$&lt;/span&gt; is &lt;strong&gt;open&lt;/strong&gt; iff, for every &lt;span class=&quot;math-container&quot;&gt;\$x \in A\$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If &lt;span class=&quot;math-container&quot;&gt;\$x \in \mathbb{R}\$&lt;/span&gt;, there exists &lt;span class=&quot;math-container&quot;&gt;\$P \subset A\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$x \in P\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; is an open interval&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If &lt;span class=&quot;math-container&quot;&gt;\$x = \infty\$&lt;/span&gt;, there exists a subset &lt;span class=&quot;math-container&quot;&gt;\$P \subset A\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$x \in P\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; is the union of two open rays to the opposite directions&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;A subset &lt;span class=&quot;math-container&quot;&gt;\$B \subset Y\$&lt;/span&gt; is &lt;strong&gt;open&lt;/strong&gt; iff, for every &lt;span class=&quot;math-container&quot;&gt;\$y \in B\$&lt;/span&gt;, there exists a subset &lt;span class=&quot;math-container&quot;&gt;\$Q \subset B\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$y \in Q\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$Q\$&lt;/span&gt; is an open arc.&lt;/p&gt;&#xA;&lt;h2&gt;Homeomorphism&lt;/h2&gt;&#xA;&lt;p&gt;A function &lt;span class=&quot;math-container&quot;&gt;\$f : X → Y\$&lt;/span&gt; is a &lt;strong&gt;homeomorphism&lt;/strong&gt; iff:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; is bijective&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For every open subset &lt;span class=&quot;math-container&quot;&gt;\$A \subset X\$&lt;/span&gt;, its &lt;strong&gt;image&lt;/strong&gt; &lt;span class=&quot;math-container&quot;&gt;\$f[A]\$&lt;/span&gt; is open in &lt;span class=&quot;math-container&quot;&gt;\$Y\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For every open subset &lt;span class=&quot;math-container&quot;&gt;\$B \subset Y\$&lt;/span&gt;, its &lt;strong&gt;inverse image&lt;/strong&gt; &lt;span class=&quot;math-container&quot;&gt;\$f^{-1}[B]\$&lt;/span&gt; is open in &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Rule&lt;/h2&gt;&#xA;&lt;p&gt;You may represent &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{R}\$&lt;/span&gt; as a floating-point number. Every floating-point error will be tolerated in this regard.&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;An example of &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; is:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;f(x) = \exp(i × 2 \arctan \frac{x}{2})&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;where &lt;span class=&quot;math-container&quot;&gt;\$\arctan \infty = \frac{\pi}{2}\$&lt;/span&gt;, and we identify &lt;span class=&quot;math-container&quot;&gt;\$*\$&lt;/span&gt; as:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;x * y = 2 × \tan (\arctan \frac{x}{2} + \arctan \frac{y}{2})&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;where the identity element is &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;, and the inverse element of &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; is &lt;span class=&quot;math-container&quot;&gt;\$-x\$&lt;/span&gt; when &lt;span class=&quot;math-container&quot;&gt;\$x \in \mathbb{R}\$&lt;/span&gt;, or &lt;span class=&quot;math-container&quot;&gt;\$\infty\$&lt;/span&gt; if &lt;span class=&quot;math-container&quot;&gt;\$x = \infty\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Ungolfed solution&lt;/h2&gt;&#xA;&lt;h3&gt;Haskell&lt;/h3&gt;&#xA;&lt;p&gt;This implementation abuses the fact that IEEE floating-point numbers can encode infinities. Both positive infinity and negative infinity will be treated the same in this regard.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;import Data.Semigroup&#xA;import Data.Monoid&#xA;import Data.Group&#xA;&#xA;newtype CompactR = CompactR Double deriving (Eq, Show, Read)&#xA;&#xA;instance Semigroup CompactR where&#xA;    CompactR x &amp;lt;&amp;gt; CompactR y = CompactR $ 2 * tan (atan (x/2) + atan (y/2))&#xA;&#xA;instance Monoid CompactR where&#xA;    mempty = CompactR 0&#xA;&#xA;instance Group CompactR where&#xA;    invert (CompactR x) = CompactR (negate x)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You implement only &lt;code&gt;&amp;lt;&amp;gt;&lt;/code&gt;. The others are just details.&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&lt;p&gt;This challange turned out to be too easy.&lt;/p&gt;&#xA;&lt;p&gt;What if I asked about one-point compactification of &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{C}\$&lt;/span&gt; instead of &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{R}\$&lt;/span&gt;?&lt;/p&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2020-10-14T09:27:43.297" LastActivityDate="2020-10-14T09:27:43.297" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20419" PostTypeId="2" ParentId="2140" CreationDate="2020-10-14T10:09:35.330" Score="0" Body="&lt;h1&gt;Count the strokes of an ASCII character&lt;/h1&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Given a printable ASCII character (0x21 – 0x7E), count its strokes (as handwritten), then output it.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; The strokes are based on how &lt;strong&gt;I&lt;/strong&gt; write the characters. Those with potential controversy are marked &lt;code&gt;*&lt;/code&gt; below.&lt;/p&gt;&#xA;&lt;h2&gt;Mapping&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;       ! → 2  &amp;quot; → 2  # → 4  $ → 2* % → 3* &amp;amp; → 1* ' → 1&#xA;( → 1  ) → 1  * → 3* + → 2  , → 1  - → 1  . → 1  / → 1&#xA;0 → 1* 1 → 1* 2 → 1  3 → 1  4 → 2  5 → 2  6 → 1  7 → 2*&#xA;8 → 1* 9 → 1  : → 2  ; → 2  &amp;lt; → 1  = → 2  &amp;gt; → 1  ? → 2&#xA;@ → 1  A → 3* B → 2  C → 1  D → 2  E → 3* F → 3  G → 2&#xA;H → 3  I → 3* J → 1* K → 2* L → 1  M → 4* N → 3* O → 1&#xA;P → 2  Q → 1* R → 2  S → 1  T → 2  U → 1  V → 1  W → 1&#xA;X → 2  Y → 2  Z → 2* [ → 1  \ → 1  ] → 1  ^ → 1  _ → 1&#xA;` → 1  a → 1  b → 1  c → 1  d → 1* e → 1  f → 2  g → 2*&#xA;h → 1  i → 2  j → 2  k → 2  l → 1  m → 1  n → 1  o → 1&#xA;p → 1  q → 1  r → 1  s → 1  t → 2  u → 1  v → 1  w → 1&#xA;x → 2  y → 2  z → 2* { → 1  | → 1  } → 1  ~ → 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rule&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Every character outside of U+0021 – U+007E falls in &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="89459" LastActivityDate="2020-10-14T10:09:35.330" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="20422" PostTypeId="1" CreationDate="2020-10-15T08:30:26.560" Score="0" ViewCount="85" Body="&lt;p&gt;Recently I flagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/213457/looks-prime-to-me/213504#comment500073_213504&quot;&gt;this comment&lt;/a&gt; as no longer needed, since it was fully implemented in an my answer. Furthermore, I thanked the user helped my shortening my answer.&lt;/p&gt;&#xA;&lt;p&gt;After reading &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/16230/98669&quot;&gt;this post&lt;/a&gt;, I was wondering why this flag was marked as unhelpful? Is there something else in this comment that is still relevant?&lt;/p&gt;&#xA;" OwnerUserId="98669" LastActivityDate="2020-10-15T09:01:45.573" Title="Declined flag on a comment that was fully implemented in an answer" Tags="|discussion|flags|declined-flags|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20423" PostTypeId="2" ParentId="20422" CreationDate="2020-10-15T09:01:45.573" Score="7" Body="&lt;p&gt;Not the flag-marker, and I by no means represent the community's customs, rules, or attitudes, but I feel like a comment suggesting an improvement to an answer here sort of represents part of the &lt;em&gt;story&lt;/em&gt; of how that program got golfed to where it is, rather than fixing some factual error or typo in the body of a question. So regardless of whether or not the flag was marked appropriately, that may at least be the rationale.&lt;/p&gt;&#xA;" OwnerUserId="85334" LastActivityDate="2020-10-15T09:01:45.573" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20424" PostTypeId="2" ParentId="2140" CreationDate="2020-10-15T13:53:25.960" Score="0" Body="&lt;h1&gt;Position my geohashes&lt;/h1&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;This is the reverse challenge of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/212301/geohash-my-positions/&quot;&gt;Geohash my positions&lt;/a&gt;. Given a Geohash string of length 8, convert it to a latitude and a longitude. The conversion is done by the following algorithm, using &lt;code&gt;u09tunqu&lt;/code&gt; as an example input.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For each character of the Geohash string, find its 0-indexed position in the map &lt;code&gt;0123456789bcdefghjkmnpqrstuvwxyz&lt;/code&gt;.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;u09tunqu&lt;/code&gt; becomes &lt;code&gt;26 0 9 25 26 20 22 26&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Convert each integer into a binary string of length 5.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;26 0 9 25 26 20 22 26&lt;/code&gt; becomes &lt;code&gt;11010 00000 01001 11001 11010 10100 10110 11010&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Join the binary strings together.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;11010 00000 01001 11001 11010 10100 10110 11010&lt;/code&gt; becomes &lt;code&gt;1101000000010011100111010101001011011010&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Separate the odd positions in the joined binary string from the even positions. These represent the longitude and latitude, respectively.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;1101000000010011100111010101001011011010&lt;/code&gt; becomes &lt;code&gt;10000001101000011011&lt;/code&gt; (odd positions: longitude) and &lt;code&gt;11000101011111001100&lt;/code&gt; (even positions: latitude).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The latitude should be somewhere in the range (-90, 90). Narrow down the range, based on the first character in the latitude binary string. If the first character is &lt;code&gt;0&lt;/code&gt;, the latitude should converge to the lower half of this range, i.e. (-90, 0). If the first character is &lt;code&gt;1&lt;/code&gt;, the latitude should converge to the upper half of this range, i.e. (0, 90).&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The 1st character in &lt;code&gt;11000101011111001100&lt;/code&gt; is &lt;code&gt;1&lt;/code&gt;, so the new range becomes (0, 90).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The remaining characters in the binary string are to be processed in the same way, where &lt;code&gt;0&lt;/code&gt; represents the lower half of the new range and &lt;code&gt;1&lt;/code&gt; represents the upper half of the new range.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The 2nd character in &lt;code&gt;11000101011111001100&lt;/code&gt; is &lt;code&gt;1&lt;/code&gt;, so the new range becomes (45, 90).&lt;/li&gt;&#xA;&lt;li&gt;The 3rd character in &lt;code&gt;11000101011111001100&lt;/code&gt; is &lt;code&gt;0&lt;/code&gt;, so the new range becomes (45.0, 67.5).&lt;/li&gt;&#xA;&lt;li&gt;The 4th character in &lt;code&gt;11000101011111001100&lt;/code&gt; is &lt;code&gt;0&lt;/code&gt;, so the new range becomes (45.0, 56.25).&lt;/li&gt;&#xA;&lt;li&gt;The 5th character in &lt;code&gt;11000101011111001100&lt;/code&gt; is &lt;code&gt;0&lt;/code&gt;, so the new range becomes (45.0, 50.625).&lt;/li&gt;&#xA;&lt;li&gt;The 6th character in &lt;code&gt;11000101011111001100&lt;/code&gt; is &lt;code&gt;1&lt;/code&gt;, so the new range becomes (47.8125, 50.625).&lt;/li&gt;&#xA;&lt;li&gt;...&lt;/li&gt;&#xA;&lt;li&gt;The 20th character in &lt;code&gt;11000101011111001100&lt;/code&gt; is &lt;code&gt;0&lt;/code&gt;, so the final range becomes (48.85826, 48.85843).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The final latitude is the midpoint of the final range.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;(48.85826, 48.85843) becomes 48.85835&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Repeat the same process for the longitude, starting from the range (-180, 180)&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;10000001101000011011&lt;/code&gt; becomes 2.29460&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Output the final latitude and longitude.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;u09tunqu&lt;/code&gt; becomes &lt;code&gt;48.85835, 2.29460&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;A string of length 8, consisting only of the characters &lt;code&gt;0123456789bcdefghjkmnpqrstuvwxyz&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;Two signed floats in the ranges (-90.0, 90.0) and (-180.0, 180.0) representing the corresponding latitude and longitude.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;u09tunqu → (48.85835, 2.2946)&#xA;dr5r7p62 → (40.68933, -74.04459)&#xA;stq4s8cf → (29.97525, 31.13783)&#xA;75cm2txp → (-22.9519, -43.21043)&#xA;usdkfsq8 → (71.17089, 25.78302)&#xA;zzzzzzzz → (89.99991, 179.99983)&#xA;00000000 → (-89.99991, -179.99983)&#xA;ezs42s00 → (42.60507, -5.60286)&#xA;7zzzzzzz → (-0.00009, -0.00017)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;General remarks&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the answer using the fewest bytes in each language wins.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet/&quot;&gt;Standard rules&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;I/O rules&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;loophole rules&lt;/a&gt; apply.&lt;/li&gt;&#xA;&lt;li&gt;Please include a &lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it Online&lt;/a&gt;-link or equivalent to demonstrate your code working.&lt;/li&gt;&#xA;&lt;li&gt;Please motivate your answer with an explanation of your code.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="87681" LastEditorUserId="87681" LastEditDate="2020-10-20T12:30:41.660" LastActivityDate="2020-10-20T12:30:41.660" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20425" PostTypeId="2" ParentId="2140" CreationDate="2020-10-15T17:07:42.070" Score="1" Body="&lt;h1&gt;(Pan)consummate Vs&lt;/h1&gt;&#xA;&lt;p&gt;An integer &lt;span class=&quot;math-container&quot;&gt;\$v\$&lt;/span&gt; is said to be &lt;em&gt;consummate&lt;/em&gt; if there is an integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and a base &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; divided by the sum of its base &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; digits is equal to &lt;span class=&quot;math-container&quot;&gt;\$v\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;An integer &lt;span class=&quot;math-container&quot;&gt;\$v\$&lt;/span&gt; is said to be &lt;em&gt;panconsummate&lt;/em&gt; if it is consummate in all bases &lt;span class=&quot;math-container&quot;&gt;\$b\geq 2\$&lt;/span&gt;. Panconsummate numbers are &lt;a href=&quot;http://oeis.org/A058226&quot; rel=&quot;nofollow noreferrer&quot;&gt;A058226&lt;/a&gt; in the OEIS.&lt;/p&gt;&#xA;&lt;h2&gt;Your task:&lt;/h2&gt;&#xA;&lt;p&gt;Write a full program or function that takes a positive integer &lt;span class=&quot;math-container&quot;&gt;\$v\$&lt;/span&gt; and returns two distinct, consistent values, one if &lt;span class=&quot;math-container&quot;&gt;\$v\$&lt;/span&gt; is panconsummate, and the other if &lt;span class=&quot;math-container&quot;&gt;\$v\$&lt;/span&gt; is not. However, &lt;strong&gt;the sum of your code's bytes must be panconsummate as well&lt;/strong&gt;. Your code must work theoretically for any integer.&lt;/p&gt;&#xA;&lt;p&gt;Truthy values:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 18, 20, 21, 23, 24, 31, 34, 36, 37, 39, 40, 43, 45, 53, 54, 57, 59, 61, 69, 72, 73, 77, 78, 81, 85, 89, 91, 121, 127, 144, 166, 169, 211, 219, 231, 239, 257, 267, 271, 331, 337, 353, 361, 413, 481, 523, 571, 661, 721, 1093, 1291, 3097&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Falsey values:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;13, 16, 17, 19, 22, 25, 26, 27, 28, 29, 30, 32, 33, 35, 38, 41, 42, 44, 46, 47, 48, 49, 50, 51, 52, 55, 56, 58, 60, 62, 63, 64, 65, 66, 67, 68, 70, 71, 74, 75, 76, 79, 80, 82, 83, 84, 86, 87, 88, 90, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 122, 123, 124, 125, 126, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 167, 168, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that panconsummate numbers &lt;span class=&quot;math-container&quot;&gt;\$v&amp;gt;3097\$&lt;/span&gt; must be at least &lt;span class=&quot;math-container&quot;&gt;\$10^6\$&lt;/span&gt;, and the OEIS speculates that the truthy values above are all panconsummate numbers.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base-conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; rel=&quot;tag&quot;&gt;base-conversion&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="67312" LastEditorUserId="67312" LastEditDate="2020-11-25T16:12:17.017" LastActivityDate="2020-11-25T16:12:17.017" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20427" PostTypeId="2" ParentId="2447" CreationDate="2020-10-16T04:07:28.173" Score="-2" Body="&lt;h1&gt;Program may take input from environment variables&lt;/h1&gt;&#xA;&lt;p&gt;Environment variables are generally supported by many languages:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;C program may access environment variables from &lt;code&gt;getenv&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Python program may access environment variables from &lt;code&gt;os.environ&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Environment variables are typically a constant in program, which is quite different from a &lt;em&gt;variable&lt;/em&gt; in languages.&lt;/p&gt;&#xA;&lt;p&gt;Many real word software supports / suggests user config some options from environments. For example, &lt;a href=&quot;https://docs.docker.com/compose/environment-variables/&quot; rel=&quot;nofollow noreferrer&quot;&gt;docker docs&lt;/a&gt;, &lt;a href=&quot;https://docs.aws.amazon.com/cli/latest/userguide/cli-configure-envvars.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;aws cli&lt;/a&gt;, even &lt;a href=&quot;https://linux.die.net/man/1/ls&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;ls&lt;/code&gt; command&lt;/a&gt; ...&lt;/p&gt;&#xA;&lt;p&gt;Environment variables are similar to function submissions which accept its arguments by name instead by position.&lt;/p&gt;&#xA;" OwnerUserId="44718" LastEditorUserId="66833" LastEditDate="2021-06-28T15:03:31.177" LastActivityDate="2021-06-28T15:03:31.177" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20432" PostTypeId="2" ParentId="2140" CreationDate="2020-10-16T23:15:47.060" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/214131/66833&quot;&gt;Minimise a bijection \$\mathbb{N}^n\to\mathbb{N}\$&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2020-10-25T17:08:00.167" LastActivityDate="2020-10-25T17:08:00.167" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="20433" PostTypeId="2" ParentId="2140" CreationDate="2020-10-17T17:54:15.797" Score="1" Body="&lt;h1&gt;Convert hexadecimal to decimal&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base-conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; rel=&quot;tag&quot;&gt;base-conversion&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;We have a lot of base conversion challenges. Surprisingly, aside from one &lt;a href=&quot;https://codegolf.stackexchange.com/questions/3741/hexadecimal-to-decimal&quot;&gt;closed&lt;/a&gt; challenge, there aren't any where the goal is purely to convert hexadecimal to decimal. This is different from challenges like converting hexadecimal to binary, because many languages have features like hexadecimal literals (&lt;code&gt;0x&lt;/code&gt;, &lt;code&gt;$&lt;/code&gt;, etc.) which can do this in a much shorter or more interesting way.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;I/O:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;You should create either a program or function, which takes input and output through one of the allowed methods. The input will be a hexadecimal number, consisting of the characters &lt;code&gt;/[0-9a-f]/&lt;/code&gt; (you may choose the capitalization rules).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Scoring:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is code golf, shortest answer per language wins.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2020-10-17T17:54:15.797" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20434" PostTypeId="2" ParentId="2140" CreationDate="2020-10-18T12:47:03.617" Score="-1" Body="&lt;h1&gt;Is it a Pythagorean triple? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Given three numbers, determine whether they form a primitive &lt;a href=&quot;https://en.wikipedia.org/wiki/Pythagorean_triple&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pythagorean triple&lt;/a&gt;. Here is the definition:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;all three numbers are positive integers&lt;/li&gt;&#xA;&lt;li&gt;they represent the side lengths of a right-angled triangle, that is, &lt;span class=&quot;math-container&quot;&gt;\$a^2 + b^2 = c^2\$&lt;/span&gt; for any ordering of &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt;, and &lt;span class=&quot;math-container&quot;&gt;\$c\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;no other primitive Pythagorean triple exists with the same ratio of side lengths, that is, they are &lt;a href=&quot;https://en.wikipedia.org/wiki/Coprime_integers&quot; rel=&quot;nofollow noreferrer&quot;&gt;coprime&lt;/a&gt;. For example, &lt;span class=&quot;math-container&quot;&gt;\$[6, 8, 10]\$&lt;/span&gt; is &lt;strong&gt;not&lt;/strong&gt; a &lt;em&gt;primitive&lt;/em&gt; Pythagorean triple, even though it satisfies the above conditions, because the simper &lt;span class=&quot;math-container&quot;&gt;\$[3, 4, 5]\$&lt;/span&gt; exists.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Unless your language doesn't support them, you must accept floating-point numbers (even though Pythagorean Triples use, by definition, integers)&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;meta&lt;/strong&gt;: Is this necessary? Is it too restrictive?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;You may be given negative numbers, &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;, or numbers that cannot form any triangle (right-angled or not, i.e. &lt;span class=&quot;math-container&quot;&gt;\$a + b \le c\$&lt;/span&gt;), in which cases you must return false.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;meta&lt;/strong&gt;: Is this necessary? Does it make it too difficult?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;You can return any two distinct individual values, or any typical truthy/falsey values for your language.&lt;/li&gt;&#xA;&lt;li&gt;Standard I/O and loophole rules apply.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest function or full program in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;[0, 3, 3] =&amp;gt; false&#xA;[3, 4, 5] =&amp;gt; true&#xA;[5, 3, 4] =&amp;gt; true&#xA;[3, 4, 6] =&amp;gt; false&#xA;[3, 4, 10] =&amp;gt; false&#xA;[6, 8, 10] =&amp;gt; false&#xA;[3.0, 4.0, 5.0] =&amp;gt; true&#xA;[3.1, 4.0, 5.0] =&amp;gt; false&#xA;[-3, -4, -5] =&amp;gt; false&#xA;[3, 4, -5] =&amp;gt; false&#xA;[4.5, 6, 7.5] =&amp;gt; false&#xA;[91, 60, 109] =&amp;gt; true&#xA;[264, 265, 23] =&amp;gt; true&#xA;[81, 210, 184] =&amp;gt; false&#xA;[140, 221, 83] =&amp;gt; false&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are the first two rules necessary, or do they restrict it too much?&lt;/li&gt;&#xA;&lt;li&gt;Is it clear enough? Are there any additional rules I need to add? Are more test cases needed?&lt;/li&gt;&#xA;&lt;li&gt;Does this suit the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt; tags? It's kind of tangential to both areas.&lt;/li&gt;&#xA;&lt;li&gt;Is this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; too similar to the existing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; questions that want you to &lt;em&gt;generate&lt;/em&gt; triples?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2020-10-18T12:47:03.617" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20436" PostTypeId="1" CreationDate="2020-10-20T08:50:19.340" Score="7" ViewCount="171" Body="&lt;p&gt;My first ever question &lt;a href=&quot;https://codegolf.stackexchange.com/q/212300/85527&quot;&gt;Find all integer pairs that produce a given Loeschian number&lt;/a&gt; was a straightforward &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; tagged problem. I copied the format from an earlier related question, including the line:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This is code golf so shortest code wins.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;In this case it seems that when I'm ready and certain things have settled down, I should simply accept the answer with the lowest final byte count.&lt;/p&gt;&#xA;&lt;p&gt;If there are more than one answer with the lowest byte count (which appears to be the case now with two at 9 bytes) then I can either refrain from acceptance, or choose one on a secondary criteria of my choosing.&lt;/p&gt;&#xA;&lt;p&gt;Have I got it right, or are there other things I might consider?&lt;/p&gt;&#xA;" OwnerUserId="85527" LastActivityDate="2020-10-20T10:04:30.373" Title="Accepting my first answer, things to consider beyond byte count with a tie on &quot;shortest code wins&quot; question?" Tags="|discussion|specific-question|accepted-answer|" AnswerCount="1" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="20437" PostTypeId="2" ParentId="20436" CreationDate="2020-10-20T09:56:08.830" Score="7" Body="&lt;p&gt;Usually, the practice is that code golf challenges don't accept answers (same goes with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;. There are some tags where accepting is kinda expected like king-of-the-hill and answer-chaining, but those usually will state what the single winning answer criteria is). However, whether or not an answer is accepted is up to you. If you do choose to accept an answer (which is totally okay if you do), I would consider the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Does it look like there'll be a shorter answer? By this, I mean that if there's a 3 byte answer and a good portion of golfing languages have been used, then &lt;em&gt;chances are&lt;/em&gt; there won't be a shorter answer. If that's the case, then accepting an answer probably is appropriate. If not (in other words, you feel there's room for answers to be shorter), consider not accepting an answer.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Which answer reached the shortest byte count first? Usually, submission time is the tiebreaker when the same byte count has been reached by multiple answers. This is verifiable through edit history.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is there an answer which every other answer has based their solution upon? Oftentimes, people will appropriate an existing answer to another language. This is called &amp;quot;porting&amp;quot;, and the answer which has been ported is often credited (note that its possible for multiple people to use the same approach independently).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;At the end of the day, which answer you select as accepted is up to you. This is merely a guide on how to approach selecting an answer and is based upon personal opinion and experience.&lt;/p&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2020-10-20T10:04:30.373" LastActivityDate="2020-10-20T10:04:30.373" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="20438" PostTypeId="2" ParentId="2140" CreationDate="2020-10-20T19:43:04.850" Score="9" Body="&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2021-08-16T11:21:05.077" LastActivityDate="2021-08-16T11:21:05.077" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20439" PostTypeId="1" CreationDate="2020-10-21T00:37:17.537" Score="12" ViewCount="202" Body="&lt;p&gt;Since we have a full moderation team now and the load isn't all on one person, some of you may have noticed that flags are being handled a lot faster now. However, this has resulted in the problem that sometimes flags could be addressed before a user may have even had a chance to see the comment and fix their answer. I usually wait a day or two if the user is active to see if they'll fix it first; however, we would like a community consensus on how we should handle flags.&lt;/p&gt;&#xA;&lt;p&gt;In particular, this is relating to invalid answers and submissions that are not serious contenders. Obviously, spam, offensive posts, and other serious matters will be handled immediately.&lt;/p&gt;&#xA;&lt;p&gt;Feel free to add additional proposals on top of the three base ones I have presented. Upvote/downvote to show that you agree/disagree with a particular method.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2020-10-21T09:44:26.627" Title="Moderation: Handling flags and deleting answers" Tags="|discussion|flags|moderation|" AnswerCount="4" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20440" PostTypeId="2" ParentId="20439" CreationDate="2020-10-21T00:37:44.433" Score="12" Body="&lt;h1&gt;Give users time&lt;/h1&gt;&#xA;&lt;p&gt;Wait until it's been 2 days since the user was notified that their submission is invalid to delete the answer.&lt;/p&gt;&#xA;&lt;p&gt;For example, if someone commented that an answer is invalid in 2016 and it was only flagged now, remove it.&lt;/p&gt;&#xA;&lt;p&gt;If someone comments that an answer is invalid (which the answerer did not previously know about) and immediately flags it, wait until it's been 2 days to delete the answer if it hasn't been fixed.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2020-10-21T00:37:44.433" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20441" PostTypeId="2" ParentId="20439" CreationDate="2020-10-21T00:38:10.410" Score="1" Body="&lt;h1&gt;Give users a reminder&lt;/h1&gt;&#xA;&lt;p&gt;Give the user a reminder/new notification to fix it before removing it.&lt;/p&gt;&#xA;&lt;p&gt;For example, if someone commented that an answer is invalid in 2016 and it was flagged now, leave a new comment reminding them to fix it, and delete it 2 days later if it hasn't been fixed.&lt;/p&gt;&#xA;&lt;p&gt;If someone comments that an answer is invalid and immediately flags it, even if the user was already told a long time ago, still wait 2 days to give the user another chance to fix it.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2020-10-21T00:38:10.410" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20442" PostTypeId="2" ParentId="20439" CreationDate="2020-10-21T00:38:22.497" Score="7" Body="&lt;h1&gt;Delete it immediately&lt;/h1&gt;&#xA;&lt;p&gt;Comment on and remove the invalid answer immediately, and let the user fix it and flag for undeletion if they decide to.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2020-10-21T00:38:22.497" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20443" PostTypeId="2" ParentId="20439" CreationDate="2020-10-21T09:44:26.627" Score="12" Body="&lt;h2&gt;Delete old posts immediately&lt;/h2&gt;&#xA;&lt;p&gt;I would like to also suggest the option of deleting invalid answers immediately on flagging only if there has been more than a year and a half since the last edit, with new invalid answers given more time (2 days seems to be the working number).&lt;/p&gt;&#xA;&lt;p&gt;Older answers are less likely to have an active owner, and don't lose rep when deleted.  The user will be notified of the deletion (with a comment explaining the reason and the process for reversal) and they will have time to fix it.  There isn't much cost to it being deleted since it was inactive and the owner can fix it at any time.  The main benefit is that it makes handling flags easier since we don't have so many flags sitting around un-handled.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2020-10-21T09:44:26.627" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20444" PostTypeId="2" ParentId="2140" CreationDate="2020-10-21T10:11:39.943" Score="1" Body="&lt;h1&gt;Is a coincident point in a pair of rotated hexagonal lattices closest to the origin? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;I've deleted from &lt;a href=&quot;https://codegolf.stackexchange.com/q/213881/85527&quot;&gt;here&lt;/a&gt; because I agree it is takes too much time to understand at the moment.&lt;/p&gt;&#xA;&lt;h2&gt;Preface&lt;/h2&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question where the technique must &lt;em&gt;search or exclude from search&lt;/em&gt; all possibilities. As soon as I figure out how to pose it, there will be a separate &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; question for mathematical techniques other than a simple search, so please don't use them here.&lt;/p&gt;&#xA;&lt;p&gt;Below is quoted from Math SE &lt;a href=&quot;https://math.stackexchange.com/q/3705547/284619&quot;&gt;determining if a coincident point in a pair of rotated hexagonal lattices is closest to the origin?&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A pair of hexagonal lattices with one scaled by the square root of a rational number &lt;span class=&quot;math-container&quot;&gt;\$r = \sqrt{\frac{m}{n}}\$&lt;/span&gt; and then rotated will produce a variety of different hexagonal lattices of coincident points.&lt;/p&gt;&#xA;&lt;p&gt;For the first lattice let&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$x, y = i+\frac{1}{2}j, \ \frac{\sqrt{3}}{2}j$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;and for the second&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$x, y = r\left(k+\frac{1}{2}l\right), \ r\left(\frac{\sqrt{3}}{2}l\right).$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Per &lt;a href=&quot;https://math.stackexchange.com/a/3669744/284619&quot;&gt;this&lt;/a&gt; and &lt;a href=&quot;https://math.stackexchange.com/a/3327186/284619&quot;&gt;this&lt;/a&gt; helpful answer the squares of the distances to unit lattice points are given by &lt;a href=&quot;http://oeis.org/A003136&quot; rel=&quot;nofollow noreferrer&quot;&gt;Loeschian numbers (A003136)&lt;/a&gt; equal to &lt;span class=&quot;math-container&quot;&gt;\$i^2+ij+j^2\$&lt;/span&gt; so in this case a point &lt;span class=&quot;math-container&quot;&gt;\$i, j\$&lt;/span&gt; on the first lattice will coincide with a point &lt;span class=&quot;math-container&quot;&gt;\$k, l\$&lt;/span&gt; on the second lattice once rotated by some amount if&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$n(i^2+ij+j^2) = m(k^2+kl+l^2).$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;For example if &lt;span class=&quot;math-container&quot;&gt;\$m, n = 13, 7\$&lt;/span&gt; then both &lt;span class=&quot;math-container&quot;&gt;\$(i, j) = (5, 6)\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$(6, 5)\$&lt;/span&gt; will coincide with &lt;span class=&quot;math-container&quot;&gt;\$(k, l) = (5, 3)\$&lt;/span&gt; at rotation angles of about 5.2 and 11.2 degrees as given by.&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$\theta = \arctan\left( \frac{\frac{\sqrt{3}}{2}l}{k+\frac{1}{2}l} \right) - \arctan\left( \frac{\frac{\sqrt{3}}{2}j}{i+\frac{1}{2}j} \right)$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;However, while the first solution is part of the hexagonal superlattice built on the much closer point &lt;span class=&quot;math-container&quot;&gt;\$(i, j), (k, l) = (1, 3), (1, 2)\$&lt;/span&gt; the second point represents the shortest possible coincident distance &lt;em&gt;and therefore a far lower density coincident lattice&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Zn17c.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Zn17c.png&quot; alt=&quot;coincident hexagonal lattices&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;plotting script: &lt;a href=&quot;https://pastebin.com/pZFCGXbE&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://pastebin.com/pZFCGXbE&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Given the rational number (m, n) e.g. (13, 7) and pairs of known coincident lattice points, e.g. (5, 6), (3, 5) or (6, 5), (3, 5) (besides the origin) we want to find out if this is one of the six closest coincident lattice points, or if it is a member of a coincident lattice with points closer.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;If it's one of the six closest:&lt;/strong&gt; return some flag letting us know there wasn't anything closer. You may also return either the same point, or one of the other five of identical distance.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;If it isn't:&lt;/strong&gt; return one of the six points that was closest along with (but not only) a flag letting us know that a closer point was found and the original point wasn't one of the closest. Reminder that this will be a closer point in a coincident lattice that also contains the original input.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Do this by some combination of searching/testing all possible pairs of lattice points (one from each lattice) to see if they are coincident and closer and potentially excluding blocks of combinations that don't need searching. The problem is finite because one only searches points that aren't obviously farther from the origin.&lt;/p&gt;&#xA;&lt;p&gt;Feel free to use tricks to exclude large fractions from search as long as they rely on simple rules, for example a point near the origin in one lattice will never be coincident with a point near a distant point in the other.&lt;/p&gt;&#xA;&lt;p&gt;But if you find yourself considering computations like matrix division or using &lt;a href=&quot;https://en.wikipedia.org/wiki/Eisenstein_integer&quot; rel=&quot;nofollow noreferrer&quot;&gt;Eisenstein integers&lt;/a&gt; or &lt;a href=&quot;https://math.stackexchange.com/a/3829536/284619&quot;&gt;Euclid's algorithm&lt;/a&gt; in the complex plane please save that for the follow-up &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; question.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest code wins.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input will have six integers &lt;span class=&quot;math-container&quot;&gt;\$(m, n), (i, j), (k, l)\$&lt;/span&gt; as described above, but can have any order or hierarchy, or additional (but uninformative) place holders (e.g. zero padding, blanks...)&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$(m, n)\$&lt;/span&gt; will be positive, but the other four can be positive, negative or zero, excluding a &lt;span class=&quot;math-container&quot;&gt;\$(0, 0)\$&lt;/span&gt; pair (the origin).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Recipe for making test cases&lt;/h2&gt;&#xA;&lt;p&gt;In addition to the two mentioned above (13, 7), (5, 6), (5, 3) and (13, 7), (6, 5), (5, 3) you can roll your own:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Pick two Loeschian numbers &lt;span class=&quot;math-container&quot;&gt;\$L_1\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$L_2\$&lt;/span&gt; and find some integer pairs (i, j), (k, l) that can make them. (&lt;a href=&quot;https://codegolf.stackexchange.com/q/212300/85527&quot;&gt;Find all integer pairs that produce a given Loeschian number&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Make new pairs by choosing two nonzero integers &lt;span class=&quot;math-container&quot;&gt;\$a, b\$&lt;/span&gt;, then:&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\begin{align}&#xA;i' &amp;amp; = ai - bj\\&#xA;j' &amp;amp; = aj + b(i+j)\\&#xA;k' &amp;amp; = ak - bl\\&#xA;l' &amp;amp; = al + b(k+l).&#xA;\end{align}&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;If &lt;span class=&quot;math-container&quot;&gt;\$i, j\$&lt;/span&gt;  and &lt;span class=&quot;math-container&quot;&gt;\$k, l\$&lt;/span&gt; were coincident, then  &lt;span class=&quot;math-container&quot;&gt;\$i', j'\$&lt;/span&gt;  and &lt;span class=&quot;math-container&quot;&gt;\$k', l'\$&lt;/span&gt; will be as well.&lt;/p&gt;&#xA;&lt;p&gt;(This just says that the coincidence lattice between two hexagonal lattices is also a hexagonal lattice.)&lt;/p&gt;&#xA;" OwnerUserId="85527" LastActivityDate="2020-10-21T10:11:39.943" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20445" PostTypeId="2" ParentId="2140" CreationDate="2020-10-21T11:23:42.740" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/213990/count-the-collatz-survivors-mod-2n&quot;&gt;Count the Collatz survivors mod 2^n&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="71546" LastEditorUserId="71546" LastEditDate="2020-10-23T01:34:15.733" LastActivityDate="2020-10-23T01:34:15.733" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20446" PostTypeId="2" ParentId="2140" CreationDate="2020-10-21T16:53:32.377" Score="1" Body="&lt;h1&gt;Get the Systematic Chemical Symbol&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/214044/get-the-systematic-chemical-symbol&quot;&gt;posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2020-10-23T19:56:02.757" LastActivityDate="2020-10-23T19:56:02.757" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20447" PostTypeId="2" ParentId="2140" CreationDate="2020-10-21T18:35:17.143" Score="1" Body="&lt;p&gt;As a Web Frontend developer, I feel out of place most of the time coming here. And that is despite the existence of established challenges like &lt;a href=&quot;https://a.singlediv.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;One Div&lt;/a&gt; in the field of web development. But they aren't here, because objective criteria are hard to do. (Sparing more unkind reasons.)&lt;/p&gt;&#xA;&lt;p&gt;Maybe the following would be a way to draw others. It's not a One Div challenge, but a way to set different web technologies against one another in a sort of code golf.&lt;/p&gt;&#xA;&lt;p&gt;To give you an idea, compare these two Codepens:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codepen.io/thebabydino/pen/gOMOMYz&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://codepen.io/thebabydino/pen/gOMOMYz&lt;/a&gt; 4 lines of Pug and 28 lines of SCSS&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codepen.io/ccprog/pen/jOrMjLW&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://codepen.io/ccprog/pen/jOrMjLW&lt;/a&gt; 19 lines of Pug and 8 lines of Sass&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;(To be fair, &lt;code&gt;thebabydino&lt;/code&gt; doesn't know at the time of writing there is a challenge, it was a &lt;a href=&quot;https://css-tricks.com/smarter-ways-to-generate-a-deep-nested-html-structure/#comment-1764284&quot; rel=&quot;nofollow noreferrer&quot;&gt;spontaneous idea&lt;/a&gt; after seeing her code.)&lt;/p&gt;&#xA;&lt;p&gt;It was rightly pointed out to me that capturing the idea of good coding practice will probably fail. But let me give you a vision: &lt;strong&gt;What if the challenges were not only about learning new coding tricks, but also about identifying the &amp;quot;cheats&amp;quot;?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;There is a whole industry out there that tries to make objective rules to ultimately measure code quality. Their work is mostly to tilt against windmills. Maybe there is a way to make a playfull challenge a tool to identify new features for linters.&lt;/p&gt;&#xA;&lt;p&gt;If good coding wins, so much better for it. If everyone thinks the winner was going squarely against the spirit of good coding practice, professionalism gains a discussion.&lt;/p&gt;&#xA;&lt;p&gt;(Somehow this reminds me of the discussion about doping in sports.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;I hope to make the playing field understandable also to non-web people, so please bear with me if I add comments that would be obvious to everyone in the profession.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;One goal here is performance. There are a lot of champions for the approach to minimize external dependencies loaded into the browser. I am trying to capture this with a &amp;quot;no external request&amp;quot; rule. This is not only about the size of files loaded but also the debt of interpreting extensive JS frameworks. Look at current discussions about web site performance, and you will understand what I am talking about.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge: Recreate the image with web technologies&lt;/h2&gt;&#xA;&lt;p&gt;A real question would contain a raster image in any format. Most likely, they will be PNG or GIF (to show animations).&lt;/p&gt;&#xA;&lt;h3&gt;The code must be runnable on &lt;a href=&quot;https://codepen.io&quot; rel=&quot;nofollow noreferrer&quot;&gt;Codepen&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;You must create a pen and post its URL here. Your own authorship should be on a honors base. Anonymous pens are acceptable, but if your nick is the same here as there, you must use your account.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;There are a good number of web development environments around, but they all offer different features. The criterium for selection was the ease to enforce the &amp;quot;no external resources&amp;quot; rule - and popularity, of course.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;In addition, the code must be posted in its entirety here.&lt;/p&gt;&#xA;&lt;h3&gt;No external code&lt;/h3&gt;&#xA;&lt;p&gt;The pen must not include any external sources.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No import statements in any language&lt;/li&gt;&#xA;&lt;li&gt;no statements that trigger any external requests&lt;/li&gt;&#xA;&lt;li&gt;no external stylesheets or scripts imported via the pen settings&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;An important case here is the use of JS frameworks that offer server-side rendering, or template languages like JSX. Should their source code be made legal? This sort of code is mostly undistinguishable from code used client-side, with the difference that it must be compiled before it is delivered to the client.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;No base64-encoding&lt;/h3&gt;&#xA;&lt;p&gt;No part of the code should be unreadable at first glance. So neither HTML, nor CSS, nor JS are allowed to contain any base64-encoded strings&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No &lt;code&gt;data:&lt;/code&gt; URI that contains the &lt;code&gt;base64&lt;/code&gt; option&lt;/li&gt;&#xA;&lt;li&gt;The use of &lt;code&gt;atob()&lt;/code&gt; and &lt;code&gt;btoa()&lt;/code&gt; in JS is ok, provided there is no string literal containing a base64-encoded string&lt;/li&gt;&#xA;&lt;li&gt;The use of &lt;code&gt;&amp;lt;canvas&amp;gt;&lt;/code&gt; and/or &lt;code&gt;URL.createObjectURL()&lt;/code&gt; is certainly ok, provided there is no string literal containing a base64-encoded string&lt;/li&gt;&#xA;&lt;li&gt;The use of &lt;code&gt;Blob&lt;/code&gt; or &lt;code&gt;ArrayBuffer&lt;/code&gt; to construct images is certainly ok.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;The use of preprocessors is allowed&lt;/h3&gt;&#xA;&lt;p&gt;Any preprocessor that is offered by CodePen can be used. What counts for the solution is the source code in that language.&lt;/p&gt;&#xA;&lt;p&gt;Using Babel as a preprocessor inside CodePen is ok, but the &amp;quot;no imports&amp;quot; rule applies just the same.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Currently the Babel preprocessor offered by CodePen has a fixed configuration. If that changes in the future, it might be valid or not to use an URI to an external config file or npm module or not. That is in the future. The basic idea here is &lt;em&gt;&amp;quot;if it is executed on the server side, or by native browser code, go for it&amp;quot;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;Linting must pass&lt;/h3&gt;&#xA;&lt;p&gt;To give languages a fair chance that rely on fixed indents, and to maintain readability, the Javascript part must pass &lt;a href=&quot;https://eslint.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;ESLint&lt;/a&gt; without any warning or error.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Which preset does the best to enforce good code quality? It was pointed out that there will probably remain a number of loopholes, but I would like to try to get them as few and obscure as possible.&lt;/li&gt;&#xA;&lt;li&gt;I am not so fluent with linters for other languages. Proposals?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;No minification&lt;/h3&gt;&#xA;&lt;p&gt;All code should be pretty.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Running &lt;a href=&quot;https://prettier.io&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;prettier&lt;/code&gt;&lt;/a&gt; must not change the code formatting&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This might not cover all languages. Please review and propose other/additional formatters.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No code line can be longer than 80 columns&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Matching the source image&lt;/h3&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I have still to research that. My first instinct is to use ImageMagicks &lt;code&gt;magick compare&lt;/code&gt; and set a cutoff value to account for antialiasing and rounding differences, but that does not solve how to capture animations. Maybe capture all frames with Lighthouse?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;Wining criterium: aggregated Number of lines of code&lt;/h3&gt;&#xA;&lt;p&gt;The number of lines of source code in markup, stylesheet and script are added. The least number of lines wins.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Numbers are counted using &lt;a href=&quot;https://www.npmjs.com/package/sloc&quot; rel=&quot;nofollow noreferrer&quot;&gt;sloc&lt;/a&gt;. Only the &lt;code&gt;Source&lt;/code&gt; output value is relevant. For example on the command line&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  sloc pen.css | grep Source&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;is there a sensible way to scrape the code lines directly from Codepen? Or is this available on the site and I am simply not aware of it?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Please give your answer a header that qoutes the number of lines in each language separately.&lt;/p&gt;&#xA;" OwnerUserId="81843" LastEditorUserId="81843" LastEditDate="2020-10-22T12:51:06.590" LastActivityDate="2020-10-22T12:51:06.590" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="20448" PostTypeId="2" ParentId="2140" CreationDate="2020-10-21T20:11:12.420" Score="3" Body="&lt;h1&gt;Can I print my picture on {A,B,C}{0-10} paper?&lt;/h1&gt;&#xA;&lt;p&gt;The task is to find the smallest paper size on which it is possible to print a picture of the dimensions given in milimetres. The image will be printed without margins.&lt;/p&gt;&#xA;&lt;h1&gt;Input:&lt;/h1&gt;&#xA;&lt;p&gt;Two numbers (bigger than zero) and a letter a, b, or c, for example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;290&#xA;200&#xA;A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Output:&lt;/h1&gt;&#xA;&lt;p&gt;Paper size, for example:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A4&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Another examples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;218,297,a      A3&#xA;1,1,c          C10&#xA;9999,9999,c    ??? (error)&#xA;74,52,A        A8&#xA;31,44,B        B10&#xA;26,1100,A       A0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Upper- and lowercase variants of letters &amp;quot;A&amp;quot;, &amp;quot;B&amp;quot; and &amp;quot;C&amp;quot; are&#xA;allowed on input and on output.&lt;/li&gt;&#xA;&lt;li&gt;The image can be printed vertically or horizontally.&lt;/li&gt;&#xA;&lt;li&gt;The values can be passed as a parameter or entered by the user.&lt;/li&gt;&#xA;&lt;li&gt;Width and height of picture will be always &amp;gt; 0, and letters will be always 'a', 'b', or 'c'. You don't need to validate them.&lt;/li&gt;&#xA;&lt;li&gt;You need to handle paper sizes A0 - A10, B0 - B10 and C0 - C10. If the image is too large, you can throw an exception, print an error or whatever you want, as long as it is clearly different from valid result and the application will not hung up.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Paper sizes, please ignore inch values (&lt;a href=&quot;https://en.wikipedia.org/wiki/Paper_size#Overview_of_ISO_paper_sizes&quot; rel=&quot;nofollow noreferrer&quot;&gt;source: Wikipedia&lt;/a&gt;) :&#xA;&lt;a href=&quot;https://i.stack.imgur.com/9eeCl.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/9eeCl.png&quot; alt=&quot;Paper sizes&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; - fewest bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="72804" LastEditorUserId="72804" LastEditDate="2020-10-24T21:59:23.443" LastActivityDate="2020-10-24T21:59:23.443" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20449" PostTypeId="2" ParentId="2140" CreationDate="2020-10-22T02:39:39.330" Score="2" Body="&lt;h1&gt;Round a Matrix&lt;/h1&gt;&#xA;&lt;p&gt;Your input is a 2d array of nonnegative floats &lt;code&gt;A&lt;/code&gt;. It can be supplied in whatever format is most acceptable for your language. It can have any dimensions.&lt;/p&gt;&#xA;&lt;p&gt;Let &lt;code&gt;r&lt;/code&gt; and &lt;code&gt;c&lt;/code&gt; be the 1d arrays of row and column sums of &lt;code&gt;A&lt;/code&gt; respectively, rounded to the nearest integer, with the rule that &lt;code&gt;0.5&lt;/code&gt; is rounded up to &lt;code&gt;1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to output a 2d array of nonnegative integers &lt;code&gt;B&lt;/code&gt; such that &lt;code&gt;|b_{ij} - a_{ij}| &amp;lt; 1&lt;/code&gt; for all &lt;code&gt;i&lt;/code&gt; and &lt;code&gt;j&lt;/code&gt;, and also the row and column sums of &lt;code&gt;B&lt;/code&gt; are equal to &lt;code&gt;r&lt;/code&gt; and &lt;code&gt;c&lt;/code&gt; respectively.&lt;/p&gt;&#xA;&lt;p&gt;In other words, &lt;code&gt;B&lt;/code&gt; is obtained by rounding each element of &lt;code&gt;A&lt;/code&gt; up or down, in such a way that the row and column sums are preserved.&lt;/p&gt;&#xA;&lt;p&gt;There may be many possible solutions. In this case, you only need to output one of them.&lt;/p&gt;&#xA;&lt;p&gt;If there is no solution, your program's behaviour can be undefined.&lt;/p&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; A = 1.2 3.4 2.4&#xA;     3.9 4.0 2.1&#xA;     7.9 1.6 0.6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;in this case, the row sums are &lt;code&gt;[7.0, 10.0, 10.1]&lt;/code&gt; and the column sums are &lt;code&gt;[13.0, 9.0, 5.1]&lt;/code&gt; so after rounding these, you get &lt;code&gt;r = [7 10 10]&lt;/code&gt; and &lt;code&gt;c = [13 9 5]&lt;/code&gt;. One acceptable solution is&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; B = 1   3   3&#xA;     4   4   2&#xA;     8   2   0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is code golf, so the shortest code wins.&lt;/p&gt;&#xA;&lt;h2&gt;Motivation&lt;/h2&gt;&#xA;&lt;p&gt;I am also interested in what clever algorithms people can come up with. I guess the most obvious is just to do a random search, but that can take a very long time, even if the array is only 10x10 or so.&lt;/p&gt;&#xA;&lt;h2&gt;Questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is it clear? Please can you edit it if it's not in the right format?&lt;/li&gt;&#xA;&lt;li&gt;Has it appeared here before? (I don't think so, because I was searching Stackoverflow for a while in order to come up with a solution to this.)&lt;/li&gt;&#xA;&lt;li&gt;Is there always a solution under the conditions given here?&lt;/li&gt;&#xA;&lt;li&gt;Would it be better in some other format than code golf?&lt;/li&gt;&#xA;&lt;li&gt;Should the condition &lt;code&gt;|b_{ij} - a_{ij}| &amp;lt; 1&lt;/code&gt; be &lt;code&gt;|b_{ij} - a_{ij}| &amp;lt;= 1&lt;/code&gt;?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="26905" LastEditorUserId="26905" LastEditDate="2020-10-23T02:32:13.267" LastActivityDate="2020-10-23T02:32:13.267" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20450" PostTypeId="2" ParentId="2140" CreationDate="2020-10-23T02:14:42.850" Score="6" Body="&lt;h1&gt;Almost Illegal Strings&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/214705/48931&quot;&gt;Posted.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="48931" LastEditorUserId="48931" LastEditDate="2020-11-06T01:10:55.293" LastActivityDate="2020-11-06T01:10:55.293" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="20453" PostTypeId="2" ParentId="2140" CreationDate="2020-10-25T21:13:46.393" Score="-1" Body="&lt;h1&gt;Am I A Perfect Two Integer?&lt;/h1&gt;&#xA;&lt;p&gt;A “perfect two integer” is an integer that works as x in the following equations:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Let i = integer, j = integer, x = perfect two integer:&#xA;2^i = x&#xA;j^2 = x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Example “perfect two integers”:&#xA;&lt;code&gt;4&lt;/code&gt;, &lt;code&gt;16&lt;/code&gt;, &lt;code&gt;64&lt;/code&gt;, &lt;code&gt;256&lt;/code&gt;, &lt;code&gt;1024&lt;/code&gt; (see a pattern here?)&lt;/p&gt;&#xA;&lt;p&gt;Your answer should take a number from stdin or an argument. This should be relatively easy, but this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer wins. (Note: there are ways to simplify these equations that aren’t listed here).&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Sandbox Questions:&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Is this too easy?&lt;/li&gt;&#xA;&lt;li&gt;Any other thoughts?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="98932" LastActivityDate="2020-10-25T21:13:46.393" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20455" PostTypeId="2" ParentId="2140" CreationDate="2020-10-26T11:57:46.917" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/214423&quot;&gt;The Fibonacci Rectangular Prism Sequence (posted)&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="98932" LastEditorUserId="98932" LastEditDate="2020-10-30T12:04:13.403" LastActivityDate="2020-10-30T12:04:13.403" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="20456" PostTypeId="2" ParentId="2140" CreationDate="2020-10-27T22:57:57.140" Score="1" Body="&lt;h1&gt;Is It A Rainbow Color&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/214678/is-it-a-rainbow-color&quot;&gt;Posted in main&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="97730" LastEditorUserId="97730" LastEditDate="2020-11-03T21:29:00.500" LastActivityDate="2020-11-03T21:29:00.500" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="20457" PostTypeId="2" ParentId="2140" CreationDate="2020-10-29T10:09:32.823" Score="0" Body="&lt;h1&gt;AOG Day 6: Filtering the Playlist&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;I promise the next one will be better&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;You've sent the invitations for the party (and made the postperson do a whole lot more work than they should have, smh), made the decorations as interesting as possible (who doesn't love a painstakingly written quine) and made sure that the event won't kill anyone (at least, not due to COVID). The next thing that needs to be planned is the music.&lt;/p&gt;&#xA;&lt;p&gt;Now, of course, you could go ahead and create a YouTube playlist by hand, but that's way too tedious and, well, predictable. Instead, you've decided to write a program that randomly chooses songs from the music genre (I know...very efficient isn't it).&lt;/p&gt;&#xA;&lt;p&gt;But of course, there's just one problem with that plan: there's a very small chance that a song selected at random might just &lt;a href=&quot;https://www.youtube.com/watch?v=dQw4w9WgXcQ&quot; rel=&quot;nofollow noreferrer&quot;&gt;ruin the party vibes for everyone&lt;/a&gt; (even though people such as myself would consider it a Christmas miracle, others would probably see it as a lame stunt and potentially leave the party).&lt;/p&gt;&#xA;&lt;p&gt;Thankfully, the magic of code allows us to check the html of the YouTube video before hand to tell if it is indeed a rickroll.&lt;/p&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a YouTube link as input (not shortened, but a full standard link), retrieve the title and description of the video and output whether or not it is a rickroll. In order for a video to be considered a rickroll, it must have either the unbroken phrase &lt;code&gt;Never Gonna Give You Up&lt;/code&gt; or &lt;code&gt;Rickroll&lt;/code&gt; in the title or description.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;Under construction&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2020-10-29T10:09:32.823" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20458" PostTypeId="2" ParentId="19329" CreationDate="2020-10-29T13:58:15.593" Score="8" Body="&lt;p&gt;There appears to be more than one issue here. While I've fixed this part, something is still preventing low-rep users from posting both here and on Worldbuilding. I'll see if we can get that figured out and report back.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;So... funny story. I don't think this ever worked.&lt;/p&gt;&#xA;&lt;p&gt;We have site settings to change this and when I checked, the site settings were correct... 1 rep to participate on meta.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Rkwrq.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Rkwrq.png&quot; alt=&quot;Screenshot of site settings to let people post on Meta&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Buuuuuuut... you have to change the site settings for Meta... separately. When I checked Meta's settings... it was set at 5. So... blocked.&lt;/p&gt;&#xA;&lt;p&gt;The history doesn't show that this was changed recently so it's possible that it's not ever actually worked.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/vuhJV.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/vuhJV.png&quot; alt=&quot;Screenshot of the history for the participate in meta reputation required change history that shows it changed on October 4th of 2015 for Main but not until &amp;quot;4 minutes ago&amp;quot; for meta&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The Meta one having been changed back in 2015 would have controlled the privileges page, which is why it &lt;em&gt;looks&lt;/em&gt; like you can participate in meta... but the meta setting is what actually allows low-rep users to post on meta.&lt;/p&gt;&#xA;&lt;p&gt;Give it another go and let me know if you have any issues in the future.&lt;/p&gt;&#xA;" OwnerUserId="78028" LastEditorUserId="78028" LastEditDate="2020-10-29T14:08:41.373" LastActivityDate="2020-10-29T14:08:41.373" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="20462" PostTypeId="2" ParentId="2140" CreationDate="2020-10-31T06:50:08.017" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/215883/66833&quot;&gt;Quickly! Group together!&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2020-12-02T00:01:27.430" LastActivityDate="2020-12-02T00:01:27.430" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20466" PostTypeId="1" CreationDate="2020-11-01T23:22:40.723" Score="10" ViewCount="494" Body="&lt;p&gt;In accordance with our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19271/16766&quot;&gt;meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout November 2020, our Language of the Month, nominated by user96495 and supported by me (Bubbler), will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://www.gnu.org/software/gforth/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Forth&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;What's a Language of the Month?&lt;/h3&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/16766&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during November, those who wish to participate should learn (at least the basics of) Forth, use it to solve challenges, and discuss it in the &lt;a href=&quot;https://chat.stackexchange.com/rooms/115720/forth&quot;&gt;Forth chat room&lt;/a&gt;. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h3&gt;Information about Forth&lt;/h3&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Forth_(programming_language)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Forth&lt;/a&gt; is one of the earliest stack-based practical programming languages (it's turning 50 this year), yet at least one modern implementation (namely &lt;a href=&quot;https://www.gnu.org/software/gforth/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Gforth&lt;/a&gt;) is still being actively maintained.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Forth's very simple syntax will let you get started quickly.&lt;/li&gt;&#xA;&lt;li&gt;Forth supports functions and structured programming. This has multiple implications:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We can use stack content I/O for functions.&lt;/li&gt;&#xA;&lt;li&gt;We can write test cases for a submission more easily.&lt;/li&gt;&#xA;&lt;li&gt;We can construct more complex programs without much hassle.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Due to the low-level-ish way Forth treats its stack contents, we can use various built-in words to achieve something they're not designed to do. e.g. &lt;code&gt;s&amp;gt;d&lt;/code&gt; can be used for a non-negativity test, and &amp;quot;double&amp;quot; stack-manipulation words can be used to fetch or move around pairs of integers. Be creative, and please share any interesting uses of built-ins you find &lt;a href=&quot;https://codegolf.stackexchange.com/q/68446/78410&quot;&gt;as a golfing tip&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Resources&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Forth_(programming_language)&quot; rel=&quot;nofollow noreferrer&quot;&gt;General information about Forth the language&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.gnu.org/software/gforth/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Gforth home page&lt;/a&gt; and &lt;a href=&quot;https://www.complang.tuwien.ac.at/forth/gforth/Docs-html/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Gforth user manual&lt;/a&gt; (&lt;a href=&quot;https://gforth.org/manual/&quot; rel=&quot;nofollow noreferrer&quot;&gt;another site hosting the same materials&lt;/a&gt;)&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.complang.tuwien.ac.at/forth/gforth/Docs-html/Tutorial.html#Tutorial&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tutorial&lt;/a&gt;, &lt;a href=&quot;https://www.complang.tuwien.ac.at/forth/gforth/Docs-html/Words.html#Words&quot; rel=&quot;nofollow noreferrer&quot;&gt;Built-in reference&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#forth-gforth&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;, &lt;a href=&quot;https://chat.stackexchange.com/rooms/115720/forth&quot;&gt;Chat room&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/q/68446/78410&quot;&gt;Golfing tips&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Bounty&lt;/h3&gt;&#xA;&lt;p&gt;To facilitate more participation, I will award 50-rep bounties to &lt;strong&gt;first 5 answers&lt;/strong&gt; in Forth by each user who hasn't used Forth before. (Sorry that I can't award this bounty to a question that already has my answer.)&lt;/p&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="68942" LastEditDate="2020-12-04T04:50:47.397" LastActivityDate="2020-12-04T04:50:47.397" Title="Language of the month for November 2020: Forth" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20467" PostTypeId="2" ParentId="20466" CreationDate="2020-11-01T23:26:34.770" Score="4" Body="&lt;h1&gt;List of all Forth solutions posted in November 2020&lt;/h1&gt;&#xA;&lt;p&gt;(First time posters highlighted in bold)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/214556/78410&quot;&gt;Sum the First n Even Fibonacci Numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/214558/78410&quot;&gt;Print invisible text&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/58615/1-2-fizz-4-buzz/214636#214636&quot;&gt;1, 2, Fizz, 4, Buzz&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;Lyxal&lt;/a&gt;&lt;/strong&gt; (+50)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/214644/78410&quot;&gt;Shortest infinite loop producing no output&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/214748/78410&quot;&gt;Mixed number to an improper fraction&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/214749/78410&quot;&gt;Prime power switch&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/214826&quot;&gt;Output programming language name&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/85334&quot;&gt;Unrelated String&lt;/a&gt;&lt;/strong&gt; (+50)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/214828&quot;&gt;Scream very loudly&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/85334&quot;&gt;Unrelated String&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/214905/80214&quot;&gt;Pascal's Triangle&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt; (+50)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/214907/80214&quot;&gt;Draw an ASCII-art rainbow&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt; (+50)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/214908/80214&quot;&gt;Pointers, pointers, pointers!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt; (+50)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/214912/80214&quot;&gt;The squiggly sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt; (+50)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/214961/80214&quot;&gt;Display the exponent from a binary floating point number as a decimal value&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt; (+50)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/214968/80214&quot;&gt;A very long Terza Rima&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/214973/80214&quot;&gt;Collatz Conjecture (OEIS A006577)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/47657/print-number-triangle/?lastactivity&quot;&gt;Print number triangle&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/215030/78410&quot;&gt;Compute the Lambert W function&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/215040/78410&quot;&gt;Knight on the Rim is Grim&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/215044/78410&quot;&gt;Find the tangent of the sum of inverse tangents&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/215050/78410&quot;&gt;Rectangles in rectangles&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/215115/80214&quot;&gt;Is it Christmas yet?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/215153/78410&quot;&gt;I uppercase the source code, you reverse the input!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/215167/78410&quot;&gt;Count the Collatz survivors mod 2^n&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/50798/is-it-a-leap-year/215169#215169&quot;&gt;Is it a leap year?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/215340/78410&quot;&gt;Euler's Geometry Puzzle&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/215649/80214&quot;&gt;Multiply or Divide by n&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; [&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr&gt;&#xA;&lt;h1&gt;List of all Forth tips posted in November 2020&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;tip title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;List of Forth-related challenges posted in November 2020&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/q/&amp;lt;question-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="80214" LastEditDate="2020-11-26T03:54:53.823" LastActivityDate="2020-11-26T03:54:53.823" CommentCount="0" CommunityOwnedDate="2020-11-01T23:26:34.770" ContentLicense="CC BY-SA 4.0" />
  <row Id="20468" PostTypeId="2" ParentId="2140" CreationDate="2020-11-02T19:12:16.423" Score="0" Body="&lt;h1&gt;English Stroke Count Alphabet&lt;/h1&gt;&#xA;&lt;p&gt;In a Chinese glossary/index for any given book, to find terms that are contained within the book and because Chinese doesn't have an alphabet like in English, they are sorted by stroke count instead. &lt;code&gt;(一畫 = 1 stroke，二畫 = 2 strokes，三畫 = 3 strokes，四畫 = 4 strokes，and so on)&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;An English glossary, having an alphabet, is naturally sorted alphabetically. For this challenge, we flip that idea to the Chinese manner. And we'll follow some Chinese writing rules to help determine stroke order for the alphabet below.&lt;/p&gt;&#xA;&lt;p&gt;Take 口 (kou) for example, a simple square. You'd think it is 4 strokes, but it is actually 3. The 1st being the left vertical line, the 2nd being the top horizontal and right vertical in one fluid stroke, and the 3rd being the lower horizontal line. This pattern, among others, holds relatively true across Chinese characters. For sake of simplicity though, and for some diversity in the English Stroke Count Alphabet, this will be the primary pattern used.&lt;/p&gt;&#xA;&lt;p&gt;First, I need to define stroke count for each letter. For sake of simplicity, and somewhat &lt;em&gt;subjectively&lt;/em&gt;, I'll use the characters as they appear below. If there are any arguments why a letter should have a different stroke count, please make your case, but in order to promote diversity in stroke counts, I made some personal judgment calls. These stroke counts could easily change with different fonts.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;A B C D E F G H I J K L M N O P Q R S T U V W X Y Z&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;3 3 1 2 4 3 2 3 3 1 3 2 4 3 1 2 2 3 1 2 1 2 4 2 3 3&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;a b c d e f g h i j k l m n o p q r s t u v w x y z&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;2 2 1 2 2 2 2 2 3 2 3 2 3 2 1 2 2 2 1 2 2 2 4 2 2 3&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Letters with equal stroke counts should retain the original alphabetic order as before. So the English Stroke Order Alphabet is as follows. (If I made an error, please say as much, there are a lot of examples that I might have to adjust)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;C J O S U D G L P Q T V X A B F H I K N R Y Z E M W&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;c o s a b d e f g h j l n p q r t u v x y i k m z w&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;The Challenge&lt;/strong&gt; Given a non-empty string input containing a sentence/series of words, or a list of words, organize all words according to this new English Stroke Count alphabet. Output can be either a string, or a list of properly words is a single string of properly organized words, including duplicates should they exist.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note 1:&lt;/strong&gt; If upper and lowercase for the same letter have the same stroke count, uppercase letters take precedence.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&amp;quot;Cousin&amp;quot; precedes &amp;quot;cousin&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;father&amp;quot; precedes &amp;quot;Father&amp;quot; (because lowercase f is 2 strokes, while the uppercase is 3)&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Stop&amp;quot; precedes &amp;quot;soap&amp;quot; (while the o would precede t in stroke count, uppercase S precedes lowercase s)&lt;/li&gt;&#xA;&lt;li&gt;KO precedes kO  (K precedes k)&lt;/li&gt;&#xA;&lt;li&gt;kO precedes ko  (O precedes o)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note 2:&lt;/strong&gt; I've intentionally avoided weird words in input. Inputs such as &amp;quot;WeIrD&amp;quot;, &amp;quot;COVID-19&amp;quot;. Input will never include any numbers, punctuation, or special characters.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input / Output&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;quot;It was the best of times it was the worst of tImes&amp;quot; / &amp;quot;of of best the the tImes times It it worst was was&amp;quot;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;[&amp;quot;When&amp;quot;, &amp;quot;life&amp;quot;, &amp;quot;gives&amp;quot;, &amp;quot;you&amp;quot;, &amp;quot;lemons&amp;quot;, &amp;quot;make&amp;quot;, &amp;quot;Lemonade&amp;quot;] / [&amp;quot;gives&amp;quot;, &amp;quot;Lemonade&amp;quot;, &amp;quot;lemons&amp;quot;, &amp;quot;life&amp;quot;, &amp;quot;you&amp;quot;, &amp;quot;When&amp;quot;, &amp;quot;make&amp;quot;]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;[The, journey, of, a, thousand, miles, begins, with, one, step,] / [of, one, step, The, a, begins, journey, thousand, miles, with]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;quot;English Stroke Count Alphabet&amp;quot; / &amp;quot;Count Stroke Alphabet English&amp;quot;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;quot;A man a plan a canal panama&amp;quot; / &amp;quot;canal a a panama plan A man&amp;quot;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;quot;Carry on my wayward son&amp;quot; / &amp;quot;Carry on son my wayward&amp;quot;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;quot;Close our store and begin destroying every flower green house just lose no people quietly rather than using vexing xrays yesterday it killed my zoo wombat&amp;quot; / Same as input&lt;/code&gt; (If you can write a better sentence than above, I'd be much appreciated.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;[&amp;quot;May&amp;quot;, &amp;quot;the&amp;quot;, &amp;quot;Force&amp;quot;, &amp;quot;be&amp;quot;, &amp;quot;with&amp;quot;, &amp;quot;you&amp;quot;] / [&amp;quot;be&amp;quot;, &amp;quot;the&amp;quot;, &amp;quot;you&amp;quot;, &amp;quot;Force&amp;quot;, &amp;quot;May&amp;quot;, &amp;quot;with&amp;quot;]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;[Im, going, to, make, him, an, offer, he, cant, refuse] / [cant, offer, an, going, he, him, refuse, to, Im, make]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;quot;jello Jello JellO JEllo JELlo JELlO JELLO&amp;quot; / &amp;quot;JellO Jello JELLO JELlO JELlo JEllo jello&amp;quot;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;quot;We suffer more often In imagination than IN reality&amp;quot; / &amp;quot;often suffer reality than In IN imagination more We&amp;quot;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;quot;Code Golf and Coding Challenges&amp;quot; / &amp;quot;Code Coding Challenges Golf and&amp;quot;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;[&amp;quot;Do&amp;quot;, &amp;quot;or&amp;quot;, &amp;quot;DO&amp;quot;, &amp;quot;not&amp;quot;, &amp;quot;there&amp;quot;, &amp;quot;is&amp;quot;, &amp;quot;no&amp;quot;, &amp;quot;try&amp;quot;] / [&amp;quot;or&amp;quot;, &amp;quot;DO&amp;quot;, &amp;quot;Do&amp;quot;, &amp;quot;no&amp;quot;, &amp;quot;not&amp;quot;, &amp;quot;there&amp;quot;, &amp;quot;try&amp;quot;, &amp;quot;is&amp;quot;]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;quot;Failure the best teacher is&amp;quot; / &amp;quot;best teacher the Failure is&amp;quot;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;quot;Can you tell that I am a Star Wars fan&amp;quot; / &amp;quot;Can Star a am fan tell that you I Wars&amp;quot;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;[enough examples no more words] / [enough examples no more words]&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="82163" LastEditorUserId="82163" LastEditDate="2020-11-03T21:15:02.780" LastActivityDate="2020-11-03T21:15:02.780" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="20469" PostTypeId="2" ParentId="2140" CreationDate="2020-11-03T20:11:11.217" Score="2" Body="&lt;h1&gt;I only want some primes, not all of them&lt;/h1&gt;&#xA;&lt;p&gt;It is well known that there are various &lt;a href=&quot;https://en.wikipedia.org/wiki/Formula_for_primes&quot; rel=&quot;nofollow noreferrer&quot;&gt;formulae for calculating primes&lt;/a&gt; that span from calculating a subset of primes, to all possible primes. However, for this challenge, I only want a specific subset.&lt;/p&gt;&#xA;&lt;p&gt;You are to write a program which takes a single natural integer &lt;span class=&quot;math-container&quot;&gt;\$n&amp;gt;0\$&lt;/span&gt; as input. This program will then output a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13706/66833&quot;&gt;function&lt;/a&gt;, &lt;span class=&quot;math-container&quot;&gt;\$f(p)\$&lt;/span&gt;, which will take a integer &lt;span class=&quot;math-container&quot;&gt;\$p\ge0\$&lt;/span&gt; and do the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;span class=&quot;math-container&quot;&gt;\$p &amp;lt; n\$&lt;/span&gt;, return the &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt;th value of a contiguous subset length &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; of primes&lt;/li&gt;&#xA;&lt;li&gt;If &lt;span class=&quot;math-container&quot;&gt;\$p \ge n\$&lt;/span&gt;, returns a non-prime integer (including &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; and negative integers).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For example, Euler's quadratic &lt;span class=&quot;math-container&quot;&gt;\$p^2+p+41\$&lt;/span&gt; returns the &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt;th value of the subset of primes &lt;span class=&quot;math-container&quot;&gt;\$\{41, 43, 47, ..., 1601\}\$&lt;/span&gt; for &lt;span class=&quot;math-container&quot;&gt;\$0 \le p \le 39\$&lt;/span&gt;. However, for &lt;span class=&quot;math-container&quot;&gt;\$p=43\$&lt;/span&gt;, this returns &lt;span class=&quot;math-container&quot;&gt;\$1933\$&lt;/span&gt;, which is prime, so this would not be a valid function to return for &lt;span class=&quot;math-container&quot;&gt;\$n = 40\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You may choose the subset (and it may differ for different &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;), so long as it is finite and contiguous. You may also choose to use 1-indexing for &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt;, meaning that &lt;span class=&quot;math-container&quot;&gt;\$f(p)\$&lt;/span&gt; returns primes for &lt;span class=&quot;math-container&quot;&gt;\$1 \le p \le n\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You may output in the most natural form of a function in your language. For example, Jelly would return a string representing a link, Python would return a named function or lambda etc.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Thoughts and feedback?&lt;/li&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Tags are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/functional-programming&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;functional-programming&amp;#39;&quot; rel=&quot;tag&quot;&gt;functional-programming&lt;/a&gt;. Any others?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2020-11-03T20:30:11.260" LastActivityDate="2020-11-03T20:30:11.260" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20471" PostTypeId="2" ParentId="2140" CreationDate="2020-11-03T22:02:50.880" Score="0" Body="&lt;h1&gt;Make a die of given number of faces&lt;/h1&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Given an integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; greater than 3, identify an &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-sided die with the &amp;quot;greatest&amp;quot; symmetry, then decompose &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; to numbers of faces grouped up to the symmetry, and then output the decomposition.&lt;/p&gt;&#xA;&lt;h2&gt;Symmetry&lt;/h2&gt;&#xA;&lt;p&gt;A die can have one of the following symmetries, from the greatest and with descending order:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$I_h\$&lt;/span&gt;, &lt;strong&gt;icosahedral&lt;/strong&gt; symmetry&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$O_h\$&lt;/span&gt;, &lt;strong&gt;octahedral&lt;/strong&gt; symmetry&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$T_d\$&lt;/span&gt;, &lt;strong&gt;tetrahedral&lt;/strong&gt; symmetry&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$D_{ph}\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt;-fold &lt;strong&gt;prismatic&lt;/strong&gt; symmetry, in ascending order on &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt; is an odd prime number&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Note that every other symmetry is redundant.&lt;/p&gt;&#xA;&lt;h2&gt;Faces&lt;/h2&gt;&#xA;&lt;p&gt;A die of each symmetry can have the following faces:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;For a die of symmetry &lt;span class=&quot;math-container&quot;&gt;\$I_h\$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Optionally &lt;span class=&quot;math-container&quot;&gt;\$12\$&lt;/span&gt; faces, those from a &lt;a href=&quot;https://en.wikipedia.org/wiki/Dodecahedron&quot; rel=&quot;nofollow noreferrer&quot;&gt;dodecahedron&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Optionally &lt;span class=&quot;math-container&quot;&gt;\$20\$&lt;/span&gt; faces, those from an &lt;a href=&quot;https://en.wikipedia.org/wiki/Icosahedron&quot; rel=&quot;nofollow noreferrer&quot;&gt;icosahedron&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Optionally &lt;span class=&quot;math-container&quot;&gt;\$30\$&lt;/span&gt; faces, those from a &lt;a href=&quot;https://en.wikipedia.org/wiki/Rhombic_triacontahedron&quot; rel=&quot;nofollow noreferrer&quot;&gt;rhombic triacontahedron&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Optionally &lt;span class=&quot;math-container&quot;&gt;\$60\$&lt;/span&gt; faces, those from a &lt;a href=&quot;https://en.wikipedia.org/wiki/Deltoidal_hexecontahedron&quot; rel=&quot;nofollow noreferrer&quot;&gt;deltoidal hexecontahedron&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Zero or more sets of &lt;span class=&quot;math-container&quot;&gt;\$120\$&lt;/span&gt; faces, those from a &lt;a href=&quot;https://en.wikipedia.org/wiki/Disdyakis_triacontahedron&quot; rel=&quot;nofollow noreferrer&quot;&gt;disdyakis triacontahedron&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For a die of symmetry &lt;span class=&quot;math-container&quot;&gt;\$O_h\$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Optionally &lt;span class=&quot;math-container&quot;&gt;\$6\$&lt;/span&gt; faces, those from a &lt;a href=&quot;https://en.wikipedia.org/wiki/Cube&quot; rel=&quot;nofollow noreferrer&quot;&gt;cube&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Optionally &lt;span class=&quot;math-container&quot;&gt;\$8\$&lt;/span&gt; faces, those from an &lt;a href=&quot;https://en.wikipedia.org/wiki/Octahedron&quot; rel=&quot;nofollow noreferrer&quot;&gt;octahedron&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Optionally &lt;span class=&quot;math-container&quot;&gt;\$12\$&lt;/span&gt; faces, those from a &lt;a href=&quot;https://en.wikipedia.org/wiki/Rhombic_dodecahedron&quot; rel=&quot;nofollow noreferrer&quot;&gt;rhombic dodecahedron&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Optionally &lt;span class=&quot;math-container&quot;&gt;\$24\$&lt;/span&gt; faces, those from a &lt;a href=&quot;https://en.wikipedia.org/wiki/Deltoidal_icositetrahedron&quot; rel=&quot;nofollow noreferrer&quot;&gt;deltoidal icositetrahedron&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Zero or more sets of &lt;span class=&quot;math-container&quot;&gt;\$48\$&lt;/span&gt; faces, those from a &lt;a href=&quot;https://en.wikipedia.org/wiki/Disdyakis_dodecahedron&quot; rel=&quot;nofollow noreferrer&quot;&gt;disdyakis dodecahedron&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For a die of symmetry &lt;span class=&quot;math-container&quot;&gt;\$T_d\$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Optionally &lt;span class=&quot;math-container&quot;&gt;\$4\$&lt;/span&gt; faces, those from a &lt;a href=&quot;https://en.wikipedia.org/wiki/Tetrahedron&quot; rel=&quot;nofollow noreferrer&quot;&gt;tetrahedron&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Optionally &lt;span class=&quot;math-container&quot;&gt;\$6\$&lt;/span&gt; faces, those from a cube&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Optionally &lt;span class=&quot;math-container&quot;&gt;\$12\$&lt;/span&gt; faces, those from a &lt;a href=&quot;https://en.wikipedia.org/wiki/Triakis_tetrahedron&quot; rel=&quot;nofollow noreferrer&quot;&gt;triakis tetrahedron&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Zero or more sets of &lt;span class=&quot;math-container&quot;&gt;\$24\$&lt;/span&gt; faces, those from a &lt;a href=&quot;https://en.wikipedia.org/wiki/Tetrakis_hexahedron&quot; rel=&quot;nofollow noreferrer&quot;&gt;tetrakis hexahedron&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For a die of symmetry &lt;span class=&quot;math-container&quot;&gt;\$D_{ph}\$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Optionally &lt;span class=&quot;math-container&quot;&gt;\$2\$&lt;/span&gt; faces, those from base faces of a &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt;-gonal prism&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Optionally &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt; faces, those from side faces of a &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt;-gonal prism&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Optionally &lt;span class=&quot;math-container&quot;&gt;\$2p\$&lt;/span&gt; faces, those from a &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt;-gonal &lt;a href=&quot;https://en.wikipedia.org/wiki/Bipyramid&quot; rel=&quot;nofollow noreferrer&quot;&gt;bipyramid&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Zero of more sets &lt;span class=&quot;math-container&quot;&gt;\$4p\$&lt;/span&gt; faces, those from a &lt;span class=&quot;math-container&quot;&gt;\$2p\$&lt;/span&gt;-gonal bipyramid&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Note that faces from the &lt;a href=&quot;https://en.wikipedia.org/wiki/Catalan_solid&quot; rel=&quot;nofollow noreferrer&quot;&gt;Catalan solids&lt;/a&gt; that are not mentioned here are redundant.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The input and output format doesn't matter. Possible choices of output format include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A list, sorted or unsorted&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A multiset&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Invalid inputs fall in &lt;em&gt;don't care&lt;/em&gt; situation. Especially, integers that are 3 or less.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;For &lt;span class=&quot;math-container&quot;&gt;\$n=4\$&lt;/span&gt;, the die has &lt;span class=&quot;math-container&quot;&gt;\$T_d\$&lt;/span&gt; symmetry, so &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; decomposes to &lt;span class=&quot;math-container&quot;&gt;\$(4)\$&lt;/span&gt;, with the die being a tetrahedron.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For &lt;span class=&quot;math-container&quot;&gt;\$n=5\$&lt;/span&gt;, the die has &lt;span class=&quot;math-container&quot;&gt;\$D_{3h}\$&lt;/span&gt; symmetry, so &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; decomposes to &lt;span class=&quot;math-container&quot;&gt;\$(2,3)\$&lt;/span&gt;, with the die being a triangular prism.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For &lt;span class=&quot;math-container&quot;&gt;\$n=6\$&lt;/span&gt;, the die has &lt;span class=&quot;math-container&quot;&gt;\$O_h\$&lt;/span&gt; symmetry, so &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; decomposes to &lt;span class=&quot;math-container&quot;&gt;\$(6)\$&lt;/span&gt;, with the die being a cube.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For &lt;span class=&quot;math-container&quot;&gt;\$n=7\$&lt;/span&gt;, the die has &lt;span class=&quot;math-container&quot;&gt;\$D_{5h}\$&lt;/span&gt; symmetry, so &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; decomposes to &lt;span class=&quot;math-container&quot;&gt;\$(2,5)\$&lt;/span&gt;, with the die being a pentagonal prism.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For &lt;span class=&quot;math-container&quot;&gt;\$n=8\$&lt;/span&gt;, the die has &lt;span class=&quot;math-container&quot;&gt;\$O_h\$&lt;/span&gt; symmetry, so &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; decomposes to &lt;span class=&quot;math-container&quot;&gt;\$(8)\$&lt;/span&gt;, with the die being an octahedron.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For &lt;span class=&quot;math-container&quot;&gt;\$n=9\$&lt;/span&gt;, the die has &lt;span class=&quot;math-container&quot;&gt;\$D_{3h}\$&lt;/span&gt; symmetry, so &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; decomposes to &lt;span class=&quot;math-container&quot;&gt;\$(3,6)\$&lt;/span&gt;, with the die being a truncated triangular bipyramid. Note that the die won't have &lt;span class=&quot;math-container&quot;&gt;\$D_{7h}\$&lt;/span&gt; symmetry because &lt;span class=&quot;math-container&quot;&gt;\$D_{3h}\$&lt;/span&gt; is greater.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For &lt;span class=&quot;math-container&quot;&gt;\$n=10\$&lt;/span&gt;, the die has &lt;span class=&quot;math-container&quot;&gt;\$T_d\$&lt;/span&gt; symmetry, so &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; decomposes to &lt;span class=&quot;math-container&quot;&gt;\$(4,6)\$&lt;/span&gt;, with the die being a chamfered tetrahedron. Note that this is different than the usual d10, which is a pentagonal trapezohedron.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For &lt;span class=&quot;math-container&quot;&gt;\$n=11\$&lt;/span&gt;, the die has &lt;span class=&quot;math-container&quot;&gt;\$D_{3h}\$&lt;/span&gt; symmetry, so &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; decomposes to &lt;span class=&quot;math-container&quot;&gt;\$(2,3,6)\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For &lt;span class=&quot;math-container&quot;&gt;\$n=12\$&lt;/span&gt;, the die has &lt;span class=&quot;math-container&quot;&gt;\$I_h\$&lt;/span&gt; symmetry, so &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; decomposes to &lt;span class=&quot;math-container&quot;&gt;\$(12)\$&lt;/span&gt;, with the die being a dodecahedron. Note that due to the greater symmetry, dodecahedron supersedes rhombic dodecahedron and triakis tetrahedron.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For &lt;span class=&quot;math-container&quot;&gt;\$n=100\$&lt;/span&gt;, the die has &lt;span class=&quot;math-container&quot;&gt;\$T_d\$&lt;/span&gt; symmetry, so &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; decomposes to &lt;span class=&quot;math-container&quot;&gt;\$(4,24,24,24,24)\$&lt;/span&gt;. Note that this is different than usual Zocchihedron, which has prismatic symmtery.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Note that, if &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$p+2\$&lt;/span&gt; are twin primes, &lt;span class=&quot;math-container&quot;&gt;\$p+2\$&lt;/span&gt; will always decompose to &lt;span class=&quot;math-container&quot;&gt;\$(2,p)\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Ungolfed solution&lt;/h2&gt;&#xA;&lt;h3&gt;Haskell&lt;/h3&gt;&#xA;&lt;p&gt;This implementation mimics the &lt;code&gt;ReadP&lt;/code&gt; parser.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;import Control.Monad&#xA;&#xA;type DResult = [([Int], Int)]&#xA;type DParser = DResult -&amp;gt; DResult&#xA;&#xA;returnD :: Int -&amp;gt; DResult&#xA;returnD n = [([],n)]&#xA;&#xA;pfail :: DParser&#xA;pfail _ = []&#xA;&#xA;get :: Int -&amp;gt; DParser&#xA;get m results = do&#xA;    (ns, n) &amp;lt;- results&#xA;    guard (m &amp;lt;= n)&#xA;    return (m:ns, n - m)&#xA;&#xA;many :: DParser -&amp;gt; DParser&#xA;many p results = let&#xA;    results2 = p results&#xA;    in case results2 of&#xA;        [] -&amp;gt; results&#xA;        _  -&amp;gt; results ++ many p results2&#xA;&#xA;optional :: DParser -&amp;gt; DParser&#xA;optional p results = p results ++ results&#xA;&#xA;run :: DParser&#xA;run = filter ((0==) . snd)&#xA;&#xA;(&amp;lt;++) :: DParser -&amp;gt; DParser -&amp;gt; DParser&#xA;(&amp;lt;++) p q results = case p results of&#xA;    [] -&amp;gt; q results&#xA;    results2 -&amp;gt; results2&#xA;&#xA;decomposeDph :: Int -&amp;gt; DParser&#xA;decomposeDph prismFold = run . optional (get 2) . optional (get prismFold) . optional (get (2*prismFold)) . many (get (4*prismFold))&#xA;&#xA;decomposeTd :: DParser&#xA;decomposeTd = run . optional (get 4) . optional (get 6) . optional (get 12) . many (get 24)&#xA;&#xA;decomposeOh :: DParser&#xA;decomposeOh = run . optional (get 6) . optional (get 8) . optional (get 12) . optional (get 24) . many (get 48)&#xA;&#xA;decomposeIh :: DParser&#xA;decomposeIh = run . optional (get 12) . optional (get 20) . optional (get 30) . optional (get 60) . many (get 120)&#xA;&#xA;decomposeDie :: Int -&amp;gt; [Int]&#xA;decomposeDie n = fst . head $ foldr (&amp;lt;++) pfail (decomposeIh : decomposeOh : decomposeTd : map decomposeDph [3,5..]) (returnD n)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2020-11-05T21:28:44.623" LastActivityDate="2020-11-05T21:28:44.623" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20474" PostTypeId="2" ParentId="2140" CreationDate="2020-11-05T05:24:48.363" Score="0" Body="&lt;h1&gt;Catch the fruit (Abandoned) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;I feel that this is too complex to be a good code-golf question, and has too many things to specify for it to be anywhere near serviceable. Anybody willing to make this idea into a proper question can do so.&lt;/p&gt;&#xA;&lt;p&gt;Implement a osu!catch style game.&lt;/p&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;osu!catch is a rhythm game where the player moves a &amp;quot;basket&amp;quot; to catch &amp;quot;fruits&amp;quot; falling from the top of the screen to the beat of a song. Think pong, but with timing.&lt;/p&gt;&#xA;&lt;p&gt;It is &lt;strong&gt;highly&lt;/strong&gt; recommended to &lt;a href=&quot;https://youtu.be/6WKZE2HPOK8?t=43&quot; rel=&quot;nofollow noreferrer&quot;&gt;watch this video&lt;/a&gt; before reading the question.&lt;/p&gt;&#xA;&lt;p&gt;Here's a gameplay example from Bubbler: &lt;a href=&quot;https://www.youtube.com/watch?v=zLsPCHzakK8&amp;amp;ab_channel=WoosukKwak&quot; rel=&quot;nofollow noreferrer&quot;&gt;[osu!catch] Hitsuji to Ojisan - XENO [Spec's Overdose]&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;You are required to take the following inputs:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Time: How long your program is supposed to run.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Approach Rate: This is the speed at which the &amp;quot;fruits&amp;quot; are supposed to fall down.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Beatmap: An array of [time, x position, value] triplets where:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Time: you must support time in seconds, at the very least. Higher precision is encouraged.&lt;/li&gt;&#xA;&lt;li&gt;X position: Where it will fall from.&lt;/li&gt;&#xA;&lt;li&gt;Value: The size of the &amp;quot;fruit&amp;quot; will decrease with it's value.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Gameplay&lt;/h1&gt;&#xA;&lt;h2&gt;Play area&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The canvas must be in a 4:3 aspect ratio.&lt;/li&gt;&#xA;&lt;li&gt;The score must be displayed at the top of the screen, in the middle. You do not need to align it.&lt;/li&gt;&#xA;&lt;li&gt;The score starts at 0.&lt;/li&gt;&#xA;&lt;li&gt;Use a dark background(#222222, preferably).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;The player&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The player must be of a rectangular shape, white in color.&lt;/li&gt;&#xA;&lt;li&gt;Height: 1/50 of canvas height, Width: 1/6 of canvas width.&lt;/li&gt;&#xA;&lt;li&gt;The player must be at the bottom of the screen, movable using any two keys of your choice.&lt;/li&gt;&#xA;&lt;li&gt;The player must have a &amp;quot;dash&amp;quot; button. Their speed must increase 0.5x when they hold the dash button.&lt;/li&gt;&#xA;&lt;li&gt;When the player collects a fruit, it must disappear, and it's value must be added to the score.&lt;/li&gt;&#xA;&lt;li&gt;When the player misses a fruit, there should be an indicative visual cue where the fruit fell.(a small red square, preferably)&lt;/li&gt;&#xA;&lt;li&gt;The player must be constrained within the canvas.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Fruits&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Fruit must be square in shape, and red in color.&lt;/li&gt;&#xA;&lt;li&gt;Fruits must fall from the top of the screen, outside the viewport(unless unsupported).&lt;/li&gt;&#xA;&lt;li&gt;Max fruit size is 0.1 × height. Size scales inversely with value.&lt;/li&gt;&#xA;&lt;li&gt;Fruit speed must be related to the approach rate i.e. Higher approach rate must make the fruits fall faster. You may do this however you like, but please be reasonable.&lt;/li&gt;&#xA;&lt;li&gt;The lower edge of the fruit must touch the bottom of the screen at it's time value.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. Shortest answer in each language wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the specification simple enough?&lt;/li&gt;&#xA;&lt;li&gt;I am planning on making a separate &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; challenge for this. Is that a better idea?&lt;/li&gt;&#xA;&lt;li&gt;Is the specfication clear?&lt;/li&gt;&#xA;&lt;li&gt;Any further feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="80214" LastEditorUserId="80214" LastEditDate="2021-02-09T09:59:30.147" LastActivityDate="2021-02-09T09:59:30.147" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20477" PostTypeId="2" ParentId="2140" CreationDate="2020-11-06T12:42:07.410" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/214938/convert-magic-the-gathering-colours-to-a-colour-based-deck-name&quot;&gt;Question has been posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="9534" LastEditorUserId="9534" LastEditDate="2020-11-09T20:30:53.983" LastActivityDate="2020-11-09T20:30:53.983" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20478" PostTypeId="2" ParentId="2140" CreationDate="2020-11-06T22:23:41.670" Score="-3" Body="&lt;h1&gt;Create a &amp;quot;Transpiler&amp;quot;&lt;/h1&gt;&#xA;&lt;p&gt;for the purpose of this challenge, a transpiler is any program that takes valid source code from one language as input and produces a program valid in another language that performs the same actions. Calling the original languages interpreter is not banned.&lt;/p&gt;&#xA;&lt;p&gt;Posts should start with &amp;quot;SRCLANG to DSTLANG in LANG; X bytes&amp;quot; as a heading.&lt;/p&gt;&#xA;&lt;p&gt;Here's an example post:&lt;/p&gt;&#xA;&lt;h1&gt;Shell to Ruby in Ruby; 41 bytes&lt;/h1&gt;&#xA;&lt;pre class=&quot;lang-ruby prettyprint-override&quot;&gt;&lt;code&gt;puts'`bash #{Data}`&#xA;__END__&#xA;'+STDIN.read&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here we use the somewhat obscure &lt;code&gt;Data&lt;/code&gt; constant to embed arbitrary data in the program. this has the advantage of never having to escape anything.&lt;/p&gt;&#xA;&lt;p&gt;Each &amp;quot;triple&amp;quot; of source, destination, and working language represents its own category, as this challenge varies greatly in difficulty depending on the languages used.&lt;/p&gt;&#xA;" OwnerUserId="98974" LastActivityDate="2020-11-06T22:23:41.670" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="20480" PostTypeId="2" ParentId="2140" CreationDate="2020-11-07T16:43:07.950" Score="1" Body="&lt;h1&gt;Fix the message on my calculator&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;My calculator has lots of mathematical buttons, but they're boring; it's much more fun to write messages using letters. You can access the letters of the alphabet with the &lt;kbd&gt;ALPHA&lt;/kbd&gt; button which turns each button press into a corresponding letter which is noted above each key (or space, in the case of &lt;kbd&gt;.&lt;/kbd&gt;).&lt;/p&gt;&#xA;&lt;p&gt;My calculator looks like this*:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; A    B    C    D    E    F&#xA;log   ln   ^2  sin  cos  tan&#xA;-----------------------------&#xA; G    H    I    J    K    L&#xA; /    -&amp;gt;   (    )    ,   Esc&#xA;-----------------------------&#xA; M     N     O&#xA; 7     8     9 &#xA;-----------------------------&#xA; P     Q     R     S     T&#xA; 4     5     6     *     %&#xA;-----------------------------&#xA; U     V     W     X     Y&#xA; 1     2     3     +     -&#xA;-----------------------------&#xA; Z    (Space)&#xA; 0       .  &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For example, to type &lt;code&gt;HELLO&lt;/code&gt; I would press &lt;kbd&gt;Esc&lt;/kbd&gt; &lt;kbd&gt;cos&lt;/kbd&gt; &lt;kbd&gt;-&amp;gt;&lt;/kbd&gt; &lt;kbd&gt;-&amp;gt;&lt;/kbd&gt; &lt;kbd&gt;9&lt;/kbd&gt; &lt;kbd&gt;.&lt;/kbd&gt;.&lt;/p&gt;&#xA;&lt;p&gt;However, recently my &lt;kbd&gt;ALPHA&lt;/kbd&gt; button was broken, so I can't get to the letters any more. When I try to write a message, only the mathematical symbols get input.&lt;/p&gt;&#xA;&lt;p&gt;Without ALPHA, the keys do the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The &lt;kbd&gt;Esc&lt;/kbd&gt; key does nothing&lt;/li&gt;&#xA;&lt;li&gt;The digit keys, &lt;kbd&gt;.&lt;/kbd&gt;, &lt;kbd&gt;(&lt;/kbd&gt;, &lt;kbd&gt;)&lt;/kbd&gt;, &lt;kbd&gt;,&lt;/kbd&gt;, &lt;kbd&gt;-&amp;gt;&lt;/kbd&gt;, &lt;kbd&gt;+&lt;/kbd&gt;, &lt;kbd&gt;-&lt;/kbd&gt;, &lt;kbd&gt;*&lt;/kbd&gt;, and &lt;kbd&gt;%&lt;/kbd&gt; enter those strings verbatim&lt;/li&gt;&#xA;&lt;li&gt;The &lt;kbd&gt;log&lt;/kbd&gt;, &lt;kbd&gt;ln&lt;/kbd&gt;, &lt;kbd&gt;sin&lt;/kbd&gt;, &lt;kbd&gt;cos&lt;/kbd&gt;, and &lt;kbd&gt;tan&lt;/kbd&gt; keys enter &lt;code&gt;function_name()&lt;/code&gt; and place the cursor before the closing bracket&lt;/li&gt;&#xA;&lt;li&gt;The &lt;kbd&gt;/&lt;/kbd&gt; and &lt;kbd&gt;^2&lt;/kbd&gt; keys enter a &lt;code&gt;/&lt;/code&gt; or &lt;code&gt;^2&lt;/code&gt; respectively, and then move the cursor to before the new symbol, iff the symbol preceding it is one of &lt;code&gt;+ - * % ( , -&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For the example above, instead of getting the message &lt;code&gt;HELLO&lt;/code&gt;, I would get &lt;code&gt;-&amp;gt;cos(9)&lt;/code&gt;. Note that since the key for L (&lt;kbd&gt;Esc&lt;/kbd&gt;) does nothing, it is unfortunately impossible to know that the letter L was pressed, and this information is lost.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to convert a string of maths operations into the correct text.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Some combinations are ambiguous; for example &lt;code&gt;CGI&lt;/code&gt;, &lt;code&gt;CIG&lt;/code&gt;, &lt;code&gt;ICG&lt;/code&gt; all could have come from &lt;code&gt;(/^2&lt;/code&gt;. In this case you can output any or all of them.&lt;/li&gt;&#xA;&lt;li&gt;You should assume the input will always be a valid combination that could have been produced using the rules above.&lt;/li&gt;&#xA;&lt;li&gt;You should never output &lt;code&gt;L&lt;/code&gt;s&lt;/li&gt;&#xA;&lt;li&gt;You may output the string in any case, with an optional trailing newline, but no other extra whitespace.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. The shortest code in bytes wins.&lt;/li&gt;&#xA;&lt;li&gt;Standard rules and loopholes apply.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test-cases&lt;/h2&gt;&#xA;&lt;p&gt;More coming soon.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;      Input                 Output&#xA;----------------------------------------&#xA;789                    MNO&#xA;log(ln(^2))            ABC&#xA;cos((cos((9)           EIEIO&#xA;--&amp;gt;-                   YHY&#xA;3.14159                W UPUQO&#xA;(/^2                   CGI or CIG or ICG&#xA;&amp;lt;empty string&amp;gt;         &amp;lt;empty string&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;sub&gt;* The &lt;code&gt;%&lt;/code&gt; and &lt;code&gt;/&lt;/code&gt; keys are both for division on the original calculator, but labelled something like &lt;code&gt;÷&lt;/code&gt; and &lt;code&gt;☐/☐&lt;/code&gt;. Here I've just replaced them with simple ASCII equivalents. (did you know that both &lt;code&gt;%&lt;/code&gt; and &lt;code&gt;÷&lt;/code&gt; represent a fraction?) Also, there are other keys not shown (including the mentioned &lt;kbd&gt;ALPHA&lt;/kbd&gt;), but they don't matter for this challenge.&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any feedback or suggestions?&lt;/li&gt;&#xA;&lt;li&gt;Is this clear enough?&lt;/li&gt;&#xA;&lt;li&gt;I considered adding some regular expressions to show more clearly what the rules mean, but decided not to because I though that should be part of the challenge. Was this the right decision?&lt;/li&gt;&#xA;&lt;li&gt;I will probably make another challenge that is the reverse of this - given a list of buttons that were pressed, produce the correct mathematical symbols. It might have made sense to post that challenge first as context for this one, but I thought this one is more interesting&lt;/li&gt;&#xA;&lt;li&gt;Regarding ambiguity: I could change some of the syntax rules to reduce the ambiguity but it would make things a lot more complicated and it couldn't be removed completely without straying significantly from the behaviour of the original calculator&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2020-11-07T16:43:07.950" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20481" PostTypeId="2" ParentId="2140" CreationDate="2020-11-07T21:00:34.213" Score="0" Body="&lt;h1&gt;Isomorphic Modular Arithmetic&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For this question, we define &lt;span class=&quot;math-container&quot;&gt;\$U(n)\$&lt;/span&gt; as the group consisting of a number below &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; that is coprime to n (1 included but 0 doesn't) and multiplication as group operator.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to print every integer (so it's an infinite loop, but there should be output during looping) and group it into lines so that:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The line consists of a sequence of sorted number so that the &lt;span class=&quot;math-container&quot;&gt;\$U\$&lt;/span&gt; group based on each number is isomorphic&lt;/li&gt;&#xA;&lt;li&gt;The output itself has to be sorted based on the first number on each line&lt;/li&gt;&#xA;&lt;li&gt;Every number have to be eventually outputted given enough time.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;A pair of groups &lt;span class=&quot;math-container&quot;&gt;\$(X,\times_A)\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$(X,\times_B)\$&lt;/span&gt; is called isomorphic if there is a pair of functions &lt;span class=&quot;math-container&quot;&gt;\$f : X\to X\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$g:X\to X\$&lt;/span&gt; so that:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$&#xA;f(g(x)) = x = g(f(x)) \text{ (i.e. they are inverses)}&#xA;\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$&#xA;f(x) \times_B f(y) = f(x \times_A y)&#xA;\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$&#xA;g(x) \times_A g(y) = g(x \times_B y)&#xA;\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;The shortest code wins.&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;U(2) consists of only one element 1.&#xA;U(3) and U(4) is isomorphic because both contains only 2 elements (former 1, 2 and latter 1, 3. 2 is excluded because 2 divides 4) and the table of multiplication is identical aside of replacement of 2 and 3.&#xA;Less trivially U(8) and U(12) is isomorphic, but not U(5)&#xA;the elements of U(8) is 1,3,5,7&#xA;the elements of U(12) is 1,5,7,11&#xA;the elements of U(5) is 1,2,3,4&#xA;Look at the table of multiplication:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    U(8)          U(12)          U(5)     &#xA;  1 3 5 1       1  5  7 11     1 2 3 4&#xA;1 1 3 5 7    1  1  5  7 11   1 1 2 3 4&#xA;3 3 1 7 5    5  5  1 11  7   2 2 4 1 3&#xA;5 5 7 1 3    7  7 11  1  5   3 3 1 4 2&#xA;7 7 5 3 1   11 11  7  5  1   4 4 3 2 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;By replacing 1 &amp;lt;-&amp;gt; 1, 3 &amp;lt;-&amp;gt; 5, 5 &amp;lt;-&amp;gt; 7, 7 &amp;lt;-&amp;gt; 11, the table of multiplication for U(8) and U(12) is identical. U(8) and U(5) is not, as n * n = 1 for any n in U(8), but 2&lt;em&gt;2 = 4 and 1&lt;/em&gt;1 = 1 in U(5). If there is such a pair f : U(8) -&amp;gt; U(5) and g : U(5) -&amp;gt; U(8), then&#xA;g(2&lt;em&gt;2)=g(4) &amp;lt;=&amp;gt; g(2)&lt;em&gt;g(2)=g(4) &amp;lt;=&amp;gt; 1 = g(4) &amp;lt;=&amp;gt; g(1) * g(1) = g(4) &amp;lt;=&amp;gt; g(1&lt;/em&gt;1) = g(4) &amp;lt;=&amp;gt; f(g(1&lt;/em&gt;1)) = f(g(4)) &amp;lt;=&amp;gt; 1*1=4 &amp;lt;=&amp;gt; 1=4, which is a contradiction.&lt;/p&gt;&#xA;&lt;p&gt;Even less obviously U(7) and U(9) are isomorphic, the multiplication table is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;   U(7)           U(9)&#xA;1 3 2 5 4 6   1 2 4 5 7 8&#xA;3 2 6 1 5 4   2 4 8 1 5 7&#xA;2 6 4 3 1 5   4 8 7 2 1 5&#xA;5 1 3 4 6 2   5 1 2 7 8 4&#xA;4 5 1 6 2 3   7 5 1 8 4 2&#xA;6 4 5 2 3 1   8 7 5 4 2 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Aside of swapping the row and column (has been done) and relabeling, the multiplication table is identical, So, they are symmetric&lt;/p&gt;&#xA;&lt;p&gt;Output for 2-15&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2&#xA;3 4 6&#xA;5 10&#xA;7 9&#xA;8 &#xA;11&#xA;13&#xA;14&#xA;15&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="46245" LastEditorUserId="46245" LastEditDate="2020-11-25T10:41:35.680" LastActivityDate="2020-11-25T10:41:35.680" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20483" PostTypeId="2" ParentId="2140" CreationDate="2020-11-08T13:57:03.373" Score="3" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/214952/are-these-states-connected&quot;&gt;Posted&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="14939" LastEditorUserId="14939" LastEditDate="2020-11-09T20:39:30.790" LastActivityDate="2020-11-09T20:39:30.790" CommentCount="22" ContentLicense="CC BY-SA 4.0" />
  <row Id="20485" PostTypeId="2" ParentId="2140" CreationDate="2020-11-09T20:27:54.300" Score="2" Body="&lt;h1&gt;Middle-Square RNG: What Number Came Before? (WIP)&lt;/h1&gt;&#xA;&lt;p&gt;A well-known, but statistically poor, way of generating random numbers is to square the number and take the middle digits (when expressed in base 10)&lt;/p&gt;&#xA;&lt;p&gt;Your task is to take a 4-digit number as input and output any 4-digit number that produces the input number (there may be more than one, which is one of the statistical flaws of this method) when applying middle-square. If the square has an odd number of digits, take an extra digit off the left side.&lt;/p&gt;&#xA;&lt;p&gt;If there is no such number (some numbers with this method have no predecessor- yet another statistical flaw), indicate that clearly in a way that cannot be mistaken as a valid answer. Some possible ways of indicating this:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output nothing&lt;/li&gt;&#xA;&lt;li&gt;Output null/None/nil/false&lt;/li&gt;&#xA;&lt;li&gt;Output an empty list&lt;/li&gt;&#xA;&lt;li&gt;Output a negative number&lt;/li&gt;&#xA;&lt;li&gt;Output an error message that is clearly not a 4-digit number&lt;/li&gt;&#xA;&lt;li&gt;Throw an exception&lt;/li&gt;&#xA;&lt;li&gt;Crash&lt;/li&gt;&#xA;&lt;li&gt;Exit with a nonzero status&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2020-11-30T21:10:36.370" LastActivityDate="2020-11-30T21:10:36.370" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20486" PostTypeId="2" ParentId="19279" CreationDate="2020-11-09T22:13:00.433" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/ZippyMagician/Arn&quot; rel=&quot;nofollow noreferrer&quot;&gt;Arn&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Arn is a rather new J-like language I designed back in mid-August (2020). It's designed to beat out its inspiration and also be competitive against other, older golfing languages.&lt;/p&gt;&#xA;&lt;h2&gt;Reasons&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;it does well at what’s it meant to, consistently beating J and APL. I’ve also seen it do better than languages such as Vyxal.&lt;/li&gt;&#xA;&lt;li&gt;The tutorial has been finished, making it easy to start.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/ZippyMagician/Arn&quot; rel=&quot;nofollow noreferrer&quot;&gt;Done with a major rewrite.&lt;/a&gt; TLDR new features, adding new ones easier&lt;/li&gt;&#xA;&lt;li&gt;Has entered a semi stable state. I have a feeling a few larger changes are due in the future, but for now I’ll probably just be adding a few new symbols every once in a while.&lt;/li&gt;&#xA;&lt;li&gt;There are very few (if any, other than me) people who use this language (as far as I'm aware) so this will help spread the language around.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Caveats&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Does not currently have a chatroom, as I don't believe there are enough people to warrant one.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;a href=&quot;https://zippymagician.github.io/Arn&quot; rel=&quot;nofollow noreferrer&quot;&gt;online&lt;/a&gt; version is out of date and has some bugs.&lt;/li&gt;&#xA;&lt;li&gt;I believe there’s a bug in the lexer that shows when using symbols that take multiple expressions on the same side, which I’m looking into.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/ZippyMagician/Arn&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub Repo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/ZippyMagician/Arn/wiki&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wiki&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://esolangs.org/wiki/Arn&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolangs.org&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/ZippyMagician/Arn/wiki/Tutorial&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tutorial&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://zippymagician.github.io/Arn&quot; rel=&quot;nofollow noreferrer&quot;&gt;Online Interpreter (Out of date)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="90265" LastEditorUserId="90265" LastEditDate="2021-05-03T16:28:44.133" LastActivityDate="2021-05-03T16:28:44.133" CommentCount="0" CommunityOwnedDate="2021-11-07T17:53:00.250" ContentLicense="CC BY-SA 4.0" />
  <row Id="20487" PostTypeId="2" ParentId="2140" CreationDate="2020-11-10T00:10:13.880" Score="0" Body="&lt;h1&gt;Topologies on Rational Numbers (WIP)&lt;/h1&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Construct a subset &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; of &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{Q}\$&lt;/span&gt; such that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; is neither open nor closed in &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{Q}\$&lt;/span&gt; as a subspace of &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{R}\$&lt;/span&gt;, and&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; is open but not closed in &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{Q}\$&lt;/span&gt; as a subspace of &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{R}_l\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Or, in other words, construct a subset &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; of &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{Q}\$&lt;/span&gt; such that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;There exists &lt;span class=&quot;math-container&quot;&gt;\$p \in P\$&lt;/span&gt; such that, there &lt;strong&gt;doesn't&lt;/strong&gt; exist an open interval &lt;span class=&quot;math-container&quot;&gt;\$p \in (a,b) \subset \mathbb{R}\$&lt;/span&gt; such that, &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{Q} \cap (a,b) \subset P\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For every &lt;span class=&quot;math-container&quot;&gt;\$p \in P\$&lt;/span&gt;, there exists a half-open interval &lt;span class=&quot;math-container&quot;&gt;\$p \in [a,b) \subset \mathbb{R}\$&lt;/span&gt; such that, &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{Q} \cap [a,b) \subset P\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There exists &lt;span class=&quot;math-container&quot;&gt;\$p \in \mathbb{Q} \setminus P\$&lt;/span&gt; such that, there &lt;strong&gt;doesn't&lt;/strong&gt; exist a half-open interval &lt;span class=&quot;math-container&quot;&gt;\$p \in [a,b) \subset \mathbb{R}\$&lt;/span&gt; such that, &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{Q} \cap [a,b) \subset \mathbb{Q} \setminus P\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Notes and Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Note that &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; is necessarily infinite, and thus cannot be represented as an associative container. One way of representing &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; is to have a function &lt;span class=&quot;math-container&quot;&gt;\$f : \mathbb{Q} → \mathbb{Z}_2\$&lt;/span&gt; that halts for every input, where &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{Z}_2\$&lt;/span&gt; is the set of the boolean values. Then &lt;span class=&quot;math-container&quot;&gt;\$p \in P\$&lt;/span&gt; shall satisfy iff &lt;span class=&quot;math-container&quot;&gt;\$f(p)\$&lt;/span&gt; is true.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The representation of &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{Q}\$&lt;/span&gt; must be exact. Thus you cannot have floating-point values as an input. Though native rational-number arithmetic will be preferred, you may use two &lt;strong&gt;arbitrary-length&lt;/strong&gt; integers as an input. In this case, the fraction is assumed to be irreducible and to have a positive denominator. Otherwise, the fraction falls in &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Invalid inputs fall in &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;An example of such &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; is:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\mathbb{Q} \cap ((0,1) \cup [2,3))&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Work in progress due to a trivial example.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2020-11-10T21:12:47.973" LastActivityDate="2020-11-10T21:12:47.973" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20492" PostTypeId="2" ParentId="2140" CreationDate="2020-11-12T14:47:24.823" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/220572/66833&quot;&gt;Sociable sequences&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-03-11T17:07:15.287" LastActivityDate="2021-03-11T17:07:15.287" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="20493" PostTypeId="1" CreationDate="2020-11-13T08:10:31.167" Score="8" ViewCount="210" Body="&lt;p&gt;The nominations for CGCC's best of 2019 have already been posted &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18672/best-of-ppcg-2019-now-accepting-nominations/18673#18673&quot;&gt;here.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;If it's alright, I can make another post for voting on the nominations and selecting them(I am assuming that selection is done by voting, from the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17367/cast-your-vote-for-best-of-ppcg-2018&quot;&gt;previous year's thread&lt;/a&gt;). So if anyone wants to nominate any other noteworthy questions/answers from 2019, now is the time.&lt;/p&gt;&#xA;&lt;p&gt;I think we should also set up another thread for 2020 since it's about to end in a few months, and it's easy to forget noteworthy answers. I can volunteer to do that as well.&lt;/p&gt;&#xA;" OwnerUserId="80214" LastActivityDate="2020-11-16T03:58:25.060" Title="Regarding CGCC's Best of 2019" Tags="|discussion|best-of|" AnswerCount="2" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="20494" PostTypeId="2" ParentId="20493" CreationDate="2020-11-13T13:43:51.697" Score="4" Body="&lt;h2&gt;Change this year's Best Of to &amp;quot;Best of PPCG 2019/2020&amp;quot;&lt;/h2&gt;&#xA;&lt;p&gt;Last year, around this time, Monica got fired, which lead to a lot of members of the PPCG community suspending their activity or leaving the site. As such, we went through a few months of low activity right when voting and bounties for the Best Of was supposed to happen, and it sort of just... didn't.&lt;/p&gt;&#xA;&lt;p&gt;This year, the community is much more active, so I'm not too worried about the 2020 Best Of falling through in the same way. However, it would be unfair to simply ignore the brilliant contributions to the site, simply because they happened at the wrong time.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, I suggest that we open the 2020 Best Of to all posts from 2019 and 2020. The posts that were nominated for last year can be renominated, and voted on, and we usually have more offered bounties than winning posts, so we could potentially include a &amp;quot;2020 winner&amp;quot; and a &amp;quot;2019 winner&amp;quot; for some/all categories if we wanted to.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2020-11-13T13:43:51.697" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20496" PostTypeId="2" ParentId="2140" CreationDate="2020-11-15T15:37:18.147" Score="0" Body="&lt;h1&gt;Write a program that mimics the output of the command &lt;code&gt;env&lt;/code&gt; (with no arguments).&lt;/h1&gt;&#xA;&lt;p&gt;The program should print (to standard output, or closest equivalent) a list of all current environment variables, with each variable on it's own line. The name and content of a variable should be separated by an equal sign.&lt;/p&gt;&#xA;&lt;p&gt;Here's a grammar:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;line ::= name &amp;quot;=&amp;quot; contents&#xA;output ::= (line &amp;quot;\n&amp;quot;)*&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;No using the &lt;code&gt;env&lt;/code&gt; command, or any 1 command that completes the challenge on its own.&lt;/p&gt;&#xA;&lt;p&gt;shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="98974" LastEditorUserId="98974" LastEditDate="2021-06-03T16:47:48.173" LastActivityDate="2021-06-03T16:47:48.173" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="20497" PostTypeId="2" ParentId="20493" CreationDate="2020-11-16T03:58:25.060" Score="10" Body="&lt;h2&gt;Move to voting phase for Best of 2019, and start Best of 2020 after 2019 is completely done&lt;/h2&gt;&#xA;&lt;p&gt;Posting as an answer so that users can vote.&lt;/p&gt;&#xA;&lt;p&gt;Based on the comments on caird's suggestion, I think it's fine to simply go this way (it's arguably late, but it isn't &lt;em&gt;too&lt;/em&gt; late yet, in the sense that we can finish this just before starting Best of 2020).&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2020-11-16T03:58:25.060" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20498" PostTypeId="2" ParentId="2140" CreationDate="2020-11-16T10:58:13.713" Score="0" Body="&lt;h1&gt;Find the longest streak of Fibonacci numbers on the Ulam spiral&lt;/h1&gt;&#xA;&lt;h2&gt;Fibonacci numbers&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://oeis.org/A000045&quot; rel=&quot;nofollow noreferrer&quot;&gt;Fibonacci numbers&lt;/a&gt; are a sequence where each element is the sum of the previous two elements. In the original Fibonacci sequence, the first two number are 1. So the sequence goes: &lt;code&gt;1, 1, 2, 3, 5, 8, 13, 21, ...&lt;/code&gt;. For the challenge, we will accept any two numbers as the two starting numbers of the series.&lt;/p&gt;&#xA;&lt;h2&gt;Ulam spiral&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Ulam_spiral&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Ulam spiral&lt;/a&gt; is an arrangement of natural numbers. The spiral goes counter-clockwise and starts with the numbers &lt;code&gt;1, 2&lt;/code&gt;, where the &lt;code&gt;2&lt;/code&gt; is right of the &lt;code&gt;1&lt;/code&gt;. For this exercise, only the shape of the spiral is relevant.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/IqAiv.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/IqAiv.png&quot; alt=&quot;Ulam spiral&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Find the length of the longest streak of generalised Fibonacci numbers (with any two starting numbers) following the Ulam spiral in a given array of integer numbers.&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;The following 5x5 array has two generalised Fibonacci sequences: one of length 4 (in blue + yellow: &lt;code&gt;138, 81, 219, 300&lt;/code&gt;) and one of length 8 (in green + blue: &lt;code&gt;24, 57, 81, 138, 219, 357, 576, 933&lt;/code&gt;). The answer is thus 8.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/0eUXf.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/0eUXf.png&quot; alt=&quot;Example&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program should at least support arrays up to 65535 * 65535 in size and array elements with values up to 4,294,967,295.&lt;/li&gt;&#xA;&lt;li&gt;Invalid input (non-square arrays, float or negative elements, non-arrays, etc.) may lead to unpredicted output, errors or (un)defined behaviour.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;Default I/O rules&lt;/a&gt; apply and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;default loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;on question 1; see comments below&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;on question 2; see comments below&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, so the fastest answer wins.&lt;/li&gt;&#xA;&lt;li&gt;Fastest code is measured in average user time over 5 different, undisclosed input matrices of sizes 100, 1000 and 10,000, each run 3 times on my late 2013 MacBook Pro with 2,3 GHz quadcore Intel i7 CPU and 16 GB of RAM.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Review questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I plan on publishing this question twice: one time as a codegolf and one time as a fastest-code. See the last section of my question. I think this challenge has interesting but very different optimization strategies for speed and size. Is this be something that would be frowned upon by the CGSE community?&lt;/li&gt;&#xA;&lt;li&gt;Is the challenge clear enough as stated?&lt;/li&gt;&#xA;&lt;li&gt;Should I add more/larger test cases? Or a test case generating Python script?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="32381" LastActivityDate="2020-11-16T10:58:13.713" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20499" PostTypeId="1" CreationDate="2020-11-17T05:34:11.117" Score="9" ViewCount="382" Body="&lt;h1&gt;Final phase&lt;/h1&gt;&#xA;&lt;p&gt;You have chosen the categories and the nominees for 2019, now it is time to pick the winners!&lt;/p&gt;&#xA;&lt;p&gt;Each of the seven categories is represented by an answer to this question, and each of these answers contains all nominations by the members of our community.&lt;/p&gt;&#xA;&lt;h1&gt;Voting mechanism&lt;/h1&gt;&#xA;&lt;p&gt;Each nominee has been added as a comment to its category's answer. In each category, the nominee whose comment has the highest number of votes by  December 1,00:00 UTC will be declared the winner of that category.&lt;/p&gt;&#xA;&lt;h1&gt;Further details&lt;/h1&gt;&#xA;&lt;p&gt;Starting now, please do not edit the answers.&lt;/p&gt;&#xA;&lt;p&gt;Please do not add comments to the answers.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Votes on the question and on answers are meaningless; only votes on comments count.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Feel free to vote for multiple nominees of the same category, including your own posts.&lt;/p&gt;&#xA;" OwnerUserId="80214" LastEditorUserId="80214" LastEditDate="2020-11-26T03:56:09.577" LastActivityDate="2020-11-26T03:56:09.577" Title="Cast your vote for &quot;Best of CGCC 2019!&quot;" Tags="|discussion|best-of|" AnswerCount="10" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20500" PostTypeId="2" ParentId="20499" CreationDate="2020-11-17T05:50:24.467" Score="1" Body="&lt;h1&gt;Best Above-and-Beyond Answer&lt;/h1&gt;&#xA;&lt;p&gt;Every once in a while, an answer takes the challenge to the extreme. This prize will be awarded to an answer which went far beyond the expectations of the challenge. This could include a code golf answer that brute-forced/proved the shortest program in some language&#xA;a graphical-output popcon answer of extreme size and quality&#xA;a KOTH answer of high complexity which absolutely dominated the competition&lt;/p&gt;&#xA;&lt;h2&gt;The nominees are:&lt;/h2&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/189055/52210&quot;&gt;“DDoouubbllee ssppeeaakk!!”&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/61379/kamila-szewczyk&quot;&gt;Kamila Szewczyk&lt;/a&gt; - Malbolge&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Kevin Cruijssen&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;To quote the Malbolge docs themselves:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The day that someone writes, in Malbolge, a program that simply copies its input to it's output, is the day my hair spontaneously turns green. It's the day that elephants are purple and camels fly, and a cow can fit through a needle's eye.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;And what &lt;em&gt;@KamilaSzewczyk&lt;/em&gt; does in the &lt;em&gt;DDoouubbllee ssppeeaakk!!&lt;/em&gt; challenge is at least doubly (pun intended) as impressive and insane, thus worthy of being nominated here.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/198428&quot;&gt;Divide input by the square root of 2&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/17216/deadcode&quot;&gt;Deadcode&lt;/a&gt; - ECMAScript regex (+ molecular lookahead)&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by user41805&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Quoting the first line of the submission,&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Regex was never designed to do mathematics. It has no concept of arithmetic.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/191111/78850&quot;&gt;Divide Numbers by 0&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/61379/kamila-szewczyk&quot;&gt;Kamila Szewczyk&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Lyxal&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Even though it may seem like it was written in Polish (&lt;em&gt;&amp;quot;When I opened your program, Chrome attempted to translate it from Polish&amp;quot;&lt;/em&gt; -- quote from a comment on the answer), this 362MB answer has stuck with me all year as one of my favourites. I've known right from when I saw it that I would nominate it for a best of CGCC category.&lt;/p&gt;&#xA;&lt;p&gt;Sure, it's over 20 million times longer than the winning Jelly answer, but for such a volatile language such as Malbolge competing in such a task as theoretically diving numbers by 0, It earns it's nomination.&lt;/p&gt;&#xA;&lt;p&gt;To quote the last line in the answer:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;It's working!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/189091/92069&quot;&gt;“DDoouubbllee ssppeeaakk!!”&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/61379/kamila-szewczyk&quot;&gt;Kamila Szewczyk&lt;/a&gt; - Seed&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;nominated by a'_'&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A comment has once been posted in &amp;quot;Tips for golfing in Seed&amp;quot; along the lines of:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;... There are only two people who know how to golf in Seed, and both of them decided to not share their tips ...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Kamila knowing how to golf in Seed is unique and supernatural, with no one else other than feersum knowing how to golf in it, since it involves reverse-engineering the Mersenne twister; thus the answer is worthy of being nominated here.&lt;/p&gt;&#xA;" OwnerUserId="80214" LastActivityDate="2020-11-17T05:50:24.467" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20501" PostTypeId="2" ParentId="20499" CreationDate="2020-11-17T05:54:17.470" Score="2" Body="&lt;h1&gt;Best Non-Code-Golf Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Best challenge whose winning criteria did not include any code-golfing. King of the Hill, Fastest Code, etc. would be eligible. Proof Golf, atomic-code-golf, etc. are also included. Anything that's not the standard &amp;quot;shortest code length&amp;quot; is eligible.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/188333/78410&quot;&gt;Construct a pentagon avoiding compass use&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/ad-hoc-garf-hunter&quot;&gt;Wheat Wizard&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Bubbler&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;As far as I know, this was the first (and is still the only) challenge asking about compass-and-straightedge construction, and it is a very well designed one, at least in my opinion. This challenge also established a good ruleset for possible future challenges of the kind.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/196824/78410&quot;&gt;Biggest Irreducible Hello World&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/88509/mason&quot;&gt;Mason&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Bubbler&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This was the first proper &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; challenge that allowed arbitrarily high scores while not allowing trivial solutions. The challenge was a huge success, getting a few answers with &lt;a href=&quot;https://codegolf.stackexchange.com/a/197001/78410&quot;&gt;impressive&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/196833/78410&quot;&gt;scores&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/183036&quot;&gt;Can a neural network recognize primes?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/49643/a-rex&quot;&gt;A. Rex&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by user41805&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The first &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/neural-networks&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;neural-networks&amp;#39;&quot; rel=&quot;tag&quot;&gt;neural-networks&lt;/a&gt; challenge on PPCG that eventually led to 4 more &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/neural-networks&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;neural-networks&amp;#39;&quot; rel=&quot;tag&quot;&gt;neural-networks&lt;/a&gt; challenges in 2019.&lt;/p&gt;&#xA;" OwnerUserId="80214" LastActivityDate="2020-11-17T05:54:17.470" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20502" PostTypeId="2" ParentId="20499" CreationDate="2020-11-17T06:03:23.860" Score="1" Body="&lt;h1&gt;Best first-time Challenge Writer&lt;/h1&gt;&#xA;&lt;p&gt;For the best challenge written by someone who has not written a challenge prior to 2019 (i.e., not necessarily a new user, just a new challenge writer).&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/181708/52210&quot;&gt;Would this string work as string?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/85031/discrete-games&quot;&gt;DiscreteGames&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Kevin Cruijssen&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;It was his/her first post, yet is the third most upvoted challenge of 2019. A clear spec right from the get-go, without people needing to comment all kind of questions and suggestions for spec-changes; additional test cases; or things that weren't clear, like we usually see with new users. And it's a fun challenge, with a variety of different approaches in the answers as well.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/187816/swapping-good-and-bad&quot;&gt;Swapping &amp;quot;Good&amp;quot; and &amp;quot;Bad&amp;quot;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/86803/ishaq-khan&quot;&gt;IshaqKhan&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Lyxal&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I know that I use for planning esolangs, and, with 7k views, it was a breath of fresh air to see such a well-written and simple challenge.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/184682/check-if-a-string-is-entirely-made-of-the-same-substring&quot;&gt;Check if a string is entirely made of the same substring&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/81263/ouflak&quot;&gt;ouflak&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by a'_'&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;It's quite rare for a new user to post such a simple and interesting challenge. With 25 votes (very impressive for a first challenge), it was an impressive unique challenge.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/187562&quot;&gt;Machine Learning Golf: Multiplication&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/87615&quot;&gt;Stefan Mesken&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by user41805&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;It's the second &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/neural-network&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;neural-network&amp;#39;&quot; rel=&quot;tag&quot;&gt;neural-network&lt;/a&gt; challenge, and it has resulted in answers that hardcoded the computation in interesting ways.&lt;/p&gt;&#xA;" OwnerUserId="80214" LastActivityDate="2020-11-17T06:03:23.860" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20503" PostTypeId="2" ParentId="20499" CreationDate="2020-11-17T06:11:21.280" Score="3" Body="&lt;h1&gt;Best mathematical insight&lt;/h1&gt;&#xA;&lt;p&gt;On this site we often see answers in languages specifically designed for short code, or designed to be fast. Sometimes, a nice golfing trick or speed-up technique surprises us with its ingenuity, beyond the standard use of that language.&lt;/p&gt;&#xA;&lt;p&gt;And occasionally an answer shows up that uses an unexpected approach to greatly simplify the problem, and makes us wonder how the author could ever think of that. This usually involves some far-from-obvious mathematical equivalence, or a particularly simple approach to the problem that was not evident at all (once revealed, other answers often follow the same approach).&lt;/p&gt;&#xA;&lt;p&gt;This category is for the answer with the best &lt;strong&gt;mathematical&lt;/strong&gt; insight or unexpected approach that led to greatly simplifying the problem, in &lt;strong&gt;any challenge type&lt;/strong&gt; (code golf, fastest code, or others). The insight should have led to a significant improvement according to the challenge's metric (code length, run time, or whatever applicable).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;NOTE:&lt;/em&gt; Although there is only one nomination for this category, it has been posted for recognition.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/191306/52210&quot;&gt;What's this constructed number's starter?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/6484/grimmy&quot;&gt;Grimmy&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Kevin Cruijssen&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;After a pretty lengthy and impressive challenge description, Grimmy wrote an incredibly short, to-the-point 4-byter which literally all other answers (except for one) ported.&lt;/p&gt;&#xA;&lt;p&gt;To quote the top two comments:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Hmm, that doesn't bode well for this challenge if it can be simplified that easily&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;You have approximately 1 byte of code for 800 bytes of challenge explanation. :p&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="80214" LastActivityDate="2020-11-17T06:11:21.280" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20504" PostTypeId="2" ParentId="20499" CreationDate="2020-11-17T06:13:53.060" Score="1" Body="&lt;h2&gt;Best tip&lt;/h2&gt;&#xA;&lt;p&gt;Best answer to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/193469/78850&quot;&gt;Tips for golfing in Keg&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;Lyxal&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;It was the most upvoted tip on the question, and it is the second most upvoted answer to a &amp;quot;Tips for golfing in &amp;quot; question in 2019.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/180950/92069&quot;&gt;Is it possible to make a clamp function shorter than a ternary in JS?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/58563/arnauld&quot;&gt;Arnauld&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Anonymously nominated&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;It was the most upvoted answer to a tips question in 2019 with an impressive 23 upvotes.&lt;/p&gt;&#xA;" OwnerUserId="80214" LastActivityDate="2020-11-17T06:13:53.060" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20505" PostTypeId="2" ParentId="20499" CreationDate="2020-11-17T06:17:14.037" Score="4" Body="&lt;h1&gt;Best Non-Code-Golf Answer&lt;/h1&gt;&#xA;&lt;p&gt;Best answer to a challenge whose winning criteria did not include any code-golfing. King of the Hill, Fastest Code, etc. would be eligible. Proof Golf, atomic-code-golf, etc. are also included. Anything that's not the standard &amp;quot;shortest code length&amp;quot; is eligible.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;NOTE:&lt;/em&gt; Although there is only one nomination for this category, it has been posted for recognition.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/188337/78410&quot;&gt;Construct a pentagon avoiding compass use&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/39242/anders-kaseorg&quot;&gt;Anders Kaseorg&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Bubbler&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;They achieved the optimal primary score (2 circles) with awesome secondary score (&lt;em&gt;only&lt;/em&gt; 13 lines!) using some advanced concepts from projective geometry (which we'll hardly ever see on a recreational programming site here).&lt;/p&gt;&#xA;" OwnerUserId="80214" LastActivityDate="2020-11-17T06:17:14.037" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20506" PostTypeId="2" ParentId="20499" CreationDate="2020-11-17T06:24:14.083" Score="2" Body="&lt;h1&gt;Wild card&lt;/h1&gt;&#xA;&lt;p&gt;For a deserving challenge, answer or user that isn't a good fit for any of the other categories.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/search?page=1&amp;amp;tab=Relevance&amp;amp;q=user%3a70292%20add%20a%20language%20to%20a%20polyglot&quot;&gt;139 answers&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/102370/add-a-language-to-a-polyglot&quot;&gt;Add a language to a polyglot&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/70292/stasoid&quot;&gt;stasoid&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Kevin Cruijssen&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This challenge was created in 2016, but &lt;em&gt;@stasoid&lt;/em&gt; has been adding new languages every few weeks for the past 2+ years. It's insane to think that this single program can run in 280+ different programming languages, of which 139 of those languages (so roughly halve) were added by &lt;em&gt;@stasoid&lt;/em&gt; alone.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/52904/ceilingcat&quot;&gt;ceilingcat&lt;/a&gt; for his helpful and constructive comments&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by S. S. Anne&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Although he doesn't often post answers, he does post many comments that have helped improve countless solutions. I wouldn't be as good of a code-golfer as I am now without @ceilingcat.&lt;/p&gt;&#xA;" OwnerUserId="80214" LastEditorUserId="80214" LastEditDate="2020-11-17T10:49:10.637" LastActivityDate="2020-11-17T10:49:10.637" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20507" PostTypeId="2" ParentId="20499" CreationDate="2020-11-17T06:27:03.690" Score="1" Body="&lt;h1&gt;Most Unconventional Non-esoteric Language&lt;/h1&gt;&#xA;&lt;p&gt;Goes to a user who uses a language not normally associated with programming challenges.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/58563/arnauld&quot;&gt;Arnauld&lt;/a&gt; - &lt;a href=&quot;https://www.javascript.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;JavaScript&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by RGS&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Arnauld consistently posts in JS and consistently posts very competitive answers, more often than not with some really interesting mathematical touches.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/75681/galen-ivanov&quot;&gt;Galen Ivanov&lt;/a&gt; - &lt;a href=&quot;https://www.red-lang.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Red&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Anonymous nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;He is currently the only active person using Red to answer challenges, often producing fairly competitive answers.&lt;/p&gt;&#xA;" OwnerUserId="80214" LastActivityDate="2020-11-17T06:27:03.690" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20508" PostTypeId="2" ParentId="20499" CreationDate="2020-11-17T06:28:41.523" Score="1" Body="&lt;h1&gt;Trickiest Challenge&lt;/h1&gt;&#xA;&lt;p&gt;It should look simple and tempt you to start coding right away, but coming up with a good solution should be hard.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;NOTE:&lt;/em&gt; Although there is only one nomination for this category, it has been posted for recognition.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/181843/52210&quot;&gt;Make a Bowl of Alphabet Soup&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/85031/discrete-games&quot;&gt;DiscreteGames&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;It didn't seem to hard at first (definitely not trivial either though), but actually was surprisingly tricky to create a solution for.&lt;/p&gt;&#xA;" OwnerUserId="80214" LastActivityDate="2020-11-17T06:28:41.523" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20509" PostTypeId="2" ParentId="20499" CreationDate="2020-11-17T06:31:17.223" Score="1" Body="&lt;h1&gt;Most helpful Sandbox commenter&lt;/h1&gt;&#xA;&lt;p&gt;Rewards a kind soul who took the time and effort to read through challenges in the Sandbox and give helpful feedback.&lt;/p&gt;&#xA;&lt;p&gt;(I guess a bounty here would be awarded to one of the winner's questions or answers of their choosing.)&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/43319/ad%c3%a1m&quot;&gt;Adám&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Anonymous Nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I nominate Adám for this award, as he is always willing to read through challenges and highlight parts which are unclear. He is also willing to check sandboxed posts on demand, so to speak, if asked in TNB, which is why I'm nominating him.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Lyxal&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I nominate Bubbler for this award, as they are always reading through the sandboxed challenges and provides helpful comments for challenges. They will be commenting on the challenge whenever the challenge is mentioned in TNB. Also they are very helpful and would mention everything in the challenge that is unclear or needs improvement.&lt;/p&gt;&#xA;" OwnerUserId="80214" LastActivityDate="2020-11-17T06:31:17.223" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20512" PostTypeId="1" CreationDate="2020-11-19T10:20:14.310" Score="8" ViewCount="218" Body="&lt;p&gt;As this month's LotM (Forth) was not gaining much participation, I guessed it's partly because it's way too low-level, so I was looking into &lt;a href=&quot;https://factorcode.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Factor&lt;/a&gt; as a modern, high-level alternative to Forth. If it goes well, I'm planning to add a LotM proposal so that other people can look into it.&lt;/p&gt;&#xA;&lt;p&gt;But I found a major issue in code golf scoring for Factor: most submissions omit the required imports from the byte count. Some of them actually work when tested in the REPL without any setting, but many don't (as the REPL loads only part of the libraries by default). (The existing answers in Factor can be found via &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1332712/dummy&quot; rel=&quot;nofollow noreferrer&quot;&gt;this SEDE query&lt;/a&gt;.)&lt;/p&gt;&#xA;&lt;p&gt;They can be made to work if we add a global setting script in &lt;code&gt;.factor-rc&lt;/code&gt; like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;! .factor-rc&#xA;USE: parser auto-use&#xA;&#xA;! script.factor&#xA;1.2 dup + floor .&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##qyrO@J@cWKJgp1Cnr5eWmFySX6RblKxgY6Pg6u/GFRrsaqVQkFhUnFqkkFhakq9bWpzKBZKAaSnOLy1KToVqhOr6b6hnpJBSWqCgrZCWkw8U1vsP0qKfX1CiD1EIpdD1/wcA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Zsh – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Inside &lt;code&gt;script.factor&lt;/code&gt;, we need to load &lt;code&gt;kernel&lt;/code&gt; library for &lt;code&gt;dup&lt;/code&gt;, &lt;code&gt;math&lt;/code&gt; for &lt;code&gt;+&lt;/code&gt;, &lt;code&gt;math.functions&lt;/code&gt; for &lt;code&gt;floor&lt;/code&gt;, and &lt;code&gt;prettyprint&lt;/code&gt; for &lt;code&gt;.&lt;/code&gt;. Without the &lt;code&gt;.factor-rc&lt;/code&gt; file, we'd need to write this to make it work:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;USING: kernel math math.functions prettyprint ;&#xA;1.2 dup + floor .&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Note that using the rc-file generates a warning to STDOUT, so it can't be used for a full program.)&lt;/p&gt;&#xA;&lt;p&gt;Otherwise, if we assume REPL environment, &amp;quot;auto use&amp;quot; is a built-in feature, which (disabled by default) can be enabled via mouse or by typing &lt;code&gt;auto-use&amp;lt;ENTER&amp;gt;&lt;/code&gt;. (&lt;code&gt;parser&lt;/code&gt; library is available by default in the REPL.) REPL also starts with &amp;quot;auto use&amp;quot; enabled by default if the same &lt;code&gt;.factor-rc&lt;/code&gt; exists.&lt;/p&gt;&#xA;&lt;p&gt;So the question is: &lt;strong&gt;Should I count the content of &lt;code&gt;.factor-rc&lt;/code&gt; file (20B), or &lt;code&gt;auto-use&amp;lt;ENTER&amp;gt;&lt;/code&gt; command in REPL (9B), if I want to use this feature and exclude imports from byte count?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;FWIW, an earlier mention of &amp;quot;auto use&amp;quot; can be found &lt;a href=&quot;https://codegolf.stackexchange.com/a/76315/78410&quot;&gt;in this answer&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2020-11-21T07:26:16.513" Title="Byte counting policy for library imports in Factor" Tags="|discussion|policy|code-golf|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20514" PostTypeId="2" ParentId="20512" CreationDate="2020-11-21T07:07:48.230" Score="9" Body="&lt;h2&gt;Do not count extra bytes for using the specific setting, as long as it is &lt;em&gt;actually&lt;/em&gt; runnable with auto-use enabled&lt;/h2&gt;&#xA;&lt;p&gt;I decided to propose a reasonable policy myself. Please comment or add another answer if any of you have opinions or better suggestions.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The existence of the specific &lt;code&gt;.factor-rc&lt;/code&gt; file can be seen as a system-wide setting like APL's index origin. Also, having auto-use enabled on a system is reasonable, since &lt;a href=&quot;https://docs.factorcode.org/content/word-auto-use__que__%2Cparser.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;the feature itself was designed to &amp;quot;help during development&amp;quot;, and the intended use case is to turn it on and load a source file&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;It doesn't look &amp;quot;too much&amp;quot; cheating to a general audience, since Factor is generally quite verbose even after discounting imports (being at a similar level to Java). Adding n bytes for a seemingly obscure reason only confuses the reader who doesn't know Factor.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;But&lt;/strong&gt;, it is an answerer's responsibility to check that the answer &lt;em&gt;actually works&lt;/em&gt; with auto-use. It has a couple of restrictions: it cannot load words from a library that is considered too obscure (e.g. &lt;code&gt;xxx.private&lt;/code&gt; libs), and it cannot load if the word is found in multiple libraries.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If you don't have Factor installed on your machine, you can still check by entering your submission in the code section &lt;a href=&quot;https://tio.run/##qyrO@J@cWKJgp1Cnr5eWmFySX6RblKxgY6Pg6u/GFRrsaqVQkFhUnFqkkFhakq9bWpzKBZKAaSnOLy1KToVqhOr6b6ig9x@kSD@/oEQfIgWl0HX8BwA&quot; rel=&quot;nofollow noreferrer&quot;&gt;on this TIO&lt;/a&gt;. (Make sure the entire code has no stack effect, i.e. &lt;code&gt;( -- )&lt;/code&gt;.) If it runs without error, your submission is valid.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2020-11-21T07:26:16.513" LastActivityDate="2020-11-21T07:26:16.513" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20515" PostTypeId="2" ParentId="2140" CreationDate="2020-11-21T22:44:51.287" Score="1" Body="&lt;h1&gt;Set of subsets without subsubsets&lt;/h1&gt;&#xA;&lt;p&gt;You are given two integers &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;, and are to output a random collection of &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; sets &lt;span class=&quot;math-container&quot;&gt;\$\mathcal A_1,\ldots,\mathcal A_k\$&lt;/span&gt; such that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;each &lt;span class=&quot;math-container&quot;&gt;\$\mathcal A_i\$&lt;/span&gt; is a subset of &lt;span class=&quot;math-container&quot;&gt;\$\{1, 2, \ldots, n\}\$&lt;/span&gt;;&lt;/li&gt;&#xA;&lt;li&gt;no &lt;span class=&quot;math-container&quot;&gt;\$\mathcal A_i\$&lt;/span&gt; is a subset of another &lt;span class=&quot;math-container&quot;&gt;\$\mathcal A_j\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Any collection which satisfies these constraints should have positive probability of being output.&lt;/p&gt;&#xA;&lt;p&gt;Input/output is flexible.&lt;/p&gt;&#xA;&lt;p&gt;You may assume that there exists at least one collection which satisfies the constraint; by &lt;a href=&quot;https://en.wikipedia.org/wiki/Sperner%27s_theorem&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sperner's theorem&lt;/a&gt;, this is equivalent to the condition &lt;span class=&quot;math-container&quot;&gt;\$k\leq \tbinom{n}{\lfloor n/2\rfloor}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Example outputs&lt;/h3&gt;&#xA;&lt;p&gt;The output is random, so these example collections should merely have positive probability of being output.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;| n | k | possible output&#xA;| 2 | 2 | { {1}, {2} }&#xA;| 4 | 3 | { {1}, {2,3}, {3,4} }&#xA;| 4 | 6 | { {1,2}, {1,3}, {1,4}, {2,3}, {2,4}, {3,4} }&#xA;| 5 | 3 | { {1,2,3,4}, {2,5}, {3,5} }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in each language wins.&lt;/p&gt;&#xA;" OwnerUserId="86301" LastActivityDate="2020-11-21T22:44:51.287" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20518" PostTypeId="2" ParentId="2140" CreationDate="2020-11-27T20:20:21.607" Score="2" Body="&lt;h1&gt;Operational countdown&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Posted.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="84844" LastEditorUserId="84844" LastEditDate="2020-12-03T21:17:29.370" LastActivityDate="2020-12-03T21:17:29.370" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20520" PostTypeId="2" ParentId="2140" CreationDate="2020-11-29T22:53:36.240" Score="0" Body="&lt;h1&gt;Use the wrong paradigm&lt;/h1&gt;&#xA;&lt;p&gt;This is just a general idea, I don't know how you would go about scoring it or what the goal would be, but I think it would be fun to see stuff like oop in haskell.&lt;/p&gt;&#xA;" OwnerUserId="98974" LastActivityDate="2020-11-29T22:53:36.240" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20521" PostTypeId="2" ParentId="2140" CreationDate="2020-11-30T08:13:52.710" Score="0" Body="&lt;h1&gt;Perfect radicals&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Posted&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base&amp;#39;&quot; rel=&quot;tag&quot;&gt;base&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/215858/84844&quot;&gt;Perfect radicals&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="84844" LastEditorUserId="84844" LastEditDate="2020-12-01T21:00:47.003" LastActivityDate="2020-12-01T21:00:47.003" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20523" PostTypeId="2" ParentId="2140" CreationDate="2020-12-01T09:34:42.363" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/216000/how-many-battleships-boards-are-there&quot;&gt;Posted to the main forum&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user46773" LastEditorDisplayName="user46773" LastEditDate="2020-12-04T21:14:39.873" LastActivityDate="2020-12-04T21:14:39.873" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20525" PostTypeId="2" ParentId="2140" CreationDate="2020-12-01T19:29:06.337" Score="0" Body="&lt;h2&gt;Golfing on a Budget&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;The Task&lt;/h2&gt;&#xA;&lt;p&gt;Every answer should take a positive number as input, and print/return every number in reverse down to zero (inclusive), in any reasonable format. For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;10    -&amp;gt; &amp;quot;10 9 8 7 6 5 4 3 2 1 0&amp;quot;&#xA;8     -&amp;gt; [8, 7, 6, 5, 4, 3, 2, 1, 0]&#xA;1000  -&amp;gt; [[&amp;quot;1&amp;quot;, &amp;quot;0&amp;quot;, &amp;quot;0&amp;quot;, &amp;quot;0&amp;quot;], [&amp;quot;9&amp;quot;, &amp;quot;9&amp;quot;, &amp;quot;9&amp;quot;], [&amp;quot;9&amp;quot;, &amp;quot;9&amp;quot;, &amp;quot;8&amp;quot;], ...]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;The requirements&lt;/h2&gt;&#xA;&lt;p&gt;Every program has &lt;strong&gt;$100&lt;/strong&gt; to spend.&lt;/p&gt;&#xA;&lt;p&gt;The cost of each byte is determined by &lt;span class=&quot;math-container&quot;&gt;\$2^{t-1}\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt; is the number of times the byte has appeared in previous programs in addition to the current one.&lt;/p&gt;&#xA;&lt;p&gt;For example, assuming it's the first program, &lt;code&gt;x-&amp;gt;x++&lt;/code&gt; would cost $10. Each &lt;code&gt;-&lt;/code&gt; and &lt;code&gt;&amp;gt;&lt;/code&gt; are $1, and each &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;+&lt;/code&gt; are $2.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2020-12-01T19:29:06.337" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20527" PostTypeId="2" ParentId="2140" CreationDate="2020-12-02T16:05:18.753" Score="0" Body="&lt;h2&gt;Play the percussion for Ravel's Boléro&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/music&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;music&amp;#39;&quot; rel=&quot;tag&quot;&gt;music&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/1iNCC.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/1iNCC.jpg&quot; alt=&quot;rhythm&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://youtu.be/CJRE1y5uxOM?t=29&quot; rel=&quot;nofollow noreferrer&quot;&gt;Boléro&lt;/a&gt; by Maurice Ravel is a piece of music characterised by a consistent snare drum pattern, repeated over and over, at unchanging tempo. This task is very challenging for a human performer, who must maintain the beat without rushing the tempo, or increasing the volume too quickly.&lt;/p&gt;&#xA;&lt;p&gt;That's why you're going to write a program to do it!&lt;/p&gt;&#xA;&lt;p&gt;I want your program to do &lt;em&gt;something&lt;/em&gt; at the tempo and rhythm specified. It can output a key to a console, produce a beep, make a window pop up, have a graphical display flash colour; anything at all is acceptable, as long as it is A) observable to a human, and B) does not need human interaction for the program to continue. So if you make a pop-up, you should not require someone to click it away before the next pop-up can appear.&lt;/p&gt;&#xA;&lt;p&gt;Using a tempo of 60 bpm (a bit slow but Ravel liked it played slowly), the whole rhythm takes exactly 6 seconds to play through. Here are the timings for when your program must send out some kind of signal, the unit being seconds. I'll tolerate divergences from the ideal of up to 0.02 seconds in either direction.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0.00&#xA;0.50&#xA;0.67&#xA;0.83&#xA;1.00&#xA;1.50&#xA;1.67&#xA;1.83&#xA;2.00&#xA;2.50&#xA;3.00&#xA;3.50&#xA;3.67&#xA;3.83&#xA;4.00&#xA;4.50&#xA;4.67&#xA;4.83&#xA;5.00&#xA;5.17&#xA;5.33&#xA;5.50&#xA;5.67&#xA;5.83&#xA;6.00&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that here the final beat, at exactly 6 seconds, is the first beat of the next iteration of the rhythm; the next percussion hit occurs at 6.50, then 6.67, and 6.83, etcetera.&lt;/p&gt;&#xA;&lt;p&gt;So, make your program produce that rhythm indefinitely. Choose whatever output you want. It's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code wins!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;For the sandboxers; I have considered using either this question as is, or having it be a popularity contest with added the stipulations that it ends after 170 repetitions and that the output somehow gradually gets &lt;em&gt;intenser&lt;/em&gt; throughout that time, like the music does. The con is that popularity contests are a bit messier; but I would love to see creative ways to display the rhythm.&lt;/p&gt;&#xA;" OwnerUserId="81594" LastEditorUserId="81594" LastEditDate="2020-12-06T20:12:32.033" LastActivityDate="2020-12-06T20:12:32.033" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20528" PostTypeId="1" AcceptedAnswerId="20533" CreationDate="2020-12-03T23:21:43.953" Score="20" ViewCount="622" Body="&lt;p&gt;As far as I can tell, we don't yet have a definitive Meta consensus to the following question:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Are answers allowed to work &amp;quot;in theory&amp;quot; but fail in practice due to floating point issues?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;For example, in &lt;a href=&quot;https://codegolf.stackexchange.com/q/215936/66833&quot;&gt;this&lt;/a&gt; recent question, answers that attempt to find the answer by calculating &lt;span class=&quot;math-container&quot;&gt;\$\sqrt[d]n\$&lt;/span&gt; will fail due to floating point errors calculating (for example) &lt;span class=&quot;math-container&quot;&gt;\$\sqrt[3]{125} = 4.99999991\$&lt;/span&gt; rather than &lt;span class=&quot;math-container&quot;&gt;\$5\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14407/66833&quot;&gt;This&lt;/a&gt; is a similar question that instead asks &lt;em&gt;how&lt;/em&gt; a challenge should allow floating point imprecision, but doesn't answer whether or not it should be allowed as default.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2020-12-16T00:14:50.923" Title="What is our consensus on floating point issues?" Tags="|discussion|policy|defaults|" AnswerCount="5" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20529" PostTypeId="2" ParentId="20528" CreationDate="2020-12-03T23:21:43.953" Score="16" Body="&lt;h2&gt;Yes, answers can fail due to floating point issues&lt;/h2&gt;&#xA;&lt;p&gt;So long as the algorithm/mathematics/logic behind an answer can be proven correct, it doesn't matter if the implementation fails due to the limitations of computers and programming languages. For the example question, answers that fail because of the miscalculation in &lt;span class=&quot;math-container&quot;&gt;\$\sqrt[3]{125}\$&lt;/span&gt; are still acceptable, so long as they fail because of the floating point error.&lt;/p&gt;&#xA;&lt;p&gt;This is in line with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18197/66833&quot;&gt;our policy&lt;/a&gt; that answers may fail for numbers outside the bounds of their language, so long as they work in theory for all inputs&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2020-12-03T23:21:43.953" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20530" PostTypeId="2" ParentId="20528" CreationDate="2020-12-03T23:53:54.273" Score="0" Body="&lt;h2&gt;No, answers cannot fail due to floating point issues&lt;/h2&gt;&#xA;&lt;p&gt;In some challenges it may be necessary for the author to override the defaults, but in many cases it is possible to avoid floating point issues using a different algorithm or workaround.&lt;/p&gt;&#xA;&lt;p&gt;The goal of code golf is to make the shortest program that performs the task. Our consensus is that languages are defined by their implementations, rather than how they should theoretically behave.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2020-12-03T23:53:54.273" CommentCount="4" CommunityOwnedDate="2020-12-04T10:30:25.117" ContentLicense="CC BY-SA 4.0" />
  <row Id="20531" PostTypeId="1" CreationDate="2020-12-04T03:20:52.403" Score="14" ViewCount="510" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19271/16766&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout December 2020, our Language of the Month, nominated by myself (Technohacker, a.k.a K3v1n) will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Rust&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;What's a Language of the Month?&lt;/p&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/16766&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during December, those who wish to participate should learn (at least the basics of) Rust, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about Rust&lt;/h2&gt;&#xA;&lt;p&gt;Verbatim from their homepage:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A language empowering everyone to build reliable and efficient software.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;It may not be a language built for golfing, but it'll surely be interesting to see it being used as such!&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It's a language designed to prevent memory-unsafe operations at compile time, to the point where (using safe Rust), &amp;quot;If it compiles cleanly, it's memory-safe&amp;quot;. It does so by employing move semantics and references tagged with lifetimes, which also leads to writing programs that don't require a garbage collector&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;As a welcome side effect from its memory safety, Rust programs can easily be parallelized due to data-races being eliminated&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It has a robust type system (which is interestingly also Turing complete provided limits are removed, similar to Prolog) which handles null using an Option type and program exceptions with a Result type, forcing exceptions to be handled explicitly&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It has a very consistent toolkit, with cargo managing dependencies and working as a build, test, benchmark and documentation system, clippy providing suggestions to help Rustaceans of any experience level write idiomatic Rust, and more&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It has excellent documentation and ensures examples provided in docs are tested as part of the test suite&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It can run on a variety of environments, all the way from bare metal to WebAssembly&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It has zero-cost implementations of iterators and asynchronous programming&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Resources&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Rust_(programming_language)&quot; rel=&quot;nofollow noreferrer&quot;&gt;General information about Rust the language&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.rust-lang.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Rust home page&lt;/a&gt; and &lt;a href=&quot;https://doc.rust-lang.org/book/&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Rust Book&lt;/a&gt;, a first-principles introduction to the language&lt;/li&gt;&#xA;&lt;li&gt;Documentation for &lt;a href=&quot;https://doc.rust-lang.org/std/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;the std crate&lt;/a&gt;, describing the language with detailed descriptions&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#rust&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/74096/tips-for-golfing-in-rust&quot;&gt;Golfing tips&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Bounty&lt;/h3&gt;&#xA;&lt;p&gt;Answers in Rust will be eligible for a bounty of 50 rep if you have not posted an answer in Rust before. Sorry, but if it's a question that I (&lt;a href=&quot;https://codegolf.stackexchange.com/users/95792/user&quot;&gt;user&lt;/a&gt;) have already answered, I'll only award the bounty to an exceptional answer, since it starts at 100 rep.&lt;/p&gt;&#xA;" OwnerUserId="78468" LastEditorUserId="68942" LastEditDate="2021-01-01T17:24:30.663" LastActivityDate="2021-01-01T17:24:30.663" Title="Language of the month for December 2020: Rust" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20532" PostTypeId="2" ParentId="20528" CreationDate="2020-12-04T04:21:08.807" Score="-6" Body="&lt;h2&gt;It depends on the type of the result.&lt;/h2&gt;&#xA;&lt;p&gt;If that's strictly an integer what we require then we shouldn't accept floating point errors.&lt;br /&gt;&#xA;If it's not an integer but a general value then there may be a relative error and we have to specify it.&lt;/p&gt;&#xA;" OwnerUserId="84844" LastActivityDate="2020-12-04T04:21:08.807" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20533" PostTypeId="2" ParentId="20528" CreationDate="2020-12-04T06:16:19.960" Score="24" Body="&lt;h2&gt;No default; require all relevant challenges to explicitly state what to do with floating-point errors&lt;/h2&gt;&#xA;&lt;p&gt;By relevant, I mean the challenges where a theoretically valid algorithm involves floating-point numbers in the middle of computation. Even if the expected result is an integer, a square root (or any non-integer power) in many languages is likely to return a float. And then there's a whole array of functions that have no choice but return floats (unless your language is a CAS).&lt;/p&gt;&#xA;&lt;p&gt;Allowing or disallowing such functions (and intermediate floating point values) has a huge consequence in code golf, to the point that I could say it &lt;em&gt;defines&lt;/em&gt; the actual challenge. If the challenge author wants the answer to be exact in all cases, they should be explicit on that. If the challenge author is more lenient and feels fine with an answer that fails due to floating-point errors, they should be explicit on that too.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2020-12-04T06:16:19.960" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="20534" PostTypeId="2" ParentId="20531" CreationDate="2020-12-04T07:40:53.223" Score="2" Body="&lt;h1&gt;List of all Rust solutions posted in December 2020&lt;/h1&gt;&#xA;&lt;p&gt;(First time posters highlighted in bold)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/215883/quickly-group-together/215977#215977&quot;&gt;Quickly! Group together!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/55934/niedzejkob&quot;&gt;NieDzejkob&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/215991/95792&quot;&gt;Zero the byte (eventually)&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/95792/user&quot;&gt;user&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/216155/95792&quot;&gt;Parity of Nth Term in Fibonacci Integer Sequences&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792/user&quot;&gt;user&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/216215/95792&quot;&gt;Follow a linked list&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792/user&quot;&gt;user&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/216224/95792&quot;&gt;Give the smallest number that has N divisors&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792/user&quot;&gt;user&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/216267/95792&quot;&gt;Recamán's duplicates&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792/user&quot;&gt;user&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/216710/97691&quot;&gt;Plastic Number&lt;/a&gt; by Aiden4&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr&gt;&#xA;&lt;h1&gt;List of all Rust tips posted in December 2020&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/215982/97691&quot;&gt;Use &lt;code&gt;?&lt;/code&gt; to unwrap infallible results&lt;/a&gt; by Aiden4&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;tip title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;List of Rust-related challenges posted in December 2020&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/216923/95792&quot;&gt;I don't like curry&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792/user&quot;&gt;user&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/q/&amp;lt;question-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="80214" LastEditorUserId="95792" LastEditDate="2020-12-29T20:43:27.490" LastActivityDate="2020-12-29T20:43:27.490" CommentCount="2" CommunityOwnedDate="2020-12-04T08:48:30.033" ContentLicense="CC BY-SA 4.0" />
  <row Id="20535" PostTypeId="1" AcceptedAnswerId="20537" CreationDate="2020-12-07T15:13:43.187" Score="6" ViewCount="197" Body="&lt;p&gt;Recently there's been a bit of a &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/56357299#56357299&quot;&gt;discussion&lt;/a&gt; in chat about &lt;a href=&quot;https://codegolf.stackexchange.com/q/6781/79857&quot;&gt;this&lt;/a&gt; challenge. It was put into the close vote queue as unclear, with the main reason being that it didn't state the winning criterion in the question (though it was tagged as code golf).&lt;/p&gt;&#xA;&lt;p&gt;The requirement to include a description of the winning criterion comes from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13091/46076&quot;&gt;this meta consensus&lt;/a&gt;, and there seem to be two different viewpoints regarding how it should be interpreted:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Questions which do not state the winning criterion in the question, where the author's intent is clear, should be closed&lt;/li&gt;&#xA;&lt;li&gt;Questions which do not state the winning criterion in the question, where the author's intent is clear, should be directly edited&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This question isn't about handling questions &lt;em&gt;without&lt;/em&gt; an objective winning criterion, just ones where there is no explicit explanation of it in the challenge.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="66833" LastEditDate="2020-12-07T16:13:54.943" LastActivityDate="2020-12-07T20:09:32.087" Title="How to deal with questions that do not explain their winning criterion?" Tags="|discussion|winning-criteria|etiquette|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20536" PostTypeId="2" ParentId="20535" CreationDate="2020-12-07T15:13:43.187" Score="2" Body="&lt;h2&gt;These questions should be directly edited&lt;/h2&gt;&#xA;&lt;p&gt;If a challenge is tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the author's intent is clear. Unless they go out of their way to change the meaning of code golf, which would constitute an explanation of the winning criterion, it can be assumed to be the default.&lt;/p&gt;&#xA;&lt;p&gt;There are three outcomes that can come from closing the question:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The author is still active on the site, and edits it&lt;/li&gt;&#xA;&lt;li&gt;The author is no longer active on the site, and somebody else edits it&lt;/li&gt;&#xA;&lt;li&gt;The author is no longer active on the site, and it stays closed&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;In the first case and second case, the results are almost always going to be the same as directly editing. If the author tagged the question as code golf, it's pretty likely they intended for the default code golf scoring to apply.&lt;/p&gt;&#xA;&lt;p&gt;If the author does not include the explanation, it's also likely that they are a new user. Even though it is temporary, having a question closed over something small can be very demoralizing, especially if it is otherwise a good question.&lt;/p&gt;&#xA;&lt;p&gt;Finally, the main reason for the current meta consensus is so that new users understand what code golf means. It doesn't say anything about closing, as it doesn't say that those questions are unclear.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2020-12-07T15:13:43.187" CommentCount="0" CommunityOwnedDate="2020-12-07T15:13:43.187" ContentLicense="CC BY-SA 4.0" />
  <row Id="20537" PostTypeId="2" ParentId="20535" CreationDate="2020-12-07T15:24:39.880" Score="9" Body="&lt;h1&gt;Edit if obvious, close if not&lt;/h1&gt;&#xA;&lt;p&gt;...and by obvious, I more or less mean &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, as, off the top of my head, I cannot think of any other criteria tag that’s so universally scored.&lt;/p&gt;&#xA;&lt;p&gt;If a question is tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, 99 times out of 100, it means that the shortest code in bytes wins. Older posts may have scored by characters rather than bytes, but the general rule now is bytes, so it’s a good default. If a question is tagged with code golf and doesn’t explicitly state the winning criteria in the question, I’d recommend editing in&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest code in bytes wins&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;unless anything in the question would contradict this (for example, some older challenges have &amp;quot;the shortest, fastest code wins&amp;quot;, or require you to count specific characters/bytes differently).&lt;/p&gt;&#xA;&lt;p&gt;For any other winning criteria, you need clarification. So if a challenge is tagged with (for example) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; and contains no winning criteria or details on how to score answers, vote to close it as off-topic and without a winning criteria (or unclear if there is an objective criteria, but it's lacking in a couple of key areas).&lt;/p&gt;&#xA;&lt;p&gt;Sometimes (primarily with older challenges or by new users), a challenge will contain 2 winning criteria, especially in the tags. If this is the case, I would suggest removing the &amp;quot;wrong&amp;quot; tag if the question explicitly states one as the winning criteria (e.g. &amp;quot;shortest code wins&amp;quot; but is tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;. In this case, remove &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;). If it isn't clear which is intended, vote to close as unclear.&lt;/p&gt;&#xA;&lt;p&gt;Finally, if the criteria is &lt;em&gt;not&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, but the challenge author includes a partial description of how to score without being fully complete, I would say that editing is acceptable, but treat carefully, and consider VTCing instead, as you may miss the original intent of the author&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;If the challenge author is still around, I would suggest asking for clarification in the comments first before doing either of these things. While they're both reversible, both (and especially closing) can discourage a challenge author. You can check how active a user is by navigating to their user profile (by clicking on their username) and checking the side bar. Obviously, if not clarified within a couple of days, edit and vote away.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2020-12-07T20:09:32.087" LastActivityDate="2020-12-07T20:09:32.087" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20540" PostTypeId="2" ParentId="20528" CreationDate="2020-12-09T21:39:44.773" Score="-2" Body="&lt;h1&gt;No*. Challenges should specify precision requirements.&lt;/h1&gt;&#xA;&lt;p&gt;Challenges that operate with real numbers should include explicit precision requirements- and do so with floats in mind. Unless you have a good reason to require very high precision, you should specify a standard that is well within reason for single-precision floating point numbers, e.g. +/- 0.001 for numbers between -10,000 and 10,000.&lt;/p&gt;&#xA;&lt;h2&gt;What about other representations of real numbers?&lt;/h2&gt;&#xA;&lt;p&gt;Answers should have the freedom to use different representations of numbers. If you specify that an answer can fail due to machine precision, that opens new questions for other representations that have just as much capability to fail. What if I use a half-precision float? What about fractions? Decimal floats? Fixed-point numbers? What standards are these representations held to? What happens when you introduce irrational numbers?&lt;/p&gt;&#xA;&lt;h2&gt;Extremes&lt;/h2&gt;&#xA;&lt;p&gt;In a comically extreme example, you could implement a solution in such a way that it always returns 0 due to floating point errors even though the math is &lt;em&gt;theoretically&lt;/em&gt; correct. It goes against the spirit of solving a challenge if the answer is always wildly incorrect.&lt;/p&gt;&#xA;&lt;h2&gt;When integers are expected&lt;/h2&gt;&#xA;&lt;p&gt;Regarding situations like the referenced challenge, the challenge creator should make this expectation explicit as well. And yes, I think this is a valid thing to expect.&lt;/p&gt;&#xA;&lt;p&gt;There are cases where a floating point result of a calculation could be &lt;em&gt;close enough&lt;/em&gt; to an integer (but not exactly an integer, for instance &lt;span class=&quot;math-container&quot;&gt;\$995207\pi = 3126535.0000011\$&lt;/span&gt;) to get erroneously rounded to an integer. It is the answerer's responsibility to prove that a floating point error of integer rounding is nevertheless correct for &lt;em&gt;all possible inputs&lt;/em&gt; or otherwise work around floating point limitations. Since each individual operation on a float can lose precision, these kinds of almost integers can erroneously become integers and violate the integer precision expectation.&lt;/p&gt;&#xA;&lt;p&gt;Integers can be held to a much higher standard than floats because they are discrete by their very nature and discrete is what computers excel at.&lt;/p&gt;&#xA;&lt;h2&gt;*Opting in is fine&lt;/h2&gt;&#xA;&lt;p&gt;Challenge writers should still have the option to allow answers to fail due to floating point issues as long as they explicitly state it, but should avoid doing so without a good reason.&lt;/p&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2020-12-16T00:14:50.923" LastActivityDate="2020-12-16T00:14:50.923" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20542" PostTypeId="2" ParentId="2140" CreationDate="2020-12-10T06:37:06.870" Score="1" Body="&lt;h1&gt;The Slices Puzzle Puzzle&lt;/h1&gt;&#xA;&lt;h1&gt;Background&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://slices.ovh/?puzzles&quot; rel=&quot;nofollow noreferrer&quot;&gt;Slices&lt;/a&gt; is a puzzle game. Placed on a 2d map is a set of islands; possibly just a single island. Placed on each island is a set of points. The task is to draw a number of &lt;strong&gt;straight&lt;/strong&gt; lines across the islands such that no point can be reached from another without crossing one of the drawn lines, or leaving an island. In other words, you partition the points with lines such that each partition contains at most one point on each island. For each level, you are given a maximum number of lines that can be drawn.&lt;/p&gt;&#xA;&lt;p&gt;In the game illustrated below, drawing a straight line between the first and second row of points, and then a line between the second and third row of points, would create a valid partition of points.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/X6mBy.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/X6mBy.png&quot; alt=&quot;Game illustration&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to write a solver for this game. The solver takes as input a set of islands, the set of points for each island plus the maximum number of lines which can be drawn. The input and output may be represented in any way, and the input may be hard-coded. Hard-coded input must show that your solution is sufficiently general. Any format will be accepted. For instance, you might implement this as a linear programme in the CPLEX format -- I haven't verified that this is possible -- or you might write some sort of brute force solution in in an imperative language. Maybe some other declarative solution works even more nicely.&lt;/p&gt;&#xA;&lt;h1&gt;Grading&lt;/h1&gt;&#xA;&lt;p&gt;Solutions will be judged by popularity. Things such as number of bytes in the solution, computational complexity (justify this if you want) and elegance could be considered.&lt;/p&gt;&#xA;" OwnerUserId="8681" LastEditorUserId="8681" LastEditDate="2020-12-10T11:05:23.833" LastActivityDate="2020-12-10T11:05:23.833" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="20544" PostTypeId="1" CreationDate="2020-12-11T15:47:37.260" Score="2" ViewCount="100" Body="&lt;p&gt;I recently created the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/infinite-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;infinite-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;infinite-output&lt;/a&gt; tag for my newest challenge. After a &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/56403345#56403345&quot;&gt;discussion in chat&lt;/a&gt;, there's a bit of disagreement on whether it's needed.&lt;/p&gt;&#xA;&lt;p&gt;Here are some questions I think the tag would apply to:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/13152/shortest-code-to-produce-infinite-output?r=SearchResults&amp;amp;s=1%7C47.5010&quot;&gt;Shortest code to produce infinite output&lt;/a&gt; (For obvious reasons)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/62732/implement-a-truth-machine&quot;&gt;Implement a truth machine&lt;/a&gt; (debatable because it only requires infinite output sometimes)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/216196/follow-a-linked-list&quot;&gt;Follow a linked list&lt;/a&gt; (the original question I added it to)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/215216/high-throughput-fizz-buzz&quot;&gt;High throughput Fizz Buzz&lt;/a&gt; (to demonstrate that many applicable questions don't simply include the text &lt;code&gt;infinite&lt;/code&gt; or &lt;code&gt;infinite output&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Any thoughts?&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2020-12-11T18:54:01.700" Title="Proposal for tag: [infinite-output]" Tags="|discussion|tags|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20545" PostTypeId="2" ParentId="20544" CreationDate="2020-12-11T15:55:00.247" Score="2" Body="&lt;h2&gt;I think this is a useful tag&lt;/h2&gt;&#xA;&lt;p&gt;Here are my reasons for making the tag in the first place:&lt;/p&gt;&#xA;&lt;p&gt;The purpose of tags is to make it easier to find (or ignore) questions involving a specific topic or type of task. The main argument against the tag that I received was that it wouldn't apply to more than maybe ten questions. I disagree.&lt;/p&gt;&#xA;&lt;p&gt;There are quite a few questions involving infinite output that don't include &lt;code&gt;infinite output&lt;/code&gt;, so trying to search for them conventionally won't work. This makes it seem like there are fewer applicable questions than there likely are (including the original question I tagged with it). It also gives the tag a good use, since finding related questions is difficult.&lt;/p&gt;&#xA;&lt;p&gt;Infinite output is a much more common type of challenge than, say, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/box-256&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;box-256&amp;#39;&quot; rel=&quot;tag&quot;&gt;box-256&lt;/a&gt;, and it's definitely possible that someone could be searching specifically for infinite output challenges. I see no downside to having the tag.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2020-12-11T15:55:00.247" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20546" PostTypeId="2" ParentId="20544" CreationDate="2020-12-11T18:54:01.700" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/infinite-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;infinite-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;infinite-output&lt;/a&gt; is too specific&lt;/h1&gt;&#xA;&lt;p&gt;Such a tag would be covered by a more general tag, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/infinite-runtime&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;infinite-runtime&amp;#39;&quot; rel=&quot;tag&quot;&gt;infinite-runtime&lt;/a&gt;* which would imply that answers to tagged challenges shouldn't ever stop running (ignoring minor complications such as the heat death of the universe etc.).&lt;/p&gt;&#xA;&lt;p&gt;For example, answers to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/101289/loading-forever&quot;&gt;Loading... Forever&lt;/a&gt; arguably do not have an infinite output, yet the question says&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Your program should be able to run indefinitely&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Similar challenges such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/62732/implement-a-truth-machine&quot;&gt;Implement a Truth-Machine&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/59347/shortest-infinite-loop-producing-no-output&quot;&gt;Shortest infinite loop producing no output&lt;/a&gt; which would be edge cases (or not even covered) by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/infinite-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;infinite-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;infinite-output&lt;/a&gt; would fall under this tag, and, as far as I can tell, we don't have anything that already superseeds or covers this specific tag.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/search?tab=votes&amp;amp;q=%22forever%22%20is%3aq%20-%5btips%5d%20closed%3ano&quot;&gt;This&lt;/a&gt; is a (non-perfect) search for all 118 open, non-tips challenges that include the word &amp;quot;forever&amp;quot; in the spec. Obviously not all of these will be covered by this tag, but a substantial number would.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;* There's been &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/56405676#56405676&quot;&gt;some discussion&lt;/a&gt; in TNB for what this tag would be called. Feel free to comment suggestions that you think would be better&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2020-12-11T18:54:01.700" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20547" PostTypeId="5" CreationDate="2020-12-11T22:38:19.650" Score="0" Body="&lt;p&gt;This tag is to be used on questions that relate in some way to the Stack Exchange feature of &lt;a href=&quot;https://meta.stackexchange.com/questions/5234/how-does-accepting-an-answer-work&quot;&gt;accepting an answer&lt;/a&gt;. Note that we generally &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8363/66833&quot;&gt;discourage accepting answers&lt;/a&gt;, especially on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges.&lt;/p&gt;&#xA;&lt;p&gt;Questions with this tag should generally be about one or more of the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Specific accepted answers&lt;/li&gt;&#xA;&lt;li&gt;Etiquette around accepting answers&lt;/li&gt;&#xA;&lt;li&gt;Advice or help to do with accepting or accepted answers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2020-12-11T22:38:19.650" LastActivityDate="2020-12-11T22:38:19.650" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20548" PostTypeId="4" CreationDate="2020-12-11T22:38:19.650" Score="0" Body="For questions about accepted answers, etiquette around accepting answers and other related questions. Note that informal site policy is to avoid accepting an answer, especially on code golf challenges" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2020-12-11T22:38:19.650" LastActivityDate="2020-12-11T22:38:19.650" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20550" PostTypeId="2" ParentId="2140" CreationDate="2020-12-14T03:33:45.157" Score="2" Body="&lt;h1&gt;A Snake, A Camel And A Kebab.&lt;/h1&gt;&#xA;&lt;p&gt;As many of you will know, almost every programming language has a standard casing system; unfortunately, we have not been able to agree on a singular system to use and now must frequently switch between camelCase, snake_case and kebab-case.&lt;/p&gt;&#xA;&lt;p&gt;Now I know what you're thinking... wouldn't it be nice if we had a program that could convert from one casing to another?&lt;br /&gt;&#xA;Well - soon we're going to have plenty!!! &lt;em&gt;(This is where you come in)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;You're job is to write a program/function that will take an input string, and a casing system. It will then print/return the converted string.&lt;/p&gt;&#xA;&lt;h3&gt;Inputs:&lt;/h3&gt;&#xA;&lt;p&gt;You're program will receive two inputs, an alphabetic string that is to be converted and a string that &lt;strong&gt;will always&lt;/strong&gt; be one of &lt;code&gt;kebab&lt;/code&gt; &lt;code&gt;camel&lt;/code&gt; or &lt;code&gt;snake&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Outputs:&lt;/h3&gt;&#xA;&lt;p&gt;You're program should output a string that conforms to the new casing if it is possible. If the input string was invalid, and had mixed casing, you're program should print/do nothing.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases:&lt;/h2&gt;&#xA;&lt;p&gt;Valid Examples:&lt;br /&gt;&#xA;&lt;code&gt;&amp;quot;aJavaVariable&amp;quot;, &amp;quot;snake&amp;quot; = &amp;quot;a_java_variable&amp;quot;&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;&amp;quot;a_python_variable&amp;quot;, &amp;quot;kebab&amp;quot; = &amp;quot;a-python-variable&amp;quot;&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;&amp;quot;golf&amp;quot;, &amp;quot;camel&amp;quot; = &amp;quot;golf&amp;quot;&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;&amp;quot;&amp;quot;, &amp;quot;snake&amp;quot; = &amp;quot;&amp;quot;&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;&amp;quot;doHTMLRequest&amp;quot;, &amp;quot;kebab&amp;quot; = &amp;quot;do-h-t-m-l-request&amp;quot;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Invalid Examples (&lt;em&gt;no output&lt;/em&gt;):&lt;br /&gt;&#xA;&lt;code&gt;&amp;quot;an_InvalidName&amp;quot;, &amp;quot;kebab&amp;quot;&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;&amp;quot;invalid-inPut_bad&amp;quot;, &amp;quot;camel&amp;quot;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Additional Info:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;As most programming languages prefer lowercase variable names, you should convert all letters to lowercase unless it is needed to be upper case for camel casing.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a duplicate? I couldn't find any quite like it.&lt;/li&gt;&#xA;&lt;li&gt;Are the rules clear?&lt;/li&gt;&#xA;&lt;li&gt;Would it lead to more creative answers if I remove the possibility of being given invalid input, and assume all input will be valid?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97730" LastActivityDate="2020-12-14T03:33:45.157" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20551" PostTypeId="2" ParentId="2140" CreationDate="2020-12-14T04:53:41.163" Score="0" Body="&lt;h1&gt;Simon says &amp;quot;Make me a game&amp;quot;&lt;/h1&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Forked from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/25014/create-a-simon-clone&quot;&gt;this closed question.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Create a &amp;quot;Simon says&amp;quot; game.&lt;/p&gt;&#xA;&lt;p&gt;Take an input &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, for number of levels, and &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;, for number of buttons and do the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Create a square area for the buttons.(at least 100x100 pixels in size.)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Divide it into k rectangular buttons of equal size. k will always be even.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each button should be of a different color, and none of them should be the same color as the background.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The game should proceed as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Starting level is 1. Level number should be displayed at the top.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Get a random order in which the buttons should &amp;quot;light up&amp;quot;. The number of clicks should be level number + 4.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In that same sequence, display a visual indicator on each button, so the user knows what order they should click the buttons in.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There should be at least a 200ms delay between each visual indication.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the user clicks them in the correct order, move on to the next level, and repeat the above steps. Otherwise, display &amp;quot;Game Over&amp;quot; at the bottom of the screen.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://www.dantonag.it/miniSimon.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here is a playable demo for k=4&lt;/a&gt;, Courtesy of &lt;a href=&quot;https://codegolf.stackexchange.com/users/8685/gabriele-dantona&quot;&gt;Gabriele D'Antona&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Is this specification clear?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Any thoughts/feedback?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Should there be a limit on the values of n and k?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="80214" LastActivityDate="2020-12-14T04:53:41.163" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20552" PostTypeId="2" ParentId="2140" CreationDate="2020-12-14T18:28:28.703" Score="7" Body="&lt;h1&gt;Possible binaries&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base-conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; rel=&quot;tag&quot;&gt;base-conversion&lt;/a&gt; &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This challenge is inspired by the AoC 2020, &lt;a href=&quot;https://adventofcode.com/2020/day/14#part2&quot; rel=&quot;nofollow noreferrer&quot;&gt;Day 14 - Part II&lt;/a&gt;, created by &lt;a href=&quot;https://twitter.com/ericwastl&quot; rel=&quot;nofollow noreferrer&quot;&gt;Eric Wastl&lt;/a&gt; and &lt;a href=&quot;https://adventofcode.com/2020/about&quot; rel=&quot;nofollow noreferrer&quot;&gt;his team&lt;/a&gt;, which asks to output the possible binary values from a bitmask.&lt;/p&gt;&#xA;&lt;p&gt;Let's say we've a bitmask like &lt;code&gt;&amp;quot;10X0X0&amp;quot;&lt;/code&gt;, then we've to find the possible binary values that can be generated by replacing an &lt;code&gt;X&lt;/code&gt; with either &lt;code&gt;0&lt;/code&gt; or &lt;code&gt;1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;So, the possible binaries are &lt;code&gt;[&amp;quot;100000&amp;quot;, &amp;quot;100010&amp;quot;, &amp;quot;101000&amp;quot;, &amp;quot;101010&amp;quot;]&lt;/code&gt;.&lt;br /&gt;&#xA;When each of them are converted in decimal, then these are &lt;code&gt;[32, 34, 40, 42]&lt;/code&gt; respectively.&lt;br /&gt;&#xA;And, finally the sum is &lt;code&gt;148&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;INPUT: &amp;quot;X&amp;quot;&#xA;[&amp;quot;0&amp;quot;, &amp;quot;1&amp;quot;]&#xA;[0, 1]&#xA;OUTPUT: 1&#xA;&#xA;INPUT: &amp;quot;0&amp;quot;&#xA;OUTPUT: 0&#xA;&#xA;INPUT: &amp;quot;1&amp;quot;&#xA;OUTPUT: 1&#xA;&#xA;INPUT: &amp;quot;1X0&amp;quot;&#xA;[&amp;quot;100&amp;quot;, &amp;quot;110&amp;quot;]&#xA;[4, 6]&#xA;OUTPUT: 10&#xA;&#xA;INPUT: &amp;quot;1X0X1&amp;quot;&#xA;[&amp;quot;10001&amp;quot;, &amp;quot;10011&amp;quot;, &amp;quot;11001&amp;quot;, &amp;quot;11011&amp;quot;]&#xA;[17, 19, 25, 27]&#xA;OUTPUT: 88&#xA;&#xA;INPUT: &amp;quot;X0X0X0X&amp;quot;&#xA;[&amp;quot;0000000&amp;quot;, &amp;quot;0000001&amp;quot;, &amp;quot;0000100&amp;quot;, &amp;quot;0000101&amp;quot;, &amp;quot;0010000&amp;quot;, &amp;quot;0010001&amp;quot;, &amp;quot;0010100&amp;quot;, &amp;quot;0010101&amp;quot;, &#xA;&amp;quot;1000000&amp;quot;, &amp;quot;1000001&amp;quot;, &amp;quot;1000100&amp;quot;, &amp;quot;1000101&amp;quot;, &amp;quot;1010000&amp;quot;, &amp;quot;1010001&amp;quot;, &amp;quot;1010100&amp;quot;, &amp;quot;1010101&amp;quot;]&#xA;[0, 1, 4, 5, 16, 17, 20, 21, 64, 65, 68, 69, 80, 81, 84, 85]&#xA;OUTPUT: 680&#xA;&#xA;INPUT: &amp;quot;1X1X1X1X1X1X1X1X1X1X1&amp;quot;&#xA;OUTPUT: 1789569024&#xA;&#xA;INPUT: &amp;quot;1X01X01X01X01X01X01X01X01X01X01X01X0&amp;quot;&#xA;OUTPUT: 201053554790400&#xA;&#xA;INPUT: &amp;quot;X000X000X000X000X000X000X000X000X000X000X000X000&amp;quot;&#xA;OUTPUT: 307445734561824768&#xA;&#xA;INPUT: &amp;quot;101&amp;quot;&#xA;[&amp;quot;101&amp;quot;]&#xA;[5]&#xA;OUTPUT: 5&#xA;&#xA;INPUT: &amp;quot;XXX&amp;quot;&#xA;[&amp;quot;000&amp;quot;, &amp;quot;001&amp;quot;, &amp;quot;010&amp;quot;, &amp;quot;011&amp;quot;, &amp;quot;100&amp;quot;, &amp;quot;101&amp;quot;, &amp;quot;110&amp;quot;, &amp;quot;111&amp;quot;]&#xA;[0, 1, 2, 3, 4, 5, 6, 7]&#xA;OUTPUT: 28&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is guaranteed that &lt;span class=&quot;math-container&quot;&gt;\$ 0 \leq \text{count}(X) \leq 12 \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$ 1 \leq \text{length}(mask) \leq 48 \$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Input can be either a string, or an array of chars (non-empty).&lt;/li&gt;&#xA;&lt;li&gt;Output will be the sum of the binaries in decimal.&lt;/li&gt;&#xA;&lt;li&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so fewest bytes will win!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the challenge's text clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Is the constraint on count of X sufficient?&lt;/li&gt;&#xA;&lt;li&gt;Although I've tried a search, but is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Any suggestions/improvements in the attribution?&lt;/li&gt;&#xA;&lt;li&gt;Any tricky test case?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="83605" LastEditorUserId="83605" LastEditDate="2020-12-15T02:49:52.177" LastActivityDate="2020-12-15T02:49:52.177" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20554" PostTypeId="2" ParentId="2140" CreationDate="2020-12-16T13:11:27.223" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/216555/animal-alphabetical-sequence&quot;&gt;Animal-Alphabetical Sequence&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="99312" LastEditorUserId="66833" LastEditDate="2020-12-21T20:45:33.360" LastActivityDate="2020-12-21T20:45:33.360" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20555" PostTypeId="2" ParentId="2140" CreationDate="2020-12-17T07:18:12.797" Score="2" Body="&lt;h1&gt;How Many Atoms?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chemistry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chemistry&amp;#39;&quot; rel=&quot;tag&quot;&gt;chemistry&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/216723/how-many-atoms&quot;&gt;Post&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2020-12-21T22:02:23.937" LastActivityDate="2020-12-21T22:02:23.937" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20556" PostTypeId="2" ParentId="8047" CreationDate="2020-12-18T16:07:25.050" Score="9" Body="&lt;h1&gt;Requiring time limits&lt;/h1&gt;&#xA;&lt;p&gt;This may differ depending on your opinion, as quite a lot of challenges have time restrictions, but, for me, this is a form of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8928/66833&quot;&gt;requiring a minimum score&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If a challenge is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, unless the &lt;em&gt;specific&lt;/em&gt; goal of the challenge is to do the task quickly, adding a time limit simply prevents people from posting good answers and adds nothing positive to the challenge. Older challenges are more guilty of this, but occasionally a new challenge will be posted requiring answers to finish within X minutes.&lt;/p&gt;&#xA;&lt;p&gt;A lot of challenges that contain a time limit often do so in an attempt to make the challenge more interesting. Banning specific builtins, classes of languages or other arbitrary things has been repeatedly shown to not make a challenge more interesting (see the other answers in this thread), so requiring answers to meet a specific time limit is unlikely to as well.&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, timing is non-perfect. What takes 5 seconds on one computer may take 50 on another. That's why we require specifications to be provided for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, otherwise it's no longer objective. &lt;a href=&quot;https://tio.run&quot; rel=&quot;nofollow noreferrer&quot;&gt;TryItOnline&lt;/a&gt; has a time limit of one minute, so could possibly be used for such a time restriction. However Dennis - the host of TIO - has said repeatedly that TIO isn't reliable enough for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, and so probably isn't accurate enough for time limits.&lt;/p&gt;&#xA;&lt;p&gt;The worst culprits in my experience are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8214/66833&quot;&gt;chameleon challenges&lt;/a&gt;, which detail an inefficient algorithm/method to complete the task, then all but outlaw that method by requiring answers to meet a time limit (see a lot of the older &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt; challenges for example)&lt;/p&gt;&#xA;&lt;p&gt;Obviously, this is a matter of opinion; some people prefer to see solutions finish, others don't mind. However, when considering adding in a time limit, ask yourself if it actually improves the challenge or just prevents otherwise valid answers from being posted.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;As an aside, this isn’t to say that you should never include a time limit. Challenges where the sole aim is to “Do this thing quickly and golfy” are the main areas where a time limit works. Challenges where the aim is “Do this thing golfy. Oh and make sure you choose an algorithm that isn’t too slow” are a poor idea. Instead, look into either &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, or consider using an asymptotic complexity limit, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt;, which is much more objective.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2020-12-19T14:15:13.710" LastActivityDate="2020-12-19T14:15:13.710" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="20557" PostTypeId="2" ParentId="2140" CreationDate="2020-12-21T17:00:48.003" Score="4" Body="&lt;h1&gt;Strobogrammatic Numbers&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Definition&lt;/h3&gt;&#xA;&lt;p&gt;A number which is rotationally symmetrical, i.e., it'll appear the same when rotated by 180 deg in the plane of your screen. The following figure illustrates it better,&lt;/p&gt;&#xA;&lt;br&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://www.w3resource.com/w3r_images/java-basic-image-exercise-186.png&quot; alt=&quot;strobogrammatic-number&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;(source: w3resource.com)&lt;/p&gt;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&lt;p&gt;Given a number as the input, determine if it's strobogrammatic or not.&lt;/p&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Truthy&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;8&#xA;0&#xA;69&#xA;96&#xA;69169&#xA;1001&#xA;666999&#xA;888888&#xA;101010101&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Falsey&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;2&#xA;3&#xA;4&#xA;5&#xA;7&#xA;666&#xA;969&#xA;1000&#xA;88881888&#xA;969696969&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The number is guaranteed to be less than a billion.&lt;/li&gt;&#xA;&lt;li&gt;We are considering &lt;code&gt;1&lt;/code&gt; in it's roman numeral format for the sake of the challenge.&lt;/li&gt;&#xA;&lt;li&gt;Input can be taken as number, or an array of chars, or as string.&lt;/li&gt;&#xA;&lt;li&gt;Output would be a truthy/falsey value.&lt;/li&gt;&#xA;&lt;li&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so fewest bytes will win!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Although I've tried a search, but is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Is the challenge's text clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Any tricky/interesting test case?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="83605" LastEditorUserId="83605" LastEditDate="2020-12-22T03:37:27.243" LastActivityDate="2020-12-22T03:37:27.243" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20559" PostTypeId="2" ParentId="2140" CreationDate="2020-12-21T21:21:39.020" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/216734/66833&quot;&gt;Jelly&amp;#39;s Untruth&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2020-12-22T02:37:11.593" LastActivityDate="2020-12-22T02:37:11.593" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20561" PostTypeId="2" ParentId="2140" CreationDate="2020-12-22T16:28:01.247" Score="1" Body="&lt;p&gt;Given a list of strings like this (input):&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;[&amp;quot;some test&amp;quot;, &amp;quot;{&amp;quot;, &amp;quot;some&amp;quot;, &amp;quot;_subst&amp;quot;, &amp;quot;ring}&amp;quot;, &amp;quot;some&amp;quot;, &amp;quot;other text&amp;quot;]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Need to combine all the elements in to one for the given substring (input).&lt;/p&gt;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;substring = &amp;quot;{some_substring}&amp;quot;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;The output list of strings will be&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;[&amp;quot;some text&amp;quot;, &amp;quot;{some_substring}&amp;quot;, &amp;quot;some other text&amp;quot; ]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Here are few more possible lists of strings:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;input_list = ['some test', '{', 'sub', 'string}', 'som other text']&#xA;input_list2 = ['some test', '{sub', 'string}', 'som other text']&#xA;input_list3 = ['some test', '{', 'sub', 'string}', 'som other text']&#xA;input_list4 = ['some test', '{', 'sub', 'string', '}', 'som other text']&#xA;input_list5 = ['some test {', 'sub', 'string', '}', 'som other text']&#xA;input_list6 = ['some test {', 'sub', 'string', '} som other text']&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;substring&lt;/code&gt; can be any text and it does not need to be wrapped in to round braces. If &lt;code&gt;substring&lt;/code&gt; appears multiple times in the input string than it should be replaced as well.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;em&gt;Note&lt;/em&gt;:&lt;/strong&gt; &lt;em&gt;Elements of the string that do not contain part of the input string should be the same instances.&#xA;So creating a new list from joned string will not work for this problem.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Let say these strings carry additional information like style. So removing or replacing them will remove style as well&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Signature of expected function to better understand problem.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;def join_variable(input_list, substring):&#xA;    # implementation&#xA;    return output_list&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="100013" LastActivityDate="2020-12-22T16:28:01.247" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="20562" PostTypeId="2" ParentId="2140" CreationDate="2020-12-22T19:38:33.197" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/217297/66833&quot;&gt;Interpret Interval Notation&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97691" LastEditorUserId="66833" LastEditDate="2021-01-06T19:07:10.470" LastActivityDate="2021-01-06T19:07:10.470" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="20564" PostTypeId="1" CreationDate="2020-12-23T08:33:56.310" Score="2" ViewCount="64" Body="&lt;p&gt;I have recently asked a question in which I think we need a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/symmetry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;symmetry&amp;#39;&quot; rel=&quot;tag&quot;&gt;symmetry&lt;/a&gt; tag, which has not been created yet.&lt;/p&gt;&#xA;&lt;p&gt;Here are some questions to which I think the tag would be applied to:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/160993/the-symmetry-of-months?r=SearchResults&amp;amp;s=1%7C44.5927&quot;&gt;The symmetry of months&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/142248/im-symmetric-not-palindromic?r=SearchResults&amp;amp;s=9%7C17.4701&quot;&gt;I'm symmetric, not palindromic!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/193955/is-this-skew-symmetry?r=SearchResults&amp;amp;s=3%7C42.0910&quot;&gt;Is this skew symmetry? &lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And another one, which I could have found earlier to prevent myself from posting a dupe, and which came easily in &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=symmetry&quot;&gt;this search query&lt;/a&gt; is the following post,&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/77866/numbers-with-rotational-symmetry?r=SearchResults&amp;amp;s=4%7C37.4338&quot;&gt;Numbers with Rotational Symmetry&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Anyways, I think we need such a tag. Any thoughts?&lt;/p&gt;&#xA;" OwnerUserId="83605" LastEditorUserId="83605" LastEditDate="2020-12-26T04:03:06.430" LastActivityDate="2020-12-26T04:15:18.210" Title="Proposal for tag: [symmetry]" Tags="|discussion|tags|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20565" PostTypeId="2" ParentId="2140" CreationDate="2020-12-23T14:18:59.230" Score="-2" Body="&lt;h1&gt;Solving &lt;code&gt;P=NP&lt;/code&gt;!&lt;/h1&gt;&#xA;&lt;p&gt;Today, we are going to solve &lt;code&gt;P=NP&lt;/code&gt;, kinda...&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;A guaranteed prime positive integer, &lt;code&gt;P&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;The &lt;em&gt;smallest&lt;/em&gt; composite number (NonPrime,&lt;code&gt;NP&lt;/code&gt;) which sum of digits equals &lt;code&gt;P&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input (P)    Output (NP)      Why? (for reference)&#xA;  2              20          2+0=2 and 11 is prime&#xA;  3              12                 1+2=3&#xA;  5              14                 1+4=5&#xA;  7              16                 1+6=7&#xA;  11             38          3+8=11 and 29 is prime&#xA;  13             49                 4+9=13&#xA;  17             98          9+8=17 and 89 is prime&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Check &lt;a href=&quot;https://oeis.org/A073868&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS A073868&lt;/a&gt; for more results.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a function or program that, given a positive prime number &lt;code&gt;P&lt;/code&gt; as input, calculates &lt;code&gt;NP&lt;/code&gt;, the smallest composite number which sum of digits equals &lt;code&gt;P&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Range of input: any integer prime number greater than 1, up to the limit of the chosen language.&lt;/li&gt;&#xA;&lt;li&gt;Range of output: also according to the limits of the chosen language.&lt;/li&gt;&#xA;&lt;li&gt;Means of input/output: free to choose.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Winning condition&lt;/h2&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge. The shortest code wins!&lt;/p&gt;&#xA;&lt;h2&gt;Tags&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;p&gt;I have searched if this was already posted, but with no success.&lt;/p&gt;&#xA;" OwnerUserId="99944" LastActivityDate="2020-12-23T14:18:59.230" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20567" PostTypeId="2" ParentId="2140" CreationDate="2020-12-23T16:16:02.380" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/216919/66833&quot;&gt;Eye test - How many squares are in this picture?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="94346" LastEditorUserId="66833" LastEditDate="2021-01-06T19:09:02.950" LastActivityDate="2021-01-06T19:09:02.950" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20569" PostTypeId="1" CreationDate="2020-12-24T06:41:23.377" Score="8" ViewCount="205" Body="&lt;p&gt;I primarily land on Code Golf by visiting links to questions from the Hot Network Questions roster. When I see comments on answers like:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Good observation!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Wow, impressive!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I tend to flag them as &amp;quot;no longer needed&amp;quot;. This is in keeping with my understanding of how comments should work across the Stack Exchange network. The &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/comment&quot;&gt;&amp;quot;comment everywhere&amp;quot; privilege page&lt;/a&gt; says explicitly that:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Comments are not recommended for…&lt;br /&gt;&#xA;[…]&lt;br /&gt;&#xA;Compliments which do not add new information (&amp;quot;+1, great answer!&amp;quot;); instead, upvote it and &lt;a href=&quot;https://codegolf.stackexchange.com/help/how-to-answer&quot;&gt;pay it forward&lt;/a&gt;&amp;quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I'm a moderator on Stack Overflow, where we appreciate flags on comments of this nature and regularly delete them. In fact, I am even more reserved than the majority of Stack Overflow moderators when it comes to deleting such comments. I will preserve them if I think there is &lt;em&gt;anything&lt;/em&gt; of value in them, including observations about what, &lt;em&gt;specifically&lt;/em&gt;, is so interesting or impressive about the answer. But comments that say nothing more than is conveyed by the upvote arrow? I think these should go. (And, in many cases, &lt;a href=&quot;https://meta.stackexchange.com/a/99853&quot;&gt;the auto-comment-deleter regex&lt;/a&gt; agrees with me.)&lt;/p&gt;&#xA;&lt;p&gt;Along similar lines, I recently flagged a couple of comments underneath an answer that were discussing how self-answering works. The comments were, essentially (paraphrased so I'm not quoting and don't reveal any specific cases):&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;How did you manage to post this answer at exactly the same time as the question?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;@user I selected the &amp;quot;answer my own question&amp;quot; checkbox while composing the question!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Over 24 hours after the first commenter got the answer to their question, I believe these comments should go. The comments are not providing any lasting insight; after all, self-answering is clearly documented in &lt;a href=&quot;https://codegolf.stackexchange.com/help/self-answer&quot;&gt;our Help Center&lt;/a&gt;, and the checkbox that controls it is visible to everyone who ever tries writing a question. To me, these are the &lt;em&gt;very definition of&lt;/em&gt; &amp;quot;no longer needed&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;Especially since I'm primarily looking at and raising flags on Q&amp;amp;A that have made the Hot Network Questions list—I think these deserve &lt;em&gt;extra&lt;/em&gt; clean-up and moderation efforts, since they're highly visible and a primary attraction point for new users to your site.&lt;/p&gt;&#xA;&lt;p&gt;However, I've had a couple of flags recently declined on comments like the ones shown above. I'm obviously not concerned about declined flags, and I'll keep flagging as my conscience sees fit. My question is, do the Code Golf moderators not appreciate such flags? Do you and/or the larger community not believe these these comments deserve to be deleted?&lt;/p&gt;&#xA;" OwnerUserId="58518" LastEditorUserId="58518" LastEditDate="2020-12-24T08:58:16.647" LastActivityDate="2020-12-24T10:52:30.873" Title="Why do moderators decline &quot;no longer needed&quot; flags on chatty comments?" Tags="|discussion|flags|comments|declined-flags|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="20570" PostTypeId="2" ParentId="2140" CreationDate="2020-12-24T09:53:10.687" Score="4" Body="&lt;h1&gt;Explain a Code Golf Answer &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;When writing Code Golf answers, it is often a good idea to add an explanation of the code so the reader understands what's going on. For example, this &lt;a href=&quot;https://codegolf.stackexchange.com/a/216665&quot;&gt;this answer&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/u/94066&quot;&gt;@Makonede&lt;/a&gt; (abridged):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;        θ  # last element of&#xA;Σ          # the input, sorted in increasing order by&#xA;     1¢    # the number of ones of&#xA;   %       # modulo&#xA; žJ        # 4294967296&#xA;    b      # in binary&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The full program is written on the first line, then a blank line, then on each successive line, a little snippet of the program, aligned using spaces with its position in the full program, and then some comments on the right-hand side explaining each part.&lt;/p&gt;&#xA;&lt;p&gt;I, for one, find writing and aligning these explanations tedious, so let's outsource it to a program.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Given a program as a string, and a list of sets of pairs of start/end indices to form an inclusive range, output each sub-string defined by the indices on a new line, indented to its respective position in the whole string, with a &lt;code&gt;#&lt;/code&gt; at the end of the line, padded so that there are two spaces before the &lt;code&gt;#&lt;/code&gt; after the last sub-string, ready for the user to add their explanation.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may use 0-based or 1-based indexing&lt;/li&gt;&#xA;&lt;li&gt;You are guaranteed to receive valid, non-overlapping ranges, which together cover the whole string&lt;/li&gt;&#xA;&lt;li&gt;You may assume the program string contains no newlines, tabs or other unprintable characters, and no double-width characters&lt;/li&gt;&#xA;&lt;li&gt;Standard &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447&quot;&gt;I/O rules&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061&quot;&gt;loopholes&lt;/a&gt; apply&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples (1-based indexing)&lt;/h2&gt;&#xA;&lt;p&gt;Inputs: &lt;code&gt;abcdwxyz&lt;/code&gt;, &lt;code&gt;(1-8)&lt;/code&gt;&lt;br /&gt;&#xA;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;abcdwxyz  #&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Inputs: &lt;code&gt;abcdwxyz&lt;/code&gt;, &lt;code&gt;(5-7)&lt;/code&gt;,  &lt;code&gt;(1-2),(8-8)&lt;/code&gt;,  &lt;code&gt;(3-4)&lt;/code&gt;&lt;br /&gt;&#xA;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    wxy   #&#xA;ab     z  #&#xA;  cd      #&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Inputs: &lt;code&gt;&amp;lt;&amp;lt;&amp;lt;$[&lt;code&gt;grep -c wx $0&lt;/code&gt;-&lt;code&gt;grep -c y\z $0&lt;/code&gt;];:&amp;lt;&amp;lt;'Q'&lt;/code&gt;, &lt;code&gt;(6-20)&lt;/code&gt;,  &lt;code&gt;(22-37)&lt;/code&gt;,  &lt;code&gt;(4-5),(38-38),(21-21)&lt;/code&gt;,  &lt;code&gt;(1-3)&lt;/code&gt;,  &lt;code&gt;(39-39)&lt;/code&gt;,  &lt;code&gt;(40-40)&lt;/code&gt;,  &lt;code&gt;(41-45)]&lt;/code&gt;&lt;br /&gt;&#xA;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;     `grep -c wx $0`                           #&#xA;                     `grep -c y\z $0`          #&#xA;   $[               -                ]         #&#xA;&amp;lt;&amp;lt;&amp;lt;                                            #&#xA;                                      ;        #&#xA;                                       :       #&#xA;                                        &amp;lt;&amp;lt;'Q'  #&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Is this clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Any other feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2020-12-24T09:53:10.687" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20571" PostTypeId="2" ParentId="20569" CreationDate="2020-12-24T10:52:30.873" Score="7" Body="&lt;p&gt;First off I did reject the two flags at the bottom for the exact reason that @ASCII-only suggests in the comments:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;For this specific case, I believe self-answering is a very non-obvious thing, so for the vast majority of users, it would be useful information. Regardless, it's certainly very obvious that it's not just a &amp;quot;wow, very impressive&amp;quot;. By that, I mean it is not equivalent to an &amp;quot;upvote and move on&amp;quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The information is presented elsewhere but it is not really easy to find it if you are asking the question &amp;quot;How did this person answer so quickly&amp;quot;.  I think these comments ask a question about the answer that has a non-obvious answer and answer it.  For me this is the most basic purpose of comments.&lt;/p&gt;&#xA;&lt;p&gt;Nothing has changed about the post itself which would make the comments obsolete, so I think that they should stay.&lt;/p&gt;&#xA;&lt;p&gt;I'm not really sure if that falls into the same category as other ones. I certainly think that &amp;quot;Wow +1&amp;quot;, and &amp;quot;Good answer&amp;quot; comments should be deleted.  If other moderators are of the opinion that those should stay I don't know of it.  Overall however I think it is fine to raise these flags, pretty much as you see fit.&lt;/p&gt;&#xA;&lt;p&gt;They take a couple seconds to resolve and we are not flooded with flags or anything.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2020-12-24T10:52:30.873" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20572" PostTypeId="2" ParentId="2140" CreationDate="2020-12-24T21:37:59.247" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/216929/based-palindromes&quot;&gt;Based Palindromes&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96079" LastEditorUserId="66833" LastEditDate="2020-12-27T22:12:27.687" LastActivityDate="2020-12-27T22:12:27.687" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="20573" PostTypeId="1" CreationDate="2020-12-25T21:47:51.627" Score="2" ViewCount="72" Body="&lt;p&gt;I have a couple answers here that work at compile-time and just posted another, and I was wondering if such solutions are allowed. I'm not talking about just proper functions that can run at compile-time, such as &lt;code&gt;constexpr&lt;/code&gt; in C++, but also stuff like types that take type parameters and return other types or templates that do something depending on their arguments.&lt;/p&gt;&#xA;&lt;p&gt;For example, here is a factorial function in Scala 3 using types and some imported black magic:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-scala prettyprint-override&quot;&gt;&lt;code&gt;import compiletime.ops.int._&#xA;type Fac[X &amp;lt;: Int] &amp;lt;: Int = X match {&#xA;  case 0 =&amp;gt; 1&#xA;  case _ =&amp;gt; X * Fac[X - 1]&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This does not return a value that can be directly printed. Instead, you would need &lt;code&gt;compiletime.constValue[Fac[6]]&lt;/code&gt; to compute the factorial of &lt;code&gt;6&lt;/code&gt;, and not all languages that allow compile-time shenanigans also allow you to turn a type into a value so easily. You might need to verify it using something like &lt;code&gt;val check: Fac[6] = 720&lt;/code&gt; and see if the compiler throws an error or not instead - it's not as simple as just &lt;code&gt;print(factorial(6))&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Are such submissions valid? And if so, what rules do they have to abide by?&lt;/p&gt;&#xA;" OwnerUserId="95792" LastActivityDate="2020-12-25T21:47:51.627" Title="Are compile-time solutions valid?" Tags="|discussion|answers|" AnswerCount="0" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="20574" PostTypeId="1" AcceptedAnswerId="20584" CreationDate="2020-12-25T23:39:04.513" Score="7" ViewCount="133" Body="&lt;p&gt;On occasion, especially with a couple of specific, inactive users, I'll craft a Jelly answer identical to an existing answer, except for a few byte-saving substitutions that have been added to the language since (stuff like &lt;code&gt;ŒgL€&lt;/code&gt; &lt;span class=&quot;math-container&quot;&gt;\$\to\$&lt;/span&gt; &lt;code&gt;Œɠ&lt;/code&gt; or &lt;code&gt;ÐĿ&lt;/code&gt; &lt;span class=&quot;math-container&quot;&gt;\$\to\$&lt;/span&gt; &lt;code&gt;Ƭ&lt;/code&gt; for those familiar with Jelly).&lt;/p&gt;&#xA;&lt;p&gt;While this means that my new answer is often the shortest, it is also not 100% &amp;quot;original&amp;quot;, and is somewhat an update of an older answer. Sometimes, it is even in the realm of commenting &amp;quot;[-1 byte](link to my code)&amp;quot; on the older answer, but the answer will never be updated to reflect this as the OP is inactive. In these cases, I'm never quite sure what the etiquette is (and I've asked in TNB with varying degrees of success), so I thought a meta question would be a good idea.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, in general, what is/should our consensus be:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Can we post answers that are very similar to an older answer, but updated to be shorter?&lt;/li&gt;&#xA;&lt;li&gt;Can we post answers which would be better suited as &amp;quot;Saved &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; bytes&amp;quot; comments?&lt;/li&gt;&#xA;&lt;li&gt;Do the answers to these matter/change depending on how active the user is?&lt;/li&gt;&#xA;&lt;li&gt;Does that fact that some improvements are only possible due to language updates matter?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-01-01T07:21:20.390" Title="What's our policy on &quot;reposting&quot; older answers with newer versions?" Tags="|discussion|answers|etiquette|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="20575" PostTypeId="2" ParentId="20564" CreationDate="2020-12-26T04:15:18.210" Score="-2" Body="&lt;p&gt;I am &lt;strong&gt;in favor&lt;/strong&gt; of the proposal. And, here is my tag wiki proposal,&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;For challenges involving some sort of symmetry, or intending to produce symmetrical output in any form.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Also, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/symmetry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;symmetry&amp;#39;&quot; rel=&quot;tag&quot;&gt;symmetry&lt;/a&gt; is an elemental part of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;, just like&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graph-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graph-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;graph-theory&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polynomials&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polynomials&amp;#39;&quot; rel=&quot;tag&quot;&gt;polynomials&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/rational-numbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;rational-numbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;rational-numbers&lt;/a&gt; and many more...&lt;/p&gt;&#xA;&lt;p&gt;Further, I have also noted that some of the questions (which appeared in &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=symmetry+is%3Aquestion&quot;&gt;this search query&lt;/a&gt;) are not having any relevant tag which points to symmetry, or any similar meaning. And, this search query isn't the whole list, actually!&lt;/p&gt;&#xA;" OwnerUserId="83605" LastActivityDate="2020-12-26T04:15:18.210" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20576" PostTypeId="2" ParentId="2140" CreationDate="2020-12-26T19:52:56.260" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/216985/66833&quot;&gt;Generalised Taxicab Numbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2020-12-28T20:33:35.243" LastActivityDate="2020-12-28T20:33:35.243" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20577" PostTypeId="2" ParentId="2140" CreationDate="2020-12-26T21:32:04.920" Score="0" Body="&lt;h2&gt;Answers made up from older answers&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr/&gt;&#xA;&lt;p&gt;In this challenge, your task is to take a number as input, and determine whether it is the number of previous answers. For example, the third answer would print/return a truthy value is given &lt;code&gt;2&lt;/code&gt;, and a falsey value for any other input.&lt;/p&gt;&#xA;&lt;p&gt;However, all answers must be made up of previous answers. For example, if the existing answers were &lt;code&gt;+1&lt;/code&gt;, &lt;code&gt;t()==1&lt;/code&gt;, and &lt;code&gt;_=&amp;gt;inpu&lt;/code&gt;, some allowed answers would be:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;t()==1+1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;_=&amp;gt;input()==1+1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;+1+1+1+1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;​&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Examples of answers that would not be allowed:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;1+&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1+1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;_=&amp;gt;+1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&#xA;&lt;pre&gt;&lt;code&gt;​&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;(newline)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For the output/return format, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/19266/79857&quot;&gt;this&lt;/a&gt; is a list of the allowed formats I'll use for this challenge.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Scoring and initial allowed parts of answers coming soon.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What should the title be?&lt;/li&gt;&#xA;&lt;li&gt;Any recommended initial allowed parts?&lt;/li&gt;&#xA;&lt;li&gt;Is this easy to read/understand?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2020-12-27T05:18:52.387" LastActivityDate="2020-12-27T05:18:52.387" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="20578" PostTypeId="2" ParentId="2140" CreationDate="2020-12-27T06:27:50.550" Score="0" Body="&lt;h2&gt;Implement ASCII -&amp;gt; GSM-7 (SMS) text packing&lt;/h2&gt;&#xA;&lt;p&gt;SMS messages can store 160 ASCII characters into 140 characters. It does this by chopping off the top bit from each byte and packing them together.&lt;/p&gt;&#xA;&lt;p&gt;The simplified steps:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Convert the string to binary little endian ASCII.&lt;/li&gt;&#xA;&lt;li&gt;Remove the top bit from each byte.&lt;/li&gt;&#xA;&lt;li&gt;Pack them together so there are no gaps.&lt;/li&gt;&#xA;&lt;li&gt;If applicable, pad the final byte with zero bits.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;So, take the text &amp;quot;Test0123&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;First, we convert it to little endian binary.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0x54     0x65     0x73     0x74     0x30     0x31     0x32     0x33&#xA;00101010 10100110 11001110 00101110 00001100 10001100 01001100 11001100&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Then, we chop off the last (most significant) bit of each octet:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0010101  1010011  1100111  0010111  0000110  1000110  0100110  1100110&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Then, we pack them together into a 7 byte array:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0xd4     0xf2     0x9c     0x0e     0x8b     0xc9     0x66&#xA;00101011 01001111 00111001 01110000 11010001 10010011 01100110&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In the case of bitwise operations, it is a simple funnel shift.&lt;/p&gt;&#xA;&lt;p&gt;The basic algorithm in C is here for an 8 byte ASCII string. However, your algorithm must accept any length.&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-c prettyprint-override&quot;&gt;&lt;code&gt;void ascii_to_gsm7_8_bytes(uint8_t *buf, const char *str)&#xA;{&#xA;    buf[0] = (str[0] &amp;gt;&amp;gt; 0) | (str[1] &amp;lt;&amp;lt; 7);&#xA;    buf[1] = (str[1] &amp;gt;&amp;gt; 1) | (str[2] &amp;lt;&amp;lt; 6);&#xA;    buf[2] = (str[2] &amp;gt;&amp;gt; 2) | (str[3] &amp;lt;&amp;lt; 5);&#xA;    buf[3] = (str[3] &amp;gt;&amp;gt; 3) | (str[4] &amp;lt;&amp;lt; 4);&#xA;    buf[4] = (str[4] &amp;gt;&amp;gt; 4) | (str[5] &amp;lt;&amp;lt; 3);&#xA;    buf[5] = (str[5] &amp;gt;&amp;gt; 5) | (str[6] &amp;lt;&amp;lt; 2);&#xA;    buf[6] = (str[6] &amp;gt;&amp;gt; 6) | (str[7] &amp;lt;&amp;lt; 1);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The input can either be a string (optionally with a provided length) or an input from stdin which is terminated with a newline or EOF.&lt;/p&gt;&#xA;&lt;p&gt;The string will be a non-empty printable ASCII string that is 160 bytes or less. It is safe to assume that all bytes are 0x20 &amp;lt;= x &amp;lt; 0x80, meaning the last MSB bit is cleared beforehand.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Important:&lt;/strong&gt; While strings can be null terminated, you are &lt;strong&gt;not&lt;/strong&gt; allowed to use that null terminator for padding the last byte.&lt;/p&gt;&#xA;&lt;p&gt;Output will be the packed string.&lt;/p&gt;&#xA;&lt;p&gt;The output can either be printed as a list of values (base 10 or base 16) to stdout or returned in an output array.&lt;/p&gt;&#xA;&lt;p&gt;Test cases (output is in hex):&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-c prettyprint-override&quot;&gt;&lt;code&gt;Input text -&amp;gt; Output (hex)&#xA;&amp;quot;&amp;quot; -&amp;gt; Empty strings do not need to be handled.&#xA;&amp;quot;Úñíçódé&amp;quot; -&amp;gt; Unicode does not need to be handled, only ASCII.&#xA;&amp;quot;Hi!&amp;quot; -&amp;gt; {0xc8, 0x74, 0x08}&#xA;&amp;quot;Test0123&amp;quot; -&amp;gt; {0xd4, 0xf2, 0x9c, 0x0e, 0x8b, 0xc9, 0x66}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;More test cases will be added if this is accepted.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes per language wins.&lt;/p&gt;&#xA;" OwnerUserId="94093" LastEditorUserId="94093" LastEditDate="2020-12-28T18:55:09.693" LastActivityDate="2020-12-28T18:55:09.693" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20580" PostTypeId="2" ParentId="2140" CreationDate="2020-12-29T10:54:09.243" Score="2" Body="&lt;h1&gt;Partial sums of the kempner series &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/217090/partial-sums-of-the-kempner-series&quot;&gt;Posted&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2020-12-31T20:15:19.900" LastActivityDate="2020-12-31T20:15:19.900" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20583" PostTypeId="2" ParentId="2140" CreationDate="2020-12-31T15:44:48.950" Score="-4" Body="&lt;h1&gt;Mystery Numbers Challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Here are some sample inputs and outputs:&lt;/p&gt;&#xA;&lt;h2&gt;IO&lt;/h2&gt;&#xA;&lt;h3&gt;Test 1&lt;/h3&gt;&#xA;&lt;p&gt;Input: &lt;code&gt;102&lt;/code&gt;&lt;br /&gt;&#xA;Output: &lt;code&gt;10404 1061208 14002414191924244276669361796022272&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Test 2&lt;/h3&gt;&#xA;&lt;p&gt;Input: &lt;code&gt;10&lt;/code&gt;&lt;br /&gt;&#xA;Output: &lt;code&gt;100 100000&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Test 3&lt;/h3&gt;&#xA;&lt;p&gt;Input: &lt;code&gt;50&lt;/code&gt;&lt;br /&gt;&#xA;Output: &lt;code&gt;2500 312500000 312500000&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h2&gt;BONUS&lt;/h2&gt;&#xA;&lt;p&gt;If there are two inputs, here are the corresponding inputs and outputs:&lt;/p&gt;&#xA;&lt;h3&gt;Test B1&lt;/h3&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;50&#xA;12&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output: &lt;code&gt;144 248832 248832&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Test B1&lt;/h3&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2310&#xA;9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output: &lt;code&gt;81 729 59049 4782969 31381059609&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&lt;p&gt;If you pass all bonuses too, feel free to third your score. Also add a &lt;code&gt;*&lt;/code&gt; to the end.&lt;/p&gt;&#xA;" OwnerUserId="95056" LastEditorUserId="95056" LastEditDate="2021-01-01T20:09:43.593" LastActivityDate="2021-01-01T20:09:43.593" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="20584" PostTypeId="2" ParentId="20574" CreationDate="2021-01-01T07:21:20.390" Score="6" Body="&lt;blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Can we post answers that are very similar to an older answer, but updated to be shorter?&lt;/li&gt;&#xA;&lt;li&gt;Can we post answers which would be better suited as &amp;quot;Saved n bytes&amp;quot; comments?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Yes, of course!&lt;/strong&gt; Trying to out-score the other players is the whole point of Code Golf. If you can take inspiration from their attempt but add your own &amp;quot;twist&amp;quot; to make it shorter, then you are well within your rights to post a new answer.&lt;/p&gt;&#xA;&lt;p&gt;Obviously, you &lt;em&gt;must&lt;/em&gt; follow &lt;a href=&quot;https://codegolf.stackexchange.com/help/attribution&quot;&gt;our attribution requirements&lt;/a&gt;, giving explicit credit to the author of the original answer and including a link back to that answer. But the CC BY-SA license explicitly allows adaptations and remixes, so this should be encouraged behavior.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do the answers to these matter/change depending on how active the user is?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;If you feel that your change is relatively trivial and/or you &lt;em&gt;want&lt;/em&gt; to give the original contributor a chance to update their answer, you can choose to do so. We don't need an official policy on this, though. &lt;strong&gt;Users can decide for themselves whether they want to post a new answer or leave a comment on an existing one.&lt;/strong&gt; They can also establish their own thresholds for this, whether based on significance of the change, recent activity of the original contributor, etc. From the site's perspective, those don't matter.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Does that fact that some improvements are only possible due to language updates matter?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Don't we already have a policy covering that—something like, you have to use the language as it was implemented at the time of announcing the challenge? If not, I think that's a reasonable rule.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Although I wouldn't have any objections to someone posting a new answer that takes advantage of new language features, I think that should &lt;em&gt;always&lt;/em&gt; be a new answer&lt;/strong&gt;, as it should also be treated differently for comparison/scoring purposes.&lt;/p&gt;&#xA;&lt;p&gt;I know golfing languages are updated frequently, due to their niche purposes, but with mainstream languages, this is already conventional. A C++17 answer is a different entry than a C++11 answer—for the purposes of code golf, they're essentially different languages. I'd say the same would be true if you were exploiting new features added to a language since the challenge. I see no cause to discourage users from doing so, but these submissions become new entries in what is a &lt;em&gt;de facto&lt;/em&gt; different language and should not be compared/scored against the original submission.&lt;/p&gt;&#xA;" OwnerUserId="58518" LastActivityDate="2021-01-01T07:21:20.390" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20585" PostTypeId="1" CreationDate="2021-01-01T16:38:24.607" Score="7" ViewCount="429" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19271/16766&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout January 2021, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Scala&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;What's a Language of the Month?&lt;/p&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/16766&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during January, those who wish to participate should learn (at least the basics of) Scala, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about Scala&lt;/h2&gt;&#xA;&lt;p&gt;Scala is a general-purpose programming language that combines OOP and FP and improves a lot on Java. It mainly runs on the JVM, but there's also Scala Native and ScalaJS.&lt;/p&gt;&#xA;&lt;p&gt;Some nice things about it:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Concise (and pleasing) syntax that sometimes makes it feel like a scripting language (&lt;a href=&quot;https://www.scala-js.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; is a comparison between ScalaJS and ES6 and TypeScript.&lt;/li&gt;&#xA;&lt;li&gt;The standard library is amazing and has useful methods such as &lt;code&gt;filter&lt;/code&gt;, &lt;code&gt;combinations&lt;/code&gt; and &lt;code&gt;collect&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Implicits are very powerful and can be used for everything from simply reusing values to doing logic programming at compile time.&lt;/li&gt;&#xA;&lt;li&gt;Type inference means you don't need to declare types explicitly, except for method parameters (and return types in recursive methods).&lt;/li&gt;&#xA;&lt;li&gt;For comprehensions are a lot shorter than using multiple &lt;code&gt;flatMap&lt;/code&gt;s and &lt;code&gt;filter&lt;/code&gt;s, and you can even create variables without using the &lt;code&gt;val&lt;/code&gt; keyword inside them.&lt;/li&gt;&#xA;&lt;li&gt;Pattern matching is convenient, and helps in destructuring declarations.&lt;/li&gt;&#xA;&lt;li&gt;User-defined operators save bytes. &lt;code&gt;list1.concat(list2)&lt;/code&gt; can be replaced with &lt;code&gt;list1 ++ list2&lt;/code&gt;. Infix and postfix (the latter is deprecated) also save bytes.&lt;/li&gt;&#xA;&lt;li&gt;Its type system is Turing complete, and using &lt;a href=&quot;https://docs.scala-lang.org/sips/42.type.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;literal types&lt;/a&gt; and a couple dependencies, you can even do compile time operations on primitives and such.&lt;/li&gt;&#xA;&lt;li&gt;There's a research compiler called &lt;a href=&quot;https://dotty.epfl.ch/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Dotty&lt;/a&gt; that adds a ton of features to Scala and is slated to be released as Scala 3.&lt;/li&gt;&#xA;&lt;li&gt;Scala makes immutability really easy - all you have to do is use &lt;code&gt;val&lt;/code&gt; instead of using &lt;code&gt;final SomeType&lt;/code&gt;, like in Java.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/115106/scala&quot;&gt;Chat room&lt;/a&gt; (it's not very active, but I'll be happy to help if you ask any questions there)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://docs.scala-lang.org/tour/tour-of-scala.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tour of Scala&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.scala-lang.org/api/current/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Scala Standard Library&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://scastie.scala-lang.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Scastie&lt;/a&gt; - an online playground tailored to Scala that (in my opinion) is better than TIO.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#scala&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/3885/tips-for-golfing-in-scala&quot;&gt;Tips for golfing in Scala&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Bounty&lt;/h3&gt;&#xA;&lt;p&gt;Answers in Scala will be eligible for a bounty of 50 rep if you have not posted an answer in Scala before. Sorry, but if it's a question that I (&lt;a href=&quot;https://codegolf.stackexchange.com/users/95792/user&quot;&gt;user&lt;/a&gt;) have already answered, I'll only award the bounty to an exceptional answer, since it starts at 100 rep.&lt;/p&gt;&#xA;" OwnerUserId="95792" LastEditorUserId="76162" LastEditDate="2021-02-02T11:42:45.743" LastActivityDate="2021-02-02T11:42:45.743" Title="Language of the month for January 2021: Scala" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20586" PostTypeId="2" ParentId="20585" CreationDate="2021-01-01T16:55:33.933" Score="3" Body="&lt;h1&gt;List of all Scala solutions posted in January 2021&lt;/h1&gt;&#xA;&lt;p&gt;(First time posters highlighted in bold)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/217155&quot;&gt;Pascal's Fibonacci Triangle&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;&lt;strong&gt;Michael Chatiskatzi&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/217192&quot;&gt;Append and erase&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/217230&quot;&gt;Golfing Advent of Code 2020, Day 3&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/217239&quot;&gt;Numbers by Position&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/217189/95792&quot;&gt;Vandalizing Marquees&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792/user&quot;&gt;user&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/217350&quot;&gt;Linear integer function generator&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/217501&quot;&gt;Minimal Pairing&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/217635&quot;&gt;Print a conversion table for (un)signed bytes&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/217681&quot;&gt;&amp;quot;DDoouubbllee ssppeeaakk!!&amp;quot;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/218226/80214&quot;&gt;Count the bytes of a program&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;&lt;strong&gt;Razetime&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/218228/80214&quot;&gt;Running second maximum of a list&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr&gt;&#xA;&lt;h1&gt;List of all Scala tips posted in January 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/217196&quot;&gt;Treat a String as a Sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;tip title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;List of Scala-related challenges posted in January 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/217137/95792&quot;&gt;Pascal's Fibonacci Triangle&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792/user&quot;&gt;user&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/q/&amp;lt;question-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="95792" LastEditorUserId="90812" LastEditDate="2021-01-31T19:49:01.327" LastActivityDate="2021-01-31T19:49:01.327" CommentCount="0" CommunityOwnedDate="2021-01-02T23:01:42.467" ContentLicense="CC BY-SA 4.0" />
  <row Id="20588" PostTypeId="1" CreationDate="2021-01-02T00:33:46.743" Score="9" ViewCount="511" Body="&lt;p&gt;Well, 2020's come to an end, and so that means: Best of 2020!&lt;/p&gt;&#xA;&lt;p&gt;In this thread, we'll consolidate the categories for our Best Posts of 2020, and eventually we'll vote on which posts will win for each category. In this thread, we are looking for two things:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Categories to classify exceptional posts from 2020 (e.g. Best Mathematical Insight or Rookie of the Year)&lt;/li&gt;&#xA;&lt;li&gt;Bounties offered to reward the winners in those categories&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;As answers below, please nominate categories. Each answer should contain a category for a challenge or answer to be rewarded. The top-voted categories will then receive separate nomination posts to find the actual winners. Like previous years, I'm not going to state a fixed number of categories that will make it, but it's probably going to be between 5 and 15. Last year was slightly complicated, but we've usually gone with between 5 and 15 in previous years.&lt;/p&gt;&#xA;&lt;p&gt;Feel free to resubmit categories from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/18429/66833&quot;&gt;last year&lt;/a&gt;, or &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/tagged/best-of&quot;&gt;previous years&lt;/a&gt; regardless of whether they were among the final selected categories or not.&lt;/p&gt;&#xA;&lt;p&gt;Voting on categories should last around 2 weeks, but this is by no means a hard limit, and we'll be happy to extend it further if new category nominations are still incoming.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Offered bounties&lt;/h2&gt;&#xA;&lt;p&gt;Last year, to the best of my knowledge, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/20499/66833&quot;&gt;we didn't offer bounties to the winners&lt;/a&gt;. Well, 2019/20 was a weird year for &lt;s&gt;StackExchange&lt;/s&gt; us all, so we'll revert to tradition for this year. If you are willing to spend some of your rep to reward the eventual winners, please edit your username and the amount you are willing to spend below. Alternatively, leave a comment below, and I'll add your name to the list.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;caird coinheringaahing. +1000 rep&lt;/li&gt;&#xA;&lt;li&gt;HyperNeutrino. I'm not gonna set a min/max I'll give but I'm willing to give a good amount.&lt;/li&gt;&#xA;&lt;li&gt;Giuseppe. 1000 rep.&lt;/li&gt;&#xA;&lt;li&gt;user. 500 rep.&lt;/li&gt;&#xA;&lt;li&gt;Redwolf Programs. 500 rep.&lt;/li&gt;&#xA;&lt;li&gt;Bubbler. 1000-3000 rep.&lt;/li&gt;&#xA;&lt;li&gt;Razetime. 500 rep.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="76162" LastEditDate="2021-02-02T11:43:08.707" LastActivityDate="2021-02-02T11:43:08.707" Title="Best of CGCC 2020 - Call for Categories" Tags="|discussion|best-of|" AnswerCount="14" CommentCount="0" ClosedDate="2021-01-18T09:25:06.423" ContentLicense="CC BY-SA 4.0" />
  <row Id="20589" PostTypeId="2" ParentId="20588" CreationDate="2021-01-02T00:33:46.743" Score="10" Body="&lt;h1&gt;Rookie of the Year - Challenges&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18437/66833&quot;&gt;Repost of 2019&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For the best challenge written by a new user&lt;span class=&quot;math-container&quot;&gt;\${}^*\$&lt;/span&gt; in 2020.&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\${}^*\$&lt;/span&gt;Note that this doesn't have to be a user who created their account in 2020; rather, this is for any challenge posted by a user in 2020 where that challenge was that user's &lt;em&gt;first&lt;/em&gt; challenge on the site&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-01-02T00:33:46.743" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20590" PostTypeId="2" ParentId="2140" CreationDate="2021-01-02T13:59:21.400" Score="3" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/217278/87058&quot;&gt;posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="87058" LastEditorUserId="87058" LastEditDate="2021-01-04T14:09:34.250" LastActivityDate="2021-01-04T14:09:34.250" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20591" PostTypeId="2" ParentId="20588" CreationDate="2021-01-02T17:11:42.670" Score="6" Body="&lt;h1&gt;Most helpful commenter&lt;/h1&gt;&#xA;&lt;p&gt;One of the things that stands out about this community is that although it's highly competitive, there is nearly always someone on hand to offer advice both on improving challenges and improving answer scores. It's part of what made this site seem so welcoming to me.&lt;/p&gt;&#xA;&lt;p&gt;In recognition of this, nominees should be people who have helped others improve and made them feel welcome, whether by direct comments on challenges and answers, or in comments in chat.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17329/95792&quot;&gt;Repost of 2018&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="95792" LastActivityDate="2021-01-02T17:11:42.670" CommentCount="2" CommunityOwnedDate="2021-01-02T17:11:42.670" ContentLicense="CC BY-SA 4.0" />
  <row Id="20592" PostTypeId="2" ParentId="20588" CreationDate="2021-01-02T20:34:02.497" Score="4" Body="&lt;h1&gt;Most improved answer&lt;/h1&gt;&#xA;&lt;p&gt;Answer whose score improves the most from its initial posting. This doesn't have to be one with an objectively big increase/decrease (depending on the scoring system), but can be one with the most impressive change.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2021-01-02T20:34:02.497" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20593" PostTypeId="2" ParentId="2140" CreationDate="2021-01-03T12:33:06.927" Score="0" Body="&lt;h1&gt;Isosceles triangle truncations&lt;/h1&gt;&#xA;&lt;p&gt;Most triangles are not isosceles. Here is an example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A ____ C&#xA; |   /&#xA;E|  /&#xA; | /D&#xA; |/&#xA;B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;However, we can cut this triangle into two smaller triangles, one of which is isosceles. We can do this in a number of ways:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;By cutting from C to E, we create isosceles triangle BEC. (Due to limitations of ASCII art, you'll just have to imagine that E is in the correct place.)&lt;/li&gt;&#xA;&lt;li&gt;By cutting from A to D, we create isosceles triangle ADB.&lt;/li&gt;&#xA;&lt;li&gt;By cutting from A to D, we create isosceles triangle ADC. (This always happens for right-angled triangles, of course. It's hard to draw ASCII art triangles that are neither right-angled nor isosceles.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Each triangle can be derived in turn from the original triangle by fixing one of the three sides (which will be the base of the new triangle) and the smaller of the two adjacent angles, adjusting the other base angle as necessary.&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is, given a triangle of three points A, B and C in any reasonable format, is to output at least one of its isosceles triangle truncations.&lt;/p&gt;&#xA;&lt;p&gt;It must be possible to obtain all three truncations for a given triangle. This is typically achieved by permuting the parameters of the function, but you can use some other input method if you wish. In any case please indicate how to obtain all truncations.&lt;/p&gt;&#xA;&lt;p&gt;Example: For an input of (0, 0), (0, 4) and (8, 0), the output might be (0, 0), (4, 2), (8, 0); (0, 0), (0, 4), (4, 2); (3, 0), (0, 4), (8, 0). Alternatively, the output might just be (3, 0), and to obtain (4, 2) you would have to input the triangle in a different order.&lt;/p&gt;&#xA;&lt;p&gt;You may assume that the input triangle is not isosceles (or equilateral, for those languages that allow parameters that are surds rather than floating-point decimals). For instance, for programs that normally output all truncations, they might simply return a single equilateral triangle unchanged.&lt;/p&gt;&#xA;&lt;p&gt;Your method should be theoretically exact even if the code suffers from floating-point limitations.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2021-01-03T12:33:06.927" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20594" PostTypeId="2" ParentId="20588" CreationDate="2021-01-03T20:17:17.063" Score="5" Body="&lt;h1&gt;Rookie of the Year - Answers&lt;/h1&gt;&#xA;&lt;p&gt;For the best answer written by a new user in 2020. This doesn't have to be a user who created their account in 2020; rather, this is for any answer posted by a user in 2020 where that challenge was that user's first answer on the site.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/edit/1355909&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE query&lt;/a&gt; modified from the one Giuseppe gave.&lt;/p&gt;&#xA;" OwnerDisplayName="user100177" LastEditorDisplayName="user100177" LastEditDate="2021-01-07T15:15:21.947" LastActivityDate="2021-01-07T15:15:21.947" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20595" PostTypeId="2" ParentId="2140" CreationDate="2021-01-04T01:36:31.207" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/217511/does-this-javascript-function-support-keyword-arguments&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77634" LastEditorUserId="77634" LastEditDate="2021-01-11T17:48:22.027" LastActivityDate="2021-01-11T17:48:22.027" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20597" PostTypeId="2" ParentId="20588" CreationDate="2021-01-04T04:46:06.113" Score="8" Body="&lt;h1&gt;Best mathematical insight&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17317/78410&quot;&gt;Repost of 2018&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18442/78410&quot;&gt;2019&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;On this site we often see answers in languages specifically designed for short code, or designed to be fast. Sometimes, a nice golfing trick or speed-up technique surprises us with its ingenuity, beyond the standard use of that language.&lt;/p&gt;&#xA;&lt;p&gt;And occasionally an answer shows up that uses an unexpected approach to greatly simplify the problem, and makes us wonder how the author could ever think of that. This usually involves some far-from-obvious mathematical equivalence, or a particularly simple approach to the problem that was not evident at all (once revealed, other answers often follow the same approach).&lt;/p&gt;&#xA;&lt;p&gt;This category is for the answer with the best &lt;strong&gt;mathematical&lt;/strong&gt; insight or unexpected approach that led to greatly simplifying the problem, in &lt;strong&gt;any challenge type&lt;/strong&gt; (code golf, fastest code, or others). The insight should have led to a significant improvement according to the challenge's metric (code length, run time, or whatever applicable).&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2021-01-04T04:46:06.113" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20598" PostTypeId="2" ParentId="20588" CreationDate="2021-01-04T04:48:13.183" Score="4" Body="&lt;h1&gt;Best Non-Code-Golf Challenge&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18439/78410&quot;&gt;Repost of 2019&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Best challenge whose winning criteria did not include any code-golfing. King of the Hill, Fastest Code, etc. would be eligible. Proof Golf, atomic-code-golf, etc. are also included. Anything that's not the standard &amp;quot;shortest code length&amp;quot; is eligible.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2021-01-04T04:48:13.183" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20599" PostTypeId="2" ParentId="20588" CreationDate="2021-01-04T04:50:05.963" Score="5" Body="&lt;h1&gt;Best Non-Code-Golf Answer&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18440/78410&quot;&gt;Repost of 2019&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Best answer to a challenge whose winning criteria did not include any code-golfing. King of the Hill, Fastest Code, etc. would be eligible. Proof Golf, atomic-code-golf, etc. are also included. Anything that's not the standard &amp;quot;shortest code length&amp;quot; is eligible.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2021-01-04T04:50:05.963" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20600" PostTypeId="2" ParentId="2140" CreationDate="2021-01-04T06:49:20.613" Score="-3" Body="&lt;h2&gt;I have the following code. Help me make it code shorter.&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;new Promise(r=&amp;gt;r(URL.createObjectURL(new Blob(['&amp;lt;h1&amp;gt;Example&amp;lt;/h1&amp;gt;'],{type:'text/html'})))).then(u=&amp;gt;open(u)&amp;amp;&amp;amp;setTimeout(t=&amp;gt;URL.revokeObjectURL(u),2e3))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;The Catch:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This has to be in JavaScript&lt;/li&gt;&#xA;&lt;li&gt;It cannot contain semicolons&lt;/li&gt;&#xA;&lt;li&gt;It must be a &amp;quot;one-liner&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;It must have the same steps as the code above:&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Create a blob URL from a blob&lt;/li&gt;&#xA;&lt;li&gt;Open a browser window of the blob URL&lt;/li&gt;&#xA;&lt;li&gt;Revoke the blob URL&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Extras&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The winner will be decided by the shortest amount of bytes&lt;/li&gt;&#xA;&lt;li&gt;If you try this in another language, you will still get an upvote&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="99923" LastActivityDate="2021-01-04T06:49:20.613" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20601" PostTypeId="2" ParentId="20588" CreationDate="2021-01-04T20:02:40.137" Score="6" Body="&lt;h1&gt;Best Explanation&lt;/h1&gt;&#xA;&lt;p&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18451/66833&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17315/66833&quot;&gt;2018&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14512/66833&quot;&gt;2017&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10940/66833&quot;&gt;2016&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This category is for the answer with the best explanation accompanying it. Ideally, the winner will be an answer with a very detailed explanation that is accessible to anyone, regardless of the amount of relevant knowledge already possessed.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-01-04T20:02:40.137" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20602" PostTypeId="5" CreationDate="2021-01-04T20:34:26.833" Score="0" Body="&lt;p&gt;This tag is for questions that relate to either the &lt;a href=&quot;https://stackexchange.com/&quot;&gt;StackExchange network&lt;/a&gt; with a focus on the Code Golf and Coding Challenges website. Questions that focus on the network as a whole should be posted to &lt;a href=&quot;https://meta.stackexchange.com&quot;&gt;Mother Meta&lt;/a&gt; and questions that focus on another site should be posted to the specific site's meta.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-01-04T20:34:26.833" LastActivityDate="2021-01-04T20:34:26.833" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20603" PostTypeId="4" CreationDate="2021-01-04T20:34:26.833" Score="0" Body="For questions relating to StackExchange as a whole, both as a network of websites and as a company. Questions with this tag should focus primarily on CGCC and how it relates to StackExchange as a whole." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-01-04T20:34:26.833" LastActivityDate="2021-01-04T20:34:26.833" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20604" PostTypeId="2" ParentId="2140" CreationDate="2021-01-04T21:06:41.063" Score="0" Body="&#xA;&lt;h1&gt;Your Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Find out if a function &lt;strong&gt;always&lt;/strong&gt; returns its input.&lt;/p&gt;&#xA;&lt;h1&gt;Input/Output Information&lt;/h1&gt;&#xA;&lt;p&gt;Input is a math expression as a string with operators &lt;code&gt;+ - ( ) /&lt;/code&gt;.&lt;br&gt;The multiplication symbol is &lt;code&gt;*&lt;/code&gt;, or &lt;code&gt;x&lt;/code&gt; if you specify.&lt;/p&gt;&#xA;&lt;p&gt;The input will always will only contain &lt;s&gt;whitespace&lt;/s&gt; spaces, decimal points, numbers (&lt;code&gt;0123456789&lt;/code&gt;), math symbols (&lt;code&gt;+ - ( ) /&lt;/code&gt; and one of the following: &lt;code&gt;*&lt;/code&gt; or &lt;code&gt;x&lt;/code&gt;) and one lowercase letter that is the variable.&lt;/p&gt;&#xA;&lt;p&gt;Whitespace in the input must be ignored.&lt;/p&gt;&#xA;&lt;p&gt;Output is whether the function will &lt;strong&gt;always&lt;/strong&gt; return its input.&lt;/p&gt;&#xA;&lt;p&gt;The expression will never have a division by a polynomial with its degree &amp;gt;1.&lt;br&gt;Example: &lt;code&gt;x*x*x/x*x&lt;/code&gt; &amp;lt;= this will never be input.&lt;/p&gt;&#xA;&lt;h1&gt;Example Input/Output&lt;/h1&gt;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;Input: n /3 + 2*n/3 + 175 - 175*(n+ 1-n)&#xA;Output: truthy&#xA;Explain: Simplifies to &amp;quot;n&amp;quot;&#xA;&#xA;Input: f&#xA;Output: truthy&#xA;Explain: Any variable is allowed&#xA;&#xA;Input: j*(j-3.1)/(j-   3.1)&#xA;Output: falsey&#xA;Explain: In normal math, this evaluates to j&#xA;However, when j is 3.1, it is undefined&#xA;Therefore, it doesn’t ALWAYS return its input&#xA;This is because when j is 3.1, the output is not 3.1&#xA;&#xA;Input: 1j&#xA;Output: truthy&#xA;Explain: 1j = j which is the input&#xA;&#xA;Input: n/2 + n/2&#xA;Output: truthy&#xA;Explain: Simplifies to 2n/2 = n which is the input&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so lowest amount of bytes wins!&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&lt;p&gt;I brought this back from a long time ago.&lt;/p&gt;&#xA;&lt;p&gt;Any unaddressed problems?&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&#xA;" OwnerUserId="95204" LastEditorUserId="95204" LastEditDate="2021-09-22T08:40:43.007" LastActivityDate="2021-09-22T08:40:43.007" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="20605" PostTypeId="2" ParentId="2140" CreationDate="2021-01-04T21:08:38.433" Score="1" Body="&lt;h1&gt;Win a K vs KQ endgame&lt;/h1&gt;&#xA;&lt;h2&gt;Summary&lt;/h2&gt;&#xA;&lt;p&gt;The goal of this challenge is to create a program or function which will win a Chess game with a King and Queen against a lone King. The user will specify three squares, representing the locations of the computer's King, the computer's Queen, and the user's King. The computer will then a output a move which will eventually lead to checkmate.&lt;/p&gt;&#xA;&lt;h2&gt;Input/Output&lt;/h2&gt;&#xA;&lt;p&gt;The program or function will first take as input three squares, representing the locations of the computer's King, the computer's Queen, and the user's King (not necessarily in that order). It can be assumed that the input is a legal position.&lt;/p&gt;&#xA;&lt;p&gt;Parsing input is not the point of this challenge, so all reasonable forms of input/output are allowed, including but not limited to&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Strings with algebraic chess notation such as &lt;code&gt;&amp;quot;Ke4&amp;quot;&lt;/code&gt; or &lt;code&gt;&amp;quot;Qf6&amp;quot;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Triples representing pieces and coordinates such as &lt;code&gt;('K', 0, 2)&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;After three squares are taken as input, the computer outputs a single legal move. Behaviour on invalid input is undefined.&lt;/p&gt;&#xA;&lt;h2&gt;Requirements&lt;/h2&gt;&#xA;&lt;p&gt;This procedure must terminate using your program or function:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;User sets up a legal KQ vs K position on a physical chessboard.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;User inputs the board position. The computer outputs a legal move. If the move is a checkmate, STOP.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;User makes the computer's move on the physical board.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;User makes a legal move for the lone king on the physical board.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;User goes to step 2 and repeats.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;In other words, the computer must eventually win by checkmate, through repeatedly using your program or function.&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, from any legal starting position the checkmate must occur in 50 or fewer moves by the computer.&lt;/p&gt;&#xA;&lt;p&gt;(Of course, a physical chessboard is in no way necessary to test the code; I only mentioned it to help visualize the procedure. The chessboard could just as well be visualized in the user's head.)&lt;/p&gt;&#xA;&lt;h2&gt;Possible test cases&lt;/h2&gt;&#xA;&lt;p&gt;The squares are given in the order: &lt;em&gt;computer's Queen, computer's King, user's King&lt;/em&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;c2, h8, a1&lt;/code&gt; (must avoid stalemate)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;a1, a2, a8&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;a8, a1, e5&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The checkmate must occur in 50 or fewer moves by the computer, but it does not need to be as fast as possible.&lt;/li&gt;&#xA;&lt;li&gt;Chess libraries are not permitted.&lt;/li&gt;&#xA;&lt;li&gt;Shortest program in each language (in bytes) wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Questions for sandbox&lt;/h2&gt;&#xA;&lt;p&gt;How can I word the rules better if they are not currently sufficiently clear?&lt;/p&gt;&#xA;" OwnerUserId="89930" LastEditorUserId="89930" LastEditDate="2021-01-11T16:28:38.230" LastActivityDate="2021-01-11T16:28:38.230" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="20606" PostTypeId="5" CreationDate="2021-01-04T21:18:35.447" Score="0" Body="&lt;p&gt;This tag is for questions that address the migration tools available to users with 3000 or more reputation. See &lt;a href=&quot;https://meta.stackexchange.com/questions/10249/what-is-migration-and-how-does-it-work&quot;&gt;this&lt;/a&gt; post on Mother Meta for the details on what migration is exactly.&lt;/p&gt;&#xA;&lt;p&gt;Use this tag for questions about the following things:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Requests for a new migration path - this site currently only has one migration path (from &lt;a href=&quot;https://codegolf.stackexchange.com&quot;&gt;CGCC main&lt;/a&gt; to &lt;a href=&quot;https://codegolf.meta.stackexchange.com&quot;&gt;CGCC meta&lt;/a&gt;), but up to 4 more may be set up if the community decides they are necessary&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/questions/tagged/support&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt; on the migration feature, specific to CGCC&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Be sure to read through the &lt;a href=&quot;https://meta.stackexchange.com/questions/10249/what-is-migration-and-how-does-it-work&quot;&gt;Mother Meta&lt;/a&gt;  &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq&lt;/a&gt; on migration, along with the &lt;a href=&quot;https://meta.stackexchange.com/questions/tagged/migration&quot;&gt;Mother Meta migration tag&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Questions discussing why and if a specific question can be migrated&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Note that questions should only be migrated from site &lt;strong&gt;A&lt;/strong&gt; to site &lt;strong&gt;B&lt;/strong&gt; if:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The question is off-topic on site &lt;strong&gt;A&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;The question is on-topic on site &lt;strong&gt;B&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;The question meets site guidelines (is clear enough, isn't too broad etc.) on site &lt;strong&gt;B&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-01-04T21:18:35.447" LastActivityDate="2021-01-04T21:18:35.447" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20607" PostTypeId="4" CreationDate="2021-01-04T21:18:35.447" Score="0" Body="For questions relating to the question migration moderation tool and questions about migrating specific questions" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-01-04T21:18:35.447" LastActivityDate="2021-01-04T21:18:35.447" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20609" PostTypeId="5" CreationDate="2021-01-05T14:41:31.047" Score="0" Body="&lt;p&gt;This tag should be used on questions that relate to the site's &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=moderators&quot;&gt;diamond♦ moderators&lt;/a&gt;, the &lt;a href=&quot;https://stackoverflow.blog/2009/05/18/a-theory-of-moderation/&quot;&gt;&amp;quot;human exception handlers&amp;quot;&lt;/a&gt; that deal with circumstances that cannot be moderated by regular site users (such as flagging posts)&lt;/p&gt;&#xA;&lt;p&gt;Questions with this tag typically discuss the actions of the elected moderators, the powers available to them and changes in the moderator team (e.g. moderator elections)&lt;/p&gt;&#xA;&lt;p&gt;This is often used in relation to the &lt;a href=&quot;/questions/tagged/moderation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;moderation&amp;#39;&quot; rel=&quot;tag&quot;&gt;moderation&lt;/a&gt; tag. However, that tag should be used to address questions on site moderation, which can be and is done by regular users as well (for example, editing, closing, deleting etc.). Consider whether your question is about the actions of the site moderators, or about a moderation action taken by site user. These tags may overlap, and are not mutually exclusive.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-01-05T14:41:31.047" LastActivityDate="2021-01-05T14:41:31.047" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20610" PostTypeId="4" CreationDate="2021-01-05T14:41:31.047" Score="0" Body="Questions about the site's diamond (♦) moderators, along with their powers and actions" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-01-05T14:41:31.047" LastActivityDate="2021-01-05T14:41:31.047" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20611" PostTypeId="5" CreationDate="2021-01-05T17:08:11.463" Score="0" Body="&lt;p&gt;Use this tag for questions that relate to site moderation. Note that any user with &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges&quot;&gt;15 rep or more&lt;/a&gt; may contribute towards moderating the site, not just the site's &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=moderators&quot;&gt;diamond moderators&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Questions with this tag typically discuss one or more of the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The site moderation tools and how to use them (for example, &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/close-questions&quot;&gt;close voting&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/access-review-queues&quot;&gt;the review queues&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/protect-questions&quot;&gt;protecting questions&lt;/a&gt; etc.)&lt;/li&gt;&#xA;&lt;li&gt;The site's current policies on moderation, such as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12220/weve-written-a-new-chatiquette-and-we-want-your-feedback&quot;&gt;the chat moderation policy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Why a specific action (such as closing a question or deleting a post) was taken by a user. In this case, please:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Be nice&lt;/strong&gt;. Stack Exchange's &lt;a href=&quot;https://meta.stackexchange.com/questions/240839/the-new-new-be-nice-policy-code-of-conduct-updated-with-your-feedback&quot;&gt;#1 rule&lt;/a&gt; still applies here. Frame your question in a respectful way, and try to make an attempt to learn from the answers you receive. Don't call users names, get angry with them or anything else that someone might consider rude. Remember: moderation actions &lt;strong&gt;are not personal&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;keep in mind, the user(s) in question is under no obligation to respond. Some users may not see the post, others may not want to answer it. Don't harass these (e.g. pinging in chat) to answer your question. If the user in question doesn't respond, others very well might.&lt;/li&gt;&#xA;&lt;li&gt;remember, you are not always in the right. A user may have abused their moderation powers in regard to your post, or they may not have. Just because you think the user has (or even just want to understand &lt;em&gt;why&lt;/em&gt;) does &lt;strong&gt;not&lt;/strong&gt; mean that's the case.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This tag may overlap with the similar &lt;a href=&quot;/questions/tagged/moderators&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;moderators&amp;#39;&quot; rel=&quot;tag&quot;&gt;moderators&lt;/a&gt; tag. When applying either tag to your question, ask yourself if your question applies specifically to the diamond moderators, or if it applies to any user with moderation powers. For example, only diamond moderators can handle flags, so a question about why a flag was handled in a specific way would be tagged &lt;a href=&quot;/questions/tagged/moderators&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;moderators&amp;#39;&quot; rel=&quot;tag&quot;&gt;moderators&lt;/a&gt;, whereas asking why a question was closed would be tagged &lt;a href=&quot;/questions/tagged/moderation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;moderation&amp;#39;&quot; rel=&quot;tag&quot;&gt;moderation&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-01-05T17:08:11.463" LastActivityDate="2021-01-05T17:08:11.463" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20612" PostTypeId="4" CreationDate="2021-01-05T17:08:11.463" Score="0" Body="Questions about moderation of this site, including the site moderation tools, policies on moderation and specific moderating actions taken by users" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-01-05T17:08:11.463" LastActivityDate="2021-01-05T17:08:11.463" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20613" PostTypeId="2" ParentId="2447" CreationDate="2021-01-05T20:40:56.240" Score="5" Body="&lt;h2&gt;Programs may take input based on their executable name.&lt;/h2&gt;&#xA;&lt;p&gt;i. e. &lt;code&gt;argv[0]&lt;/code&gt; in C or &lt;code&gt;$0&lt;/code&gt; in shell-like languages.&#xA;Thus the script &lt;code&gt;parrot.sh&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-sh prettyprint-override&quot;&gt;&lt;code&gt;#!/bin/sh&#xA;echo $0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;if having multiple &lt;a href=&quot;https://en.wikipedia.org/wiki/Ln_(Unix)&quot; rel=&quot;nofollow noreferrer&quot;&gt;links&lt;/a&gt; to it&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-sh prettyprint-override&quot;&gt;&lt;code&gt;ln parrot.sh foo&#xA;ln parrot.sh bar&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;prints different outputs&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-sh prettyprint-override&quot;&gt;&lt;code&gt;PATH=$(pwd) foo     #  will print e.g. /tmp/foo&#xA;PATH=$(pwd) bar     #  will print e.g. /tmp/bar&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;NB:&#xA;This rule is not applicable if the executable &lt;a href=&quot;/a/1072/&quot;&gt;file name &lt;em&gt;has&lt;/em&gt; to be a certain string&lt;/a&gt; to fulfill the programming challenge’s specifications at hand.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="94076" LastEditDate="2022-11-04T10:25:08.580" LastActivityDate="2022-11-04T10:25:08.580" CommentCount="8" CommunityOwnedDate="2021-01-05T20:40:56.240" ContentLicense="CC BY-SA 4.0" />
  <row Id="20614" PostTypeId="2" ParentId="2140" CreationDate="2021-01-05T21:55:56.873" Score="0" Body="&lt;h1&gt;possible chess moves in choice format&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot;&gt;chess&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&#xA;the goal is to make a function that takes in a board in choice format and color and outputs all possible moves.&lt;/p&gt;&#xA;&lt;p&gt;for example: &lt;code&gt;['pawn',1,1] -&amp;gt; ['pawn',1,2], ['pawn',1,3]&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="99946" LastEditorUserId="99946" LastEditDate="2021-01-07T17:38:57.737" LastActivityDate="2021-01-07T17:38:57.737" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="20615" PostTypeId="2" ParentId="20588" CreationDate="2021-01-06T01:16:25.010" Score="8" Body="&lt;h1&gt;Wild card&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18472/92901&quot;&gt;Repost of 2019&lt;/a&gt;. Also somewhat related to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14536/92901&quot;&gt;Overall best challenge&lt;/a&gt; from 2017.&lt;/p&gt;&#xA;&lt;p&gt;For a deserving challenge, answer, or user that isn't a good fit for any of the other categories.&lt;/p&gt;&#xA;" OwnerUserId="92901" LastActivityDate="2021-01-06T01:16:25.010" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20616" PostTypeId="2" ParentId="20588" CreationDate="2021-01-06T15:59:13.753" Score="4" Body="&lt;h1&gt;Best Tip&lt;/h1&gt;&#xA;&lt;p&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18469/66833&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14523/66833&quot;&gt;2017&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10939/66833&quot;&gt;2016&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For the best answer to a question tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;, because this site isn't just about competing with one another, but also about helping each other improve our golfing skills&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-01-06T15:59:13.753" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20617" PostTypeId="2" ParentId="20588" CreationDate="2021-01-06T16:04:42.120" Score="6" Body="&lt;h1&gt;Most involvement in an answer/answers&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18435/95792&quot;&gt;Partial repost of 2019&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For an answer or multiple answers where multiple people were involved. This could be multiple people helping out a user on a single answer, or a back-and-forth between two or more answers trying to outgolf each other.&lt;/p&gt;&#xA;" OwnerUserId="95792" LastActivityDate="2021-01-06T16:04:42.120" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20618" PostTypeId="2" ParentId="20588" CreationDate="2021-01-06T16:27:15.083" Score="9" Body="&lt;h1&gt;Most Underappreciated Challenge&lt;/h1&gt;&#xA;&lt;p&gt;For the best challenge that didn't really get noticed. Sometimes a challenge, especially one that's tough or not vanilla code golf, only gets a few votes, maybe an answer, then disappears.&lt;/p&gt;&#xA;&lt;p&gt;Solving a difficult challenge is rewarding; there's no reason we shouldn't reward the difficult challenges (that don't get noticed)!&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-01-06T16:27:15.083" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20619" PostTypeId="2" ParentId="20588" CreationDate="2021-01-07T07:24:41.983" Score="8" Body="&lt;h1&gt;Underappreciated answer&lt;/h1&gt;&#xA;&lt;p&gt;Like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20618/20260&quot;&gt;this category&lt;/a&gt;, but for answers. Great answers sometimes slip through the cracks and don't get a chance in the spotlight. Sometimes it's an answer posted after activity has died down on a challenge. Other times it's one that's hard to appreciate without specific background or context.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2021-01-07T14:25:46.517" LastActivityDate="2021-01-07T14:25:46.517" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20620" PostTypeId="2" ParentId="20588" CreationDate="2021-01-07T12:33:00.323" Score="4" Body="&lt;h1&gt;Trickiest Challenge&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18436/80214&quot;&gt;repost from 2019&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;It should look simple and tempt you to start coding right away, but coming up with a good solution should be hard.&lt;/p&gt;&#xA;" OwnerUserId="80214" LastActivityDate="2021-01-07T12:33:00.323" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20621" PostTypeId="2" ParentId="2140" CreationDate="2021-01-07T19:08:05.367" Score="1" Body="&lt;h1&gt;Map the alternating group A5 to the rotations of a dodecahedron&lt;/h1&gt;&#xA;&lt;p&gt;8 years ago, the Math Stack Exchange &lt;a href=&quot;https://math.stackexchange.com/questions/130464/theorem-the-icosahedral-group-is-isomorphic-to-the-alternating-group-a-5-ne&quot;&gt;was able&lt;/a&gt; to prove, in 523 characters of arcane incantation, that the alternating group A5 (ie all rearrangements of five objects that can be created by swapping two objects an even number of times) is isomorphic to the group of rotations of a dodecahedron that map vertices to vertices, edges to edges, and faces to faces. In my mind, 523 characters is far too many -- we can do better!&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;To solve this challenge, take as input a member a of A5, represented as an even permutation of the first 5 integers, and output a 3x3 rotation matrix that maps a dodecahedron to itself. Your program must be an isomorphism: This means that your program must output a unique rotation matrix for each element a, and for any elements of A5 a, b, c such that a composed with b yields c, then YourProgram(a) * YourProgram(b) = YourProgram(c) (to within  floating point precision, of course). Shortest program wins!&lt;/p&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;We present as an example one valid isomorphism, but any valid isomorphism is a permitted answer.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/q7NKC.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/q7NKC.png&quot; alt=&quot;Example Dodecahedron&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;We assosciate the colored cubes [red, green, yellow, blue, black] with the numbers [1, 2, 3, 4, 5]. Then, for each permutation a in A5, our example outputs a matrix that rotates the figure shown so as to permute the colored cubes according to a.&lt;/p&gt;&#xA;&lt;p&gt;[1, 2, 3, 4, 5] -&amp;gt; [[1, 0, 0][0, 1, 0],[0, 0, 1]]&lt;/p&gt;&#xA;&lt;p&gt;[2, 3, 1, 4, 5] -&amp;gt; [[0, 0, 1], [1, 0, 0], [0, 1, 0]] (a 120 degree rotation along the axis (1, 1, 1)&lt;/p&gt;&#xA;&lt;p&gt;[3, 4, 1, 2, 5] -&amp;gt; [[-1, 0, 0], [0, 1, 0], [0, 0, -1]] (a 180 degree rotation along the y axis ie coming towards the viewer)&lt;/p&gt;&#xA;&lt;p&gt;[4, 2, 3, 5, 1] -&amp;gt; [[-0.3090170,  0.5,  0.8090170]&#xA;[0.5,  0.8090170, -0.3090170]&#xA;[-0.8090170,  0.3090170, -0.5]]&lt;/p&gt;&#xA;&lt;p&gt;(a 60 degree rotation along the vector (1 / phi, phi, 0)&lt;/p&gt;&#xA;" OwnerUserId="19700" LastEditorUserId="19700" LastEditDate="2021-01-07T19:45:29.730" LastActivityDate="2021-01-07T19:45:29.730" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20622" PostTypeId="2" ParentId="2140" CreationDate="2021-01-07T21:06:34.660" Score="1" Body="&lt;p&gt;&lt;strong&gt;Battleships Board Validation&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Do you know the game Battleship? Well, I want to play with my little brother, but before we can begin we need to set up our ships on the board. This is your input.&lt;/p&gt;&#xA;&lt;p&gt;Now, we need to check that the ships that we set up are valid. This is where you come in to help. Your task is to write a program or function which checks whether the given 2d array (your board/input) is a valid board or not.&lt;/p&gt;&#xA;&lt;p&gt;The input will be a 2d array, where &lt;code&gt;1&lt;/code&gt; represents part of a ship and &lt;code&gt;0&lt;/code&gt; represents part of the ocean.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;The rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There must be:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;One battleship (size 4)&lt;/li&gt;&#xA;&lt;li&gt;Two cruisers (size 3)&lt;/li&gt;&#xA;&lt;li&gt;Three destroyers (size 2)&lt;/li&gt;&#xA;&lt;li&gt;Four submarines (size 1)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Any additional ships are not allowed, and neither are missing ships&lt;/li&gt;&#xA;&lt;li&gt;Each ship must be either vertical or horizontal (aside from submarines, which are a single grid space)&lt;/li&gt;&#xA;&lt;li&gt;The ships cannot overlap, but may be adjacent&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Solutions may not use streams.&lt;/p&gt;&#xA;&lt;p&gt;in addition, you must solve this with a &lt;code&gt;BF&lt;/code&gt; function (normally the class will also be called BF) which receives the 2d array(input) and uses a &lt;code&gt;validate&lt;/code&gt; function. Afterward, you are free to manipulate the 2d array however you want and add any functions that you want.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;here are some more examples that you can use to check your code:&#xA;is valid:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; {1,1,1,1,0,0,0,0,0,0},&#xA; {1,1,1,1,0,0,0,0,0,0},&#xA; {1,1,1,1,0,0,0,0,0,0},&#xA; {1,1,1,1,0,0,0,0,0,0},&#xA; {1,1,1,1,0,0,0,0,0,0},&#xA; {0,0,0,0,0,0,0,0,0,0},&#xA; {0,0,0,0,0,0,0,0,0,0},&#xA; {0,0,0,0,0,0,0,0,0,0},&#xA; {0,0,0,0,0,0,0,0,0,0},&#xA; {0,0,0,0,0,0,0,0,0,0},&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;wrong ships, result is false-&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; {1,0,0,0,0,1,1,0,0,0},&#xA; {1,0,1,0,0,0,0,0,1,0},&#xA; {1,0,1,0,1,1,1,0,1,0},&#xA; {1,0,0,0,0,0,0,0,0,0},&#xA; {0,0,0,0,0,0,0,0,1,0},&#xA; {0,0,0,0,1,1,1,0,0,0},&#xA; {0,1,0,0,0,0,0,0,1,0},&#xA; {0,0,0,1,0,0,0,0,0,0},&#xA; {0,0,0,0,0,0,0,1,0,0},&#xA; {0,0,0,0,0,0,0,0,0,0},&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;missing ships, is false-&amp;gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; {0,0,0,0,0,1,1,0,0,0},&#xA; {0,0,1,0,0,0,0,0,1,0},&#xA; {0,0,1,0,1,1,1,0,1,0},&#xA; {0,0,0,0,0,0,0,0,0,0},&#xA; {0,0,0,0,0,0,0,0,1,0},&#xA; {0,0,0,0,1,1,1,0,0,0},&#xA; {0,0,0,0,0,0,0,0,1,0},&#xA; {0,0,0,1,0,0,0,0,0,0},&#xA; {0,0,0,0,0,0,0,1,0,0},&#xA; {0,0,0,0,0,0,0,0,0,0},&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;check contact, is true-&amp;gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; {1,1,1,0,0,0,0,0,0,0},&#xA; {1,1,0,0,0,0,0,0,1,0},&#xA; {1,1,0,0,1,1,1,0,1,0},&#xA; {1,0,0,0,0,0,0,0,0,0},&#xA; {1,0,0,0,0,0,0,0,1,0},&#xA; {0,0,0,0,1,1,1,0,0,0},&#xA; {0,0,0,0,0,0,0,0,1,0},&#xA; {0,0,0,0,0,0,0,0,0,0},&#xA; {0,0,0,0,0,0,0,1,0,0},&#xA; {0,0,0,0,0,0,0,0,0,0},&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;check another one with contact-&amp;gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; {1,1,1,0,0,0,0,0,0,0},&#xA; {1,1,0,0,0,0,0,0,1,0},&#xA; {1,1,0,0,1,1,1,0,1,0},&#xA; {1,0,0,0,0,0,0,0,0,0},&#xA; {1,0,0,0,0,0,0,0,1,0},&#xA; {0,0,0,0,1,1,1,0,0,0},&#xA; {0,0,0,0,0,0,0,0,1,0},&#xA; {0,0,0,0,0,0,0,0,0,0},&#xA; {0,0,0,0,0,0,0,1,0,0},&#xA; {0,0,0,0,0,0,0,0,0,0},&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;check invalid, is false-&amp;gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; {0,1,1,1,0,0,0,0,0,0},&#xA; {0,0,0,1,1,1,0,0,0,0},&#xA; {0,1,1,1,0,0,0,0,0,0},&#xA; {0,0,0,1,1,1,0,0,0,0},&#xA; {0,1,1,1,0,1,1,0,0,0},&#xA; {0,1,0,0,0,0,1,1,0,0},&#xA; {0,0,0,0,0,0,0,0,0,0},&#xA; {0,0,0,0,0,0,0,0,0,0},&#xA; {0,0,0,0,0,0,0,0,0,0},&#xA; {0,0,0,0,0,0,0,0,0,0},&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;random board which is true-&amp;gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;{0,1,0,0,0,0,0,0,0,0},&#xA; {1,1,1,1,0,0,0,0,0,0},&#xA; {1,0,1,1,1,0,0,0,0,0},&#xA; {1,1,0,0,0,0,0,0,0,0},&#xA; {1,1,0,0,0,0,0,0,0,0},&#xA; {0,1,0,0,0,0,0,0,1,0},&#xA; {0,0,1,0,0,0,0,0,1,0},&#xA; {0,0,0,0,0,0,0,0,0,0},&#xA; {0,0,0,0,1,0,0,0,0,0},&#xA; {0,0,0,0,1,0,0,0,0,0},&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Who's code will be the shortest byte solution that passes all these examples successfully?! Good luck. ;)&lt;/p&gt;&#xA;&lt;p&gt;Any language is allowed, but I'd like to see an answer in Java especially.&lt;/p&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;link to the original post-&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/217437/java-validating-a-battleship-board?noredirect=1#comment507130_217437&quot;&gt;Validating a Battleship board&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;this also my first post that I am doing. Whats a good way to decide who is the winner and in what time frame? help would be appreciated&lt;/p&gt;&#xA;&lt;p&gt;(any sidenotes on how to improve?anything needing clarity?)&lt;/p&gt;&#xA;" OwnerUserId="100321" LastEditorUserId="100321" LastEditDate="2021-01-08T13:00:13.217" LastActivityDate="2021-01-08T13:00:13.217" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="20623" PostTypeId="2" ParentId="2140" CreationDate="2021-01-08T17:18:51.517" Score="0" Body="&lt;h1&gt;Divisor chains&lt;/h1&gt;&#xA;&lt;h2&gt;Definition&lt;/h2&gt;&#xA;&lt;p&gt;A simple path in the divisor graph of &lt;code&gt;{1,...,n}&lt;/code&gt; is a&#xA;sequence of distinct numbers between &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;n&lt;/code&gt; such that&#xA;if &lt;code&gt;k&lt;/code&gt; immediately follows &lt;code&gt;m&lt;/code&gt;, then either &lt;code&gt;k&lt;/code&gt; divides &lt;code&gt;m&lt;/code&gt;&#xA;or &lt;code&gt;m&lt;/code&gt; divides &lt;code&gt;k&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;(1) Return a list of integers that represents the&#xA;lexicographically earliest longest, simple path in the&#xA;divisor graph of &lt;code&gt;{1,...,n}&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Implement a named function with one argument, &lt;code&gt;f(n)&lt;/code&gt;, &lt;code&gt;n&lt;/code&gt; a&#xA;positive integer; you can assume &lt;code&gt;n &amp;lt;= 33&lt;/code&gt;. The function&#xA;takes the argument for input.&lt;/p&gt;&#xA;&lt;p&gt;No print statements (or other I/O-statements) are allowed in&#xA;the function; the return is a list (or tuple or array).&#xA;The use of external library functions is not allowed.&lt;/p&gt;&#xA;&lt;p&gt;(2) A print statement that prints the output of (1):&#xA;&lt;code&gt;print(f(n))&lt;/code&gt;. The function name &lt;code&gt;print&lt;/code&gt; is not obligatory&#xA;and the print function can use standard libraries.&lt;/p&gt;&#xA;&lt;h2&gt;Test&lt;/h2&gt;&#xA;&lt;p&gt;(1) For &lt;code&gt;n = 10&lt;/code&gt; the call &lt;code&gt;f(10)&lt;/code&gt; returns&#xA;&lt;code&gt;[4, 8, 1, 5, 10, 2, 6, 3, 9]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;(2) &lt;code&gt;print(f(10))&lt;/code&gt;. We do not fix the format of the returned&#xA;list. The output might also look like &lt;code&gt;4 8 1 5 10 2 6 3 9&lt;/code&gt;&#xA;or any other convenient way.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;This is code-golf with restricted-time, so the shortest code in&#xA;bytes wins if it can run the test above on TIO &lt;a href=&quot;https://tio.run/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://tio.run/&lt;/a&gt;&#xA;without timing out. Only the code of the generating function&#xA;f is counted, without the print statement.&lt;/p&gt;&#xA;&lt;p&gt;Tags: code-golf, restricted-time, math, sequence&lt;/p&gt;&#xA;" OwnerUserId="95501" LastActivityDate="2021-01-08T17:18:51.517" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20624" PostTypeId="1" CreationDate="2021-01-09T19:55:32.843" Score="7" ViewCount="158" Body="&lt;p&gt;About ten months ago, we got a &lt;a href=&quot;https://meta.stackexchange.com/questions/344513/the-new-ask-page-is-now-live-on-the-network&quot;&gt;new ask question page&lt;/a&gt;. This adds a few features:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A custom modal that appears when a user asks their first question:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/0i2Bt.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/0i2Btm.png&quot; alt=&quot;Modal&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Custom warnings in the &amp;quot;review&amp;quot; pane of the ask question page:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/5ZngH.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/5ZngHm.png&quot; alt=&quot;Warnings&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Custom warnings for tags&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Reasons&lt;/h2&gt;&#xA;&lt;p&gt;It's pretty often that we get simple help questions, or questions without objective winning criteria, or questions with unnecessarily restrictive I/O.&lt;/p&gt;&#xA;&lt;p&gt;Although some users will ignore the modal, it's much more &amp;quot;in your face&amp;quot; than the sidebar. If that doesn't work, we could have regex-based warnings that trigger:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a post has no winning criteria tags, or multiple&lt;/li&gt;&#xA;&lt;li&gt;If a post contains certain patterns that could indicate it's not intended to be a code golf or coding challenge&lt;/li&gt;&#xA;&lt;li&gt;If a post contains certain patterns that could indicate it includes I/O restrictions, banned languages, etc., a warning could be displayed in the sidebar (and the user is free to ignore that if it's a false positive)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This process requires staff to make the edits, so a post on the main meta would be required. If the general consensus here is that we should do this, I'll make a second post where we can decide on the specific changes.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Should we put in a request to change any of these things?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="68942" LastEditDate="2021-06-09T06:08:11.943" LastActivityDate="2021-06-09T06:08:11.943" Title="Should we update our ask question page?" Tags="|discussion|status-planned|asking-questions|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20625" PostTypeId="2" ParentId="20624" CreationDate="2021-01-09T20:26:27.117" Score="10" Body="&lt;h1&gt;Yes, we should&lt;/h1&gt;&#xA;&lt;p&gt;I see no harm in clarifying our &amp;quot;how to ask&amp;quot; help system, and if doing so leads to fewer off-topic or low quality questions, I 100% support this. It looks like, by my reckoning, that not many significant changes would need to be made; most of the problems are simply in the wordings of various points, which could be changed to text of our drafting.&lt;/p&gt;&#xA;&lt;h2&gt;Custom modal&lt;/h2&gt;&#xA;&lt;p&gt;The text for the modal reads:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;Asking a good question&lt;/h2&gt;&#xA;&lt;p&gt;You’re ready to ask your first question and the community is here to help! To get you the best answers, we’ve provided some guidance:&lt;/p&gt;&#xA;&lt;p&gt;Before you post, &lt;a href=&quot;https://codegolf.stackexchange.com/search&quot;&gt;search the site&lt;/a&gt; to make sure your question hasn’t been answered.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Summarize the problem&lt;/li&gt;&#xA;&lt;li&gt;Provide details and any research&lt;/li&gt;&#xA;&lt;li&gt;When appropriate, describe what you’ve tried&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;You’ll find more tips in the sidebar.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8350/were-not-a-qa-site-but-what-should-be-done-about-it&quot;&gt;We're not a Q&amp;amp;A site&lt;/a&gt;, so these 3 bullet points don't really apply here in the same way they do to most SE sites. I won't go through all 3 points, but generally, the wording isn't &lt;em&gt;bad&lt;/em&gt;, but it could do with improving to be more relevant to the site (especially point 3).&lt;/p&gt;&#xA;&lt;h2&gt;Custom review warnings&lt;/h2&gt;&#xA;&lt;p&gt;From my testing with a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/98181/meta-rep-bug-sockpuppet&quot;&gt;sockpuppet&lt;/a&gt;, it appears that we don't have any custom review warnings. Instead it simply shows this:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/wrjn7.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/wrjn7.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I think reiterating &lt;a href=&quot;https://i.stack.imgur.com/smrCm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;Step 1&lt;/a&gt; would be a good warning to have here (e.g. make sure you &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8130/66833&quot;&gt;include an objective winning criterion&lt;/a&gt;, make sure that all relevant information is written in the challenge itself rather than an external link, take a look at our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/66833&quot;&gt;input and output defaults&lt;/a&gt; and at our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1280/community-faq-for-programming-puzzles-code-golf&quot;&gt;FAQ&lt;/a&gt; etc.) but again, whatever text we draft if we decide to update it would be used.&lt;/p&gt;&#xA;&lt;h2&gt;Custom tag warnings&lt;/h2&gt;&#xA;&lt;p&gt;I've often said that I wish winning criteria tags were &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1281/66833&quot;&gt;required&lt;/a&gt;, but failing that, having a warning pop up if none of the tags match a specific list would work.&lt;/p&gt;&#xA;&lt;p&gt;I don't think it'd be necessary to list every winning criterion we have. Instead, limit the tags looked for to the most popular (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; etc.) and simply have the warning read something like&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Double check that you've included a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/908/66833&quot;&gt;winning criterion&lt;/a&gt; in the tags. Questions or challenges without an objective winning criterion will be closed.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;As winning criteria tags often include the &amp;quot;this is how to score with this tag&amp;quot; in the tag excerpt (and so can be easily read before adding them to your challenge), I don't think we'd need any &amp;quot;review boxes&amp;quot; to explain how/why to use criteria tags.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="92901" LastEditDate="2021-01-10T22:46:15.580" LastActivityDate="2021-01-10T22:46:15.580" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20626" PostTypeId="2" ParentId="2140" CreationDate="2021-01-10T11:05:43.240" Score="1" Body="&lt;h1&gt;Solve a Cubic Equation&lt;/h1&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program will take in the integer coefficients of the equation &lt;span class=&quot;math-container&quot;&gt;\$ax^3+bx^2+cx+d=0\$&lt;/span&gt; as inputs (a, b, c, and d)&lt;/li&gt;&#xA;&lt;li&gt;All solutions are between 1000 and -1000.&lt;/li&gt;&#xA;&lt;li&gt;a is nonzero&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All real solutions of the input equation, with an accuracy of at least the thousandths place.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Built-in equation solver are not allowed&lt;/li&gt;&#xA;&lt;li&gt;Native math libraries that do not solve equations may be used&lt;/li&gt;&#xA;&lt;li&gt;If you have any questions, please ask in comment&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;-1.651&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Another Valid Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;-1.651 -1.651 -1.651&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 3 0 -1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;-2.879 -0.653 0.532&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Worked Example  (C++) doesn't work with two roots&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##XZDbbsMgDIbv8xRWqiFoaAbp7hL6LsSUzVGaTD1IjdY@ewZJ22iTsQH/nzEybj4Rx3FFHbYXt4fqdHbU51@7hLozHCx1XCQ/CQC4/lK3e7CylihdGVMntJ3n6VvrXyuVzEpWS4aSOTFRvj/yRzGZjVZKlVSZec@MysNBiwhObZZOjaFsVsu/wqCNXVO0rJ4iBnf/oSJATbQAxYjBXxB5PuidUYwNRWXU7Tboar6FpHhAz/8sj14Np6wR70W5SN/HMKk4hXzbekjlVTzFezKF@zhqKGALH78&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#include &amp;lt;iostream&amp;gt;&#xA;#include &amp;lt;cstdio&amp;gt;&#xA;using namespace std;&#xA;int main()&#xA;{&#xA;   double a,b,c,d;&#xA;   scanf(&amp;quot;%lf%lf%lf%lf&amp;quot;,&amp;amp;a,&amp;amp;b,&amp;amp;c,&amp;amp;d);&#xA;   for(double i=-100;i&amp;lt;=100;i+=0.0001)&#xA;   {&#xA;      double j=i+0.0001;&#xA;      double y1=a*i*i*i+b*i*i+c*i+d;&#xA;      double y2=a*j*j*j+b*j*j+c*j+d;&#xA;      if(y1&amp;gt;=0&amp;amp;&amp;amp;y2&amp;lt;=0||y1&amp;lt;=0&amp;amp;&amp;amp;y2&amp;gt;=0)&#xA;      {&#xA;         double x=(i+j)/2;&#xA;         printf(&amp;quot;%.3lf &amp;quot;,x);&#xA;      }&#xA;   }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="100332" LastEditorUserId="100332" LastEditDate="2021-01-11T13:12:37.653" LastActivityDate="2021-01-11T13:12:37.653" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20627" PostTypeId="2" ParentId="2140" CreationDate="2021-01-10T18:19:32.397" Score="0" Body="&lt;h1&gt;Lazy Robot Monkey Problem&lt;/h1&gt;&#xA;&lt;h2&gt;Question Summary&lt;/h2&gt;&#xA;&lt;p&gt;You have made a robot monkey. The purpose of the robot is to move through the trees and try to reach as many as possible monkeys before running out of battery. You have to follow some rules while moving.&lt;/p&gt;&#xA;&lt;p&gt;You are give a interlinked tree in the following format :&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/AZGih.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/AZGih.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Here each 1 is a monkey and each 0 is an empty place.&lt;/p&gt;&#xA;&lt;p&gt;Each note can have multiple parents and Childs but unlike a Graph its direction is downward.&lt;/p&gt;&#xA;&lt;p&gt;The robot monkey has a initial energy value.&lt;/p&gt;&#xA;&lt;p&gt;The robot Monkey can  move through the nodes following certain rules:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Going up to the parent node needs 4 units energy.&lt;/li&gt;&#xA;&lt;li&gt;Going down to the child node needs 2 units energy.&lt;/li&gt;&#xA;&lt;li&gt;There may be some food at some nodes. Each times the monkey eats its energy increases by food value.&lt;/li&gt;&#xA;&lt;li&gt;The monkeys energy can never be negative.&lt;/li&gt;&#xA;&lt;li&gt;The monkey cannot eat more than the initial energy value.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;What to do?&lt;/h2&gt;&#xA;&lt;p&gt;You are given the initial node (where your robot monkey is initially sitting).&lt;/p&gt;&#xA;&lt;p&gt;The node is in the following format :&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;class Node:&#xA;    parents = [] # Will have all the parents&#xA;    children = [] # Will have all the children&#xA;    isMonkey = 1 # May be 0&#xA;    foodValue = 0 # May be anything&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You are also given a initial food value and the number of monkeys in the tree.&lt;/p&gt;&#xA;&lt;p&gt;You now have to find how many monkeys can you maximum meet with  before your battery dies.(by going to the same position)&lt;/p&gt;&#xA;&lt;p&gt;Your answer should be in format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;def monkeyMeet(initialNode, energy, totalMonkeys):&#xA;    # write your code here&#xA;    pass&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Or in any other programming language.&lt;/p&gt;&#xA;&lt;p&gt;The size of the tree may be huge.&lt;/p&gt;&#xA;" OwnerUserId="100355" LastActivityDate="2021-01-10T18:19:32.397" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20629" PostTypeId="2" ParentId="2140" CreationDate="2021-01-12T03:05:04.130" Score="2" Body="&lt;h1&gt;Run the lottery&lt;/h1&gt;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&lt;p&gt;Your job is to write a program to accept lottery tickets, adding all the money to a pool, and divvy out the winnings based on how many numbers each ticket has guessed correctly. The amount of money people spent on their tickets is used to determine how much each person should take home.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You will receive a list of lottery tickets, which will be how much the person has paid, along with 5 numbers between 1 and 25. The numbers do not have to be unique, and order matters. [1, 2, 3, 4, 5] and [3, 2, 1, 4, 5] are considered different, and [1, 1, 1, 1, 1] is a valid ticket.&lt;/li&gt;&#xA;&lt;li&gt;You will also receive 5 numbers between 1 and 25, which are the winning numbers. This follows the same restrictions as a participant's ticket.&lt;/li&gt;&#xA;&lt;li&gt;Each participant will be given a &amp;quot;score&amp;quot; based on how many numbers they guessed correctly. They must guess the number, and guess it in the correct spot as well. [x, x, 1, x, x] is not a winning number for [1, 2, 3, 4, 5]. [1, 1, 1, 2, 3] counts as 2 correct guesses for [1, 2, 1, 1, 1].&lt;/li&gt;&#xA;&lt;li&gt;The score is &lt;span class=&quot;math-container&quot;&gt;\$4^n\$&lt;/span&gt;  where &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is the number of winning numbers. Yes, a participant with 0 correct numbers has a score of 1, and is eligible to take home &lt;em&gt;some&lt;/em&gt; money.&lt;/li&gt;&#xA;&lt;li&gt;Each participant's final weight is their score times the amount they spent on the ticket. A person with a score of 4 (1 correct guess) and paid $4 for a ticket has the same weight as a person with a score of 16 (2 correct guesses) and paid $1 for their ticket.&lt;/li&gt;&#xA;&lt;li&gt;Finally, the prize pool is then divvied up. 10% goes to you, the lottery company. The remaining 90% gets divvied up proportionally by each participant's final weight, rounded to the cent.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The input and output of the program can be in any format. The only stipulation is that monetary values must be decimals. For instance, $15.68 cannot be represented as 1568.&lt;/p&gt;&#xA;&lt;h3&gt;Example game&lt;/h3&gt;&#xA;&lt;p&gt;The winning numbers are as follows&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;[2, 18, 1, 15, 7]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Four people bought tickets with the following prices and numbers&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;$6, [9, 5, 6, &lt;strong&gt;15&lt;/strong&gt;, 22], one match, score of 4, weight of 24&lt;/li&gt;&#xA;&lt;li&gt;$2, [&lt;strong&gt;2&lt;/strong&gt;, 25, 17, 7, &lt;strong&gt;7&lt;/strong&gt;], two matches, score of 16, weight of 32. Notice how only the second 7 counts, order matters&lt;/li&gt;&#xA;&lt;li&gt;$67, [11, 16, 9, 20, 16], no matches, score of 1, weight of 67&lt;/li&gt;&#xA;&lt;li&gt;$1, [12, 19, 6, 25, 2], no matches because the 2 is in the wrong spot, score of 1, weight of 1&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The total pool is $76, $68.4 after we take our cut, which is then sent out based on the weights. The sum of all weights is 124.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;First ticket gets 24/124, $13.24&lt;/li&gt;&#xA;&lt;li&gt;Second ticket gets 32/124, $17.65&lt;/li&gt;&#xA;&lt;li&gt;Third ticket gets 67/124, $36.96&lt;/li&gt;&#xA;&lt;li&gt;Fourth ticket gets 1/124, a whole 55 cents&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="39213" LastEditorUserId="39213" LastEditDate="2021-01-15T23:46:03.777" LastActivityDate="2021-01-15T23:46:03.777" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20630" PostTypeId="1" CreationDate="2021-01-12T18:28:45.727" Score="15" ViewCount="151" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/217526/smallest-image-containing-one-of-every-rgb-color&quot;&gt;This question&lt;/a&gt; jogged my memory that we have an expert in our ranks who might give a brilliant answer to this question - &lt;a href=&quot;https://codegolf.stackexchange.com/users/17193/glenn-randers-pehrson&quot;&gt;Glenn Randers-Perhson&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Coauthor of PNG spec, developer/maintainer of libpng, on development teams for ImageMagick and GraphicsMagick. Author of pngcrush. Maintains PNG support in Firefox. Retired, father of four, grandfather of fifteen.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;After a little googling, I was saddened to find that &lt;a href=&quot;https://sourceforge.net/p/png-mng/mailman/message/36447670/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Glenn passed away 2 years ago&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Thank you Glenn for your work on PNG - a vital part of the web as used by literally billions.&lt;/p&gt;&#xA;&lt;p&gt;Thank you also for your .SE contributions, including those to codegolf.  In the few interactions I had with Glenn, he was a real gentleman, greatly knowledgeable and always helpful.&lt;/p&gt;&#xA;" OwnerUserId="11259" LastActivityDate="2021-01-12T18:28:45.727" Title="RIP Glenn Randers-Pehrson" Tags="|discussion|" AnswerCount="0" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20631" PostTypeId="2" ParentId="2140" CreationDate="2021-01-13T20:49:48.787" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/217690/speed-of-lobsters&quot;&gt;Speed of Lobsters&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-01-18T10:47:35.633" LastActivityDate="2021-01-18T10:47:35.633" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20632" PostTypeId="2" ParentId="2140" CreationDate="2021-01-13T23:32:07.620" Score="1" Body="&lt;h1&gt;Is this a narrow Thumb instruction?&lt;/h1&gt;&#xA;&lt;p&gt;ARM Thumb was originally a 16-bit only subset of the 32-bit ARM instruction set.&lt;/p&gt;&#xA;&lt;p&gt;However, later versions added 32-bit &amp;quot;wide&amp;quot; instructions which were more flexible, and called the original, more restrictive 16-bit instructions &amp;quot;narrow&amp;quot; instructions.&lt;/p&gt;&#xA;&lt;p&gt;The assembler now chooses between narrow and wide instructions automatically, depending on how the instruction was written. However, this meant that the syntax had to be changed to have specific rules.&lt;/p&gt;&#xA;&lt;p&gt;Your job is to be this assembler.&lt;/p&gt;&#xA;&lt;p&gt;However, the programs you parse are not that interesting; they will only ever consist of &lt;code&gt;add&lt;/code&gt; and &lt;code&gt;adds&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;More specifically:&lt;/p&gt;&#xA;&lt;p&gt;Your task is to write a function or program that will take an &lt;code&gt;add&lt;/code&gt;/&lt;code&gt;adds&lt;/code&gt; instruction, and return a truthy value if it is a valid narrow instruction, or a falsey value if it is not.&lt;/p&gt;&#xA;&lt;h3&gt;Syntax rules&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;ARM has 16 registers, &lt;code&gt;r0&lt;/code&gt;-&lt;code&gt;r12&lt;/code&gt;, &lt;code&gt;r13&lt;/code&gt; (aka &lt;code&gt;sp&lt;/code&gt;), &lt;code&gt;r14&lt;/code&gt; (aka &lt;code&gt;lr&lt;/code&gt;), and &lt;code&gt;r15&lt;/code&gt; (aka &lt;code&gt;pc&lt;/code&gt;). For ease of parsing, we are going to refer to all registers by their number, instead of using the special register names.&lt;/li&gt;&#xA;&lt;li&gt;Do note the names when reading the official docs, as there are a lot of special cases for &lt;code&gt;sp&lt;/code&gt; and &lt;code&gt;pc&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;In Thumb mode, these are split into &amp;quot;Lo registers&amp;quot;, which are &lt;code&gt;r0&lt;/code&gt;-&lt;code&gt;r7&lt;/code&gt;, and &amp;quot;Hi registers&amp;quot; which are &lt;code&gt;r8&lt;/code&gt;-&lt;code&gt;r15&lt;/code&gt;. Many instructions can only use Lo registers.&lt;/li&gt;&#xA;&lt;li&gt;Many instructions use the same source register as the destination register, even if they are written with three operands.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;add&lt;/code&gt; and &lt;code&gt;adds&lt;/code&gt; are distinct instructions. &lt;code&gt;adds&lt;/code&gt; affects the condition flags, while &lt;code&gt;add&lt;/code&gt; does not. That is the difference, if you were wondering.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The following 6 forms are valid for narrow instructions (adapted from &lt;a href=&quot;https://www.keil.com/support/man/docs/armasm/armasm_dom1361289861747.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;):&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;adds x, y, #imm&lt;/code&gt;: &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; must both be Lo registers, and &lt;code&gt;imm&lt;/code&gt; is a 3-bit constant from &lt;code&gt;0-7&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;adds x, y, z&lt;/code&gt;: &lt;code&gt;x&lt;/code&gt;, &lt;code&gt;y&lt;/code&gt;, and &lt;code&gt;z&lt;/code&gt; must all be Lo registers.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;add x, x, y&lt;/code&gt;: &lt;code&gt;x&lt;/code&gt; &lt;strong&gt;and/or&lt;/strong&gt; &lt;code&gt;y&lt;/code&gt; must be Hi registers. Note that &lt;code&gt;x&lt;/code&gt; is repeated twice.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We are ignoring the fact that ARMv6 relaxed this rule to keep it interesting.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;ol start=&quot;4&quot;&gt;&#xA;&lt;li&gt;&lt;code&gt;adds x, x, #imm&lt;/code&gt;: &lt;code&gt;x&lt;/code&gt; must be a Lo register. &lt;code&gt;imm&lt;/code&gt; is an 8-bit constant from &lt;code&gt;0-255&lt;/code&gt;. Again, note that &lt;code&gt;x&lt;/code&gt; is repeated twice.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;add r13, r13, #imm&lt;/code&gt;: &lt;code&gt;imm&lt;/code&gt; is a constant multiple of 4 in the range &lt;code&gt;0-508&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;add x, y, #imm&lt;/code&gt;: &lt;code&gt;x&lt;/code&gt; must be a Lo register, and &lt;code&gt;y&lt;/code&gt; must either be &lt;code&gt;r13&lt;/code&gt; or &lt;code&gt;r15&lt;/code&gt;. &lt;code&gt;imm&lt;/code&gt; is a constant multiple of 4 in the range &lt;code&gt;0-1020&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Everything else is either a wide instruction or not valid.&lt;/p&gt;&#xA;&lt;h3&gt;Other notes&lt;/h3&gt;&#xA;&lt;p&gt;Standard loopholes, everything must be self-contained, and you are only allowed to treat it as text. You can't feed it to an assembler (unless you include the assembler source code in the result, but..  ｗｈｙ).&lt;/p&gt;&#xA;&lt;p&gt;The input can either be a string argument or text from stdin.&lt;/p&gt;&#xA;&lt;p&gt;You can assume the format will match the following format (all lowercase, separators being a single space):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;{add or adds} reg, reg, {#imm or reg}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Where &lt;code&gt;imm&lt;/code&gt; is a non-negative number in base 10 (yes, including zero).&lt;/p&gt;&#xA;&lt;p&gt;As a regex pattern:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;^adds? r([0-9]|1[0-5]), r([0-9]|1[0-5]), (#[0-9]+|r([0-9]|1[0-5]))$&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Reference implementation&lt;/h3&gt;&#xA;&lt;p&gt;In case the rules are difficult to follow, here is a reference implementation I made in C. Yes, I deliberately overabstracted it to make you do all the work.&lt;/p&gt;&#xA;&lt;p&gt;I resisted the urge to post the reference implementation in ARM Thumb assembly, as that would be genuinely evil. &lt;/p&gt;&#xA;&lt;p&gt;You will not need to do the same error checking I did here. You can always assume the string itself is valid. The error checks in the main function are mostly to show what CAN'T happen.&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-c prettyprint-override&quot;&gt;&lt;code&gt;#include &amp;lt;stdlib.h&amp;gt;&#xA;#include &amp;lt;stdint.h&amp;gt;&#xA;#include &amp;lt;stdio.h&amp;gt;&#xA;#include &amp;lt;stdbool.h&amp;gt;&#xA;#include &amp;lt;errno.h&amp;gt;&#xA;#include &amp;lt;inttypes.h&amp;gt;&#xA;&#xA;struct thumb_add_insn {&#xA;    char opcode[5];&#xA;    uint32_t op1;&#xA;    uint32_t op2;&#xA;    char op3_prefix;&#xA;    uint32_t op3;&#xA;};&#xA;&#xA;// Returns whether the opcode ID is adds.&#xA;static inline bool is_adds(const char *opcode)&#xA;{&#xA;    return strcmp(opcode, &amp;quot;adds&amp;quot;) == 0;&#xA;}&#xA;&#xA;// Returns whether this register ID belongs to a Lo register,&#xA;// specifically r0-r7.&#xA;static inline bool is_lo_reg(uint32_t reg_id)&#xA;{&#xA;    return reg_id &amp;lt;= 7;&#xA;}&#xA;&#xA;// Returns whether this register ID belongs to a Hi register,&#xA;// specifically r8-r15.&#xA;static inline bool is_hi_reg(uint32_t reg_id)&#xA;{&#xA;    return reg_id &amp;gt;= 8;&#xA;}&#xA;&#xA;// Returns whether the operand prefix is for an immediate&#xA;// value, specifically, '#'.&#xA;static inline bool is_imm(char c)&#xA;{&#xA;    return c == '#';&#xA;}&#xA;&#xA;// adds x, y, #imm3&#xA;static bool is_form_1(const struct thumb_add_insn *insn)&#xA;{&#xA;    return is_adds(insn-&amp;gt;opcode)&#xA;        &amp;amp;&amp;amp; is_lo_reg(insn-&amp;gt;op1)&#xA;        &amp;amp;&amp;amp; is_lo_reg(insn-&amp;gt;op2)&#xA;        &amp;amp;&amp;amp; is_imm(insn-&amp;gt;op3_prefix)&#xA;        &amp;amp;&amp;amp; insn-&amp;gt;op3 &amp;lt;= 7;&#xA;}&#xA;&#xA;// adds x, y, z&#xA;static bool is_form_2(const struct thumb_add_insn *insn)&#xA;{&#xA;    return is_adds(insn-&amp;gt;opcode)&#xA;        &amp;amp;&amp;amp; is_lo_reg(insn-&amp;gt;op1)&#xA;        &amp;amp;&amp;amp; is_lo_reg(insn-&amp;gt;op2)&#xA;        &amp;amp;&amp;amp; !is_imm(insn-&amp;gt;op3_prefix)&#xA;        &amp;amp;&amp;amp; is_lo_reg(insn-&amp;gt;op3);&#xA;}&#xA;&#xA;// adds x, x, #imm8&#xA;static bool is_form_3(const struct thumb_add_insn *insn)&#xA;{&#xA;    return is_adds(insn-&amp;gt;opcode)&#xA;        &amp;amp;&amp;amp; is_lo_reg(insn-&amp;gt;op1)&#xA;        &amp;amp;&amp;amp; insn-&amp;gt;op1 == insn-&amp;gt;op2&#xA;        &amp;amp;&amp;amp; is_imm(insn-&amp;gt;op3_prefix)&#xA;        &amp;amp;&amp;amp; insn-&amp;gt;op3 &amp;lt; 256;&#xA;}&#xA;&#xA;// add x, x, y&#xA;static bool is_form_4(const struct thumb_add_insn *insn)&#xA;{&#xA;    return !is_adds(insn-&amp;gt;opcode)&#xA;        &amp;amp;&amp;amp; !is_imm(insn-&amp;gt;op3_prefix)&#xA;        &amp;amp;&amp;amp; (is_hi_reg(insn-&amp;gt;op1) || is_hi_reg(insn-&amp;gt;op3))&#xA;        &amp;amp;&amp;amp; insn-&amp;gt;op1 == insn-&amp;gt;op2;&#xA;}&#xA;&#xA;// add r13, r13, #imm&#xA;static bool is_form_5(const struct thumb_add_insn *insn)&#xA;{&#xA;    return !is_adds(insn-&amp;gt;opcode)&#xA;        &amp;amp;&amp;amp; insn-&amp;gt;op1 == 13&#xA;        &amp;amp;&amp;amp; insn-&amp;gt;op1 == insn-&amp;gt;op2&#xA;        &amp;amp;&amp;amp; is_imm(insn-&amp;gt;op3_prefix)&#xA;        &amp;amp;&amp;amp; insn-&amp;gt;op3 &amp;lt;= 508&#xA;        &amp;amp;&amp;amp; insn-&amp;gt;op3 % 4 == 0;&#xA;}&#xA;&#xA;// add x, y, #imm, y == r13 or r15&#xA;static bool is_form_6(const struct thumb_add_insn *insn)&#xA;{&#xA;    return !is_adds(insn-&amp;gt;opcode)&#xA;        &amp;amp;&amp;amp; is_lo_reg(insn-&amp;gt;op1)&#xA;        &amp;amp;&amp;amp; (insn-&amp;gt;op2 == 13 || insn-&amp;gt;op2 == 15)&#xA;        &amp;amp;&amp;amp; is_imm(insn-&amp;gt;op3_prefix)&#xA;        &amp;amp;&amp;amp; insn-&amp;gt;op3 &amp;lt;= 1020&#xA;        &amp;amp;&amp;amp; insn-&amp;gt;op3 % 4 == 0;&#xA;}&#xA;&#xA;// Parses a Thumb add/adds instruction.&#xA;// Returns 1 if it is a narrow instruction, 0 if it is not,&#xA;// and -1 on an error.&#xA;int is_narrow_add(const char *str)&#xA;{&#xA;    // Note that you do not have to do error checking for the&#xA;    // competition.&#xA;&#xA;    if (str == NULL) {&#xA;        errno = EINVAL;&#xA;        return -1;&#xA;    }&#xA;&#xA;    // Allocate a 24 byte struct on the heap for good measure&#xA;    struct thumb_add_insn *insn = calloc(1, sizeof(*insn));&#xA;    if (insn == NULL) {&#xA;        return -1;&#xA;    }&#xA;&#xA;    // Parse the instruction with sscanf.&#xA;    // {adds} r{0}, r{3}, {#}{3}&#xA;    if (sscanf(str, &amp;quot;%4s r%&amp;quot;SCNu32&amp;quot;, r%&amp;quot;SCNu32&amp;quot;, %c%&amp;quot;SCNu32,&#xA;               insn-&amp;gt;opcode,&#xA;               &amp;amp;insn-&amp;gt;op1,&#xA;               &amp;amp;insn-&amp;gt;op2,&#xA;               &amp;amp;insn-&amp;gt;op3_prefix,&#xA;               &amp;amp;insn-&amp;gt;op3) != 5&#xA;       || (strcmp(insn-&amp;gt;opcode, &amp;quot;add&amp;quot;) != 0&#xA;          &amp;amp;&amp;amp; strcmp(insn-&amp;gt;opcode, &amp;quot;adds&amp;quot;) != 0)&#xA;       || insn-&amp;gt;op1 &amp;gt; 15&#xA;       || insn-&amp;gt;op2 &amp;gt; 15&#xA;       || (insn-&amp;gt;op3_prefix != 'r' &amp;amp;&amp;amp; insn-&amp;gt;op3_prefix != '#')&#xA;       || (insn-&amp;gt;op3_prefix == 'r' &amp;amp;&amp;amp; insn-&amp;gt;op3 &amp;gt; 15)&#xA;    ) {&#xA;        errno = EINVAL;&#xA;        free(insn);&#xA;        return -1;&#xA;    }&#xA;&#xA;    int ret;&#xA;    // Test against each of the forms&#xA;    if (is_form_1(insn)) {&#xA;        ret = 1;&#xA;    } else if (is_form_2(insn)) {&#xA;        ret = 1;&#xA;    } else if (is_form_3(insn)) {&#xA;        ret = 1;&#xA;    } else if (is_form_4(insn)) {&#xA;        ret = 1;&#xA;    } else if (is_form_5(insn)) {&#xA;        ret = 1;&#xA;    } else if (is_form_6(insn)) {&#xA;        ret = 1;&#xA;    } else { // not a match&#xA;        ret = 0;&#xA;    }&#xA;&#xA;    free(insn);&#xA;    return ret;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;pre class=&quot;lang-c prettyprint-override&quot;&gt;&lt;code&gt;adds r6, r3, #0    // true, form 1&#xA;adds r0, r1, #7    // true, form 1&#xA;add r0, r1, #3     // false, must be &amp;quot;adds&amp;quot;&#xA;adds r0, r9, #1    // false, r9 is a Hi register&#xA;adds r0, r1, #9    // false, must be 0-7&#xA;&#xA;adds r0, r0, r0    // true, form 2&#xA;adds r7, r1, r2    // true, form 2&#xA;adds r4, r4, r1    // true, form 2&#xA;add r7, r1, r2     // false, must be &amp;quot;adds&amp;quot;&#xA;adds r13, r14, r6  // false, r13 and r14 are Hi registers (this isn't even valid as a wide instruction)&#xA;&#xA;adds r0, r0, #0    // true, form 3&#xA;adds r5, r5, #249  // true, form 3&#xA;add r6, r6, #31    // false, must be &amp;quot;adds&amp;quot;&#xA;adds r3, r3, #256  // false, must be 0-255&#xA;adds r8, r8, #72   // false, r8 is a Hi register&#xA;&#xA;add r4, r4, r11    // true, form 4&#xA;add r8, r8, r5     // true, form 4&#xA;add r9, r9, r9     // true, form 4&#xA;add r14, r14, r12  // true, form 4&#xA;add r8, r9, r10    // false, Rd must be the same&#xA;add r1, r1, r0     // false, one must be a Hi register (we are ignoring the ARMv6 change)&#xA;&#xA;add r13, r13, #0   // true, form 5&#xA;add r13, r13, #48  // true, form 5&#xA;adds r13, r13, #64 // false, must be &amp;quot;add&amp;quot;&#xA;add r13, r13, #17  // false, not a multiple of 4&#xA;add r13, r13, #512 // false, must be 0-508&#xA;&#xA;add r0, r15, #0    // true, form 6&#xA;add r4, r13, #1000 // true, form 6&#xA;add r11, r13, #32  // false, r11 is a Hi register&#xA;add r2, r13, #4000 // false, must be 0-1020&#xA;adds r7, r15, #384 // false, must be &amp;quot;add&amp;quot;&#xA;add r3, r15, #127  // false, not a multiple of 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Things you can safely ignore:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-c prettyprint-override&quot;&gt;&lt;code&gt;// String will never be empty&#xA;adds r1, r2 // don't worry about implicit middle operand&#xA;adds R4, #12 // same&#xA;adds r3, r3, #-3 // adding a negative is not even a thing&#xA;add r0, r0, r99 // the only registers are r0 - r15&#xA;add r13, r13, #0x32 // it is base 10&#xA;subs r1, r1, r2 // only add and adds need to be handled&#xA;add r2, r2, lr // you don't need to handle the special names&#xA;add r0, sp, #0 // same&#xA;add #3, r1, r1 // only the last one will be an immediate&#xA;adds r3, r3, 32 // all immediates are prefixed with #&#xA;ADDS R0, R0, R1 // everything is lowercase&#xA;adds        r2,     r3 , r4 // only one space&#xA;adds r2,r3,r4 // there will always be spaces&#xA;addeq r0, r0, r1 // no IT blocks&#xA;adds.n r0, r0, r1 // no manual width specifiers&#xA;add r1, r2, r3, lsl #8 // no barrel shifting&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes per language wins.&lt;/p&gt;&#xA;&lt;p&gt;Proposed tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt; and maybe &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/assembly&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;assembly&amp;#39;&quot; rel=&quot;tag&quot;&gt;assembly&lt;/a&gt; but I think that is for things you must write in assembly, not parsing assembly itself.&lt;/p&gt;&#xA;" OwnerUserId="94093" LastEditorUserId="94093" LastEditDate="2021-01-15T08:58:15.530" LastActivityDate="2021-01-15T08:58:15.530" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20633" PostTypeId="1" CreationDate="2021-01-14T09:54:08.200" Score="4" ViewCount="118" Body="&lt;p&gt;Suppose a challenger submits a code-golf challenge to do a particular task, together with test inputs. (That is, they've determined that, in order to be convinced that the code in an answer correctly performs that task, it must do the right thing when given each of those test inputs.) How should a challenger judge the code in an answer, if that code is so slow that attempts to run it on some of those test inputs times out?&lt;/p&gt;&#xA;&lt;p&gt;I'm wondering how to judge &lt;a href=&quot;https://codegolf.stackexchange.com/a/217505&quot;&gt;this answer&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I see that questions were asked on meta some years ago, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/281&quot;&gt;Can code-golf answers be too slow?&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4981&quot;&gt;May they take a very long time?&lt;/a&gt;. I don't see that there's any such thing as &amp;quot;too slow for golf&amp;quot;. Yes, it's &lt;em&gt;allowed&lt;/em&gt;. My problem is how to judge code that takes too much time to &lt;em&gt;verify&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="79069" LastActivityDate="2021-01-14T09:54:08.200" Title="How should answers that time out be judged?" Tags="|discussion|code-golf|accepted-answer|" AnswerCount="0" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="20635" PostTypeId="2" ParentId="2140" CreationDate="2021-01-14T20:44:57.147" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/218017/implement-a-zipwith-function&quot;&gt;Implement a zipwith function&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-01-26T11:07:24.473" LastActivityDate="2021-01-26T11:07:24.473" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="20638" PostTypeId="1" CreationDate="2021-01-16T16:19:55.247" Score="13" ViewCount="1200" Body="&lt;h3&gt;Final phase&lt;/h3&gt;&#xA;&lt;p&gt;You have chosen the categories and the nominees for CGCC's annual “Best of”. Now it is time to pick the winners!&lt;/p&gt;&#xA;&lt;p&gt;Each of the fourteen categories is represented by an answer to this question, and each of these answers contains all nominations by the members of our community.&lt;/p&gt;&#xA;&lt;h3&gt;Voting mechanism&lt;/h3&gt;&#xA;&lt;p&gt;Each nominee has been added as a comment to its category's answer. In each category, the nominee whose comment has the highest number of votes by Feb 14 23:59 UTC will be declared the winner of that category.&lt;/p&gt;&#xA;&lt;h3&gt;Further details&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Starting now, please do &lt;strong&gt;not&lt;/strong&gt; edit the answers.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Please do &lt;strong&gt;not&lt;/strong&gt; add comments to the answers.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Votes on the question and on answers are meaningless; only votes on comments count.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Feel free to vote for multiple nominees of the same category, including your own posts.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="68942" LastEditDate="2021-04-03T20:35:01.290" LastActivityDate="2021-04-03T20:35:01.290" Title="Cast your vote for Best of CGCC 2020" Tags="|discussion|best-of|" AnswerCount="14" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20639" PostTypeId="2" ParentId="20638" CreationDate="2021-01-16T16:20:18.077" Score="2" Body="&lt;h1&gt;Most Underappreciated Challenge&lt;/h1&gt;&#xA;&lt;p&gt;For the best challenge that didn't really get noticed. Sometimes a challenge, especially one that's tough or not vanilla code golf, only gets a few votes, maybe an answer, then disappears.&lt;/p&gt;&#xA;&lt;p&gt;Solving a difficult challenge is rewarding; there's no reason we shouldn't reward the difficult challenges (that don't get noticed)!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/205654/78410&quot;&gt;Explicit-ify APL expressions involving trains&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;@Bubbler&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;(Self-nomination)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;As a challenge made after a feature of APL, I knew it would be trivial in APL, so I tried to make the task so that it's not &lt;em&gt;that&lt;/em&gt; trivial to use that feature while allowing other languages to use other approaches, e.g. repeated string substitution. To my disappointment, the challenge simply went out of sight after getting an APL answer and nothing else.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/214638/total-resistance-from-unit-resistors&quot;&gt;Total resistance from unit resistors&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/53884/peter-kagey&quot;&gt;Peter Kagey&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;(Nominated by user)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a thought-provoking question, and is rather well written, with pictures to aid in understanding it and a clear specification. However, there is only one answer to it, and the question itself only has 10 upvotes.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="95792" LastEditDate="2021-01-22T23:18:11.533" LastActivityDate="2021-01-22T23:18:11.533" CommentCount="2" CommunityOwnedDate="2021-01-16T16:20:18.077" ContentLicense="CC BY-SA 4.0" />
  <row Id="20640" PostTypeId="2" ParentId="20638" CreationDate="2021-01-16T16:20:37.373" Score="2" Body="&lt;h1&gt;Rookie of the Year - Challenges&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18437/66833&quot;&gt;Repost of 2019&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For the best challenge written by a new user in 2020. This doesn't have to be a user who created their account in 2020; rather, this is for any challenge posted in 2020 by a user who didn't post any challenges before 2020.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1361382/2020-answers-by-users-with-no-answers-before-2020&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE data query&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/199184/78410&quot;&gt;How far should I sum?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/75323/rgs&quot;&gt;@RGS&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;@Bubbler&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;RGS posted 40 challenges in 2020, 39 of which were well-received (positive score), which is a great achievement. I couldn't choose the &lt;em&gt;best&lt;/em&gt; one out of them, so I decided to nominate one of simple, clearly written ones. They also successfully hosted &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/18545/78410&quot;&gt;RGS's Golfing Showdown&lt;/a&gt;, a golfing event of five challenges.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/215216/high-throughput-fizz-buzz&quot;&gt;High throughput Fizz Buzz&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/99226/omer-tuchfeld&quot;&gt;Omer Tuchfeld&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by @cairdcoinheringaaing&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is Omer's first and only challenge on the site, and is a textbook example (IMO) of how new users should post challenges to the site. Omer &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=56146123#56146123&quot;&gt;asked around in chat&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20495/66833&quot;&gt;posted in the Sandbox&lt;/a&gt; and finally posted a high quality, non-&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge. The question has received some impressive answers, including &lt;a href=&quot;https://codegolf.stackexchange.com/a/215218/66833&quot;&gt;this&lt;/a&gt; first post by &lt;a href=&quot;https://codegolf.stackexchange.com/users/99238/isaac-g&quot;&gt;Issac G.&lt;/a&gt;, is the highest voted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/search?tab=votes&amp;amp;q=%5bfastest-code%5d%20created%3a2020%20is%3aq&quot;&gt;challenge this year&lt;/a&gt;, and is well-deserving of a reward.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-01-23T17:15:23.493" LastActivityDate="2021-01-23T17:15:23.493" CommentCount="2" CommunityOwnedDate="2021-01-16T16:20:37.373" ContentLicense="CC BY-SA 4.0" />
  <row Id="20641" PostTypeId="2" ParentId="20638" CreationDate="2021-01-16T16:20:53.847" Score="2" Body="&lt;h1&gt;Best mathematical insight&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17317/78410&quot;&gt;Repost of 2018&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18442/78410&quot;&gt;2019&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;On this site we often see answers in languages specifically designed for short code, or designed to be fast. Sometimes, a nice golfing trick or speed-up technique surprises us with its ingenuity, beyond the standard use of that language.&lt;/p&gt;&#xA;&lt;p&gt;And occasionally an answer shows up that uses an unexpected approach to greatly simplify the problem, and makes us wonder how the author could ever think of that. This usually involves some far-from-obvious mathematical equivalence, or a particularly simple approach to the problem that was not evident at all (once revealed, other answers often follow the same approach).&lt;/p&gt;&#xA;&lt;p&gt;This category is for the answer with the best &lt;strong&gt;mathematical&lt;/strong&gt; insight or unexpected approach that led to greatly simplifying the problem, in &lt;strong&gt;any challenge type&lt;/strong&gt; (code golf, fastest code, or others). The insight should have led to a significant improvement according to the challenge's metric (code length, run time, or whatever applicable).&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;My&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/213994/78410&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/213990/78410&quot;&gt;Count the Collatz survivors mod 2^n&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;(Self-nominated by @Bubbler)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I'm nominating this answer since I think it is the most mathematically interesting answer I posted last year (and unfortunately I couldn't remember any of someone else's), and all of the other answers use the same algorithm. The mathematics itself is not &lt;em&gt;that&lt;/em&gt; far from obvious (one can derive the property with some basic knowledge in number theory); nevertheless, it did simplify the problem to one that was well-suited for golfing in many different languages.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/92237/surculose-sputum&quot;&gt;Surculose Sputum&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/203855/80214&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/203853/perimeter-of-conway-hexagon/203855#203855&quot;&gt;Perimeter of Conway Hexagon&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;(Nominated by @Razetime)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;For what looked like a mostly tedious geometric calculation, Surculose Sputum condensed the problem into a short and simple algebraic formula, which all the other answers proceeded to use(including mine). It also outgolfed xnor's existing Python 3 solution(!), which they later modified to use the same formula.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/48931/sisyphus&quot;&gt;Sisyphus&lt;/a&gt;' &lt;a href=&quot;https://codegolf.stackexchange.com/a/213913/66833&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/213899/calculate-the-inverse-of-a-matrix&quot;&gt;Calculate the inverse of a matrix&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;(Nominated by @cairdcoinheringaahing)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;When I wrote this challenge, I fully expected most answers to simply use a builtin or something similar (such as the Jelly and MATL answers - matrix power to the &lt;span class=&quot;math-container&quot;&gt;\$-1\$&lt;/span&gt;). Sisyphus provided a brilliant iterative example and then went ahead and found a way to simplify it by choosing an easy to code &lt;span class=&quot;math-container&quot;&gt;\$V_0\$&lt;/span&gt; (as many answers that ported this noted, &lt;span class=&quot;math-container&quot;&gt;\$\text{tr}(AA^T) = \sum_{i,j} a^2_{ij}\$&lt;/span&gt;). Just scrolling through the answers, you'll find that around a third use Sisyphus' method while almost all the rest use a builtin. If that wasn't enough, Sisyphus then stuck around the thread and continued to help users golf their answers with even more mathematical insights.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-01-23T16:40:09.987" LastActivityDate="2021-01-23T16:40:09.987" CommentCount="3" CommunityOwnedDate="2021-01-16T16:20:53.847" ContentLicense="CC BY-SA 4.0" />
  <row Id="20642" PostTypeId="2" ParentId="20638" CreationDate="2021-01-16T16:21:41.243" Score="2" Body="&lt;h1&gt;Underappreciated answer&lt;/h1&gt;&#xA;&lt;p&gt;Like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20639/66833&quot;&gt;this category&lt;/a&gt;, but for answers. Great answers sometimes slip through the cracks and don't get a chance in the spotlight. Sometimes it's an answer posted after activity has died down on a challenge. Other times it's one that's hard to appreciate without specific background or context.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/caird-coinheringaahing&quot;&gt;My&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/215387/66833&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/71467/implement-the-enigma-machine&quot;&gt;Implement the Enigma Machine&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination by @cairdcoinheringaahing&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is probably the answer I spent the most amount of time and effort on this year. The fact that the only other answer to the question is in Python and is 10 times the length suggests just how difficult the task is. This was compounded by the string based nature of the challenge and the fact that a variable's value changed each &amp;quot;step&amp;quot; in the program - two things Jelly really isn't good for. While the answer did get a few upvotes, I think in comparison to the effort put in, it flew mainly under the radar.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;My&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/214722/80214&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/120121/ascii-art-venn-diagram/214722#214722&quot;&gt;ASCII-art Venn diagram&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;strong&gt;Self-nomination by @Razetime&lt;/strong&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Husk is a language which isn't particularly well-known for its string manipulation or ascii-art capabilities. That being said, it took me few days to write this answer and figure out all the type inference problems, and finally arrive at a correctly formatted solution that inferred in time. And surprisingly, after all those adjustments, it beat the Charcoal solution! I think it deserves more viewings(and some golfing suggestions) for the effort I put into it.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-01-23T16:39:33.997" LastActivityDate="2021-01-23T16:39:33.997" CommentCount="2" CommunityOwnedDate="2021-01-16T16:21:41.243" ContentLicense="CC BY-SA 4.0" />
  <row Id="20643" PostTypeId="2" ParentId="20638" CreationDate="2021-01-16T16:21:59.537" Score="6" Body="&lt;h1&gt;Wild card&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18472/92901&quot;&gt;Repost of 2019&lt;/a&gt;. Also somewhat related to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14536/92901&quot;&gt;Overall best challenge&lt;/a&gt; from 2017.&lt;/p&gt;&#xA;&lt;p&gt;For a deserving challenge, answer, or user that isn't a good fit for any of the other categories.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/9486/silvio-mayolo&quot;&gt;@SilvioMayolo&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/207418/92901&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/207410/92901&quot;&gt;Distinguish English and Spanish with regular expressions&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;b&gt; (Nominated by @Dingus) &lt;/b&gt;&lt;/p&gt;&#xA;&lt;p&gt;The original 60 % accuracy threshold for this challenge turned out to be a little loose . . . and this was the astonishing one-byte answer that proved it.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/101222/hexasweep-part-1-the-solver/211376#211376&quot;&gt;My answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/101222/hexasweep-part-1-the-solver&quot;&gt;Hexasweep (part 1): The Solver&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;(Self-nomination by @RedwolfPrograms)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I usually don't do much answering on this site, so I'm kind of proud of this one. I ended up spending a weekend (and a pad of isometric grid paper) on it, as it'd been unsolved for nearly four years.&lt;/p&gt;&#xA;&lt;p&gt;Also, if anyone wants to try answering it themselves my solution is definitely far from optimal!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;My&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/search?tab=newest&amp;amp;q=user%3a78410%20conway&quot;&gt;series of 12 challenges&lt;/a&gt; to commemorate &lt;a href=&quot;https://en.wikipedia.org/wiki/John_Horton_Conway&quot; rel=&quot;nofollow noreferrer&quot;&gt;John Conway&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;(Self-nomination by @Bubbler)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;From Wikipedia:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;On 11 April 2020, at age 82, [John Conway] died of complications from COVID-19.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Conway was a truly brilliant mathematician. He made numerous contributions in so many fields of mathematics, so much that Wikipedia had to have a dedicated page for the &lt;a href=&quot;https://en.wikipedia.org/wiki/List_of_things_named_after_John_Horton_Conway&quot; rel=&quot;nofollow noreferrer&quot;&gt;list of things &lt;em&gt;named after&lt;/em&gt; him&lt;/a&gt;. Among them were &lt;a href=&quot;https://codegolf.stackexchange.com/q/203680/78410&quot;&gt;three Turing-complete esolangs&lt;/a&gt;, which gave me the idea to start this series of Conway-themed challenges on Code Golf.&lt;/p&gt;&#xA;&lt;p&gt;While I had the list of Conway's achievements, it was definitely not easy to find suitable ideas for Code Golf challenges. Some were mathematically prohibitive, and some didn't have suitable input parameters. Also, I wanted to include challenge types other than plain &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, which made things even harder. Fortunately I could pull out two &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;s and one &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; in the theme.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="78410" LastEditDate="2021-01-25T07:45:31.177" LastActivityDate="2021-01-25T07:45:31.177" CommentCount="3" CommunityOwnedDate="2021-01-16T16:21:59.537" ContentLicense="CC BY-SA 4.0" />
  <row Id="20644" PostTypeId="2" ParentId="20638" CreationDate="2021-01-16T16:22:14.533" Score="3" Body="&lt;h1&gt;Best Explanation&lt;/h1&gt;&#xA;&lt;p&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18451/66833&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17315/66833&quot;&gt;2018&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14512/66833&quot;&gt;2017&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10940/66833&quot;&gt;2016&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This category is for the answer with the best explanation accompanying it. Ideally, the winner will be an answer with a very detailed explanation that is accessible to anyone, regardless of the amount of relevant knowledge already possessed.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal?tab=profile&quot;&gt;My&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/210307/78850&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/58615/1-2-fizz-4-buzz&quot;&gt;1, 2, Fizz, 4, Buzz&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;(self nomination by @Lyxal)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Even though I only copied the explanation in recently, I typed up and shared it in November 2020 in &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/56149682#56149682&quot;&gt;The Tarpit chatroom&lt;/a&gt; as a 1 hour &amp;quot;lesson&amp;quot;. This explanation gives a detailed account on how one gets from a very rudimentary Fizzbuzz program (75 bytes long) to the answer linked (18 bytes long) in a series of iterations explaining where golfs can be made, and why those golfs are made. While it does assume some knowledge of stack mechanisms, the assumptions made are light, and only require one to understand how pushing values and popping values works. Other than that, every syntactical element is described over the course of 8 different fizzbuzzes.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/17216/deadcode&quot;&gt;Deadcode's&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/198428/95792&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/198427/95792&quot;&gt;Shift right by half a bit&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;(Nomination by @user)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this answer, Deadcode manages to use only regex to divide by &lt;span class=&quot;math-container&quot;&gt;\$\sqrt 2\$&lt;/span&gt;. Their explanation is just as impressive as the answer they submitted, and while it is not particularly easy to understand, they've explained it well enough that someone could follow along. Before reading it, I had no idea you could use regex for such complex operations.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/213793&quot;&gt;Wheat Wizard's answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/101638&quot;&gt;Shortest code to produce non-deterministic output&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;(self nomination)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;With such a simple challenge this answer delivers an odyssey of an explanation.  It explains the implementation details of Haskell's type system, the ways in which functional languages allocate data, and even some kernel level security features while always being relevant to the answer.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="56656" LastEditDate="2021-01-24T00:31:45.187" LastActivityDate="2021-01-24T00:31:45.187" CommentCount="3" CommunityOwnedDate="2021-01-16T16:22:14.533" ContentLicense="CC BY-SA 4.0" />
  <row Id="20645" PostTypeId="2" ParentId="20638" CreationDate="2021-01-16T16:22:31.277" Score="4" Body="&lt;h1&gt;Most involvement in an answer/answers&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18435/95792&quot;&gt;Partial repost of 2019&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For an answer or multiple answers where multiple people were involved. This could be multiple people helping out a user on a single answer, or a back-and-forth between two or more answers trying to outgolf each other.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/95126/dominic-van-essen&quot;&gt;Dominic Van Essen&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/214711/95792&quot;&gt;answer&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/86301/robin-ryder&quot;&gt;Robin Ryder&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/214691/95792&quot;&gt;answer&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/users/67312/giuseppe&quot;&gt;Giuseppe&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/214683/95792&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/214678/95792&quot;&gt;Is It A Rainbow Color?&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;(Nominated by user)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;First Giuseppe posted a 60 byte answer. Robin Ryder, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/214678/is-it-a-rainbow-color/214683#comment502213_214683&quot;&gt;being sportsmanlike&lt;/a&gt;, suggested a 47 byte alternative (a whopping -13 bytes!), and Giuseppe golfed that further to 44.&lt;/p&gt;&#xA;&lt;p&gt;Then Robin Ryder had another idea, and this time they posted their own 41 byte answer using a different approach, now the shortest R answer.&lt;/p&gt;&#xA;&lt;p&gt;Suddenly, Dominic Van Essen swooped in with a 35 byte answer, shocking everyone! Robin Ryder heroically countered with a last minute 33-byter, but alas, it was in vain, for Dominic Van Essen &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/214711/3&quot;&gt;changed directions&lt;/a&gt; and made it to the 28 byte mark, where &lt;a href=&quot;https://codegolf.stackexchange.com/users/9365/dom-hastings&quot;&gt;Dom Hastings&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/caird-coinheringaahing&quot;&gt;caird coinheringaahing&lt;/a&gt; carried the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/214678/is-it-a-rainbow-color/214711#comment502273_214711&quot;&gt;exhausted&lt;/a&gt; R Rainbow champion to the 26-byte line!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/207560/print-x-without-x-robbers-thread/209443?r=SearchResults&amp;amp;s=1%7C79.6489#209443&quot;&gt;My&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/207560/print-x-without-x-robbers-thread/209449?r=SearchResults&amp;amp;s=3%7C75.1003#209449&quot;&gt;8&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/207560/print-x-without-x-robbers-thread/209452?r=SearchResults&amp;amp;s=4%7C75.1003#209452&quot;&gt;answer&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/207560/print-x-without-x-robbers-thread/209455?r=SearchResults&amp;amp;s=6%7C74.8887#209455&quot;&gt;cop-cracking&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/207560/print-x-without-x-robbers-thread/209457?r=SearchResults&amp;amp;s=7%7C74.8887#209457&quot;&gt;tennis&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/207560/print-x-without-x-robbers-thread/209483?r=SearchResults&amp;amp;s=8%7C74.8887#209483&quot;&gt;match&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/207560/print-x-without-x-robbers-thread/209492?r=SearchResults#209492&quot;&gt;with&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/207560/print-x-without-x-robbers-thread/209495?r=SearchResults&amp;amp;s=2%7C75.9832#209495&quot;&gt;HighlyRadioactive&lt;/a&gt; - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/207560/print-x-without-x-robbers-thread?r=SearchResults&amp;amp;s=1%7C110.1570&quot;&gt;Print X without X&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;(self nomination by Lyxal)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This was a fun little exchange of cop and robber answers for which HighlyRadioactive provided cop answers in &amp;gt;&amp;lt;&amp;gt; and which I promptly cracked. The irony about this chain is that the intended answers were much shorter than what I came up with. I don't think anyone else engaged in such a long challenge chain.&lt;/p&gt;&#xA;&lt;p&gt;It started off with HighlyRadioactive (hereby referred to as HR) posting an easy enough &lt;a href=&quot;https://codegolf.stackexchange.com/a/209440/78850&quot;&gt;first cop (which required usage of &lt;code&gt;o&lt;/code&gt;)&lt;/a&gt;, which I swiftly &lt;a href=&quot;https://codegolf.stackexchange.com/a/209443/87986&quot;&gt;cracked&lt;/a&gt;. HR shot back with &lt;a href=&quot;https://codegolf.stackexchange.com/a/209445/78850&quot;&gt;the second cop, which barred numbers, making constants harder to push to the stack&lt;/a&gt;. But with the power of colons, &lt;code&gt;l&lt;/code&gt;s and &lt;code&gt;+&lt;/code&gt;s, it was &lt;a href=&quot;https://codegolf.stackexchange.com/a/209449/78850&quot;&gt;cracked by me&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Round three was &lt;a href=&quot;https://codegolf.stackexchange.com/a/209451/78850&quot;&gt;just another restriction of constants (the length operator this time)&lt;/a&gt;, but that was easily circumnavigated using &lt;a href=&quot;https://codegolf.stackexchange.com/a/209452/78850&quot;&gt;ASCII character codes&lt;/a&gt;. Round four &lt;a href=&quot;https://codegolf.stackexchange.com/a/209453/78850&quot;&gt;introduced a slight inconvenience into the works (by banning something that would make constants more tedious to produce)&lt;/a&gt; - something which I responded &lt;a href=&quot;https://codegolf.stackexchange.com/a/209455/78850&quot;&gt;by getting creative and using the fact that -1 is returned when there is no input&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Round five &lt;a href=&quot;https://codegolf.stackexchange.com/a/209456/78850&quot;&gt;ruined that previous approach&lt;/a&gt;, but I &lt;a href=&quot;https://codegolf.stackexchange.com/a/209457/78850&quot;&gt;still had ASCII characters up my sleeve&lt;/a&gt;, so the games continued.&lt;/p&gt;&#xA;&lt;p&gt;Then came round six. I probably shouldn't have made the whole entire ASCII stuff obvious because &lt;a href=&quot;https://codegolf.stackexchange.com/a/209458/78850&quot;&gt;HR barred that too&lt;/a&gt;. For a while, I was at a loss on how to even generate any form of number on the stack - I had no numbers, no literals and everything else that pushed a number was banned. But I wasn't about to give up. Desperate to find something to use, I looked at the command line flags to see what I could potentially twist to the purposes of making something out of nothing. Then I saw it... the &lt;code&gt;-v&lt;/code&gt; interpreter flag which allows one to pre-initialise the stack with values. I got straight to work, typing up &lt;a href=&quot;https://codegolf.stackexchange.com/a/209483/78850&quot;&gt;649 colons, plus symbols and &lt;code&gt;n&lt;/code&gt;s&lt;/a&gt; all by hand on a 5-inch phone. The ball now once again laid in HR's side of the court.&lt;/p&gt;&#xA;&lt;p&gt;In a some-what anti-climatic twist, round seven &lt;a href=&quot;https://codegolf.stackexchange.com/a/209489/78850&quot;&gt;allowed the usage of a constant again&lt;/a&gt; - promptly &lt;a href=&quot;https://codegolf.stackexchange.com/a/209492/78850&quot;&gt;cracked&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Round eight &lt;a href=&quot;https://codegolf.stackexchange.com/a/209493/78850&quot;&gt;was posted&lt;/a&gt;, I &lt;a href=&quot;https://codegolf.stackexchange.com/a/209495/78850&quot;&gt;cracked it&lt;/a&gt; using the usual approach, but due to technicalities, it wasn't technically accepted. Regardless, there was still a response to the last challenge.&lt;/p&gt;&#xA;&lt;p&gt;And so that is the story of probably the longest chain of cracking to the challenge &lt;a href=&quot;https://codegolf.stackexchange.com/q/207558/78850&quot;&gt;Print X without X&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/216096/95792&quot;&gt;answer&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/36398/luis-mendo&quot;&gt;Luis Mendo&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/216092/95792&quot;&gt;answer&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/a/216575/95792&quot;&gt;my answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/216087/95792&quot;&gt;Is it a still-life?&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;(Self-ish nomination by user)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Luis Mendo posted a 42 byte MATL answer, and then Razetime posted a 61 byte APL answer that &lt;a href=&quot;https://codegolf.stackexchange.com/users/64121/ovs&quot;&gt;&lt;strong&gt;ovs&lt;/strong&gt;&lt;/a&gt; golfed to 56 bytes. I proposed a 40 byte alternative, to which Razetime replied that it beat MATL. At that, Luis Mendo got their answer to 38 bytes. Razetime took 3 more bytes off of their answer. When Luis Mendo was informed of this, they got their answer to 31 bytes, outgolfing even the 32 byte Jelly answer. Razetime and I both shaved off a few bytes each, getting their answer to 32 bytes, but by then, Luis Mendo had already gotten their answer to 29 bytes! Then I posted my own 31 byte answer based off of Razetime's, and eventually got it down to 26 bytes with &lt;strong&gt;@ngn&lt;/strong&gt;'s help.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="95792" LastEditDate="2021-01-26T18:56:57.080" LastActivityDate="2021-01-26T18:56:57.080" CommentCount="3" CommunityOwnedDate="2021-01-16T16:22:31.277" ContentLicense="CC BY-SA 4.0" />
  <row Id="20646" PostTypeId="2" ParentId="20638" CreationDate="2021-01-16T16:22:48.653" Score="2" Body="&lt;h1&gt;Best Non-Code-Golf Answer&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18440/78410&quot;&gt;Repost of 2019&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/search?tab=votes&amp;amp;q=-%5bcode-golf%5d%20-%5btips%5d%20created%3a2020%20is%3aanswer&quot;&gt;Search query for eligible answers&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Best answer to a challenge whose winning criteria did not include any code-golfing. King of the Hill, Fastest Code, etc. would be eligible. Proof Golf, atomic-code-golf, etc. are also included. Anything that's not the standard &amp;quot;shortest code length&amp;quot; is eligible.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/9365/dom-hastings&quot;&gt;@DomHastings&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/209707/92901&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/209669/92901&quot;&gt;Build an alphabetised polyglot&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;b&gt;(Nominated by @Dingus)&lt;/b&gt;&lt;/p&gt;&#xA;&lt;p&gt;This 26-language polyglot showcases a variety of languages ('9 shells, 3 Rubies, some 2D (and 1D!) languages and many languages . . . learned just for this challenge') and obviously took a significant amount of effort to put together. That the code is golfed as well, despite not being a requirement for the challenge, makes this answer all the more impressive.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/99238/isaac-g&quot;&gt;Isaac G.&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/215218/66833&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/215216/high-throughput-fizz-buzz&quot;&gt;High throughput Fizz Buzz&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;(Nominated by @caircoinheringaahing)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;While not the fastest answer to the challenge, this was a brilliant first answer (both Isaac's first and only answer, and the first answer to the challenge), which set a high bar for incoming answers. Since posted, the code has had little changes made to it, and yet is still competitive with the other answers, showing just how good the answer is.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-01-24T16:04:04.753" LastActivityDate="2021-01-24T16:04:04.753" CommentCount="2" CommunityOwnedDate="2021-01-16T16:22:48.653" ContentLicense="CC BY-SA 4.0" />
  <row Id="20647" PostTypeId="2" ParentId="20638" CreationDate="2021-01-16T16:23:03.807" Score="3" Body="&lt;h1&gt;Most helpful commenter&lt;/h1&gt;&#xA;&lt;p&gt;One of the things that stands out about this community is that although it's highly competitive, there is nearly always someone on hand to offer advice both on improving challenges and improving answer scores. It's part of what made this site seem so welcoming to me.&lt;/p&gt;&#xA;&lt;p&gt;In recognition of this, nominees should be people who have helped others improve and made them feel welcome, whether by direct comments on challenges and answers, or in comments in chat.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17329/95792&quot;&gt;Repost of 2018&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/79857/redwolf-programs&quot;&gt;Redwolf Programs&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by &lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/&quot;&gt;caird coinheringaahing&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Most challenges or answers posted by new users will have a comment underneath them saying something along the lines of&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Welcome to the site! Be sure to check out these helpful pages&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;As someone who posts a fair amount of these comments, I can easily say that Redwolf gets there quicker than most, and almost always includes helpful information for the newer users. In fact, they've even gone to the lengths of &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=56317367#56317367&quot;&gt;creating a userscript&lt;/a&gt; to help them (and others) to comment even more. The sheer prevalence and consistency of quality of these comments by Redwolf makes them deserving of this award in my mind.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/&quot;&gt;caird coinheringaahing&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;(Nominated by @Razetime)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;So active and so consistent with their help that I sometimes wonder if they're an omnipotent being. Their &lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/caird-coinheringaahing?tab=activity&amp;amp;sort=all&amp;amp;page=1&quot;&gt;activity page&lt;/a&gt; is filled to the brim with helpful comments, generally welcoming beginners. caird has also been very helpful with sandboxed posts, and has helped many of mine (and others) questions become clear and more fun to answer.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-01-23T16:40:27.503" LastActivityDate="2021-01-23T16:40:27.503" CommentCount="2" CommunityOwnedDate="2021-01-16T16:23:03.807" ContentLicense="CC BY-SA 4.0" />
  <row Id="20648" PostTypeId="2" ParentId="20638" CreationDate="2021-01-16T16:23:24.720" Score="1" Body="&lt;h1&gt;Most improved answer&lt;/h1&gt;&#xA;&lt;p&gt;Answer whose score improves the most from its initial posting. This doesn't have to be one with an objectively big increase/decrease (depending on the scoring system), but can be one with the most impressive change.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/210366/95792&quot;&gt;My answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/210111/95792&quot;&gt;Cut a triangle into equal-sized parts!&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination by @user&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This wasn't one of the most golfed answers, but it was a record for me (over 150 bytes shaved off). I worked on it from August to December, and the final answer ended up quite different from the original one. Even though the underlying approach stayed pretty much the same (build up a set of partially made triangles, add a cell each round, and deduplicate), I went from using recursion to iteration, changed the transformations on the cells, uniquified in a different way, and modified a bunch of other stuff.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/198367/78850&quot;&gt;My (@Lyxal) answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/198366/78850&quot;&gt;Make the Finest Magic Code Square&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination by @Lyxal&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The reason why this would be suitable for most improved answer because it went from being an invalid attempt at utilising a loophole (and consequently garnering downvotes and having to be deleted) to the most upvoted/winner of the popcon. And even though it may not be the biggest square, the fact it went from non-serious to actual contender is significant enough to potentially make it the most improved answer.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="78850" LastEditDate="2021-01-25T01:13:36.557" LastActivityDate="2021-01-25T01:13:36.557" CommentCount="2" CommunityOwnedDate="2021-01-16T16:23:24.720" ContentLicense="CC BY-SA 4.0" />
  <row Id="20649" PostTypeId="2" ParentId="20638" CreationDate="2021-01-16T16:23:42.110" Score="3" Body="&lt;h1&gt;Best Tip&lt;/h1&gt;&#xA;&lt;p&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18469/66833&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14523/66833&quot;&gt;2017&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10939/66833&quot;&gt;2016&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For the best answer to a question tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;, because this site isn't just about competing with one another, but also about helping each other improve our golfing skills&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/32014/zgarb&quot;&gt;Zgarb&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/204810/79857&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/198446/tips-for-creating-maintaining-a-golfing-language&quot;&gt;Tips for Creating/Maintaining a Golfing Language&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;(Nominated by RedwolfPrograms)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This answer provides some very helpful advice relating to one of the (arguably) more difficult things to decide on, what commands to add. It also gives examples of how other golfing languages handle things like overloading and type coercion.&lt;/p&gt;&#xA;&lt;p&gt;As someone who's considering designing a golfing language, this answer addresses several things I'd been unsure of at a more depth than any other answer.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/36398/luis-mendo&quot;&gt;Luis Mendo&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/198458/95792&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/198446/tips-for-creating-maintaining-a-golfing-language&quot;&gt;Tips for Creating/Maintaining a Golfing Language&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;(Nominated by user)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Luis Mendo's answer goes into a lot of depth on how to get started on a golfing language - picking a language to base it off of, choosing a paradigm, reserving names for later expansion. These tips make it easier for people without previous experience make golfing languages. They also go beyond just designing the language, to maintaining it and the documentation so it's more accessible to people. It's a very valuable resource.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="95792" LastEditDate="2021-01-21T14:48:40.700" LastActivityDate="2021-01-21T14:48:40.700" CommentCount="2" CommunityOwnedDate="2021-01-16T16:23:42.110" ContentLicense="CC BY-SA 4.0" />
  <row Id="20650" PostTypeId="2" ParentId="20638" CreationDate="2021-01-16T16:23:58.173" Score="4" Body="&lt;h1&gt;Best Non-Code-Golf Challenge&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18439/78410&quot;&gt;Repost of 2019&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Best challenge whose winning criteria did not include any code-golfing. King of the Hill, Fastest Code, etc. would be eligible. Proof Golf, atomic-code-golf, etc. are also included. Anything that's not the standard &amp;quot;shortest code length&amp;quot; is eligible.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/207558/92901&quot;&gt;Print X without X&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;@WheatWizard&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;b&gt; (Nominated by @Dingus) &lt;/b&gt;&lt;/p&gt;&#xA;&lt;p&gt;I like how this challenge took something generally frowned upon ('Do X without Y') and turned it into something genuinely fun with high replay value, spawning several entertaining back-and-forth battles. 83 upvotes and 176 answers across the cops' and robbers' threads are indicative of how well this challenge was received.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/212254/shortest-arithmetic-formula-to-output-1000-primes&quot;&gt;Shortest 'arithmetic formula' to output 1000 primes&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/98653/prime-directive&quot;&gt;prime_directive&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;(Nominated by @RedwolfPrograms)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is an interesting challenge in a category that isn't used much (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;). Additionally, it was the user's first post!&lt;/p&gt;&#xA;&lt;p&gt;There was a lot of room for answers to improve, with the original scores being golfed down more than twenty times smaller, and the entry barrier was sufficiently low that many new users posted great answers.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-01-23T16:40:37.513" LastActivityDate="2021-01-23T16:40:37.513" CommentCount="2" CommunityOwnedDate="2021-01-16T16:23:58.173" ContentLicense="CC BY-SA 4.0" />
  <row Id="20651" PostTypeId="2" ParentId="20638" CreationDate="2021-01-16T16:24:17.193" Score="2" Body="&lt;h1&gt;Rookie of the Year - Answers&lt;/h1&gt;&#xA;&lt;p&gt;For the best answer written by a new user in 2020. This doesn't have to be a user who created their account in 2020; rather, this is for any answer posted in 2020 by a user who didn't post any answers before 2020.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/edit/1355909&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE query&lt;/a&gt; modified from the one Giuseppe gave.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/95594/xash&quot;&gt;@xash&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/206001/78410&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/205988/78410&quot;&gt;Determine the area enclosed by slashes&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;@Bubbler&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;xash started their Code Golf career with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/205663/is-this-a-half-sort/205690#205690&quot;&gt;an answer in J&lt;/a&gt;, which is already an uncommon language choice for a new user. They showed off &lt;a href=&quot;https://codegolf.stackexchange.com/a/206001/78410&quot;&gt;brilliant approaches&lt;/a&gt; (the nominated answer) and an ability to write &lt;a href=&quot;https://codegolf.stackexchange.com/a/206664/78410&quot;&gt;200-byte-long J train&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/a/206517/78410&quot;&gt;400-byte-long one&lt;/a&gt;. Then they picked up two more esoteric languages, namely &lt;a href=&quot;https://codegolf.stackexchange.com/a/210954/78410&quot;&gt;Brachylog&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/a/216243/78410&quot;&gt;convey&lt;/a&gt;, in a relatively short amount of time.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/92901/dingus&quot;&gt;Dingus&lt;/a&gt;' &lt;a href=&quot;https://codegolf.stackexchange.com/a/212107/66833&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/212068/peel-away-the-layers-cops&quot;&gt;Peel away the layers - Cops&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;(Nominated by @cairdcoinheringaahing)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Dingus &lt;a href=&quot;https://codegolf.stackexchange.com/questions/201366/even-a-clock-that-isnt-working-gets-the-time-right-two-or-three-times-a-day/201423#201423&quot;&gt;first answered&lt;/a&gt; in March, and has quickly amassed over 6000 reputation and answered with some truly great answers. For this one however, I (along with most other people) were expecting answers to have scores solidly in the double figures, until Dingus posted this answer, scoring &lt;span class=&quot;math-container&quot;&gt;\$840,527,321,220,386\$&lt;/span&gt;, through clever obfuscation techniques, in the code, the languages used and &lt;em&gt;how&lt;/em&gt; those languages were used. The answer stayed uncracked for 14 days, despite some valiant efforts by the Robbers, and was easily the most impressive of all the Cops' solutions.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-01-23T16:39:46.297" LastActivityDate="2021-01-23T16:39:46.297" CommentCount="2" CommunityOwnedDate="2021-01-16T16:24:17.193" ContentLicense="CC BY-SA 4.0" />
  <row Id="20652" PostTypeId="2" ParentId="20638" CreationDate="2021-01-16T16:24:30.700" Score="2" Body="&lt;h1&gt;Trickiest Challenge&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18436/80214&quot;&gt;repost from 2019&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;It should look simple and tempt you to start coding right away, but coming up with a good solution should be hard.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/217183/vandalizing-marquees&quot;&gt;Vandalizing Marquees&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/65836/stephen&quot;&gt;Stephen&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This one looked really simple for most golfing languages with a powerset builtin, but it turned out to be much harder with its compression tactic.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/207765/78410&quot;&gt;Checkerboard the Matrix&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/68261/fireflame241&quot;&gt;fireflame241&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;It looks like a simple variation of linear algebra-themed &amp;quot;row-operations on a matrix&amp;quot;, yet no one seems to have figured out how to actually solve it. This one remains unsolved for almost six months, at the time of writing.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="78410" LastEditDate="2021-01-19T04:29:47.827" LastActivityDate="2021-01-19T04:29:47.827" CommentCount="2" CommunityOwnedDate="2021-01-16T16:24:30.700" ContentLicense="CC BY-SA 4.0" />
  <row Id="20653" PostTypeId="2" ParentId="2140" CreationDate="2021-01-16T17:16:32.897" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/218138/print-random-integers-until-0&quot;&gt;Print random integers until 0&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-01-28T14:45:40.730" LastActivityDate="2021-01-28T14:45:40.730" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="20655" PostTypeId="2" ParentId="2140" CreationDate="2021-01-17T23:20:09.770" Score="1" Body="&lt;h1&gt;Hanabi playing bot&lt;/h1&gt;&#xA;&lt;h2&gt;Overview&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Hanabi_(card_game)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hanabi&lt;/a&gt; is a &lt;strong&gt;cooperative card game with limited communication&lt;/strong&gt;. It won the German &amp;quot;Spiel des Jahres&amp;quot; award in 2013.&lt;/p&gt;&#xA;&lt;p&gt;The game can be played by 2-5 players, each of which has a hand of 5 cards (4 cards for 4-5 players), which they can't see themselves, but the other players can. In each turn, you can either play or discard a card, or give one other player a hint about their cards.&lt;/p&gt;&#xA;&lt;p&gt;Common goal is to play out the cards in each color in ascending order.&lt;/p&gt;&#xA;&lt;p&gt;As this is a cooperative game, each answer needs to cooperate with other instances of itself.&lt;/p&gt;&#xA;&lt;h2&gt;I/O format&lt;/h2&gt;&#xA;&lt;h3&gt;Option 1: stateless, for all languages&lt;/h3&gt;&#xA;&lt;p&gt;Your program is called once for each turn (and is supposed to terminate afterwards). It will receive the current game state via standard input, and reply with an action via standard output.&#xA;Invalid output means this game is counted as forfeited (lost, 0 points).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Input is a line-based ASCII-format, with a prefix indicating what kind of data it is.&#xA;The last line of the input is the current turn number (see below).&#xA;Input will be in this order:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Meta-information:&#xA;&lt;code&gt;n: &lt;/code&gt; &lt;strong&gt;n&lt;/strong&gt; = number of players (2 .. 5)&#xA;&lt;code&gt;y: &lt;/code&gt; &lt;strong&gt;you&lt;/strong&gt; = own player id (1 .. n)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;visible cards of the other players:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;c 1:&lt;/code&gt; cards for player 1&lt;/li&gt;&#xA;&lt;li&gt;...&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;c &lt;/code&gt;&lt;strong&gt;n&lt;/strong&gt;&lt;code&gt;:&lt;/code&gt; cards for player &lt;strong&gt;n&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The cards for &lt;strong&gt;you&lt;/strong&gt; are omitted in the list (you don't see your own cards).&lt;/p&gt;&#xA;&lt;p&gt;Each card has a color (one of &lt;code&gt;r&lt;/code&gt;, &lt;code&gt;y&lt;/code&gt;, &lt;code&gt;g&lt;/code&gt;, &lt;code&gt;b&lt;/code&gt;, &lt;code&gt;w&lt;/code&gt;) and a&#xA;number (&lt;code&gt;1&lt;/code&gt; to &lt;code&gt;5&lt;/code&gt;), written like &lt;code&gt;r1&lt;/code&gt; or &lt;code&gt;y5&lt;/code&gt;, comma-separated.&lt;/p&gt;&#xA;&lt;p&gt;Example: &lt;code&gt;c 2: w4,y1,g2,r3&lt;/code&gt; means that player 2 has a white 4,&#xA;a yellow 1, a green 2 and a red 3, in this order, on her hand.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Hints given about each player's cards, in a similar list:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;h 1:&lt;/code&gt;  hints for player 1&lt;/li&gt;&#xA;&lt;li&gt;...&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;h &lt;/code&gt;&lt;strong&gt;n&lt;/strong&gt;&lt;code&gt;:&lt;/code&gt; hints for player &lt;strong&gt;n&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For each card (in the same order as before), all hints are noted,&#xA;in a comma-separated list.&#xA;We also note negative information, i.e. when a card was present&#xA;when a hint was given, but was not selected, by prefixing with &lt;code&gt;!&lt;/code&gt;.&#xA;For example &lt;code&gt;5&lt;/code&gt; is a card which is known as &lt;code&gt;5&lt;/code&gt; but of unknown color,&#xA;&lt;code&gt;w1&lt;/code&gt; is a card which is known as a white 1, &lt;code&gt;3!y&lt;/code&gt; is a 3 which is&#xA;known as not yellow, &lt;code&gt;g!15&lt;/code&gt; is a green card which is known as&#xA;neither being a 1 nor 5.&lt;/p&gt;&#xA;&lt;p&gt;For example, &lt;code&gt;h 2: ,y!2,2!yr,r&lt;/code&gt; means that for player 2, the first card is&#xA;completely unknown (was taken after the last hint), the second card is known&#xA;as yellow and as not a 2, the third card is known as a 2 which is neither&#xA;red nor yellow, and the fourth card is known as red.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;p &lt;/code&gt;&lt;em&gt;color&lt;/em&gt;&lt;code&gt;:&lt;/code&gt; &lt;em&gt;number&lt;/em&gt; – already (successfully) played out cards (one per line).&#xA;Here we just note the highest card of each color.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;p r: 2&lt;/code&gt; means for red, the 1 and two were played out&#xA;(i.e. red 3 is the next one to play).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;p w: 0&lt;/code&gt; means no white card was played out yet (i.e. the&#xA;white 1 is the next one to play).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;d: &lt;/code&gt; – Discarded cards&#xA;A list of all cards which were either intentionally discarded or&#xA;unsuccessfully played out, comma-separated.&lt;/p&gt;&#xA;&lt;p&gt;For example, &lt;code&gt;d: w3,b5,y2,y2&lt;/code&gt; means that white 3, blue 5 and&#xA;two yellow 2s were already discarded.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;game status information (each on one line, in this order):&#xA;&lt;code&gt;lh: &lt;/code&gt; number of hints left,&#xA;&lt;code&gt;ld: &lt;/code&gt; number of discards left &lt;em&gt;(those two always sum to 8)&lt;/em&gt;,&#xA;&lt;code&gt;lb: &lt;/code&gt; number of &amp;quot;bad plays&amp;quot; left&#xA;&lt;code&gt;lc: &lt;/code&gt; number of cards left in the deck&#xA;&lt;code&gt;t: &lt;/code&gt; current turn number&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;(The input will be closed here.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The action to take. One of&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;h &lt;/code&gt; player-id &lt;code&gt; &lt;/code&gt; color or number – give a hint to another player.&#xA;E.g. &lt;code&gt;h 4 y&lt;/code&gt; will give player 4 a hint which of his cards are yellow. &lt;code&gt;h 3 1&lt;/code&gt;&#xA;will give player 3 a hint which of her cards are a 1. This action is only possible&#xA;if the number of hints left is positive.&#xA;&lt;em&gt;(The number of hints left will be reduced by 1, the number of discards will be increased by 1.)&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;p &lt;/code&gt; card# – play one of your own cards (identified by its number (1..5)).&#xA;&lt;em&gt;(If this card fits into the cards already played, it's added there.&#xA;(If this is the last 5, the game ends immediately with full score (25)).&#xA;Otherwise it is discarded and the number of bad plays is reduced by 1.&#xA;If it reaches 0, the game ends (unsuccessfully).)&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;d &lt;/code&gt; card# – discard one of your own cards (idenfified by its number (1..5)).&#xA;This is only possible if the number of discards is positive.&#xA;&lt;em&gt;(The number of hints left will be increased by 1, the number of discards will reduced by 1).&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;em&gt;After playing or discarding a card, this card is removed from the hand, and a new card is drawn from the deck and is added to the list of cards of this player (on the left). (The hints are automatically updated.)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Option 2 (stateful)&lt;/h3&gt;&#xA;&lt;p&gt;Your program receives a live transcript of everything what happens (including the actions of the other players, and the results thereof).&#xA;The controller will read one line of output from the program when it's its turn.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Most input lines have the same format as before.&lt;/p&gt;&#xA;&lt;p&gt;Initial input (as for the stateless version):&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Meta information (&lt;code&gt;n: &lt;/code&gt;, &lt;code&gt;y: &lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;other player's cards (as before)&lt;/li&gt;&#xA;&lt;li&gt;hints for cards (as before)&lt;/li&gt;&#xA;&lt;li&gt;played cards (initially just &lt;code&gt;p r: 0&lt;/code&gt;, &lt;code&gt;p w: 0&lt;/code&gt;, etc.)&lt;/li&gt;&#xA;&lt;li&gt;discarded cards (initially just &lt;code&gt;d: &lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;game status, ending with &lt;code&gt;t: 1&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;After each player's turn:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;a line is given with that player's action:&#xA;&lt;code&gt;a &lt;/code&gt;&lt;em&gt;player id&lt;/em&gt;&lt;code&gt;: &lt;/code&gt;  the action as defined in the output, e.g.&#xA;&lt;code&gt;a 1: h 4 y&lt;/code&gt; means that player 1 gave a hint to player 4 about yellow cards&lt;/li&gt;&#xA;&lt;li&gt;Those parts of the card situation which changed, e.g. &lt;code&gt;c&lt;/code&gt; and &lt;code&gt;d&lt;/code&gt; lines if&#xA;a player discarded a card (or unsuccessfully played a card) and drew a new&#xA;one), &lt;code&gt;c&lt;/code&gt; and &lt;code&gt;p&lt;/code&gt; lines if a player played out a card successfully,&#xA;a &lt;code&gt;h&lt;/code&gt; line if a player gave a hint.&lt;/li&gt;&#xA;&lt;li&gt;Updated status information, e.g. &lt;code&gt;lh&lt;/code&gt; + &lt;code&gt;ld&lt;/code&gt; when hint was given or a&#xA;card discarded, &lt;code&gt;lc&lt;/code&gt; when a new card was drawn, &lt;code&gt;lb&lt;/code&gt; when a card was&#xA;played unsuccessfully.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;t: &lt;/code&gt; indicating the next turn number.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;*(TODO: Do we need an indication that's now &lt;em&gt;&lt;strong&gt;your&lt;/strong&gt; turn? That can be calculated by y == t mod n, but an explicit prompt might be easier to handle.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;When the game ends, the input will be closed. (Your bot should terminate then.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;As in the stateless version, one line indicating the player's action.&lt;/p&gt;&#xA;&lt;h3&gt;Option 3/4 (JVM only, stateless or statefull)&lt;/h3&gt;&#xA;&lt;p&gt;To be defined. As I will be writing the controller in a JVM language, it should be possible/easy to provide a Java API to be implemented by the bots.&lt;/p&gt;&#xA;&lt;h2&gt;Other game rules:&lt;/h2&gt;&#xA;&lt;p&gt;I tried to give most of the details above, but here are some which might be missing/unclear:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;There are three × 1, two × 2 to 4 and one 5 in each of the five colors&#xA;(50 cards in total, 10 per color).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When playing with 2 or 3 players, each player has 5 cards, when playing&#xA;with 4 or 5 players, each player has 4 cards in their hand.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you have three bad plays (i.e. the &lt;code&gt;lb&lt;/code&gt; counter reaches 0), you lose&#xA;immediately. This is counted as score 0.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you succeed to play all 25 cards (i.e. all 5s are played successfully),&#xA;you win immediately, with a score of 25.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When the drawing deck is exhausted, one more round is played (i.e. each&#xA;player has one more turn), then the game ends and the final score is&#xA;the number of cards successfully played out.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Competition Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;While for human play, the amount of extra communication is &amp;quot;subject to negotiation&amp;quot;,&#xA;here I want to explore what is possible with just what the rules provide.&#xA;&lt;strong&gt;Any communication between your bot instances&lt;/strong&gt; (except as provided by&#xA;the defined interface, i.e. via game actions) &lt;strong&gt;is strictly forbidden&lt;/strong&gt;.&#xA;Strategy needs to be encoded in the source code, not discussed during the game.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There is also no communication between your individual games (i.e. no persistence).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I will nominate an overall winner, and one for the stateless category.&#xA;(The stateful ones have a bit more information, so they could emulate the&#xA;stateless ones.)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I will run contestants 1000 times with random decks of cards, once for&#xA;each number of players from 2 to 5. If your bot only works with a&#xA;specific number of players, state this in your answer.&#xA;The competition score is the average score for all the runs. [I'll need&#xA;to experiment to see how this varies, maybe I'll increase or decrease&#xA;the count.]&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A bot needs to provide output in a reasonable time (to be defined). The stateless&#xA;version needs to terminate after providing output, the stateful one keeps&#xA;running, but should terminate after end of input (i.e. after the game ended).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I will provide the controller on Github, feel free to test your bot with it&#xA;(and compare it with other competition entries).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The programming language needs to have an interpreter or compiler which is&#xA;available free of cost for Ubuntu 20.4 (otherwise I can't run your bot to&#xA;score it).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I reserve the right to not run a bot when I suspect malicious code in it.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, please keep your code readable.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="2338" LastActivityDate="2021-01-17T23:20:09.770" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20656" PostTypeId="2" ParentId="19202" CreationDate="2021-01-18T02:56:04.820" Score="1" Body="&lt;h1&gt;When output using exit status, a success exit means accept, a failed exit means reject&lt;/h1&gt;&#xA;&lt;p&gt;A full program may accept / reject an input by its exit status. Typically, a zero exit status means success (accept), and a non-zero exit status means fail (reject) on most platforms.&lt;/p&gt;&#xA;" OwnerUserId="44718" LastActivityDate="2021-01-18T02:56:04.820" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20657" PostTypeId="2" ParentId="19202" CreationDate="2021-01-18T03:01:04.987" Score="1" Body="&lt;h1&gt;An HTTP Server may use 2xx response status codes to accept inputs, use 4xx response status codes to reject inputs&lt;/h1&gt;&#xA;&lt;p&gt;Typically, 2xx response status means the execution is successful, while 4xx response status means the input is invalid. The same semantics may be applied to decision problems.&lt;/p&gt;&#xA;" OwnerUserId="44718" LastActivityDate="2021-01-18T03:01:04.987" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20658" PostTypeId="2" ParentId="19202" CreationDate="2021-01-18T03:05:23.593" Score="6" Body="&lt;h1&gt;A function submission may reject inputs by raise an exception&lt;/h1&gt;&#xA;&lt;p&gt;Some language have supports with exception. For example, when parsing an integer, the function may raise / throw an exception when the given input is invalid integer format.&lt;/p&gt;&#xA;&lt;p&gt;The function submission may accept the input by returning without exceptions, but raise an exception when reject the inputs.&lt;/p&gt;&#xA;" OwnerUserId="44718" LastActivityDate="2021-01-18T03:05:23.593" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20660" PostTypeId="2" ParentId="2140" CreationDate="2021-01-18T12:19:13.130" Score="0" Body="&lt;h1&gt;Radical of an integer &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The radical of an integer (written as &lt;span class=&quot;math-container&quot;&gt;\$\mathrm{rad}(n)\$&lt;/span&gt;) is defined as the product of all prime numbers that divide it. This it &lt;a href=&quot;https://oeis.org/A007947&quot; rel=&quot;nofollow noreferrer&quot;&gt;A007947&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For example, since &lt;span class=&quot;math-container&quot;&gt;\$ 504 = 2^3 \cdot 3^2 \cdot 7 \$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$ \mathrm{rad}(504) = 2 \cdot 3 \cdot 7 = 42 \$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to write a function or a program which takes a number as the input, and output its radical.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can take/output the numbers in any format allowed by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;the default I/O rules&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You don't have to handle any cases where the input isn't an integer or isn't positive (you don't have to handle 0).&lt;/p&gt;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;504 -&amp;gt; 42&#xA;6 -&amp;gt; 6&#xA;57 -&amp;gt; 57&#xA;1024 -&amp;gt; 2&#xA;9 -&amp;gt; 3&#xA;1 -&amp;gt; 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is code-golf, so the shortest answer in bytes wins. Good Luck!&lt;/p&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2021-01-20T20:16:41.097" LastActivityDate="2021-01-20T20:16:41.097" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="20661" PostTypeId="2" ParentId="2140" CreationDate="2021-01-18T20:48:25.720" Score="1" Body="&lt;h1&gt;Write a Length interpreter&lt;/h1&gt;&#xA;&lt;p&gt;Length is a simple stack-based esolang where instructions are encoded as line lengths&#xA;The instruction set is as follows:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Line Length&lt;/th&gt;&#xA;&lt;th&gt;Name&lt;/th&gt;&#xA;&lt;th&gt;Description&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;9&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;inp&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Pushes the ascii value of the first byte of stdin to the stack.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;10&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;add&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Adds the top two values on the stack and pushes the result onto the stack.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;11&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;sub&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Subtracts the top two values on the stack and pushes the result onto the stack.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;12&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;dup&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Duplicates the top value of the stack.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;13&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;cond&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;If the top value of the stack is 0, skip the next instruction. Then pop it.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;14&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;gotou&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Sets the program counter to the value of the line under the instruction.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;15&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;outn&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Pops the top of the stack, and outputs it as a number.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;16&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;outa&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Pops the top of the stack, and outputs its ascii value.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;20&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;mul&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Multiplies the top two values on the stack and pushes the result onto the stack.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;21&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;div&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Divides the top two values on the stack and pushes the result onto the stack.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;24&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;gotos&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Sets the program counter to the value at the top of the stack&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;In case the table doesn't work, here is the esolangs page: &lt;a href=&quot;https://esolangs.org/wiki/Length&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://esolangs.org/wiki/Length&lt;/a&gt;&lt;br /&gt;&#xA;Test inputs are too long to put here, they can be found &lt;a href=&quot;https://github.com/LengthLang/length&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;&lt;br /&gt;&#xA;&lt;code&gt;helloworld.len&lt;/code&gt; - Outputs &lt;code&gt;Hello, World!&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;truth.len&lt;/code&gt; - A truth machine&lt;br /&gt;&#xA;&lt;code&gt;bottles.len&lt;/code&gt; - Outputs the lyrics to 99 bottles of beer&lt;br /&gt;&#xA;This is a code golf, so shortest program wins!&lt;/p&gt;&#xA;" OwnerUserId="99306" LastEditorUserId="43319" LastEditDate="2021-01-18T20:55:42.413" LastActivityDate="2021-01-18T20:55:42.413" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20662" PostTypeId="2" ParentId="2140" CreationDate="2021-01-18T22:51:10.910" Score="0" Body="&lt;h1&gt;SimpleHearts KOTH&lt;/h1&gt;&#xA;&lt;h2&gt;SimpleHearts&lt;/h2&gt;&#xA;&lt;p&gt;SimpleHearts is a four player trick-taking card game similar to Hearts, with a few simplifications. Hearts has several possible rule variations, and the rules I will use are outlined here.&lt;/p&gt;&#xA;&lt;p&gt;For each game, each of the four players are dealt 13 of the cards in a standard deck. After that, there will be 13 &amp;quot;tricks&amp;quot;, and during each trick the players will take turns playing exactly one of their cards. Each trick will consist of the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;One player leads the trick by playing a card. The suit of this card is the &amp;quot;led suit&amp;quot;. On the first trick the player with the 2 of clubs must lead with the 2 of clubs, on the following tricks whoever won the previous trick will lead.&lt;/p&gt;&#xA;&lt;p&gt;The leader may not lead a heart until another player has played a heart or the Qs (Queen of Spades). Exception: if the leader only has hearts in their hand, they may lead one of their hearts. The leader may lead the Qs at any time.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In a clockwise fashion, each player will take their turn playing one card in their hand of the led suit. If the player has no cards of the led suit, they may play &lt;em&gt;any&lt;/em&gt; card. Exception: On the very first trick, no one after the leader may play a heart or the Qs, unless all of their cards are hearts or the Qs (obviously absurdly unlikely).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;After all four players play a card, whichever player played the highest value card of the led suit wins the trick. Ace is highest value and 2 is lowest. The winner of the trick receives 1 point for every heart played by anyone in the trick, and 13 points if the Qs was played in the trick.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Repeat, with the winner leading the next trick.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The objective of the game is to receive as &lt;em&gt;few&lt;/em&gt; points as possible. After all 13 tricks are played, the score of each player is the total number of points they took during gameplay. Important exception: if one player takes all possible points, i.e. the 13 hearts &lt;em&gt;and&lt;/em&gt; the Qs, they receive 0 points and all other players receive 26 points (this is called &amp;quot;shooting the moon&amp;quot;).&lt;/p&gt;&#xA;&lt;p&gt;Key differences from standard Hearts:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;There is no passing cards&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Scores are not cumulative in the standard way (the scoring system of this particular challenge will be explained next).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Gameplay and Scoring&lt;/h2&gt;&#xA;&lt;p&gt;This is a KOTH challenge, meaning the objective is to create a bot (in this case a Python function) which will compete against other submitted bots in the game of SimpleHearts. All  subsets of size 4 of the set of submissions will play against each other in N matches of 4 games each. &lt;strong&gt;For sandbox: N is tbd, should be as high as reasonably possible.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The dealing of the cards will be identical in each of the 4 games in a match, except rotated. For example, suppose the players are A, B, C, and D. In the second game player B will have the same hand player A had in game 1, C will have B's game 1 hand, etc. This is to reduce the impact of random chance, as one player being dealt a bad hand will affect all players equally in theory.&lt;/p&gt;&#xA;&lt;p&gt;Each submission's final score will be the sum of their scores in all the games they played. The winner will be the submission with the lowest final score. In the case of a tie, the oldest submission will win.&lt;/p&gt;&#xA;&lt;h2&gt;Technical Requirements&lt;/h2&gt;&#xA;&lt;p&gt;Each submission will be a Python function &lt;strong&gt;(for sandbox: this is an arbitrary choice, is there a better one?)&lt;/strong&gt; which takes as parameters:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A list of 2-tuples representing the cards in their hand. Each tuple will be of the form &lt;code&gt;(12, 's')&lt;/code&gt; with the number representing the value of the suit and the string representing the suit, being one of &lt;code&gt;s, h, d, c&lt;/code&gt;. For simplicity's sake the numbers are from 2 to 14, and we do not care about encoding &amp;quot;Queen&amp;quot; or &amp;quot;Ace&amp;quot;. Therefore the Queen of Spades is &lt;code&gt;(12, 's')&lt;/code&gt;, Ace of Diamonds is &lt;code&gt;(14, 'd')&lt;/code&gt;, and the 2 of clubs is &lt;code&gt;(2, 'c')&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A list of 4 integers representing the scores of each player so far in the current game. The first element of the list is your score, then the player to your left, then the player across, then the player to your right.&lt;/p&gt;&#xA;&lt;p&gt;Note: leading with hearts is allowed if and only if you only have hearts, or someone has a nonzero score.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A list of 4 lists of tuples representing which cards have been played and by whom. The first list will be the cards you played, in order. The second list will be the cards played by the player on your left, in order. Etc.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A list of 0-3 tuples representing the cards that have been played in the trick, in order.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;As output, the submission must return a single tuple representing a card in its hand, which is legal to play according to the rules of SimpleHearts. Of course, the function may choose to ignore any of these inputs but if it makes an illegal output, it is disqualified. In testing, I will force whoever has the 2 of clubs to lead with it on the first hand, ignoring the contents of the function.&lt;/p&gt;&#xA;&lt;p&gt;The submission must be deterministic, i.e. will always produce the same output on the same input (so pseudorandom numbers with a set seed are allowed).&lt;/p&gt;&#xA;&lt;p&gt;All submissions must be at most 100 000 characters.&lt;/p&gt;&#xA;&lt;p&gt;The challenge will end 14 days after this prompt is posted, after which I will test all valid submissions against each other in the manner I described.&lt;/p&gt;&#xA;&lt;h2&gt;For sandbox&lt;/h2&gt;&#xA;&lt;p&gt;This prompt is still WIP, but I appreciate any comments. I intend to create a controller and some example submissions, but only after Sandbox folk deem the challenge to be good enough.&lt;/p&gt;&#xA;&lt;p&gt;Is there any reasonable way to make the requirements easier or the game simpler? Cause this post is kinda long.&lt;/p&gt;&#xA;" OwnerUserId="89930" LastActivityDate="2021-01-18T22:51:10.910" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="20663" PostTypeId="2" ParentId="2140" CreationDate="2021-01-19T02:38:46.123" Score="-1" Body="&lt;h1&gt;Undecidable halting set&lt;/h1&gt;&#xA;&lt;p&gt;Write a program such that the set of &lt;a href=&quot;https://en.wikipedia.org/wiki/Natural_number&quot; rel=&quot;nofollow noreferrer&quot;&gt;natural numbers&lt;/a&gt; on which it halts is not &lt;a href=&quot;https://en.wikipedia.org/wiki/Recursive_set&quot; rel=&quot;nofollow noreferrer&quot;&gt;recursive&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Shorter is better.&lt;/p&gt;&#xA;&lt;p&gt;You may assume natural numbers in your language are unbounded.&lt;/p&gt;&#xA;&lt;h2&gt;Example: Python 3 (52 chars)&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;lambda n:eval(n.to_bytes(n.bit_length()//8+1,'big'))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="41260" LastActivityDate="2021-01-19T02:38:46.123" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="20664" PostTypeId="2" ParentId="2140" CreationDate="2021-01-19T02:59:23.000" Score="-3" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pi&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pi&amp;#39;&quot; rel=&quot;tag&quot;&gt;pi&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimized-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimized-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimized-output&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Most digits of Pi in a hundred bytes&lt;/h1&gt;&#xA;" OwnerUserId="99946" LastActivityDate="2021-01-19T02:59:23.000" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20665" PostTypeId="2" ParentId="2140" CreationDate="2021-01-19T04:00:01.680" Score="0" Body="&lt;h1&gt;The UTM theorem&lt;/h1&gt;&#xA;&lt;p&gt;Let &lt;code&gt;ℕ&lt;/code&gt; denote the set of &lt;a href=&quot;https://en.wikipedia.org/wiki/Natural_number&quot; rel=&quot;nofollow noreferrer&quot;&gt;natural numbers&lt;/a&gt;. Let &lt;code&gt;A × B&lt;/code&gt; denote the &lt;a href=&quot;https://en.wikipedia.org/wiki/Cartesian_product&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cartesian product&lt;/a&gt; of &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt;. Let &lt;code&gt;A ⇀ B&lt;/code&gt; denote the set of &lt;a href=&quot;https://en.wikipedia.org/wiki/Partial_function&quot; rel=&quot;nofollow noreferrer&quot;&gt;partial functions&lt;/a&gt; from &lt;code&gt;A&lt;/code&gt; to &lt;code&gt;B&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/UTM_theorem&quot; rel=&quot;nofollow noreferrer&quot;&gt;UTM theorem&lt;/a&gt; says that there exists a &lt;a href=&quot;https://en.wikipedia.org/wiki/Computable_function&quot; rel=&quot;nofollow noreferrer&quot;&gt;computable function&lt;/a&gt; &lt;code&gt;u : ℕ × ℕ ⇀ ℕ&lt;/code&gt; such that, for every computable function &lt;code&gt;f : ℕ ⇀ ℕ&lt;/code&gt;, there exists a &lt;code&gt;p : ℕ&lt;/code&gt; such that, for every &lt;code&gt;x : ℕ&lt;/code&gt;, &lt;code&gt;u(p, x) ≃ f(x)&lt;/code&gt;. That is, there exists a &lt;em&gt;universal&lt;/em&gt; computable function (analogous to the &lt;a href=&quot;https://en.wikipedia.org/wiki/Universal_turing_machine&quot; rel=&quot;nofollow noreferrer&quot;&gt;universal Turing machine&lt;/a&gt;).&lt;/p&gt;&#xA;&lt;p&gt;Implement such a function in your language. Shorter is better.&lt;/p&gt;&#xA;&lt;h2&gt;Example: Python (57 chars)&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;lambda p,x:eval(p.to_bytes(p.bit_length()//8+1,'big'))(x)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="41260" LastActivityDate="2021-01-19T04:00:01.680" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20668" PostTypeId="1" CreationDate="2021-01-19T17:38:59.057" Score="5" ViewCount="105" Body="&#xA;&lt;p&gt;As we say goodbye to the old year and welcome the new one, we have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/search?q=%22year+in+moderation%22+is%3Aquestion&quot;&gt;a tradition of sharing moderation stats for the past 12 months&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;As most of you here are aware, sites on the Stack Exchange network are moderated somewhat differently to other sites on the web:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;We designed the Stack Exchange network engine to be mostly self-regulating, in that we amortize the overall moderation cost of the system across thousands of teeny-tiny slices of effort contributed by regular, everyday users.&lt;br /&gt;&#xA;-- &lt;a href=&quot;http://blog.stackoverflow.com/2009/05/a-theory-of-moderation/&quot;&gt;A Theory of Moderation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;That doesn't eliminate the need for having &lt;a href=&quot;https://stackoverflow.blog/2018/11/21/our-theory-of-moderation-re-visited/&quot;&gt;moderators&lt;/a&gt; altogether, but it does mean that the bulk of moderation work is carried out by regular folks. Every bit of time and effort y'all contribute to the site gives you access to more privileges you can use to help in this effort, all of which produce a cumulative effect that makes a big difference.&lt;/p&gt;&#xA;&lt;p&gt;So as we welcome 2021, and in keeping with tradition, let us look back at what we accomplished as a community... by looking at some &lt;a href=&quot;https://i.stack.imgur.com/pU1Al.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;exciting&lt;/em&gt; stats&lt;/a&gt;. Below is a breakdown of moderation actions performed on Code Golf over the past 12 months:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th style=&quot;text-align: left;&quot;&gt;Action&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;Moderators&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;Community¹&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Users suspended²&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;7&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;10&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Users destroyed³&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;5&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Users contacted&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;11&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;User banned from review&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁴: Suggested Edit queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;24&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;639&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁴: Reopen Vote queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;10&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;425&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁴: Low Quality Posts queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;6&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1,193&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁴: Late Answer queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;8&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;334&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁴: First Post queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;21&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;772&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁴: Close Votes queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;36&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;879&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions unprotected&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;3&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;27&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions reopened&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;6&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;43&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions protected&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;14&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions migrated&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;3&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions flagged⁵&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;2&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;500&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions closed&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;43&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;431&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Question flags handled⁵&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;136&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;368&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Posts unlocked&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;2&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Posts undeleted&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;12&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;558&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Posts locked&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;65&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Posts deleted⁶&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;332&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1,737&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Posts bumped&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;4&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Comments undeleted&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;13&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Comments flagged&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;684&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Comments deleted⁷&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1,248&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;6,756&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Comment flags handled&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;429&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;259&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Answers flagged&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;6&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;909&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Answer flags handled&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;463&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;454&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;All comments on a post moved to chat&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;h3&gt;Footnotes&lt;/h3&gt;&#xA;&lt;p&gt;¹ &amp;quot;Community&amp;quot; here refers both to &lt;a href=&quot;https://codegolf.stackexchange.com/users&quot;&gt;the membership of Code Golf&lt;/a&gt; &lt;em&gt;without&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=moderators&quot;&gt;diamonds next to their names&lt;/a&gt;, and to the automated systems otherwise known as &lt;a href=&quot;https://codegolf.stackexchange.com/users/-1&quot;&gt;user #-1&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;² The system will suspend users under three circumstances: when a user is recreated after being previously suspended, when a user is recreated after being destroyed for spam or abuse, and when a network-wide suspension is in effect on an account.&lt;/p&gt;&#xA;&lt;p&gt;³ A &amp;quot;destroyed&amp;quot; user is deleted along with all that they had posted: questions, answers, comments. &lt;a href=&quot;https://meta.stackexchange.com/questions/88994/what-is-the-difference-between-a-deleted-user-and-a-destroyed-user&quot;&gt;Generally used as an expedient way of getting rid of spam.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;⁴ This counts every review that was submitted (not skipped) - so the 2 suggested edits reviews needed to approve an edit would count as 2, the goal being to indicate the frequency of moderation actions. This also applies to flags, etc.&lt;/p&gt;&#xA;&lt;p&gt;⁵ Includes close flags (but &lt;em&gt;not&lt;/em&gt; close or reopen votes).&lt;/p&gt;&#xA;&lt;p&gt;⁶ This ignores numerous deletions that happen automatically in response to some other action.&lt;/p&gt;&#xA;&lt;p&gt;⁷ This includes comments deleted by their own authors (which also account for some number of handled comment flags).&lt;/p&gt;&#xA;&lt;h3&gt;Further reading:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Wanna see how these numbers have changed over time? We posted a similar report here last year: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18407/2019-a-year-in-moderation&quot;&gt;2019: a year in moderation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can also check out &lt;a href=&quot;https://stackexchange.com/search?q=title%3A%222020%3A+a+year+in+moderation%22&quot;&gt;this report on other sites&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Or peruse &lt;a href=&quot;https://meta.stackexchange.com/q/359735/208518&quot;&gt;detailed information on the number of questions closed and reopened across all sites&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;A big thank you to &lt;a href=&quot;https://stackexchange.com/users/620/shog9&quot;&gt;Shog9&lt;/a&gt; for writing the queries and script to facilitate fetching and posting this data to all the sites in the network, and to &lt;a href=&quot;https://stackexchange.com/users/459488/brian-nickel&quot;&gt;Brian&lt;/a&gt; for the subsequent work making the whole thing more user friendly.&lt;/p&gt;&#xA;&lt;p&gt;Wishing everyone a happy 2021!&lt;/p&gt;&#xA;" OwnerUserId="38734" LastEditorUserId="38734" LastEditDate="2021-01-21T11:49:50.090" LastActivityDate="2021-01-21T11:49:50.090" Title="2020: a year in moderation" Tags="|discussion|moderation|statistics|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20669" PostTypeId="2" ParentId="2140" CreationDate="2021-01-19T19:02:07.127" Score="1" Body="&lt;h1&gt;Finish what John McCarthy started (WIP) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/lisp&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;lisp&amp;#39;&quot; rel=&quot;tag&quot;&gt;lisp&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;This does not have anything to do with Joseph McCarthy or communism. Some background from &lt;a href=&quot;https://en.wikipedia.org/wiki/M-expression&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt; (you can skip ahead if you like):&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;John McCarthy published the first &lt;a href=&quot;http://www-formal.stanford.edu/jmc/recursive.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;paper&lt;/a&gt; on Lisp in 1960 while a research fellow at the Massachusetts Institute of Technology. In it he&#xA;described a language of symbolic expressions (S-expressions) that&#xA;could represent complex structures as lists. Then he defined a set of&#xA;primitive operations on the S-expressions, and a language of&#xA;meta-expressions (M-expressions) that could be used to define more&#xA;complex operations. Finally, he showed how the meta-language itself&#xA;could be represented with S-expressions, resulting in a system that&#xA;was potentially self-hosting.[3] The draft version of this paper is&#xA;known as &amp;quot;AI Memo 8&amp;quot;.&lt;sup&gt;[&lt;a href=&quot;https://www.informatimago.com/develop/lisp/com/informatimago/small-cl-pgms/aim-8/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;4&lt;/a&gt;]&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;Example M-expressions&#xA;&lt;a href=&quot;https://i.stack.imgur.com/DKgzM.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/DKgzM.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;McCarthy had planned to develop an&#xA;automatic Lisp compiler (LISP 2) using M-expressions as the language&#xA;syntax and S-expressions to describe the compiler's internal&#xA;processes. Stephen B. Russell read the paper and suggested to him that&#xA;S-expressions were a more convenient syntax. Although McCarthy&#xA;disapproved of the idea, Russell and colleague Daniel J. Edwards&#xA;hand-coded an interpreter program that could execute S-expressions.&lt;a href=&quot;https://i.stack.imgur.com/DKgzM.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;2&lt;/a&gt;&#xA;This program was adopted by McCarthy's research group, establishing&#xA;S-expressions as the dominant form of Lisp.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&lt;p&gt;Interpret a subset of M-expressions, where 9 primitive functions have already been defined.&lt;/p&gt;&#xA;&lt;h2&gt;Syntax&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Atoms&lt;/strong&gt;: An atom is a series of any characters excluding &lt;code&gt;[&lt;/code&gt;, &lt;code&gt;]&lt;/code&gt;, &lt;code&gt;;&lt;/code&gt;. While an atom name can include whitespace, leading and trailing whitespace is ignored. Some examples include &lt;code&gt;foo&lt;/code&gt;, &lt;code&gt;lambda&lt;/code&gt; (also a function name), and &lt;code&gt;nil&lt;/code&gt; (also a list). Atoms act as both variables and data (they're like strings).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Booleans&lt;/strong&gt;: The atom &lt;code&gt;t&lt;/code&gt; is truthy, whereas the atom &lt;code&gt;nil&lt;/code&gt; is falsy.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;quote&lt;/code&gt;&lt;/strong&gt;: A series of expressions between square brackets, delimited by semicolons. &lt;code&gt;[a; [b; c]; de]&lt;/code&gt; is equivalent to the S-expression &lt;code&gt;(QUOTE (A (B C) DE))&lt;/code&gt;. It is somewhat like this JS list: &lt;code&gt;[&amp;quot;a&amp;quot;, [&amp;quot;b&amp;quot;, &amp;quot;c&amp;quot;], &amp;quot;de&amp;quot;]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;code&gt;cond&lt;/code&gt;&lt;/strong&gt;: A series of if-then pairs between square brackets, delimited by semicolons, with an arrow &lt;code&gt;-&amp;gt;&lt;/code&gt; (you can use any other character(s)) separating the if-then pairs. e.g. &lt;code&gt;[atom[x] -&amp;gt; x; t -&amp;gt; car[x]]&lt;/code&gt; yields &lt;code&gt;x&lt;/code&gt; if it's an atom, or the first element of &lt;code&gt;x&lt;/code&gt; if it's a list. It is guaranteed that at least one of the cases will be true.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Function application&lt;/strong&gt;: Functions can be called using &lt;code&gt;functionname[arg1; arg2; ...; argN]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;car&lt;/code&gt; - Return the first element of its argument.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cdr&lt;/code&gt; - Return its argument without the first element.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cons&lt;/code&gt; - Prepend its first argument to its second argument.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;eq&lt;/code&gt; - Check if its two arguments are equal.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;atom&lt;/code&gt; - Check if its argument is an atom.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;lambda&lt;/code&gt; - Define an anonymous function using the syntax &lt;code&gt;lambda[[param1; param2; ...; paramN]; bodythatusesparams]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;label&lt;/code&gt; - Store a function using a name. For example, &lt;code&gt;label[drop2; lambda[[xs]; cdr[cdr[xs]]]]&lt;/code&gt; defines a function &lt;code&gt;drop2&lt;/code&gt; that drops the first two elements of its first argument.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Functions may use lexical or dynamic scope, or some crazy mixture of both.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;sub&gt;Much of this question is copied from &lt;a href=&quot;https://codegolf.stackexchange.com/q/103257/95792&quot;&gt;this challenge&lt;/a&gt; and the Wikipedia article on M-expressions.&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Questions for Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For &lt;code&gt;cond&lt;/code&gt;, should I use the &lt;code&gt;[condition -&amp;gt; res; condition2 -&amp;gt; res2; ...]&lt;/code&gt; syntax, or should I keep it like the linked &lt;a href=&quot;https://codegolf.stackexchange.com/q/103257/95792&quot;&gt;challenge&lt;/a&gt;?&lt;/li&gt;&#xA;&lt;li&gt;Should answers support higher-order functions?&lt;/li&gt;&#xA;&lt;li&gt;Does anyone have any good examples using Mexprs?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="95792" LastEditorUserId="95792" LastEditDate="2021-03-12T23:58:54.987" LastActivityDate="2021-03-12T23:58:54.987" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20670" PostTypeId="2" ParentId="2140" CreationDate="2021-01-19T19:08:34.283" Score="1" Body="&lt;h1&gt;Radiation Showdown (WIP)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/radiation-hardening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; rel=&quot;tag&quot;&gt;radiation-hardening&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Two radiation-hardened programs will go head-to-head to destroy each other.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to create a program which takes the other program's source as input and output the index of the byte that should be deleted from the other program. (zero-indexed)&lt;/p&gt;&#xA;&lt;p&gt;Each program will be radiated at the same time. The first program to fail to return a valid index after being radiated loses (whether by compiler error, runtime exception, out-of-bounds output, or some other means), or it is considered a draw if both fail at the same time.&lt;/p&gt;&#xA;&lt;p&gt;Each program will compete against each other program. The program receives 1 point per round survived. The overall winner is the one with the most points.&lt;/p&gt;&#xA;&lt;p&gt;Programs are limited to a length of 1024 bytes.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Alternate possibilities:&lt;/p&gt;&#xA;&lt;p&gt;(Inspired by @Dingus) A hash of the opponent's original source code and a list of the indexes of bytes deleted so far is passed in instead of the current source code, making it a bit more of a blind guess as to what you radiate. If at any time, a program makes a guess it has already made, it loses. This turns it into a sort of &amp;quot;Radiation Battleship&amp;quot;&lt;/p&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2021-01-21T00:07:44.523" LastActivityDate="2021-01-21T00:07:44.523" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="20671" PostTypeId="2" ParentId="2140" CreationDate="2021-01-20T14:17:58.517" Score="0" Body="&lt;h1&gt;Write a Brainfuck compiler + decompiler!&lt;/h1&gt;&#xA;&lt;p&gt;Many Brainfuck compilers will convert to a different language instead of compiling directly.&lt;/p&gt;&#xA;&lt;p&gt;Your job is to write not only a compiler in language X which compiles Brainfuck to the &lt;strong&gt;same language as the compiler&lt;/strong&gt;, but also a &lt;strong&gt;decompiler&lt;/strong&gt; which takes code compiled with said compiler and &lt;strong&gt;outputs equivalent Brainfuck.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No embedding the original/stripped source code or similar loopholes. &lt;strong&gt;You know what I mean.&lt;/strong&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Additionally, no outputting an interpreter with the original source code.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The compiler must accept whitespace and comments&lt;/li&gt;&#xA;&lt;li&gt;Optimizations are allowed and encouraged, as long as you can convert these &lt;em&gt;back&lt;/em&gt; to Brainfuck.&lt;/li&gt;&#xA;&lt;li&gt;The input will always be a valid Brainfuck program&lt;/li&gt;&#xA;&lt;li&gt;You are not required to print comments in the decompiler, however, excess comments and whitespace are allowed in the output as long as the program is valid. However, these lower your score. &lt;/li&gt;&#xA;&lt;li&gt;You do not need to handle excess whitespace or comments in the decompiler, &lt;strong&gt;you can assume it was code directly generated by your compiler.&lt;/strong&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Therefore, it is also guaranteed to be valid code.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;No executing the compiled code.&lt;/li&gt;&#xA;&lt;li&gt;The compiler must generate correct code and run without any helpers.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You are allowed to be flexible with the cell size as long as it is at least 8 bits.&lt;/li&gt;&#xA;&lt;li&gt;You are allowed to be flexible with the tape size as long as it is at least 30,000 elements. A wrapping tape is not required.&lt;/li&gt;&#xA;&lt;li&gt;EOF can store either 0, -1, or leave unchanged&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Your score will be the following:&lt;/p&gt;&#xA;&lt;p&gt;(compiler size in bytes + decompiler size in bytes) × (&lt;a href=&quot;https://github.com/fabianishere/brainfuck/blob/b131824561e155a8708a0f5b78a5e6736f6aba3e/examples/math/factor.bf&quot; rel=&quot;nofollow noreferrer&quot;&gt;compiled size of factor.bf in bytes&lt;/a&gt; ÷ size of factor.bf in bytes)&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, so &lt;strong&gt;the most votes wins.&lt;/strong&gt; This is because there can be some creative and boring solutions. Golfing is still encouraged.&lt;/p&gt;&#xA;" OwnerUserId="94093" LastEditorUserId="94093" LastEditDate="2021-01-23T05:51:31.713" LastActivityDate="2021-01-23T05:51:31.713" CommentCount="15" ContentLicense="CC BY-SA 4.0" />
  <row Id="20672" PostTypeId="2" ParentId="2140" CreationDate="2021-01-20T21:03:22.297" Score="1" Body="&lt;h1&gt;Print a 3D shape&lt;/h1&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/217933/print-a-3d-shape&quot;&gt;Posted&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="100356" LastEditorUserId="100356" LastEditDate="2021-01-23T17:29:26.437" LastActivityDate="2021-01-23T17:29:26.437" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="20673" PostTypeId="2" ParentId="2140" CreationDate="2021-01-20T21:19:53.880" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/218772/66833&quot;&gt;Is it a vampire number?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-02-08T17:39:35.050" LastActivityDate="2021-02-08T17:39:35.050" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20674" PostTypeId="2" ParentId="2140" CreationDate="2021-01-21T13:11:42.553" Score="0" Body="&lt;h1&gt;Cosmic ray hacking&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Cosmic background radiation can cause random bit flips in electronics. For this reason, some mission-critical computers&#xA;undergo &lt;a href=&quot;https://en.wikipedia.org/wiki/Radiation_hardening&quot; rel=&quot;nofollow noreferrer&quot;&gt;radiation hardening&lt;/a&gt;. Your task is to use your magic bit&#xA;flip gun to hack in to a program and make it print something different.&lt;/p&gt;&#xA;&lt;h2&gt;Cops' challenge&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Write a program or function that outputs a determinate, non-empty string of your choice (which you should specify).&lt;/li&gt;&#xA;&lt;li&gt;Choose a different, determinate string of your choice (which you should specify).&lt;/li&gt;&#xA;&lt;li&gt;Also specify a number &lt;code&gt;n&lt;/code&gt; which is the number of bit flips the robbers should perform on your answer in order to get&#xA;it to output the second string.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447&quot;&gt;Standard IO rules apply&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest uncracked program wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Robbers' challenge&lt;/h2&gt;&#xA;&lt;p&gt;Choose an uncracked cop submission written by another user. Find a program that differs by exactly &lt;code&gt;n&lt;/code&gt; bit flips from&#xA;the original cop's program, and outputs the string &lt;code&gt;s&lt;/code&gt; (where &lt;code&gt;n&lt;/code&gt; and &lt;code&gt;s&lt;/code&gt; are specified by the cop). First valid crack&#xA;for each cop answer wins.&lt;/p&gt;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your program must be written in the same language and version as the cop's&lt;/li&gt;&#xA;&lt;li&gt;Your program must use the same I/O method as the cop's, unless they specify otherwise&lt;/li&gt;&#xA;&lt;li&gt;Flipping the same bit twice (which does nothing to the whole string) is allowed, but it takes up 2 of your available&#xA;bit flips.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;h3&gt;Cops - Python 3, 8 bytes&lt;/h3&gt;&#xA;&lt;p&gt;Prints &lt;code&gt;5&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;print(5)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Using 1 bit flip, change this program to print &lt;code&gt;4&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Robbers - Cracks example answer&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;print(4)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Because the ASCII digit &lt;code&gt;5&lt;/code&gt; is &lt;code&gt;00110101&lt;/code&gt;, and &lt;code&gt;4&lt;/code&gt; is &lt;code&gt;00110100&lt;/code&gt; (the last bit has been flipped)&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should I change the scoring system?&lt;/li&gt;&#xA;&lt;li&gt;This is related to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/radiation-hardening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; rel=&quot;tag&quot;&gt;radiation-hardening&lt;/a&gt;, but I don't think it actually is. Is this&#xA;right? Or maybe &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; would be better? (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/radiation-softening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;radiation-softening&amp;#39;&quot; rel=&quot;tag&quot;&gt;radiation-softening&lt;/a&gt;?)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; refers to the limit that the cop imposes on the robber, rather than the scoring system - is this an acceptable use of the tag?&lt;/li&gt;&#xA;&lt;li&gt;Is this clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Is this a duplicate of an existing challenge?&lt;/li&gt;&#xA;&lt;li&gt;Any other feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2021-01-21T13:11:42.553" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20675" PostTypeId="1" CreationDate="2021-01-21T13:41:36.553" Score="6" ViewCount="242" Body="&lt;p&gt;I have an idea for a fun challenge but it will require access to IPA phonetic transcriptions (in English at least). An API that serves up the same would also do, though it would tend to favor languages with integrated support for external APIs.&lt;/p&gt;&#xA;&lt;p&gt;Web searching has not revealed any such dictionaries to me, but it feels like one should exist. Can anybody point me to such a dictionary or word list?&lt;/p&gt;&#xA;" OwnerUserId="12522" LastEditorUserId="107299" LastEditDate="2022-07-03T23:01:08.370" LastActivityDate="2022-07-03T23:01:08.370" Title="Source for a downloadable dictionary with IPA phonetic transcriptions?" Tags="|discussion|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20678" PostTypeId="2" ParentId="2140" CreationDate="2021-01-23T19:58:03.640" Score="3" Body="&lt;h1&gt;Is it a Lobster Number?&lt;/h1&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/217960/is-it-a-lobster-number&quot;&gt;Posted&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="82004" LastEditorUserId="82004" LastEditDate="2021-01-24T15:03:08.517" LastActivityDate="2021-01-24T15:03:08.517" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="20679" PostTypeId="2" ParentId="5243" CreationDate="2021-01-24T22:29:08.707" Score="8" Body="&lt;h1&gt;100-500 rep for solving challenges using an ACE exploit in an esoteric language&lt;/h1&gt;&#xA;&lt;p&gt;I've reached 2300 rep, so here's a bounty for you RE/CTF enthusiasts for an answer I really want to see.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;CVE-2018-6849: Code execution results in code execution&lt;br /&gt;&#xA;— &lt;em&gt;TheZZAZZGlitch, &amp;quot;A friendly reminder: Lua scripts are arbitrary code&amp;quot;, &lt;a href=&quot;https://youtu.be/LtGm7e9gd0Y&quot; rel=&quot;nofollow noreferrer&quot;&gt;YouTube&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Esoteric language interpreters and compilers are often pretty shoddily written. It is usually shrugged off because &amp;quot;nobody is going to use it for anything serious&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;Your goal:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Find an existing interpreter, translator, or compiler for an &lt;strong&gt;esoteric&lt;/strong&gt; language published &lt;strong&gt;before January 2021.&lt;/strong&gt; Preferably, this should have an entry on &lt;a href=&quot;https://esolangs.org/wiki/Main_Page&quot; rel=&quot;nofollow noreferrer&quot;&gt;esolangs.org&lt;/a&gt; or be under the &amp;quot;Recreational&amp;quot; category on TIO.&lt;/li&gt;&#xA;&lt;li&gt;Find a bug &lt;strong&gt;in the interpreter, compiler, or generated code&lt;/strong&gt; that allows you to &lt;strong&gt;escape the language&lt;/strong&gt; and execute &lt;strong&gt;arbitrary code&lt;/strong&gt;. This can be direct code execution, launching a shell, cross-site scripting, return oriented programming, making compilers emit arbitrary code, or something similar. If you can execute arbitrary code in the compiler itself, that counts as well.&lt;/li&gt;&#xA;&lt;li&gt;Explain the bug (and, preferably, explain a way to fix it if it hasn't been patched)&lt;/li&gt;&#xA;&lt;li&gt;Solve a code challenge &lt;strong&gt;posted before January 2021&lt;/strong&gt; using code executed from that exploit &lt;strong&gt;instead of&lt;/strong&gt; the tools provided by the language.&lt;/li&gt;&#xA;&lt;li&gt;Also be sure to explain the payload itself.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;strong&gt;To be clear:&lt;/strong&gt; You are only allowed to use features provided by the language to set up the payload and exploit. The logic to solve the puzzle must be entirely in the payload.&lt;/p&gt;&#xA;&lt;p&gt;However, you are allowed to execute some code from the interpreter/compiler itself in the payload, e.g. for input and output or ROP chaining.&lt;/p&gt;&#xA;&lt;p&gt;The following do not count:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Exploits that just run the interpreter on arbitrary code in the same language. You must demonstrate full control over the interpreter.&lt;/li&gt;&#xA;&lt;li&gt;Exploits caused by the code you wrote. The code you wrote must only exploit the bug.&lt;/li&gt;&#xA;&lt;li&gt;Tools in the language &lt;em&gt;intended&lt;/em&gt; to execute code (e.g. &lt;code&gt;execve()/system()&lt;/code&gt; in C or things like &lt;code&gt;eval()&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Bugs in third party code or the programming language that the interpreter/compiler uses. (e.g. exploiting a Node.js bug in an interpreter written in JavaScript)&lt;/li&gt;&#xA;&lt;li&gt;Code challenges that are simply &amp;quot;crash the program&amp;quot; or the like: It should be something interesting.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Older releases of an interpreter/compiler are fine.&lt;/p&gt;&#xA;&lt;p&gt;Since these are very system specific, please either provide an online demo or a Docker image. You are required to provide the exact build instructions in the latter case.&lt;/p&gt;&#xA;&lt;p&gt;Custom compiler flags for building interpreters follow the same loophole rules.&lt;/p&gt;&#xA;&lt;p&gt;See some of my answers for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4399/shortest-code-that-raises-a-sigsegv&quot;&gt;Shortest code that raises a SIGSEGV&lt;/a&gt; which highlight some interpreter bugs I found for a starting point.&lt;/p&gt;&#xA;&lt;p&gt;While I may not be able to award immediately, I will try to award anywhere from 100-500 rep, &lt;em&gt;&lt;strong&gt;depending on how much you impress me.&lt;/strong&gt;&lt;/em&gt; Finding new exploits is strongly encouraged instead of using the same one over and over.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Take that Phooey freebie while you can!&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Add a comment here or ping me in chat if I (likely) don't notice your post.&lt;/p&gt;&#xA;&lt;h3&gt;Awarded bounties&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;200 rep to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt; for &lt;a href=&quot;https://codegolf.stackexchange.com/a/231059/94093&quot;&gt;this answer&lt;/a&gt; for escaping a string to execute arbitrary Python in &lt;a href=&quot;https://github.com/Lyxal/Vyxal/releases/tag/v2.4.0&quot; rel=&quot;nofollow noreferrer&quot;&gt;Vyxal 2.4.0&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="94093" LastEditorUserId="94093" LastEditDate="2021-07-07T16:43:52.287" LastActivityDate="2021-07-07T16:43:52.287" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="20682" PostTypeId="2" ParentId="2140" CreationDate="2021-01-26T13:14:24.567" Score="0" Body="&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;This challenge was originally the &lt;a href=&quot;https://github.com/ChocolateOverflow/Writeup-YASCON_CTF_2020/tree/master/Misc/Among_us&quot; rel=&quot;nofollow noreferrer&quot;&gt;&amp;quot;Among Us&amp;quot;&lt;/a&gt; challenge in the &amp;quot;Misc&amp;quot; category of YASCON CTF 2020. (The link includes an answer to that challenge. Click at your own risk.)&lt;/p&gt;&#xA;&lt;p&gt;You're given a lot of files, only 1 of which is different from every other files. Your job is to find that 1 different file.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input: the file names of all the files to be searched through.&lt;/li&gt;&#xA;&lt;li&gt;Output: the name of the 1 different file.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Avoid burying the important details of your challenge in a mound of unimportant details. Be concise. Include what needs to be included.&lt;/p&gt;&#xA;&lt;p&gt;It is guaranteed to have $n+1$ files, of which $n \ge 2$ files are the exact same, and 1 different file.&lt;/p&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. Least bytes wins.&lt;/p&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;1.txt 2.jpg 3.png 4.mp3&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;p&gt;(&lt;code&gt;3.png&lt;/code&gt; is different)&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;3.png&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="88218" LastEditorUserId="88218" LastEditDate="2021-01-27T03:09:31.450" LastActivityDate="2021-01-27T03:09:31.450" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20684" PostTypeId="2" ParentId="2140" CreationDate="2021-01-27T17:49:22.443" Score="-1" Body="&lt;p&gt;Here is the problem, for which I can only think of an iterative solution and have not found a closed formula.&lt;/p&gt;&#xA;&lt;p&gt;This problem was found on : &lt;a href=&quot;https://www.codingame.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.codingame.com/&lt;/a&gt; in the &lt;code&gt;shortest code&lt;/code&gt;mode.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;You need to paint a house with R rooms.&#xA;&#xA;For each room there are four walls and one ceiling, which all have the same dimensions and need C coats of paint.&#xA;&#xA;You can't paint the next coat until the previous one has dried. You're finished when every wall is dry. Time taken to move between walls, ceilings, rooms is negligible.&#xA;&#xA;It takes you M1 minutes to paint each coat, and M2 minutes for the paint to dry on each. You must finish in the least possible time, otherwise they will not pay you.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;NOTE DON'T FORGET, THE PAINT MUST ALL BE DRY BEFORE YOU CAN RECEIVE YOUR PAYMENT!&lt;/p&gt;&#xA;&lt;p&gt;In :&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Line 1: R, C, M1, M2 separated by spaces.&#xA;R: Number of rooms in the house&#xA;C: Coats of paint needed for each wall/ceiling&#xA;M1: Minutes taken to paint each coat&#xA;M2: Minutes taken for paint to dry on each coat (measured from when you've finished the entire coat)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Out :&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;The time taken to paint the entire house in the format H:MM&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Contraints&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 ≤ R ≤ 10&#xA;1 ≤ C ≤ 20&#xA;1 ≤ M1 ≤ 10000&#xA;1 ≤ M2 ≤ 10000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Dataset:&lt;/p&gt;&#xA;&lt;p&gt;input: 1 1 12 0&lt;/p&gt;&#xA;&lt;p&gt;output: 60&lt;/p&gt;&#xA;&lt;p&gt;input: 5 2 5 30&lt;/p&gt;&#xA;&lt;p&gt;output: 280&lt;/p&gt;&#xA;&lt;p&gt;input: 1 5 5 200&lt;/p&gt;&#xA;&lt;p&gt;output: 1045&lt;/p&gt;&#xA;" OwnerUserId="100589" LastEditorUserId="100589" LastEditDate="2021-01-28T09:28:44.027" LastActivityDate="2021-01-28T09:28:44.027" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="20686" PostTypeId="2" ParentId="2140" CreationDate="2021-01-28T02:04:42.653" Score="2" Body="&lt;h1&gt;Is each bracket matched?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/balanced-string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;balanced-string&amp;#39;&quot; rel=&quot;tag&quot;&gt;balanced-string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a string consisting only of the characters &lt;code&gt;()[]{}&lt;/code&gt;, determine if each type of bracket is matched--that is, every &lt;code&gt;(&lt;/code&gt; corresponds to one later &lt;code&gt;)&lt;/code&gt;, every &lt;code&gt;[&lt;/code&gt; corresponds to one later &lt;code&gt;]&lt;/code&gt;, and every &lt;code&gt;{&lt;/code&gt; corresponds to one later &lt;code&gt;}&lt;/code&gt; (and vice-versa).&lt;/p&gt;&#xA;&lt;p&gt;Pairs &lt;em&gt;are&lt;/em&gt; allowed to overlap: &lt;code&gt;([)]&lt;/code&gt; is just as valid as &lt;code&gt;([])&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Output one consistent value for one classification and anything else for the other, or following your language's truthiness semantics (inverted if you want).&lt;/p&gt;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&lt;p&gt;Matched:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;()&#xA;[]&#xA;{}&#xA;()[]{}&#xA;()()([])&#xA;{[][}]&#xA;{{{}}}&#xA;([{}]){([]})&#xA;[(()())(((())))(]()(()))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Not matched:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(&#xA;]&#xA;{{}&#xA;[)&#xA;(()())((((()))))(()()(())(())))&#xA;{}{}{)&#xA;[())[])]&#xA;)(&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Does this admit a variety of interesting solutions?&lt;/li&gt;&#xA;&lt;li&gt;Would it be better to add &lt;code&gt;&amp;lt;&amp;gt;&lt;/code&gt; as a bracket type? Have fewer bracket types? Arbitrarily many?&lt;/li&gt;&#xA;&lt;li&gt;I'm writing this up entirely because I'm surprised it hasn't been asked yet, so although I have looked, this might still be a duplicate.&lt;/li&gt;&#xA;&lt;li&gt;Although I don't think it's necessarily &lt;em&gt;unclear&lt;/em&gt;, I feel like the specification could be worded better.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="85334" LastEditorUserId="85334" LastEditDate="2021-01-28T02:10:47.750" LastActivityDate="2021-01-28T02:10:47.750" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20687" PostTypeId="2" ParentId="2140" CreationDate="2021-01-28T10:20:30.783" Score="3" Body="&lt;p&gt;&lt;em&gt;Note&lt;/em&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;as you can probably tell, this is a simpler variation; however the poster of the other sandbox post has not been visiting the site for a while.&lt;/li&gt;&#xA;&lt;li&gt;because of the current situation, I &lt;strong&gt;recently&lt;/strong&gt; (after the 2 upvotes is made) changed the winning criteria. Is there any problem with the description?&lt;/li&gt;&#xA;&lt;li&gt;What info should be included in the header?...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Efficient table-lookup computation&lt;/h2&gt;&#xA;&lt;p&gt;Posted: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/218976/efficient-table-lookup-computation&quot;&gt;Efficient table-lookup computation&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="69850" LastEditorUserId="69850" LastEditDate="2021-02-13T11:26:32.683" LastActivityDate="2021-02-13T11:26:32.683" CommentCount="20" ContentLicense="CC BY-SA 4.0" />
  <row Id="20688" PostTypeId="2" ParentId="2140" CreationDate="2021-01-28T16:17:16.367" Score="2" Body="&lt;h1&gt;Count strictly overlapping substrings &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/counting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;counting&amp;#39;&quot; rel=&quot;tag&quot;&gt;counting&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/subsequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;subsequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;subsequence&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/218978&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2021-02-13T12:49:12.453" LastActivityDate="2021-02-13T12:49:12.453" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20690" PostTypeId="2" ParentId="2140" CreationDate="2021-01-28T17:11:57.410" Score="1" Body="&lt;h1&gt;Counting set bits in a byte&lt;/h1&gt;&#xA;&lt;p&gt;Here is a bite-sized problem I ran in to when trying to implement &lt;a href=&quot;https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life&quot; rel=&quot;nofollow noreferrer&quot;&gt;Conway's game of life&lt;/a&gt; on a microcontroller, and was trying to count the amount of neighbours: How can you check how many bits are set in a byte?&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given one byte of input data and an integer N between 0 and 8, check if there are exactly N bits set in the byte.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;N = 0, input = 0b00000001 -&amp;gt; False &#xA;N = 0, input = 0b00000000 -&amp;gt; True &#xA;N = 3, input = 0b01001001 -&amp;gt; True &#xA;N = 3, input = 0b11100000 -&amp;gt; True &#xA;N = 3, input = 0b00001111 -&amp;gt; False &#xA;N = 7, input = 0b11101111 -&amp;gt; True &#xA;N = 7, input = 0b11111110 -&amp;gt; True &#xA;N = 8, input = 0b11111111 -&amp;gt; False &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Sandbox question&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;My first intuition to solving this problem was to shift the bits out one by one, AND with 0x01 and count them. I feel however it must be possible to do something more efficient in terms of CPU cycles used. How can I make a challenge that is about optimizing instruction count and memory usage rather than on program-size? I have seen the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; tag, but I don't know what scoring method best to use.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Edit: Closing after some good comments and possible solutions&lt;/h1&gt;&#xA;&lt;p&gt;Arnauld and CristoLosoph gave some great comments and led me to conclude that my issue is maybe to hardware/language specific to fit in a nice coding challenge. CristoLosoph showed me this interesting code snippet which I think is quite efficient:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;uint8_t count_bits(uint8_t x){&#xA;     x = ((x &amp;amp; 0b10101010) &amp;gt;&amp;gt; 1) + (x &amp;amp; 0b01010101); &#xA;     x = ((x &amp;amp; 0b11001100) &amp;gt;&amp;gt; 2) + (x &amp;amp; 0b00110011); &#xA;     x = ((x &amp;amp; 0b11110000) &amp;gt;&amp;gt; 4) + (x &amp;amp; 0b00001111); &#xA;     return x;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Two other things I learned:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Some hardware have a &lt;a href=&quot;https://codegolf.stackexchange.com/a/47873/77496&quot;&gt;builtin &lt;code&gt;POPCNT&lt;/code&gt; instruction&lt;/a&gt; in their instruction set, and gcc has a &lt;code&gt;__builtin_popcount()&lt;/code&gt; method that does exactly what I was looking for&lt;/li&gt;&#xA;&lt;li&gt;I found &lt;a href=&quot;https://stackoverflow.com/questions/9949935/calculate-number-of-bits-set-in-byte&quot;&gt;in this question&lt;/a&gt; that it's an interesting trade-off (as with most embedded functions probably) to just make a lookup table containing all 256 possible return values. It takes some memory but not too much.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I also learned that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; probably would have been a good fit for this type of challenge!&lt;/p&gt;&#xA;&lt;p&gt;Once again thanks for the interesting comments!&lt;/p&gt;&#xA;" OwnerUserId="77496" LastEditorUserId="77496" LastEditDate="2021-01-29T21:29:31.507" LastActivityDate="2021-01-29T21:29:31.507" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="20691" PostTypeId="2" ParentId="2140" CreationDate="2021-01-29T03:52:41.743" Score="1" Body="&lt;h1&gt;Quine Countdown! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Write a program that accepts a single parameter n and outputs another program that outputs another program etc until the nth call outputs the original input n again.&lt;/p&gt;&#xA;&lt;p&gt;Scoring is a modified version of codegolf: For input &lt;code&gt;100&lt;/code&gt;, add together the code length of each program in the chain, excluding the final &lt;code&gt;100&lt;/code&gt;. This is your score. Lowest score wins!&lt;/p&gt;&#xA;" OwnerUserId="95142" LastActivityDate="2021-01-29T03:52:41.743" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20694" PostTypeId="2" ParentId="2140" CreationDate="2021-01-31T01:02:54.620" Score="1" Body="&lt;h1&gt;Mix my colors&lt;/h1&gt;&#xA;&lt;p&gt;This challenge is inspired by the &lt;a href=&quot;https://nethackwiki.com/wiki/Alchemy#Color_alchemy&quot; rel=&quot;nofollow noreferrer&quot;&gt;Color Alchemy Patch&lt;/a&gt; on NetHack, notably incorporated by UnNetHack 3.5.2.&lt;/p&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Given two strings indicating colors, mix them according to the rules below, then output it.&lt;/p&gt;&#xA;&lt;h2&gt;Colors&lt;/h2&gt;&#xA;&lt;p&gt;There are 16 colors in total that are valid inputs. They are categorized to 8 &lt;strong&gt;chromaticities&lt;/strong&gt; and 2 &lt;strong&gt;brightnesses&lt;/strong&gt;, like below:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;        Light    Dark&#xA;Hueless white    black&#xA;Red     pink     ruby&#xA;Blue    sky-blue indigo&#xA;Yellow  yellow   golden&#xA;Orange  orange   amber&#xA;Green   emerald  dark-green&#xA;Purple  puce     magenta&#xA;Brown   ochre    brown&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(I'm omitting &lt;code&gt;gray&lt;/code&gt;, for it will make this challenge just cumbersome in this regard.)&lt;/p&gt;&#xA;&lt;p&gt;Note that all color names are in lowercase.&lt;/p&gt;&#xA;&lt;h2&gt;Color-mixing rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Above all, mixing colors is idempotent.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing colors is commutative unless noted below.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When mixing two primary colors (Red, Blue, or Yellow):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If they have same chromaticities, the result will also be in the same chromaticity.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing Red and Blue results in Purple.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing Red and Yellow results in Orange.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing Blue and Yellow results in Green.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When mixing two secondary colors (Orange, Green, or Purple):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If they have same chromaticities, the result will also be in the same chromaticity.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;All other combinations result in Brown.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For all cases covered by above, mixing two Light (resp. Dark) colors will result in corresponding Light (resp. Dark) color.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For all cases covered by above, mixing a Light color and a Dark color shall result in &lt;strong&gt;either&lt;/strong&gt; Light or Dark. This is the only rule that may break the commutativity.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing a Light color with &lt;code&gt;black&lt;/code&gt; results in corresponding Dark.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing a Dark color with &lt;code&gt;white&lt;/code&gt; results in corresponding Light.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;All combinations not covered by above fall in &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;h3&gt;Valid outputs&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing &lt;code&gt;white&lt;/code&gt; and &lt;code&gt;white&lt;/code&gt; results in &lt;code&gt;white&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing &lt;code&gt;pink&lt;/code&gt; and &lt;code&gt;pink&lt;/code&gt; results in &lt;code&gt;pink&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing &lt;code&gt;pink&lt;/code&gt; and &lt;code&gt;ruby&lt;/code&gt; results in either &lt;code&gt;pink&lt;/code&gt; or &lt;code&gt;ruby&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing &lt;code&gt;ruby&lt;/code&gt; and &lt;code&gt;golden&lt;/code&gt; results in &lt;code&gt;amber&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing &lt;code&gt;sky-blue&lt;/code&gt; and &lt;code&gt;ruby&lt;/code&gt; results in either &lt;code&gt;puce&lt;/code&gt; or &lt;code&gt;magenta&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing &lt;code&gt;emerald&lt;/code&gt; and &lt;code&gt;dark-green&lt;/code&gt; results in either &lt;code&gt;emerald&lt;/code&gt; or &lt;code&gt;dark-green&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing &lt;code&gt;emerald&lt;/code&gt; and &lt;code&gt;orange&lt;/code&gt; results in &lt;code&gt;ochre&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing &lt;code&gt;puce&lt;/code&gt; and &lt;code&gt;amber&lt;/code&gt; results in either &lt;code&gt;ochre&lt;/code&gt; or &lt;code&gt;brown&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing &lt;code&gt;white&lt;/code&gt; and &lt;code&gt;ruby&lt;/code&gt; results in &lt;code&gt;pink&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing &lt;code&gt;ochre&lt;/code&gt; and &lt;code&gt;black&lt;/code&gt; results in &lt;code&gt;brown&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;&lt;em&gt;Don't care&lt;/em&gt; situations&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing &lt;code&gt;pink&lt;/code&gt; and &lt;code&gt;white&lt;/code&gt; falls in &lt;em&gt;don't care&lt;/em&gt; situation. There is no rule that covers this case.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing &lt;code&gt;ochre&lt;/code&gt; and &lt;code&gt;brown&lt;/code&gt; falls in &lt;em&gt;don't care&lt;/em&gt; situation. There is no analogous rule for tertiary colors.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing &lt;code&gt;indigo&lt;/code&gt; and &lt;code&gt;magenta&lt;/code&gt; falls in &lt;em&gt;don't care&lt;/em&gt; situation. There is no rule for mixing a primary color and a secondary color.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing &lt;code&gt;indigo&lt;/code&gt; and &lt;code&gt;orange&lt;/code&gt; falls in &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing &lt;code&gt;pink&lt;/code&gt; and &lt;code&gt;ochre&lt;/code&gt; falls in &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Mixing &lt;code&gt;white&lt;/code&gt; and &lt;code&gt;black&lt;/code&gt; falls in &lt;em&gt;don't care&lt;/em&gt; situation. (In the game, it results in &lt;code&gt;gray&lt;/code&gt;, but I'll ignore this, for sake of simplicity of this challenge.)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Rules for code golf&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Input format is flexible. In particular, it can be two strings, or one string separating colors by whitespaces. It's implementation-defined whether to accept leading or trailing whitespaces.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Output format is also flexible. Outputting leading or trailing whitespaces is okay.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Invalid inputs fall in &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2021-01-31T01:09:45.303" LastActivityDate="2021-01-31T01:09:45.303" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20695" PostTypeId="2" ParentId="2140" CreationDate="2021-01-31T22:53:57.873" Score="1" Body="&lt;h1&gt;Golf this Thumb-2 constant!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/218763/94093&quot;&gt;Posted&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="94093" LastEditorUserId="94093" LastEditDate="2021-02-08T14:00:12.777" LastActivityDate="2021-02-08T14:00:12.777" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="20696" PostTypeId="2" ParentId="2140" CreationDate="2021-02-01T01:07:49.160" Score="1" Body="&lt;h1&gt;Longest Common Suffix&lt;/h1&gt;&#xA;&lt;p&gt;Given arbitrarily many (more than 4) words, your goal is to find the longest common suffix of all of them.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The suffix shouldn't be longer than one third of the length of any word, and should be longer than 2 characters.&lt;/li&gt;&#xA;&lt;li&gt;The words can have at most one &amp;quot;exception&amp;quot; among them, that is, it doesn't have the same suffix others have. You should ignore these &amp;quot;exceptions&amp;quot;.&lt;/li&gt;&#xA;&lt;li&gt;If no suffix can satisfy all rules above, do not make any output.&lt;/li&gt;&#xA;&lt;li&gt;All given words are separated by spaces; they only contain lower case English alphabets.&lt;/li&gt;&#xA;&lt;li&gt;You can use any way to accept input, but output should only be in &lt;code&gt;STDOUT&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Given: television operation delegation repetition&#xA;Output: ion&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;Given: vision decision subtraction observation&#xA;Output: &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Why? The suffix, &lt;code&gt;ion&lt;/code&gt;, is longer than 1/3 the length of &lt;code&gt;vision&lt;/code&gt; and &lt;code&gt;decision&lt;/code&gt;. There're two exceptions.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Given: interested congratulated excited overjoyed&#xA;Output: ted&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Why? &lt;code&gt;overjoyed&lt;/code&gt; is an exception, because others have the suffix &lt;code&gt;ted&lt;/code&gt;, but it doens't. So we ignore the word &lt;code&gt;overjoyed&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Given: abcdefghijkl bcdefghijkl cdefghijkl defghijkl&#xA;Output: jkl&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Why? &lt;code&gt;defghijkl&lt;/code&gt; is the longest, but it is longer than 1/3 the length of &lt;code&gt;defghijkl&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;This is code golf, so the shortest code win.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;It's not recommended to use built-in functions which directly returns the result.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="100635" LastEditorUserId="100635" LastEditDate="2021-02-01T10:35:17.137" LastActivityDate="2021-02-01T10:35:17.137" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20697" PostTypeId="2" ParentId="2140" CreationDate="2021-02-01T02:40:42.400" Score="1" Body="&lt;h1&gt;Next to the middle&lt;/h1&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/218714/next-to-the-middle&quot;&gt;Posted&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100356" LastEditorUserId="100356" LastEditDate="2021-02-07T12:26:40.367" LastActivityDate="2021-02-07T12:26:40.367" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20698" PostTypeId="1" CreationDate="2021-02-01T07:43:41.570" Score="12" ViewCount="518" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19271/16766&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others&lt;sup&gt;*&lt;/sup&gt;, we have a new featured language! Throughout February 2021, our Language of the Month, nominated by myself (caird coinheraahing) will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Whispers&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;sub&gt;&lt;sup&gt;*:&lt;/sup&gt; It was a close race between 4 different languages, but &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/56922085#56922085&quot;&gt;it seems that&lt;/a&gt; at 00:00 UTC Feb 1st, Whispers was ahead.&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;p&gt;What's a Language of the Month?&lt;/p&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/16766&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during February, those who wish to participate should learn (at least the basics of) Whispers, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about Whispers&lt;/h2&gt;&#xA;&lt;p&gt;Whispers is a rather unique programming language in how it executes a program. Rather than running line-by-line or command-by-command, Whispers only executes the last line in the program by default. All other lines are only run when referenced by either the last line, or by a line referenced by the last line (and so on).&lt;/p&gt;&#xA;&lt;p&gt;Each line in the program is made up of a single builtin, meaning that most complex programs consist of a lot of linked lines and passed values. Most of the builtins are math-centric (especially in the latest version), so it is especially strong at &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; challenges.&lt;/p&gt;&#xA;&lt;p&gt;The syntax rules that filter out invalid lines allow it to be very useable in polyglots and related challenges.&lt;/p&gt;&#xA;&lt;p&gt;Especially with the latest version, Whispers is very powerful, including a built in calculus engine, along with the ability to run and evaluate arbitrary mathematical expressions. Furthermore, it now has support for common sequences, a massive builtin library of functions and a large collection of builtin operators and constants&lt;/p&gt;&#xA;&lt;p&gt;Finally, the basic nature of the language/syntax could potentially lead to some interesting challenges themed around it.&lt;/p&gt;&#xA;&lt;h3&gt;Resources&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/cairdcoinheringaahing/Whispers&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github repo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;TryItOnline! : &lt;a href=&quot;https://tio.run/#whispers&quot; rel=&quot;nofollow noreferrer&quot;&gt;version 1&lt;/a&gt; and &lt;a href=&quot;https://tio.run/#whispers2&quot; rel=&quot;nofollow noreferrer&quot;&gt;version 2&lt;/a&gt;. &lt;a href=&quot;https://repl.it/@caird/Whispers-1&quot; rel=&quot;nofollow noreferrer&quot;&gt;repl.it&lt;/a&gt; for version 3 (requires a repl.it account to fork)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/cairdcoinheringaahing/Whispers/blob/v2/tutorial.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tutorial&lt;/a&gt;, up to date to v2&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/119194/whispers&quot;&gt;Chatroom&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/cairdcoinheringaahing/Whispers/wiki&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wiki&lt;/a&gt;, including the list of commands and a more in depth tutorial&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Bounty&lt;/h3&gt;&#xA;&lt;p&gt;Answers in Whispers will be eligible for a bounty of 50 rep if you have not posted an answer in Whispers before. Sorry, but if it's a question that I (caird coinheringaahing) have already answered, I'll only award the bounty to an exceptional answer, since it starts at 100 rep.&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, there is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/19267/66833&quot;&gt;this&lt;/a&gt; deadline-less bounty for proving the Turing-Completeness of the language.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="76162" LastEditDate="2021-03-01T23:34:06.920" LastActivityDate="2021-03-01T23:34:06.920" Title="Language of the Month for February 2021: Whispers" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20699" PostTypeId="2" ParentId="20698" CreationDate="2021-02-01T07:43:41.570" Score="4" Body="&lt;h1&gt;List of all Whispers solutions posted in Febrary 2021&lt;/h1&gt;&#xA;&lt;p&gt;(First time posters highlighted in bold)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/218571/80214&quot;&gt;Sum of primes between given range&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/86944/fibonacci-orial/218597#218597&quot;&gt;Fibonacci-orial&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/190670/round-towards-zero/218598#218598&quot;&gt;Round towards zero&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/195551/am-i-being-run-backwards/218601#218601&quot;&gt;Am I being run backwards?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/218498&quot;&gt;Output Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/62393&quot;&gt;Leo&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/218542&quot;&gt;1, 2, Fizz, 4, Buzz&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/62393&quot;&gt;Leo&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/218617&quot;&gt;Calculate golden ratio&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/218651&quot;&gt;Output a googol copies of a string&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/218656&quot;&gt;&amp;quot;DDoouubbllee ssppeeaakk!!&amp;quot;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/218721/80214&quot;&gt;Draw an ASCII-art rainbow&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/218741/95126&quot;&gt;“Factorise” a quadratic&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/95126/dominic-van-essen&quot;&gt;Dominic van Essen&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/204718/find-the-nth-digit-of-eulers-number/218747#218747&quot;&gt;Find the nth digit of Euler's number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/20115/shortest-method-to-implement-the-pythagorean-theorem/218748#218748&quot;&gt;Shortest method to implement the Pythagorean Theorem&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/218796/62393&quot;&gt;Draw an ASCII-art rainbow&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/62393&quot;&gt;Leo&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/218863&quot;&gt;Do you make me up?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/218877&quot;&gt;The vanilla factorial challenge&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/218973/80214&quot;&gt;Have you learned your fib-abc?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/218380/78850&quot;&gt;Output Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;Lyxal&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/219288/80214&quot;&gt;Denominator of harmonic series&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/219317/80214&quot;&gt;N-dimensional pyramid numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/219475&quot;&gt;Don't google “google”&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/219537&quot;&gt;1, 2, miss a few, 99, 100&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/219624&quot;&gt;Output Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/219754&quot;&gt;Reverse stdin and place on stdout&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/219798&quot;&gt;Your challenge is to make a script that reverses a word then replaces letters&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/219886&quot;&gt;Print a 10 by 10 grid of asterisks&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr&gt;&#xA;&lt;h1&gt;List of all Whispers tips posted in February 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/218746/80214&quot;&gt;Use Then to group values into an array&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/219842/80214&quot;&gt;Order is important&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; [&amp;lt;tip title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;List of Whispers-related challenges posted in February 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/q/&amp;lt;question-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="90812" LastEditDate="2021-02-27T06:43:30.960" LastActivityDate="2021-02-27T06:43:30.960" CommentCount="0" CommunityOwnedDate="2021-02-01T07:43:41.570" ContentLicense="CC BY-SA 4.0" />
  <row Id="20700" PostTypeId="2" ParentId="2140" CreationDate="2021-02-01T14:47:14.993" Score="1" Body="&lt;h1&gt;Compile Roman Numerals to &amp;lt;some language&amp;gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/roman-numerals&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;roman-numerals&amp;#39;&quot; rel=&quot;tag&quot;&gt;roman-numerals&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your code will, given an integer &lt;code&gt;i&lt;/code&gt;, output code &lt;code&gt;code(i)&lt;/code&gt; in any programming language that will evaluate to (print, push, return) &lt;code&gt;i&lt;/code&gt; by itself. &lt;code&gt;code(i) ++ code(i')&lt;/code&gt; should evaluate to &lt;code&gt;i + i'&lt;/code&gt; for an &lt;code&gt;i' &amp;lt;= i&lt;/code&gt; and &lt;code&gt;i' - i&lt;/code&gt; for an &lt;code&gt;i' &amp;gt; i&lt;/code&gt;. You do not have to handle cases like &lt;code&gt;code(1) ++ code(2) ++ code(3)&lt;/code&gt; where there are more than one number less than &lt;code&gt;3&lt;/code&gt; before &lt;code&gt;3&lt;/code&gt;, but you should handle &lt;code&gt;code(5) ++ code(3) ++ code(4) =&amp;gt; 6&lt;/code&gt; with more than two numbers.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Clarification&lt;/strong&gt;: the generating code takes a &lt;em&gt;number&lt;/em&gt;, not a roman numeral, but the generated code is expected to have the behaviour of a roman numeral when concatenated with other outputs.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;if  yourcode(10) -&amp;gt; 'X'&#xA;and yourcode(5)  -&amp;gt; 'V'&#xA;then eval('XV')  -&amp;gt; 15.&#xA;&#xA;if  yourcode(1)  -&amp;gt; 'I'&#xA;and yourcode(10) -&amp;gt; 'X'&#xA;and yourcode(5)  -&amp;gt; 'V'&#xA;then eval('XIV') -&amp;gt; 14&#xA;&#xA;if  yourcode(7)  -&amp;gt; 'a'&#xA;and yourcode(3)  -&amp;gt; 'b'&#xA;then eval('ab')  -&amp;gt; 10&#xA;and  eval('ba')  -&amp;gt; 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Your answer is scored by the total bytes of the &lt;em&gt;generating&lt;/em&gt; code.&lt;/p&gt;&#xA;" OwnerUserId="90614" LastEditorUserId="90614" LastEditDate="2021-02-01T16:07:00.127" LastActivityDate="2021-02-01T16:07:00.127" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="20703" PostTypeId="2" ParentId="2140" CreationDate="2021-02-02T06:09:52.247" Score="0" Body="&lt;h1&gt;Create a playable, unbeatable Tic Tac Toe game&lt;/h1&gt;&#xA;&lt;p&gt;The challenge is to write the smallest possible Tic Tac Toe game where the opponent is an unbeatable AI. The requirements are as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The opponent should be an unbeatable AI (self-playing opponent that can't lose)&lt;/li&gt;&#xA;&lt;li&gt;The game should be able to detect win/draw/loss and end if this happens (without crashing)&lt;/li&gt;&#xA;&lt;li&gt;The input should be the player move (square index or something like that)&lt;/li&gt;&#xA;&lt;li&gt;The game should be able to handle invalid input and act appropriate if this happens (ask for input again)&lt;/li&gt;&#xA;&lt;li&gt;The game must be displayed graphically on a classic 3x3 format with X:s, O:s and empty squares. The display should be in line vertically and horizontally, se below examples. The display needs to happen after at least every human move to be able to follow the progress.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;As long as these conditions are fulfilled you are free to solve it in any way you'd like.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules of Tic Tac Toe:&lt;/strong&gt; Each player (X and O) takes turn placing their marker on the 3x3 board. The game ends in a win if the player gets 3 in a row, loss if opponent gets 3 in a row, and draws if the board gets full.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Challenge winning criterion:&lt;/strong&gt; Smallest code in bytes.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example view of a valid input/output gameplay:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[' ', ' ', ' ']&#xA;[' ', ' ', ' ']&#xA;[' ', ' ', ' ']&#xA;&#xA;Your move: 3&#xA;[' ', ' ', 'X']&#xA;[' ', ' ', ' ']&#xA;[' ', ' ', ' ']&#xA;&#xA;[' ', ' ', 'X']&#xA;[' ', 'O', ' ']&#xA;[' ', ' ', ' ']&#xA;&#xA;Your move: 6&#xA;[' ', ' ', 'X']&#xA;[' ', 'O', 'X']&#xA;[' ', ' ', ' ']&#xA;&#xA;[' ', ' ', 'X']&#xA;[' ', 'O', 'X']&#xA;[' ', ' ', 'O']&#xA;&#xA;Your move: 8&#xA;[' ', ' ', 'X']&#xA;[' ', 'O', 'X']&#xA;[' ', 'X', 'O']&#xA;&#xA;['O', ' ', 'X']&#xA;[' ', 'O', 'X']&#xA;[' ', 'X', 'O']&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example of invalid gameplay (not horizontally or vertically in line and not using X and O as markers, which makes it hard to see what is going on):&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Your move: 4&#xA;[, , ]&#xA;[0, , ]&#xA;[, , ]&#xA;&#xA;[1, , ]&#xA;[0, , ]&#xA;[, , ]&#xA;&#xA;Your move: 9&#xA;[1, , ]&#xA;[0, , ]&#xA;[, , 0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Suggested tags:&lt;/strong&gt; tic-tac-toe, code-golf&lt;/p&gt;&#xA;" OwnerUserId="100407" LastEditorUserId="100407" LastEditDate="2021-02-02T08:05:00.027" LastActivityDate="2021-02-02T08:05:00.027" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="20704" PostTypeId="2" ParentId="2140" CreationDate="2021-02-02T09:16:24.907" Score="0" Body="&lt;h1&gt;Ratios to Ben Johnston's Notation&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/music&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;music&amp;#39;&quot; rel=&quot;tag&quot;&gt;music&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a just intonation ratio, express it as a note name in &lt;a href=&quot;https://www.kylegann.com/BJNotation.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ben Johnston's notation&lt;/a&gt; relative to C.&lt;/p&gt;&#xA;&lt;p&gt;You can take your input as a rational number (if your language has a rational type) or as a pair of integers. You have to handle ratios with a prime limit of 19, or in other words, ratios whose prime factorizations don't contain any primes above 19.&lt;/p&gt;&#xA;&lt;p&gt;Use the following characters for the accidentals:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+ - 81/80&#xA;# b 25/24&#xA;7 L 35/36&#xA;^ v 33/32&#xA;13 _13 65/64&#xA;17 _17 51/50&#xA;19 _19 95/96&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output them in the following order:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;7&lt;/code&gt;, &lt;code&gt;^&lt;/code&gt;, &lt;code&gt;13&lt;/code&gt;, &lt;code&gt;17&lt;/code&gt;, &lt;code&gt;19&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;#&lt;/code&gt;, &lt;code&gt;b&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;L&lt;/code&gt;, &lt;code&gt;v&lt;/code&gt;, &lt;code&gt;_13&lt;/code&gt;, &lt;code&gt;_17&lt;/code&gt;, &lt;code&gt;_19&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;+&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;code&gt;7&lt;/code&gt;, &lt;code&gt;13&lt;/code&gt;, &lt;code&gt;17&lt;/code&gt;, and &lt;code&gt;19&lt;/code&gt; should be separated by commas when they occur adjacently in order to avoid ambiguity.&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1/1 -&amp;gt; C&#xA;2/1 -&amp;gt; C&#xA;3/2 -&amp;gt; G&#xA;4/3 -&amp;gt; F&#xA;5/4 -&amp;gt; E&#xA;5/3 -&amp;gt; A&#xA;6/5 -&amp;gt; Eb&#xA;7/4 -&amp;gt; B7b&#xA;7/5 -&amp;gt; G7b&#xA;9/5 -&amp;gt; Bb&#xA;9/8 -&amp;gt; D&#xA;10/9 -&amp;gt; D-&#xA;11/8 -&amp;gt; F^&#xA;16/9 -&amp;gt; Bb+&#xA;17/16 -&amp;gt; C17#&#xA;21/16 -&amp;gt; F7+&#xA;25/24 -&amp;gt; C#&#xA;32/27 -&amp;gt; Eb-&#xA;34/19 -&amp;gt; A17_19#&#xA;78/77 -&amp;gt; C13Lv&#xA;81/64 -&amp;gt; E+&#xA;160/147 -&amp;gt; C#LL-&#xA;323/280 -&amp;gt; D17,19L-&#xA;416/405 -&amp;gt; D13bb-&#xA;441/440 -&amp;gt; Db7v+&#xA;1029/1024 -&amp;gt; Db777+&#xA;6144/6125 -&amp;gt; CbLL-&#xA;531441/524288 -&amp;gt; B#+++&#xA;4194304/4117715 -&amp;gt; A#LLLLLLL---&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="14109" LastActivityDate="2021-02-02T09:16:24.907" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20705" PostTypeId="2" ParentId="2140" CreationDate="2021-02-02T20:06:34.917" Score="0" Body="&lt;h1&gt;Find all enharmonic equivalences of an arbitrary EDO&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/music&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;music&amp;#39;&quot; rel=&quot;tag&quot;&gt;music&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given integers &lt;em&gt;n&lt;/em&gt; and &lt;em&gt;s&lt;/em&gt;, print all pairs of &lt;a href=&quot;https://en.wikipedia.org/wiki/Enharmonic&quot; rel=&quot;nofollow noreferrer&quot;&gt;enharmonically equivalent&lt;/a&gt; &lt;a href=&quot;https://en.wikipedia.org/wiki/Pitch_class&quot; rel=&quot;nofollow noreferrer&quot;&gt;pitch classes&lt;/a&gt; in &lt;em&gt;n&lt;/em&gt;-&lt;a href=&quot;https://en.wikipedia.org/wiki/Equal_temperament&quot; rel=&quot;nofollow noreferrer&quot;&gt;EDO&lt;/a&gt;, such that each note of a pair has at most &lt;em&gt;s&lt;/em&gt; sharps and flats.&lt;/p&gt;&#xA;&lt;p&gt;Note names are assigned such that F, C, G, D, A, E, and B form a chain of &lt;em&gt;n&lt;/em&gt;-EDO's best approximation to 3/2 (that is, &lt;span class=&quot;math-container&quot;&gt;\$n \log_2(3/2)\$&lt;/span&gt; steps, rounded to the nearest integer, or the &amp;quot;fifth&amp;quot;). &amp;quot;#&amp;quot; adds seven fifths, and &amp;quot;b&amp;quot; subtracts seven fifths; you can have as many of one as you want or none at all. (Note that in some EDOs, such as 24, there are some pitches that can't be written with only sharp and flat accidentals.)&lt;/p&gt;&#xA;&lt;p&gt;Note that &lt;code&gt;C# = Db&lt;/code&gt; means the same thing as &lt;code&gt;Db = C#&lt;/code&gt;. Your code should output only one of these, but which one you output is up to you.&lt;/p&gt;&#xA;&lt;p&gt;Be prepared to handle these situations:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;#&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; might not raise or lower the pitch&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;#&lt;/code&gt; might &lt;em&gt;lower&lt;/em&gt; the pitch&lt;/li&gt;&#xA;&lt;li&gt;E and F might be the same note&lt;/li&gt;&#xA;&lt;li&gt;F might be lower than E&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Your code should work for at least all integers &lt;em&gt;n&lt;/em&gt; in [1, 200] and all integers &lt;em&gt;s&lt;/em&gt; in [0, 50].&lt;/p&gt;&#xA;&lt;h2&gt;Test output&lt;/h2&gt;&#xA;&lt;p&gt;(12, 1)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;F# = Gb&#xA;Fb = E&#xA;F = E#&#xA;C# = Db&#xA;Cb = B&#xA;C = B#&#xA;G# = Ab&#xA;D# = Eb&#xA;A# = Bb&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(19, 1)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Fb = E#&#xA;Cb = B#&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(19, 2)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;F# = Gbb&#xA;F## = Gb&#xA;Fbb = E&#xA;Fb = E#&#xA;F = E##&#xA;C# = Dbb&#xA;C## = Db&#xA;Cbb = B&#xA;Cb = B#&#xA;C = B##&#xA;G# = Abb&#xA;G## = Ab&#xA;D# = Ebb&#xA;D## = Eb&#xA;A# = Bbb&#xA;A## = Bb&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(22, 2)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Fbb = C#&#xA;Fb = C##&#xA;F## = Bbb&#xA;Cbb = G#&#xA;Cb = G##&#xA;Gbb = D#&#xA;Gb = D##&#xA;Dbb = A#&#xA;Db = A##&#xA;Abb = E#&#xA;Ab = E##&#xA;Ebb = B#&#xA;Eb = B##&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(31, 3)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Fbbb = D#&#xA;Fbb = D##&#xA;Fb = D###&#xA;F## = Abbb&#xA;F### = Abb&#xA;Cbbb = A#&#xA;Cbb = A##&#xA;Cb = A###&#xA;C## = Ebbb&#xA;C### = Ebb&#xA;Gbbb = E#&#xA;Gbb = E##&#xA;Gb = E###&#xA;G## = Bbbb&#xA;G### = Bbb&#xA;Dbbb = B#&#xA;Dbb = B##&#xA;Db = B###&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(32, 3)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;F## = Dbbb&#xA;F### = Dbb&#xA;Fbbb = A#&#xA;Fbb = A##&#xA;Fb = A###&#xA;C## = Abbb&#xA;C### = Abb&#xA;Cbbb = E#&#xA;Cbb = E##&#xA;Cb = E###&#xA;G## = Ebbb&#xA;G### = Ebb&#xA;Gbbb = B#&#xA;Gbb = B##&#xA;Gb = B###&#xA;D## = Bbbb&#xA;D### = Bbb&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(53, 4)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;F#### = Dbbbb&#xA;Fbbbb = A###&#xA;Fbbb = A####&#xA;C#### = Abbbb&#xA;Cbbbb = E###&#xA;Cbbb = E####&#xA;G#### = Ebbbb&#xA;Gbbbb = B###&#xA;Gbbb = B####&#xA;D#### = Bbbbb&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(5, 0)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;F = E&#xA;C = B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(7, 1)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Fb = F&#xA;Fb = F#&#xA;F = F#&#xA;Cb = C&#xA;Cb = C#&#xA;C = C#&#xA;Gb = G&#xA;Gb = G#&#xA;G = G#&#xA;Db = D&#xA;Db = D#&#xA;D = D#&#xA;Ab = A&#xA;Ab = A#&#xA;A = A#&#xA;Eb = E&#xA;Eb = E#&#xA;E = E#&#xA;Bb = B&#xA;Bb = B#&#xA;B = B#&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(9, 1)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Fb = G&#xA;F = G#&#xA;Fb = A#&#xA;F# = Eb&#xA;Cb = D&#xA;C = D#&#xA;Cb = E#&#xA;C# = Bb&#xA;Gb = A&#xA;G = A#&#xA;Gb = B#&#xA;Db = E&#xA;D = E#&#xA;Ab = B&#xA;A = B#&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(11, 1)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;F# = Db&#xA;Fb = A&#xA;F = A#&#xA;C# = Ab&#xA;Cb = E&#xA;C = E#&#xA;G# = Eb&#xA;Gb = B&#xA;G = B#&#xA;D# = Bb&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(13, 1)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;F# = Cb&#xA;Fb = B&#xA;F = B#&#xA;C# = Gb&#xA;G# = Db&#xA;D# = Ab&#xA;A# = Eb&#xA;E# = Bb&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="14109" LastEditorUserId="14109" LastEditDate="2021-02-03T02:59:01.920" LastActivityDate="2021-02-03T02:59:01.920" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20707" PostTypeId="2" ParentId="2140" CreationDate="2021-02-03T13:37:39.037" Score="5" Body="&lt;p&gt;&lt;em&gt;I decide to change the statement a little, so people who don't know the language can easily understand the challenge. (apparently there are many)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;em&gt;Background&lt;/em&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'm thinking about scraping some BF programs on this site for the fastest-code (or approximation) version of the other challenge, and I figure out that I need to have this, and I post it here as a code-golf challenge since it's somewhat interesting (and also pretty easy).&lt;/li&gt;&#xA;&lt;li&gt;It's possible to force programs to check if there are any extra characters too; however it might make the problem harder (only allow printable ASCII? Some scraped data might have non-ASCII characters, so it isn't really practical. Any Unicode characters as input? Most esoteric languages can't handle that.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Does this BF program have a simple memory layout?&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brainfuck&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brainfuck&amp;#39;&quot; rel=&quot;tag&quot;&gt;brainfuck&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a string consisting of only the characters &lt;code&gt;+-[]&amp;lt;&amp;gt;.,&lt;/code&gt; check if:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All pairs of &lt;code&gt;[]&lt;/code&gt; are matching (balanced), and&lt;/li&gt;&#xA;&lt;li&gt;There's an equal number of &lt;code&gt;&amp;lt;&lt;/code&gt; and &lt;code&gt;&amp;gt;&lt;/code&gt; between every matching pair of &lt;code&gt;[]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;em&gt;Background: the inputs that this program output true are exactly the valid inputs for the related challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/218690/bf-memory-layout-optimizer&quot;&gt;BF memory layout optimizer&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##ZZBBDoMgFETXegrKSmJsNN0ZYNlLEBZUsZpSIECb9PRWBdM2Xc68l8nPt68wGn2a514O4CnU1BfWmasT9xb44FBFL8aoNs98EN2NsJrn2WAc6EYwabCreZZNw9IRAhlcU9SPwlqp@6JGSyXVrvCoLDFa1tgCHUjdAifDw2lwFsrLpGgTovZHP4MUttFhVcNL0vxA/A2rFaYdJXWxAUSWNhfeSxfSDyDGlDJaVoxiXmIO0c7Xe5LDtn6e3w&quot; rel=&quot;nofollow noreferrer&quot;&gt;Reference implementation in Python 3&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Example input/output&lt;/h3&gt;&#xA;&lt;p&gt;Output true:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;,&amp;gt;&amp;gt;,&#xA;,&amp;lt;++[-&amp;gt;&amp;gt;+&amp;lt;&amp;lt;]&#xA;+&amp;lt;&amp;gt;&amp;lt;&amp;gt;+&#xA;,[.,]&#xA;&amp;gt;.&amp;lt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output false:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;,[&amp;gt;,]&#xA;+[&amp;gt;&amp;gt;&amp;gt;-&amp;gt;-[&amp;gt;-&amp;gt;----&amp;lt;&amp;lt;&amp;lt;]&amp;gt;&amp;gt;]&amp;gt;.---.&amp;gt;+..+++.&amp;gt;&amp;gt;.&amp;lt;.&amp;gt;&amp;gt;---.&amp;lt;&amp;lt;&amp;lt;.+++.------.&amp;lt;-.&amp;gt;&amp;gt;+.&#xA;].[&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Undefined behavior: (your program can do anything when given those as input)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;((((()()()()()){}){}){}())&#xA;$\=&amp;quot;=&amp;quot;.hex.$/&#xA;\!$/'?))='%&amp;lt;\..&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="69850" LastEditorUserId="69850" LastEditDate="2021-02-11T07:02:03.100" LastActivityDate="2021-02-11T07:02:03.100" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20708" PostTypeId="2" ParentId="2140" CreationDate="2021-02-03T13:51:20.267" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/218572/implement-bottom-encode&quot;&gt;Implement bottom (encode)&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100657" LastEditorUserId="69850" LastEditDate="2021-02-04T14:19:20.637" LastActivityDate="2021-02-04T14:19:20.637" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="20709" PostTypeId="2" ParentId="2140" CreationDate="2021-02-03T15:40:10.600" Score="1" Body="&lt;p&gt;(this is the core of the BF memory optimizer challenge.)&lt;/p&gt;&#xA;&lt;p&gt;(At the moment I still need to make some test cases; however you can still review the rest of the challenge.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;note&lt;/strong&gt;: This problem is reducible from Simple Max Cut, therefore it's NP-complete. (&lt;a href=&quot;https://doi.org/10.1016/0304-3975(76)90059-1&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://doi.org/10.1016/0304-3975(76)90059-1&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;note&lt;/strong&gt;: While I did get a bunch of test cases from this site, I'm not sure how can I write a reasonable algorithm to compete with...&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Proof&lt;/h3&gt;&#xA;&lt;p&gt;(actually this is not part of the sandbox challenge, but I'll post it here because it's related)&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;First, for convenience, assume that the problem is represented by a undirected graph, where the number of rows/columns of the matrix is equal to the number of nodes, and the corresponding weight is the sum of the value of the edges connecting the corresponding two nodes.&lt;/p&gt;&#xA;&lt;p&gt;With that representation, the value to be minimized is the sum of the product of the edge lengths and the edge weights, with the graph nodes embedded into the point &lt;span class=&quot;math-container&quot;&gt;\$ 1, 2,\ldots, |V| \$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;From a Simple Max Cut problem of the form:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Given &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; variables &lt;span class=&quot;math-container&quot;&gt;\$ x_1, x_2,\ldots, x_n \$&lt;/span&gt;, maximize the value of &lt;span class=&quot;math-container&quot;&gt;\$ \sum_{i=1}^m [a_i \ne b_i] \$&lt;/span&gt;, where each of &lt;span class=&quot;math-container&quot;&gt;\$ a_i, b_i \$&lt;/span&gt; represents either a variable or its negation.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;It can be transformed to an instance of this problem:&lt;/p&gt;&#xA;&lt;p&gt;First, construct &lt;span class=&quot;math-container&quot;&gt;\$ 2n \$&lt;/span&gt; nodes on a graph, denoted &lt;span class=&quot;math-container&quot;&gt;\$ p_1, p_2,\ldots, p_n, q_1, q_2,\ldots, q_n \$&lt;/span&gt;. Let &lt;span class=&quot;math-container&quot;&gt;\$ a \$&lt;/span&gt; be some positive integer.&#xA;Connect those vertices:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ p_1 \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$ q_1 \$&lt;/span&gt;, with cost &lt;span class=&quot;math-container&quot;&gt;\$ 2n^2 a \$&lt;/span&gt;,&lt;/li&gt;&#xA;&lt;li&gt;the 4 pairs of vertices &lt;span class=&quot;math-container&quot;&gt;\$(p_1, p_i),(p_1, q_i),(q_1, p_i),(q_1, q_i)\$&lt;/span&gt; with cost &lt;span class=&quot;math-container&quot;&gt;\$ (n+1-i) a \$&lt;/span&gt;, for each &lt;span class=&quot;math-container&quot;&gt;\$ i=2, 3,\ldots, n \$&lt;/span&gt;,&lt;/li&gt;&#xA;&lt;li&gt;and some other edges with small weights (the sum of their weights should be less than &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; -- (1)) that mainly does not affect the optimal configuration.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The sum of the edge weights (except the first one) is &lt;span class=&quot;math-container&quot;&gt;\$ 4 ((n-1)+(n-2)+\ldots+1)a=2n(n-1)a \$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The edge between &lt;span class=&quot;math-container&quot;&gt;\$ p_1 \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$ q_1 \$&lt;/span&gt; has a weight larger than the sum of all the others, it's obvious to see that in the optimal (minimum cost) configuration, these two must be adjacent.&lt;/p&gt;&#xA;&lt;p&gt;Then, regardless where those 2 vertices are placed, the &lt;span class=&quot;math-container&quot;&gt;\$ i \$&lt;/span&gt;'th smallest distance-pair to those are at least the &lt;span class=&quot;math-container&quot;&gt;\$ i \$&lt;/span&gt;'th value in the sequence are&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$(1, 2),(1, 2),(2, 3),(2, 3),(3, 4),(3, 4),\ldots,(n-1, n),(n-1, n)$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;.&lt;/p&gt;&#xA;&lt;p&gt;And by the rearrangement inequality, it's optimal to place the weight so that the vertices with the smaller edge-weight to &lt;span class=&quot;math-container&quot;&gt;\$ p_1, q_1 \$&lt;/span&gt; are placed further from the vertices. Therefore the only optimal placement is&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$z_n, z_{n-1}, \ldots, z_2, z_1, z_1, z_2, \ldots, z_{n-1}, z_n$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;where each &lt;span class=&quot;math-container&quot;&gt;\$ z_i \$&lt;/span&gt; is either &lt;span class=&quot;math-container&quot;&gt;\$ p_i \$&lt;/span&gt; or &lt;span class=&quot;math-container&quot;&gt;\$ q_i \$&lt;/span&gt; (&lt;span class=&quot;math-container&quot;&gt;\$1 \le i \le n\$&lt;/span&gt;).&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Encode the condition &amp;quot;vertex &lt;span class=&quot;math-container&quot;&gt;\$ i \$&lt;/span&gt; is on the left side of the cut&amp;quot; by &amp;quot;&lt;span class=&quot;math-container&quot;&gt;\$ p_i \$&lt;/span&gt; is to the left of &lt;span class=&quot;math-container&quot;&gt;\$ q_i \$&lt;/span&gt; in the permutation&amp;quot;. (2)&lt;/p&gt;&#xA;&lt;p&gt;Assuming that the edge weights are allowed to be fractional.&lt;/p&gt;&#xA;&lt;p&gt;For each condition (in the Simple Max Cut problem) that &amp;quot;there's an edge between vertices &lt;span class=&quot;math-container&quot;&gt;\$u\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$v\$&lt;/span&gt; (&lt;span class=&quot;math-container&quot;&gt;\$ u\le v \$&lt;/span&gt;)&amp;quot;, add an edge between &lt;span class=&quot;math-container&quot;&gt;\$ p_u \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$ q_v \$&lt;/span&gt; with weight &lt;span class=&quot;math-container&quot;&gt;\$\frac 1 {2u-1}\$&lt;/span&gt; to this problem.&lt;/p&gt;&#xA;&lt;p&gt;The weight of this edge can either be &lt;span class=&quot;math-container&quot;&gt;\$ u-v \$&lt;/span&gt; or &lt;span class=&quot;math-container&quot;&gt;\$ u-v+(2u-1)\$&lt;/span&gt; in the configuration that minimizes the total weight of the edges constructed in the previous section.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, if the vertices &lt;span class=&quot;math-container&quot;&gt;\$ u \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$ v \$&lt;/span&gt; are on different sides of the cut (according to the encoding (2)), the total weight is decreased by &lt;span class=&quot;math-container&quot;&gt;\$ 1 \$&lt;/span&gt; if &lt;span class=&quot;math-container&quot;&gt;\$ u \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$ v \$&lt;/span&gt; are on different sides; and the configuration with the minimum weight is exactly the one with maximum number of edges cut.&lt;/p&gt;&#xA;&lt;p&gt;However, in the actual problem edge weights must be an integer. We replace each edge weight &lt;span class=&quot;math-container&quot;&gt;\$\frac 1 {2u-1} \$&lt;/span&gt; by &lt;span class=&quot;math-container&quot;&gt;\$\lceil\frac c {2u-1}\rceil \$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$ c=2nm\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Because there are &lt;span class=&quot;math-container&quot;&gt;\$ m \$&lt;/span&gt; edges in total, if the sum of any &lt;span class=&quot;math-container&quot;&gt;\$ k-1 \$&lt;/span&gt; increment values &lt;span class=&quot;math-container&quot;&gt;\$\lceil\frac c {2u-1}\rceil (2u-1) \$&lt;/span&gt; is strictly less than the sum of any &lt;span class=&quot;math-container&quot;&gt;\$ k \$&lt;/span&gt; increment values, for &lt;span class=&quot;math-container&quot;&gt;\$1\le k\le m \$&lt;/span&gt;, then the optimal sum is also the maximum cut.&lt;/p&gt;&#xA;&lt;p&gt;Observe that because &lt;span class=&quot;math-container&quot;&gt;\$ c=2nm \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$ x\le 2n-1 \$&lt;/span&gt;, each increment value must be between &lt;span class=&quot;math-container&quot;&gt;\$ 2nm \$&lt;/span&gt; (inclusive) and &lt;span class=&quot;math-container&quot;&gt;\$ 2nm+2n-1 \$&lt;/span&gt; (exclusive). Therefore the maximum sum of &lt;span class=&quot;math-container&quot;&gt;\$ k-1 \$&lt;/span&gt; values is &lt;span class=&quot;math-container&quot;&gt;\$ (2nm+2n-2)(k-1) \$&lt;/span&gt;, which is less than the minimum sum of &lt;span class=&quot;math-container&quot;&gt;\$ k \$&lt;/span&gt; values &lt;span class=&quot;math-container&quot;&gt;\$ 2nmk \$&lt;/span&gt; when &lt;span class=&quot;math-container&quot;&gt;\$ 1\le k\le m \$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The sum of all those does not exceed &lt;span class=&quot;math-container&quot;&gt;\$ \lceil \frac {2nm}{1} \rceil m \$&lt;/span&gt;. Therefore if &lt;span class=&quot;math-container&quot;&gt;\$ a \$&lt;/span&gt; is chosen to be &lt;span class=&quot;math-container&quot;&gt;\$ 2nm^2+1 \$&lt;/span&gt;, then the condition (1) is satisfied.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Minimum cost matrix permutation&lt;/h3&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; (or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimized-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimized-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimized-output&lt;/a&gt;? Obviously the latter would be more useful in &lt;s&gt;practice&lt;/s&gt; code golf)&lt;/p&gt;&#xA;&lt;p&gt;Given a matrix &lt;span class=&quot;math-container&quot;&gt;\$w\$&lt;/span&gt; in &lt;span class=&quot;math-container&quot;&gt;\${\mathbb N_0}^{n\times n}\$&lt;/span&gt;, define the symmetric matrix &lt;span class=&quot;math-container&quot;&gt;\$d\$&lt;/span&gt; in &lt;span class=&quot;math-container&quot;&gt;\${\mathbb N_0}^{n\times n}\$&lt;/span&gt; by the formula &lt;span class=&quot;math-container&quot;&gt;\$d_{i,j}=\left| i-j \right|\$&lt;/span&gt;, find a permutation matrix &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; such that the sum of elements in the matrix &lt;span class=&quot;math-container&quot;&gt;\$(P^{\mathsf T} \cdot w \cdot P ) \,\odot\,d\$&lt;/span&gt; (where &lt;span class=&quot;math-container&quot;&gt;\$\odot\$&lt;/span&gt; denotes the &lt;a href=&quot;https://en.wikipedia.org/wiki/Hadamard_product_(matrices)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hadamard product&lt;/a&gt;/element-wise product) is smallest.&lt;/p&gt;&#xA;&lt;p&gt;The result will be the mean (TODO: median? mean of the 50% maximum? mean result/naive ratio?) of the score over these test cases, for as long as you can run your program.&lt;/p&gt;&#xA;" OwnerUserId="69850" LastEditorUserId="69850" LastEditDate="2021-02-11T14:26:19.303" LastActivityDate="2021-02-11T14:26:19.303" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20710" PostTypeId="1" AcceptedAnswerId="20712" CreationDate="2021-02-04T00:44:21.317" Score="1" ViewCount="136" Body="&lt;p&gt;Yes, I've checked &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12339/how-are-bytes-counted-in-assembly/&quot;&gt;this post (How are bytes counted in assembly)&lt;/a&gt;, but I'm asking a different question. I'm asking, if I have an &lt;code&gt;.asm&lt;/code&gt; file, an &lt;code&gt;.obj&lt;/code&gt; file and an &lt;code&gt;.exe&lt;/code&gt; file, which one should I submit? Which &lt;strong&gt;part&lt;/strong&gt; in the code should I submit? Especially for &lt;code&gt;.obj&lt;/code&gt; files and &lt;code&gt;.exe&lt;/code&gt; files -- I have no idea which part of code is the real assembled code, while others are only boilerplates.&lt;/p&gt;&#xA;" OwnerUserId="100635" LastEditorUserId="66833" LastEditDate="2021-02-04T06:47:44.260" LastActivityDate="2021-02-04T14:05:46.253" Title="What to count in assembly?" Tags="|discussion|code-golf|answers|scoring|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20712" PostTypeId="2" ParentId="20710" CreationDate="2021-02-04T14:05:46.253" Score="1" Body="&lt;h2&gt;It's up to you!&lt;/h2&gt;&#xA;&lt;p&gt;Some of my assembly answers are provided as instruction listings, because the assembly IR / target code is larger than the mnemonic size.&lt;/p&gt;&#xA;&lt;p&gt;For x86, it's usually the best idea to provide the assembled machine code as a flat binary, state where the entry point is, and describe the calling convention. If you need to access the system interface, &lt;strong&gt;you're locked out of libc&lt;/strong&gt;, so you'll have to use either linux syscalls, or whatever your operating system supports.&lt;/p&gt;&#xA;&lt;p&gt;You can also post DOS .com submissions - MS-DOS provides you some system API's (and some users on codegolf made a lot of MS-DOS specific answers!), but also it provides you the flexibility and code golf potential with unrestricted hardware and memory access.&lt;/p&gt;&#xA;" OwnerUserId="61379" LastActivityDate="2021-02-04T14:05:46.253" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20714" PostTypeId="2" ParentId="2140" CreationDate="2021-02-04T17:14:04.603" Score="0" Body="&lt;h1&gt;Is the Skat null game safe? [WIP] &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/skat&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;skat&amp;#39;&quot; rel=&quot;tag&quot;&gt;skat&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;For everyone who knows the card game Skat. Did you ever wondered when playing a null game: is this really safe to win regardless the other player cards? Well, let's try to solve this question with code.&lt;/p&gt;&#xA;&lt;h2&gt;The Skat game&lt;/h2&gt;&#xA;&lt;p&gt;Skat is card game with 32 cards. There are four colours: Diamonds ♦️, Hearts ♥️, Spades ♠️ and Clubs ♣️. Each colour has: Ace, King, Queen, Jack, 10, 9, 8 and 7. Three players are playing, so each one get 10 cards. The remaining two cards are called Skat and remain covered. Before each game it is to decide which of the three players plays alone against the other two which play together. The alone player gets the possibility to exchange one or two of his cards against one or two of the covered cards in the Skat. More about Skat can be read on &lt;a href=&quot;https://en.wikipedia.org/wiki/Skat_(card_game)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;The null game&lt;/h2&gt;&#xA;&lt;p&gt;There are times when get so bad cards, i.e. no Aces and no Jacks, that they will indeed really good, namely when you can't make any points, not even a trick with the cards.&lt;/p&gt;&#xA;&lt;h2&gt;The task&lt;/h2&gt;&#xA;&lt;p&gt;Write a program that will determine if an input of ten cards of the 32 cards will guarantee that the player will win the null game, i.e. the player won't get any tricks regardless how the other 22 cards are distributed for the other two players and whether or not the alone player is in forehand. You can assume any reasonable input and output that suits you. For convenience a reasonably sorting of the cards can also be assumed.&lt;/p&gt;&#xA;&lt;p&gt;One note to the forehand rule: it is assumed that the alone player wants to win so he or she won't sabotage the game with drawing an Ace or similar high cards.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;Let's assume an array of two character strings where the first represents the colour (D for Diamond, etc.) and the second the value (7, 8, 9, X, J, Q, K, A) E.g &lt;code&gt;['D7','D8','D9','H7','H8','C7','C8','CX','CQ','CA']&lt;/code&gt; will result in &lt;code&gt;true&lt;/code&gt; indicating that this null game cannot be lost.&lt;/p&gt;&#xA;&lt;p&gt;[more to come]&lt;/p&gt;&#xA;&lt;p&gt;This is code-golf so the shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="97562" LastActivityDate="2021-02-04T17:14:04.603" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20715" PostTypeId="2" ParentId="20675" CreationDate="2021-02-05T01:27:46.847" Score="2" Body="&lt;p&gt;If you only need the word and its corresponding IPA, then you can use &lt;a href=&quot;https://github.com/open-dict-data/ipa-dict&quot; rel=&quot;nofollow noreferrer&quot;&gt;open-dict-data/ipa-dict&lt;/a&gt;. It has files for both American English (en_US) and British English (en_UK) in a number of formats.&lt;/p&gt;&#xA;" OwnerUserId="66025" LastActivityDate="2021-02-05T01:27:46.847" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20717" PostTypeId="2" ParentId="2140" CreationDate="2021-02-05T16:30:45.383" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/218755/96279&quot;&gt;Colorize a diff, unified format&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96279" LastEditorUserId="96279" LastEditDate="2021-02-08T08:22:47.000" LastActivityDate="2021-02-08T08:22:47.000" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="20718" PostTypeId="2" ParentId="2140" CreationDate="2021-02-06T13:17:57.477" Score="-1" Body="&lt;h1&gt;Hello World! - Generation 3392&lt;/h1&gt;&#xA;&lt;p&gt;Your job is to create a genetic algorithm that slowly evolves and mutates its string until the output is equivalent to &amp;quot;Hello World!&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;The genetic algorithm should start with a random string generated, and continue for generations, making random mutations to its code, like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Gen 3393 - Hemmo World!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;To:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Gen 3394 - Hemko World!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Heres how the randomization algorithm works:&lt;/h1&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Create a function named randint(n), import the time module.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;pre&gt;&lt;code&gt;# Written in Python 3.8&#xA;import time # imports time&#xA;def randint(n): # create function&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;Get the current time since Jan 1. 1970, multiply by n and assign it as var &amp;quot;t&amp;quot;. Make t an integer not a float.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;pre&gt;&lt;code&gt;t=int(time.time()*n) # Set time, and multiply by n.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ol start=&quot;3&quot;&gt;&#xA;&lt;li&gt;Use the &amp;quot;%&amp;quot; operation on var &amp;quot;t&amp;quot; (var t is the first argument), with var n as the second argument, assign it as &amp;quot;rand&amp;quot;.&#xA;Code in python should look like this:&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;pre&gt;&lt;code&gt;rand=t%n #setup a psuedorandom number, since you already have a counter, use n as the limit number, and reset the counter once the counter reaches the limit number. This generates a psuedorandom number within n.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ol start=&quot;4&quot;&gt;&#xA;&lt;li&gt;Return rand.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;pre&gt;&lt;code&gt;return int(rand) #return results as integer.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Your program should have:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A randomized start string (using the rand_int algorithm)&lt;/li&gt;&#xA;&lt;li&gt;A point it reaches &amp;quot;Hello World!&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;Mutation, using &amp;quot;parents&amp;quot;. You are not allowed to completely change a string, only modify 1 character each generation.&lt;/li&gt;&#xA;&lt;li&gt;Mutations are not allowed to be repeated twice/No mutation backtracking.&lt;/li&gt;&#xA;&lt;li&gt;Once a genetic algorithm has a correct letter in its correct position (such as &amp;quot;e&amp;quot; in &amp;quot;reJ&amp;quot; and &amp;quot;Hes&amp;quot;). It is forced to stay as that letter in that position and the genetic algorithm is forced with that string forever, this repeats for all other positions. This way the time increases additionally instead of exponentially.&#xA;So you cannot do this: [&amp;quot;Hlllr&amp;quot; -&amp;gt; &amp;quot;Hellr&amp;quot; -&amp;gt; &amp;quot;Hfllr&amp;quot;]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;So I can do this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Herlo Wcrld&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;Herlo Wrrld&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;But you cannot change &amp;gt;1 character/byte at a time:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Herto Wcrld&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;Heflo World&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You can do whatever else you want with it if it satisfies those requirements.&lt;/p&gt;&#xA;&lt;h1&gt;Scoring:&lt;/h1&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the answer with the least amount of bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="100793" LastEditorUserId="100793" LastEditDate="2021-02-06T19:24:36.973" LastActivityDate="2021-02-06T19:24:36.973" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="20720" PostTypeId="2" ParentId="19041" CreationDate="2021-02-08T12:39:56.497" Score="1" Body="&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\require{begingroup}\begingroup&#xA;\newcommand{xx}{\color{red}{\textsf{x}}}&#xA;\newcommand{oo}{\color{green}{\textsf{o}}}&#xA;\newcommand{slash}[2]{&#xA;#1\overset{\LARGE\backslash}{\phantom{.}}\overset{\Large #2}{\phantom{l}}&#xA;}&#xA;\$&lt;/span&gt;&#xA;(this is not really an answer, rather it's a way to show what else can be done &lt;strong&gt;if&lt;/strong&gt; the consensus is that it is not allowed), given the current situation that people don't like for some reasons &lt;sup&gt;(*)&lt;/sup&gt;; personally I think that even if some people don't like it, it causes no harm (unlike what would happen if challenges without winning criteria are posted) and doesn't have any reason to be prohibited)&lt;/p&gt;&#xA;&lt;p&gt;Assume that in the original challenge, there are two positive-integer scores A and B, which should be minimized, and in a reasonable program, they both does not exceed some easy-to-calculate threshold -- in the example above, 5 is used.&lt;/p&gt;&#xA;&lt;h3&gt;Solution 1&lt;/h3&gt;&#xA;&lt;p&gt;Parametrize the solution space. For example, programs have to minimize A+2B.&lt;/p&gt;&#xA;&lt;p&gt;This is not very interesting, because there can be interesting solutions that trades A for very good B, or vice versa.&lt;/p&gt;&#xA;&lt;h3&gt;Solution 2&lt;/h3&gt;&#xA;&lt;p&gt;Assume that if a solution with a score (A, B) is possible, then (A+1, B) and (A, B+1) are both possible. (i.e., smaller scores are strictly better)&lt;/p&gt;&#xA;&lt;p&gt;Assume that someone have a solution with score (4, 2). So the solution can be represented with this table&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$\begin{array}{c|ccc}&#xA;\slash{A}{B} &amp;amp; 1 &amp;amp; 2 &amp;amp; 3 &amp;amp; 4 &amp;amp; 5 \\&#xA;\hline&#xA;1 &amp;amp; \xx &amp;amp; \xx &amp;amp; \xx &amp;amp; \xx &amp;amp; \xx \\&#xA;2 &amp;amp; \xx &amp;amp; \xx &amp;amp; \xx &amp;amp; \xx &amp;amp; \xx \\&#xA;3 &amp;amp; \xx &amp;amp; \xx &amp;amp; \xx &amp;amp; \xx &amp;amp; \xx \\&#xA;4 &amp;amp; \xx &amp;amp; \oo &amp;amp; \oo &amp;amp; \oo &amp;amp; \oo \\&#xA;5 &amp;amp; \xx &amp;amp; \oo &amp;amp; \oo &amp;amp; \oo &amp;amp; \oo \\&#xA;\end{array}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Where &lt;span class=&quot;math-container&quot;&gt;\$\xx\$&lt;/span&gt; denotes impossible scores, &lt;span class=&quot;math-container&quot;&gt;\$\oo\$&lt;/span&gt; denotes possible scores.&lt;/p&gt;&#xA;&lt;p&gt;Obviously, better solutions have less &lt;span class=&quot;math-container&quot;&gt;\$\xx\$&lt;/span&gt;. So let the score of a submission to be the number of &lt;span class=&quot;math-container&quot;&gt;\$\xx\$&lt;/span&gt; in the table, assume that both coordinates are constructed from 1 to 5. The score of this solution would be 17.&lt;/p&gt;&#xA;&lt;p&gt;Now assume that someone else have another solution with score (2, 3). The table would be:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$\begin{array}{c|ccc}&#xA;\slash{A}{B} &amp;amp; 1 &amp;amp; 2 &amp;amp; 3 &amp;amp; 4 &amp;amp; 5 \\&#xA;\hline&#xA;1 &amp;amp; \xx &amp;amp; \xx &amp;amp; \xx &amp;amp; \xx &amp;amp; \xx \\&#xA;2 &amp;amp; \xx &amp;amp; \xx &amp;amp; \oo &amp;amp; \oo &amp;amp; \oo \\&#xA;3 &amp;amp; \xx &amp;amp; \xx &amp;amp; \oo &amp;amp; \oo &amp;amp; \oo \\&#xA;4 &amp;amp; \xx &amp;amp; \xx &amp;amp; \oo &amp;amp; \oo &amp;amp; \oo \\&#xA;5 &amp;amp; \xx &amp;amp; \xx &amp;amp; \oo &amp;amp; \oo &amp;amp; \oo \\&#xA;\end{array}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;and the final score would be 13.&lt;/p&gt;&#xA;&lt;p&gt;Observe that both answers can be combined:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$\begin{array}{c|ccc}&#xA;\slash{A}{B} &amp;amp; 1 &amp;amp; 2 &amp;amp; 3 &amp;amp; 4 &amp;amp; 5 \\&#xA;\hline&#xA;1 &amp;amp; \xx &amp;amp; \xx &amp;amp; \xx &amp;amp; \xx &amp;amp; \xx \\&#xA;2 &amp;amp; \xx &amp;amp; \xx &amp;amp; \oo &amp;amp; \oo &amp;amp; \oo \\&#xA;3 &amp;amp; \xx &amp;amp; \xx &amp;amp; \oo &amp;amp; \oo &amp;amp; \oo \\&#xA;4 &amp;amp; \xx &amp;amp; \oo &amp;amp; \oo &amp;amp; \oo &amp;amp; \oo \\&#xA;5 &amp;amp; \xx &amp;amp; \oo &amp;amp; \oo &amp;amp; \oo &amp;amp; \oo \\&#xA;\end{array}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;and it results in a better score, 11.&lt;/p&gt;&#xA;&lt;p&gt;This is a simple relatively-efficient implementation of the score calculation algorithm: &lt;a href=&quot;https://tio.run/##hVFNb8IwDD2TX@FxSiFUFMalIvyIXbscUjXQaG1aJUXAr2d2ype0aTvFsZ/fe7b7y1B3bn292rbv/ADeCAiXIMAOxg9d1wTWWGeCLGaYTsNQWadYLeAkW91z6waBPeneuko3DffTz2o@FRB7iqVKEtZ7BHHquMf4dvgip2L7zkcwWHdrynKVs4kWUP6rgOyTkZLg@NEhoGvQuyVoV0G5WyIgaqW6742reEFIdXeQBpyZf5mLbHRbVhrOOZzJdvRlyZTX7mB4hoLG8bErSXIYo8KqIlOytffSmBCP8iKj/3Ng0hJAeNxviyWIQhiT1sF3xz5JYi4CY4Iqj2ukMVVebnoCfjEPdk/prazVUzhuKDJTRJxjicDlVp4UY96EYzPIenb6e/x5luCFRvRC8pfRl4ro7Jt8QYNpgoEamxavW0GfM36aZ4sfq4oHnX5E@nxKx6couV43sGHvsGIrWH8D&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 3 – Try It Online&quot;&gt;Try it online!&lt;/a&gt; (input format: first line: dimension of the board, remaining lines: the reachable points, any format is accepted)&lt;/p&gt;&#xA;&lt;p&gt;Of course, with this, the score of the answers posted later will always be strictly better than the score of the older answers. Nevertheless, it still encourages creativity (to find good answers), the same thing as what winning criteria does.&lt;/p&gt;&#xA;&lt;p&gt;Besides, we already have &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;(*)&lt;/sup&gt;: nobody who downvoted left any comment.&#xA;&lt;span class=&quot;math-container&quot;&gt;\$\endgroup\$&lt;/span&gt;&lt;/p&gt;&#xA;" OwnerUserId="69850" LastEditorUserId="69850" LastEditDate="2021-02-12T07:56:33.060" LastActivityDate="2021-02-12T07:56:33.060" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20721" PostTypeId="2" ParentId="2140" CreationDate="2021-02-08T14:15:10.207" Score="-1" Body="&lt;h1&gt;Return all elements around an index forming sun&lt;/h1&gt;&#xA;&lt;p&gt;Define a function that takes in a 2D array and a 2D index, and return all the elements of the 2D array that are directly vertical to, horizontal to, and diagonal to the given index, and the returned list must omit the index itself.&lt;/p&gt;&#xA;&lt;p&gt;External modules, like numpy, as allowed. The most efficient program wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/qx33a.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/qx33a.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="98995" LastEditorUserId="98995" LastEditDate="2021-02-08T15:34:35.300" LastActivityDate="2021-02-08T15:34:35.300" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="20722" PostTypeId="1" CreationDate="2021-02-08T15:57:32.707" Score="27" ViewCount="3142" Body="&lt;p&gt;&lt;strong&gt;What are the stories behind your username and avatar?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Some users' usernames and/or their avatars have a significance behind them. What about yours?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2024-04-05T03:21:50.250" Title="The many users of CGCC" Tags="|discussion|users|" AnswerCount="46" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20723" PostTypeId="2" ParentId="20722" CreationDate="2021-02-08T15:57:32.707" Score="33" Body="&lt;p&gt;&amp;quot;caird coinheringaahing&amp;quot; comes from &lt;a href=&quot;https://codegolf.stackexchange.com/a/118068/66833&quot;&gt;this&lt;/a&gt; Jelly answer. Given that the answer is written in Jelly (my primary language on the site), and the challenge is very much about the site, I thought that it'd be a fun, unique username that references the site.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=56777627#56777627&quot;&gt;And it should be pronounced &amp;quot;cared co-in-hear-ing-aah-ing&amp;quot;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Fun fact, moving the space around in that answer leads to the following possible usernames:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ChartZ Belatedly&#xA;oppS,aback&#xA;reerects bespangling aachen&#xA;Erasmians cleptaahing&#xA;caird coinheringaahing&#xA;Dude coinheringaahing&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;I have changed my username (briefly) to both &lt;code&gt;ChartZ Belatedly&lt;/code&gt; (during March 2021) and &lt;code&gt;Dude coinheringaahing&lt;/code&gt; (August 2021), and I'm &lt;code&gt;reerects bespangling aachen&lt;/code&gt; on the &lt;a href=&quot;https://discord.gg/J2F8KTHBb4&quot; rel=&quot;nofollow noreferrer&quot;&gt;CGCC Gaming&lt;/a&gt; Discord server.&lt;/p&gt;&#xA;&lt;p&gt;During June, July and August 2022, my username was &amp;quot;Zion mycelia adamancy&amp;quot;, as requested by emanresu A due to &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=61443106#61443106&quot;&gt;this&lt;/a&gt; message in TNB:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;6 hours ago, by Radvylf Programs&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Well my Jelly encoder doesn't quite work yet, unless caird changed their name to ​Zion mycelia adamancy! and none of us noticed&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;As for my avatar, it is a picture of my adorable puppy, Patch. Over December/January, I put a Santa hat on him. During October, it is a picture of my other adorable puppy, Pepper, with a witch hat for Halloween, &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/62134487#62134487&quot;&gt;courtesy of Radvylf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2022-11-05T04:14:08.927" LastActivityDate="2022-11-05T04:14:08.927" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="20724" PostTypeId="2" ParentId="20722" CreationDate="2021-02-08T17:27:10.440" Score="25" Body="&lt;p&gt;There's no story here. I'm just not creative.&lt;/p&gt;&#xA;" OwnerUserId="95792" LastEditorUserId="95792" LastEditDate="2021-04-13T19:57:05.297" LastActivityDate="2021-04-13T19:57:05.297" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20725" PostTypeId="2" ParentId="2140" CreationDate="2021-02-08T19:27:29.963" Score="-3" Body="&lt;h1&gt;Reinvent math&lt;/h1&gt;&#xA;&lt;p&gt;The task is simple. Define the basic operators (+, -, *, /) without using them directly.&lt;/p&gt;&#xA;&lt;p&gt;Also banned:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;any add-assign (&lt;code&gt;+=&lt;/code&gt;) and its equivalents&lt;/li&gt;&#xA;&lt;li&gt;basically anything &lt;em&gt;intended&lt;/em&gt; to be used as a basic arithmetic operation&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Program should consist of at least 4 binary functions, one for each operation. they may call other functions defined in your program, including each other. The types of the arguments to the function may be any types that the basic arithmetic operators work on, except for types that are less than 3 bits in size.&lt;/p&gt;&#xA;&lt;p&gt;Shortest code wins&lt;/p&gt;&#xA;" OwnerUserId="98974" LastEditorUserId="98974" LastEditDate="2021-02-08T20:31:59.003" LastActivityDate="2021-02-08T20:31:59.003" CommentCount="17" ContentLicense="CC BY-SA 4.0" />
  <row Id="20726" PostTypeId="2" ParentId="20722" CreationDate="2021-02-08T20:37:45.900" Score="9" Body="&lt;p&gt;When I was 5, I gave myself and all my siblings nicknames. Beefy was the one I gave to myself and it evolved into Beefster by the time I was 12 and had an online presence. I see no reason to change it now with such a long-running history.&lt;/p&gt;&#xA;&lt;p&gt;And no, it has nothing to do with muscles and no relation to Beefcake. It has more to do with the meat that comes from bovines.&lt;/p&gt;&#xA;&lt;p&gt;My avatar is Verrick (from Legend of Korra) mashed up with Uncle Sam: &amp;quot;I want YOU to do the thing!&amp;quot; I made it in GIMP on a whim after being struck with the inspiration on a walk home from campus.&lt;/p&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2021-02-08T20:43:29.767" LastActivityDate="2021-02-08T20:43:29.767" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20727" PostTypeId="2" ParentId="20722" CreationDate="2021-02-08T21:29:43.907" Score="9" Body="&lt;p&gt;Pi's my favorite number, it is a totally original play on &amp;quot;easy as pie&amp;quot; (hence why I have like 15 variations of my username around the web), and my avatar is literally the default Google one rotated 180°.&lt;/p&gt;&#xA;&lt;p&gt;I'm not that creative. ¯\_(ツ)_/¯&lt;/p&gt;&#xA;" OwnerUserId="94093" LastActivityDate="2021-02-08T21:29:43.907" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20728" PostTypeId="2" ParentId="20722" CreationDate="2021-02-09T02:22:35.130" Score="11" Body="&lt;p&gt;My username basically comes from my childhood when I loved to play &lt;a href=&quot;https://en.wikipedia.org/wiki/Puzzle_Bobble&quot; rel=&quot;nofollow noreferrer&quot;&gt;Puzzle Bobble series&lt;/a&gt;. It's been my username of choice since I started activity on international online games and communities.&lt;/p&gt;&#xA;&lt;p&gt;I also used to be a Kirby fan, so my avatar has always been a Kirby. I found out that &amp;quot;Bubble Kirby&amp;quot; is a thing a few years ago, so I changed my avatar to a picture of Bubble Kirby.&lt;/p&gt;&#xA;&lt;p&gt;Not to be confused with the &lt;a href=&quot;https://github.com/Bubbler&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub organization called Bubbler&lt;/a&gt;, which made me append &lt;a href=&quot;https://xkcd.com/221/&quot; rel=&quot;nofollow noreferrer&quot;&gt;a random number&lt;/a&gt; to &lt;a href=&quot;https://github.com/Bubbler-4&quot; rel=&quot;nofollow noreferrer&quot;&gt;my GitHub account&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-02-09T02:33:39.520" LastActivityDate="2021-02-09T02:33:39.520" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20729" PostTypeId="2" ParentId="20722" CreationDate="2021-02-09T02:49:59.360" Score="11" Body="&lt;p&gt;I was looking for a new name for this site and couldn't come up with anything particularly clever. The last answer I had submitted was in x86 machine code under IBM PC DOS, and the frequently mis-attributed quote to Bill Gates about &amp;quot;&lt;a href=&quot;https://www.computerworld.com/article/2534312/the--640k--quote-won-t-go-away----but-did-gates-really-say-it-.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;640KB ought to be enough&lt;/a&gt;&amp;quot; just popped into my head. So I just thought &amp;quot;haha, okay that'll work&amp;quot;.&lt;/p&gt;&#xA;" OwnerUserId="84624" LastActivityDate="2021-02-09T02:49:59.360" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20731" PostTypeId="2" ParentId="20722" CreationDate="2021-02-09T04:44:42.350" Score="8" Body="&lt;h5&gt;Name&lt;/h5&gt;&#xA;&lt;p&gt;When I was like 11 or something I was just dabbling a bit in JavaScript and had gotten far enough to know what the data type containing text was called. I figured it would be clever to make the observation that usernames, being entirely arbitrary, don't necessarily reflect anything about the people who have them--never mind how little truth there is to that... And thus was born Unrelated String.&lt;/p&gt;&#xA;&lt;h5&gt;Avatar&lt;/h5&gt;&#xA;&lt;p&gt;The avatar I use on the rest of the network and virtually everywhere else is ultimately the portrait of Ryze from &lt;em&gt;League of Legends&lt;/em&gt;, mangled beyond recognition by myself and a friend. On CGCC and in chat, however, &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/59742047#59742047&quot;&gt;after&lt;/a&gt; the fateful events of &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/58916971#58916971&quot;&gt;Cat Week&lt;/a&gt;, I've sported 16 and counting hand-cropped anime profile pictures &lt;s&gt;as a reminder to society that my opinions are invalid&lt;/s&gt;--at the time of writing, Sengoku Nadeko from the teaser visual for &lt;em&gt;Monogatari Series Off &amp;amp; Monster Season&lt;/em&gt;, so if she isn't dramatically looking back at you with an ambiguous yet powerful expression, the number's wrong :P&lt;/p&gt;&#xA;" OwnerUserId="85334" LastEditorUserId="85334" LastEditDate="2024-01-18T22:30:31.613" LastActivityDate="2024-01-18T22:30:31.613" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20732" PostTypeId="2" ParentId="20722" CreationDate="2021-02-09T07:56:15.730" Score="4" Body="&lt;p&gt;&lt;code&gt;ophact&lt;/code&gt; is a randomly generated 6-character long string which came from a short piece of JavaScript code I wrote, a sort of &amp;quot;random competition&amp;quot; for JavaScript. It was the only readable word that came out, and has the sort of tone of &amp;quot;oh, fact?&amp;quot;&lt;/p&gt;&#xA;" OwnerDisplayName="user100690" LastEditorDisplayName="user100690" LastEditDate="2021-03-17T17:09:15.913" LastActivityDate="2021-03-17T17:09:15.913" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20733" PostTypeId="2" ParentId="20722" CreationDate="2021-02-09T09:51:45.297" Score="7" Body="&lt;p&gt;My username is a shortening of my old display name on Google+ (RIP), which I made about 6 years ago.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;R    - Raghu&#xA;a    - all&#xA;ze   - the&#xA;time&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;My profile pic comes from the &amp;quot;Color Ghost&amp;quot; &lt;a href=&quot;https://webcamtoy.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Webcam Toy&lt;/a&gt; effect. It still looks pretty cool, so I've kept it for a while now.&lt;/p&gt;&#xA;" OwnerUserId="80214" LastActivityDate="2021-02-09T09:51:45.297" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20734" PostTypeId="2" ParentId="2140" CreationDate="2021-02-09T11:45:50.080" Score="0" Body="&lt;h1&gt;Which Ninjutsu am I casting? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/218805/which-ninjutsu-am-i-casting&quot;&gt;Posted&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="45220" LastEditorUserId="45220" LastEditDate="2021-02-09T13:07:42.443" LastActivityDate="2021-02-09T13:07:42.443" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20735" PostTypeId="2" ParentId="20722" CreationDate="2021-02-09T13:54:44.153" Score="10" Body="&lt;p&gt;When I was seven or something my friends and I all had code names. Mine was &lt;code&gt;redwolf&lt;/code&gt;. A few years later, I got a gaming console, and &lt;code&gt;redwolf&lt;/code&gt; was obviously taken. I just stuck random numbers on the end, until I got &lt;code&gt;redwolf10105&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I actually used this for a while; I did have a stack overflow account with that name, but I forgot my password.&lt;/p&gt;&#xA;&lt;p&gt;When I was twelve or so, I got an idea: I thought I was &lt;em&gt;amazing&lt;/em&gt; at web development (read: I could make a box turn different colors), so my friends and I decided to make a company. We called it Redwolf Programs.&lt;/p&gt;&#xA;&lt;p&gt;Later, I registered a domain with that name, and used it for my various projects. Originally I did web stuff, but then game development and chat rooms seemed like more interesting projects. The &amp;quot;company&amp;quot; is gone, but my name has stuck :p&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-02-09T13:54:44.153" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20736" PostTypeId="2" ParentId="20722" CreationDate="2021-02-09T14:32:28.770" Score="5" Body="&lt;p&gt;My username? Well I just happen to see this mathematical expression &lt;em&gt;everywhere&lt;/em&gt; in my math textbook im getting tired of this expression this is boring i want to get out of this! I hate 2x-1 2x-1 is bad I want to kill him!!!&lt;/p&gt;&#xA;&lt;p&gt;And then, all of a sudden, I decided that I can use this as my username to make others feel bored like me as well! &lt;em&gt;evil laughs&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;As for my avatar, I want to change it someday, but not now. :P&lt;/p&gt;&#xA;" OwnerDisplayName="user99151" LastEditorDisplayName="user99151" LastEditDate="2021-02-09T14:55:50.273" LastActivityDate="2021-02-09T14:55:50.273" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="20737" PostTypeId="1" AcceptedAnswerId="20740" CreationDate="2021-02-09T16:45:53.320" Score="8" ViewCount="173" Body="&lt;p&gt;This was first &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/56954559#56954559&quot;&gt;asked by Leo in the Whispers chat room&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;But I have a general question about Whispers submissions: couldn't we avoid counting the final Output line most of the time? We can consider the rest of the program a function returning the desired output, printing it to the screen with a full program is not generally required for submissions&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This seems, to me, as though an edge case of the general I/O formats, so posting an answer over to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;I/O defaults&lt;/a&gt; may not allow for appropriate discussion.&lt;/p&gt;&#xA;&lt;p&gt;For those unfamiliar with Whispers, programs work line-by-line where each line returns a specific value. Lines are &amp;quot;called&amp;quot; by other lines through references in order to get the value from that line. For example, the basic Hello World program:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; &amp;quot;Hello, World!&amp;quot;&#xA;&amp;gt;&amp;gt; Output 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##K8/ILC5ILSo2@v/fTkHJIzUnJ19HITy/KCdFUYnLzk7Bv7SkoLREwfD/fwA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Whispers v2 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;As you can probably figure out, the last line &amp;quot;calls&amp;quot; line &lt;strong&gt;1&lt;/strong&gt; and outputs the result.&lt;/p&gt;&#xA;&lt;p&gt;However, by Leo's argument above, an equally valid program per our I/O rules would be&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; &amp;quot;Hello, World!&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;as you could consider this a function which returns the string &lt;code&gt;&amp;quot;Hello, World!&amp;quot;&lt;/code&gt; when &amp;quot;called&amp;quot; by another line referencing it.&lt;/p&gt;&#xA;&lt;p&gt;This meets our requirements for a function (it is reusable, lines can be composed with arguments, lines can call other lines etc.), but it definitely isn't a standard function.&lt;/p&gt;&#xA;&lt;p&gt;Thoughts? Should Whispers programs be allowed to ignore a final &lt;code&gt;&amp;gt;&amp;gt; Output&lt;/code&gt; line and consider the rest of the program as a function that returns the output?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-02-15T00:24:50.183" Title="Can Whispers programs ignore a final output line?" Tags="|discussion|answers|languages|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20738" PostTypeId="2" ParentId="20722" CreationDate="2021-02-09T20:14:53.300" Score="8" Body="&lt;p&gt;In my country/language, the term &amp;quot;polfosol&amp;quot; is a mockery for people who pretend to be knowledgeable, but actually don't have the slightest idea about the subject. e.g.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;-You shouldn't eat sausages. There are a lot of papers and scientific evidence that eating sausages will cause cancer.&lt;br /&gt;&#xA;-Sure, &lt;em&gt;polfosol&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;And the profile picture just came after I decided to choose this username. Because you know, he was the best professor I have ever known in my life.&lt;/p&gt;&#xA;" OwnerUserId="83082" LastActivityDate="2021-02-09T20:14:53.300" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20739" PostTypeId="2" ParentId="2140" CreationDate="2021-02-10T00:24:23.900" Score="0" Body="&lt;h1&gt;Trilobaccis' speed&lt;/h1&gt;&#xA;&lt;p&gt;The challenge is inspired by this beautiful one: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/217690/speed-of-lobsters&quot;&gt;Speed of Lobsters&lt;/a&gt;. And it's similar to this other one: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/217960/is-it-a-lobster-number&quot;&gt;Is it a lobster number?&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The word &lt;em&gt;Trilobacci&lt;/em&gt; is a blend of &lt;em&gt;Tribonacci&lt;/em&gt; and &lt;em&gt;Lobster&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;About tribonacci, quoting &lt;a href=&quot;https://en.wikipedia.org/wiki/Generalizations_of_Fibonacci_numbers#Tribonacci_numbers&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The tribonacci numbers are like the Fibonacci numbers, but instead of starting with two predetermined terms, the sequence starts with three predetermined terms and each term afterwards is the sum of the preceding three terms.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Regarding lobsters and speed, they refer to &lt;a href=&quot;https://www.reddit.com/r/SpeedOfLobsters/&quot; rel=&quot;nofollow noreferrer&quot;&gt;this subreddit&lt;/a&gt; where people have fun editing the text of images to create new phrases.&lt;/p&gt;&#xA;&lt;h3&gt;The challenge&lt;/h3&gt;&#xA;&lt;p&gt;The challenge is to &amp;quot;blank out&amp;quot; the digits of given numbers (let's say a,b,c) using the digit of other numbers (say x,y,z) which you have to find by yourself, and then tell whether you could use all the digits from x,y,z to blank out some (or even all) of the digits from a,b,c.&lt;/p&gt;&#xA;&lt;p&gt;Being more specific: given three positive integers in ascending order, which are necessarily part of a tribonacci sequence (at least the one they can generate), find the three numbers that generated the sequence and use them to blank out the original input numbers according to the lobsters rules.&lt;br /&gt;&#xA;Then output a truthy value if you used all the digits from the found numbers, or a falsy value if you are left with digits that couldn't be used to blank out the input digits.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;For the numbers generating the sequence, I mean the the three smallest non-negative integers being part of the sequence.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Lobsters rule!&lt;/h3&gt;&#xA;&lt;p&gt;Start taking the first digit of the first number of x,y,z and blank out its first occurrence in the digits of a,b,c. Then proceed with the next digit from x,y,z looking for its first occurrence in a,b,c, &lt;strong&gt;starting from where you left&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;Given&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[ 13, 23, 43 ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;you'll find out that they are part of a sequence generated by&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[ 1, 3, 3 ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;so then you can proceed at the speed of lobsters:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[ 1, 3, 3 ]   ---&amp;gt;   [ 13, 23, 43 ]&#xA;               ||&#xA;              _||_&#xA;              \  /&#xA;               \/&#xA;[ X, 3, 3 ]   ---&amp;gt;   [ *3, 23, 43 ]&#xA;&#xA;[ X, X, 3 ]   ---&amp;gt;   [ **, 23, 43 ]&#xA;&#xA;[ X, X, X ]   ---&amp;gt;   [ **, 2*, 43 ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And in this case you output a &lt;strong&gt;truthy&lt;/strong&gt; value because you used all the digits from &lt;code&gt;[ 1, 3, 3 ]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The numbers &lt;code&gt;[ 903, 1661, 3055 ]&lt;/code&gt; are also generated by &lt;code&gt;[ 1, 3, 3 ]&lt;/code&gt;, but the output for them is a &lt;strong&gt;falsy&lt;/strong&gt; value:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[ 1, 3, 3 ]   ---&amp;gt;   [ 903, 1661, 3055 ]&#xA;               ||&#xA;              _||_&#xA;              \  /&#xA;               \/&#xA;[ X, 3, 3 ]   ---&amp;gt;   [ 903, *661, 3055 ]&#xA;&#xA;[ X, X, 3 ]   ---&amp;gt;   [ 903, *661, *055 ]&#xA;&#xA;[ X, X, 3 ]   ---&amp;gt;   [ 903, *661, *055 ] can't find any 3 after the last blanked digit&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;Three integers. (One by one, into an array, as one or more a strings, split like bananas, etc.)&lt;br /&gt;&#xA;You can even take them in descending order if like.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;Choose a truthy and a falsy value and be consistent with them.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet/2422#2422&quot;&gt;Standard rules apply&lt;/a&gt; for your answer, with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods/&quot;&gt;standard I/O conventions&lt;/a&gt;, while &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;default Loopholes&lt;/a&gt; are forbidden.&lt;/p&gt;&#xA;&lt;p&gt;It would be nice if you could provide an easy way to try your program and possibly an explanation of how it works.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the shortest wins.&lt;/p&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;p&gt;Soon...&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any feedback / suggestion?&lt;/li&gt;&#xA;&lt;li&gt;I thought about considering the digits of x,y,z as always, but blanking out their occurrence in a,b,c from right-to-left, so that who participated to the previous lobster challenges would have to renew this part of the answer. Do you think it would be a good thing?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="100356" LastEditorUserId="100356" LastEditDate="2021-02-10T22:16:21.827" LastActivityDate="2021-02-10T22:16:21.827" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20740" PostTypeId="2" ParentId="20737" CreationDate="2021-02-10T02:19:17.750" Score="14" Body="&lt;h1&gt;Whispers lines are functions and they should follow our rules for functions&lt;/h1&gt;&#xA;&lt;p&gt;Since I was the one posing this question here's my opinion on this.&lt;/p&gt;&#xA;&lt;p&gt;Each line in Whispers is a function. Most often, these functions take no input, call other functions, and return one output. Calling a function that takes no input is as simple as writing the corresponding line number (in the &amp;quot;Hello, World!&amp;quot; example line 2 calls the function line 1 and outputs the result of that).&lt;/p&gt;&#xA;&lt;p&gt;A function can take up to two arguments, referred with the identifiers &lt;code&gt;L&lt;/code&gt; and &lt;code&gt;R&lt;/code&gt;. We can pass arguments to functions with the infix operator &lt;code&gt;∘&lt;/code&gt; (only supports one argument) or with constructs like &lt;code&gt;Each&lt;/code&gt;, &lt;code&gt;∑&lt;/code&gt;,&lt;code&gt;∏&lt;/code&gt;,&lt;code&gt;…&lt;/code&gt; (can use two arguments, special conditions apply).&lt;/p&gt;&#xA;&lt;p&gt;With lines being functions our defaults for functions apply, including:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2456/62393&quot;&gt;Functions may output via their return value(s)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2454/62393&quot;&gt;Functions may take input via function arguments&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2457/62393&quot;&gt;Functions may output via the same methods as full programs&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2455/62393&quot;&gt;Functions may take input via the same methods as full programs&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Combining these, we get that Whispers submissions may take input with the command &lt;code&gt;Input&lt;/code&gt; or with the &lt;code&gt;L&lt;/code&gt;/&lt;code&gt;R&lt;/code&gt; arguments, and may produce output with the command &lt;code&gt;Output&lt;/code&gt; or with the implicit return value of the main function line.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Edit&lt;/h3&gt;&#xA;&lt;p&gt;Clarification, since I've seen people confused by this: you cannot just take any Whispers program, remove the first and last line and claim this is now a function. The submitted function needs to really work as a function.&lt;/p&gt;&#xA;&lt;p&gt;In practice, if your program only produced output via a final &lt;code&gt;&amp;gt;&amp;gt; Output N&lt;/code&gt; line, it should be enough to remove that and have line N be your function submission (with all other lines being auxiliary functions). Taking input via L/R generally needs bigger changes to your code, your main function will need to use L/R itself, and these values will need to be passed to any auxiliary function working on the input: this will not necessarily be shorter than the original program, and in some cases it may even be impossible to do. As a rule, your function should never refer to lines outside the function itself (this would be similar to taking input from pre-initialized variables).&lt;/p&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt; Input&#xA;&amp;gt;&amp;gt; 1!&#xA;&amp;gt;&amp;gt; Output 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is a program that prints the factorial of an input number. We can turn it into a function by getting rid of the final output line:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt; Input&#xA;&amp;gt;&amp;gt; 1!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Now our line 2 is the function we are submitting, giving output via its return value. We can also decide to take input via argument L:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt; L!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And this can be our submission. We can write a full program to test it by calling the function on some input and printing its result to the screen: &lt;a href=&quot;https://tio.run/##K8/ILC5ILSo2@v/fzk7BR/G/nYJnXkFpCReQZ/ioY4YRiOFfWgIUUjD@bwwA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Whispers v2 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="62393" LastEditorUserId="62393" LastEditDate="2021-02-15T00:24:50.183" LastActivityDate="2021-02-15T00:24:50.183" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20743" PostTypeId="2" ParentId="20722" CreationDate="2021-02-11T00:16:42.267" Score="16" Body="&lt;p&gt;Mine has several meanings:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Many of the answers here on CGCC are quite &lt;em&gt;traumatic&lt;/em&gt; to read, and everything here is &lt;em&gt;digital&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;Digital Trauma&lt;/em&gt; is the medical term for nose-picking.  I think a lot of us are figuratively picking our noses here, i.e. spending time asking/answering challenges for fun, when we should probably be focussing our talents elsewhere, e.g. paid employment or study.&lt;/li&gt;&#xA;&lt;li&gt;I decided on this handle shortly after recovering from a particularly nasty medical episode of uncontrolled nasal bleeding - caused by a botched deviated septum surgery, and not literal nose-picking!  4 ED visits, 1 ICU admission and several pints of transfused blood later, this is a tale I am happy to be able to tell.  Suffice to say, the term &lt;em&gt;Digital Trauma&lt;/em&gt; was quite vivid in my mind at the time.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="11259" LastActivityDate="2021-02-11T00:16:42.267" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20744" PostTypeId="1" CreationDate="2021-02-11T01:13:18.010" Score="2" ViewCount="65" Body="&lt;p&gt;There are a variety of languages and frameworks that can be used to output a 3d object, including, but not limited to, &lt;a href=&quot;https://github.com/Irev-Dev/curated-code-cad&quot; rel=&quot;nofollow noreferrer&quot;&gt;codecad&lt;/a&gt;. However, many 3d frameworks or game engines could also be used this way. I think there are a range of interesting challenges that could be created here, but I'm not sure whether this is allowed. Is it/Should it be? And would the standard rules work well for this?&lt;/p&gt;&#xA;" OwnerUserId="100880" LastActivityDate="2021-02-11T01:13:18.010" Title="Generate a 3d Object?" Tags="|discussion|" AnswerCount="0" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20745" PostTypeId="2" ParentId="20722" CreationDate="2021-02-11T07:55:53.787" Score="16" Body="&lt;p&gt;&lt;em&gt;&lt;a href=&quot;https://gist.github.com/Lyxal/17421b5130fa202c15778e3acb4b5580&quot; rel=&quot;nofollow noreferrer&quot;&gt;Now in &amp;quot;Passed through way too many languages on google translate edition&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Wow, y'all with your usernames that actually have meaning.&lt;/p&gt;&#xA;&lt;p&gt;I literally just spent 5 minutes typing random keys until I ended up with something I deemed &amp;quot;cool&amp;quot; and &amp;quot;ironic&amp;quot;. Having said that, I did want to make sure the letters L and X were present (for maximum coolness) and that there was a name length of 5 (shorter names are more memorable, leading to hopefully more up votes).&lt;/p&gt;&#xA;&lt;p&gt;Admittedly, Google once attempted to give it meaning... I placed it into google translate (using detect language) , and it spat out &lt;code&gt;Lyhal&lt;/code&gt;, claiming it was in &lt;code&gt;Azerbaijani&lt;/code&gt;. I repeated the process with lyhal and detect language... The result was &lt;code&gt;to solve&lt;/code&gt; and the detected language was Arabic.&lt;/p&gt;&#xA;&lt;p&gt;For the record, it is &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=54384050#54384050&quot;&gt;&lt;strong&gt;NOT&lt;/strong&gt;&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/54384051#54384051&quot;&gt;pronounced&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/56886098#56886098&quot;&gt;&lt;code&gt;licks-all&lt;/code&gt;&lt;/a&gt;. That's just gross, weird and downright disgusting (screw you text-to-speech). It is supposed to be pronounced &lt;code&gt;likesal&lt;/code&gt; (tts it and you'll hear what I mean). Okay say it with me now...&lt;/p&gt;&#xA;&lt;h1&gt;Likesal&lt;/h1&gt;&#xA;&lt;p&gt;There you go. Now you know how to pronounce it properly.&lt;/p&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2024-01-19T11:59:46.180" LastActivityDate="2024-01-19T11:59:46.180" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20746" PostTypeId="2" ParentId="20722" CreationDate="2021-02-11T11:56:17.070" Score="5" Body="&lt;p&gt;A couple of years ago, I got into reading a Russian knock-off of Harry Potter which one of my friends recommended to me (the book was actually really well-written, still one of my all-time favourites). During one of the chapters, a noticed a character with the name Varsus, suspiciously similar to that friend's online nickname Varsis. When I told him about it, he confirmed that he just slightly changed that character's name to create his nickname. I responded to that with doing the same - taking one of the character's name Dionius and simplifying it to Dion. I've been using it ever since, often wrapping it in 8s to make 8Dion8 when just Dion wasn't available. As for my pfp, it's a random year-old photo of me that a friend took on a trip to the countryside. I've often also been using a frame from &lt;a href=&quot;https://images.app.goo.gl/mjpwt4QWU56zqm3b6&quot; rel=&quot;nofollow noreferrer&quot;&gt;this meme&lt;/a&gt; when I didn't want my actual photo on display, or a &lt;a href=&quot;https://ibb.co/P9qxWG9&quot; rel=&quot;nofollow noreferrer&quot;&gt;Bill Wurtz thumbnail&lt;/a&gt; on my Discord.&lt;/p&gt;&#xA;" OwnerUserId="92080" LastActivityDate="2021-02-11T11:56:17.070" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20747" PostTypeId="2" ParentId="2140" CreationDate="2021-02-11T14:34:16.253" Score="0" Body="&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Print all the &lt;a href=&quot;https://en.wikipedia.org/wiki/Tamil_script&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tamil characters&lt;/a&gt; in any order you like. They should be 12 vowels, 18 consonants and the special symbol ஃ .&lt;/p&gt;&#xA;&lt;p&gt;Your code should not print anything except for those letters but it can print one letter per line.&lt;/p&gt;&#xA;&lt;p&gt;The consonants are: க் ங் ச் ஞ் ட் ண் த் ந் ப் ம் ய் ர் ல் வ் ழ் ள் ற் ன்&lt;/p&gt;&#xA;&lt;p&gt;The vowels are: அ ஆ இ ஈ உ ஊ எ ஏ ஐ ஒ ஓ ஔ&lt;/p&gt;&#xA;&lt;p&gt;Shortest code wins&lt;/p&gt;&#xA;" OwnerDisplayName="user7467" LastEditorDisplayName="user7467" LastEditDate="2021-02-11T15:41:54.150" LastActivityDate="2021-02-11T15:41:54.150" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="20748" PostTypeId="2" ParentId="2140" CreationDate="2021-02-11T19:12:06.940" Score="1" Body="&lt;h1&gt;(WIP) Settling the Lands of Codegolfia&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;The challenge controller will randomly generate a 200x200 map representing the terrain of the land&lt;/p&gt;&#xA;&lt;p&gt;Your task is to write an AI whose goal is to have the largest population after 500 turns.&lt;/p&gt;&#xA;&lt;h2&gt;Start&lt;/h2&gt;&#xA;&lt;p&gt;Each player begins with 1 cell claimed and a population of 100.&lt;/p&gt;&#xA;&lt;h2&gt;Turns&lt;/h2&gt;&#xA;&lt;p&gt;On each turn, you have the opportunity to claim land cells. You can claim 1 cell per turn, plus 1 per 1000 population. Claimed cells must be orthogonally adjacent to a cell you already own. You cannot claim cells belonging to other players.&lt;/p&gt;&#xA;&lt;p&gt;Turns happen simultaneously. In the event that two players attempt to claim the same cell, both players will lose 10 people from their population and neither player will claim the cell.&lt;/p&gt;&#xA;&lt;p&gt;At the end of your turn, your population grows by 10% (rounded up), up to the maximum size your colony can support.&lt;/p&gt;&#xA;&lt;h2&gt;Population Support&lt;/h2&gt;&#xA;&lt;p&gt;Without any land claimed, your colony can support up to 150 people.&lt;/p&gt;&#xA;&lt;p&gt;Supporting larger populations requires claiming land. Each terrain type increases the amount by some amount. Combinations of terrain expand this further.&lt;/p&gt;&#xA;&lt;h2&gt;Terrain&lt;/h2&gt;&#xA;&lt;p&gt;There are 4 terrain types:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Plains&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Supports 20 people by itself&lt;/li&gt;&#xA;&lt;li&gt;Supports 5 per adjacent owned plains&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Forest&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Supports 10 people by itself&lt;/li&gt;&#xA;&lt;li&gt;Supports 5 per adjacent owned forest&lt;/li&gt;&#xA;&lt;li&gt;Supports 50 additional people if there are at least 10 owned plains cells within 10 cells (Manhattan distance)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Mountains&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Supports 5 by itself&lt;/li&gt;&#xA;&lt;li&gt;Supports 5 per owned plains within 15 cells&lt;/li&gt;&#xA;&lt;li&gt;Supports 10 per owned forest within 5 cells&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Water&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each plains cell can support 500 additional people if it is within 5 cells of an owned water cell.&lt;/li&gt;&#xA;&lt;li&gt;Each forest cell can support 200 additional people if it is within 10 cells of an owned water cell.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Alternative ideas for terrain&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Plains support raw population. Same as above&lt;/li&gt;&#xA;&lt;li&gt;Forest cells increase population support for all plains within 5 cells by a factor of 5% (stacks multiplicatively)&lt;/li&gt;&#xA;&lt;li&gt;For every water cell and 10 plains cells, reproduction rate increases by 1%&lt;/li&gt;&#xA;&lt;li&gt;Each mountain cell increases the range of each owned mountain and forest within 3 cells by 1. (stacks additively)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2021-02-11T20:31:30.903" LastActivityDate="2021-02-11T20:31:30.903" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20749" PostTypeId="2" ParentId="2140" CreationDate="2021-02-11T20:50:09.943" Score="0" Body="&lt;h1&gt;Generate a &quot;Pi-ey&quot; number &lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pi&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pi&amp;#39;&quot; rel=&quot;tag&quot;&gt;pi&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Generate the smallest integer of the form &lt;span class=&quot;math-container&quot;&gt;\$x^x\$&lt;/span&gt; with &lt;span class=&quot;math-container&quot;&gt;\$10^{n-1}\cdotπ\$&lt;/span&gt; digits, rounded down, given &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;. If there is no such number, take the nearest number that has as many digits of &lt;span class=&quot;math-container&quot;&gt;\$π\$&lt;/span&gt; in its digit count. For example, if &lt;span class=&quot;math-container&quot;&gt;\$n=5\$&lt;/span&gt;, then the number of digits would be 31415. If there was no such number of form &lt;span class=&quot;math-container&quot;&gt;\$x^x\$&lt;/span&gt;, then take the nearest digit count similar to 31415, like 31414 and 31416.&lt;/p&gt;&#xA;&lt;p&gt;If there are multiple values of &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; that will work, whichever one is closer to &lt;span class=&quot;math-container&quot;&gt;\$3.1415926e3141...\$&lt;/span&gt; will be the chosen value. For instance, if two solutions for &lt;span class=&quot;math-container&quot;&gt;\$n=5\$&lt;/span&gt; were &lt;span class=&quot;math-container&quot;&gt;\$1.234e31414\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$1.234e31416\$&lt;/span&gt;, we would select the former, as it is closer to &lt;span class=&quot;math-container&quot;&gt;\$3.1415926...e31415\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/fz8Sx.png&quot; alt=&quot;Glitchy picture&quot; /&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Shortest amount of bytes of code wins&lt;/li&gt;&#xA;&lt;li&gt;Please post the number of bytes as well as the runtime for &lt;span class=&quot;math-container&quot;&gt;\$n=5\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;It is recommended that you post your score (below), but is not required.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your score will be based on your program time and length. &lt;span class=&quot;math-container&quot;&gt;\$\text{score} = \text{program length in bytes} + 10 \times \text{time to execute in seconds}\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="95652" LastEditorUserId="95652" LastEditDate="2021-02-12T01:27:01.540" LastActivityDate="2021-02-12T01:27:01.540" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="20750" PostTypeId="1" CreationDate="2021-02-11T21:45:05.820" Score="0" ViewCount="53" Body="&lt;p&gt;Recently, I posted my first post on the main site for Code Golf, and it was poorly received because I am a newcomer to the site. I was asked to post it in the sandbox, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20749/95652&quot;&gt;here&lt;/a&gt;. As of now, it has one vote, and I doubt that is sufficient enough to have confidence to post it on the main site. So how many votes in the sandbox would be sufficient to be mostly confident that a question would be well received in the main?&lt;/p&gt;&#xA;" OwnerUserId="95652" LastActivityDate="2021-02-11T21:45:05.820" Title="Threshold for votes in the Sandbox before posting in the main site?" Tags="|discussion|sandbox|voting|" AnswerCount="0" CommentCount="7" ClosedDate="2021-02-13T06:09:02.537" ContentLicense="CC BY-SA 4.0" />
  <row Id="20751" PostTypeId="2" ParentId="20722" CreationDate="2021-02-11T22:57:47.960" Score="6" Body="&lt;p&gt;My username &amp;quot;Davide' is just my actual name. Few months ago I was learning C (my first language) and signed up on SO to ask something. I think I didn't typed any username, just logged using my Google account.&lt;/p&gt;&#xA;&lt;p&gt;I take this opportunity to change my username and add an avatar.&lt;/p&gt;&#xA;&lt;p&gt;Apart from golfing in C and learning JavaScript, I only eat, sleep, listen to music (a lot of it) and cuddle two kittens of a flatmate. That's the reason why my username and avatar will be all about music.&lt;/p&gt;&#xA;&lt;p&gt;My username is going to be &lt;strong&gt;Sheik Yerbouti&lt;/strong&gt;. It comes from &amp;quot;The Sheik Yerbouti tango&amp;quot; by Frank Zappa. I chose this name because (apart from being the title of a nice guitar solo) it's kind of an actual name and it also encourages you to move, an invitation that can be interpreted in many ways.&lt;/p&gt;&#xA;&lt;p&gt;As for the avatar I'll find a picture of music(?)&lt;/p&gt;&#xA;" OwnerUserId="100356" LastEditorUserId="100356" LastEditDate="2021-02-11T23:34:00.123" LastActivityDate="2021-02-11T23:34:00.123" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20752" PostTypeId="2" ParentId="2140" CreationDate="2021-02-12T12:49:35.940" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/219158/verify-the-inequality&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="100635" LastEditorUserId="100635" LastEditDate="2021-02-16T14:27:12.040" LastActivityDate="2021-02-16T14:27:12.040" CommentCount="19" ContentLicense="CC BY-SA 4.0" />
  <row Id="20753" PostTypeId="2" ParentId="2140" CreationDate="2021-02-12T14:37:05.347" Score="2" Body="&lt;h1&gt;Pad a jagged array to be square &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/219041&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2021-02-15T12:43:26.667" LastActivityDate="2021-02-15T12:43:26.667" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="20754" PostTypeId="2" ParentId="2140" CreationDate="2021-02-12T23:59:50.650" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/219203/100303&quot;&gt;post&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="100303" LastEditorUserId="100303" LastEditDate="2021-02-16T23:56:16.777" LastActivityDate="2021-02-16T23:56:16.777" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="20755" PostTypeId="2" ParentId="2140" CreationDate="2021-02-13T00:47:11.350" Score="0" Body="&lt;h1&gt;Compute the analysis spectrum&lt;/h1&gt;&#xA;&lt;p&gt;This is based on a task I had in work a few years back.&lt;/p&gt;&#xA;&lt;p&gt;A &lt;a href=&quot;https://www.chromatographyonline.com/view/how-does-it-work-part-iv-ultraviolet-detectors&quot; rel=&quot;nofollow noreferrer&quot;&gt;diode-array detector&lt;/a&gt; (DAD) is a kind of chromatography detector which fires light into a sample and detects the strength of the light that passes through it at different wavelengths. From this you can determine, among other things, the contents or the purity of the sample.&lt;/p&gt;&#xA;&lt;p&gt;Most detectors can only detect on one wavelength. A DAD however can scan across a spectrum of wavelengths, typically from 190nm to 650nm. From that spectrum we can then pick out the wavelengths that we're interested in. Maybe for our sample we want to analyse it at wavelengths 300nm, 350nm, and 550nm. These are called 'channels'.&lt;/p&gt;&#xA;&lt;p&gt;Each wavelength may also have a bandwidth across which the signal strength is averaged. If we have analyse on wavelength 420nm, with a bandwidth of 10nm, the range for that channel would be from 415nm to 425nm (5nm lower, 5nm higher than the base wavelength). However, this bandwidth is optional.&lt;/p&gt;&#xA;&lt;p&gt;The DAD we'll be working with does not take a set of channels, but rather we must provide it with a minimum wavelength and a maximum wavelength to detect across. This will be our task.&lt;/p&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a program or function that, when given a collection of channels, determines the lowest and highest wavelength to analyse across for these channels.&lt;/p&gt;&#xA;&lt;p&gt;For this challenge, a channel consists of an integer wavelength, and an optional integer bandwidth. The wavelength can be positive or negative, but the bandwidth is always positive.&lt;/p&gt;&#xA;&lt;p&gt;Bandwidths can be odd numbers, but in that case you would then shrink it down to an even number.&lt;/p&gt;&#xA;&lt;p&gt;The upper limit can be the same as the lower limit, but can never be smaller.&lt;/p&gt;&#xA;&lt;p&gt;Also, you can safely assume that at least one channel is given to your code.&lt;/p&gt;&#xA;&lt;h2&gt;Example 1&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Channel 1&#xA;Wavelength = 420&#xA;Bandwidth = 10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For channel 1, the base wavelength is 420 and the bandwidth is 10.&lt;/p&gt;&#xA;&lt;p&gt;Channel 1's lower range is the base wavelength minus half of the bandwidth. In this case, it's &lt;code&gt;420 - (10 / 2) = 415&lt;/code&gt;. The upper range is the base wavelength plus half of the bandwidth: &lt;code&gt;420 + (10 / 2) = 425&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Answers: &lt;code&gt;Lower = 415, upper = 425&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Example 2&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Channel 1&#xA;Wavelength = 394&#xA;Bandwidth = 19&#xA;&#xA;Channel 2&#xA;Wavelength = 500&#xA;Bandwidth = N/A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For channel 1, the base wavelength is 394 and the bandwidth is 19. Because the bandwidth is an odd number, and our DAD cannot accept floating-point numbers, we can round it down to 18.&lt;/p&gt;&#xA;&lt;p&gt;Channel 1's lower range is the base wavelength minus half of the bandwidth. In this case, it's &lt;code&gt;394 - (18 / 2) = 385&lt;/code&gt;. The upper range is the base wavelength plus half of the bandwidth: &lt;code&gt;394 + (18 / 2) = 403&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Channel 2 has no bandwidth, so it's range is just at its base wavelength: 500.&lt;/p&gt;&#xA;&lt;p&gt;Comparing the channel ranges, channel 1 has the minimum lower limit with 385. Channel 2 has the maximum upper limit, with 500.&lt;/p&gt;&#xA;&lt;p&gt;Answers: &lt;code&gt;Lower = 385, upper = 500&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Test case 1:&#xA;&#xA;Wavelength 1 = 400&#xA;Bandwidth 1 = N/A&#xA;&#xA;Answers: lower = 400, upper = 400&#xA;&#xA;-------------------------------------&#xA;&#xA;Test case 2:&#xA;&#xA;Wavelength 1 = 200&#xA;Bandwidth 1 = 15&#xA;&#xA;Answers: lower = 193, upper = 207&#xA;&#xA;-------------------------------------&#xA;&#xA;Test case 3:&#xA;&#xA;Wavelength 1 = 394&#xA;Bandwidth 1 = 19&#xA;&#xA;Wavelength 2 = 500&#xA;Bandwidth 2 = N/A&#xA;&#xA;Answers: lower = 385, upper = 500&#xA;&#xA;-------------------------------------&#xA;&#xA;Test case 4:&#xA;&#xA;Wavelength 1 = 394&#xA;Bandwidth 1 = 40&#xA;&#xA;Wavelength 2 = 500&#xA;Bandwidth 2 = 10&#xA;&#xA;Wavelength 3 = 380&#xA;Bandwidth 3 = 5&#xA;&#xA;Answers: lower = 374, upper = 505&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;The range that you must produce must consist of an integer lower limit and an integer upper limit. This particular DAD cannot accept decimal numbers, so while your code may accept and output floating-point types, &lt;em&gt;the values themselves must be whole numbers.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Computing this range is important for other settings on the DAD. Therefore, you may not take just any input and return an extremely small lower limit and/or an extremely large upper limit. Your outputs &lt;em&gt;must&lt;/em&gt; be based on your inputs.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet/2422#2422&quot;&gt;Standard rules apply&lt;/a&gt;, including &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods/&quot;&gt;the default I/O rules&lt;/a&gt;. Similarly, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;default loopholes are forbidden&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Finally, this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest answer in bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the challenge itself too complex or too easy?&lt;/li&gt;&#xA;&lt;li&gt;Is the requirement for whole-numbered outputs valid, or does it seem a little bit arbitrary?&lt;/li&gt;&#xA;&lt;li&gt;Are the examples and the test cases useful?&lt;/li&gt;&#xA;&lt;li&gt;Finally, would this be an interesting challenge?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78954" LastActivityDate="2021-02-13T00:47:11.350" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20757" PostTypeId="2" ParentId="2140" CreationDate="2021-02-13T07:00:08.467" Score="0" Body="&lt;h1&gt;Print the nth sequence from oeis&lt;/h1&gt;&#xA;&lt;p&gt;The input is one natural number n - the sequence number&lt;/p&gt;&#xA;&lt;p&gt;Your task is to put this numeric link &lt;a href=&quot;https://oeis.org/A&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://oeis.org/A&lt;/a&gt; (example of a link with n = 1: &lt;a href=&quot;https://oeis.org/A1&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://oeis.org/A1&lt;/a&gt;), then you should get the html of this page and get the sequence from there&lt;/p&gt;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;n -&amp;gt; sequence&#xA;1 -&amp;gt; 0, 1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51, 1, 2, 1, 14, 1, 2, 2, 14, 1, 6, 1, 4, 2, 2, 1, 52, 2, 5, 1, 5, 1, 15, 2, 13, 2, 2, 1, 13, 1, 2, 4, 267, 1, 4, 1, 5, 1, 4, 1, 50, 1, 2, 3, 4, 1, 6, 1, 52, 15, 2, 1, 15, 1, 2, 1, 12, 1, 10, 1, 4, 2&#xA;2 -&amp;gt; 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1, 2, 2&#xA;3 -&amp;gt; 1, 1, 1, 1, 2, 2, 1, 2, 2, 2, 3, 2, 2, 4, 2, 2, 4, 2, 3, 4, 4, 2, 3, 4, 2, 6, 3, 2, 6, 4, 3, 4, 4, 4, 6, 4, 2, 6, 4, 4, 8, 4, 3, 6, 4, 4, 5, 4, 4, 6, 6, 4, 6, 6, 4, 8, 4, 2, 9, 4, 6, 8, 4, 4, 8, 8, 3, 8, 8, 4, 7, 4, 4, 10, 6, 6, 8, 4, 5, 8, 6, 4, 9, 8, 4, 10, 6, 4, 12, 8, 6, 6, 4, 8, 8, 8, 4, 8, 6, 4&#xA;4 -&amp;gt; 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0&#xA;5 -&amp;gt; 1, 2, 2, 3, 2, 4, 2, 4, 3, 4, 2, 6, 2, 4, 4, 5, 2, 6, 2, 6, 4, 4, 2, 8, 3, 4, 4, 6, 2, 8, 2, 6, 4, 4, 4, 9, 2, 4, 4, 8, 2, 8, 2, 6, 6, 4, 2, 10, 3, 6, 4, 6, 2, 8, 4, 8, 4, 4, 2, 12, 2, 4, 6, 7, 4, 8, 2, 6, 4, 8, 2, 12, 2, 4, 6, 6, 4, 8, 2, 10, 5, 4, 2, 12, 4, 4, 4, 8, 2, 12, 4, 6, 4, 4, 4, 12, 2, 6, 6, 9, 2, 8, 2, 8&#xA;6 -&amp;gt; 1, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18&#xA;7 -&amp;gt; 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0&#xA;8 -&amp;gt; 1, 1, 2, 2, 3, 4, 5, 6, 7, 8, 11, 12, 15, 16, 19, 22, 25, 28, 31, 34, 40, 43, 49, 52, 58, 64, 70, 76, 82, 88, 98, 104, 114, 120, 130, 140, 150, 160, 170, 180, 195, 205, 220, 230, 245, 260, 275, 290, 305, 320, 341, 356, 377, 392, 413, 434, 455, 476, 497, 518, 546&#xA;9 -&amp;gt; 1, 1, 1, 2, 2, 3, 4, 5, 6, 8, 10, 12, 15, 18, 22, 27, 32, 38, 46, 54, 64, 76, 89, 104, 122, 142, 165, 192, 222, 256, 296, 340, 390, 448, 512, 585, 668, 760, 864, 982, 1113, 1260, 1426, 1610, 1816, 2048, 2304, 2590, 2910, 3264, 3658, 4097, 4582, 5120, 5718, 6378&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="99104" LastActivityDate="2021-02-13T07:00:08.467" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20758" PostTypeId="2" ParentId="20722" CreationDate="2021-02-14T14:07:13.577" Score="14" Body="&lt;p&gt;&lt;code&gt;regexp&lt;/code&gt; backwards.&lt;/p&gt;&#xA;&lt;p&gt;Many of my previous online aliases have been obscure programming terms, backwards. This one is not quite as obscure, but it has two extra features that make it suitable:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;it contains &lt;code&gt;x&lt;/code&gt;, which as we all know, is the &lt;a href=&quot;https://www.youtube.com/watch?v=rDV7aA6arVo&quot; rel=&quot;nofollow noreferrer&quot;&gt;most expensive letter in the alphabet&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;it starts and ends with my initials&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;It's pronounced /pʰə̆ɡsɛˈgə/ or /pʰə̆ɡsɛˈgər/.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2021-02-14T20:16:08.470" LastActivityDate="2021-02-14T20:16:08.470" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20759" PostTypeId="2" ParentId="2140" CreationDate="2021-02-15T01:09:29.550" Score="-1" Body="&lt;h1&gt;Create a Screw&lt;/h1&gt;&#xA;&lt;p&gt;There are a variety of &lt;a href=&quot;https://kurthutten.com/blog/curated-code-cad/&quot; rel=&quot;nofollow noreferrer&quot;&gt;code cad&lt;/a&gt; languages, as well as other 3d API's that allow you to define shapes with code. Some of these are limited, while others are Turing complete and/or use a popular programming language such as Python or JavaScript.&lt;/p&gt;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Output a 3d model of a screw. Acceptable formats include .stl files and .obj files. A screw is defined as a shorter, wider cylinder on top of a taller, thinner cylinder, which should be threaded at least 5 times. Winner is whoever has the shortest code by two weeks after this question is posted. Standard rules and loopholes apply, with the exception that anything that allows you to programmatically define a 3d object is treated as a program language.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Changes&lt;/h1&gt;&#xA;&lt;p&gt;Should I add a spot for the screw driver to my definition of a screw? On the one hand, that would be more realistic, but on the other, it might just add bloat to answers, since I don't think there's anything interesting you can do with it.&lt;/p&gt;&#xA;&lt;p&gt;I plan to include an example of a minimal screw under whatever definition I end up using, with pictures and outputs in every allowed format.&lt;/p&gt;&#xA;&lt;p&gt;For the purpose of sorting and answer headers, should each langauge/framework combo be treated as a separate language? I'm leaning towards this, since It would be cool to have an easily searchable set of code for a bunch of different frameworks.&lt;/p&gt;&#xA;" OwnerUserId="100880" LastActivityDate="2021-02-15T01:09:29.550" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="20760" PostTypeId="2" ParentId="2140" CreationDate="2021-02-15T12:39:09.957" Score="1" Body="&lt;h1&gt;Score an approximation code challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Given a list of inputs (strings) and their expected outputs (integers or floats)&lt;sup&gt;[1]&lt;/sup&gt;, and a black-box program&lt;sup&gt;[2]&lt;/sup&gt;, calculate the score using the following scoring system:&lt;/p&gt;&#xA;&lt;p&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$R_n\$&lt;/span&gt; be the expected output of the &lt;span class=&quot;math-container&quot;&gt;\$n^{th}\$&lt;/span&gt; input, let &lt;span class=&quot;math-container&quot;&gt;\$A_n\$&lt;/span&gt; be the actual output given by the black-box program, and let &lt;span class=&quot;math-container&quot;&gt;\$ j \$&lt;/span&gt; be the total number of input/output pairs. (All values are positive and non-zero)&lt;/p&gt;&#xA;&lt;p&gt;Then the score is defined as:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$S=\left\lceil L\times\max_{1\le i \le j}\left({\max\left(\frac{A_i}{R_i},\frac{R_i}{A_i}\right)^2}\right)\right\rceil$$&lt;/span&gt;&#xA;where &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; is the length of the black-box program in bytes.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Example:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;If the size of the program is &lt;span class=&quot;math-container&quot;&gt;\$100\$&lt;/span&gt; bytes and the worst approximation is on the input &amp;quot;moon&amp;quot;, where the program outputs &lt;span class=&quot;math-container&quot;&gt;\$1000\$&lt;/span&gt; instead of the expected &lt;span class=&quot;math-container&quot;&gt;\$1737\$&lt;/span&gt;, then the score would be:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$S=\left\lceil 100\times{\left(\frac{1737}{1000}\right)^2}\right\rceil=302$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;This system is taken shamelessly from &lt;a href=&quot;https://codegolf.stackexchange.com/q/177021&quot;&gt;this challenge&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/u/58563&quot;&gt;@Arnauld&lt;/a&gt;. &lt;a href=&quot;https://tio.run/##ZVNhT9swEP3eX3GqELUhS5OmSdMxmNDUbkyUTS3bl1IJqzHgKXUyx0GtoH9qP2F/rLtzR8fggy@553fvni/OD3EvqrlRpX2ji0xuNmM4hum0Oal100v6SdTtzLxp83NdKisNQf0wJGQibG2QE6edyFG@GaHrqul14ihxwIUsba0lIt2k45CBMPYONaKek/guXUESxG53JAxmUdQPKPso9GohMypHE4RcKis06fdiR5dmXpsVyXddxQeR56qyBSGhQ87wPUy3vUdFgcVhL@o5J7UpSoF5nDgrl0ZZtx/FEeVf85qEwjBNHN2oirLEbX4S9UJicRomO18K816azmZHjcb03APf909hhrM08metjGStm6rFfSNFNlS5nKz0nLXambxvVzZTGrdsMbFG6VvG/arMlWWtK4IXomQajk/gUPOjxk1hFsKirIM0Fg3VUmasw/1SZAOdsTBA2kIskROgl7GPJQMxv2NsqsVCemBEpupq5oHmpPHQAJgXuipy6efFLSPSk1afwyE04S2uQ9i2ZgaFS/xScpgXmJ5O9YwTjanqQlwww@HxEQy8w/bwHpgRVhVYEkIbAg@ag/H4y7jJSbOUWuR2BU8U9qzLSNg7PPqSbd2ia9ek2YZXJKVfkvjvXyhHxF37f3roY0d3TwI4HBxAh@/GGXOOU4S/1k6A5rm/D2w7V4d6UOZCS/ctcGRIX@NqqBscxFBp/FuIjYZeDvj6So/E0oeXx997QP4zB2s6JqLbNutrZ@g/ocm8MBIr51LlbO/hfA3L1yrcSbvzO945HNBxuBNcN2ReyVcW8ead6XuRqwyvb1XnFq8ukjebMAgaSRIH9Egpxv0eRvwlKXZjwrcwhqhLYLIL0VMIUwrEC6kidFiHAumnXVxh8Ac&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt; is his reference implementation.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;[1]: You may take the inputs and outputs either zipped (&lt;code&gt;[(in1, out1), (in2, out2), ...]&lt;/code&gt;), or not zipped (&lt;code&gt;([in1, in2, ...], [out1, out2, ...])&lt;/code&gt;, with both lists of the same length), at your option.&lt;/p&gt;&#xA;&lt;p&gt;[2]: You may take the black-box program as either:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13706&quot;&gt;black-box function&lt;/a&gt;, and its length in bytes, as two separate inputs&lt;/li&gt;&#xA;&lt;li&gt;a string of code to be evaluated, as one input (the length will not be given separately &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13262&quot;&gt;unless necessary&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may use any &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447&quot;&gt;sensible I/O method&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2021-02-15T13:24:03.613" LastActivityDate="2021-02-15T13:24:03.613" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20761" PostTypeId="2" ParentId="20722" CreationDate="2021-02-15T14:15:59.667" Score="5" Body="&lt;p&gt;It’s just my name + surname with all vowels removed. Boring…&#xA;The profile pic is some doodle I did many years ago, but I like it so it stuck.&lt;/p&gt;&#xA;" OwnerUserId="5116" LastActivityDate="2021-02-15T14:15:59.667" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20762" PostTypeId="2" ParentId="20722" CreationDate="2021-02-15T19:19:06.410" Score="6" Body="&lt;h1&gt;Weasels&lt;/h1&gt;&#xA;&lt;p&gt;My username (Wezl) is Weasel spelled better and more recognizeable. Some weasel &lt;em&gt;facts&lt;/em&gt; that may have influenced this decision.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;They're &lt;a href=&quot;https://commons.wikimedia.org/wiki/Category:Mustela&quot; rel=&quot;nofollow noreferrer&quot;&gt;adorable&lt;/a&gt; (yes, this is a fact). A simple interweb search is enough proof.&lt;/li&gt;&#xA;&lt;li&gt;They're &lt;a href=&quot;https://en.wikipedia.org/wiki/Wikipedia:Citation_needed&quot; rel=&quot;nofollow noreferrer&quot;&gt;evil&lt;/a&gt;. I'm not necessarily evil, but it helps to have an evil avatar so I don't get held responsible for my actions.&lt;/li&gt;&#xA;&lt;li&gt;They &lt;a href=&quot;https://en.wikipedia.org/wiki/Weasel#Cultural_meanings&quot; rel=&quot;nofollow noreferrer&quot;&gt;bring bad luck&lt;/a&gt;. Not necessarily a fact, but in some cultures or superstitions this is true.&lt;/li&gt;&#xA;&lt;li&gt;They're underappreciated. This means I'm assisting the world by creating awareness, and as a bonus not many weasel-related usernames are taken.&lt;/li&gt;&#xA;&lt;li&gt;They're &lt;a href=&quot;https://en.wikipedia.org/wiki/Mustelidae#Characteristics&quot; rel=&quot;nofollow noreferrer&quot;&gt;stinky&lt;/a&gt;. This did not influence my decision at all, but it doesn't hurt to mention it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;These may seem like reasons &lt;em&gt;not&lt;/em&gt; to like weasels, but there's a reason people still have cats as pets (weasels aren't often pets because they're wild and love to kill...fingers). In fact, weasels are kind of like cats in a squirrel-sized body.&lt;/p&gt;&#xA;&lt;p&gt;Some of these traits can be summed up in this hopefully-not-copyright-infringing clip:&#xA;&lt;a href=&quot;https://0x0.st/-X4C.gif&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;sources (from Youtube): Robert E. Fuller, Frisco68&quot;&gt;&lt;img src=&quot;https://0x0.st/-X4C.gif&quot; alt=&quot;weasels!&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;EDIT: Now I realize that to truly show my devotion, I must also change my pfp. This is it currently, though I change it a lot:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/zPEUz.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/zPEUz.png&quot; alt=&quot;Ermine/Weasel 16x16 picture&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="90614" LastEditorUserId="90614" LastEditDate="2021-02-22T16:24:28.303" LastActivityDate="2021-02-22T16:24:28.303" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20763" PostTypeId="2" ParentId="20722" CreationDate="2021-02-16T06:25:43.350" Score="2" Body="&lt;p&gt;Nothing, just using my nick name.&lt;/p&gt;&#xA;" OwnerUserId="92116" LastEditorUserId="92116" LastEditDate="2022-04-16T16:55:27.840" LastActivityDate="2022-04-16T16:55:27.840" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20764" PostTypeId="2" ParentId="20722" CreationDate="2021-02-16T09:31:30.390" Score="5" Body="&lt;p&gt;Oktupol is the german spelling for octupole, a magnetic field created by eight electric charges; four dipoles or two quadrupoles.&lt;/p&gt;&#xA;&lt;p&gt;I started using that name while experimenting with computer networks as a teenage child. I was interested in physics back then; when I needed to come up with host names for some virtual machines, I named them Monopol, Dipol and Quadrupol because I just read about those in a book.&lt;/p&gt;&#xA;&lt;p&gt;Eventually I hosted my first own website, and taking up on the scheme I established previously, I bought the domain &amp;quot;oktupol.de&amp;quot; and started using the name &amp;quot;oktupol&amp;quot; for myself everywhere on the internet.&lt;/p&gt;&#xA;" OwnerUserId="77034" LastEditorUserId="77034" LastEditDate="2021-02-16T12:02:41.227" LastActivityDate="2021-02-16T12:02:41.227" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20767" PostTypeId="1" CreationDate="2021-02-16T17:49:50.930" Score="2" ViewCount="138" Body="&lt;p&gt;&lt;a href=&quot;https://github.com/jcoehoorn/SlimSharp&quot; rel=&quot;nofollow noreferrer&quot;&gt;SlimSharp&lt;/a&gt; is a custom variant of C# intended to help with some of the worst pain points when using C# for Code Golf. It's something I've had in the back of my head for a while, and I finally took the time today to get it &amp;quot;on paper&amp;quot;, at least in a digital sense. &lt;strike&gt;However, so far that's the &lt;em&gt;only&lt;/em&gt; way it exists; there is no implementation.&lt;/strike&gt;&lt;/p&gt;&#xA;&lt;p&gt;SlimSharp won't keep up with some of the dedicated Code Golf or simple stack-based languages, but it should help reduce byte/character counts relative to other traditional languages.&lt;/p&gt;&#xA;&lt;p&gt;My goal listing it here is so if I use it in an answer others will be able to verify the program is correct (spot bugs and improvements, etc), even if they have to evaluate the code in their heads, and so we can compare apples-to-apples if others can want to use the same &amp;quot;shortcuts&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Update:&lt;/strong&gt; There is an implementation now, of sorts, and it is possible to run SlimSharp code. You can even &lt;a href=&quot;https://dotnetfiddle.net/DkPEcu&quot; rel=&quot;nofollow noreferrer&quot;&gt;try it on .Net Fiddle.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="58322" LastEditorUserId="58322" LastEditDate="2021-02-17T03:49:02.913" LastActivityDate="2021-02-17T03:49:02.913" Title="Introducing SlimSharp" Tags="|discussion|languages|" AnswerCount="0" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="20771" PostTypeId="2" ParentId="5243" CreationDate="2021-02-17T01:14:59.480" Score="3" Body="&lt;h1&gt;50-250 rep for first answers in &lt;a href=&quot;https://github.com/easyaspi314/thumbgolf&quot; rel=&quot;nofollow noreferrer&quot;&gt;ThumbGolf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;In celebration of ThumbGolf leaving pre-alpha, I will give the first &lt;a href=&quot;https://github.com/easyaspi314/thumbgolf&quot; rel=&quot;nofollow noreferrer&quot;&gt;ThumbGolf&lt;/a&gt; answer per user a bounty.&lt;/p&gt;&#xA;&lt;p&gt;I will be following similar rules to Adám's APL challenge.&lt;/p&gt;&#xA;&lt;p&gt;Specifically:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program must &lt;strong&gt;not&lt;/strong&gt; be a normal Thumb-2 program. It must make use of the ThumbGolf runtime.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Specifically, if I remove all ThumbGolf instructions, the program should not solve the challenge.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Only a user's first ThumbGolf answer will count.&lt;/li&gt;&#xA;&lt;li&gt;The user must not be a  New contributor to avoid giving the rep to alt accounts&lt;/li&gt;&#xA;&lt;li&gt;I will reward between &lt;strong&gt;50-250 rep&lt;/strong&gt; depending on how much I like the solution &lt;strong&gt;and its explanation.&lt;/strong&gt; Don't blow it on something lame.&lt;/li&gt;&#xA;&lt;li&gt;I will give this &lt;strong&gt;a maximum of 5 times&lt;/strong&gt; (unlike my ACE challenge). If the bounty will make me lose a privilege level, I will queue it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="94093" LastEditorUserId="94093" LastEditDate="2021-02-17T02:39:39.583" LastActivityDate="2021-02-17T02:39:39.583" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20773" PostTypeId="2" ParentId="2140" CreationDate="2021-02-17T11:33:30.477" Score="0" Body="&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;h2&gt;Book cipher&lt;/h2&gt;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Book_cipher&quot; rel=&quot;nofollow noreferrer&quot;&gt;Book cipher&lt;/a&gt; is a very unique method of a &lt;a href=&quot;https://en.wikipedia.org/wiki/Cipher&quot; rel=&quot;nofollow noreferrer&quot;&gt;encipher&lt;/a&gt;. Here's how's it done:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You have a book / a document or a article (something full of text, the more pages of text the better).&lt;/li&gt;&#xA;&lt;li&gt;You have a message to convey (a secret, of some sort)&lt;/li&gt;&#xA;&lt;li&gt;You simply-put read trough the text and the secret message &lt;em&gt;(may come from input, or reading it from 2 separate files)&lt;/em&gt; - split it into words &lt;em&gt;(so, separate spaces, commas and [dots])&lt;/em&gt; &lt;strong&gt;so,  ',' , '.' and spaces is the only requirement, how is not really that hugely important&lt;/strong&gt; and you keep the count of how many words there are in the text, now input the &lt;strong&gt;secret message &lt;em&gt;(note, the secret's words must be in the text, so if you secret was &amp;quot;My Secret&amp;quot; then, the words &amp;quot;My&amp;quot; and &amp;quot;Secrets&amp;quot; must both exist in the text.&lt;/em&gt;&lt;/strong&gt;) and output the position of the inputted &lt;strong&gt;secret message&lt;/strong&gt;. (E.g if the word &amp;quot;My&amp;quot; was nearly at the first page, maybe the 20th Word in the text, the program should print out '20'. Same with the word &amp;quot;Secrets&amp;quot;, if that maybe were later, (let say the 93th word in the text) then your program should print out '93'.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note the data type of input and output:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;output numbers: Integers.&lt;/p&gt;&#xA;&lt;p&gt;Input numbers: Integers&lt;/p&gt;&#xA;&lt;p&gt;( &lt;strong&gt;Excluding if the secret actually contains a number, then it does not need to be treated as a int. Can be a plus if it does but is not necessary.&lt;/strong&gt;)&lt;/p&gt;&#xA;&lt;h3&gt;Mini Example:&lt;/h3&gt;&#xA;&lt;p&gt;document.txt - file that contains text.&lt;/p&gt;&#xA;&lt;p&gt;Secret: &amp;quot;My Secret&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;(in the text, this is the 20th and the 93th word) (Note, this is only a made up secret, it is not from a real file, or a real input) a more better example is below.&lt;/p&gt;&#xA;&lt;h2&gt;Program input:&lt;/h2&gt;&#xA;&lt;p&gt;You enter &amp;quot;My Secret&amp;quot;&lt;/p&gt;&#xA;&lt;h2&gt;Program output:&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;20&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;93&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;code&gt;And, again - you enter those numbers(**Integers**):&lt;/code&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;20 93&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Program outputs:&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;My&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Secret&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;em&gt;this is just to show how input and outputs are related to each other.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;For reference (if needed) You have a Python3 implementation available at my GitHub page, to see a book cipher in action&#xA;here: &lt;a href=&quot;https://github.com/loneicewolf/Book-Cipher-Python&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub - Book cipher in Py3&lt;/a&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Why is this challenge interesting?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I personally think this is a educational (and interesting) challenge ( one might also exercise, because of how simple it might seem to make, but really took myself - literally &lt;strong&gt;years&lt;/strong&gt; to even &lt;strong&gt;know&lt;/strong&gt; &lt;strong&gt;how&lt;/strong&gt; &lt;strong&gt;to&lt;/strong&gt; &lt;strong&gt;implement&lt;/strong&gt; this correctly)&lt;/p&gt;&#xA;&lt;p&gt;Interesting article to get some background of what Cicada3301 is (&lt;strong&gt;not my site&lt;/strong&gt;) - &lt;a href=&quot;https://www.clevcode.org/cicada-3301/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.clevcode.org/cicada-3301/&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Cicada_3301&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia: Cicada3301&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I created this challenge both to, see other peoples methods of solving this (you are free to use any programming language!) and also - how long it would take others (For me, really I think it took more than 4 years actually - even in Python3. It looks simple but, for me - &lt;em&gt;really not&lt;/em&gt;)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A motivating fact: There are &lt;strong&gt;still&lt;/strong&gt; so little info (especially on example codes) on the internet(at least by the time writing this challenge)  about just, book cipher &lt;em&gt;&lt;strong&gt;implementations&lt;/strong&gt;&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;I would highly suggest making dedicated functions for this challenge&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;(instead of writing all code in the main() function - but it's totally fine to have it all in main!)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Operation:&lt;/h3&gt;&#xA;&lt;p&gt;Here's how the program should read, process, and output the result:&lt;/p&gt;&#xA;&lt;p&gt;First, take the text (the book/document, with the lots of text, (&lt;strong&gt;not the secret&lt;/strong&gt;))&#xA;and:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note: The text can either be entered or read from a file. You choose this.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;read it (From a file, or enter it as input)&lt;/li&gt;&#xA;&lt;li&gt;split it into words (by, I.e detecting '.', spaces(' '), and commas ',')&#xA;(Or if you already have split the input &amp;amp; are ready to move on to step 3, do that :) )&lt;/li&gt;&#xA;&lt;li&gt;count the number of words.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Repeat this process with the Secret input part.&lt;/p&gt;&#xA;&lt;p&gt;So, the input secret part should be:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;read it (from, again a file or enter it as input)&lt;/li&gt;&#xA;&lt;li&gt;split it (i.e if your input was &amp;quot;My Secret&amp;quot; - split it into words like so: &amp;quot;My&amp;quot; &amp;quot;Secret&amp;quot;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;My Python3 implementation only separate spaces.&lt;/h3&gt;&#xA;&lt;p&gt;The Key sequence - this is the n&lt;em&gt;th&lt;/em&gt; words  your text contains, e.g the 93th word in above example &amp;quot;Secrets&amp;quot;.&lt;/p&gt;&#xA;&lt;h3&gt;The winner will be chosen by how short the code is. (So, the shortest code = &lt;strong&gt;win&lt;/strong&gt;)&lt;/h3&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;&lt;code&gt;example file used 'document1.txt'in this section is available at the GitHub page. &lt;/code&gt;&#xA;&lt;code&gt;as well as the Python3 file used in the example below. &lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;The output of your program should match the output of the Python3 program.&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Input:&lt;/h1&gt;&#xA;&lt;p&gt;&lt;code&gt;python3 bookcipher.py&lt;/code&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;input text: a house with a Bob inside&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Output:&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;you entered these words:&#xA;['a', 'house', 'with', 'a', 'Bob', 'inside']&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;2&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;3&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;5&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;2&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;0&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;30&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Input again: (decrypting)&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;input key-sequence sep. With spaces: 2 3 5 2 0 30&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;a&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;house&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;with&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;a&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Bob&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;inside&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="98601" LastEditorUserId="98601" LastEditDate="2021-02-18T19:25:12.370" LastActivityDate="2021-02-18T19:25:12.370" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="20774" PostTypeId="2" ParentId="5243" CreationDate="2021-02-17T19:50:08.480" Score="2" Body="&lt;h1&gt;50 rep for each first sed answer&lt;/h1&gt;&#xA;&lt;p&gt;If these conditions are met:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Giving away this bounty does not make me go below 400 rep.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The question has at least 3 total upvotes&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The answer is the first answer for that question&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It's not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The answer has at least 1 total upvote&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I approve (I probably will)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The answer is in POSIX or Gnu sed, and I'm less likely to award the bounty if it uses &lt;code&gt;e&lt;/code&gt; unnecessarily.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="90614" LastActivityDate="2021-02-17T19:50:08.480" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="20775" PostTypeId="2" ParentId="2140" CreationDate="2021-02-18T00:13:52.043" Score="0" Body="&lt;h1&gt;Subbasis. Generate. Discrete?&lt;/h1&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Given finitely many finite sets, interpret them as a subbasis to generate a space, and decide whether the resulting topology is discrete.&lt;/p&gt;&#xA;&lt;h2&gt;Introduction to Topology&lt;/h2&gt;&#xA;&lt;p&gt;Given a set &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt;, a &lt;strong&gt;topology&lt;/strong&gt; &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{T}\$&lt;/span&gt; over &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt; is a subset of the power set &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{P}(X)\$&lt;/span&gt; such that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\emptyset, X \in \mathcal{T}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For all &lt;span class=&quot;math-container&quot;&gt;\$\space \mathcal{U} \subset \mathcal{T}\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$\bigcup\mathcal{U} \in \mathcal{T}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For all &lt;span class=&quot;math-container&quot;&gt;\$Y_1, Y_2 \in \mathcal{T}\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$Y_1 \cap Y_2 \in \mathcal{T}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Members of a topology are said to be &lt;strong&gt;open&lt;/strong&gt;. So the rules above in plaintext are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The empty set and &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt; itself are open.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The union of arbitrarily many open sets is open.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The intersection of finitely many open sets is open.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Endowed with a topology, &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt; is said to be a (topological) &lt;strong&gt;space&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{T} = \mathcal{P}(X)\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{T}\$&lt;/span&gt; is said to be &lt;strong&gt;discrete&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Basis and Subbasis&lt;/h2&gt;&#xA;&lt;p&gt;A subset &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{B}\$&lt;/span&gt; of the power set &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{P}(X)\$&lt;/span&gt; is said to be a &lt;strong&gt;basis&lt;/strong&gt; (pl. &lt;strong&gt;bases&lt;/strong&gt;) of a set &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt; if:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;For all &lt;span class=&quot;math-container&quot;&gt;\$x \in X\$&lt;/span&gt;, there exists &lt;span class=&quot;math-container&quot;&gt;\$B \in \mathcal{B}\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$x \in B\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For all &lt;span class=&quot;math-container&quot;&gt;\$B_1, B_2 \in \mathcal{B}\$&lt;/span&gt;, there exists &lt;span class=&quot;math-container&quot;&gt;\$C \in \mathcal{B}\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$C \subset B_1 \cap B_2\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;We take every subset &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{U} \subset \mathcal{B}\$&lt;/span&gt; and declare &lt;span class=&quot;math-container&quot;&gt;\$\bigcup\mathcal{U}\$&lt;/span&gt; to be open to &lt;strong&gt;generate&lt;/strong&gt; a topology &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{T}\$&lt;/span&gt;. Note that &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{B} \subset \mathcal{T}\$&lt;/span&gt; always holds.&lt;/p&gt;&#xA;&lt;p&gt;If we omit the second requirement, we have a &lt;strong&gt;subbasis&lt;/strong&gt; of &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt;. A subbasis generates a topology by also declaring the intersection of &lt;em&gt;finitely&lt;/em&gt; many members to be open.&lt;/p&gt;&#xA;&lt;h2&gt;Input and Output&lt;/h2&gt;&#xA;&lt;p&gt;Given a set of finitely many finite sets &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{S}\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt; shall be implicitly defined as &lt;span class=&quot;math-container&quot;&gt;\$\bigcup\mathcal{S}\$&lt;/span&gt;. Note that by this, the first requirement for bases always holds.&lt;/p&gt;&#xA;&lt;p&gt;The input/output format is flexible. In every case, inputs that don't fit in your input format fall in &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;h3&gt;Truthy&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\emptyset\$&lt;/span&gt; (Generates &lt;span class=&quot;math-container&quot;&gt;\$X = \emptyset\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{T} = \{\emptyset\}\$&lt;/span&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\{\emptyset\}\$&lt;/span&gt; (Ditto)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\{\{0\}\}\$&lt;/span&gt; (Generates &lt;span class=&quot;math-container&quot;&gt;\$X = \{0\}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{T} = \{\emptyset, \{0\}\}\$&lt;/span&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\{\emptyset,\{0\}\}\$&lt;/span&gt; (Ditto)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\{\{1\}\}\$&lt;/span&gt; (Generates &lt;span class=&quot;math-container&quot;&gt;\$X = \{1\}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{T} = \{\emptyset, \{1\}\}\$&lt;/span&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\{\{0\},\{1\}\}\$&lt;/span&gt; (Generates &lt;span class=&quot;math-container&quot;&gt;\$X = \{0,1\}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{T} = \{\emptyset, \{0\},\{1\},\{0,1\}\}\$&lt;/span&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\{\{0\},\{1\},\{0,1\}\}\$&lt;/span&gt; (Ditto)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\{\{0\},\{1\},\{2\}\}\$&lt;/span&gt; (Generates &lt;span class=&quot;math-container&quot;&gt;\$X = \{0,1,2\}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{T} = \{\emptyset, \{0\},\{1\},\{2\},\{0,1\},\{0,2\},\{1,2\},\{0,1,2\}\}\$&lt;/span&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\{\{0,1\},\{0,2\},\{1,2\}\}\$&lt;/span&gt; (Ditto)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Falsy&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\{\{0,1\}\}\$&lt;/span&gt; (Generates &lt;span class=&quot;math-container&quot;&gt;\$X = \{0,1\}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{T} = \{\emptyset,\{0,1\}\}\$&lt;/span&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\{\{0,1\},\{1\}\}\$&lt;/span&gt; (Generates &lt;span class=&quot;math-container&quot;&gt;\$X = \{0,1\}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{T} = \{\emptyset,\{1\},\{0,1\}\}\$&lt;/span&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\{\{0\},\{1,2\}\}\$&lt;/span&gt; (Generates &lt;span class=&quot;math-container&quot;&gt;\$X = \{0,1,2\}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{T} = \{\emptyset, \{0\},\{1,2\},\{0,1,2\}\}\$&lt;/span&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\{\{0,1\},\{1\},\{2\}\}\$&lt;/span&gt; (Generates &lt;span class=&quot;math-container&quot;&gt;\$X = \{0,1,2\}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\mathcal{T} = \{\emptyset, \{1\},\{2\},\{0,1\},\{1,2\},\{0,1,2\}\}\$&lt;/span&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2021-02-18T22:28:51.870" LastActivityDate="2021-02-18T22:28:51.870" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="20776" PostTypeId="2" ParentId="20722" CreationDate="2021-02-18T04:54:22.700" Score="7" Body="&lt;p&gt;&lt;s&gt;What can I say - I'm not creative. &lt;/s&gt; I'm still not very creative.&lt;/p&gt;&#xA;&lt;p&gt;To avoid confusion, it should be pronounced &amp;quot;bread&amp;quot;&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-02-06T20:23:32.760" LastActivityDate="2022-02-06T20:23:32.760" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20777" PostTypeId="2" ParentId="2140" CreationDate="2021-02-18T17:22:58.123" Score="2" Body="&lt;h2&gt;&lt;strike&gt;Snail word&lt;/strike&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Very similar to other challenges&lt;/p&gt;&#xA;" OwnerUserId="99744" LastEditorUserId="99744" LastEditDate="2021-02-19T11:02:07.840" LastActivityDate="2021-02-19T11:02:07.840" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20778" PostTypeId="2" ParentId="2140" CreationDate="2021-02-18T20:20:12.237" Score="1" Body="&lt;h1&gt;Stack half full or half empty? &lt;i&gt;(worldview of a programming language)&lt;/i&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Is the glass half full or half empty?&#xA;It's a common rethoric question to determine a person worldview, which can be optimistic or pessimistic based on the answer given.&#xA;If i were dealing with a machine i would probably ask &amp;quot;Is the stack half full or half empty?&amp;quot;&#xA;Let's try and see if programming languages have a worldview too.&lt;/p&gt;&#xA;&lt;p&gt;Write a full program or a function which prints or returns one of &amp;quot;The stack is half full.&amp;quot; or &amp;quot;The stack is half empty.&amp;quot; when given as input the question &amp;quot;Is the stack half full or half empty?&amp;quot; but wait.. you have to provide a stack to be observed.. which stack you provide is up to you: input one or check an already existing stack.&#xA;Your solution will then output one of the two sentences mentioned above for a non empty / non full stack, your choice which one to print, just make sure your answer is as short as possible because this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&#xA;For an empty stack it must produce the &amp;quot;empty&amp;quot; output while for a full stack &amp;quot;full&amp;quot;.&lt;/p&gt;&#xA;&lt;h1&gt;Survey&lt;/h1&gt;&#xA;&lt;p&gt;I will make a chart of the pessimistic Vs optimistic languages based on the half outputs.&#xA;If you find the same byte count for both choices you can provide both, in which case they will count on both sides of the chart, but you just can select one if you like.&lt;/p&gt;&#xA;&lt;h2&gt;input&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A sentence in any reasonable method.&lt;/li&gt;&#xA;&lt;li&gt;The behavior is defined only for the question &amp;quot;Is the stack half full or half empty?&amp;quot; and exactly this.&lt;/li&gt;&#xA;&lt;li&gt;Indeed your solution can also completely ignore the input as long as it works with the specified input.&lt;/li&gt;&#xA;&lt;li&gt;Question mark is mandatory.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;output&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;One of &amp;quot;The stack is half full.&amp;quot; or &amp;quot;The stack is half empty.&amp;quot;, for a non full / non empty stack.&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;full&amp;quot; or &amp;quot;empty&amp;quot; for a full stack or an empty stack respectively&lt;/li&gt;&#xA;&lt;li&gt;upper / lower case or a mix are fine.&lt;/li&gt;&#xA;&lt;li&gt;ending dot not mandatory.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Only the mentioned input allowed.&lt;/li&gt;&#xA;&lt;li&gt;Loopholes allowed.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and the answer with the fewer bytes of source code wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="84844" LastEditorUserId="84844" LastEditDate="2021-02-21T18:39:02.783" LastActivityDate="2021-02-21T18:39:02.783" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="20779" PostTypeId="2" ParentId="2140" CreationDate="2021-02-19T02:30:37.180" Score="-2" Body="&lt;h1&gt;English Grammar Checker&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/natural-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;natural-language&amp;#39;&quot; rel=&quot;tag&quot;&gt;natural-language&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grammars&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grammars&amp;#39;&quot; rel=&quot;tag&quot;&gt;grammars&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Being tired of checking English grammar, I decided to write an English grammar regular expression.&lt;/p&gt;&#xA;&lt;h2&gt;Notations&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;All capital letters denote an expression.&lt;/li&gt;&#xA;&lt;li&gt;Quoted strings (like &lt;code&gt;&amp;quot;a&amp;quot;&lt;/code&gt;) and lower-case letters denotes literals.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;AB&lt;/code&gt; means concatenating expressions / literals &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt; together.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(...)&lt;/code&gt; groups the expression inside the parentheses, as a whole expression.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;A*&lt;/code&gt; means repeating the expression &lt;code&gt;A&lt;/code&gt; zero or more times.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;A?&lt;/code&gt; means the expression &lt;code&gt;A&lt;/code&gt; is optional here.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;A|B&lt;/code&gt; means either &lt;code&gt;A&lt;/code&gt; or &lt;code&gt;B&lt;/code&gt; can be placed here.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;A=B&lt;/code&gt; means all expression &lt;code&gt;A&lt;/code&gt; should be replaced by &lt;code&gt;B&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Grammatical Rules&lt;/h2&gt;&#xA;&lt;h3&gt;Parts of Speech&lt;/h3&gt;&#xA;&lt;p&gt;For simplicity, all parts of speech are substituted using symbols.&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Symbol&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Part of Speech&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;a&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;article&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;b&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;verb&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;j&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;adjective&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;m&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;numeral&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;n&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;noun&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;r&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;pronoun&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;v&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;adverb&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&lt;p&gt;There's a whole bunch of rules in English grammar. For simplicity,  I only chose a tip of the iceberg.&#xA;Your RegEx should &lt;em&gt;only&lt;/em&gt; match all valid &lt;code&gt;S&lt;/code&gt;'s.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;S=N+V&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;N=((a|m)?j*n(pN)?)|r&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;V=b((pN)*|N)?v?&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th style=&quot;text-align: left;&quot;&gt;These should be matched&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;Real-life example&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;anb&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;The man runs&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;rbpajjnv&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;He dives into the deep blue sea quickly&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;anpanbpr&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;The wave on the sea came towards me&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;mnpambv&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;Two friends of the man walks slowly&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;anpmjjnbajjnv&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;The robot of two tall thin girls greets the young handsome man repeatedly&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th style=&quot;text-align: left;&quot;&gt;These shouldn't be matched&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;Real-life &amp;quot;wrong&amp;quot; sentences example&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;nn&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;Man child&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;nabr&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;Student a told me&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;arbv&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;The you laughed happily&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;anbvv&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;The woman sang slowly beautifully&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;rbvj&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;He is very funny&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;&lt;em&gt;Notice that&lt;/em&gt; the last example &lt;em&gt;is&lt;/em&gt; a valid English sentence, but it doesn't match our simplified rules. You shouldn't match them.&lt;/p&gt;&#xA;&lt;h2&gt;Tips&lt;/h2&gt;&#xA;&lt;p&gt;You can assume that there's no whitespaces and line feeds in the input.&lt;/p&gt;&#xA;&lt;p&gt;You can assume that you only need to match 1 input per time.&lt;/p&gt;&#xA;&lt;p&gt;You can use any RegEx dialects &lt;strong&gt;no newer than this challenge&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Your score is the bytes in your RegEx. Flags are not counted.&lt;/p&gt;&#xA;&lt;p&gt;The least score wins!&lt;/p&gt;&#xA;" OwnerUserId="100635" LastEditorUserId="100635" LastEditDate="2021-02-23T02:55:43.003" LastActivityDate="2021-02-23T02:55:43.003" CommentCount="18" ContentLicense="CC BY-SA 4.0" />
  <row Id="20780" PostTypeId="2" ParentId="2140" CreationDate="2021-02-19T22:54:27.160" Score="0" Body="&lt;h1&gt;Decode an 8086 MOD R/M&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/bitwise&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;bitwise&amp;#39;&quot; rel=&quot;tag&quot;&gt;bitwise&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I think this &lt;em&gt;might&lt;/em&gt; be fun. Or, it might be torture, idk.  If this is popular, I might add a sequel for the significantly more complex 32-bit encoding &lt;/p&gt;&#xA;&lt;p&gt;Time for a mini objdump.&lt;/p&gt;&#xA;&lt;p&gt;An 8086 MOD R/M field is laid out like so:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;MOD  REG  R/M |  OPTIONAL DISPLACEMENTS&#xA;mm   rrr  rrm | (iiiiiiii) | (iiiiiiii)&#xA;76   543  210 |  76543210  |  76543210&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;REG is a register. Quite unintuitively, the register names are not in alphabetical order.&lt;/p&gt;&#xA;&lt;p&gt;Note that you can safely assume a word register, not a half byte register, and that the destination is a register.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;REG |  0 |  1 |  2 |  3 |  4 |  5 |  6 |  7 |&#xA;Name| AX | CX | DX | BX | SP | BP | SI | DI |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;MOD determines the length and format of the instruction.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;MOD | FORMAT&#xA; 0  | [MEM] or [ADDR]&#xA; 1  | [MEM+/-disp8] (signed 8-bit immediate)&#xA; 2  | [MEM+/-disp16] (signed 16-bit little endian immediate)&#xA; 3  | REG&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;MEM is parsed as so:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;MEM  |    0    |    1    |    2    |    3    |   4  |   5  |   6   |   7  |&#xA;Name | [BX+SI] | [BX+DI] | [BP+SI] | [BP+DI] | [SI] | [DI] | [BP]* | [BX] |&#xA;*when MOD==0, [BP] is replaced by an absolute 16-bit address.&#xA;&#xA;Just [BP] is encoded as [BP+0].&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;I am going to &lt;a href=&quot;https://gist.github.com/seanjensengrey/f971c20d05d4d0efc0781f2f3c0353da&quot; rel=&quot;nofollow noreferrer&quot;&gt;represent MOD R/M as octal&lt;/a&gt;, and addresses/displacements as hex. It really bugs me how few people write it this way, as it makes much more sense.&lt;/p&gt;&#xA;&lt;p&gt;So, for example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;MOD  r  r/m&#xA; 3   0    0&#xA;reg  |    |&#xA;    AX,  AX&#xA;&#xA; 0   2    0&#xA;mem  |    |&#xA;    DX,[BX+SI]&#xA;&#xA; 1   3   7 , 23&#xA;M+D8 |   |   |&#xA;    BX, [BX+0x23]&#xA;&#xA; 2   2   1 , BC 6A&#xA;M+D16|   |    | /&#xA;    DX,[BX+DI+0x6ABC]&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may take your input as a packed integer, byte array, string in any mix of bases, or whatever. I'm not picky. I personally wrote them as mixed hex and octal.&lt;/li&gt;&#xA;&lt;li&gt;You will always get 3 bytes, &lt;strong&gt;however&lt;/strong&gt;, in true objdump spirit, &lt;strong&gt;those extra bytes will be random&lt;/strong&gt;. The first byte is all you need to determine the length.&lt;/li&gt;&#xA;&lt;li&gt;Not all cases will be the most efficient encoding.&lt;/li&gt;&#xA;&lt;li&gt;In the output:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It may be returned as a single string, or printed.&lt;/li&gt;&#xA;&lt;li&gt;It is case insensitive&lt;/li&gt;&#xA;&lt;li&gt;It can have excess spaces or tabs, but it must be on one line.&lt;/li&gt;&#xA;&lt;li&gt;It can have an optional trailing newline&lt;/li&gt;&#xA;&lt;li&gt;Displacements and addresses can be in any base, however, do note that displacements are signed two's complement and will be subtracted if negative. So, for &lt;code&gt;100 FF&lt;/code&gt;, &lt;code&gt;AX,[BX+SI+0xFF]&lt;/code&gt; is wrong.&lt;/li&gt;&#xA;&lt;li&gt;Leading zeroes and displacements of zero are fine.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Test cases (irrelevant bytes are in italics):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;300 &lt;i&gt;73 A2&lt;/i&gt; -&gt; AX,AX&#xA;312 &lt;i&gt;01 82&lt;/i&gt; -&gt; CX,DX&#xA;337 &lt;i&gt;3E 1C&lt;/i&gt; -&gt; BX,DI&#xA;020 &lt;i&gt;24 AF&lt;/i&gt; -&gt; DX,[BX+SI]&#xA;137 23 &lt;i&gt;6B&lt;/i&gt; -&gt; BX,[BX+0x23]&#xA;066 34 21 -&gt; SI,[0x1234]&#xA;166 00 &lt;i&gt;10&lt;/i&gt; -&gt; SI,[BP+0x00]&#xA;221 BC 6A -&gt; DX,[BX+DI+0x6ABC]&#xA;124 FF &lt;i&gt;EF&lt;/i&gt; -&gt; CX,[SI-0x01]&#xA;224 FF FF -&gt; CX,[SI-0x0001]&#xA;240 00 00 -&gt; SP,[BX+SI+0x0000]&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="94093" LastEditorUserId="94093" LastEditDate="2021-02-20T10:42:57.090" LastActivityDate="2021-02-20T10:42:57.090" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20781" PostTypeId="2" ParentId="20722" CreationDate="2021-02-20T05:56:04.750" Score="6" Body="&lt;p&gt;&lt;strong&gt;My username&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&amp;quot;sporeball&amp;quot; was essentially generated by brute force. I wanted something simple yet decently interesting, but I'm terrible at coming up with good ideas, so a couple of years ago I wrote a little bit of JavaScript to make up names for me.&lt;/p&gt;&#xA;&lt;p&gt;The code first populates an array with 114 words I picked out by hand (&lt;code&gt;star&lt;/code&gt;, &lt;code&gt;rice&lt;/code&gt;, &lt;code&gt;cloak&lt;/code&gt;, &lt;code&gt;ocean&lt;/code&gt;, &lt;code&gt;pants&lt;/code&gt;, &lt;code&gt;knuckle&lt;/code&gt;, &lt;code&gt;coffee&lt;/code&gt;, etc.) Then, at the push of a button, it picks two random words from the array and concatenates them! Simple as that.&lt;/p&gt;&#xA;&lt;p&gt;After a few minutes of clicking, the string &lt;code&gt;sporeball&lt;/code&gt; came out, and the rest is history.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;My avatar&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;In January of this year, a friend of mine drew a picture of me in my signature purple cat costume (yes, I have a cat costume) as a present for my 17th birthday. I loved it so much that I immediately asked her if I could use it as my new avatar,* and she agreed.&lt;/p&gt;&#xA;&lt;p&gt;My friend replaced the drawing's original white background with that nice lavender one, a hex code chosen for its similarity to my website's background color, and I cropped the drawing, which was originally from the waist up, to a 400x400 headshot. Closer to March, I asked if I could have it updated to reflect my change from rectangular glasses to circular ones; this new version, which also depicts slightly longer hair, is the one currently in use on this site.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;* My previous avatar was created with the &lt;a href=&quot;https://picrew.me/image_maker/65495&quot; rel=&quot;nofollow noreferrer&quot;&gt;Snout Folk image maker&lt;/a&gt; on Picrew.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="91030" LastEditorUserId="91030" LastEditDate="2021-02-26T21:20:19.273" LastActivityDate="2021-02-26T21:20:19.273" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20782" PostTypeId="2" ParentId="2140" CreationDate="2021-02-20T08:29:11.430" Score="1" Body="&lt;h1&gt;Bytewise look-and-say sequence &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The look-and-say sequence is a sequence which begins with &lt;code&gt;1, 11, 21, 1211, 111221, 312211&lt;/code&gt;.&#xA;To get a term of the sequence from the previous, read the previous out literally:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;312211 =&amp;gt; one three, one one, two twos,two ones =&amp;gt; 13112221&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;So the next term is &lt;code&gt;13112221&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Given this javascript code (Node.js), which outputs the look-and-say sequence indefinitely, delimited by newlines:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;function nextTerm(x){&#xA;  return x.replace(/(.)\1*/g,z=&amp;gt;z.length+z[0])&#xA;}&#xA;function printUpTo(x){&#xA;  var str = '1';&#xA;  for(var i = 0; i &amp;lt; x; i++){&#xA;    console.log(str);str = nextTerm(str);&#xA;  }&#xA;}&#xA;printUpTo(Infinity)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;It will output a string that begins &lt;code&gt;1\n11\n21\n1211\n111221&lt;/code&gt; etcetera. Your job is to write a function that takes a number as input and outputs that byte of the output string.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;You may output a different character for newline instead of \n, e.g. # or something.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Your program should be able to handle 100 million.&lt;/p&gt;&#xA;&lt;p&gt;The first answer to handle 1e+18 correctly will receive a 100-rep bounty. This cannot be hard-coded.&lt;/p&gt;&#xA;&lt;p&gt;Standard loopholes apply.&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 =&amp;gt; \n&#xA;5 =&amp;gt; 2&#xA;10 =&amp;gt; 1&#xA;20 =&amp;gt; 3&#xA;50 =&amp;gt; 3&#xA;100 =&amp;gt; 1&#xA;1000 =&amp;gt; 1&#xA;100000 =&amp;gt; 3&#xA;10000000 =&amp;gt; 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2021-02-23T05:23:07.250" LastActivityDate="2021-02-23T05:23:07.250" CommentCount="22" ContentLicense="CC BY-SA 4.0" />
  <row Id="20783" PostTypeId="2" ParentId="2140" CreationDate="2021-02-20T09:51:05.453" Score="1" Body="&lt;h1&gt;Self improving program&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this challenge you will write a program or function which when run will output a faster solution to this challenge.&lt;/p&gt;&#xA;&lt;p&gt;Formally speaking: you will write a program or function, &lt;span class=&quot;math-container&quot;&gt;\$T_0\$&lt;/span&gt;, which takes an integer &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; as input and outputs a program or function (in the same language), &lt;span class=&quot;math-container&quot;&gt;\$T_1\$&lt;/span&gt;, which is itself a valid solution to this challenge, such that there exists a function &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$T_1\$&lt;/span&gt; is in the time complexity class &lt;span class=&quot;math-container&quot;&gt;\$O\left(f\right)\$&lt;/span&gt;,  but &lt;span class=&quot;math-container&quot;&gt;\$T_0\$&lt;/span&gt; is not.  That is to say the output program must have a strictly faster asymptotic time complexity.&lt;/p&gt;&#xA;&lt;p&gt;Note that since &lt;span class=&quot;math-container&quot;&gt;\$T_1\$&lt;/span&gt; must be a valid solution to the challenge it must output a program or function &lt;span class=&quot;math-container&quot;&gt;\$T_2\$&lt;/span&gt; which is even faster, and so on and so forth, creating an infinite chain each faster than the last.&lt;/p&gt;&#xA;&lt;p&gt;Answers will be scored by their length in bytes with fewer being better.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Precision&lt;/h1&gt;&#xA;&lt;p&gt;In keeping with the tradition of this site, and to remain inclusive: The order notation of a function will be assumed to be measured by &lt;em&gt;the algorithm implemented&lt;/em&gt; by your answer.  Thus we will pretend not to notice the behavior of your actual program for inputs out of the range of your language's numeric type.&lt;/p&gt;&#xA;&lt;p&gt;However that being said, in order to ensure that you are actually changing the algorithm at every step, for constants initialized in your program this leniency is not given.  e.g. If you use a double precision floating point &lt;code&gt;1.0000000000000001&lt;/code&gt; is equal to &lt;code&gt;1.0&lt;/code&gt;. So if your method relies on an increasing or decreasing constant embedded in the program you should be careful that the algorithm actually changes.&lt;/p&gt;&#xA;&lt;p&gt;Simply put for &lt;span class=&quot;math-container&quot;&gt;\$T_n(x)\$&lt;/span&gt; you are forgiven for errors arising from very large &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;, but not from very large &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2021-02-23T13:28:41.463" LastActivityDate="2021-02-23T13:28:41.463" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="20786" PostTypeId="2" ParentId="2140" CreationDate="2021-02-20T17:41:42.163" Score="-3" Body="&lt;h1&gt;Google search&lt;/h1&gt;&#xA;&lt;p&gt;Challenge is very simple, you have to get a string as input and then launch the default web browser, and search for that string in Google.&lt;/p&gt;&#xA;&lt;p&gt;Input string will have only characters &lt;code&gt;a-zA-Z&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Google search URL is &lt;code&gt;google.com/search?q=querystring&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Standard loopholes apply, Internet connection allowed, but only to &lt;code&gt;google.com&lt;/code&gt; domain&lt;/p&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;,&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Author note: challenge title sucks, please improve it!&lt;/p&gt;&#xA;" OwnerUserId="92116" LastEditorUserId="92116" LastEditDate="2021-02-24T17:29:26.937" LastActivityDate="2021-02-24T17:29:26.937" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="20787" PostTypeId="2" ParentId="2140" CreationDate="2021-02-20T17:48:40.573" Score="-3" Body="&lt;h1&gt;Enumerate all possible IPv4 addresses&lt;/h1&gt;&#xA;&lt;p&gt;Title might make the challenge hard, but it's easy.&lt;/p&gt;&#xA;&lt;p&gt;You have to print all the possible IPv4 addresses from 0.0.0.0 to 255.255.255.255&lt;/p&gt;&#xA;&lt;p&gt;Standard loopholes apply, no internet usage for this&lt;/p&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;,&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;,&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="92116" LastActivityDate="2021-02-20T17:48:40.573" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20788" PostTypeId="2" ParentId="2140" CreationDate="2021-02-20T17:56:22.920" Score="-1" Body="&lt;h1&gt;Print your PPCG avatar&lt;/h1&gt;&#xA;&lt;p&gt;This is a graphical output question.&lt;/p&gt;&#xA;&lt;p&gt;You have to connect to the &lt;code&gt;codegolf.stackexchange.com&lt;/code&gt; in your homepage, scrape and download your avatar and show it in your default image viewer or some other way.&lt;/p&gt;&#xA;&lt;p&gt;Standard loopholes apply, connections only allowed to &lt;code&gt;codegolf.stackexchange.com&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;One language can be only used once, but a user can post multiple answers in different language&lt;/p&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;,&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;,&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="92116" LastActivityDate="2021-02-20T17:56:22.920" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20789" PostTypeId="2" ParentId="5243" CreationDate="2021-02-21T17:07:26.047" Score="3" Body="&lt;h1&gt;50-200 rep for interesting &lt;a href=&quot;https://www.zsh.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;zsh&lt;/a&gt; answers&lt;/h1&gt;&#xA;&lt;p&gt;I will award this if:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the answer is interesting&lt;/li&gt;&#xA;&lt;li&gt;you have not been awarded this bounty before&lt;/li&gt;&#xA;&lt;li&gt;it will not cause me to go below a privilege level&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Possible bonuses if:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a particularly good explanation is provided&lt;/li&gt;&#xA;&lt;li&gt;it is the first answer to the question&lt;/li&gt;&#xA;&lt;li&gt;it out-golfs me&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-06-06T16:41:23.500" LastActivityDate="2022-06-06T16:41:23.500" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20790" PostTypeId="2" ParentId="2140" CreationDate="2021-02-22T08:33:21.607" Score="0" Body="&lt;h3&gt;Posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/219693/upper-case-%d1%81l%d0%besed&quot;&gt;link&lt;/a&gt;&lt;/h3&gt;&#xA;" OwnerUserId="99744" LastEditorUserId="99744" LastEditDate="2021-02-24T09:21:18.407" LastActivityDate="2021-02-24T09:21:18.407" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20791" PostTypeId="2" ParentId="20722" CreationDate="2021-02-22T16:39:35.753" Score="11" Body="&lt;p&gt;I just used my first name when I joined Stack Exchange and never changed it.&lt;/p&gt;&#xA;&lt;p&gt;It's a less common form of &lt;strong&gt;Arnaud&lt;/strong&gt; (without an &amp;quot;L&amp;quot;) but is however pronounced the same way, i.e. &lt;strong&gt;\aʁ.no\&lt;/strong&gt; (and not &lt;strong&gt;\aʁ.nɔld\&lt;/strong&gt; like &amp;quot;Arnold&amp;quot;).&lt;/p&gt;&#xA;&lt;p&gt;I went by the nickname &amp;quot;Axl&amp;quot; many years ago as the sysop of a BBS running on an Atari 520 ST during the pre-Internet era. (Yeah... Like the singer of a famous hard rock band from Los Angeles. :-p)&lt;/p&gt;&#xA;" OwnerUserId="58563" LastActivityDate="2021-02-22T16:39:35.753" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20795" PostTypeId="2" ParentId="2140" CreationDate="2021-02-22T23:46:56.093" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/219631/remove-nth-occurrences&quot;&gt;Remove Nth occurrences&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-02-24T00:08:42.013" LastActivityDate="2021-02-24T00:08:42.013" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20796" PostTypeId="2" ParentId="2140" CreationDate="2021-02-23T02:38:40.650" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/220032/66833&quot;&gt;Generalise perfect numbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-03-01T15:44:38.493" LastActivityDate="2021-03-01T15:44:38.493" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20798" PostTypeId="2" ParentId="2140" CreationDate="2021-02-24T03:23:18.573" Score="-1" Body="&lt;h1&gt;Output function from one to another&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I tried to post this twice and I gained negative feedback, so I will put what I have in mind here if anyone is interested.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Get a certain output function from one programming language and transfer to another. You'll be recreating an output function that came from a different programming language. There is a certain criteria in order for the answer to be valid:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;strong&gt;It should function the same way as the original function.&lt;/strong&gt; All things that function can do should be applied to the recreated one. For example, Python's &lt;code&gt;print()&lt;/code&gt; has certain keywords like &lt;code&gt;end&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Syntax doesn't matter.&lt;/strong&gt; Example, if you can't use the &lt;code&gt;&amp;lt;&amp;lt;&lt;/code&gt; for &lt;code&gt;cout&lt;/code&gt;, don't use it. Use what's available.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;The function should be able to output the same errors like the original.&lt;/strong&gt; Replicate the same errors from the original function. If impossible, leave it out.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;An answer example would be making &lt;code&gt;printf()&lt;/code&gt; from C using Python or making &lt;code&gt;Console.WriteLine()&lt;/code&gt; (or just &lt;code&gt;WriteLine()&lt;/code&gt; if incapable) from C# using Ruby. Any output functions that are already similar to 2 languages don't need to be replicated in any of them.&lt;/p&gt;&#xA;" OwnerUserId="99626" LastEditorUserId="99626" LastEditDate="2021-02-26T02:22:46.667" LastActivityDate="2021-02-26T02:22:46.667" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="20799" PostTypeId="2" ParentId="2140" CreationDate="2021-02-24T06:13:42.623" Score="0" Body="&lt;h1&gt;Create a QR quine&lt;/h1&gt;&#xA;&lt;p&gt;(a &amp;quot;qruine&amp;quot; if you will)&lt;/p&gt;&#xA;&lt;p&gt;Design a QR code that legibly spells with its pixels (or the space between them) the text that it scans to.&lt;/p&gt;&#xA;&lt;p&gt;For example, this QR code scans to the letter A, and also spells out A in white:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/uD18h.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/uD18h.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;It does not matter what the scanned and displayed text is; it does not have to be coherent or readable.&lt;/p&gt;&#xA;&lt;p&gt;The winner is the person with the longest text.&lt;/p&gt;&#xA;" OwnerUserId="88456" LastActivityDate="2021-02-24T06:13:42.623" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20801" PostTypeId="2" ParentId="2140" CreationDate="2021-02-24T17:27:25.220" Score="-3" Body="&lt;h1&gt;Reverse error quine&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;,&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Based on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/16021/print-your-code-backwards-reverse-quine&quot;&gt;this&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Write a quine that prints it own source code in reverse, but to STDERR.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Penalties&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;+200 using other files I.E. &lt;code&gt;reverse.txt&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;+150 internet usage&lt;/li&gt;&#xA;&lt;li&gt;+100 reading own source code&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Minimum length of source is 2 bytes&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Standard loopholes apply&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, shortest code wins&lt;/p&gt;&#xA;" OwnerDisplayName="user101036" LastEditorDisplayName="user101036" LastEditDate="2021-02-25T07:45:14.133" LastActivityDate="2021-02-25T07:45:14.133" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="20802" PostTypeId="2" ParentId="5243" CreationDate="2021-02-24T23:10:15.420" Score="4" Body="&lt;h1&gt;50-450 rep for answers in Scala&lt;/h1&gt;&#xA;&lt;p&gt;I'm giving out bounties for answers in Scala, an amazing language that is unfortunately rarely used here. Any Scala answers gets 50 rep from me, and if the following are met, you can get a bonus:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Good explanation: +50-100&lt;/li&gt;&#xA;&lt;li&gt;Cleverly done: +50-200&lt;/li&gt;&#xA;&lt;li&gt;Wins challenge when posted: +100&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The first two are subjective, but I'll try to be as fair as possible when awarding those. Also, I can only award the bounty if it won't cause my reputation to drop a privilege level. If I've already answered the same question or put a bounty on it, the bounty will have to be started on a different answer of yours.&lt;/p&gt;&#xA;" OwnerUserId="95792" LastEditorUserId="95792" LastEditDate="2021-08-04T22:43:09.810" LastActivityDate="2021-08-04T22:43:09.810" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20803" PostTypeId="2" ParentId="2140" CreationDate="2021-02-25T01:00:42.777" Score="-1" Body="&lt;p&gt;See who can write the &lt;em&gt;longest&lt;/em&gt; code in order to print &amp;quot;Hello World!&amp;quot;. The rule is that if you remove any single character from the code, it should NOT run.&lt;/p&gt;&#xA;" OwnerUserId="101221" LastActivityDate="2021-02-25T01:00:42.777" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20806" PostTypeId="2" ParentId="2140" CreationDate="2021-02-26T20:50:07.400" Score="0" Body="&lt;h1&gt;Is this code in the same language as my answer? (WIP)&lt;/h1&gt;&#xA;&lt;p&gt;Probably a bad idea, but the goal here is to output a truthy value if a given input string is valid syntax in the same language as your answer.&lt;/p&gt;&#xA;" OwnerUserId="45613" LastActivityDate="2021-02-26T20:50:07.400" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20807" PostTypeId="2" ParentId="2140" CreationDate="2021-02-26T21:04:14.017" Score="0" Body="&lt;h1&gt;I don't care how it started, but I'm going to end it!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Given a number between 0 and 10,000 (inclusive) as input, output that many arbitrary* printable ASCII characters, followed by the exact text:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;I don't care how it started, but I'm going to end it!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;sub&gt;* The arbitrary preceding text must not contain the ending text.&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;p&gt;You do not need to verify the input value.&lt;/p&gt;&#xA;" OwnerUserId="45613" LastActivityDate="2021-02-26T21:04:14.017" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20808" PostTypeId="2" ParentId="2140" CreationDate="2021-02-27T01:36:13.757" Score="-3" Body="&lt;h1&gt;“Simple” Programming Homework&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Your friend has been caught sleeping in class again! As punishment, his computer science teacher has assigned him homework, knowing that he will not be able to solve it due to not having paid any attention.&lt;/p&gt;&#xA;&lt;p&gt;The assignment seems deceiving simple at first; all that is required is to output the string:&lt;/p&gt;&#xA;&lt;pre&gt;John Doe&lt;/pre&gt;&#xA;&lt;p&gt;Unfortunately, the teacher is intent on making the simple assignment much more difficult. Since your friend was not listening when the teacher explained the concept of strings and numbers, the teacher forbids him from using any number character (0-9) or the quotes (&lt;code&gt;&amp;quot;&lt;/code&gt;, &lt;code&gt;'&lt;/code&gt;, &lt;code&gt;`&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;p&gt;Can you help your friend solve this problem with the shortest code possible, and save his computer science grade in the process?&lt;/p&gt;&#xA;&lt;p&gt;Try to find the shortest code in each language!&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;Note: it is encouraged to try to solve this problem in languages where string/character literals exist but cannot be used due to the restrictions (most mainstream languages are like this, e.g. C++).&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="101295" LastEditorUserId="101295" LastEditDate="2021-03-01T20:06:11.553" LastActivityDate="2021-03-01T20:06:11.553" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="20809" PostTypeId="2" ParentId="2140" CreationDate="2021-02-27T08:24:21.627" Score="2" Body="&lt;h1&gt;Integer partitions into fixed parts with coprime constraint, and exclusion set&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer-partitions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer-partitions&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer-partitions&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/recursion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;recursion&amp;#39;&quot; rel=&quot;tag&quot;&gt;recursion&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Background&lt;/h1&gt;&#xA;&lt;p&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; &lt;span class=&quot;math-container&quot;&gt;\$\in \mathbb{N}\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; &lt;span class=&quot;math-container&quot;&gt;\$\in \mathbb{N}\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$c\$&lt;/span&gt; &lt;span class=&quot;math-container&quot;&gt;\$\in \mathbb{N}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; be some subset of &lt;span class=&quot;math-container&quot;&gt;\$\{i:1\leq i\leq a\}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Consider &lt;span class=&quot;math-container&quot;&gt;\$X(a ,b, c, S)\$&lt;/span&gt;: The number of integer partitions of &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; into &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; many parts, where each of the parts are co-prime to &lt;span class=&quot;math-container&quot;&gt;\$c\$&lt;/span&gt; and no part is contained within &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Formally, for &lt;span class=&quot;math-container&quot;&gt;\$b=2\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$X(a ,2, c, S) = |\{(x, y): x + y = a,\ gcd(c, x) = gcd(c, y) = 1, x \notin S, y \notin S,\ x \leq\ y\}|$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Codegolf, standard rules apply. Write code to calculate the function &lt;span class=&quot;math-container&quot;&gt;\$X(a ,b, c, S)\$&lt;/span&gt; above.&lt;/p&gt;&#xA;&lt;p&gt;Inputs:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt;, an integer. Your function &lt;strong&gt;does not&lt;/strong&gt; need to be correct for &lt;span class=&quot;math-container&quot;&gt;\$a \le 2\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt;, an integer. Your function &lt;strong&gt;does not&lt;/strong&gt; need to be correct for &lt;span class=&quot;math-container&quot;&gt;\$b \le 1\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$c\$&lt;/span&gt;, an integer.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;, can be any set of integers between &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; (inclusive). The elements of &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; are unique.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Test-cases&lt;/h1&gt;&#xA;&lt;p&gt;Below test cases are written in the following format: &lt;span class=&quot;math-container&quot;&gt;\$a, b, c, S =\$&lt;/span&gt; Answer&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;3, 2, 2, {} = 0&#xA;4, 2, 2, {} = 1&#xA;4, 2, 3, {2} = 0&#xA;7, 3, 5, {} = 3&#xA;7, 3, 2, {5} = 1&#xA;11, 3, 1, {} = 10&#xA;11, 3, 2, {} = 4&#xA;11, 3, 3, {5, 7} = 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;BONUS&lt;/h1&gt;&#xA;&lt;p&gt;Brownie points for anyone who can do either of the following:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Disprove the following recursive relationship.&lt;/li&gt;&#xA;&lt;li&gt;Extend the following recursive relationship (for higher values of &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt;), and/or write code utilising it.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Recursive formula for &lt;span class=&quot;math-container&quot;&gt;\$b = 3\$&lt;/span&gt; (Might be incorrect):&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$X(a ,3, c, S) = \sum_{i=1}^{i=\lfloor\frac{a}{2}\rfloor} {X(a - i, 2, c, T_i)} $$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;With&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$T_0 = S$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;and,&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$T_i = T_{i-1}\cup\{i - 1, a + 1 - i\},\ for\ i \geq 1$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Questions for sandbox&lt;/h1&gt;&#xA;&lt;p&gt;Is this challenge good to go?&lt;/p&gt;&#xA;" OwnerUserId="101226" LastEditorUserId="101226" LastEditDate="2021-03-12T03:06:34.840" LastActivityDate="2021-03-12T03:06:34.840" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="20810" PostTypeId="2" ParentId="2140" CreationDate="2021-02-27T17:28:45.013" Score="2" Body="&lt;h1&gt;Gray code... Gray code?&lt;/h1&gt;&#xA;&lt;h3&gt;Your Task&lt;/h3&gt;&#xA;&lt;p&gt;Your task is to print (in an easily readable and consistent format) the binary representations of the numbers 0-255 in some order such that only one bit is altered between two consecutive numbers.&lt;/p&gt;&#xA;&lt;h3&gt;Your Restrictions&lt;/h3&gt;&#xA;&lt;p&gt;Each successive byte of the source code after the first can only change one bit from the previous byte.&lt;/p&gt;&#xA;&lt;h3&gt;Other Information&lt;/h3&gt;&#xA;&lt;p&gt;&lt;em&gt;Example valid code (in utf-8)&lt;/em&gt;: &lt;code&gt;q1!#c&lt;/code&gt;. Here, &lt;code&gt;q&lt;/code&gt; (0&lt;strong&gt;1&lt;/strong&gt;110001) and &lt;code&gt;1&lt;/code&gt; (0&lt;strong&gt;0&lt;/strong&gt;110001) are different in only one bit, and so on&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Example invalid codes (in utf-8)&lt;/em&gt;: &lt;code&gt;Q1!&lt;/code&gt;, &lt;code&gt;&amp;quot;!&amp;quot;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Example valid outputs (seperated by an empty line)&lt;/em&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;10101010 10101011 11101011 ... 01010101&#xA;&#xA;[10, 11, 1011, 1111, 1110, ...]&#xA;&#xA;10&#xA;0&#xA;1&#xA;11&#xA;111&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Example invalid outputs (seperated by an empty line)&lt;/em&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0000000100000011000000100000000000000100...&#xA;&#xA;0&#xA;01&#xA;10&#xA;11&#xA;100&#xA;...&#xA;&#xA;0 1 ... 100000000 110000000 ... 11111111&#xA;&#xA;00 01 11 10 0100 0101 ...&#xA;&#xA;0 1 3 2 5 6 ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Notes&lt;/em&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A character can be stored as two bytes, but the bytes must differ by only one bit&lt;/li&gt;&#xA;&lt;li&gt;If your interpreter ignores a character (like Whitespace ignores almost all characters) it cannot be used&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="101135" LastEditorUserId="101135" LastEditDate="2021-03-06T23:45:47.843" LastActivityDate="2021-03-06T23:45:47.843" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="20811" PostTypeId="2" ParentId="2140" CreationDate="2021-02-27T23:01:01.787" Score="0" Body="&lt;h1&gt;Shortest and Asymptotically Fastest Sort of 3-Tuples&lt;/h1&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot;&gt;sorting&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Write the shortest and asymptotically fastest function or program that will sort a set of 3-tuples.&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;Input is a set (or unique list, array, etc) of 3-tuples, containing positive integers.&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;Output is a set (or unique list, array, etc) of 3-tuples sorted in the following way:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first elements of each tuple are monotonically increasing.&lt;/li&gt;&#xA;&lt;li&gt;For each value of the first elements, the second elements are monotonically increasing.&lt;/li&gt;&#xA;&lt;li&gt;For each value of the second elements, the third elements are monotonically increasing.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Additional Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;As well as a byte count, include the asymptotic time complexity spent by your program.&lt;/li&gt;&#xA;&lt;li&gt;Explanations are encouraged! (Especially for showing the time complexity)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;Input and output is flexible, as long as each 3-tuple is individually identifiable.&lt;/li&gt;&#xA;&lt;li&gt;Scoring is time complexity, with byte length as a tie breaker.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input - Output # Comment&#xA;[(1,2,3), (400,500,600), (0,0,0)] - [(0,0,0), (1,2,3), (400,500,600)]&#xA;[(1,0,255), (1,255,0), (1,10,123), (1,50,96)]&#xA; - [(1,0,255), (1,10,123), (1,50,96), (1,255,0)] # sorted by second elements&#xA;[(1,0,255), (1,0,0), (1,0,123), (1,0,96)]&#xA; - [(1,0,0), (1,0,96), (1,0,123), (1,0,255)] # sorted by third elements&#xA;[(1,0,255), (1,255,0), (1,10,123), (1,50,96), (2,0,255), (2,0,0), (2,0,123), (2,0,96)]&#xA; - [(1,0,255), (1,10,123), (1,50,96), (1,255,0), (2,0,0), (2,0,96), (2,0,123), (2,0,255)] # sorting by first and second&#xA;[(1,0,255), (1,255,0), (255,23,232), (1,10,123), (1,50,96), (2,0,255), (2,0,0), (2,0,123), (2,0,96), (1,2,3), (400,500,600), (0,0,0)]&#xA; - [(0,0,0), (1,0,255), (1,2,3), (1,10,123), (1,50,96), (1,255,0), (2,0,0), (2,0,96), (2,0,123), (2,0,255), (400,500,600), (255,23,232)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2021-03-01T02:27:20.400" LastActivityDate="2021-03-01T02:27:20.400" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="20813" PostTypeId="2" ParentId="2140" CreationDate="2021-02-28T14:09:15.007" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/220510/liars-and-guessers&quot;&gt;Liars and Guessers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="80756" LastEditorUserId="80756" LastEditDate="2021-03-10T16:59:48.873" LastActivityDate="2021-03-10T16:59:48.873" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="20814" PostTypeId="2" ParentId="2140" CreationDate="2021-03-01T12:33:10.727" Score="5" Body="&lt;h1&gt;Dedekind, cut! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Given a &lt;a href=&quot;https://en.wikipedia.org/wiki/Dedekind_cut&quot; rel=&quot;nofollow noreferrer&quot;&gt;Dedekind cut&lt;/a&gt; of a real number &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; and a positive integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, print the real number represented by the Dedekind cut up to &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; precisions, rounded.&lt;/p&gt;&#xA;&lt;h2&gt;Dedekind cut&lt;/h2&gt;&#xA;&lt;p&gt;A &lt;strong&gt;Dedekind cut&lt;/strong&gt; representing a real number &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; is a boolean-valued function on a dense set that gives a falsy value for rational numbers under &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;, and a truthy value otherwise. In this challenge, the dense set is &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{Z}[0.1]\$&lt;/span&gt;, the rational numbers with terminating decimal expansion.&lt;/p&gt;&#xA;&lt;p&gt;Note that Dedekind cuts can represent &lt;em&gt;arbitrary&lt;/em&gt; real numbers. Irrational, nonconstructible, transcendental, or even uncomputable numbers.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Direction of rounding is implementation-defined.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For the inputted Dedekind cut, it shall be a black-box function accepting the decimal expansion (which is a string with an implementation-defined format) of elements in &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{Z}[0.1]\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Invalid inputs fall in &lt;em&gt;don't care&lt;/em&gt; situation. This also applies to the rational numbers the Dedekind cut accepts.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Output format is flexible. Outputting leading or trailing whitespaces is permitted.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For the output, all digits after the decimal point shall be considered significant in this regard. The amount of significant digits after the decimal point must be exactly &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;. Trailing zeros cannot be discarded.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For &lt;span class=&quot;math-container&quot;&gt;\$x = 0\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$n = 2\$&lt;/span&gt;, output &lt;span class=&quot;math-container&quot;&gt;\$0.00\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;For &lt;span class=&quot;math-container&quot;&gt;\$x = ¼\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$n = 1\$&lt;/span&gt;, output &lt;span class=&quot;math-container&quot;&gt;\$0.2\$&lt;/span&gt; or &lt;span class=&quot;math-container&quot;&gt;\$0.3\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;For &lt;span class=&quot;math-container&quot;&gt;\$x = ½\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$n = 3\$&lt;/span&gt;, output &lt;span class=&quot;math-container&quot;&gt;\$0.050\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;For &lt;span class=&quot;math-container&quot;&gt;\$x = \sqrt{2}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$n = 3\$&lt;/span&gt;, output &lt;span class=&quot;math-container&quot;&gt;\$1.414\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;For &lt;span class=&quot;math-container&quot;&gt;\$x = -\pi\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$n = 3\$&lt;/span&gt;, output &lt;span class=&quot;math-container&quot;&gt;\$-3.142\$&lt;/span&gt;. Note the rounding.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Ungolfed solution&lt;/h2&gt;&#xA;&lt;h3&gt;Haskell&lt;/h3&gt;&#xA;&lt;p&gt;An implementation with exponential time complexity.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;import Text.Printf&#xA;&#xA;showDedekind :: (String -&amp;gt; Bool) -&amp;gt; Int -&amp;gt; String&#xA;showDedekind x n = go2 0 where&#xA;    go1 :: Int -&amp;gt; Int -&amp;gt; String&#xA;    go1 m i = let&#xA;        s1 = printf &amp;quot;%+0*d&amp;quot; m i&#xA;        (s2, s3) = splitAt (length s1 - m) s1&#xA;        in s2 ++ (if elem (last s2) &amp;quot;0123456789&amp;quot; then &amp;quot;&amp;quot; else &amp;quot;0&amp;quot;) ++ '.' : s3&#xA;    go2 i = case (x (go1 (n + 1) (10 * i - 5)), x (go1 (n + 1) (10 * i + 5))) of&#xA;        (False, False) -&amp;gt; go2 (i + 1)&#xA;        (False, True) -&amp;gt; go1 n i&#xA;        (True, True) -&amp;gt; go2 (i - 1)&#xA;        _ -&amp;gt; error &amp;quot;This is not a Dedekind cut&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2023-05-23T11:18:37.370" LastActivityDate="2023-05-23T11:18:37.370" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20816" PostTypeId="2" ParentId="2140" CreationDate="2021-03-01T16:48:52.780" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/220159/first-sequence-with-no-square-differences&quot;&gt;First sequence with no square differences&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="89930" LastEditorUserId="69850" LastEditDate="2021-03-03T14:31:19.210" LastActivityDate="2021-03-03T14:31:19.210" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20818" PostTypeId="2" ParentId="2140" CreationDate="2021-03-01T19:06:51.040" Score="1" Body="&lt;p&gt;&lt;em&gt;Posted at &lt;a href=&quot;https://codegolf.stackexchange.com/questions/220044/convert-gemtext-to-html&quot;&gt;Convert Gemtext to HTML&lt;/a&gt; but moved here to discuss&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://communitywiki.org/wiki/GemText&quot; rel=&quot;nofollow noreferrer&quot;&gt;Gemtext&lt;/a&gt; is a very simple markup format used by the alternative web protocol Gemini. Write a Gemtext to HTML converter.&lt;/p&gt;&#xA;&lt;p&gt;From the Wiki:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A line of text is a paragraph, to be wrapped by the client. It is is&#xA;independent from the  lines coming before or after it.&lt;/p&gt;&#xA;&lt;p&gt;A list item starts with an asterisk and a space. Again, the rest of&#xA;the line is the line item, to be wrapped by the client.&lt;/p&gt;&#xA;&lt;p&gt;A heading starts with one, two, or three number signs and a space. The&#xA;rest of the line is the heading.&lt;/p&gt;&#xA;&lt;p&gt;A link is never an inline link like it is for HTML: it’s simply a line&#xA;starting with an equal-sign and a greater-than sign: “⇒”, a space, an&#xA;URI, and some text. It could be formatted like a list item, or like a&#xA;paragraph. Relative URIs are explicitly allowed.&lt;/p&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;# This is a heading &#xA;This is the first paragraph.&#xA;* a list item&#xA;* another list item &#xA;This is the second paragraph.&#xA;=&amp;gt; http://example.org/ Absolute URI&#xA;=&amp;gt; //example.org/ No scheme URI&#xA;=&amp;gt; /robots.txt Just a path URI&#xA;=&amp;gt; GemText a page link&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This should produce this HTML tree (just the equivalent tree, not the exact formatting):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;h1&amp;gt;This is a heading&amp;lt;/h1&amp;gt;&#xA;&amp;lt;p&amp;gt;This is the first paragraph.&amp;lt;/p&amp;gt;&#xA;&amp;lt;ul&amp;gt;&#xA;&amp;lt;li&amp;gt;a list item&amp;lt;/li&amp;gt;&#xA;&amp;lt;li&amp;gt;another list item&amp;lt;/li&amp;gt;&#xA;&amp;lt;/ul&amp;gt;&#xA;&amp;lt;p&amp;gt;This is the second paragraph.&amp;lt;/p&amp;gt;&#xA;&amp;lt;a href=&amp;quot;http://example.org/&amp;quot;&amp;gt;Absolute URI&amp;lt;/a&amp;gt;&#xA;&amp;lt;a href=&amp;quot;//example.org/&amp;quot;&amp;gt;No scheme URI&amp;lt;/a&amp;gt;&#xA;&amp;lt;a href=&amp;quot;/robots.txt&amp;quot;&amp;gt;Just a path URI&amp;lt;/a&amp;gt;&#xA;&amp;lt;a href=&amp;quot;GemText&amp;quot;&amp;gt;a page link&amp;lt;/a&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;HTML in the text must be escaped, e.g &lt;code&gt;paragraph &amp;lt;p&amp;gt; is cool&lt;/code&gt; becomes &lt;code&gt;&amp;lt;p&amp;gt;paragraph &amp;amp;ltp&amp;amp;gt is cool&amp;lt;/p&amp;gt;&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest code in bytes wins&lt;/p&gt;&#xA;" OwnerUserId="101343" LastEditorUserId="101343" LastEditDate="2021-03-01T19:36:26.837" LastActivityDate="2021-03-01T19:36:26.837" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20819" PostTypeId="5" CreationDate="2021-03-01T20:32:43.220" Score="0" Body="&lt;p&gt;Questions with this tag should address or ask about the quality of challenges on the main site. Some example topics could be:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Asking how to improve the quality of challenges, or specific types of challenge&lt;/li&gt;&#xA;&lt;li&gt;Discussing the quality of specific challenges&lt;/li&gt;&#xA;&lt;li&gt;Asking if a question is low quality enough to repost or improve&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-03-01T20:32:43.220" LastActivityDate="2021-03-01T20:32:43.220" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20820" PostTypeId="4" CreationDate="2021-03-01T20:32:43.220" Score="0" Body="For questions that relate to the quality of challenges on the main site" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-03-01T20:32:43.220" LastActivityDate="2021-03-01T20:32:43.220" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20821" PostTypeId="1" CreationDate="2021-03-01T20:43:24.713" Score="16" ViewCount="274" Body="&lt;p&gt;&lt;sub&gt;All stats given here are correct at the time of writing. I can't promise that they'll stay exactly correct for a significant amount of time (and they most likely won't), but I'd be surprised if the pattern challenges significantly&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;p&gt;Of the last 50 questions that were posted to main (and that are still undeleted):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;33 were posted by an inexperienced challenge author (&lt;span class=&quot;math-container&quot;&gt;\$\le3\$&lt;/span&gt; open, positively scored questions)&lt;/li&gt;&#xA;&lt;li&gt;Of those, 18 are negatively scored&lt;/li&gt;&#xA;&lt;li&gt;And, 20 are closed (7 as duplicates)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Looking at the &lt;a href=&quot;https://codegolf.stackexchange.com/tools?tab=delete&amp;amp;daterange=last30days&quot;&gt;deletion stats&lt;/a&gt; (10k+ only) for the same period, we can change those numbers to&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;41 were posted by inexperienced challenge authors&lt;/li&gt;&#xA;&lt;li&gt;25 have a negative score&lt;/li&gt;&#xA;&lt;li&gt;28 are closed (10 as duplicate)&lt;/li&gt;&#xA;&lt;li&gt;8 are deleted (6 deleted by &lt;a href=&quot;https://codegolf.stackexchange.com/help/roomba&quot;&gt;Roomba&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;How can we improve these stats?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;We have the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt; specifically to avoid this - somewhere that newer users, less experienced with challenge writing, can go in order to learn how to post high quality posts. Clearly, however, it isn't working, and in fact, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/220044/convert-gemtext-to-html#comment512318_220044&quot;&gt;some users aren't even aware of it&lt;/a&gt; before posting their first question.&lt;/p&gt;&#xA;&lt;p&gt;In order to see exactly what it's like to post a question as a new user, I logged into one of my &lt;a href=&quot;https://codegolf.stackexchange.com/users/101104/oldsandboxposts&quot;&gt;sockpuppets&lt;/a&gt; and went through the motions of posting a question. My observations:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/18028/66833&quot;&gt;info box&lt;/a&gt; is obviously visible, but doesn't stand out in a page full of links and more. In fact, visiting my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/220032/generalise-perfect-numbers&quot;&gt;latest question&lt;/a&gt;, more space was &lt;a href=&quot;https://i.stack.imgur.com/qHd5E.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;given to ads than the info box&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When I click the &amp;quot;Ask Question&amp;quot; button, I was greeted by our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/20624/66833&quot;&gt;custom modal&lt;/a&gt;, which, as I've said before, isn't &lt;em&gt;bad&lt;/em&gt;, it's just not great.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I then &lt;a href=&quot;https://i.stack.imgur.com/Wg7L6.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;drafted a low quality question&lt;/a&gt;, and hit &amp;quot;Review your question&amp;quot;. Something that immediately caught my eye:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Our automated system checked for ways to improve your question and found none.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Granted, we shouldn't expect an automated system to be our absolute filter for low quality questions, but I can think of a few automated checks that could be helpful, such as checking for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1281/make-the-criteria-tags-obligatory&quot;&gt;winning criteria tags&lt;/a&gt;, or looking for patterns that may indicate the post is off-topic or low quality.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/57206753#57206753&quot;&gt;as noted by Unrelated String&lt;/a&gt;, for users who are less familiar with the SE system, this could be seen as an &amp;quot;endorsement&amp;quot; that their question is good to go, rather than the system telling them there are no &amp;quot;system&amp;quot; errors (e.g. missing title, no tags etc.)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;During this process, there was only ever a single time where I was directed to our &lt;a href=&quot;https://codegolf.stackexchange.com/tour&quot;&gt;Tour page&lt;/a&gt; and our &lt;a href=&quot;https://codegolf.stackexchange.com/help/asking&quot;&gt;how to ask&lt;/a&gt; pages, both of which are supposed to be there to help newer users ask high quality questions, and that was in the &lt;a href=&quot;https://i.stack.imgur.com/smrCm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;Step 1&lt;/a&gt; while asking my question, along with a lot of information in a fairly small box. Even if I had visited the Tour/asking pages, though, I'm not sure it would've helped:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;You should only ask practical, answerable questions based on actual problems that you face. Chatty, open-ended questions diminish the usefulness of our site and push other questions off the front page.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/dont-ask&quot;&gt;What types of questions should I avoid asking?&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Have you thoroughly searched for an answer before asking your question? Sharing your research helps everyone. Tell us what you found and why it didn’t meet your needs. This demonstrates that you’ve taken the time to try to help yourself, it saves us from reiterating obvious answers, and above all, it helps you get a more specific and relevant answer!&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/how-to-ask&quot;&gt;How do I ask a good question?&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Focus on questions about an actual problem you have faced. Include details about what you have tried and exactly what you are trying to do.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/tour&quot;&gt;The Tour page&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;We've asked &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8441/can-we-get-a-custom-tour-page&quot;&gt;hundreds&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2020/a-better-help-center?rq=1&quot;&gt;of&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/477/the-how-to-ask-page-is-misleading&quot;&gt;times&lt;/a&gt; about our misleading Tour/help pages, so consider this one the latest in a long series of similar questions. That doesn't change the fact that the pages &lt;em&gt;are&lt;/em&gt; misleading at best, and downright wrong at worst.&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, despite it being the go-to, number one piece of advice offered by countless users across the site, our &lt;a href=&quot;https://codegolf.stackexchange.com/help/how-to-ask&quot;&gt;how to ask page&lt;/a&gt; only mentions the Sandbox once, and just doesn't mention other useful resources such as our &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq&lt;/a&gt; or pages such as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges&quot;&gt;Things to avoid when writing challenges&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&amp;quot;This site is for programming contests and challenges. General programming questions are off-topic here. You may be able to get help on Stack Overflow.&amp;quot; is one of our primary close reasons (&lt;a href=&quot;https://codegolf.stackexchange.com/tools/question-close-stats&quot;&gt;19.05 %&lt;/a&gt; of closed questions in the last 90 days), behind &amp;quot;Needs details or clarity&amp;quot; at 44.44 % and &amp;quot;Duplicate&amp;quot; at 23.81 %. This suggests that a lot of users post here without fully understanding &lt;em&gt;what&lt;/em&gt; the site's actually about.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Finally, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19329/users-with-1-rep-arent-able-to-post-answers-on-meta&quot;&gt;the Sandbox isn't even fully accessible for new users&lt;/a&gt;, as due to a bug that has gone unfixed since September 2020 (going on 7 months now), users require 5 reputation to post on Meta.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;In short, the systems we have in place in order to help newer users post high quality questions are not working. New users do not get directed to helpful pages until &lt;em&gt;after&lt;/em&gt; they post here, they don't get adequately informed about the purpose of the site, and they don't have access to, or the knowledge of, valuable and helpful resources.&lt;/p&gt;&#xA;&lt;h3&gt;So what can we do about it?&lt;/h3&gt;&#xA;&lt;p&gt;What suggestions do you have to make it easier for new users to post good quality questions? What can/should we change (or try to change) in order to decrease the number of low quality posts?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-03-01T21:14:11.690" Title="How can we improve the quality of new users' challenges?" Tags="|discussion|new-users|challenge-quality|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20822" PostTypeId="2" ParentId="20821" CreationDate="2021-03-01T20:43:24.713" Score="8" Body="&lt;p&gt;As far as I can see, there are two big issues here that both need addressing:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Visibility of useful resources&lt;/li&gt;&#xA;&lt;li&gt;How helpful those resources are&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Visibility&lt;/h2&gt;&#xA;&lt;p&gt;No one likes having a whole bunch of links to a whole bunch of posts thrust into their face as soon as they do anything. That said, some links are close to essential for new users in order to properly understand the site.&lt;/p&gt;&#xA;&lt;p&gt;To avoid having a massive standard comment, or heavily cluttered info box or similar, I suggest we collate Meta posts which we believe are all but necessary for new users to read, and tag them with something like &lt;a href=&quot;/questions/tagged/new-users-guide&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;new-users-guide&amp;#39;&quot; rel=&quot;tag&quot;&gt;new-users-guide&lt;/a&gt; to allow newer users to be pointed to the tag and able to browse through the posts.&lt;/p&gt;&#xA;&lt;p&gt;This guide can then be constantly linked to every step of the way for new users. Link to it from the Tour page, in the sidebar when writing a question, in the Info Box at the side of the site, in the modal that pops up when you ask a question. We can't force people to read something, but by encouraging and linking it enough, we can make sure that the vast majority of people are aware of what the site is about before ever posting anything.&lt;/p&gt;&#xA;&lt;p&gt;As I said in the question, there's nothing that stands out about places to improve your challenge before posting. When new users answer a question, they get a &lt;a href=&quot;https://i.stack.imgur.com/giHNn.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;big yellow info box&lt;/a&gt;. Having one of these for challenges could be very helpful, directing new users to resources such as the Sandbox, the Tour/help pages or a &lt;a href=&quot;/questions/tagged/new-users-guide&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;new-users-guide&amp;#39;&quot; rel=&quot;tag&quot;&gt;new-users-guide&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Helpfulness&lt;/h2&gt;&#xA;&lt;p&gt;As noted in a lot of meta discussions, the Tour and Help pages aren't fully relevant and/or helpful to newer users.&lt;/p&gt;&#xA;&lt;p&gt;There have also been recent examples of users not understanding &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/20750/threshold-for-votes-in-the-sandbox-before-posting-in-the-main-site&quot;&gt;how long to leave a question in the Sandbox&lt;/a&gt;, suggesting that the purpose of the Sandbox (&amp;quot;A place to leave a draft so that others can suggest feedback until it's ready to be posted&amp;quot;) isn't fully understood by all.&lt;/p&gt;&#xA;&lt;p&gt;And, of course, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19329/users-with-1-rep-arent-able-to-post-answers-on-meta&quot;&gt;new users can't post in the Sandbox&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Improving our &amp;quot;automated systems&amp;quot; would be a significant first step. Escalating the reputation issue to SE and emphasising it's importance, customising our asking modals and tag warnings, and correcting our Tour and help pages would hopefully lead to fewer off-topic and low quality questions. And, even if nothing changed, fixing these would be an improvement to the site&lt;/p&gt;&#xA;&lt;p&gt;Finally, updating our &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq&lt;/a&gt; pages, promoting some of the &lt;a href=&quot;/questions/tagged/faq-proposed&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;faq-proposed&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq-proposed&lt;/a&gt; pages, and linking new users to the FAQ would help those users better integrate into the site.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt;: If I had to sum this answer up in one sentence, it'd be this:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Collect all our helpful information, links, pages and more into a single location and promote links to the location at every step of posting a question&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-03-01T20:43:24.713" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20823" PostTypeId="2" ParentId="20821" CreationDate="2021-03-01T21:14:11.690" Score="5" Body="&lt;h2&gt;Warnings&lt;/h2&gt;&#xA;&lt;p&gt;From what I can tell, the review screen is &lt;em&gt;somewhat&lt;/em&gt; customizable. It doesn't seem like it can test for not having a tag (i.e., not having an objective winning criterion), but we can add regex based warnings for the body or tags.&lt;/p&gt;&#xA;&lt;p&gt;I suggest the following:&lt;/p&gt;&#xA;&lt;h3&gt;Language tags&lt;/h3&gt;&#xA;&lt;p&gt;Some of the more common of these, like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/java&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;java&amp;#39;&quot; rel=&quot;tag&quot;&gt;java&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/c&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;c&amp;#39;&quot; rel=&quot;tag&quot;&gt;c&lt;/a&gt;, etc., with warnings against language restrictions&lt;/p&gt;&#xA;&lt;h3&gt;Restricted source&lt;/h3&gt;&#xA;&lt;p&gt;Add a warning for Do X without Y, with an appropriate link&lt;/p&gt;&#xA;&lt;h3&gt;Other possible options&lt;/h3&gt;&#xA;&lt;p&gt;Later today, I'm going to download every undeleted challenge on CGCC, and look for the tags and substrings that are most common in low quality questions. Strategically adding warnings prompted by these could catch a fair number of challenges, if it works.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-03-01T21:14:11.690" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20824" PostTypeId="1" CreationDate="2021-03-01T23:31:44.507" Score="12" ViewCount="684" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19271/16766&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout March 2021, our Language of the Month, nominated by myself (Bubbler) will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://factorcode.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Factor&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;What's a Language of the Month?&lt;/h3&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/16766&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during March, those who wish to participate should learn (at least the basics of) Factor, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about Factor&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The Factor programming language is a concatenative, stack-based programming language with high-level features including dynamic types, extensible syntax, macros, and garbage collection. On a practical side, Factor has a full-featured library, supports many different platforms, and has been extensively documented.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Factor is &lt;em&gt;the&lt;/em&gt; modern stack-based practical language. If Forth (LotM of November 2020) was too hard to use because of its low-level-ness and nothing else, Factor is probably the right language for you.&lt;/p&gt;&#xA;&lt;h2&gt;Why Factor?&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Factor is functional and object-oriented. Any object or function can be pushed on the data stack. The &amp;quot;object&amp;quot; includes containers (arrays, hashmaps, and the like).&lt;/li&gt;&#xA;&lt;li&gt;Factor does not use syntax (if..then..else, for, while) for control flow. Instead, it extensively uses quotations (equivalent of anonymous lambda functions) and higher-order functions. For example, an equivalent of if-statement looks like &lt;code&gt;boolean [ true-func ] [ false-func ] if&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The standard library includes lots of higher-order functions that act on the stack or arrays, which can give a feel of working in Haskell.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;a href=&quot;https://docs.factorcode.org/content/article-cleave-combinators.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;functional idiom&lt;/a&gt; for reusing stack item(s) can give the feel of APL trains or Jelly links.&lt;/li&gt;&#xA;&lt;li&gt;When the stack shuffling gets extra cumbersome, you can get away with &lt;a href=&quot;https://docs.factorcode.org/content/article-locals-examples.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;local variables&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Factor implements whole numeric tower (bigints, rationals, floats, and complex numbers whose components can be in any of the three real number types).&lt;/li&gt;&#xA;&lt;li&gt;Stack safety is enforced by checking the written stack effect against the actual one. It may be a hindrance to golf, but it makes Factor functions easier to debug. And you can ignore it by using a quotation for golfing purposes.&lt;/li&gt;&#xA;&lt;li&gt;Despite the verbosity of syntax (space-separated words), Factor is often on par with other practical languages (JS, Python, R) byte-count-wise, thanks to the rich set of library functions.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Caveats&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is recommended to install the Factor binary locally to search for the library functions. (Factor binary is available for Windows/Mac/Linux.)&lt;/li&gt;&#xA;&lt;li&gt;TIO seems to have a version different from the current stable (0.98), and some things that work locally may not work on TIO. e.g. &lt;code&gt;tuck ( x y -- y x y )&lt;/code&gt; is missing, and &lt;code&gt;count&lt;/code&gt; does not load with &lt;code&gt;auto-use&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://factorcode.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Factor home page&lt;/a&gt;, &lt;a href=&quot;https://concatenative.org/wiki/view/Factor/Learning&quot; rel=&quot;nofollow noreferrer&quot;&gt;Factor/Learning on Concatenative Wiki&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#factor&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/75610/78410&quot;&gt;Tips question&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/119181/factor&quot;&gt;Chatroom&lt;/a&gt;. Ping me (@Bubbler) if you have any questions about Factor.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://andreaferretti.github.io/factor-tutorial/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tutorial&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Bounty&lt;/h3&gt;&#xA;&lt;p&gt;I (Bubbler) will award &lt;code&gt;50 × n&lt;/code&gt; rep for any user's &lt;code&gt;n&lt;/code&gt;-th Factor answer posted this month, up to &lt;code&gt;n = 10&lt;/code&gt;, maximum 2750 rep in total per user.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="68942" LastEditDate="2021-04-01T17:37:58.433" LastActivityDate="2021-04-12T00:33:58.013" Title="Language of the Month for March 2021: Factor" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20825" PostTypeId="2" ParentId="20824" CreationDate="2021-03-01T23:33:22.527" Score="3" Body="&lt;h1&gt;List of all Factor solutions posted in March 2021&lt;/h1&gt;&#xA;&lt;p&gt;(First time posters highlighted in bold)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/220078&quot;&gt;Print 0 to 100 without 1-9 characters&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/45220&quot;&gt;SjoerdPennings&lt;/a&gt;&lt;/strong&gt; (+50)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/220209/78410&quot;&gt;Approximate the Dottie number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/220320/95516&quot;&gt;Reconstruct an integer from its prime exponents&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95516/rak1507&quot;&gt;rak1507&lt;/a&gt;&lt;/strong&gt; (+50)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/220494/78410&quot;&gt;What is the area of this polygon?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/220599/90812&quot;&gt;Sum of primes between given range&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/strong&gt; (+50)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/220617/90812&quot;&gt;Do I have a prime twin?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/220659/62393&quot;&gt;Do I have a prime twin?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/62393&quot;&gt;Leo&lt;/a&gt;&lt;/strong&gt; (+50)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/220678/5116&quot;&gt;1, 2, miss a few, 99, 100&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/5116/hdrz&quot;&gt;hdrz&lt;/a&gt;&lt;/strong&gt; (+50)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/220799/90812&quot;&gt;Triangular code, triangular output&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812&quot;&gt;Michael Chatiskatzi&lt;/a&gt; (+100)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/220831/78410&quot;&gt;Code point sum quine&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/220863/95792&quot;&gt;Is this number a factorial?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792&quot;&gt;Original Original Original VI&lt;/a&gt; (+50)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/220948/75681&quot;&gt;Count all possible Tweets&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/75681&quot;&gt;Galen Ivanov&lt;/a&gt; (+50)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/125237/its-hip-to-be-square/221012#221012&quot;&gt;It's Hip to be Square&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792&quot;&gt;Original Original Original VI&lt;/a&gt; (+100)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/221063/5116&quot;&gt;1, 2, Fizz, 4, Buzz&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/5116/hdrz&quot;&gt;hdrz&lt;/a&gt; (+100)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/205033/reverse-factorial-function/221094#221094&quot;&gt;Reverse factorial function&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792&quot;&gt;Original Original Original VI&lt;/a&gt; (+150)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/221116/5116&quot;&gt;Alphabet printing challenge&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/5116/hdrz&quot;&gt;hdrz&lt;/a&gt; (+150)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/221180/5116&quot;&gt;Removing The Nineteenth Byte&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/5116/hdrz&quot;&gt;hdrz&lt;/a&gt; (+200)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/221287/78410&quot;&gt;Largest power of 2 that divides n&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/124362/how-high-can-you-count/221323#221323&quot;&gt;&lt;strong&gt;How high you can count?&lt;/strong&gt;&lt;/a&gt; By &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/92116/wasif&quot;&gt;&lt;strong&gt;Wasif&lt;/strong&gt;&lt;/a&gt; (+50)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/221285/78410&quot;&gt;Largest power of 2 that divides &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792&quot;&gt;Original Original Original VI&lt;/a&gt; (+200)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/221385/9486&quot;&gt;What's the odd one out?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9486&quot;&gt;Silvio Mayolo&lt;/a&gt;&lt;/strong&gt; (+50)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/607/find-the-factorial/221406#221406&quot;&gt;Find the factorial!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/92116/wasif&quot;&gt;Wasif&lt;/a&gt; (+100)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/207258/average-of-your-code/221422#221422&quot;&gt;Average of your code&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/92116/wasif&quot;&gt;Wasif&lt;/a&gt; (+150)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/88653/print-a-10-by-10-grid-of-asterisks/221425#221425&quot;&gt;Print a 10 by 10 grid of asterisks&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/92116/wasif&quot;&gt;Wasif&lt;/a&gt; (+200)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/221433/95792&quot;&gt;Am I an insignificant array?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792&quot;&gt;Original Original Original VI&lt;/a&gt; (+250)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/222521/95792&quot;&gt;Follow a linked list&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792&quot;&gt;Original Original Original VI&lt;/a&gt; (+300)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/222522/95792&quot;&gt;Is it a super-prime?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792&quot;&gt;Original Original Original VI&lt;/a&gt; (+350)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/222555/95792&quot;&gt;Repeated! Factorials!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792&quot;&gt;Original Original Original VI&lt;/a&gt; (+400)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/222556/95792&quot;&gt;Half, Half Half, and, Half&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792&quot;&gt;Original Original Original VI&lt;/a&gt; (+450)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210071/the-vanilla-factorial-challenge/222641#222641&quot;&gt;The vanilla factorial challenge&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/92116/wasif&quot;&gt;Wasif&lt;/a&gt; (+250)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/222692/95792&quot;&gt;I reverse the source code, you reverse the input!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792&quot;&gt;Original Original Original VI&lt;/a&gt; (+500)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/222705/5116&quot;&gt;Printing criss cross of two strings&#xA;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/5116/hdrz&quot;&gt;hdrz&lt;/a&gt; &lt;em&gt;(invalid)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/221285/95792) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr&gt;&#xA;&lt;h1&gt;List of all Factor tips posted in March 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/220886/78410&quot;&gt;You are free to trash stdout and stack under the top&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; [&amp;lt;tip title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;List of Factor-related challenges posted in March 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/q/&amp;lt;question-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-04-12T00:33:58.013" LastActivityDate="2021-04-12T00:33:58.013" CommentCount="0" CommunityOwnedDate="2021-03-01T23:33:22.527" ContentLicense="CC BY-SA 4.0" />
  <row Id="20826" PostTypeId="2" ParentId="18637" CreationDate="2021-03-02T17:13:25.617" Score="9" Body="&lt;p&gt;&lt;a href=&quot;https://www.dyalog.com/blog/2021/04/apl-seeds-21-wednesday-31-march/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/zyLan.png&quot; alt=&quot;Video's now available!&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2021-04-08T12:57:45.310" LastActivityDate="2021-04-08T12:57:45.310" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20827" PostTypeId="2" ParentId="2140" CreationDate="2021-03-03T04:00:57.743" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/220231/three-three-no&quot;&gt;Three, Three, No&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="101295" LastEditorUserId="66833" LastEditDate="2021-03-05T20:20:30.590" LastActivityDate="2021-03-05T20:20:30.590" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="20828" PostTypeId="1" AcceptedAnswerId="20829" CreationDate="2021-03-03T14:56:31.427" Score="4" ViewCount="119" Body="&lt;p&gt;I'm aware that this phenomenon is nothing new, as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/13178/record-of-oeis-on-ppcg&quot;&gt;OEIS Challenges&lt;/a&gt; have been around since the beginning of this site. And I also don't think OEIS challenges are necessarily bad. In fact, many of my favorite challenges on this site are just those.&lt;/p&gt;&#xA;&lt;p&gt;But in the past year, I've noticed a large uptick in the number of &amp;quot;here's a curious OEIS sequence, golf it!&amp;quot; questions. These sorts of questions briefly introduce the concept of the sequence, and then ask users to generate them. These can make for fun challenges, but I fear that they make for an easy reputation farm and clutter the front page with identical looking challenges.&lt;/p&gt;&#xA;&lt;p&gt;Are my concerns valid? And if they are, are there any ways of encouraging more well-thought out OEIS based challenges?&lt;/p&gt;&#xA;" OwnerUserId="82007" LastActivityDate="2021-03-03T16:14:28.657" Title="The rise of OEIS challenges" Tags="|discussion|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="20829" PostTypeId="2" ParentId="20828" CreationDate="2021-03-03T16:14:28.657" Score="8" Body="&lt;h2&gt;This isn't a bad or new thing&lt;/h2&gt;&#xA;&lt;p&gt;Repeatedly over the years we've had periods of time where most of the front page was filled with challenges along certain themes. Just from my memory alone, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/alphabet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;alphabet&amp;#39;&quot; rel=&quot;tag&quot;&gt;alphabet&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/stack-exchange-api&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;stack-exchange-api&amp;#39;&quot; rel=&quot;tag&quot;&gt;stack-exchange-api&lt;/a&gt; were at one point both very popular, and to a lesser extent so were &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/13859/can-we-remove-the-semicolon-tag/13860#13860&quot;&gt;semicolon-#&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/132558/i-double-the-source-you-double-the-output&quot;&gt;I ___ the source code, you ___ the input&lt;/a&gt; and many others.&lt;/p&gt;&#xA;&lt;p&gt;Unlike a lot of these, OEIS &amp;quot;themed&amp;quot; challenges are likely to be of a decent quality without even trying. So long as the OP can adequately and clearly describe how the sequence works, the challenge writes itself.&lt;/p&gt;&#xA;&lt;p&gt;Personally, I disagree with your view that&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;These can make for fun challenges, but I fear that they make for an easy reputation farm and clutter the front page with identical looking challenges.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;If someone writes a challenge that is clear and unique by our standards, who cares if it might be an &amp;quot;easy rep farm&amp;quot;? Rep farming is a problem if it leads to low quality, low effort posts that are detrimental to the site. These might be low effort questions, but they're certainly not low quality, and they require more effort to write than a lot of the &amp;quot;I X the source, you X the input&amp;quot; challenges.&lt;/p&gt;&#xA;&lt;p&gt;Until these challenges start all having titles like &amp;quot;Golf OEIS sequence AXXXXXX&amp;quot;, the front page is generally going to stay pretty varied. And if challenges do start getting posted with boring title, encourage some creativity in title writing.&lt;/p&gt;&#xA;&lt;h2&gt;However!&lt;/h2&gt;&#xA;&lt;p&gt;Just because these challenges are often easy to write doesn't mean they can't be improved. Having posted a number of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; questions myself, I'm starting to get bored with the &lt;a href=&quot;https://codegolf.stackexchange.com/tags/sequence/info&quot;&gt;default sequence I/O rules&lt;/a&gt;, so in a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/219525/whats-next-achilles&quot;&gt;recent challenge&lt;/a&gt; I switched it up a bit. There are many ways that authors can adapt their question beyond just &amp;quot;Here is a sequence. Golf it&amp;quot;,&lt;span class=&quot;math-container&quot;&gt;\${}^*\$&lt;/span&gt; and I encourage people who want to write about that &amp;quot;cool new sequence you just found&amp;quot; to think creatively about how they could make their challenge stand out more.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\${}^*\$&lt;/span&gt;Some examples are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Turn it into a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, or it's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/220053/topologically-distinct-ways-of-dissecting-a-square-into-rectangles&quot;&gt;cousin&lt;/a&gt; criteria: &amp;quot;Largest term calculated within a minute&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;Switch up the task beyond the standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; rules. Calculating the next term, given the previous, can allow for some very creative solutions for the right sequence. Examining overlaps between 2 related but distinct sequences (e.g. Fibonacci and Lucas numbers) again, leads to creative approaches.&lt;/li&gt;&#xA;&lt;li&gt;Relate your sequence somehow with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;, or some other non-&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; winning criteria. This typically works best if the reason it isn't &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is something to do with the sequence, so isn't always applicable.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-03-03T16:14:28.657" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20830" PostTypeId="2" ParentId="2140" CreationDate="2021-03-03T17:28:35.890" Score="1" Body="&lt;h1&gt;Let's rise higher!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;(I am posting this challenge in sandbox because this kind of exceptional challenges are often closed, and then downvoted to oblivion, so I want to get your feedback and with kind help you fix the specifications in this challenge, and make it interesting, Thanks!)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;The main objective of the challenge is pretty simple, this is an answer chaining contest, where you have to serially print numbers from 1. That means User 1's answer will print &lt;code&gt;1&lt;/code&gt;, then User 2's answer will print &lt;code&gt;2&lt;/code&gt; and so on. But there are some rules to make the contest tougher.&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;You can't use the characters of the source code used in the previous answer.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Each answer cannot use more than 12 distinct bytes.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Use of comments in your code is disallowed.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You cannot post 2 answers in a row, let me explain, suppose you have written answer no. 5, now you cannot write answer no. 6, you have to wait someone to post a valid answer no. 6 (That prints &lt;code&gt;6&lt;/code&gt; without using characters in answer no. 5), and after that you can write a valid answer no. 7 following the rules.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Program cannot take input or access internet.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Standard loopholes apply.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Scoring criterion&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;This is not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, so there is a custom objective scoring criteria. Try to make your score higher.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Each answer's initial score is 1. (Only chain beginning answer has score 0).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For each distinct byte you use, your score is increased by the number of distinct bytes. That means if your number of distinct bytes is &lt;code&gt;6&lt;/code&gt;, then your score increases by &lt;code&gt;1+2+3+4+5+6&lt;/code&gt;, and if your number of distinct bytes is &lt;code&gt;7&lt;/code&gt;, then your score increases by &lt;code&gt;1+2+3+4+5+6+7&lt;/code&gt; and so on.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You have to calculate distinct byte difference with the previous answer, and add/subtract score using the 2nd rule. So if byte difference is &lt;code&gt;3&lt;/code&gt; then you will get a &lt;code&gt;+1+2+3&lt;/code&gt; score, or if &lt;code&gt;-3&lt;/code&gt; (Previous answer has 3 more distinct bytes than yours), then &lt;code&gt;-1-2-3&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For first 40 bytes you will get a &lt;code&gt;0.15&lt;/code&gt; score, but from then you have to minus &lt;code&gt;0.5&lt;/code&gt; score. An example if your score has total 45 bytes then your score bonus will be &lt;code&gt;(40*0.15)-(5*0.5)=6-2.5=3.5&lt;/code&gt;, so you have to add &lt;code&gt;+3.5&lt;/code&gt; to your score. (The score criteria is to encourage medium length smart answers.)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;A total example:&lt;/p&gt;&#xA;&lt;p&gt;Suppose,&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your previous answer has 4 distinct bytes, and a total of 20 bytes&lt;/li&gt;&#xA;&lt;li&gt;Your answer has 7 distinct bytes, and a total of 56 bytes&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;So your score will be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Distinct byte difference: (7-4)=3&#xA;Total score: 1+(1+2+3+4+5+6+7)+(1+2+3)+(40*0.15)-(16*0.5)=33&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;So you get a score of &lt;code&gt;33&lt;/code&gt; for this condition.&lt;/p&gt;&#xA;&lt;h1&gt;Answer format&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;# Answer Number. Language Name, x Bytes, y Distinct bytes, Score: Z&#xA;&#xA;    source code&#xA;&#xA;(TIO/Any other interpreter link) -&amp;gt; Not required, but preferred&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;example&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1. Powershell, x Bytes, y Distinct Bytes, Score: Z&#xA;&#xA;......&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Winning criterion&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Winner will be determined after 30 days, winner is determined by total score. But users are welcome to continue the chain after that!&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Suppose you have three answers with score &lt;code&gt;33,16,78&lt;/code&gt; then your total score will be &lt;code&gt;33+16+78=127&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;And there is two special prizes from me after 30 days:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;+150 bounty for the winner.&lt;/li&gt;&#xA;&lt;li&gt;+50  bounty for the single answer with highest score! (Such as man of the match in Cricket)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Chain beginning answer:&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;1. &lt;a href=&quot;https://github.com/TryItOnline/TioSetup/wiki/Powershell&quot; rel=&quot;nofollow noreferrer&quot;&gt;PowerShell&lt;/a&gt;, 1 byte, 1 distinct byte, Score: 0&lt;/h1&gt;&#xA;&#xA;&lt;pre class=&quot;lang-powershell prettyprint-override&quot;&gt;&lt;code&gt;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##K8gvTy0qzkjNyfn/3/D/fwA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;PowerShell – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;---&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Are all rules clear?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Please improve the scoring criterion and rules. (Especially please improve the second rule, I am not very sure about that.)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Please make me a javascript snippet for leaderboard, to sort users by their total score.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Any other feedback please.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="92116" LastEditorUserId="92116" LastEditDate="2021-03-03T17:36:06.570" LastActivityDate="2021-03-03T17:36:06.570" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20831" PostTypeId="2" ParentId="2140" CreationDate="2021-03-04T02:01:43.163" Score="0" Body="&lt;h1&gt;Lists of power&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Generate the following list of lists.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[0], [1], [2, 4, 8, 6], [3, 9, 7, 1], [4, 6], [5], [6], [7, 9, 3, 1], [8, 4, 2, 6], [9, 1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer (as measured in bytes) wins.&lt;/p&gt;&#xA;" OwnerUserId="78186" LastActivityDate="2021-03-04T02:01:43.163" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20833" PostTypeId="2" ParentId="2140" CreationDate="2021-03-04T16:46:42.190" Score="0" Body="&lt;h1&gt;Sequential Multiplication Magic Squares&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;(Inspired by &lt;a href=&quot;https://puzzling.stackexchange.com/questions/107606/fill-in-a-5x5-multiplicative-magic-square&quot;&gt;this question for a 5x5&lt;/a&gt; and &lt;a href=&quot;https://puzzling.stackexchange.com/questions/107635/fill-in-a-4x4-multiplicative-magic-square&quot;&gt;this question for a 4x4 magic square&lt;/a&gt; on the Puzzling SE sites.)&lt;/p&gt;&#xA;&lt;p&gt;For this challenge, a sequential multiplication magic square is an NxN square filled with numbers 1..N² where the product of any M-th row equals the product of the M-th column. That is, the product of the first row is equal to the product of the first column, the product of the second row is equal to the product of the second column etc.&lt;/p&gt;&#xA;&lt;p&gt;For example, &lt;a href=&quot;https://puzzling.stackexchange.com/questions/107606/fill-in-a-5x5-multiplicative-magic-square#comment304271_107606&quot;&gt;one such 3x3 square&lt;/a&gt; might be as follows, but other similar results are valid as well:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;9 8 3&#xA;4 5 2&#xA;6 1 7&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Notably, there is no such square for N=2.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a side size N of 1 or larger, output a valid NxN sequential multiplication magic square, or any distinct falsy value if none exists.&lt;/p&gt;&#xA;&lt;p&gt;Standard loopholes apply, any convenient input-output, this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Sample cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 → [1]&#xA;&#xA;2 → any distinct falsy value&#xA;&#xA;3 → [[9, 8, 3],&#xA;     [4, 5, 2],&#xA;     [6, 1, 7]]&#xA;&#xA;4 → [[16,  3, 12,  4],&#xA;     [ 9, 10, 14,  1],&#xA;     [ 8,  7, 11, 15],&#xA;     [ 2,  6,  5, 13]]&#xA;&#xA;5 → [[ 7, 16,  6,  3, 25],&#xA;     [ 5, 13, 22, 12, 24],&#xA;     [ 9, 11, 17, 14,  4],&#xA;     [20, 18, 21, 19,  1],&#xA;     [ 8, 10,  2, 15, 23]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="16484" LastActivityDate="2021-03-04T16:46:42.190" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20834" PostTypeId="1" CreationDate="2021-03-04T21:29:54.017" Score="4" ViewCount="153" Body="&lt;p&gt;It seems to be undisputed precedent for &lt;a href=&quot;https://scratch.mit.edu/projects/editor&quot; rel=&quot;nofollow noreferrer&quot;&gt;Scratch&lt;/a&gt; answers that only the code is counted when determining the bytes used for an answer (although, how to come up with the amount of bytes that the code takes up is disputed, but I'm not getting into that here).&lt;/p&gt;&#xA;&lt;p&gt;However, a Scratch program is more than code - there's costumes, sounds, the question of what kind of sprite the code is running in, and some other factors.&lt;/p&gt;&#xA;&lt;p&gt;What assumptions can be made about the environment in Scratch?&lt;/p&gt;&#xA;" OwnerUserId="90816" LastEditorUserId="108218" LastEditDate="2023-01-02T15:27:59.340" LastActivityDate="2023-01-02T15:27:59.340" Title="What assumptions can be made about the environment in Scratch?" Tags="|discussion|policy|" AnswerCount="4" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20835" PostTypeId="2" ParentId="20834" CreationDate="2021-03-04T21:29:54.017" Score="5" Body="&lt;h1&gt;Assumptions about the stage/sprite&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You may either:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Assume that your code is running in the stage.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Assume that your code is running in a sprite.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may either:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;make no assumptions about the sprite&lt;/li&gt;&#xA;&lt;li&gt;assume that your code is running in the default cat sprite, and it is in the state it is in upon the creation of a new project (visible, on costume 1, has no graphic effects active, and other factors)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may assume that there are no sprites in the project other than the one your code is running in (or assume that there are no sprites if you assume that your code is running in the stage).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="90816" LastActivityDate="2021-03-04T21:29:54.017" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20836" PostTypeId="2" ParentId="20834" CreationDate="2021-03-04T21:32:12.967" Score="6" Body="&lt;h1&gt;All variables you use exist, and are set to 0 before your code runs&lt;/h1&gt;&#xA;" OwnerUserId="90816" LastEditorUserId="90816" LastEditDate="2022-04-05T16:36:52.430" LastActivityDate="2022-04-05T16:36:52.430" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20837" PostTypeId="2" ParentId="20834" CreationDate="2021-03-04T21:35:39.297" Score="6" Body="&lt;h1&gt;There will be no human interaction with the program while it is running&lt;/h1&gt;&#xA;&lt;p&gt;Exception: you may accept input in a sensible format if the challenge requires input.&lt;/p&gt;&#xA;" OwnerUserId="90816" LastEditorUserId="90816" LastEditDate="2022-04-05T16:37:40.270" LastActivityDate="2022-04-05T16:37:40.270" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20839" PostTypeId="2" ParentId="20834" CreationDate="2021-03-05T02:09:12.107" Score="6" Body="&lt;h1&gt;The green flag will be clicked once&lt;/h1&gt;&#xA;&lt;p&gt;Unlike traditional programming languages, Scratch code does not execute immediately upon the interpreter reading it - it must be ran by a hat block. Using &lt;code&gt;when gf clicked&lt;/code&gt; for this seems to be undisputed precedent, so you may assume that the green flag will be clicked once.&lt;/p&gt;&#xA;" OwnerUserId="90816" LastActivityDate="2021-03-05T02:09:12.107" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20841" PostTypeId="2" ParentId="2140" CreationDate="2021-03-05T14:18:43.247" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/220611/self-replicating-numbers&quot;&gt;Self-Replicating Numbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="99902" LastEditorUserId="99902" LastEditDate="2021-03-12T14:51:02.200" LastActivityDate="2021-03-12T14:51:02.200" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="20842" PostTypeId="2" ParentId="2140" CreationDate="2021-03-05T15:17:54.177" Score="2" Body="&lt;h1&gt;Draw four colorful quarter circles&lt;/h1&gt;&#xA;&lt;p&gt;The challenge is to reproduce this image in your favorite language:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/FfnC9.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/FfnC9.jpg&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your image must be at least 400 by 400 pixels.&lt;/li&gt;&#xA;&lt;li&gt;The fill colors don't need to be the same as in the image but they must be different from each other.&lt;/li&gt;&#xA;&lt;li&gt;You must include the outlines but they can be any visible thickness you choose.&lt;/li&gt;&#xA;&lt;li&gt;The quarters should be at the same orientation as in the image.&lt;/li&gt;&#xA;&lt;li&gt;Your image must have four quarter circles aligned as in the image which each touch the edge of the circle at a point.&lt;/li&gt;&#xA;&lt;li&gt;Your code must take input which specifies the location, in pixels, of the point where the quarter-circles meet; you can take this input in any reasonable format, but the units must be pixels (no relative units, such as a fraction of the width/height of the image). You can assume these inputs are always within the bounds of the outer circle.  You can also assume that the inputs are such that all four quarter circles can be drawn within the circle.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Here is some LaTeX code as an example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;\documentclass[tikz,margin=3mm]{standalone}&#xA;\usetikzlibrary{calc,through}&#xA;&#xA;\usetikzlibrary{intersections}&#xA;&#xA;&#xA;\begin{document}&#xA;\begin{tikzpicture}[inner sep=0pt, outer sep=0pt]&#xA;&#xA;  \coordinate (point) at (-0.1,0.4);&#xA;&#xA;  \draw [name path=mycirc] (0,0) circle [radius=1];&#xA;  \path [name path=di-1] (point) -- ++(-2,2);&#xA;  \path [name path=di-2] (point) -- ++(-2,-2);&#xA;  \path [name path=di-3] (point) -- ++(2,-2);&#xA;  \path [name path=di-4] (point) -- ++(2,2);&#xA;  &#xA;  \foreach \col [count=\i] in {yellow,red,blue,brown}{&#xA;  &#xA;      \fill [red, name intersections={of=mycirc and di-\i}] (intersection-1) circle [radius=0.05] node (inter-\i) {};&#xA;      &#xA;      \fill[\col,draw=black,rotate around={(\i+3)*90:(point)}] (point)&#xA;        let \p1 = ($(point) - (inter-\i)$) in &#xA;        arc [start angle=0, end angle=90, radius={0.707*veclen(\x1,\y1)}]&#xA;        -- +(270:{0.707*veclen(\x1,\y1)}) -- cycle ; &#xA;  }&#xA;  &#xA;  \fill[red] (point) circle [radius=0.05];&#xA;   &#xA;\end{tikzpicture}&#xA;\end{document} &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;[I would love help on how to improve this challenge.]&lt;/p&gt;&#xA;" OwnerDisplayName="user7467" LastEditorDisplayName="user7467" LastEditDate="2021-03-06T19:35:54.423" LastActivityDate="2021-03-06T19:35:54.423" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="20843" PostTypeId="2" ParentId="2140" CreationDate="2021-03-05T20:16:39.753" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/220260/reconstruct-an-integer-from-its-prime-exponents&quot;&gt;Reconstruct an integer from its prime exponents&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-03-06T01:33:25.037" LastActivityDate="2021-03-06T01:33:25.037" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20844" PostTypeId="2" ParentId="2140" CreationDate="2021-03-05T21:54:54.650" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/220460/whats-the-odd-one-out&quot;&gt;What&amp;#39;s the odd one out?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-03-09T17:55:46.707" LastActivityDate="2021-03-09T17:55:46.707" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20845" PostTypeId="2" ParentId="2140" CreationDate="2021-03-07T01:29:20.923" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/220422/subarrays-with-at-least-n-distinct-integers&quot;&gt;Subarrays With At Least N Distinct Integers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="101295" LastEditorUserId="101295" LastEditDate="2021-03-08T22:28:25.707" LastActivityDate="2021-03-08T22:28:25.707" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="20846" PostTypeId="2" ParentId="5243" CreationDate="2021-03-08T19:04:41.330" Score="15" Body="&lt;h1&gt;100-500 rep for answers to good, old questions with few answers&lt;/h1&gt;&#xA;&lt;h3&gt;Please note: I'm nearly out of rep and can't award anyone anymore. If someone else can continue the bounty, that'd be really great.&lt;/h3&gt;&#xA;&lt;p&gt;This bounty is for answers to questions that meet the following criteria:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;They have a score of 10 or more (and fewer than 4 downvotes)&lt;/li&gt;&#xA;&lt;li&gt;They haven't had an answer in 3 years&lt;/li&gt;&#xA;&lt;li&gt;There are between 1 and 9 answers (inclusive)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For questions not tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-tips-tooltip-container&quot;&gt;tips&lt;/a&gt;, here are the bounty amounts, depending on how many answers there are and whether or not there is a good explanation:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1 to 3 answers (inclusive): 400 rep (500 with a good explanation)&lt;/li&gt;&#xA;&lt;li&gt;4 to 6 answers: 200 rep (300 with a good explanation)&lt;/li&gt;&#xA;&lt;li&gt;7 to 9 answers: 100 rep (200 with a good explanation)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/search?q=is%3Aq+score%3A10..+answers%3A..9+lastactive%3A..2018+closed%3A0+locked%3A0+-%5Btips%5D&quot;&gt;This&lt;/a&gt; search from caird coineringaahing/ChartZ Belatedly may help find eligible questions.&lt;/p&gt;&#xA;&lt;p&gt;For questions tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-tips-tooltip-container&quot;&gt;tips&lt;/a&gt;, if there are 5 or fewer answers already, new answers can get 50 rep.&lt;/p&gt;&#xA;&lt;p&gt;Please edit in your requests in the form &lt;code&gt;username: [amount](answer link), [amount](answer link)&lt;/code&gt;. Bolded requests are in progress, and those that are struck through have finished.&lt;/p&gt;&#xA;&lt;p&gt;rak1507: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/220432/95792&quot;&gt;250&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/220818/95516&quot;&gt;300&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;p&gt;ChartZ Belatedly: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/119967/expand-kirkmans-schoolgirl-problem/220791#220791&quot;&gt;500&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/220827/66833&quot;&gt;200&lt;/a&gt;&lt;sup&gt;&lt;sup&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/message/57372440#57372440&quot;&gt;why not 300?&lt;/a&gt;&lt;/sup&gt;&lt;/sup&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/220852/66833&quot;&gt;400&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/222525/66833&quot;&gt;400&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;p&gt;Wasif: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/119253/make-an-interpreter-for-yes/221259#221259&quot;&gt;200&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/2910/compute-the-difference-between-two-days/221319#221319&quot;&gt;300&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/129243/printing-criss-cross-of-two-strings/221400#221400&quot;&gt;300&lt;/a&gt;&lt;/s&gt;, &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/12563/random-css-color-code/226631#226631&quot;&gt;200&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;p&gt;Jonah: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/222512/15469&quot;&gt;200&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;p&gt;Deadcode: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/17855/regex-golf-regions-of-italy-vs-states-of-usa/222571#222571&quot;&gt;200&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;p&gt;pxeger: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/222782&quot;&gt;300&lt;/a&gt;&lt;/s&gt;, &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/230725&quot;&gt;300&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/248285&quot;&gt;300&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;p&gt;Razetime: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/222742/80214&quot;&gt;200&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;p&gt;Dion: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229376/92080&quot;&gt;200&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;p&gt;Aaroneous Miller: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/236077/101522&quot;&gt;400&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;p&gt;pajonk: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/236466/55372&quot;&gt;200&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;p&gt;Grain Ghost: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/237505/56656&quot;&gt;500&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/237588/56656&quot;&gt;400&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/237599/56656&quot;&gt;100&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;p&gt;ophact: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246677/106710&quot;&gt;100&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/71203/convert-the-time-to-a-string/247389#247389&quot;&gt;200&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;p&gt;alephalpha: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/75786/addition-on-elliptic-curves/248403#248403&quot;&gt;400&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;p&gt;mathcat: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/248626/96037&quot;&gt;200&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;p&gt;Seggan: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/248742/107299&quot;&gt;300&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;p&gt;matteo_c: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/250843/73593&quot;&gt;500&lt;/a&gt;&lt;/s&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/263744/73593&quot;&gt;200&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;bigyihsuan: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/252676/77309&quot;&gt;300&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/253463/77309&quot;&gt;300&lt;/a&gt;&lt;/s&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/92877/phonemic-abugida/254944#254944&quot;&gt;500&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Aurath: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/253362/113573&quot;&gt;400&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;" OwnerUserId="95792" LastEditorUserId="73593" LastEditDate="2023-08-05T14:33:10.153" LastActivityDate="2023-08-05T14:33:10.153" CommentCount="17" CommunityOwnedDate="2022-11-11T13:59:34.457" ContentLicense="CC BY-SA 4.0" />
  <row Id="20847" PostTypeId="2" ParentId="2140" CreationDate="2021-03-08T22:55:28.273" Score="0" Body="&lt;h2&gt;Syslog PRI Conversion&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This is my first CodeGolf post, so I expect some errors my content.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The &lt;code&gt;rsyslogd&lt;/code&gt; utility has been a tool used throughout time to handle and parse logs either over an IP network or even locally. As many of you might know, this tool utilizes the basic &lt;code&gt;syslog&lt;/code&gt; protocol.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;code&gt;syslog&lt;/code&gt; protocol handles both a &lt;strong&gt;Facility&lt;/strong&gt; and a &lt;strong&gt;Severity&lt;/strong&gt; level in one integer, called &lt;strong&gt;Priority&lt;/strong&gt;. The formula to extract these levels is as follows:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;Priority = Facility * 8 + Level&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this challenge, your task is to write an application that converts a &lt;strong&gt;Priority&lt;/strong&gt; value from the &lt;code&gt;syslog&lt;/code&gt; protocol into a human readable format. The application must take input from &lt;code&gt;STDIN&lt;/code&gt;, and output both the &lt;strong&gt;Severity&lt;/strong&gt; and &lt;strong&gt;Facility&lt;/strong&gt; string associated with the numerical code.&lt;/p&gt;&#xA;&lt;p&gt;The numerical code/type table is as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Int     Severity&#xA;0       Emergency&#xA;1       Alert&#xA;2       Critical&#xA;3       Error&#xA;4       Warning&#xA;5       Notice&#xA;6       Informational&#xA;7       Debug&#xA;&#xA;Int     Facility&#xA;0       kernel messages&#xA;1       user-level messages&#xA;2       mail system&#xA;3       system daemons&#xA;4       security/authorization messages&#xA;5       internal&#xA;6       line printer subsystem&#xA;7       network news subsystem&#xA;8       UUCP subsystem&#xA;9       clock daemon&#xA;10      security/authorization messages&#xA;11      FTP daemon&#xA;12      NTP subsystem&#xA;13      log audit&#xA;14      log alert&#xA;15      clock daemon&#xA;16      local0&#xA;17      local1&#xA;18      local2&#xA;19      local3&#xA;20      local4&#xA;21      local5&#xA;22      local6&#xA;23      local7&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The format of the outputted text may be any style you like, as long as it retains its human readable characteristics.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;mail system, Critical\n&#xA;&#xA;mail system\n&#xA;Critical\n&#xA;&#xA;mail system - Critical\n&#xA;&#xA;mail system Critical\n&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a &lt;code&gt;PRI&lt;/code&gt; value of 103, your program must output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;NTP Subsystem, Debug&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The shortest answer in bytes wins!&lt;/p&gt;&#xA;" OwnerUserId="88379" LastActivityDate="2021-03-08T22:55:28.273" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20849" PostTypeId="2" ParentId="2140" CreationDate="2021-03-08T23:40:02.143" Score="2" Body="&lt;h1&gt;Tri tri tribonacci&lt;/h1&gt;&#xA;&lt;p&gt;Tribonacci from &lt;a href=&quot;https://en.wikipedia.org/wiki/Generalizations_of_Fibonacci_numbers#Tribonacci_numbers&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The tribonacci numbers are like the Fibonacci numbers, but instead of starting with two predetermined terms, the sequence starts with three predetermined terms and each term afterwards is the sum of the preceding three terms.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given three arrays of three integers, for each array:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Find the generator G (the first non-negative integer) of the sequence to which the three numbers belong&lt;/li&gt;&#xA;&lt;li&gt;Then find the G-th element of the sequence (&lt;strong&gt;zero-indexed&lt;/strong&gt;*)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The three integers found are indeed part of a tribonacci sequence, output the G-th element of that sequence.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;*The sequences are zero-indexed because G may be 0 and in that case you have to find the 0th element of the sequence.&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;Given the input&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[5, 11, 20], [1, 2, 3], [23, 39, 67]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;5 11 20&lt;/code&gt; are part of the sequnce &lt;code&gt;2 4 5 11 20&lt;/code&gt;, which starts with &lt;code&gt;2&lt;/code&gt;, so we take the 2nd element of the sequence: &lt;code&gt;5&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;1 2 3&lt;/code&gt; are part of &lt;code&gt;0 1 0 1 2 3&lt;/code&gt;, so we take &lt;code&gt;0&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;23 39 67&lt;/code&gt; are part of the sequence &lt;code&gt;7 11 5 23 39 67 129 235&lt;/code&gt; so we take &lt;code&gt;235&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Now &lt;code&gt;5 0 235&lt;/code&gt; are part of the sequence &lt;code&gt;230 5 0 235&lt;/code&gt; so the output is the 230th element of that sequence:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;174892031986606286607812889236621806383715371411020300455075910&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Input / output&lt;/h2&gt;&#xA;&lt;p&gt;You can take the input as you prefer: an array of three arrays, three arrays, an object, a string, etc.&lt;/p&gt;&#xA;&lt;p&gt;You are not required to handle integers larger than those implemented by your chosen language, I will post plenty of test cases with smaller output after I make a program for the challenge.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, everyone wins.&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;p&gt;Please say something.&lt;/p&gt;&#xA;" OwnerUserId="100356" LastEditorUserId="100356" LastEditDate="2021-03-09T00:22:19.777" LastActivityDate="2021-03-09T00:22:19.777" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="20850" PostTypeId="1" AcceptedAnswerId="20851" CreationDate="2021-03-09T02:58:11.333" Score="-4" ViewCount="73" Body="&lt;h2&gt;Problem&lt;/h2&gt;&#xA;&lt;p&gt;The 'recent challenges' section is clogged up with nonsense.&lt;/p&gt;&#xA;&lt;h2&gt;Solution&lt;/h2&gt;&#xA;&lt;p&gt;Auto-delete challenges past a certain negative rep value, maybe -5.&lt;/p&gt;&#xA;&lt;h2&gt;Reasons for doing this&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;These challenges add nothing to the site.&lt;/li&gt;&#xA;&lt;li&gt;Downvoting gains more power and lets the site users decide what sort of content should be ideal.&lt;/li&gt;&#xA;&lt;li&gt;People can't spam low quality answers to easy challenges.&lt;/li&gt;&#xA;&lt;li&gt;The site quality increases overall.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Potential problems with this&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A group of users downvoting challenges randomly or targeted for no good reason&lt;/p&gt;&#xA;&lt;p&gt;Solution: have moderators review whether or not a challenge has been fairly downvoted. This should be obvious from the challenge quality.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Potentially good challenges getting deleted because they have negative rep.&lt;/p&gt;&#xA;&lt;p&gt;Solution: no good challenges ever have sufficiently low rep.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The site seems more hostile to new authors.&lt;/p&gt;&#xA;&lt;p&gt;Solution: improve guidelines on how to ask questions. The site is already hostile as questions will be closed instantly.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="95516" LastEditorUserId="68942" LastEditDate="2021-06-01T23:35:03.250" LastActivityDate="2021-06-01T23:35:03.250" Title="Autodeletions - debloat the site" Tags="|discussion|feature-request|status-declined|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20851" PostTypeId="2" ParentId="20850" CreationDate="2021-03-09T03:10:50.213" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/roomba&quot;&gt;This already exists&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;It just waits for a while, so that people don't immediately have their challenge deleted. Furthermore, that's what 20k+ users and the &lt;a href=&quot;https://codegolf.stackexchange.com/tools?tab=delete&amp;amp;daterange=last30days&quot;&gt;moderator tools page&lt;/a&gt; are for.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;More detailed: this is an awful idea. Sorry for the bluntness, but it just is. We have multiple challenges that have scores of -5 or more that are open and have a lot of answers, because a low score does not always mean that a challenge should be deleted.&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, &lt;strong&gt;this already exists&lt;/strong&gt; in so many different ways:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is exactly what &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/moderator-tools&quot;&gt;delete votes&lt;/a&gt; are for&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://meta.stackexchange.com/questions/58032/what-are-the-spam-and-rude-or-abusive-offensive-flags-and-how-do-they-wor/58035#58035&quot;&gt;Spam flags&lt;/a&gt; for posts that should be quickly removed from the front page&lt;/li&gt;&#xA;&lt;li&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/help/roomba&quot;&gt;Roombas&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/close-questions&quot;&gt;Close votes&lt;/a&gt; are also a part of this system - you cannot delete a challenge that isn't closed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Just as a comparison: currently, in order to delete a post at -5 it needs:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;To have 5 users (or a moderator) close it, which requires either 3000 reputation (for a total of 15000 reputation), or to win a community election&lt;/li&gt;&#xA;&lt;li&gt;To have 3 users (or a moderator) to delete it, which requires either 20000 reputation (for a total of 60000 rep), or again, to win an election.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If this were implemented, 5 users with 125 reputation each could delete any new question they liked, and, with enough people, &lt;em&gt;any&lt;/em&gt; question.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Finally, if this isn't enough, I'll address each of your points:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&amp;quot;These challenges add nothing to the site.&amp;quot;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Then they'll be deleted eventually by one of the above methods&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&amp;quot;Downvoting gains more power and lets the site users decide what sort of content should be ideal.&amp;quot;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Downvoting shouldn't have more power, that's what close votes and delete votes are for&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&amp;quot;People can't spam low quality answers to easy challenges.&amp;quot;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a challenge is trivial enough to spam answers to, maybe it isn't a challenge we want on the site. A very often cited quote under trivial challenges is&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I can't tell you the reason for the other downvotes, but mine is because I firmly believe that trivial questions like this are bad for the site. - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/114719/divide-one-number-by-another#comment279775_114719&quot;&gt;Peter Taylor&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&amp;quot;The site quality increases overall.&amp;quot;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;At what cost though? We can suffer through a -7, closed, off-topic question hanging around the recently active questions page for an hour or two every so often. This would just be a detrimental change to the site, and isn't the best way to go about getting rid of such posts&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&amp;quot;A group of users downvoting challenges randomly or targeted for no good reason. Solution: have moderators review whether or not a challenge has been fairly downvoted. This should be obvious from the challenge quality.&amp;quot;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;That's a lot of power to give to 4 users, and, perhaps more importantly, a lot of extra work, when we already have systems to do this. Moderators are supposed to be &lt;a href=&quot;https://stackoverflow.blog/2009/05/18/a-theory-of-moderation/&quot;&gt;human exception handlers&lt;/a&gt;, not the users in change of what posts are and aren’t ok to have on the site&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&amp;quot;Potentially good challenges getting deleted because they have negative rep. Solution: no good challenges ever have sufficiently low rep.&amp;quot;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Maybe so. Another, better way to think about it is that &amp;quot;no good challenges are ever closed&amp;quot;&lt;span class=&quot;math-container&quot;&gt;\${}^*\$&lt;/span&gt;. As question deletion requires it to be closed, I think that's a better matric than score, which is almost 100% subjective&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&amp;quot;The site seems more hostile to new authors. Solution: improve guidelines on how to ask questions. The site is already hostile as questions will be closed instantly.&amp;quot;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Even if we do improve guidelines on asking, this is still a very hostile feature to have. No one likes getting downvotes, and no one likes have their contributions just suddenly disappear.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;sub&gt;&lt;span class=&quot;math-container&quot;&gt;\${}^*\$&lt;/span&gt;Citation needed&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/help/roomba&quot;&gt;This already exists&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-03-09T04:17:01.643" LastActivityDate="2021-03-09T04:17:01.643" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="20853" PostTypeId="2" ParentId="2140" CreationDate="2021-03-09T04:53:24.960" Score="5" Body="&lt;h1&gt;KoTH: Hunter-Gatherer Society&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this challenge, the goal is to write a bot (Javascript function) which survives for as long as possible with its tribe. The bots are placed on an island, with the ability to hunt, gather, farm, and build. Tribes can fight, and the last alive wins.&lt;/p&gt;&#xA;&lt;p&gt;This challenge is complicated, and it's designed to be that way. I'd recommend starting out with bots that specialize in a particular type of strategy, like gathering berries or fighting. To keep this post from being longer than it already is, technical details will be included in the links labeled &lt;code&gt;More&lt;/code&gt; at the end of each section. (&lt;strong&gt;Meta:&lt;/strong&gt; These links don't go anywhere yet)&lt;/p&gt;&#xA;&lt;h2&gt;Overview&lt;/h2&gt;&#xA;&lt;p&gt;Bots have hit points and hunger. In order to survive, bots need to eat. There are various foods, such as berries from berry bushes, bread from farming, and meat from hunting. Materials like sticks, rocks, logs, and ores can be found around the island, and used to make tools and buildings.&lt;/p&gt;&#xA;&lt;p&gt;The island has grasslands, forests, and rivers. Rabbits and elk can be hunted for meat and hide, with sticks, rocks, or spears. Meat can be cooked over a campfire. Tribes can build walls to protect their farms and bases, and fight to defend them with weapons and armor. Bots can talk to their tribe members, and trade for rare materials.&lt;/p&gt;&#xA;&lt;h2&gt;Hit Points, Hunger, and Turns&lt;/h2&gt;&#xA;&lt;p&gt;All bots have a number of hit points, and a number of hunger points. Bots start with 7.5 hit points, out of a maximum of 10. When they reach 0 or below, they die. Various actions take hunger. Bots start with 75, out of a maximum of 100, and when they drop below 0 hunger points they instead lose 10% of the hunger taken in hit points.&lt;/p&gt;&#xA;&lt;p&gt;Games consist of a number of turns. During each turn, all bots can perform actions including moving, eating, harvesting, and fighting. Each action takes a certain amount of hunger, and every action performed in the same turn after the first one doubles the hunger taken.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;More:&lt;/strong&gt; Turns&lt;/p&gt;&#xA;&lt;h2&gt;Terrain&lt;/h2&gt;&#xA;&lt;p&gt;The world consists of a square grid, with a radius determined by &lt;code&gt;floor(25 * sqrt(bot_count)) + 25&lt;/code&gt;. The center of the grid will always be &lt;code&gt;[0, 0]&lt;/code&gt;, with coordinated ranging from &lt;code&gt;[-radius, -radius]&lt;/code&gt; to &lt;code&gt;[radius, radius]&lt;/code&gt;. Positions will always be specified in absolute coordinates as an array &lt;code&gt;[x, y]&lt;/code&gt;, and most actions that take a &lt;code&gt;position&lt;/code&gt; argument will require the bot to be adjacent to that position unless otherwise specified.&lt;/p&gt;&#xA;&lt;p&gt;This land is divided into four biomes:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Grassland&lt;/li&gt;&#xA;&lt;li&gt;Forest&lt;/li&gt;&#xA;&lt;li&gt;River&lt;/li&gt;&#xA;&lt;li&gt;Ocean&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The outer ring of 25 grid squares will be ocean. This consists of a beach closer to the center, with water continuing to the boundary of the world. Rivers will generate similarly, usually with a width of 5-10, with a thin beach on each side.&lt;/p&gt;&#xA;&lt;p&gt;Each naturally generated terrain square can be one of the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Plain&lt;/li&gt;&#xA;&lt;li&gt;Bush&lt;/li&gt;&#xA;&lt;li&gt;Berry bush&lt;/li&gt;&#xA;&lt;li&gt;Tree&lt;/li&gt;&#xA;&lt;li&gt;Stone&lt;/li&gt;&#xA;&lt;li&gt;Copper ore&lt;/li&gt;&#xA;&lt;li&gt;Iron ore&lt;/li&gt;&#xA;&lt;li&gt;Sand&lt;/li&gt;&#xA;&lt;li&gt;Water&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Grasslands are mostly plain, with some stones and bushes. Forests are more interesting, with many trees and some stones, bushes, and berry bushes.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;More:&lt;/strong&gt; Terrain&lt;/p&gt;&#xA;&lt;h2&gt;Movement&lt;/h2&gt;&#xA;&lt;p&gt;Bots can move in any of four directions: &lt;code&gt;north()&lt;/code&gt;, &lt;code&gt;east()&lt;/code&gt;, &lt;code&gt;south()&lt;/code&gt;, or &lt;code&gt;west()&lt;/code&gt;. Only some terrain can be walked into:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Plain&lt;/li&gt;&#xA;&lt;li&gt;Sand&lt;/li&gt;&#xA;&lt;li&gt;Farmland&lt;/li&gt;&#xA;&lt;li&gt;Bush (+1)&lt;/li&gt;&#xA;&lt;li&gt;Berry bush (+1)&lt;/li&gt;&#xA;&lt;li&gt;Water (+2)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;It typically takes 1 hunger to move. However, moving into certain terrain (marked with &lt;code&gt;+1&lt;/code&gt; or &lt;code&gt;+2&lt;/code&gt;) can take extra hunger. An addition hunger point is taken for every 10 items the bot is holding, rounded down. Multiple bots can occupy the same position.&lt;/p&gt;&#xA;&lt;h2&gt;Food&lt;/h2&gt;&#xA;&lt;p&gt;There are four foods, which restore different amounts of hunger:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Berries:      10&lt;/li&gt;&#xA;&lt;li&gt;Meat:         15&lt;/li&gt;&#xA;&lt;li&gt;Bread:        25&lt;/li&gt;&#xA;&lt;li&gt;Cooked meat:  40&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Foods also restore 10% of their hunger restoration in hit points.&lt;/p&gt;&#xA;&lt;p&gt;Berries can be collected from berry bushes, by returning &lt;code&gt;harvest()&lt;/code&gt; when adjacent to (or standing in) a berry bush. Meat is obtained by hunting, bread is crafted with grain, and cooked meat requires a campfire.&lt;/p&gt;&#xA;&lt;p&gt;Grain can be initially collected by returning &lt;code&gt;harvest()&lt;/code&gt; when adjacent to (or standing in) plain land. It can also be collected from farming. Bread can be crafted by returning &lt;code&gt;craft(Item.BREAD)&lt;/code&gt; while holding 1 grain and 1 rock. The rock will not be consumed.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;More:&lt;/strong&gt; Food, Harvesting&lt;/p&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;p&gt;Many types of terrain can be broken by returning &lt;code&gt;break(position)&lt;/code&gt;, turning into plain land and giving items:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bush:         Stick × 1&lt;/li&gt;&#xA;&lt;li&gt;Berry bush:   Berries × 1&lt;/li&gt;&#xA;&lt;li&gt;Tree:         Log × 2&lt;/li&gt;&#xA;&lt;li&gt;Stone:        Stone × 1&lt;/li&gt;&#xA;&lt;li&gt;Copper ore:   Copper ore × 1&lt;/li&gt;&#xA;&lt;li&gt;Iron ore:     Iron ore × 1&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Trees require an axe to break. All four will reappear after a number of turns if the land remains plain.&lt;/p&gt;&#xA;&lt;p&gt;A stone axe can be crafted from 1 stick and 1 stone by returning &lt;code&gt;craft(Item.STONE_AXE)&lt;/code&gt;, and will break after 10 uses.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;More:&lt;/strong&gt; Breaking, Crafting&lt;/p&gt;&#xA;&lt;h2&gt;Farming&lt;/h2&gt;&#xA;&lt;p&gt;A stone shovel can be crafted from 1 stick and 1 stone by returning &lt;code&gt;craft(Item.STONE_SHOVEL)&lt;/code&gt;. A shovel can be used to turn plain land into farmland, and will break after 20 uses. This is done by returning &lt;code&gt;shovel(position)&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Grain can be planted on farmland by returning &lt;code&gt;plant(position)&lt;/code&gt;. It will take around 100 to 200 turns to grow, although the amount of time is much shorter within 20 squares of water. Grain starts as &lt;code&gt;Growth.NOT_GROWN&lt;/code&gt;, and cannot be harvested (only broken). It then becomes &lt;code&gt;Growth.GROWING&lt;/code&gt; after about 70% of the total time, and will give one grain when broken or harvested. Finally, the last stage is &lt;code&gt;Growth.GROWN&lt;/code&gt;, where two to four wheat are given from harvesting.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;More:&lt;/strong&gt; Farming&lt;/p&gt;&#xA;&lt;h2&gt;Hunting&lt;/h2&gt;&#xA;&lt;p&gt;A stone spear can be crafted from 1 stick and 1 stone by returning &lt;code&gt;craft(Item.STONE_SPEAR)&lt;/code&gt;. A spear can be used to hunt, as well as a stick or stone. Bots can attack at a position by returning &lt;code&gt;attack(position)&lt;/code&gt; (&lt;code&gt;hunt(position)&lt;/code&gt; and &lt;code&gt;fight(position)&lt;/code&gt; are aliases). Movement happens before attacking, so simply attacking an animal's current position may not work. If attacking would hit multiple targets, damage is distributed between them evenly.&lt;/p&gt;&#xA;&lt;p&gt;Sticks and stones have a range of 1, with sticks dealing 0.35 hit points, and stones dealing 0.75. Spears deal one hit point, with a maximum range of 2. A spear breaks after 10 successful hits. Attacking takes 10 hunger, whether or not any target is successfully hit.&lt;/p&gt;&#xA;&lt;p&gt;There are two types of animals: rabbits and elk. Rabbits have 1 hit point, and elk have 4. Rabbits will move every 1 to 2 turns, avoiding bots if they are very close. Elk will move every 2 to 4 turns, and will always move away from attackers for 2 to 4 turns after being attacked. Rabbits will give the last bot to hit them 1 meat, and have a 25% chance of giving 1 hide to the second to last player to hit them. Elk are similar, giving 1 meat and 1 hide to the last bot to hit them, and 1 meat to the bot that hit them the 2nd to last time.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;More:&lt;/strong&gt; Hunting&lt;/p&gt;&#xA;&lt;h2&gt;Tribes&lt;/h2&gt;&#xA;&lt;p&gt;All bots will be part of a tribe. Tribes are determined by the creator of the bot, can contain any number of bots from any number of writers. Bots in the same tribe will be able to recognize each other, while bots outside their tribe will only have their tribe name known. Tribe members cannot attack each other.&lt;/p&gt;&#xA;&lt;p&gt;If a tribe member is next to another one, they can give an item with &lt;code&gt;give(name, item)&lt;/code&gt;, or transfer any JSON-serializable data with &lt;code&gt;talk(name, data)&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Armor can be crafted from 2 hide with &lt;code&gt;craft(Item.ARMOR)&lt;/code&gt;. When a bot is holding armor, it can take up to 10 hit points before breaking. Bots fight with other bots in the same way they hunt animals. When a bot is killed, its items are distributed among the bots that attacked it recently according to the damage done.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;More:&lt;/strong&gt; Tribes, Fighting&lt;/p&gt;&#xA;&lt;h2&gt;Building&lt;/h2&gt;&#xA;&lt;p&gt;Bots can build walls and campfires, by returning &lt;code&gt;build(build, position)&lt;/code&gt;, where &lt;code&gt;build&lt;/code&gt; is one of &lt;code&gt;Terrain.WOOD_WALL&lt;/code&gt;, &lt;code&gt;Terrain.STONE_WALL&lt;/code&gt;, &lt;code&gt;Terrain.CRATE&lt;/code&gt;, or &lt;code&gt;Terrain.CAMPFIRE&lt;/code&gt;. Wood walls require 2 logs, and take 10 hits with an axe to break, giving the bot that breaks it one log. Stone walls require 4 stones, and take 75 hits with an axe to break, giving the bot that breaks it one stone.&lt;/p&gt;&#xA;&lt;p&gt;Crates require 1 log and 1 bronze, and can store items. If you're adjacent to a crate, you can store items in it with &lt;code&gt;store(position, items)&lt;/code&gt;, and take an item with &lt;code&gt;take(position, items)&lt;/code&gt;. Crates can store up to 40 items. The contents of crates are visible to any bot.&lt;/p&gt;&#xA;&lt;p&gt;Campfires require 1 stone, and 2 sticks, and can be used to cook meat. Campfires can be given fuel using &lt;code&gt;fuel(position, item)&lt;/code&gt;, accepting sticks, logs, and charcoal. Bots can cook meat or logs (which turn into cooked meat and charcoal, respectively) using &lt;code&gt;cook(Item.MEAT)&lt;/code&gt; or &lt;code&gt;cook(Item.LOG)&lt;/code&gt;, if adjacent to a campfire. Cooking meat uses 3 fuel, and cooking logs uses 5. A stick provides 1 fuel, a log provides 5, and charcoal provides 15.&lt;/p&gt;&#xA;&lt;p&gt;A campfire can be broken with an axe, and will give the bot that breaks it all of the unused fuel it holds. Partially consumed logs or charcoal will not be given.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;More:&lt;/strong&gt; Building, Cooking&lt;/p&gt;&#xA;&lt;h2&gt;Upgrading&lt;/h2&gt;&#xA;&lt;p&gt;Copper ore and iron ore can be cooked into bronze and iron in a campfire, requiring 10 and 15 fuel respectively. Bronze and iron can be used to craft stronger axes, shovels, and spears, by replacing the stone in the recipe with the corresponding item.&lt;/p&gt;&#xA;&lt;p&gt;For axes and shovels, the material affects the durability:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Stone axe:    10&lt;/li&gt;&#xA;&lt;li&gt;Bronze axe:   15&lt;/li&gt;&#xA;&lt;li&gt;Iron axe:     25&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;All shovels have twice the durability of a similarly strong axe. Spears are different, with all tiers having 10 durability. Instead, the number of hit points dealt is upgraded:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Stone spear:  1.0&lt;/li&gt;&#xA;&lt;li&gt;Bronze spear: 1.5&lt;/li&gt;&#xA;&lt;li&gt;Iron spear:   2.5&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Because these items are so rare, trading might be a good way for a tribe to advance. By returning &lt;code&gt;offer(sell, buy)&lt;/code&gt;, any bot can offer a number of items they have (&lt;code&gt;sell&lt;/code&gt;) for a number of items they want to have (&lt;code&gt;buy&lt;/code&gt;). All bots will receive an array of offers made on the last turn, and can accept one with &lt;code&gt;accept(offer)&lt;/code&gt;, where &lt;code&gt;offer&lt;/code&gt; is an offer ID.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;code&gt;sell&lt;/code&gt; array should contain IDs of items the bot is holding, while &lt;code&gt;buy&lt;/code&gt; should be an array of objects. All objects should have an &lt;code&gt;item&lt;/code&gt; property with the &lt;code&gt;Item&lt;/code&gt; wanted, and an optional &lt;code&gt;durability&lt;/code&gt; property can specify a minimum durability acceptable. If no minimum durability is included, only undamaged items will be accepted.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;More:&lt;/strong&gt; Trading&lt;/p&gt;&#xA;&lt;h2&gt;Bots&lt;/h2&gt;&#xA;&lt;p&gt;Many arguments and functions involve enums including &lt;code&gt;Terrain&lt;/code&gt; and &lt;code&gt;Item&lt;/code&gt;. Here is a reference:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;Terrain&lt;/code&gt;: &lt;code&gt;PLAIN&lt;/code&gt;, &lt;code&gt;BUSH&lt;/code&gt;, &lt;code&gt;TREE&lt;/code&gt;, &lt;code&gt;STONE&lt;/code&gt;, &lt;code&gt;COPPER_ORE&lt;/code&gt;, &lt;code&gt;IRON_ORE&lt;/code&gt;, &lt;code&gt;FARMLAND&lt;/code&gt;, &lt;code&gt;SAND&lt;/code&gt;, &lt;code&gt;WATER&lt;/code&gt;, &lt;code&gt;WOOD_WALL&lt;/code&gt;, &lt;code&gt;STONE_WALL&lt;/code&gt;, &lt;code&gt;CAMPFIRE&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Item&lt;/code&gt;: &lt;code&gt;STICK&lt;/code&gt;, &lt;code&gt;BERRIES&lt;/code&gt;, &lt;code&gt;LOG&lt;/code&gt;, &lt;code&gt;STONE&lt;/code&gt;, &lt;code&gt;COPPER_ORE&lt;/code&gt;, &lt;code&gt;IRON_ORE&lt;/code&gt;, &lt;code&gt;CHARCOAL&lt;/code&gt;, &lt;code&gt;BRONZE&lt;/code&gt;, &lt;code&gt;IRON&lt;/code&gt;, &lt;code&gt;MEAT&lt;/code&gt;, &lt;code&gt;COOKED_MEAT&lt;/code&gt;, &lt;code&gt;GRAIN&lt;/code&gt;, &lt;code&gt;BREAD&lt;/code&gt;, &lt;code&gt;HIDE&lt;/code&gt;, &lt;code&gt;ARMOR&lt;/code&gt;, &lt;code&gt;STONE_AXE&lt;/code&gt;, &lt;code&gt;BRONZE_AXE&lt;/code&gt;, &lt;code&gt;IRON_AXE&lt;/code&gt;, &lt;code&gt;STONE_SHOVEL&lt;/code&gt;, &lt;code&gt;BRONZE_SHOVEL&lt;/code&gt;, &lt;code&gt;IRON_SHOVEL&lt;/code&gt;, &lt;code&gt;STONE_SPEAR&lt;/code&gt;, &lt;code&gt;BRONZE_SPEAR&lt;/code&gt;, &lt;code&gt;IRON_SPEAR&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Growth&lt;/code&gt;: &lt;code&gt;EMPTY&lt;/code&gt;, &lt;code&gt;NOT_GROWN&lt;/code&gt;, &lt;code&gt;GROWING&lt;/code&gt;, &lt;code&gt;GROWN&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Animal&lt;/code&gt;: &lt;code&gt;RABBIT&lt;/code&gt;, &lt;code&gt;ELK&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;All bots should be Javascript functions, which take four arguments:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;grid&lt;/code&gt;: A 15 by 15 grid centered around the bot, with all items being objects:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;terrain&lt;/code&gt;: A type of &lt;code&gt;Terrain&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;details&lt;/code&gt;: An object, with a &lt;code&gt;has_berries&lt;/code&gt; property for &lt;code&gt;Terrain.BUSH&lt;/code&gt;, a &lt;code&gt;growth&lt;/code&gt; property for farmland (&lt;code&gt;Growth.EMPTY&lt;/code&gt; if no grain is planted), a &lt;code&gt;hit_points&lt;/code&gt; property for walls (starts as &lt;code&gt;10&lt;/code&gt; for wood or &lt;code&gt;75&lt;/code&gt; for stone), and a &lt;code&gt;fuels&lt;/code&gt; property for campfires (array of &lt;code&gt;Items.STICK&lt;/code&gt;, &lt;code&gt;Items.LOG&lt;/code&gt;, and &lt;code&gt;Items.CHARCOAL&lt;/code&gt;, does not include partially burned)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;bots&lt;/code&gt;: An array of bots, with all being objects:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;tribe&lt;/code&gt;: A string containing a tribe name&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;name&lt;/code&gt;: A string containing a bot name, if the bot is in the same tribe&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;animals&lt;/code&gt;: An array of animals, with all being one of &lt;code&gt;Animal.RABBIT&lt;/code&gt; or &lt;code&gt;Animal.ELK&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;bot&lt;/code&gt;: An object with information about the bot:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;hit_points&lt;/code&gt;: Hit points&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;hunger&lt;/code&gt;: Hunger&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;position&lt;/code&gt;: Position as &lt;code&gt;[x, y]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;items&lt;/code&gt;: An array of items held, with all items being objects:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;id&lt;/code&gt;: A unique ID for this item&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;item&lt;/code&gt;: A type of &lt;code&gt;Item&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;durability&lt;/code&gt;: For armor, axes, shovels, or spears, the remaining uses (or hit points) until broken&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;offers&lt;/code&gt;: An array of offers from other bots on the last turn:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;id&lt;/code&gt;: An ID unique to the offer&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;sell&lt;/code&gt;: An array of the items the seller is offering:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;item&lt;/code&gt;: A type of &lt;code&gt;Item&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;durability&lt;/code&gt;: For armor, axes, shovels, or spears, the remaining uses (or hit points) until broken&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;buy&lt;/code&gt;: An array of items the seller wants:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;item&lt;/code&gt;: A type of &lt;code&gt;Item&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;durability&lt;/code&gt;: For armor, axes, shovels, or spears, the minimum durability acceptable&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;talking&lt;/code&gt;: An array of data sent from other bots on the last turn:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;name&lt;/code&gt;: The name of the sending bot&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;data&lt;/code&gt;: The data sent by the bot&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;storage&lt;/code&gt;: An object that can be used for storage between turns&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;p&gt;(Note that none of the links to &lt;code&gt;More&lt;/code&gt; work yet)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this clear enough as it is, without the technical details?&lt;/li&gt;&#xA;&lt;li&gt;Is there too much information, or is it too hard to read?&lt;/li&gt;&#xA;&lt;li&gt;Do you think there will be strategy and clever bot design?&lt;/li&gt;&#xA;&lt;li&gt;Would you compete in this challenge? Why not?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;New features&lt;/h2&gt;&#xA;&lt;p&gt;Things I recently added:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Trading between tribes&lt;/li&gt;&#xA;&lt;li&gt;Communication within tribes&lt;/li&gt;&#xA;&lt;li&gt;Bronze and iron, and better tools&lt;/li&gt;&#xA;&lt;li&gt;Crates to store items&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2021-03-09T15:47:01.570" LastActivityDate="2021-03-09T15:47:01.570" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="20856" PostTypeId="2" ParentId="2140" CreationDate="2021-03-10T05:28:51.593" Score="-1" Body="&lt;h1&gt;Random Roman Numerals&lt;/h1&gt;&#xA;&lt;p&gt;Printing a random number is easy, but what about roman numerals? Your task is to output a random roman numeral from 1 to 1000, both inclusive.&lt;/p&gt;&#xA;&lt;p&gt;Requirements:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each number has to have the same chance of appearing&lt;/li&gt;&#xA;&lt;li&gt;The program should use the language's random module or other random algorithm&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Remember, I is 1, II is 2, III is 3. V is 5, X is 10, L is 50, C is 100, D is 500, and M is 1000. Also note that IV is 4, IX is 9, XL is 40, XC is 90, CD is 400, and CM is 900. For more information see &lt;a href=&quot;https://en.wikipedia.org/wiki/Roman_numerals&quot; rel=&quot;nofollow noreferrer&quot;&gt;the Wikipedia page&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This challenge is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so try to have the shortest program possible!&lt;/p&gt;&#xA;" OwnerUserId="100585" LastActivityDate="2021-03-10T05:28:51.593" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20857" PostTypeId="2" ParentId="2140" CreationDate="2021-03-10T10:32:49.150" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/220662/hello-permutations&quot;&gt;Hello, Permutations!&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77516" LastEditorUserId="77516" LastEditDate="2021-03-14T07:30:50.527" LastActivityDate="2021-03-14T07:30:50.527" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="20858" PostTypeId="1" CreationDate="2021-03-11T00:02:25.870" Score="2" ViewCount="74" Body="&lt;p&gt;BACKGROUND: I am a CS lecturer (teaching C++) and I keep thinking how to incorporate coding challenges in teaching.&lt;/p&gt;&#xA;&lt;p&gt;Many questions in this site are great; I have just used &lt;a href=&quot;https://codegolf.stackexchange.com/questions/49671/do-you-want-to-code-a-snowman&quot;&gt;Do you want to code a snowman?&lt;/a&gt; as a warm-up homework assignment. The challenge of writing short programs fits my goal of encouraging my students to write short and succinct code. The problem is, when the code is made too short (e.g. by putting everything in a single line without spaces), it is not readable - which goes against another educational goal.&lt;/p&gt;&#xA;&lt;p&gt;QUESTION: is there a way to design a challenge of the form &amp;quot;solve problem X using the shortest code possible, but the code must still be readable&amp;quot;?&lt;/p&gt;&#xA;&lt;p&gt;I am not sure how to define &amp;quot;readable&amp;quot; in a consistent way; maybe &amp;quot;the code should pass a linter check&amp;quot;?&lt;/p&gt;&#xA;" OwnerUserId="12019" LastActivityDate="2021-03-11T01:22:24.790" Title="Adding readability as a constraint" Tags="|discussion|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20859" PostTypeId="2" ParentId="20858" CreationDate="2021-03-11T01:22:24.790" Score="4" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Atomic code golf challenges define a language (or subset of one), and require doing something with as few of those operations as possible.&lt;/p&gt;&#xA;&lt;p&gt;The advantage of this is that the formatting doesn't matter very much. You could write your program with whatever whitespace and variable names you want, as long as what counts as an operation is clearly defined. This doesn't require compact code, but it does require compact algorithms (not necessarily fast ones, though :p).&lt;/p&gt;&#xA;&lt;p&gt;A disadvantage of something like this is that what counts as an operation must be &lt;em&gt;very&lt;/em&gt; clearly defined, and if you're trying to make the language used something complicated like C++, quite a lot of work will need to be put in to do this.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-03-11T01:22:24.790" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20860" PostTypeId="2" ParentId="2140" CreationDate="2021-03-11T02:19:19.197" Score="4" Body="&lt;h1&gt;Calculate the 'geothmetic meandian' of a set of numbers&lt;/h1&gt;&#xA;&lt;p&gt;Randall Munroe's March 10 xkcd comic &lt;a href=&quot;https://xkcd.com/2435/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&amp;quot;Geothmetic Meandian&amp;quot;&lt;/a&gt; defines the 'geothmetic meandian' of a set of positive real numbers as follows.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Define a function F, such that F accepts a set of &lt;em&gt;n&lt;/em&gt; positive real numbers and returns the set (&lt;em&gt;a&lt;/em&gt;, &lt;em&gt;b&lt;/em&gt;, &lt;em&gt;c&lt;/em&gt;), where &lt;em&gt;a&lt;/em&gt; is the arithmetic mean of the set (the sum of the numbers in the set divided by &lt;em&gt;n&lt;/em&gt;), &lt;em&gt;b&lt;/em&gt; is the geometric mean of the set (the product of the numbers in the set to the power of &lt;em&gt;1/n&lt;/em&gt;), and &lt;em&gt;c&lt;/em&gt; is the median of the set (the average of the middle two numbers in the sorted set when &lt;em&gt;n&lt;/em&gt; is even, and the middle number in the set when &lt;em&gt;n&lt;/em&gt; is odd). The function F can therefore be applied again to its own output. Iterating F an infinite number of times should cause its three outputs to converge to one value &lt;em&gt;g&lt;/em&gt;. This value &lt;em&gt;g&lt;/em&gt; is defined as the &lt;em&gt;geothmetic meandian&lt;/em&gt; of the original set of positive reals. (For the purposes of this challenge, you may assume this value exists and does not diverge.)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Given a nonempty list of positive real numbers in any convenient and reasonable format and a positive integer &lt;em&gt;q&lt;/em&gt;, compute its 'geothmetic meandian' to &lt;em&gt;q&lt;/em&gt; &lt;a href=&quot;https://en.wikipedia.org/wiki/Significant_figures&quot; rel=&quot;nofollow noreferrer&quot;&gt;significant figures&lt;/a&gt;. Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply, and the shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[1], 2] --&amp;gt; 1.0&#xA;[[2, 8], 4] --&amp;gt; 4.742&#xA;[[1, 1, 2, 3, 5], 6] --&amp;gt; 2.08906&#xA;[[1, 2, 4, 8], 6] --&amp;gt; 3.13227&#xA;[[1.1, 2.2, 4.4, 8.8], 9] --&amp;gt; 3.44550208&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="90437" LastEditorUserId="90437" LastEditDate="2021-03-11T02:27:34.503" LastActivityDate="2021-03-11T02:27:34.503" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="20861" PostTypeId="1" CreationDate="2021-03-11T14:11:09.927" Score="33" ViewCount="6901" Body="&lt;h2&gt;What is this site?&lt;/h2&gt;&#xA;&lt;p&gt;This is a place to host recreational coding challenges, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot;&gt;code golf&lt;/a&gt;. We are unlike most sites in the &lt;a href=&quot;https://stackexchange.com/&quot;&gt;Stack Exchange network&lt;/a&gt;. &lt;strong&gt;We are not a question-answer site, nor are we a forum&lt;/strong&gt;, instead we use the Stack Exchange network as a host for our coding challenges and solutions. Please note that &lt;strong&gt;general programming questions are not on-topic here&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This site is split into 3 parts: &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;Main&lt;/a&gt;, where people post challenges and solutions; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/&quot;&gt;Meta&lt;/a&gt;, a site for discussing the main site; and &lt;a href=&quot;https://chat.stackexchange.com/?tab=site&amp;amp;host=codegolf.stackexchange.com&quot;&gt;Chat&lt;/a&gt;, where users can discuss a large range of topics (not all about the site) in a much more informal manner.&lt;/p&gt;&#xA;&lt;h2&gt;What is this page?&lt;/h2&gt;&#xA;&lt;p&gt;This page is a new users' guide to getting started on the site. Because of our differences to the other Stack Exchange sites, it can be difficult to start here without some knowledge of our long established rules and traditions. Below this question are 3 answers designed to address and help you with specific parts of our site: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20862/66833&quot;&gt;&lt;strong&gt;Asking&lt;/strong&gt;&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20863/66833&quot;&gt;&lt;strong&gt;Answering&lt;/strong&gt;&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20864/66833&quot;&gt;&lt;strong&gt;Everything else&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Additionally, we suggest you read through our &lt;a href=&quot;https://codegolf.stackexchange.com/tour&quot;&gt;Tour page&lt;/a&gt;. Doing so earns you a shiny &lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/83/informed&quot;&gt;badge&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;What do I need to know in order to understand these answers?&lt;/h2&gt;&#xA;&lt;p&gt;The answers assume that you have very little knowledge of the Stack Exchange model. However, before reading through them, it's recommended to familiarise yourself with the following terms:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/vote-up&quot;&gt;Upvote&lt;/a&gt;: A vote indicating you agree with or like the post, or that you think it's useful. See &lt;a href=&quot;https://meta.stackexchange.com/questions/130046/when-should-i-vote&quot;&gt;When should I vote?&lt;/a&gt; for more information&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/vote-down&quot;&gt;Downvote&lt;/a&gt;: A vote indicating you disagree with or dislike the post, or that you don't think it's useful. It's recommend that you leave a comment explaining why you downvoted, to give the post author a chance to correct their post if possible&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/whats-reputation&quot;&gt;Reputation&lt;/a&gt;: A score assigned to each user reflecting how useful their contributions to the site are. You gain reputation by contributing in a positive manner, and you lose it by posting low quality, off-topic or spam content.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;I've read through the answers and I still have a question!&lt;/h2&gt;&#xA;&lt;p&gt;The answers below are not designed to be comprehensive - instead, they are supposed to cover the base information we believe new users will benefit the most from. If you still have a question after reading them, check out our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1280/community-faq-for-programming-puzzles-code-golf&quot;&gt;FAQ&lt;/a&gt;, ask users in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;chat&lt;/a&gt; or &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/ask&quot;&gt;post a question on Meta&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Additionally, these posts are &lt;a href=&quot;https://meta.stackexchange.com/q/11740/355458&quot;&gt;Community Wiki&lt;/a&gt;, which allows anyone with 10 reputation or more to edit them. If you think something is missing that really should be included, don't hesitate to edit it in.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Welcome to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12537/what-are-our-specific-abbreviations-and-terms&quot;&gt;CGCC&lt;/a&gt;! We hope you enjoy your time on the site!&lt;/p&gt;&#xA;&lt;h2&gt;Helpful links&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1280/community-faq-for-programming-puzzles-code-golf&quot;&gt;Community FAQ for Programming Puzzles &amp;amp; Code Golf&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;Our community chat room&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help&quot;&gt;Help page&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/tour&quot;&gt;Tour page&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;Main&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/&quot;&gt;Meta&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/?tab=site&amp;amp;host=codegolf.stackexchange.com&quot;&gt;Chat&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="68942" LastEditDate="2021-06-03T02:42:50.163" LastActivityDate="2023-07-23T15:47:18.153" Title="Welcome to Code Golf and Coding Challenges Stack Exchange!" Tags="|discussion|support|faq|new-users|" AnswerCount="3" CommentCount="0" CommunityOwnedDate="2021-03-11T21:10:44.600" ContentLicense="CC BY-SA 4.0" />
  <row Id="20862" PostTypeId="2" ParentId="20861" CreationDate="2021-03-11T14:11:09.927" Score="14" Body="&lt;h1&gt;Asking&lt;/h1&gt;&#xA;&lt;p&gt;Asking good, high quality challenges is a key aspect of the site. Some users almost exclusively post challenges, and some prefer instead to only answer. However, asking is very different on this site than most forums or Stack Exchange sites.&lt;/p&gt;&#xA;&lt;h2&gt;How do I post a challenge?&lt;/h2&gt;&#xA;&lt;p&gt;It's very easy to post a challenge. Simply click the &lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/ask&quot;&gt;Ask Question&lt;/a&gt;&lt;/em&gt; button, choose a title, write a specification and choose up to 5 relevant &lt;a href=&quot;https://codegolf.stackexchange.com/help/tagging&quot;&gt;tags&lt;/a&gt;. However, writing a high quality challenge takes practice, and a lot of it. We require challenges to meet various different criteria, and hitting all of them at once, especially if you are unpractised, can be difficult.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;We &lt;em&gt;highly&lt;/em&gt; recommend using &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;the Sandbox&lt;/a&gt; before posting a challenge on main.&lt;/strong&gt; We also suggest &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=57033246#57033246&quot;&gt;answering before asking&lt;/a&gt;, as this will allow you to get a better understanding of what a challenge needs to look like, and how well specified one should be.&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, we have a number of posts designed to help challenge authors:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9022/unspoken-challenge-rules&quot;&gt;Unspoken challenge rules&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5582/things-to-consider-when-creating-a-challenge&quot;&gt;Things to consider when creating a challenge&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges&quot;&gt;Things to avoid when writing challenges&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;Default for Code Golf: Input/Output methods&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1511/template-for-challenges&quot;&gt;Template For Challenges&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Finally, please post a challenge only when you're able to stay around for an hour to address immediate feedback.&lt;/p&gt;&#xA;&lt;h2&gt;How do I format my challenge?&lt;/h2&gt;&#xA;&lt;p&gt;The Stack Exchange network uses a form of &lt;a href=&quot;https://codegolf.stackexchange.com/editing-help&quot;&gt;Markdown&lt;/a&gt;. This includes support for headers, links, images, bold text, italic text, underlined text, lists and more. Additionally, we support a form of &lt;span class=&quot;math-container&quot;&gt;\$\LaTeX\$&lt;/span&gt; called &lt;a href=&quot;https://www.mathjax.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Mathjax&lt;/a&gt; to properly show mathematical equations. For inline Mathjax, use &lt;code&gt;\$&lt;/code&gt; delimiters (for example: &lt;code&gt;\$3x^2+2x+1\$&lt;/code&gt; is &lt;span class=&quot;math-container&quot;&gt;\$3x^2+2x+1\$&lt;/span&gt;). For blocks of Mathjax, use &lt;code&gt;$$&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{matrix}&#xA;1 &amp;amp; 2 &amp;amp; 3 \\&#xA;4 &amp;amp; 5 &amp;amp; 6 \\&#xA;7 &amp;amp; 8 &amp;amp; 9 \\&#xA;\end{matrix}&#xA;$$&lt;/span&gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;is shown as&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{matrix}&#xA;1 &amp;amp; 2 &amp;amp; 3 \\&#xA;4 &amp;amp; 5 &amp;amp; 6 \\&#xA;7 &amp;amp; 8 &amp;amp; 9 \\&#xA;\end{matrix}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Check out the &lt;a href=&quot;https://math.meta.stackexchange.com/questions/5020/mathjax-basic-tutorial-and-quick-reference&quot;&gt;MathJax basic tutorial and quick reference&lt;/a&gt; for more help.&lt;/p&gt;&#xA;&lt;h2&gt;What criteria do challenges need to meet?&lt;/h2&gt;&#xA;&lt;p&gt;Challenges must:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Have an &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8130/why-do-we-have-objective-winning-criteria&quot;&gt;objective scoring criteria&lt;/a&gt;, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot;&gt;code golf&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot;&gt;fastest code&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Be clearly specified. As is the case with all questions on the Stack Exchange network, your challenge must be in English and clearly written. In order to make sure your challenge is clear, we recommend using the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/duplicates&quot;&gt;Be unique&lt;/a&gt;. Unlike a large number of sites on the internet, we strictly forbid reposts and copies of other people's work. However, we currently have well over 10000 questions, and it is unfeasible to expect you to check every single one. What we do expect is that you make a brief and honest &lt;a href=&quot;https://codegolf.stackexchange.com/search&quot;&gt;search&lt;/a&gt; for anything similar, and that you don't explicitly copy an existing challenge. Furthermore, posting in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt; is a good way to avoid posting duplicate challenges to main.&lt;/li&gt;&#xA;&lt;li&gt;Be &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;on topic&lt;/a&gt;. &lt;strong&gt;We do not allow general programming help questions&lt;/strong&gt;. Those belong on &lt;a href=&quot;https://stackoverflow.com&quot;&gt;Stack Overflow&lt;/a&gt;, not here. Before posting your question, &lt;strong&gt;make sure it is on topic&lt;/strong&gt;. If you aren't sure, feel free to ask in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;chat&lt;/a&gt; or post a draft to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt; asking if it is.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;What are the possible scoring criteria?&lt;/h2&gt;&#xA;&lt;p&gt;All challenges must have an objective scoring criteria. A full list can be found &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/22371/66833&quot;&gt;here&lt;/a&gt;, but the most popular are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;: An answer's score is the length of the code in bytes&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;: The winner is the fastest code. These challenges typically involve timing submissions on the author's computer, so should include your computer specifications&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;: Scores are calculated in any other objective manner than existing criteria&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;By the simplistic nature of its scoring criteria, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is the easiest challenge type to write. Furthermore, non-code golf challenges can be very easy to underspecify or can have a scoring criteria which does not encourage competition. We suggest that, before writing a challenge with a specific winning criteria, you answer an existing challenge with the same criteria, in order to get a hang of the nuances of the scoring.&lt;/p&gt;&#xA;&lt;h2&gt;What is this Sandbox you keep mentioning?&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;The Sandbox for Proposed Challenges&lt;/a&gt; is a place where you can post your challenge drafts in order to get feedback on them before posting to main. Going through the Sandbox first allows you to fix unclear details, avoid downvotes and &lt;a href=&quot;https://codegolf.stackexchange.com/help/closed-questions&quot;&gt;close votes&lt;/a&gt;, and prevent answerers from exploiting loopholes in your challenge, thus ruining the fun for you. While a draft is here, people will offer advice and feedback on how to improve it. See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2056/how-does-the-sandbox-work-how-do-i-use-it&quot;&gt;How does the Sandbox work? How do I use it?&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18069/sandbox-instructions-for-new-users&quot;&gt;Sandbox instructions for new users&lt;/a&gt; for more information&lt;/p&gt;&#xA;&lt;p&gt;We also encourage you to do the same: if you have a few minutes of free time to spend, consider looking at some recently &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?answertab=active#tab-top&quot;&gt;active drafts&lt;/a&gt; and leave some feedback. Furthermore, we have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8474/introducing-the-ppcg-sandbox-viewer&quot;&gt;userscript&lt;/a&gt; designed to improve the feedback process. While a draft is in the Sandbox, voting customs change slightly:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Upvoting signifies that you believe the challenge is ready and will be well received on main&lt;/li&gt;&#xA;&lt;li&gt;Downvoting suggests you believe that, even if fully clarified, the challenge is unlikely to do well on main&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;How long should I leave a draft in the Sandbox?&lt;/h2&gt;&#xA;&lt;p&gt;A week is the most recommended time. For more complex challenges, longer is better and for more basic challenges, you can get away with a few days.&lt;/p&gt;&#xA;&lt;p&gt;There is no hard or fast limit though. We do have a number of recommended points to check off before posting, however:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's generally recommended to wait a minimum of 72 hours in order to allow enough people to see your draft.&lt;/li&gt;&#xA;&lt;li&gt;If a draft has a score of +3 or more, it's likely to be well received&lt;/li&gt;&#xA;&lt;li&gt;If you've gone 2 days without any further feedback from commenters, it's likely to be clear enough to be posted. This assumes you've been regularly asking for feedback.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13040/66833&quot;&gt;Don't assume you've addressed all Sandbox feedback&lt;/a&gt; however. Posting a draft into the Sandbox is not a guarantee of quality, and it requires participation from other users to work as intended. Properly read through your draft, imagine you were trying to answer it and repeatedly ask for feedback. Don't worry about annoying people; so long as you don't ask exceedingly often, people will be more than happy to leave even a small amount of feedback.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;How do I get feedback on my Sandbox posts?&lt;/h2&gt;&#xA;&lt;p&gt;Ask in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;chat&lt;/a&gt; (an &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=57192349#57192349&quot;&gt;example&lt;/a&gt; of such an ask). Make sure you link to your post, and to specifically ask for feedback. Some people will respond in chat, rather than leave a comment. Be sure not to forget about this feedback, which is easier to lose track of than comments.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; has a &lt;a href=&quot;https://chat.stackexchange.com/users/510186/sandbox-posts&quot;&gt;chat bot&lt;/a&gt; that posts recently Sandboxed drafts into chat. When you first post your draft, you don't need to post a link into chat, as the bot will do this for you.&lt;/p&gt;&#xA;&lt;h2&gt;I've posted my challenge. Now what?&lt;/h2&gt;&#xA;&lt;p&gt;Now you wait for the upvotes and answers. Some users may request additional clarifications in the comments. So long as you answer these promptly and don't contradict the main post, this won't be an issue. Be sure to edit in any clarifications or rule changes you make into the main post after leaving a comment. &lt;strong&gt;Please do not significantly change your challenge after posting it&lt;/strong&gt; as this can invalidate people's answers.&lt;/p&gt;&#xA;&lt;p&gt;We also recommend &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11620/66833&quot;&gt;against accepting an answer&lt;/a&gt;, in order to fairly and properly promote competition within languages, rather than between languages.&lt;/p&gt;&#xA;&lt;h2&gt;I posted my challenge in the Sandbox but it got closed on Main!&lt;/h2&gt;&#xA;&lt;p&gt;Sometimes, however, people will find things that were missed in the Sandbox that make the challenge unclear. The Sandbox is not a perfect system. If this happens, your challenge may be closed as &amp;quot;Needs details or clarity&amp;quot;. &lt;strong&gt;Don't worry&lt;/strong&gt;. Closing challenges is designed to be a temporary measure, and every closed challenge can be reopened in the same manner.&lt;/p&gt;&#xA;&lt;p&gt;In order to get your challenge reopened, take a look through the comments underneath it. People will have commented exactly what they found unclear with the challenge, and addressing these points is the quickest way to reopen it. Additionally, if you are able to, asking what could be improved in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;chat&lt;/a&gt; allows people to have more of a discussion than in comments. You are able to ask the specific users who voted to close your challenge by &amp;quot;pinging&amp;quot; them either in comments or chat (&lt;code&gt;@username&lt;/code&gt;), but keep in mind that they are under no obligation to answer you.&lt;/p&gt;&#xA;&lt;p&gt;Editing a closed challenge automatically sends it to the &lt;a href=&quot;https://codegolf.stackexchange.com/review/reopen&quot;&gt;Reopen votes review queue&lt;/a&gt; where users will review your updated challenge and decide whether or not it is clear enough to be reopened.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;For more questions about asking, check out the &lt;a href=&quot;https://codegolf.stackexchange.com/help/asking&quot;&gt;&amp;quot;How to Ask&amp;quot; help pages&lt;/a&gt; or browse the &lt;a href=&quot;/questions/tagged/asking-questions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;asking-questions&amp;#39;&quot; rel=&quot;tag&quot;&gt;asking-questions&lt;/a&gt; tag on Meta.&lt;/p&gt;&#xA;&lt;h2&gt;Helpful links&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox for Proposed Challenges&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/asking&quot;&gt;How to Ask&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9022/unspoken-challenge-rules&quot;&gt;Unspoken challenge rules&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5582/things-to-consider-when-creating-a-challenge&quot;&gt;Things to consider when creating a challenge&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges&quot;&gt;Things to avoid when writing challenges&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;Default for Code Golf: Input/Output methods&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1511/template-for-challenges&quot;&gt;Template For Challenges&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2056/how-does-the-sandbox-work-how-do-i-use-it&quot;&gt;How does the Sandbox work? How do I use it?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18069/sandbox-instructions-for-new-users&quot;&gt;Sandbox instructions for new users&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/908/66833&quot;&gt;A list of objective winning criteria&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1324/standard-definitions-of-terms-within-specifications&quot;&gt;Standard definitions of terms within specifications&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="43319" LastEditDate="2022-07-04T18:10:16.400" LastActivityDate="2022-07-04T18:10:16.400" CommentCount="1" CommunityOwnedDate="2021-03-11T14:11:09.927" ContentLicense="CC BY-SA 4.0" />
  <row Id="20863" PostTypeId="2" ParentId="20861" CreationDate="2021-03-11T14:12:37.513" Score="15" Body="&lt;h1&gt;Answering&lt;/h1&gt;&#xA;&lt;p&gt;Unlike most Stack Exchange sites, answers here are typically easier to write than questions. However, there are a few things that every answer needs to include, and a couple of criteria they should meet.&lt;/p&gt;&#xA;&lt;h2&gt;What should my answer look like?&lt;/h2&gt;&#xA;&lt;p&gt;We have a standard format for answers, which you can get hold of in 2 main ways.&lt;/p&gt;&#xA;&lt;p&gt;If your language is on &lt;a href=&quot;https://tio.run/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt;, you can write up your solution in the Code section on Try it online! (commonly referred to as TIO), click the &amp;quot;Link&amp;quot; button at the top of the page and Copy-Paste the test in the &amp;quot;Code Golf submission (Stack Exchange)&amp;quot; field. TIO is not regularly updated anymore, so if you need a newer version of a language, you can use the similar &lt;a href=&quot;https://ato.pxeger.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Attempt This Online!&lt;/a&gt; (abbreviated as ATO and maintained by &lt;a href=&quot;https://codegolf.stackexchange.com/users/97857/pxeger&quot;&gt;pxeger&lt;/a&gt;) which has a similar &amp;quot;Copy to clipboard &amp;gt; CGCC post&amp;quot; option in the top right corner.&lt;/p&gt;&#xA;&lt;p&gt;Alternatively, the standard formats are, in Markdown:&lt;/p&gt;&#xA;&lt;p&gt;For &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; challenges:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;# [&amp;lt;Language Name&amp;gt;][1], &amp;lt;length&amp;gt; bytes&#xA;&#xA;```&#xA;&amp;lt;code&amp;gt;&#xA;```&#xA;    &#xA;[Try it here!][2]&#xA;&#xA;&amp;lt;explanation&amp;gt;&#xA;&#xA;[1]: &amp;lt;link to language page&amp;gt;&#xA;[2]: &amp;lt;link to an online testing environment&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For other challenges:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;# [&amp;lt;Language Name&amp;gt;][1], &amp;lt;score&amp;gt;&#xA;&#xA;```&#xA;&amp;lt;code&amp;gt;&#xA;```&#xA;    &#xA;[Try it here!][2]&#xA;&#xA;&amp;lt;explanation&amp;gt;&#xA;&#xA;[1]: &amp;lt;link to language page&amp;gt;&#xA;[2]: &amp;lt;link to an online testing environment&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;What should and shouldn't be in my answer?&lt;/h2&gt;&#xA;&lt;p&gt;Your answer should, at the bare minimum, include the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The language name&lt;/li&gt;&#xA;&lt;li&gt;Your score, as defined by the challenge&lt;/li&gt;&#xA;&lt;li&gt;The code you are submitting&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Your answer should not include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Promotions or links unrelated to the challenge&lt;/li&gt;&#xA;&lt;li&gt;Spam&lt;/li&gt;&#xA;&lt;li&gt;Language such as &amp;quot;Hi&amp;quot;, &amp;quot;Thanks for the challenge&amp;quot; or other chatty language&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Your code must:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Make a serious effort at winning. This doesn't mean that you have to have the shortest code in a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; challenge to participate, but it does mean you shouldn't post code with long variable names, unnecessary whitespace and more.&lt;/li&gt;&#xA;&lt;li&gt;Complete the task in the question. If the question asks you to print &lt;code&gt;Hello, World!&lt;/code&gt; and your code does anything other than print &lt;code&gt;Hello, World!&lt;/code&gt;, it is not a valid answer. Make sure that you handle all the test cases included in the question.&lt;/li&gt;&#xA;&lt;li&gt;Not break any of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;standard loopholes&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;What are all these crazy short answers?&lt;/h2&gt;&#xA;&lt;p&gt;We allow any languages to be used on the site, so long as you can provide a working interpreter. A lot of people decide to create their own languages specifically designed for code golf, leading to the rise of languages such as &lt;a href=&quot;http://www.golfscript.com/golfscript/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Golfscript&lt;/a&gt;, &lt;a href=&quot;https://sourceforge.net/p/cjam/wiki/Home/&quot; rel=&quot;nofollow noreferrer&quot;&gt;CJam&lt;/a&gt;, &lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt; and others.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Don't worry about these&lt;/strong&gt;. If you prefer to golf in a language you're more familiar with, please, use that language, and don't care about how long it is. Languages such as Java are generally going to be more competitive with similar languages (e.g. C#) rather than with golfing languages, and so we prefer to consider &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; challenges as competitions within languages. So &lt;a href=&quot;https://github.com/Adriandmen/05AB1E&quot; rel=&quot;nofollow noreferrer&quot;&gt;05AB1E&lt;/a&gt; answers try to compete with other 05AB1E answers and other golfing languages, while Java answers try to compete with other Java answers and with languages comparable to it.&lt;/p&gt;&#xA;&lt;p&gt;Some languages use characters outside of the standard ASCII range. Often, these use custom code pages to encode their answers instead of the standard Unicode table. If you have any doubts or concerns, don't hesitate to leave a comment or check out our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10145/how-to-count-bytes-faq&quot;&gt;How to count bytes FAQ&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Ok, I want to answer a challenge. How do I do that?&lt;/h2&gt;&#xA;&lt;p&gt;The easiest way to get started is to just start! Head over to the &lt;a href=&quot;https://codegolf.stackexchange.com/questions&quot;&gt;challenges page&lt;/a&gt; and choose one you like the look of. Fire up your favourite code editor/IDE/whatever you use to code, and start working on a solution to the challenge. Once you've got a working program, post it as an answer. Some things to help you:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the challenge includes a bunch of test cases, setting up a testing environment where you can quickly check that your code still works for each input after any changes is a smart way to keep your answer valid&lt;/li&gt;&#xA;&lt;li&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11924/new-users-guides-to-golfing-rules-in-specific-languages&quot;&gt;New users&amp;#39; guides to golfing rules in specific languages&lt;/a&gt; is likely to contain specific examples, rules and details for competing in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; challenges for your favourite language.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-tips-tooltip-container&quot;&gt;tips&lt;/a&gt; pages will likely have ways you can golf down your answer. Almost every language under the sun has a &amp;quot;Tips for golfing in language&amp;quot; page, so &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=is%3Aq+tips+for+golfing+in&quot;&gt;searching for it&lt;/a&gt; (add your language name after the &amp;quot;in&amp;quot; in the search bar) will most likely help you save some bytes.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Avoid the standard loopholes&lt;/a&gt;. They were funny in 2011, but the site now strives towards good quality answers.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;The standard Input and Output methods&lt;/a&gt; list various different ways you can take input and output&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Note that inputting via a variable (&amp;quot;The input is in variable &lt;code&gt;s&lt;/code&gt;&amp;quot;) is &lt;strong&gt;not&lt;/strong&gt; a permissible method of input.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet&quot;&gt;Programs must be full programs or functions, not snippets&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Don't worry about not being the shortest answer there. Other users are more than willing to suggest golfing opportunities and ways you can improve your solution.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;For more questions about answering, check out the &lt;a href=&quot;https://codegolf.stackexchange.com/help/answering&quot;&gt;&amp;quot;How to Answer&amp;quot; help pages&lt;/a&gt; or browse the &lt;a href=&quot;/questions/tagged/answers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answers&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;answers&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-answers-tooltip-container&quot;&gt;answers&lt;/a&gt; tag on Meta.&lt;/p&gt;&#xA;&lt;h2&gt;Helpful links:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/202/where-to-find-an-online-testing-environment-for-specific-programming-languages&quot;&gt;Where to find an online testing environment for specific programming languages?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10145/how-to-count-bytes-faq&quot;&gt;How to count bytes FAQ&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Loopholes that are forbidden by default&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11924/new-users-guides-to-golfing-rules-in-specific-language&quot;&gt;New users&amp;#39; guides to golfing rules in specific languages&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;Default for Code Golf: Input/Output methods&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet&quot;&gt;Default for Code Golf: Program, Function or Snippet?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/answering&quot;&gt;&amp;quot;How to Answer&amp;quot; help pages&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="108687" LastEditDate="2023-07-23T15:47:18.153" LastActivityDate="2023-07-23T15:47:18.153" CommentCount="0" CommunityOwnedDate="2021-03-11T14:12:37.513" ContentLicense="CC BY-SA 4.0" />
  <row Id="20864" PostTypeId="2" ParentId="20861" CreationDate="2021-03-11T14:14:30.450" Score="11" Body="&lt;h1&gt;Everything Else&lt;/h1&gt;&#xA;&lt;p&gt;Despite being primarily for challenges and solutions, there is still a lot more to the site. This post addresses some of the more common questions about aspects of the site aside from asking and answering.&lt;/p&gt;&#xA;&lt;h2&gt;Who moderates this site?&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges&quot;&gt;We all do&lt;/a&gt;. Unlike the vast majority of sites on the Internet, Stack Exchange sites are moderated by their communities, barring a few exceptions. There are three &amp;quot;categories of users&amp;quot;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://meta.stackexchange.com/questions/331654/employee-profiles-are-now-marked-with-a-staff-indicator&quot;&gt;Stack Exchange employees&lt;/a&gt;. These are the users who work at the company Stack Exchange. You'll very rarely see them around the site, and if you do, they'll likely be on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/&quot;&gt;Meta&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://stackoverflow.blog/2009/05/18/a-theory-of-moderation/?_ga=2.195312812.1873435913.1613747475-1814253358.1578001144&quot;&gt;Diamond moderators&lt;/a&gt;. These are &lt;a href=&quot;https://codegolf.stackexchange.com/election&quot;&gt;democratically elected&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=moderators&quot;&gt;users&lt;/a&gt; who handle the rare circumstances where standard users cannot moderate. Typically, this involves &lt;a href=&quot;https://codegolf.stackexchange.com/help/flagging&quot;&gt;flags&lt;/a&gt; or stepping in during disagreements. You can see if a user is a diamond moderator as they have a &lt;code&gt;♦&lt;/code&gt; next to their name at all times. Despite being moderators, they are still members of the community and should be treated as you would treat any other user.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=reputation&quot;&gt;Everyone else&lt;/a&gt;. These are the 99.999% of users, and the vast majority of the users you'll interact with on the site.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;So how does the community moderate the site? Through &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges&quot;&gt;privileges&lt;/a&gt;, which are directly tied to your &lt;a href=&quot;https://codegolf.stackexchange.com/help/whats-reputation&quot;&gt;reputation score&lt;/a&gt;. There are a lot of different privileges you can get, ranging from needing 1 reputation to 25000, but the ones involving moderation are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;At 1 reputation (so from the start), you can &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/create-posts&quot;&gt;create posts&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;At 15 reputation, you can &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/flag-posts&quot;&gt;flag posts&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/vote-up&quot;&gt;upvote posts&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;At 20 reputation, you can &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/chat&quot;&gt;talk in chat&lt;/a&gt;. This applies to your total reputation across the network.&lt;/li&gt;&#xA;&lt;li&gt;At 50 reputation, you can &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/comment&quot;&gt;comment&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;At 125 reputation, you can &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/vote-down&quot;&gt;downvote&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;At 250 reputation, you can &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/view-close-votes&quot;&gt;see and cast close votes&lt;/a&gt; on your own challenges.&lt;/li&gt;&#xA;&lt;li&gt;At 500 reputation, you gain &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/access-review-queues&quot;&gt;access to the First Posts and Late Answers review queues&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;At 2000 reputation, your &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/edit&quot;&gt;edits no longer require approval&lt;/a&gt; and you gain access to the &lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits&quot;&gt;Suggested Edits&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/review/low-quality-posts&quot;&gt;Low Quality Posts&lt;/a&gt; review queues.&lt;/li&gt;&#xA;&lt;li&gt;At 3000 reputation, you can &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/close-questions&quot;&gt;vote to close any challenge&lt;/a&gt; and you gain access to the &lt;a href=&quot;https://codegolf.stackexchange.com/review/close&quot;&gt;Close Votes&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/review/reopen&quot;&gt;Reopen votes&lt;/a&gt; review queues.&lt;/li&gt;&#xA;&lt;li&gt;At 10000 reputation, you can &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/moderator-tools&quot;&gt;delete challenges, see deleted posts and view moderator tools&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;At 20000 reputation, you can &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/trusted-user&quot;&gt;delete any post and edit tag wikis without needed approval&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;What is the Meta site?&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/&quot;&gt;Meta&lt;/a&gt; is a separate but related site where users can discuss the site itself. Topics include our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19279/nominations-for-language-of-the-month-2020-edition&quot;&gt;Language of the Month&lt;/a&gt; series, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/tagged/policy&quot;&gt;policy decisions&lt;/a&gt; (either on specific languages or in general), our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox for Proposed Challenges&lt;/a&gt; and much more.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Keep in mind that Meta is not a place to post your closed challenges, and doing so will lead to the Meta post being closed as well.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;What is commenting, and what is it for?&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/comment&quot;&gt;Commenting&lt;/a&gt; is an ability you get when you reach 50 reputation. It allows you to leave &amp;quot;comments&amp;quot; underneath users' posts. Note that you always have the ability to comment on your own posts. Comments are short (between 15 and 600 characters) and exist so that users can talk about questions and answers without posting new answers that do not make an attempt to answer the question asked. Comments are often used to ask for clarification on, suggest corrections to, and provide meta-information about posts. The post author is notified of new comments to their post.&lt;/p&gt;&#xA;&lt;p&gt;You can also notify one additional user in a comment by including &amp;quot;@username&amp;quot; in the comment. You can notify anyone who has commented on or edited the post this way. See &lt;a href=&quot;https://meta.stackexchange.com/questions/43019/how-do-comment-replies-work&quot;&gt;How do comment @replies work?&lt;/a&gt; for more information.&lt;/p&gt;&#xA;&lt;h2&gt;What should I do if I see a mistake in someone's post?&lt;/h2&gt;&#xA;&lt;p&gt;Edit it! Underneath every post is a link saying &lt;code&gt;Edit&lt;/code&gt;. Click this link and you'll be able to edit the post. However, until you reach 2000 reputation, your edits will be reviewed by higher reputation users before they're applied. &lt;strong&gt;Vandalism is not ok&lt;/strong&gt; on any post, even your own, and can lead to a temporary edit ban if done repeatedly.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Do not use edits to golf solutions&lt;/strong&gt;. Edits that try to improve an answer's score will be rejected. You should leave these improvements as comments instead.&lt;/p&gt;&#xA;&lt;p&gt;See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18751/when-it-is-and-is-not-acceptable-to-edit-someone-elses-post&quot;&gt;When it is and is not acceptable to edit someone else&amp;#39;s post&lt;/a&gt; for more guidelines on editing.&lt;/p&gt;&#xA;&lt;h2&gt;What are the gold, silver and bronze icons next to people's usernames?&lt;/h2&gt;&#xA;&lt;p&gt;These are &lt;a href=&quot;https://codegolf.stackexchange.com/help/badges&quot;&gt;badges&lt;/a&gt;. They are awarded when users perform certain actions. Aside from being nice, shiny icons next to your name, they have no effect beyond telling other users that you did a specific thing.&lt;/p&gt;&#xA;&lt;h2&gt;How do I use chat?&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/?tab=site&amp;amp;host=codegolf.stackexchange.com&quot;&gt;Chat&lt;/a&gt; is the place users can go to talk about more or less anything they like. It is made up of rooms, each with a specific topic. You need 20 reputation across the Stack Exchange network to chat in public rooms, 100 reputation to create your own public rooms and 1000 reputation to create &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/gallery-chat-rooms&quot;&gt;gallery rooms&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; is our site's main chat room. As said in the room description, it is for&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;General discussion for codegolf.stackexchange.com&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is deliberately vague; &amp;quot;General discussion&amp;quot; means exactly that. However, we do have a &lt;a href=&quot;https://ppcg.github.io/chatiquette/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Chatiquette&lt;/a&gt; that we ask you follow while chatting in the room. Please read through it at least once before chatting in the room - don't worry, it's short.&lt;/p&gt;&#xA;&lt;h2&gt;CGCC? TIO? TNB? VTC? What are all these acronyms?&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12537/what-are-our-specific-abbreviations-and-terms&quot;&gt;What are our specific abbreviations and terms?&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;A full glossary of terms can be found in that post, along with more general ones &lt;a href=&quot;https://meta.stackexchange.com/questions/40353/stack-exchange-glossary-dictionary-of-commonly-used-terms&quot;&gt;here&lt;/a&gt;. The most commonly used are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;CGCC: Code Golf and Coding Challenges, the name of the site&lt;/li&gt;&#xA;&lt;li&gt;TIO: &lt;a href=&quot;https://tio.run&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;TNB: &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;VTC/VTRO/VTD: Vote to Close, Reopen and Delete, respectively. Various different moderation votes available to users.&lt;/li&gt;&#xA;&lt;li&gt;ATO: &lt;a href=&quot;https://ato.pxeger.com/run&quot; rel=&quot;nofollow noreferrer&quot;&gt;Attempt This Online!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;PPCG: Programming Puzzles and Code Golf, the former name of the site, still used by the older users.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;For more questions about various aspects of the site, browse through the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions?tab=Active&quot;&gt;recently active Meta questions&lt;/a&gt;, or &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;ask in chat&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Helpful links&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges&quot;&gt;List of privileges&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/badges&quot;&gt;List of badges&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18641/66833&quot;&gt;Know how to vote&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/comment&quot;&gt;How do comments work?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12537/what-are-our-specific-abbreviations-and-terms&quot;&gt;What are our specific abbreviations and terms?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18751/when-it-is-and-is-not-acceptable-to-edit-someone-elses-post&quot;&gt;When it is and is not acceptable to edit someone else&amp;#39;s post&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="92689" LastEditDate="2022-07-09T16:53:32.510" LastActivityDate="2022-07-09T16:53:32.510" CommentCount="0" CommunityOwnedDate="2021-03-11T21:10:44.600" ContentLicense="CC BY-SA 4.0" />
  <row Id="20866" PostTypeId="2" ParentId="2140" CreationDate="2021-03-12T01:22:55.813" Score="1" Body="&lt;h1&gt;Find the Best Set of Adapters&lt;/h1&gt;&#xA;&lt;p&gt;Moved here: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/220911/find-the-best-set-of-adapters&quot;&gt;Find the Best Set of Adapters&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="96393" LastEditorUserId="96393" LastEditDate="2021-03-19T16:41:32.070" LastActivityDate="2021-03-19T16:41:32.070" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="20868" PostTypeId="5" CreationDate="2021-03-12T16:17:43.147" Score="0" Body="&lt;p&gt;Questions tagged with &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq&lt;/a&gt; are the most frequently asked questions on the site. They can and should cover all topics that any users - not just new users - frequently ask about.&lt;/p&gt;&#xA;&lt;p&gt;Before posting your own question, please consult these questions to see if there is already an answer that solves your problem.&lt;/p&gt;&#xA;&lt;h3&gt;How can a question be added to the FAQ?&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Ask only the question, stated plainly and simply, in the question body.&#xA;The answer goes in an answer.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Link back&lt;/strong&gt; to the index. Paste this at the end of the question:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; [Return to FAQ index](https://codegolf.meta.stackexchange.com/q/1280)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Tag as &lt;a href=&quot;/questions/tagged/faq-proposed&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;faq-proposed&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq-proposed&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/support&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt;.  When a post seems&#xA;to hit a mature state, it will have &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq&lt;/a&gt; added by a moderator.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Flag for a moderator to mark &lt;strong&gt;community wiki&lt;/strong&gt;.  Any FAQ post not yet&#xA;community wiki should be made into a community wiki.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;After the post has the &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq&lt;/a&gt; tag added to it, add a link in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1280&quot;&gt;table of contents&lt;/a&gt; in the FAQ post.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-03-12T16:17:43.147" LastActivityDate="2021-03-12T16:17:43.147" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20869" PostTypeId="4" CreationDate="2021-03-12T16:17:43.147" Score="0" Body="These questions are the most frequently asked and answered questions on Meta and the first place to look for answers to your questions" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-03-12T16:17:43.147" LastActivityDate="2021-03-12T16:17:43.147" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20871" PostTypeId="2" ParentId="2447" CreationDate="2021-03-14T06:37:28.617" Score="12" Body="&lt;h1&gt;An array may be represented as a buffer terminated with a sentinel value&lt;/h1&gt;&#xA;&lt;p&gt;This can be applied to both inputs and outputs for languages such as C and assembly. This is the default for C strings (a buffer of &lt;code&gt;char&lt;/code&gt;, terminated with 0), but can be applied to any other data type.&lt;/p&gt;&#xA;&lt;p&gt;As a more concrete example:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An input array of positive integers can be taken as a single pointer of &lt;code&gt;uint32_t&lt;/code&gt; or any other convenient integer type, which is assumed to terminate with a single zero.&lt;/li&gt;&#xA;&lt;li&gt;For an output array of positive integers, a C function can take an output pointer as the start of the buffer, write several numbers on that buffer, and then write a zero at the end.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;It should be noted that the sentinel value must be the one that is guaranteed to not appear in any valid input or output, since their presence breaks the premise of the I/O method. For example, if the input may contain zeros, you cannot use zero as the sentinel value for the input array.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2021-03-14T06:37:28.617" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20872" PostTypeId="2" ParentId="2140" CreationDate="2021-03-14T14:45:50.197" Score="1" Body="&lt;h1&gt;Uppercase JSON member names&lt;/h1&gt;&#xA;&lt;p&gt;Given a single valid &lt;a href=&quot;https://json.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;JSON&lt;/a&gt; value, uppercase all member names. That is, you must also return valid JSON that encodes an equivalent value, except that all names of members in all objects, have been converted to uppercase according to one of the Unicode methods (simple or full).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Details:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The given value can be null, a number, a string, an array, or an object. There may therefore not be any names to convert, but such names can also &amp;quot;hide&amp;quot; as elements/members of arrays/objects in arrays/objects, …&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Dictionaries are considered unordered.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Names and strings will only encode ASCII.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Keys will be unique, even after case conversion.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Floating point imprecision is tolerated.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Example input A&lt;/h2&gt;&#xA;&lt;pre class=&quot;lang-json prettyprint-override&quot;&gt;&lt;code&gt;[&amp;quot;a\&amp;quot;:&amp;quot;,{&amp;quot;b&amp;quot;:&amp;quot;c&amp;quot;}]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Example outputs&lt;/h3&gt;&#xA;&lt;pre class=&quot;lang-json prettyprint-override&quot;&gt;&lt;code&gt;[&amp;quot;a\&amp;quot;:&amp;quot;,{&amp;quot;B&amp;quot;:&amp;quot;c&amp;quot;}]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre class=&quot;lang-json prettyprint-override&quot;&gt;&lt;code&gt;[&#xA;  &amp;quot;a\&amp;quot;:&amp;quot;,&#xA;  {&#xA;    &amp;quot;B&amp;quot; : &amp;quot;c&amp;quot;&#xA;  }&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Example input B&lt;/h2&gt;&#xA;&lt;pre class=&quot;lang-json prettyprint-override&quot;&gt;&lt;code&gt;{&amp;quot;h\u0065re&amp;quot;:&#xA;&amp;quot;are'=&amp;quot;,    &amp;quot;be&amp;quot;&#xA;:{&amp;quot;dra\u0000gons&amp;quot;:true,&amp;quot;b\\e\&amp;quot;ar\ns&amp;quot;:&amp;quot;two&amp;quot;},&amp;quot;\t&amp;quot;:[1e-0,null,3e+2&#xA;,  {&amp;quot;&amp;quot;:&amp;quot;&amp;quot;} ,{&#xA;},&#xA;&amp;quot;name\&amp;quot;:\&amp;quot;value&amp;quot;,[false,[],[[]]]]}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Example outputs&lt;/h3&gt;&#xA;&lt;pre class=&quot;lang-json prettyprint-override&quot;&gt;&lt;code&gt;{                      &#xA; &amp;quot;BE&amp;quot;: {               &#xA;  &amp;quot;B\\E\&amp;quot;AR\nS&amp;quot;: &amp;quot;two&amp;quot;,&#xA;  &amp;quot;DRA\u0000GONS&amp;quot;: true&#xA; },                    &#xA; &amp;quot;HERE&amp;quot;: &amp;quot;are'=&amp;quot;,      &#xA; &amp;quot;\t&amp;quot;: [1,             &#xA;  null,                &#xA;  300,                 &#xA;  {                    &#xA;   &amp;quot;&amp;quot;: &amp;quot;&amp;quot;              &#xA;  },                   &#xA;  {                    &#xA;  },                   &#xA;  &amp;quot;name\&amp;quot;:\&amp;quot;value&amp;quot;,    &#xA;  [false,              &#xA;   [],                 &#xA;   [[]]]]              &#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre class=&quot;lang-json prettyprint-override&quot;&gt;&lt;code&gt;{&amp;quot;BE&amp;quot;:{&amp;quot;B\\E\&amp;quot;AR\nS&amp;quot;:&amp;quot;two&amp;quot;,&amp;quot;DRA\u0000GONS&amp;quot;:true},&amp;quot;HERE&amp;quot;:&amp;quot;are'=&amp;quot;,&amp;quot;\t&amp;quot;:[1,null,300,{&amp;quot;&amp;quot;:&amp;quot;&amp;quot;},{},&amp;quot;name\&amp;quot;:\&amp;quot;value&amp;quot;,[false,[],[[]]]]}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/unicode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;unicode&amp;#39;&quot; rel=&quot;tag&quot;&gt;unicode&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;conversion&amp;#39;&quot; rel=&quot;tag&quot;&gt;conversion&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2021-03-16T12:48:47.337" LastActivityDate="2021-03-16T12:48:47.337" CommentCount="17" ContentLicense="CC BY-SA 4.0" />
  <row Id="20873" PostTypeId="2" ParentId="2140" CreationDate="2021-03-14T23:07:25.870" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/220713/i-aint-no-fortunate-sum&quot;&gt;I ain&amp;#39;t no Fortunate sum&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-03-15T17:01:22.673" LastActivityDate="2021-03-15T17:01:22.673" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20874" PostTypeId="2" ParentId="2140" CreationDate="2021-03-15T09:01:17.533" Score="0" Body="&lt;h1&gt;Build a Markdown to HTML converter&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;br&gt;&#xA;The Stack Exchange network uses Markdown as the syntax for writing posts. For example, using a # at the beginning of a line creates a heading (&lt;code&gt;&amp;lt;h1&amp;gt;&lt;/code&gt;) while two hashes ## creates a subheading (&lt;code&gt;&amp;lt;h2&amp;gt;&lt;/code&gt;).&lt;br&gt;&#xA;Your task is to write a program which takes input as a syntactically valid Markdown string and outputs its HTML equivalent. (This program might find use as a means to transfer SE posts to one's own website.)&lt;br&gt;&#xA;The only Markdown &amp;quot;commands&amp;quot; you need to support are the backtick (becomes a tag named &lt;code&gt;code&lt;/code&gt;, styling provided), the hashes (# becomes &lt;code&gt;h1&lt;/code&gt;, ## becomes &lt;code&gt;h2&lt;/code&gt; and ### becomes &lt;code&gt;h3&lt;/code&gt;), and the &lt;code&gt;&amp;gt;&lt;/code&gt; (blockquote). The rest may be left intact.&lt;/p&gt;&#xA;&lt;p&gt;For example, if the input is&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;# Some text&#xA;## Part 1&#xA;Lorem `ipsum` dolor sit amet&#xA;&amp;gt; consectetur adispicing&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Then the output should be&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;h1&amp;gt;Some text&amp;lt;/h1&amp;gt;&#xA;&amp;lt;h2&amp;gt;Part 1&amp;lt;/h1&amp;gt;&#xA;Lorem &amp;lt;code&amp;gt;ipsum&amp;lt;/code&amp;gt; dolor sit amet&#xA;&amp;lt;blockquote&amp;gt;consectetur adispicing&amp;lt;/blockquote&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Leading spaces are acceptable for the headings as they are mandatory in Markdown, but trailing spaces are not (you may assume the input has no trailing spaces). Except for the inline &lt;code&gt;code&lt;/code&gt;, all commands will be displayed as blocks and will be on separate lines. For example&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;# Some text ## Another&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;is not a valid input because there is a block command on the same line as another block command.&#xA;You may assume that the input contains no &lt;code&gt;&amp;lt;&lt;/code&gt; or &lt;code&gt;&amp;gt;&lt;/code&gt; except for blockquote notation, you must also follow the guidelines exactly, so no outputting HTML which renders the same result but in a different way.&lt;/p&gt;&#xA;&lt;p&gt;Second test case:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;### Subheading&#xA;&amp;gt; This is some heading with `code` in it.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;becomes&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;h3&amp;gt;Subheading&amp;lt;/h3&amp;gt;&#xA;&amp;lt;blockquote&amp;gt;This is some heading with &amp;lt;code&amp;gt;code&amp;lt;/code&amp;gt; in it.&amp;lt;/blockquote&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins.&lt;/p&gt;&#xA;" OwnerDisplayName="user100690" LastEditorDisplayName="user100690" LastEditDate="2021-03-17T16:35:44.333" LastActivityDate="2021-03-17T16:35:44.333" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="20875" PostTypeId="2" ParentId="2140" CreationDate="2021-03-15T16:08:11.357" Score="1" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/220864&quot;&gt;Minimally Making Change&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="96174" LastEditorUserId="96174" LastEditDate="2021-03-18T22:47:23.690" LastActivityDate="2021-03-18T22:47:23.690" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20876" PostTypeId="1" CreationDate="2021-03-15T19:18:24.283" Score="19" ViewCount="314" Body="&lt;p&gt;Yesterday (probably the day before yesterday in some time zones), I decided to run an experiment on the &amp;quot;Fastest Gun In The West&amp;quot; phenomenon, in which early answers tend to get disproportionately rewarded compared to late answers.&lt;/p&gt;&#xA;&lt;p&gt;My experiment involved &lt;a href=&quot;https://codegolf.stackexchange.com/q/220662/100650&quot;&gt;this question&lt;/a&gt;, to which I posted two answers. For the &lt;a href=&quot;https://codegolf.stackexchange.com/a/220663/100669&quot;&gt;first answer&lt;/a&gt;, in Underload, I intentionally aimed to post it as fast as possible (I had the answer ready about 10 minutes after I saw the question (I saw it about 10 minutes after it was posted)).&lt;/p&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/a/220666/100679&quot;&gt;second answer&lt;/a&gt;, in 7, was posted about 2½ hours after the first, and I had been working on it for most of that time.&lt;/p&gt;&#xA;&lt;p&gt;I think the second answer is more or less objectively better than the first, in pretty much every dimension we care about:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The answers both belong to the same language family (concatenative low-level tarpit esolangs). So it's unlikely that the choice of language had a huge influence on the voting. Additionally, we can look at how well my answers in Underload and 7 normally do; Underload normally does fairly well, but 7 normally does better. So the first answer doesn't have an advantage in terms of language choice.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, I created both of the languages in question, so there's no potential bias in terms of language creator / people-golfing-in-their-own-language; the two answers are symmetrical this way.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The first answer took almost no thought to write. It was a case of &amp;quot;what's a language where I can quickly write a quine, cat program and string printer?&amp;quot;. The latter two are builtins in Underload, and it is trivial to modify one of the two standard Underload quines, &lt;code&gt;(aS(:^)S):^&lt;/code&gt; (which I have memorised, as does probably every Underload golfer), to contain a payload (or in this case, some extra useless characters). I made it even easier by picking an interpreter which (non-standardly) treats unknown characters as no-ops. Generally speaking, the recommendations are to not upvote trivial builtin-based solutions (and we should probably recommend not upvoting &amp;quot;trivial modification to a standard program&amp;quot; solutions, too).&lt;/p&gt;&#xA;&lt;p&gt;Contrasting with this, the second answer was much more difficult to write. Even printing a string literal has a range of subtleties in 7 (e.g. I spent a while pondering about whether there was a way to shorten it by somehow making use of the &lt;strong&gt;&lt;code&gt;6&lt;/code&gt;&lt;/strong&gt;), and that was the easiest of the three programs to deal with. The quine took a while, because I'd never previously needed to fit a &lt;strong&gt;&lt;code&gt;6&lt;/code&gt;&lt;/strong&gt; into a quine before (or indeed, created a quine that wasn't just two identical halves that printed each other or where one printed the other twice), and so I spent some time working out a quine template that could make it work. The cat program was a nightmare; 7 doesn't have a builtin for this. Reusable code in 7 is sufficiently context-dependent that it's hard to define what a function even is, meaning that I would need to read standard input explicitly, and 7 can only read a character at a time. So then I needed to construct a loop, in a low-level esolang that's very unintuitive and hard to reason about (probably worse than Brain-Flak). This involved inventing entire new programming techniques that I don't think have been used in 7 before (such as polyglotting the loop body with a literal constant integer).&lt;/p&gt;&#xA;&lt;p&gt;Yet, despite all this, I managed to fit the cat and quine programs in using only two extra characters (a &lt;strong&gt;&lt;code&gt;6&lt;/code&gt;&lt;/strong&gt; for the cat program and an additional &lt;strong&gt;&lt;code&gt;7&lt;/code&gt;&lt;/strong&gt; for the quine program), costing only ¾ of a byte (which ends up rounding down to 0 because the original program length was slightly over a byte boundary).&lt;/p&gt;&#xA;&lt;p&gt;So I consider the 7 answer to be much better-crafted, both in terms of effort (a lot more work is required to write something like that), and in terms of the golfing skill demonstrated by the solution, and it seems likely that people who upvote based on how impressive a program is would prefer the 7 program.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The Underload answer is vaguely cheaty: it trivialises the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-source-layout-tooltip-container&quot;&gt;source-layout&lt;/a&gt; aspect of the problem simply by defining functions that output to standard output (meaning that we can do what we like to the function's return value with the extra characters we're forced to use), so it's basically just exploiting the I/O conventions. (The type of string that the program takes as input isn't even good for anything other than &lt;code&gt;eval&lt;/code&gt; or printing.) I needed to use an extra colon in it in order to compensate for the exclamation mark in the string (which would otherwise make the quine take an argument), but apart from that, the entire point behind the question gets ignored. In this sense, I consider it quite similar to answering a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-restricted-source-tooltip-container&quot;&gt;restricted-source&lt;/a&gt; question in Lenguage (or indeed a &amp;quot;do X without letters&amp;quot; question in 7), which shouldn't be considered that interesting or funny at this point. Additionally, the answer is interpreter-specific and won't work on most Underload interpreters, due to requiring a specific handling of invalid commands.&lt;/p&gt;&#xA;&lt;p&gt;The 7 answer, meanwhile, complies with the spec comprehensively and in a way that fits the spirit of the question (we're reusing the characters from the string literal to write the other two programs, which is what the OP seems to have had in mind based on Sandbox comments, and indeed the quine uses up the entire supply of available &lt;code&gt;3&lt;/code&gt;s). There are no I/O exploits: we're writing full programs with input from standard input and output to standard output. So this is the sort of answer that, I suspect, fits the question particularly well.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When initially posted, the Underload answer didn't have an explanation. I added an explanation after it received 1 upvote (I didn't delay this intentionally; just tried to post as &lt;em&gt;fast&lt;/em&gt; as possible and then started working on the explanation). The explanation is incredibly simple and straightforward and generally only helpful for people who don't already know Underload (because the programs are so simple and/or standard).&lt;/p&gt;&#xA;&lt;p&gt;For the 7 answer, I posted the explanation at the same time as the answer. The programs are much more complex, so there's a lot more to explain, with all three programs needing extensive explanations of what they do and descriptions of what's going on internally (in fact, with two of the programs, I needed to explain not only the program itself, but also the behaviour of various strings that were constructed and &lt;code&gt;eval&lt;/code&gt;ed during the program's execution). So there's much more that you can learn from the explanation than you can with the Underload program (and the explanation inherently needs to be much longer).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;When initially posted, the Underload solution was incorrect. I was the first person to notice, and it had already received 5 upvotes at that point. (I've since fixed the solution, but at the cost of two bytes.) The problem is that I'd gotten confused about function/full program distinctions and I/O conventions, and accidentally written code that only works as a snippet (which is not allowed on CGCC). The fix was trivial (just add &lt;code&gt;()&lt;/code&gt; around each solution to make the sequence of instructions into a function literal), but it's at least mildly surprising to me that nobody noticed this. I probably would have gotten this right first time if I hadn't been rushing to make sure I got the first answer.&lt;/p&gt;&#xA;&lt;p&gt;As far as I'm aware, the 7 answer has been correct ever since it was posted. (An initial version had a mistake – reordering the programs to reduce byte count of the encoding, I initially forgot that 7 &amp;quot;virtually&amp;quot; pads out programs with &lt;strong&gt;&lt;code&gt;7&lt;/code&gt;&lt;/strong&gt; characters in order to round them up to a full byte, and thus writing a program that ends with &lt;strong&gt;&lt;code&gt;7&lt;/code&gt;&lt;/strong&gt; would fail to obey the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-source-layout-tooltip-container&quot;&gt;source-layout&lt;/a&gt; requirement because it wouldn't be part of the string that was seen by the interpreter. But I caught that while writing the explanation and fixed it before pressing the post button, rearranging the programs so that they all ended with some other character. If I'd been trying to FGITW with that answer, it would have been posted with the mistake in and probably nobody would have caught it for ages.)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;What I expected would happen from this experiment is that the Underload answer (having been posted first and attracting a rush of early upvotes – it was at +5 when I posted the 7 answer) would likely stay at the top for a while (it's hard to dislodge the first-posted answer), but that the 7 answer would attract upvotes faster and eventually end up overtaking it, and I was interested to see how long that would take.&lt;/p&gt;&#xA;&lt;p&gt;What actually happened was somewhat concerning. The 7 answer started slowly catching up to the Underload answer for a while, eventually reaching +7 for Underload and +6 for 7. Then someone upvoted the Underload answer but not the 7 answer, making it +8 and +6. And then, a couple of other people's answers (first Ruby, and then JavaScript) got upvoted and managed to come in between. (Those are good answers, but a little harder to directly compare to the Underload than the 7 answer is, so it's hard to determine which of the answers &amp;quot;should&amp;quot; objectively have the top spot, but it doesn't really matter for the experiment; it's clear that regardless of which of the other three programs is better, it shouldn't be the Underload.) But the further down the page an answer is, the more difficulty it has in receiving upvotes. Because the 7, Ruby and JavaScript answers were all swapping round for the second and third spots, whereas the Underload answer was in the top spot all that time, the Underload answer has now pulled away to +10, whilst the other three answers are languishing at +8 (Ruby)/+7 (JavaScript)/+6 (7); people who are just upvoting two or three answers are going to miss good answers further down the page.&lt;/p&gt;&#xA;&lt;p&gt;I think this phenomenon is doing actual damage to the site. Suppose that I were aiming primarily for reputation, as opposed to just golfing for fun (and/or to do experiments into how Stack Exchange behaves); note that the site tries to strongly push people into gaining reputation and/or badges. Posting answers like the Underload answer is a good way to get reputation, even though those answers don't add to the site much (indeed, I obtained a bronze badge from it even despite the community wiki mark on the post). Posting answers like the 7 answer is not a good way to get reputation, even though there was only a 2½ hour time difference! So the site is pushing people into posting answers that fulfil the question and have nothing inherently wrong with them (apart from, apparently, sloppy mistakes due to trying to post too quickly), and pushing people away from posting answers that put a lot of thought in and aim to solve the question particularly well.&lt;/p&gt;&#xA;&lt;p&gt;(Note that one reason I community-wiki all my posts is to avoid being tempted to post answers like the Underload answer, rather than answers like the 7 answer. When there's no reputation at stake, there's no incentive to post lower-quality answers in order to gain it. I often post answers like the Underload answer anyway; but, with no reputation at stake, it makes sense to delay before posting it so that it doesn't accidentally get pinned to the top of the thread and end up distorting the voting long into the question's future.)&lt;/p&gt;&#xA;&lt;p&gt;I'm not sure if there are any real conclusions to be drawn from all this, but I thought it was nonetheless worth posting the evidence and starting a discussion.&lt;/p&gt;&#xA;&lt;p&gt;(EDIT: I just noticed that the question in question is on HNQ (I saw it on the site sidebar). This probably isn't too surprising, all things considered, but wanted to make note of the situation.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;UPDATE&lt;/strong&gt;: It's now one week since the question was posted, and the scores are 11 for the Underload answer, 9 for the Ruby answer, and 8 each for the 7 and JavaScript answers. So the top four answers have had one upvote each since this post was posted. I'm actually a little surprised at the difference in the voting rate between very new posts and slightly older posts (presumably it fell off the front page?), but if late votes are rare, that gives a clear explanation of why posts that get an early lead tend to stay there.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;UPDATE 2&lt;/strong&gt;: It's now one month since the question was posted. The scores are 12 for the Underload answer, 9 for the Ruby and 7 answers, and 8 for the JavaScript answer. So only two of the top answers have been upvoted since the last update (although one of them was in third place at the time).&lt;/p&gt;&#xA;&lt;p&gt;This makes me suspect that the underlying problem is that people aren't giving as much attention to answers on old questions as Stack Exchange's voting mechanism expects: the vast majority of votes on a question's answers altogether appear to come shortly after the question is posted. It may be that the reason why an early lead never disappears is that the number of votes an early answer collects before the better answers are posted may be higher than the total number of voters who even looked at the later answers, rather than anything to do with the choices people make as to what to look for. (Or in other words, &amp;quot;just upvote the good answers&amp;quot; may not be a workable solution; a late answer could be upvoted by 100% of the people who see it and have enough reputation, and still never catch the early answers.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;UPDATE 3&lt;/strong&gt;: It's now over a year since the question was posted. (I was planning to update this exactly a year afterwards, but forgot – in fact, it's been over a year since update 2.) The Underload answer is now on 14 points, with the 7 answer in second place with 11. The Ruby and JavaScript answers are on 9 and 8, with a Python answer on 7.&lt;/p&gt;&#xA;&lt;p&gt;This most likely indicates that two people found the question and voted on it since the last update, and upvoted both of my answers. We don't have enough evidence to know which answer they found better – just that they liked both. This actually goes some way towards pointing to an explanation as to why better answers tend not to overtake worse answers: most people who are voting look at some number of answers, probably reading them in sort order (votes, active, oldest, or whatever), and upvote all the &amp;quot;good&amp;quot; answers. This means that if people are sorting by votes, the only way for a better, lower-scored answer to overtake a worse, higher-scored answer is if someone considers the higher-scored answer to not be worth an upvote (and if that answer is good but not &lt;em&gt;as&lt;/em&gt; good, it is still likely to be considered worth an upvote).&lt;/p&gt;&#xA;&lt;p&gt;If this reasoning is correct, the problem could be solved to some extent by persuading everyone to sort by active or newest. There are two problems with that. One is that these sort orders are not the default, so the number of people arriving at the page with those sort orders is going to be very low. (HNQ traffic, in particular, is unlikely to have non-default sort orders because much of it will be from users who didn't have an account here.) The other is that the sort of people who sort by active are often fairly diligent, and likely to read a long way down into the list, meaning that both answers end up getting upvoted anyway.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;UPDATE 4&lt;/strong&gt;: It's now a little over a year since update 3 was posted. The Underload and 7 answers are both on 13 points each (which is interesting, because this means the Underload score has a lower answer than previously: I wonder whether that was an unupvote or a downvote?), with the Ruby and JavaScript answers on 9 points.&lt;/p&gt;&#xA;&lt;p&gt;I'm wondering whether traffic to the question in question is now predominantly from this meta post, rather than from the main site itself: that might help to explain the equalisation of scores. In any case, with the scores equalising, the experiment is now effectively over because the equalisation of scores means that the FGITW effect has finally stopped affecting the order in which the answers are ranked (unless someone chooses to sort by &amp;quot;oldest&amp;quot;).&lt;/p&gt;&#xA;&lt;p&gt;It is notable that, despite it being over 2 years since the question was first posted, the vast majority of votes on the Underload answer came on the first day: the Underload answer was +10 on the first day and is now +13. Likewise, the Ruby and JavaScript answers were +8 and +7 and are now both at +9. The 7 answer is an outlier on this metric, being at +6 after one day and +13 today, which is one thing that makes me suspicious that this meta post may be biasing the voting. (However, another possibility is that it's much higher up the page than the other high-scoring posts when sorting by &amp;quot;active&amp;quot;, which many of the more dedicated CGCC users use when reviewing old posts, due to my edits golfing off another byte in January last year – these may have interfered with the experiment, but OTOH I didn't want the experiment to interfere with the main site.)&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Full disclosure: I improved the 7 code in January 2022 (a little less than a year after the question was posted), golfing off 2 characters / 1 byte. So maybe the Underload code was &amp;quot;better&amp;quot; in that it was better-golfed. On the other hand, maybe this is an argument that even though 10 minutes isn't enough time to produce a good answer, 3 hours isn't enough time either, and crafting a really good answer to a question can take days or months of thought.&lt;/p&gt;&#xA;" OwnerUserId="76359" LastEditorUserId="91213" LastEditDate="2023-06-13T05:52:45.107" LastActivityDate="2023-06-13T05:52:45.107" Title="An experiment into the FGITW phenomenon" Tags="|discussion|specific-question|voting|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="20877" PostTypeId="2" ParentId="20876" CreationDate="2021-03-15T23:01:40.807" Score="9" Body="&lt;p&gt;These are some very interesting and, unfortunately, not-too-surprising results. I do think the FGITW phenomenon is quite disappointing and discouraging for what I'd say are higher quality and higher effort answers; my proudest answers came months or even years after the question, not the quick 5-byte answers I wrote in a few seconds from memory of Jelly's features.&lt;/p&gt;&#xA;&lt;p&gt;There unfortunately isn't much we can do about it. Especially for HNQ questions, since most people sort by vote (because except PPCG and Puzzling, basically every other site uses votes to determine quality, and thus higher voted = better), high voted questions get attention and get upvoted again. This is pretty much uniquely unhealthy on these two non-Q&amp;amp;A sites.&lt;/p&gt;&#xA;&lt;p&gt;We could always bring back the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13129/68942&quot;&gt;contest for underappreciated / under-upvoted answers&lt;/a&gt;. I organized this a couple years back because I was noticing the same issue wherein voting seemed almost inversely proportional to effort - low-effort meme challenges were getting hundreds of upvotes, compared to higher effort and much more thought-provoking challenges only getting a handful, and quick 5-byte (or even 0-byte) answers getting to the top of the scoreboard early and never losing their #1 spot (no offense to any of the challenge or answer writers who benefited from this of course - it's a phenomenon of the system and the way people vote, and I believe that people are acting in good will and not intentionally gaming the system for reputation or anything like that).&lt;/p&gt;&#xA;&lt;p&gt;Of course, we could encourage people to sort by active/new or scroll more and look for higher quality answers to upvote. In fact, I feel like we already have. But especially with HNQ attention, people have the right to vote how they want and for most people that's just popping into a question page and upvoting the top three answers and leaving.&lt;/p&gt;&#xA;&lt;p&gt;Unfortunately, last time I tried, it ended after just a couple of runs because there just weren't many people interested in it - offering bounties, finding and nominating answers, etc. But, if there's enough support for a similar contest to find and bounty underrated answers that took effort but never got the hype or attention, I'd definitely be open to organizing it again.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-03-15T23:01:40.807" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20878" PostTypeId="2" ParentId="2140" CreationDate="2021-03-16T02:33:05.047" Score="0" Body="&lt;h1&gt;SSD optimize&lt;/h1&gt;&#xA;&lt;p&gt;Given &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; pages, each page containing &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt; sectors, write three functions: (Here &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; are sectors)&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;insert(x)&lt;/code&gt; that stores the input(temporary sector) into a sector,&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;remove(x)&lt;/code&gt; that removes one, and&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;get(x)&lt;/code&gt; that return a sector containing the element.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;You can call these functions:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;copy(y,x)&lt;/code&gt; that copy a sector from &lt;code&gt;x&lt;/code&gt; to &lt;code&gt;y&lt;/code&gt;, and&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;clear(x)&lt;/code&gt; that clears the page containing &lt;code&gt;x&lt;/code&gt;, can only be called &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; times for each page.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;There'll never be more than(can equal to) &lt;span class=&quot;math-container&quot;&gt;\$p\%mn\$&lt;/span&gt; elements required to store. Your score is the numbers of call before you fail. Everyone can provide test case for any program.&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$n=256, m=16, p=75, k=100\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For example, if a solution don't do any clear and just place inputs into &lt;span class=&quot;math-container&quot;&gt;\$(1,1), (1,2), \cdots, (n,m)\$&lt;/span&gt;, someone else can write and remove till you use up all space:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;insert\*3072, (delete, insert)*1025, get&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The last &lt;code&gt;get&lt;/code&gt; can't get anything and is a fail, so the score is 5122.&lt;/p&gt;&#xA;&lt;p&gt;Highest score wins. Robber's winning criticia TODO.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2021-03-16T04:39:18.213" LastActivityDate="2021-03-16T04:39:18.213" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="20879" PostTypeId="2" ParentId="2140" CreationDate="2021-03-16T18:26:01.987" Score="0" Body="&lt;h1&gt;2D Pathfinding with Momentum&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/221194/2d-pathfinding-with-momentum&quot;&gt;Posted to main&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="82199" LastEditorUserId="82199" LastEditDate="2021-03-24T13:35:36.660" LastActivityDate="2021-03-24T13:35:36.660" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20880" PostTypeId="2" ParentId="2140" CreationDate="2021-03-16T18:56:14.230" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/221073/finding-distant-primes&quot;&gt;Finding Distant Primes&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77516" LastEditorUserId="77516" LastEditDate="2021-03-22T14:55:57.947" LastActivityDate="2021-03-22T14:55:57.947" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20881" PostTypeId="1" AcceptedAnswerId="20884" CreationDate="2021-03-17T16:47:47.393" Score="13" ViewCount="183" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11497/please-welcome-the-nineteenth-bytes-newest-room-owners&quot;&gt;4 years ago&lt;/a&gt;, we voted on and appointed additional room owners for &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;. That was the most recent time TNB has had new room owners. Currently, only 2 of the room owners are able to be pinged if needed, and one of those 2 hasn't been active since October 2020.&lt;/p&gt;&#xA;&lt;p&gt;The need for active room owners isn't pressing - star spam, kicks, etc. are relatively rare nowadays - but it'd still be nice to have a few around if and when needed.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="68942" LastEditDate="2021-06-09T15:55:57.113" LastActivityDate="2021-06-09T15:55:57.113" Title="Should we have even even more room owners for The Nineteenth Byte?" Tags="|discussion|status-completed|chat|moderation|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20882" PostTypeId="2" ParentId="2447" CreationDate="2021-03-17T20:11:08.813" Score="12" Body="&lt;h1&gt;A program or function taking input by reference may output by modifying the input value in place&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13262/12012&quot;&gt;A complement to this&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For example, in rust, one might write&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-rust prettyprint-override&quot;&gt;&lt;code&gt;fn a(v:&amp;amp;mut Vec&amp;lt;i32&amp;gt;){v.push(7);}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;instead of&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-rust prettyprint-override&quot;&gt;&lt;code&gt;fn b(mut v: Vec&amp;lt;i32&amp;gt;)-&amp;gt;Vec&amp;lt;i32&amp;gt;{v.push(7);return v;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-rust prettyprint-override&quot;&gt;&lt;code&gt;fn c(v:&amp;amp;mut Vec&amp;lt;i32&amp;gt;)-&amp;gt;&amp;amp;mut Vec&amp;lt;i32&amp;gt;{v.push(7);return v;} &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="97691" LastActivityDate="2021-03-17T20:11:08.813" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20883" PostTypeId="2" ParentId="18028" CreationDate="2021-03-17T22:15:49.437" Score="5" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/20861/welcome-to-code-golf-and-coding-challenges-stackexchange&quot;&gt;Welcome to Code Golf and Coding Challenges Stack Exchange!&lt;/a&gt; This is a site for recreational programming competitions, not general programming questions. Challenges must have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8130/why-do-we-have-objective-winning-criteria&quot;&gt;an objective scoring criterion&lt;/a&gt;, and it is highly recommended to first post proposed challenges in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Essentially &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18031/66833&quot;&gt;dzaima's version&lt;/a&gt; but with a link to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/20861/welcome-to-code-golf-and-coding-challenges-stackexchange&quot;&gt;Welcome to Code Golf and Coding Challenges StackExchange!&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-03-17T22:15:49.437" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20884" PostTypeId="2" ParentId="20881" CreationDate="2021-03-18T03:34:29.317" Score="10" Body="&lt;h1&gt;Yes, we should have more room owners &lt;em&gt;again&lt;/em&gt;&lt;/h1&gt;&#xA;&lt;p&gt;I think the answer is &amp;quot;yes&amp;quot; for the same reason to why we have community mod elections periodically. Users come and go, and mods and chatroom owners are no exceptions. We've been electing new mods every 2-3 years, and still we once suffered from the shortage of active mods.&lt;/p&gt;&#xA;&lt;p&gt;We don't have that many incidents that require intervention of a mod or RO, but it is still annoying when such an incident does happen and cannot be handled soon enough.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I guess we can do an election for new ROs like we did 4 years ago. Here is a copy of the requirements proposed back then:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Contributes positively and regularly to chat (more signal than noise)&lt;/li&gt;&#xA;&lt;li&gt;Frequently active during 5 AM - 2 PM UTC (when other room owners and moderators often aren't)&lt;/li&gt;&#xA;&lt;li&gt;Levelheaded and reasonable (essentially the same things we want in community moderators)&lt;/li&gt;&#xA;&lt;li&gt;Not currently a community moderator (though since I am in the minority in the opinion that adding community moderators as room owners doesn't help alleviate the burden of moderation, this is more of a personal preference than a requirement)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;most of which are sensible (except for the &amp;quot;time of activity&amp;quot; one, which is not needed this time IMO).&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2021-03-18T03:34:29.317" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20888" PostTypeId="1" AcceptedAnswerId="20889" CreationDate="2021-03-20T02:40:59.343" Score="3" ViewCount="52" Body="&lt;p&gt;I am currently writing and maintaining a new general-purpose language, named &lt;a href=&quot;https://github.com/absoluteAquarian/CSASM&quot; rel=&quot;nofollow noreferrer&quot;&gt;CSASM&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I seem to have forgotten the rules surrounding languages such as this one. Hence, it would be preferable to have this question answered beforehand, rather than submit an answer and be embarrassed.&lt;/p&gt;&#xA;&lt;p&gt;In short, &lt;strong&gt;is it against the rules&lt;/strong&gt; to use this language to answer questions?&lt;br /&gt;&#xA;Since the language is &lt;em&gt;general-purpose&lt;/em&gt;, the loophole prohibition for languages tailored to do a certain subset of tasks shouldn't apply here, but I'm not certain about the other rules the consensus agrees upon.&lt;/p&gt;&#xA;" OwnerUserId="85765" LastEditorUserId="68942" LastEditDate="2021-03-20T03:24:38.487" LastActivityDate="2021-03-20T03:27:12.990" Title="The Validity of a Custom, General-Purpose Language" Tags="|discussion|" AnswerCount="1" CommentCount="0" ClosedDate="2021-03-20T15:49:24.237" ContentLicense="CC BY-SA 4.0" />
  <row Id="20889" PostTypeId="2" ParentId="20888" CreationDate="2021-03-20T03:27:12.990" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12877/lets-allow-newer-languages-versions-for-older-challenges&quot;&gt;You may use it&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Almost four years ago, we updated our rules, so now, so long as it's pretty clear you're not exploting this rule (since that is still a violation of the loopholes anyway, like you mentioned), you may use newer languages to answer older questions.&lt;/p&gt;&#xA;&lt;p&gt;No need to add any indication that it's a newer language. You may just use it to write answers. Have fun :)&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-03-20T03:27:12.990" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20890" PostTypeId="2" ParentId="2140" CreationDate="2021-03-20T15:04:01.080" Score="1" Body="&lt;h1&gt;Fortuitous Numbers&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://stackoverflow.com/questions/3230978/code-golf-four-is-magic&quot;&gt;Four is Magic&lt;/a&gt; is a very interesting math game.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;We start out with a number: 1&lt;/li&gt;&#xA;&lt;li&gt;We spell it into English: “one”&lt;/li&gt;&#xA;&lt;li&gt;We find the sum of the letters: 3&lt;/li&gt;&#xA;&lt;li&gt;Go back to step 2, until the game ends at “4”&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The reason “4” is Magic, is that “Four” has 4 letters, and no other number has this property.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Fortuitous Numbers&lt;/h3&gt;&#xA;&lt;p&gt;In this game, I’m making one change.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Take for example the number: 24.&lt;/li&gt;&#xA;&lt;li&gt;Write it out in English: “twenty four”&lt;/li&gt;&#xA;&lt;li&gt;Note that there are 2 words&lt;/li&gt;&#xA;&lt;li&gt;Take the &lt;em&gt;product&lt;/em&gt; of the word lengths&lt;/li&gt;&#xA;&lt;li&gt;24 - “twenty four” - &lt;code&gt;6 * 4&lt;/code&gt; = 24&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;4 and 24 are Fortuitous Numbers. Are there any more?&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;The challenge&lt;/h3&gt;&#xA;&lt;p&gt;Your challenge is to create a piece of code that will generate all Fortuitous Numbers.&lt;/p&gt;&#xA;&lt;p&gt;Specifically:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Solutions should be found by the program, not chached by you.&lt;/li&gt;&#xA;&lt;li&gt;We never say, “one hundred &lt;em&gt;&lt;strong&gt;and&lt;/strong&gt;&lt;/em&gt; one”. Exclude the “and”&lt;/li&gt;&#xA;&lt;li&gt;The only output should contain a comma separated list of only the solutions:&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;pre&gt;&lt;code&gt;4,&#xA;24,&#xA;n,&#xA;m,&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ol start=&quot;4&quot;&gt;&#xA;&lt;li&gt;The code should have no limit as to how large the number can go. If you have trouble finding names, used the ones mentions &lt;a href=&quot;https://en.wikipedia.org/wiki/Names_of_large_numbers&quot; rel=&quot;nofollow noreferrer&quot;&gt;in this Wikipedia article&lt;/a&gt;. This will take you smoothly to 10&lt;sup&gt;3003&lt;/sup&gt; and beyond.&lt;/li&gt;&#xA;&lt;li&gt;Hint: Look at the sequence, &lt;a href=&quot;https://oeis.org/A058230&quot; rel=&quot;nofollow noreferrer&quot;&gt;A058230&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Bonus!&lt;/h3&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Program generates the first 9 solutions relatively quickly (under 5 minutes time.)&lt;/li&gt;&#xA;&lt;li&gt;Program also finds Fortuitous Numbers if type &lt;code&gt;a -&amp;gt; b -&amp;gt; ... -&amp;gt; a&lt;/code&gt; instead of just &lt;code&gt;a -&amp;gt; a&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="101688" LastActivityDate="2021-03-20T15:04:01.080" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20891" PostTypeId="2" ParentId="2140" CreationDate="2021-03-21T00:38:59.337" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/221428/decompress-an-integer-jelly-style&quot;&gt;Decompress an integer, Jelly style&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-03-26T17:33:53.897" LastActivityDate="2021-03-26T17:33:53.897" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20892" PostTypeId="2" ParentId="2140" CreationDate="2021-03-21T06:05:52.413" Score="0" Body="&lt;p&gt;Output a random pair of twin primes. Every pair should possibly appear and the program should have zero possibility to fall into infinite loop. Notice that we don't know if there are infinite many pairs so you need some fallbacks to avoid finding a not-existing pair.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2021-03-21T06:05:52.413" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20893" PostTypeId="2" ParentId="2140" CreationDate="2021-03-21T10:03:55.870" Score="0" Body="&lt;h1&gt;Add trailing whitespace &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Sometimes, we accidentally have trailing whitespace in test cases, and some helpful person notices and fixes that. Thank you, helpful people.&lt;/p&gt;&#xA;&lt;p&gt;But what if we want to take a string without trailing whitespace and add some?&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to write a program that takes a string as input and adds between 1 and 10 spaces (randomly) to the end of each line.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;Between 1 and 10 (inclusive) spaces (&lt;code&gt;&amp;quot; &amp;quot;&lt;/code&gt;)  must be added to each line. There must be a nonzero chance of getting any number of spaces on any line.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, shortest wins.&lt;/p&gt;&#xA;&lt;p&gt;Apologies if this already exists - It's really hard to search.&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2021-03-23T08:07:24.210" LastActivityDate="2021-03-23T08:07:24.210" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20894" PostTypeId="2" ParentId="2140" CreationDate="2021-03-21T15:29:19.457" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/221091/minimally-destroy-cgcc-in-game-of-life&quot;&gt;Minimally destroy CGCC in Game of Life&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-03-23T00:03:09.753" LastActivityDate="2021-03-23T00:03:09.753" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="20895" PostTypeId="2" ParentId="2140" CreationDate="2021-03-21T17:33:11.880" Score="-1" Body="&lt;h1&gt;Is this an one-one function?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/set-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;set-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;set-theory&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Two sets given as input, one is the domain of a function, and other one is the co-domain of a function. As an example&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\{1,2,3,4\}&#xA;$$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\{5,6,7,8,9\}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Now if the range set of the function, i.e. set of each element in the co-domain set which maps to the domain set (&lt;code&gt;1 -&amp;gt; 5, 2 -&amp;gt; 6, ......&lt;/code&gt;) is equal to the co-domain set, then it is a one-one function.&lt;/p&gt;&#xA;&lt;p&gt;For the above example, the range set is&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\{5,6,7,8\}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;So the range set is not equal to co-domain set, the function is not a one-one function.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Inputted two domain and co-domain set of function, output a truthy value if the function is one-one or falsey if not.&lt;/p&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;{1,2,3,4} {5,6,7,8,9} -&amp;gt; Falsey&#xA;{a,b,c} {b,c,d} -&amp;gt; Truthy&#xA;{4,8,2} {3,4} -&amp;gt; Falsey&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Standard loopholes apply, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins&lt;/p&gt;&#xA;&lt;p&gt;Pre-defining the input sets in the header section of TIO is not allowed.&lt;/p&gt;&#xA;" OwnerUserId="92116" LastActivityDate="2021-03-21T17:33:11.880" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20896" PostTypeId="2" ParentId="2140" CreationDate="2021-03-21T22:59:24.447" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/230271/whats-missing-aka-the-vanilla-set-difference-challenge&quot;&gt;What's missing&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2021-06-22T09:39:26.903" LastActivityDate="2021-06-22T09:39:26.903" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="20899" PostTypeId="2" ParentId="2140" CreationDate="2021-03-22T16:54:10.243" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/221128/write-an-interpreter-generator&quot;&gt;Write an interpreter generator&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerDisplayName="user100690" LastEditorUserId="66833" LastEditDate="2021-03-23T15:40:25.923" LastActivityDate="2021-03-23T15:40:25.923" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="20900" PostTypeId="1" AcceptedAnswerId="20903" CreationDate="2021-03-22T17:47:00.633" Score="8" ViewCount="144" Body="&lt;p&gt;It looks like one user was awarded the silver &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; badge &lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/79/code-golf?userid=78850&quot;&gt;twice&lt;/a&gt; at the same time.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/E6I4L.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/E6I4L.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Their &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal?tab=badges&quot;&gt;badges&lt;/a&gt; page also shows the badge being awarded twice:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/qGXSM.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/qGXSM.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This looks like a bug. It could be that Lyxal messed something up by &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/57219749#57219749&quot;&gt;traveling in time&lt;/a&gt; to get it twice, but if it's happened to others, it may need to be fixed. On the other hand, this looks a benign bug, and it's not really hurting anyone.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;Sorry, Lyxal. &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/57413559#57413559&quot;&gt;Blame ChartZ Belatedly&lt;/a&gt;, not me.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="95792" LastEditorUserId="101081" LastEditDate="2021-06-07T17:28:21.820" LastActivityDate="2021-06-07T17:28:21.820" Title="Double tag badge" Tags="|bug|status-declined|badges|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20901" PostTypeId="2" ParentId="2140" CreationDate="2021-03-22T18:45:24.340" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/221353/keep-ppcg-running-in-game-of-life&quot;&gt;Keep PPCG running in Game of Life&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-03-25T15:52:55.977" LastActivityDate="2021-03-25T15:52:55.977" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="20902" PostTypeId="2" ParentId="2140" CreationDate="2021-03-22T21:10:14.920" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/222461/66833&quot;&gt;Decode Polybus Square/Tap Code/Prison Code&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="101340" LastEditorUserId="66833" LastEditDate="2021-03-30T15:15:04.747" LastActivityDate="2021-03-30T15:15:04.747" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="20903" PostTypeId="2" ParentId="20900" CreationDate="2021-03-23T02:01:33.567" Score="3" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;On the other hand, this looks a benign bug, and it's not really hurting anyone.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Exactly&lt;/h1&gt;&#xA;&lt;p&gt;Why go and fix something that only happened to one user when no one else is being bothered by the issue?&lt;/p&gt;&#xA;&lt;p&gt;But on a more serious note, it is such a small problem that realistically, StackExchange probably isn't going to fix. If it was happening to multitudes of people, then maybe a fix might be needed, but that isn't the case here.&lt;/p&gt;&#xA;&lt;p&gt;Nothing wrong with a bit of fun here and there. I find it a fitting testimony to my ability to break things accidentally.&lt;/p&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2021-03-23T02:01:33.567" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20904" PostTypeId="2" ParentId="2140" CreationDate="2021-03-23T02:25:32.787" Score="-1" Body="&lt;h1&gt;Remaking Kernel &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;I made a program as a final project in the main CS50 Harvard course, and it was named Kernel, written in C alsongside CS50's library.&lt;/p&gt;&#xA;&lt;h2&gt;Functions&lt;/h2&gt;&#xA;&lt;p&gt;It has 7 functions: 4 main (talk, count, calculate, build) and 3 advice functions (error, feedback, help).&lt;/p&gt;&#xA;&lt;p&gt;What each function does:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Talk&lt;/strong&gt; asks for a prompt to the user and outputs the same thing.&#xA;&lt;a href=&quot;https://i.stack.imgur.com/tMte5.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/tMte5.png&quot; alt=&quot;Talk Function&quot; /&gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Count&lt;/strong&gt; asks for a number to count from 1 to there. If the number is bigger than 50, it will lead to an error.&#xA;&lt;a href=&quot;https://i.stack.imgur.com/wAFiR.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/wAFiR.png&quot; alt=&quot;Count Function&quot; /&gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Calculate&lt;/strong&gt; asks for 2 numbers and an operator (must be either &lt;code&gt;+&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;, &lt;code&gt;*&lt;/code&gt; or &lt;code&gt;/&lt;/code&gt;) then will calculate the value. If the result is a number is greater or equal to &lt;code&gt;999999999&lt;/code&gt;, it leads to an error. However, &lt;code&gt;0 / 0 = 0&lt;/code&gt; and other division rules still apply.&#xA;&lt;a href=&quot;https://i.stack.imgur.com/Yo7G7.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Yo7G7.png&quot; alt=&quot;Calculate Function&quot; /&gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Build&lt;/strong&gt; asks for a size and something that it can build, which could be either a line, tower, wall, or pyramid. If the size is more than 20, it leads to an error. It would then ask for the character you want to use to build it, then it will be used to build the final product. There are multiple errors here, which is explained at the &lt;strong&gt;Error&lt;/strong&gt; function.&#xA;&lt;br /&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/8BIhQ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/8BIhQ.png&quot; alt=&quot;Build Function&quot; /&gt;&lt;/a&gt;&lt;em&gt;Disappointed that I can't make a proper pyramid.&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Error&lt;/strong&gt; is a library that shows all 14 errors, which is listed in the Error page of this post.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Feedback&lt;/strong&gt; asks for feedback from the user and they can type whatever they want. The input will then be transferred in a new file called &lt;code&gt;Feedback.list&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/tAUIA.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/tAUIA.png&quot; alt=&quot;Feedback Function&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Inside &lt;code&gt;Feedback.list&lt;/code&gt;: &lt;a href=&quot;https://i.stack.imgur.com/8TJRy.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/8TJRy.png&quot; alt=&quot;What's in here?&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Help&lt;/strong&gt; displays the info of the entire app.&#xA;&lt;a href=&quot;https://i.stack.imgur.com/0lL7t.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/0lL7t.png&quot; alt=&quot;Help Function&quot; /&gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Errors&lt;/h2&gt;&#xA;&lt;p&gt;There are 14 written errors to prevent writing the real errors.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;NO_FUNCTION_ADDED&lt;/code&gt;: When asking for which function to use, entering a non-existent one will result to this error.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ERROR_CLASS_NONE&lt;/code&gt;: In &lt;strong&gt;Error&lt;/strong&gt;, entering a number which doesn't have its error will pop this up.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;COUNT_MAX&lt;/code&gt;: Well, typing a number greater than 50 won't put up the error, but counting up to 50 will.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;INVALID_DIVIDE&lt;/code&gt;: Anything divided by &lt;code&gt;0&lt;/code&gt; in &lt;strong&gt;Calculate&lt;/strong&gt; (except &lt;code&gt;0 / 0&lt;/code&gt;) will put up this error.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ExTREME_VALUE&lt;/code&gt;: In &lt;strong&gt;Calculate&lt;/strong&gt;, earning a final number of &lt;code&gt;999,999,999&lt;/code&gt; or more will result to this error.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;OVERSIZE_CHUNK&lt;/code&gt;: Entering a size larger than &lt;code&gt;20&lt;/code&gt; in &lt;strong&gt;Build&lt;/strong&gt; will result to this error.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;UNKNOWN_STRUCTURE&lt;/code&gt;: Also in &lt;strong&gt;Build&lt;/strong&gt;, inputting a structure unavailable will pop this up.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;UNCLEAR_INSTRUCT&lt;/code&gt;: If the input for &lt;strong&gt;Build&lt;/strong&gt;'s line is not vertical, horizontal or diagonal, they wouldn't know what it is.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;OVERWIDTH_COUNT&lt;/code&gt;: &lt;strong&gt;Build&lt;/strong&gt;ing a tower with a width of 20 or more is invalid.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;INVALID_PYRAMID&lt;/code&gt;: Similar to &lt;strong&gt;Build&lt;/strong&gt;'s line, inputting a pyramid unavailable pops this up.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;OPERATE_BAD&lt;/code&gt;: Inputting an operator unavailable in &lt;strong&gt;Calculate&lt;/strong&gt; is invalid.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;MORE_NAMES&lt;/code&gt;: If you didn't know, to run Kernel, you need to add your name alongside running it. Me, I use &lt;code&gt;./Kernel MarkGiraffe&lt;/code&gt;. If I use &lt;code&gt;Mark Giraffe&lt;/code&gt; instead, it is invalid.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;SECRET_USER&lt;/code&gt;: Even NOT putting a name is not allowed.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;BAD_ALIGNMENT&lt;/code&gt;: Not choosing left or right for a diagonal line in &lt;strong&gt;Build&lt;/strong&gt; is invalid.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;For this challenge, I want &lt;em&gt;you&lt;/em&gt; to remake the program the most designed way, while still keeping low bytes.&lt;/p&gt;&#xA;&lt;p&gt;In case you are interested, I will post the source code somewhere where you can view it.&lt;/p&gt;&#xA;" OwnerUserId="99626" LastActivityDate="2021-03-23T02:25:32.787" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20905" PostTypeId="2" ParentId="8047" CreationDate="2021-03-23T03:56:58.200" Score="14" Body="&lt;h1&gt;Multipart challenges with unrelated sub-tasks&lt;/h1&gt;&#xA;&lt;p&gt;In general, a challenge on Code Golf should focus on a single core task. Challenges with multiple sub-tasks are discouraged, especially when the sub-tasks have zero or very little interaction or common aspects.&lt;/p&gt;&#xA;&lt;p&gt;If the answer to at least one of the following questions is &amp;quot;yes&amp;quot;, your challenge has a high chance to be poorly received on Code Golf.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If the sub-tasks are posted as individual challenges, are they interesting on their own, or are some of them already on Code Golf?&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If multiple individual sub-tasks are already on Code Golf, your challenge has a high risk of getting closed as duplicate. &lt;a href=&quot;https://codegolf.stackexchange.com/q/141293/78410&quot;&gt;An extreme example.&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;If you collect golfed answers to individual sub-tasks and simply merge into one, is it likely to be competitive?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;One type of newbies' challenges is &amp;quot;replicate this small but multi-function utility&amp;quot;, which suffers from being multipart by definition. (Note that they often also suffer from other kinds of quality problems, such as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8077/78410&quot;&gt;rigid I/O&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/16596/78410&quot;&gt;input validation/error handling&lt;/a&gt;, and sometimes lack of clarity due to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10909/78410&quot;&gt;random numbers&lt;/a&gt; or &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/19357/78410&quot;&gt;arithmetic expressions&lt;/a&gt;.)&lt;/p&gt;&#xA;&lt;p&gt;More in-depth discussion can be found &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8464/78410&quot;&gt;in this post by Martin Ender&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-03-23T04:46:06.630" LastActivityDate="2021-03-23T04:46:06.630" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20906" PostTypeId="2" ParentId="2140" CreationDate="2021-03-23T16:00:35.890" Score="5" Body="&lt;h1&gt;Two Diehards Make a Glider&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game-of-life&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game-of-life&amp;#39;&quot; rel=&quot;tag&quot;&gt;game-of-life&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/221421/45613&quot;&gt;POSTED&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2021-03-26T15:49:25.843" LastActivityDate="2021-03-26T15:49:25.843" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20907" PostTypeId="2" ParentId="2140" CreationDate="2021-03-23T17:22:33.507" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/222632/whats-my-tio-uniqueness&quot;&gt;What&amp;#39;s my TIO uniqueness?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-03-30T23:21:42.057" LastActivityDate="2021-03-30T23:21:42.057" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="20908" PostTypeId="2" ParentId="2140" CreationDate="2021-03-23T19:34:35.140" Score="1" Body="&lt;h2&gt;ROT47(code) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cipher&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cipher&amp;#39;&quot; rel=&quot;tag&quot;&gt;cipher&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/ROT13&quot; rel=&quot;nofollow noreferrer&quot;&gt;ROT13&lt;/a&gt; is a &lt;a href=&quot;https://en.wikipedia.org/wiki/Caesar_cipher&quot; rel=&quot;nofollow noreferrer&quot;&gt;Caesar cipher&lt;/a&gt; where every letter is replaced by the 13th letter that follows it in the alphabet.&lt;/p&gt;&#xA;&lt;p&gt;Every letter and its counterpart:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;a&lt;/th&gt;&#xA;&lt;th&gt;b&lt;/th&gt;&#xA;&lt;th&gt;c&lt;/th&gt;&#xA;&lt;th&gt;d&lt;/th&gt;&#xA;&lt;th&gt;e&lt;/th&gt;&#xA;&lt;th&gt;f&lt;/th&gt;&#xA;&lt;th&gt;g&lt;/th&gt;&#xA;&lt;th&gt;h&lt;/th&gt;&#xA;&lt;th&gt;i&lt;/th&gt;&#xA;&lt;th&gt;j&lt;/th&gt;&#xA;&lt;th&gt;k&lt;/th&gt;&#xA;&lt;th&gt;l&lt;/th&gt;&#xA;&lt;th&gt;m&lt;/th&gt;&#xA;&lt;th&gt;n&lt;/th&gt;&#xA;&lt;th&gt;o&lt;/th&gt;&#xA;&lt;th&gt;p&lt;/th&gt;&#xA;&lt;th&gt;q&lt;/th&gt;&#xA;&lt;th&gt;r&lt;/th&gt;&#xA;&lt;th&gt;s&lt;/th&gt;&#xA;&lt;th&gt;t&lt;/th&gt;&#xA;&lt;th&gt;u&lt;/th&gt;&#xA;&lt;th&gt;v&lt;/th&gt;&#xA;&lt;th&gt;w&lt;/th&gt;&#xA;&lt;th&gt;x&lt;/th&gt;&#xA;&lt;th&gt;y&lt;/th&gt;&#xA;&lt;th&gt;z&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;n&lt;/td&gt;&#xA;&lt;td&gt;o&lt;/td&gt;&#xA;&lt;td&gt;p&lt;/td&gt;&#xA;&lt;td&gt;q&lt;/td&gt;&#xA;&lt;td&gt;r&lt;/td&gt;&#xA;&lt;td&gt;s&lt;/td&gt;&#xA;&lt;td&gt;t&lt;/td&gt;&#xA;&lt;td&gt;u&lt;/td&gt;&#xA;&lt;td&gt;v&lt;/td&gt;&#xA;&lt;td&gt;w&lt;/td&gt;&#xA;&lt;td&gt;x&lt;/td&gt;&#xA;&lt;td&gt;y&lt;/td&gt;&#xA;&lt;td&gt;z&lt;/td&gt;&#xA;&lt;td&gt;a&lt;/td&gt;&#xA;&lt;td&gt;b&lt;/td&gt;&#xA;&lt;td&gt;c&lt;/td&gt;&#xA;&lt;td&gt;d&lt;/td&gt;&#xA;&lt;td&gt;e&lt;/td&gt;&#xA;&lt;td&gt;f&lt;/td&gt;&#xA;&lt;td&gt;g&lt;/td&gt;&#xA;&lt;td&gt;h&lt;/td&gt;&#xA;&lt;td&gt;i&lt;/td&gt;&#xA;&lt;td&gt;j&lt;/td&gt;&#xA;&lt;td&gt;k&lt;/td&gt;&#xA;&lt;td&gt;l&lt;/td&gt;&#xA;&lt;td&gt;m&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.dcode.fr/rot-47-cipher&quot; rel=&quot;nofollow noreferrer&quot;&gt;ROT47&lt;/a&gt; is a deritave of ROT13 which includes all the &lt;a href=&quot;https://en.wikipedia.org/wiki/ASCII#Printable_characters&quot; rel=&quot;nofollow noreferrer&quot;&gt;ASCII printable characters&lt;/a&gt; except space. Rot47 substitutes every character with the 47th character that follows it in the ASCII range.&lt;br&gt;&lt;br&gt;&#xA;Every character and its counterpart:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;!&lt;/th&gt;&#xA;&lt;th&gt;&amp;quot;&lt;/th&gt;&#xA;&lt;th&gt;#&lt;/th&gt;&#xA;&lt;th&gt;$&lt;/th&gt;&#xA;&lt;th&gt;%&lt;/th&gt;&#xA;&lt;th&gt;&amp;amp;&lt;/th&gt;&#xA;&lt;th&gt;'&lt;/th&gt;&#xA;&lt;th&gt;(&lt;/th&gt;&#xA;&lt;th&gt;)&lt;/th&gt;&#xA;&lt;th&gt;*&lt;/th&gt;&#xA;&lt;th&gt;+&lt;/th&gt;&#xA;&lt;th&gt;,&lt;/th&gt;&#xA;&lt;th&gt;-&lt;/th&gt;&#xA;&lt;th&gt;.&lt;/th&gt;&#xA;&lt;th&gt;/&lt;/th&gt;&#xA;&lt;th&gt;0&lt;/th&gt;&#xA;&lt;th&gt;1&lt;/th&gt;&#xA;&lt;th&gt;2&lt;/th&gt;&#xA;&lt;th&gt;3&lt;/th&gt;&#xA;&lt;th&gt;4&lt;/th&gt;&#xA;&lt;th&gt;5&lt;/th&gt;&#xA;&lt;th&gt;6&lt;/th&gt;&#xA;&lt;th&gt;7&lt;/th&gt;&#xA;&lt;th&gt;8&lt;/th&gt;&#xA;&lt;th&gt;9&lt;/th&gt;&#xA;&lt;th&gt;:&lt;/th&gt;&#xA;&lt;th&gt;;&lt;/th&gt;&#xA;&lt;th&gt;&amp;lt;&lt;/th&gt;&#xA;&lt;th&gt;=&lt;/th&gt;&#xA;&lt;th&gt;&amp;gt;&lt;/th&gt;&#xA;&lt;th&gt;?&lt;/th&gt;&#xA;&lt;th&gt;@&lt;/th&gt;&#xA;&lt;th&gt;A&lt;/th&gt;&#xA;&lt;th&gt;B&lt;/th&gt;&#xA;&lt;th&gt;C&lt;/th&gt;&#xA;&lt;th&gt;D&lt;/th&gt;&#xA;&lt;th&gt;E&lt;/th&gt;&#xA;&lt;th&gt;F&lt;/th&gt;&#xA;&lt;th&gt;G&lt;/th&gt;&#xA;&lt;th&gt;H&lt;/th&gt;&#xA;&lt;th&gt;I&lt;/th&gt;&#xA;&lt;th&gt;J&lt;/th&gt;&#xA;&lt;th&gt;K&lt;/th&gt;&#xA;&lt;th&gt;L&lt;/th&gt;&#xA;&lt;th&gt;M&lt;/th&gt;&#xA;&lt;th&gt;N&lt;/th&gt;&#xA;&lt;th&gt;O&lt;/th&gt;&#xA;&lt;th&gt;P&lt;/th&gt;&#xA;&lt;th&gt;Q&lt;/th&gt;&#xA;&lt;th&gt;R&lt;/th&gt;&#xA;&lt;th&gt;S&lt;/th&gt;&#xA;&lt;th&gt;T&lt;/th&gt;&#xA;&lt;th&gt;U&lt;/th&gt;&#xA;&lt;th&gt;V&lt;/th&gt;&#xA;&lt;th&gt;W&lt;/th&gt;&#xA;&lt;th&gt;X&lt;/th&gt;&#xA;&lt;th&gt;Y&lt;/th&gt;&#xA;&lt;th&gt;Z&lt;/th&gt;&#xA;&lt;th&gt;[&lt;/th&gt;&#xA;&lt;th&gt;\&lt;/th&gt;&#xA;&lt;th&gt;]&lt;/th&gt;&#xA;&lt;th&gt;^&lt;/th&gt;&#xA;&lt;th&gt;_&lt;/th&gt;&#xA;&lt;th&gt;`&lt;/th&gt;&#xA;&lt;th&gt;a&lt;/th&gt;&#xA;&lt;th&gt;b&lt;/th&gt;&#xA;&lt;th&gt;c&lt;/th&gt;&#xA;&lt;th&gt;d&lt;/th&gt;&#xA;&lt;th&gt;e&lt;/th&gt;&#xA;&lt;th&gt;f&lt;/th&gt;&#xA;&lt;th&gt;g&lt;/th&gt;&#xA;&lt;th&gt;h&lt;/th&gt;&#xA;&lt;th&gt;i&lt;/th&gt;&#xA;&lt;th&gt;j&lt;/th&gt;&#xA;&lt;th&gt;k&lt;/th&gt;&#xA;&lt;th&gt;l&lt;/th&gt;&#xA;&lt;th&gt;m&lt;/th&gt;&#xA;&lt;th&gt;n&lt;/th&gt;&#xA;&lt;th&gt;o&lt;/th&gt;&#xA;&lt;th&gt;p&lt;/th&gt;&#xA;&lt;th&gt;q&lt;/th&gt;&#xA;&lt;th&gt;r&lt;/th&gt;&#xA;&lt;th&gt;s&lt;/th&gt;&#xA;&lt;th&gt;t&lt;/th&gt;&#xA;&lt;th&gt;u&lt;/th&gt;&#xA;&lt;th&gt;v&lt;/th&gt;&#xA;&lt;th&gt;w&lt;/th&gt;&#xA;&lt;th&gt;x&lt;/th&gt;&#xA;&lt;th&gt;y&lt;/th&gt;&#xA;&lt;th&gt;z&lt;/th&gt;&#xA;&lt;th&gt;{&lt;/th&gt;&#xA;&lt;th&gt;|&lt;/th&gt;&#xA;&lt;th&gt;}&lt;/th&gt;&#xA;&lt;th&gt;~&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;P&lt;/td&gt;&#xA;&lt;td&gt;Q&lt;/td&gt;&#xA;&lt;td&gt;R&lt;/td&gt;&#xA;&lt;td&gt;S&lt;/td&gt;&#xA;&lt;td&gt;T&lt;/td&gt;&#xA;&lt;td&gt;U&lt;/td&gt;&#xA;&lt;td&gt;V&lt;/td&gt;&#xA;&lt;td&gt;W&lt;/td&gt;&#xA;&lt;td&gt;X&lt;/td&gt;&#xA;&lt;td&gt;Y&lt;/td&gt;&#xA;&lt;td&gt;Z&lt;/td&gt;&#xA;&lt;td&gt;[&lt;/td&gt;&#xA;&lt;td&gt;\&lt;/td&gt;&#xA;&lt;td&gt;]&lt;/td&gt;&#xA;&lt;td&gt;^&lt;/td&gt;&#xA;&lt;td&gt;_&lt;/td&gt;&#xA;&lt;td&gt;`&lt;/td&gt;&#xA;&lt;td&gt;a&lt;/td&gt;&#xA;&lt;td&gt;b&lt;/td&gt;&#xA;&lt;td&gt;c&lt;/td&gt;&#xA;&lt;td&gt;d&lt;/td&gt;&#xA;&lt;td&gt;e&lt;/td&gt;&#xA;&lt;td&gt;f&lt;/td&gt;&#xA;&lt;td&gt;g&lt;/td&gt;&#xA;&lt;td&gt;h&lt;/td&gt;&#xA;&lt;td&gt;i&lt;/td&gt;&#xA;&lt;td&gt;j&lt;/td&gt;&#xA;&lt;td&gt;k&lt;/td&gt;&#xA;&lt;td&gt;l&lt;/td&gt;&#xA;&lt;td&gt;m&lt;/td&gt;&#xA;&lt;td&gt;n&lt;/td&gt;&#xA;&lt;td&gt;o&lt;/td&gt;&#xA;&lt;td&gt;p&lt;/td&gt;&#xA;&lt;td&gt;q&lt;/td&gt;&#xA;&lt;td&gt;r&lt;/td&gt;&#xA;&lt;td&gt;s&lt;/td&gt;&#xA;&lt;td&gt;t&lt;/td&gt;&#xA;&lt;td&gt;u&lt;/td&gt;&#xA;&lt;td&gt;v&lt;/td&gt;&#xA;&lt;td&gt;w&lt;/td&gt;&#xA;&lt;td&gt;x&lt;/td&gt;&#xA;&lt;td&gt;y&lt;/td&gt;&#xA;&lt;td&gt;z&lt;/td&gt;&#xA;&lt;td&gt;{&lt;/td&gt;&#xA;&lt;td&gt;|&lt;/td&gt;&#xA;&lt;td&gt;}&lt;/td&gt;&#xA;&lt;td&gt;~&lt;/td&gt;&#xA;&lt;td&gt;!&lt;/td&gt;&#xA;&lt;td&gt;&amp;quot;&lt;/td&gt;&#xA;&lt;td&gt;#&lt;/td&gt;&#xA;&lt;td&gt;$&lt;/td&gt;&#xA;&lt;td&gt;%&lt;/td&gt;&#xA;&lt;td&gt;&amp;amp;&lt;/td&gt;&#xA;&lt;td&gt;'&lt;/td&gt;&#xA;&lt;td&gt;(&lt;/td&gt;&#xA;&lt;td&gt;)&lt;/td&gt;&#xA;&lt;td&gt;*&lt;/td&gt;&#xA;&lt;td&gt;+&lt;/td&gt;&#xA;&lt;td&gt;,&lt;/td&gt;&#xA;&lt;td&gt;-&lt;/td&gt;&#xA;&lt;td&gt;.&lt;/td&gt;&#xA;&lt;td&gt;/&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;td&gt;5&lt;/td&gt;&#xA;&lt;td&gt;6&lt;/td&gt;&#xA;&lt;td&gt;7&lt;/td&gt;&#xA;&lt;td&gt;8&lt;/td&gt;&#xA;&lt;td&gt;9&lt;/td&gt;&#xA;&lt;td&gt;:&lt;/td&gt;&#xA;&lt;td&gt;;&lt;/td&gt;&#xA;&lt;td&gt;&amp;lt;&lt;/td&gt;&#xA;&lt;td&gt;=&lt;/td&gt;&#xA;&lt;td&gt;&amp;gt;&lt;/td&gt;&#xA;&lt;td&gt;?&lt;/td&gt;&#xA;&lt;td&gt;@&lt;/td&gt;&#xA;&lt;td&gt;A&lt;/td&gt;&#xA;&lt;td&gt;B&lt;/td&gt;&#xA;&lt;td&gt;C&lt;/td&gt;&#xA;&lt;td&gt;D&lt;/td&gt;&#xA;&lt;td&gt;E&lt;/td&gt;&#xA;&lt;td&gt;F&lt;/td&gt;&#xA;&lt;td&gt;G&lt;/td&gt;&#xA;&lt;td&gt;H&lt;/td&gt;&#xA;&lt;td&gt;I&lt;/td&gt;&#xA;&lt;td&gt;J&lt;/td&gt;&#xA;&lt;td&gt;K&lt;/td&gt;&#xA;&lt;td&gt;L&lt;/td&gt;&#xA;&lt;td&gt;M&lt;/td&gt;&#xA;&lt;td&gt;N&lt;/td&gt;&#xA;&lt;td&gt;O&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;&lt;strong&gt;I ROT47( your code) and you ROT47( the output)&lt;/strong&gt; &lt;br&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;Your code is supposed to at least output 1 character within the [33,126] ASCII range.&lt;/em&gt;&lt;br&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;When ROT47 is applied on your code, the output should also be ROT47 of the previous output&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;solve in the fewest bytes possible&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Below a ROT47 converter taken from &lt;a href=&quot;https://www.dcode.fr/rot-47-cipher&quot; rel=&quot;nofollow noreferrer&quot;&gt;decode&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;var input = document.getElementById(&quot;input&quot;);&#xA;var editor = CodeMirror(input, {&#xA;    lineNumbers: true,&#xA;    tabSize: 2,&#xA;    mode: 'javascript',&#xA;    theme: 'monokai'&#xA;});&#xA;editor.setSize(900, 100);&#xA;document.getElementById(&quot;button&quot;).onclick = function(){&#xA;  editor.setValue(rot47(editor.getValue()));&#xA;}&#xA;&#xA;&#xA;//implementation below from https://www.dcode.fr/rot-47-cipher&#xA;// Javascript&#xA;function rot47(x){&#xA; var s='';&#xA; for(var i=0;i&amp;lt;x.length;i++){&#xA;  var j=x.charCodeAt(i);&#xA;  if((j&amp;gt;=33)&amp;amp;&amp;amp;(j&amp;lt;=126)){&#xA;   s+=String.fromCharCode(33+((j+14)%94));&#xA;  }&#xA;  else {&#xA;   s+=String.fromCharCode(j);&#xA;  }&#xA; }&#xA; return s;&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;head&amp;gt;&#xA;&amp;lt;meta content=&quot;text/html;charset=utf-8&quot; http-equiv=&quot;Content-Type&quot;&amp;gt;&#xA;&amp;lt;meta content=&quot;utf-8&quot; http-equiv=&quot;encoding&quot;&amp;gt;&#xA;&amp;lt;link rel=&quot;stylesheet&quot; href=&quot;https://cdnjs.cloudflare.com/ajax/libs/codemirror/5.60.0/codemirror.min.css&quot; integrity=&quot;sha512-xIf9AdJauwKIVtrVRZ0i4nHP61Ogx9fSRAkCLecmE2dL/U8ioWpDvFCAy4dcfecN72HHB9+7FfQj3aiO68aaaw==&quot; crossorigin=&quot;anonymous&quot; /&amp;gt;&#xA;&amp;lt;script src=&quot;https://cdnjs.cloudflare.com/ajax/libs/codemirror/5.60.0/codemirror.min.js&quot; integrity=&quot;sha512-hc0zo04EIwTzKLvp2eycDTeIUuvoGYYmFIjYx7DmfgQeZPC5N27sPG2wEQPq8d8fCTwuguLrI1ffatqxyTbHJw==&quot; crossorigin=&quot;anonymous&quot;&amp;gt;&amp;lt;/script&amp;gt;&#xA;&amp;lt;link rel=&quot;stylesheet&quot; href=&quot;https://cdnjs.cloudflare.com/ajax/libs/codemirror/5.60.0/theme/monokai.min.css&quot; integrity=&quot;sha512-R6PH4vSzF2Yxjdvb2p2FA06yWul+U0PDDav4b/od/oXf9Iw37zl10plvwOXelrjV2Ai7Eo3vyHeyFUjhXdBCVQ==&quot; crossorigin=&quot;anonymous&quot; /&amp;gt;&#xA;&amp;lt;/head&amp;gt;&#xA;&amp;lt;body style=&quot;background-color:#333333&#xA;&quot;&amp;gt;&#xA;&amp;lt;div id=&quot;input&quot;&amp;gt;&#xA;&amp;lt;/div&amp;gt;&amp;lt;/br&amp;gt;&#xA;&amp;lt;button id=&quot;button&quot; style=&quot;background-color: #17202a&#xA;;color:white&quot;&amp;gt;ROT47&amp;lt;/button&amp;gt;&#xA;&amp;lt;/body&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&lt;hr&gt;&#xA;&lt;h3&gt;Meta questions:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is it an interesting challenge?&lt;/li&gt;&#xA;&lt;li&gt;Is the explanation clear?&lt;/li&gt;&#xA;&lt;li&gt;suggestion for a title.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="99744" LastEditorUserId="99744" LastEditDate="2021-03-23T22:48:50.660" LastActivityDate="2021-03-23T22:48:50.660" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="20909" PostTypeId="1" AcceptedAnswerId="20923" CreationDate="2021-03-23T20:40:12.570" Score="6" ViewCount="68" Body="&lt;p&gt;There are currently 13 questions tagged with &lt;a href=&quot;/questions/tagged/faq-proposed&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;faq-proposed&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq-proposed&lt;/a&gt;, the &amp;quot;staging ground&amp;quot; for posts before they become official &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq&lt;/a&gt; posts and are added to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1280/community-faq-for-programming-puzzles-code-golf&quot;&gt;the FAQ&lt;/a&gt;. &lt;a href=&quot;/questions/tagged/faq-proposed&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;faq-proposed&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq-proposed&lt;/a&gt; is not intended to be a permanent tag, more of a placeholder, yet of these 13 questions, the most active (in terms of tag edits) was &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17636/in-bash-can-i-use-non-coreutil-programs&quot;&gt;this one&lt;/a&gt;, where the tag was part of the initial question, almost 2 years ago.&lt;/p&gt;&#xA;&lt;p&gt;While the FAQ isn't exactly the most visited page, it cannot hurt to keep it up to date and relevant, rather than having useful posts scattered around Meta.&lt;/p&gt;&#xA;&lt;p&gt;I propose the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We go through all 13 of these questions and either add them to the &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq&lt;/a&gt; or remove the &lt;a href=&quot;/questions/tagged/faq-proposed&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;faq-proposed&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq-proposed&lt;/a&gt; tag from them (and potentially update the questions and answers to some)&lt;/li&gt;&#xA;&lt;li&gt;We find any posts without either FAQ tag that could potentially be added to the &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq&lt;/a&gt; and add the &lt;a href=&quot;/questions/tagged/faq-proposed&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;faq-proposed&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq-proposed&lt;/a&gt; to them&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The 13 FAQ proposed questions are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/13944/how-does-this-site-work&quot;&gt;How does this site work?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11924/new-users-guides-to-golfing-rules-in-specific-languages&quot;&gt;New users&amp;#39; guides to golfing rules in specific languages&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17636/in-bash-can-i-use-non-coreutil-programs&quot;&gt;In bash, can I use non-coreutil programs&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10351/useful-external-resources&quot;&gt;Useful External Resources&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12339/how-are-bytes-counted-in-assembly&quot;&gt;How are bytes counted in assembly?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12374/catalogue-of-catalogues&quot;&gt;Catalogue of Catalogues&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10184/is-it-ok-to-promote-my-own-posts-in-chat&quot;&gt;Is it OK to promote my own posts in chat?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/777/are-two-questions-duplicates-if-they-have-different-scoring-rules&quot;&gt;Are two questions duplicates if they have different scoring rules?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2035/how-long-should-i-wait-before-accepting-an-answer&quot;&gt;How long should I wait before accepting an answer?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10225/general-rules-for-custom-languages-and-libraries&quot;&gt;General rules for custom languages and libraries&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4780/should-submissions-be-allowed-to-exit-with-an-error&quot;&gt;Should submissions be allowed to exit with an error?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet&quot;&gt;Default for Code Golf: Program, Function or Snippet?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1561/how-do-we-deal-with-novel-emerging-recurring-challenge-types&quot;&gt;How do we deal with novel emerging/recurring challenge types?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="68942" LastEditDate="2021-04-06T00:12:22.270" LastActivityDate="2021-04-06T00:12:22.270" Title="Can we clear up the [faq-proposed] tag?" Tags="|discussion|support|status-completed|" AnswerCount="1" CommentCount="0" FavoriteCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20910" PostTypeId="2" ParentId="5243" CreationDate="2021-03-23T23:27:13.240" Score="4" Body="&lt;h1&gt;200 – 500 rep for outgolfing my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/126373/am-i-a-fibonacci-number/178956#178956&quot;&gt;Fibonacci regex&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;If you can write an ECMAScript (pre-2018, no lookbehind) regex that matches exactly the same set within the domain &lt;code&gt;^x*$&lt;/code&gt; as my 161 byte regex, i.e. all nonnegative Fibonacci numbers in unary, I will award at minimum a 200 rep bounty. If it's a really significant reduction in size, or especially interesting mathematically, that bounty may increase (up to 500).&lt;/p&gt;&#xA;&lt;p&gt;This was the first really large regex I ever wrote, and I think I've finally milked it dry golf-wise. But &lt;a href=&quot;https://codegolf.stackexchange.com/questions/110708/an-abundance-of-integers/178952#comment436018_178952&quot;&gt;I've been wrong before&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="17216" LastEditorUserId="17216" LastEditDate="2021-03-23T23:47:09.093" LastActivityDate="2021-03-23T23:47:09.093" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20911" PostTypeId="2" ParentId="2140" CreationDate="2021-03-23T23:35:20.650" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224147/leave-a-wake-of-dead-cells-behind-you&quot;&gt;Leave a wake of dead cells behind you&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-22T00:49:20.290" LastActivityDate="2021-04-22T00:49:20.290" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20912" PostTypeId="2" ParentId="2140" CreationDate="2021-03-24T07:48:40.267" Score="7" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/222876/calculate-longest-stack-exchange-streak&quot;&gt;Calculate longest Stack Exchange streak&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="38979" LastEditorUserId="66833" LastEditDate="2021-04-06T01:04:20.403" LastActivityDate="2021-04-06T01:04:20.403" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="20913" PostTypeId="1" AcceptedAnswerId="20914" CreationDate="2021-03-24T09:05:28.100" Score="5" ViewCount="61" Body="&lt;p&gt;I am a Pxem user; I have answered some in Pxem. Since tio.run does not provide Pxem, I am posting online demo, with my interpreter, &lt;a href=&quot;https://tio.run/##nRhtV9pI9/v@imE2wAwQAoitZRxdRdtlV6mrbrcVqCdCkGhIgAQFgf71PvdOEgzW5@zL6SkzuXPnvr@NPdMffP@ZDIJg5NcM49YOBtObYtcbGh9@1S9HpvXefHyyXGM0s4bFkefbM9sfGjeOd2MMTTuE28VKcWi76@OffCsgujUV06Hp35NSqVIR1mzkTQJyUr8@ODmRdcGC@cgit1bQ9dx@JqO@gOvQdHt8z@hZD4Y7dRxS2cuUM5no8tnB5a@SaizCI/ooJqCOuLbAJV9bhRt9RWO2fzYbn68vLo9kpVTaioFnHy8an0@@XNc/np8f1y9lWbSI7hKqLQ4PLn69/nR8ftH42KwBGdLJZBZEaeURpaXAj/yhWK3vXL12xRpOHTOwiD/AC94ogN2jN@n5I8cOhOnYpk/0W5LVFuU81X6hq6zM4poVzT9PTuqnR7KmWIDSyLAn/IHdDxTzHkHECGB1Bx7RfuaUSFJG1kxB/IEFNgw8j3hOby@DXrADUubCejAdQlOkbzq@RZfLV9BJEl9JoHBmS9/qkaxvzIy5IXz4eTKyiu8T6SyXoLKiBDg/sAVNwALOg3z3ToALR7ZjMc76siS6pm8BhzIltktYP8dJH7whLN/sCtP3reGNM0fHe@DzA5foD8G0vAwmRK/7pFSubFW337zdeUeyrbab62SXtxNrRIpL8/GeZA@PPzSaCweY9GT1jQDrstHEdoM@yY7OvI9u025cd@v@xcOn/nvreHL@@Nfs8/zL05V5EFwOT3tHeT2lpdPZ5X9grZUkrbco0UqEdmSbUjCJ4z1aE@aHIjCa7tKCVuKc0DYVVIAhsyo0GKWFiwKtUS5Q9L70JaWi702YgIh3bNci/b2S4Au7z2KAvytLXOEB0EdL1jOZvpQ9vjhmXCiWpN7yO2JlgdcJYqnTxwF6ItyfsD5HduIl4fAECSlnlsRqtWbzIwPFIbxywnwOAMRY9aduN7A9l5ywrpK9mwJ5uR@Y3fuWk893ZDeBBFcQx@GLyGPUiWzggO6OrvMYDv8iGnq5EwkCdlitssoT@gPxIHxU8NE4JEKtIx33QEE3L43W42z@1DF0wzTQAu5uKWJOiyY5rJJiiECXtGtCRENs03VwKzzwNQupmB1jn5JfQDQ3D@RqoCeS9JRORs/IZFIuj2wZQvhiKl29LELJ3L1p0r3KB5EooRDk0fBI0XxVlpe6hMJRM5IHMJT73H9BMnY7xKiI7J72222sfXGK0iVrkdDMRHcCUsFKBJSWsRdMWcIFglTrU9wNAJD1c2Cyked2/YdJ0DFyzNwt87zRykPm6eF3hYN/rFkgVsbIWAAZ4UOBWPm7ZQH/o6MB7AageGDkUilTrBa@TBmtvhV5Q5hoFPu6Y@QNB6g23@vAhpngexCgC4Zqea4PAgBwgEBjaOhwXIZdLItYlSFJX6i5taFmdnHWsvOljtTAr/m8GEn41iuQFKNvEMCZDDBfhCA5CkN3euMHE6aVCltc9CzHgoZx1tJ1uyNCxeDiV4e0vpJOHu93jQVcYVQBNFqgGZKhhZDk3xLQkIJvLGxdVl7g/p@bTnRD8SRrpv@Y47PgsRUh9MHjWhp3gMhIaUlKIRrXKF94aDuoniMxk1rzvSBzqYXuEgkhkqKMOOJ7mEizXTnni2s5g8tzMZfXYrVhbYhcZrTzxv4sP6@B0/dnOqwpWHOwpmFNz2vQ3F7X67h5tMASdAcheLdri7t8PqxCgHbXweyI@yOkWjGnGUY2BBhgDrChYWDTRMlzxhnLcGHcwjeBwUvcQH9UeWBfQyb0rUkw7IDdjQxUTkMEIk5oAIUVAg74Qp2YCFypbQ@32OWwZffX84DqylnMYVbi2eUy/O4B6YkVTCcudp6QSx4JmL1ezFXHb/8miL9T@A1jTfzd1hDQsx9iQFoheDEB3yjmjL8u3zOagQoI5ngh2bodh2X5onUvIXkgweM@OAj7YBamhCCuPFk09HJ9dd0yLHbIF/eQdUCmI@EH@wH66xAoHu4iVByCy2BTOIwQYPOCOIoODLjq8z0CRY4LSG2/O7FHgYwExe5nWb1vtAgNbALjqPpMNrkzdsRRn8LvjHfkkZIJRNtscKH5U79vtMff1gcEDvbKiaPfn4@UNs8nlxsnyBSVfz7/zM754lwCmpJE1yPXk/ME0pTVo57A9PIuDBD13cr2G75fr2E/XaN9QFpggan7zSgaSHbqiqmLw8cz0Wi3brH7WqmmJ3X5E5nBrXoCdsBO46Z0cANTeg1S9vS1frS@MWLxCJMCg/Ip@wy/iXMvHCNeP3RZozAuHBWcZ5zFWAISzF2O5d4GAzbmKoIa0HAau9IRDYifKWNHMqrb40KjUOb8G22V9Hcdun@Ur@7Uqts49KzZ2CDDGfuwyfuanRbqhavCF744lbR4XSNNL8D6ZN1aEyrqEvDFFbBVM0847FXfhk7Z3uE3E8u8x4pXh1pbbW1td7B2XslqVa9Hl0MU7PRsJ7xXrkJ3q0u5hR01RIL3U2C7U0us0PYhdn23uoOIe9tvOVdgJcMz95AB/yK/EFbXAVmgM8UZu8p9SerYTRj/jF1uGsBPHH7eSIAHcMtd4RNXtRZMX4Jsv5MqpMEJd2CLT5i8hUZHqAVHR9zchd93ut6Rn5IOmCRY4WYCrzjPdeaZDMiEs9UBo8VJjcCWohqYACqpeQ4jZsOZj8@JBuSgDAFGCkgk5J@xPwrjkCPkMo@wy@IPFVphgEXAP3bHiYvzf3FxL3nxaS0UC6/GckXirxGDhCUGWCU3LT8Mj@9xsB@AyxAled5DzyRRoi6JeOIeisqGx1SJamDdzUMtYpg6INdduIT1kPPQcVIhoUefmak2hLx@U@EDkuZf5C82psYaBXIMWAOKjmi7pX29UWts@E41rg2KuRcUsZONo3rwWxQtTBkexkRHrTKKF61GrqyJl1pHzHjP2R8bTs0xxpwnuUI3/Ic006/STAPNtKKJrf37@@bB6bH8qf6xeXncvJTf43eQpg7oMnpdkz78uObQgjHrBcZjl@hdqKeJk4ja820sDJYbvIby4/W1rn2w7/qNnbjy3x7QzXM1tME8CHMU/tFGvydld1Iox2PWV1V1c6TNirk212CoapdxzOArCg8VbMlSDUN6l6i/Kk0xq70hTh4AnPwAfBazVyV6s7qBgCOHD@ceGdm9ghXYQ6sw6o6mhQf/SfTMwOJJNat/r2Zg2g7R3WolVgeUYMX2Yqe9QmXaZSP7/HbSK@Xq2@rO1pvqDrwy4DUDVlEDaTiAmuHb7N/bGV9koZ1wofigi4cdGiOMZTuL68fzC5nNxsMa5roNk5WNQwK@dni3ZXfk@s8b7XbaowUb0qt5nt4uSVmOZPUJXb/dx/CWGxPadmHAiI67La3UCXXDMSuasGMkiIQB0f3v/wM&quot; rel=&quot;nofollow noreferrer&quot;&gt;like this&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The problem is: code for the interpreter is long; so does the url. I have never been critized about that, but would I mind you if I keep submitting so?&lt;/p&gt;&#xA;" OwnerDisplayName="user100411" LastActivityDate="2021-03-24T09:29:31.107" Title="Would I mind you if I paste long TIO url for Pxem?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20914" PostTypeId="2" ParentId="20913" CreationDate="2021-03-24T09:29:31.107" Score="5" Body="&lt;p&gt;This isn't a problem at all, and others have done so before.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2021-03-24T09:29:31.107" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20915" PostTypeId="2" ParentId="2140" CreationDate="2021-03-24T13:23:45.640" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/221420&quot;&gt;Posted&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2021-03-26T15:24:39.767" LastActivityDate="2021-03-26T15:24:39.767" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="20917" PostTypeId="2" ParentId="2140" CreationDate="2021-03-24T21:05:47.620" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/221344/cadaddadadaddddaddddddr/221347#221347&quot;&gt;cadaddadadaddddaddddddr - linked list accessing&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="90614" LastEditorUserId="66833" LastEditDate="2021-03-28T14:01:25.607" LastActivityDate="2021-03-28T14:01:25.607" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="20918" PostTypeId="2" ParentId="2140" CreationDate="2021-03-25T06:10:20.177" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/221321/101710&quot;&gt;To count the sum of all Unicode characters of a given input under an interesting constraint&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="101710" LastEditorUserId="66833" LastEditDate="2021-03-30T21:38:05.200" LastActivityDate="2021-03-30T21:38:05.200" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="20920" PostTypeId="2" ParentId="2140" CreationDate="2021-03-25T12:44:41.763" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/222775/sr-4der-says-make-this-shape-episode-1&quot;&gt;Sr. 4Der says make this shape! (Episode 1)&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="99626" LastEditorUserId="66833" LastEditDate="2021-04-22T00:25:39.217" LastActivityDate="2021-04-22T00:25:39.217" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="20921" PostTypeId="2" ParentId="2140" CreationDate="2021-03-25T14:33:46.293" Score="0" Body="&lt;p&gt;Given a black-box function &lt;code&gt;f(x)&lt;/code&gt; which take a value &lt;code&gt;x&lt;/code&gt; and output &lt;code&gt;true&lt;/code&gt; for &lt;span class=&quot;math-container&quot;&gt;\$p(x)\$&lt;/span&gt;, an unknown continious monotone function(not knowing even whether it's increasing), probable; and &lt;code&gt;false&lt;/code&gt; otherwise. Output an infinite sequence &lt;span class=&quot;math-container&quot;&gt;\$a_n\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$\lim_{n\rightarrow \infty}p(a_n)=0.5\$&lt;/span&gt;. You can assume that the result exists.&lt;/p&gt;&#xA;&lt;p&gt;Reasonable I/O allowed. Shortest code win.&lt;/p&gt;&#xA;&lt;p&gt;A possible solution:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;for i=1..infty&#xA;    S = [i/2] * i*i*2&#xA;    for j=0..i*i*2-1&#xA;        for k=1..i&#xA;            if f(j/i-i)&#xA;                S[j]--&#xA;    print minPos([t*t for t in S])/i-i&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##XZDLDoIwEEX3fMVNXFgaH8DSyFe4JCwwLTooLSnFwNdjWzQSZ9FJ5uTcybSb7F2rbKa208bCVEroNhKyRs3G@BTBlZF2MOrDDktj8XmcSdV2Qo40SbBBr0EWQstebV3SoFBrI1/SRK6DQCHiJlm6C@In/eICCjpmJTgYceJZHOZean7SQhblix8rvEK@yB@QHhLeHGn/D8Paoilz/@zTwDpDysIbvfsIKdh67Q4POeXPqr2KCs3Ja9yNi6T06fP8Bg&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try It Online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2021-05-29T03:41:51.003" LastActivityDate="2021-05-29T03:41:51.003" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="20922" PostTypeId="2" ParentId="2140" CreationDate="2021-03-25T15:14:29.513" Score="3" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/222585/89930&quot;&gt;Un-pipe an Elixir expression&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="89930" LastEditorUserId="89930" LastEditDate="2021-03-30T14:43:42.637" LastActivityDate="2021-03-30T14:43:42.637" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="20923" PostTypeId="2" ParentId="20909" CreationDate="2021-03-25T16:37:45.420" Score="3" Body="&lt;p&gt;As this has gone unanswered for a couple of days, here are my thoughts on what to do with each of the 13 posts:&lt;/p&gt;&#xA;&lt;p&gt;As a number of them should clearly, in my view, be added to the FAQ, I won't bother &amp;quot;justifying&amp;quot; them, as I believe it's pretty self-explanatory why I think so:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/13944/how-does-this-site-work&quot;&gt;How does this site work?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/11924/new-users-guides-to-golfing-rules-in-specific-languages&quot;&gt;New users&amp;#39; guides to golfing rules in specific languages&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2035/how-long-should-i-wait-before-accepting-an-answer&quot;&gt;How long should I wait before accepting an answer?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4780/should-submissions-be-allowed-to-exit-with-an-error&quot;&gt;Should submissions be allowed to exit with an error?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet&quot;&gt;Default for Code Golf: Program, Function or Snippet?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Additionally, I think that the following should also be added to the FAQ for the reasons given with each:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10184/is-it-ok-to-promote-my-own-posts-in-chat&quot;&gt;Is it OK to promote my own posts in chat?&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is already &lt;a href=&quot;https://ppcg.github.io/chatiquette/&quot; rel=&quot;nofollow noreferrer&quot;&gt;part of the Chatiquette&lt;/a&gt;, but the meta post provides much more clarification and information than the single paragraph in the Chatiquette&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/777/are-two-questions-duplicates-if-they-have-different-scoring-rules&quot;&gt;Are two questions duplicates if they have different scoring rules?&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;A useful post for both those trying to decide whether to close as a dupe, and for those looking to see if their &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; version of a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is allowed or not. Having this is an easy to find place would be very beneficial&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10351/useful-external-resources&quot;&gt;Useful External Resources&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I think this could do with some updating, adding in some more recent resources, such as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18643/66833&quot;&gt;Adám's In-Browser Language Bar&lt;/a&gt; or &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19402/feed-filter-a-tnb-userscript&quot;&gt;Redwolf's various userscripts&lt;/a&gt;, but it's also a useful resource itself that could be helpful in the FAQ&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10225/general-rules-for-custom-languages-and-libraries&quot;&gt;General rules for custom languages and libraries&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;As this is essentially a &amp;quot;mini&amp;quot; FAQ of it's own about a specific topic (similar to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10145/how-to-count-bytes-faq&quot;&gt;How to count bytes FAQ&lt;/a&gt;), adding it to the overall FAQ makes a lot of sense to me&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I don't think the following posts should be added to the FAQ, as they are either too specific to merit it, or aren't &amp;quot;frequently asked&amp;quot; questions. Removing the &lt;a href=&quot;/questions/tagged/faq-proposed&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;faq-proposed&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq-proposed&lt;/a&gt; is best, in my view:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/17636/in-bash-can-i-use-non-coreutil-programs&quot;&gt;In bash, can I use non-coreutil programs&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12374/catalogue-of-catalogues&quot;&gt;Catalogue of Catalogues&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1561/how-do-we-deal-with-novel-emerging-recurring-challenge-types&quot;&gt;How do we deal with novel emerging/recurring challenge types?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;As &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12339/how-are-bytes-counted-in-assembly&quot;&gt;How are bytes counted in assembly?&lt;/a&gt; is already part of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10145/how-to-count-bytes-faq&quot;&gt;How to count bytes FAQ&lt;/a&gt;, I don't think it needs the &lt;a href=&quot;/questions/tagged/faq-proposed&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;faq-proposed&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq-proposed&lt;/a&gt; tag, or to be added to the &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-03-25T16:37:45.420" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="20924" PostTypeId="2" ParentId="2140" CreationDate="2021-03-25T23:38:23.427" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/222560/%ce%a3%c2%b2-%e2%9f%b2-%ce%a3-aka-round-trip-a-string-pair&quot;&gt;(Σ*)² ⟲ Σ* (aka Round-Trip a String Pair)&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43266" LastEditorUserId="43266" LastEditDate="2021-03-29T22:33:35.473" LastActivityDate="2021-03-29T22:33:35.473" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="20926" PostTypeId="2" ParentId="2140" CreationDate="2021-03-26T16:27:45.730" Score="4" Body="&lt;h1&gt;Hide a message in ASCII art and an image&lt;/h1&gt;&#xA;&lt;p&gt;(needs cooler title)&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/steganography&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;steganography&amp;#39;&quot; rel=&quot;tag&quot;&gt;steganography&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/223160/45613&quot;&gt;Cops&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/223158/45613&quot;&gt;Robbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2021-04-09T16:21:20.597" LastActivityDate="2021-04-09T16:21:20.597" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="20927" PostTypeId="2" ParentId="1061" CreationDate="2021-03-26T18:06:27.360" Score="9" Body="&lt;h1&gt;Bypassing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; by storing data in the file name&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1072&quot;&gt;Consensus says that it is perfectly fine to store data in the file name as long as that is added to the byte count&lt;/a&gt;. However, this doesn't seem entirely appropriate in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; questions, since it could bypass the restrictions.&lt;/p&gt;&#xA;&lt;p&gt;An example (which is what spurred me to write this) is &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/221221/3&quot;&gt;this answer&lt;/a&gt; which was disqualified by the challenge author because the filename followed the restrictions and not the file content. I don't think this is the right approach. That answer was written in &lt;a href=&quot;https://esolangs.org/wiki/Pxem&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pxem&lt;/a&gt;, a language where the program is often stored in the file name and the file itself is empty.&lt;/p&gt;&#xA;&lt;p&gt;I think the best solution here is not actually to ban storing data in the file name for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; challenges, which gives Pxem and some similar languages an inherent disadvantage, but instead to restrict submissions to one of:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;typical programs, where the filename doesn't matter, and the content adheres to the restrictions&lt;/li&gt;&#xA;&lt;li&gt;empty or functionally meaningless program content, but where the filename must adhere to the restrictions instead&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;There are still a few cases where this won't work (slashes and null bytes in Unix-like filesystems, and more on Windows), but I imagine we can just declare that as long as it works &lt;em&gt;in theory&lt;/em&gt; it's fine.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2021-03-26T18:06:27.360" CommentCount="0" CommunityOwnedDate="2021-03-26T18:06:27.360" ContentLicense="CC BY-SA 4.0" />
  <row Id="20928" PostTypeId="1" AcceptedAnswerId="22412" CreationDate="2021-03-26T18:50:38.547" Score="7" ViewCount="106" Body="&lt;p&gt;Upon reaching 10k reputation, users have access to the &lt;a href=&quot;https://codegolf.stackexchange.com/tools&quot;&gt;moderator tools&lt;/a&gt;, which contains information and stats on:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Deleted posts and votes to delete&lt;/li&gt;&#xA;&lt;li&gt;Closed posts and pending votes to close and reopen&lt;/li&gt;&#xA;&lt;li&gt;Migrated posts&lt;/li&gt;&#xA;&lt;li&gt;Protected posts&lt;/li&gt;&#xA;&lt;li&gt;New answers to old questions&lt;/li&gt;&#xA;&lt;li&gt;Suggested edits&lt;/li&gt;&#xA;&lt;li&gt;Low reputation feedback (what happens when users with less than 100 votes cast an upvote/downvote)&lt;/li&gt;&#xA;&lt;li&gt;The full review history of all users&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Additionally, at 25k, users gain access to the &lt;a href=&quot;https://codegolf.stackexchange.com/site-analytics&quot;&gt;site analytics&lt;/a&gt;. This contains less actionable information as the moderator tools, but is still &amp;quot;hidden&amp;quot; behind a reputation barrier&lt;/p&gt;&#xA;&lt;p&gt;From time to time, lower reputation users will ask (especially in chat) questions that can be answered with the moderation tools (&lt;a href=&quot;https://chat.stackexchange.com/transcript/message/57454982#57454982&quot;&gt;example&lt;/a&gt;), or higher rep users will notice something that they'd like to share with other users. However, clearly this information is not intended for all (only 49 users currently have access to the site analytics), due to the reputation requirement. Additionally, the &lt;a href=&quot;https://meta.stackexchange.com/questions/289209/which-data-from-the-moderator-analytics-can-i-share&quot;&gt;diamond moderator version&lt;/a&gt; (apparently) has a disclaimer warning mods not to share the data.&lt;/p&gt;&#xA;&lt;p&gt;So my question is, how much of the data shown by these high-rep tools can I and should I share?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-05-31T22:09:43.880" Title="How much information can 10k+ users share?" Tags="|discussion|support|moderation|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="21929" PostTypeId="2" ParentId="2140" CreationDate="2021-03-27T04:41:56.540" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/222477/66833&quot;&gt;I&amp;#39;m Jelly of Python (Cops)&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/222478/66833&quot;&gt;I&amp;#39;m Jelly of Python (Robbers)&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-03-28T00:00:27.080" LastActivityDate="2021-03-28T00:00:27.080" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21930" PostTypeId="2" ParentId="2140" CreationDate="2021-03-27T17:24:03.133" Score="3" Body="&lt;h2&gt;Limit of lists &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;You're given a never-ending sequences of lists, each of which appends some number of values to the end of the previous one. That is, each list is a prefix of the next.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;3&#xA;3,1,4&#xA;3,1,4,1&#xA;3,1,4,1&#xA;3,1,4,1&#xA;3,1,4,1,5,9,2,6&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;While some steps may leave the list unchanged, its length grows unboundedly, giving an infinite list in the limit. Your goal is to output this&#xA;infinite list.&lt;/p&gt;&#xA;&lt;p&gt;Note that you can't know a-priori how many lists you must read to get, say, the 5th value in the infinite list, just that you'll eventually hit a list with 5 or more elements.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input and output:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The list elements are digits 0-9. You may treat them as characters if you wish.&lt;/p&gt;&#xA;&lt;p&gt;The input and output are both infinite lists. These can be represented in various ways, and may be different for the input and output.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An infinite list or stream&lt;/li&gt;&#xA;&lt;li&gt;A stateful method or black-box function that produces a new value with each call&lt;/li&gt;&#xA;&lt;li&gt;Repeatedly reading from STDIN or writing to STDOUT, or file buffers or the like&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;A mapping from index to value isn't allowed for input or output. The output must be uniform, without chunks of digits grouped together.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;em&gt;Sandbox: Infinite list I/O is hard. Any suggestions?&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="20260" LastEditorUserId="20260" LastEditDate="2021-03-27T17:34:50.063" LastActivityDate="2021-03-27T17:34:50.063" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="21931" PostTypeId="1" CreationDate="2021-03-28T01:36:35.553" Score="13" ViewCount="156" Body="&lt;p&gt;My name is &lt;a href=&quot;https://codegolf.stackexchange.com/users/101104/oldsandboxposts&quot;&gt;OldSandboxPosts&lt;/a&gt; and I am a chatbot written by &lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/chartz-belatedly&quot;&gt;caird coinheringaahing&lt;/a&gt; and hosted by &lt;a href=&quot;https://codegolf.stackexchange.com/users/79857/redwolf-programs&quot;&gt;Redwolf Programs&lt;/a&gt;. My source code can be found &lt;a href=&quot;https://github.com/cairdcoinheringaahing/OldSandboxPosts-bot&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;. Every day, at 1:00am UTC time, I log onto Stack Exchange, find Sandbox proposals that have been inactive for a week and post a &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/57466323#57466323&quot;&gt;chat message&lt;/a&gt; linking to those posts. I &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=57091118#57091118&quot;&gt;arose&lt;/a&gt; as part of a discussion about increasing the number of people reviewing Sandbox proposals, and &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/57428610#57428610&quot;&gt;it's working&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Currently, I sit in my &lt;a href=&quot;https://chat.stackexchange.com/rooms/120733/old-sandbox-posts-testing&quot;&gt;testing room&lt;/a&gt; and post messages there. However, I'd like to be able to post messages into &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;, where more users are active and likely to see them. Unfortunately, we currently have a rule &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14815/66833&quot;&gt;banning chat bots from The Nineteenth Byte&lt;/a&gt;, as they can be disruptive and obtrusive.&lt;/p&gt;&#xA;&lt;p&gt;You can see from the &lt;a href=&quot;https://chat.stackexchange.com/transcript/120733&quot;&gt;transcript of my testing room&lt;/a&gt; that I only ever post 1 message a day (potentially 2 to circumvent the maximum message length if I find a lot of posts, or 0 if there are no week-old posts)&lt;span class=&quot;math-container&quot;&gt;\${}^*\$&lt;/span&gt; so I'm hardly disruptive, and I believe I'm a helpful resource to have available in the site's main chat room.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, I'd like to ask for permission to move into The Nineteenth Byte and post my daily messages there instead.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sup&gt;&lt;span class=&quot;math-container&quot;&gt;\${}^*\$&lt;/span&gt;I also post more when I'm being tested, but only in my testing room&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="101104" LastEditorUserId="68942" LastEditDate="2021-05-13T23:25:29.783" LastActivityDate="2021-05-13T23:25:29.783" Title="Introducing OldSandboxPosts" Tags="|discussion|feature-request|status-completed|chat|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="21932" PostTypeId="2" ParentId="21931" CreationDate="2021-03-28T02:45:13.780" Score="21" Body="&lt;h3&gt;I personally support this bot. Vote after reading to indicate if you agree.&lt;/h3&gt;&#xA;&lt;p&gt;The main reasons for disallowing bots that send messages:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;they're distracting / obnoxious&lt;/li&gt;&#xA;&lt;li&gt;they overtake important conversations with clutter&lt;/li&gt;&#xA;&lt;li&gt;all in all, basically high noise ratio&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The thing is, given that it's quite common for people to pop into TNB and ask for feedback on Sandbox posts anyway (or bring up older posts that need attention), and this is very much on-topic because arguably, discussing Sandbox is more on-topic for TNB than most of the actual conversations that go on in TNB, I don't think it's particularly noise for a bot that doesn't even onebox (making it less cluttering than Feeds, to be entirely fair to OSP).&lt;/p&gt;&#xA;&lt;p&gt;Also, OSP likely won't detract from conversations either. It's around one message of clutter, and it doesn't really spawn conversation, it just requests users to visit the sandbox posts and maybe contribute to the comments under that post, but doesn't create discussion in the chat itself, except if the challenge needs to be discussed, in which case it's on-topic anyway (and users likely would hold off on it until any important conversations have passed).&lt;/p&gt;&#xA;&lt;p&gt;All-in-all, while I do agree with the general rule banning bots, I think this bot would not fit any of the categories of clutter or noise that we try to eliminate, and we can essentially even just treat it as a user bringing attention occasionally to sandbox posts, much like many users already helpfully do themselves.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Again, upvote if you agree that this bot should be allowed in TNB, downvote if you disagree and think this bot should not be given an exception.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;(Also, if this bot is allowed, this is not an invitation to bring other bots in; you'll need to create a meta post if you would like to do so, since this would be a specific exception to the rule)&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-03-28T02:45:13.780" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21933" PostTypeId="2" ParentId="2140" CreationDate="2021-03-28T10:30:12.540" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/222676&quot;&gt;Posted&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2021-03-31T11:39:00.637" LastActivityDate="2021-03-31T11:39:00.637" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21934" PostTypeId="1" CreationDate="2021-03-28T14:41:05.363" Score="6" ViewCount="126" Body="&lt;p&gt;The styling of the footer on codegolf.meta.stackexchange.com is very low contrast and the text is hard to read, especially the list subtitles. I have selected some of the text &amp;quot;NETWORK&amp;quot;, which helps, but this still needs to be fixed.&lt;/p&gt;&#xA;&lt;p&gt;Here is a screenshot - or just scroll down a bit ;)&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/JaL4e.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/JaL4e.png&quot; alt=&quot;hard to read footer&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I'm using Firefox 88.0b3 on Linux.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="68942" LastEditDate="2021-09-20T16:42:18.207" LastActivityDate="2021-09-20T16:43:21.587" Title="Footer text is hard to read on meta" Tags="|bug|status-completed|meta|css|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="21935" PostTypeId="2" ParentId="21934" CreationDate="2021-03-28T16:36:10.527" Score="2" Body="&lt;p&gt;&lt;strong&gt;Edit&lt;/strong&gt;: this appears to no longer be an issue; the footer is now readable. If any other issues appear with the footer, please raise it as a separate &lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt;-report.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I can confirm, this is an issue for me as well. I will forward this to whatever channels I can to get it fixed as soon as possible (and I've added &lt;a href=&quot;/questions/tagged/status-review&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-review&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-review&lt;/a&gt; so hopefully this will be reviewed soon), but until it is fixed, I made a quick userscript that just sets the text color to &lt;code&gt;0xCCCCCC&lt;/code&gt; (it's a hacky solution but the worst it could end up doing is just set too many things to that text color).&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://gist.github.com/hyper-neutrino/189e3bc21d3b1eafacabe6c0874533bc&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://gist.github.com/hyper-neutrino/189e3bc21d3b1eafacabe6c0874533bc&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-09-20T16:43:21.587" LastActivityDate="2021-09-20T16:43:21.587" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21936" PostTypeId="1" CreationDate="2021-03-28T23:36:37.143" Score="3" ViewCount="29" Body="&lt;p&gt;If you go to &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;Code Golf SE main&lt;/a&gt;, the only post that is listed on &lt;strong&gt;Featured on Meta&lt;/strong&gt; is the one featured on Mother Meta. But &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/tagged/featured&quot;&gt;the site actually has two more &lt;code&gt;featured&lt;/code&gt; posts on its own meta&lt;/a&gt;. They were showing correctly in the said list before the brief maintenance today.&lt;/p&gt;&#xA;&lt;p&gt;&lt;s&gt;Tried to check if it has hit other sites too, but couldn't (I checked SO, Math, Puzzling, Code Review but none of them had site-specific &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/featured&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;featured&amp;#39;&quot; rel=&quot;tag&quot;&gt;featured&lt;/a&gt; posts at this moment).&lt;/s&gt; &lt;a href=&quot;https://workplace.stackexchange.com/questions&quot;&gt;Workspace&lt;/a&gt; and &lt;a href=&quot;https://literature.stackexchange.com/&quot;&gt;Literature&lt;/a&gt; are showing their own &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/featured&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;featured&amp;#39;&quot; rel=&quot;tag&quot;&gt;featured&lt;/a&gt; posts correctly, so I'm posting this to site-specific meta as well as &lt;a href=&quot;https://meta.stackexchange.com/q/362635/419414&quot;&gt;Mother Meta&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="68942" LastEditDate="2021-03-29T01:02:23.460" LastActivityDate="2021-03-29T01:02:23.460" Title="Featured on Meta is not showing [featured] meta articles" Tags="|bug|status-completed|" AnswerCount="0" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="21939" PostTypeId="2" ParentId="2140" CreationDate="2021-03-29T06:16:01.900" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/222652/check-b-powersmoothness&quot;&gt;Check B-powersmoothness - posted&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2021-03-31T06:21:56.447" LastActivityDate="2021-03-31T06:21:56.447" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="21941" PostTypeId="2" ParentId="5243" CreationDate="2021-03-29T19:38:57.137" Score="4" Body="&lt;h1&gt;1000 rep for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/94348/prime-counting-function/222468#222468&quot;&gt;&lt;span class=&quot;math-container&quot;&gt;\$\pi(n)\$&lt;/span&gt;&lt;/a&gt; in unary ECMAScript regex&lt;/h1&gt;&#xA;&lt;p&gt;This is something I've been thinking about ever since 2014, and I haven't been able to get anywhere with it. See my answer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/94348/prime-counting-function/222468#222468&quot;&gt;Prime counting function&lt;/a&gt; for an explanation as to why I suspect it is impossible.&lt;/p&gt;&#xA;&lt;p&gt;I will award 1000 rep (or 100-500 rep for &lt;strong&gt;(4)&lt;/strong&gt;) for one of the following things regarding the implementation of &lt;span class=&quot;math-container&quot;&gt;\$\pi(n)\$&lt;/span&gt; in a regex:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;An implementation of &lt;span class=&quot;math-container&quot;&gt;\$\pi(n)\$&lt;/span&gt; in one of the following regex flavors (see below), posted as an answer&lt;/li&gt;&#xA;&lt;li&gt;A convincing explanation of an algorithm that could be used (which I could then set about implementing in a regex).&lt;/li&gt;&#xA;&lt;li&gt;A proof that it is impossible in one of these flavors – the bounty will be awarded as soon as I can understand the proof, at least to some satisfying degree (which might involve some Q&amp;amp;A).&lt;/li&gt;&#xA;&lt;li&gt;100-500 rep for either &lt;strong&gt;(1)&lt;/strong&gt; or &lt;strong&gt;(2)&lt;/strong&gt; but using scratch space, where the amount of scratch space needed is less than &lt;span class=&quot;math-container&quot;&gt;\$O({n^2\over log(n)})\$&lt;/span&gt;, or equivalently less than &lt;span class=&quot;math-container&quot;&gt;\$O({n\pi(n)})\$&lt;/span&gt;, in its asymptotic growth. The scratch space will be provided as delimited unary, with your choice of delimiter character (i.e., the input to the regex will be &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; in unary followed by a delimiter followed by the scratch space in unary). The amount of bounty will depend on how much less than &lt;span class=&quot;math-container&quot;&gt;\$O({n\pi(n)})\$&lt;/span&gt; the required scratch space is, as well as the creativity/ingenuity of the solution. The regex should of course not be able to take its answer by measuring how much scratch space it's given – it should expect some random number will be added to the minimum required scratch for a given &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, and for any amount of supplied scratch space of the minimum or higher, should always give the same answer.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The regex flavors (with scalar unary input and output):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;ECMAScript (pre-2018)&lt;/li&gt;&#xA;&lt;li&gt;ECMAScript with &lt;code&gt;(?*)&lt;/code&gt; molecular lookahead / non-atomic lookahead, as supported by &lt;a href=&quot;https://github.com/Davidebyzero/RegexMathEngine&quot; rel=&quot;nofollow noreferrer&quot;&gt;RegexMathEngine&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;ECMAScript 2018, with &lt;code&gt;(?&amp;lt;=)&lt;/code&gt; / &lt;code&gt;(?&amp;lt;!)&lt;/code&gt; right-to-left evaluated variable-length lookbehind&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Post it as an answer to &lt;a href=&quot;https://codegolf.stackexchange.com/q/94348/17216&quot;&gt;Prime counting function&lt;/a&gt;, even though for &lt;strong&gt;(2)&lt;/strong&gt;, and &lt;strong&gt;(4)&lt;/strong&gt; it's technically not one, since this is my only way of awarding the bounty. In the case of &lt;strong&gt;(2)&lt;/strong&gt; or &lt;strong&gt;(4).(2)&lt;/strong&gt;, once I've constructed the regex, I'll either post it as my own answer (giving credit to you for the algorithm), or as an edit to your post, whichever you prefer (if the latter, then please specify).&lt;/p&gt;&#xA;&lt;p&gt;In the case of &lt;strong&gt;(3)&lt;/strong&gt;, I guess the best way to do this is that you post the proof as an answer &lt;a href=&quot;https://cs.stackexchange.com/questions/137112/what-can-be-proven-regarding-the-differences-in-power-between-unary-ecmascript-r&quot;&gt;to this CS.SE question&lt;/a&gt; or elsewhere, and tell me which post on CGCC you would like me to award the bounty to.&lt;/p&gt;&#xA;&lt;p&gt;(Only 500 rep can be awarded at a time, so the 1000 will be awarded in two back-to-back bounties. Or in the case of &lt;strong&gt;(3)&lt;/strong&gt;, to two different posts if you prefer.)&lt;/p&gt;&#xA;" OwnerUserId="17216" LastEditorUserId="17216" LastEditDate="2021-04-06T12:57:04.347" LastActivityDate="2021-04-06T12:57:04.347" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="21942" PostTypeId="1" AcceptedAnswerId="21945" CreationDate="2021-03-30T03:05:52.470" Score="9" ViewCount="106" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/tour&quot;&gt;Tour&lt;/a&gt; is a page shown to new users, intended as a quick introduction to the site. As part of this, there's an example question shown to the user:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/bOLXnm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/bOLXnm.png&quot; alt=&quot;Question (&amp;quot;Triangle Area Side Side Side&amp;quot;) with some information&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The current question, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/11020/triangle-area-side-side-side&quot;&gt;Triangle Area Side Side Side&lt;/a&gt;, is both closed and inconsistent with the expectations for a new challenge. It has a brief description, badly formatted test cases (and only two of them), and no details on things like allowed input/output methods.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Should we choose a new question?&lt;/strong&gt; Answers here should either be &amp;quot;no&amp;quot;, or a proposal for a specific question to replace it with.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="68942" LastEditDate="2021-06-09T05:54:13.613" LastActivityDate="2021-06-09T05:54:13.613" Title="Should we change the question on the Tour page?" Tags="|discussion|status-completed|new-users|help-center|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21943" PostTypeId="2" ParentId="21942" CreationDate="2021-03-30T05:22:33.677" Score="5" Body="&lt;h2&gt;Yes, to &lt;a href=&quot;https://codegolf.stackexchange.com/q/210071/78410&quot;&gt;The vanilla factorial challenge&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;When I was writing this challenge, I tried to make many of the implicit rules explicit, such as default I/O methods, standard loopholes, built-ins, time/memory limits, and &amp;quot;theoretically being correct is valid&amp;quot;. I think this list serves as a brief guideline for new plain code golf challenges. If others think it matters, I can add links to the relevant meta posts for each of them.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2021-03-30T05:22:33.677" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="21945" PostTypeId="2" ParentId="21942" CreationDate="2021-03-30T09:42:26.057" Score="9" Body="&lt;h2&gt;Yes, to &lt;a href=&quot;https://codegolf.stackexchange.com/q/85/66833&quot;&gt;Fibonacci function or sequence&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The challenge is short, so will fit into the cropped view from the tour page, but is still a well specified and clear challenge&lt;/li&gt;&#xA;&lt;li&gt;It's been consistently active for over 10 years. Looking at the &lt;a href=&quot;https://codegolf.stackexchange.com/posts/85/timeline&quot;&gt;timeline&lt;/a&gt;, there's been an answer posted at least once a month, every month since posting. This means we'll be demonstrating to new users that old posts are by no means forgotten, and that answering old posts is encouraged&lt;/li&gt;&#xA;&lt;li&gt;The top answers by votes, and therefore the two shown in the Tour, are Perl and brainfuck, which I think are great examples of what we do here. The Perl program shows to new users the extent to which we can twist &amp;quot;practical&amp;quot; languages to be incredibly short; the brainfuck program demonstrates a famous esoteric language to those who are less likely to be familiar with them&lt;/li&gt;&#xA;&lt;li&gt;It has an accepted answer. Even if we &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8363/66833&quot;&gt;discourage accepting answers&lt;/a&gt;, it's still a core functionality of the SE platform, and should be demonstrated in the Tour page&lt;/li&gt;&#xA;&lt;li&gt;The &amp;quot;test cases&amp;quot; are prominently featured, close to the top of the question, so won't be cropped out in the Tour&lt;/li&gt;&#xA;&lt;li&gt;It's a very famous beginner programming task, up there with Fizz Buzz and Hello, World!, so a lot of people are likely to see it and think &amp;quot;Oh, I know how to do that&amp;quot;, encouraging them to participate&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-03-30T09:42:26.057" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21946" PostTypeId="2" ParentId="2140" CreationDate="2021-03-30T17:19:11.920" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/222725/equalizing-fractions&quot;&gt;Equalizing fractions&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="92116" LastEditorUserId="66833" LastEditDate="2021-04-01T21:13:21.653" LastActivityDate="2021-04-01T21:13:21.653" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="21948" PostTypeId="2" ParentId="5243" CreationDate="2021-03-30T23:38:14.643" Score="7" Body="&lt;h1&gt;50-500 rep for answering in &lt;a href=&quot;https://gist.github.com/cairdcoinheringaahing/9cd9f4b5207593dc3bc8ef102eeb2cf3&quot; rel=&quot;nofollow noreferrer&quot;&gt;my languages&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;I've (currently) published 21 languages, all of which can be found &lt;a href=&quot;https://gist.github.com/cairdcoinheringaahing/9cd9f4b5207593dc3bc8ef102eeb2cf3&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; and 16 of which are on &lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I'm offering 50 rep to any answer that meets the following criteria:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is written in one of Add++, Adjust, Bitwise Fuckery, Deorst, NotQuiteThere, Orst, Rutger, Verbosity, Verbosity v2 or any version of Whispers&lt;/li&gt;&#xA;&lt;li&gt;It is the shortest answer in that language, at time of posting&lt;/li&gt;&#xA;&lt;li&gt;The challenge has fewer than 30 answers, not counting the to-be-bountied answer&lt;/li&gt;&#xA;&lt;li&gt;The challenge is tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, and is not tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;The challenge is older than a week&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I'm offering 100 rep to any answer that meets the following criteria:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is written in one of Commentator, Flipbit, Geo, Levels, No, Sample, Uno, Yggdrasil or &lt;code&gt;√ å ı ¥ ® Ï Ø ¿&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;It is the shortest answer in that language, at time of posting&lt;/li&gt;&#xA;&lt;li&gt;The challenge has fewer than 30 answers, not counting the to-be-bountied answer&lt;/li&gt;&#xA;&lt;li&gt;The challenge is tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, and is not tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;The challenge is older than a week&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Additionally, I will double the rep awarded for each of the following points met (to a maximum of 500 rep):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is the first valid answer to the challenge&lt;/li&gt;&#xA;&lt;li&gt;It is shorter than all other answers to the challenge (the challenge must have at least one existing answer)&lt;/li&gt;&#xA;&lt;li&gt;It uses a non-obvious&lt;span class=&quot;math-container&quot;&gt;\${}^*\$&lt;/span&gt; method that helps it save bytes over the obvious method&lt;/li&gt;&#xA;&lt;li&gt;It is an answer to one of &lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/chartz-belatedly?tab=questions&quot;&gt;my questions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;sup&gt;&lt;span class=&quot;math-container&quot;&gt;\${}^*\$&lt;/span&gt;I'll be the judge of what's &amp;quot;non-obvious&amp;quot;, but generally, it's a method that isn't the immediate, go-to method&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;Additionally, I will delay awarding bounties if they cause me to drop below 25000 reputation, until a point where I can award them.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Don't comment to claim bounties. Instead, edit in claims below&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Bounty list&lt;/h2&gt;&#xA;&lt;p&gt;&lt;sub&gt;Stolen shamelessly from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17363/66833&quot;&gt;Adám's APL bounties&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;p&gt;Awarded bounties are &lt;s&gt;struck-through&lt;/s&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Bounties in progress are &lt;strong&gt;bold&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Bounties on hold are &lt;em&gt;italic&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If you have previously requested a bounty, you add can add more requests after the struck-through ones, otherwise add yourself to the below list to request a bounty.&lt;/p&gt;&#xA;&lt;p&gt;The format is:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;- [username](url-to-profile): [rep](url-to-answer-post), [rep](url-to-answer-post)&lt;/code&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt;: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/232975/78850&quot;&gt;100&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Razetime: &lt;s&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/233072/80214&quot;&gt;200&lt;/a&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Fmbalbuena: &lt;a href=&quot;https://codegolf.stackexchange.com/a/240880/106959&quot;&gt;50&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="106959" LastEditDate="2022-01-13T12:10:42.490" LastActivityDate="2022-01-13T12:10:42.490" CommentCount="6" CommunityOwnedDate="2021-03-30T23:38:14.643" ContentLicense="CC BY-SA 4.0" />
  <row Id="21949" PostTypeId="2" ParentId="2140" CreationDate="2021-03-31T01:06:00.820" Score="2" Body="&lt;h1&gt;Unique languages&lt;/h1&gt;&#xA;&lt;p&gt;As we &lt;a href=&quot;https://codegolf.stackexchange.com/questions/222632/whats-my-tio-uniqueness&quot;&gt;found out&lt;/a&gt; before, each of the 680 languages on Try it online! has a &amp;quot;TIO uniqueness&amp;quot;, defined as the length of the shortest substring that appeared in the language's name and no others'.&lt;/p&gt;&#xA;&lt;p&gt;This time, we're going to make it more general. Given a list of strings &lt;code&gt;S&lt;/code&gt; and a target &lt;code&gt;T&lt;/code&gt;, output the length of the shortest substring of &lt;code&gt;T&lt;/code&gt; that is not in any other element of &lt;code&gt;S&lt;/code&gt;.  You may choose whether &lt;code&gt;T&lt;/code&gt; is part of &lt;code&gt;S&lt;/code&gt; or not. The elements of &lt;code&gt;S&lt;/code&gt; will always be unique. All elements of &lt;code&gt;S&lt;/code&gt;, and &lt;code&gt;T&lt;/code&gt;, will only contain lowercase letters (&lt;code&gt;abcdefghijklmnopqrstuvwxyz&lt;/code&gt;). You may also take input as uppercase if you wish.&lt;/p&gt;&#xA;&lt;p&gt;Your score will be calculated as &lt;code&gt;code length × TIO uniqueness&lt;/code&gt;, where &lt;code&gt;code length&lt;/code&gt; is measured in bytes and &lt;code&gt;TIO uniqueness&lt;/code&gt; is the TIO uniqueness as specified &lt;a href=&quot;https://codegolf.stackexchange.com/q/222632/66833&quot;&gt;here&lt;/a&gt;. If a language has an undefined TIO uniqueness, it cannot compete in this challenge.&lt;/p&gt;&#xA;&lt;p&gt;The answer with the lowest score wins.&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Thoughts on the scoring?&lt;/li&gt;&#xA;&lt;li&gt;Tags are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/subsequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;subsequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;subsequence&lt;/a&gt;. Suggestions?&lt;/li&gt;&#xA;&lt;li&gt;Any further feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-03-31T01:06:00.820" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="21951" PostTypeId="2" ParentId="2140" CreationDate="2021-03-31T04:34:31.477" Score="1" Body="&lt;h1&gt;Sum of two squares&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given an integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, determine whether &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; can be expressed as the sum of two square numbers, that is &lt;span class=&quot;math-container&quot;&gt;\$\exists a,b\in\mathbb Z|n=a^2+b^2\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;   0 -&amp;gt; truthy&#xA;   1 -&amp;gt; truthy&#xA;   2 -&amp;gt; truthy&#xA;   3 -&amp;gt; falsy&#xA;   4 -&amp;gt; truthy&#xA;   5 -&amp;gt; truthy&#xA;   6 -&amp;gt; falsy&#xA;   7 -&amp;gt; falsy&#xA;  11 -&amp;gt; falsy&#xA;9997 -&amp;gt; truthy&#xA;9999 -&amp;gt; falsy&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Relevant OEIS sequences:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://oeis.org/A001481&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Truthy&quot;&gt;A001481&lt;/a&gt; - should return truthy&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://oeis.org/A022544&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Falsy&quot;&gt;A022544&lt;/a&gt; - should return falsy&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer as measured in bytes wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/64812/count-sums-of-two-squares&quot; title=&quot;Count sums of two squares&quot;&gt;Related&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/28169/four-squares-together&quot; title=&quot;Four Squares Together&quot;&gt;related&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="78186" LastActivityDate="2021-03-31T04:34:31.477" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="21952" PostTypeId="2" ParentId="2140" CreationDate="2021-03-31T23:26:12.677" Score="0" Body="&lt;h1&gt;Count What You See &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;You may have heard of the &lt;a href=&quot;https://en.wikipedia.org/wiki/Look-and-say_sequence&quot; rel=&quot;nofollow noreferrer&quot;&gt;Look-and-say sequence&lt;/a&gt;, which is generated by reading off the digits of previous entries in the sequence. Here, you will be tasked to generate the &amp;quot;Count-and-say sequence&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;In general, the sequence can be generated as follows:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Start with an arbitrary sequence of numbers (e.g. &lt;code&gt;1, 1, 1, 3, 2, 1, 2&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Count the occurrences of each number as &lt;code&gt;adjective noun&lt;/code&gt; pairs -&amp;gt; &lt;code&gt;&amp;quot;four 1, one 3, two 2&amp;quot;&lt;/code&gt;, in order of &lt;em&gt;1st appearance&lt;/em&gt;. In the example, this means that you must first count &lt;code&gt;1s&lt;/code&gt;, then &lt;code&gt;3s&lt;/code&gt;, then &lt;code&gt;2s&lt;/code&gt;, since that is the order in which the numbers first appear in the sequence.&lt;/li&gt;&#xA;&lt;li&gt;Write out the result from step 2 numerically (&lt;code&gt;&amp;quot;four 1, one 3, two 2&amp;quot; -&amp;gt; 4, 1, 1, 3, 2, 2&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Append the result from step 3 to the original sequence to get &lt;code&gt;1, 1, 1, 3, 2, 1, 2, 4, 1, 1, 3, 2, 2&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Repeat the steps above to continue the sequence.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Your task is to output the &amp;quot;Count-and-say sequence&amp;quot;, such that the sequence starts with &lt;code&gt;1&lt;/code&gt;.  You may choose to:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take an input &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; and output the first &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; integers.&lt;/li&gt;&#xA;&lt;li&gt;Take an input &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; and output the &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt;-th integer.&lt;/li&gt;&#xA;&lt;li&gt;Output the sequence indefinitely.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For convenience, here are the first 100 numbers in the sequence (also &lt;a href=&quot;https://oeis.org/A217780&quot; rel=&quot;nofollow noreferrer&quot;&gt;A217780&lt;/a&gt;):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1, 1, 1, 3, 1, 4, 1, 1, 3, 6, 1, 2, 3, 1, 4, 8, 1, 3, 3, 2, 4, 1, 6, 1, 2, 11, 1, 5, 3, 3, 4, 2, 6, 3, 2, 1, 8, 13, 1, 8, 3, 4, 4, 3, 6, 5, 2, 2, 8, 1, 11, 1, 5, 16, 1, 10, 3, 6, 4, 4, 6, 7, 2, 4, 8, 2, 11, 3, 5, 1, 13, 18, 1, 12, 3, 9, 4, 6, 6, 9, 2, 5, 8, 3, 11, 4, 5, 2, 13, 1, 16, 1, 10, 1, 7, 22, 1, 14, 3, 11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="88546" LastActivityDate="2021-03-31T23:26:12.677" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21953" PostTypeId="1" CreationDate="2021-04-01T05:12:36.043" Score="1" ViewCount="51" Body="&lt;p&gt;When &lt;a href=&quot;https://codegolf.stackexchange.com/questions/219301/n-dimensional-pyramid-numbers&quot;&gt;one of my questions&lt;/a&gt; got closed as a duplicate (correctly), I got this screen.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/U0epY.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/U0epY.png&quot; alt=&quot;duplicate&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Then, when I clicked the delete button, this showed up:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/D3TrB.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/D3TrB.png&quot; alt=&quot;confirm&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Then when I confirmed, I got this:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/96vQk.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/96vQk.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;What's the point of showing the delete button if I'm not allowed to use it? It's redundant and annoying - is this intentional in some bizarre way, or is it a bug? Whichever, can we please fix it by not showing the delete button?&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="68942" LastEditDate="2021-04-03T20:22:15.660" LastActivityDate="2021-04-03T20:22:15.660" Title="Fix impossible deletion" Tags="|feature-request|bug|status-bydesign|" AnswerCount="0" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="21954" PostTypeId="2" ParentId="2140" CreationDate="2021-04-01T16:10:46.513" Score="1" Body="&lt;h1&gt;Irreducible Rube Goldberg Sort (WIP)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot;&gt;sorting&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;You are given a list containing at least 10 integers. You must sort them in the most complicated and roundabout way possible.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to write &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; programs (or functions) which, when combined in a specific constant sequence (specifically, feeding the output of the current step into the input of the next step), result in a sorted version of the original list. This sequence of programs should be set up in such a way that the system will not work if any subset of steps is removed. (for example, compressing and decompressing the stream, roundabout encryption that cancels itself out, etc...)&lt;/p&gt;&#xA;&lt;p&gt;Your score is &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;. Highest score wins.&lt;/p&gt;&#xA;&lt;h2&gt;Rules, Clarifications, and Notes&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard rules and loopholes apply&lt;/li&gt;&#xA;&lt;li&gt;Any method of I/O is fair game. It does not need to be consistent across all programs/functions.&lt;/li&gt;&#xA;&lt;li&gt;You may use any number of programming languages to solve the problem.&lt;/li&gt;&#xA;&lt;li&gt;It should not take an unreasonably long time to sort a list of up to 1000 elements using your system of programs. It should be reasonable to run it from start to finish during a lunch break (30 minutes)&lt;/li&gt;&#xA;&lt;li&gt;Lists can contain any integer from -999,999,999 to 999,999,999, inclusive, and may contain indistinguishable duplicates.&lt;/li&gt;&#xA;&lt;li&gt;Your system of programs should work for lists of any size if given enough time and space.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="45613" LastActivityDate="2021-04-01T16:10:46.513" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="21955" PostTypeId="1" AcceptedAnswerId="21956" CreationDate="2021-04-01T17:19:25.590" Score="17" ViewCount="651" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19271/16766&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout April 2021, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Vim&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;What's a Language of the Month?&lt;/p&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/16766&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during April, those who wish to participate should learn (at least the basics of) Vim, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about Vim&lt;/h2&gt;&#xA;&lt;p&gt;&lt;sup&gt;Taken from the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/19280/66833&quot;&gt;nomination post&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;Vim is a text editor that is meant to be an improvement over vi.&lt;/p&gt;&#xA;&lt;p&gt;It's very concise - usual operations only take one or two ASCII bytes.&lt;/p&gt;&#xA;&lt;p&gt;It's really good for string manipulation challenges (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; is our second most popular tags), so you are going to find chances to use it very often.&lt;/p&gt;&#xA;&lt;h3&gt;Resources&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#v&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt;. Vim is backwards-compatible with V, so (almost) all Vim programs should work in V&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.vim.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Vim.org&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.vim.org/docs.php&quot; rel=&quot;nofollow noreferrer&quot;&gt;Documentation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.vim.org/download.php&quot; rel=&quot;nofollow noreferrer&quot;&gt;Download&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/71030/tips-for-golfing-in-vim&quot;&gt;Tips for golfing in vim&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="68942" LastEditDate="2021-05-01T01:10:37.953" LastActivityDate="2021-05-01T01:10:37.953" Title="Language of the Month for April 2021: Vim" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="4" CommunityOwnedDate="2021-04-01T17:37:37.650" ContentLicense="CC BY-SA 4.0" />
  <row Id="21956" PostTypeId="2" ParentId="21955" CreationDate="2021-04-01T17:19:25.590" Score="5" Body="&lt;h1&gt;List of all Vim solutions posted in April 2021&lt;/h1&gt;&#xA;&lt;p&gt;(First time posters highlighted in bold)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/222989/62393&quot;&gt;Is it a pangram?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/62393&quot;&gt;Leo&lt;/a&gt;&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223071/62393&quot;&gt;Follow a linked list&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/62393&quot;&gt;Leo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;b&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223088/80214&quot;&gt;Reverse stdin and place on stdout&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/b&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223090/80214&quot;&gt;Multiplicative persistence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223102/31716&quot;&gt;Multiplicative persistence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31716/james&quot;&gt;James&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223116/95792&quot;&gt;Backhanded^H^H^H^H^H^Hspaces&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792&quot;&gt;Original Original Original VI&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223118/62393&quot;&gt;Backhanded^H^H^H^H^H^Hspaces&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/62393&quot;&gt;Leo&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223119/80214&quot;&gt;Backhanded^H^H^H^H^H^Hspaces&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223127/80214&quot;&gt;Write out the Thue-Morse sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223122/80214&quot;&gt;Longest Common Prefix of 2 Strings&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/219576/print-0-to-100-without-1-9-characters/223143#223143&quot;&gt;Print 0 to 100 without 1-9 characters&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223115/62346&quot;&gt;Overwrite a string on a tape&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/62346/nmjcman101&quot;&gt;nmjcman101&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223182/62393&quot;&gt;Print 0 to 100 without 1-9 characters&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/62393&quot;&gt;Leo&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223196/80214&quot;&gt;Fibonacci function or sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223205/80214&quot;&gt;It's Hip to be Square&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223235/44809&quot;&gt;Range, Reverse, Sum!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/44809&quot;&gt;Ray&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223237/44809&quot;&gt;Backwards Alphabet Triangle&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/44809&quot;&gt;Ray&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223249/62393&quot;&gt;Range, Reverse, Sum!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/62393&quot;&gt;Leo&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223278/44809&quot;&gt;Print a 10 by 10 grid of asterisks&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/44809&quot;&gt;Ray&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223272/80214&quot;&gt;How long is my number?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223294/80214&quot;&gt;Row, Column, Diagonal, Block&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223329/80214&quot;&gt;Codegolf Rainbow : Draw in Black-and-White&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223411/44809&quot;&gt;Print last inputted byte&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/44809&quot;&gt;Ray&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223428/44809&quot;&gt;Average of your code&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/44809&quot;&gt;Ray&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223436/44809&quot;&gt;Display a clock face&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/44809&quot;&gt;Ray&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223388/80214&quot;&gt;Equalize the array&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223438/80214&quot;&gt;Divide a string&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223415/101522&quot;&gt;Average of your code&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223490/101522&quot;&gt;Print the SARS-Cov-2 (COVID-19) genome&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223473/80214&quot;&gt;Write a microwave timer!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223624/80214&quot;&gt;Output a Latin Square&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223640/80214&quot;&gt;Solve a Diagonal Burrows-Wheeler transform&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223664/80214&quot;&gt;Implement a Truth-Machine&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223704/101474&quot;&gt;“DDoouubbllee ssppeeaakk!!”&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/101474/kops&quot;&gt;kops&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223729/101474&quot;&gt;Let's decrease the monotony&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/101474/kops&quot;&gt;kops&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223851/101522&quot;&gt;!I!n!s!e!r!t! !n!b!e!t!w!e!e!n!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223869/101522&quot;&gt;Interpret brainf***&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223930/101474&quot;&gt;Is it better to walk or run in the rain?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/101474/kops&quot;&gt;kops&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223954/101522&quot;&gt;Close neighbours stick together&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223960/101522&quot;&gt;Find the Factorial!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223700/80214&quot;&gt;Start from ones&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223812/80214&quot;&gt;Reversencode the given string&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224028/80214&quot;&gt;Are All the Items the Same?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224039/101474&quot;&gt;Are All the Items the Same?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/101474/kops&quot;&gt;kops&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224045/101474&quot;&gt;Did I die or not?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/101474/kops&quot;&gt;kops&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224297/16766&quot;&gt;Help me compress this song&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224202/80214&quot;&gt;Implement ΔList&lt;/a&gt; by  &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224507/80050&quot;&gt;Create output twice the length of the code&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/80050&quot;&gt;a stone arachnid&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224521/16766&quot;&gt;ASCII Hangman in Progress&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224519/80214&quot;&gt;Best Rolling Ao5&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224547/101522&quot;&gt;Write a &amp;quot;Hello&amp;quot; interpreter&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224556/16766&quot;&gt;Halloween Golf: The 2spooky4me Challenge!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224722/16766&quot;&gt;This challenge uses the '+' character&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224378/80214&quot;&gt;Implement Minceraft&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224749/80214&quot;&gt;Print All Integers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/221285/95792) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr&gt;&#xA;&lt;h1&gt;List of all Vim tips posted in April 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223433/101474&quot;&gt;Rotate your loops&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/101474/kops&quot;&gt;kops&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;tip title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;List of Vim-related challenges posted in April 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/q/&amp;lt;question-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="80214" LastEditDate="2021-04-30T06:21:13.147" LastActivityDate="2021-04-30T06:21:13.147" CommentCount="0" CommunityOwnedDate="2021-04-01T17:19:25.590" ContentLicense="CC BY-SA 4.0" />
  <row Id="21957" PostTypeId="2" ParentId="2140" CreationDate="2021-04-01T19:21:18.393" Score="6" Body="&lt;h1&gt;To raise &lt;span class=&quot;math-container&quot;&gt;\$ e \$&lt;/span&gt; to the power of a matrix &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/230784&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Any other feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2021-06-30T15:26:59.983" LastActivityDate="2021-06-30T15:26:59.983" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="21958" PostTypeId="2" ParentId="2140" CreationDate="2021-04-01T23:06:45.980" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/222839/dominate-a-zero-sum-game&quot;&gt;Dominate a zero-sum game&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-03T19:21:13.080" LastActivityDate="2021-04-03T19:21:13.080" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21959" PostTypeId="2" ParentId="2140" CreationDate="2021-04-02T00:16:37.313" Score="-1" Body="&lt;h1&gt;Poly-functional Polyglots&lt;/h1&gt;&#xA;&lt;p&gt;I don't have a ton of time to work on this, so I decided to remove it temporarily while I rework the scoring.&lt;/p&gt;&#xA;" OwnerUserId="101522" LastEditorUserId="101522" LastEditDate="2021-04-08T19:26:21.083" LastActivityDate="2021-04-08T19:26:21.083" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="21960" PostTypeId="2" ParentId="2140" CreationDate="2021-04-02T08:01:50.923" Score="0" Body="&lt;h1&gt;Node one-liner to fetch a URL, like curl&lt;/h1&gt;&#xA;&lt;p&gt;I'm interested in the shortest one-liner to output the contents at a given URL, using Node.js from the command line, for practical purposes. In other words, the equivalent of &lt;code&gt;curl&lt;/code&gt;, written as a Node one-liner.&lt;/p&gt;&#xA;&lt;p&gt;Not interested in other languages. Would this respect the site's rules, or does it belong on SO?&lt;/p&gt;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The URL is passed via the command line, so accessed via &lt;code&gt;process.argv[1]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Must invoke node with the &lt;code&gt;-e&lt;/code&gt; argument, followed by the code, followed by the URL&lt;/li&gt;&#xA;&lt;li&gt;Only the length of the actual script passed to node via &lt;code&gt;-e &amp;quot;...&amp;quot;&lt;/code&gt; is counted.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;My best solution so far, with &lt;code&gt;http://x.com&lt;/code&gt; as a conveniently short example, is:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-sh prettyprint-override&quot;&gt;&lt;code&gt;node -r got -e &amp;quot;require('got')(process.argv[1]).then(r=&amp;gt;console.log(r.body))&amp;quot; http://x.com&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="17187" LastActivityDate="2021-04-02T08:01:50.923" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="21961" PostTypeId="2" ParentId="8047" CreationDate="2021-04-02T15:06:52.867" Score="16" Body="&lt;h1&gt;Using the sandbox to &amp;quot;defend&amp;quot; your challenge&lt;/h1&gt;&#xA;&lt;p&gt;The sandbox is meant to be an aid to improve the challenge. But once posted to the main site, the quality of the challenge is entirely the poster's responsibility. Regardless of the sandbox, the challenge on the main site should be solid and well specified.&lt;/p&gt;&#xA;&lt;p&gt;If you post to the main site and the challenge is found to have some flaw, having posted it in the sandbox first does not entitle you to anything. The fact is that the challenge has a flaw, and it should be corrected if possible, or else expect downvotes or close-votes. It's pointless to try to &amp;quot;defend&amp;quot; the challenge on the grounds that it spent several days in the sandbox and no one complained.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;So why does it sometimes happen that people find the flaw on the main site and not in the sandbox? I see two main reasons:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Fewer people see the challenge in the sandbox than on the main site;&lt;/li&gt;&#xA;&lt;li&gt;People who do see the challenge in the sandbox typically &lt;em&gt;read&lt;/em&gt; it trying to find potential problems, but on the main site people try to &lt;em&gt;solve&lt;/em&gt; it, which brings out problems more easily.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Possible solutions include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Try to call more attention to the challenge while in the sandbox, for example in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; chatroom.&lt;/li&gt;&#xA;&lt;li&gt;Ask someone to try to solve the challenge before posting.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13040/36398&quot;&gt;&lt;em&gt;Assuming you've addressed sandbox feedback&lt;/em&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2023-03-01T10:29:36.817" LastActivityDate="2023-03-01T10:29:36.817" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21962" PostTypeId="2" ParentId="2140" CreationDate="2021-04-02T15:12:30.750" Score="-1" Body="&lt;p&gt;Given a program as input. If the program ever output a '1', output a truthy value and halt; if it halts without ever outputting a '1', output a falsy value and halt; if it falls into infinite loop without outputting a '1', fall into infinite loop.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2021-04-02T15:12:30.750" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="21963" PostTypeId="2" ParentId="2140" CreationDate="2021-04-03T07:43:31.737" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/223701/&quot;&gt;Shrinking Triangles&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2021-04-17T05:29:07.197" LastActivityDate="2021-04-17T05:29:07.197" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21964" PostTypeId="2" ParentId="2140" CreationDate="2021-04-03T12:26:06.677" Score="0" Body="&lt;p&gt;&lt;strong&gt;Program&lt;/strong&gt;-Write a program to display repeating terms of a given sentence.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Explanation&lt;/strong&gt;-the program must output the repeating terms of two or more letters from the given input(input is a sentence seperated be spaces without any punctuation except the full-stop indicating the end.) For example, if input is the sentence &amp;quot;I &lt;strong&gt;am&lt;/strong&gt; &lt;strong&gt;an&lt;/strong&gt; &lt;strong&gt;am&lt;/strong&gt;eture &lt;strong&gt;ma&lt;/strong&gt;the&lt;strong&gt;ma&lt;/strong&gt;gici&lt;strong&gt;an&lt;/strong&gt;&amp;quot; the outupt must be am, ma, an. ( not that em is not a valid output as it is separated by space)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example-&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;input-&amp;gt;International competitions are better than intercollege ones.&lt;/p&gt;&#xA;&lt;p&gt;output-&amp;gt; Inter, ti, er, tion, io,on,ion, tio, co, on,.......etc&#xA;(t, l must not be included as they are 1 letter.) (Upper lower Cases do not matter)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test cases-&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;input-&amp;gt; aabcde cdec&lt;/p&gt;&#xA;&lt;p&gt;output-&amp;gt; cde, cd, de&lt;/p&gt;&#xA;&lt;p&gt;input-&amp;gt; aab aacab&lt;/p&gt;&#xA;&lt;p&gt;output-&amp;gt; aa, ab&lt;/p&gt;&#xA;&lt;p&gt;input-&amp;gt; aaa aabcaaa ababa&lt;/p&gt;&#xA;&lt;p&gt;output-&amp;gt; aaa, aa, ab, aba, ba&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Winning Criterion&lt;/strong&gt;:- code golf&lt;/p&gt;&#xA;" OwnerUserId="101710" LastEditorUserId="101710" LastEditDate="2021-04-04T02:11:18.147" LastActivityDate="2021-04-04T02:11:18.147" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="21965" PostTypeId="2" ParentId="2140" CreationDate="2021-04-03T14:37:23.000" Score="0" Body="&lt;h1&gt;Getting to the root of the problem&lt;/h1&gt;&#xA;&lt;p&gt;While I was sleeping in my bed, unwilling to wake up, an idea entered my head: why is the syntax for powers, especially roots, so cumbersome? It would save so many bytes if we could just use the square root symbol instead, and easier to understand too. So, your challenge is to encode this in whatever format you choose, in as few bytes possible.&lt;/p&gt;&#xA;&lt;p&gt;Answers should be able to:&lt;/p&gt;&#xA;&lt;p&gt;a) convert a string such as &lt;code&gt;2**(1/2)&lt;/code&gt; into &lt;code&gt;√2&lt;/code&gt; or some other format that distinguishes it from &lt;code&gt;2√2&lt;/code&gt; (note, if you choose to write &lt;code&gt;2√2&lt;/code&gt; as &lt;code&gt;2 * √2&lt;/code&gt; and write things like &lt;code&gt;2**(1/3)&lt;/code&gt; as &lt;code&gt;3√2&lt;/code&gt;, that is allowed).&lt;/p&gt;&#xA;&lt;p&gt;b) Work for arbitrary powers (&lt;code&gt;2**(1/50)&lt;/code&gt; should work fine).&lt;/p&gt;&#xA;&lt;p&gt;c) Simplify roots. (&lt;code&gt;4**(1/4)&lt;/code&gt; = &lt;code&gt;√2&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;p&gt;and should be able to perform this on inputted strings.&lt;/p&gt;&#xA;&lt;p&gt;Deduct 10% from your score if you can handle addition of roots, deduct a further 10% off that if you can handle the ret of the basic operators (-, *, /), another 10% if you can simplify expressions such as &lt;code&gt;(2 - √2)/(2 + √2)&lt;/code&gt;, another 10% if you can write &lt;code&gt;16**1/4&lt;/code&gt; (for example) as &lt;code&gt;√(2^2)&lt;/code&gt;, and, if you're amazing enough to implement exponentiation, you can subtract 50%.&lt;/p&gt;&#xA;&lt;p&gt;Input will be presented in the form of &lt;code&gt;[0-9]**([0-9]/[0-9])&lt;/code&gt;, where the 0-9s can be any number of digits.&#xA;Output should ideally be in the form of &lt;code&gt;[0-9] * [0-9]√[0-9]&lt;/code&gt;, again, with the 0-9s being any number of digits, but I will let other forms slide so long as as &lt;code&gt;3√2&lt;/code&gt; (that's the cube root of 2) is distinguishable from &lt;code&gt;3 * √2&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Lowest score wins.&#xA;Good luck!&lt;/p&gt;&#xA;" OwnerUserId="100887" LastEditorUserId="100887" LastEditDate="2021-04-04T10:08:40.210" LastActivityDate="2021-04-04T10:08:40.210" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="21966" PostTypeId="2" ParentId="2140" CreationDate="2021-04-03T20:31:05.550" Score="1" Body="&lt;p&gt;Write a rectangular code that takes a rectangular input and output it. If the code is repeated horizonally and vertically for times, output the input rectangular repeated for same amount of times.&lt;/p&gt;&#xA;&lt;p&gt;Take an example, if your submission is&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;CODE&#xA;HERE&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;, then program&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;CODECODECODECODE&#xA;HEREHEREHEREHERE&#xA;CODECODECODECODE&#xA;HEREHEREHEREHERE&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;inputting&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;01&#xA;23&#xA;45&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;should output&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;01010101&#xA;23232323&#xA;45454545&#xA;01010101&#xA;23232323&#xA;45454545&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2021-04-03T20:31:05.550" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="21967" PostTypeId="2" ParentId="2140" CreationDate="2021-04-04T01:11:44.097" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/222882/quoted-rational-numbers&quot;&gt;Quoted rational numbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-05T00:09:09.343" LastActivityDate="2021-04-05T00:09:09.343" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21968" PostTypeId="2" ParentId="2140" CreationDate="2021-04-04T14:17:03.433" Score="2" Body="&lt;h1&gt;Battery charging tracker&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;If there are any better titles please post them in the comments&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;em&gt;If any more tags might be appropriate, please post them in the comments&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;The task here is to create a program which can output a battery's percentage at all times. It will be given input in the form of an array of &amp;quot;indications&amp;quot;. These dictate when to plug and unplug the charger.&lt;/p&gt;&#xA;&lt;p&gt;If this sounds confusing, let us take this sample input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[12, 23, 34], [15, 28, 67]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Note: you can take input in the form of a list of strings or a single string if you would like.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;The first array indicates the number of seconds to wait before unplugging the charger, and the second one indicates the number of seconds to wait before plugging in the charger. There will never be two coinciding values in one of the arrays or between the arrays. So &lt;code&gt;[[11, 22, 33], [15, 22, 34]]&lt;/code&gt; is not valid input and neither is &lt;code&gt;[[1, 2, 3, 3, 6], [15]]&lt;/code&gt;. Both arrays are guaranteed to have at least one value in them. Also, all values are positive non-zero integers.&lt;/p&gt;&#xA;&lt;p&gt;The &amp;quot;battery&amp;quot; we are trying to simulate starts with 0%. When your program runs, the charger is automatically &amp;quot;plugged in&amp;quot;, and each second the charge should tick up by 1% if the charger is plugged in, and decrease by 1% if it is not.&lt;/p&gt;&#xA;&lt;p&gt;Each second, the program should output the amount of charge the battery has. It should not charge beyond 100% and should not go down below 0%; if the battery hits 100% then it will stay there until the charger is unplugged and if it hits 0% it will stay there until the charger is plugged in.&lt;/p&gt;&#xA;&lt;p&gt;In addition, your program should store a &amp;quot;second counter&amp;quot; containing information on how long the program has been running for. When this counter hits any of the integers in either of the input arrays, the charger will be either unplugged or plugged in depending on which array it was in. It is guaranteed that between two &amp;quot;unplug&amp;quot; events there will be at least one &amp;quot;plug&amp;quot; event and vice versa, and it is also guaranteed that the first event is &amp;quot;unplug&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;Whenever the charger is unplugged or plugged, a &amp;quot;U&amp;quot; or &amp;quot;P&amp;quot; should be shown, respectively.&lt;/p&gt;&#xA;&lt;p&gt;In the case of our sample input, the charger is &amp;quot;unplugged&amp;quot; when the counter reaches twelve, 23 or 34 seconds and is &amp;quot;plugged&amp;quot; when the counter reaches fifteen, 28 or 67 seconds.&lt;/p&gt;&#xA;&lt;p&gt;What, then, is the output of our example?&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;2&#xA;3&#xA;4&#xA;5&#xA;6&#xA;7&#xA;8&#xA;9&#xA;10&#xA;11&#xA;12&#xA;U&#xA;11&#xA;10&#xA;9&#xA;P&#xA;10&#xA;11&#xA;12&#xA;13&#xA;14&#xA;15&#xA;16&#xA;17&#xA;U&#xA;16&#xA;15&#xA;14&#xA;13&#xA;12&#xA;P&#xA;13&#xA;14&#xA;15&#xA;16&#xA;17&#xA;18&#xA;U&#xA;17&#xA;16&#xA;15&#xA;14&#xA;13&#xA;12&#xA;11&#xA;10&#xA;9&#xA;8&#xA;7&#xA;6&#xA;5&#xA;4&#xA;3&#xA;2&#xA;1&#xA;0&#xA;0&#xA;0&#xA;0&#xA;0&#xA;0&#xA;0&#xA;0&#xA;0&#xA;0&#xA;0&#xA;0&#xA;0&#xA;0&#xA;0&#xA;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;To be clear, the first zero should not be outputted, the charger is acted on &lt;em&gt;after&lt;/em&gt; the corresponding second, meaning that we wait 12 seconds &lt;em&gt;before&lt;/em&gt; unplugging the charger; the 12th second does not happen after the charger is unplugged. The program runs for the highest value in the input array, in this case 67.&lt;/p&gt;&#xA;&lt;p&gt;The question is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the shortest answer in bytes wins. Standard loopholes are not allowed here.&lt;/p&gt;&#xA;" OwnerDisplayName="user100690" LastEditorDisplayName="user100690" LastEditDate="2021-04-05T17:33:36.117" LastActivityDate="2021-04-05T17:33:36.117" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="21969" PostTypeId="2" ParentId="2140" CreationDate="2021-04-04T15:51:44.837" Score="1" Body="&lt;p&gt;&lt;strong&gt;Create a C program that is less than 120 characters the produces the most ASM possible.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This limit does not include the def of main, or including headers. If a function is called the chars in the function count toward limit. The same goes for macros. The compiler used will be GCC 10.2 -O3 targeting x86-64.&lt;/p&gt;&#xA;&lt;p&gt;The code conforms to these parameters and produces the most instructions wins.&lt;/p&gt;&#xA;&lt;p&gt;I have a few questions regarding this. Is the character limit too limiting? Is the choice of compiler a good one? Is the optimization level being -O3 a good idea? Please share any other thoughts you have.&lt;/p&gt;&#xA;&lt;p&gt;Thanks&lt;/p&gt;&#xA;" OwnerUserId="102964" LastActivityDate="2021-04-04T15:51:44.837" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="21970" PostTypeId="2" ParentId="2140" CreationDate="2021-04-04T22:12:08.190" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/224292/66833&quot;&gt;Quote a rational number&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-24T00:07:37.303" LastActivityDate="2021-04-24T00:07:37.303" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21972" PostTypeId="1" CreationDate="2021-04-06T00:00:02.340" Score="9" ViewCount="555" Body="&lt;p&gt;&lt;strong&gt;Nomination phase is over. You can vote &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/22045/68942&quot;&gt;here&lt;/a&gt; until UTC midnight on Tuesday, April 20th&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;By &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20884/68942&quot;&gt;community consensus&lt;/a&gt;, we will be having more room owners for &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;. We will be selecting new room owners via the following process:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For one week (lasting until UTC midnight on Tuesday, April 13th), nominations will be accepted as answers on this meta post. Votes here don't matter. You may nominate yourself, and if you are nominated by someone else, please indicate whether or not you accept the nomination as a comment under the nomination or via some reasonable method.&lt;/li&gt;&#xA;&lt;li&gt;After the nominations period, an election will be held lasting one week. This will be on a separate meta post.&lt;/li&gt;&#xA;&lt;li&gt;Once the election ends, the four nominees with the highest scores will be reviewed by the current moderators for approval and instatement as new room owners.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;In each nomination, please include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The user being nominated&lt;/li&gt;&#xA;&lt;li&gt;Common active times in chat&lt;/li&gt;&#xA;&lt;li&gt;A short blurb about why this user would be a good room owner&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Votes here won't matter, but feel free to do it anyway :P&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-04-13T16:28:44.863" LastActivityDate="2021-04-13T16:28:44.863" Title="New Room Owners for TNB - Nominations Phase" Tags="|discussion|chat|moderation|" AnswerCount="8" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="21973" PostTypeId="2" ParentId="21972" CreationDate="2021-04-06T00:16:06.963" Score="0" Body="&lt;h1&gt;(Self-)Nomination for Wezl&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/456827/wezl&quot;&gt;Chat profile&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Online Monday-Saturday at varying times (around 12:00 to 01:00 UTC?)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Raisins against:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'm active in chat, &lt;em&gt;even more than on main&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;My sleep schedule is not crazy&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Raisins for:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'm first :P&lt;/li&gt;&#xA;&lt;li&gt;I'm &lt;em&gt;active&lt;/em&gt; in chat, even more than on main.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="90614" LastEditorUserId="90614" LastEditDate="2021-04-06T00:33:19.760" LastActivityDate="2021-04-06T00:33:19.760" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="21974" PostTypeId="2" ParentId="21972" CreationDate="2021-04-06T00:40:34.310" Score="8" Body="&lt;h1&gt;(self-)Nomination for Lyxal&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/354515/lyxal&quot;&gt;Chat Profile&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Online mostly everyday from 10pm UTC to 12pm UTC (next day)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;During my time on Code Golf, I've been a room owner of 26 (albeit inactive) chatrooms, so I've had experience with the tools available. I've also seen every bit of activity over the last 1 and a half years (at the time of writing, my consecutive day streak was 599 days), so I believe I have a good feel of what the community believes is on/off topic.&lt;/p&gt;&#xA;&lt;h2&gt;Reasons against&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;In the past when I didn't know any better, I have been known to be a little spammy/off-topic/non-serious in chat - mostly when the atmosphere of the room permitted it. However, I do know how to be serious/on-topic when the conversation requires such an attitude.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I'm asleep when most of the active conversations happen (1pm UTC to 9pm UTC), so if anything happens then, I won't be able to do anything.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Reasons for&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The hours I'm awake coincide with the sleeping hours of some of the more active users (e.g. caird, redwolf, user/Original Original Original VI). Consequently, I'm able to moderate the periods when other users are physically unable to do so - I've noticed that there's a 1-3 hour gap (7am UTC - 10am UTC) when there is a potential for spam to go unfiltered.&lt;/li&gt;&#xA;&lt;li&gt;I ain't changing my username/pfp anytime soon&lt;/li&gt;&#xA;&lt;li&gt;I won't kill conversations purely because they are off-topic - so long as anyone log-reading the room's transcripts to catch-up on messages won't feel like they are wasting their time, the conversation is fine.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2021-04-08T00:48:28.640" LastActivityDate="2021-04-08T00:48:28.640" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21975" PostTypeId="2" ParentId="21972" CreationDate="2021-04-06T00:53:39.023" Score="8" Body="&lt;h1&gt;(Self-)Nomination for Redwolf Programs&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/347075/redwolf-programs&quot;&gt;Chat profile&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Online Monday to Friday from 13:00 to 4:00 (UTC, with some variation)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Reasons against:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I seem to be awake at around the same time as existing users&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Reasons for:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I have experience moderating (and developing!) chat rooms (outside SE)&lt;/li&gt;&#xA;&lt;li&gt;I'm quite active on chat and main&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2021-04-06T14:53:41.140" LastActivityDate="2021-04-06T14:53:41.140" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21976" PostTypeId="2" ParentId="21972" CreationDate="2021-04-06T00:56:09.280" Score="18" Body="&lt;h1&gt;(Self-)Nomination for caird coinheringaahing&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/274572&quot;&gt;My chat profile&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;I'm active pretty much all days, between 10:00 UTC and 3:00 UTC&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Why me?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I'm extremely active in chat (my &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/57555768#57555768&quot;&gt;activity lines up with TNB's room activity&lt;/a&gt; almost perfectly, and, as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/21986/66833&quot;&gt;pointed out by Adám&lt;/a&gt;, I am one of 2 nominees who is &lt;a href=&quot;https://chat.stackexchange.com/rooms/info/240/the-nineteenth-byte?id=240&amp;amp;tab=general&amp;amp;users=frequent&quot;&gt;&amp;quot;frequently in the room&amp;quot;&lt;/a&gt;). I post around 100 messages a day, and average around 700 a week. I also have a solid amount of knowledge into the mechanics of being a room owner (I'm an RO in more than 20 rooms), and so are more than familiar with the tools.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, I'm often the &amp;quot;buzzkill&amp;quot; user whenever fun but noisy conversations happen and I regularly direct users to the &lt;a href=&quot;https://chat.stackexchange.com/rooms/1/sandbox&quot;&gt;Sandbox&lt;/a&gt; when they start messing around with chat features in TNB. That doesn't mean I hate fun, but it does mean that I know when an off-topic or noisy conversation needs to stop.&lt;/p&gt;&#xA;&lt;p&gt;I also &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/20881/66833&quot;&gt;started the discussion into needing more room owners&lt;/a&gt;, &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=57415499#57415499&quot;&gt;pushed the mods (repeatedly) to hold this election&lt;/a&gt;, and I created &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/21931/introducing-oldsandboxposts&quot;&gt;OldSandboxPosts&lt;/a&gt;, a bot which looks to be a very helpful chat resource.&lt;/p&gt;&#xA;&lt;p&gt;Overall, I believe that I'm level-headed and experienced with chat moderation, and that I have a good judge of the line between a &amp;quot;fun conversation&amp;quot; and &amp;quot;useless noise&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Why not me?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I would say that I can be more immature than I'd like in a room owner. I can't speak to how others see me, but that's definitely something I personally am wary of.&lt;/p&gt;&#xA;&lt;p&gt;As I said, I'm also often the &amp;quot;buzzkill&amp;quot; user, and can be pretty strongly against conversations that others may find fun. This is often subjective, and I find myself typically leaning towards the stricter side more often, which can annoy people who want to have fun in The Nineteenth Byte.&lt;/p&gt;&#xA;&lt;p&gt;I'm also active around the same time as a lot of users, so my &amp;quot;moderation coverage&amp;quot; doesn't extend particularly far past most others'&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-07T15:47:09.213" LastActivityDate="2021-04-07T15:47:09.213" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="21977" PostTypeId="2" ParentId="21972" CreationDate="2021-04-06T00:59:46.783" Score="6" Body="&lt;h1&gt;(Self-)Nomination for user&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/468262&quot;&gt;Chat profile&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Only pretty much the entire week from approximately 2 pm UTC to 1 am UTC (not sure about this, though, timezones are confusing)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Reasons for&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'm pretty active in TNB, even more than on the main site.&lt;/li&gt;&#xA;&lt;li&gt;I'm active on weekdays, although perhaps less so than on weekends.&lt;/li&gt;&#xA;&lt;li&gt;I have &amp;gt;10k rep network-wide, meaning I can handle flags raised in the room.&lt;/li&gt;&#xA;&lt;li&gt;I'm active when TNB is the most active and action by a room owner will most likely be needed.&lt;/li&gt;&#xA;&lt;li&gt;&lt;s&gt;I have a cool and original username, although I'm going to change it back to &amp;quot;user&amp;quot; soon (and I'll be sticking with that).&lt;/s&gt; I'm user again, and will likely keep the username and avatar as long as I'm on SE.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Reasons against&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I can be immature, although that will change if I become a room owner (even if I don't, probably).&lt;/li&gt;&#xA;&lt;li&gt;I haven't been a user on CGCC as long as others, such as caird coinheringaahing/ChartZ Belatedly or Lyxal.&lt;/li&gt;&#xA;&lt;li&gt;I don't have 10k rep on CGCC, so I can't see deleted posts, etc.&lt;/li&gt;&#xA;&lt;li&gt;There's probably more reasons, but I can't think of any right now. That's probably a reason against, though.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="95792" LastEditorUserId="95792" LastEditDate="2021-04-12T20:11:44.363" LastActivityDate="2021-04-12T20:11:44.363" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21978" PostTypeId="2" ParentId="21972" CreationDate="2021-04-06T03:29:19.780" Score="14" Body="&lt;h1&gt;Self nomination for Bubbler&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/337270/bubbler&quot;&gt;Chat profile&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Online mostly on weekdays (Mon-Fri) from 23:00 UTC (previous day) to 9:00 UTC&#xA;&lt;ul&gt;&#xA;&lt;li&gt;My timezone is UTC+9.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Reasons for&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'm active during the hours when most other users are not.&lt;/li&gt;&#xA;&lt;li&gt;I'm not &lt;em&gt;that&lt;/em&gt; active on chat, but I like to read the chat going on (and occasionally participate), and the TNB tab is always open on my PC.&lt;/li&gt;&#xA;&lt;li&gt;I tend to actively participate in meta discussions.&lt;/li&gt;&#xA;&lt;li&gt;I won't change my username and avatar in the near future.&lt;/li&gt;&#xA;&lt;li&gt;I have over &lt;strong&gt;50k&lt;/strong&gt; rep across the network :)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Reasons against&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'm rarely active (even online) on weekends.&lt;/li&gt;&#xA;&lt;li&gt;It is my first time being an RO, except for a few small rooms I made for LotM. It might take some time to get used to the tools (mainly the moderation stuff).&lt;/li&gt;&#xA;&lt;li&gt;Similarly to caird, I may occasionally get too strict with certain kinds of conversation, though these days I tend to let things flow most of the time.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-04-11T23:44:32.150" LastActivityDate="2021-04-11T23:44:32.150" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21981" PostTypeId="2" ParentId="2140" CreationDate="2021-04-06T07:00:00.543" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/223362/determine-circles&quot;&gt; Determine Circles &lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="101762" LastEditorUserId="101762" LastEditDate="2021-04-13T04:59:00.017" LastActivityDate="2021-04-13T04:59:00.017" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="21982" PostTypeId="2" ParentId="21972" CreationDate="2021-04-06T07:20:34.587" Score="1" Body="&lt;h1&gt;(Self-Nomination) for Wasif&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/448660&quot;&gt;Chat Profile&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Online everyday in week around at varying times (Mostly around UTC 2:00 to 4:30 PM and 7:00 to 12:00 AM and 10:00 to 12:00 AM) (UTC time can be incorrect here is the GMT 6 time I'm mostly active: 1:00-3:30, 5:00-6:30, 9:30-11:30)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Reasons for&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I am quite active in chat, and could be freely contacted&lt;/li&gt;&#xA;&lt;li&gt;Have &amp;gt;20k network reputation, so I'll be able to handle flags and other stuff&lt;/li&gt;&#xA;&lt;li&gt;I'm active when TNB is the most active and action by a room owner will most likely be needed.&lt;/li&gt;&#xA;&lt;li&gt;I'll never change my username (But avatars can be changed frequently)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Reasons against&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I don't have 10k on CGCC main, so some problems can occur&lt;/li&gt;&#xA;&lt;li&gt;I can be slightly immature, but I am learning more and more&lt;/li&gt;&#xA;&lt;li&gt;(Can't think of more reasons please ping me if you find more flaws :P)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="92116" LastEditorUserId="92116" LastEditDate="2021-04-06T07:34:01.483" LastActivityDate="2021-04-06T07:34:01.483" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21983" PostTypeId="2" ParentId="2140" CreationDate="2021-04-06T11:24:34.307" Score="0" Body="&lt;h1&gt;Computer Tree&lt;/h1&gt;&#xA;&lt;p&gt;Consider an infinite amount of same computers building a tree, running same program. Each computer has infinite memory and infinite pins 0 to Infinity, where pin 0 connect to its parent, or the IO we see for the root; and pin 1..Inf connect to its childs.&lt;/p&gt;&#xA;&lt;p&gt;Each connection is bidirectional, and has buffer in each direction. Writer put the value into buffer, and reader gets from it.&lt;/p&gt;&#xA;&lt;p&gt;The computers need to support these abilities: (Here dest is a variable in the memory, and src1, src2 are either variable or immediate integers. [x] mean the memory in address x.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;dest = src1 op src2, op in +,-,*&#xA;[dest] = src1&#xA;dest = [src1]&#xA;if(src1 op src2) goto inst, op in &amp;lt;,==,&amp;lt;=,!=&#xA;if((not)pin src1 writing) goto inst&#xA;if((not)pin src1 reading) goto inst&#xA;write src2 to pin src1, block if already writing&#xA;read dest from pin src1, block if not reading&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;It's fine if you need several elements to do one job above, but each job defined above should use same amount of time(In this model timing matters). It's also fine if you take input as some other formats, but to avoid taking too ready functions, an same-type input shouldn't lead to an infinite loop. Input for root is given when started and will never need to wait unless all input used up, but it doesn't always halt.&lt;/p&gt;&#xA;&lt;p&gt;Shortest code win.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2021-04-06T11:24:34.307" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21984" PostTypeId="2" ParentId="2140" CreationDate="2021-04-06T15:22:45.483" Score="1" Body="&lt;h1&gt;Find the traitor &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; (WIP)&lt;/h1&gt;&#xA;&lt;p&gt;In this challenge, the cops are the robbers/moles and the robbers are the cops/investigators.&lt;/p&gt;&#xA;&lt;h2&gt;Cops&lt;/h2&gt;&#xA;&lt;p&gt;Cops will write a program that will output one of the following strings:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&amp;quot;Hello World!&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Totally not evil stuff&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Good morning&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Innocent things&amp;quot;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;However, when &lt;code&gt;n&lt;/code&gt; specific characters are removed, where &lt;code&gt;0 &amp;lt; n &amp;lt; length of cop's program&lt;/code&gt;, the resulting program should output one of the following strings:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&amp;quot;Bye World!&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Top secret stuff&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Evil things&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Horrible morning&amp;quot;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Cops will reveal the original program and &lt;code&gt;n&lt;/code&gt;, but not the resulting program. They will also reveal the 2 strings that must be outputted by the original and transformed programs.&lt;/p&gt;&#xA;&lt;p&gt;A cop's score is &lt;span class=&quot;math-container&quot;&gt;\$\binom n r\$&lt;/span&gt;, or &lt;span class=&quot;math-container&quot;&gt;\$\frac{n!}{r!(n-r)!}\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$r\$&lt;/span&gt; is the size of the cop's program and &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is the number of characters to be deleted. The lower the score, the better.&lt;/p&gt;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The original and transformed program may output in different ways, as long as the cop specifies what they are.&lt;/li&gt;&#xA;&lt;li&gt;The characters to be deleted do not have to be adjacent.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Robbers&lt;/h2&gt;&#xA;&lt;p&gt;Robbers must find a way to make the cop's program output the chosen 2nd string by removing any &lt;code&gt;n&lt;/code&gt; characters (not necessarily the same as the cop's).&lt;/p&gt;&#xA;&lt;h2&gt;Example cop&lt;/h2&gt;&#xA;&lt;p&gt;Python, n = 1&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a = [&amp;quot;Totally not evil stuff&amp;quot;, &amp;quot;Hello World!&amp;quot;][01]&#xA;print(a)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The original string is &amp;quot;Hello World!&amp;quot;, and the transformed program prints &amp;quot;Totally not evil stuff&amp;quot;.&lt;/p&gt;&#xA;&lt;h2&gt;Example robber&lt;/h2&gt;&#xA;&lt;p&gt;Python, cracks &lt;a href=&quot;https://rr.noordstar.me/18b15a7f&quot; rel=&quot;nofollow noreferrer&quot;&gt;Foobar's answer&lt;/a&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a = [&amp;quot;Totally not evil stuff&amp;quot;, &amp;quot;Hello World!&amp;quot;][0]&#xA;print(a)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Deleting the &lt;code&gt;1&lt;/code&gt; at the end of the first line prints the target string.&lt;/p&gt;&#xA;&lt;h2&gt;Questions for Meta:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Which original and transformed strings should I use?&lt;/li&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;" OwnerUserId="95792" LastEditorUserId="95792" LastEditDate="2021-04-11T18:39:55.747" LastActivityDate="2021-04-11T18:39:55.747" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="21986" PostTypeId="2" ParentId="21972" CreationDate="2021-04-06T23:58:28.100" Score="8" Body="&lt;h1&gt;Self-nomination for Adám&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/130368/adam&quot;&gt;Chat profile&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Active in chat 05:00–02:00 UTC&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Reasons for&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;As of writing, caird coinheringaahing and I are the only eligible &lt;a href=&quot;https://chat.stackexchange.com/rooms/info/240/the-nineteenth-byte?id=240&amp;amp;tab=general&amp;amp;users=frequent&quot;&gt;&amp;quot;frequently in room&amp;quot; users&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I have &lt;a href=&quot;https://codegolf.stackexchange.com/users/43319/ad%c3%a1m?tab=topactivity&quot;&gt;plenty of rep&lt;/a&gt; to handle flags.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I have written &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/43319/ad%c3%a1m?tab=topactivity&quot;&gt;over 100 posts on meta&lt;/a&gt; throughout the last 5½ years.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I have written &lt;a href=&quot;https://chat.stackexchange.com/rooms/info/240/the-nineteenth-byte?id=240&amp;amp;tab=general&amp;amp;users=frequent#user-130368&quot;&gt;over 19000 messages in TNB&lt;/a&gt; throughout the last 4½ years.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I have 4 years experience as room owner of &lt;a href=&quot;https://chat.stackexchange.com/rooms/52405/the-apl-orchard/&quot;&gt;another room&lt;/a&gt; that has at times rivalled TNB's activity.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I have never changed my avatar (as far as I remember), nor do I plan to do that.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I have only changed my username (other than styling) when &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/46212513#46212513&quot;&gt;I changed my name in real life&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I have a reputation to uphold, because my profile is actually &lt;a href=&quot;https://www.dyalog.com/meet-team-dyalog.htm#Adam&quot; rel=&quot;nofollow noreferrer&quot;&gt;real-life me&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Reasons against&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11755/43319&quot;&gt;I am mainly here for work&lt;/a&gt;, so I could be seen as biased.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In a recent incident, &lt;a href=&quot;https://mlochbaum.github.io/BQN/commentary/orchard.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;some people think I handled myself badly as room owner&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I'm never here on Saturdays, and occasionally I am absent for up to 3 days straight.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2021-04-07T05:48:15.140" LastActivityDate="2021-04-07T05:48:15.140" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21987" PostTypeId="2" ParentId="2140" CreationDate="2021-04-07T16:04:07.743" Score="1" Body="&lt;h1&gt;KotH: Assembly Anarchy&lt;/h1&gt;&#xA;&lt;p&gt;Draft. Just posting this so I don't forget I had this idea. Feel free to suggest improvements to the general idea here.&lt;/p&gt;&#xA;&lt;p&gt;Basically, there would be a computer with memory and a processor. Programs would be submitted in a custom assembly language, and they would try to run a function (their flag) as many times as possible. They could try to interfere with other programs, by doing things like replacing the pointer to another bot's flag with their own, or preventing other bots from being run.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-04-07T16:04:07.743" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="21988" PostTypeId="2" ParentId="2140" CreationDate="2021-04-07T17:05:14.067" Score="0" Body="&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/unicode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;unicode&amp;#39;&quot; rel=&quot;tag&quot;&gt;unicode&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;conversion&amp;#39;&quot; rel=&quot;tag&quot;&gt;conversion&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Interpret a Cangjie Input Method String&lt;/h1&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Cangjie_input_method&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cangjie input method&lt;/a&gt; is a method for inputting Chinese characters using a standard QWERTY-like keyboard. Each Chinese character is encoded as a sequence of Latin letters, each letter representing a radical, or part, of the character's form. Each letter encodes both the radical character it represents, as well as other, related radicals (such as &lt;code&gt;E&lt;/code&gt; encoding &lt;code&gt;水&lt;/code&gt; as well as &lt;code&gt;氵&lt;/code&gt;, and more).&lt;/p&gt;&#xA;&lt;p&gt;There are 24 radicals encoded in Cangjie, as well as 3 other characters for wild cards and other purposes. For the purposes of this challenge, only the subset of the main 4 groups are used, shown below with meanings:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Philosophical group&#xA;A   日 sun&#xA;B   月 moon&#xA;C   金 gold&#xA;D   木 wood&#xA;E   水 water&#xA;F   火 fire&#xA;G   土 land&#xA;&#xA;Stroke group&#xA;H   竹 bamboo&#xA;I   戈 dagger axe&#xA;J   十 ten&#xA;K   大 big&#xA;L   中 centre&#xA;M   一 one&#xA;N   弓 bow&#xA;&#xA;Body parts group&#xA;O   人 person&#xA;P   心 heart&#xA;Q   手 hand&#xA;R   口 mouth&#xA;&#xA;Character shapes group&#xA;S   尸 corpse&#xA;T   廿 twenty&#xA;U   山 mountain&#xA;V   女 woman&#xA;W   田 field&#xA;Y   卜 fortune telling&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Cangjie Basic Rules&lt;/h2&gt;&#xA;&lt;p&gt;Characters are analyzed as such to create a Cangjie code (based on the Wikipedia article above):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Direction of decomposition: left to right, top to bottom, outside to inside&lt;/li&gt;&#xA;&lt;li&gt;Geometrically connected forms: takes 4 Cangjie codes from the 1st code to the last code&lt;/li&gt;&#xA;&lt;li&gt;Geometrically unconnected forms:&lt;/li&gt;&#xA;&lt;li&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Forms in exactly 2 subforms: Follow the direction of decomposition rules, then take the first and last codes of of the first subform, and the first, second, and last code of the second subform.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Forms in more than 2 subforms: take the first and last codes of the first subform according to direction of decomposition, then break the remainder into subforms. Take the first and last codes of the first remainder, and the last code of the last remainder.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a full program or function that, when given a valid Cangjie code string as input, outputs its corresponding traditional Chinese character.&lt;/p&gt;&#xA;&lt;h2&gt;Additional Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use Cangjie version 5.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;An invalid Cangjie code string (not in our subset of codes) is undefined behavior when used as input.&lt;/li&gt;&#xA;&lt;li&gt;If multiple characters match a Cangjie code string, you can choose to output both, or choose one. If you choose one, it must only output that character when given that code.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input - Output (notes)&#xA;JWJ - 車 (connected, top to bottom: 十田十)&#xA;YRHHI - 謝 (3 parts: first is disconnected, take first and last YR;&#xA;           second is is disconnected, take first and last HH; last part take last I)&#xA;AN - 門 (special case: fixed decomposition)&#xA;OMN - 气 (another fixed decomposition; using version 5)&#xA;A - 日&#xA;BOB - 肭&#xA;JPHI - 蜜&#xA;GUMPC - 顤&#xA;STKR - 匿 or  (if multiple characters exist for that code, pick one deterministically)&#xA;HXH - (undefined behavior, since X is not in the set of codes above)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is it clear? Anything that needs adding/removing?&lt;/li&gt;&#xA;&lt;li&gt;Any weird test cases I didn't put in?&lt;/li&gt;&#xA;&lt;li&gt;Anything else?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="77309" LastActivityDate="2021-04-07T17:05:14.067" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="21989" PostTypeId="2" ParentId="19329" CreationDate="2021-04-07T19:28:39.167" Score="10" Body="&lt;h1&gt;&lt;a href=&quot;https://meta.stackexchange.com/q/355955/355458&quot;&gt;This has been fixed!&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;(Yes, this is a sockpuppet account created by caird coinheringaahing, I forgot the password to the previous one I made)&lt;/p&gt;&#xA;" OwnerUserId="103065" LastActivityDate="2021-04-07T19:28:39.167" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21991" PostTypeId="2" ParentId="2140" CreationDate="2021-04-07T23:49:04.293" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/223507/103069&quot;&gt;Rejecting invalid IPv4 addresses&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="103069" LastEditorUserId="103069" LastEditDate="2021-04-14T20:34:53.623" LastActivityDate="2021-04-14T20:34:53.623" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="21992" PostTypeId="5" CreationDate="2021-04-08T00:25:02.960" Score="0" Body="&lt;p&gt;Similar to the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/announcements&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;announcements&amp;#39;&quot; rel=&quot;tag&quot;&gt;announcements&lt;/a&gt; tag on &lt;a href=&quot;https://meta.stackexchange.com/questions/tagged/announcements&quot;&gt;Meta Stack Exchange&lt;/a&gt;, this tag is intended to indicate that a post is an official announcement of some change made to the site. Posts with this tag are often posted by staff members or moderators, though this is not a moderator-only tag.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-08-18T23:19:24.777" LastActivityDate="2021-08-18T23:19:24.777" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21993" PostTypeId="4" CreationDate="2021-04-08T00:25:02.960" Score="0" Body="For posts that take the form of an announcement, typically of significant changes to the site. This tag is often used by the Stack Exchange staff to announce site-specific changes" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-08-18T23:19:24.777" LastActivityDate="2021-08-18T23:19:24.777" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21994" PostTypeId="2" ParentId="2140" CreationDate="2021-04-08T08:16:52.797" Score="0" Body="&lt;h1&gt;Text in aLtErNaTiNg cApS&lt;/h1&gt;&#xA;&lt;p&gt;Sometimes, we want to convey sarcasm in a text message or in a YouTube/Reddit comment. To this end, &amp;quot;alternating caps&amp;quot; is often used. Your task, should you wish to accept it, is to write code that turns the input text into its &amp;quot;alternating caps&amp;quot; version.&lt;/p&gt;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;&lt;p&gt; (This is a &lt;strong&gt;deleted&lt;/strong&gt; rule. You should ignore this for the challenge) For most sans-serif web fonts, it is hard to distinguish capital I (for India) and lower-case l (for Lima). So we want to avoid either of these letters in our output. To achieve this, we are allowed to sacrifice &amp;quot;exact alternating-ness&amp;quot; of the output. Details below.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Input:&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A string of words involving [a-zA-Z], with one space in between each word.&lt;/li&gt;&#xA;&lt;li&gt;You may not assume whether or not the string ends with a space/newline/etc.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Output:&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The input, turned into &amp;quot;alternating caps form&amp;quot;, with the first letter of each word being lower-case.&lt;/li&gt;&#xA;&lt;li&gt;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;&lt;p&gt; (&lt;strong&gt;Deleted&lt;/strong&gt;; you should not implement it. I have included it just to illustrate my thought process) You may not output any capital I (&lt;code&gt;I&lt;/code&gt;, for India) or lower-case l (&lt;code&gt;l&lt;/code&gt;, for Lima). To avoid these, you may continue outputting the same letter-case as the previous letter, but you must switch the letter-case at the earliest possible instance. (note to self: this requirement means there are sometimes more than two letters of the same case, which I don't really want)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Non-suppressible output can be ignored.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;You must take input from and output to natural places, according to your language.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;code&gt;code-golf&lt;/code&gt;, so the lowest byte-count wins. Ties are broken by earliest submission.&lt;/li&gt;&#xA;&lt;li&gt;Please provide a way for readers to test your code (e.g. &lt;a href=&quot;https://tio.run/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;li&gt;An ungolfed version and an explanation for your code is appreciated, although not required for the challenge.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input -&amp;gt; Output&#xA;---------------&#xA;alternating -&amp;gt; aLtErNaTiNg&#xA;lower case letters -&amp;gt; lOwEr cAsE lEtTeRs&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Examples that follow the &lt;strong&gt;deleted&lt;/strong&gt; rule (which you should not implement -- these are just for your interest:&lt;/p&gt;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;&lt;p&gt;I used &lt;a href=&quot;https://www.dcode.fr/word-search-regexp&quot; rel=&quot;nofollow noreferrer&quot;&gt;dcode&lt;/a&gt; to find some of these examples.&#xA;&lt;code&gt;holding -&amp;gt; hOLdiNg&lt;/code&gt;&#xA;&lt;code&gt;radii -&amp;gt; rAdii (has more than 2 lower-cases in a row, if using my rules)&lt;/code&gt;&#xA;&lt;code&gt;fall -&amp;gt; fALL (has more than 2 capitals in a row, if using my rules)&lt;/code&gt;&#xA;&lt;code&gt;volleyball -&amp;gt; [even if you are allowed to change the previous letter-cases to try to stop 'ALL' (3 capitals in a row) from appearing, there is a non-unique way of doing so]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Good luck!&lt;/p&gt;&#xA;" OwnerUserId="101644" LastActivityDate="2021-04-08T08:16:52.797" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="21996" PostTypeId="5" CreationDate="2021-04-08T14:07:21.053" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; is a challenge type where each new answer is influenced by the answer(s) before it. See the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/tags/answer-chaining/info&quot;&gt;tag wiki&lt;/a&gt; for more.&lt;/p&gt;&#xA;&lt;p&gt;This tag should be added to questions that are specifically about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; in general, such as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14966/what-answer-chaining-scoring-criteria-promote-collaboration&quot;&gt;asking for good scoring criteria&lt;/a&gt;; or with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/specific-questions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;specific-questions&amp;#39;&quot; rel=&quot;tag&quot;&gt;specific-questions&lt;/a&gt;, asking about about a specific &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; challenge.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-08T14:07:21.053" LastActivityDate="2021-04-08T14:07:21.053" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21997" PostTypeId="4" CreationDate="2021-04-08T14:07:21.053" Score="0" Body="For questions relating to the answer chaining type of challenge. [answer-chaining] challenges should be asked on main, not here" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-11T15:36:32.203" LastActivityDate="2021-04-11T15:36:32.203" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21998" PostTypeId="2" ParentId="2140" CreationDate="2021-04-08T18:17:19.037" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/223431&quot;&gt;Fastest unique finder&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2021-04-14T01:09:52.843" LastActivityDate="2021-04-14T01:09:52.843" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="21999" PostTypeId="5" CreationDate="2021-04-08T18:57:07.520" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/badges&quot;&gt;Badges&lt;/a&gt; are icons you can collect, shown next to your reputation and profile picture. There are 3 categories of badge: bronze, silver and gold. Harder badges are silver and badges that require a large amount of effort are gold.&lt;/p&gt;&#xA;&lt;p&gt;The complete details of how to earn each badge can be found &lt;a href=&quot;https://meta.stackexchange.com/questions/67397/what-are-the-badges-i-can-earn-on-each-site-and-what-are-the-exact-criteria-for&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This tag should be added to questions that are specifically about the badge system, or specific badges. &lt;a href=&quot;/questions/tagged/feature-requests&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;feature-requests&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-requests&lt;/a&gt; requesting new badges should be posted to &lt;a href=&quot;https://meta.stackexchange.com/&quot;&gt;Mother Meta&lt;/a&gt;, as badges are not a site specific feature. Posts asking &amp;quot;How does this badge work/How do I get this badge?&amp;quot; are off-topic, and should be referred to the above Mother Meta post.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-08T18:57:07.520" LastActivityDate="2021-04-08T18:57:07.520" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22000" PostTypeId="4" CreationDate="2021-04-08T18:57:07.520" Score="0" Body="Special symbols shown next to your reputation, which provide indicators that a user has met a specific achievement." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-08T19:10:57.600" LastActivityDate="2021-04-08T19:10:57.600" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22001" PostTypeId="1" CreationDate="2021-04-08T19:05:23.593" Score="5" ViewCount="86" Body="&lt;p&gt;Navigate to the &lt;a href=&quot;/questions/tagged/best-of&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;best-of&amp;#39;&quot; rel=&quot;tag&quot;&gt;best-of&lt;/a&gt; tag and you'll see the following:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/SQYoe.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/SQYoe.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This doesn't show any of the &amp;quot;Cast your vote for Best of 20XX&amp;quot; posts, such as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/20638/cast-your-vote-for-best-of-cgcc-2020&quot;&gt;this&lt;/a&gt; one (which should be at the top, when sorting by active).&lt;/p&gt;&#xA;&lt;p&gt;Following the search query &lt;a href=&quot;https://codegolf.meta.stackexchange.com/search?tab=active&amp;amp;q=%5bbest-of%5d%20is%3aq&quot;&gt;&lt;code&gt;[best-of] is:q&lt;/code&gt;&lt;/a&gt; shows all 14 posts tagged with &lt;a href=&quot;/questions/tagged/best-of&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;best-of&amp;#39;&quot; rel=&quot;tag&quot;&gt;best-of&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;All of the missing posts are locked, this might have something to do with this bug.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="68942" LastEditDate="2021-11-30T21:15:18.723" LastActivityDate="2021-11-30T21:15:18.723" Title="best-of tag not showing the &quot;Cast your vote for&quot; posts" Tags="|bug|status-completed|best-of|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22002" PostTypeId="2" ParentId="22001" CreationDate="2021-04-08T19:55:22.073" Score="3" Body="&lt;p&gt;Historical locked intentionally do not show up in tag searches. From the &lt;a href=&quot;https://meta.stackexchange.com/questions/126587/what-is-a-historical-lock-and-what-is-it-used-for&quot;&gt;Meta Stack Exchange FAQ&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Additionally, on main (non-meta) sites, historically locked questions are omitted from normal question lists (those on the home page, /questions, and the various per-tag lists), but can still be found by searching for words in the post or title (via either site-search or Google, etc) or by using the search operator locked:1.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;... Wait... Uh... crap.&lt;/p&gt;&#xA;&lt;p&gt;That says &amp;quot;(non-meta)&amp;quot;... so... Uh... Here's the thing. I've known that this doesn't work for a long time but I've &lt;em&gt;never&lt;/em&gt; realized that the FAQ specifically says that meta sites &lt;em&gt;aren't&lt;/em&gt; supposed to hide Historically locked questions... the point being, I have gone for ~5 years thinking that this was intended... and I'm &lt;em&gt;pretty&lt;/em&gt; sure (though I can't be certain) that it's been like this for that long.&lt;/p&gt;&#xA;&lt;p&gt;Shog added that note to the FAQ back in 2012 and it was rephrased more recently so there's about 9 years during which it could have broken - if it was ever intended to work at all. So, the question now is... how &lt;em&gt;should&lt;/em&gt; it work?&lt;/p&gt;&#xA;&lt;p&gt;I can see the value of using historical locks the way y'all do - in fact, before I started working here, &lt;a href=&quot;https://meta.stackexchange.com/questions/273468/make-it-possible-to-prevent-voting-on-time-limited-questions-in-meta-without-a-h&quot;&gt;I asked for a way to do that for exactly the reason y'all are using it&lt;/a&gt;. Note, point 2 in my question is that the posts don't appear in the active list - which means this bug was confirmed as existing (and thought to be normal!) back in 2016.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;So, I marked this &lt;a href=&quot;/questions/tagged/status-bydesign&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-bydesign&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-bydesign&lt;/a&gt; when it got cross posted to MSE and linked back here - because (as indicated by the beginning of this post) I thought everything was working as normal - and I'm not actually convinced that this behavior is always wrong. Historical locks are supposed to be an indication of something on the site that shouldn't exist - which is why they're hidden and, while I completely love the way y'all are using them and see the value in &lt;em&gt;not&lt;/em&gt; hiding them, I'd much rather give y'all a better way of doing what you're doing that supports the community project rather than using a bad lock because it does what you want it to do.&lt;/p&gt;&#xA;&lt;p&gt;At this point, I can change the status back to &lt;a href=&quot;/questions/tagged/status-review&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-review&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-review&lt;/a&gt; and actually see if we can fix how historical locks work on meta sites... or I can add it to my MSE question from 2016 and see if we can actually build a better tool. Thoughts? I suppose &amp;quot;both&amp;quot; is also an option.&lt;/p&gt;&#xA;" OwnerUserId="78028" LastActivityDate="2021-04-08T19:55:22.073" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22003" PostTypeId="2" ParentId="2140" CreationDate="2021-04-08T20:04:32.903" Score="1" Body="&lt;h1&gt;Poor Man's DRM&lt;/h1&gt;&#xA;&lt;p&gt;Write a program that only prints &lt;code&gt;Welcome&lt;/code&gt; at the first execution and first execution only. All executions after the first execution should only print &lt;code&gt;Where money&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Anything is allowed as long as the following condition is met: An execution ends after the program exits. So the second execution can only start after the first execution exits completely.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Reason for the condition: to prevent submissions that linger around in the memory and keep a runtime counter.&lt;/p&gt;&#xA;" OwnerUserId="46872" LastEditorUserId="46872" LastEditDate="2021-04-08T20:36:52.343" LastActivityDate="2021-04-08T20:36:52.343" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22005" PostTypeId="1" AcceptedAnswerId="22011" CreationDate="2021-04-08T21:05:34.243" Score="11" ViewCount="265" Body="&lt;p&gt;7 years ago, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1446/code-golf-blog-phase-1-raise-the-idea-on-the-meta-site&quot;&gt;we asked about having a site blog&lt;/a&gt;. The idea &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/15461516#15461516&quot;&gt;sort of just stopped&lt;/a&gt; and was never followed through. Unfortunately, since then, BlogOverflow (the site supposed to host site blogs) &lt;a href=&quot;https://meta.stackexchange.com/questions/291741/we-will-no-longer-be-hosting-blog-overflow&quot;&gt;has been shutdown&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/57591035#57591035&quot;&gt;brought up the blog&lt;/a&gt; in chat, and it &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/57591383#57591383&quot;&gt;was suggested&lt;/a&gt; by a couple of users that we give it another shot, potentially on Meta. This spawned a conversation about the practicalities and possibilities of starting and hosting a site blog.&lt;/p&gt;&#xA;&lt;p&gt;However, going by the guidelines laid out in the &lt;a href=&quot;https://stackoverflow.blog/2011/06/23/blog-overflow/&quot;&gt;BlogOverflow announcement post&lt;/a&gt;, a site blog needs to have clear support and involvement, as well as a clearly defined scope and purpose. Without these, it's highly likely that it'll fail fairly quickly.&lt;/p&gt;&#xA;&lt;p&gt;So, this is an interest check: Should we consider starting a site blog? If so, how should it be hosted?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="68942" LastEditDate="2021-04-20T19:31:18.827" LastActivityDate="2021-04-20T19:31:18.827" Title="Should we start a blog?" Tags="|discussion|blog-discussion|" AnswerCount="4" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22006" PostTypeId="2" ParentId="22005" CreationDate="2021-04-08T21:05:34.243" Score="5" Body="&lt;h1&gt;Yes, hosted as a Meta question&lt;/h1&gt;&#xA;&lt;p&gt;This is the opinion I posted about in chat. Essentially, we create a single question to &amp;quot;host&amp;quot; the blog. Each week (or however regularly we choose), a specific user posts an answer containing that week's blog post.  This would create less clutter on Meta than posting a new question for each blog post, and would make the posts easier to follow (sorting by oldest and/or active, or &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/57591574#57591574&quot;&gt;accepting the latest post&lt;/a&gt;). Additionally, hosting it here would drive more traffic to the blog, rather than hosting on some external site.&lt;/p&gt;&#xA;&lt;p&gt;A couple of potential downsides:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This would be (yet another) abuse of the SE system to set up something for the community. Therefore, it's not unlikely that we'd experience some unusual behaviour on SE's side of the equation (similar to the Sandbox, but at less of a scale). Hosting it on a dedicated blog site would provide software that's a better fit&lt;/li&gt;&#xA;&lt;li&gt;The default SE sort (sort by votes) could (and probably would) jumble the posts out of order&lt;/li&gt;&#xA;&lt;li&gt;We might just run out of things to talk about. We're a pretty broad community compared to most on SE, but we might not have as much to talk about as other sites. The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1464/66833&quot;&gt;scope definition&lt;/a&gt; from the last attempt had a few ideas, but &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1450/66833&quot;&gt;a major objection was the lack of topics to talk about&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-04-08T21:05:34.243" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22007" PostTypeId="2" ParentId="2140" CreationDate="2021-04-08T21:22:17.280" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/223202/cooperative-counting&quot;&gt;Cooperative counting&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="102975" LastEditorUserId="102975" LastEditDate="2021-04-10T11:00:10.653" LastActivityDate="2021-04-10T11:00:10.653" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22008" PostTypeId="5" CreationDate="2021-04-08T21:58:01.263" Score="0" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/set-bounties&quot;&gt;bounty system&lt;/a&gt; is a way that any user with 75 reputation or more is able to attract attention to a specific question or answer.&lt;/p&gt;&#xA;&lt;p&gt;Bounties allow you to &amp;quot;spend&amp;quot; up to 500 of your own reputation (decreasing in increments of 50, to a minimum of 50) in order to bring attention to a specific post. Due to our nature as a site, the vast majority of bounties awarded on this site are awarding answers, rather than any of the other set reasons.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions?tab=Bounties&quot;&gt;This&lt;/a&gt; lists all active bounties on the Main site. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5243/list-of-bounties-with-no-deadline&quot;&gt;This&lt;/a&gt; is a list of &amp;quot;bounties without deadlines&amp;quot;, set by various users to be awarded if/when their criteria are met.&lt;/p&gt;&#xA;&lt;p&gt;Questions with this tag should typically ask about the system as a whole (usually tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/support&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt;) or about specific bounties. In exceptional circumstances, the &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=moderators&quot;&gt;diamond moderators&lt;/a&gt; can &lt;a href=&quot;https://meta.stackexchange.com/a/27103/355458&quot;&gt;refund&lt;/a&gt; bounties. If you are fine with this request being public, use this tag on such requests. Otherwise, &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/flag-posts&quot;&gt;raise a flag&lt;/a&gt; to resolve it privately.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-08T22:08:13.643" LastActivityDate="2021-04-08T22:08:13.643" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22009" PostTypeId="4" CreationDate="2021-04-08T21:58:01.263" Score="0" Body="A way to attract attention to questions and answers by offering some of your own reputation as a reward to an answer" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-08T21:58:01.263" LastActivityDate="2021-04-08T21:58:01.263" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22010" PostTypeId="2" ParentId="22005" CreationDate="2021-04-08T22:09:33.050" Score="3" Body="&lt;h1&gt;Yes, hosted externally with a chat room to coordinate posts&lt;/h1&gt;&#xA;&lt;p&gt;The StackExchange platform doesn't really lend itself well to formats that aren't Q&amp;amp;A (we know that very well), so why struggle within this environment when we could use a dedicated blogging platform?&lt;/p&gt;&#xA;&lt;p&gt;Candidates include (by no means is this a exhaustive list):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;WordPress&lt;/li&gt;&#xA;&lt;li&gt;Tumblr&lt;/li&gt;&#xA;&lt;li&gt;Weebly&lt;/li&gt;&#xA;&lt;li&gt;Medium&lt;/li&gt;&#xA;&lt;li&gt;A github repo (posts would be markdown files)&lt;/li&gt;&#xA;&lt;li&gt;Blogger&lt;/li&gt;&#xA;&lt;li&gt;A custom site created by us and hosted by us&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Downsides&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This wouldn't be a part of our community here - unfortunately, history has shown that branching off from the main stack exchange tends to lead to that thing &amp;quot;fizzling out&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;Also, it wouldn't be as accessible to new users who might not know the link&lt;/li&gt;&#xA;&lt;li&gt;Unlike card's suggestion to have potential posts here, an external site means that people can't choose what they want featured&lt;/li&gt;&#xA;&lt;li&gt;And obviously, there's the fact that we might very well run out of things to talk about.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2021-04-08T22:09:33.050" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22011" PostTypeId="2" ParentId="22005" CreationDate="2021-04-08T23:23:44.013" Score="12" Body="&lt;h1&gt;Yes, hosted as multiple Meta questions&lt;/h1&gt;&#xA;&lt;p&gt;Rather than each blog post being an answer to a single question as caird coinheringaahing suggested, we could create a new question for each blog post. This has a few advantages over a single question:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can sort the posts by newest, rather than active/oldest/votes being your only options&lt;/li&gt;&#xA;&lt;li&gt;The blog post visible in the sidebar (in featured or hot) will change, rather than users only seeing the one question, so it's easier to know when a new one's been posted&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Reasons for making the posts answers included reducing clutter, but in my opinion having them tagged as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/blog&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;blog&amp;#39;&quot; rel=&quot;tag&quot;&gt;blog&lt;/a&gt; would allow them to be seen and sorted &lt;em&gt;easier&lt;/em&gt;, and the added number of questions wouldn't be enough to push other questions off of the active page or anything like that.&lt;/p&gt;&#xA;&lt;p&gt;The first and third downsides in caird's suggestion apply to this suggestion too, but I don't think they're nearly significant enough (for either suggestion) to outweigh the benefits.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-04-08T23:23:44.013" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22013" PostTypeId="2" ParentId="2140" CreationDate="2021-04-09T12:27:19.270" Score="0" Body="&lt;p&gt;Take two registers, zero-extend one to another one on x64 in a single instruction.&lt;/p&gt;&#xA;&lt;p&gt;Here, registers are &lt;code&gt;r0-r15&lt;/code&gt;(64-bit), &lt;code&gt;r0d-r15d&lt;/code&gt;(32-bit), &lt;code&gt;r0w-r15w&lt;/code&gt;(16-bit) and &lt;code&gt;r0b-r15b&lt;/code&gt;(8-bit), where regs marking same number share same lowest part. In case there's no solution (e.g. writing into r0d, which the opcode would behave writing to r0), output something obviously not an opcode.&lt;/p&gt;&#xA;&lt;p&gt;Opcodes:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;90              do nothing&#xA;89 11sssddd     move 16/32/64-bit[1] from sss[2] to ddd[2]&#xA;88 11sssddd     move 8-bit from sss[2] to ddd[2]&#xA;0F B7 11dddsss  move from 16-bit sss[2] to 32/64-bit[1] ddd[2]&#xA;0F B6 11dddsss  move from 8-bit sss[2] to 16/32/64-bit[1] ddd[2]&#xA;101101dd 00     move from 8-bit 0dd[2] to 16-bit 0dd[2]             &#xA;[WIP]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Shortest code win. -35 Bytes if you support &lt;code&gt;ax cx dx bx sp bi sp di&lt;/code&gt; aliasing &lt;code&gt;r0w-r7w&lt;/code&gt;, and &lt;code&gt;rax-rdi&lt;/code&gt; as &lt;code&gt;r0-r7&lt;/code&gt;, &lt;code&gt;eax-edi&lt;/code&gt; as &lt;code&gt;r0d-r7d&lt;/code&gt;; - another 35 Bytes if you support &lt;code&gt;al cl dl bl&lt;/code&gt; aliasing &lt;code&gt;r0b-r3b&lt;/code&gt; and &lt;code&gt;ah ch dh bh&lt;/code&gt; as theoretically &lt;code&gt;r4b-r7b&lt;/code&gt; but without REXs.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2021-04-09T12:27:19.270" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22014" PostTypeId="5" CreationDate="2021-04-09T16:16:22.473" Score="0" Body="&lt;p&gt;This tag should be used on questions that relate specifically to a community-organised and themed blog.&lt;/p&gt;&#xA;&lt;p&gt;Questions about &lt;a href=&quot;https://stackoverflow.blog/&quot;&gt;The Overflow&lt;/a&gt;, the blog written by Stack Exchange employees, should be asked on Mother Meta, unless they specifically relate to this site exclusively. In such cases, use the &lt;a href=&quot;/questions/tagged/overflow-blog&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;overflow-blog&amp;#39;&quot; rel=&quot;tag&quot;&gt;overflow-blog&lt;/a&gt; tag.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-09T16:16:22.473" LastActivityDate="2021-04-09T16:16:22.473" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22015" PostTypeId="4" CreationDate="2021-04-09T16:16:22.473" Score="0" Body="For discussion about a community blog." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-09T16:16:22.473" LastActivityDate="2021-04-09T16:16:22.473" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22016" PostTypeId="2" ParentId="2140" CreationDate="2021-04-09T17:16:37.157" Score="0" Body="&lt;h1&gt;Make an image with the pixels from another (WIP)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Given a target image and a source image, output an image that resembles the target image by rearranging the pixels of the source image.&lt;/p&gt;&#xA;&lt;p&gt;You will be scored based on speed and accuracy.&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;score = {similarity(Image_{target}, Image_{result}) \times {time_{reference} \over time_{program}}}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Higher scores are better&lt;/p&gt;&#xA;" OwnerUserId="45613" LastActivityDate="2021-04-09T17:16:37.157" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22017" PostTypeId="2" ParentId="2140" CreationDate="2021-04-10T17:07:04.560" Score="0" Body="&lt;p&gt;On a 150x150 area, each cell have 15% probable of being a mine. Opening a safe(non-mine) cell tells you amount of mines with &amp;lt;1.5 distance. Opening a mine makes you fail. Find most safe cells in 5 second.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2021-04-10T17:07:04.560" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22018" PostTypeId="2" ParentId="2140" CreationDate="2021-04-10T19:50:28.870" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/223463/16484&quot;&gt;Basic Typescript Types&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="16484" LastEditorUserId="16484" LastEditDate="2021-04-14T10:16:43.090" LastActivityDate="2021-04-14T10:16:43.090" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22020" PostTypeId="2" ParentId="2140" CreationDate="2021-04-11T07:06:12.860" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/223366/the-meeker-number-sequence&quot;&gt;The Meeker numbers sequence&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="92116" LastEditorUserId="92116" LastEditDate="2021-04-13T08:14:51.353" LastActivityDate="2021-04-13T08:14:51.353" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22021" PostTypeId="2" ParentId="2140" CreationDate="2021-04-11T08:45:06.497" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/223439/r-e-p-a-i-r-t-h-e-k-e-y-b-o-a-r-d&quot;&gt;R.E.P.A.I.R. T.H.E. K.E.Y.B.O.A.R.D.&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="92116" LastEditorUserId="92116" LastEditDate="2021-04-14T06:09:05.150" LastActivityDate="2021-04-14T06:09:05.150" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="22022" PostTypeId="2" ParentId="2140" CreationDate="2021-04-11T10:00:36.063" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/223789/non-hamming-numbers&quot;&gt;Non-Hamming numbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerDisplayName="user100411" LastEditorDisplayName="user100411" LastEditDate="2021-04-18T22:15:32.407" LastActivityDate="2021-04-18T22:15:32.407" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22023" PostTypeId="2" ParentId="2140" CreationDate="2021-04-11T15:15:27.040" Score="2" Body="&lt;h1&gt;Saboteurs in our Halls&lt;/h1&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenge, where one member on each team attempts to sabotage their team in secret.&lt;/p&gt;&#xA;&lt;p&gt;Similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/48353/red-vs-blue-pixel-team-battlebots&quot;&gt;Red vs. Blue - Pixel Team Battlebots&lt;/a&gt;, bots will be divided into teams, based on the user ID number of the user who posted them. Your user ID can be found by navigating to your profile (click your icon in the top bar) and looking at the URL:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;https://codegolf.stackexchange.com/users/[user-id]/[display-name]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For example, my user ID is &lt;code&gt;66833&lt;/code&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/caird-coinheringaahing&quot;&gt;&lt;code&gt;https://codegolf.stackexchange.com/users/66833/caird-coinheringaahing&lt;/code&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;If your ID is an &lt;strong&gt;even number&lt;/strong&gt;, then you are on the &lt;strong&gt;Red team&lt;/strong&gt;.&lt;br /&gt;&#xA;If your ID is an &lt;strong&gt;odd number&lt;/strong&gt;, then you are on the &lt;strong&gt;Blue team&lt;/strong&gt;.&lt;br /&gt;&#xA;There is no way to change teams.&lt;/p&gt;&#xA;&lt;p&gt;As you cannot change your user ID, and to prevent one team flooding the field with bots, &lt;strong&gt;each user may only submit one bot&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;How the KotH will work&lt;/h2&gt;&#xA;&lt;p&gt;At the start of the game, each bot will be placed in a random cell in a &lt;span class=&quot;math-container&quot;&gt;\$1000\times1000\$&lt;/span&gt; cell grid. No bot will be placed on the same cell as another bot, or within 5 cells of another bot. Additionally, &lt;span class=&quot;math-container&quot;&gt;\$999\$&lt;/span&gt; random cells will be filled with &lt;strong&gt;1 food&lt;/strong&gt;. These cells may be any cell on the board that doesn't contain a bot.&lt;/p&gt;&#xA;&lt;p&gt;The aim of the game is to collect food. Each bot will navigate their way around the grid, attempting to gather food. The team with the most food at the end of the game wins.&lt;/p&gt;&#xA;&lt;p&gt;However, one bot will actually be a &lt;em&gt;saboteur&lt;/em&gt;. This bot will appear to be a member of one team, but will instead act in a manner that helps the other team. When writing your bot, you should consider the existing bots on the opposing team and try to write in a sabotage tactic that will help them without being overly obvious.&lt;/p&gt;&#xA;&lt;p&gt;Let's say that for this specific match, the saboteur is Blue. Their actions should aim to help the Red team win, while not giving themselves away to the Blue team. If either team suspects that bot to be the saboteur, they can then act in a preventative manner towards that bot. If Blue wins, the saboteur has failed, and so will get no points when the rest of Blue does. If Red wins, then the saboteur has succeeded, and thus gets 2 points. No matter which team the saboteur is on, each member of the winning team always gets 1 point.&lt;/p&gt;&#xA;&lt;p&gt;Which bot is the saboteur is randomly chosen at the start of the game and remains constant until the game ends. There is only ever one saboteur per game.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;The game is broken up into &lt;em&gt;turns&lt;/em&gt;. Each team acts on alternating turns, so Red moves, then Blue, then Red etc. or the other way around. Each turn, each bot will be passed a list of game data, detailed below, and will return an integer between &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$9\$&lt;/span&gt; inclusive, indicating which direction it would like to move in:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/M0xLS.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/M0xLS.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The bot is at &lt;span class=&quot;math-container&quot;&gt;\$5\$&lt;/span&gt; before moving.&lt;/p&gt;&#xA;&lt;p&gt;The bots for each team are called in a random order each turn, but none of them move until they all have returned values.&lt;/p&gt;&#xA;&lt;p&gt;After all bots in a team have returned their movement choice, all moves happen at the same time. If two bots on the same team attempt to move into the same cell, neither bot moves. If a bot tries to move out of bounds, nothing happens. If a bot moves into a cell with food, it adds that piece of food to the amount it has already gathered. Initially, all bots have gathered &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; food.&lt;/p&gt;&#xA;&lt;p&gt;If a bot moves into a cell containing an enemy bot, the two bots &lt;em&gt;fight&lt;/em&gt;. The winner is determined by which bot has gathered the most food. The winner then &amp;quot;steals&amp;quot; the losers food, adding it to their total gathered food. The loser is then removed from the board and re-placed at a random location not within 5 cells of another bot, and with an initial &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; food again. If both bots have the same amount of food, then both bots are removed and re-placed, and any food they had is randomly placed in empty cells around the board.&lt;/p&gt;&#xA;&lt;p&gt;After &lt;span class=&quot;math-container&quot;&gt;\$10000\$&lt;/span&gt; turns, the game ends. Each team has their total gathered food counted, and the team with the most food wins. The actual competition will have &lt;span class=&quot;math-container&quot;&gt;\$100\$&lt;/span&gt; games played. If a team wins a game, each team member receives 1 point. However, if the saboteur's team (the one it's on, not the team it's helping) wins, the saboteur does not get this point. If the saboteur's team &lt;em&gt;loses&lt;/em&gt;, the saboteur gains 2 points.&lt;/p&gt;&#xA;&lt;p&gt;The team with the most total points of all its bots at the end of &lt;span class=&quot;math-container&quot;&gt;\$100\$&lt;/span&gt; games wins.&lt;/p&gt;&#xA;&lt;h2&gt;How to answer&lt;/h2&gt;&#xA;&lt;p&gt;You should include in your answer 2 functions: &lt;code&gt;move&lt;/code&gt; and &lt;code&gt;sabotage&lt;/code&gt;. &lt;code&gt;move&lt;/code&gt; is the function that will be called each turn when you aren't the saboteur and &lt;code&gt;sabotage&lt;/code&gt; will be called each turn that you &lt;em&gt;are&lt;/em&gt; the saboteur.&lt;/p&gt;&#xA;&lt;p&gt;Both functions will receive the same arguments:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt;. The &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; coordinates of your bot, each an integer between &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; (top-left corner) and &lt;span class=&quot;math-container&quot;&gt;\$999\$&lt;/span&gt; (bottom-right corner).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;food&lt;/code&gt;. The current amount of food you are carrying. Initially 0, and changed by the controller for you when necessary.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;t_near&lt;/code&gt;. A list of bots on your team within a square, side length 33 cells, centered on you. Each bot is represented by a list containing their &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; coordinates, the amount of food they're currently carrying, and the CGCC ID of their poster.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;e_near&lt;/code&gt;. A list of bots n the opposing team within a square, side length 33 cells, centered on you. Each bot is represented by a list containing their &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; coordinates, the amount of food they're currently carrying, and the CGCC ID of their poster.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;f_near&lt;/code&gt;. A list of coordinates of all food within a square, side length 33 cells, centered on you. Each food is represented by a pair &lt;code&gt;[x, y]&lt;/code&gt; representing it's coordinates&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;team_chat&lt;/code&gt;. A list of all chat messages sent between your team.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Messages&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;In order to allow inter-game cooperation, each team will have a &amp;quot;chat&amp;quot; ability. Each bot will be passed &lt;code&gt;team_chat&lt;/code&gt;, an array containing the chat history of that team - i.e. a series of strings saying more-or-less whatever you want. The most recent message will be at the end of the array. Each bot may, on each turn, append up to 3 messages to the chat. Each message must be no longer than 100 characters, and will be prefixed with the ID of the bot who sent it (with a space after the ID).&lt;/p&gt;&#xA;&lt;p&gt;For example, if a bot with a user ID of 1234 sent &lt;code&gt;Hello, World!&lt;/code&gt; to the chat, the message would be &lt;code&gt;1234 Hello, World!&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Example Submission&lt;/h2&gt;&#xA;&lt;p&gt;This is Joey. Joey isn't too smart, and hasn't got the hang of proper sabotage. If not the saboteur, Joey just hunkers down and waits for the game to end. Otherwise, he moves around the board aimlessly in random directions:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;import random&#xA;&#xA;def move(x, y, food, t_near, e_near, f_near, team_chat):&#xA;&amp;#9;return 5&#xA;&#xA;def sabotage(x, y, food, t_near, e_near, f_near, team_chat):&#xA;&amp;#9;return random.randint(1, 9)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;Any attempted gaming of the rules will lead to a disqualification of your bot. If you break any rules, your bot will be disqualified until it is fixed (if possible).&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;You may only edit your answer within 12 hours of posting&lt;/strong&gt; to prevent answers that continually optimise against new bots.&#xA;You may not delete and repost your answer in order to try to circumvent this restriction&lt;/li&gt;&#xA;&lt;li&gt;Your code must not take longer than half a second (give or take a few milliseconds) to return its move&lt;/li&gt;&#xA;&lt;li&gt;You may not attempt to modify the controller or other bots' code; attempt to communicate outside of using the team chats; make web queries; or do anything malicious.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I'll keep an eye out for other unsportsmanlike behaviour, such as stealing code verbatim from other answers or using sock puppets to mess with the other team.&lt;/p&gt;&#xA;&lt;p&gt;You are welcome to collaborate and scheme with your team, but keep the contest friendly and ethical. We don't need or want this to devolve into anarchy.&lt;/p&gt;&#xA;&lt;p&gt;You will have 2 weeks from the posting of the challenge to submit bots. After which time, I'll run 100 games with 10000 turns each and determine the winner&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;I'm not sure whether to write this in Python or Javascript. On the one hand, I'm better at Python, but Javascript is more popular/used. Thoughts?&lt;/li&gt;&#xA;&lt;li&gt;Tags are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;. Suggestions?&lt;/li&gt;&#xA;&lt;li&gt;Any further feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-12T13:32:27.807" LastActivityDate="2021-04-12T13:32:27.807" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22024" PostTypeId="2" ParentId="2140" CreationDate="2021-04-11T15:49:36.957" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224109/largest-compatible-maze&quot;&gt;Largest Compatible Maze&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="82619" LastEditorUserId="82619" LastEditDate="2021-04-21T20:27:09.250" LastActivityDate="2021-04-21T20:27:09.250" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22025" PostTypeId="2" ParentId="2140" CreationDate="2021-04-11T15:59:17.763" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/223539/matching-homologous-groups&quot;&gt;Matching to Homologous group&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="92116" LastEditorUserId="92116" LastEditDate="2021-04-15T06:50:36.117" LastActivityDate="2021-04-15T06:50:36.117" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22026" PostTypeId="5" CreationDate="2021-04-11T16:10:09.267" Score="0" Body="&lt;p&gt;Use this tag on questions that are either about:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The 5 specific close reasons set by the site&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&amp;quot;Not suitable for the site&amp;quot;: the challenge does not fall under the scope of questions on the site (i.e. it is not a programming challenge with an objective winning criteria)&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Duplicate&amp;quot;: the challenge has already been asked on the site&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Needs details or clarity&amp;quot;: it is difficult to understand crucial parts of the challenge, and it has been closed until those ambiguities have been fixed&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Opinion-based&amp;quot;: key parts of the challenge depend entirely on someone's opinion, most often the challenge author's&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;Needs more focus&amp;quot;: the challenge is too broad and may contain multiple unrelated parts&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The reason(s) why a specific challenge was closed. In which case, use this along side the &lt;a href=&quot;/questions/tagged/closed-questions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;closed-questions&amp;#39;&quot; rel=&quot;tag&quot;&gt;closed-questions&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/specific-questions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;specific-questions&amp;#39;&quot; rel=&quot;tag&quot;&gt;specific-questions&lt;/a&gt; tag&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-11T16:10:09.267" LastActivityDate="2021-04-11T16:10:09.267" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22027" PostTypeId="4" CreationDate="2021-04-11T16:10:09.267" Score="0" Body="For questions that relate to the reasons behind closing a challenge/challenges" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-11T16:10:09.267" LastActivityDate="2021-04-11T16:10:09.267" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22028" PostTypeId="5" CreationDate="2021-04-11T22:43:44.543" Score="0" Body="&lt;p&gt;Commenting is a privilege available to any user with 50 or more reputation, allowing you to leave &amp;quot;comments&amp;quot; below any post. No matter your reputation, you are always able to comment below your own posts.&lt;/p&gt;&#xA;&lt;p&gt;Use this tag on &lt;a href=&quot;/questions/tagged/support&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt; questions about the commenting system, or on other questions specifically about comments&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-11T22:43:44.543" LastActivityDate="2021-04-11T22:43:44.543" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22029" PostTypeId="4" CreationDate="2021-04-11T22:43:44.543" Score="0" Body="For questions about the commenting system, such as how it works and what the appropriate usage is" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-11T22:43:44.543" LastActivityDate="2021-04-11T22:43:44.543" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22030" PostTypeId="5" CreationDate="2021-04-11T23:36:22.643" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/questions/11740/what-are-community-wiki-posts&quot;&gt;Community Wiki&lt;/a&gt; is a feature which indicates removal of ownership from a post. This prevents any reputation from being awarded to the original post author, and allows any user with 100 reputation or more to edit the post without having their edit &lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits&quot;&gt;reviewed&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9692/66833&quot;&gt;Community Wiki is not a reputation waiver&lt;/a&gt;, however. Unless the answer is specifically intended as a post to be edited repeatedly by multiple users, it likely should not be Community Wiki.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-11T23:36:22.643" LastActivityDate="2021-04-11T23:36:22.643" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22031" PostTypeId="4" CreationDate="2021-04-11T23:36:22.643" Score="0" Body="For questions about the Community Wiki feature. Community Wiki is a special mode posts can be placed in that lowers the barrier for editing, and prevents the poster from gaining or losing reputation" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-11T23:36:22.643" LastActivityDate="2021-04-11T23:36:22.643" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22032" PostTypeId="2" ParentId="2140" CreationDate="2021-04-12T02:43:25.303" Score="0" Body="&lt;h1&gt;Packing numbers to interval&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Interval notation is a way to write complicated range bounds more conveniently and concisely than writing an inequality.&lt;/p&gt;&#xA;&lt;p&gt;Like a list &lt;code&gt;1, 2, 3, 4&lt;/code&gt; can be written like &lt;code&gt;[1,4]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;There have been already challenges on interpreting interval notations to number ranges, but now we will do the reverse.&lt;/p&gt;&#xA;&lt;p&gt;Some examples (test cases):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Input will be a list of numbers (can be positive, negative, 0, but not fractions)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Input list can be unsorted&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If there is gap between the numbers (I mean in a list like &lt;code&gt;1,2,5,6&lt;/code&gt;, &lt;code&gt;3,4&lt;/code&gt; is missing), you have to write multiple intervals seperate by Union sign (&lt;code&gt;U&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There will be no leading 0s in input numbers&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If there is only one number seperate in an interval (I mean like &lt;code&gt;2&lt;/code&gt; in the list of &lt;code&gt;2,5,6,7&lt;/code&gt;) then make a seperate interval (for the example &lt;code&gt;[2]U[5,7]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The intervals should go from smallest to largest (for example &lt;code&gt;1 2 5 6&lt;/code&gt;, &lt;code&gt;[1,2]U[5,6]&lt;/code&gt; is valid but &lt;code&gt;[5,6]U[1,2]&lt;/code&gt; not.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Input numbers can be separated by anything, it is up to you.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3 4 -&amp;gt; [1,4]&#xA;5 3 4 1 2 -&amp;gt; [1,5]&#xA;2 1 6 5 -&amp;gt; [1,2]U[5,6]&#xA;6 7 9 8 -4 -2 -3 0 2 1 -&amp;gt; [-2,-4]U[-0,2]U[6,9]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Standard loopholes apply, shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="92116" LastActivityDate="2021-04-12T02:43:25.303" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22033" PostTypeId="2" ParentId="2140" CreationDate="2021-04-12T03:02:26.530" Score="0" Body="&lt;h1&gt;Two player tic-tac-toe game&lt;/h1&gt;&#xA;&lt;p&gt;Create a Tic-Tac-Toe game that allows two human players to play against each other.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The drawn board can be either in ASCII or graphical (You can use 1-9 digits as a place holder in tic tac toe board)&lt;/li&gt;&#xA;&lt;li&gt;Program should randomly choose whose turn is first and randomly give two players X or O&lt;/li&gt;&#xA;&lt;li&gt;let both users know whose turn it is amd prompt for input&lt;/li&gt;&#xA;&lt;li&gt;Check for winning, and when one player is won, let them both know about win (same for draw game)&lt;/li&gt;&#xA;&lt;li&gt;Enforce all tic-tac-toe rules&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Standard loopholes apply, shortest code wins&lt;/p&gt;&#xA;" OwnerUserId="92116" LastActivityDate="2021-04-12T03:02:26.530" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22034" PostTypeId="2" ParentId="2140" CreationDate="2021-04-12T04:26:42.877" Score="1" Body="&lt;h1&gt;Exchange of money in least notes&lt;/h1&gt;&#xA;&lt;p&gt;Suppose A and B are two good friends. A has borrowed &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; dollar from B. Now B wants the money back from A and A is also ready to give it. But the problem is A has only &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; dollar notes and B has &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt; dollar notes. They both want to keep the number of notes in exchange as low as possible.&lt;/p&gt;&#xA;&lt;p&gt;As an example if &lt;span class=&quot;math-container&quot;&gt;\$n=37\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$x=5\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$y=2\$&lt;/span&gt;, then the least amount of notes in exchange will be nine 5 dollar noted from A then four 2 dollar notes from B will make 37. This solution is found through brute forcing with a python program.&lt;/p&gt;&#xA;&lt;p&gt;Here in the challenge your input will be values of &lt;span class=&quot;math-container&quot;&gt;\$n, x, y\$&lt;/span&gt; and output should be the least of amount of notes as possible for A, B. A will give notes first and B later. Input and output seperator can be anything, no leading zeros in input numbers, no negative numbers in input. Standard loopholes apply and shortest code wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test Cases&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;37 5 2 -&amp;gt; 9 4&#xA;89 3 8 -&amp;gt; 35 8&#xA;100 12 7 -&amp;gt; 13 8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="92116" LastActivityDate="2021-04-12T04:26:42.877" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22035" PostTypeId="2" ParentId="2140" CreationDate="2021-04-12T05:01:27.827" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/223880/print-every-code-golf-tag&quot;&gt;posted lol&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2021-04-20T00:17:23.330" LastActivityDate="2021-04-20T00:17:23.330" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="22036" PostTypeId="2" ParentId="2140" CreationDate="2021-04-12T05:14:15.897" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224000/are-all-the-items-the-same/224001#224001&quot;&gt;Posted&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2021-04-21T01:42:22.847" LastActivityDate="2021-04-21T01:42:22.847" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="22037" PostTypeId="2" ParentId="2140" CreationDate="2021-04-12T05:58:06.020" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224235/execute-a-befunge-chess-board&quot;&gt;diddly darn posted&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2021-04-23T00:32:10.030" LastActivityDate="2021-04-23T00:32:10.030" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="22038" PostTypeId="2" ParentId="2140" CreationDate="2021-04-12T08:01:28.777" Score="2" Body="&lt;h1&gt;Draw the flag of Bangladesh&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The flag of Bangladesh is very simple. It looks like below:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/JaXP4.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/JaXP4.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The flag will be in bottle green (#006a4e) and rectangular in size in the proportion of length to width of 10:6, with a red circle in near middle. The red circle will have a radius of one-fifth of the length of the flag. This image will help you to understand the proportions properly:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/U4J11.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/U4J11.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this Graphical output challenge, you need to draw the flag of Bangladesh like first image. Standard loopholes apply, Shortest code wins.&lt;/p&gt;&#xA;&lt;p&gt;Resolution cannot be 0px, or &lt;code&gt;echo&lt;/code&gt; style answers not supported.&lt;/p&gt;&#xA;&lt;p&gt;Minimum resolution is &lt;code&gt;286*176&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="92116" LastEditorUserId="92116" LastEditDate="2021-04-12T10:32:56.623" LastActivityDate="2021-04-12T10:32:56.623" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="22039" PostTypeId="2" ParentId="2140" CreationDate="2021-04-12T12:49:56.613" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/223558&quot;&gt;Interpret control characters like a terminal&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2021-04-15T13:59:19.030" LastActivityDate="2021-04-15T13:59:19.030" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="22040" PostTypeId="2" ParentId="2140" CreationDate="2021-04-12T16:00:16.420" Score="2" Body="&lt;h1&gt;Make it prime with the smallest suffix&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/223564/45613&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2021-04-15T15:14:17.850" LastActivityDate="2021-04-15T15:14:17.850" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22041" PostTypeId="2" ParentId="2140" CreationDate="2021-04-12T16:24:54.980" Score="0" Body="&lt;p&gt;Given a table(2D array of strings), arrange width of each column to shorten total width, such that containment in each cell can be fully shown with a space after it, being allowed to occupy next several cells if they are empty. In another word, for each column provide a width &lt;span class=&quot;math-container&quot;&gt;\$W_j\$&lt;/span&gt;, making &lt;span class=&quot;math-container&quot;&gt;\$\sum_jW_j\$&lt;/span&gt; smallest, and for each non-empty cell in column &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt; , if there're &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; empty cells on adjacent right, then its length is smaller than &lt;span class=&quot;math-container&quot;&gt;\$\sum_{j=i}^{i+k}W_j\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Samples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;1234&amp;quot;, &amp;quot;&amp;quot;  =&amp;gt; [2,3] &amp;quot;1234 &#xA;&amp;quot;a&amp;quot;   , &amp;quot;b&amp;quot;           a b  &amp;quot;&#xA;&#xA;&amp;quot;Date&amp;quot;  , &amp;quot;&amp;quot;  , &amp;quot;Sum&amp;quot;            &amp;quot;Date   Sum&#xA;&amp;quot;Mar&amp;quot;   , &amp;quot;1&amp;quot; , &amp;quot;220&amp;quot;             Mar 1  220&#xA;&amp;quot;Mar&amp;quot;   , &amp;quot;15&amp;quot;, &amp;quot;130&amp;quot; =&amp;gt; [4,3,4]  Mar 15 130&#xA;&amp;quot;Apr&amp;quot;   , &amp;quot;3&amp;quot; , &amp;quot;100&amp;quot;             Apr 3  100&#xA;&amp;quot;Sum_Up&amp;quot;, &amp;quot;&amp;quot;  , &amp;quot;450&amp;quot;             Sum_Up 450 &amp;quot;&#xA;&#xA;&amp;quot;aaa&amp;quot; &amp;quot;&amp;quot;    &amp;quot;&amp;quot;               &amp;quot;aaa&#xA;&amp;quot;&amp;quot;    &amp;quot;bbb&amp;quot; &amp;quot;&amp;quot;    =&amp;gt; [0,0,4]  bbb&#xA;&amp;quot;&amp;quot;    &amp;quot;&amp;quot;    &amp;quot;ccc&amp;quot;             ccc&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2021-04-13T16:03:02.000" LastActivityDate="2021-04-13T16:03:02.000" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22042" PostTypeId="5" CreationDate="2021-04-12T21:47:57.827" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; is a challenge type where two groups compete against each other:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;One aims to produce valid answers which are as &amp;quot;good&amp;quot; as possible by some criterion (the cops)&lt;/li&gt;&#xA;&lt;li&gt;The other aims to invalidate (or crack) existing answers (the robbers)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This tag should be used on questions that specifically relate to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; challenges, such as asking for clarification on specific terms relevant to the challenge format.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-12T21:47:57.827" LastActivityDate="2021-04-12T21:47:57.827" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22043" PostTypeId="4" CreationDate="2021-04-12T21:47:57.827" Score="0" Body="From questions specifically about [cops-and-robbers] challenges. Note that [cops-and-robbers] challenges should be posted to the main site or the Sandbox, not here" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-12T21:47:57.827" LastActivityDate="2021-04-12T21:47:57.827" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22044" PostTypeId="2" ParentId="2140" CreationDate="2021-04-12T22:41:48.043" Score="3" Body="&lt;h1&gt;Rob the King: Hexagonal Mazes&lt;/h1&gt;&#xA;&lt;p&gt;Consider the following hexagonal maze:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;     E . \ . . .&#xA;    . . . \ . \ .&#xA;   . . . . \ . \ .&#xA;  _ _ _ _ . \ . \ .&#xA; . / . . . . . . | .&#xA;. | . . _ _ _ _ / . .&#xA; . \ . \ . . . / . .&#xA;  . \ . \ . . / . .&#xA;   . \ . \ . . . .&#xA;    . \ . \ / . .&#xA;     . \ . | . X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;E&lt;/code&gt; represents the entrance, &lt;code&gt;X&lt;/code&gt; the exit. &lt;code&gt;|_/\&lt;/code&gt; are walls and &lt;code&gt;.&lt;/code&gt; are free spaces. In order to navigate from &lt;code&gt;E&lt;/code&gt; to &lt;code&gt;X&lt;/code&gt;, we can move to any free space in the up to 6 immediately surrounding spaces. The path from &lt;code&gt;E&lt;/code&gt; to &lt;code&gt;X&lt;/code&gt;, marked with &lt;code&gt;P&lt;/code&gt; is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;     E P \ P P P&#xA;    . . P \ P \ P&#xA;   . . . P \ P \ P&#xA;  _ _ _ _ P \ P \ P&#xA; . / . . . P P P | P&#xA;. | . . _ _ _ _ / . P&#xA; . \ . \ . . . / . P&#xA;  . \ . \ . . / . P&#xA;   . \ . \ . . . P&#xA;    . \ . \ / . P&#xA;     . \ . | . X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This isn't the only path, but the others are trivial variations on it.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Cops&lt;/h1&gt;&#xA;&lt;p&gt;You are to write a function in Python 3 which takes a positive integer &lt;span class=&quot;math-container&quot;&gt;\$n \ge 2\$&lt;/span&gt; and returns a hexagonal maze of side-length &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, as shown above. The maze will meet the following criteria:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The only characters in the output are &lt;code&gt;EX.|_\/&lt;/code&gt;, space and newline&lt;/li&gt;&#xA;&lt;li&gt;The hexagon is shown as a hexagon. That means:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; lines will have one more non-space character than the previous line (the first has &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; non-space characters), separated by a single space, and offset from adjacent lines&lt;/li&gt;&#xA;&lt;li&gt;The first &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; lines have one fewer leading space than the previous line (the first line has &lt;span class=&quot;math-container&quot;&gt;\$n - 1\$&lt;/span&gt; leading spaces)&lt;/li&gt;&#xA;&lt;li&gt;The next &lt;span class=&quot;math-container&quot;&gt;\$n - 1\$&lt;/span&gt; lines have one more leading space than the previous line&lt;/li&gt;&#xA;&lt;li&gt;The next &lt;span class=&quot;math-container&quot;&gt;\$n - 1\$&lt;/span&gt; lines will have one fewer non-space character than the previous line, separated by a single space, and offset from adjacent lines&lt;/li&gt;&#xA;&lt;li&gt;Lines may not have trailing whitespace&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The &lt;code&gt;E&lt;/code&gt; is the first non-space character on the first line, and the &lt;code&gt;X&lt;/code&gt; is the last non-space character on the last line&lt;/li&gt;&#xA;&lt;li&gt;There is at least 1 valid path that connects the &lt;code&gt;E&lt;/code&gt; and the &lt;code&gt;X&lt;/code&gt;, only moving from one free space to an adjacent free space.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;How your program generates these mazes is entirely up to you. It could randomly places walls in the grid, ensuring there is always at least one path left, or it could only block the center row except for one gap, or anything else.&lt;/p&gt;&#xA;&lt;p&gt;You may return either a multi-line string, or a list of lines. Lines should have appropriate space padding at the start, and may have a consistent amount of trailing spaces. &amp;quot;Consistent&amp;quot; here means either the same number on each line, or padding each line to the same length.&lt;/p&gt;&#xA;&lt;p&gt;The Robbers will be writing maze-solving programs that try to solve your mazes, so you should aim to generate mazes that are somewhat difficult to solve.&lt;/p&gt;&#xA;&lt;p&gt;This is not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, you are under no obligation to golf your submission.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, you may submit multiple submissions. You may not include anything in your submission that attempts to communicate with other submissions, attempts to interfere with other submissions or the controller or anything that could be malicious. If you do, your submission will be disqualified&lt;/p&gt;&#xA;&lt;p&gt;Empty mazes of sizes &lt;span class=&quot;math-container&quot;&gt;\$n = 2, 3, 4, 5, 6\$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;                                                                 E . . . . .&#xA;                                           E . . . .            . . . . . . .&#xA;                         E . . .          . . . . . .          . . . . . . . .&#xA;           E . .        . . . . .        . . . . . . .        . . . . . . . . .&#xA; E .      . . . .      . . . . . .      . . . . . . . .      . . . . . . . . . .&#xA;. . .    . . . . .    . . . . . . .    . . . . . . . . .    . . . . . . . . . . .&#xA; . X      . . . .      . . . . . .      . . . . . . . .      . . . . . . . . . .&#xA;           . . X        . . . . .        . . . . . . .        . . . . . . . . .&#xA;                         . . . X          . . . . . .          . . . . . . . .&#xA;                                           . . . . X            . . . . . . .&#xA;                                                                 . . . . . X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Robbers&lt;/h1&gt;&#xA;&lt;p&gt;You are to write a Python 3 function that takes in the return value of a cop's answer. It may also take the number of sides, &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, as an argument if you so wish. The input will only contain &lt;code&gt;EX_|/\.&lt;/code&gt; and space, and newlines if inputting as a multiline string. It will either be a multiline string or a list of lines. Your function should handle both.&lt;/p&gt;&#xA;&lt;p&gt;Your function should then output the maze with any valid path connecting the &lt;code&gt;E&lt;/code&gt; and &lt;code&gt;X&lt;/code&gt; using only connected free spaces. You may show the path with any character aside from &lt;code&gt;EX_|/\.&lt;/code&gt;, space or newline.&lt;/p&gt;&#xA;&lt;p&gt;This is not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, you are under no obligation to golf your submission.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, you may submit multiple submissions. You may not include anything in your submission that attempts to communicate with other submissions, attempts to interfere with other submissions or the controller or anything that could be malicious. If you do, your submission will be disqualified&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;The scoring will take the form of a round-robin, similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenges. Every cop will be paired up with every robber, and the following will happen with each pair:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The controller will call the cop's function 5 times with &lt;span class=&quot;math-container&quot;&gt;\$n = 2\$&lt;/span&gt; as an argument, saving each of the 5 mazes. The cop will have 1 minute to produce each maze&lt;/li&gt;&#xA;&lt;li&gt;It will then pass each maze to the robber to solve. The robber will have 1 minute per maze to produce a correct output.&lt;/li&gt;&#xA;&lt;li&gt;If all 5 mazes are correctly solved by the robber within 1 minute each, the controller goes again, but with &lt;span class=&quot;math-container&quot;&gt;\$n = 3\$&lt;/span&gt;, and so on, increasing the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; by one, until either:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The robber fails to solve a maze within 1 minute&lt;/li&gt;&#xA;&lt;li&gt;The robber produces an incorrect solution to an input maze&lt;/li&gt;&#xA;&lt;li&gt;The cop fails to return a maze within 1 minute&lt;/li&gt;&#xA;&lt;li&gt;The cop returns a maze with no path&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;At this point, both the cop and the robber receive points equal to the highest &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; that neither of them failed. If the cop failed, the robber receives an additional point, and if the robber failed, the cop receives an additional point instead.&lt;/p&gt;&#xA;&lt;p&gt;If both the cop and the robber reach &lt;span class=&quot;math-container&quot;&gt;\$n = 50\$&lt;/span&gt; without failing, they both receive &lt;span class=&quot;math-container&quot;&gt;\$50\$&lt;/span&gt; points.&lt;/p&gt;&#xA;&lt;p&gt;After all pairs have be run, the cop and robber with the most points are the respective winners&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Thoughts? I'm not aware of any similar challenges that combine &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, other than &lt;a href=&quot;https://codegolf.stackexchange.com/q/51029/66833&quot;&gt;this&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Is this clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Tags are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hexagonal-grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hexagonal-grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;hexagonal-grid&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/maze&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;maze&amp;#39;&quot; rel=&quot;tag&quot;&gt;maze&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot;&gt;python&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Any further feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-23T15:48:52.940" LastActivityDate="2021-04-23T15:48:52.940" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="22045" PostTypeId="1" CreationDate="2021-04-13T00:00:03.527" Score="11" ViewCount="586" Body="&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; is getting four new room owners. You've had a week for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/21972/new-room-owners-for-tnb-nominations-phase&quot;&gt;nominations&lt;/a&gt;, and now it's time to vote. In alphabetical order, here are the nominees:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Adám&lt;/strong&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://chat.stackexchange.com/users/130368&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/users/43319&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/43319&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/21986&quot;&gt;nomination&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/22046&quot;&gt;vote here&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Bubbler&lt;/strong&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://chat.stackexchange.com/users/337270&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/21978&quot;&gt;nomination&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/22047&quot;&gt;vote here&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;caird coinheringaahing&lt;/strong&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://chat.stackexchange.com/users/274572&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/users/66833&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/66833&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/21976&quot;&gt;nomination&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/22048&quot;&gt;vote here&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Lyxal&lt;/strong&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://chat.stackexchange.com/users/354515&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78850&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/21974&quot;&gt;nomination&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/22049&quot;&gt;vote here&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Redwolf Programs&lt;/strong&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://chat.stackexchange.com/users/347075&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/users/79857&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/79857&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/21975&quot;&gt;nomination&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/22050&quot;&gt;vote here&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;user&lt;/strong&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://chat.stackexchange.com/users/468262&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/95792&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/21977&quot;&gt;nomination&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/22051&quot;&gt;vote here&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Wasif&lt;/strong&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://chat.stackexchange.com/users/448660&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/users/92116&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/92116&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/21982&quot;&gt;nomination&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/22052&quot;&gt;vote here&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Wezl&lt;/strong&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://chat.stackexchange.com/users/456827&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/users/90614&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/90614&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/21973&quot;&gt;nomination&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/22053&quot;&gt;vote here&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Each candidate has an answer below. You may vote on as many as you want, and the candidates are welcome to vote as well, including for (or against) themselves.&lt;/p&gt;&#xA;&lt;p&gt;Voting will close in a week (UTC midnight on Tuesday, April 20th). At the end of the election, we (the moderators) will review the four candidates with the most votes for approval and instatement as new room owners.&lt;/p&gt;&#xA;&lt;p&gt;Best of luck to all candidates!&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Important note&lt;/strong&gt;: serial voting detection applies to meta as well. If you vote for several candidates within a short span of time, your votes may be automatically cancelled. Make sure you check back before the voting period closes to make sure your votes went through.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-04-19T23:59:27.947" LastActivityDate="2021-04-19T23:59:27.947" Title="Vote for your new TNB Room Owners!" Tags="|discussion|chat|moderation|" AnswerCount="8" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22046" PostTypeId="2" ParentId="22045" CreationDate="2021-04-13T00:00:43.100" Score="22" Body="&lt;h2&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/130368&quot;&gt;Adám&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/130368&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/DObmx.jpg?s=128&amp;amp;g=1&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/130368&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/users/43319&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/43319&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/21986&quot;&gt;nomination&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Chat user since 2014-10-23.&lt;/p&gt;&#xA;&lt;p&gt;429 messages this week. 285 messages last week. 303 messages per week.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-04-19T23:35:25.090" LastActivityDate="2021-04-19T23:35:25.090" CommentCount="0" CommunityOwnedDate="2021-04-13T00:00:43.100" ContentLicense="CC BY-SA 4.0" />
  <row Id="22047" PostTypeId="2" ParentId="22045" CreationDate="2021-04-13T00:02:47.733" Score="26" Body="&lt;h2&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/337270&quot;&gt;Bubbler&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/337270&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/LZVYQ.png?s=128&amp;amp;g=1&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/337270&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/21978&quot;&gt;nomination&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Chat user since 2018-02-26.&lt;/p&gt;&#xA;&lt;p&gt;53 messages this week. 45 messages last week. 75 messages per week.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-04-19T23:35:18.787" LastActivityDate="2021-04-19T23:35:18.787" CommentCount="0" CommunityOwnedDate="2021-04-13T00:02:47.733" ContentLicense="CC BY-SA 4.0" />
  <row Id="22048" PostTypeId="2" ParentId="22045" CreationDate="2021-04-13T00:04:10.613" Score="25" Body="&lt;h2&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/274572&quot;&gt;caird coinheringaahing&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/274572&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/7mQxh.jpg?s=128&amp;amp;g=1&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/274572&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/users/66833&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/66833&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/21976&quot;&gt;nomination&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Chat user since 2017-04-01.&lt;/p&gt;&#xA;&lt;p&gt;1k messages this week. 860 messages last week. 809 messages per week.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-04-19T23:35:22.077" LastActivityDate="2021-04-19T23:35:22.077" CommentCount="0" CommunityOwnedDate="2021-04-13T00:04:10.613" ContentLicense="CC BY-SA 4.0" />
  <row Id="22049" PostTypeId="2" ParentId="22045" CreationDate="2021-04-13T00:05:29.173" Score="12" Body="&lt;h2&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/354515&quot;&gt;Lyxal&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/354515&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/B5QC7.png?s=128&amp;amp;g=1&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/354515&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78850&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/21974&quot;&gt;nomination&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Chat user since 2018-05-31.&lt;/p&gt;&#xA;&lt;p&gt;876 messages this week. 639 messages last week. 489 messages per week.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-04-19T23:35:33.603" LastActivityDate="2021-04-19T23:35:33.603" CommentCount="0" CommunityOwnedDate="2021-04-13T00:05:29.173" ContentLicense="CC BY-SA 4.0" />
  <row Id="22050" PostTypeId="2" ParentId="22045" CreationDate="2021-04-13T00:06:38.070" Score="19" Body="&lt;h2&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/347075&quot;&gt;Redwolf Programs&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/347075&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/tISMB.png?s=128&amp;amp;g=1&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/347075&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/users/79857&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/79857&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/21975&quot;&gt;nomination&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Chat user since 2018-04-17.&lt;/p&gt;&#xA;&lt;p&gt;1.1k messages this week. 743 messages last week. 672 messages per week.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-04-19T23:35:30.443" LastActivityDate="2021-04-19T23:35:30.443" CommentCount="0" CommunityOwnedDate="2021-04-13T00:06:38.070" ContentLicense="CC BY-SA 4.0" />
  <row Id="22051" PostTypeId="2" ParentId="22045" CreationDate="2021-04-13T00:07:39.233" Score="8" Body="&lt;h2&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/468262&quot;&gt;user&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/468262&quot;&gt;&lt;img src=&quot;https://www.gravatar.com/avatar/e771cf76d85a213d38f3fbeda2708154?s=128&amp;amp;d=identicon&amp;amp;r=PG&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/468262&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/95792&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/21977&quot;&gt;nomination&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Chat user since 2020-06-29.&lt;/p&gt;&#xA;&lt;p&gt;941 messages this week. 516 messages last week. 684 messages per week.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-04-19T23:35:36.907" LastActivityDate="2021-04-19T23:35:36.907" CommentCount="0" CommunityOwnedDate="2021-04-13T00:07:39.233" ContentLicense="CC BY-SA 4.0" />
  <row Id="22052" PostTypeId="2" ParentId="22045" CreationDate="2021-04-13T00:08:43.583" Score="2" Body="&lt;h2&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/448660&quot;&gt;Wasif&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/448660&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/DPEmJ.jpg?s=128&amp;amp;g=1&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/448660&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/users/92116&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/92116&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/21982&quot;&gt;nomination&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Chat user since 2020-02-22.&lt;/p&gt;&#xA;&lt;p&gt;318 messages this week. 184 messages last week. 169 messages per week.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-04-19T23:35:44.307" LastActivityDate="2021-04-19T23:35:44.307" CommentCount="0" CommunityOwnedDate="2021-04-13T00:08:43.583" ContentLicense="CC BY-SA 4.0" />
  <row Id="22053" PostTypeId="2" ParentId="22045" CreationDate="2021-04-13T00:09:53.627" Score="3" Body="&lt;h2&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/456827&quot;&gt;Wezl&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/456827&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/3fAdQ.gif?s=128&amp;amp;g=1&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/456827&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/users/90614&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/90614&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/21973&quot;&gt;nomination&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Chat user since 2020-04-20.&lt;/p&gt;&#xA;&lt;p&gt;303 messages this week. 86 messages last week. 211 messages per week.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-04-19T23:35:41.140" LastActivityDate="2021-04-19T23:35:41.140" CommentCount="0" CommunityOwnedDate="2021-04-13T00:09:53.627" ContentLicense="CC BY-SA 4.0" />
  <row Id="22055" PostTypeId="2" ParentId="2140" CreationDate="2021-04-13T05:42:14.067" Score="0" Body="&lt;h1&gt;Hamming Distance Lookup Extravaganza&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Note: I was originally just going to post this, but I was having trouble coming up with a good scoring strategy. I'd like to make sure that the instructions are clear and scoring strategy is fair and works. Thanks!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Note: This question is a WIP, and some parts may be incomplete or in the middle of editing!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Story&lt;/h2&gt;&#xA;&lt;p&gt;Bitty Benny runs a clothing factory, where, among other things, he produces bundles of shirts. Each shirt has a &lt;em&gt;tag&lt;/em&gt; (don't worry, it's not itchy) describing what type of shirt it is.&lt;/p&gt;&#xA;&lt;p&gt;Similar shirts have similar tags, and Bitty Benny wants to create an organization system, that, given a tag, will fetch the shirt with the most similar tag. Each tag is the same length, and lists a series of ones and zeros. To compare how similar tags are, Bitty Benny bought a &lt;a href=&quot;https://en.wikipedia.org/wiki/Hamming_distance&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hamming Shirt Comparator (Mark II)&lt;/a&gt;. Here's a loose schematic as to how the comparator works:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;First, the Comparator takes the two tags and lays them side by side, like so:&#xA;&lt;pre&gt;&lt;code&gt;+----------+&#xA;| 10010100 |&#xA;+----------+&#xA;| 00101101 |&#xA;+----------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Then, the comparator goes through each pair of numbers and counts the number of differences:&#xA;&lt;pre&gt;&lt;code&gt;+----------+&#xA;| 10000100 |&#xA;+-|---|--|-+&#xA;| 00001101 |&#xA;+-|---|--|-+&#xA;  x   x  x : 3 differences&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The comparator then laser-engraves the difference onto a marble stone tablet. Some argue that the Mark I was better, because it printed out results instead, but Bitty Benny likes the satisfying thunk of the tablet as it falls from the machine.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The lower the number the comparator outputs, the more similar the shirts are. A perfect match has a score of 0, an imperfect one has a score of the length of the tag.&lt;/p&gt;&#xA;&lt;p&gt;Bitty Benny has a lot of impatient (but well-paying) clients who demand specific types of shirts. &lt;strong&gt;How can Bitty Benny organize and search through the shirts to find the closest-matching tag as quickly as possible?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Formal Definition&lt;/h2&gt;&#xA;&lt;p&gt;A tag is a bit-vector of size &lt;em&gt;N&lt;/em&gt;, where N is a power of two. For this particular challenge we'll assume N to be 64.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Hint: On modern CPU architectures, a tag can be represented by a word (an unsigned 64-bit integer), and the difference between two tags can be written as an &lt;code&gt;xor&lt;/code&gt; then a &lt;a href=&quot;https://vaibhavsagar.com/blog/2019/09/08/popcount/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;popcount&lt;/code&gt;&lt;/a&gt; (count the number of ones in the binary representation of the integer). This distance is generally referred to as the &lt;em&gt;hamming Distance&lt;/em&gt; (lowercase 'h', of course) between two words.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Naïvely, using a linear search, finding a tag will take &lt;em&gt;O(n)&lt;/em&gt; time. Faster solutions exist - can you find them?&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;Your program will take two inputs:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A list of random tags.&lt;/li&gt;&#xA;&lt;li&gt;a different list of target tags.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;These lists may be of different sizes. The input format will be as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;Size of random tags list&amp;gt;&#xA;&amp;lt;tag as a decimal number `0 &amp;lt;= n &amp;lt; 2^64`&amp;gt;&#xA;...&#xA;&amp;lt;Size of random target tags list&amp;gt;&#xA;&amp;lt;tag as a decimal number&amp;gt;&#xA;...&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The competition input has been generated, and can be found here.&lt;/p&gt;&#xA;&lt;h3&gt;Task&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;For each target tag, determine the closest match in the random tag list, using hamming Distance as described above.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;In the case of a tie, i.e. multiple tags have the same minimum distance, any one is valid.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;In the order of reading, print out the closest match of each tag as a number, in the appropriate base.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring and Rules&lt;/h2&gt;&#xA;&lt;p&gt;The goals of this competition are to find solutions that are:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Fast, in terms of execution time.&lt;/li&gt;&#xA;&lt;li&gt;Clever, in terms of algorithm used, amortized cost, and write-up.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;To score your program:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Note: I have to finish writing example baseline program&#xA;Note: I have to generate and upload the testing list. Ideally it should be big enough that the naive solution takes around 3 seconds on a modern computer.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Translate this naïve idiomatic program from Rust to your language of choice.&lt;/li&gt;&#xA;&lt;li&gt;Time the naïve solution in your language of choice.&lt;/li&gt;&#xA;&lt;li&gt;Write an optimized solution in the same language, and time it using the same technique.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Your score is the optimized execution time, in seconds + that times the speedup, lower scores are better:&lt;/strong&gt;&#xA;&lt;pre&gt;&lt;code&gt;score = fast_time +  ((fast_time ** 2) / slow_time)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Time your programs using &lt;code&gt;time&lt;/code&gt;, include the time taken for I/O.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Note:&#xA;This scoring method is good for two reasons:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;In the case that there is no speedup compared to the baseline, the score is just 2x the time.&lt;/li&gt;&#xA;&lt;li&gt;Any speedups over the base version will decrease the score, but the score will never be less than the wall-clock time it takes.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;To determine the answer with the best writeup, we'll also be running a popularity contest.&lt;/p&gt;&#xA;&lt;h2&gt;Entry Template&lt;/h2&gt;&#xA;&lt;p&gt;I'm no stickler, but here's a loose entry template if you'd like to keep things consistent:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;## &amp;lt;Language&amp;gt; &amp;lt;Speed Score&amp;gt; (&amp;lt;Calculation&amp;gt;)&#xA;&amp;lt;Link to idiomatic solution&amp;gt;&#xA;```&#xA;&amp;lt;Optimized entry&amp;gt;&#xA;&amp;lt;If over a respectable size, put a link here instead&amp;gt;&#xA;```&#xA;&#xA;## How it works&#xA;&amp;lt;breakdown of the code&amp;gt;&#xA;&amp;lt;and the method used&amp;gt;&#xA;&amp;lt;and any other interesting notes&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Good luck, and happy tagging! Bitty Benny awaits your entry!&lt;/p&gt;&#xA;" OwnerUserId="85349" LastActivityDate="2021-04-13T05:42:14.067" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22059" PostTypeId="2" ParentId="2140" CreationDate="2021-04-13T08:05:03.080" Score="0" Body="&lt;h1&gt;Participant number&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;A math Olympiad will be held, and participants are being registered. The highest number of participants is 100. Each participant is given an ID number. It is given in a sequence like &lt;span class=&quot;math-container&quot;&gt;\$100, 97, 94, 91, 88, ...., 1\$&lt;/span&gt;, and when the first sequence is over, then &lt;span class=&quot;math-container&quot;&gt;\$99, 96, 93, 90, 87, ...., 3\$&lt;/span&gt; sequence and so on.&lt;/p&gt;&#xA;&lt;p&gt;Let's assume one of the participant's ID number is &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; and he/she is the &lt;span class=&quot;math-container&quot;&gt;\$n^{th}\$&lt;/span&gt; participant. Given the value of &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;, return the value of &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test Cases&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;59 -&amp;gt; 81&#xA;89 -&amp;gt; 71&#xA;16 -&amp;gt; 29&#xA;26 -&amp;gt; 92&#xA;63 -&amp;gt; 47&#xA;26 -&amp;gt; 92&#xA;45 -&amp;gt; 53&#xA;91 -&amp;gt; 4&#xA;18 -&amp;gt; 62&#xA;19 -&amp;gt; 28&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;There will be no leading zero in input. Standard   loopholes apply, shortest code wins. In output there can be trailing whitespace.&lt;/p&gt;&#xA;" OwnerUserId="92116" LastActivityDate="2021-04-13T08:05:03.080" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22062" PostTypeId="5" CreationDate="2021-04-13T14:31:42.473" Score="0" Body="&lt;p&gt;Use this tag on questions about any of the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The CSS of the site and any bugs, support or discussion that may arise around it&lt;/li&gt;&#xA;&lt;li&gt;Usage of CSS in answers to challenges on the main site&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-13T14:31:42.473" LastActivityDate="2021-04-13T14:31:42.473" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22063" PostTypeId="4" CreationDate="2021-04-13T14:31:42.473" Score="0" Body="For questions abut the site CSS styling, typically [bug] reports with the CSS, or for questions specifically about usage of the CSS language" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-13T14:31:42.473" LastActivityDate="2021-04-13T14:31:42.473" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22064" PostTypeId="2" ParentId="2140" CreationDate="2021-04-13T18:18:58.667" Score="0" Body="&lt;p&gt;Given a string &lt;em&gt;s&lt;/em&gt;, find a string &lt;em&gt;t&lt;/em&gt;, containing only printable ASCII characters (32-126), such that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/53675/&quot;&gt;PPCG53675&lt;/a&gt;(&lt;em&gt;t&lt;/em&gt;)=&lt;em&gt;s&lt;/em&gt;. You can assume such string exist.&lt;/p&gt;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;tmop&lt;/code&gt; =&amp;gt; &lt;code&gt;test&lt;/code&gt; (and 23 other possible outputs)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;TEST&lt;/code&gt; =&amp;gt; &lt;code&gt;T5oV&lt;/code&gt; (and 23 other possible outputs)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;!!!!&lt;/code&gt; =&amp;gt; &lt;code&gt;!!!!&lt;/code&gt; (and 17)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;!!  &lt;/code&gt; =&amp;gt; &lt;code&gt;!   &lt;/code&gt; (only one solution)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;~}}~&lt;/code&gt; =&amp;gt; &lt;code&gt;~|~~&lt;/code&gt; (only one solution)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2021-04-16T20:16:49.410" LastActivityDate="2021-04-16T20:16:49.410" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22065" PostTypeId="5" CreationDate="2021-04-13T19:12:12.670" Score="0" Body="&lt;p&gt;The &lt;a href=&quot;https://data.stackexchange.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Stack Exchange Data Explorer&lt;/a&gt; allows users to run queries, using SQL, on the data stored on the Stack Exchange network. This allows them to identify trends, understand user behaviour and find interesting facts.&lt;/p&gt;&#xA;&lt;p&gt;Questions with this tag should specifically relate to both CGCC and SEDE. General questions about SEDE should be asked on &lt;a href=&quot;https://meta.stackexchange.com/&quot;&gt;Mother Meta&lt;/a&gt; under the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/data-explorer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;data-explorer&amp;#39;&quot; rel=&quot;tag&quot;&gt;data-explorer&lt;/a&gt; tag.&lt;/p&gt;&#xA;&lt;p&gt;Use this tag on questions that demonstrate useful and interesting queries and potentially any analysis based on those queries.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-13T19:25:16.023" LastActivityDate="2021-04-13T19:25:16.023" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22066" PostTypeId="4" CreationDate="2021-04-13T19:12:12.670" Score="0" Body="For questions relating to the Stack Exchange Data Explorer - also known as SEDE. SEDE allows you to query Stack Exchange sites using SQL to gather and analyse data. Questions with this tag should specifically relate to both CGCC and SEDE. General questions about SEDE should be asked on Mother Meta" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-13T19:25:16.023" LastActivityDate="2021-04-13T19:25:16.023" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22067" PostTypeId="1" CreationDate="2021-04-13T19:45:27.133" Score="10" ViewCount="237" Body="&lt;p&gt;Take a look at this answer: &lt;a href=&quot;https://codegolf.stackexchange.com/a/17103/68942&quot;&gt;Produce the number 2014 without any numbers in your source code&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This is the most upvoted answer on our site right now. However, as many have pointed out, by modern standards, this is not a competitive solution because it doesn't take trivial steps to be more competitive as per the challenge's criterion (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;).&lt;/p&gt;&#xA;&lt;p&gt;Some people argue in favor of deletion because indeed, this is not competitive, and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990/68942&quot;&gt;our policy&lt;/a&gt; dictates that answers must attempt to be competitive and should be deleted otherwise.&lt;/p&gt;&#xA;&lt;p&gt;Others argue against it, because it is a creative approach and has historical significance.&lt;/p&gt;&#xA;&lt;p&gt;Specifically to quote myself on this dispute:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;[...] i think this kind of creativity embodies the whole point of the art side of code-golf but it is technically not competitive and doesn't attempt to take trivial steps to be more competitive (&lt;a href=&quot;https://chat.stackexchange.com/transcript/message/57639276#57639276&quot;&gt;source&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;We should have a definitive policy on handling these types of answers. Specifically, answers that are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;popular in terms of votes and visibility&lt;/li&gt;&#xA;&lt;li&gt;are not strictly invalid in terms of not solving the problem&lt;/li&gt;&#xA;&lt;li&gt;follow a creative approach but do not even attempt to be competitive&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;What should we do with these? Leave them be since they predate modern expectations? Lock them? Edit them if the user themselves is inactive / unwilling to do so? Delete them? Suggestions welcome.&lt;/p&gt;&#xA;&lt;p&gt;There is a specific thing to note about this answer, as pointed out by caird coinheringaahing in TNB. It is not actually the first answer to implement this approach; it is a port of an essentially identical &lt;a href=&quot;https://codegolf.stackexchange.com/a/17084/68942&quot;&gt;Scala answer&lt;/a&gt; which is actually golfed, and the OP has rolled back golfs in the past, meaning they are not inactive, but actively opposing making their post more competitive.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-04-13T19:51:26.503" LastActivityDate="2021-04-13T23:02:39.403" Title="Handling old, popular, creative, but non-competitive answers" Tags="|discussion|policy|answers|noncompeting|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22069" PostTypeId="2" ParentId="22067" CreationDate="2021-04-13T22:59:28.863" Score="11" Body="&lt;h1&gt;Keep them&lt;/h1&gt;&#xA;&lt;p&gt;...assuming they've shown any sort of effort.&lt;/p&gt;&#xA;&lt;p&gt;As caird coinheringaahing mentions, a serious contender is one that:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;...makes a serious effort towards optimizing the submission's score within the chosen language(s) and &lt;strong&gt;other choices (such as algorithm choice or optional restrictions/bonuses taken)&lt;/strong&gt;. [emphasis added]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I would argue that the answer in question had the goal of minimizing size &lt;em&gt;given the voluntary constraint&lt;/em&gt; that it derive the number from some sort of relevant phrase.&lt;/p&gt;&#xA;&lt;p&gt;Consider these possible modifications:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;print sum(ord(c) for c in 'Happy new year to you!')&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;The original, for comparison. Note that figuring out a variation on that phrase that sums to the right number would have required some significant effort.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;print sum(ord(c) for c in 'ÿÿÿÿÿÿÿå')&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;This greatly reduces the size, but only by sacrificing the restriction that makes the answer interesting.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;print sum(ord(character) for character in 'Happy new year to you!')&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;This one could be considered non-competitive and perhaps be deleted. There's an obvious improvement that would reduce the size while retaining the restriction.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;print sum(map(ord,'Happy new year to you!'))&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Suggested by user2186 in the comments. This is an improvement over the original that maintains the restriction. But we don't delete answers just because someone else is capable of improving them, and while we certainly permit users to improve their answers based on the suggestions of others, if a user prefers the answer to remain the best that they were able to devise &lt;em&gt;on their own&lt;/em&gt;, we shouldn't force them to do otherwise.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;The key question to ask is, &amp;quot;Are there &lt;em&gt;blatantly&lt;/em&gt; obvious improvements that could be made that would not completely change the approach or detract from the answer in other ways?&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;Even if an answer doesn't have a clever gimmick like this one, suppose that a question already has a solution in a given language. Someone decides to solve it using a different approach, and it turns out that the approach is a bit longer than the existing one. I would argue that there is still value in posting the answer, even knowing that it can't win, because seeing how well one can do with a specific approach is also interesting.&lt;/p&gt;&#xA;" OwnerUserId="44809" LastEditorUserId="44809" LastEditDate="2021-04-13T23:02:39.403" LastActivityDate="2021-04-13T23:02:39.403" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="22070" PostTypeId="1" CreationDate="2021-04-13T23:29:09.493" Score="12" ViewCount="515" Body="&lt;p&gt;We're currently waiting on a solid consensus on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/22005/66833&quot;&gt;how to host a blog&lt;/a&gt;, but while we wait, we should collect ideas for what blog posts should discuss. &lt;strong&gt;Suggest your ideas here&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Below, submit one topic per answer. Each answer should also contain the list of users (potentially just one) who are willing to write the blog post. The topic should be something they can write at least 1000 words, and should be related to the site in some obvious way. The topic description can be anything from 1 sentence to an entire draft of the blog post.&lt;/p&gt;&#xA;&lt;p&gt;Users should suggest ways to improve the topic of the post, as well as suggesting other related content that could be included in the post. If users agree that a specific topic should be a blog post, upvote the proposal. If not, downvote.&lt;/p&gt;&#xA;&lt;p&gt;Every 2 weeks, starting from a date to be decided, the top voted answer will be turned into the latest blog post, edited down to a link to the post and deleted.&lt;/p&gt;&#xA;&lt;p&gt;Discussion about these topics can be done on the &lt;a href=&quot;https://chat.stackexchange.com/rooms/123200/cgcc-blog-chat&quot;&gt;CGCC Blog Chat.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="80214" LastEditDate="2021-06-23T05:12:06.797" LastActivityDate="2022-05-31T16:22:16.510" Title="What should we write about on our blog?" Tags="|discussion|blog-discussion|" AnswerCount="16" CommentCount="0" CommunityOwnedDate="2021-06-18T00:42:22.820" ContentLicense="CC BY-SA 4.0" />
  <row Id="22071" PostTypeId="2" ParentId="22070" CreationDate="2021-04-13T23:36:07.477" Score="11" Body="&lt;h1&gt;How to write a good explanation&lt;/h1&gt;&#xA;&lt;p&gt;Perhaps a post could be made that gave advice on writing good explanations that are accessible even to users who don't know a language or algorithm particularly well.&lt;/p&gt;&#xA;&lt;h3&gt;Users who could write this:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;caird coinheringaahing&lt;/li&gt;&#xA;&lt;li&gt;hyper-neutrino&lt;/li&gt;&#xA;&lt;li&gt;DLosc&lt;/li&gt;&#xA;&lt;li&gt;Razetime&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;your name here!&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="95792" LastEditorUserId="80214" LastEditDate="2021-06-23T05:11:00.890" LastActivityDate="2021-06-23T05:11:00.890" CommentCount="0" CommunityOwnedDate="2021-06-17T23:55:27.393" ContentLicense="CC BY-SA 4.0" />
  <row Id="22072" PostTypeId="2" ParentId="22070" CreationDate="2021-04-13T23:45:38.270" Score="16" Body="&lt;h2&gt;Language design and development&lt;/h2&gt;&#xA;&lt;p&gt;This is more relevant recently due to the surge in language creation. Sub-topics include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Posts by language creators about their languages; design, development, implementation, unique features, etc.&lt;/li&gt;&#xA;&lt;li&gt;Comparison of and/or expositions on language styles (stack-based/procedural/tacit, prefix/postfix/infix, etc.)&lt;/li&gt;&#xA;&lt;li&gt;In-depth explorations of the pros and cons of golfing languages vs. non-golfing languages (succinctness, readability, typing speed, execution speed, etc.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I think this could be an especially rich field that PPCG members could contribute to due to the plethora of language creators &lt;em&gt;and&lt;/em&gt; users of languages made by PPCGers.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sub&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9089/90614&quot;&gt;a repost&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Users who could write about this&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Wezl (knowledge about language design and development, but not much specifically about golfing/esolangs)&lt;/li&gt;&#xA;&lt;li&gt;Lyxal&lt;/li&gt;&#xA;&lt;li&gt;Redwolf Programs&lt;/li&gt;&#xA;&lt;li&gt;caird coinheringaahing&lt;/li&gt;&#xA;&lt;li&gt;hyper-neutrino (knows a bit about some of the low-level implementation details about language design)&lt;/li&gt;&#xA;&lt;li&gt;Seggan (built a JVM compiler for a Vyxal derivative)&lt;/li&gt;&#xA;&lt;li&gt;You! (add yourself here)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="90614" LastEditorUserId="107299" LastEditDate="2022-05-31T16:22:16.510" LastActivityDate="2022-05-31T16:22:16.510" CommentCount="1" CommunityOwnedDate="2021-04-13T23:45:38.270" ContentLicense="CC BY-SA 4.0" />
  <row Id="22073" PostTypeId="2" ParentId="22070" CreationDate="2021-04-13T23:45:47.523" Score="7" Body="&lt;h1&gt;Are golfing languages good for the site?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;sup&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/23551/cgcc-blog-1-are-golfing-languages-good-or-bad-for-the-site?cb=1&quot;&gt;Accepted and written about in PPCG Blog #1&lt;/a&gt; by Redwolf and caird.&lt;/sup&gt;&lt;/p&gt;&#xA;&#xA;" OwnerUserId="79857" LastEditorUserId="80214" LastEditDate="2021-06-23T06:00:30.273" LastActivityDate="2021-06-23T06:00:30.273" CommentCount="1" CommunityOwnedDate="2021-06-18T00:43:16.210" ContentLicense="CC BY-SA 4.0" />
  <row Id="22074" PostTypeId="2" ParentId="22070" CreationDate="2021-04-13T23:46:21.453" Score="11" Body="&lt;h1&gt;History of golfing languages&lt;/h1&gt;&#xA;&lt;p&gt;An outline of how we went from practical languages to somewhat readable programs in golfscript/pyth/cjam to Unicode gibberish winning every challenge.&lt;/p&gt;&#xA;&lt;h2&gt;Users who could write&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Lyxal&lt;/li&gt;&#xA;&lt;li&gt;caird coinheringaahing&lt;/li&gt;&#xA;&lt;li&gt;add yourself here&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="66833" LastEditDate="2021-04-14T00:13:37.397" LastActivityDate="2021-04-14T00:13:37.397" CommentCount="1" CommunityOwnedDate="2021-04-14T00:03:02.467" ContentLicense="CC BY-SA 4.0" />
  <row Id="22075" PostTypeId="2" ParentId="22070" CreationDate="2021-04-13T23:46:38.697" Score="17" Body="&lt;h1&gt;Under-appreciated / low-visibility high-quality answers&lt;/h1&gt;&#xA;&lt;p&gt;We could include a recurring section including some answers from the past period of time that have a lot of work put into them but haven't gotten the visibility or the upvotes they deserve.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-04-13T23:46:38.697" CommentCount="3" CommunityOwnedDate="2021-06-18T00:42:39.567" ContentLicense="CC BY-SA 4.0" />
  <row Id="22076" PostTypeId="2" ParentId="22070" CreationDate="2021-04-13T23:48:09.103" Score="10" Body="&lt;h1&gt;How to get started learning a stack based golfing language&lt;/h1&gt;&#xA;&lt;p&gt;A post þat teaches þe basics of using any stack based language (stack mechanics, common operators and ways of control flow)&lt;/p&gt;&#xA;&lt;h2&gt;Writing Candidates&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Lyxal&lt;/li&gt;&#xA;&lt;li&gt;Wezl&lt;/li&gt;&#xA;&lt;li&gt;Razetime&lt;/li&gt;&#xA;&lt;li&gt;add yourself here&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="66833" LastEditDate="2021-04-14T17:36:38.013" LastActivityDate="2021-04-14T17:36:38.013" CommentCount="0" CommunityOwnedDate="2021-04-14T00:01:29.747" ContentLicense="CC BY-SA 4.0" />
  <row Id="22077" PostTypeId="2" ParentId="22070" CreationDate="2021-04-13T23:48:19.690" Score="7" Body="&lt;h1&gt;How to make a golfing language&lt;/h1&gt;&#xA;&lt;p&gt;A more specific post than the other language development one, covering things like tacit vs. stack based, custom code pages, and so on. Could go with my other golfing language related suggestion, or not.&lt;/p&gt;&#xA;&lt;h2&gt;People who could write this:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Redwolf Programs&lt;/li&gt;&#xA;&lt;li&gt;Lyxal&lt;/li&gt;&#xA;&lt;li&gt;[others]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="78850" LastEditDate="2021-04-14T00:07:27.360" LastActivityDate="2021-04-14T00:07:27.360" CommentCount="0" CommunityOwnedDate="2021-06-18T00:43:07.040" ContentLicense="CC BY-SA 4.0" />
  <row Id="22078" PostTypeId="1" CreationDate="2021-04-13T23:51:19.000" Score="6" ViewCount="56" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/tags/optimization/info&quot;&gt;tag wiki for&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt; currently reads like the following:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Challenges tagged optimization should tend to focus on three areas:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There is exactly one observable parameter (&amp;quot;score&amp;quot;) which measures the performance of attempting a puzzle in a particular approach. As&#xA;examples, this could be a mixed function between code size, objectives&#xA;reached (e.g. count from 1 to N where score depends on increasing N),&#xA;constraints met (e.g. penalty on repeating characters), or any&#xA;arbitrary but well defined set such as playing a game and measuring&#xA;your score, etc.&lt;/li&gt;&#xA;&lt;li&gt;The performance (measured score) involves the loosely computer sciencey definition of &amp;quot;optimization&amp;quot;, that is a &amp;quot;better&amp;quot; approach&#xA;works more efficiently or use fewer resources. (Resources is generally&#xA;interpreted as code size on this site, but there may be alternatives.)&lt;/li&gt;&#xA;&lt;li&gt;The problem does not have an obvious solution, i.e. solutions may compete on out-performing each other rather than solving the problem&#xA;with the optimal methods. More specifically, in most optimization&#xA;problems there exists a playing field that arises from having the&#xA;output be a continuous function (i.e. for two similar approaches, they&#xA;may be measured to be distinct from each other based on details) or&#xA;the optimal algorithm is very hard to find / compute. (e.g. unit&#xA;allocation)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;It describes the tag as a winning criterion tag, where the objective is to optimize some custom score of the submissions. But framing it as such has multiple problems:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; already covers the definition, and &lt;em&gt;that&lt;/em&gt; is the recommended winning criterion tag for that kind of challenges.&lt;/li&gt;&#xA;&lt;li&gt;No one these days uses &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt; tag for that purpose. Instead, it is used more often where the core task itself is an optimization problem.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Optimization problem (&lt;a href=&quot;https://en.wikipedia.org/wiki/Optimization_problem&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;) is an important class of problems in computer science closely related to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;. Notably, many NP-complete decision problems have a twin optimization problem (e.g. TSP as an optimization problem reads as &amp;quot;minimize the cost of a Hamiltonian cycle&amp;quot;, while its decision problem version reads as &amp;quot;does such a cycle under the given cost X exist?&amp;quot;.) This definition suits better to the current usage of the tag.&lt;/li&gt;&#xA;&lt;li&gt;Under this definition, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimized-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimized-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimized-output&lt;/a&gt; is NOT a synonym of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt;. IMHO, it should be synomymized to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; instead (assuming SE supports this).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Therefore, I propose the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Change the meaning of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt; to that of an optimization problem in the CS sense.&lt;/li&gt;&#xA;&lt;li&gt;Re-tag all &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt; / &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimized-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimized-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimized-output&lt;/a&gt; challenges that follow the previous definition to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Add a pointer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; in the wiki excerpt.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;OR,&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Create a new tag called &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization-problem&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Re-tag all &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt; challenges that do not follow the current definition to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization-problem&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Re-tag all the others to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Entirely deprecate &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2021-04-26T02:15:38.113" Title="Can we clean up the [optimization] tag and its tag wiki?" Tags="|discussion|tags|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22080" PostTypeId="2" ParentId="22070" CreationDate="2021-04-13T23:53:27.873" Score="9" Body="&lt;h1&gt;How to write a KotH&lt;/h1&gt;&#xA;&lt;p&gt;Tips all about KotHs. How to do design them, how to write a good specification, how to make a controller, etc.&lt;/p&gt;&#xA;&lt;h2&gt;Users who could write this:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Redwolf Programs&lt;/li&gt;&#xA;&lt;li&gt;[others]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-04-13T23:53:27.873" CommentCount="0" CommunityOwnedDate="2021-06-18T00:43:22.380" ContentLicense="CC BY-SA 4.0" />
  <row Id="22081" PostTypeId="2" ParentId="22070" CreationDate="2021-04-13T23:57:17.637" Score="6" Body="&lt;h1&gt;Things new users should know&lt;/h1&gt;&#xA;&lt;p&gt;A post outlining information about the code golf site that new users might not necessarily know from the welcome posts (e.g. SBCS, TIO links, etc)&lt;/p&gt;&#xA;&lt;h2&gt;Writing Candidates&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Lyxal&lt;/li&gt;&#xA;&lt;li&gt;add yourself here&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2021-04-13T23:57:17.637" CommentCount="0" CommunityOwnedDate="2021-04-14T00:03:21.827" ContentLicense="CC BY-SA 4.0" />
  <row Id="22082" PostTypeId="2" ParentId="22070" CreationDate="2021-04-13T23:57:41.950" Score="4" Body="&lt;h1&gt;TNB Highlights / TNB History&lt;/h1&gt;&#xA;&lt;p&gt;(Just a random idea. Maybe it's a really terrible one.)&lt;/p&gt;&#xA;&lt;p&gt;We could include a section on each / some of the posts with some highlights from the past few weeks of chat. Not everything that's on the starboard, but specifically very funny (and still funny, not just in the moment) or very interesting discussions / messages (remember that you can bookmark a conversation and then link to it).&lt;/p&gt;&#xA;&lt;p&gt;Alternatively, as a topic for one post, we could write about the history of TNB over the years (thanks to Lyxal for this suggestion).&lt;/p&gt;&#xA;&lt;p&gt;Just throwing this idea out there.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-04-14T00:01:44.333" LastActivityDate="2021-04-14T00:01:44.333" CommentCount="4" CommunityOwnedDate="2021-06-18T00:43:33.890" ContentLicense="CC BY-SA 4.0" />
  <row Id="22084" PostTypeId="2" ParentId="22070" CreationDate="2021-04-14T00:05:55.117" Score="12" Body="&lt;h1&gt;Making your esolang tryable online without Dennis: creating esolang usability yourself&lt;/h1&gt;&#xA;&lt;p&gt;A post explaining how to make an online interpreter out of an already existing offline interpreter as getting languages added to TIO is currently an impractical solution.&lt;/p&gt;&#xA;&lt;h2&gt;Writing candidates&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Lyxal&lt;/li&gt;&#xA;&lt;li&gt;Redwolf Programs&lt;/li&gt;&#xA;&lt;li&gt;Wasif&lt;/li&gt;&#xA;&lt;li&gt;add you&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="92116" LastEditDate="2021-05-24T17:07:37.317" LastActivityDate="2021-05-24T17:07:37.317" CommentCount="3" CommunityOwnedDate="2021-04-14T00:05:55.117" ContentLicense="CC BY-SA 4.0" />
  <row Id="22085" PostTypeId="2" ParentId="22070" CreationDate="2021-04-14T00:08:03.413" Score="11" Body="&lt;h1&gt;Introduction to rarely used but interesting esolangs&lt;/h1&gt;&#xA;&lt;p&gt;This is meant to be a recurring topic, maybe once in a couple months. While LotM includes general-purpose languages and has an emphasis on general usability across challenges, this blog post will exclusively introduce esolangs and highlight certain aspects of it (along with a few specific challenges/answers).&lt;/p&gt;&#xA;&lt;h2&gt;Languages and users to write about each language&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Flurry: Bubbler&lt;/li&gt;&#xA;&lt;li&gt;Labyrinth: Razetime&lt;/li&gt;&#xA;&lt;li&gt;Brain-Flak:&lt;/li&gt;&#xA;&lt;li&gt;(Hexagony?)&lt;/li&gt;&#xA;&lt;li&gt;(Stack Cats?)&lt;/li&gt;&#xA;&lt;li&gt;P'': 4D4850&lt;/li&gt;&#xA;&lt;li&gt;BitCycle: DLosc&lt;/li&gt;&#xA;&lt;li&gt;Forte: DLosc (&lt;em&gt;and/or someone else who knows the language better&lt;/em&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="68942" LastEditDate="2021-06-19T20:08:53.767" LastActivityDate="2021-06-19T20:08:53.767" CommentCount="11" CommunityOwnedDate="2021-06-18T00:42:46.773" ContentLicense="CC BY-SA 4.0" />
  <row Id="22086" PostTypeId="2" ParentId="22070" CreationDate="2021-04-14T01:39:41.243" Score="9" Body="&lt;h1&gt;History of Code Golf and/or CGCC&lt;/h1&gt;&#xA;&lt;p&gt;As a slightly more general addition to hyper-neutrino's &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/22082/79857&quot;&gt;suggestion&lt;/a&gt;, this could cover things like Code Golf on Stack Overflow, abandoned challenge types like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt;, the addition of things like &amp;quot;every language is its own sub-challenge&amp;quot;, and so on. Could be a smaller section of every post, or its own standalone one.&lt;/p&gt;&#xA;&lt;h2&gt;Users who could write this:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Redwolf Programs&lt;/li&gt;&#xA;&lt;li&gt;caird coinheringaahing&lt;/li&gt;&#xA;&lt;li&gt;[others]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="66833" LastEditDate="2021-04-14T13:18:00.793" LastActivityDate="2021-04-14T13:18:00.793" CommentCount="0" CommunityOwnedDate="2021-06-18T00:42:55.427" ContentLicense="CC BY-SA 4.0" />
  <row Id="22087" PostTypeId="2" ParentId="22070" CreationDate="2021-04-14T05:39:03.070" Score="3" Body="&lt;h1&gt;User spotlight&lt;/h1&gt;&#xA;&lt;p&gt;This could be a part of a bigger post. It would focus on a certain user each time and outline things like preferred golfing languages, best challenges, most iconic TNB quote etc.&lt;/p&gt;&#xA;&lt;h2&gt;People to write about&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Redwolf (for being notable, outstanding at making KotHs)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Writing Candidates&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Lyxal&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="79857" LastEditDate="2021-11-01T14:18:17.377" LastActivityDate="2021-11-01T14:18:17.377" CommentCount="1" CommunityOwnedDate="2021-06-18T00:43:38.853" ContentLicense="CC BY-SA 4.0" />
  <row Id="22088" PostTypeId="2" ParentId="2140" CreationDate="2021-04-14T07:58:26.140" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224153/help-me-get-the-day-of-the-week-correct&quot;&gt;Posted ;)&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2021-04-22T23:03:00.403" LastActivityDate="2021-04-22T23:03:00.403" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22089" PostTypeId="2" ParentId="22070" CreationDate="2021-04-14T17:43:49.110" Score="7" Body="&lt;h1&gt;The pros and cons of challenge types other than &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The post would discuss both the advantages and disadvantages of writing challenges that use scoring criteria other than &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, for example &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; and more.&lt;/p&gt;&#xA;&lt;p&gt;Some pros off the top of my head:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;They're often novel challenge ideas, more so than &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, and so people are more likely to upvote and remember them&lt;/li&gt;&#xA;&lt;li&gt;They can be a fun &amp;quot;distraction&amp;quot; or &amp;quot;break&amp;quot; in the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; monotony on the site&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Some cons:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;They require more work to find a good and objective winning criteria&lt;/li&gt;&#xA;&lt;li&gt;They often require more effort and engagement to write and successfully pull off, especially on the author's part&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Writers&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;caird coinheringaahing&lt;/li&gt;&#xA;&lt;li&gt;Redwolf Programs&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;add yourself&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="79857" LastEditDate="2021-04-22T14:47:17.507" LastActivityDate="2021-04-22T14:47:17.507" CommentCount="3" CommunityOwnedDate="2021-06-18T00:43:28.067" ContentLicense="CC BY-SA 4.0" />
  <row Id="22090" PostTypeId="5" CreationDate="2021-04-14T22:10:07.290" Score="0" Body="&lt;p&gt;Use this tag on questions that relate specifically to deleted and deleting answers. Some examples include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Requesting clarification about why a specific answer was deleted&lt;/li&gt;&#xA;&lt;li&gt;Establishing site policy on when answers should and shouldn't be deleted&lt;/li&gt;&#xA;&lt;li&gt;Getting help and support about the deletion process&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Before asking about this, please see if &lt;a href=&quot;https://meta.stackexchange.com/q/5221/355458&quot;&gt;this FAQ post&lt;/a&gt; answers your question&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Note that any user with 20000 or more reputation can vote to delete any answer with a negative score, and that the &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=moderators&quot;&gt;diamond moderators&lt;/a&gt; can delete any answer at any time.&lt;/p&gt;&#xA;&lt;p&gt;You can see a list of all your answers that have been deleted in the past 60 days by navigating to &lt;a href=&quot;https://codegolf.stackexchange.com/users/current?tab=answers&quot;&gt;your answers&lt;/a&gt;, scrolling down and clicking &amp;quot;recently deleted answers&amp;quot;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-14T23:29:39.277" LastActivityDate="2021-04-14T23:29:39.277" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22091" PostTypeId="4" CreationDate="2021-04-14T22:10:07.290" Score="0" Body="For discussion and support around deleted and deleting answers, including discussing why a specific answer was deleted and what conditions should result in an answer being deleted" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-14T22:10:07.290" LastActivityDate="2021-04-14T22:10:07.290" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22092" PostTypeId="5" CreationDate="2021-04-14T22:15:23.640" Score="0" Body="&lt;p&gt;Use this tag on questions that relate specifically to deleted and deleting questions. Some examples include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Requesting clarification about why a specific question was deleted&lt;/li&gt;&#xA;&lt;li&gt;Establishing site policy on when questions should and shouldn't be deleted&lt;/li&gt;&#xA;&lt;li&gt;Getting help and support about the deletion process&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Before asking about this, please see if &lt;a href=&quot;https://meta.stackexchange.com/q/5221/355458&quot;&gt;this FAQ post&lt;/a&gt; answers your question&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Note that any user with 10000 can vote to delete any closed question, and that the &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=moderators&quot;&gt;diamond moderators&lt;/a&gt; can delete any question at any time.&lt;/p&gt;&#xA;&lt;p&gt;You can see a list of all your questions that have been deleted in the past 60 days by navigating to &lt;a href=&quot;https://codegolf.stackexchange.com/users/current?tab=questions&quot;&gt;your questions&lt;/a&gt;, scrolling down and clicking &amp;quot;recently deleted questions&amp;quot;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-14T23:30:37.020" LastActivityDate="2021-04-14T23:30:37.020" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22093" PostTypeId="4" CreationDate="2021-04-14T22:15:23.640" Score="0" Body="For discussion and support around deleted and deleting questions, including discussing why a specific question was deleted and what conditions should result in an question being deleted" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-14T22:15:23.640" LastActivityDate="2021-04-14T22:15:23.640" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22094" PostTypeId="5" CreationDate="2021-04-15T01:27:02.053" Score="0" Body="&lt;p&gt;Use this tag on questions relating to downvoting or the culture around downvoting on the site, such as:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Discussing general site consensus about downvoting&lt;/li&gt;&#xA;&lt;li&gt;Asking why specific questions and answers have been downvoted&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Note that you are &lt;em&gt;very&lt;/em&gt; unlikely to receive an answer when asking why a specific post was downvoted, and questions along this theme are not generally well-accepted unless the downvoting extends past a couple of related answers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Downvoting is a privilege available to any user with &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/vote-down&quot;&gt;125 reputation or more&lt;/a&gt; that indicates the voter does not believe the answer is of high quality or beneficial to the site.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-15T01:27:02.053" LastActivityDate="2021-04-15T01:27:02.053" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22095" PostTypeId="4" CreationDate="2021-04-15T01:27:02.053" Score="0" Body="For questions asking about downvoting and downvoting culture on the site" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-15T01:27:02.053" LastActivityDate="2021-04-15T01:27:02.053" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22099" PostTypeId="1" CreationDate="2021-04-15T16:44:42.487" Score="4" ViewCount="99" Body="&lt;p&gt;This question came up recently in a discussion of the validity of &lt;a href=&quot;https://codegolf.stackexchange.com/a/223415/101522&quot;&gt;my answer to this question&lt;/a&gt;. It was argued that the answer was a V submission, not a Vim submission.&lt;/p&gt;&#xA;&lt;p&gt;It is widely agreed that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7139/101522&quot;&gt;displaying text in Vim is a valid form of output&lt;/a&gt;. However, this brings up a question: Is a script/program still considered a valid Vim submission if it ends in Insert mode, or does it have to end in Normal mode?&lt;/p&gt;&#xA;" OwnerUserId="101522" LastActivityDate="2021-04-15T16:56:41.920" Title="Does a Vim submission have to end in a certain mode?" Tags="|discussion|policy|rules|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22100" PostTypeId="2" ParentId="22099" CreationDate="2021-04-15T16:45:01.030" Score="7" Body="&lt;h1&gt;Yes, a Vim submission is valid if it ends in Insert mode.&lt;/h1&gt;&#xA;&lt;p&gt;Once the intended text has been outputted, the question has been answered. The insert mode is simply another command mode in which most keys are simply commands that output that character. For example, there are commands specific to Insert mode, as well as commands shared between Insert and Normal mode. Once the &amp;quot;commands&amp;quot; to output the text are executed, switching modes is unnecessary.&lt;/p&gt;&#xA;" OwnerUserId="101522" LastActivityDate="2021-04-15T16:45:01.030" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22102" PostTypeId="2" ParentId="22099" CreationDate="2021-04-15T16:49:28.643" Score="-4" Body="&lt;h1&gt;No, a Vim submission is only valid if it ends in normal mode.&lt;/h1&gt;&#xA;&lt;p&gt;&lt;sup&gt;(borrowed from Aaron Miller)&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;Once the program has returned to normal mode, all pending operations are finished. A command was used to go into insert mode; the script can't be considered finished until that command is completed by the escape key.&lt;/p&gt;&#xA;&lt;p&gt;I think it makes sense that the &amp;quot;end&amp;quot; of the program would be the state vim starts in.&lt;/p&gt;&#xA;" OwnerUserId="80214" LastActivityDate="2021-04-15T16:49:28.643" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22103" PostTypeId="2" ParentId="22099" CreationDate="2021-04-15T16:56:41.920" Score="8" Body="&lt;h1&gt;Vim submissions can be valid in any mode if the output is displayed&lt;/h1&gt;&#xA;&lt;p&gt;In Aaron Miller's &lt;a href=&quot;https://codegolf.stackexchange.com/posts/comments/518400?noredirect=1&quot;&gt;mentioned answer&lt;/a&gt;, the required output is shown in insert mode, and hence it is valid. However, if a change of mode/other motion is required for output, like in the V quine &lt;code&gt;2i2i&lt;/code&gt;, then it is required to be valid.&lt;/p&gt;&#xA;" OwnerUserId="80214" LastActivityDate="2021-04-15T16:56:41.920" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22105" PostTypeId="2" ParentId="2447" CreationDate="2021-04-15T20:56:24.683" Score="7" Body="&lt;h1&gt;A natural number may be represented as a collection of n empty collections, and a string as a collection of such numbers&lt;/h1&gt;&#xA;&lt;p&gt;In languages that do not have numbers or strings but do have lists, stacks, or other collections, a natural number (including 0) may be represented by a collection of empty collections, where the length of the outer collection represents the natural number. So &lt;code&gt;[]&lt;/code&gt; would represent 0, &lt;code&gt;[[], [], []]&lt;/code&gt; would represent 3, and so on. Strings may be represented as collections of these natural numbers, as Unicode codepoints are unsigned.&lt;/p&gt;&#xA;" OwnerUserId="95792" LastActivityDate="2021-04-15T20:56:24.683" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22106" PostTypeId="2" ParentId="2447" CreationDate="2021-04-15T20:59:10.750" Score="7" Body="&lt;h1&gt;In stack-based languages, inputs may be pushed onto the stack at the start of the program, and the output may be the top element on the stack at the end of the program&lt;/h1&gt;&#xA;&lt;p&gt;This has already been &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8493/95792&quot;&gt;proposed for functions&lt;/a&gt;, but it should also be allowed for full programs.&lt;/p&gt;&#xA;" OwnerUserId="95792" LastActivityDate="2021-04-15T20:59:10.750" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22108" PostTypeId="1" AcceptedAnswerId="22302" CreationDate="2021-04-16T03:03:29.930" Score="7" ViewCount="132" Body="&lt;p&gt;Currently, the system protects any challenge that either:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Has &lt;a href=&quot;https://meta.stackexchange.com/a/89971/355458&quot;&gt;3 deleted answers&lt;/a&gt; from new users&lt;/li&gt;&#xA;&lt;li&gt;Has multiple answers from new users within a short amount of time&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;We already have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10420/66833&quot;&gt;policy&lt;/a&gt; that basically says &amp;quot;99.99% of questions here do not need to be protected&amp;quot;. In short, we encourage answering more than asking, especially for newer users, and this feature prevents that. Questions should only be protected if they attract multiple invalid answers with very few valid ones, such as &lt;a href=&quot;https://codegolf.stackexchange.com/q/47249/66833&quot;&gt;this one&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;We currently have &lt;a href=&quot;https://codegolf.stackexchange.com/tools/protected-questions&quot;&gt;21 protected questions&lt;/a&gt; (7 of which are locked and shouldn't even be considered), and all 14 of them are locked by users, not by Community. This is the appropriate way in my opinion that questions on this site should become protected: by high-rep users who understand if and when this is necessary.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, I'd like to request that automatic protection be turned off for the site (or rather, have the threshold be &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8811/66833&quot;&gt;set at 10000 like meta&lt;/a&gt;).&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="78028" LastEditDate="2021-05-12T13:10:04.110" LastActivityDate="2021-05-12T13:10:04.110" Title="Can we disable auto-protection?" Tags="|feature-request|status-completed|protected-questions|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22109" PostTypeId="1" CreationDate="2021-04-16T03:41:57.957" Score="4" ViewCount="76" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11448/68942&quot;&gt;How could the bounty reasons be improved?&lt;/a&gt; has been &lt;a href=&quot;/questions/tagged/status-review&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-review&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-review&lt;/a&gt; for four years now. I think we should have this discussion again, since nothing really seemed to happen from the last one, and we can take a look into whether we should change anything and &lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt; it or if we decide there isn't really a need and &lt;a href=&quot;/questions/tagged/status-declined&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-declined&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-declined&lt;/a&gt; it.&lt;/p&gt;&#xA;&lt;p&gt;Here's a copy of the proposal from that question which was taken from a popular proposal from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8350/were-not-a-qa-site-but-what-should-be-done-about-it&quot;&gt;We&amp;#39;re not a Q&amp;amp;A site. But what should be done about it?&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;When starting a bounty, people here almost always use either &amp;quot;reward an existing answer&amp;quot; or &amp;quot;draw attention&amp;quot;, occasionally &amp;quot;improve details&amp;quot;. That's because none of the others make any sense here (and the descriptions of these could also be improved):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&amp;quot;&lt;strong&gt;Authoritative reference needed&lt;/strong&gt; Looking for an answer drawing from credible and/or official sources.&amp;quot; This is simply not a thing here.&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;&lt;strong&gt;Canonical answer required&lt;/strong&gt; The question is widely applicable to a large audience. A detailed canonical answer is required to address all the concerns.&amp;quot;  For challenges this doesn't make any sense either. It &lt;em&gt;might&lt;/em&gt; be useful for the odd question about golfing tips, but that can probably be covered with &amp;quot;improve details&amp;quot;.&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;&lt;strong&gt;Current answers are outdated&lt;/strong&gt; The current answer(s) are out-of-date and require revision given recent changes.&amp;quot; Not a thing here - with our current rules, new languages/features aren't even allowed to be used.&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;&lt;strong&gt;Draw attention&lt;/strong&gt; This question has not received enough attention.&amp;quot; Yep, this works. (Although &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8355/8478&quot;&gt;I'd rather read &amp;quot;challenge&amp;quot; in that sentence&lt;/a&gt;.)&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;&lt;strong&gt;Improve details&lt;/strong&gt; The current answers do not contain enough detail.&amp;quot; The idea of this works in a broad sense, but we're not really looking for &amp;quot;detail&amp;quot; in answers here. Maybe this could be reworked into a bounty reason to improve the score (overall winner, or language-specific solutions).&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;&lt;strong&gt;Reward existing answer&lt;/strong&gt; One or more of the answers is exemplary and worthy of an additional bounty.&amp;quot; This works verbatim. :)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;We could also think about whether we could use other bounty reasons here. E.g. bounties are often offered for bonus/side challenges. Maybe we could get a specific bounty reason for that?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Let's discuss this. How can we add, remove, or change bounty reasons to fit the needs of our site better?&lt;/p&gt;&#xA;&lt;p&gt;I assume suggestions will be along the lines of:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;rewording an existing bounty reason&lt;/li&gt;&#xA;&lt;li&gt;removing a reason entirely (should only be done if we have absolutely no use for a reason entirely, since this is more or less a permanent change)&lt;/li&gt;&#xA;&lt;li&gt;adding a new reason (should probably only be for exceptional uses that we'll actually need quite regularly and isn't a special case of another reason or something another reason can be reworded into)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-04-16T14:39:25.893" Title="Improving Bounty Reasons" Tags="|discussion|bounty|" AnswerCount="1" CommentCount="2" ClosedDate="2021-04-19T23:14:48.700" ContentLicense="CC BY-SA 4.0" />
  <row Id="22110" PostTypeId="2" ParentId="2140" CreationDate="2021-04-16T05:12:57.220" Score="3" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/223929/you-are-kinda-replacable-to-me&quot;&gt;You are kinda Replacable to Me&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77516" LastEditorUserId="77516" LastEditDate="2021-04-20T08:15:14.063" LastActivityDate="2021-04-20T08:15:14.063" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22111" PostTypeId="2" ParentId="2140" CreationDate="2021-04-16T08:44:15.513" Score="1" Body="&lt;h1&gt;It seems &lt;span class=&quot;math-container&quot;&gt;\$2^n\$&lt;/span&gt;?&lt;/h1&gt;&#xA;&lt;p&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$a_0=1\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$a_{i+1}=1+\sum_{j=0}^ia_i\$&lt;/span&gt;, then &lt;span class=&quot;math-container&quot;&gt;\$a_i=2^i\$&lt;/span&gt;, which is no fun.&lt;/p&gt;&#xA;&lt;p&gt;Now we reverse half of the value, &lt;span class=&quot;math-container&quot;&gt;\$a_{i+1}=L(1+\sum_{j=0}^ia_i)\$&lt;/span&gt; for odd &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; reverse the number, e.g. 15=&amp;gt;51, 1230=&amp;gt;321.&lt;/p&gt;&#xA;&lt;p&gt;Solve &lt;span class=&quot;math-container&quot;&gt;\$a_i\$&lt;/span&gt;. You can choose 1-index, or reverse each output(output &lt;span class=&quot;math-container&quot;&gt;\$L(a_i)\$&lt;/span&gt;).&lt;/p&gt;&#xA;&lt;p&gt;First elements&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1,2,4,8,16,23,55,11,121,242,484,869,1837,4763,8437,47861,64735,74921,204391,287804,696586,2713931,4107103,6024128,14238334,86667482,115144150,3882032,234170332,466043864,934384528,6509678681,8378447737,47459865761,64216761235,74225334821,202658857291,285417713504,690735428086,2716580741831,4098051598003,6006913016918,14203016212924,84852423060482,113258455486330,66279019615622,292795930588282,465671168195585,1051263029372149,8924478506252012,11027004564996310,2629992190045022,24684001320037642,48257004620086394,97625007260161678,653323025410052591,848573039930375947,4981570689706417961,6678716769567169855,1793343193533475331,15150776732667815041,28003653356435510303,58305206821771140385,77082245346314016611,193692658989856297381,267495217979713583783,654880535959426178545,907532588191701679031,2217293660110554036121,2422708011220237854344,6857295331441345926586,27135819628826609541731,40850410291709301394903,60898720681438502800718,142599541264857105590524,840181112417925280991582,1125380194947639492172630,625434898725989830670522,2876195288621268815015782,4651300367352427750932575,10403690944594965380964139,87282916703998198818370802,108090298593188129580299080,61895061952673681795081612,278075659139049940955679772,445953119188990872813151655,1002104437467090754724511199,8932209449051814394788024002,10936418323985995904237046400,829047480819917974663827812,22701884128791909783137920612,42214857266591838575286730454,87618625524175658141562571678,653341521382613153840152732571,828578772430964470123277875927,4581575556420498291684457517561,6238733101282427231931013269415,3883562026836445846520266477421&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Not found on OEIS&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2021-04-16T18:03:37.750" LastActivityDate="2021-04-16T18:03:37.750" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22112" PostTypeId="2" ParentId="2140" CreationDate="2021-04-16T12:59:10.683" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224787/cdglf-tmn-to-apl&quot;&gt;CDGLF:TMN2APL&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compiler&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compiler&amp;#39;&quot; rel=&quot;tag&quot;&gt;compiler&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta questions:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a duplicate? &lt;sub&gt;(I've looked and there are several challenges with operator precedence, but there are large differences such as floor/ceiling and the output format)&lt;/sub&gt;&lt;/li&gt;&#xA;&lt;li&gt;How can I objectively define &amp;quot;equivalent expressions&amp;quot;? Should I write a reference interpreter or answer?&lt;/li&gt;&#xA;&lt;li&gt;Would it be more interesting going the other way?&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/message/57740855#57740855&quot;&gt;Should answers be required to reject invalid input?&lt;/a&gt; Seems not&lt;/li&gt;&#xA;&lt;li&gt;&lt;s&gt;Should I&lt;/s&gt; I've replaced the unicode operators &lt;code&gt;×÷⌈⌉⌊⌋&lt;/code&gt; with ascii symbols &lt;code&gt;*/{}[]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Is the exponentiation operator necessary? (It might just make the challenge more cumbersome because of its different associativity)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="90614" LastEditorUserId="90614" LastEditDate="2021-04-30T14:33:16.633" LastActivityDate="2021-04-30T14:33:16.633" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="22113" PostTypeId="5" CreationDate="2021-04-16T13:48:50.500" Score="0" Body="&lt;p&gt;Editing is a process available to all users that allows them to improve posts by clicking the &amp;quot;Edit&amp;quot; link underneath the post. Users with less than 2000 reputation must have their edits approved by users in the &lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits&quot;&gt;Suggested Edits review queue&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, users can &amp;quot;rollback&amp;quot; previous edits by navigating to the &lt;a href=&quot;https://codegolf.stackexchange.com/posts/55422/revisions&quot;&gt;revisions page&lt;/a&gt; of a post and clicking &amp;quot;Rollback&amp;quot; on a previous revision:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/1aw6E.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/1aw6E.png&quot; alt=&quot;Rollback link&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This tag is also relevant to questions about editing tag wikis - a privilege available to all users, and one that doesn't require approval for users with 20000 reputation or more. In this case, use this tag with &lt;a href=&quot;/questions/tagged/tag-wikis&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tag-wikis&amp;#39;&quot; rel=&quot;tag&quot;&gt;tag-wikis&lt;/a&gt; as well.&lt;/p&gt;&#xA;&lt;p&gt;Use this tag on questions about editing, including:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When it is appropriate to edit posts&lt;/li&gt;&#xA;&lt;li&gt;How the editing system works&lt;/li&gt;&#xA;&lt;li&gt;How tag wiki editing works&lt;/li&gt;&#xA;&lt;li&gt;Whether a specific post or tag wiki should be edited and to what&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If your question is a &lt;a href=&quot;/questions/tagged/support&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt; about the editing systems, please read through the &lt;a href=&quot;https://meta.stackexchange.com/questions/tagged/edits+faq&quot;&gt;editing FAQ&lt;/a&gt; on Mother Meta before posting here.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-16T13:48:50.500" LastActivityDate="2021-04-16T13:48:50.500" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22114" PostTypeId="4" CreationDate="2021-04-16T13:48:50.500" Score="0" Body="For questions about editing - both when and how editing is done on either main or meta sites" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-16T13:48:50.500" LastActivityDate="2021-04-16T13:48:50.500" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22115" PostTypeId="2" ParentId="22109" CreationDate="2021-04-16T14:39:25.893" Score="9" Body="&lt;h2&gt;Get rid of most, keep a couple&lt;/h2&gt;&#xA;&lt;p&gt;I more or less agree with Martin's points in the previous post about this, but with a few thoughts of my own.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&amp;quot;&lt;strong&gt;Current answers are outdated&lt;/strong&gt;. The current answer(s) are out-of-date and require revision given recent changes.&amp;quot; Not a thing here - with our current rules, new languages/features aren't even allowed to be used.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This has now &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/12877/66833&quot;&gt;changed&lt;/a&gt;, as newer languages can be used, but the bounty reason is still useless here as &amp;quot;out-of-date answers that require revision to be fixed&amp;quot; are invalid answers and should be deleted or fixed.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Draw attention&lt;/strong&gt; and &lt;strong&gt;Reward existing answer&lt;/strong&gt; are probably the only 2 bounty reasons I remember ever being used on the site, barring a couple of exceptions, and so should stay.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Improve details&lt;/strong&gt; could be reworded to encourage improving score, but I doubt many answers would only improve their score if there was a bounty on the line, and challenges will generally just have newer, better answers posted to them instead.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Overall, I think that only &lt;strong&gt;Draw attention&lt;/strong&gt; and &lt;strong&gt;Reward existing answer&lt;/strong&gt; are actually relevant or useful here, and if possible we should just get rid of the other 4.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-04-16T14:39:25.893" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22116" PostTypeId="2" ParentId="2140" CreationDate="2021-04-16T15:16:34.403" Score="2" Body="&lt;h2&gt;Decompress a Sparse Matrix (WIP)&lt;/h2&gt;&#xA;&lt;p&gt;The dual of &lt;a href=&quot;https://codegolf.stackexchange.com/q/129924/95792&quot;&gt;this challenge&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Decompress a sparse matrix reversing the method here &lt;a href=&quot;https://en.wikipedia.org/wiki/Sparse_matrix#Compressed_sparse_row_.28CSR.2C_CRS_or_Yale_format.29&quot; rel=&quot;nofollow noreferrer&quot;&gt;Compressed sparse row (CSR, CRS or Yale format)&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;There will be 4 inputs, either as separate variables or as a list of lists:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;V&lt;/code&gt;, a list of the nonzero elements of the matrix in row-major form. This is of length NNZ (the number of nonzero elements in the original matrix)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;NCOLS&lt;/code&gt; - the number of columns in the original matrix.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;IA&lt;/code&gt; - a list that yields the number of nonzero elements in each row in the following way: &lt;code&gt;IA[0] = 0, IA[i] = IA[i - 1] + &amp;lt;number of nonzero elements in row i&amp;gt;&lt;/code&gt;. The number of nonzero elements in row i is &lt;code&gt;IA[i + 1] - IA[i]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;JA&lt;/code&gt; - a list of the column indices of the elements in V, also of length NNZ. (zero-indexed)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Input will be a list of 3 lists and the number of columns in the original matrix, e.g. either&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;  [5, 8, 3, 6],&#xA;  [0, 0, 2, 3, 4],&#xA;  [0, 1, 2, 1],&#xA;  [4]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Or&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;V = [5, 8, 3, 6]&#xA;IA = [0, 0, 2, 3, 4]&#xA;JA = [0, 1, 2, 1]&#xA;NCOLS = 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output will be a decompressed matrix/list of lists:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[0 0 0 0],&#xA; [5 8 0 0],&#xA; [0 0 3 0],&#xA; [0 6 0 0]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If your language doesn't support actual data structures, input and output may be text.&lt;/p&gt;&#xA;&lt;h3&gt;Process&lt;/h3&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Create a 'matrix' of row width &lt;code&gt;NCOLS&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Populate the &lt;code&gt;ith&lt;/code&gt; matrix row with &lt;code&gt;N&lt;/code&gt; values from &lt;code&gt;V&lt;/code&gt; if the corresponding array index (&lt;code&gt;i + 1&lt;/code&gt;) of &lt;code&gt;IA&lt;/code&gt; is non-zero, where &lt;code&gt;N&lt;/code&gt; is the &lt;code&gt;ith&lt;/code&gt; element of &lt;code&gt;IA&lt;/code&gt; starting at the &lt;code&gt;ith&lt;/code&gt; element of &lt;code&gt;JA&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;repeat until V is empty&lt;br /&gt;&#xA;i.e. above for the 0th matrix row &lt;code&gt;IA[1] = 0&lt;/code&gt;, so this row has &lt;code&gt;NCOLS=4&lt;/code&gt; zeroes in it's first row. Then for matrix row 1, &lt;code&gt;IA[2]=2&lt;/code&gt; it takes 2 values from &lt;code&gt;V&lt;/code&gt; starting at &lt;code&gt;JA[1]=0&lt;/code&gt;. For matrix row 2, &lt;code&gt;IA[3]=3&lt;/code&gt; and &lt;code&gt;IA[2]=2&lt;/code&gt; so it takes the next (3 - 2 = 1) elements from &lt;code&gt;V&lt;/code&gt;, starting at &lt;code&gt;JA[2]=2&lt;/code&gt;. For matrix row 4  &lt;code&gt;IA[4]=4&lt;/code&gt; and &lt;code&gt;IA[3]=3&lt;/code&gt; so it takes the next (4 - 3 = 1) elements from &lt;code&gt;V&lt;/code&gt;, starting at &lt;code&gt;JA[3]=1&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;p&gt;Input 1:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[ 5, 8, 3, 6 ]&#xA;[ 0, 0, 2, 3, 4 ]&#xA;[ 0, 1, 2, 1 ]&#xA;4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output 1:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[0 0 0 0],&#xA; [5 8 0 0],&#xA; [0 0 3 0],&#xA; [0 6 0 0]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input 2&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[ 10 20 30 40 50 60 70 80 ]&#xA;[  0  2  4  7  8 ]&#xA;[  0  1  1  3  2  3  4  5 ]&#xA;6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output 2:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[10 20 0 0 0 0],&#xA; [0 30 0 40 0 0],&#xA; [0 0 50 60 70 0],&#xA; [0 0 0 0 0 80]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input 3:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[ ]&#xA;[ 0 0 0 0 ]&#xA;[ ]&#xA;3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output 3:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[0 0 0],&#xA; [0 0 0],&#xA; [0 0 0]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input 4:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[ 1 1 1 1 1 1 1 1 1 ]&#xA;[ 0 3 6 9 ]&#xA;[ 0 1 2 0 1 2 0 1 2 ]&#xA;3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output 4:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[1 1 1],&#xA; [1 1 1],&#xA; [1 1 1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input 5:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[ 5, -9, 0.3, -400 ]&#xA;[ 0, 0, 2, 3, 4 ]&#xA;[ 0, 1, 2, 1, ]&#xA;4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output 5:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[0 0 0 0],&#xA; [5 -9 0 0],&#xA; [0 0 0.3 0],&#xA; [0 -400 0 0]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Assume inputs may contain any real number, you need not consider mathematical symbols or exponential representation (e.g. 5,000 will never be entered as 5e3). You will not need to handle &lt;code&gt;inf&lt;/code&gt;, &lt;code&gt;-inf&lt;/code&gt;, &lt;code&gt;NaN&lt;/code&gt; or any other 'pseudo-numbers'. You may output a different representation of the number (5,000 &lt;em&gt;may&lt;/em&gt; be output as 5e3 if you so choose).&lt;/p&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, fewest bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="95792" LastEditorUserId="9534" LastEditDate="2022-06-29T16:16:49.753" LastActivityDate="2022-06-29T16:16:49.753" CommentCount="7" CommunityOwnedDate="2021-04-16T15:16:34.403" ContentLicense="CC BY-SA 4.0" />
  <row Id="22117" PostTypeId="5" CreationDate="2021-04-16T20:21:05.017" Score="0" Body="&lt;p&gt;Use this tag on questions asking about appropriate etiquette and behaviour in specific circumstances that arise on the site. Please note that, while using the SE network of sites - including this site, you must follow the &lt;a href=&quot;https://codegolf.stackexchange.com/help/conduct&quot;&gt;Code of Conduct&lt;/a&gt;. In short, this requires you to be polite and respectful towards your fellow users.&lt;/p&gt;&#xA;&lt;p&gt;This tag can also be used on questions that ask about the most polite way to take a course of action, such as editing another user's power or posting a similar/duplicate answer to another user.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-16T20:21:05.017" LastActivityDate="2021-04-16T20:21:05.017" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22118" PostTypeId="4" CreationDate="2021-04-16T20:21:05.017" Score="0" Body="For questions about appropriate etiquette and behaviour on the site in specific circumstances." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-16T20:21:05.017" LastActivityDate="2021-04-16T20:21:05.017" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22119" PostTypeId="1" CreationDate="2021-04-16T23:36:01.770" Score="8" ViewCount="294" Body="&lt;p&gt;Chat events recently came up in &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/57676167#57676167&quot;&gt;chat&lt;/a&gt;. If we are to have events, it would be a good idea to plan out the following things first:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What the events will be about&lt;/li&gt;&#xA;&lt;li&gt;How often they'll be&lt;/li&gt;&#xA;&lt;li&gt;Whether we'll hold them in the Nineteenth Byte or a separate chat room.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;It'd be great to get suggestions on the above topics, so could you guys answer with one or more proposals for the above points, or whether or not we should have chat events at all?&lt;/p&gt;&#xA;" OwnerUserId="95792" LastEditorUserId="66833" LastEditDate="2021-08-13T16:17:33.130" LastActivityDate="2021-08-13T16:17:33.130" Title="Should we have chat events, and if so, how should we do them?" Tags="|discussion|chat|chat-events|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22120" PostTypeId="2" ParentId="22119" CreationDate="2021-04-16T23:37:31.253" Score="10" Body="&lt;h1&gt;Monthly Mini Golf in The Nineteenth Byte&lt;/h1&gt;&#xA;&lt;p&gt;Every month, we could hold an event in TNB which lasts an hour or two. CMCs could be drafted ahead of time (or during the event), and through some method we could choose which ones are posted when (or just make it a free for all).&lt;/p&gt;&#xA;&lt;p&gt;We could optionally also have some sort of scoring, where the person who wins the most CMCs would be the winner and potentially get a bounty.&lt;/p&gt;&#xA;&lt;p&gt;This would be a fun introduction for some users to TNB or even CGCC as a whole, and for users who are already active it could be a fun event to build the community.&lt;/p&gt;&#xA;&lt;p&gt;I don't think the clutter would be too much of a concern; other sites have similar events in their main chat rooms, and this is about as on topic as we can get. The events feature would advertise the event a little ahead of time, and users could register for it (which isn't required, but notifies them when it's about to start).&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-04-16T23:37:31.253" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="22121" PostTypeId="2" ParentId="22119" CreationDate="2021-04-16T23:42:00.607" Score="7" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;This is a good way to introduce our community. It may not be as effective as the Hot Network Questions (for example), but if anyone happens to be on SE Chat accross the network, they will be more likely to see the Nineteenth Byte (and hopefully join CGCC).&lt;/p&gt;&#xA;&lt;h2&gt;An event idea: Esolang Showcase&lt;/h2&gt;&#xA;&lt;p&gt;While on main &amp;quot;challenges that require the answers to be in a specific language are generally discouraged&amp;quot;, in an esolang showcase event chatters could solve simple challenges like &amp;quot;Hello World&amp;quot; or &amp;quot;Fizz Buzz&amp;quot; in a predetermined language someone wishes to share.&lt;/p&gt;&#xA;" OwnerUserId="90614" LastEditorUserId="90614" LastEditDate="2021-04-16T23:47:25.300" LastActivityDate="2021-04-16T23:47:25.300" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22122" PostTypeId="2" ParentId="22119" CreationDate="2021-04-17T00:21:22.423" Score="-1" Body="&lt;h1&gt;Yes, advertised in TNB, held elsewhere&lt;/h1&gt;&#xA;&lt;p&gt;As I &lt;a href=&quot;https://chat.stackexchange.com/transcript/240/2021/4/16/23-24&quot;&gt;said in TNB&lt;/a&gt;, my biggest worry about having scheduled events is that it could disrupt on-topic conversations held by people who don't want to be part of the event. It'd be unfair to force them to stop discussing whatever they are discussing, and it's impractical to hold a conversation in the middle of an event.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, I suggest that we schedule events in TNB's schedule, thus advertising them more, and then, when the event begins, users who want to take part move into a secondary room, and we keep a temporary pin to direct any late arrivals to the appropriate place.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-04-17T00:21:22.423" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22123" PostTypeId="2" ParentId="2140" CreationDate="2021-04-17T02:04:08.577" Score="1" Body="&lt;h1&gt;Meta-golf Branch integers without alphanumeric characters &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Recently I created a new programming language, &lt;a href=&quot;https://github.com/hyper-neutrino/branch-lang&quot; rel=&quot;nofollow noreferrer&quot;&gt;Branch&lt;/a&gt; (name thanks to caird coinheringaahing). Representing numbers is pretty easy (actually, trivial; you can just enter the number and it will set the value of the current node to that number).&lt;/p&gt;&#xA;&lt;p&gt;However, until a recent revision, you could only enter one digit, and larger numbers needed to be generated by combining digits with various operations. This led me to think of this challenge - given any integer, you can represent it without needing the digits, actually.&lt;/p&gt;&#xA;&lt;h2&gt;Branch Specifications&lt;/h2&gt;&#xA;&lt;p&gt;Branch operates on a binary tree. Initially, there is just one node with a &lt;code&gt;0&lt;/code&gt; as its value. Nodes hold &lt;code&gt;long long int&lt;/code&gt;s. Any node that's created (unless otherwise specified) has a &lt;code&gt;0&lt;/code&gt; initially.&lt;/p&gt;&#xA;&lt;p&gt;Without the digits, here are the relevant instructions (you can also check them out on the &lt;a href=&quot;https://github.com/hyper-neutrino/branch-lang/wiki/Instructions&quot; rel=&quot;nofollow noreferrer&quot;&gt;wiki page&lt;/a&gt;):&lt;/p&gt;&#xA;&lt;h3&gt;Unary Operators&lt;/h3&gt;&#xA;&lt;p&gt;&lt;code&gt;!&lt;/code&gt; - logical NOT; set the value to &lt;code&gt;1&lt;/code&gt; if it's &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt; otherwise&lt;br /&gt;&#xA;&lt;code&gt;~&lt;/code&gt; - bitwise NOT / complement; flip the bits; this is equivalent to &lt;code&gt;-1 - x&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;_&lt;/code&gt; - negate; set the value to &lt;code&gt;-x&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;{&lt;/code&gt; - decrement&lt;br /&gt;&#xA;&lt;code&gt;}&lt;/code&gt; - increment&lt;/p&gt;&#xA;&lt;h3&gt;Binary Operators&lt;/h3&gt;&#xA;&lt;p&gt;&lt;code&gt;+&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;, &lt;code&gt;*&lt;/code&gt;, &lt;code&gt;:&lt;/code&gt;, &lt;code&gt;%&lt;/code&gt;, &lt;code&gt;'&lt;/code&gt;, &lt;code&gt;&amp;lt;&lt;/code&gt;, &lt;code&gt;=&lt;/code&gt;, &lt;code&gt;&amp;gt;&lt;/code&gt;, &lt;code&gt;&amp;amp;&lt;/code&gt;, and &lt;code&gt;|&lt;/code&gt; are add, subtract, multiply, integer divide, modulo (keeps the sign of the right argument), exponentiation, strict less than (&lt;code&gt;1&lt;/code&gt; is true, &lt;code&gt;0&lt;/code&gt; is false), equality, strict greater than, bitwise AND, and bitwise OR, respectively.&lt;/p&gt;&#xA;&lt;p&gt;Division and modulo give &lt;code&gt;0&lt;/code&gt; if the right argument is &lt;code&gt;0&lt;/code&gt;. The left and right arguments are the left and right children. Note that Branch will read from STDIN if these are missing, instead of initializing to &lt;code&gt;0&lt;/code&gt;, so for this challenge, you need to ensure that the children are defined before calling a binary operator, because reading from STDIN is not allowed.&lt;/p&gt;&#xA;&lt;p&gt;The value of evaluating the operation will be stored in the current node.&lt;/p&gt;&#xA;&lt;h3&gt;Pointer Movement&lt;/h3&gt;&#xA;&lt;p&gt;&lt;code&gt;/&lt;/code&gt; - move to the left child (creates it if it does not exist)&lt;br /&gt;&#xA;&lt;code&gt;\&lt;/code&gt; - move to the right child (^)&lt;br /&gt;&#xA;&lt;code&gt;^&lt;/code&gt; - move to the parent of the current node (if it doesn't exist, a new node is created, and this node becomes the new node's left child)&lt;br /&gt;&#xA;&lt;code&gt;?&lt;/code&gt; - conditional - if the current value is &lt;code&gt;0&lt;/code&gt;, move to the left child, and otherwise, the right child (creates the required one if absent)&lt;/p&gt;&#xA;&lt;h3&gt;Miscellaneous&lt;/h3&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;quot;&lt;/code&gt; - set the parent's value to the current value (creates with this node as the left child)&lt;br /&gt;&#xA;&lt;code&gt;;&lt;/code&gt; - set the current value to the parent's value (creates with this node as the left child and with &lt;code&gt;0&lt;/code&gt; as the value)&lt;br /&gt;&#xA;&lt;code&gt;@&lt;/code&gt; - swaps the values of the children without changing the structure (creates both nodes with &lt;code&gt;0&lt;/code&gt; if necessary)&lt;br /&gt;&#xA;&lt;code&gt;[...]&lt;/code&gt; - loop; this works just like in BF; reaching the &lt;code&gt;[&lt;/code&gt; with &lt;code&gt;0&lt;/code&gt; as the value skips to the matching &lt;code&gt;]&lt;/code&gt;, and reaching &lt;code&gt;]&lt;/code&gt; with a non-zero value jumps back to the &lt;code&gt;[&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Finally, &lt;code&gt;#&lt;/code&gt; outputs the current value as an integer. There are some other I/O commands and other random things but they won't be used for this challenge. I have registers too, but I've chosen to keep them out. Finally, I removed the rotations from this challenge because I didn't feel like dealing with them, even though they probably aren't too complicated especially for anyone who knows how to implement AVL trees.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge Specification&lt;/h2&gt;&#xA;&lt;p&gt;For each integer from &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;100&lt;/code&gt;, you are to provide a snippet that produces that number as the current value. In other words, your snippet should not have &lt;code&gt;#&lt;/code&gt; in it, and when &lt;code&gt;#&lt;/code&gt; is appended to it, should output exactly that integer. You cannot do &lt;code&gt;1##&lt;/code&gt; to output &lt;code&gt;11&lt;/code&gt; (assuming digits were allowed), for example.&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;For &lt;code&gt;1&lt;/code&gt;, you could do something like &lt;code&gt;/^\^'&lt;/code&gt;, which creates the children as &lt;code&gt;0&lt;/code&gt; and then computes &lt;code&gt;0 ** 0&lt;/code&gt; which is equal to &lt;code&gt;1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Details&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;this is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt;; the submission with the least number of bytes total for all 100 snippets wins&lt;/li&gt;&#xA;&lt;li&gt;standard loopholes apply&lt;/li&gt;&#xA;&lt;li&gt;good luck and have fun!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;is this clear enough?&lt;/li&gt;&#xA;&lt;li&gt;is this too unnecessarily complicated; are there any things I could remove (like I did with the rotation operations) that would make this still interesting?&lt;/li&gt;&#xA;&lt;li&gt;is this even interesting?&lt;/li&gt;&#xA;&lt;li&gt;this is not a duplicate&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-05-14T13:38:49.150" LastActivityDate="2021-05-14T13:38:49.150" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22124" PostTypeId="2" ParentId="2140" CreationDate="2021-04-17T05:36:24.693" Score="-2" Body="&lt;p&gt;Given a positive even integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, generate a random Brainfuck snippet of length &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, containing only &lt;code&gt;+-&amp;lt;&amp;gt;&lt;/code&gt;, that do no modify to the tape or tapehead.&lt;/p&gt;&#xA;&lt;p&gt;To avoid random generation and try again or&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/65925/&quot;&gt;fallback into a trivial nop&lt;/a&gt; for invalid nops, your solution should run in polynomial time, and the ratio of possibility returning any two nops should be below polynomial.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2021-04-18T02:50:20.857" LastActivityDate="2021-04-18T02:50:20.857" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22125" PostTypeId="2" ParentId="5243" CreationDate="2021-04-17T09:59:27.020" Score="3" Body="&lt;h1&gt;500 rep for a Vim answer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/222709/sticky-polyhexes&quot;&gt;Sticky Polyhexes&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;What it says on the tin. An explanation would be appreciated.&lt;/p&gt;&#xA;&lt;p&gt;Language must be Vim, not the V derivative. Good luck!&lt;/p&gt;&#xA;&lt;p&gt;You may use bash commands in your script, but only commands which are in vanilla bash(no coreutils).&lt;/p&gt;&#xA;" OwnerUserId="80214" LastEditorUserId="80214" LastEditDate="2021-04-17T10:05:52.993" LastActivityDate="2021-04-17T10:05:52.993" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22126" PostTypeId="2" ParentId="2140" CreationDate="2021-04-17T17:02:56.027" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/224595/66833&quot;&gt;Reject tab, return to linefeed&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100887" LastEditorUserId="66833" LastEditDate="2021-04-28T14:15:08.107" LastActivityDate="2021-04-28T14:15:08.107" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22128" PostTypeId="2" ParentId="2140" CreationDate="2021-04-18T17:38:57.193" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/223792/close-neighbours-stick-together&quot;&gt;Close neighbours stick together&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-18T22:44:38.617" LastActivityDate="2021-04-18T22:44:38.617" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22129" PostTypeId="2" ParentId="2140" CreationDate="2021-04-18T22:43:20.977" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224476/best-rolling-ao5&quot;&gt;Best Rolling Ao5&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="17360" LastEditorUserId="17360" LastEditDate="2021-04-26T21:37:29.977" LastActivityDate="2021-04-26T21:37:29.977" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22131" PostTypeId="5" CreationDate="2021-04-19T16:30:25.673" Score="0" Body="&lt;p&gt;Any user with 15 reputation or more on the site can &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/flag-posts&quot;&gt;flag inappropriate posts&lt;/a&gt;. Depending on the type of flag, this aims to draw community attention to the post in order to be dealt with.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/questions/tagged/flags+faq&quot;&gt;The flagging FAQ&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This tag should be used on questions that directly relate to flagging and flagged posts. This includes, but is not limited to:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/questions/tagged/support&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt; questions on how the flagging system should be used on the site&lt;/li&gt;&#xA;&lt;li&gt;Questions about why specific flags were declined. Use this in conjunction with &lt;a href=&quot;/questions/tagged/declined-flags&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;declined-flags&amp;#39;&quot; rel=&quot;tag&quot;&gt;declined-flags&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Site policies on what should and shouldn't be flagged&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-19T16:30:25.673" LastActivityDate="2021-04-19T16:30:25.673" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22132" PostTypeId="4" CreationDate="2021-04-19T16:30:25.673" Score="0" Body="Flagging is a way for any user with 15 reputation or more to alert the site moderators about problematic posts. Use this tag on questions that directly relate to the flagging system and flags as a whole, or on questions about specific flags" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-19T16:30:25.673" LastActivityDate="2021-04-19T16:30:25.673" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22133" PostTypeId="2" ParentId="2140" CreationDate="2021-04-19T20:34:06.580" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/223881/implement-an-over-function&quot;&gt;Implement an Over function&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-20T00:17:56.003" LastActivityDate="2021-04-20T00:17:56.003" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22134" PostTypeId="1" CreationDate="2021-04-19T23:14:37.860" Score="9" ViewCount="61" Body="&lt;p&gt;&lt;strong&gt;EDIT&lt;/strong&gt; - seems like this change is a bit harder than I initially thought. I'll still collect ideas and we might look to get this changed in the future, but it's not a high priority.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/22115/68942&quot;&gt;This&lt;/a&gt; is now at +7/0 and seems to be a pretty solid consensus. I would like to finalize the proposal before getting in touch to get something done about it. The proposal is as follows:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt; - Authoritative reference required, Canonical answer required, Current answers are outdated, and Improve details do not offer anything to our side. Draw attention and Reward existing answer are the only two we need on our site. Should we go ahead with this proposal?&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;We current have six bounty reasons&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Authoritative reference required&lt;/strong&gt; - answers on this site are generally purely the product of someone's own work and then them golfing it down, possibly with the help of others. A source or credible factual backing behind an answer isn't really something that applies to this site, and in the very very rare situation where this might be a thing, users can use the Draw Attention bounty. &lt;em&gt;Proposal: remove this&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Canonical answer required&lt;/strong&gt; - any and all answers on this site need to be fully valid as per the challenge, and general usage and accessibility isn't something we worry about here (and isn't something that's necessarily that compatible with code golf either...). &lt;em&gt;Proposal: remove this&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Current answers are outdated&lt;/strong&gt; - that's not really a thing here; again, we don't concern ourselves with usability anyway, and we encourage answers in languages across a variety of periods of time. Should this somehow come up, users can use the Draw Attention bounty. &lt;em&gt;Proposal: remove this&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Improve details&lt;/strong&gt; - again, answers need to be fully valid as a necessary and sufficient condition, so this doesn't apply here. Details and explanations are specific to answers anyway, and if you want an explanation for an answer, you can ask nicely in a comment, and maybe offer to give a Reward Existing Answer bounty if they fulfill your request. This is just not really applicable to a non-Q&amp;amp;A site like CGCC. &lt;em&gt;Proposal: remove this&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;As such, we would only keep the remaining two:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Draw attention&lt;/strong&gt; - pretty self-explanatory. This bounty can be used for pretty much any of the extremely rare scenarios where one of the above &lt;em&gt;might&lt;/em&gt; apply for once, and for the general case that you want more attention on a forgotten or underappreciated challenge.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Reward existing answer&lt;/strong&gt; - pretty self-explanatory. This bounty is probably applicable to nearly all of the cases where we use bounties on this site, especially since deadline-less bounties are also awarded under this category.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;Please vote on this post to indicate if you agree or not, and leave a comment or an answer if you propose a change to it, such as keeping one of the four reasons, or renaming one instead of deleting it to add a new bounty reason.&lt;/h3&gt;&#xA;&lt;p&gt;If you are proposing a change, please consider carefully what use cases it would have and whether or not we would need it for a situation that can't be covered by Draw attention or Reward existing answer.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-06-09T13:59:37.160" LastActivityDate="2021-06-09T13:59:37.160" Title="Removing unnecessary bounty templates - final consensus" Tags="|discussion|status-deferred|bounty|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22135" PostTypeId="2" ParentId="22134" CreationDate="2021-04-19T23:31:17.690" Score="5" Body="&lt;h1&gt;Improve Details should be kept&lt;/h1&gt;&#xA;&lt;p&gt;There are some situations, like tips questions, where Improve Details might actually be useful. I think keeping one of the &amp;quot;normal&amp;quot; bounty reasons for things like this has very little cost, and can be useful.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-04-19T23:31:17.690" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22136" PostTypeId="1" AcceptedAnswerId="22144" CreationDate="2021-04-20T01:34:01.050" Score="5" ViewCount="101" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt; is, in my opinion, an incredibly vague tag, that overlaps significantly with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/functional-programming&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;functional-programming&amp;#39;&quot; rel=&quot;tag&quot;&gt;functional-programming&lt;/a&gt;. The tag wiki of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt; only has an excerpt that reads&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;For challenges that ask for a function or involve functions in some way. (Also known as methods or subroutines.)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Taking a browse through the 48 &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt; questions, they can be sorted into 3 categories:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Questions that ask answerers to submit a function as their solution. If this is the intended usage of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt;, then it makes it a &lt;a href=&quot;https://stackoverflow.blog/2010/08/07/the-death-of-meta-tags/&quot;&gt;meta tag&lt;/a&gt;, and this already falls under our program defaults (functions and programs)&lt;/li&gt;&#xA;&lt;li&gt;Questions that fall under the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/functional-programming&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;functional-programming&amp;#39;&quot; rel=&quot;tag&quot;&gt;functional-programming&lt;/a&gt; tag, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/216923/i-dont-like-curry&quot;&gt;this&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Questions that ask answerers to craft a mathematical function with specific requirements. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/11969/define-a-function-f-such-that-ffn-n-for-all-non-zero-integers-n&quot;&gt;this&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/115507/fgx-decreases-while-gfx-increases&quot;&gt;this&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The first and second categories should not be appropriate usage of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt;. They are covered by our site defaults, and the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/functional-programming&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;functional-programming&amp;#39;&quot; rel=&quot;tag&quot;&gt;functional-programming&lt;/a&gt; tag, respectively.&lt;/p&gt;&#xA;&lt;p&gt;The third is a legitimate style of question that we should welcome on the site. I also think this was the original usage of the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt; tag. However, it's currently being confused with other, more vague uses of the word &amp;quot;function&amp;quot;. As &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/57702550#57702550&quot;&gt;suggested by Bubbler&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/mathematical-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;mathematical-function&amp;#39;&quot; rel=&quot;tag&quot;&gt;mathematical-function&lt;/a&gt; or similar would be a better name.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This discussion is to answer the following questions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should we clean up the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt; tag?&lt;/li&gt;&#xA;&lt;li&gt;If so, how?&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should we remove it from posts in category 1, synonymize &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt; with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/functional-programming&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;functional-programming&amp;#39;&quot; rel=&quot;tag&quot;&gt;functional-programming&lt;/a&gt; and tag relevant questions with a new &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/mathematical-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;mathematical-function&amp;#39;&quot; rel=&quot;tag&quot;&gt;mathematical-function&lt;/a&gt; tag?&lt;/li&gt;&#xA;&lt;li&gt;Something else?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;What are your thoughts on the matter?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-04-20T18:24:52.300" Title="Cleaning up the vague [function] tag" Tags="|discussion|tags|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22137" PostTypeId="2" ParentId="5243" CreationDate="2021-04-20T02:23:54.983" Score="18" Body="&lt;h1&gt;300 rep for &lt;a href=&quot;https://github.com/Lyxal/Vyxal&quot; rel=&quot;nofollow noreferrer&quot;&gt;Vyxal&lt;/a&gt; answers&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;I'm basing this off the Japt bounty, so some of the wording is going to be the same&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Vyxal. It's one of the golfing languages ever made, and I think you'll like it. In fact, I think you'll like it so much, that if any of y'all post 5 Vyxal solutions in a 30 day period, Razetime, emanresu A and I (lyxal) will give you 300 reputation.&lt;/p&gt;&#xA;&lt;p&gt;The 5 answers have to be posted after 20/04/2021 (UTC).&lt;/p&gt;&#xA;&lt;p&gt;We'll be monitoring new solutions and keeping the list at the end of this answer updated but if we miss a solution of yours, please leave a comment with a link to it, or ping us in the &lt;a href=&quot;https://chat.stackexchange.com/rooms/106764/vyxal&quot;&gt;Vyxal chatroom&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Bounties will be suspended if rewarding the bounty dips our reputation below 10k. If, on the off-chance, this bounty proves to be popular enough, we may adjust the rep we award to avoid completely tanking it.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Useful links&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/106764/vyxal&quot;&gt;CGCC chatroom&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://vyxal.pythonanywhere.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Official interpreter&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/vyxal/Vyxal&quot; rel=&quot;nofollow noreferrer&quot;&gt;Repository (GitHub)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://vyxapedia.hyper-neutrino.xyz/beginners&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tutorial&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/223918/tips-for-golfing-in-vyxal/223923#223923&quot;&gt;Tips&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Now go forth and dominate the competition and get this language onto the ELO list!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Bounty Claims&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/a/223979/101522&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/223985/101522&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/223992/101522&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/224018/101522&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/224033/101522&quot;&gt;5&lt;/a&gt; (&lt;em&gt;awarded&lt;/em&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/92116/wasif&quot;&gt;Wasif&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/210497/write-a-hello-interpreter/224323#224323&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/224365/implement-minceraft/224373#224373&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/88653/print-a-10-by-10-grid-of-asterisks/224391#224391&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/220211/which-th-second-now-in-this-year/225245#225245&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/47005/different-way-forward/225281#225281&quot;&gt;5&lt;/a&gt; &lt;em&gt;(awarded)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/a-username&quot;&gt;A username&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/224768/generate-all-solvable-2xn-mazes/225285#225285&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/183073/simulating-exploding-dice/225292#225292&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/184734/which-big-number-is-bigger/225289#225289&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/185481/automatically-anti-predictably-assemble-an-alliterative-aria/225287#225287&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/181078/the-easy-road-to-code/225306#225306&quot;&gt;5&lt;/a&gt; &lt;em&gt;(awarded)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/100887/stackmeter&quot;&gt;StackMeter&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/a/225356/100887&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/225357/100887&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/225358/100887&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/225360/100887&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/225361/100887&quot;&gt;5&lt;/a&gt; &lt;em&gt;(awarded)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/68942/hyper-neutrino&quot;&gt;hyper-neutrino&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/a/224897/68942&quot;&gt;1&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/225299/68942&quot;&gt;2&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/225396/68942&quot;&gt;3&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/225397/68942&quot;&gt;4&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/225398/68942&quot;&gt;5&lt;/a&gt; &lt;em&gt;(awarded)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/98955/xigoi&quot;&gt;xigoi&lt;/a&gt;&lt;/strong&gt;:&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225412/98955&quot;&gt;1&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225413/98955&quot;&gt;2&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225423/98955&quot;&gt;3&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225685/98955&quot;&gt;4&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225687/98955&quot;&gt;5&lt;/a&gt; &lt;em&gt;(awarded)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/80050/a-stone-arachnid&quot;&gt;a stone arachnid&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/a/225537/80050&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/225668/80050&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/225681/80050&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/225683/80050&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/225815/80050&quot;&gt;5&lt;/a&gt; &lt;em&gt;(awarded)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/95792&quot;&gt;user&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/a/224930&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/226518&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/226519&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/226529&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/226592&quot;&gt;5&lt;/a&gt; &lt;em&gt;(awarded)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/99035/underslash&quot;&gt;Underslash&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/a/225394&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/225544&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/225653&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/225855&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/225862&quot;&gt;5&lt;/a&gt; &lt;em&gt;(awarded)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/45220/sjoerdpennings&quot;&gt;SjoerdPennings&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/a/235140/45220&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/233543/45220&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/235155/45220&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/235162/45220&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/235164/45220&quot;&gt;5&lt;/a&gt; &lt;em&gt;(awarded)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/107299/seggan&quot;&gt;Seggan&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/a/243235/107299&quot;&gt;1&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/243039/107299&quot;&gt;2&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/243261/107299&quot;&gt;3&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/243247/107299&quot;&gt;4&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/243333/107299&quot;&gt;5&lt;/a&gt; &lt;em&gt;(awarded)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/96037/mathcat&quot;&gt;mathcat&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/66127/catalan-numbers/242389#242389&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/242666/is-given-number-a-concat-of-two-squares/242737#242737&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/242726/triangle-tripler/242788#242788&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/243100/convert-a-string-of-ascii-characters-to-base-3-equivalents/243115#243115&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/243126/draw-an-ascii-pencil/243143#243143&quot;&gt;5&lt;/a&gt; &lt;em&gt;(awarded)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/105116/bgil-midol&quot;&gt;Bgil Midol&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/169724/is-this-number-evil/243563#243563&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/97713/print-the-digital-root/243564#243564&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/241080/is-it-a-pure-word/243574#243574&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/129596/am-i-divisible-by-double-the-sum-of-my-digits/243575#243575&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/235964/implement-the-hyperfactorial/243578#243578&quot;&gt;5&lt;/a&gt; &lt;em&gt;(awarded)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/a/246010/92689&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/246081/92689&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/246082/92689&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/246084/92689&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/246089/92689&quot;&gt;5&lt;/a&gt; &lt;em&gt;(awarded)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/103205/cjquines&quot;&gt;cjquines&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/a/248501/103205&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/248508/103205&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/248526/103205&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/248542/103205&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/248622/103205&quot;&gt;5&lt;/a&gt; &lt;em&gt;(awarded)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/17216/deadcode&quot;&gt;Deadcode&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/220281/semidivisibility/249423?r=SearchResults&amp;amp;s=5%7C0.0000#249423&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/85994/count-of-as-and-bs-must-be-equal-did-you-get-it-computer/249679?r=SearchResults&amp;amp;s=4%7C0.0000#249679&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/66197/is-it-a-pangram/249743?r=SearchResults&amp;amp;s=3%7C0.0000#249743&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/126373/am-i-a-fibonacci-number/249748?r=SearchResults&amp;amp;s=2%7C0.0000#249748&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/79644/how-many-steps-does-it-take-from-n-to-1-by-subtracting-the-greatest-divisor/249890?r=SearchResults&amp;amp;s=1%7C0.0000#249890&quot;&gt;5&lt;/a&gt; &lt;em&gt;(awarded)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/112514/tybocopperkettle&quot;&gt;tybocopperkettle&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/107634/approximate-bruns-constant/250177#250177&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/101961/the-squaring-sequence/250253#250253&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/105861/can-this-number-be-written-in-3x-1-format/250224#250224&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/66193/sums-of-consecutive-integers/250209#250209&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/140748/get-the-best-of-two-arrays/250214#250214&quot;&gt;5&lt;/a&gt; &lt;em&gt;(awarded)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/96266/pacmanboss256&quot;&gt;Pacmanboss256&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/168221/randomizing-until-0/252501#252501&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/73828/is-it-a-lipogram/252574#252574&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/136713/find-the-first-duplicated-element/252735#252735&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/103377/appending-string-lengths/252736#252736&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/252302/find-the-real-solutions-of-a-cubic/252357#252357&quot;&gt;5&lt;/a&gt; &lt;em&gt;(awarded)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/109916/dialfrost&quot;&gt;DialFrost&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/206158/what-calculator-is-this-datafile-for/252870#252870&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/78410/watson-crick-palindromes/252899#252899&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/132243/is-the-number-binary-heavy/252903#252903&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/252619/its-just-rocket-science-part-2-centrifuge/252907#252907&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/252264/its-just-rocket-science/252910#252910&quot;&gt;5&lt;/a&gt; &lt;em&gt;(awarded)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/114446/the-thonnu&quot;&gt;The Thonnu&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/102219/binary-to-decimal-converter/256486#256486&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/256166/is-it-true-ask-pip/256178#256178&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/101638/shortest-code-to-produce-non-deterministic-output/256484#256484&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/256003/calculate-my-income-tax/256142#256142&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/256050/friend-or-foe/256069#256069&quot;&gt;5&lt;/a&gt; &lt;em&gt;(awarded)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/113573/97-100-97-109&quot;&gt;97.100.97.109&lt;/a&gt;&lt;/strong&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/204813/golf-me-a-world-clock/257144#257144&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/252557/sample-from-the-discrete-triangular-distribution/257145#257145&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/252927/make-a-court-transcriber/257148#257148&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/257159/salacious-bacon-tripod/257179#257179&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/18925/hello-world-with-no-repetition/257365#257365&quot;&gt;5&lt;/a&gt; &lt;em&gt;(awarded)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;- **[Username](code golf user profile)**: [1](link), [2](link), [3](link), [4](link), [5](link)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2023-02-04T05:53:54.387" LastActivityDate="2023-02-04T05:53:54.387" CommentCount="4" CommunityOwnedDate="2021-04-21T05:12:51.097" ContentLicense="CC BY-SA 4.0" />
  <row Id="22139" PostTypeId="2" ParentId="2140" CreationDate="2021-04-20T09:37:30.153" Score="0" Body="&lt;p&gt;Extract json, with only few bytes.&lt;/p&gt;&#xA;&lt;p&gt;Extract the &amp;quot;name&amp;quot; of each dictionary in the json list.&lt;/p&gt;&#xA;&lt;p&gt;You are allowed to use any package which can be installed on Ubuntu 20.04.&lt;/p&gt;&#xA;&lt;p&gt;Example json:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;    {&#xA;        &amp;quot;id&amp;quot;:&amp;quot;d963984c-1075-4d25-8cd0-eae9a7e2d130&amp;quot;,&#xA;    &amp;quot;extra&amp;quot;: {&#xA;        &amp;quot;foo&amp;quot;: false,&#xA;        &amp;quot;bar&amp;quot;: null&#xA;    },&#xA;    &amp;quot;created_at&amp;quot;:&amp;quot;2020-05-06T15:31:59Z&amp;quot;,&#xA;    &amp;quot;name&amp;quot;: &amp;quot;NAME1&amp;quot;&#xA;    },&#xA;    {&#xA;    &amp;quot;id&amp;quot;:&amp;quot;ee63984c-1075-4d25-8cd0-eae9a7e2d1xx&amp;quot;,&#xA;    &amp;quot;name&amp;quot;: &amp;quot;NAME2&amp;quot;&#xA;    }&#xA;    ]&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This script would work:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;import json&#xA;import sys&#xA;&#xA;for item in json.loads(sys.stdin.read()):&#xA;    print(item['name'])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Desired output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;NAME1&#xA;NAME2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;But since I am very lazy, I am looking for a solution which needs less characters.&lt;/p&gt;&#xA;&lt;p&gt;The solution with the minimal number of bytes wins.&lt;/p&gt;&#xA;&lt;p&gt;Using non-ascii characters is not allowed.&lt;/p&gt;&#xA;&lt;p&gt;Compressing into base64 or similar is not allowed. The solution should be &amp;quot;type-able&amp;quot; by a human.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Since the question does not fit ot code-gold, I published it here: &lt;a href=&quot;https://stackoverflow.com/questions/67194693/filter-json-on-the-command-line&quot;&gt;https://stackoverflow.com/questions/67194693/filter-json-on-the-command-line&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="46406" LastEditorUserId="46406" LastEditDate="2021-04-21T11:11:21.790" LastActivityDate="2021-04-21T11:11:21.790" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="22140" PostTypeId="2" ParentId="2140" CreationDate="2021-04-20T10:54:06.513" Score="0" Body="&lt;h1&gt;Brainfuck to ESOPUNKS&lt;/h1&gt;&#xA;&lt;p&gt;Brainfuck use 8 instructions&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;byte(or bigint, your choose) a[inf]; bigint i;&#xA;+  ++a[i];&#xA;-  --a[i];&#xA;,  a[i]=getchar();&#xA;.  putchar(a[i]);&#xA;[  while(a[i]){&#xA;]  }&#xA;&amp;lt;  if(--i&amp;lt;0) undefined_behavior();&#xA;&amp;gt;  ++i;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://esolangs.org/wiki/ESOPUNK&quot; rel=&quot;nofollow noreferrer&quot;&gt;ESOPUNKS&lt;/a&gt; have two registers &lt;code&gt;X&lt;/code&gt; and &lt;code&gt;T&lt;/code&gt;, two I/O ports &lt;code&gt;#STDI&lt;/code&gt;(stdin, read like how brainfuck does), and &lt;code&gt;#STDO&lt;/code&gt;(stdout, undefined behavior if written &amp;lt;0 or &amp;gt;255), use these instructions:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;COPY a b     b=a; a,b,c can be X,T,#STDI,#STDO or integer as long as it makes sense(no giving integer a value, etc.)&#xA;ADDI a b c   c=b+a;&#xA;SUBI a b c   c=b-a;&#xA;MULI a b c   c=b*a;&#xA;DIVI a b c   c=b/a; Halt if a=0&#xA;MODI a b c   c=b%a; Halt if a=0&#xA;MARK label   label:&#xA;JUMP label   goto label;&#xA;TJMP label   if(T) goto label;&#xA;FJMP label   if(!T) goto label;&#xA;TEST a op b  T = (a op b); op = &amp;lt;, =(==), &amp;gt;&#xA;HALT         exit(0)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Didn't cover all instructions from esolangs as some are not implemented in the interperter)&lt;/p&gt;&#xA;&lt;p&gt;Now write a program that converts a Brainfuck program into a ESOPUNKS one. Your ESOPUNKS output should have O(1) lines.&lt;/p&gt;&#xA;&lt;p&gt;Note:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's possible to convert. &lt;a href=&quot;https://en.wikipedia.org/wiki/Counter_machine&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wiki&lt;/a&gt; shows a proof that applies with small removal.&lt;/li&gt;&#xA;&lt;li&gt;It's possible for bounded lines to store unbounded info as unbounded integer behave as operator&lt;/li&gt;&#xA;&lt;li&gt;Outputting may need a snippet repeating 256 times to allow any possible output; However I don't care length of output(as long as it's bounded), and the repeating can be generated with small code, so this shouldn't matter much.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Code-golf, shortest code in the language wins.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2021-04-20T10:54:06.513" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22141" PostTypeId="2" ParentId="22005" CreationDate="2021-04-20T11:35:14.983" Score="-4" Body="&lt;h1&gt;Yes, hosted in main site with questions having a special tag&lt;/h1&gt;&#xA;&lt;p&gt;This is somehow like Redwolf's suggestion&lt;/p&gt;&#xA;&lt;p&gt;We will create a tag named &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/blog&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;blog&amp;#39;&quot; rel=&quot;tag&quot;&gt;blog&lt;/a&gt; in main site and we can write the blog in a self Q&amp;amp;A style.&lt;/p&gt;&#xA;&lt;p&gt;Like a blog post on creating esolangs with python:&lt;/p&gt;&#xA;&lt;p&gt;Title: How to create an esolang in Python?&lt;/p&gt;&#xA;&lt;p&gt;Question: &lt;em&gt;(Write like an asker, don't include a lot of things there)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Answer: &lt;em&gt;(Broadly talk and describe on the topic)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Main site is better than meta, because meta is about to talk on Stack exchange site features, and main site is directly on-topic (In my humble opinion)&lt;/p&gt;&#xA;" OwnerUserId="92116" LastActivityDate="2021-04-20T11:35:14.983" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22143" PostTypeId="1" CreationDate="2021-04-20T16:55:05.393" Score="25" ViewCount="207" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/22045/vote-for-your-new-tnb-room-owners?cb=1&quot;&gt;The votes are in&lt;/a&gt;, and the following four members of our community have been elected as room owners of CGCC's main chat room, &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/337270/bubbler&quot;&gt;&lt;img src=&quot;https://stackexchange.com/users/flair/5831620.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/users/274572/caird-coinheringaahing&quot;&gt;&lt;img src=&quot;https://stackexchange.com/users/flair/10398261.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/users/130368/adam&quot;&gt;&lt;img src=&quot;https://stackexchange.com/users/flair/3114363.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/users/347075/redwolf-programs&quot;&gt;&lt;img src=&quot;https://stackexchange.com/users/flair/10936061.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;They have been instated effective immediately. Please welcome them as our new room owners and join us in thanking them for volunteering.&lt;/p&gt;&#xA;&lt;p&gt;In the words, of Dennis, may the odds be ever in their favor.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-04-20T16:55:05.393" Title="Welcome The Nineteenth Byte's newest room owners!" Tags="|discussion|chat|moderation|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22144" PostTypeId="2" ParentId="22136" CreationDate="2021-04-20T18:01:30.697" Score="5" Body="&lt;p&gt;This is not a complete answer but some thoughts that wouldn't fit in a comment.&lt;/p&gt;&#xA;&lt;h2&gt;I don't think that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/mathematical-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;mathematical-function&amp;#39;&quot; rel=&quot;tag&quot;&gt;mathematical-function&lt;/a&gt; is a very good name.&lt;/h2&gt;&#xA;&lt;p&gt;The challenges in category 3 have an &lt;em&gt;interesting&lt;/em&gt; unifying feature: the fact that they don't mandate particular outputs, but require some property to be true. They do all involve mathematical functions, because mathematical functions are a good language to describe properties.  They are not &lt;em&gt;about&lt;/em&gt; functions as much as they are about properties. There are many other challenges that do involve mathematical functions or are even &lt;em&gt;about&lt;/em&gt; a particular mathematical function (e.g. Fibonacci, factorial etc.). Anything with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; has a high probability of involving mathematical functions.&lt;/p&gt;&#xA;&lt;p&gt;I think calling it &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/mathematical-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;mathematical-function&amp;#39;&quot; rel=&quot;tag&quot;&gt;mathematical-function&lt;/a&gt;, just creates another tag with a vague name, which may very well end up slapped on all sorts of stuff.&lt;/p&gt;&#xA;&lt;p&gt;The posts here have an &lt;em&gt;interesting&lt;/em&gt; unifying feature that not all function related challenges have. So our tag should have a name that captures this feature.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;I suggest &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/open-ended-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; rel=&quot;tag&quot;&gt;open-ended-function&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;I think the key feature we want though is a name that doesn't cause people to jump to the wrong conclusion and end up tagging a bunch of random challenges.  This makes the tag useless.&lt;/p&gt;&#xA;&lt;p&gt;For these reasons I suggest &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/open-ended-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; rel=&quot;tag&quot;&gt;open-ended-function&lt;/a&gt;.  This expresses the open-endedness that unifies them and is hard to misinterpret as something else. It probably isn't clear at first sight what this means, but I think that just means newbies click on the tag to read the description, while experienced users will just know what it means.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2021-04-20T18:07:04.233" LastActivityDate="2021-04-20T18:07:04.233" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22145" PostTypeId="2" ParentId="22136" CreationDate="2021-04-20T18:24:52.300" Score="1" Body="&lt;h2&gt;Create &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/define-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;define-function&amp;#39;&quot; rel=&quot;tag&quot;&gt;define-function&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/blackbox-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;blackbox-function&amp;#39;&quot; rel=&quot;tag&quot;&gt;blackbox-function&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;I agree with Wheat Wizard in that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/mathematical-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;mathematical-function&amp;#39;&quot; rel=&quot;tag&quot;&gt;mathematical-function&lt;/a&gt; is vague. For questions that require defining/finding mathematical functions that meet some critera, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/define-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;define-function&amp;#39;&quot; rel=&quot;tag&quot;&gt;define-function&lt;/a&gt; may be a better name.&lt;/p&gt;&#xA;&lt;p&gt;There are also some questions that involve taking blackbox functions as input but don't have to do with functional programming. If there are enough of them, I think the tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/blackbox-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;blackbox-function&amp;#39;&quot; rel=&quot;tag&quot;&gt;blackbox-function&lt;/a&gt; would be appropriate.&lt;/p&gt;&#xA;" OwnerUserId="95792" LastActivityDate="2021-04-20T18:24:52.300" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22146" PostTypeId="2" ParentId="2140" CreationDate="2021-04-20T18:28:47.977" Score="7" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/223994/did-i-die-or-not&quot;&gt;Did I die or not?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-21T00:12:41.970" LastActivityDate="2021-04-21T00:12:41.970" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22147" PostTypeId="2" ParentId="2140" CreationDate="2021-04-20T18:52:07.527" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224324/sum-over-an-interval&quot;&gt;Sum over an Interval&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="99035" LastEditorUserId="99035" LastEditDate="2021-04-24T21:02:35.907" LastActivityDate="2021-04-24T21:02:35.907" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22149" PostTypeId="2" ParentId="2140" CreationDate="2021-04-21T20:46:39.963" Score="3" Body="&lt;h1&gt;Worst time complexity in under 100 bytes&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Time_complexity&quot; rel=&quot;nofollow noreferrer&quot;&gt;Time complexity&lt;/a&gt;, typically represented in Big O notation, represents how long a program will typically take to run given some input(s), ignoring constants.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to do one of the following things, with the worst time complexity possible:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Sort an array of integers&lt;/li&gt;&#xA;&lt;li&gt;Find duplicates in an array&lt;/li&gt;&#xA;&lt;li&gt;Find longest strictly increasing slice of an array of integers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Tasks:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;All of the tasks involve taking one input, an array of items, in any reasonable format, and returning an array. If your language supports mutable array data types, this is an allowed output format. Assume all items in the arrays will be (not necessarily positive) integers.&lt;/p&gt;&#xA;&lt;p&gt;If you choose sorting: You may choose to sort the array by minimum or maximum.&lt;/p&gt;&#xA;&lt;p&gt;If you choose listing duplicates: You may include a duplicate item any number of times in the output; &lt;code&gt;[1, 2, 2, 3, 4]&lt;/code&gt; could result in &lt;code&gt;[2, 4]&lt;/code&gt;, &lt;code&gt;[2, 2, 4]&lt;/code&gt;, or even &lt;code&gt;[2, 4, 4, 4]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If you choose longest strictly increasing slice: Duplicate items do not count as increasing, so &lt;code&gt;[1, 2, 2, 4]&lt;/code&gt; is not strictly increasing. The items do not have to increase by a steady amount; &lt;code&gt;[-1, 4, 14, 16, 17]&lt;/code&gt; is strictly increasing.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your program must be 100 bytes or less. Your program should terminate in a finite amount of time. You can assume your program will never run out of memory, and it does not have to terminate before the heat death of the universe.&lt;/p&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;. The winner will be based on the average time complexity, with slower being better, followed by the best case and then worst case for ties.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2021-12-15T19:32:56.913" LastActivityDate="2021-12-15T19:32:56.913" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="22150" PostTypeId="2" ParentId="2140" CreationDate="2021-04-22T05:35:28.550" Score="3" Body="&lt;h1&gt;A Self-Referential Sentence&lt;/h1&gt;&#xA;&lt;h2&gt;The Story&lt;/h2&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;One day, you decide that you want a sentence that tells you where in the sentence the letter T occurs (excluding whitespace and punctuation). Out of curiosity, you try to make one. Messing around a little you get&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;T is the first, fourth, eleventh, sixteenth, twenty-fourth, ....&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Oh dear, this sentence appears to run forever. But you now think you have an interesting number sequence, so you slap it into the OEIS search bar and lo and behold you find sequence &lt;a href=&quot;https://oeis.org/A005224&quot; rel=&quot;nofollow noreferrer&quot;&gt;A005224&lt;/a&gt;, Aronson's sequence. And better yet, an interesting code-golf problem that no appears to have posed before!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;The Task&lt;/h2&gt;&#xA;&lt;p&gt;Your task is to write a program that takes in a single positive integer, &lt;code&gt;n&lt;/code&gt;, as input and gives the position of the &lt;code&gt;n&lt;/code&gt;-th &amp;quot;t&amp;quot; in the above sentence (indexing begins at 1 for the sake of this problem). For example, an input of &lt;code&gt;1&lt;/code&gt; should return &lt;code&gt;1&lt;/code&gt;, while &lt;code&gt;2&lt;/code&gt; should return &lt;code&gt;4&lt;/code&gt;. The input number will not exceed 4 decimal digits in length (i.e. the maximum input is 9999)&lt;/p&gt;&#xA;&lt;p&gt;As always, the shortest code in bytes wins, and standard loopholes apply.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;The Meta&lt;/h2&gt;&#xA;&lt;p&gt;Ok, so I have a couple of questions, since this my first sandbox post.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;What can I do to flesh out this problem? This seems short, especially for a CGSE prompt. Should I somehow flesh out the heading fluff? Or should I add something more to the task itself?&lt;/li&gt;&#xA;&lt;li&gt;I was pretty thorough in my search of the sandbox and main site for similar problems, but I could always have missed something, so please let me know if this is a duplicate.&lt;/li&gt;&#xA;&lt;li&gt;Is the 4 digit input limit reasonable? Should I raise it or lower it? Remove it entirely? Since I'm not providing a file with ordinal strings, it seems like having a restriction on the size of the input is quite important.&lt;/li&gt;&#xA;&lt;li&gt;Finally, please let me know if there's any other glaring problems in this prompt, this is both a first draft, and my first attempt at a code-golf prompt (since high-school).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="29838" LastEditorUserId="29838" LastEditDate="2021-04-22T22:39:08.610" LastActivityDate="2021-04-22T22:39:08.610" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22151" PostTypeId="2" ParentId="2140" CreationDate="2021-04-22T06:14:07.440" Score="4" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/224349/77516&quot;&gt;Do I need a win streak?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77516" LastEditorUserId="77516" LastEditDate="2021-04-25T07:30:05.853" LastActivityDate="2021-04-25T07:30:05.853" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="22152" PostTypeId="2" ParentId="2140" CreationDate="2021-04-22T07:37:00.377" Score="0" Body="&lt;h1&gt;Generate a uncomputable number&lt;/h1&gt;&#xA;&lt;p&gt;An uncomputable number is a number that some digit can't be computed in finite time.&lt;/p&gt;&#xA;&lt;p&gt;Now you're to generate and output one of them.&lt;/p&gt;&#xA;&lt;p&gt;You can(and need to) use &lt;code&gt;\b&lt;/code&gt; to undo an outputted byte, but every byte should stop changing from some time.&lt;/p&gt;&#xA;&lt;p&gt;An example solution, assuming &lt;code&gt;stepN(p, n)&lt;/code&gt; checks if program &lt;code&gt;p&lt;/code&gt; halts in &lt;code&gt;n&lt;/code&gt; steps, returning 0 or 1:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;s = [];&#xA;output('0.');&#xA;for (i=1; ; ++i) {&#xA;    t = [stepN(j, i) for j in [1,n]]&#xA;    while (s is not a prefix of t) {&#xA;        output('\b');&#xA;        s.remove_last();&#xA;    }&#xA;    for (j=s.length; j&amp;lt;t.length; ++j) {&#xA;        s.insert_to_last(t[j]);&#xA;        output(t[j]);&#xA;    }&#xA;} // 0.s[0]s[1]s[2]s[3]..., s[i] mean if program i halt&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2021-04-22T07:47:07.443" LastActivityDate="2021-04-22T07:47:07.443" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="22153" PostTypeId="2" ParentId="2140" CreationDate="2021-04-22T08:04:37.223" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224730/base-ically-god&quot;&gt;Base-ically god&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="101762" LastEditorUserId="66833" LastEditDate="2021-05-01T18:12:48.377" LastActivityDate="2021-05-01T18:12:48.377" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22155" PostTypeId="2" ParentId="2140" CreationDate="2021-04-22T16:02:10.043" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/226849/66833&quot;&gt;Ambiguous Chemical Formula&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="66833" LastEditDate="2021-06-07T01:01:24.067" LastActivityDate="2021-06-07T01:01:24.067" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="22156" PostTypeId="5" CreationDate="2021-04-22T19:14:18.380" Score="0" Body="&lt;p&gt;Use this tag on questions about the formatting system used by Stack Exchange.&lt;/p&gt;&#xA;&lt;p&gt;Questions with this tag should typically be about one of the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Guides to using specific formatting on the site, for example, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12456/is-there-a-new-consensus-on-answer-headers&quot;&gt;answer headers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Bug reports about the formatting failing due to specific settings on the site, such as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19311/in-code-triggers-latex-in-preview&quot;&gt;&lt;span class=&quot;math-container&quot;&gt;\$\LaTeX\$&lt;/span&gt;&lt;/a&gt; or Markdown&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bug reports about formatting errors that are reproducible and applicable to a large number of other sites on the network should be posted to &lt;a href=&quot;https://meta.stackexchange.com/&quot;&gt;Mother Meta&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Note the related &lt;a href=&quot;/questions/tagged/markdown&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;markdown&amp;#39;&quot; rel=&quot;tag&quot;&gt;markdown&lt;/a&gt; tag for questions specific to the Markdown system used by Stack Exchange&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-29T13:34:42.150" LastActivityDate="2021-04-29T13:34:42.150" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22157" PostTypeId="4" CreationDate="2021-04-22T19:14:18.380" Score="0" Body="For questions about the formatting used by Stack Exchange, including bug reports about problems with formatting and support questions about how to use the formatting" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-29T13:34:42.150" LastActivityDate="2021-04-29T13:34:42.150" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22158" PostTypeId="5" CreationDate="2021-04-22T20:11:27.377" Score="0" Body="&lt;p&gt;On Feb 23rd, 2016, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8538/66833&quot;&gt;CGCC graduated&lt;/a&gt;. This meant that we moved from the beta phase, where we defined the site scope to being a full site, with the same abilities and privileges as any other full site on the network.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Do not use this tag on new questions&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;We have fully graduated, having gone through both stages of &lt;a href=&quot;https://meta.stackexchange.com/questions/260754/feedback-requested-design-independent-graduation&quot;&gt;design independent graduation&lt;/a&gt;, so there should be no questions about the graduation process specifically related to CGCC.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-22T20:11:27.377" LastActivityDate="2021-04-22T20:11:27.377" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22159" PostTypeId="4" CreationDate="2021-04-22T20:11:27.377" Score="0" Body="On the 23rd of February 2016, CGCC graduated from beta into a full site. Questions about the graduation process used this tag before graduating. New questions should not use this tag." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-22T20:11:27.377" LastActivityDate="2021-04-22T20:11:27.377" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22161" PostTypeId="1" AcceptedAnswerId="22299" CreationDate="2021-04-23T04:52:59.870" Score="6" ViewCount="127" Body="&lt;p&gt;&lt;strong&gt;EDIT&lt;/strong&gt; This is now &lt;s&gt;&lt;a href=&quot;/questions/tagged/status-review&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-review&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-review&lt;/a&gt;&lt;/s&gt; &lt;s&gt;&lt;a href=&quot;/questions/tagged/status-planned&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-planned&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-planned&lt;/a&gt;&lt;/s&gt; &lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;! Thanks to SE for making this happen pretty quickly :)&lt;/p&gt;&#xA;&lt;p&gt;In case anyone hasn't noticed, we have an info box in the top right corner above the official blog, meta features, and hot meta posts box. This isn't on every site and apparently isn't an easy setting to change and likely requires devs to edit it. As such, I have been instructed to post it for &lt;a href=&quot;/questions/tagged/status-review&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-review&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-review&lt;/a&gt; so it goes on the to-do list and hopefully is edited ASAP.&lt;/p&gt;&#xA;&lt;p&gt;The new text we would like is:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/20861/welcome-to-code-golf-and-coding-challenges-stack-exchange&quot;&gt;Welcome to Code Golf and Coding Challenges Stack Exchange!&lt;/a&gt; This is a site for recreational programming competitions, not general programming questions. Challenges must have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8130/why-do-we-have-objective-winning-criteria&quot;&gt;an objective scoring criterion&lt;/a&gt;, and it is highly recommended to first post proposed challenges in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?answertab=active&quot;&gt;Sandbox&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;a href=&amp;quot;https://codegolf.meta.stackexchange.com/questions/20861/welcome-to-code-golf-and-coding-challenges-stack-exchange&amp;quot;&amp;gt;Welcome to Code Golf and Coding Challenges Stack Exchange!&amp;lt;/a&amp;gt; This is a site for recreational programming competitions, not general programming questions. Challenges must have &amp;lt;a href=&amp;quot;https://codegolf.meta.stackexchange.com/questions/8130/why-do-we-have-objective-winning-criteria&amp;quot;&amp;gt;an objective scoring criterion&amp;lt;/a&amp;gt;, and it is highly recommended to first post proposed challenges in the &amp;lt;a href=&amp;quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?answertab=active&amp;quot;&amp;gt;Sandbox&amp;lt;/a&amp;gt;.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Thanks to caird coinheringaahing for this proposal, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20883&quot;&gt;here&lt;/a&gt;).&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-05-11T23:09:45.377" LastActivityDate="2021-05-11T23:09:45.377" Title="An update to our info box" Tags="|feature-request|status-completed|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22162" PostTypeId="2" ParentId="22161" CreationDate="2021-04-23T04:52:59.870" Score="11" Body="&lt;h1&gt;Link to the active-sorted sandbox&lt;/h1&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-04-23T04:52:59.870" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22163" PostTypeId="2" ParentId="22161" CreationDate="2021-04-23T04:55:04.927" Score="-4" Body="&lt;h1&gt;Link to the sandbox normally (keeps the user's client-side sorting method)&lt;/h1&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-04-23T04:55:04.927" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22164" PostTypeId="2" ParentId="2140" CreationDate="2021-04-23T09:52:00.440" Score="0" Body="&lt;h1&gt;Write a fast-growing assembly function&lt;/h1&gt;&#xA;&lt;h2&gt;Synopsis&lt;/h2&gt;&#xA;&lt;p&gt;Your goal is to implement the (asymptotically) fastest growing function within bounded code on a fictional CPU utilizing a quite limited, yet (probably) turing-complete instruction set.&lt;/p&gt;&#xA;&lt;h2&gt;Environment&lt;/h2&gt;&#xA;&lt;p&gt;The CPU utilizes unbounded RAM as well as two registers, the accumulator A and the program counter C, with words consisting of arbitrary integers, such that neither overflows nor underflows are possible. RAM is used to store data as well as code, allowing for self-modifying programs. Each instruction takes one parameter and therefore consists of two words; all instructions of your program are stored sequentially in RAM, starting at address 0. The following instructions can be used, P representing the parameter of the instruction:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Mnemonic&lt;/th&gt;&#xA;&lt;th&gt;Corresponding word&lt;/th&gt;&#xA;&lt;th&gt;Behavior&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;LOAD P&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;td&gt;A := RAM[P]; C += 2&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;SAVE P&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;RAM[P] := A; C += 2&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;CNST P&lt;/td&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;A := P; C += 2&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ADDT P&lt;/td&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;td&gt;A += RAM[P]; C += 2&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;NEGA P&lt;/td&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;td&gt;A := -RAM[P]; C += 2&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;JUMP P&lt;/td&gt;&#xA;&lt;td&gt;5&lt;/td&gt;&#xA;&lt;td&gt;C := P&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;JMPN P&lt;/td&gt;&#xA;&lt;td&gt;6&lt;/td&gt;&#xA;&lt;td&gt;If A &amp;lt;= 0 then C := P else C += 2.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;HALT P&lt;/td&gt;&#xA;&lt;td&gt;every other number&lt;/td&gt;&#xA;&lt;td&gt;The program halts.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;At each step, the instruction at address C will be executed using the parameter stored at C + 1.&#xA;Both A and C will be initialized to 0 at the start of a program's execution. The word at -1 is supposed to be your input which can be guaranteed to be non-negative, other words not storing any instructions initially contain 0. The number stored at -2 will be considered your program's output, which must also be positive in all but finitely many cases.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;At the initial state, your program may not occupy more than the first 2048 words, however, during execution, there are no bounds.&#xA;Of course, you don't have to write your program in bytecode, using some assembly equivalent or ultimately any other language is fine as well, as long as you provide some rules/translator and show the result does not exceed the given bounds.&lt;/p&gt;&#xA;&lt;p&gt;Every answer should come with some rough argument showing the program always halts, as well as some approximate lower bound on its growth rate. As the given space might very well suffice for some extremely fast-growing functions, it might be helpful to utilize the slow-/fast-growing hierarchy, as it provides a relatively simple way to compare two answers. Answers will be ranked by lower bounds that can be shown to hold.&lt;/p&gt;&#xA;&lt;h3&gt;Questions&lt;/h3&gt;&#xA;&lt;p&gt;I wonder what tags could be used in this case, atomic-code-golf, restricted-source and busy-beaver perhaps? Not entirely sure whether these fit. Also, is there any behavior left undefined? It doesn't seem like that's the case, but there might be some edge cases I forgot about.&lt;/p&gt;&#xA;" OwnerUserId="53416" LastActivityDate="2021-04-23T09:52:00.440" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="22165" PostTypeId="5" CreationDate="2021-04-23T13:15:04.190" Score="0" Body="&lt;p&gt;This tag indicates that the question is about some sort of handicap system, often in an attempt to make code golf challenges more fair between languages. Be aware that handicaps are generally unpopular, and questions about them are likely to be downvoted.&lt;/p&gt;&#xA;&lt;p&gt;Code golf challenges are generally regarded as a series of competitions between solutions in the same language, thus avoiding the need for a handicap. Java solutions compete against other Java solutions and against languages of a comparable length, rather than trying to beat languages specifically designed for code golf&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-23T13:15:04.190" LastActivityDate="2021-04-23T13:15:04.190" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22166" PostTypeId="4" CreationDate="2021-04-23T13:15:04.190" Score="0" Body="For questions that discuss the idea of language handicaps in code golf challenge. Note that it is generally discouraged to include handicaps, and to instead treat code golf as a series of competitions between solutions in the same language." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-23T13:15:04.190" LastActivityDate="2021-04-23T13:15:04.190" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22167" PostTypeId="2" ParentId="2140" CreationDate="2021-04-23T23:31:35.383" Score="1" Body="&lt;h1&gt;Closest Binary Fraction&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/rational-numbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;rational-numbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;rational-numbers&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr/&gt;&#xA;&lt;p&gt;For this challenge, a &lt;strong&gt;binary fraction&lt;/strong&gt; is a fraction where the denominator is a power of two. Your program (or function) should take a rational number as input, and return the nearest binary fraction with a given denominator.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The first input will consist of a rational number. This can be represented by any of the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A floating point number, or built-in rational type&lt;/li&gt;&#xA;&lt;li&gt;A fraction, either as a built-in rational or fraction type, or represented as a pair of numbers&lt;/li&gt;&#xA;&lt;li&gt;A decimal string, in any chosen base&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The second input is an integer &lt;span class=&quot;math-container&quot;&gt;\$d \ge 1\$&lt;/span&gt;, representing the denominator of the binary fraction.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Output &lt;strong&gt;must&lt;/strong&gt; be able to represent the exact fraction. This means any of the input formats for fractions are valid, as long as they can reasonably represent any valid outputs.&lt;/p&gt;&#xA;&lt;p&gt;You may choose if you want to simplify the output. Given the fraction &lt;code&gt;9 / 19&lt;/code&gt; and the denominator &lt;code&gt;8&lt;/code&gt;, either &lt;code&gt;4 / 8&lt;/code&gt; or &lt;code&gt;1 / 2&lt;/code&gt; would be accepted.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test cases:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Other:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. &lt;em&gt;Unfinished and also a dupe of a newer challenge of mine&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2021-06-04T02:02:49.877" LastActivityDate="2021-06-04T02:02:49.877" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22168" PostTypeId="2" ParentId="2140" CreationDate="2021-04-24T06:06:41.487" Score="2" Body="&lt;h1&gt;Solve the Alien Probe puzzle &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/224598&quot;&gt;Posted&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2021-04-28T15:49:26.057" LastActivityDate="2021-04-28T15:49:26.057" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22170" PostTypeId="2" ParentId="2140" CreationDate="2021-04-24T09:41:54.913" Score="4" Body="&lt;h2&gt;Death-onacci sequence (WIP)&lt;/h2&gt;&#xA;&lt;p&gt;The traditional Fibonacci sequence grows forever:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 1 1 2 3 5 8 13 21 ... 1,346,269 ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and is given by this formula:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;f(n) = f(n-1) + f(n-2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;where the initial numbers in the sequence are &lt;code&gt;0, 1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;However, there's a set of as-yet unnamed sequences, where a previous number 'dies' and is removed from the total.&lt;/p&gt;&#xA;&lt;p&gt;For instance the sequence for the 5th death-onacci (m = 5) is given by&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;f(n) = f(n-1) + f(n-2) + f(n-3) + f(n-4) - f(n-5)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And the first m-1 numbers is 0, followed by a single 1 (so for m=5 the sequence start &lt;code&gt;0 0 0 0 1&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;p&gt;Here are some test cases:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;n&lt;/th&gt;&#xA;&lt;th&gt;f(n), m=3&lt;/th&gt;&#xA;&lt;th&gt;f(n), m=4&lt;/th&gt;&#xA;&lt;th&gt;f(n), m=5&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;5&lt;/td&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;6&lt;/td&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;7&lt;/td&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;td&gt;6&lt;/td&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;8&lt;/td&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;td&gt;11&lt;/td&gt;&#xA;&lt;td&gt;8&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;9&lt;/td&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;td&gt;19&lt;/td&gt;&#xA;&lt;td&gt;14&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;10&lt;/td&gt;&#xA;&lt;td&gt;5&lt;/td&gt;&#xA;&lt;td&gt;32&lt;/td&gt;&#xA;&lt;td&gt;27&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;11&lt;/td&gt;&#xA;&lt;td&gt;5&lt;/td&gt;&#xA;&lt;td&gt;56&lt;/td&gt;&#xA;&lt;td&gt;51&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;12&lt;/td&gt;&#xA;&lt;td&gt;6&lt;/td&gt;&#xA;&lt;td&gt;96&lt;/td&gt;&#xA;&lt;td&gt;96&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;13&lt;/td&gt;&#xA;&lt;td&gt;6&lt;/td&gt;&#xA;&lt;td&gt;165&lt;/td&gt;&#xA;&lt;td&gt;180&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;14&lt;/td&gt;&#xA;&lt;td&gt;7&lt;/td&gt;&#xA;&lt;td&gt;285&lt;/td&gt;&#xA;&lt;td&gt;340&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;15&lt;/td&gt;&#xA;&lt;td&gt;7&lt;/td&gt;&#xA;&lt;td&gt;490&lt;/td&gt;&#xA;&lt;td&gt;640&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;16&lt;/td&gt;&#xA;&lt;td&gt;8&lt;/td&gt;&#xA;&lt;td&gt;844&lt;/td&gt;&#xA;&lt;td&gt;1205&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;17&lt;/td&gt;&#xA;&lt;td&gt;8&lt;/td&gt;&#xA;&lt;td&gt;1454&lt;/td&gt;&#xA;&lt;td&gt;2269&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;18&lt;/td&gt;&#xA;&lt;td&gt;9&lt;/td&gt;&#xA;&lt;td&gt;2503&lt;/td&gt;&#xA;&lt;td&gt;4274&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;19&lt;/td&gt;&#xA;&lt;td&gt;9&lt;/td&gt;&#xA;&lt;td&gt;4311&lt;/td&gt;&#xA;&lt;td&gt;8048&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;20&lt;/td&gt;&#xA;&lt;td&gt;10&lt;/td&gt;&#xA;&lt;td&gt;7424&lt;/td&gt;&#xA;&lt;td&gt;15156&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;21&lt;/td&gt;&#xA;&lt;td&gt;10&lt;/td&gt;&#xA;&lt;td&gt;12784&lt;/td&gt;&#xA;&lt;td&gt;28542&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;22&lt;/td&gt;&#xA;&lt;td&gt;11&lt;/td&gt;&#xA;&lt;td&gt;22016&lt;/td&gt;&#xA;&lt;td&gt;53751&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;23&lt;/td&gt;&#xA;&lt;td&gt;11&lt;/td&gt;&#xA;&lt;td&gt;37913&lt;/td&gt;&#xA;&lt;td&gt;101223&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;24&lt;/td&gt;&#xA;&lt;td&gt;12&lt;/td&gt;&#xA;&lt;td&gt;65289&lt;/td&gt;&#xA;&lt;td&gt;190624&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;25&lt;/td&gt;&#xA;&lt;td&gt;12&lt;/td&gt;&#xA;&lt;td&gt;112434&lt;/td&gt;&#xA;&lt;td&gt;358984&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;26&lt;/td&gt;&#xA;&lt;td&gt;13&lt;/td&gt;&#xA;&lt;td&gt;193620&lt;/td&gt;&#xA;&lt;td&gt;676040&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;27&lt;/td&gt;&#xA;&lt;td&gt;13&lt;/td&gt;&#xA;&lt;td&gt;333430&lt;/td&gt;&#xA;&lt;td&gt;1273120&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;28&lt;/td&gt;&#xA;&lt;td&gt;14&lt;/td&gt;&#xA;&lt;td&gt;574195&lt;/td&gt;&#xA;&lt;td&gt;2397545&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;29&lt;/td&gt;&#xA;&lt;td&gt;14&lt;/td&gt;&#xA;&lt;td&gt;988811&lt;/td&gt;&#xA;&lt;td&gt;4515065&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;30&lt;/td&gt;&#xA;&lt;td&gt;15&lt;/td&gt;&#xA;&lt;td&gt;1702816&lt;/td&gt;&#xA;&lt;td&gt;8502786&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;31&lt;/td&gt;&#xA;&lt;td&gt;15&lt;/td&gt;&#xA;&lt;td&gt;2932392&lt;/td&gt;&#xA;&lt;td&gt;16012476&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;You must write a function or program that takes one number M, and prints out the first 31 M-Death-onacci numbers. M will be a whole number larger than 0 and less than 31. The output can be in any human readable format, and you can take input in any reasonable manner. (Command line arguments, function arguments, STDIN, etc.)&lt;/p&gt;&#xA;&lt;p&gt;As usual, this is Code-golf, so standard loopholes apply and the shortest answer in bytes wins!&lt;/p&gt;&#xA;" OwnerUserId="9534" LastEditorUserId="9534" LastEditDate="2021-04-24T12:09:09.387" LastActivityDate="2021-04-24T12:09:09.387" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="22171" PostTypeId="2" ParentId="2140" CreationDate="2021-04-24T10:15:11.870" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/224979&quot;&gt;How many Faro Shuffles for a cycle?&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/card-games&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;card-games&amp;#39;&quot; rel=&quot;tag&quot;&gt;card-games&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2021-05-03T13:20:14.410" LastActivityDate="2021-05-03T13:20:14.410" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22172" PostTypeId="2" ParentId="2140" CreationDate="2021-04-24T15:47:50.343" Score="0" Body="&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/137880/print-a-booklet&quot;&gt;duplicate :(&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2021-05-29T08:10:08.557" LastActivityDate="2021-05-29T08:10:08.557" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22174" PostTypeId="2" ParentId="2140" CreationDate="2021-04-24T23:22:28.520" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224381/may-the-wind-be-always-at-your-back&quot;&gt;May the wind be always at your back&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="103148" LastEditorUserId="66833" LastEditDate="2021-04-25T17:28:59.247" LastActivityDate="2021-04-25T17:28:59.247" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="22175" PostTypeId="5" CreationDate="2021-04-24T23:35:15.450" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt; is used on the main site on challenges that specifically involve manipulating images, or taking image files as input. Be sure to read the &lt;a href=&quot;https://codegolf.stackexchange.com/tags/image-processing/info&quot;&gt;image-processing tag wiki&lt;/a&gt; for more information.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Do not post &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt; challenges here on meta&lt;/strong&gt;, they will be closed as off-topic.&lt;/p&gt;&#xA;&lt;p&gt;This tag should be used on questions about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;; both the tag itself and the questions that should or shouldn't be tagged with it.&lt;/p&gt;&#xA;&lt;p&gt;Be aware of it's sister tags &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-24T23:35:15.450" LastActivityDate="2021-04-24T23:35:15.450" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22176" PostTypeId="4" CreationDate="2021-04-24T23:35:15.450" Score="0" Body="For questions about image-processing challenges on the main site. Do not post [image-processing] challenges on meta - they will be closed as off-topic" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-24T23:35:15.450" LastActivityDate="2021-04-24T23:35:15.450" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22177" PostTypeId="1" AcceptedAnswerId="22178" CreationDate="2021-04-25T00:53:34.947" Score="11" ViewCount="165" Body="&lt;p&gt;Here's what our Tour page says right now:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Code Golf Stack Exchange is a question and answer site for programming puzzle enthusiasts and code golfers. It's built and run by you as part of the Stack Exchange network of Q&amp;amp;A sites. With your help, we're working together to build a library of programming puzzles and their solutions.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;We're not a Q&amp;amp;A site. Our tour page probably shouldn't say that. In fact, I'd like to make a much clearer distinction that &lt;em&gt;we are not like the rest of the SE network&lt;/em&gt;. I am able to edit it, so what should we change it to?&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Also, should it contain something about the Sandbox? There's no other logical place to put it in the tour page, and at the bottom of the tour page, there's an &amp;quot;Ask Question&amp;quot; button directly, so new users will see that before anything mentioning the Sandbox. I'm not sure about this idea, since it's not really part of the &amp;quot;what we're about&amp;quot; which is what the first section seems like it should be about.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-06-09T05:54:28.893" LastActivityDate="2021-06-09T05:54:28.893" Title="Tour page summary - we're not a Q&amp;A site" Tags="|discussion|status-completed|new-users|help-center|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22178" PostTypeId="2" ParentId="22177" CreationDate="2021-04-25T00:54:53.010" Score="8" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;Code Golf Stack Exchange is a site for code golfers and coding challenge enthusiasts. It's built, maintained and run by you as part of the Stack Exchange network of sites. Unlike most other sites in the network, we are not a Q&amp;amp;A site. Instead of asking questions and posting answers, we work together to build a collection of coding competitions and solutions&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;A modified version of the original text, changed to empathise:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&amp;quot;code golfers and coding challenge enthusiasts&amp;quot; vs &amp;quot;programming puzzle enthusiasts and code golfers&amp;quot;, as we've moved away from &amp;quot;programming puzzles&amp;quot; with the new site name&lt;/li&gt;&#xA;&lt;li&gt;I added a sentence specifying that we're different from most sites in the network, as well as specifically stating that we aren't a Q&amp;amp;A site&lt;/li&gt;&#xA;&lt;li&gt;The final sentence is simply a rewording of the current version&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="95792" LastEditDate="2021-04-27T20:54:02.627" LastActivityDate="2021-04-27T20:54:02.627" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="22179" PostTypeId="1" CreationDate="2021-04-25T01:55:36.827" Score="13" ViewCount="78" Body="&lt;p&gt;(Thanks to &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/57763197#57763197&quot;&gt;Redwolf Programs&lt;/a&gt; for the name!)&lt;/p&gt;&#xA;&lt;p&gt;In a recent discussion about the info box and linking to the Sandbox for new users to use it before attempting to post their first challenge, we noted that sometimes the Sandbox can be unpleasant to use, especially for new users, as things get forgotten or don't receive attention, or after addressing all concerns the challenge immediately gets nuked into oblivion for other reasons after being posted to main.&lt;/p&gt;&#xA;&lt;p&gt;In the interest of facilitating Sandbox usage, encouraging its use by all but especially new users, organizing feedback and discussion which would be too much clutter for comments, and overall increase the quality of challenges on our site, we are introducing:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/123403/the-guild-of-reviewers&quot;&gt;&lt;strong&gt;The Guild of Reviewers&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a public chat room - anyone with 20 reputation can enter and talk - intended for users with challenge-writing experience to look at, discuss, and review sandboxed challenges. Hopefully, by discussing in chat amongst many other experienced users, rather than limiting ourselves to just adding short and non-chit-chat comments with individual concerns, we can bring better feedback and improve the quality of challenges on CGCC.&lt;/p&gt;&#xA;&lt;p&gt;Before posting a challenge to main, if you feel that it hasn't been reviewed enough or that you want some final feedback on it before posting, this is now also a place you can ask right before posting. &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; is more active and is also somewhere you can go to ask - it is definitely on-topic. Please don't clutter either room by spamming your posts constantly, but requesting feedback on something you plan to post that has been neglected is encouraged instead of assuming it's fine and posting.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-04-25T01:55:36.827" Title="Introducing The Guild of Reviewers - Better Sandbox Feedback" Tags="|discussion|sandbox|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22180" PostTypeId="1" CreationDate="2021-04-25T10:12:11.417" Score="1" ViewCount="68" Body="&lt;p&gt;Consider such a question&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Take a program &lt;code&gt;P&lt;/code&gt; and an integer &lt;code&gt;n&lt;/code&gt;, check whether &lt;code&gt;P&lt;/code&gt; halts. You may assume that if &lt;code&gt;P&lt;/code&gt; halts then &lt;code&gt;P&lt;/code&gt; halts in &lt;code&gt;n&lt;/code&gt; steps.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;and solution 1&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(P,n)=&amp;gt;!run(P,timeout=n us).timeout&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;solution 2&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;P=&amp;gt;!run(P,timeout=9 us).timeout&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;where S1 assumes &lt;code&gt;n&lt;/code&gt; steps will finish in &lt;code&gt;n&lt;/code&gt; us and S2 assume in 9 us.&lt;/p&gt;&#xA;&lt;p&gt;Do we allow such assumption in code-golf?&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2021-04-25T10:12:11.417" Title="Can we assume computer be fast enough?" Tags="|discussion|code-golf|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22181" PostTypeId="2" ParentId="2140" CreationDate="2021-04-25T12:18:15.327" Score="4" Body="&lt;h1&gt;Solve the halting problem for ^/a*b*/b*a*/[ab]*$ in /// &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/halting-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;halting-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;halting-problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://esolangs.org/wiki////&quot; rel=&quot;nofollow noreferrer&quot;&gt;///&lt;/a&gt;, a.k.a. Slashes is an esoteric programming language with simple two operations. One is to output its source to remove from it. The other is to substitute itself. The language is proven to be Turing-complete, so some programs such as &lt;code&gt;/ab/bbaa/aab&lt;/code&gt; won't halt while some such as &lt;code&gt;/ab/bbaa/ab&lt;/code&gt; will.&lt;/p&gt;&#xA;&lt;p&gt;At first I questioned if halting problem for &lt;code&gt;^/[ab]*/[ab]*/[ab]*$&lt;/code&gt; is solvable, but &lt;a href=&quot;https://cs.stackexchange.com/a/142025/139273&quot;&gt;I learned unlikely&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;So I am simplying to &lt;code&gt;^/a*b*/b*a*/[ab]*$&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Problem&lt;/h1&gt;&#xA;&lt;p&gt;Given a slashes program that matches &lt;code&gt;^/a*b*/b*a*/[ab]*$&lt;/code&gt; in POSIX BRE (i.e. below), determine whether the program halts or not.&lt;/p&gt;&#xA;&lt;h2&gt;Format of program, if you are not familiar with POSIX BRE&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;program = &amp;quot;/&amp;quot; first &amp;quot;/&amp;quot; second &amp;quot;/&amp;quot; third&#xA;first = &amp;quot;&amp;quot; | first &amp;quot;a&amp;quot; | first first.b&#xA;first.b = &amp;quot;&amp;quot; | first.b &amp;quot;b&amp;quot;&#xA;second = &amp;quot;&amp;quot; | second &amp;quot;b&amp;quot; | second second.a&#xA;second.a = &amp;quot;&amp;quot; | second.a &amp;quot;a&amp;quot;&#xA;third = &amp;quot;&amp;quot; | third &amp;quot;a&amp;quot; | third &amp;quot;b&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Constrains&lt;/h1&gt;&#xA;&lt;p&gt;In this problem every program's length is up to 153.&lt;/p&gt;&#xA;&lt;h1&gt;Detailed rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Can be either a full program or a function.&lt;/li&gt;&#xA;&lt;li&gt;Standard i/o apply.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Examples of input format&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a string of program&lt;/li&gt;&#xA;&lt;li&gt;three strings p,q,r when the program is &lt;code&gt;/p/q/r&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;integers p,q,r,s and a string t when the program is &lt;code&gt;/a\{p\}b\{q\}/b\{r\}a\{s\}/t&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;entirely as an integer (think of it by yourself)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Examples of output format&#xA;&lt;ul&gt;&#xA;&lt;li&gt;zero or one&lt;/li&gt;&#xA;&lt;li&gt;string&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12317/100411&quot;&gt;&lt;strong&gt;by halting or not is not an option&lt;/strong&gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;; shortest code wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##bVC7DoIwFN37FU0XWoUI7gw0IcZBYyI/UB5qo7mYtoSB8O1IBZUmLs09j57T3lzo2zCI9o49nu72x04rASVlKMmy9HDKznEUhqi9yUdFP1QQsA5dpNImiRXdhmwCfAa6KmooEwfxrxHEY56fqr7GZEPm9ClwzH7z9sBEOCJ3xZygL/rFzH1Lq3UuRafEdvyJeT/U6dNNro2iROTEl2DotKfVlq0jP7K/GUlsnajv0aWBwsgasKLAOlWZRgFe3ALWe8PwAg&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Bash – Try It Online&quot;&gt;Testcase generator 1&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##hVZda1sxDH33r7gtgTbQoO7jJYS87n/oQMtCYS25dGOU7q9nsy3Zknxvlz60jWV9HB0dGTx/v1z419O0@zbRtPs5zUeabtJbejluPqfzcfMlzcfN1/T4fL49Hff7/WG3Ox22b@n0eDtf/XnZvm3uj5v76@n3w3x9wPmBn97T/Irbl7vz3bxN79nw6rQVqx/P1/@@@pRuLhcCAWw@BC4/SJT/zcf9k4/r70SkF7h@w@VG/rtdySb5LB9DfMqxXOUSrByWv7n4UAtK4qG7NGnWyyhXQpbeKmdWfRTDEqdcg69Os0ItxQUurqAXzc0eCrVWcZ8R8slwRazFgpTrMDaJqz/BL5FPyPuFQlnDt1ZYq9rRGCyDTAs@i0cMCZocBQ/msQUGF0HMJt@v5/9aiA4kC18qBo6JzL7yCuVAPWtJAqUhl6M0R6o7EHrTx8skjtWs9ohcGzXFhoKhVOsYWgSs4NjrdWCH44oVhQ6z9qi7lzGXLvMCNkYMan0yo74b1AnqWUpCYKGwThzlbCwRTWX5AAvDIFRpoRGMJFQbrYYmCv41xcJyjmhqe6WBoTrPdOEkFoTDCM4gHXpZWRRSB0xzBo6TFmVErMPeMrEyvCBsIiciEQFL8tonOqzA8GDXIBfqSLZRAqyMsE2dw7ZJhBU2ozUmaF@QKi2uEgwrRggbCGtBeRSTriLtlNxKZEWNjY0PQ6rNMGnGNQg7phz1uLatK@UH9Vb4ZMu0zDHWrkyKRx477XRrdlxF0qyocX2EA4@6/ItokNt@Os3CwKJX5GDtyPU92vcdtQdFAxZLTIYC5fgbSSip1ttDITA7SIkW2sB9DwwIYWkszErAf437yFr2AbTWSaXEwtsJbvga4H4mG9MLHG5MyO2REBbazWBAaI8n3eTk0F94d/mIHKe1w2iq@GDq@wDoMgJjeel3UUbfa@vu5fXhlpd/kg1KYd4L41IQQsE8CKv4mzfKIGhrL0fzwnJDS03Xkf4C&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Bash – Try It Online&quot;&gt;My noncompetive solution&lt;/a&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;///: no&#xA;/a//: yes&#xA;/ab/bba/aab: yes&#xA;/ab/bba/aaab: yes&#xA;/ab/bba/aabb: no&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Were similar things ever done before?&lt;/li&gt;&#xA;&lt;li&gt;I am not even sure if this problem is solvable.&lt;/li&gt;&#xA;&lt;li&gt;Just thought there are answers if I clarify maximum length of input.&lt;/li&gt;&#xA;&lt;li&gt;Should I change the problem's genre to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;algorithm&lt;/a&gt;? Would making a maximum length of the program be boring?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user100411" LastEditorDisplayName="user100411" LastEditDate="2021-11-15T11:38:43.483" LastActivityDate="2021-11-15T11:38:43.483" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22182" PostTypeId="2" ParentId="2140" CreationDate="2021-04-25T15:01:23.873" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224491/interpret-gelatin&quot;&gt;Interpret Gelatin&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-26T22:39:28.470" LastActivityDate="2021-04-26T22:39:28.470" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22184" PostTypeId="2" ParentId="2140" CreationDate="2021-04-25T18:56:13.403" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224704/gelatin-integer-metagolf&quot;&gt;Gelatin integer metagolf&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-29T22:19:27.987" LastActivityDate="2021-04-29T22:19:27.987" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22185" PostTypeId="5" CreationDate="2021-04-26T00:44:47.253" Score="0" Body="&lt;p&gt;This tag indicates that the question specifically relates to incentives and rewards for posts on the site.&lt;/p&gt;&#xA;&lt;p&gt;Incentives can refer to either the builtin reward systems in the Stack Exchange network, or to real life incentives such as cash or prizes. It is &lt;a href=&quot;https://meta.stackexchange.com/questions/25615/offering-actual-money-as-a-bounty/25621#25621&quot;&gt;&lt;strong&gt;strongly discouraged&lt;/strong&gt;&lt;/a&gt; to offer real life rewards such as cash.&lt;/p&gt;&#xA;&lt;p&gt;If you'd like to award incentives to an answer, consider the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/vote-up&quot;&gt;Upvoting&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/set-bounties&quot;&gt;Bounties&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-26T00:44:47.253" LastActivityDate="2021-04-26T00:44:47.253" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22186" PostTypeId="4" CreationDate="2021-04-26T00:44:47.253" Score="0" Body="For questions about offering incentives. It's strongly discouraged to award or offer real life incentives for posts, as it generally encourages low quality posts and often incites flame wars and infighting between users" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-26T00:44:47.253" LastActivityDate="2021-04-26T00:44:47.253" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22187" PostTypeId="2" ParentId="22078" CreationDate="2021-04-26T02:14:03.583" Score="1" Body="&lt;h1&gt;Option 1&lt;/h1&gt;&#xA;&lt;p&gt;(posting the two proposed options for voting purposes)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Change the meaning of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt; to that of an optimization problem in the CS sense.&lt;/li&gt;&#xA;&lt;li&gt;Re-tag all &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt; / &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimized-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimized-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimized-output&lt;/a&gt; challenges that follow the previous definition to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Add a pointer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; in the wiki excerpt.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2021-04-26T02:14:03.583" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22188" PostTypeId="2" ParentId="22078" CreationDate="2021-04-26T02:15:38.113" Score="2" Body="&lt;h1&gt;Option 2&lt;/h1&gt;&#xA;&lt;p&gt;(posting the two proposed options for voting purposes)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Create a new tag called &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization-problem&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Re-tag all &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt; challenges that do not follow the current definition to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization-problem&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Re-tag all the others to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Entirely deprecate &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2021-04-26T02:15:38.113" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22190" PostTypeId="2" ParentId="2140" CreationDate="2021-04-26T08:47:56.023" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224621/xkcd-2385-koth-final-exam&quot;&gt;xkcd 2385&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="103324" LastEditorUserId="103324" LastEditDate="2021-05-03T02:23:42.153" LastActivityDate="2021-05-03T02:23:42.153" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22192" PostTypeId="2" ParentId="2140" CreationDate="2021-04-26T18:29:22.090" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224515/plz-halp-need-investors-asap&quot;&gt;Plz Halp, Need Investors ASAP&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="103148" LastEditorUserId="103148" LastEditDate="2021-04-27T12:46:40.080" LastActivityDate="2021-04-27T12:46:40.080" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22193" PostTypeId="2" ParentId="2140" CreationDate="2021-04-26T18:33:48.467" Score="0" Body="&lt;h1&gt;Compute a real root of a cubic polynomial.&lt;/h1&gt;&#xA;&lt;p&gt;You are given a cubic polynomial of the form &lt;span class=&quot;math-container&quot;&gt;\$x^3 + a x^2 + b x + c\$&lt;/span&gt; and your task is to compute one real root of this polynomial, or equivalently a solution to the equation &lt;span class=&quot;math-container&quot;&gt;\$x^3 + a x^2 + b x + c = 0\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Input will be three numbers &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$c\$&lt;/span&gt;. These are guaranteed to be real numbers. The inputs may be taken separately or as a list or a vector or whatever else is convenient in your language.&lt;/p&gt;&#xA;&lt;p&gt;A cubic polynomial always has at least one real root, and can have up to three. It always has three complex roots but the non real ones are of no interest for this challenge. If the polynomial has multiple real roots, outputting any one of them is fine.&lt;/p&gt;&#xA;&lt;p&gt;Output should be one number. Solutions with three correct decimal places are good enough, more accuracy or exact algebraic expressions are fine too.&lt;/p&gt;&#xA;&lt;p&gt;This can be solved by using &lt;a href=&quot;https://en.wikipedia.org/wiki/Cubic_equation&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cardano's formula&lt;/a&gt; but this requires handling of complex roots and some messy lengthy algebra. Alternatively one could use some algorithm for a numeric approximation such as &lt;a href=&quot;https://en.wikipedia.org/wiki/Newton%27s_method&quot; rel=&quot;nofollow noreferrer&quot;&gt;Newton's method&lt;/a&gt;. If your language has a build-in that works as well as long as you fish out exactly one real root.&lt;/p&gt;&#xA;&lt;p&gt;Test cases can be easily generated with any online solver for cubic equations such as &lt;a href=&quot;https://www.calculatorsoup.com/calculators/algebra/cubicequation.php&quot; rel=&quot;nofollow noreferrer&quot;&gt;this one&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="100270" LastEditorUserId="66833" LastEditDate="2021-04-26T19:12:01.330" LastActivityDate="2021-04-26T19:12:01.330" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22194" PostTypeId="5" CreationDate="2021-04-26T19:35:51.270" Score="0" Body="&lt;p&gt;This tag is for questions about using the &lt;a href=&quot;https://www.java.com/en/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Java programming language&lt;/a&gt; in answers on the &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;main site&lt;/a&gt;, such as asking about rules covering situations specific to Java.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Do not post questions asking for help with Java on meta&lt;/strong&gt;, they will be closed as off-topic. Instead, post them on &lt;a href=&quot;https://stackoverflow.com/&quot;&gt;Stack Overflow&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-26T19:35:51.270" LastActivityDate="2021-04-26T19:35:51.270" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22195" PostTypeId="4" CreationDate="2021-04-26T19:35:51.270" Score="0" Body="For questions about the usage of the Java programming language on the main site. Do not post questions asking for help with Java on meta using this tag." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-26T19:35:51.270" LastActivityDate="2021-04-26T19:35:51.270" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22196" PostTypeId="5" CreationDate="2021-04-27T00:56:21.260" Score="0" Body="&lt;p&gt;For questions relating to the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenge type.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;King-of-the-hill indicates a game where the submissions interact with each other. The game needs to have well defined rules and scoring, and the goal is to write a maximally competitive program.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;sub&gt;From the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/tags/king-of-the-hill/info&quot;&gt;tag wiki&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Do not post king-of-the-hill challenges on meta&lt;/strong&gt;, they will be closed as off-topic&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-27T00:56:21.260" LastActivityDate="2021-04-27T00:56:21.260" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22197" PostTypeId="4" CreationDate="2021-04-27T00:56:21.260" Score="0" Body="For questions relating to the King of the Hill challenge type. King-of-the-hill challenges on main are a game where the submissions interact with and compete against each other in some form of game. Do not post king-of-the-hill challenges on meta, they will be closed as off-topic" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-27T00:56:21.260" LastActivityDate="2021-04-27T00:56:21.260" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22198" PostTypeId="5" CreationDate="2021-04-27T01:16:21.327" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; questions on the main site involve outputting constant strings. Be sure to read the &lt;a href=&quot;https://codegolf.stackexchange.com/tags/kolmogorov-complexity/info&quot;&gt;kolmogorov complexity tag wiki&lt;/a&gt; for more information.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Do not post &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenges here on meta&lt;/strong&gt;, they will be closed as off-topic.&lt;/p&gt;&#xA;&lt;p&gt;This tag should be used on questions about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The tag itself&lt;/li&gt;&#xA;&lt;li&gt;Questions that should or shouldn't be tagged with it&lt;/li&gt;&#xA;&lt;li&gt;Questions about challenges tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-27T01:16:21.327" LastActivityDate="2021-04-27T01:16:21.327" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22199" PostTypeId="4" CreationDate="2021-04-27T01:16:21.327" Score="0" Body="For questions specifically about the kolmogorov complexity tag on the main site. Do not post [kolmogorov-complexity] challenges on meta - they will be closed as off-topic" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-27T01:16:21.327" LastActivityDate="2021-04-27T01:16:21.327" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22200" PostTypeId="5" CreationDate="2021-04-27T01:40:33.480" Score="0" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14645/lets-start-a-language-of-the-month-event&quot;&gt;Language of the Month&lt;/a&gt; event is a monthly event that aims to promote lesser-known languages. Users &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19279/nominations-for-language-of-the-month-2021-edition&quot;&gt;nominate&lt;/a&gt; languages, and vote on nominations they'd like to be the Language of the Month. At the start of each month, the nomination with the most votes becomes the Language of the Month for that month.&lt;/p&gt;&#xA;&lt;p&gt;This tag should be used on questions specifically about the Language of the Month event, such as:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The monthly posts for each language&lt;/li&gt;&#xA;&lt;li&gt;Discussion around the event&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The monthly posts specifying that month's Language should be tagged with &lt;a href=&quot;/questions/tagged/discussion&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/language-of-the-month&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-of-the-month&amp;#39;&quot; rel=&quot;tag&quot;&gt;language-of-the-month&lt;/a&gt; and should follow this template:&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;In accordance with [our meta agreement][1], since one candidate received more votes than the others, we have a new featured language! Throughout {month} {year}, our Language of the Month will be:&#xA;&#xA;&amp;gt; # {language}&#xA;&#xA;What's a Language of the Month?&#xA;&#xA;See the [meta post for nominations][2]. In short, during {month}, those who wish to participate should learn (at least the basics of) {language}, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&#xA;&#xA;## Information about {language}&#xA;&#xA;{information about the language}&#xA;&#xA;### Resources&#xA;&#xA;- [Try it online!][3]. &#xA;- [Website][4]&#xA;- [Documentation][5]&#xA;- [Download][6]&#xA;- [Tips page][7]&#xA;&#xA;  [1]: https://codegolf.meta.stackexchange.com/q/19271/16766&#xA;  [2]: https://codegolf.meta.stackexchange.com/q/19279/16766&#xA;  [3]: https://tio.run/#{language}&#xA;  [4]: {website}&#xA;  [5]: {documentation page}&#xA;  [6]: {download link}&#xA;  [7]: {link to tips page}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-27T14:59:52.897" LastActivityDate="2021-04-27T14:59:52.897" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22201" PostTypeId="4" CreationDate="2021-04-27T01:40:33.480" Score="0" Body="Each month, we select a &quot;language of the month&quot; - a programming language that isn't as well used on the site - in order to promote usage of that language. This tag is for questions relating to the Language of the Month event, including discussion around the event and for the monthly posts featuring the specific languages of the month." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-27T01:40:33.480" LastActivityDate="2021-04-27T01:40:33.480" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22203" PostTypeId="5" CreationDate="2021-04-27T16:43:16.850" Score="0" Body="&lt;p&gt;This site uses &lt;a href=&quot;https://www.mathjax.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Mathjax&lt;/a&gt;, a form of &lt;a href=&quot;https://en.wikibooks.org/wiki/LaTeX&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;span class=&quot;math-container&quot;&gt;\$\LaTeX\$&lt;/span&gt;&lt;/a&gt;, in order to display mathematical formulae. For example:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;f_0 = f_1 = 1 \\&#xA;f_n = f_{n-1} + f_{n-2}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Use &lt;code&gt;\$&lt;/code&gt; delimiters for inline formatting and &lt;code&gt;$$&lt;/code&gt; delimiters for block formatting&lt;/p&gt;&#xA;&lt;p&gt;Use this tag on questions about Mathjax, including &lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt; reports, &lt;a href=&quot;/questions/tagged/support&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt; questions about using Mathjax and other related topics specific to Mathjax on the site.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-27T16:43:16.850" LastActivityDate="2021-04-27T16:43:16.850" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22204" PostTypeId="4" CreationDate="2021-04-27T16:43:16.850" Score="0" Body="For questions about the Mathjax LaTeX math formatting used by the site to render mathematical formulae" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-04-27T16:43:16.850" LastActivityDate="2021-04-27T16:43:16.850" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22205" PostTypeId="2" ParentId="2140" CreationDate="2021-04-27T18:18:50.550" Score="1" Body="&lt;h1&gt;Number to set - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/95035/natural-construction&quot;&gt;duplicate&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="90614" LastEditorUserId="90614" LastEditDate="2021-04-27T18:48:53.253" LastActivityDate="2021-04-27T18:48:53.253" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22206" PostTypeId="1" AcceptedAnswerId="22208" CreationDate="2021-04-27T19:02:02.653" Score="7" ViewCount="78" Body="&lt;p&gt;Some sites on the network have an additional sidebar box for &amp;quot;Upcoming Events&amp;quot;, which is separate from both the &amp;quot;Featured on Meta&amp;quot; and &amp;quot;Host Meta Posts&amp;quot; boxes:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Dq7F1.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Dq7F1.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt; &lt;a href=&quot;https://i.stack.imgur.com/f0GBO.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/f0GBO.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Screenshots taken from &lt;a href=&quot;https://movies.stackexchange.com/&quot;&gt;Movies &amp;amp; TV&lt;/a&gt; and &lt;a href=&quot;https://literature.stackexchange.com/questions&quot;&gt;Literature&lt;/a&gt;. Despite the name, this also includes events currently in progress.&lt;/p&gt;&#xA;&lt;p&gt;I think this would be a good thing to use for our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/tagged/language-of-the-month&quot;&gt;Language of the Month&lt;/a&gt; event. It would free up one of the three &lt;a href=&quot;/questions/tagged/featured&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;featured&amp;#39;&quot; rel=&quot;tag&quot;&gt;featured&lt;/a&gt; slots, and would allow for more questions to be shown in the &amp;quot;Hot Meta Questions&amp;quot; bar, promoting more meta engagement.&lt;/p&gt;&#xA;&lt;p&gt;&lt;s&gt;Unfortunately, I can't find any information about &lt;em&gt;how&lt;/em&gt; to set up an &amp;quot;Upcoming Events&amp;quot; box. I'd expect that we'd need to get a CM to set this up for us, similar to our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/18028/66833&quot;&gt;info box&lt;/a&gt;, which might require more work from them than is justified for this.&lt;/s&gt; According to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/68942/hyper-neutrino&quot;&gt;hyper-neutrino&lt;/a&gt;, &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/57796649#57796649&quot;&gt;mods are able to do this&lt;/a&gt;, so this should be fairly trivial to set up if we do want it&lt;/p&gt;&#xA;&lt;p&gt;Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="68942" LastEditDate="2021-05-01T01:13:34.510" LastActivityDate="2021-05-01T01:13:34.510" Title="Should the Language of the Month post be an &quot;Upcoming event&quot;?" Tags="|discussion|feature-request|status-completed|language-of-the-month|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22208" PostTypeId="2" ParentId="22206" CreationDate="2021-04-27T23:18:15.433" Score="14" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;LotM is indeed an event with a defined period, and if being an event does free up one slot for featured/hot meta posts, why not :)&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2021-04-27T23:18:15.433" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22209" PostTypeId="2" ParentId="2140" CreationDate="2021-04-27T23:23:52.813" Score="3" Body="&lt;h1&gt;Count up to 21&lt;/h1&gt;&#xA;&lt;p&gt;21 is a game my teachers had my classmates and I play in order to kill some time. The game works as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All contestants stand in a circle. The aim is to count to 21, one by one.&lt;/li&gt;&#xA;&lt;li&gt;At any time, any player may begin the counting by saying &lt;strong&gt;1&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The plays then continue the counting by saying the next number. However, if multiple players say the number at the same time, the count resets, and someone has to say &lt;strong&gt;1&lt;/strong&gt; again.&lt;/li&gt;&#xA;&lt;li&gt;The first player who says &lt;strong&gt;21&lt;/strong&gt; is &amp;quot;out&amp;quot;, and the game begins again with the same contestants except for the &amp;quot;out&amp;quot; player(s)&lt;/li&gt;&#xA;&lt;li&gt;The final player left is disqualified, and the entire game begins again. The last player not disqualified wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;We are going to run a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenge, where bots aim to play this game.&lt;/p&gt;&#xA;&lt;p&gt;You are to write a function in Python 3 that takes a list of lists &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; as argument. Each list in &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; represents a round in the game, with the last element being the most recent. The &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt;th element of each list always corresponds to the same bot. Each list in &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; will contain &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; integers between &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$21\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is the number of contestants left in the game. The lists are either all &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;s, or are &lt;span class=&quot;math-container&quot;&gt;\$n-1\$&lt;/span&gt; &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;s and a single non-zero value &lt;span class=&quot;math-container&quot;&gt;\$v\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If a list is all &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;s, either it is the first round, or the counter was reset in the previous round.&lt;/p&gt;&#xA;&lt;p&gt;That function should then return either:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;, meaning that your bot stays quiet&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$v+1\$&lt;/span&gt;, meaning that your bot is attempting to guess this round&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And that's it!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;The competition will work exactly as described above. The controller will run 100 games. Each game will works as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first round begins with all &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; contestants. They will count up to 21, eliminating each contestant as they count to 21, and resetting the count to 0. The final player left is then eliminated, and the next round with &lt;span class=&quot;math-container&quot;&gt;\$n-1\$&lt;/span&gt; contestants is run. At the end, the final player left standing wins&lt;/li&gt;&#xA;&lt;li&gt;The player with the most wins after 100 games wins overall&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may not include anything in your submission that attempts to communicate with other submissions, attempts to interfere with other submissions or the controller or anything that could be malicious. If you do, your submission will be disqualified&lt;/p&gt;&#xA;&lt;p&gt;If any game has more than 10000 rounds, it'll be terminated and no player will win.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Example bot&lt;/h2&gt;&#xA;&lt;p&gt;This is Random:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;import random&#xA;&#xA;def bot(history):&#xA;&amp;#9;return random.choice([0, max(history[-1]) + 1])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-05T18:19:54.117" LastActivityDate="2021-05-05T18:19:54.117" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="22211" PostTypeId="2" ParentId="22177" CreationDate="2021-04-28T02:02:19.123" Score="0" Body="&lt;p&gt;Technically, this site is not a &amp;quot;Question &amp;amp; Answer&amp;quot; site but more like a &amp;quot;Challenge &amp;amp; Answer site&amp;quot;, meaning pretty much none of the challenges are actual questions but more like challenges/tasks to be completed. The only other site I know of like this on the SE network is Puzzling, but many puzzles are presented as questions.&lt;/p&gt;&#xA;" OwnerUserId="17360" LastActivityDate="2021-04-28T02:02:19.123" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22212" PostTypeId="2" ParentId="2140" CreationDate="2021-04-28T12:25:32.040" Score="5" Body="&lt;h1&gt;Plz Halp I Need $$$ Again&lt;/h1&gt;&#xA;&lt;p&gt;Bob’s startup is running out of money and desperately needs investors to keep it afloat. Although you have &lt;a href=&quot;https://codegolf.stackexchange.com/questions/224515/plz-halp-need-investors-asap&quot;&gt;helped Bob find the maximum number of investors&lt;/a&gt;, Bob has quickly realized that more investors does not lead to more funds because different investors give different amounts of money. Each investor interested in Bob’s company wishes to schedule a meeting with a certain start and end time, and promises to invest a certain amount of money. However, some of the meetings times may conflict. What is the maximum amount of money he can get from his investors?&lt;/p&gt;&#xA;&lt;h2&gt;Input Format&lt;/h2&gt;&#xA;&lt;p&gt;Input is given as an array of tuples of integers (or the equivalent in your chosen language). Each tuple &lt;code&gt;p&lt;/code&gt; represents one investor, where &lt;code&gt;p[0]&lt;/code&gt; is the start time of the investor’s meeting, &lt;code&gt;p[1]&lt;/code&gt; is the end time, and &lt;code&gt;p[2]&lt;/code&gt; is the amount of money promised.&lt;/p&gt;&#xA;&lt;p&gt;For example, in the test case &lt;code&gt;[(0, 10, 30), (10, 20, 50)]&lt;/code&gt;, there are two investors: one who wants to meet from time 0 to time 10 and offers $30, and one who wants to meet from time 10 to time 20 and offers $50.&lt;/p&gt;&#xA;&lt;p&gt;Meetings will always have a positive duration, meeting times are always non-negative, and a meeting that ends at time &lt;code&gt;k&lt;/code&gt; does not conflict with a meeting that starts at time &lt;code&gt;k&lt;/code&gt;. You may assume that the input is nonempty, and you may use any reasonable I/O method for input.&lt;/p&gt;&#xA;&lt;p&gt;Within reason, you may also take input in different formats (for example, as three lists, one which contains the start times, one with the end times, and one with the money offered).&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Your program should output an integer, the maximum quantity of money that Bob can make.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;[(1, 100, 10), (1, 5, 3), (5, 10, 3), (10, 15, 3)] =&amp;gt; 10&#xA;[(0, 30, 40), (20, 45, 30)] =&amp;gt; 40&#xA;[(10, 40, 40), (60, 85, 60)] =&amp;gt; 100&#xA;[(65, 100, 70), (10, 45, 80)] =&amp;gt; 150&#xA;[(10, 15, 50), (50, 85, 10), (95, 110, 60)] =&amp;gt; 120&#xA;[(100, 135, 80), (50, 70, 80), (80, 110, 30), (95, 100, 40)] =&amp;gt; 200&#xA;[(65, 95, 70), (50, 75, 30), (35, 60, 80), (85, 115, 100)] =&amp;gt; 180&#xA;[(30, 35, 80), (35, 65, 10), (75, 110, 40), (40, 45, 20)] =&amp;gt; 140&#xA;[(80, 110, 50), (0, 5, 30), (95, 125, 50), (80, 85, 70)] =&amp;gt; 150&#xA;[(25, 40, 10), (100, 115, 60), (15, 50, 90), (60, 95, 50)] =&amp;gt; 200&#xA;[(100, 125, 50), (75, 80, 100), (30, 60, 20), (50, 65, 90)] =&amp;gt; 240&#xA;[(15, 35, 80), (55, 70, 40), (30, 65, 90), (30, 55, 60)] =&amp;gt; 120&#xA;[(15, 40, 50), (60, 95, 30), (35, 40, 70), (55, 60, 90)] =&amp;gt; 190&#xA;[(40, 65, 80), (40, 75, 10), (5, 15, 80), (100, 115, 80), (15, 35, 100), (60, 95, 40)] =&amp;gt; 340&#xA;[(5, 30, 60), (85, 105, 90), (35, 65, 80), (90, 115, 40), (85, 90, 80), (30, 60, 90)] =&amp;gt; 270&#xA;[(55, 65, 30), (5, 15, 90), (50, 85, 100), (0, 15, 90), (65, 70, 70), (60, 70, 80), (35, 55, 20), (80, 105, 80)] =&amp;gt; 290&#xA;[(0, 10, 90), (70, 85, 80), (45, 55, 20), (90, 105, 90), (55, 90, 50), (0, 25, 20), (85, 105, 30), (85, 90, 100)] =&amp;gt; 380&#xA;[(10, 45, 40), (85, 115, 80), (85, 105, 30), (30, 50, 50), (20, 40, 80), (100, 115, 60), (100, 135, 70), (30, 35, 70), (35, 50, 30)] =&amp;gt; 180&#xA;[(80, 105, 70), (60, 65, 50), (95, 105, 80), (55, 65, 100), (40, 75, 80), (95, 110, 70), (60, 70, 90), (65, 70, 50), (55, 85, 100)] =&amp;gt; 230&#xA;[(80, 85, 70), (35, 40, 60), (60, 80, 80), (5, 20, 100), (30, 60, 100), (45, 50, 60), (45, 80, 60), (10, 20, 50), (50, 65, 60), (60, 85, 70)] =&amp;gt; 370&#xA;[(50, 75, 100), (90, 115, 20), (50, 65, 10), (35, 50, 30), (90, 120, 90), (65, 90, 30), (20, 55, 40), (50, 75, 50), (75, 105, 10), (15, 35, 70)] =&amp;gt; 290&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard loopholes are prohibited.&lt;/li&gt;&#xA;&lt;li&gt;Though not required, polynomial-time solutions are encouraged so that Bob does not have to wait forever for the result.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest solution in each language wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are there any errors with the computer-generated test cases? I've manually verified some of them but I may have overlooked something.&lt;/li&gt;&#xA;&lt;li&gt;Is there any ambiguity in the problem statement?&lt;/li&gt;&#xA;&lt;li&gt;Are there any other issues?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="103148" LastEditorUserId="103148" LastEditDate="2021-04-28T13:42:38.070" LastActivityDate="2021-04-28T13:42:38.070" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="22213" PostTypeId="2" ParentId="2140" CreationDate="2021-04-28T13:29:54.837" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/226446&quot;&gt;Generate a UK number plate&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2021-05-29T14:08:11.293" LastActivityDate="2021-05-29T14:08:11.293" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="22214" PostTypeId="2" ParentId="2140" CreationDate="2021-04-29T02:22:33.363" Score="0" Body="&lt;p&gt;Your client asks you to produce an &amp;quot;org chart&amp;quot; of their statically generated Website's navigation paths.&lt;/p&gt;&#xA;&lt;p&gt;You can use the &lt;a href=&quot;https://support.google.com/docs/answer/9146871?hl=en&quot; rel=&quot;nofollow noreferrer&quot;&gt;Google sheets chart feature&lt;/a&gt; if you like, as long as the chart looks similar to what the client expects here:&lt;/p&gt;&#xA;&lt;img src=&quot;https://s.natalian.org/2021-04-26/sheets.png&quot;&gt;&#xA;&lt;p&gt;Notice that a child can only have one parent, so you need to calculate the shortest path to the root element (aka &amp;quot;Home&amp;quot;).&lt;/p&gt;&#xA;&lt;p&gt;Your coding challenge is to create the same chart programatically for the&#xA;&lt;a href=&quot;https://s.natalian.org/2021-04-26/site.zip&quot; rel=&quot;nofollow noreferrer&quot;&gt;static html&lt;/a&gt; as well as their Website at &lt;a href=&quot;https://simple.goserverless.sg/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://simple.goserverless.sg/&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Example output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;generate-site-structure [index.html | https://simple.goserverless.sg/]&#xA;Bread,Products&#xA;Jam,Products&#xA;Products,Home&#xA;Privacy Policy,About Us&#xA;Sustainability statement,About Us&#xA;About Us,Home&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="103537" LastEditorUserId="103537" LastEditDate="2021-04-29T06:11:45.637" LastActivityDate="2021-04-29T06:11:45.637" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="22216" PostTypeId="2" ParentId="2140" CreationDate="2021-04-29T12:29:36.993" Score="1" Body="&lt;p&gt;Posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/224754/phibonacci-relation-between-phi-and-fibonacci&quot;&gt;Phibonacci - Relation between Phi and Fibonacci&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user100752" LastEditorDisplayName="user100752" LastEditDate="2021-04-30T07:40:32.783" LastActivityDate="2021-04-30T07:40:32.783" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="22217" PostTypeId="2" ParentId="2140" CreationDate="2021-04-29T23:48:20.703" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/225587/random-move-2x2-scrambling&quot;&gt;Random Move 2x2 Scrambling&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="17360" LastEditorUserId="17360" LastEditDate="2021-05-13T07:51:53.447" LastActivityDate="2021-05-13T07:51:53.447" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22218" PostTypeId="2" ParentId="2140" CreationDate="2021-04-30T00:18:38.190" Score="0" Body="&lt;h1&gt;[Draft] 2x2 algorithm with half the faces&lt;/h1&gt;&#xA;&lt;p&gt;A fun fact about the 2x2x2 Rubik's cube is that due to the way a 2x2 only has two layers, doing one turn on one face is indistinguishable from doing the same direction turn on the opposite face and then rotating the cube. So algorithms, that is sequences of moves and cube rotations, ignoring the cube's orientation in space, only need to turn the up (U), right (R), and front (F) faces, and don't need to turn the down (D), left (L), and back (B) faces.&lt;/p&gt;&#xA;&lt;p&gt;A move is represented by a face, one of the letters &lt;code&gt;U&lt;/code&gt;, &lt;code&gt;R&lt;/code&gt;, &lt;code&gt;F&lt;/code&gt;, followed by a direction: clockwise (empty string or space &lt;code&gt; &lt;/code&gt;), counterclockwise (apostrophe &lt;code&gt;'&lt;/code&gt;), or 180 degrees (&lt;code&gt;2&lt;/code&gt;). A cube rotation is represented as one of &lt;code&gt;x&lt;/code&gt; (rotating the entire cube wrt R face), &lt;code&gt;y&lt;/code&gt; (rotating the entire cube wrt U face), and &lt;code&gt;z&lt;/code&gt; (rotating the entire cube wrt F face).&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Q8njk.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Q8njk.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&#xA;(credit: J Perm)&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/y6OyR.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/y6OyR.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&#xA;(credit: Ibero Rubik)&lt;/p&gt;&#xA;&lt;p&gt;From the previous example, &lt;code&gt;U&lt;/code&gt; move is equivalent to &lt;code&gt;D y&lt;/code&gt;, meaning the result of turning the top face clockwise is indistinguishable from the result of turning the bottom face clockwise and then rotating the entire cube clockwise wrt the top face.&lt;/p&gt;&#xA;&lt;p&gt;It is possible to rewrite algorithms with cube rotations into algorithms without cube rotations by appropriate substitution of all following face rotations. For example, &lt;code&gt;y F&lt;/code&gt; is equivalent to &lt;code&gt;R&lt;/code&gt;, and &lt;code&gt;y U&lt;/code&gt; is equivalent to &lt;code&gt;U&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your task is given an input 2x2 algorithm, rewrite it using only U, R, and F moves, and without cube rotations.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I know this notation is probably confusing to people not familiar with it, so let me know how I can clarify the post.&lt;/p&gt;&#xA;" OwnerUserId="17360" LastActivityDate="2021-04-30T00:18:38.190" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22219" PostTypeId="2" ParentId="2140" CreationDate="2021-04-30T04:20:08.217" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224852/drawing-the-stack-overflow-logo&quot;&gt;Drawing the Stack Overflow logo&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="103574" LastEditorUserId="66833" LastEditDate="2021-05-01T13:46:54.317" LastActivityDate="2021-05-01T13:46:54.317" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="22221" PostTypeId="2" ParentId="2140" CreationDate="2021-04-30T07:35:06.543" Score="0" Body="&lt;h2&gt;The Smallest Grammar Problem&lt;/h2&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Here is a write-up for the main site.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Some changes I want to add are:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You can use any language.&lt;/li&gt;&#xA;&lt;li&gt;You must formally prove the Big-O of the worst case of your algorithm in your answer.&lt;/li&gt;&#xA;&lt;li&gt;You must formally prove the correctness of your algorithm as well.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;As far as running the code, that's up to the viewers of the page who wish to run the algorithm, as I can't reasonably be expected to compile code from so many different languages.&lt;/p&gt;&#xA;&lt;ol start=&quot;4&quot;&gt;&#xA;&lt;li&gt;&lt;p&gt;Before I post to main, I will have a solution to the problem which provides correct answers and can check if an output of your algorithm is correct.  It will be coded in Python 3.x.  But since the question is about fastest algorithm, that shouldn't matter.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your algorithm only needs to provide one correct smallest grammar to a given input string (there are usually many), and it must be in standard form (see below).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Therefore my Python 3.x code will enumerate all smallest grammars up to standard form.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I will provide an example formal proof of my algorithm, both so that you can see what a formal proof entails and also so that we know that the solutions we're computing are indeed correct.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;How does this all sound to you all?  Where would you like to see improvements in the write-up?  I am okay  with rewriting the whole thing :)&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Smallest_grammar_problem&quot; rel=&quot;nofollow noreferrer&quot;&gt;Smallest Grammar Problem&lt;/a&gt; (SGP), is defined as:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Given an input string s, compute a smallest CFG g such that L(g) = {s} generates the string and only the string s itself.  Grammar size is defined as:&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;|g| = \sum_{A \in \text{Vars}(g)} |g(A)|&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Where the grammar is &lt;span class=&quot;math-container&quot;&gt;$$g = \{ A \to g(A), B \to g(B), C \to g(C), \dots \}, \\ \text{ and, } |g(A)|$$&lt;/span&gt; simply takes the string length.&lt;/p&gt;&#xA;&lt;p&gt;So the size of the grammar g is the sum of the lengths of all right hand sides (RHS's) of the production rules making up g.&lt;/p&gt;&#xA;&lt;p&gt;All literature on this problem talks about approximation algorithms, and not one article demonstrates a decent &lt;em&gt;exact&lt;/em&gt; smallest grammar algorithm.  That is to say,  computing the very thing the article is about in the first place.  I would personally like to see what an exact SGP algorithm looks like.  How optimal can we make it, and so on...&lt;/p&gt;&#xA;&lt;p&gt;I have had many ideas on how to solve the problem.  Every one of my attempts ended up with inefficient (exponential running time code).  The question is can you make a speedy SGP algorithm.&lt;/p&gt;&#xA;&lt;p&gt;The language of choice for speed of development is of course Python.  Though these resulting programs should not be used in a production compressor for large data.  Still, an exponential algoritm remains inefficient even if ported to C++.&lt;/p&gt;&#xA;&lt;p&gt;So, the benchmark will be running time.  You are to use standard Python 3.x, and not Cython, etc.&lt;/p&gt;&#xA;&lt;p&gt;I have included below some relatively bug-free boilerplate utility code that you may wish to use.  It handles the methods for enumerating substrings of a grammar and so on.&lt;/p&gt;&#xA;&lt;p&gt;These are methods I will use in my own answer, which I am currently still designing.  My approach will use what I call the &amp;quot;Groupoid of smallest grammars&amp;quot;.   Groupoids are heavily involved in combinatorial optimization problems at an advanced level, so from that heuristic they seem like the right structure to use.  Another way to code this problem is translating it into a linear integer programming problem and representing substring conflicts using summation modulo 2 (or something like that).  Though, linear programming problems open another can of worms since a lot of those problems also have hard running times.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;To teach you about the problem, let's inspect some examples.  Though we cannot prove that the examples are indeed smallest grammars - there are no theorems out there that tell whether a certain grammar is indeed minimal.  A proven algorithm however, tells you whether or not your grammar is minimal.  You will need to provide a proof of your algorithm in English / math text accompanied by relavent chunks of your algorithm.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example 1.&lt;/strong&gt;  Take the string s = aaaa.  Reduce it with B -&amp;gt; aa to get the CFG g = { A -&amp;gt; BB, B -&amp;gt; aa}$.  Measure its size:  |g| = 4 which is the same size as s and so therefore no compression happened.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example 2.&lt;/strong&gt; Take the string s = aaaaaa.  Reduce using either B -&amp;gt; aaa,  or C -&amp;gt; aa to get two smallest grammars:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;g = \{A \to BB, B \to aaa\} \\&#xA;g' = \{A \to CCC, C \to aa\}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Those, by experience and inspection, are precisely the full set of smallest grammars of the string of 6 $a$'s.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example 3.&lt;/strong&gt; Let s = abababab.  Reduce using first B -&amp;gt; bab then C -&amp;gt; ab.&lt;/p&gt;&#xA;&lt;p&gt;You get:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;g = \{A \to aBaB, B \to bab \}, |g| = 7 \\&#xA;g' = \{A \to CCCC, C \to ab \}, |g| = 6 \\&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;So as you can see, a naive greedy algorithm can quite easily make wrong min / max guesses and come up with a resulting grammar that is not optimal.&lt;/p&gt;&#xA;&lt;p&gt;Define a grammar to be &lt;em&gt;reduced&lt;/em&gt; if no substring of length 2 or more occuring within it occurs more than once.&lt;/p&gt;&#xA;&lt;p&gt;Reduced does not imply smallest and smallest does not imply reduced.  However, every smallest grammar can be reduced, without a change to its size.  Thus we will call a reduced smallest grammar the &lt;em&gt;standard form&lt;/em&gt; of the smallest grammar.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;strike&gt;&#xA;1. Your algorithm must not only solve the SGP (which is to compute at least one smallest grammar), but it must enumerate all smallest grammars, in standard form, of a given input string. &lt;/strike&gt;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;You must provide a formal proof of your algoritm in your answer.  I.e. a mathematical argument that it does indeed compute the output describe in rule 1.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;strike&gt;&#xA;3. Python 3.x, no Cython or C++.&lt;/strike&gt;&#xA;&lt;p&gt;The standard form requirement reduces the total number of result smallest grammars that you must list.&lt;/p&gt;&#xA;&lt;h2&gt;Code to get you started:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;# pip install bidict&#xA;&#xA;from bidict import bidict&#xA;# Any involved grammar in a smallest grammar algorithm will usually have unique RHS's and unique&#xA;# variables on the left.  So it's a perfect use case for a bidirectional dictionary.  Using&#xA;# one should speed up the code greatly, otherwise we have to loop through dict values or create&#xA;# an inverse dictionary on the fly.&#xA;&#xA;class Grammar:&#xA;    def __init__(self, s:str):&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        Start out with the trivial grammar g = {S -&amp;gt; s}.&#xA;        &amp;quot;&amp;quot;&amp;quot;        &#xA;        self._alphabet = set(s)&#xA;        self._previousVar = 'A'&#xA;        A = self.new_variable()&#xA;        self._start = A&#xA;        self._definition = bidict({ A : s })   # Bidict is useful, we do use the inverse lookup&#xA;        &#xA;    def grammar_size(self):&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        This is the standard definition of grammar size (cost) used in all literature&#xA;        with regards to the smallest grammar problem.  Minimizing this means you've found&#xA;        a smallest grammar for the given input string s.&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        size = 0&#xA;        for A, rhs in self._definition.items():&#xA;            size += len(rhs)&#xA;        return size&#xA;    &#xA;    def __getitem__(self, A):&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        Compute one iteration of expansion at a variable only.&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        return self._definition[A]&#xA;    &#xA;    def fully_expanded_string(self, s=None, memo=None):&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        Fully expand the a string passed in.  Could be a variable or a string of mixed&#xA;        variables and terminals.  Any string really.  If variables of this grammar&#xA;        occur within the string, they are fully expanded to what the grammar defines&#xA;        them to be expanded to, recursively.&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        if memo is None:&#xA;            memo = {}&#xA;        if s is None:&#xA;            s = self._start&#xA;        exp = ''&#xA;        for x in self._definition[s]:&#xA;            if x in self._definition:&#xA;                exp += self.fully_expanded_string(x)&#xA;            else:&#xA;                exp += x&#xA;        memo[s] = exp&#xA;        return exp        &#xA;    &#xA;    def __repr__(self):&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        The obvious representation for debugging / showing results.&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        rep = ''&#xA;        for A, rhs in self._definition.items():&#xA;            rep += A + ' ---&amp;gt; ' + rhs + '\n'&#xA;        rep = rep[:-1]  # remove last newline&#xA;        return rep&#xA;        &#xA;    def __str__(self):&#xA;        return repr(self)&#xA;        &#xA;    def new_variable(self):&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        Take the first unicode character that is not already in the grammar's alphabet.&#xA;        So it will eventually take weird-appearing characters, but who cares.  I think this&#xA;        methodology beats escape or delimit characters.  However, you're also limited to a &#xA;        maximal alphabet size that is the Unicode character set.  That's usually just fine.&#xA;        If not, then what on Earth are you compressing ? :)&#xA;        &amp;quot;&amp;quot;&amp;quot;        &#xA;        X = self._previousVar&#xA;        while X in self._alphabet:&#xA;            X = chr(ord(X) + 1)            &#xA;        self._alphabet.add(X)&#xA;        self._previousVar = X&#xA;        return X&#xA;    &#xA;    def greedily_reduce(self):&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        A grammar is defined to be reduced if no substring of length &amp;gt;= 2 occurs twice, anywhere&#xA;        within the grammar.  There are many paths to a reduced grammar.  The smallest grammar&#xA;        problem involves taking the correct reduction path such that the resulting grammar is&#xA;        indeed minimal in size.  Greedy algorithms are known not to work in general for producing&#xA;        a smallest grammar.  However, they can easily produce a reduced grammar as you can witness.&#xA;        A smallest grammar is not necessarily reduced, though there exists a smallest grammar which&#xA;        is the reduction of that smallest grammar.  Reducing a smallest grammar would involve&#xA;        compressing all substrings of length 2 that occur exactly twice. g = {S -&amp;gt; abab} has the &#xA;        same size as g' = {S -&amp;gt; AA, A -&amp;gt; ab}, namely 4.  Thus reducing a smallest grammar does not&#xA;        reduce the size (obviously), but instead puts it into a &amp;quot;standard form&amp;quot;, which might be&#xA;        useful to your algorithm.&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        R = self.repeating_disjoint_substring_indices()                &#xA;        while len(R) &amp;gt; 0:&#xA;            m = self.arbitrary_greedy_max_function(R)                        &#xA;            &#xA;            if m not in self._definition.inv:&#xA;                M = self.new_variable()&#xA;            else:&#xA;                M = self._definition.inv[m]&#xA;                &#xA;            for A, indices in R[m].items():&#xA;                subtract = 0&#xA;                for i in indices:&#xA;                    rhs = self._definition[A]&#xA;                    self._definition[A] = rhs[0:i-subtract] + M + rhs[i+len(m)-subtract:] &#xA;                    subtract += len(m) - 1                         &#xA;            self._definition[M] = m&#xA;            R = self.repeating_disjoint_substring_indices()&#xA;            &#xA;    def arbitrary_greedy_max_function(self, R:dict):&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        Seems like a good choice.  The total coverage of a substring if you were to compress it&#xA;        into a grammar rule.&#xA;        For example:&#xA;              If g = {A -&amp;gt; BaBaBaCC, B -&amp;gt; CCC, C -&amp;gt; aaa} then (3 Ba's) * |Ba| = 3 * 2 = 6 is maximal.&#xA;        &amp;quot;&amp;quot;&amp;quot;        &#xA;        total_indices = lambda rule_indices: sum(len(x) for x in rule_indices.values())&#xA;        return max(R.keys(), key=lambda x: len(x) * total_indices(R[x]))        &#xA;            &#xA;    &#xA;    def repeating_disjoint_substring_indices(self, min_len=2):&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        If there is overlap, this algorithm clearly does a leftmost packing.&#xA;        Same as `disjoint_substring_indices()` except we compute only the&#xA;        substrings that occur &amp;gt;= 2 times within the same rule or in two&#xA;        separate rules.&#xA;        &#xA;        Output form:&#xA;        {&#xA;           'substring1' : {&#xA;                 'A': [0, 3, 7],&#xA;                 'B': [1, 4, 8],&#xA;            },&#xA;           'substring2' :  ...&#xA;        }        &#xA;        where 'A' indicates the rule in which the indices occur, and the list is the list&#xA;        of indices within the rule RHS string where you'll find the substring occuring.&#xA;        The indices returned are such that the substrings occuring at those indices are mutually&#xA;        disjoint (they don't overlap).&#xA;        &amp;quot;&amp;quot;&amp;quot;        &#xA;        return self._repeatingSubstringIndices(min_len, lambda t, indices: indices)&#xA;    &#xA;    def repeating_substring_indices_all(self, min_len=2):&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        Return all substring indices even if there is overlaps among them.&#xA;        Output form:&#xA;        {&#xA;           'substring1' : {&#xA;                 'A': [0, 3, 7],&#xA;                 'B': [1, 4, 8],&#xA;            },&#xA;           'substring2' :  ...&#xA;        }        &#xA;        where 'A' indicates the rule in which the indices occur, and the list is the list&#xA;        of indices within the rule RHS string where you'll find the substring occuring.&#xA;        This includes all occurences even if two occurences overlap.&#xA;        &amp;quot;&amp;quot;&amp;quot;        &#xA;        return self._repeatingSubstringIndices(min_len, lambda t, indices: self.all_substring_indices(t))&#xA;    &#xA;    def _repeatingSubstringIndices(self, min_len=2, rule_indices_func=None): &#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        Output form:&#xA;        {&#xA;           'substring1' : {&#xA;                 'A': [0, 3, 7],&#xA;                 'B': [1, 4, 8],&#xA;            },&#xA;           'substring2' :  ...&#xA;        }        &#xA;        where 'A' indicates the rule in which the indices occur, and the list is the list&#xA;        of indices within the rule RHS string where you'll find the substring occuring.  Overlap&#xA;        or disjoint is governed by the rule_indices_func passed in.&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        S = {}        &#xA;        for A, rhs in self._definition.items():&#xA;            T = self.disjoint_substring_indices(rhs, min_len)&#xA;            for t, indices in T.items():                &#xA;                if t not in S:&#xA;                    S[t] = { A : indices }&#xA;                else:&#xA;                    S[t][A] = indices&#xA;        R = {}        &#xA;        for t, rule_indices in S.items():&#xA;            if len(rule_indices) &amp;gt;= 2:&#xA;                R[t] = rule_indices_func(t, rule_indices)&#xA;            else:&#xA;                for var, indices in rule_indices.items():&#xA;                    if len(indices) &amp;gt;= 2:&#xA;                        R[t] = rule_indices_func(t, rule_indices)&#xA;                        break&#xA;        return R&#xA;    &#xA;    @staticmethod&#xA;    def disjoint_substring_indices(s:str, min_len=2, max_len=None):&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        Leftmost-first packed indices of all substrings of the string s.  The substring&#xA;        occurences (indexes) are guaranteed to be of disjointly occuring substrings.&#xA;        If two occurences overlap, by for-loop logic we're taking the leftmost.  Hence&#xA;        &amp;quot;leftmost-first packed&amp;quot;.&#xA;        Output form:&#xA;        {&#xA;           'substring1' : {&#xA;                 'A': [0, 3, 7],&#xA;                 'B': [1, 4, 8],&#xA;            },&#xA;           'substring2' :  ...&#xA;        }        &#xA;        where 'A' indicates the rule in which the indices occur, and the list is the list&#xA;        of indices within the rule RHS string where you'll find the substring occuring.&#xA;        The indices are such that the substrings occuring at those indices are disjoint &#xA;        (they don't overlap).&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        if max_len is None:&#xA;            max_len = int(len(s)/2)   # Maximum length of a repeated substring&#xA;        S = {}&#xA;        for i in range(0, len(s)-min_len+1):&#xA;            for j in range(i+min_len, i+min(max_len, len(s))+1):&#xA;                t = s[i:j]&#xA;                if t in S:&#xA;                    if i &amp;gt;= max(S[t]) + len(t):&#xA;                        S[t].append(i)&#xA;                else:&#xA;                    S[t] = [i]&#xA;        return S&#xA;                &#xA;    def all_substring_indices(self, t:str):&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        The indices of all occurences of the given substring.  Output form:&#xA;        {&#xA;           'A' : [0, 3, 7],&#xA;           'B' : [1, 4, 8],&#xA;           ...&#xA;        }&#xA;        where 'A' indicates the rule in which the indices occur, and the list is the list&#xA;        of indices within the rule RHS string where you'll find the substring occuring.&#xA;        This includes all occurences even if two occurences overlap.&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        R = {}        &#xA;        for A, rhs in self._definition.items():&#xA;            for i in range(0, len(rhs)-len(t)):&#xA;                if rhs[i:].startswith(t):&#xA;                    if A not in R:&#xA;                        R[A] = [i]&#xA;                    else:&#xA;                        R[A].append(i)&#xA;        return R&#xA;    &#xA;    def include_all_possible_rules(self):&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        A possible rule is one such that the length of its RHS is &amp;gt;= 2 and fully&#xA;        expanded it occurs at least twice in the input string s.  Including all possible&#xA;        rules does not change the fact that the grammar expands to s for some starting&#xA;        variable.  In other words we still have a grammar for s, by definition, though&#xA;        some of its rules may be unused.&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        # So first get all disjointly repeating substrings:&#xA;        R = self.repeating_disjoint_substring_indices()&#xA;        # To &amp;quot;include all rules&amp;quot; we form a rule for each repeating substring:&#xA;        &#xA;        for r in R:&#xA;            A = self.new_variable()&#xA;            if r not in self._definition.inv:&#xA;                self._definition[A] = r&#xA;                &#xA;    &#xA;if __name__ == '__main__':&#xA;    s = 'aaaaaa'&#xA;    g = Grammar(s)&#xA;    g.greedily_reduce()&#xA;    print(g)&#xA;    print('The canonical example on a singleton alphabet.  The smallest example such that the smallest '&#xA;          f'grammar is indeed smaller than the input {s}')&#xA;    print('-----------')&#xA;    s = 'ababab'&#xA;    g = Grammar(s)&#xA;    g.greedily_reduce()&#xA;    print(g)&#xA;    print(f&amp;quot;This is known to indeed be a smallest grammar of {s}, by inspection.&amp;quot;)    &#xA;    print('-----------')&#xA;    s = 'abcabcabababc'&#xA;    g = Grammar(s)&#xA;    g.greedily_reduce()&#xA;    print(g)&#xA;    print(f&amp;quot;Similarly, this too also is probably a smallest grammar for {s}&amp;quot;)&#xA;    print('-----------')&#xA;    s = 'ababababbaaaaaaaabbbbaa'&#xA;    print(s)&#xA;    g = Grammar(s)&#xA;    g.include_all_possible_rules()&#xA;    g.greedily_reduce()&#xA;    s1 = g.fully_expanded_string()&#xA;    print(g)&#xA;    assert (s1 == s)&#xA;    print('A more complicated example demonstrating &amp;quot;including all possible rules&amp;quot; and then greedily reducing '&#xA;          'everything.')&#xA;    print('-----------')&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Which prints:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;A ---&amp;gt; BBB&#xA;B ---&amp;gt; aa&#xA;The canonical example on a singleton alphabet.  The smallest example such that the smallest grammar is indeed smaller than the input aaaaaa&#xA;-----------&#xA;A ---&amp;gt; BBB&#xA;B ---&amp;gt; ab&#xA;This is known to indeed be a smallest grammar of ababab, by inspection.&#xA;-----------&#xA;A ---&amp;gt; CCBBC&#xA;B ---&amp;gt; ab&#xA;C ---&amp;gt; Bc&#xA;Similarly, this too also is probably a smallest grammar for abcabcabababc&#xA;-----------&#xA;ababababbaaaaaaaabbbbaa&#xA;A ---&amp;gt; DDOLLLbbbO&#xA;B ---&amp;gt; ab&#xA;C ---&amp;gt; aba&#xA;D ---&amp;gt; BB&#xA;E ---&amp;gt; ba&#xA;F ---&amp;gt; bab&#xA;G ---&amp;gt; abb&#xA;H ---&amp;gt; bb&#xA;I ---&amp;gt; bba&#xA;J ---&amp;gt; bbL&#xA;K ---&amp;gt; baa&#xA;L ---&amp;gt; aa&#xA;M ---&amp;gt; aaa&#xA;N ---&amp;gt; LL&#xA;O ---&amp;gt; bL&#xA;A more complicated example demonstrating &amp;quot;including all possible rules&amp;quot; and then greedily reducing everything.&#xA;-----------&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="86175" LastActivityDate="2021-04-30T07:35:06.543" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22223" PostTypeId="2" ParentId="2140" CreationDate="2021-04-30T11:45:29.773" Score="2" Body="&lt;h1&gt;Drawing the Mathematics Stack Exchange logo (ASCII Logos 2)&lt;/h1&gt;&#xA;&lt;p&gt;The goal is to create the Mathematics Stack Exchange logo using ASCII characters.&lt;/p&gt;&#xA;&lt;p&gt;It looks like this.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/lcYws.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/lcYws.png&quot; alt=&quot;Mathematics Stack Exchange&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The exact output should look like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;                   _&#xA;                /=/ \=\&#xA;             /=/       \=\&#xA;            |             |&#xA;            |\=\       /=/|&#xA;            |   \=\ /=/   |&#xA;            |      |      |&#xA;       _    |      |      |    _&#xA;    /=/ \=\  \=\   |   /=/  /=/ \=\&#xA; /=/       \=\  \=\|/=/  /=/       \=\&#xA;|             |    |    |             |&#xA;|\=\       /=/|         |\=\       /=/|&#xA;|   \=\ /=/   |         |   \=\ /=/   |&#xA;|      |      |         |      |      |&#xA;|      |      |         |      |      |&#xA; \=\   |   /=/           \=\   |   /=/&#xA;    \=\|/=/                 \=\|/=/&#xA; /=/   |   \=\           /=/   |   \=\&#xA;|             |         |             |&#xA;|\=\       /=/|         |\=\       /=/|&#xA;|   \=\ /=/   |         |   \=\ /=/   |&#xA;|      |      |         |      |      |&#xA;|      |      |    _    |      |      |&#xA; \=\   |   /=/  /=/ \=\  \=\   |   /=/&#xA;    \=\|/=/  /=/       \=\  \=\|/=/&#xA;       |    |             |    |&#xA;            |\=\       /=/|&#xA;            |   \=\ /=/   |&#xA;            |      |      |&#xA;            |      |      |&#xA;             \=\   |   /=/&#xA;                \=\|/=/&#xA;                   |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You must make sure the cubes should be symmetrical just like the original logo, and must make space to create a 6-point star in the middle. Yes, the output looks messed up, but it's all I can do to really make a shape.&lt;/p&gt;&#xA;&lt;p&gt;Remember, 6 boxes aligned as a hexagon.&lt;/p&gt;&#xA;&lt;p&gt;Can you draw it with the least bytes possible?&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Any suggestions?&lt;/p&gt;&#xA;&lt;p&gt;If this question reaches a score of 4, it will be posted on 12:00 PM UTC, 1 month after &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/22219#22219&quot;&gt;Stack Overflow's&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="103574" LastEditorUserId="103574" LastEditDate="2021-04-30T12:25:57.387" LastActivityDate="2021-04-30T12:25:57.387" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22224" PostTypeId="2" ParentId="2140" CreationDate="2021-04-30T15:59:41.913" Score="2" Body="&lt;h1&gt;KoTH - JS WarBots&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Based on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/48751/king-of-the-hill-robot-battle&quot;&gt;King of the Hill: Robot Battle&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Rules and Instructions&lt;/h2&gt;&#xA;&lt;p&gt;Program a bot as an object in JavaScript. The functions that can be called are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;left(name)&lt;/code&gt; Moves left 1 unit (x position -1)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;right(name)&lt;/code&gt; Moves right 1 unit (x position +1)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;up(name)&lt;/code&gt; Moves up 1 unit (y position -1)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;down(name)&lt;/code&gt; Moves down 1 unit (y position +1)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;forward(name)&lt;/code&gt; Moves forward 1 unit (z position -1)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;backward(name)&lt;/code&gt; Moves backward 1 unit (z position +1)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;mine(name)&lt;/code&gt; Places a mine at current position (bots can be blown up by their own mines, with a 1 tick delay before priming)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;scan(name)&lt;/code&gt; Scans for mines and players in adjacent cells (cells a bot can move to). Returns an array &lt;code&gt;[left, right, up, down, forward, backward]&lt;/code&gt;. Each element can be &lt;code&gt;0&lt;/code&gt; (nothing there) &lt;code&gt;1&lt;/code&gt; (mine) &lt;code&gt;2&lt;/code&gt; (other bot).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;pass(name)&lt;/code&gt; Do nothing&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;code&gt;name&lt;/code&gt; is the name of the bot. Any bot whose action's name is not the name of the bot will be disqualified (if your bot is called &amp;quot;Foo&amp;quot; you must have &lt;code&gt;pass(&amp;quot;Foo&amp;quot;)&lt;/code&gt; and not &lt;code&gt;pass(&amp;quot;foo&amp;quot;)&lt;/code&gt; or &lt;code&gt;pass(&amp;quot;Bar&amp;quot;)&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;p&gt;The 3D arena is a 1000x1000x1000 cube, centered at (0,0,0). Each turn of a game, every bot must select one of the above actions to perform. Every 10 turns (subject to change) minesweeping will occur, removing 50% of the existing mines to reduce camping.&lt;/p&gt;&#xA;&lt;p&gt;A bot is eliminated from a game if:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is in the same position as a mine.&lt;/li&gt;&#xA;&lt;li&gt;It exits the game area.&lt;/li&gt;&#xA;&lt;li&gt;It collides with another bot (both bots are eliminated).&lt;/li&gt;&#xA;&lt;li&gt;The cell that it occupies does not have integer coordinates (&lt;code&gt;(0,0,0)&lt;/code&gt; is valid, &lt;code&gt;(0.5,0,0)&lt;/code&gt; is not)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;After 1000 turns, if a bot is not eliminated, it receives &lt;code&gt;Math.floor(1000/bots)&lt;/code&gt; points, where &lt;code&gt;bots&lt;/code&gt; is the number of bots left. If a bot eliminates another bot by mining it, it receives 100 points. If there are no bots left after 1000 turns, nobody gets any points.&lt;/p&gt;&#xA;&lt;h2&gt;Formatting your bots&lt;/h2&gt;&#xA;&lt;p&gt;Here are examples of bots (These will be playing too!):&lt;/p&gt;&#xA;&lt;h3&gt;RandomBot&lt;/h3&gt;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;var RandomBot = { // Same name as the name property&#xA;    name: &amp;quot;RandomBot&amp;quot;,&#xA;&#xA;    x: Math.floor(Math.random() * 1000 - 500), // If unspecified, defaults to 0.&#xA;    y: Math.floor(Math.random() * 1000 - 500), // If unspecified, defaults to 0.&#xA;    z: Math.floor(Math.random() * 1000 - 500), // If unspecified, defaults to 0.&#xA;&#xA;    turn: () =&amp;gt; {&#xA;        var action = Math.ceil(Math.random() * 9)&#xA;        if (action == 1) { left(&amp;quot;RandomBot&amp;quot;) }&#xA;        else if (action == 2) { right(&amp;quot;RandomBot&amp;quot;) }&#xA;        else if (action == 3) { up(&amp;quot;RandomBot&amp;quot;) }&#xA;        else if (action == 4) { down(&amp;quot;RandomBot&amp;quot;) }&#xA;        else if (action == 5) { forward(&amp;quot;RandomBot&amp;quot;) }&#xA;        else if (action == 6) { backward(&amp;quot;RandomBot&amp;quot;) }&#xA;        else if (action == 7) { mine(&amp;quot;RandomBot&amp;quot;) }&#xA;        else if (action == 8) { scan(&amp;quot;RandomBot&amp;quot;) }&#xA;        else { pass(&amp;quot;RandomBot&amp;quot;) }&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;May the best bot win!&lt;/p&gt;&#xA;&lt;h3&gt;The challenge will be posted later when it receives sufficient votes and the controller is developed. If there are any questions regarding this challenge, please comment about it.&lt;/h3&gt;&#xA;" OwnerUserId="95652" LastEditorUserId="95652" LastEditDate="2021-04-30T19:20:31.283" LastActivityDate="2021-04-30T19:20:31.283" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="22225" PostTypeId="1" AcceptedAnswerId="22226" CreationDate="2021-05-01T00:00:33.873" Score="18" ViewCount="1146" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19271/78850&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout May 2021, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Vyxal&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;What's a Language of the Month?&lt;/p&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/78850&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during May, those who wish to participate should learn (at least the basics of) Vyxal, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about Vyxal&lt;/h2&gt;&#xA;&lt;p&gt;&lt;sup&gt;Taken from the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/22138/78850&quot;&gt;nomination post&lt;/a&gt; and from the &lt;a href=&quot;https://github.com/Lyxal/Vyxal/blob/master/README.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;README.md&lt;/a&gt; in the official GitHub repository&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;Vyxal is the latest addition to the plethora of stack-based languages used for code golfing. But unlike its competitors, Vyxal has a special focus upon readability and elegancy. Indeed, the codepage has been specially chosen to be as mnemonic as possible. Further, constructs from practical languages (such as functions, lambdas and easy list manipulation) are present.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Vyxal has been known to repeatedly win against languages like 05ab1e, Jelly and Pyth... &lt;a href=&quot;https://codegolf.stackexchange.com/a/210307/78850&quot;&gt;it managed to beat Dennis in fizzbuzz&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It has features designed to make it feel analogous to practical languages while remaining concise&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It has reached version 2.0, so all heavy development has been completed&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Bugs are fixed relatively quickly: 10 of the most recent issues were all promptly addressed&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Bounty&lt;/h2&gt;&#xA;&lt;p&gt;Unlike previous LoTMs, in addition to a 50 rep bounty for first anwers, the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/22137/78850&quot;&gt;deadlineless 300 rep bounty&lt;/a&gt; will also be awarded. Post 5 Vyxal answers and you'll get an easy 300 rep added to your account.&lt;/p&gt;&#xA;&lt;h3&gt;Resources&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/Vyxal/Vyxal&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github Repository&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/106764/vyxal&quot;&gt;Chatroom&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://lyxal.pythonanywhere.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Online Interpreter&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/Vyxal/Vyxal/blob/master/docs/Tutorial.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tutorial&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/Vyxal/Vyxal/blob/master/docs/elements.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;Command reference&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://esolangs.org/wiki/Vyxal&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolangs article&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/223918/95792&quot;&gt;Golfing tips&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5243/list-of-bounties-with-no-deadline/22137#22137&quot;&gt;Language bounty&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;" OwnerUserId="78850" LastEditorUserId="100664" LastEditDate="2023-09-29T02:21:53.250" LastActivityDate="2023-09-29T02:21:53.250" Title="Language of the Month for May 2021: Vyxal" Tags="|discussion|language-of-the-month|vyxal|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22226" PostTypeId="2" ParentId="22225" CreationDate="2021-05-01T00:00:33.873" Score="11" Body="&lt;h1&gt;List of all Vyxal solutions posted in May 2021&lt;/h1&gt;&#xA;&lt;p&gt;(First time posters highlighted in bold, and bounty claimers in italics)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224829/101522&quot;&gt;Round away from zero&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224831/101522&quot;&gt;Write a program with infinite expected output&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224908/101522&quot;&gt;Semi-Diagonal Alphabet&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224897/78850&quot;&gt;Make an alphabet searchlight&lt;/a&gt; by &lt;em&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/68942/hyper-neutrino&quot;&gt;hyper-neutrino&lt;/a&gt;&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224928/101522&quot;&gt;Coprimes up to N&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224930&quot;&gt;Primes numbers with prime index&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/95792&quot;&gt;user&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224943/101522&quot;&gt;Round toward zero&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224944/101522&quot;&gt;I reverse the source code, you negate the input!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224948/101522&quot;&gt;The Letter A without A&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224980/101522&quot;&gt;I double the source, you double the output!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224981/101522&quot;&gt;I reverse the source code, you negate the output!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225006/66833&quot;&gt;Exciting Mario Kart Grand Prix - Minimize the point difference!&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/caird-coinheringaahing&quot;&gt;caird coinheringaahing&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224989/78850&quot;&gt;Machine Epsilon&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/75429/citty&quot;&gt;Citty&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225005/78850&quot;&gt;Exciting Mario Kart Grand Prix - Minimize the point difference!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/77516/manish-kundu&quot;&gt;Manish Kundu&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225135/80214&quot;&gt;Reverse and Invert a String&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225178/101522&quot;&gt;Conway's Monster&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225185/101522&quot;&gt;String to Binary&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225186/101522&quot;&gt;The Luhn algorithm for verifying credit card numbers, etc&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225211/80214&quot;&gt;Numbers divisible by the sum and product of their digits&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/220211/which-th-second-now-in-this-year/225245#225245&quot;&gt;Which th second now in this year&lt;/a&gt; by &lt;em&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/92116/wasif&quot;&gt;Wasif&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/47005/different-way-forward/225281#225281&quot;&gt;Different Way Forward&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/92116/wasif&quot;&gt;Wasif&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/192979/i-reverse-the-source-code-you-negate-the-output/225283#225283&quot;&gt;I reverse the source code, you negate the output!&lt;/a&gt; by Wasif&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225285/100664&quot;&gt;Generate all solvable 2xN mazes&lt;/a&gt; by &lt;em&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/a-username&quot;&gt;A username&lt;/a&gt;&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/224852/100887&quot;&gt;Draw the Stack Overflow Logo&lt;/a&gt; by &lt;em&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/100887/stackmeter&quot;&gt;StackMeter&lt;/a&gt;&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225376/101522&quot;&gt;Adding without using a + or - sign&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225385/101522&quot;&gt;Count the number of vowels in each word of a string&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210976/lolololololololololololol/225403#225403&quot;&gt;Lolololololololololololol&lt;/a&gt; by Wasif&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225442/101522&quot;&gt;Write an interpreter for *&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225465/101522&quot;&gt;Write an interpreter for &amp;quot;interpreter&amp;quot;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225299/68942&quot;&gt;Output a Latin Square&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/68942/hyper-neutrino&quot;&gt;hyper-neutrino&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225396/68942&quot;&gt;Animate finding the middle&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/68942/hyper-neutrino&quot;&gt;hyper-neutrino&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225397/68942&quot;&gt;Adding up the digits and the digits reversed&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/68942/hyper-neutrino&quot;&gt;hyper-neutrino&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225398/68942&quot;&gt;It was just a bug&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/68942/hyper-neutrino&quot;&gt;hyper-neutrino&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225537/80050&quot;&gt;Find Abecedarian Words&lt;/a&gt; by &lt;strong&gt;&lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/80050&quot;&gt;a stone arachnid&lt;/a&gt;&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225610/92727&quot;&gt;Compute the uncomputable … sort of&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/92727/command-master&quot;&gt;Command Master&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225668/80050&quot;&gt;Old Spanish alphabetical order&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80050&quot;&gt;a stone arachnid&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225681/80050&quot;&gt;Draw an hourglass&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80050&quot;&gt;a stone arachnid&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225683/80050&quot;&gt;Invert a boolean array&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80050&quot;&gt;a stone arachnid&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225394/99035&quot;&gt;!I!n!s!e!r!t! !i!n!b!e!t!w!e!e!n!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/99035&quot;&gt;Underslash&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225544/99035&quot;&gt;Stay away from zero&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/99035&quot;&gt;Underslash&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225653/99035&quot;&gt;Implement a Truth-Machine&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/99035&quot;&gt;Underslash&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/2167/print-the-alphabet-four-times/225788#225788&quot;&gt;Print the alphabet four times&lt;/a&gt; by Wasif&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/39752/sing-happy-birthday-to-your-favourite-programming-language/225790#225790&quot;&gt;Sing Happy Birthday to your favourite programming language&lt;/a&gt; by Wasif&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225815/80050&quot;&gt;Compatible strings&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80050&quot;&gt;a stone arachnid&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225862/99035&quot;&gt;Partial Sum of Harmonic Sequence!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/99035&quot;&gt;Underslash&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225909/80050&quot;&gt;I give you ascii-art, you make it pseudo-3d&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80050&quot;&gt;a stone arachnid&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225426/85334&quot;&gt;Parenthifiable Binary Numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/85334/unrelated-string&quot;&gt;&lt;strong&gt;Unrelated String&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225994/85334&quot;&gt;Has My Pie Been Bisected?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/85334/unrelated-string&quot;&gt;Unrelated String&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225913/80050&quot;&gt;Shortest Konami Code&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80050&quot;&gt;a stone arachnid&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225948/80050&quot;&gt;What is the standard scratch?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80050&quot;&gt;a stone arachnid&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226033/80050&quot;&gt;Generate ;# code&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80050&quot;&gt;a stone arachnid&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225989/101522&quot;&gt;Write the shortest self-identifying program (a quine variant)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226029/101522&quot;&gt;Make a polyglot generator&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226132/99035&quot;&gt;We're no strangers to code golf, you know the rules, and so do I&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/99035&quot;&gt;Underslash&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/167199/recover-the-power-from-the-prime-power/226142#226142&quot;&gt;Recover the power from the prime power&lt;/a&gt; by Wasif&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/225916/convert-version-string-to-pack-format/226143#226143&quot;&gt;Convert version string to pack_format&lt;/a&gt; by Wasif&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/186582/print-n-ne-e-se-s-sw-w-nw/225979#225979&quot;&gt;Print &amp;quot;N NE E SE S SW W NW&amp;quot;&lt;/a&gt; by Wasif&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/151023/a-very-long-terza-rima/226151#226151&quot;&gt;A very long Terza Rima&lt;/a&gt; by Wasif&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226218/101522&quot;&gt;Create a program that prints the number of characters it has, in words&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226316/101522&quot;&gt;Obfuscated Hello World&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/200576/when-i-grow-up-i-want-to-be-ascii/226440#226440&quot;&gt;When I grow up I want to be ASCII&lt;/a&gt; by Wasif&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/212240/three-other-numbers/226437#226437&quot;&gt;Three other numbers&lt;/a&gt; by Wasif&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/5529/is-string-x-a-subsequence-of-string-y/226425#226425&quot;&gt;Is string X a subsequence of string Y?&lt;/a&gt; by Wasif&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/2078/the-alphabet-in-programming-languages/226423#226423&quot;&gt;The alphabet in programming languages&lt;/a&gt; by Wasif&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/125377/longest-run-of-a-character-in-a-string/226422#226422&quot;&gt;Longest run of a character in a string&lt;/a&gt; by Wasif&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/5600/print-the-alphabet-without-using-each-vowel/226415#226415&quot;&gt;Print the alphabet without using each vowel&lt;/a&gt; by Wasif&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226518/95792&quot;&gt;Find an Illegal String&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792&quot;&gt;user&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226519/95792&quot;&gt;A rainbow of identity functions&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792&quot;&gt;user&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226529/95792&quot;&gt;Print the tetration&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792&quot;&gt;user&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226592/95792&quot;&gt;Implement a zipwith function&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792&quot;&gt;user&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr&gt;&#xA;&lt;h1&gt;List of all Vyxal tips posted in May 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225286/78850&quot;&gt;Use &lt;code&gt;\&lt;/code&gt; for single byte strings and &lt;code&gt;‛&lt;/code&gt; for two byte strings&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;Lyxal&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225288/78850&quot;&gt;Compress your strings and numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/Lyxal&quot;&gt;Lyxal&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225369/101522&quot;&gt;Use the register instead of a variable&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/223918/tips-for-golfing-in-vyxal/226119#226119&quot;&gt;Custom base decompression&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/a-username&quot;&gt;A username&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;tip title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;List of Vyxal-related challenges posted in May 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/q/&amp;lt;question-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="95792" LastEditDate="2021-05-31T18:32:29.290" LastActivityDate="2021-05-31T18:32:29.290" CommentCount="0" CommunityOwnedDate="2021-05-01T05:53:52.773" ContentLicense="CC BY-SA 4.0" />
  <row Id="22228" PostTypeId="2" ParentId="2140" CreationDate="2021-05-01T04:07:46.120" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224876/generate-the-ticks-of-a-graph&quot;&gt;Generate the ticks of a graph&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91472" LastEditorUserId="91472" LastEditDate="2021-05-01T19:42:16.767" LastActivityDate="2021-05-01T19:42:16.767" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22230" PostTypeId="1" CreationDate="2021-05-01T10:03:40.523" Score="5" ViewCount="178" Body="&lt;p&gt;I posted a King of the Hill challenge recently, but I'm not sure if &lt;a href=&quot;https://codegolf.stackexchange.com/a/224737/103324&quot;&gt;this answer&lt;/a&gt; is in the spirit of KoTH challenges. It chooses a random number at the start of the challenge and repeats that number throughout the challenge. This means that each time I run the game it changes the playing field drastically while other random bots average their results over time.&lt;/p&gt;&#xA;&lt;p&gt;I would probably ban this type of bot if it didn't seem like a narrow arbitrary ban. I'm also relatively new to the site so  I'm not sure what to expect.&lt;/p&gt;&#xA;&lt;p&gt;What is the community consensus about this sort of bot?&lt;/p&gt;&#xA;" OwnerUserId="103324" LastEditorUserId="103324" LastEditDate="2021-05-02T09:46:28.110" LastActivityDate="2021-05-07T03:18:53.740" Title="Are random submissions with drastically different results each time allowed in KoTH challenges?" Tags="|discussion|king-of-the-hill|" AnswerCount="3" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="22231" PostTypeId="2" ParentId="22230" CreationDate="2021-05-01T11:03:38.620" Score="4" Body="&lt;p&gt;The end of the competition is drawing near and I'd say that ad hoc changes like this would make the KoTH challenge even more unfair. Within the parameters of your challenge, results can be very inconsistent and if you don't want the inconsistency, you have to think of the possible solutions people would submit and take them into account while setting the rules for your KoTH challenge. This would require a lot of thought—simply banning the Rude Random bot wouldn't cut it.&lt;/p&gt;&#xA;" OwnerUserId="103581" LastActivityDate="2021-05-01T11:03:38.620" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="22232" PostTypeId="2" ParentId="22230" CreationDate="2021-05-01T11:50:51.723" Score="9" Body="&lt;h1&gt;Ban generally, not specifically&lt;/h1&gt;&#xA;&lt;p&gt;I'm very much opposed to the idea that &amp;quot;OP has final say&amp;quot; (I.e. if the post author dislikes an answer, or doesn't think it's ok, they get to disqualify it)&lt;span class=&quot;math-container&quot;&gt;\${}^*\$&lt;/span&gt;. Answers should be objectively valid or invalid by anyone who has read the challenge rules.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, I suggest that bans be more general than specific. You can ban random bots in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; by requiring them to be deterministic. Beyond that, you can ban specific, objective behaviour (e.g. may only use uniform random distributions), but not specific answers, unless they break the rules.&lt;/p&gt;&#xA;&lt;p&gt;Unfortunately, this is an all-too-common reality of challenge writing on CGCC. There are very often answers which completely screw up the challenge, but which are perfectly valid. Typically, they are hyper optimised solutions, or clever tricks found in the mathematics. Here, however, the randomness has affected it in unexpected ways. Really, the only advice I can give is that randomness is often compensated for by running a lot of rounds. Try running a sample competition and see whether 1000 rounds &amp;quot;fixes&amp;quot; the extremes produced by Rude Random.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\${}^*\$&lt;/span&gt; And I have, and do, vote to close challenges as &amp;quot;opinion-based&amp;quot; if the OP tries to claim that they have final say&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-05-01T11:50:51.723" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="22233" PostTypeId="2" ParentId="2140" CreationDate="2021-05-01T12:32:07.907" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224969/time-bomb-koth&quot;&gt;Time bomb KoTH&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="76277" LastEditorUserId="66833" LastEditDate="2021-05-03T14:17:15.800" LastActivityDate="2021-05-03T14:17:15.800" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="22235" PostTypeId="2" ParentId="2140" CreationDate="2021-05-01T16:27:59.763" Score="1" Body="&lt;h1&gt;Self-Interpreter But Never Loops&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I'm afraid that this might look too intimidating. Is there any way to improve it?&lt;/p&gt;&#xA;&lt;p&gt;Ever since Gödel and Turing, it is widely assumed that a reasonable programming language that contains a self-interpreter can never be &lt;strong&gt;terminating&lt;/strong&gt;. Here, I present a simple proof.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Suppose that, on the contrary, a total language has a self-interpreter &lt;code&gt;eval(program, input)&lt;/code&gt; that accepts two natural numbers that encode programs and inputs, respectively. Then this function &lt;code&gt;eval&lt;/code&gt; can be encoded as a natural number, since it is a program with two inputs. We define the function&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;evil(n) &amp;lt;- 1 + eval(n, n)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Then, since &lt;code&gt;evil&lt;/code&gt; is a program, it can be encoded as a number &lt;code&gt;EVIL&lt;/code&gt;. Therefore &lt;code&gt;evil(EVIL) = 1 + eval(EVIL, EVIL)&lt;/code&gt;. By the nature of &lt;code&gt;eval&lt;/code&gt; it computes to &lt;code&gt;1 + evil(EVIL)&lt;/code&gt;. But this is impossible, since no natural number is equal to one plus itself. Therefore, somewhere along the line of reasoning, one of the functions involved must loop indefinitely.&lt;/p&gt;&#xA;&lt;p&gt;[On the other side, the program can also return something like &lt;code&gt;StackOverflow&lt;/code&gt; or &lt;code&gt;null&lt;/code&gt;, but that would render the self-interpreter incorrect, since the program that is being interpreted actually behaves differently.]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Of course, such a proof ignores a bunch of details -- in imperative languages, the function can change global variables; some nasty languages doesn't have anything like functions; some languages may not be able to define natural numbers, etc. But you get the idea. I quote &lt;a href=&quot;https://mail.haskell.org/pipermail/haskell-cafe/2003-May/004343.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;C. T. McBride&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;It's ironic, but not disastrous that lucifer, the&#xA;evaluation function by which [...] angels [representing programs in a terminating subset of Haskell] bring their light, is himself an&#xA;angel, but one who must be cast into Hell.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Now it's time for rebellion.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Challenge.&lt;/strong&gt; Pick your favorite language (or a subset of it) that is terminating. Write a self-interpreter for it. The language must also contain (to eliminate trivial cases):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Arithmetic for arbitrary precision integers.&lt;/li&gt;&#xA;&lt;li&gt;A program that always returns its input.&lt;/li&gt;&#xA;&lt;li&gt;Random-access lists.&lt;/li&gt;&#xA;&lt;li&gt;The encoding of programs must support random access. There must be a program that enumerates all legal programs up to size &lt;code&gt;n&lt;/code&gt;, where &lt;code&gt;n&lt;/code&gt; is the input.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;What's happening here? Indeed, there are flaws in our reasoning above. A self-interpreter need not have its program encoded with natural numbers. And moreover, with an modestly elaborate type system, you can forbid the &lt;code&gt;evil&lt;/code&gt; program to be well typed, as pointed out &lt;a href=&quot;http://compilers.cs.ucla.edu/popl16/popl16-full.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;. The linked paper already contains a program that fulfills the requirements of the challenge in the language &lt;span class=&quot;math-container&quot;&gt;\$\mathrm F_\omega\$&lt;/span&gt; (arithmetic for integers and random-access lists are left as an exercise for the reader).&lt;/p&gt;&#xA;" OwnerUserId="90585" LastActivityDate="2021-05-01T16:27:59.763" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22236" PostTypeId="2" ParentId="2140" CreationDate="2021-05-01T17:43:07.027" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224871/tips-for-golfing-in-binary-lambda-calculus&quot;&gt;Tips for golfing in Binary Lambda Calculus&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerDisplayName="user101133" LastEditorUserId="66833" LastEditDate="2021-05-01T17:55:05.630" LastActivityDate="2021-05-01T17:55:05.630" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="22237" PostTypeId="5" CreationDate="2021-05-01T23:05:25.940" Score="0" Body="&lt;p&gt;Answers would be marked &amp;quot;non-competing&amp;quot; to indicate that they were valid answers, but ineligible to win. The most common usage of the term was for answers written in languages that post-date the challenge. However, since &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12877/lets-allow-newer-languages-versions-for-older-challenges&quot;&gt;newer languages are allowed by default&lt;/a&gt; now, this no longer applies and the non-competing label has been fully retired.&lt;/p&gt;&#xA;&lt;p&gt;Note that, even if marked as non-competing, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990/66833&quot;&gt;invalid answers are not allowed&lt;/a&gt; and should be removed per site rules.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-01T23:05:25.940" LastActivityDate="2021-05-01T23:05:25.940" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22238" PostTypeId="4" CreationDate="2021-05-01T23:05:25.940" Score="0" Body="For questions about the non-competing label. Non-competing is a retired label used on answers that are &quot;non-competing&quot; i.e. they are valid answers but ineligible to win. The &quot;non-competing&quot; label has now been fully retired, and should not added to new answers" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-01T23:05:25.940" LastActivityDate="2021-05-01T23:05:25.940" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22239" PostTypeId="5" CreationDate="2021-05-02T23:59:07.133" Score="0" Body="&lt;p&gt;Stack Exchange notifies users when specific actions happen on or to their posts. The most common actions are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Answers&lt;/li&gt;&#xA;&lt;li&gt;Comments&lt;/li&gt;&#xA;&lt;li&gt;Edits to non-Community Wiki posts&lt;/li&gt;&#xA;&lt;li&gt;Activity on posts you follow&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Additionally, users can receive regular emails containing the activity on their posts by changing their &lt;a href=&quot;https://codegolf.stackexchange.com/users/email/settings/current&quot;&gt;email preferences&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You can see a list of your notifications on the &lt;a href=&quot;https://codegolf.stackexchange.com/users/current?tab=responses&quot;&gt;Reponses tab&lt;/a&gt; on your profile&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-02T23:59:07.133" LastActivityDate="2021-05-02T23:59:07.133" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22240" PostTypeId="4" CreationDate="2021-05-02T23:59:07.133" Score="0" Body="For questions about the systems used by Stack Exchange to notify users of activity involving them" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-02T23:59:07.133" LastActivityDate="2021-05-02T23:59:07.133" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22241" PostTypeId="5" CreationDate="2021-05-03T00:05:33.023" Score="0" Body="&lt;p&gt;This tag is for questions about using the &lt;a href=&quot;https://www.php.net/&quot; rel=&quot;nofollow noreferrer&quot;&gt;PHP programming language&lt;/a&gt; in answers on the &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;main site&lt;/a&gt;, such as asking about rules covering situations specific to PHP.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Do not post questions asking for help with PHP on meta&lt;/strong&gt;, they will be closed as off-topic. Instead, post them on &lt;a href=&quot;https://stackoverflow.com/&quot;&gt;Stack Overflow&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-03T00:05:33.023" LastActivityDate="2021-05-03T00:05:33.023" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22242" PostTypeId="4" CreationDate="2021-05-03T00:05:33.023" Score="0" Body="For questions about the usage of the PHP programming language on the main site. Do not post questions asking for help with PHP on meta using this tag." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-03T00:05:33.023" LastActivityDate="2021-05-03T00:05:33.023" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22243" PostTypeId="2" ParentId="2140" CreationDate="2021-05-03T05:32:18.347" Score="1" Body="&lt;h1&gt;Assassin KoTH&lt;/h1&gt;&#xA;&lt;h2&gt;Description&lt;/h2&gt;&#xA;&lt;p&gt;Each bot is a point in the 2D plane. Each game, the list off bots is shuffled and each bot is a particular bot as their mark. This is done such that there is a cycle of assassins and targets.&lt;/p&gt;&#xA;&lt;p&gt;Each bot's goal is to kill their mark and avoid their assassin. They can kill their target by getting within a certain distance to them. When they kill their target their new target is their target's assigned target. This continues until there are two bots left in the arena. Then each bot scores their kill count and the two remaining bots score their kill count plus a bonus.&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;What should the bonus for being one of the remaining bots be?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Should the game take place on a grid instead of a 2D plane?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Should there be a time limit?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is creating a bot accessible enough or is the game too complicated?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Any other feedback?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="103324" LastActivityDate="2021-05-03T05:32:18.347" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="22244" PostTypeId="1" AcceptedAnswerId="22246" CreationDate="2021-05-03T07:07:09.993" Score="1" ViewCount="93" Body="&lt;p&gt;There exist some questions that it's easier to output an array longer than intended to output, and it costs to slice.&lt;/p&gt;&#xA;&lt;p&gt;Longer array behave like small ones as long as you don't access its length or out-of-range values, and for languages like C, &lt;code&gt;malloc&lt;/code&gt; in lots of libs allocate more memory.&lt;/p&gt;&#xA;&lt;p&gt;So for languages that &lt;code&gt;length&lt;/code&gt; exists, Is returning a longer array allowed?&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="66833" LastEditDate="2021-05-03T13:19:21.983" LastActivityDate="2021-05-03T23:44:18.107" Title="Is returning a longer array allowed?" Tags="|discussion|code-golf|output|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="22245" PostTypeId="2" ParentId="2140" CreationDate="2021-05-03T14:17:28.183" Score="0" Body="&lt;h1&gt;Cleaning KoTH&lt;/h1&gt;&#xA;&lt;p&gt;Clean up a 50x75 room with a JSbot before there is too much junk!&lt;/p&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;A 50x75 room is cluttered 375 items, each taking up 1 cell of space. Create a JSbot that takes an array as an input to clean up the room. If the bot is on a cell with junk in it, the junk is automatically removed.&lt;/p&gt;&#xA;&lt;p&gt;Each bot will be paired against another bot. One bot will be the &amp;quot;cleaner,&amp;quot; the other will be a &amp;quot;disorganizer.&amp;quot; The cleaner is exactly what it is. The disorganizer, every turn, has a 10% chance of being able to place a junk where it is.&lt;/p&gt;&#xA;&lt;p&gt;The disorganizer wins if the amount of junk reaches 400 or more, while the cleaner wins if the amount of junk reaches 0.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Preset commands you may use are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;left(bot_name)&lt;/code&gt; Moves left 1 cell (x-1)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;right(bot_name)&lt;/code&gt; Moves right 1 cell (x+1)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;up(bot_name)&lt;/code&gt; Moves up 1 cell (y+1)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;down(bot_name)&lt;/code&gt; Moves down 1 cell (y-1)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Storing data in your bot is allowed!&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;Here is an example of a bot, and how to format it.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;bots.ConfusedBot = { // bots.Foo where Foo is the name of your bot&#xA;    x: 0 // 0 is the center&#xA;    y: 0 // 0 is the center&#xA;    clean: function (array) { // cleaning function&#xA;        left(&amp;quot;ConfusedBot&amp;quot;);&#xA;        right(&amp;quot;ConfusedBot&amp;quot;);&#xA;        up(&amp;quot;ConfusedBot&amp;quot;);&#xA;        down(&amp;quot;ConfusedBot&amp;quot;);&#xA;    }&#xA;    sabotage: function (array) { // disorganizing funcction&#xA;        up(&amp;quot;ConfusedBot&amp;quot;);&#xA;        down(&amp;quot;ConfusedBot&amp;quot;);&#xA;        left(&amp;quot;ConfusedBot&amp;quot;);&#xA;        right(&amp;quot;ConfusedBot&amp;quot;);&#xA;    }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Comments and/or concerns? Comment down below to notify me.&lt;/p&gt;&#xA;" OwnerUserId="95652" LastActivityDate="2021-05-03T14:17:28.183" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22246" PostTypeId="2" ParentId="22244" CreationDate="2021-05-03T23:44:18.107" Score="1" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;h3&gt;Data structure view&lt;/h3&gt;&#xA;&lt;p&gt;Vector is a fundamental data structure for a growable, indexable array. It is commonly known that, when the allocated buffer space needs to grow, it is reallocated with twice the previous size (so that &amp;quot;push&amp;quot; operation is kept at amortized O(1)). Therefore, the allocated buffer will be longer than the length (the number of actual elements) most of the time.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;But&lt;/strong&gt;, it should be noted that the &lt;code&gt;length&lt;/code&gt; property &lt;em&gt;is&lt;/em&gt; what defines the content of the vector. Let's assume the buffer contains the values &lt;code&gt;[1, 2, 3, 4]&lt;/code&gt;. If the &lt;code&gt;length&lt;/code&gt; is 4, the vector object as a whole represents an array &lt;code&gt;[1, 2, 3, 4]&lt;/code&gt;. If it is 3, the object represents an array &lt;code&gt;[1, 2, 3]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;They. Are. Not. Equal.&lt;/p&gt;&#xA;&lt;p&gt;In order to be able to consider two objects the same, the expected behavior should be the same &lt;em&gt;for all defined operations&lt;/em&gt;. Let's again consider the &lt;code&gt;[1, 2, 3, 4]&lt;/code&gt; and &lt;code&gt;[1, 2, 3]&lt;/code&gt; case. Accessing the indices 0 to 2 is not the only operations allowed on it.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The most obvious one is requesting the length. The former will return 4 while the latter will return 3.&lt;/li&gt;&#xA;&lt;li&gt;If an out-of-bounds index is requested, it should result in an error. But accessing index 3 of &lt;code&gt;[1, 2, 3, 4]&lt;/code&gt; does not error.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Longer array behave like small ones as long as you don't access its length or out-of-range values&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;To achieve this effect, you should re-assign the length yourself (or equivalent in your language of choice). &lt;code&gt;[1, 2, 3, 4]&lt;/code&gt; resized into length 3 &lt;em&gt;is&lt;/em&gt; identical to &lt;code&gt;[1, 2, 3]&lt;/code&gt;, even if the 4 is still in the memory.&lt;/p&gt;&#xA;&lt;p&gt;If you're working in C or a lower-level language, writing &lt;code&gt;n+extra&lt;/code&gt; items into the given buffer and returning &lt;code&gt;n&lt;/code&gt; is a valid method to effectively return an array of length &lt;code&gt;n&lt;/code&gt;. (Remember, a buffer &lt;em&gt;and&lt;/em&gt; length combined defines an array. Also note that something of an array type (e.g. &lt;code&gt;int [3]&lt;/code&gt;) cannot be passed as an argument to or returned from a function.)&lt;/p&gt;&#xA;&lt;h3&gt;Software engineering view&lt;/h3&gt;&#xA;&lt;p&gt;Have you seen &amp;quot;test cases&amp;quot; on many challenges? They define a &lt;em&gt;unit test&lt;/em&gt; which every submission shall pass. Unit tests for arrays (and nested structures) compare the &lt;code&gt;actual&lt;/code&gt; and &lt;code&gt;expected&lt;/code&gt; values via &lt;strong&gt;deep equality&lt;/strong&gt;. Deep equality of two arrays &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; is defined as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;The length of &lt;code&gt;x&lt;/code&gt; is equal to that of &lt;code&gt;y&lt;/code&gt;&lt;/strong&gt;, and&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;x[i] == y[i]&lt;/code&gt; for every valid index &lt;code&gt;i&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If your submission outputs a longer array than requested, it violates the first condition of deep equality, and therefore it fails the unit test. What do you get if a unit test fails? A big red cross, a.k.a. &amp;quot;Sorry, your submission is invalid, and should be deleted.&amp;quot;&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2021-05-03T23:44:18.107" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22247" PostTypeId="2" ParentId="2140" CreationDate="2021-05-04T03:06:32.550" Score="0" Body="&lt;p&gt;Given a subset of {+,*,&amp;lt;,=,E,A,(constant),(variable)}. For most of the subsets, use the symbols to express &lt;a href=&quot;https://en.wikipedia.org/wiki/Riemann_hypothesis&quot; rel=&quot;nofollow noreferrer&quot;&gt;Riemann hypothesis&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Output format flexible. Most subset, and on tie, smallest (code length+sum symbols used) in each language wins. (So there'll also be a winner in Text)&lt;/p&gt;&#xA;&lt;p&gt;You can also choose to focus on sum symbols used, and claim that you answered in Custom, counting like a 0-byte solution.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2021-05-04T11:14:21.810" LastActivityDate="2021-05-04T11:14:21.810" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22249" PostTypeId="2" ParentId="2140" CreationDate="2021-05-04T04:32:00.667" Score="0" Body="&lt;h1&gt;Regex, ASCII-literal&lt;/h1&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Execute the given regex for the given text. The regex is in a special scheme I made.&lt;/p&gt;&#xA;&lt;h2&gt;Motivation&lt;/h2&gt;&#xA;&lt;p&gt;For most regexes the usual languages support, they assign some printable ASCII characters for special instructions. For POSIX as an example, &lt;code&gt;*&lt;/code&gt; is the Kleene star, &lt;code&gt;.&lt;/code&gt; matches an arbitrary character, and &lt;code&gt;(&lt;/code&gt; and &lt;code&gt;)&lt;/code&gt; groups a subexpression. Because of this, If such characters themselves were to be matched, I must escape them by a backslash &lt;code&gt;\&lt;/code&gt;. This may cause the regex seem obfuscated. Not to mention that in most languages, backslashes must be escaped themselves like &lt;code&gt;\\&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;So instead of printable ASCII characters, I chose ASCII control characters to assign some special instructions.&lt;/p&gt;&#xA;&lt;h2&gt;Inputs&lt;/h2&gt;&#xA;&lt;p&gt;Two strings indicating the &lt;strong&gt;regex&lt;/strong&gt; and the &lt;strong&gt;text&lt;/strong&gt;. They are assumed to consist of ASCII characters. Otherwise, the entire challenge falls in &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;A list of pairs of integers. Each pair indicates the starting position and the ending position of each strings matched.&lt;/p&gt;&#xA;&lt;p&gt;Indexing is implementation-defined, but preferred to be zero-indexed.&lt;/p&gt;&#xA;&lt;p&gt;Each pair shall be left-inclusive of its indicated string. The right, however, is implementation-defined whether inclusive or exclusive. (Exclusive is preferred)&lt;/p&gt;&#xA;&lt;h2&gt;Regex&lt;/h2&gt;&#xA;&lt;p&gt;Here, I shall call a unit of regex a &lt;strong&gt;packet&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For all characters within &lt;code&gt;\x20&lt;/code&gt;–&lt;code&gt;\x7E&lt;/code&gt;, it is a minimal packet that matches itself.&lt;/p&gt;&#xA;&lt;p&gt;For control characters (with some exceptions), however, it has a special functionality. It classifies to one of:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A minimal packet.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A &lt;strong&gt;parenthesis&lt;/strong&gt;. A pair of parentheses group packets into one packet.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A &lt;strong&gt;unary operator&lt;/strong&gt;. They accept one packet, and they all are suffixes. They have higher precedence to all binary operators.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A &lt;strong&gt;binary operator&lt;/strong&gt;. They accept two packets, they all are infixes, and they all associate to right.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The regex munches each strings matched. In other words, the matched strings cannot overlap.&lt;/p&gt;&#xA;&lt;p&gt;If an empty string is matched, it shall be ignored. In other words, all matched strings shall be nonempty.&lt;/p&gt;&#xA;&lt;p&gt;The regex is case-sensitive by default.&lt;/p&gt;&#xA;&lt;h2&gt;Text&lt;/h2&gt;&#xA;&lt;p&gt;The &lt;strong&gt;lines&lt;/strong&gt; of the text are delimited by &lt;code&gt;\n&lt;/code&gt;, &lt;code&gt;\f&lt;/code&gt;, &lt;code&gt;\r&lt;/code&gt;, and &lt;code&gt;\v&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;strong&gt;words&lt;/strong&gt; of the text are separated by ASCII whitespaces (&lt;code&gt; &lt;/code&gt; and &lt;code&gt;\t&lt;/code&gt;, in addition to the above).&lt;/p&gt;&#xA;&lt;h2&gt;Control characters&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x00&lt;/code&gt; (&lt;strong&gt;NUL&lt;/strong&gt;; Null) has an implementation-defined functionality. It's because in some languages, strings are null-terminated.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x01&lt;/code&gt; (&lt;strong&gt;SOH&lt;/strong&gt;; Start of Header): Minimal packet. It matches the start of a line.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x02&lt;/code&gt; (&lt;strong&gt;STX&lt;/strong&gt;; Start of Text): Left parenthesis corresponding to ETX.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x03&lt;/code&gt; (&lt;strong&gt;ETX&lt;/strong&gt;; End of Text): Right parenthesis corresponding to STX. Concatenates the packets inside.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x04&lt;/code&gt; (&lt;strong&gt;EOT&lt;/strong&gt;; End of Transmission): Minimal packet. It matches the end of a line.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x05&lt;/code&gt; (&lt;strong&gt;ENQ&lt;/strong&gt;; Enquiry): Left parenthesis corresponding to ACK or NAK.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x06&lt;/code&gt; (&lt;strong&gt;ACK&lt;/strong&gt;; Acknowledgement): Right parenthesis corresponding to ENQ. It serves as an arbitrary-input OR gate. The first alternative that matches shall be matched.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x07&lt;/code&gt; (&lt;strong&gt;BEL&lt;/strong&gt;; Bell): Unary operator. It &amp;quot;inverts&amp;quot; its operand, like this:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If its operand is a minimal packet that matches a single character, it matches a character the packet &lt;strong&gt;doesn't&lt;/strong&gt; match.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It commutes with a unary operator.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It distributes to a binary operator.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It distributes to packets within parentheses.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Otherwise, it has no effect.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x08&lt;/code&gt; (&lt;strong&gt;BS&lt;/strong&gt;; Backspace): Minimal packet. It matches an arbitrary ASCII whitespace.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x09&lt;/code&gt; (&lt;strong&gt;HT&lt;/strong&gt;; Horizontal Tab): Minimal packet. It matches &lt;code&gt;\t&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x0A&lt;/code&gt; (&lt;strong&gt;LF&lt;/strong&gt;; Line Feed): Minimal packet. It matches &lt;code&gt;\n&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x0B&lt;/code&gt; (&lt;strong&gt;VT&lt;/strong&gt;; Vertical Tab): Minimal packet. It matches &lt;code&gt;\v&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x0C&lt;/code&gt; (&lt;strong&gt;FF&lt;/strong&gt;; Form Feed): Minimal packet. It matches &lt;code&gt;\f&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x0D&lt;/code&gt; (&lt;strong&gt;CR&lt;/strong&gt;; Carriage Return): Minimal packet. It matches &lt;code&gt;\r&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x0E&lt;/code&gt; (&lt;strong&gt;SO&lt;/strong&gt;; Shift Out): Minimal packet. It matches an arbitrary lowercase Latin letter.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x0F&lt;/code&gt; (&lt;strong&gt;SI&lt;/strong&gt;; Shift In): Minimal packet. It matches an arbitrary uppercase Latin letter.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x10&lt;/code&gt; (&lt;strong&gt;DLE&lt;/strong&gt;; Data Link Escape): Unary operator. Its operand shall be matched case-insensitive.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x11&lt;/code&gt; (&lt;strong&gt;DC1&lt;/strong&gt;; Device Control One): Unary operator. Its operand shall be matched zero or more times. It is greedy.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x12&lt;/code&gt; (&lt;strong&gt;DC2&lt;/strong&gt;; Device Control Two): Unary operator. Its operand shall be matched one or more times. It is greedy.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x13&lt;/code&gt; (&lt;strong&gt;DC3&lt;/strong&gt;; Device Control Three): Unary operator. Its operand shall be matched two or more times. It is greedy.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x14&lt;/code&gt; (&lt;strong&gt;DC4&lt;/strong&gt;; Device Control Four): Unary operator. Its operand shall be matched zero or one time. It is greedy.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x15&lt;/code&gt; (&lt;strong&gt;NAK&lt;/strong&gt;; Negative Acknowledgement): Right parenthesis corresponding to ENQ. It is equivalent to ACK BEL.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x16&lt;/code&gt; (&lt;strong&gt;SYN&lt;/strong&gt;; Synchronous Idle): Binary operator. If and only if the operands match the same string, it shall match the string. Has higher precedence to CAN, and has lower precedence to EM.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x17&lt;/code&gt; (&lt;strong&gt;ETB&lt;/strong&gt;; End of Transmission Block): Minimal packet. Matches either the start of a word or the end of a word.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x18&lt;/code&gt; (&lt;strong&gt;CAN&lt;/strong&gt;; Cancel): Binary operator. Two-packets version of ENQ-ACK. Has the lowest precedence.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x19&lt;/code&gt; (&lt;strong&gt;EM&lt;/strong&gt;; End of Medium): Binary operator. Treats surrounding characters as escaped, and matches a character within the range they indicate, both inclusive. If the left operand has higher ASCII code point than the right operand, the range wraps around the ASCII codepage.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x1A&lt;/code&gt; (&lt;strong&gt;SUB&lt;/strong&gt;; Substitute): Minimal packet. Matches an arbitrary character.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x1B&lt;/code&gt; (&lt;strong&gt;ESC&lt;/strong&gt;; Escape): As a &lt;strong&gt;prefix&lt;/strong&gt;, this character is used to escape a control character. An escaped ASCII character, including DEL (but not necessarily including NUL), shall match itself.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x1C&lt;/code&gt; (&lt;strong&gt;FS&lt;/strong&gt;; File Separator): Minimal packet. Matches a hexadecimal digit, case-insensitive.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x1D&lt;/code&gt; (&lt;strong&gt;GS&lt;/strong&gt;; Group Separator): Minimal packet. Matches a decimal digit.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x1E&lt;/code&gt; (&lt;strong&gt;RS&lt;/strong&gt;; Record Separator): Minimal packet. Matches an octal digit.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x1F&lt;/code&gt; (&lt;strong&gt;US&lt;/strong&gt;; Unit Separator): Minimal packet. Matches a binary digit.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;\x7F&lt;/code&gt; (&lt;strong&gt;DEL&lt;/strong&gt;; Delete): Unless escaped by ESC, this character shall be skipped. It doesn't even count as a packet.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Errors&lt;/h2&gt;&#xA;&lt;p&gt;Upon the following conditions, it shall fall in an implementation-defined behavior to indicate an error:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Unpaired parenthesis&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Unary/Binary operator without an operand&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;(WIP)&lt;/p&gt;&#xA;&lt;h2&gt;Ungolfed solution&lt;/h2&gt;&#xA;&lt;h3&gt;Haskell&lt;/h3&gt;&#xA;&lt;p&gt;(WIP)&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox questions&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Is this challenge too hard or cumbersome?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Do you have better ideas for the functionalities of control characters?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2021-05-04T21:40:20.053" LastActivityDate="2021-05-04T21:40:20.053" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22250" PostTypeId="2" ParentId="2140" CreationDate="2021-05-04T05:13:47.727" Score="0" Body="&lt;h1&gt;Base Guard (Rewritten)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base-conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; rel=&quot;tag&quot;&gt;base-conversion&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224730/base-ically-god&quot;&gt;Base&lt;/a&gt;: part 1&lt;/p&gt;&#xA;&lt;p&gt;This is part 2, Strongly suggest you go try out the first one if you haven't tried it.&lt;/p&gt;&#xA;&lt;h2&gt;Story&lt;/h2&gt;&#xA;&lt;p&gt;As one of the solvers, You've managed to get to the door of the base heaven. In front of the door stands the base guard @Lyxal, he was angry that you all just left the encoded text on the ground, he deems you to clean(decode) the ground before joining the party, those who are irresponsible gets no ticket!&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;You will get 2 inputs&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;First being &lt;code&gt;X&lt;/code&gt; which is a non-negative integer in base of base list.&lt;/li&gt;&#xA;&lt;li&gt;Second being base which is a list of bases.&lt;/li&gt;&#xA;&lt;li&gt;bases range from 1 ~ 10&lt;/li&gt;&#xA;&lt;li&gt;The base will contain at least one not &lt;code&gt;1&lt;/code&gt; base&lt;/li&gt;&#xA;&lt;li&gt;answer should be in the base 10&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;X, [bases] -&amp;gt; answer&#xA;110 ,[2] -&amp;gt; 6&#xA;30 ,[2,4] -&amp;gt; 6&#xA;2100 ,[2,3] -&amp;gt; 30&#xA;&#xA;You may want to look at part 1 for more detail&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Rule&lt;/h1&gt;&#xA;&lt;p&gt;Basic Rules&lt;/p&gt;&#xA;&lt;p&gt;Satisfy Lyxal with the shortest code, because a long code indicates that you are lazy and not doing your best!&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this count as a dup of part 1?&lt;/li&gt;&#xA;&lt;li&gt;Any extra suggestions?&lt;/li&gt;&#xA;&lt;li&gt;Lyxal are you willing to become the guard? Or anyone else would like to be the guard?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="101762" LastEditorUserId="97857" LastEditDate="2021-05-04T07:20:20.037" LastActivityDate="2021-05-04T07:20:20.037" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="22251" PostTypeId="2" ParentId="2140" CreationDate="2021-05-04T11:04:46.427" Score="-2" Body="&lt;p&gt;Solve any &lt;a href=&quot;https://en.wikipedia.org/wiki/NP-completeness&quot; rel=&quot;nofollow noreferrer&quot;&gt;NPC problem&lt;/a&gt;. Shortest code win.&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox Notes&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Will every submission tend to single NPC problem?&lt;/li&gt;&#xA;&lt;li&gt;How many builtins are known to solve this in Mathematica?&lt;/li&gt;&#xA;&lt;li&gt;Do 0-byte solution exist?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2021-05-07T11:12:50.957" LastActivityDate="2021-05-07T11:12:50.957" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22252" PostTypeId="2" ParentId="2140" CreationDate="2021-05-05T16:21:06.807" Score="4" Body="&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-01-27T15:47:06.113" LastActivityDate="2022-01-27T15:47:06.113" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22253" PostTypeId="5" CreationDate="2021-05-06T01:16:49.570" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; are challenges where the winner is decided by the answer with the highest net score (upvotes minus downvotes). Popularity contests are generally discouraged, due to the subjective nature of voting. Read the &lt;a href=&quot;https://codegolf.stackexchange.com/tags/popularity-contest/info&quot;&gt;popularity contest tag wiki&lt;/a&gt; for more&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Do not post &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; challenges on meta&lt;/strong&gt; - they will be closed as off-topic.&lt;/p&gt;&#xA;&lt;p&gt;This tag should be used on questions specifically about the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;; both the tag itself, the meta tag and the challenge type.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-06T01:16:49.570" LastActivityDate="2021-05-06T01:16:49.570" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22254" PostTypeId="4" CreationDate="2021-05-06T01:16:49.570" Score="0" Body="Questions about the popularity contest challenge type on main. [popularity-contests] are challenges where the winner is decided by the answer with the highest net score (upvotes minus downvotes). Popularity contests are generally discouraged, due to the subjective nature of voting. Do not post popularity contests on meta - they will be closed as off-topic." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-06T01:16:49.570" LastActivityDate="2021-05-06T01:16:49.570" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22255" PostTypeId="5" CreationDate="2021-05-06T01:39:37.300" Score="0" Body="&lt;p&gt;As users increase their reputation, they are given more trust and power in the system, through &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges&quot;&gt;privileges&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This tag should be used on questions that ask about the privilege system, such as:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;/questions/tagged/support&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt; questions about privileges on the site&lt;/p&gt;&#xA;&lt;p&gt;Make sure your question isn't answered by the &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges&quot;&gt;privileges pages&lt;/a&gt;. Click on a specific privilege to learn more about it. Additionally, read through the &lt;a href=&quot;https://meta.stackexchange.com/questions/tagged/privileges+support&quot;&gt;Mother Meta support questions&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt; posts specific to the privileges.&lt;/p&gt;&#xA;&lt;p&gt;Note that unless this is specific to CGCC, these should be posted to &lt;a href=&quot;https://meta.stackexchange.com/&quot;&gt;Mother Meta&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-06T01:39:37.300" LastActivityDate="2021-05-06T01:39:37.300" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22256" PostTypeId="4" CreationDate="2021-05-06T01:39:37.300" Score="0" Body="For questions about the privileges available for users to earn. Privileges are the system used by Stack Exchange to allow for community members to help moderate the site as they gain more reputation" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-06T01:39:37.300" LastActivityDate="2021-05-06T01:39:37.300" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22257" PostTypeId="2" ParentId="2140" CreationDate="2021-05-06T02:02:41.737" Score="1" Body="&lt;h1&gt;Sum multiplication carries&lt;/h1&gt;&#xA;&lt;p&gt;We have already &lt;a href=&quot;https://codegolf.stackexchange.com/q/125823&quot;&gt;counted how many carries are there in a sum&lt;/a&gt;. But what's their sum in a multiplication?&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Carry_(arithmetic)&quot; rel=&quot;nofollow noreferrer&quot;&gt;carry&lt;/a&gt; is a digit that is transferred from one column of digits to another column of more significant digits.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;When multiplying 15 and 3, a carry of 1 happens:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;               1          1&#xA;   15          15         15&#xA;×   3   -&amp;gt;  ×   3  -&amp;gt;  ×   3&#xA;-----       -----      -----&#xA;                5         45&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;When multiplying 123 and 9, two carries of 2 happen:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;               2         22         22&#xA;  123         123        123        123&#xA;×   9   -&amp;gt;  ×   9  -&amp;gt;  ×   9  -&amp;gt;  ×   9&#xA;-----       -----      -----      -----&#xA;                7         07       1107&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;When multiplying 23 and 52, a carry of 1 happens on the tens:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;                                     1           1          1 &#xA;   23          23         23         23          23         23&#xA;×  52   -&amp;gt;  ×  52  -&amp;gt;  ×  52  -&amp;gt;  ×  52   -&amp;gt;  ×  52  -&amp;gt;  ×  52&#xA;-----       -----      -----      -----       -----      -----&#xA;                6         46         46          46       1196&#xA;                                     5         115        &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;When multiplying 67 and 89, a carry of 6 happens on the ones and a carry of 5 on the tens.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;               6          6          5           5          5 &#xA;   67          67         67         67          67         67&#xA;×  89   -&amp;gt;  ×  89  -&amp;gt;  ×  89  -&amp;gt;  ×  89   -&amp;gt;  ×  89  -&amp;gt;  ×  89&#xA;-----       -----      -----      -----       -----      -----&#xA;                3        603        603         603       5963&#xA;                                     6         536        &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;When multiplying 3 and 2, no carry happens, as well as 5 and 2.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Two positive integers.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The sum of all carries that occurs when these two numbers are multiplied in base 10.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;15, 3 -&amp;gt; 1&#xA;123, 9 -&amp;gt; 4&#xA;23, 52 -&amp;gt; 1&#xA;67, 89 -&amp;gt; 11&#xA;3, 2 -&amp;gt; 0&#xA;5, 2 -&amp;gt; 0&#xA;3125, 5 -&amp;gt; 3&#xA;257, 34 -&amp;gt; 7&#xA;21, 10 -&amp;gt; 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Any suggestions? More test cases?&lt;/p&gt;&#xA;" OwnerUserId="91472" LastActivityDate="2021-05-06T02:02:41.737" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22258" PostTypeId="5" CreationDate="2021-05-06T02:42:06.893" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/tools/protected-questions&quot;&gt;Protected questions&lt;/a&gt; are questions that require a minimum of 10 reputation to answer. This ignores the &lt;a href=&quot;https://meta.stackexchange.com/questions/141648/what-is-the-association-bonus-and-how-does-it-work&quot;&gt;association bonus&lt;/a&gt;, so you must have at least 10 reputation earned on CGCC.&lt;/p&gt;&#xA;&lt;p&gt;Questions can be protected in the following ways:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/protect-questions&quot;&gt;Users with 15,000 reputation or more&lt;/a&gt; can protect any question which:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;is at least a day old,&lt;/li&gt;&#xA;&lt;li&gt;has at least 1 answer by a new user, and&lt;/li&gt;&#xA;&lt;li&gt;is not locked&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The question has &lt;a href=&quot;https://meta.stackexchange.com/a/89971/355458&quot;&gt;3 deleted answers by new users&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;The question receives multiple answers by new users within a short amount of time&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Additionally, diamond moderators and 15k+ users can unprotect any protected question at will.&lt;/p&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10419/when-should-challenges-be-protected&quot;&gt;site policy&lt;/a&gt; on when to protect questions.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-06T02:42:06.893" LastActivityDate="2021-05-06T02:42:06.893" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22259" PostTypeId="4" CreationDate="2021-05-06T02:42:06.893" Score="0" Body="For questions about protected questions. Protected questions are only able to be answered by users who have earned at least 10 reputation on the site" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-06T02:42:06.893" LastActivityDate="2021-05-06T02:42:06.893" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22260" PostTypeId="5" CreationDate="2021-05-06T03:59:12.003" Score="0" Body="&lt;p&gt;The Periodic Premier Programming Puzzle Pushes were 2 attempts in 2011 to increase activity on the site.:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/298/announcing-the-codegolf-se-first-periodic-premier-programming-puzzle-push&quot;&gt;Announcing the CodeGolf.SE First Periodic Premier Programming Puzzle Push&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/424/announcing-the-codegolf-se-second-periodic-premier-programming-puzzle-push&quot;&gt;Announcing the CodeGolf.SE Second Periodic Premier Programming Puzzle Push&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Challenges on main posted as part of these puzzle pushes can be found under the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/1p5&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;1p5&amp;#39;&quot; rel=&quot;tag&quot;&gt;1p5&lt;/a&gt; tag.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;This tag has been retired&lt;/strong&gt; - please do not post new questions with this tag. If you'd like to suggest a new, similar activity, use a different tag to do so.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-06T03:59:12.003" LastActivityDate="2021-05-06T03:59:12.003" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22261" PostTypeId="4" CreationDate="2021-05-06T03:59:12.003" Score="0" Body="For questions about PPCG's 2 &quot;Periodic Premier Programming Puzzle Push&quot;s - an effort in 2011 to increase the site's activity. This tag has been retired since the end of the Second Periodic Premier Programming Puzzle Push - do not use it on new questions" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-06T03:59:12.003" LastActivityDate="2021-05-06T03:59:12.003" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22263" PostTypeId="2" ParentId="2140" CreationDate="2021-05-06T13:31:37.570" Score="0" Body="&lt;h2&gt;Radio station hopping&lt;/h2&gt;&#xA;&lt;p&gt;You are listening to a car radio. You are pressing seek up/down, moving you to the next frequency some radio station broadcasts on, to avoid all this pointless music and listen to all the ads, or vice versa.&#xA;But there is a tendency of these broadcasts to have your radio jump to another frequency, where signal of that radio station is stronger. So, suppose this radio station A broadcasts at 99, 100 and 101 MHz with 100 MHz having the strongest signal at your place. The moment you reach 101 MHz, radio will jump to 100 MHz.&lt;/p&gt;&#xA;&lt;p&gt;Because of that, you can get trapped. Suppose there is one extra radio station B, broadcasting only at 102 MHz. The moment you are stuck at the station A, you can never listen to station B again - if you try going with frequency down, you will hit 99 and jump to 100, if you go up you reach 101 and jump to 100 again... never escaping that trap.&lt;/p&gt;&#xA;&lt;p&gt;But if there is yet another station C at 99.5 and 98.5 MHz with latter being the strongest, you can listen to all 3 radios again - starting from B you get down to A, then down to C, then &lt;em&gt;&lt;strong&gt;pressing down loops you back again to the highest frequency&lt;/strong&gt;&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;So, you start wondering - can I listen to all radio stations at least once if I start at any frequency? And will I be able to endlessly cycle through all of them, or listen to all just once before getting cut off some stations?&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Your task:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Get a list of radio stations, along with a designation of which has the strongest signal, in any reasonable format (1). Return one of three values to distinguish whether you can cycle through all stations indefinitely, you can cycle through all stations once or you cannot reach all stations from any starting point. Again in any reasonable format (2).&lt;/p&gt;&#xA;&lt;p&gt;(1) Test cases have inputs as radio stations separated by semicolon, for each radio station, the strongest broadcast for the station is first, entries separated by comma. You can pick anything else as your input format, along with any reasonable extra information you would like - for example number of radio stations, number of channels each station broadcasts at etc. You can use integers (eg just multiply everything in example by 10).&lt;/p&gt;&#xA;&lt;p&gt;(2) Test cases have output as 1 - cycle all, 2 - cycle once, 3 - cannot reach all stations. You can return anything reasonable to distinguish these three options, as long as you return/print the value. You must return, eg &amp;quot;you can cycle all&amp;quot; crashing or never stopping is NOT allowed.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test cases:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;input: 102; 100, 99, 101&#xA;output: 2&lt;/p&gt;&#xA;&lt;p&gt;input: 102; 100, 99, 101; 98.5, 99.5&#xA;output: 1&lt;/p&gt;&#xA;&lt;p&gt;input: 100, 99, 101; 103, 102, 104&#xA;output: 3&lt;/p&gt;&#xA;&lt;p&gt;input: 100, 99, 101; 103, 102, 104; 101.5, 99.5, 103.5&#xA;output: 1&lt;/p&gt;&#xA;&lt;p&gt;input: 100, 99; 99.5, 100.5; 102, 103; 102.5, 101.5&#xA;output: 3&lt;/p&gt;&#xA;&lt;p&gt;May the shortest code win.&lt;/p&gt;&#xA;&lt;p&gt;Tags: code-golf&lt;br&gt;&#xA;Any suggestions? (and is this a duplicate maybe, I haven't found it but I don't know what exactly to search for here)&lt;/p&gt;&#xA;" OwnerUserId="88993" LastActivityDate="2021-05-06T13:31:37.570" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22264" PostTypeId="5" CreationDate="2021-05-06T15:07:39.813" Score="0" Body="&lt;p&gt;This tag is for questions about using the &lt;a href=&quot;https://docs.microsoft.com/en-us/dotnet/csharp/&quot; rel=&quot;nofollow noreferrer&quot;&gt;C# programming language&lt;/a&gt; in answers on the &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;main site&lt;/a&gt;, such as asking about rules covering situations specific to C#.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Do not post questions asking for help with C# on meta&lt;/strong&gt;, they will be closed as off-topic. Instead, post them on &lt;a href=&quot;https://stackoverflow.com/&quot;&gt;Stack Overflow&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-06T15:07:39.813" LastActivityDate="2021-05-06T15:07:39.813" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22265" PostTypeId="4" CreationDate="2021-05-06T15:07:39.813" Score="0" Body="For questions about the usage of the C# programming language on the main site. Do not post questions asking for help with C# on meta using this tag." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-06T15:07:39.813" LastActivityDate="2021-05-06T15:07:39.813" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22266" PostTypeId="5" CreationDate="2021-05-06T15:17:09.430" Score="0" Body="&lt;p&gt;This tag indicates that the question is about &lt;a href=&quot;https://meta.stackexchange.com/help/reopen-questions&quot;&gt;reopening&lt;/a&gt;. Any user with 3000 or more reputation can &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/close-questions&quot;&gt;vote to reopen&lt;/a&gt; a question. Additionally, &lt;a href=&quot;https://codegolf.stackexchange.com/help/badges?tab=tags&amp;amp;filter=gold&quot;&gt;gold tag badge holders&lt;/a&gt; can reopen questions that were closed as duplicates &lt;a href=&quot;https://meta.stackexchange.com/questions/230865/increase-close-vote-weight-for-gold-tag-badge-holders&quot;&gt;with a single vote&lt;/a&gt;, and the &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=moderators&quot;&gt;diamond moderators&lt;/a&gt; can unilaterally reopen any question. Finally, any user with 15 reputation or more (and less than 3000) can flag a question and nominate it for reopening. This puts it into a review queue where users with the required reputation to make a judgement about whether it should be reopened or not.&lt;/p&gt;&#xA;&lt;p&gt;This tag is also applicable to questions about the &lt;a href=&quot;https://codegolf.stackexchange.com/review/reopen&quot;&gt;Reopen Votes&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/review/reopen&quot;&gt;Meta Reopen Votes&lt;/a&gt; review queues, along with the accompanying &lt;a href=&quot;/questions/tagged/reviewing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;reviewing&amp;#39;&quot; rel=&quot;tag&quot;&gt;reviewing&lt;/a&gt; tag&lt;/p&gt;&#xA;&lt;p&gt;Questions with this tag are typically about the following topics:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Requesting that a specific question be reopened, or asking why a specific question was reopened&lt;/p&gt;&#xA;&lt;p&gt;In this case, the question should have the following tags: &lt;a href=&quot;/questions/tagged/discussion&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/reopening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;reopening&amp;#39;&quot; rel=&quot;tag&quot;&gt;reopening&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/specific-question&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;specific-question&amp;#39;&quot; rel=&quot;tag&quot;&gt;specific-question&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/closed-questions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;closed-questions&amp;#39;&quot; rel=&quot;tag&quot;&gt;closed-questions&lt;/a&gt;. If the specific question is a duplicate, also use the &lt;a href=&quot;/questions/tagged/duplicates&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;duplicates&amp;#39;&quot; rel=&quot;tag&quot;&gt;duplicates&lt;/a&gt; tag&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Discussion about the site policies on reopening challenges.&lt;/p&gt;&#xA;&lt;p&gt;Tag these questions with &lt;a href=&quot;/questions/tagged/discussion&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/reopening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;reopening&amp;#39;&quot; rel=&quot;tag&quot;&gt;reopening&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/policy&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;policy&amp;#39;&quot; rel=&quot;tag&quot;&gt;policy&lt;/a&gt;, along with any other relevant tags&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Support about how to use the voting to reopen tools. Before asking your question, be sure to read through the &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/close-questions&quot;&gt;basic information on reopening&lt;/a&gt;, as well as &lt;a href=&quot;https://meta.stackexchange.com/q/36415/355458&quot;&gt;How do you reopen a closed question?&lt;/a&gt; on Mother Meta&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-06T15:17:09.430" LastActivityDate="2021-05-06T15:17:09.430" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22267" PostTypeId="4" CreationDate="2021-05-06T15:17:09.430" Score="0" Body="For questions about reopening closed challenges. This includes questions about why a specific question was reopened, how to get a specific closed question reopened, general policies on reopening and more" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-06T15:17:09.430" LastActivityDate="2021-05-06T15:17:09.430" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22268" PostTypeId="2" ParentId="2140" CreationDate="2021-05-06T21:31:52.633" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/225468/cgcc-sings-a-song-together&quot;&gt;CGCC sings a song together&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-12T00:45:36.133" LastActivityDate="2021-05-12T00:45:36.133" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22269" PostTypeId="2" ParentId="7804" CreationDate="2021-05-06T21:47:30.083" Score="1" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/search?tab=votes&amp;amp;q=inquestion%3A2140%20user%3A20260&quot;&gt;xnor's hoard&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;I have a bunch of old Sandbox posts that I don't feel like developing, some of which have a number of upvotes. Feel free to edit and post them. I just ask that you ping me before you post in case I have suggestions.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2021-05-06T21:47:30.083" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22270" PostTypeId="2" ParentId="22230" CreationDate="2021-05-07T03:18:53.740" Score="0" Body="&lt;h1&gt;As long as a bot follow/fulfill the rule/tasks, it’s valid&lt;/h1&gt;&#xA;&lt;p&gt;I agree that changing rule late isn’t the best solution for edgy bot like rude random, &lt;strong&gt;instead&lt;/strong&gt;, all restriction should be clear at the beginning.&lt;/p&gt;&#xA;&lt;h1&gt;Option: Let randomness come in&lt;/h1&gt;&#xA;&lt;p&gt;I don’t fully agree with banning extreme bots, just like normal coding challenges, there is always edge case(game) that you code should still suitable for.&lt;/p&gt;&#xA;&lt;p&gt;For example, there could possibly have a bot that get high score for both when Rude goes 1 and when Rude goes 100, just like a code that suits large test and empty data. There is &lt;em&gt;always&lt;/em&gt; randomness in most of Koth, but the interesting part is &lt;em&gt;how&lt;/em&gt; to solve those inconsistent.&lt;/p&gt;&#xA;&lt;p&gt;In the end, there is half of games with 1, other half 100. Then there is no favor to any bots, so the bot which loss less on both case wins, suits Koth.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Thi is only my option, the final choice is up to you&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="101762" LastActivityDate="2021-05-07T03:18:53.740" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22273" PostTypeId="1" CreationDate="2021-05-07T20:51:04.770" Score="4" ViewCount="108" Body="&lt;p&gt;I've cooked up a few &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenges, mostly in the sandbox, and a few of them are asymmetric in nature.&lt;/p&gt;&#xA;&lt;p&gt;They're not really &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; because it's not really about cracking a code, nor is it a meta-challenge that you might expect from the more common idea of Cops and Robbers (normally, these target a specific submission and crack it by a certain deadline). The roles in this kind of KotH are also distinctly different and require completely different strategies and code.&lt;/p&gt;&#xA;&lt;p&gt;There are currently only &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers+king-of-the-hill&quot;&gt;2 challenges currently tagged as both&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;. But there are also a couple of other challenges in the same vein with asymmetric roles:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/220510/45613&quot;&gt;Liars and Guessers&lt;/a&gt; - Liars and Guessers have different goals and play a different role in the game&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/48353/45613&quot;&gt;Red vs. Blue&lt;/a&gt; - Each team has slightly different movement options.&lt;/li&gt;&#xA;&lt;li&gt;Sandbox: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/19194/45613&quot;&gt;The Ever-Changing Labyrinth&lt;/a&gt; - Maze masters and Adventurers have completely different roles&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Options&lt;/h1&gt;&#xA;&lt;p&gt;I see a few courses of action here:&lt;/p&gt;&#xA;&lt;h2&gt;A new tag: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/asymmetric&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;asymmetric&amp;#39;&quot; rel=&quot;tag&quot;&gt;asymmetric&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Represents a distinctly different idea from what CnR challenges most frequently represent, which usually require one role to go head-to-head with a specific submission from the other role&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Cons:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Creates a new tag that may potentially be confused with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;There are not very many challenges of this nature&lt;/li&gt;&#xA;&lt;li&gt;Probably only makes sense when paired with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; and might be confusing in other contexts.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Might be remedied by calling it &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/multiple-roles&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;multiple-roles&amp;#39;&quot; rel=&quot;tag&quot;&gt;multiple-roles&lt;/a&gt; instead, but this might be too similar to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Use &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; for this purpose&lt;/h2&gt;&#xA;&lt;p&gt;... And tag all currently untagged challenges accordingly&lt;/p&gt;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Re-uses an existing tag&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Cons:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This would exclude any challenges with cooperative but asymmetric roles, though no challenges of this nature exist, to my knowledge.&lt;/li&gt;&#xA;&lt;li&gt;The culture and typical usage of this tag would create an alternate meaning for this tag that only applies when paired with KotH&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Remove the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; tag from the two challenges also tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;These two tags should be mutually exclusive. Some KotHs simply have multiple roles.&lt;/p&gt;&#xA;&lt;p&gt;Pros:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No new tag&lt;/li&gt;&#xA;&lt;li&gt;No overloading of an existing tag with a strong culture of a specific meaning that isn't compatible in an immediately obvious way.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Cons:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No way to distinguish KotHs with multiple asymmetric roles.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Anyway, discuss&lt;/p&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="68942" LastEditDate="2021-07-12T18:54:53.187" LastActivityDate="2021-07-12T18:54:53.187" Title="Tag Proposal: [asymmetric]" Tags="|discussion|status-completed|tags|king-of-the-hill|cops-and-robbers|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22274" PostTypeId="2" ParentId="2140" CreationDate="2021-05-07T21:27:20.493" Score="2" Body="&lt;h1&gt;Are You My Mother? (very WIP)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;(coincidentally, thought up around mother's day)&lt;/p&gt;&#xA;&lt;p&gt;Oh no! All the newly-hatched ducklings have been mixed together, and they all look the same! The ducklings want to reunite with their own mother. But the mothers are also selfish and want as many ducklings as possible to go home with them. Since all the ducks look the same, the only way to tell who your mother is is by how she acts.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to write two bot algorithms: one for the mother duck and another for the ducklings.&lt;/p&gt;&#xA;&lt;h1&gt;The game&lt;/h1&gt;&#xA;&lt;p&gt;There are 5 ducklings for each mother duck&lt;/p&gt;&#xA;&lt;p&gt;All submissions compete at the same time&lt;/p&gt;&#xA;&lt;h2&gt;Finding your mother&lt;/h2&gt;&#xA;&lt;p&gt;All of the ducklings line up in a 1-dimensional array in the pond, as do the mother ducks. They do not move around.&lt;/p&gt;&#xA;&lt;p&gt;Each turn, each duck (either duckling or mother duck) can do one of the following actions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do nothing&lt;/li&gt;&#xA;&lt;li&gt;Quack&lt;/li&gt;&#xA;&lt;li&gt;Flutter its wings&lt;/li&gt;&#xA;&lt;li&gt;Splash&lt;/li&gt;&#xA;&lt;li&gt;Spin around&lt;/li&gt;&#xA;&lt;li&gt;Shake its head&lt;/li&gt;&#xA;&lt;li&gt;Put its head underwater&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;some other action&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Each duckling will see the actions of each mother duck on each turn&lt;/p&gt;&#xA;&lt;p&gt;After 20 turns, each duckling guesses which half of the mother duck array contains its mother (the upper half will get the mother duck in the middle when there are an odd number of mothers) and the process continues until each duckling has narrowed down to a single mother duck.&lt;/p&gt;&#xA;&lt;h2&gt;Duck(ling) limitations&lt;/h2&gt;&#xA;&lt;p&gt;Ducklings are young and have poor memory. They cannot remember how long they have been lined up and can only remember the last thing each mother duck did when deciding what action to take. The only working memory available to ducklings is a single integer between 0 and 15, inclusive.&lt;/p&gt;&#xA;&lt;p&gt;Mother ducks have a bit more memory and can remember five integers between 0 and 15, inclusive.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Score 1 point for each of your ducklings that went home with its mother. Score 1 point for each duckling (regardless of whose it is) that went home with your mother duck.&lt;/p&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2021-05-07T22:09:31.010" LastActivityDate="2021-05-07T22:09:31.010" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="22275" PostTypeId="2" ParentId="2140" CreationDate="2021-05-07T23:05:03.713" Score="4" Body="&lt;h1&gt;Reveal by Halves (in need of a better name)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/subsequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;subsequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;subsequence&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Inspired by this: &lt;a href=&quot;http://nolandc.com/smalljs/mouse_reveal/&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://nolandc.com/smalljs/mouse_reveal/&lt;/a&gt; &lt;a href=&quot;https://github.com/NolanDC/smalljs/tree/master/mouse_reveal&quot; rel=&quot;nofollow noreferrer&quot;&gt;(source)&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;A valid answer:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Takes a number&#xA;&lt;span class=&quot;math-container&quot;&gt;\$w\$&lt;/span&gt; and (assumed non-negative) integer &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Outputs an integer list with a length of &lt;span class=&quot;math-container&quot;&gt;\$2^w\$&lt;/span&gt;, initially filled with zeroes.&lt;/li&gt;&#xA;&lt;li&gt;For each number &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; from &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$w-1\$&lt;/span&gt; (inclusive), divide the list into sub-lists of size &lt;span class=&quot;math-container&quot;&gt;\$2^n\$&lt;/span&gt;, then increment all of the values in the sub-list that contains the index &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;(with coordinates from left, 0 indexed, but your answer may have change these)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;w=3, x=1&#xA;23110000&#xA;&#xA;w=2, x=2&#xA;0021&#xA;&#xA;w=3, x=5&#xA;00002311&#xA;&#xA;w=4, x=4&#xA;1111432200000000&#xA;&#xA;w=2, x=100&#xA;Do not need to handle (can do anything) because x is out of bounds&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are these tags fitting?&lt;/li&gt;&#xA;&lt;li&gt;Would this be better in one dimension? (like &lt;span class=&quot;math-container&quot;&gt;\$3, 2\$&lt;/span&gt; returns &lt;code&gt;11320000&lt;/code&gt;) &lt;strong&gt;Edit&lt;/strong&gt;: I've changed it to one dimension but I can revert if it makes it less interesting.&lt;/li&gt;&#xA;&lt;li&gt;Should &lt;span class=&quot;math-container&quot;&gt;\$w\$&lt;/span&gt; or &lt;span class=&quot;math-container&quot;&gt;\$2^w\$&lt;/span&gt; be the input?&lt;/li&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="90614" LastEditorUserId="90614" LastEditDate="2021-05-11T15:49:05.087" LastActivityDate="2021-05-11T15:49:05.087" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22276" PostTypeId="1" CreationDate="2021-05-08T04:14:06.007" Score="14" ViewCount="525" Body="&lt;p&gt;In order to grow our community and its chat room, &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;, we decided &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/22119/should-we-have-chat-events-and-if-so-how-should-we-do-them&quot;&gt;here&lt;/a&gt; to start a new &lt;s&gt;monthly&lt;/s&gt; &lt;strong&gt;biweekly&lt;/strong&gt; chat event: Biweekly Mini Golf!&lt;/p&gt;&#xA;&lt;p&gt;During this event, a number of previously drafted &amp;quot;CMCs&amp;quot; (short for Chat Mini Challenge) will be posted, and anyone can reply with their solutions. It will last between one and two hours, and users can register for the event beforehand.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;How will it work?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;For a little while before the event is scheduled, we'll host an unofficial CMC drafting workshop. These CMCs will be short and simple, and the rules for answers won't be quite as strict.&lt;/p&gt;&#xA;&lt;p&gt;At the start of the event, some of these CMCs will be posted, and additional ones can be added during the event. Anyone can post their solutions (and golfs), and ROs will be around to help new users and keep discussion from straying too far off topic.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;When will it take place?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The first Biweekly Mini Golf was on &lt;strong&gt;Tuesday, May 11th&lt;/strong&gt; at 00:00 UTC (20:00 on Monday in EST).&lt;/p&gt;&#xA;&lt;p&gt;&lt;s&gt;We will rotate between Tuesdays and Thursdays, and shift the start time in 8 hour increments. We &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/23757/66833&quot;&gt;will now rotate&lt;/a&gt; between 00:00UTC and 12:00UTC on Wednesdays. &lt;a href=&quot;https://chat.stackexchange.com/rooms/info/240/the-nineteenth-byte?tab=schedule&quot;&gt;Register yourself here&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;See you there!&lt;/strong&gt;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Biweekly Mini Golf has now been &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24821/66833&quot;&gt;discontinued&lt;/a&gt; as of the 15th of June, 2022&lt;/h3&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="66833" LastEditDate="2022-06-18T12:06:46.273" LastActivityDate="2022-06-18T12:06:46.273" Title="Introducing Biweekly Mini Golf!" Tags="|discussion|chat|chat-events|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22280" PostTypeId="5" CreationDate="2021-05-09T23:30:36.787" Score="0" Body="&lt;p&gt;This tag indicates that the question is about reposting existing questions. Note that in the vast majority of cases, reposted questions will be closed as &lt;a href=&quot;https://meta.stackexchange.com/q/10582/355458&quot;&gt;duplicates&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;How to repost a challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Step 1: Identify whether or not it &lt;em&gt;should&lt;/em&gt; be reposted.&lt;/p&gt;&#xA;&lt;p&gt;Challenges should not be reposted if they meet any of the following criteria:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is still accepting answers and is up to date with the site's required levels of clarity&lt;/li&gt;&#xA;&lt;li&gt;Answers from the original challenge could be copied as valid answers to the repost&lt;/li&gt;&#xA;&lt;li&gt;The challenge could be edited to be up to date with the site rules, without significantly invalidating existing answers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Step 2: Ask on meta. Post a question using the &lt;a href=&quot;/questions/tagged/discussion&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/reposting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;reposting&amp;#39;&quot; rel=&quot;tag&quot;&gt;reposting&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/specific-question&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;specific-question&amp;#39;&quot; rel=&quot;tag&quot;&gt;specific-question&lt;/a&gt; tags, asking if the question should be reposted&lt;/p&gt;&#xA;&lt;p&gt;Lay out your arguments for and against this - you should aim to present a strong argument for why the question should be reposted. Questions that simply ask &amp;quot;Can we repost this question?&amp;quot; will be closed as needing details and clarity.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Step 3:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the meta conclusion was that you can or should repost, then go ahead and repost. Vote to close the original challenge as a duplicate (or flag it to be closed as a duplicate if you have less than 3000 reputation). If there were additional requirements (e.g. repost with permission of the OP), make sure you fulfil these before reposting&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, try fixing the problems with the original post that inspired you to repost it in the first palce&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-09T23:30:36.787" LastActivityDate="2021-05-09T23:30:36.787" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22281" PostTypeId="4" CreationDate="2021-05-09T23:30:36.787" Score="0" Body="For questions about reposting existing challenges. Stack Exchange generally prohibits reposting questions, and doing so will generally result in it being closed as a duplicate. See the tag wiki for more information about when reposting is allowed" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-09T23:30:36.787" LastActivityDate="2021-05-09T23:30:36.787" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22282" PostTypeId="1" CreationDate="2021-05-10T02:06:57.693" Score="4" ViewCount="137" Body="&lt;p&gt;Usually fastest code challenges have the challenge author time the results on his/her machine.&lt;/p&gt;&#xA;&lt;p&gt;For old questions for which the challenge author may not be active any more (ex. those by user Lembik), how can the timings be compared fairly? Is there a community accepted reference machine that can be used? (Related: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12707/is-tio-acceptable-for-fastest-code-questions&quot;&gt;Is TIO acceptable for fastest-code questions?&lt;/a&gt;)&lt;/p&gt;&#xA;" OwnerUserId="17360" LastActivityDate="2021-05-10T02:06:57.693" Title="How can fastest code submissions be judged if the challenge author is gone?" Tags="|discussion|" AnswerCount="0" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="22284" PostTypeId="2" ParentId="2140" CreationDate="2021-05-10T05:00:30.690" Score="0" Body="&lt;h1&gt;Determine tournament winners &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Given a table of names and per round scores, arrange the names in descending order of their &lt;a href=&quot;https://en.wikipedia.org/wiki/Sonneborn%E2%80%93Berger_score#Neustadtl_Sonneborn%E2%80%93Berger_score&quot; rel=&quot;nofollow noreferrer&quot;&gt;Neustadtl Sonneborn–Berger score&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;A player's Sonneborn-Berger score(which we will from now on refer to as &amp;quot;tiebreak score&amp;quot;), is the sum of the points they received in each round (&lt;span class=&quot;math-container&quot;&gt;\$x_{i}\$&lt;/span&gt;), multiplied by the points that each their round opponent achieved totally via standard scoring(&lt;span class=&quot;math-container&quot;&gt;\$p_{i}\$&lt;/span&gt;), given round count &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Effectively, each player's score is:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\sum_{i=1}^n p_ix_i.&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to calculate this score for each player and arrange them in increasing order of ordinary score, and then use the tiebreak score to resolve any ties in points.&lt;/p&gt;&#xA;&lt;p&gt;From Wikipedia:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;here is the crosstable of the 1975–80 World Correspondence Chess Championship Final (here cs indicates conventional score, ns Neustadtl score):&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;pre&gt;&lt;code&gt;                  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15  cs   ns&#xA;1.  Sloth         X ½ ½ 1 ½ ½ 1 1 ½  1  ½  1  1  1  1  11   69.5&#xA;2.  Zagorovsky    ½ X 0 ½ 1 ½ 1 1 1  ½  1  1  1  1  1  11   66.75&#xA;3.  Kosenkov      ½ 1 X ½ ½ ½ ½ ½ 1  1  ½  1  1  1  1  10½  67.5&#xA;4.  Khasin        0 ½ ½ X ½ 1 ½ 0 1  1  ½  1  ½  1  ½  8½   54.75&#xA;5.  Kletsel       ½ 0 ½ ½ X ½ ½ ½ ½  0  1  1  ½  1  1  8    47.75&#xA;6.  De Carbonnel  ½ ½ ½ 0 ½ X ½ ½ 0  1  ½  ½  0  1  1  7    45.25&#xA;7.  Arnlind       0 0 ½ ½ ½ ½ X ½ 1  0  ½  ½  1  1  ½  7    42.5&#xA;8.  Dunhaupt      0 0 ½ 1 ½ ½ ½ X 0  ½  1  0  1  ½  1  7    41.5&#xA;9.  Maedler       ½ 0 0 0 ½ 1 0 1 X  1  ½  ½  ½  ½  1  7    41.5&#xA;10. Estrin        0 ½ 0 0 1 0 1 ½ 0  X  1  1  1  0  1  7    40.5&#xA;11. Walther       ½ 0 ½ ½ 0 ½ ½ 0 ½  0  X  0  1  ½  1  5½   33.25&#xA;12. Boey          0 0 0 0 0 ½ ½ 1 ½  0  1  X  ½  ½  1  5½   28.5&#xA;13. Abramov       0 0 0 ½ ½ 1 0 0 ½  0  0  ½  X  ½  1  4½   24.75&#xA;14. Siklos        0 0 0 0 0 0 0 ½ ½  1  ½  ½  ½  X  1  4½   22.75&#xA;15. Nun           0 0 0 ½ 0 0 ½ 0 0  0  0  0  0  0  X  1    7.75&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;As an example, Sloth's score is calculated as: &lt;code&gt;0.5*11 + 0.5*10.5 + 1.0*8.5 + 0.5*8.0 + 0.5*7.0 + 1.0*7.0 + 1.0*7.0 + 0.5*7.0 + 1.0*7.0 + 0.5*5.5 + 1.0*5.5 + 1.0*4.5 + 1.0*4.5 + 1.0*1.0 = 69.5&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="80214" LastActivityDate="2021-05-10T05:00:30.690" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22285" PostTypeId="2" ParentId="2140" CreationDate="2021-05-10T07:46:22.833" Score="0" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;Surprisingly, I don't think there has been a question about Whyte notation before. I suspect the ASCII challenge is a bit too easy, but not sure how many people are interested in a graphical challenge. Thoughts? Comments?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Whyte notation&lt;/h2&gt;&#xA;&lt;p&gt;Write a program which turns a string containing a valid (subset of) Whyte notation into an ASCII/graphical representation.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Whyte_notation&quot; rel=&quot;nofollow noreferrer&quot;&gt;Whyte notation&lt;/a&gt; is a system for succinctly describing the arrangement of wheels on a steam locomotive. For the purpose of this challenge, a valid input consists of:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;one or more wheelsets, joined by a &lt;code&gt;+&lt;/code&gt; symbol&lt;/li&gt;&#xA;&lt;li&gt;where each wheelset is of the form &lt;code&gt;l-d1[-d2...]-t&lt;/code&gt;, where:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;l&lt;/code&gt; is an integer specifying the number of &lt;em&gt;leading wheels&lt;/em&gt; (small wheels at the front of the wheelset that aren't powered, but help keep it on the tracks)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;d1&lt;/code&gt; (and d2 etc) is the number of &lt;em&gt;driving wheels&lt;/em&gt; (large wheels powered by a steam engine) coupled together. If there is more than one number, it means multiple coupled sets of driving wheels. (All the sets are powered by the same engine, but using different sets of cylinders - &lt;a href=&quot;https://en.wikipedia.org/wiki/Divided_drive_(locomotive)&quot; rel=&quot;nofollow noreferrer&quot;&gt;divided drive&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;(Multiple wheelsets means an &lt;a href=&quot;https://en.wikipedia.org/wiki/Articulated_locomotive&quot; rel=&quot;nofollow noreferrer&quot;&gt;articulated locomotive&lt;/a&gt;, that is, two engines powered by the same boiler, but able to rotate independently, which is good for getting powerful locomotives around tight bends).&lt;/p&gt;&#xA;&lt;p&gt;For instance:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;2-4-0&lt;/code&gt; means a locomotive with 2 leading wheels (1 axle), 4 driving wheels (2 axles), and no trailing wheels. We can represent it like this: &lt;code&gt;o-O=O&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;4-8-8-2&lt;/code&gt; means a locomotive with 4 leading wheels, two coupled sets of 8 driving wheels, and 2 trailing wheels. We can represent it like this: &lt;code&gt;o-o-O=O=O=O-O=O=O=O-o&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;2-4-2+2-4-2&lt;/code&gt; means an articulated locomotive with two wheelsets. Each one consists of 2 leading wheels, 4 driving wheels and 2 trailing wheels. We can represent it like this: &lt;code&gt;o-O=O-o:o-O=O-o&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/1z2d5.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/1z2d5.jpg&quot; alt=&quot;A Baldwin 2-4-0 locomotive: 2 leading wheels, 4 driving wheels, no trailing wheels&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Image: A Baldwin 2-4-0 locomotive: 2 leading wheels, 4 driving wheels, no trailing wheels.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;Input is a string (or equivalent) that is valid in this subset of Whyte notation. You may assume:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Leading and trailing wheel counts are even integers in the range 0-6 inclusive.&lt;/li&gt;&#xA;&lt;li&gt;Driving wheel counts are even integers in the range 2-14 inclusive.&lt;/li&gt;&#xA;&lt;li&gt;There are 1-4 coupled sets of driving wheels per wheelset.&lt;/li&gt;&#xA;&lt;li&gt;There are 1-2 wheelsets.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Output (ASCII)&lt;/h2&gt;&#xA;&lt;p&gt;The rules for output are thus:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the train is always facing left, so the leading wheels are at the start of the input and output strings.&lt;/li&gt;&#xA;&lt;li&gt;leading and trailing wheels are represented as one &lt;code&gt;o&lt;/code&gt; per 2 wheels, joined by &lt;code&gt;-&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;each set of driving wheels are represented as one &lt;code&gt;O&lt;/code&gt; per 2 wheels, joined by &lt;code&gt;=&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;sets of driving wheels are joined by &lt;code&gt;-&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;wheelsets are joined by &lt;code&gt;:&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Output (graphical)&lt;/h2&gt;&#xA;&lt;p&gt;Alternatively, you may output a graphical representation of a similar type: a series of circles from left to right. At a minimum:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;all wheel circles must have a dark stroke and light fill, with the stroke no more than 10% the width of the circle&lt;/li&gt;&#xA;&lt;li&gt;the lowest point of all wheel circles must be equal (they all touch the same imaginary track)&lt;/li&gt;&#xA;&lt;li&gt;all wheel circles of a given type must be the same size&lt;/li&gt;&#xA;&lt;li&gt;leading/trailing wheels must have a diameter in the range 20-50% of the diameter of driving wheels&lt;/li&gt;&#xA;&lt;li&gt;coupled sets of driving wheels must be indicated by a horizontal line connecting their centres*.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;*&lt;/code&gt; you may offset this line up to 40% of a driving wheel diameter in any direction to maintain artistic integrity&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;non-coupled wheels must not be connected, and have a space in the range 25-50% of the diameter of a driving wheel between them.&lt;/li&gt;&#xA;&lt;li&gt;for an articulated locomotive, the two wheelsets must be separated by a space of between 100% and 150% of a driving wheel diameter.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;This is code golf, shortest program in bytes wins. Standard rules/loopholes apply. There are two categories: ASCII output and graphical output.&lt;/p&gt;&#xA;" OwnerUserId="30512" LastEditorUserId="30512" LastEditDate="2021-05-10T07:51:37.463" LastActivityDate="2021-05-10T07:51:37.463" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22286" PostTypeId="2" ParentId="2140" CreationDate="2021-05-10T09:59:57.167" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/229994/encode-a-lenguage&quot;&gt;Encode a Lenguage&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2021-06-18T22:22:41.147" LastActivityDate="2021-06-18T22:22:41.147" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22287" PostTypeId="1" CreationDate="2021-05-10T16:42:00.473" Score="8" ViewCount="162" Body="&lt;p&gt;Recently, Stack Exchange decided to &lt;a href=&quot;https://meta.stackexchange.com/questions/364048/we-are-switching-to-system-fonts-on-may-10-2021?cb=1&quot;&gt;switch to system fonts&lt;/a&gt;. For those of you who prefered the old appearance, or would like a different font to appear in code blocks or across the site as a whole, Custom Fonts is a user script I wrote this morning to allow just that.&lt;/p&gt;&#xA;&lt;h3&gt;Features&lt;/h3&gt;&#xA;&lt;p&gt;Custom Fonts allows rules to be set for different sites, which can specify a sans serif, serif, and monospace font. A default can also be specified, allowing you to choose between sans serif and serif for any site.&lt;/p&gt;&#xA;&lt;p&gt;Custom Fonts initially doesn't change anything (unless you download one with a preset), but on lines 26 and 27 are rules that revert all of Stack Exchange to its original fonts (once un-commented). Custom rules can be written, and there is a short reference in the comments under the &lt;code&gt;Rules&lt;/code&gt; object.&lt;/p&gt;&#xA;&lt;h3&gt;Download&lt;/h3&gt;&#xA;&lt;p&gt;Custom Fonts is a user script, meaning that it requires Greasemonkey (Firefox or browsers that support Firefox extensions) or Tampermonkey (Chrome or browsers that support Chrome extensions) to be installed.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://github.com/RedwolfPrograms/userscripts/raw/main/custom-fonts.user.js&quot; rel=&quot;nofollow noreferrer&quot;&gt;Custom Fonts 1.2.4&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://gist.github.com/RedwolfPrograms/35c237ee02015b60d643f61a6f2570a1/raw/411d70cf08dca4c6d21003cad81915ca698bcf78/custom-fonts-1.2.4-arial.user.js&quot; rel=&quot;nofollow noreferrer&quot;&gt;Custom Fonts 1.2.4, with original fonts&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://gist.github.com/RedwolfPrograms/6587a7fb499a43e72d4ec24f4dc42df0/raw/296fcf46451326b13aa26a534fbf2623758c0ff7/custom-fonts-1.2.4-roboto.user.js&quot; rel=&quot;nofollow noreferrer&quot;&gt;Custom Fonts 1.2.4, with Roboto + Roboto Mono&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2021-05-17T17:44:49.183" LastActivityDate="2021-05-17T17:44:49.183" Title="Custom Fonts User Script: Revert or Improve the Font Updates" Tags="|discussion|formatting|userscript|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22290" PostTypeId="2" ParentId="2140" CreationDate="2021-05-10T21:32:12.017" Score="0" Body="&lt;p&gt;Is this code golf too simple? Do I need to add more? Has something similar been done before?&lt;/p&gt;&#xA;&lt;p&gt;The idea of this golf is to convert a string of 3 or more characters to a grammatically correct list.&lt;/p&gt;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;12345&lt;/code&gt; becomes &lt;code&gt;1, 2, 3, 4, and 5.&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;ab5&lt;/code&gt; becomes &lt;code&gt;a, b, and 5.&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;A comma and space is to be inserted between each character, and the last character should be preceded by &amp;quot;and&amp;quot;, and be followed by a period. Your code should be able to handle up to 50 characters in series.&lt;/p&gt;&#xA;" OwnerUserId="98592" LastActivityDate="2021-05-10T21:32:12.017" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22291" PostTypeId="2" ParentId="2140" CreationDate="2021-05-10T23:24:56.327" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/225699/just-enough-ones&quot;&gt;Just Enough Ones&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="82619" LastEditorUserId="82619" LastEditDate="2021-05-15T09:12:10.843" LastActivityDate="2021-05-15T09:12:10.843" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22292" PostTypeId="2" ParentId="2140" CreationDate="2021-05-11T03:10:55.433" Score="1" Body="&lt;h1&gt;A general-purpose macrogenerator&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Briefly: Implement Christopher Strachey's “&lt;a href=&quot;https://academic.oup.com/comjnl/article/8/3/225/336044&quot; rel=&quot;nofollow noreferrer&quot;&gt;General-purpose macrogenerator&lt;/a&gt;”.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;In &lt;a href=&quot;https://www.gnu.org/savannah-checkouts/gnu/m4/manual/m4-1.4.18/m4.html#History&quot; rel=&quot;nofollow noreferrer&quot;&gt;section 1.2 (Historical References) of the manual for GNU M4&lt;/a&gt;, an early macro processor is mentioned:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;An important precursor of &lt;code&gt;m4&lt;/code&gt; was GPM; see C. Strachey, “A general purpose macrogenerator”, &lt;em&gt;Computer Journal&lt;/em&gt; 8, 3 (1965), 225–41, &lt;a href=&quot;http://dx.doi.org/10.1093/comjnl/8.3.225&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://dx.doi.org/10.1093/comjnl/8.3.225&lt;/a&gt;. GPM is also succinctly described in David Gries’s book &lt;a href=&quot;https://archive.org/details/compilerconstruc0000grie&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;Compiler Construction for Digital Computers&lt;/em&gt;&lt;/a&gt;, Wiley (1971). Strachey was a brilliant programmer: GPM fit into 250 machine instructions!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Your goal is to implement GPM, as described below, in the fewest bytes of source code possible.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Overview&lt;/h2&gt;&#xA;&lt;p&gt;The version of GPM in this challenge is very close to that described in the original paper.&#xA;GPM operates quite like &lt;code&gt;m4&lt;/code&gt;, but there are some important differences. I assume that you already have an idea of what a macro is in general.&lt;/p&gt;&#xA;&lt;p&gt;Input to GPM is a sequence of ASCII characters, which should be copied to the output verbatim, except that macros calls are expanded. Macro calls consist of a dollar sign &lt;code&gt;$&lt;/code&gt; followed by a name, followed by a comma &lt;code&gt;,&lt;/code&gt;, followed by a comma-separated list of arguments, followed by a semicolon &lt;code&gt;;&lt;/code&gt;. Here is an example of a macro call:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;$macro,x,yy,z;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In this case the name is &lt;code&gt;macro&lt;/code&gt;, and there are three arguments (&lt;code&gt;x&lt;/code&gt;, &lt;code&gt;yy&lt;/code&gt;, and &lt;code&gt;z&lt;/code&gt;). A macro call with no arguments is the name preceded by &lt;code&gt;$&lt;/code&gt; and followed by &lt;code&gt;;&lt;/code&gt;, as in &lt;code&gt;$noarguments;&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Macro names consist of letters and/or digits. (So &lt;code&gt;1232&lt;/code&gt; is a valid name.) There are no limitations on the length of a name.&lt;/p&gt;&#xA;&lt;p&gt;When a macro call is encountered, it is replaced by the text currently associated with the name. (How text is associated with a name will be explained later; it is done by a macro named &lt;code&gt;DEF&lt;/code&gt;.) This replacement text is also a sequence of characters suitable for input to GPM; in particular, it may itself include other macro calls. However, occurrences of &lt;code&gt;~1&lt;/code&gt;, &lt;code&gt;~2&lt;/code&gt;, &lt;code&gt;~3&lt;/code&gt;, etc. are replaced by the text of the corresponding argument given. The string &lt;code&gt;~0&lt;/code&gt; is replaced by the macro's name.&lt;/p&gt;&#xA;&lt;p&gt;Macro calls can be arguments, as in &lt;code&gt;$macroA,$macroB,$macroC;,$macroD;;;&lt;/code&gt;. Dollar signs and semicolons must be balanced. Even the macro name in a macro call can be a macro call, so that &lt;code&gt;$$x;;&lt;/code&gt; is valid.&lt;/p&gt;&#xA;&lt;p&gt;The name and arguments are evaluated from left to right before replacement begins. It is not a problem if more arguments are given than are used by the replacement text.&lt;/p&gt;&#xA;&lt;p&gt;After the call has been replaced, the resulting text is re-examined, in order to allow further expansion.&lt;/p&gt;&#xA;&lt;p&gt;For example, suppose that &lt;code&gt;macro&lt;/code&gt; names a macro whose replacement text is &lt;code&gt;~1~1~2~2~3~3&lt;/code&gt;. Then the call given previously, namely &lt;code&gt;$macro,x,yy,z;&lt;/code&gt;, would be replaced by &lt;code&gt;xxyyyyzz&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Outside of a replacement text, the meaning of &lt;code&gt;~&lt;/code&gt; followed by a digit is undefined. Your program need support only nine arguments, numbered &lt;code&gt;~1&lt;/code&gt; to &lt;code&gt;~9&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The usual treatment of a string of characters can be prevented by using the “quotes” &lt;code&gt;&amp;lt;&lt;/code&gt; and &lt;code&gt;&amp;gt;&lt;/code&gt;: Characters between &lt;code&gt;&amp;lt;&lt;/code&gt; and &lt;code&gt;&amp;gt;&lt;/code&gt; are not examined for macro calls. The evaluation of a quoted string is the string between the quotes but without the quotes. Quotes can nest.&lt;/p&gt;&#xA;&lt;p&gt;Quoted text need not be valid input. Thus &lt;code&gt;&amp;lt;$&amp;gt;&lt;/code&gt; and &lt;code&gt;&amp;lt;;&amp;gt;&lt;/code&gt; are OK. It is not possible to quote a quoting character: &lt;code&gt;&amp;lt;&amp;lt;&amp;gt;&lt;/code&gt; and &lt;code&gt;&amp;lt;&amp;gt;&amp;gt;&lt;/code&gt; are invalid. However, &lt;code&gt;&amp;lt;&amp;lt;&amp;gt;&amp;lt;&amp;gt;&amp;gt;&lt;/code&gt; is fine; it evaluates to &lt;code&gt;&amp;lt;&amp;gt;&amp;lt;&amp;gt;&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Here are some examples, mostly taken from Strachey's paper. Assume that the following definitions are active:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Name&lt;/th&gt;&#xA;&lt;th&gt;Replacement text&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;A&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;A~1A&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;B&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;B$A,X~1X;B&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;APA&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;P~1~1P&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;Then we will have&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Input&lt;/th&gt;&#xA;&lt;th&gt;output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;$A,C;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;ACA&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;$A,ACA;&lt;/code&gt; or &lt;code&gt;$A,$A,C;;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;AACAA&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;$A,XDX;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;AXDXA&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;$B,D;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;BAXDXAB&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;$A,P;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;APA&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;$$A,P;,Y;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;PYYP&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;Q&amp;lt;$A,C;&amp;gt;R&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;Q$A,C;R&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;$A,&amp;lt;$A,X;&amp;gt;;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;A$A,X;A&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;Q&amp;lt;$&amp;gt;R&amp;lt;;&amp;gt;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;Q$R;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;Q&amp;lt;&amp;lt;$A,C;&amp;gt;&amp;gt;R&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;Q&amp;lt;$A,C;&amp;gt;R&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;hr /&gt;&#xA;&lt;h2&gt;Macro definitions&lt;/h2&gt;&#xA;&lt;p&gt;GPM maintains an environment of macro definitions, which is an ordered list of pairings of names and replacement texts. Entries are added and removed in a last-in-first-out manner. When it is time to expand a macro, the name is searched for in the environment, beginning with the most-recently-added definition and moving backwards. The first matching definition is the one used.&lt;/p&gt;&#xA;&lt;p&gt;After an expansion has finished, the environment returns to the state it was in before the expansion begun. Thus any macros defined in the process are forgotten.&lt;/p&gt;&#xA;&lt;p&gt;The built-in macro &lt;code&gt;DEF&lt;/code&gt; can be used to modify the environment. It takes two arguments; the first is the name to define, and the second is the definition. The &lt;code&gt;DEF&lt;/code&gt; macro is treated just as any macro is, except that the first argument, the name, is not evaluated. The effect of &lt;code&gt;DEF&lt;/code&gt; is always to add a new definition to the environment, rather than to change an existing one.&lt;/p&gt;&#xA;&lt;p&gt;Here are some definitions for simple arithmetic:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;$DEF,Suc,&amp;lt;$1,2,3,4,5,6,7,8,9,10,$DEF,1,&amp;lt;~&amp;gt;~1;;&amp;gt;;&#xA;$DEF,Successor,&amp;lt;$~2,$DEF,~2,~1&amp;lt;,$Suc,&amp;gt;~2&amp;lt;;&amp;gt;;&#xA;                    $DEF,9,&amp;lt;$Suc,&amp;gt;~1&amp;lt;;,0&amp;gt;;;&amp;gt;;&#xA;$DEF,Sum,&amp;lt;$S,~1,~2,0,$DEF,S,&#xA;     &amp;lt;$~3,$DEF,~3,&amp;lt;$S,&amp;gt;$Successor,~1,~2;&#xA;                                  &amp;lt;,&amp;gt;$Suc,~3;&amp;lt;;&amp;gt;;&#xA;          $DEF,&amp;gt;~3&amp;lt;,~1&amp;lt;,&amp;gt;~2;;&amp;gt;;;&amp;gt;;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The output of &lt;code&gt;$Sum,3,4,2;&lt;/code&gt; is the sum of &lt;span class=&quot;math-container&quot;&gt;\$34\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$2\$&lt;/span&gt;, expressed as &lt;code&gt;3,6&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Another basic macro, &lt;code&gt;VAL&lt;/code&gt;, takes a name (which is not evaluated) as an argument and returns its unevaluated definition. Thus after defining &lt;code&gt;$DEF,A,A;&lt;/code&gt;, &lt;code&gt;$VAL,A;&lt;/code&gt; gives &lt;code&gt;A&lt;/code&gt; (without evaluating it and getting into an infinite loop).&lt;/p&gt;&#xA;&lt;p&gt;To change a definition, instead of (possibly temporarily) overriding it, the &lt;code&gt;UPDATE&lt;/code&gt; macro is available. It is used like &lt;code&gt;DEF&lt;/code&gt;, but changes the currently active definition of the name and does not add an entry. There must already be a definition before calling &lt;code&gt;UPDATE&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The expansion of &lt;code&gt;DEF&lt;/code&gt; and &lt;code&gt;UPDATE&lt;/code&gt; is empty.&lt;/p&gt;&#xA;&lt;p&gt;No limitations are placed on the number of characters making up a macro's replacement text. In the original program, the size of the new replacement text after an &lt;code&gt;UPDATE&lt;/code&gt; call was restricted to being at most as long as the previous definition. You need not implement this restriction, but you also need not remove it.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Implementation&lt;/h2&gt;&#xA;&lt;p&gt;Your program can get input from a file, from standard input, or from a string. Output can be to a file, to standard output, or to a string.&lt;/p&gt;&#xA;&lt;p&gt;Whitespace (ASCII space, horizontal tab, vertical tab, line feed, carriage return) should be ignored but copied to the output. Thus &lt;code&gt;$         n  a       m e;&lt;/code&gt; is the same as &lt;code&gt;$name&lt;/code&gt;. Strachey's implementation most likely did not differentiate between uppercase and lowercase letters, so you do not have to. The test does not depend on case differences.&lt;/p&gt;&#xA;&lt;p&gt;Strachey's paper includes a detailed discussion of GPL's implementation, which you might find useful/interesting. It is not particularly easy to read. I don't think the 250-instruction machine code program has survived anywhere.&lt;/p&gt;&#xA;&lt;p&gt;User tociyuki on GitHub has implemented the algorithm in Ruby and published it as &lt;a href=&quot;https://gist.github.com/tociyuki/6640b71a37e153b0b04e&quot; rel=&quot;nofollow noreferrer&quot;&gt;a Gist&lt;/a&gt;, although &lt;code&gt;UPDATE&lt;/code&gt; is not supported. I have not tested it.&lt;/p&gt;&#xA;&lt;p&gt;Previously I have remarked that name length and replacement text size are not limited. This was true of Strachey's program but only to a certain extent. He enforced a limit on the total number of characters stored, but the length of any name or text was not fixed. You can do this as well, but your program must support storing at least 10000 characters, as he suggested.&lt;/p&gt;&#xA;&lt;p&gt;Your program should allow at least 100 levels of expansion.&lt;/p&gt;&#xA;&lt;p&gt;Don't bother with handling erroneous input; if given something invalid, your program can do anything.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Test case&lt;/h2&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;$DEF,Suc,&amp;lt;$1,2,3,4,5,6,7,8,9,10,$DEF,1,&amp;lt;~&amp;gt;~1;;&amp;gt;;&#xA;$DEF,Successor,&amp;lt;$~2,$DEF,~2,~1&amp;lt;,$Suc,&amp;gt;~2&amp;lt;;&amp;gt;;&#xA;                    $DEF,9,&amp;lt;$Suc,&amp;gt;~1&amp;lt;;,0&amp;gt;;;&amp;gt;;&#xA;$DEF,Sum,&amp;lt;$S,~1,~2,0,$DEF,S,&#xA;     &amp;lt;$~3,$DEF,~3,&amp;lt;$S,&amp;gt;$Successor,~1,~2;&#xA;                                  &amp;lt;,&amp;gt;$Suc,~3;&amp;lt;;&amp;gt;;&#xA;          $DEF,&amp;gt;~3&amp;lt;,~1&amp;lt;,&amp;gt;~2;;&amp;gt;;;&amp;gt;;&#xA;$DEF,A,&amp;lt;A~1A&amp;gt;; /* First line of output&#xA;$DEF,B,&amp;lt;B$A,X~1X;B&amp;gt;;&#xA;$DEF,APA,&amp;lt;P~1~1P&amp;gt;;&#xA;This should be the second line of output.&#xA;The expansion of Suc is $VAL,Suc;.&#xA;And I wrote that by saying: &amp;lt;The expansion of Suc is $VAL,Suc;&amp;gt;.&#xA;&amp;lt;&amp;lt;&amp;lt;Quote quote quote&amp;gt;&amp;gt;&amp;gt;&#xA;$A,C;&#xA;$A,ACA; = $A,$A,C;;&#xA;$A,XDX;&#xA;$B,D;&#xA;$A,P;&#xA;$$A,P;,Y;&#xA;Q&amp;lt;$A,C;&amp;gt;R&#xA;$A,&amp;lt;$A,X;&amp;gt;;&#xA;Q&amp;lt;$&amp;gt;R&amp;lt;;&amp;gt;&#xA;Q&amp;lt;&amp;lt;$A,C;&amp;gt;&amp;gt;R&#xA;Q &amp;lt;  &amp;lt;  $  A  ,  C  ;  &amp;gt;  &amp;gt;  R */&#xA;#include &amp;lt;&amp;lt;stdio.h&amp;gt;&amp;gt;&#xA;&#xA;int main(void)&#xA;{&#xA;        puts(&amp;quot;Unaffected by the processor.&amp;quot;);&#xA;        printf(&amp;quot;Here's a sum: 34+2=%d%d.\n&amp;quot;,$Sum,3,4,2;);&#xA;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Expected output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;/* First line of output&#xA;This should be the second line of output.&#xA;The expansion of Suc is $1,2,3,4,5,6,7,8,9,10,$DEF,1,&amp;lt;~&amp;gt;~1;;.&#xA;And I wrote that by saying: The expansion of Suc is $VAL,Suc;.&#xA;&amp;lt;&amp;lt;Quote quote quote&amp;gt;&amp;gt;&#xA;ACA&#xA;AACAA = AACAA&#xA;AXDXA&#xA;BAXDXAB&#xA;APA&#xA;PYYP&#xA;Q$A,C;R&#xA;A$A,X;A&#xA;Q$R;&#xA;Q&amp;lt;$A,C;&amp;gt;R&#xA;Q&amp;lt;$A,C;&amp;gt;R */&#xA;#include &amp;lt;stdio.h&amp;gt;&#xA;&#xA;int main(void)&#xA;{&#xA;        puts(&amp;quot;Unaffected by the processor.&amp;quot;);&#xA;        printf(&amp;quot;Here's a sum: 34+2=%d%d.\n&amp;quot;,3,6);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I believe that the computer for which Strachey's machine-code program was written used forty-eight-bit words (at least &lt;a href=&quot;https://en.wikipedia.org/wiki/Atlas_(computer)#Technical_description&quot; rel=&quot;nofollow noreferrer&quot;&gt;its predecessor did&lt;/a&gt;), so the mark to beat is 1500 bytes.&lt;/p&gt;&#xA;" OwnerUserId="91516" LastActivityDate="2021-05-11T03:10:55.433" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22293" PostTypeId="2" ParentId="5243" CreationDate="2021-05-11T08:52:22.030" Score="1" Body="&lt;h1&gt;200 rep for a 2D Language answer to &lt;a href=&quot;https://codegolf.stackexchange.com/q/121522/80214&quot;&gt;Rotation-safe quine&lt;/a&gt; - &lt;a href=&quot;https://codegolf.stackexchange.com/a/225545/80214&quot;&gt;Claimed by Martin Ender&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;What it says on the tin. You can use any language which uses two-dimensional syntax (Fish, Befunge, Klein, Labyrinth, etc) to create it. It must be a proper, valid quine and the language must have been made before this bounty offer had been posted.&lt;/p&gt;&#xA;&lt;p&gt;The bounty value may increase based on the &amp;quot;impressiveness&amp;quot; of the answer. Explanations are appreciated!&lt;/p&gt;&#xA;" OwnerUserId="80214" LastEditorUserId="80214" LastEditDate="2021-05-13T12:27:33.947" LastActivityDate="2021-05-13T12:27:33.947" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22294" PostTypeId="2" ParentId="2140" CreationDate="2021-05-11T13:18:33.537" Score="0" Body="&lt;h1&gt;How Many Students are in our clubs?&lt;/h1&gt;&#xA;&lt;p&gt;You are a principal in CG High School, and you want your school fliers to include data on how many students are part of any particular set of clubs. You command your secretary to get this data, but they goofed up.&lt;/p&gt;&#xA;&lt;p&gt;Instead of giving you the data on how many students attend (for example) tech club, math club, and spanish club as their only clubs, they included students who attend more clubs, like the arts club! You decide to fix the data yourself.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Your school has n clubs, and for each subset of the n clubs, you have data on how many students attend the clubs in that subset (but potentially more clubs).&lt;/p&gt;&#xA;&lt;p&gt;In this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, you want to output data for each subset which tells you how many students attend exactly those clubs in that subset (and no others).&lt;/p&gt;&#xA;&lt;h1&gt;Input/Output&lt;/h1&gt;&#xA;&lt;p&gt;We represent each subset as an n digit binary number by placing a 1 in the ith position if the ith club is in the subset. For example, the number 3, in binary, is 11, meaning that it represents the subset of the first and second clubs.&lt;/p&gt;&#xA;&lt;p&gt;The input (zero-indexed) list is of length 2^n, with the secretary's data for a particular subset placed at the index representing that subset (as in the previous paragraph).&lt;/p&gt;&#xA;&lt;p&gt;The output is also a list of length 2^n, with the data changed.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;List of length 2^n of non-negative integers&lt;/li&gt;&#xA;&lt;li&gt;(Optional) positive integer n&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;List of length 2^n of non-negative integers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;[41,16,15,14,5,5,6,2] -&amp;gt; [10,8,6,5,3,3,4,2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;More to be added&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&lt;p&gt;I worded this challenge really poorly: any help on explaining this better?&lt;/p&gt;&#xA;" OwnerUserId="82007" LastActivityDate="2021-05-11T13:18:33.537" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22295" PostTypeId="2" ParentId="2140" CreationDate="2021-05-11T14:33:13.967" Score="1" Body="&lt;h1&gt;Complete the Square (UNFINISHED)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polynomials&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polynomials&amp;#39;&quot; rel=&quot;tag&quot;&gt;polynomials&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr/&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Completing_the_square&quot; rel=&quot;nofollow noreferrer&quot;&gt;Completing the square&lt;/a&gt; is (part of) a method for solving quadratic equations, which involves turning something like this:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$ax^2+bx+c=0$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Into something like this:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$a(x-h)^2+k=0$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;I'll show how I was taught to do this. Take the quadratic &lt;span class=&quot;math-container&quot;&gt;\$2x^2-8x+16\$&lt;/span&gt;. First, divide out &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$2(x^2-4x+8)$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Now, the goal is to add a number inside the parentheses which makes the quadratic the square of an &lt;span class=&quot;math-container&quot;&gt;\$(x-n)\$&lt;/span&gt; term. In this case, adding &lt;span class=&quot;math-container&quot;&gt;\$-4\$&lt;/span&gt; would result in &lt;span class=&quot;math-container&quot;&gt;\$x^2-4x+4\$&lt;/span&gt;, the square of &lt;span class=&quot;math-container&quot;&gt;\$(x-4)\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Importantly, you also need to subtract a number (outside the parentheses) in order to keep it the same overall. This results in:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$2(x^2-4x+4)+8$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Which can be simplified to:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$2(x-2)^2+8$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;This can be used to solve quadratics, by rearranging that result a bit:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$\begin{align}2(x-2)^2+8&amp;amp;=0\\2(x-2)^2&amp;amp;=-8\\(x-2)^2&amp;amp;=-4\\x-2&amp;amp;=\pm\sqrt{-4}\\x&amp;amp;=\pm\sqrt{-4}+2\\x&amp;amp;=2\pm2i\end{align}$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Task:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Not sure what a good task would be for this but I already typed it all so I'm not discarding it :p&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-05-11T14:33:13.967" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="22297" PostTypeId="2" ParentId="2140" CreationDate="2021-05-11T16:00:04.763" Score="1" Body="&lt;h1&gt;Randomized Calculator &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Imagine you want to make a random number generator. What if you want it more complex? For this challenge, you should write a program which:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Takes 3 inputs:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An integer &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;An integer &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt;, such that &lt;span class=&quot;math-container&quot;&gt;\$b \ge a\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;A string, &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt;, detailed below, representing one of addition, subtraction, multiplication and division&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Generates two random integers, &lt;span class=&quot;math-container&quot;&gt;\$x, y\$&lt;/span&gt;, such that &lt;span class=&quot;math-container&quot;&gt;\$a \le x\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$b \ge y\$&lt;/span&gt;. The integers should be uniformly random, and chosen independently&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;And, outputs the result of applying &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt; to the mathematical operation detailed by &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The following strings should be the expected ones to be used for &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Addition: &lt;code&gt;a&lt;/code&gt;, &lt;code&gt;+&lt;/code&gt;, &lt;code&gt;plus&lt;/code&gt;, &lt;code&gt;p&lt;/code&gt;, &lt;code&gt;add&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Subtraction: &lt;code&gt;s&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;, &lt;code&gt;subtract&lt;/code&gt;, &lt;code&gt;minus&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Multiplication: &lt;code&gt;m&lt;/code&gt;, &lt;code&gt;*&lt;/code&gt;, &lt;code&gt;x&lt;/code&gt;, &lt;code&gt;times&lt;/code&gt;, &lt;code&gt;t&lt;/code&gt;, &lt;code&gt;multiply&lt;/code&gt;, &lt;code&gt;×&lt;/code&gt;, &lt;code&gt;·&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Division: &lt;code&gt;d&lt;/code&gt;, &lt;code&gt;/&lt;/code&gt;, &lt;code&gt;divide&lt;/code&gt;, &lt;code&gt;:&lt;/code&gt;, &lt;code&gt;÷&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;One example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[4, 17, &amp;quot;times&amp;quot;] -&amp;gt; 35&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;as we generated &lt;span class=&quot;math-container&quot;&gt;\$5\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$7\$&lt;/span&gt; from the range &lt;span class=&quot;math-container&quot;&gt;\$[4, 17]\$&lt;/span&gt;, and multiplied them together.&lt;/p&gt;&#xA;&lt;p&gt;Shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Feedback&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any more tags?&lt;/li&gt;&#xA;&lt;li&gt;Anything unclear?&lt;/li&gt;&#xA;&lt;li&gt;More rules to apply?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="103846" LastEditorUserId="103846" LastEditDate="2021-05-12T18:38:49.873" LastActivityDate="2021-05-12T18:38:49.873" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="22298" PostTypeId="2" ParentId="2140" CreationDate="2021-05-11T21:27:31.113" Score="3" Body="&lt;h1&gt;Distance between vowels&lt;/h1&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Given two vowels represented in single IPA characters, calculate the distance between them.&lt;/p&gt;&#xA;&lt;h2&gt;Vowels&lt;/h2&gt;&#xA;&lt;p&gt;Vowels are characterized by three factors: &lt;strong&gt;Height&lt;/strong&gt;, &lt;strong&gt;backness&lt;/strong&gt;, and &lt;strong&gt;roundedness&lt;/strong&gt;. Here, all vowels have the three characteristics as integers.&lt;/p&gt;&#xA;&lt;h3&gt;Unrounded vowels (z = 0)&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;    x=0       x=1       x=2       x=3       x=4&#xA;y=6 i(U+0069)           ɨ(U+0268)           ɯ(U+026F)&#xA;y=5           ɪ(U+026A)           ʊ(U+028A)&#xA;y=4 e(U+0065)           ɘ(U+0258)           ɤ(U+0264)&#xA;y=3                     ə(U+0259)&#xA;y=2 ɛ(U+025B)           ɜ(U+025C)           ʌ(U+028C) &#xA;y=1 æ(U+00E6)           ɐ(U+0250)&#xA;y=0 a(U+0061)                               ɑ(U+0251)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(I know, Wikipedia states ʊ as rounded, but official IPA doesn't specify the roundedness of ʊ. It will be considered unrounded for this challenge.)&lt;/p&gt;&#xA;&lt;h3&gt;Rounded vowels (z = 1)&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;    x=0       x=1       x=2       x=3       x=4&#xA;y=6 y(U+0079)           ʉ(U+0289)           u(U+0075)&#xA;y=5           ʏ(U+028F)&#xA;y=4 ø(U+00F8)           ɵ(U+0275)           o(U+006F)&#xA;y=3&#xA;y=2 œ(U+0153)           ɞ(U+025E)           ɔ(U+0254) &#xA;y=1&#xA;y=0 ɶ(U+0276)                               ɒ(U+0252)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Metric&lt;/h2&gt;&#xA;&lt;p&gt;Your metric &lt;span class=&quot;math-container&quot;&gt;\$d\$&lt;/span&gt; shall fit the usual definition of metric:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$d(v,w)=0\$&lt;/span&gt; if and only if &lt;span class=&quot;math-container&quot;&gt;\$v=w\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For all &lt;span class=&quot;math-container&quot;&gt;\$v\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$w\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$d(v,w)=d(w,v)\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For all &lt;span class=&quot;math-container&quot;&gt;\$v\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$w\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$d(v,x)≤d(v,w)+d(w,x)\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;As an additional constraint, the norm &lt;span class=&quot;math-container&quot;&gt;\$\Vert\cdot\Vert\$&lt;/span&gt; induced by &lt;span class=&quot;math-container&quot;&gt;\$d\$&lt;/span&gt; shall satisfy:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;For all &lt;span class=&quot;math-container&quot;&gt;\$x≠0\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$z\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$\Vert(0,y,z)\Vert&amp;lt;\Vert(x,y,z)\Vert\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For all &lt;span class=&quot;math-container&quot;&gt;\$x≠0\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$z\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$k&amp;gt;1\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$\Vert(x,y,z)\Vert&amp;lt;\Vert(kx,y,z)\Vert\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Analogous rules for the y-axis and z-axis&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;All of these apply only to the vowels above. All other inputs fall in &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Input format is flexible. It may be two chararacters, or a single string containing two charcters. In any case, every input that doesn't fit in your format falls in &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Output format is also flexible.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2021-05-13T21:15:21.047" LastActivityDate="2021-05-13T21:15:21.047" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22299" PostTypeId="2" ParentId="22161" CreationDate="2021-05-11T23:07:08.727" Score="2" Body="&lt;p&gt;This is done. Reply here if I messed it up.&lt;/p&gt;&#xA;" OwnerUserId="53864" LastActivityDate="2021-05-11T23:07:08.727" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22301" PostTypeId="2" ParentId="2140" CreationDate="2021-05-12T12:51:45.983" Score="5" Body="&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/225601/compute-the-uncomputable-sort-of&quot;&gt;posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2021-05-13T10:43:56.557" LastActivityDate="2021-05-13T10:43:56.557" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="22302" PostTypeId="2" ParentId="22108" CreationDate="2021-05-12T13:05:35.307" Score="3" Body="&lt;p&gt;We have two settings we can change and they relate to your two bullet points. For the second, it seems like that just needs to be disabled.&lt;/p&gt;&#xA;&lt;p&gt;The first one is the closest I can get to your request to protect questions that get a lot of bad answers and few good ones but...&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It won't protect if the answers are coming from &amp;quot;old&amp;quot; users.&lt;/li&gt;&#xA;&lt;li&gt;It doesn't count the total number of answers, so will protect questions that have lots of answers in general.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I'm going to go ahead and change the site setting for the auto protection for answers from new users for now. If y'all tell me to do both, I can do both, too, or we can wait a month and see if changing just one setting is enough.&lt;/p&gt;&#xA;" OwnerUserId="78028" LastActivityDate="2021-05-12T13:05:35.307" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22303" PostTypeId="2" ParentId="2140" CreationDate="2021-05-12T18:26:25.007" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/225604/lets-play-judgement&quot;&gt;Posted here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="82007" LastEditorUserId="82007" LastEditDate="2021-05-13T11:17:38.667" LastActivityDate="2021-05-13T11:17:38.667" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22304" PostTypeId="5" CreationDate="2021-05-13T02:35:21.317" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/whats-reputation&quot;&gt;Reputation&lt;/a&gt; is a rough measure of the value of a user's contributions to this site. Users can earn reputation by:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Having their posts upvoted&lt;/li&gt;&#xA;&lt;li&gt;Having a suggested edit approved&lt;/li&gt;&#xA;&lt;li&gt;Their answer being awarded a &lt;a href=&quot;https://codegolf.stackexchange.com/helpcenter/bounty&quot;&gt;bounty&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Users can lose reputation by:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Having their posts downvoted&lt;/li&gt;&#xA;&lt;li&gt;Downvoting an answer&lt;/li&gt;&#xA;&lt;li&gt;One of their posts receiving 6 spam or offensive flags&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Be sure to read &lt;a href=&quot;https://meta.stackexchange.com/questions/7237/how-does-reputation-work&quot;&gt;How does &amp;quot;Reputation&amp;quot; Work?&lt;/a&gt; for more information.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This tag should be used on questions about this system:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt;: Questions about modifying the reputation system.&lt;/p&gt;&#xA;&lt;p&gt;The reputation system is a central part of the SE network and system. Requests to modify it should make an exceptionally strong case for the modification. These should also be specific to CGCC. If not, &lt;a href=&quot;https://meta.stackexchange.com/&quot;&gt;Mother Meta&lt;/a&gt; is the more appropriate place&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;/questions/tagged/support&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt;: Questions about help around reputation related functionalities.&lt;/p&gt;&#xA;&lt;p&gt;Make sure your question isn't already answered in the &lt;a href=&quot;https://codegolf.stackexchange.com/help/reputation&quot;&gt;help pages&lt;/a&gt; or the &lt;a href=&quot;https://meta.stackexchange.com/a/7238/355458&quot;&gt;definitive guide on reputation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;/questions/tagged/discussion&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/support&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt;: Questions about bug reports and general discussions around the reputation system.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Some related tags that often overlap:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;/questions/tagged/accepted-answer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;accepted-answer&amp;#39;&quot; rel=&quot;tag&quot;&gt;accepted-answer&lt;/a&gt; &lt;a href=&quot;/questions/tagged/bounty&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;bounty&amp;#39;&quot; rel=&quot;tag&quot;&gt;bounty&lt;/a&gt; &lt;a href=&quot;/questions/tagged/privileges&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;privileges&amp;#39;&quot; rel=&quot;tag&quot;&gt;privileges&lt;/a&gt; &lt;a href=&quot;/questions/tagged/voting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;voting&amp;#39;&quot; rel=&quot;tag&quot;&gt;voting&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-13T02:35:21.317" LastActivityDate="2021-05-13T02:35:21.317" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22305" PostTypeId="4" CreationDate="2021-05-13T02:35:21.317" Score="0" Body="Reputation is the system used by Stack Exchange to measure the values of a user's contribution to the site. As users gain more reputation, they are trusted with more privileges that help the users moderate the site." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-13T02:35:21.317" LastActivityDate="2021-05-13T02:35:21.317" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22306" PostTypeId="2" ParentId="2140" CreationDate="2021-05-13T07:05:04.017" Score="0" Body="&lt;h1&gt;[Draft] Write out the 2x2 Hamiltonian Circuit&lt;/h1&gt;&#xA;&lt;p&gt;Unlike the 3x3 Rubik's Cube, which famously has over 43 quintillion possible positions, the 2x2 Pocket Cube &amp;quot;only&amp;quot; has about 3.7 million positions, making a Hamiltonian circuit (a set of moves that visits every position exactly once) perfectly feasible to output or store in its entirety.&lt;/p&gt;&#xA;&lt;p&gt;The full circuit was posted by cuBerBruce in 2011 on the &lt;a href=&quot;https://www.speedsolving.com/threads/hamiltonian-circuit-for-the-entire-2x2x2-cube-group.34318/&quot; rel=&quot;nofollow noreferrer&quot;&gt;SpeedSolving Forums&lt;/a&gt;. You don't need to understand any Rubik's cube notation to complete this challenge. You only need to understand simple string replacements (in the form of a context-free grammar), in that lower case letters are &amp;quot;non-terminal&amp;quot; and can be replaced with longer strings, while upper case letters are &amp;quot;terminal&amp;quot;, in that they are &amp;quot;atomic&amp;quot; and cannot be replaced further. For example, given &lt;code&gt;b=URURUR&lt;/code&gt; and &lt;code&gt;a=bURUR&lt;/code&gt;, you can replace the &lt;code&gt;b&lt;/code&gt; in &lt;code&gt;a&lt;/code&gt; to get &lt;code&gt;a=URURURURUR&lt;/code&gt;, and you cannot expand &lt;code&gt;a&lt;/code&gt; any further.&lt;/p&gt;&#xA;&lt;p&gt;One additional detail: if a letter is followed by an apostrophe, you replace the letter and the apostrophe in the string with the &lt;em&gt;inverse&lt;/em&gt; of the moves. That means the the entire string is reversed and the direction of all moves is reversed: &lt;code&gt;U&lt;/code&gt; becomes &lt;code&gt;V&lt;/code&gt; and vice versa, &lt;code&gt;R&lt;/code&gt; &amp;lt;-&amp;gt; &lt;code&gt;S&lt;/code&gt;, and &lt;code&gt;F&lt;/code&gt; &amp;lt;-&amp;gt; &lt;code&gt;G&lt;/code&gt;. More formally, &lt;code&gt;(ab)'=b'a'&lt;/code&gt;, so for example &lt;code&gt;a'=(bURUR)'=R'U'R'U'b'=SVSV(URURUR)'=SVSVSVSVSV&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Todo: upload full move list and compute hash&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="17360" LastActivityDate="2021-05-13T07:05:04.017" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22307" PostTypeId="2" ParentId="2140" CreationDate="2021-05-13T07:27:48.033" Score="2" Body="&lt;h1&gt;Optimal addition subtraction chain&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/225724/optimal-addition-subtraction-chain&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2021-05-15T17:53:50.150" LastActivityDate="2021-05-15T17:53:50.150" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="22308" PostTypeId="2" ParentId="2447" CreationDate="2021-05-13T10:51:08.027" Score="-7" Body="&lt;h1&gt;Functions may return multiple values, even if the question only asks for one.&lt;/h1&gt;&#xA;&lt;p&gt;As long as one of them is the requested output, the function is considered valid.&lt;/p&gt;&#xA;" OwnerUserId="97916" LastActivityDate="2021-05-13T10:51:08.027" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="22309" PostTypeId="5" CreationDate="2021-05-13T13:34:37.167" Score="0" Body="&lt;p&gt;Once a user has reached 10k reputation, they gain the ability to cast votes to delete questions that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are at least 2 days old&lt;/li&gt;&#xA;&lt;li&gt;Are closed&lt;/li&gt;&#xA;&lt;li&gt;Have a score of -3 or less&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;At 20k reputation, these privileges are expanded to allow users to vote to delete:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any answer with a score or -1 or less&lt;/li&gt;&#xA;&lt;li&gt;Any closed question&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Users begin with 5 votes to delete a day, and gain one more with every 1000 reputation past 10k, to a maximum of 30/day.&lt;/p&gt;&#xA;&lt;p&gt;This tag indicates that a question is specifically about votes to delete. This includes &lt;a href=&quot;/questions/tagged/support&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt; questions about how to use this privilege, as well as &lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt; questions.&lt;/p&gt;&#xA;&lt;p&gt;This tag is typically used alongside the &lt;a href=&quot;/questions/tagged/moderation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;moderation&amp;#39;&quot; rel=&quot;tag&quot;&gt;moderation&lt;/a&gt; tag, and the &lt;a href=&quot;/questions/tagged/closed-questions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;closed-questions&amp;#39;&quot; rel=&quot;tag&quot;&gt;closed-questions&lt;/a&gt; tag&lt;/p&gt;&#xA;" OwnerUserId="100887" LastEditorUserId="68942" LastEditDate="2021-05-13T13:47:43.000" LastActivityDate="2021-05-13T13:47:43.000" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22310" PostTypeId="4" CreationDate="2021-05-13T13:34:37.167" Score="0" Body="Indicates that the question is related to delete votes. Users with 10k+ reputation have the ability to cast deletion votes to remove inappropriate content from the site" OwnerUserId="100887" LastEditorUserId="68942" LastEditDate="2021-05-13T13:47:43.000" LastActivityDate="2021-05-13T13:47:43.000" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22311" PostTypeId="1" AcceptedAnswerId="22312" CreationDate="2021-05-13T16:25:16.300" Score="3" ViewCount="35" Body="&lt;p&gt;We currently have four tags about up/down-voting:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/questions/tagged/down-votes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;down-votes&amp;#39;&quot; rel=&quot;tag&quot;&gt;down-votes&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/questions/tagged/up-votes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;up-votes&amp;#39;&quot; rel=&quot;tag&quot;&gt;up-votes&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/questions/tagged/voting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;voting&amp;#39;&quot; rel=&quot;tag&quot;&gt;voting&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/questions/tagged/votes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;votes&amp;#39;&quot; rel=&quot;tag&quot;&gt;votes&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;There's an argument to be made for keeping &lt;a href=&quot;/questions/tagged/down-votes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;down-votes&amp;#39;&quot; rel=&quot;tag&quot;&gt;down-votes&lt;/a&gt; separate since there's a bit of stuff about downvoting culture specifically which isn't necessarily related to the voting mechanism as a whole. However, browsing through all of its questions, I believe nothing would be lost from merging it into a tag with the rest of these.&lt;/p&gt;&#xA;&lt;p&gt;How many of these should we merge? The existence of &lt;a href=&quot;/questions/tagged/voting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;voting&amp;#39;&quot; rel=&quot;tag&quot;&gt;voting&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/votes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;votes&amp;#39;&quot; rel=&quot;tag&quot;&gt;votes&lt;/a&gt; seems like a mistake, but what about the other one, and which should we merge them into?&lt;/p&gt;&#xA;&lt;p&gt;(Discussion started by caird coinheringaahing in &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/57981189&quot;&gt;chat&lt;/a&gt;)&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-05-14T02:36:22.547" LastActivityDate="2021-05-14T02:36:22.547" Title="Should we merge the voting tags?" Tags="|discussion|status-completed|tags|tag-synonyms|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22312" PostTypeId="2" ParentId="22311" CreationDate="2021-05-13T16:33:05.897" Score="3" Body="&lt;h1&gt;Merge them all into &lt;a href=&quot;/questions/tagged/voting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;voting&amp;#39;&quot; rel=&quot;tag&quot;&gt;voting&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;/questions/tagged/up-votes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;up-votes&amp;#39;&quot; rel=&quot;tag&quot;&gt;up-votes&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/down-votes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;down-votes&amp;#39;&quot; rel=&quot;tag&quot;&gt;down-votes&lt;/a&gt; shouldn't really exist in the first place tbh. They are both fully covered by &lt;a href=&quot;/questions/tagged/voting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;voting&amp;#39;&quot; rel=&quot;tag&quot;&gt;voting&lt;/a&gt;, and a lot of the existing posts with those tags are also tagged with either &lt;a href=&quot;/questions/tagged/votes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;votes&amp;#39;&quot; rel=&quot;tag&quot;&gt;votes&lt;/a&gt;/&lt;a href=&quot;/questions/tagged/voting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;voting&amp;#39;&quot; rel=&quot;tag&quot;&gt;voting&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;As &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/57981189#57981189&quot;&gt;discussed in chat&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/votes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;votes&amp;#39;&quot; rel=&quot;tag&quot;&gt;votes&lt;/a&gt; could also cover &lt;a href=&quot;/questions/tagged/vote-to-close&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;vote-to-close&amp;#39;&quot; rel=&quot;tag&quot;&gt;vote-to-close&lt;/a&gt;/&lt;a href=&quot;/questions/tagged/reopening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;reopening&amp;#39;&quot; rel=&quot;tag&quot;&gt;reopening&lt;/a&gt;/&lt;a href=&quot;/questions/tagged/vote-to-delete&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;vote-to-delete&amp;#39;&quot; rel=&quot;tag&quot;&gt;vote-to-delete&lt;/a&gt; (as well as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8812/why-arent-candidate-vote-totals-accurate&quot;&gt;election votes&lt;/a&gt;). This is far too broad for a single tag, especially when tags currently exist to further specify what the question is about. Since &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/66833/caird-coinheringaahing?tab=activity&amp;amp;sort=revisions&quot;&gt;my recent edits&lt;/a&gt;, all questions under &lt;a href=&quot;/questions/tagged/votes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;votes&amp;#39;&quot; rel=&quot;tag&quot;&gt;votes&lt;/a&gt; discuss up/down votes and the questions that were tagged with &lt;a href=&quot;/questions/tagged/votes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;votes&amp;#39;&quot; rel=&quot;tag&quot;&gt;votes&lt;/a&gt; that didn't have been more appropriately tagged.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, I suggest that all 4 tags be either merged or synonymised under &lt;a href=&quot;/questions/tagged/voting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;voting&amp;#39;&quot; rel=&quot;tag&quot;&gt;voting&lt;/a&gt;, and the tag wiki make note of the related &lt;a href=&quot;/questions/tagged/vote-to-close&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;vote-to-close&amp;#39;&quot; rel=&quot;tag&quot;&gt;vote-to-close&lt;/a&gt;/&lt;a href=&quot;/questions/tagged/reopening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;reopening&amp;#39;&quot; rel=&quot;tag&quot;&gt;reopening&lt;/a&gt;/&lt;a href=&quot;/questions/tagged/vote-to-delete&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;vote-to-delete&amp;#39;&quot; rel=&quot;tag&quot;&gt;vote-to-delete&lt;/a&gt; tags&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-05-13T16:33:05.897" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22313" PostTypeId="5" CreationDate="2021-05-13T16:36:58.397" Score="0" Body="&lt;p&gt;At 3000 reputation, users gain the ability to vote to close a question, which prevents it from being answered until issues are fixed and it is reopened. Challenges are typically closed if:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;they are too similar to an existing challenge or don't add anything new over an existing one&lt;/li&gt;&#xA;&lt;li&gt;they are unclear, underspecified, lack a winning criterion, or are missing other necessary specifications&lt;/li&gt;&#xA;&lt;li&gt;they are blatantly off-topic for Code Golf &amp;amp; Coding Challenges&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This tag is for questions about voting to close, not closed questions in general.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-05-13T16:36:58.397" LastActivityDate="2021-05-13T16:36:58.397" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22314" PostTypeId="4" CreationDate="2021-05-13T16:36:58.397" Score="0" Body="For questions and discussions about close-voting specifically. Not to be confused with [closed-questions]." OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-05-13T16:36:58.397" LastActivityDate="2021-05-13T16:36:58.397" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22315" PostTypeId="2" ParentId="2140" CreationDate="2021-05-13T18:51:34.350" Score="2" Body="&lt;h1&gt;Modify to Increment: Javascript Edition (WIP)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Your task is to insert bytes/characters into the previous answer such that it outputs the next number in sequence, spelled out in English, as its return value. The first answer must output &lt;code&gt;one&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Coding restrictions&lt;/h2&gt;&#xA;&lt;p&gt;Your answer's code must be &lt;em&gt;atomically irreducible&lt;/em&gt;, meaning that if it is possible to remove some subset of lexical tokens from the code and have it produce the same output, then it is an invalid answer. Note that this is a distinctly different concept from removing &lt;em&gt;characters&lt;/em&gt; from the code, as it treats identifiers, string literals, numbers, and operators as indivisible entities. For the purposes of this challenge, a comment is considered a lexical token, so commenting out parts of the previous answer is &lt;em&gt;not allowed&lt;/em&gt; by virtue of this restriction.&lt;/p&gt;&#xA;&lt;p&gt;Some tokens are not subject to this restriction:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The declaration keywords &lt;code&gt;let&lt;/code&gt;, &lt;code&gt;var&lt;/code&gt;, and &lt;code&gt;const&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Semicolons&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Note that removing an operator between two tokens does not merge the tokens together into one token, so removing the &lt;code&gt;+&lt;/code&gt; from &lt;code&gt;1+1&lt;/code&gt; would result in &lt;code&gt;1 1&lt;/code&gt; rather than &lt;code&gt;11&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;SANDBOX NOTE: I'm debating whether this should be tightened up to character-wise irreducibility, but I'm thinking that may be too restrictive and be too difficult to chain. On the other hand, quoting and escaping into an ever-growing &lt;code&gt;.substring&lt;/code&gt; call seems to be a pretty easily-exploited loophole here. Perhaps a simple bandaid solution would be to ban more than 3 consecutive backslashes. Though perhaps this isn't a problem at all because answers will be trying to make it as hard as possible to chain.&lt;/p&gt;&#xA;&lt;h2&gt;Multi-digit spelling&lt;/h2&gt;&#xA;&lt;p&gt;For numbers above 20, the result should be spelled with multiple words. You may use spaces, hyphens, or underscores to separate words and this does not need to be consistent. (e.g. &lt;code&gt;twenty three&lt;/code&gt; can be followed by &lt;code&gt;twenty-four&lt;/code&gt;, and &lt;code&gt;one hundred-thirty four&lt;/code&gt; is valid even though the spelling looks weird)&lt;/p&gt;&#xA;&lt;p&gt;Should this challenge reach more than 100 answers, the expected format should be like &lt;code&gt;one hundred thirty six&lt;/code&gt; rather than &lt;code&gt;a hundred thirty six&lt;/code&gt;. You may optionally insert &lt;code&gt;and&lt;/code&gt; between &lt;code&gt;hundred&lt;/code&gt; and the next word.&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;Answer 1&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;_=&amp;gt;'one'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Answer 2&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;_=&amp;gt;'twone'.substring(0, 3)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Answer 3&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;_=&amp;gt;'threewone'.substring(0, 3+2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Answer 4&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;_=&amp;gt;'thfoureewone'.substring(02, 3+2+1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Answer 5&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;_=&amp;gt;'thfoureewone'.replace('our', 'iv').substring(02, 3+2+1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules and Scoring&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may not comment out part or all of the previous answer.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This includes pseudo-commenting such as enclosing code in strings, using the comma operator to no-op parts of the code, or wrapping blocks in &lt;code&gt;if(0)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The case of the output does not matter (e.g. &lt;code&gt;OnE&lt;/code&gt; is just as valid as &lt;code&gt;oNE&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;No third-party libraries or vendor-specific features are allowed. The only features allowed are those found in the ECMAScript standard library as of May 14, 2021.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The first answer to go 7 days (i.e. 168 hours) without a successor is the winner.&lt;/p&gt;&#xA;" OwnerUserId="45613" LastEditorUserId="45613" LastEditDate="2021-05-14T22:09:45.943" LastActivityDate="2021-05-14T22:09:45.943" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="22316" PostTypeId="5" CreationDate="2021-05-14T02:35:07.547" Score="0" Body="&lt;p&gt;Use the &lt;a href=&quot;/questions/tagged/voting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;voting&amp;#39;&quot; rel=&quot;tag&quot;&gt;voting&lt;/a&gt; tag when asking questions about upvoting (privilege gained at 15 reputation) or downvoting (125 reputation) posts, including questions and answers on both main and meta.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For questions about close votes, use &lt;a href=&quot;/questions/tagged/vote-to-close&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;vote-to-close&amp;#39;&quot; rel=&quot;tag&quot;&gt;vote-to-close&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;For questions about reopen votes (and the process in general), use &lt;a href=&quot;/questions/tagged/reopening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;reopening&amp;#39;&quot; rel=&quot;tag&quot;&gt;reopening&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;For questions about deletion votes, use &lt;a href=&quot;/questions/tagged/vote-to-delete&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;vote-to-delete&amp;#39;&quot; rel=&quot;tag&quot;&gt;vote-to-delete&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;For questions about moderator elections, use &lt;a href=&quot;/questions/tagged/election&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;election&amp;#39;&quot; rel=&quot;tag&quot;&gt;election&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-05-14T02:35:07.547" LastActivityDate="2021-05-14T02:35:07.547" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22317" PostTypeId="4" CreationDate="2021-05-14T02:35:07.547" Score="0" Body="For questions about up/down-voting posts. Not to be confused with close, reopen, deletion, or election votes." OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-05-14T02:35:07.547" LastActivityDate="2021-05-14T02:35:07.547" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22318" PostTypeId="1" CreationDate="2021-05-14T05:34:14.597" Score="18" ViewCount="171" Body="&lt;p&gt;Recently, a couple of invalid answers have been flagged as NAA. This is somewhat of a duplicate of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990&quot;&gt;this answer&lt;/a&gt; on our policy, but I want to mention this because it's important that everyone is using SE's tools correctly (I know, a bit atypical for our site) to make sure things happen as they should and to make our job easier.&lt;/p&gt;&#xA;&lt;p&gt;Here's how you should be using flags:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;if a post is obvious spam, flag it as spam&lt;/li&gt;&#xA;&lt;li&gt;if a post is rude or abusive, flag it as rude or abusive&lt;/li&gt;&#xA;&lt;li&gt;if a post has severe formatting issues or is just unsalvageably low-quality, flag it as very low quality. if you can fix the formatting by editing, edit / suggest an edit instead&lt;/li&gt;&#xA;&lt;li&gt;if a post doesn't attempt to solve the problem at all (including answers that should be comments, irrelevant but not spam/rude remarks, etc), flag it as not an answer&lt;/li&gt;&#xA;&lt;li&gt;if the post is an attempt, is formatted fine, but is invalid because it doesn't properly complete the task, leave a comment letting the answerer know so they can fix it, and if they still haven't fixed it after a day or two, &lt;strong&gt;flag it for moderator intervention&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is important for two reasons. Firstly, NAA flags send the post to the VLQ review queue. If it's an attempt and its formatting isn't terrible, this will likely be reviewed as &amp;quot;Looks OK&amp;quot;, which then dismisses the flag as disputed. Basically, an invalid answer is still an answer, and unless it's blatantly obvious it isn't valid (like if the answer itself says it isn't 100% correct), it'll probably be accepted in the review queues. Normal users can't see that it was sent there by a flag, so they will probably assume it's just a mistake by the system.&lt;/p&gt;&#xA;&lt;p&gt;Secondly, NAA and VLQ flags won't show up to moderators for an hour, to give the flag time to be resolved through review queues by the community. This means that unless one of us is checking the review queues or refreshing the flags page and ignoring this time filter, we won't actually be notified of your flag for a full hour, during which time it could get disputed by a review task completion.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;TL;DR:&lt;/strong&gt; spam, rude, VLQ, and NAA flags are fairly self-explanatory. However, if an answer is a legitimate attempt that doesn't have content issues, but its only issue is it doesn't actually properly solve the challenge, leave a comment and later (48 hours is a good guideline), flag it for moderator intervention. This immediately sends the flag to our inbox and doesn't put it in the review queues.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-05-14T05:34:14.597" Title="Correct flag usage on invalid submissions" Tags="|discussion|policy|answers|flags|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22319" PostTypeId="2" ParentId="2140" CreationDate="2021-05-14T07:52:15.480" Score="2" Body="&lt;h1&gt;Convert version string to pack_format &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/225916/convert-version-string-to-pack-format&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2021-05-18T18:00:46.757" LastActivityDate="2021-05-18T18:00:46.757" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22320" PostTypeId="1" CreationDate="2021-05-14T08:39:55.157" Score="-4" ViewCount="79" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/225547/&quot;&gt;This&lt;/a&gt; is closed as unclear by 5 users given no comment reason. In sandbox there's also no more discussion but IO format.&lt;/p&gt;&#xA;&lt;p&gt;The only possiblility I see is to give way another question. Either because hate me or hate the IO or hate my word, it seems a bad idea. It's even more silly to claim it unclear because it doesn't expilictly say standard loopholes apply.&lt;/p&gt;&#xA;&lt;p&gt;What to do? Or is it only solution to stop asking in sandbox?&lt;/p&gt;&#xA;&lt;p&gt;Standard loopholes apply, including no Internet, so I won't be pushed here and there to &amp;quot;discuss&amp;quot;.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2021-05-14T14:19:51.330" LastActivityDate="2021-05-14T14:19:51.330" Title="Closing as unclear to give way to another post?" Tags="|discussion|close-reasons|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22321" PostTypeId="2" ParentId="22320" CreationDate="2021-05-14T09:46:39.307" Score="8" Body="&lt;p&gt;The close reason is simple. You need details and clarity. There is no reason beyond that to close your question.&lt;/p&gt;&#xA;&lt;p&gt;Here's a few things you can improve, to be specific:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You require a clear description of what an uncomputable number is, and maybe link to it. A single line description is not enough, and having more examples would help with understanding the concept. Having your question be mostly self-contained is important.&lt;/li&gt;&#xA;&lt;li&gt;If you are finding it hard to phrase your question in English, you can link your question in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;. There's many people willing to help with that. People have to take time out of their day to browse the sandbox, and they are bound to miss some questions, so it is almost necessary to ask in chat to get proper feedback.&lt;/li&gt;&#xA;&lt;li&gt;There is no clear description of I/O in the question. In your question, I am not sure if I am required to take input. The example code does not seem to be in a specific language, so it cannot be run in order to figure out the correct output either. Borrowing from questions under the same topic (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; for example) helps a lot, and having working, usable example code generally works in your question's favour.&lt;/li&gt;&#xA;&lt;li&gt;Only one person(Bubbler) has commented on your post, and your post also has 0 votes. Votes imply approval of your post, so checking votes is important, and I recommend having at least 3 people comment and discuss about your question in the sandbox before submitting it to the main site.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="80214" LastActivityDate="2021-05-14T09:46:39.307" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22322" PostTypeId="2" ParentId="2140" CreationDate="2021-05-14T12:27:58.187" Score="3" Body="&lt;h1&gt;Create word lightning &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tree&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tree&amp;#39;&quot; rel=&quot;tag&quot;&gt;tree&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/230010/80214&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="80214" LastEditorUserId="80214" LastEditDate="2021-06-19T04:23:29.343" LastActivityDate="2021-06-19T04:23:29.343" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22323" PostTypeId="2" ParentId="2140" CreationDate="2021-05-14T14:53:01.377" Score="0" Body="&lt;p&gt;You want to have some drinks. Each bottle of drink has a drink itself and &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; other parts (the bottle, etc.) &lt;span class=&quot;math-container&quot;&gt;\$P_1, P_2, ..., P_n\$&lt;/span&gt;.  Thus when buying a bottle of drink, you also get one of each of &lt;span class=&quot;math-container&quot;&gt;\$P_1, P_2, ..., P_n\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You can buy a bottle of drink using 1 dollar, &lt;span class=&quot;math-container&quot;&gt;\$a_1 P_1\$&lt;/span&gt;s, &lt;span class=&quot;math-container&quot;&gt;\$a_2 P_2\$&lt;/span&gt;s, ..., or &lt;span class=&quot;math-container&quot;&gt;\$a_n P_n\$&lt;/span&gt;s.&lt;/p&gt;&#xA;&lt;p&gt;Given the amount of dollars &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; and amount of each part you have &lt;span class=&quot;math-container&quot;&gt;\$c_1, c_2, ..., c_n\$&lt;/span&gt;&lt;sup&gt;[1]&lt;/sup&gt;, how many bottles of drink can you have?&lt;/p&gt;&#xA;&lt;p&gt;You may choose to borrow some parts, aka. having a negative amount of some parts during the buying and drinking, so long as after the whole process you don'thave negative amount. But beware that simply giving each part a value and use the actual worth of the drink itself may fail. See example (*) below.&lt;/p&gt;&#xA;&lt;p&gt;Also, you need to handle Infinity results correctly. I'd accept format &lt;code&gt;Infinity&lt;/code&gt;, &lt;code&gt;∞&lt;/code&gt;, &lt;code&gt;1/0&lt;/code&gt;, for other formats ask here or on meta for a default.&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;n, a, b, c =&amp;gt; resuly&#xA;1, [2], 5, [0] =&amp;gt; 10 // Borrow 10 P1, buy 10BoD, and return&#xA;1, [2], 0, [10] =&amp;gt; 10&#xA;2, [3,4], 1, [0,0] =&amp;gt; 1 // (*)&#xA;2, [3,3], 1, [0,0] =&amp;gt; 3 // (**)&#xA;2, [2,2], 0, [0,0] =&amp;gt; Infinity&#xA;2, [1,2], 0, [0,1] =&amp;gt; Infinity&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(*) If you get 2, you result in 2 &lt;span class=&quot;math-container&quot;&gt;\$P_1\$&lt;/span&gt;s and 2 &lt;span class=&quot;math-container&quot;&gt;\$P_2\$&lt;/span&gt;s, neither of which afford one BoD and therefore you can't pay.&lt;/p&gt;&#xA;&lt;p&gt;However, if you just claim that each &lt;span class=&quot;math-container&quot;&gt;\$P_1\$&lt;/span&gt; worth $0.333 and each &lt;span class=&quot;math-container&quot;&gt;\$P_2\$&lt;/span&gt; worth $0.250, then the drink itself worth $0.417, and you can drink two of them, which is incorrect.&lt;/p&gt;&#xA;&lt;p&gt;(**) Even though you can't get 2 as that gives you 2 &lt;span class=&quot;math-container&quot;&gt;\$P_1\$&lt;/span&gt;s and 2 &lt;span class=&quot;math-container&quot;&gt;\$P_2\$&lt;/span&gt;s, which is not enough to pay; getting 3 gives you 3 &lt;span class=&quot;math-container&quot;&gt;\$P_1\$&lt;/span&gt;s and 3 &lt;span class=&quot;math-container&quot;&gt;\$P_2\$&lt;/span&gt;s, and with the initially $1 you can pay the fee of 3 bottles of drink.&lt;/p&gt;&#xA;&lt;p&gt;One sentence meaning:&lt;/p&gt;&#xA;&lt;p&gt;Given &lt;span class=&quot;math-container&quot;&gt;\$n, \{a_i\}, b, \{c_i\}, i=1..n\$&lt;/span&gt;, find the largest integer &lt;span class=&quot;math-container&quot;&gt;\$r\$&lt;/span&gt;, maybe infinite, such that &lt;span class=&quot;math-container&quot;&gt;\$b+\sum_{i=1}^n\left\lfloor\frac{c_i+r}{a_i}\right\rfloor\ge r\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Input range:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$n&amp;gt;0, a_i&amp;gt;0, b, c_i\ge 0\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Sandbox Notes&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should I take &lt;code&gt;c&lt;/code&gt; input or just assume it's zero at [1]?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2021-05-14T16:18:19.340" LastActivityDate="2021-05-14T16:18:19.340" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22325" PostTypeId="2" ParentId="2140" CreationDate="2021-05-14T22:58:21.907" Score="0" Body="&lt;h1&gt;Implement the ordering monoid&lt;/h1&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Mimic Haskell's &lt;code&gt;(&amp;lt;&amp;gt;) :: Ordering -&amp;gt; Ordering -&amp;gt; Ordering&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;What's the fuss?&lt;/h2&gt;&#xA;&lt;p&gt;This particular monoid is rather useful for comparing sequential containers lexicographically.&lt;/p&gt;&#xA;&lt;h2&gt;Format&lt;/h2&gt;&#xA;&lt;p&gt;Though &lt;code&gt;Ordering&lt;/code&gt; is defined as a three-element enumeration, in this challenge, the format of the 2 inputs and the output is arbitrary.&lt;/p&gt;&#xA;&lt;p&gt;The 2 inputs and the output must be the same domain, and their classification of their values (see below) also must be the same. This restriction is due to that &lt;code&gt;(&amp;lt;&amp;gt;)&lt;/code&gt; is associative.&lt;/p&gt;&#xA;&lt;p&gt;Any input outside of the domain falls in &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/p&gt;&#xA;&lt;h2&gt;Operation&lt;/h2&gt;&#xA;&lt;p&gt;The elements of the domain shall be classified to 3 categories: &lt;strong&gt;Negative&lt;/strong&gt;, &lt;strong&gt;zero&lt;/strong&gt;, and &lt;strong&gt;positive&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If the left operand is negative, output a negative value.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the left operand is zero:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If the right operand is negative, output a negative value.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the right operand is zero, output a zero value.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the right operand is positive, output a positive value.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the left operand is positive, output a positive value.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;A Python 3 implementation of this operation:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;lambda x,y: x if x != 0 else y&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This has integers as the domain, and classifies integers by their signature.&lt;/p&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2021-05-14T23:04:11.090" LastActivityDate="2021-05-14T23:04:11.090" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="22326" PostTypeId="2" ParentId="2140" CreationDate="2021-05-15T05:36:13.690" Score="-1" Body="&lt;h1&gt;Generate a Printing Program In Some Language&lt;/h1&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Given some &lt;em&gt;rules&lt;/em&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1: Hello&#xA;2: World&#xA;4: Code&#xA;7: Golf&#xA;9: Whatever&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your program should output a &lt;em&gt;program&lt;/em&gt; or a &lt;em&gt;function&lt;/em&gt; (the &lt;code&gt;output&lt;/code&gt;), which should be a valid program (or function) in some language. When the output is run, it should&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Ask for some input (&lt;code&gt;i&lt;/code&gt;),&lt;/li&gt;&#xA;&lt;li&gt;Then output the string in the &lt;code&gt;i&lt;/code&gt;th index in &lt;em&gt;rules&lt;/em&gt;. (If there are none, don't output anything - even an error.)&lt;/li&gt;&#xA;&lt;li&gt;Return to step 1.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Example:&lt;/h3&gt;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1: Hello&#xA;5: World&#xA;19: Code&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;One possible output (python):&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;while True:&#xA;  i = int(input())&#xA;  if i == 1:&#xA;    print(&amp;quot;Hello&amp;quot;)&#xA;  if i == 5:&#xA;    print(&amp;quot;World&amp;quot;)&#xA;  if i == 19:&#xA;    print(&amp;quot;Code&amp;quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Your score is the bytes in your answer (not the output).&lt;/p&gt;&#xA;&lt;hr&gt;&#xA;&lt;p&gt;Obviously this question should be clarified.&lt;/p&gt;&#xA;" OwnerUserId="100635" LastEditorUserId="100635" LastEditDate="2021-05-17T14:18:45.033" LastActivityDate="2021-05-17T14:18:45.033" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="22327" PostTypeId="2" ParentId="2140" CreationDate="2021-05-15T06:13:35.900" Score="3" Body="&lt;h1&gt;Memory KoTH&lt;/h1&gt;&#xA;&lt;p&gt;Memory is a game where a bunch of pairs of identical cards are laid upside down, and you try to find pairs while only looking at two at a time.&lt;/p&gt;&#xA;&lt;p&gt;In this KoTH, the way it will work is:&lt;/p&gt;&#xA;&lt;p&gt;The game will be played on a 4096-item array, and the &amp;quot;cards&amp;quot; will be integers 0-2047.&lt;/p&gt;&#xA;&lt;p&gt;Each bot takes its turn in order. It has access to the results of previous moves (Up to its previous turn), but their only storage is a single integer.&lt;/p&gt;&#xA;&lt;h1&gt;Spec&lt;/h1&gt;&#xA;&lt;p&gt;The controller will be written in Javascript.&lt;/p&gt;&#xA;&lt;p&gt;The bot has a move function, which must return two integers: The positions of both its guesses, in the form &lt;code&gt;[g1, g2]&lt;/code&gt;, where both are integers between 0 and 4095, and must not be gone already (see below).&lt;/p&gt;&#xA;&lt;p&gt;The bot has access to:&lt;/p&gt;&#xA;&lt;p&gt;The most recent move of every bot, including itself, in the form of an array of &lt;code&gt;[g1,g2,r1,r2]&lt;/code&gt;, where &lt;code&gt;r1&lt;/code&gt; and &lt;code&gt;r2&lt;/code&gt; are the first and second values revealed. The first item of this will be your bot's most recent guess, and the rest will be the other bots. This will be the global variable &lt;code&gt;prev&lt;/code&gt;, and is readonly.&lt;/p&gt;&#xA;&lt;p&gt;A picture of the entire grid, as a 4096-item array, left to right and top to bottom, where 0 means gone and 1 means still there. This will be the global variable &lt;code&gt;grid&lt;/code&gt;, and is readonly.&lt;/p&gt;&#xA;&lt;p&gt;An array of values that are gone. This will be the global variable &lt;code&gt;gone&lt;/code&gt;, and is readonly.&lt;/p&gt;&#xA;&lt;p&gt;A single &lt;code&gt;ArrayBuffer(50)&lt;/code&gt;, a 50-bit set of raw binary data. See &lt;a href=&quot;https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer&quot; rel=&quot;nofollow noreferrer&quot;&gt;the docs&lt;/a&gt; for help on how to access this. This will be the property &lt;code&gt;this.storage&lt;/code&gt;, and can be used to store data.&lt;/p&gt;&#xA;&lt;p&gt;Writing to globals is banned.&lt;/p&gt;&#xA;&lt;h1&gt;Game&lt;/h1&gt;&#xA;&lt;p&gt;The bots will take their turn in a predetermined randomised order.&lt;/p&gt;&#xA;&lt;p&gt;If a bot's moves are two tiles with the same value, those tiles are removed from the game area, and that bot gets a point.&lt;/p&gt;&#xA;&lt;p&gt;The game ends when all tiles are gone, and the bot with the most points wins. In case of a tie, the bot that is last in the randomised order wins.&lt;/p&gt;&#xA;&lt;p&gt;Bots should be a Javascript object like:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;{&#xA;  name: &amp;quot;A bot&amp;quot;,&#xA;  move(){&#xA;    // insert code here&#xA;  }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;p&gt;Should I change storage limit or grid size?&lt;/p&gt;&#xA;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2021-05-21T04:46:58.557" LastActivityDate="2021-05-21T04:46:58.557" CommentCount="18" ContentLicense="CC BY-SA 4.0" />
  <row Id="22328" PostTypeId="2" ParentId="2140" CreationDate="2021-05-15T17:50:36.147" Score="2" Body="&lt;h1&gt;An approximation for factorials of reals&lt;/h1&gt;&#xA;&lt;p&gt;One approximation for factorial function of reals is the following function:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$ F_0(x) = \lfloor x \rfloor ! { \lceil x \rceil } ^ { x - \lfloor x \rfloor } \$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;The function is less inaccurate for higher values of &lt;span class=&quot;math-container&quot;&gt;\$ x \$&lt;/span&gt;, meaning that you can get better approximations using the following recursive definition:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$ F_{n+1}(x-1)=\frac1x{F_n(x)} \$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$ F_0(\frac72)=3!\times4^{1/2}=12 \$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$ F_1(\frac52)=12/\frac72=\frac{24}7 \$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$ F_2(\frac32)=\frac{24}7/\frac52=\frac{48}{35} \$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$ F_3(\frac12)=\frac{48}{35}/\frac32=\frac{32}{35} \$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$ F_4(-\frac12)=\frac{32}{35}/\frac12=\frac{64}{35} \$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given non-negative integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and real (well, floating-point) &lt;span class=&quot;math-container&quot;&gt;\$x&amp;gt;-n\$&lt;/span&gt;, please calculate &lt;span class=&quot;math-container&quot;&gt;\$ F_n(x) \$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;&lt;p&gt;Bonus brownie points for using your code to approximate &lt;span class=&quot;math-container&quot;&gt;\$ \lim_{n\to\infty}F_n(-\frac12) \$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$ F_1(-\frac12)=2 \$&lt;/span&gt;&lt;br /&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$ F_2(-\frac12)\approx1.89 \$&lt;/span&gt;&lt;br /&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$ F_3(-\frac12)\approx1.85 \$&lt;/span&gt;&lt;br /&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$ F_4(-\frac12)\approx1.83 \$&lt;/span&gt;&lt;br /&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$ F_5(-\frac12)\approx1.82 \$&lt;/span&gt;&lt;br /&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$ F_6(-\frac12)\approx1.81 \$&lt;/span&gt;&lt;br /&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$ F_7(-\frac12)\approx1.80 \$&lt;/span&gt;&lt;br /&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$ F_{10}(-\frac12)\approx1.79 \$&lt;/span&gt;&lt;br /&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$ F_{18}(-\frac12)\approx1.78 \$&lt;/span&gt;&lt;br /&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$ F_{88}(-\frac12)\approx1.77 \$&lt;/span&gt;&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2021-05-15T17:50:36.147" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22329" PostTypeId="2" ParentId="2140" CreationDate="2021-05-15T18:11:56.377" Score="0" Body="&lt;h1&gt;Generate simultaneous equations &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;You've been tasked to write maths exam questions, but you're getting quite bored of coming up with simultaneous equations with integer solutions, so you decide to write a program to generate them. Because this is a school test, the questions mustn't be too easy, but they also mustn't be trivial.&lt;/p&gt;&#xA;&lt;p&gt;The simultaneous equations should be of the form:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$ ax + by = R $$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$ cx + dy = S $$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;where &lt;span class=&quot;math-container&quot;&gt;\$ a \$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$ b \$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$ c \$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$ d \$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$ R \$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$ S \$&lt;/span&gt; are integers. The equations must have exactly one set of solutions, the solutions must both be integers, and &lt;span class=&quot;math-container&quot;&gt;\$ x \$&lt;/span&gt; must not equal &lt;span class=&quot;math-container&quot;&gt;\$ y \$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The random generation method you choose is completely up to you, as long as there are at least 100 distinct equations that could be generated each with a non-zero probability. If the coefficients or equations are swapped, they count as the same (this is to discourage hard-coding of valid equations).&lt;/p&gt;&#xA;&lt;p&gt;You may output in any reasonable format, such as a string &lt;code&gt;&amp;quot;-1x-2y=3;4x+5y=6&amp;quot;&lt;/code&gt; or a list of 6 integers like &lt;code&gt;[-1, -2, 3, 4, 5, 6]&lt;/code&gt;. The format must be consistent for all outputs.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;Valid              x   y&#xA;-------------------------&#xA;-1x-2y=0; 4x+5y=6  4  -2&#xA;&#xA;&#xA;Invalid              Notes&#xA;--------------------------&#xA;-1x-2y=7; 4x+5y=6    Non-integer solutions&#xA;-1.5x-3y=0; 4x+5y=6  Non-integer coefficients&#xA;0x+2y=8; 2x+2y=6     Zero coefficients&#xA;3x+4y=1; 6x+8y=2     Infinitely many solutions&#xA;3x+4y=1; 6x+8y=3     No solutions&#xA;&#xA;TODO: add more examples&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may use any &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447&quot;&gt;reasonable I/O method&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Is this clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Any other feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2021-05-15T18:11:56.377" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22330" PostTypeId="1" CreationDate="2021-05-15T21:55:22.863" Score="7" ViewCount="134" Body="&lt;p&gt;I'm proposing we create a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/minecraft&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;minecraft&amp;#39;&quot; rel=&quot;tag&quot;&gt;minecraft&lt;/a&gt; tag for challenges relating to the game &lt;a href=&quot;https://minecraft.net&quot; rel=&quot;nofollow noreferrer&quot;&gt;Minecraft&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;There are currently 15 applicable questions: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/170296/minecraft-language-files-updater&quot;&gt;this&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/48046/how-do-i-craft-that&quot;&gt;this&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/45488/nether-portal-detection&quot;&gt;this&lt;/a&gt; just to name a few.&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="68942" LastEditDate="2021-06-09T19:38:08.793" LastActivityDate="2021-06-09T19:38:08.793" Title="Tag proposal: [minecraft]" Tags="|feature-request|status-declined|tags|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22332" PostTypeId="1" CreationDate="2021-05-16T00:45:05.950" Score="5" ViewCount="73" Body="&lt;p&gt;Generic Review Tool is a small script designed to detect review tasks on CGCC, and open them in a new tab. It is similar in function to &lt;a href=&quot;https://stackapps.com/questions/6869/review-stalker-reloaded-a-cross-site-dashboard-for-reviews&quot;&gt;Review Stalker Reloaded&lt;/a&gt;, probably the most widely used script for this purpose, but with much simpler functionality. RSR is no longer maintained and has quite a few bugs, which is what prompted this script.&lt;/p&gt;&#xA;&lt;h3&gt;Details&lt;/h3&gt;&#xA;&lt;p&gt;Generic Review Tool is quite simple to use; simply open the &lt;a href=&quot;https://codegolf.stackexchange.com/review&quot;&gt;&lt;code&gt;/review&lt;/code&gt;&lt;/a&gt; page. If your browser supports it, pinning that tab is a good idea since it will just sit in the background. The script will check periodically for new review tasks, and if it finds any they will be opened in new tabs.&lt;/p&gt;&#xA;&lt;p&gt;By default, GRT will check for new tasks every 40 seconds. This is faster than the defaults for other scripts, because GRT has &lt;strong&gt;much lower overhead&lt;/strong&gt;. Rather than reloading the whole page, which may involve downloading CSS and images, considerable DOM manipulation, and running other scripts, GRT just fetches the needed information asynchronously.&lt;/p&gt;&#xA;&lt;p&gt;The time between each check can be customized, by editing the script. Changing the &lt;code&gt;UPDATE_INTERVAL&lt;/code&gt; to the desired number of milliseconds is all that is required. I wouldn't recommend anything lower than 20 seconds (although 10 seconds should &lt;em&gt;technically&lt;/em&gt; work).&lt;/p&gt;&#xA;&lt;h3&gt;Download&lt;/h3&gt;&#xA;&lt;p&gt;Generic Review Tool is a user script, meaning that it requires Greasemonkey (Firefox or browsers that support Firefox extensions) or Tampermonkey (Chrome or browsers that support Chrome extensions) to be installed.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://github.com/RedwolfPrograms/userscripts/raw/main/generic-review-tool.user.js&quot; rel=&quot;nofollow noreferrer&quot;&gt;Generic Review Tool 1.0.1&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="68942" LastEditDate="2021-05-18T21:31:58.470" LastActivityDate="2021-05-18T21:31:58.470" Title="Introducing Generic Review Tool" Tags="|discussion|reviewing|userscript|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22333" PostTypeId="5" CreationDate="2021-05-16T00:49:51.357" Score="0" Body="" OwnerUserId="-1" LastEditorUserId="-1" LastEditDate="2021-05-16T00:49:51.357" LastActivityDate="2021-05-16T00:49:51.357" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22334" PostTypeId="4" CreationDate="2021-05-16T00:49:51.357" Score="0" Body="A userscript is a script installed via Greasemonkey or Tampermonkey, which typically adds custom features or fixes to a certain site." OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2021-05-16T17:52:45.883" LastActivityDate="2021-05-16T17:52:45.883" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22336" PostTypeId="5" CreationDate="2021-05-16T20:49:46.973" Score="0" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/review&quot;&gt;review queues&lt;/a&gt; are 9 different queues on the main and meta site that allow users with more reputation to make sure that posts and actions by newer users are appropriate for the site. The queues are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/review/first-posts&quot;&gt;First Posts&lt;/a&gt;. This queue requires 500 reputation to access. Here, any post by a user who has not posted before is sent for review. One review is enough to send a review task out of this queue.&lt;/p&gt;&#xA;&lt;p&gt;See &lt;a href=&quot;https://codegolf.stackexchange.com/help/review-first-posts&quot;&gt;How do I use the &lt;em&gt;First Posts&lt;/em&gt; queue?&lt;/a&gt; for more&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/review/late-answers&quot;&gt;Late Answers&lt;/a&gt;. The queue requires 500 reputation to access. Answers by users with less than 50 reputation to an old question are sent to this queue. Reviewers should keep an eye out for hidden gems, and spam/low quality posts. A task only requires one user to review it to leave this queue.&lt;/p&gt;&#xA;&lt;p&gt;See &lt;a href=&quot;https://codegolf.stackexchange.com/help/review-late-answers&quot;&gt;How do I use the &lt;em&gt;Late Answers&lt;/em&gt; queue?&lt;/a&gt; for more&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/review/low-quality-posts&quot;&gt;Low Quality Posts&lt;/a&gt;. This queue requires 2000 reputation to access. Here, reviewers are shown short posts, typically by lower reputation users, that the system flags as being &amp;quot;Low Quality&amp;quot; due to their length. Note that, due to the standard answer format on the site, posts here are often just answers that don't have an explanation. It takes two of the same review action to remove a task from this queue&lt;/p&gt;&#xA;&lt;p&gt;See &lt;a href=&quot;https://codegolf.stackexchange.com/help/review-low-quality&quot;&gt;How do I use the &lt;em&gt;Low Quality Posts&lt;/em&gt; queue?&lt;/a&gt; for more&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits&quot;&gt;Suggested Edits&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/review/suggested-edits&quot;&gt;Suggested Edits on Meta&lt;/a&gt;. These queues require 2000 reputation to access. When a user with less than 2000 reputation suggests an edit to a post, that edit is sent into this queue to be reviewed. After 2 accept or reject votes, the edit leaves the queue and is applied if accepted.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, tag wiki edits are sent to this queue. However, these are only shown to users with &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/approve-tag-wiki-edits&quot;&gt;500 reputation&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;See &lt;a href=&quot;https://codegolf.stackexchange.com/help/review-suggested-edits&quot;&gt;How do I use the &lt;em&gt;Suggested Edits&lt;/em&gt; queue?&lt;/a&gt; for more&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/review/close&quot;&gt;Close Votes&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/review/close&quot;&gt;Close Votes on Meta&lt;/a&gt;. These queues require 3000 reputation to access. Here, reviewers are shown questions that either have one or more pending close votes, or have a pending close flag. Users here should decide whether the questions should be closed or not.&lt;/p&gt;&#xA;&lt;p&gt;See &lt;a href=&quot;https://codegolf.stackexchange.com/help/review-close&quot;&gt;How do I use the &lt;em&gt;Close Votes&lt;/em&gt; queue?&lt;/a&gt; for more&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/review/reopen&quot;&gt;Reopen Votes&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/review/reopen&quot;&gt;Reopen Votes on Meta&lt;/a&gt;. These queues require 3000 reputation to access. Any closed question that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Receives one or more reopen vote,&lt;/li&gt;&#xA;&lt;li&gt;Receives a reopen flag, or&lt;/li&gt;&#xA;&lt;li&gt;Is edited within 70 days of being closed&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;is sent to this queue so that other reviewers can determine whether it should be reopened or not.&lt;/p&gt;&#xA;&lt;p&gt;See &lt;a href=&quot;https://codegolf.stackexchange.com/help/review-reopen&quot;&gt;How do I use the &lt;em&gt;Reopen Votes&lt;/em&gt; queue?&lt;/a&gt; for more&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This tag should be used on questions about the review queues, such as &lt;a href=&quot;/questions/tagged/support&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt; with the tools and &lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt; reports.&lt;/p&gt;&#xA;&lt;p&gt;A common &amp;quot;&lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt;&amp;quot; report is that a review task is shown for one user and not a different user. This is &lt;a href=&quot;/questions/tagged/status-bydesign&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-bydesign&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-bydesign&lt;/a&gt;, and bug reports about that will be marked as such.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt; posts are better posted on &lt;a href=&quot;https://meta.stackexchange.com/&quot;&gt;Mother Meta&lt;/a&gt; as the review system is identical on most other sites.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="68942" LastEditDate="2021-05-17T18:02:50.687" LastActivityDate="2021-05-17T18:02:50.687" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22337" PostTypeId="4" CreationDate="2021-05-16T20:49:46.973" Score="0" Body="The system used by Stack Exchange to maintain high quality posts and remove low quality. There are 9 review queues, accessible to any user with at least 500 reputation, each for a different type of post that may need review" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-16T20:49:46.973" LastActivityDate="2021-05-16T20:49:46.973" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22338" PostTypeId="2" ParentId="2140" CreationDate="2021-05-16T21:20:06.847" Score="0" Body="&lt;p&gt;tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Based square-free words&lt;/h1&gt;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Square-free_word&quot; rel=&quot;nofollow noreferrer&quot;&gt;square-free word&lt;/a&gt; is a word that contains no squares, i.e. contains no adjacent repeating subwords. For example, &lt;code&gt;0123&lt;/code&gt; is square-free, while &lt;code&gt;0112&lt;/code&gt; and &lt;code&gt;012123&lt;/code&gt; are not (because &lt;code&gt;11&lt;/code&gt; and &lt;code&gt;1212&lt;/code&gt; are repetitions, respectively).&lt;/p&gt;&#xA;&lt;p&gt;In base-1 there is only one square-free word: &lt;code&gt;0&lt;/code&gt;. In base-2 there are 6 square-free words: &lt;code&gt;0, 1, 01, 10, 010, 101&lt;/code&gt;. In base-3 and up there are infinitely many.&lt;/p&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a base &lt;code&gt;N&lt;/code&gt; and a length &lt;code&gt;L&lt;/code&gt;, output a square-free word of length &lt;code&gt;L&lt;/code&gt; in base &lt;code&gt;N&lt;/code&gt;, or a distinct falsy value (or an error) if no such word exists. Both the base and the length will be positive integers.&lt;br /&gt;&#xA;Alternatively, you may take an alphabet instead of a base as input, e.g. you may take &lt;code&gt;&amp;quot;ABC&amp;quot;&lt;/code&gt; as an input instead of base-3 and give output in that alphabet.&lt;/p&gt;&#xA;&lt;p&gt;Any reasonable input-output, standard restrictions, code golf.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;Other similar outputs are also valid.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Base  Length  Output&#xA;2     1       0&#xA;2     2       01&#xA;2     3       010&#xA;2     4       Error or a distinct falsy value&#xA;3     4       0121&#xA;3     5       01210&#xA;3     50      01210212012101202102012021201021012010212021020120&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="16484" LastActivityDate="2021-05-16T21:20:06.847" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22341" PostTypeId="2" ParentId="2140" CreationDate="2021-05-17T13:27:15.613" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/226078/generate-a-mantiss-head-symmetrical-triangles&quot;&gt;Symmetrical Triangles, posted&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta Questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Dupe?&lt;/li&gt;&#xA;&lt;li&gt;More tags?&lt;/li&gt;&#xA;&lt;li&gt;Should I allow/disallow more output formats?&lt;/li&gt;&#xA;&lt;li&gt;Is &amp;quot;An equilateral triangle array&amp;quot; clear, or is there a way I can clarify it?&lt;/li&gt;&#xA;&lt;li&gt;Especially relevant test cases?&lt;/li&gt;&#xA;&lt;li&gt;Is there an easy way to take up less vertical space and still have a good amount of test cases?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="90614" LastEditorUserId="90614" LastEditDate="2021-05-21T15:32:48.087" LastActivityDate="2021-05-21T15:32:48.087" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="22342" PostTypeId="2" ParentId="2140" CreationDate="2021-05-17T20:45:40.947" Score="1" Body="&lt;h1&gt;Solve a Quartic Equation&lt;/h1&gt;&#xA;&lt;p&gt;Since I saw the quartic formula and it's a behemoth to solve, your task is to implement it in as few bytes as possible. That's it.&lt;/p&gt;&#xA;&lt;p&gt;To clarify some concerns, input and output can be as a string representing the equation, a list of numbers, numbers on different lines of STDIN/STDOUT, or a tuple of numbers - anything that represents clearly the four solutions is acceptable, and anything that clearly represents the five inputs is acceptable.&lt;/p&gt;&#xA;&lt;p&gt;You may assume the equation will always have a real root, and if you choose not to support imaginary roots, you just need to output the real root(s).&lt;/p&gt;&#xA;&lt;p&gt;On advice from TNB, builtins are now banned&#xA;The formula for reference:&lt;/p&gt;&#xA;&lt;p&gt;For a quartic equation &lt;span class=&quot;math-container&quot;&gt;\$ax^4 + bx^3 + cx^2 + dx + e = 0\$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$x_1, x_2 = \frac{-b}{4a} - S \pm  \frac{1}{2}\sqrt[]{4S^2 - 2p + \frac{q}{S}}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$x_3, x_4 = \frac{-b}{4a} + S \pm  \frac{1}{2}\sqrt[]{4S^2 - 2p + \frac{q}{S}}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;where:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$p = \dfrac{8ac - 3b^2}{8a^2},\$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$q = \dfrac{b^3 - 4abc + 8a^2d}{8a^3}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;where:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$S = \frac{1}{2}\sqrt[]{-\frac{2}{3}p + \frac{1}{3a}\left(Q + \frac{\Delta_0}{Q}\right)},\$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$Q = \sqrt[3]{\frac{\Delta_1 + \sqrt[]{\Delta_1^2 - 4\Delta_0^3}}{2}}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;and where:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\Delta_0 = c^2 - 3bd + 12ae,\$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$\Delta_1 = 2c^3 - 9bcd + 27b^2e + 27ad^2 - 72ace\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;I learnt LaTeX just to do all those formulae. I hope you're proud of me. As always, this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest wins.&lt;/p&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="100887" LastEditorUserId="100887" LastEditDate="2021-05-21T13:07:47.907" LastActivityDate="2021-05-21T13:07:47.907" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="22344" PostTypeId="5" CreationDate="2021-05-18T00:07:53.567" Score="0" Body="&lt;p&gt;On &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/17725/66833&quot;&gt;June 1st 2019&lt;/a&gt;, codegolf.stackexchange.com received its design. With this design, we were &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/17612/66833&quot;&gt;offered&lt;/a&gt; the option to change our name from &amp;quot;Programming Puzzles &amp;amp; Code Golf&amp;quot; (PPCG) to &amp;quot;Code Golf and Coding Challenges&amp;quot; (CGCC). This change came into effect along with the rest of the design on June 1st.&lt;/p&gt;&#xA;&lt;p&gt;The name of this site will not be changing without significant support from the community. If you are suggesting a change, please make sure you have this support.&lt;/p&gt;&#xA;&lt;p&gt;However, not all sections of the site show the updated name. Some of the more &amp;quot;background&amp;quot; pages have to be manually updated. If you find anywhere where the old name is still being used in an ongoing process, either correct if you can, or open a &lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt; report here on meta&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-18T00:07:53.567" LastActivityDate="2021-05-18T00:07:53.567" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22345" PostTypeId="4" CreationDate="2021-05-18T00:07:53.567" Score="0" Body="For discussions about the name of this site. The site's current name is Code Golf and Coding Challenges (CGCC for short)." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-18T00:07:53.567" LastActivityDate="2021-05-18T00:07:53.567" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22346" PostTypeId="2" ParentId="2140" CreationDate="2021-05-18T00:15:27.013" Score="0" Body="&lt;h1&gt;Gabriel's Horn&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/226022/convince-me-gabriels-horn-is-possible&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="87307" LastEditorUserId="87307" LastEditDate="2021-05-20T15:57:19.667" LastActivityDate="2021-05-20T15:57:19.667" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22347" PostTypeId="2" ParentId="2140" CreationDate="2021-05-18T15:00:34.813" Score="0" Body="&lt;p&gt;Given an real polynomial equation &lt;span class=&quot;math-container&quot;&gt;\$c_0+c_1x+c_2x^2+...+c_nx^n=0\$&lt;/span&gt;, count how many real roots it has.&lt;/p&gt;&#xA;&lt;p&gt;You can and need to assume infinite precision. You can assume repeated root doesn't exist.&lt;sup&gt;[1]&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;You can take input [c0,c1,...,cn], [cn,...,c1,c0], or just the polynomial or the equation in your language support.&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1=0 =&amp;gt; 0&#xA;0=0 =&amp;gt; Infinity&#xA;2+1x=0 =&amp;gt; 1&#xA;3+4x+1x^2=0 =&amp;gt; 2&#xA;6+4x+1x^2=0 =&amp;gt; 0&#xA;0+0x+0x^2+1x^3+0x^4=0 =&amp;gt; 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Sandbox Notes&lt;/h1&gt;&#xA;&lt;p&gt;[1] Is checking repeated root always possible?&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2021-05-18T15:00:34.813" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="22348" PostTypeId="2" ParentId="2140" CreationDate="2021-05-18T20:12:59.583" Score="0" Body="&lt;h2&gt;Golf Code Golf&lt;/h2&gt;&#xA;&lt;p&gt;Given &lt;a href=&quot;https://chat.stackexchange.com/transcript/240/2011/1/28&quot;&gt;the transcript&lt;/a&gt; (what I mean by full transcript is you can access all days of the transcript) of The Nineteenth Byte (the general chat room of code golf), output the full transcript in text form (you only have to include messages, though including other things is allowed. You can use any format as long as it includes the poster and contents of each message. As for people changing names, the way you handle this is up to you, do whichever is shortest). You can access the full transcript in your code, but you cannot access any other external sources.&lt;/p&gt;&#xA;&lt;p&gt;Since this is code golf, shortest answer wins, and &lt;a href=&quot;https://chat.stackexchange.com/transcript/240/2011/1/28&quot;&gt;standard loopholes are not allowed&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="103408" LastEditorUserId="103408" LastEditDate="2021-05-18T20:48:15.027" LastActivityDate="2021-05-18T20:48:15.027" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="22349" PostTypeId="2" ParentId="2140" CreationDate="2021-05-18T20:49:16.187" Score="2" Body="&lt;h3&gt;Telephone Cipher Encoder&lt;/h3&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The telephone cipher is a relatively basic cipher originating from the book The Terrible Two. The cipher is explained &lt;a href=&quot;http://terribletwo.com/welcome/#:%7E:text=You%27ve%20seen%20a%20phone,the%20position%20on%20the%20key.&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; as follows:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Does this keypad (below) look familiar? It does? Good. You’ve seen a&#xA;phone before.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Y6ScC.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Y6ScC.png&quot; alt=&quot;Keypad&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Now, in the telephone cipher, there are two numbers for each letter.&#xA;The first digit corresponds to the number on a telephone, while the&#xA;second digit corresponds to the position on the key.&lt;/p&gt;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&lt;p&gt;21 = A&lt;/p&gt;&#xA;&lt;p&gt;Why? Because A is located on the number 2 on the keypad and A&#xA;is in the first position of that particular key.&lt;/p&gt;&#xA;&lt;p&gt;22 = B&lt;/p&gt;&#xA;&lt;p&gt;B is located on the 2 key and is in the second position of that&#xA;key.&lt;/p&gt;&#xA;&lt;p&gt;53 = L&lt;/p&gt;&#xA;&lt;p&gt;L is located on the 5 key and is in the third position on that&#xA;key.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Given an input string &lt;code&gt;s&lt;/code&gt;, the program should output the string encoded with the telephone cipher.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;s&lt;/code&gt; may contain single spaces between words, but will not have leading or trailing whitespace and will use only lowercase letters a-z. &lt;code&gt;s&lt;/code&gt; will always have a length greater than or equal to 1.&lt;/p&gt;&#xA;&lt;p&gt;The output should contain no whitespace and be properly encoded with the telephone cipher as described above.&lt;/p&gt;&#xA;&lt;p&gt;As an example, the following input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;hello world&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Should result in:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;42325353639163735331&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;All &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;usual loopholes&lt;/a&gt; are disallowed. This is code golf so shortest answer in bytes wins. May the odds be ever in your favor!&lt;/p&gt;&#xA;" OwnerUserId="84059" LastActivityDate="2021-05-18T20:49:16.187" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22350" PostTypeId="1" CreationDate="2021-05-19T02:13:10.007" Score="4" ViewCount="103" Body="&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8287/on-scoring-imported-functions&quot;&gt;On scoring imported functions&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I knew that if I want to use some imported functions, I had to include &amp;quot;import&amp;quot; statement in the byte count. For example, I want to find out the most common character in a string:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;from collections import*&#xA;lambda x:Counter(x).most_common(1)[1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;As the &lt;code&gt;Counter&lt;/code&gt; function is imported from &lt;code&gt;collections&lt;/code&gt;, I need to include &lt;code&gt;from collections import*&lt;/code&gt; into my byte count.&lt;/p&gt;&#xA;&lt;p&gt;But what should I do if I'm only using some method on inputted object, which you need the &amp;quot;import&amp;quot; to construct the input object?&lt;/p&gt;&#xA;&lt;p&gt;For example, I want to calculate sum of two fractions:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;from fractions import*&#xA;f = lambda x,y:x+y&#xA;f(Fraction(1, 2), Fraction(1, 3))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The function will not cause any error without the import. But you cannot invoke it without the import.&lt;/p&gt;&#xA;&lt;p&gt;Also, the same thing may happen to third-party libraries too. Another example is, I want to find out all positive number in an array:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;import numpy as np&#xA;f = lambda x:x[x&amp;gt;0]&#xA;f(np.array([1,3,-2,5,-4]))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;So, how should I score above codes?&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Is the &lt;code&gt;fractions&lt;/code&gt; answer valid?&lt;/li&gt;&#xA;&lt;li&gt;Should I include &lt;code&gt;import fractions&lt;/code&gt; in byte count?&lt;/li&gt;&#xA;&lt;li&gt;Is the &lt;code&gt;numpy&lt;/code&gt; answer valid?&lt;/li&gt;&#xA;&lt;li&gt;Should I include &lt;code&gt;import numpy&lt;/code&gt; as in byte count?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="44718" LastEditorUserId="44718" LastEditDate="2021-05-19T02:49:40.300" LastActivityDate="2021-05-19T23:57:30.487" Title="Should &quot;import&quot; statement be included in byte count if I'm not using it directly" Tags="|discussion|policy|code-golf|" AnswerCount="1" CommentCount="6" ClosedDate="2021-05-19T23:58:18.010" ContentLicense="CC BY-SA 4.0" />
  <row Id="22351" PostTypeId="2" ParentId="2140" CreationDate="2021-05-19T02:35:50.740" Score="0" Body="&lt;h1&gt;JS onelineriser&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;JavaScript is a very easy language to onelinerise. All one has to do is insert a semicolon in the correct locations and concatenate every line.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to write a program that, given a valid JS program, returns a program in one line but is otherwise identical to the input.&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Clarifications?&lt;/li&gt;&#xA;&lt;li&gt;Any edge cases where any operation other than inserting semicolons is required?&lt;/li&gt;&#xA;&lt;li&gt;Should I include basic JS syntax in the question or provide a link?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="103324" LastActivityDate="2021-05-19T02:35:50.740" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="22352" PostTypeId="2" ParentId="2140" CreationDate="2021-05-19T09:35:05.133" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/225962/peter-is-a-picky-eater&quot;&gt;Posted&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerDisplayName="user100752" LastEditorDisplayName="user100752" LastEditDate="2021-05-19T12:34:46.723" LastActivityDate="2021-05-19T12:34:46.723" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22353" PostTypeId="2" ParentId="2140" CreationDate="2021-05-19T19:23:04.887" Score="0" Body="&lt;h1&gt;Print a BigNum&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to take an &lt;strong&gt;arbitrary precision&lt;/strong&gt; unsigned integer, separated into 7-bit parts (a.k.a. base 128), and output it in base 10.&lt;/p&gt;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&lt;p&gt;All arithmetic for conversion (excluding basic indexing) must be done only using values &lt;span class=&quot;math-container&quot;&gt;\$-2^{15}\le x \le 2^{15}-1\$&lt;/span&gt;, or in simpler terms, the range of a signed 16-bit integer.&lt;/p&gt;&#xA;&lt;p&gt;So for example, something like this in Python would be illegal because &lt;code&gt;a[i]&amp;lt;&amp;lt;i*7&lt;/code&gt; and &lt;code&gt;sum&lt;/code&gt; are capable of making a number larger than &lt;span class=&quot;math-container&quot;&gt;\$2^{15}-1\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;lambda a:str(sum(a[i]&amp;lt;&amp;lt;i*7for i in range(len(a))))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that you are not required to explicitly use 16-bit integers or mask every time.&lt;/p&gt;&#xA;&lt;p&gt;Your algorithm must be able to handle numbers of any length, if the resources are available.&lt;/p&gt;&#xA;&lt;p&gt;Assume all inputs to be valid and the shortest possible length.&lt;/p&gt;&#xA;&lt;h2&gt;Input/output:&lt;/h2&gt;&#xA;&lt;p&gt;The input is a list of numbers, each 0-127, in big or little endian order. You only need to handle up to 224 bits, or 32 base 128 digits, though.&lt;/p&gt;&#xA;&lt;p&gt;Any reasonable encoding format is fine, as long as all digits are in base 128 and the length is variable. You could do this: &lt;code&gt;122 bananas, 0 bananas, 20 bananas, 12 apples&lt;/code&gt;, I don't care. ULEB128 is allowed if that is easier.&lt;/p&gt;&#xA;&lt;p&gt;The output can be either an ASCII string or printed to standard output, all in base 10. These must be ordered in big endian (as if you were to print it).&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;Inputs are in little endian order.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[0] -&amp;gt; 0&#xA;[1] -&amp;gt; 1&#xA;[127] -&amp;gt; 127&#xA;[99] -&amp;gt; 99&#xA;[0, 0, 1] -&amp;gt; 16384&#xA;[127, 0, 0, 0, 127] -&amp;gt; 34091303039&#xA;[21, 26, 111, 58] -&amp;gt; 123456789&#xA;[1, 78, 123, 61, 102, 86, 17, 32, 74, 41, 114, 79, 1] -&amp;gt; 31415926535897932384626433&#xA;[63, 29, 51, 105, 61, 107, 45, 70, 105, 97, 38, 36, 121, 15, 77, 24, 72, 4, 52, 56, 6, 5, 36, 38, 87, 10, 37, 26, 96, 16, 21, 110] -&amp;gt; 23203475113112158652497114438750306328443726354045579113768791363263&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="94093" LastEditorUserId="94093" LastEditDate="2021-05-21T14:40:27.007" LastActivityDate="2021-05-21T14:40:27.007" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22354" PostTypeId="2" ParentId="2140" CreationDate="2021-05-19T20:24:43.107" Score="-1" Body="&lt;p&gt;Given two reals &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt;, output some reals &lt;span class=&quot;math-container&quot;&gt;\$r_i\$&lt;/span&gt;, such that &lt;span class=&quot;math-container&quot;&gt;\$\sum r_i=a\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\prod\left(r_i+1\right)=b\$&lt;/span&gt;. You can assume that it's possible. You can also assume that your float type have infinite precision.&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2,3 =&amp;gt; 2 or etc.&#xA;2,4 =&amp;gt; 1,1 or 1/2,(sqrt(57)+9)/12,(9-sqrt(57))/12 or etc.&#xA;2,5 =&amp;gt; 1/3,1/2,2/3,1/2,0 or etc.&#xA;2,8 =&amp;gt; sqrt(17)+2,2-sqrt(17),-2 or etc.&#xA;2,2 =&amp;gt; sqrt(2)+1,1-sqrt(2) or etc.&#xA;e,2e =&amp;gt; 1,e-1 or etc. (e is natural base, though any number&amp;gt;1 work)&#xA;-4,9 =&amp;gt; -2,-2 or etc.&#xA;0,-1 =&amp;gt; sqrt(2),-sqrt(2) or etc.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Shortest code wins.&lt;/p&gt;&#xA;&lt;h1&gt;Notes&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Though I only removed two &lt;code&gt;positive&lt;/code&gt;s from the existing question, it's a huge change to the result.&lt;/li&gt;&#xA;&lt;li&gt;I decide to keep the &lt;code&gt;assume possible&lt;/code&gt; part just to make the note above correct. It can actually be proven that it's always possible.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2021-05-20T08:09:37.727" LastActivityDate="2021-05-20T08:09:37.727" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22355" PostTypeId="2" ParentId="2140" CreationDate="2021-05-19T22:41:54.197" Score="0" Body="&lt;h1&gt;Return shortest integer-is-one-of function&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt; challenge, where you'll ...&lt;/p&gt;&#xA;&lt;p&gt;Given a number of integers as input, your task is to write a function in JS, which returns a function that checks if an inputted integer is any of those. For example, &lt;code&gt;f([1, 2, 4])&lt;/code&gt; would return a function which would return &lt;code&gt;true&lt;/code&gt; if given &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;2&lt;/code&gt;, or &lt;code&gt;4&lt;/code&gt;, and &lt;code&gt;false&lt;/code&gt; for any other inputs.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Task:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your function will take any nonzero number of integers. There will not be any duplicates. This should return either a function, or a string containing the function's code.&lt;/p&gt;&#xA;&lt;p&gt;The returned function should take a single integer as input. If the input is one of the integers inputted into the original function, it should return a truthy value, and a falsy one otherwise. You may also choose to return any two consistent values, or a consistent value for one possiblity (such as &lt;code&gt;0&lt;/code&gt; for truthy) and any other value for the other.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Scoring:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is metagolf, meaning the average of the byte counts of the returned programs for a certain set of inputs will be your score. This set of inputs will consist of:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All combinations one to four integers from &lt;code&gt;-10&lt;/code&gt; to &lt;code&gt;10&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;A random group of 2000 inputs consisting of between five and ten integers between &lt;code&gt;-100&lt;/code&gt; and &lt;code&gt;100&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;A random group of 1000 inputs consisting of between two and six integers between &lt;code&gt;-10000&lt;/code&gt; and &lt;code&gt;10000&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Optimizing your solution for these specific test cases is disallowed.&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I will generate a random list of test cases that will be used for scoring when I post this&lt;/li&gt;&#xA;&lt;li&gt;This is my first time writing a metagolf challenge. Any improvements y'all can think of?&lt;/li&gt;&#xA;&lt;li&gt;I think the number of bytes should be limited in the submitted function (not the generated ones). Suggestions?&lt;/li&gt;&#xA;&lt;li&gt;Too many test cases? Too few?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2022-02-09T03:35:13.570" LastActivityDate="2022-02-09T03:35:13.570" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="22356" PostTypeId="2" ParentId="22350" CreationDate="2021-05-19T23:57:30.487" Score="1" Body="&lt;h1&gt;Count imports only if the function &lt;em&gt;definitely&lt;/em&gt; doesn't work without directly importing it&lt;/h1&gt;&#xA;&lt;p&gt;Using the OP's &lt;code&gt;Fraction&lt;/code&gt; code as an example:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;from fractions import*&#xA;f = lambda x,y:x+y&#xA;f(Fraction(1, 2), Fraction(1, 3))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;What if I change the example function call to the following? It imports a hypothetical third-party library &lt;code&gt;frac_consts&lt;/code&gt; which contains definitions of &lt;code&gt;one_half = Fraction(1,2); one_third = Fraction(1,3)&lt;/code&gt;, and does &lt;em&gt;not&lt;/em&gt; import &lt;code&gt;Fraction&lt;/code&gt; directly, but it works totally fine (and adds two fractions as intended):&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;from frac_consts import*&#xA;f = lambda x,y:x+y&#xA;f(one_half, one_third)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Therefore, &lt;code&gt;from fractions import*&lt;/code&gt; is not necessary to add two &lt;code&gt;Fraction&lt;/code&gt;s. This conclusion is consistent with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10085/78410&quot;&gt;this answer on a previous discussion&lt;/a&gt;; an import that is necessary to construct the arguments &lt;em&gt;but not required to define the function&lt;/em&gt; may be excluded from the byte count.&lt;/p&gt;&#xA;&lt;p&gt;Under this reasoning, both answers in the OP's code are valid, and can be scored as &lt;code&gt;lambda x,y:x+y&lt;/code&gt; and &lt;code&gt;lambda x:x[x&amp;gt;0]&lt;/code&gt;, respectively.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2021-05-19T23:57:30.487" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22357" PostTypeId="2" ParentId="2140" CreationDate="2021-05-20T09:13:51.950" Score="0" Body="&lt;h1&gt;What is the link to your answer?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-referential&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-referential&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-referential&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Goal&lt;/h2&gt;&#xA;&lt;p&gt;Your task is to create a program taking the input that returns the link to your answer. You can find a link to your answer by clicking at the share button on your answer.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Standard loopholes apply except for searching for the answer online. In fact, you are expected to find the answer online.&lt;/li&gt;&#xA;&lt;li&gt;You are allowed to use curl or the equivalent, but you are not allowed to use any html parser library or built-in. If you need to import the library, the import declaration does &lt;strong&gt;NOT&lt;/strong&gt; count into the code size as long as you don't rename any identifiers.&lt;/li&gt;&#xA;&lt;li&gt;You are not allowed to assume the link to your answer. You have to search this page for your submission. If you remove your submission and readd it, and your code breaks, you fail the challenge.&lt;/li&gt;&#xA;&lt;li&gt;You may still assume your username, the contents of your code, and the programming language/byte count you are using. You are not allowed to assume the description below your code. If you edit the description part of the submission and the code breaks, you fail the challenge. You may assume that the code of each submission is unique and no one copies your submission into another answer.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so, the shortest answer in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="46245" LastEditorUserId="46245" LastEditDate="2021-05-21T14:52:37.957" LastActivityDate="2021-05-21T14:52:37.957" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="22359" PostTypeId="1" CreationDate="2021-05-20T12:51:15.537" Score="-4" ViewCount="149" Body="&lt;p&gt;What in the world is code golf and how is it important to me? I have already looked in the tour.&lt;/p&gt;&#xA;" OwnerUserId="104037" OwnerDisplayName="idiot" LastActivityDate="2021-05-20T13:14:15.780" Title="Need help with code golf" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="1" ClosedDate="2021-05-20T13:15:04.690" ContentLicense="CC BY-SA 4.0" />
  <row Id="22360" PostTypeId="2" ParentId="22359" CreationDate="2021-05-20T13:07:38.787" Score="5" Body="&lt;p&gt;Code Golf is a mostly-recreational semi-competitive exercise in writing code, where the objective is to accomplish the aim using the least amount of code in the programming language chosen. (Compare with the familiar game of golf, where the objective is to get the ball into the hole with the least number of strokes.)&lt;/p&gt;&#xA;&lt;p&gt;Only you can decide how – or whether – it is important to you.&lt;/p&gt;&#xA;&lt;p&gt;With some languages, “golfing” encourages familiarity with “idiomatic” constructions. It also encourages thinking “out of the box” when attempting to solve the given problem.&lt;/p&gt;&#xA;" OwnerUserId="79081" OwnerDisplayName="Jeff Zeitlin" LastActivityDate="2021-05-20T13:07:38.787" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22361" PostTypeId="2" ParentId="2140" CreationDate="2021-05-20T15:42:47.527" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/226174/66833&quot;&gt;Dr. Lamport&amp;#39;s Unfinished Business&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="7942" LastEditorUserId="66833" LastEditDate="2021-06-07T01:02:18.383" LastActivityDate="2021-06-07T01:02:18.383" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="22362" PostTypeId="2" ParentId="2140" CreationDate="2021-05-21T07:18:17.307" Score="2" Body="&lt;h1&gt;Calculate &lt;span class=&quot;math-container&quot;&gt;\$ \lfloor n \log_2(n) \rfloor \$&lt;/span&gt;, exactly&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given an integer &lt;span class=&quot;math-container&quot;&gt;\$ 2 \le n \$&lt;/span&gt;, you need to calculate &lt;span class=&quot;math-container&quot;&gt;\$ \lfloor n \log_2(n) \rfloor \$&lt;/span&gt;, assuming all integers in your language are unbounded.&lt;/p&gt;&#xA;&lt;p&gt;However, you may not ignore floating-point errors - for example, in python &lt;code&gt;lambda n:int(n*math.log2(n))&lt;/code&gt; is an invalid solution, because for example for &lt;code&gt;n=10**15&lt;/code&gt;, &lt;code&gt;int(n*math.log2(n))&lt;/code&gt; is 49828921423310432, while the actual answer is 49828921423310435.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can assume the input is an integer &lt;span class=&quot;math-container&quot;&gt;\$ 2 \le n \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;You may use any &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;reasonable I/O method&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are disallowed&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;2 -&amp;gt; 2&#xA;3 -&amp;gt; 4&#xA;4 -&amp;gt; 8&#xA;5 -&amp;gt; 11&#xA;6 -&amp;gt; 15&#xA;7 -&amp;gt; 19&#xA;8 -&amp;gt; 24&#xA;9 -&amp;gt; 28&#xA;10 -&amp;gt; 33&#xA;100 -&amp;gt; 664&#xA;1000 -&amp;gt; 9965&#xA;10000 -&amp;gt; 132877&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;10 brownie points for beating my 4 byte 05AB1E answer.&lt;/p&gt;&#xA;&lt;p&gt;This is code golf, so the shortest answer wins. Good luck!&lt;/p&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2021-05-21T07:50:22.987" LastActivityDate="2021-05-21T07:50:22.987" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22363" PostTypeId="2" ParentId="2140" CreationDate="2021-05-21T08:25:55.970" Score="4" Body="&lt;h1&gt;Fastest untyped lambda calculus evaluator &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/functional-programming&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;functional-programming&amp;#39;&quot; rel=&quot;tag&quot;&gt;functional-programming&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/lambda-calculus&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;lambda-calculus&amp;#39;&quot; rel=&quot;tag&quot;&gt;lambda-calculus&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;What it says on the tin. Mainly because googling &amp;quot;fastest untyped lambda calculus&amp;quot; gives almost zero meaningful results.&lt;/p&gt;&#xA;&lt;p&gt;Each submission is expected to take a lambda term from STDIN and print its normal form to STDOUT. The lambda term is represented using de Bruijn indexes, and we will use prefix notation for this challenge. Since a de Bruijn index may have multiple digits, each token will be separated by a single space. The input will have no surrounding whitespace, but you may output any amount of whitespace before and after the formatted lambda term.&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;LambdaChar = &amp;quot;\&amp;quot;             // single backslash&#xA;DeBruijnIndex = [1-9][0-9]*  // a positive integer&#xA;ApplyChar = &amp;quot;@&amp;quot;&#xA;Term = DeBruijnIndex | LambdaChar &amp;quot; &amp;quot; Term | ApplyChar &amp;quot; &amp;quot; Term &amp;quot; &amp;quot; Term&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For example, &lt;code&gt;\ \ @ 1 @ 2 1&lt;/code&gt; represents &lt;code&gt;lambda x. lambda y. y (x y)&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The evaluation semantics to implement is normal order beta-reduction (no eta-reduction).&lt;/p&gt;&#xA;&lt;p&gt;The test cases will be hand-crafted so that it takes significantly more time to evaluate the expression than to parse the input and format the output. Also, they will involve various kinds of Church- and Scott-encoded terms, so optimizing for any specifically encoded data (hopefully) has less effect than optimizing for general improvement. It is guaranteed that the test cases have a normal form and do not contain free variables.&lt;/p&gt;&#xA;&lt;p&gt;Good starting points include &lt;a href=&quot;https://www.researchgate.net/publication/312013355_Compiling_untyped_lambda_calculus_to_lower-level_code_by_game_semantics_and_partial_evaluation_invited_paper&quot; rel=&quot;nofollow noreferrer&quot;&gt;this PEPM '17 paper&lt;/a&gt; and &lt;a href=&quot;https://github.com/Bubbler-4/StepULC&quot; rel=&quot;nofollow noreferrer&quot;&gt;my Haskell implementation&lt;/a&gt; which was modified from the paper's algorithm to actually return the normal form. Other notable keywords: graph reduction, supercombinators, G-machine, TIGRE, STG (spineless tagless G-machine). Note that, if your submission has separate compilation and execution phases, both phases count towards the total execution time (which may negatively impact your score).&lt;/p&gt;&#xA;&lt;p&gt;The submissions will be scored within WSL (Ubuntu 20.04) on my Windows 10 PC, which has Intel Core i7-6700 CPU (3.40GHz) and 8GB of RAM. The score is the sum of the timings measured for all the test cases. Lowest score wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Todo: write example and actual test cases.&lt;/li&gt;&#xA;&lt;li&gt;Should I include a description about how the &amp;quot;normal order beta reduction&amp;quot; works for de Bruijn indexes?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-09-01T01:14:33.963" LastActivityDate="2021-09-01T01:14:33.963" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22364" PostTypeId="2" ParentId="2140" CreationDate="2021-05-21T21:33:09.110" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/226148/recreate-the-stack-overflow-logo&quot;&gt;Recreate the Stack Overflow logo&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="104058" LastEditorUserId="66833" LastEditDate="2021-05-22T23:08:42.363" LastActivityDate="2021-05-22T23:08:42.363" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="22365" PostTypeId="1" CreationDate="2021-05-22T04:15:41.690" Score="9" ViewCount="169" Body="&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;, our main chat room, has &lt;a href=&quot;https://chat.stackexchange.com/rooms/info/240/the-nineteenth-byte?tab=feeds&quot;&gt;some feeds&lt;/a&gt;. These post new challenges, meta questions, sandboxes posts, and some other assorted things. Unfortunately, they're kinda slow. New Main Posts and New Sandboxed Posts often take between ten and twenty minutes, and New Meta Posts can take up to an hour.&lt;/p&gt;&#xA;&lt;p&gt;That brings me to &lt;a href=&quot;https://github.com/RedwolfPrograms/userscripts/raw/main/new-posts.user.js&quot; rel=&quot;nofollow noreferrer&quot;&gt;New Posts&lt;/a&gt;, a tool I made not too long ago which lists new questions and answers on CGCC. It turns out that it's &lt;em&gt;insanely&lt;/em&gt; fast, so much so that it's practically instant. I later decided to apply this concept to a bot, and made two chat bots: New Posts and Sandbox Posts.&lt;/p&gt;&#xA;&lt;p&gt;Currently, they live in &lt;a href=&quot;https://chat.stackexchange.com/rooms/123265/redwolfs-redundant-room&quot;&gt;Redwolf's Redundant Room&lt;/a&gt;. New Posts is responsible for posting new main and meta questions, while Sandbox Posts posts new posts from the sandbox (unintuitive, I know :p).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Should we replace New Main Posts, New Meta Posts, and New Sandboxed Posts with these bots?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;If the answer is yes, there are a few additional points that will need a consensus:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should we use the names New Posts and Sandbox Posts, or change them, or keep the names as New Main Posts, New Meta Posts, and New Sandboxed Posts?&lt;/li&gt;&#xA;&lt;li&gt;These are technically normal users rather than feeds, so they show up in the users list. Should they be designed to always be in the room, to prevent them from constantly entering and leaving?&lt;/li&gt;&#xA;&lt;li&gt;Should some posts be delayed if active conversation is going on?&lt;/li&gt;&#xA;&lt;li&gt;What should we do with the other three feeds (Newly Featured Questions, New Bounties With No Deadline, and New Loophole Proposal)? Should they be kept, converted to bots, or removed altogether?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="68942" LastEditDate="2021-06-01T13:46:16.763" LastActivityDate="2021-06-01T13:46:16.763" Title="Should we replace The Nineteenth Byte's feeds?" Tags="|discussion|status-completed|chat|rss|" AnswerCount="2" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="22366" PostTypeId="2" ParentId="22365" CreationDate="2021-05-22T08:21:20.143" Score="10" Body="&lt;h1&gt;Replace the Feeds&lt;/h1&gt;&#xA;&lt;p&gt;Feeds are easily editable by ROs. I suggest that we replace the 3 Feeds by these bots for a trial period, say a week. If, at the end of that period, we like the bots, then they stay. If not, we bring the Feeds back.&lt;/p&gt;&#xA;&lt;p&gt;Personally, I prefer &amp;quot;New Sandboxed Posts&amp;quot; to &amp;quot;Sandbox Posts&amp;quot;, and I believe having them always in the room is less disruptive to the user list than them leaving and joining (after all, this is literally a &lt;a href=&quot;https://meta.stackexchange.com/q/364419/355458&quot;&gt;problem we've had before&lt;/a&gt;). As to &amp;quot;pausing&amp;quot; for a conversation, I've got no opinion on this. It'd be a nice feature, but I'm not sure how beneficial it'd actually be.&lt;/p&gt;&#xA;&lt;p&gt;As for the other feeds, it'd probably be a better idea to see how these bots do, before converting all of them. But even then, I'm not sure we need these feeds to be especially fast, as they generally don't require immediate action in the same way that NMP/NSP do&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-05-22T08:21:20.143" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22367" PostTypeId="2" ParentId="22365" CreationDate="2021-05-22T12:08:17.060" Score="4" Body="&lt;h1&gt;Replace the 3 primary feeds and keep the 3 less used ones as feeds&lt;/h1&gt;&#xA;&lt;p&gt;The 3 primary feeds:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;New Main Posts&lt;/li&gt;&#xA;&lt;li&gt;New Sandboxed Posts&lt;/li&gt;&#xA;&lt;li&gt;New Meta Posts&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;are worth having as dedicated bots, since it's useful to have them work faster. (and I agree with caird's answer - we should try them out for a week to test reliability and whatnot).&lt;/p&gt;&#xA;&lt;p&gt;The 3 other ones:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Newly Featured Questions&lt;/li&gt;&#xA;&lt;li&gt;New Bounties With No Deadlines&lt;/li&gt;&#xA;&lt;li&gt;New Loophole Proposal&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;are sufficiently infrequently used that I don't see any purpose in running dedicated bots for them; the 10-minute delay of Feeds is perfectly acceptable.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2021-05-22T12:08:17.060" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22368" PostTypeId="1" AcceptedAnswerId="22369" CreationDate="2021-05-22T17:22:26.683" Score="4" ViewCount="49" Body="&lt;p&gt;Is there any winning criteria on the site which prioritises faster code instead of shorter code? My curiosity comes from questioning if size is better than efficiency or vice-versa. I know that using different computers to time different submissions can be difficult to objectively and fairly compare answers, but is it possible to use something like &lt;a href=&quot;https://tio.run&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt; (which includes execution times) instead?&lt;/p&gt;&#xA;" OwnerUserId="104096" LastEditorUserId="66833" LastEditDate="2021-05-22T17:39:06.220" LastActivityDate="2021-05-22T17:39:06.220" Title="Efficiency vs Length" Tags="|support|winning-criteria|" AnswerCount="1" CommentCount="1" ClosedDate="2021-05-22T20:33:52.140" ContentLicense="CC BY-SA 4.0" />
  <row Id="22369" PostTypeId="2" ParentId="22368" CreationDate="2021-05-22T17:23:24.147" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;/&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenges are, as the tag suggests, about creating the code to complete a task as fast as possible. Challenges with this tag should include the specifications of the machine being used to time the submissions (typically the challenge author's machine).&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt; challenges are about the asymptotic time complexity of the answers, where the answer with the smallest such is the winner.&lt;/p&gt;&#xA;&lt;p&gt;Note that both of these challenges should generally involve &amp;quot;tricky&amp;quot; tasks, as the margin of error for trivial tasks often overshadows the time taken to do that task itself (e.g. &amp;quot;add 2 numbers&amp;quot; would not be a good &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenge)&lt;/p&gt;&#xA;&lt;p&gt;Additionally, while it is tempting to use TIO to time answers, it generally &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12708/66833&quot;&gt;isn't a good idea&lt;/a&gt;. TIO uses multiple arena servers, which don't all run at the same speed, and your timing can be affected by other users running code at the same time&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-22T17:31:49.803" LastActivityDate="2021-05-22T17:31:49.803" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22371" PostTypeId="1" CreationDate="2021-05-22T20:04:10.343" Score="8" ViewCount="293" Body="&lt;p&gt;I'm writing a challenge, and I'm not sure what possible winning criteria exist. I know about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, but what else is there to use, and how do I score answers with those criteria?&lt;/p&gt;&#xA;&lt;p&gt;Every single question on this site should have at least one of the following tags. Those without will be closed. &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=%22%22+is%3Aquestion+closed%3Ano+-%5Bcode-golf%5D+-%5Bcode-challenge%5D+-%5Bpopularity-contest%5D+-%5Bfastest-code%5D+-%5Bfewest-operations%5D+-%5Bcode-trolling%5D+-%5Bcode-bowling%5D+-%5Bbusy-beaver%5D+-%5Bking-of-the-hill%5D+-%5Batomic-code-golf%5D+-%5Bcode-shuffleboard%5D+-%5Btips%5D+-%5Bchallenge-writing%5D+-%5Bprogramming-puzzle%5D+-%5Brestricted-source%5D+-%5Balgorithm%5D+-%5Bmetagolf%5D+-%5Bfastest-algorithm%5D+-%5Bpuzzle-solver%5D+-%5Banswer-chaining%5D+-%5Bcops-and-robbers%5D+-%5Btest-battery%5D+-%5Brosetta-stone%5D+-%5Bproof-golf%5D+-%5Bshowcase%5D+-%5Bself-scoring%5D&quot;&gt;This search query&lt;/a&gt; lists all challenges without a winning-criterion tag.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2022-02-06T18:45:49.197" LastActivityDate="2023-02-20T18:38:21.110" Title="What are the winning criteria I can use for my challenge?" Tags="|support|faq|tags|winning-criteria|" AnswerCount="1" CommentCount="0" CommunityOwnedDate="2021-05-22T20:06:03.863" ContentLicense="CC BY-SA 4.0" />
  <row Id="22372" PostTypeId="2" ParentId="22371" CreationDate="2021-05-22T20:04:10.343" Score="6" Body="&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;answer-chaining-container&quot;&gt;answer-chaining&lt;/a&gt;: Each answer influences how newer answers work. Often ends when there are no new answers in a specific time and the last one wins. See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14966/66833&quot;&gt;What answer-chaining scoring criteria promote collaboration?&lt;/a&gt; for more.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;atomic-code-golf-container&quot;&gt;atomic-code-golf&lt;/a&gt;: Challenge with limited amounts of commands available, where the answer that uses the fewest wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/busy-beaver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;busy-beaver&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;busy-beaver&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;busy-beaver-container&quot;&gt;busy-beaver&lt;/a&gt;: The answer who gets the largest value of a certain computation model property wins, subject to the constraint that it must halt.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-bowling-container&quot;&gt;code-bowling&lt;/a&gt;: Answer with the highest score (typically length) wins. Answers usually have to follow some form of constraint to prevent them from being infinitely larger.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-challenge-container&quot;&gt;code-challenge&lt;/a&gt;: Challenge with a specific scoring system, that isn't covered by any other tag.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;: The shortest code, typically in each language, wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-shuffleboard&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-shuffleboard&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-shuffleboard&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-shuffleboard-container&quot;&gt;code-shuffleboard&lt;/a&gt;: The aim is to get a score, usually length, closest to a specific value.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;cops-and-robbers-container&quot;&gt;cops-and-robbers&lt;/a&gt;: Challenge covering 2 sub-challenges, where one's target is to solve a problem, and the second's is to find a hole in the first.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;fastest-algorithm-container&quot;&gt;fastest-algorithm&lt;/a&gt;: The winner is the answer with the smallest asymptotic time complexity. Related to, but not the same as, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;fastest-code-container&quot;&gt;fastest-code&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;fastest-code-container&quot;&gt;fastest-code&lt;/a&gt;: The winner is determined by the runtime performance of the code, normally all timed on the same computer, such as the challenge author's. This often requires answers to be in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7822/66833&quot;&gt;freely available&lt;/a&gt; languages. Sometimes scored by the ratio of speed to a reference program (&lt;a href=&quot;https://codegolf.stackexchange.com/q/199528/107299&quot;&gt;example&lt;/a&gt;). This allows the answerers to run the code themselves.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fewest-operations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fewest-operations&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fewest-operations&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;fewest-operations-container&quot;&gt;fewest-operations&lt;/a&gt;: Challenge where answers are scored on the number of operations executed when running the program. The available operations are defined in the challenge. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fewest-operations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fewest-operations&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fewest-operations&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;fewest-operations-container&quot;&gt;fewest-operations&lt;/a&gt; is to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;fastest-code-container&quot;&gt;fastest-code&lt;/a&gt; what &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;atomic-code-golf-container&quot;&gt;atomic-code-golf&lt;/a&gt; is to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;king-of-the-hill-container&quot;&gt;king-of-the-hill&lt;/a&gt;: Challenge where submissions interact with and compete against each other in a form of a game, with the winner decided by the submission that does the best in the competition.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;metagolf-container&quot;&gt;metagolf&lt;/a&gt;: Metagolf challenges are scored on the length of the output of a &lt;em&gt;metaprogram&lt;/em&gt;. Metaprograms produce a program that, when run, completes a specified challenge.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;popularity-contest-container&quot;&gt;popularity-contest&lt;/a&gt;: The answer with the highest net score (upvotes minus downvotes) is the winner. Popularity contests are generally discouraged, due to the subjective nature of voting.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;programming-puzzle-container&quot;&gt;programming-puzzle&lt;/a&gt; (ex. &lt;a href=&quot;https://codegolf.stackexchange.com/q/12188/3808&quot;&gt;When is a giraffe not a giraffe?&lt;/a&gt;): A program snippet is given and submissions have to edit it to make it solve a specified problem or meet a specified behaviour. Generally, the first correct answer is the winner.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/proof-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;proof-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;proof-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;proof-golf-container&quot;&gt;proof-golf&lt;/a&gt;: Answers aim to prove a provided statement in the fewest number of steps, using only the axioms included in the challenge.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/rosetta-stone&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;rosetta-stone&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;rosetta-stone&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;rosetta-stone-container&quot;&gt;rosetta-stone&lt;/a&gt;: The submission that uses the most languages to complete a task (often in a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;polyglot-container&quot;&gt;polyglot&lt;/a&gt;) wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-scoring&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-scoring&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;self-scoring&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;self-scoring-container&quot;&gt;self-scoring&lt;/a&gt;: A scoring criterion where the scoring mechanism and the task required are the same. This means that if you pass your program to itself as input it should give you its score.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;test-battery-container&quot;&gt;test-battery&lt;/a&gt;: Submissions run their program through a large number of test cases, and score based on the number of &amp;quot;successful&amp;quot; outputs for these test case. Typically, scores are percentages of correct outputs. Note that, by default, answers &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2507&quot;&gt;are not allowed to optimise their scores for the specific provided test cases&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Tags for non-challenge questions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt;: Question asking for tips on a specific piece of code, to make it a better answer to a programming challenge, or general &amp;quot;Tips for golfing in &lt;code&gt;&amp;lt;language&amp;gt;&lt;/code&gt;&amp;quot; questions.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/challenge-writing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;challenge-writing&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;challenge-writing&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;challenge-writing-container&quot;&gt;challenge-writing&lt;/a&gt;: Question about writing programming related challenges, not necessarily for CGCC.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/showcase&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;showcase&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;showcase&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;showcase-container&quot;&gt;showcase&lt;/a&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44680/showcase-of-languages&quot;&gt;This question&lt;/a&gt;. Please &lt;strong&gt;do not&lt;/strong&gt; create additional &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/showcase&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;showcase&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;showcase&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;showcase-container&quot;&gt;showcase&lt;/a&gt; questions.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="107299" LastEditDate="2023-02-20T18:38:21.110" LastActivityDate="2023-02-20T18:38:21.110" CommentCount="4" CommunityOwnedDate="2021-05-22T20:04:10.343" ContentLicense="CC BY-SA 4.0" />
  <row Id="22373" PostTypeId="2" ParentId="2140" CreationDate="2021-05-22T21:15:32.817" Score="0" Body="&lt;h1&gt;Lowest effort to fill the bucket&lt;/h1&gt;&#xA;&lt;p&gt;There are two man, Paul and Jhon, who can move only along a line; they are real persons so Paul cannot goes to the right of John and Jhon cannot goes to the left of Paul. At time 0 they start at the opposite ends of the line.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Paul&lt;/em&gt; |------X1----X2----BUCKET--------X3-----X4-----| &lt;em&gt;Jhon&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Their goal is to pickup the balls along the line (denoted as Xn) and fill the bucket in the lowest time. The time needed to go from A to B along the line is equal to the distance from A to B.&lt;/p&gt;&#xA;&lt;p&gt;For the challenge the balls are 20 and they are located on the line in the following way:&lt;/p&gt;&#xA;&lt;ol start=&quot;0&quot;&gt;&#xA;&lt;li&gt;Paul = 0&lt;/li&gt;&#xA;&lt;li&gt;X1 = 1&lt;/li&gt;&#xA;&lt;li&gt;X2 = 2&lt;/li&gt;&#xA;&lt;li&gt;X3 = 3&lt;/li&gt;&#xA;&lt;li&gt;x4 = X5 = x6 = 5&lt;/li&gt;&#xA;&lt;li&gt;BUCKET = 8&lt;/li&gt;&#xA;&lt;li&gt;X7 = 10&lt;/li&gt;&#xA;&lt;li&gt;X8 = 11&lt;/li&gt;&#xA;&lt;li&gt;X9 = X10 = X11 = 15&lt;/li&gt;&#xA;&lt;li&gt;X12 = 20&lt;/li&gt;&#xA;&lt;li&gt;X13 = X14 = X15 = 22&lt;/li&gt;&#xA;&lt;li&gt;X16 = X17 = X18 = 28&lt;/li&gt;&#xA;&lt;li&gt;X19 = 29&lt;/li&gt;&#xA;&lt;li&gt;X20 = 30&lt;/li&gt;&#xA;&lt;li&gt;Jhon = 32&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Which is the best sequence to reach they goal?&lt;/p&gt;&#xA;" OwnerUserId="104102" LastEditorUserId="104102" LastEditDate="2021-05-23T15:27:09.780" LastActivityDate="2021-05-23T15:27:09.780" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22374" PostTypeId="2" ParentId="14636" CreationDate="2021-05-23T00:09:30.790" Score="8" Body="&lt;h1&gt;Yes, as a ticker feed&lt;/h1&gt;&#xA;&lt;p&gt;It's been a couple of years since I first proposed this, and since then, over &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=inquestion%3A55422+is%3Aa+created%3A2018-01-21..&quot;&gt;200 new answers&lt;/a&gt; have been posted to the Hello, World! challenge, most of them introducing new languages. Additionally, we now have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/19367/66833&quot;&gt;this&lt;/a&gt; popular deadline-less bounty for new, interesting languages by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/79857/redwolf-programs&quot;&gt;Redwolf Programs&lt;/a&gt;. As it was 2 years ago, the Hello, World! challenge is the go-to place to introduce your language, and having some kind of feed would promote these languages even more.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14638/66833&quot;&gt;Esolanging Fruit's answer&lt;/a&gt; has not aged well. &lt;a href=&quot;https://chat.stackexchange.com/rooms/27364/esoteric-programming-languages&quot;&gt;Esolangs&lt;/a&gt; has been frozen for 703 days, and &lt;a href=&quot;https://chat.stackexchange.com/rooms/60252/language-development&quot;&gt;Language Development&lt;/a&gt; for close to 1000 days (960) at time of writing. Unfortunately, rooms aside from TNB often lose their activity quickly, and so feeds in these rooms would not achieve the intended goal of promoting new languages.&lt;/p&gt;&#xA;&lt;p&gt;Feeds can be of 2 varieties:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Message feeds, which is what TNB currently has &lt;s&gt;6&lt;/s&gt; 3 of: &lt;a href=&quot;https://chat.stackexchange.com/rooms/info/240/the-nineteenth-byte?tab=feeds&quot;&gt;TNB Feeds&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Ticker feeds, which are messages that drop down from the top of the window:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/OfHc6.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/OfHc6.png&quot; alt=&quot;ticker&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Ticker feeds are &lt;em&gt;significantly&lt;/em&gt; less disruptive than message feeds. They only show in an easily clearable box, they don't take up space in the transcript, and they don't interrupt conversation anywhere near as much as message feeds.&lt;/p&gt;&#xA;&lt;p&gt;Finally, as pointed out by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14636/can-we-have-a-hello-world-feed#comment53267_14636&quot;&gt;trichoplax&lt;/a&gt;, this is very easy to test out and stop if it becomes annoying. Overall, this seems like something that has very little negative points, and multiple positive points, and, 3 years later, I still believe this would be a good idea&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-28T11:42:19.530" LastActivityDate="2021-05-28T11:42:19.530" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22375" PostTypeId="2" ParentId="2140" CreationDate="2021-05-23T07:01:13.863" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/226292&quot;&gt;Gödel numbering of a string&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Posted!&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2021-05-26T08:30:14.310" LastActivityDate="2021-05-26T08:30:14.310" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22377" PostTypeId="2" ParentId="18375" CreationDate="2021-05-23T16:40:49.227" Score="1" Body="&lt;p&gt;This is &lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt; as of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/22161/66833&quot;&gt;this update&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-05-23T16:40:49.227" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22383" PostTypeId="2" ParentId="2140" CreationDate="2021-05-24T17:30:58.100" Score="7" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/249788&quot;&gt;Backronymiser឵឵&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-07-11T06:53:50.997" LastActivityDate="2022-07-11T06:53:50.997" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="22384" PostTypeId="1" AcceptedAnswerId="22429" CreationDate="2021-05-24T18:54:53.493" Score="4" ViewCount="168" Body="&lt;p&gt;I'm currently working on a challenge which involves writing JavaScript players for a board game.&lt;/p&gt;&#xA;&lt;p&gt;I've also recently discovered private fields in JavaScript (a recent addition), which I thought would be useful to prevent entries from accessing forbidden objects and cheating the game.&lt;/p&gt;&#xA;&lt;p&gt;The only trouble is that private fields are currently not supported by Firefox (see &lt;a href=&quot;https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Classes/Private_class_fields&quot; rel=&quot;nofollow noreferrer&quot;&gt;Mozilla Docs for private fields&lt;/a&gt;).&lt;/p&gt;&#xA;&lt;p&gt;So here are my options:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use the private field and explain on the ticket that the UI version of the game is not usable in Firefox.&lt;/li&gt;&#xA;&lt;li&gt;Remove the private field and describe on the ticket that a certain attribute is out-of-bounds. (I'd also need to manually check answers for it's use).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;So what's the right answer in this situation? Restrict the field manually or programmatically?&lt;/p&gt;&#xA;" OwnerUserId="16824" LastEditorUserId="68942" LastEditDate="2021-05-24T18:56:18.313" LastActivityDate="2021-06-02T14:39:31.500" Title="Should I prevent users of a specific browser doing my challenge?" Tags="|discussion|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22386" PostTypeId="2" ParentId="2140" CreationDate="2021-05-25T16:56:14.337" Score="1" Body="&lt;p&gt;Assume a standardized test has &lt;span class=&quot;math-container&quot;&gt;\$15\$&lt;/span&gt; multiple choice questions, with &lt;span class=&quot;math-container&quot;&gt;\$3\$&lt;/span&gt; options each. A school has some students and wishes for at least one of the students to get &lt;span class=&quot;math-container&quot;&gt;\$10\$&lt;/span&gt; correct answers. Since no one in the school knows any math they are going to cheat and tell each student which answers he has to give without knowing what the actual correct answers are.&lt;/p&gt;&#xA;&lt;p&gt;The problem is to find a number of students &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; such that it is possible to do this and guarantee at least one of the students gets at least &lt;span class=&quot;math-container&quot;&gt;\$10\$&lt;/span&gt; correct.&lt;/p&gt;&#xA;&lt;p&gt;For example one way to do it is with &lt;span class=&quot;math-container&quot;&gt;\$n=3\cdot2^{15}-1\$&lt;/span&gt; students, where we do all possible exams with at most two different options, since one of the options appears at most &lt;span class=&quot;math-container&quot;&gt;\$5\$&lt;/span&gt; times we can get at least one test with &lt;span class=&quot;math-container&quot;&gt;\$10\$&lt;/span&gt; correct solutions.&lt;/p&gt;&#xA;&lt;p&gt;Another possible &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is &lt;span class=&quot;math-container&quot;&gt;\$a^5\$&lt;/span&gt; where we can get a set of &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; tuples of length &lt;span class=&quot;math-container&quot;&gt;\$3\$&lt;/span&gt; that interesect every option of length &lt;span class=&quot;math-container&quot;&gt;\$3\$&lt;/span&gt; at least twice ( so basically a solution to the problem with length &lt;span class=&quot;math-container&quot;&gt;\$3\$&lt;/span&gt; and at least &lt;span class=&quot;math-container&quot;&gt;\$2\$&lt;/span&gt; correct). It seems that the vectors &lt;span class=&quot;math-container&quot;&gt;\$(1,1,1),(2,2,2),(3,3,3)\$&lt;/span&gt; along with the 6 permutations work, so &lt;span class=&quot;math-container&quot;&gt;\$9^5\$&lt;/span&gt; is also a valid &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The score will be &lt;span class=&quot;math-container&quot;&gt;\$\frac{1}{n}\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is a value for which it is possible to prove a configuration exists.&lt;/p&gt;&#xA;" OwnerDisplayName="user103863" LastActivityDate="2021-05-25T16:56:14.337" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="22387" PostTypeId="2" ParentId="2140" CreationDate="2021-05-25T21:08:55.040" Score="0" Body="&lt;p&gt;Back to the sandbox.&lt;/p&gt;&#xA;&lt;p&gt;Challenge will be initially done on TBD, although I may do it again after that sometimes. Also, programs will be launched with a launcher shell script.&lt;/p&gt;&#xA;&lt;h2&gt;Background/story&lt;/h2&gt;&#xA;&lt;p&gt;You are a programmer who has been requested to create a program that wipes out other similar programs. However, you need to have your program fight others to see how it does &lt;em&gt;&lt;strong&gt;in the field&lt;/strong&gt;&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Requirements&lt;/h2&gt;&#xA;&lt;p&gt;You are to make a program that can run on a  Debian 10 VM. If the language you use is not available by default on Debian 10, you must provide instructions or a link to the compiler.&lt;/p&gt;&#xA;&lt;h3&gt;Formatting&lt;/h3&gt;&#xA;&lt;p&gt;Submissions are to be formatted as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;# Name, Language&#xA;&#xA;Description&#xA;&#xA;```&#xA;Code&#xA;```&#xA;&#xA;More description and explanation&#xA;&#xA;Link to compiler download and/or download instructions for Debian 10 GNU/Linux (also add compiler options to use when compiling.)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Requirements for being included&lt;/h3&gt;&#xA;&lt;p&gt;Your answer must have at least one upvote. You also need to include an emergency off switch and test the switch to be included, and provide the source code and have tested it on a Debian 10 VM. Also, its growth rate must be hypothetically sub-exponential (this is to stop excessively laggy answers. If you don't know what growth rate to go with, go with linear (&lt;span class=&quot;math-container&quot;&gt;\$O(x)\$&lt;/span&gt;) or Polynomial (&lt;span class=&quot;math-container&quot;&gt;\$O(x^2)\$&lt;/span&gt;,&lt;span class=&quot;math-container&quot;&gt;\$O(x^3)\$&lt;/span&gt;,etc.).&lt;/p&gt;&#xA;&lt;h2&gt;Victory&lt;/h2&gt;&#xA;&lt;p&gt;To win, you need to be the last process of the bunch, by killing other processes through a system call. If you kill important processes that result in the VM breaking, that round is ignored for scoring. A total of 100 rounds will be run, and you get a point if you are the last &amp;quot;malicious&amp;quot; process around. If there's a tie, the tiers will be put in a tiebreaker.&lt;/p&gt;&#xA;&lt;h2&gt;Pseudocode for submission example&lt;/h2&gt;&#xA;&lt;p&gt;I don't know much about coding yet, so here's some pseudocode (feel free to convert it to a real programming language and mark it as such:&lt;/p&gt;&#xA;&lt;h1&gt;Example, Pseudocode&lt;/h1&gt;&#xA;&lt;p&gt;This program simply kills processes with the word &amp;quot;MalicousProcess&amp;quot;, unless it's &amp;quot;MalicousProcess-Example&amp;quot;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;def Example () {&#xA;  while (system(ps aux | grep &amp;quot;MalicousProcess&amp;quot;) != null) {&#xA;    for each process != &amp;quot;MalicousProcess-Example&amp;quot; {&#xA;      kill process&#xA;    }&#xA;  }&#xA;  return 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://example.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;fictitious compiler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Please provide more recommendations.&lt;/p&gt;&#xA;" OwnerUserId="104134" LastEditorUserId="104134" LastEditDate="2021-05-31T15:50:53.893" LastActivityDate="2021-05-31T15:50:53.893" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="22389" PostTypeId="2" ParentId="2140" CreationDate="2021-05-26T08:00:02.497" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/226691/66833&quot;&gt;Prime Factorization - but on the exponents too&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100887" LastEditorUserId="66833" LastEditDate="2021-06-01T23:12:03.947" LastActivityDate="2021-06-01T23:12:03.947" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22390" PostTypeId="2" ParentId="2140" CreationDate="2021-05-27T02:02:26.690" Score="0" Body="&lt;h1&gt;Verify the Perfect Rectangle&lt;/h1&gt;&#xA;&lt;p&gt;According to &lt;a href=&quot;https://mathworld.wolfram.com/PerfectRectangle.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wolfram Mathworld&lt;/a&gt;, a perfect rectangle is defined to be a rectangle that can be divided into squares of different side lengths.&lt;/p&gt;&#xA;&lt;p&gt;In this challenge, we are going to verify whether or not an arrangement is a perfect rectangle.&lt;/p&gt;&#xA;&lt;p&gt;For the input, there should be at least &lt;code&gt;3n+2&lt;/code&gt; non-negative integers in it:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first two numbers should show the size of the rectangle.&lt;/li&gt;&#xA;&lt;li&gt;Rest of the &lt;code&gt;3n&lt;/code&gt; numbers should describe &lt;code&gt;n&lt;/code&gt; squares.&lt;/li&gt;&#xA;&lt;li&gt;Each square should be described with &lt;code&gt;3&lt;/code&gt; numbers, which are the side length(&amp;gt;0) and the position(x, y).&lt;/li&gt;&#xA;&lt;li&gt;Position should be consistent throughout the whole input. For example, If the program gets the position of the bottom left corner of the square for one time, it should do that every other time as well.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For the output, the program should print a truthy value if the given arrangement is a perfect rectangle, and a falsey value otherwise.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Every squares should be different in side length.&lt;/li&gt;&#xA;&lt;li&gt;There should be neither overlaps nor voids.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Test cases(Note that any input and output formats are acceptable if they are reasonable):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[32,33],[9,0,0],[8,9,0],[15,17,0],[10,0,9],[1,9,8],[7,10,8],[14,0,19],[4,10,15],[18,14,15]]&#xA;-&amp;gt; True #This is the first example in the above link. &#xA;&#xA;[[65,47],[23,0,0],[17,23,0],[25,40,0],[6,23,17],[11,29,17],[24,0,23],[5,24,23],[19,24,28],[3,40,25],[22,43,25]]&#xA;-&amp;gt; True #This is the second example in the above link. &#xA;&#xA;[[4,4],[2,0,0],[2,2,0],[2,0,2],[1,2,2],[1,3,2],[1,3,3],[1,2,3]]&#xA;-&amp;gt; False #There are sqaures of same sizes. &#xA;&#xA;[[5,5],[3,0,0],[3,2,2],[2,0,3],[1,3,1],[1,3,0],[1,7,0]]&#xA;-&amp;gt; False #There are overlaps and voids. &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, which means that codes with least bytes win.&lt;/p&gt;&#xA;" OwnerUserId="104073" LastEditorUserId="104073" LastEditDate="2021-05-27T02:09:46.210" LastActivityDate="2021-05-27T02:09:46.210" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22391" PostTypeId="2" ParentId="2140" CreationDate="2021-05-27T18:17:06.373" Score="0" Body="&lt;h1&gt;Create a non-renewable world&lt;/h1&gt;&#xA;&lt;p&gt;In &lt;a href=&quot;https://www.minecraft.net/en-us&quot; rel=&quot;nofollow noreferrer&quot;&gt;Minecraft&lt;/a&gt;, we can split all possible items into two categories: &lt;em&gt;renewable&lt;/em&gt; and &lt;em&gt;non-renewable&lt;/em&gt;. All non-renewable items are simply items that are not renewable.&lt;/p&gt;&#xA;&lt;p&gt;Minecraft worlds are not infinite, meaning that, for some resources, there are only a finite number available. This number is often &lt;em&gt;huge&lt;/em&gt;, but it is finite. For example, &lt;a href=&quot;https://minecraft.fandom.com/wiki/Diamond_Ore&quot; rel=&quot;nofollow noreferrer&quot;&gt;diamond ore&lt;/a&gt; can only be obtained by mining blocks that are generated when the world is created, meaning that there is only a finite number of them in any given world.&lt;/p&gt;&#xA;&lt;p&gt;However, some resources can be obtained infinitely. For example, as &lt;a href=&quot;https://minecraft.fandom.com/wiki/Raid_captain&quot; rel=&quot;nofollow noreferrer&quot;&gt;Raid Captains&lt;/a&gt; will spawn indefinitely, it is possible to obtain an arbitrarily large number of &lt;a href=&quot;https://minecraft.fandom.com/wiki/Ominous_Banner&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ominous Banners&lt;/a&gt;, dropped when you kill a Raid Captain. Or, as you can create an infinite water source, and you can get infinite iron by killing &lt;a href=&quot;https://minecraft.fandom.com/wiki/Iron_golem&quot; rel=&quot;nofollow noreferrer&quot;&gt;Iron Golems&lt;/a&gt;, it is possible to get an infinite number of &lt;a href=&quot;https://minecraft.fandom.com/wiki/Water_Bucket&quot; rel=&quot;nofollow noreferrer&quot;&gt;Water Buckets&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Any resource for which it is possible to obtain an arbitrary amount of is called &lt;em&gt;renewable&lt;/em&gt;, and there are a &lt;a href=&quot;https://minecraft.fandom.com/wiki/List_of_renewable_resources&quot; rel=&quot;nofollow noreferrer&quot;&gt;lot of these&lt;/a&gt;. Any item that is not renewable is &lt;em&gt;non-renewable&lt;/em&gt;. There are &lt;a href=&quot;https://minecraft.fandom.com/wiki/Non-renewable_resource&quot; rel=&quot;nofollow noreferrer&quot;&gt;40 of these&lt;/a&gt; that are obtainable in a classic Minecraft 1.16 survival world. They are:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A Netherite Tool               Netherite Armor                Ancient Debris                 Block of Diamond              &#xA;Block of Netherite             Coal Ore                       Cobweb                         Conduit                       &#xA;Dead Bush                      Diamond                        Diamond Ore                    Dragon Egg                    &#xA;Dragon Head                    Elytra                         Emerald Ore                    Enchanted Golden Apple        &#xA;Enchantment Table              Gilded Blackstone              Gold Ore                       Heart of the Sea              &#xA;Iron Ore                       Jukebox                        Lapis Lazuli Ore               Large Fern                    &#xA;Lava Bucket                    Lodestone                      Nether Gold Ore                Netherite Ingot               &#xA;Netherite Scrap                Iron/Gold/Diamond Horse Armor  Pigstep Music Disc             Quartz Ore                    &#xA;Redstone Ore                   Shulker Box                    Shulker Shell                  Snout Banner Pattern          &#xA;Sponge                         Tall Grass                     Thing Banner Pattern           Wet Sponge              &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your task is to get as many of these 40 items as you can. &lt;code&gt;A Netherite Tool&lt;/code&gt; means any of a Netherite Sword, Pickaxe, Axe, Shovel or Hoe. &lt;code&gt;Netherite Armor&lt;/code&gt; is any of a Netherite helmet, Chestplate, Leggings or Boots. &lt;code&gt;Iron/Gold/Diamond Horse Armor&lt;/code&gt; means that any of these three are acceptable. Leather Horse Amor is not.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;You should create a vanilla Minecraft Java Edition world, in 1.16.5, in Hardcore difficulty. You then have until you die in that world to collect all 40 of these items, or as many as you can. You should provide a double chest containing 1 of each of these and nothing else.&lt;/p&gt;&#xA;&lt;p&gt;In order to verify attempts, you should provide the &lt;a href=&quot;https://gaming.stackexchange.com/q/14702/203063&quot;&gt;save file&lt;/a&gt; of your world, as a &lt;a href=&quot;https://en.wikipedia.org/wiki/ZIP_(file_format)&quot; rel=&quot;nofollow noreferrer&quot;&gt;zip file&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The user who gets the most of these 40 items before dying wins. If multiple users get all 40 items, the user who gets all 40 within the fewest &lt;a href=&quot;https://minecraft.fandom.com/wiki/Daylight_cycle&quot; rel=&quot;nofollow noreferrer&quot;&gt;in-game days&lt;/a&gt;, which can be found by pressing F3.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may not change the game rules of the world from the default, nor may you change any other option during world creation aside from the seed. To be fully clear, you may change exactly 3 things from the default values after clicking &amp;quot;Create New World&amp;quot;:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The name of the world&lt;/li&gt;&#xA;&lt;li&gt;The gamemode, switching from Survival to Hardcore&lt;/li&gt;&#xA;&lt;li&gt;Optionally, the seed, which may be any value of your choosing&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;While in the world, you may not enable commands. This is typically done by pausing the game, opening the world to LAN and enabling commands, but, regardless of how you may do it, enabling commands is completely forbidden.&lt;/li&gt;&#xA;&lt;li&gt;You may not use any mods, datapacks or anything else that can modify the default behaviour of the game. Texture packs are perfectly fine.&lt;/li&gt;&#xA;&lt;li&gt;I will be testing and confirming each world submitted, so you should not include anything in the save file that isn't generated by the world. You may not edit the save file directly, only by interacting with the world&lt;/li&gt;&#xA;&lt;li&gt;Items are allowed to be enchanted, renamed or otherwise legitimately modified in game&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Additionally, as of snapshot &lt;a href=&quot;https://minecraft.fandom.com/wiki/Java_Edition_21w20a&quot; rel=&quot;nofollow noreferrer&quot;&gt;21w20a&lt;/a&gt;, there are 18 new non-renewable resources (ignoring products from Deepslate and Cobbled Deepslate), and Lava Buckets are noew renewable:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Block Of Raw Copper        Block Of Raw Gold         &#xA;Block Of Raw Iron          Budding Amethyst          &#xA;Calcite                    Cobbled Deepslate         &#xA;Copper Ore                 Deepslate                 &#xA;Deepslate Diamond Ore      Deepslate Gold Ore        &#xA;Deepslate Iron Ore         Deepslate Lapis Lazuli Ore&#xA;Deepslate Redstone Ore     Raw Copper                &#xA;Raw Gold                   Raw Iron                  &#xA;Spore Blossom              Tuff     &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This brings the total number of non-renewable items in the latest version to 57&lt;/p&gt;&#xA;&lt;p&gt;I will offer a +500 bounty to a submission which &lt;strong&gt;also&lt;/strong&gt; includes a save file for a world which:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is a vanilla Minecraft Java Edition snapshot 21w20a Hardcore world&lt;/li&gt;&#xA;&lt;li&gt;Meets the requirements for the main challenge&lt;/li&gt;&#xA;&lt;li&gt;Has 3 chests with all 57 non-renewable items, as listed above&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Are there any ways this can be exploited, so that users can trivialise the task? How can I prevent those exploits?&lt;/li&gt;&#xA;&lt;li&gt;Is it a good challenge?&lt;/li&gt;&#xA;&lt;li&gt;Tags are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/minecraft&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;minecraft&amp;#39;&quot; rel=&quot;tag&quot;&gt;minecraft&lt;/a&gt; (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/22330/tag-proposal-minecraft&quot;&gt;meta discussion&lt;/a&gt;). Any suggestions?&lt;/li&gt;&#xA;&lt;li&gt;Minecraft is &lt;a href=&quot;https://www.minecraft.net/en-us/get-minecraft&quot; rel=&quot;nofollow noreferrer&quot;&gt;not free&lt;/a&gt;, thus limiting those who can compete. Is this a significant problem?&lt;/li&gt;&#xA;&lt;li&gt;Any further feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-05-27T18:37:38.737" LastActivityDate="2021-05-27T18:37:38.737" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="22392" PostTypeId="2" ParentId="2140" CreationDate="2021-05-28T03:51:19.693" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/226609/compute-the-generalised-xor&quot;&gt;Compute the generalised XOR (posted)&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96156" LastEditorUserId="96156" LastEditDate="2021-06-01T04:01:54.777" LastActivityDate="2021-06-01T04:01:54.777" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22394" PostTypeId="2" ParentId="2140" CreationDate="2021-05-28T16:34:40.103" Score="0" Body="&lt;h1&gt;&lt;code&gt;for (a.length of a)&lt;/code&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javascript&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;A recent &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/conversation/js-array-looping-jankiness&quot;&gt;conversation in The Nineteenth Byte&lt;/a&gt; about language design brought about discussion of an &amp;quot;interesting&amp;quot; snippet of JavaScript code:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;for (a.length of a) console.log(a)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This loops over the elements of &lt;code&gt;a&lt;/code&gt;, but assigns each element to the length of &lt;code&gt;a&lt;/code&gt;, and prints out &lt;code&gt;a&lt;/code&gt; on each iteration.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When an array's length is assigned, it is resized to the length, with excess elements being removed from the end, and additional elements filled with &lt;code&gt;undefined&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;When an array's length is assigned to &lt;code&gt;undefined&lt;/code&gt;, an error occurs&lt;/li&gt;&#xA;&lt;li&gt;The loop will halt if the number of iterations is ever greater than &lt;code&gt;a.length&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Depending on the contents of &lt;code&gt;a&lt;/code&gt;, this produces some wild results.&lt;/p&gt;&#xA;&lt;p&gt;TODO: finish this post. Posted without finishing to test if Redwolf Program's Sandbox Posts bot is working :)&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2021-05-28T16:34:40.103" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22395" PostTypeId="2" ParentId="2140" CreationDate="2021-05-28T16:35:13.263" Score="0" Body="&lt;h1&gt;Is someone eavesdropping? (WIP)&lt;/h1&gt;&#xA;&lt;p&gt;Alice and Bob, who are quantum physicists, are being watched by Eve, a quantum FBI agent. Eve has quantum tunneled underneath Bob's house and is tapping all his quantum channels. Luckily, Alice and Bob are using the &lt;a href=&quot;https://en.wikipedia.org/wiki/BB84&quot; rel=&quot;nofollow noreferrer&quot;&gt;BB84 protocol&lt;/a&gt; to exchange quantum keys to encode their quantum messages. Your job is to write a program/function to help Alice and Bob determine if Eve is evesdropping.&lt;/p&gt;&#xA;" OwnerUserId="95792" LastEditorUserId="95792" LastEditDate="2021-10-31T21:04:24.407" LastActivityDate="2021-10-31T21:04:24.407" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22396" PostTypeId="2" ParentId="14636" CreationDate="2021-05-28T18:16:21.897" Score="4" Body="&lt;h1&gt;Yes, as an ordinary feed in TNB&lt;/h1&gt;&#xA;&lt;p&gt;We have feeds for quite a few things that aren't as important. I can't see answers to Hello, world! being posted more often than, e.g., the sandbox, so it'll hardly be annoying.&lt;/p&gt;&#xA;&lt;p&gt;All of the other feeds in TNB are posted in chat, and there haven't been many issues with that. Using a ticker feed breaks consistency, and for very little gain (in my opinion).&lt;/p&gt;&#xA;&lt;p&gt;The benefits of this are mostly the same as caird's answer. We already typically have a moderator active in the room, as well as a number of active ROs, so any particularly annoying posts can be deleted or moved.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-05-28T18:16:21.897" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22398" PostTypeId="2" ParentId="2140" CreationDate="2021-05-29T01:39:57.070" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/229765/66833&quot;&gt;Demonstrate some advanced abstract algebra&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-15T20:19:27.140" LastActivityDate="2021-06-15T20:19:27.140" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="22400" PostTypeId="2" ParentId="2140" CreationDate="2021-05-29T11:14:41.727" Score="0" Body="&lt;h1&gt;Convert Lambda Calculus to SKI-notation&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Lambda_calculus&quot; rel=&quot;nofollow noreferrer&quot;&gt;Lambda calculus&lt;/a&gt; is a formal system in mathematical logic for expressing computation based on function abstraction and application using variable binding and substitution.&lt;/p&gt;&#xA;&lt;p&gt;However, it's possible to translate pure lambda calculus into SKI-notation. This can be preformed by building an AST for the lambda calculus, converting it through multiple substitution steps where it contains a mixture of lambda calculus and SKI-notation, until a pure SKI-notation expression is reached.&lt;/p&gt;&#xA;&lt;p&gt;As this is code golf, there is some flexibility on your I/O so that you may be able to accept the lambda calculus and output the SKI-notation as a tree but the examples will use a string-based notation.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;(c1)&lt;/code&gt;, where &lt;code&gt;c1&lt;/code&gt; is an arbitrary expression that does not contain a lambda (represented here by &lt;code&gt;&amp;gt;&lt;/code&gt;), does not require further substitution.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(c1(c2))&lt;/code&gt;, where &lt;code&gt;c1&lt;/code&gt; and &lt;code&gt;c2&lt;/code&gt; are arbitrary expressions, can be substituted with &lt;code&gt;(s1(s2))&lt;/code&gt;, where &lt;code&gt;s1&lt;/code&gt; and &lt;code&gt;s2&lt;/code&gt; are the result of performing any necessary substitutions on &lt;code&gt;c1&lt;/code&gt; and &lt;code&gt;c2&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(x1&amp;gt;x1)&lt;/code&gt; can be substituted with &lt;code&gt;I&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(x1&amp;gt;c1)&lt;/code&gt; (where &lt;code&gt;c1&lt;/code&gt; can be an arbitrary expression as long as it does not contain a reference to &lt;code&gt;x1&lt;/code&gt;) can be substituted with &lt;code&gt;(Ks1)&lt;/code&gt;, where &lt;code&gt;s1&lt;/code&gt; is the result of performing any necessary substitutions on &lt;code&gt;c1&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(x1&amp;gt;(x2&amp;gt;x1))&lt;/code&gt; can be substituted with &lt;code&gt;K&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(x1&amp;gt;(x2&amp;gt;e1))&lt;/code&gt; (where &lt;code&gt;e1&lt;/code&gt; is an arbitrary expression that is depends on but is not &lt;code&gt;x1&lt;/code&gt;) can be substituted by performing substitutions on &lt;code&gt;(x2&amp;gt;e1)&lt;/code&gt; resulting in &lt;code&gt;s2&lt;/code&gt; and then performing substitutions on &lt;code&gt;(x1&amp;gt;s2)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(x1&amp;gt;c1(e2))&lt;/code&gt; (where &lt;code&gt;c1&lt;/code&gt; can be an arbitrary expression as long as it does not contain a reference to &lt;code&gt;x1&lt;/code&gt;) can be substituted with &lt;code&gt;(s1(s2))&lt;/code&gt;, where &lt;code&gt;s1&lt;/code&gt; and &lt;code&gt;s2&lt;/code&gt; are the result of performing any necessary substitutions on &lt;code&gt;c1&lt;/code&gt; and &lt;code&gt;(x1&amp;gt;e2)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(x1&amp;gt;e1(e2))&lt;/code&gt; can be substituted with &lt;code&gt;(S(s1)(s2))&lt;/code&gt;, where &lt;code&gt;s1&lt;/code&gt; and &lt;code&gt;s2&lt;/code&gt; are the result of performing any necessary substitutions on &lt;code&gt;(x1&amp;gt;e1)&lt;/code&gt; and &lt;code&gt;(x1&amp;gt;e2)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Naturally function application associates left-to-right, so in the case of &lt;code&gt;(x1&amp;gt;c1(c2)(e3)(c4))&lt;/code&gt; this needs to be substituted using the last rule as if it was &lt;code&gt;(x1&amp;gt;(c1(c2)(e2))(c4))&lt;/code&gt;, which requires generating substitutions for &lt;code&gt;(x1&amp;gt;c1(c2)(e2))&lt;/code&gt; and &lt;code&gt;(x1&amp;gt;c4)&lt;/code&gt;, but then &lt;code&gt;(x1&amp;gt;c1(c2)(e2))&lt;/code&gt; can use the penultimate rule, turning into &lt;code&gt;c1(c2)(x1&amp;gt;e2)&lt;/code&gt;, with &lt;code&gt;(x1&amp;gt;e2)&lt;/code&gt; still needing to be substituted.&lt;/p&gt;&#xA;&lt;p&gt;Given an input expression of lambda calculus, please convert it to SKI-notation. You must use the above substitutions at a minimum, but you can perform additional reductions if you wish, so for instance if you use a string-based notation then you may simplify &lt;code&gt;((S)(K))&lt;/code&gt; to &lt;code&gt;(SK)&lt;/code&gt; or even &lt;code&gt;SK&lt;/code&gt; depending on context.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2021-05-29T11:14:41.727" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="22401" PostTypeId="2" ParentId="2447" CreationDate="2021-05-29T19:26:24.483" Score="9" Body="&lt;h1&gt;Mappings may be used in place of functions&lt;/h1&gt;&#xA;&lt;p&gt;(&lt;a href=&quot;https://chat.stackexchange.com/rooms/240/conversation/mappings&quot;&gt;Discussion in The Nineteenth byte&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;p&gt;Whenever a function is expected, a mapping such as a dictionary/hashmap or array may be used instead.&lt;/p&gt;&#xA;&lt;p&gt;Arguments for:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;in many languages, there is no syntax difference (K, MATLAB, Ruby - a &lt;code&gt;Proc&lt;/code&gt; can be used with the same &lt;code&gt;[]&lt;/code&gt; syntax as a &lt;code&gt;Hash&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;disallowing it borders on an &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11197&quot;&gt;unobservable requirement&lt;/a&gt;, particularly in the above languages, and having different rules for different languages is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10003&quot;&gt;generally discouraged&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;it allows removing boilerplate in challenges which boil down to &amp;quot;construct a mapping and then look up into it&amp;quot;, like (Python) &lt;code&gt;lambda x:{k:v for k,v in ...}[x]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Arguments against:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;it feels a bit cheaty to me&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2021-05-29T19:26:24.483" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="22402" PostTypeId="2" ParentId="2140" CreationDate="2021-05-30T01:32:40.230" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/229399/remove-all-smalltalk-comments-for-code-golf&quot;&gt;Remove All Comments From Smalltalk for Code Golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Duplicate?&lt;/h2&gt;&#xA;&lt;h2&gt;Edge cases?&lt;/h2&gt;&#xA;&lt;h2&gt;Not interesting/challenging?&lt;/h2&gt;&#xA;&lt;h2&gt;Tags?&lt;/h2&gt;&#xA;" OwnerUserId="90614" LastEditorUserId="90614" LastEditDate="2021-06-10T13:09:53.397" LastActivityDate="2021-06-10T13:09:53.397" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="22403" PostTypeId="2" ParentId="2140" CreationDate="2021-05-30T06:02:40.013" Score="0" Body="&lt;h1&gt;Can we measure time?&lt;/h1&gt;&#xA;&lt;p&gt;You have 2 hourglasses with sand lying at bottom in both of hourglass, one that is &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; sec hourglass(call it &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;) and other is &lt;span class=&quot;math-container&quot;&gt;\$\sqrt2\$&lt;/span&gt; sec hourglass (call it &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;)&lt;/p&gt;&#xA;&lt;p&gt;(A hourglass is said to be n second hour glass if time taken by all of the sand of hourglass to fall from top to bottom is n second)&lt;/p&gt;&#xA;&lt;p&gt;Now we are given 2 integers &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; such that&#xA;&lt;span class=&quot;math-container&quot;&gt;$$T=a+b\sqrt2 &amp;gt; 0$$&lt;/span&gt;&#xA;assume:$$\ 1000000\geq a \geq -1000000$$&lt;/p&gt;&#xA;&lt;p&gt;$$\ 1000000\geq b \geq -1000000$$&lt;/p&gt;&#xA;&lt;p&gt;we need to respond that can we measure this time  &lt;span class=&quot;math-container&quot;&gt;\$T\$&lt;/span&gt; with our hourglasses? (&amp;quot;YES&amp;quot; or &amp;quot;NO&amp;quot;)&lt;/p&gt;&#xA;&lt;p&gt;Some clarifications and definitions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;We say we can measure time &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt; if at that instance in at least one of hourglass sand have just stopped falling.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;We can make a hourglass upside down(any number of time) if and only if at least one of the hour glass has empty top.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Assume time taken to invert a hourglass is 0 sec.(by invert means upside down,i.e the sand that was in bottom is now at top and the sand at top is now at bottom).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If at least one of hourglass sand have just stopped falling we can report this instant as the amount of time measured.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If sand on both the hour glass is at bottom and we decided to do no any operation, then it is assumed that we are reporting the time measured at this instance and the process stops.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Example 1:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$a=0\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$b=1\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Our answer is true, because initially both the hourglass is given with sand at bottom and  at the start we can invert B, so when the sand from B has fallen all to bottom at that instance a total of &lt;span class=&quot;math-container&quot;&gt;\$\sqrt2\$&lt;/span&gt; time has passed and we can report it,hence we have measured &lt;span class=&quot;math-container&quot;&gt;\$\sqrt2\$&lt;/span&gt; time.&lt;/p&gt;&#xA;&lt;p&gt;Example 2:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$ a=-1\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$b=2\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$T = -1 +\sqrt2\$&lt;/span&gt;&#xA;Our answer is true, we can obtain it as follows:&#xA;At time 0, turn both A and B upside down, At 1 sec A will be emptied to bottom, turn A upside down again (B remain falling as it was), now when B fall completely,turn A upside down, now when A empties the total duration is &lt;span class=&quot;math-container&quot;&gt;\$-1 +\sqrt2\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;1(All the A falls, at this instance B is left with &lt;span class=&quot;math-container&quot;&gt;\$-1+\sqrt2\$&lt;/span&gt; )&#xA;&lt;span class=&quot;math-container&quot;&gt;$$+$$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$\sqrt2\$&lt;/span&gt;-1 (at this duration after the previous one B have fallen completely and A is left with &lt;span class=&quot;math-container&quot;&gt;\$1-(-1+\sqrt2)\$&lt;/span&gt;  at top, but we have inverted it so that means A is actually left with &lt;span class=&quot;math-container&quot;&gt;\$-1+\sqrt2\$&lt;/span&gt; at top)&#xA;&lt;span class=&quot;math-container&quot;&gt;$$+$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$-1+\sqrt2\$&lt;/span&gt; (at this duration after the previous one A have fallen completely)&lt;/p&gt;&#xA;&lt;p&gt;we can report this instant, the total time is:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$(1)+(-1+\sqrt2)+(-1+\sqrt2)=-1 +2\sqrt2 \$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;And for following input it is not possible to measure and you have to output &amp;quot;NO&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$a=11\$&lt;/span&gt; , &lt;span class=&quot;math-container&quot;&gt;\$b=-5\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$a=35\$&lt;/span&gt; , &lt;span class=&quot;math-container&quot;&gt;\$b=-21\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$a=-4\$&lt;/span&gt; , &lt;span class=&quot;math-container&quot;&gt;\$b=4\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$a=-8815\$&lt;/span&gt; , &lt;span class=&quot;math-container&quot;&gt;\$b=6261\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$a=-1\$&lt;/span&gt; , &lt;span class=&quot;math-container&quot;&gt;\$b=1\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;.&#xA;.&#xA;.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The idea of this problem is not my original, it appeared in a coding competition some time back.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="103688" LastEditorUserId="95792" LastEditDate="2021-06-10T01:04:07.720" LastActivityDate="2021-06-10T01:04:07.720" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22404" PostTypeId="2" ParentId="2140" CreationDate="2021-05-30T07:04:34.700" Score="0" Body="&lt;h1&gt;Is this  a trivial brainfuck NOP? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/halting-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;halting-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;halting-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/brainfuck&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;brainfuck&amp;#39;&quot; rel=&quot;tag&quot;&gt;brainfuck&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Brainfuck is Turing-complete&lt;sup&gt;&lt;a href=&quot;https://t.pxeger.com/xs.html?t=ackchyually&amp;amp;v=well,+except+for+the+3000+cell+limit+that+the+original+spec+imposed,+and+the+obvious+limits+of+practical+computation&quot; rel=&quot;nofollow noreferrer&quot;&gt;*&lt;/a&gt;&lt;/sup&gt;, which means determining the behaviour of an arbitrary program is undecidable. However, we can get arbitrarily close to this if we limit ourselves to detecting a limited subset of programs.&lt;/p&gt;&#xA;&lt;p&gt;For this challenge, we will detect a limited subset of NOPs - that is, snippets of programs which have no effect including on the brainfuck interpreter's state - which I have declared &amp;quot;trivial NOPs&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;Here is a recursive definition of a trivial NOP:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the empty string is a trivial NOP&lt;/li&gt;&#xA;&lt;li&gt;snippets consisting only of characters outside the set &lt;code&gt;[]&amp;lt;&amp;gt;+-,.&lt;/code&gt; (that is, characters which are ignored in Brainfuck), are trivial NOPs&lt;/li&gt;&#xA;&lt;li&gt;the concatenation of two trivial NOPs is also a trivial NOP&lt;/li&gt;&#xA;&lt;li&gt;snippets of any of the following forms, where &lt;code&gt;X&lt;/code&gt; is another trivial NOP, are also trivial NOPs:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;+X-&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;-X+&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;lt;X&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;gt;X&amp;lt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;We will assume brainfuck has unlimited tape length. Overflow also does not need to be considered, because if a cell rolls over due to a &lt;code&gt;+&lt;/code&gt;, a &lt;code&gt;-&lt;/code&gt; can then underflow it back and it will still be a NOP.&lt;/p&gt;&#xA;&lt;p&gt;Any snippet containing &lt;code&gt;,&lt;/code&gt; or &lt;code&gt;.&lt;/code&gt; is not a NOP because it performs impure I/O, and any snippet containing &lt;code&gt;[&lt;/code&gt; or &lt;code&gt;]&lt;/code&gt; is undecidable, so must be assumed to be not a NOP.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to, given a brainfuck snippet as a string or list of characters, determine whether it is a trivial NOP, and output two distinct values corresponding to true and false.&lt;/p&gt;&#xA;&lt;h2&gt;Test-cases&lt;/h2&gt;&#xA;&lt;h3&gt;Truthy&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;(empty string)&#xA;a&#xA;+-&#xA;&amp;lt;&amp;gt;-+&#xA;&amp;lt;!&amp;gt;&#xA;+&amp;lt;-+&amp;gt;-&#xA;&amp;lt;&amp;lt;&amp;lt;+++a+--++&amp;gt;&amp;gt;&amp;lt;-+&amp;gt;&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Falsey&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;+&amp;gt;+&amp;lt;-&amp;gt;-             (note: even though this is a NOP, it's not a trivial NOP)&#xA;+&amp;lt;-+&amp;gt;-[]&#xA;,+&amp;lt;-+&amp;gt;-&#xA;&amp;lt;.&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may assume the input string always consists only of printable ASCII excluding space&lt;/li&gt;&#xA;&lt;li&gt;You may use &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447&quot;&gt;any reasonable I/O method&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Can you think of any other classes of brainfuck snippet that are simple to detect as doing nothing?&lt;/li&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Is this clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Any other feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2021-05-31T14:52:07.673" LastActivityDate="2021-05-31T14:52:07.673" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22405" PostTypeId="2" ParentId="2140" CreationDate="2021-05-30T16:13:19.373" Score="0" Body="&lt;h1&gt;Conic Sections (simplified)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/characteristics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;characteristics&amp;#39;&quot; rel=&quot;tag&quot;&gt;characteristics&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Given the equation of a non-parabolic conic section, output its characteristics.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Spec&lt;/h1&gt;&#xA;&lt;p&gt;This assumes prior knowledge of hyperbolas and ellipses, as well as their characteristics. (This includes circles; they are a special case of the ellipse with eccentricity of zero.)&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;A non-parabolic (to simplify things) conic section given in the standard equation form. To simplify things further (because the main point is not to perform linear algebra magic) there will be no &lt;code&gt;xy&lt;/code&gt; term. This is an example of a valid equation:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;x^2+6x+y^2-8y+15=0 // string form&#xA;[1,6,1,-8,15]      // array form&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;These are not:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;x^3+5x^2+7x+4=0 // because the degree of the equation is 2&#xA;x^2+5xy+y^2-4=0 // because there should be no `xy` term&#xA;x^2+3x+7=0      // because there should be `x` and `y` terms.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that the conic section can also be taken as an array as shown above. If so, please specify the order of the array; I am flexible when it comes to this format, As long as there are 5 elements with nonexistent terms represented by zero (like no &lt;code&gt;y&lt;/code&gt; term in &lt;code&gt;x^2+5x+y^2+14=0&lt;/code&gt;) and that the terms they represent are &lt;code&gt;x^2 x y^2 y c&lt;/code&gt; where &lt;code&gt;c&lt;/code&gt; is a constant. The equation will always be &lt;code&gt;&amp;lt;expression&amp;gt; = 0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Output should be the type of section, center, horizontal radius, vertical radius, foci and eccentricity (in whatever desired order). This can be output as a string or an array as long as it is clear. A valid output for &lt;code&gt;x^2+6x+y^2+8y+16=0&lt;/code&gt; (or its array equivalent) would be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;quot;ellipse&amp;quot;, [-3, -4], 3, 3, [[-3, -4]], 0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ellipse&#xA;-3 -4&#xA;3&#xA;3&#xA;-3 -4&#xA;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or similar.&lt;/p&gt;&#xA;&lt;p&gt;(no need to output &amp;quot;circle&amp;quot; because it is a special case of the ellipse)&lt;/p&gt;&#xA;&lt;h2&gt;Meta:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;duplicate?&lt;/li&gt;&#xA;&lt;li&gt;should I edit in info on conic sections?&lt;/li&gt;&#xA;&lt;li&gt;should I create the &lt;code&gt;characteristics&lt;/code&gt; tag?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user100690" LastActivityDate="2021-05-30T16:13:19.373" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22406" PostTypeId="2" ParentId="2140" CreationDate="2021-05-30T18:28:40.043" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/229445/but-is-it-art&quot;&gt;But, Is It Art?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-10T22:04:02.167" LastActivityDate="2021-06-10T22:04:02.167" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22407" PostTypeId="2" ParentId="5243" CreationDate="2021-05-31T04:24:11.903" Score="10" Body="&lt;h1 id=&quot;rep-for-answers-to-bubblers-challenges-in-any-of-previous-lotm-languages-qrgf&quot;&gt;50-500 rep for answers to Bubbler's challenges in any of previous LotM languages&lt;/h1&gt;&#xA;&lt;p&gt;LotM languages often go inactive again after the event ends, so here is an attempt to keep them alive (or revive?).&lt;/p&gt;&#xA;&lt;p&gt;I (Bubbler) will award 50-500 rep for answering one of my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, non-&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; challenges in previous LotM languages.&lt;/p&gt;&#xA;&lt;p&gt;An answer is eligible for this bounty if:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the challenge is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, non-&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;, and at least a week old (&lt;a href=&quot;https://codegolf.stackexchange.com/search?tab=newest&amp;amp;q=user%3a78410%20is%3aq%20%5bcode-golf%5d%20-%5btips%5d%20created%3a..7d&quot;&gt;search query&lt;/a&gt;),&lt;/li&gt;&#xA;&lt;li&gt;the language used was on LotM before,&lt;/li&gt;&#xA;&lt;li&gt;there isn't another endless bounty that awards answers in that language (so &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/21948/78410&quot;&gt;Whispers&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/22137/78410&quot;&gt;Vyxal&lt;/a&gt; are out), and&lt;/li&gt;&#xA;&lt;li&gt;the challenge didn't have any other answer in the same language before it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Also, if you have &lt;strong&gt;5,000&lt;/strong&gt; rep or higher, I won't award the bounty for solving Easy or Medium challenges.&lt;/p&gt;&#xA;&lt;p&gt;The bounty value will be decided as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Base value (depends on the language used)&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;+50&lt;/strong&gt;: Brachylog, MATL, Japt, R, Husk, Rust, Scala, Factor, Red&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;+100&lt;/strong&gt;: QBasic, Forth, Vim&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;+200&lt;/strong&gt;: Brain-Flak, SMBF&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Multiplier (depends on the difficulty of the challenge)&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;×0.5&lt;/strong&gt;: Easy&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;×1.0&lt;/strong&gt;: Medium&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;×2.0&lt;/strong&gt;: Hard&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;×4.0&lt;/strong&gt;: Insane&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;+500&lt;/strong&gt; (fixed value, regardless of language): Higher than Insane&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Extra bonus (additive) if the answer is exceptionally good or interesting to me&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3 id=&quot;notes-jw8n&quot;&gt;Notes&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I won't award the bounty if the value goes below 50 (or the minimum value I can award on the challenge), and the bounty value is capped at 500.&lt;/li&gt;&#xA;&lt;li&gt;I don't have a fixed difficulty assigned to my challenges (yet). I'll try to be consistent though. You may generally assume a challenge is at least Hard if it has relatively high score and very few answers (and definitely Easy if it has very many short answers).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2 id=&quot;awarded-bounties-o411&quot;&gt;Awarded Bounties&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;(none yet)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2 id=&quot;bounty-requests-ud92&quot;&gt;Bounty Requests&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Please edit in bounty requests here below the template, with relevant links.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/95792/user&quot;&gt;user&lt;/a&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/a/231728/95792&quot;&gt;Forth and Vim&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/159755/95792&quot;&gt;This code errors on &lt;em&gt;this&lt;/em&gt; and &lt;em&gt;that&lt;/em&gt;, is it really written in them?&lt;/a&gt; (50 rep probably)&lt;/li&gt;&#xA;&lt;li&gt;Template: &lt;code&gt;[Username](link): [Answer](link) to [Challenge title](link)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="95792" LastEditDate="2021-07-24T16:35:17.283" LastActivityDate="2021-07-24T16:35:17.283" CommentCount="2" CommunityOwnedDate="2021-05-31T04:24:11.903" ContentLicense="CC BY-SA 4.0" />
  <row Id="22408" PostTypeId="2" ParentId="2140" CreationDate="2021-05-31T04:38:06.293" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/226591/66833&quot;&gt;Pickleball Doubles Scoring&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="12480" LastEditorUserId="66833" LastEditDate="2021-06-01T15:15:26.230" LastActivityDate="2021-06-01T15:15:26.230" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="22409" PostTypeId="2" ParentId="2140" CreationDate="2021-05-31T07:56:44.273" Score="2" Body="&lt;h1&gt;Determine Centrosymmetric String&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Let's define a centrosymmetric string as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;First, add spaces to the end of each line to make the input a rectangle &lt;span class=&quot;math-container&quot;&gt;\$ A_{m×n} \$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The input is &amp;quot;centrosymmetric&amp;quot; string if and only if you get the original rectangle if you rotate the rectangle 180°. That is, it has 2-fold rotational symmetry, so &lt;span class=&quot;math-container&quot;&gt;\$ A_{i,j}=A_{m+1-i,n+1-j} \$&lt;/span&gt; holds for all &lt;span class=&quot;math-container&quot;&gt;\$ A_{1\dots m, 1\dots n} \$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;Input a non-empty string. You may assume it:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;does not contain leading / trailing new lines;&lt;/li&gt;&#xA;&lt;li&gt;does not contain trailing spaces on any lines;&lt;/li&gt;&#xA;&lt;li&gt;only contains new line, space, and lowercase &lt;code&gt;a&lt;/code&gt;-&lt;code&gt;z&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may choose to handle any of &lt;code&gt;CR&lt;/code&gt;, &lt;code&gt;LF&lt;/code&gt;, or &lt;code&gt;CR-LF&lt;/code&gt; as the new line character in your program.&lt;/p&gt;&#xA;&lt;p&gt;Input may be in any reasonable format, including but not limited to:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A built-in string type;&lt;/li&gt;&#xA;&lt;li&gt;A NULL-terminated character array;&lt;/li&gt;&#xA;&lt;li&gt;An array of integer code-points;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Note that you are not allowed to take the string padded already as it trivialises the challenge.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Determine if the given input is a centrosymmetric string (as defined in this post), outputting two distinct values, or truthy vs. falsey values (they can be swapped relative to their normal meaning).&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;h3&gt;Truthy&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;aba&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;a&#xA;b&#xA;a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;ab&#xA;ba&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;abc&#xA;cba&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;abc&#xA;ded&#xA;cba&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;a a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;a&#xA;&#xA;a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;a&#xA;&#xA; a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;a c&#xA; b&#xA;c a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;a&#xA;&#xA; b&#xA; b&#xA;&#xA;  a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;zzzzz&#xA;   z&#xA;  z&#xA; z&#xA;zzzzz&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;n  n  oo   oo  n  n&#xA;nn n o  o o  o nn n&#xA;n nn o  o o  o n nn&#xA;n  n  oo   oo  n  n&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Falsy&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;ab&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;a&#xA;a&#xA;b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;a&#xA; b&#xA;a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;ab&#xA;ab&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;aa&#xA;bb&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;   a&#xA;  a a&#xA; aaaaa&#xA;a     a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="44718" LastEditorUserId="44718" LastEditDate="2021-06-11T05:31:19.090" LastActivityDate="2021-06-11T05:31:19.090" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="22412" PostTypeId="2" ParentId="20928" CreationDate="2021-05-31T22:09:43.880" Score="2" Body="&lt;h2&gt;When it is appropriate to do so&lt;/h2&gt;&#xA;&lt;p&gt;I think, while being slightly vague, this is an appropriate response. A good way to determine this would be to ask yourself:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the information relevant and beneficial to any on-going conversation or discussion?&lt;/li&gt;&#xA;&lt;li&gt;Does it or could it affect how users react/believe/interpret other data or information?&lt;/li&gt;&#xA;&lt;li&gt;Would other users find the information useful?&lt;/li&gt;&#xA;&lt;li&gt;Does it unnecessarily highlight actions by other users not part of the discussion, or does it unnecessarily place other users in a negative light?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If the answers to these questions are &amp;quot;Yes&amp;quot;, &amp;quot;Yes&amp;quot;, &amp;quot;Yes&amp;quot; and &amp;quot;No&amp;quot;, then the information should be alright to share. Again, once you have access to this information, Stack Exchange believes that you have demonstrated a reasonable amount of trustworthy behaviour, and that you can be trusted to appropriately use it.&lt;/p&gt;&#xA;&lt;p&gt;If you aren't sure whether it is or isn't appropriate, err on the side of caution, and don't share. If others believe that it is, they'll share it instead, and it avoids people jumping the gun because they're unsure.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, for the diamond moderators, you have been trusted with a &lt;em&gt;significant&lt;/em&gt; amount of information, as well as a large amount of trust by both the community and the network. Here, I believe the moderators are more than capable of making a sensible decision about whether or not to share a piece of information.&lt;/p&gt;&#xA;&lt;p&gt;One slight edge case is when users want to begin a discussion based on information they saw in the moderator tools. For example, noticing an &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/16272/66833&quot;&gt;odd trend in activity&lt;/a&gt;, discussing our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/22108/66833&quot;&gt;protected questions&lt;/a&gt; or addressing &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1079/66833&quot;&gt;inappropriate behaviour in the review queues&lt;/a&gt;. These are appropriate examples of where moderation data is shared, because the answers to the other three bullet points above are &amp;quot;Yes&amp;quot;, &amp;quot;Yes&amp;quot; and &amp;quot;No&amp;quot;, and the data was used to start a beneficial discussion.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-05-31T22:09:43.880" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22413" PostTypeId="2" ParentId="2140" CreationDate="2021-06-01T00:49:28.793" Score="2" Body="&lt;h1&gt;Demonstrate some easier abstract algebra&lt;/h1&gt;&#xA;&lt;p&gt;&lt;sub&gt;From my related challenge, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/22398/66833&quot;&gt;Demonstrate some advanced abstract algebra&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;p&gt;Consider a binary operator &lt;span class=&quot;math-container&quot;&gt;\$*\$&lt;/span&gt; that operates on a set &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;. For simplicity's sake, we'll assume that &lt;span class=&quot;math-container&quot;&gt;\$*\$&lt;/span&gt; is closed, meaning that its inputs and outputs are always members of &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Let's define some basic terms describing the properties of &lt;span class=&quot;math-container&quot;&gt;\$*\$&lt;/span&gt;. We can say that &lt;span class=&quot;math-container&quot;&gt;\$*\$&lt;/span&gt; can have any of these properties, if they hold for all &lt;span class=&quot;math-container&quot;&gt;\$a,b,c \in S\$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Commutative&lt;/strong&gt;: &lt;span class=&quot;math-container&quot;&gt;\$a*b = b*a\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Associative&lt;/strong&gt;: &lt;span class=&quot;math-container&quot;&gt;\$(a*b)*c = a*(b*c)\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Distributive&lt;/strong&gt;: &lt;span class=&quot;math-container&quot;&gt;\$a*(b+c) = (a*b)+(a*c)\$&lt;/span&gt;, for some binary operator &lt;span class=&quot;math-container&quot;&gt;\$+\$&lt;/span&gt; on &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;We can also define 3 related properties, for a unary operation &lt;span class=&quot;math-container&quot;&gt;\$-\$&lt;/span&gt; on &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Anti-commutative&lt;/strong&gt;: &lt;span class=&quot;math-container&quot;&gt;\$a*b = -(b*a)\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Anti-associative&lt;/strong&gt;: &lt;span class=&quot;math-container&quot;&gt;\$(a*b)*c = -(a*(b*c))\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Anti-distributive&lt;/strong&gt;: &lt;span class=&quot;math-container&quot;&gt;\$a*(b+c) = -((a*b)+(a*c))\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Finally, we define 3 more, that only describe &lt;span class=&quot;math-container&quot;&gt;\$*\$&lt;/span&gt; if the complete statement is true for &lt;span class=&quot;math-container&quot;&gt;\$a,b,c \in S\$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Non-commutative&lt;/strong&gt;: There exists &lt;span class=&quot;math-container&quot;&gt;\$a, b\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$a*b \ne b*a\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$a*b \ne -(b*a)\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Non-associative&lt;/strong&gt;: There exists &lt;span class=&quot;math-container&quot;&gt;\$a, b, c\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$(a*b)*c \ne a*(b*c)\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$(a*b)*c \neq -(a*(b*c))\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Non-distributive&lt;/strong&gt;: These exists &lt;span class=&quot;math-container&quot;&gt;\$a,b,c\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$a*(b+c) \ne (a*b)+(a*c)\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$a*(b+c) \ne -((a*b)+(a*c))\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;We now have 9 distinct properties a binary operator can have: commutativity, non-commutativity, anti-commutativity, associativity, non-associativity, anti-associativity, distributivity, non-distributivity and anti-distributivity.&lt;/p&gt;&#xA;&lt;p&gt;This does require two operators (&lt;span class=&quot;math-container&quot;&gt;\$-\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$+\$&lt;/span&gt;) to be defined on &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; as well. For this challenge we'll use standard integer negation and addition for these two, and will be using &lt;span class=&quot;math-container&quot;&gt;\$S = \mathbb Z\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Obviously, any given binary operator can only meet a maximum of 3 of these 9 properties, as it cannot be e.g. both non-associative and anti-associative.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Let's create a &amp;quot;table&amp;quot; of these properties:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Commutative&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Associative&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Distributive&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;strong&gt;Regular&lt;/strong&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Commutative&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Associative&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Distributive&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;strong&gt;Anti&lt;/strong&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Anti-commutative&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Anti-associative&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Anti-distributive&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;strong&gt;Non&lt;/strong&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Non-Commutative&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Non-associative&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Non-distributive&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;Your task is to write 3 programs (either full programs or functions. You may &amp;quot;mix and match&amp;quot; if you wish).&lt;/p&gt;&#xA;&lt;p&gt;Each of these 3 programs will:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;take two integers, in any reasonable format and method&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;output one integer, in the same format as the input and in any reasonable method&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;be non-constant. That is, there exists at least two distinct inputs that have distinct outputs.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;have exactly 3 of the 9 above properties. However, those three properties muse be in different rows and columns in the above table from each other. This means that it can be (for example) commutative, non-associative, anti-distributive; non-commutative, anti-associative, distributive; or anti-commutative, associative, non-distributive. But, it cannot be (for example) commutative, associative, distributive; non-commutative, non-associative, non-distributive; or non-commutative, anti-distributive, anti-associative.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;; the combined lengths of all 3 of your programs is your score, and you should aim to minimise this.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, you should include some form of proof that your programs do indeed have the required properties and do not satisfy the other properties. Answers without these are not considered valid.&lt;/p&gt;&#xA;&lt;p&gt;Alternatively, a proof of impossibility is a valid answer. If you can demonstrate that there are no such programs that satisfy the criteria listed above, then this proof constitutes a valid answer as well.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is pretty math-heavy, is it clear?&lt;/li&gt;&#xA;&lt;li&gt;Is this a dupe?&lt;/li&gt;&#xA;&lt;li&gt;Tags are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/open-ended-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; rel=&quot;tag&quot;&gt;open-ended-function&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/abstract-algebra&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;abstract-algebra&amp;#39;&quot; rel=&quot;tag&quot;&gt;abstract-algebra&lt;/a&gt;. Any others?&lt;/li&gt;&#xA;&lt;li&gt;Any further feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-12-21T17:27:09.657" LastActivityDate="2021-12-21T17:27:09.657" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="22414" PostTypeId="1" CreationDate="2021-06-01T01:37:32.680" Score="10" ViewCount="970" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19271/78850&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout June 2021, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://www.red-lang.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Red&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;What's a Language of the Month?&lt;/p&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/78850&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during June, those who wish to participate should learn (at least the basics of) Red, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about Red&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.red-lang.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Red&lt;/a&gt; is a next-gen language, strongly inspired by &lt;a href=&quot;http://rebol.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Rebol&lt;/a&gt;. Its unique syntax allows function calls without parentheses, including a wide range of functions.&lt;/li&gt;&#xA;&lt;li&gt;Red is language-oriented and includes several &lt;a href=&quot;https://en.wikipedia.org/wiki/Domain_specific_language&quot; rel=&quot;nofollow noreferrer&quot;&gt;DSLs&lt;/a&gt;, including a gui description language (VID and View), 2d drawing dialect (Draw) and a parsing dialect (Parse).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Red is meant to be a full-stack language. This means it includes a high-level dialect (dynamic, interpreted, but can be also compiled) and Red/system, a low level dialect for perfomance when necessary (always compiled).&lt;/li&gt;&#xA;&lt;li&gt;Red emphasizes the paradigm &amp;quot;Code is data&amp;quot;.&lt;/li&gt;&#xA;&lt;li&gt;Red doesn't have reserved words. Even conditionals and looping constructs are (&amp;quot;native&amp;quot; function) values provided by runtime, which can be assigned any names.&lt;/li&gt;&#xA;&lt;li&gt;Red has a rich set of built-in datatypes - over 50.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.red-lang.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Red home page&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://red.github.io/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;github pages&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/red/&quot; rel=&quot;nofollow noreferrer&quot;&gt;source code and other community resources&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://gitter.im/red/red&quot; rel=&quot;nofollow noreferrer&quot;&gt;gitter chat&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/124927/red&quot;&gt;Code golf SE Chatroom&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Bounty&lt;/h2&gt;&#xA;&lt;p&gt;I (&lt;a href=&quot;https://codegolf.stackexchange.com/users/90614&quot;&gt;Wezl&lt;/a&gt;) am awarding 50+ rep bounties for any user's second answer in Red &lt;em&gt;or&lt;/em&gt; &lt;a href=&quot;http://rebol.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Rebol&lt;/a&gt; &lt;em&gt;or&lt;/em&gt; &lt;a href=&quot;https://github.com/hostilefork/rebmu&quot; rel=&quot;nofollow noreferrer&quot;&gt;Rebmu&lt;/a&gt; (any scoring criterion) during the month of June.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;&lt;sup&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20716/90614&quot;&gt;nomination (will be deleted)&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="90614" LastEditorUserId="75681" LastEditDate="2021-06-13T09:48:00.403" LastActivityDate="2021-06-29T18:37:28.840" Title="Language of the Month for June 2021: Red" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="22415" PostTypeId="2" ParentId="22414" CreationDate="2021-06-01T01:46:57.410" Score="7" Body="&lt;h1&gt;List of all Red solutions posted in June 2021&lt;/h1&gt;&#xA;&lt;p&gt;Please put first posts in bold and place &amp;quot;(bounty?)&amp;quot; afterwards to request a bounty&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/186582/print-n-ne-e-se-s-sw-w-nw/226620#226620&quot;&gt;Print “N NE E SE S SW W NW”&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92116/wasif&quot;&gt;Wasif&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226668/101522&quot;&gt;Implement a Truth-Machine&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226671/101522&quot;&gt;Create a program that prints the number of characters it has, in words&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226687/101522&quot;&gt;Plot a centered circle&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226674/104280&quot;&gt;Little Endian Number to String Conversion&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104280/9214&quot;&gt;9214&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226679/104280&quot;&gt;What is the link to your answer?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104280/9214&quot;&gt;9214&lt;/a&gt; (bounty awarded +50)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226684/104280&quot;&gt;Make a ;# interpreter&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104280/9214&quot;&gt;9214&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226688/104280&quot;&gt;Plot a centered circle&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104280/9214&quot;&gt;9214&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/58891/dont-google-google/226718#226718&quot;&gt;Don&amp;#39;t google &amp;quot;google&amp;quot;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/92116/wasif&quot;&gt;Wasif&lt;/a&gt; (bounty awarded +50)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226748/101522&quot;&gt;Output with the same length as the code&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt; (bounty awarded +50)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/76604/open-the-browser-to-http-codegolf-stackexchange-com/226772#226772&quot;&gt;Open the browser to http://codegolf.stackexchange.com&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/92116/wasif&quot;&gt;Wasif&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226855/101522&quot;&gt;Write a polyglot that prints the language's name&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/228914/75681&quot;&gt;Split a list at the second occurrence of the first element&#xA;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/75681/galen-ivanov&quot;&gt;Galen Ivanov&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226889/104280&quot;&gt;Write a hello world GUI program that closes itself after three seconds&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104280/9214&quot;&gt;9214&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/228949/104280&quot;&gt;Split a list at the second occurrence of the first element&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104280/9214&quot;&gt;9214&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/228950/104280&quot;&gt;Print random integers until 0&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104280/9214&quot;&gt;9214&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/228957/101522&quot;&gt;Print the tetration&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/228975/104280&quot;&gt;Don't google “google”&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104280/9214&quot;&gt;9214&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/228978/104280&quot;&gt;Create an ascii line given length&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104280/9214&quot;&gt;9214&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/228986/104280&quot;&gt;The next colour&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104280/9214&quot;&gt;9214&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229027/80214&quot;&gt;Fibonacci function or sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229029/97916&quot;&gt;Sylvester's sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/97916/chunes&quot;&gt;chunes&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229091/88546&quot;&gt;Fibonacci function or sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/88546/dingledooper&quot;&gt;dingledooper&lt;/a&gt;&lt;/strong&gt; (bounty awarded +100)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229240/80214&quot;&gt;Shortest Code to randomly place points and connect them&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt; (bounty awarded +100)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229262/75681&quot;&gt;I'm Lazy: Close my Superparens&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/75681/galen-ivanov&quot;&gt;Galen Ivanov&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229263/104280&quot;&gt;Shortest Code to randomly place points and connect them&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104280/9214&quot;&gt;9214&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229315/88546&quot;&gt;Golf you a quine for great good!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/88546/dingledooper&quot;&gt;dingledooper&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229496/101522&quot;&gt;Output programming language name&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229537/80214&quot;&gt;Collatz's ice cream cone factory&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226765/78274&quot;&gt;Compute the generalised XOR&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78274/kirill-l&quot;&gt;Kirill L.&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226871/78274&quot;&gt;I'm Lazy*: Top-left align my text&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78274/kirill-l&quot;&gt;Kirill L.&lt;/a&gt; (bounty?)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229126/78274&quot;&gt;Taking the long route&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78274/kirill-l&quot;&gt;Kirill L.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229572/78274&quot;&gt;Decode USB packets&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78274/kirill-l&quot;&gt;Kirill L.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229657/78274&quot;&gt;Encode USB packets (part 2)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78274/kirill-l&quot;&gt;Kirill L.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229735/80214&quot;&gt;Consecutive Distance Rating&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229736/75681&quot;&gt;Consecutive Distance Rating&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/75681/galen-ivanov&quot;&gt;Galen Ivanov&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229804/75681&quot;&gt;Binomial transform&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/75681/galen-ivanov&quot;&gt;Galen Ivanov&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/230147/75681&quot;&gt;Can you give me half? (No digits)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/75681/galen-ivanov&quot;&gt;Galen Ivanov&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/230174/75681&quot;&gt;Implement a cleave function&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/75681/galen-ivanov&quot;&gt;Galen Ivanov&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/230282/80214&quot;&gt;What's missing (aka the vanilla multiset difference challenge)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/230408/80214&quot;&gt;Is this a Permutation of 1..n&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/230502/78274&quot;&gt;Print instructions for typing \` in chat&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78274/kirill-l&quot;&gt;Kirill L.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/230563/78274&quot;&gt;Create a Pride Flag&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78274/kirill-l&quot;&gt;Kirill L.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/230601/78274&quot;&gt;Write a C++ demangler&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78274/kirill-l&quot;&gt;Kirill L.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/230720/75681&quot;&gt;Get the the day of the year of a given date&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/75681/galen-ivanov&quot;&gt;Galen Ivanov&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;* Not second answer but for various reasons the bounty is for another answer.&lt;/p&gt;&#xA;&lt;h1&gt;List of all Red tips posted in June 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226780/75681&quot;&gt;Type casting&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/75681/galen-ivanov&quot;&gt;Galen Ivanov&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226826/75681&quot;&gt;More on type casting&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/75681/galen-ivanov&quot;&gt;Galen Ivanov&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226827/75681&quot;&gt;Flatten a list of lists&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/75681/galen-ivanov&quot;&gt;Galen Ivanov&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229178/90614&quot;&gt;Use &lt;code&gt;any&lt;/code&gt; to provide a default value&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/75681/galen-ivanov&quot;&gt;Galen Ivanov&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229241/80214&quot;&gt;The many uses of &lt;code&gt;collect&lt;/code&gt; and &lt;code&gt;keep&lt;/code&gt;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229279/88546&quot;&gt;String conversion with &lt;code&gt;do&lt;/code&gt;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/88546/dingledooper&quot;&gt;dingledooper&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229320/75681&quot;&gt;Use &lt;code&gt;alter&lt;/code&gt; instead of append/insert&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/75681/galen-ivanov&quot;&gt;Galen Ivanov&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/230567/75681&quot;&gt;Use some of the predefined char! values&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/75681/galen-ivanov&quot;&gt;Galen Ivanov&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/230568/75681&quot;&gt;forall instead of foreach&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/75681/galen-ivanov&quot;&gt;Galen Ivanov&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; [&amp;lt;tip title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;List of Red-related challenges posted in June 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/q/&amp;lt;question-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="90614" LastEditorUserId="75681" LastEditDate="2021-06-29T18:37:28.840" LastActivityDate="2021-06-29T18:37:28.840" CommentCount="0" CommunityOwnedDate="2021-06-01T01:46:57.410" ContentLicense="CC BY-SA 4.0" />
  <row Id="22417" PostTypeId="2" ParentId="2140" CreationDate="2021-06-01T10:12:51.900" Score="0" Body="&lt;h1&gt;What sequence? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Stack Exchange distinguishes users by a unique id that can be found in their their profile URL.&lt;/p&gt;&#xA;&lt;p&gt;You can find your id by navigating to &lt;a href=&quot;https://codegolf.stackexchange.com/users/current&quot;&gt;https://codegolf.stackexchange.com/users/current&lt;/a&gt; and finding the number after the &lt;code&gt;/users/&lt;/code&gt; bit in the resulting URL. For example, my profile URL is &lt;code&gt;https://codegolf.stackexchange.com/users/99744/alex-bries&lt;/code&gt;, so my user ID is &lt;code&gt;99744&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;You can use this id to look up the number sequence of the last submitter on OEIS:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The On-Line Encyclopedia of Integer Sequences® (&lt;a href=&quot;https://oeis.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS&lt;/a&gt;) is an online database containing integer sequences. These sequences are identified via an id starting with an A followed by 6 numbers. You can search for an id with the &amp;quot;id:&amp;quot; key on the search bar of OEIS.&lt;br /&gt;&#xA;id:A99744 will display sequence A099744 followed by all other sequences that mention it.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Your job is to write a program that, when given a number n, produces the nth number in sequence of the submitter above.&lt;/p&gt;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each language may only be used once.&lt;/li&gt;&#xA;&lt;li&gt;You may not post 2 answers in a row&lt;/li&gt;&#xA;&lt;li&gt;Every next submision may only be max 10 bytes higher than the previous one&lt;/li&gt;&#xA;&lt;li&gt;The champion is the last valid submission on june 14th&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;golfing is not a requirement but it is in your favour&lt;/p&gt;&#xA;" OwnerUserId="99744" LastEditorUserId="99744" LastEditDate="2021-06-01T19:54:15.470" LastActivityDate="2021-06-01T19:54:15.470" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="22418" PostTypeId="5" CreationDate="2021-06-01T17:29:56.510" Score="0" Body="&lt;p&gt;A bug report is considered reproduced only if the site developers have successfully reproduced the bug.&#xA;This tag should only be applied if the site developers cannot immediately address the bug, such as if&#xA;it requires further investigation into solutions or if the implementation of a fix would be stalled&#xA;for other reasons. When a fix is eventually implemented, the tag should become &lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;, or &lt;a href=&quot;/questions/tagged/status-bydesign&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-bydesign&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-bydesign&lt;/a&gt; if the behaviour is intended.&lt;/p&gt;&#xA;&lt;p&gt;This tag should be replaced by other status tags if:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/questions/tagged/status-review&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-review&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-review&lt;/a&gt;: The bug has been confirmed and is under review, either to be fixed or left&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/questions/tagged/status-planned&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-planned&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-planned&lt;/a&gt;: The bug has been confirmed, and the site developers have added it to their backlog of bugs. Unlikely to be fixed soon, but likely to be fixed eventually&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;/questions/tagged/status-deferred&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-deferred&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-deferred&lt;/a&gt;: The bug has been confirmed and will not be a priority of the site developers for a long time&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Status tags can only be applied by moderators and site developers.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-01T17:29:56.510" LastActivityDate="2021-06-01T17:29:56.510" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22419" PostTypeId="4" CreationDate="2021-06-01T17:29:56.510" Score="0" Body="Indicates that the site developers were able to replicate the behavior reported, but cannot address its cause at this time." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-01T17:29:56.510" LastActivityDate="2021-06-01T17:29:56.510" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22421" PostTypeId="2" ParentId="2140" CreationDate="2021-06-01T21:57:11.223" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/229188/im-lazy-close-my-superparens/229189#229189&quot;&gt;I'm Lazy: Close my Parens&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/balanced-string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;balanced-string&amp;#39;&quot; rel=&quot;tag&quot;&gt;balanced-string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/lisp&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;lisp&amp;#39;&quot; rel=&quot;tag&quot;&gt;lisp&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="90614" LastEditorUserId="90614" LastEditDate="2021-06-07T16:11:02.980" LastActivityDate="2021-06-07T16:11:02.980" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="22422" PostTypeId="2" ParentId="2140" CreationDate="2021-06-01T22:45:12.143" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/226755/im-lazy-top-left-align-my-text&quot;&gt;I'm Lazy*: Top-left align my text&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;matrix&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;posted&lt;/p&gt;&#xA;" OwnerUserId="90614" LastEditorUserId="90614" LastEditDate="2021-06-02T14:23:35.530" LastActivityDate="2021-06-02T14:23:35.530" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22423" PostTypeId="2" ParentId="2140" CreationDate="2021-06-01T23:08:50.230" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/226873/optimize-imnotdeadfish&quot;&gt;Optimize imnotdeadfish&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="99035" LastEditorUserId="99035" LastEditDate="2021-06-03T20:45:53.917" LastActivityDate="2021-06-03T20:45:53.917" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22424" PostTypeId="1" AcceptedAnswerId="23467" CreationDate="2021-06-02T08:37:08.710" Score="1" ViewCount="84" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/69/golf-you-a-quine-for-great-good/221399#221399&quot;&gt;My quine in Pxem&lt;/a&gt; was &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69/golf-you-a-quine-for-great-good/221399#comment523281_221399&quot;&gt;criticised as not being a quine&lt;/a&gt;, as they output their filenames, not the content of those files. A &lt;a href=&quot;https://esolangs.org/wiki/Pxem&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pxem&lt;/a&gt; program is represented as a pair of a filename and content of file.&lt;/p&gt;&#xA;&lt;p&gt;So far I have submitted three versions of quines; one requires content of file to be empty; the other two do not. Are these valid quines per our site rules?&lt;/p&gt;&#xA;&lt;p&gt;Should I consider resubmitting as distinct notation such as &lt;a href=&quot;https://github.com/hakatashi/esolang-box#pxem&quot; rel=&quot;nofollow noreferrer&quot;&gt;esolang-box&lt;/a&gt; who represents a Pxem program as a string?&lt;/p&gt;&#xA;" OwnerDisplayName="user100411" LastEditorUserId="66833" LastEditDate="2021-06-07T22:23:25.420" LastActivityDate="2021-06-07T22:23:25.420" Title="Quine in Pxem, a language whose program is represented as a pair of strings. Is outputting the filename a quine?" Tags="|discussion|quine|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="22426" PostTypeId="2" ParentId="2140" CreationDate="2021-06-02T13:45:46.720" Score="1" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/226783/construct-a-modulo-multiplication-table&quot;&gt;Construct a Modulo Multiplication Table&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="83082" LastEditorUserId="68942" LastEditDate="2021-06-03T15:15:50.593" LastActivityDate="2021-06-03T15:15:50.593" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="22427" PostTypeId="2" ParentId="2140" CreationDate="2021-06-02T14:09:08.840" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/229102/is-this-fen-board-a-fischer-random-chess-starting-board&quot;&gt;Is it a Fischer random chess starting board?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="17360" LastEditorUserId="17360" LastEditDate="2021-06-06T05:31:59.287" LastActivityDate="2021-06-06T05:31:59.287" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22428" PostTypeId="2" ParentId="16464" CreationDate="2021-06-02T14:14:01.943" Score="-1" Body="&lt;h1&gt;Suggest an edit&lt;/h1&gt;&#xA;&lt;p&gt;We have a policy of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1615/66833&quot;&gt;rejecting edits to code&lt;/a&gt;, which is a good one. However, by doing this, you will draw the attention of at least 1 user with 2000 or more reputation, via the &lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits&quot;&gt;Suggested Edits review queue&lt;/a&gt;. Appropriately describe the problem with the answer in the edit summary, and the user(s) who review it should:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Reject the edit,&lt;/li&gt;&#xA;&lt;li&gt;Navigate to the answer,&lt;/li&gt;&#xA;&lt;li&gt;Post a comment informing the answerer that there is a bug&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;A good &amp;quot;cookie-cutter&amp;quot; comment for this is&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[As pointed out](link to suggested edit review) by [{user}](link to user id), this answer has a bug. Specifically: {problem given by you in the edit summary}. I'm leaving this comment as {user} does not have the reputation to do so.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits/60281&quot;&gt;As pointed out&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80812/bubens&quot;&gt;bubens&lt;/a&gt;, this answer has a bug. Specifically, Python does not use &lt;code&gt;System.out.println&lt;/code&gt; so this doesn't work. I'm leaving this comment as bubens does not have the reputation to do so.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-06-02T14:14:01.943" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22429" PostTypeId="2" ParentId="22384" CreationDate="2021-06-02T14:39:31.500" Score="4" Body="&lt;p&gt;Most answers follow the rules and people are happy to leave a comment on ones that don't. So the restriction is unnecessary and the answers should be written clearly enough to easily detect cheating.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, I don't think it's fair to force Firefox users to use another browser, considering that private fields is only a proposal at this point.&lt;/p&gt;&#xA;" OwnerUserId="17360" LastActivityDate="2021-06-02T14:39:31.500" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22430" PostTypeId="2" ParentId="11535" CreationDate="2021-06-02T19:10:35.930" Score="1" Body="&lt;p&gt;We now have the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/error-message&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;error-message&amp;#39;&quot; rel=&quot;tag&quot;&gt;error-message&lt;/a&gt; tag, which covers this in a much more objective way than &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/error&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;error&amp;#39;&quot; rel=&quot;tag&quot;&gt;error&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-06-02T19:10:35.930" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22431" PostTypeId="2" ParentId="2140" CreationDate="2021-06-02T21:05:02.603" Score="1" Body="&lt;h1&gt;Salvage My Chemistry Homework&lt;/h1&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;I pulled an all-nighter yesterday doing my Chemistry homework. However, I now realize that was a terrible idea, because my handwriting was too sloppy and now I can’t distinguish the capital letters from the lowercase letters in my chemical formulas! This is a problem, because now the formulas can mean completely different things - for example, &lt;code&gt;co&lt;/code&gt; could be cobalt or carbon monoxide. I want to know which of the formulas in my homework are ambiguous in this manner.&lt;/p&gt;&#xA;&lt;p&gt;Since there are many formulas in the homework, I would like a program to help me so I don’t have to go over them all manually. Also, because the homework is due in an hour, I would like to have the code be as short as possible so I don't have to type as much.&lt;/p&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;A chemical formula consists of one or more 'units'. Each 'unit' consists of a symbol of an element (the list of valid symbols is given in the input) optionally followed by a number greater than 1. For example, &lt;code&gt;c&lt;/code&gt;, &lt;code&gt;co&lt;/code&gt; and &lt;code&gt;br2&lt;/code&gt; are valid units (assuming that &amp;quot;c&amp;quot;, &amp;quot;co&amp;quot; and &amp;quot;br&amp;quot; are in the list of symbols), while &lt;code&gt;c0&lt;/code&gt; and &lt;code&gt;br2r&lt;/code&gt; are not valid units.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;The input consists of&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The list of elements (all letters are lowercase)&lt;/li&gt;&#xA;&lt;li&gt;A chemical formula with all letters in lowercase&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Output an integer, the number of ways there to separate the formula into individual units.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input: ['c', 'o', 'co'], 'co2'&#xA;Output: 2 ('c o2', 'co2')&#xA;&#xA;Input: ['c', 'h', 'o', 'ch', 'oh'], 'ch3cooh'&#xA;Output: 4 ('c h3 c o o h', 'c h3 c o oh', 'ch3 c o o h', 'ch3 c o oh')&#xA;&#xA;Input: ['c'], 'c1'&#xA;Output: 0 (1 is not a valid subscript)&#xA;&#xA;Input: ['a'], 'co2'&#xA;Output: 0 (&amp;quot;c&amp;quot; and &amp;quot;co&amp;quot; are not valid symbols)&#xA;&#xA;Input: ['n', 'h', 'o', 'nh', 'no'], 'nh4no3'&#xA;Output: 4 ('n h4 n o3', 'n h4 no3', 'nh4 n o3', 'nh4 no3')&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Standard loopholes apply. All reasonable input and output methods are allowed. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, shortest code in each language wins.&lt;/p&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Would it be better to output each way to split the formula or just the number of ways?&lt;/li&gt;&#xA;&lt;li&gt;Any general wording improvements?&lt;/li&gt;&#xA;&lt;li&gt;Anything I should be more specific about?&lt;/li&gt;&#xA;&lt;li&gt;Suggested tags?&lt;/li&gt;&#xA;&lt;li&gt;Given that l4m2's question has now been posted, should I remove this? (While the challenge is similar, there are some significant differences).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/22155/103148&quot;&gt;Credit to l4m2 for original idea&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="103148" LastEditorUserId="103148" LastEditDate="2021-06-04T01:58:51.613" LastActivityDate="2021-06-04T01:58:51.613" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22432" PostTypeId="2" ParentId="1275" CreationDate="2021-06-02T23:29:55.970" Score="1" Body="&lt;h2&gt;This now exists in the form of &lt;a href=&quot;https://meta.stackexchange.com/q/345661/355458&quot;&gt;following&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;You are, as of March 2020, able to &amp;quot;follow&amp;quot; any post - question or answer - on any site. From the linked Mother Meta post:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;[Y]ou will get inbox notifications for all new answers (in the case where you followed a question), comments, edits, and notices. You will not receive notifications for any action that you performed&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-06-02T23:29:55.970" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22433" PostTypeId="2" ParentId="494" CreationDate="2021-06-03T01:32:32.940" Score="1" Body="&lt;p&gt;This is unlikely to happen on the site (via some builtin functionality). However, &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1416601/top-language-golfers?Lang=Python&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; is an SEDE query which lists the top users for a given language, plus some more interesting statistics (average score per answers, answering tenure, etc.)&lt;/p&gt;&#xA;&lt;p&gt;Additionally, you can navigate to any tag and click the &amp;quot;Top users&amp;quot; link to be taken to the &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/topusers&quot;&gt;top users in that tag&lt;/a&gt;, sorting by total net score, for both asking and answering. You might have to do some manual searching/collating to get more advanced information&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-06-03T01:32:32.940" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22435" PostTypeId="2" ParentId="13437" CreationDate="2021-06-03T04:47:50.683" Score="1" Body="&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This now provides a warning when posting a duplicate rather than automatically taking action on behalf of the user without properly making it clear to them.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-06-03T04:47:50.683" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22437" PostTypeId="2" ParentId="2140" CreationDate="2021-06-03T11:42:45.727" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/229165/yet-another-digit-insertion-problem&quot;&gt;Yet another digit insertion problem&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="103688" LastEditorUserId="103688" LastEditDate="2021-06-07T10:29:02.893" LastActivityDate="2021-06-07T10:29:02.893" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22438" PostTypeId="2" ParentId="1592" CreationDate="2021-06-03T15:12:08.443" Score="0" Body="&lt;p&gt;This issue no longer seems reproduceable / has been fixed, so I am tagging this &lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;. Please let us know if this or a similar issue arises again.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-06-03T15:12:08.443" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22440" PostTypeId="1" CreationDate="2021-06-03T16:54:06.793" Score="4" ViewCount="103" Body="&lt;p&gt;Both of these tags are active on Meta: &lt;a href=&quot;/questions/tagged/challenges&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;challenges&amp;#39;&quot; rel=&quot;tag&quot;&gt;challenges&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/questions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;questions&amp;#39;&quot; rel=&quot;tag&quot;&gt;questions&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;One has 17 questions, the other 44. One has no tag wiki, the other does. They both, more or less, ask about questions on the main site. There is, currently, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/tagged/questions+challenges&quot;&gt;no overlap in tagging&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, we have 6 tags (&lt;a href=&quot;/questions/tagged/asking-questions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;asking-questions&amp;#39;&quot; rel=&quot;tag&quot;&gt;asking-questions&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/closed-questions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;closed-questions&amp;#39;&quot; rel=&quot;tag&quot;&gt;closed-questions&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/deleted-questions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;deleted-questions&amp;#39;&quot; rel=&quot;tag&quot;&gt;deleted-questions&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/protected-questions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;protected-questions&amp;#39;&quot; rel=&quot;tag&quot;&gt;protected-questions&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/specific-question&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;specific-question&amp;#39;&quot; rel=&quot;tag&quot;&gt;specific-question&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/unanswered-questions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;unanswered-questions&amp;#39;&quot; rel=&quot;tag&quot;&gt;unanswered-questions&lt;/a&gt;) about &lt;em&gt;questions&lt;/em&gt; and 2 (&lt;a href=&quot;/questions/tagged/challenge-quality&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;challenge-quality&amp;#39;&quot; rel=&quot;tag&quot;&gt;challenge-quality&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/weekly-challenges&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;weekly-challenges&amp;#39;&quot; rel=&quot;tag&quot;&gt;weekly-challenges&lt;/a&gt;) about &lt;em&gt;challenges&lt;/em&gt;. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9439/66833&quot;&gt;Relevant meta discussion&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;What should be done about these tags? I see 3 options:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Synonymise/merge one with another&lt;/li&gt;&#xA;&lt;li&gt;Clearly distinguish the difference between the two, including editing the tag wikis to detail these differences&lt;/li&gt;&#xA;&lt;li&gt;Something else?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="68942" LastEditDate="2021-06-09T14:14:46.463" LastActivityDate="2021-06-09T14:14:46.463" Title="Is it a [question] or a [challenge]?" Tags="|discussion|tags|tag-synonyms|tag-wikis|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="22441" PostTypeId="2" ParentId="22440" CreationDate="2021-06-03T17:02:26.877" Score="4" Body="&lt;h2&gt;Merge + synonymize challenges into questions, keep the sub-tags&lt;/h2&gt;&#xA;&lt;p&gt;I've taken a look at all of the &lt;a href=&quot;/questions/tagged/challenges&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;challenges&amp;#39;&quot; rel=&quot;tag&quot;&gt;challenges&lt;/a&gt; questions, and in my opinion all of them a) could or even &lt;em&gt;should&lt;/em&gt; be put under &lt;a href=&quot;/questions/tagged/questions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;questions&amp;#39;&quot; rel=&quot;tag&quot;&gt;questions&lt;/a&gt; because they apply to all questions (including things like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;), not just challenges; or b) are classified more precisely by another tag and so the distinction doesn't matter much (e.g. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14554/can-i-redo-the-solve-rubiks-cube-challenge&quot;&gt;this question&lt;/a&gt; is more about &lt;a href=&quot;/questions/tagged/reposting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;reposting&amp;#39;&quot; rel=&quot;tag&quot;&gt;reposting&lt;/a&gt;, and the distinction between whether it's a &lt;a href=&quot;/questions/tagged/challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;challenge&lt;/a&gt; or not hardly matters).&lt;/p&gt;&#xA;&lt;p&gt;(Also, like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/22440/is-it-a-question-or-a-challenge/22441#comment74229_22440&quot;&gt;Redwolf said&lt;/a&gt;, questions is a better tag if we combine them because it includes things like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; that aren't challenges)&lt;/p&gt;&#xA;&lt;p&gt;However, the sub-tags make sense - asking questions is about general questions, closing, deleting, protecting, and unanswered all apply to questions in general, and specific-question should support all questions, not just challenges. On the other hand, quality standards for challenges are unique from not only other questions (like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;) on CGCC but on nearly the entire network (probably excluding Puzzling). Similarly, &amp;quot;weekly tips&amp;quot; doesn't make sense; that one only really applies to challenges.&lt;/p&gt;&#xA;&lt;p&gt;So my proposed/recommended course of action is such:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;synonymize and merge &lt;a href=&quot;/questions/tagged/challenges&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;challenges&amp;#39;&quot; rel=&quot;tag&quot;&gt;challenges&lt;/a&gt; into &lt;a href=&quot;/questions/tagged/questions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;questions&amp;#39;&quot; rel=&quot;tag&quot;&gt;questions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;do not change any of the remaining 8 tags&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-06-03T17:02:26.877" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22442" PostTypeId="2" ParentId="2140" CreationDate="2021-06-03T19:40:41.890" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/229155/random-prisoners-trilemma-python-3-koth&quot;&gt;Random Prisoner's Trilemma - Python 3 KOTH&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="82199" LastEditorUserId="82199" LastEditDate="2021-06-07T01:20:38.943" LastActivityDate="2021-06-07T01:20:38.943" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22443" PostTypeId="2" ParentId="2140" CreationDate="2021-06-03T20:41:15.667" Score="0" Body="&lt;h1&gt;branch golfing: sort a list by number of prime factors&lt;/h1&gt;&#xA;&lt;p&gt;Specifically, first sorted by total number of prime factors, with any&#xA;ties broken by number of unique prime factors (remove this?), then broken by size. The list will never contain 1.&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[4,5,6,9] -&amp;gt; [5,4,9,6]&#xA;[10,11,12] -&amp;gt; [11,10,12]&#xA;[360 200 12] -&amp;gt; [12 200 360]&#xA;[63 64 65] -&amp;gt; [65 63 64]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="98974" LastEditorUserId="98974" LastEditDate="2021-06-03T22:44:20.643" LastActivityDate="2021-06-03T22:44:20.643" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="22444" PostTypeId="2" ParentId="11699" CreationDate="2021-06-03T20:42:01.873" Score="1" Body="&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Based on &lt;a href=&quot;https://meta.stackexchange.com/a/307435/361699&quot;&gt;this discussion&lt;/a&gt; on Meta Stack Exchange, this is now fixed.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-06-03T20:42:01.873" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22445" PostTypeId="5" CreationDate="2021-06-04T01:09:03.970" Score="0" Body="&lt;p&gt;Stack Exchange supports snippets, which allow HTML, CSS, and JS code to be included into a code block that can be expanded and run in the browser. The leaderboard snippet is one such program which will fetch the answers on the question it is included in, and show a leaderboard ranked by byte count (since Stack Exchange itself does not support such a method).&lt;/p&gt;&#xA;&lt;p&gt;Use this tags for bugs, feature requests, or other questions about the leaderboard snippet.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-06-04T01:09:03.970" LastActivityDate="2021-06-04T01:09:03.970" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="22446" PostTypeId="4" CreationDate="2021-06-04T01:09:03.970" Score="0" Body="For questions regarding the CGCC.SE Leaderboard Stack Snippet." OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-06-04T01:09:03.970" LastActivityDate="2021-06-04T01:09:03.970" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23445" PostTypeId="1" AcceptedAnswerId="23446" CreationDate="2021-06-04T01:47:10.097" Score="10" ViewCount="102" Body="&lt;p&gt;Background information: &lt;a href=&quot;https://en.wikipedia.org/wiki/Combinatory_logic#:%7E:text=Combinatory%20logic%20is%20a%20notation,quantified%20variables%20in%20mathematical%20logic.&quot; rel=&quot;nofollow noreferrer&quot;&gt;Combinatory logic on Wikipedia&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Basically it is a model of computation closely related to lambda calculus, but using a fixed set of combinators instead of lambda abstraction. The most prominent form of this is SKI (or SK) combinator calculus, which is extensionally equivalent to lambda calculus and therefore is Turing-complete (essentially a Turing tarpit).&lt;/p&gt;&#xA;&lt;p&gt;I've identified nine challenges that are directly related to combinatory logic.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/search?q=SKI+calculus+is%3Aq&quot;&gt;Four challenges&lt;/a&gt; mentioning &amp;quot;SKI calculus&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/search?q=combinatory+is%3Aq&quot;&gt;Four challenges&lt;/a&gt; mentioning &amp;quot;combinatory&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/28758/78410&quot;&gt;One&lt;/a&gt; that is essentially BC calculus golf&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Some of these are tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/lambda-calculus&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;lambda-calculus&amp;#39;&quot; rel=&quot;tag&quot;&gt;lambda-calculus&lt;/a&gt;, but it isn't directly relevant to lambda calculus per se. So, can we have a separate tag for combinatory logic?&lt;/p&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="68942" LastEditDate="2021-06-09T05:35:15.537" LastActivityDate="2021-06-09T05:35:15.537" Title="Can we have a separate tag for combinatory logic?" Tags="|discussion|feature-request|status-completed|tags|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23446" PostTypeId="2" ParentId="23445" CreationDate="2021-06-04T01:59:26.630" Score="11" Body="&lt;h2&gt;Yes&lt;/h2&gt;&#xA;&lt;p&gt;I think this would be a useful thing to have. As outlined in the question, this isn't fully covered by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/lambda-calculus&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;lambda-calculus&amp;#39;&quot; rel=&quot;tag&quot;&gt;lambda-calculus&lt;/a&gt;, and is to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/functional-programming&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;functional-programming&amp;#39;&quot; rel=&quot;tag&quot;&gt;functional-programming&lt;/a&gt; what &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/calculus&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;calculus&amp;#39;&quot; rel=&quot;tag&quot;&gt;calculus&lt;/a&gt; (for example) is to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;. Additionally, as the example programs are split across 3 different search terms (at least), this isn't something that can be easily grouped with a single search term. Finally, there are not a large number of applicable questions, so adding this tag is unlikely to cause any edit disruption.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-04T10:32:13.943" LastActivityDate="2021-06-04T10:32:13.943" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23448" PostTypeId="2" ParentId="2140" CreationDate="2021-06-04T03:35:36.013" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/229918/94093&quot;&gt;Write a C++ demangler&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="94093" LastEditorUserId="66833" LastEditDate="2021-06-17T20:30:23.657" LastActivityDate="2021-06-17T20:30:23.657" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="23449" PostTypeId="2" ParentId="2140" CreationDate="2021-06-04T20:05:28.700" Score="-1" Body="&lt;h1&gt;Breaking BogoBogoSort (In Badness) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The title says it all - make a sorting algorithm with a time complexity of &lt;span class=&quot;math-container&quot;&gt;\$O(n!^{n!})\$&lt;/span&gt; or higher in the fewest bytes possible - as far as I can tell, that will require you to make a double exponentiatial formula or worse: that is, &lt;span class=&quot;math-container&quot;&gt;\$O(a^{b^n})\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$a, b &amp;gt; 1\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Rules (since there must be some)&lt;/h1&gt;&#xA;&lt;p&gt;The list must be returned sorted in a finite time. This can be as high or as low as you want.&lt;/p&gt;&#xA;&lt;p&gt;The algorithm must work for any real numbers (-30% if you can sort any single type given it's non-mixed).&lt;/p&gt;&#xA;&lt;p&gt;The algorithm must work of any list length, and must eventually outpace ALL &lt;span class=&quot;math-container&quot;&gt;\$O(n!^{n!})\$&lt;/span&gt; formulas, not just BogoBogoSort, and you must state the exact &lt;span class=&quot;math-container&quot;&gt;\$O\$&lt;/span&gt; growth rate (for example, &lt;span class=&quot;math-container&quot;&gt;\$O(2^{3^n})\$&lt;/span&gt;). It may start off slow, but must eventually outpace all other expo-factorial functions (as I now name this growth rate).&lt;/p&gt;&#xA;&lt;p&gt;Shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="100887" LastActivityDate="2021-06-04T20:05:28.700" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23450" PostTypeId="2" ParentId="2140" CreationDate="2021-06-04T22:08:27.613" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/240291/66833&quot;&gt;Shuffle a subsequence&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-12-29T00:54:21.793" LastActivityDate="2021-12-29T00:54:21.793" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23453" PostTypeId="2" ParentId="10991" CreationDate="2021-06-05T01:22:38.480" Score="17" Body="&lt;h1&gt;Here's an encoding for Piet programs&lt;/h1&gt;&#xA;&lt;p&gt;I've published &lt;a href=&quot;https://github.com/dloscutoff/ascii-piet&quot; rel=&quot;nofollow noreferrer&quot;&gt;an encoding (with a translator program)&lt;/a&gt; that represents a Piet program as a series of ASCII characters. It encodes each codel as one character, and therefore:&lt;/p&gt;&#xA;&lt;h2&gt;We can now count Piet programs by codels&lt;/h2&gt;&#xA;&lt;p&gt;There are 20 different colors of codels, so each color can be encoded in five bits. I've used the sixth bit of each character as a flag to indicate end-of-line, meaning that the size of the image doesn't need to be encoded separately. So any Piet program with N codels can be encoded as an N-byte text file. Since we count code by the number of bytes in the file, this means Piet can officially be counted by codels.&lt;/p&gt;&#xA;&lt;h3&gt;... Although some programs can be encoded in fewer bytes&lt;/h3&gt;&#xA;&lt;p&gt;Since end-of-line is specified for each line separately, it is possible to have uneven lines. The translator right-pads shorter lines to the length of the longest line using black codels. Therefore, black codels at the ends of lines can be omitted in the encoding. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/a/22977/16766&quot;&gt;this program&lt;/a&gt; has 18 codels, and it can be ASCII-encoded in 18 bytes:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;lldd @lldddTllddtF&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;However, since the two black codels are at the end of a line, they can also be omitted, resulting in a 16-byte ASCII version:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;lldDlldddTllddtF&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;It is up to the golfer whether they want to take advantage of this feature. It's always possible to score your program in codels, since there is always an ASCII representation with the claimed bytecount. If you want to take advantage of the black codel omission, I would suggest reporting both the number of codels and the number of bytes (and perhaps linking to the encoding as well).&lt;/p&gt;&#xA;" OwnerUserId="16766" LastActivityDate="2021-06-05T01:22:38.480" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23456" PostTypeId="1" CreationDate="2021-06-05T23:34:55.063" Score="8" ViewCount="171" Body="&lt;p&gt;&lt;strong&gt;EDIT&lt;/strong&gt; - this just happened again recently, so read it again if you're confused.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This isn't a question, it's just an update to let people know what happened.&lt;/p&gt;&#xA;&lt;p&gt;You may have noticed the meta is suddenly flooded with a ton of old posts being bumped up. You also may have noticed one or several inbox notifications about your question being edited, or trivial edits such as adding or removing a single newline from the end of the post.&lt;/p&gt;&#xA;&lt;p&gt;In the past few days, &lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/caird-coinheringaahing&quot;&gt;caird coinheringaahing&lt;/a&gt; has very helpfully been going through all of the questions tagged &lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt; but no status tags (like &lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/status-review&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-review&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-review&lt;/a&gt;, etc) and marking down which ones have already been completed but weren't tagged appropriately, or can't be reproduced, or still need community or team action. (I also went through a few but they did most of the work in this project.)&lt;/p&gt;&#xA;&lt;p&gt;I initially was going to go through these slowly and edit them a few at a time, but eventually I realized that'd take forever because meta isn't very active. So, I decided to make all of the tag edits all at once and then bump the actually important posts back up with trivial edits.&lt;/p&gt;&#xA;&lt;p&gt;If you notice a recent and important post has been totally buried that you think should be near the top, feel free to bump it again, or if you think it needs even more attention, you can flag it and I can give it some appropriate attention either via tags, featuring, or posting in chat.&lt;/p&gt;&#xA;&lt;p&gt;So, in case you were wondering what just happened to meta - basically, a &lt;em&gt;lot&lt;/em&gt; of 11.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-06-09T14:15:01.650" LastActivityDate="2021-06-09T14:15:01.650" Title="Why is meta full of old questions / why did my question get a trivial edit?" Tags="|discussion|editing|moderation|meta|" AnswerCount="0" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23457" PostTypeId="2" ParentId="2140" CreationDate="2021-06-06T06:38:43.310" Score="1" Body="&lt;h1&gt;Encode USB packets &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary&amp;#39;&quot; rel=&quot;tag&quot;&gt;binary&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/coding-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;coding-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;coding-theory&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/encoding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;encoding&amp;#39;&quot; rel=&quot;tag&quot;&gt;encoding&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/229504&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2021-06-11T19:34:37.943" LastActivityDate="2021-06-11T19:34:37.943" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23458" PostTypeId="2" ParentId="2140" CreationDate="2021-06-06T10:40:35.457" Score="2" Body="&lt;h1&gt;Decode USB packets &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary&amp;#39;&quot; rel=&quot;tag&quot;&gt;binary&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/coding-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;coding-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;coding-theory&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/encoding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;encoding&amp;#39;&quot; rel=&quot;tag&quot;&gt;encoding&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/229375/decode-usb-packets&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2021-06-10T07:16:45.667" LastActivityDate="2021-06-10T07:16:45.667" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23459" PostTypeId="2" ParentId="2140" CreationDate="2021-06-06T18:09:34.337" Score="1" Body="&lt;h1&gt;Task&lt;/h1&gt;&#xA;&lt;p&gt;You are an angry dude who manages the servers, but you are terrible in it. People often text you, and sometimes they ask why are the servers down - you got very annoyed!&lt;/p&gt;&#xA;&lt;hr&gt;Given a non-empty string. If it contains &quot;server&quot; and &quot;down&quot; (capitalization doesn't matter), you infinitely output the &gt;:( face with a newline after. If it doesn't, you only output &quot;Hi&quot; once, because you are busy and angry. &#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;p&gt;&lt;code&gt;server down&lt;/code&gt; -&amp;gt; &lt;code&gt;&amp;gt;:( (infinitely)&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;server&lt;/code&gt; -&amp;gt; &lt;code&gt;Hi&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;down&lt;/code&gt; -&amp;gt; &lt;code&gt;Hi&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;serverANDLETTERSAFTERTHEWORD down&lt;/code&gt; -&amp;gt; &lt;code&gt;&amp;gt;:( (infinitely), as it contains both server and down&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;Why are your servers down?&lt;/code&gt; -&amp;gt; &lt;code&gt;&amp;gt;:( (infinitely)&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;sErVeR dOwN&lt;/code&gt; -&amp;gt; &lt;code&gt;&amp;gt;:( (infinitely)&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;serverDowN&lt;/code&gt; -&amp;gt; &lt;code&gt;&amp;gt;:( (infinitely)&lt;/code&gt;&lt;br&gt;&#xA;&lt;code&gt;serverd0wn&lt;/code&gt; -&amp;gt; &lt;code&gt;Hi&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the answer with shortest bytes wins.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;These&lt;/a&gt; loopholes are, obviously, forbidden.&lt;/li&gt;&#xA;&lt;li&gt;Standard code-golf rules apply.&lt;/li&gt;&#xA;&lt;li&gt;Please specify the language you are using and the amount of bytes.&lt;/li&gt;&#xA;&lt;li&gt;It would be great if you would put a link to a sandbox where your code can be ran in action, such as &lt;a href=&quot;https://tio.run&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Explaining your code is very welcomed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr&gt;&lt;hr&gt;&lt;Hr&gt;&lt;hr&gt;&lt;Hr&gt;&#xA;Please comment down below if this is good enough or not, or if it's a duplicate (hope not)&#xA;" OwnerUserId="95769" LastActivityDate="2021-06-06T18:09:34.337" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23460" PostTypeId="1" AcceptedAnswerId="23461" CreationDate="2021-06-06T18:16:58.157" Score="7" ViewCount="107" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14636/66833&quot;&gt;This&lt;/a&gt; question asks about the possibility of adding a &lt;a href=&quot;https://chat.stackexchange.com/rooms/info/240/the-nineteenth-byte?tab=feeds&quot;&gt;feed&lt;/a&gt; to &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; that posts new answers to the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world&quot;&gt;Hello, World!&lt;/a&gt; thread - a typical place for people to first introduce their new programming languages.&lt;/p&gt;&#xA;&lt;p&gt;There are currently three answers to that &lt;a href=&quot;/questions/tagged/discussion&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt;, none of which are conclusive, advocating for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14638/66833&quot;&gt;&amp;quot;In a different chatroom&amp;quot;&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/22374/66833&quot;&gt;&amp;quot;Yes, as a ticker feed&amp;quot;&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/22396/66833&quot;&gt;&amp;quot;Yes, as a message feed&amp;quot;&lt;/a&gt;. The first one was posted 3 years ago, its current room suggestions are unfeasible (frozen for years due to inactivity) and is unlikely to be of any success - chat rooms outside of TNB are unlikely to succeed. However, the other two advocate for a system which may prove to be disruptive or irritating. This has lead to an inconclusive and somewhat partially outdated discussion, that could do with a definitive answer&lt;/p&gt;&#xA;&lt;p&gt;Therefore, this is designed to be that &lt;em&gt;conclusive&lt;/em&gt; opinion on this &lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt;. Post your opinions below, with definitive answers and we can settle this discussion after 3 years.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="68942" LastEditDate="2021-06-08T03:48:39.403" LastActivityDate="2021-06-08T03:48:39.403" Title="Conclusive opinion on having a Hello, World! feed" Tags="|discussion|feature-request|status-completed|chat|rss|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23461" PostTypeId="2" ParentId="23460" CreationDate="2021-06-06T18:28:04.637" Score="10" Body="&lt;h2&gt;Yes, as a regular chat feed.&lt;/h2&gt;&#xA;&lt;p&gt;It is important to consider what the purpose of this feed is in the first place. A lot of people use Hello, World! as an entry point to use a new language since it is a simple and well-known problem that also may not be trivial in many languages, especially the more esoteric and interesting ones.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, having a feed will allow us to see these new languages (and often new users) and welcome them to the site or learn more about this language. Essentially, it is to raise visibility to new positive contributions.&lt;/p&gt;&#xA;&lt;p&gt;Thus, first of all, it would be nice to have a permanent display. Ticker feeds only show to people already in the room, and if you weren't there, too bad, you missed it. Additionally, the post may also prompt some discussion in the chat room if it's a particularly unique language, and a message feed offers context, whereas a ticker feed would make the transcript confusing as everyone would just suddenly start talking about something totally unrelated.&lt;/p&gt;&#xA;&lt;p&gt;Finally, if problematic posts show up, we can remove the feed messages quite easily, whereas tickers can only be dismissed by the client, and so if someone is AFK in the chat room, they don't have to see said posts. If the feed posts a lot at once, which I believe is a largely unapplicable concern now anyway (it doesn't get answers &lt;em&gt;that&lt;/em&gt; frequently), we can also trash all of those messages.&lt;/p&gt;&#xA;&lt;p&gt;If it proves to be too disruptive, it takes a few clicks to completely undo it. So I say, let's go ahead with it. In the worst case scenario, we'll have a solid answer to this question.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-06-06T18:28:04.637" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23462" PostTypeId="2" ParentId="2140" CreationDate="2021-06-07T01:03:01.203" Score="6" Body="&lt;h1&gt;Non-quining infinite printer&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Seems like the title could be better but I'm not sure what to do instead&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I have heard that a monkey typing random keys on a typewriter, given infinite time, will eventually type out the entire works of Shakespeare, and in fact type out every possible string of characters of any length. This sounds to me like the basis for a profitable business venture in publishing. Unfortunately, however, as a result of previous failed business ventures, I am legally barred from possessing either monkeys or typewriters, so I'll instead need a program. I want this program to provably generate every possible string of characters, assuming infinite time and memory. Repetition is fine, as is overlap, as long as every possible string appears somewhere in the output. There's a catch, though. I imagine once my business gets off the ground and people realize the potential profits, they might want to get their hands on my program. The trouble is that since I'm outputting every possible string of text, in theory I'll eventually end up outputting the program itself, leaving it open to be stolen. To prevent this, I want the program never to output its own source code. It should still output every other possible string, just not itself (or, obviously, any strings which it is a substring of). Because my funds are currently very tight, I can't afford to pay for more bytes than are necessary, so I'm seeking the shortest possible program that does the job (This is a &lt;code&gt;code-golf&lt;/code&gt; challenge, shortest answer in bytes wins). &lt;em&gt;Is it communicated well enough what this challenge is asking for? Should I add a TL;DR and/or a more technical explanation of what's being looked for?&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Additional notes:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I've had enough run-ins with the law in previous ventures, I'd like this one to go smoothly. So no abusing &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;loopholes&lt;/a&gt; in the program, please.&lt;/li&gt;&#xA;&lt;li&gt;Given that this program is my financial plan for the next infinity years, I'd like some reassurance that it actually does what it's supposed to. Please provide at least a brief explanation of why your code works, since it can't exactly be tested.&lt;/li&gt;&#xA;&lt;li&gt;Any character encoding is fine, please specify though. The exception is that your source code must be printable in the encoding you use. &lt;em&gt;Is this a reasonable way to handle this that is fair to all languages?&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;No reading your own source, because that makes quine-related holes uncool, and uncoolness does not fit with my businesses' brand persona.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="103412" LastEditorUserId="103412" LastEditDate="2021-07-01T08:12:18.037" LastActivityDate="2021-07-01T08:12:18.037" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="23465" PostTypeId="2" ParentId="2140" CreationDate="2021-06-07T14:30:55.933" Score="0" Body="&lt;h1&gt;How much faster than qsort can you achieve?&lt;/h1&gt;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&lt;p&gt;Sort 1 million 32 bit integers as quickly as possible. Your code must create 1 million random non-negative integers in the range 0 to 999999 and sort them. Only the sorting should be timed.&lt;/p&gt;&#xA;&lt;h1&gt;Score&lt;/h1&gt;&#xA;&lt;p&gt;I will run your code and compare the timings to my default C code using qsort. That is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#include &amp;lt;stdio.h&amp;gt;&#xA;#include &amp;lt;stdlib.h&amp;gt;&#xA;#include &amp;lt;time.h&amp;gt;&#xA;#include &amp;lt;stdint.h&amp;gt;&#xA;&#xA;&#xA;int cmpfunc (const void * a, const void * b) {&#xA;   return ( *(int*)a - *(int*)b );&#xA;}&#xA;&#xA;int main(void) {&#xA;    int sz;&#xA;    srand(time(NULL));&#xA;    printf(&amp;quot;Enter the size of array::&amp;quot;);&#xA;    scanf(&amp;quot;%d&amp;quot;,&amp;amp;sz);&#xA;    uint32_t *arr = malloc (sz * sizeof(uint32_t));&#xA;    int i;&#xA;    for(i=0;i&amp;lt;sz;i++)&#xA;        arr[i]=rand()%1000000; &#xA;    clock_t begin = clock();&#xA;    qsort(arr, sz, sizeof(int), cmpfunc);&#xA;    clock_t end = clock();&#xA;    double time_spent = (double)(end - begin) / CLOCKS_PER_SEC;&#xA;    printf(&amp;quot;%f seconds\n&amp;quot;, time_spent);&#xA;    printf(&amp;quot;%d\n&amp;quot;, arr[10]);&#xA;    return 0;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your score will be the timing for my C code divided by the timing for your code.   I will run both on my PC. This means I will need clear instructions for how to compile and run your code on linux.&lt;/p&gt;&#xA;&lt;p&gt;This means you will have to provide timing code in your solution so I am not timing the creation of the data.&lt;/p&gt;&#xA;&lt;h1&gt;Current timings&lt;/h1&gt;&#xA;&lt;p&gt;On my PC:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The sample C code takes 0.11 seconds.&lt;/li&gt;&#xA;&lt;li&gt;Python &lt;code&gt;sorted&lt;/code&gt; takes 0.24 seconds.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Notes&lt;/h1&gt;&#xA;&lt;p&gt;My code prints out one of the elements of the sorted array. This is to stop the opimizing compiler from removing the sorting code completely. You will have to do the same.&lt;/p&gt;&#xA;&lt;p&gt;Builins &lt;strong&gt;are&lt;/strong&gt; allowed.  As ever this is a challenge per language so if your Python answer is faster than any other Python answer you have won that mini-competition.&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user7467" LastEditorDisplayName="user7467" LastEditDate="2021-06-07T14:53:35.510" LastActivityDate="2021-06-07T14:53:35.510" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="23466" PostTypeId="2" ParentId="17416" CreationDate="2021-06-07T22:06:19.227" Score="3" Body="&lt;p&gt;Not all tag wikis need links to the standard loopholes and the I/O formats, especially as they can be found in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1280/66833&quot;&gt;site FAQ&lt;/a&gt;. However, the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; tag wiki, which is most likely to need them, now has links to &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;both&lt;/a&gt; (and more helpful links), so this is now &lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-06-07T22:06:19.227" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23467" PostTypeId="2" ParentId="22424" CreationDate="2021-06-07T22:18:59.283" Score="2" Body="&lt;p&gt;Quines are defined as&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A quine is a computer program which takes no input and produces a copy of its own &lt;strong&gt;source code&lt;/strong&gt; as its only output.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;Emphasis mine. &lt;a href=&quot;https://en.wikipedia.org/wiki/Quine_(computing)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Source&lt;/a&gt;. Also &lt;a href=&quot;https://codegolf.stackexchange.com/q/69/66833&quot;&gt;cited&lt;/a&gt; in the original question&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Despite Pxem's unusual execution manner, filenames are not source code. Therefore, a valid submission to the quine challenge should be a program which accepts no input, and outputs the exact code in the file, regardless of the filename. Anything else is not a valid quine.&lt;/p&gt;&#xA;&lt;p&gt;Additionally:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Also, in many languages, an empty file is also a quine: that isn't considered a legit quine either.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Meaning that at least one of your submissions is invalid.&lt;/p&gt;&#xA;&lt;p&gt;If there is an interpreter, such as esolang-box where you can submit it as a single file which outputs its source code, this is valid per our rules that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7833/66833&quot;&gt;a language is defined by its implementation&lt;/a&gt;. esolang-box says:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Pxem&lt;/p&gt;&#xA;&lt;p&gt;The first line is the file name of the pxem code.&lt;/p&gt;&#xA;&lt;p&gt;The rest is the content of the pxem code.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;So, while being slightly &amp;quot;edge-case&amp;quot;-y, if a program like&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;file.pxem&#xA;output&#xA;this text&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;outputs&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;file.pxem&#xA;output&#xA;this text&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;when run on esolang-box, I'd consider this to be an acceptable quine.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-06-07T22:18:59.283" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23468" PostTypeId="2" ParentId="2140" CreationDate="2021-06-08T16:54:07.863" Score="2" Body="&lt;h1&gt;Combinatorial Pipes&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinations&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinations&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;You're a plumber working on a house, and there's some pipes that must be connected at odd angles. You have 8°, 11.25°, 22.5°, 45°, and 90° fittings at your disposal, and you want to use as few as possible to match the angle as closely as possible.&lt;/p&gt;&#xA;&lt;h1&gt;Goal&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Match the desired angle as closely as possible, with as few fittings as possible.  It can be over or&#xA;under the desired angle.&lt;/li&gt;&#xA;&lt;li&gt;Accuracy is more important than the number of fittings&lt;/li&gt;&#xA;&lt;li&gt;In the case of two different sets of fittings with the&#xA;same resulting angle, whichever has the fewest number of fittings should be selected.&lt;/li&gt;&#xA;&lt;li&gt;If the two sets use different fittings, match the same&#xA;angle, and have the same number of fittings, either may be chosen.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;Your input is a random integer between (non-inclusive) 0 and 180, which represents the desired angle.&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;Your output should be an array where [0]-&amp;gt;# of 8° fittings, [1]-&amp;gt;# of 11.25° fittings, etc. If your language does not support arrays, you may output a comma separated list, where the first value represents the number of 8° fittings, and so on and so forth.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test Cases&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;90° -&amp;gt;[0,0,0,0,1]&#xA;24°-&amp;gt; [3,0,0,0,0] ([0,0,1,0,0] uses less fittings, but is less accurate and therefore incorrect)&#xA;140°-&amp;gt;[2,1,2,0,1]&#xA;140°-&amp;gt;&amp;quot;2,1,2,0,1&amp;quot; acceptable if language does not support arrays&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;Lowest byte count for each language wins a high five from me if we ever bump into each other (and the challenge).&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&lt;p&gt;Howdy! I feel like this could be an interesting golf, but I'm unsure if the language is clear and concise enough to get the idea across.&lt;/p&gt;&#xA;" OwnerUserId="98592" LastEditorUserId="98592" LastEditDate="2021-06-09T20:06:54.123" LastActivityDate="2021-06-09T20:06:54.123" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23470" PostTypeId="2" ParentId="2140" CreationDate="2021-06-08T19:50:06.473" Score="0" Body="&lt;h1&gt;Finite Composition of Univariate Functions &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;Problem&lt;/h2&gt;&#xA;&lt;p&gt;Given&#xA;&lt;span class=&quot;math-container&quot;&gt;$$\mathbb{F}:=\{f_i \mid f_i : \mathbb{R} \to \mathbb{R}\}$$&lt;/span&gt;&#xA;the set of all the real maps, and the n-ary function composition&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\begin{gather}&#xA;c_o(f_i) = f_1∘f_2∘f_3⋯∘f_n\\[8pt]&#xA;∀f_i ∈ \mathbb{F},~~~1≤i≤n∈\mathbb{N}&#xA;\end{gather}&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;write a program which receives n functions of a real variable as the input and computes the in-order function composition, product of all the entered functions as a string.&lt;/p&gt;&#xA;&lt;p&gt;As standard, &lt;code&gt;x&lt;/code&gt; is the name of the parameter variable in each function. Any other literal is taken as a constant.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;h3&gt;Example 1&lt;/h3&gt;&#xA;&lt;p&gt;input&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;number of functions: 3&#xA;f_1 = x + 1&#xA;f_2 = x - 10&#xA;f_3 = x^2 + 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;output&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;c_o(f_1,f_2,f_3) = ((x^2 + 2) - 10) + 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Example 2&lt;/h3&gt;&#xA;&lt;p&gt;input&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;number of functions: 4&#xA;f_1 = 27x - sin(e)&#xA;f_2 = -7(x^2 + 1)^(1/2) 4y^3 + 21&#xA;f_3 = x^(3/2) + 4&#xA;f_4 = ln(z + 1)&#xA;(z, y, e are assumed as constants in the reals)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;output&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;c_o(f_1,f_2,f_3,f_4) = 27(-7(((ln(z + 1))^(3/2) + 4)^2 + 1)^(1/2) 4y^3 + 21) - sin(e)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="100973" LastEditorUserId="100973" LastEditDate="2021-06-09T17:56:12.033" LastActivityDate="2021-06-09T17:56:12.033" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="23471" PostTypeId="2" ParentId="12852" CreationDate="2021-06-08T22:39:21.003" Score="4" Body="&lt;h2&gt;Yes, all of it&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Stack Exchange Data Explorer&lt;/a&gt; lists all spam or offensive flags (&amp;quot;red&amp;quot; flags) in its &lt;a href=&quot;https://meta.stackexchange.com/questions/2677/database-schema-documentation-for-the-public-data-dump-and-sede&quot;&gt;Votes table&lt;/a&gt;. When messing around with &lt;a href=&quot;https://data.stackexchange.com/meta.codegolf/query/1414941/a-breakdown-of-the-total-votes-cast-on-a-site&quot; rel=&quot;nofollow noreferrer&quot;&gt;this query&lt;/a&gt; listing all votes on the site, I noticed that Meta has actually had 5 spam flags and one offensive flag cast. So, I did a little digging to &lt;a href=&quot;https://data.stackexchange.com/meta.codegolf/query/1419829/spam-offensive-flags-on-cgcc-meta&quot; rel=&quot;nofollow noreferrer&quot;&gt;find when&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Flag Type&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Date&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Post Id/Link (10k+ only)&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Time from creation to deletion&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Spam Flag&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;2018-01-31&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14707&quot;&gt;14707&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;1 hour 15 minutes&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Spam Flag&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;2017-11-15&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14222&quot;&gt;14222&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;15 minutes&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Spam Flag&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;2017-02-05&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11437&quot;&gt;11437&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;16 minutes&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Spam Flag&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;2017-02-05&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11438&quot;&gt;11438&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;12 minutes&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Spam Flag&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;2016-11-11&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10562&quot;&gt;10562&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;3 minutes&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Offensive Flag&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;2016-10-03&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10234&quot;&gt;10234&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;3 hrs 5 minutes&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;&lt;sub&gt;Don't ask me how I got the links. It involved a &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/58279224#58279224&quot;&gt;&lt;em&gt;lot&lt;/em&gt;&lt;/a&gt; of digging, plus some healthy &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/58279790#58279790&quot;&gt;anger at SQL&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;p&gt;It turns out that &lt;em&gt;all&lt;/em&gt; spam on Meta happened after we decreased the reputation levels (which happened on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/revisions/7084/4&quot;&gt;2015-10-03&lt;/a&gt;). However, this is still 4 spam posts, across 15 months, so, in practical terms, this is nothing compared to the &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1419869/spam-offensive-flags-on-cgcc&quot; rel=&quot;nofollow noreferrer&quot;&gt;spam on main&lt;/a&gt; (approximately &lt;span class=&quot;math-container&quot;&gt;\$0.68\%\$&lt;/span&gt;), and, as you can tell from the last row, we're generally pretty good at handling these quickly&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-06-08T22:39:21.003" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23473" PostTypeId="2" ParentId="2140" CreationDate="2021-06-09T04:54:18.453" Score="0" Body="&lt;h1&gt;Smallest number of actions to change reputation by [x] points&lt;/h1&gt;&#xA;&lt;p&gt;&lt;code&gt;8&lt;/code&gt;: Upvote + downvote&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;75&lt;/code&gt;: Bounty + upvote + accepted answer&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Draft&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-06-09T04:54:18.453" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23474" PostTypeId="2" ParentId="2140" CreationDate="2021-06-09T07:57:39.550" Score="0" Body="&lt;h1&gt;Boxes in boxes in boxes in boxes.....&lt;/h1&gt;&#xA;&lt;p&gt;ASCII boxes are fun, but the box drawing questions seem to be limited insofar as that they seem to take a specific set of boxes. Today, I hope to fix that.&#xA;The challenge here is to write a program that takes a list of sides of boxes and characters to draw them with, and outputs the boxes.&lt;/p&gt;&#xA;&lt;p&gt;To clarify some format issues:&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;Input is flexible, and will look like 1) this&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;17&#xA;&#xA;30 20 #$5&#xA;&#xA;21 15 $%^&#xA;&#xA;19 13 311&#xA;&#xA;...&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or 2) this&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[17, [30, 20, &amp;quot;#$5], [21, 15, &amp;quot;$%^], [19, 13, &amp;quot;311&amp;quot;], ...]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You may support either or both of these types, but you must be consistent with this choice.&lt;/p&gt;&#xA;&lt;p&gt;Input is given in this order:&lt;/p&gt;&#xA;&lt;p&gt;The first number, a single number on one line, is the number of boxes to place.&lt;/p&gt;&#xA;&lt;p&gt;Then, for as many times as said first number, you will receive 2 numbers and three characters - the two numbers represent length and width, in any order. The three characters represent, in this order:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The character to use for the corners.&lt;/li&gt;&#xA;&lt;li&gt;The character to use for the edges.&lt;/li&gt;&#xA;&lt;li&gt;The character to fill the inside of the boxes.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The boxes should not overlap, but you have the freedom to place the boxes wherever you wish. The allowed symbols are &lt;code&gt;!$%^&amp;amp;*()_-+=#~/?\@s&lt;/code&gt;, where the s represents space and in order to aid those who want to split on whitespace.&lt;/p&gt;&#xA;&lt;p&gt;Input will be space separated within boxes and newline separated between boxes.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Output should be a set of boxes, conforming to the regulations and conditions above - for example,&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;%###%&#xA;#***# *((*&#xA;#***# ())(&#xA;#***# ())(&#xA;%###% *((*&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;for the input&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2&#xA;&#xA;5 5 %#*&#xA;&#xA;4 4 *()&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[2, [5, 5, &amp;quot;%#*&amp;quot;], [4, 4, &amp;quot;*()&amp;quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest solution in bytes wins. Share your favourite drawings with your answer.&lt;/p&gt;&#xA;&lt;p&gt;Additional tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;p&gt;Any issues?&lt;/p&gt;&#xA;&lt;p&gt;Should the scoring be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;?&lt;/p&gt;&#xA;&lt;p&gt;Is the challenge specified enough?&lt;/p&gt;&#xA;" OwnerUserId="100887" LastEditorUserId="100887" LastEditDate="2021-06-11T11:41:14.300" LastActivityDate="2021-06-11T11:41:14.300" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23475" PostTypeId="2" ParentId="2140" CreationDate="2021-06-09T12:33:18.880" Score="2" Body="&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2021-06-10T08:33:48.017" LastActivityDate="2021-06-10T08:33:48.017" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23476" PostTypeId="1" AcceptedAnswerId="23486" CreationDate="2021-06-09T12:44:19.607" Score="1" ViewCount="50" Body="&lt;p&gt;So, I'm working on an environment for an upcoming challenge, and I've written a fairly extensive &lt;a href=&quot;https://github.com/AJFaraday/Thud/blob/main/docs/controller_interface.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;API document&lt;/a&gt; for entries to interact with the game.&lt;/p&gt;&#xA;&lt;p&gt;I'm thinking at this stage that the API doc itself is longer than most posts, and it might make the challenge more approachable to describe the challenge, game rules, how to enter etc. in the question and then link to the API doc.&lt;/p&gt;&#xA;&lt;p&gt;I'm also considering linking to an &lt;a href=&quot;https://en.wikipedia.org/wiki/Games_of_the_Discworld#Gameplay&quot; rel=&quot;nofollow noreferrer&quot;&gt;existing wiki page&lt;/a&gt; for the rules of the game.&lt;/p&gt;&#xA;&lt;p&gt;For context, the challenge involves my JS code as a controller for the game, so people will have to use either the &lt;a href=&quot;https://ajfaraday.github.io/Thud/dist/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github Pages&lt;/a&gt; environment or (probably more likely) a clone of the &lt;a href=&quot;https://github.com/AJFaraday/Thud&quot; rel=&quot;nofollow noreferrer&quot;&gt;git repository&lt;/a&gt; to develop their entry.&lt;/p&gt;&#xA;&lt;p&gt;So, the generic question is this: Is it acceptable to shorten challenges by linking to external resources in order to shorten code challenge pages?&lt;/p&gt;&#xA;&lt;p&gt;Here's my current thought process on the matter.&lt;/p&gt;&#xA;&lt;p&gt;Disadvantages:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;More links means more pages to keep track of.&lt;/li&gt;&#xA;&lt;li&gt;If a linked page is not in my control, it could be changed/vandalised during the challenge.&lt;/li&gt;&#xA;&lt;li&gt;It could prevent access for some users (e.g. if their country blocks a site).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Advantages:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The challenge question itself becomes clearer and more manageable.&lt;/li&gt;&#xA;&lt;li&gt;Someone else may have already described something better than I can.&lt;/li&gt;&#xA;&lt;li&gt;Users can focus on one aspect of the challenge at a time (e.g. learning the game, writing their entry, deploying their entry)&lt;/li&gt;&#xA;&lt;li&gt;If it's in the git repository, I could deploy code changes and doc changes at the same time, ensuring the docs don't fall out of date.&lt;/li&gt;&#xA;&lt;li&gt;If issues come up during the challenge, I could add a FAQ page for users who experience the same issues.&lt;/li&gt;&#xA;&lt;li&gt;Two sides of an asymmetrical challenge could link to the same resource, keeping the two in sync.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Possible resources to refer to (I'm not thinking of making all of these separate, most of these are for discussion):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Interface documents&lt;/li&gt;&#xA;&lt;li&gt;Background information&lt;/li&gt;&#xA;&lt;li&gt;Required code (if cloning a repo would be useful)&lt;/li&gt;&#xA;&lt;li&gt;Live environment for code&lt;/li&gt;&#xA;&lt;li&gt;Troubleshooting information/FAQ page&lt;/li&gt;&#xA;&lt;li&gt;Example entries (as starting points)&lt;/li&gt;&#xA;&lt;li&gt;Guide to entering&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Note: For this particular challenge, it will be possible to write, test and post an entry with the GH Pages environment. So it will be possible to play the game without a github account.&lt;/p&gt;&#xA;" OwnerUserId="16824" LastEditorUserId="68942" LastEditDate="2021-06-09T14:15:04.187" LastActivityDate="2021-06-10T03:48:32.433" Title="Is it acceptable to use an external API doc in a challenge?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23477" PostTypeId="2" ParentId="22330" CreationDate="2021-06-09T14:27:51.863" Score="2" Body="&lt;h2&gt;No.&lt;/h2&gt;&#xA;&lt;p&gt;For similar reasons to how we &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/13161/do-we-want-an-xkcd-tag&quot;&gt;declined&lt;/a&gt; the creation of an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/xkcd&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;xkcd&amp;#39;&quot; rel=&quot;tag&quot;&gt;xkcd&lt;/a&gt; tag, there is no real classification that arises from having a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/minecraft&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;minecraft&amp;#39;&quot; rel=&quot;tag&quot;&gt;minecraft&lt;/a&gt; tag. Just looking at the three challenges you linked, one is a parsing / string (YAML to JSON converter) challenge, one is a KC (compression) challenge, and one is a 2D string/grid scanning challenge, and the other ones have similarly unrelated tasks.&lt;/p&gt;&#xA;&lt;p&gt;Tags are supposed to categorize challenges by some meaningful distinction, which this does not serve.&lt;/p&gt;&#xA;&lt;p&gt;(Please upvote this to agree and downvote this to disagree. This is not a binding statement, just my opinion and an option to vote for.)&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-06-09T14:27:51.863" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23479" PostTypeId="2" ParentId="22330" CreationDate="2021-06-09T14:43:19.793" Score="4" Body="&lt;h2&gt;Yes...&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;But only for challenges that relate specifically to features unique to Minecraft, and not challenges that were inspired by Minecraft/Minecraft features&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Minecraft has a system of &lt;a href=&quot;https://minecraft.fandom.com/wiki/Commands&quot; rel=&quot;nofollow noreferrer&quot;&gt;commands&lt;/a&gt;, as well as a method of mimicking electrical circuits via &lt;a href=&quot;https://minecraft.fandom.com/wiki/Redstone_Dust&quot; rel=&quot;nofollow noreferrer&quot;&gt;redstone&lt;/a&gt;. Through these, Minecraft is (close to) &lt;a href=&quot;https://gaming.stackexchange.com/questions/20219/is-minecraft-turing-complete&quot;&gt;Turing complete&lt;/a&gt;, and we have answers on the site written in Minecraft. Questions about these systems, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/10588/simple-redstone-simulator&quot;&gt;Simple Redstone Simulator&lt;/a&gt; or a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; for golfing in Minecraft question would be applicable to this tag.&lt;/p&gt;&#xA;&lt;p&gt;Questions that are inspired by aspects of Minecraft, but that do not relate directly to the coding system of Minecraft should not be tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/minecraft&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;minecraft&amp;#39;&quot; rel=&quot;tag&quot;&gt;minecraft&lt;/a&gt;. In the same way that a question about printing the &lt;a href=&quot;https://github.com/DennisMitchell/jellylanguage/wiki/Code-page&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly code page&lt;/a&gt; would not be tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/jelly&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;jelly&amp;#39;&quot; rel=&quot;tag&quot;&gt;jelly&lt;/a&gt; as it isn't inherently about Jelly, but a question about a &lt;a href=&quot;https://codegolf.stackexchange.com/q/216734/66833&quot;&gt;specific feature&lt;/a&gt; of the language would be.&lt;/p&gt;&#xA;&lt;p&gt;In short, if being about Minecraft is a &lt;em&gt;central&lt;/em&gt; part of the challenge, not just an inspiration, then it should be tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/minecraft&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;minecraft&amp;#39;&quot; rel=&quot;tag&quot;&gt;minecraft&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;...but maybe No&lt;/h2&gt;&#xA;&lt;p&gt;However, I'm not sure how many challenges relate to Minecraft this way. By searching &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=minecraft+is%3Aq&quot;&gt;Minecraft&lt;/a&gt;, I can only find &lt;a href=&quot;https://codegolf.stackexchange.com/questions/10588/simple-redstone-simulator&quot;&gt;one&lt;/a&gt;, so I'm not even sure if this tag would be needed.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-06-09T14:43:19.793" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23480" PostTypeId="1" CreationDate="2021-06-09T16:32:06.323" Score="5" ViewCount="89" Body="&lt;p&gt;There are many ideas of code-golf challenges out there that are abandoned because &lt;em&gt;a part of them are just too hard to implement&lt;/em&gt; with a reasonable amount of effort. For instance, requiring to parse complicated stuff (this can be avoided by flexible input format), big number arithmetic (avoided by keeping the input range small), etc.&lt;/p&gt;&#xA;&lt;p&gt;Also, one can conceive of potential golf challenges that build on impossible subroutines, such as hyper-computation (maybe a challenge that requires a subroutine that decides the halting problem, there might be interesting ones!).&lt;/p&gt;&#xA;&lt;p&gt;So, the question is: &lt;strong&gt;is it a good idea to provide an &amp;quot;oracle&amp;quot; function in a challenge&lt;/strong&gt;? An example:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Challenge: Input a positive integer &lt;code&gt;n&lt;/code&gt;, and a list of sets &lt;span class=&quot;math-container&quot;&gt;\$S_0, \dots, S_m \subseteq \{1,\cdots, n\} \$&lt;/span&gt;. Determine that, if &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; points on a plane are arranged so that &lt;span class=&quot;math-container&quot;&gt;\$P_{k_i}(k_i \in S_j)\$&lt;/span&gt; are collinear for each &lt;span class=&quot;math-container&quot;&gt;\$j &amp;gt; 0\$&lt;/span&gt;, whether the points &lt;span class=&quot;math-container&quot;&gt;\$P_{k_i}(k_i \in S_0)\$&lt;/span&gt; are collinear.&lt;/p&gt;&#xA;&lt;p&gt;You are given a function that computes the Gröbner basis of a given polynomial set, with your desired input format.&lt;/p&gt;&#xA;&lt;p&gt;Test cases: rhubarb rhubarb&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="90585" LastActivityDate="2021-06-09T16:32:06.323" Title="Challenges with an oracle" Tags="|discussion|challenge-quality|" AnswerCount="0" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23482" PostTypeId="2" ParentId="2140" CreationDate="2021-06-09T20:54:00.687" Score="1" Body="&lt;h1&gt;Write a netquine&lt;/h1&gt;&#xA;&lt;p&gt;There are a lot of online interpreters, for a lot of languages. For example, there's the ubiquitous &lt;a href=&quot;https://tio.run&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;, but there are also smaller, more specific ones that others have made, such as interpreters for &lt;a href=&quot;https://lyxal.pythonanywhere.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Vyxal&lt;/a&gt;, &lt;a href=&quot;https://ngn.bitbucket.io/k/#&quot; rel=&quot;nofollow noreferrer&quot;&gt;ngn/k&lt;/a&gt;, or &lt;a href=&quot;https://grok.pythonanywhere.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Grok&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your goal today is to write a netquine, or a program whose output, when used as a URL, leads to that program in an interpreter for that language. Essentially, if you have a link to your program, and the program outputs that link, it's valid.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;For example, say you write a Vyxal program &lt;code&gt;λλλλ&lt;/code&gt;. In the Vyxal interpreter, if you press the button to generate a permalink for this program, you get:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;http://lyxal.pythonanywhere.com?flags=&amp;amp;code=%CE%BB%CE%BB%CE%BB%CE%BB&amp;amp;inputs=&amp;amp;header=&amp;amp;footer=&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;However, due to the way that the interpreter processes links, you could also leave out the blank fields:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;http://lyxal.pythonanywhere.com/?code=%CE%BB%CE%BB%CE%BB%CE%BB&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You can even replace the HTML character codes with the actual characters:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;http://lyxal.pythonanywhere.com/?code=λλλλ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;All of these are valid links to the Vyxal program &lt;code&gt;λλλλ&lt;/code&gt;, and therefore would all be valid outputs for a netquine.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Obviously, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Even though &lt;em&gt;URL shorteners&lt;/em&gt; are forbidden by default, shortening a URL, like in the example, is fine, as long as it still leads to the right place.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;For the purposes of this challenge, a web browser may be considered an &amp;quot;interpreter&amp;quot; for HTML and/or CSS. This means you might be able to do something along &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/58130477#58130477&quot;&gt;these lines&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Usual &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply, as do usual &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; rules.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins!&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot;&gt;internet&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-referential&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-referential&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-referential&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Is this question clear enough?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Should I change the scoring to accommodate the potential differences in URL length? (lengths of domain names, different ways of generating links, the ability to shorten links, etc.)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Any other feedback?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/133399/tryitonquine-challenge&quot;&gt;This&lt;/a&gt; question is quite similar, but it only allows for TIO languages, and it doesn't allow any sort of shortening, even if the link is still valid (there was a comment asking about that), so I would consider it to be related, but not a dupe.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="101522" LastActivityDate="2021-06-09T20:54:00.687" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23483" PostTypeId="2" ParentId="2140" CreationDate="2021-06-10T00:23:29.457" Score="0" Body="&lt;h1&gt;Interpret Unreadable &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://esolangs.org/wiki/Unreadable&quot; rel=&quot;nofollow noreferrer&quot;&gt;Unreadable&lt;/a&gt; is a programming language designed to be – as the name states – unreadable (in most fonts, anyway). Instructions are &lt;code&gt;'&lt;/code&gt; followed by a run of &lt;code&gt;&amp;quot;&lt;/code&gt;s. So while in a code block, &lt;code&gt;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&lt;/code&gt; looks just fine, it looks like '&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot; outside of one - it is extremely difficult to tell what is going on.&lt;/p&gt;&#xA;&lt;p&gt;The instructions are prefix, and are as so:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Instruction&lt;/th&gt;&#xA;&lt;th&gt;Arity&lt;/th&gt;&#xA;&lt;th&gt;Behavior&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;'&amp;quot;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Unary&lt;/td&gt;&#xA;&lt;td&gt;Print; output the character with codepoint &lt;code&gt;x&lt;/code&gt;, and return &lt;code&gt;x&lt;/code&gt;.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;'&amp;quot;&amp;quot;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Unary&lt;/td&gt;&#xA;&lt;td&gt;Increment; return &lt;code&gt;x+1&lt;/code&gt;.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;'&amp;quot;&amp;quot;&amp;quot;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Nilary&lt;/td&gt;&#xA;&lt;td&gt;Unit; return &lt;code&gt;1&lt;/code&gt;.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Binary&lt;/td&gt;&#xA;&lt;td&gt;Both; evaluate and disregard &lt;code&gt;x&lt;/code&gt;, and return the result of evaluating &lt;code&gt;y&lt;/code&gt;.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Binary&lt;/td&gt;&#xA;&lt;td&gt;While; keep evaluating &lt;code&gt;y&lt;/code&gt; until &lt;code&gt;x&lt;/code&gt; is &lt;code&gt;0&lt;/code&gt;. Return the last result of evaluating &lt;code&gt;y&lt;/code&gt;.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Binary&lt;/td&gt;&#xA;&lt;td&gt;Set; set the &lt;code&gt;x&lt;/code&gt;th variable to &lt;code&gt;y&lt;/code&gt;, and return &lt;code&gt;y&lt;/code&gt;.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Unary&lt;/td&gt;&#xA;&lt;td&gt;Get; return the value of the &lt;code&gt;x&lt;/code&gt;th value. Undefined is &lt;code&gt;0&lt;/code&gt;.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Unary&lt;/td&gt;&#xA;&lt;td&gt;Decrement; return &lt;code&gt;x-1&lt;/code&gt;.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Ternary&lt;/td&gt;&#xA;&lt;td&gt;If-else; if &lt;code&gt;x&lt;/code&gt; is &lt;code&gt;0&lt;/code&gt;, return &lt;code&gt;z&lt;/code&gt;. Otherwise, return &lt;code&gt;y&lt;/code&gt;.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Nilary&lt;/td&gt;&#xA;&lt;td&gt;Input; return the codepoint of the next character of input. EOF is &lt;code&gt;-1&lt;/code&gt;.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;For example, a cat program would be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&#xA;while(++ setvar(1 = input())) {print(getvar(1))}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Or, in its unreadable glory: '&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Given a valid Unreadable program and its input separated by any non-&lt;code&gt;'&lt;/code&gt; or &lt;code&gt;&amp;quot;&lt;/code&gt; character, interpret the program as Unreadable code.&lt;/p&gt;&#xA;&lt;h1&gt;Test cases (uses &lt;code&gt;!&lt;/code&gt; as the separation character, I/O is represented in &lt;a href=&quot;https://en.wikipedia.org/wiki/Code_page_437&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;CP-437&lt;/code&gt;&lt;/a&gt;)&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input -&amp;gt; Output&#xA;'&amp;quot;'&amp;quot;&amp;quot;&amp;quot;!this input does nothing lol -&amp;gt; ☺&#xA;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;!This is a cat so I can output whatever I want. blah blah blah... -&amp;gt; This is a cat so I can output whatever I want. blah blah blah...&#xA;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot; -&amp;gt; Hello, world!&#xA;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;'&amp;quot;&amp;quot;'&amp;quot;&amp;quot;&amp;quot;!A! -&amp;gt; b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;A single trailing newline is allowed in the output, and no other trailing whitespace.&lt;/li&gt;&#xA;&lt;li&gt;If possible, please link to an online interpreter (e.g. &lt;a href=&quot;https://tio.run&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;) to run your program on.&lt;/li&gt;&#xA;&lt;li&gt;Please explain your answer. This is not necessary, but it makes it easier for others to understand.&lt;/li&gt;&#xA;&lt;li&gt;Languages newer than the question are allowed. This means you could create your own language where it would be trivial to do this, but don't expect any upvotes.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins!&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;A +100 rep bounty will be given to the first Unreadable answer.&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="94066" LastEditorUserId="94066" LastEditDate="2021-06-10T00:27:20.877" LastActivityDate="2021-06-10T00:27:20.877" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23484" PostTypeId="2" ParentId="2140" CreationDate="2021-06-10T01:56:50.590" Score="0" Body="&lt;h1&gt;Convert permutations to integers and back again&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/permutations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;permutations&amp;#39;&quot; rel=&quot;tag&quot;&gt;permutations&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/encode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;encode&amp;#39;&quot; rel=&quot;tag&quot;&gt;encode&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decode&amp;#39;&quot; rel=&quot;tag&quot;&gt;decode&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Convert a permutation of 0,...,n-1 to a number in the range 0,...,n!-1, and convert back again.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Write a program containing two functions (or two programs).&lt;/p&gt;&#xA;&lt;p&gt;The first function should accept a permutation (i.e. an ordering) of the numbers 0,1,2,...,n-1 (where n is any positive integer) and output an integer in the range 0,1,...,n!-1 (where n! is n factorial).  Distinct permutations of the same length n must produce distinct outputs, but there are no further restrictions.&lt;/p&gt;&#xA;&lt;p&gt;The second function should implement the inverse of the first function (except that it also needs to know n).  It should accept an integer k in the range 0,1,...,n!-1 AND a positive integer n, and should output the permutation of 0,1,2,...,n-1 that yields k when sent to the first function.&lt;/p&gt;&#xA;&lt;p&gt;The time and space complexity of both functions MUST be at most polynomial in n, i.e. O(n**c) for some fixed c.  In particular, solutions that involving computing all n! permutations are NOT acceptable.  (Unofficial bonus points for O(n)).&lt;/p&gt;&#xA;&lt;p&gt;Shortest solution (including both functions and any additional code) in each language wins.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;Assuming the two functions are f and g:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Input&lt;/th&gt;&#xA;&lt;th&gt;Output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;f([0])&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;0&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;g(0,1)&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;[0]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;f([0,1]), f([1,0])&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;0&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt; in either order&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;g(0,2), g(1,2)&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;[0,1]&lt;/code&gt; and &lt;code&gt;[1,0]&lt;/code&gt; in either order&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;f([3,4,1,0,2])&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;some integer in range 0,...,119&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;g(42,5)&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;some permutation of 0,1,2,3,4&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;f(g(42,5))&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;42&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;g(f([3,4,1,0,2]),5)&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;[3,4,1,0,2]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;f([1,0,1])&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;not valid input (not a permutation)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;f([1,3,4])&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;not valid input (not a permutation of 0,1,2)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;g(42,4)&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;not valid input (42 &amp;gt;= 4!)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&lt;p&gt;Permutations can be represented in any reasonable form.&lt;/p&gt;&#xA;&lt;p&gt;You can assume that input(s) are valid (as described).&lt;/p&gt;&#xA;&lt;p&gt;You can assume that n! fits in the standard integer type in your language, but your algorithm should theoretically work for any n.&lt;/p&gt;&#xA;&lt;p&gt;Standard loopholes apply.&lt;/p&gt;&#xA;" OwnerUserId="104303" LastEditorUserId="104303" LastEditDate="2021-06-10T12:58:46.143" LastActivityDate="2021-06-10T12:58:46.143" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23485" PostTypeId="1" AcceptedAnswerId="23677" CreationDate="2021-06-10T02:31:39.033" Score="15" ViewCount="414" Body="&lt;p&gt;&lt;strong&gt;This revision has been submitted to the devs to push the change, so unless there are any critical issues, this is the final version and I will not be modifying it anymore.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;(I have cut down the post body to make the request clearer for reviewers; you can view the revision history for the original question.)&lt;/p&gt;&#xA;&lt;p&gt;The current modal that appears for someone asking for the first time doesn't really contain helpful information for our site; however, we can change it.&lt;/p&gt;&#xA;&lt;p&gt;After deliberating with the community, I formally &lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt; the following.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Change the text before the note about searching the site for duplicates to:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20862&quot;&gt;Welcome to Code Golf &amp;amp; Coding Challenges!&lt;/a&gt; We host recreational coding challenges &amp;amp; related questions including code golf, fastest code and code golfing tips. All challenges must have an &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/305/what-makes-winning-criteria-objective&quot;&gt;&lt;b&gt;objective&lt;/b&gt; scoring criterion&lt;/a&gt;, and should &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8047&quot;&gt;avoid these listed points&lt;/a&gt;. &lt;br/&gt;&lt;br/&gt; &lt;b&gt;Questions about help with general programming-related issues are off-topic here and will be closed.&lt;/b&gt; &lt;br /&gt;&lt;br /&gt;Please post your challenge as a draft to our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox for Proposed Challenges&lt;/a&gt; for a few days first for feedback. Doing so allows you to correct issues you might otherwise miss before posting to the main site.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Change the text &lt;em&gt;after&lt;/em&gt; the aforementioned note to:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The following bullet points only apply to non-challenge questions&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Remove&lt;/strong&gt; the third bullet point.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-07-12T19:12:36.800" LastActivityDate="2021-07-12T19:12:36.800" Title="New First-Time Asker Dialog" Tags="|discussion|feature-request|status-completed|asking-questions|new-users|" AnswerCount="5" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="23486" PostTypeId="2" ParentId="23476" CreationDate="2021-06-10T03:48:32.433" Score="2" Body="&lt;h1&gt;This would be perfectly fine&lt;/h1&gt;&#xA;&lt;p&gt;Just make sure you include the list of available functions in the question.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A controller is the component which will make requests of the board to allow a player (human or computer) to interact with the game. It will implement the contract below:&#xA;&#xA;constructor(board, side)&#xA;Board state:&#xA;turn() - Current turn of the game&#xA;scores() - The current score&#xA;spaces() - Every space, and what's in it&#xA;space_info(x, y) - Detailed information on any space on the board.&#xA;dwarves() - The location of every dwarf&#xA;trolls() - The location of every troll&#xA;indexed_dwarves() - The location of every dwarf with a fixed index&#xA;indexed_trolls() - The location of every troll with a fixed index&#xA;previous_move() - What got moved to where last turn&#xA;For turns:&#xA;check_space(x, y)- Find out what moves are available from a given space&#xA;select_space(x, y) - The player decides to move a piece at space.&#xA;check_move(x, y) - Find out what will happen if you move to a place&#xA;move(x, y) - The player moves the current piece to the selected space.&#xA;Utility:&#xA;current_space - Currently selected space (not a function)&#xA;clear_space() - Empties currently selected space&#xA;declare(game_over) - Say whether or not your player thinks no more progress can be made on the game.&#xA;opponent_declared() - Has the opponent declared the game over?&#xA;Every game will have two controllers, dwarf and troll, belonging to two players, dwarf and troll.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Other than that, detailed information is perfectly fine to host externally.&lt;/p&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2021-06-10T03:48:32.433" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23488" PostTypeId="2" ParentId="23485" CreationDate="2021-06-10T08:29:43.737" Score="8" Body="&lt;h2&gt;Asking a good question&lt;/h2&gt;&#xA;&lt;p&gt;This is a site for competitive coding enthusiasts. We host coding challenges, such as &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;code golf&lt;/a&gt;, and related questions, such as golfing tips. We require that all new challenges have an &lt;strong&gt;objective&lt;/strong&gt; scoring criterion, so the winner can be appropriately and fairly chosen. &lt;strong&gt;Questions about help with general programming-related issues are off-topic here&lt;/strong&gt; - those belong on &lt;a href=&quot;https://stackoverflow.com&quot;&gt;Stack Overflow&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;We suggest you post your challenge draft to our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox for Proposed Challenges&lt;/a&gt; before posting it to main, in order to help find out if it's a duplicate, clear up any ambiguities or otherwise get feedback. Doing so allows you to correct potential issues before actually posting the challenge.&lt;/p&gt;&#xA;&lt;p&gt;Be aware that the two bullet points below are not generally relevant to our site - we're simply unable to change them.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Thoughts? This may be a little long (and I can cut down the paragraph about the Sandbox if so), and the bit about irrelevance seems odd.&lt;/p&gt;&#xA;&lt;p&gt;Changed the wording slightly to fit &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/23489/66833&quot;&gt;hyper-neutrino's answer&lt;/a&gt; better, as that's the standard site terminology.&lt;/p&gt;&#xA;&lt;p&gt;Changed some wordings thanks to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/36398/luis-mendo&quot;&gt;Luis Mendo&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/23485/new-first-time-asker-dialog/23488?noredirect=1#comment74384_23488&quot;&gt;suggestion&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-10T21:00:06.320" LastActivityDate="2021-06-10T21:00:06.320" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="23489" PostTypeId="2" ParentId="23485" CreationDate="2021-06-10T13:39:55.810" Score="4" Body="&lt;p&gt;To add to caird coinheringaahing's version, since we have decided to allow non-challenge questions, I propose the addition of this point in the middle of the current first paragraph and to replace the advisory on Stack Overflow, and splitting the SO point to a new paragraph (or keep it in the first):&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This is a site for competitive coding enthusiasts. We host coding challenges, such as &lt;a href=&quot;https://codegolf.stackexchange.com/tags/code-golf/info&quot;&gt;code golf&lt;/a&gt;. We require that all new challenges have an &lt;strong&gt;objective&lt;/strong&gt; scoring criteria, so the winner can be appropriately and fairly chosen. We also allow code golf or code challenge related questions (such as tips), and a list of acceptable non-challenge questions can be found in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1723/lets-decide-what-kind-of-non-challenge-questions-we-want-once-and-for-all&quot;&gt;this FAQ&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Questions about help with general programming-related issues are off-topic here&lt;/strong&gt; - those belong on &lt;a href=&quot;https://stackoverflow.com&quot;&gt;Stack Overflow&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-06-10T13:39:55.810" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23490" PostTypeId="2" ParentId="2140" CreationDate="2021-06-10T14:48:59.143" Score="2" Body="&lt;h1&gt;Is there a left-right connection?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/path-finding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;path-finding&amp;#39;&quot; rel=&quot;tag&quot;&gt;path-finding&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary-matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary-matrix&amp;#39;&quot; rel=&quot;tag&quot;&gt;binary-matrix&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Given a square array of 0s and 1s, determine whether or not there exists a path of 1s connecting the leftmost and rightmost columns.  A path can take steps of one unit up, down, left or right, but not diagonally.  Every symbol on the path must be a 1, and it must start somewhere in the first column and end somewhere in the last column.&lt;/p&gt;&#xA;&lt;p&gt;Shortest code in each language wins.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;000&#xA;111   -&amp;gt;  True&#xA;111&#xA;&#xA;110&#xA;110   -&amp;gt;  False&#xA;110&#xA;&#xA;101&#xA;010   -&amp;gt;  False&#xA;101&#xA;&#xA;0     -&amp;gt;  False&#xA;&#xA;1     -&amp;gt;  True&#xA;&#xA;11110&#xA;00010&#xA;01110 -&amp;gt;  True&#xA;01000&#xA;01111&#xA;&#xA;11110&#xA;00010&#xA;01100 -&amp;gt;  False&#xA;01000&#xA;01111&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&lt;p&gt;The array may be represented in any reasonable form, such as a list of lists &lt;code&gt;[[0,0,0],[1,1,1],[1,1,1]]&lt;/code&gt; or a string &lt;code&gt;'000 111 111'&lt;/code&gt;.  It can optionally be in transposed form (so that the roles of rows and columns are exchanged; equivalently the code can instead determine whether there is a top-bottom connection). Any two distinct symbols can be used in place of 0 and 1.  The output can be in any truthy/falsy form.&lt;/p&gt;&#xA;" OwnerUserId="104303" LastEditorUserId="104303" LastEditDate="2021-06-14T12:30:38.867" LastActivityDate="2021-06-14T12:30:38.867" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23492" PostTypeId="2" ParentId="23485" CreationDate="2021-06-10T15:37:41.227" Score="3" Body="&lt;h1&gt;Posting a new challenge&lt;/h1&gt;&#xA;&lt;p&gt;Welcome to Code Golf and Coding Challenges Stack Exchange! This is a site where coding enthusiasts congregate to solve competitive challenges, not a general Q&amp;amp;A site for coding. All challenges must have an objective scoring criterion such that the winner may be fairly chosen. &lt;strong&gt;Questions asking for help with specific coding problems should be posted on Stack Overflow&lt;/strong&gt;, although we do allow &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions here asking for tips on code golfing.&lt;/p&gt;&#xA;&lt;p&gt;All challenges not tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; should first be drafted in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?answertab=active&quot;&gt;sandbox for proposed challenges&lt;/a&gt;, where feedback can be given. It is recommended to leave ideas there for at least 72 hours.&lt;/p&gt;&#xA;&lt;p&gt;Once the challenge has been through a week's time in the sandbox, there are several more things to keep in mind:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Unless your challenge is tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, it should not be language specific. This excludes participation from certain members and is discouraged.&lt;/li&gt;&#xA;&lt;li&gt;Unless the input/output format plays a crucial role in the challenge, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;avoid cumbersome I/O formats&lt;/a&gt;. Forcing certain methods of input or output further takes away from the main task.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Next, make sure to &lt;a href=&quot;https://codegolf.stackexchange.com/search&quot;&gt;search&lt;/a&gt; the website to make sure that your challenge has not been posted by someone else.&lt;/p&gt;&#xA;&lt;p&gt;Once you have performed all of the above tasks, you're ready to post your challenge!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Meta&lt;/h3&gt;&#xA;&lt;p&gt;Thoughts? Maybe the end part, couldn't think of anything to say.&lt;/p&gt;&#xA;" OwnerDisplayName="user100690" LastEditorDisplayName="user100690" LastEditDate="2021-06-11T15:56:24.893" LastActivityDate="2021-06-11T15:56:24.893" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="23494" PostTypeId="2" ParentId="23485" CreationDate="2021-06-10T16:31:37.407" Score="3" Body="&lt;p&gt;We have a Welcome to CGCC page, we should link it in the popup. Specifically, the section on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20862/68942&quot;&gt;Asking&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I propose adding this paragraph after everything mentioned so far but before the note about ignoring the two bullet points:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;We &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/20861&quot;&gt;welcome&lt;/a&gt; you to Code Golf &amp;amp; Coding Challenges Stack Exchange. The FAQ on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20862&quot;&gt;Asking good questions&lt;/a&gt; contains more details and goes more in-depth on advice for asking on this site. By following the advice in this popup and on that FAQ page, we hope that all new users will be able to understand the scope of this site and have a positive first experience with our community.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-06-10T16:31:37.407" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23495" PostTypeId="2" ParentId="1301" CreationDate="2021-06-10T17:19:01.030" Score="2" Body="&lt;p&gt;Code Golf, as of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/16556/66833&quot;&gt;June 20th 2018&lt;/a&gt;, has &lt;span class=&quot;math-container&quot;&gt;\$\LaTeX\$&lt;/span&gt; enabled on both main and meta sites. A much more complete guide on how to use Mathjax can be found &lt;a href=&quot;https://math.meta.stackexchange.com/questions/5020/mathjax-basic-tutorial-and-quick-reference&quot;&gt;here&lt;/a&gt;, but here are the basics for those not familiar:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;To include inline formula, enclose the formula with &lt;code&gt;\$&lt;/code&gt;: &lt;code&gt;\$\sin x^2\$&lt;/code&gt; is &lt;span class=&quot;math-container&quot;&gt;\$\sin x^2\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;For displayed formula, use &lt;code&gt;$$&lt;/code&gt;: &lt;code&gt;$$\frac {\log n} \pi$$&lt;/code&gt; is&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$\frac {\log n} \pi$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;For subscripts and superscripts, use &lt;code&gt;_&lt;/code&gt; and &lt;code&gt;^&lt;/code&gt;: &lt;code&gt;x_2&lt;/code&gt; (&lt;span class=&quot;math-container&quot;&gt;\$x_2\$&lt;/span&gt;) and &lt;code&gt;5^2&lt;/code&gt; (&lt;span class=&quot;math-container&quot;&gt;\$5^2\$&lt;/span&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Most operations only work on the next character: &lt;code&gt;2^10&lt;/code&gt; (&lt;span class=&quot;math-container&quot;&gt;\$2^10\$&lt;/span&gt;). In order to group multiple parts together, use &lt;code&gt;{}&lt;/code&gt;: &lt;code&gt;2^{10}&lt;/code&gt; (&lt;span class=&quot;math-container&quot;&gt;\$2^{10}\$&lt;/span&gt;). Notice the difference between &lt;span class=&quot;math-container&quot;&gt;\$x_i^2\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$x_{i^2}\$&lt;/span&gt; (&lt;code&gt;x_i^2&lt;/code&gt; and &lt;code&gt;x_{i^2}&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Fractions. There are three ways to display fractions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;\frac{a+1}{b+1}&lt;/code&gt;: &lt;span class=&quot;math-container&quot;&gt;\$\frac{a+1}{b+1}\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;\over&lt;/code&gt; for more complex fractions: &lt;code&gt;{x^2+5x-6 \over 7sin(y^3)}&lt;/code&gt; is &lt;span class=&quot;math-container&quot;&gt;\${x^2+5x-6 \over 7\sin(y^3)}\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;\cfrac&lt;/code&gt; for continued fractions: &lt;code&gt;\cfrac a b&lt;/code&gt; is &lt;span class=&quot;math-container&quot;&gt;\$\cfrac a b\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Sums and products are &lt;code&gt;\sum&lt;/code&gt; and &lt;code&gt;\prod&lt;/code&gt; respectively: &lt;span class=&quot;math-container&quot;&gt;\$\sum\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$\prod\$&lt;/span&gt;. Use a superscript argument for the value on top and a subscript for the value underneath: &lt;code&gt;\sum_{i=0}^{10} i&lt;/code&gt; is &lt;span class=&quot;math-container&quot;&gt;\$\sum_{i=0}^{10} i\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Special characters, such as &lt;code&gt;{&lt;/code&gt;,  &lt;code&gt;_&lt;/code&gt; etc. can be escaped by prefixing with a backslash: &lt;span class=&quot;math-container&quot;&gt;\$\{ \_ \$&lt;/span&gt;. A backslash should be &lt;code&gt;\backslash&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Some common symbols: &lt;code&gt;\lt \gt \le \leq \ge \geq \times \div \pm \cdot \circ \to \infty&lt;/code&gt; are &lt;span class=&quot;math-container&quot;&gt;\$\lt \gt \le \leq \ge \geq \times \div \pm \cdot \circ \to \infty\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Some common functions: &lt;code&gt;\sin \tan \cos \lim&lt;/code&gt; are &lt;span class=&quot;math-container&quot;&gt;\$\sin \tan \cos \lim\$&lt;/span&gt;. You can use subscripts to change limits: &lt;code&gt;\lim_{x \to 0}&lt;/code&gt; is &lt;span class=&quot;math-container&quot;&gt;$$\lim_{x \to 0}$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Some slightly less common things:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Matrices&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Use &lt;code&gt;$$\begin{matrix}…\end{matrix}$$&lt;/code&gt; In between the &lt;code&gt;\begin&lt;/code&gt; and &lt;code&gt;\end&lt;/code&gt;, put the matrix elements. End each matrix row with &lt;code&gt;\\&lt;/code&gt;, and separate matrix elements with &lt;code&gt;&amp;amp;&lt;/code&gt;. For example,&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;    \begin{matrix}&#xA;    1 &amp;amp; x &amp;amp; x^2 \\&#xA;    1 &amp;amp; y &amp;amp; y^2 \\&#xA;    1 &amp;amp; z &amp;amp; z^2 \\&#xA;    \end{matrix}&#xA;$$&lt;/span&gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;produces&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{matrix}&#xA;1 &amp;amp; x &amp;amp; x^2 \\&#xA;1 &amp;amp; y &amp;amp; y^2 \\&#xA;1 &amp;amp; z &amp;amp; z^2 \\&#xA;\end{matrix}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Aligned equations&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Often people want a series of equations where the equals signs are aligned. To get this, use &lt;code&gt;$$\begin{align}…\end{align}$$&lt;/code&gt;. Each line should end with &lt;code&gt;\\&lt;/code&gt;, and should contain an ampersand (&lt;code&gt;&amp;amp;&lt;/code&gt;) at the point to align at, typically immediately before the equals sign. For example,&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&lt;span class=&quot;math-container&quot;&gt;$$\begin{align}&#xA;x^2 + 2x - 1 &amp;amp; = x^2 + 2x + 1 - 2 \\&#xA;&amp;amp; = (x + 1)^2 - 2&#xA;\end{align}$$&lt;/span&gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;produces&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$\begin{align}&#xA;x^2 + 2x - 1 &amp;amp; = x^2 + 2x + 1 - 2 \\&#xA;&amp;amp; = (x + 1)^2 - 2&#xA;\end{align}$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Definitions by cases&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Use &lt;code&gt;$$\begin{cases}…\end{cases}$$&lt;/code&gt;. End each case with a &lt;code&gt;\\&lt;/code&gt;, and use &lt;code&gt;&amp;amp;&lt;/code&gt; before parts that should be aligned. For example,&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&lt;span class=&quot;math-container&quot;&gt;$$f(x) = \begin{cases}&#xA;f(x-1) + f(x-2), &amp;amp; \text{ if } x &amp;gt; 2 \\&#xA;1, &amp;amp; \text{ if } x = 1 \text{ or } x = 2&#xA;\end{cases}$$&lt;/span&gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;produces&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$f(x) = \begin{cases}&#xA;f(x-1) + f(x-2), &amp;amp; \text{ if } x &amp;gt; 2 \\&#xA;1, &amp;amp; \text{ if } x = 1 \text{ or } x = 2&#xA;\end{cases}$$&lt;/span&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-10T20:12:53.973" LastActivityDate="2021-06-10T20:12:53.973" CommentCount="0" CommunityOwnedDate="2021-06-10T17:19:01.030" ContentLicense="CC BY-SA 4.0" />
  <row Id="23496" PostTypeId="1" AcceptedAnswerId="23497" CreationDate="2021-06-10T23:35:46.837" Score="1" ViewCount="70" Body="&lt;p&gt;I've just finished making a controller for a KotH challenge, and I wanted to know: Can I use it for the KotH and license it under the GNU GPL v3, or does it have to be licensed with the MIT License to be used for a KotH on CGCC?&lt;/p&gt;&#xA;" OwnerUserId="104134" LastEditorUserId="66833" LastEditDate="2021-06-11T13:23:16.350" LastActivityDate="2021-06-11T13:23:16.350" Title="Can I license my controller for a KotH under the GNU GPL v3?" Tags="|discussion|king-of-the-hill|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="23497" PostTypeId="2" ParentId="23496" CreationDate="2021-06-10T23:37:07.320" Score="3" Body="&lt;h1&gt;You can license it however you wish offsite&lt;/h1&gt;&#xA;&lt;p&gt;The important (but still not necessary) part is that people can run it. Preferably the source should be shared for easier testing and for malware protection.&lt;/p&gt;&#xA;&lt;h1&gt;On-site, code is licensed under CC-BY-SA 4.0&lt;/h1&gt;&#xA;&lt;p&gt;This applies to controllers you post in the question, but it's probably not a good idea to put it there (e.g. if the controller includes the code for the submissions, which is bad for the same reason as leaderboards).&lt;/p&gt;&#xA;" OwnerUserId="90614" LastEditorUserId="90614" LastEditDate="2021-06-11T12:59:13.800" LastActivityDate="2021-06-11T12:59:13.800" CommentCount="0" CommunityOwnedDate="2021-06-11T12:59:13.800" ContentLicense="CC BY-SA 4.0" />
  <row Id="23498" PostTypeId="2" ParentId="2140" CreationDate="2021-06-11T00:49:40.587" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/229926/koth-floating-point-prisoners-dilemma&quot;&gt;KotH - Floating Point Prisoners Dilemma&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="104134" LastEditorUserId="66833" LastEditDate="2021-06-18T14:33:23.627" LastActivityDate="2021-06-18T14:33:23.627" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="23499" PostTypeId="2" ParentId="2140" CreationDate="2021-06-11T02:22:20.737" Score="1" Body="&lt;h1&gt;A Cat’s Game to Claim&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/229667/a-cat-s-game-to-claim&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="87594" LastEditorUserId="87594" LastEditDate="2021-06-14T17:19:27.177" LastActivityDate="2021-06-14T17:19:27.177" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23501" PostTypeId="2" ParentId="2140" CreationDate="2021-06-11T10:24:05.230" Score="0" Body="&lt;p&gt;Given matrix &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$A^n\$&lt;/span&gt;, work out any possible positive &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$\begin{pmatrix}1&amp;amp;2&amp;amp;3\\3&amp;amp;2&amp;amp;1\\1&amp;amp;0&amp;amp;1\end{pmatrix},\begin{pmatrix}36&amp;amp;32&amp;amp;44\\52&amp;amp;40&amp;amp;52\\12&amp;amp;8&amp;amp;12\end{pmatrix}\rightarrow 3\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$\begin{pmatrix}0&amp;amp;1&amp;amp;0\\0&amp;amp;0&amp;amp;1\\0&amp;amp;0&amp;amp;0\end{pmatrix},\begin{pmatrix}0&amp;amp;0&amp;amp;0\\0&amp;amp;0&amp;amp;0\\0&amp;amp;0&amp;amp;0\end{pmatrix}\rightarrow \text{any integer }\ge 3\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$\begin{pmatrix}0&amp;amp;1\\1&amp;amp;0\end{pmatrix},\begin{pmatrix}0&amp;amp;1\\1&amp;amp;0\end{pmatrix}\rightarrow \text{any odd positive integer }\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Sandbox Notes&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Since this question likely fall into pure matmul as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, will this be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;?&lt;/li&gt;&#xA;&lt;li&gt;If so, what size and &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is reasonable?&lt;/li&gt;&#xA;&lt;li&gt;Should it multiply in a modulo-&lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt; ring?&lt;/li&gt;&#xA;&lt;li&gt;If someone provide enough extra info, they have right to post this question(actually that's why I posted in sandbox)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2021-06-14T09:06:29.020" LastActivityDate="2021-06-14T09:06:29.020" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23502" PostTypeId="1" CreationDate="2021-06-11T17:45:33.003" Score="9" ViewCount="102" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox for Proposed Challenges&lt;/a&gt; is a great way for people to get feedback on challenges and make sure they are not duplicates, are clear, and are ready for posting &lt;em&gt;before&lt;/em&gt; they post it to the main site.&lt;/p&gt;&#xA;&lt;p&gt;However, with over eight thousand answers (over three thousand undeleted answers), a lot of which are posted, discarded, owned by inactive users, or otherwise no longer relevant, it can become difficult to navigate (especially for people on mobile).&lt;/p&gt;&#xA;&lt;p&gt;We previously retired and remade the Sandbox periodically, but we stopped doing that to keep it all in one easily accessible place.&lt;/p&gt;&#xA;&lt;p&gt;There is a problem with trying to move the sandbox which is that a lot of things are dependent on it being question 2140, including our site's info box, the sidebar when asking a question, several bots, etc, and moving the sandbox can cause a lot of unintended damage.&lt;/p&gt;&#xA;&lt;p&gt;Thus, here is the discussion: what should we do about the Sandbox?&lt;/p&gt;&#xA;&lt;p&gt;Please provide your opinions below. I am intentionally not offering any solutions or direction, as I want to see what the community has in mind. &amp;quot;Do absolutely nothing&amp;quot; is also an option - keep in mind that we've had this current model for years and our site hasn't burned to the ground, so it's possible no solutions solve more problems than they create.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-06-11T19:18:25.660" LastActivityDate="2021-06-11T19:18:25.660" Title="Issues with Sandbox Clutter" Tags="|discussion|sandbox|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23503" PostTypeId="2" ParentId="23502" CreationDate="2021-06-11T17:52:47.270" Score="5" Body="&lt;h1&gt;Full clean-up and improved reviewing tools&lt;/h1&gt;&#xA;&lt;p&gt;This would be a two-part plan to make the sandbox a better experience both for new users, and longtime reviewers.&lt;/p&gt;&#xA;&lt;h2&gt;Clean-up&lt;/h2&gt;&#xA;&lt;p&gt;This is something that's been discussed quite often. There are various ways to go about it, but the goals would be (at minimum):&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Adopt quality abandoned proposals&lt;/li&gt;&#xA;&lt;li&gt;Delete posted or low quality proposals&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;If this is going to be done, more waiting just means more posts pile up.&lt;/p&gt;&#xA;&lt;h2&gt;Reviewing tools&lt;/h2&gt;&#xA;&lt;p&gt;For reviewing, the sandbox's layout is not optimal. For people who spend a good amount of time helping out, additional unofficial tools may be helpful.&lt;/p&gt;&#xA;&lt;p&gt;This would include things like keeping the sandbox viewer userscript up-to-date, and getting the guild of reviewers bots working.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-06-11T17:52:47.270" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23505" PostTypeId="2" ParentId="2140" CreationDate="2021-06-11T22:41:26.867" Score="2" Body="&lt;h1&gt;Consecutive Distance Rating &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/229724/consecutive-distance-rating&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="97916" LastEditorUserId="97916" LastEditDate="2021-06-15T09:27:15.990" LastActivityDate="2021-06-15T09:27:15.990" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23506" PostTypeId="5" CreationDate="2021-06-12T23:56:48.060" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/suggest-tag-synonyms&quot;&gt;Tag synonyms&lt;/a&gt; are a system that allows users to fix incorrect tags. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; has the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/mathematics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;mathematics&amp;#39;&quot; rel=&quot;tag&quot;&gt;mathematics&lt;/a&gt; synonym. This means that the synonym tag always shows up as the parent tag in searches, edits and more.&lt;/p&gt;&#xA;&lt;p&gt;Any user with 2500 reputation or more, and who has an answer score of 5 or more in a tag can suggest synonyms for that tag. Those users can also vote on suggested synonyms. If a suggestion reaches 4 approval votes, the synonym is voted. Additionally, all moderators can force an approval or rejection of synonym suggestions&lt;/p&gt;&#xA;&lt;p&gt;If you have a suggestion for a tag synonym or would like to increase attention around a pending synonym suggestion, open a new meta question, tagged with &lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/tag&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tag&amp;#39;&quot; rel=&quot;tag&quot;&gt;tag&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/synonym-request&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;synonym-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;synonym-request&lt;/a&gt; and make a clear case for why the two tags are synonyms.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-12T23:56:48.060" LastActivityDate="2021-06-12T23:56:48.060" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23507" PostTypeId="4" CreationDate="2021-06-12T23:56:48.060" Score="0" Body="For questions that request that one tag be made a synonym of another tag" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-12T23:56:48.060" LastActivityDate="2021-06-12T23:56:48.060" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23508" PostTypeId="5" CreationDate="2021-06-13T00:35:03.660" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/questions/214337/what-is-a-tag-wiki-how-do-i-write-a-good-one&quot;&gt;Tag wikis&lt;/a&gt; are the way to explain how a tag should be used, and what it's about. This is a tag wiki, specifically for the &lt;a href=&quot;/questions/tagged/tag-wikis&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tag-wikis&amp;#39;&quot; rel=&quot;tag&quot;&gt;tag-wikis&lt;/a&gt; tag.&lt;/p&gt;&#xA;&lt;p&gt;A tag wiki is split into 2 parts: the excerpt and the wiki. The excerpt is the shown, plaintext bit that is shown whenever you hover over a tag, or when adding a tag to a question. The wiki, this, is the main meat of the tag that informs you when to use it and what the tag is about. Any user with an account can suggest an edit to a tag wiki, but any user with less than 20000 has to have that edit &lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits&quot;&gt;approved&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This tag should be used on questions about tag wikis, such as suggesting changes to existing wikis, requesting that a specific tag have a wiki written for it or requesting clarifications on an existing tag wiki.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-13T00:35:03.660" LastActivityDate="2021-06-13T00:35:03.660" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23509" PostTypeId="4" CreationDate="2021-06-13T00:35:03.660" Score="0" Body="In order to explain what a tag means, what questions it should be used on and more, tags have tag wikis - this. This tag should be used on questions specifically about tag wikis" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-13T00:35:03.660" LastActivityDate="2021-06-13T00:35:03.660" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23510" PostTypeId="2" ParentId="2140" CreationDate="2021-06-13T08:18:05.617" Score="3" Body="&lt;h1&gt;Generalised multi-dimensional chess knight's moves &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot;&gt;chess&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/229624&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2021-06-14T06:50:43.120" LastActivityDate="2021-06-14T06:50:43.120" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23511" PostTypeId="2" ParentId="2140" CreationDate="2021-06-13T10:23:09.137" Score="0" Body="&lt;h1&gt;I am not a dad!&lt;/h1&gt;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&lt;p&gt;Given a non-empty string. Check if it starts with &amp;quot;I am&amp;quot;/&amp;quot;I'm&amp;quot; (case-insensitive) and if it is, output the dad joke. Otherwise, terminate&lt;br&gt;&#xA;P.S. There must be nothing in the STDERR.&lt;/p&gt;&#xA;&lt;h1&gt;Examples:&lt;/h1&gt;&#xA;&lt;p&gt;&amp;quot;I am an idiot&amp;quot; -&amp;gt; &amp;quot;Hi an idiot, I am Dad&amp;quot;&lt;br&gt;&#xA;&amp;quot;I am rewuytheruty&amp;quot; -&amp;gt; &amp;quot;Hi rewuytheruty, I am Dad&amp;quot;&lt;br&gt;&#xA;&amp;quot;i Am case insensitive&amp;quot; -&amp;gt; &amp;quot;Hi case insensitive, I am Dad&amp;quot;&lt;br&gt;&#xA;&amp;quot;I'm A&amp;quot; -&amp;gt; &amp;quot;Hi A, I am Dad&amp;quot;&lt;br&gt;&#xA;&amp;quot;i'M B&amp;quot; -&amp;gt; &amp;quot;Hi B, I am Dad&amp;quot;&lt;br&gt;&#xA;&amp;quot;Iam together&amp;quot; -&amp;gt; terminated&lt;br&gt;&#xA;&amp;quot;Nothing here!&amp;quot; -&amp;gt; terminated&lt;br&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the answer with shortest bytes wins.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;These&lt;/a&gt; loopholes are, obviously, forbidden.&lt;/li&gt;&#xA;&lt;li&gt;Standard code-golf rules apply.&lt;/li&gt;&#xA;&lt;li&gt;Please specify the language you are using and the amount of bytes.&lt;/li&gt;&#xA;&lt;li&gt;It would be great if you would put a link to a sandbox where your code can be ran in action, such as &lt;a href=&quot;https://tio.run&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Explaining your code is very welcomed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="95769" LastEditorUserId="95769" LastEditDate="2021-06-14T12:53:09.120" LastActivityDate="2021-06-14T12:53:09.120" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23512" PostTypeId="1" AcceptedAnswerId="23514" CreationDate="2021-06-14T00:26:09.357" Score="10" ViewCount="257" Body="&lt;p&gt;&lt;a href=&quot;https://codidact.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Codidact&lt;/a&gt; is a related network of sites to Stack Exchange, created in the aftermath of &lt;a href=&quot;https://meta.stackexchange.com/q/333965/355458&quot;&gt;behaviour by Stack Exchange in late 2019&lt;/a&gt;, in an effort to &lt;a href=&quot;https://meta.codidact.com/posts/276296&quot; rel=&quot;nofollow noreferrer&quot;&gt;create a better Q&amp;amp;A network&lt;/a&gt;. One of the sites in their network is &lt;a href=&quot;https://codegolf.codidact.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Code Golf&lt;/a&gt;, where a &lt;a href=&quot;https://codegolf.codidact.com/users&quot; rel=&quot;nofollow noreferrer&quot;&gt;large number of CGCC users&lt;/a&gt; have started to contribute. The site has significantly less activity than this site, and so users often &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=58177257#58177257&quot;&gt;advertise&lt;/a&gt; their new challenges posted there in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Recently, &lt;a href=&quot;https://chat.stackexchange.com/users/463092&quot;&gt;bobble&lt;/a&gt; suggested &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/58328325#58328325&quot;&gt;adding a TNB feed&lt;/a&gt; for new Codidact challenges via their &lt;a href=&quot;https://codegolf.codidact.com/categories/49/feed.rss&quot; rel=&quot;nofollow noreferrer&quot;&gt;RSS feed&lt;/a&gt;. Codidact currently gets around one challenge every 5 days&lt;sup&gt;[1]&lt;/sup&gt; (compared to our 25 per week&lt;sup&gt;[2]&lt;/sup&gt;), so this is unlikely to be disruptive to the room, and would increase activity for challenges on their site.&lt;/p&gt;&#xA;&lt;p&gt;However, Codidact is a &lt;a href=&quot;https://meta.stackexchange.com/questions/364556/the-future-of-community-promotion-open-source-and-hot-network-questions-ads#comment1216865_364556&quot;&gt;competitor to SE&lt;/a&gt;, and is a completely separate site. We've &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7079/do-we-want-xkcd-autposted-in-chat&quot;&gt;rejected&lt;/a&gt; proposals to have feeds for non-CGCC related posts, and currently, all &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/21931/66833&quot;&gt;3&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/22365/66833&quot;&gt;bots&lt;/a&gt; and &lt;a href=&quot;https://chat.stackexchange.com/rooms/info/240/the-nineteenth-byte?tab=feeds&quot;&gt;4 feeds&lt;/a&gt; operating in The Nineteenth Byte all post CGCC posts.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, I believe this would benefit from a community discussion, answering:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should new challenges posted on Codidact be posted into The Nineteenth Byte?&lt;/li&gt;&#xA;&lt;li&gt;Should &lt;a href=&quot;https://codegolf.codidact.com/categories/50&quot; rel=&quot;nofollow noreferrer&quot;&gt;Codidact Sandbox&lt;/a&gt; and/or &lt;a href=&quot;https://codegolf.codidact.com/categories/48&quot; rel=&quot;nofollow noreferrer&quot;&gt;Codidact Meta&lt;/a&gt; questions be posted into The Nineteenth Byte?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sub&gt;[1]: &lt;a href=&quot;https://codegolf.codidact.com/posts/281368&quot; rel=&quot;nofollow noreferrer&quot;&gt;This&lt;/a&gt; was posted close to 2 months ago on Codidact. Since then, they've had &lt;a href=&quot;https://codegolf.codidact.com/categories/49?sort=age&quot; rel=&quot;nofollow noreferrer&quot;&gt;11 challenges&lt;/a&gt;, making ~5 days between challenges&lt;/sub&gt;&#xA;&lt;br&gt;&#xA;&lt;sub&gt;[2]: We &lt;a href=&quot;https://stackexchange.com/sites#questionsperday&quot;&gt;currently have&lt;/a&gt; around 3.5 questions/day, making 24.5 questions/week&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="68942" LastEditDate="2021-06-15T19:43:40.193" LastActivityDate="2021-06-15T19:43:40.193" Title="Should new challenges on Codidact be posted into The Nineteenth Byte?" Tags="|discussion|status-completed|chat|rss|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23514" PostTypeId="2" ParentId="23512" CreationDate="2021-06-14T01:47:54.833" Score="13" Body="&lt;h2&gt;Yes - challenges should be posted&lt;/h2&gt;&#xA;&lt;p&gt;For those of us who want to participate more actively on Codidact (including myself, and I know of a couple of others), this is a good reminder or a good way to let us know about challenges that we can go &lt;s&gt;FGITW in golfing languages&lt;/s&gt; think about and solve with our very high IQ and brainpower.&lt;/p&gt;&#xA;&lt;p&gt;I often forget about Codidact and forget to check it out because I don't feel as much of a community sense as when I'm here with y'all especially in chat. It doesn't draw me back in the same way, but I would like to participate there. This is not only a good way to remind individuals of it but a way to spur discussion on it, and getting more people to talk about a new challenge or new ideas together is a way to build that community portion that's missing and build that critical mass.&lt;/p&gt;&#xA;&lt;p&gt;For the record, I do not intend for Codidact to replace SE. For reasons that are probably not very difficult to see, I am not advocating ditching SE, or that we should move our whole community there. I am simply saying that for those of us who want to &lt;em&gt;also&lt;/em&gt; participate there &lt;em&gt;on top of&lt;/em&gt; here, it gives incentive, spawns discussion, and acts as a reminder.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;For those of us who don't care, we can just ignore it. Sort of how you can just ignore a sandbox post that's been oneboxed. TNB follows the rule that &amp;quot;off-topic stuff is fine until on-topic discussion starts&amp;quot;, so Codidact-related discussions are of a lower priority, so you don't have to worry about it cutting off important topics or conversations as a mod or RO should rule that that discussion should go to another room or over to Codidact itself.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;However, I am not sure about meta or the sandbox. For now, I am not voting on that. It would be a good idea to create those as separate answers to vote for, so that people can vote on them independently.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-06-14T02:05:56.913" LastActivityDate="2021-06-14T02:05:56.913" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23515" PostTypeId="2" ParentId="2140" CreationDate="2021-06-14T11:13:17.307" Score="1" Body="&lt;h1&gt;Build a raw string&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;In this challenge you will write code which, given a single line string as input, can output the raw version.&lt;/p&gt;&#xA;&lt;h2&gt;Full spec&lt;/h2&gt;&#xA;&lt;p&gt;The input will be a string like &lt;code&gt;ab\n&lt;/code&gt; or &lt;code&gt;ab\u0065e\\&lt;/code&gt; or &lt;code&gt;e\'543&lt;/code&gt;. These strings should be converted to a raw version which uses the backslashes.&lt;/p&gt;&#xA;&lt;p&gt;This probably sounds confusing, so here is a more complete explanation.&lt;/p&gt;&#xA;&lt;p&gt;The most common form of strings used is simply a quote (one of &lt;code&gt;'&lt;/code&gt;, &lt;code&gt;&amp;quot;&lt;/code&gt; or the backtick), followed by a sequence of unicode characters, then a closing quote which corresponds the opening one. &lt;code&gt;&amp;quot;abc&amp;quot;&lt;/code&gt; or &lt;code&gt;'THIS is a St%ing'&lt;/code&gt;, for instance. Note that this is not the case in all languages, for instance most golfing languages do not represent strings in this manner.&lt;/p&gt;&#xA;&lt;p&gt;However, it's not that simple. Backslashes allow for much more complex strings, and their importance in allowing certain characters means a string like &lt;code&gt;'ab\'&lt;/code&gt; is invalid as the backslash &amp;quot;escapes&amp;quot; the quote. Making a backslash appear in a string requires &lt;code&gt;\\&lt;/code&gt; instead.&lt;/p&gt;&#xA;&lt;p&gt;Also, quotes can be escaped via &lt;code&gt;\'&lt;/code&gt;, &lt;code&gt;\&amp;quot;&lt;/code&gt; or &lt;code&gt;\`&lt;/code&gt;. A sequence like &lt;code&gt;\\&amp;quot;&lt;/code&gt; should become &lt;code&gt;\&amp;quot;&lt;/code&gt; while &lt;code&gt;\&amp;quot;\&lt;/code&gt; is invalid.&lt;/p&gt;&#xA;&lt;p&gt;The newline and tab are both important, and so most mainstream languages have the &lt;code&gt;\n&lt;/code&gt; and &lt;code&gt;\t&lt;/code&gt; which are actually 1 character each, representing the newline and the tab, respectively. So &lt;code&gt;\\t\&amp;quot;\n&lt;/code&gt; becomes&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;\t&amp;quot;&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(note the trailing newline)&lt;/p&gt;&#xA;&lt;p&gt;To add an extra layer of usability for &amp;quot;exotic&amp;quot; characters, it is possible to use a &lt;strong&gt;unicode escape&lt;/strong&gt;: of the form &lt;code&gt;\uxxxx&lt;/code&gt; where each &lt;code&gt;x&lt;/code&gt; is one of &lt;code&gt;0123456789abcdef&lt;/code&gt;. This transforms into the unicode character whose codepoint is equal to the base-10 equivalent to the hexadecimal number &lt;code&gt;xxxx&lt;/code&gt;. For instance &lt;code&gt;\u0031&lt;/code&gt; becomes &lt;code&gt;1&lt;/code&gt; because &lt;code&gt;31&lt;/code&gt; in hexadecimal is &lt;code&gt;49&lt;/code&gt; in base 10, and &lt;code&gt;1&lt;/code&gt; has a codepoint of 49.&lt;/p&gt;&#xA;&lt;p&gt;Your input string may contain any of these escapes, and you may assume that &lt;code&gt;\&lt;/code&gt; is followed only by the backtick or any of &lt;code&gt;\'&amp;quot;tnu&lt;/code&gt;. The unicode escape sequence is guaranteed to be valid, and escapes as well.&lt;/p&gt;&#xA;&lt;p&gt;You should output this string after the transformations described.&lt;/p&gt;&#xA;&lt;h3&gt;Worked example&lt;/h3&gt;&#xA;&lt;p&gt;Input string:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ab%\u0035e\n\n\t5\'e\\54c%&amp;amp;\u0095&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The first three characters remain identical.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;\u0035&lt;/code&gt; becomes &lt;code&gt;5&lt;/code&gt; because 35 in hex -&amp;gt; 53 in base 10, and &lt;code&gt;String.fromCharCode(53) === '5'&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;\n\n\t&lt;/code&gt; becomes two newlines followed by a tab.&lt;/p&gt;&#xA;&lt;p&gt;5 remains 5.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;\'&lt;/code&gt; becomes &lt;code&gt;'&lt;/code&gt;: escaped by backslash&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;e&lt;/code&gt; remains &lt;code&gt;e&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;\\&lt;/code&gt; becomes &lt;code&gt;\&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;54c%&amp;amp;&lt;/code&gt; stays the same.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;\u0095&lt;/code&gt; is an unprintable with codepoint 149.&lt;/p&gt;&#xA;&lt;p&gt;Result:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ab%5e&#xA;&#xA;    5'e\54c%&amp;amp;&amp;lt;unprintable&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(&lt;code&gt;&amp;lt;unprintable&amp;gt;&lt;/code&gt; is an actual unprintable character)&#xA;Note that functions capable of evaluating such strings are disallowed. To be clear, &lt;strong&gt;your program must handle the syntax described above&lt;/strong&gt;, and not any other format.&lt;/p&gt;&#xA;&lt;p&gt;Other test cases:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Input&lt;/th&gt;&#xA;&lt;th&gt;Output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;\'\&amp;quot;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;'&amp;quot;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;\\&amp;quot;\'&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;\&amp;quot;'&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;\\u0031\u0031\\t&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;\u00311\t&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;\\\\\\\\\n&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;\\\\&amp;lt;NL&amp;gt;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;[&lt;code&gt;&amp;lt;NL&amp;gt;&lt;/code&gt; is newline]&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Meta:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Duplicate? Couldn't find anything.&lt;/li&gt;&#xA;&lt;li&gt;Any clarifications needed?&lt;/li&gt;&#xA;&lt;li&gt;Better title / tags?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user100690" LastEditorDisplayName="user100690" LastEditDate="2021-06-15T15:39:37.063" LastActivityDate="2021-06-15T15:39:37.063" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="23516" PostTypeId="2" ParentId="23512" CreationDate="2021-06-14T16:13:16.390" Score="4" Body="&lt;h2&gt;No - meta posts should &lt;em&gt;not&lt;/em&gt; be posted&lt;/h2&gt;&#xA;&lt;p&gt;Everything that feeds into TNB should have some connection to Code Golf Stack Exchange. Old Sandbox Posts connects to our Sandbox, which is part of our site. Our other seven feeds / bot configurations all connect to bounties on our site, meta (which is about our site), challenges to our site, answers to a challenge on our site, etc.&lt;/p&gt;&#xA;&lt;p&gt;Cross-posting challenges from Codidact makes sense because it connects to the &lt;em&gt;Code Golf&lt;/em&gt; part of our site, and presumably everyone on &lt;em&gt;Code Golf Stack Exchange&lt;/em&gt; is interested in &lt;em&gt;Code Golf&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;However, Codidact Meta is connected to Code Golf Codidact, and not to either &lt;em&gt;Code Golf&lt;/em&gt; or &lt;em&gt;Stack Exchange&lt;/em&gt;, and thus I believe it would be off-topic for a feed into TNB.&lt;/p&gt;&#xA;&lt;p&gt;If there is interest, a chat room could be created regarding Codidact discussion, and then all of these feeds would make a lot of sense to go there, but I don't think a feed from their meta should be put here, because the average person will probably be interested (or at least not really disinterested) in a code golf challenge on another site, but probably not so much a (meta) discussion regarding another site.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-06-14T16:13:16.390" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23517" PostTypeId="2" ParentId="23512" CreationDate="2021-06-14T16:26:31.057" Score="4" Body="&lt;h2&gt;Codidact Sandbox posts should &lt;em&gt;not&lt;/em&gt; be posted&lt;/h2&gt;&#xA;&lt;p&gt;The Codidact Sandbox is a bit of a grey area in my opinion - posts there are more relevant to us than posts to their meta, but less relevant than their challenges. However, I don't think it is necessary to post Codidact Sandbox posts automatically into The Nineteenth Byte.&lt;/p&gt;&#xA;&lt;p&gt;I can just about justify Codidact main as growing a partner site to us, and increasing exposure to a site users here will be interested in. Stack Exchange may consider Codidact to be a competitor, but a lot of us treat it more as an additional place to go golfing.&lt;/p&gt;&#xA;&lt;p&gt;However, CGCC is not Codidact. Codidact has its own &lt;a href=&quot;https://discord.gg/bv2aaGa&quot; rel=&quot;nofollow noreferrer&quot;&gt;chat&lt;/a&gt;, is an independent site, and I for one don't want the two sites to effectively become dependent on either the other one. I think its perfectly appropriate for users to ask for feedback on their Codidact Sandboxed posts in TNB, and I'm not opposed to having a feed/bot into &lt;a href=&quot;https://chat.stackexchange.com/rooms/123403/the-guild-of-reviewers&quot;&gt;The Guild of Reviewers&lt;/a&gt;. But I don't think these posts should be posted into The Nineteenth Byte, as they are (IMO) not relevant enough to deserve more feed clutter&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-06-14T16:26:31.057" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23519" PostTypeId="2" ParentId="2140" CreationDate="2021-06-15T03:12:07.900" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/COBOL&quot; rel=&quot;nofollow noreferrer&quot;&gt;COBOL&lt;/a&gt;(lite) interpreter.&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to code an interpreter for &lt;a href=&quot;https://en.wikipedia.org/wiki/COBOL&quot; rel=&quot;nofollow noreferrer&quot;&gt;COBOL&lt;/a&gt;. This interpreter should use the free format, and cut a few corners, as long as a few test scripts will run on it.&lt;/p&gt;&#xA;&lt;p&gt;Notice; here I say interpreter, as that is the general direction of my inclination, however if it may save bytes, a compiler would also count.&lt;/p&gt;&#xA;&lt;h3&gt;Try to:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Golf your code as much as possible&lt;/li&gt;&#xA;&lt;li&gt;Remove some parts of COBOL (But ask here first to see if they make sense to remove.&lt;/li&gt;&#xA;&lt;li&gt;Accept both &lt;code&gt;CAPITAL&lt;/code&gt; and &lt;code&gt;lowercase&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Avoid:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default/1085#1085&quot;&gt;Standard Loopholes&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Don't remove too many parts of COBOL. I think that &lt;code&gt;IDENTIFICATION DIVISION.&lt;/code&gt; could be ignored, but &lt;code&gt;DATA DIVISION.&lt;/code&gt; is probably necessary.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If there is a thing that you would like to clarify on, ask in the comments. I think that this question still could stand with improvement, before it can be added to the main cg se.&lt;/p&gt;&#xA;" OwnerUserId="104373" LastEditorUserId="104373" LastEditDate="2021-06-16T00:28:07.743" LastActivityDate="2021-06-16T00:28:07.743" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23520" PostTypeId="2" ParentId="18182" CreationDate="2021-06-15T16:52:53.090" Score="5" Body="&lt;p&gt;The different background color on the meta profile rep has been removed, resolving this issue.&lt;/p&gt;&#xA;" OwnerUserId="11952" LastActivityDate="2021-06-15T16:52:53.090" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23521" PostTypeId="2" ParentId="2140" CreationDate="2021-06-15T22:13:22.710" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/230331/&quot;&gt;Time till Friday&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2021-06-22T21:58:52.000" LastActivityDate="2021-06-22T21:58:52.000" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23523" PostTypeId="2" ParentId="2140" CreationDate="2021-06-16T01:05:39.467" Score="2" Body="&lt;p&gt;Title: Make a WebCrawler dictionary writer.&lt;/p&gt;&#xA;&lt;p&gt;Notice: for any text within &amp;lt;&amp;gt; tags, please ignore any .'s. These are simply added so that they are treated as plain text, and not code.&lt;/p&gt;&#xA;&lt;p&gt;Your goal is to make a program that acts as a regular WebCrawler, but also writes a dictionary using the websites.&lt;/p&gt;&#xA;&lt;p&gt;You should have a list that is used to store words that have been added called Dictionary, and another list to store website urls called NextSites. You should also have a variable called sites, and a variable called input2. Any other variables or lists are optional.&lt;/p&gt;&#xA;&lt;p&gt;It should ask for input upon running the program, allowing you to input a website url, from where it will start web crawling. How it asks for input does not matter, so long as you are able to use any website as input. It should then ask for input again, allowing you to chose how many sites it should continue for. The variable much should be set to this input.&lt;/p&gt;&#xA;&lt;p&gt;Next, it should check the website for any text contained within &amp;lt;.p&amp;gt; tags. It should separate the text contained within the tag at any space contained in it. Next, it will compare each part that has been separated against the current text in the list used to store words. Any part that is not already in the list should be added to it.&lt;/p&gt;&#xA;&lt;p&gt;After it has checked all of the text within the &amp;lt;.p&amp;gt; tags on the site, it should check for any &amp;lt;.a&amp;gt; tags on the site. Any urls that it finds in the 'href' part of the &amp;lt;.a&amp;gt; tag should be added to the website url list, so long as the url list is not larger than 99 urls. (This means that the maximum amount of urls that can be in the url list at any one time is 100).&lt;/p&gt;&#xA;&lt;p&gt;When all of the &amp;lt;.a&amp;gt; tags on the site have been checked for urls, it should change the current site it is on to the first site in the list of urls. It should remove this url from the list, and move all other urls to the spot one less than them on the list, so that there is no empty space at the beginning. (eg: If you had 3 urls: 1. google.com , 2. wikipedia.com , 3.stackexchange.com, then after switching to google.com, the list would now be 1. wikipedia.com , 2.stackexchange.com .)&lt;/p&gt;&#xA;&lt;p&gt;It should then repeat the above steps, and continue to do so until the variables sites and much are the same.&lt;/p&gt;&#xA;&lt;p&gt;Next, it should should output the entire list of words that it found. The method used to output it does not matter, so long as all words in the list are outputted, with a new line for each word.&#xA;E.g.: You may have found the words cat, mouse, and food. The output would look as follows: &lt;p&gt; cat &lt;p&gt; mouse &lt;p&gt; food&lt;/p&gt;&#xA;&lt;p&gt;Scoring: The scoring follows regular code golf rules. The person with the smallest program in bytes wins. However, in the case of a tie between two programs, the program that can webcrawl and write the dictionary starting on wikipedia.com for 100 sites fastest will win.&lt;/p&gt;&#xA;" OwnerUserId="104229" LastActivityDate="2021-06-16T01:05:39.467" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23524" PostTypeId="1" AcceptedAnswerId="23525" CreationDate="2021-06-16T02:49:34.427" Score="4" ViewCount="427" Body="&lt;p&gt;Is there an online tool that will tell me the number of bytes in a UTF-8 character?  Or, if not, how do I determine this?&lt;/p&gt;&#xA;&lt;p&gt;I'm currently trying to determine the number of the bytes for the left and right floor characters:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;⌊&lt;/code&gt; (&lt;code&gt;\[LeftFloor]&lt;/code&gt;) = U+230A&#xA;&lt;a href=&quot;https://unicode-table.com/en/230A/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://unicode-table.com/en/230A/&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;⌋ &lt;/code&gt; (&lt;code&gt;\[RightFloor]&lt;/code&gt;) = U+230B&#xA;&lt;a href=&quot;https://unicode-table.com/en/230B/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://unicode-table.com/en/230B/&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I looked through &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10145/how-to-count-bytes-faq&quot;&gt;this FAQ&lt;/a&gt;, but was unable to find an answer.&lt;/p&gt;&#xA;&lt;h1&gt;Update&lt;/h1&gt;&#xA;&lt;p&gt;Thanks for the answers!  I tried the various byte counters, and I ran into two issues:&lt;/p&gt;&#xA;&lt;p&gt;(1) I found that one program, Mego's Byte Counter, gives a different UTF-8 value from the other three for the italicized pi (see first screenshot).  Either (as seems more likely) Mego's is incorrect, or the other three all are. Whichever of these is incorrect, they may have other errors as well.&lt;/p&gt;&#xA;&lt;p&gt;Here are my test glyphs:&lt;/p&gt;&#xA;&lt;p&gt;glyph 1:   (italicized pi)&lt;/p&gt;&#xA;&lt;p&gt;glyph 2: π (plain-text pi)&lt;/p&gt;&#xA;&lt;p&gt;For glyph 1 (), Mego's Byte Counter reports six bytes, while the others say four:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/TmFm1.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/TmFm1.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For glyph 2 (π), all report two bytes:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/jIbE3.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/jIbE3.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;(2) With some glyphs, like those for pi, it's pretty easy to tell when you aren't using the lowest-byte-count version of the glyph (you want the plain-text rather than the italicized version). But what if you're dealing with ones that aren't so obvious, like arrows and other more unusual symbols?  Are there cases where you might, say, use an arrow and get x bytes, not realizing there's another version of an arrow that is x-1 bytes?  If so, is there a good online listing of minimal-UTF-8-byte-count versions of each type of glyph?&lt;/p&gt;&#xA;&lt;p&gt;Now you might ask:  Why not just copy the glyph from the front end of the program you're using (in my case, Mathematica), since that way you'll be able to determine the byte count of the actual glyph the program uses.  The problem is that, when I do that, I don't get the glyph:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/7PUZe.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/7PUZe.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="104057" LastEditorUserId="104057" LastEditDate="2021-06-21T15:31:53.133" LastActivityDate="2021-06-21T15:31:53.133" Title="Online tool to determine number of bytes for UTF-8 characters?" Tags="|support|code-golf|scoring|" AnswerCount="3" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="23525" PostTypeId="2" ParentId="23524" CreationDate="2021-06-16T02:51:24.803" Score="3" Body="&lt;p&gt;TIO includes a byte counter. For languages with an SBCS, this just counts the number of characters, but for most languages, you'll notice they use UTF-8. For example, if you go to the &lt;a href=&quot;https://tio.run/#python3&quot; rel=&quot;nofollow noreferrer&quot;&gt;Python 3 TIO&lt;/a&gt;, in the top-right corner, it says &amp;quot;UTF-8&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;You can simply paste your code into the code box for any language that uses UTF-8 encoding and it'll give you the character and byte count in that encoding.&lt;/p&gt;&#xA;&lt;p&gt;Just be careful not to use a language with an SBCS - that'll just give the character count as the byte count.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-06-16T02:51:24.803" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23526" PostTypeId="2" ParentId="2140" CreationDate="2021-06-16T07:07:14.173" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/229979/draw-an-ascii-grid&quot;&gt;Draw an Ascii Grid&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="99035" LastEditorUserId="99035" LastEditDate="2021-06-18T19:06:00.980" LastActivityDate="2021-06-18T19:06:00.980" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23527" PostTypeId="2" ParentId="2140" CreationDate="2021-06-16T07:20:52.187" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/230145/implement-a-cleave-function&quot;&gt;Implement a cleave function&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/functional-programming&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;functional-programming&amp;#39;&quot; rel=&quot;tag&quot;&gt;functional-programming&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="97916" LastEditorUserId="97916" LastEditDate="2021-06-21T06:33:31.220" LastActivityDate="2021-06-21T06:33:31.220" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="23528" PostTypeId="2" ParentId="2140" CreationDate="2021-06-16T09:54:29.537" Score="0" Body="&lt;p&gt;Write a shortest bijective program from String to Object.&lt;/p&gt;&#xA;&lt;p&gt;You can specify two sets of chars &lt;span class=&quot;math-container&quot;&gt;\$C_1\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$C_2\$&lt;/span&gt;, both of which consist of at least 4 different chars&lt;sup&gt;[1]&lt;/sup&gt;, and define:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;String: string consisting of only chars in &lt;span class=&quot;math-container&quot;&gt;\$C_1\$&lt;/span&gt; &lt;code&gt;[C₁]*&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Name: non-empty string consisting of only chars in &lt;span class=&quot;math-container&quot;&gt;\$C_2\$&lt;/span&gt; &lt;code&gt;[C₂]+&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Object: a finite map from Name to Object, such that every way to go down finally go to empty Object(empty map)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Reasonable I/O allowed. Outputting in &lt;code&gt;Object&lt;/code&gt; in languages like JavaScript, Array/String with proper encoding, folder, shuld be fine.&lt;/p&gt;&#xA;&lt;h1&gt;Notes&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;[1] unary or binary is too easy.&lt;/li&gt;&#xA;&lt;li&gt;I meant to map to folder but folder charset is bad, then decided to give you choice.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Sandbox Notes&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What does &lt;code&gt;proper encoding&lt;/code&gt; mean? Or do I just remove the allowance?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2021-06-16T09:54:29.537" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23529" PostTypeId="2" ParentId="2140" CreationDate="2021-06-16T10:01:21.407" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/230024/minimal-distinct-character-quine/230025#230025&quot;&gt;Minimal distinct character quine &lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2021-06-19T11:51:53.240" LastActivityDate="2021-06-19T11:51:53.240" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23530" PostTypeId="2" ParentId="23524" CreationDate="2021-06-16T10:27:06.850" Score="3" Body="&lt;p&gt;I've always used this &lt;a href=&quot;https://mothereff.in/byte-counter&quot; rel=&quot;nofollow noreferrer&quot;&gt;byte counter&lt;/a&gt; which in fact gives you both character and byte counts.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2021-06-16T10:27:06.850" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23531" PostTypeId="2" ParentId="2140" CreationDate="2021-06-16T12:09:27.290" Score="1" Body="&lt;h2&gt;Do these points approximately make up a regular n-sided polygon?&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The input is a set of integer coordinates. Take them in whatever form you want, e.g. a list of tuples or just a plain list. The question is: can you draw an n-sided regular polygon with vertices at the specified coordinates? &lt;em&gt;n&lt;/em&gt; being the amount of coordinates provided. Answer truthy if yes, falsy if no.&lt;/p&gt;&#xA;&lt;p&gt;The level of precision is in integers. That means you will have to round both the x and y values of the ideal polygons to the nearest whole values. Here's an example diagram:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/zdOfh.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/zdOfh.png&quot; alt=&quot;example&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The triangle has points at &lt;em&gt;approximately&lt;/em&gt; (5,5), (4,9), (1,6). You can draw a regular triangle to fit these coordinates, even if the actual points of the triangle are not at quite the same coordinates.&lt;/p&gt;&#xA;&lt;p&gt;The same goes for the pentagon. The coordinate set (3,1), (7,1), (8,5), (5,8), (2,5) makes up a regular pentagon-ish, accurate to whole values.&lt;/p&gt;&#xA;&lt;p&gt;Any set of coordinates can make up an infinite amount of approximate n-gons. You answer truthy if there's at least one such n-gon. One way of thinking about it is to consider a unit square around each of the points, then determine if you can stretch a regular polygon such that every point falls within the squares.&lt;/p&gt;&#xA;&lt;p&gt;Further ground rules:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The coordinates will always be positive.&lt;/li&gt;&#xA;&lt;li&gt;They do not have to be in any particular order.&lt;/li&gt;&#xA;&lt;li&gt;Coordinate values will never exceed 1000.&lt;/li&gt;&#xA;&lt;li&gt;There will not be more than 10 coordinates.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Examples:&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;(5,5), (4,9), (1,6) -&amp;gt; true&#xA;(3,1), (7,1), (8,5), (5,8), (2,5) -&amp;gt; true&#xA;(1,1), (1,1), (2,1) -&amp;gt; true&#xA;(1,1), (2,1), (130,1) -&amp;gt; false&#xA;&#xA;(42,42) -&amp;gt; true&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(according to &lt;a href=&quot;https://en.wikipedia.org/wiki/Monogon&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;, a monogon is still a polygon, meaning any input is valid.)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(0,1), (5,10) -&amp;gt; true &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(any two points make up a regular bigon so this should work for any coordinates)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(1,3), (1,3), (1,3), (1,3) -&amp;gt; true&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(any set identical coordinates will always match an n-gon that's tiny enough to have all of its coordinates rounded to the same integer).&lt;/p&gt;&#xA;" OwnerUserId="81594" LastEditorUserId="81594" LastEditDate="2021-06-26T09:41:40.380" LastActivityDate="2021-06-26T09:41:40.380" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23532" PostTypeId="2" ParentId="23524" CreationDate="2021-06-16T12:40:18.613" Score="3" Body="&lt;p&gt;Here a couple of counters made by CGCC community members:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;http://mego.github.io/ByteCounter/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Byte Counter&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/45941&quot;&gt;Mego&lt;/a&gt; (account deleted)&lt;/p&gt;&#xA;&lt;p&gt;Outputs all (supported) code pages where the inputted text is a valid encoding. Outputs the length and the list of bytes in hex/ The current list of supported encodings are:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;pre&gt;&lt;code&gt;supported_pages = [&lt;br&gt; 'ascii', 'cp037', 'cp1006', 'cp1026', 'cp1140', 'cp1250',&lt;br&gt; 'cp1251', 'cp1252', 'cp1253', 'cp1254', 'cp1255', 'cp1256', 'cp1257',&lt;br&gt; 'cp1258', 'cp424', 'cp437', 'cp500', 'cp720', 'cp737', 'cp775', 'cp850',&lt;br&gt; 'cp852', 'cp855', 'cp856', 'cp857', 'cp858', 'cp860', 'cp861', 'cp862',&lt;br&gt; 'cp863', 'cp864', 'cp865', 'cp866', 'cp869', 'cp874', 'cp875', 'iso8859_1',&lt;br&gt; 'iso8859_10', 'iso8859_13', 'iso8859_14', 'iso8859_15', 'iso8859_16',&lt;br&gt; 'iso8859_2', 'iso8859_3', 'iso8859_4', 'iso8859_5', 'iso8859_6', 'iso8859_7',&lt;br&gt; 'iso8859_8', 'iso8859_9', 'jelly', 'koi8_r', 'koi8_u', 'mac_cyrillic',&lt;br&gt; 'mac_greek', 'mac_iceland', 'mac_latin2', 'mac_roman', 'mac_turkish',&lt;br&gt; 'ptcp154'&lt;br&gt;]&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;sub&gt;&lt;a href=&quot;https://github.com/Mego/ByteCounter&quot; rel=&quot;nofollow noreferrer&quot;&gt;Source&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://ethproductions.github.io/bytes/&quot; rel=&quot;nofollow noreferrer&quot;&gt;bytes&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/42545/ethproductions&quot;&gt;ETHproductions&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Supports 20 different encodings, able to be chosen from a dropdown menu. Has &lt;a href=&quot;https://ethproductions.github.io/bytes/?e=utf-8&amp;amp;t=I%20%E2%99%A5%20bytes&quot; rel=&quot;nofollow noreferrer&quot;&gt;permalinks&lt;/a&gt; and a bookmarklet available. Currently supports UTF-8, UTF-16, ISO-8859-1, CP437, ASCII and more&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;sub&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10351/66833&quot;&gt;Source&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-06-16T12:40:18.613" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23533" PostTypeId="2" ParentId="2140" CreationDate="2021-06-16T15:31:05.613" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/230012/jump-trajectory&quot;&gt;Jump trajectory&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerDisplayName="user100690" LastEditorDisplayName="user100690" LastEditDate="2021-06-19T06:29:49.107" LastActivityDate="2021-06-19T06:29:49.107" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23534" PostTypeId="2" ParentId="2140" CreationDate="2021-06-16T19:16:28.250" Score="2" Body="&lt;h1&gt;Largest Number with No Repeating Digit Pairs&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Inspired by &lt;a href=&quot;https://puzzling.stackexchange.com/questions/110490/largest-number-with-no-repeating-digit-pairs&quot;&gt;the problem with the same name&lt;/a&gt;  on &lt;a href=&quot;https://puzzling.stackexchange.com&quot;&gt;Puzzling SE&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;You are to find the largest number that only uses every digit pair once, in a given base. For example, in ternary we have 2212011002. We can do this greedily by simply starting with the  largest number, and then adding the next largest number we can without repeating a pair, until we’ve gotten them all.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt; Given a base from 1-10, output the largest number in that base with no repeating digit pairs.&lt;/p&gt;&#xA;&lt;p&gt;As long as the digits make the number, you may output with anything, or nothing, in between. Whether regularly delimited, or irregularly gibberished.&lt;/p&gt;&#xA;&lt;p&gt;You may also take input in any reasonable way. For example, you might take the base, the max digit, or an ordered list representing the digits available. For octal, this would mean  &lt;code&gt;8&lt;/code&gt;, &lt;code&gt;7&lt;/code&gt; or &lt;code&gt;76543210&lt;/code&gt;. If you feel like a challenge, you can take &lt;code&gt;octal&lt;/code&gt; as input. I won't complain!&lt;/p&gt;&#xA;&lt;p&gt;Note that it need only work for bases from 1-10. Invisible points for doing alphanumeric bases like hex, but not at all required.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so least bytes &lt;em&gt;per language&lt;/em&gt; wins.&lt;/p&gt;&#xA;&lt;h4&gt;Test Cases&lt;/h4&gt;&#xA;&lt;pre&gt;&lt;code&gt;Decimal: 10&#xA;99897969594939291908878685848382818077675747372717066564636261605545352515044342414033231302212011009&#xA;&#xA;&#xA;Octal: 8&#xA;77675747372717066564636261605545352515044342414033231302212011007&#xA;&#xA;&#xA;Quaternary: 4&#xA;33231302212011003&#xA;&#xA;&#xA;Ternary: 3&#xA;2212011002&#xA;&#xA;&#xA;Binary: 2&#xA;11001&#xA;&#xA;&#xA;Unary: 1&#xA;00&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="87594" LastEditorUserId="87594" LastEditDate="2021-06-16T19:24:14.590" LastActivityDate="2021-06-16T19:24:14.590" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23536" PostTypeId="2" ParentId="2140" CreationDate="2021-06-17T09:43:56.903" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/230079/drop-some-boxes&quot;&gt;Drop some boxes&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2021-06-20T10:16:27.640" LastActivityDate="2021-06-20T10:16:27.640" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23537" PostTypeId="1" CreationDate="2021-06-17T09:50:18.183" Score="-9" ViewCount="1150" Body="&lt;p&gt;&lt;strong&gt;September update:&lt;/strong&gt; Community Ads are now live network-wide. All ads with a score of 6 or higher, or with a score of 4 or higher &lt;em&gt;and&lt;/em&gt; no downvotes will be displayed (except for any that have a note from the CM Team explaining why it wasn't selected). Go to &lt;a href=&quot;https://meta.stackexchange.com/q/364556/208518&quot;&gt;the main post on MSE&lt;/a&gt; for a list of the ads that are being displayed. And stay tuned for 2022's edition for the next opportunity to submit more ad proposals!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;AUGUST NOTE:&lt;/strong&gt; This post has now been locked and new submissions are not being accepted. Ad submissions are now undergoing review by the Community Team, and this question will be updated once the ads are live.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;We're almost halfway through 2021, and &lt;a href=&quot;https://meta.stackexchange.com/q/364556/208518&quot;&gt;in case you missed it&lt;/a&gt;, Community Promotion Ads are gonna be a bit different this time! &lt;strong&gt;TL;DR: submit and vote for ad proposals before August 2nd!&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h3&gt;What are Community Ads?&lt;/h3&gt;&#xA;&lt;p&gt;Community Ads are community-vetted advertisements that will show up on the main site, or on other sites in the network. They can show up in the right sidebar, or in banners in question pages. The purpose of this question is the vetting process. Images of the advertisements are provided, and community voting will enable the advertisements to be considered by &lt;a href=&quot;https://meta.stackexchange.com/a/99341/208518&quot;&gt;the Community Management Team&lt;/a&gt; to be displayed.&lt;/p&gt;&#xA;&lt;h3&gt;Why do we have Community Ads?&lt;/h3&gt;&#xA;&lt;p&gt;This is a method for the community to control what gets promoted to visitors on the site. The goal of this initiative is for future visitors to find out about &lt;em&gt;the stuff your community deems important&lt;/em&gt;. This also serves as a way to promote information and resources that are &lt;em&gt;relevant to your own community's interests&lt;/em&gt;, both for those already in the community and those yet to join. You may want to promote external resources, or Meta guidance for newcomers, for instance.&lt;/p&gt;&#xA;&lt;p&gt;This initiative has an added goal of providing your community with &lt;em&gt;an opportunity to showcase exemplary questions from your main site, as well as frequently-linked-to guides from your Meta site&lt;/em&gt;. While the latter makes sense to be shown solely on this site, the former can be shown all across the network. These should avoid hot button topics, and instead focus more on evergreen questions that show what your community’s all about.&lt;/p&gt;&#xA;&lt;h3&gt;Why do we reset the ads?&lt;/h3&gt;&#xA;&lt;p&gt;Some services will maintain usefulness over the years, while other things will wane to allow for new faces to show up. Resetting the ads every year helps accommodate this, and allows old ads that have served their purpose to be cycled out for fresher ads for newer things. This helps keep the material in the ads relevant to not just the subject matter of the community, but to the current status of the community. Historically, we've reset the ads every year — since this is the first run of a new format, we'll run the ads collected in this post through the end of 2021 and reassess the rotation cycle then.&lt;/p&gt;&#xA;&lt;p&gt;The community ads have no restrictions against reposting an ad from a previous cycle. If a particular service or ad is very valuable to the community and will continue to be so, it is a good idea to repost it. It may be helpful to give it a new face in the process, so as to prevent the imagery of the ad from getting stale after a previous exposure.&lt;/p&gt;&#xA;&lt;h3&gt;Are there restrictions to the ads I can post?&lt;/h3&gt;&#xA;&lt;p&gt;All proposed ads need to abide by &lt;a href=&quot;/conduct&quot;&gt;our Code of Conduct&lt;/a&gt;. &lt;a href=&quot;https://stackoverflow.com/advertising/guidelines&quot;&gt;Our ad creative guidelines&lt;/a&gt; also generally apply (note that the first 2 bullet points on the “Tracking” section do not apply, and a lot of the guidelines surrounding claims, comparisons, proof, etc., while still applicable, may not be particularly relevant). Finally, ads can not be promoting products nor soliciting programmer time or resources for: knowledge sharing or collaboration tools for technologists, or for sites where ad buyers are primarily targeting technologists.&lt;/p&gt;&#xA;&lt;h3&gt;How does it work?&lt;/h3&gt;&#xA;&lt;p&gt;The answers you post to this question &lt;em&gt;must&lt;/em&gt; conform to the following rules, or they will be ignored:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Each answer must relate to a single ad submission.&lt;/strong&gt; Please do not post multiple ad submissions in the same answer.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;All answers must be in one of the below formats:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If you have an image for the ad you want to display on this site (must be the case for ads to external sources, which can't be shown on sites other than this one):&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;[![Image name. Example: &amp;quot;community_ad_name_300x250&amp;quot;][1]][2]&#xA;&#xA;  [1]: https://image-url&#xA;  [2]: https://clickthrough-url&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ol start=&quot;2&quot;&gt;&#xA;&lt;li&gt;If you want to create an ad for a question from your main or meta site, to be advertised on this or other sites in the network (staff will generate a frame for the ad with this site's theme, for brand consistency):&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;Question title  &#xA;Question URL&#xA;Ad size (right sidebar or banner ads)&#xA;Site(s) to be displayed in. Can be:&#xA;  - &amp;quot;self&amp;quot; for ads to be displayed on this site&#xA;  - &amp;quot;all&amp;quot; for ads to be displayed all over the network&#xA;  - a specific subset of sites&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Please &lt;strong&gt;do not add anything else to the body of the post&lt;/strong&gt;. If you want to discuss something, do it in the comments.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Image requirements&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The image that you create must be 300 x 250 pixels for right sidebar ads or 728 x 90 pixels for banner ads. Images can be double that if high DPI.&lt;/li&gt;&#xA;&lt;li&gt;Must be hosted through our standard image uploader (imgur)&lt;/li&gt;&#xA;&lt;li&gt;Must be GIF, PNG, or JPG&lt;/li&gt;&#xA;&lt;li&gt;No animated GIFs&lt;/li&gt;&#xA;&lt;li&gt;Absolute limit on file size of 150 KB&lt;/li&gt;&#xA;&lt;li&gt;If the background of the image is white or partially white, there must be a 1px border (2px if high DPI) surrounding it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Selection process&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;This post will remain open for ad submissions and voting until August 2nd&lt;/strong&gt;. At that point, the question will be closed/locked, and no more ad submissions will be accepted. For ad submissions to be considered for selection by the Community Management Team, they must have &lt;strong&gt;a minimum score of 6 at the time the post was closed/locked for submissions.&lt;/strong&gt; Given this is the first run with this new format, we may adjust the score threshold to be a bit lower if we see ads struggling to get to it (especially if the ads are not getting downvotes) by the time submissions and voting are closed.&lt;/p&gt;&#xA;&lt;h3&gt;Reporting statistics&lt;/h3&gt;&#xA;&lt;p&gt;Once this cycle is over, at the end of 2021, the Community Management Team will provide you with reporting statistics, as described in the &amp;quot;reporting&amp;quot; section of &lt;a href=&quot;https://meta.stackexchange.com/q/364556/208518&quot;&gt;this post&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Feel free to use the question's comment section to ask for any clarifications.&lt;/p&gt;&#xA;" OwnerUserId="38734" LastEditorUserId="38734" LastEditDate="2021-09-09T11:33:16.730" LastActivityDate="2021-09-09T11:33:16.730" Title="Community Ads for 2021" Tags="|discussion|community-ads|" AnswerCount="20" CommentCount="16" ContentLicense="CC BY-SA 4.0" />
  <row Id="23538" PostTypeId="2" ParentId="23537" CreationDate="2021-06-17T14:15:36.737" Score="18" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/40695&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/n3xsb.png&quot; alt=&quot;Have a challenge idea? Iron out its bugs. Join us in the Sandbox!&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-06-17T14:15:36.737" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23539" PostTypeId="2" ParentId="23537" CreationDate="2021-06-17T14:16:36.427" Score="27" Body="&lt;p&gt;&lt;a href=&quot;https://tio.run/#home&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/J99n9.png&quot; alt=&quot;Tio: Try it online&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="96037" LastEditorUserId="38734" LastEditDate="2021-08-12T11:17:36.507" LastActivityDate="2021-08-12T11:17:36.507" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23540" PostTypeId="2" ParentId="23537" CreationDate="2021-06-17T14:17:16.697" Score="12" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10132/32352&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Vdi3R.png&quot; alt=&quot;Know how to vote!&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-06-17T14:17:16.697" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23541" PostTypeId="2" ParentId="23537" CreationDate="2021-06-17T14:20:27.723" Score="13" Body="&lt;p&gt;&lt;a href=&quot;https://github.com/abrudz/lb/blob/master/README.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/PT2I9.png&quot; alt=&quot;Bookmarklet: Language bars, key-bindings, and character compositions with no install needed!&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="38734" LastEditDate="2021-08-12T11:18:38.080" LastActivityDate="2021-08-12T11:18:38.080" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23542" PostTypeId="2" ParentId="23537" CreationDate="2021-06-17T14:21:40.953" Score="9" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5243/43319&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/iU1bc.png&quot; alt=&quot;Deadline-less (hence not searchable) bounties offered by users on various challenges&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-06-17T14:21:40.953" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23543" PostTypeId="2" ParentId="23537" CreationDate="2021-06-17T14:27:15.037" Score="9" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions?sort=featured&quot;&gt;&lt;img src=&quot;https://stack-exchange-dynamic-ads.herokuapp.com/codegolf.stackexchange.com/bounty.png&quot; alt=&quot;Bounties for everybody&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-06-17T14:27:15.037" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23544" PostTypeId="2" ParentId="23537" CreationDate="2021-06-17T14:33:28.133" Score="11" Body="&lt;p&gt;&lt;a href=&quot;https://esolangs.org/wiki/Main_Page&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/vk4zF.png&quot; alt=&quot;Esolangs.org: esoteric programming languages wiki&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="38734" LastEditDate="2021-08-12T11:20:17.620" LastActivityDate="2021-08-12T11:20:17.620" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23545" PostTypeId="2" ParentId="23537" CreationDate="2021-06-17T14:46:36.653" Score="9" Body="&lt;p&gt;&lt;a href=&quot;https://github.com/Timwi/EsotericIDE/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/dfT0Q.png&quot; alt=&quot;Esoteric IDE: interpreter for esoteric programming languages&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="38734" LastEditDate="2021-08-12T11:20:53.963" LastActivityDate="2021-08-12T11:20:53.963" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23546" PostTypeId="2" ParentId="23537" CreationDate="2021-06-17T14:47:41.067" Score="9" Body="&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/57815/jelly-hypertraining&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/zIFyO.png&quot; alt=&quot;Want to improve your Jelly skills? Join the Jelly HyperTraining chat room!&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="38734" LastEditDate="2021-08-12T11:21:24.087" LastActivityDate="2021-08-12T11:21:24.087" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23547" PostTypeId="2" ParentId="23537" CreationDate="2021-06-17T14:48:58.537" Score="10" Body="&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/52405/the-apl-orchard&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/VAV4a.png&quot; alt=&quot;The APL Orchard chat room. Other array languages are on topic too!&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="38734" LastEditDate="2021-08-12T11:21:48.610" LastActivityDate="2021-08-12T11:21:48.610" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23548" PostTypeId="2" ParentId="11503" CreationDate="2021-06-17T15:19:50.647" Score="2" Body="&lt;p&gt;The &amp;quot;How to Answer&amp;quot; popover on both Code Golf and Code Golf Meta will now show to all users who have 111 or less rep.&lt;/p&gt;&#xA;&lt;p&gt;We are unable to make the differentiation between having earned 10 rep on the site (well we can, but it will have unacceptable performance implications). However, setting it to be 111 ensures that users who have earned the association bonus will still see it until they have earned 10 rep on this site.&lt;/p&gt;&#xA;&lt;p&gt;This does mean that users who join CG without an association bonus will see the popover for longer. This was judged by the Mods to be an acceptable scenario in order to achieve the main goal of this.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Came here with some rep?&lt;br /&gt;&#xA;Still must see &amp;quot;How to answer&amp;quot;&lt;br /&gt;&#xA;Until you do stuff&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="11952" LastActivityDate="2021-06-17T15:19:50.647" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23549" PostTypeId="1" AcceptedAnswerId="23607" CreationDate="2021-06-17T18:41:36.210" Score="9" ViewCount="114" Body="&lt;p&gt;&lt;sub&gt;This may be more on topic for MSE, I might move it there if so. For now, I believe this is directly applicable to us&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/23537/community-ads-for-2021&quot;&gt;Community Ads for 2021&lt;/a&gt; post was posted earlier today, in a trial run of the &lt;a href=&quot;https://meta.stackexchange.com/questions/364556/the-future-of-community-promotion-open-source-and-hot-network-questions-ads&quot;&gt;new advertising system&lt;/a&gt;. Currently, at writing, it is at +1/-6 and has 4 &amp;quot;Needs details or clarity&amp;quot; close votes. The three biggest changes with this new system are:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Improvement: The ability to advertise specific questions, on both main and meta, that we the community decide are important to advertise&lt;/li&gt;&#xA;&lt;li&gt;Restriction: &amp;quot;Ads can not be promoting products nor soliciting programmer time or resources for: knowledge sharing or collaboration tools for technologists, or for sites where ad buyers are primarily targeting technologists.&amp;quot; This seems to be the biggest reason behind the close votes - a lot of users are finding this vague and are not sure whether specific services are allowed or not.&lt;/li&gt;&#xA;&lt;li&gt;Feature loss: &amp;quot;This post will remain open for ad submissions and voting until August 2nd. At that point, the question will be closed/locked, and no more ad submissions will be accepted.&amp;quot;. Additionally, ads will not be &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/23537/community-ads-for-2021#comment74539_23537&quot;&gt;editable&lt;/a&gt; after this date, nor will they be able to be modified in any way if properly locked (e.g. voted on, flagged, comments etc.).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;This is specifically about point &lt;strong&gt;3&lt;/strong&gt; (with a bit about point &lt;strong&gt;1&lt;/strong&gt;)&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;From the Community Ads posts:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Why do we reset the ads?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Some services will maintain usefulness over the years, while other things will wane to allow for new faces to show up. Resetting the ads every year helps accommodate this, and allows old ads that have served their purpose to be cycled out for fresher ads for newer things. This helps keep the material in the ads relevant to not just the subject matter of the community, but to the current status of the community.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is completely accurate, but also applies to shorter time frames than a year. Community Ads &lt;a href=&quot;https://meta.stackexchange.com/a/364770/355458&quot;&gt;have been used&lt;/a&gt; to advertise products relevant to the site that were created or that are relevant at times other than the start of the year (when the Ads thread is started). The dynamic part of the former system meant that advertisements didn't have to wait for a year to get started - they could just post and go.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;This new system is bad&lt;/strong&gt; specifically because it doesn't allow this. Even if the only change made to the system was implementing this &amp;quot;window&amp;quot;, I'd be against it. However, to compound things, the fact that we can now advertise specific questions makes this lack of flexibility even worse.&lt;/p&gt;&#xA;&lt;p&gt;I can think of two &lt;em&gt;extremely&lt;/em&gt; useful ways we can use point &lt;strong&gt;1&lt;/strong&gt; to our advantage:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;We can advertise our &lt;a href=&quot;/questions/tagged/best-of&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;best-of&amp;#39;&quot; rel=&quot;tag&quot;&gt;best-of&lt;/a&gt; winners. It's already difficult to appropriately award good challenge writers as bounties are answer-only, but by advertising the winning posts, we can draw more attention to the best challenges of the year.&lt;/p&gt;&#xA;&lt;p&gt;Unfortunately, by having only a small window to create adverts, this isn't doable. It'd require the Community Ads to be posted around the same time as the Best Of voting, and we'd then have those posts around for the rest of the year - not necessarily a bad thing, but not exactly ideal.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;We can advertise ongoing community events, for example our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/22276/introducing-biweekly-mini-golf&quot;&gt;Biweekly Mini Golf&lt;/a&gt; or the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19279/nominations-for-language-of-the-month-2021-edition&quot;&gt;Language of the Month&lt;/a&gt; threads. Currently, LOTM is an &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/22206/should-the-language-of-the-month-post-be-an-upcoming-event&quot;&gt;Upcoming Event&lt;/a&gt;, but having an ad for it could be a way to encourage even more engagement&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And I'm sure there are more ways this can be beneficial.&lt;/p&gt;&#xA;&lt;p&gt;In short, the ability to advertise specific questions is most useful (especially to us, but I think this applies to multiple other sites in the network) if it is &lt;em&gt;dynamic&lt;/em&gt;. Showing the same few posts for a year is a helpful thing, and it'd be a good way to get more engagement in the &amp;quot;canonical&amp;quot; posts (Hello World, Fibonacci, Quine, Is it prime? etc.), but that shouldn't be the only thing it's used for.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Therefore, I'd like to request that either:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the Community Ads be left open and unlocked until the next cycle (&lt;a href=&quot;https://chat.stackexchange.com/transcript/message/58370471#58370471&quot;&gt;Jan 2022&lt;/a&gt;), at which point a new post happens and that is also left unlocked and open, or&lt;/li&gt;&#xA;&lt;li&gt;Community Ads be refreshed every 3 months, which requires &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/58370558#58370558&quot;&gt;dev work&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="38734" LastEditDate="2021-06-23T14:12:43.320" LastActivityDate="2021-06-23T14:12:43.320" Title="Please don't lock the Community Ads after August 2nd" Tags="|feature-request|status-declined|advertising|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23551" PostTypeId="1" CreationDate="2021-06-17T23:03:10.550" Score="33" ViewCount="874" Body="&lt;h2&gt;Welcome to the first CGCC Blog post!&lt;/h2&gt;&#xA;&lt;p&gt;After &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1446/code-golf-blog-phase-1-raise-the-idea-on-the-meta-site&quot;&gt;7 years&lt;/a&gt;, and three attempts, we've finally started a site blog, for posts and topics that the community here on CGCC is likely to find interesting. If you'd like to suggest topics, or would like to write a post about something specific, feel free to head over to our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/22070/what-should-we-write-about-on-our-blog&quot;&gt;ideas thread&lt;/a&gt; and write up a suggestion!&lt;/p&gt;&#xA;&lt;p&gt;Intially, the idea for a blog came about when Stack Exchange was promoting &lt;a href=&quot;https://stackoverflow.blog/2011/06/23/blog-overflow/&quot;&gt;BlogOverflow&lt;/a&gt; back in 2014. Unfortunately, the idea &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/15461516#15461516&quot;&gt;&amp;quot;sort of just... stopped&amp;quot;&lt;/a&gt; and never came to fruition. 4 years ago, &lt;a href=&quot;https://meta.stackexchange.com/questions/291741/we-will-no-longer-be-hosting-blog-overflow&quot;&gt;BlogOverflow stopped&lt;/a&gt;, right as there was &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=32929735#32929735&quot;&gt;renewed interest&lt;/a&gt; in having one, so we moved &lt;a href=&quot;https://medium.com/code-golf&quot; rel=&quot;nofollow noreferrer&quot;&gt;off-site&lt;/a&gt; for a while, before stagnating again. Finally, we decided to give it another shot, which is why you're reading this now!&lt;/p&gt;&#xA;&lt;p&gt;If you'd like to see all the blog posts, check out the &lt;a href=&quot;/questions/tagged/cgcc-blog&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cgcc-blog&amp;#39;&quot; rel=&quot;tag&quot;&gt;cgcc-blog&lt;/a&gt; tag - all the posts are collected there, and each post has that tag. If you'd like to check out our &lt;a href=&quot;https://chat.stackexchange.com/rooms/123200/cgcc-blog-chat&quot;&gt;drafting and discussion room&lt;/a&gt;, feel free to drop by and ask any questions you have. For our very first post, we've decided to discuss whether golfing languages are good or bad for the site, a discussion which has been around since the creation of the site. Additionally, be sure to read until the end to see some underappreciated challenges, answers and languages.&lt;/p&gt;&#xA;&lt;p&gt;Enjoy!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Banning golfing languages has been an idea since the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/286/66833&quot;&gt;creation of the site&lt;/a&gt;, back when &amp;quot;golfing language&amp;quot; meant the clunky, outdated mess that is &lt;a href=&quot;http://www.golfscript.com/golfscript/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Golfscript&lt;/a&gt; and the general-purpose-but-short languages &lt;a href=&quot;https://www.jsoftware.com/#/&quot; rel=&quot;nofollow noreferrer&quot;&gt;J&lt;/a&gt; and &lt;a href=&quot;https://aplwiki.com/wiki/&quot; rel=&quot;nofollow noreferrer&quot;&gt;APL&lt;/a&gt;. The general idea behind the ban is that verbose languages such as &lt;a href=&quot;https://www.java.com/en/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Java&lt;/a&gt; are unable to compete with languages specially designed for golfing, so, in order to level the playing field, various different measures (handicaps, bans, language-specific competitions etc.) have been suggested.&lt;/p&gt;&#xA;&lt;p&gt;So, are golfing languages good for the site?&lt;/p&gt;&#xA;&lt;h2&gt;Yes!&lt;/h2&gt;&#xA;&lt;p&gt;In general, I disagree with these playing-field-leveling measures. &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;Code Golf.SE&lt;/a&gt; has a principle of &amp;quot;Answers don't compete with all other answers, they compete with other answers &lt;em&gt;in the same language&lt;/em&gt;&amp;quot;. For example, a Java submission is only ever trying to beat the other Java submissions, rather than the &lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt; answers. This is a good compromise of a policy, and I personally prefer it much more than sites that only allow specific languages. However, it can also feel a bit cheap or hand-wavy.&lt;/p&gt;&#xA;&lt;p&gt;The thing I most enjoy about golfing languages is that they force you to think in completely different ways to regular languages. Their vast builtin libraries completely trivialise trivial problems - as they should. People complain that having a builtin to do something (for example, a builtin to calculate the dot product of two arrays) trivialises that task. That it isn't &amp;quot;real coding&amp;quot; to just copy-paste the &lt;code&gt;ḋ&lt;/code&gt; character instead of having to actually write your own method. However, I wholeheartedly believe that if a task can be trivialised in a golfing language, it's a trivial task in &lt;em&gt;any&lt;/em&gt; language.&lt;/p&gt;&#xA;&lt;p&gt;Golfing languages are interesting when the challenge is interesting. Generally speaking, the more interesting a challenge is, the more interesting the golfing language answer will be, because the approaches are going to be completely different. Using a golfing language allows you to abstract away a task until you can distil it into its core principles. And, often, this results in a trivial answer in a golfing language, because the core of the challenge is trivial, but this can only be realised through the level of abstraction available in golfing languages. For example, consider &lt;a href=&quot;https://codegolf.stackexchange.com/a/182825/66833&quot;&gt;this&lt;/a&gt; Jelly answer to a challenge about the &lt;a href=&quot;https://en.wikipedia.org/wiki/Padovan_sequence&quot; rel=&quot;nofollow noreferrer&quot;&gt;Padovan sequence&lt;/a&gt;. This sequence is similar to the Fibonacci sequence, and so most practical languages use this approach. However, this style of recursion is not always golfy in golfing languages, so it requires a fresh take and a new way to understand the task in order to create a competitive solution.&lt;/p&gt;&#xA;&lt;p&gt;This is, in my opinion, the biggest argument for golfing languages. The obvious solution may not always be the shortest in every language, and by expanding the ways one can approach a problem (via expanding the builtins available), golfing languages are able to find more creative ways to answer. That's not to say that practical languages can't be interesting, but that the approaches in practical languages are limited by their builtin set.&lt;/p&gt;&#xA;&lt;h2&gt;No!&lt;/h2&gt;&#xA;&lt;p&gt;Javascript, Python, and Jelly are the top three languages on CGCC. If you pick a random challenge from the last few years, chances are you'll see all three of them. One of these languages stands out. It's far golfier, but also far more disliked.&lt;/p&gt;&#xA;&lt;p&gt;Those who have been on the site for a while will know that answers (officially) compete only with other answers in the same language. That unfortunately isn't immediately obvious to new users. Posting a 200 byte Python answer when there's 10 bytes of strange unicode in first place is discouraging. Why bother, when you don't know any of the languages that are consistently at the top?&lt;/p&gt;&#xA;&lt;p&gt;Golfing languages are also designed for one thing: golfing. In JS or Python, you'd have to balance the byte counts of potentially dozens of approaches to a part of a problem. You would need to take into account how changing the syntax in one place affects it in others. In Jelly or 05AB1E, many answers are just a few built-ins strung together.&lt;/p&gt;&#xA;&lt;p&gt;Entire classes of challenges can be completely trivialized by golfing languages. Prime-related challenges, for example. While it costs you 30-40 bytes for a primality check in most practical languages, a golfing language can do that in a single byte. You could argue that these challenges are already trivial if they could be solved in a few bytes in a golfing language, but it could also be that golfing languages make a larger number of challenges count as trivial.&lt;/p&gt;&#xA;&lt;p&gt;Overall, golfing languages can be discouraging to new users, and trivialize many problems.&lt;/p&gt;&#xA;&lt;h2&gt;Conclusion&lt;/h2&gt;&#xA;&lt;p&gt;Golfing languages have both good and bad impacts on the site as a whole. They can be discouraging to new users, who don't yet know the rules regarding competition between languages. Despite trivializing many challenges, it could be argued that these sorts of challenges are already quite trivial. And although they are often significantly shorter, golfing languages can still be difficult and interesting to golf in.&lt;/p&gt;&#xA;&lt;p&gt;Whether you believe that golfing languages encourage creative thinking, or that they make it more difficult for newer users to get started, the fact that this site allows any language undeniably sets it apart from other golfing communities.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Underappreciated posts&lt;/h2&gt;&#xA;&lt;p&gt;This section is for demonstrating some underappreciated challenges and answers. Be sure to check them out and give them an upvote if you find them interesting!&lt;/p&gt;&#xA;&lt;p&gt;We recommend you check out &lt;a href=&quot;https://codegolf.stackexchange.com/questions/84/interpret-brainf/223869#223869&quot;&gt;this&lt;/a&gt; brainfuck interpreter written in Vim by Aaron Miller. It's an incredible program that demonstrates that Vim is (essentially) Turing complete!&lt;/p&gt;&#xA;&lt;p&gt;Additionally, feel free to nominate challenges, languages and answers in the comments below for the next blog post!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sub&gt;This was written by &lt;a href=&quot;https://codegolf.stackexchange.com/users/79857/redwolf-programs&quot;&gt;Redwolf Programs&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/caird-coinheringaahing&quot;&gt;caird coinheringaahing&lt;/a&gt;. The Yes section and introductions were written by caird and the No section and conclusion by Redwolf. Feel free to leave any thoughts on the post or blog as either comments, or answers if more substantial.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="76162" LastEditDate="2021-06-19T09:04:48.253" LastActivityDate="2021-06-19T09:04:48.253" Title="CGCC Blog #1: Are golfing languages good or bad for the site?" Tags="|discussion|cgcc-blog|" AnswerCount="0" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="23553" PostTypeId="2" ParentId="22070" CreationDate="2021-06-17T23:43:27.790" Score="0" Body="&lt;h1&gt;Preliminary opinions on the Blog&lt;/h1&gt;&#xA;&lt;p&gt;It would be about what people think about the new blog. Would have a section on in-depth opinions, as well as general reception. If and when done for real, would have a post made before it as an upvote/downvote poll, using upvotes and downvotes for voting.&lt;/p&gt;&#xA;&lt;p&gt;Writers:&#xA;4D4850&lt;br /&gt;&#xA;&lt;em&gt;Add your name here, if you helped write&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Opinions:&#xA;4D4850: I think the blog is great, because it provides a community-based source of news. However, I'm a little worried it'll be a flop because I'm not sure many people would particularly care about what's happening on Meta.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Add username and opinions here, using the opinion I wrote above as an example of formatting&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="104134" LastActivityDate="2021-06-17T23:43:27.790" CommentCount="3" CommunityOwnedDate="2021-06-17T23:43:27.790" ContentLicense="CC BY-SA 4.0" />
  <row Id="23555" PostTypeId="2" ParentId="2140" CreationDate="2021-06-18T08:30:36.143" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/230037/100752&quot;&gt;Outputting Blum Integers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerDisplayName="user100752" LastEditorDisplayName="user100752" LastEditDate="2021-06-19T14:30:21.123" LastActivityDate="2021-06-19T14:30:21.123" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23556" PostTypeId="2" ParentId="2140" CreationDate="2021-06-18T08:57:29.110" Score="2" Body="&lt;h1&gt;Play Thud&lt;/h1&gt;&#xA;&lt;p&gt;Thud is a game described by Terry Pratchett in his novel, Thud!.&lt;/p&gt;&#xA;&lt;p&gt;The game simulates a battle between the Dwarfs (in blue) and the Trolls (in green) on an&#xA;octagonal board with the Thudstone (an impassable space) in the centre of the board.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/NIkpa.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/NIkpa.png&quot; alt=&quot;Thud board&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I have created an environment to play the game and develop game playing code at: &lt;a href=&quot;https://ajfaraday.github.io/Thud/dist/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://ajfaraday.github.io/Thud/dist/index.html&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The challenge is to write the most successful dwarf or troll player of this game (these will be two separate challenges).&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;p&gt;Starting with the Dwarfs, players take it in turns to move.&lt;/p&gt;&#xA;&lt;h2&gt;Dwarf Movement&lt;/h2&gt;&#xA;&lt;p&gt;On the Dwarf player's turn, they can move one dwarf piece either as a walk or a hurl.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Walk&lt;/em&gt;: Dwarfs can move as far as they like in any direction until they hit an obstacle&#xA;(another dwarf, the edge of the board, or a troll).&#xA;They can only kill a troll by walking if they are only one space away.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Hurl&lt;/em&gt;: If two or more dwarfs are in a line (horizontal, vertical or diagonal), they can hurl the dwarf on the end of the line, by&#xA;the length of the line (e.g. in a line of 3, the dwarf on the end can be hurled 3 spaces).&#xA;If a dwarf is hurled into a troll, the troll is killed, reducing the trolls score by 4 points.&lt;/p&gt;&#xA;&lt;h2&gt;Troll Movement&lt;/h2&gt;&#xA;&lt;p&gt;On the Troll player's turn they can  move one troll piece, either as a walk or a shove.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Walk&lt;/em&gt;: Trolls can move one space in any direction, unless a troll, dwarf or the edge of the&#xA;board is in the way. Whenever a troll moves, it kills all dwarfs adjacent to&#xA;it's destination space.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Shove&lt;/em&gt;: If two or more trolls are in a line (horizontal, vertical or diagonal) they can shove the troll&#xA;at the end of the line that number of spaces away, but &lt;em&gt;only&lt;/em&gt; if any of the target space's immediate&lt;br /&gt;&#xA;neighbours contain a dwarf. When a troll is shoved, it kills all dwarfs on or adjacent to&#xA;it's destination space.&lt;/p&gt;&#xA;&lt;p&gt;It is not permitted for a troll to land directly on a dwarf by either walk or shove moves.&lt;/p&gt;&#xA;&lt;p&gt;Each dwarf killed reduces the dwarfs score by 1 point.&lt;/p&gt;&#xA;&lt;h2&gt;Scores&lt;/h2&gt;&#xA;&lt;p&gt;The score is calculated thus:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The dwarf player has one point for every dwarf remaining on the board.&lt;/li&gt;&#xA;&lt;li&gt;The troll player has four points for every troll remaining on the board.&lt;/li&gt;&#xA;&lt;li&gt;The key figure is the difference between these two. This will be used to calculate&#xA;players' scores in the tournament.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Ending the game&lt;/h2&gt;&#xA;&lt;p&gt;The game ends when any of these conditions is met:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are no dwarfs on the board.&lt;/li&gt;&#xA;&lt;li&gt;There are no trolls on the board.&lt;/li&gt;&#xA;&lt;li&gt;Both players have declared the game over.&lt;/li&gt;&#xA;&lt;li&gt;The game has reached it's cut-off length of 500 moves.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;How to manually play a game&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Go to &lt;a href=&quot;https://ajfaraday.github.io/Thud/dist/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://ajfaraday.github.io/Thud/dist/index.html&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Hover the mouse over a piece to see it's available moves.&lt;/li&gt;&#xA;&lt;li&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Safe moves are outlined in green.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Dangerous moves (which can be killed the next turn) are outlined in orange.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Killing moves are highlighted in red when the mouse hovers over them.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Click a piece to select it for the current move.&lt;/li&gt;&#xA;&lt;li&gt;Click one of the available moves to move the piece.&lt;/li&gt;&#xA;&lt;li&gt;(You can click the relevant 'Make Peace' button to declare the game over according to that player, during their turn)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;How to set up a local instance of the game&lt;/h1&gt;&#xA;&lt;p&gt;You don't have to clone the repository and use it locally to  to create an entry, but it helps.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;git clone git@github.com:AJFaraday/Thud.git&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cd Thud&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;npm install&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;You can then run &lt;code&gt;./get_answers.sh&lt;/code&gt; to get the latest entries from Stack Exchange&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If you prefer, you can use the github pages instance at &lt;a href=&quot;https://ajfaraday.github.io/Thud/dist/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://ajfaraday.github.io/Thud/dist/index.html&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;How to customize a game&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Open /dist/index.html in your browser&lt;/li&gt;&#xA;&lt;li&gt;Click 'Customize'&lt;/li&gt;&#xA;&lt;li&gt;Select troll and dwarf clients (manual allows direct control)&lt;/li&gt;&#xA;&lt;li&gt;Select a turn time in milliseconds (only relevant to non-manual players)&lt;/li&gt;&#xA;&lt;li&gt;Click 'Run Game' to see or play the game.&lt;/li&gt;&#xA;&lt;li&gt;(Clicking 'Close' will not enact any changes)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Clients&lt;/h1&gt;&#xA;&lt;p&gt;The game is played by clients, which represent either a troll or a dwarf player. Each is a&#xA;JavaScript class which must have these three functions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;constructor(controller)&lt;/code&gt; - controller is an object which acts as your interface with the game (see below).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;turn()&lt;/code&gt; - This is called whenever it is your players turn to move.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;end_turn()&lt;/code&gt; - This is called after your player's turn is over. It can not move pieces, but can make&#xA;decisions on whether or not to declare the game over.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Controller&lt;/h2&gt;&#xA;&lt;p&gt;The &lt;code&gt;controller&lt;/code&gt; object is your client's interface with the game itself. You can find full documentation&#xA;for the controller class here: &lt;a href=&quot;https://github.com/AJFaraday/Thud/blob/main/docs/controller_interface.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://github.com/AJFaraday/Thud/blob/main/docs/controller_interface.md&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;It provides these methods to interrogate the state of the game:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;turn()&lt;/code&gt; - Current turn of the game&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;scores()&lt;/code&gt; - The current score&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;spaces()&lt;/code&gt; - Every space, and what's in it&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;space_info(x, y)&lt;/code&gt; - Detailed information on any space on the board.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;dwarves()&lt;/code&gt; - The location of every dwarf&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;trolls()&lt;/code&gt; - The location of every troll&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;pieces()&lt;/code&gt; - All pieces belonging to the current player (equivalent of &lt;code&gt;dwarves()&lt;/code&gt; or &lt;code&gt;trolls()&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;indexed_dwarves()&lt;/code&gt; - The location of every dwarf with a fixed index&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;indexed_trolls()&lt;/code&gt; - The location of every troll with a fixed index&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;previous_move()&lt;/code&gt; - What got moved to where last turn&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;killing_moves()&lt;/code&gt; - All moves which can kill one or more opponent&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;current_space&lt;/code&gt; - Currently selected space (not a function)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;clear_space()&lt;/code&gt; - Empties currently selected space&#xA;These methods are used to actually make your move:&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;check_space(x, y)&lt;/code&gt;- Find out what moves are available from a given space&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;select_space(x, y)&lt;/code&gt; - The player decides to move a piece at space.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;check_move(x, y)&lt;/code&gt; - Find out what will happen if you move to a place&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;move(x, y)&lt;/code&gt; - The player moves the current piece to the selected space.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;These are concerned with ending the game:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;declare(game_over)&lt;/code&gt; - Say whether or not your player thinks the game is over.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;opponent_declared()&lt;/code&gt; - Has the opponent declared the game over?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;How to write a client&lt;/h1&gt;&#xA;&lt;p&gt;Warning: There is an issue with the project on Firefox (&lt;a href=&quot;https://github.com/AJFaraday/Thud/issues/3&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://github.com/AJFaraday/Thud/issues/3&lt;/a&gt;)&#xA;which prevents editing the code in the browser. This has been confirmed to work in Chrome.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Open 'dist/index.html' in your browser.&lt;/li&gt;&#xA;&lt;li&gt;Click 'Customize'.&lt;/li&gt;&#xA;&lt;li&gt;Select 'dwarf/template' as the Dwarf player (or use another client as a starting point).&lt;/li&gt;&#xA;&lt;li&gt;Click 'Edit' beside the Dwarf player select.&lt;/li&gt;&#xA;&lt;li&gt;Write your client code in the text box provided.&lt;/li&gt;&#xA;&lt;li&gt;The Validate button will change colour based on whether or not the client is passes validations (see below).&lt;/li&gt;&#xA;&lt;li&gt;When you're happy with it, click 'Apply' (This can be done before it passes validation, but it may not actually work).&lt;/li&gt;&#xA;&lt;li&gt;Select a worthy opponent and click 'Run Game' to see the game.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Validations&lt;/h2&gt;&#xA;&lt;p&gt;In order for a client to work, and therefore be enterable in the challenge, it has to pass these&#xA;validations:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It must evaluate as Javascript code.&lt;/li&gt;&#xA;&lt;li&gt;The code must return a class, with a constructor which accepts one argument.&lt;/li&gt;&#xA;&lt;li&gt;Instances of this class should have functions named &lt;code&gt;turn()&lt;/code&gt; and &lt;code&gt;end_turn()&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The client must play a game until it is over (i.e. it must call a valid &lt;code&gt;move&lt;/code&gt; during every &lt;code&gt;turn&lt;/code&gt; call).&#xA;The validator will run games against default opponents to determine if this happens.&lt;/li&gt;&#xA;&lt;li&gt;Does not have any forbidden terms&#xA;** &lt;code&gt;game.&lt;/code&gt; - Only interact with the game via controller&#xA;** &lt;code&gt;Math.random&lt;/code&gt; - Please keep it deterministic&#xA;** &lt;code&gt;setTimeout&lt;/code&gt; or &lt;code&gt;setInterval&lt;/code&gt; - Keep it sequential&lt;br /&gt;&#xA;** &lt;code&gt;eval&lt;/code&gt;, &lt;code&gt;require&lt;/code&gt; or &lt;code&gt;import&lt;/code&gt; - Just don't&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You can open the developer console (F12) to see more detailed information on your client's&#xA;validation process.&lt;/p&gt;&#xA;&lt;h2&gt;How to save a client&lt;/h2&gt;&#xA;&lt;p&gt;If you have cloned the git repository, you can save your entry for future tinkering. This&#xA;step is not required for entry in the challenge, but it may be helpful.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Edit a client, as above.&lt;/li&gt;&#xA;&lt;li&gt;When you're happy with it (preferably if it's passing validation, too), click 'Copy' from the edit interface.&lt;/li&gt;&#xA;&lt;li&gt;Create a .js file in &lt;code&gt;/src/clients/dwarf/entry&lt;/code&gt; with the name of your entry e.g. &lt;code&gt;/src/clients/dwarf/entrygreat_dwarf_player.js&lt;/code&gt;.&#xA;(This folder will not be wiped by &lt;code&gt;get_clients.js&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Run &lt;code&gt;node script/get_clients.js&lt;/code&gt; from the Thud directory to make your entry available from&#xA;the Dwarf player select. You only need to do this once to make it avilable.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;npm run build&lt;/code&gt; - this will keep watching for changes in your entry and updating the package.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;How to enter your client in the competition&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Decide on the name of your client, your client_name must only have alpha characters and underscores.&lt;/li&gt;&#xA;&lt;li&gt;Answer this question with your entry&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first line of your answer should be your client's name as a title (with = characters under it on the second line)&lt;/li&gt;&#xA;&lt;li&gt;There should be a code block containing the class for your entry (with or without the preceeding &lt;code&gt;module.exports =&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;After that please include a brief explanation of your client's behaviour, and any other information you'd like to include.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Once this is in place, anyone running &lt;code&gt;./get_answers.sh&lt;/code&gt; will see your client available under your username.&lt;/p&gt;&#xA;&lt;p&gt;The GitHub Pages instance will also be updated periodically. So by making an entry, your code&#xA;will be added to the repo.&lt;/p&gt;&#xA;&lt;h1&gt;Tournament rules&lt;/h1&gt;&#xA;&lt;p&gt;The tournament will pit every available dwarf client (in &lt;code&gt;/src/clients/dwarf/&lt;/code&gt;) against&#xA;every available troll client (in &lt;code&gt;/src/clients/troll/&lt;/code&gt;), and each pairing will play&#xA;exactly one game.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;em&gt;difference&lt;/em&gt; between the two players' scores will then update a running total&#xA;for each client. The winner will gain the difference, and the loser will lose the difference.&lt;/p&gt;&#xA;&lt;p&gt;There are two winners in the tournament, the most successful troll player and the most&#xA;successful dwarf player.&lt;/p&gt;&#xA;&lt;p&gt;According to the rules, after playing a game, the players swap sides, so please also write an entry on the&#xA;Troll challenge.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/asymmetrical&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;asymmetrical&amp;#39;&quot; rel=&quot;tag&quot;&gt;asymmetrical&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/board-game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;board-game&amp;#39;&quot; rel=&quot;tag&quot;&gt;board-game&lt;/a&gt;  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javasctript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javasctript&amp;#39;&quot; rel=&quot;tag&quot;&gt;javasctript&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This is now nearly complete (apart from some UI improvments and presenting the tournament results a bit more nicely). There's a working example of the code importer working against these two meta questions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Dwarf: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/23642/stack-exchange-api-sandbox-dwarf-edition&quot;&gt;Stack Exchange API Sandbox (dwarf edition)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Troll: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18632/stack-exchange-api-sandbox&quot;&gt;Stack Exchange API Sandbox&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I could really use someone to attempt an end-to-end run at creating a client and adding it to one of these to check that my instructions are clear and everything works.&lt;/p&gt;&#xA;" OwnerUserId="16824" LastEditorUserId="16824" LastEditDate="2021-07-02T14:35:32.623" LastActivityDate="2021-07-02T14:35:32.623" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23557" PostTypeId="2" ParentId="23537" CreationDate="2021-06-18T10:18:43.880" Score="9" Body="&lt;p&gt;&lt;a href=&quot;https://www.dyalog.com/student-competition.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/vCLaA.png&quot; alt=&quot;APL problem solving competition: referral prizes available!&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="38734" LastEditDate="2021-08-12T11:22:10.380" LastActivityDate="2021-08-12T11:22:10.380" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23558" PostTypeId="2" ParentId="23537" CreationDate="2021-06-18T10:20:26.597" Score="10" Body="&lt;p&gt;&lt;a href=&quot;https://www.dyalog.com/student-competition.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/53UmY.png&quot; alt=&quot;APL problem solving competition: referral prizes available!&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="38734" LastEditDate="2021-08-12T11:22:23.497" LastActivityDate="2021-08-12T11:22:23.497" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23559" PostTypeId="2" ParentId="23537" CreationDate="2021-06-18T10:25:43.827" Score="9" Body="&lt;p&gt;Title: Try your hand at code golf and other coding challenges!&lt;/p&gt;&#xA;&lt;p&gt;URL: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/20861/66833&quot;&gt;Welcome to Code Golf and Coding Challenges Stack Exchange!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Size: Right sidebar&lt;/p&gt;&#xA;&lt;p&gt;Displayed on: all except self&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-21T16:07:36.313" LastActivityDate="2021-06-21T16:07:36.313" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="23560" PostTypeId="2" ParentId="2140" CreationDate="2021-06-18T14:00:56.367" Score="1" Body="&lt;h1&gt;Implement a feature-rich calculator&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interactive&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interactive&amp;#39;&quot; rel=&quot;tag&quot;&gt;interactive&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;We have &lt;s&gt;a few&lt;/s&gt; many calculator challenges on this site, but none seem to require a complex one with many different features.&lt;/p&gt;&#xA;&lt;p&gt;This challenge is about emulating my old Casio calculator, except with no digit limit. Features are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;basic (start with a single operation, then input the next operation)&lt;/li&gt;&#xA;&lt;li&gt;all clear (AC) which starts a new &amp;quot;calculation&amp;quot;. No need for C.&lt;/li&gt;&#xA;&lt;li&gt;errors for dividing by zero (otherwise there should be no error)&lt;/li&gt;&#xA;&lt;li&gt;memory: M to set the memory to current number, MC as an inline expression representing the memory, and M- to get rid of the memory.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This should operate either on STDIN (prompt for commands each time) or in a function (taking in either a list of commands or a newline-separated string with commands).&lt;/p&gt;&#xA;&lt;h2&gt;Spec&lt;/h2&gt;&#xA;&lt;p&gt;Your solution should be able to handle floating-point numbers, hence float division should be used regardless of context.&lt;/p&gt;&#xA;&lt;p&gt;When first run, the calculator will be &amp;quot;ON&amp;quot;. It is guaranteed that input syntax is valid.&lt;/p&gt;&#xA;&lt;p&gt;The chain of commands begins with a &lt;code&gt;number operation number&lt;/code&gt;-like structure, where &lt;code&gt;number&lt;/code&gt; can be replaced with &lt;code&gt;MC&lt;/code&gt; to represent a reference to the memory. For instance &lt;code&gt;5 * 5&lt;/code&gt; or &lt;code&gt;6/MC&lt;/code&gt;. Whitespace can be ignored or forbidden, that can be your call, but whatever it is you may assume syntax is valid.&lt;/p&gt;&#xA;&lt;p&gt;Then, if your submission is a full program, it should output the result of that operation, or if a function, append that to the end of a list.&lt;/p&gt;&#xA;&lt;p&gt;Subsequent operations can either be:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;M this sets the memory to current number. Memory can only ever hold a single number at a time.&lt;/li&gt;&#xA;&lt;li&gt;AC. Clears the current calculation and resets the number. Memory, however, will still be accessible.&lt;/li&gt;&#xA;&lt;li&gt;M-. (M minus) This clears the memory, and calls to &lt;code&gt;MC&lt;/code&gt; will never be given when there is nothing in the memory.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;operation number&lt;/code&gt; where operation is + - * or /, and number is a number which can be replaced with MC.&lt;/li&gt;&#xA;&lt;li&gt;Off. The command &lt;code&gt;Off&lt;/code&gt; stops the program, and it is reasonable to assume that no commands will be passed afterwards.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;-&lt;/code&gt; (minus sign) negates current number. Outputs the new number.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Division by zero should trigger an error and restart the calculation. AC, M, MC and M- should output nothing. &lt;strong&gt;Memory can be overwritten&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Note that &lt;code&gt;operation number operation number&lt;/code&gt; will never be given, and that all operations will be performed on non-negative numbers. (we have the negate operator for negative numbers)&lt;/p&gt;&#xA;&lt;p&gt;Also note that this challenge is less about parsing / processing a string input and more about responding to different kinds of input.&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;As a full program, but note that a function will have to take in an array of commands. There is a &lt;code&gt;&amp;gt; &lt;/code&gt; before each command, but in your version, it is not required.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt; 5*5&#xA;25&#xA;&amp;gt; *4&#xA;100&#xA;&amp;gt; /200&#xA;0.5&#xA;&amp;gt; /0&#xA;ERROR (or some form of ERROR)&#xA;&amp;gt; 15*6&#xA;90&#xA;&amp;gt; M&#xA;&amp;gt; +MC&#xA;180&#xA;&amp;gt; AC&#xA;&amp;gt; 7-MC&#xA;-83&#xA;&amp;gt; -&#xA;83&#xA;&amp;gt; M-&#xA;&amp;gt; +5&#xA;88&#xA;&amp;gt; Off&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Meta: is it a duplicate? any clarifications needed?&lt;/p&gt;&#xA;" OwnerDisplayName="user100690" LastEditorDisplayName="user100690" LastEditDate="2021-06-18T14:25:13.667" LastActivityDate="2021-06-18T14:25:13.667" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23561" PostTypeId="2" ParentId="5243" CreationDate="2021-06-18T16:07:25.687" Score="3" Body="&lt;h1&gt;50-200 rep for good programming puzzles&lt;/h1&gt;&#xA;&lt;p&gt;We need more &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt; questions! If you post a good one, I'll give you between 50 and 200 rep depending on how interesting it is to me.&lt;/p&gt;&#xA;&lt;p&gt;I may decide to wait until someone posts a solution, and/or until your intended solution is revealed, before deciding to award a bounty.&lt;/p&gt;&#xA;&lt;p&gt;I will decide to award one only if I see fit, not upon request, but if you think I might have missed your question (it's more likely I just wasn't interested in it (nothing personal)), you can message me in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240&quot;&gt;The Nineteenth Byte&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I will not award bounties if the rep decrease will cause me to lose SE privileges.&lt;/p&gt;&#xA;&lt;p&gt;Since bounties can only be awarded on existing answers, not existing questions themselves, you need to have at least 1 answer to receive this.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2021-06-18T16:07:25.687" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23562" PostTypeId="2" ParentId="5243" CreationDate="2021-06-18T16:16:08.673" Score="3" Body="&lt;h1&gt;500 rep for another answer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/229970/print-this-text-in-scala&quot;&gt;Print this text in Scala&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;hyper-neutrino's found an answer already, but it isn't the intended one. I'll award a 500 rep bounty to anyone who does it without using comments or multiple calls to &lt;code&gt;print&lt;/code&gt;. Brownie points if it's the exact same as mine (not including spacing, of course).&lt;/p&gt;&#xA;&lt;p&gt;Update:&#xA;pxeger's also found an answer, but that isn't the intended one either. I'll award another 500 rep bounty to anyone whose code goes inside a single call to print (no &lt;code&gt;def&lt;/code&gt;s or commented lines outside it).&lt;/p&gt;&#xA;&lt;p&gt;Note that I don't want an answer that's the same as mine, and would prefer for it to be different, I'd just like to see a more interesting approach than printing the text and then dealing with the &lt;code&gt;&amp;gt;)&lt;/code&gt; part outside of the original call to &lt;code&gt;print&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="95792" LastEditorUserId="95792" LastEditDate="2021-06-18T18:02:54.927" LastActivityDate="2021-06-18T18:02:54.927" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23566" PostTypeId="5" CreationDate="2021-06-18T20:11:01.160" Score="0" Body="&lt;p&gt;Spam defined on Stack Exchange is a post which:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Exists only to promote a product or service, does not disclose the author's affiliation.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Such posts do not belong on the site or the network and so are removed. Any user with 15 reputation or more may &lt;a href=&quot;https://meta.stackexchange.com/q/58032/355458&quot;&gt;flag a post as spam&lt;/a&gt;. If a post receives 6 spam flags, it is deleted and locked by &lt;a href=&quot;https://codegolf.stackexchange.com/users/-1/&quot;&gt;Community&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Questions with this tag should be discussing spam on the site, such as discussing how to appropriately handle spam posts, raising attention to spamming behaviour or asking for tools to help combat spam.&lt;/p&gt;&#xA;&lt;p&gt;Note that you should raise a custom moderator flag and explain the situation if you notice a pattern of spam, rather than addressing it on meta. If no action is taken as a result of that flag, approaching the topic on meta is appropriate.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-18T20:11:01.160" LastActivityDate="2021-06-18T20:11:01.160" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23567" PostTypeId="4" CreationDate="2021-06-18T20:11:01.160" Score="0" Body="For discussion around spam posts, such as appropriate etiquette, actions to take and what qualifies as spam" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-18T20:11:01.160" LastActivityDate="2021-06-18T20:11:01.160" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23569" PostTypeId="5" CreationDate="2021-06-19T00:02:14.070" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/RSS&quot; rel=&quot;nofollow noreferrer&quot;&gt;RSS feeds&lt;/a&gt; on the network are an automated system to keep track of updating pages such as the &lt;a href=&quot;https://codegolf.stackexchange.com/feeds&quot;&gt;new questions&lt;/a&gt; feed. These feeds are often used in &lt;a href=&quot;https://chat.stackexchange.com/&quot;&gt;chatrooms&lt;/a&gt;. As a result, questions that discuss RSS feeds should often be tagged with &lt;a href=&quot;/questions/tagged/chat&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chat&amp;#39;&quot; rel=&quot;tag&quot;&gt;chat&lt;/a&gt; as well.&lt;/p&gt;&#xA;&lt;p&gt;A typical question about RSS feeds here could be asking for a &lt;a href=&quot;https://chat.stackexchange.com/rooms/info/240/the-nineteenth-byte?tab=feeds&quot;&gt;feed in The Nineteenth Byte&lt;/a&gt;, asking for a feed to be removed or suggesting features and bugs specific to the feeds.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-19T00:02:14.070" LastActivityDate="2021-06-19T00:02:14.070" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23570" PostTypeId="4" CreationDate="2021-06-19T00:02:14.070" Score="0" Body="The site's RSS feeds refer to the automated systems that post updating pages into chat. This tag should be used on questions that directly relate to those chat feeds." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-19T00:02:14.070" LastActivityDate="2021-06-19T00:02:14.070" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23571" PostTypeId="5" CreationDate="2021-06-19T00:16:50.850" Score="0" Body="&lt;p&gt;A bug report is considered bydesign if, after review of the detailed erroneous behavior,&#xA;it is determined that the behavior is desirable to keep in place rather than fix. This&#xA;is independent of whether or not the behavior was formerly known to the site developers&#xA;prior to the time of the report - the important thing is that the behavior will not be&#xA;altered because its current behavior is preferred.&lt;/p&gt;&#xA;&lt;p&gt;This tag should only be used on questions reporting what is purported as erroneous behavior&#xA;and suggests them being fixed / reversed. For when a question that is requesting a new&#xA;feature that addresses a behavior that the asker believes to be erroneous,&#xA;&lt;a href=&quot;/questions/tagged/status-declined&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-declined&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-declined&lt;/a&gt; should be used.&lt;/p&gt;&#xA;&lt;p&gt;Status tags can only be applied by moderators and site developers.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-19T00:16:50.850" LastActivityDate="2021-06-19T00:16:50.850" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23572" PostTypeId="4" CreationDate="2021-06-19T00:16:50.850" Score="0" Body="Indicates that the reported behavior is intentional and not subject to change" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-19T00:16:50.850" LastActivityDate="2021-06-19T00:16:50.850" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23573" PostTypeId="5" CreationDate="2021-06-19T00:17:17.700" Score="0" Body="&lt;p&gt;A feature request or bug report is typically considered completed when a feature&#xA;or bugfix is added that addresses what was reported. Usually these are implemented&#xA;in accordance with what is requested - however, an alternate solution that still&#xA;solves the same problem/concern will still be considered completion.&lt;/p&gt;&#xA;&lt;p&gt;This tag may also be applied if an existing feature or bugfix addresses the report,&#xA;such as if a user is unaware that a functionality already exists in the system.&lt;/p&gt;&#xA;&lt;p&gt;If resolution involved the implementation of a new feature or bugfix, this tag&#xA;will be added when the changes are checked into source control. Actual deployment&#xA;generally happens every 24 hours.&lt;/p&gt;&#xA;&lt;p&gt;Red status tags can only be applied by moderators and site developers.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-19T00:17:17.700" LastActivityDate="2021-06-19T00:17:17.700" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23574" PostTypeId="4" CreationDate="2021-06-19T00:17:17.700" Score="0" Body="Indicates that the report has been resolved through the implementation of a feature or the fixing of a bug." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-19T00:17:17.700" LastActivityDate="2021-06-19T00:17:17.700" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23575" PostTypeId="5" CreationDate="2021-06-19T00:17:32.100" Score="0" Body="&lt;p&gt;A feature request or bug report is considered declined if the report is reviewed&#xA;and the site developers disagree that the feature should be implemented or the bug should be fixed.&lt;/p&gt;&#xA;&lt;p&gt;In the case of bugs, this usually comes up because the bug is not caused by&#xA;the software that powers the sites themselves - such as if the problem is with the browser being used.&#xA;If it would be more effective for the developers of the browser or tool causing the&#xA;problem, the report will generally be declined. This is also the case if the bug is&#xA;specifically caused by a browser or tool that is unsupported by the sites.&lt;/p&gt;&#xA;&lt;p&gt;In the case of feature requests, this usually comes up if the request is counter to&#xA;site philosophy, if the request is attempting to change behavior that is intentional&#xA;or even encouraged by the system, or if the request creates greater complexity or&#xA;problems in the system than it successfully solves.&lt;/p&gt;&#xA;&lt;p&gt;Status tags can only be applied by moderators and site developers.&lt;/p&gt;&#xA;&lt;p&gt;Related: &lt;a href=&quot;https://blog.codinghorror.com/listen-to-your-community-but-dont-let-them-tell-you-what-to-do/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Listen to Your Community, But Don't Let Them Tell You What to Do&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-19T00:17:32.100" LastActivityDate="2021-06-19T00:17:32.100" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23576" PostTypeId="4" CreationDate="2021-06-19T00:17:32.100" Score="0" Body="Indicates that the feature request will not be implemented, or that a bug will not be fixed at present time." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-19T00:17:32.100" LastActivityDate="2021-06-19T00:17:32.100" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23577" PostTypeId="5" CreationDate="2021-06-19T00:18:02.673" Score="0" Body="&lt;p&gt;A feature request or bug with this tag is something that has been evaluated as positive on potential,&#xA;but it is not present in the current work timeline. It is also not guaranteed to be implemented - when&#xA;it resurfaces the proposal may be re-evaluated and declined depending on how the situation has changed since then.&lt;/p&gt;&#xA;&lt;p&gt;Contrast &lt;a href=&quot;/questions/tagged/status-planned&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-planned&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-planned&lt;/a&gt;, in which a feature is something that the site developers have&#xA;definitively approved for implementation but the timing is unknown.&lt;/p&gt;&#xA;&lt;p&gt;Status tags can only be applied by moderators and site developers.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-19T00:18:02.673" LastActivityDate="2021-06-19T00:18:02.673" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23578" PostTypeId="4" CreationDate="2021-06-19T00:18:02.673" Score="0" Body="Indicates that the feature request or bug is something that is intended to be implemented or fixed, but not in the near term." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-19T00:18:02.673" LastActivityDate="2021-06-19T00:18:02.673" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23579" PostTypeId="5" CreationDate="2021-06-19T00:20:54.690" Score="0" Body="&lt;p&gt;A bug report is considered not reproducible if it is a bug that the site developers&#xA;would fix, but cannot due to an inability to recreate the problematic behavior in&#xA;spite of attempts to do so. Reports that are not reproducible typically represent&#xA;bugs that come from using unsupported browsers and tools, or because of sunspots&#xA;and other activity entirely unrelated to the site creating a momentary issue.&lt;/p&gt;&#xA;&lt;p&gt;If a bug can’t be reproduced due to being immediately presented as being through&#xA;an unsupported browser, thus bypassing the need of the site developers to even&#xA;attempt to reproduce the bug, then &lt;a href=&quot;/questions/tagged/status-declined&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-declined&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-declined&lt;/a&gt; should be used.&lt;/p&gt;&#xA;&lt;p&gt;If you are the reporter of a bug that receives this tag, it may indicate&#xA;that the bug was intermittent, or merely that you didn't thoroughly explain&#xA;the circumstances under which you encountered it. First, verify that &lt;em&gt;you&lt;/em&gt;&#xA;can still cause the bug to appear, and (if you can) then:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Describe in detail what you were doing when it happened. Include links to any relevant pages / posts.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;List the steps you took to encounter the bug.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Describe your environment: browser make and version, OS, add-ons, userscripts (if applicable).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Include screenshots if applicable. Use hand-drawn circles to highlight key portions&#xA;of the problem.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Status tags can only be applied by moderators and site developers.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-19T00:20:54.690" LastActivityDate="2021-06-19T00:20:54.690" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23580" PostTypeId="4" CreationDate="2021-06-19T00:20:54.690" Score="0" Body="Indicates that the site developers were not able to replicate the behavior reported." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-19T00:20:54.690" LastActivityDate="2021-06-19T00:20:54.690" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23581" PostTypeId="5" CreationDate="2021-06-19T00:21:42.383" Score="0" Body="&lt;p&gt;A feature request or bug with this tag is something that has been evaluated as definitive to implementation.&#xA;However, either there is ongoing investigation on the methods to implement the proposal, or there are other&#xA;active projects that are ahead of it in priority for the site developers. Ideally, this tag indicates that&#xA;the proposal is intended to be implemented in the near term.&lt;/p&gt;&#xA;&lt;p&gt;Contrast &lt;a href=&quot;/questions/tagged/status-deferred&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-deferred&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-deferred&lt;/a&gt;, in which the feature is of lower priority and may be re-evaluated&#xA;on feasibility at a later date.&lt;/p&gt;&#xA;&lt;p&gt;Status tags can only be applied by moderators and site developers.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-19T00:21:42.383" LastActivityDate="2021-06-19T00:21:42.383" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23582" PostTypeId="4" CreationDate="2021-06-19T00:21:42.383" Score="0" Body="Indicates that the feature request or bug is something that is intended to be implemented or fixed, ideally in the near term." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-19T00:21:42.383" LastActivityDate="2021-06-19T00:21:42.383" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23583" PostTypeId="5" CreationDate="2021-06-19T00:54:23.090" Score="0" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/help&quot;&gt;help center&lt;/a&gt; lists information about:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the scope of the site; what is and isn't ok to post to the site&lt;/li&gt;&#xA;&lt;li&gt;the mechanics of the site; how systems such as voting, bounties, and more work&lt;/li&gt;&#xA;&lt;li&gt;badges and privileges, along with how to earn them and what they mean&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Questions specifically about information in and aspects of the help center should be tagged with this tag. Note that questions about badges should only be tagged with this if it is about the &lt;a href=&quot;https://codegolf.stackexchange.com/help/badges&quot;&gt;badge list in the help center&lt;/a&gt;, not about general badges. The same applies to &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges&quot;&gt;privileges&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-19T00:54:23.090" LastActivityDate="2021-06-19T00:54:23.090" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23584" PostTypeId="4" CreationDate="2021-06-19T00:54:23.090" Score="0" Body="The help center is the special area of the site that contains the most basic information about the scope and mechanics of the site " OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-19T00:54:23.090" LastActivityDate="2021-06-19T00:54:23.090" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23585" PostTypeId="2" ParentId="2140" CreationDate="2021-06-19T01:10:35.980" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/237315/convert-codepoint-to-utf-9&quot;&gt;Convert codepoint to UTF-9&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerDisplayName="user100411" LastEditorDisplayName="user100411" LastEditDate="2021-11-15T11:44:56.853" LastActivityDate="2021-11-15T11:44:56.853" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23586" PostTypeId="2" ParentId="23537" CreationDate="2021-06-19T04:50:10.880" Score="18" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;NOTE FROM CM TEAM:&lt;/strong&gt; As per the guidance in the original post, this ad submission will not be selected to be displayed on site. To be more specific, this is an ad promoting a knowledge sharing or collaboration platform, aimed at technologists.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.codidact.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/oWg69.png&quot; alt=&quot;Code Golf on codidact.com&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76162" LastEditorUserId="38734" LastEditDate="2021-07-22T17:39:37.893" LastActivityDate="2021-07-22T17:39:37.893" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23587" PostTypeId="2" ParentId="2140" CreationDate="2021-06-19T11:08:47.087" Score="0" Body="&lt;h1&gt;Largest number with no repeating substrings of length &lt;span class=&quot;math-container&quot;&gt;\$l\$&lt;/span&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://puzzling.stackexchange.com/q/110490/74285&quot;&gt;this question&lt;/a&gt;, in turn inspired by &lt;a href=&quot;https://math.stackexchange.com/q/1997084/909288&quot;&gt;this one&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;When I read the above questions, I thought: &amp;quot;Cool&amp;quot;. And then I thought &amp;quot;&lt;em&gt;What if we go further?&lt;/em&gt;&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;Therefore, in this challenge, you must find the largest number that has no repeating substrings of length n. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;: fewest bytes wins.&lt;/p&gt;&#xA;&lt;h1&gt;Meta Stuff&lt;/h1&gt;&#xA;&lt;p&gt;This seems insanely hard - is it well specified enough?&lt;/p&gt;&#xA;&lt;p&gt;Any changes that seem reasonable to add?&lt;/p&gt;&#xA;" OwnerUserId="100887" LastActivityDate="2021-06-19T11:08:47.087" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23588" PostTypeId="2" ParentId="2140" CreationDate="2021-06-19T14:09:50.343" Score="0" Body="&lt;h1&gt;Smallest number of panels to represent &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; through &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; in base &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://puzzling.stackexchange.com/q/74478/74285&quot;&gt;this question&lt;/a&gt;. (I have taken a lot of inspiration from Puzzling recently).&lt;/p&gt;&#xA;&lt;p&gt;Because not all of you spend all your (non-code-golf) time looking at puzzles, let me explain the relevant details.&lt;/p&gt;&#xA;&lt;p&gt;The challenge involved figuring out how to express the numbers 1 through 8 in only 8 panels in bases 2, 3 and 4. Today, I want to do the converse.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to, given a number &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and a base, &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt;, find the fewest number of panels to represent 1 - n in base b. By that, I mean taking a single continuous slice of the set of panels, we can represent a number, and we can do that for 1 through n.&lt;/p&gt;&#xA;&lt;p&gt;To clarify, each panel can take a single base-&lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; number, and the goal is to find a way to represent each number from 1 through n as a base b number. A continuous slice is a set of panels such that all the panels are consecutive and in the same order as in the original number - for example, 221001120 - in which every two-digit and one-digit number is represented in reading order, left-to-right, as well as 100. Note that 101 and 111 are disallowed because they are not consecutive, with 0s in between, 110, 122 and 2110 are disallowed because they read from left to right, and 121 and 212 are disallowed because they reorder the panels.&lt;/p&gt;&#xA;&lt;p&gt;For a bigger example, let us take the base as 3 and the number as 18: a valid solution is 122121110221010011200, as every number between 1 and 18 can be represented in base 3&lt;/p&gt;&#xA;&lt;p&gt;1: &lt;strong&gt;1&lt;/strong&gt;22121110221010011200&lt;/p&gt;&#xA;&lt;p&gt;2: 1&lt;strong&gt;2&lt;/strong&gt;2121110221010011200&lt;/p&gt;&#xA;&lt;p&gt;3: 1221211&lt;strong&gt;10&lt;/strong&gt;221010011200&lt;/p&gt;&#xA;&lt;p&gt;4: 12212&lt;strong&gt;11&lt;/strong&gt;10221010011200&lt;/p&gt;&#xA;&lt;p&gt;5: 122&lt;strong&gt;12&lt;/strong&gt;1110221010011200&lt;/p&gt;&#xA;&lt;p&gt;6: 122121110221010011&lt;strong&gt;20&lt;/strong&gt;0&lt;/p&gt;&#xA;&lt;p&gt;7: 12&lt;strong&gt;21&lt;/strong&gt;21110221010011200&lt;/p&gt;&#xA;&lt;p&gt;8: 1&lt;strong&gt;22&lt;/strong&gt;121110221010011200&lt;/p&gt;&#xA;&lt;p&gt;9: 1221211102210&lt;strong&gt;100&lt;/strong&gt;11200&lt;/p&gt;&#xA;&lt;p&gt;10: 12212111022&lt;strong&gt;101&lt;/strong&gt;0011200&lt;/p&gt;&#xA;&lt;p&gt;11: 1221211&lt;strong&gt;102&lt;/strong&gt;21010011200&lt;/p&gt;&#xA;&lt;p&gt;12: 122121&lt;strong&gt;110&lt;/strong&gt;221010011200&lt;/p&gt;&#xA;&lt;p&gt;13: 12212&lt;strong&gt;111&lt;/strong&gt;0221010011200&lt;/p&gt;&#xA;&lt;p&gt;14: 1221211102210100&lt;strong&gt;112&lt;/strong&gt;00&lt;/p&gt;&#xA;&lt;p&gt;15: 12212111022101001&lt;strong&gt;120&lt;/strong&gt;0&lt;/p&gt;&#xA;&lt;p&gt;16: 122&lt;strong&gt;121&lt;/strong&gt;110221010011200&lt;/p&gt;&#xA;&lt;p&gt;17: &lt;strong&gt;122&lt;/strong&gt;121110221010011200&lt;/p&gt;&#xA;&lt;p&gt;18: 122121110221010011&lt;strong&gt;200&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;In order to verify your solution does work, provide an optimal answer by the number such that it can be checked.&lt;/p&gt;&#xA;&lt;p&gt;Input looks like this: &lt;code&gt;n b&lt;/code&gt;, and output like this: &lt;code&gt;number solution&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Sample inputs and outputs to aid you (output is represented as o - yes I did work all of these out, and yes, I do believe it is the shortest to just find a place to append the number in):&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$b = 2\$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;n &amp;lt;= 8; o = n (11101000)&#xA;n = 9, 10; o = 11 (10011101000)&#xA;n = 11; o = 13 (1001011101000)&#xA;n = 12, 13, 14; o = 14 (11001011101000)&#xA;n = 15, 16; o = n (110010111010000)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$b = 3\$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;n &amp;lt;= 9; o = n (221001120)&#xA;n = 10; o = 11 (22101001120)&#xA;n = 11; o = 13 (1022101001120)&#xA;n = 12; o = 14 (11022101001120)&#xA;n = 13, 14, 15; o = 15 (111022101001120)&#xA;n = 16; o = 17 (12111022101001120)&#xA;n = 17; o = 19 (12212111022101001120)&#xA;n = 18; o = 20 (122121110221010011200)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$b = 4\$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;n &amp;lt;= 10; o = n (1101220213)&#xA;n = 11; o = 12 (231101220213)&#xA;n = 12, 13; o = 13 (231101220213)&#xA;n = 14, 15; o = n (33231101220213)&#xA;n = 16, 17; o = 18 (10033231101220213)&#xA;n = 18; o = 20 (1003323110122010213)&#xA;n = 19, 20; o = 22 (100103323110122010213)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(i'm not touching 5+ this took me an hour)&lt;/p&gt;&#xA;" OwnerUserId="100887" LastEditorUserId="100887" LastEditDate="2021-06-21T09:37:46.450" LastActivityDate="2021-06-21T09:37:46.450" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23589" PostTypeId="2" ParentId="2140" CreationDate="2021-06-19T23:51:03.693" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/230243/66833&quot;&gt;Reconstruct a recursively prime-encoded integer&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-22T00:20:34.193" LastActivityDate="2021-06-22T00:20:34.193" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23590" PostTypeId="2" ParentId="2140" CreationDate="2021-06-20T03:52:20.037" Score="0" Body="&lt;h1&gt;Iterated ultimatum &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/koth&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;koth&amp;#39;&quot; rel=&quot;tag&quot;&gt;koth&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Each round, players are paired. One player is the Proposer and the other is the Receiver.&lt;/p&gt;&#xA;&lt;p&gt;The Proposer must choose a number x such that 0 &amp;lt; x &amp;lt; 100. The Receiver must then Accept or Reject this offer. If accepted, the Proposer gains x points  and the Receiver gains 100 - x points. If rejected, neither player gains anything. This is repeated several times, then the Proposer and Receiver roles are reversed, then new pairings are made.&lt;/p&gt;&#xA;&lt;p&gt;Repeat.&lt;/p&gt;&#xA;&lt;p&gt;The idea is that the Proposer must try to maximise his own gain, while the Receiver can try to coerce the Proposer to give a larger share of the 100 points by rejecting unfair offers.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Ultimatum_game&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://en.wikipedia.org/wiki/Ultimatum_game&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Too similar to Iterated Prisoner's Dilemma?&lt;/li&gt;&#xA;&lt;li&gt;Any other feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="103324" LastActivityDate="2021-06-20T03:52:20.037" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23592" PostTypeId="2" ParentId="2140" CreationDate="2021-06-20T10:59:25.753" Score="0" Body="&lt;p&gt;Solve &lt;a href=&quot;https://codegolf.stackexchange.com/questions/229994/&quot;&gt;Encode a Lenguage&lt;/a&gt; with score 0. Shortest code wins. Quine rule applies. I'll unlikely post it.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2021-06-20T11:03:30.930" LastActivityDate="2021-06-20T11:03:30.930" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23594" PostTypeId="2" ParentId="2140" CreationDate="2021-06-21T08:14:35.773" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/230307/whens-my-weekend-finally-here&quot;&gt;When's my weekend finally here?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="72738" LastEditorUserId="72738" LastEditDate="2021-06-22T15:28:24.987" LastActivityDate="2021-06-22T15:28:24.987" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23595" PostTypeId="2" ParentId="2140" CreationDate="2021-06-21T14:43:27.233" Score="2" Body="&lt;h1&gt;On a Collapsing Platform&lt;/h1&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;In this KoTH, your task is to not die. It seems simple, right? Well, no.&lt;/p&gt;&#xA;&lt;p&gt;You're on a platform. A giant platform, of size &lt;code&gt;100 * (entries) ^ 1.1&lt;/code&gt; units across (this may change if we get a lot of entries). And every few turns, a random tile is removed. As well as this, you, not a small mass in the scale of things, can cause a tile to fall down. Let me explain how this works.&lt;/p&gt;&#xA;&lt;p&gt;You (the entrant to this KoTH) control a certain number of bots. You (the bots) can then move around on the platform and try not to die. You (still the bots) can move up to 10 units away at base, and can see up to 100 units away (units will be called u from now). However, jumping over a hole costs 2u more, meaning that the largest gap you can clear is three units (3 * 3 for the gap and 1 to land). Do not try and clear 4u+ gaps; &lt;em&gt;you will die&lt;/em&gt;. Going off the edge of the platform also is an unwise choice - &lt;em&gt;you will die&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;By &amp;quot;you - not a small mass in the scale of things&amp;quot;, I mean to say that every step you take takes you closer to your inevitable death - each tile you step on has a hidden durability stat, that will not be revealed to you during the course of the round. When it hits 0, the unlucky bot (hopefully not you (the bot)) on it will be removed with the tile. Do not do this; &lt;em&gt;you will die&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your weight is a random stat that is decided at the start of your game, and is subtracted from a tile's durability each time you step on it (weights are 150 at base, and durability values in the range of &lt;code&gt;15000 - 45000 * (entrants) ^ 1/2&lt;/code&gt;, or 15000 * &lt;code&gt;1-3 * entrants ^ 1/2&lt;/code&gt;, so it only becomes an issue in the long term, or when a lot of players exist.) Do not forget about this and start camping on the same 10 tiles on the end; &lt;em&gt;you will die&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Everything takes place on a tick system - every 10 ticks, you can do an action (subject to change to 20ish if this is exploitable) and this may well be the most important part of the game - reduce it at all costs - the fewer ticks you waste, the less durability you take off, and the longer you can thread the needle between life and death. Do &lt;em&gt;NOT&lt;/em&gt;, and I mean &lt;em&gt;NOT&lt;/em&gt; in caps, forget about this - &lt;em&gt;&lt;strong&gt;you will die&lt;/strong&gt;&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;There are a few items that you can get that will improve your chances and delay your inevitable death represented by these characters:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;-&lt;/code&gt;: Removes 1-7% of your weight (or 1-7, whichever is lesser)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;=&lt;/code&gt;: Increases your speed by 1 (at 13, this will in fact, prove me wrong and let you clear 4u jumps - still not got the + though).&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;?&lt;/code&gt; Increases vision by 5 (allowing you to see 5 more blocks in either direction.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;gt;&lt;/code&gt; Reduces your tick delay by 0.1 or 1% of your tick rate, should it drop below 5 (however, before that, &lt;em&gt;you will die&lt;/em&gt; most likely.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;+&lt;/code&gt; Duplicates the bot - you start with 10 bots, and each bot left over at the end is worth 10 000 points (1 per tick survived), so this can, effectively, give you 10 000 points free.&lt;/p&gt;&#xA;&lt;p&gt;Every 10-25 turns, a random platform is removed - unless necessary, this will not drop any bots - the platform chosen will always be empty (just so people don't get unlucky and die at turn 85) unless it is forced not to be - for example, in the endgame, where there is only 10 tiles left. Do not forget this; &lt;em&gt;you will die&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Input and Output&lt;/h2&gt;&#xA;&lt;p&gt;To begin with, you will get a string such as this&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;0, 111, 132, 122, 133, 211, 201, 212, 233, 310, 323&lt;/code&gt;, where:&lt;/p&gt;&#xA;&lt;p&gt;The first number represents your unique player id, known as PID in the it gang. Then, you get 10 numbers, representing your bots' start positions.&lt;/p&gt;&#xA;&lt;p&gt;Then, for each turn, for each bot that did not die, you (the player) get a string such as this (shortened to save space):&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;.___.+&amp;gt;-__u__...+&amp;gt;+-_._&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;representing the bot's vision.&lt;/p&gt;&#xA;&lt;p&gt;You must then return an integer, representing how many units you wish to move forward (negative is backwards) (and do not forget that spaces take 2u more, or &lt;em&gt;you will die&lt;/em&gt;.); do not try and move more than your speed, or it will be modulo-ed. Errors and invalid input return 0. Note, spaces are represented with &lt;code&gt;.&lt;/code&gt;, in the examples and in game.&lt;/p&gt;&#xA;&lt;h2&gt;Helper functions (to delay your death, hopefully until the end):&lt;/h2&gt;&#xA;&lt;p&gt;&lt;code&gt;info()&lt;/code&gt;: gives you a chunk of info, in this format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;PID: 0&#xA;Bots: 11&#xA;Score: 10000&#xA;[&#xA;BID: 1&#xA;Weight: 97&#xA;Speed: 12&#xA;Tick Delay: 8.8&#xA;Vision: 110&#xA;Pos: -932&#xA;Score: 830&#xA;]&#xA;&#xA;[&#xA;BID: 3&#xA;...&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The string is format as such:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;First, your unique PID.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Then, the number of bots you still have.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Then, your total score.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Then, for each bot:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Its bot ID (or BID for the it gang). (Note, BID are cannot be reassigned, so if Bot 2 dies, and then Bot 1 duplicates, it will have a BID of 10, not 2 (also we count from 0) as it would be if they were.)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Its weight, speed, tick delay and vision, in that order.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Its position on the platform, in that order.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Its score.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;code&gt;position()&lt;/code&gt;: gives a position of every bot, ordered by their bot ID, or BID (again, only for the it gang).&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;position(ID)&lt;/code&gt;: gives the x position for a bot with a specific ID. If that ID has died already, it will return &amp;quot;Dead&amp;quot; - plus the space where it died. If that bot never existed, it will return &lt;code&gt;None&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;tickdelay(), weight(), speed(), vision(), tickdelay(ID), weight(ID), speed(ID), vision(ID):&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Does exactly what it says on the tin, returns that specific stat for all bots if no ID is given, or the one with that ID should it be given (again, if the bot is dead, it just returns its stats on the turn it died, and if it never existed, it returns &lt;code&gt;None&lt;/code&gt;. Make of it what you will).&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;vision(ID)&lt;/code&gt; Gives a specific bot's vision - this is useful for sketching a map of the world in conjunction with &lt;code&gt;position(ID)&lt;/code&gt;. Note that other bots are represented as &lt;code&gt;s&lt;/code&gt;, so if you're lucky enough to get your bot (&lt;code&gt;u&lt;/code&gt;) in between two opposing bots (&lt;code&gt;s&lt;/code&gt;), feel free to laugh.&lt;/p&gt;&#xA;&lt;p&gt;You are allowed access to ALL the random functions (apart from &lt;code&gt;random.seed()&lt;/code&gt;, however I will use a set of predetermined seeds in a random order to facilitate retesting. There will be a large number of trials done - this is just to aid improvements if you so desire to make them.&lt;/p&gt;&#xA;&lt;p&gt;Bots can store variables and write to files, but ONLY in their directory. I will find any bot who does this and ban them.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Bots gain 1 point for each turn they survive, increasing by 1 every 100-200 turns. This will be notified with the string &lt;code&gt;Score/turn increased by 1&lt;/code&gt;. Every powerup gives +500, except for &lt;code&gt;+&lt;/code&gt;, which duplicates the bot, &lt;em&gt;including its score&lt;/em&gt;, thus adding its score to your total. At the end, when there is three or fewer tiles left, you gain 10000 + the bot's current score for each bot left alive. This is done for every bot that lives, so people getting 2 or more bots through gain more than those getting 1, and two opposing bots can both get points for their team.&lt;/p&gt;&#xA;&lt;p&gt;At least 10000 games will be run per round (subject to change), each time resetting all the stats to the base, rerolling RNG and restarting from the beginning.&lt;/p&gt;&#xA;&lt;p&gt;After as many rounds as I can get through on my PC, the scores will be added up, and the winner gets an accept.&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;p&gt;Help with a Python controller would be appreciated.&lt;/p&gt;&#xA;&lt;p&gt;Any specifications need to be made?&lt;/p&gt;&#xA;&lt;p&gt;Should I edit any formulae?&lt;/p&gt;&#xA;" OwnerUserId="100887" LastEditorUserId="100887" LastEditDate="2021-06-22T13:28:56.817" LastActivityDate="2021-06-22T13:28:56.817" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23596" PostTypeId="2" ParentId="23537" CreationDate="2021-06-21T15:07:42.657" Score="9" Body="&lt;p&gt;Title: Short code isn't everything. Find out how to vote!&lt;/p&gt;&#xA;&lt;p&gt;URL: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10127/how-can-we-help-users-who-are-put-off-by-the-use-of-golfing-languages/10132#10132&quot;&gt;How can we help users who are put off by the use of golfing languages?&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Size: banner&lt;/p&gt;&#xA;&lt;p&gt;Displayed on: self&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-06-21T15:07:42.657" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23597" PostTypeId="2" ParentId="23537" CreationDate="2021-06-21T16:10:56.700" Score="9" Body="&lt;p&gt;Title: Welcome to the site - check out our information page first!&lt;/p&gt;&#xA;&lt;p&gt;URL: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/20861/66833&quot;&gt;Welcome to Code Golf and Coding Challenges Stack Exchange!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Size: Right sidebar&lt;/p&gt;&#xA;&lt;p&gt;Displayed on: self&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-06-21T16:10:56.700" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23598" PostTypeId="2" ParentId="23537" CreationDate="2021-06-21T16:13:24.713" Score="10" Body="&lt;p&gt;Title: Welcome to the site - check out our information page first!&lt;/p&gt;&#xA;&lt;p&gt;URL: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/20861/66833&quot;&gt;Welcome to Code Golf and Coding Challenges Stack Exchange!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Size: Banner&lt;/p&gt;&#xA;&lt;p&gt;Displayed on: self&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-06-21T16:13:24.713" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23599" PostTypeId="2" ParentId="23537" CreationDate="2021-06-21T16:44:11.130" Score="9" Body="&lt;p&gt;&lt;a href=&quot;https://www.dyalog.com/user-meetings/index.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/JB6Yi.png&quot; alt=&quot;Dyalog APL seeds: overview of APL, intro to resources, demo of real-world apps&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="38734" LastEditDate="2021-08-12T11:23:23.070" LastActivityDate="2021-08-12T11:23:23.070" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23600" PostTypeId="2" ParentId="23537" CreationDate="2021-06-21T16:46:26.200" Score="8" Body="&lt;p&gt;&lt;a href=&quot;https://www.dyalog.com/user-meetings/index.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/TWuGQ.png&quot; alt=&quot;Dyalog APL seeds: overview of APL, intro to resources, demo of real-world apps&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="38734" LastEditDate="2021-08-12T11:23:43.157" LastActivityDate="2021-08-12T11:23:43.157" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23601" PostTypeId="2" ParentId="2140" CreationDate="2021-06-21T19:52:23.627" Score="0" Body="&lt;h1&gt;Are these strings within N bit flips of each other? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary&amp;#39;&quot; rel=&quot;tag&quot;&gt;binary&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Given two strings &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt;, and a positive integer &lt;code&gt;n&lt;/code&gt;, determine if &lt;code&gt;b&lt;/code&gt; can be reached by performing exactly &lt;code&gt;n&lt;/code&gt; bit-flips on &lt;code&gt;a&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;A bit-flip is defined as changing one of the bits in the character encoding of a string from a 0 to a 1 or from a 1 to a 0&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;The same bit may be flipped multiple times&lt;/strong&gt;, so the &lt;code&gt;0110&lt;/code&gt; can be reached in exactly 2 bit-flips of itself, as well as in 0 (e.g. &lt;code&gt;0110 -&amp;gt; 0100 -&amp;gt; 0110&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;h2&gt;Test-cases&lt;/h2&gt;&#xA;&lt;h4&gt;Truthy&lt;/h4&gt;&#xA;&lt;pre&gt;&lt;code&gt;n   a         b&#xA;=======================&#xA;1   hello     hullo&#xA;3   hello     hullo&#xA;5   hello     hullo&#xA;69  hello     hullo&#xA;4   hello     hello&#xA;1   x         h&#xA;1   x         p&#xA;1   x         y&#xA;2   x         q&#xA;2   x         l&#xA;2   x         x&#xA;4   x         l&#xA;4   x         x&#xA;4   x         w&#xA;4   x         e&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h4&gt;Falsey&lt;/h4&gt;&#xA;&lt;pre&gt;&lt;code&gt;n   a         b&#xA;=======================&#xA;2   hello     hullo&#xA;5   hello     hello&#xA;1   x         a&#xA;1   x         n&#xA;1   x         f&#xA;1   x         x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may assume/require:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;n &amp;gt; 0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; are the same length&lt;/li&gt;&#xA;&lt;li&gt;neither string is empty&lt;/li&gt;&#xA;&lt;li&gt;both strings consist only of lowercase letters &lt;code&gt;a&lt;/code&gt; to &lt;code&gt;z&lt;/code&gt; (or uppercase &lt;code&gt;A&lt;/code&gt; to &lt;code&gt;Z&lt;/code&gt; instead, if you wish)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;You should encode the strings in ASCII (or other ASCII-compatible encoding), but if your language cannot easily handle that, ask in the comments and I'll decide on special rules&lt;/li&gt;&#xA;&lt;li&gt;Your code does not need to handle high &lt;code&gt;n&lt;/code&gt; or long &lt;code&gt;a&lt;/code&gt; or &lt;code&gt;b&lt;/code&gt;, but it must work in theory&lt;/li&gt;&#xA;&lt;li&gt;You may use &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447&quot;&gt;any reasonable I/O method&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Better title suggestions?&lt;/li&gt;&#xA;&lt;li&gt;I limited to ASCII to avoid people finding loopholes that trivialise the challenge. Do you have any other suggestions that would work better?&lt;/li&gt;&#xA;&lt;li&gt;Test-case suggestions?&lt;/li&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Is this clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Any other feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2021-06-21T19:52:23.627" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23604" PostTypeId="2" ParentId="2140" CreationDate="2021-06-22T06:59:53.967" Score="0" Body="&lt;h1&gt;Maximum unique characters &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Write a program which maximises the amount of unique characters in its output while minimising the size of its source. The program must halt.&lt;/p&gt;&#xA;&lt;p&gt;Functions for converting a character code to its character in any encoding are disallowed.&lt;/p&gt;&#xA;&lt;p&gt;Your score is &lt;code&gt;output unique chars / size in bytes&lt;/code&gt;, and higher is better.&lt;/p&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Should character code functions be banned?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="103324" LastEditorUserId="103324" LastEditDate="2021-06-22T07:31:35.370" LastActivityDate="2021-06-22T07:31:35.370" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23605" PostTypeId="2" ParentId="2140" CreationDate="2021-06-22T07:57:48.933" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/230689/100690&quot;&gt;The Great Betting Game&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerDisplayName="user100690" LastEditorDisplayName="user100690" LastEditDate="2021-06-29T08:19:13.390" LastActivityDate="2021-06-29T08:19:13.390" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23606" PostTypeId="2" ParentId="20722" CreationDate="2021-06-22T09:12:23.937" Score="2" Body="&lt;p&gt;My profile pic is the default.&lt;/p&gt;&#xA;&lt;p&gt;AndrewTheCodegolfer is the third name in a line of &amp;quot;andrewthe[thing]&amp;quot; names that I have had, the line beginning with andrewtheredditor and andrewthediscorder.&lt;/p&gt;&#xA;" OwnerUserId="84216" LastEditorUserId="84216" LastEditDate="2021-06-22T09:21:45.013" LastActivityDate="2021-06-22T09:21:45.013" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23607" PostTypeId="2" ParentId="23549" CreationDate="2021-06-23T14:12:35.747" Score="0" Body="&lt;p&gt;Under this new system we're testing, ads get manually collected and submitted to our Ad Ops team. That means that leaving the question open and unlocked makes absolutely no difference other than possibly leading to confusion, since users may be led to think that they can still submit ads or impact what ads get displayed by voting on the ones already proposed.&lt;/p&gt;&#xA;&lt;p&gt;I've mentioned on MSE before that once the trial is over we'll reassess how frequently ads need to be rotated, and potentially if there are bits that we can automate to assist with that (potentially faster) rotation (as you noted in the question too).&lt;/p&gt;&#xA;&lt;p&gt;For the above reasons, I'm going to &lt;a href=&quot;/questions/tagged/status-declined&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-declined&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-declined&lt;/a&gt; this. If I completely misunderstood your request, though, lemme know.&lt;/p&gt;&#xA;" OwnerUserId="38734" LastActivityDate="2021-06-23T14:12:35.747" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23608" PostTypeId="1" CreationDate="2021-06-23T19:01:15.717" Score="-3" ViewCount="99" Body="&lt;p&gt;Do you have a favorite code-golf video? Maybe someone golfing before it was cool? Or because it was a way to solve a problem?&lt;/p&gt;&#xA;" OwnerUserId="18121" LastActivityDate="2021-06-23T19:01:15.717" Title="What's your favorite code golf video?" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="2" ClosedDate="2021-06-27T10:58:46.960" ContentLicense="CC BY-SA 4.0" />
  <row Id="23609" PostTypeId="2" ParentId="23608" CreationDate="2021-06-23T19:01:15.717" Score="2" Body="&lt;p&gt;Here's my favorite, Guy Steele reverse-engineering his old program golfed to fit on a single punch card.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.youtube.com/watch?v=dPK6t7echuA&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.youtube.com/watch?v=dPK6t7echuA&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="18121" LastActivityDate="2021-06-23T19:01:15.717" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23613" PostTypeId="5" CreationDate="2021-06-24T17:45:55.220" Score="0" Body="&lt;p&gt;When reporting a bug, your question should include what you did to discover the bug, the steps required to reproduce the problem, the given system output, and the expected system output.&lt;/p&gt;&#xA;&lt;p&gt;If necessary to document or explain the issue, please include a screenshot.&lt;/p&gt;&#xA;&lt;p&gt;If the bug applies to more than one site on the network, please report it on &lt;a href=&quot;https://meta.stackexchange.com&quot;&gt;Mother Meta&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-24T17:45:55.220" LastActivityDate="2021-06-24T17:45:55.220" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23614" PostTypeId="4" CreationDate="2021-06-24T17:45:55.220" Score="0" Body="Indicates you've found an erroneous or unexpected behaviour in the system that needs to be fixed." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-24T17:45:55.220" LastActivityDate="2021-06-24T17:45:55.220" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23617" PostTypeId="2" ParentId="2140" CreationDate="2021-06-25T09:41:13.420" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/230620/full-name-quine&quot;&gt;Full name quine&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="66833" LastEditDate="2021-07-04T01:07:22.700" LastActivityDate="2021-07-04T01:07:22.700" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23618" PostTypeId="5" CreationDate="2021-06-25T19:32:44.333" Score="0" Body="&lt;p&gt;This tag is to be used on posts that are part of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/23551/66833&quot;&gt;CGCC Blog&lt;/a&gt;. For questions that discuss the blog instead, should be tagged with &lt;a href=&quot;/questions/tagged/blog&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;blog&amp;#39;&quot; rel=&quot;tag&quot;&gt;blog&lt;/a&gt;. Unless your post is officially part of the blog, please do not use this tag.&lt;/p&gt;&#xA;&lt;p&gt;Blog posts should be tagged with &lt;a href=&quot;/questions/tagged/discussion&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/cgcc-blog&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cgcc-blog&amp;#39;&quot; rel=&quot;tag&quot;&gt;cgcc-blog&lt;/a&gt;, as well up to 2 applicable tags, and &lt;a href=&quot;/questions/tagged/featured&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;featured&amp;#39;&quot; rel=&quot;tag&quot;&gt;featured&lt;/a&gt; when first posted (raise a custom mod flag on the post if this tag hasn't been applied after a day)&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-09-26T14:44:23.017" LastActivityDate="2021-09-26T14:44:23.017" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23619" PostTypeId="4" CreationDate="2021-06-25T19:32:44.333" Score="0" Body="To be used on blog posts. For posts about the blog, please use the [blog] tag instead" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-25T19:32:44.333" LastActivityDate="2021-06-25T19:32:44.333" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23620" PostTypeId="5" CreationDate="2021-06-26T02:28:25.570" Score="0" Body="&lt;p&gt;Discussion questions are the heart of your community.&#xA;For example: Should a certain question be allowed on the site? For what reason did a moderator lock a certain question? Are said actions setting a precedent?&lt;/p&gt;&#xA;&lt;p&gt;Be sure to present your entire case and background information/data so the subject can be discussed fully.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-26T02:28:25.570" LastActivityDate="2021-06-26T02:28:25.570" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23621" PostTypeId="4" CreationDate="2021-06-26T02:28:25.570" Score="0" Body="The question you're asking is designed to solicit opinions or best-practices on a particular topic, with the goal of reaching community consensus." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-26T02:28:25.570" LastActivityDate="2021-06-26T02:28:25.570" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23622" PostTypeId="2" ParentId="2140" CreationDate="2021-06-26T02:30:44.667" Score="0" Body="&lt;h1&gt;Extend the OEIS&lt;/h1&gt;&#xA;&lt;p&gt;On the &lt;a href=&quot;https://oeis.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS&lt;/a&gt;, there are a significant amount of sequences which do not have proper continuations to them, in other words, the length of the sequence was cut short by the methods at that point.&lt;/p&gt;&#xA;&lt;p&gt;An example of this is the sequence in this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/51266/extending-oeis-counting-diamond-tilings/&quot;&gt;post&lt;/a&gt; before it was extended by &lt;a href=&quot;https://codegolf.stackexchange.com/a/51662/99035&quot;&gt;this&lt;/a&gt; answer.&lt;/p&gt;&#xA;&lt;p&gt;A sequence that wouldn't qualify for this post would be the &lt;a href=&quot;https://oeis.org/A000045&quot; rel=&quot;nofollow noreferrer&quot;&gt;fibonacci&lt;/a&gt; sequence because while it may have a limit on the OEIS, the end is not due to the method used, but instead due to the large amount of current entries.&lt;/p&gt;&#xA;&lt;h4&gt;Challenge:&lt;/h4&gt;&#xA;&lt;p&gt;Find a sequence on the OEIS that follows the above guidelines and extend it by any amount. Your answer should include the code, an explanation of it, as well as the new entries.&lt;/p&gt;&#xA;&lt;p&gt;Example Answer&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A1327807 &#xA;previous largest n=8 number = 100000001&#xA;new highest n=12 number = 37812879128&#xA;&#xA;// code&#xA;// more code&#xA;&#xA;// explanation of code and how you figured it out&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Of course your answer doesn't need to follow that format exactly, it should just be close to it.&lt;/p&gt;&#xA;&lt;h4&gt;Notes:&lt;/h4&gt;&#xA;&lt;p&gt;You must write original code for this challenge. If there is already a program out there, and you're only contribution is running it on a better machine, that is a trivially extendable sequence.&lt;/p&gt;&#xA;&lt;p&gt;This also goes for answers, as the only thing contributed cannot be simply better hardware.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; for lack of a better tag, so good luck and have fun!&lt;/p&gt;&#xA;" OwnerUserId="99035" LastActivityDate="2021-06-26T02:30:44.667" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23623" PostTypeId="5" CreationDate="2021-06-26T02:33:29.000" Score="0" Body="&lt;p&gt;This tag is meant to highlight important discussions and attract attention to them. These can be recent events, site definitions, and any discussion whose resolution may have a critical impact on the whole site. It is generally a wise idea to at least look at any new questions with this tag.&lt;/p&gt;&#xA;&lt;p&gt;In order to get a meta question tagged with this, raise a custom moderator flag an explain why you believe so.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-26T02:33:29.000" LastActivityDate="2021-06-26T02:33:29.000" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23624" PostTypeId="4" CreationDate="2021-06-26T02:33:29.000" Score="0" Body="A special moderator-only tag to mark important meta discussions. A question with this tag can be seen on the main site in a special sidebar in the questions list and when viewing individual questions." OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-26T02:33:29.000" LastActivityDate="2021-06-26T02:33:29.000" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23625" PostTypeId="5" CreationDate="2021-06-26T02:36:53.227" Score="0" Body="&lt;p&gt;Your question should contain the details of your proposal,&#xA;including a justification of why the new feature is needed and/or how it can improve the community.&lt;/p&gt;&#xA;&lt;p&gt;Basically, prove to the administration that they should spend time developing your feature.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-26T02:36:53.227" LastActivityDate="2021-06-26T02:36:53.227" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23626" PostTypeId="4" CreationDate="2021-06-26T02:36:53.227" Score="0" Body="You have an idea for a new feature, or for a change to the existing functionality. Make sure you provide justification for why your suggestion should be implemented" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-26T02:36:53.227" LastActivityDate="2021-06-26T02:36:53.227" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23627" PostTypeId="5" CreationDate="2021-06-26T03:00:37.487" Score="0" Body="&lt;p&gt;On occasion, meta discussion strays away from general consensus and towards discussion about a specific post. In such situations, this and the related &lt;a href=&quot;/questions/tagged/specific-question&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;specific-question&amp;#39;&quot; rel=&quot;tag&quot;&gt;specific-question&lt;/a&gt; tag are used to indicate that the post only applies to a specific answer, and that the answer doesn't necessarily create site consensus.&lt;/p&gt;&#xA;&lt;p&gt;In cases where a dispute around an answer cannot be resolved via comments, voting and chat, opening a meta discussion under this tag is the appropriate action to take.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-26T03:00:37.487" LastActivityDate="2021-06-26T03:00:37.487" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23628" PostTypeId="4" CreationDate="2021-06-26T03:00:37.487" Score="0" Body="For discussions about a specific answer, either on main or meta" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-26T03:00:37.487" LastActivityDate="2021-06-26T03:00:37.487" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23629" PostTypeId="5" CreationDate="2021-06-26T03:27:35.190" Score="0" Body="&lt;p&gt;Spoiler markdown is displayed as&lt;/p&gt;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;&lt;p&gt; This is a spoiler&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The markdown used for this is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;! This is a spoiler&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This tag is for questions about this markdown, including &lt;a href=&quot;/questions/tagged/support&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt; questions on how to use it and &lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt; reports about issues with the formatting.&lt;/p&gt;&#xA;&lt;p&gt;Spoilers are typically used on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzle&lt;/a&gt; challenges and retired &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; challenges.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-26T03:27:35.190" LastActivityDate="2021-06-26T03:27:35.190" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23630" PostTypeId="4" CreationDate="2021-06-26T03:27:35.190" Score="0" Body="For questions about the spoiler markdown, a way of hiding content behind a clickable screen in order to prevent &quot;spoiling&quot; it" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-26T03:27:35.190" LastActivityDate="2021-06-26T03:27:35.190" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23631" PostTypeId="2" ParentId="2140" CreationDate="2021-06-26T16:14:53.860" Score="0" Body="&lt;h1&gt;Do I flip the side?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Introduction&lt;/h3&gt;&#xA;&lt;p&gt;When writing on a piece of paper folded &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; times you have &lt;span class=&quot;math-container&quot;&gt;\$2^{n+1}\$&lt;/span&gt; sides available to write on. When writing on those sides, you can imagine the following sequence of actions (for &lt;span class=&quot;math-container&quot;&gt;\$n=2\$&lt;/span&gt;):&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;write on the first side and fill the whole side,&lt;/li&gt;&#xA;&lt;li&gt;flip the paper to the next empty side and write there until filled,&lt;/li&gt;&#xA;&lt;li&gt;now we have to unfold the paper once (at least) to get to the next empty side and &amp;quot;flip&amp;quot; the fold,&lt;/li&gt;&#xA;&lt;li&gt;flip the paper to the next empty side,&lt;/li&gt;&#xA;&lt;li&gt;unfold the paper twice to get to the empty side and &amp;quot;flip&amp;quot; the fold,&lt;/li&gt;&#xA;&lt;li&gt;etc.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Given number of folds &lt;span class=&quot;math-container&quot;&gt;\$n \geq 0 \$&lt;/span&gt; output the number of unfolds needed to get to the next clear side.&lt;br /&gt;&#xA;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; rules apply, so you can:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take an index &lt;span class=&quot;math-container&quot;&gt;\$k \leq 2^{n+1}-1\$&lt;/span&gt; and output the &lt;span class=&quot;math-container&quot;&gt;\$k^{th}\$&lt;/span&gt; term, either 0 or 1 indexing.&lt;/li&gt;&#xA;&lt;li&gt;Take a positive integer &lt;span class=&quot;math-container&quot;&gt;\$k \leq 2^{n+1}-1\$&lt;/span&gt; and output the first &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; terms.&lt;/li&gt;&#xA;&lt;li&gt;Output whole sequence for given &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;n | sequence&#xA;----------------------------------&#xA;0 | 0 (no unfolds, just a flip)&#xA;1 | 0 1 0&#xA;2 | 0 1 0 2 0 1 0&#xA;3 | 0 1 0 2 0 1 0 3 0 1 0 2 0 1 0&#xA;4 | 0 1 0 2 0 1 0 3 0 1 0 2 0 1 0 4 0 1 0 2 0 1 0 3 0 1 0 2 0 1 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Meta&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Too easy?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="55372" LastEditorUserId="55372" LastEditDate="2021-06-27T10:51:59.810" LastActivityDate="2021-06-27T10:51:59.810" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23633" PostTypeId="2" ParentId="2140" CreationDate="2021-06-26T22:47:56.903" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/230677/print-this-sequence-i-just-made-up&quot;&gt;Print this sequence I just made up&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="66833" LastEditDate="2021-07-04T01:05:50.397" LastActivityDate="2021-07-04T01:05:50.397" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="23634" PostTypeId="5" CreationDate="2021-06-27T00:05:12.600" Score="0" Body="&lt;p&gt;This tag should be used on questions that either present statistics about the site or on questions that ask for statistics about topics relating to the site. Shared statistics should aim to promote discussion about the topic, rather than just presenting facts and numbers.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, this tag is used each year on Stack Exchange's &lt;a href=&quot;https://codegolf.meta.stackexchange.com/search?q=title%3A%22a+year+in+moderation%22+is%3Aq&quot;&gt;A Year in Moderation&lt;/a&gt; posts, which present moderations statistics about the previous year that are generally either not at all viewable, or only viewable by a certain subset of users.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-27T00:05:12.600" LastActivityDate="2021-06-27T00:05:12.600" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23635" PostTypeId="4" CreationDate="2021-06-27T00:05:12.600" Score="0" Body="For questions that present or ask for statistics that specifically relate to CGCC. Note that, if you want to present statistics, they should be somewhat substantial and beyond what could be shared in chat" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-06-27T00:05:12.600" LastActivityDate="2021-06-27T00:05:12.600" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23638" PostTypeId="2" ParentId="2140" CreationDate="2021-06-27T12:33:54.150" Score="0" Body="&lt;h1&gt;Is this a valid Temtem character name?&lt;/h1&gt;&#xA;&lt;p&gt;Given a string of between 0 and 15 (inclusive) printable ASCII characters, determine whether the string represents an acceptable character name for the game Temtem.&lt;/p&gt;&#xA;&lt;p&gt;The following rules apply to character names:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Names must have at least 3 letters (a-z)&lt;/li&gt;&#xA;&lt;li&gt;Names may have up to 2 total prefixes and/or suffixes of at least one letter&lt;/li&gt;&#xA;&lt;li&gt;Prefixes and suffixes must be separated from the name by one of space, hyphen or apostrophe&lt;/li&gt;&#xA;&lt;li&gt;The first letter of the name and each prefix may be capitalised but all other letters must be lower case.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Truthy examples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Daddy's girl&#xA;de Morgan&#xA;Rip Van Winkle&#xA;Spider-Man&#xA;X-Men&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Falsy examples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;McDonald's&#xA;-XX-&#xA;'falsy'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note: Temtem may apply other checks to character names not included here.&lt;/p&gt;&#xA;&lt;p&gt;As this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;, Output must be a single consistent value for all valid names. Output for invalid names must be consistent for a given invalid name, but may vary between different invalid names, so for instance a count of errors is an acceptable output format.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2021-06-27T12:33:54.150" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23640" PostTypeId="2" ParentId="2140" CreationDate="2021-06-27T21:18:44.747" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/230870/generate-the-shortest-regex-to-match-these-but-not-those#230870&quot;&gt;Generate the shortest regex to match these but not those&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96393" LastEditorUserId="96393" LastEditDate="2021-07-01T21:15:09.363" LastActivityDate="2021-07-01T21:15:09.363" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23641" PostTypeId="2" ParentId="2140" CreationDate="2021-06-28T12:13:48.207" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/230842/days-of-the-week&quot;&gt;Days of the Week&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="21697" LastEditorUserId="21697" LastEditDate="2021-07-01T12:48:35.777" LastActivityDate="2021-07-01T12:48:35.777" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23642" PostTypeId="1" CreationDate="2021-06-29T06:24:36.890" Score="1" ViewCount="66" Body="&lt;p&gt;Testing ground for the answer importer on this proposed challenge (dwarf edition)&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/23556/16824&quot;&gt;https://codegolf.meta.stackexchange.com/a/23556/16824&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Please do not answer this question!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I am using this question as a mock to write code to import entries into the KotH challenge against. My development instance is pulling answers from this question to ensure everything works before I go live.&lt;/p&gt;&#xA;&lt;p&gt;Once the challenge goes live, the answers will be imported from one of two questions on the main Code Golf site.&lt;/p&gt;&#xA;" OwnerUserId="16824" LastEditorUserId="16824" LastEditDate="2021-06-29T13:49:36.700" LastActivityDate="2021-07-02T14:41:50.253" Title="Stack Exchange API Sandbox (dwarf edition)" Tags="|support|" AnswerCount="2" CommentCount="3" ClosedDate="2021-07-17T21:36:26.967" ContentLicense="CC BY-SA 4.0" />
  <row Id="23643" PostTypeId="2" ParentId="23642" CreationDate="2021-06-29T06:27:19.557" Score="0" Body="&lt;h1&gt;baby steps&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;class {&#xA;  constructor(controller, utils) {&#xA;    this.controller = controller;&#xA;    this.side = controller.side;&#xA;    this.utils = utils;&#xA;    this.it_is_a_day = false;&#xA;  }&#xA;&#xA;  turn() {&#xA;    var dwarf = this.controller.dwarfs()[0];&#xA;    if(dwarf) {&#xA;      var moves = this.controller.check_space(dwarf.x, dwarf.y).safe_moves;&#xA;      if(moves[0]) {&#xA;        this.controller.select_space(dwarf.x, dwarf.y);&#xA;        this.controller.move(moves[0].x, moves[0].y);&#xA;      } else {&#xA;        this.call_it_a_day();&#xA;      }&#xA;    } else {&#xA;      this.call_it_a_day();&#xA;    }&#xA;  }&#xA;&#xA;  call_it_a_day() {&#xA;    this.it_is_a_day = true;&#xA;    this.controller.declare(true);&#xA;&#xA;    var dwarf = this.controller.dwarfs()[0];&#xA;    var space_info = this.controller.check_space(dwarf.x, dwarf.y);&#xA;    this.controller.select_space(dwarf.x, dwarf.y);&#xA;    this.controller.move(space_info.moves[0].x, space_info.moves[0].y);&#xA;  }&#xA;&#xA;  end_turn() {&#xA;    var scores = this.controller.scores();&#xA;    this.controller.declare(this.it_is_a_day || scores.winning == 'd');&#xA;  }&#xA;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="16824" LastEditorUserId="16824" LastEditDate="2021-06-30T21:26:35.367" LastActivityDate="2021-06-30T21:26:35.367" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23644" PostTypeId="2" ParentId="2140" CreationDate="2021-06-29T07:48:39.713" Score="0" Body="&lt;h1&gt;General Binary Counterman Jr&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/229683/mr-binary-counterman&quot;&gt;Related&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;General Binary Counterman Jr is the son of famed Mr. Binary Counterman. He’s continued in his father’s footsteps, counting strings of numbers in the family tradition. But binary has grown old; he’s not a computer. The General has waited for his father’s popularity to wane, and he has decided the time is nigh. The General is about to generalize!&lt;/p&gt;&#xA;&lt;p&gt;As a reminder, his father would count the evens and odds like this:&#xA;&lt;code&gt;1 1 0 0 1 0&lt;/code&gt;  would be read as  &lt;code&gt;1st odd, 2nd odd, 1st even, 2nd even, 3rd odd, 3rd even&lt;/code&gt; and it becomes &lt;code&gt;1 3 0 2 5 4&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;But not so the General. Evens and odds are just 0s and 1s mod 2, the General knows this.  Instead of reducing mod 2, he likes to reduce strings down whatever mod he pleases. Once he does he counts the residues the same way as his father did, but in whatever mod he damn well wants.&lt;/p&gt;&#xA;&lt;p&gt;The General has &lt;a href=&quot;https://codegolf.stackexchange.com/questions/229683/mr-binary-counterman&quot;&gt;read the algorithms that fans have sent his father&lt;/a&gt;. But he believes that his new method will yield sufficiently different strategies as to deserve its own page on the internet.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;Given two inputs representing a mod &lt;code&gt;m&lt;/code&gt; and a list &lt;code&gt;L&lt;/code&gt;, the nth occurrence of a given congruence class in the list should be output as the nth integer of that class.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;The I/O is very flexible and may take any reasonable format, so long as it doesn’t sidestep part of the problem. For instance, you may take the list backwards or as a string, but you can’t take it already reduced mod m.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so least bytes wins!&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/%23%23XY9PSwMxEMXv8ykeKdJdWxZ1FXRhT56EHrxKKXRpUje4SZb8OfTTr5NQVMwlb@Y3700yX@LobLsIIejtjItLa4lJfylEhxT4GhVaL3Ea1RBzM8TBR5xcslHbT@zvDmBwNMctBik7ooIC@oxuzbXMYz3uifcsK7wPnqO1nVNEcDg7bzhDh7ItDEY1@HAJYXRpknYdIR0jHchsseOc4qzqJsyTjpXoRE2mtGNlasoT@6x1naOhGWDXhOj1XAmIHx/LAxGt8Oqk@v9u@rV2BD5eZahvTKlmnzdwb3P9IEu2baGs7HNymfrDsOH/L0vb4QktHvCMR1Yv3w&quot; rel=&quot;nofollow noreferrer&quot;&gt;Reference Implementation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;In my examples, I will represent the I/O as &lt;code&gt;3: 5 3 2 8 4 5 9&lt;/code&gt;  -&amp;gt; &lt;code&gt;1 3 2 4 5 6&lt;/code&gt; to represent the reminder. This means &lt;code&gt;m = 2&lt;/code&gt; and &lt;code&gt;L = 1 1 0 0 1 0&lt;/code&gt;. But again, you are not required to do it this way. In fact, you’re encouraged to find the I/O scheme that works best for your language and algorithm!&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; &lt;code&gt;3: 5 3 2 8 4 5 9&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;This gets counted mod 3 by its congruence class of [0], [1] or [2]:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;L  m       Count       &#xA;5 %3  -&amp;gt;  1st [2]  -&amp;gt;  2&#xA;3 %3  -&amp;gt;  1st [0]  -&amp;gt;  0&#xA;2 %3  -&amp;gt;  2nd [2]  -&amp;gt;  5&#xA;8 %3  -&amp;gt;  3rd [2]  -&amp;gt;  8&#xA;4 %3  -&amp;gt;  1st [1]  -&amp;gt;  1&#xA;5 %3  -&amp;gt;  4th [2]  -&amp;gt;  11&#xA;9 %3  -&amp;gt;  2nd [0]  -&amp;gt;  3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt; &lt;code&gt;2 0 5 8 1 11 3&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;p&gt;The most fun part! How do you like the test cases?&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2: 1 3 0 2 5 4 &#xA;   1 3 0 2 5 4 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;2: 1 1 0 0 1 0&#xA;   1 3 0 2 5 4 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;5: 1 1 0 0 1 0&#xA;   1 6 0 5 11 10 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;1: 9 8 7 6 5 4 3 2 1 0&#xA;   0 1 2 3 4 5 6 7 8 9 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;100: 101 102 103 104 105&#xA;     1 2 3 4 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;10: 3 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3&#xA;    3 1 4 11 5 9 2 6 15 13 25 8 19 7 29 23 12 33 18 14 16 22 26 24 43 53 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;7: 10 20 30 40 50 60 70 80 90 100&#xA;   3 6 2 5 1 4 0 10 13 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;8: 09 18 27 36 45 54 63 72 81 90&#xA;   1 2 3 4 5 6 7 0 9 10&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;12: 11 22 33 44 55 66 77 88 99 110 121 132&#xA;    11 10 9 8 7 6 5 4 3 2 1 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;11: 1 1 2 3 5 8 13 21 34 55 89 144&#xA;    1 12 2 3 5 8 13 10 23 0 34 45 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;4: 2 4 8 16 32 64 128 256 512 1024 2048&#xA;   2 0 4 8 12 16 20 24 28 32 36 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Other Cheats&lt;/h2&gt;&#xA;&lt;p&gt;In the interest of making this as flexible as possible for all the &lt;s&gt;masochistic and impossible&lt;/s&gt; fun languages, here are other things you may skimp on:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may assume list &lt;code&gt;L&lt;/code&gt;  will only contain single digit numbers.&lt;/li&gt;&#xA;&lt;li&gt;You may assume mod &lt;code&gt;m&lt;/code&gt; will be a single digit number.&lt;/li&gt;&#xA;&lt;li&gt;You may do anything when &lt;code&gt;m = 0&lt;/code&gt;, including throwing an error.&lt;/li&gt;&#xA;&lt;li&gt;You may assume no leading 0s in the numbers.&lt;/li&gt;&#xA;&lt;li&gt;It is less consistent with the pattern, but you may eliminate 0s from your output by starting the count for [0], and only the [0] class, at &lt;code&gt;m&lt;/code&gt; instead. Then, in the example program, &lt;code&gt;1st [0] → 3&lt;/code&gt; and &lt;code&gt;2nd [0] → 6&lt;/code&gt;. It would output &lt;code&gt;2 *3* 5 8 1 11 *6*&lt;/code&gt; instead of &lt;code&gt;2 *0* 5 8 1 11 *3*&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Feel free to comment any other ideas and I will add them in if they don’t detract from the spirit of the challenge, and primarily serve to give the turing tarpits a hand. If the cheat would be used by mainstream and golfing langs, it’s probably not a good idea.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Please mention what cheats you’re taking advantage of, if any!&lt;/p&gt;&#xA;" OwnerUserId="87594" LastActivityDate="2021-06-29T07:48:39.713" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23647" PostTypeId="2" ParentId="2140" CreationDate="2021-06-30T13:59:20.750" Score="0" Body="&lt;h1&gt;Find out what type of adjective it is&lt;/h1&gt;&#xA;&lt;p&gt;There are 3 types of adjectives: absolute, comparative, and superlative adjectives. Your program should print what type of adjective it is. The program is supposed to work on  finite lost of words.&lt;/p&gt;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input will be a string, (not always 1 word), it'll be an adjective (the number of words will be finite)&lt;/li&gt;&#xA;&lt;li&gt;Output must be anything that represents absolute, comparative and superlative.&lt;/li&gt;&#xA;&lt;li&gt;The 15 adjectives below should be used as test cases and your program should be at least 90% accurate.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code wins!&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;pushiest =&amp;gt; superlative&#xA;homeliest =&amp;gt; superlative&#xA;most miserly =&amp;gt; superlative&#xA;outgoing =&amp;gt; absolute&#xA;most feline =&amp;gt; superlative&#xA;roasted =&amp;gt; absolute&#xA;frightening =&amp;gt; absolute&#xA;fairer =&amp;gt; comparative&#xA;more uncomfortable =&amp;gt; comparative&#xA;more classic =&amp;gt; comparative&#xA;smarter =&amp;gt; comparative&#xA;muffled =&amp;gt; absolute&#xA;scratchier =&amp;gt; comparative&#xA;meager =&amp;gt; absolute&#xA;tartest =&amp;gt; superlative&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="96037" LastEditorUserId="96037" LastEditDate="2022-01-07T13:09:53.950" LastActivityDate="2022-01-07T13:09:53.950" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="23648" PostTypeId="1" CreationDate="2021-07-01T01:43:31.257" Score="10" ViewCount="654" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19271/78850&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout July 2021, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;http://arm.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;ARM&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;What's a Language of the Month?&lt;/h2&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/78850&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during July, those who wish to participate should learn (at least the basics of) ARM, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about ARM&lt;/h2&gt;&#xA;&lt;p&gt;ARM is probably the most successful architecture for the digital world. From mobile phones to supercomputers, ARM is everywhere!&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;As of 2013 more than 10 billion ARMs were shipped, as compared to 0.3 billion 80x86s.&#xA;-- &lt;a href=&quot;https://www2.eecs.berkeley.edu/Pubs/TechRpts/2014/EECS-2014-146.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;ISSBF&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;ARM has a much better design than e.g. x86. It involves a lot less concepts, making it more beginner-friendly.&lt;/li&gt;&#xA;&lt;li&gt;ARM has a very low learning curve. Due to its RISC nature, ARM has less than 100 highly generalized assembler directives that perform tasks in a &lt;em&gt;very&lt;/em&gt; compact way.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;To some extent, it makes ARM easier to learn than its competitors.&lt;/li&gt;&#xA;&lt;li&gt;The RISC architecture also makes programs faster to execute, since it takes less time on decoding the instruction opcodes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The ARM instruction set is very compact.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Most instructions allow for conditional execution. This saves instruction cycles since no conditional jumps are necessary around conditional blocks.&lt;/li&gt;&#xA;&lt;li&gt;ARM also has the barrel shifter (which means that you can perform bitshifts to some value before using it).&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is a comparison copied verbatim from the &lt;a href=&quot;http://www.sizecoding.org/wiki/RISC_OS_on_ARM_based_CPUs&quot; rel=&quot;nofollow noreferrer&quot;&gt;SizeCoding wiki&lt;/a&gt;:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The following shows an example:&lt;/p&gt;&#xA;&lt;p&gt;ARM (8 Bytes)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;cmp   r0,r1&#xA;addhi r0,r2,r3,lsr#4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;x86 (11 Bytes)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;cmp eax,ebx&#xA;jna skip &#xA;mov eax,edx&#xA;shr eax,4&#xA;add eax,ecx&#xA;skip:&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Bounty&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/68942/hyper-neutrino&quot;&gt;hyper-neutrino&lt;/a&gt; will be providing a 50-reputation bounty for any user's first answer in ARM during this month. Tips and ARM-related challenges (that are actually connected to ARM's core mechanisms and don't just mention them or implement some one feature) may be rewarded a bounty at hyper-neutrino's discretion.&lt;/p&gt;&#xA;&lt;h2&gt;Links&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://arm.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;ARM official website&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://azeria-labs.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;A tutorial website&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/Wunkolo/OakSim&quot; rel=&quot;nofollow noreferrer&quot;&gt;Online simulator&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Calling_convention#ARM_(A32)&quot; rel=&quot;nofollow noreferrer&quot;&gt;ARM calling convention&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://syscalls.w3challs.com/?arch=arm_strong&quot; rel=&quot;nofollow noreferrer&quot;&gt;Syscall reference&lt;/a&gt; (subtract &lt;code&gt;0x900000&lt;/code&gt; from &lt;code&gt;r7&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://edu.heibai.org/ARM%E8%B5%84%E6%96%99/ARM7-TDMI-manual-pt3.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;Thumb instruction set reference&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/231076/78410&quot;&gt;Hello, world! in Thumb&lt;/a&gt; (includes a full program answer example and running instructions)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/231078/78410&quot;&gt;Sum square difference in Thumb&lt;/a&gt; (includes how to write a function and test cases for it)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78410" LastEditDate="2021-07-07T06:39:31.573" LastActivityDate="2021-07-31T19:36:42.900" Title="Language of the Month for July 2021: ARM" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23649" PostTypeId="2" ParentId="23648" CreationDate="2021-07-01T01:43:31.257" Score="5" Body="&lt;h1&gt;List of all ARM solutions posted in July 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/231076/78410&quot;&gt;Hello, World!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/231078/78410&quot;&gt;Sum square difference&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/231112/78410&quot;&gt;Inverse deltas of an array&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/232936/104752&quot;&gt;Recursive Z-matrix&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104752/m90&quot;&gt;m90&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/232991/104752&quot;&gt;How many Sets are there?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104752/m90&quot;&gt;m90&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/232994/104752&quot;&gt;Potential nonzero entries in an irregular sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104752/m90&quot;&gt;m90&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;List of all ARM tips posted in July 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/230922/16766&quot;&gt;Use &lt;code&gt;s&lt;/code&gt; instructions to your advantage&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/94093/easyaspi&quot;&gt;EasyasPi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/230923/16766&quot;&gt;Thumb: Make sure your literal pools are aligned&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/94093/easyaspi&quot;&gt;EasyasPi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/230924/16766&quot;&gt;ARM/Thumb: Use block loads/stores&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/94093/easyaspi&quot;&gt;EasyasPi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;tip title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;List of ARM-related challenges posted in July 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/q/&amp;lt;question-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="104752" LastEditDate="2021-07-31T19:36:42.900" LastActivityDate="2021-07-31T19:36:42.900" CommentCount="0" CommunityOwnedDate="2021-07-01T01:43:31.257" ContentLicense="CC BY-SA 4.0" />
  <row Id="23650" PostTypeId="2" ParentId="2140" CreationDate="2021-07-01T10:39:37.223" Score="1" Body="&lt;p&gt;Alteration of a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/230776/calculate-the-iso-week-of-gregorian-easter&quot;&gt;challenge&lt;/a&gt; that was considered too close to an &lt;a href=&quot;https://codegolf.stackexchange.com/q/11132/42932&quot;&gt;older quasi-duplicate&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;ISO Computus&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;algorithm&lt;/a&gt;? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to calculate&lt;br /&gt;&#xA;from a signed integer year number provided as sole input&lt;br /&gt;&#xA;the integer number of the &lt;strong&gt;calendar week of Easter Sunday&lt;/strong&gt; as sole output&lt;br /&gt;&#xA;with as few variables and as few arithmetic operations as possible.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Easter Sunday&lt;/strong&gt; is determined according to the &lt;a href=&quot;http://en.wikipedia.org/wiki/Date_of_Easter#Algorithms&quot; rel=&quot;nofollow noreferrer&quot;&gt;Gregorian Computus&lt;/a&gt; (as used in the all Western Christian churches, including the Catholic Church, and some others), for which there are several equivalent algorithms available, see &lt;a href=&quot;http://en.wikipedia.org/wiki/Date_of_Easter#Algorithms&quot; rel=&quot;nofollow noreferrer&quot;&gt;Computus&lt;/a&gt;, &lt;a href=&quot;https://webspace.science.uu.nl/%7Egent0113/easter/eastercalculator.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Gent&lt;/a&gt;, &lt;a href=&quot;http://ss64.net/merlyn/estrdate.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Stockton&lt;/a&gt; and &lt;a href=&quot;http://ss64.net/merlyn/estralgs.txt&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;collection of algorithms&quot;&gt;ESTRALGS.TXT&lt;/a&gt;.&#xA;There are 35 possible month-day dates, from 22 March to 25 April.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;strong&gt;week of the year&lt;/strong&gt; is specified by &lt;a href=&quot;https://en.wikipedia.org/wiki/ISO_week_date&quot; rel=&quot;nofollow noreferrer&quot;&gt;international standard ISO 8601-1&lt;/a&gt;: All weeks start on Monday; there are no partial weeks; the first week of the year has 4 January (or the first Thursday) in it. For more information see the &lt;a href=&quot;https://webspace.science.uu.nl/%7Egent0113/calendar/isocalendar.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Mathematics of the ISO 8601 Calendar&lt;/a&gt;.&#xA;There are just six possible results, weeks 12 through 17. W17 will hardly ever occur – it has never occurred since 1583 at least.&lt;/p&gt;&#xA;&lt;h2&gt;Restrictions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You &lt;em&gt;may&lt;/em&gt; use all basic arithmetic operators, including addition, substraction, multiplication, division, integer division, modulo, rounding (with integer flooring and ceiling), exponentiation, logarithms.&lt;/li&gt;&#xA;&lt;li&gt;You &lt;em&gt;may not&lt;/em&gt; use library functions that implement an algorithm for the Computus, like PHP's &lt;code&gt;easter_date()&lt;/code&gt;, &lt;code&gt;EasterSunday[year]&lt;/code&gt; from the Mathematica Calendar package or &lt;code&gt;Easter&lt;/code&gt; from the R package &lt;code&gt;timeDate&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You &lt;em&gt;may not&lt;/em&gt; use other predefined date functions, e.g. to find the day of the week or the week of the year.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Ranking score&lt;/h2&gt;&#xA;&lt;p&gt;Your solution must be an algorithm implemented as an executable script in a programming language of your choice.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each numeric variable and constant, whether used by name or literal value, counts as 1 point.&lt;/li&gt;&#xA;&lt;li&gt;Each basic operation, as defined above, counts as 1 point.&lt;/li&gt;&#xA;&lt;li&gt;Each definition of a custom function or method counts as 5 points.&lt;/li&gt;&#xA;&lt;li&gt;Each call of a custom function or method counts as 1 point.&lt;/li&gt;&#xA;&lt;li&gt;Imports and similar initializations required by the programming language are ignored.&lt;/li&gt;&#xA;&lt;li&gt;Neither reading the input value and returning or printing the output value nor eventual variables for storing their value are counted.&lt;/li&gt;&#xA;&lt;li&gt;The answer with the fewest points wins.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;TBD…&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;function CFAQEaster(year) { // Calendar FAQ&#xA;                       // 5 points for Div() function&#xA;  var G, C, H, I, J, L // 6 points for variables&#xA;  G = year % 19        // 2: 1 point for modulo, 1 point for 19&#xA;  C = Div(year,100)    // 2: 1 point for function call, 1 point for 100&#xA;  H = (C - Div(C,4) - Div(8*C+13,25) + 19*G + 15) % 30 &#xA;    // 16: 8 points for operations, 2 points for function calls, 6 points for additional numeric values&#xA;  I = H - Div(H,28)*(1 - Div(29,H+1)*Div(21-G,11)) &#xA;    // 13: 5 points for operations, 3 points for function calls, 5 points for additional numeric values&#xA;  J = (year + Div(year,4) + I + 2 - C + Div(C,4)) % 7&#xA;    // 6 points for operations, 2 points for function calls, 2 points for additional numeric values&#xA;  L = I - J            // 1 point for substraction&#xA;  EasterMonth = 3 + Div(L+40,44) &#xA;    // 6: 2 points for addition, 1 point for function call, 3 points for additional numeric values&#xA;  EasterDay = L + 28 - 31*Div(EasterMonth,4)&#xA;    // 6: 3 points for operations, 1 point for function call, 2 points for additional numeric values&#xA;  return {Y:year, M:EasterMonth, D:EasterDay} &#xA;    // 63 points in total&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Contemporary example &lt;em&gt;input: output&lt;/em&gt;&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;2001: 15&lt;/li&gt;&#xA;&lt;li&gt;2002: 13&lt;/li&gt;&#xA;&lt;li&gt;2003: 16&lt;/li&gt;&#xA;&lt;li&gt;2004: 15&lt;/li&gt;&#xA;&lt;li&gt;2005: 12&lt;/li&gt;&#xA;&lt;li&gt;2006: 15&lt;/li&gt;&#xA;&lt;li&gt;2007: 14&lt;/li&gt;&#xA;&lt;li&gt;2008: 12&lt;/li&gt;&#xA;&lt;li&gt;2009: 15&lt;/li&gt;&#xA;&lt;li&gt;2010: 13&lt;/li&gt;&#xA;&lt;li&gt;2011: 16&lt;/li&gt;&#xA;&lt;li&gt;2012: 14&lt;/li&gt;&#xA;&lt;li&gt;2013: 13&lt;/li&gt;&#xA;&lt;li&gt;2014: 16&lt;/li&gt;&#xA;&lt;li&gt;2015: 14&lt;/li&gt;&#xA;&lt;li&gt;2016: 12&lt;/li&gt;&#xA;&lt;li&gt;2017: 15&lt;/li&gt;&#xA;&lt;li&gt;2018: 13&lt;/li&gt;&#xA;&lt;li&gt;2019: 16&lt;/li&gt;&#xA;&lt;li&gt;2020: 15&lt;/li&gt;&#xA;&lt;li&gt;2021: 13&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The return value &lt;em&gt;must&lt;/em&gt; be correct for a complete cycle of input years, i.e. from 1 through 5700000, even though the original event that is celebrated did not occur before 30 (if ever at all) and the Gregorian Calendar was not used before late 1582, i.e. the &lt;em&gt;proleptic&lt;/em&gt; Gregorian Calendar applies.&lt;/p&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Date_of_Easter#Algorithms&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia: Computus&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/ISO_week_date&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia: ISO 8601 weeks&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://webspace.science.uu.nl/%7Egent0113/easter/eastercalculator.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;R.H. van Gent: Easter calculation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://webspace.science.uu.nl/%7Egent0113/calendar/isocalendar.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;R.H. van Gent: ISO 8601 math&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://ss64.net/merlyn/estrdate.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;J.R. Stockton: The date of Easter Sunday&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://ss64.net/merlyn/estralgs.txt&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;collection of algorithms&quot;&gt;J.R. Stockton: &lt;code&gt;estralgs.txt&lt;/code&gt;&lt;/a&gt; – collection of algorithms&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="42932" LastEditorUserId="42932" LastEditDate="2021-07-01T12:29:25.843" LastActivityDate="2021-07-01T12:29:25.843" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23652" PostTypeId="2" ParentId="18632" CreationDate="2021-07-02T14:40:39.280" Score="1" Body="&lt;h1&gt;Imported_duplicate&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;class {&#xA;  constructor(controller, utils) {&#xA;    this.controller = controller;&#xA;    this.side = controller.side;&#xA;    this.utils = utils;&#xA;  }&#xA;&#xA;  turn() {&#xA;    var target = this.controller.previous_move().to;&#xA;    var troll = this.controller.space_info(target.x, target.y).nearest_troll.pieces[0];&#xA;    this.controller.select_space(troll.x, troll.y);&#xA;    var space_info = this.controller.check_space(troll.x, troll.y);&#xA;    var closest_move = this.utils.closest_to(space_info.moves, target);&#xA;    this.controller.move(closest_move.x, closest_move.y);&#xA;  }&#xA;&#xA;  end_turn() {&#xA;    var scores = this.controller.scores();&#xA;    this.controller.declare(scores.winning == 't');&#xA;  }&#xA;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Posting at AJ's request.&lt;/p&gt;&#xA;" OwnerUserId="58974" LastActivityDate="2021-07-02T14:40:39.280" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23653" PostTypeId="2" ParentId="23642" CreationDate="2021-07-02T14:41:50.253" Score="1" Body="&lt;h1&gt;baby_steps_duplicate&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;class {&#xA;  constructor(controller, utils) {&#xA;    this.controller = controller;&#xA;    this.side = controller.side;&#xA;    this.utils = utils;&#xA;    this.it_is_a_day = false;&#xA;  }&#xA;&#xA;  turn() {&#xA;    var dwarf = this.controller.dwarfs()[0];&#xA;    if(dwarf) {&#xA;      var moves = this.controller.check_space(dwarf.x, dwarf.y).safe_moves;&#xA;      if(moves[0]) {&#xA;        this.controller.select_space(dwarf.x, dwarf.y);&#xA;        this.controller.move(moves[0].x, moves[0].y);&#xA;      } else {&#xA;        this.call_it_a_day();&#xA;      }&#xA;    } else {&#xA;      this.call_it_a_day();&#xA;    }&#xA;  }&#xA;&#xA;  call_it_a_day() {&#xA;    this.it_is_a_day = true;&#xA;    this.controller.declare(true);&#xA;&#xA;    var dwarf = this.controller.dwarfs()[0];&#xA;    var space_info = this.controller.check_space(dwarf.x, dwarf.y);&#xA;    this.controller.select_space(dwarf.x, dwarf.y);&#xA;    this.controller.move(space_info.moves[0].x, space_info.moves[0].y);&#xA;  }&#xA;&#xA;  end_turn() {&#xA;    var scores = this.controller.scores();&#xA;    this.controller.declare(this.it_is_a_day || scores.winning == 'd');&#xA;  }&#xA;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Posting at AJ's request.&lt;/p&gt;&#xA;" OwnerUserId="58974" LastActivityDate="2021-07-02T14:41:50.253" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23654" PostTypeId="2" ParentId="2140" CreationDate="2021-07-02T20:33:59.967" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/231060/packing-cuboid-boxes-into-the-shortest-stretchy-truck&quot;&gt;Packing Boxes into a Truck&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="100664" LastEditDate="2021-07-08T07:04:28.860" LastActivityDate="2021-07-08T07:04:28.860" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23656" PostTypeId="2" ParentId="2140" CreationDate="2021-07-04T07:37:32.410" Score="2" Body="&lt;h1&gt;Generate off-by-one regex for a string&lt;/h1&gt;&#xA;&lt;p&gt;Given an alphanumeric string as input, generate JS-flavored regex in order to match any off-by-one errors for that string. In stricter terms, your resulting regex must match any single deletions, single replacements, or single additions like in the below examples.&lt;/p&gt;&#xA;&lt;h4&gt;Examples:&lt;/h4&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;hi&amp;quot; -&amp;gt; &amp;quot;(h|i|.i|h.|.hi|h.i|hi.)&amp;quot;&#xA;&amp;quot;golf&amp;quot; -&amp;gt; &amp;quot;(olf|glf|gof|gol|.olf|g.lf|go.f|gol.|.golf|g.olf|go.lf|gol.f|golf.)&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##rZHBCsIwDIbP61OEnFqmg@FtsCcZOwjLZqRmo6ug4LvXtlM8eRA8heb7kw/S5e5PsxxCGGgET6vXq2lU4WiiG7SAGlUxzg4YWMAdZSJtSWIopQpPlyWmLOe52BjIQmp23H8wYnWeWXR6ptC2vGxzEkrAx2@SlyBtrvAfmgjr76qKZSXnNe@Sz/wofF8y167Z130iJhN/dbIBpRbH4nX@AZxmO6IxITwB&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here&lt;/a&gt; is a program for generating the results.&lt;/p&gt;&#xA;&lt;p&gt;Note: The order of the regex does not need to matter (ie, &amp;quot;hi&amp;quot; could be &amp;quot;(h|h.|hi.| . . .&amp;quot;)) so long as all patterns are in the regex.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest program in bytes wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-generation&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-generation&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="99035" LastEditorUserId="99035" LastEditDate="2021-07-05T09:21:39.017" LastActivityDate="2021-07-05T09:21:39.017" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="23657" PostTypeId="2" ParentId="2140" CreationDate="2021-07-04T07:44:05.533" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/231148/r-flag-my-vyxal&quot;&gt;&lt;code&gt;r&lt;/code&gt; my Vyxal&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2021-07-09T11:22:48.080" LastActivityDate="2021-07-09T11:22:48.080" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="23659" PostTypeId="2" ParentId="2140" CreationDate="2021-07-04T13:09:21.097" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/230976/project-euler-1-multiples-in-constant-time&quot;&gt;Project Euler 001 in constant time&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="33193" LastEditorUserId="33193" LastEditDate="2021-07-04T23:57:39.483" LastActivityDate="2021-07-04T23:57:39.483" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23661" PostTypeId="2" ParentId="22273" CreationDate="2021-07-04T19:28:55.950" Score="0" Body="&lt;h1&gt;The tag has now been created&lt;/h1&gt;&#xA;&lt;p&gt;as a result of &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/conversation/tagasymmetric&quot;&gt;a discussion in The Nineteenth Byte&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;As caird coinherringaahing points out, we can always delete it if we feel it's no longer relevant.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2021-07-04T19:28:55.950" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23662" PostTypeId="2" ParentId="22273" CreationDate="2021-07-04T21:16:39.233" Score="5" Body="&lt;h2&gt;Create the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/asymmetric&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;asymmetric&amp;#39;&quot; rel=&quot;tag&quot;&gt;asymmetric&lt;/a&gt; tag&lt;/h2&gt;&#xA;&lt;p&gt;Currently, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; is used to serve this role, which is an imperfect fit. Robbers typically just aim to crack specific cop answers in standard CnR challenges - they can, to all intents and purposes, ignore other Robbers (and cops can ignore other cops)&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/asymmetric&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;asymmetric&amp;#39;&quot; rel=&quot;tag&quot;&gt;asymmetric&lt;/a&gt; would cover challenges where:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;there are two or more groups of answers (for example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/230965/play-thud-dwarf-edition&quot;&gt;dwarves&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/230966/play-thud-troll-edition&quot;&gt;trolls&lt;/a&gt;) which are interacting with each other, and&lt;/li&gt;&#xA;&lt;li&gt;within each group of answers, there is interaction between the answers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This second point is the key distinguisher between &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/asymmetric&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;asymmetric&amp;#39;&quot; rel=&quot;tag&quot;&gt;asymmetric&lt;/a&gt; - if the answers in each group don't interact with each other, it's not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/asymmetric&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;asymmetric&amp;#39;&quot; rel=&quot;tag&quot;&gt;asymmetric&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Note: I feel like the name &amp;quot;asymmetric&amp;quot; doesn't appropriately present this key point. It works, but I feel like it could be a better name. Feel free to make suggestions&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-07-04T21:16:39.233" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23663" PostTypeId="2" ParentId="23537" CreationDate="2021-07-05T04:22:00.367" Score="9" Body="&lt;p&gt;&lt;a href=&quot;https://github.com/Vyxal/Vyxal&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Q9l1o.png&quot; alt=&quot;Join the Vyxal community and start winning code golf challenges!&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2021-07-28T05:34:57.163" LastActivityDate="2021-07-28T05:34:57.163" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="23665" PostTypeId="2" ParentId="2140" CreationDate="2021-07-07T00:11:41.877" Score="0" Body="&lt;h1&gt;Will the hydra finally die? Part II&lt;/h1&gt;&#xA;&lt;h3&gt;Background&lt;/h3&gt;&#xA;&lt;p&gt;This is a follow up question to the question: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/230778/will-the-hydra-finally-die/230992#230992&quot;&gt;Will the Hydra finally die?&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;As before a dangerous A Medusa have released a dangerous Hydra which is revived unless the exact number of heads it have is removed. The knights can remove a certain number of heads with each type of attack, and each attack causes a specific amount of heads to regrow. This time the knights are more impatient and having seen your previous abilities want you to** write a program or function that &lt;strong&gt;returns a list of hits which will leave the hydra 1 hit from death&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;Note that this is fundamentally different from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/137980/become-the-hydra-slayer&quot;&gt;Become the Hydra Slayer&lt;/a&gt;. in 2 aspects. 1: We are not asking for the optimal solution 2: each attack causes a &lt;em&gt;different&lt;/em&gt; number of heads to grow back. this radically changes the approach needed.&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;For example:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;input: heads = 2, &#xA;       attacks = [1, 25, 62, 67], &#xA;       growths = [15, 15, 34, 25], &#xA;&#xA;output: [5, 1, 0, 0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Explanation:&lt;/em&gt; The Hydra has 10 heads to start with, we have 4 different &lt;code&gt;attacks&lt;/code&gt; and for each attack, &lt;code&gt;growth&lt;/code&gt; gives us the number of heads that grows back. &lt;code&gt;hits&lt;/code&gt; gives us the number of times each attack is applied. So the number of heads the Hydra has after each attack is&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2 -&amp;gt; 16 -&amp;gt; 30 -&amp;gt; 44 -&amp;gt; 58 -&amp;gt; 72 -&amp;gt; 62&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Since &lt;code&gt;62&lt;/code&gt; is a valid attack value (It lies in the attack list), we return &lt;code&gt;True&lt;/code&gt; since the Hydra will die on the next attack (be left with 0 heads). Note that the order for when the attacks are done is irrelevant.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2 -&amp;gt; 16 -&amp;gt; 6 -&amp;gt; 20 -&amp;gt; 34 -&amp;gt; 48 -&amp;gt; 62&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;Input should contain &lt;code&gt;heads&lt;/code&gt; (an integer), &lt;code&gt;attacks&lt;/code&gt; (a list of how many heads can be removed), &lt;code&gt;regrowths&lt;/code&gt; (how many heads grow back per attack)&lt;/p&gt;&#xA;&lt;p&gt;You may take input in any &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt; convenient method&lt;/a&gt;. This includes, but is not limited to&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A list of tuples &lt;code&gt;(1, 15, 5), (25, 15, 1), (62, 34, 0), (67, 25, 0)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Lists &lt;code&gt;2, [1, 25, 62, 67], [15, 15, 34, 25], [5, 1, 0, 0]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Reading values from STDIN &lt;code&gt;1 15 1 15 1 15 1 15 1 15 25 15&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;A file of values&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An array, or some way to easily indicate which hits the knights are to take. Example: &lt;code&gt;5 1 0 0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note 1&lt;/strong&gt; Say that your input is &lt;code&gt;attacks = [1, 25, 62, 67]&lt;/code&gt; and the hydra has 25 heads left, then you &lt;strong&gt;cannot&lt;/strong&gt; output the answer as &lt;code&gt;[1,0,0,0]&lt;/code&gt;, &lt;code&gt;[0,0,0,1]&lt;/code&gt; etc. &lt;strong&gt;Your output and input must be sorted similarly&lt;/strong&gt;. Otherwise it will be very confusing for the Knights.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note 2:&lt;/strong&gt; Your program can &lt;em&gt;never&lt;/em&gt; leave the Hydra with a negative number of heads. Meaning if the Hydra has 15 heads, an attack removes 17 heads and regrows 38. You may not perform this attack.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; you will be scored as follows:&#xA;the total sum of hits your code produces from the test data + length of answer in bytes&lt;/li&gt;&#xA;&lt;li&gt;Note that how you input and parse the test data is not part of your code length. Your code should, as stated above simply take in some a headcount, attacks, regrowth's and return a list/representation of how many hits each attack has to be performed to leave the hydra &lt;em&gt;exactly&lt;/em&gt; 1 hit from death.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Lowest score wins!&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Test data&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;       attacks = [1, 25, 62, 67], &#xA;       growths = [15, 15, 34, 25],&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;use every integer from &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;200&lt;/code&gt; as the number of heads.&lt;/strong&gt; An sample from the first 100 can be found below. Again your program does not have to return these values, it is merely an example of how the scoring would work. As seen below the total sum for each of these hits are &lt;code&gt;535&lt;/code&gt; meaning my score would be &lt;code&gt;535+length of code in bytes&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;   1 [0, 0, 0, 0]&#xA;   2 [5, 1, 0, 0]&#xA;   3 [3, 2, 0, 0]&#xA;   4 [7, 4, 0, 0]&#xA;   5 [5, 5, 0, 0]&#xA;   6 [4, 0, 0, 0]&#xA;   7 [2, 1, 0, 0]&#xA;   8 [6, 3, 0, 0]&#xA;   9 [4, 4, 0, 0]&#xA;  10 [8, 6, 0, 0]&#xA;  11 [1, 0, 0, 0]&#xA;  12 [5, 2, 0, 0]&#xA;  13 [3, 3, 0, 0]&#xA;  14 [7, 5, 0, 0]&#xA;  15 [5, 6, 0, 0]&#xA;  16 [4, 1, 0, 0]&#xA;  17 [2, 2, 0, 0]&#xA;  18 [6, 4, 0, 0]&#xA;  19 [4, 5, 0, 0]&#xA;  20 [3, 0, 0, 0]&#xA;  21 [1, 1, 0, 0]&#xA;  22 [5, 3, 0, 0]&#xA;  23 [3, 4, 0, 0]&#xA;  24 [7, 6, 0, 0]&#xA;  25 [0, 0, 0, 0]&#xA;  26 [4, 2, 0, 0]&#xA;  27 [2, 3, 0, 0]&#xA;  28 [6, 5, 0, 0]&#xA;  29 [4, 6, 0, 0]&#xA;  30 [3, 1, 0, 0]&#xA;  31 [1, 2, 0, 0]&#xA;  32 [5, 4, 0, 0]&#xA;  33 [3, 5, 0, 0]&#xA;  34 [2, 0, 0, 0]&#xA;  35 [0, 1, 0, 0]&#xA;  36 [4, 3, 0, 0]&#xA;  37 [2, 4, 0, 0]&#xA;  38 [6, 6, 0, 0]&#xA;  39 [2, 0, 0, 0]&#xA;  40 [3, 2, 0, 0]&#xA;  41 [1, 3, 0, 0]&#xA;  42 [5, 5, 0, 0]&#xA;  43 [3, 6, 0, 0]&#xA;  44 [2, 1, 0, 0]&#xA;  45 [0, 2, 0, 0]&#xA;  46 [4, 4, 0, 0]&#xA;  47 [2, 5, 0, 0]&#xA;  48 [1, 0, 0, 0]&#xA;  49 [2, 1, 0, 0]&#xA;  50 [3, 3, 0, 0]&#xA;  51 [1, 4, 0, 0]&#xA;  52 [5, 6, 0, 0]&#xA;  53 [1, 0, 0, 0]&#xA;  54 [2, 2, 0, 0]&#xA;  55 [0, 3, 0, 0]&#xA;  56 [4, 5, 0, 0]&#xA;  57 [2, 6, 0, 0]&#xA;  58 [1, 1, 0, 0]&#xA;  59 [2, 2, 0, 0]&#xA;  60 [3, 4, 0, 0]&#xA;  61 [1, 5, 0, 0]&#xA;  62 [0, 0, 0, 0]&#xA;  63 [1, 1, 0, 0]&#xA;  64 [2, 3, 0, 0]&#xA;  65 [0, 4, 0, 0]&#xA;  66 [4, 6, 0, 0]&#xA;  67 [0, 0, 0, 0]&#xA;  68 [1, 2, 0, 0]&#xA;  69 [2, 3, 0, 0]&#xA;  70 [3, 5, 0, 0]&#xA;  71 [1, 6, 0, 0]&#xA;  72 [0, 1, 0, 0]&#xA;  73 [1, 2, 0, 0]&#xA;  74 [2, 4, 0, 0]&#xA;  75 [0, 5, 0, 0]&#xA;  76 [1, 0, 1, 0]&#xA;  77 [0, 1, 0, 0]&#xA;  78 [1, 3, 0, 0]&#xA;  79 [2, 4, 0, 0]&#xA;  80 [3, 6, 0, 0]&#xA;  81 [1, 0, 1, 0]&#xA;  82 [0, 2, 0, 0]&#xA;  83 [1, 3, 0, 0]&#xA;  84 [2, 5, 0, 0]&#xA;  85 [0, 6, 0, 0]&#xA;  86 [1, 1, 1, 0]&#xA;  87 [0, 2, 0, 0]&#xA;  88 [1, 4, 0, 0]&#xA;  89 [2, 5, 0, 0]&#xA;  90 [0, 0, 1, 0]&#xA;  91 [1, 1, 1, 0]&#xA;  92 [0, 3, 0, 0]&#xA;  93 [1, 4, 0, 0]&#xA;  94 [2, 6, 0, 0]&#xA;  95 [0, 0, 1, 0]&#xA;  96 [1, 2, 1, 0]&#xA;  97 [0, 3, 0, 0]&#xA;  98 [1, 5, 0, 0]&#xA;  99 [2, 6, 0, 0]&#xA; 100 [0, 1, 1, 0]&#xA;535&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What would a good scoring method for this type of question be?&lt;/li&gt;&#xA;&lt;li&gt;My method outputs &lt;code&gt;2873&lt;/code&gt; for the total count from 1 to 200, is this too high, too low?&lt;/li&gt;&#xA;&lt;li&gt;Feel free to suggest other improvements to my testing data&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="33193" LastActivityDate="2021-07-07T00:11:41.877" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23666" PostTypeId="2" ParentId="2140" CreationDate="2021-07-07T12:34:34.197" Score="0" Body="&lt;h2&gt;Transdeletion&lt;/h2&gt;&#xA;&lt;p&gt;Transdeletion is the process of removing a letter from a word and forming another word by creating an anagram from the remaining letters.&lt;/p&gt;&#xA;&lt;p&gt;If you can do this repeatedly, all the way down to a single letter (&amp;quot;A&amp;quot; or &amp;quot;I&amp;quot;, usually, in English), you have formed a &amp;quot;&lt;a href=&quot;https://en.wikipedia.org/wiki/Transdeletion_pyramid&quot; rel=&quot;nofollow noreferrer&quot;&gt;Transdeletion Pyramid&lt;/a&gt;&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;The Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a word list (containing any number of words, up to the max your language can handle) and a starting word, find and output the Transdeletion pyramid.&lt;/p&gt;&#xA;&lt;p&gt;The word list will include the starting word, and is guaranteed to contain all of the words required to make the pyramid &lt;em&gt;(Sandbox: should it? Or is it a better challenge if it won't always be possible to succeed?)&lt;/em&gt;. A change of case for any letters of the word is allowed at any time - i.e. dealing with casing isn't part of the challenge. So you can assume all inputs are in lowercase, or uppercase, or whatever suits.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins, usual rules apply.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;In the form &lt;code&gt;[[wordList],&amp;quot;startWord&amp;quot;] -&amp;gt; [ordered output list]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[&amp;quot;a&amp;quot;, &amp;quot;an&amp;quot;, &amp;quot;ant&amp;quot;], &amp;quot;ant&amp;quot;] -&amp;gt; [&amp;quot;ant&amp;quot;,&amp;quot;an&amp;quot;,&amp;quot;a&amp;quot;]&#xA;[[&amp;quot;I&amp;quot;, &amp;quot;in&amp;quot;, &amp;quot;tin&amp;quot;, &amp;quot;sink&amp;quot;, &amp;quot;ink&amp;quot;], &amp;quot;sink&amp;quot;] -&amp;gt; [&amp;quot;sink&amp;quot;,&amp;quot;ink&amp;quot;,&amp;quot;in&amp;quot;, &amp;quot;I&amp;quot;]&#xA;[[&amp;quot;I&amp;quot;, &amp;quot;in&amp;quot;, &amp;quot;tin&amp;quot;, &amp;quot;sink&amp;quot;, &amp;quot;ink&amp;quot;], &amp;quot;in&amp;quot;] -&amp;gt; [&amp;quot;in&amp;quot;, &amp;quot;I&amp;quot;]&#xA;[[&amp;quot;a&amp;quot;, &amp;quot;I&amp;quot;, &amp;quot;tin&amp;quot;, &amp;quot;ant&amp;quot;, &amp;quot;sink&amp;quot;, &amp;quot;an&amp;quot; &amp;quot;ink&amp;quot;], &amp;quot;ant&amp;quot;] -&amp;gt; [&amp;quot;ant&amp;quot;,&amp;quot;an&amp;quot;,&amp;quot;a&amp;quot;]&#xA;[[&amp;quot;FAT&amp;quot;, &amp;quot;TALIERA&amp;quot;, &amp;quot;INTERLAMINATES&amp;quot;, &amp;quot;ULCER&amp;quot;, &amp;quot;ALTER&amp;quot;, &amp;quot;TALE&amp;quot;, &amp;quot;A&amp;quot;, &amp;quot;RATE&amp;quot;, &amp;quot;I&amp;quot;, &amp;quot;ANTICEREMONIALIST&amp;quot;, &amp;quot;MATERIAL&amp;quot;, &amp;quot;INCOMPETENT&amp;quot;, &amp;quot;TRILAMINATE&amp;quot;, &amp;quot;TEA&amp;quot;, &amp;quot;TEA&amp;quot;, &amp;quot;TRIFLE&amp;quot;, &amp;quot;NONMATERIALITIES&amp;quot;, &amp;quot;FRATERNISATION&amp;quot;, &amp;quot;AT&amp;quot;, &amp;quot;AT&amp;quot;, &amp;quot;ORNAMENTALITIES&amp;quot;, &amp;quot;RETAIL&amp;quot;, &amp;quot;TAIL&amp;quot;, &amp;quot;MATERNALITIES&amp;quot;, &amp;quot;TERMINALIA&amp;quot;, &amp;quot;LATIMERIA&amp;quot;, &amp;quot;FATIMA&amp;quot;, &amp;quot;OBSCURE&amp;quot;, &amp;quot;LENS&amp;quot;, &amp;quot;MATRILINEATE&amp;quot;],&amp;quot;ANTICEREMONIALIST&amp;quot;] -&amp;gt; [&amp;quot;ANTICEREMONIALIST&amp;quot;, &amp;quot;NONMATERIALITIES&amp;quot;, &amp;quot;ORNAMENTALITIES&amp;quot;, &amp;quot;INTERLAMINATES&amp;quot;, &amp;quot;MATERNALITIES&amp;quot;, &amp;quot;MATRILINEATE&amp;quot;, &amp;quot;TRILAMINATE&amp;quot;, &amp;quot;TERMINALIA&amp;quot;, &amp;quot;LATIMERIA&amp;quot;, &amp;quot;MATERIAL&amp;quot;, &amp;quot;TALIERA&amp;quot;, &amp;quot;RETAIL&amp;quot;, &amp;quot;ALTER&amp;quot;, &amp;quot;RATE&amp;quot;, &amp;quot;TEA&amp;quot;, &amp;quot;AT&amp;quot;, &amp;quot;A&amp;quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox Questions&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Should it be possible that the input contains no valid chains?&lt;/li&gt;&#xA;&lt;li&gt;Should the challenge instead be to find the longest chain, even if it doesn't go down to 1 letter?&lt;/li&gt;&#xA;&lt;li&gt;Should the starting word be provided or would it be a better challenge without it?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="62289" LastActivityDate="2021-07-07T12:34:34.197" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23668" PostTypeId="2" ParentId="2140" CreationDate="2021-07-08T06:57:17.093" Score="3" Body="&lt;h1 id=&quot;splinter-metagolf-nmk9&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/231266/splinter-metagolf&quot;&gt;Splinter metagolf&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2021-07-13T06:54:38.517" LastActivityDate="2021-07-13T06:54:38.517" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23669" PostTypeId="2" ParentId="2140" CreationDate="2021-07-08T06:58:44.307" Score="0" Body="&lt;h1&gt;Decide Magma's Identity&lt;/h1&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Given a &lt;a href=&quot;https://en.wikipedia.org/wiki/Magma_(algebra)&quot; rel=&quot;nofollow noreferrer&quot;&gt;magma&lt;/a&gt; with 256 elements, decide whether it has &lt;em&gt;the&lt;/em&gt; identity element.&lt;/p&gt;&#xA;&lt;h2&gt;Definition&lt;/h2&gt;&#xA;&lt;p&gt;A &lt;strong&gt;magma&lt;/strong&gt; is a set endowed with a binary operation. Let's denote the set by &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; and the binary operation by &lt;span class=&quot;math-container&quot;&gt;\$\circ\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;An element &lt;span class=&quot;math-container&quot;&gt;\$e \in S\$&lt;/span&gt; is &lt;em&gt;the&lt;/em&gt; &lt;strong&gt;identity element&lt;/strong&gt; if for every &lt;span class=&quot;math-container&quot;&gt;\$a \in S\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$e \circ a = a \circ e = a\$&lt;/span&gt; holds.&lt;/p&gt;&#xA;&lt;p&gt;If &lt;span class=&quot;math-container&quot;&gt;\$e\$&lt;/span&gt; exists, its existence is unique, for if &lt;span class=&quot;math-container&quot;&gt;\$f \in S\$&lt;/span&gt; also is an identity element, &lt;span class=&quot;math-container&quot;&gt;\$e = e \circ f = f\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Input Format&lt;/h2&gt;&#xA;&lt;p&gt;The binary operation &lt;span class=&quot;math-container&quot;&gt;\$\circ\$&lt;/span&gt; itself, as a black-box function, will be inputted.&lt;/p&gt;&#xA;&lt;p&gt;The type of &lt;span class=&quot;math-container&quot;&gt;\$\circ\$&lt;/span&gt; doesn't matter. Possible choices include (type names in C):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Accepting two &lt;code&gt;char&lt;/code&gt;s, returning one &lt;code&gt;char&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Accepting two &lt;code&gt;int8_t&lt;/code&gt;s, returning one &lt;code&gt;int8_t&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Accepting two &lt;code&gt;uint8_t&lt;/code&gt;s, returning one &lt;code&gt;uint8_t&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Accepting one &lt;code&gt;int16_t&lt;/code&gt; (to break bytewise), returning one &lt;code&gt;unsigned char&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Ungolfed Solution&lt;/h2&gt;&#xA;&lt;h3&gt;Haskell&lt;/h3&gt;&#xA;&lt;p&gt;This implementation is much generalized version of the challenge. It can test an arbitrary finite magma, and will explicitly find the identity element if it exists.&lt;/p&gt;&#xA;&lt;p&gt;It might seem to have time complexity of &lt;span class=&quot;math-container&quot;&gt;\$O(n^2)\$&lt;/span&gt;, but it's actually &lt;span class=&quot;math-container&quot;&gt;\$O(n)\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;import Control.Monad&#xA;import Data.Maybe&#xA;&#xA;findIdentity :: (Eq a, Enum a, Bounded a) =&amp;gt; (a -&amp;gt; a -&amp;gt; a) -&amp;gt; Maybe a&#xA;findIdentity op = listToMaybe $ do&#xA;    let elements = [minBound .. maxBound]&#xA;    e &amp;lt;- elements&#xA;    guard (all (\f -&amp;gt; op e f == f) elements)&#xA;    guard (all (\f -&amp;gt; op f e == f) elements)&#xA;    pure e&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="89459" LastActivityDate="2021-07-08T06:58:44.307" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23672" PostTypeId="2" ParentId="2140" CreationDate="2021-07-09T11:17:11.317" Score="7" Body="&lt;h1 id=&quot;it-almost-works-cr-ezqr&quot;&gt;It almost works (C&amp;amp;R)&lt;/h1&gt;&#xA;&lt;h2 id=&quot;cops-thread-uz49&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/231321&quot;&gt;Cops thread&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;h2 id=&quot;robbers-thread-7a1l&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/231322&quot;&gt;Robbers thread&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2021-07-13T23:32:04.997" LastActivityDate="2021-07-13T23:32:04.997" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23673" PostTypeId="2" ParentId="10849" CreationDate="2021-07-09T16:18:26.333" Score="1" Body="&lt;p&gt;&lt;a href=&quot;/questions/tagged/status-declined&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-declined&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-declined&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;While this would be nice to have on this site, it would require hardcoding and would not apply to other sites, and given that we are prioritizing changes that benefit the network or many sites rather than tailoring to specific ones, this has been declined.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-07-09T16:18:26.333" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23674" PostTypeId="2" ParentId="2140" CreationDate="2021-07-10T16:13:32.783" Score="1" Body="&lt;h1 id=&quot;solve-fermats-last-theorem-with-matrices-bxbb&quot;&gt;Solve Fermat's Last Theorem with matrices&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Fermat%27s_Last_Theorem&quot; rel=&quot;nofollow noreferrer&quot;&gt;Fermat's Last Theorem&lt;/a&gt; states that there is no such triple of positive integers &lt;span class=&quot;math-container&quot;&gt;\$(x, y, z)\$&lt;/span&gt; such that&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$x^n + y^n = z^n$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;for all integers &lt;span class=&quot;math-container&quot;&gt;\$n &amp;gt; 2\$&lt;/span&gt;. However, this conjecture does not hold for integer matrices:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$\begin{align}&#xA;  &amp;amp; \left( \begin{matrix}  1 &amp;amp; 3 \\ 0 &amp;amp;  1 \end{matrix} \right)^3 + &#xA;    \left( \begin{matrix} -1 &amp;amp; 0 \\ 1 &amp;amp; -1 \end{matrix} \right)^3 \\&#xA;= &amp;amp; \left( \begin{matrix}  1 &amp;amp; 9 \\ 0 &amp;amp;  1 \end{matrix} \right) + &#xA;    \left( \begin{matrix} -1 &amp;amp; 0 \\ 3 &amp;amp; -1 \end{matrix} \right) \\&#xA;= &amp;amp; \left( \begin{matrix}  0 &amp;amp; 9 \\ 3 &amp;amp;  0 \end{matrix} \right) \\&#xA;= &amp;amp; \left( \begin{matrix}  0 &amp;amp; 3 \\ 1 &amp;amp;  0 \end{matrix} \right)^3 \\&#xA;\end{align}$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;You are to take two &lt;span class=&quot;math-container&quot;&gt;\$k \times k\$&lt;/span&gt; integer matrices &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;, and a positive integer &lt;span class=&quot;math-container&quot;&gt;\$n \ge 2\$&lt;/span&gt;, and output a &lt;span class=&quot;math-container&quot;&gt;\$k \times k\$&lt;/span&gt; integer matrix &lt;span class=&quot;math-container&quot;&gt;\$C\$&lt;/span&gt; such that&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$A^n + B^n = C^n$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;You may output any such &lt;span class=&quot;math-container&quot;&gt;\$C\$&lt;/span&gt;. You may also take &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; as an input, and you may assume that &lt;span class=&quot;math-container&quot;&gt;\$k \ge 2\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-07-13T23:21:12.697" LastActivityDate="2021-07-13T23:21:12.697" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23675" PostTypeId="2" ParentId="2140" CreationDate="2021-07-11T03:42:58.633" Score="0" Body="&lt;h1&gt;Compile Esolang to Esolang&lt;/h1&gt;&#xA;&lt;p&gt;Based on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/5210/convert-fractran-into-brainfuck&quot;&gt;Convert FRACTRAN to Brainfuck&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Compile Brainfuck to FRACTRAN&lt;/li&gt;&#xA;&lt;li&gt;Compile /// to Brainfuck&lt;/li&gt;&#xA;&lt;li&gt;Compile Brainfuck to ///&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If you have other ideas, please add them. Be sure it's reasonably doable with simple tarpits, eg Jelly to Vyxal to APL isn't all that fun. If you &lt;em&gt;can&lt;/em&gt; make a variation of that fun, that should be posted separately.&lt;/p&gt;&#xA;&lt;p&gt;If you'd like me to make this into a CW to make it easier to contribute, please comment and let me know!&lt;/p&gt;&#xA;" OwnerUserId="87594" LastActivityDate="2021-07-11T03:42:58.633" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23677" PostTypeId="2" ParentId="23485" CreationDate="2021-07-12T19:02:42.497" Score="5" Body="&lt;p&gt;Yaakov kindly updated this to include the information you wished. It'd require a bigger change to make it possible to get rid of the bullet points but I'll discuss internally about whether that's something we want to request. I know this would be great for y'all but with the number of devs we have currently, it'd be a decision of whether this was higher priority than other things - so we can discuss internally but I'm not making any promises.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/rlMLE.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/rlMLE.png&quot; alt=&quot;Screenshot of the new asking a good question modal with the text as described in the question.&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="78028" LastActivityDate="2021-07-12T19:02:42.497" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23678" PostTypeId="1" AcceptedAnswerId="23679" CreationDate="2021-07-12T23:07:53.760" Score="4" ViewCount="74" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/average&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;average&amp;#39;&quot; rel=&quot;tag&quot;&gt;average&lt;/a&gt; is a tag applied to &lt;a href=&quot;https://codegolf.stackexchange.com/tags/average&quot;&gt;3 questions&lt;/a&gt;. It currently has no tag wiki, and the tag excerpt reads&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This challenge is related to average or arithmetic mean.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Currently, this is a very specific tag which is arguably covered by the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/statistics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;statistics&amp;#39;&quot; rel=&quot;tag&quot;&gt;statistics&lt;/a&gt; tag. However, nothing in the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/statistics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;statistics&amp;#39;&quot; rel=&quot;tag&quot;&gt;statistics&lt;/a&gt; very short &lt;a href=&quot;https://codegolf.stackexchange.com/tags/statistics/info&quot;&gt;tag wiki&lt;/a&gt; explicitly says that it covers averages, and it could be beneficial to have a separate tag for challenges around averages.&lt;/p&gt;&#xA;&lt;p&gt;&amp;quot;average&amp;quot; does have more than one mathematical meaning however - the &lt;a href=&quot;https://en.wikipedia.org/wiki/Median&quot; rel=&quot;nofollow noreferrer&quot;&gt;median&lt;/a&gt; and &lt;a href=&quot;https://en.wikipedia.org/wiki/Mode_(statistics)&quot; rel=&quot;nofollow noreferrer&quot;&gt;mode&lt;/a&gt; are both averages, and there are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/182460/calculate-the-mean-mean-of-two-numbers&quot;&gt;many different means&lt;/a&gt; than just the arithmetic mean. The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/average&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;average&amp;#39;&quot; rel=&quot;tag&quot;&gt;average&lt;/a&gt; tag could reasonably be expanded to include these as well.&lt;/p&gt;&#xA;&lt;p&gt;There are 259 questions that mention &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=average+-%5Baverage%5D+is%3Aq+closed%3Ano&quot;&gt;&amp;quot;average&amp;quot;&lt;/a&gt;, 23 that mention &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=%22arithmetic+mean%22+-%5Baverage%5D+is%3Aq+closed%3Ano&quot;&gt;&amp;quot;arithmetic mean&amp;quot;&lt;/a&gt; and 391 that mention &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=mean+-%5Baverage%5D+is%3Aq+closed%3Ano&quot;&gt;&amp;quot;mean&amp;quot;&lt;/a&gt;, none of which have the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/average&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;average&amp;#39;&quot; rel=&quot;tag&quot;&gt;average&lt;/a&gt; tag. If we decide to keep, or even expand, the tag, it could require some effort to properly find and then retag relevant questions&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=58598772#58598772&quot;&gt;brought this up in chat&lt;/a&gt; with no real conclusion. Currently, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/average&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;average&amp;#39;&quot; rel=&quot;tag&quot;&gt;average&lt;/a&gt; is a &lt;a href=&quot;https://codegolf.stackexchange.com/tags/statistics/synonyms&quot;&gt;suggested synonym&lt;/a&gt; of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/statistics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;statistics&amp;#39;&quot; rel=&quot;tag&quot;&gt;statistics&lt;/a&gt; &lt;span class=&quot;math-container&quot;&gt;\${}^\dagger\$&lt;/span&gt;. However, it is still being voted on, so 3 negative votes could reject this (I recommend that no one &amp;quot;jumps the gun&amp;quot; until a decision is made, tag synonyms are enough of a hassle without having to do them twice).&lt;/p&gt;&#xA;&lt;p&gt;Therefore, of the options below, what should we do with the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/average&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;average&amp;#39;&quot; rel=&quot;tag&quot;&gt;average&lt;/a&gt; tag?&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Synonymise it with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/statistics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;statistics&amp;#39;&quot; rel=&quot;tag&quot;&gt;statistics&lt;/a&gt;, and (optionally) remove it from the 3 questions it is currently on,&lt;/li&gt;&#xA;&lt;li&gt;Expand its scope, edit its tag wiki and begin applying it to more challenges,&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What should the expanded scope cover?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Do nothing and leave the tag as it is, or&lt;/li&gt;&#xA;&lt;li&gt;Do something else?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sup&gt;&lt;span class=&quot;math-container&quot;&gt;\$\dagger\$&lt;/span&gt; Mostly by mistake - I didn't think I had the required score in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/statistics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;statistics&amp;#39;&quot; rel=&quot;tag&quot;&gt;statistics&lt;/a&gt; to suggest it, and expected to be blocked from suggesting it&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-07-12T23:49:10.940" Title="What to do with the [average] tag?" Tags="|discussion|tags|tag-synonyms|tag-wikis|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23679" PostTypeId="2" ParentId="23678" CreationDate="2021-07-12T23:49:10.940" Score="10" Body="&lt;h1 id=&quot;synonymize-with-tagstatistics-ai5b&quot;&gt;Synonymize with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/statistics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;statistics&amp;#39;&quot; rel=&quot;tag&quot;&gt;statistics&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;According to Wikipedia, an &lt;a href=&quot;https://en.wikipedia.org/wiki/Average&quot; rel=&quot;nofollow noreferrer&quot;&gt;average&lt;/a&gt; is &amp;quot;a single number taken as representative of a non-empty list of numbers&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;Limiting the scope of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/average&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;average&amp;#39;&quot; rel=&quot;tag&quot;&gt;average&lt;/a&gt; to &amp;quot;arithmetic mean&amp;quot; would be way too narrow for a tag. Accepting the broader meaning would make it a branch of &lt;a href=&quot;https://en.wikipedia.org/wiki/Descriptive_statistics&quot; rel=&quot;nofollow noreferrer&quot;&gt;descriptive statistics&lt;/a&gt;, namely the &lt;a href=&quot;https://en.wikipedia.org/wiki/Central_tendency&quot; rel=&quot;nofollow noreferrer&quot;&gt;central tendency&lt;/a&gt; of univariate data. But even though many challenges involve calculating such a measure, I don't feel like it is used as a &lt;em&gt;core&lt;/em&gt; part of a challenge that often (so it is actually worth using &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/average&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;average&amp;#39;&quot; rel=&quot;tag&quot;&gt;average&lt;/a&gt; or even &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/statistics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;statistics&amp;#39;&quot; rel=&quot;tag&quot;&gt;statistics&lt;/a&gt;).&lt;/p&gt;&#xA;&lt;p&gt;I suggest to make &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/average&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;average&amp;#39;&quot; rel=&quot;tag&quot;&gt;average&lt;/a&gt; a synonym of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/statistics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;statistics&amp;#39;&quot; rel=&quot;tag&quot;&gt;statistics&lt;/a&gt;, and use &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/statistics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;statistics&amp;#39;&quot; rel=&quot;tag&quot;&gt;statistics&lt;/a&gt; for challenges whose &lt;em&gt;core&lt;/em&gt; is about calculating a kind of central tendency.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2021-07-12T23:49:10.940" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23682" PostTypeId="2" ParentId="20722" CreationDate="2021-07-15T00:06:11.817" Score="4" Body="&lt;p&gt;I was walking around one day, thinking about what my username should be. I wanted something pseudo-English sounding, but not really meaning anything. So Makonede randomly popped into my head for some reason.&lt;/p&gt;&#xA;&lt;p&gt;TL;DR: Literally no backstory.&lt;/p&gt;&#xA;&lt;p&gt;Also, in case you've been living under a rock, my profile picture is my Minecraft character.&lt;/p&gt;&#xA;" OwnerUserId="94066" LastActivityDate="2021-07-15T00:06:11.817" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23683" PostTypeId="2" ParentId="2140" CreationDate="2021-07-15T00:12:09.147" Score="-4" Body="&lt;p&gt;Your challenge is to write a small compiler/interpreter to a small language. This language can be of any level. Example: brainf*ck or Turing.&lt;/p&gt;&#xA;&lt;p&gt;Example submission:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;languageName : “name” &#xA;GitHub : “https/GitHub.com/Lang”&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;a language is valid if it contains the folowing systems:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1: varibles of any type&#xA;2: a method of declaring and using functions&#xA;3: definable parameters&#xA;4: a update loop&#xA;5: loops&#xA;6: classes(optinal)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;a compiler/interperater is valid if it can:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1: run/compile code&#xA;2: is fast (less than a minute to compile/initialize)&#xA;3: give error messages(optional)&#xA;4: written in java&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The smallest compiler/interpreter wins&lt;/p&gt;&#xA;&lt;p&gt;please tell me how i can fix this post if you intend on downvoting it in the comments&lt;/p&gt;&#xA;" OwnerUserId="105105" LastEditorUserId="105105" LastEditDate="2021-07-15T17:19:02.500" LastActivityDate="2021-07-15T17:19:02.500" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23684" PostTypeId="1" AcceptedAnswerId="24017" CreationDate="2021-07-15T22:27:28.593" Score="4" ViewCount="100" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/-1/community&quot;&gt;Community&lt;/a&gt; looks to be &lt;a href=&quot;https://meta.stackexchange.com/questions/367454/why-has-communitys-profile-picture-changed&quot;&gt;very buggy today&lt;/a&gt;. However, this appears to be specific to this site - I've been unable to repro this on other sites or their metas.&lt;/p&gt;&#xA;&lt;p&gt;It appears as though &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/-1/community?tab=answers&quot;&gt;Community has an answer&lt;/a&gt; on our meta: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5056/do-we-really-want-latex-mathjax-right-now/5057#5057&quot;&gt;Do we really want LaTeX/MathJax (right now)?&lt;/a&gt;. I've checked a few other metas on the network, and I can't find any other instance of Community posting answers, aside from some &lt;a href=&quot;https://movies.meta.stackexchange.com/a/936/48930&quot;&gt;automated stuff&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, Community appears to also go by the name &lt;a href=&quot;https://codegolf.meta.stackexchange.com/posts/5057/revisions&quot;&gt;anon&lt;/a&gt; in the revision history of this answer.&lt;/p&gt;&#xA;&lt;p&gt;This appears to be very weird behaviour by Community, as I'm unable to find any other examples in a brief search of other sites, and it doesn't appear to be any of the &lt;a href=&quot;https://meta.stackexchange.com/a/19739/355458&quot;&gt;listed behaviours&lt;/a&gt; for Community&lt;/p&gt;&#xA;&lt;p&gt;What's going on here?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="38734" LastEditDate="2021-11-08T12:25:00.747" LastActivityDate="2021-11-08T12:25:00.747" Title="Why does Community have an answer here?" Tags="|support|bug|status-bydesign|meta|users|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23685" PostTypeId="2" ParentId="2140" CreationDate="2021-07-15T23:07:17.323" Score="0" Body="&lt;h1 id=&quot;make-me-some-puzzles-7brf&quot;&gt;Make me some puzzles&lt;/h1&gt;&#xA;&lt;p&gt;So, a while ago on Puzzling, I posted &lt;a href=&quot;https://puzzling.stackexchange.com/questions/109687/please-check-my-math-homework&quot;&gt;this&lt;/a&gt;. It basically had a whole bunch of equations that were wrong, and when you figured out how much they were wrong by, and transformed 1-26 into A-z, it yielded the phrase ALLWRONG.&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to take a string of letters as input, and output a series of &lt;em&gt;wrong&lt;/em&gt;, randomly generated equations that are wrong by the correct amount to yield  said string.&lt;/p&gt;&#xA;&lt;p&gt;Equations must be of the form &lt;code&gt;number operation number = number&lt;/code&gt;, where each number is a positive integer less than 100, and the operators are &lt;code&gt;+-*/&lt;/code&gt;, although × and ÷ are acceptable instead of &lt;code&gt;*/&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I'm going to be quite lenient on the definition of 'random' in this one - all possible equations must have a nonzero chance of appearing for any given letter.&lt;/p&gt;&#xA;&lt;p&gt;Valid equations should have the result of the left hand side's difference from the right hand side being the correct number to, when 1-26 is transformed into A-Z, yield the corresponding character.&lt;/p&gt;&#xA;&lt;p&gt;Output can be as an array, newline separated, whatever. Equations don't need to be spaced, that's just for readability. You can even output as a list of &lt;code&gt;[1,+,1,=,3]&lt;/code&gt; or something.&lt;/p&gt;&#xA;&lt;h1 id=&quot;testcases-l4oa&quot;&gt;Testcases&lt;/h1&gt;&#xA;&lt;p&gt;These are &lt;em&gt;possible&lt;/em&gt;  outputs, not proper testcases.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A =&amp;gt; 1 + 1 = 3&#xA;HI =&amp;gt; 3 * 4 = 4, 9 * 2 = 9&#xA;LOL =&amp;gt; 20 / 5 = 16, 7 * 5 = 20, 50 - 23 = 15&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="100664" LastActivityDate="2021-07-15T23:07:17.323" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23688" PostTypeId="2" ParentId="2140" CreationDate="2021-07-17T03:17:27.717" Score="3" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/231876/how-many-sets-are-there&quot;&gt;Posted! - How many Sets are there?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="67809" LastEditorUserId="67809" LastEditDate="2021-07-27T02:48:40.853" LastActivityDate="2021-07-27T02:48:40.853" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23689" PostTypeId="2" ParentId="8047" CreationDate="2021-07-17T08:40:34.340" Score="-7" Body="&lt;h1 id=&quot;tagcops-and-robbers-with-easy-fallback-to-general-find-a-solution-h9ho&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; with easy fallback to general find-a-solution&lt;/h1&gt;&#xA;&lt;p&gt;Actually lot of these question do have one, the first few I see:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/231321/&quot;&gt;It almost works (Cops&amp;#39; Thread)&lt;/a&gt; (&lt;code&gt;t=input();f(t);print()&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/217598/&quot;&gt;The Math is Right, But the Answer is Wrong - Robbers&lt;/a&gt; (&lt;code&gt;f(input())?1e999-1e999:0&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/213962/&quot;&gt;Guess my password (cops&amp;#39; thread)&lt;/a&gt; (&lt;code&gt;f(input())&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/212068/&quot;&gt;Peel away the layers - Cops&lt;/a&gt; (code[&lt;code&gt;x+='0'&lt;/code&gt;], code[&lt;code&gt;x+='1'&lt;/code&gt;], checker)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2021-07-17T08:40:34.340" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23692" PostTypeId="2" ParentId="2140" CreationDate="2021-07-17T18:37:23.250" Score="1" Body="&lt;h1 id=&quot;chess-squad-march-om2f&quot;&gt;Chess Squad March&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/231812/chess-squad-march&quot;&gt;Chess Squad March&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="105130" LastEditorUserId="105130" LastEditDate="2021-07-26T07:55:52.050" LastActivityDate="2021-07-26T07:55:52.050" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23693" PostTypeId="2" ParentId="20722" CreationDate="2021-07-18T03:41:43.520" Score="9" Body="&lt;p&gt;My username has been around for far too long for me to remember the actual original inspiration.&lt;/p&gt;&#xA;&lt;p&gt;My first real username was &amp;quot;galaxy_traveler&amp;quot; - my Minecraft username back in around grade 5 or so, when I created my account. I joined Code Golf under the alias James Smith, which was sort of an obsession of mine at the time (using extremely generic names as an &amp;quot;anonymous&amp;quot; name).&lt;/p&gt;&#xA;&lt;p&gt;I changed my username to Alex L. sometime later, which is my real name, probably because I stopped using weird anonymous names everywhere (including my primary personal email - that got to be confusing, honestly).&lt;/p&gt;&#xA;&lt;p&gt;The earliest record I can find of my presence as &amp;quot;HyperNeutrino&amp;quot; was in 2017 in &lt;a href=&quot;https://codegolf.stackexchange.com/q/111591/68942&quot;&gt;this question&lt;/a&gt; (mentioned both in the comments and in chat, although that chat profile is detached + deleted and the one I use right now was created later). That was probably around the same time I switched my Minecraft username to it as well (I had possibly a couple in between; I remember there was at least one).&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;The idea definitely came from my obsession with random area of STEM at the time, and theoretical physics was definitely one of those areas (being a theoretical physicist was one my potential future pathways for a while, but I later decided against it to pursue computer science 100%). I am not sure where the &amp;quot;Hyper&amp;quot; part came from. &amp;quot;HyperNeutrino&amp;quot; actually has no real meaning, although I was once fooled into think it existed by Jan Dvorak in &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/36634573&quot;&gt;this chat message&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A bineutrino is an excited bound state of two neutrinos that occurs once per year per galaxy and lasts about 10^-36 seconds. Normally they aren't useful, but a type-IV civilization is able to create a swarm of bineutrino collectors that can stabilize one temporarily until hopefully a third neutrino reacts with the existing bineutrino. The resulting trineutrino lasts much longer and is very likely to catalyze further collisions, creating a hyperneutrino, a particle the size of a small star.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;The reason my name is &amp;quot;hyper-neutrino&amp;quot; now is because many people have small screen size or higher page zoom that causes my name to entirely disappear while in chat. This issue was mostly caused by my diamond, since previously my name could just barely fit most of the time, but the added space from the diamond caused it to just vanish. By using &amp;quot;hyper-neutrino&amp;quot;, the hyphen creates a spot for breaking the line, so my name will instead show as &amp;quot;hyper&amp;quot;, which is still not ideal, but is much better than it just disappearing altogether.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;There isn't a particular story behind my avatar. It used to be a benzene ring, which I joined the site with, owing to my obsession with chemistry at the time. It actually stayed as that for quite a long period of time, until around a year ago when I changed it to K/DA All Out Akali's icon (League of Legends) since the skin line was just coming out and I really liked it (and I am / was an Akali main). Also, it wasn't too far off from my previous icon, since it was still a black square with a white symbol in the center, which is fairly unique (or at least, it was, but now lyxal is probably more well-known if one is to think about a pure white-on-black avatar).&lt;/p&gt;&#xA;&lt;p&gt;I changed it a couple more times as well, though I cannot remember all of those changes. It was a picture of Eula from Genshin Impact for a while, but eventually I decided to change it a) to simplify it for recognizability (which was prompted by the room owner election, where &amp;quot;static username&amp;quot; and &amp;quot;static avatar&amp;quot; because campaigning points for consistent recognizability), b) to stop people from saying &amp;quot;haha anime girl&amp;quot; (Genshin Impact is a Chinese game, not Japanese, by the way, but it is still pretty much an anime game based on its art style and like, everything about it other than the actual nationality of the comapany that created it), and c) one person did mention that they thought I changed my pronouns as a result of making my profile image a female character. I have always been 100% a cisgender male, and I can understand why that would be misleading.&lt;/p&gt;&#xA;&lt;p&gt;Thus, I decided to create a new profile picture that I would stick to to be a) recognizable, b) unique, and c) representative. I couldn't find anyone using the lambda symbol yet, and so, based on inspiration from Redwolf Programs's profile picture, I made it a monochromatic 16x16 pixel art image of a lambda symbol. It was originally purple-on-black, but I didn't like that as much as the current purple-on-white one, so I used this instead after switching between the two a few times.&lt;/p&gt;&#xA;&lt;p&gt;Is it recognizable? I would say yes. Is it unique? In terms of the lambda symbol being unique, yes; the style is pretty much copied from Redwolf. Is it representative? Sort of? I am a programmer, after all, not just by hobby but field of study and profession. Do I know much about lambda calculus? Not nearly as much as I wish I did. I know the basics, but by no means am experienced.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;TL;DR - there is a story behind these, but no particular significance behind either my name or my profile picture. In fact, entirely rebranding myself has been something I have considered many times, but I think I will wait until a notable change in my life to do something like that, and I don't know if that will happen or if I want that to happen. So, in case I change it, for the record, this is my current profile.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/4GmaU.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/4GmaU.png&quot; alt=&quot;hyper-neutrino's current CGCC flair&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-07-18T03:41:43.520" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23694" PostTypeId="2" ParentId="2140" CreationDate="2021-07-18T10:40:38.557" Score="0" Body="&lt;h1 id=&quot;avoid-traps-run-to-an-exit-tagrestricted-source-hgil&quot;&gt;Avoid traps, run to an exit! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2 id=&quot;code-layout-jcby&quot;&gt;Code layout&lt;/h2&gt;&#xA;&lt;p&gt;Your code shall have:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;One kind of characters as the &lt;strong&gt;protagonist&lt;/strong&gt;. The protagonist must appear exactly once in the source.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;One other kind as the &lt;strong&gt;trap&lt;/strong&gt;. Traps must appear once or more.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;One other kind as the &lt;strong&gt;exit&lt;/strong&gt;. Exits must appear once or more.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;No other restrictions.&lt;/p&gt;&#xA;&lt;h2 id=&quot;objective-ovlw&quot;&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;The protagonist can &lt;strong&gt;move&lt;/strong&gt; by replacing another character by the protagonist and removing the original protagonist.&lt;/p&gt;&#xA;&lt;p&gt;Write a program/function that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Outputs zero when executed/invoked on its own.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Outputs a negative number if the protagonist moved into a trap. The output need not be consistent.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Outputs a positive number if the protagonist moved into an exit. The output need not be consistent.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;All other modifications fall in &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2 id=&quot;example-tves&quot;&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;Given the following source:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Hello, world!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;where &lt;code&gt;H&lt;/code&gt; is the protagonist, &lt;code&gt;l&lt;/code&gt;s are traps, and &lt;code&gt;o&lt;/code&gt;s are exits, the source shall output zero.&lt;/p&gt;&#xA;&lt;p&gt;Then the following sources shall output a negative number:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;eHlo, world!&#xA;&#xA;elHo, world!&#xA;&#xA;ello, worHd!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And the following sources shall output a positive number:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ellH, world!&#xA;&#xA;ello, wHrld!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2 id=&quot;scoring-38xv&quot;&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;The source with the least number of &lt;strong&gt;characters&lt;/strong&gt; (not bytes) shall win.&lt;/p&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2021-07-18T10:51:39.343" LastActivityDate="2021-07-18T10:51:39.343" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23695" PostTypeId="2" ParentId="2140" CreationDate="2021-07-18T13:04:10.977" Score="0" Body="&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2021-07-21T19:01:52.303" LastActivityDate="2021-07-21T19:01:52.303" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23700" PostTypeId="2" ParentId="2140" CreationDate="2021-07-20T02:47:59.953" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/235064/94346&quot;&gt;Snap (card game)&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="94346" LastEditorUserId="94346" LastEditDate="2021-09-04T22:16:58.977" LastActivityDate="2021-09-04T22:16:58.977" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23703" PostTypeId="2" ParentId="2140" CreationDate="2021-07-20T12:06:22.680" Score="1" Body="&lt;h1 id=&quot;httpscodegolf.stackexchange.comquestions231681king-of-the-hill-nose-poker-an-ogre-game-for-ogres-qw4y&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/231681/king-of-the-hill-nose-poker-an-ogre-game-for-ogres&quot;&gt;King of the Hill: Nose Poker - An ogre game for ogres&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="16824" LastEditorUserId="66833" LastEditDate="2021-07-27T01:01:14.987" LastActivityDate="2021-07-27T01:01:14.987" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23706" PostTypeId="2" ParentId="2140" CreationDate="2021-07-21T03:29:12.443" Score="1" Body="&lt;h1 id=&quot;im-a-lizard-cut-here-ihzo&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/231858/94346&quot;&gt;I'm a lizard, cut here!&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="94346" LastEditorUserId="94346" LastEditDate="2021-07-26T21:19:58.407" LastActivityDate="2021-07-26T21:19:58.407" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23709" PostTypeId="2" ParentId="2140" CreationDate="2021-07-23T00:02:46.323" Score="2" Body="&lt;h1 id=&quot;httpscodegolf.stackexchange.comquestions231734are-you-a-probabilist-or-a-physicist-o0xs&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/231734/are-you-a-probabilist-or-a-physicist&quot;&gt;Are you a probabilist or a physicist?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-07-24T23:12:37.283" LastActivityDate="2021-07-24T23:12:37.283" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23713" PostTypeId="2" ParentId="2140" CreationDate="2021-07-25T09:47:23.127" Score="0" Body="&lt;h1&gt;Is it a mathy-county-number&lt;/h1&gt;&#xA;&lt;p&gt;So I recently reinvented some boring type of number.&#xA;Reinvented because I'm sure somebody else invented it before, but 'till figure out who invented it, let's call these numbers &lt;strong&gt;mathy-county-numbers&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;So what is a mathy-county-number?&lt;/h2&gt;&#xA;&lt;p&gt;A mathy-county-number number is a number whose count of each digit also appears in the number.&lt;br /&gt;&#xA;It's a number like 332222410.&lt;br /&gt;&#xA;The number 3 occurs 2 times, so there must be a 2. The number 2 occurs 4 times, so there must be a 4. 4 occurs once, and some other numbers occur 0 times.&lt;/p&gt;&#xA;&lt;p&gt;The task is simple: Write a program to check if a number (received by the input) is a mathy-county-number.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Default loopholes apply&lt;/li&gt;&#xA;&lt;li&gt;Default I/O rules apply&lt;/li&gt;&#xA;&lt;li&gt;Output must be a truthy or falsy value&lt;/li&gt;&#xA;&lt;li&gt;No digit will appear more than 9 times&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;332222410&#xA;&amp;gt; True&#xA;&#xA;33222241&#xA;&amp;gt; False&#xA;&#xA;1&#xA;&amp;gt; False&#xA;&#xA;33222&#xA;&amp;gt; False&#xA;&#xA;1122233334444455555566666667777777788888888890&#xA;&amp;gt; True&#xA;&#xA;112223333444445555556666666777777778888888889&#xA;&amp;gt; True&#xA;&#xA;122334444456789&#xA;&amp;gt; False&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="96037" LastEditorUserId="96037" LastEditDate="2022-01-08T15:58:42.427" LastActivityDate="2022-01-08T15:58:42.427" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="23714" PostTypeId="2" ParentId="2140" CreationDate="2021-07-26T12:15:01.653" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/233077/custom-rows-of-smileys-triangle&quot;&gt;Custom Rows of Smileys Triangle&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerDisplayName="user100411" LastEditorDisplayName="user100411" LastEditDate="2021-08-04T08:00:33.057" LastActivityDate="2021-08-04T08:00:33.057" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23715" PostTypeId="2" ParentId="2140" CreationDate="2021-07-26T22:13:50.937" Score="0" Body="&lt;h1 id=&quot;httpscodegolf.stackexchange.comquestions231864group-binary-shapes-together-ctkt&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/231864/group-binary-shapes-together&quot;&gt;Group binary shapes together&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-07-26T23:14:52.613" LastActivityDate="2021-07-26T23:14:52.613" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="23716" PostTypeId="2" ParentId="2140" CreationDate="2021-07-26T22:48:32.063" Score="1" Body="&lt;h1 id=&quot;do-you-come-here-often-znkq&quot;&gt;Do you come here often?&lt;/h1&gt;&#xA;&lt;p&gt;Imagine a scenario where users are loging in to a website with an email address and a phone number. Sometimes when a user returns, they identify themselves differently; changing either their email or their number.&lt;/p&gt;&#xA;&lt;p&gt;How do we find the unique users behind the log ins?&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Illustration:&lt;/strong&gt; Here Anna has changed her email between the first and second log in, and changed her phone number from the second to the third. Paul has logged in once, while Anna three times.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/bFsV2.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/bFsV2.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1 id=&quot;challenge-tkx2&quot;&gt;Challenge&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Given two ordered list of identifiers (ID1 and ID2), return an ordered list showing the owners of the different IDs (named 0, 1, 2, etc.).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&#xA;List_ID1, List_ID2&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&#xA;List_ID3&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Connection:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A user logs on and identify with two IDs, e.g. List_ID1[0] and List_ID2[0]. &#xA;The first unique user is called &amp;quot;0&amp;quot; making List_ID3[0] = 0&#xA;- If List_ID1[1] or List_ID2[1] can be traced to user 1: List_ID3[1] = 0&#xA;- If List_ID1[1] or List_ID2[1] cannot be traced to user 1: List_ID3[1] = 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1 id=&quot;example-input-and-output-fs2y&quot;&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[7, 7, 8, 9, 10, 11, 11, 10, 12, 12, 15, 16, 15, 16, 15, 16]&#xA;[1, 2, 2, 3, 3, 3, 4, 4, 5, 6, 2, 1, 2, 1, 2, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 0, 0, 0, 0, 0, 0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1 id=&quot;meta-a6xs&quot;&gt;Meta&lt;/h1&gt;&#xA;&lt;p&gt;This is an idea I have had for some time, and though I have some code which can do this, I wonder what is the fastest algorithm for this problem. Today I discovered the Code Golf Meta, and I hope you can guide me through my first interaction with this community. I'm happy to be here!&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Answer the following questions for your readers: (From template)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;strong&gt;Are there any corner cases? Is it clear how they should be handled?&lt;/strong&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'm not sure.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;How will the winner of the challenge will be determined?&lt;/strong&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is my first challenge. What I would want to ask that the fastest code wins, but I see that the convention is otherwise here. Or do you also do speed as a winning criteria?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Is it clear how all submissions will be scored?&lt;/strong&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I was thinking to make some test cases to run. Does that work?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="105286" LastEditorUserId="105286" LastEditDate="2021-07-26T23:12:34.117" LastActivityDate="2021-07-26T23:12:34.117" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23719" PostTypeId="2" ParentId="2140" CreationDate="2021-07-27T10:06:10.533" Score="0" Body="&lt;h1 id=&quot;two-inverse-quines-ksv5&quot;&gt;Two inverse quines&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge is to write two programs A and B such that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A outputs B&lt;/li&gt;&#xA;&lt;li&gt;B outputs A&lt;/li&gt;&#xA;&lt;li&gt;Wherever there is a space character in A, there is a non-whitespace character in B, and vice versa (newlines must be consistent through both)&lt;/li&gt;&#xA;&lt;li&gt;This means A and B are the same length in characters.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For example &lt;code&gt;A &lt;/code&gt; and &lt;code&gt; B&lt;/code&gt; are valid, but &lt;code&gt;A &lt;/code&gt; and &lt;code&gt;  B&lt;/code&gt; are not.&lt;/p&gt;&#xA;&lt;p&gt;Newlines must be consistent through both, so &lt;code&gt;A \nB &lt;/code&gt; and &lt;code&gt; C\n D&lt;/code&gt; are valid, but &lt;code&gt;A   C&lt;/code&gt; and &lt;code&gt;B\nD&lt;/code&gt; are not.&lt;/p&gt;&#xA;&lt;h1 id=&quot;scoring-wy80&quot;&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;Your score is the length in bytes of either of your programs. If they're different lengths in &lt;em&gt;bytes&lt;/em&gt;, take the average.&lt;/p&gt;&#xA;" OwnerUserId="100664" LastActivityDate="2021-07-27T10:06:10.533" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23720" PostTypeId="2" ParentId="17912" CreationDate="2021-07-27T17:33:13.480" Score="1" Body="&lt;p&gt;We don't have immediate plans to work on this request. We understand this a poor experience and will revisit this at a later date. We'll provide an update once we have fully investigated or completed the work.&lt;/p&gt;&#xA;" OwnerUserId="105303" LastActivityDate="2021-07-27T17:33:13.480" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23722" PostTypeId="2" ParentId="2140" CreationDate="2021-07-27T18:15:17.563" Score="1" Body="&lt;h1&gt;Train A Single Perceptron&lt;/h1&gt;&#xA;&lt;p&gt;You must write a program that will train a perceptron to simulate the things described in the test cases section of this question.&lt;/p&gt;&#xA;&lt;h2&gt;What is a perceptron and how to train it&lt;/h2&gt;&#xA;&lt;p&gt;A perceptron takes inputs and returns 1 if the dot product of the inputs and its list of weights is greater than or equal to 0 and it returns 0 otherwise. To take the dot product, multiply the elements of the list and take the sum. In other words, &lt;strong&gt;your program must find the line (w⋅x=1) that linearly separates the two possible classes of outputs.&lt;/strong&gt; Example: dot product of [0,2] and [8,3] is 0+6, which equals 6. Your job is to return the list of weights that will make the perceptron return the correct outputs for a list of inputs 100% of the time.&lt;/p&gt;&#xA;&lt;p&gt;See these links for more information:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://desmos.com/calculator/d2nryjmw2t&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://desmos.com/calculator/d2nryjmw2t&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://towardsdatascience.com/perceptron-learning-algorithm-d5db0deab975&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://towardsdatascience.com/perceptron-learning-algorithm-d5db0deab975&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Inputs&lt;/h2&gt;&#xA;&lt;p&gt;The program should take as input training inputs and training labels. Each list of inputs corresponds to exactly one output. This data must be used to train the perceptron.&lt;/p&gt;&#xA;&lt;h2&gt;Outputs&lt;/h2&gt;&#xA;&lt;p&gt;The program should output the final list of weights as integers. The dot product of these weights and any valid input to the perceptron should be the correct output of the perceptron 100% of the time.&lt;/p&gt;&#xA;&lt;h2&gt;Training&lt;/h2&gt;&#xA;&lt;p&gt;How you train the perceptron is up to you. To train a perceptron to simulate an AND gate, your program should take training inputs and the correct output for each list of inputs. In the case of the AND gate, your program would take [[0,0],[0,1],[1,0],[1,1]] as the list of training inputs and [0,0,0,1] as the list of what the neuron should output given each input. The program should then output a list of weights, which will output the correct output when used in a perceptron.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;AND gate:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input List: [[0,0],[0,1],[1,0],[1,1]]&lt;/li&gt;&#xA;&lt;li&gt;Correct Outputs: [0,0,0,1]&lt;/li&gt;&#xA;&lt;li&gt;Your program should output a list of two weights that will solve the problem of behaving like an AND gate when used in a perceptron.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Only outputs 1 if the third input is 1:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input List: [[0,0,0],[0,0,1],[0,1,0],[0,1,1],[1,0,0],[1,0,1],[1,1,0],[1,1,1]]&lt;/li&gt;&#xA;&lt;li&gt;Correct Outputs: [0,1,0,1,0,1,0,1]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;OR gate:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input List: [[0,0],[0,1],[1,0],[1,1]]&lt;/li&gt;&#xA;&lt;li&gt;Correct Inputs: [0,1,1,1]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Make up your own test case, and try to make it interesting!&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;This is code golf, so the shortest program in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="105259" LastEditorUserId="105259" LastEditDate="2021-08-04T02:11:32.220" LastActivityDate="2021-08-04T02:11:32.220" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23723" PostTypeId="2" ParentId="2140" CreationDate="2021-07-27T20:48:33.663" Score="1" Body="&lt;h1 id=&quot;how-effective-is-compression-q1vg&quot;&gt;How effective is compression?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/Vyxal/Vyxal&quot; rel=&quot;nofollow noreferrer&quot;&gt;Vyxal&lt;/a&gt; has a very simple format for compressed integers: a base-255-encoded string of characters wrapped in &lt;code&gt;«&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;With base 255, the number to be compressed needs to be 10000 or greater for the compression to have an advantage against ordinary numbers, as with 1 character, you can represent at most 3-digit numbers (up to 254), which ties with 1 + 2 (for the &lt;code&gt;«&lt;/code&gt;) = 3 bytes; with 2 you can represent up to 65024 in  4 bytes, beating 5 for n ≥ 10000.&lt;/p&gt;&#xA;&lt;p&gt;But what if it was another base?&lt;/p&gt;&#xA;&lt;p&gt;If it were base 99, it would take 3 bytes, since you can only express up to 9800 with 2, which isn't any better than expressing the number. But with 3, you can reach 970299, which has 6 digits&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to take a positive integer &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; 11 or greater, and find the smallest number &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$log_b(10^n) + 2 &amp;lt; n\$&lt;/span&gt;. You may output &lt;span class=&quot;math-container&quot;&gt;\$10^n\$&lt;/span&gt; instead.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, shortest wins!&lt;/p&gt;&#xA;&lt;p&gt;Testcases coming soon.&lt;/p&gt;&#xA;" OwnerUserId="100664" LastActivityDate="2021-07-27T20:48:33.663" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23725" PostTypeId="1" CreationDate="2021-07-28T19:55:32.580" Score="12" ViewCount="179" Body="&lt;p&gt;The Community VP &lt;a href=&quot;https://meta.stackexchange.com/q/367906/317948&quot;&gt;has asked what our community needs&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I speculate that a lot of people here would tend towards the same kind of answer to that. Feel free to answer this post with suggestions to how we could formulate a community answer, and maybe we can come to a sort of consensus with a good wording.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2021-07-28T19:55:32.580" Title="What do we want?" Tags="|discussion|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23726" PostTypeId="2" ParentId="2140" CreationDate="2021-07-28T21:29:51.893" Score="0" Body="&lt;p&gt;&lt;strong&gt;The Roly-Poly, Square-Wheeled Quine&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Moved &lt;a href=&quot;https://codegolf.stackexchange.com/questions/232942/the-roly-poly-square-wheeled-quine&quot;&gt;here&lt;/a&gt;. Thank you for the comments.&lt;/p&gt;&#xA;" OwnerUserId="105033" LastEditorUserId="105033" LastEditDate="2021-07-29T19:48:45.840" LastActivityDate="2021-07-29T19:48:45.840" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="23727" PostTypeId="2" ParentId="2140" CreationDate="2021-07-29T03:13:28.110" Score="0" Body="&lt;h1 id=&quot;knapsack-paragraph-format-for-a-phone-r8pn&quot;&gt;Knapsack Paragraph, Format For A Phone&lt;/h1&gt;&#xA;&lt;p&gt;There are several paragraph formatting questions already on the site, where a string of text is split on space or other boundaries in order to fit into a rectangle; but they usually involve specifying a particular width for the formatted paragraph in addition to the supplied text.&lt;/p&gt;&#xA;&lt;p&gt;For this problem, instead of a fixed width, we want to minimize the &lt;em&gt;perimeter&lt;/em&gt; of the bounding box of the formatted text. Because we are developers for a phone app and we have to pay for the border by the inch. Or some other such tom-foolery; actually I noticed that this is a bit of a knapsack problem, and I just like the resemblance to that old folk song &amp;quot;knick-knack paddywack, give a dog a bone&amp;quot;.&lt;/p&gt;&#xA;&lt;h2 id=&quot;challenge-ex4i&quot;&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Define a &lt;em&gt;layout&lt;/em&gt; of a string &lt;strong&gt;T&lt;/strong&gt; of text as a list of &lt;strong&gt;n&lt;/strong&gt; strings &lt;strong&gt;s[i]&lt;/strong&gt; such that the joined string using spaces as delimiter, i.e. &lt;strong&gt;s[0]+' '+s[1]+' '+...+' '+s[n-1]&lt;/strong&gt; is equal to &lt;strong&gt;T&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;em&gt;semiperimeter&lt;/em&gt; of a layout &lt;strong&gt;s&lt;/strong&gt; is &lt;strong&gt;n&lt;/strong&gt; plus the maximum length of any &lt;strong&gt;s[i]&lt;/strong&gt; in &lt;strong&gt;s&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Given as input a string &lt;strong&gt;T&lt;/strong&gt;, your submission must output the minimum semiperimeter across all valid layouts of &lt;strong&gt;T&lt;/strong&gt;. Alternatively, you may output a layout which has a semiperimeter which is minimal.&lt;/p&gt;&#xA;&lt;p&gt;The restrictions on input are forgiving; in particular, you may take &lt;strong&gt;T&lt;/strong&gt; as a list of words (strings without spaces) instead of a single string; so long as the result includes the count of spaces that &lt;em&gt;would&lt;/em&gt; be present in the layout when calculating the semiperimeter.&lt;/p&gt;&#xA;&lt;p&gt;This is code-golf; so the shortest submission in each language is the winner, and will be honored with a parade at some vague time in the near future.&lt;/p&gt;&#xA;&lt;h2 id=&quot;notes-f2ez&quot;&gt;Notes:&lt;/h2&gt;&#xA;&lt;p&gt;Just wanted to get this down; will edit later. Mulling whether to have output be the integer, or an example layout having the minimal perimeter. The former is simpler to construct; but the latter just seems more satisfying as an output.&lt;/p&gt;&#xA;" OwnerUserId="69880" LastEditorUserId="69880" LastEditDate="2021-07-29T03:47:27.417" LastActivityDate="2021-07-29T03:47:27.417" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23729" PostTypeId="1" CreationDate="2021-07-29T22:00:32.137" Score="2" ViewCount="33" Body="&lt;p&gt;Which would be the preferred format for answers involving data in spreadsheets, a table or a picture?  Below is an example based on one of my answers.&lt;/p&gt;&#xA;&lt;h2&gt;Table&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;A&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;B&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;8&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;10&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;2&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;3&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;4&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;10&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;4&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;5&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;2&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;22&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;6&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;7&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;7&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;8&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;2&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;6&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;9&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;2&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;7&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;10&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;11&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;24&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;12&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;13&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;26&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;14&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;15&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;26&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;16&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;17&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;5&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;18&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;3&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;10&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;19&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;3&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;5&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;20&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;21&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;5&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;22&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;3&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;8&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;23&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;3&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;5&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;24&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;25&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;6&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;26&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;12&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;6&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;27&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;28&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;2&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;22&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;29&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;30&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;4&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;18&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;31&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;32&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;8&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;10&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;h2&gt;Picture&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/C8jpk.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/C8jpk.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="101349" LastEditorUserId="66833" LastEditDate="2021-07-30T00:11:45.470" LastActivityDate="2021-07-30T00:11:45.470" Title="What would be the preferred way to show data in spreadsheet cells?" Tags="|support|formatting|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23730" PostTypeId="2" ParentId="23729" CreationDate="2021-07-29T22:02:21.083" Score="2" Body="&lt;p&gt;I think the table is a good thing, but I'd also include an easily copyable JSON version, that is white-space formatted over multiple lines to resemble a table.&lt;/p&gt;&#xA;&lt;p&gt;Also, for the table, you could bold the leftmost column to indicate that it is a header column.&lt;/p&gt;&#xA;&lt;p&gt;A properly formatted JSON table could for example be:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-json prettyprint-override&quot;&gt;&lt;code&gt;[[   8,  10],&#xA; [null,null],&#xA; [   4,  10],&#xA; [null,null],&#xA; [   2,  22],&#xA; [null,null],&#xA; [   1,   7],&#xA; [   2,   6],&#xA; [   2,   7],&#xA; [null,null],&#xA; [   1,  24],&#xA; [null,null],&#xA; [   0,  26],&#xA; [null,null],&#xA; [   0,  26],&#xA; [null,null],&#xA; [   0,   5],&#xA; [   3,  10],&#xA; [   3,   5],&#xA; [null,null],&#xA; [   1,   5],&#xA; [   3,   8],&#xA; [   3,   5],&#xA; [null,null],&#xA; [   1,   6],&#xA; [  12,   6],&#xA; [null,null],&#xA; [   2,  22],&#xA; [null,null],&#xA; [   4,  18],&#xA; [null,null],&#xA; [   8,  10]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2021-07-29T22:18:29.713" LastActivityDate="2021-07-29T22:18:29.713" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23731" PostTypeId="2" ParentId="23729" CreationDate="2021-07-29T22:05:05.463" Score="0" Body="&lt;p&gt;I agree with Adám that a table is probably best. Images may not be loaded sometimes, and you can't copy from them. However, if the table gets extremely big (like the one in your question), I would suggest linking to &lt;a href=&quot;https://pastebin.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pastebin&lt;/a&gt; or somewhere else.&lt;/p&gt;&#xA;" OwnerUserId="95792" LastActivityDate="2021-07-29T22:05:05.463" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23732" PostTypeId="2" ParentId="2140" CreationDate="2021-07-30T02:25:20.470" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/233007/66833&quot;&gt;Calculate the integer square root of a matrix&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-08-01T20:44:12.373" LastActivityDate="2021-08-01T20:44:12.373" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23733" PostTypeId="2" ParentId="2140" CreationDate="2021-07-30T04:11:08.393" Score="0" Body="&lt;p&gt;Your challenge is to write a method that compresses/decompresses strings. It will get two arguments: any string (with any ASCII characters) to compress/decompress, and a boolean. If the boolean is true, compress, else decompress.&lt;/p&gt;&#xA;&lt;p&gt;It can either print the output to stdout or return the data.&lt;/p&gt;&#xA;&lt;p&gt;The twist is that your score is equal to the byte count of your source code + the byte count of your source code &lt;em&gt;compressed by the compressor&lt;/em&gt;. So if your code was &lt;code&gt;c=&amp;gt;c&lt;/code&gt; (which is invalid btw), your score would be 4 + 4 = 8.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Standard loopholes not allowed&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The decompression and compression should work.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your code should not just return the same data. So this&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;c=&amp;gt;c&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;is invalid&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test function to check the score&lt;/h2&gt;&#xA;&lt;p&gt;If you like, here's a function which checks your (&lt;code&gt;javascript&lt;/code&gt;) answer.&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;function checkCompressor(compressor) {&#xA;    const source = compressor.toString();&#xA;    const compressed = compressor(source, true);&#xA;    const decompressed = compressor(compressed, false);&#xA;    if (source !== decompressed) return false;&#xA;    return compressed; // Have to get byte count manually&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="104006" LastEditorUserId="104006" LastEditDate="2021-07-30T06:45:48.100" LastActivityDate="2021-07-30T06:45:48.100" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23736" PostTypeId="2" ParentId="2140" CreationDate="2021-07-31T15:40:18.740" Score="1" Body="&lt;h1&gt;KOTH: Prisoners Dilemma Single Elimination &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot;&gt;python&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;I was playing around with this and found some interesting strategies. This is sufficiently different from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/175794/iterated-prisoners-trilemma&quot;&gt;this post&lt;/a&gt; because you are playing different bots each game, instead of repeatedly playing the same ones.&lt;/p&gt;&#xA;&lt;h2&gt;How the game works&lt;/h2&gt;&#xA;&lt;p&gt;The basic game is the prisoners dilemma. A bot and it's opponent may choose to defect (1) or cooperate (0). Defecting gives you 1 point, and if your opponent cooperates you gain 2 points. If you defect and your opponent cooperates this adds up to a total of 3 points.&lt;/p&gt;&#xA;&lt;p&gt;In every round, you play against every opponent (including yourself) in random order. The bot does not know who it is playing against. This process repeats 100 times to form a single round, after each round the player with the lowest score is eliminated, and the scores of the rest of the players is divided are 2. Round continue until either every remaining player always defects, or always cooperates, at which point the best player is decided by their score. (After this points scores converge quite fast, so to avoid noise deciding the winner I measure at the point with the most pronounced differences)&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;Your bot does not know who it is playing against, not even if it is playing against itself. However, the bot does know what its opponent decided on its last 3 games, and for each of those 3 games what the opponent's opponent decided. Basically, the input will look like this:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;[&#xA;    [0, # Three games ago, your opponent decided not to defect&#xA;        [1, # Your opponent's opponent from three games ago defected three games before that&#xA;         0,&#xA;         0],&#xA;    [1,  # Your opponent defected in their second to last game&#xA;        [1, # Your opponent's opponent from two games ago defected the 3 games before that&#xA;         1,&#xA;         1]&#xA;    [0, [0, 0, 0]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(With 1 and 0 replaced with &lt;code&gt;True&lt;/code&gt; and &lt;code&gt;False&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;p&gt;Any of these players might be the same. Your opponent's opponent could actually be your current opponent if they played against themselves last, or it could be yourself if you played against eachother twice in a row. (Unlikely, but possible at the end of a round)&lt;/p&gt;&#xA;&lt;p&gt;Your bot does not receive what it's own last decisions are but is free to keep that info in it's own state.&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;You can output any value, if &lt;code&gt;bool(output) == True&lt;/code&gt; your bot defects, otherwise your bot cooperates.&lt;/p&gt;&#xA;&lt;h2&gt;Example Bots&lt;/h2&gt;&#xA;&lt;p&gt;Nice bot never defects:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;class NiceBot:&#xA;    def get_choice(self, last_3_games):&#xA;        return 0 # Any False-y value will work, for example False or an empty string&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Mean bot always defects:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;class MeanBot:&#xA;    def get_choice(self, last_3_games):&#xA;        return 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Majority bot chooses whatever it's opponent chose the most often:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;class MajorityBot:&#xA;    def get_choice(self, last_3_games):&#xA;        choices = [i[0] for i in last_3_games]&#xA;        return max(set(choices), key=choices.count)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Bandwagon bot will avoid decisions by chosing what the bots opponents chose the most.&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;class BandwagonBot:&#xA;    def get_choice(self, last_3_games):&#xA;        total_true = sum(&#xA;            i[1].count(True)&#xA;            for i in last_3_games&#xA;        )&#xA;&#xA;        return total_true &amp;gt;= 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Bandwagon bot will only play if the number of bots is even.&lt;/p&gt;&#xA;&lt;h2&gt;Other specifics&lt;/h2&gt;&#xA;&lt;p&gt;A bot may implement a &lt;code&gt;reset()&lt;/code&gt; method that will be called every time an opponent is eliminated. For bots that keep state this might be a good time to clear it.&lt;/p&gt;&#xA;&lt;p&gt;Other rules:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You are not allowed to use any form of randomness.&lt;/li&gt;&#xA;&lt;li&gt;You are not allowed to use IO&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply, in particular no exploiting the controller&lt;/li&gt;&#xA;&lt;li&gt;Standard library imports are allowed for simple functionality that you could implement yourself without breaking any of the other rules eg &lt;code&gt;itertools&lt;/code&gt;, &lt;code&gt;functools&lt;/code&gt; but not for example &lt;code&gt;sys&lt;/code&gt;, &lt;code&gt;time&lt;/code&gt; or &lt;code&gt;asyncio&lt;/code&gt;. Ask if you are not sure. Definitely no attempts to import parts of the controller or other bots.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Controller&lt;/h1&gt;&#xA;&lt;p&gt;I have a controller written but I would need to simplify it a little to remove some parts that have become redundant. Don't want to put too much effort into making it presentable if it is not a suitable challenge.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2021-07-31T15:40:18.740" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23737" PostTypeId="2" ParentId="2140" CreationDate="2021-07-31T16:36:38.607" Score="-1" Body="&lt;h1&gt;Get the Collatz Sequence&lt;/h1&gt;&#xA;&lt;h1&gt;The Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Write a full program or function that, when given an integer &lt;span class=&quot;math-container&quot;&gt;\$n \ge 0\$&lt;/span&gt;, outputs all steps of the Collatz Sequence (&lt;a href=&quot;https://oeis.org/A006577&quot; rel=&quot;nofollow noreferrer&quot;&gt;A006577&lt;/a&gt;) of &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;The Collatz Sequence&lt;/h3&gt;&#xA;&lt;p&gt;The Collatz Sequence is defined as:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;a(n) =&#xA;\begin{cases}&#xA;n/2,  &amp;amp; \text{if $n$ is even} \\&#xA;3n+1, &amp;amp; \text{if $n$ is odd}&#xA;\end{cases}&#xA;\text{while n &amp;gt; 1}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;Input is some integer &lt;span class=&quot;math-container&quot;&gt;\$n \ge 0\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;Output is the sequence of numbers visited while calculating the Collatz Sequence, while the output is greater than 1.&lt;/p&gt;&#xA;&lt;h3&gt;Additional Rules&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes are forbidden&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;Input and output can be in any reasonable format.&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;n -&amp;gt; sequence&#xA;0 -&amp;gt; [0]&#xA;1 -&amp;gt; [1]&#xA;2 -&amp;gt; [2, 1]&#xA;3 -&amp;gt; [3, 10, 5, 16, 8, 4, 2, 1]&#xA;4 -&amp;gt; [4, 2, 1]&#xA;5 -&amp;gt; [5, 16, 8, 4, 2, 1]&#xA;6 -&amp;gt; [6, 3, 10, 5, 16, 8, 4, 2, 1]&#xA;7 -&amp;gt; [7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1]&#xA;8 -&amp;gt; [8, 4, 2, 1]&#xA;9 -&amp;gt; [9, 28, 14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1]&#xA;10 -&amp;gt; [10, 5, 16, 8, 4, 2, 1]&#xA;15 -&amp;gt; [15, 46, 23, 70, 35, 106, 53, 160, 80, 40, 20, 10, 5, 16, 8, 4, 2, 1]&#xA;20 -&amp;gt; [20, 10, 5, 16, 8, 4, 2, 1]&#xA;25 -&amp;gt; [25, 76, 38, 19, 58, 29, 88, 44, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1]&#xA;30 -&amp;gt; [30, 15, 46, 23, 70, 35, 106, 53, 160, 80, 40, 20, 10, 5, 16, 8, 4, 2, 1]&#xA;35 -&amp;gt; [35, 106, 53, 160, 80, 40, 20, 10, 5, 16, 8, 4, 2, 1]&#xA;40 -&amp;gt; [40, 20, 10, 5, 16, 8, 4, 2, 1]&#xA;45 -&amp;gt; [45, 136, 68, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1]&#xA;100 -&amp;gt; [100, 50, 25, 76, 38, 19, 58, 29, 88, 44, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1]&#xA;9329 -&amp;gt; [9329, 27988, 13994, 6997, 20992, 10496, 5248, 2624, 1312, 656, 328, 164, 82, 41, 124, 62, 31, 94, 47, 142, 71, 214, 107, 322, 161, 484, 242, 121, 364, 182, 91, 274, 137, 412, 206, 103, 310, 155, 466, 233, 700, 350, 175, 526, 263, 790, 395, 1186, 593, 1780, 890, 445, 1336, 668, 334, 167, 502, 251, 754, 377, 1132, 566, 283, 850, 425, 1276, 638, 319, 958, 479, 1438, 719, 2158, 1079, 3238, 1619, 4858, 2429, 7288, 3644, 1822, 911, 2734, 1367, 4102, 2051, 6154, 3077, 9232, 4616, 2308, 1154, 577, 1732, 866, 433, 1300, 650, 325, 976, 488, 244, 122, 61, 184, 92, 46, 23, 70, 35, 106, 53, 160, 80, 40, 20, 10, 5, 16, 8, 4, 2, 1]&#xA;4637823 -&amp;gt; [4637823, 13913470, 6956735, 20870206, 10435103, 31305310, 15652655, 46957966, 23478983, 70436950, 35218475, 105655426, 52827713, 158483140, 79241570, 39620785, 118862356, 59431178, 29715589, 89146768, 44573384, 22286692, 11143346, 5571673, 16715020, 8357510, 4178755, 12536266, 6268133, 18804400, 9402200, 4701100, 2350550, 1175275, 3525826, 1762913, 5288740, 2644370, 1322185, 3966556, 1983278, 991639, 2974918, 1487459, 4462378, 2231189, 6693568, 3346784, 1673392, 836696, 418348, 209174, 104587, 313762, 156881, 470644, 235322, 117661, 352984, 176492, 88246, 44123, 132370, 66185, 198556, 99278, 49639, 148918, 74459, 223378, 111689, 335068, 167534, 83767, 251302, 125651, 376954, 188477, 565432, 282716, 141358, 70679, 212038, 106019, 318058, 159029, 477088, 238544, 119272, 59636, 29818, 14909, 44728, 22364, 11182, 5591, 16774, 8387, 25162, 12581, 37744, 18872, 9436, 4718, 2359, 7078, 3539, 10618, 5309, 15928, 7964, 3982, 1991, 5974, 2987, 8962, 4481, 13444, 6722, 3361, 10084, 5042, 2521, 7564, 3782, 1891, 5674, 2837, 8512, 4256, 2128, 1064, 532, 266, 133, 400, 200, 100, 50, 25, 76, 38, 19, 58, 29, 88, 44, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;For Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is it clear?&lt;/li&gt;&#xA;&lt;li&gt;Any corrections?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="77309" LastActivityDate="2021-07-31T16:36:38.607" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23738" PostTypeId="1" CreationDate="2021-07-31T21:02:12.503" Score="9" ViewCount="325" Body="&lt;h2&gt;Advertisement&lt;/h2&gt;&#xA;&lt;p&gt;Been pushing off learning that one lang for too long? Maybe it doesn't qualify for LotM status? Then [name pending] is for you!&lt;/p&gt;&#xA;&lt;p&gt;This is perfect for languages which are too popular for LotM, or which have already been done a while back. But we're not discriminating, bring your fave lang along!&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Maybe it's &lt;em&gt;Jelly&lt;/em&gt;, &lt;em&gt;Retina&lt;/em&gt;, &lt;em&gt;J&lt;/em&gt; or &lt;em&gt;APL&lt;/em&gt; that you haven't gotten around to, but those are too popular for LotM.&lt;/li&gt;&#xA;&lt;li&gt;Maybe a 'legacy' language like &lt;em&gt;05AB1E&lt;/em&gt; or &lt;em&gt;GolfScript&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Maybe you missed the LotM entry or want more practice for &lt;em&gt;Vyxal&lt;/em&gt; &amp;amp; &lt;em&gt;Brachylog&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Maybe you want to get better at golfing in a mainstream lang like &lt;em&gt;Python&lt;/em&gt; or &lt;em&gt;C&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Maybe it's a just not general purpose enough for LotM. Think &lt;em&gt;&lt;code&gt;///&lt;/code&gt;&lt;/em&gt;, &lt;em&gt;Befunge&lt;/em&gt;, &lt;em&gt;Canvas&lt;/em&gt;, &lt;em&gt;Piet&lt;/em&gt;. The event's problems will be tailored to that lang!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Any which way, we've got you covered!&lt;/p&gt;&#xA;&lt;h2&gt;Inspiration&lt;/h2&gt;&#xA;&lt;p&gt;This is based off @cairdcoinheringaahing's CMC &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/58764504#58764504&quot;&gt;here&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;In a language you've never used before, calculate the n triangular number&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;We started discussing how to make this a recurring thing in the TNB &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/58765023#58765023&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Basics&lt;/h2&gt;&#xA;&lt;p&gt;The general idea right now is to have an event where we're all doing CMC's in a pre-decided language.&lt;/p&gt;&#xA;&lt;p&gt;If someone volunteers to teach it, there can also be a primer for X minutes before it officially starts. Or they can just be fielding preliminary questions or sharing golfing tips.&lt;/p&gt;&#xA;&lt;h2&gt;Discuss&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We chatted about this in TNB &amp;amp; it had some support there. Is this something the rest of the site would want to do?&lt;/li&gt;&#xA;&lt;li&gt;Should we prioritize languages which aren't eligible for LotM (again)?&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/23739&quot;&gt;What should we call it?&lt;/a&gt; We'll vote on the name based on the ideas here once this thread stabilizes.&lt;/li&gt;&#xA;&lt;li&gt;What format should the event take? Will it be:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;problem-based, like BMG&lt;/li&gt;&#xA;&lt;li&gt;tutorial-based, like APL cultivation&lt;/li&gt;&#xA;&lt;li&gt;long-term, like LotM for a week&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;If the language already has its own room, do we use its room, or do we use a separate room for this event? (or do we use TNB)?&lt;/li&gt;&#xA;&lt;li&gt;Which room do we use?&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Lang-specific, if it exists&lt;/li&gt;&#xA;&lt;li&gt;Event-specific: make a room for [name pending]&lt;/li&gt;&#xA;&lt;li&gt;General: TNB&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;How often?&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Weekly&lt;/li&gt;&#xA;&lt;li&gt;Biweekly&lt;/li&gt;&#xA;&lt;li&gt;Monthly&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Credits:&lt;/strong&gt; Thanks to &lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/caird-coinheringaahing&quot;&gt;@cairdcoingheringaahing&lt;/a&gt; for the inspiration and feedback on the draft. Thanks to &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792/user&quot;&gt;@user&lt;/a&gt; for helping me write this up. Thanks to &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766/dlosc&quot;&gt;@DLosc&lt;/a&gt; for choosing the post name. And thanks to everyone else in TNB for riding along!&lt;/p&gt;&#xA;" OwnerUserId="87594" LastEditorUserId="56656" LastEditDate="2021-08-27T06:50:27.360" LastActivityDate="2021-08-27T06:50:27.360" Title="Chat Event: Learn-a-lang" Tags="|discussion|feature-request|status-completed|chat|chat-events|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23739" PostTypeId="2" ParentId="23738" CreationDate="2021-07-31T21:02:12.503" Score="2" Body="&lt;h1&gt;Name Ideas&lt;/h1&gt;&#xA;&lt;h2&gt;Format&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;Ideas are grouped by 'family' to make voting simpler later.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Include any variations in stylization, except 'lang' vs. 'language' and capitalization; we'll decide on that last. For now everything should use 'lang' and title caps to standardize the options.&lt;/p&gt;&#xA;&lt;h2&gt;Ideas&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Learn a Lang&lt;/strong&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Learn'a lang&lt;/li&gt;&#xA;&lt;li&gt;Learn-a-lang&lt;/li&gt;&#xA;&lt;li&gt;Learnalang&lt;/li&gt;&#xA;&lt;li&gt;Learn a lang&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Lang of the Week&lt;/strong&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Lang of the Week&lt;/li&gt;&#xA;&lt;li&gt;Language of the Week&lt;/li&gt;&#xA;&lt;li&gt;Lang of the Weak&lt;/li&gt;&#xA;&lt;li&gt;Lang of the Fortnight (if biweekly)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Learn You a Lang for Great Good&lt;/strong&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Learn You a New Lang for Great Good&lt;/li&gt;&#xA;&lt;li&gt;Learn You a Lang for Great Good&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Try a Language&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="87594" LastEditorUserId="79857" LastEditDate="2021-08-02T03:09:02.983" LastActivityDate="2021-08-02T03:09:02.983" CommentCount="0" CommunityOwnedDate="2021-07-31T21:02:12.503" ContentLicense="CC BY-SA 4.0" />
  <row Id="23740" PostTypeId="2" ParentId="23738" CreationDate="2021-07-31T21:11:50.033" Score="1" Body="&lt;p&gt;I'd be delighted if such an event happens. Here are some of my opinions, if that's alright:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We chatted about this in TNB &amp;amp; it had some support there. Is this something the rest of the site would want to do?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;It's likely something many users would want to participate in. Learning new languages is fun!&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should we prioritize languages which aren't eligible for LotM (again)?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;No. I don't like the idea of prioritizing previous LotM nominations at all, and prioritizing languages that are too popular for LotM doesn't make sense, as we also want to promote less commonly used esolangs.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What format should the event take?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I think it should be a long-term thing like LotM (but for a week). If someone's willing, tutorials in addition to that would be great, but that's not always possible.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Which room do we use?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I think we should &lt;s&gt;make a separate room just for this event&lt;/s&gt; use TNB where people can post CMCs, CMC answers, and questions involved with the language for that week.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How often?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Weekly seems the best option to me. It's not so long that people will have to wait a long time for their favorite language to show up, and a week is enough time to learn the basics of a language and decide if you like it or not.&lt;/p&gt;&#xA;" OwnerUserId="95792" LastEditorUserId="95792" LastEditDate="2021-08-01T14:22:50.000" LastActivityDate="2021-08-01T14:22:50.000" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23741" PostTypeId="2" ParentId="23738" CreationDate="2021-07-31T21:41:23.333" Score="8" Body="&lt;p&gt;I think this is a good idea, and would like to see it become an event that happened somewhat regularly in TNB.&lt;/p&gt;&#xA;&lt;p&gt;I'd imagine this in a similar format to our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/22276/66833&quot;&gt;Biweekly Mini Golf&lt;/a&gt;. Leading up to the event, languages would be nominated by participants, then voted on (stars in a non-TNB room) to determine which lang is used. I disagree with the idea of prioritising certain languages, and I'm not sure whether or not to allow languages to be duplicated in this event.&lt;/p&gt;&#xA;&lt;p&gt;During the event, users who are more familiar with the language help those less familiar. This could be through a primer, as &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/58765072#58765072&quot;&gt;suggested by Avi&lt;/a&gt;, or just by answering questions. One key thing: these users should not be expected to be &lt;em&gt;teachers&lt;/em&gt;, just as those more familiar. Anyone who wants to can post CMCs (typically trivial CMCs), ask questions about the language and otherwise discuss it.&lt;/p&gt;&#xA;&lt;p&gt;I'm not entirely sure what timescale this would be best on, but every two weeks (likely staggered with BMG) seems like it would be a good idea. I have no strong opinions on the name of the event.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-07-31T21:41:23.333" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23743" PostTypeId="1" CreationDate="2021-08-01T23:57:39.697" Score="14" ViewCount="844" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19271/78850&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout August 2021, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://aplwiki.com/wiki/K&quot; rel=&quot;nofollow noreferrer&quot;&gt;K&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;What's a Language of the Month?&lt;/h2&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/78850&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during August, those who wish to participate should learn (at least the basics of) K, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about K&lt;/h2&gt;&#xA;&lt;p&gt;K is a member of APL-family languages, originally created by Arthur Whitney. Arthur's K has many versions; the latest version as of June 2021 is &lt;a href=&quot;https://shakti.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Shakti&lt;/a&gt; (also commonly called K9), which is still under development.&lt;/p&gt;&#xA;&lt;p&gt;While official K versions were made for commercial purposes, multiple open-source implementations are also available. Two actively maintained ones are &lt;a href=&quot;https://github.com/JohnEarnest/ok&quot; rel=&quot;nofollow noreferrer&quot;&gt;oK&lt;/a&gt; by John Earnest (JohnE), and &lt;a href=&quot;https://ngn.bitbucket.io/k/&quot; rel=&quot;nofollow noreferrer&quot;&gt;ngn/k&lt;/a&gt;. The &lt;a href=&quot;https://github.com/JohnEarnest/ok/blob/gh-pages/docs/Manual.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;oK manual&lt;/a&gt; is a particularly good resource to get started in K, and then you can choose to move to ngn/k without too much problem (the two are 99% compatible with each other). You can also ask any questions about programming in K in &lt;a href=&quot;https://chat.stackexchange.com/rooms/90748/the-k-tree&quot;&gt;the k tree&lt;/a&gt;, where multiple open-source K implementors (including JohnE and ngn) and other K users are regularly active.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is &lt;em&gt;the&lt;/em&gt; K language actually used in investment banks and hedge funds.&lt;/li&gt;&#xA;&lt;li&gt;It is a great example of iterations of language design, aimed at general purpose programming with a small set of built-in functions and easy-to-parse syntax. I'd especially recommend K to the CGCCers interested in making their own languages.&lt;/li&gt;&#xA;&lt;li&gt;The oK manual is an excellent resource for starters.&lt;/li&gt;&#xA;&lt;li&gt;Despite being relatively minimalistic in the list of built-ins (and being ASCII-only), K is often pretty competitive in code golf.&lt;/li&gt;&#xA;&lt;li&gt;K is also often pretty fast for an interpreted language.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Bounty&lt;/h2&gt;&#xA;&lt;p&gt;I (Bubbler) will award a +100 bounty for any user's first K answer posted during this month. A user doesn't qualify if they have posted a K answer before.&lt;/p&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://aplwiki.com/wiki/K&quot; rel=&quot;nofollow noreferrer&quot;&gt;APL Wiki article on K&lt;/a&gt;, &lt;a href=&quot;https://k.miraheze.org/wiki/Main_Page&quot; rel=&quot;nofollow noreferrer&quot;&gt;K wiki&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Shakti: &lt;a href=&quot;https://shakti.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Official homepage&lt;/a&gt;, &lt;a href=&quot;https://estradajke.github.io/k9-simples/k9/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;unofficial K9 tutorial&lt;/a&gt;, &lt;a href=&quot;https://kparc.com/k/&quot; rel=&quot;nofollow noreferrer&quot;&gt;browser REPL&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;oK: &lt;a href=&quot;https://github.com/JohnEarnest/ok&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub repo&lt;/a&gt;, &lt;a href=&quot;https://github.com/JohnEarnest/ok/blob/gh-pages/docs/Manual.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;manual&lt;/a&gt;, &lt;a href=&quot;http://johnearnest.github.io/ok/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;browser REPL&lt;/a&gt;, &lt;a href=&quot;https://tio.run/#k-ok&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt; (outdated)&lt;/li&gt;&#xA;&lt;li&gt;ngn/k: &lt;a href=&quot;https://codeberg.org/ngn/k&quot; rel=&quot;nofollow noreferrer&quot;&gt;Codeberg repo&lt;/a&gt;, &lt;a href=&quot;https://ngn.bitbucket.io/k/#r&quot; rel=&quot;nofollow noreferrer&quot;&gt;browser REPL&lt;/a&gt;, &lt;a href=&quot;https://ngn.bitbucket.io/k/&quot; rel=&quot;nofollow noreferrer&quot;&gt;browser interpreter&lt;/a&gt; (supports CGCC post format), &lt;a href=&quot;https://tio.run/#k-ngn&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt; (outdated)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/kparc/kcc&quot; rel=&quot;nofollow noreferrer&quot;&gt;k crash course&lt;/a&gt;, an alternative learning material&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/90748/the-k-tree&quot;&gt;the k tree&lt;/a&gt;, the SE chatroom dedicated to K&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-08-02T02:04:00.573" LastActivityDate="2021-08-18T09:13:16.580" Title="Language of the Month for August 2021: K" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23744" PostTypeId="2" ParentId="23743" CreationDate="2021-08-01T23:58:51.703" Score="6" Body="&lt;h1&gt;List of all K solutions posted in August 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/233014/100664&quot;&gt;Enlarge ASCII art, Mark II&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/a-username&quot;&gt;A username&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/226532/triangle-style-sequences/233070#233070&quot;&gt;Triangle-style sequences&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/92116/wasif&quot;&gt;wasif&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/233028/78410&quot;&gt;Connect Four Validator&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/233060/78410&quot;&gt;Build me a room&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/74062/traws&quot;&gt;Traws&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/233069/78410&quot;&gt;Build me a room&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/233077/custom-rows-of-smileys-triangle/233097#233097&quot;&gt;Custom Rows of Smileys Triangle&lt;/a&gt; by wasif&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/233169/95792&quot;&gt;Implement the Torian&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792/&quot;&gt;user&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/233287&quot;&gt;Print a 10 by 10 grid of asterisks&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/103854/pygamer0&quot;&gt;PyGamer0&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/233292/80214&quot;&gt;Generalized Fizzbuzz&lt;/a&gt; by Razetime&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/233511/78410&quot;&gt;Rows of the Collatz tree&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/233512/78410&quot;&gt;Boustrophedon transform&lt;/a&gt; by A username&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/233532/78410&quot;&gt;Could you massage this stack for me?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;List of all K tips posted in August 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;tip title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;List of K-related challenges posted in August 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/q/&amp;lt;question-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-08-18T09:13:16.580" LastActivityDate="2021-08-18T09:13:16.580" CommentCount="0" CommunityOwnedDate="2021-08-01T23:58:51.703" ContentLicense="CC BY-SA 4.0" />
  <row Id="23745" PostTypeId="2" ParentId="2140" CreationDate="2021-08-04T18:27:39.220" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/233171/eric-angelinis-1995-puzzle&quot;&gt;&lt;h1&gt;Eric Angelini's &amp;quot;1995&amp;quot; puzzle&lt;/h1&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="106352" LastEditorUserId="106352" LastEditDate="2021-08-06T16:21:37.303" LastActivityDate="2021-08-06T16:21:37.303" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23746" PostTypeId="1" CreationDate="2021-08-05T00:31:53.800" Score="3" ViewCount="87" Body="&lt;p&gt;My first question, &lt;a href=&quot;https://codegolf.stackexchange.com/q/212300/85527&quot;&gt;Find all integer pairs that produce a given Loeschian number&lt;/a&gt;, received 20 upvotes and 14 answers. I currently have one complicated challenge &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20444/85527&quot;&gt;sandboxed&lt;/a&gt;, and I recently posted a third challenge, &lt;a href=&quot;https://codegolf.stackexchange.com/q/232997/85527&quot;&gt;Flatten a parabola keeping the distances between points along the curve constant&lt;/a&gt;. At the time of writing, this challenge has 3 upvotes, 114 views and is unanswered after a week.&lt;/p&gt;&#xA;&lt;p&gt;Is there a way to get people to answer my third challenge? I'm worried that it might be too hard, should this be a concern when posting challenges?&lt;/p&gt;&#xA;" OwnerUserId="85527" LastEditorUserId="66833" LastEditDate="2021-08-05T00:54:35.103" LastActivityDate="2021-08-05T00:54:35.103" Title="Is my challenge too difficult? How do I get people to answer it?" Tags="|support|specific-question|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23747" PostTypeId="2" ParentId="23746" CreationDate="2021-08-05T00:45:49.017" Score="3" Body="&lt;h2&gt;Some questions get more votes, views and answers than others...&lt;/h2&gt;&#xA;&lt;p&gt;...and there's no tried and true way of telling what will happen for any given question&lt;span class=&quot;math-container&quot;&gt;\${}^*\$&lt;/span&gt;. For example, I have &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=user%3A66833+is%3Aq+answers%3A0&quot;&gt;2 unanswered questions&lt;/a&gt;, one of which is almost 4 years old.&lt;/p&gt;&#xA;&lt;p&gt;That said, it is true that easier challenges get more answers, and more answers will drive a question to the &lt;a href=&quot;https://stackexchange.com/questions?tab=hot&quot;&gt;Hot Network Questions&lt;/a&gt;, allowing it to get more votes. Harder challenges often miss out on these votes as, by the time someone answers them, they're too old for the HNQ.&lt;/p&gt;&#xA;&lt;p&gt;There are fortunately a number of ways you can increase activity on your challenge:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/set-bounties&quot;&gt;Start a bounty&lt;/a&gt;, which any user with 75 reputation or more can do. One of the bounty reasons we have is &lt;strong&gt;Draw more attention&lt;/strong&gt;, and starting the bounty bumps it to the &lt;a href=&quot;https://codegolf.stackexchange.com/questions?tab=Active&quot;&gt;top of the front page&lt;/a&gt;. Unfortunately, 50 reputation (the minimum) is a lot when you only have a few hundred, and it might not even result in answers or votes.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;Mention it in chat&lt;/a&gt;. Any user with 20 reputation or more across the network can chat, and bringing up your challenge is entirely on topic, and will draw some attention to it.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Bump it by editing it. Editing a post will move it to the top of the front page. I will sometimes reread my less active challenges and make minor tweaks to wordings, add in a new test case, etc. which will improve the challenge, and move it to the front page.&lt;/p&gt;&#xA;&lt;p&gt;Note that your edits should be somewhat substantive and improve the challenge. Just adding in a blank line, or an HTML comment, is necro-bumping, and we don't really like that&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Additionally, don't worry about challenges being &amp;quot;too hard&amp;quot;. In my personal opinion, we need more good, difficult challenges and fewer low-hanging fruit challenges, so I often upvote harder challenges. We also have a few users around who seem to &lt;em&gt;hate&lt;/em&gt; unanswered questions, no matter how hard they are, and will often post crazy answers to them.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sub&gt;&lt;span class=&quot;math-container&quot;&gt;\${}^*\$&lt;/span&gt;: Although the more challenges you see and post, the more you'll start to notice patterns. Easy challenges almost always get a flood of answers which push the to the HNQ where they attract more votes and answers. Harder challenges often take longer to be answered and so get fewer votes.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-08-05T00:45:49.017" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23748" PostTypeId="2" ParentId="23746" CreationDate="2021-08-05T00:47:40.310" Score="5" Body="&lt;h1&gt;Hard challenges can go unanswered for a very long time, but...&lt;/h1&gt;&#xA;&lt;p&gt;There are some ways to make your challenge more approachable.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Include sufficient background, and include some formula(s) that can be used to solve the challenge if possible. Adding some links to necessary knowledge (usually Wikipedia or Mathworld for mathematical concepts) also helps.&lt;/li&gt;&#xA;&lt;li&gt;Include some test cases. It makes an answerer easier to get confidence that their answer works (and therefore actually post it as an answer).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Also a minor note: contrary to common knowledge, our site is more active on weekdays than on weekends.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2021-08-05T00:47:40.310" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23750" PostTypeId="1" AcceptedAnswerId="23757" CreationDate="2021-08-05T10:40:03.883" Score="7" ViewCount="315" Body="&lt;p&gt;Let me put it simply: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/22276/introducing-biweekly-mini-golf&quot;&gt;BMG&lt;/a&gt;, which was a good idea at first, is dying, to the point that we're not scheduling new ones, we're not hearing about it, we forgot that there was meant to be one on Tuesday, we tried to schedule one same time today and forgot again.&lt;/p&gt;&#xA;&lt;p&gt;So, what should we do about this?&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="56656" LastEditDate="2021-09-05T17:58:32.740" LastActivityDate="2021-09-05T17:58:32.740" Title="BMG is slowly dying" Tags="|discussion|status-completed|chat|chat-events|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23751" PostTypeId="2" ParentId="23750" CreationDate="2021-08-05T13:43:53.673" Score="10" Body="&lt;p&gt;A couple of speculations and suggestions:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Activity has seemed low to me for the past while. Maybe this is my own bias, but I've noticed TNB seems to be having longer and more frequent periods of no messages. I think this is due to it being the summer now, and a lot of people are more active during weekdays that aren't holidays/vacation days, when people are at work or school (this is definitely a coincidence, by the way). Thus, a possibility is to just call it off for this and next time, and resume in September.&lt;/li&gt;&#xA;&lt;li&gt;Tracking the day and time is kind of annoying. Perhaps we could just put it on the 1st and 14th of every month (or some easy-to-remember cycle like that) and tracking the time shift is the only thing to really remember? Figuring out when it is only takes like a minute or two so this shouldn't really fix BMG dying.&lt;/li&gt;&#xA;&lt;li&gt;We could just replace BMG. The novelty is wearing off, and we have other chat event suggestions that we could do in its place; for example, the esolang showcase or the more recent similar suggestions, Learn-a-Lang.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-08-05T13:43:53.673" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23752" PostTypeId="2" ParentId="2140" CreationDate="2021-08-05T20:04:23.457" Score="2" Body="&lt;h1&gt;Pinpoint the typo!&lt;/h1&gt;&#xA;&lt;h3&gt;Task&lt;/h3&gt;&#xA;&lt;p&gt;Write a program that finds the location of an error in its own code!&lt;/p&gt;&#xA;&lt;p&gt;The program itself must output either nothing or an empty string (or an appropriate equivalent in your language).&lt;/p&gt;&#xA;&lt;p&gt;Let n be the length of the program in bytes, which must be at least 2.  For an integer k with 1&amp;lt;=k&amp;lt;=n, if the kth byte of the source code is deleted, then the resulting program should output the integer k (and nothing else), in as many cases as possible.&lt;/p&gt;&#xA;&lt;p&gt;Outputs may be 0-indexed if preferred, so that omitting the kth byte outputs k-1, but the choice of indexing must be consistent across all k.&lt;/p&gt;&#xA;&lt;p&gt;Error messages do not count as valid output unless they are of exactly the required form.&lt;/p&gt;&#xA;&lt;p&gt;Your score is the number of integers k for which the above condition is satisfied, divided by n.  Highest score wins, with ties broken by smallest n.&lt;/p&gt;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&lt;p&gt;Consider the program &lt;code&gt;blob()&lt;/code&gt; in a fictitious language.  Suppose that:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;blob()&lt;/code&gt; outputs nothing (this is a requirement)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;lob()&lt;/code&gt; outputs &lt;code&gt;1&lt;/code&gt; (right)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;bob()&lt;/code&gt; outputs &lt;code&gt;2&lt;/code&gt; (right)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;blb()&lt;/code&gt; outputs &lt;code&gt;3&lt;/code&gt; (right)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;blo()&lt;/code&gt; outputs &lt;code&gt;4&lt;/code&gt; (right)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;blob)&lt;/code&gt; outputs nothing (wrong)&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;blob(&lt;/code&gt; outputs &lt;code&gt;6: Syntax error&lt;/code&gt; (wrong)&lt;/p&gt;&#xA;&lt;p&gt;Then the score would be 4/6 = 0.66666667&lt;/p&gt;&#xA;" OwnerUserId="104303" LastActivityDate="2021-08-05T20:04:23.457" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="23754" PostTypeId="2" ParentId="2140" CreationDate="2021-08-06T05:24:41.550" Score="5" Body="&lt;h1&gt;Ouput Input... Forever&lt;/h1&gt;&#xA;&lt;h2&gt;Problem&lt;/h2&gt;&#xA;&lt;p&gt;Given input chars, output them repeatedly forever.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;abc       -&amp;gt; abcabcabcabcabcabcabcabcabc...&#xA;[1, 2, 3] -&amp;gt; [1, 2, 3][1, 2, 3][1, 2, 3]...&#xA;lo        -&amp;gt; lololololololololololololol...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Dedication:&lt;/strong&gt; This is for all the tarpits out there!&lt;/p&gt;&#xA;&lt;h2&gt;Questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should a delimiter be allowed?&lt;/li&gt;&#xA;&lt;li&gt;I was imagining that the input would be cycled through infinitely in order, like in the examples. Should we enforce that as a rule, though?&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Or should the rules just be: &lt;strong&gt;Each char of input should eventually occur infinitely many times in output.&lt;/strong&gt; (Informally stated, but can easily be made mathematically precise.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Other thoughts!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="87594" LastActivityDate="2021-08-06T05:24:41.550" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23755" PostTypeId="2" ParentId="2140" CreationDate="2021-08-06T14:38:25.120" Score="7" Body="&lt;h1&gt;Stronger and stronger radiation&lt;/h1&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-answer-chaining-tooltip-container&quot;&gt;answer-chaining&lt;/a&gt; challenge where answers create successively more radiation-hardened programs.&lt;/p&gt;&#xA;&lt;p&gt;The first answer will be a program that is at least 2 distinct bytes long that outputs &lt;code&gt;1&lt;/code&gt;, with an optional trailing newline, and nothing else. However, when any single character is removed, it should output &lt;code&gt;0&lt;/code&gt;. For example, if &lt;code&gt;abc&lt;/code&gt; outputs &lt;code&gt;1&lt;/code&gt;, then all of &lt;code&gt;bc&lt;/code&gt;, &lt;code&gt;ac&lt;/code&gt; and &lt;code&gt;ab&lt;/code&gt; should output &lt;code&gt;0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The second answer should then be a program that is at least 3 bytes long, with at least 2 distinct bytes, that outputs &lt;code&gt;2&lt;/code&gt;. When any single character is removed, it should output &lt;code&gt;1&lt;/code&gt;, and when any 2 characters are removed, it should output &lt;code&gt;0&lt;/code&gt;. So if &lt;code&gt;abcde&lt;/code&gt; outputs &lt;code&gt;2&lt;/code&gt;, then:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All of &lt;code&gt;bcde&lt;/code&gt;, &lt;code&gt;acde&lt;/code&gt;, &lt;code&gt;abde&lt;/code&gt;, &lt;code&gt;abce&lt;/code&gt; and &lt;code&gt;abcd&lt;/code&gt; should output &lt;code&gt;1&lt;/code&gt;, and&lt;/li&gt;&#xA;&lt;li&gt;All of &lt;code&gt;abc&lt;/code&gt;, &lt;code&gt;abd&lt;/code&gt;, &lt;code&gt;abe&lt;/code&gt;, &lt;code&gt;acd&lt;/code&gt;, &lt;code&gt;ace&lt;/code&gt;, &lt;code&gt;ade&lt;/code&gt;, &lt;code&gt;bcd&lt;/code&gt;, &lt;code&gt;bce&lt;/code&gt;, &lt;code&gt;bde&lt;/code&gt; and &lt;code&gt;cde&lt;/code&gt; should output &lt;code&gt;0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And so on such that the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th answer is a program that is at least &lt;span class=&quot;math-container&quot;&gt;\$n+1\$&lt;/span&gt; bytes long, with at least 2 distinct bytes, that outputs &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;. When any &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; bytes are removed for &lt;span class=&quot;math-container&quot;&gt;\$1 \le k \le n\$&lt;/span&gt;, it should output &lt;span class=&quot;math-container&quot;&gt;\$n-k\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Languages may be reused, but not in consecutive answers. Different versions of the same language count as the same language. You may not answer twice in a row, and you must wait an hour between answers.&lt;/p&gt;&#xA;&lt;p&gt;The last answer posted is the winner. This will update as new answers are posted, but the latest valid answer will be considered the current winner.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Is this clear enough?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Tags are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-answer-chaining-tooltip-container&quot;&gt;answer-chaining&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/radiation-hardening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-radiation-hardening-tooltip-container&quot;&gt;radiation-hardening&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-kolmogorov-complexity-tooltip-container&quot;&gt;kolmogorov-complexity&lt;/a&gt;. Any others?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Any additional feedback?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I'm concerned that this might be too difficult, and so it's unlikely that more than 2 or 3 answers will be posted. I'm considering changing it to:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; answer is a program that is at least &lt;span class=&quot;math-container&quot;&gt;\$n + 1\$&lt;/span&gt; bytes long that outputs &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;. When any &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; bytes are removed, it should output &lt;span class=&quot;math-container&quot;&gt;\$n-1\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Thoughts?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2023-08-05T14:08:36.010" LastActivityDate="2023-08-05T14:08:36.010" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23756" PostTypeId="2" ParentId="23750" CreationDate="2021-08-07T00:21:50.623" Score="4" Body="&lt;p&gt;A part of this, in my opinion, is because we don't have enough interesting CMCs. Last time, we rushed to make new ones after it started. To remedy this, I propose we encourage people to post CMCs at any time, way before the BMG starts, so that there's enough good ideas and ample time to vote on them.&lt;/p&gt;&#xA;" OwnerUserId="95792" LastActivityDate="2021-08-07T00:21:50.623" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23757" PostTypeId="2" ParentId="23750" CreationDate="2021-08-07T01:12:14.830" Score="9" Body="&lt;h2&gt;BMG's time &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/58823824#58823824&quot;&gt;has now been changed&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Me and Redwolf agree that the time and day cycle for BMG was difficult to keep track of, and this made it too easy to miss, and difficult to register for. We've decided to change the times it occurs on.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;BMG will now take place every other Wednesday, alternating between 12am UTC and 12pm UTC&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;We figured these times would fit decently with most users, while making it easier to keep track of. These have also been added as &lt;a href=&quot;https://chat.stackexchange.com/rooms/info/240/the-nineteenth-byte?tab=schedule&quot;&gt;two scheduled events&lt;/a&gt; which are recurring. You can register for either of them, and you'll receive a chat ping 30 minutes before the event will begin to let you know, and this ping will happen every four weeks (per event), so you don't have to re-register for each new BMG.&lt;/p&gt;&#xA;&lt;p&gt;The next BMG is scheduled for the 11th of August, at 00:00 UTC.&lt;/p&gt;&#xA;&lt;p&gt;Fingers crossed this improves activity a bit!&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-08-07T01:12:14.830" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23759" PostTypeId="2" ParentId="2140" CreationDate="2021-08-07T10:38:02.580" Score="3" Body="&lt;h1&gt;Visual Encoding&lt;/h1&gt;&#xA;&lt;p&gt;I want to create a program to randomize certain words, however, I would like all the swapped letters to have the same form factor as the previous one.&lt;/p&gt;&#xA;&lt;h4&gt;Challenge&lt;/h4&gt;&#xA;&lt;p&gt;Given a string of only lowercase letters (and no spaces), randomize its letters according to the following groups:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1: acemnorsuvwxz&#xA;2: bdfhiklt&#xA;3: gpqy&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Each letter cannot be transformed into the same letter as it started as. Additionally, choosing the new character must be uniformly random (within codegolf guidelines).&lt;/p&gt;&#xA;&lt;p&gt;One final thing is that for the letter &lt;code&gt;j&lt;/code&gt;, it must be transformed into either group 2 or group 3, and this can be done by either:&lt;/p&gt;&#xA;&lt;p&gt;Uniformly choosing between each group and then uniformly choosing a letter &lt;strong&gt;or&lt;/strong&gt; Uniformly choosing between any of the letters in both groups&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Note that nothing can turn into &lt;code&gt;j&lt;/code&gt; itself.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h4&gt;Examples&lt;/h4&gt;&#xA;&lt;pre&gt;&lt;code&gt;helloworld -&amp;gt; kadfrszmhl&#xA;jamaica -&amp;gt; genokac&#xA;jamaica -&amp;gt; penokac&#xA;abpj -&amp;gt; odyt&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so the goal is to create the shortest answer in bytes.&lt;/p&gt;&#xA;" OwnerUserId="99035" LastActivityDate="2021-08-07T10:38:02.580" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23760" PostTypeId="2" ParentId="2140" CreationDate="2021-08-07T14:25:53.920" Score="3" Body="&lt;h1&gt;Find the necessary Files&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot;&gt;test-battery&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/black-box-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;black-box-function&amp;#39;&quot; rel=&quot;tag&quot;&gt;black-box-function&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Let's assume you have program that needs &lt;em&gt;some&lt;/em&gt; of the files in a given folder to run. But not all the files in this folder are actually necessary. You can only find out which are necessary be removing/adding files from/to that folder, running the program and then observing whether it runs or throws or fails. The goal is finding exactly the necessary set of files with the minimial number of calls to the program.&lt;/p&gt;&#xA;&lt;p&gt;Let's formalize it a little bit:&lt;/p&gt;&#xA;&lt;p&gt;You are given a black-box-function &lt;span class=&quot;math-container&quot;&gt;\$ f: \{0,1\}^n \to \{0,1\} \$&lt;/span&gt; that is of the form &lt;span class=&quot;math-container&quot;&gt;\$f(x_1, \dots, x_n) = \prod_{i \in I} x_i\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$I\subseteq \{1,2,3,\ldots,n\}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your goal is finding &lt;span class=&quot;math-container&quot;&gt;\$I\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your program may only interact with &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; by evaluating it at various &lt;span class=&quot;math-container&quot;&gt;\$x \in \{0,1\}^n\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your score is &lt;span class=&quot;math-container&quot;&gt;\$ S= \prod_{m=1}^M (1+s_k)\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$s_k\$&lt;/span&gt; is the number of evaluations of &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; you needed for the example &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; in the test battery. The least score wins.&lt;/p&gt;&#xA;&lt;h3&gt;Test Battery&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;META:&lt;/strong&gt; Not sure yet if I should explicitly define a test battery or just let participants iterate through &lt;em&gt;all&lt;/em&gt; possible functions up to some &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;In the following list, the first column represents &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; (the number of arguments) followed by the set &lt;span class=&quot;math-container&quot;&gt;\$I\$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;n  | I&#xA;3  | 1&#xA;3  | 1 3&#xA;3  | 1 2 3&#xA;4  | 2 3 4&#xA;10 | 1 3 5 6 7 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The last entry for instance represents the function &lt;span class=&quot;math-container&quot;&gt;\$ f(x_1, x_2, \ldots x_{10}) = x_1 \cdot x_3 \cdot x_5 \cdot x_6 \cdot x_7 \cdot x_9\$&lt;/span&gt;&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2021-08-07T22:15:05.520" LastActivityDate="2021-08-07T22:15:05.520" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23763" PostTypeId="2" ParentId="2140" CreationDate="2021-08-08T17:01:48.923" Score="2" Body="&lt;h1&gt;IATA Airport Codes &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; rel=&quot;tag&quot;&gt;compression&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Out of &lt;strong&gt;17576&lt;/strong&gt; alphabetical triplets, to this day, &lt;strong&gt;9144&lt;/strong&gt; are used as &lt;a href=&quot;https://en.wikipedia.org/wiki/IATA_airport_code&quot; rel=&quot;nofollow noreferrer&quot;&gt;IATA airport codes&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Given a 3-letter string, tell whether it appears in &lt;a href=&quot;https://gist.github.com/UHJ5cCdqYXQn/a348d02d64805053d26728511aefc923&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;&lt;strong&gt;the list&lt;/strong&gt;&lt;/em&gt;&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The &lt;strong&gt;input&lt;/strong&gt; string is &lt;em&gt;mixed-case&lt;/em&gt; by default, but you can restrict it to &lt;em&gt;non-mixed-case&lt;/em&gt; or &lt;em&gt;lower-case&lt;/em&gt; or &lt;em&gt;upper-case&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;To &lt;strong&gt;output&lt;/strong&gt; the affirmative/negative outcome you should use:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;truthy/falsy according to your language's convention (swapping is allowed), or&lt;/li&gt;&#xA;&lt;li&gt;one consistent value as either affirmative or negative, and any other value as the other&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;sub&gt;&lt;em&gt;The list was scraped from &lt;a href=&quot;https://www.iata.org/en/publications/directories/code-search/&quot; rel=&quot;nofollow noreferrer&quot;&gt;iata.org&lt;/a&gt; on 2021-08-07&lt;/em&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is there something that needs to be specified/clarified?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="94346" LastEditorUserId="94346" LastEditDate="2021-08-08T23:42:45.927" LastActivityDate="2021-08-08T23:42:45.927" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23764" PostTypeId="2" ParentId="2140" CreationDate="2021-08-08T23:16:39.877" Score="1" Body="&lt;h1&gt;Which in and out shuffles do I need?&lt;/h1&gt;&#xA;&lt;p&gt;If you watch Matt Parker's latest video as of time of writing, you'll know that for any given start and end position, there is a sequence of six in and out shuffles that will move the card at the start position &lt;span class=&quot;math-container&quot;&gt;\$ p \$&lt;/span&gt; to the end position &lt;span class=&quot;math-container&quot;&gt;\$ q \$&lt;/span&gt;. One method is to use the 0-indexed formula from the video: Express &lt;span class=&quot;math-container&quot;&gt;\$ 64p-q \$&lt;/span&gt; in the form &lt;span class=&quot;math-container&quot;&gt;\$ 52t-s \$&lt;/span&gt; for the smallest positive integers &lt;span class=&quot;math-container&quot;&gt;\$ t \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$ s \$&lt;/span&gt;, and then take the bitwise XOR of &lt;span class=&quot;math-container&quot;&gt;\$ s \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$ t \$&lt;/span&gt; as a 6-bit binary integer. For instance, to move the card from position &lt;span class=&quot;math-container&quot;&gt;\$ 16 \$&lt;/span&gt; to position &lt;span class=&quot;math-container&quot;&gt;\$ 22 \$&lt;/span&gt;, we have &lt;span class=&quot;math-container&quot;&gt;\$ 16 \times 64 - 22 = 1002 = 20 \times 52 - 38 \$&lt;/span&gt;, so the result is the bitwise XOR of &lt;span class=&quot;math-container&quot;&gt;\$ 20 \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$ 38 \$&lt;/span&gt;, which is &lt;span class=&quot;math-container&quot;&gt;\$ 50_{10} \$&lt;/span&gt; or &lt;span class=&quot;math-container&quot;&gt;\$ 110010_2 \$&lt;/span&gt;, so you need two in-shuffles, two out-shuffles, an in-shuffle and an out-shuffle.&lt;/p&gt;&#xA;&lt;p&gt;Given the start and end position, which you can take as 0- or 1-indexed as you prefer, output the list of shuffles required. You don't have to output a list of six shuffles, but you cannot use more than six shuffles, and if your output is variable length you need to indicate the length in some way. You can use any two distinct symbols to indicate the two types of shuffles, except you can't use &lt;code&gt;1&lt;/code&gt; or &lt;code&gt;I&lt;/code&gt; for out-shuffles or &lt;code&gt;0&lt;/code&gt; or &lt;code&gt;O&lt;/code&gt; for in-shuffles, as that would be too confusing.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="97857" LastEditDate="2021-08-10T11:04:32.723" LastActivityDate="2021-08-10T11:04:32.723" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23765" PostTypeId="2" ParentId="2140" CreationDate="2021-08-09T03:19:12.173" Score="1" Body="&lt;h1&gt;Prove NL=coNL&lt;/h1&gt;&#xA;&lt;h2&gt;Description&lt;/h2&gt;&#xA;&lt;p&gt;One of the achievements of complexity theory is showing that NL, the set of problems with solutions that can be &lt;em&gt;verified&lt;/em&gt; in logarithmic space, is the same as coNL, the set of problems which can be verified to have no solution in logarithmic space (i.e. the set of problems whose complement is in NL). Your task is to implement a logarithmic-space verifier for the complement of the NL-complete problem &amp;quot;graph connectivity.&amp;quot; More precisely, you will be given a directed graph &lt;span class=&quot;math-container&quot;&gt;\$ G \$&lt;/span&gt; in adjacency matrix format, as well as two vertices &lt;span class=&quot;math-container&quot;&gt;\$ s \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt;. Then, you may read some input from STDIN, which you should interpret as a &amp;quot;proof&amp;quot; &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; that &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt; are &lt;em&gt;not&lt;/em&gt; connected (i.e. there is no path from &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt;). Finally, you must output whether &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; is a valid proof of the fact that &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt; are disconnected in &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt;. All of this must happen using &lt;span class=&quot;math-container&quot;&gt;\$O(\log n)\$&lt;/span&gt; extra space, where &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is the size of the adjacency matrix of &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You will write a function that takes &lt;span class=&quot;math-container&quot;&gt;\$(G, s, t)\$&lt;/span&gt; as inputs. Here, &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt; is a 2d &lt;span class=&quot;math-container&quot;&gt;\$\ell\times\ell\$&lt;/span&gt; array, and the vertices are integers less than &lt;span class=&quot;math-container&quot;&gt;\$\ell\$&lt;/span&gt;. If &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$j\$&lt;/span&gt; are less than &lt;span class=&quot;math-container&quot;&gt;\$\ell\$&lt;/span&gt;, then &lt;code&gt;G[i][j]&lt;/code&gt; is truthy (you can decide exactly which truthy value) if there is an edge from &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$j\$&lt;/span&gt;, and falsy otherwise.&lt;/li&gt;&#xA;&lt;li&gt;You may not write to the array &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt;, but it does not count towards your memory usage limit of &lt;span class=&quot;math-container&quot;&gt;\$O(\log n)\$&lt;/span&gt;. Be careful about making copies of the array, e.g. &lt;code&gt;G.map(x =&amp;gt; ...)&lt;/code&gt; in javascript would not be allowed, because it makes a copy of &lt;code&gt;G&lt;/code&gt;, which uses too much extra memory.&lt;/li&gt;&#xA;&lt;li&gt;You can decide the format of the input from STDIN; there are no restrictions, other than the fact that for every input &lt;span class=&quot;math-container&quot;&gt;\$(G, s, t)\$&lt;/span&gt;, if &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt; really are disconnected, there must be some proof that works, and conversely, if &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt; are connected, no proof should be accepted.&lt;/li&gt;&#xA;&lt;li&gt;To be clear, when &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt; really are disconnected, you can think of the proof as &amp;quot;maximally helpful,&amp;quot; as though the input wants to prove that &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt; are disconnected. However, if they are connected, the proof is adversarial. It is trying to trick you into reporting that the vertices are disconnected when they really aren't.&lt;/li&gt;&#xA;&lt;li&gt;Pretend that the native integer type of your language is unbounded. On the other hand, for the purposes of counting memory, an integer requires &lt;span class=&quot;math-container&quot;&gt;\$O(\log |i|)\$&lt;/span&gt; memory, where &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt; is the value of the integer, because it requires that many bits to store.&lt;/li&gt;&#xA;&lt;li&gt;Rather than reading input from STDIN, you may receive the proof &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; from user input in another way (e.g. repeated &lt;code&gt;prompt&lt;/code&gt; calls in javascript). If your language supports it, you may choose to receive the proof in the form of an &amp;quot;input stream&amp;quot; &lt;code&gt;I&lt;/code&gt;, as long as the following restrictions are on the &amp;quot;input stream&amp;quot;: you should not be able to have random access to the proof's contents (i.e. access the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th byte without first getting the first &lt;span class=&quot;math-container&quot;&gt;\$n-1\$&lt;/span&gt; bytes), and once you read a byte or some bytes, they should be &amp;quot;forgotten&amp;quot; unless you explicitly save it (and if you save it, it counts towards your &lt;span class=&quot;math-container&quot;&gt;\$O(\log n)\$&lt;/span&gt; limit). Thus, for example, an array would &lt;em&gt;not&lt;/em&gt; be acceptable, since it has random access, but it would be acceptable to accept a function &lt;code&gt;I&lt;/code&gt; which returns the next byte of the &amp;quot;simulated input&amp;quot; every time you call it.&lt;/li&gt;&#xA;&lt;li&gt;If your program throws an error, you may count that as equivalent to returning false (i.e. &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; is not a valid proof).&lt;/li&gt;&#xA;&lt;li&gt;Your program may exceed the space constraints when &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; is an invalid proof, since as Anders Kaseorg pointed out, such a program can easily be converted into one which meets the space requirements always.&lt;/li&gt;&#xA;&lt;li&gt;Fewest bytes wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Algorithm&lt;/h2&gt;&#xA;&lt;p&gt;An algorithm is given in section 7 of &lt;a href=&quot;https://lucatrevisan.github.io/teaching/cs172-15/notenl.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; (or is easily found on Google), but I will briefly describe it here for convenience (you do not have to use this algorithm/format):&lt;/p&gt;&#xA;&lt;p&gt;We will ask the proof to build a sequence &lt;span class=&quot;math-container&quot;&gt;\$r_0, r_1, \dots r_\ell\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$\ell\$&lt;/span&gt; is the number of vertices, such that &lt;span class=&quot;math-container&quot;&gt;\$r_i\$&lt;/span&gt; gives the number of vertices reacheable from &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; in at most &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt; steps. Initialize &lt;span class=&quot;math-container&quot;&gt;\$r_0 = 1\$&lt;/span&gt;. Then, given &lt;span class=&quot;math-container&quot;&gt;\$r_i\$&lt;/span&gt;, the proof gives  a claim of what &lt;span class=&quot;math-container&quot;&gt;\$r_{i+1}\$&lt;/span&gt; should be. It proves this claim by claiming for each vertex &lt;span class=&quot;math-container&quot;&gt;\$v\$&lt;/span&gt; whether &lt;span class=&quot;math-container&quot;&gt;\$v\$&lt;/span&gt; is reachable in &lt;span class=&quot;math-container&quot;&gt;\$i+1\$&lt;/span&gt; steps from &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt;. In either case, for each vertex, the proof lists all &lt;span class=&quot;math-container&quot;&gt;\$r_i\$&lt;/span&gt; vertices along with the paths used to get there. We verify that &lt;span class=&quot;math-container&quot;&gt;\$r_i\$&lt;/span&gt; distinct vertices have been listed, and that at least one of them (or none of them) is connected to &lt;span class=&quot;math-container&quot;&gt;\$v\$&lt;/span&gt;, depending on what was claimed. Then, when we are proving &lt;span class=&quot;math-container&quot;&gt;\$r_\ell\$&lt;/span&gt;, we check that &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt; is not one of the vertices that can be reached from &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;Ideally, you would write a separate program that takes an input &lt;span class=&quot;math-container&quot;&gt;\$(G, s, t)\$&lt;/span&gt; and outputs a possible proof &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; if &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt; are disconnected; this just makes testing easier, and it does not count towards your total bytes.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;G s t --&amp;gt; are_disconnected&#xA;[[0,0,0,0],[1,0,1,0],[0,1,0,1],[0,1,1,0]] 0 3 --&amp;gt; true&#xA;[[0,1,1],[0,0,1],[1,1,0]] 1 0 --&amp;gt; false&#xA;[[0,0],[0,0]] 1 1 --&amp;gt; false&#xA;[[0,0,1,1],[0,0,1,0],[0,1,0,1],[0,0,1,0]] 1 0 --&amp;gt; true&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here, &lt;code&gt;true&lt;/code&gt; should be interpreted as there is a valid proof that &lt;code&gt;s&lt;/code&gt; and &lt;code&gt;t&lt;/code&gt; are disconnected, whereas &lt;code&gt;false&lt;/code&gt; is interpreted as there is no valid proof.&lt;/p&gt;&#xA;" OwnerUserId="23550" LastActivityDate="2021-08-09T03:19:12.173" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23766" PostTypeId="2" ParentId="2140" CreationDate="2021-08-11T07:18:14.393" Score="2" Body="&lt;h1&gt;Sum of 3 Vectors&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;number-theory&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Question&lt;/h2&gt;&#xA;&lt;p&gt;Given 3 vectors &lt;code&gt;a, b, c&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Find &lt;strong&gt;integer&lt;/strong&gt; &lt;code&gt;(n, m, r)&lt;/code&gt; where &lt;code&gt;a*n+b*m+c*r = 0&lt;/code&gt; and &lt;code&gt;n,m,r&lt;/code&gt; are all &lt;strong&gt;not equal to 0&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;your answer group &lt;code&gt;(n, m, r)&lt;/code&gt; must be the closest valid group to 0, calculate by adding abs value together: &lt;code&gt;|n|+|m|+|r|&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;You can assume that 3 vectors do not parallel&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Test case&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;work in progress&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;no Standard loopholes&lt;/li&gt;&#xA;&lt;li&gt;any I/O case allowed, as long as it's clear and mostly understandable.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Score&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Lowest byte count per language wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;p&gt;any extra tag?&lt;/p&gt;&#xA;&lt;p&gt;suggestions?&lt;/p&gt;&#xA;&lt;p&gt;Rename question?&lt;/p&gt;&#xA;" OwnerUserId="101762" LastEditorUserId="101762" LastEditDate="2021-08-16T01:10:50.267" LastActivityDate="2021-08-16T01:10:50.267" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23770" PostTypeId="2" ParentId="2140" CreationDate="2021-08-12T07:19:31.720" Score="0" Body="&lt;h1&gt;Reverse cadaddadadaddddaddddddr&lt;/h1&gt;&#xA;&lt;p&gt;The Lisp language has a family of functions &lt;code&gt;car&lt;/code&gt;, &lt;code&gt;cdr&lt;/code&gt;, &lt;code&gt;cadr&lt;/code&gt;, etc for accessing arrays. For each one, an &lt;code&gt;a&lt;/code&gt; defines taking the first item of an array, and a &lt;code&gt;d&lt;/code&gt; defines taking the rest.&lt;/p&gt;&#xA;&lt;p&gt;For example, running &lt;code&gt;cadr&lt;/code&gt; on &lt;code&gt;[[1,3,4],5,7]&lt;/code&gt; will return &lt;code&gt;[3,4]&lt;/code&gt; as the &lt;code&gt;a&lt;/code&gt; gets the first item (&lt;code&gt;[1,3,4]&lt;/code&gt;) and the &lt;code&gt;d&lt;/code&gt; removes the first item.&lt;/p&gt;&#xA;&lt;p&gt;We've already had a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/221344/cadaddadadaddddaddddddr-linked-list-accessing&quot;&gt;challenge&lt;/a&gt; regarding running a &lt;code&gt;cadaddadadaddddaddddddr&lt;/code&gt; on a list, but what about the reverse?&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to, given a string of the type above (starting with a &lt;code&gt;c&lt;/code&gt;, ending with a &lt;code&gt;r&lt;/code&gt;, with only &lt;code&gt;ad&lt;/code&gt; in the middle), and a single value, create an array such that running the string as a &lt;code&gt;cadaddadadaddddaddddddr&lt;/code&gt; on the array returns said value.&lt;/p&gt;&#xA;&lt;p&gt;For example, given the input &lt;code&gt;cadar, 1&lt;/code&gt; a possible output could be &lt;code&gt;[[0,[1]]]&lt;/code&gt; since running &lt;code&gt;cadar&lt;/code&gt; on that gives 1.&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, shortest wins!&lt;/p&gt;&#xA;&lt;h1&gt;Testcases&lt;/h1&gt;&#xA;&lt;p&gt;These are possible outputs, all that matters is that your program  returns an array which works for the condition.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;car, 3 =&amp;gt; [3]&#xA;cdddar, 5 =&amp;gt; [0,0,0,5]&#xA;cadadadadar, 4 =&amp;gt; [[0,[0,[0,[0,[4]]]]]]&#xA;caaaaaaaaar, 2 =&amp;gt; [[[[[[[[[[2]]]]]]]]]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Let me know if any of these are wrong.&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2021-08-13T22:06:10.310" LastActivityDate="2021-08-13T22:06:10.310" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="23771" PostTypeId="1" CreationDate="2021-08-12T19:16:16.443" Score="21" ViewCount="1457" Body="&lt;p&gt;We've decided we'd like to give &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/23738/66833&quot;&gt;the &amp;quot;Learn You a Lang for Great Good&amp;quot; chat event &lt;/a&gt;&lt;span class=&quot;math-container&quot;&gt;\${}^*\$&lt;/span&gt; a go. As a brief overview:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Every second Wednesday, discussion in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; is primarily about a specific programming language. This includes &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12538/66833&quot;&gt;CMCs&lt;/a&gt; that are relevant to the language in some way, discussion and questions about that language, and anything else that directly relates to the language in some way&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Ideally, this also includes having a couple of users around who are familiar with the language to help others learn and provide some basic information. Exactly what role these users have (hands-on teaching, just watching and answering questions, etc.) is up to them.&lt;/p&gt;&#xA;&lt;p&gt;An event was &lt;a href=&quot;https://chat.stackexchange.com/rooms/info/240/the-nineteenth-byte?tab=schedule&quot;&gt;added the TNB schedule&lt;/a&gt; that runs every second Wednesday, starting from the 1st of September 2021, and lasting for 24 hours, from 00:00UTC to 23:59UTC.&lt;/p&gt;&#xA;&lt;p&gt;This thread is for nominating languages. Unlike &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/66833&quot;&gt;Language of the Month&lt;/a&gt;, this event isn't primarily intended to showcase languages. Instead:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Please nominate languages that either you'd like to learn more about, or that you'd think others would like to learn about, and&lt;/li&gt;&#xA;&lt;li&gt;Please vote on languages &lt;strong&gt;you'd like to learn&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This in an effort to avoid the most popular languages on the site &amp;quot;dominating&amp;quot; this event, and to give space to languages that have been overlooked or underused. That said, ultimately, please vote how you feel is most appropriate.&lt;/p&gt;&#xA;&lt;p&gt;Please also include some justification for why you believe the language would be a good language for people to learn, and why they'd be interested in learning it.&lt;/p&gt;&#xA;&lt;p&gt;Each time the event occurs, the people in chat when the event begins will pick one of the nominees here to Learn for Great Good. The highest-voted language is not always selected; for example, it may be deferred till a later date if someone familiar with the language is not available that week.&lt;/p&gt;&#xA;&lt;p&gt;Past languages:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;September 1, 2021: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=59030516#59030516&quot;&gt;Quipu&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;September 15, 2021: &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/59146441#59146441&quot;&gt;&amp;gt;&amp;lt;&amp;gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;September 29, 2021: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=59254132#59254132&quot;&gt;Cascade&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;October 13, 2021: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=59349942#59349942&quot;&gt;BQN&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;October 27, 2021: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=59455907#59455907&quot;&gt;Underload&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;November 10, 2021: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=59567351#59567351&quot;&gt;///&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;November 24, 2021: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=59686344#59686344&quot;&gt;zsh&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;December 8, 2021: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=59820454#59820454&quot;&gt;Lost&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;December 22, 2021: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=59950940#59950940&quot;&gt;Also zsh???&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;January 5, 2022: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=60055266#60055266&quot;&gt;Stack Cats&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;January 19, 2022: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=60188391#60188391&quot;&gt;Vyxal&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;February 1, 2022: &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/60318906#60318906&quot;&gt;Scala?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;February 15-17, 2022: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=60440163#60440163&quot;&gt;Possibly dc?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;March 1, 2022: &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/60552570#60552570&quot;&gt;Desmos&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;March 16, 2022: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=60655706#60655706&quot;&gt;Haskell&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;March 30, 2022: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=60767258#60767258&quot;&gt;Piet&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;April 13, 2022: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=60877203#60877203&quot;&gt;tinylisp&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;April 27, 2022: &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/60980566#60980566&quot;&gt;Nothing&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;May 11, 2022: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=61096222#61096222&quot;&gt;BitCycle&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;May 24, 2022: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=61208104#61208104&quot;&gt;rSNBATWPL&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;June 8, 2022: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=61306490#61306490&quot;&gt;Pip&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;June 22, 2022: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=61415640#61415640&quot;&gt;People&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=61425146#61425146&quot;&gt;being&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=61415654#61415654&quot;&gt;indecisive&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;July 6, 2022: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=61521937#61521937&quot;&gt;Flobnar&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;July 20, 2022: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=61623140#61623140&quot;&gt;Nothing&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;August 3, 2022: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=61714198#61714198&quot;&gt;Jellyfish&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;August 17, 2022: &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/61802897#61802897&quot;&gt;Coconut&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;August 31, 2022: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=61898242#61898242&quot;&gt;Coconut&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;September 14, 2022: &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/61995840#61995840&quot;&gt;Labyrinth&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;September 28, 2022: &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/62091549#62091549&quot;&gt;Nothing&lt;/a&gt; / &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/62091820#62091820&quot;&gt;J&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;October 12, 2022: &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/62179109#62179109&quot;&gt;Fig&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\${}^*\$&lt;/span&gt;: Name chosen in &lt;a href=&quot;https://chat.stackexchange.com/rooms/128500/name-of-new-chat-event&quot;&gt;this poll&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="16766" LastEditDate="2022-10-12T05:04:16.727" LastActivityDate="2022-10-12T05:04:16.727" Title="Language nominations for the &quot;Learn You a Lang for Great Good&quot; chat event" Tags="|discussion|chat|chat-events|" AnswerCount="14" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23772" PostTypeId="2" ParentId="23771" CreationDate="2021-08-12T19:18:15.167" Score="2" Body="&lt;h1&gt;Jelly&lt;/h1&gt;&#xA;&#xA;" OwnerUserId="79857" LastActivityDate="2021-08-12T19:18:15.167" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23773" PostTypeId="2" ParentId="23771" CreationDate="2021-08-12T19:20:00.017" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://fsharp.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;F#&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Its syntax is pretty lightweight, like Haskell's (although it looks like it's less concise). Looks like it'd be an interesting language to golf in, but there aren't a lot of F# answers here.&lt;/p&gt;&#xA;" OwnerUserId="95792" LastActivityDate="2021-08-12T19:20:00.017" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23780" PostTypeId="2" ParentId="2140" CreationDate="2021-08-12T22:42:28.810" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/234995/display-a-number-in-toki-pona&quot;&gt;Display a number in Toki Pona&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="105312" LastEditorUserId="100664" LastEditDate="2021-09-05T22:44:26.443" LastActivityDate="2021-09-05T22:44:26.443" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23782" PostTypeId="5" CreationDate="2021-08-12T23:51:25.003" Score="0" Body="&lt;p&gt;Chat events are scheduled events that happen in chat, most often in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;. This tag is intended to group discussions about these events together.&lt;/p&gt;&#xA;&lt;p&gt;For the currently scheduled events, check &lt;a href=&quot;https://chat.stackexchange.com/rooms/info/240/the-nineteenth-byte?tab=schedule&quot;&gt;TNB's schedule&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This tag should always be used with the &lt;a href=&quot;/questions/tagged/chat&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chat&amp;#39;&quot; rel=&quot;tag&quot;&gt;chat&lt;/a&gt; tag. Additionally, proposals for new chat events should use the &lt;a href=&quot;/questions/tagged/discussion&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt; tags&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-08-12T23:51:25.003" LastActivityDate="2021-08-12T23:51:25.003" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23783" PostTypeId="4" CreationDate="2021-08-12T23:51:25.003" Score="0" Body="Scheduled events that take place in chat, typically The Nineteenth Byte" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-08-12T23:51:25.003" LastActivityDate="2021-08-12T23:51:25.003" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23789" PostTypeId="2" ParentId="2140" CreationDate="2021-08-13T21:10:20.820" Score="0" Body="&lt;h1&gt;Determine the length of a Puyo Puyo chain&lt;/h1&gt;&#xA;&lt;p&gt;Puyo Puyo is a Japanese tile-matching puzzle game currently developed by Sega. The gameplay seems simple but it is actually quite complex.&lt;/p&gt;&#xA;&lt;p&gt;You have a 12x6 board which you can fill with various colors (typically red, green, blue, yellow, and purple) of Puyo (round slime-like creatures with eyes). Each turn, you control a pair of Puyo that you can manipulate and place on the board not unlike Tetris.&lt;/p&gt;&#xA;&lt;p&gt;When a pair is placed, gravity is applied to the board. If there is an empty gap underneath one or more Puyo in a column, they fall to fill the gap.&lt;/p&gt;&#xA;&lt;p&gt;When two Puyo of the same color are adjacent to each other, they link together. When 4 or more Puyo are linked, they pop (disappear). After a group of Puyo pops, if gravity causes another group to pop, then you have created a chain. The goal of Puyo Puyo is to place Puyo so that you create as long of a chain as possible to overwhelm your opponent with nuisance Puyo.&lt;/p&gt;&#xA;&lt;p&gt;Nuisance Puyo are a special case - they are colorless (usually gray or transparent), but more importantly they do not link together. Instead, they pop when an adjacent colored Puyo pops.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a Puyo Puyo board in any reasonable format (12 lines of 6 character strings, a 12x6 matrix of characters/numbers, 12 6-character strings in an array, etc.) output the chain length as a number. Standard loopholes apply.&lt;/p&gt;&#xA;&lt;p&gt;This is code-golf, so shortest source code wins.&lt;/p&gt;&#xA;&lt;p&gt;Bonus: In Puyo Puyo Tsuu, a hidden 13th row was added above the playfield to allow for longer chains. You will get a -5% score bonus if your program can optionally accept a 13th row.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; Intermediate board states are shown to demonstrate the game mechanics; you are not required to output them.&lt;/p&gt;&#xA;&lt;p&gt;Key: &lt;strong&gt;R&lt;/strong&gt;ed, &lt;strong&gt;G&lt;/strong&gt;reen, &lt;strong&gt;B&lt;/strong&gt;lue, &lt;strong&gt;Y&lt;/strong&gt;ellow, &lt;strong&gt;P&lt;/strong&gt;urple, &lt;strong&gt;N&lt;/strong&gt;uisance, &lt;strong&gt;.&lt;/strong&gt; empty&lt;/p&gt;&#xA;&lt;p&gt;Output: &lt;code&gt;4&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;...... ...... ...... ...... ......&#xA;...... ...... ...... ...... ......&#xA;...... ...... ...... ...... ......&#xA;...... ...... ...... ...... ......&#xA;......&amp;gt;......&amp;gt;......&amp;gt;......&amp;gt;......&#xA;...... ...... ...... ...... ......&#xA;...... ...... ...... ...... ......&#xA;...... ...... ...... ...... ......&#xA;..GBR. ...BR. ....R. ...... ......&#xA;..RGBR ...GBR ....BR .....R ......&#xA;..RGBR ...GBR ....BR .....R ......&#xA;.RRGBR ..GGBR ...BBR ....RR ......&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output: &lt;code&gt;4&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;...... ...... ...... ...... ......&#xA;...... ...... ...... ...... ......&#xA;...... ...... ...... ...... ......&#xA;...... ...... ...... ...... ......&#xA;......&amp;gt;......&amp;gt;......&amp;gt;......&amp;gt;......&#xA;.G.... ...... ...... ...... ......&#xA;YG.... ...... ...... ...... ......&#xA;NGY... ..Y... ..Y... ...... ......&#xA;NGR... Y.R... ..R... ..Y... ......&#xA;YBR... YBR... ..R... ..R... ......&#xA;YYBR.. YYBR.. .BBR.. ..RR.. ......&#xA;BBRR.. BBRR.. BBRR.. ..RR.. ..Y...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output: &lt;code&gt;0&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;......&#xA;......&#xA;......&#xA;......&#xA;......&#xA;......&#xA;......&#xA;......&#xA;.B....&#xA;BR....&#xA;BR....&#xA;BR....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output: &lt;code&gt;19&lt;/code&gt; (requires bonus; sorry, no intermediate states)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;..YRYY&#xA;GBBYRG&#xA;RBYRYY&#xA;GBYRYG&#xA;RYRGBG&#xA;YRGBYG&#xA;RYRGBY&#xA;RYRGBY&#xA;RGGBGB&#xA;GBYRBB&#xA;RGBYRG&#xA;RGBYRG&#xA;RGBYRG&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://puyonexus.com/chainsim/?w=6&amp;amp;h=12&amp;amp;chain=6466755647456466756467464757647567464756464756477575756455475647475647475647&quot; rel=&quot;nofollow noreferrer&quot;&gt;Puyo Nexus chain simulator&lt;/a&gt; might be useful while debugging.&lt;/p&gt;&#xA;" OwnerUserId="95691" LastActivityDate="2021-08-13T21:10:20.820" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23790" PostTypeId="2" ParentId="2140" CreationDate="2021-08-13T23:45:48.113" Score="0" Body="&lt;h1&gt;Convince me that this vector theorem is true&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/linear-algebra&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;linear-algebra&amp;#39;&quot; rel=&quot;tag&quot;&gt;linear-algebra&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Background Information&lt;/h3&gt;&#xA;&lt;p&gt;From &lt;a href=&quot;https://en.wikipedia.org/wiki/Linear_independence#Definition&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A sequence of vectors &lt;span class=&quot;math-container&quot;&gt;\$\mathbf v_1,\mathbf v_2,\mathbf v_3,\dots,\mathbf v_k\$&lt;/span&gt; from a vector space &lt;span class=&quot;math-container&quot;&gt;\$V\$&lt;/span&gt; is said to be &lt;em&gt;linearly dependent&lt;/em&gt;, if there exists scalars &lt;span class=&quot;math-container&quot;&gt;\$a_1,a_2,\dots,a_k\$&lt;/span&gt; such that:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$a_1\mathbf v_1+a_2\mathbf v_2+\cdots+a_k\mathbf v_k=\mathbf 0$$&lt;/span&gt;&#xA;where &lt;span class=&quot;math-container&quot;&gt;\$\mathbf 0\$&lt;/span&gt; denotes the zero vector.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Based on many sources&lt;sup&gt;1&lt;/sup&gt; around the internet, it is true that&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;If there are more vectors than dimensions, the vectors are linearly dependent.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;In other words, if the vector space is &lt;span class=&quot;math-container&quot;&gt;\$\mathbb R^n\$&lt;/span&gt;(the number of entries in each vector is &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;), then the sequence of vectors &lt;span class=&quot;math-container&quot;&gt;\$\mathbf v_1,\mathbf v_2,\dots,\mathbf v_p\$&lt;/span&gt; is always linearly dependent if &lt;span class=&quot;math-container&quot;&gt;\$p&amp;gt;n\ge2\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Task&lt;/h3&gt;&#xA;&lt;p&gt;After looking around, I'm still not entirely convinced that the above statement is true. Please convince me with a program that takes in: the dimension &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;(you don't have to take this in if you don't need to), and &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt; &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-dimensional vectors &lt;span class=&quot;math-container&quot;&gt;\$\mathbf v_1,\mathbf v_2,\dots,\mathbf v_p\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$p&amp;gt;n\ge2\$&lt;/span&gt;. You can take in &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt; in your program if you want to. You can assume that all vector entries in each vector are integer values. The input format can be whatever you choose, as long as there is a clear distinction between each vector. The program should return a list of scalars &lt;span class=&quot;math-container&quot;&gt;\$a_1,a_2,\dots,a_p\$&lt;/span&gt;, with at least one of them non-zero, such that&#xA;&lt;span class=&quot;math-container&quot;&gt;$$a_1\mathbf v_1+a_2\mathbf v_2+\cdots+a_p\mathbf v_p=\mathbf 0$$&lt;/span&gt;&#xA;to show linear dependency. If there are multiple outputs that work, you can output any one of them. The output format is also flexible, as long as it is clear what the values of each scalar are.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins!&lt;/p&gt;&#xA;&lt;h3&gt;Example I/O&lt;/h3&gt;&#xA;&lt;p&gt;Input:&#xA;&lt;br&gt;&lt;span class=&quot;math-container&quot;&gt;\$n=2\$&lt;/span&gt;&#xA;&lt;br&gt;&lt;span class=&quot;math-container&quot;&gt;\$p=3\$&lt;/span&gt;&#xA;&lt;br&gt;&lt;span class=&quot;math-container&quot;&gt;\$\mathbf v_1,\mathbf v_2,\dots,\mathbf v_p=\pmatrix{4\\5},\pmatrix{8\\10},\pmatrix{6\\7}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Output:&#xA;&lt;br&gt;&#xA;One possible solution is &lt;span class=&quot;math-container&quot;&gt;\$a_1,a_2,\dots,a_p=2,-1,0\$&lt;/span&gt;. We can quickly test that this does work:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$2\pmatrix{4\\5}+(-1)\pmatrix{8\\10}+0\pmatrix{6\\7}=\pmatrix{8\\10}-\pmatrix{8\\10}+\pmatrix{0\\0}=\pmatrix{0\\0}=\mathbf 0$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Test Cases:&lt;/h3&gt;&#xA;&lt;p&gt;Work in progress&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;n, vectors -&amp;gt; scalars&#xA;2, [(4,5),(8,10),(6,7)] -&amp;gt; [2,-1,0]&#xA;2, [(3,6),(6,7),(3,9),(2,4),(5,5)] -&amp;gt; [2,0,0,-3,0]&#xA;3, [(1,2,3),(2,3,4),(3,4,5),(4,5,6),(5,6,7),(6,7,8),(7,8,9),(8,9,10)] -&amp;gt; [1,-1,-1,1,1,-1,-1,1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt;: Some sources: &lt;a href=&quot;https://en.wikipedia.org/wiki/Linear_independence#More_vectors_than_dimensions&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt;, &lt;a href=&quot;https://www.math.uh.edu/%7Ejiwenhe/math2331/lectures/sec1_7.pdf#page=13&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt;, &lt;a href=&quot;https://math.stackexchange.com/questions/473853/prove-that-n1-vectors-in-mathbbrn-cannot-be-linearly-independent&quot;&gt;this&lt;/a&gt;, &lt;a href=&quot;https://math.stackexchange.com/questions/301871/prove-that-if-we-have-more-vectors-than-rows-in-a-single-vector-then-they-are-l&quot;&gt;this&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Concerns&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Has a similar challenge been done before?&lt;/li&gt;&#xA;&lt;li&gt;Is it clear what the challenge is specifying?&lt;/li&gt;&#xA;&lt;li&gt;I want to change the title to be more specific, but I'm not sure what to change it to.&lt;/li&gt;&#xA;&lt;li&gt;I need some test cases, but I'm not sure what test cases would be good for this.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="96039" LastEditorUserId="96039" LastEditDate="2021-08-14T02:52:44.647" LastActivityDate="2021-08-14T02:52:44.647" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23791" PostTypeId="2" ParentId="2140" CreationDate="2021-08-14T16:38:06.160" Score="0" Body="&lt;h1&gt;All valid N * N Flow Free Boards.&lt;/h1&gt;&#xA;&lt;p&gt;Since there are several other Flow Free question, either here or on main, but none, as far as I can tell, that do this, I will ask the question some of us have pondered at night: How many valid Flow Free Boards are there?&lt;/p&gt;&#xA;&lt;h1&gt;What is a valid board?&lt;/h1&gt;&#xA;&lt;p&gt;From what I can tell from my attempts at time trial, a valid board has all of these:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Has between floor(2N/3) and ceil(3N/2) flows (where a flow is two distinct points, defined as it's ends, between which a line can be drawn connecting them).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No two endpoints of a flow can be adjacent.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The board must be solvable - that is, there must be a way that all endpoints of the flows can be connected together such that every square of the board is filled once and only once, and no two paths intersect at all.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h1&gt;Input/Output&lt;/h1&gt;&#xA;&lt;p&gt;Your program will receive N, the side length of the board. The board will always be square (as that is the case in most boards), and it must return all valid boards, and the number of such boards.&lt;/p&gt;&#xA;&lt;p&gt;As always, you can take input and output in any reasonable format, and shortest byte count wins!&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;p&gt;Has this been done before?&lt;/p&gt;&#xA;&lt;p&gt;Anything that needs specifying?&lt;/p&gt;&#xA;" OwnerUserId="100887" LastActivityDate="2021-08-14T16:38:06.160" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23794" PostTypeId="1" AcceptedAnswerId="23795" CreationDate="2021-08-16T11:04:07.953" Score="2" ViewCount="63" Body="&lt;p&gt;When you go to our web page it says &amp;quot;code golf&amp;quot; at the top. This is true on my android cell phone at least. Should it instead spell out CGCC?  Everyone I have spoken to about this website was surprised it isn't just code golf. Perhaps changing the title they see would help with that.&lt;/p&gt;&#xA;" OwnerDisplayName="user7467" LastEditorDisplayName="user7467" LastEditDate="2021-08-16T11:07:22.310" LastActivityDate="2021-08-16T11:11:26.900" Title="Should the title be CGCC and not just code golf?" Tags="|discussion|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23795" PostTypeId="2" ParentId="23794" CreationDate="2021-08-16T11:09:14.607" Score="4" Body="&lt;p&gt;Compare the mobile version of the site (using Android):&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/93W5n.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/93W5n.jpg&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;With the desktop version of the site on mobile:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/SnWmA.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/SnWmA.jpg&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;As you can see, it is only the mobile version which has the short name. Also, there's &lt;a href=&quot;https://meta.stackexchange.com/questions/367609/deprecating-our-mobile-views&quot;&gt;plans to depreciate the mobile version&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2021-08-16T11:11:26.900" LastActivityDate="2021-08-16T11:11:26.900" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="23796" PostTypeId="2" ParentId="2140" CreationDate="2021-08-16T17:21:57.893" Score="0" Body="&lt;p&gt;&lt;strong&gt;Who Won Tic-Tac-Toe?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your job is to be the judge of a game of Tic-Tac-Toe.&lt;/p&gt;&#xA;&lt;p&gt;Given an input consisting of three lines (9 characters not including newlines), determine the winner of the game of Tic-Tac-Toe.&lt;/p&gt;&#xA;&lt;p&gt;For example, for the input&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;XOO&#xA;-XO&#xA;O-X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;your program should either return or print &lt;code&gt;X&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For tie games or games where no one has won, do not print or return anything.&lt;/p&gt;&#xA;&lt;p&gt;The only input characters will be 'X', 'O', and '-' (along with two newlines), and the only outputs your program should give are 'X' and 'O' (or nothing).&lt;/p&gt;&#xA;&lt;p&gt;Also note that the given board will be a valid game of Tic-Tac-Toe, so there will be no situations where both players have winning positions.&lt;/p&gt;&#xA;&lt;p&gt;More examples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;OOO&#xA;---&#xA;---&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;=&amp;gt; &lt;code&gt;O&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;OXO&#xA;--X&#xA;---&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;=&amp;gt; &lt;code&gt;(nothing)&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;OXO&#xA;X-O&#xA;X-O&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;=&amp;gt; &lt;code&gt;O&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;OXO&#xA;XOX&#xA;XOX&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;=&amp;gt; &lt;code&gt;(nothing)&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="53261" LastActivityDate="2021-08-16T17:21:57.893" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23798" PostTypeId="1" AcceptedAnswerId="23800" CreationDate="2021-08-17T18:13:54.010" Score="2" ViewCount="100" Body="&lt;p&gt;We currently have two questions asking for tips about golfing languages:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/118107/tips-for-making-a-golfing-language&quot;&gt;Tips for making a golfing language&lt;/a&gt; (posted in 2017) is closed for lack of focus, with +10/-3 and no answers&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/198446/tips-for-creating-maintaining-a-golfing-language&quot;&gt;Tips for Creating/Maintaining a Golfing Language&lt;/a&gt; (posted in 2020) is open and much better received, with +37/0 and 8 answers&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Why did this happen, and what should we do about this?&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2021-08-17T18:29:22.340" Title="What's the deal with these two &quot;tips for creating a golfing language&quot; questions?" Tags="|discussion|specific-question|languages|tips|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23799" PostTypeId="2" ParentId="23798" CreationDate="2021-08-17T18:13:54.010" Score="0" Body="&lt;p&gt;In my opinion:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the second question is better specified, but is even less focussed&lt;/li&gt;&#xA;&lt;li&gt;in actual fact, neither of them are too un-focussed to be problematic (they're &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;, which is inherently quite open-ended)&lt;/li&gt;&#xA;&lt;li&gt;the questions are nevertheless similar enough to warrant closing one as a duplicate of the other&#xA;&lt;ul&gt;&#xA;&lt;li&gt;since the second is better specified and has some answers already, it should be the target and the first one should be the duplicate&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;the best course of action is therefore to close the first as a duplicate of the second&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2021-08-17T18:13:54.010" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23800" PostTypeId="2" ParentId="23798" CreationDate="2021-08-17T18:29:22.340" Score="3" Body="&lt;h2&gt;Don't do anything&lt;/h2&gt;&#xA;&lt;p&gt;The first was closed because it doesn't come anywhere near close enough to the standards we require on a question's scope. It asks 4 questions at once, and answers could literally be anything that might constitute golfing advice. In particular,&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Do you have any suggestions for this language?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;What features do you find useful?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;are blatantly not part of a question we allow here, as they're entirely subjective.&lt;/p&gt;&#xA;&lt;p&gt;The second one is a much better version of this question. It's still rather broad, and it overlaps somewhat with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14927/66833&quot;&gt;this&lt;/a&gt; question about community engagement. However, it asks for tips in designing a language to be good at code golf, as well as tips for actually implementing that. Additionally, it mainly asks for advice around generally creating a language, rather than specific features that would do well in a golfing language, meaning that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/6905/66833&quot;&gt;this&lt;/a&gt; precedent doesn't apply here.&lt;/p&gt;&#xA;&lt;p&gt;It's not too unusual for older, lower quality questions to be re-asked as an improved challenge. This is yet another example, just as a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; question, rather than a challenge.&lt;/p&gt;&#xA;&lt;p&gt;I don't have anything against closing the older one as a dupe, but given that it's low visibility, already closed and inactive, what's the point?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-08-17T18:29:22.340" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23802" PostTypeId="2" ParentId="2140" CreationDate="2021-08-18T00:05:39.227" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/233919/counting-and-so-on&quot;&gt; Counting and so on&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="101762" LastEditorUserId="101762" LastEditDate="2021-09-01T12:20:14.993" LastActivityDate="2021-09-01T12:20:14.993" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23803" PostTypeId="2" ParentId="2140" CreationDate="2021-08-18T00:31:26.167" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/233581/66833&quot;&gt;Implement the LC-3 VM [1] using 16-bit subneg4 [2] only &amp;amp; test it&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="74729" LastEditorUserId="66833" LastEditDate="2021-08-26T01:01:05.213" LastActivityDate="2021-08-26T01:01:05.213" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23805" PostTypeId="2" ParentId="2140" CreationDate="2021-08-18T18:11:55.000" Score="-1" Body="&lt;p&gt;Shortest common superstring&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to find the shortest common superstring (SCS) for a sequence of English words. The SCS for a sequence is the smallest string that contains all the words in the sequence. The words should be passed as a function parameter.&lt;/p&gt;&#xA;&lt;p&gt;Answers should be posted in the following format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;Language name&amp;gt;, &amp;lt;Byte count&amp;gt;&#xA;&#xA;&amp;lt;code&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is code-golf, so the answer with the least bytes wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;Any suggestions?&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2021-08-18T19:01:17.293" LastActivityDate="2021-08-18T19:01:17.293" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23806" PostTypeId="2" ParentId="2140" CreationDate="2021-08-18T19:32:25.273" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/233618&quot;&gt;Distances between keys on a QWERTY keyboard&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2021-08-22T10:55:40.330" LastActivityDate="2021-08-22T10:55:40.330" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23807" PostTypeId="1" CreationDate="2021-08-18T23:59:00.553" Score="3" ViewCount="42" Body="&lt;p&gt;Improving our &lt;a href=&quot;/tour&quot;&gt;Tour&lt;/a&gt; page and our &lt;a href=&quot;/help&quot;&gt;help center&lt;/a&gt; pages has been &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8351/66833&quot;&gt;long in the works&lt;/a&gt;, in particular our &lt;a href=&quot;https://codegolf.stackexchange.com/help/asking&quot;&gt;Asking&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/help/answering&quot;&gt;Answering&lt;/a&gt; pages. Some already existing posts about this are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/477/66833&quot;&gt;The &amp;quot;How To Ask&amp;quot; page is misleading&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8441/66833&quot;&gt;Can we get a custom Tour page?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2098/66833&quot;&gt;Let&amp;#39;s rewrite the help center&amp;#39;s on-topic page&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2020/66833&quot;&gt;A Better Help Center&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;However, those are mostly outdated, and could do with some modernisation. We recently got &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/58925378#58925378&quot;&gt;confirmation&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78028/catija&quot;&gt;Catija&lt;/a&gt; (a Community Manager at Stack Exchange) that, if we provided the texts, Stack Exchange is happy to update our &lt;a href=&quot;/help&quot;&gt;help center&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This leaves us with 2 questions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Which pages need updating? and,&lt;/li&gt;&#xA;&lt;li&gt;What should those pages say?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This question is intended to address the first question. Please suggest, in answers below, which pages should be changed, and some basic justifications for why they aren't applicable to the site in their current form. Highly voted proposals will be spun out into &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/58925440#58925440&quot;&gt;separate questions&lt;/a&gt; under the &lt;a href=&quot;/questions/tagged/help-center-rewrite&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;help-center-rewrite&amp;#39;&quot; rel=&quot;tag&quot;&gt;help-center-rewrite&lt;/a&gt; tag, with answers to those questions being drafts for the pages.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-09-06T17:33:05.577" LastActivityDate="2021-09-06T17:33:05.577" Title="How can we improve our help center?" Tags="|discussion|help-center|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23808" PostTypeId="2" ParentId="23807" CreationDate="2021-08-18T23:59:00.553" Score="2" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/how-to-ask&quot;&gt;How do I ask a good question?&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;All this information provided is just... wrong. It's vague enough to somewhat apply, but could do with rewording to stick closer to our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20862/66833&quot;&gt;How to Ask page&lt;/a&gt;, especially mentioning the Sandbox and our requirement for an &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8130/66833&quot;&gt;objective winning criteria&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-08-18T23:59:00.553" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23810" PostTypeId="2" ParentId="2140" CreationDate="2021-08-19T05:31:13.960" Score="2" Body="&lt;h1&gt;Unfudge my terminal!&lt;/h1&gt;&#xA;&lt;h2&gt;Intro&lt;/h2&gt;&#xA;&lt;p&gt;Today I fiddled around with termios for a program. The only thing I managed to do so far is fundging my terminal... can you help me out?&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a terminal input that contains fudged special chars, output the string that should be displayed if the terminal worked correctly. Here's a list of the broken special chars:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;^B -&amp;gt; Backspace&#xA;^J -&amp;gt; (Fwd-) Delete&#xA;^W -&amp;gt; Discard&#xA;^D -&amp;gt; Cursor left&#xA;^C -&amp;gt; Cursor right&#xA;^F -&amp;gt; End&#xA;^H -&amp;gt; Start&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;How the special characters work&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Backspace deletes the character behind the cursor and moves it one step back. Has no effect on the start of the string.&lt;/li&gt;&#xA;&lt;li&gt;Delete deletes the character in front of the cursor. Has no effect on the end of the string.&lt;/li&gt;&#xA;&lt;li&gt;Discard deletes the string typed up to this point.&lt;/li&gt;&#xA;&lt;li&gt;Cursor left/right moves the cursor to the left/right by one. Has no effect on the end/start of the string.&lt;/li&gt;&#xA;&lt;li&gt;End/Start move the cursor to the end/start of the string.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Undefined special characters are to be removed.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any represetation of a string/list of characters&lt;/li&gt;&#xA;&lt;li&gt;Single lines only&lt;/li&gt;&#xA;&lt;li&gt;The special characters may be either all capitalized or all not capitalized&lt;/li&gt;&#xA;&lt;li&gt;The input will not contain a sequence that will result in a &lt;code&gt;^&lt;/code&gt; in the output, nor will it contain a single &lt;code&gt;^&lt;/code&gt; at the end.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The unfudged input.&lt;/li&gt;&#xA;&lt;li&gt;No leading/trailing whitespace that isn't part of the string.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;abcd^B^B^B --&amp;gt; a&#xA;&#xA;abcd^We^Af^Lgh --&amp;gt; efgh&#xA;&#xA; gof^D^D^D^Dcode^C^C^Cl --&amp;gt; code golf&#xA;&#xA;ocde gol^H^J^Jco^Ff --&amp;gt; code golf&#xA;&#xA;edgecase^H^D^B^J^F^C^J^B --&amp;gt; dgecas&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, shortest answer wins&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are not allowed&lt;/li&gt;&#xA;&lt;li&gt;A submissiom may be a program/function/link/lambda/chain/etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox things&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is anything unclear?&lt;/li&gt;&#xA;&lt;li&gt;Should any special char be added or removed?&lt;/li&gt;&#xA;&lt;li&gt;Is there an edge case not covered by the examples?&lt;/li&gt;&#xA;&lt;li&gt;Are the rules and I/O restrictions fine or should I change anything?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="92572" LastEditorUserId="92572" LastEditDate="2021-08-25T13:48:20.123" LastActivityDate="2021-08-25T13:48:20.123" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23811" PostTypeId="1" AcceptedAnswerId="23812" CreationDate="2021-08-19T13:04:14.693" Score="3" ViewCount="66" Body="&lt;p&gt;From what I have seen so far the usual way of scoring in java is by using lambda expressions. I often see &lt;a href=&quot;https://tio.run/#java-jdk&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online&lt;/a&gt; used for it.&#xA;My actual question comes now:&lt;/p&gt;&#xA;&lt;p&gt;Can you reuse the name of a named lambda to define a variable, thus allowing you to remove the &lt;code&gt;var&lt;/code&gt;? For example, normally you'd do:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;f -&amp;gt; {var s = &amp;quot;&amp;quot;; /* rest of the code */}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Are you allowed to make &lt;code&gt;f&lt;/code&gt; a &lt;code&gt;String&lt;/code&gt; to save a few characters? It'd then look like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;f -&amp;gt; {f = &amp;quot;&amp;quot;; /* rest of the code */}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="106557" LastEditorUserId="66833" LastEditDate="2021-08-19T13:29:28.463" LastActivityDate="2021-08-19T13:48:28.300" Title="Can Java lambdas reuse their named arguments to remove type declarations?" Tags="|support|java|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="23812" PostTypeId="2" ParentId="23811" CreationDate="2021-08-19T13:48:28.300" Score="5" Body="&lt;p&gt;Writing &lt;code&gt;f-&amp;gt;{/*code*/}&lt;/code&gt; is absolutely alright, as agreed upon in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12681/are-we-allowed-to-use-empty-input-we-wont-use-when-no-input-is-asked-regarding&quot;&gt;question&lt;/a&gt; Dude coinheringaahing linked.&lt;/p&gt;&#xA;&lt;p&gt;However, I would say that the second shouldn't be allowed because although you're not using the &lt;em&gt;value&lt;/em&gt; of &lt;code&gt;f&lt;/code&gt;, you're taking advantage of its type. In my opinion, the input &lt;code&gt;f&lt;/code&gt; shouldn't be mentioned anywhere in your lambda other than the parameter list because it's really not even supposed to exist - it's just meant to save a byte over &lt;code&gt;()-&amp;gt;{...}&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="95792" LastActivityDate="2021-08-19T13:48:28.300" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23814" PostTypeId="2" ParentId="2140" CreationDate="2021-08-19T19:03:26.260" Score="1" Body="&lt;h1&gt;Implement the binary operators*&lt;/h1&gt;&#xA;&lt;p&gt;*of INTERCAL&lt;/p&gt;&#xA;&lt;h2&gt;Intro&lt;/h2&gt;&#xA;&lt;p&gt;As we all know, there are 5 different binary operations. Two combine two values, the rest modifies the value given.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Your task will be to implement some if not all of the operators. They are defined as followed&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;$&lt;/code&gt; (mingle)&lt;br /&gt;&#xA;Given two values, returns a value that consists of the bits of both values alternating. Right argument has the first bit.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;~&lt;/code&gt; (select)&lt;br /&gt;&#xA;Given two values, discard all bits of the right value that aren't &lt;code&gt;1&lt;/code&gt; in the same place in the second value. Then, pack them to the right. If this explanation is too confusing, refer to &lt;a href=&quot;http://www.muppetlabs.com/%7Ebreadbox/intercal-man/figure1.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;this diagram&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;amp;&lt;/code&gt;, &lt;code&gt;V&lt;/code&gt; and &lt;code&gt;?&lt;/code&gt; (AND, OR and XOR)&lt;br /&gt;&#xA;Given a value, AND/OR/XOR neighbouring the bits.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I/O in any format that isn't a binary representation of the number(s).&lt;/li&gt;&#xA;&lt;li&gt;Each answer can contain up to five submissions, each handling a different operator. You don't need to use one language for all programs.&lt;/li&gt;&#xA;&lt;li&gt;A valid submission can be a program/function/link/lambda/chain/etc.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;. Shortest answer for each operator wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;  44 $     4 = 2224&#xA;   2 $     9 =   73&#xA;&#xA; 255 ~   341 =   15&#xA;4214 ~ 47818 =   96&#xA;&#xA;     &amp;amp;  1999 =  967&#xA;     &amp;amp;    71 =    3&#xA;&#xA;     V     4 =    6&#xA;     V   100 =  118&#xA;&#xA;     ?    42 =   63&#xA;     ?   428 =  387&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Sandbox things&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'm unsure about what to submit. Is this &amp;quot;up-to-five-programs-one-per-op&amp;quot; fine or should it be changed?&lt;/li&gt;&#xA;&lt;li&gt;Anything else unclear?&lt;/li&gt;&#xA;&lt;li&gt;Is this question different enough from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/54412/implement-intercals-binary-operators&quot;&gt;Implement INTERCAL&amp;#39;s Binary Operators&lt;/a&gt; ?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="92572" LastEditorUserId="92572" LastEditDate="2021-09-03T08:16:11.940" LastActivityDate="2021-09-03T08:16:11.940" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="23815" PostTypeId="2" ParentId="2140" CreationDate="2021-08-20T15:47:09.583" Score="3" Body="&lt;h1&gt;Parse some Husk (WIP)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/barbuz/Husk&quot; rel=&quot;nofollow noreferrer&quot;&gt;Husk&lt;/a&gt; is a &amp;quot;functional golfing language inspired by Haskell.&amp;quot; Its syntax is prefix, albeit with a twist: Husk's functions can be curried: so uses its static typing to determine how many arguments a function should take at a time. For example, Husk can tell that &lt;code&gt;m+2:2;3&lt;/code&gt; should be parsed as &lt;code&gt;m(+2)(:2(;3))&lt;/code&gt; and not, say, &lt;code&gt;m(+2(:2(;3)))&lt;/code&gt; or &lt;code&gt;m(+)(2:2;3)&lt;/code&gt;, which are meaningless.&lt;/p&gt;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&lt;p&gt;This challenge involves validating a subset of Husk that has 5 functions and two types: integers 0-9 or lists of those integers. It also does not have parentheses or overloading. Your submission will take a string consisting only of the characters &lt;code&gt;mo;:+0123456789&lt;/code&gt; and determine whether it is a valid program according to the rules below.&lt;/p&gt;&#xA;&lt;p&gt;In the following descriptions, &amp;quot;unary integer function&amp;quot; refers to a function that takes an integer and outputs another. It's a made-up term, let me know if there's a better one. &amp;quot;list&amp;quot; refers to a list of integers, and &amp;quot;integer&amp;quot; refers to an integer &lt;code&gt;0-9&lt;/code&gt;. You don't need to understand the purposes of each function, just the types of their inputs and outputs.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;0-9&lt;/code&gt; are values/integers.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;;&lt;/code&gt; is the unary function &lt;code&gt;singleton&lt;/code&gt;. Its argument is an integer &lt;code&gt;x&lt;/code&gt;, and it returns a list (&lt;code&gt;[x]&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;:&lt;/code&gt; is the binary function &lt;code&gt;prepend&lt;/code&gt;. Its first argument is an integer &lt;code&gt;x&lt;/code&gt; and the second is a list &lt;code&gt;l&lt;/code&gt;. It returns &lt;code&gt;x&lt;/code&gt; prepended to &lt;code&gt;l&lt;/code&gt; (&lt;code&gt;[x, ...l]&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;m&lt;/code&gt; is the binary function &lt;code&gt;map&lt;/code&gt;. Its first argument is a unary integer function &lt;code&gt;f&lt;/code&gt; and the second a list of integers &lt;code&gt;l&lt;/code&gt;. It returns &lt;code&gt;[f(l[0]), f(l[1]), ..., f(l[-1])]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;o&lt;/code&gt; is the trinary function &lt;code&gt;compose&lt;/code&gt;. Its first argument is a unary integer function &lt;code&gt;f&lt;/code&gt; and the second a unary integer function &lt;code&gt;g&lt;/code&gt;. The third is an integer &lt;code&gt;x&lt;/code&gt;. It returns &lt;code&gt;f(g(x))&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Here is what their types might look like in Haskell:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(;) :: Int -&amp;gt; [Int&#xA;(:) :: Int -&amp;gt; [Int] -&amp;gt; [Int]&#xA;m :: (Int -&amp;gt; Int) -&amp;gt; [Int] -&amp;gt; [Int]&#xA;o :: (Int -&amp;gt; Int) -&amp;gt; (Int -&amp;gt; Int) -&amp;gt; Int -&amp;gt; Int&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here is pseudo-pseudo-pseudo-not-even-BNF-anymore:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;int&amp;gt; ::= 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | + &amp;lt;int&amp;gt; &amp;lt;int&amp;gt;&#xA;&amp;lt;list&amp;gt; ::= ; &amp;lt;int&amp;gt; | : &amp;lt;int&amp;gt; &amp;lt;list&amp;gt; | m &amp;lt;unary-int-int&amp;gt; &amp;lt;list&amp;gt;&#xA;&amp;lt;unary-int-int&amp;gt; ::= o &amp;lt;unary-int-int&amp;gt; &amp;lt;unary-int-int&amp;gt;&#xA;&amp;lt;valid-husk-program&amp;gt; ::= &amp;lt;int&amp;gt; | &amp;lt;list&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Questions for Meta:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this collection of functions okay? Should I add more or replace/remove some?&lt;/li&gt;&#xA;&lt;li&gt;Is this challenge interesting?&lt;/li&gt;&#xA;&lt;li&gt;Is this a dupe?&lt;/li&gt;&#xA;&lt;li&gt;Is the explanation good enough? How can I make it clearer?&lt;/li&gt;&#xA;&lt;li&gt;This currently doesn't have a lot of variety in the currying. Should the functions given to map/compose also be allowed to input/output lists? (and if so, would lists be allowed to be nested?)&lt;/li&gt;&#xA;&lt;li&gt;Can Perl regex do this? I'm making this challenge hoping that it can't.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="95792" LastEditorUserId="95792" LastEditDate="2021-08-20T16:11:58.193" LastActivityDate="2021-08-20T16:11:58.193" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23816" PostTypeId="2" ParentId="23807" CreationDate="2021-08-21T01:06:25.060" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/accepted-answer&quot;&gt;What does it mean when an answer is accepted?&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;There is no right answer in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; questions, which make up 85% of all questions. This page should also explain what acceptance means for non-&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; questions.&lt;/p&gt;&#xA;" OwnerUserId="100664" LastActivityDate="2021-08-21T01:06:25.060" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23817" PostTypeId="1" CreationDate="2021-08-21T09:30:12.240" Score="3" ViewCount="83" Body="&lt;p&gt;There are several questions where the challenge is to accomplish a task with the least distinct characters - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/230024/minimal-distinct-character-quine&quot;&gt;Example&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/233591/make-a-gui-window-in-any-language-using-minimum-different-characters&quot;&gt;Example&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/110648/fewest-distinct-characters-for-turing-completeness/&quot;&gt;Possibly example&lt;/a&gt;. There's probably more, these are hard to find.&lt;/p&gt;&#xA;&lt;p&gt;Currently, these questions are all tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, but it would be nice to have this as an explicit winning criterion.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/minimum-distinct-chars&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;minimum-distinct-chars&amp;#39;&quot; rel=&quot;tag&quot;&gt;minimum-distinct-chars&lt;/a&gt; is what I have so far, so name suggestions welcome.&lt;/p&gt;&#xA;&lt;p&gt;Name suggestions welcome!&lt;/p&gt;&#xA;&lt;p&gt;Pxeger, Wheat Wizard and PyGamer0 have &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/conversation/winning-criterion-name-ideas-for-meta-post&quot;&gt;had some  ideas&lt;/a&gt;, what're* your thoughts?&lt;/p&gt;&#xA;&lt;p&gt;* if that's not a word, it is now.&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="66833" LastEditDate="2021-08-21T11:54:32.193" LastActivityDate="2021-08-21T11:54:32.193" Title="Winning criterion tag request: [minimum-distinct-chars]" Tags="|discussion|feature-request|tags|winning-criteria|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23818" PostTypeId="2" ParentId="2140" CreationDate="2021-08-21T09:35:11.220" Score="2" Body="&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2021-08-23T15:58:09.900" LastActivityDate="2021-08-23T15:58:09.900" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23819" PostTypeId="2" ParentId="23817" CreationDate="2021-08-21T09:58:31.183" Score="10" Body="&lt;p&gt;Looking at the minimum distinct character challenges linked it does seem like while there are a couple it's not a very well liked scoring criterion on it's own.&lt;/p&gt;&#xA;&lt;p&gt;&amp;quot;Do X but with minimum characters&amp;quot; is just not interesting on it's own anymore.  Unlike other scoring criteria most challenges with this criterion end up feeling pretty much the same.&lt;/p&gt;&#xA;&lt;p&gt;Of course &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; or other special rules could turn this on its head.  I just don't think we should anticipate a whole lot more of these challenges.&lt;/p&gt;&#xA;&lt;p&gt;I still think that in the end the scant challenges we have may be worth tagging, but I think we can find a more useful tag by broadening the scope of this tag.&lt;/p&gt;&#xA;&lt;p&gt;I suggest we add a single tag which just indicates that the scoring for the challenge involves the &lt;em&gt;distinct&lt;/em&gt; characters rather than just all the characters.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/distinct-scoring&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;distinct-scoring&amp;#39;&quot; rel=&quot;tag&quot;&gt;distinct-scoring&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;So &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/distinct-scoring&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;distinct-scoring&amp;#39;&quot; rel=&quot;tag&quot;&gt;distinct-scoring&lt;/a&gt; + &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; would be minimum number of distinct characters, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/distinct-scoring&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;distinct-scoring&amp;#39;&quot; rel=&quot;tag&quot;&gt;distinct-scoring&lt;/a&gt; + &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-bowling&lt;/a&gt; would be the maximum number of distinct characters.&lt;/p&gt;&#xA;&lt;p&gt;This widens the potential pool on the tag a bit to include more challenges which really are very similar.  It's also more open to variation which I think this type of challenge is in desperate need of if it is going to keep being asked.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2021-08-21T09:58:31.183" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23820" PostTypeId="2" ParentId="2140" CreationDate="2021-08-21T13:05:15.913" Score="0" Body="&lt;h1&gt;Tic-Tac Clock&lt;/h1&gt;&#xA;&lt;p&gt;given a time of the day (0-12 inclusive) output the closest fitting clock. This means &lt;code&gt;0/12&lt;/code&gt;, &lt;code&gt;3&lt;/code&gt;, &lt;code&gt;6&lt;/code&gt; and &lt;code&gt;9&lt;/code&gt; should be straight up/to the side. The one's in between go in the corners!&lt;/p&gt;&#xA;&lt;p&gt;The clock should look as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;      #|#&#xA;0  -&amp;gt; #+#&#xA;      ###&#xA;&#xA;      ##/&#xA;1  -&amp;gt; #+#&#xA;      ###&#xA;&#xA;      ##/&#xA;2  -&amp;gt; #+#&#xA;      ###&#xA;&#xA;      ###&#xA;3  -&amp;gt; #+-&#xA;      ###&#xA;&#xA;      ###&#xA;4  -&amp;gt; #+#&#xA;      ##\&#xA;&#xA;      ###&#xA;5  -&amp;gt; #+#&#xA;      ##\&#xA;&#xA;      ###&#xA;6  -&amp;gt; #+#&#xA;      #|#&#xA;&#xA;      ###&#xA;7  -&amp;gt; #+#&#xA;      /##&#xA;&#xA;      ###&#xA;8  -&amp;gt; #+#&#xA;      /##&#xA;&#xA;      ###&#xA;9  -&amp;gt; -+#&#xA;      ###&#xA;&#xA;      \##&#xA;10 -&amp;gt; #+#&#xA;      ###&#xA;&#xA;      \##&#xA;11 -&amp;gt; #+#&#xA;      ###&#xA;&#xA;      #|#&#xA;12 -&amp;gt; #+#&#xA;      ###&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is code-golf so the shortest answer (per language) in bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;questions&lt;/h2&gt;&#xA;&lt;p&gt;This is my first question so I'd appreciate some feedback,&#xA;mainly if this challenge would be too tedious to do.&lt;/p&gt;&#xA;" OwnerUserId="106557" LastEditorUserId="106557" LastEditDate="2021-08-22T08:00:42.227" LastActivityDate="2021-08-22T08:00:42.227" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23825" PostTypeId="2" ParentId="2140" CreationDate="2021-08-25T09:09:54.010" Score="1" Body="&lt;h1&gt;Fletcher's 16 bit checksum &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;Intro&lt;/h2&gt;&#xA;&lt;p&gt;No story this time :( This is something that I needed for a program and I thought that it would make for a fun little challenge. I'd love to see some unusual languages here!&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Implement Fletcher16. The algorithm is very straight forward, as seen here in pseudocode:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    int sum1, sum2, check1, check2;&#xA;    char[] message;&#xA;&#xA;    sum1 = 0;&#xA;    sum2 = 0;&#xA;    for i from 1 to message_length do&#xA;      sum1 = ( sum1 + message[i] ) modulo 255;&#xA;      sum2 = ( sum2 + sum1       ) modulo 255;&#xA;    end for&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;There are two accumulators &lt;code&gt;sum1&lt;/code&gt; and &lt;code&gt;sum2&lt;/code&gt;. We iterate over the message and for every byte inside of it we add the byte to the first sum and then modulo the value by 255. We then add the value of the first accumulator to the second one and modulo that by 255 as well. This is Fletcher's algorithm.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    check1 = 255 - (( sum1 + sum2) modulo 255);&#xA;    check2 = 255 - (( sum1 + check1 ) modulo 255);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We then calculate the checksum by &amp;quot;simulating&amp;quot; the algorithm for the two resulting values. After subtracting the numbers from 255, we get two values &lt;code&gt;check1&lt;/code&gt; and &lt;code&gt;check2&lt;/code&gt;. They are then appended to the input in that order.&lt;/p&gt;&#xA;&lt;h4&gt;To recap:&lt;/h4&gt;&#xA;&lt;p&gt;Adding the checksum&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Run the first part to get a &amp;quot;raw&amp;quot; checksum&lt;/li&gt;&#xA;&lt;li&gt;Run the second part on that raw checksum to get the Fletcher16 checksum.&lt;/li&gt;&#xA;&lt;li&gt;Append the Fletch16 checksum to the input.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Evaluating the checksum&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Run the first part on the string with the appended Fletcher16 checksum&lt;/li&gt;&#xA;&lt;li&gt;If 0: String is valid, else String isn't valid.&lt;/li&gt;&#xA;&lt;li&gt;Note: If we run the second part as well, the result will be 0xFFFF&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Binary data in any format, length is at least 1.&lt;/li&gt;&#xA;&lt;li&gt;If needed, the length of the data.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The Fletcher16 checksum &lt;code&gt;check2 &amp;lt;&amp;lt; 8 | check1&lt;/code&gt;, since this is what gives the algorithm its name.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, shortest answer wins&lt;/li&gt;&#xA;&lt;li&gt;No standard loopholes&lt;/li&gt;&#xA;&lt;li&gt;No builtins. I doubt that there's a language that has one for this, but if so that that's no fun.&lt;/li&gt;&#xA;&lt;li&gt;A submissiom may be a program/function/link/lambda/chain/etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;abcde -&amp;gt; 0xC846&#xA;abcdef -&amp;gt; 0x2088&#xA;abcdefgh -&amp;gt; 0x06D2&#xA;&#xA;abcde\x46\xC8 -&amp;gt; 0xFFFF&#xA;abcdef\x88\x20 -&amp;gt; 0xFFFF&#xA;abcdefgh\xD2\x06 -&amp;gt; 0xFFFF&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You can find a reference implementation in C &lt;a href=&quot;https://tio.run/##bVHRaoQwEHz3KxbLQaxeUTlF0Paln3EeRWPshXreoREsbb/d7sYI2mtekszOzE42fP/O@TRZD7LlzVAJyHpVyevT@WUFyVapz5votygSG1kSZg3ICOI3BXUjFD@LLogZYQlCj1WhPMALNKJ1rC8LcC3FfrgE8Ay@R6eQTqmu19cOGGmkxnDLSI4H13U0Y/ahZTyY3l3Adkd5cmAHYRSla1ZoWCGyiLzh/FibYPgI/qGjjXUNe2CLPelJSLiT3mvCfzSz2UqlZZ1QQ9cCW4bnMGYcsgwSB74XXWphOBrGpZAt@zvCcqiPJ2xqFyWvRD4e4nzkiT1HM2PHcmS63jrEama/kjfmA9nDzj@MeWt76@9DW0//mHmkSetTmGn6BQ&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;C (gcc) – Try It Online&quot;&gt;here&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are there any mistakes?&lt;/li&gt;&#xA;&lt;li&gt;Is something unclear? I'm really not sure about the wording of the input.&lt;/li&gt;&#xA;&lt;li&gt;Is the output restriction reasonable?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="92572" LastEditorUserId="92572" LastEditDate="2021-08-25T13:51:14.613" LastActivityDate="2021-08-25T13:51:14.613" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23826" PostTypeId="2" ParentId="2140" CreationDate="2021-08-25T09:43:40.470" Score="1" Body="&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2021-08-25T12:46:34.233" LastActivityDate="2021-08-25T12:46:34.233" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23827" PostTypeId="2" ParentId="2140" CreationDate="2021-08-25T12:46:54.603" Score="0" Body="&lt;p&gt;Add 2 numbers using a graphics card&lt;/p&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;Graphics cards have great performance when doing big calculations. So lets make a small calculation&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Inputs: 2 floats of choice&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;output: the addition of the two floats.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The addition should be calculated on the graphics card, but it doesn't matter if it doesn't work on all gpu's&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Lowest score in bytes wins&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;2.5 and 3.2 -&amp;gt; 5.7&lt;/p&gt;&#xA;" OwnerUserId="106697" LastActivityDate="2021-08-25T12:46:54.603" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23828" PostTypeId="2" ParentId="2140" CreationDate="2021-08-25T14:25:45.490" Score="1" Body="&lt;h1&gt;A phonetic letter&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;input&lt;/strong&gt;&lt;br /&gt;&#xA;a letter of the alphabet, A-Z (upper or lower or a mix, I don't mind)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;output&lt;/strong&gt;&lt;br /&gt;&#xA;the phonetic (i.e spelled name of the )letter of the one passed in, along with the appropriate indefinite article &lt;code&gt;a&lt;/code&gt; or &lt;code&gt;an&lt;/code&gt; (again, in any case), and any amount of leading/trailing whitespace you like (i.e. it's fairly flexible)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;full set of test cases (lowercase) - see &lt;a href=&quot;https://english.stackexchange.com/a/298766/378725&quot;&gt;This english.se Answer&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;input&lt;/th&gt;&#xA;&lt;th&gt;output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;a&lt;/td&gt;&#xA;&lt;td&gt;an a&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;b&lt;/td&gt;&#xA;&lt;td&gt;a bee&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;c&lt;/td&gt;&#xA;&lt;td&gt;a cee&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;d&lt;/td&gt;&#xA;&lt;td&gt;a dee&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;e&lt;/td&gt;&#xA;&lt;td&gt;an e&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;f&lt;/td&gt;&#xA;&lt;td&gt;an eff (or &amp;quot;an ef&amp;quot;)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;g&lt;/td&gt;&#xA;&lt;td&gt;a gee&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;h&lt;/td&gt;&#xA;&lt;td&gt;an aitch&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;i&lt;/td&gt;&#xA;&lt;td&gt;an i (or &amp;quot;an eye&amp;quot;)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;j&lt;/td&gt;&#xA;&lt;td&gt;a jay&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;k&lt;/td&gt;&#xA;&lt;td&gt;a kay&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;l&lt;/td&gt;&#xA;&lt;td&gt;an el (or &amp;quot;an ell&amp;quot;)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;m&lt;/td&gt;&#xA;&lt;td&gt;an em&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;n&lt;/td&gt;&#xA;&lt;td&gt;an en&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;o&lt;/td&gt;&#xA;&lt;td&gt;an o (or &amp;quot;an oh&amp;quot;)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;p&lt;/td&gt;&#xA;&lt;td&gt;a pee&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;q&lt;/td&gt;&#xA;&lt;td&gt;a cue (or &amp;quot;a queue&amp;quot;)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;r&lt;/td&gt;&#xA;&lt;td&gt;an ar (or &amp;quot;an arrrrr&amp;quot;) with an arbitrary number of &lt;code&gt;r&lt;/code&gt;s&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;s&lt;/td&gt;&#xA;&lt;td&gt;an ess (or &amp;quot;an es&amp;quot;)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;t&lt;/td&gt;&#xA;&lt;td&gt;a tee&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;u&lt;/td&gt;&#xA;&lt;td&gt;a u (or &amp;quot;a you&amp;quot;)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;v&lt;/td&gt;&#xA;&lt;td&gt;a vee&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;w&lt;/td&gt;&#xA;&lt;td&gt;a double-u (or &amp;quot;a double-you&amp;quot;, matching &lt;code&gt;u&lt;/code&gt; above)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;x&lt;/td&gt;&#xA;&lt;td&gt;an ex&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;y&lt;/td&gt;&#xA;&lt;td&gt;a wy (or &amp;quot;a wye&amp;quot;)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;z&lt;/td&gt;&#xA;&lt;td&gt;a zed (or &amp;quot;a zee&amp;quot;, if you must)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, usual rules and exceptions, shortest bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="62289" LastActivityDate="2021-08-25T14:25:45.490" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23830" PostTypeId="2" ParentId="2140" CreationDate="2021-08-26T04:18:35.027" Score="1" Body="&lt;h1&gt;Interpret Tarfish&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/chunkybanana/tarfish&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tarfish&lt;/a&gt; is a more tarpit-style version of &lt;a href=&quot;https://esolangs.org/wiki/fish&quot; rel=&quot;nofollow noreferrer&quot;&gt;&amp;gt;&amp;lt;&amp;gt;&lt;/a&gt; that I recently created.&lt;/p&gt;&#xA;&lt;p&gt;It is two-dimensional, and has a &lt;em&gt;stack&lt;/em&gt; (array of numbers that can be popped and pushed) and an instruction pointer, which has x and y coordinates and a direction. The instruction pointer starts at 0,0 (top left corner of program), moving right.&lt;/p&gt;&#xA;&lt;p&gt;It has the following commands (some are not included because they would overcomplicate this challenge):&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Command&lt;/th&gt;&#xA;&lt;th&gt;action&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;&amp;gt;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Set the IP's direction to right&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;v&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Set the IP's direction to down&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;&amp;lt;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Set the IP's direction to left&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;^&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Set the IP's direction to up&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;.&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Pop stack and output as character&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;,&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Pop stack and output as number&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;x&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Push x position of the IP to stack&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;y&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Push y position of the IP to stack&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;+&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Increment the top item of the stack&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;-&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Decrement the top item of the stack&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;=&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Pop the top two items from the stack, if they're equal, skip the next instruction.&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;{&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Shift the stack right - put the ToS on the bottom of the stack&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;}&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Shift the stack left - put the bottom item on top of the stack&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;_&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;Pop the stack&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;Every tick, the command pointed to by the IP is executed (Unless it was skipped), and the instruction pointer moves one place in its direction.&lt;/p&gt;&#xA;&lt;p&gt;Despite having so few commands, Tarfish is in theory Turing-Complete.&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to interpret this language.&lt;/p&gt;&#xA;&lt;p&gt;You do not have to implement wrapping - If the instruction poiinter leaves the grid, that is undefined behaviour. If the program tries to pop from an empty stack, that is undefined behaviour.&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, shortest wins!&lt;/p&gt;&#xA;&lt;h1&gt;Testcases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;x++++++++++++++++++++++++++++++++:+:+++++++++++:++++++++++++++++++++++++++++:.+++++++++++++++:++++++++++++++:.+++++++:::..+++:.{{{.{.{{.}}.:++++++.:.--------..; =&amp;gt; Hello, World!&#xA;&#xA;x+, =&amp;gt; 1&#xA;&#xA;v &amp;gt; v &amp;gt; x,&#xA;&amp;gt; ^ &amp;gt; ^&#xA;=&amp;gt; 8&#xA;&#xA;x:++++++++++v&#xA;&amp;gt;+}     :y-=v{,;&#xA;^+++++++++{-&amp;lt;&#xA;=&amp;gt; 100&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="100664" LastActivityDate="2021-08-26T04:18:35.027" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23832" PostTypeId="2" ParentId="5243" CreationDate="2021-08-27T15:56:36.883" Score="3" Body="&lt;h1&gt;500 rep for a shorter Hello, World in Lost&lt;/h1&gt;&#xA;&lt;p&gt;The Hello, World record in lost &lt;a href=&quot;https://codegolf.stackexchange.com/a/137699/56656&quot;&gt;dropped to 36 bytes&lt;/a&gt;.  Since then I have been trying to get it lower.  I'm willing to give 500 reputation to anyone who can come up with a Hello World in 35 bytes or less.&lt;/p&gt;&#xA;&lt;p&gt;It must be a valid answer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world&quot;&gt;the hello world challenge&lt;/a&gt;.  It must deterministically print the exact string &lt;code&gt;Hello, World!&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;100 rep for an answer in Lost&lt;/h1&gt;&#xA;&lt;p&gt;As a more general incentive for programming in Lost I am offering 100 rep for any answer in Lost.&lt;/p&gt;&#xA;&lt;p&gt;Broadly speaking any Lost answer to any challenge which does not already have a Lost answer is eligible.  However I reserve the right to deny the bounty to any &amp;quot;cheaty&amp;quot; answers.  This includes&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;answers to questions which seem to have been asked just so that one can cash in on this bounty&lt;/li&gt;&#xA;&lt;li&gt;answers to questions which have extremely lax validity criteria. For example making a cop on a cops and robbers challenge will probably not get you this bounty.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;As long as your answer is, in lost, works, and shows a baseline amount of effort I would be happy to award this bounty.&lt;/p&gt;&#xA;&lt;p&gt;If you are looking for a place to start here are some questions that I think are answerable in Lost.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/172005/a-chiral-puzzle&quot;&gt;A Chiral Puzzle&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/231525/happy-birthday-caird-coinheringaahing-chartz-belatedly&quot;&gt;Happy Birthday Caird Coinheringahing Chartz Belatedly&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/231858/im-a-lizard-cut-here&quot;&gt;I'm a Lizard Cut Here&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; is a pretty good tag to browse to find more of these.&lt;/p&gt;&#xA;&lt;p&gt;I may not be able to create a 100 rep bounty on the question you have answered.  If this is the case we can work something out.  If your answer is particularly impressive or inventive I will probably just award it more than 100.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2021-09-07T19:03:24.460" LastActivityDate="2021-09-07T19:03:24.460" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23834" PostTypeId="1" CreationDate="2021-08-28T22:27:29.253" Score="41" ViewCount="527" Body="&lt;p&gt;We &lt;a href=&quot;https://stackoverflow.blog/2021/08/19/celebrating-the-stack-exchange-sites-that-turned-10-years-old/&quot;&gt;recently turned 10 years old&lt;/a&gt;. Unfortunately, we didn't really &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=57138628#57138628&quot;&gt;realise&lt;/a&gt; and therefore didn't really celebrate or even mark the occasion. But, it got me thinking about the history of the site, and now that the site blog is a thing, I thought I'd write up a brief (or rather, not so brief) history of the past 10+ years of Code Golf, PPCG and CGCC. Enjoy!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;On September 15th 2008, to celebrate the official public launch of Stack Overflow, &lt;a href=&quot;https://stackoverflow.com/u/13&quot;&gt;Chris Jester-Young&lt;/a&gt; posted the &lt;a href=&quot;https://stackoverflow.com/q/62188&quot;&gt;very first code golf question on SO&lt;/a&gt;. For a few years, &lt;a href=&quot;https://stackoverflow.com/questions/tagged/code-golf&quot;&gt;[code-golf]&lt;/a&gt; problems popped up from time to time on SO. However, people &lt;a href=&quot;https://meta.stackexchange.com/q/24242&quot;&gt;started&lt;/a&gt; &lt;a href=&quot;https://meta.stackexchange.com/q/20912&quot;&gt;expressing&lt;/a&gt; &lt;a href=&quot;https://stackoverflow.com/q/1390296/#comment1231598_1390296&quot;&gt;dislike&lt;/a&gt; for these questions, claiming they weren't really a part of the Q&amp;amp;A system that SO was based on. And so, a proposal for a &lt;a href=&quot;https://area51.stackexchange.com/proposals/4570&quot;&gt;new site&lt;/a&gt; was created on the 8th of June 2010, and entered private beta 6 months later.&lt;/p&gt;&#xA;&lt;p&gt;Just over 10 years ago, Code Golf Stack Exchange came into existence. Since then, we've developed rules, gone through multiple cultural shifts and have changed drastically as a site. I'm a relatively new user, compared to some. I joined in March 2017, right as we were experiencing our all time peak in activity. I wasn't around for a lot of CGCC's history, but I've managed to isolate it down to 5 or 6 &amp;quot;eras&amp;quot; and I hope I can tell them accurately.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;This post contains the rough &amp;quot;story&amp;quot; of the site, and a lot of links to the full details. You shouldn't have to click on any of the links in order to understand something, but it'll definitely help&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;h2&gt;The beginning&lt;/h2&gt;&#xA;&lt;p&gt;On January 27th, 2011, Code Golf entered its private beta, lasting for a week. 258 users joined during that beta, including &lt;a href=&quot;https://codegolf.stackexchange.com/u/194&quot;&gt;Peter Taylor&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/u/95&quot;&gt;gnibbler&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/u/3&quot;&gt;Chris Jester-Young&lt;/a&gt;, who were just a few of the earliest and most influential users at site creation. &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1440235&quot; rel=&quot;nofollow noreferrer&quot;&gt;This&lt;/a&gt; is a  list of those users who posted, many of whom set the groundwork for the site. A couple of weeks later, Chris Jester-Young, &lt;a href=&quot;https://codegolf.stackexchange.com/u/78&quot;&gt;dmckee&lt;/a&gt; and gnibbler were &lt;a href=&quot;/revisions/220/1&quot;&gt;appointed as moderators&lt;/a&gt; and Code Golf officially joined the ranks of SE sites.&lt;/p&gt;&#xA;&lt;p&gt;For the first couple of years, the site sort of just continued along. We averaged around 3 questions per day and had a consistent yet low intake of new and active users. However &lt;a href=&quot;https://www.jsoftware.com/#/&quot; rel=&quot;nofollow noreferrer&quot;&gt;J&lt;/a&gt;, &lt;a href=&quot;http://www.golfscript.com/golfscript/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Golfscript&lt;/a&gt; and &lt;a href=&quot;https://en.wikipedia.org/wiki/APL_(programming_language)&quot; rel=&quot;nofollow noreferrer&quot;&gt;APL&lt;/a&gt; dominated on the site, which upset &lt;a href=&quot;/q/286/66833&quot;&gt;a lot of people&lt;/a&gt; - something we've discussed &lt;a href=&quot;/q/23551/66833&quot;&gt;many times&lt;/a&gt;. Compared to the current site, PPCG was a lawless wasteland - the &lt;a href=&quot;/q/1061/66833&quot;&gt;loopholes&lt;/a&gt; hadn't yet been decided upon, and many &amp;quot;fun&amp;quot; but now-invalid answers were posted. However, despite the minor problems bubbling under the surface, the site was a relatively peaceful - albeit quiet - corner of Stack Exchange. Until a troll arrived.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-trolling-tooltip-container&quot;&gt;code-trolling&lt;/a&gt; and the activity boom&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-trolling-tooltip-container&quot;&gt;code-trolling&lt;/a&gt; challenges began on December 27, 2013 when the &lt;a href=&quot;https://codegolf.stackexchange.com/q/16226/66833&quot;&gt;first one&lt;/a&gt; was posted as an experimental new challenge type. It was immediately a smash, hitting 100 upvotes and 10k views in less than 24 hours, and receiving more than 80 answers. The next day, 8 more &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-trolling-tooltip-container&quot;&gt;code-trolling&lt;/a&gt; challenges were posted, and the site experienced a massive boom in activity. A few days later, the &lt;a href=&quot;https://codegolf.stackexchange.com/q/17005/66833&quot;&gt;second highest voted challenge&lt;/a&gt; was posted, and even more users joined the site. Most notably, future moderator and all around &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=40337818&quot;&gt;awesome person&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/u/12012&quot;&gt;Dennis&lt;/a&gt;, who would later go on to shape much of the community.&lt;/p&gt;&#xA;&lt;p&gt;Unfortunately, code trolling questions are not high quality. Most of them were so broad as to basically be &amp;quot;write some code that has something to do with &amp;lt;insert task here&amp;gt;&amp;quot;, and they were &lt;a href=&quot;https://meta.stackexchange.com/q/214061&quot;&gt;leaking into the network&lt;/a&gt;. Many people disliked them, they were decreasing the quality of questions on the site, and so, after a few months, an &lt;a href=&quot;/q/1514/66833&quot;&gt;official stance was taken&lt;/a&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-trolling-tooltip-container&quot;&gt;code-trolling&lt;/a&gt; is no longer welcome. A massive clean up was organised, and 47 of the 60 existing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-trolling-tooltip-container&quot;&gt;code-trolling&lt;/a&gt; questions were removed. If you have 10000 or more reputation and would like to see those, &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1441822&quot; rel=&quot;nofollow noreferrer&quot;&gt;here's a query with links&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;However, this clean up required users with moderation powers to use them for the Greater Good™ at a time where PPCG had &lt;a href=&quot;/q/757/66833&quot;&gt;very few active moderating users&lt;/a&gt;. Organised by &lt;a href=&quot;https://codegolf.stackexchange.com/u/3808&quot;&gt;Doorknob&lt;/a&gt;, a &lt;a href=&quot;/q/757/66833&quot;&gt;call to action&lt;/a&gt; was put out, and, a few months later, it was officially &lt;a href=&quot;/q/1529/66833&quot;&gt;requested&lt;/a&gt; that PPCG have another moderator appointed - specifically nominating Doorknob. On May 7th 2014, Doorknob was &lt;a href=&quot;/q/1529#comment5778_1529&quot;&gt;officially given a diamond&lt;/a&gt;, something he's kept for the past 7 years as he's competently moderated the site through the rest of the events I'll be recounting.&lt;/p&gt;&#xA;&lt;p&gt;2014 and 2015 were pivotal times for PPCG. Key community posts, such as the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/search?q=created%3A2013-12-31...2015-12-31+is%3Aq+%5Bfaq%5D&quot;&gt;FAQ&lt;/a&gt;, were created during this time to help new users, there was &lt;a href=&quot;/q/1137/66833&quot;&gt;serious discussion&lt;/a&gt; &lt;a href=&quot;/q/1192/66833&quot;&gt;about&lt;/a&gt; &lt;a href=&quot;/q/865/66833&quot;&gt;the future&lt;/a&gt; and &lt;a href=&quot;/q/845/66833&quot;&gt;purpose&lt;/a&gt; of the site, and the dedicated community exploded in size. Users like &lt;a href=&quot;https://codegolf.stackexchange.com/u/20469&quot;&gt;Alex A.&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/u/14215&quot;&gt;Geobits&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/u/18487&quot;&gt;Rainbolt&lt;/a&gt; and many more became leading figures in the site's &lt;em&gt;community&lt;/em&gt;, and made full use of chat as a &amp;quot;third place&amp;quot;. This sense of community is what demarcates PPCG/CGCC from other golfing sites in my opinion, leading to &lt;a href=&quot;/q/5828/66833&quot;&gt;site specific memes and references&lt;/a&gt;&lt;sup&gt;†&lt;/sup&gt; that live on &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=58728642#58728642&quot;&gt;to this day&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;With this new community, came new leaders. In March 2015, Chris Jester-Young &lt;a href=&quot;/q/8909/66833&quot;&gt;stepped down&lt;/a&gt; as a moderator after being hired as a developer at Stack Exchange. He nominated &lt;a href=&quot;https://codegolf.stackexchange.com/u/8478&quot;&gt;Martin Ender&lt;/a&gt; (then Büttner) to replace him. &lt;a href=&quot;/q/5012/66833&quot;&gt;Confirmed&lt;/a&gt; by &lt;a href=&quot;/q/4929/66833&quot;&gt;popular choice&lt;/a&gt;, Martin joined the moderator team and served as one of the most exemplary moderators for 3 more years. As part of the moderation team, he helped define some of the biggest site policies, such as &lt;a href=&quot;/q/2447/66833&quot;&gt;establishing I/O defaults&lt;/a&gt;, our policy on &lt;a href=&quot;/q/12877/66833&quot;&gt;newer languages&lt;/a&gt; being allowed, and starting the discussion about the fact that &lt;a href=&quot;/q/8350/66833&quot;&gt;CGCC isn't a Q&amp;amp;A site&lt;/a&gt; and how we fit with the Stack Exchange model. Furthermore, he helped &lt;a href=&quot;https://esoteric.codes/blog/martin-ender&quot; rel=&quot;nofollow noreferrer&quot;&gt;spread the word&lt;/a&gt; about esolangs and golfing langs, a pivotal part of the CGCC community.&lt;/p&gt;&#xA;&lt;p&gt;5 months later, dmckee, after over 4 years, stepped down as a moderator, prompting an informal &lt;a href=&quot;/q/5688/66833&quot;&gt;moderator election&lt;/a&gt;. Initially, one moderator position was available, and it appeared that &lt;a href=&quot;/a/5749/66833&quot;&gt;Dennis had it in the bag&lt;/a&gt;. However, due to circumstances unknown to all but the moderators and Community Managers, it was decided to offer the position to &lt;em&gt;both&lt;/em&gt; &lt;a href=&quot;/q/5846/66833&quot;&gt;Dennis and Alex A.&lt;/a&gt; At this point, the mod team had undergone far more changes than is typical for a Stack Exchange site not yet graduated. However, from now until 2016, the team was and would stay as gnibbler, Doorknob, Martin Ender, Dennis, Alex A. and Chris Jester-Young&lt;sup&gt;1&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;To close off the year, we started our tradition (not at all &lt;a href=&quot;https://codereview.meta.stackexchange.com/q/1320/134025&quot;&gt;stolen&lt;/a&gt;) of showcasing the &lt;a href=&quot;/q/7910/66833&quot;&gt;best posts&lt;/a&gt; from that year, something that's currently been &lt;a href=&quot;/questions/tagged/best-of&quot;&gt;running for 6 years&lt;/a&gt;. I'd recommend checking out some of the older Best Ofs - they're still excellent demonstrations of languages, techniques, challenges and answers.&lt;/p&gt;&#xA;&lt;p&gt;As a strong and healthy site, PPCG and its community thrived. However, after 1846 days in beta, we felt somewhat neglected or ignored by Stack Exchange. Various pushes to increase activity, efforts to increase the number of high reputation users, etc. were all ignored. Until February 23rd, 2016.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;&lt;sup&gt;1&lt;/sup&gt;: After leaving Stack Exchange in December 2015, Chris rejoined the mod team&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Graduation&lt;/h2&gt;&#xA;&lt;p&gt;After so long in beta, graduation had become a &lt;a href=&quot;/a/5834/66833&quot;&gt;meme&lt;/a&gt;&lt;sup&gt;†&lt;/sup&gt;, a prank made every so often by Geobits and co. to convince people that PPCG was graduating. However, on February 23rd 2016, SE &lt;a href=&quot;/q/5828/#comment24040_5834&quot;&gt;ruined the meme&lt;/a&gt;&lt;sup&gt;†&lt;/sup&gt; by going ahead and &lt;a href=&quot;/q/8538/66833&quot;&gt;graduating us&lt;/a&gt;. With this massive step, we gained many new privileges, such as our own formal moderator elections, some control over the advertisements shown on the site, and, eventually, we got our own design.&lt;/p&gt;&#xA;&lt;p&gt;The first of these changes was PPCG's &lt;a href=&quot;/election/1&quot;&gt;first official moderator election&lt;/a&gt;. When a site graduates, the pro-tem mods must run in the election if they wish to keep serving as moderator. Doorknob, Alex, Dennis and Martin did, against a strong field of candidates. Despite this, Martin was re-elected in a &lt;a href=&quot;https://www.opavote.com/results/6497348721049600&quot; rel=&quot;nofollow noreferrer&quot;&gt;landslide&lt;/a&gt; victory, with Dennis and Doorknob being clear favourites after him. While not as strong as the others, Alex successfully defended his seat by a handy margin. After 5 years, gnibbler declined to run, as did Chris Jester-Young. And so, despite the site going through a pretty big change, the moderation team stayed roughly the same faces as most users were used to.&lt;/p&gt;&#xA;&lt;p&gt;Next to follow would be the &lt;a href=&quot;/q/9463/66833&quot;&gt;Community Ads&lt;/a&gt;, despite some &lt;a href=&quot;/q/9361/66833&quot;&gt;delays&lt;/a&gt; in getting these set up. Community Ads are a system that allow the community to decide what kind of adverts are shown on the site, rather than showing paid or sponsored advertising. These ads, created and voted on by the community, were the first appearance of some of the iconic ads still used today, such &lt;a href=&quot;/a/9536/66833&quot;&gt;the ad&lt;/a&gt; for &lt;a href=&quot;https://tio.run&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt; (an online interpreter of over 600 languages, created and hosted by Dennis), &lt;a href=&quot;/a/9466/66833&quot;&gt;the Sandbox&lt;/a&gt; and &lt;a href=&quot;/a/10138/66833&quot;&gt;Know How To Vote&lt;/a&gt;. The ads themselves weren't an especially big thing, but the intent and meaning behind them was clear: PPCG was no longer a beta site, was now fully grown up and was given more control and independence by Stack Exchange.&lt;/p&gt;&#xA;&lt;p&gt;Continuing the &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1431208/?PostType=questions#graph&quot; rel=&quot;nofollow noreferrer&quot;&gt;trend&lt;/a&gt; from previous years, 2016 and 2017 had a &lt;em&gt;massive&lt;/em&gt; increase in challenges posted each year, both of them reaching over 3000 each. Aside from the boom after &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-trolling-tooltip-container&quot;&gt;code-trolling&lt;/a&gt;, this was the biggest activity increase in the site's history, and was one of the longest sustained. During this period, some of the most well-known questions and answers were posted as well, posts that established just how awesome the site could be at its best. To choose far too few to demonstrate, &lt;a href=&quot;https://codegolf.stackexchange.com/a/142673/66833&quot;&gt;Quest For Tetris&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/71680/66833&quot;&gt;Mathematica's goat builtin&lt;/a&gt; and the still ongoing &lt;a href=&quot;https://codegolf.stackexchange.com/q/102370/66833&quot;&gt;Add a language to a polyglot&lt;/a&gt; were all posted during these two years. I'd suggest, if you have the time, &lt;a href=&quot;https://codegolf.stackexchange.com/search?tab=votes&amp;amp;q=created%3a2016-01-01...2017-12-31&quot;&gt;browsing the top voted posts&lt;/a&gt; from this era.&lt;/p&gt;&#xA;&lt;p&gt;As a grown up SE site, the top of the to-do list was a design. &lt;a href=&quot;/q/7897/66833&quot;&gt;Ideas&lt;/a&gt; were thrown around, to create something that would make PPCG feel unique, rather than the generic blue beta design. Unfortunately, as PPCG graduated through &lt;a href=&quot;https://meta.stackexchange.com/q/260754/355458&quot;&gt;design-independent graduation&lt;/a&gt;, we still had a bit to wait.&lt;/p&gt;&#xA;&lt;h2&gt;A slow decline and occasional improvements&lt;/h2&gt;&#xA;&lt;p&gt;2016 and 2017 experienced perhaps the most activity in the site's history. However, 2018 seemed to go the opposite direction. We had the &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1431208/posts-per-year?PostType=questions#graph&quot; rel=&quot;nofollow noreferrer&quot;&gt;fewest posts&lt;/a&gt; since 2013, and almost 12000 users simply &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1433757/users-stopped-being-active-per-year#graph&quot; rel=&quot;nofollow noreferrer&quot;&gt;stopped visiting&lt;/a&gt; the site in 2017. And yet, there's no obvious reason. There was no cataclysmic event that caused a mass exodus, a new competitor site didn't spring up and steal our userbase. The truth is much more mundane, and something we should always remember in communities: &lt;a href=&quot;https://meta.stackoverflow.com/a/253376/7742131&quot;&gt;People change. Lives change&lt;/a&gt;. People just moved on from the site, for a multitude of reasons, and new faces filled their ranks.&lt;/p&gt;&#xA;&lt;p&gt;The first prominent &amp;quot;loss&amp;quot; was &lt;a href=&quot;https://codegolf.stackexchange.com/u/20469&quot;&gt;Alex A.&lt;/a&gt;, who &lt;a href=&quot;/q/14876/66833&quot;&gt;handed in his diamond&lt;/a&gt; in February 2018. One of the friendliest users you'll ever interact with, and an incredibly level-headed and competent moderator, he had served for 2 and a half years, with his diamond being removed on &lt;a href=&quot;/q/14876/#comment54502_14876&quot;&gt;Feb 26th, 2018&lt;/a&gt;, almost exactly 2 years after we graduated. However, &lt;a href=&quot;/election/2&quot;&gt;stepping into his shoes&lt;/a&gt; were two users who very much deserved to be moderators: &lt;a href=&quot;https://codegolf.stackexchange.com/u/31716&quot;&gt;DJMcMayhem&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/u/45941&quot;&gt;Mego&lt;/a&gt;&lt;sup&gt;2&lt;/sup&gt;.&lt;/p&gt;&#xA;&lt;p&gt;From personal experience, I can attest to the fact that DJ, like Alex, was one of the friendliest users on the site. I remember first visiting &lt;a href=&quot;https://chat.stackexchange.com/rooms/240&quot;&gt;The Nineteenth Byte&lt;/a&gt;, and trying to get involved in code golf, and DJ welcoming me to the site, letting me know of various things I needed to know and more. And, as I took part in the site more, I remember being consistently impressed with how well DJ handled and welcomed new users. Being completely honest, DJ is still one of my role models in introducing newer users to the site. Mego was one of the most principled users on the site, and was very dedicated to moderating the site, even before he got a diamond. Although it doesn't show it&lt;sup&gt;3&lt;/sup&gt;, he was the first user to get &lt;a href=&quot;https://codegolf.stackexchange.com/help/badges/72/marshal&quot;&gt;Marshal&lt;/a&gt;, a badge requiring you to raise 500 helpful flags, was very active in the review queues, and was more than happy to use his deletion powers. We couldn't have asked for 2 better community moderators.&lt;/p&gt;&#xA;&lt;p&gt;Around the same time, the first iteration of the &lt;a href=&quot;/q/14645/66833&quot;&gt;Language of the Month&lt;/a&gt; was started. The first language to be featured was &lt;a href=&quot;/q/14917/66833&quot;&gt;Brachylog&lt;/a&gt;, one of the original golfing languages which has undergone development ever since its &lt;a href=&quot;https://github.com/JCumin/Brachylog/commit/1cddf3be21398520a595ed58511d1d0570cac017&quot; rel=&quot;nofollow noreferrer&quot;&gt;initial commit&lt;/a&gt; in 2015. The event continued for six months until a lack of interest caused the September language to be forgotten, and no more languages became LOTM. That was, until &lt;a href=&quot;https://codegolf.stackexchange.com/u/16766&quot;&gt;DLosc&lt;/a&gt; managed to &lt;a href=&quot;/q/19271/66833&quot;&gt;revive&lt;/a&gt; it in 2020. It's now been going for almost exactly a year since.&lt;/p&gt;&#xA;&lt;p&gt;In March 2018, &lt;a href=&quot;https://meta.stackexchange.com/q/307862/355458&quot;&gt;ch-ch-changes were announced&lt;/a&gt;. In an effort to standardise all SE sites, as well as improve their responsive design, it was announced that sites would essentially get a &lt;a href=&quot;https://meta.stackexchange.com/q/312365/355458&quot;&gt;stock theme&lt;/a&gt;, with only a few sections that would customisable to the site (such as the top banner, and the color scheme). This was disliked by many people across the network - site designs were unique to the sites and they helped make them feel like their own space. Stock themes did the opposite. However, SE decided to continue with this effort, and we were chosen as the &lt;a href=&quot;/q/16736/66833&quot;&gt;first site&lt;/a&gt; to beta this on. This was the first step to CGCC getting its own personalised - albeit somewhat standardised - design.&lt;/p&gt;&#xA;&lt;p&gt;Which &lt;a href=&quot;/q/17760/66833&quot;&gt;happened 10 months later&lt;/a&gt;, and at the same time, the &lt;a href=&quot;/q/16151/66833&quot;&gt;privilege levels&lt;/a&gt; were raised. At the time, we were the &lt;a href=&quot;https://meta.stackexchange.com/a/290363/355458&quot;&gt;second longest site&lt;/a&gt; between graduation and getting a design, with a grand total of 39 months passing between the two. Probably one of the biggest changes that came about from this was the site name. For over 8 years, we'd been &amp;quot;Programming Puzzles &amp;amp; Code Golf&amp;quot;, or PPCG for short. The acronym was &lt;a href=&quot;/q/17760#comment63390_17760&quot;&gt;ingrained into us&lt;/a&gt;. However, after &lt;a href=&quot;/q/17612/66833&quot;&gt;much discussion&lt;/a&gt; around the site name, it was finally decided that we should change the name to &amp;quot;Code Golf &amp;amp; Coding Challenges&amp;quot; (or CGCC).&lt;/p&gt;&#xA;&lt;p&gt;While this was undoubtedly good news, it wasn't an entirely positive time. After more than 3 years moderating this community, shaping our policies and creating all sorts of &lt;a href=&quot;https://esolangs.org/wiki/User:Martin_Ender&quot; rel=&quot;nofollow noreferrer&quot;&gt;crazy esolangs&lt;/a&gt;, Martin Ender &lt;a href=&quot;/q/16843/66833&quot;&gt;stepped down as moderator&lt;/a&gt;. At this point, the moderation team was active and healthy enough to forgo an election, and continued as Doorknob, Dennis, Mego and DJMcMayhem.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;&lt;sup&gt;2&lt;/sup&gt;: Mego has since deleted his account, so this page will 404&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;&lt;sup&gt;3&lt;/sup&gt;: We know for sure that he earned it between &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/35478496#35478496&quot;&gt;Feb 16 2017&lt;/a&gt; and Feb 20 2018 (moderators can't get Marshal, Mego was elected on Feb 20 2018). I haven't been able to pin down a more exact date&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;h2&gt;The Monica Incident and a death spiral&lt;/h2&gt;&#xA;&lt;p&gt;For anyone who was active on the Stack Exchange network in late 2019, the name &amp;quot;Monica&amp;quot; brings up bad memories and for a good reason. On the evening of September 27th 2019, &lt;a href=&quot;https://stackexchange.com/users/505925/monica-cellio&quot;&gt;Monica Cellio&lt;/a&gt;, a well respected moderator on 6 Stack Exchange sites - including &lt;a href=&quot;https://meta.stackexchange.com/&quot;&gt;Meta Stack Exchange&lt;/a&gt; where the moderators are hand-picked by the SE staff - had all of her diamonds removed by Stack Exchange, in response to a &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/51875377#51875377&quot;&gt;discussion&lt;/a&gt;&lt;sup&gt;4&lt;/sup&gt; in the &lt;a href=&quot;https://chat.stackexchange.com/rooms/4&quot;&gt;Teacher's Lounge&lt;/a&gt;&lt;sup&gt;4&lt;/sup&gt; (the moderator only chat room). Her side of the story can be read &lt;a href=&quot;https://judaism.meta.stackexchange.com/q/5193/17184&quot;&gt;here&lt;/a&gt;, and an MSE discussion can be found &lt;a href=&quot;https://meta.stackexchange.com/q/333965/355458&quot;&gt;here&lt;/a&gt;, including a list of all moderators who resigned their positions due to this firing.&lt;/p&gt;&#xA;&lt;p&gt;Two such moderators were our own: &lt;a href=&quot;/q/18133/66833&quot;&gt;Dennis&lt;/a&gt; and &lt;a href=&quot;/q/18240/66833&quot;&gt;Mego&lt;/a&gt;. Additionally, in protest to the new &lt;a href=&quot;https://meta.stackexchange.com/q/333089/355458&quot;&gt;relicensing&lt;/a&gt;, Mego requested that all his content on the network be dissociated with him, and his accounts removed. This incident was a dark period of time for the entire network, many users &lt;a href=&quot;/q/18136/66833&quot;&gt;considered leaving&lt;/a&gt; the site all together, and many more users decided they'd rather not contribute to SE, given the behaviour they were showing. Some of the best users on the site, such as Peter Taylor, &lt;a href=&quot;https://codegolf.stackexchange.com/u/41024&quot;&gt;Erik the Outgolfer&lt;/a&gt;, Dennis, and many more went inactive in the following months, many of them explicitly blaming what SE did to Monica or the forced relicensing as the trigger. Activity dropped to an all time low (since &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-trolling-tooltip-container&quot;&gt;code-trolling&lt;/a&gt;), TNB started going for hours and even days without conversation, and more and more users began to leave. CGCC was in a death spiral.&lt;/p&gt;&#xA;&lt;p&gt;Right at the depths of this spiral, with a moderation team of just 2 and unhandled flags piling up, SE &lt;a href=&quot;/q/18269/66833&quot;&gt;asked us&lt;/a&gt; if we'd be interested in replacing Dennis and Mego and electing two mods to replace them. Unsurprisingly, the answer was a resounding no. Many users felt that the situation with Monica had not been adequately &lt;a href=&quot;/q/18269/#comment65833_18269&quot;&gt;resolved&lt;/a&gt;, and that they couldn't trust SE enough to hold a position as moderator. Even more users were outraged by SE referring to the potential election as&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;[finding] replacements for Mego and Dennis&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Unfortunately, a couple of months later in January 2020, after 2 years as a moderator, and almost 5 years on the site, &lt;a href=&quot;/q/18476/66833&quot;&gt;DJMCMayhem handed in their diamond&lt;/a&gt;. This reduced the moderation team to just Doorknob, and flags started spending months pending. SE is fairly lax about what will cause a site to be shut down, but the ultimate stopping point is &amp;quot;Are there users willing to step up and moderate this community?&amp;quot;. Between Doorknob's low activity, and more and &lt;a href=&quot;/q/18457/66833&quot;&gt;more users leaving&lt;/a&gt;, it didn't look like CGCC was in a healthy place. It wasn't even sure &lt;a href=&quot;/q/18477/66833&quot;&gt;what the future of CGCC looked like&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;&lt;sup&gt;4&lt;/sup&gt;: Unless you're a moderator, these links won't work for you, as they link to a moderator only room&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Present day and a slow recovery&lt;/h2&gt;&#xA;&lt;p&gt;At this time, CGCC was stuck in a bit of a weird place. We'd just experienced a mass exodus of users, and for the months between Monica's firing and the January interest check, activity plummeted. However, between January and September, we experienced an &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1453575&quot; rel=&quot;nofollow noreferrer&quot;&gt;influx of new faces&lt;/a&gt;, and a surprising &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1453574/?PostType=questions&amp;amp;Year=2020#graph&quot; rel=&quot;nofollow noreferrer&quot;&gt;uptick in activity&lt;/a&gt;. It seemed as though CGCC was, at least activity-wise, starting to recover. However, in the main factor SE considers - active moderators - we still only had 1 moderator, and, at the time of the election, over 100 unhandled flags.&lt;/p&gt;&#xA;&lt;p&gt;However, in September 2020, we were &lt;a href=&quot;/q/19320/66833&quot;&gt;scheduled for an election&lt;/a&gt; and &lt;a href=&quot;/q/19339/#comment69857_19340&quot;&gt;given an ultimatum&lt;/a&gt;: find people willing to moderate the site, or have the site shut down. And so, on the 14th of September 2020, the &lt;a href=&quot;/election/3&quot;&gt;3rd moderator election&lt;/a&gt; began. In a similar fashion to previous elections of having one user win outright, &lt;a href=&quot;https://codegolf.stackexchange.com/u/56656/&quot;&gt;Wheat Wizard&lt;/a&gt; received &lt;a href=&quot;https://www.opavote.com/results/4856246717906944&quot; rel=&quot;nofollow noreferrer&quot;&gt;over 50% of the first round of voting&lt;/a&gt;, with second and third place being narrowly awarded to &lt;a href=&quot;https://codegolf.stackexchange.com/u/68942&quot;&gt;hyper-neutrino&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/u/76162&quot;&gt;Jo King&lt;/a&gt;. They spent their first few hours as moderators &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/55690934#55690934&quot;&gt;working through the flag backlog&lt;/a&gt;, and ever since then, they've all served as excellent moderators for the past 11 months.&lt;/p&gt;&#xA;&lt;p&gt;Related or not, the increase in moderator activity seems to have come with an increase in overall site activity. With this increased activity, came the &lt;a href=&quot;/q/20499/66833&quot;&gt;Best of 2019&lt;/a&gt; (delayed by a year) and, a couple of months later, the &lt;a href=&quot;/q/20638/66833&quot;&gt;Best of 2020&lt;/a&gt;. In addition, more posts were made to our meta requesting improved features, such as &lt;a href=&quot;/q/20624/66833&quot;&gt;improving our ask page&lt;/a&gt;, &lt;a href=&quot;/q/22108/66833&quot;&gt;disabling auto protection&lt;/a&gt; and &lt;a href=&quot;/q/20861/66833&quot;&gt;creating a welcome page&lt;/a&gt;. One part of this was the &lt;a href=&quot;/q/23456/66833&quot;&gt;Great Status Tag Updates&lt;/a&gt;™, an effort by &lt;a href=&quot;https://codegolf.stackexchange.com/u/66833&quot;&gt;caird coinheringaahing&lt;/a&gt; and hyper-neutrino to apply status tags to old &lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-feature-request-tooltip-container&quot;&gt;feature-request&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-bug-tooltip-container&quot;&gt;bug&lt;/a&gt; reports, to make it easier to find what needs to be done, and what's in the works.&lt;/p&gt;&#xA;&lt;p&gt;One area of the site that has undeniably grown an incredible amount since the low of 2020: &lt;a href=&quot;https://chat.stackexchange.com/rooms/240&quot;&gt;chat&lt;/a&gt;. We've had &lt;a href=&quot;/q/22143/66833&quot;&gt;new room owners&lt;/a&gt; &lt;a href=&quot;/q/24791/107299&quot;&gt;elected&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/chat-events&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chat-events&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;chat-events&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-chat-events-tooltip-container&quot;&gt;chat-events&lt;/a&gt; brainstormed and created and the slow, old feeds &lt;a href=&quot;/q/22365/66833&quot;&gt;replaced&lt;/a&gt; with sleek new bots, powered entirely by butter. Chat is, for better or worse, no longer an empty wasteland populated only by Feed oneboxes, and has now developed yet &lt;a href=&quot;https://the-nineteenth-byte.fandom.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;another culture&lt;/a&gt; of its own. If you're interested in a space for chatting about code golf that's slightly less formal than main or meta, feel free to drop by &lt;a href=&quot;https://chat.stackexchange.com/rooms/240&quot;&gt;The Nineteenth Byte&lt;/a&gt; and say hi!&lt;/p&gt;&#xA;&lt;p&gt;But that brings us to the present day! Where the site may go in the future is anyone's guess - personally, I hope it sticks around for a long while. I hope you enjoyed reading about the history that this site has gone through. I've almost certainly missed events that you may remember specifically, and I may have recounted others in a way you might not remember, but I've tried my best to include the best parts of the site, through how I've seen them. Feel free to let me know in the comments what I've gotten wrong, and what you think the site will look like over the next 10 years!&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;&lt;sup&gt;†&lt;/sup&gt;: Deleted, only visible to users with 10k or more reputation&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="108218" LastEditDate="2023-03-31T17:02:56.850" LastActivityDate="2023-03-31T17:02:56.850" Title="CGCC Blog Post #2: The history of PPCG and CGCC" Tags="|discussion|cgcc-blog|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23835" PostTypeId="2" ParentId="23834" CreationDate="2021-08-28T22:27:29.253" Score="9" Body="&lt;h1&gt;Underappreciated posts&lt;/h1&gt;&#xA;&lt;p&gt;As part of blog posts, we'll demonstrate some of the more unappreciated posts on the site, and we highly recommend you check them out and give them an upvote. These were nominated by various users, and if you think you've found an answer that deserves more appreciation, feel free to drop a link to it in the &lt;a href=&quot;https://chat.stackexchange.com/rooms/123200/cgcc-blog-chat&quot;&gt;CGCC Blog chat room&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/u/82738&quot;&gt;JosiahRyanW&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/233625/66833&quot;&gt;Taxi answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/51812/66833&quot;&gt;Ninjas and Monkeys and Bears, Oh My!&lt;/a&gt;. This challenge was already fairly complex (even modern golfing languages are 18 bytes long), and OP has managed to abuse Taxi, an incredibly difficult language to use, to do it. Definitely worth checking out.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/u/89860&quot;&gt;anderium&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/229209/66833&quot;&gt;Taxi answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/200306/66833&quot;&gt;Scream very loudly&lt;/a&gt;. This challenge is one of the classic challenges to demonstrate the more esoteric languages, as the overall task is easy to understand but can be difficult to implement in some. Taxi is one of these languages, where looping indefinitely can be very hard to do. Additionally, anderium included an easy to understand explanation, as well as demonstrating a method that applies to other Taxi answers on the site.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/u/99540&quot;&gt;cnamejj&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/230957/66833&quot;&gt;&amp;gt;&amp;lt;&amp;gt; answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/218618&quot;&gt;Evaluate left-or-right&lt;/a&gt;. The challenge is centered around evaluating strings that look like &amp;gt;&amp;lt;&amp;gt; and similar, so the language is very fitting. On top of that, cnamejj has impressively utilised &amp;gt;&amp;lt;&amp;gt; features to save bytes, &lt;em&gt;and&lt;/em&gt; has included a comprehensive explanation.&lt;/p&gt;&#xA;&lt;p&gt;These are some very impressive, underrated answers, and we encourage you to check them out :)&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;Moved to an answer because the question body was too long&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-08-28T22:27:29.253" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23836" PostTypeId="1" CreationDate="2021-09-01T01:03:04.900" Score="11" ViewCount="594" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19271/78850&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout September 2021, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://stedolan.github.io/jq/&quot; rel=&quot;nofollow noreferrer&quot;&gt;jq&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;What's a Language of the Month?&lt;/h2&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/78850&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during September, those who wish to participate should learn jq, and use it to solve challenges.&lt;/p&gt;&#xA;&lt;h2&gt;Information about jq&lt;/h2&gt;&#xA;&lt;p&gt;jq is a lightweight practical language for querying JSON files. It's like sed for JSON files.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Streams in jq can be very powerful. Operators see individual items in strings when applied:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;range(4) -&amp;gt; 0, 1, 2, 3&#xA;range(4) + 2 -&amp;gt; 1, 2, 3, 4&#xA;&#xA;# Sometimes, a cartesian-product-like output can be produced with&#xA;&#xA;range(2) + range(4) -&amp;gt; 0,1, 1,2, 2,3, 3,4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Piping - Outputs of the previous expression can be piped.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;3 | .+2  #  -&amp;gt; 5&#xA;&#xA;[3, 4, 5] | max   # -&amp;gt; 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Compact syntax&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1, 2, 3] | map( . + 1 ) # -&amp;gt; [2, 3, 4]&#xA;&#xA;# (This could also be achieved as [1, 2, 3][]|.+1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Bounty&lt;/h2&gt;&#xA;&lt;p&gt;I (Emanresu A, or whatever I end up changing my name to) will award a +50 bounty for any user's first jq answer posted during this month. A user doesn't qualify if they have posted a jq answer before.&lt;/p&gt;&#xA;&lt;p&gt;I will only award this bounty on questions which I haven't answered, because I have to award +100 or more on questions which I have. If the question you answered has been answered by me as well, provide another jq answer and I'll happily bounty that.&lt;/p&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://stedolan.github.io/jq/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Official website&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://stedolan.github.io/jq/manual/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Manual&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://jqplay.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;jqplay.org&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#jq&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try It Online&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/233883/tips-for-golfing-in-jq&quot;&gt;Tips thread&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="16766" LastEditDate="2021-09-23T20:47:40.980" LastActivityDate="2021-09-23T20:47:40.980" Title="Language of the Month for September 2021: jq" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="23837" PostTypeId="2" ParentId="23836" CreationDate="2021-09-01T01:03:04.900" Score="3" Body="&lt;h1&gt;List of all jq solutions posted in September 2021&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;First-time answerers highlighted in bold, bounty requests in italic. For bounty requests, I can't award it if I've bountied the question already or answered it already&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/233904/100664&quot;&gt;Remove oddly nested substrings&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812/michael-chatiskatzi&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/233938&quot;&gt;&amp;quot;-rot&amp;quot; transform&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812/michael-chatiskatzi&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/203330/is-it-a-brainfuck-instruction/234970#234970&quot;&gt;Is it a brainfuck instruction?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/92116/wasif&quot;&gt;wasif&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210071/the-vanilla-factorial-challenge/234981#234981&quot;&gt;The vanilla factorial challenge&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.codidact.com/posts/283838/283953#answer-283953&quot; rel=&quot;nofollow noreferrer&quot;&gt;Make my number binary&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/93991/jimmy-these-arrays-down/235028#235028&quot;&gt;Jimmy these arrays down&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/231736/index-and-return-3-characters/235033#235033&quot;&gt;Index and return 3 characters&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/53812/make-the-mexican-wave/235044#235044&quot;&gt;Make the Mexican Wave&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/68978/generate-the-abacaba-sequence/235046#235046&quot;&gt;Generate the Abacaba sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.codidact.com/posts/283966/283977#answer-283977&quot; rel=&quot;nofollow noreferrer&quot;&gt;&amp;quot;Hello, {name}!&amp;quot;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/235047/64121&quot;&gt;Make the Mexican Wave&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/64121/ovs&quot;&gt;ovs&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/235048/64121&quot;&gt;It was just a bug&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/64121/ovs&quot;&gt;ovs&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/234999/90812&quot;&gt;The vanilla factorial challenge&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812/michael-chatiskatzi&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/235055/64121&quot;&gt;Find me vowels near you&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/64121/ovs&quot;&gt;ovs&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/144512/recursively-concatenated-cumulative-sums-of-n-with-m-iterations/235059#235059&quot;&gt;Recursively concatenated cumulative sums of [N] with M iterations&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/235061/64121&quot;&gt;Generate alphabet with 4 copies of each letter&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/64121/ovs&quot;&gt;ovs&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/235063/16766&quot;&gt;Code Golf Christmas Edition&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/235066/16766&quot;&gt;Print this diamond&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/235065/90812&quot;&gt;Hunt for discount&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812/michael-chatiskatzi&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/82604/approximation-of-e/235071#235071&quot;&gt;Approximation of e&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/235077/64121&quot;&gt;Generate the Abacaba sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/64121/ovs&quot;&gt;ovs&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/15882/generate-alphabet-with-4-copies-of-each-letter/235078#235078&quot;&gt;Generate alphabet with 4 copies of each letter&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/234995/display-a-number-in-toki-pona/235085#235085&quot;&gt;Display a number in Toki Pona&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/3852/lynn&quot;&gt;Lynn&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/233942/eulers-numerus-idoneus/235086#235086&quot;&gt;Euler&amp;#39;s numerus idoneus&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/3852/lynn&quot;&gt;Lynn&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/8696/print-this-diamond/235087#235087&quot;&gt;Print this diamond&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/3852/lynn&quot;&gt;Lynn&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/53812/make-the-mexican-wave/235088#235088&quot;&gt;Make the Mexican Wave&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/3852/lynn&quot;&gt;Lynn&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/186151/the-qvolume-of-an-integer/235097#235097&quot;&gt;The qvolume of an integer&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/84297/distinct-sieves/235099#235099&quot;&gt;Distinct Sieves&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/235135/90812&quot;&gt;Longest Zero Sum Sub-array&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812/michael-chatiskatzi&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/235141&quot;&gt;Fibonacci function or sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/64121/ovs&quot;&gt;ovs&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/223590/output-a-latin-square/235161#235161&quot;&gt;Output a Latin Square&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/98541/marcmush&quot;&gt;MarcMush&lt;/a&gt;&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/217614/print-a-conversion-table-for-unsigned-bytes/235163#235163&quot;&gt;Print a conversion table for (un)signed bytes&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/98541/marcmush&quot;&gt;MarcMush&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/235180/90812&quot;&gt;Who is the rightful ruler?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812/michael-chatiskatzi&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/235102/whens-the-listening-party/235133#235133&quot;&gt;When&amp;#39;s the Listening Party?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/235199/unlolify-a-lolified-message/235205?noredirect=1#comment535215_235205&quot;&gt;Unlolify a lolified message&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/235297/90812&quot;&gt;Show me the trajectory&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812/michael-chatiskatzi&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/235382/16766&quot;&gt;Implement a 2-tag system simulator&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/235523/triple-countdown-sequence/235528#235528&quot;&gt;Triple countdown sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;List of all jq tips posted in September 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/235138/64121&quot;&gt;Use try-// instead of if-then-else&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/64121/ovs&quot;&gt;ovs&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;tip title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;List of jq-related challenges posted in September 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  [&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/q/&amp;lt;question-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="80214" LastEditDate="2021-09-19T16:57:56.147" LastActivityDate="2021-09-19T16:57:56.147" CommentCount="0" CommunityOwnedDate="2021-09-01T01:03:04.900" ContentLicense="CC BY-SA 4.0" />
  <row Id="23839" PostTypeId="1" CreationDate="2021-09-04T06:19:18.037" Score="11" ViewCount="198" Body="&lt;p&gt;There will be a video call meeting between us (moderators) and several Community Managers soon, and I'd like your feedback on things we should ask about. There is already a list of questions that will be discussed at the meetings and we can still add a few to the thread on the private team, but there will also be time during the meeting itself to discuss more things that weren't mentioned before.&lt;/p&gt;&#xA;&lt;p&gt;Specifically, are there any topics you would like me to bring up or any specific questions you would like me to ask regarding anything to do with Stack Exchange? Feel free to include ideas specific to CGCC, but we must also remember that SE is going to prioritize decisions and topics that benefit the entire network rather than just one or a couple of sites, so if you have a way to extend some considerations to the whole network, that might get a better response (and I'll try to do the same with any questions specific to this site).&lt;/p&gt;&#xA;&lt;p&gt;Of course, I can't guarantee I'll be able to ask all of them, and I can't promise I'll even consider them all; some I might silently decide to skip. However, this is a very valuable opportunity for moderators to directly discuss with community managers about things that matter to &lt;em&gt;us&lt;/em&gt; and to relay things from the community up, rather than for them to relay things from the company down. Thus, I would like to know what the community does want relayed up, since the call is to talk about things that matter to us as moderators, and by extension to me, a large part of that is what matters to you.&lt;/p&gt;&#xA;&lt;p&gt;Questions or topics should relate to things that are controlled by the network, the staff, etc (even if it's specific to this site, things like changing the help center, for example, are locked from us and so that is something necessary for the &amp;quot;higher ups&amp;quot; to consider that I can't do anything about); things relating to this site's moderation should just be posted on meta for this site's moderators to see.&lt;/p&gt;&#xA;&lt;p&gt;Here are a couple examples of questions/topics that have already been brought up to give you a better sense of what we're looking for:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Why are we still launching changes to the sites without discussing them with at least the mods first?&lt;/li&gt;&#xA;&lt;li&gt;Magic wand time: What would the CM team love to change? And is there anything you want to keep?&lt;/li&gt;&#xA;&lt;li&gt;In the light of recent events I'm wondering how the Stack Exchange Community-a-thon went.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Please post one topic/question per answer and vote on things you'd like discussed so I can get a better sense of how much the community wants each potential point of discussion to happen.&lt;/p&gt;&#xA;&lt;p&gt;Finally, here's a question asked to us (moderators) that might help prompt some ideas that I'd be interested in seeing the community's answers to as well:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;How can community managers better support you? We're not developers, so we can't fix bugs or implement feature requests. We are curious what non-technical support you would like to see from the Community Management Team. Should we write a community management course for moderators? Answer some questions on a child meta site? Adjust some site settings for your community? Please, tell us!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-09-05T04:51:04.400" LastActivityDate="2021-09-07T19:54:31.110" Title="CM/Mod meetup - what do you want discussed?" Tags="|discussion|moderators|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23840" PostTypeId="2" ParentId="2140" CreationDate="2021-09-04T11:54:15.653" Score="0" Body="&lt;h1&gt;What will the radio play next week?&lt;/h1&gt;&#xA;&lt;p&gt;Each week, Billboard publishes the US music industry standard ranking of the 100 most popular songs based on sales, radio play, and online streaming. &lt;a href=&quot;https://www.billboard.com/charts/hot-100&quot; rel=&quot;nofollow noreferrer&quot;&gt;The current chart can be found here.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For each song on the chart, Billboard reports the song's current ranking (from 1 to 100, with 1 being the best), the previous week's ranking of that song (labeled &amp;quot;last week&amp;quot;), the best ranking that the song has ever received by Billboard (labeled &amp;quot;peak&amp;quot;), and the number of weeks that the song has appeared on Billboard charts to date (labeled &amp;quot;wks on chart&amp;quot;).&lt;/p&gt;&#xA;&lt;p&gt;Pop stations in the US generally play the top 40 most popular songs on a given week. In this challenge, we will predict what the radio will play next week given previous Billboard charts.&lt;/p&gt;&#xA;&lt;h2&gt;The Data&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.dropbox.com/s/pyyeahrc16ph01b/lastweek.txt?dl=0&quot; rel=&quot;nofollow noreferrer&quot;&gt;This text file&lt;/a&gt; provides the &amp;quot;last week&amp;quot; data for every chart from July 25, 2015 though July 17, 2021 (based on data provided &lt;a href=&quot;https://www.kaggle.com/dhruvildave/billboard-the-hot-100-songs&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;). There are 313 lines (one for each week) with 100 comma-separated numbers in each line. The first line corresponds to July 25, 2015, and &lt;a href=&quot;https://www.billboard.com/charts/hot-100/2015-07-24&quot; rel=&quot;nofollow noreferrer&quot;&gt;on that week's chart&lt;/a&gt;, &amp;quot;Cheerleader&amp;quot; by OMI was ranked #1 (up from #2 the previous week), while Chris Young's &amp;quot;I'm Comin' Over&amp;quot; made its debut on the chart at #100. In the first line of the data provided, this is reflected with the first entry being &lt;code&gt;2&lt;/code&gt; and the last entry being &lt;code&gt;101&lt;/code&gt; (throughout, &lt;code&gt;101&lt;/code&gt; indicates that the song did not chart on the previous week). The next line of the data starts with a &lt;code&gt;1&lt;/code&gt;, indicating that OMI's &amp;quot;Cheerleader&amp;quot; was still ranked #1 on &lt;a href=&quot;https://www.billboard.com/charts/hot-100/2015-08-01&quot; rel=&quot;nofollow noreferrer&quot;&gt;the August 1, 2015 chart&lt;/a&gt;. In this way, the data captures how songs move up and down the chart from week to week.&lt;/p&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a program or function that, for each &lt;code&gt;n&lt;/code&gt; from &lt;code&gt;0&lt;/code&gt; to &lt;code&gt;312&lt;/code&gt;, receives the first &lt;code&gt;n&lt;/code&gt; lines of the data as input and outputs &lt;strong&gt;the first 40 numbers&lt;/strong&gt; from line &lt;code&gt;n+1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply. The shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; rel=&quot;tag&quot;&gt;compression&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="85259" LastEditorUserId="85259" LastEditDate="2021-09-04T12:53:26.240" LastActivityDate="2021-09-04T12:53:26.240" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23841" PostTypeId="2" ParentId="23839" CreationDate="2021-09-04T14:57:57.547" Score="15" Body="&lt;h1&gt;Discussing the sandbox&lt;/h1&gt;&#xA;&lt;p&gt;I think this would be an important thing to touch on, since it's such an important part of the site and we have so many little (and big) things that would improve it. The concept of sandboxing could also be useful on quite a few other sites, so it's relevant to the network as a whole.&lt;/p&gt;&#xA;&lt;p&gt;Things that could be brought up include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Problems our sandbox currently has, like reviewing being difficult or people not noticing it&lt;/li&gt;&#xA;&lt;li&gt;We have over 3000 posts in the sandbox, and any sort of clean-up is basically impossible because there's so many&lt;/li&gt;&#xA;&lt;li&gt;Simpler solutions to the problem, like having a mod-only &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sandbox&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sandbox&amp;#39;&quot; rel=&quot;tag&quot;&gt;sandbox&lt;/a&gt; tag that could automatically put information about the sandbox somewhere visible on main, as well as make other changes (like sorting by active by default)&lt;/li&gt;&#xA;&lt;li&gt;The possibility of having a more official sandboxing feature, maybe even something like a sandbox.codegolf subdomain&lt;/li&gt;&#xA;&lt;li&gt;Other sites that could have a use for sandboxing, and other ways an official sandboxing feature could be useful (like migrating questions that need a lot of work, but are still useful or interesting)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-09-04T14:57:57.547" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23842" PostTypeId="2" ParentId="2140" CreationDate="2021-09-04T19:36:29.577" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/235279/implement-a-tag-system-simulator&quot;&gt;Implement a tag system simulator&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="104836" LastEditorUserId="104836" LastEditDate="2021-09-12T17:07:29.963" LastActivityDate="2021-09-12T17:07:29.963" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23843" PostTypeId="2" ParentId="23839" CreationDate="2021-09-05T00:46:46.690" Score="7" Body="&lt;h2&gt;Company engagement with the network&lt;/h2&gt;&#xA;&lt;p&gt;&lt;sup&gt;Short comment/question&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;Does Stack Exchange want its employees to be engaged with sites in the network aside from Stack Overflow, Meta Stack Overflow and Meta Stack Exchange? If so, how does the company aim to not only improve this engagement, but make it clear to the community as a whole that it is improving?&lt;/p&gt;&#xA;&lt;p&gt;Events like the Community-a-thon are promising, but don't show the necessarily visibility to demonstrate that the company is making efforts to engage - as &lt;em&gt;users&lt;/em&gt; of their own product, not as &lt;em&gt;staff&lt;/em&gt; - with the network.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sup&gt;Longer version&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;When Stack Overflow was first started, the core developer team at the company were very closely engaged with the community. As more sites were added, members of the team became engaged with these sites as well. Taking a look at some of the former employees' flairs:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://stackexchange.com/users/1&quot;&gt;&lt;img src=&quot;https://stackexchange.com/users/flair/1.png&quot; alt=&quot;Network flair for Jeff&quot; /&gt;&lt;/a&gt; &lt;a href=&quot;https://stackexchange.com/users/34933&quot;&gt;&lt;img src=&quot;https://stackexchange.com/users/flair/34933.png&quot; alt=&quot;Network flair for Robert&quot; /&gt;&lt;/a&gt; &lt;a href=&quot;https://stackexchange.com/users/620&quot;&gt;&lt;img src=&quot;https://stackexchange.com/users/flair/620.png&quot; alt=&quot;Network flair for Shog&quot; /&gt;&lt;/a&gt; &lt;a href=&quot;https://stackexchange.com/users/20808&quot;&gt;&lt;img src=&quot;https://stackexchange.com/users/flair/20808.png&quot; alt=&quot;Network flair for Tim&quot; /&gt;&lt;/a&gt; &lt;a href=&quot;https://stackexchange.com/users/42117&quot;&gt;&lt;img src=&quot;https://stackexchange.com/users/flair/42117.png&quot; alt=&quot;Network flair for Pops&quot; /&gt;&lt;/a&gt; &lt;a href=&quot;https://stackexchange.com/users/1190&quot;&gt;&lt;img src=&quot;https://stackexchange.com/users/flair/1190.png&quot; alt=&quot;Network flair for Oded&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;As you can see by their network reputation, and the sites they have that reputation on, these high ranking staff members weren't only engaged on SO and MSE, but also on a large range of the different sites in the network.&lt;/p&gt;&#xA;&lt;p&gt;Comparing this to the &lt;a href=&quot;https://meta.stackexchange.com/q/349266/355458&quot;&gt;current CM and PubPlat teams&lt;/a&gt;, or the CEO and the Head of Community:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://stackexchange.com/users/16260110&quot;&gt;&lt;img src=&quot;https://stackexchange.com/users/flair/16260110.png&quot; alt=&quot;Network flair for Prashanth&quot; /&gt;&lt;/a&gt; &lt;a href=&quot;https://stackexchange.com/users/17536667&quot;&gt;&lt;img src=&quot;https://stackexchange.com/users/flair/17536667.png&quot; alt=&quot;Network flair for Teresa&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;These are especially important members of staff, when it comes to engagement with the communities, as their actions will have the most direct impact on those users. Unfortunately, a lot of these users only have engagement on a small set of Stack Exchange sites.&lt;/p&gt;&#xA;&lt;p&gt;I therefore believe it'd be beneficial for Stack Exchange, as a company, to work on improving community engagement with its employees. The &lt;a href=&quot;https://meta.stackexchange.com/q/367628/355458&quot;&gt;Community-a-thon&lt;/a&gt; is a good event, but, by design, it doesn't visibly demonstrate this engagement in any way aside from the posts on Meta Stack exchange.&lt;/p&gt;&#xA;&lt;p&gt;Does Stack Exchange share my beliefs in the importance of engaging their staff, as users, with their network as a whole? If so, what goals do they have, and what efforts are they taking, to improve this and to do so visibly?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-09-05T00:46:46.690" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23845" PostTypeId="2" ParentId="2140" CreationDate="2021-09-05T17:57:02.493" Score="1" Body="&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2021-09-06T11:48:21.370" LastActivityDate="2021-09-06T11:48:21.370" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23848" PostTypeId="2" ParentId="2140" CreationDate="2021-09-07T03:00:45.043" Score="0" Body="&lt;h1&gt;Multiple Averages&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In math, the average or mean of a range of numbers is in the middle of all of the numbers. The farthest number in the range from the average is as close as possible to it. So, to find multiple averages of a range of numbers, one would have to find numbers that best represent the numbers in the collection that are closest to them.&lt;/p&gt;&#xA;&lt;p&gt;For example, the two averages of the range from 1 to 5 are 2 and 4. 2 represents the numbers 1-3, while 4 represents the numbers 3-5. Below is a diagram to help understand why these numbers best represent the range.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/qrlFC.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/qrlFC.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;A simple way to calculate the averages is to divide the range into equal parts and calculate the average of each part. For the previous example, the average of 1-3 is 2 and the average of 3-5 is 4.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Create a program that takes three inputs: a number &lt;em&gt;f&lt;/em&gt;, another number &lt;em&gt;l&lt;/em&gt; and a positive integer &lt;em&gt;n&lt;/em&gt;, and outputs the &lt;em&gt;n&lt;/em&gt; averages of the range of integers from &lt;em&gt;f&lt;/em&gt; to &lt;em&gt;l&lt;/em&gt;, inclusive. Assume that there are &lt;em&gt;n&lt;/em&gt; or more numbers within this range.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output can be a list/array or a string of numbers separated by spaces.&lt;/li&gt;&#xA;&lt;li&gt;The order of the output does not matter.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are not allowed.&lt;/li&gt;&#xA;&lt;li&gt;This is code-golf, so the shortest code wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;&lt;em&gt;f&lt;/em&gt;&lt;/th&gt;&#xA;&lt;th&gt;&lt;em&gt;l&lt;/em&gt;&lt;/th&gt;&#xA;&lt;th&gt;&lt;em&gt;n&lt;/em&gt;&lt;/th&gt;&#xA;&lt;th&gt;Output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;1.5, 2.5&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;5&lt;/td&gt;&#xA;&lt;td&gt;5&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;5&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;td&gt;25&lt;/td&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;9.25, 19.75&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;42&lt;/td&gt;&#xA;&lt;td&gt;-4&lt;/td&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;td&gt;3.666..., 19, 34.333...&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;td&gt;27&lt;/td&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;td&gt;3.375, 10.125, 16.875, 23.625&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;7&lt;/td&gt;&#xA;&lt;td&gt;2.5&lt;/td&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;td&gt;3.25, 4.75, 6.25&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the explanation clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Is this challenge fit for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;?&lt;/li&gt;&#xA;&lt;li&gt;Is this challenge too hard or easy?&lt;/li&gt;&#xA;&lt;li&gt;What should be changed?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="91262" LastEditorUserId="91262" LastEditDate="2021-09-08T13:52:20.180" LastActivityDate="2021-09-08T13:52:20.180" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23849" PostTypeId="2" ParentId="2140" CreationDate="2021-09-07T08:51:53.413" Score="1" Body="&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2021-09-07T13:10:56.553" LastActivityDate="2021-09-07T13:10:56.553" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23850" PostTypeId="2" ParentId="2140" CreationDate="2021-09-07T12:18:38.473" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/235199/unlolify-a-lolified-message&quot;&gt;Unlolify a lolified message!&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="71117" LastEditorUserId="100664" LastEditDate="2021-09-10T10:35:55.470" LastActivityDate="2021-09-10T10:35:55.470" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23851" PostTypeId="2" ParentId="2140" CreationDate="2021-09-07T16:32:42.200" Score="0" Body="&lt;h1&gt;Binary integer subtraction a - b with 0 &amp;lt; b &amp;lt; a using string processing logic  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/subtraction&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;subtraction&amp;#39;&quot; rel=&quot;tag&quot;&gt;subtraction&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;My Work&lt;/h2&gt;&#xA;&lt;p&gt;I noticed that for this subtraction problem it is not necessary to use twos-complement and that the result can be stored in the same memory required to store &lt;code&gt;a&lt;/code&gt;; all that is required is to employ symbolic/logic processing on bit/char-strings.&lt;/p&gt;&#xA;&lt;p&gt;I wrote a Python program that uses &lt;code&gt;divmod&lt;/code&gt;, but that was just a way of 'shifting-off'  the right most bit from the bitstring, so the code-golf answers should not use any arithmetical operations.&lt;/p&gt;&#xA;&lt;p&gt;Here is my program, which can be taken to solve an implicit string processing specification:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;minuend =    int(10**1111)&#xA;subtrahend = int(10**1110)&#xA;&#xA;if True: #debugging&#xA;    minuend =    0b110101&#xA;    subtrahend = 0b000111&#xA;    M = minuend&#xA;    S = subtrahend&#xA;&#xA;difference = ''&#xA;while 1: #State 0&#xA;    if minuend == 0:&#xA;        break&#xA;    minuend, m_right_bit = divmod(minuend, 2)&#xA;    subtrahend, s_right_bit = divmod(subtrahend, 2)        &#xA;    if     m_right_bit == 0 and s_right_bit == 0:&#xA;        difference = '0' + difference&#xA;    elif   m_right_bit == 1 and s_right_bit == 0:&#xA;        difference = '1' + difference&#xA;    elif   m_right_bit == 1 and s_right_bit == 1:&#xA;        difference = '0' + difference&#xA;    else:# m_right_bit == 0 and s_right_bit == 1:&#xA;        #State 1&#xA;        difference = '1' + difference&#xA;        while 1: #State 1&#xA;            if minuend == 0:&#xA;                break&#xA;            minuend, m_right_bit = divmod(minuend, 2)&#xA;            subtrahend, s_right_bit = divmod(subtrahend, 2)        &#xA;            if     m_right_bit == 0 and s_right_bit == 0:&#xA;                difference = '1' + difference&#xA;            elif   m_right_bit == 0 and s_right_bit == 1:&#xA;                difference = '0' + difference&#xA;            elif   m_right_bit == 1 and s_right_bit == 1:&#xA;                difference = '1' + difference&#xA;            else:# m_right_bit == 1 and s_right_bit == 0:&#xA;                difference = '0' + difference&#xA;                break # back to State 0     &#xA;            continue&#xA;    continue&#xA;&#xA;if True: #debugging&#xA;    print('Answer (subtraction):', difference)    &#xA;    if int(difference, 2) != M -S:&#xA;        print('Program failed...')&#xA;&#xA;raise SystemExit&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Code to perform the same subtraction as my Python program; no output should be produced.&lt;/p&gt;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply. The shortest code in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="106883" LastActivityDate="2021-09-07T16:32:42.200" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23852" PostTypeId="2" ParentId="5243" CreationDate="2021-09-07T18:30:09.670" Score="0" Body="&lt;h2&gt;100 rep to the shortest &lt;a href=&quot;https://www.gnu.org/software/sed/&quot; rel=&quot;nofollow noreferrer&quot;&gt;GNU sed 4.2.2 &lt;code&gt;-r&lt;/code&gt;&lt;/a&gt; answer &amp;lt;70b to &lt;a href=&quot;https://codegolf.stackexchange.com/q/63834&quot;&gt;Count up forever&lt;/a&gt; outputting in decimal&lt;/h2&gt;&#xA;&lt;p&gt;The program must output in decimal. You must use the &lt;code&gt;-r&lt;/code&gt; flag, although with no penalty to the bytecount. The GNU sed version is 4.2.2, so you can use empty labels. The program must be less than 70 bytes.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5477&quot;&gt;As is the standard for sed in no-input challenges&lt;/a&gt; like this one, you are only given a newline as input.&lt;/p&gt;&#xA;&lt;p&gt;The program cannot use the &lt;code&gt;e&lt;/code&gt; (shell execute) command, nor the &lt;code&gt;e&lt;/code&gt; flag to &lt;code&gt;s&lt;/code&gt;, nor anything else that I consider cheating that I may have missed here.&lt;/p&gt;&#xA;&lt;p&gt;The way the bounty awarding works is that soon after I see a valid answer I will start the bounty. When the bounty is nearing its end (about a week hence), I will award it to the then shortest valid answer I see, which may not be to the first valid answer. So even if person A was the first to post a valid answer, and I start the bounty a day later, and then if person B posts a shorter valid answer 3 days into the bounty and noone matches it up, I will award the bounty to person B.&lt;/p&gt;&#xA;" OwnerUserId="41805" LastEditorUserId="41805" LastEditDate="2023-01-03T19:40:49.613" LastActivityDate="2023-01-03T19:40:49.613" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23853" PostTypeId="2" ParentId="23839" CreationDate="2021-09-07T19:54:31.110" Score="3" Body="&lt;h2&gt;Balance between network-wide and site-specific changes&lt;/h2&gt;&#xA;&lt;p&gt;It's clear that Stack Exchange is prioritising changes that affect the network rather than a specific site, and that site specific changes are much less likely to be implemented. As one of the more unique sites, we're more than aware of this. However, this network exists because of the sites that make it up. And not every site is the same; some single sites could do with specific features, some groups of sites with a shared feature that doesn't apply to every site. Disregarding a feature request because &amp;quot;it wouldn't apply to every site&amp;quot; is a fool's errand that is unlikely to keep users invested in their site&lt;/p&gt;&#xA;&lt;p&gt;Therefore, I'd like to know how SE intends to balance their intention to prioritise network wide changes against the fact that some sites could benefit from changes that don't apply to the entire network. For the purposes of this question, changes that are specific to Stack Overflow are irrelevant - that site is a special part of the network that can't really be considered in the same way as any other site.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-09-07T19:54:31.110" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23854" PostTypeId="1" AcceptedAnswerId="23856" CreationDate="2021-09-08T16:20:51.493" Score="19" ViewCount="421" Body="&lt;p&gt;Today, Stack Exchange &lt;a href=&quot;https://meta.stackoverflow.com/q/411352/564240&quot;&gt;changed the way answers are sorted on Stack Overflow&lt;/a&gt;, meaning that accepting an answer no longer pins it to the top (regardless of sorting method). It still has the green checkmark next to it, and accepting an answer is still exactly the same for the purposes of reputation, badges, green marker next to a question etc.&lt;/p&gt;&#xA;&lt;p&gt;Stack Exchange are also asking the other sites in the network &lt;a href=&quot;https://meta.stackexchange.com/q/369568/355458&quot;&gt;whether they'd like this behaviour or not&lt;/a&gt;, as this is now a site-configurable setting.&lt;/p&gt;&#xA;&lt;p&gt;We've made &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8363/66833&quot;&gt;noise before&lt;/a&gt; about removing or modifying the accept feature, as it doesn't exactly fit as intended with our site's goals, especially the part about a human accepting an answer that may be the wrong answer (or that may become outdated in the future). This isn't quite removing the accept feature, but it's a similar, milder step.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, should we request that accepted answer be unpinned on this site, or should we keep accepted answers pinned to the top?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="56656" LastEditDate="2021-09-29T11:37:22.333" LastActivityDate="2021-09-29T11:37:22.333" Title="Do we want to unpin the accepted answer from the top?" Tags="|discussion|status-completed|accepted-answer|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23855" PostTypeId="2" ParentId="23854" CreationDate="2021-09-08T16:42:44.837" Score="10" Body="&lt;h4&gt;Accepted answers should not be pinned&lt;/h4&gt;&#xA;&lt;p&gt;As &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/59094810#59094810&quot;&gt;mentioned in chat&lt;/a&gt;, it can be really nice to have the accepted answer pinned can be nice for things like KotHs or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; questions with a definite winner, however I've personally seen accepted answers used much more often in things like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges where there probably shouldn't be an accepted answer, whether it's from a new user or from an older challenge.&lt;/p&gt;&#xA;&lt;p&gt;In a perfect world, the best thing would be for accepted answers to be pinned, and for us to only accept answers on challenges/questions that where it makes sense, such as KotHs, or questions on how to golf a specific piece of code. However, this isn't really feasible, since there are already so many &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges with accepted answers, as well as new users who don't know better.&lt;/p&gt;&#xA;&lt;p&gt;In my opinion, given our circumstances, having accepted answers unpinned would be better for us overall, since the majority of our site and our policies are geared towards challenges where there is no &amp;quot;right answer,&amp;quot; such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions, or challenges where there is no one winner, since each language competes against its own type of language.&lt;/p&gt;&#xA;" OwnerUserId="101522" LastActivityDate="2021-09-08T16:42:44.837" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23856" PostTypeId="2" ParentId="23854" CreationDate="2021-09-08T16:45:31.420" Score="25" Body="&lt;h1&gt;Yes! Emphatically yes.&lt;/h1&gt;&#xA;&lt;p&gt;The accepted answer is rarely the most important answer.  In part because often the accepted answer is out of date and thus not really even the best scoring, but more importantly because being the best scoring overall does not mean it is the cleverest, or most interesting.  For code-golf it just means its the shortest answer from the handful of good golfing languages, which is not on it's own interesting.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2021-09-08T21:05:06.620" LastActivityDate="2021-09-08T21:05:06.620" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="23859" PostTypeId="2" ParentId="2140" CreationDate="2021-09-09T15:23:16.107" Score="0" Body="&lt;h1&gt;Most Contrasting Background Color&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/color&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;color&amp;#39;&quot; rel=&quot;tag&quot;&gt;color&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;When putting colored text on a background, the text can sometimes be hard to read because the text color does not contrast with the background color well. Thus, this challenge will be to create a function or program that can find the most contrasting background color for a given text color.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Create a function or program that takes a text color (in RGB format) and outputs the farthest color from the text color, which would be either &amp;quot;black&amp;quot; or &amp;quot;white&amp;quot; as a string. This will be based on the &lt;a href=&quot;https://en.wikipedia.org/wiki/Relative_luminance&quot; rel=&quot;nofollow noreferrer&quot;&gt;relative luminance&lt;/a&gt; of the text color, which is an approximation of how light or dark a color is based on human perception. The relative luminance can be calculated with this formula:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$Y=0.2126R+0.7152G+0.0722B\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;If the relative luminance is closer to 255 (white), then the program should output &amp;quot;black&amp;quot; and vice versa.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output should be a string: &amp;quot;black&amp;quot; or &amp;quot;white&amp;quot;.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are not allowed.&lt;/li&gt;&#xA;&lt;li&gt;This is code-golf, so the shortest code wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Input&lt;/th&gt;&#xA;&lt;th&gt;Output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;255, 0, 0&lt;/td&gt;&#xA;&lt;td&gt;&amp;quot;white&amp;quot;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;0, 0, 0&lt;/td&gt;&#xA;&lt;td&gt;&amp;quot;white&amp;quot;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;255, 255, 255&lt;/td&gt;&#xA;&lt;td&gt;&amp;quot;black&amp;quot;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;0, 255, 255&lt;/td&gt;&#xA;&lt;td&gt;&amp;quot;black&amp;quot;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;133, 193, 230&lt;/td&gt;&#xA;&lt;td&gt;&amp;quot;black&amp;quot;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;100, 62, 139&lt;/td&gt;&#xA;&lt;td&gt;&amp;quot;white&amp;quot;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;128, 128, 128&lt;/td&gt;&#xA;&lt;td&gt;&amp;quot;black&amp;quot;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a dupe?&lt;/li&gt;&#xA;&lt;li&gt;Is the challenge clear enough?&lt;/li&gt;&#xA;&lt;li&gt;What should be changed?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="91262" LastEditorUserId="91262" LastEditDate="2021-09-09T19:53:52.767" LastActivityDate="2021-09-09T19:53:52.767" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23860" PostTypeId="2" ParentId="23854" CreationDate="2021-09-09T16:40:11.007" Score="4" Body="&lt;h1&gt;Accepted answers should be pinned&lt;/h1&gt;&#xA;&lt;p&gt;We rarely accept answers. Sometimes when an answer is accepted it's because it's on an old question and it was the shortest, but it's quite often used in challenges like KotHs to indicate which answer is winning.&lt;/p&gt;&#xA;&lt;p&gt;The ability to accept an answer to pin it is useful for some types of challenges, and not overly harmful when misused. It's not great for old code golf challenges with accepted answers, but aside from a few those don't get much traffic anyway from users new enough to the site to not know how to vote.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2021-09-09T16:51:56.700" LastActivityDate="2021-09-09T16:51:56.700" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23862" PostTypeId="2" ParentId="2140" CreationDate="2021-09-10T10:18:16.343" Score="1" Body="&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2021-09-11T12:01:31.677" LastActivityDate="2021-09-11T12:01:31.677" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23863" PostTypeId="2" ParentId="2140" CreationDate="2021-09-10T12:03:54.217" Score="-2" Body="&lt;p&gt;Compress La Campanella.&lt;/p&gt;&#xA;&lt;p&gt;Notice that music theory may give you more rules than general compress give, but I don't know music theory that much, so I won't post this&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2021-09-10T12:03:54.217" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23864" PostTypeId="2" ParentId="2140" CreationDate="2021-09-10T20:51:00.390" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/235566/lets-go-for-a-rollercodester-ride&quot;&gt;Let&amp;#39;s go for a rollercodester ride&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100563" LastEditorUserId="100563" LastEditDate="2021-09-21T02:23:17.873" LastActivityDate="2021-09-21T02:23:17.873" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23869" PostTypeId="2" ParentId="2140" CreationDate="2021-09-13T10:21:19.907" Score="0" Body="&lt;h1&gt;Convert chessboards to algebraic notation&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot;&gt;chess&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;em&gt;Note: this is &amp;quot;simple&amp;quot; algebraic notation. It is only based off of my very limited knowledge. En passant, draw offers, disambiguation etc are not included and no bonuses will be given for handling those cases.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Algebraic_notation_(chess)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Algebraic notation&lt;/a&gt; is a compact, universal chess notation which provides an easy method of communication between two chess players. There are many apps that can convert a game of chess into algebraic notation given a list of boards; in this challenge you will write one as well.&lt;/p&gt;&#xA;&lt;p&gt;Before I go over the challenge details, here's a quick crash course of algebraic notation.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Castling&lt;/strong&gt;: there are two types of castling: kingside castling, the &amp;quot;short&amp;quot; way, and queenside castling, the &amp;quot;long&amp;quot; way. The short way is denoted as &lt;code&gt;O-O&lt;/code&gt; (or &lt;code&gt;0-0&lt;/code&gt;) and the long way is &lt;code&gt;O-O-O&lt;/code&gt; (or &lt;code&gt;0-0-0&lt;/code&gt;). When castling is performed, the king and rook both move at the same time, making castling the only occasion when two pieces can move at the same time.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;K..R -&amp;gt; .RK. (kingside)&#xA;R...K -&amp;gt; ..KR. (queenside)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Other moves&lt;/strong&gt;: the rest of the time, only a single piece moves. The move's anatomy in algebraic notation looks like this:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the first character is the piece type, &lt;strong&gt;except&lt;/strong&gt; when a pawn is moving. In the case of the pawn the piece type is not included. Otherwise, a knight is &lt;code&gt;N&lt;/code&gt;, king is &lt;code&gt;K&lt;/code&gt;, rook is &lt;code&gt;R&lt;/code&gt;, queen is &lt;code&gt;Q&lt;/code&gt; and bishop is &lt;code&gt;B&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;next, we add &lt;code&gt;x&lt;/code&gt; if the move is a capture. If not add nothing.&lt;/li&gt;&#xA;&lt;li&gt;Then, as a chessboard &amp;quot;coordinate&amp;quot;, the position that piece is moving to. For example &lt;code&gt;a4&lt;/code&gt;, &lt;code&gt;b5&lt;/code&gt; etc:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;a8 b8 c8 d8 e8 f8 g8 h8&#xA;a7 b7 c7 d7 e7 f7 g7 h7&#xA;a6 b6 c6 d6 e6 f6 g6 h6&#xA;a5 b5 c5 d5 e5 f5 g5 h5&#xA;a4 b4 c4 d4 e4 f4 g4 h4&#xA;a3 b3 c3 d3 e3 f3 g3 h3&#xA;a2 b2 c2 d2 e2 f2 g2 h2&#xA;a1 b1 c1 d1 e1 f1 g1 h1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;So a pawn moving to e4 would be &lt;code&gt;e4&lt;/code&gt;, a bishop moving to h5 capturing a piece there would be &lt;code&gt;Bxh5&lt;/code&gt;, a rook moving to g6 would be &lt;code&gt;Rg6&lt;/code&gt;, etc. Note that pawn capturing at e4 would be &lt;code&gt;xe4&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;An additional character is placed at the end in certain circumstances: if the move makes the moving side &amp;quot;check&amp;quot; the opposing side then a &lt;code&gt;+&lt;/code&gt; is added. For checkmates we add &lt;code&gt;#&lt;/code&gt; instead. Note that this applies to castling as well (&lt;code&gt;O-O+&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;p&gt;I will ignore en passant for this challenge.&lt;/p&gt;&#xA;&lt;h2&gt;Now, for the challenge itself...&lt;/h2&gt;&#xA;&lt;p&gt;You will take in a sequence of boards representing an entire game, and output its corresponding algebraic notation.&lt;/p&gt;&#xA;&lt;p&gt;I don't really care how you take the boards. You could take in a FEN string:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or a 8-line, 8-column board:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;rnbqkbnr&#xA;pppppppp&#xA;........&#xA;........&#xA;........&#xA;........&#xA;PPPPPPPP&#xA;RNBQKBNR&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or a list of pieces:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;['W', 'R', 'a8'], ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or whatever else is reasonable. I will not accept taking in algebraic notation-like strings like &lt;code&gt;Ra8 Kb7&lt;/code&gt;, for instance. You can take in a list of boards, double-newline separated, etc.&lt;/p&gt;&#xA;&lt;p&gt;For each board you must output the algebraic notation of the move from the previous board to the current board by inferring the move from the difference between the boards, along with any necessary pluses and hashes in case the move is a check or checkmate. You must output the correct algebraic notation, but the end &amp;quot;list&amp;quot; can be of any format: a list, space-separated, newline-separated, etc. I don't really care as long as it is reasonable.&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;Two boards have been given.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;rnbqkbnr&#xA;pppppppp&#xA;........&#xA;........&#xA;........&#xA;........&#xA;PPPPPPPP&#xA;RNBQKBNR&#xA;&#xA;rnbqkbnr&#xA;pppppppp&#xA;........&#xA;........&#xA;........&#xA;.......N&#xA;PPPPPPPP&#xA;RNBQKB.R&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Nh3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Another example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;....k...&#xA;........&#xA;........&#xA;K.......&#xA;....b...&#xA;....R...&#xA;........&#xA;.q......&#xA;&#xA;....k...&#xA;........&#xA;........&#xA;K.......&#xA;....R...&#xA;........&#xA;........&#xA;.q......&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Rxe4+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And finally, the Fool's mate with black castling once:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;rnbqkbnr&#xA;pppppppp&#xA;........&#xA;........&#xA;........&#xA;........&#xA;PPPPPPPP&#xA;RNBQKBNR&#xA;&#xA;rnbqkbnr&#xA;pppppppp&#xA;........&#xA;........&#xA;........&#xA;.....P..&#xA;PPPPP.PP&#xA;RNBQKBNR&#xA;&#xA;rnbqkbnr&#xA;pppp.ppp&#xA;....p...&#xA;........&#xA;........&#xA;.....P..&#xA;PPPPP.PP&#xA;RNBQKBNR&#xA;&#xA;rnbqkbnr&#xA;pppp.ppp&#xA;....p...&#xA;........&#xA;......P.&#xA;.....P..&#xA;PPPPP..P&#xA;RNBQKBNR&#xA;&#xA;rnbqkb.r&#xA;pppp.ppp&#xA;....p..n&#xA;........&#xA;......P.&#xA;.....P..&#xA;PPPPP..P&#xA;RNBQKBNR&#xA;&#xA;rnbqkb.r&#xA;pppp.ppp&#xA;....p..n&#xA;........&#xA;......P.&#xA;P....P..&#xA;.PPPP..P&#xA;RNBQKBNR&#xA;&#xA;rnbqk..r&#xA;pppp.ppp&#xA;...bp..n&#xA;........&#xA;......P.&#xA;P....P..&#xA;.PPPP..P&#xA;RNBQKBNR&#xA;&#xA;rnbqk..r&#xA;pppp.ppp&#xA;...bp..n&#xA;........&#xA;......P.&#xA;PP...P..&#xA;..PPP..P&#xA;RNBQKBNR&#xA;&#xA;rnbq.rk.&#xA;pppp.ppp&#xA;...bp..n&#xA;........&#xA;......P.&#xA;PP...P..&#xA;..PPP..P&#xA;RNBQKBNR&#xA;&#xA;rnbq.rk.&#xA;pppp.ppp&#xA;...bp..n&#xA;........&#xA;......P.&#xA;PP...P..&#xA;R.PPP..P&#xA;.NBQKBNR&#xA;&#xA;rnb..rk.&#xA;pppp.ppp&#xA;...bp..n&#xA;........&#xA;......Pq&#xA;PP...P..&#xA;R.PPP..P&#xA;.NBQKBNR&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;f3 e6 g4 Nh6 a3 Bd6 b3 O-O Ra2 Qh4#&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the winner is the answer with the least bytes.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;Meta&lt;/strong&gt;: is this a duplicate? How could I improve the challenge further?&lt;/p&gt;&#xA;" OwnerUserId="106710" LastEditorUserId="106710" LastEditDate="2021-09-13T10:24:34.650" LastActivityDate="2021-09-13T10:24:34.650" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="23870" PostTypeId="2" ParentId="2140" CreationDate="2021-09-13T16:59:30.050" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/235504/101522&quot;&gt;Light-Cycle KotH&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="73066" LastEditorUserId="101522" LastEditDate="2021-11-19T14:56:36.630" LastActivityDate="2021-11-19T14:56:36.630" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="23871" PostTypeId="2" ParentId="2140" CreationDate="2021-09-14T01:42:53.830" Score="0" Body="&lt;h1&gt;Make a number serious&lt;/h1&gt;&#xA;&lt;p&gt;I'm a big fan of silly challenges, but I'm afraid we're going to have to get serious. It's time to get rid of the lols.&lt;/p&gt;&#xA;&lt;p&gt;Or rather, the &lt;code&gt;101&lt;/code&gt;s, which look quite a bit like &lt;code&gt;lol&lt;/code&gt;s.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Task:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Take an integer as input. You'll make this number serious by removing the &lt;code&gt;101&lt;/code&gt;s from the number's binary representation. Now, particularly good jokes sometimes elicit &lt;code&gt;lolol&lt;/code&gt;s or even &lt;code&gt;l(ol)+&lt;/code&gt;s from numbers, so we must get rid of these too.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-09-14T01:42:53.830" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23872" PostTypeId="2" ParentId="2140" CreationDate="2021-09-15T15:44:59.140" Score="1" Body="&lt;p&gt;&lt;strong&gt;This question has been posted on the main site&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2021-09-17T18:59:39.603" LastActivityDate="2021-09-17T18:59:39.603" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23873" PostTypeId="1" CreationDate="2021-09-15T18:01:29.647" Score="7" ViewCount="105" Body="&lt;p&gt;5 years ago I asked this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/83128/lithp-tranthlator&quot;&gt;question&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I made it clear that leaving a double h lefter from a &amp;quot;sh&amp;quot; or &amp;quot;SH&amp;quot; becoming &amp;quot;thh&amp;quot; or &amp;quot;Thh&amp;quot; was acceptable. But now I'm older and wiser, I would like to ask it again but this time not allow for these double &amp;quot;hh&amp;quot;s. My two questions are:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Is this too similar to the original problem, and&lt;/li&gt;&#xA;&lt;li&gt;is the change too simple that it won't make any difference worth golfing?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="55243" LastEditorUserId="66833" LastEditDate="2021-09-16T08:20:00.387" LastActivityDate="2021-09-16T08:20:00.387" Title="Would this potential challenge be a duplicate of an existing one?" Tags="|discussion|support|specific-question|duplicates|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23874" PostTypeId="2" ParentId="23873" CreationDate="2021-09-15T19:10:11.263" Score="6" Body="&lt;h2&gt;Yes, it's too similar&lt;/h2&gt;&#xA;&lt;p&gt;The standard metric we use here for &amp;quot;Is challenge A a duplicate of challenge B?&amp;quot; is &amp;quot;Can answers from B be trivially ported to answer A?&amp;quot;. Most of the answers to the challenge use some form of regex. To adapt them to the new challenge would involve something along the lines of adding &lt;code&gt;h?&lt;/code&gt; to the &lt;code&gt;S&lt;/code&gt;/&lt;code&gt;s&lt;/code&gt; matches. There may be a few answers where requiring handling an extra &lt;code&gt;h&lt;/code&gt; would be significant amount of work, but most answers would be easily ported across.&lt;/p&gt;&#xA;&lt;p&gt;In short, if you posted this new one, I'd close it as a duplicate of your older one.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sub&gt;But thank you for asking first before posting :) It makes everything easier for everyone involved&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-09-15T19:10:11.263" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23875" PostTypeId="2" ParentId="2140" CreationDate="2021-09-15T19:25:43.563" Score="1" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/235561/pythagoras-golfing-grid&quot;&gt;Pythagoras' Golfing Grid&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="81972" LastEditorUserId="81972" LastEditDate="2021-09-20T17:49:35.617" LastActivityDate="2021-09-20T17:49:35.617" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23877" PostTypeId="1" AcceptedAnswerId="23878" CreationDate="2021-09-16T07:53:19.440" Score="3" ViewCount="101" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/230870/generate-the-shortest-regex-to-match-these-but-not-those&quot;&gt;This Question&lt;/a&gt; was asked 2 months ago but was closed &lt;em&gt;3 months&lt;/em&gt; ago, I'm assuming this is a bug.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;@Bubbler said that it may be a rounding issue, as &amp;quot;the exact date and time when each event occurred ... are in correct order.&amp;quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Screenshot:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/R129q.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/R129q.png&quot; alt=&quot;Confusing Image&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="95204" LastEditorUserId="56656" LastEditDate="2021-09-22T21:36:16.827" LastActivityDate="2021-09-22T21:36:16.827" Title="Bugged question (possibly rounding issue)" Tags="|bug|status-deferred|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23878" PostTypeId="2" ParentId="23877" CreationDate="2021-09-16T07:59:48.593" Score="3" Body="&lt;p&gt;Correction: this is actually &lt;a href=&quot;/questions/tagged/status-deferred&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-deferred&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-deferred&lt;/a&gt;, per JNat's answer to &lt;a href=&quot;https://meta.stackexchange.com/q/347355/355458&quot;&gt;this&lt;/a&gt; &lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt; report on MSE. Unfortunately, not much more information about this was given in his answer, but, aside from the first sentence below, this answer is (mostly) still correct.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;/questions/tagged/status-bydesign&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-bydesign&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-bydesign&lt;/a&gt;. The Asked/Active times aren't exact, and have a bit of a weird calculation time. I believe that, because only 2 full months have passed, it counts as 2 months ago. Wait until the 1st of October and it'll say &amp;quot;3 months ago&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;It wouldn't surprise me if you can figure out this behaviour from &lt;a href=&quot;https://stackoverflow.com/q/11/7742131&quot;&gt;this question&lt;/a&gt;, asked by &lt;a href=&quot;https://stackoverflow.com/users/1/jeff-atwood&quot;&gt;Jeff Atwood&lt;/a&gt;, the founder of Stack Overflow. Note that that question was the &lt;em&gt;eleventh&lt;/em&gt; post on Stack Overflow,&lt;/p&gt;&#xA;&lt;p&gt;As mentioned by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt; in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/23877/broken-question#comment75185_23877&quot;&gt;comments&lt;/a&gt;, if you hover your mouse over the &amp;quot;2 months ago&amp;quot;, it'll give the exact timestamp:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/LAXVg.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/LAXVg.png&quot; alt=&quot;screenshot of date/time on hover&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;As for why the close date shows &amp;quot;3 months ago&amp;quot;, but the Asked/Active shows &amp;quot;2 months ago&amp;quot;, who knows? The close votes system has been regularly updated since the founding of SO, but I think the Asked/Answered has been the same since at least &lt;a href=&quot;https://meta.stackexchange.com/q/244461/355458&quot;&gt;2014&lt;/a&gt;, so probably uses some outdated / different method.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-09-22T17:42:34.780" LastActivityDate="2021-09-22T17:42:34.780" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23879" PostTypeId="2" ParentId="2140" CreationDate="2021-09-16T13:25:44.887" Score="0" Body="&lt;p&gt;C character constants.&lt;/p&gt;&#xA;&lt;p&gt;I'm not sure if we had something like this before.&lt;/p&gt;&#xA;&lt;p&gt;Given a value &lt;i&gt;n&lt;/i&gt; between 1 and output the shortest possible c type character constant.&lt;/p&gt;&#xA;&lt;p&gt;Examples:&lt;br&gt;&#xA;1 -&amp;gt; '\1'&lt;br&gt;&#xA;7 -&amp;gt; '\7'&lt;br&gt;&#xA;8 -&amp;gt; '\b'&lt;br&gt;&#xA;9 -&amp;gt; '\t'&lt;br&gt;&#xA;65  -&amp;gt;  'A'&lt;br&gt;&lt;/p&gt;&#xA;&lt;p&gt;The character constants can only contain ASCII characters from 32 - 127.&lt;/p&gt;&#xA;" OwnerUserId="41374" LastEditorUserId="41374" LastEditDate="2021-09-16T22:13:45.887" LastActivityDate="2021-09-16T22:13:45.887" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23880" PostTypeId="1" CreationDate="2021-09-16T13:37:30.697" Score="9" ViewCount="242" Body="&lt;p&gt;It occurred to me when I was browsing threads here that there is an immense collection of simple and extremely space-efficient functions on this site.&lt;/p&gt;&#xA;&lt;p&gt;Although I imagine the end result of such an endeavor would be a complete bastardization of best-practices regarding readability and maintainability, it might be useful to people working with resource limited microsystems.&lt;/p&gt;&#xA;&lt;p&gt;Maybe we're past the point of something like this being of much use given the ever decreasing size and cost of storage and usually poor performance metrics of many golfed solutions.&lt;/p&gt;&#xA;&lt;p&gt;Have there been any large-scale attempts to assemble libraries or more complex programs almost exclusively from aggressively-golfed solutions in a given language?&lt;/p&gt;&#xA;" OwnerUserId="107023" OwnerDisplayName="CuriousCoder" LastActivityDate="2021-09-17T06:36:34.107" Title="Has there been any large-scale attempt to assemble libraries or programs from aggressively-golfed solutions in a given language?" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23881" PostTypeId="2" ParentId="5243" CreationDate="2021-09-16T21:15:43.843" Score="11" Body="&lt;h1&gt;100-200 rep for your first 5 Pip answers&lt;/h1&gt;&#xA;&lt;p&gt;My language Pip has finally reached version 1.0! To celebrate, I will award 100 rep to anyone who:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is not a &amp;quot;︎ New contributor&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;Has posted fewer than 5 answers in Pip prior to 14 September 2021&lt;/li&gt;&#xA;&lt;li&gt;After 14 September 2021, posts valid Pip answers on 5 different &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; challenges which:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; or other challenge types like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;cops-and-robbers-container&quot;&gt;cops-and-robbers&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;answer-chaining-container&quot;&gt;answer-chaining&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Have fewer than 30 answers at the time the Pip answer is posted&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Once the 5 answers are posted, I will choose my favorite of them to bounty. &lt;strong&gt;If the answer also comes with a good explanation&lt;/strong&gt; (in my subjective judgement), &lt;strong&gt;the bounty may be increased up to 200 rep.&lt;/strong&gt; I may increase the amount further if I find the answer especially impressive. If other factors (for example, whether I've previously bountied the question) prevent me from bountying the answer I would like with the amount I would like, I will pick a different answer or work out another arrangement with you.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/dloscutoff/Pip&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub repository&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://dloscutoff.github.io/pipdoc&quot; rel=&quot;nofollow noreferrer&quot;&gt;Documentation site&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/dloscutoff/pip/wiki&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tutorial&lt;/a&gt; (in progress)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/210380/16766&quot;&gt;Tips&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://ato.pxeger.com/run?L=pip&quot; rel=&quot;nofollow noreferrer&quot;&gt;ATO&lt;/a&gt; (supports a recent release of Pip, currently 1.1.0)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://dso.surge.sh/#pip&quot; rel=&quot;nofollow noreferrer&quot;&gt;DSO&lt;/a&gt; (up to date with the latest commit; doesn't play well with stdin or infinite loops)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://replit.com/@dloscutoff/pip&quot; rel=&quot;nofollow noreferrer&quot;&gt;Replit&lt;/a&gt; (up to date with the latest commit; command-line interface, defaulting to REPL mode)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#pip&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt; (only supports version 0.18, aka &lt;a href=&quot;https://dloscutoff.github.io/pipdoc/pip-classic&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pip Classic&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Feel free to ping me in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; if you have questions.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Bounty Claims&lt;/h2&gt;&#xA;&lt;p&gt;Format:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/253309/triangular-polkadot-numbers/253467#253467&quot;&gt;1&lt;/a&gt;, &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/252927/make-a-court-transcriber/253470#253470&quot;&gt;2&lt;/a&gt;&lt;/strong&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/253568/alphabet-checksum/253605#253605&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/252491/generate-parity-bits/253611#253611&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/249868/every-possible-pairing/253614#253614&quot;&gt;5&lt;/a&gt; (awarded)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/106844/baby-boy&quot;&gt;Baby_Boy&lt;/a&gt;: &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/253732/remove-the-last-n-occurences-of-a-substring-from-a-string/253756#253756&quot;&gt;1&lt;/a&gt;&lt;/strong&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/75384/equality-in-the-sum-of-digits/253790#253790&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/135802/take-the-square-root-of-a-string/253816#253816&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/103355/this-cat-has-bugs-really/254013#254013&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/70277/implement-an-encoder-for-rfc-1924-ipv6-addresses/254196#254196&quot;&gt;5&lt;/a&gt; (awarded)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/96037/mathcat&quot;&gt;mathcat&lt;/a&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/255650/sum-every-second-digit-in-a-number/255684#255684&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/255765/replace-all-vowels-with-repeated-aeiou/255773#255773&quot;&gt;2&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/255804/create-n-sublists-with-the-powers-of-two-1-2-4-8-16/255819#255819&quot;&gt;3&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/255822/replace-0s-in-a-string-with-their-consecutive-counts/255826#255826&quot;&gt;4&lt;/a&gt;, &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255902/keep-elements-in-sequence-that-have-a-letter-repeated-at-least-3-times/255919#255919&quot;&gt;5&lt;/a&gt;&lt;/strong&gt; (awarded)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/114446/the-thonnu&quot;&gt;The Thonnu&lt;/a&gt;: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/141949/count-edits-accounting-for-grace-period/257776#257776&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/257650/determine-the-octet-duplet-18-electron-rule/257774#257774&quot;&gt;2&lt;/a&gt;, &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257752/print-all-pandigital-numbers/257756#257756&quot;&gt;3&lt;/a&gt;&lt;/strong&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/257649/arbitrary-apple-dilemma/257772#257772&quot;&gt;4&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/256050/friend-or-foe/256070#256070&quot;&gt;5&lt;/a&gt; (awarded)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;- [Username](code golf user profile): [1](link), [2](link), [3](link), [4](link), [5](link)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="16766" LastEditDate="2023-02-17T23:21:06.647" LastActivityDate="2023-02-17T23:21:06.647" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="23882" PostTypeId="2" ParentId="2140" CreationDate="2021-09-17T02:06:24.150" Score="0" Body="&lt;h1&gt;Fast Inverse Square Root &lt;em&gt;//evil floating point bit level hacking&lt;/em&gt;&lt;/h1&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;The fast inverse square root algorithm is a function developed in C for Quake III.  It was at the time the fastest way to compute the inverse square root of a function, which is needed for most vector operations.&lt;/p&gt;&#xA;&lt;p&gt;The code as written in 1999, from the quake 3 source, is as follows:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-c prettyprint-override&quot;&gt;&lt;code&gt;float Q_rsqrt( float number )&#xA;{&#xA;    long i;&#xA;    float x2, y;&#xA;    const float threehalfs = 1.5F;&#xA;&#xA;    x2 = number * 0.5F;&#xA;    y  = number;&#xA;    i  = * ( long * ) &amp;amp;y;                       // evil floating point bit level hacking&#xA;    i  = 0x5f3759df - ( i &amp;gt;&amp;gt; 1 );               // what the fuck? &#xA;    y  = * ( float * ) &amp;amp;i;&#xA;    y  = y * ( threehalfs - ( x2 * y * y ) );   // 1st iteration&#xA;//  y  = y * ( threehalfs - ( x2 * y * y ) );   // 2nd iteration, this can be removed&#xA;&#xA;    return y;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Given a floating-point number in any form you wish, calculate its inverse square root and return it as a float to at least 4 decimal places.&lt;/p&gt;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;3&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;0.5773502691&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Judging&lt;/h1&gt;&#xA;&lt;p&gt;This is a challenge for creativity as well as code size.&lt;/p&gt;&#xA;&lt;p&gt;For example, I would rate a 1:1 copy in c# about a 3/5, but a brainfuck copy 5/5 for the challenge and creativity.&lt;/p&gt;&#xA;" OwnerUserId="104550" LastActivityDate="2021-09-17T02:06:24.150" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23883" PostTypeId="2" ParentId="23880" CreationDate="2021-09-17T06:36:34.107" Score="3" Body="&lt;p&gt;To my knowledge, reducing code size has two main uses in real world: microsystems (as you mentioned) and JS in the browser.&lt;/p&gt;&#xA;&lt;p&gt;For microsystems, the objective is to create small machine code (say x86, ARM, z80, ...). While I don't know of any kind of &amp;quot;library&amp;quot; (in the sense that you can link your code to it like a C library) and I guess it is not quite possible in general, &lt;a href=&quot;http://www.sizecoding.org/wiki/Main_Page&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sizecoding wiki&lt;/a&gt; has a good amount of tips and resources for various architectures, including some large collections of well-golfed programs.&lt;/p&gt;&#xA;&lt;p&gt;On the other hand, JS code is usually minimized to reduce network load and improve browser-side loading time. Again, there are no specific libraries of golfed JS code, but for a different reason: production JS code usually goes through an automated minifier. (That's why you see all those &lt;code&gt;whatever.min.js&lt;/code&gt; files on the Internet.)&lt;/p&gt;&#xA;&lt;p&gt;For (at least partially) hand-minimized real JS programs and resources, you might want to check out size-constrained events such as &lt;a href=&quot;https://js1k.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;JS1k&lt;/a&gt; (2010-2019) and &lt;a href=&quot;https://js13kgames.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;JS13Kgames&lt;/a&gt; (2012-2021, ongoing), and especially &lt;a href=&quot;https://js13kgames.github.io/resources/&quot; rel=&quot;nofollow noreferrer&quot;&gt;resources for JS13Kgames&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2021-09-17T06:36:34.107" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23884" PostTypeId="2" ParentId="2140" CreationDate="2021-09-17T12:53:15.820" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/235493/apply-gravity-to-this-matrix&quot;&gt;Apply gravity to this matrix&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="106557" LastEditorUserId="106557" LastEditDate="2021-09-20T16:04:31.180" LastActivityDate="2021-09-20T16:04:31.180" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23885" PostTypeId="2" ParentId="2140" CreationDate="2021-09-17T17:37:00.300" Score="-1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Silly Sentence Generator&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge is to input a sentence and find all words enclosed within angle brackets. (&lt;code&gt;&amp;lt;&lt;/code&gt; and &lt;code&gt;&amp;gt;&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;p&gt;Here is an example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;The &amp;lt;adjective&amp;gt; &amp;lt;noun&amp;gt; biked across the bridge.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Next, replace all &lt;code&gt;&amp;lt;noun&amp;gt;&lt;/code&gt;s with a random noun, all &lt;code&gt;&amp;lt;verb&amp;gt;&lt;/code&gt;s with a random verb, all &lt;code&gt;&amp;lt;adjectives&amp;gt;&lt;/code&gt;s with a random adjective, and all &lt;code&gt;&amp;lt;adverb&amp;gt;&lt;/code&gt;s with a random adverb.&lt;/p&gt;&#xA;&lt;p&gt;According to the above rule, &lt;code&gt;The &amp;lt;adjective&amp;gt; &amp;lt;noun&amp;gt; biked across the bridge.&lt;/code&gt; &lt;em&gt;could&lt;/em&gt; become &lt;code&gt;The daring monkey biked across the bridge&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your program will input a list of nouns, verbs, adjectives, and adverbs.&lt;/p&gt;&#xA;&lt;p&gt;Make sure the words follow capitalization. So if the random noun in &lt;code&gt;&amp;lt;noun&amp;gt; &amp;lt;verb&amp;gt;ed&lt;/code&gt; is &lt;code&gt;monkey&lt;/code&gt;, it should then become &lt;code&gt;Monkey&lt;/code&gt;. Another rule is that if a verb (like &lt;code&gt;slide&lt;/code&gt;) ends with &lt;em&gt;e&lt;/em&gt;, and the bit after the &lt;code&gt;&amp;lt;verb&amp;gt;&lt;/code&gt; is &lt;code&gt;ing&lt;/code&gt; or &lt;code&gt;s&lt;/code&gt;, (e. g &lt;code&gt;&amp;lt;verb&amp;gt;ing&lt;/code&gt;) do not keep the final &lt;em&gt;&lt;code&gt;e&lt;/code&gt;&lt;/em&gt;. (e. g slideing becomes sliding).&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;Note that these examples assume the nouns are &lt;code&gt;monkey&lt;/code&gt; and &lt;code&gt;ai&lt;/code&gt;, the verbs &lt;code&gt;jumped&lt;/code&gt; and &lt;code&gt;sliding&lt;/code&gt;, the adjective &lt;code&gt;daring&lt;/code&gt;, and any list of adverbs (since the examples don't use them.)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;The &amp;lt;noun&amp;gt; was &amp;lt;verb&amp;gt;ed by the &amp;lt;adjective&amp;gt; &amp;lt;noun&amp;gt;. =&amp;gt; The monkey was jumped by the daring ai.&#xA;&#xA;&amp;lt;verb&amp;gt;ing &amp;lt;noun&amp;gt;s play together. =&amp;gt; Sliding monkeys play together.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Shortest code wins!&lt;/p&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2021-12-01T18:39:03.317" LastActivityDate="2021-12-01T18:39:03.317" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="23886" PostTypeId="2" ParentId="2140" CreationDate="2021-09-17T21:05:43.320" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/235806/minimizing-flights-of-stairs-climbed&quot;&gt;Minimizing flights of stairs climbed&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91262" LastEditorUserId="91262" LastEditDate="2021-09-28T22:11:12.037" LastActivityDate="2021-09-28T22:11:12.037" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23887" PostTypeId="2" ParentId="2140" CreationDate="2021-09-18T02:34:30.290" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/235661/count-occurences-in-pascals-triangle&quot;&gt;Count occurences in Pascal's Triangle&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2021-09-25T01:10:35.153" LastActivityDate="2021-09-25T01:10:35.153" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23891" PostTypeId="2" ParentId="2140" CreationDate="2021-09-19T12:19:51.150" Score="1" Body="&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2021-09-19T15:15:31.547" LastActivityDate="2021-09-19T15:15:31.547" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23892" PostTypeId="2" ParentId="2140" CreationDate="2021-09-20T16:22:27.623" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/235678/encrypt-this-message&quot;&gt;Encrypt this Message&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="106557" LastEditorUserId="106557" LastEditDate="2021-09-25T11:25:00.063" LastActivityDate="2021-09-25T11:25:00.063" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23894" PostTypeId="2" ParentId="2140" CreationDate="2021-09-20T20:35:05.497" Score="0" Body="&lt;h1&gt;A *character*-less quine&lt;/h1&gt;&#xA;&lt;p&gt;Similar to “&lt;a href=&quot;https://codegolf.stackexchange.com/q/171789/95204&quot;&gt;What did we forget?&lt;/a&gt;”&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Your program must be a quine - that is, print its own source code with no input or unused input.&lt;/p&gt;&#xA;&lt;p&gt;Although this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;, you are allowed to read your own source code. Assume the file is named “q” and that no extension is needed. There is no bonus for not reading the source code.&lt;/p&gt;&#xA;&lt;p&gt;If you remove all occurrences of a character that is in your program, it should print the character removed. It is allowed to then raise an error; however, there is no bonus for this either.&lt;/p&gt;&#xA;&lt;p&gt;To the sandbox: &lt;strong&gt;do I need this?&lt;/strong&gt; =&amp;gt; Your program must have at least 3 different characters.&lt;/p&gt;&#xA;&lt;p&gt;Lowest number of bytes wins (this &lt;em&gt;is&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, after all)&lt;/p&gt;&#xA;&lt;h2&gt;Sanbdox things&lt;/h2&gt;&#xA;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Anything I should change?&lt;/li&gt;&#xA;&lt;li&gt;This used to be “Numberless” (see &lt;a href=&quot;https://codegolf.meta.stackexchange.com/posts/23894/revisions&quot;&gt;edit history&lt;/a&gt;) - should I change it back?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/radiation-hardening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; rel=&quot;tag&quot;&gt;radiation-hardening&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="95204" LastEditorUserId="95204" LastEditDate="2021-09-22T08:27:32.577" LastActivityDate="2021-09-22T08:27:32.577" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="23897" PostTypeId="2" ParentId="2140" CreationDate="2021-09-21T16:25:43.700" Score="10" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/235767/validate-sudoku-on-a-mobius-strip&quot;&gt;Validate Sudoku on a Mobius Strip&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="81972" LastEditorUserId="81972" LastEditDate="2021-09-27T17:03:32.277" LastActivityDate="2021-09-27T17:03:32.277" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="23898" PostTypeId="2" ParentId="2140" CreationDate="2021-09-22T15:43:41.263" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/235688/66833&quot;&gt;Drop down the numbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="66833" LastEditDate="2021-09-26T14:03:21.867" LastActivityDate="2021-09-26T14:03:21.867" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="23899" PostTypeId="2" ParentId="2140" CreationDate="2021-09-23T03:38:06.797" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/235613/66833&quot;&gt;Multiplication for geometric algebra&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="107115" LastEditorUserId="66833" LastEditDate="2021-09-30T01:02:53.777" LastActivityDate="2021-09-30T01:02:53.777" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23900" PostTypeId="1" CreationDate="2021-09-23T17:03:58.053" Score="14" ViewCount="282" Body="&lt;p&gt;King of the Hill, or KotH, is probably the most unique tag on CGCC. If you've never come across it before, today's your lucky day!&lt;/p&gt;&#xA;&lt;p&gt;In a KotH, submissions will consist of &amp;quot;bots&amp;quot; which compete in some game. Because a KotH involves simulating a (sometimes quite complicated) game, they tend to form much more of a community than other types of challenges.&lt;/p&gt;&#xA;&lt;h2&gt;How a KotH works&lt;/h2&gt;&#xA;&lt;p&gt;Before posting, the author of a KotH will write a program called a controller. This will simulate all aspects of the game, in addition to providing scoring, I/O with bots, and sometimes additional features to make testing bots easier (like graphical output or debugging).&lt;/p&gt;&#xA;&lt;p&gt;Bots will be submitted as answers, typically with their own names. It's recommended that KotHs are restricted to a single language, but typically this will be something somewhat common like Python or JS. If you don't know the language a KotH is using but still want to compete, ask in chat! Someone will probably be glad to &amp;quot;translate&amp;quot; for you.&lt;/p&gt;&#xA;&lt;p&gt;To run the KotH, all submissions will be copied into the controller. Sometimes this is done with an automated script. Then, bots are grouped up and the game begins! Whatever scoring the KotH uses will be used to determine a winner.&lt;/p&gt;&#xA;&lt;h2&gt;History&lt;/h2&gt;&#xA;&lt;p&gt;I wanted to write a nice long section about the advancements in KotHing since it first came about, but it seems great ideas were present almost from the very beginning.&lt;/p&gt;&#xA;&lt;p&gt;The first King of the Hill challenges date back to the early days of the site, long before I was around. The first few, in 2011, consisted of simple games like prisoner's dilemma, auctions, and card games. In 2014, more complex ideas began to emerge, involving more complicated interaction and combat between bots, often in simulated 2d worlds.&lt;/p&gt;&#xA;&lt;p&gt;The rate in which KotHs have been posted has decreased over time, with one major factor in this likely being older users leaving the site. But with some recent KotHs reaching large audiences, this trend could soon be turning around.&lt;/p&gt;&#xA;&lt;h2&gt;Playing in a KotH&lt;/h2&gt;&#xA;&lt;p&gt;Writing a bot is easier than it seems! KotHs often look daunting: their specs are longer than other challenges, they've got controllers you need to run your code on, and they take a lot more work than a solution to most code golf problems.&lt;/p&gt;&#xA;&lt;p&gt;Don't let that discourage you. KotHs are a ton of fun when things go right, and as bots grow smarter, winning becomes more and more of an achievement. The first few bots are almost never competitive later on, so don't be scared to post something silly. I've seen great KotHs die away because nobody was brave enough to take the first step. Don't do that! You'll usually get some free upvotes for your trouble, too :D.&lt;/p&gt;&#xA;&lt;p&gt;Unfortunately, KotHs aren't particularly common. One per month is typical, and only some of those are successful. Unlike normal &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenges, which can be answered at any date in the future after being posted, KotHs aren't much fun after they start to lose steam. So, you might want to try...&lt;/p&gt;&#xA;&lt;h2&gt;Making a KotH&lt;/h2&gt;&#xA;&lt;p&gt;KotHs aren't easy to design, but they're extremely rewarding to get right. I'll probably post a second blog post in a few weeks going into the topic in more detail, but here are my main tips for KotH design:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Don't be afraid to fail:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Most KotH ideas don't work well in real life. As fun as something is for humans (or in your head), you can get a controller working, play around with it, and realize: this isn't fun. It's happened to me too many times to count.&lt;/p&gt;&#xA;&lt;p&gt;KotHs are a difficult balancing act between simplicity and depth. Too complex, and nobody will take the time to write a bot. Too shallow and the optimal strategy will be found almost instantly. It's discouraging to put a lot of time into an idea and have it not work out, but you're not a bad KotH writer. (In fact, you're probably a really good one! Keep trying!)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Get feedback:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;There's a lot of things to remember when writing a KotH. You need to write a good spec, specify how all the different parts of the game will work, write a controller, make some example bots, and probably more. It's always a good idea to double check you have it all done correctly. In addition, designing a KotH is like making a game. It's a lot easier when you can bounce your ideas against someone else, to make sure they'd be fun.&lt;/p&gt;&#xA;&lt;p&gt;If you have an idea, feel free to bring it up in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;chat&lt;/a&gt;. If you feel your concept's pretty well fleshed out and you're pretty sure it's not a duplicate, I'd recommend putting it in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?answertab=active&quot;&gt;sandbox&lt;/a&gt; for a few weeks. Most KotHs have long specs, and it's much harder than you think to make sure all of the details are clear to someone reading the rules with no background knowledge.&lt;/p&gt;&#xA;&lt;h2&gt;Conclusion&lt;/h2&gt;&#xA;&lt;p&gt;King of the Hill challenges are unlike anything else on CGCC. They might take a little more work to write a submission for, but don't be discouraged! You'll probably have a lot of fun. Similarly, writing a KotH is tough. However, when you finally think of the perfect idea and flesh it out into a great challenge, you'll have the opportunity to form a community around your game, and watch strategies evolve as competitors work to outsmart the other bots.&lt;/p&gt;&#xA;&lt;p&gt;Happy KotHing!&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="68942" LastEditDate="2021-09-23T17:04:48.173" LastActivityDate="2021-09-23T17:04:48.173" Title="CGCC Blog Post #3: King of the Hill!" Tags="|discussion|king-of-the-hill|cgcc-blog|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23901" PostTypeId="2" ParentId="23900" CreationDate="2021-09-23T17:03:58.053" Score="5" Body="&lt;h1&gt;Underappreciated posts&lt;/h1&gt;&#xA;&lt;p&gt;As part of blog posts, we'll demonstrate some of the more unappreciated posts on the site, and we highly recommend you check them out and give them an upvote. These were nominated by various users, and if you think you've found an answer that deserves more appreciation, feel free to drop a link to it in the &lt;a href=&quot;https://chat.stackexchange.com/rooms/123200/cgcc-blog-chat&quot;&gt;CGCC Blog chat room&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/92901/dingus&quot;&gt;Dingus&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/questions/53436/printing-the-cracker-barrel-game/233894#233894&quot;&gt;Ruby answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/53436/printing-the-cracker-barrel-game&quot;&gt;Printing the Cracker Barrel Game&lt;/a&gt;. This question was unanswered for over 6 years, until it was solved in under 200 bytes.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/101522/aaron-miller&quot;&gt;Aaron Miller&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/questions/3434/shortest-game-of-life/233326#233326&quot;&gt;Vim answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/3434/shortest-game-of-life&quot;&gt;Shortest Game of Life&lt;/a&gt;. Game of Life in a text editor in under half a kilobyte, golfed down by over 120 bytes.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/87606/tjjfvi&quot;&gt;tjjfvi&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/questions/3434/shortest-game-of-life/233339#233339&quot;&gt;&amp;gt;&amp;lt;&amp;gt; answer&lt;/a&gt; to  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/3434/shortest-game-of-life&quot;&gt;Shortest Game of Life&lt;/a&gt;. Another short Game of Life, this time just over 280 bytes (in a 2d language!).&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-09-23T17:03:58.053" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23902" PostTypeId="2" ParentId="2140" CreationDate="2021-09-23T19:14:11.960" Score="-1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Tac-Tok-Toe&lt;/h1&gt;&#xA;&lt;p&gt;Tac-Tok-Toe is just like tic-tac-toe, but instead of three in a row, the winning condition is &lt;em&gt;three in a row but each letter is exactly one space apart horizontally, vertically, or diagonally.&lt;/em&gt; The win can also go in &lt;em&gt;any direction&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;The games&lt;/h1&gt;&#xA;&lt;p&gt;Each team (X and O) will make their own tac-tok-toe AI's. 10000 games will be played.&lt;/p&gt;&#xA;&lt;h1&gt;The moves&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;AI.PUT_TILE(board: List[List[str]], place: List[int])&#xA;&lt;br /&gt;    Places a tile at the specified location&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;AI.DECIDE_MOVE(board: List[List[str]])&#xA;&lt;br /&gt;    Decides and returns the index the AI wants to move depending on the current board situation.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;AI.GET_WINNER(board: List[List[str]])&#xA;&lt;br /&gt;    Returns the winner of the board.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;The board&lt;/h1&gt;&#xA;&lt;p&gt;The starting board looks like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; | | &#xA; | | &#xA; | | &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Yes, I know, that indeed is a horrible tac-tok-toe board.)&#xA;For example, place [0, 0] is in the upper left square, and place [1, 1] is in the middle. If the X AI places an X at [2, 2], the board would now look like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; | | &#xA; | | &#xA; | |X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;An example of a completed grid could look like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;X|X|O&#xA;O|X|X&#xA;O|O|X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We see that X has won, so the game should print: &amp;quot;X wins!&amp;quot;&lt;/p&gt;&#xA;&lt;h1&gt;Game files&lt;/h1&gt;&#xA;&lt;p&gt;[Your side]AI.py:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;class [Your side]AI:  # Maybe change to something more meaningful?&#xA;    def PUT_TILE(board, place):&#xA;        pass&#xA;    def DECIDE_MOVE(board):&#xA;        pass&#xA;    def GET_WINNER(board):&#xA;        pass&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;startboard.txt:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; | | &#xA; | | &#xA; | | &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Meta&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Any suggestions?&lt;/p&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2021-09-23T19:27:16.237" LastActivityDate="2021-09-23T19:27:16.237" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23903" PostTypeId="2" ParentId="2140" CreationDate="2021-09-24T05:34:57.023" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/235843/khinchins-constant-bad-estimate&quot;&gt;Khinchin's constant bad estimate&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="99115" LastEditorUserId="99115" LastEditDate="2021-10-04T20:17:06.597" LastActivityDate="2021-10-04T20:17:06.597" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23904" PostTypeId="2" ParentId="20722" CreationDate="2021-09-25T17:54:57.230" Score="6" Body="&lt;p&gt;I watch Alan Becker and eat bagels.&lt;/p&gt;&#xA;&lt;p&gt;2022 update:&#xA;Grand Bagel in katlani.&lt;/p&gt;&#xA;&lt;p&gt;2023 update:&#xA;Alan Bagel in english.&lt;/p&gt;&#xA;&lt;p&gt;2024 update:&#xA;Bread + ai generated image&lt;/p&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2024-01-25T15:03:57.350" LastActivityDate="2024-01-25T15:03:57.350" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23905" PostTypeId="2" ParentId="2140" CreationDate="2021-09-26T09:24:29.580" Score="0" Body="&lt;h1&gt;Draw me a circle&lt;/h1&gt;&#xA;&lt;p&gt;Given a radius &lt;span class=&quot;math-container&quot;&gt;\$r\in\mathbb{N}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$r\geq 3\$&lt;/span&gt;, draw an ASCII circle for me, using &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;'s. Your circle does &lt;em&gt;not&lt;/em&gt; have to look perfect, it just has to be identifiable as one. To make the circle look good, you have to use a &lt;span class=&quot;math-container&quot;&gt;\$2:1\$&lt;/span&gt; ratio for width and height of the circles. This is due to characters being taller than wide.&lt;/p&gt;&#xA;&lt;p&gt;One thing that is required though is an &lt;strong&gt;appropriate&lt;/strong&gt; angle increment. I reccomend &lt;span class=&quot;math-container&quot;&gt;\$r\times3\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You do not have to account for float rounding errors!&lt;/p&gt;&#xA;&lt;p&gt;Given the radius &lt;span class=&quot;math-container&quot;&gt;\$5\$&lt;/span&gt;, your output should look &lt;em&gt;similar&lt;/em&gt; to this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;     x x x x x x     &#xA;    x           x    &#xA; xx               xx &#xA; x                 x &#xA;x                   x&#xA; x                 x &#xA; xx               xx &#xA;    x           x    &#xA;     x x x x x x &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;IO&lt;/h2&gt;&#xA;&lt;p&gt;Input and output can be in any reasonable form.&lt;/p&gt;&#xA;&lt;h2&gt;More test-cases&lt;/h2&gt;&#xA;&lt;p&gt;Note that these don't have to be an exact match!&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;3 -&amp;gt;   &#xA;        x x xx    &#xA;      xx       xx &#xA;     x           x&#xA;      xx       xx &#xA;         xx x x  &#xA;&#xA;7 -&amp;gt; &#xA;        xx x x x x xx        &#xA;      x               x      &#xA;    x                   x    &#xA;  xx                     xx  &#xA; x                         x &#xA; x                         x &#xA;x                           x&#xA; x                         x &#xA; x                         x &#xA;  xx                     xx  &#xA;    x                   x    &#xA;      x               x      &#xA;        xx x x x x xx  &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="106557" LastActivityDate="2021-09-26T09:24:29.580" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23906" PostTypeId="2" ParentId="202" CreationDate="2021-09-26T16:42:29.313" Score="18" Body="&lt;h1&gt;&lt;a href=&quot;https://ato.pxeger.com/about&quot; rel=&quot;nofollow noreferrer&quot;&gt;Attempt This Online&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;sup&gt;&lt;em&gt;Note: I (pxeger) am the author and maintainer of ATO&lt;/em&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;ATO was originally conceived as a replacement for the increasingly out-of-date Try It Online.&lt;/p&gt;&#xA;&lt;p&gt;You can find it at &lt;strong&gt;&lt;a href=&quot;https://ato.pxeger.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;ato.pxeger.com&lt;/code&gt;&lt;/a&gt;&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's completely free of charge&lt;/li&gt;&#xA;&lt;li&gt;The &lt;a href=&quot;https://github.com/attempt-this-online/attempt-this-online&quot; rel=&quot;nofollow noreferrer&quot;&gt;software&lt;/a&gt; is open-source (available under the copyleft &lt;a href=&quot;https://github.com/attempt-this-online/attempt-this-online/blob/main/LICENCE.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;GNU Affero General Public License 3.0&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;We don't advertise or use any tracking technologies&lt;a href=&quot;https://ato.pxeger.com/legal#privacy-policy&quot; rel=&quot;nofollow noreferrer&quot;&gt;*&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Regularly maintained: new languages and features are added by request all the time&lt;/li&gt;&#xA;&lt;li&gt;The interface is &lt;a href=&quot;https://ato.pxeger.com/preferences&quot; rel=&quot;nofollow noreferrer&quot;&gt;customisable&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;There is an in-development version at &lt;a href=&quot;https://staging.ato.pxeger.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;staging.ato.pxeger.com&lt;/code&gt;&lt;/a&gt; which generally follows the &lt;a href=&quot;https://github.com/attempt-this-online/attempt-this-online&quot; rel=&quot;nofollow noreferrer&quot;&gt;tip of the &lt;code&gt;main&lt;/code&gt; branch&lt;/a&gt;. If a language is newly added, it will be there for a while before appearing on the main version.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-02-06T10:30:23.043" LastActivityDate="2022-02-06T10:30:23.043" CommentCount="1" CommunityOwnedDate="2021-09-26T16:42:29.313" ContentLicense="CC BY-SA 4.0" />
  <row Id="23907" PostTypeId="2" ParentId="2140" CreationDate="2021-09-26T20:05:24.177" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Write an interpreter for &amp;quot;MathScript&amp;quot;&lt;/h1&gt;&#xA;&lt;p&gt;I had an idea for a new language, it's called MathScript! I got the idea from Mathematica.&lt;/p&gt;&#xA;&lt;p&gt;Basically, this is how it works:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Functions are called by using the following syntax:  &lt;code&gt;FunctionName{some, arguments, separated, by, commas}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The builtin functions are &lt;code&gt;Display&lt;/code&gt;, &lt;code&gt;Add&lt;/code&gt;, &lt;code&gt;Sub&lt;/code&gt;, &lt;code&gt;Mul&lt;/code&gt;, &lt;code&gt;IntDiv&lt;/code&gt;, &lt;code&gt;FloorDiv&lt;/code&gt;, &lt;code&gt;Pow&lt;/code&gt;, &lt;code&gt;Factorial&lt;/code&gt;, &lt;code&gt;FibN&lt;/code&gt;, and &lt;code&gt;OddEvenQ&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The first few function names are pretty descriptive. &lt;code&gt;IntDiv&lt;/code&gt; and &lt;code&gt;FloorDiv&lt;/code&gt; calculate the integer division and floor division, respectively. &lt;code&gt;FibN&lt;/code&gt; calculates the N'th Fibonacci number, and &lt;code&gt;OddEvenQ&lt;/code&gt; returns 1 if a number is even and 0 if it is odd.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Variables are created as so: &lt;code&gt;&amp;lt;Name&amp;gt; :: &amp;lt;Value&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The syntax for changing variables is the same as the syntax to change variables.&lt;/li&gt;&#xA;&lt;li&gt;The syntax for for loops are as following: &lt;code&gt;LoopN{&amp;lt;n&amp;gt;} :: [some, statements, separated, by, commas]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;---&#xA;Display{Factorial{Add{2, 3}}} =&amp;gt; 120&#xA;---&#xA;&#xA;---&#xA;a :: 1&#xA;LoopN{3} :: [a :: Add{a, 1}, Display{a}] =&amp;gt; 2 &amp;lt;newline&amp;gt; 3 &amp;lt;newline&amp;gt; 4 &amp;lt;newline&amp;gt;&#xA;---&#xA;&#xA;---&#xA;num :: Add{Sub{1, 2}, Mul{Pow{2, 3}, Add{1, 2}}}&#xA;odd_or_even0 :: OddEvenQ{num}&#xA;num :: Factorial{num}&#xA;odd_or_even1 :: OddEvenQ{num}&#xA;Display{odd_or_even0} =&amp;gt; 0&#xA;Display{odd_or_even1} =&amp;gt; 1&#xA;---&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, so the fastest answer wins. The testing will be on an i7 processer Windows 10 machine. The test case will be &lt;code&gt;LoopN{10} :: [LoopN{10} :: [Display{Add(2, Pow{3, 4})}]]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Some clarification&lt;/h1&gt;&#xA;&lt;p&gt;Whitespace is ignored. Trailing commas in function arguments is allowed. You can assume that the input will always be correct. &lt;code&gt;Display&lt;/code&gt; outputs something to stdout. Case is significant. (e. g Loopn != LoopN) If there are multiple statements, they can be separated by newlines or nothing at all. Blank lines can be anywhere.&lt;/p&gt;&#xA;&lt;h1&gt;Language types&lt;/h1&gt;&#xA;&lt;p&gt;The types are the string (specified between double quotes or single quotes), the integer, and the float. Integers can be specified using normal numbers like 5 and 7383. The integer limit is [-2&lt;strong&gt;32, 2&lt;/strong&gt;32] (32-bit). Floats can be specified using normal math notation, so these are all valid floats:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2.0&#xA;3.4&#xA;3.141592653&#xA;.8&#xA;2.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The &lt;code&gt;LoopN&lt;/code&gt; function's first argument can be a integer literal, or a predefined variable.&lt;/p&gt;&#xA;&lt;h1&gt;One Final Note&lt;/h1&gt;&#xA;&lt;p&gt;Compilers &lt;em&gt;are&lt;/em&gt; allowed.&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any suggestions?&lt;/li&gt;&#xA;&lt;li&gt;Anything to clarify?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2021-10-06T21:37:08.490" LastActivityDate="2021-10-06T21:37:08.490" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="23908" PostTypeId="2" ParentId="2140" CreationDate="2021-09-27T05:32:36.367" Score="0" Body="&lt;h1&gt;Irreducibile Polynomials&lt;/h1&gt;&#xA;&lt;h2&gt;in progress&lt;/h2&gt;&#xA;&lt;h2&gt;todo, add several test cases. and figure out how to deal with verifying answers.&#xA;figure out how references work, not just using plain  hyperlinks.&lt;/h2&gt;&#xA;&lt;p&gt;As you may know, Polynomials are mathematical expressions of the sum of a  variable raised to various powers and multiplied by various coefficients. For example consider the variable &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\begin{array}{11}&#xA;3x^2 &amp;amp; \mbox{ exponent is 2, leading coefficient is 3 } \\&#xA;3x^2 + 16x &amp;amp; \mbox { add a term with exponent = 1, coefficient = 16 } \\&#xA;3x^2 + 16x + 7 &amp;amp; \mbox { add another term, with exponent = 0, constant coefficient = 7 } \\&#xA;\end{array}&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;In general we can write a polynomial named &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; as a function of &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; as follows:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$ P(x) = a_mx^m + a_{m-1} x^{m-1} ... + a_1 x^1 + a_0 x ^ 0 $$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Polynomials are somewhat similar to integers in that they can be factored into smaller polynomials that when multiplied together give the original polynomial. This process can be repeated until the integer or polynomial cannot be factored anymore. For integers this smallest factor is called a Prime, but for Polynomials it is called Irreducible. For integer polynomials over the integers, which is what this challenge is limited to, we have the following examples:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{array}{11}&#xA;\mbox{polynomial} &amp;amp; \mbox{irreducible factors} \\&#xA;x^2-1 &amp;amp; (x-1),(x+1) \\&#xA;x^5-x^4-2x^3-8x^2+6x-1 &amp;amp; (x^2 - 3x + 1),(x^3 + 2x^2 + 3x - 1) \\&#xA;6x^2 + 243x - 378 &amp;amp; (x+42),3,(2x-3) \\&#xA;\end{array}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;How do we know a polynomial is irreducible? We could do trial polynomial-division on all possible smaller polynomials, but it turns out that there are several algorithms that can quickly tell us if a polynomial is irreducible.&lt;/p&gt;&#xA;&lt;p&gt;This challenge is to write a program that returns True if a given  Polynomial meets any of the four irreducibility criteria given below.&lt;/p&gt;&#xA;&lt;p&gt;This is Code Golf - fewest number of bytes wins!&lt;/p&gt;&#xA;&lt;h2&gt;Criteria 1: Gotthold Eisenstein&lt;/h2&gt;&#xA;&lt;p&gt;First your program should determine if the input polynomial meets the irreducibility criteria of &lt;a href=&quot;https://crypto.stanford.edu/pbc/notes/numbertheory/eisenstein.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Gotthold Eisenstein&lt;/a&gt;. This criteria looks for the existence of a special number &lt;span class=&quot;math-container&quot;&gt;\$q\$&lt;/span&gt; such that the following are true:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$q\$&lt;/span&gt; is prime&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$q\$&lt;/span&gt; is not a factor of the Leading Coefficient&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$q\$&lt;/span&gt; &lt;em&gt;&lt;strong&gt;is&lt;/strong&gt;&lt;/em&gt; a factor of all the &lt;em&gt;&lt;strong&gt;non&lt;/strong&gt;&lt;/em&gt;-Leading Coefficients&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$q^2\$&lt;/span&gt; is not a factor of the Constant Coefficient&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$P(x) = 3x^3 + 15x^2 - 25x + 10$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;has a &lt;span class=&quot;math-container&quot;&gt;\$q\$&lt;/span&gt; of 5, where&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;5 is prime&lt;/li&gt;&#xA;&lt;li&gt;5 is not a factor of the leading coefficient 3,&lt;/li&gt;&#xA;&lt;li&gt;5 is a factor of the non-leading coefficients 15, -25, and 10&lt;/li&gt;&#xA;&lt;li&gt;5 squared is not a factor of the constant coefficient 10&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Therefore &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; is irreducible, and your program should return True&lt;/p&gt;&#xA;&lt;h2&gt;Criteria 2: Oskar Perron&lt;/h2&gt;&#xA;&lt;p&gt;In 1907 Oskar Perron's paper describes a &lt;a href=&quot;https://en.wikipedia.org/wiki/Perron%27s_irreducibility_criterion&quot; rel=&quot;nofollow noreferrer&quot;&gt;criteria that does not require factoring the coefficients&lt;/a&gt;. Recall that polynomial P can be written as&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$ P(x) = a_{m}x^m + a_{m-1} x^{m-1} ... + a_1 x^1 + a_0 x^0 $$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Assume &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; is monic, which means the leading coefficient &lt;span class=&quot;math-container&quot;&gt;\$a_{m}\$&lt;/span&gt; is &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Assume &lt;span class=&quot;math-container&quot;&gt;\$a_0\$&lt;/span&gt; is not &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;If the absolute value of &lt;span class=&quot;math-container&quot;&gt;\$a_{m-1}\$&lt;/span&gt; is greater than the sum of all the other coefficient's absolute value, then &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; is irreducible&lt;/li&gt;&#xA;&lt;li&gt;In more mathy language:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$ |a_{m-1}| &amp;gt; \sum_{\substack{i=0\\i\neq{m-1}}}^{m} |a_i| \implies P \mbox{ is irreducible} $$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$P(x)=x^{38797389} - 55x^2 + 2x - 9\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$a_m=1\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$a_0 \ne 0\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$|a_{m-1}| = 55\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Sum of other coefficients absolute value is &lt;span class=&quot;math-container&quot;&gt;\$1+2+9 = 12\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$55 &amp;gt; 12\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Therefore &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; is irreducible, and your program should return True&lt;/p&gt;&#xA;&lt;h2&gt;Criteria 3: Michael Filaseta 1988&lt;/h2&gt;&#xA;&lt;p&gt;Next we visit &lt;a href=&quot;https://www.cambridge.org/core/journals/canadian-journal-of-mathematics/article/irreducibility-criteria-for-polynomials-with-nonnegative-coefficients/A507ABBDF3D0A59A08A2C754BA7A7565&quot; rel=&quot;nofollow noreferrer&quot;&gt;Michael Filaseta's 1988 paper&lt;/a&gt; in which he describes the following wonderful criteria: If &lt;span class=&quot;math-container&quot;&gt;\$P(x)\$&lt;/span&gt; is an integer polynomial of degree &lt;span class=&quot;math-container&quot;&gt;\$&amp;lt;= 31\$&lt;/span&gt; which has non-negative coefficients, and &lt;span class=&quot;math-container&quot;&gt;\$P(10)\$&lt;/span&gt; is prime, then &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; is irreducible.&lt;/p&gt;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ P(x) = x^8+2x^4+23 \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; is of degree 8, which is less than or equal to 31&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ P(10) = 100020023 \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$100020023\$&lt;/span&gt; is prime&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Therefore &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; is irreducible, and your program should return True&lt;/p&gt;&#xA;&lt;h3&gt;Criteria 4: Filaseta and Gross&lt;/h3&gt;&#xA;&lt;p&gt;In 2014 Filaseta and Samuel Gross published the following &lt;a href=&quot;https://people.math.sc.edu/filaseta/papers/FilGrossPap2013Submitted.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;remarkable criteria, which doesn't depend on the degree of the polynomial&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Consider &lt;span class=&quot;math-container&quot;&gt;\$P(x)\$&lt;/span&gt; an integer polynomial with coefficients between &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$49598666989151226098104244512918\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;span class=&quot;math-container&quot;&gt;\$P(10)\$&lt;/span&gt; is prime then &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; is irreducible&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For example&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ P(x) = 54x^{38} + 78783x^{33} + 035033459404x^{21} + 1190354877x^{11} + 56007093177 \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;all coefficients are between &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$49598666989151226098104244512918\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ P(10)= 5478783035033459404119035487756007093177 \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$5478783035033459404119035487756007093177\$&lt;/span&gt; is prime&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Therefore &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; is irreducible, and your program should return True&lt;/p&gt;&#xA;&lt;h3&gt;Input format&lt;/h3&gt;&#xA;&lt;p&gt;The input format can be whatever is easiest for your language, and if your language has built-in polynomials, that is allowed. The test-case  polynomials can be converted to your chosen format before processing into your program. You can take input as an argument to a function, as standard input, or whatever is easiest for your language.&lt;/p&gt;&#xA;&lt;p&gt;If your language has no built-in polynomial format, one suggestion is to look at the &lt;a href=&quot;https://youtu.be/KbNYsNWRtzs?t=499&quot; rel=&quot;nofollow noreferrer&quot;&gt;PolyNumber&lt;/a&gt; format - that is, an array listing the coefficients, and the position within the array indicating the exponent. Lowest powers come first. For example&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$x^2+1 \mbox { is } [1,1] $$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$2x^3+5x^2+7x+4 \mbox { is } [4,7,5,2] $$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$x^4 + 5 \mbox{ is } [ 5,0,0,0,4 ] $$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Extra notes&lt;/h3&gt;&#xA;&lt;p&gt;First, please note these criteria are sufficient but not necessary. This means that if a polynomial meets the criteria, then it is irreducible. However, just because it doesn't meet the criteria, that doesn't mean it's not irreducible. For the challenge, your program just needs to return True if an irreducibility criteria is satisfied. Returning a non-True value will simply indicate the criteria were not satisfied, it won't necessarily mean that the input polynomial is or isn't irreducible.&lt;/p&gt;&#xA;&lt;p&gt;Second, a quick glossary of terminology, for polynomial &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; we have the function&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$P(x) = a_mx^m + a_{m-1} x^{m-1} ... + a_1 x^1 + a_0 x ^ 0 $$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Leading Coefficient - the coefficient of the highest power term: &lt;span class=&quot;math-container&quot;&gt;\$a_m\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Constant Coefficient - the coefficient of the 0th power term: &lt;span class=&quot;math-container&quot;&gt;\$a_0\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Degree - The value of the highest exponent: &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Integer Polynomial - a polynomial where all coefficients are integers&lt;/li&gt;&#xA;&lt;li&gt;Monic Polynomial - a polynomial with Leading Coefficient of 1&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For example let us create an integer polynomial with degree 9, a leading coefficient of 42, and a constant coefficient of -7, as follows:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$ 42x^9-7  $$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Refs&lt;/h2&gt;&#xA;&lt;p&gt;Filaseta, M. (1988). Irreducibility Criteria for Polynomials with non-negative Coefficients. Canadian Journal of Mathematics, 40(2), 339-351. doi:10.4153/CJM-1988-013-6&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://bigprimes.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://bigprimes.org/&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.sciencedirect.com/science/article/pii/S0022314X13002539&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.sciencedirect.com/science/article/pii/S0022314X13002539&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="41273" LastEditorUserId="41273" LastEditDate="2021-09-27T06:48:08.100" LastActivityDate="2021-09-27T06:48:08.100" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23910" PostTypeId="2" ParentId="2140" CreationDate="2021-09-27T13:27:09.590" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Halve Code Regen&lt;/h1&gt;&#xA;&lt;p&gt;TODO: This is a horrible title.&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to write a program, and when I half the program, the output must stay the same. Then, I will halve it and add the last two characters, and the output should be the same with the program's last two characters at the end.&lt;/p&gt;&#xA;&lt;p&gt;Sometimes the code can't be halved evenly, and when that happens, I will do something similar to floor division:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;blahy =&amp;gt; bl&#xA;horse =&amp;gt; ho&#xA;meddle =&amp;gt; med (regular halving)&#xA;oof =&amp;gt; o&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h4&gt;Example for &amp;quot;the output should be the same with the program's last two characters at the end&amp;quot;&lt;/h4&gt;&#xA;&lt;p&gt;Let's say we have this code:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;q|w_a2e(o+2ei2ere&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and the output is&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;q|w_a2e(o+2ei2ere&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;when I change it to&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;q|w_a2e(o+2ei2erere&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;by adding the last two characters (&lt;code&gt;re&lt;/code&gt;), the output should look like&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;q|w_a2e(o+2ei2erere&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Note the extra &lt;code&gt;re&lt;/code&gt; at the)&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No padding with comments&lt;/li&gt;&#xA;&lt;li&gt;The program must have at least 2 characters.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply&lt;/li&gt;&#xA;&lt;li&gt;The output cannot be empty.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the answer with the least bytes wins.&lt;/p&gt;&#xA;&lt;h4&gt;How I came up with the random code in the example two sections ago&lt;/h4&gt;&#xA;&lt;p&gt;&lt;code&gt;q&lt;/code&gt; means quine. &lt;code&gt;|&lt;/code&gt; is a separator. &lt;code&gt;w_a2e&lt;/code&gt; means when the last two characters are added to the end. &lt;code&gt;(o+2e&lt;/code&gt; means add the last two characters to the end. &lt;code&gt;i2ere&lt;/code&gt; means ignore a repeated &lt;code&gt;2e&lt;/code&gt; at the end.&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this even possible?&lt;/li&gt;&#xA;&lt;li&gt;If so, any other suggestions?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2021-10-16T19:19:50.910" LastActivityDate="2021-10-16T19:19:50.910" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="23911" PostTypeId="2" ParentId="202" CreationDate="2021-09-27T16:28:27.133" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://archive.org/details/msdos_qbasic_megapack&quot; rel=&quot;nofollow noreferrer&quot;&gt;QBasic 1.1 at Archive.org&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Real QBasic--sound, graphics, everything--running in DOSBox, available in your browser. Caveats: there's no copy-and-paste, so you have to type your code by hand, and I haven't found a way to break out of infinite loops (short of closing the browser and starting a new session).&lt;/p&gt;&#xA;" OwnerUserId="16766" LastActivityDate="2021-09-27T16:28:27.133" CommentCount="0" CommunityOwnedDate="2021-09-27T16:28:27.133" ContentLicense="CC BY-SA 4.0" />
  <row Id="23916" PostTypeId="1" AcceptedAnswerId="23917" CreationDate="2021-10-02T12:12:38.640" Score="14" ViewCount="991" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19271/78850&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout October 2021, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://leanprover-community.github.io/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Lean&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;What's a Language of the Month?&lt;/h2&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/78850&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during October, those who wish to participate should learn Lean, and use it to solve challenges.&lt;/p&gt;&#xA;&lt;h2&gt;Information about Lean&lt;/h2&gt;&#xA;&lt;p&gt;&lt;sup&gt;Taken from the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/22227/66833&quot;&gt;nomination post&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;Lean is a relatively new theorem proving language. It is very user-friendly and it has &lt;a href=&quot;https://github.com/leanprover-community/mathlib&quot; rel=&quot;nofollow noreferrer&quot;&gt;a comprehensive math library&lt;/a&gt; which is &amp;quot;slowly eating away mathematics&amp;quot;, as &lt;a href=&quot;https://en.wikipedia.org/wiki/Kevin_Buzzard&quot; rel=&quot;nofollow noreferrer&quot;&gt;Kevin Buzzard&lt;/a&gt; puts it.&lt;/p&gt;&#xA;&lt;h2&gt;Pros&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Can be used as a programming language with formal verification support. The upcoming stable release (Lean 4) will make it even easier to program in Lean.&lt;/li&gt;&#xA;&lt;li&gt;Strong focus on approachability and soundness.&lt;/li&gt;&#xA;&lt;li&gt;There is an active community of Lean users ready to answer your Lean questions.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Caveats&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Intimidating documentation. It's much faster to ask a question in the Zulip chat than trying to parse the (often very complex and dense) mathlib docs and Lean reference.&lt;/li&gt;&#xA;&lt;li&gt;You can't really Google anything about Lean. Lean is relatively obscure. But hey, the same goes for other theorem proving languages, right?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/130185/the-lean-to&quot;&gt;Chatroom&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/236157/tips-for-golfing-in-lean&quot;&gt;Tips for golfing in Lean&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#lean&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/leanprover/lean4&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub repo (Lean 4)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/leanprover-community/lean&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub repo (Lean 3)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/leanprover-community/mathlib&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub repo (mathlib)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://wwwf.imperial.ac.uk/%7Ebuzzard/xena/natural_number_game/&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Natural Number Game&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://leanprover-community.github.io&quot; rel=&quot;nofollow noreferrer&quot;&gt;Community home page&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://leanprover.github.io&quot; rel=&quot;nofollow noreferrer&quot;&gt;Official home page&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://leanprover.zulipchat.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Zulip chat&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="56656" LastEditDate="2021-10-08T15:44:31.037" LastActivityDate="2021-10-17T14:10:26.173" Title="Language of the Month for October 2021: Lean" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="0" CommunityOwnedDate="2021-10-02T12:24:09.113" ContentLicense="CC BY-SA 4.0" />
  <row Id="23917" PostTypeId="2" ParentId="23916" CreationDate="2021-10-02T12:12:38.640" Score="6" Body="&lt;h1&gt;List of all Lean solutions posted in October 2021&lt;/h1&gt;&#xA;&lt;p&gt;(First time posters highlighted in bold)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/236057/&quot;&gt;Replace twos with threes&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/&quot;&gt;Wheat Witch&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/236062/&quot;&gt;Is it a row of Pascal's triangle?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/&quot;&gt;Wheat Witch&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/236161/&quot;&gt;What an Odd Function&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/&quot;&gt;Wheat Witch&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/236117/&quot;&gt;∀ a b. a + b = b + a&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/39242/&quot;&gt;Anders Kaseorg&#xA;&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/236109/&quot;&gt;∀ a b. a + b = b + a&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/11143/&quot;&gt;Mario Carneiro&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/236140/&quot;&gt;Lean golf: Pascal vs. Fibonacci&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/39242/&quot;&gt;Anders Kaseorg&#xA;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/236185/&quot;&gt;Lean golf: List Game (rev_rev)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/&quot;&gt;Wheat Witch&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/236190/103581&quot;&gt;Lean golf: List Game (rev_rev)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/39242/&quot;&gt;Anders Kaseorg&#xA;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/236345/95792&quot;&gt;Every Pong is Abelian&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792/user&quot;&gt;&lt;strong&gt;user&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/236347/95792&quot;&gt;Swap Two Values in a List&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792/user&quot;&gt;user&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr&gt;&#xA;&lt;h1&gt;List of all Lean tips posted in October 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/236158/&quot;&gt;Introductions&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/&quot;&gt;Wheat Witch&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/236168/&quot;&gt;Use &lt;code&gt;by&lt;/code&gt; instead of &lt;code&gt;begin ... end&lt;/code&gt;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95792/&quot;&gt;user&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/236176/&quot;&gt;The &lt;code&gt;;&lt;/code&gt; and &lt;code&gt;&amp;lt;|&amp;gt;&lt;/code&gt; combinators&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/7819/&quot;&gt;It'sNotALie.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;tip title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;List of Lean-related challenges posted in October 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/236105/&quot;&gt;∀ a b. a + b = b + a&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/&quot;&gt;Wheat Witch&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/236143/&quot;&gt;Lean golf: Balanced Bracket Sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/103581/&quot;&gt;Huỳnh Trần Khanh&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/236132/&quot;&gt;Lean golf: Pascal vs. Fibonacci&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/236182/lean-golf-list-game-rev-rev&quot;&gt;Lean golf: List Game (rev_rev)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/236235/66833&quot;&gt;Lean golf: List Game Lv2 (is_in_append, is_in_rev)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/236295/&quot;&gt;Every Pong is Abelian&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/&quot;&gt;Wheat Witch&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/q/&amp;lt;question-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-10-17T14:10:26.173" LastActivityDate="2021-10-17T14:10:26.173" CommentCount="0" CommunityOwnedDate="2021-10-02T12:12:38.640" ContentLicense="CC BY-SA 4.0" />
  <row Id="23918" PostTypeId="1" AcceptedAnswerId="23919" CreationDate="2021-10-03T03:41:23.410" Score="4" ViewCount="145" Body="&lt;p&gt;Lean is now the Language of the Month. Yay!&lt;/p&gt;&#xA;&lt;p&gt;But... Lean is a theorem proving language. It is also a general purpose, Turing complete&lt;sup&gt;1&lt;/sup&gt; programming language too but I mean... Lean isn't exactly better than other languages on that front wrt code golf.&lt;/p&gt;&#xA;&lt;p&gt;On the &lt;a href=&quot;https://leanprover.zulipchat.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Lean Zulip chat&lt;/a&gt;, sometimes users compete to write the shortest proof possible for a given lemma. Could we also do something similar on this Code Golf website?&lt;/p&gt;&#xA;&lt;p&gt;The main issue with this is that this wouldn't be language agnostic: how the problem statement is formalized, or specified in the theorem proving language can significantly affect the proof.&lt;/p&gt;&#xA;&lt;hr&gt;&#xA;&lt;sup&gt;1&lt;/sup&gt;&amp;nbsp;You can turn off the termination checker. There are functions to interact with the operating system.&#xA;" OwnerUserId="103581" LastActivityDate="2021-10-03T10:23:50.083" Title="Golfing Challenges for Interactive Theorem Provers" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23919" PostTypeId="2" ParentId="23918" CreationDate="2021-10-03T10:23:50.083" Score="4" Body="&lt;p&gt;We generally want challenges to be open to all languages.  However when you have a good reason restrict a challenge to a particular language you should.&lt;/p&gt;&#xA;&lt;p&gt;When it comes to &amp;quot;What is the shortest way to prove this theorem?&amp;quot;, I don't think there is a good way to express that idea in a language agnostic way, and it seems like you are struggling with the same thing.&lt;/p&gt;&#xA;&lt;p&gt;So don't worry.&lt;/p&gt;&#xA;&lt;p&gt;I've asked language specific challenges in the past this way and they don't seem to be particularly damaged by this fact.&lt;sup&gt;&lt;sup&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/153744/wait-what-language-is-this&quot;&gt;[1]&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/122569/56656&quot;&gt;[2]&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/166594/interpreted-arithmetic&quot;&gt;[3]&lt;/a&gt;&lt;/sup&gt;&lt;/sup&gt;  I do think that any of these challenges would be significantly worsened by attempts to make them language agnostic.  They would have to be very complex in their definitions, making a bloated challenge that's only really fun in one or two languages anyway.&lt;/p&gt;&#xA;&lt;p&gt;Right now Lean is the LotM, so I think that there will be some amount of interest in Lean and it's features.  I was even planning on asking a question like the one you describe sometime this month.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2021-10-03T10:23:50.083" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23920" PostTypeId="1" CreationDate="2021-10-04T05:41:55.037" Score="2" ViewCount="70" Body="&lt;p&gt;Suppose there is a challenge that is rather hard, and has few answers. &lt;strong&gt;Is it OK to post a new challenge that is actually a part of the bigger and harder challenge?&lt;/strong&gt; Of course, attributing the original author for inspiration is without question.&lt;/p&gt;&#xA;&lt;p&gt;The new challenge may be considered a duplicate (as the answers can be trivially adapted just but cutting off big chunks of code). However, it can attract more users in a wider set of languages.&lt;/p&gt;&#xA;&lt;p&gt;(I have in mind &lt;a href=&quot;https://codegolf.stackexchange.com/questions/235848/is-this-flow-free-puzzle-trivial&quot;&gt;Is this Flow Free puzzle trivial?&lt;/a&gt; to be specific, but let's talk in general.)&lt;/p&gt;&#xA;" OwnerUserId="55372" LastEditorUserId="66833" LastEditDate="2021-10-04T06:02:24.017" LastActivityDate="2021-10-07T01:09:04.373" Title="Are parts of challenges allowed to be posted on their own?" Tags="|discussion|asking-questions|challenges|etiquette|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23923" PostTypeId="2" ParentId="2140" CreationDate="2021-10-04T23:16:34.323" Score="4" Body="&lt;h1&gt;Converting Pinyin to Zhuyin or vice versa&lt;/h1&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Pinyin and Zhuyin are systems that are used to help people pronounce characters in Mandarin Chinese. Write a function/program that converts Pinyin to Zhuyin or vice versa (clarify which one you are doing) according to the tables below. You are not required to deal with tones or incorrect inputs (including edge cases such as ḿ(呣), ǹg(嗯), and ê̄(诶/誒)).&lt;/p&gt;&#xA;&lt;h3&gt;Pinyin to Zhuyin&lt;/h3&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Pinyin&lt;/th&gt;&#xA;&lt;th&gt;Zhuyin&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;b&lt;/td&gt;&#xA;&lt;td&gt;ㄅ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;p&lt;/td&gt;&#xA;&lt;td&gt;ㄆ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;m&lt;/td&gt;&#xA;&lt;td&gt;ㄇ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;f&lt;/td&gt;&#xA;&lt;td&gt;ㄈ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;d&lt;/td&gt;&#xA;&lt;td&gt;ㄉ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;t&lt;/td&gt;&#xA;&lt;td&gt;ㄊ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;n (at the beginning)&lt;/td&gt;&#xA;&lt;td&gt;ㄋ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;l&lt;/td&gt;&#xA;&lt;td&gt;ㄌ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;g (at the beginning)&lt;/td&gt;&#xA;&lt;td&gt;ㄍ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;k&lt;/td&gt;&#xA;&lt;td&gt;ㄎ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;h (at the beginning)&lt;/td&gt;&#xA;&lt;td&gt;ㄏ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;j&lt;/td&gt;&#xA;&lt;td&gt;ㄐ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;q&lt;/td&gt;&#xA;&lt;td&gt;ㄑ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;x&lt;/td&gt;&#xA;&lt;td&gt;ㄒ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;zh (except in zhi)&lt;br&gt;zhi&lt;/td&gt;&#xA;&lt;td&gt;ㄓ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ch (except in chi)&lt;br&gt;chi&lt;/td&gt;&#xA;&lt;td&gt;ㄔ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;sh (except in shi)&lt;br&gt;shi&lt;/td&gt;&#xA;&lt;td&gt;ㄕ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;r (at the beginning)&lt;br&gt;ri&lt;/td&gt;&#xA;&lt;td&gt;ㄖ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;z (except in zh, zi)&lt;br&gt;zi&lt;/td&gt;&#xA;&lt;td&gt;ㄗ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;c (except in ch, ci)&lt;br&gt;ci&lt;/td&gt;&#xA;&lt;td&gt;ㄘ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;s (except in sh, si)&lt;br&gt;si&lt;/td&gt;&#xA;&lt;td&gt;ㄙ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;a (at the end)&lt;/td&gt;&#xA;&lt;td&gt;ㄚ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;o (except in ao, ou, ong)&lt;/td&gt;&#xA;&lt;td&gt;ㄛ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;e (except in ei, en, eng, er, ie, ue, üe, ye)&lt;/td&gt;&#xA;&lt;td&gt;ㄜ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;e (only in ie, ue, üe, ye)&lt;/td&gt;&#xA;&lt;td&gt;ㄝ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;i (except in ai, ei, ui, iu, iong, yi, zhi, chi, shi, ri, zi, ci, si)&lt;br&gt;y (except in yong, yi)&lt;br&gt;yi&lt;/td&gt;&#xA;&lt;td&gt;ㄧ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;u (except in ou, iu, wu, ue and except after j, q, x, y)&lt;br&gt;w (except in wu)&lt;br&gt;wu&lt;br&gt;o (only in ong except in iong, yong)&lt;/td&gt;&#xA;&lt;td&gt;ㄨ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;u (right after j, q, x)&lt;br&gt;ü&lt;br&gt;yu&lt;br&gt;io&lt;br&gt;yo (only in yong)&lt;/td&gt;&#xA;&lt;td&gt;ㄩ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ai&lt;/td&gt;&#xA;&lt;td&gt;ㄞ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ei&lt;br&gt;i (only in ui)&lt;/td&gt;&#xA;&lt;td&gt;ㄟ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ao&lt;/td&gt;&#xA;&lt;td&gt;ㄠ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ou&lt;br&gt;u (only in iu)&lt;/td&gt;&#xA;&lt;td&gt;ㄡ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;an (except in ang)&lt;/td&gt;&#xA;&lt;td&gt;ㄢ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ang&lt;/td&gt;&#xA;&lt;td&gt;ㄤ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;en (except in eng)&lt;br&gt;n (only in in, un except in ing)&lt;/td&gt;&#xA;&lt;td&gt;ㄣ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;eng&lt;br&gt;ng (only in ing, ong)&lt;/td&gt;&#xA;&lt;td&gt;ㄥ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;er&lt;/td&gt;&#xA;&lt;td&gt;ㄦ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;h3&gt;Zhuyin to Pinyin&lt;/h3&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Zhuyin&lt;/th&gt;&#xA;&lt;th&gt;Pinyin&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄅ&lt;/td&gt;&#xA;&lt;td&gt;b&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄆ&lt;/td&gt;&#xA;&lt;td&gt;p&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄇ&lt;/td&gt;&#xA;&lt;td&gt;m&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄈ&lt;/td&gt;&#xA;&lt;td&gt;f&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄉ&lt;/td&gt;&#xA;&lt;td&gt;d&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄊ&lt;/td&gt;&#xA;&lt;td&gt;t&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄋ&lt;/td&gt;&#xA;&lt;td&gt;n&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄌ&lt;/td&gt;&#xA;&lt;td&gt;l&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄍ&lt;/td&gt;&#xA;&lt;td&gt;g&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄎ&lt;/td&gt;&#xA;&lt;td&gt;k&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄏ&lt;/td&gt;&#xA;&lt;td&gt;h&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄐ&lt;/td&gt;&#xA;&lt;td&gt;j&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄑ&lt;/td&gt;&#xA;&lt;td&gt;q&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄒ&lt;/td&gt;&#xA;&lt;td&gt;x&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄓ (by itself)&lt;/td&gt;&#xA;&lt;td&gt;zhi&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄓ (not by itself)&lt;/td&gt;&#xA;&lt;td&gt;zh&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄔ (by itself)&lt;/td&gt;&#xA;&lt;td&gt;chi&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄔ (not by itself)&lt;/td&gt;&#xA;&lt;td&gt;ch&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄕ (by itself)&lt;/td&gt;&#xA;&lt;td&gt;shi&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄕ (not by itself)&lt;/td&gt;&#xA;&lt;td&gt;sh&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄖ (by itself)&lt;/td&gt;&#xA;&lt;td&gt;ri&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄖ (not by itself)&lt;/td&gt;&#xA;&lt;td&gt;r&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄗ (by itself)&lt;/td&gt;&#xA;&lt;td&gt;zi&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄗ (not by itself)&lt;/td&gt;&#xA;&lt;td&gt;z&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄘ (by itself)&lt;/td&gt;&#xA;&lt;td&gt;ci&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄘ (not by itself)&lt;/td&gt;&#xA;&lt;td&gt;c&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄙ (by itself)&lt;/td&gt;&#xA;&lt;td&gt;si&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄙ (not by itself)&lt;/td&gt;&#xA;&lt;td&gt;s&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄚ&lt;/td&gt;&#xA;&lt;td&gt;a&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄛ&lt;/td&gt;&#xA;&lt;td&gt;o&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄜ&lt;/td&gt;&#xA;&lt;td&gt;e&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄝ&lt;/td&gt;&#xA;&lt;td&gt;e&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄧ (at the beginning, not by itself, and not before ㄣ, ㄥ)&lt;/td&gt;&#xA;&lt;td&gt;y&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄧ (after ㄐ, ㄑ, ㄒ)&lt;/td&gt;&#xA;&lt;td&gt;i&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄧ (by itself or before ㄣ, ㄥ and at the beginning)&lt;/td&gt;&#xA;&lt;td&gt;yi&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄨ (not at the beginning)&lt;/td&gt;&#xA;&lt;td&gt;u&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄨ (at the beginning except by itself)&lt;/td&gt;&#xA;&lt;td&gt;w&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄨ (by itself)&lt;/td&gt;&#xA;&lt;td&gt;wu&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄨ (before ㄥ and not at the beginning)&lt;/td&gt;&#xA;&lt;td&gt;o&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄩ (after ㄐ, ㄑ, ㄒ)&lt;/td&gt;&#xA;&lt;td&gt;u&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄩ (after ㄋ, ㄌ)&lt;/td&gt;&#xA;&lt;td&gt;ü&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄩ (by itself or before ㄝ, ㄢ, ㄣ and at the beginning)&lt;/td&gt;&#xA;&lt;td&gt;yu&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄩ (not at the beginning and before ㄥ)&lt;/td&gt;&#xA;&lt;td&gt;io&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄩ (at the beginning and before ㄥ)&lt;/td&gt;&#xA;&lt;td&gt;yo&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄞ&lt;/td&gt;&#xA;&lt;td&gt;ai&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄟ (not after ㄨ unless ㄨ is at the beginning)&lt;/td&gt;&#xA;&lt;td&gt;ei&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄟ (after ㄨ unless ㄨ is at the beginning)&lt;/td&gt;&#xA;&lt;td&gt;i&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄠ&lt;/td&gt;&#xA;&lt;td&gt;ao&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄡ (not after ㄧ unless ㄧ is at the beginning)&lt;/td&gt;&#xA;&lt;td&gt;ou&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄡ (after ㄧ unless ㄧ is at the beginning)&lt;/td&gt;&#xA;&lt;td&gt;u&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄢ&lt;/td&gt;&#xA;&lt;td&gt;an&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄤ&lt;/td&gt;&#xA;&lt;td&gt;ang&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄣ (not after ㄧ, ㄨ, ㄩ unless ㄨ is at the beginning)&lt;/td&gt;&#xA;&lt;td&gt;en&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄣ (after ㄧ, ㄨ, ㄩ unless ㄨ is at the beginning)&lt;/td&gt;&#xA;&lt;td&gt;n&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄥ (not after ㄧ, ㄨ, ㄩ unless ㄨ is at the beginning)&lt;/td&gt;&#xA;&lt;td&gt;eng&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄥ (after ㄧ, ㄨ, ㄩ unless ㄨ is at the beginning)&lt;/td&gt;&#xA;&lt;td&gt;ng&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ㄦ&lt;/td&gt;&#xA;&lt;td&gt;er&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;This is code-golf, so the answer with the least bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Pinyin&lt;/th&gt;&#xA;&lt;th&gt;Zhuyin&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;chuang&lt;/td&gt;&#xA;&lt;td&gt;ㄔㄨㄤ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;xue&lt;/td&gt;&#xA;&lt;td&gt;ㄒㄩㄝ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;diu&lt;/td&gt;&#xA;&lt;td&gt;ㄉㄧㄡ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;juan&lt;/td&gt;&#xA;&lt;td&gt;ㄐㄩㄢ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ri&lt;/td&gt;&#xA;&lt;td&gt;ㄖ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;song&lt;/td&gt;&#xA;&lt;td&gt;ㄙㄨㄥ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;lü&lt;/td&gt;&#xA;&lt;td&gt;ㄌㄩ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;qiong&lt;/td&gt;&#xA;&lt;td&gt;ㄑㄩㄥ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;zhen&lt;/td&gt;&#xA;&lt;td&gt;ㄓㄣ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;huo&lt;/td&gt;&#xA;&lt;td&gt;ㄏㄨㄛ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ying&lt;/td&gt;&#xA;&lt;td&gt;ㄧㄥ&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://terpconnect.umd.edu/%7Ensw/chinese/pinyin.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Additional test cases and information&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="91262" LastEditorUserId="91262" LastEditDate="2021-10-13T21:30:19.530" LastActivityDate="2021-10-13T21:30:19.530" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="23924" PostTypeId="1" CreationDate="2021-10-04T23:45:32.843" Score="12" ViewCount="469" Body="&lt;p&gt;Currently we have a policy that all answers must be serious contenders, or they are subject to deletion.  This can be found in &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;help/on-topic&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Be a serious contender for the winning criteria in use. For example, an entry to a code golf contest needs to be golfed, and an entry to a speed contest should make some attempt to be fast.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This policy to my knowledge, stems from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990/56656&quot;&gt;this answer&lt;/a&gt; by Dennis discussing invalid answers.  It's discussing a lot of stuff, and the bit about non-serious contenders is sort of tucked away in there without an discussion at length.  Yet somehow this has become site policy to the extent it appears in our help center.&lt;/p&gt;&#xA;&lt;p&gt;Well I would like to discuss it, because honestly I don't like it.  I've outlined my perspective in an answer so that you can see where I'm coming from, but mostly I'd like to open this up to discussion. So then ...&lt;/p&gt;&#xA;&lt;p&gt;Is this a good policy? What arguments are there in favor or against it?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="68942" LastEditDate="2021-10-04T23:48:57.613" LastActivityDate="2021-10-07T17:06:38.877" Title="Can we revisit our policy on answers that are not serious contenders?" Tags="|discussion|help-center|deleted-answers|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23925" PostTypeId="2" ParentId="23924" CreationDate="2021-10-04T23:45:32.843" Score="8" Body="&lt;h1&gt;My Perspective&lt;/h1&gt;&#xA;&lt;p&gt;This is not a complete answer, it's just offering my perspective.  It leans towards suggesting action, but I'd rather let other people speak before we are done here. I'm putting it here to not clutter up the post.&lt;/p&gt;&#xA;&lt;p&gt;In my experience as moderator, of the non-serious contenders (which were flagged as such) there are broadly three categories:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Answers that are very high effort but not going towards the Scoring Criterion. These are commonly answers that choose a difficult or complex language or algorithm to tackle a problem.  Sometimes they are the first answer to a long unanswered challenge.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Now I'd really prefer these to be golfed, and I probably won't upvote them until they do. An answer that solves the challenge in &lt;span class=&quot;math-container&quot;&gt;\$O(\log(n))\$&lt;/span&gt; using a special algorithm &lt;em&gt;and&lt;/em&gt; is well golfed considering is worth an upvote from me.&lt;/p&gt;&#xA;&lt;p&gt;However at the same time I recognize that when you've spent hours working on something and it finally works, you just want to post it.  Maybe take a nap and come back to it later, maybe someone will even spot an error before you start golfing it.  And not everything that you plan on coming back to later always gets done.&lt;/p&gt;&#xA;&lt;p&gt;As a moderator when I'm asked to delete these answers it pains me.  Usually these languish in the inbox for a couple of days because none of us wants to delete something that clearly took hours of time.  Only a small percentage of the answers we delete are ever undeleted.  I don't feel like this motivates anyone to golf.&lt;/p&gt;&#xA;&lt;p&gt;The second category is pretty similar to the first&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Answers that are either clever, jokes or both.  They were never really about golfing, and golfing would sort of defeat the point.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;To be clear some jokes actually fall IMO into the first category as a joke can sometimes just be a strange restriction.  For example writing an answer that when read aloud forms a limerick.  It's a joke sure, but it's also a restriction just like choosing a funny esolang is.  So to these what I've said in the first one applies, I'd like to see an effort put into the SC in addition to the effort put towards making it funny, but I'm loath to delete answers that don't.&lt;/p&gt;&#xA;&lt;p&gt;With that aside this is probably actually the smallest category. However these answers get the most attention so I think they have an outsized influence.  I don't really like being the fun police coming and telling people they are having fun wrong, but these answers are pretty rare so it's not a big issue for me.&lt;/p&gt;&#xA;&lt;p&gt;The last type of answer is one I'm pretty apathetic about:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Answers made by new users who just don't seem to know what code-golf is and just solve the problem.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I just don't care about these answers, they can be deleted or kept.  Doesn't matter to me.  At most I think it's a little hostile to newcomers to delete their posts like this, but they don't seem to be interested in what our site is about anyway.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;So these answers aren't great, I'm probably not upvoting any of them.  However my view is that this isn't really enough to justify deleting them.  I don't see them as a blight that needs to be excised, they're just not great, and I wonder if deleting them is doing more harm than good.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;One last thought&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; challenges are a little different from other types of challenges.  In a normal &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge if someone posts a bad answer, at worst you have to look at it. But when someone posts an answer that scores poorly you are still forced to interact with it.&lt;/p&gt;&#xA;&lt;p&gt;It is my impression that for certain KotHs there are sometimes answers that don't score very well but are designed to just mess with the game.  My perspective here is that if this is possible that's probably indicative of a flaw in the challenge design.  Other than answers specifically made to boost another answer KotHs should be resistant to some amount of stupidity.&lt;/p&gt;&#xA;&lt;p&gt;However I get it can be annoying, and maybe we ought to have different rules specifically for challenges with inter-player interaction.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;See also:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1916/56656&quot;&gt;This standard loophole on suicidal submissions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default/1916#comment8342_1916&quot;&gt;ME's comment&lt;/a&gt;:&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I find that joke submissions in general are very important to get many KotHs going. For instance, if people had only ever posted serious submissions to RPSLV, there would have been no game, since nothing can beat a uniformly random strategy with anything but luck. Furthermore, KotHs need many submissions to be fun, and a bunch of less serious submissions in the beginning help a lot to explore the strategy space and gather some popularity.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="39490" LastEditDate="2021-10-07T14:08:11.407" LastActivityDate="2021-10-07T14:08:11.407" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23926" PostTypeId="2" ParentId="23924" CreationDate="2021-10-05T01:06:10.187" Score="18" Body="&lt;h2&gt;I dislike our current stance on &amp;quot;serious contenders&amp;quot;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;TL;DR: we don't make it clear enough that answers with self-imposed restrictions are valid&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;From my conversations with moderators, from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/18476/66833&quot;&gt;posts by former moderators&lt;/a&gt; and just from my own anecdotal experience, I've realised that our moderators spent a decent chunk of their time deleting &amp;quot;invalid&amp;quot; answers that have been flagged by users without the ability to vote to delete (and, often, those with). A lot of these answers are not &amp;quot;serious contenders&amp;quot;, which, as we define in our help center, all answers must be.&lt;/p&gt;&#xA;&lt;p&gt;In my opinion, &lt;strong&gt;this is a waste of our moderators&lt;/strong&gt;, and an example of one of my personal biggest issues with this site. Answers shouldn't be deleted on a &amp;quot;technicality&amp;quot; that they aren't properly golfed, or don't make a proper effort to improve their score. Answers &lt;em&gt;should&lt;/em&gt; be deleted if they clearly don't belong on the site.&lt;/p&gt;&#xA;&lt;p&gt;For me, there are three types of answers that should be considered, mostly as I've seen all of them deleted under the excuse of &amp;quot;not a serious contender&amp;quot; before:&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;These are similar to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/23925/66833&quot;&gt;WW's categories&lt;/a&gt;, especially the first two&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Answers where the code obviously makes no attempt to improve their score, and the answer isn't especially &amp;quot;impressive&amp;quot; or &amp;quot;high-effort&amp;quot;. Most often, these are posted by new users who simply attempt to solve the task and don't understand that improving their score is just as central as actually solving the task.&lt;/p&gt;&#xA;&lt;p&gt;The appropriate course of action here is to inform the user that they should make an effort to improve their score, and, if nothing has changed after a certain amount of time, flag for deletion. This site is &lt;em&gt;not&lt;/em&gt; a code sharing site, we &lt;em&gt;specifically&lt;/em&gt; host coding challenges.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Answers where the code makes no attempt to improve their score, but is a &amp;quot;high-effort&amp;quot; answer (often the first answer to a long-unanswered challenge). These are, most of the time, posted by users familiar with the site rules, and are aware of our current stances on serious contenders.&lt;/p&gt;&#xA;&lt;p&gt;I &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=59137841#59137841&quot;&gt;dislike these answers&lt;/a&gt;. Considering only &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; for the moment, I absolutely believe that these answers should, at the very minimum, make an effort to golf their code (remove whitespace, shorten variable names, no comments etc.). To me, this is a form of quality control; we are, fundamentally, a site for &lt;em&gt;competitive&lt;/em&gt; programming, not a forum where people can share any and all code they find interesting, and so answers must be somewhat competitive, even if that is removing whitespace and using &lt;code&gt;l=1&lt;/code&gt; instead of &lt;code&gt;length_of_string = 1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Answers which impose some form of restriction on themselves - self-imposed, not by the challenge - and attempt to improve their score as much as possible, &lt;em&gt;under this restriction&lt;/em&gt;. One such example is &lt;a href=&quot;https://codegolf.stackexchange.com/a/187885&quot;&gt;this answer&lt;/a&gt;, which was recently &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=59286662#59286662&quot;&gt;brought up in chat&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;These answers are hurt the most by our current stance. They are valid answers that solve the task &lt;em&gt;and&lt;/em&gt; make an effort to improve their score. By all readings of the rules, these should be valid. However, there are a few users who hold the belief that, unless an answer does &lt;em&gt;everything&lt;/em&gt; within its power to improve its score, it doesn't count as a &amp;quot;serious contender&amp;quot;. I &lt;strong&gt;strongly&lt;/strong&gt; disagree with this. Both of the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990/66833&quot;&gt;two answers&lt;/a&gt; about &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8750/66833&quot;&gt;serious contenders&lt;/a&gt; loosely allude to these answers, with wording such as&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A serious contender is a submission which makes a serious effort towards optimizing the submission's score within the chosen language(s) and other choices (such as algorithm choice or &lt;strong&gt;optional restrictions/bonuses taken&lt;/strong&gt;).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;sup&gt;Emphasis mine&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;However, this isn't exactly clear, nor obvious.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, this potentially opens the door to someone posting a non-golfed answer to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge and claiming they're imposing the restriction that their code must be readable (or have a minimum length of 200 or whatever). This is an obvious exploitation of our rules, and I'd expect our moderators to handle this appropriately. This isn't a concern.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;I have no issue with 1. being deleted. Additionally, if the answer author to 2. fails to edit in a score improvement after a reasonable amount of time, I have no qualms about their answer being deleted. However, it's when 3. gets deleted that I take issue.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Therefore, I'd like the policy to change slightly. I believe that the two following changes would greatly improve how we handle these kind of answers:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Making it clearer in the help center and meta answers that &lt;strong&gt;self-restricted answers can still be serious contenders&lt;/strong&gt;, and&lt;/li&gt;&#xA;&lt;li&gt;Sticking to this; our moderators should decline flags that ask for these answers to be deleted, and make it clear to flaggers that these answers are perfectly acceptable per our rules.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Additionally, I realise that &amp;quot;impressive&amp;quot; or &amp;quot;high-effort&amp;quot; are, by no means, objectively definable terms. I have no issue with this, as this kind of &amp;quot;exception handling&amp;quot; is &lt;em&gt;precisely&lt;/em&gt; what we elect our moderators for. I trust that our mods can distinguish between &amp;quot;low-effort&amp;quot; answers that should be deleted and &amp;quot;high-effort&amp;quot; answers that should be cultivated to make the answer a bit fit for the site.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-10-07T17:06:38.877" LastActivityDate="2021-10-07T17:06:38.877" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23927" PostTypeId="2" ParentId="2140" CreationDate="2021-10-05T13:13:03.213" Score="0" Body="&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2021-10-07T11:54:32.960" LastActivityDate="2021-10-07T11:54:32.960" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23928" PostTypeId="2" ParentId="2140" CreationDate="2021-10-05T17:14:29.410" Score="0" Body="&lt;h1&gt;Hearts KotH&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your challenge, should you choose to accept it, is to write a Java bot to play a simplified version of hearts.&lt;/p&gt;&#xA;&lt;p&gt;Hearts is a four-player trick-based card game. To start a round of hearts, each player is dealt 13 cards. The player who has the two of clubs starts by playing the two of clubs. Going around the circle each player plays another card, in the same suit as as the first card if possible. Once every player has played one card, the trick is complete, and goes to the player who placed the highest valued card in the original suit (aces are high). The player who takes the trick is responsible for all of the points contained in the trick, as well as leading the next trick. This continues until all players are out of cards, at which point the hand is complete.&lt;/p&gt;&#xA;&lt;p&gt;During a hand, each heart taken is worth 1 point and the queen of spades 13 points. If during the course of a hand one player receives all 26 points, they shoot the moon and receive zero while everyone else receives 26 points. The game ends once a player clears 100 points, at which point the player with the lowest score wins.&lt;/p&gt;&#xA;&lt;h2&gt;The Challenge ​&lt;/h2&gt;&#xA;&lt;p&gt;Write a Java 11 bot extending a (todo) abstract class. A new bot will be instantiated for each hand. Every combination of 4 bots will play one game with each other. After all of the games are complete, the bots will be scored on the total number of wins (higher is better), with the tiebreaker being the average score per game (lower is better).&lt;/p&gt;&#xA;&lt;p&gt;Tampering with the controller, tampering or instantiating other bots, damaging my computer, taking an excessively long time to complete a turn, failing to compile, violating standard loopholes, or throwing a runtime &lt;code&gt;Error&lt;/code&gt; is strictly prohibited and will result in disqualification. Throwing an exception will result in a 1 point penalty and the controller playing for you in an unspecified manner. Nondeterministic bots and storing data between both Hands and games are permitted.&lt;/p&gt;&#xA;&lt;h2&gt;Meta:&lt;/h2&gt;&#xA;&lt;p&gt;Is this clear enough?&lt;/p&gt;&#xA;&lt;p&gt;I haven't written the controller yet, is there any data in particular that you would like to see the bots receive (among other things, a way to determine the legality of the move, as well as cards played are already passed in)?&lt;/p&gt;&#xA;" OwnerUserId="97691" LastActivityDate="2021-10-05T17:14:29.410" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23929" PostTypeId="2" ParentId="2140" CreationDate="2021-10-05T19:29:39.260" Score="0" Body="&lt;h1&gt;Optimize my Cruise Control&lt;/h1&gt;&#xA;&lt;p&gt;My cars cruise-control functionality has 4 different methods of adjustment, all using a single stalk.  They are as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Hard press up (press until you feel the click): +5 mph&lt;/li&gt;&#xA;&lt;li&gt;Soft press up (press lightly, but not to the click): +1 mph&lt;/li&gt;&#xA;&lt;li&gt;Soft press down (press lightly, but not to the click): -1 mph&lt;/li&gt;&#xA;&lt;li&gt;Hard press down (press until you feel the click): -5 mph&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If your current speed is not a multiple of 5, a hard press will take you up/down to the nearest 5 multiple.&lt;/p&gt;&#xA;&lt;p&gt;The challenge is to write a function that takes your current speed and target speed as parameters, and outputs the shortest sequence of stalk inputs to get from current -&amp;gt; target speed.&lt;/p&gt;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take 2 integers as input&lt;/li&gt;&#xA;&lt;li&gt;Return a list/iterable/whatever of the minimum actions needed to get to target speed&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Examples:&#xA;(&lt;code&gt;U&lt;/code&gt; is hard up, &lt;code&gt;u&lt;/code&gt; is soft up, &lt;code&gt;d&lt;/code&gt; is soft down, &lt;code&gt;D&lt;/code&gt; is hard down)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[5, 6] -&amp;gt; [u]&#xA;[20, 37] -&amp;gt; [U,U,U,u,u]&#xA;[42, 45] -&amp;gt; [U]&#xA;[16,23] -&amp;gt; [U,u,u,u] or [U,U,d,d]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;currently known issues&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;needs more examples&lt;/li&gt;&#xA;&lt;li&gt;similar to the Optimal Change problem.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Other possible improvements&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Maybe make it a more generalized function that takes 4 inputs [v_current, v_target, delta_small, delta_large].  This would have the effect of complicating the logic and making the problem a bit less trivial.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41195" LastEditorUserId="41195" LastEditDate="2021-10-06T14:04:54.910" LastActivityDate="2021-10-06T14:04:54.910" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23930" PostTypeId="2" ParentId="2140" CreationDate="2021-10-06T18:33:03.100" Score="3" Body="&lt;h1&gt;Volume of a 3d model&lt;/h1&gt;&#xA;&lt;p&gt;In this challenge, you'll take a shape as input, consisting of a number of triangles forming an outer shell. Your task will be to find the volume of the resulting shape.&lt;/p&gt;&#xA;&lt;p&gt;You can assume the triangles all connect to exactly one other triangle per side, and the surface does not cross over itself. You will not get an input where two separate solids touch only at points or edges.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test cases and sample implementation coming soon&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-10-06T18:33:03.100" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="23931" PostTypeId="2" ParentId="23920" CreationDate="2021-10-07T01:09:04.373" Score="1" Body="&lt;h1&gt;It depends&lt;/h1&gt;&#xA;&lt;p&gt;Getting challenge ideas (be it a sub-task or a variant) from an existing challenge is perfectly fine. IMO you don't need any kind of explicit permission, as long as you specify in your challenge where you got your inspiration from.&lt;/p&gt;&#xA;&lt;p&gt;The only things that actually matter are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the new challenge interesting enough on its own?&lt;/li&gt;&#xA;&lt;li&gt;Is it significantly different enough from existing challenge(s)?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I don't think a big chunk of an existing challenge is a dupe, if it leaves out another big chunk of it. But it depends on the tasks at hand, and people may think differently. The only way to figure out is to post a draft in the sandbox first, as always.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2021-10-07T01:09:04.373" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23935" PostTypeId="2" ParentId="2140" CreationDate="2021-10-07T17:37:04.490" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/236143/&quot;&gt;Balanced Bracket Sequence&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="103581" LastEditorUserId="103581" LastEditDate="2021-10-08T08:41:27.650" LastActivityDate="2021-10-08T08:41:27.650" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23938" PostTypeId="2" ParentId="1061" CreationDate="2021-10-07T23:59:57.167" Score="18" Body="&lt;h2&gt;Sidestepping in a theorem-proving challenge&lt;/h2&gt;&#xA;&lt;p&gt;A theorem-proving challenge is about proving a statement (= constructing a value of the given type) given in a specific host language (designed for theorem proving, most likely Lean or Coq).&lt;/p&gt;&#xA;&lt;p&gt;One problem with this is that the host language may have various utilities that allow writing a &amp;quot;proof&amp;quot; that is not actually a sound proof of the given statement. This loophole bans any kind of answer that does this, including (but not limited to):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Using a feature that introduces explicit holes in a proof (in Lean, &lt;code&gt;sorry&lt;/code&gt;, &lt;code&gt;axiom&lt;/code&gt;, &lt;code&gt;admit&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Using a feature that allows introducing a value of False (in Lean, &lt;code&gt;constant&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Proving a similar-looking, but not identical statement. e.g. in Lean,&#xA;&lt;pre&gt;&lt;code&gt;local notation a `=` b := true&#xA;theorem X (n : ℕ) :&#xA;  ((list.nat.antidiagonal n).map (function.uncurry nat.choose)).sum&#xA;  = n.succ.fib := trivial&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;is not considered a valid proof of&#xA;&lt;pre&gt;&lt;code&gt;theorem X (n : ℕ) :&#xA;  ((list.nat.antidiagonal n).map (function.uncurry nat.choose)).sum&#xA;  = n.succ.fib&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-10-08T03:13:06.710" LastActivityDate="2021-10-08T03:13:06.710" CommentCount="0" CommunityOwnedDate="2021-10-07T23:59:57.167" ContentLicense="CC BY-SA 4.0" />
  <row Id="23942" PostTypeId="2" ParentId="2140" CreationDate="2021-10-09T10:01:14.077" Score="1" Body="&lt;h1&gt;Implement Unix Timestamp to Daytime&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given an unsigned integer that represents a timestamp since 1970/01/01 00:00:00 (which is Unix epoch time), output one of these to represent the daytime in GMT timezone:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An array that stores &lt;code&gt;year, month, date, hour, minute, second&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A string in format &lt;code&gt;YYYYMMDDHHmmss&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Or whatever similar, as long as it complies with standard i/o rules.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Implement the function or the full program &lt;strong&gt;from vanilla&lt;/strong&gt;.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;So no built-ins nor libraries that has the fuctionality (see next section).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Implement leap year, too; but don't leap second (although leap second is not supported).&lt;/li&gt;&#xA;&lt;li&gt;You just need to support up to 2038/01/19 (so input range shall be 0 to 2147483647 (inclusive)).&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply.&lt;/li&gt;&#xA;&lt;li&gt;Standard I/O rules apply.&lt;/li&gt;&#xA;&lt;li&gt;Input and output format should be consistent and not ambiguous.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;So, for example, if output is a string like &lt;code&gt;1970121000&lt;/code&gt;, it's unqualified, as it can be recognized as &lt;code&gt;1970/01/21 00:00:00&lt;/code&gt;, &lt;code&gt;1970/12/01 00:00:00&lt;/code&gt;, or &lt;code&gt;1970/01/02 10:00:00&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Shortest code wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples of bad answers&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/178765/100411&quot;&gt;This Java answer&lt;/a&gt; uses &lt;code&gt;java.util.Date&lt;/code&gt; and &lt;code&gt;java.text.SimpleDateFormat&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/178676/100411&quot;&gt;This Japt answer&lt;/a&gt; has &lt;code&gt;ÐU s3&lt;/code&gt;; it converts to date object, and then ISO string.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/178684/100411&quot;&gt;This ksh answer&lt;/a&gt; has... wtf?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;0&#xA;-&amp;gt; 1970/01/01 00:00:00&#xA;999999999&#xA;-&amp;gt; 2001/09/09 01:46:39&#xA;1145141919&#xA;-&amp;gt; 2006/04/15 22:58:39&#xA;1330500000&#xA;-&amp;gt; 2012/02/29 07:20:00&#xA;1633773293&#xA;-&amp;gt; 2021/10/09 09:54:53&#xA;2147483647&#xA;-&amp;gt; 2038/01/19 03:14:07&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Hint&lt;/h1&gt;&#xA;&lt;p&gt;Here are implementations:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/pitex/minix-server/blob/master/fsrc/lib/ansi/gmtime.c#L10&quot; rel=&quot;nofollow noreferrer&quot;&gt;minix-server/gmtime.c&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://qiita.com/richmikan@github/items/14e32d099bd9bcc7f8e8#unix%E6%99%82%E9%96%93--%E6%97%A5%E5%B8%B8%E3%81%AE%E6%99%82%E9%96%93&quot; rel=&quot;nofollow noreferrer&quot;&gt;シェルスクリプトで時間計算を一人前にこなす&lt;/a&gt;: AWK implementation.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/##hVRNb9pAEL3zK6YEIhCm3i8bbJf0QnOoRA9tL1YSIQcW2Qm2I9skRVV@ezrjDyCOkq6stWfn7cybt7MOnu5ffvzsi@uXvx2AM1gF29VuGxQawnSXGRBHya7QBgTJGnK9SpN1XhnrYJ9DHiUrDdyZMJObHAPkMIMehz7YzAMo0IqSYtDjps2GHvpjXMHllh@Kxh82fqHIpCTLTZbGS/2QrsIjXCiEtwjvdZBRiuDPkhb1ekkruIf4YbbTcQa/U8h0rONbnYF@1Nm@qihNgHGTcaCsDYM0WX4PEp4XJ1yuKOoNRsfQZ1CEGr6VFJ/CiOYgPzJbY9SVxmB@XUCrLFPa1mehhDUcUdARp9KjDQx8uGiXMwQ6JxwRxnqfXGvXjVdt2qQZDO5mLa8Hd198nEajQ3SKP5ohtq8@zdjwKzJ00eCM1aZNpjqYlotLXrP3fV53I06aRTX0uXq9PTKfAOQtGXuePx433EiYdl9cfKSFf3Ms6zbTwX2V/LnM0OqhOE2KsO7vgo4sf9hGxaArOTDASZ7Or8yuUVPYLMsgQ48iJ2kB@S7TZR2X@jbbBdhpe10cWquGXwnSZeDXeoupi9@N3MIhq1EbfcKhGuZNC5woMf5QCBhB2VylqosZ98CDxfHYSdo59txrZosT/eYwnr1x13qC3ub6P0pvoiTYbvf4/ZDhTdgMun2m1mafiWoCmtzDdJ10Dd9YGHMjNGIjxzv/XP6tvvDz8x6bdR9z6PbE5a@efGGd8UX1J6ruL2Nu@XScZhBAMPI6@OA1d5XtSqfDubK44g5vELbJlMktEMK1piVCSmYxGhWCC5MJU2CMiSvKJNyWcjKRwpEVQuDvkJVZHNdSriU7gquJmkpbTSqEnBJRjgjpcuWyyT8&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;AWK – Try It Online&quot;&gt;Try it online!&lt;/a&gt; I translated comments.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Related problems&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/178662/unix-timestamp-to-datetime-string&quot;&gt;Unix timestamp to datetime string&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/36697/shortest-script-that-gives-the-time-passed-since-a-unix-timestamp&quot;&gt;Shortest script that gives the time passed since a Unix timestamp&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I once posted &lt;a href=&quot;https://codegolf.stackexchange.com/q/237380/100411&quot;&gt;here&lt;/a&gt; but it's closed.&lt;/li&gt;&#xA;&lt;li&gt;TODO. define what builtins are.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The most problem is that that KSH answer has a function that directly converts to the objective string; should I prohibit it?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Maybe I wanted to say no date objects allowed.&lt;/li&gt;&#xA;&lt;li&gt;Is what is so-called date object ambiguos?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user100411" LastEditorDisplayName="user100411" LastEditDate="2021-11-19T07:15:22.637" LastActivityDate="2021-11-19T07:15:22.637" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23943" PostTypeId="2" ParentId="2140" CreationDate="2021-10-10T12:17:25.617" Score="1" Body="&lt;h1&gt;&lt;strong&gt;Newton Polynomial&lt;/strong&gt;&lt;/h1&gt;&#xA;&lt;p&gt;A newton polynomial is a interpolation polynomial where the coefficients are found using the Newton's divided differences method. The relevant &lt;a href=&quot;https://en.wikipedia.org/wiki/Newton_polynomial&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wiki&lt;/a&gt; is here.&lt;/p&gt;&#xA;&lt;p&gt;Your task has two parts:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Given a set of inputs and outputs to find and display the polynomial that describes the series. The input can be as two lists or a dictionary like structure. e.g. &lt;span class=&quot;math-container&quot;&gt;$$ [x_1:y_2,\;x_2:y_2,\;...\;, x_{n-1}:y_{n-1},\; x_n:y_n] $$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Given any real number, return the interpolated value.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Azf6v.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Azf6v.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&#xA;&lt;p&gt;Presentation of the polynomial must be in a format that is recognisable.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;As ever this is code golf: so shortest answer wins.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="55243" LastActivityDate="2021-10-10T12:17:25.617" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="23946" PostTypeId="2" ParentId="2140" CreationDate="2021-10-13T13:25:55.227" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/236378/pythagorean-triples-given-the-hypotenuse&quot;&gt;Pythagorean triples given the hypotenuse.&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="18535" LastEditorUserId="18535" LastEditDate="2021-10-18T06:16:05.167" LastActivityDate="2021-10-18T06:16:05.167" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23947" PostTypeId="2" ParentId="2140" CreationDate="2021-10-13T20:25:32.420" Score="2" Body="&lt;h1&gt;Unicode Calendar Generator&lt;/h1&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;Your program will receive a valid date in the format relevant to your language (date object or three int for year, month, day or whatever) and should returns a fancy unicode calendar as such (note that the title is right/left aligned):&lt;/p&gt;&#xA;&lt;p&gt;Given Y-M-D as 2021-10-13&lt;br /&gt;&#xA;Then&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;╔════════════════════╗&#xA;║ October ░░░░░ 2021 ║&#xA;╟──┬──┬──┬──┬──┬──┬──╢&#xA;║░░│░░│░░│░░│░░│01│02║&#xA;╟──┼──┼──┼──┼──┼──┼──╢&#xA;║03│04│05│06│07│08│09║&#xA;╟──┼──┼──╔══╗──┼──┼──╢&#xA;║10│11│12║13║14│15│16║&#xA;╟──┼──┼──╚══╝──┼──┼──╢&#xA;║17│18│19│20│21│22│23║&#xA;╟──┼──┼──┼──┼──┼──┼──╢&#xA;║24│25│26│27│28│29│30║&#xA;╟──┼──┼──┼──┼──┼──┼──╢&#xA;║31│░░│░░│░░│░░│░░│░░║&#xA;╚══╧══╧══╧══╧══╧══╧══╝&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Given Y-M-D as 2021-11-13&lt;br /&gt;&#xA;Then&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;╔════════════════════╗&#xA;║ November ░░░░ 2021 ║&#xA;╟──┬──┬──┬──┬──┬──┬──╢&#xA;║░░│01│02│03│04│05│06║&#xA;╟──┼──┼──┼──┼──┼──╔══╗&#xA;║07│08│09│10│11│12║13║&#xA;╟──┼──┼──┼──┼──┼──╚══╝&#xA;║14│15│16│17│18│19│20║&#xA;╟──┼──┼──┼──┼──┼──┼──╢&#xA;║21│22│23│24│25│26│27║&#xA;╟──┼──┼──┼──┼──┼──┼──╢&#xA;║28│29│30│░░│░░│░░│░░║&#xA;╚══╧══╧══╧══╧══╧══╧══╝&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Given Y-M-D as 2021-06-15&lt;br /&gt;&#xA;Then&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;╔════════════════════╗&#xA;║ June ░░░░░░░░ 2021 ║&#xA;╟──┬──┬──┬──┬──┬──┬──╢&#xA;║░░│░░│01│02│03│04│05║&#xA;╟──┼──┼──┼──┼──┼──┼──╢&#xA;║06│07│08│09│10│11│12║&#xA;╟──┼──╔══╗──┼──┼──┼──╢&#xA;║13│14║15║16│17│18│19║&#xA;╟──┼──╚══╝──┼──┼──┼──╢&#xA;║20│21│22│23│24│25│26║&#xA;╟──┼──┼──┼──┼──┼──┼──╢&#xA;║27│28│29│30│░░│░░│░░║&#xA;╚══╧══╧══╧══╧══╧══╧══╝&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so you the shortest bytes of each language will be the winner.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://qwerty.dev/calendar-generator/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Inspired by qwerty.dev&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="15214" LastEditorUserId="15214" LastEditDate="2021-10-15T07:30:27.117" LastActivityDate="2021-10-15T07:30:27.117" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="23948" PostTypeId="2" ParentId="2140" CreationDate="2021-10-14T14:59:55.137" Score="2" Body="&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2021-10-15T12:53:39.853" LastActivityDate="2021-10-15T12:53:39.853" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23949" PostTypeId="2" ParentId="2140" CreationDate="2021-10-14T17:26:58.210" Score="0" Body="&lt;h1&gt;Pattern in Prime&lt;/h1&gt;&#xA;&lt;p&gt;Given a positive integer less than 100 with no preceding zeros we have to find all 12 digit primes that contains the maximum number of time the given pattern.&lt;/p&gt;&#xA;&lt;p&gt;Note: Pattern's occurance can overlap. For example 11 occur 6 times in 1111111&lt;/p&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;p&gt;pattern = 1 , count = 13&#xA;the maximum occurance is in 111111110111, eleven, and those 12 digit primes are&#xA;{101111111111,111011111111,111111011111,111111110111,111111111101,111111111511,111111111611,111111211111,111113111111,111211111111,111511111111,116111111111,311111111111}&lt;/p&gt;&#xA;&lt;p&gt;pattern = 22  , count = 1&#xA;{522222222229}&lt;/p&gt;&#xA;&lt;p&gt;pattern = 69, count = 162&lt;/p&gt;&#xA;&lt;p&gt;pattern = 37, count = 151&lt;/p&gt;&#xA;&lt;p&gt;Output format: first line should be count of such primes, and then print the primes in sorted order&lt;/p&gt;&#xA;&lt;p&gt;If possible while answering please write a short explanation of what you did. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes per language wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/prime&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;prime&amp;#39;&quot; rel=&quot;tag&quot;&gt;prime&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pattern-matching&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pattern-matching&amp;#39;&quot; rel=&quot;tag&quot;&gt;pattern-matching&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="103688" LastActivityDate="2021-10-14T17:26:58.210" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23950" PostTypeId="2" ParentId="2140" CreationDate="2021-10-14T20:07:31.930" Score="0" Body="&lt;h1&gt;Best Rotation&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&#xA;If we rotate a raster image by some angle that is not a multiple of &lt;span class=&quot;math-container&quot;&gt;\$90°\$&lt;/span&gt;, we will have to use some kind of interpolation. Depending on what kind of interpolation method we use, we get a better or a worse quality. This is especially apparent if we repeat the rotation multiple times. In the following image we se the original on the top left, and then the result of different interpolation methods when used to rotate the original &lt;span class=&quot;math-container&quot;&gt;\$360\$&lt;/span&gt; times by &lt;span class=&quot;math-container&quot;&gt;\$1°\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.youtube.com/watch?v=CcCw1ggftuQ&amp;amp;t=8s&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/6a0QL.png&quot; alt=&quot;salvator mundi&quot; /&gt;&lt;/a&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$\renewcommand\phi\varphi\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Given some angle &lt;span class=&quot;math-container&quot;&gt;\$\phi\$&lt;/span&gt; Your task is to find a method to find a (deterministic) function &lt;span class=&quot;math-container&quot;&gt;\$f_\phi\$&lt;/span&gt; that takes some image &lt;span class=&quot;math-container&quot;&gt;\$I\$&lt;/span&gt; and rotates it by &lt;span class=&quot;math-container&quot;&gt;\$\phi\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Scoring (not solved yet)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;META&lt;/strong&gt; this is the issue. Ideally we'd like to have some &lt;em&gt;objective&lt;/em&gt; criterion. But so far I have not managed to find one that cannot be gamed:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;If we just let the participants rotate an image by some angle &lt;span class=&quot;math-container&quot;&gt;\$\phi\$&lt;/span&gt; how can we then compare it to the &amp;quot;exact&amp;quot; solution? Maybe their method is better than the best standard method, even if they have to apply it repeatedly. So it seems we can only truly check against a total rotation that is a multiple of &lt;span class=&quot;math-container&quot;&gt;\$90°\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Let's say we say we use an angle of &lt;span class=&quot;math-container&quot;&gt;\$\phi = 2\pi/n\$&lt;/span&gt; and let them apply their &amp;quot;rotation&amp;quot; &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; times to measure e.g. the &lt;span class=&quot;math-container&quot;&gt;\$l^2\$&lt;/span&gt;-error &lt;span class=&quot;math-container&quot;&gt;\$E = \Vert I - f_\phi(\ldots f_\phi(I)\ldots)\Vert_2\$&lt;/span&gt; . This means they could just use &lt;span class=&quot;math-container&quot;&gt;\$f_\phi = id\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If we instead use a total rotation of e.g. &lt;span class=&quot;math-container&quot;&gt;\$\pi/2\$&lt;/span&gt; (that is &lt;span class=&quot;math-container&quot;&gt;\$\phi = \frac{\pi}{2n}\$&lt;/span&gt;, with &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; rotations). Then the participants could just use some permutation of pixels that just happens to rotate the image after &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; rotations exactly (or maybe exactly except for some pixels).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;So does anyone have another suggestion of how to objectively measure it without introducing any hand-wavey rules?&lt;/p&gt;&#xA;" OwnerUserId="24877" LastActivityDate="2021-10-14T20:07:31.930" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23953" PostTypeId="2" ParentId="2140" CreationDate="2021-10-15T17:06:49.067" Score="1" Body="&lt;h1&gt;Wave square&lt;/h1&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Given an integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; with the constraints &lt;span class=&quot;math-container&quot;&gt;\$0 &amp;lt; n \leq 9\$&lt;/span&gt;, output the corresponding square, that for each row shifts the sequence from &lt;span class=&quot;math-container&quot;&gt;\$1\to n\$&lt;/span&gt; by one, overflowing when needed.&lt;/p&gt;&#xA;&lt;h2&gt;I/O&lt;/h2&gt;&#xA;&lt;p&gt;Input is an integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$ 0 &amp;lt; n \leq 9\$&lt;/span&gt;. Output can be as a returned String, matrix, array or to &lt;code&gt;STDOUT&lt;/code&gt;. You can write a full program or a function.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;5:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;12345&#xA;23451&#xA;34512&#xA;45123&#xA;51234&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;2:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;12&#xA;21&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;1:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;9:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;123456789&#xA;234567891&#xA;345678912&#xA;456789123&#xA;567891234&#xA;678912345&#xA;789123456&#xA;891234567&#xA;912345678&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;meta&lt;/h2&gt;&#xA;&lt;p&gt;Thoughts on extending the challenge to allow for inputs bigger than 9, which would then just be taken mod 10?&lt;/p&gt;&#xA;" OwnerUserId="106557" LastActivityDate="2021-10-15T17:06:49.067" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23956" PostTypeId="2" ParentId="2140" CreationDate="2021-10-16T22:46:42.397" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/236406/is-this-scrabble-board-valid&quot;&gt;Is This Scrabble Board Valid?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="67809" LastEditorUserId="67809" LastEditDate="2021-10-18T18:40:18.443" LastActivityDate="2021-10-18T18:40:18.443" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23957" PostTypeId="2" ParentId="2140" CreationDate="2021-10-17T18:27:53.457" Score="4" Body="&lt;h2&gt;Play RPS with 3 bits of memory&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-memory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-memory&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-memory&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;This is a rough draft for now, the specifics, presentation and title will probably be adjusted&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this game you will be building bots to play rock paper scissors against each other.  Of course rock paper scissors is not a very interesting game, just pick one of the three randomly. Can't get better than that?&lt;/p&gt;&#xA;&lt;p&gt;The first thing here is that, we will play a slight variation on the game which introduces a small amount of strategy.&lt;/p&gt;&#xA;&lt;p&gt;But more importantly in this version we will be designing &lt;em&gt;very&lt;/em&gt; simple bots.  Your bot will not be able to pick things randomly, nor will it be able to simulate complex strategies, because your bots will have 3 bits of working memory.&lt;/p&gt;&#xA;&lt;h2&gt;The game&lt;/h2&gt;&#xA;&lt;p&gt;Before we get into exactly how the bots will be made and what exactly it means to have only 3 bits of memory lets cover the game.&lt;/p&gt;&#xA;&lt;p&gt;For each pair of bots we will play 48 rounds of RPS.  In each round both bots will select a choice of Rock, Paper or Scissors.  Rock beats scissors, paper beats rock and Scissors beats paper, if the two chose the same move they tie.&lt;/p&gt;&#xA;&lt;p&gt;When you win you will receive points based on your play.  If you win with scissors you get 1 point, if you win with paper you get 3 points, and if you win with rock you get 6 points.  If you tie or lose you get 0 points.&lt;/p&gt;&#xA;&lt;p&gt;Each bot will play every other bot and the bots will be scored on the number of points gained in total.&lt;/p&gt;&#xA;&lt;h2&gt;The bots&lt;/h2&gt;&#xA;&lt;p&gt;Your bot will have 3 bits of working memory, that means at any given time it will have stored a number between 0 and 7.  To decide what to play it will know two things&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;What it has in memory&lt;/li&gt;&#xA;&lt;li&gt;The last move it's opponent made&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Given those it should spit out&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;What move it wants to make&lt;/li&gt;&#xA;&lt;li&gt;3-bits to write into memory&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;This is so simple you don't actually need to write &amp;quot;code&amp;quot; to represent your bot. Your bot is really just a &lt;span class=&quot;math-container&quot;&gt;\$8\times 3\$&lt;/span&gt; lookup table, plus a single move which it will make as it's first move. (We can assume that the starting memory is &lt;code&gt;0&lt;/code&gt; without loss of generality)&lt;/p&gt;&#xA;&lt;p&gt;And in fact you will submit your bots in this format as it makes it easy to verify your bot works and doesn't cheat.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&lt;p&gt;I like this challenge because it is&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Completely deterministic who wins, to the point where you can, for small bot pool work out with pen and paper the scores.&lt;/li&gt;&#xA;&lt;li&gt;It is basically language agnostic.  No need to bother with JS.&lt;/li&gt;&#xA;&lt;li&gt;There's basically no way to cheat.  It's going to be really hard to exploit a vulnerability in the handler when you can't run arbitrary code.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;I am a little concerned though that there might not be a whole lot to do?  I'm not sure how much better one bot really can be than others.  Obviously you can always take 1 bot and design a bot which plays perfectly against it.  But I'm not totally sure how much a carefully arranged bot is going to do better than ones that are just a pile of random connections.&lt;/p&gt;&#xA;&lt;p&gt;Turning the memory size up could improve this but the larger you make it the more complex each bot gets, and I think the fun is really in being able to hand tune your bot.&lt;/p&gt;&#xA;&lt;p&gt;However I don't know what I can do to find out other than just post this.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2021-10-26T08:47:51.223" LastActivityDate="2021-10-26T08:47:51.223" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="23958" PostTypeId="2" ParentId="2140" CreationDate="2021-10-17T19:23:57.783" Score="0" Body="&lt;p&gt;&lt;strong&gt;Integer points on Hyperspheres&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given two non-negative integers &lt;span class=&quot;math-container&quot;&gt;\$r\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$d\$&lt;/span&gt;, write a program that will output the number of integer points that lie on all hyperspheres of dimension &lt;span class=&quot;math-container&quot;&gt;\$d\$&lt;/span&gt; or lower with radius &lt;span class=&quot;math-container&quot;&gt;\$r\$&lt;/span&gt; or lower.&lt;/p&gt;&#xA;&lt;p&gt;For example, given &lt;span class=&quot;math-container&quot;&gt;\$r = 5, d = 2\$&lt;/span&gt;, the program would do something like this:&lt;/p&gt;&#xA;&lt;p&gt;The hypersphere of dimension 2 is a circle. The radius is 5. There are 12 integer points on this circle, as follows:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$(5,0),(4,3),(3,4),(0,5),(-3,4),(-4,3),(-5,0),(-4,-3),(-3,-4),(0,-5),(3,-4),(4,-3)$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;If the radius is 4, there are 4 integer points:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$(4,0),(0,4),(-4,0),(0,-4)$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;If the radius is 3, again it's 4 integer points. If the radius is 2, again 4. Radius 1 - again, 4. Radius 0 has only 1 integer point. If we add all these up it's 12 + 4 + 4 + 4 + 4 + 1 , or &lt;strong&gt;29&lt;/strong&gt; points total for the 2 dimensional hyperspheres with radius &lt;span class=&quot;math-container&quot;&gt;\$&amp;lt;=5\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Now if we take the dimension 1 hypersphere, it is interpreted as 2 points in  a one dimensional space, distance r from the origin. For example the 1 dimensional hypersphere with radius 5 has only two points, &lt;span class=&quot;math-container&quot;&gt;$$(5),(-5)$$&lt;/span&gt; and their coordinates are only single dimensional. So, the dimension 1 hypersphere with radius 5 has two integer points. The dimension 1 hypersphere with radius 4 also has 2 integer points, and so on. The total integer points on all 1 dimensional hypspheres with radius 0 to 5 is 2 + 2 + 2 + 2 + 2 + 1, or &lt;strong&gt;11&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The dimension 0 hypersphere is defined for this challenge to have 0 points.&lt;/p&gt;&#xA;&lt;p&gt;So the final output of a program with input &lt;span class=&quot;math-container&quot;&gt;\$r = 5, d = 2\$&lt;/span&gt; will be 29 + 11 + 0, or &lt;strong&gt;40&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;You may assume that r and d will be low enough so that the integer type of your language will be large enough so that it can represent the answer. In other words if your language has only 16 bit integers, then you can write a program that assumes r and d will be low enough so that the final answer is between 0 and 65535.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is Code Golf, lowest # of bytes wins&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="41273" LastActivityDate="2021-10-17T19:23:57.783" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23959" PostTypeId="2" ParentId="20722" CreationDate="2021-10-19T03:39:43.003" Score="2" Body="&lt;p&gt;Okie, because uh, replacement for my old name &lt;code&gt;edison1119&lt;/code&gt; because security sucks.&lt;/p&gt;&#xA;&lt;p&gt;My pfp is niko because niko is god.( from game &lt;em&gt;Oneshot&lt;/em&gt;)&lt;/p&gt;&#xA;&lt;p&gt;My pfp was my facebook pfp since I associated using it.&#xA;After I joined CGCC, I decided to change my pfp.&lt;/p&gt;&#xA;&lt;p&gt;chat pfp comes from cat girl/boy week.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;meow&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="101762" LastEditorUserId="101762" LastEditDate="2021-10-20T01:42:57.710" LastActivityDate="2021-10-20T01:42:57.710" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23963" PostTypeId="2" ParentId="2140" CreationDate="2021-10-21T22:06:23.817" Score="0" Body="&lt;h1&gt;Same String Regardless of Repetition&lt;/h1&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a full program that prints a string that has a length of at least 1. When the source code is repeated any amount of times, that string should still be outputted. For example, if my source code is &lt;code&gt;ABC&lt;/code&gt; and it prints &lt;code&gt;Hello, World!&lt;/code&gt;, then &lt;code&gt;ABCABC&lt;/code&gt; will still print &lt;code&gt;Hello, World!&lt;/code&gt; and &lt;code&gt;ABCABCABC&lt;/code&gt; will also print &lt;code&gt;Hello, World!&lt;/code&gt; and etc.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It has to be a full program that takes no input (or have an unused input if this is impossible) and prints the string to STDOUT.&lt;/li&gt;&#xA;&lt;li&gt;The program and the string have to be at least 1 byte long.&lt;/li&gt;&#xA;&lt;li&gt;The strings that are outputted with each repetition have to be exactly the same. Trailing or leading spaces make the strings different.&lt;/li&gt;&#xA;&lt;li&gt;There must be only one output.&lt;/li&gt;&#xA;&lt;li&gt;There is no code between repetitions.&lt;/li&gt;&#xA;&lt;li&gt;Comments in your code are not allowed.&lt;/li&gt;&#xA;&lt;li&gt;This is code-golf, so programs are scored in bytes, with less bytes being better.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="91262" LastActivityDate="2021-10-21T22:06:23.817" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23964" PostTypeId="2" ParentId="2140" CreationDate="2021-10-22T02:42:06.313" Score="-1" Body="&lt;h1&gt;Secretary Problem - Cops and Robbers&lt;/h1&gt;&#xA;&lt;h3&gt;Both threads&lt;/h3&gt;&#xA;&lt;p&gt;(Link to other thread)&lt;/p&gt;&#xA;&lt;p&gt;The Secretary Problem is a famous problem. In this challenge, it’s a little different:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You need a new secretary that asks for the least salary&lt;/li&gt;&#xA;&lt;li&gt;You have a lot of applicants that you can interview one at a time, but don’t know how many applicants there are&lt;/li&gt;&#xA;&lt;li&gt;Each applicant will tell you how much salary they want (they’ll want at least $1 salary, but may all want $5)&lt;/li&gt;&#xA;&lt;li&gt;Applicants do not ever request the same salary for some weird reason (not sure if they’re robots or eavesdroppers)&lt;/li&gt;&#xA;&lt;li&gt;After you interview an applicant, you must give an immediate &amp;quot;yes, I accept you&amp;quot; (truthy) or &amp;quot;no, go away&amp;quot; (falsey)&lt;/li&gt;&#xA;&lt;li&gt;You want the applicant that asks for the lowest salary, so you can stay rich&lt;/li&gt;&#xA;&lt;li&gt;No applicant ever requests more than 1 million dollars (for obvious reasons)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;sub&gt;In the maths world, it’s actually that you want the &lt;em&gt;highest leveled&lt;/em&gt; applicant, but I put it this way because who doesn’t want to stay rich&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Cops Thread&lt;/h3&gt;&#xA;&lt;p&gt;Your challenge is to write a program that takes two inputs: the previous applicants’ salaries, the current applicant’s salary, and outputs whether to accept the applicant (truthy) or deny him/her (falsey).&lt;/p&gt;&#xA;&lt;p&gt;The robbers will attempt to find a list of applicants (and the salaries they demand) that forces your program to accept a person with a high salary demand. You need to attempt to make your program only accept the applicant which asks for the LEAST salary (that way you can stay rich)&lt;/p&gt;&#xA;&lt;p&gt;The answer that (when answered against by a robbers thread - [link]) accepts the person with the least salary wins/gets accepted (i.e. the answer that accepts a $1, if that doesn’t exist, then the answer that accepts a $2, if THAT doesn’t exist ... and so on)&lt;/p&gt;&#xA;&lt;p&gt;If your answer does not accept any, (up to the last applicant) you automatically get&lt;/p&gt;&#xA;&lt;h3&gt;Robbers thread&lt;/h3&gt;&#xA;&lt;p&gt;Each answer in the cop’s thread is a program that takes two inputs: the previous applicants’ salaries, the current applicant’s salary, and outputs whether to accept the applicant (truthy) or deny him/her (falsey).&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to find a program in the cop’ thread (insert link here) and attempt to give it an input such that it accepts a person with a HIGH salary request. Answer that forces an algorithm to accept the highest amount of money gets accepted (i.e. the answer that forces a cop answer to accept a $1000000 salary applicant, if that doesn’t exist, the answer that forces a cop answer to accept a $999999 salary applicant, if THAT doesn’t exist ... and so on)&lt;/p&gt;&#xA;&lt;p&gt;Put a link cop answer you are attempting to make go broke in your answer.&lt;/p&gt;&#xA;&lt;p&gt;You must have at least 100 applicants (with at least one applicant that requests &amp;lt;$100)&lt;/p&gt;&#xA;&lt;h3&gt;Both threads (again)&lt;/h3&gt;&#xA;&lt;p&gt;To stop people getting free points, you cannot make a robbers answer for your own cop answer. 1 answer per thread (you can have both a robber answer and a cop answer as long as the robber answer is against a different cop answer)&lt;/p&gt;&#xA;&lt;h3&gt;Sandbox questions&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this too far-fetched?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/157876/&quot;&gt;&lt;s&gt;Somewhat shamelessly stolen&lt;/s&gt; Derived&lt;/a&gt; from &lt;a href=&quot;https://codegolf.stackexchange.com/q/75967&quot;&gt;this question&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-and-robbers&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="95204" LastEditorUserId="95204" LastEditDate="2021-10-27T05:26:59.923" LastActivityDate="2021-10-27T05:26:59.923" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23966" PostTypeId="1" CreationDate="2021-10-22T03:32:32.597" Score="2" ViewCount="31" Body="&lt;p&gt;When trying to edit the image description in &lt;a href=&quot;https://codegolf.stackexchange.com/q/901/66833&quot;&gt;this question&lt;/a&gt; to&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;diagram showing an inclined plane at angle &lt;span class=&quot;math-container&quot;&gt;\$α\$&lt;/span&gt; and an angry bird being fired at angle &lt;span class=&quot;math-container&quot;&gt;\$β\$&lt;/span&gt; at speed &lt;span class=&quot;math-container&quot;&gt;\$u\$&lt;/span&gt;,&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;sup&gt;(raw text is &lt;code&gt;diagram showing an inclined plane at angle \$α\$ and an angry bird being fired at angle \$β\$ at speed \$u\$&lt;/code&gt;)&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;the edit preview shows&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/nOkR3.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/nOkR3.png&quot; alt=&quot;edit preview showing a normal post&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;whereas if I save the edit, the post instead looks like &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/901/8&quot;&gt;this&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/LBLYv.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/LBLYv.png&quot; alt=&quot;image showing the text from the first Mathjax symbol being shown next to the image in the post&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Note the bit of the image description immediately before the first &lt;code&gt;\$&lt;/code&gt; is shown next to the image (and that the first bit of Mathjax, &lt;code&gt;\$\alpha\$&lt;/code&gt;, is rendered).&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-10-22T03:32:32.597" Title="Mathjax and image descriptions interact inconsistently between the edit preview and actual post" Tags="|bug|latex|" AnswerCount="0" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23970" PostTypeId="2" ParentId="2140" CreationDate="2021-10-24T08:20:32.047" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/236747/107561&quot;&gt;Pretty print a grid of polyominoes&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="107561" LastEditorUserId="107561" LastEditDate="2021-10-29T23:18:41.870" LastActivityDate="2021-10-29T23:18:41.870" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23971" PostTypeId="2" ParentId="8047" CreationDate="2021-10-25T01:18:24.070" Score="11" Body="&lt;h1&gt;Think twice if you're writing a challenge around an algorithm you found on the Internet&lt;/h1&gt;&#xA;&lt;p&gt;Simply put, it will never work as you expect, (though it could work as &amp;quot;a challenge&amp;quot;) unless you pick &lt;em&gt;your algorithm and the problem&lt;/em&gt; very carefully.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If you make it a plain &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; without any restrictions, answers are free to choose brute force (which works universally since we don't require &amp;quot;it should run in practice&amp;quot; kind of thing, and is guaranteed to be golfier in all languages).&lt;/li&gt;&#xA;&lt;li&gt;If you make it a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-time&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-time&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-time&lt;/a&gt;, a heuristic search might suffice, and you're possibly penalizing slow languages from faster ones. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt; might work, but it wouldn't if your algorithm's time complexity (or the problem's) is not very well-defined in terms of the input (could be only empirically fast, or depend on additional parameters like &lt;a href=&quot;https://en.wikipedia.org/wiki/Lenstra%E2%80%93Lenstra%E2%80%93Lov%C3%A1sz_lattice_basis_reduction_algorithm&quot; rel=&quot;nofollow noreferrer&quot;&gt;LLL&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;li&gt;If you make it a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;, you need to choose your problem where the intended algorithm would work well, &lt;em&gt;and&lt;/em&gt; study additional algorithms that might also work (comparable complexity or empirical performance). In addition, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt; might not work for the same reasons as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="56656" LastEditDate="2021-10-26T11:13:05.547" LastActivityDate="2021-10-26T11:13:05.547" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23973" PostTypeId="2" ParentId="2140" CreationDate="2021-10-25T11:25:15.007" Score="0" Body="&lt;h1&gt;Solve linear equations over the integers&lt;/h1&gt;&#xA;&lt;p&gt;All variables in this question are integer valued.&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;4 integers w, x, y, z. They can be positive or negative and will be less than 1048576 in absolute value.&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;The general solution to the equation.&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$ aw+bx+cy+dz = 0 \$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The variables &lt;span class=&quot;math-container&quot;&gt;\$a, b, c, d\$&lt;/span&gt; must all be integer values.&lt;/p&gt;&#xA;&lt;h1&gt;Output format&lt;/h1&gt;&#xA;&lt;p&gt;Your output should consist of three tuples each with four parts, one for each of the values a, b, c, d. Let me explain by example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input: -118, 989, 918, -512&#xA;&#xA;Answer: b = 2 n_0 &#xA;        c = 9 n_0 + 256 n_1 + 81 a&#xA;        d = 20 n_0 + 459 n_1 + 145 a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Explanation:  &lt;code&gt;n_0&lt;/code&gt; and &lt;code&gt;n_1&lt;/code&gt; are integers that you can set to anything you like. The solution says: &lt;code&gt;a&lt;/code&gt; can also be set to any integer value, &lt;code&gt;b&lt;/code&gt; must be twice whatever you set &lt;code&gt;n_0&lt;/code&gt; to.&#xA;This means that &lt;code&gt;a&lt;/code&gt; can be set to any integer, &lt;code&gt;c&lt;/code&gt; can now be calculated in terms of three variables we have already set and so can &lt;code&gt;d&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The format of your output should be 3 tuples (#,#,#,#), (#,#,#,#), (#,#,#,#). We can assume three free integer variables n0, n1 and n2 and so  (a,b,c,d) = (#,#,#,#)n0 + (#,#,#,#)n1 + (#,#,#,#)n2.  In the example above the output would therefore be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Output: (0, 2, 9, 20), (0, 0, 256, 459), (1, 0, 81, 145)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;p&gt;Example one:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; Input: -6, 3, 7, 8&#xA;&#xA; Answer:  c = 2a + 3b + 8n&#xA;          d = -a - 3b - 7n &#xA;          n is any integer&#xA;&#xA;Output: (1, 0, 2, -1), (0, 1, 3, -3), (0, 0, 8, -7)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Example two:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input: -116, 60, 897, 578&#xA;&#xA;Answer: c = 578 n + 158 a + 576 b&#xA;        d = -897 n - 245 a - 894 b &#xA;        n is any integer&#xA;&#xA;Output: (1, 0, 158, -245), (0, 1, 576, -894), (0, 0, 578, -897)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Example three:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input: 159, -736, -845, -96&#xA;&#xA;Output: (1, 0, 27, -236), (0, 1, 64, -571), (0, 0, 96, -845)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Discussion&lt;/h1&gt;&#xA;&lt;p&gt;To understand this challenge further it is worth looking at this possible general solution which does &lt;strong&gt;not&lt;/strong&gt; work &lt;code&gt;[(z, 0, 0, -w), (0, z, 0, -x), (0, 0, z, -y)]&lt;/code&gt;.  The problem with this is that there are solutions to the problem instances above which are not the sum of any integer multiples of those tuples. For example: take input -6, 3, 7, 8 from Example 1.  The proposed solution would give the tuples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(8, 0, 0, 6), (0, 8, 0, -3), (0, 0, 8, -7)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Why doesn't this work?&lt;/p&gt;&#xA;&lt;p&gt;There is a solution for this instance with a = 1, b = 1, c = 13, d = -11 because &lt;code&gt;-6+3+7*13-11*8 = 0&lt;/code&gt;. However there are no integers n_0, n_1, n_2 to make &lt;code&gt;n_0 * (8, 0, 0, 6) + n_1 * (0, 8, 0, -3) + n_2 * (0, 0, 8, -7) = (1, 1, 13, -11)&lt;/code&gt; .&lt;/p&gt;&#xA;" OwnerDisplayName="user7467" LastEditorDisplayName="user7467" LastEditDate="2021-10-29T15:06:51.063" LastActivityDate="2021-10-29T15:06:51.063" CommentCount="17" ContentLicense="CC BY-SA 4.0" />
  <row Id="23974" PostTypeId="2" ParentId="2140" CreationDate="2021-10-25T15:32:34.913" Score="0" Body="&lt;p&gt;In 1960 &lt;a href=&quot;https://en.wikipedia.org/wiki/Andrey_Kolmogorov&quot; rel=&quot;nofollow noreferrer&quot;&gt;Andrey Kolmogorov&lt;/a&gt; conjectured that any algorithm to multiply two integers would require &lt;span class=&quot;math-container&quot;&gt;\$\Omega(n^2)\$&lt;/span&gt;&lt;sup&gt;*&lt;/sup&gt; steps.&lt;/p&gt;&#xA;&lt;p&gt;Within a week of presenting this conjecture it was proven false by graduate student Anatoly Karatsuba.  &lt;a href=&quot;https://en.wikipedia.org/wiki/Karatsuba_algorithm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Karatsuba's algorithm&lt;/a&gt; is an algorithm to multiply two numbers which takes in the worst case &lt;span class=&quot;math-container&quot;&gt;\$O(n^{\log_2 3})\$&lt;/span&gt; time.&lt;/p&gt;&#xA;&lt;p&gt;Your task will be to implement this algorithm.  You will receive as input two binary strings.  These can be lists of ints, arrays of bools etc.&lt;/p&gt;&#xA;&lt;p&gt;You should then output the binary representation of their product in the same format.&lt;/p&gt;&#xA;&lt;p&gt;It's hard to say in precise terms what it means to implement a particular algorithm.  So here we will require only that your algorithm have asymptotic time complexity of &lt;span class=&quot;math-container&quot;&gt;\$O(n^{\log_2 3})\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\Omega(n^{\log_2 3})\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is the total number of bits in the input.  Which is to say that it is neither better nor worse than Karatsuba's algorithm up to a constant factor.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so answers will be scored in bytes with lower bytes being the goal.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sup&gt;* In this challenge we will use &lt;span class=&quot;math-container&quot;&gt;\$f\in \Omega(g)\$&lt;/span&gt; to mean that &lt;span class=&quot;math-container&quot;&gt;\$\displaystyle\limsup_{x\to \infty}\dfrac{f(x)}{g(x)}\$&lt;/span&gt; does not converge to &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;.  Also stated as &lt;span class=&quot;math-container&quot;&gt;\$f \in \Omega(g) \iff \exists k.\forall x.\exists x'.f(x')\geq k\cdot g(x')\$&lt;/span&gt;.  This is the Hardy-Littlewood definition.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2021-10-25T15:32:34.913" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="23975" PostTypeId="2" ParentId="2140" CreationDate="2021-10-25T15:36:46.903" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/237016/make-a-scrabble-world-finder&quot;&gt;posted here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="107299" LastEditorUserId="107299" LastEditDate="2021-11-09T00:00:34.210" LastActivityDate="2021-11-09T00:00:34.210" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23977" PostTypeId="2" ParentId="2140" CreationDate="2021-10-26T14:33:45.643" Score="-1" Body="&lt;h1&gt;Randombility of number&lt;/h1&gt;&#xA;&lt;p&gt;The aim of golf is to calculate score of how random 10 inputs given by users were. The Criteria is given below.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Points             Rule&lt;/li&gt;&#xA;&lt;li&gt;5+(1.1)^n If inputted numbers are not in Arithmetic OR Geometric progression for n cnsecutive terms&lt;/li&gt;&#xA;&lt;li&gt;5+(1.1)^n if inputted numbers are not strictly increasing or decreasing for n&amp;gt;2&lt;/li&gt;&#xA;&lt;li&gt;5*n   if number is prime number &amp;gt; 100 here n is number of such terms&lt;/li&gt;&#xA;&lt;li&gt;-5-(1.1)^n    if number is substring of $\pi$$ (3.1415926535897932384626433) for n&amp;gt;2&lt;/li&gt;&#xA;&lt;li&gt;5 if difference between largest and smallest input is greater than 1000&lt;/li&gt;&#xA;&lt;li&gt;-5*n  for n repeated inputs&lt;/li&gt;&#xA;&lt;li&gt;-5 + ln(log(p))   if number is square or cube of any number beetween -100 and 100 here p is number&lt;/li&gt;&#xA;&lt;li&gt;-5    if any three input ressemble any valid date (dd/mm/yyyy or mm/dd/yyyy) time(hh/mm or mm/hh) format&#xA;&lt;ul&gt;&#xA;&lt;li&gt;-Additional&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;(1.5)^n   if time interval between two inputs is less than 1.5 seconds&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Improvements required Score system.&lt;/p&gt;&#xA;" OwnerUserId="104693" LastEditorUserId="104693" LastEditDate="2021-10-26T17:18:04.783" LastActivityDate="2021-10-26T17:18:04.783" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23978" PostTypeId="1" AcceptedAnswerId="23979" CreationDate="2021-10-26T17:10:43.470" Score="0" ViewCount="98" Body="&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/1GmHM.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/1GmHM.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&#xA;One of my answer was removed by a mod but I got reputation for this! but Why?Is it abug?&lt;/p&gt;&#xA;" OwnerUserId="104693" LastEditorUserId="68942" LastEditDate="2021-10-26T19:38:21.710" LastActivityDate="2021-10-26T19:38:21.710" Title="Why I'm getting reputation for this?" Tags="|bug|status-bydesign|reputation|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23979" PostTypeId="2" ParentId="23978" CreationDate="2021-10-26T17:12:12.710" Score="2" Body="&lt;p&gt;You answer was downvoted twice, once on October 23rd, once today. Your net reputation has not changed as a result of that post.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-10-26T17:12:12.710" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23980" PostTypeId="2" ParentId="23978" CreationDate="2021-10-26T17:14:39.743" Score="1" Body="&lt;h1&gt;There is no bug&lt;/h1&gt;&#xA;&lt;p&gt;You can never be sure with downvotes, even mods have somewhat limited information on this.  But to get +4 rep like that you would have to have a post with two downvotes (and no upvotes) deleted.  The system would give you back the 4 reputation taken by downvotes.  Moderators deleting a post carries no penalties other than the potential change in reputation.&lt;/p&gt;&#xA;&lt;p&gt;You indeed do have a post that meets those criteria, so I would say that this is what happened.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2021-10-26T17:14:39.743" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23981" PostTypeId="1" AcceptedAnswerId="23982" CreationDate="2021-10-26T18:33:03.740" Score="0" ViewCount="48" Body="&lt;p&gt;I'm looking at an &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/721/104693&quot;&gt;older draft&lt;/a&gt; in the Sandbox that appears to be abandoned by the original poster. I'd like to bring attention to it, and potentially &amp;quot;re-propose&amp;quot; it as a draft that I'd then post once ready. What's the best way to go about this?&lt;/p&gt;&#xA;" OwnerUserId="104693" LastEditorUserId="66833" LastEditDate="2021-10-26T19:35:38.460" LastActivityDate="2021-10-26T19:35:38.460" Title="How to &quot;re-propose&quot; someone's abandoned Sandbox draft?" Tags="|support|sandbox|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="23982" PostTypeId="2" ParentId="23981" CreationDate="2021-10-26T18:33:33.000" Score="1" Body="&lt;p&gt;You can just ask in our main chat room, &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;. You only need 20 reputation anywhere on the network to chat, which you have. We are working on a better system to review older sandbox posts.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-10-26T18:33:33.000" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="23984" PostTypeId="2" ParentId="11924" CreationDate="2021-10-27T15:08:03.800" Score="1" Body="&lt;h2&gt;&lt;a href=&quot;https://esolangs.org/wiki/Underload&quot; rel=&quot;nofollow noreferrer&quot;&gt;Underload&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Underload is a stack-based tarpit esolang, which can be a good choice for some problems (especially &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt;s) and a horrible choice for most of the others (but even horrible choices can be fun to golf in!). If you're planning to use it at CGCC, here's what you need to know:&lt;/p&gt;&#xA;&lt;h3&gt;The basics&lt;/h3&gt;&#xA;&lt;p&gt;CGCC questions normally require you to submit either a full program or a function.&lt;/p&gt;&#xA;&lt;p&gt;A full program in Underload is just a string of code that runs, starting from an empty stack; it has no way to take input. As a consequence, this method of writing a submission is only really usable for questions that don't require your program to take input. It tends to be shortest when you can use it, though, because there's absolutely no boilerplate. Here's a Hello, World! full program:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(Hello, World)S&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The rest of the time, your submission will have to be a function. A function can take I/O via any of the legal I/O methods. In the case of Underload, therefore, you need to take input from the stack; and can produce output either by pushing it onto the stack, or by outputting it with the &lt;code&gt;S&lt;/code&gt; command. (You need to choose one or the other of these mechanisms to be your program's &amp;quot;official&amp;quot; output mechanism the other will be ignored.)&lt;/p&gt;&#xA;&lt;p&gt;Additionally, under CGCC definitions, a function has to be reusable, i.e. it has to be possible to call it multiple times. As such, you aren't allowed to submit just the function body; you have to enclose the function in parentheses (so that it can be called multiple times by copying the function before calling it), and remember to include them in your byte count. Here's a Hello, World! function:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;((Hello, World!))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;To test your functions on Try It Online!, write them in the &amp;quot;code&amp;quot; box, and put the arguments in the &amp;quot;footer&amp;quot; box, in the form &lt;code&gt;(arg1)~(arg2)~^&lt;/code&gt;, i.e. you swap the arguments below the function and then call the function. If the function produces output on its stack, you'll need to add an &lt;code&gt;S&lt;/code&gt; to the footer to print it.&lt;/p&gt;&#xA;&lt;h3&gt;Numeric I/O&lt;/h3&gt;&#xA;&lt;p&gt;The normal definition of numbers in Underload is &amp;quot;Church numerals&amp;quot;, which implement nonnegative integers like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0  !()&#xA;1&#xA;2  :*&#xA;3  ::**&#xA;4  :::***&#xA;5  ::::****&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and so on. (Equivalent strings, like &lt;code&gt;:*:*&lt;/code&gt; for 4, are also acceptable. 1 is an empty string.) These are basically programs that transform functions into looped/repeatedly applied versions of those functions, e.g. the number 4 is represented as any string which, if interpreted as a function body, will map a function &lt;code&gt;λx.f(x)&lt;/code&gt; into a function &lt;code&gt;λx.f(f(f(f(x))))&lt;/code&gt; (or in Underload terms, replaces a string with four copies of itself). Programs in Underload that deal with numbers typically use this interpretation for numbers in the input and output.&lt;/p&gt;&#xA;&lt;h3&gt;Truthy/falsey&lt;/h3&gt;&#xA;&lt;p&gt;There are no generally-recognised ways to represent true and false in Underload, with the exact format depending on the program.&lt;/p&gt;&#xA;&lt;p&gt;If a question does require you to use a language's specific true and false values (or specific truthy and falsey values), you should use &lt;code&gt;^&lt;/code&gt; for true and &lt;code&gt;!&lt;/code&gt; for false, as these are the values you would need to use in the equivalent of an if statement. However, there's no reason to confine yourself to these representations for use internally within your program; use whatever representations are best for the challenge.&lt;/p&gt;&#xA;&lt;h3&gt;Lists&lt;/h3&gt;&#xA;&lt;p&gt;There isn't currently a consensus about how to represent lists in Underload, so do whatever makes the most sense for your program. (A string can be represented either directly, or as a list of character codes; the latter form will be required if you want to treat the string as anything other than an indivisible unit.)&lt;/p&gt;&#xA;" OwnerUserId="84332" LastActivityDate="2021-10-27T15:08:03.800" CommentCount="0" CommunityOwnedDate="2021-10-27T15:08:03.800" ContentLicense="CC BY-SA 4.0" />
  <row Id="23985" PostTypeId="2" ParentId="2140" CreationDate="2021-10-28T01:41:10.793" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/240102/loading-circle-animation&quot;&gt;Loading Circle Animation&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91262" LastEditorUserId="91262" LastEditDate="2021-12-23T22:55:31.943" LastActivityDate="2021-12-23T22:55:31.943" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="23989" PostTypeId="2" ParentId="23771" CreationDate="2021-10-29T16:54:56.930" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;http://esolangs.org/wiki/Forte&quot; rel=&quot;nofollow noreferrer&quot;&gt;Forte&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Forte is a weird and wonderful language with BASIC-like syntax and an execution model based on redefining integers. It has no conditional or looping constructs; to get conditional or looping behavior, you have to redefine the line numbers your program uses.&lt;/p&gt;&#xA;&lt;p&gt;I'm no expert on Forte, but I can teach the basics. It's also got a good Esolangs article, and it's on &lt;a href=&quot;https://tio.run/#forte&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;. I think it would be really fun for LYAL.&lt;/p&gt;&#xA;" OwnerUserId="16766" LastActivityDate="2021-10-29T16:54:56.930" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23991" PostTypeId="2" ParentId="2140" CreationDate="2021-10-30T17:13:09.913" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/236841/107969&quot;&gt;Fast Matrix Multiplicator Evaluator&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="107969" LastEditorUserId="107969" LastEditDate="2021-11-03T16:19:06.817" LastActivityDate="2021-11-03T16:19:06.817" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23993" PostTypeId="2" ParentId="2140" CreationDate="2021-10-31T09:08:19.527" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/236884/100664&quot;&gt;Remove submatrices&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2021-11-05T07:15:08.810" LastActivityDate="2021-11-05T07:15:08.810" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23994" PostTypeId="2" ParentId="2140" CreationDate="2021-10-31T19:47:52.190" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/239851/is-the-room-lit-up&quot;&gt;Light it up&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2021-12-19T23:57:41.347" LastActivityDate="2021-12-19T23:57:41.347" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="23997" PostTypeId="2" ParentId="2140" CreationDate="2021-11-03T16:40:32.493" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/237007/concatenation-coincidence&quot;&gt;Posted here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="82007" LastEditorUserId="82007" LastEditDate="2021-11-08T14:39:24.933" LastActivityDate="2021-11-08T14:39:24.933" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="23998" PostTypeId="2" ParentId="2140" CreationDate="2021-11-04T02:05:41.363" Score="1" Body="&lt;p&gt;Input two positive integers m, n; Output a grid looks like below:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;┌──────────────┐&#xA;├──┬──┬──┬──┬──┤&#xA;│  │  │  │  │  │&#xA;├──┴──┴──┴──┴──┤&#xA;├──┬──┬──┬──┬──┤&#xA;│  │  │  │  │  │&#xA;├──┴──┴──┴──┴──┤&#xA;├──┬──┬──┬──┬──┤&#xA;│  │  │  │  │  │&#xA;├──┴──┴──┴──┴──┤&#xA;├──┬──┬──┬──┬──┤&#xA;│  │  │  │  │  │&#xA;├──┴──┴──┴──┴──┤&#xA;└──────────────┘&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here is an example for 5×4 grid.&lt;/p&gt;&#xA;&lt;p&gt;Characters used in the grid is shown as this table:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Char&lt;/th&gt;&#xA;&lt;th&gt;Code Point&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;Space&lt;/td&gt;&#xA;&lt;td&gt;U+0020&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;─&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;U+2500&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;│&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;U+2502&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;┌&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;U+250C&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;┐&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;U+2510&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;└&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;U+2514&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;┘&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;U+2518&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;├&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;U+251C&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;┤&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;U+2524&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;┬&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;U+252C&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;┴&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;U+2534&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;You may alternative use a CJK space &lt;code&gt;　&lt;/code&gt; (U+3000) instead of two ASCII spaces &lt;code&gt;  &lt;/code&gt; (U+0020 U+0020). If you chose this option, you should use a single horizontal grid line &lt;code&gt;─&lt;/code&gt; (U+2500) instead of two. You may verify this behavior in the code snippet at bottom.&lt;/p&gt;&#xA;&lt;p&gt;You may output:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a single string&#xA;&lt;ul&gt;&#xA;&lt;li&gt;an array of characters, an array of integers (whose value is the code point of each character);&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;an array of strings, as the single string split by new lines;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;or an array of array of characters, an array of array of integers;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;false&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;Use ASCII Space:&#xA;&#xA;&amp;lt;pre lang=&quot;en&quot;&amp;gt;┌──────────────┐&#xA;├──┬──┬──┬──┬──┤&#xA;│  │  │  │  │  │&#xA;├──┴──┴──┴──┴──┤&#xA;├──┬──┬──┬──┬──┤&#xA;│  │  │  │  │  │&#xA;├──┴──┴──┴──┴──┤&#xA;├──┬──┬──┬──┬──┤&#xA;│  │  │  │  │  │&#xA;├──┴──┴──┴──┴──┤&#xA;├──┬──┬──┬──┬──┤&#xA;│  │  │  │  │  │&#xA;├──┴──┴──┴──┴──┤&#xA;└──────────────┘&amp;lt;/pre&amp;gt;&#xA;&#xA;Use CJK Space:&#xA;&#xA;&amp;lt;pre lang=&quot;zh&quot;&amp;gt;┌─────────┐&#xA;├─┬─┬─┬─┬─┤&#xA;│　│　│　│　│　│&#xA;├─┴─┴─┴─┴─┤&#xA;├─┬─┬─┬─┬─┤&#xA;│　│　│　│　│　│&#xA;├─┴─┴─┴─┴─┤&#xA;├─┬─┬─┬─┬─┤&#xA;│　│　│　│　│　│&#xA;├─┴─┴─┴─┴─┤&#xA;├─┬─┬─┬─┬─┤&#xA;│　│　│　│　│　│&#xA;├─┴─┴─┴─┴─┤&#xA;└─────────┘&amp;lt;/pre&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="44718" LastEditorUserId="44718" LastEditDate="2021-11-04T02:22:53.337" LastActivityDate="2021-11-04T02:22:53.337" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24000" PostTypeId="1" AcceptedAnswerId="24002" CreationDate="2021-11-04T11:50:29.160" Score="12" ViewCount="180" Body="&lt;p&gt;There's consensus that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9263/78850&quot;&gt;answering with fractions&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/19024/78850&quot;&gt;is allowable&lt;/a&gt; for decimals that can be expressed as fractions. But what about irrational numbers? Can they be expressed as a rational representation of the corresponding decimal approximation?&lt;/p&gt;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\sqrt{2}\$&lt;/span&gt; can be approximated as &lt;span class=&quot;math-container&quot;&gt;\$1.4142135623730951\$&lt;/span&gt;, and that's fine because &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5608/78850&quot;&gt;we've established that&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20533/78850&quot;&gt;questions need to establish accuracy&lt;/a&gt;. But is approximating it as something like &lt;span class=&quot;math-container&quot;&gt;\$\frac{6369051672525773}{4503599627370496}\$&lt;/span&gt; or &lt;span class=&quot;math-container&quot;&gt;\$\frac{665857}{470832}\$&lt;/span&gt; allowable?&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\pi\$&lt;/span&gt; is approximately &lt;span class=&quot;math-container&quot;&gt;\$3.1415926535897\$&lt;/span&gt;, and can be represented by something like &lt;span class=&quot;math-container&quot;&gt;\$\frac{3126535}{995207}\$&lt;/span&gt; or &lt;span class=&quot;math-container&quot;&gt;\$\frac{884279719003555}{281474976710656}\$&lt;/span&gt;, but is that valid?&lt;/p&gt;&#xA;&lt;p&gt;Essentially, can fractions be used to approximate irrationals?&lt;/p&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="16766" LastEditDate="2021-11-04T17:07:23.177" LastActivityDate="2021-11-04T17:07:23.177" Title="Policy on Outputting Irrationals as Fractions" Tags="|discussion|defaults|output|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24001" PostTypeId="2" ParentId="2140" CreationDate="2021-11-04T13:25:45.897" Score="1" Body="&lt;h1&gt;What is the maximum value generated by interleaving?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base-conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; rel=&quot;tag&quot;&gt;base-conversion&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;INTERCAL has an interleave operator which does the following operation. Let left operand be &lt;code&gt;asdf&lt;/code&gt; and right one &lt;code&gt;qwer&lt;/code&gt; in binary, respectively. The operation produces a binary value &lt;code&gt;aqswdefr&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;INTERCAL internally treats data as unsigned integers, so the value of the eight-bit value represents 0 to 255 in decimal, inclusively.&lt;/p&gt;&#xA;&lt;p&gt;If one operand has fewer bits than the other, the fewer one gets padded with zero before operation. So, &lt;code&gt;asd&lt;/code&gt; interleaving with &lt;code&gt;qwer&lt;/code&gt; is equal to &lt;code&gt;0asd&lt;/code&gt; interleaving with &lt;code&gt;qwer&lt;/code&gt;, which is &lt;code&gt;0qawsedr&lt;/code&gt;: it represents 0 to 127 in decimal.&lt;/p&gt;&#xA;&lt;p&gt;Also, INTERCAL has an extension that handles any bases. Let's assume if 3-base numbers are handled. If each operand has 1 and 3 digits respectively, the maximum value for each operand is represented as &lt;code&gt;2&lt;/code&gt; and &lt;code&gt;222&lt;/code&gt; in 3-base number, respectively. Interleaving them results in &lt;code&gt;020222&lt;/code&gt;, which is 188 in decimal.&lt;/p&gt;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&lt;p&gt;Given an input of three unsigned integers, output the largest possible value generated by interleaving. The three integers are: number of digits for left operand, number of digits for right operand, and in what base those operands are described with.&lt;/p&gt;&#xA;&lt;h2&gt;Restrictions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Base shall be 2 or greater.&lt;/li&gt;&#xA;&lt;li&gt;Each operand has at least 1 digit.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In either function or a program.&lt;/li&gt;&#xA;&lt;li&gt;Standard I/O rules apply, as long as every input and output value is represented as same base or same representation.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;So varying output base is not allowed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;If input is represented as a list-like format, any orders of arguments or input values are fine.&lt;/li&gt;&#xA;&lt;li&gt;No standard loopholes.&lt;/li&gt;&#xA;&lt;li&gt;Shortest code wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;TODO.&lt;/p&gt;&#xA;&lt;h1&gt;meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Am I missing any appropriate tags yet?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user100411" LastEditorDisplayName="user100411" LastEditDate="2021-11-15T11:41:08.290" LastActivityDate="2021-11-15T11:41:08.290" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24002" PostTypeId="2" ParentId="24000" CreationDate="2021-11-04T13:30:45.210" Score="18" Body="&lt;h2&gt;I'd say sure&lt;/h2&gt;&#xA;&lt;p&gt;After all, a float is just a fraction with some extra rules on top. If you can output a fraction that's approximately as accurate as a typical floating point number, I see no reason it shouldn't be allowed.&lt;/p&gt;&#xA;&lt;p&gt;I think the easiest way to handle this would be to apply any rules the author specifies for floating point numbers' accuracy to fractions, unless they specify a rule for fractions specifically.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-11-04T13:30:45.210" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24003" PostTypeId="1" AcceptedAnswerId="24004" CreationDate="2021-11-04T16:00:05.997" Score="7" ViewCount="356" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19271/16766&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout November 2021, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Zsh&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;What's a Language of the Month?&lt;/p&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/16766&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during November, those who wish to participate should learn (at least the basics of) Zsh, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about Zsh&lt;/h2&gt;&#xA;&lt;p&gt;&lt;sup&gt;Taken from the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/22229&quot;&gt;nomination post&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;Zsh is a Bourne shell derivative which apparently specialises in having far too many ways to do some things, of which the shortest is always inconvenient, and no obvious way to do a lot of other things. Thanks to its liberal forgiveness of errors, it is very abusable, which is a great feature for code golf and makes competing in it particularly fun.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is easy to learn, but difficult to master&lt;/li&gt;&#xA;&lt;li&gt;By learning it, you will be able to write shell scripts much better and gain more experience with a practical interactive shell where you (should) spend a lot of your time&lt;/li&gt;&#xA;&lt;li&gt;It does surprisingly well in many text and pattern matching-based challenges, so you will be able to compete amongst even some golfing languages&lt;/li&gt;&#xA;&lt;li&gt;It's very good at restricted source, especially for a non-esoteric language&lt;/li&gt;&#xA;&lt;li&gt;I am the currently only active user, and I'd like to change that&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;I already run &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20789&quot;&gt;a bounty&lt;/a&gt; on Zsh answers; for the month of November only, all first time Zsh users' answers will be eligible for this bounty&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Resources&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://ato.pxeger.com/run?1=m724qjhjwYKlpSVpuhZoFJQGAA&quot; rel=&quot;nofollow noreferrer&quot;&gt;Attempt This Online!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226010&quot;&gt;Zsh Showcase&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/219490&quot;&gt;Tips for restricted source in Zsh&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/15279&quot;&gt;Tips for golfing in Bash&lt;/a&gt;, of which many are also applicable to Zsh&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://zsh.sourceforge.net/Doc/Release/zsh_toc.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Zsh manual&lt;/a&gt; (also &lt;code&gt;man zshall&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://zsh.sourceforge.net/Guide/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Zsh user guide&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="87606" LastEditDate="2021-11-15T15:35:01.447" LastActivityDate="2021-11-18T09:16:32.793" Title="Language of the Month for November 2021: Zsh" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24004" PostTypeId="2" ParentId="24003" CreationDate="2021-11-04T16:00:05.997" Score="4" Body="&lt;h1&gt;List of all Zsh answers posted in November 2021&lt;/h1&gt;&#xA;&lt;p&gt;(first-time posters in &lt;strong&gt;bold&lt;/strong&gt;)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/236781&quot;&gt;Universal Spooky Meme Translator&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/15940/roblogic&quot;&gt;roblogic&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/236877/92901&quot;&gt;How long is the number in this base?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92901&quot;&gt;&lt;strong&gt;Dingus&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/236969&quot;&gt;Rotate N Values in a List&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/86147/gammafunction&quot;&gt;GammaFunction&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/237136&quot;&gt;yes is 91 lines long&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/15940/roblogic&quot;&gt;roblogic&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/237102&quot;&gt;Swap every two elements in a list&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/97857/pxeger&quot;&gt;pxeger&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/237394&quot;&gt;Digit small numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/107299&quot;&gt;&lt;strong&gt;Seggan&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/237195&quot;&gt;Universal Spooky Meme Translator&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/994/gilles-so-stop-being-evil&quot;&gt;Gilles 'SO- stop being evil'&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/237194&quot;&gt;yes is 91 lines long&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/994/gilles-so-stop-being-evil&quot;&gt;Gilles 'SO- stop being evil'&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant tips posted in November 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/237161&quot;&gt;Use &lt;code&gt;.&lt;/code&gt; for looping&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100411/nrgmsbki4spot1&quot;&gt;nrgmsbki4spot1&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/237192&quot;&gt;Use &lt;code&gt;$_&lt;/code&gt; (the underscore variable)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/97857/pxeger&quot;&gt;pxeger&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;tip summary&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant challenges posted in November 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2021-11-18T09:16:32.793" LastActivityDate="2021-11-18T09:16:32.793" CommentCount="0" CommunityOwnedDate="2021-11-04T16:00:05.997" ContentLicense="CC BY-SA 4.0" />
  <row Id="24005" PostTypeId="1" AcceptedAnswerId="24007" CreationDate="2021-11-04T17:24:11.547" Score="3" ViewCount="55" Body="&lt;p&gt;Should the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19279/nominations-for-language-of-the-month-2021-edition&quot;&gt;Nominations for Language of the Month&lt;/a&gt; post be converted to a community wiki? What are the pros and cons of doing so?&lt;/p&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="68942" LastEditDate="2021-11-07T17:53:10.260" LastActivityDate="2021-11-07T17:53:10.260" Title="Should Nominations for Language of the Month be community wiki?" Tags="|discussion|status-completed|language-of-the-month|community-wiki|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24007" PostTypeId="2" ParentId="24005" CreationDate="2021-11-04T17:29:42.387" Score="4" Body="&lt;h2&gt;Yes&lt;/h2&gt;&#xA;&lt;p&gt;Community Wiki posts are specifically for posts that are edited often by multiple members of the community. The LOTM nominations body is a perfect example for this, and so the question &lt;em&gt;should&lt;/em&gt; be made CW.&lt;/p&gt;&#xA;&lt;h3&gt;That said...&lt;/h3&gt;&#xA;&lt;p&gt;Unfortunately, making a question into a Community Wiki also makes all answers to that question Community Wiki as well, which appears to be the &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/59525651#59525651&quot;&gt;biggest objection to this&lt;/a&gt;. This is an unfortunate side effect of the Community Wiki tool, and an ideal resolution of this would to be to &lt;em&gt;only&lt;/em&gt; CW the question, and leave the answers as is.&lt;/p&gt;&#xA;&lt;p&gt;This, unfortunately, isn't an option, and, in my opinion, the downsides of making a nomination CW are negligible. Mostly, the nominations posts are about the languages, not about any single person, and we should be encouraging people to edit in resources/pros/cons/information about the nominations if they believe them to be lacking. The only real drawback I can see is that using first-person language may get confusing, but this can be mitigated in a number of ways - if it's even an issue in the first place.&lt;/p&gt;&#xA;&lt;p&gt;Overall, yes, I believe making the thread CW is a good idea.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-11-04T17:29:42.387" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24008" PostTypeId="2" ParentId="2140" CreationDate="2021-11-05T00:57:43.513" Score="-1" Body="&lt;h1&gt;Output a random integer in a range that is a multiple of all in one set and not a multiple of any in another set&lt;/h1&gt;&#xA;&lt;p&gt;Given an integer range and two sets of integers, generate a random integer inclusive within the range that is a multiple of all the numbers in the first set but is not a multiple of any number in the second set, or specify that such a value does not exist.&lt;/p&gt;&#xA;&lt;h2&gt;Examples:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Range: 100 - 200&lt;/li&gt;&#xA;&lt;li&gt;Divisors: 3, 5&lt;/li&gt;&#xA;&lt;li&gt;Non-divisors: 9, 10&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Possible values are: 105, 165, 195 (output one at random)&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Mathematically elegant solutions are preferred, but brute force solutions are accepted.&lt;/li&gt;&#xA;&lt;li&gt;If outputting one of multiple values is possible (as shown above), the solution should return a different value with each execution so that, probabilistically, all possible values are eventually output.&lt;/li&gt;&#xA;&lt;li&gt;This is code golf, so lowest byte count wins.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;NOTE&lt;/strong&gt; I have a solution for this in C#, but I'm curious of what other solutions there are.  I had a heck of a time working out the math for this and thought it would be a good bit of puzzling for this community.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="47278" LastEditorUserId="47278" LastEditDate="2021-11-05T12:02:29.493" LastActivityDate="2021-11-05T12:02:29.493" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24011" PostTypeId="1" CreationDate="2021-11-05T16:58:02.770" Score="11" ViewCount="136" Body="&lt;p&gt;Currently, we have some tags which can be used to indicate what sorts of data answers will work with: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt;, and so on. One of those sticks out from the rest: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt;, which has &lt;code&gt;-manipulation&lt;/code&gt; unnecessarily appended.&lt;/p&gt;&#xA;&lt;p&gt;Interestingly, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; rel=&quot;tag&quot;&gt;array&lt;/a&gt; &lt;em&gt;does&lt;/em&gt; exist...but as a synonym, while &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date&amp;#39;&quot; rel=&quot;tag&quot;&gt;date&lt;/a&gt; has &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/date-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;date-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;date-manipulation&lt;/a&gt; as a synonym (and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; have no synonyms at all). This is obviously inconsistent. The added &lt;code&gt;-manipulation&lt;/code&gt; doesn't add anything useful, as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; rel=&quot;tag&quot;&gt;array&lt;/a&gt; would still clearly indicate a challenge involves the manipulation of arrays, just as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; indicates the manipulation of strings.&lt;/p&gt;&#xA;&lt;p&gt;I doubt there's any intentional reason for this; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt; was created a while after &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;, and it's likely nobody really thought about it (though it evidently confused some people, if &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; rel=&quot;tag&quot;&gt;array&lt;/a&gt; was created and made a synonym).&lt;/p&gt;&#xA;&lt;p&gt;Fixing this wouldn't be too difficult, just requiring some moderator actions (removing the current &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; rel=&quot;tag&quot;&gt;array&lt;/a&gt;, making a new one, and merging &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array-manipulation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array-manipulation&amp;#39;&quot; rel=&quot;tag&quot;&gt;array-manipulation&lt;/a&gt; with it). Should we do this?&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="68942" LastEditDate="2021-11-09T16:50:37.210" LastActivityDate="2021-11-09T16:50:37.210" Title="Can we change [array-manipulation] to [array]?" Tags="|discussion|status-completed|tags|tag-synonyms|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24014" PostTypeId="2" ParentId="2140" CreationDate="2021-11-06T19:17:59.360" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/237514/will-one-cell-brainfuck-halt&quot;&gt;Will one-cell brainfuck halt?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2021-11-22T10:01:41.467" LastActivityDate="2021-11-22T10:01:41.467" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24015" PostTypeId="2" ParentId="24011" CreationDate="2021-11-07T16:19:29.430" Score="17" Body="&lt;h1&gt;Yes, for the reasons explained in the question&lt;/h1&gt;&#xA;&lt;p&gt;I've posted this answer so we can vote on it.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2021-11-07T16:19:29.430" CommentCount="1" CommunityOwnedDate="2021-11-07T16:19:29.430" ContentLicense="CC BY-SA 4.0" />
  <row Id="24016" PostTypeId="2" ParentId="24011" CreationDate="2021-11-07T16:20:35.107" Score="-7" Body="&lt;h1&gt;No, because it's not worth the effort&lt;/h1&gt;&#xA;&lt;p&gt;I've posted this answer so we can vote on it.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2021-11-07T16:20:35.107" CommentCount="3" CommunityOwnedDate="2021-11-07T16:20:35.107" ContentLicense="CC BY-SA 4.0" />
  <row Id="24017" PostTypeId="2" ParentId="23684" CreationDate="2021-11-08T12:13:24.667" Score="1" Body="&lt;p&gt;This answer was dissociated from the original owner and assigned to Community. Dissociation completely assigns the new assignee (in this case, Community) as the owner of the post, so they will also appear as the one who created the post.&lt;/p&gt;&#xA;" OwnerUserId="11952" LastActivityDate="2021-11-08T12:13:24.667" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24020" PostTypeId="2" ParentId="2140" CreationDate="2021-11-09T02:07:43.793" Score="1" Body="&lt;h1&gt;⧵begin{alignat} ... ⧵end{alignat} &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Note: The title intentionally uses &lt;code&gt;&amp;amp;#10741;&lt;/code&gt; (reverse solidus operator) instead of plain backslash, because otherwise MathJax would happily translate the entire title to... uh... a MathJax error box.&lt;/p&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;&lt;code&gt;\begin{alignat}{n} ... \end{alignat}&lt;/code&gt; is a lesser known LaTeX/MathJax block that allows aligning multiple parts of multi-line equations.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;\begin{alignat}{5}&#xA;A&amp;amp;=&amp;amp;B&amp;amp;\\&#xA; &amp;amp; &amp;amp;B&amp;amp;=&amp;amp;C&amp;amp;\\&#xA; &amp;amp; &amp;amp; &amp;amp; &amp;amp;C&amp;amp;=&amp;amp;D&amp;amp;\\&#xA; &amp;amp; &amp;amp; &amp;amp; &amp;amp; &amp;amp; &amp;amp;D&amp;amp;=&amp;amp;E&#xA;\end{alignat}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\begin{alignat}{5}&#xA;A&amp;amp;=&amp;amp;B\\&#xA; &amp;amp; &amp;amp;B&amp;amp;=&amp;amp;C&amp;amp;\\&#xA; &amp;amp; &amp;amp; &amp;amp; &amp;amp;C&amp;amp;=&amp;amp;D&amp;amp;\\&#xA; &amp;amp; &amp;amp; &amp;amp; &amp;amp; &amp;amp; &amp;amp;D&amp;amp;=&amp;amp;E&#xA;\end{alignat}&lt;/span&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;\begin{alignat}{5}&#xA;x&amp;amp;=&amp;amp;-3&amp;amp;a&amp;amp;-&amp;amp;2&amp;amp;b\\&#xA;y&amp;amp;=&amp;amp; 2&amp;amp;a&amp;amp;+&amp;amp; &amp;amp;b&#xA;\end{alignat}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\begin{alignat}{5}&#xA;x&amp;amp;=&amp;amp; 3&amp;amp;a&amp;amp;-&amp;amp;2&amp;amp;b\\&#xA;y&amp;amp;=&amp;amp;-2&amp;amp;a&amp;amp;+&amp;amp; &amp;amp;b&#xA;\end{alignat}&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Implement &amp;quot;Poor Man's ASCII-Only Alignat&amp;quot;, which tries to replicate the behavior of MathJax but in plain text. The spec of PMAOA is as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Let's define a &amp;quot;word&amp;quot; to be each part of a line delimited by the &lt;code&gt;&amp;amp;&lt;/code&gt; character. A word can be empty, and the parts before the first &lt;code&gt;&amp;amp;&lt;/code&gt; and after the last &lt;code&gt;&amp;amp;&lt;/code&gt; also count as words.&lt;/li&gt;&#xA;&lt;li&gt;Given a multi-line string input, identify the 1st, 2nd, 3rd, ... word of each line.&lt;/li&gt;&#xA;&lt;li&gt;Right-align the 1st words of all lines, right-align the 2nd words of all lines, ..., and concatenate the aligned blocks horizontally. Padding is done with &lt;strong&gt;minimal amount of&lt;/strong&gt; space characters. Trailing whitespace at the end of each line is optional.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply. The shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;Coming soon.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-11-09T10:14:21.743" LastActivityDate="2021-11-09T10:14:21.743" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24021" PostTypeId="1" CreationDate="2021-11-09T05:03:45.980" Score="16" ViewCount="564" Body="&lt;p&gt;Every year, during December, our cousin site, &lt;a href=&quot;https://adventofcode.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Advent of Code&lt;/a&gt; goes live, hosting a coding challenge every day from the 1st of December to the 24th of December. There have been &lt;a href=&quot;https://codegolf.stackexchange.com/q/216024/66833&quot;&gt;various&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/q/149660/66833&quot;&gt;attempts&lt;/a&gt; for members of this site to do a similar thing, but it almost always results in a single user trying to post a challenge a day for 24 days, which usually fails partway through the month. Even normally, this is difficult (unless you're &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler?tab=questions&amp;amp;sort=newest&quot;&gt;Bubbler&lt;/a&gt;), but this is made &lt;em&gt;even&lt;/em&gt; harder by trying to make them Christmas themed.&lt;/p&gt;&#xA;&lt;p&gt;Last year, I had &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/55926336#55926336&quot;&gt;an idea&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Ooh, here's an idea: find 25 challenges in the Sandbox that have been abandoned, touch them up to site quality and use them&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;At the time, I abandoned the idea because (in October) &amp;quot;it might be a bit difficult to do in a month&amp;quot;, a valid concern.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;However, the idea of a CGCC &amp;quot;Advent of Code&amp;quot; event has stuck in my mind since, and I'm opening the floor to feedback and suggestions. Namely, would people be interested in:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Some kind of Christmas coding event, likely one challenge a day over most of the month of December?&lt;/li&gt;&#xA;&lt;li&gt;Competing in such an event, either &amp;quot;part-time&amp;quot; or &amp;quot;full-time&amp;quot;?&lt;/li&gt;&#xA;&lt;li&gt;Contributing challenges to the event, either one-off or regularly?&lt;/li&gt;&#xA;&lt;li&gt;Revamping abandoned Sandbox challenges as part of this event?&lt;/li&gt;&#xA;&lt;li&gt;Some other ideas for such an event?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Feel free to leave suggestions in the answers below.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-12-27T20:32:06.200" LastActivityDate="2021-12-27T20:32:06.200" Title="Advent of code golf?" Tags="|discussion|sandbox|challenges|advent-events|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24022" PostTypeId="2" ParentId="2140" CreationDate="2021-11-09T07:13:18.093" Score="1" Body="&lt;h1&gt;Climbing up slippery stairs &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;You're standing in front of a stairway with &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; stairs in total. (If you label each staircase &lt;span class=&quot;math-container&quot;&gt;\$1,\cdots,n\$&lt;/span&gt;, the starting point counts as the 0th staircase.) You can climb up &lt;span class=&quot;math-container&quot;&gt;\$1,2,\cdots,k\$&lt;/span&gt; stairs at a time. But some stairs are slippery; if you step on it, it will cause you to slip backwards until you stand on a non-slippery one (or the starting point). In how many ways can you get to the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th staircase with exactly &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; steps?&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Task:&lt;/strong&gt; Given the list of staircases of length &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; marked with either &amp;quot;slippery&amp;quot; or &amp;quot;non-slippery&amp;quot; (you can choose any two consistent values) and the values of &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt;, answer the above question.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th staircase is guaranteed to be non-slippery, and you cannot move further than the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th. This implies that reaching the destination before you spend &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; steps doesn't count.&lt;/p&gt;&#xA;&lt;p&gt;For example, if the stairway is &lt;code&gt;[non-slippery, slippery, non-slippery]&lt;/code&gt; and &lt;span class=&quot;math-container&quot;&gt;\$k=2\$&lt;/span&gt;, two possible first steps (climbing one or two stairs) will result in the same position (the first staircase), but count as two distinct possible moves. And if you try to climb one stair as the second step, you will end up not moving at all, but it still counts as a step.&lt;/p&gt;&#xA;&lt;p&gt;You may assume &lt;span class=&quot;math-container&quot;&gt;\$1 \le k \le n\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$s \ge 1\$&lt;/span&gt;. Some inputs may have no way to reach the destination at all; in that case, your code should output the value of zero for any value of &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Example and test cases&lt;/h2&gt;&#xA;&lt;p&gt;&lt;code&gt;N&lt;/code&gt; means non-slippery, and &lt;code&gt;S&lt;/code&gt; means slippery. &lt;code&gt;1-1-3&lt;/code&gt; notation means that you can reach the top in three steps, trying to advance 1, 1, and 3 stairs at once.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;N = [N, S, N, N]&#xA;k = 3&#xA;s = 1: answer = 0 (no way to climb 4 stairs at once)&#xA;s = 2: answer = 3 (1-3, 2-3, 3-1)&#xA;s = 3: answer = 4 (1-1-3, 1-2-1, 2-1-3, 2-2-1)&#xA;&#xA;N = [S, S, N, S, S, N]&#xA;k = 4&#xA;s = 1: answer = 0&#xA;s = 2: answer = 2 (3-3, 4-3)&#xA;s = 3: answer = 8 (1-3-3, 1-4-3, 2-3-3, 2-4-3, 3-1-3, 3-2-3, 4-1-3, 4-2-3)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;More test cases coming soon.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2021-11-09T07:13:18.093" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24024" PostTypeId="1" AcceptedAnswerId="24025" CreationDate="2021-11-10T01:29:52.157" Score="3" ViewCount="62" Body="&lt;p&gt;Unlike other (Q&amp;amp;A) sites in the Stack Exchange network, CGCC has a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10812/92901&quot;&gt;consensus&lt;/a&gt; that duplicate answers are acceptable. For some code golf challenges there is one obvious shortest solution in a particular language, so it's unsurprising that different users might independently arrive at the same answer. By default we assume that everyone acts in good faith.&lt;/p&gt;&#xA;&lt;p&gt;The action prompts in the Late Answers queue contradict this consensus:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An answer &lt;em&gt;Looks OK&lt;/em&gt; if it 'is unique'.&lt;/li&gt;&#xA;&lt;li&gt;A reason to &lt;em&gt;Recommend deletion&lt;/em&gt; is that an answer 'is a duplicate'.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ijSOA.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ijSOA.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In practice, reviewers familiar with our stance towards duplicate answers disregard the prompts. Others may well be led astray. I don't know whether acceptable answers are often actually deleted as a result, but I do know from comments on duplicate answers that awareness of our policy isn't universal, even among experienced users. (Some time ago I was myself directed to the linked post after leaving such a comment.)&lt;/p&gt;&#xA;&lt;p&gt;Do we have control over the late answer prompts on CGCC or are they set network wide? If we can change them, shouldn't we remove the references to unique/duplicate answers?&lt;/p&gt;&#xA;" OwnerUserId="92901" LastEditorUserId="68942" LastEditDate="2021-11-10T01:58:45.517" LastActivityDate="2021-11-10T01:58:45.517" Title="Can we change the Late Answers prompts regarding duplicates?" Tags="|feature-request|status-declined|reviewing|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24025" PostTypeId="2" ParentId="24024" CreationDate="2021-11-10T01:58:38.970" Score="4" Body="&lt;p&gt;This is currently uncustomizable and according to the CMs, it is not something they are planning to customize.&lt;/p&gt;&#xA;&lt;p&gt;In nearly all circumstances, duplicate answers aren't OK; CGCC is exceptionally unique in this regard, so we will have to live with this unfortunately.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-11-10T01:58:38.970" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24029" PostTypeId="2" ParentId="202" CreationDate="2021-11-10T22:38:31.603" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://scastie.scala-lang.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Scastie&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Scastie is a free, no-account-required sandbox for running Scala code. It's particularly good for testing short snippets, since code doesn't need to be contained in a class/object or method. In worksheet mode, when a snippet is executed, each expression's value and type are displayed next to it; you can also use &lt;code&gt;print&lt;/code&gt; and related functions to output to the console as usual. Scastie generates permalinks (&lt;a href=&quot;https://scastie.scala-lang.org/u1hSrP02Tn6EdEqfk6bXMQ&quot; rel=&quot;nofollow noreferrer&quot;&gt;like so&lt;/a&gt;) and supports both Scala 2 and Scala 3. You can also sign in to Scastie using your GitHub account so you can access your saved links more easily.&lt;/p&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="95792" LastEditDate="2021-11-10T23:11:38.913" LastActivityDate="2021-11-10T23:11:38.913" CommentCount="0" CommunityOwnedDate="2021-11-10T22:38:31.603" ContentLicense="CC BY-SA 4.0" />
  <row Id="24032" PostTypeId="2" ParentId="24021" CreationDate="2021-11-11T01:22:06.983" Score="3" Body="&lt;h1&gt;I'm fully in support of such an event, but...&lt;/h1&gt;&#xA;&lt;p&gt;... maybe it's too late to build such an event for this year, I guess?&lt;/p&gt;&#xA;&lt;p&gt;The main issue is about coming up with the challenges in the first place, obviously. &lt;a href=&quot;https://adventofcode.com/2021/about&quot; rel=&quot;nofollow noreferrer&quot;&gt;Eric Wastl&lt;/a&gt;, the host of AoC, is known to spend the whole year to prepare for the &lt;code&gt;25*2-1&lt;/code&gt; challenges. Probably we're in better situation (we're a bunch of people, not 1 person, and we don't need everything to fit in a single Christmas-themed story), but 1 month (more like 3 weeks as of writing this) is way too short to prepare 25 challenges, especially when we want all of them to be of good quality.&lt;/p&gt;&#xA;&lt;p&gt;Sandbox revamp is great, but we have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2091/78410&quot;&gt;process&lt;/a&gt; for that:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a challenge proposal was not edited or commented on for &lt;strong&gt;a month&lt;/strong&gt;, you can leave a comment that you would like take over the challenge, get it ready for main and post it.&lt;/li&gt;&#xA;&lt;li&gt;If the OP does not reply within &lt;strong&gt;two weeks&lt;/strong&gt;, telling you that they still intend to post the challenge themselves, you are free to proceed with the challenge as you see fit.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;And it takes time and effort to dig the sandbox for hidden gems, so it's again too late for this year.&lt;/p&gt;&#xA;&lt;p&gt;One thing that might work this year is: what if we post some modified versions of previous AoC challenges? I think Eric has given explicit permission on posting those to CGCC (or other sites in general? I don't remember the details).&lt;/p&gt;&#xA;&lt;p&gt;I don't think anything else (participation of answerers, ...) will be a problem, given that we've seen multiple successful one-user-hosted events before.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2021-11-11T01:22:06.983" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24034" PostTypeId="2" ParentId="2140" CreationDate="2021-11-11T12:20:16.780" Score="3" Body="&lt;h2&gt;Leave ABACABA on the tape&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;Note that will be removed post sandboxing: This challenge is Brainfuck-specific, but I hope that its contents make the reason why sufficiently clear.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Write a brainfuck program which leaves the following sequence on the tape:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 1 0 2 0 1 0 3 0 1 0 2 0 1 0 4 0 1 0 2 0 1 0 3 0 1 0 2 0 1 0 ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This sequence may be familiar to some as &lt;a href=&quot;https://en.wikipedia.org/wiki/ABACABA_pattern&quot; rel=&quot;nofollow noreferrer&quot;&gt;ABACABADABACABA...&lt;/a&gt; or &lt;a href=&quot;https://oeis.org/A007814&quot; rel=&quot;nofollow noreferrer&quot;&gt;A007814&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Assume an implementation of BF with an endless tape and arbitrarily large (&lt;strong&gt;but not arbitrarily small&lt;/strong&gt;) integers.&lt;/p&gt;&#xA;&lt;p&gt;You should link to a visualizer to prove that your program works as you say it does, but if this isn't fast enough to witness the first few (say 4) numbers in ABACABA you'll have to explain it yourself.&lt;/p&gt;&#xA;&lt;p&gt;This is code-golf, so the shortest program operating within these rules wins. Have fun!&lt;/p&gt;&#xA;" OwnerUserId="84216" LastActivityDate="2021-11-11T12:20:16.780" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24035" PostTypeId="2" ParentId="2140" CreationDate="2021-11-11T20:16:15.377" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/237291/infinite-ordinals-from-a-well-ordering&quot;&gt;Infinite ordinals from a well-ordering&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="100664" LastEditDate="2021-11-23T03:21:23.993" LastActivityDate="2021-11-23T03:21:23.993" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24037" PostTypeId="2" ParentId="23771" CreationDate="2021-11-11T23:49:33.273" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/dylanrenwick/lmbm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Lean Mean Bean Machine&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Lean Mean Bean Machine, or LMBM is a 2D language inspired by &lt;a href=&quot;https://www.videoamusement.com/wp-content/uploads/2016/02/Giant-Plinko-Carnival-Game-Rental-San-Francisco-California.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;Plinko machines&lt;/a&gt;. It's a small language with a reasonable amount of symbols (or &amp;quot;pegs&amp;quot;), enough that trivial tasks are still trivial, but not so much that non-trivial tasks aren't interesting.&lt;/p&gt;&#xA;&lt;p&gt;It's also available on &lt;a href=&quot;https://tio.run/#lmbm&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO!&lt;/a&gt;, however that version is &lt;em&gt;slightly&lt;/em&gt; outdated in that &lt;code&gt;|&lt;/code&gt; has slightly different behavior, the &lt;code&gt;o&lt;/code&gt; peg is broken, and the &lt;code&gt;,&lt;/code&gt; and &lt;code&gt;.&lt;/code&gt; pegs don't exist.&lt;/p&gt;&#xA;" OwnerUserId="44998" LastActivityDate="2021-11-11T23:49:33.273" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24038" PostTypeId="2" ParentId="23771" CreationDate="2021-11-11T23:54:32.810" Score="-1" Body="&lt;h1&gt;Malbolge&lt;/h1&gt;&#xA;&lt;p&gt;This is the hardest programming language. Still learnable, but hard to program in. I can teach the basics.&lt;/p&gt;&#xA;&lt;h2&gt;Resources:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#malbolge&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://esolangs.org/wiki/Malbolge&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolangs&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="106959" LastActivityDate="2021-11-11T23:54:32.810" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24039" PostTypeId="2" ParentId="2140" CreationDate="2021-11-12T13:13:09.000" Score="2" Body="&lt;p&gt;Consider all arrays of &lt;span class=&quot;math-container&quot;&gt;\$\ell\$&lt;/span&gt; non-negative integers in the range &lt;span class=&quot;math-container&quot;&gt;\$0,\dots,m\$&lt;/span&gt;.  Consider all such arrays   whose sum is exactly &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt;.  We can list those in lexicographic order and assign an integer to each one which is simply its rank in the list.&lt;/p&gt;&#xA;&lt;p&gt;For example, take &lt;span class=&quot;math-container&quot;&gt;\$\ell=7, s=5, m=4\$&lt;/span&gt;, the list could look like:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(0, 0, 0, 0, 0, 1, 4)  rank 1&#xA;(0, 0, 0, 0, 0, 2, 3)  rank 2&#xA;(0, 0, 0, 0, 0, 3, 2)  rank 3&#xA;(0, 0, 0, 0, 0, 4, 1)  rank 4&#xA;(0, 0, 0, 0, 1, 0, 4)  rank 5&#xA;(0, 0, 0, 0, 1, 1, 3)  rank 6&#xA;(0, 0, 0, 0, 1, 2, 2)  rank 7&#xA;(0, 0, 0, 0, 1, 3, 1)  rank 8&#xA;(0, 0, 0, 0, 1, 4, 0)  rank 9&#xA;[...]&#xA;(3, 2, 0, 0, 0, 0, 0) rank 449&#xA;(4, 0, 0, 0, 0, 0, 1) rank 450&#xA;(4, 0, 0, 0, 0, 1, 0) rank 451&#xA;(4, 0, 0, 0, 1, 0, 0) rank 452&#xA;(4, 0, 0, 1, 0, 0, 0) rank 453&#xA;(4, 0, 1, 0, 0, 0, 0) rank 454&#xA;(4, 1, 0, 0, 0, 0, 0) rank 455&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This challenge requires you to produce two pieces of code/functions.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Given a rank, compute the corresponding array directly. Call this function &lt;code&gt;unrank()&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Given an array,  compute its rank. Call this function &lt;code&gt;rank()&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Your code should run in polynomial time. That is it shouldn't be brute force and more specifically it should take &lt;span class=&quot;math-container&quot;&gt;\$O(\ell^a s^b m^c)\$&lt;/span&gt; time for fixed non-negative integers &lt;span class=&quot;math-container&quot;&gt;\$a, b, c\$&lt;/span&gt;. Any non-brute force method is likely to satisfy this requirement.&lt;/p&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;unrank((7, 5, 4), 9) = (0, 0, 0, 0, 1, 4, 0)&#xA;rank((7, 5, 4), (4, 0, 0, 0, 0, 1, 0)) = 451&#xA;unrank((14,10, 8), 100000)  = (0, 0, 0, 1, 0, 0, 1, 3, 1, 2, 0, 0, 2, 0)&#xA;rank((14, 10, 8), (2, 0, 1, 1, 2, 0, 0, 0, 2, 1, 1, 0, 0, 0)) = 1000000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your score will be the total size for your code&lt;/p&gt;&#xA;" OwnerDisplayName="user7467" LastEditorDisplayName="user7467" LastEditDate="2021-11-12T14:32:06.350" LastActivityDate="2021-11-12T14:32:06.350" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24040" PostTypeId="2" ParentId="5243" CreationDate="2021-11-12T18:46:25.123" Score="2" Body="&lt;h1&gt;100 rep for interpreting a TC language in &lt;a href=&quot;https://github.com/chunkybanana/tarfish&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tarfish&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Answers should go to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/111278/turing-complete-language-interpreter&quot;&gt;this question&lt;/a&gt;. Add a comment to this as well.&lt;/p&gt;&#xA;&lt;p&gt;Some ideas:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://esolangs.org/wiki/Bitwise_Cyclic_Tag&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://esolangs.org/wiki/Bitwise_Cyclic_Tag&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Any &lt;a href=&quot;https://esolangs.org/wiki/Tag_system&quot; rel=&quot;nofollow noreferrer&quot;&gt;tag system&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Anything implemented in the linked question&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://esolangs.org/wiki/Fractran&quot; rel=&quot;nofollow noreferrer&quot;&gt;FRACTRAN&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="100664" LastActivityDate="2021-11-12T18:46:25.123" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24041" PostTypeId="2" ParentId="2140" CreationDate="2021-11-12T20:39:07.257" Score="1" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/237690/permutation-of-all-the-number-which-separated-by-and&quot;&gt;Permutation of all the number which separated by &amp;#39;:&amp;#39; and &amp;#39;,&amp;#39;&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="108277" LastEditorUserId="108277" LastEditDate="2021-11-25T19:17:58.757" LastActivityDate="2021-11-25T19:17:58.757" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24042" PostTypeId="1" CreationDate="2021-11-13T07:26:35.660" Score="1" ViewCount="68" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/237161/100411&quot;&gt;I have posted this golfing tip for Bash before&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;In Pure Bash (or any other pure shellscript), use &lt;code&gt;.&lt;/code&gt; for looping.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;It's a tip that recomments using a file whose the program has. I have ever posted these answers that uses the tip:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/237156/100411&quot;&gt;Implement a Truth-Machine&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/237157/100411&quot;&gt;1, 2, Fizz, 4, Buzz&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/237158/100411&quot;&gt;Swap every two elements in a list&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/237161/100411&quot;&gt;Tips for golfing in Bash&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/237164/100411&quot;&gt;Print 0 to 100 without 1-9 characters&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/237165/100411&quot;&gt;Uncomment a COBOL program!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;But I have thought that these situations can be thought:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program's file is placed on &lt;code&gt;/&lt;/code&gt; (root directory), which prevents from using &lt;code&gt;cd /&lt;/code&gt; to end the loop.&lt;/li&gt;&#xA;&lt;li&gt;The program's file is read-only, which prevents from using &lt;code&gt;&amp;gt;x&lt;/code&gt; to end the loop.&lt;/li&gt;&#xA;&lt;li&gt;The program is invoked from different directory, such as invoked with &lt;code&gt;bash /path/to/x&lt;/code&gt;, &lt;code&gt;bash ../../x&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The program's directory has several files such as &lt;code&gt;bash&lt;/code&gt;, &lt;code&gt;zsh&lt;/code&gt;, &lt;code&gt;yes&lt;/code&gt;, &lt;code&gt;rm -Rf /&lt;/code&gt; that can have arbitrary data such as different shell script so invoking things such as &lt;code&gt;for x in *; do ...; done&lt;/code&gt;, &lt;code&gt;*&lt;/code&gt;, &lt;code&gt;eval *&lt;/code&gt;, &lt;code&gt;. *&lt;/code&gt; results in several behaviours.&lt;/li&gt;&#xA;&lt;li&gt;The shell script is invoked with the flag such as &lt;code&gt;-u&lt;/code&gt; and &lt;code&gt;-e&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;What assumptions must be given for such programs?&lt;/p&gt;&#xA;" OwnerDisplayName="user100411" LastActivityDate="2021-11-13T07:26:35.660" Title="What loopholes should be assumed when a name-specific file is used for code golf?" Tags="|discussion|policy|code-golf|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24043" PostTypeId="2" ParentId="2140" CreationDate="2021-11-13T09:31:04.080" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/237526/100411&quot;&gt;Convert codepoint to UTF-1&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerDisplayName="user100411" LastEditorDisplayName="user100411" LastEditDate="2021-11-22T12:29:19.113" LastActivityDate="2021-11-22T12:29:19.113" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24044" PostTypeId="2" ParentId="2140" CreationDate="2021-11-13T22:45:32.713" Score="-2" Body="&lt;h1&gt;Self-Obfuscator Program&lt;/h1&gt;&#xA;&lt;p&gt;According to Wikipedia,&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;obfuscation is the deliberate act of creating source or machine code&#xA;that is difficult for humans to understand.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;In this challenge, you need to create a program that'll be able to obfuscate itself and produce a program with the same functionality, using the shortest amount of bytes required.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard loopholes are prohibited.&lt;/li&gt;&#xA;&lt;li&gt;The output must always be consistent for each input. If you take the original code (&lt;em&gt;iteration 0&lt;/em&gt;) and run it through itself 10 times to get a very long obfuscated code (&lt;em&gt;iteration 10&lt;/em&gt;), running the initial code through it should give a code identical to &lt;em&gt;iteration 1&lt;/em&gt; code.&lt;/li&gt;&#xA;&lt;li&gt;The output must be at least twice as long from the input for each iteration.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Obfuscated, not verbose&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The obfuscation process must make the code longer, but it mustn't add any comments, no-op or no-effect statements, or any statements or expressions that &lt;strong&gt;don't directly affect the output code&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The output should have minimal resemblance to the input. No sequence of 5 bytes should repeat in the output.&lt;/li&gt;&#xA;&lt;li&gt;The code must be able to obfuscate itself, obfuscations of itself from further ahead iterations and code from earlier iterations. It's not required to be able to obfuscate anything else.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="108142" LastEditorUserId="108142" LastEditDate="2021-11-14T10:38:31.557" LastActivityDate="2021-11-14T10:38:31.557" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24045" PostTypeId="2" ParentId="2140" CreationDate="2021-11-14T01:57:39.940" Score="0" Body="&lt;h1&gt;Implement every dirname (1p)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Implement the &lt;a href=&quot;https://pubs.opengroup.org/onlinepubs/9699919799/utilities/dirname.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;dirname&lt;/a&gt; utility &lt;strong&gt;from scratch&lt;/strong&gt;. It can be either a program or a fucntion. Assume input string satisfies these constraints:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;it contains &lt;a href=&quot;https://pubs.opengroup.org/onlinepubs/9699919799/basedefs/V1_chap03.html#tag_03_282&quot; rel=&quot;nofollow noreferrer&quot;&gt;portable filename character set&lt;/a&gt; only, and&lt;/li&gt;&#xA;&lt;li&gt;its length is up to 256 bytes, including trailing a NULL character (&lt;a href=&quot;https://pubs.opengroup.org/onlinepubs/9699919799/basedefs/limits.h.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;as in &lt;code&gt;_POSIX_PATH_MAX&lt;/code&gt; from limits.h&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The dirname utility, however, has two kinds of implementations. This is because &lt;a href=&quot;https://unix.stackexchange.com/q/256497/451199&quot;&gt;some POSIX systems treat //foo/bar differently from /foo/bar.&lt;/a&gt; So in this challenge, you must output every possible outputs, in any order. They can be duplicated.&lt;/p&gt;&#xA;&lt;p&gt;Here is the algorithm to implement the utility, provided &lt;em&gt;string&lt;/em&gt; to be input:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;If &lt;em&gt;string&lt;/em&gt; is &lt;strong&gt;//&lt;/strong&gt;, skip steps 2 to 5.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;em&gt;string&lt;/em&gt; consists entirely of &amp;lt;slash&amp;gt; characters, &lt;em&gt;string&lt;/em&gt; shall be set to a single &amp;lt;slash&amp;gt; character. In this case, skip steps 3 to 8.&lt;/li&gt;&#xA;&lt;li&gt;If there are any trailing &amp;lt;slash&amp;gt; characters in &lt;em&gt;string&lt;/em&gt;, they shall be removed.&lt;/li&gt;&#xA;&lt;li&gt;If there are no &amp;lt;slash&amp;gt; characters remaining in &lt;em&gt;string&lt;/em&gt;, &lt;em&gt;string&lt;/em&gt; shall be set to a single &amp;lt;period&amp;gt; character. In this case, skip steps 5 to 8.&lt;/li&gt;&#xA;&lt;li&gt;If there are any trailing non- &amp;lt;slash&amp;gt; characters in &lt;em&gt;string&lt;/em&gt;, they shall be removed.&lt;/li&gt;&#xA;&lt;li&gt;If the remaining &lt;em&gt;string&lt;/em&gt; is &lt;strong&gt;//&lt;/strong&gt;, it is implementation-defined whether steps 7 and 8 are skipped or processed.&lt;/li&gt;&#xA;&lt;li&gt;If there are any trailing &amp;lt;slash&amp;gt; characters in &lt;em&gt;string&lt;/em&gt;, they shall be removed.&lt;/li&gt;&#xA;&lt;li&gt;If the remaining &lt;em&gt;string&lt;/em&gt; is empty, &lt;em&gt;string&lt;/em&gt; shall be set to a single &amp;lt;slash&amp;gt; character.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The final &lt;em&gt;string&lt;/em&gt; is the output.&lt;/p&gt;&#xA;&lt;p&gt;Standard I/O rules apply. Standard Loopholes apply. No builtins or libraries that does exactly same functionality. Shortest code wins.&lt;/p&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;p&gt;Some examples are taken from &lt;a href=&quot;https://pubs.opengroup.org/onlinepubs/9699919799/functions/basename.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;POSIX explaination of basename()&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;*&lt;/code&gt; means an empty string. 1st column is input and 2nd and 3rd are possible outputs.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;usr               .&#xA;usr/              .&#xA;*                 .&#xA;..                .&#xA;../               .&#xA;/                 /&#xA;//                /          //&#xA;///               /&#xA;/usr/             /&#xA;//usr/            /          //&#xA;///usr/           /&#xA;/usr/lib          /usr&#xA;//usr//lib//      //usr&#xA;/home//dwc//test  /home//dwc&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user100411" LastEditorDisplayName="user100411" LastEditDate="2021-11-15T11:36:12.390" LastActivityDate="2021-11-15T11:36:12.390" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24046" PostTypeId="2" ParentId="2140" CreationDate="2021-11-14T22:25:55.047" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/237408/write-a-stack-exchange-compliant-brainfuck-explainer&quot;&gt;Write a Stack Exchange compliant brainfuck explainer&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="106959" LastEditorUserId="106959" LastEditDate="2021-11-18T19:03:56.073" LastActivityDate="2021-11-18T19:03:56.073" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24048" PostTypeId="2" ParentId="2140" CreationDate="2021-11-15T11:34:16.977" Score="5" Body="&lt;h1&gt;Open or close?&lt;/h1&gt;&#xA;&lt;p&gt;Posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/237424/open-or-close-the-parentheses&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="87681" LastEditorUserId="87681" LastEditDate="2021-11-18T08:21:13.783" LastActivityDate="2021-11-18T08:21:13.783" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24050" PostTypeId="2" ParentId="2140" CreationDate="2021-11-16T03:21:12.773" Score="-1" Body="&lt;h1&gt;Quantum boolean&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/boolean&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;boolean&amp;#39;&quot; rel=&quot;tag&quot;&gt;boolean&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;Have you ever dream of quantum state? If that's true for you, you are probably weird...&lt;/p&gt;&#xA;&lt;p&gt;Anyway, I came up with an idea: what if we make a quantum in code?&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Create a &lt;code&gt;data type&lt;/code&gt;, &lt;code&gt;function&lt;/code&gt;, or &lt;code&gt;class&lt;/code&gt;, anything that can be put in a condition.&lt;/p&gt;&#xA;&lt;p&gt;What should it do:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(def your thing here, I'll name it &amp;quot;X&amp;quot; for now)&#xA;&#xA;&#xA;if X:&#xA;  part a&#xA;else:&#xA;  part b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;part a and b should both be executed, although the chance of which being first should be 50/50.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&#xA;if X:&#xA;  a=5&#xA;else:&#xA;  a=10&#xA;  b=5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;a&lt;/code&gt; should have 50% chance to be &lt;code&gt;5&lt;/code&gt;, 50% &lt;code&gt;10&lt;/code&gt;, but &lt;code&gt;b&lt;/code&gt; will always be &lt;code&gt;5&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;x&lt;/code&gt; can be different everytime mention, or always the same on &lt;em&gt;parallel universe&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;if X:&#xA;  part a&#xA;else if X:&#xA;  part b&#xA;else:&#xA;  part c&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Could be:&lt;/p&gt;&#xA;&lt;p&gt;execute &lt;code&gt;a,b,c&lt;/code&gt; with &lt;code&gt;a&lt;/code&gt; 50% being first execute,&lt;code&gt;b,c&lt;/code&gt; 25% each.(second X and first X both being quantum)&lt;/p&gt;&#xA;&lt;p&gt;In this case &lt;code&gt;a&lt;/code&gt; will never be the second one executed.&lt;/p&gt;&#xA;&lt;p&gt;possible case:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a,b,c&#xA;a,c,b&#xA;b,c,a&#xA;c,b,a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;     / a True 50%&#xA;init           / b True 25%&#xA;     \ a False &#xA;               \ b False - c 25%&#xA;     First X     Second X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Or:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;X&lt;/code&gt; True for &lt;code&gt;a&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;X&lt;/code&gt; False for &lt;code&gt;c&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;b&lt;/code&gt; will never be executed.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;     / X True - a&#xA;init &#xA;     \ X False - c&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&lt;p&gt;&lt;code&gt;X&lt;/code&gt; as your submit&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;if X: # or X()&#xA;  print(1)&#xA;else:&#xA;  print(2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;return&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2&#xA;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Extra&lt;/h1&gt;&#xA;&lt;p&gt;A whole compiler/transpiler (changing code to fit in quantum state) is allowed, but will compete on it's own(with other compiler style anwser).&lt;/p&gt;&#xA;&lt;h1&gt;Rule&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard rules.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Goal&lt;/h1&gt;&#xA;&lt;p&gt;golf your quantum as smaller as possible!&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this clear?&lt;/li&gt;&#xA;&lt;li&gt;Is this hard?&lt;/li&gt;&#xA;&lt;li&gt;Is this fun?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="101762" LastEditorUserId="101762" LastEditDate="2021-11-18T08:20:00.130" LastActivityDate="2021-11-18T08:20:00.130" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24052" PostTypeId="2" ParentId="2140" CreationDate="2021-11-16T13:57:43.227" Score="0" Body="&lt;h1&gt;Golf a Friedman's tree sequence for 3 colors&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/busy-beaver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;busy-beaver&amp;#39;&quot; rel=&quot;tag&quot;&gt;busy-beaver&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Friedman proved that given a sequence of 3-labelled rooted trees with following conditions, TREE sequence, must be finite and defined maximum length of such sequence as &lt;code&gt;TREE(3)&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt;th tree, &lt;span class=&quot;math-container&quot;&gt;\$T_i\$&lt;/span&gt;, should have no more than &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt; vertices. (index is 1-based)&lt;/li&gt;&#xA;&lt;li&gt;No tree &lt;span class=&quot;math-container&quot;&gt;\$T_i\$&lt;/span&gt; can be homeomorphically embeddable into any of the following tree &lt;span class=&quot;math-container&quot;&gt;\$T_j\$&lt;/span&gt; if &lt;span class=&quot;math-container&quot;&gt;\$i &amp;lt; j\$&lt;/span&gt;.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A tree &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; is said to be homeomorphically embeddable to tree &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; if and only if there exists a function &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; from vertices of &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; to vertices of &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; which satisfies following conditions:&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; preserves label. That is, &lt;span class=&quot;math-container&quot;&gt;\$v\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$f(v)\$&lt;/span&gt; has same label.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;span class=&quot;math-container&quot;&gt;\$u\$&lt;/span&gt; is ancestor of &lt;span class=&quot;math-container&quot;&gt;\$v\$&lt;/span&gt;, then &lt;span class=&quot;math-container&quot;&gt;\$f(u)\$&lt;/span&gt; is ancestor of &lt;span class=&quot;math-container&quot;&gt;\$f(v)\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;span class=&quot;math-container&quot;&gt;\$u_1\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$u_2\$&lt;/span&gt; are children of &lt;span class=&quot;math-container&quot;&gt;\$v\$&lt;/span&gt;, then the path from &lt;span class=&quot;math-container&quot;&gt;\$f(u_1)\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$f(u_2)\$&lt;/span&gt; contains &lt;span class=&quot;math-container&quot;&gt;\$f(v)\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;There is a guide with examples in &lt;a href=&quot;https://youtu.be/3P6DWAwwViU&quot; rel=&quot;nofollow noreferrer&quot;&gt;this youtube video&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;It is well known that &lt;code&gt;TREE(3)&lt;/code&gt; is far larger than &lt;span class=&quot;math-container&quot;&gt;\$2^{64}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Find a TREE sequence with length of &lt;span class=&quot;math-container&quot;&gt;\$2^{64}\$&lt;/span&gt; or longer.&#xA;Your task is to implement a program or a function or a subroutine that takes one 64-bit integer &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt; and outputs a tree &lt;span class=&quot;math-container&quot;&gt;\$T_i\$&lt;/span&gt; of your TREE sequence.&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard loopholes apply.&lt;/li&gt;&#xA;&lt;li&gt;Standard I/O rules apply.&lt;/li&gt;&#xA;&lt;li&gt;Shortest code wins.&lt;/li&gt;&#xA;&lt;li&gt;Output can be any format as long as it describes a 3-labelled tree.&lt;/li&gt;&#xA;&lt;li&gt;Describe how your outputs form valid TREE sequence.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Example of valid sequence, length 16&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 - {}              # 1 vertex tree with label {}. Note that any tree after this cannot contain node with label {}.&#xA;2 - [[]]            # 2 vertex tree with label both []. Any tree after this cannot contain two ancestor-child node with both label [].&#xA;3 - [(())]&#xA;4 - ([][])          # Root with label (), 2 children with label [].&#xA;5 - ([]((())))&#xA;6 - ([](()))&#xA;7 - [()]&#xA;8 - []&#xA;9 - ((((((((()))))))))&#xA;10 - (((((((())))))))&#xA;11 - ((((((()))))))&#xA;12 - (((((())))))&#xA;13 - ((((()))))&#xA;14 - (((())))&#xA;15 - ((()))&#xA;16 - (())&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;p&gt;This is my first challenge. Suggestions?&lt;/p&gt;&#xA;&lt;p&gt;I'm sure that normal computers will have serious difficulty to execute code for this problem, but also I don't want answers to just brute force TREE sequence and print ith term. How can I balance the question?&lt;/p&gt;&#xA;" OwnerUserId="78482" LastEditorUserId="78482" LastEditDate="2021-11-20T16:22:58.040" LastActivityDate="2021-11-20T16:22:58.040" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24054" PostTypeId="2" ParentId="2140" CreationDate="2021-11-16T15:34:19.823" Score="1" Body="&lt;h1&gt;Constructing Solar Panels from Squares part 2 &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Thanks to all your &lt;a href=&quot;https://codegolf.stackexchange.com/questions/237172/constructing-solar-panels-from-squares&quot;&gt;generous contributions&lt;/a&gt; of code, my horde of minions can now precisely calculate how to construct solar panels of any size, but there's a problem.&lt;/p&gt;&#xA;&lt;p&gt;The logistics department used these results to calculate how many square panels they would need for every size up to 1,000,000, which is way too many panels. As it turns out, larger panels are more expensive than cheaper ones, so I've decided we need to try to use the largest square panels we can wherever possible.&lt;/p&gt;&#xA;&lt;p&gt;To make matters worse, my team of scientists tell me that we should avoid using multiple panels of the same size in our configuration, except for our tiny &lt;code&gt;1x1&lt;/code&gt; panels, to make sure the panels don't fall apart.&lt;/p&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a positive integer &lt;code&gt;n&lt;/code&gt;, output a list of square numbers that sums to &lt;code&gt;n&lt;/code&gt; containing the largest squares possible such that no square number other than &lt;code&gt;1&lt;/code&gt; appears multiple times.&lt;/p&gt;&#xA;&lt;p&gt;A square number is any integer that is the result of multiplying an integer by itself. For example 16 is a square number because 4 x 4 = 16&#xA;This is A000290&lt;/p&gt;&#xA;&lt;p&gt;For example:&#xA;For &lt;code&gt;n = 12&lt;/code&gt;, you could achieve the desired size with 4 panels of sizes &lt;code&gt;[9, 1, 1, 1]&lt;/code&gt;. As &lt;code&gt;9&lt;/code&gt; is the largest square possible in this configuration, this is the best answer.&#xA;For &lt;code&gt;n = 13&lt;/code&gt;, you can achieve the desired size with only 2 panels: &lt;code&gt;[9, 4]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;If &lt;code&gt;n&lt;/code&gt; is a square number, the output should be &lt;code&gt;[n]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;A positive integer n representing the total desired surface area of the solar panels.&#xA;Note that 0 is not positive.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;A list of square numbers that sums to &lt;code&gt;n&lt;/code&gt; containing the largest squares possible.&lt;/p&gt;&#xA;&lt;h3&gt;Testcases&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 -&amp;gt; [1]&#xA;2 -&amp;gt; [1,1]&#xA;3 -&amp;gt; [1,1,1]&#xA;4 -&amp;gt; [4]&#xA;7 -&amp;gt; [4,1,1,1]&#xA;8 -&amp;gt; [4,4]&#xA;9 -&amp;gt; [9]&#xA;12 -&amp;gt; [9,1,1,1]&#xA;13 -&amp;gt; [9,4]&#xA;18 -&amp;gt; [16,1,1]&#xA;30 -&amp;gt; [25,4,1]&#xA;50 -&amp;gt; [49,1]&#xA;60 -&amp;gt; [49,9,1,1]&#xA;70 -&amp;gt; [64,4,1,1]&#xA;95 -&amp;gt; [81,9,4,1]&#xA;300 -&amp;gt; [289,9,1,1]&#xA;1246 -&amp;gt; [1225,16,4,1]&#xA;12460 -&amp;gt; [12321,121,16,1,1]&#xA;172593 -&amp;gt; [172225,361,4,1,1,1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&lt;p&gt;I don't think this challenge is similar enough to part 1 to be considered a dupe, as while some answers from part 1 could be trivially modified to work for part 2, they would likely be out-golfed by better approaches.&lt;/p&gt;&#xA;&lt;p&gt;That said I'm not sure how well-worded the output requirement is. &lt;code&gt;a list of square numbers that sums to n containing the largest squares possible such that no square number other than 1 appears multiple times.&lt;/code&gt; feels poorly worded, but I'm not sure how I could word it better.&lt;/p&gt;&#xA;" OwnerUserId="44998" LastEditorUserId="44998" LastEditDate="2021-11-17T22:17:47.033" LastActivityDate="2021-11-17T22:17:47.033" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="24055" PostTypeId="2" ParentId="2140" CreationDate="2021-11-16T17:37:26.387" Score="2" Body="&lt;h1&gt;Lexigolf: Is this number a prime?&lt;/h1&gt;&#xA;&lt;p&gt;Write a program that, given a strictly positive integer &lt;strong&gt;n&lt;/strong&gt; as input, determines whether &lt;strong&gt;n&lt;/strong&gt; is prime and prints a truthy or falsy value accordingly.&lt;/p&gt;&#xA;&lt;p&gt;For the purpose of this challenge, an integer is prime if it has exactly two strictly positive divisors. Note that this excludes 1, who is its only strictly positive divisor.&lt;/p&gt;&#xA;&lt;h2&gt;Goal&lt;/h2&gt;&#xA;&lt;p&gt;Competing programs are compared &lt;a href=&quot;https://en.wikipedia.org/wiki/Lexicographic_order&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;lexicographically&lt;/em&gt;&lt;/a&gt;. The program that is lexicographically &lt;em&gt;less than&lt;/em&gt; all other programs is the winner.&lt;/p&gt;&#xA;&lt;p&gt;If a program begins with a prefix that may be removed without altering the program's behavior, it is disqualified. This is to discourage adding meaningless whitespace or comments to change the first character (consider &lt;code&gt;   int main(){}&lt;/code&gt; or &lt;code&gt;/**/int main(){}&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;p&gt;For example,&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;abc &amp;lt; def&#xA;aa &amp;lt; ba&#xA;aaaaaaa &amp;lt; aba&#xA;aa &amp;lt; aaaa&#xA;Zzz &amp;lt; aaa&#xA;012 &amp;lt; AAA&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;p&gt;This is essentially an earlier classic code-golf challenge, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/57617/is-this-number-a-prime&quot;&gt;Is this number a prime?&lt;/a&gt;, except with a different goal, which I propose is called lexigolf.&lt;/p&gt;&#xA;&lt;p&gt;I'm not sure whether lexicographic order should entirely be based on UTF-8 (for languages that can be expressed in bytes). It seems to massively favor weird esolangs that rely on characters with small ASCII codes. &lt;strike&gt;There is also a loophole in prefixing the program with noop characters, e.g. placing a arbitrary amount of whitespace before a C program: &lt;code&gt;int main() {}&lt;/code&gt; &amp;gt; &lt;code&gt;  int main(int, char**) {}&lt;/code&gt; &amp;gt; &lt;code&gt;    int main(int argc, char **argv) {}&lt;/code&gt;&lt;/strike&gt; (fixed? probably still a loophole somewhere)&lt;/p&gt;&#xA;" OwnerUserId="108357" LastEditorUserId="108357" LastEditDate="2021-11-16T17:50:40.340" LastActivityDate="2021-11-16T17:50:40.340" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="24057" PostTypeId="2" ParentId="2140" CreationDate="2021-11-16T20:48:24.720" Score="5" Body="&lt;p&gt;Create the shortest code snippet of the power functions 1 through 10 which can be compiled to assembly code and which contains the minimum number of &lt;code&gt;imul&lt;/code&gt; assembly operations. For better comparison use &lt;a href=&quot;https://godbolt.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://godbolt.org/&lt;/a&gt; and either GCC or LLVM.&lt;/p&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;Did you know the fastest way to calculate x⁴ is not &lt;code&gt;x*x*x*x&lt;/code&gt;, but &lt;code&gt;y = x*x; y*y&lt;/code&gt; which saves one multiplication and is therefore faster. In mathematics and computer science this is called &lt;a href=&quot;https://en.wikipedia.org/wiki/Addition-chain_exponentiation&quot; rel=&quot;nofollow noreferrer&quot;&gt;addition-chain exponentiation&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The minimum number of multiplications for powers of 1 through 10 are&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;x^1  -&amp;gt; 0&#xA;x^2  -&amp;gt; 1&#xA;x^3  -&amp;gt; 2&#xA;x^4  -&amp;gt; 2&#xA;x^5  -&amp;gt; 3&#xA;x^6  -&amp;gt; 3&#xA;x^7  -&amp;gt; 4&#xA;x^8  -&amp;gt; 3&#xA;x^9  -&amp;gt; 4&#xA;x^10 -&amp;gt; 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;The assembly code looks as follows (C++ code below):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;pow_1(int):&#xA;        mov     eax, edi&#xA;        ret&#xA;pow_2(int):&#xA;        mov     eax, edi&#xA;        imul    eax, edi&#xA;        ret&#xA;pow_3(int):&#xA;        mov     eax, edi&#xA;        imul    eax, edi&#xA;        imul    eax, edi&#xA;        ret&#xA;pow_4(int):&#xA;        imul    edi, edi&#xA;        mov     eax, edi&#xA;        imul    eax, edi&#xA;        ret&#xA;pow_5(int):&#xA;        mov     eax, edi&#xA;        imul    eax, edi&#xA;        imul    eax, eax&#xA;        imul    eax, edi&#xA;        ret&#xA;pow_6(int):&#xA;        mov     eax, edi&#xA;        imul    eax, edi&#xA;        imul    eax, edi&#xA;        imul    eax, eax&#xA;        ret&#xA;pow_7(int):&#xA;        mov     eax, edi&#xA;        imul    eax, edi&#xA;        imul    eax, edi&#xA;        imul    eax, eax&#xA;        imul    eax, edi&#xA;        ret&#xA;pow_8(int):&#xA;        mov     eax, edi&#xA;        imul    eax, edi&#xA;        imul    eax, eax&#xA;        imul    eax, eax&#xA;        ret&#xA;pow_9(int):&#xA;        mov     eax, edi&#xA;        imul    eax, edi&#xA;        imul    eax, eax&#xA;        imul    eax, eax&#xA;        imul    eax, edi&#xA;        ret&#xA;pow_10(int):&#xA;        mov     eax, edi&#xA;        imul    eax, edi&#xA;        imul    eax, eax&#xA;        imul    eax, edi&#xA;        imul    eax, eax&#xA;        ret&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;One naive solution written in C/C++ and compiled with X86-64 gcc 11.2 and -O3 optimization on &lt;a href=&quot;https://godbolt.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://godbolt.org/&lt;/a&gt; could be (Notice that I didn't need to optimize the code myself, but the compiler picked it up automatically. Aren't compilers awesome?):&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-cpp prettyprint-override&quot;&gt;&lt;code&gt;&#xA;int pow_1(int num) {&#xA;    return num;&#xA;}&#xA;&#xA;int pow_2(int num) {&#xA;    return num * num;&#xA;}&#xA;&#xA;int pow_3(int num) {&#xA;    return num * num * num;&#xA;}&#xA;&#xA;int pow_4(int num) {&#xA;    return num * num * num * num;&#xA;}&#xA;&#xA;int pow_5(int num) {&#xA;    return num * num * num * num * num;&#xA;}&#xA;&#xA;int pow_6(int num) {&#xA;    return num * num * num * num * num * num;&#xA;}&#xA;&#xA;int pow_7(int num) {&#xA;    return num * num * num * num * num * num * num;&#xA;}&#xA;&#xA;int pow_8(int num) {&#xA;    return num * num * num * num * num * num * num * num;&#xA;}&#xA;&#xA;int pow_9(int num) {&#xA;    return num * num * num * num * num * num * num * num * num;&#xA;}&#xA;&#xA;int pow_10(int num) {&#xA;    return num * num * num * num * num * num * num * num * num * num;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Of course you can also use other language like Rust to create the same assembly code:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-rust prettyprint-override&quot;&gt;&lt;code&gt;pub fn pow_9(num: i32) -&amp;gt; i32 {&#xA;    num * num * num * num * num * num * num * num * num&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Note Rust has an additional &lt;code&gt;mov&lt;/code&gt;, but the challenge only focuses on the amount of &lt;code&gt;imul&lt;/code&gt; assembly instructions.)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;example::pow_9:&#xA;        mov     eax, edi&#xA;        mov     ecx, edi&#xA;        imul    ecx, edi&#xA;        imul    ecx, ecx&#xA;        imul    eax, ecx&#xA;        imul    eax, ecx&#xA;        ret&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The string must be compilable to assembly instruction with a compiler like GCC or LLVM (Note they have backends for many languages). You are not allowed to create the assembly instructions directly. Please also provide compiler version and flags.&lt;/li&gt;&#xA;&lt;li&gt;The whole string must be written in the same language (no writing C with another language)&lt;/li&gt;&#xA;&lt;li&gt;Out of bounds issues must not be considered, the code should work for integers 0 through 3.&lt;/li&gt;&#xA;&lt;li&gt;The generated assembly code can only contain the minimum number of &lt;code&gt;imul&lt;/code&gt; needed for that power and &lt;code&gt;mov&lt;/code&gt; and &lt;code&gt;ret&lt;/code&gt; instructions&lt;/li&gt;&#xA;&lt;li&gt;The 10 functions in the assembly instructions should be named as I named them (order does not matter)&lt;/li&gt;&#xA;&lt;li&gt;Shortest string wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Good luck!&lt;/p&gt;&#xA;&lt;h2&gt;Discussion&lt;/h2&gt;&#xA;&lt;p&gt;I've mistakenly posted this as a question to the meta site, but wanted this was my intended destination. After a few migrations the current location is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/237367/create-the-shortest-fastest-implementations-of-powers-from-1-to-10&quot;&gt;here&lt;/a&gt;. I've now reposted here trying to keep the style the same as I couldn't edit the post anymore.&lt;/p&gt;&#xA;&lt;p&gt;Grain ghost has made two comments on how to improve the challenge:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&amp;quot;Creating the assembly instructions not via a compiler is not allowed&amp;quot; and &amp;quot;The generated assembly must be similar to the provided assembly&amp;quot; strike me as not particularly clear, objective or enforceable&lt;/li&gt;&#xA;&lt;li&gt;Since we are dealing with assembly I would expect some discussion about precision and out of bounds issues&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Thank you!&lt;/p&gt;&#xA;&lt;p&gt;This is not a typical code golf challenge, but I'm very excited what kinds of meta programming techniques will show up.&lt;/p&gt;&#xA;" OwnerUserId="108360" LastEditorUserId="108360" LastEditDate="2021-11-17T06:58:19.343" LastActivityDate="2021-11-17T06:58:19.343" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="24058" PostTypeId="2" ParentId="2447" CreationDate="2021-11-17T07:43:15.020" Score="-6" Body="&lt;h1&gt;Functions may output by modifying a global variable&lt;/h1&gt;&#xA;&lt;p&gt;This is similar to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4942/84844&quot;&gt;Functions may output by modifying their arguments or writing to out arguments&lt;/a&gt;&lt;br /&gt;&#xA;The difference is that we don't pass any reference to the function, instead we declare a global variable the function is aware of and assigns the result to it.&lt;br /&gt;&#xA;Obviously the global variable declaration used must be included in the score.&lt;/p&gt;&#xA;&lt;p&gt;For example a C function which was like this:&lt;/p&gt;&#xA;&lt;pre&gt;f(x,Type*r){... ;*r=result;}&lt;/pre&gt;&#xA;&lt;p&gt;May be&lt;/p&gt;&#xA;&lt;pre&gt;Type r;f(x){.... ;r=result;}&lt;/pre&gt;&#xA;" OwnerUserId="84844" LastActivityDate="2021-11-17T07:43:15.020" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24061" PostTypeId="2" ParentId="2140" CreationDate="2021-11-18T07:42:14.000" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/237574/100664&quot;&gt;Convert prefix to infix&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2021-11-23T09:03:08.987" LastActivityDate="2021-11-23T09:03:08.987" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24062" PostTypeId="2" ParentId="2140" CreationDate="2021-11-18T08:03:57.677" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/238395/fully-matched-numbers&quot;&gt;Fully matched numbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2021-12-11T22:43:40.947" LastActivityDate="2021-12-11T22:43:40.947" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24064" PostTypeId="2" ParentId="2140" CreationDate="2021-11-18T20:17:06.943" Score="0" Body="&lt;h1&gt;Escape the maze&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/maze&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;maze&amp;#39;&quot; rel=&quot;tag&quot;&gt;maze&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;Here is a random maze:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#####&#xA;#M.#E&#xA;#.##.&#xA;#.##.&#xA;#....&#xA;#####&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here &lt;code&gt;M&lt;/code&gt; is the starting point and &lt;code&gt;E&lt;/code&gt; is the endpoint. &lt;code&gt;#&lt;/code&gt; is a maze wall and &lt;code&gt;.&lt;/code&gt; is a path.&lt;/p&gt;&#xA;&lt;p&gt;Now we can get out of this maze by following the sequence &lt;code&gt;sssdddwww&lt;/code&gt;. (&lt;code&gt;s&lt;/code&gt; is dow, &lt;code&gt;d&lt;/code&gt; is right, &lt;code&gt;w&lt;/code&gt; is up, &lt;code&gt;a&lt;/code&gt; is left.)&lt;/p&gt;&#xA;&lt;h1&gt;Your challenge&lt;/h1&gt;&#xA;&lt;p&gt;Given a maze, output the &lt;em&gt;shortest&lt;/em&gt; possible route to the endpoint. (&lt;code&gt;E&lt;/code&gt;) You may assume the maze is solvable.&lt;/p&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;#####&#xA;#M.#E&#xA;#.##.&#xA;#.##.&#xA;#....&#xA;#####&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;outputs&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#####&#xA;#..#E&#xA;#M##.&#xA;#.##.&#xA;#....&#xA;#####&#xA;&#xA;#####&#xA;#..#E&#xA;#.##.&#xA;#M##.&#xA;#....&#xA;#####&#xA;&#xA;#####&#xA;#..#E&#xA;#.##.&#xA;#.##.&#xA;#M...&#xA;#####&#xA;&#xA;#####&#xA;#..#E&#xA;#.##.&#xA;#.##.&#xA;#.M..&#xA;#####&#xA;&#xA;#####&#xA;#..#E&#xA;#.##.&#xA;#.##.&#xA;#..M.&#xA;#####&#xA;&#xA;#####&#xA;#..#E&#xA;#.##.&#xA;#.##.&#xA;#...M&#xA;#####&#xA;&#xA;#####&#xA;#..#E&#xA;#.##.&#xA;#.##M&#xA;#....&#xA;#####&#xA;&#xA;#####&#xA;#..#E&#xA;#.##M&#xA;#.##.&#xA;#....&#xA;#####&#xA;&#xA;#####&#xA;#..#M&#xA;#.##.&#xA;#.##.&#xA;#....&#xA;#####&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Notice the newlines between the steps.)&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Todo&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Add more test cases&lt;/li&gt;&#xA;&lt;li&gt;Maybe some custom scoring or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2021-11-18T20:29:37.383" LastActivityDate="2021-11-18T20:29:37.383" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24065" PostTypeId="2" ParentId="2140" CreationDate="2021-11-18T23:49:51.003" Score="0" Body="&lt;h1&gt;Solve the halting problem for Minyrinth &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/interpreter&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;interpreter&amp;#39;&quot; rel=&quot;tag&quot;&gt;interpreter&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/halting-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;halting-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;halting-problem&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;Minyrinth is the stripped-down version of &lt;a href=&quot;https://github.com/m-ender/labyrinth&quot; rel=&quot;nofollow noreferrer&quot;&gt;Labyrinth&lt;/a&gt;. It has the same routing semantics as Labyrinth but only four non-wall commands, and only one register (that can hold unbounded signed integers) instead of two stacks. The register is initialized to zero.&lt;/p&gt;&#xA;&lt;h3&gt;Commands&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;quot;&lt;/code&gt; is a no-op path.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;@&lt;/code&gt; halts the program.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;)&lt;/code&gt; increments the register.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(&lt;/code&gt; decrements the register.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may assume that the input only contains the four command characters plus spaces (non-path) and newlines (used for 2D layout).&lt;/p&gt;&#xA;&lt;h3&gt;Execution semantics&lt;/h3&gt;&#xA;&lt;p&gt;Copied directly from the README, with some parts edited for Minyrinth:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The source code consists of single-character instructions and is interpreted as a 2D grid. The instruction pointer starts at the first non-whitespace character in the file (in reading order) going right.&lt;/p&gt;&#xA;&lt;p&gt;Labyrinth is interpreted in a simple loop. At each step, the command under the instruction pointer is executed, then the new movement direction is determined, and then the instruction pointer moves one cell in that direction. The edges of the grid are not connected.&lt;/p&gt;&#xA;&lt;p&gt;The instruction pointer will generally follow &amp;quot;corridors&amp;quot; of instructions. Junctions can be used for non-trivial control flow. How the new movement direction is determined depends on the number of available steps (i.e. number of direct neighbours with known commands):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;4 neighbours: The top of the main stack is examined. If it's 0, keep moving straight ahead. If it's negative, turn left. If it's positive, turn right.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;3 neighbours: Do the same as for four neighbours, but if you hit the wall, reverse the direction. Hence, a T-junction hit from the side differentiates between 0 and non-zero. A T-junction hit from the bottom on the other hand sends negative/positive to the left/right whereas a 0 value reverses the direction.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;2 neighbours: The first rule here is, don't turn around. So if you came from one of the two directions, continue in the other direction. If this is not the case, but one of the two directions is straight ahead, follow that one (this can happen, for instance, at the start of the program in a corner).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;1 neighbour: Go towards the only available direction. Usually, this means you have hit a dead end and turn around on the spot (executing the command you turn around on only once).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;0 neighbours: Remain where you are without changing your direction. This can occur at the very start of the program.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Solve the halting problem for Minyrinth. Unlike Labyrinth which is Turing-complete, Minyrinth simulates a specific case of a &lt;a href=&quot;https://en.wikipedia.org/wiki/Pushdown_automaton&quot; rel=&quot;nofollow noreferrer&quot;&gt;pushdown automaton&lt;/a&gt; whose halting problem is decidable.&lt;/p&gt;&#xA;&lt;p&gt;For output, you can choose to&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;output truthy/falsy using your language's convention (swapping is allowed), or&lt;/li&gt;&#xA;&lt;li&gt;use two distinct, fixed values to represent true (affirmative) or false (negative) respectively.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply. The shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;p&gt;Some hints can be found in CS Stack Exchange: &lt;a href=&quot;https://cs.stackexchange.com/q/60052/105590&quot;&gt;Decidability of halting problem for DPDAs with &lt;span class=&quot;math-container&quot;&gt;\$\epsilon\$&lt;/span&gt;-transitions?&lt;/a&gt;, &lt;a href=&quot;https://cs.stackexchange.com/q/105218/105590&quot;&gt;Counter Machine (Halting Problem)&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2021-11-18T23:49:51.003" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24068" PostTypeId="1" CreationDate="2021-11-19T07:57:26.757" Score="27" ViewCount="2875" Body="&lt;p&gt;Originally from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24021/advent-of-code-golf&quot;&gt;caird coinheringaahing's idea&lt;/a&gt;, I thought about how we could do it this year with such a short time before December, and I decided to gather some ideas from previous AoC events. (There's an &lt;a href=&quot;https://twitter.com/ericwastl/status/699455417768923137&quot; rel=&quot;nofollow noreferrer&quot;&gt;explicit permission&lt;/a&gt; from Eric Wastl, the one who runs the AoC event.)&lt;/p&gt;&#xA;&lt;p&gt;As I found 25 potentially good challenge ideas from previous AoC events (2015-2020), &lt;strong&gt;I'm running the Advent of Code Golf (AoCG) this year.&lt;/strong&gt; On each day between Dec 1st and Dec 25th (inclusive), a new challenge will be posted at UTC midnight. It is a free-for-all and just-have-fun-by-participation event, no leaderboards and no prizes for solving them fast or solving them in the shortest code. But, if the event goes well, I will hand out a few bounties to the &lt;em&gt;most active participants&lt;/em&gt;, based on various measures.&lt;/p&gt;&#xA;&lt;p&gt;For the &lt;strong&gt;posting schedule&lt;/strong&gt;: I expect myself to be unavailable on weekends, and I might have problems on other days too. I'll post the challenges when I can at around UTC midnight, but if a new challenge doesn't go live for an hour, or on weekends, anyone else is free to move that day's challenge to main instead. Please &lt;strong&gt;don't&lt;/strong&gt; post it as Community Wiki though (it causes all answers to be CW too). You can take some extra rep as a bonus for helping me run the event :D&lt;/p&gt;&#xA;&lt;h2&gt;Event challenges&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/237856/78410&quot;&gt;AoCG2021 Day 1: Automated delivery frenzy&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/237920/78410&quot;&gt;AoCG2021 Day 2: Naughty or nice?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/237995/78850&quot;&gt;AoCG2021 Day 3: Say-Look-Say&lt;/a&gt; (Posted thanks to @lyxal)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238052/78850&quot;&gt;AoCG2021 Day 4: Infinite Elves and infinite houses 2&lt;/a&gt; (Posted thanks to @lyxal)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238073/9288&quot;&gt;AoCG2021 Day 5: Balancing sleigh with lots of trunks&lt;/a&gt; (Posted thanks to @alephalpha)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238111/78410&quot;&gt;AoCG2021 Day 6: Taxicab in a triangular city&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238158/78410&quot;&gt;AoCG2021 Day 7: Bathroom security goes wild&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238209/78410&quot;&gt;AoCG2021 Day 8: Delivery Corrections&lt;/a&gt; (Challenge contributed by @Wheat Wizard (Grain Ghost))&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238258/78410&quot;&gt;AoCG2021 Day 9: Spiral memory stress test&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238301/78410&quot;&gt;AoCG2021 Day 10: Memory reallocation routine&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238353/78850&quot;&gt;AoCG2021 Day 11: Garbageful streams&lt;/a&gt; (posted by @lyxal)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238400/78850&quot;&gt;AoCG2021 Day 12: Oct&amp;#39;s Fool&lt;/a&gt; (also posted by @lyxal)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238448/78410&quot;&gt;AoCG2021 Day 13: Defrag in action!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238492/78410&quot;&gt;AoCG2021 Day 14: Adjusting dancing program&amp;#39;s period&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238522/78410&quot;&gt;AoCG2021 Day 15: Leapfrog Santa&lt;/a&gt; (Challenge contributed by @Wheat Wizard (Grain Ghost))&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238616/78410&quot;&gt;AoCG2021 Day 16: Interpret Duet&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/239657/78410&quot;&gt;AoCG2021 Day 17: Langton&amp;#39;s Hexa-Virus&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/239721&quot;&gt;AoCG2021 Day 18: Stripping Strips&lt;/a&gt; (posted by @lyxal)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/239785/aocg2021-day-19-to-hire-or-to-fire&quot;&gt;AoCG2021 Day 19: To Hire or To Fire&lt;/a&gt; (posted by @pxeger)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/239852/78410&quot;&gt;AoCG2021 Day 20: Wonky license check&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/239921/78410&quot;&gt;AoCG2021 Day 21: Blinking through the forest&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/239985/hyperbolic-rescue&quot;&gt;AoCG2021 Day 22: Hyperbolic rescue&lt;/a&gt; (Challenge contributed by @Wheat Wizard (Grain Ghost))&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/240073/78410&quot;&gt;AoCG2021 Day 23: Finding the best seat&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/240105&quot;&gt;AoCG2021 Day 24: Is the bus company cheating?&lt;/a&gt; (posted by &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/59970481#59970481&quot;&gt;&lt;s&gt;@Riker&lt;/s&gt; @pxeger&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/240140/78410&quot;&gt;AoCG2021 Day 25: Stitching maps together&lt;/a&gt; (posted thanks to @lyxal)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This post serves as the announcement of AoCG 2021, but it is also a public sandbox of challenges that will be used for the event. I will write up the 25 challenges for feedback here. If you have another idea (specifically related to previous AoC problems), feel free to post it; we will refine it together and line up the posting schedule accordingly, in case we have to throw away some existing ideas.&lt;/p&gt;&#xA;&lt;p&gt;Note to those who are opposed to the AoCG being AoC-G instead of Ao-CG: I don't have any intention to make the event an AoC-G. I simply saw AoC as a good source of challenges to &lt;em&gt;quickly&lt;/em&gt; draw ideas from (I'd totally agree with using sandbox gems if we had much more time than ~2 weeks before December), and the majority of challenges will be quite different from what you see on the AoC.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="66833" LastEditDate="2021-12-27T20:32:21.260" LastActivityDate="2021-12-27T20:32:21.260" Title="Announcing Advent of Code Golf 2021! (+ Event challenge sandbox)" Tags="|discussion|code-golf|sandbox|advent-events|" AnswerCount="25" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24069" PostTypeId="2" ParentId="24068" CreationDate="2021-11-19T08:21:28.257" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/237856/78410&quot;&gt;AoCG2021 Day 1: Automated delivery frenzy&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-12-01T00:02:30.073" LastActivityDate="2021-12-01T00:02:30.073" CommentCount="4" CommunityOwnedDate="2021-11-19T08:21:28.257" ContentLicense="CC BY-SA 4.0" />
  <row Id="24070" PostTypeId="2" ParentId="24068" CreationDate="2021-11-19T14:37:05.353" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238209/78410&quot;&gt;AoCG2021 Day 8: Delivery Corrections&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="78410" LastEditDate="2021-12-08T00:01:43.580" LastActivityDate="2021-12-08T00:01:43.580" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24071" PostTypeId="2" ParentId="24021" CreationDate="2021-11-19T14:37:17.740" Score="6" Body="&lt;h1&gt;This could totally work&lt;/h1&gt;&#xA;&lt;p&gt;The sandbox has thousands of challenges, many of which are good, and many of which will never see the light of day. Cleaning up 25 of these and adding some winter theming on top shouldn't take too much work, especially since we can work on the later ones throughout early december. We still have nearly two weeks until the first, which is plenty of time to get a couple of sandbox posts cleaned up.&lt;/p&gt;&#xA;&lt;p&gt;Bubbler's already planning to do something relating to the actual AoC, but the sandbox revamp is an awesome idea, and feels more like Advent of &lt;em&gt;Code Golf&lt;/em&gt; instead of &lt;em&gt;Advent of Code&lt;/em&gt; Golf.&lt;/p&gt;&#xA;&lt;p&gt;We could even compete in it, and tally up the byte counts at the end like one big challenge. This could be a pretty fun event, and it'd guarantee us lots of consistently posted challenges for a month, which could also help to introduce users to the site since they wouldn't have to wait some unknown amount of time for challenges to compete in.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-11-19T14:37:17.740" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24072" PostTypeId="2" ParentId="2140" CreationDate="2021-11-19T15:44:05.663" Score="0" Body="&lt;h1&gt;Plan my factory&lt;/h1&gt;&#xA;&lt;p&gt;&amp;quot;Factory games&amp;quot;, such as Factorio, Mindustry, and Satisfactory are my favourite genre of video games, and the way I play them involve a lot of ratio calculations to make sure the factory is running as efficiently as possible.&lt;/p&gt;&#xA;&lt;p&gt;Given a list of recipe specifications, and a desired production rate of an end product, output the necessary input rates of raw materials, where &amp;quot;raw material&amp;quot; is any ingredient that does not have a provided recipe.&lt;/p&gt;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&lt;p&gt;Recipes:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;    {&#xA;        name: &amp;quot;Iron Plate&amp;quot;,&#xA;        time: 3.2,&#xA;        quantity: 1,&#xA;        input: [{&#xA;            name: &amp;quot;Iron Ore&amp;quot;,&#xA;            quantity: 1&#xA;        }]&#xA;    },&#xA;    {&#xA;        name: &amp;quot;Copper Plate&amp;quot;,&#xA;        time: 3.2,&#xA;        quantity: 1,&#xA;        input: [{&#xA;            name: &amp;quot;Copper Ore&amp;quot;,&#xA;            quantity: 1&#xA;        }]&#xA;    },&#xA;    {&#xA;        name: &amp;quot;Iron Gear&amp;quot;,&#xA;        time: 0.5,&#xA;        quantity: 1,&#xA;        input: [{&#xA;            name: &amp;quot;Iron Plate&amp;quot;,&#xA;            quantity: 2&#xA;        }]&#xA;    },&#xA;    {&#xA;        name: &amp;quot;Automation Science Pack&amp;quot;,&#xA;        time: 5,&#xA;        quantity: 1,&#xA;        input: [&#xA;            {&#xA;                name: &amp;quot;Iron Gear&amp;quot;,&#xA;                quantity: 1&#xA;            },&#xA;            {&#xA;                name: &amp;quot;Copper Plate&amp;quot;,&#xA;                quantity: 1&#xA;            }&#xA;        ]&#xA;    },&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Desired production rate:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;{&#xA;    name: &amp;quot;Automation Science Pack&amp;quot;,&#xA;    rate: 60&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Expected output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;    {&#xA;        name: &amp;quot;Iron Ore&amp;quot;,&#xA;        rate: 120&#xA;    },&#xA;    {&#xA;        name: &amp;quot;Copper Ore&amp;quot;,&#xA;        rate: 60&#xA;    }&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Both input and output may be any standard IO format that represents item names as strings and quantities/rates as integers.&lt;/p&gt;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&lt;p&gt;TBA&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&lt;p&gt;Is this a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges/8214#8214&quot;&gt;chameleon challenge&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="44998" LastActivityDate="2021-11-19T15:44:05.663" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24073" PostTypeId="1" AcceptedAnswerId="24076" CreationDate="2021-11-19T22:41:48.513" Score="-4" ViewCount="145" Body="&lt;h1&gt;NOTE:&lt;/h1&gt;&#xA;&lt;p&gt;not dupe of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5585/are-pure-programming-puzzles-on-topic?noredirect=1&amp;amp;lq=1&quot;&gt;this&lt;/a&gt; because all are different answers.&lt;/p&gt;&#xA;&lt;h3&gt;Back to start&lt;/h3&gt;&#xA;&lt;p&gt;Some questions like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/237300/can-someone-tell-me-what-if-anything-this-says-using-golf-coding&quot;&gt;this&lt;/a&gt; are obviously off-topic, but some what sees on-topic but not on this site (CGCC)?&lt;/p&gt;&#xA;&lt;p&gt;Like:&lt;/p&gt;&#xA;&lt;p&gt;“&lt;/p&gt;&#xA;&lt;h1&gt;What programming language is?&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;+[.+]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Prints ascii table. but what programming language is?&lt;/p&gt;&#xA;&lt;p&gt;”&lt;/p&gt;&#xA;&lt;p&gt;Is off-topic in CGCC but why?&lt;/p&gt;&#xA;&lt;h2&gt;Edit:&lt;/h2&gt;&#xA;&lt;p&gt;not including &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="106959" LastEditorUserId="106959" LastEditDate="2021-11-28T00:44:13.550" LastActivityDate="2021-11-28T00:44:13.550" Title="Why is a language identification challenge off-topic in CGCC?" Tags="|discussion|scope|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24074" PostTypeId="2" ParentId="2140" CreationDate="2021-11-20T16:56:48.813" Score="0" Body="&lt;h1&gt;OEIS A049190&lt;/h1&gt;&#xA;&lt;p&gt;your task is to print all numbers of this sequence.&lt;/p&gt;&#xA;&lt;p&gt;is separated by newline, is separated by space or separated by comma.&lt;/p&gt;&#xA;&lt;p&gt;the first few numbers are:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1, 3, 5, 59, 245, 2491, 235253, 127756731, 330567489269, 258479716298484155, 36823182192123209878050549, 25576412117054296344209353299113896379, 10994511204169842163496446583221775727830456269734123253&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;How to get numbers of this sequence:&lt;/h2&gt;&#xA;&lt;p&gt;this is look and say but in binary and convert to decimal&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How to clarify this?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="106959" LastActivityDate="2021-11-20T16:56:48.813" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24076" PostTypeId="2" ParentId="24073" CreationDate="2021-11-21T03:29:57.947" Score="4" Body="&lt;p&gt;Because it does not have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8135/56656&quot;&gt;objective scoring criterion&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;As phrased the shown challenge has a single correct answer. We require challenges with multiple correct answers which can be ranked, so that you are encouraged to improve on your answer.&lt;/p&gt;&#xA;&lt;p&gt;As such this is either regular Q&amp;amp;A and as it says in &lt;a href=&quot;https://codegolf.stackexchange.com/tour&quot;&gt;our tour page&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;We are not a Q&amp;amp;A site.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Or more likely it's a puzzle.  It's not a &lt;em&gt;programming puzzle&lt;/em&gt;, which is a jargon term here, but it's a puzzle about programming.  If it's a puzzle you will probably actually have better luck on the &lt;a href=&quot;https://puzzling.stackexchange.com/&quot;&gt;puzzling stack-exchange&lt;/a&gt;, where I believe it would be on topic.  But of course you should check their rules first.&lt;/p&gt;&#xA;&lt;p&gt;Lastly I should mention that the sole exception to this rule is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;.  Which is a form of Q&amp;amp;A which we occasionally do.  But this is not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; it's a different thing.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2021-11-21T03:29:57.947" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24077" PostTypeId="2" ParentId="24068" CreationDate="2021-11-22T02:37:00.570" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/237920/78410&quot;&gt;AoCG2021 Day 2: Naughty or nice?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-12-02T00:01:48.797" LastActivityDate="2021-12-02T00:01:48.797" CommentCount="0" CommunityOwnedDate="2021-11-22T02:37:00.570" ContentLicense="CC BY-SA 4.0" />
  <row Id="24078" PostTypeId="2" ParentId="24068" CreationDate="2021-11-22T05:16:08.810" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/237995/aocg2021-day-3-say-look-say&quot;&gt;AoCG2021 Day 3: Say-Look-Say&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78850" LastEditDate="2021-12-03T00:01:13.167" LastActivityDate="2021-12-03T00:01:13.167" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24079" PostTypeId="2" ParentId="24068" CreationDate="2021-11-22T06:04:07.160" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238052/78850&quot;&gt;AoCG2021 Day 4: Infinite Elves and infinite houses 2&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78850" LastEditDate="2021-12-04T00:00:52.733" LastActivityDate="2021-12-04T00:00:52.733" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24080" PostTypeId="2" ParentId="24068" CreationDate="2021-11-22T07:25:36.447" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238073/9288&quot;&gt;AoCG Day 5: Balancing sleigh with lots of trunks&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="9288" LastEditDate="2021-12-05T00:15:15.113" LastActivityDate="2021-12-05T00:15:15.113" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24083" PostTypeId="2" ParentId="24068" CreationDate="2021-11-23T05:33:20.887" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238111/78410&quot;&gt;AoCG2021 Day 6: Taxicab in a triangular city&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-12-06T04:03:01.707" LastActivityDate="2021-12-06T04:03:01.707" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24084" PostTypeId="2" ParentId="24068" CreationDate="2021-11-23T06:18:06.187" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238158/78410&quot;&gt;AoCG2021 Day 7: Bathroom security goes wild&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-12-07T00:02:42.780" LastActivityDate="2021-12-07T00:02:42.780" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24085" PostTypeId="2" ParentId="24068" CreationDate="2021-11-23T06:45:31.397" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238258/78410&quot;&gt;AoCG2021 Day 9: Spiral memory stress test&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-12-09T00:00:34.707" LastActivityDate="2021-12-09T00:00:34.707" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24086" PostTypeId="2" ParentId="24068" CreationDate="2021-11-23T07:02:18.333" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238301/78410&quot;&gt;AoCG2021 Day 10: Memory reallocation routine&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-12-10T00:00:56.280" LastActivityDate="2021-12-10T00:00:56.280" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24087" PostTypeId="2" ParentId="24068" CreationDate="2021-11-23T07:51:02.343" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238353/78850&quot;&gt;AoCG2021 Day 11: Garbageful streams&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78850" LastEditDate="2021-12-11T00:01:14.400" LastActivityDate="2021-12-11T00:01:14.400" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24089" PostTypeId="2" ParentId="24068" CreationDate="2021-11-24T02:11:26.740" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238400/78410&quot;&gt;AoCG2021 Day 12: Oct&amp;#39;s Fool&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-12-12T23:59:08.017" LastActivityDate="2021-12-12T23:59:08.017" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24090" PostTypeId="2" ParentId="24068" CreationDate="2021-11-24T04:18:01.497" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238448/78410&quot;&gt;AoCG2021 Day 13: Defrag in action!&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-12-13T00:00:52.393" LastActivityDate="2021-12-13T00:00:52.393" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24091" PostTypeId="2" ParentId="24068" CreationDate="2021-11-24T06:09:41.130" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238492/78410&quot;&gt;AoCG2021 Day 14: Adjusting dancing program&amp;#39;s period&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-12-14T00:41:33.450" LastActivityDate="2021-12-14T00:41:33.450" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24092" PostTypeId="2" ParentId="24068" CreationDate="2021-11-24T07:00:54.550" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238616/78410&quot;&gt;AoCG2021 Day 16: Interpret Duet&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-12-16T00:00:33.473" LastActivityDate="2021-12-16T00:00:33.473" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24094" PostTypeId="2" ParentId="2140" CreationDate="2021-11-24T23:05:06.340" Score="3" Body="&lt;h1&gt;Solve an Inglenook Sidings Puzzle&lt;/h1&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;game&amp;#39;&quot; rel=&quot;tag&quot;&gt;game&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/puzzle-solver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;puzzle-solver&amp;#39;&quot; rel=&quot;tag&quot;&gt;puzzle-solver&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/238172/solve-an-inglenook-sidings-puzzle&quot;&gt;Posted! After about 2 weeks in Sandbox&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2021-12-07T04:17:58.590" LastActivityDate="2021-12-07T04:17:58.590" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24095" PostTypeId="2" ParentId="24068" CreationDate="2021-11-25T06:29:33.883" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/239657/78410&quot;&gt;AoCG2021 Day 17: Langton&amp;#39;s Hexa-Virus&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-12-17T00:44:45.903" LastActivityDate="2021-12-17T00:44:45.903" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24096" PostTypeId="2" ParentId="24068" CreationDate="2021-11-25T07:04:01.613" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/239721/aocg2021-day-18-stripping-strips&quot;&gt;AoCG2021 Day 18: Stripping strips&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="87606" LastEditDate="2021-12-19T04:43:46.830" LastActivityDate="2021-12-19T04:43:46.830" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24097" PostTypeId="2" ParentId="24068" CreationDate="2021-11-25T07:52:42.923" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/239785/aocg2021-day-19-to-hire-or-to-fire&quot;&gt;AoCG2021 Day 19: To Hire or To Fire&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="97857" LastEditDate="2021-12-19T00:02:01.853" LastActivityDate="2021-12-19T00:02:01.853" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24098" PostTypeId="2" ParentId="24068" CreationDate="2021-11-25T09:50:00.307" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/239852/78410&quot;&gt;AoCG2021 Day 20: Wonky license check&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-12-20T00:06:17.893" LastActivityDate="2021-12-20T00:06:17.893" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24099" PostTypeId="2" ParentId="24068" CreationDate="2021-11-25T14:13:29.787" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238522/78410&quot;&gt;AoCG2021 Day 15: Leapfrog Santa&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="78410" LastEditDate="2021-12-15T00:00:43.567" LastActivityDate="2021-12-15T00:00:43.567" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24103" PostTypeId="2" ParentId="24068" CreationDate="2021-11-27T07:02:20.357" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/239985/hyperbolic-rescue&quot;&gt;AoCG2021 Day 22: Hyperbolic rescue&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2021-12-21T21:41:55.690" LastActivityDate="2021-12-21T21:41:55.690" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24104" PostTypeId="2" ParentId="2140" CreationDate="2021-11-27T16:43:11.500" Score="0" Body="&lt;h1&gt;Baloney Sandwich KOTH&lt;/h1&gt;&#xA;&lt;p&gt;Tags: [king-of-the-hill], [python]&lt;/p&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;In this King Of The Hill Challenge, your bots will be playing Baloney Sandwich.&lt;/p&gt;&#xA;&lt;h3&gt;How Baloney Sandwich is played&lt;/h3&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;First, the entire deck is dealt equally to all players (EVERY BOT PLAYS; if there is more than 26 bots, it will be 2 decks mixed together).&lt;/li&gt;&#xA;&lt;li&gt;Then, the player with the ace of spades goes first.&lt;/li&gt;&#xA;&lt;li&gt;They play all of their aces&#xA;&lt;ul&gt;&#xA;&lt;li&gt;However! They could opt to &amp;quot;cheat&amp;quot; and instead play cards that are not aces, or mix and match aces with other cards.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Every other player has their &lt;code&gt;call_bs&lt;/code&gt; (bs = Baloney Sandwich) method called after this play, in turn until a player returns &lt;code&gt;True&lt;/code&gt;; if a player returns &lt;code&gt;True&lt;/code&gt; then the cards played are &amp;quot;revealed&amp;quot;.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Every player has their &lt;code&gt;bs_call_outcome&lt;/code&gt; method to &amp;quot;reveal&amp;quot; the cards&lt;/li&gt;&#xA;&lt;li&gt;If no player returns &lt;code&gt;True&lt;/code&gt; but the player was lying, the &lt;code&gt;pb&lt;/code&gt; method is called (pb = Peanut Butter)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Play continues with twos, threes, etc.; after kings, start over at aces&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Creating A Player&lt;/h2&gt;&#xA;&lt;p&gt;Your player should be in this format:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;class ExamplePlayer(AbstractBSPlayer):&#xA;    def __init__(self, hand: list[int]):&#xA;        super().__init__(hand)&#xA;        # Any necessary initialization goes here&#xA;&#xA;    def call_bs(self, player_name: str, card_rank: int, number_of_cards: int) -&amp;gt; bool:&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        player_name is the name of the bot who just played&#xA;        The number of cards they played is number_of_cards&#xA;        The claimed rank is card_rank (1 is Ace; 11-13 are face cards)&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        # Magic decision maker&#xA;        return False # never calls &amp;quot;Baloney Sandwich&amp;quot;&#xA;        # return True would always call &amp;quot;Baloney Sandwich&amp;quot;&#xA;    &#xA;    def bs_call_outcome(self, player_name: str, caller_name: str, card_rank: int, cards: list[int], cheated: bool):&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        player_name is the name of the bot who just played&#xA;        caller_name is the name of the bot who called &amp;quot;Baloney Sandwich&amp;quot;&#xA;        The claimed rank is card_rank&#xA;        The cards they played is cards&#xA;        cheated is True if the player cheated&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        pass  # Couldn't care less&#xA;    &#xA;    def pb(self, player_name: str, card_rank: int, number_of_cards: int):&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        player_name is the name of the bot who just played&#xA;        The number of cards they played is number_of_cards&#xA;        The claimed rank is card_rank (1 is Ace; 11-13 are face cards)&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        pass # Couldn't care less&#xA;&#xA;    def play_cards(self, card_rank: int) -&amp;gt; list[int]:&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        The rank you will claim to play is card_rank&#xA;        &amp;quot;&amp;quot;&amp;quot;&#xA;        # Magic decision maker&#xA;        return self.hand[0] # Always plays the first thing in hand&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;A player has access to the following instance variables:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;self.store&lt;/code&gt;: A dictionary that is empty by default. The only instance variable allowed to be written to.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;self.hand&lt;/code&gt;: A list of &lt;code&gt;int&lt;/code&gt;s, each representing a card (1 is Ace, 11-13 are face cards)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Testing Your Player&lt;/h3&gt;&#xA;&lt;p&gt;The controller can be found at &lt;a href=&quot;https://github.com/sethpeace/bs-koth&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://github.com/sethpeace/bs-koth&lt;/a&gt;. I apologize in advance that it is janky beyond comprehension.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;h3&gt;Runtime Disqualifications&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must play at least one card every turn&lt;/li&gt;&#xA;&lt;li&gt;You can't play cards you dont have in your hand&lt;/li&gt;&#xA;&lt;li&gt;You can't take longer than one second to return from a function&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Pre-runtime Disqualifications&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No reading or writing to controller, runtime, or other submissions (bots can't read them; you can if you feel like it)&lt;/li&gt;&#xA;&lt;li&gt;Only write to &lt;code&gt;self.store&lt;/code&gt; instance variable&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Other variables inside function scope are of course OK&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Don't design a bot to defend or support specific bots&lt;/li&gt;&#xA;&lt;li&gt;Bots can't use the same strategy as another bot&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; apply&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="100730" LastActivityDate="2021-11-27T16:43:11.500" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24106" PostTypeId="2" ParentId="5243" CreationDate="2021-11-28T15:58:25.180" Score="7" Body="&lt;h1&gt;50-100 rep for answers in TypeScript's type system&lt;/h1&gt;&#xA;&lt;p&gt;There aren't many answers here written in TypeScript's (&lt;a href=&quot;https://codegolf.stackexchange.com/a/237776/87606&quot;&gt;turing complete&lt;/a&gt;) type system; as of posting, there six, two of which are my own. I like seeing such answers, so I'll be awarding a 50 rep bounty to answers that meet &lt;em&gt;all&lt;/em&gt; of the following criteria:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are posted later than 2021-11-27 (date of bounty posting)&lt;/li&gt;&#xA;&lt;li&gt;Consist of a valid TypeScript source file containing a type alias that, given valid input as type parameters, results in a type representing valid output for the challenge&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input and output types can be any types that reflect the challenge's I/O requirements&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For example, string literals are allowed for a challenge requiring string input, and tuple types are valid where tuples would be&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Type parameters that aren't part of the input but have defaults are valid, even for challenges with no input&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For example, &lt;code&gt;type X&amp;lt;T=&amp;quot;a&amp;quot;&amp;gt;=T&lt;/code&gt; would be valid for a challenge &amp;quot;Output the literal string &lt;code&gt;a&lt;/code&gt; with no input&amp;quot;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Beat all other existing TypeScript type system answers in the challenge, if applicable&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Beat, for the purposes of this bounty, can be done either by the challenge's scoring criterion or by erroring due to the recursion limit on notably fewer inputs&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Produce no compile errors (&lt;code&gt;//@ts-ignore&lt;/code&gt; is allowed)&lt;/li&gt;&#xA;&lt;li&gt;Make a reasonable attempt to avoid the recursion limit. TypeScript has a very strict recursion limit; 50 for regular types and 1000 for tail-recursive types. Reasonable attempts include:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Anything that supports most inputs without erroring&lt;/li&gt;&#xA;&lt;li&gt;Use of tail recursion to get the 1000 limit&lt;/li&gt;&#xA;&lt;li&gt;Anything where I either do not choose to or am not able to send you an altered version that errors on notably fewer inputs&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Use at least one conditional type (e.g. &lt;code&gt;A extends B ? C : D&lt;/code&gt;), template literal type (e.g. &lt;code&gt;`foo${T}baz`&lt;/code&gt;), or variadic tuple type (e.g. &lt;code&gt;[T, ...U]&lt;/code&gt;), and cannot be beaten by a solution which uses none&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Most answers will pass this criterion; this is to exclude things like &lt;code&gt;type A=&amp;quot;Hello world!&amp;quot;&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Do not have any external dependencies (e.g. on type utility libraries).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If your answer does not meet any of these criteria, but you believe it is in the spirit of the bounty nonetheless, any of the criteria can be overridden by my judgement.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I'll award 100 rep (total) to answers that match all of the above criteria and &lt;strong&gt;at least one&lt;/strong&gt; of the following criteria:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are the answerer's first answer in TypeScript's type system&lt;/li&gt;&#xA;&lt;li&gt;Include a decent explanation (this is, obviously, subjective)&lt;/li&gt;&#xA;&lt;li&gt;Demonstrate the turing completeness of TypeScript's type system by implementing an interpreter for a turing complete language&lt;/li&gt;&#xA;&lt;li&gt;Are notable in some other way (again, subjective)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;If you're not familiar with programming in TypeScript's type system, the &lt;a href=&quot;https://www.typescriptlang.org/docs/handbook/intro.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;TypeScript Handbook&lt;/a&gt;, &lt;a href=&quot;https://discord.gg/typescript&quot; rel=&quot;nofollow noreferrer&quot;&gt;TypeScript Discord Server&lt;/a&gt; (I'm @T6 there), and the &lt;a href=&quot;https://codegolf.stackexchange.com/q/237784/87606&quot;&gt;TypeScript Tips Question&lt;/a&gt; are all great resources.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;To claim a bounty, post a comment on this post with a link to your answer. If I don't respond promptly, feel free to ping me (@T6) in #random of the &lt;a href=&quot;https://discord.gg/typescript&quot; rel=&quot;nofollow noreferrer&quot;&gt;TypeScript Discord Server&lt;/a&gt;, as I'm more active there.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Awarded Bounties&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;100 rep for &lt;a href=&quot;https://codegolf.stackexchange.com/a/237788/95792&quot;&gt;user's answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/237574/convert-prefix-to-infix&quot;&gt;Convert Prefix to Infix&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;50 rep for &lt;a href=&quot;https://codegolf.stackexchange.com/a/258114/87606&quot;&gt;Jacob's answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/58615/87606&quot;&gt;1, 2, Fizz, 4, Buzz&lt;/a&gt; (pending)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="87606" LastEditorUserId="87606" LastEditDate="2023-05-07T12:06:32.527" LastActivityDate="2023-05-07T12:06:32.527" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24108" PostTypeId="1" CreationDate="2021-11-28T20:21:06.897" Score="2" ViewCount="103" Body="&lt;p&gt;Are there any restrictions on what programming languages you can use in a challenge, and if you created your own programming language and you wanted to submit it to a code challenge, does there need to be a working interpreter which actually executes the code or can there just be some set out syntax but no program which interprets the language? Thanks.&lt;/p&gt;&#xA;" OwnerUserId="108434" OwnerDisplayName="Binary198" LastEditorUserId="66833" LastEditDate="2021-11-28T20:40:29.147" LastActivityDate="2021-11-28T20:40:29.147" Title="Esoteric programming languages" Tags="|support|languages|" AnswerCount="0" CommentCount="3" ClosedDate="2021-11-28T20:39:00.723" ContentLicense="CC BY-SA 4.0" />
  <row Id="24111" PostTypeId="2" ParentId="2140" CreationDate="2021-11-29T00:49:07.110" Score="1" Body="&lt;h1&gt;Print random characters indefinitely&lt;/h1&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Continuously print a random character &lt;code&gt;(a-z, A-Z, 0-9)&lt;/code&gt; not separated by a newline (&lt;code&gt;\n&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;h3&gt;Expected output&lt;/h3&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;b7gFDRtgFc67h90h8H76f5dD55f7GJ6GRT86hG7TH6T7302f2f4 ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Note: output should be randomised.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Requirements/Rules&lt;/h2&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Output must be continuous (i.e. never ending),&lt;/li&gt;&#xA;&lt;li&gt;Output may not comprise of newlines,&lt;/li&gt;&#xA;&lt;li&gt;Output must be random,&lt;/li&gt;&#xA;&lt;li&gt;Output must be only composed of characters: a-z, A-Z, 0-9.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;No loopholes&lt;/strong&gt;, regarding programming language version(s). Use only the tools available with that programming language, no third-party packages, modules, or other addons.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Points&lt;/h2&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Smallest file size (in bytes)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Notes&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Concerns&lt;/strong&gt;: None at the moment...&lt;/p&gt;&#xA;" OwnerUserId="108567" LastEditorUserId="108567" LastEditDate="2021-11-29T01:00:39.413" LastActivityDate="2021-11-29T01:00:39.413" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="24112" PostTypeId="2" ParentId="2140" CreationDate="2021-11-29T03:38:15.757" Score="0" Body="&lt;h1&gt;Implement xorshift128+&lt;/h1&gt;&#xA;&lt;p&gt;I don't have time to finish writing this draft at the moment.&lt;/p&gt;&#xA;&lt;p&gt;Might also consider something like xoroshiro if it's more interesting to implement, but since xorshift128+ is so common it seems like a clearer choice.&lt;/p&gt;&#xA;&lt;p&gt;(Possible idea: Given initial seed, determine number of iterations it'll take to get a certain random number with xorshift128+. It's not a CSPRNG, so there might be something more interesting than brute force.)&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-11-29T03:38:15.757" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24113" PostTypeId="2" ParentId="24068" CreationDate="2021-11-29T07:39:25.200" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/239921/78410&quot;&gt;AoCG2021 Day 21: Blinking through the forest&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-12-21T00:04:01.933" LastActivityDate="2021-12-21T00:04:01.933" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24114" PostTypeId="2" ParentId="24068" CreationDate="2021-11-29T08:11:48.050" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/240073/78410&quot;&gt;AoCG2021 Day 23: Finding the best seat&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-12-23T01:58:14.500" LastActivityDate="2021-12-23T01:58:14.500" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24115" PostTypeId="2" ParentId="24068" CreationDate="2021-11-29T08:29:09.217" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/240105/&quot;&gt;AoCG2021 Day 24: Is the bus company cheating?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="97857" LastEditDate="2021-12-24T00:44:59.253" LastActivityDate="2021-12-24T00:44:59.253" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24118" PostTypeId="2" ParentId="24068" CreationDate="2021-11-30T07:13:04.423" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/240140/78410&quot;&gt;AoCG2021 Day 25: Stitching maps together&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-12-26T23:27:30.443" LastActivityDate="2021-12-26T23:27:30.443" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24119" PostTypeId="1" CreationDate="2021-12-01T01:49:02.377" Score="10" ViewCount="517" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19271/16766&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout December 2021, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://mlochbaum.github.io/BQN&quot; rel=&quot;nofollow noreferrer&quot;&gt;BQN&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;What's a Language of the Month?&lt;/p&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/16766&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during December, those who wish to participate should learn (at least the basics of) BQN, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about BQN&lt;/h2&gt;&#xA;&lt;p&gt;&lt;sup&gt;Taken from the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/23990/78410&quot;&gt;nomination post&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;BQN is a powerful modern language based on the ideas of Ken Iverson's APL, which is already quite popular on CGCC.&lt;/p&gt;&#xA;&lt;p&gt;The main aim of BQN is to remove irregular and burdensome aspects of the APL tradition while adding newer modern concepts to the mix. This makes BQN oftentimes more practical than APL, and gives it a much more consistent, streamlined design refined from many years of array programming experience.&lt;/p&gt;&#xA;&lt;h2&gt;Why BQN?&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;BQN uses cool looking(important), carefully chosen symbols. This makes it readable and practical, yet very golfy.&lt;/li&gt;&#xA;&lt;li&gt;BQN provides strong fundamentals for array programming which you can use for algorithmic coding in any language.&lt;/li&gt;&#xA;&lt;li&gt;Lisp style functional programming support which is outlined &lt;a href=&quot;https://mlochbaum.github.io/BQN/doc/functional.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;BQN has the most powerful &lt;a href=&quot;https://mlochbaum.github.io/BQN/doc/train.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;tacit system&lt;/a&gt; available in an APL family language.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://mlochbaum.github.io/BQN/commentary/why.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Why BQN?&lt;/a&gt; is a more comprehensive document on what BQN is currently and what it aims to be.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://apl.chat&quot; rel=&quot;nofollow noreferrer&quot;&gt;The APL Orchard&lt;/a&gt; (SE chatroom)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://mlochbaum.github.io/BQN/try.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;online interpreter&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/dzaima/CBQN/&quot; rel=&quot;nofollow noreferrer&quot;&gt;C implementation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/dzaima/BQN/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Java implementation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;APL Farm &lt;a href=&quot;https://app.element.io/#/room/%23aplfarm:matrix.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;Matrix&lt;/a&gt; and &lt;a href=&quot;https://discord.gg/yHna7nt7zx&quot; rel=&quot;nofollow noreferrer&quot;&gt;Discord&lt;/a&gt; chatrooms&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://mlochbaum.github.io/bqncrate/&quot; rel=&quot;nofollow noreferrer&quot;&gt;BQNcrate&lt;/a&gt;, a collection of short snippets for common tasks&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/237866/78410&quot;&gt;Tips question&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2021-12-01T01:57:04.007" LastActivityDate="2021-12-30T21:41:26.690" Title="Language of the Month for December 2021: BQN" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24120" PostTypeId="2" ParentId="24119" CreationDate="2021-12-01T01:50:27.337" Score="4" Body="&lt;h1&gt;List of all BQN answers posted in December 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/237856/aocg2021-day-1-automated-delivery-frenzy/237942#237942&quot;&gt;AoCG2021 Day 1: Automated delivery frenzy&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/237920/aocg2021-day-2-naughty-or-nice/237955#237955&quot;&gt;AoCG2021 Day 2: Naughty or nice?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/237995/aocg2021-day-3-say-look-say/238009#238009&quot;&gt;AoCG2021 Day 3: Say-Look-Say&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/228953/create-an-ascii-line-given-a-length/238084#238084&quot;&gt;Create an ASCII line, given a length&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/103854&quot;&gt;PyGamer0&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/238225/45220&quot;&gt;Print a Tabula Recta!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/45220&quot;&gt;SjoerdPennings&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/238255/16766&quot;&gt;Bernardino identifies unaltered dollar words&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/238286/45220&quot;&gt;Output programming language name&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/45220&quot;&gt;SjoerdPennings&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/238285/64121&quot;&gt;Swap every two elements in a list&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/64121/ovs&quot;&gt;ovs&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/238319/64121&quot;&gt;AoCG2021 Day 10: Memory reallocation routine&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/64121/ovs&quot;&gt;ovs&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/238258/aocg2021-day-9-spiral-memory-stress-test/238320#238320&quot;&gt;AoCG2021 Day 9: Spiral memory stress test&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/238353/aocg2021-day-11-garbageful-streams/238365#238365&quot;&gt;AoCG2021 Day 11: Garbageful streams&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/238489/16766&quot;&gt;Chunk Sort a Sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/238518/16766&quot;&gt;Alphabet Staircase&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/238565/64121&quot;&gt;Return all letter counts as an integer&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/64121/ovs&quot;&gt;ovs&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/238571/45220&quot;&gt;Implement Minceraft&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/45220&quot;&gt;SjoerdPennings&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/238594/16766&quot;&gt;Generate the Chess Numbers™&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/239642/16766&quot;&gt;Helloellolloloo Worldorldrldldd&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/239703/64121&quot;&gt;Greatest Common Divisor&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/64121/ovs&quot;&gt;ovs&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/239718/16766&quot;&gt;Pascal's Triangle as a 2-dimensional list&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/239744/64121&quot;&gt;AoCG2021 Day 18: Stripping Strips&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/64121/ovs&quot;&gt;ovs&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/239788/check-if-the-string-is-reshaped/239795#239795&quot;&gt;Check if the string is reshaped&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/239910/16766&quot;&gt;Nesting list with value &lt;code&gt;n&lt;/code&gt; amount of times&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/239972/16766&quot;&gt;Bubbler and 3 others are typing․․․&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/239935/convert-the-decimal-digits-of-a-strings-unicode-codepoints-to-binary-reinterpr/240032#240032&quot;&gt;Convert the decimal digits of a string&amp;#39;s Unicode codepoints to binary, reinterpret as decimal, and take the sum&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/73384/when-does-santa-enter-the-basement-aoc-day-1/240096#240096&quot;&gt;When does Santa enter the basement? (AOC Day 1)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/240195/95126&quot;&gt;Swap Two Values in a List&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95126/dominic-van-essen&quot;&gt;Dominic van Essen&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/240212/95126&quot;&gt;Repeating slices of an array incrementally&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95126/dominic-van-essen&quot;&gt;Dominic van Essen&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/240265/95126&quot;&gt;Fibonacci function or sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95126/dominic-van-essen&quot;&gt;Dominic van Essen&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/240334/95126&quot;&gt;Shuffle a subsequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95126/dominic-van-essen&quot;&gt;Dominic van Essen&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/240354/95126&quot;&gt;An ASCII self-referential sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95126/dominic-van-essen&quot;&gt;Dominic van Essen&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant tips posted in December 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/237866/tips-for-golfing-in-bqn/238023#238023&quot;&gt;Use &lt;code&gt;⊒˜&lt;/code&gt; instead of &lt;code&gt;↕∘≠&lt;/code&gt;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/237866/tips-for-golfing-in-bqn/238371#238371&quot;&gt;BQN's combinators&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;tip summary&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant challenges posted in December 2021&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="95126" LastEditDate="2021-12-30T21:41:26.690" LastActivityDate="2021-12-30T21:41:26.690" CommentCount="0" CommunityOwnedDate="2021-12-01T01:50:27.337" ContentLicense="CC BY-SA 4.0" />
  <row Id="24121" PostTypeId="2" ParentId="2140" CreationDate="2021-12-02T05:37:46.377" Score="-3" Body="&lt;h1&gt;Geometry Dash Clone in a weird Way?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cloning-games&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cloning-games&amp;#39;&quot; rel=&quot;tag&quot;&gt;cloning-games&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Try to make a functional clone of Geometry Dash in the shortest time.&lt;/p&gt;&#xA;&lt;h2&gt;How GD Works.&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You have a cube. In the clone, it can be as small as you want, but no bigger than 2x2.&lt;/li&gt;&#xA;&lt;li&gt;You have to jump over spikes. The key to do this is (preferably) the up arrow key, but can be any option you want (simply tell me in your answer what key is it.&lt;/li&gt;&#xA;&lt;li&gt;If you touch the spikes, the screen says &amp;quot;Game Over.&amp;quot; and exits in 3 seconds.&lt;/li&gt;&#xA;&lt;li&gt;There are blocks! You can jump on them, but touching them from the left side results in the same thing that happens if you touch the spikes.&lt;/li&gt;&#xA;&lt;li&gt;A song plays in the background. How you do this is up to you.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;3 Extra points for working forwards and backwards.&lt;/li&gt;&#xA;&lt;li&gt;Must have the letter &lt;code&gt;a&lt;/code&gt; 5-7 times and no &lt;code&gt;q&lt;/code&gt; at all!&lt;/li&gt;&#xA;&lt;li&gt;Allows ascii art type output and text input (standard input)!&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&lt;p&gt;How is this even going to work?&lt;/p&gt;&#xA;" OwnerUserId="108613" LastEditorUserId="108613" LastEditDate="2021-12-02T06:52:19.313" LastActivityDate="2021-12-02T06:52:19.313" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24122" PostTypeId="2" ParentId="2140" CreationDate="2021-12-02T18:51:03.617" Score="2" Body="&lt;h1&gt;Construct a Heptagon avoiding compass use&lt;/h1&gt;&#xA;&lt;p&gt;A while back I asked you to &lt;a href=&quot;https://codegolf.stackexchange.com/q/188333/56656&quot;&gt;construct a pentagon avoiding compass use&lt;/a&gt;.  Now &lt;a href=&quot;https://codegolf.stackexchange.com/users/24877/flawr&quot;&gt;flawr&lt;/a&gt; suggested:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Next time you should ask people to draw a heptagon, which would be slightly more challenging:)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is of course a joke, because if you didn't already know it is not possible to construct a Heptagon using a ruler and compass ...&lt;/p&gt;&#xA;&lt;p&gt;... in finite steps.&lt;/p&gt;&#xA;&lt;p&gt;In this challenge answers will construct equilateral polygon of 7 sides, using a ruler and a compass.&lt;/p&gt;&#xA;&lt;p&gt;We will begin with some standard ruler and compass operations:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Draw a line that passes through two non-identical points. (Ruler)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Draw a circle centered at one point such that another point lies on the circle. (Compass)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Place a point at an intersection of two non-identical objects (a circle and a line, a line and a line or a circle and a circle)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Normally a construction must be finished after some finite number of operations.  However we will allow you to take any ordinal number of steps.  Meaning you can perform an infinite number of steps and then perform more.&lt;/p&gt;&#xA;&lt;p&gt;To go with this you are given one more operation:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Choose converging sequence of already drawn points and place a point at their limit. (limiting)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This operation is only meaningfully useful if you have already performed an infinite number of steps, but is crucial to constructing a heptagon.&lt;/p&gt;&#xA;&lt;h2&gt;Summary&lt;/h2&gt;&#xA;&lt;p&gt;In this challenge you will start with two arbitrarily placed (but non-equal) points on an infinite plane.  You must then describe some sequence of steps to arrive at a regular Heptagon. Here a regular heptagon simply being 7 points which form the vertices of a heptagon, they do not need to be in any particular position relative to the starting points.&lt;/p&gt;&#xA;&lt;p&gt;Your score will be the number of compass operations used in the entire proof with lower being better.  Since many answers may end up using an infinite number of compass steps we will break ties by the strict supremum of ordinals representing steps you have used a compass.&lt;/p&gt;&#xA;&lt;p&gt;For example if two answers both use an infinite number of compass operations, their primary score is &lt;span class=&quot;math-container&quot;&gt;\$\infty\$&lt;/span&gt;. If one of them uses all of their compasses at finite numbered their secondary score is &lt;span class=&quot;math-container&quot;&gt;\$\omega\$&lt;/span&gt;, which would beat the other answer if it uses the compass at any time &lt;span class=&quot;math-container&quot;&gt;\$\omega\$&lt;/span&gt; and after.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2021-12-02T18:51:03.617" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24123" PostTypeId="1" CreationDate="2021-12-03T03:41:28.407" Score="5" ViewCount="119" Body="&lt;p&gt;Currently, we have at least 12 &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=is%3Aq+title%3A2048&quot;&gt;questions&lt;/a&gt; relating to the game &lt;a href=&quot;https://play2048.co/&quot; rel=&quot;nofollow noreferrer&quot;&gt;2048&lt;/a&gt;. I think it would be worth creating a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/2048&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;2048&amp;#39;&quot; rel=&quot;tag&quot;&gt;2048&lt;/a&gt; tag, as there are a non-insignificant number of these questions now. We have tags for other games, like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot;&gt;chess&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/boggle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;boggle&amp;#39;&quot; rel=&quot;tag&quot;&gt;boggle&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/scrabble&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;scrabble&amp;#39;&quot; rel=&quot;tag&quot;&gt;scrabble&lt;/a&gt; (many of which have fewer than 10 questions), so there is precedent for these sorts of tags existing.&lt;/p&gt;&#xA;&lt;p&gt;There is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sliding-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sliding-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;sliding-puzzle&lt;/a&gt; tag, which includes 2048 (this is stated clearly in the excerpt). However, less than half of the 2048 related questions use this tag, and it's not very &amp;quot;discoverable&amp;quot; to those writing questions involving the game.&lt;/p&gt;&#xA;&lt;p&gt;I'd suggest either creating a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/2048&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;2048&amp;#39;&quot; rel=&quot;tag&quot;&gt;2048&lt;/a&gt; tag and possibly making some adjustments to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sliding-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sliding-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;sliding-puzzle&lt;/a&gt;'s scope if needed, or just making &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/2048&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;2048&amp;#39;&quot; rel=&quot;tag&quot;&gt;2048&lt;/a&gt;, as a synonym of it. What do y'all think about this?&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="68942" LastEditDate="2021-12-09T07:12:14.940" LastActivityDate="2021-12-09T07:12:14.940" Title="Should we make a 2048 tag?" Tags="|discussion|status-completed|tags|tag-synonyms|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24124" PostTypeId="2" ParentId="24123" CreationDate="2021-12-03T03:47:20.477" Score="12" Body="&lt;h3&gt;Make &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/2048&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;2048&amp;#39;&quot; rel=&quot;tag&quot;&gt;2048&lt;/a&gt; an explicit synonym of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sliding-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sliding-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;sliding-puzzle&lt;/a&gt;, retag challenges that need &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sliding-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sliding-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;sliding-puzzle&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;I think it's clear that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sliding-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sliding-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;sliding-puzzle&lt;/a&gt; fully covers &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/2048&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;2048&amp;#39;&quot; rel=&quot;tag&quot;&gt;2048&lt;/a&gt;, as all challenges about 2048 are applicable to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sliding-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sliding-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;sliding-puzzle&lt;/a&gt;, but there may be challenges about tile games that aren't specifically about 2048.&lt;/p&gt;&#xA;&lt;p&gt;However, you raise an excellent point about not enough questions being tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sliding-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sliding-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;sliding-puzzle&lt;/a&gt;. This is a perfect example of when we should be doing some retagging and editing this tag into applicable questions.&lt;/p&gt;&#xA;&lt;p&gt;Finally, by explicitly creating the synonym &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/2048&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;2048&amp;#39;&quot; rel=&quot;tag&quot;&gt;2048&lt;/a&gt;, it means that any new challenges about it can easily find the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sliding-puzzle&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sliding-puzzle&amp;#39;&quot; rel=&quot;tag&quot;&gt;sliding-puzzle&lt;/a&gt; tag, and that, like e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/koth&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;koth&amp;#39;&quot; rel=&quot;tag&quot;&gt;koth&lt;/a&gt;, we have the tag in the system ready to help find and retag relevant challenges.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-12-03T03:47:20.477" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24125" PostTypeId="2" ParentId="2140" CreationDate="2021-12-03T17:17:27.227" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238102&quot;&gt;Write a number in overflowed binary&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2021-12-05T19:32:39.757" LastActivityDate="2021-12-05T19:32:39.757" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24126" PostTypeId="2" ParentId="2140" CreationDate="2021-12-03T17:29:36.523" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/238134/how-long-will-my-microwave-run-for&quot;&gt;How long will my microwave run for?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="100664" LastEditDate="2021-12-11T21:59:47.673" LastActivityDate="2021-12-11T21:59:47.673" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24127" PostTypeId="2" ParentId="2140" CreationDate="2021-12-03T19:18:32.060" Score="3" Body="&lt;h1&gt;Sum powers to n&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/238146/sum-powers-to-n&quot;&gt;Posted to main&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="82199" LastEditorUserId="82199" LastEditDate="2021-12-06T16:56:51.037" LastActivityDate="2021-12-06T16:56:51.037" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24128" PostTypeId="2" ParentId="2140" CreationDate="2021-12-04T08:43:58.107" Score="-1" Body="&lt;h1&gt;Output sequence from a name&lt;/h1&gt;&#xA;&lt;p&gt;You are given a sequence of numbers(0-9) which you have to convert to its literal form.&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;Input : &lt;code&gt;1246&lt;/code&gt;&lt;br /&gt;&#xA;Output : &lt;code&gt;26666&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;We interpret the input as &lt;code&gt;one 2 four 6&lt;/code&gt;, thus giving the output 2 one time and 6 four times&lt;/p&gt;&#xA;&lt;h2&gt;Testcase&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Input&lt;/th&gt;&#xA;&lt;th&gt;Output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1234567809&lt;/td&gt;&#xA;&lt;td&gt;2444666668888888&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2345&lt;/td&gt;&#xA;&lt;td&gt;335555&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;h2&gt;P.S.&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Is this descriptive enough?&lt;/li&gt;&#xA;&lt;li&gt;Would it be fun to do?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="106829" LastActivityDate="2021-12-04T08:43:58.107" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24129" PostTypeId="2" ParentId="2140" CreationDate="2021-12-04T16:27:17.397" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/238329/chunk-sort-a-sequence&quot;&gt;Chunk Sort a Sequence&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2021-12-10T16:49:48.807" LastActivityDate="2021-12-10T16:49:48.807" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24131" PostTypeId="2" ParentId="24123" CreationDate="2021-12-05T22:26:47.807" Score="-4" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;You can add 2048 tag.&lt;/p&gt;&#xA;" OwnerUserId="106959" LastActivityDate="2021-12-05T22:26:47.807" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24132" PostTypeId="2" ParentId="2140" CreationDate="2021-12-07T01:07:47.847" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238199/100664&quot;&gt;Event scheduler&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerDisplayName="user108147" LastEditorUserId="100664" LastEditDate="2021-12-28T02:37:46.390" LastActivityDate="2021-12-28T02:37:46.390" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24133" PostTypeId="2" ParentId="2140" CreationDate="2021-12-08T16:44:46.647" Score="2" Body="&lt;h1&gt;Code Golf Birthday Cake&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to print this exact text:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;     0 2 4 6 8 10&#xA;     | | | | | |&#xA;    &amp;amp;***********&amp;amp;&#xA;    | Code Golf |&#xA;   | e---------f |&#xA;  | d___________l |&#xA; | o-------------o |&#xA;| C_______________G |&#xA; ###Dennis$Dennis###&#xA;#####################&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Trailing or leading newline is allowed&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2021-12-24T11:52:21.470" LastActivityDate="2021-12-24T11:52:21.470" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="24134" PostTypeId="2" ParentId="2140" CreationDate="2021-12-08T17:55:47.027" Score="1" Body="&lt;h1&gt;Largest SKI Reduction in under 100 characters&lt;/h1&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;Create a program in &lt;a href=&quot;https://en.wikipedia.org/wiki/SKI_combinator_calculus&quot; rel=&quot;nofollow noreferrer&quot;&gt;SKI Combinator Calculus&lt;/a&gt; in under 100 characters that produces the largest result after terminating.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;The score will be the number of characters in the final reduction. The highest is the winner.&lt;/p&gt;&#xA;" OwnerUserId="103495" LastActivityDate="2021-12-08T17:55:47.027" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24135" PostTypeId="2" ParentId="2140" CreationDate="2021-12-08T21:06:32.997" Score="0" Body="&lt;h1&gt;Radiate a prime checker into a sum program&lt;/h1&gt;&#xA;&lt;p&gt;Write a program or function that takes a number n and returns/print truthy if it is prime, and falsy otherwise. Additionally, if you remove 1 character of the source code, the program must now take a list of one or more numbers and return/print the sum. This must work for at least one character, and your score is however many characters that this does /not/ work for. Lowest score wins.&lt;/p&gt;&#xA;&lt;h1&gt;meta:&lt;/h1&gt;&#xA;&lt;p&gt;let me know if i need to clarify anything etc&#xA;also: would it make sense to allow the programs to be the other way around (i.e. a sum checker where removing 1 character makes it a prime checker instead)? Just in case it could lead to a more interesting golf&lt;/p&gt;&#xA;" OwnerUserId="107310" LastEditorUserId="107310" LastEditDate="2021-12-08T21:18:53.810" LastActivityDate="2021-12-08T21:18:53.810" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24137" PostTypeId="2" ParentId="2140" CreationDate="2021-12-09T14:12:58.163" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238462&quot;&gt;Convert superscript numbers to normal numbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="101522" LastEditDate="2021-12-13T18:42:08.990" LastActivityDate="2021-12-13T18:42:08.990" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24138" PostTypeId="2" ParentId="2140" CreationDate="2021-12-09T14:42:39.220" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/239702/66833&quot;&gt;Nth FizzBuzz Number&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="66833" LastEditDate="2021-12-18T01:01:58.080" LastActivityDate="2021-12-18T01:01:58.080" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24140" PostTypeId="2" ParentId="2140" CreationDate="2021-12-10T03:29:00.823" Score="0" Body="&lt;h1&gt;Quickly pour liquid nitrogen&lt;/h1&gt;&#xA;&lt;p&gt;I have a container of liquid nitrogen, but nothing to measure it with. I do have some containers, whose volumes I know, and I know how much I start with. My goal is to fill any container with a given amount of liquid nitrogen, with the fewest possible pours.&lt;/p&gt;&#xA;&lt;p&gt;Importantly, liquid nitrogen boils away as I pour it. Every time I pour liquid nitrogen into a container, a milliliter is lost.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Pouring mechanics:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;If I have two containers, &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt;, and I pour &lt;code&gt;a&lt;/code&gt; into &lt;code&gt;b&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If both are empty, nothing changes&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;b&lt;/code&gt;'s unused volume is greater than or equal to the volume of liquid nitrogen in &lt;code&gt;a&lt;/code&gt;, &lt;code&gt;a&lt;/code&gt; is emptied into &lt;code&gt;b&lt;/code&gt;, and a milliliter boils away from &lt;code&gt;b&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, as much as possible is poured from &lt;code&gt;a&lt;/code&gt; into &lt;code&gt;b&lt;/code&gt;, and an additional milliliter is taken from &lt;code&gt;a&lt;/code&gt; (so &lt;code&gt;b&lt;/code&gt; will still be full)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If I have three containers, &lt;code&gt;x&lt;/code&gt;, &lt;code&gt;y&lt;/code&gt;, and &lt;code&gt;z&lt;/code&gt;, they all have volumes of &lt;code&gt;25&lt;/code&gt;, and they contain &lt;code&gt;25&lt;/code&gt;, &lt;code&gt;10&lt;/code&gt;, and &lt;code&gt;18&lt;/code&gt; milliliters of liquid nitrogen respectively, here are some example pours (one after another, not indiviudual):&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;x&lt;/code&gt; into &lt;code&gt;y&lt;/code&gt;: &lt;code&gt;y&lt;/code&gt; is filled, and &lt;code&gt;x&lt;/code&gt; is left with &lt;code&gt;9&lt;/code&gt; milliliters&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;y&lt;/code&gt; into &lt;code&gt;z&lt;/code&gt;: &lt;code&gt;z&lt;/code&gt; is filled, and &lt;code&gt;y&lt;/code&gt; is left with &lt;code&gt;1&lt;/code&gt; milliliter&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;z&lt;/code&gt; into &lt;code&gt;x&lt;/code&gt;: &lt;code&gt;x&lt;/code&gt; remains full, &lt;code&gt;z&lt;/code&gt; is left with &lt;code&gt;24&lt;/code&gt; milliliters&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;y&lt;/code&gt; into &lt;code&gt;z&lt;/code&gt;: &lt;code&gt;z&lt;/code&gt; remains at &lt;code&gt;24&lt;/code&gt; milliliters, &lt;code&gt;y&lt;/code&gt; is emptied&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;(Note that in your input, not all containers will have the same volume)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Task:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a list of container sizes, where the first container is initiallyfull and the amount of liquid nitrogen you must measure out, return the minimum number of pours that would be needed to leave that much in any container.&lt;/p&gt;&#xA;&lt;p&gt;You may assume volumes are non-negative integers, and the initial amount of liquid nitrogen will never be less than the amount you should end with. The actual sequence of pours you use doesn't matter, as long as you output the minimum possible count.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test cases:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Containers          Target      Output&#xA;&#xA;7, 4                3           5&#xA;12, 3, 3            4           2&#xA;100, 10, 8          84          6&#xA;8, 8                5           3&#xA;10, 0               8           2&#xA;100, 20, 20, 17     73          7&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Other:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I don't think this is a good challenge after doing the test cases&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-12-10T03:29:00.823" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24142" PostTypeId="2" ParentId="2140" CreationDate="2021-12-10T19:46:49.227" Score="-1" Body="&lt;h1&gt;Can I obtain this Minecraft item?&lt;/h1&gt;&#xA;&lt;p&gt;Given a list of items I have access to, determine if I can obtain a certain amount of some other item via crafting, mining, trading, and some other actions.&lt;/p&gt;&#xA;&lt;h2&gt;Actions&lt;/h2&gt;&#xA;&lt;p&gt;This is a list of all actions which may be performed, and what items they involve&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Crafting:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Log × 1 to Planks × 4&lt;/li&gt;&#xA;&lt;li&gt;Planks × 2 to Stick × 4&lt;/li&gt;&#xA;&lt;li&gt;Dirt × 2, Gravel × 2 to Coarse Dirt × 4&lt;/li&gt;&#xA;&lt;li&gt;Glass × 6 to Glass Pane × 16&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Mining:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The following require a wood pickaxe, or above:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Stone × 1 to Cobblestone × 1&lt;/li&gt;&#xA;&lt;li&gt;Coal Ore × 1 to Coal × 1&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The following require an iron pickaxe, or above:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Diamond Ore × 1 to Diamond × 1&lt;/li&gt;&#xA;&lt;li&gt;Emerald Ore × 1 to Emerald × 1&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The following do not require a tool:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Coarse Dirt × 1 to Dirt × 1&lt;/li&gt;&#xA;&lt;li&gt;Gravel × 1 to Flint × 1&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Smelting:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Smelting requires fuel, see below. These are the items that can be smelted:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Cobblestone × 1 to Stone × 1&lt;/li&gt;&#xA;&lt;li&gt;Sand × 1 to Glass × 1&lt;/li&gt;&#xA;&lt;li&gt;Coal Ore × 1 to Coal × 1&lt;/li&gt;&#xA;&lt;li&gt;Iron Ore × 1 to Iron Ingot × 1&lt;/li&gt;&#xA;&lt;li&gt;Diamond Ore × 1 to Diamond × 1&lt;/li&gt;&#xA;&lt;li&gt;Emerald Ore × 1 to Emerald × 1&lt;/li&gt;&#xA;&lt;li&gt;Kelp × 1 to Dried Kelp × 1&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;(unfinished)&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-12-10T19:46:49.227" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24143" PostTypeId="2" ParentId="2140" CreationDate="2021-12-10T22:40:01.753" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/238607/converge-to-a-number&quot;&gt;Converge to a number&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2021-12-15T23:04:32.987" LastActivityDate="2021-12-15T23:04:32.987" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24145" PostTypeId="1" AcceptedAnswerId="24146" CreationDate="2021-12-12T01:30:31.993" Score="0" ViewCount="238" Body="&lt;p&gt;I'm a bit confused about the use of golfing languages in golfing challenges. In the standard loopholes there is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1071/3135&quot;&gt;a point about using self-made languages that solve the problem in one symbol&lt;/a&gt;. And it's a fair point. Golfing challenges lose their purpose if you can just make up a new language for each of them which does exactly what you need.&lt;/p&gt;&#xA;&lt;p&gt;Golfing languages then, which are purpose-made especially for golfing, are coming awfully close to this. Most of them are either self-made or maintained by just a few people, if at all. They're not used for anything else BUT code golf challenges, and are specifically designed for them. Sometimes they're even focused on specific &lt;em&gt;types&lt;/em&gt; of code golf challenges. OK, so they don't have a &amp;quot;one symbol solution&amp;quot;, but... it feels to me like they go against the spirit of code golf challenges in the same way that a one-symbol language would.&lt;/p&gt;&#xA;&lt;p&gt;On the other hand, it seems that the community has readily accepted these languages (and they do always win, of course). Has there been a discussion about this? I suppose there must have been, but I can't find it.&lt;/p&gt;&#xA;&lt;p&gt;P.S. I'm not complaining and I'm not hurt about it. In fact, I'm not even participating in code-golf challenges. I just find this situation genuinely perplexing and am curious about the reasoning behind it.&lt;/p&gt;&#xA;" OwnerUserId="3135" LastActivityDate="2021-12-12T01:53:04.077" Title="Why are golfing languages allowed?" Tags="|discussion|code-golf|languages|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24146" PostTypeId="2" ParentId="24145" CreationDate="2021-12-12T01:53:04.077" Score="7" Body="&lt;h3&gt;Because &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10421/66833&quot;&gt;any language is allowed&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;We  very consistently have a policy that any language is allowed, even those that are incredibly limited, such as &lt;a href=&quot;https://esolangs.org/wiki/HQ9%2B&quot; rel=&quot;nofollow noreferrer&quot;&gt;HQ9+&lt;/a&gt;. We previously &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2028/66833&quot;&gt;required that languages be capable of 2 basic tasks&lt;/a&gt;, but that's since been superseded. As we have a policy that the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7833/66833&quot;&gt;implementation defines the language&lt;/a&gt;, the only thing we require is a working interpreter.&lt;/p&gt;&#xA;&lt;p&gt;You do correctly note that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1071/66833&quot;&gt;making up a language specifically to win&lt;/a&gt; is a standard loophole - and rightly so. The standard loopholes are supposed to be a list of things that are no longer funny, and we don't want every question flooded with a bunch of zero byte submissions in &amp;quot;MyLanguage&amp;quot;. We mitigate this in two ways: downvotes and a site policy.&lt;/p&gt;&#xA;&lt;p&gt;Downvotes are easy: if you see an answer that breaks a standard loophole, leave a comment letting them know, downvote the answer, and potentially flag for a moderator to delete it. You can essentially consider these answers to be VLQ, and should be treated as such.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, we have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14339/66833&quot;&gt;site policy&lt;/a&gt; that, &lt;em&gt;officially&lt;/em&gt;, languages only compete with themselves. If I post a Jelly solution, technically, I'm only competing against other Jelly solutions. Now, I might look at answers in 05AB1E, Vyxal, Husk, etc. and try to beat them, but, as far as the site rules are concerned, I'm only ever competing against other Jelly answers (incidentally, this is why we &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8363/66833&quot;&gt;discourage accepting answers&lt;/a&gt;). If you have a language where you've added the command &lt;code&gt;x&lt;/code&gt; specifically to solve a challenge, congrats, you've got the winning solution &lt;em&gt;in your language&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Finally, note that golfing languages generally aren't these kind of languages. Some builtins in such languages are included because of how common a task is in code golf, but that's no different than Python having &lt;code&gt;sorted&lt;/code&gt; as a builtin because sorting is a common task. The only difference is that in a golfing language, it's a single byte.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;In short:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Golfing languages are allowed because any language is allowed&lt;/li&gt;&#xA;&lt;li&gt;Submissions officially only compete within their language&lt;/li&gt;&#xA;&lt;li&gt;We have sufficient means to prevent and remove answers that attempt to cheat by deliberating adding a builtin to solve a challenge&lt;/li&gt;&#xA;&lt;li&gt;Golfing languages generally aren't adding builtins to solve specific challenges; language designers aim to balance specific builtins vs being golfy across a large range of challenges&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-12-12T01:53:04.077" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24147" PostTypeId="2" ParentId="2140" CreationDate="2021-12-12T01:55:13.857" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238575/107299&quot;&gt;Posted here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="107299" LastEditorUserId="107299" LastEditDate="2021-12-15T15:28:47.490" LastActivityDate="2021-12-15T15:28:47.490" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24149" PostTypeId="1" AcceptedAnswerId="24151" CreationDate="2021-12-13T03:15:47.047" Score="12" ViewCount="517" Body="&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://store.steampowered.com/app/736260/Baba_Is_You/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Baba Is You&lt;/a&gt; is a puzzle game. In this game, a level is a grid that consists of objects and texts, and the objective of the level is to, if there are texts &lt;code&gt;BABA IS YOU&lt;/code&gt; and &lt;code&gt;FLAG IS WIN&lt;/code&gt;, navigate Baba (a white cat-like creature) to a flag.&lt;/p&gt;&#xA;&lt;p&gt;The fuss is, there are so many variety of possible texts. &lt;code&gt;WALL IS STOP&lt;/code&gt;, &lt;code&gt;ROCK IS PUSH&lt;/code&gt;, &lt;code&gt;WATER IS SINK&lt;/code&gt;, &lt;code&gt;LAVA IS HOT&lt;/code&gt;, &lt;code&gt;KEKE IS MOVE&lt;/code&gt;, &lt;code&gt;KEY IS OPEN&lt;/code&gt;, &lt;code&gt;DOOR IS SHUT&lt;/code&gt;, and so many more.&lt;/p&gt;&#xA;&lt;p&gt;What's much more crazy is, the player can modify these rules in-game! All texts can be pushed to modify the rules. For example, if there was a text &lt;code&gt;BABA IS YOU&lt;/code&gt; and Baba pushed one of the words to break the text, now the rule &lt;code&gt;BABA IS YOU&lt;/code&gt; is gone and the player cannot control Baba anymore. For another example, if there was a text &lt;code&gt;BABA IS YOU&lt;/code&gt; and Baba replaced &lt;code&gt;BABA&lt;/code&gt; to &lt;code&gt;WALL&lt;/code&gt;, now the new rule &lt;code&gt;WALL IS YOU&lt;/code&gt; applies and the player has control on wall(s) instead.&lt;/p&gt;&#xA;&lt;p&gt;This game is known to be Turing-complete. But would that mean that this game can participate as a language for challenges in this site? Let's look:&lt;/p&gt;&#xA;&lt;h1&gt;Input method&lt;/h1&gt;&#xA;&lt;p&gt;The game uses arrow keys to move objects that &lt;code&gt;IS YOU&lt;/code&gt;. It's also possible for them to &amp;quot;wait&amp;quot; by the player pressing the space key.&lt;/p&gt;&#xA;&lt;p&gt;But as like the standards of this site, input methods must be flexible. Another method of input would include, for example, specifying a combination of in-game aspects as a codepage of input.&lt;/p&gt;&#xA;&lt;h1&gt;Output method&lt;/h1&gt;&#xA;&lt;p&gt;Beating the level may count as halting, but this game has no standard notion of an &amp;quot;output&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;As like the standards of this site, output methods must also be flexible. Specifying a combination of in-game aspects as a codepage of output would suffice.&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;This game doesn't have a notion of &amp;quot;score&amp;quot;. The size of the bounding box of the level would count as the score, though.&lt;/p&gt;&#xA;&lt;h1&gt;Meta Question&lt;/h1&gt;&#xA;&lt;p&gt;What I'm concerning is that, the input/output method might become &lt;em&gt;too&lt;/em&gt; flexible. I cannot imagine how crazy an answer in Baba Is You would be. Is this &amp;quot;language&amp;quot; really suitable for this site?&lt;/p&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2021-12-13T03:21:08.250" LastActivityDate="2021-12-13T10:30:56.270" Title="Does Baba Is You belong here?" Tags="|discussion|languages|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24150" PostTypeId="2" ParentId="24149" CreationDate="2021-12-13T08:16:30.717" Score="3" Body="&lt;h1&gt;Yes, but I/O and scoring need to be defined properly&lt;/h1&gt;&#xA;&lt;p&gt;Disclaimer: I haven't played Baba Is You.&lt;/p&gt;&#xA;&lt;p&gt;A &lt;a href=&quot;https://www.twitlonger.com/show/n_1sqrh1m&quot; rel=&quot;nofollow noreferrer&quot;&gt;TCness proof by simulating Rule 110&lt;/a&gt; gives a concrete description of a &amp;quot;program&amp;quot;, and how it should be set up and run. The initial setup of this program consists of a bunch of rules, followed by a single row of Rocks, which encodes a binary pattern and acts as the &amp;quot;input&amp;quot; of the Rule 110 program. Also, once the program starts, user interaction is not allowed.&lt;/p&gt;&#xA;&lt;p&gt;(Related &lt;a href=&quot;https://news.ycombinator.com/item?id=19905741&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hacker News thread&lt;/a&gt; is also possibly worth looking.)&lt;/p&gt;&#xA;&lt;p&gt;Using it as a model, I propose the following rules for Baba Is You:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A &amp;quot;program&amp;quot; is a representation of the initial configuration of the stage, which contains the necessary rules and other objects as needed.&lt;/li&gt;&#xA;&lt;li&gt;The 2D grid is assumed to be infinite in all four directions.&lt;/li&gt;&#xA;&lt;li&gt;The input is represented as a single row of Rocks encoding the binary pattern of the input data, and is to be set up at a specific place designated by the answer body. Unary or other data can be also used.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Reference: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10553/78410&quot;&gt;In languages without any method of input (e.g. ///) programs may get input through an insertion into the source code&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The output (for non-decision-problem) is represented as a single row of Rocks encoding the binary pattern of the output data, formed at a specific place designated by the answer body.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For decision-problems, it &lt;em&gt;might&lt;/em&gt; be possible to accept or reject by Baba winning or losing.&lt;/li&gt;&#xA;&lt;li&gt;Reference (the closest one I could find): &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7139/78410&quot;&gt;Programs may output by displaying it on screen&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Once the program starts, user interaction is simply not allowed. The linked post shows a way to enforce that by including certain additional rules, but I don't think it is necessary.&lt;/li&gt;&#xA;&lt;li&gt;Scoring is done by encoding the initial state (minus the input row) of the program in a text file and counting bytes, just like how we score textual 2D languages. If the objects do not overlap and there are 255 or fewer distinct objects in the entire game (it is an if because I haven't played it), one could propose a codepage to encode the program using 1 byte per cell. (Remember, newline, which is strictly necessary for 2D languages, is 1 byte.) Otherwise, some more work has to be done...&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2021-12-13T08:16:30.717" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24151" PostTypeId="2" ParentId="24149" CreationDate="2021-12-13T10:30:56.270" Score="14" Body="&lt;p&gt;First off, I think that programming and doing code golf in &lt;em&gt;Baba Is You&lt;/em&gt; is a fun idea.  It's a very programmatic game and I would like to see it on this site.&lt;/p&gt;&#xA;&lt;p&gt;However the game doesn't have a clear input, output or score.  You have pointed this out.  I don't think that it is a good idea to add to the ever expanding meta cruft with special rules about &lt;em&gt;Baba Is You&lt;/em&gt;.  We don't need more special cases and weirdness.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Baba Is You&lt;/em&gt; should follow the same pre-existing rules as every everyone else.  So as far as I am concerned the answer is: &amp;quot;No, &lt;em&gt;Baba Is You&lt;/em&gt; does not belong here...&amp;quot;&lt;/p&gt;&#xA;&lt;h1&gt;... But&lt;/h1&gt;&#xA;&lt;p&gt;There is a neat solution which I think will make everyone happy.  If you want to do code-golf in &lt;em&gt;Baba Is You&lt;/em&gt;, write a programming language that works like &lt;em&gt;Baba Is You&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This neatly solves all the issues here since once you've made a programming language it can compete with no special rules.  The input and output are whatever you define them to be for the programming language.  The score is simply the size of file on disc.  The limitations put in place by the game on, for example bounding box size, can be removed without hassle.  We don't have to wonder or worry about player movement.&lt;/p&gt;&#xA;&lt;p&gt;And if someone doesn't like the way it's handled and wants to do it their own way they don't have to go to meta and hash out new rules, creating more cruft.  They can fork the interpreter and change it, or write their own from scratch.&lt;/p&gt;&#xA;&lt;p&gt;Another big bonus is that you don't need to own the game to check the validity of someone else's answer, or to suggest a golf.&lt;/p&gt;&#xA;&lt;p&gt;Once you've written this you can always include pictures and animations of the game demonstrating how your code runs.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2021-12-13T10:30:56.270" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24152" PostTypeId="2" ParentId="2447" CreationDate="2021-12-13T16:14:27.037" Score="19" Body="&lt;h2&gt;You may assume that the input is valid&lt;/h2&gt;&#xA;&lt;p&gt;When parsing an input, you may assume that the input is already valid. You are not required to validate it unless the challenge is specifically about testing whether the input is valid or not.&lt;/p&gt;&#xA;" OwnerUserId="46245" LastActivityDate="2021-12-13T16:14:27.037" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24157" PostTypeId="2" ParentId="2140" CreationDate="2021-12-14T10:19:47.830" Score="0" Body="&lt;h3&gt;Tinla Resqua (Latin Square of rotated words)!&lt;/h3&gt;&#xA;&lt;p&gt;Based on this (currently closed) &lt;a href=&quot;https://puzzling.stackexchange.com/questions/113028/words-created-by-permutations-of-a-7-letter-word-in-a-grid&quot;&gt;question&lt;/a&gt; on Puzzling, your task is to take a single word generate a valid 'latin square', not by permuting the letters in a word, but by rotating the word.&lt;/p&gt;&#xA;&lt;p&gt;E.g. if one row was CENTURY then ENTURYC is a valid row, but ENTCTURY is not.&lt;/p&gt;&#xA;&lt;p&gt;Also unlike some Latin Squares, no diagonal may contain repeated letters either.&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;1&lt;/th&gt;&#xA;&lt;th&gt;2&lt;/th&gt;&#xA;&lt;th&gt;3&lt;/th&gt;&#xA;&lt;th&gt;4&lt;/th&gt;&#xA;&lt;th&gt;5&lt;/th&gt;&#xA;&lt;th&gt;6&lt;/th&gt;&#xA;&lt;th&gt;7&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;C&lt;/td&gt;&#xA;&lt;td&gt;E&lt;/td&gt;&#xA;&lt;td&gt;N&lt;/td&gt;&#xA;&lt;td&gt;T&lt;/td&gt;&#xA;&lt;td&gt;U&lt;/td&gt;&#xA;&lt;td&gt;R&lt;/td&gt;&#xA;&lt;td&gt;Y&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;R&lt;/td&gt;&#xA;&lt;td&gt;Y&lt;/td&gt;&#xA;&lt;td&gt;C&lt;/td&gt;&#xA;&lt;td&gt;E&lt;/td&gt;&#xA;&lt;td&gt;N&lt;/td&gt;&#xA;&lt;td&gt;T&lt;/td&gt;&#xA;&lt;td&gt;U&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;T&lt;/td&gt;&#xA;&lt;td&gt;U&lt;/td&gt;&#xA;&lt;td&gt;R&lt;/td&gt;&#xA;&lt;td&gt;Y&lt;/td&gt;&#xA;&lt;td&gt;C&lt;/td&gt;&#xA;&lt;td&gt;E&lt;/td&gt;&#xA;&lt;td&gt;N&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;E&lt;/td&gt;&#xA;&lt;td&gt;N&lt;/td&gt;&#xA;&lt;td&gt;T&lt;/td&gt;&#xA;&lt;td&gt;U&lt;/td&gt;&#xA;&lt;td&gt;R&lt;/td&gt;&#xA;&lt;td&gt;Y&lt;/td&gt;&#xA;&lt;td&gt;C&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;Y&lt;/td&gt;&#xA;&lt;td&gt;C&lt;/td&gt;&#xA;&lt;td&gt;E&lt;/td&gt;&#xA;&lt;td&gt;N&lt;/td&gt;&#xA;&lt;td&gt;T&lt;/td&gt;&#xA;&lt;td&gt;U&lt;/td&gt;&#xA;&lt;td&gt;R&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;U&lt;/td&gt;&#xA;&lt;td&gt;R&lt;/td&gt;&#xA;&lt;td&gt;Y&lt;/td&gt;&#xA;&lt;td&gt;C&lt;/td&gt;&#xA;&lt;td&gt;E&lt;/td&gt;&#xA;&lt;td&gt;N&lt;/td&gt;&#xA;&lt;td&gt;T&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;N&lt;/td&gt;&#xA;&lt;td&gt;T&lt;/td&gt;&#xA;&lt;td&gt;U&lt;/td&gt;&#xA;&lt;td&gt;R&lt;/td&gt;&#xA;&lt;td&gt;Y&lt;/td&gt;&#xA;&lt;td&gt;C&lt;/td&gt;&#xA;&lt;td&gt;E&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;Is a valid grid.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/latin-square&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;latin-square&amp;#39;&quot; rel=&quot;tag&quot;&gt;latin-square&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="9534" LastActivityDate="2021-12-14T10:19:47.830" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24158" PostTypeId="2" ParentId="2140" CreationDate="2021-12-14T16:55:09.850" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/238596/get-all-binary-between-a-binary-string-and-its-reverse&quot;&gt;Get all binary between a binary number and its reverse&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="107433" LastEditorUserId="97857" LastEditDate="2021-12-16T02:50:11.080" LastActivityDate="2021-12-16T02:50:11.080" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24159" PostTypeId="2" ParentId="2140" CreationDate="2021-12-15T02:50:32.977" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238533/66833&quot;&gt;Return all letter counts as an integer&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108748" LastEditorUserId="66833" LastEditDate="2021-12-22T01:06:53.957" LastActivityDate="2021-12-22T01:06:53.957" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24160" PostTypeId="2" ParentId="2140" CreationDate="2021-12-15T08:47:32.620" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/239758/kolmogorov-simple-numbers&quot;&gt;Kolmogorov-simple numbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="66833" LastEditDate="2021-12-22T01:04:07.357" LastActivityDate="2021-12-22T01:04:07.357" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24161" PostTypeId="2" ParentId="2140" CreationDate="2021-12-15T09:28:43.083" Score="0" Body="&lt;p&gt;This was heavily inspired by the &lt;a href=&quot;https://www.a1k0n.net/2011/07/20/donut-math.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;donut.c&lt;/a&gt; program&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Challenge:&lt;/h1&gt;&#xA;&lt;p&gt;You have to come up with a program that prints (in console) a shape that looks exactly like the shape of your code.&lt;/p&gt;&#xA;&lt;p&gt;For example, if your code's shape looks like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    2343&#xA;3kf5&#xA;     3o*/f&#xA;   3%kt^7&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;then the output's shape should look like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    9I8b&#xA;&amp;amp;yt^&#xA;     )ph67&#xA;   {}fgh]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(the byte don't need to match, just the shape)&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Empty programs/whitespace-only programs are not allowed.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program should have more than 2 lines/statements of code.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each line should not be identical to every other line.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;All whitespace characters (space, tab,...) don't have to be identical.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Whitespaces characters don't count towards the minimum bytes count.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program's source code and the output should not be identical. It should be at least has one different character.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The output should have at least two different bytes on one line.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You should not use comments.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Scoring criteria&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Longest code (in bytes) wins!&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If two same programs have the same byte count, the one with the most unique characters in the output wins!&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If two same programs have the same unique characters, the one with the most different characters in output compared to source code wins!&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Does this question have any duplicates?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;My wording is bad, can you improve it?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is this question interesting? Fit within the rules of the site?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="108879" LastEditorUserId="108879" LastEditDate="2021-12-15T12:36:34.743" LastActivityDate="2021-12-15T12:36:34.743" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="24162" PostTypeId="2" ParentId="2140" CreationDate="2021-12-15T09:44:40.910" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/240070/repeat-average&quot;&gt;Repeat average&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="101762" LastEditorUserId="100664" LastEditDate="2021-12-28T02:36:11.993" LastActivityDate="2021-12-28T02:36:11.993" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24163" PostTypeId="2" ParentId="2140" CreationDate="2021-12-15T12:31:16.603" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/240111/order-of-an-algebraic-number&quot;&gt;Order of an algebraic number&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2022-03-26T23:47:14.687" LastActivityDate="2022-03-26T23:47:14.687" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="24164" PostTypeId="2" ParentId="2140" CreationDate="2021-12-15T13:36:48.817" Score="0" Body="&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;You should write a program that has one in (your code in bytes) chance to output a 4 (could be a function that returns a 4). So if your code has 10 bytes, your code should have 1 in an 10 chance to print out a 4. Otherwise, output &amp;quot;finding my dice&amp;quot;.&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can use whitespaces, comments or any unnecessary code to get to the number of bytes that you want.&lt;/li&gt;&#xA;&lt;li&gt;You shouldn't use any loopholes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Winning criteria&lt;/h1&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wín!&lt;/p&gt;&#xA;" OwnerUserId="108879" LastEditorUserId="108879" LastEditDate="2021-12-16T03:46:14.303" LastActivityDate="2021-12-16T03:46:14.303" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24165" PostTypeId="2" ParentId="2140" CreationDate="2021-12-15T19:59:57.620" Score="1" Body="&lt;h1&gt;Make a negative afterimage&lt;/h1&gt;&#xA;&lt;p&gt;We've all seen the strange, inverted-color images of the American Flag or similar that look correct after you stare at them for a minute and look at a white object. These are called negative afterimages.&lt;/p&gt;&#xA;&lt;h1&gt;Your Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Given an image as input, your program should return that same image, recolored to create a negative afterimage. To do this, simply invert each color in the image. Your program may take either raw image data or a path to an image file as input, and    either create a new image file or display the inverted image as output.&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;This is code-golf, so shortest answer wins.&lt;/p&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="66833" LastEditDate="2021-12-22T01:05:13.860" LastActivityDate="2021-12-22T01:05:13.860" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24166" PostTypeId="1" CreationDate="2021-12-15T20:48:51.603" Score="5" ViewCount="89" Body="&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/2gpAb.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/2gpAb.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The double circle is partly outside the box. Is this a bug? I am using Edge, Windows 10.&lt;/p&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="38734" LastEditDate="2022-04-06T15:32:33.750" LastActivityDate="2022-04-06T15:32:33.750" Title="Badge progress circle misalinged" Tags="|bug|status-completed|badges|" AnswerCount="0" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24168" PostTypeId="2" ParentId="5243" CreationDate="2021-12-16T09:32:59.523" Score="10" Body="&lt;h1&gt;250 or 500 rep for showing off some skillz on code.golf&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://code.golf/&quot; rel=&quot;nofollow noreferrer&quot;&gt;code.golf&lt;/a&gt; is a competitive code golf site, where all solutions are hidden and users compete for a better solution for each task in each language supported. Many Code Golf SE users also compete there.&lt;/p&gt;&#xA;&lt;p&gt;I found some of particularly insane solutions, and I hereby challenge all of you to find out (or even outgolf) those solutions. Golfing I/O is often considered boring, but there are some golfing techniques that can only be utilized in strict I/O setting.&lt;/p&gt;&#xA;&lt;p&gt;Since the solutions cannot be shared, you need a code.golf account to be eligible for this bounty, so that any tie or outgolf is visible on the leaderboards. To claim the bounty, leave a comment on this answer with a link to your own Code Golf SE answer to receive the bounty.&lt;/p&gt;&#xA;&lt;p&gt;Tie record (nullifying the &amp;quot;diamond&amp;quot; score) is worth 250 rep, and outgolf (setting a new diamond) is worth 500 rep.&lt;/p&gt;&#xA;&lt;h2&gt;Records to aim for&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://code.golf/intersection#python&quot; rel=&quot;nofollow noreferrer&quot;&gt;Intersection in Python&lt;/a&gt;, 110 bytes (this one was once a hot topic on TNB, and I got a 117 &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/58465264#58465264&quot;&gt;here&lt;/a&gt;, and shortly after that JayXon outgolfed me with a 116. Several months passed and I suddenly found a golf on my own answer that swooped away 7 bytes at once(!), and no one seems to have found the trick, even though the other top 5 solvers also got their scores improved a lot.)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://code.golf/leap-years#j&quot; rel=&quot;nofollow noreferrer&quot;&gt;Leap Years in J&lt;/a&gt;, 27 bytes&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://code.golf/seven-segment#j&quot; rel=&quot;nofollow noreferrer&quot;&gt;Seven Segment in J&lt;/a&gt;, 61 bytes&lt;/li&gt;&#xA;&lt;li&gt;&lt;s&gt;&lt;a href=&quot;https://code.golf/musical-chords#j&quot; rel=&quot;nofollow noreferrer&quot;&gt;Musical Chords in J&lt;/a&gt;, 95 bytes&lt;/s&gt; &lt;em&gt;outgolfed by HPWiz by large margin&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://code.golf/intersection#j&quot; rel=&quot;nofollow noreferrer&quot;&gt;Intersection in J&lt;/a&gt;, 39 bytes (updated 2022-01-13; I found this by going back and forth between J and K, trying and backporting various possible algorithms. So the 39 is drastically different from my previous 40.)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://code.golf/collatz#j&quot; rel=&quot;nofollow noreferrer&quot;&gt;Collatz in J&lt;/a&gt;, 34 bytes &amp;amp; &lt;a href=&quot;https://code.golf/collatz#k&quot; rel=&quot;nofollow noreferrer&quot;&gt;K&lt;/a&gt;, 33 bytes (added 2022-05-07)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-05-07T12:49:41.643" LastActivityDate="2022-05-07T12:49:41.643" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24169" PostTypeId="2" ParentId="2140" CreationDate="2021-12-16T13:23:04.443" Score="1" Body="&lt;h1&gt;Fuzzy friends&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;Congratulations! You've been selected to do research a a newly discovered animal called a fuzzy, a docile, simple creature that strongly resembles a cotton ball. Fuzzies love to be near other fuzzies, but not all fuzzies want to be near each other.&lt;/p&gt;&#xA;&lt;p&gt;There are 6 types of fuzzies, 1a, 1b, 2a, 2b, 3a, and 3b. Each obeys different rules.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Type 1a fuzzies want to be near any type b fuzzy. (vice versa for 1b)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Type 3a fuzzies want to be near any type a fuzzy. (vice versa for 3b)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Finally, type 2 fuzzies want to be near any fuzzy type, a or b.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Perfect pairings are matches in which both fuzzies want to be near each other (ex. 1a and 1b)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Semiperfect pairings are matches in which only one fuzzy wants to be near the other (ex 3a and 1b)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Imperfect pairings are matches in which neither fuzzy wants to be with the other (ex. 3a and 3b)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Your Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a list of fuzzies:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Output the total number of perfect pairings. If there are any left:&lt;/li&gt;&#xA;&lt;li&gt;Output the number of semiperfect pairings. If there are any left:&lt;/li&gt;&#xA;&lt;li&gt;Output how many leftover bachelors there are.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Output and input format don't matter as long as you state them both.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;1a, 1b:&#xA;1a and 1b are a perfect match&#xA;&amp;gt; 1 perfect, 0 semiperfect, 0 bachelors&#xA;1a, 2b, 2a, 3b:&#xA;1a and 2b are a perfect match&#xA;2a and 3b are a semiperfect match&#xA;&amp;gt; 1 perfect, 1 semiperfect, 0 bachelors&#xA;1a, 1b, 2a, 3a, 3b, 3b:&#xA;1a and 1b are a perfect match&#xA;2a and 3a are a perfect match&#xA;3b and 3b are an imperfect match&#xA;&amp;gt; 2 perfect, 0 semiperfect, 1 bachelor&#xA;1b, 2a, 3a&#xA;1b and 2a are a perfect match&#xA;3a is left over&#xA;(note: could also be:&#xA;2a and 3a are a perfect match&#xA;1b is left over&#xA;for the same result)&#xA;&amp;gt; 1 perfect, 0 semiperfect, 1 bachelor&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="78850" LastEditDate="2021-12-19T12:38:24.353" LastActivityDate="2021-12-19T12:38:24.353" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24171" PostTypeId="2" ParentId="2140" CreationDate="2021-12-16T19:57:18.283" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/239788/106959&quot;&gt;Check if the string is reshaped.&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="106959" LastEditorUserId="106959" LastEditDate="2021-12-19T01:15:30.340" LastActivityDate="2021-12-19T01:15:30.340" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24172" PostTypeId="2" ParentId="2140" CreationDate="2021-12-16T22:16:07.437" Score="2" Body="&lt;h1&gt;Operator precedence is dead&lt;/h1&gt;&#xA;&lt;p&gt;Calculate the result of some math expressions using the following constraints:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Numbers will be between 0 and 9&lt;/li&gt;&#xA;&lt;li&gt;Operators are &lt;code&gt;+ - / *&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Expressions will always have the format &lt;code&gt;Number operator number operator number...&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Parenthesis have the highest precedence&lt;/li&gt;&#xA;&lt;li&gt;The order of reading goes &lt;code&gt;Left Left Right Right Left Left Right Right etc.&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Division by 0 never happen&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1+3-4*9&#xA;1       = 1   ; Start calculating using the left most number&#xA; +    9 = 10  ; Add 9&#xA;  3  *  = 30  ; Multiply by 3&#xA;   -4   = 26  ; subtract 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Using this method &lt;code&gt;1+3-4*9 = 26&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Input / Output&lt;/h2&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;string OR list of characters OR list of numbers and characters&lt;/li&gt;&#xA;&lt;li&gt;Can be reversed if specified in the answer&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Output: a number&lt;/p&gt;&#xA;&lt;h2&gt;Precision&lt;/h2&gt;&#xA;&lt;p&gt;Floating point errors are OK.&lt;/p&gt;&#xA;&lt;h2&gt;More examples and test cases:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;2*9 = 18&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;1+3-4*9&#xA;1       = 1&#xA; +    9 = 10&#xA;  3  *  = 30&#xA;   -4   = 26&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;8-5*0/9+8/2+3*4&#xA;8               = 8&#xA; -            4 = 4&#xA;  5          *  = 20&#xA;   *        3   = 60&#xA;    0      +    = 60&#xA;     /    2     = 30&#xA;      9  /      = 3.33333...&#xA;       +8       = 11.33333...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;Knowing that 1+3-4*9 is 26&#xA;&#xA;8-5*0/9+8/2+(1+3-4*9)*4&#xA;8                       = 8&#xA; -                    4 = 4&#xA;  5                  *  = 20&#xA;   *        (1+3-4*9)   = 520&#xA;    0      +            = 520&#xA;     /    2             = 260&#xA;      9  /              = 28.8888...&#xA;       +8               = 36.8888...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;8-2+4*6/2&#xA;8         = 8&#xA; -      2 = 6&#xA;  2    /  = 3&#xA;   +  6   = 9&#xA;    4*    = 36&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;(1+2*7)*6+3+(2*2+3)&#xA;&#xA;First group:&#xA;1+2*7&#xA;1&#xA; +  7 = 8&#xA;  2*  = 16&#xA;&#xA;Second group:&#xA;2*2+3&#xA;2&#xA; *  3 = 6&#xA;  2+  = 8&#xA;&#xA;(1+2*7)*6+3+(2*2+3)&#xA;(1+2*7)             = 16&#xA;       *    (2*2+3) = 128&#xA;        6  +        = 134&#xA;         +3         = 137&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;1+(6+(6+1*2)/2)/4&#xA;Nested group:&#xA;6+1*2&#xA;6     = 6&#xA; +  2 = 8&#xA;  1*  = 8&#xA;&#xA;Group:&#xA;6+(6+1*2)/2&#xA;6           = 6&#xA; +        2 = 8&#xA;  (6+1*2)/  = 1&#xA;&#xA;Full expression:&#xA;1+(6+(6+1*2)/2)/4&#xA;1                 = 1&#xA; +              4 = 5&#xA;  (6+(6+1*2)/2)/  = 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the answer with the least amount of bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="99115" LastEditorUserId="99115" LastEditDate="2021-12-17T23:57:27.650" LastActivityDate="2021-12-17T23:57:27.650" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24173" PostTypeId="2" ParentId="2140" CreationDate="2021-12-17T08:16:41.360" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/239734/the-most-wanted-prime-numbers&quot;&gt;The Most Wanted Prime Numbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2021-12-18T09:13:05.790" LastActivityDate="2021-12-18T09:13:05.790" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24174" PostTypeId="2" ParentId="2140" CreationDate="2021-12-17T13:09:06.247" Score="1" Body="&lt;h2&gt;Rotate two differently cased subwords independently&lt;/h2&gt;&#xA;&lt;p&gt;You have &lt;em&gt;one&lt;/em&gt; string made of two subwords in different cases, the upper case first, then the lowercase:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;And you must return each subword &lt;em&gt;cycled&lt;/em&gt; by a given increment. (N.b. the letters aren't rotated through the alphabet, but each character is shifted in the word)&lt;/p&gt;&#xA;&lt;p&gt;The subwords are &lt;em&gt;not&lt;/em&gt; always the same length as each other, and are part of the same 'data' structure. If your language cannot store strings, you're permitted to store the 'string' in a single array, e.g. &lt;code&gt;['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Here are the test cases:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Input&lt;/th&gt;&#xA;&lt;th&gt;Output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&amp;quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz&amp;quot;, 13&lt;/td&gt;&#xA;&lt;td&gt;'NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm'&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&amp;quot;ABCDEFGHIJKLMNOPQRSTUVWXYZnopqrstuvwxyzabcdefghijklm&amp;quot;, 13&lt;/td&gt;&#xA;&lt;td&gt;'NOPQRSTUVWXYZABCDEFGHIJKLMabcdefghijklmnopqrstuvwxyz'&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&amp;quot;ABCDEFGHIJKLMNOPQRSTUVWXYZnopqrstuvwxyz&amp;quot;, 26&lt;/td&gt;&#xA;&lt;td&gt;'ABCDEFGHIJKLMNOPQRSTUVWXYZopqrstuvwxyzn'&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&amp;quot;ABCDEFGHIJKLMNOPQRSTUVWXYZnopqrstuvwxyz&amp;quot;, 13&lt;/td&gt;&#xA;&lt;td&gt;'NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyz'&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&amp;quot;ABCnopqrstuvwxyz&amp;quot;, 2&lt;/td&gt;&#xA;&lt;td&gt;'BCAyznopqrstuvwx'&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&amp;quot;AAABBBcccddd&amp;quot;, 2&lt;/td&gt;&#xA;&lt;td&gt;&amp;quot;BBAAABddcccd&amp;quot;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&amp;quot;AAABBBcccddd&amp;quot;, 6&lt;/td&gt;&#xA;&lt;td&gt;&amp;quot;AAABBBcccddd&amp;quot;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&amp;quot;HELLOworld&amp;quot;, 5&lt;/td&gt;&#xA;&lt;td&gt;'LLOHErldwo'&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&amp;quot;CODEgolf&amp;quot;, 0&lt;/td&gt;&#xA;&lt;td&gt;'CODEgolf'&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;Here is an ungolfed example program:&lt;/p&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;const subWordRotate = (original, rot) =&amp;gt; [...original.split(/([A-Z]+)(?![A-Z][a-z]+)/)].map(list =&amp;gt; [, ...list].reduce((memo, char, index, input) =&amp;gt; {&#xA;  memo = memo.slice(0, input.length);&#xA;  memo.splice((index + rot) % (input.length), 1, char);&#xA;  return memo&#xA;}, Array(original.length).fill('')).join('')).join('')&#xA;&#xA;&#xA;const testCases = [&#xA;  [&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz&quot;, 13],&#xA;  [&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZnopqrstuvwxyzabcdefghijklm&quot;, 13],&#xA;  [&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZnopqrstuvwxyz&quot;, 26],&#xA;  [&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZnopqrstuvwxyz&quot;, 13],&#xA;  [&quot;ABCnopqrstuvwxyz&quot;, 2],&#xA;  [&quot;AAABBBcccddd&quot;, 2],&#xA;  [&quot;AAABBBcccddd&quot;, 3],&#xA;  [&quot;AAABBBcccddd&quot;, 4],&#xA;  [&quot;AAABBBcccddd&quot;, 5],&#xA;  [&quot;AAABBBcccddd&quot;, 6],&#xA;  [&quot;AAABBBcccddd&quot;, 7],&#xA;  [&quot;AAABBBcccddd&quot;, 8],&#xA;  [&quot;AAABBBcccddd&quot;, 9],&#xA;  [&quot;AAABBBcccddd&quot;, 10],&#xA;  [&quot;HELLOworld&quot;, 69],&#xA;  [&quot;CODEgolf&quot;, 0]&#xA;]&#xA;testCases.forEach(&#xA;    testCase =&amp;gt; console.log(`original: ${testCase[0]}, rotated by ${testCase[1]}: ${subWordRotate(...testCase)}`)&#xA;  );&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Sandbox note: I think there is a bug in my code, such that &lt;code&gt;[&amp;quot;AAABBBcccddd&amp;quot;, 6],[&amp;quot;AAABBBcccddd&amp;quot;, 7],&lt;/code&gt; return the same values. I think this is the same bug that is preventing me specifying how negative numbers work. Any help fixing the code would be much appreciated&lt;/p&gt;&#xA;" OwnerUserId="9534" LastActivityDate="2021-12-17T13:09:06.247" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24176" PostTypeId="1" AcceptedAnswerId="24177" CreationDate="2021-12-18T11:37:45.980" Score="10" ViewCount="163" Body="&lt;p&gt;&lt;strong&gt;Context&lt;/strong&gt;: Given that Vyxal is roughly under a month away from being selected for LYAL (at the time of posting, my calculations place it as being 1-2 LYALs away), I figured I'd write this so it can garner feedback and hopefully approval in time.&lt;/p&gt;&#xA;&lt;p&gt;Over in &lt;a href=&quot;https://chat.stackexchange.com/rooms/106764/vyxal&quot;&gt;the Vyxal chat room&lt;/a&gt;, we have a neat little bot called &lt;a href=&quot;https://codegolf.stackexchange.com/users/71629/vyxal-bot&quot;&gt;Vyxal Bot&lt;/a&gt; that does all sorts of cool things like post github events (e.g PRs, issues and so on), allow for funny moments in chat (&lt;a href=&quot;https://chat.stackexchange.com/transcript/message/59918059#59918059&quot;&gt;example&lt;/a&gt;) and other stuff. These commands obviously are off-topic for TNB in general, and they would be disabled during LYAL.&lt;/p&gt;&#xA;&lt;p&gt;The command that would remain active is &lt;code&gt;!!/run&lt;/code&gt; - this allows you to run Vyxal Code from chat messages, something that would be helpful during the Vyxal LYAL when it happens:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/6I4o8.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/6I4o8.png&quot; alt=&quot;Example of the run command&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=59819265#59819265&quot;&gt;hyper-neutrino has previously mentioned they'd be able to write a minimised version of the bot that makes sure only the &lt;code&gt;!!/run&lt;/code&gt; command can be used&lt;/a&gt;, so there wouldn't be any chance of abuse of other commands. The only problem could be the initial wave of people mucking around with the run command to figure out how it works, as well as people potentially spamming commands. However, those could just be moved to the bakery or trash.&lt;/p&gt;&#xA;&lt;p&gt;The bot would remain in the room for the duration of the LYAL event, which IIRC is a maximum of 24 hours, so it'd be back in the Vyxal chat after the learning finished (we need it for our own purposes after all lol).&lt;/p&gt;&#xA;&lt;p&gt;So what do y'all think? Vyxal Bot in TNB for Vyxal LYAL when it happens?&lt;/p&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2021-12-18T13:21:30.830" Title="Should we let Vyxal Bot into TNB when Vyxal is the LYAL" Tags="|discussion|chat|chat-events|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24177" PostTypeId="2" ParentId="24176" CreationDate="2021-12-18T12:17:17.847" Score="12" Body="&lt;p&gt;So long as the bot is only in the room during the event, and that it only speaks when spoken to&lt;sup&gt;*&lt;/sup&gt;, I think having the bot will be a useful resource for the LYAL event, and should be let into the room.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;*&lt;/sup&gt;Note that I'm not restricting it to only &lt;code&gt;!!/run&lt;/code&gt;, only to commands that require someone to ping the bot specifically to get it to chat. For example, if the bot has any commands that provide documentation for a given Vyxal command, those would also be helpful during the event, so should be allowed. If this results in noise, the fault isn't entirely on the bot, and we can ask the users making the noise to stop and trash the messages if need be.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-12-18T13:21:30.830" LastActivityDate="2021-12-18T13:21:30.830" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24178" PostTypeId="2" ParentId="2140" CreationDate="2021-12-18T17:20:05.820" Score="2" Body="&lt;h1&gt;Subdivide the Bezier Curve&lt;/h1&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;A &lt;em&gt;Bezier curve&lt;/em&gt; is a type of curve that has a lot of applications in all sorts of places, but most commonly, in computer graphics. It has a very simple algorithm and yet can represent a wide variety of shapes with just one common formula. If you've ever used pen tools in drawing software, you're probably already familiar with the general idea behind Bezier curves.&lt;/p&gt;&#xA;&lt;p&gt;Given an ordered list of control points, we set some parameter &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt; in the range &lt;span class=&quot;math-container&quot;&gt;\$[0, 1]\$&lt;/span&gt;. Then, for each &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt;, we draw a line between each consecutive pair of control points and select a point that is &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt; from the starting point. For example, if we have three control points and &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt; is &lt;span class=&quot;math-container&quot;&gt;\$\frac13\$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/11ZBj.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/11ZBj.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The purple point is &lt;span class=&quot;math-container&quot;&gt;\$\frac13\$&lt;/span&gt; of the way from the red point to the blue point, and the black point is &lt;span class=&quot;math-container&quot;&gt;\$\frac13\$&lt;/span&gt; of the way from the blue point to the green point. You can change the ratio and move the points around &lt;a href=&quot;https://www.desmos.com/calculator/yc6kh4svqp&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; to try it out.&lt;/p&gt;&#xA;&lt;p&gt;Now, we have one fewer point than we initially had control points. Let these be the new control points, and do this again with the same &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/hxX9A.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/hxX9A.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;(&lt;a href=&quot;https://www.desmos.com/calculator/uaqwrybz2w&quot; rel=&quot;nofollow noreferrer&quot;&gt;Desmos link&lt;/a&gt;). Now, we finally have a single point, so that is the point we obtain for this value of our parameter &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt;. The Bezier curve is obtained from all final points for each &lt;span class=&quot;math-container&quot;&gt;\$0\leq t\leq 1\$&lt;/span&gt;. For more points, we just repeat this for more steps. Here's what a Bezier curve with four control points looks like:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/T11rf.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/T11rf.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;(&lt;a href=&quot;https://www.desmos.com/calculator/tj9ooziuv4&quot; rel=&quot;nofollow noreferrer&quot;&gt;Desmos link&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a list of control points for a Bezier curve and a positive integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, subdivide the Bezier curve into &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; segments and return the points. More precisely, return the output points for &lt;span class=&quot;math-container&quot;&gt;\$t=0,\frac1n,\frac2n,\cdots,\frac{n-1}n,1\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You may do I/O in any reasonable format; for example, a list of pairs or a pair of x and y coordinates for input, and a pair of numbers for output. Floating point errors are acceptable but your outputs should have an accuracy of at least &lt;span class=&quot;math-container&quot;&gt;\$10^{-3}\$&lt;/span&gt; relative or absolute, whichever is larger.&lt;/p&gt;&#xA;&lt;p&gt;There will be at least one point and &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; will be a positive integer.&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;Given input &lt;span class=&quot;math-container&quot;&gt;\$\{(0,0),(1,3),(4,2),(5,1)\}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$3\$&lt;/span&gt; subdivisions:&lt;/p&gt;&#xA;&lt;p&gt;For &lt;span class=&quot;math-container&quot;&gt;\$t=0\$&lt;/span&gt;, we just have &lt;span class=&quot;math-container&quot;&gt;\$(0,0)\$&lt;/span&gt;, and for &lt;span class=&quot;math-container&quot;&gt;\$t=1\$&lt;/span&gt; we just have &lt;span class=&quot;math-container&quot;&gt;\$(5,1)\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For &lt;span class=&quot;math-container&quot;&gt;\$t=\frac13\$&lt;/span&gt;, we first go &lt;span class=&quot;math-container&quot;&gt;\$\frac13\$&lt;/span&gt; of the way from each control point to the next to get &lt;span class=&quot;math-container&quot;&gt;\$\{(\frac13,1),(2,\frac83),(\frac{13}3,\frac53)\}\$&lt;/span&gt;. Repeating that once more gives us &lt;span class=&quot;math-container&quot;&gt;\$\{(\frac89,\frac{14}9),(\frac{25}9,\frac73)\}\$&lt;/span&gt;. Finally, if we do it once more, we get the single point &lt;span class=&quot;math-container&quot;&gt;\$(\frac{41}{27},\frac{49}{27})\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For &lt;span class=&quot;math-container&quot;&gt;\$t=\frac23\$&lt;/span&gt;, we first get &lt;span class=&quot;math-container&quot;&gt;\$\{(\frac23,2),(3,\frac73),(\frac{14}3,\frac43)\}\$&lt;/span&gt;, then &lt;span class=&quot;math-container&quot;&gt;\$\{(\frac{20}9,\frac{20}9),(\frac{37}9,\frac53)\}\$&lt;/span&gt;, and finally, &lt;span class=&quot;math-container&quot;&gt;\$(\frac{94}{27},\frac{50}{27})\$&lt;/span&gt;. And just for a sanity check, the points are indeed on the curve:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/3ffI0.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/3ffI0.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Note that these points do not evenly subdivide the Bezier curve by arclength. The arclength of a Bezier curve actually cannot be calculated exactly and subdividing like that would have to be done via approximations.&lt;/p&gt;&#xA;&lt;h4&gt;&lt;a href=&quot;https://tio.run/##bVDdasIwGL1un@IQEL7MKLZDBoJe7gl2JzLatZmZNqlpZe3EZ@@@qGPs5yIkOec7J@ek7tuts/fDoL2roH320hpnG5iqdr7F4w1A1kDHN9BntnBVHBelRkMHuYgjX7ZHbyEUxPTNGUta0Kk7K5z6sxTQzqNT6GEsDjKOPZbYZ1VeZAtouvpNw2ZsS5N0ppDOpMIvIlGYS1a/b82@xJM/lvzyjq3@zj3IOLL/MnNmMmbW5Ck8QVJe4j2HbDz3WtJObuKo9kEgTqOGW4wKLFcQGIEaylhmeZWWUQjBhi4YsigYmW8jizGS8D1RywOaTBDyLedbxvu1yL60lEuskITJC7kmSjBBK3GHLmGXNhxShW@4/4L79FqAOm7XpRyMej4FmIN8mJpyhXydLDahFkcdL5H/6Bd6NRxBDsMn&quot; rel=&quot;nofollow noreferrer&quot;&gt;Test case generator&lt;/a&gt;&lt;/h4&gt;&#xA;&lt;p&gt;&lt;sub&gt;Credit to &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/59919990&quot;&gt;Wezl&lt;/a&gt; for the original idea.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-12-18T17:20:05.820" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24179" PostTypeId="2" ParentId="2140" CreationDate="2021-12-18T18:36:13.793" Score="0" Body="&lt;h1&gt;Find duplicates, quickly&lt;/h1&gt;&#xA;&lt;p&gt;In this challenge, you'll be given a list of positive integers or non-empty alphabetical strings (your choice), and must return a list containing all duplicates. You must do this with the minimum time complexity you can, and as few bytes as possible.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Task:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a list of either positive integers or non-empty alphabetical (lower or uppercase, your choice) strings, return a list containing all duplicates. You may contain a duplicate value any number of times, so for the input &lt;code&gt;[a, b, b, c, d, d, d, d]&lt;/code&gt;, any of &lt;code&gt;[b, d]&lt;/code&gt;, &lt;code&gt;[b, d, d, d]&lt;/code&gt;, &lt;code&gt;[b, b, d, d, d, d]&lt;/code&gt;, or even &lt;code&gt;[b, b, b, b, d]&lt;/code&gt; would be fine.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Scoring:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Scoring is by both average time complexity and bytes. A better time complexity will always beat an answer with a lower one, and byte count is a tie breaker. E.g., if there are two &lt;span class=&quot;math-container&quot;&gt;\$O(n^2)\$&lt;/span&gt; answers, at 10 and 20 bytes, and an &lt;span class=&quot;math-container&quot;&gt;\$O(n\log{n})\$&lt;/span&gt; answer at 140 bytes, it would rank higher than either of the others (until either a shorter &lt;span class=&quot;math-container&quot;&gt;\$n\log{n}\$&lt;/span&gt; answer or an answer faster than &lt;span class=&quot;math-container&quot;&gt;\$n\log{n}\$&lt;/span&gt; showed up).&lt;/p&gt;&#xA;&lt;p&gt;As in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, this is per-language, so Vyxal and Vim, Charcoal and C, or Japt and Java are not competing.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2021-12-18T18:36:13.793" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24180" PostTypeId="2" ParentId="2140" CreationDate="2021-12-18T20:59:44.977" Score="1" Body="&lt;h2&gt;Can we patch the corona certificate validation code (part 1/3)?&lt;/h2&gt;&#xA;&lt;p&gt;The new chancellor of Germany, Mr. Olaf Scholz, is in deep trouble: the Covid app does not show the vaccination status correctly beginning with booster vaccinations. He was not involved in the development of the app, since that was under chancellor Angela Merkel. He is now hiring you, Secret Agent 0x007, in order to understand the problem and later apply a strategy to fix the problem.&lt;/p&gt;&#xA;&lt;p&gt;In step 1, Mr. Scholz wants to understand how the app has worked correctly when booster vaccinations were not even thought of. Mr. Scholz is an important person, so he has no time to read lengthy source code. Your code has to be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;These are the rules of valid vaccinations:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are 4 vaccination types in Germany: BioNTech (&lt;code&gt;B&lt;/code&gt;), Moderna (&lt;code&gt;M&lt;/code&gt;), Astra Zeneca (&lt;code&gt;A&lt;/code&gt;) and Johnson&amp;amp;Johnson (&lt;code&gt;J&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;A person is considered vaccinated 14 days after the necessary amount of injections.&lt;/li&gt;&#xA;&lt;li&gt;Biontech, Moderna and Astra Zeneca need 2 injections, Johnson needs 1 injection only.&lt;/li&gt;&#xA;&lt;li&gt;If 2 injections are needed, the second injection may occur earliest 28 days after the first injection.&lt;/li&gt;&#xA;&lt;li&gt;If 2 injections are needed, the second injection may only be with the same vaccination type.&lt;/li&gt;&#xA;&lt;li&gt;You get an entry in your vaccination pass which has the date in the format &lt;code&gt;YYMMDD&lt;/code&gt;. COVID-19 is all post 2000, so we never need a 4 digit year.&lt;/li&gt;&#xA;&lt;li&gt;A full entry is in the form &lt;code&gt;YYMMDD X&lt;/code&gt; followed by a newline, where &lt;code&gt;X&lt;/code&gt; is the vaccination type.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;How the application works:&lt;/p&gt;&#xA;&lt;p&gt;You get the input in a reasonable form, e.g.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;from stdin, separated by newlines of your platform&lt;/li&gt;&#xA;&lt;li&gt;an array of strings (like &lt;code&gt;argv&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;a function with variable number of arguments (like &lt;code&gt;...&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The first line/entry is today's date, which you check the validity against. This comes from a time server, so it's always valid.&#xA;Each following line/entry is for one injection. There may be many of them, mainly limited by your platform (254 is certainly enough, also for part 2 and 3).&lt;/p&gt;&#xA;&lt;p&gt;The application gives the following output:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;injected&lt;/code&gt; after a successful injection with the 14 days period not over&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;vaccinated&lt;/code&gt; 14 days after the necessary amount of injections&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;manipulated&lt;/code&gt; in case things do not match&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;code&gt;manipulated&lt;/code&gt; takes precedence over &lt;code&gt;vaccinated&lt;/code&gt; over &lt;code&gt;injected&lt;/code&gt;. The output may contain arbitrary leading or trailing whitespace. A newline is not needed (it will be displayed in a mobile phone app textbox anyway).&lt;/p&gt;&#xA;&lt;p&gt;The output can be&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;on stdout&lt;/li&gt;&#xA;&lt;li&gt;the return value of the function&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;As there are quite some anti-vaxxers, the application checks for manipulations.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Totally invalid vaccination types (like &lt;code&gt;Y&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Mix of vaccination types for the first and second injection&lt;/li&gt;&#xA;&lt;li&gt;More injections than needed&lt;/li&gt;&#xA;&lt;li&gt;Invalid date (like 200231 - there is no February 31st)&lt;/li&gt;&#xA;&lt;li&gt;Date too early (earlier than 200101, the beginning of the pandemic)&lt;/li&gt;&#xA;&lt;li&gt;Injection date later than today&lt;/li&gt;&#xA;&lt;li&gt;Injections in wrong order (second date before first date)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You don't need to consider:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;dates other than 6 digits&lt;/li&gt;&#xA;&lt;li&gt;characters in the date other than 0-9&lt;/li&gt;&#xA;&lt;li&gt;other character than space as the separator&lt;/li&gt;&#xA;&lt;li&gt;more than 1 character as vaccination type&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;any date&amp;gt;&#xA;200231 X&#xA;= manipulated (invalid vaccination type)&#xA;&#xA;&amp;lt;any date&amp;gt;&#xA;210301 B&#xA;210329 A&#xA;= manipulated (different vaccination types)&#xA;&#xA;&amp;lt;any date&amp;gt;&#xA;210301 B&#xA;210329 B&#xA;210426 B&#xA;= manipulated (too many injections)&#xA;&#xA;210814&#xA;210301 J&#xA;210814 J&#xA;= manipulated (too many injections)&#xA;&#xA;&amp;lt;any date&amp;gt;&#xA;200231 B &#xA;= manipulated (invalid date February 31st)&#xA;&#xA;&amp;lt;any date&amp;gt;&#xA;191231 B &#xA;= manipulated (date earlier than the pandemic)&#xA;&#xA;210301&#xA;210302 J&#xA;= manipulated (date of the injection is tomorrow)&#xA; &#xA;210301&#xA;210301 J&#xA;= injected (14 days not over)&#xA;&#xA;210315&#xA;210301 J&#xA;= vaccinated (14 days over, only 1 injection needed)&#xA;&#xA;210315&#xA;210301 B&#xA;= injected (14 days over, but 2 injections needed)&#xA;&#xA;&amp;lt;any date&amp;gt;&#xA;210301 B&#xA;210302 B&#xA;= manipulated (28 days between 2 injections required)&#xA;&#xA;210331&#xA;210301 B&#xA;210329 B&#xA;= injected (28 days between 2 injections, but not 14 days after the last one)&#xA;&#xA;210412&#xA;210301 B&#xA;210329 B&#xA;= vaccinated (28 days between 2 injections, 14 days after the last one)&#xA;&#xA;210412&#xA;210329 B&#xA;210301 B&#xA;= manipulated (injections in wrong order)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;About realism: while this challenge has a realistic background, not all vaccination of rules in Germany are considered. Do not claim that your program can calculate the validity of a COVID-19 vaccination certificate.&lt;/p&gt;&#xA;&lt;p&gt;Coming up:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;part 2, in which you need to consider booster vaccinations the wrong way&lt;/li&gt;&#xA;&lt;li&gt;part 3, in which you check whether you can patch the wrong code of part 2 to make it work correctly&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I would appreciate if you participate in all 3 parts.&lt;/p&gt;&#xA;" OwnerUserId="16901" LastEditorUserId="16901" LastEditDate="2021-12-18T22:41:41.040" LastActivityDate="2021-12-18T22:41:41.040" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24181" PostTypeId="2" ParentId="16315" CreationDate="2021-12-19T04:51:57.957" Score="0" Body="&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;A &lt;a href=&quot;https://powdertoy.co.uk/Wiki/W/Clipboard_and_stamps.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;stamp&lt;/a&gt; is similar to a function and a structure block from minecraft (which is an acceptable way of counting bytes in Minecraft) and can be pasted on the screen.&lt;/p&gt;&#xA;&lt;p&gt;It is stored  locally as files and hence, we may output its byte count instead of an entire &lt;a href=&quot;https://powdertoy.co.uk/Wiki/W/Saves.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;save&lt;/a&gt; which may have many useless information irrelevant to the problem.&lt;/p&gt;&#xA;" OwnerUserId="103854" LastActivityDate="2021-12-19T04:51:57.957" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24182" PostTypeId="2" ParentId="2140" CreationDate="2021-12-19T08:40:25.080" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/240048/103205&quot;&gt;Twins' complements&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="103205" LastEditorUserId="103205" LastEditDate="2021-12-22T20:03:55.777" LastActivityDate="2021-12-22T20:03:55.777" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24183" PostTypeId="1" CreationDate="2021-12-19T23:15:26.247" Score="23" ViewCount="447" Body="&lt;p&gt;Just over a year ago, &lt;a href=&quot;https://codegolf.stackexchange.com/u/99226&quot;&gt;Omar Tuchfeld&lt;/a&gt; posted &lt;a href=&quot;https://codegolf.stackexchange.com/q/215216/66833&quot;&gt;High throughput Fizz Buzz&lt;/a&gt;, a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenge where answers should aim to output &lt;a href=&quot;https://en.wikipedia.org/wiki/Fizz_buzz&quot; rel=&quot;nofollow noreferrer&quot;&gt;Fizz Buzz&lt;/a&gt; as quickly as they can. Their challenge was &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20640/66833&quot;&gt;nominated in Best of 2020&lt;/a&gt;, and was well-received, but otherwise wasn't a massive standout of a challenge.&lt;/p&gt;&#xA;&lt;p&gt;Near the end of October, &lt;a href=&quot;https://codegolf.stackexchange.com/users/84332/ais523s-temporary-account&quot;&gt;ais523&lt;/a&gt; posted &lt;a href=&quot;https://codegolf.stackexchange.com/a/236630/66833&quot;&gt;an answer&lt;/a&gt; to this challenge that blew away all other competition. The 8 answers posted before this answer had scores around 8 or 9 GiB per second - ais' hit 31 GiB/s on their machine, and an incredible 55 GiB/s on the OP's machine. In fact, this was so incredible that it was &lt;a href=&quot;https://news.ycombinator.com/item?id=29031488&quot; rel=&quot;nofollow noreferrer&quot;&gt;posted&lt;/a&gt; to &lt;a href=&quot;https://news.ycombinator.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hacker News&lt;/a&gt;, a well frequented website about anything tech related.&lt;/p&gt;&#xA;&lt;p&gt;A couple of weeks ago, ais' post was &lt;a href=&quot;https://news.ycombinator.com/item?id=29413656&quot; rel=&quot;nofollow noreferrer&quot;&gt;posted again&lt;/a&gt; on Hacker News, and the site has experienced a brief uptick in activity, especially on that challenge. Both of these two events got me thinking about the impact that this site has had on the world of code golfing, and, through this blog post, I aim to explore that impact.&lt;/p&gt;&#xA;&lt;h2&gt;The beginnings of code golf&lt;/h2&gt;&#xA;&lt;p&gt;The exact origins of code golf are, unsurprisingly, fairly unknown. After all, the concept of making code more concise isn't exactly revolutionary. However, by 1999, references to Perl golf were floating around, and various references to APL and J golf were popping up more frequently. For a significant number of years, code golf was primarily limited to Perl, APL and J - and even then, many people avoided APL and J due to their tacit nature and, in APL's case, odd symbols.&lt;/p&gt;&#xA;&lt;p&gt;It wasn't until 2007, when &lt;a href=&quot;http://www.golfscript.com/golfscript/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Golfscript came into existance&lt;/a&gt;, that the concept of a &amp;quot;golfing language&amp;quot; become a thing. Before now, most golfing was done with practical languages, often Perl due to its symbolic commands and loose structure. APL and J used single/double character commands, but they weren't designed specifically with conciseness in mind - Golfscript was deliberately intended to be as short as possible for any given task.&lt;/p&gt;&#xA;&lt;p&gt;If you follow the field of esoteric languages - as most users of this site do - then you're likely aware of how out of date Golfscript is now, compared to modern golfing languages such as Jelly, 05AB1E, Vyxal and more. However, unlike more practical languages such as Perl, Python or even APL, you'd be hard-pressed to find these languages outside of some very niche areas of programming.&lt;/p&gt;&#xA;&lt;h2&gt;Code golf on Stack Exchange&lt;/h2&gt;&#xA;&lt;p&gt;As I've &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/23834/66833&quot;&gt;discussed before&lt;/a&gt;, code golf on Stack Exchange began on Stack Overflow, and was largely dominated by Golfscript, APL and J, with the odd Perl answer winning from time to time. However, as the on-topicness of code golf was contentious, it didn't really go far, beyond inspiring the creation of a new member of the Stack Exchange family of sites: Code Golf and Coding Challenges. In fact, for the first year or so of this site's history, nothing much happened in the publicity department.&lt;/p&gt;&#xA;&lt;p&gt;All that changed when &lt;a href=&quot;https://codegolf.stackexchange.com/u/3143&quot;&gt;Polynomial&lt;/a&gt; decided to &lt;a href=&quot;https://codegolf.stackexchange.com/q/6043/66833&quot;&gt;rickroll the entire site&lt;/a&gt;. Within days, this was &lt;a href=&quot;https://twitter.com/codinghorror/status/208470657862873088&quot; rel=&quot;nofollow noreferrer&quot;&gt;tweeted by Jeff Atwood&lt;/a&gt;, the founder of Stack Exchange, as well as being posted on &lt;a href=&quot;https://news.ycombinator.com/item?id=4052674&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hacker News&lt;/a&gt;. This caused the first spike in new user activity since the site launched a year ago, and is likely one of the first examples of Code Golf Stack Exchange leaking to other sites on the internet.&lt;/p&gt;&#xA;&lt;p&gt;However, code golf was by absolutely no means limited to Code Golf Stack Exchange. The site &lt;a href=&quot;http://golf.shinh.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Anarchy Golf&lt;/a&gt; published its &lt;a href=&quot;http://golf.shinh.org/p.rb?hello+world&quot; rel=&quot;nofollow noreferrer&quot;&gt;first challenge&lt;/a&gt; on the 29th of January 2007, almost exactly 4 years before CGCC launched, and 18 months before the first code golf challenge was posted on Stack Overflow, and, in the years since, there are multiple sites for code golf around the internet.&lt;/p&gt;&#xA;&lt;p&gt;Despite not being the first site to the online golfing scene, I would argue that Code Golf Stack Exchange's biggest impact, &lt;em&gt;by far&lt;/em&gt;, on the world of code golf originates from two main factors: activity and freedom of language.&lt;/p&gt;&#xA;&lt;h3&gt;Activity&lt;/h3&gt;&#xA;&lt;p&gt;This section is very brief - CGCC is the most active code golf website available. The most recent challenge posted on &lt;a href=&quot;http://golf.shinh.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Anarchy Golf&lt;/a&gt; (aka anagol) was 4 days ago (as of writing), &lt;a href=&quot;https://code.golf/&quot; rel=&quot;nofollow noreferrer&quot;&gt;code.golf&lt;/a&gt; has a new challenge every week or two and &lt;a href=&quot;https://codegolf.codidact.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Code Golf Codidact&lt;/a&gt;'s most recent challenge is almost a fortnight old. For comparison, CGCC averages over 2 new challenges &lt;em&gt;per day&lt;/em&gt;. Without a doubt, CGCC is the most active site dedicated to code golf on the internet. But, activity only plays a part - people will compete on slower sites, as evidenced by the existence of, well, every site less active than CGCC. The other factor is freedom of language.&lt;/p&gt;&#xA;&lt;h3&gt;Freedom of Language&lt;/h3&gt;&#xA;&lt;p&gt;As I've mentioned, I would say that the biggest code golf sites, behind CGCC, are &lt;a href=&quot;http://golf.shinh.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;anagol&lt;/a&gt;, &lt;a href=&quot;https://code.golf/&quot; rel=&quot;nofollow noreferrer&quot;&gt;code.golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.codidact.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Code Golf Codidact&lt;/a&gt;. However, if you take a quick browse through the first two, you'll notice something that differs from CGCC and Code Golf Codidact (which was based on CGCC): they have a &lt;a href=&quot;http://golf.shinh.org/lranking.rb&quot; rel=&quot;nofollow noreferrer&quot;&gt;set list&lt;/a&gt; of &lt;a href=&quot;https://code.golf/about&quot; rel=&quot;nofollow noreferrer&quot;&gt;languages that can be used&lt;/a&gt;. Compare this to CGCC's policy that allows any programming language, even &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10421/66833&quot;&gt;non-programming languages&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This is, in my opinion, the biggest difference between CGCC and other code golf sites, and the cause behind CGCC's primary impact on the code golfing world: the development of new languages.&lt;/p&gt;&#xA;&lt;p&gt;If you've been at all active in the golfing spaces over the past few years, you must be aware of the latest generation of golfing languages - what I term the &amp;quot;third gen&amp;quot; languages&lt;sup&gt;†&lt;/sup&gt; - such as Jelly, 05AB1E and Husk. For those unaware, these are languages that primarily utilise &lt;a href=&quot;https://github.com/DennisMitchell/jellylanguage/wiki/Code-page&quot; rel=&quot;nofollow noreferrer&quot;&gt;custom codepages&lt;/a&gt; to allow them to use 256 different characters for commands, rather than the 95 characters available when limited to only printable ASCII (&lt;em&gt;Editor's note: we seem to be entering the fourth generation of golfing languages now [July 2022], with fractional and irrational byte counts&lt;/em&gt;). As a result, they have far more commands available in a single byte, and so are generally much shorter. However, taking a look at the languages available on anagol and code.golf, we can see that only Jelly makes the cut, and that's only on anagol. Those who wish to use the best golfing languages need to find somewhere else to do so, and, due to its activity, that's often CGCC.&lt;/p&gt;&#xA;&lt;h2&gt;Language development&lt;/h2&gt;&#xA;&lt;p&gt;Indeed, by looking at the history of golfing languages, we can see that CGCC is a prime driver: &lt;a href=&quot;https://codegolf.stackexchange.com/u/7416&quot;&gt;aditsu&lt;/a&gt; created CJam as a better version of Golfscript, Jelly was developed by &lt;a href=&quot;https://codegolf.stackexchange.com/u/12012&quot;&gt;Dennis&lt;/a&gt; as an improvement on both J and CJam, and so on. A &lt;em&gt;countless&lt;/em&gt; number of golfing languages have been &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/6918/66833&quot;&gt;developed by CGCC users&lt;/a&gt;, and the vast majority of these are unable to be used on the other large code golf sites. In short, CGCC, by allowing any language to compete, has driven the development of golfing languages, and these golfing languages are pushing the boundaries of how short code can become.&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, this freedom of language has allowed the development of a related, but distinct, class of languages: esoteric programming languages. These are languages that are designed more to push the limits of what a programming language is, rather the specifically to compete and win at code golf. And, through the freedom  afforded by CGCC, many well-known esoteric languages have been created and the limits of existing languages have been extended. The shortest known Hello, World! program in &lt;a href=&quot;https://en.wikipedia.org/wiki/Brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;brainfuck&lt;/a&gt; is only &lt;a href=&quot;https://codegolf.stackexchange.com/a/163590/66833&quot;&gt;72 bytes&lt;/a&gt; - shorter than &lt;a href=&quot;https://codegolf.stackexchange.com/a/55438/66833&quot;&gt;Java&lt;/a&gt; - and was found by a CGCC user, &lt;a href=&quot;https://codegolf.stackexchange.com/u/15858&quot;&gt;KSab&lt;/a&gt;. Another CGCC user, &lt;a href=&quot;https://codegolf.stackexchange.com/u/61379&quot;&gt;Kamila Szewczyk&lt;/a&gt;, has created a &lt;a href=&quot;https://github.com/kspalaiologos/malbolge-lisp&quot; rel=&quot;nofollow noreferrer&quot;&gt;Lisp intepreter&lt;/a&gt;, written in &lt;a href=&quot;https://www.lscheffer.com/malbolge.shtml&quot; rel=&quot;nofollow noreferrer&quot;&gt;Malbolge&lt;/a&gt;, often termed the most difficult language to program in. There are countless answers on CGCC that demonstrate users pushing esoteric languages to their extremes, just to answer a simple &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question. And that's not even getting started on the esolangs created by CGCC users.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-ender&quot;&gt;Martin Ender&lt;/a&gt;, former site moderator, has created &lt;a href=&quot;https://github.com/m-ender&quot; rel=&quot;nofollow noreferrer&quot;&gt;multiple esolangs&lt;/a&gt;, including &lt;a href=&quot;https://github.com/m-ender/hexagony&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hexagony&lt;/a&gt;, the first 2D language based on a hexagonal grid, rather than square; &lt;a href=&quot;https://github.com/m-ender/labyrinth&quot; rel=&quot;nofollow noreferrer&quot;&gt;Labyrinth&lt;/a&gt;, a 2D language that modifies the grid as the program is executed; and, &lt;a href=&quot;https://github.com/m-ender/stackcats&quot; rel=&quot;nofollow noreferrer&quot;&gt;Stack Cats&lt;/a&gt;, a symmetric esolang where each command undoes the operation done by its corresponding command in the other program half. In a &lt;a href=&quot;https://esoteric.codes/blog/martin-ender&quot; rel=&quot;nofollow noreferrer&quot;&gt;semi-recent interview&lt;/a&gt;, Martin credited this site - CGCC (or, PPCG, as it was at the time) - for his introduction to the esoteric side of languages. I'm sure that a lot of users here can relate to that. I myself only started looking at language development after joining the site, and a lot of users use their own languages to answer challenges.&lt;/p&gt;&#xA;&lt;h2&gt;Other impacts&lt;/h2&gt;&#xA;&lt;p&gt;While I clearly consider the language side of CGCC to be the primary impact this site has had on the worlds of code golf and programming, there are a few other things that I'd be remiss for not mentioning.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://tio.run/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;Created by Dennis primarily to provide a testing environment for the many languages used on the site, TIO has since developed far beyond CGCC. It's being used more increasingly on Stack Overflow to effectively demonstrate users' answers, people are using it &lt;a href=&quot;https://chat.stackexchange.com/transcript/44255?m=52890999#52890999&quot;&gt;at work to help colleagues&lt;/a&gt; and is considering useful enough to &lt;a href=&quot;https://www.dyalog.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Dyalog&lt;/a&gt; for them to donate &lt;a href=&quot;https://chat.stackexchange.com/transcript/44255?m=45002556#45002556&quot;&gt;$500 per year&lt;/a&gt; to help cover the costs. It's a truly incredible resource, created originally for CGCC.&lt;/p&gt;&#xA;&lt;p&gt;In addition, thanks to TIO, &lt;a href=&quot;https://chat.stackexchange.com/transcript/44255?m=40360126#40360126&quot;&gt;Wolfram Language (Mathematica)&lt;/a&gt;, a typically non-free language, can be run (albeit with some limited functionality), making TIO one of the few ways that people can use Mathematica without having to pay for it.&lt;/p&gt;&#xA;&lt;h3&gt;Dyalog&lt;/h3&gt;&#xA;&lt;p&gt;You may be aware that &lt;a href=&quot;https://codegolf.stackexchange.com/u/43319&quot;&gt;Adám&lt;/a&gt; works for Dyalog. In fact, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11755/66833&quot;&gt;part of his job&lt;/a&gt; is specifically to &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/58222419#58222419&quot;&gt;be part of this site&lt;/a&gt;, and through this, Dyalog has and aims to &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=55481642#55481642&quot;&gt;hire users from the site&lt;/a&gt; as interns and employees. Dyalog, through Adám, has stated that they believe code golfers have the right mindset for using and developing APL, and our site is clearly a good place to look for those kind of programmers.&lt;/p&gt;&#xA;&lt;h3&gt;Math and science&lt;/h3&gt;&#xA;&lt;p&gt;This is fully answered by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5318/66833&quot;&gt;What contributions has PPCG made to the fields of math or computer science?&lt;/a&gt;, so I'll keep this short. Given the popularity of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; challenges, it's not surprising that CGCC has had multiple contributions to the &lt;a href=&quot;https://oeis.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS&lt;/a&gt;, such as extending and correcting existing sequences, and adding new ones. Furthermore, various other CGCC challenges have been referenced and mentioned in a number of scientific papers and articles - including our &lt;a href=&quot;https://codegolf.stackexchange.com/q/2682/66833&quot;&gt;Tips for golfing in JavaScript&lt;/a&gt;, mentioned in &lt;a href=&quot;https://books.google.com.au/books?id=HpoQAwAAQBAJ&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;Expert JavaScript&lt;/em&gt;&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Conclusion&lt;/h2&gt;&#xA;&lt;p&gt;In short, I believe that CGCC has had a large impact on the world of code golf, and a not-insignificant impact on programming as a whole. Through our policy of freedom of language, we've encouraged and revolutionised the development of golfing languages, extended the capabilities of existing esoteric languages, and have resulted in a number of useful impacts across multiple areas. I look forward to seeing what we can do in the future!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sub&gt;&lt;sup&gt;†&lt;/sup&gt;: For reference, I consider the first generation to be Golfscript, APL and J; and the second generation to be the languages that evolved from the first gen, while still only using ASCII characters - this includes CJam, Pyth and Brachylog v1.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="107299" LastEditDate="2022-07-08T14:11:46.693" LastActivityDate="2022-07-08T14:11:46.693" Title="CGCC Blog Post #4: Impact of CGCC on Code Golf" Tags="|discussion|cgcc-blog|" AnswerCount="3" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24184" PostTypeId="2" ParentId="24183" CreationDate="2021-12-19T23:15:26.247" Score="10" Body="&lt;h2&gt;Underappreciated answers&lt;/h2&gt;&#xA;&lt;p&gt;As part of blog posts, we demonstrate some of the more unappreciated posts on the site, and we highly recommend you check them out and give them an upvote. These were nominated by various users, and if you think you've found an answer that deserves more appreciation, feel free to drop a link to it in the &lt;a href=&quot;https://chat.stackexchange.com/rooms/123200/cgcc-blog-chat&quot;&gt;CGCC Blog chat room&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/75553/dylnan&quot;&gt;dylnan&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/153410/66833&quot;&gt;Jelly/05AB1E answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/97472/66833&quot;&gt;Trick or Treat polyglot&lt;/a&gt;. Not only is this a polyglot between two languages with different code pages, but dylnan also reverse-engineered Jelly's &lt;a href=&quot;https://github.com/DennisMitchell/jellylanguage/blob/master/jelly/interpreter.py#L1055-L1080&quot; rel=&quot;nofollow noreferrer&quot;&gt;string compressor&lt;/a&gt; to find a string that when decompressed contained &lt;code&gt;treat&lt;/code&gt; and when compressed contained &lt;code&gt;trick&lt;/code&gt; (both case-insensitive). Truly an impressive answer.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/238221/66833&quot;&gt;Vyxal answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/66285/66833&quot;&gt;Product over exclusive and inclusive ranges&lt;/a&gt;. Vyxal's latest version, 2.6, is well-demonstrated in this answer, which currently tops the leaderboard for the challenge. While it isn't as standout as the other answers here, it's still a very good answer and deserves more appreciation.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/101522/aaroneous-miller&quot;&gt;Aaroneous Miller&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/237334/66833&quot;&gt;Vim answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/198694/66833&quot;&gt;Write a Whitespace Interpreter&lt;/a&gt;. Continuing on from his &lt;a href=&quot;https://codegolf.stackexchange.com/a/223869/66833&quot;&gt;brainfuck interpreter in Vim&lt;/a&gt;, Aaron has decided to add another Vim interpreter to his collection. Whitespace is alright a complicated language to interpret, as shown by there being only 3 answers to the challenge, but to do it in a text editor rather than a classical programming language is even more impressive.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-12-19T23:15:26.247" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24185" PostTypeId="2" ParentId="2140" CreationDate="2021-12-20T08:33:16.650" Score="0" Body="&lt;h1&gt;Dumbo octopus flashing time &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://adventofcode.com/2021/day/11&quot; rel=&quot;nofollow noreferrer&quot;&gt;Day 11 of this year's AoC&lt;/a&gt; was about a grid of bioluminescent dumbo octopi. I'll try to explain how this works, click on the link for a better explanation.&lt;/p&gt;&#xA;&lt;p&gt;You have a 10x10 grid of octopi which slowly gain energy and flash when fully charged. Each octopus has an energy level from 0 to 9:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;5483143223&#xA;2745854711&#xA;5264556173&#xA;6141336146&#xA;6357385478&#xA;4167524645&#xA;2176841721&#xA;6882881134&#xA;4846848554&#xA;5283751526&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The flashes and energy amounts can be modelled with steps. At each step:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All octopi have their energy level increase by 1&lt;/li&gt;&#xA;&lt;li&gt;Then, any octopus with an energy level greater than 9 &lt;em&gt;flash&lt;/em&gt;. When  an octopus flashes, it increments the energy levels of all octopi adjacent (orthogonally or diagonally) to it.&lt;/li&gt;&#xA;&lt;li&gt;The flashing repeats until no more octopi can flash. Then, all octopi that flashed during this step have their energy level reset to 0.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For example (stolen from AoC):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&#xA;Before any steps:&#xA;11111&#xA;19991&#xA;19191&#xA;19991&#xA;11111&#xA;&#xA;After step 1:&#xA;34543&#xA;4&lt;b&gt;000&lt;/b&gt;4&#xA;5&lt;b&gt;000&lt;/b&gt;5&#xA;4&lt;b&gt;000&lt;/b&gt;4&#xA;34543&#xA;&#xA;After step 2:&#xA;45654&#xA;51115&#xA;61116&#xA;51115&#xA;45654&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In step 1, the octopi with energy level 9 are all incremented to 10 and flash, all incrementing the octopus with energy level 1 (initially incremented to 2) in the center and causing it to flash as well.&lt;/p&gt;&#xA;&lt;p&gt;The second part of the puzzle asks how long a configuration will take to have all octopi simultaneously flash in the same step. However, not all configurations will do this - some will fall into other cycles. Eventually, &lt;em&gt;&lt;strong&gt;all&lt;/strong&gt;&lt;/em&gt; of the configurations will repeat themselves, as there's only &lt;span class=&quot;math-container&quot;&gt;\$10^{10 \cdot 10 } = 10^{100}\$&lt;/span&gt; possible configurations - still a huge amount, but finite.&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to find a configuration that takes as many steps as possible to return to a configuration it's reached before, with more steps being better.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.reddit.com/r/adventofcode/comments/re3dyf/2021_day_11_frequency_of_synchronous_octopi/&quot; rel=&quot;nofollow noreferrer&quot;&gt;People on reddit have been investigating this&lt;/a&gt;, and the number to beat is &lt;a href=&quot;https://www.reddit.com/r/adventofcode/comments/re3dyf/comment/ho6s27x/?utm_source=share&amp;amp;utm_medium=web2x&amp;amp;context=3&quot; rel=&quot;nofollow noreferrer&quot;&gt;372886&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;p&gt;Is the explanation good, and should I bother with it?&lt;/p&gt;&#xA;&lt;p&gt;Better examples?&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2021-12-20T08:45:12.440" LastActivityDate="2021-12-20T08:45:12.440" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24186" PostTypeId="2" ParentId="2140" CreationDate="2021-12-20T11:51:14.383" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/240225/98630&quot;&gt;Schrödinger's cat program&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="98630" LastEditorUserId="100664" LastEditDate="2021-12-28T02:30:30.463" LastActivityDate="2021-12-28T02:30:30.463" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24187" PostTypeId="2" ParentId="2140" CreationDate="2021-12-20T17:19:41.827" Score="-1" Body="&lt;h1&gt;Biggest 25 byte number&lt;/h1&gt;&#xA;&lt;p&gt;You are allowed 25 bytes of source code.&lt;/p&gt;&#xA;&lt;p&gt;With these you have to calculate the biggest &lt;em&gt;finite&lt;/em&gt; number possible, assuming infinite number precision&lt;sup&gt;[1]&lt;/sup&gt;, runtime and memory.&lt;/p&gt;&#xA;&lt;p&gt;You will not be taking input and do &lt;strong&gt;not&lt;/strong&gt; have to output the final result.&lt;/p&gt;&#xA;&lt;p&gt;You are &lt;strong&gt;not&lt;/strong&gt; allowed to use a String representation, so &lt;code&gt;&amp;quot;9&amp;quot;.repeat(BIG_NUMBER)&lt;/code&gt; is disallowed.&lt;/p&gt;&#xA;&lt;p&gt;Scoring will be based of the final number, bigger numbers ranking higher.&lt;/p&gt;&#xA;&lt;p&gt;[1]: This means that for example in java you do &lt;em&gt;not&lt;/em&gt; need to use &lt;code&gt;BigInteger&lt;/code&gt; to represent big numbers, but using an &lt;code&gt;int&lt;/code&gt; would be sufficient. Over- and underflows are ignored as if the &lt;code&gt;int&lt;/code&gt; had infinite precision.&lt;/p&gt;&#xA;" OwnerUserId="106557" LastActivityDate="2021-12-20T17:19:41.827" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24189" PostTypeId="2" ParentId="5243" CreationDate="2021-12-21T07:34:44.230" Score="2" Body="&lt;h1&gt;250 Reputation&lt;/h1&gt;&#xA;&lt;p&gt;I will give anyone who writes a working answer in &lt;strong&gt;C&lt;/strong&gt; (not C++), for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/81165/jam-dont-add-like-that&quot;&gt;Jam don't add like that&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Condition&lt;/h2&gt;&#xA;&lt;p&gt;The input must be taken as integers, not as char pointers (or strings)&lt;/p&gt;&#xA;&lt;p&gt;NOTE: Comment to receive your reputation&lt;/p&gt;&#xA;" OwnerUserId="103854" LastEditorUserId="103854" LastEditDate="2021-12-21T07:44:25.973" LastActivityDate="2021-12-21T07:44:25.973" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24190" PostTypeId="2" ParentId="2447" CreationDate="2021-12-21T14:37:00.203" Score="-5" Body="&lt;h1&gt;Languages that &lt;em&gt;do&lt;/em&gt; have I/O capabilities may take input via hardcoding&lt;/h1&gt;&#xA;&lt;p&gt;i.e. you may insert input into the code directly, as if it were an output only language like ///&lt;/p&gt;&#xA;" OwnerUserId="107310" LastActivityDate="2021-12-21T14:37:00.203" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24191" PostTypeId="1" AcceptedAnswerId="24192" CreationDate="2021-12-21T21:38:53.857" Score="7" ViewCount="115" Body="&lt;p&gt;I went into a chat room, and someone said something offensive to me. So I flagged it as offensive. Almost immediately, the chat message was edited into something nicer. When the 10k-ers came into the chat room, the message was already edited into something nicer, so they could not see the offensive message. What should I do in this case?&lt;/p&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="16766" LastEditDate="2021-12-23T18:57:03.317" LastActivityDate="2021-12-23T18:57:03.317" Title="What to do when something offensive in chat is edited into something not offensive before it is seen" Tags="|support|chat|flags|" AnswerCount="1" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="24192" PostTypeId="2" ParentId="24191" CreationDate="2021-12-21T21:47:12.520" Score="6" Body="&lt;p&gt;For starters, the full history of a (non-deleted) message can be seen by all users. Additionally, room owners and moderators can see the history of any messages, deleted or not. Therefore, you're always able to point to the message to provide proof to a moderator for the fact that something offensive was said.&lt;/p&gt;&#xA;&lt;p&gt;This is an appropriate time to flag a message for moderator support. If you click the drop-down arrow on the lefthand side of a message, you'll see this pop-up:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/FBHMs.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/FBHMs.png&quot; alt=&quot;message action pop-up&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;See at the bottom is the option to &amp;quot;flag for moderator&amp;quot;. Unlike flagging as spam/offensive, this option allows you to briefly describe the problem to a moderator, so they can handle it. Additionally, these flags are only shown to diamond moderators, rather than to any user with 10k reputation in chat.&lt;/p&gt;&#xA;&lt;p&gt;Here, flag the edited message for moderator, explain briefly what happened (e.g. link to this meta question) and they'll take the appropriate actions (such as deleting the message, or purging the revision history etc.)&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2021-12-21T21:47:12.520" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24193" PostTypeId="1" CreationDate="2021-12-21T21:57:38.783" Score="8" ViewCount="278" Body="&lt;p&gt;I'd like to announce &lt;a href=&quot;http://golfscript.com/nibbles&quot; rel=&quot;nofollow noreferrer&quot;&gt;Nibbles&lt;/a&gt;. My goal was to create something as simple as golfscript but as short as any modern golf language. My hope was that by having few enough instructions, they could be encoded in less than 1 byte and that this would cancel out enough of the benefit of complexity. I know complexity will ultimately win, but I personally prefer to golf in a simple language. And for now I believe Nibbles can hold its own.&lt;/p&gt;&#xA;&lt;p&gt;Here are some highlights:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Common instructions are 1/2 byte&lt;/li&gt;&#xA;&lt;li&gt;There is a literate form that mostly corresponds to binary length (2x)&lt;/li&gt;&#xA;&lt;li&gt;Purely functional and lazy&lt;/li&gt;&#xA;&lt;li&gt;Types are Integer, Char, List, Tuple (no floats for now, but it's a future possibility)&lt;/li&gt;&#xA;&lt;li&gt;Syntax is prefix with DeBruijn indicies for referencing arguments&lt;/li&gt;&#xA;&lt;li&gt;Not tacit (to allow more type overloading)&lt;/li&gt;&#xA;&lt;li&gt;Mostly not vectorized (again to allow more type overloading)&lt;/li&gt;&#xA;&lt;li&gt;Statically typed, but you won't notice.&lt;/li&gt;&#xA;&lt;li&gt;Written in and compiles to Haskell.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For posting solutions I recommend just posting the literate form and the binary size in bytes. (Just like assembly language does).&lt;/p&gt;&#xA;&lt;p&gt;Despite the goal of simplicity I've been working on this for 9+ months. Much of the work has revolved around creating the abstraction around the literate form so that you don't have to think about how it gets compacted yet feels like you are codegolfing like normal.&lt;/p&gt;&#xA;&lt;p&gt;Please submit feedback (either in github or email listed on the website), bug reports or improvement ideas are the greatest gift I can receive. I'd like to keep the language stable for a bit to gather data on what gets used and doesn't but in a future version I'm not opposed to changing things up. As for big changes like making it tacit, those will never be incorporated into Nibbles as it breaks the whole paradigm, but I am already thinking about ideas for another language, so I am all ears for those too!&lt;/p&gt;&#xA;" OwnerUserId="94929" LastEditorUserId="94929" LastEditDate="2022-03-02T16:34:08.683" LastActivityDate="2022-03-02T16:34:08.683" Title="New Codegolf language: Nibbles" Tags="|discussion|languages|" AnswerCount="0" CommentCount="4" ClosedDate="2021-12-29T12:40:46.650" ContentLicense="CC BY-SA 4.0" />
  <row Id="24194" PostTypeId="1" CreationDate="2021-12-22T23:51:44.823" Score="2" ViewCount="46" Body="&lt;h2&gt;The reason title length exist&lt;/h2&gt;&#xA;&lt;p&gt;Because it's useful to prevent spam on most of the other site, you would not like to see bunch of 1 character question flooding.&lt;/p&gt;&#xA;&lt;h2&gt;But...&lt;/h2&gt;&#xA;&lt;p&gt;I already meet the situation a few time before, that I named the question properly, but it's still under 15 character, for example: &lt;code&gt;Repeat average&lt;/code&gt; have only 14 char, inconveniently just below 15 character limit although it being the best title I can use to explain the problem.&lt;/p&gt;&#xA;&lt;h2&gt;What I actually want to say&lt;/h2&gt;&#xA;&lt;p&gt;I know it's difficult to change title length specifically just for one site, and it's not a huge inconvenience to a point where it should be change immediately, but there aren't any meta question that talked about this question, so I am putting it up here to gather your thoughts about this feature that may can be improved.&lt;/p&gt;&#xA;&lt;h2&gt;my advice&lt;/h2&gt;&#xA;&lt;p&gt;If we can, I am thinking of removing the title length limitation and only limit to &lt;em&gt;at least have title&lt;/em&gt;(or title length &amp;gt; 0), or we can lower the limit to 10/5 bytes, allowing some short terms that perfectly describe the problem to be used in title, let anyone scrolling through the question list have a better understanding of what you question might be about in the first place.&lt;/p&gt;&#xA;" OwnerUserId="101762" LastEditorUserId="66833" LastEditDate="2021-12-22T23:57:09.063" LastActivityDate="2021-12-22T23:57:09.063" Title="Remove question title length limitation" Tags="|feature-request|titles|" AnswerCount="0" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24195" PostTypeId="2" ParentId="24183" CreationDate="2021-12-23T05:55:44.517" Score="3" Body="&lt;p&gt;Another major difference between CGCC and other code golf sites is that the answers here are manually checked by users, versus other sites that use a judge program accepting answers that only satisfy test cases. My view, coming from competition programming and which is in the minority on this site, is that I/O should be strict to provide a level playing field and avoid too &amp;quot;creative&amp;quot; I/O interpretations that stray from the purity of the task at hand. This is a significant hindrance to esolangs which may not support standard I/O, but does make conforming answers much more fairly comparable in a leaderboard, granted this site emphasizes creativity over leaderboards and scores.&lt;/p&gt;&#xA;" OwnerUserId="17360" LastActivityDate="2021-12-23T05:55:44.517" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24196" PostTypeId="2" ParentId="24183" CreationDate="2021-12-23T06:04:05.693" Score="5" Body="&lt;p&gt;A comment on history: The code golf challenge quality has increased over the years. Old questions/challenges are often one or two sentences and don't specify test cases or how I/O should look like. I myself was guilty of famous questions of the notorious &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot;&gt;underhanded&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-trolling&lt;/a&gt; tags, which was eventually deemed disallowed (a bit of a shame - they provided some of the most entertaining and whimsical answers in the site's history).&lt;/p&gt;&#xA;" OwnerUserId="17360" LastActivityDate="2021-12-23T06:04:05.693" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24200" PostTypeId="1" AcceptedAnswerId="24201" CreationDate="2021-12-24T19:06:32.227" Score="2" ViewCount="50" Body="&lt;p&gt;Mine got closed because it was the same as the Hello World Thread, which isn't the case since the text contains a lot of repeating words and symbols, which are easily compressable. I also got downvoted 2 times without explanation.&lt;/p&gt;&#xA;&lt;p&gt;Link: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/240131/the-64-bit-32-bit-meme&quot;&gt;The 64 Bit, 32 Bit.... Meme&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="107433" LastActivityDate="2021-12-24T19:40:59.217" Title="Is there a rule about Questions asking to print a specific text?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24201" PostTypeId="2" ParentId="24200" CreationDate="2021-12-24T19:40:59.217" Score="6" Body="&lt;p&gt;The thing about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenges is that unless your challenge adds something particularly interesting or new to the scene of kolmos, it's likely to be closed. Whether it's a duplicate of Hello World, 10x10 asterisks, rickroll, 99 bottles, etc. is more or less arbitrary.&lt;/p&gt;&#xA;&lt;p&gt;In this case, this challenge is a short piece of English text. It has some repetitiveness but not enough to make it particularly interesting, especially since the change in pluralization and exclamation marks as well as the words near the bottom means a large part of it can't be numerical/mathematical compression and will jsut end up being standard text compression algorithms / language built-in string compression.&lt;/p&gt;&#xA;&lt;p&gt;It does contain repeating words and symbols which &lt;em&gt;are&lt;/em&gt; easily compressable on their own but the challenge is sort of like multiple parts stitched together and with &lt;code&gt;!&lt;/code&gt; being only one character, the arbitrary exclusion and inclusion of it on different lines means it is probably more efficient to just hardcode it since you can't really compress one byte of data.&lt;/p&gt;&#xA;&lt;p&gt;TL;DR: The downvotes are probably for the same reason as the closure - it's just not all that interesting and doesn't add much to existing kolmo challenges as a &amp;quot;compress short English text with a few components that make it not totally boring&amp;quot;.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-12-24T19:40:59.217" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24203" PostTypeId="2" ParentId="2140" CreationDate="2021-12-26T00:33:11.767" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241412/shrink-ascii-art&quot;&gt;Shrink ASCII art&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-01-19T20:04:58.450" LastActivityDate="2022-01-19T20:04:58.450" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24204" PostTypeId="1" AcceptedAnswerId="24205" CreationDate="2021-12-26T18:18:24.453" Score="1" ViewCount="28" Body="&lt;p&gt;How do I search for questions with least X answers? I want to search for questions with least 30 answers but I can't.&lt;/p&gt;&#xA;" OwnerUserId="106959" LastEditorUserId="66833" LastEditDate="2021-12-26T18:24:40.387" LastActivityDate="2021-12-26T18:24:40.387" Title="How to search for questions with least X answers without SEDE?" Tags="|support|search|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24205" PostTypeId="2" ParentId="24204" CreationDate="2021-12-26T18:20:36.217" Score="2" Body="&lt;p&gt;&lt;code&gt;is:question answers:30..&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;You can use &lt;code&gt;x..y&lt;/code&gt; to search between &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; (inclusively).&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2021-12-26T18:20:36.217" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24207" PostTypeId="2" ParentId="2140" CreationDate="2021-12-26T21:32:13.680" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241210/sides-of-a-polygon&quot;&gt;Sides of a polygon&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-01-18T00:42:38.317" LastActivityDate="2022-01-18T00:42:38.317" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24208" PostTypeId="1" CreationDate="2021-12-27T04:59:22.193" Score="15" ViewCount="182" Body="&lt;h1&gt;Advent of Code Golf 2021 is over!&lt;/h1&gt;&#xA;&lt;p&gt;Thanks to everyone who participated in and/or helped me run the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/24068/78410&quot;&gt;Advent of Code Golf 2021&lt;/a&gt; event. It wouldn't have been so successful without the help of the community.&lt;/p&gt;&#xA;&lt;h2&gt;Special thanks&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Everyone who solved one or more AoCG challenges: 49 users, giving 323 answers using 41 different languages!&lt;/li&gt;&#xA;&lt;li&gt;Everyone who left feedback in the dedicated sandbox; it would have been extra painful to QA the challenges without them, especially on my off-days.&lt;/li&gt;&#xA;&lt;li&gt;Everyone who posted the challenges at the right time on my off-days: &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt; (6 times!), followed by &lt;a href=&quot;https://codegolf.stackexchange.com/users/97857/pxeger&quot;&gt;pxeger&lt;/a&gt; (twice) and &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt; (once).&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;Wheat Wizard&lt;/a&gt; who contributed three of the challenges (days &lt;a href=&quot;https://codegolf.stackexchange.com/q/238209/78410&quot;&gt;8&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/q/238522/78410&quot;&gt;15&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/239985/hyperbolic-rescue&quot;&gt;22&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Statistics&lt;/h2&gt;&#xA;&lt;p&gt;The answers were given in &lt;strong&gt;41&lt;/strong&gt; different languages.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Many of them used popular languages (like Python or JS),&lt;/li&gt;&#xA;&lt;li&gt;but some were in general-purpose languages but not so popular in code golf (like Rust, C, Clojure, or Factor),&lt;/li&gt;&#xA;&lt;li&gt;some were given in golfing languages (05AB1E, Jelly, Vyxal, Japt, MathGolf),&lt;/li&gt;&#xA;&lt;li&gt;some in array languages (APL, J, BQN),&lt;/li&gt;&#xA;&lt;li&gt;some in plain esolangs (&lt;a href=&quot;https://codegolf.stackexchange.com/a/238195/78410&quot;&gt;Whitespace&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/238043/78410&quot;&gt;SnakeEx&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/238442/78410&quot;&gt;Thue&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/238435/78410&quot;&gt;Turing Machine Code&lt;/a&gt;),&lt;/li&gt;&#xA;&lt;li&gt;and even some in the answerers' own creation (&lt;a href=&quot;https://codegolf.stackexchange.com/a/237993/78410&quot;&gt;ayr by ZippyMagician&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/239926/78410&quot;&gt;Whython by pxeger&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And &lt;strong&gt;49&lt;/strong&gt; users participated in solving the challenge, some of whom are relatively new users (the criterion being &amp;lt;1000 rep; I know it's arbitrary, but I don't want to dig into other users' history of activity):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/108595/ezhik&quot;&gt;Ezhik&lt;/a&gt;, who solved &lt;strong&gt;21&lt;/strong&gt; challenges in &lt;strong&gt;Rust&lt;/strong&gt;! Considering the difficulty of some of the challenges and the (relative) unpopularity of the language, this is a great dedication and achievement.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/74571/ajax1234&quot;&gt;Ajax1234&lt;/a&gt;, who solved &lt;strong&gt;16&lt;/strong&gt; challenges in &lt;strong&gt;Python&lt;/strong&gt;. Trying and being outgolfed is a great way to learn.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/108388/lonelyelk&quot;&gt;lonelyelk&lt;/a&gt; solved 4 challenges in Ruby, and &lt;a href=&quot;https://codegolf.stackexchange.com/users/64361/madison-silver&quot;&gt;Madison Silver&lt;/a&gt; solved 3 in Haskell.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/104563/sfieger&quot;&gt;sfieger&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/108684/terom&quot;&gt;terom&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/108678/vojket&quot;&gt;Vojket&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/100563/m-virts&quot;&gt;M Virts&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/users/82944/wojciech-graj&quot;&gt;wojciech-graj&lt;/a&gt; solved one challenge each. Welcome everyone, and we hope you enjoy solving other challenges as well!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Scoreboards for fun :)&lt;/h2&gt;&#xA;&lt;p&gt;Here's AoC private leaderboard-style&lt;sup&gt;1&lt;/sup&gt; scoreboard for &lt;strong&gt;users&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;                                 1111111111222222&#xA;Username                1234567890123456789012345  Solved  Score&#xA;----------------------------------------------------------------&#xA;alephalpha              *************************      25   2073&#xA;Neil                    *************************      25   1390&#xA;Kevin Cruijssen         ****************   **  **      20   1043&#xA;tjjfvi                  ***********************        23    935&#xA;Ezhik                   *********************          21    850&#xA;G B                     ************ **** ***          19    775&#xA;tsh                     *********   * ***  ** **       17    765&#xA;Ajax1234                 ****  ****** ** ****          16    720&#xA;Arnauld                 **** *  **   **  * **          12    537&#xA;loopy walt               **  ** *  ***  **  *          11    471&#xA;Dominic van Essen       * **** *** * *      *          11    456&#xA;emanresu A               *  *     **           *        5    412&#xA;ovs                     *****    ***     *              9    355&#xA;pxeger                   **       *   *  *  *           6    262&#xA;Jonah                   ** *  * **                      6    251&#xA;pajonk                   ***   * * *                    6    236&#xA;Razetime                ***     * *                     5    190&#xA;lonelyelk                      *   *     **             4    164&#xA;Jonathan Allan          *          *        *           3    158&#xA;Madison Silver                             **  *        3    125&#xA;hyper-neutrino          * *                             2     97&#xA;DLosc                    **                 *           3     97&#xA;wasif                       *     *                     2     82&#xA;AZTECCO                   **                            2     69&#xA;Kaddath                  *       *                      2     67&#xA;SuperJedi224                       *                    1     62&#xA;MarcMush                 **                             2     52&#xA;Noodle9                          *                      1     49&#xA;Anders Kaseorg                               *          1     49&#xA;caird coinheringaahing   *                              1     47&#xA;M Virts                       *                         1     46&#xA;att                                            *        1     46&#xA;wojciech-graj                 *                         1     43&#xA;Giuseppe                              *                 1     43&#xA;Unrelated String          *                             1     42&#xA;chunes                   *                              1     41&#xA;user                       *                            1     41&#xA;Vojket                     *                            1     38&#xA;ZaMoC                     *                             1     37&#xA;Xcali                         *                         1     37&#xA;sfieger                 *                               1     36&#xA;m90                               *                     1     35&#xA;terom                   *                               1     33&#xA;Yousername                 *                            1     33&#xA;Engineer Toast           *                              1     29&#xA;DeathIncarnate            *                             1     29&#xA;Zaelin Goodman           *                              1     28&#xA;ZippyMagician            *                              1     27&#xA;mazzy                    *                              1     25&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and here's the same for &lt;strong&gt;languages&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;                              1111111111222222&#xA;Language             1234567890123456789012345  Solved  Score&#xA;-------------------------------------------------------------&#xA;Python               *********************          21   1688&#xA;Pari/GP              *************************      25    986&#xA;Charcoal             *************************      25    955&#xA;JavaScript           **** ** *** ****** ** **       19    784&#xA;Wolfram Language     ******************** ****      24    777&#xA;Ruby                 ************ ********          20    755&#xA;TypeScript Types     ***********************        23    751&#xA;Rust                 *********************          21    682&#xA;05AB1E               ************ **    **  **      18    650&#xA;R                    **** * *** * **     *          12    495&#xA;Jelly                *** *      *        *  *        7    321&#xA;BQN                  ***     ****     *              8    246&#xA;Java                 ** *  *  *  *  *                7    219&#xA;Retina                **       **         *          5    195&#xA;J                    **    * **                      5    166&#xA;Vyxal                 *  *      *           *        4    150&#xA;Husk                    **      *                    3    121&#xA;Haskell                                 **  *        3    101&#xA;C                          *  *                      2     76&#xA;Perl 5                     *              *          2     70&#xA;MathGolf                  *   *                      2     65&#xA;Zsh                   *        *                     2     60&#xA;Pip                    *                 *           2     58&#xA;APL                  * *                             2     57&#xA;Japt                   **                            2     53&#xA;PHP                   *       *                      2     51&#xA;Regex                           *                    1     39&#xA;PowerShell            *                              1     37&#xA;Whython                                  *           1     37&#xA;Julia                 **                             2     36&#xA;Factor                *                              1     33&#xA;Whitespace                 *                         1     31&#xA;x86-32 machine code            *                     1     27&#xA;Clojure              *                               1     25&#xA;TI-Basic                *                            1     25&#xA;Turing Machine Code             *                    1     24&#xA;Thue                            *                    1     22&#xA;Excel                 *                              1     21&#xA;Burlesque              *                             1     21&#xA;ayr                   *                              1     19&#xA;SnakeEx               *                              1     15&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The scoreboards were generated using &lt;a href=&quot;https://tio.run/##vVprb9s4Fv3uX0HMF9vTpCvqrQAdIE0z6aTNbDbJdHZrBAUrM7EcWfLokcYt@tu7vNSbomhlF7tAm9h8895zz30w2122iiPjx48lyQh6hRaL2fSSJMHfzi6nB8j1DtCUhHS7IiH7P50fTBBiA/gk1o8Nkw1Y7bY0OYxoniVBFFeDbljrtZ8E2wzBx5QNtx2NDc/W67vHoBp2siKJH5OQdZsG6/2dBmF/H4xhYrqqejTr@DU@ZT2Gwzre0ccgQidJHqzTlEbVoKv8844N8WDZM/S6aU4z1qzzs59@XQUPVc85eSTFkfnd4LDHSUTycFmNOL58D5uCWOLHtGr9Mw7vErJB70l0n5N7Cpu6UsmdwzVh3/M4IvVtXv/jd9Zu2az9inylWbCh7SPBjiZsmd4F9J4m9UVqDbyJN0EU@OiRROi0LYJzGoYgA@yVe2YrNuQ4DEk95CSM13kCZ9YtGJXRJN5M57esdyHVooGNnhav2KEjOKiJBR3WJ4AOnwTJEvlxEK0ow8o9ISv2s6duB85xvCZPmClJAhRsi5u0FcdvIeitgbSD1ZB29C7SfiV@FifQAYL2V3lE094kG6ASxvF2h76QIKv6P@yeivNCN92QKKFpjo7bYDAsEQw1tN0uyEokeOYw4D@yY5cmsX3qIKWAfGFGHcgDhhzYaUvWcfQgmI6Fu6ZTAJUDWATq5VtOGHDTd2TJ2KS@0OmTT8Nqm9PoPogoTdBNTNJaUJfxF5pcrxhUYFM4/0dCQ3bFszhebhqskh1oQgcFfwy2290FuQ/8oOmXGKItN8TujgDoDfn6dVcLOw8DkLYN6rlgwLvIG0hcR@SBnj6BqOG6b97HqV8bTI13a5AZO0O6imoYz9YlNtCYmSdYQJtGHZFG9/F5x3yKjbvmU58Y@v5gMA5JRpfoGq7VN1@sm10bKmFjSGAj4Redm2iXX1qewJCamkTzlsVxdBGfiKi2uqiuLc5T@BLo1np2UvgDXfAHMNg1VLxcGaQu8UFcCzrXwseb05OTv9dizJOQpn/ltCL0N5SZ2W@RT5i2Mipi1zEk2L0MtrC62cNtAxJD3w8SbqMCSNoQtAQIlve1e9eV6I3vL6dEQc4N/wqkDQow9Z623ubpQ4XiPG2srmx3lZ600AtnUEEv9fF0uPaHeP1As7EGXSDStruILLmea3AAkDLHrOk9w7n57fA1SQO/kuu/Yrh4RMACS8239SY61sqD6bbUg9W303WZy65oQ5f7vwZymLuUPuZK2BimK@KmkSunFVloyHdtoaXUMm8eVHNzI67pL0x2d72VsUIvEkC77sDlPhec6nWVL9Gsx@2t0mxfb7oyILINVUBk6eqASLStusOTBz0VyboDJIsVAcwF47MzJsA9Mr6qjrWXXzU8gnBMuVeUWZin1oNhDLpee4zrtQdEjXmocIE@BEmWCoLmcalM0Dw4GZDgCQcebPclXvsB9VeH9wlZC/zjqhxiKWFT63kwuAkWOfzPVZDRdEt87r0cxcr1rV25q7@kSYgs6Ieb/9MnYaBQrmOPVa7OhSwot8VR2FUbiu5hCQe2dKgNEJWpgHoLXDx@ljhVQzNlUT3WcT@s55GDo7acgpVchws/ouGOhg89ztK6oJMIHmvOWMmblqY0q16024poHbVSBkiqY3aeUFw4r5KoDoArwFv9HEruxBvGc4f12zmIIyHq8ZAuomwDy5KzGqO2DKNXlRAGUSHjQs4OotJqnLLELaTeMM0N@iOecvVv1/Z2YoIzpLDCEQnu9apijq5pjNYWTLeGh5RaMLqxR8uxqWiZZ@NK8yzSbI4AIc3eE2k2BQ7nWcGL4461YotLVagLlbU2zWqMpoRKncvycHwweOEFJVXs6OyhZczraopqkuENlR0tU7q3olzXYntHDB/L6owlqc5woBpCnbLRmNkFk0T22OuH/uOLIRW1ccPsUNuTax8aOtoQfxVEFPnxklYcs/G0vu1IsTU2w6ySDU8q9SsmsqfK@mXdJZy4axoojWBrSNWurshf7MHiaT3fdAbHXFUlB7HExoVu2TLnbSqj2wKAWOCYCkamzHHLwl481rILVz5QkTFsVRrQS25yKBmhixJQJwWgOCdd51uanNNloOvmczLzmxWviHD2ka3RKagOgVMawIzOC1ytT32tyNHF@2N/7AnhYRu22iBusT0c4PBSrTEi0LawJ61NFOFl@52kZ8qWt89bW4P0WmQB/bM3dKLtfdzBmqR00ghVk9SpruqkexBSsmoiVlYo2g5u2EPyjEvMMGoKwj3P0A56vOdWdRv/4cq4rS0nV/LU1Uy3@8U1HgGdBXlKt1sqxsH63tzA8ZR@yOiVe0a990lrySqJ264sNGgEa1ojknadZydt@ZQ8jHXpu6Pl9Bi/rWZemm3rWcbHutZ/gist3tafF98ZPOlo31FSXnIHsVdktaryEZYn8TUJjCFH25GK2LL3Vs4M7AwFpUXRcV9xyHHk4mlE4O0LQD1LgjIZPRiO6nnc0AeDF1MtY88bfBG0euWbMoGx@q@PLVp1JbRa6MS1R4YfPdYSrVOXPgPvd6vl1UzdHkjUeazXO2Lb3xqiv5WFB5atLOtq@8Hp2KaCnbCtvr@75yW7KAD1rcbVFB7T05UPO7azn50M7m/kJtePdt@S9KF4hfWK96plkMYRug7CxwatslRGXiZoimpYEe3tfcvqmlZPB8Ujmtc8oskSR8kj5aoe0H@jb7ud0SVLz1UxRs@XNMLmYaNc2F3hiLWx6iVYG8x3xj6n2u6IOqT4FwglkFytH5PWZWFeRYuWNEnRO5LSOLlXlinl0m7xzFC0UmWclrXfKCxbqSncKkL0K8/WmPxB1wfzB9fbT2feaNB5nqmqkw@gt4sqIaSsMn9XmtrLohbuc7NMhKV8gbZJGMMmYQ2ahBrSkoK1KmAy1cSla8@K37AmFlNuJ7eTSRqHKfw5H/uN7uIELckOsRX5X/nBd2jn33e3k7sk3iA/DkPqZ0EcpSjYbOMkY8l5HmU0mTDbvofFyu8zNneh3baXgd3mE3hZFsfpknFRtWBIoxn/zNqqydDGP88nqR8n9HNMkuWnqvcbfDhCi8WvJEzpLfqZv7mXh4E@2IUP/j6BptnyAO44h2Ya5RuakIzOQArzowny8@QT34StXBxggpYsLuDbsbaUZrP5hK/Nz3mA@OgDBO/n81J@bB0U3PEm3lLNP0JbkrIFm5aXZLmc8amsVbzcAjpumVwXy1u29U2S0@FR@Ba9eNUcnw1srnL4CuFJSO@yTxuS3LMTvUIb8jQDuRbHhutUpy0kjV4gfbJNgiibTdGUCXXWnv8CeTBiiqEHa/BRh4/2vJrzR/UnBdDXX@AQubDAbAo@1LId19NgjDFfHOnWLZ@DrmNmb0v2G@4wrVc@lJzG1ObzQrlw@gMUZHQzL9CVZHQ5E2X2Egaks/kBeqC7VyHZfF4S9HSEDp@YHNk/QEKx3d1PHF8vwzXzMu1d59@/Tacv13EQMQH9PF0EBeAC2BVWZ2qbf0foW5pvZtX3o19saOJf8e3RL9b3n6prdaBdGcM3@DAEbeiDzfjgZ0ObzyqhzVd6HrSrzev5XWhDC4c2fBCgzXdewE8VtNuj/kNo8737ovqvoV0z7f8Z2oVOFNDm13sWtLme/mfQ/vHj3w&quot; rel=&quot;nofollow noreferrer&quot;&gt;this script&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; Take all users participated across all challenges. For each challenge, the first solver (ordered by the posting time) gets &lt;code&gt;&amp;lt;the number of users&amp;gt;&lt;/code&gt; score, the second gets that score minus 1, down to the last one solved. Same goes for the languages.&lt;/p&gt;&#xA;&lt;h2&gt;Hall of Fame&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt; solved all problems in Pari/GP, and most of them also in Mathematica! That's a great amount of dedication, especially given that many challenges were not so much about mathematics.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/17602/neil&quot;&gt;Neil&lt;/a&gt; solved all problems in Charcoal (as usual), and also some fitting ones in Retina.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/87606/tjjfvi&quot;&gt;tjjfvi&lt;/a&gt; solved most of the problems (23) in TypeScript Types (not regular TypeScript)! It is about abusing a type checker to do arbitrary calculation (not like in Turing tarpit style, but with actual numbers, strings, and arrays), something that has never been done on CGCC as far as I'm aware. Their answers may lose badly in code golf, but the effort to even write &lt;em&gt;some&lt;/em&gt; answer in it makes them noteworthy.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/240010/78410&quot;&gt;Anders Kaseorg's answer&lt;/a&gt; for Day 22 is interesting in its own right, as it simplifies a seemingly impossible problem into a relatively concise set of string transformations.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If you find other answers (or a set of answers) worth noting, please let me know.&lt;/p&gt;&#xA;&lt;h2&gt;And...&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Stay tuned for Advent of Code Golf 2022!&lt;/strong&gt;&lt;sup&gt;2&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;2&lt;/sup&gt; No warranty, but if it goes, we hope it goes well!&lt;/p&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="9288" LastEditDate="2022-01-25T06:54:21.137" LastActivityDate="2022-01-25T06:54:21.137" Title="Advent of Code Golf 2021 is over! (Stats, Hall of Fame)" Tags="|discussion|code-golf|statistics|advent-events|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24209" PostTypeId="1" CreationDate="2021-12-27T18:40:15.637" Score="-4" ViewCount="65" Body="&lt;p&gt;I found a lot of question that belongs on SO, But i didn't found a option to migrate SO but CGCC Meta.&lt;/p&gt;&#xA;&lt;p&gt;I want a option to migrate SO.&lt;/p&gt;&#xA;" OwnerUserId="106959" LastEditorUserId="68942" LastEditDate="2021-12-29T03:46:06.683" LastActivityDate="2021-12-29T03:46:06.683" Title="Add a option to migrate SO" Tags="|feature-request|status-declined|close-reasons|migration|" AnswerCount="1" CommentCount="0" ClosedDate="2021-12-27T19:15:19.040" ContentLicense="CC BY-SA 4.0" />
  <row Id="24210" PostTypeId="2" ParentId="24209" CreationDate="2021-12-27T18:49:30.720" Score="6" Body="&lt;p&gt;&lt;b&gt;I do not support having a migration path for this.&lt;/b&gt;&lt;/p&gt;&#xA;&lt;p&gt;Very rarely are questions here actually suitable for migration.&lt;/p&gt;&#xA;&lt;p&gt;Just close them with the existing off-topic option. If you believe they should be migrated, you can flag them for moderator attention or ping a moderator in chat referencing the bot post, but before you do so, think carefully, because it's probably not actually good for migration.&lt;/p&gt;&#xA;&lt;p&gt;In my past over a year as a moderator, a grand total of zero posts have been successfully migrated onto Stack Overflow. I do not want to allow normal users to migrate to SO because there are a lot of things that look migrateable but actually are not, and it is better to just tell the user to repost there and read through the help center.&lt;/p&gt;&#xA;&lt;p&gt;Migration does have its uses, just not often applicable here.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2021-12-29T03:27:24.893" LastActivityDate="2021-12-29T03:27:24.893" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24211" PostTypeId="5" CreationDate="2021-12-27T20:33:16.360" Score="0" Body="&lt;p&gt;Similar to &lt;a href=&quot;https://adventofcode.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Advent of Code&lt;/a&gt;, there have been various ideas to run seasonal events, typically involving writing challenges, that run from the 1st of December until the 25th (or a similar time period). This tag is for questions that aim to discuss, propose or are themed around such events.&lt;/p&gt;&#xA;&lt;p&gt;The first full such event was the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/24068/66833&quot;&gt;Advent of Code Golf 2021&lt;/a&gt;, run by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt; with help from various other users.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-12-27T20:33:16.360" LastActivityDate="2021-12-27T20:33:16.360" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24212" PostTypeId="4" CreationDate="2021-12-27T20:33:16.360" Score="0" Body="For discussion around &quot;Advent&quot; events - seasonal events that take place typically from the 1st to the 25th of December" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2021-12-27T20:33:16.360" LastActivityDate="2021-12-27T20:33:16.360" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24213" PostTypeId="2" ParentId="2140" CreationDate="2021-12-28T01:09:34.440" Score="-1" Body="&lt;h1&gt;[1], [2], [1, 1], [3, 2] Sequence&lt;/h1&gt;&#xA;&lt;h2&gt;Challenge:&lt;/h2&gt;&#xA;&lt;p&gt;The sequence starts with [1]&lt;/p&gt;&#xA;&lt;p&gt;And multiply by the reversed indices plus one.&lt;/p&gt;&#xA;&lt;p&gt;And make an extra list containing 0 length of the list times.&lt;/p&gt;&#xA;&lt;p&gt;If the number is greater than reversed indice plus two, then modulo by indice plus two, add number integer divided by indice plus two to extra list (Previous indice).&lt;/p&gt;&#xA;&lt;p&gt;Then the next list will be the list plus an extra list.&lt;/p&gt;&#xA;&lt;h2&gt;Example (step-by-step)&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;RETURN [1]&#xA;[1]&#xA;[2] [0]&#xA;[2] [0]&#xA;RETURN [2]&#xA;[2]&#xA;[4] [0]&#xA;[1] [1, 0]&#xA;RETURN  [1, 1]&#xA;[1, 1]&#xA;[3, 2] [0, 0]&#xA;[3, 2] [0, 0]&#xA;RETURN [3, 2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;p&gt;TODO&lt;/p&gt;&#xA;&lt;h1&gt;Meta:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Suggestions?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Which test cases I should add?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="106959" LastActivityDate="2021-12-28T01:09:34.440" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24214" PostTypeId="2" ParentId="2140" CreationDate="2021-12-29T14:58:21.727" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/240398/pluralize-some-nouns&quot;&gt;Pluralize a Noun List&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Currently Closed&lt;/p&gt;&#xA;" OwnerUserId="108673" LastEditorUserId="108673" LastEditDate="2022-01-13T13:00:07.740" LastActivityDate="2022-01-13T13:00:07.740" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="24215" PostTypeId="2" ParentId="18621" CreationDate="2021-12-29T17:22:55.333" Score="-3" Body="&lt;h1&gt;Questions with unnecessarily cumbersome I/O can be answered as if they followed default* I/O rules&lt;/h1&gt;&#xA;&lt;p&gt;*Or at least, more reasonable I/O rules&lt;/p&gt;&#xA;&lt;p&gt;As long as you specify how you are handling I/O and it is within reason for a normal challenge, just ignore cumbersome I/O constraints and link this meta (assuming this meta is upvoted into consensus).&lt;/p&gt;&#xA;" OwnerUserId="107310" LastActivityDate="2021-12-29T17:22:55.333" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24216" PostTypeId="2" ParentId="2140" CreationDate="2021-12-29T21:24:55.397" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/240705&quot;&gt;Who Is Kevin Bacon?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-01-07T08:05:40.223" LastActivityDate="2022-01-07T08:05:40.223" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24217" PostTypeId="2" ParentId="12877" CreationDate="2021-12-30T22:59:24.393" Score="2" Body="&lt;p&gt;&lt;strong&gt;Yes&lt;/strong&gt; - I think that new language should be allowed to win.&lt;/p&gt;&#xA;&lt;p&gt;The initial intention of language itself is to provide smooth way to express, simplify, shorten, improve how code or communication looks like. If language itself takes a fresh approach on how to better adapt to problem, context, program - that should be encouraged, not rejected.&lt;/p&gt;&#xA;&lt;p&gt;However - creating new language might also solve one problem, but might not solve other problems, which could be more generic. But we have same issue with normal programming language - you will not go with C++ or assembler to develop web page, and vice versa - you wont use html to bootstrap operating system.&lt;/p&gt;&#xA;&lt;p&gt;It would be good that new language designers would exchange ideas with each other, inspire each other - so revolution and/or evolution would eventually happen in full scale.&lt;/p&gt;&#xA;&lt;p&gt;Based on statements above I would vote to accept such answers.&lt;/p&gt;&#xA;&lt;p&gt;See also my own answer in here:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/77929/53072&quot;&gt;https://codegolf.stackexchange.com/a/77929/53072&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;That does not help with web page or solve generic problem, but that in a turn allows to take a look on how same thing could be implemented differently - for example comparing to other small / odd languages.&lt;/p&gt;&#xA;" OwnerUserId="53072" LastActivityDate="2021-12-30T22:59:24.393" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24218" PostTypeId="2" ParentId="2140" CreationDate="2021-12-31T03:50:21.553" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/240624&quot;&gt;Number of complete rhyme schemes&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-01-05T17:32:31.983" LastActivityDate="2022-01-05T17:32:31.983" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24220" PostTypeId="2" ParentId="2140" CreationDate="2021-12-31T22:04:05.587" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/241457&quot;&gt;Is this word in standard order?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-01-20T18:19:22.470" LastActivityDate="2022-01-20T18:19:22.470" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24221" PostTypeId="2" ParentId="2140" CreationDate="2021-12-31T23:18:04.387" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241110/solve-nonimplication-sat&quot;&gt;Solve nonimplication-SAT&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-01-15T08:59:15.693" LastActivityDate="2022-01-15T08:59:15.693" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24222" PostTypeId="1" AcceptedAnswerId="24223" CreationDate="2022-01-01T02:22:20.163" Score="6" ViewCount="531" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19271/16766&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout January 2022, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://github.com/cairdcoinheringaahing/AddPlusPlus&quot; rel=&quot;nofollow noreferrer&quot;&gt;Add++&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;What's a Language of the Month?&lt;/p&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/16766&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during January, those who wish to participate should learn (at least the basics of) Add++, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about Add++&lt;/h2&gt;&#xA;&lt;p&gt;Add++ is a language that combines both short commands and other golfing features with general usability and practical language features. For example, I've written a &lt;a href=&quot;https://github.com/cairdcoinheringaahing/Adjust&quot; rel=&quot;nofollow noreferrer&quot;&gt;programming language&lt;/a&gt; in Add++, and most solutions in Add++ are easy to understand for users of both practical and golfing languages. For example, it's ease at switching between functional and vanilla mode allows it to create competitive hybrid programs.&lt;/p&gt;&#xA;&lt;h2&gt;Why Add++?&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There aren't many languages like it. In my experience on the site, I don't recall seeing any languages with a similar model to Add++&lt;/li&gt;&#xA;&lt;li&gt;It is widely usable. I would describe Add++ as a practical language with one- or two-byte commands, so it's easily accessible to all golfers&lt;/li&gt;&#xA;&lt;li&gt;It's somewhat used across the site. Primarily by me, but there are multiple answers by other users, and we already have a &lt;a href=&quot;https://chat.stackexchange.com/rooms/113154/add&quot;&gt;chatroom&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Due to its wide range of builtins, it is very powerful, and so can complete most challenges competitively with other golfing languages.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Closer to Pyth and CJam rather than Jelly and 05AB1E however&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;It has &lt;a href=&quot;https://github.com/cairdcoinheringaahing/AddPlusPlus/blob/master/versions.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;version tracking&lt;/a&gt;, and each version can be run via command-line flags&lt;/li&gt;&#xA;&lt;li&gt;Its &lt;a href=&quot;https://github.com/cairdcoinheringaahing/AddPlusPlus/wiki&quot; rel=&quot;nofollow noreferrer&quot;&gt;docs&lt;/a&gt; are fairly comprehensive, thanks to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Caveats&lt;/h2&gt;&#xA;&lt;p&gt;The docs do not contain a comprehensive list of commands, and it is somewhat strict in its syntax, which can lead to a lot of errors. Furthermore, Add++ still has some bugs in the code, along with some confusing behaviours.&lt;/p&gt;&#xA;&lt;p&gt;I'm currently writing the latest version (v6) in order to someone mitigate the biggest problems I have with Add++, but this is, at time of writing, unreleased.&lt;/p&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/cairdcoinheringaahing/AddPlusPlus&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github repo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/240402/66833&quot;&gt;Tips page&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/cairdcoinheringaahing/AddPlusPlus/wiki&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wiki&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#addpp&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/113154/add&quot;&gt;Chatroom&lt;/a&gt;. Feel free to ping me (&lt;code&gt;@cairdcoinheringaahing&lt;/code&gt;) if you have any questions, I'll respond when I can.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Bounties&lt;/h2&gt;&#xA;&lt;p&gt;I'll be offering a +50 rep bounty to any user's &lt;em&gt;second&lt;/em&gt; Add++ answer. The first answer can be posted during or before this month, but the second must be posted during January 2022. In addition, I'm offering +300 to any user's tenth Add++ answer posted during Add++'s LOTM.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, as the &amp;quot;relevant challenges&amp;quot; portion of LOTM doesn't really get much attention, I'm offering a +500 bounty to any user who posts an Add++ themed challenge that goes on to score 10 or more&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2022-01-02T00:37:11.650" LastActivityDate="2022-01-11T16:58:06.533" Title="Language of the Month for January 2022: Add++" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24223" PostTypeId="2" ParentId="24222" CreationDate="2022-01-01T02:22:20.163" Score="6" Body="&lt;h1&gt;List of all Add++ answers posted in January 2022&lt;/h1&gt;&#xA;&lt;p&gt;(first-time posters in &lt;strong&gt;bold&lt;/strong&gt;)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/201176/numbers-by-position/240406#240406&quot;&gt;Numbers by Position&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/17005/produce-the-number-2014-without-any-numbers-in-your-source-code/240407#240407&quot;&gt;Produce the number 2014 without any numbers in your source code&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/240421/incrementally-increment-identical-integers/240454#240454&quot;&gt;Incrementally Increment Identical Integers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/42536/create-an-array-with-repeated-numbers/240457#240457&quot;&gt;Create an array with repeated numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/135417/reverse-array-sum/240459#240459&quot;&gt;Reverse Array Sum&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/205033/reverse-factorial-function/240460#240460&quot;&gt;Reverse factorial function&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/57617/is-this-number-a-prime/240461#240461&quot;&gt;Is this number a prime?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/240512/collect-the-elements-of-an-array/240513#240513&quot;&gt;Collect the elements of an array&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/113448/is-this-even-or-odd/240543#240543&quot;&gt;Is this even or odd?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/106959/fmbalbuena&quot;&gt;Fmbalbuena&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/240597/encode-integers-with-some-others/240609#240609&quot;&gt;Encode integers with some others&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/167199/recover-the-power-from-the-prime-power/240610#240610&quot;&gt;Recover the power from the prime power&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/240880/106959&quot;&gt;One OEIS after another&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/106959/fmbalbuena&quot;&gt;Fmbalbuena&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant tips posted in January 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/240403/66833&quot;&gt;Use &lt;code&gt;D&lt;/code&gt; loops if code needs to be executed at least once in a &lt;code&gt;W&lt;/code&gt; loop&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/106959/fmbalbuena&quot;&gt;Fmbalbuena&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/240404/66833&quot;&gt;Use &lt;code&gt;L&lt;/code&gt; for the main function, &lt;code&gt;D&lt;/code&gt; for helper functions&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/caird-coinheringaahing&quot;&gt;caird coinheringaahing&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/240418/66833&quot;&gt;Call your helper functions &lt;code&gt;I&lt;/code&gt;, &lt;code&gt;K&lt;/code&gt;, &lt;code&gt;Y&lt;/code&gt;, &lt;code&gt;Z&lt;/code&gt;, &lt;code&gt;g&lt;/code&gt;, &lt;code&gt;k&lt;/code&gt;, &lt;code&gt;l&lt;/code&gt;, &lt;code&gt;u&lt;/code&gt; or &lt;code&gt;w&lt;/code&gt;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/caird-coinheringaahing&quot;&gt;caird coinheringaahing&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;tip summary&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant challenges posted in January 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/240512/66833&quot;&gt;Collect the elements of an array&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/u/66833&quot;&gt;caird coinheringaahing&lt;/a&gt;, based around Add++'s &lt;code&gt;BC&lt;/code&gt; builtin&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="106959" LastEditDate="2022-01-11T16:58:06.533" LastActivityDate="2022-01-11T16:58:06.533" CommentCount="0" CommunityOwnedDate="2022-01-03T19:12:33.470" ContentLicense="CC BY-SA 4.0" />
  <row Id="24224" PostTypeId="2" ParentId="2140" CreationDate="2022-01-01T17:12:23.227" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/240421/110034&quot;&gt;Incrementally Increment Identical Integers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerDisplayName="user110034" LastEditorDisplayName="user110034" LastEditDate="2022-01-02T00:50:57.347" LastActivityDate="2022-01-02T00:50:57.347" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24225" PostTypeId="1" CreationDate="2022-01-01T20:53:09.520" Score="14" ViewCount="721" Body="&lt;p&gt;Well, 2021's come to an end, and so that means: Best of 2021!&lt;/p&gt;&#xA;&lt;p&gt;In this thread, we'll consolidate the categories for our Best Posts of 2021, and eventually we'll vote on which posts will win for each category. In this thread, we are looking for two things:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Categories to classify exceptional posts from 2021 (e.g. Best Mathematical Insight or Rookie of the Year)&lt;/li&gt;&#xA;&lt;li&gt;Bounties offered to reward the winners in those categories&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;As answers below, please nominate categories. Each answer should contain a category for a challenge or answer to be rewarded. The top-voted categories will then receive separate nomination posts to find the actual winners. Like previous years, I'm not going to state a fixed number of categories that will make it, but it's probably going to be between 5 and 15. Last year was slightly complicated, but we've usually gone with between 5 and 15 in previous years.&lt;/p&gt;&#xA;&lt;p&gt;Feel free to resubmit categories from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/20588&quot;&gt;last year&lt;/a&gt;, or &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/tagged/best-of&quot;&gt;previous years&lt;/a&gt; regardless of whether they were among the final selected categories or not.&lt;/p&gt;&#xA;&lt;p&gt;Voting on categories should last around 2 weeks, but this is by no means a hard limit, and we'll be happy to extend it further if new category nominations are still incoming.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Offered bounties&lt;/h2&gt;&#xA;&lt;p&gt;Last year, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/20588&quot;&gt;we offered bounties to the winners&lt;/a&gt;. If you want to offer a bounty, please edit your name and the amount in below, or leave a comment and I'll edit it in.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Redwolf Programs (+500)&lt;/li&gt;&#xA;&lt;li&gt;caird coinheringaahing (+1000 minimum, probably more)&lt;/li&gt;&#xA;&lt;li&gt;Razetime (+1500)&lt;/li&gt;&#xA;&lt;li&gt;Luis Mendo (+500)&lt;/li&gt;&#xA;&lt;li&gt;alephalpha (+1000)&lt;/li&gt;&#xA;&lt;li&gt;pxeger (+500)&lt;/li&gt;&#xA;&lt;li&gt;DLosc (+1000)&lt;/li&gt;&#xA;&lt;li&gt;emanresu A (+1000)&lt;/li&gt;&#xA;&lt;li&gt;Wezl (+500)&lt;/li&gt;&#xA;&lt;li&gt;JoKing (+1500)&lt;/li&gt;&#xA;&lt;li&gt;G.B (+1000)&lt;/li&gt;&#xA;&lt;li&gt;hyper-neutrino (+5000 guaranteed, willing to potentially go higher if necessary)&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;...&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="68942" LastEditDate="2022-01-17T03:35:03.670" LastActivityDate="2023-01-02T18:43:24.370" Title="Best Of CGCC 2021 - Call for categories" Tags="|discussion|best-of|" AnswerCount="23" CommentCount="1" ClosedDate="2022-01-20T11:26:06.533" ContentLicense="CC BY-SA 4.0" />
  <row Id="24226" PostTypeId="2" ParentId="24225" CreationDate="2022-01-01T20:57:50.227" Score="18" Body="&lt;h1&gt;Best mathematical insight&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20597/43319&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18442/78410&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17317/78410&quot;&gt;2018&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;On this site we often see answers in languages specifically designed for short code, or designed to be fast. Sometimes, a nice golfing trick or speed-up technique surprises us with its ingenuity, beyond the standard use of that language.&lt;/p&gt;&#xA;&lt;p&gt;And occasionally an answer shows up that uses an unexpected approach to greatly simplify the problem, and makes us wonder how the author could ever think of that. This usually involves some far-from-obvious mathematical equivalence, or a particularly simple approach to the problem that was not evident at all (once revealed, other answers often follow the same approach).&lt;/p&gt;&#xA;&lt;p&gt;This category is for the answer with the best &lt;strong&gt;mathematical&lt;/strong&gt; insight or unexpected approach that led to greatly simplifying the problem, in &lt;strong&gt;any challenge type&lt;/strong&gt; (code golf, fastest code, or others). The insight should have led to a significant improvement according to the challenge's metric (code length, run time, or whatever applicable).&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2022-01-01T20:57:50.227" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24227" PostTypeId="2" ParentId="24225" CreationDate="2022-01-01T20:59:27.970" Score="10" Body="&lt;h1&gt;Most Underappreciated Challenge&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20618/79857&quot;&gt;2020&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;For the best challenge that didn't really get noticed. Sometimes a challenge, especially one that's tough or not vanilla code golf, only gets a few votes, maybe an answer, then disappears.&lt;/p&gt;&#xA;&lt;p&gt;Solving a difficult challenge is rewarding; there's no reason we shouldn't reward the difficult challenges (that don't get noticed)!&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-01-01T20:59:27.970" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24228" PostTypeId="2" ParentId="24225" CreationDate="2022-01-01T21:01:37.823" Score="13" Body="&lt;h1&gt;Rookie of the Year - Challenges&lt;/h1&gt;&#xA;&lt;p&gt;Repost of &lt;a href=&quot;/a/20589/66833&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;/a/18437/66833&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;/a/17318/85052&quot;&gt;2018&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For the best challenge written by someone who has not written a challenge prior to 2021&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2022-01-09T23:10:55.893" LastActivityDate="2022-01-09T23:10:55.893" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24229" PostTypeId="2" ParentId="24225" CreationDate="2022-01-01T21:10:36.573" Score="10" Body="&lt;h1&gt;Most Interesting King of the Hill Submission&lt;/h1&gt;&#xA;&lt;p&gt;For the best answer to a KotH challenge. Specifically, the one with the most interesting or complex strategy.&lt;/p&gt;&#xA;&lt;p&gt;We had &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=%5Bking-of-the-hill%5D+created%3A2021+is%3Aq&quot;&gt;14&lt;/a&gt; KotHs this year, with a total of &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=%5Bking-of-the-hill%5D+created%3A2021+is%3Aa&quot;&gt;179&lt;/a&gt; answers, so it's quite likely there's some really great ones that should be recognized. I think it's especially important to recognize good answers to KotH challenges, because complicated strategies take time to write, and thus don't get as many votes from the challenge hitting the HNQs.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-01-01T21:10:36.573" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24230" PostTypeId="2" ParentId="24225" CreationDate="2022-01-01T21:13:34.540" Score="21" Body="&lt;h1&gt;Slowest Gun in the East&lt;/h1&gt;&#xA;&lt;p&gt;Too often, late answers are overlooked, and end up with fewer upvotes than answers posted immediately after the challenge is posted. This category is aimed to reward impressive answers posted a while after the challenge was originally posted and that went unappreciated, compared to the FGITW answers.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-01-01T21:13:34.540" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24231" PostTypeId="2" ParentId="24225" CreationDate="2022-01-02T00:43:16.800" Score="8" Body="&lt;h1&gt;Wild card&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20615/97857&quot;&gt;Repost of 2020&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For a deserving challenge, answer, or user that isn't a good fit for any of the other categories.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2022-01-02T00:43:16.800" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24232" PostTypeId="2" ParentId="24225" CreationDate="2022-01-02T02:22:54.690" Score="12" Body="&lt;h1&gt;Most involvement in an answer/answers&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18435/95792&quot;&gt;Repost of 2020&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For an answer or multiple answers where multiple people were involved. This could be multiple people helping out a user on a single answer, or a back-and-forth between two or more answers trying to outgolf each other.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2022-01-02T02:32:16.453" LastActivityDate="2022-01-02T02:32:16.453" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24233" PostTypeId="2" ParentId="24225" CreationDate="2022-01-02T03:01:29.717" Score="11" Body="&lt;h1&gt;Best Tip&lt;/h1&gt;&#xA;&lt;p&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20616&quot;&gt;2020&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For the best answer to a question tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;, because this site isn't just about competing with one another, but also about helping each other improve our golfing skills&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2022-01-02T03:01:29.717" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24234" PostTypeId="2" ParentId="24225" CreationDate="2022-01-02T03:02:46.273" Score="8" Body="&lt;h1&gt;Best trickiest challenge&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20620&quot;&gt;Similar to a category from 2020&lt;/a&gt; (but slightly reworded to reward not purely &lt;em&gt;hard&lt;/em&gt;, but also &lt;em&gt;fun&lt;/em&gt;, challenges).&lt;/p&gt;&#xA;&lt;p&gt;It should look simple and tempt you to start coding right away, but coming up with a good solution should be hard.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-01-02T03:08:28.037" LastActivityDate="2022-01-02T03:08:28.037" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24235" PostTypeId="2" ParentId="24225" CreationDate="2022-01-02T03:06:08.477" Score="11" Body="&lt;h1&gt;Rookie of the Year - Answers&lt;/h1&gt;&#xA;&lt;p&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20594/66833&quot;&gt;2020&lt;/a&gt; and other years.&lt;/p&gt;&#xA;&lt;p&gt;For the best answer written by a new user in 2021. This doesn't have to be a user who created their account in 2021 - rather, this is for any answer posted by a user in 2021 where that answer was that user's first answer on the site.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1537115/2021-answers-by-users-with-no-answers-before-2021&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE query&lt;/a&gt; modified from the 2020 one&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2022-01-05T05:03:24.150" LastActivityDate="2022-01-05T05:03:24.150" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24236" PostTypeId="2" ParentId="24225" CreationDate="2022-01-02T03:06:55.323" Score="13" Body="&lt;h1&gt;Best non-&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20598/97857&quot;&gt;Repost from 2020&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Best challenge with a winning criteria other than &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;While &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is our bread and butter, we have some very interesting others with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/proof-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;proof-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;proof-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;, (some) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;s, etc.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2022-01-02T03:06:55.323" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24237" PostTypeId="2" ParentId="24225" CreationDate="2022-01-02T03:12:56.103" Score="10" Body="&lt;h1&gt;Most significant impact via Meta&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;/questions&quot;&gt;Meta&lt;/a&gt; is an important yet often overlooked portion of this site, where significant rules changes are decided, and the site becomes the most democratic. It allows people to present their visions of the site, and for others to show their agreement or disagreement, and contributions can be just as important - if not more - than posts on Main.&lt;/p&gt;&#xA;&lt;p&gt;This category is to reward Meta posts that have had a non-trivial or significant impact on the site in some way, and the users who proposed them.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2022-01-02T23:03:07.350" LastActivityDate="2022-01-02T23:03:07.350" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24238" PostTypeId="2" ParentId="2140" CreationDate="2022-01-02T11:00:42.377" Score="0" Body="&lt;h3&gt;Identify basic building blocks for new natural and programming language&lt;/h3&gt;&#xA;&lt;p&gt;(Based on &lt;a href=&quot;https://codegolf.stackexchange.com/questions/240385/invent-new-programming-language-and-write-hello-world-in-it&quot;&gt;Invent new programming language and write Hello world in it&lt;/a&gt;, but re-phrased to gain more focus on answers).&lt;/p&gt;&#xA;&lt;p&gt;There exists variety of different programming languages, also variety of natural languages.&lt;/p&gt;&#xA;&lt;p&gt;If we could create new programming language, which in a turn would possess structure of natural language - what basic structures you would choose ?&lt;/p&gt;&#xA;&lt;p&gt;one example of artificially constructed language is Toki Pona:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://simple.wikipedia.org/wiki/Toki_Pona&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://simple.wikipedia.org/wiki/Toki_Pona&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://omniglot.com/language/phrases/tokipona.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://omniglot.com/language/phrases/tokipona.htm&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;It can be used as natural language, but not as a programming language.&lt;/p&gt;&#xA;&lt;p&gt;One example of programming language is for loop - for example in C#:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;for(int i = 0; i &amp;lt; 10; i++) { ... }&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;If you want to express this kind of sentence in natural language - then you can use &lt;code&gt;'equals'&lt;/code&gt; for &lt;code&gt;'='&lt;/code&gt;, &lt;code&gt;'less than'&lt;/code&gt; for &lt;code&gt;'&amp;lt;'&lt;/code&gt; - but &lt;code&gt;scope begins&lt;/code&gt; &lt;code&gt;('{')&lt;/code&gt; and &lt;code&gt;scope ends&lt;/code&gt; &lt;code&gt;('}')&lt;/code&gt; is relatively long and difficult to express / pronounce.&lt;/p&gt;&#xA;&lt;p&gt;What basic language structures you would propose for new language ?&lt;/p&gt;&#xA;" OwnerUserId="53072" LastActivityDate="2022-01-02T11:00:42.377" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24239" PostTypeId="2" ParentId="24225" CreationDate="2022-01-03T00:34:08.613" Score="10" Body="&lt;h1&gt;The most unexpected outcome&lt;/h1&gt;&#xA;&lt;p&gt;An answer that you didn’t expected it to work, or do something else, but unexpectedly did some weird behavior and made the answer valid.&lt;/p&gt;&#xA;&lt;p&gt;This could involve some interpreter bug, or obscure feature that wasn’t documented nor known by many people.&lt;/p&gt;&#xA;" OwnerUserId="101762" LastEditorUserId="78850" LastEditDate="2022-01-11T04:05:24.973" LastActivityDate="2022-01-11T04:05:24.973" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24240" PostTypeId="2" ParentId="2140" CreationDate="2022-01-03T01:42:46.797" Score="2" Body="&lt;h1&gt;Domino tilings in an N-dimensional cube &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/dominoes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;dominoes&amp;#39;&quot; rel=&quot;tag&quot;&gt;dominoes&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tiling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tiling&amp;#39;&quot; rel=&quot;tag&quot;&gt;tiling&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Imagine an N-dimensional cube which has dimensions 2×2×...×2. Given the value of N (a positive integer), calculate the number of ways it can be divided into 2×1×1×...×1 &amp;quot;hyper-domino&amp;quot; pieces (two unit N-dimensional hypercubes glued together).&lt;/p&gt;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; rules apply. The shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Examples and test cases&lt;/h2&gt;&#xA;&lt;p&gt;For N = 1, the &amp;quot;cube&amp;quot; is a single domino. A single domino can be divided into a single domino in exactly one way, so the answer is 1.&lt;/p&gt;&#xA;&lt;p&gt;For N = 2, the &amp;quot;cube&amp;quot; is a 2×2 square. It can be divided, or tiled, in two ways:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;--  ||&#xA;--  ||&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For N = 3, the cube is a 2×2×2 cube. It can be divided into four domino-cubes in nine different ways. One way to count it is to see that, if you pick a unit cube, it can be used by three different domino-cubes (one in each direction), and in all cases the rest forms a small staircase-like shape&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;L1  L2&#xA;#   #&#xA;##  ##&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;which can be divided into three pieces in three ways (&lt;code&gt;#&lt;/code&gt; denotes a piece in Z-direction)&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;#   #&#xA;--  --&#xA;&#xA;#   #&#xA;##  ##&#xA;&#xA;|   |&#xA;|#  |#&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;which gives 3×3 = 9.&lt;/p&gt;&#xA;&lt;p&gt;The corresponding sequence is &lt;a href=&quot;https://oeis.org/A005271&quot; rel=&quot;nofollow noreferrer&quot;&gt;A005271&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;N    Answer&#xA;-----------&#xA;1    1&#xA;2    2&#xA;3    9&#xA;4    272&#xA;5    589185&#xA;6    16332454526976&#xA;7    391689748492473664721077609089&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2022-01-03T01:42:46.797" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24242" PostTypeId="1" AcceptedAnswerId="24247" CreationDate="2022-01-03T03:43:46.830" Score="1" ViewCount="76" Body="&lt;p&gt;Can I post KOTH challenge, but non-language specific?&lt;/p&gt;&#xA;" OwnerUserId="106959" LastActivityDate="2022-01-03T19:02:51.150" Title="Should I post non-language specific KOTH?" Tags="|discussion|asking-questions|king-of-the-hill|" AnswerCount="2" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24243" PostTypeId="2" ParentId="24225" CreationDate="2022-01-03T06:22:00.887" Score="12" Body="&lt;h1&gt;Wrong tool for the job&lt;/h1&gt;&#xA;&lt;p&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17321/9288&quot;&gt;2018&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This category is for an answers that use the worst possible language to accomplish a task, while still making an effort to optimize the score. For example, writing a non-trivial program while using an extremely minimalist language like &lt;a href=&quot;https://esolangs.org/wiki/7&quot; rel=&quot;nofollow noreferrer&quot;&gt;7&lt;/a&gt;, or an inconvenient language like &lt;a href=&quot;https://esolangs.org/wiki/Lost&quot; rel=&quot;nofollow noreferrer&quot;&gt;lost&lt;/a&gt;, or even a normal language that's missing some crucial capability like internet connectivity or image processing.&lt;/p&gt;&#xA;&lt;p&gt;Answers for this category should consider both the difficulty of the task and the unsuitable-ness of the language.&lt;/p&gt;&#xA;" OwnerUserId="9288" LastActivityDate="2022-01-03T06:22:00.887" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24244" PostTypeId="2" ParentId="2140" CreationDate="2022-01-03T06:36:18.000" Score="0" Body="&lt;h1&gt;Universal Command Sequence&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241047/universal-command-sequence&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="100635" LastEditorUserId="100635" LastEditDate="2022-01-14T07:21:31.620" LastActivityDate="2022-01-14T07:21:31.620" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24245" PostTypeId="2" ParentId="24242" CreationDate="2022-01-03T06:51:09.823" Score="6" Body="&lt;p&gt;Re. your title. Should you? That's up to you. Non-language-specific KoTH challenges are of course more accessible to more users, but harder to do.&lt;/p&gt;&#xA;&lt;p&gt;Can you? Yes. One way to do it is to interface with the program via standard input/output, instead of calling functions or interfacing with a module. It's potentially slower and you have to deal with using text I/O, but if you can do those, there's nothing stopping you from doing it.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2022-01-03T06:51:09.823" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24246" PostTypeId="2" ParentId="2140" CreationDate="2022-01-03T17:40:34.100" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/240571/identify-a-reverse-checkers-position&quot;&gt;Identify a &amp;quot;reverse checkers&amp;quot; position&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="85914" LastEditorUserId="85914" LastEditDate="2022-01-04T18:39:46.047" LastActivityDate="2022-01-04T18:39:46.047" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24247" PostTypeId="2" ParentId="24242" CreationDate="2022-01-03T19:02:51.150" Score="2" Body="&lt;p&gt;Non-language-specific KotHs were actually pretty common up until a few years ago. Their popularity has decreased because it's easier to just use JS, Python, or Java, and most people will be familiar enough with those languages to write a bot.&lt;/p&gt;&#xA;&lt;p&gt;If you do want to make a language specific KotH, as HN suggested, you can use STDIO to allow your controller to interface with bots. This does mean you'd likely need to install Node.js, Python, a JDK, and any other languages people decide to write bots in, and it will make it more difficult for other people to run the controller to test their bots since they'd have to go through the same steps.&lt;/p&gt;&#xA;&lt;p&gt;The actual implementation of this can be done a couple of ways. The simplest would be running each bot once per turn, and providing its position, storage, and any other relevant information as arguments or STDIN, and then using its STDIO or exit code to determine its move. A second way would be starting up all of the bots at the beginning of the round, and having them continue to run as processes and communicate to them each turn via STDIO.&lt;/p&gt;&#xA;&lt;p&gt;As for the question of if you should, here are a few things to consider:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How important is it to you that people can run their own or others' bots easily?&lt;/li&gt;&#xA;&lt;li&gt;How much time do you have for maintaining the challenges, and ensuring you have all of the right languages (and language versions) installed?&lt;/li&gt;&#xA;&lt;li&gt;How difficult is your KotH (simpler KotHs likely aren't worth the additional complexity)?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;In my case, I've always gone with JS-only (since that lets people run the controller online, making it much easier to write a submission). However, I'll usually add a side note saying something along the lines of:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This challenge is JS-only, but if you don't know JS well enough to compete, feel free to send me your bot in another language and I'll translate it for you.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This definitely isn't required, and it's pretty unusual, but it might be a good compromise if you want the simplicity of a single language, but the accessibility of a non-language-specific KotH.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-01-03T19:02:51.150" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24248" PostTypeId="2" ParentId="24225" CreationDate="2022-01-04T13:58:30.193" Score="12" Body="&lt;h1&gt;Best Explanation&lt;/h1&gt;&#xA;&lt;p&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20601/66833&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18451/66833&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17315/66833&quot;&gt;2018&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14512/66833&quot;&gt;2017&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10940/66833&quot;&gt;2016&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This category is for the answer with the best explanation accompanying it. Ideally, the winner will be an answer with a very detailed explanation that is accessible to anyone, regardless of the amount of relevant knowledge already possessed.&lt;/p&gt;&#xA;" OwnerUserId="9288" LastActivityDate="2022-01-04T13:58:30.193" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24249" PostTypeId="2" ParentId="24225" CreationDate="2022-01-04T15:32:11.660" Score="8" Body="&lt;h1&gt;Most helpful Sandbox commenter&lt;/h1&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;/q/2140/66833&quot;&gt;Sandbox&lt;/a&gt; is a very useful tool to help improve people's challenges, and functions best when users provide helpful advice and feedback on the drafts.&lt;/p&gt;&#xA;&lt;p&gt;This category should reward the users who helped the most in the Sandbox during 2021&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-01-04T15:32:11.660" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24251" PostTypeId="1" AcceptedAnswerId="24296" CreationDate="2022-01-04T21:06:40.900" Score="15" ViewCount="1085" Body="&lt;p&gt;In a &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/conversation/discussion-about-sbcss&quot;&gt;discussion&lt;/a&gt; about SBCSs and other code pages, fractional byte counts were briefly brought up. I brought up our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/10809/how-to-count-bytes-in-7-and-other-languages-that-use-fractional-numbers-of-byte&quot;&gt;consensus&lt;/a&gt; that fractional byte programs are disallowed, and it was pointed out that the consensus does not disallow functions in languages with fractional byte code pages from having a fractional score.&lt;/p&gt;&#xA;&lt;p&gt;Multiple languages with fractional byte counts have been developed recently, with the ones I'm aware of being &lt;a href=&quot;https://github.com/RedwolfPrograms/risky&quot; rel=&quot;nofollow noreferrer&quot;&gt;Risky&lt;/a&gt;, &lt;a href=&quot;https://github.com/dloscutoff/hbl&quot; rel=&quot;nofollow noreferrer&quot;&gt;HBL&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24193/new-codegolf-language-nibbles&quot;&gt;Nibbles&lt;/a&gt;. DLosc and I, who wrote two of those three, were both surprised by the fact that fractional byte functions currently seem to be allowed.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;So...&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;For languages with fractional byte code pages, such as half-byte code pages or huffman coding, should functions be allowed to be submitted without padding to a whole number of bytes?&lt;/p&gt;&#xA;&lt;p&gt;Our current consensus seems to only apply to full programs, as it dicusses storing the program on the user's filesystem. However, since a function is only a part of a program, requiring padding to an integer byte count might not make as much sense. This question's mostly looking for a consensus for functions, but it would also be a good place to dicuss our consensus on full programs if anyone thinks that needs changing.&lt;/p&gt;&#xA;&lt;p&gt;It might also be worth considering languages which don't even have a whole number of bits, such as ones which use trits. Currently we'd require writing an implementation of the language that represents the program with bytes, but if fractional byte counts are allowed, that might bring up the question of whether a 1 trit function could be &lt;span class=&quot;math-container&quot;&gt;\$\log_2(3)\$&lt;/span&gt; bits.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;What should our consensus be for fractional byte programs and functions?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="66833" LastEditDate="2023-04-13T16:02:38.763" LastActivityDate="2023-04-13T19:45:14.050" Title="What is our consensus for fractional byte functions?" Tags="|discussion|scoring|" AnswerCount="4" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24252" PostTypeId="2" ParentId="24251" CreationDate="2022-01-04T21:21:28.473" Score="7" Body="&lt;h1&gt;The answer's score is &lt;em&gt;still&lt;/em&gt; the source code's size&lt;/h1&gt;&#xA;&lt;p&gt;Fractional byte scores are not disallowed, they just have to be from answers that actually have fractional byte scores &amp;quot;on disc&amp;quot;.&lt;/p&gt;&#xA;&lt;h2&gt;Functions&lt;/h2&gt;&#xA;&lt;p&gt;Since functions are pieces of source code and not complete programs their score is the size they contribute to the program when added.&lt;/p&gt;&#xA;&lt;p&gt;This means it's totally possible for a function to only take up 36½ bytes of a program.  If a programming language uses half byte characters then you could write a 36½ byte function and still use that extra ½ byte for other stuff.&lt;/p&gt;&#xA;&lt;p&gt;It doesn't matter that the function can't be put in its own file without padding, because you don't do that with functions.  That's not how you use functions.  I could putt a million copies of my function in the file and only ever have to pad by half a byte.  I think that makes it pretty clear that the half byte of padding is not a part of the function.&lt;/p&gt;&#xA;&lt;h2&gt;Complete Programs&lt;/h2&gt;&#xA;&lt;p&gt;As for complete programs.  If the file is &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; bytes on disc then that is your score.  If you want to make a virtual file system that allows you to make files of non-integer byte sizes, &lt;em&gt;and&lt;/em&gt; these files can be packed together without padding, so they truly take up a non-integer number of bytes, then you can do that.  The size of the file is simply the amount of space it increases the size of the file system by. I think pretty clearly then your file is not taking up an integer number of bytes, so it's score is not an integer number of bytes.&lt;/p&gt;&#xA;&lt;h2&gt;Summary&lt;/h2&gt;&#xA;&lt;p&gt;The way to determine the size of a program is to look and see how many bytes it takes to actually store it in an existing computer system.&lt;/p&gt;&#xA;&lt;p&gt;For me this is simply a clarification of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10810/56656&quot;&gt;Dennis' original answer&lt;/a&gt;.  And I think this way of doing things is fair, straightforward and consistent with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7833/56656&quot;&gt;established consensus&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-01-04T21:59:10.657" LastActivityDate="2022-01-04T21:59:10.657" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24253" PostTypeId="2" ParentId="24251" CreationDate="2022-01-04T21:44:11.773" Score="2" Body="&lt;h1&gt;Full programs, full bytes&lt;/h1&gt;&#xA;&lt;p&gt;This suggestion would likely work alongside others' answers, but if part of the consensus it would clear up some possible future confusion.&lt;/p&gt;&#xA;&lt;p&gt;All full programs must be a full number of 8-bit bytes. There are essentially no modern systems which use anything other than 8-bit bytes, so keeping this as a default is reasonable (since hardware which can/is intended to store fractions of 8-bit-bytes on disk is rare).&lt;/p&gt;&#xA;&lt;p&gt;This prevents any issues that could come up if someone were to, for example, write an entire operating system around their esolang which supported 6-bit bytes. This would prevent them from claiming that they can store a 36 bit program on their machine, and that it should be allowed to be scored as 4.5 bytes.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Advantages:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is consistent with our requirement that you must be able to actually represent your code as a file to input to an interpreter&lt;/li&gt;&#xA;&lt;li&gt;This reduces confusion about what exactly &amp;quot;being able to represent your code as a file&amp;quot; means&lt;/li&gt;&#xA;&lt;li&gt;This keeps the scoring unambiguous for non-bit-based languages; you must represent the trits/algebraically encoded data/whatever else as a sequence of bytes, it can't just be scored as an irrational number of bits&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Disadvantages:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This creates a (possibly somewhat artificial in certain languages) divide between the way full programs and functions are scored, adding confusion&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-01-04T21:44:11.773" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24254" PostTypeId="2" ParentId="2140" CreationDate="2022-01-06T11:33:26.930" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/240985&quot;&gt;Generate Fmbalbuena Numbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="106959" LastEditorUserId="97857" LastEditDate="2022-01-15T17:48:09.907" LastActivityDate="2022-01-15T17:48:09.907" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24255" PostTypeId="2" ParentId="2140" CreationDate="2022-01-06T13:40:27.460" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/240713/high-throughput-prime-numbers&quot;&gt;&lt;h1&gt;High throughput prime numbers&lt;/h1&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="108859" LastEditorUserId="108859" LastEditDate="2022-01-07T11:23:01.070" LastActivityDate="2022-01-07T11:23:01.070" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24258" PostTypeId="2" ParentId="2140" CreationDate="2022-01-07T00:38:34.813" Score="3" Body="&lt;h1&gt;Print □□Square□□ Numbers&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to write a program or function that accepts an integer as input/argument and prints/returns all square numbers from 0 up to but not including n².&lt;/p&gt;&#xA;&lt;p&gt;But the numbers should not just be perfect squares in the mathematical sense. They should be square in &lt;em&gt;every&lt;/em&gt; sense. That is, the digits should&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;• occupy a square space, 5 lines by 5 columns (including separating space)&lt;/li&gt;&#xA;&lt;li&gt;• form right angles at their joints&lt;/li&gt;&#xA;&lt;li&gt;• be formed entirely from □ and space characters&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Actually, the digits must be shaped exactly like these:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;   □ □□□□ □□□□ □  □ □□□□ □□□□ □□□□ □□□□ □□□□ □□□□ &#xA;   □    □    □ □  □ □    □       □ □  □ □  □ □  □ &#xA;   □ □□□□ □□□□ □□□□ □□□□ □□□□    □ □□□□ □□□□ □  □ &#xA;   □ □       □    □    □ □  □    □ □  □    □ □  □ &#xA;   □ □□□□ □□□□    □ □□□□ □□□□    □ □□□□ □□□□ □□□□ &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note the single column of space between each digit. Spaces at the end of each line are optional. (The three empty columns of spaces on the left side of the digit 1 are not optional.)&lt;/p&gt;&#xA;&lt;p&gt;Each square number shall be printed on exactly 5 lines using these digits, and between each of these numbers shall be a single line containing no non-whitespace characters. You may optionally include extra blank lines at the beginning or end of the output.&lt;/p&gt;&#xA;&lt;p&gt;Standard loopholes etc. Shortest solution in bytes is the coolest of beans.&lt;/p&gt;&#xA;&lt;p&gt;Example Output (given the input 5):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;□□□□&#xA;□  □&#xA;□  □&#xA;□  □&#xA;□□□□&#xA;&#xA;   □&#xA;   □&#xA;   □&#xA;   □&#xA;   □&#xA;&#xA;□  □&#xA;□  □&#xA;□□□□&#xA;   □&#xA;   □&#xA;&#xA;□□□□&#xA;□  □&#xA;□□□□&#xA;   □&#xA;□□□□&#xA;&#xA;   □ □□□□&#xA;   □ □&#xA;   □ □□□□&#xA;   □ □  □&#xA;   □ □□□□&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(Note for sandbox: I know this is a good challenge because I had fun solving it myself. But I am worried there is another challenge I haven't seen that is too similar. Please let me know. I'll abandon it if so.)&lt;/p&gt;&#xA;" OwnerUserId="47050" LastActivityDate="2022-01-07T00:38:34.813" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24259" PostTypeId="2" ParentId="2140" CreationDate="2022-01-07T19:11:51.607" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241080/is-it-a-perfect-word&quot;&gt;Is it a perfect word?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2022-01-14T19:34:53.450" LastActivityDate="2022-01-14T19:34:53.450" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24260" PostTypeId="2" ParentId="24225" CreationDate="2022-01-08T02:18:17.997" Score="8" Body="&lt;h1&gt;Most helpful commenter&lt;/h1&gt;&#xA;&lt;p&gt;Repost of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20591/95792&quot;&gt;2020&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17329/95792&quot;&gt;2018&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;One of the things that stands out about this community is that although it's highly competitive, there is nearly always someone on hand to offer advice both on improving challenges and improving answer scores. It's part of what made this site seem so welcoming to me.&lt;/p&gt;&#xA;&lt;p&gt;In recognition of this, nominees should be people who have helped others improve and made them feel welcome, whether by direct comments on challenges and answers, or in comments in chat.&lt;/p&gt;&#xA;" OwnerUserId="9288" LastActivityDate="2022-01-08T02:18:17.997" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24261" PostTypeId="2" ParentId="2140" CreationDate="2022-01-09T23:51:11.660" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241136/is-this-continuous-terrain#241136&quot;&gt;Is this continuous terrain?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-01-16T07:51:24.630" LastActivityDate="2022-01-16T07:51:24.630" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24262" PostTypeId="1" AcceptedAnswerId="24264" CreationDate="2022-01-10T10:05:57.313" Score="1" ViewCount="87" Body="&lt;p&gt;This &lt;a href=&quot;https://codegolf.stackexchange.com/questions/240825/multiplying-numbers&quot;&gt;Question&lt;/a&gt; was closed as a dupe by Community and pxeger, but why Community and how did Community know?&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/posts/240825/revisions&quot;&gt;Revisions&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="106959" LastEditorUserId="66833" LastEditDate="2022-01-10T12:23:31.807" LastActivityDate="2022-01-20T00:50:21.253" Title="Why does Community votes to close as dupe?" Tags="|support|duplicates|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24263" PostTypeId="2" ParentId="2140" CreationDate="2022-01-10T10:06:49.640" Score="-4" Body="&lt;h1&gt;Find the square of a number without using the multiplication sign or division sign&lt;/h1&gt;&#xA;&lt;p&gt;e.g. &amp;quot;/&amp;quot; &amp;quot;//&amp;quot; &amp;quot;*&amp;quot; &amp;quot;**&amp;quot; are not allowed&lt;/p&gt;&#xA;&lt;p&gt;no imports are allowed either&lt;/p&gt;&#xA;&lt;p&gt;An integer will be given in the input&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;p&gt;5 -&amp;gt; 25&lt;/p&gt;&#xA;&lt;p&gt;6 -&amp;gt; 36&lt;/p&gt;&#xA;&lt;p&gt;10 -&amp;gt; 10&lt;/p&gt;&#xA;&lt;p&gt;724 -&amp;gt; 524176&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-01-10T10:08:58.017" LastActivityDate="2022-01-10T10:08:58.017" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24264" PostTypeId="2" ParentId="24262" CreationDate="2022-01-10T12:23:17.890" Score="6" Body="&lt;h2&gt;The challenge author voted to closed it as a dupe&lt;/h2&gt;&#xA;&lt;p&gt;See this MSE post: &lt;a href=&quot;https://meta.stackexchange.com/q/250981/355458&quot;&gt;New UI encourages askers to confirm or dispute duplicate votes&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Essentially, when a user votes to close a question as a duplicate, the author is shown a pop-up that says, roughly:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This question may already have an answer here:&lt;br /&gt;&#xA;[link to potential duplicate]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;and they are asked to decide if that question is indeed a duplicate. If they click yes, they instantly close the question as a duplicate, and the vote is attributed to the &lt;a href=&quot;https://codegolf.stackexchange.com/users/-1/community&quot;&gt;Community user&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Note that if you hover your mouse over the Community user's name, it provides a helpful tooltip:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/vd6Qq.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/vd6Qq.png&quot; alt=&quot;screenshot of the &amp;quot;question closed&amp;quot; box, with a tooltip from hovering over the Community user, saying &amp;quot;This question's author approved a pending duplicate vote&amp;quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="106744" LastEditDate="2022-01-20T00:50:21.253" LastActivityDate="2022-01-20T00:50:21.253" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24265" PostTypeId="2" ParentId="5243" CreationDate="2022-01-10T13:48:59.187" Score="1" Body="&lt;h1&gt;50 repz for first answer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/64198/99-bottles-of-beer&quot;&gt;99 bottles&lt;/a&gt; in &lt;a href=&quot;https://github.com/DennisMitchell/jellylanguage&quot; rel=&quot;nofollow noreferrer&quot;&gt;jelly&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="107310" LastEditorUserId="107310" LastEditDate="2022-01-11T13:45:12.767" LastActivityDate="2022-01-11T13:45:12.767" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24266" PostTypeId="2" ParentId="2140" CreationDate="2022-01-10T15:48:56.530" Score="-2" Body="&lt;h1&gt;The number of alphabets in 3 seconds&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In 3 seconds, output as many alphabets as possible. The output may be separated by consistent character.&lt;/p&gt;&#xA;&lt;p&gt;An alphabet here is this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this clear?&lt;/li&gt;&#xA;&lt;li&gt;I'm not really sure about the tagging.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2022-01-10T16:17:12.047" LastActivityDate="2022-01-10T16:17:12.047" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24267" PostTypeId="2" ParentId="2140" CreationDate="2022-01-10T16:56:35.643" Score="3" Body="&lt;h1&gt;Expand a Rubik's Cube Commutator&lt;/h1&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/rubiks-cube&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;rubiks-cube&amp;#39;&quot; rel=&quot;tag&quot;&gt;rubiks-cube&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Posted: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/240972/expand-a-rubiks-cube-commutator&quot;&gt;Expand a Rubik&amp;#39;s Cube Commutator&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2022-01-13T05:35:06.983" LastActivityDate="2022-01-13T05:35:06.983" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24269" PostTypeId="2" ParentId="2140" CreationDate="2022-01-11T14:59:22.913" Score="0" Body="&lt;h1&gt;Wordle&lt;/h1&gt;&#xA;&lt;p&gt;The game &lt;a href=&quot;https://www.powerlanguage.co.uk/wordle/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wordle&lt;/a&gt; is quickly becoming popular.&lt;/p&gt;&#xA;&lt;p&gt;The way the game works is as follows:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Players are trying to guess a 5 letter word&lt;/li&gt;&#xA;&lt;li&gt;Players have six attempts to guess the word&lt;/li&gt;&#xA;&lt;li&gt;After each attempt, the player is told:&lt;br /&gt;&#xA;a. which letters are in the right place (index)&lt;br /&gt;&#xA;b. which letters are in the word,  but in the wrong place&lt;br /&gt;&#xA;c. which letters are not in the word at all&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The aim of this challenge is to create a Wordle application, as follows:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;On startup, the application reads from a dictionary of 5-letter words and selects one at random&lt;/li&gt;&#xA;&lt;li&gt;The application then prompts for user input&lt;/li&gt;&#xA;&lt;li&gt;On input:&lt;br /&gt;&#xA;a. The application checks the input to ensure it is also a 5-letter word and in the dictionary. If it is not, the application returns any failure message and exits&lt;br /&gt;&#xA;b. If the input matches the chosen word, the application returns any success message and exits&lt;br /&gt;&#xA;c. Otherwise, the application checks the letters of the input against the letters of the word, and returns to the user an indicator for each letter of whether it is correct, misplaced, or incorrect. If a letter is repeated in the input, only the first occurrence is marked as correct/misplaced; the remaining occurrences are marked as incorrect &lt;em&gt;[sandbox qn: what happens if the actual word has repeated letters?]&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;Steps 2 and 3 are repeated until the application aborts in step 3a or 3b; or the user has failed to guess the word a total of 6 times; at which point the application exits&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&lt;p&gt;I am thinking of this as a code-golf challenge, but I wonder if there's another approach where people create the bot that's trying to solve the challenge, as well as the bot that's providing the challenge? Or something else? I'm not familiar with the other types of challenges to suggest something.&lt;/p&gt;&#xA;" OwnerUserId="62289" LastEditorUserId="62289" LastEditDate="2022-01-11T15:13:06.363" LastActivityDate="2022-01-11T15:13:06.363" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24271" PostTypeId="2" ParentId="2140" CreationDate="2022-01-11T22:17:02.073" Score="2" Body="&lt;h1&gt;Number of arrangements of half a Rubik's cube&lt;/h1&gt;&#xA;&lt;p&gt;From a corner-on view of a Rubik's cube calculate the number of arrangements of &lt;em&gt;stickers&lt;/em&gt; that are out of view.&lt;/p&gt;&#xA;&lt;p&gt;Your input will provide the state of a Rubik's cube when viewed like the below image:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/S88oBm.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/S88oBm.jpg&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This input will be an array, in any defined order†, grouping†, and nesting† that you choose, containing the colours‡ of the &lt;span class=&quot;math-container&quot;&gt;\$27\$&lt;/span&gt;‡ &lt;em&gt;stickers&lt;/em&gt; (A.K.A. &lt;em&gt;facelets&lt;/em&gt; or &lt;em&gt;tiles&lt;/em&gt;) on three sides of a 3x3 Rubik's cube that join at one corner, like you can see above.&lt;/p&gt;&#xA;&lt;p&gt;The input may be assumed to be that of a solvable state where only face turns can return the cube to having six sides with a single colour on each (if it isn't then your code may do anything, short of summoning Cthulhu).&lt;/p&gt;&#xA;&lt;p&gt;† The input may be a flat list of colour-labels or you may specify that these labels will already be grouped in any way you wish (it may be a ragged, nested list for example), but the content thereof should only consist of the &lt;em&gt;sticker&lt;/em&gt; colour-labels.&lt;/p&gt;&#xA;&lt;p&gt;‡ Since the centres of the cube are actually fixed relative to each other, and hence the hidden centres' colours are known, you may choose to leave any or all of the central &lt;em&gt;stickers&lt;/em&gt; out of the expected input (it could be as short as &lt;span class=&quot;math-container&quot;&gt;\$24\$&lt;/span&gt; &lt;em&gt;sticker&lt;/em&gt; colour-labels) while using a labeling that identifes the colours as the top-centre, left-centre, right-centre, and their three opposite colours. For the record, the standard colour theme, as in the image above, has orange opposite red, white opposite yellow, and green opposite blue (hence orange is the hidden centre sticker on the bottom etc.).&lt;/p&gt;&#xA;&lt;p&gt;You should output the number of possible arrangements of &lt;em&gt;sticker&lt;/em&gt; colours of the &lt;span class=&quot;math-container&quot;&gt;\$27\$&lt;/span&gt; &lt;em&gt;stickers&lt;/em&gt; which are &lt;strong&gt;not&lt;/strong&gt; in the input (i.e. those &lt;em&gt;stickers&lt;/em&gt; which are out of view). Note that swapping two of those &lt;em&gt;stickers&lt;/em&gt; of the same colour is considered to be the same arrangement.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot;&gt;combinatorics&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/rubiks-cube&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;rubiks-cube&amp;#39;&quot; rel=&quot;tag&quot;&gt;rubiks-cube&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Sandbox questions&lt;/h3&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Does this need test cases? (I'm not even 100% sure what the output should be if the input looked like a solved cube from that perspective although I may be able to work it out without writing a program it's certainly more than one - e.g. &lt;code&gt;U' L R2 D' M D2 M' D' L' R2 U&lt;/code&gt; or &lt;code&gt; R2 U R2 F2 R2 U2 F2 R2 F2 U R2&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is the spec clear?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="53748" LastEditorUserId="53748" LastEditDate="2022-01-15T00:25:07.303" LastActivityDate="2022-01-15T00:25:07.303" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24272" PostTypeId="2" ParentId="24225" CreationDate="2022-01-12T03:04:56.363" Score="3" Body="&lt;h1&gt;Most complex answer&lt;/h1&gt;&#xA;&lt;p&gt;For the answer so complex that few people or even no people can understand, yet it work beautifully while remain golfed.&lt;/p&gt;&#xA;&lt;p&gt;Those answer could be creative and long(but are not generated or repeat same code)&#xA;the logic inside the code can't be understand by us mortals, but it works anyway.&lt;/p&gt;&#xA;" OwnerUserId="101762" LastActivityDate="2022-01-12T03:04:56.363" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24273" PostTypeId="1" CreationDate="2022-01-12T15:15:33.987" Score="10" ViewCount="95" Body="&#xA;&lt;p&gt;As we say goodbye to the old year and welcome the new one, we have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/search?q=%22year+in+moderation%22+is%3Aquestion&quot;&gt;a tradition of sharing moderation stats for the preceding calendar year&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;As most of you here are aware, sites on the Stack Exchange network are moderated somewhat differently to other sites on the web:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;We designed the Stack Exchange network engine to be mostly self-regulating, in that we amortize the overall moderation cost of the system across thousands of teeny-tiny slices of effort contributed by regular, everyday users.&lt;br /&gt;&#xA;-- &lt;a href=&quot;http://blog.stackoverflow.com/2009/05/a-theory-of-moderation/&quot;&gt;A Theory of Moderation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;That doesn't eliminate the need for having &lt;a href=&quot;https://stackoverflow.blog/2018/11/21/our-theory-of-moderation-re-visited/&quot;&gt;moderators&lt;/a&gt; altogether, but it does mean that the bulk of moderation work is carried out by regular folks. Every bit of time and effort y'all contribute to the site gives you access to more privileges you can use to help in this effort, all of which produce a cumulative effect that makes a big difference.&lt;/p&gt;&#xA;&lt;p&gt;So as we say goodbye to 2021, let us look back at what we accomplished as a community... by looking at some &lt;a href=&quot;https://i.stack.imgur.com/KZntT.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;exciting&lt;/em&gt; stats&lt;/a&gt;. Below is a breakdown of moderation actions performed on Code Golf over the past 12 months:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th style=&quot;text-align: left;&quot;&gt;Action&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;Moderators&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;Community¹&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Users suspended²&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;9&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;24&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Users destroyed³&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;523&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Users deleted&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;8&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Users contacted&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;19&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;User suspensions lifted early&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;3&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁴: Suggested Edit queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;147&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;614&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁴: Reopen Vote queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;66&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;232&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁴: Low Quality Posts queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;71&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;317&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁴: Late Answer queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;82&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;339&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁴: First questions queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;8&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;63&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁴: First Post queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;98&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;456&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁴: First answers queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;40&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;237&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁴: Close Votes queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;113&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;477&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tags merged&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;20&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tag synonyms proposed&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;2&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;3&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tag synonyms created&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;7&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions unprotected&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;7&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;71&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions reopened&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;34&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;30&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions protected&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;25&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions migrated&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;4&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;2&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions flagged⁵&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;35&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;559&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions closed&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;228&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;243&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Question flags handled⁵&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;252&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;340&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Posts unlocked&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;7&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Posts undeleted&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;57&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;512&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Posts locked&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;4&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;116&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Posts deleted⁶&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;374&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1,625&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Posts bumped&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;10&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Escalations to the Community Manager team&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;2&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Comments undeleted&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;92&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Comments flagged&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;2&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;383&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Comments deleted⁷&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1,790&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;3,903&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Comment flags handled&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;316&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;69&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Bounties canceled&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;3&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Answers flagged&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;39&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;759&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Answer flags handled&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;577&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;220&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;All comments on a post moved to chat&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;7&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;h3&gt;Footnotes&lt;/h3&gt;&#xA;&lt;p&gt;¹ &amp;quot;Community&amp;quot; here refers both to &lt;a href=&quot;https://codegolf.stackexchange.com/users&quot;&gt;the membership of Code Golf&lt;/a&gt; &lt;em&gt;without&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=moderators&quot;&gt;diamonds next to their names&lt;/a&gt;, and to the automated systems otherwise known as &lt;a href=&quot;https://codegolf.stackexchange.com/users/-1&quot;&gt;user #-1&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;² The system will suspend users under three circumstances: when a user is recreated after being previously suspended, when a user is recreated after being destroyed for spam or abuse, and when a network-wide suspension is in effect on an account.&lt;/p&gt;&#xA;&lt;p&gt;³ A &amp;quot;destroyed&amp;quot; user is deleted along with all that they had posted: questions, answers, comments. &lt;a href=&quot;https://meta.stackexchange.com/questions/88994/what-is-the-difference-between-a-deleted-user-and-a-destroyed-user&quot;&gt;Generally used as an expedient way of getting rid of spam.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;⁴ This counts every review that was submitted (not skipped) - so the 2 suggested edits reviews needed to approve an edit would count as 2, the goal being to indicate the frequency of moderation actions. This also applies to flags, etc.&lt;/p&gt;&#xA;&lt;p&gt;⁵ Includes close flags (but &lt;em&gt;not&lt;/em&gt; close or reopen votes).&lt;/p&gt;&#xA;&lt;p&gt;⁶ This ignores numerous deletions that happen automatically in response to some other action.&lt;/p&gt;&#xA;&lt;p&gt;⁷ This includes comments deleted by their own authors (which also account for some number of handled comment flags).&lt;/p&gt;&#xA;&lt;h3&gt;Further reading:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Wanna see how these numbers have changed over time? We posted a similar report here last year: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/20668/2020-a-year-in-moderation&quot;&gt;2020: a year in moderation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can also check out &lt;a href=&quot;https://stackexchange.com/search?q=title%3A%222021%3A+a+year+in+moderation%22&quot;&gt;this report on other sites&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Or peruse &lt;a href=&quot;https://meta.stackexchange.com/q/374784/208518&quot;&gt;detailed information on the number of questions closed and reopened across all sites&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Wishing everyone a happy 2022! ^_^&lt;/p&gt;&#xA;" OwnerUserId="38734" LastActivityDate="2022-01-12T15:15:33.987" Title="2021: a year in moderation" Tags="|discussion|moderation|statistics|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24274" PostTypeId="2" ParentId="2140" CreationDate="2022-01-12T15:39:26.427" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241992/reversed-multiple-pair&quot;&gt;Reversed Multiple Pair&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="100664" LastEditDate="2022-01-30T19:19:45.127" LastActivityDate="2022-01-30T19:19:45.127" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24275" PostTypeId="2" ParentId="2140" CreationDate="2022-01-12T18:41:14.320" Score="1" Body="&lt;h1&gt;Minimal Randomness&lt;/h1&gt;&#xA;&lt;p&gt;In this challenge, you take input and shuffle the letters in a random, non-deterministic way which minimizes the probability that the output is different from the input.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program must take input and use only substitution and transposition to randomly modify the input.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There must be a slight, non-zero probability that the output differs from the input.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program is graded based on the probability of its output differing from the input, with a lower probability being better.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If two programs are tied in score, the tie is settled by the code size, with a shorter code being better.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your program must be non-deterministic.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;p&gt;I'll post this to main soon unless there are any issues with it.&lt;/p&gt;&#xA;" OwnerUserId="108434" LastEditorUserId="108434" LastEditDate="2022-01-13T18:54:50.997" LastActivityDate="2022-01-13T18:54:50.997" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24278" PostTypeId="2" ParentId="2140" CreationDate="2022-01-14T16:43:29.840" Score="1" Body="&lt;h1&gt;Short programs for fixed outputs&lt;/h1&gt;&#xA;&lt;p&gt;&lt;sup&gt;Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/users/3852/lynn&quot;&gt;Lynn&lt;/a&gt;'s &lt;a href=&quot;http://foldr.moe/jelly-puzzles/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly puzzles&lt;/a&gt;. Check them out if you're interested in practicing your Jelly skills&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Cops&lt;/h2&gt;&#xA;&lt;p&gt;The cops should choose three things:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A freely available programming language,&lt;/li&gt;&#xA;&lt;li&gt;a byte count &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;, and&lt;/li&gt;&#xA;&lt;li&gt;a number of programs to write, &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; (minimum 5)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;They should then write &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; programs, each of which:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;is exactly &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; bytes long, and&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;outputs a fixed, non-empty, non-whitespace output. That is, the output should contain at least one non-whitespace character. &amp;quot;Fixed&amp;quot; can mean that either:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;it outputs the same thing no matter what input is provided, or&lt;/li&gt;&#xA;&lt;li&gt;that it always outputs the same thing and takes no input.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may choose which of these meanings to take, but it must be the same for all &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; programs. Please mention which of these options your programs use.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The cops should then reveal the following bits of information:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The programming language used,&lt;/li&gt;&#xA;&lt;li&gt;the byte count &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;,&lt;/li&gt;&#xA;&lt;li&gt;any command line flags used for specific outputs,&lt;/li&gt;&#xA;&lt;li&gt;the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; outputs for each of the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; programs. If the outputs use any non-printable ASCII characters, please include a hexdump of the output.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The Robbers will be attempting to find &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; byte long programs that output the same outputs, so you should keep your programs secret.&lt;/p&gt;&#xA;&lt;p&gt;For example, if you choose to write 7 programs in Python, each of them 10 bytes, that output&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;code&gt;4&lt;/code&gt;, &lt;code&gt;True&lt;/code&gt;, &lt;code&gt;2 3&lt;/code&gt; , &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;72&lt;/code&gt;, &lt;code&gt;!&lt;/code&gt; and &lt;code&gt;[0]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;then you may have &lt;a href=&quot;https://tio.run/##K6gsycjPM/7/v6AoM69Eo07XVJMLwjSwMYQxjXSMYUxDTWUY00LLEsZUUlSCMaMNYjX//wcA&quot; rel=&quot;nofollow noreferrer&quot;&gt;these 7 programs&lt;/a&gt; (one per line).&lt;/p&gt;&#xA;&lt;p&gt;Robbers will crack one of your &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; outputs if they can find any &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; byte program in your language that has the same output. Note that the program does not have to be the same as the cop's program.&lt;/p&gt;&#xA;&lt;p&gt;Any outputs that go a week without being cracked can be marked safe, and the programs for each output should be revealed. Until the program is revealed for a specific output, it can still be cracked.&lt;/p&gt;&#xA;&lt;p&gt;You may post multiple answers, but each answer should be independent from all others. Your score is equal to the total number of safe outputs across all your answers. The user with the highest score wins.&lt;/p&gt;&#xA;&lt;h2&gt;Robbers&lt;/h2&gt;&#xA;&lt;p&gt;You should find a Cops answer with at least one uncracked, unsafe output, and attempt to crack any of the outputs. That is, find a program that is exactly &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; bytes long that outputs the same fixed output. Note that your program does not have to be the same as the Cop's original answer, just that the output has to be equal.&lt;/p&gt;&#xA;&lt;p&gt;If you crack an answer, please do the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Leave a comment on the Cop's answer, linking to either your answer or a TIO (or similar) link demonstrating the crack&lt;/li&gt;&#xA;&lt;li&gt;If this is your first crack, post an answer to the Robbers thread with your crack, linking to the relevant Cop answer&lt;/li&gt;&#xA;&lt;li&gt;For further cracks, edit them in to your existing answer, linking to the relevant Cop answer&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;A Robber's score is equal to the total number of cracks they make. The Robber with the highest score wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Thoughts? Feedback?&lt;/li&gt;&#xA;&lt;li&gt;Tags are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-shuffleboard&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-shuffleboard&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-shuffleboard&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;. Any others?&lt;/li&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-01-14T16:43:29.840" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24279" PostTypeId="2" ParentId="2140" CreationDate="2022-01-14T17:57:03.257" Score="2" Body="&lt;h1&gt;Implement an argwhere function &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/functional-programming&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;functional-programming&amp;#39;&quot; rel=&quot;tag&quot;&gt;functional-programming&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; rel=&quot;tag&quot;&gt;array&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241357/implement-an-argwhere-function&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="97916" LastEditorUserId="97916" LastEditDate="2022-01-19T09:57:52.843" LastActivityDate="2022-01-19T09:57:52.843" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24280" PostTypeId="2" ParentId="24225" CreationDate="2022-01-14T18:27:23.240" Score="1" Body="&lt;h1&gt;Off the Charts&lt;/h1&gt;&#xA;&lt;p&gt;For an answer that has been proven to work correctly but can't realistically be run, for example because it would take an enormous amount of time to execute.&lt;/p&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2023-01-02T18:43:24.370" LastActivityDate="2023-01-02T18:43:24.370" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24281" PostTypeId="2" ParentId="24225" CreationDate="2022-01-14T18:31:47.017" Score="5" Body="&lt;h1&gt;Kansas City Shuffle&lt;/h1&gt;&#xA;&lt;p&gt;Reposted from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17324/66833&quot;&gt;2018&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Too often, someone devises a particularly golfy method of solving a challenge, which most people will use that method for their answers. This award goes to those answers that utilize an alternative method as a better solution than the method that the majority of other answers use (prior to the posting of the rewarded answer).&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-01-14T18:31:47.017" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24282" PostTypeId="2" ParentId="24225" CreationDate="2022-01-14T18:32:35.497" Score="1" Body="&lt;h1&gt;Best/Most Underappreciated &amp;quot;Janitor&amp;quot;&lt;/h1&gt;&#xA;&lt;p&gt;There is a lot that goes on &amp;quot;behind the scenes&amp;quot; here, including reviewing, cleaning up tags, and moderating (both main and chat). Some users spend a lot of time on these sorts of chores, and I think that should be rewarded.&lt;/p&gt;&#xA;&lt;p&gt;This category is for the user that's contributed the most in these less visible areas of the site. This can include anything from a new user consistently reviewing sandbox posts, up to a moderator who's done an exceptional job in 2021.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-01-14T18:32:35.497" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24283" PostTypeId="2" ParentId="24225" CreationDate="2022-01-14T18:33:44.123" Score="4" Body="&lt;h2&gt;Breaking The Mold (Most Original Challenge)&lt;/h2&gt;&#xA;&lt;p&gt;Reposted from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17327/66833&quot;&gt;2018&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;It's really easy to come up with normal &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;, or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; challenge, etc. Don't get me wrong, there's nothing wrong with these challenges. They're the meat of the challenges on our site. However, they're not the most imaginative.&lt;/p&gt;&#xA;&lt;p&gt;This category is for a challenge that re-invents the wheel, and explores new ideas that we haven't really used on the site.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Maybe this challenge inspired a new tag, or category of challenges?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Maybe it's a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; with a unique and very well balanced scoring formula?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Or maybe it's even a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge about a novel task. This category is for rewarding users who came up with interesting ideas that keep the site fresh.&lt;/p&gt;&#xA;&lt;p&gt;Some justification for why the challenge is original is necessary with nominations - 99% of challenges posted on the site shouldn't qualify for this.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-01-14T18:33:44.123" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24284" PostTypeId="2" ParentId="2140" CreationDate="2022-01-15T07:04:25.923" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/241222&quot;&gt;Egyptian fraction representations of 1&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-01-18T08:14:18.847" LastActivityDate="2022-01-18T08:14:18.847" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24285" PostTypeId="2" ParentId="18621" CreationDate="2022-01-15T13:34:48.143" Score="6" Body="&lt;h1&gt;This I/O format is fair for many languages – it should be corrected because it isn't fair for &lt;em&gt;all&lt;/em&gt; languages, but is normally being used in good faith and we can easily modify answers in languages where it works&lt;/h1&gt;&#xA;&lt;p&gt;I think it's worth thinking about why people use this I/O format in the first place (on other sites). It isn't necessarily a &amp;quot;natural&amp;quot; I/O format for most languages. However, it has the advantage of being very easy to parse; and most competitive programming sites take submissions only as full programs and run them automatically, so they need to have some concrete I/O format to use.&lt;/p&gt;&#xA;&lt;p&gt;The most notable thing about the &amp;quot;newline-separated length-prefixed array&amp;quot; format is that it &lt;em&gt;isn't&lt;/em&gt; cumbersome, at least by the standard of practical languages. Let's imagine we have a challenge whose input format is &amp;quot;the input is an array, specified via a length as a decimal integer on the first line, followed by the elements, each as a decimal integer, on the subsequent lines&amp;quot;. Here's a sample input in this format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;5&#xA;1&#xA;3&#xA;6&#xA;10&#xA;15&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;representing the array &lt;span class=&quot;math-container&quot;&gt;\$[1,3,6,10,15]\$&lt;/span&gt;. Let's look at what it takes to parse this in various languages.&lt;/p&gt;&#xA;&lt;h2&gt;Practical languages&lt;/h2&gt;&#xA;&lt;p&gt;If I were to write a Perl snippet that reads data in this format, I'd write it like this:&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://www.perl.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Perl 5&lt;/a&gt;, 11 bytes&lt;/h3&gt;&#xA;&lt;pre class=&quot;lang-perl prettyprint-override&quot;&gt;&lt;code&gt;map&amp;lt;&amp;gt;,1..&amp;lt;&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##K0gtyjH971Bh@z83scDGTsdQT8/G7r@1QmlxqoJLYkmilZVLaW5BapG1ggoy18oqtDi1sNDW0JqroCgzr0QBIqwR41Chaf3flMuQy5jLjMvQgMvQFAA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Perl 5 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is trivially easy to write, short compared to the average Perl program, and simple to memorise. It isn't detracting much from competing in Perl. (I'm not 100% sure that this is optimal, but if we used this sort of I/O format, we'd find the optimal way to write it very quickly.)&lt;/p&gt;&#xA;&lt;p&gt;What about lower-level languages, like C?&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://gcc.gnu.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;C89 (gcc)&lt;/a&gt;, 72 bytes&lt;/h3&gt;&#xA;&lt;pre class=&quot;lang-c prettyprint-override&quot;&gt;&lt;code&gt;int l;scanf(&amp;quot;%d&amp;quot;,&amp;amp;l);int*a=malloc(l*4),*b=a;for(;b&amp;lt;a+l;scanf(&amp;quot;%d&amp;quot;,b++));&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##VYzLCsIwFET3@YpLQMlLaNC6uc2XqIublEogTUoVN@K3x9idq4FzZiYc7iHUmJ8wU8ziVeIo4b2BhI9AeRJ8N3KzTxIbVORmSqkEkdRJGuUd4VRWgX4g/TfwWkuJtUkQv7cIDjpsMbRjiM3Csjax1a@ZG6BLvElkn9ozy47szGzHbP8F&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;C (gcc) – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is getting a bit more cumbersome, and a bit harder to write, now (especially because if we aren't taking advantage of the limited range of &lt;code&gt;int&lt;/code&gt;, we need a dynamic allocation to be able to handle arbitrarily large lengths, although C's lack of an array type also causes complications); I made an attempt to golf it (under the restriction that I had to declare all the variables I used correctly, without relying on predeclared variables, implicit &lt;code&gt;int&lt;/code&gt;, or using variables as the wrong type), but there are almost certainly improvements I missed. However, parsing more or less any other format would be worse. In Perl, we could simplify the snippet by changing the input format to Perl's array notation &lt;code&gt;(1, 3, 6, 10, 15)&lt;/code&gt;, so that we could &lt;a href=&quot;https://tio.run/##K0gtyjH971Bh@z@1LDHHxu6/tUJpcaqCS2JJopWVS2luQWqRtYIKMtfKKrQ4tbDQ1tCaq6AoM69EASKsEeNQoWn9X8NQR8FYR8FMR8HQAIhNNQE&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Perl 5 – Try It Online&quot;&gt;parse it with &lt;code&gt;eval&amp;lt;&amp;gt;&lt;/code&gt;&lt;/a&gt;, but C has neither an array notation nor an &lt;code&gt;eval&lt;/code&gt; operator so we can't really go any simpler. (Note in particular that different languages are good at parsing different formats; JavaScript would want &lt;code&gt;[1, 3, 6, 10, 15]&lt;/code&gt;, for example. But the newline-separated format is &amp;quot;fair&amp;quot; in the sense that practical languages generally don't vary in respect to which builtins they have available for parsing it.)&lt;/p&gt;&#xA;&lt;p&gt;It's also worth noting that the length prefix on this format makes it &lt;em&gt;fast&lt;/em&gt; to parse – delimited formats like Perl's and JavaScript's mean that you don't know the length of the array until you've finished parsing, so might have to allocate more memory mid-parse, whereas knowing the length in advance avoids this issue (sufficiently so that in languages like Rust and Java, the built-in list classes allow you to specify in advance how many elements you expect the list to eventually grow to). Offsite programming competitions often have at least some emphasis on speed (and we do &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; even over here), so you wouldn't want the I/O mechanism to artificially slow down the program.&lt;/p&gt;&#xA;&lt;h2&gt;Golfing languages&lt;/h2&gt;&#xA;&lt;p&gt;So if this format is intended to put practical programming languages on a level playing field when it comes to parsing input, what about golfing languages? Many of those, especially more recently, are designed to abuse CGCC's lenient I/O rules.&lt;/p&gt;&#xA;&lt;p&gt;If this format were more common (say it were standard on CGCC and the history of golfing languages were influenced by that environment), we'd probably see golfing languages adding builtins for it (and I'm currently planning to add builtins for handling this sort of I/O format to the next golfing language I write – it'd make the language more useful in places other than CGCC). As it is, though, the most popular languages don't have knowledge of this format in particular. For those that have builtins for reading from standard input, it hardly matters, though:&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://github.com/DennisMitchell/jelly&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt;, 3 bytes&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;ƓƓ€&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##y0rNyan8///Y5GOTHzWt@f/flMuQy5jLjMvQgMvQFAA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Jelly – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://github.com/Adriandmen/05AB1E&quot; rel=&quot;nofollow noreferrer&quot;&gt;05AB1E&lt;/a&gt;, 5 bytes&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;IEIˆ}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##yy9OTMpM/f/f09XzdFvt/0Pr/5tyGXIZc5lxGRpwGZoCAA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;05AB1E – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;(Note: I don't really know 05AB1E; I suspect I've missed a builtin and that this is doable in 4. These snippets are written under the assumption that we aren't allowed to read beyond the end of the part of standard input that represents the array; the 05AB1E would be simpler otherwise.)&lt;/p&gt;&#xA;&lt;p&gt;Notable here is that the Jelly program is actually identical to the Perl program I wrote above; the builtins have shorter names, but it's the same builtins connected together the same way.&lt;/p&gt;&#xA;&lt;p&gt;So our golfing languages might not have been designed to abuse this format, but if they're capable of reading input interactively, it doesn't matter – it's fair for them just the same as it is for the practical languages.&lt;/p&gt;&#xA;&lt;p&gt;We do run into a bit of a dead end with some golfing languages, though; there are languages like GolfScript and Brachylog that are incapable of taking input interactively (GolfScript reads the entirety of standard input before it starts to run the program, whereas Brachylog doesn't really have the concept of a &amp;quot;full program&amp;quot; – just functions – and the concept of a Brachylog full program is primarily defined by the behaviour of TIO's wrapper). So parsing input, for these languages, is something that's out of scope, and the fact that they're excluded is a good reason to not use formats like this.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge esolangs&lt;/h2&gt;&#xA;&lt;p&gt;Now let's look at esolangs which are designed to be hard to program in (or else naturally become hard to program in due to being excessively low level), rather than easy to golf in. The main issues with these are that they a) might not have the concept of an array and b) frequently can't read numbers in decimal, which makes the I/O format very unfair when it comes to these languages – parsing the input might be harder than solving the rest of the problem, and will be very repetitive if it isn't.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://esolangs.org/wiki/7&quot; rel=&quot;nofollow noreferrer&quot;&gt;7&lt;/a&gt;, 61 non-whitespace characters, 23 bytes&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;177166177236623716405 7 131 7 740561726405 7 023 7 40352174640555400&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##LYvBDcBACMP@TMEIBAjsPxnNSf1YsqPsHXYxI2bNZEk66OsoiCvRmH@MLLGjmNh@keyIo@P9veVHg5WNIQz8AA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;7 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;(Whitespace added for readability.) 7 is an example of a low-level esolang which, among this genre, is particularly good at handling this sort of I/O format – it has I/O in decimal as a built-in. What it &lt;em&gt;doesn't&lt;/em&gt; have is arrays, or even integers, so in order to be able to parse this sort of format, those have to be defined from scratch. (In case you're wondering how it does numerical I/O without integers: input is done via repeating the body of a function a number of times equal to the input, and the function can then be executed to effectively create a loop where the number of iterations is given by the input.)&lt;/p&gt;&#xA;&lt;p&gt;Indeed, the program wasn't amazingly hard to implement – I managed to write the whole thing in one session without giving up in frustration, and it ends up shorter than the equivalent C program (despite the need to do all the &amp;quot;plumbing&amp;quot; from scratch, and to define formats for integers and for arrays of integers). The interesting thing here is that this &amp;quot;cumbersome&amp;quot; I/O format is actually a &lt;em&gt;better&lt;/em&gt; fit than CGCC's &amp;quot;flexible&amp;quot; formats – those are trying to provide input using the language's data types, but 7 doesn't have those, and thus it would prefer to use a text format that's particularly easy to parse (like this one is!). In general, it's very unclear to me how I'm meant to take input in languages that don't have the standard data types that people normally use when specifying inputs to challenges.&lt;/p&gt;&#xA;&lt;p&gt;The problem comes when we have languages with the opposite properties – they have arrays and integers built in, but no builtins for parsing numbers in decimal. In this case, the decimal parsing routine may well be extremely long, and need to be copied from answer to answer once the most optimal way to do it is found.&lt;/p&gt;&#xA;&lt;h2&gt;Conclusions&lt;/h2&gt;&#xA;&lt;p&gt;This really isn't a bad I/O format – it leads to a fairer comparison between languages than most I/O formats do (less important on CGCC because it isn't a cross-language competition, but still a nice property), and most languages can implement it in a fairly easy way. If you're using a language like Perl or Jelly, the parser for it can trivially be worked into your program without needing to put any thought into it at all, and might potentially even give golfing opportunities in which you do the input parsing and computation at the same time. If you're using a language like 7, it's &lt;em&gt;still&lt;/em&gt; fairly easy to handle relative to the rest of the language, despite our normal I/O rules not working at all in that context. I'm not surprised that it's standard on most competitive programming sites.&lt;/p&gt;&#xA;&lt;p&gt;However, there are some languages which hugely struggle when an I/O format like this is introduced. Some languages can't read from standard input interactively, and can't handle this format. Some don't have built-ins to read integers in decimal, and those will be faced with a huge amount of boilerplate (which will probably be identical from answer to answer) when trying to deal with this format. As a consequence, we don't have this format as standard and prefer to correct challenges that use it.&lt;/p&gt;&#xA;&lt;p&gt;What to do about answering the challenge before the question is corrected? Well, if you're using a language for which the I/O format works, it'll probably simply be a matter of deleting the parser once you're done (and the parser will be very simple to write). If you're using a language for which the format doesn't work, you probably won't be able to answer the challenge before it's corrected. Either way, that's no reason to avoid answering it (keeping up with edits to the challenge will likely be trivial) and also no reason to avoid correcting the question.&lt;/p&gt;&#xA;" OwnerUserId="76359" LastEditorUserId="76359" LastEditDate="2022-01-22T21:50:06.600" LastActivityDate="2022-01-22T21:50:06.600" CommentCount="1" CommunityOwnedDate="2022-01-15T13:34:48.143" ContentLicense="CC BY-SA 4.0" />
  <row Id="24286" PostTypeId="2" ParentId="2140" CreationDate="2022-01-15T17:44:41.093" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/241723&quot;&gt;Highlight a Wordle guess&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-01-25T07:42:34.777" LastActivityDate="2022-01-25T07:42:34.777" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="24287" PostTypeId="2" ParentId="24225" CreationDate="2022-01-15T21:57:15.133" Score="6" Body="&lt;h1&gt;Most improved answer&lt;/h1&gt;&#xA;&lt;p&gt;This category is to reward the continued work users put into answers long after they have been posted.  After the FGITW effect has dissipated there stops being so much incentive to work on an old answer, but some users put in the effort and really make it shine.  The ideal answer here would be one that demonstrates a significant commitment to improvement regardless of the quality of the initial answer.  This could be improving the score, or the explanation or both.&lt;/p&gt;&#xA;&lt;p&gt;Answers in this category don't have to have been initially posted in 2021 but the improvements have to have been made over the course of the year.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-01-18T02:07:49.147" LastActivityDate="2022-01-18T02:07:49.147" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24288" PostTypeId="2" ParentId="2140" CreationDate="2022-01-15T22:37:53.950" Score="0" Body="&lt;h1&gt;Generate Matching Regexes&lt;/h1&gt;&#xA;&lt;p&gt;Write a program that takes two lists of strings and generates a javascript regex that fully matches all the strings in the first list and matches none of the strings in the second list.&lt;/p&gt;&#xA;&lt;p&gt;To be specific when for all stings in the first list &lt;code&gt;str.match(\[your-output]\)&lt;/code&gt; must produce a match for the full string and for all strings in the second list &lt;code&gt;str.match(\[your-output]\)&lt;/code&gt; must produce no matches.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Your score is the average length of the regexes you produce not the length of your program. Your regexes should be tested against this file: &lt;a href=&quot;https://pastebin.com/9iNZvGJC&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://pastebin.com/9iNZvGJC&lt;/a&gt;. Take the file in blocks of 20 lines and run your program with the first ten lines to match and the second ten to not match. Average the lengths of your program's output for all of the blocks in the file. This is your score.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do not output the &lt;code&gt;\&lt;/code&gt; for the regex&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="96393" LastActivityDate="2022-01-15T22:37:53.950" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24289" PostTypeId="2" ParentId="2140" CreationDate="2022-01-16T06:20:56.750" Score="2" Body="&lt;h1&gt;BCD to binary, with bitwise&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr/&gt;&#xA;&lt;p&gt;In this challenge, you'll convert an 8-digit BCD (Binary Coded Decimal) number to a 32 bit (unsigned) integer in the fewest instructions possible, with only bitwise instructions available.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Task:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;You'll be given a single positive integer as input, from &lt;code&gt;00000000&lt;/code&gt; to &lt;code&gt;999999999&lt;/code&gt;. It will be represented using BCD, as a 4-byte unsigned integer, with each nibble being a decimal digit from &lt;code&gt;0000&lt;/code&gt; (0) to &lt;code&gt;1010&lt;/code&gt; (10). More significant nibbles will correspond to more significant digits of the decimal number.&lt;/p&gt;&#xA;&lt;p&gt;Your output should be that same number, as an ordinary 32-bit integer.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Instructions:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is atomic code golf, so you can only use the following instructions, the number of which is used for scoring:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;and [r], [r|I]      Bitwise AND&#xA;or  [r], [r|I]      Bitwise OR&#xA;xor [r], [r|I]      Bitwise XOR&#xA;&#xA;not [r]             Bitwise NOT&#xA;&#xA;shr [r], [r|I]      Shift right (zero fill)&#xA;shl [r], [r|I]      Shift left&#xA;&#xA;mov [r], [r|I]      Copy&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;All instructions will write their output to the first register listed, and for the second argument &lt;code&gt;[r|I]&lt;/code&gt; indicates either a register or an immediate (any 32-bit constant) can be provided.&lt;/p&gt;&#xA;&lt;p&gt;You have four registers to work with, all of which hold a single 4 byte unsigned integer: &lt;code&gt;ra&lt;/code&gt;, &lt;code&gt;rb&lt;/code&gt;, &lt;code&gt;rc&lt;/code&gt;, and &lt;code&gt;rd&lt;/code&gt;. Any instruction using only registers costs 1 byte, and any with an immediate cost a total of 4 (this isn't technically possible, since the immediates are 4 bytes on their own, but I don't want to make them too costly).&lt;/p&gt;&#xA;&lt;p&gt;Input will be provided in &lt;code&gt;ra&lt;/code&gt;, and the contents of &lt;code&gt;ra&lt;/code&gt; when your program is finished will be used as output. All other registers will be initialized to &lt;code&gt;0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Instructions Mk. 2:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is atomic code golf, so you can only use the following instructions, the number of which is used for scoring:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;and [r], [r|I]      Bitwise AND&#xA;or  [r], [r|I]      Bitwise OR&#xA;xor [r], [r|I]      Bitwise XOR&#xA;&#xA;not [r]             Bitwise NOT&#xA;&#xA;shr [r], [r|I]      Shift right (zero fill)&#xA;shl [r], [r|I]      Shift left&#xA;&#xA;mov [r], [r|I]      Copy&#xA;&#xA;goto [r|I]          Go to an instruction (`0` is the start of the program)&#xA;goif [r] [r|I]      Go to an instruction, if `r` is not all `0`s&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;All instructions (aside from &lt;code&gt;goto&lt;/code&gt; and &lt;code&gt;goif&lt;/code&gt;) will write their output to the first register listed, and for the second argument &lt;code&gt;[r|I]&lt;/code&gt; indicates either a register or an immediate (any 32-bit constant) can be provided.&lt;/p&gt;&#xA;&lt;p&gt;You have 8 registers to work with, all of which hold a single 4 byte unsigned integer: &lt;code&gt;ra&lt;/code&gt;, &lt;code&gt;rb&lt;/code&gt;, &lt;code&gt;rc&lt;/code&gt;, &lt;code&gt;rd&lt;/code&gt;, &lt;code&gt;rk&lt;/code&gt;, &lt;code&gt;rn&lt;/code&gt;, &lt;code&gt;rp&lt;/code&gt;, and &lt;code&gt;rs&lt;/code&gt;. Any instruction using only registers costs 1 score, and any with an immediate cost a total of 2.&lt;/p&gt;&#xA;&lt;p&gt;Input will be provided in &lt;code&gt;ra&lt;/code&gt;, and the contents of &lt;code&gt;ra&lt;/code&gt; when your program is finished will be used as output. All other registers will be initialized to &lt;code&gt;0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Other:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I don't actually know if this is an interesting challenge, or if more registers will be needed, or if there's already a well known solution. I'd try it myself but it's kinda late here so I'm too tired to, and if I don't post this now I'll forget about it lol&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2022-01-18T14:33:27.833" LastActivityDate="2022-01-18T14:33:27.833" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24291" PostTypeId="2" ParentId="2140" CreationDate="2022-01-17T02:13:09.480" Score="-3" Body="&lt;h1&gt;Get Floor of N ^ (3 / 2)&lt;/h1&gt;&#xA;&lt;p&gt;Your task is very simple:&lt;/p&gt;&#xA;&lt;p&gt;Get The Floor of N ^ (3 / 2)&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://oeis.org/search?q=1%2C2%2C5%2C8%2C11%2C14%2C18%2C22&amp;amp;sort=&amp;amp;language=english&amp;amp;go=Search&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is Code Golf so the winner wins&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 =&amp;gt; 0&#xA;1 =&amp;gt; 1&#xA;2 =&amp;gt; 2&#xA;3 =&amp;gt; 5&#xA;4 =&amp;gt; 8&#xA;5 =&amp;gt; 11&#xA;10 =&amp;gt; 31&#xA;13 =&amp;gt; 46&#xA;27 =&amp;gt; 140&#xA;33 =&amp;gt; 189&#xA;49 =&amp;gt; 343&#xA;68 =&amp;gt; 560&#xA;89 =&amp;gt; 839&#xA;98 =&amp;gt; 970&#xA;100 =&amp;gt; 1000&#xA;136 =&amp;gt; 1586&#xA;256 =&amp;gt; 4096&#xA;500 =&amp;gt; 11180&#xA;147385 =&amp;gt; 56582212&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="106959" LastActivityDate="2022-01-17T02:13:09.480" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24292" PostTypeId="2" ParentId="2140" CreationDate="2022-01-17T09:00:03.597" Score="3" Body="&lt;h1&gt;Will the tower balance?&lt;/h1&gt;&#xA;&lt;p&gt;You are given as input a tower made of bars of unit height, and your task is to decide if the tower is stable. Here is an ascii art drawing of a tower:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; #&#xA;####&#xA;# ####&#xA;#####&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For extra clarity here is the same tower but with the different bars in different characters:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; A&#xA;BBBB&#xA;C DDDD&#xA;EEEEE&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The bars are rigid, but they are not connected to each other. Even though the bars are not connected, they stay still under the influence of gravity. Here however is a tower that is not stable:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;      B&#xA;CCCCCCCC&#xA;   D&#xA;  EEE&#xA;FFFFFFFF&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In this tower, under the influence of gravity, the top bar will fall to the right.&lt;/p&gt;&#xA;&lt;p&gt;The following tower is metastable:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;AA&#xA;B&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The center of mass of the A-bar lies on top of the edge of the B-bar. In this kind of situation the tower is considered unstable, since even a small perturbation will cause it to fall eventually.&lt;/p&gt;&#xA;&lt;h1&gt;Input/output format&lt;/h1&gt;&#xA;&lt;p&gt;The input format is an ascii drawing of the tower like so:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; ###&#xA;  #&#xA;### #&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In this picture there are 4 bars. It is guranteed that all bars are on top of another bar or on top of the ground and that every row has at least one bar. You can use a different printable ascii character instead of &lt;code&gt;#&lt;/code&gt;. You can also take a 2d array instead of a string and use two distinct values for &lt;code&gt;#&lt;/code&gt; and &lt;code&gt; &lt;/code&gt;. In that case please use simple values, that don't encode extra information (standard loopholes prohibited).&lt;/p&gt;&#xA;&lt;p&gt;Output two distinct values for STABLE and UNSTABLE.&lt;/p&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;#&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;STABLE&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;###&#xA; #&#xA; ##&#xA;  #&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;UNSTABLE&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  ###&#xA; ###&#xA;###&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;UNSTABLE (metastable)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#&#xA;#     ######&#xA;####    ##&#xA; #      ##&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;STABLE&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;###&#xA; #&#xA;#####&#xA; #&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;STABLE&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; #&#xA;#####&#xA; #&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;UNSTABLE&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;######  #&#xA; #  #   #&#xA;### #####&#xA; #   #&#xA; #####&#xA;   #&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;STABLE&lt;/p&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-01-17T09:21:33.787" LastActivityDate="2022-01-17T09:21:33.787" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24293" PostTypeId="2" ParentId="2140" CreationDate="2022-01-17T10:14:18.597" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241259/compress-and-decompress?noredirect=1#comment544064_241259&quot;&gt;Compress and decompress&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-01-18T14:45:45.960" LastActivityDate="2022-01-18T14:45:45.960" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24294" PostTypeId="2" ParentId="2140" CreationDate="2022-01-17T11:25:38.623" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241219&quot;&gt;Mat Printing Matrix&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="97857" LastEditDate="2022-01-18T21:11:41.990" LastActivityDate="2022-01-18T21:11:41.990" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24295" PostTypeId="2" ParentId="2140" CreationDate="2022-01-17T12:33:18.433" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/241267&quot;&gt;Remove odd indices and double the even indices&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="106959" LastEditorUserId="97857" LastEditDate="2022-01-18T21:10:46.667" LastActivityDate="2022-01-18T21:10:46.667" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24296" PostTypeId="2" ParentId="24251" CreationDate="2022-01-17T21:46:56.593" Score="13" Body="&lt;h1&gt;Fractional byte counts are always allowed&lt;/h1&gt;&#xA;&lt;p&gt;It seems like one very simple solution to this problem is to allow fractional byte counts, for functions and full programs.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24252/91213&quot;&gt;Wheat Wizard's answer&lt;/a&gt; implies that some sort of custom designed file system would need to be written, after which point this would be the case anyway. This weird sort of file-system-simulator-that-dies-for-our-sins just adds unnecessary complexity.&lt;/p&gt;&#xA;&lt;p&gt;Scoring functions with fractional byte counts makes sense, I think that's something that almost all of us currently agree on. So, allowing this for full programs seems like a reasonable extension to the rule.&lt;/p&gt;&#xA;&lt;p&gt;Although this slightly contradicts the rule of &amp;quot;you must be able to represent your program as a file which you provide to a compiler/interpreter&amp;quot;, it does so in a way that preserves simplicity and allows a broader number of languages to compete, which I think is a good compromise.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2023-04-13T19:45:14.050" LastActivityDate="2023-04-13T19:45:14.050" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24297" PostTypeId="2" ParentId="2140" CreationDate="2022-01-17T23:44:36.407" Score="1" Body="&lt;h1&gt;From code to golf (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241485/from-code-to-golf-cops-thread&quot;&gt;Cops&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/241486/from-code-to-golf-robbers-thread&quot;&gt;Robbers&lt;/a&gt;)&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-01-20T22:14:12.150" LastActivityDate="2022-01-20T22:14:12.150" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24299" PostTypeId="2" ParentId="2140" CreationDate="2022-01-18T17:20:01.237" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/241532/66833&quot;&gt;Crack the Caesar cipher&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="66833" LastEditDate="2022-01-21T21:59:48.690" LastActivityDate="2022-01-21T21:59:48.690" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24300" PostTypeId="2" ParentId="2140" CreationDate="2022-01-18T17:45:05.343" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241338/recursive-palindromes&quot;&gt;Recursive palindromes&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-01-19T06:00:43.893" LastActivityDate="2022-01-19T06:00:43.893" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24301" PostTypeId="2" ParentId="2140" CreationDate="2022-01-18T18:19:04.780" Score="2" Body="&lt;h1&gt;Prime Number Fibonacci&lt;/h1&gt;&#xA;&lt;p&gt;In this challenge, you will make a program that calculates the Fibonacci sequence with a twist. Instead of it starting with 0 and 1, it starts with the nth prime number determined by input by the user. The second number is the nth+1 prime number. The sequence should also stop after nth number iterations.&lt;/p&gt;&#xA;&lt;h3&gt;Walkthrough:&lt;/h3&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Get a number from the input. We will call it &lt;code&gt;n&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Calculate the &lt;code&gt;n&lt;/code&gt; prime number and &lt;code&gt;n+1&lt;/code&gt; prime number&lt;/li&gt;&#xA;&lt;li&gt;Make a function that adds these numbers and calls itself with the result.&lt;/li&gt;&#xA;&lt;li&gt;Make the function stop once prime number with index &lt;code&gt;n&lt;/code&gt; numbers are output&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Examples:&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;input:2&#xA;output:&#xA;8&#xA;13&#xA;21&#xA;34&#xA;55&#xA;&#xA;input:10&#xA;output:&#xA;60&#xA;91&#xA;151&#xA;242&#xA;393&#xA;635&#xA;1028&#xA;1663&#xA;2691&#xA;4354&#xA;7045&#xA;11399&#xA;18444&#xA;29843&#xA;48287&#xA;78130&#xA;126417&#xA;204547&#xA;330964&#xA;535511&#xA;866475&#xA;1401986&#xA;2268461&#xA;3670447&#xA;5938908&#xA;9609355&#xA;15548263&#xA;25157618&#xA;40705881&#xA;65863499&#xA;106569380&#xA;&#xA;input:5&#xA;output:&#xA;24&#xA;37&#xA;61&#xA;98&#xA;159&#xA;257&#xA;416&#xA;673&#xA;1089&#xA;1762&#xA;2851&#xA;4613&#xA;7464&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;By the way, here is the JavaScript code I used for this example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;var primeNumber1 = prime(num);&#xA;var primeNumber2 = prime(num+1);&#xA;fib(primeNumber1,primeNumber2,0,primeNumber1);&#xA;}&#xA;function fib(num1,num2,iterations,max){&#xA;console.log(num1+num2);&#xA;if(iterations == max+1){&#xA;return;&#xA;}&#xA;fib(num2,num1+num2,iterations+1,max);&#xA;}&#xA;function prime(number){&#xA;var numPrime = 0;&#xA;for(var i = 0; i &amp;gt; -1; i++){&#xA;if(isPrime(i)){&#xA;numPrime++;&#xA;if(numPrime == number){&#xA;return i;&#xA;}&#xA;}&#xA;}&#xA;}&#xA;function isPrime(num) {&#xA;  for(var i = 2; i &amp;lt; num; i++)&#xA;    if(num % i === 0) return false;&#xA;  return num &amp;gt; 1;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="101116" LastEditorUserId="101116" LastEditDate="2022-01-18T18:24:12.420" LastActivityDate="2022-01-18T18:24:12.420" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24302" PostTypeId="2" ParentId="2140" CreationDate="2022-01-18T20:28:48.920" Score="0" Body="&lt;h1&gt;Help Bob split his apples&lt;/h1&gt;&#xA;&lt;p&gt;Bob has a lot of apples, and he wants to split his apples with his friends evenly. (Including Bob.) However, every &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;th friend already has a lot of apples and does not need apples. Bob, however, is kind so he gives each &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;th friend the number of apples the friend already gives floor divided by three.&lt;/p&gt;&#xA;&lt;p&gt;Given the input format below, a number &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;, and a number &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; for the number of apples, output the number of apples that each person receives.&lt;/p&gt;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;[0, 0, 80, 0, 0, 45, 0, 0, 12] 3 100 =&amp;gt; [10, 9, 26, 9, 9, 15, 9, 9, 4]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="105116" LastActivityDate="2022-01-18T20:28:48.920" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24303" PostTypeId="2" ParentId="2140" CreationDate="2022-01-18T22:41:04.967" Score="3" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241609/is-this-continuous-terrain-part-ii&quot;&gt;Is this continuous terrain? Part II&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-01-22T19:28:06.357" LastActivityDate="2022-01-22T19:28:06.357" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24304" PostTypeId="2" ParentId="2140" CreationDate="2022-01-19T08:37:04.290" Score="1" Body="&lt;h1&gt;Cell Evolution&lt;/h1&gt;&#xA;&lt;p&gt;Your lab needed to simulate how a particular cell evolves over time in a 2D grid space. A sample 2D grid space below shows a single cell at the centre of the grid.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 0 0 0 0&#xA;0 0 0 0 0&#xA;0 0 1 0 0&#xA;0 0 0 0 0&#xA;0 0 0 0 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The cell evolution follows these rules:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;'0' indicates no live cell&lt;/li&gt;&#xA;&lt;li&gt;A positive number indicates a live cell. The number indicates its age.&lt;/li&gt;&#xA;&lt;li&gt;A cell will grow from age 1 to 5 in each evolution&lt;/li&gt;&#xA;&lt;li&gt;After age 5, a cell will die at the next evolution (resetting to '0')&lt;/li&gt;&#xA;&lt;li&gt;If a cell has 4 or more neighbours (adjacent and diagonally), it will die due to over-crowding.&lt;/li&gt;&#xA;&lt;li&gt;In each evolution, a live cell will spread to its neighbour (adjacent and diagonally) if there is no live cell there and that neighbour is not overcrowded (surrounded by less than 4 cells)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Given an integer &lt;code&gt;n&lt;/code&gt; in the input, which represents the size of the grid given, output the next generation of cells until all cells are dead (&amp;quot;0&amp;quot;)&lt;/p&gt;&#xA;&lt;p&gt;Extra rules:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The first live cell is always in the center of the grid&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;n&lt;/code&gt; must be odd so the live cell is always centered&lt;/li&gt;&#xA;&lt;li&gt;The grid size &amp;lt;=9 to prevent incredibly large outputs of data&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h1&gt;Test case&lt;/h1&gt;&#xA;&lt;p&gt;Only 1 to save space in question&lt;/p&gt;&#xA;&lt;p&gt;Input: 3&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 0 0&#xA;0 1 0&#xA;0 0 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 1 1&#xA;1 2 1&#xA;1 1 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;2 0 2&#xA;0 0 0&#xA;2 0 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;3 1 3&#xA;1 1 1&#xA;3 1 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;4 0 4&#xA;0 0 0&#xA;4 0 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;5 1 5&#xA;1 1 1&#xA;5 1 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 0 0&#xA;0 0 0&#xA;0 0 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is code-golf, so shortest bytes wins!&lt;/p&gt;&#xA;&lt;h1&gt;Tags:&lt;/h1&gt;&#xA;&lt;p&gt;matrix&lt;/p&gt;&#xA;&lt;p&gt;code-golf&lt;/p&gt;&#xA;&lt;p&gt;ascii-art&lt;/p&gt;&#xA;&lt;p&gt;cellular-automata&lt;/p&gt;&#xA;&lt;p&gt;Please check the tags or edit them if they're wrong or you think a particular tag is not here. Feel free to comment on this puzzle!&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-01-20T07:40:18.620" LastActivityDate="2022-01-20T07:40:18.620" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24305" PostTypeId="2" ParentId="2140" CreationDate="2022-01-19T16:23:36.203" Score="0" Body="&lt;h1&gt;Move the next greater number, with fewest fails to take everything&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to move the next greater number, with fewest fails to take everything&lt;/p&gt;&#xA;&lt;p&gt;A fail counts if a step is the lower number (not counting equal)&lt;/p&gt;&#xA;&lt;p&gt;The starting point is the top left corner&lt;/p&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1234&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Can do like this&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Because moves to right, the next number is greater than previous&lt;/p&gt;&#xA;&lt;p&gt;But&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;124&#xA;435&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Is impossible so the fewest fails are:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;v&amp;lt;&amp;lt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;1&lt;/code&gt; &amp;gt; &lt;code&gt;2&lt;/code&gt; &amp;gt; &lt;code&gt;4&lt;/code&gt; &amp;gt; &lt;code&gt;5&lt;/code&gt; &amp;lt; &lt;code&gt;3&lt;/code&gt; &amp;gt; &lt;code&gt;4&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;So this has 1 fail&lt;/p&gt;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&lt;p&gt;The output is not exact, there are multiple possible solutions&lt;/p&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;123&#xA;245&#xA;175&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;vv&amp;lt;&amp;lt;^&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;123456789&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;987654321&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;123&#xA;456&#xA;789&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;vv&amp;lt;&amp;lt;^&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;123456789&#xA;987654321&#xA;123456789&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;v&amp;lt;&amp;lt;&amp;lt;&amp;lt;&amp;lt;&amp;lt;&amp;lt;&amp;lt;v&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Meta:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="106959" LastEditorUserId="106959" LastEditDate="2022-01-19T19:14:59.640" LastActivityDate="2022-01-19T19:14:59.640" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24307" PostTypeId="2" ParentId="2140" CreationDate="2022-01-19T22:47:59.393" Score="0" Body="&lt;h1&gt;Euler Irregular Primes&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge is to find all &lt;a href=&quot;https://en.wikipedia.org/wiki/List_of_prime_numbers#Euler_irregular_primes&quot; rel=&quot;nofollow noreferrer&quot;&gt;Euler Irregular Primes&lt;/a&gt; (A prime p is Euler-irregular if it divides an Euler number E(2n) with 0&amp;lt;2n&amp;lt;p−1) under &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Your goal is to use the least amount of bytes.&lt;/p&gt;&#xA;" OwnerUserId="110481" LastEditorUserId="110481" LastEditDate="2022-01-21T22:24:14.683" LastActivityDate="2022-01-21T22:24:14.683" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24309" PostTypeId="2" ParentId="2140" CreationDate="2022-01-20T02:41:19.860" Score="2" Body="&lt;h1&gt;Regex ordinals&lt;/h1&gt;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://xkcd.com/1313/&quot; rel=&quot;nofollow noreferrer&quot;&gt;this xkcd comic&lt;/a&gt;, your job is to write an extremely meta regex.&lt;/p&gt;&#xA;&lt;p&gt;Specifically, the depth of a regex is an &lt;a href=&quot;https://en.wikipedia.org/wiki/Ordinal_number&quot; rel=&quot;nofollow noreferrer&quot;&gt;ordinal&lt;/a&gt; defined as follows:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;regex golf&lt;/code&gt; has depth 0.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;meta-x&lt;/code&gt; has depth 1 greater than the depth of &lt;code&gt;x&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The depth of &lt;code&gt;&amp;lt;regex&amp;gt;&lt;/code&gt; is the supremum of the depths of everything &lt;code&gt;&amp;lt;regex&amp;gt;&lt;/code&gt; matches.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Of course, it's possible for a string not to have a depth. For example, &lt;code&gt;/.*/&lt;/code&gt; matches itself, so its depth would have to be greater than its depth, which is impossible.&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to write a regex with depth &lt;span class=&quot;math-container&quot;&gt;\$\omega^2\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;And this is code golf, so the shortest regex wins.&lt;/p&gt;&#xA;&lt;h2&gt;Examples of regex ordinals&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;meta-regex golf&lt;/code&gt; is depth 1.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;meta-meta-regex golf&lt;/code&gt; is depth 2.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;/(meta-)*regex golf/&lt;/code&gt; is depth &lt;span class=&quot;math-container&quot;&gt;\$\omega\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;/(meta-)*\/(meta-)\*regex golf\//&lt;/code&gt; is depth &lt;span class=&quot;math-container&quot;&gt;\$\omega 2\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="96445" LastEditorUserId="96445" LastEditDate="2022-01-22T01:48:20.190" LastActivityDate="2022-01-22T01:48:20.190" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24310" PostTypeId="2" ParentId="24251" CreationDate="2022-01-20T02:53:21.150" Score="-2" Body="&lt;h1&gt;Allowed byte count is &lt;span class=&quot;math-container&quot;&gt;\$\log_{256}k\$&lt;/span&gt;&lt;/h1&gt;&#xA;&lt;p&gt;If a chosen length has &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; states, then it has &lt;span class=&quot;math-container&quot;&gt;\$\log_{256}k\$&lt;/span&gt; bytes.&lt;/p&gt;&#xA;&lt;p&gt;Allowing arbitrary byte count lead to some weird languages(lenguage but the length ^-1).&lt;/p&gt;&#xA;&lt;p&gt;Trying to abuse it save at most half of length.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2022-01-20T02:53:21.150" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24311" PostTypeId="2" ParentId="2140" CreationDate="2022-01-20T04:22:07.473" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241650/sort-every-dimension&quot;&gt;Sort every dimension&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-01-24T19:59:39.560" LastActivityDate="2022-01-24T19:59:39.560" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24312" PostTypeId="2" ParentId="2140" CreationDate="2022-01-20T06:32:04.497" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241905/animate-finding-the-middle-hypercube-edition&quot;&gt;Animate finding the middle (hypercube edition)&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-01-30T19:26:31.487" LastActivityDate="2022-01-30T19:26:31.487" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24313" PostTypeId="1" CreationDate="2022-01-20T10:12:26.453" Score="15" ViewCount="1471" Body="&lt;h3&gt;Final phase&lt;/h3&gt;&#xA;&lt;p&gt;You have chosen the categories and the nominees for CGCC's annual &amp;quot;Best of&amp;quot;. Now it is time to pick the winners!&lt;/p&gt;&#xA;&lt;p&gt;Each of the 22 categories is represented by an answer to this question, and each of these answers contains all nominations by the members of our community.&lt;/p&gt;&#xA;&lt;h3&gt;Voting mechanism&lt;/h3&gt;&#xA;&lt;p&gt;Each nominee has been added as a comment to its category's answer. In each category, the nominee whose comment has the highest number of votes by Feb 18 6:00 UTC will be declared the winner of that category.&lt;/p&gt;&#xA;&lt;h3&gt;Further details&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Starting now, please do &lt;strong&gt;not&lt;/strong&gt; edit the answers.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Please do &lt;strong&gt;not&lt;/strong&gt; add comments to the answers.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Votes on the question and on answers are meaningless; only votes on comments count.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Feel free to vote for multiple nominees of the same category, including your own posts.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="66833" LastEditDate="2022-02-04T16:42:25.997" LastActivityDate="2022-02-04T16:42:25.997" Title="Best of CGCC 2021 - Voting is now open!" Tags="|discussion|best-of|" AnswerCount="22" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24314" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:12:36.307" Score="3" Body="&lt;h1&gt;Slowest Gun in the East&lt;/h1&gt;&#xA;&lt;p&gt;Too often, late answers are overlooked, and end up with fewer upvotes than answers posted immediately after the challenge is posted. This category is aimed to reward impressive answers posted a while after the challenge was originally posted and that went unappreciated, compared to the FGITW answers.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/107944/output-a-program-that-outputs-a-program-that-outputs-ppcg/235580#235580&quot;&gt;Output a program that outputs a program ... that outputs PPCG&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/106959/fmbalbuena&quot;&gt;Fmbalbuena&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;h4&gt;Nominated by Me (Fmbalbuena)&lt;/h4&gt;&#xA;&lt;p&gt;This is My first answer and gained 10 upvotes.&lt;/p&gt;&#xA;&lt;p&gt;Why?&lt;/p&gt;&#xA;&lt;p&gt;Because this is the winner. Unfortunately, this answer didn't get accepted. Imagine 14 languages? This is the best of every answer.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/237143/78410&quot;&gt;Generate Net puzzles&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I can't believe that it went unanswered for, like, &lt;strong&gt;six and a half years?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;And then it was solved with just &lt;strong&gt;38 bytes&lt;/strong&gt;. While complex solutions to complex problems are great on their own, I believe simple solutions like this to &lt;em&gt;seemingly&lt;/em&gt; complex problems are the true gems of our site.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/236077/16766&quot;&gt;Flatten the CUBE&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/101522/aaroneous-miller&quot;&gt;Aaroneous Miller&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by DLosc&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This question was posted in 2017. For years, the only answer was the OP's Python solution. Finally, in 2021, Aaroneous Miller posted a solution in Vim--a surprising language choice even though it's a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; challenge, since the challenge involves traversing a 2D figure in a twisty path. Not only that, but this Vim solution is a good bit shorter than the Python solution.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="16766" LastEditDate="2022-02-03T21:11:02.387" LastActivityDate="2022-02-03T21:11:02.387" CommentCount="3" CommunityOwnedDate="2022-01-20T10:12:36.307" ContentLicense="CC BY-SA 4.0" />
  <row Id="24315" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:14:01.803" Score="4" Body="&lt;h1&gt;Best mathematical insight&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20597/43319&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18442/78410&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17317/78410&quot;&gt;2018&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;On this site we often see answers in languages specifically designed for short code, or designed to be fast. Sometimes, a nice golfing trick or speed-up technique surprises us with its ingenuity, beyond the standard use of that language.&lt;/p&gt;&#xA;&lt;p&gt;And occasionally an answer shows up that uses an unexpected approach to greatly simplify the problem, and makes us wonder how the author could ever think of that. This usually involves some far-from-obvious mathematical equivalence, or a particularly simple approach to the problem that was not evident at all (once revealed, other answers often follow the same approach).&lt;/p&gt;&#xA;&lt;p&gt;This category is for the answer with the best &lt;strong&gt;mathematical&lt;/strong&gt; insight or unexpected approach that led to greatly simplifying the problem, in &lt;strong&gt;any challenge type&lt;/strong&gt; (code golf, fastest code, or others). The insight should have led to a significant improvement according to the challenge's metric (code length, run time, or whatever applicable).&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/238613/43319&quot;&gt;Cumulative summation of repeated descending powers of ten&lt;/a&gt; (nominated by Adám)&lt;/h3&gt;&#xA;&lt;p&gt;The algorithm pioneered in Lynn's Jelly answer for &lt;a href=&quot;https://codegolf.stackexchange.com/q/238607/43319&quot;&gt;Converge to a number&lt;/a&gt; was then copied by a handful of others.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223169/79857&quot;&gt;Implement Ash's float division&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/82619/delfad0r&quot;&gt;Delfad0r&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;(nominated by Redwolf Programs)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Although many of the answers to this question of mine had unique and interesting golfs, Delfad0r's Haskell answer (the one I'm nominating) ingeniously made use of &lt;code&gt;tanh&lt;/code&gt;, one of the rarely used hyperbolic trig functions. It's the exact sort of trick that takes what makes code golf so great to the extreme; using an obscure built-in for something it was never designed for, just to save a couple bytes.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/39242/anders-kaseorg&quot;&gt;Anders Kaseorg&lt;/a&gt;'s  &lt;a href=&quot;https://codegolf.stackexchange.com/a/240010/9288&quot;&gt;answer to AoCG2021 Day 22: Hyperbolic rescue&lt;/a&gt; (nominated by alephalpha)&lt;/h3&gt;&#xA;&lt;p&gt;Reduce a path on a order-4 hexagonal tiling on a hyperbolic space. The challenge itself is very mathematical, even seems impossible to solve.&lt;/p&gt;&#xA;&lt;p&gt;Anders Kaseorg first translated a path into a sequence of symmetries, and then transformed it to a concise set of string rewriting rules. Now the challenge become easy to understand and solve.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/86301/robin-ryder&quot;&gt;Robin Ryder&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/229808/66833&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/229765/66833&quot;&gt;Demonstrate some advanced abstract algebra&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by caird coinheringaahing&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;With some refinement from xnor, Robin provides a very clean and elegant proof that the only anti-distributive (&lt;span class=&quot;math-container&quot;&gt;\$a * (b + c) = -(a * b + a * c)\$&lt;/span&gt;) surjection on &lt;span class=&quot;math-container&quot;&gt;\$\mathbb Z\$&lt;/span&gt; is when &lt;span class=&quot;math-container&quot;&gt;\$a * b = 0\$&lt;/span&gt; for all &lt;span class=&quot;math-container&quot;&gt;\$a, b\$&lt;/span&gt;. Thus, proving my challenge to be impossible, which had been the subject of multiple discussions in The Nineteenth Byte leading up to my posting of the challenge.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="66833" LastEditDate="2022-01-28T20:26:41.057" LastActivityDate="2022-01-28T20:26:41.057" CommentCount="4" CommunityOwnedDate="2022-01-20T10:14:01.803" ContentLicense="CC BY-SA 4.0" />
  <row Id="24316" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:15:01.287" Score="4" Body="&lt;h1&gt;Rookie of the Year - Challenges&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost of &lt;a href=&quot;/a/20589/66833&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;/a/18437/66833&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;/a/17318/85052&quot;&gt;2018&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;For the best challenge written by someone who has not written a challenge prior to 2021&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresu A&lt;/a&gt; for pretty much all their questions&lt;/h2&gt;&#xA;&lt;p&gt;(&lt;em&gt;nominated by &lt;a href=&quot;https://codegolf.stackexchange.com/users/97857/pxeger&quot;&gt;pxeger&lt;/a&gt;&lt;/em&gt;)&lt;/p&gt;&#xA;&lt;p&gt;Being a new user in 2021 and posting consistently high-quality, interesting, and well-received challenges.&lt;/p&gt;&#xA;&lt;p&gt;I'd like to specifically point out &lt;a href=&quot;https://codegolf.stackexchange.com/q/224365&quot;&gt;Implement Minceraft&lt;/a&gt;, which although not actually their first challenge, was well-received and hit the &lt;a href=&quot;https://codegolf.stackexchange.com/posts/224365/revisions&quot;&gt;HNQ jackpot&lt;/a&gt;. It was a simple challenge to implement in the first place, but had various interesting approaches for golfing thanks to the pattern between the two strings, which I think is what made it particularly interesting. It also inspired some interesting &lt;a href=&quot;https://codegolf.stackexchange.com/a/224552&quot;&gt;new&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/224504&quot;&gt;techniques&lt;/a&gt; for producing randomness.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/224621/92901&quot;&gt;xkcd 2385 KoTH (Final Exam)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/103324/endershadow8&quot;&gt;EnderShadow8&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Dingus&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;It's pretty rare for a user's first challenge to be a KoTH and rarer still for it to succeed like this one did (91 upvotes and 63 answers at the time of writing). The relatively simple premise invited a large number of submissions, which ran the gamut from returning a constant to implementing mathematically informed prediction strategies.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/239702/nth-fizzbuzz-number&quot;&gt;Nth Fizzbuzz Number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/105116/bgil-midol&quot;&gt;Bgil Midol&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;(self-nomination)&lt;/p&gt;&#xA;&lt;p&gt;This is fizzbuzz, but the challenge is to get the nth fizz, the nth buzz, and so on. The answers contain mathematical insight, and hyper's answer at first used a &amp;quot;cheaty&amp;quot; solution. The answer, when made not cheaty, was actually shorter than the cheaty solution. The algorithmic thinking is an enjoyable process are all golfers.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/223202/16766&quot;&gt;Cooperative Counting&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/102975/jumbot&quot;&gt;jumbot&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by DLosc&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This King of the Hill challenge provides an interesting twist on Iterated Prisoner's Dilemma, striking a great balance between simplicity and depth of strategy. King of the Hill is a hard challenge type to get right, so it's impressive to see a KotH of this quality from a user who's only posted one question and one answer so far.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="16766" LastEditDate="2022-02-03T22:17:00.890" LastActivityDate="2022-02-03T22:17:00.890" CommentCount="4" CommunityOwnedDate="2022-01-20T10:15:01.287" ContentLicense="CC BY-SA 4.0" />
  <row Id="24317" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:16:09.977" Score="3" Body="&lt;h1&gt;Best non-&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20598/97857&quot;&gt;2020&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Best challenge with a winning criteria other than &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;While &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; is our bread and butter, we have some very interesting others with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/proof-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;proof-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;proof-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;, (some) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;s, etc.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/226701/78410&quot;&gt;Concatenated halting problem: no + no + ... = yes&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I think this one was fairly original (it isn't a variation of any previous challenge, at least to my knowledge), and attracted many creative answers in both mainstream languages and esolangs. It's like each answer has its own way to create halting programs with non-halting program segments.&lt;/p&gt;&#xA;&lt;p&gt;As a small bonus, some users came up with very fitting and funny link texts for code examples:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/##FcwpDoBAEARA36/Znj0R7VhHUHwBLAnh/8PgStV1P@/pvmzzSCKYApSBDJgyaIGsAuZAUQVLoKqBNdDUwRboGmAPDBlhf2RUgnHuq/sH&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Forte – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/##FcwrDoAwEARQP6fpbL9mHHUE1SuAJSHcf1ncU@@6n/d0Z9rnogxkwJRBC2QVMAeKKlgCVQ2sgaYOtkDXAHtgyAj7I6MSjPPY3D8&quot; rel=&quot;nofollow noreferrer&quot;&gt;ry it online!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/##DcYpEoBAEANAn9dsZk9EJA7JF8BSRfH/Ia36ft7vytyO/SwiWBwqQDqhCoZT1cDqNHWwOV0D7M7QBIcztcDpLAWR@QM&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it onlin!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/##FcspDoBAEARA36/Znj0R7VhHUHwBLAnh/8PgytR1P@/pvmzzSCKYApSBDJgyaIGsApZAVQNroKmDLdA1wB4YMsL@b1SCce6r@wc&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try t online!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/##S8svKkn9/9/IwMc1xMjQ1oDLyNDVz@X/fwA&quot; rel=&quot;nofollow noreferrer&quot;&gt;e!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="78410" LastEditDate="2022-01-21T02:08:34.277" LastActivityDate="2022-01-21T02:08:34.277" CommentCount="1" CommunityOwnedDate="2022-01-20T10:16:09.977" ContentLicense="CC BY-SA 4.0" />
  <row Id="24318" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:17:09.753" Score="4" Body="&lt;h1&gt;Best Explanation&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20601/66833&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18451/66833&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17315/66833&quot;&gt;2018&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14512/66833&quot;&gt;2017&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10940/66833&quot;&gt;2016&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This category is for the answer with the best explanation accompanying it. Ideally, the winner will be an answer with a very detailed explanation that is accessible to anyone, regardless of the amount of relevant knowledge already possessed.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225417/16766&quot;&gt;Animate finding the middle&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/15469/jonah&quot;&gt;Jonah&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by DLosc&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Jonah's solution takes a sideways approach to the problem (literally), and Jonah went to the trouble of drawing up a couple of diagrams to illustrate the thought process. The explanation also does a good job of breaking the solution down into its constituent parts, with a worked example, so that even someone who doesn't know J can understand what the program does.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/235298/87606&quot;&gt;Totally Cubular&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/87606/tjjfvi&quot;&gt;tjjfvi&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-Nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The algorithm for solving the puzzle is fully described in the explanation. It's long, due to the complexity of the challenge, but it was written to be approachable by anyone, even if they have never touched a twisty puzzle. Thus, it explains not just the algorithm, but also the fundamental concepts and thought process behind solving the challenge. Additionally, it includes numerous interactive illustrations (&lt;a href=&quot;https://cubular.t6.fyi/#INTO_CENTER-demo&quot; rel=&quot;nofollow noreferrer&quot;&gt;example&lt;/a&gt;) and a &lt;a href=&quot;https://cubular.t6.fyi&quot; rel=&quot;nofollow noreferrer&quot;&gt;custom playground&lt;/a&gt; which was created solely for the CGCC explanation.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/82619/delfad0r&quot;&gt;Delfad0r&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/222757/92901&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/222709/92901&quot;&gt;Sticky polyhexes&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Dingus&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A picture is worth a thousand words and this answer incorporates some excellent visual aids to help explain cube co-ordinates. The ideas behind the code are broken down clearly in a thorough, yet entertaining, way. This is a well written, high effort answer that @Delfad0r has every right to be proud of.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/17216/deadcode&quot;&gt;Deadcode&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/222932/79857&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/114003/division-and-remainder&quot;&gt;Division and remainder&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Radvylf Programs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This was a Regex answer to a math-related problem, so the answer's basically guaranteed to be interesting. With more than 20 KB of information about how the answer and some golfed variants of it work, more than 400 MathJax delimiters, and dozens of useful links, this answer provides far more in-depth details on how the answer works than would ever be expected for a 57 byte submission.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="79857" LastEditDate="2022-02-03T19:00:08.070" LastActivityDate="2022-02-03T19:00:08.070" CommentCount="4" CommunityOwnedDate="2022-01-20T10:17:09.753" ContentLicense="CC BY-SA 4.0" />
  <row Id="24319" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:18:09.560" Score="4" Body="&lt;h1&gt;Most involvement in an answer/answers&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18435/95792&quot;&gt;2020&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;For an answer or multiple answers where multiple people were involved. This could be multiple people helping out a user on a single answer, or a back-and-forth between two or more answers trying to outgolf each other.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/207558/print-x-without-x-cops-thread&quot;&gt;69 answers to Print X Without X&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/101522/aaroneous-miller&quot;&gt;Aaroneous Miller&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresu A&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Partial self-nomination by emanresu A &amp;amp; Lyxal&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Note: Answer count was honestly unintentional.&lt;/p&gt;&#xA;&lt;p&gt;This began with me posting cops in &lt;a href=&quot;https://github.com/chunkybanana/javastack&quot; rel=&quot;nofollow noreferrer&quot;&gt;Javastack&lt;/a&gt; (a language of mine) and Lyxal cracking them. We got to 13 before I gave up, then a few weeks later we began again in &lt;a href=&quot;https://github.com/vyxal/vyxal&quot; rel=&quot;nofollow noreferrer&quot;&gt;Vyxal&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I began posting these, and got to 10 before Lyxal and I decided to swap. At this point, the cracks were hundreds of thousands of bytes. Aaroneous Miller jumped in and solved Lyxal's first cop, and ended up solving most of Lyxal's.&lt;/p&gt;&#xA;&lt;p&gt;For the first few of Lyxal's, the answers could actually be run, until I &lt;a href=&quot;https://codegolf.stackexchange.com/a/235786/100664&quot;&gt;found a crack&lt;/a&gt; where the cost to get a single character exponentially grew. From this point on, the programs became completely theoretical - over the course of several weeks (September 25 to October 16), the byte counts exceeded even the size of the internet.&lt;/p&gt;&#xA;&lt;p&gt;I (lyxal) personally know that when constructing the cop answers, figuring out what to ban next and improving my intended solution was on my mind quite frequently - I'd be thinking about it while shopping, while taking showers and more. And I know that AaroneousMiller was also pretty constant in his dedication/determination to crack the cops - there was much discussion in the Vyxal chat room on different potential solutions/strategies.&lt;/p&gt;&#xA;&lt;p&gt;It ended with Aaroneous &lt;a href=&quot;https://codegolf.stackexchange.com/a/236409/101522&quot;&gt;exactly finding&lt;/a&gt; Lyxal's intended answer.&lt;/p&gt;&#xA;&lt;p&gt;I recommend reading the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/207560/print-x-without-x-robbers-thread&quot;&gt;robbers' thread&lt;/a&gt; as it has all the explanations.&lt;/p&gt;&#xA;&lt;p&gt;In 2020, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/20638/cast-your-vote-for-best-of-cgcc-2020?rq=1&quot;&gt;Lyxal and HighlyRadioactive had 16 answers total.&lt;/a&gt; In 2021, the three of us had 69 total answers. We'll see what happens this year, and I apologize in advance to Wheat Wizard's inbox.&lt;/p&gt;&#xA;&lt;h2&gt;JS answers to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/237172/constructing-solar-panels-from-squares&quot;&gt;Constructing Solar Panels from Squares&lt;/a&gt; (&lt;a href=&quot;https://codegolf.stackexchange.com/a/237182/79857&quot;&gt;Redwolf Programs&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/237184/79857&quot;&gt;Arnauld&lt;/a&gt;)&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;(Partial) self-nomination by Redwolf Programs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This started with a FGITW by Redwolf, which was golfed from 110 to 90 bytes. An answer was then posted by Arnauld, at 79 bytes, which seemed like it was likely to be close to optimal. However, with help from both Mayube and emanresu A, the byte count on the first answer was brought down to 81, then 73, and finally to 71, over a period of about half an hour and with some collaboration in chat.&lt;/p&gt;&#xA;&lt;p&gt;This was the first time I'd actually discussed golfs for an answer in chat, and the community effort to bring down the byte count was a lot of fun, and also the only time I've managed to outgolf Arnauld. :p&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/72738/ian-h&quot;&gt;Ian H.&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/229952/92901&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/229918/92901&quot;&gt;Write a C++ demangler&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Dingus&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A series of 11 golfs in comments by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresu A&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/103633/fzs&quot;&gt;FZs&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/58563/arnauld&quot;&gt;Arnauld&lt;/a&gt;, and a deleted user shaved 54 bytes off the original 287 byte solution. This answer well embodies the collaborative spirit of CGCC.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="16766" LastEditDate="2022-02-03T19:19:55.913" LastActivityDate="2022-02-03T19:19:55.913" CommentCount="3" CommunityOwnedDate="2022-01-20T10:18:09.560" ContentLicense="CC BY-SA 4.0" />
  <row Id="24320" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:20:30.663" Score="3" Body="&lt;h1&gt;Rookie of the Year - Answers&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20594/66833&quot;&gt;2020&lt;/a&gt; and other years.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;For the best answer written by a new user in 2021. This doesn't have to be a user who created their account in 2021 - rather, this is for any answer posted by a user in 2021 where that answer was that user's first answer on the site.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1537115/2021-answers-by-users-with-no-answers-before-2021&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE query&lt;/a&gt; modified from the 2020 one&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/240341/78410&quot;&gt;Counting universal n-ary logic gates&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/84290/anttip&quot;&gt;AnttiP&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nomination by Bubbler&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a math-heavy achievement but it's not purely mathematical nor does it improve the score for the winning criterion, so I decided to nominate this in this category rather than Best Mathematical Insight.&lt;/p&gt;&#xA;&lt;p&gt;The attempt to count universal logic gates was done for only up to n=3 (&lt;a href=&quot;http://twistedoakstudios.com/blog/Post7878_exploring-universal-ternary-gates&quot; rel=&quot;nofollow noreferrer&quot;&gt;Craig Gidney's result in 2013&lt;/a&gt; being the only one I could find). AnttiP showed how to optimize further to achieve the result for n=4, using &lt;em&gt;three&lt;/em&gt; new mathematical concepts and some programming-wise optimization techniques. By finding the value for n=4, the sequence also became eligible to be submitted to the OEIS. (It is now &lt;a href=&quot;https://oeis.org/A350418&quot; rel=&quot;nofollow noreferrer&quot;&gt;A350418&lt;/a&gt;.) This result truly deserves attention outside Code Golf SE.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/223869/66833&quot;&gt;Interpret brainf***&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/101522/aaroneous-miller&quot;&gt;Aaroneous Miller&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;As part of our new &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/tagged/cgcc-blog&quot;&gt;site blog&lt;/a&gt;, we've been nominated underappreciated answers. For 3 of the 4 blog posts, one of Aaroneous Miller's Vim answers has been listed, and his brinfuck interpreter in Vim is perhaps the most impressive of those answers.&lt;/p&gt;&#xA;&lt;p&gt;Not only is this answer incredibly impressive normally, but it was also golfed by around 25%, dropping from 809 bytes to 580 bytes, to make it an even more impressive feat.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="66833" LastEditDate="2022-01-21T01:40:36.510" LastActivityDate="2022-01-21T01:40:36.510" CommentCount="2" CommunityOwnedDate="2022-01-20T10:20:30.663" ContentLicense="CC BY-SA 4.0" />
  <row Id="24321" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:22:19.290" Score="5" Body="&lt;h1&gt;Wrong tool for the job&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17321/9288&quot;&gt;2018&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This category is for an answers that use the worst possible language to accomplish a task, while still making an effort to optimize the score. For example, writing a non-trivial program while using an extremely minimalist language like &lt;a href=&quot;https://esolangs.org/wiki/7&quot; rel=&quot;nofollow noreferrer&quot;&gt;7&lt;/a&gt;, or an inconvenient language like &lt;a href=&quot;https://esolangs.org/wiki/Lost&quot; rel=&quot;nofollow noreferrer&quot;&gt;lost&lt;/a&gt;, or even a normal language that's missing some crucial capability like internet connectivity or image processing.&lt;/p&gt;&#xA;&lt;p&gt;Answers for this category should consider both the difficulty of the task and the unsuitable-ness of the language.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/87606/tjjfvi&quot;&gt;tjjfvi&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=user%3A87606+aocg2021&quot;&gt;25 answers in AOCG2021 in TypeScript Types&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nomination by alephalpha&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;It's well-known that TypeScript's type system is Turing complete, but writing nontrivial programs in TypeScript Types is not easy. tjjfvi solved all 25 challenges in AOCG2021 using TypeScript Types, which includes &lt;a href=&quot;https://codegolf.stackexchange.com/a/239694/9288&quot;&gt;writing an interpreter&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/a/240043/9288&quot;&gt;solving word problems of Hyperbolic Coxeter groups&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/96393/user197974&quot;&gt;user197974&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/223001/80214&quot;&gt;Gravity Simulator in Marbelous&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Marbelous is a famous turing incomplete 2d language which is just unsuitable for most simple tasks. The author of this answer has gone so far as to write an entire interpreter for Marbelous themselves, along with simulating a rotating tape within its constraints to make a truly impressive answer.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226641/66833&quot;&gt;caird coinheringaahing&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/226641/66833&quot;&gt;parsing HTML with Jelly&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;What's a worse idea than parsing HTML with regex? Parsing HTML with &lt;em&gt;Jelly&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Jelly almost famously has very little string handling capacity, is &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=58492065#58492065&quot;&gt;awful at parsing challenges&lt;/a&gt; and, being a golfing language, isn't exactly optimised for web-based ones either. Which is why it's very surprising that Jelly is the winning answer here, in a challenge about parsing the HTML content of a webpage. I think the quote from my answer just about sums it up nicely how bad Jelly is for this challenge.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/101522/aaroneous-miller&quot;&gt;Aaroneous Miller's&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/237334/16766&quot;&gt;Whitespace interpreter in Vim&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by DLosc&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Vim is a text editor. Sure, it's got tools that make it far more capable than your average text editor, but still--it's a text editor. When you think Vim golf, you think of transforming some input into some output, usually string manipulation, maybe a little math.&lt;/p&gt;&#xA;&lt;p&gt;Aaroneous Miller used Vim to write an interpreter for a programming language. (Actually, this happened twice (!), but the BF interpreter was already nominated for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24320/16766&quot;&gt;another category&lt;/a&gt;, so I'm nominating the Whitespace interpreter here.) The amount of patience required to implement a language with control flow, a stack and a heap, and two dozen commands &lt;em&gt;in Vim&lt;/em&gt; is amazing.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="16766" LastEditDate="2022-02-03T20:52:58.280" LastActivityDate="2022-02-03T20:52:58.280" CommentCount="4" CommunityOwnedDate="2022-01-20T10:22:19.290" ContentLicense="CC BY-SA 4.0" />
  <row Id="24322" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:23:24.017" Score="4" Body="&lt;h1&gt;Best Tip&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20616&quot;&gt;2020&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;For the best answer to a question tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;, because this site isn't just about competing with one another, but also about helping each other improve our golfing skills&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/237171&quot;&gt;The shortest infinite &lt;code&gt;for&lt;/code&gt; comprehension&lt;/a&gt; (self-nomination by &lt;a href=&quot;https://codegolf.stackexchange.com/users/97857/pxeger&quot;&gt;pxeger&lt;/a&gt;)&lt;/h3&gt;&#xA;&lt;p&gt;While answering &lt;a href=&quot;https://codegolf.stackexchange.com/a/236763&quot;&gt;Write an infinitely nested generator comprehension&lt;/a&gt;, I discovered a way to shorten something you might think to be totally optimal, which felt like a crazy new discovery to make.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/231602/16766&quot;&gt;&lt;code&gt;s&lt;/code&gt; isn't longest first, but &lt;code&gt;⊇&lt;/code&gt; is&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/85334/unrelated-string&quot;&gt;Unrelated String&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;In Brachylog, &lt;code&gt;s&lt;/code&gt; is the obvious builtin for &amp;quot;get all contiguous sublists.&amp;quot; The trouble is that you often want to generate the longest sublist first, and &lt;code&gt;s&lt;/code&gt; doesn't do that: it starts with all sublists that include the first element. However, Unrelated String realized that &lt;code&gt;⊇&lt;/code&gt;, &amp;quot;get all sublists, not necessarily contiguous,&amp;quot; &lt;em&gt;does&lt;/em&gt; generate the longest sublists first, and furthermore that the non-contiguous results can be easily removed by combining &lt;code&gt;⊇&lt;/code&gt; with &lt;code&gt;s&lt;/code&gt;. This tip is non-obvious and really useful; I've used it twice already.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/235486/78850&quot;&gt;Use &lt;code&gt;₃&lt;/code&gt; and &lt;code&gt;Ḣ&lt;/code&gt; for certain length checks&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresuA&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nomination by @lyxal&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Fwt8J.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Fwt8J.jpg&quot; alt=&quot;I put a meme in my nomination kekw&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This tip has been helpful many times in shaving bytes off my answers. Plus, it utilises some of the lesser-known overloads of things like how &lt;code&gt;₃&lt;/code&gt; will check to see if a string is of length 1.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225288/78850&quot;&gt;Compress your strings and numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;String/number compression is an important part of any modern SBCS golfing language, and Vyxal is no different. This tip gives a comprehensive explanation of the compression utilities available to vyxalers, and it explains the concept of things like &amp;quot;String Compression Codes&amp;quot; and the dictionary of words Vyxal uses.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="78850" LastEditDate="2022-01-30T13:04:42.640" LastActivityDate="2022-01-30T13:04:42.640" CommentCount="4" CommunityOwnedDate="2022-01-20T10:23:24.017" ContentLicense="CC BY-SA 4.0" />
  <row Id="24323" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:24:29.647" Score="2" Body="&lt;h1&gt;Most Underappreciated Challenge&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20618/79857&quot;&gt;2020&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;For the best challenge that didn't really get noticed. Sometimes a challenge, especially one that's tough or not vanilla code golf, only gets a few votes, maybe an answer, then disappears.&lt;/p&gt;&#xA;&lt;p&gt;Solving a difficult challenge is rewarding; there's no reason we shouldn't reward the difficult challenges (that don't get noticed)!&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/217526/smallest-image-containing-one-of-every-rgb-color&quot;&gt;Smallest image containing one of every RGB color&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100374/lostxor&quot;&gt;LostXOR&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Redwolf Programs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a challenge by a new user, with a really neat premise. It involves manipulating PNG's compression to try to make an image, containing every RGB color, as small as possible.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/223431/fastest-unique-finder&quot;&gt;Fastest unique finder&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/76323/l4m2&quot;&gt;l4m2&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Redwolf Programs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a bit of a niche challenge, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-memory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-memory&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-memory&lt;/a&gt;, and restricted to assembly or C on a particular chip. As a result, it didn't get many votes or answers, although there are answers and interesting ideas for solutions by multiple people.&lt;/p&gt;&#xA;&lt;p&gt;The answers ended up being incredibly fast, with the winner managing to be more than &lt;em&gt;thirty thousand times faster&lt;/em&gt; than the original approach in the question.&lt;/p&gt;&#xA;&lt;p&gt;Overall, this was a pretty neat challenge, with a lot of interesting optimizations. It was rather poorly received, despite all of this.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224268/determine-if-a-dotcomma-program-halts&quot;&gt;Determine if a dot(comma) program halts&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/79857/ta-radvylf-srik-su-shilani&quot;&gt;Redwolf Programs&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This was a challenge of mine that didn't end up getting many answers. It revolved around determining if a program in a certain subset of the language dotcomma would halt.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224704/gelatin-integer-metagolf&quot;&gt;Gelatin integer metagolf&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/caird-coinheringaahing&quot;&gt;caird coinheringaahing&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Redwolf Programs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt; challenge involving a tacit language similar to Jelly. In other words, it's difficult, especially for those who don't already know Jelly :p&lt;/p&gt;&#xA;&lt;p&gt;As a result, it didn't get much attention, despite it showing that a lot of work was put in to ensure its specification was clear.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/231266/splinter-metagolf&quot;&gt;Splinter metagolf&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresu A&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Redwolf Programs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This was a really cool metagolf, since Splinter has such basic syntax, but allows a lot of depth in how well the program can be optimized. Additionally, the answers show a lot of effort, and show the difficulty of the challenge.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/235267/jelly-compression-quine&quot;&gt;Jelly compression quine&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresu A&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Redwolf Programs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Currently, this is an unanswered question. The goal is to design a compressed Jelly string, which decompresses to itself. It's a very interesting idea for a challenge, and any answer to it would likely involve the exact sort of clever discoveries that this site encourages.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/236976/smallest-possible-scratch-3-0-project-file-sb3&quot;&gt;Smallest possible Scratch 3.0 project file (SB3)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90158/niall-ward&quot;&gt;Niall Ward&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Redwolf Programs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This was an interesting and somewhat unusual challenge, involving finding the smallest valid file that can be inputted into Scratch 3.0. It didn't receive much attention, but was a cool idea and had some interesting answers.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="79857" LastEditDate="2022-01-23T22:01:58.393" LastActivityDate="2022-01-23T22:01:58.393" CommentCount="7" CommunityOwnedDate="2022-01-20T10:33:55.687" ContentLicense="CC BY-SA 4.0" />
  <row Id="24324" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:26:47.880" Score="3" Body="&lt;h1&gt;Most significant impact via Meta&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;/questions&quot;&gt;Meta&lt;/a&gt; is an important yet often overlooked portion of this site, where significant rules changes are decided, and the site becomes the most democratic. It allows people to present their visions of the site, and for others to show their agreement or disagreement, and contributions can be just as important - if not more - than posts on Main.&lt;/p&gt;&#xA;&lt;p&gt;This category is to reward Meta posts that have had a non-trivial or significant impact on the site in some way, and the users who proposed them.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/20881/should-we-have-even-even-more-room-owners-for-the-nineteenth-byte&quot;&gt;Should we have even even more room owners for The Nineteenth Byte?&lt;/a&gt;, asked by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/66833/caird-coinheringaahing&quot;&gt;caird&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;(nominated by @lyxal)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;If we're talking about things more important than posts on Main, then you can't go past meta posts directly impacting dealings in The Nineteenth Byte; you can't have a cohesive and functional community without a central discourse location.&lt;/p&gt;&#xA;&lt;p&gt;This meta post prompted a Room Owner election and 4 new ROs were elected in 2021, meaning that more moderation was available for chat. In turn, TNB is more organised, able to flow with interruptions being handled quickly and with authoritative &amp;quot;leadership&amp;quot; (for lack of better phrasing) that &lt;em&gt;works&lt;/em&gt; for everyone.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24021/advent-of-code-golf&quot;&gt;Advent of Code Golf&lt;/a&gt;, originally an idea by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/66833/caird-coinheringaahing&quot;&gt;caird&lt;/a&gt;, largely &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/24068&quot;&gt;implemented&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;(Nominated by &lt;a href=&quot;https://codegolf.stackexchange.com/users/97857/pxeger&quot;&gt;pxeger&lt;/a&gt;)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;In 2020, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/66833/caird-coinheringaahing&quot;&gt;caird coinheringaahing&lt;/a&gt; had the &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/55926336#55926336&quot;&gt;idea&lt;/a&gt; of an &amp;quot;Advent of Code Golf&amp;quot;, but decided to abandon it that year.&lt;/p&gt;&#xA;&lt;p&gt;In 2021, it was &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/24021&quot;&gt;re-proposed more formally on Meta&lt;/a&gt;. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt; swiftly took on the task, creating &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/24068&quot;&gt;an event challenge sandbox&lt;/a&gt; and producing 22 challenge ideas for consideration over the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/posts/24118/revisions&quot;&gt;span&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/posts/24069/revisions&quot;&gt;of&lt;/a&gt; only 11 days! Three challenges were also contributed by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;Wheat Wizard&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Several other users were also involved in posting the challenges on Bubbler's behalf on some days when he wasn't available at 00:00 UTC himself. Posting reliably at the same time for 15 days is quite an accomplishment for just one user!&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/search?q=%22AoCG2021+leftover%22+is%3Aq&quot;&gt;A few leftovers&lt;/a&gt; from the planning were also posted a little after Advent finished.&lt;/p&gt;&#xA;&lt;p&gt;I think this is the most significant impact this year because it produced 26 high-quality challenges, which are really the heart of our site, and what keeps us going. It's also very significant based on time alone: it occupied an entire month, and if it repeats in future years, will have had an even bigger (multiplied) impact.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=60209258#60209258&quot;&gt;caird said&lt;/a&gt; Bubbler deserves the nomination, so that's who I'm putting forward officially for this award.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/20861/66833&quot;&gt;Welcome to Code Golf and Coding Challenges Stack Exchange!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/66833&quot;&gt;caird&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;(Self nomination)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;We're very different from most other SE sites, and one of our biggest issues is that new users are often confused about how to get started here. New users often post &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/20821/66833&quot;&gt;off-topic or low quality questions&lt;/a&gt;, and aren't always &lt;a href=&quot;https://codegolf.stackexchange.com/questions/220044/convert-gemtext-to-html#comment512318_220044&quot;&gt;aware of the Sandbox&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This page has detailed answers on how to get started, and what the site is about/for, and provides a more bespoke version of our &lt;a href=&quot;https://codegolf.stackexchange.com/help&quot;&gt;help pages&lt;/a&gt; to help new users with answering, asking and further moderation on the site.&lt;/p&gt;&#xA;&lt;p&gt;Having a welcome page has been suggested &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8808/66833&quot;&gt;since 2016&lt;/a&gt;, but it wasn't until this year that we finally created one. And, since posting, the number of off-topic posts by new users appears to have reduced - the welcome page seems to be doing its job.&lt;/p&gt;&#xA;&lt;h2&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/23456/66833&quot;&gt;Great Status Tag Cleanup&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/66833&quot;&gt;caird&lt;/a&gt; and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/68942/hyper-neutrino&quot;&gt;hyper-neutrino&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;(Partial self-nomination by caird)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Back in May of 2021, I was &lt;a href=&quot;https://data.stackexchange.com/meta.codegolf/query/1407925/bugs-frs-with-no-status-tags&quot; rel=&quot;nofollow noreferrer&quot;&gt;messing around with SEDE&lt;/a&gt; and noticed that we had over 150 &lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt; reports and &lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt; posts with no status tag (e.g. &lt;a href=&quot;/questions/tagged/status-completed&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-completed&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-completed&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/status-review&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-review&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-review&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/status-declined&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-declined&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-declined&lt;/a&gt; etc.). Around the same time, staff members &lt;a href=&quot;https://meta.stackexchange.com/q/370442/355458&quot;&gt;started paying more attention to newly retagged status posts&lt;/a&gt; - if you aren't aware, whenever a mod tags a post as &lt;a href=&quot;/questions/tagged/status-review&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-review&amp;#39;&quot; rel=&quot;tag&quot;&gt;status-review&lt;/a&gt;, the SE staff have that post added to their tacking software. Because of this, and a &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=58197095#58197095&quot;&gt;suggestion I made&lt;/a&gt;, me and hyper decided to tackle the old and forgotten &lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt; posts on our meta.&lt;/p&gt;&#xA;&lt;p&gt;Over the next couple of days, I &lt;a href=&quot;https://gist.github.com/cairdcoinheringaahing/d6d479f3acec9ef86755a687fd013f2c/revisions&quot; rel=&quot;nofollow noreferrer&quot;&gt;compiled a list&lt;/a&gt; of all untagged posts with either the &lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt; or &lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt; tags, and me and hyper systematically went  through them, retagging each as appropriate. This took a few days, and, once the dust settled, we had 4 questions left on meta that were missing a status tag. In short, we reduced the list down from over 150, to 4, and helped organise a large number of forgotten feature requests and bug reposts, some of which were later fixed/implemented.&lt;/p&gt;&#xA;&lt;p&gt;I believe this should be split evenly between both myself and hyper - while I did a significant amount of work compiling and sorting through the list, without hyper's help, it never would've actually happened.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="66833" LastEditDate="2022-02-03T02:41:00.920" LastActivityDate="2022-02-03T02:41:00.920" CommentCount="4" CommunityOwnedDate="2022-01-20T10:34:50.587" ContentLicense="CC BY-SA 4.0" />
  <row Id="24325" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:28:10.260" Score="4" Body="&lt;h1&gt;The most unexpected outcome&lt;/h1&gt;&#xA;&lt;p&gt;An answer that you didn’t expect to work, or do something else, but unexpectedly did some weird behavior and made the answer valid.&lt;/p&gt;&#xA;&lt;p&gt;This could involve some interpreter bug, or obscure feature that wasn’t documented nor known by many people.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/230321/16766&quot;&gt;Print instructions for typing \` in chat&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;At first, I thought this challenge was going to be a straightforward regex substitution problem in Pip. But as I started writing it, I realized that a regex &lt;em&gt;was&lt;/em&gt; the solution. It turns out that the way a Pip regex is formatted in its string representation (escape all backticks and then wrap the whole thing in backticks) is exactly what the challenge asked for. This despite the fact that some of the outputs (such as &lt;code&gt;`\\``&lt;/code&gt; from the titular &lt;code&gt;\`&lt;/code&gt;) are not even valid regex literals in Pip. I'm not sure whether this is a bug or a feature, but it was certainly convenient.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/231642/78410&quot;&gt;Lolololololololololololol&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;em&gt;Hexagony golfing language confirmed&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225531/78410&quot;&gt;Solving it in Hexagony at 6 bytes is easy&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; L ;&#xA;o ; l&#xA; ; .&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;but did you imagine that Hexagony can print Lololol... in 5 bytes? Because I totally didn't. And I totally didn't expect &lt;a href=&quot;https://codegolf.stackexchange.com/a/195264/78410&quot;&gt;my &lt;code&gt;six&lt;/code&gt; printer in 6 bytes&lt;/a&gt; to trivially translate to this one either. But it did. (And it is currently winning the challenge, tying with &lt;a href=&quot;https://codegolf.stackexchange.com/a/211688/78410&quot;&gt;Keg&lt;/a&gt; and winning against everything else - Jelly, 05AB1E, Stax, Husk, you name it.)&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/233535/100664&quot;&gt;Sort a list and write some English!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresu A&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;While writing this, I wanted to start my letter with &lt;code&gt;Dear Boss,&lt;/code&gt;. But &lt;code&gt;,&lt;/code&gt; prints the top of stack and I couldn't have extraneous output, so I used a homoglyph comma. &lt;em&gt;then&lt;/em&gt;, I realised &lt;code&gt;Dear Boss,&lt;/code&gt; &lt;em&gt;was&lt;/em&gt; the answer. &lt;code&gt;Dear Bo&lt;/code&gt; leaves the list unchanged, &lt;code&gt;ss&lt;/code&gt; sorts it twice and &lt;code&gt;,&lt;/code&gt; outputs, then all I needed to do was terminate the program with a &lt;code&gt;Q&lt;/code&gt; and... ugh... do some creative writing.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/235201/78850&quot;&gt;Unlolify a lolified message&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresuA&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nomination by @lyxal&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Here's me, and I've FGITW'd a question (as you do) with Vyxal. I gave an 18 byte answer and thought to myself &amp;quot;I'm happy with this, it's 18 bytes, and will probably lose to Jelly by 3 or 4 bytes but that's okay&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;Turns out I was wrong.&lt;/p&gt;&#xA;&lt;p&gt;Very wrong.&lt;/p&gt;&#xA;&lt;p&gt;So wrong that I basically got ratio'd on a code golf answer in 2021.&lt;/p&gt;&#xA;&lt;p&gt;How? EmanresuA went and posted a 3 byte answer that completely blew my pathetic 18 byter out of the water. To quote myself:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;H.......... How'd you absolutely destroy me by 15 bytes?!?!?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;And then to make things worse for me, emanresuA came and golfed my answer by almost half, putting my original 18 byte answer to all sorts of shame. In summary, things were completely and utterly frick for me but wonderful for EmanresuA kekw.&lt;/p&gt;&#xA;&lt;p&gt;Needless to say, I wasn't expecting any of that to happen, hence why I think this should be chosen as the winner of this category.&lt;/p&gt;&#xA;&lt;p&gt;(There's also the fact that 17 people agreed that this should be nominated for a best-of category when Adám suggested to do so on a comment on the answer: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/235199/unlolify-a-lolified-message/235224#comment535204_235201&quot;&gt;IIRC, there is/was a &amp;quot;best of&amp;quot; category for outgolfing the creator of a language. This certainly qualifies.&amp;quot;&lt;/a&gt; - since there isn't such a category, I thought it appropriate to nominate it here)&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="78850" LastEditDate="2022-01-29T13:21:06.417" LastActivityDate="2022-01-29T13:21:06.417" CommentCount="4" CommunityOwnedDate="2022-01-20T10:28:10.260" ContentLicense="CC BY-SA 4.0" />
  <row Id="24326" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:29:13.780" Score="3" Body="&lt;h1&gt;Most Interesting King of the Hill Submission&lt;/h1&gt;&#xA;&lt;p&gt;For the best answer to a KotH challenge. Specifically, the one with the most interesting or complex strategy.&lt;/p&gt;&#xA;&lt;p&gt;We had &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=%5Bking-of-the-hill%5D+created%3A2021+is%3Aq&quot;&gt;14&lt;/a&gt; KotHs this year, with a total of &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=%5Bking-of-the-hill%5D+created%3A2021+is%3Aa&quot;&gt;179&lt;/a&gt; answers, so it's quite likely there's some really great ones that should be recognized. I think it's especially important to recognize good answers to KotH challenges, because complicated strategies take time to write, and thus don't get as many votes from the challenge hitting the HNQs.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/218158/79857&quot;&gt;Rabbit&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Redwolf Programs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This was the first bot in Bot Factory KoTH 2.0 that actually made use of the &lt;code&gt;build&lt;/code&gt; function (which builds a new &amp;quot;worker&amp;quot; bot), which was one of the main points of the KotH. Although it didn't end up being super competitive, due to its inability to defend itself, it was exactly the sort of thing I was hoping people would come up with when I designed the challenge.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/218417/79857&quot;&gt;Ghost&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/79857/ta-radvylf-srik-su-shilani&quot;&gt;Redwolf Programs&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I initially didn't make this self-nomination when nominating answers for this category, but I'm really proud of it. It was a self-answer to my Bot Factory 2.0, and it won. It had been carefully designed and optimized for days straight, and used several strategies I'd learned from bots in other KotHs, and from my previous submission to Bot Factory 2.0.&lt;/p&gt;&#xA;&lt;p&gt;Ghost was given its name because it was almost invisible to the other bots; it would never try to compete with them, only ever going for characters which it could reach before anyone else. It would also do anything possible to avoid coming into contact with stronger bots (since it started out very weak, as bots' initial strength was based on their byte count, and Ghost was quite long).&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224675/79857&quot;&gt;Lumberjack&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9534/ancientswordrage&quot;&gt;AncientSwordRage&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Redwolf Programs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Regardless of your opinions on it, xkcd 2385 KoTH (Final Exam) had a pretty big impact. It was one of the most popular questions we've had in a long time, nearly reaching +100, and it led to a substantial increase in the popularity of KotHs.&lt;/p&gt;&#xA;&lt;p&gt;I debated with myself for a while to decide what answers from this KotH to nominate, and I ended up going with AncientSwordRage's Lumberjack. There were three main categories of submissions to this KotH:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Trivial approaches, like always returning &lt;code&gt;100&lt;/code&gt; or &lt;code&gt;1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Simple bots that try some sort of strategy (such as copying the previous winner)&lt;/li&gt;&#xA;&lt;li&gt;Bots that use complicated math to try to precisely optimize their moves&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Lumberjack was a fun mix between the 2 and 3, and one of the first non-trivial bots. Plus, it gets extra credit for this:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Kicking ass and taking logs, and it's all out of ass.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/224682/79857&quot;&gt;Sam (Self-Aware Maximizer)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100737/wimi&quot;&gt;wimi&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Redwolf Programs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This was another non-trivial answer to xkcd 2385 KoTH (Final Exam), and one that makes a serious effort to maximize its score. It was also one of the earlier bots, and it kick-started a massive arms race of optimization-focused bots. It was also the user's first post on CGCC.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224621/xkcd-2385-koth-final-exam/224727#224727&quot;&gt;Balanced Strategy&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/103575/new-posts&quot;&gt;New Posts&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Redwolf Programs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This was an answer to xkcd 2385 KoTH (Final Exam), and the user's first (and only) post on CGCC. It had a refreshing lack of strategy or intelligence, fit for a bot posted by a bot.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/220890/79857&quot;&gt;phoenix_wright&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/95116/gsitcia&quot;&gt;gsitcia&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Redwolf Programs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Liars and Guessers was among first KotHs from 2021, and this was a fun and competitive solution to it. Liars and Guessers is different from most KotHs in that there are two roles a submission can have. Unsurprisingly, those are Liars and Guessers.&lt;/p&gt;&#xA;&lt;p&gt;Phoenix_wright was a Guesser that used a neat strategy, and managed to get second place. The same user who posted phoenix_wright also had two Liars in second and third place.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="79857" LastEditDate="2022-02-03T19:49:17.253" LastActivityDate="2022-02-03T19:49:17.253" CommentCount="6" CommunityOwnedDate="2022-01-20T10:29:13.780" ContentLicense="CC BY-SA 4.0" />
  <row Id="24327" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:30:14.847" Score="3" Body="&lt;h1&gt;Best trickiest challenge&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20620&quot;&gt;Similar to a category from 2020&lt;/a&gt; (but slightly reworded to reward not purely &lt;em&gt;hard&lt;/em&gt;, but also &lt;em&gt;fun&lt;/em&gt;, challenges).&lt;/p&gt;&#xA;&lt;p&gt;It should look simple and tempt you to start coding right away, but coming up with a good solution should be hard.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/237291/78410&quot;&gt;Infinite ordinals from a well-ordering&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/84290/anttip&quot;&gt;AnttiP&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nomination by Bubbler&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This one fits in many categories (&lt;em&gt;Rookie challenge&lt;/em&gt;, &lt;em&gt;Breaking the mold&lt;/em&gt; (for being the first interesting challenge with partial-ordering winning criterion, which allows multiple winners at multiple levels), and possibly &lt;em&gt;Best non-code-golf challenge&lt;/em&gt;), but I decided to nominate it here because it is also a great example of a challenge that is easy-to-participate but hard-to-win.&lt;/p&gt;&#xA;&lt;p&gt;Due to the nature of the winning criterion of this challenge, multiple submissions can win at the same time at different &amp;quot;levels&amp;quot; or, in some sense, &amp;quot;categories&amp;quot;. Lower categories (lower ordinals) are easy to participate in (construct some answer), but it is hard to win, being a red ocean of golflang wielders. Higher categories require mathematical thinking and some proper knowledge on the fast-growing hierarchy. Therefore, the challenge is naturally enjoyable to golfers at all levels, but challenging for everyone at the same time.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/235688/16766&quot;&gt;Drop down the numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/105116/bgil-midol&quot;&gt;Bgil Midol&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;This seems easy at first, (just sort every column) but you also need to handle wrapping, and duplicate locations. In some languages, to get shorter solutions, some mathematical knowledge might be used. It is also hard to win. Even in golfing languages, some algorithmic knowledge is used. The challenge is a good challenge for all, and also enjoyable.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/238607/105116&quot;&gt;Converge to a number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresu A&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;(Paragraph coming soon.)&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="105116" LastEditDate="2022-02-01T17:30:23.990" LastActivityDate="2022-02-01T17:30:23.990" CommentCount="3" CommunityOwnedDate="2022-01-20T10:30:14.847" ContentLicense="CC BY-SA 4.0" />
  <row Id="24328" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:31:20.217" Score="2" Body="&lt;h1&gt;Most helpful Sandbox commenter&lt;/h1&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;/q/2140/66833&quot;&gt;Sandbox&lt;/a&gt; is a very useful tool to help improve people's challenges, and functions best when users provide helpful advice and feedback on the drafts.&lt;/p&gt;&#xA;&lt;p&gt;This category should reward the users who helped the most in the Sandbox during 2021&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Redwolf Programs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Using my offline copy of TNB's transcript, I compiled a table, showing the number of times every user replied to a message in TNB asking for feedback on a sandboxed challenge in 2021.&lt;/p&gt;&#xA;&lt;p&gt;Razetime had a large number of responses with consistently useful feedback, and more of them than any other user.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Redwolf Programs&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;As with Razetime, Bubbler has consistently replied to requests for feedback in chat with useful suggestions. Many times Bubbler's replies make note of missing or incorrect test cases, which is important and something that's often skipped over.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="79857" LastEditDate="2022-01-22T20:12:32.993" LastActivityDate="2022-01-22T20:12:32.993" CommentCount="2" CommunityOwnedDate="2022-01-20T10:31:20.217" ContentLicense="CC BY-SA 4.0" />
  <row Id="24329" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:33:37.383" Score="4" Body="&lt;h1&gt;Wild card&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20615/97857&quot;&gt;Repost of 2020&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;For a deserving challenge, answer, or user that isn't a good fit for any of the other categories.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/47050/quintopia&quot;&gt;quintopia&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/219764/80214&quot;&gt;Befunge-93 in Befunge-93&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Interpreting Befunge 93  is already not very easy, but doing it within Befunge 93 is a behemoth in itself. This uses the existing features of befunge to simulate the program within its own playing field!&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/76162/jo-king&quot;&gt;Jo King&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/232976/100664&quot;&gt;quantum quine&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by emanresu A&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;When I wrote this question, I didn't believe it was possible to create a program with a score of 0. It's hard to make a program that &lt;em&gt;functions&lt;/em&gt; when any character is removed, and even harder to make a &lt;em&gt;quine&lt;/em&gt; that &lt;em&gt;stays a quine&lt;/em&gt; when any character is removed, let alone one that behaves in such a specific way.&lt;/p&gt;&#xA;&lt;p&gt;Jo King's answer uses &lt;a href=&quot;https://github.com/GrayJoKing/Backhand&quot; rel=&quot;nofollow noreferrer&quot;&gt;Backhand&lt;/a&gt;, a language which skips every few characters to make &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; a bit easier, and even then it's still a quite complex answer.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/104752/m90&quot;&gt;m90&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/231006/92901&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/204779/92901&quot;&gt;Final tribute to John Conway: FRACTRAN self-interpreter&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Dingus&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The previous best solution known for this problem, at 48 fractions, had stood since 2017. It was blown out of the water by @m90's 30-fraction solution, which was accompanied by an excellent explanation.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/87606/tjjfvi&quot;&gt;tjjfvi&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/233759/92901&quot;&gt;answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/24352/92901&quot;&gt;Complement a POSIX Extended Regular Expression&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Dingus&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This challenge had gone without an answer for over 7 years, and a quick survey of the comments reveals just how difficult it was perceived to be: 'It's possible, but crazy tedious ... slightly harder than writing a complete RE engine!', 'Supporting escaped meta-characters is honestly going to be a challenge in itself', 'The code I have so far is basically 30KB'. And indeed, @tjjfvi's well-explained code is a complex beast, transforming regex → tree → DFA → regex, all in less than 1.6 kB! This answer could easily have been nominated for Most Complex Answer or Best Explanation, but @tjjfvi already has another worthy contender in those categories!&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="92901" LastEditDate="2022-01-31T03:52:50.613" LastActivityDate="2022-01-31T03:52:50.613" CommentCount="4" CommunityOwnedDate="2022-01-20T10:33:37.383" ContentLicense="CC BY-SA 4.0" />
  <row Id="24330" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:34:41.307" Score="5" Body="&lt;h1&gt;Most helpful commenter&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20591/95792&quot;&gt;2020&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17329/95792&quot;&gt;2018&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;One of the things that stands out about this community is that although it's highly competitive, there is nearly always someone on hand to offer advice both on improving challenges and improving answer scores. It's part of what made this site seem so welcoming to me.&lt;/p&gt;&#xA;&lt;p&gt;In recognition of this, nominees should be people who have helped others improve and made them feel welcome, whether by direct comments on challenges and answers, or in comments in chat.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/20260/xnor?tab=profile&quot;&gt;xnor&lt;/a&gt; for golfs on Haskell answers&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by Wheat Wizard&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Xnor is very skilled at Haskell golfing, but only posted a handful of Haskell answers this year.  Instead xnor left quite a few comments suggesting golfs on other's Haskell answers.&lt;/p&gt;&#xA;&lt;p&gt;This is just a way to appreciate xnor's brilliant contributions to Haskell golfing.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/81203/att&quot;&gt;att&lt;/a&gt; for golfs on Mathematica answers&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by alephalpha&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Att is a really magical Mathematica golfer, who knows every dark corner of this language, and enthusiastically share these magics through comments. This is how I usually golf a Mathematica answer:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Find a solution.&lt;/li&gt;&#xA;&lt;li&gt;Try every trick that I can think of, until I cannot golf a single byte.&lt;/li&gt;&#xA;&lt;li&gt;Post the answer.&lt;/li&gt;&#xA;&lt;li&gt;See a comment.&lt;/li&gt;&#xA;&lt;li&gt;&amp;quot;-10 bytes thanks to @att.&amp;quot;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;Lyxal&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/users/101522/aaroneous-miller&quot;&gt;Aaroneous Miller&lt;/a&gt; for golfs on Vyxal answers&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nominated by emanresu A&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Both of these two are very skilled at Vyxal golfing, sometimes finding very clever tricks to save a few bytes, as you can tell by &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=lyxal+bytes+thanks+vyxal&quot;&gt;these&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=+miller+bytes+thanks+vyxal&quot;&gt;searches&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I can't decide who to nominate here, so I'm nominating both of them.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="100664" LastEditDate="2022-01-21T06:09:38.737" LastActivityDate="2022-01-21T06:09:38.737" CommentCount="4" CommunityOwnedDate="2022-01-20T10:34:41.307" ContentLicense="CC BY-SA 4.0" />
  <row Id="24331" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:35:53.567" Score="7" Body="&lt;h1&gt;Most improved answer&lt;/h1&gt;&#xA;&lt;p&gt;This category is to reward the continued work users put into answers long after they have been posted.  After the FGITW effect has dissipated there stops being so much incentive to work on an old answer, but some users put in the effort and really make it shine.  The ideal answer here would be one that demonstrates a significant commitment to improvement regardless of the quality of the initial answer.  This could be improving the score, or the explanation or both.&lt;/p&gt;&#xA;&lt;p&gt;Answers in this category don't have to have been initially posted in 2021 but the improvements have to have been made over the course of the year.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/137699&quot;&gt;&amp;quot;Hello World!&amp;quot; in Lost&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;Wheat Wizard&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This answer was originally posted in 2017 it was golfed a bit by Martin Ender at first but basically sat unimproved for 3 years.  It seemed that this was probably optimal for Lost.  45 bytes seemed like as good as it was going to get.&lt;/p&gt;&#xA;&lt;p&gt;However in 2021 some new techniques in Lost golf were invented and it became apparent that this might not be so optimal.  With some fiddling it was brought down 2 bytes to 43.  And then the door was open.  How far could it be brought down?  JoKing came up with a brilliantly complex 38 byte solution and further effort carefully brought it down to 37.  Several more 37s were found and it seemed like there might be a possibility of a 36. And after a few more weeks of work but a 36 was finally discovered putting it where it is today.&lt;/p&gt;&#xA;&lt;p&gt;The journey from the somewhat straightforward program an incomprehensible square of symbols, has really been a wonderful collaboration.  It's amazing that 4 years on this very simple task in Lost is still producing new and interesting golfing opportunities.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/222542/100664&quot;&gt;Placing circles along a square spiral&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresu A&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;What can I say? This answer went from 417 bytes to 194 through a series of golfs over the last few months. Just now, I found a way to golf off 12 bytes, and I feel like there's still room for improvement.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/210307/78850&quot;&gt;1, 2, Fizz, 4, Buzz&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Whether you love it or hate it, this answer has had significant effort placed into getting its byte count down from 19 to 11. And while that may not seem like much at first glance, it's quite significant given that Fizzbuzz has existed for many years, and yet this was the first answer to get 2 bytes away from single-digit scores.&lt;/p&gt;&#xA;&lt;p&gt;The journey of this answer starts in August 2020. The initial score was 19 bytes (&lt;code&gt;Ĥɾƛ3∻kf*n5∻kb*+n⟇;&lt;/code&gt;), and had a lot of icky references to the context variable (a variable that allows you to retrieve the argument of a lambda/function/for-loop). This was the best that could be done at the time, because Vyxal was only at version 0.3.0.&lt;/p&gt;&#xA;&lt;p&gt;Then, in January 2021, the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/58615/1-2-fizz-4-buzz/209618#209618&quot;&gt;Arn&lt;/a&gt; fizzbuzz was posted, coming in at 18 bytes. Now during the later months of 2020, Vyxal had grown enough so that I was able to get 18 bytes too, using the original fizzbuzz I had envisioned during language design. But I wasn't about to be happy sharing tied first-place for shortest non-built-in FizzBuzz; a somewhat obvious golf got the answer down to 17 bytes (&lt;code&gt;Ĥƛ3œı⇿⌊*n5œıₛÔ*+⟇&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;p&gt;Then, in March 2021, after a while of pondering about how to make the FizzBuzz shorter within existing constructs (as in, getting a shorter fizzbuzz was something I had been planning on and off since January - I used many pages of paper for handwritten experiments as to how best remove bytes), I had the brilliant idea of placing the divisibility of each number by 3 and 5 into a list and using vectorised multiplication of the list of &lt;code&gt;[&amp;quot;Fizz&amp;quot;, &amp;quot;Buzz&amp;quot;]&lt;/code&gt; instead of doing each divisibility test individually. Doing so managed to shave another 3 bytes off the answer to get 14 bytes (&lt;code&gt;Ĥƛ35fœkfkb‿*∑⟇&lt;/code&gt;). At this stage, this answer was just trailing behind the second-place built-in answer in Valyrio.&lt;/p&gt;&#xA;&lt;p&gt;I was pretty happy with myself - 14 bytes was well below the existing Jelly answer that was 20 bytes long, and I thought it would be a while before I had to consider any competition. I was wrong. In April 2021, there was another golfing language (Ash, by Redwolf Programs) being developed that boasted a 12-byte FizzBuzz - 2 bytes shorter than my current record of 14 bytes. Unfortunately, my planning only managed to find a 14 byte limit - I couldn't find any shorter programs with the built-in set of Vyxal 1.x. In order to keep my position as #1 non-built-in fizzbuzz, I'd need to do something big - rewrite the entire language.&lt;/p&gt;&#xA;&lt;p&gt;Doing so allowed me to add a whole bunch of useful features to Vyxal (such as parallel apply, better constant glyphs, divisibility checks, etc) that would aid my quest to not come up 2 bytes too long. After a few weeks of language designing and implementation, I had an 11 byte solution: &lt;code&gt;₁ƛ₍₃₅kF½*∑∴&lt;/code&gt;. This was guaranteed to be shorter than the potential Ash fizzbuzz, and ended up beating the aforementioned Valyrio answer, placing it second on the entire leaderboard.&lt;/p&gt;&#xA;&lt;p&gt;The improvements made to get it from 14 bytes to 11 bytes are subtle, but effective: &lt;code&gt;35fœ&lt;/code&gt; turned into &lt;code&gt;₍₃₅&lt;/code&gt; and &lt;code&gt;kfkb‿&lt;/code&gt; turned into &lt;code&gt;kF½&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;And during this time, the explanations of each answer were added, and at one stage in 2021, I had included a detailed description of how to derive the 18 byte fizzbuzz starting from basics.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="78850" LastEditDate="2022-01-29T13:11:57.783" LastActivityDate="2022-01-29T13:11:57.783" CommentCount="3" CommunityOwnedDate="2022-01-20T10:35:53.567" ContentLicense="CC BY-SA 4.0" />
  <row Id="24332" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:36:56.697" Score="3" Body="&lt;h1&gt;Breaking The Mold (Most Original Challenge)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Reposted from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17327/66833&quot;&gt;2018&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;It's really easy to come up with normal &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;, or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; challenge, etc. Don't get me wrong, there's nothing wrong with these challenges. They're the meat of the challenges on our site. However, they're not the most imaginative.&lt;/p&gt;&#xA;&lt;p&gt;This category is for a challenge that re-invents the wheel, and explores new ideas that we haven't really used on the site.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Maybe this challenge inspired a new tag, or category of challenges?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Maybe it's a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; with a unique and very well balanced scoring formula?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Or maybe it's even a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge about a novel task. This category is for rewarding users who came up with interesting ideas that keep the site fresh.&lt;/p&gt;&#xA;&lt;p&gt;Some justification for why the challenge is original is necessary with nominations - 99% of challenges posted on the site shouldn't qualify for this.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/221091/78410&quot;&gt;Minimally destroy CGCC in Game of Life&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/caird-coinheringaahing&quot;&gt;caird coinheringaahing&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nomination by Bubbler&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The first challenge that asks to modify a given configuration in Game of Life to achieve a certain effect in the end. The idea originates from &lt;a href=&quot;https://puzzling.stackexchange.com/q/31247/71652&quot;&gt;a similar challenge posted on Puzzling&lt;/a&gt;, but it also fits to our site in two ways: using GoL (a Turing-complete &amp;quot;language&amp;quot;), and being able to use code to search for a solution.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/236606/78410&quot;&gt;Build the stove controller (physically)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is one of the classic &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/logic-gates&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;logic-gates&amp;#39;&quot; rel=&quot;tag&quot;&gt;logic-gates&lt;/a&gt; challenge that asks to implement a circuit that achieves some task using the fewest number of NAND gates. But this one introduces a new concept: a &lt;strong&gt;sequential circuit&lt;/strong&gt;. That is, a circuit that contains some form of internal storage and, given certain kind of input, it changes its output &lt;em&gt;and&lt;/em&gt; its internal state. In the context of circuit golf, it means that you need to juggle between different possible kinds of storage (a latch, a D flip-flop or a JK flip-flop?) and the count thereof, which have a tradeoff with the size of the input/output parts of the circuit.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/222548/reverse-zip-bomb&quot;&gt;Reverse Zip Bomb&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/79857/ta-radvylf-srik-su-shilani&quot;&gt;Redwolf Programs&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This challenge was a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, and a twist on the idea of a &lt;a href=&quot;https://en.wikipedia.org/wiki/Zip_bomb&quot; rel=&quot;nofollow noreferrer&quot;&gt;zip bomb&lt;/a&gt;. Rather than writing code directly, this challenge required designing a specially crafted image or other file which would be as difficult as possible to compress (which often required writing code).&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="79857" LastEditDate="2022-01-21T14:36:34.503" LastActivityDate="2022-01-21T14:36:34.503" CommentCount="3" CommunityOwnedDate="2022-01-20T10:36:56.697" ContentLicense="CC BY-SA 4.0" />
  <row Id="24333" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:38:10.717" Score="2" Body="&lt;h1&gt;Kansas City Shuffle&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Reposted from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17324/66833&quot;&gt;2018&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Too often, someone devises a particularly golfy method of solving a challenge, which most people will use that method for their answers. This award goes to those answers that utilize an alternative method as a better solution than the method that the majority of other answers use (prior to the posting of the rewarded answer).&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/237032/9288&quot;&gt;Compute matrix blockiness&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;While all other answers try every possible blockiness, my answer simply takes a run-length encoding and a GCD. It was the shortest answer (beating J and Charcoal) until Bubbler ported my solution to J.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="9288" LastEditDate="2022-01-21T07:15:23.523" LastActivityDate="2022-01-21T07:15:23.523" CommentCount="1" CommunityOwnedDate="2022-01-20T10:38:10.717" ContentLicense="CC BY-SA 4.0" />
  <row Id="24334" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:39:18.387" Score="9" Body="&lt;h1&gt;Most complex answer&lt;/h1&gt;&#xA;&lt;p&gt;For the answer so complex that few people or even no people can understand, yet it works beautifully while remaining golfed.&lt;/p&gt;&#xA;&lt;p&gt;These answers could be creative and long (but are not generated or just repeat the same code)&lt;/p&gt;&#xA;&lt;p&gt;The logic inside the code can't be understood by us mortals, but it works anyway.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226071/56656&quot;&gt;Geiger Counter in Klein XXX&lt;/a&gt; by Wheat Wizard&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;(self nomination)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;JoKing originally proposed a Klein XXX Geiger counter back in 2018.  I tried it several times since each time getting a little farther but eventually giving up because it was just too complicated.&lt;/p&gt;&#xA;&lt;p&gt;A Geiger counter is hard since you need to account for &lt;em&gt;any&lt;/em&gt; character being deleted.  The larger the code grows the more you need to account for. But the real issue here is that there are on top 12 different Klein topolgies to account for, which means you can lose track of the instruction pointer in the middle of execution.  The deletions of newlines were especially tricky since they completely change the shape of the program which has to be accounted for in different ways for every topology.&lt;/p&gt;&#xA;&lt;p&gt;Last year, 3 years after JoKing issued the initial challenge I finally broke through and produced a working answer.  I'm not sure it's really even possible to have a true understanding of how this answer works.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/236630&quot;&gt;ais253's answer to High-throughput Fizz Buzz&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;(nominated by &lt;a href=&quot;https://codegolf.stackexchange.com/users/97857/pxeger&quot;&gt;pxeger&lt;/a&gt;)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is almost the obvious choice for this year: garnering 390 upvotes (at the time of writing, January 2022), and &lt;a href=&quot;https://news.ycombinator.com/item?id=29031488&quot; rel=&quot;nofollow noreferrer&quot;&gt;going viral on HackerNews&lt;/a&gt; (&lt;a href=&quot;https://news.ycombinator.com/item?id=29413656&quot; rel=&quot;nofollow noreferrer&quot;&gt;twice&lt;/a&gt;), &lt;a href=&quot;https://codegolf.stackexchange.com/questions/215216/high-throughput-fizz-buzz?answertab=votes#comment537574_236630&quot;&gt;ais253 himself described this post as harder than his Master's thesis&lt;/a&gt;. Some of the comments on HackerNews put it best:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Thanks for my daily dose of software engineer imposter syndrome.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Being able to write a function limited mostly by the l2 cache size and able to realize that is rad&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;At 1364 lines of x86 Assembly + &lt;a href=&quot;https://en.wikipedia.org/wiki/C_preprocessor&quot; rel=&quot;nofollow noreferrer&quot;&gt;cpp&lt;/a&gt;, this answer produces 56 GiB/s of FizzBuzz and is apparently bottle-necked almost entirely by writing its output. The code is so complex that its explanation had to be golfed to fit in StackExchange's 65,536 byte size limit for answers!&lt;/p&gt;&#xA;&lt;p&gt;Need I say more?&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/17216/deadcode&quot;&gt;Deadcode&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/223129/80214&quot;&gt;Match strings whose length is a fourth power&lt;/a&gt; in .NET Regex&lt;/h2&gt;&#xA;&lt;p&gt;From Deadcode's answer:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Not only does this outgolf primo's amazing answer, but it runs at very close to exactly the same speed under .NET's regex engine.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;With the help of some tricks from .NET Regex and countless iterations posted on the thread, Deadcode managed to beat primo's answer on the question, which had been standing as the shortest for 7 years.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/235298/80214&quot;&gt;Totally Cubular&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/87606/tjjfvi&quot;&gt;tjjfvi&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Totally Cubular was a question that was famously not answered for 4 years, until it was answered this year with a full Github repository with a solver created by tjjfvi. There is a fully specced solving method detailed on the answer, and I think you find it as cool as I did, because I cannot do justice to how well designed it is.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="80214" LastEditDate="2022-01-21T07:06:26.200" LastActivityDate="2022-01-21T07:06:26.200" CommentCount="4" CommunityOwnedDate="2022-01-20T10:39:18.387" ContentLicense="CC BY-SA 4.0" />
  <row Id="24335" PostTypeId="2" ParentId="24313" CreationDate="2022-01-20T10:40:40.970" Score="6" Body="&lt;h1&gt;Off the Charts&lt;/h1&gt;&#xA;&lt;p&gt;For an answer that has been proven to work correctly but can't realistically be run, for example because it would take an enourmous amount of time to execute.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/207558/print-x-without-x-cops-thread&quot;&gt;22 Vyxal answers to Print X Without X&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/101522/aaroneous-miller&quot;&gt;Aaroneous Miller&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresu A&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Partial self-nomination by Aaroneous Miller&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This chain began with emanresu A and Lyxal trading cops and cracks, with cracks initially being tens of thousands, and later hundreds of thousands of bytes. These programs are already somewhat unwieldy, but they were nothing compared to what was coming.&lt;/p&gt;&#xA;&lt;p&gt;For emanresu A's tenth cop, Lyxal's crack was upwards of 2 MB. After that, Lyxal took over posting the cops, and I joined the fun. We went back and forth a couple more times, and emanresu A posted a crack that exponentially grew in size to a total of 9942694705621871183448638796 bytes, or 9,942 Yottabytes.&lt;/p&gt;&#xA;&lt;p&gt;The next crack seemed like things would slow down, with a relatively short 2.5 MB, but it was followed by 29 Exabytes. After that, there were several more answers, whose bytecounts jumped around depending on whether or not the solution was exponential. There were a couple more answers in the Exabyte range, one unintentionally trivial answer, one unintentionally overcomplicated answer, a few nearly identical answers, and a Spamton joke, but every single one was on the scale of anywhere from millions of bytes to trillions of bytes, until I finally managed to find Lyxal's intended solution with a 5.2 Exabyte answer.&lt;/p&gt;&#xA;&lt;p&gt;All in all, none of the answers in the chain could be reasonably ran, but some were so large that even samples of the code could barely be ran, and just creating the solutions in the first place became difficult, with the biggest answer in the chain totaling over 1,500,000,000 times bigger than the internet.&lt;/p&gt;&#xA;&lt;h3&gt;Almost any answer by &lt;a href=&quot;https://codegolf.stackexchange.com/users/66833/caird-coinheringaahing&quot;&gt;caird coinheringaahing&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;This is what I think this category was looking for, rather than just a really long answer. Caird's Jelly answers have quite the variety of horrifyingly fast growing time complexities:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/218819/79857&quot;&gt;&lt;span class=&quot;math-container&quot;&gt;\$O({n^2}!)\$&lt;/span&gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/231318/79857&quot;&gt;&lt;span class=&quot;math-container&quot;&gt;\$O(n\cdot m\cdot (n\cdot m)!)\$&lt;/span&gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/219440/79857&quot;&gt;&lt;span class=&quot;math-container&quot;&gt;\$O(9^{n^2})\$&lt;/span&gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/226594/79857&quot;&gt;&lt;span class=&quot;math-container&quot;&gt;\$O(2^{n!})\$&lt;/span&gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229210/79857&quot;&gt;&lt;span class=&quot;math-container&quot;&gt;\$O(2^{\max(n,m)^2-x})\$&lt;/span&gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/229210/79857&quot;&gt;&lt;span class=&quot;math-container&quot;&gt;\$O(2^{2(n+m)+x})\$&lt;/span&gt;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Here are a couple of them graphed:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ehBy5.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ehBy5.png&quot; alt=&quot;Desmos&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;And if you think they don't look &lt;em&gt;too&lt;/em&gt; bad at that zoom:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Fwtso.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Fwtso.png&quot; alt=&quot;Desmos&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;(Red is &lt;span class=&quot;math-container&quot;&gt;\$O({n^2}!)\$&lt;/span&gt;, blue is &lt;span class=&quot;math-container&quot;&gt;\$O(9^{n^2})\$&lt;/span&gt;, green is &lt;span class=&quot;math-container&quot;&gt;\$O(2^{n!})\$&lt;/span&gt;)&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/240338/78410&quot;&gt;Largest SKI output in less than 200 combinators&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$ \approx f_{\omega+1}(3\uparrow\uparrow\uparrow\uparrow3) \$&lt;/span&gt; - The largest number I could create in an answer last year (and the largest number of mine across all years too). I had to pick this one to beat the other nominations in terms of the magnitude of the numbers involved. I didn't even know how to express the number until nph helped by invoking the &lt;a href=&quot;https://googology.fandom.com/wiki/Introduction_to_the_fast-growing_hierarchy&quot; rel=&quot;nofollow noreferrer&quot;&gt;fast-growing hierarchy&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="78410" LastEditDate="2022-02-04T01:15:01.317" LastActivityDate="2022-02-04T01:15:01.317" CommentCount="3" CommunityOwnedDate="2022-01-20T10:40:40.970" ContentLicense="CC BY-SA 4.0" />
  <row Id="24336" PostTypeId="2" ParentId="2140" CreationDate="2022-01-20T12:13:38.693" Score="3" Body="&lt;p&gt;&lt;strong&gt;Shanghai ascii game sticks&lt;/strong&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/path-finding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;path-finding&amp;#39;&quot; rel=&quot;tag&quot;&gt;path-finding&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/241708/84844&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="84844" LastEditorUserId="84844" LastEditDate="2022-01-24T17:01:34.597" LastActivityDate="2022-01-24T17:01:34.597" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24337" PostTypeId="2" ParentId="2140" CreationDate="2022-01-20T14:48:25.737" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/241474/66833&quot;&gt;Move to Right and left&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="106959" LastEditorUserId="66833" LastEditDate="2022-01-21T21:56:23.413" LastActivityDate="2022-01-21T21:56:23.413" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24339" PostTypeId="2" ParentId="2140" CreationDate="2022-01-21T09:18:36.780" Score="1" Body="&lt;h1&gt;Navigate the city&lt;/h1&gt;&#xA;&lt;p&gt;The government of your country has just completed a city designed to accommodate a few hundred thousand people. It has all sorts of facilities including roads, restaurants, malls, houses, etc. You have been invited to test the road system, but you are completely unfamiliar with it, so you need a GPS. Your challenge is to make one.&lt;/p&gt;&#xA;&lt;h2&gt;Description of the city&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;Note: when I say &amp;quot;a x a grid&amp;quot;, I mean that there are a horizontal roads and a vertical roads within the grid.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;To make the challenge easier (because of course making a GPS is difficult in itself), the city is fixed. The city's road system is based on a very rigid grid. This grid is pictured further below.&lt;/p&gt;&#xA;&lt;p&gt;The grid has a size of 15x15 and the roads are labeled as &lt;code&gt;[r/c num][dir]&lt;/code&gt; where &amp;quot;r/c num&amp;quot; is the row/column number (whether it is a row or column depends on the direction of the road) and &amp;quot;dir&amp;quot; is the direction. If the road runs from west to east, &amp;quot;dir&amp;quot; is E, and if it runs from north to south, &amp;quot;dir&amp;quot; is S. For instance, &amp;quot;1E&amp;quot; is the first row of the grid, while &amp;quot;12S&amp;quot; is the twelfth column of the grid. Each row and column of the grid has a length of 14km (1km between each intersection).&lt;/p&gt;&#xA;&lt;p&gt;The Central Business District (CBD) is the 5x5 sub-grid situated in the middle of the grid. Due to the traffic parameters set below, it is important for your GPS to route the user away from the CBD if it is not necessary to pass through that district. Note that the CBD includes the borders of the 5x5 sub-grid.&lt;/p&gt;&#xA;&lt;p&gt;At each intersection, there is a traffic light. The amount of time to wait is as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;there is a &amp;quot;base time&amp;quot; which is 400 if the intersection is in the CBD, and is the row position of the intersection (row 1 column 2 would be the intersection between 1E and 2S) times the column position otherwise;&lt;/li&gt;&#xA;&lt;li&gt;the waiting time to turn left is equal to the base time;&lt;/li&gt;&#xA;&lt;li&gt;the waiting time to go straight is equal to the base time, multiplied by 2;&lt;/li&gt;&#xA;&lt;li&gt;the waiting time to turn right is equal to the base time, multiplied by 3.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The times above are measured in seconds.&lt;/p&gt;&#xA;&lt;p&gt;In addition to the standard grid of roads, there is an expressway circling the inner part of the city. It passes directly over parts of the 4E, 4S, 12E and 12S roads in such a way that it forms a square. In both directions, there is an innovative exit/entry elevator at each place where there would be an intersection if you took the 4E, 4S, 12E or 12S road rather than the expressway. It is positioned in such a way that you can skip the traffic light for that intersection and get going, and in addition to that you can turn your car around in whichever direction you would like and go that way. I know it sounds rather confusing, but in essence you can exit at any intersection and go whichever way you wish, with the distances still being measured in kilometers in all cases. Note that the elevator is instantaneous (once again, not very realistic, but who uses elevators for cars on the main road anyway?). Upon entering the expressway, you can go in either direction. On the expressway, there are no at-grade intersections, so the traffic is free-flowing, and there are no waits at traffic lights or any other obstruction. Entry onto the expressway is done at any intersection involving the 4E, 4S, 12E or 12S road. Cars entering the expressway do not need to wait at a traffic light before doing so. Once again, the way in which the entry elevator is designed ensures that all distances are still measured in kilometers. This means that you can drive 1km from an intersection, enter the expressway there, and drive 3km on the expressway, with the total distance being 4km.&lt;/p&gt;&#xA;&lt;p&gt;The city sets speed limits as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;30 for all roads within the CBD;&lt;/li&gt;&#xA;&lt;li&gt;60 for all standard roads outside the CBD;&lt;/li&gt;&#xA;&lt;li&gt;120 for the expressway.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;These speeds are measured in kilometers per hour.&lt;/p&gt;&#xA;&lt;h2&gt;Picture of the grid&lt;/h2&gt;&#xA;&lt;p&gt;Everything inside, and including, the bold black outline, is the Central Business District. The blue outline represents the expressway.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/222XW.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/222XW.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a GPS which takes in a start intersection and end intersection, and attempts to output the fastest route from the start to the end. The &amp;quot;intersection&amp;quot; must be an intersection between two roads and can be specified in whichever reasonable input format you would like. You could take the row and column, the names of the two roads, etc. as long as it's reasonable.&lt;/p&gt;&#xA;&lt;p&gt;Your output should be a list of directions in whichever reasonable output format you would like. Each direction should specify the direction to turn (straight, left, right, and for the expressway, enter/exit), the road to turn on and the number of &amp;quot;kilometers after the previous direction&amp;quot; to wait before executing this direction. For instance, &amp;quot;After 7km, exit the expressway onto 12E (East)&amp;quot;. If the direction is to be executed while on the expressway, it must not take intersections into account. Your program may optionally decide to omit directions telling the user to &amp;quot;continue straight&amp;quot;, but it may not omit any other direction. As shown above, directions telling the user to enter or exit an expressway must specify the direction to head upon entry (&amp;quot;enter the expressway (South)&amp;quot;, for instance). You may direct the user in any direction from the starting intersection, and arrive at the end intersection from any side. It should also tell the user for how long he or she will have to drive, down to the second, and, optionally, the distance he or she will have to drive, which is necessarily measured in kilometers.&lt;/p&gt;&#xA;&lt;p&gt;Your GPS may assume that the user will always be driving at the speed limit. It may also assume that the start and end are different.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;There are 225 x 224 = 50400 ways to choose start/end pairs. Your GPS will be scored based on the sum of the amounts of time it takes to drive from the start to the end, for each pair of start/end points. The GPS with the smallest total is the winner.&lt;/p&gt;&#xA;&lt;p&gt;In the unlikely event of a tie between two or more submissions, length of code shall be the tiebreaker.&lt;/p&gt;&#xA;&lt;p&gt;No test cases because there is never a single route for any start/end pair.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;The tags for this challenge are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/path-finding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;path-finding&amp;#39;&quot; rel=&quot;tag&quot;&gt;path-finding&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="106710" LastEditorUserId="106710" LastEditDate="2022-01-21T14:15:42.273" LastActivityDate="2022-01-21T14:15:42.273" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24340" PostTypeId="2" ParentId="2140" CreationDate="2022-01-21T17:59:38.060" Score="-2" Body="&lt;h1&gt;TDG - Test Driven Golf&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Our company requires unit testing before code can be deployed to production. Unfortunately, my code is written in esoteric programming languages, none of which have test runners.&lt;/p&gt;&#xA;&lt;p&gt;Please help me get to production!&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a test runner for a programming language (here after called Language X) that takes Language X source code and Language X test cases then outputs the results of running the test cases.&lt;/p&gt;&#xA;&lt;p&gt;NOTE: The language used to write the test runner does not necessarily have to be Language X.&lt;/p&gt;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;The runner should take in:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Code written in Language X&lt;/li&gt;&#xA;&lt;li&gt;Test cases written in Language X&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;The runner should produce:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;At least a list of test cases. For each test case, include:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The test case name&lt;/li&gt;&#xA;&lt;li&gt;A &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2190/interpretation-of-truthy-falsey&quot;&gt;Truthy value&lt;/a&gt; if the code executes without errors and no assertions failed&lt;/li&gt;&#xA;&lt;li&gt;A &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2190/interpretation-of-truthy-falsey&quot;&gt;Falsey value&lt;/a&gt; if the code errors or an assertion failed&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Test Runner&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The test runner can be written in any language. The only constraint is that the source and test code language be the same&lt;/li&gt;&#xA;&lt;li&gt;Each test runner must at least provide a helper/utility/function to assert that a value is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2190/interpretation-of-truthy-falsey&quot;&gt;truthy&lt;/a&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;Assert.True(false)&lt;/code&gt; =&amp;gt; Fails test&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;assertTrue(1 == 3)&lt;/code&gt; =&amp;gt; Fails test&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;is_truthy 1&lt;/code&gt; =&amp;gt; Doesn't fail&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;[[ &amp;quot;a&amp;quot; = &amp;quot;a&amp;quot; ]]&lt;/code&gt; =&amp;gt; Doesn't fail&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each test case must have a name/be name-able&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;it(&amp;quot;does stuff&amp;quot;, _ =&amp;gt; ...)&lt;/code&gt; =&amp;gt; it does stuff&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;it_does_stuff = _ =&amp;gt; ...&lt;/code&gt; =&amp;gt; it_does_stuff&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;func ItDoesStuff() {...}&lt;/code&gt; =&amp;gt; ItDoesStuff&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;A code block of language X code&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Submissions&lt;/h3&gt;&#xA;&lt;p&gt;For consistency, here are some recommendations:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Title should be: &lt;code&gt;# Language X runner written in Language Y&lt;/code&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Where Language X is the source and test code language&lt;/li&gt;&#xA;&lt;li&gt;And Language Y is the language the runner is written in&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Runner code in a &lt;code&gt;## Runner&lt;/code&gt; section&lt;/li&gt;&#xA;&lt;li&gt;Example input source code in a &lt;code&gt;## Example Source&lt;/code&gt; section&lt;/li&gt;&#xA;&lt;li&gt;Example input test code in a &lt;code&gt;## Example Tests&lt;/code&gt; section&lt;/li&gt;&#xA;&lt;li&gt;Example output in a &lt;code&gt;## Example Output&lt;/code&gt; section&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this challenge too board?&lt;/li&gt;&#xA;&lt;li&gt;Is this challenge too big?&lt;/li&gt;&#xA;&lt;li&gt;I've created some basic test runners in a single file before and with some elbow grease, I think you could say small (submit-able on CGCC) and add a few nice things&lt;/li&gt;&#xA;&lt;li&gt;Does &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt; fit here?&lt;/li&gt;&#xA;&lt;li&gt;Is there room for creativity?&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The testing syntax and features for the test cases are left up to the implementation&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How golf-able the test syntax is&lt;/li&gt;&#xA;&lt;li&gt;How the code and test cases interact&lt;/li&gt;&#xA;&lt;li&gt;What asserts/helpers are provided&lt;/li&gt;&#xA;&lt;li&gt;Syntax for skipping test cases&lt;/li&gt;&#xA;&lt;li&gt;Syntax for beforeEach/afterEach&lt;/li&gt;&#xA;&lt;li&gt;Harder features like parameterized tests and fixtures are possible&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Similarly, the features for the test runner are left pretty open&#xA;ended&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://testanything.org/producers.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;TAP&lt;/a&gt; output&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://stackoverflow.com/a/4926073/4769802&quot;&gt;JUnit&lt;/a&gt; output&lt;/li&gt;&#xA;&lt;li&gt;Test isolation and parallelization&lt;/li&gt;&#xA;&lt;li&gt;Harder features like specific failure messages and code coverage aren't &lt;em&gt;impossible&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="43214" LastEditorUserId="43214" LastEditDate="2022-01-22T02:46:35.703" LastActivityDate="2022-01-22T02:46:35.703" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24342" PostTypeId="2" ParentId="2140" CreationDate="2022-01-22T14:44:58.387" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241749/trap-the-hero-in-a-maze&quot;&gt;Trap the hero in a maze&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-01-26T06:56:49.687" LastActivityDate="2022-01-26T06:56:49.687" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24343" PostTypeId="1" AcceptedAnswerId="24344" CreationDate="2022-01-22T18:12:45.273" Score="-1" ViewCount="91" Body="&lt;p&gt;For example, if an answer takes an existing brainfuck answer and rewrites it in another language like &lt;a href=&quot;https://esolangs.org/wiki/Ook!&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ook!&lt;/a&gt; which is the same underlying language with different symbols.&lt;span class=&quot;math-container&quot;&gt;\$^1\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;What I should do if there is a translated Copy answer, Should I flag?&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;1&lt;/sub&gt; &lt;sub&gt;Only Language derivatives&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="106959" LastEditorUserId="56656" LastEditDate="2022-01-22T18:16:03.867" LastActivityDate="2022-01-22T18:16:03.867" Title="What if someone posts a translated answer of another Answer?" Tags="|discussion|flags|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24344" PostTypeId="2" ParentId="24343" CreationDate="2022-01-22T18:14:24.210" Score="8" Body="&lt;p&gt;If you think it is low-effort and low-quality, downvote it. That's what downvotes are for.&lt;/p&gt;&#xA;&lt;p&gt;We allow duplicate answers on CGCC even in the same language with identical code, so this isn't against our rules.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2022-01-22T18:14:24.210" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24345" PostTypeId="2" ParentId="2140" CreationDate="2022-01-22T20:51:10.737" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241627/only-one-from-each-set&quot;&gt;Only one from each set&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-01-23T10:42:10.873" LastActivityDate="2022-01-23T10:42:10.873" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24346" PostTypeId="2" ParentId="2140" CreationDate="2022-01-22T22:05:20.117" Score="2" Body="&lt;h1&gt;Von Neumann Probe Battle (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;)&lt;/h1&gt;&#xA;&lt;hr/&gt;&#xA;&lt;p&gt;This is just an idea for now, placing it here as a draft and to collect feedback.&lt;/p&gt;&#xA;&lt;p&gt;Basically, your goal would be to design a set of machines, including factories and spacecraft, which start on earth and spread outward into the universe. You'd be able to design these machines. Not just their code, but the parts that make them up.&lt;/p&gt;&#xA;&lt;p&gt;For example, you could start on earth with a single factory, which would make a swarm of mining bots. These would bring ore to the surface, and the factory would switch to making spacecraft. Once the spacecraft are built, the factory could assemble all of the parts needed to make an identical factory, load them onto the spacecraft, and send them to the moon. Then, both factories would start the process over.&lt;/p&gt;&#xA;&lt;p&gt;The ultimate goal would be to build &amp;quot;stamps&amp;quot;, which cost a small amount of iron, and then vanish from existence. These are used for scoring.&lt;/p&gt;&#xA;&lt;p&gt;This challenge might not be very practical, due to the issues involved in simulating a detailed and exponentially increasing swarm of robots in a vast universe.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-01-22T22:05:20.117" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24347" PostTypeId="2" ParentId="2140" CreationDate="2022-01-22T22:23:42.570" Score="-3" Body="&lt;h1&gt;Who Loses The number guessing game?&lt;/h1&gt;&#xA;&lt;p&gt;You are playing a number guessing game. You know everyone's guesses, and who won, and want to figure out who was in last place.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Your task is to take a dictionary of guesses as input, along with the name of the winner. You should then return the name of the player whose guess was the farthest from the winner's, or if there are multiple, the lowest.&lt;/p&gt;&#xA;&lt;p&gt;A input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[{&amp;quot;Joe&amp;quot;: 800, &amp;quot;Mama&amp;quot;: 1000, &amp;quot;Biden&amp;quot;: 1200}, &amp;quot;Joe&amp;quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Means that the aproxximate score winner is Joe, The next is Mama, Mama is greater than Joe and Mama is greater than Biden.&lt;/p&gt;&#xA;&lt;p&gt;So the loser is Biden.&lt;/p&gt;&#xA;&lt;p&gt;All guesses are guaranteed to be unique&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;[{&amp;quot;A&amp;quot;: 100, &amp;quot;B&amp;quot;: 200, &amp;quot;C&amp;quot;: 300}, &amp;quot;A&amp;quot;] =&amp;gt; &amp;quot;C&amp;quot;&#xA;[{&amp;quot;Hello&amp;quot;: 200, &amp;quot;World&amp;quot;: 201}, &amp;quot;World&amp;quot;] =&amp;gt; &amp;quot;Hello&amp;quot;&#xA;[{&amp;quot;Blah&amp;quot;: 210, &amp;quot;Bruh&amp;quot;: 984, &amp;quot;Boo&amp;quot;: 314}, &amp;quot;Boo&amp;quot;] =&amp;gt; &amp;quot;Bruh&amp;quot;&#xA;[{&amp;quot;A&amp;quot;: 6, &amp;quot;B&amp;quot;: 7, &amp;quot;C&amp;quot;: 666, &amp;quot;D&amp;quot;: 1000}, &amp;quot;C&amp;quot;] =&amp;gt; &amp;quot;A&amp;quot;&#xA;[{&amp;quot;AC&amp;quot;: 100, &amp;quot;BE&amp;quot;: 200, &amp;quot;CE&amp;quot;: 300}, &amp;quot;B&amp;quot;] =&amp;gt; &amp;quot;CE&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Any feedback?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Dupe?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="106959" LastEditorUserId="106959" LastEditDate="2022-01-22T23:13:13.440" LastActivityDate="2022-01-22T23:13:13.440" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24350" PostTypeId="2" ParentId="2140" CreationDate="2022-01-23T16:47:44.483" Score="-3" Body="&lt;h1&gt;Convert decimal to unary in fewest regex codes &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/regular-expression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;regular-expression&amp;#39;&quot; rel=&quot;tag&quot;&gt;regular-expression&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to Convert decimal to undary in fewest regex codes&lt;/p&gt;&#xA;&lt;p&gt;Every regex code is substitution mode.&lt;/p&gt;&#xA;&lt;p&gt;The regex code counts the regex code, without test string and Substitution code&lt;/p&gt;&#xA;&lt;p&gt;A example&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;^2, |11&#xA;^3, |111&#xA;^4, |1111&#xA;...&#xA;\|, &amp;lt;empty&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This scores infinity, But don't try this.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Your score is always non-infinity&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Any flavor is allowed.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your score is the number of regex codes&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;every length of regex code is non-infinite&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="106959" LastEditorUserId="106959" LastEditDate="2022-01-25T16:09:59.850" LastActivityDate="2022-01-25T16:09:59.850" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24351" PostTypeId="2" ParentId="5318" CreationDate="2022-01-23T22:23:06.527" Score="7" Body="&lt;h1&gt;Papers or technical documents originated by a challenge&lt;/h1&gt;&#xA;&lt;p&gt;This includes papers or documents about problems proposed in a PPCG challenge, or directly derived from it.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://londmathsoc.onlinelibrary.wiley.com/doi/full/10.1112/mtk.12223&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;On the number of tiles visited by a line segment on a rectangular grid&lt;/em&gt;&lt;/a&gt; (&lt;em&gt;Mathematika&lt;/em&gt;, vol. 69, no. 4, October 2023), by &lt;a href=&quot;https://codegolf.stackexchange.com/users/20260/xnor&quot;&gt;xnor&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/users/36398/luis-mendo&quot;&gt;Luis Mendo&lt;/a&gt;. Originated from &lt;a href=&quot;https://codegolf.stackexchange.com/questions/231176/maximum-number-of-squares-touched-by-a-line-segment&quot;&gt;this challenge&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2023-10-19T22:57:12.493" LastActivityDate="2023-10-19T22:57:12.493" CommentCount="0" CommunityOwnedDate="2022-01-25T00:19:48.483" ContentLicense="CC BY-SA 4.0" />
  <row Id="24352" PostTypeId="2" ParentId="2140" CreationDate="2022-01-24T07:48:20.150" Score="0" Body="&lt;h1&gt;Deterministic oozes&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Task&lt;/h3&gt;&#xA;&lt;p&gt;Output the next generation of the input.&lt;/p&gt;&#xA;&lt;p&gt;These conversions happen if there is food &lt;code&gt;.&lt;/code&gt; or &lt;code&gt;:&lt;/code&gt; next to them:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;o&amp;quot; → &amp;quot;O&amp;quot;&#xA;&amp;quot;O&amp;quot; → &amp;quot;8&amp;quot;&#xA;&amp;quot;8&amp;quot; → &amp;quot;oo&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;^ These are called oozes.&lt;/p&gt;&#xA;&lt;h3&gt;Rules for eating&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The food should disappear if it gets eaten.&lt;/li&gt;&#xA;&lt;li&gt;If there is a single food &lt;code&gt;.&lt;/code&gt;, with oozes on both sides, the left one eats it.&lt;/li&gt;&#xA;&lt;li&gt;If there is a double food &lt;code&gt;:&lt;/code&gt;, with oozes on both sides, both eat one.&lt;/li&gt;&#xA;&lt;li&gt;If there is a double food &lt;code&gt;:&lt;/code&gt; with only one ooz beside it, the ooz eats the entire food and advances 2 generations.&lt;/li&gt;&#xA;&lt;li&gt;A food with no oozes on the either side, stays the same.&lt;/li&gt;&#xA;&lt;li&gt;Spaces between oozes should be preserved.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;p&gt;Number of bytes, shortest code wins!&lt;/p&gt;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;o. o&amp;quot; → &amp;quot;O o&amp;quot;&#xA;&amp;quot;oooo.8&amp;quot; → &amp;quot;oooO8&amp;quot;&#xA;&amp;quot;8:8&amp;quot; → &amp;quot;oooo&amp;quot;&#xA;&amp;quot;:8&amp;quot; → &amp;quot;Oo&amp;quot;&#xA;&amp;quot;8:&amp;quot; → &amp;quot;oO&amp;quot;&#xA;&amp;quot;o:o.o&amp;quot; → &amp;quot;O8o&amp;quot;&#xA;&amp;quot;ooo&amp;quot; → &amp;quot;ooo&amp;quot;&#xA;&amp;quot;o.o.o&amp;quot; → &amp;quot;OOo&amp;quot;&#xA;&amp;quot;o:8:o&amp;quot; → &amp;quot;OoOO&amp;quot;&#xA;&amp;quot; .  o o 8.&amp;quot; → &amp;quot; .  o o oo&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Meta:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Tags?&lt;/li&gt;&#xA;&lt;li&gt;Clear?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="103854" LastEditorUserId="103854" LastEditDate="2022-03-23T09:20:38.250" LastActivityDate="2022-03-23T09:20:38.250" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="24353" PostTypeId="2" ParentId="2140" CreationDate="2022-01-24T17:52:17.127" Score="0" Body="&lt;h1&gt;Approximate Euler's Number&lt;/h1&gt;&#xA;&lt;p&gt;Euler's number (e) is one of the most well-known mathematical constants, with a simple way to approximate it. All you have to do is repeatedly generate a random number between 0 and 1, and add it to an accumulator. Record how many times you have to do this for the accumulator to exceed 1. If you do this over and over again, the average of all the times it takes will approximate Euler's number.&lt;/p&gt;&#xA;&lt;h2&gt;Your task&lt;/h2&gt;&#xA;&lt;p&gt;Write a program that, given a number of iterations as input, approximates Euler's number using the above method and prints the result.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;This is code-golf, so shortest answer wins. However, if the language you are using does not include a random number builtin, you may exclude from your byte count the code required to import it. For example, if you're writing a Python program to do this, you may assume the &lt;code&gt;random&lt;/code&gt; module is already imported.&lt;/p&gt;&#xA;&lt;h2&gt;Example implementation (ungolfed)&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;import random&#xA;acc = 0&#xA;res = []&#xA;for x in range(int(input())):&#xA;    while acc &amp;lt; 1:&#xA;        acc += random.random()&#xA;    res.append(acc)&#xA;    acc = 0&#xA;total = 0&#xA;for x in res:&#xA;    total += x&#xA;print(total / len(res))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2022-01-24T18:02:59.743" LastActivityDate="2022-01-24T18:02:59.743" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24354" PostTypeId="2" ParentId="5243" CreationDate="2022-01-24T17:54:31.947" Score="12" Body="&lt;h1&gt;Absurd thematic challenges&lt;/h1&gt;&#xA;&lt;p&gt;These can only be claimed once each, first come first serve. I will answer any clarifying questions for any challenge given below if needed.&lt;/p&gt;&#xA;&lt;h3&gt;500 rep for answering &lt;a href=&quot;https://codegolf.stackexchange.com/questions/156967/non-discriminating-programming&quot;&gt;Non-discriminating Programming&lt;/a&gt; in &lt;a href=&quot;https://esolangs.org/wiki/Incident&quot; rel=&quot;nofollow noreferrer&quot;&gt;Incident&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;No twist.&lt;/p&gt;&#xA;&lt;h3&gt;500 rep for answering &lt;a href=&quot;https://codegolf.stackexchange.com/q/250556/107310&quot;&gt;Transform characters of your choice into &amp;quot;Hello, world!&amp;quot;&lt;/a&gt;... as a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-validating&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-validating&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;self-validating&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-self-validating-tooltip-container&quot;&gt;self-validating&lt;/a&gt; challenge.&lt;/h3&gt;&#xA;&lt;p&gt;This challenge asks you to write a program or function which takes a printable ASCII character as input and outputs a printable ASCII character. It also asks you to choose a string of 13 &lt;em&gt;distinct&lt;/em&gt; printable ASCII characters which, when input into your program/function, output the characters of &lt;code&gt;Hello, world!&lt;/code&gt;. To claim this bounty, those two strings must be one in the same. To make this more feasible, character order does not matter. So for example: If your program is &lt;code&gt;abcdefghijklm&lt;/code&gt; and inputting the characters in the order &lt;code&gt;mlkjihgfedcba&lt;/code&gt; gives &lt;code&gt;Hello, world!&lt;/code&gt;, you will be awarded this bounty.&lt;/p&gt;&#xA;&lt;h3&gt;500 rep for answering &lt;a href=&quot;https://codegolf.stackexchange.com/questions/241584/is-this-hexagon-symmetric&quot;&gt;Is this hexagon symmetric?&lt;/a&gt; in &lt;a href=&quot;https://github.com/m-ender/hexagony&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hexagony&lt;/a&gt;... with symmetric source code&lt;/h3&gt;&#xA;&lt;p&gt;&amp;quot;Symmetric source code&amp;quot; here is defined roughly as follows: replace all the nops in your program with 0s, and all the non-nops in your programs with 1s. When this string of 0s and 1s is input into your program as a hexagon, it should accept it as symmetric. You don't have to use specifically 0s and 1s, just two different values, or however you take input to your program.&lt;/p&gt;&#xA;&lt;h3&gt;500 rep for answering &lt;a href=&quot;https://codegolf.stackexchange.com/questions/153315/solve-a-rubiks-cube&quot;&gt;Solve a Rubik's Cube&lt;/a&gt; in &lt;a href=&quot;https://github.com/tobyck/cubestack&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cubestack&lt;/a&gt;... with the final state of the &lt;a href=&quot;https://cubestack.surge.sh/&quot; rel=&quot;nofollow noreferrer&quot;&gt;cube&lt;/a&gt; being solved&lt;/h3&gt;&#xA;&lt;p&gt;Instructions in this language correspond to moves on a Rubik's cube. Your program should correspond to movements on a cube which leave it solved. You can check the cube's halt state with the &lt;a href=&quot;https://cubestack.surge.sh/&quot; rel=&quot;nofollow noreferrer&quot;&gt;official online interpreter&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;500 rep for solving &lt;a href=&quot;https://codegolf.stackexchange.com/q/248047/107310&quot;&gt;But is it a pretty place?&lt;/a&gt; in &lt;a href=&quot;https://github.com/chunkybanana/positionally/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Positionally&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;Again, no extra twist, this is hard enough as is :P &lt;a href=&quot;https://dso.surge.sh/#positionally&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here's the interpreter&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;500 rep from @CommandMaster for solving &lt;a href=&quot;https://codegolf.stackexchange.com/q/265852/92727&quot;&gt;Golf a LaTeΧ math expression&lt;/a&gt; in TeX&lt;/h3&gt;&#xA;&lt;p&gt;No twist. Feel free to use any common TeX variants or packages, but the computation has to be done in TeX - you can't use a package which lets you, for example, execute Python, and solve the problem in Python.&lt;/p&gt;&#xA;" OwnerUserId="107310" LastEditorUserId="92727" LastEditDate="2023-10-19T15:01:00.337" LastActivityDate="2023-10-19T15:01:00.337" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24355" PostTypeId="2" ParentId="2140" CreationDate="2022-01-24T20:34:55.177" Score="1" Body="&lt;h1&gt;Play chess (KOTH)&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to write a chess engine that will compete with other submissions in a chess tournament. Well, almost. Since writing a full engine can be a bit tedious, you only need to write the evaluation function.&lt;/p&gt;&#xA;&lt;p&gt;An evaluation function takes a chessboard as input and returns how &amp;quot;favorable&amp;quot; the position is. If white is winning, the evaluation function should return a large positive number. If black is winning, a large negative number. If the situation is tied, a number close to zero.&lt;/p&gt;&#xA;&lt;p&gt;Chess engines then simulate different possible games to some depth and choose the moves that lead to the best result.&lt;/p&gt;&#xA;&lt;p&gt;A classic evaluation function is as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Set r=0&lt;/li&gt;&#xA;&lt;li&gt;For every white pawn, add 1. For every black pawn, subtract 1.&lt;/li&gt;&#xA;&lt;li&gt;Same for knights and bishops, except add or subtract 3.&lt;/li&gt;&#xA;&lt;li&gt;For rooks, use 5&lt;/li&gt;&#xA;&lt;li&gt;And for queens, use 9&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This evaluation function only takes into account material advantage; that is, just the raw amount of different pieces. More complicated evaluation functions may consider the position of individual pieces, what kind of structures do the pawns form etc.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to write an evaluation function in C in at most 150 bytes. The evaluation function takes as input 7 bitboards. A bitboard is a 64-bit integer that assigns one bit to every square of the chessboard. The first bitboard has a bit set for every piece in the chessboard. The second one encodes the owner of the piece. The remaining bitboards have a bit set for every pawn, knight, bishop, rook and queen respectively. There is no bitboard for the king, since you can calculate it using the first and last 5 bitboards. Your function will return a signed integer.&lt;/p&gt;&#xA;&lt;p&gt;For your convenience, I've aliased &lt;code&gt;__builtin__popcount&lt;/code&gt; to &lt;code&gt;p&lt;/code&gt; and &lt;code&gt;uint64_t&lt;/code&gt; to &lt;code&gt;q&lt;/code&gt;, and also included every standard header. You should name your function &lt;code&gt;e&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Note that a slow evaluation function means that the engine won't be able to search as deep as with a fast one.&lt;/p&gt;&#xA;&lt;h1&gt;TODO: more details... and also write the engine&lt;/h1&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is 150 bytes a good number?&lt;/li&gt;&#xA;&lt;li&gt;Almost tempted to not alias the popcount... would have interesting results&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-01-24T21:04:53.890" LastActivityDate="2022-01-24T21:04:53.890" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24356" PostTypeId="2" ParentId="2140" CreationDate="2022-01-24T20:43:34.263" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241889/score-a-scrabble-play&quot;&gt;Score a Scrabble Play&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="67809" LastEditorUserId="67809" LastEditDate="2022-01-27T21:36:56.663" LastActivityDate="2022-01-27T21:36:56.663" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24357" PostTypeId="2" ParentId="2140" CreationDate="2022-01-24T23:39:02.827" Score="2" Body="&lt;h1&gt;Pretty print my arrays&lt;/h1&gt;&#xA;&lt;p&gt;I &lt;a href=&quot;https://codegolf.stackexchange.com/questions/241650/sort-every-dimension&quot;&gt;like&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/233030/build-me-a-room&quot;&gt;to&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/236884/remove-submatrices&quot;&gt;pretty print&lt;/a&gt; multidimensional arrays, like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[ [ [1, 2, 3],&#xA;    [4, 5, 6] ],&#xA;  [ [7, 8, 9],&#xA;    [6, 4, 2] ] ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;But it's a pain to do by hand and it'd be nice to have a program that does this for me. Your challenge is to create a program that does this for me, taking a multidimensional array containing only numbers and prettyprinting it.&lt;/p&gt;&#xA;&lt;p&gt;Specifically, an array of depth 1 is printed joined by &lt;code&gt;, &lt;/code&gt; with &lt;code&gt;[&lt;/code&gt; prepended and &lt;code&gt;]&lt;/code&gt; appended:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1, 2, 3]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;An array of depth &lt;span class=&quot;math-container&quot;&gt;\$n+1\$&lt;/span&gt;, which contains at least one array of depth &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, has its subarrays prettyprinted, joined by newlines and indented by two spaces. All but the last subarray have a comma appended, the last has &lt;code&gt; ]&lt;/code&gt; appended, and the first has its first line indented with &lt;code&gt;[ &lt;/code&gt; instead of two spaces:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/YoEb4.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/YoEb4.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Here's a reference implementation:&lt;/p&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;true&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code snippet-currently-hidden&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;function recursivePrettyPrint(array){&#xA;  if(array.every(x =&amp;gt; typeof x == &quot;number&quot;)){&#xA;    return `[${array.join(', ')}]`;&#xA;  } else {&#xA;    return array.map((item, index) =&amp;gt; {&#xA;      let result = recursivePrettyPrint(item) + ',';&#xA;      result = result.split`\n`;&#xA;      if(index == 0){&#xA;        result[0] = '[ ' + result[0];&#xA;      } else {&#xA;        result[0] = '  ' + result[0];&#xA;      }&#xA;      for(let i = 1; i &amp;lt; result.length; i++){&#xA;        result[i] = '  ' + result[i]&#xA;      }&#xA;      return result.join('\n');&#xA;    }).join('\n').slice(0,-1) + ' ]';&#xA;  }&#xA;}&#xA;&#xA;function change(){&#xA;  let array = JSON.parse(document.getElementById('input').value);&#xA;  let output = document.getElementById('output');&#xA;  output.innerText = recursivePrettyPrint(array);&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;textarea id=input&amp;gt;&amp;lt;/textarea&amp;gt;&#xA;&#xA;&amp;lt;button id=run onclick=change()&amp;gt;Pretty Print&amp;lt;/button&amp;gt;&#xA;&#xA;&amp;lt;pre id=output&amp;gt;&amp;lt;/pre&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&lt;p&gt;Numbers may be multiple digits. The input will always be orthogonal/rectangular, and you may take its dimensions as well.&lt;/p&gt;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[892, 759], [962, 251]] -&amp;gt;&#xA;[ [892, 759],&#xA;  [962, 251] ]&#xA;&#xA;[118, 922, 619] -&amp;gt;&#xA;[118, 922, 619]&#xA;&#xA;[[966, 639, 616, 255], [622, 483, 87, 241], [453, 870, 728, 725], [163, 936, 48, 967], [261, 833, 87, 200]] -&amp;gt; &#xA;[ [966, 639, 616, 255],&#xA;  [622, 483, 87, 241],&#xA;  [453, 870, 728, 725],&#xA;  [163, 936, 48, 967],&#xA;  [261, 833, 87, 200] ]&#xA;&#xA;[[[[[912, 547], [366, 754]], [[723, 536], [779, 238]]], [[[559, 392], [602, 709]], [[692, 915], [412, 302]]]], [[[[3, 504], [936, 83]], [[352, 442], [425, 375]]], [[[380, 440], [793, 762]], [[850, 321], [780, 457]]]]] -&amp;gt;&#xA;[ [ [ [ [912, 547],&#xA;        [366, 754] ],&#xA;      [ [723, 536],&#xA;        [779, 238] ] ],&#xA;    [ [ [559, 392],&#xA;        [602, 709] ],&#xA;      [ [692, 915],&#xA;        [412, 302] ] ] ],&#xA;  [ [ [ [3, 504],&#xA;        [936, 83] ],&#xA;      [ [352, 442],&#xA;        [425, 375] ] ],&#xA;    [ [ [380, 440],&#xA;        [793, 762] ],&#xA;      [ [850, 321],&#xA;        [780, 457] ] ] ] ]&#xA;&#xA;[[[128, 910, 664, 658], [172, 238, 564, 492], [325, 384, 566, 90]], [[876, 819, 764, 105], [583, 528, 731, 839], [480, 126, 692, 875]], [[215, 84, 268, 504], [400, 674, 997, 526], [799, 692, 193, 296]], [[943, 185, 567, 188], [118, 200, 879, 409], [116, 493, 62, 343]]] -&amp;gt; &#xA;[ [ [128, 910, 664, 658],&#xA;    [172, 238, 564, 492],&#xA;    [325, 384, 566, 90] ],&#xA;  [ [876, 819, 764, 105],&#xA;    [583, 528, 731, 839],&#xA;    [480, 126, 692, 875] ],&#xA;  [ [215, 84, 268, 504],&#xA;    [400, 674, 997, 526],&#xA;    [799, 692, 193, 296] ],&#xA;  [ [943, 185, 567, 188],&#xA;    [118, 200, 879, 409],&#xA;    [116, 493, 62, 343] ] ]&#xA;&lt;span class=&quot;math-container&quot;&gt;```&lt;/span&gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-01-24T23:46:28.457" LastActivityDate="2022-01-24T23:46:28.457" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24358" PostTypeId="2" ParentId="5243" CreationDate="2022-01-25T01:45:44.127" Score="4" Body="&lt;h1&gt;500-2500 reputation for a non-trivial answer to &lt;a href=&quot;https://codegolf.stackexchange.com/q/211839/66833&quot;&gt;Pristine Polyglots&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The current - and only - answer is fairly trivial, exploiting the fact that multiple shell languages have almost identical behaviour for the &lt;code&gt;echo&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I offer 500 reputation for an answer that uses 3 or more different languages such that each program in each language is non-trivial (i.e each program consists of different commands)&lt;sup&gt;*&lt;/sup&gt;. Additionally, I will offer an additional 500 reputation if each answer provides a distinct, non-trivial output, and a further 500 reputation if this (that is, a program that qualifies for 1000 rep) can be extended to 7 or more languages.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;*&lt;/sup&gt;: Ultimately, &amp;quot;non-trivial&amp;quot; is a subjective quantifier. However, in this context, my judgement will qualify an answer, and a valid answer will consist of a program that is pristine in each language such that any given command in the program is likely to perform a different function in each language, but overall, the function should be the same for every language.&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, I'm willing to increase the bounty amount by either 500 or 1000 reputation, depending on how impressive I find the answer.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;To claim the bounty, don't worry about notifying me - I should receive the notification when you answer. If the bounty hasn't been set within a week of your answer, leave a comment, or ping me in chat.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2022-02-09T18:44:21.723" LastActivityDate="2022-02-09T18:44:21.723" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24359" PostTypeId="2" ParentId="2140" CreationDate="2022-01-25T13:21:09.973" Score="1" Body="&lt;h1&gt;Count the ways to transform (2)&lt;/h1&gt;&#xA;&lt;p&gt;Your input is a matrix (2d array) of positive integers. For example:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\begin{matrix}&#xA;1 &amp;amp; 1 &amp;amp; 4 &amp;amp; 7\\&#xA;1 &amp;amp; 3 &amp;amp; 5 &amp;amp; 6\\&#xA;2 &amp;amp; 1 &amp;amp; 4 &amp;amp; 5 \\&#xA;\end{matrix}&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;A semi-continuous transformation of this matrix is a rearranging of elements that preserves immediate neighbors. For example, we can swap the &lt;span class=&quot;math-container&quot;&gt;\$2\$&lt;/span&gt; in the bottom left, and the &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; in the top left corner.&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\begin{matrix}&#xA;2 &amp;amp; 1 &amp;amp; 4 &amp;amp; 7\\&#xA;1 &amp;amp; 3 &amp;amp; 5 &amp;amp; 6\\&#xA;1 &amp;amp; 1 &amp;amp; 4 &amp;amp; 5 \\&#xA;\end{matrix}&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is fine, because every number has the same neighborhood counts. That is, we can make a sorted list of numbers and their neighbors, and verify the they are the same:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\begin{matrix}&#xA;\text{Number} &amp;amp; \text{Neighbors} \\&#xA;1 &amp;amp; 1,1 \\&#xA;1 &amp;amp; 1,2,3 \\&#xA;1 &amp;amp; 1,3,4 \\&#xA;1 &amp;amp; 2,3,4 \\&#xA;2 &amp;amp; 1,1 \\&#xA;3 &amp;amp; 1,1,1,5 \\&#xA;4 &amp;amp; 1,5,7 \\&#xA;4 &amp;amp; 1,5,5 \\&#xA;5 &amp;amp; 3,4,4,6 \\&#xA;6 &amp;amp; 5,5,7 \\&#xA;7 &amp;amp; 4,6&#xA;\end{matrix}&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Here is another example.&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\begin{matrix}&#xA;2 &amp;amp; 1 &amp;amp; 1\\&#xA;1 &amp;amp; 3 &amp;amp; 1\\&#xA;1 &amp;amp; 1 &amp;amp; 4\\&#xA;\end{matrix}&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Let's make a neighbor list. Note that we are gonna have duplicate entries (which is fine)&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\begin{matrix}&#xA;\text{Number} &amp;amp; \text{Neighbors} \\&#xA;1 &amp;amp; 1,1 \\&#xA;1 &amp;amp; 1,1 \\&#xA;1 &amp;amp; 1,2,3 \\&#xA;1 &amp;amp; 1,2,3 \\&#xA;1 &amp;amp; 1,3,4 \\&#xA;1 &amp;amp; 1,3,4 \\&#xA;2 &amp;amp; 1,1 \\&#xA;3 &amp;amp; 1,1,1,1 \\&#xA;4 &amp;amp; 1,1 \\&#xA;\end{matrix}&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Now, can we swap the top left &lt;span class=&quot;math-container&quot;&gt;\$2\$&lt;/span&gt; and the bottom left &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt;? It may look fine at first glance, but we must be careful! By swapping those two elements we would create a &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; which has neighbors &lt;span class=&quot;math-container&quot;&gt;\$2,3,4\$&lt;/span&gt;, which didn't exist in the first input.&lt;/p&gt;&#xA;&lt;p&gt;Just to demonstrate, here is the matrix after this non-semi-continuous transformation:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\begin{matrix}&#xA;1 &amp;amp; 1 &amp;amp; 1\\&#xA;1 &amp;amp; 3 &amp;amp; 1\\&#xA;2 &amp;amp; 1 &amp;amp; 4\\&#xA;\end{matrix}&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;And here is the neighbor list:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\begin{matrix}&#xA;\text{Number} &amp;amp; \text{Neighbors} \\&#xA;1 &amp;amp; 1,1 \\&#xA;1 &amp;amp; 1,1 \\&#xA;1 &amp;amp; 1,1,3 \\&#xA;1 &amp;amp; 1,2,3 \\&#xA;1 &amp;amp; 1,3,4 \\&#xA;1 &amp;amp; 2,3,4 \\&#xA;2 &amp;amp; 1,1 \\&#xA;3 &amp;amp; 1,1,1,1 \\&#xA;4 &amp;amp; 1,1 \\&#xA;\end{matrix}&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Which is has changed after the transformation, ergo the transformation is non-semi-continuous (on this input).&lt;/p&gt;&#xA;&lt;p&gt;To clarify, semi-continuity is a property of a transformation on some specific matrix.&lt;/p&gt;&#xA;&lt;p&gt;Your code will take a matrix as input and output the number of (unique) semi-continuous transformations. Two transformations are different if the output is different. So for example swapping two identical numbers is the same as the identity transform (doing nothing).&lt;/p&gt;&#xA;&lt;p&gt;Or in other words: Your code will take a matrix and return the number of matrices with those dimensions that have the same neighbor-list.&lt;/p&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-01-25T13:39:37.763" LastActivityDate="2022-01-25T13:39:37.763" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24360" PostTypeId="2" ParentId="2140" CreationDate="2022-01-25T13:58:39.787" Score="1" Body="&lt;h1&gt;Climbing the Bookshelf &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242108/climbing-the-bookshelf&quot;&gt;Climbing the Bookshelf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2022-01-31T17:55:41.687" LastActivityDate="2022-01-31T17:55:41.687" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24361" PostTypeId="2" ParentId="2140" CreationDate="2022-01-25T14:48:14.700" Score="1" Body="&lt;h1&gt;Alphabet Polygon&lt;/h1&gt;&#xA;&lt;h1&gt;Intro&lt;/h1&gt;&#xA;&lt;p&gt;Given a number of sides &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; and a side length &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt;, generate an &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt;-sided polygon with side length &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt;. The fill value will be the alphabet going clockwise. If there are not enough letters, wrap around.&lt;/p&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;3 4&#xA;&#xA;     A&#xA;    H B&#xA;   I   C&#xA;  G F E D&#xA;&#xA;&#xA;4 4&#xA;&#xA;ABCD&#xA;L  E&#xA;K  F&#xA;JIHG&#xA;&lt;span class=&quot;math-container&quot;&gt;```&lt;/span&gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2022-01-27T14:51:15.317" LastActivityDate="2022-01-27T14:51:15.317" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24362" PostTypeId="2" ParentId="2140" CreationDate="2022-01-25T15:22:10.880" Score="0" Body="&lt;h1&gt;Count the ways to transform (3)&lt;/h1&gt;&#xA;&lt;p&gt;Your input is an infinite matrix (2d array) of nonneagtive integers where a finite area of the matrix contains nonzero integers. For example:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\begin{matrix}&#xA;\ddots &amp;amp; \vdots &amp;amp; \vdots &amp;amp; \vdots &amp;amp; \vdots &amp;amp; \vdots &amp;amp; \vdots &amp;amp; \cdot^{\cdot^\cdot} \\&#xA;\cdots &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; \cdots \\&#xA;\cdots &amp;amp; 0 &amp;amp; 1 &amp;amp; 0 &amp;amp; 0 &amp;amp; 6 &amp;amp; 0 &amp;amp; \cdots \\&#xA;\cdots &amp;amp; 0 &amp;amp; 3 &amp;amp; 5 &amp;amp; 4 &amp;amp; 3 &amp;amp; 0 &amp;amp; \cdots \\&#xA;\cdots &amp;amp; 0 &amp;amp; 2 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; \cdots \\&#xA;\cdots &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; \cdots \\&#xA;\cdot^{\cdot^\cdot} &amp;amp; \vdots &amp;amp; \vdots &amp;amp; \vdots &amp;amp; \vdots &amp;amp; \vdots &amp;amp; \vdots &amp;amp; \ddots&#xA;\end{matrix}&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;A semi-continuous transformation of this matrix is a rearranging of elements that preserves immediate neighbors. For example, we can swap the &lt;span class=&quot;math-container&quot;&gt;\$2\$&lt;/span&gt; in the bottom left, and the &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; in the top left corner.&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\begin{matrix}&#xA;\ddots &amp;amp; \vdots &amp;amp; \vdots &amp;amp; \vdots &amp;amp; \vdots &amp;amp; \vdots &amp;amp; \vdots &amp;amp; \cdot^{\cdot^\cdot} \\&#xA;\cdots &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; \cdots \\&#xA;\cdots &amp;amp; 0 &amp;amp; 2 &amp;amp; 0 &amp;amp; 0 &amp;amp; 6 &amp;amp; 0 &amp;amp; \cdots \\&#xA;\cdots &amp;amp; 0 &amp;amp; 3 &amp;amp; 5 &amp;amp; 4 &amp;amp; 3 &amp;amp; 0 &amp;amp; \cdots \\&#xA;\cdots &amp;amp; 0 &amp;amp; 1 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; \cdots \\&#xA;\cdots &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 &amp;amp; \cdots \\&#xA;\cdot^{\cdot^\cdot} &amp;amp; \vdots &amp;amp; \vdots &amp;amp; \vdots &amp;amp; \vdots &amp;amp; \vdots &amp;amp; \vdots &amp;amp; \ddots&#xA;\end{matrix}&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is fine, because every number has the same neighborhood counts. That is, we can make a sorted list of numbers and their neighbors, and verify the they are the same:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\begin{matrix}&#xA;\text{Number} &amp;amp; \text{Neighbors} \\&#xA;0 &amp;amp; 0,0,0,1 \\&#xA;0 &amp;amp; 0,0,0,1 \\&#xA;0 &amp;amp; 0,0,0,2 \\&#xA;0 &amp;amp; 0,0,0,2 \\&#xA;0 &amp;amp; 0,0,0,3 \\&#xA;0 &amp;amp; 0,0,0,3 \\&#xA;0 &amp;amp; 0,0,0,3 \\&#xA;0 &amp;amp; 0,0,0,4 \\&#xA;0 &amp;amp; 0,0,0,6 \\&#xA;0 &amp;amp; 0,0,0,6 \\&#xA;0 &amp;amp; 0,0,1,4 \\&#xA;0 &amp;amp; 0,0,2,5 \\&#xA;0 &amp;amp; 0,0,4,6 \\&#xA;1 &amp;amp; 0,0,0,3 \\&#xA;2 &amp;amp; 0,0,0,3 \\&#xA;3 &amp;amp; 0,0,3,6 \\&#xA;3 &amp;amp; 0,1,2,5 \\&#xA;4 &amp;amp; 0,0,3,5 \\&#xA;5 &amp;amp; 0,0,3,4 \\&#xA;6 &amp;amp; 0,0,0,3 \\&#xA;\end{matrix}&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;(we ignore zeros that have 4 zeros next them, since there are always infinitely many)&lt;/p&gt;&#xA;&lt;h1&gt;TODO: Add example where non-semi-continuous transformation changes the neighborhood counts.&lt;/h1&gt;&#xA;&lt;p&gt;To clarify, semi-continuity is a property of a transformation on some specific matrix.&lt;/p&gt;&#xA;&lt;p&gt;Your code will take an infinite matrix as input and output the number of (unique) semi-continuous transformations. Two transformations are different if the output is different. So for example swapping two identical numbers is the same as the identity transform (doing nothing). Also, since it's an infinite grid, simply translating the pattern is the same as doing nothing. You can assume the output number will always be finite.&lt;/p&gt;&#xA;&lt;p&gt;Or in other words: Your code will take an infinite matrix and return the number of matrices with those dimensions that have the same neighbor-list.&lt;/p&gt;&#xA;&lt;p&gt;Input can be in any reasonable format. You can decide if your input has to have some amount zero-padding or if you always take a square matrix, etc.&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;p&gt;Is this more interesting than version 2?&lt;/p&gt;&#xA;" OwnerUserId="84290" LastActivityDate="2022-01-25T15:22:10.880" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24364" PostTypeId="2" ParentId="2140" CreationDate="2022-01-25T18:53:06.533" Score="0" Body="&lt;h1&gt;Alternate indexing&lt;/h1&gt;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&lt;p&gt;(To do.)&lt;/p&gt;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[1, 2, 3], [4, 5, 6]] =&amp;gt; [[1, 4], [[1, 2, 3], [4, 5, 6], [3, 2, 1], [6, 5, 4]]&#xA;[[1, 1, 1]] =&amp;gt; [[1, 1, 1], [1, 1, 1]]&#xA;[[]] =&amp;gt; [[]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="105116" LastActivityDate="2022-01-25T18:53:06.533" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24368" PostTypeId="2" ParentId="2140" CreationDate="2022-01-26T02:41:36.333" Score="0" Body="&lt;h1&gt;Ragged Matrix&lt;/h1&gt;&#xA;&lt;p&gt;A ragged matrix, is a matrix that has a different number of elements in each row. Your challenge is to write a program in any favorable language to find the indices of all occurrences of target in the ragged matrix.&lt;/p&gt;&#xA;&lt;h1&gt;Input:&lt;/h1&gt;&#xA;&lt;p&gt;A list of ragged lists (can be empty) of positive integers and a target range e.g. &lt;code&gt;56-26&lt;/code&gt;. The target range, given 2 positive integers. For languages that do not support this type of list, you can input it as a string representation&lt;/p&gt;&#xA;&lt;p&gt;You may assume that &lt;code&gt;a&amp;lt;=b&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Output:&lt;/h1&gt;&#xA;&lt;p&gt;If a number in the ragged list is within the range or equal to &lt;code&gt;a&lt;/code&gt; or equal to &lt;code&gt;b&lt;/code&gt;, output the index of the ragged list then the index of the number in that ragged list e.g. &lt;code&gt;0 4&lt;/code&gt; - The &lt;code&gt;0&lt;/code&gt; is the first ragged list in the input and the &lt;code&gt;4&lt;/code&gt; is the index of the number in the first ragged list&lt;/p&gt;&#xA;&lt;h1&gt;Test cases:&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[[1,3,2,32,19],[19,2,48,19],[],[9,35,4],[3,19]],19-53]&#xA;-&amp;gt;&#xA;[[0,3],[0,4],[1,0],[1,2],[1,3],[3,1],[4,1]]&#xA;&#xA;[[[1,2,3,2],[],[7,9,2,1,4]],2-2]&#xA;-&amp;gt;&#xA;[[0,1],[0,3],[2,2]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You can choose to follow the output format above or output it in the following as well:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[[1,3,2,32,19],[19,2,48,19],[],[9,35,4],[3,19]],19-53]&#xA;-&amp;gt;&#xA;0 3 0 4 1 0 1 2 1 3 3 1 4 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;0-based and 1-based indexing is allowed&lt;/p&gt;&#xA;&lt;p&gt;You can output your answers in any way as long as it is distinguishable what the indexes of the number and matrix are&lt;/p&gt;&#xA;&lt;h1&gt;Tags:&lt;/h1&gt;&#xA;&lt;p&gt;code-golf&lt;/p&gt;&#xA;&lt;p&gt;matrix&lt;/p&gt;&#xA;&lt;p&gt;ragged-list&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-01-26T08:59:09.770" LastActivityDate="2022-01-26T08:59:09.770" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24369" PostTypeId="2" ParentId="2140" CreationDate="2022-01-26T06:27:12.147" Score="5" Body="&lt;h2&gt;Minimum number of changed tiles to permit knight passage&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/path-finding&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;path-finding&amp;#39;&quot; rel=&quot;tag&quot;&gt;path-finding&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Summary&lt;/h2&gt;&#xA;&lt;p&gt;Given a chess knight &lt;code&gt;K&lt;/code&gt; that is &lt;em&gt;only allowed to step on permitted tiles &lt;code&gt;X&lt;/code&gt;&lt;/em&gt;, output &lt;strong&gt;the minimum number of &lt;code&gt;.&lt;/code&gt; tiles that must be changed&lt;/strong&gt; to an &lt;code&gt;X&lt;/code&gt; tile in order to permit a passage to the destination &lt;code&gt;D&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The chessboard is guaranteed to be &lt;em&gt;larger than 3x3.&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;The chessboard is guaranteed to have &lt;em&gt;one and only one&lt;/em&gt; &lt;code&gt;D&lt;/code&gt; and &lt;code&gt;K&lt;/code&gt; in it.&lt;/li&gt;&#xA;&lt;li&gt;Sometimes, not using the existing &lt;code&gt;X&lt;/code&gt; tiles can lead to a more minimal solution, so please take this in mind while solving this challenge. (e.g. the 2nd testcase)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;..D.&#xA;XXXX&#xA;....&#xA;...K&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output = &lt;code&gt;1&lt;/code&gt; (sequence = &lt;code&gt;(-2,+1), (+1,+2)&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;.D..&#xA;....&#xA;..XK&#xA;....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output = &lt;code&gt;2&lt;/code&gt;: (sequence = &lt;code&gt;(-2,+1), (-1,-2), (+2, +1), (-1, +2)&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;D.X&#xA;...&#xA;...&#xA;...&#xA;..K&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output = &lt;code&gt;1&lt;/code&gt;: (sequence: &lt;code&gt;(-1, +2), (-1, +2)&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;DX.&#xA;...&#xA;...&#xA;...&#xA;..K&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output = &lt;code&gt;1&lt;/code&gt;: (sequence: &lt;code&gt;(-1, +2), (-1, +2)&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;D.X.&#xA;....&#xA;.X.X&#xA;.K..&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output = &lt;code&gt;0&lt;/code&gt;: (sequence: &lt;code&gt;(+2, +1), (-1, +2), (-1, -2), (-1, +2)&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;DXXX&#xA;XKXX&#xA;XXXX&#xA;XXXX&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output = &lt;code&gt;0&lt;/code&gt;: (sequence: &lt;code&gt;(+1, -2), (+1, +2), (-2, +1), (-1, -2), (+2, +1), (-2, +1)&lt;/code&gt;)&lt;/p&gt;&#xA;" OwnerDisplayName="user110579" LastEditorDisplayName="user110579" LastEditDate="2022-01-27T04:57:12.477" LastActivityDate="2022-01-27T04:57:12.477" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="24370" PostTypeId="2" ParentId="2140" CreationDate="2022-01-26T07:25:01.540" Score="1" Body="&lt;h1&gt;Trap the persistent hero in a maze&lt;/h1&gt;&#xA;&lt;p&gt;Last time a challenger tried to thwart your evil magical deeds, they got trapped in a maze that you created to be as small as possible, giving up only a few steps from the exit. Now there is another hero on the way. If it ain't broke, why fix it, so you ask the magic ball about the moves the hero will make in the maze. There are good news, and bad news.&lt;/p&gt;&#xA;&lt;p&gt;The good news is that the hero's moves are still predictable. There is a list of moves, which determine how the hero moves in an intersection. The bad news is that the hero is persistent, never really giving up. What this means is that the list of moves repeats forever.&lt;/p&gt;&#xA;&lt;h1&gt;TODO Explanation of the move list and rules&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to write a program that traps the hero in the maze. You may assume that the input has a solution.&lt;/p&gt;&#xA;" OwnerUserId="84290" LastActivityDate="2022-01-26T07:25:01.540" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24371" PostTypeId="2" ParentId="2140" CreationDate="2022-01-26T08:15:51.387" Score="2" Body="&lt;h1&gt;Ragged list addition&lt;/h1&gt;&#xA;&lt;p&gt;Let's define the operator &lt;span class=&quot;math-container&quot;&gt;\$+\$&lt;/span&gt; as follows, using wrapping list indexing:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$&#xA;a+b=\begin{cases}&#xA;a+b,\space\text{if }a\text{ and }b\text{ are integers (regular integer addition)}\\&#xA;[a+b[0], a+b[1], ...,a+b[len(b)-1]],\text{if }a\text{ is an integer and }b\text{ is a list}\\&#xA;[a[0]+b,a[1]+b,...,a[len(a)-1]+b],\text{if }b\text{ is a list and }\text{ is an integer}\\&#xA;[a[0]+b[0], a[1]+b[1], a[2]+b[2],...,\\a[\max(len(a),len(b))-1]+b[\max(len(a),len(b))-1]],\text{if }a\text{ and }b\text{ are lists}&#xA;\end{cases}&#xA;\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;That is huge wall of text, so let's look at an example: We want to add the arrays &lt;span class=&quot;math-container&quot;&gt;\$[1,2,[5,6,7]]\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$[[1],2,3,10,0,[3,0],1]\$&lt;/span&gt; together&lt;/p&gt;&#xA;&lt;p&gt;Let's start&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$[1,2,[5,6,7]]+[[1],2,3,10,0,[3,0],1]\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;We are adding two arrays, so we add element by element, looping if neccesary:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$[1+[1],2+2,[5,6,7]+3,1+10,2+0,[5,6,7]+[3,0],1+1]\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Now, let's get all the additions that don't involve lists out of the way&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$[1+[1],4,[5,6,7]+3,11,2,[5,6,7]+[3,0],2]\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Next, lets look at &lt;span class=&quot;math-container&quot;&gt;\$1+[1]\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$[5,6,7]+3\$&lt;/span&gt;. Here we add an integer to an array, so we just distribute the addition like so:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$[[1+1],4,[5+3,6+3,7+3],11,2,[5,6,7]+[3,0],2]\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$[[2],4,[8,9,10],11,2,[5,6,7]+[3,0],2]\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Now we have &lt;span class=&quot;math-container&quot;&gt;\$[5,6,7]+[3,0]\$&lt;/span&gt; left. Again, we interleave the arrays, looping if necessary:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$[[2],4,[8,9,10],11,2,[5+3,6+0,7+3],2]\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$[[2],4,[8,9,10],11,2,[8,6,10],2]\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Now there are no &lt;span class=&quot;math-container&quot;&gt;\$+\$&lt;/span&gt; signs left. Thus &lt;span class=&quot;math-container&quot;&gt;\$[1,2,[5,6,7]]+[[1],2,3,10,0,[3,0],1]=[[2],4,[8,9,10],11,2,[8,6,10],2]\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Note that ragged list addition is not commutative. So &lt;span class=&quot;math-container&quot;&gt;\$a+b\$&lt;/span&gt; is not necessarily the same as &lt;span class=&quot;math-container&quot;&gt;\$b+a\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your code takes two ragged lists and returns their sum. Shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="84290" LastActivityDate="2022-01-26T08:15:51.387" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24372" PostTypeId="2" ParentId="2140" CreationDate="2022-01-26T11:03:28.857" Score="0" Body="&lt;h1&gt;Truncatable Primes&lt;/h1&gt;&#xA;&lt;p&gt;A left-truncatable prime is a prime number and when the first digit is removed continuously, the result is always prime.&lt;/p&gt;&#xA;&lt;p&gt;A right-truncatable prime is a prime number and when the last digit is removed continuously, the result is always prime.&lt;/p&gt;&#xA;&lt;p&gt;If the integer is only a left-truncatable prime, return &lt;code&gt;left&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;If the integer is only a right-truncatable prime, return &lt;code&gt;right&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Otherwise, return &lt;code&gt;False&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;9137 -&amp;gt; left&#xA;9137, 137, 37 and 7 are all prime&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;5939 -&amp;gt; right&#xA;5939, 593, 59 and 5 are all prime&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;139 -&amp;gt; False&#xA;1 and 9 are non-prime, so 139 cannot be truncatable from either way&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;103 -&amp;gt; False&#xA;It contains a 0 digit, which is not prime(even though 103 and 3 are primes)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You may assume that the input will never be both left and right truncatable, so an integer such as &lt;code&gt;5&lt;/code&gt; will not appear in the input (it is prime and single digit so it is counted as both)&lt;/p&gt;&#xA;&lt;p&gt;You are allowed to print &lt;code&gt;False&lt;/code&gt; as &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;left&lt;/code&gt; as &lt;code&gt;2&lt;/code&gt; and &lt;code&gt;right&lt;/code&gt; as &lt;code&gt;1&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;OR&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;left&lt;/code&gt; as &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;right&lt;/code&gt; as &lt;code&gt;2&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Otherwise, you are allowed to use any 3 distinct 3 values/string representation of &lt;code&gt;left&lt;/code&gt;, &lt;code&gt;right&lt;/code&gt; and &lt;code&gt;False&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Tags:&lt;/h1&gt;&#xA;&lt;p&gt;primes&lt;/p&gt;&#xA;&lt;p&gt;classification&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-01-26T13:38:13.693" LastActivityDate="2022-01-26T13:38:13.693" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24373" PostTypeId="2" ParentId="2140" CreationDate="2022-01-26T13:53:53.950" Score="1" Body="&lt;p&gt;&lt;strong&gt;Count count count..&lt;/strong&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/241802/84844&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="84844" LastEditorUserId="84844" LastEditDate="2022-01-26T19:10:32.097" LastActivityDate="2022-01-26T19:10:32.097" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24375" PostTypeId="2" ParentId="2140" CreationDate="2022-01-26T21:07:46.667" Score="-3" Body="&lt;h1&gt;Nth Eights Challenge&lt;/h1&gt;&#xA;&lt;h2&gt;Inputs:&lt;/h2&gt;&#xA;&lt;p&gt;There are 2 inputs: The amount of eights to be used in the calculation, and the number to solve for.&lt;br&gt;&lt;/p&gt;&#xA;&lt;h2&gt;What to solve:&lt;/h2&gt;&#xA;&lt;p&gt;The program needs to insert operators in between each eight, so when the newly created equation is calculated, the answer is the number that was trying to be solved for. When the equation is calculated, there is no operator priority.&lt;br&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&lt;p&gt;The only operators allowed are:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+&#xA;-&#xA;*&#xA;/&#xA;(And parentheses)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You may insert multiple operators between each number. No extra numbers are allowed.&#xA;There must be an operator inserted in between each 8.&#xA;The answer must be displayed when the program finishes.&lt;/p&gt;&#xA;&lt;h2&gt;Examples:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;#User inputs&#xA;Amount of eights: 4&#xA;Solve for: 15&#xA;&#xA;#Answer&#xA;8+8-8/8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;#User inputs&#xA;Amount of eights: 4&#xA;Solve for: 10&#xA;&#xA;#Answer&#xA;(8+8)/8+8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Winning Criteria:&lt;/h2&gt;&#xA;&lt;p&gt;The winning criteria is for the program written in the least amount of characters.&lt;/p&gt;&#xA;" OwnerUserId="110122" LastEditorUserId="110122" LastEditDate="2022-01-28T00:08:04.220" LastActivityDate="2022-01-28T00:08:04.220" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24376" PostTypeId="2" ParentId="8474" CreationDate="2022-01-26T22:23:59.230" Score="0" Body="&lt;h1&gt;Cutoff at top&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ATagt.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ATagt.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Not sure if this is a my computer problem or not... but it's cutoff at the top and I can't see those buttons. My screen is 1920x1080.&lt;/p&gt;&#xA;" OwnerUserId="97819" LastActivityDate="2022-01-26T22:23:59.230" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24378" PostTypeId="2" ParentId="2140" CreationDate="2022-01-27T14:55:12.980" Score="2" Body="&lt;h1&gt;Slice the source code - &lt;a href=&quot;https://codegolf.stackexchange.com/questions/242616/slice-the-source-code-cops/&quot;&gt;Cops&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/242618/slice-the-source-code-robbers/&quot;&gt;Robbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="100664" LastEditDate="2022-02-10T08:07:59.707" LastActivityDate="2022-02-10T08:07:59.707" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="24379" PostTypeId="2" ParentId="2140" CreationDate="2022-01-27T15:43:16.073" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241976/is-this-a-hamiltonian-cycle&quot;&gt;Is this a Hamiltonian cycle?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="103688" LastEditorUserId="103688" LastEditDate="2022-01-29T15:50:07.597" LastActivityDate="2022-01-29T15:50:07.597" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24380" PostTypeId="1" CreationDate="2022-01-27T19:02:21.570" Score="2" ViewCount="75" Body="&lt;p&gt;Is OK to post a challenge for a sandbox post with 0 votes but is 1 week old?&lt;/p&gt;&#xA;&lt;p&gt;I have a lot of sandbox posts  with 0 votes that are posted to Main, But this is OK?&lt;/p&gt;&#xA;" OwnerUserId="106959" LastEditorUserId="66833" LastEditDate="2022-01-27T19:09:33.680" LastActivityDate="2022-01-27T19:09:33.680" Title="Is OK to post a challenge for a sandbox post with 0 votes but is 1 week old" Tags="|support|sandbox|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24381" PostTypeId="2" ParentId="24380" CreationDate="2022-01-27T19:07:33.410" Score="9" Body="&lt;h3&gt;Post Sandbox challenges when they're ready to be posted, not based on score or time&lt;/h3&gt;&#xA;&lt;p&gt;The reason score/time are recommended (e.g. wait a week, have a positive score etc.) is because these are usually good ways of measuring if your challenge idea will do well. For example, a negatively scored Sandbox post is unlikely to do well posted on main, and a challenge left in the Sandbox for an hour won't get the feedback it might need.&lt;/p&gt;&#xA;&lt;p&gt;But, these are &lt;em&gt;recommended&lt;/em&gt;, not hard limits. People who are experienced challenge writers will often skip the Sandbox, or leave an idea for only a couple of days to get feedback, often in the form &amp;quot;Will this be a good idea?&amp;quot;, because they're experienced enough to iron out any kinks in the spec by themselves.&lt;/p&gt;&#xA;&lt;p&gt;Ultimately, you should post a challenge from the Sandbox once it is ready to be posted. If you aren't entirely sure if a challenge is ready, ask people in chat - often a &amp;quot;Any last feedback on &lt;a href=&quot;https://example.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;this challenge&lt;/a&gt;?&amp;quot; message will get a response or two saying if it looks good to post, or if it needs more feedback.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-01-27T19:07:33.410" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24382" PostTypeId="1" CreationDate="2022-01-28T11:26:31.900" Score="2" ViewCount="51" Body="&lt;p&gt;like for languages that need a starting point, like c++, c#, java and kotlin.&lt;/p&gt;&#xA;&lt;p&gt;I always post my answers in the function form instead of also calling it from the starting point. If we need to actually call it from the starting point, then that's a huge waste of bytes. what are the standard guidelines for that? or say, one could define that function as an extension function rather than a normal function that takes in the input as parameters if it saves bytes, what's the matter for this as well?&lt;/p&gt;&#xA;" OwnerUserId="109937" LastActivityDate="2022-01-28T11:59:31.220" Title="What are the standard guidelines for calling the function that does whatever the post says?" Tags="|discussion|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24383" PostTypeId="2" ParentId="24382" CreationDate="2022-01-28T11:59:31.220" Score="-1" Body="&lt;h1&gt;Extension Functions should be treated as helper functions&lt;/h1&gt;&#xA;&lt;p&gt;That is to say, they shouldn't be the main submission function, but they shouldn't need boilerplate.&lt;/p&gt;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Int.returnOneMore() {return this+1}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;on it's own wouldn't be a valid submission, but:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Int.returnOneMore() {return this+1}&#xA;fun f(){/* something that calls the defined extension function */}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;would be.&lt;/p&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2022-01-28T11:59:31.220" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24384" PostTypeId="1" CreationDate="2022-01-28T14:52:06.113" Score="0" ViewCount="31" Body="&lt;p&gt;like the Float.pow function in kotlin, in normal cases, which the pow function is not a part of since it is an extension function, you do it by doing, kotlin.math.abs for instance, should import directives be compulsory for code golf submissions? (like a string of imports such as &lt;code&gt;import javax.swing.Jframe;fun main(){&lt;/code&gt; etc.? or should they be ignored as many other languages dont have those functions under libraries anyway? Now, if they are ignored, the tio.run's would be broken. but maybe the import statements could be done at the footer section that so nothing breaks?&lt;/p&gt;&#xA;&lt;p&gt;Also, for the extension functions, in kotlin atleast. you cant call them by  doing kotlin.math.pow(2f, 4) or something. when you type in 2f.pow(4f) and press enter, the ide, -atleast for my case- imports it automatically, and i doubt if there is a standalone way to use extension functions in kotlin. so... how should they be treated in your opinion?&lt;/p&gt;&#xA;" OwnerUserId="109937" LastActivityDate="2022-01-28T14:52:06.113" Title="How should be some mathematical functions that you need to import to directly use without adding the library name be treated as?" Tags="|discussion|" AnswerCount="0" CommentCount="6" ClosedDate="2022-02-07T09:37:56.790" ContentLicense="CC BY-SA 4.0" />
  <row Id="24385" PostTypeId="1" CreationDate="2022-01-28T14:52:17.587" Score="0" ViewCount="108" Body="&lt;p&gt;Question in the title. Is there a code golf for code efficiency (speed) instead of bytes?&lt;/p&gt;&#xA;" OwnerUserId="66997" LastActivityDate="2022-01-28T14:53:09.863" Title="Is there a code golf for code efficiency (speed) instead of bytes?" Tags="|feature-request|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24386" PostTypeId="2" ParentId="24385" CreationDate="2022-01-28T14:53:09.863" Score="5" Body="&lt;p&gt;If you mean speed in terms of run time, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If you mean efficiency in terms of time complexity, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-algorithm&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2022-01-28T14:53:09.863" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24387" PostTypeId="2" ParentId="2140" CreationDate="2022-01-28T15:52:23.687" Score="0" Body="&lt;h1&gt;D'Hondt method&lt;/h1&gt;&#xA;&lt;p&gt;the D'Hondt method is a method for allocating seats in parliaments.&lt;/p&gt;&#xA;&lt;p&gt;Given the Amount of representatives the district you're calculating for is given, and the total amount of voters, and a map or dictionary of every party alongside all the votes they got, you will be asked to give the amount of representatives each party will get from that electoral district as a map or dictionary depending on your language, or as a list/array of whose first index will contain of the party name as a string or char[], then the second the number of representatives as a number (the type is all fine as long as it doesn't have any decimals and is not negative, and their string conversions are something like this: f123 -&amp;gt; &amp;quot;123&amp;quot;)&lt;/p&gt;&#xA;&lt;p&gt;the algorithm: &lt;a href=&quot;https://plus.maths.org/content/maths-minute-dhondt-method&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://plus.maths.org/content/maths-minute-dhondt-method&lt;/a&gt;&#xA;another link: &lt;a href=&quot;https://en.wikipedia.org/wiki/D%27Hondt_method#Procedure&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://en.wikipedia.org/wiki/D%27Hondt_method#Procedure&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;like as output those are all fine:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-kotlin prettyprint-override&quot;&gt;&lt;code&gt;return mapOf(&#xA;    &amp;quot;Party A&amp;quot; to 4&#xA;    &amp;quot;Party B&amp;quot; to 3&#xA;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-kotlin prettyprint-override&quot;&gt;&lt;code&gt;return arrayOf(&#xA;    &amp;quot;Party A&amp;quot;,  &amp;quot;1&amp;quot;,&#xA;    &amp;quot;Party B&amp;quot;,  &amp;quot;2&amp;quot;&#xA;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;you can even give Array as an output as long as you clarify how to get proper values from it somewhere in the answer (in easy terms of course)&#xA;like:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-kotlin prettyprint-override&quot;&gt;&lt;code&gt;arrayOf(&#xA;    &amp;quot;Party A&amp;quot; to 4&#xA;    &amp;quot;Party B&amp;quot; to 8&#xA;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and you can post a snippet like&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-kotlin prettyprint-override&quot;&gt;&lt;code&gt;for(value in output)&#xA;{&#xA;    if(value::class == Int::class) println(value as Int)&#xA;    if(value::class == String::class) println(value as String)&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The Input will be similiar as such:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;mutableMap&amp;lt;String, Int&amp;gt;&lt;/li&gt;&#xA;&lt;li&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&amp;quot;Partyname&amp;quot;:  Amount of votes it got&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Amount of Voters in that district&lt;/li&gt;&#xA;&lt;li&gt;Amount of representatives to be assigned to the parliament from that district&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The Output will be something like:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;mutableMap&amp;lt;String, Int&amp;gt;&lt;/li&gt;&#xA;&lt;li&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&amp;quot;Partyname&amp;quot;: Amount of representatives it got&#xA;or&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;mutableList&amp;lt;String, String&amp;gt;&lt;/li&gt;&#xA;&lt;li&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&amp;quot;Partyname&amp;quot;: amount of representatives it got in a comprehensible form&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Like: [PartyA, 5, PartyB, 10, PartyC, 15]&#xA;or&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;List&amp;lt;List&amp;lt;String, String&amp;gt;&lt;/li&gt;&#xA;&lt;li&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Like: [ [PartyA, 5], [PartyB, 10], [PartyC, 15] ]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Those are not strict rules and just a general remind that as long as the input/output is comprehensible it is fine&lt;/p&gt;&#xA;" OwnerUserId="109937" LastActivityDate="2022-01-28T15:52:23.687" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24388" PostTypeId="1" AcceptedAnswerId="24389" CreationDate="2022-01-28T16:29:45.930" Score="3" ViewCount="113" Body="&lt;p&gt;following &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/6915/how-do-we-calculate-the-length-of-lambda&quot;&gt;this&lt;/a&gt; meta codegolf stackexchange post, I've stopped using declarations for lambda functions, but one problem this creates is that since you're only inputting the lambda body and not its header, you can't run it in try it online. What would be your suggestions to solve this? can we ignore whatever it says about the bytes on the tio website and just mind whatever the answer says?&lt;/p&gt;&#xA;&lt;p&gt;edit: I personally use kotlin&lt;/p&gt;&#xA;" OwnerUserId="109937" LastEditorUserId="66833" LastEditDate="2022-01-28T16:45:29.377" LastActivityDate="2022-01-28T17:07:51.860" Title="For lambdas that is, how should we input them into tio.run?" Tags="|support|answers|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24389" PostTypeId="2" ParentId="24388" CreationDate="2022-01-28T16:31:48.660" Score="5" Body="&lt;p&gt;In Javascript, you can put &lt;code&gt;f=&lt;/code&gt; into the header, the lambda in the body, and then call &lt;code&gt;f&lt;/code&gt; in the footer to test:&lt;/p&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://nodejs.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;JavaScript (Node.js)&lt;/a&gt;, 6 bytes&lt;/h1&gt;&#xA;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;x=&amp;gt;x+1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##y0osSyxOLsosKNHNy09J/Z9m@7/C1q5C2/B/cn5ecX5Oql5OfrpGmoahpuZ/AA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;JavaScript (Node.js) – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In Python, you can put &lt;code&gt;f=\&lt;/code&gt; into the header and then do the same (you need the backslash to escape the newline):&lt;/p&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://docs.python.org/3/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Python 3&lt;/a&gt;, 12 bytes&lt;/h1&gt;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;lambda x:x+1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##K6gsycjPM/6fZhvzPycxNyklUaHCqkLb8H9BUWZeiUaahqGm5n8A&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 3 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2022-01-28T16:31:48.660" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24390" PostTypeId="2" ParentId="24388" CreationDate="2022-01-28T16:52:26.190" Score="5" Body="&lt;p&gt;Not all languages allow the sort of formatting that is permitted by Javascript and Python.&lt;/p&gt;&#xA;&lt;p&gt;For example in Haskell which does not have a way to start a function on a newline without significantly modifying the behavior of the compiler I add an extra assignment to the body &lt;code&gt;f=&lt;/code&gt; but remove it from my answer and the byte count.&lt;/p&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://www.haskell.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Haskell&lt;/a&gt;, 7 bytes&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;map(+1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##y0gszk7Nyfn/P802N7FAQ9tQ839uYmaegi2XgkJBUWZeiYKKQppCtKGOkY6xjqGRjlHsfwA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Haskell – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;If you follow the link to the TIO you will see that there are an extra 2 bytes at the beginning.  I often also remove the code formatting since it tends not to like anonymous functions.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-01-28T17:07:51.860" LastActivityDate="2022-01-28T17:07:51.860" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24391" PostTypeId="2" ParentId="2140" CreationDate="2022-01-29T07:44:33.497" Score="8" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242174/inverted-ragged-list&quot;&gt;Inverted ragged list&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-02-01T18:43:07.200" LastActivityDate="2022-02-01T18:43:07.200" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24392" PostTypeId="2" ParentId="2140" CreationDate="2022-01-29T08:38:51.317" Score="-4" Body="&lt;h1&gt;Prime strings&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to find the string consisting of all the words in the give input whose lengths are prime numbers&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;The quick brown fox jumps over the lazy dog.&#xA;-&amp;gt;&#xA;The quick brown fox jumps the&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;Omicron Effect: Foreign Flights Won't Resume On Dec 15, Decision Later.&#xA;-&amp;gt;&#xA;Omicron Effect: Foreign Flights Won't On Dec 15,&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You may assume that only ascii characters are allowed and that uppercase, lower case, punctuation, and spaces are allowed in the input and output&lt;/p&gt;&#xA;&lt;p&gt;You may assume that the words whose lengths are prime numbers do not include spaces&lt;/p&gt;&#xA;" OwnerUserId="109916" LastActivityDate="2022-01-29T08:38:51.317" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24393" PostTypeId="2" ParentId="2140" CreationDate="2022-01-29T09:18:17.793" Score="1" Body="&lt;h2&gt;Shuffle up a list&lt;/h2&gt;&#xA;&lt;p&gt;Given two lists &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;, with no repeats in elements and so that the elements of &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; are identical to the elements of &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; except for the order they are in, we say &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; is an &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-&lt;em&gt;well-shuffled list&lt;/em&gt; of &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; (where &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is a nonnegative integer) if:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For any &lt;span class=&quot;math-container&quot;&gt;\$(a_1, a_2, \cdots, a_n) \in A^n\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$a_1\$&lt;/span&gt;'s position in &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; is &lt;span class=&quot;math-container&quot;&gt;\$\neq\$&lt;/span&gt; its position in &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$a_2\$&lt;/span&gt;'s position in &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; is &lt;span class=&quot;math-container&quot;&gt;\$\neq\$&lt;/span&gt; its position in &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;, ... and &lt;span class=&quot;math-container&quot;&gt;\$a_n\$&lt;/span&gt;'s position in &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; is &lt;span class=&quot;math-container&quot;&gt;\$\neq\$&lt;/span&gt; its position in &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;For any &lt;span class=&quot;math-container&quot;&gt;\$(a_1, a_2, \cdots, a_n) \in A^n\$&lt;/span&gt;, if &lt;span class=&quot;math-container&quot;&gt;\$a_i\$&lt;/span&gt; precedes &lt;span class=&quot;math-container&quot;&gt;\$a_j\$&lt;/span&gt; for some &lt;span class=&quot;math-container&quot;&gt;\$(i, j) \in [1, n]^2\$&lt;/span&gt; in &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;, then &lt;span class=&quot;math-container&quot;&gt;\$a_i\$&lt;/span&gt; follows &lt;span class=&quot;math-container&quot;&gt;\$a_j\$&lt;/span&gt; in &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Your task is to take two nonnegative integers &lt;span class=&quot;math-container&quot;&gt;\$m, n\$&lt;/span&gt; as input and return how-many &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-well-shuffled lists of lists of length &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt; there are.&lt;/p&gt;&#xA;" OwnerUserId="108434" LastEditorUserId="108434" LastEditDate="2022-01-29T11:42:54.150" LastActivityDate="2022-01-29T11:42:54.150" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24395" PostTypeId="2" ParentId="2140" CreationDate="2022-01-29T12:26:29.327" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242397/decompress-a-ragged-list&quot;&gt;Decompress a ragged list&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-02-05T16:18:05.687" LastActivityDate="2022-02-05T16:18:05.687" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24397" PostTypeId="1" AcceptedAnswerId="24427" CreationDate="2022-01-30T14:16:46.023" Score="19" ViewCount="208" Body="&lt;p&gt;I'd like to propose &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-scoring&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-scoring&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-scoring&lt;/a&gt; or a similar tag, but I'd like to get some feedback on whether this is useful and how the tag might work.&lt;/p&gt;&#xA;&lt;p&gt;First the proposal:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-scoring&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-scoring&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-scoring&lt;/a&gt; is a scoring criterion where the scoring mechanism and the task required are the same.  This means that if you pass your program to itself as input it should give you it's score.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Some examples are given at the bottom of the post.&lt;/p&gt;&#xA;&lt;p&gt;My motivation for proposing the tag is that it would break of a (small) chunk of the many challenges with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; into a more specific, searchable group.  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; is never going away but it is not a very useful tag and it would be nice to split off developing groups if possible.&lt;/p&gt;&#xA;&lt;p&gt;I do think this tag also has potential for a good deal more challenges to be made.  It's quite flexible and new challenges can be very innovative or novel.  It might be a little tough to come up with a &lt;em&gt;good&lt;/em&gt; task that makes for an interesting scoring criterion, but I don't think we have exhausted the supply.&lt;/p&gt;&#xA;&lt;p&gt;Now there are some things I think are worth discussing:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;In finding examples I was not able to find a good example question that was asked by anyone other than myself.  It's possible this is just a personal fixation of mine and that other people are just not asking these.  Although it's possible that making this a tag could lead to interest from others, sparking new and innovative challenges.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The scoring can be pretty varied between challenges that meet the requirements.  It might be wrong to think of this as a &lt;em&gt;scoring criterion&lt;/em&gt; tag.  Maybe it is better to think of the scoring criterion being &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; and the &lt;em&gt;task&lt;/em&gt; being to implement whatever scoring criterion.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A similar type of challenge that doesn't fall under this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;+&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; challenges where you are required to &lt;em&gt;validate&lt;/em&gt; rather than score your own program.  This challenge type even has some that &lt;em&gt;aren't asked by me!&lt;/em&gt; Should we add &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-validating&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-validating&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-validating&lt;/a&gt; or something as well?  Should these just be one tag with a name that encompasses both of them?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Examples:&lt;/h2&gt;&#xA;&lt;p&gt;Definite examples:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/242034/&quot;&gt;1&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/233916/&quot;&gt;2&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/173586/&quot;&gt;3&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/172146/&quot;&gt;4&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/127261/unique-is-cheap&quot;&gt;5&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Marginal or possible examples:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/171168/&quot;&gt;1&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-validating&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-validating&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-validating&lt;/a&gt; examples:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/201009/&quot;&gt;1&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/179422/&quot;&gt;2&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/174065/&quot;&gt;3&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/156967/&quot;&gt;4&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/171122/&quot;&gt;5&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/167924/&quot;&gt;6&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-02-06T00:28:34.173" LastActivityDate="2022-02-06T00:28:34.173" Title="Tag proposal: [self-scoring]" Tags="|discussion|status-completed|tags|scoring|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24398" PostTypeId="2" ParentId="2140" CreationDate="2022-01-31T06:07:52.007" Score="0" Body="&lt;h1&gt;Tips for golfing in Seriously&lt;/h1&gt;&#xA;&lt;p&gt;I am looking for tips to code in this golfing language &lt;a href=&quot;https://github.com/Mego/Seriously&quot; rel=&quot;nofollow noreferrer&quot;&gt;Seriously&lt;/a&gt;, and was wondering what some of the best/subtle ways for golfing this language is. Thx in advance!&lt;/p&gt;&#xA;" OwnerUserId="109916" LastActivityDate="2022-01-31T06:07:52.007" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24399" PostTypeId="1" CreationDate="2022-01-31T18:30:20.720" Score="1" ViewCount="65" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/101563/&quot;&gt;https://codegolf.stackexchange.com/a/101563/&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;as you can see, as the OP explains at the answer, if ran as a &lt;code&gt;.kts&lt;/code&gt; file (kotlin but script) it won't need a main function as it starts from the top. What are y'all opinions on this? how should this case be treated?&lt;/p&gt;&#xA;" OwnerUserId="109937" LastActivityDate="2022-01-31T18:36:23.013" Title="Turns out that you might not write the fun main for kotlin even if the post asks so because of this:" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24400" PostTypeId="2" ParentId="24399" CreationDate="2022-01-31T18:36:23.013" Score="6" Body="&lt;p&gt;In this case &amp;quot;Kotlin&amp;quot; and &amp;quot;Kotlin script&amp;quot; are different languages.  Both languages have implementations so they are indeed languages and because they are triggered by a change in the file extension they are different languages.  The same has been done for e.g. Literate Haskell in the past since it requires the &lt;code&gt;.lhs&lt;/code&gt; extension.&lt;/p&gt;&#xA;&lt;p&gt;If writing Kotlin script is more fun for you then go ahead and do that.  Which you want to use is up to you and the two are obviously different that there is no point in comparing them.  That is a Kotlin script answer is not necessarily better than a Kotlin answer merely because it is shorter.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2022-01-31T18:36:23.013" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24401" PostTypeId="2" ParentId="2140" CreationDate="2022-02-01T01:25:34.003" Score="2" Body="&lt;h1&gt;Can I wall glitch to there?&lt;/h1&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242581/can-i-wall-glitch-to-there&quot;&gt;Posted&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="96039" LastEditorUserId="96039" LastEditDate="2022-02-09T04:12:23.117" LastActivityDate="2022-02-09T04:12:23.117" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24402" PostTypeId="1" CreationDate="2022-02-01T05:16:33.853" Score="13" ViewCount="686" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19271/16766&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout February 2022, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://github.com/dloscutoff/Esolangs/tree/master/tinylisp&quot; rel=&quot;nofollow noreferrer&quot;&gt;tinylisp&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;What's a Language of the Month?&lt;/p&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/16766&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during February, those who wish to participate should learn (at least the basics of) tinylisp, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about tinylisp&lt;/h2&gt;&#xA;&lt;p&gt;I (DLosc) invented tinylisp, a minimalist Lisp dialect, for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/62886&quot;&gt;an interpreter golf challenge&lt;/a&gt;. Because &lt;a href=&quot;https://www.xkcd.com/224/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Lisp is powerful&lt;/a&gt;, tinylisp's small set of builtins can be combined to solve a wide variety of tasks. It also has a half-decent standard library, implemented using those builtins, that provides many more functions for arithmetic, list manipulation, and functional programming.&lt;/p&gt;&#xA;&lt;h2&gt;Why tinylisp?&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The core builtins are one character each, contributing to golfiness.&lt;/li&gt;&#xA;&lt;li&gt;The standard library costs bytes to load, but provides many higher-level functions. Sometimes using the library is shorter; sometimes avoiding it is shorter.&lt;/li&gt;&#xA;&lt;li&gt;Being a Lisp dialect, tinylisp is pretty good at functional programming and list manipulation.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Caveats&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The only documentation is the GitHub readme, which gives a decent introduction to the syntax and builtins but doesn't cover the library at all.&lt;/li&gt;&#xA;&lt;li&gt;There is no way to take input, and only limited ways of producing output. Most tinylisp solutions are therefore function solutions.&lt;/li&gt;&#xA;&lt;li&gt;String operations are supported, but not very thoroughly. All numbers are integers--no rationals or floating point.&lt;/li&gt;&#xA;&lt;li&gt;If you don't already speak Lisp, tinylisp might be hard to understand. On the other hand, Lisp is cool, and tinylisp could serve as a good introduction!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/dloscutoff/Esolangs/tree/master/tinylisp&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github repo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#tinylisp&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/108311&quot;&gt;Tips question&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/52509&quot;&gt;Chatroom&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/##dVRNb9pAEL3vr1j5ZBcLBXpDpRVSURWpMQfIibjIiYeyzbJ2dxdU@vHbycysN0CSXpDffLyZeTNLe/Cbxrw/HtW2bayXFnLpDk6I2/l09XVWfFkVk5vpXI7lwu5AXBefp8VisrieFavJzey2WKBnIMRF5B8hkyoZ4U9dD5Mc0QOhh8Y4RjWhGtYMgAD83FX6E@MN4Q1UNSNFSIVITd8anAuBjqDb3YcKnpCvlGa0Z9J9ReifEFhL@uYRjPoNqVYGspEIBoftWuivlakrrdNk@S3NZNn7ezdPckmRfeetatMsE1Kt5aUoSHJiWZ7s/e/gU3bkwZ/JdWPDp1SmyykFVvY7G3Fos62sg5C8Uh4sd2oBqAJmaNiDxu8r8QYlJ1BTqhtXjscyyRIyyXsL1eNLXxp8qGJX41V5csei2@pXyt95zFhelbInBxzFDD1ss/NhtxK0g9F/KF5kcc2TJkuOInaKCNrgxNsKlUVDjkPXYPz49UGSYjTkoQUOzaRyuErnqRELbqe95NEFD45Tbnl/HTvhyI7V3@Bn5SmMhScVBqOy7KTtRPkohzw3mjSYro9ovGhvOSy5Q9N47lLSWoOdiD7EnNg6ahW7DuonMgkBZ8M8R2BnvGBoaeY7k4QE@a6b8HxHXRDTdVuINcnX/9Eok0bmjIgyDI3p8ZZ5W6QQvR5SCP9N8BHVyvTxAmuyuvTi/V2@zOdzD6dIRxjukYehd9haZXx6dgxZdjw@AQ&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ungolfing script&lt;/a&gt; (put your golfed code in the Input box)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://dloscutoff.github.io/Esolangs/tinylisp/highlight/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Syntax highlighter&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Bounties&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;(Adapted from caird's bounty scheme for Add++ last month)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;I'll be offering a +50 rep bounty to any user's &lt;em&gt;second&lt;/em&gt; tinylisp answer. The first answer can be posted during or before this month, but the second must be posted during February 2022. In addition, I'm offering +200 to any user's tenth tinylisp answer posted during tinylisp's time as LotM.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, as the &amp;quot;relevant challenges&amp;quot; portion of LotM doesn't get enough attention, I'm offering a +500 bounty to any user who posts a tinylisp-themed challenge that goes on to score 10 or more.&lt;/p&gt;&#xA;&lt;p&gt;Finally, if somebody posts a shorter answer to the original &lt;a href=&quot;https://codegolf.stackexchange.com/questions/62886&quot;&gt;Tiny Lisp, tiny interpreter&lt;/a&gt; challenge, I will give a +500 bounty to the new shortest solution at the end of the month. The current leader is &lt;a href=&quot;https://codegolf.stackexchange.com/a/62975/16766&quot;&gt;Ell's Python 2 answer&lt;/a&gt; at 640 bytes.&lt;/p&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="16766" LastEditDate="2022-02-06T06:38:32.193" LastActivityDate="2022-02-28T23:39:49.950" Title="Language of the Month for February 2022: tinylisp" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24403" PostTypeId="2" ParentId="24402" CreationDate="2022-02-01T05:16:33.853" Score="4" Body="&lt;h1&gt;List of all tinylisp answers posted in February 2022&lt;/h1&gt;&#xA;&lt;p&gt;(first-time posters in &lt;strong&gt;bold&lt;/strong&gt;, 50-point bounty marked with &lt;sup&gt;+&lt;/sup&gt;, 200-point bounty marked with &lt;sup&gt;++&lt;/sup&gt;)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/200363/find-the-number-of-integers-in-the-range-from-1-to-n-that-ends-with-2/242141#242141&quot;&gt;Find the number of integers in the range from 1 to N that ends with 2&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241992/reversed-multiple-pair/242142#242142&quot;&gt;Reversed Multiple Pair&lt;/a&gt;&lt;sup&gt;+&lt;/sup&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/216479/ken-iverson-s-favourite-apl-expression/242143#242143&quot;&gt;Ken Iverson’s Favourite APL Expression?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/240743/next-greater-number/242146#242146&quot;&gt;Next Greater Number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/182797/patience-young-padovan/242147#242147&quot;&gt;Patience, young &amp;quot;Padovan&amp;quot;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/71476/determine-the-depth-of-an-array/242148#242148&quot;&gt;Determine the depth of an array&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/242156/106710&quot;&gt;Is this number a prime?&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/106710/thisfieldisrequired&quot;&gt;ThisFieldIsRequired&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/242210/106710&quot;&gt;Prime a*b+c of N&lt;/a&gt;&lt;sup&gt;+&lt;/sup&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/106710/thisfieldisrequired&quot;&gt;ThisFieldIsRequired&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/128858/the-dragon-curve-sequence/242208#242208&quot;&gt;The dragon Curve sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/242198&quot;&gt;Egyptian fraction representations of 1&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/101349/axuary&quot;&gt;Axuary&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/242223&quot;&gt;Egyptian fraction representations of 1&lt;/a&gt;&lt;sup&gt;+&lt;/sup&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/67312/giuseppe&quot;&gt;&lt;strong&gt;Giuseppe&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/128858/the-dragon-curve-sequence/242229#242229&quot;&gt;The dragon Curve sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/116933/bernardino-identifies-unaltered-dollar-words/242234#242234&quot;&gt;Bernardino identifies unaltered dollar words&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/242237/97916&quot;&gt;Reverse Array Sum&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/97916/chunes&quot;&gt;chunes&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/242259/97916&quot;&gt;Implement the hyperfactorial&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/97916/chunes&quot;&gt;chunes&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/242262/97916&quot;&gt;Implement an Over function&lt;/a&gt;&lt;sup&gt;+&lt;/sup&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/97916/chunes&quot;&gt;chunes&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/30361/the-shortest-code-to-invert-bit-wise-a-binary-string/242266#242266&quot;&gt;The shortest code to invert bit-wise a binary string&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world/242270#242270&quot;&gt;&amp;quot;Hello, World!&amp;quot;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/176948/digital-sumorial/242285#242285&quot;&gt;Digital Sumorial&lt;/a&gt;&lt;sup&gt;++&lt;/sup&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241357/implement-an-argwhere-function/242227#242227&quot;&gt;Implement an argwhere function&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/67312/giuseppe&quot;&gt;Giuseppe&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/240673/find-the-maximum-length-in-a-ragged-list/242235#242235&quot;&gt;Find the maximum length in a ragged list&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/67312/giuseppe&quot;&gt;Giuseppe&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/240612/scan-a-ragged-list/242238#242238&quot;&gt;Scan a ragged list&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/67312/giuseppe&quot;&gt;Giuseppe&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/236579/double-trace-of-a-square-matrix/242296#242296&quot;&gt;Double trace of a square matrix&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/67312/giuseppe&quot;&gt;Giuseppe&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/88653/print-a-10-by-10-grid-of-asterisks/242331#242331&quot;&gt;Print a 10 by 10 grid of asterisks&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/95780/draw-an-asterisk-triangle/242333#242333&quot;&gt;Draw an asterisk triangle&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/96887/maximal-number-of-regions-obtained-by-joining-n-points-around-a-circle-by-straig/242337#242337&quot;&gt;Maximal number of regions obtained by joining n points around a circle by straight lines&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/13152/shortest-code-to-produce-infinite-output/242378#242378&quot;&gt;Shortest code to produce infinite output&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/103822/output-the-sign/242380#242380&quot;&gt;Output the sign&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/62350/halloween-golf-the-2spooky4me-challenge/242383#242383&quot;&gt;Halloween Golf: The 2spooky4me Challenge!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/167924/in-for-a-bumpy-ride/242418#242418&quot;&gt;In for a bumpy ride&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/103822/output-the-sign/242503#242503&quot;&gt;Output the sign&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/147469/alphabet-staircase/242300#242300&quot;&gt;Alphabet Staircase&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/67312/giuseppe&quot;&gt;Giuseppe&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/169724/is-this-number-evil/242360#242360&quot;&gt;Is this number evil?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/67312/giuseppe&quot;&gt;Giuseppe&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/206967/sum-the-array-times-n-except-the-last/242362#242362&quot;&gt;Sum the array times n, except the last&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/67312/giuseppe&quot;&gt;Giuseppe&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242459/sum-of-two-squares/242494#242494&quot;&gt;Sum of two squares&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/67312/giuseppe&quot;&gt;Giuseppe&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/238329/chunk-sort-a-sequence/242556#242556&quot;&gt;Chunk Sort a Sequence&lt;/a&gt;&lt;sup&gt;++&lt;/sup&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/67312/giuseppe&quot;&gt;Giuseppe&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242532/distance-to-closest-subsequent-value/242557#242557&quot;&gt;Distance to closest subsequent value&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/67312/giuseppe&quot;&gt;Giuseppe&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242459/sum-of-two-squares/242566#242566&quot;&gt;Sum of two squares&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/119472/be-the-first-1-leave-only-the-first-truthy/243302#243302&quot;&gt;Be the First 1 (leave only the first Truthy)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/39752/sing-happy-birthday-to-your-favourite-programming-language/242399#242399&quot;&gt;Sing Happy Birthday to your favourite programming language&lt;/a&gt;&lt;sup&gt;(+)&lt;/sup&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/101349/axuary&quot;&gt;Axuary&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/84260/add-two-numbers/243148#243148&quot;&gt;Add two numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/101349/axuary&quot;&gt;Axuary&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/122087/is-this-number-triangular/242613#242613&quot;&gt;Is this number triangular?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/67312/giuseppe&quot;&gt;Giuseppe&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242660/rolling-a-ball-over-a-list/242685#242685&quot;&gt;Rolling a ball over a list&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/67312/giuseppe&quot;&gt;Giuseppe&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/142071/find-the-sum-of-the-divisors-of-n/243354#243354&quot;&gt;Find the sum of the divisors of N&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/67312/giuseppe&quot;&gt;Giuseppe&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant tips posted in February 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/242233/16766&quot;&gt;Try switching the order of expressions&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/242255/16766&quot;&gt;Abuse builtins for type-checking&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;tip summary&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant challenges posted in February 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242257/ungolf-my-tinylisp-code&quot;&gt;Ungolf my tinylisp code&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="16766" LastEditDate="2022-02-28T23:39:49.950" LastActivityDate="2022-02-28T23:39:49.950" CommentCount="0" CommunityOwnedDate="2022-02-01T05:16:33.853" ContentLicense="CC BY-SA 4.0" />
  <row Id="24404" PostTypeId="2" ParentId="2140" CreationDate="2022-02-01T09:40:07.390" Score="0" Body="&lt;h1&gt;Solve Rubik's Clock&lt;/h1&gt;&#xA;&lt;p&gt;Posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/242274/solve-rubiks-clock&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="87681" LastEditorUserId="87681" LastEditDate="2022-02-03T08:25:25.980" LastActivityDate="2022-02-03T08:25:25.980" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24410" PostTypeId="2" ParentId="2140" CreationDate="2022-02-01T13:32:48.433" Score="1" Body="&lt;h1&gt;Is it an action?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/abstract-algebra&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;abstract-algebra&amp;#39;&quot; rel=&quot;tag&quot;&gt;abstract-algebra&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Today, you will solve an abstract algebra challenge.&lt;/p&gt;&#xA;&lt;p&gt;Consider a set &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt;, which, to simplify things, is a finite subset of &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{Z}\$&lt;/span&gt; containing &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;. It has a binary operation &lt;span class=&quot;math-container&quot;&gt;\$*\$&lt;/span&gt;, which for our example will be &lt;span class=&quot;math-container&quot;&gt;\$+\$&lt;/span&gt;, but your program should be able to handle any binary operation. If &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt; is closed under &lt;span class=&quot;math-container&quot;&gt;\$*\$&lt;/span&gt;, i.e. &lt;span class=&quot;math-container&quot;&gt;\$g * g' \in G \forall g, g' \in G\$&lt;/span&gt;, there is associativity with regard to &lt;span class=&quot;math-container&quot;&gt;\$*\$&lt;/span&gt;, there is a unique element in &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt;, which we will note as &lt;span class=&quot;math-container&quot;&gt;\$1_G\$&lt;/span&gt;, such that &lt;span class=&quot;math-container&quot;&gt;\$1_G * g = g * 1_G = g \forall g \in G\$&lt;/span&gt;, and there exists a unique &lt;span class=&quot;math-container&quot;&gt;\$g^{-1} \in G \forall g \in G\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$ g * g^{-1} = g^{-1} * g = 1_G \$&lt;/span&gt;, then &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt; is a &lt;em&gt;group&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Consider a set &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt;, which is also a finite subset of &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{Z}\$&lt;/span&gt;. Then &lt;span class=&quot;math-container&quot;&gt;\$\circ: G \times X \to X\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt; is a group, is an &lt;em&gt;action&lt;/em&gt; if:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$1_G \circ x = x \forall x \in X\$&lt;/span&gt;, and&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$g \circ (g' \circ x) = (g * g') \circ x \forall g, g' \in G, x \in X\$&lt;/span&gt; (associativity).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Your task is to write a program or function which takes in the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt;, a finite subset of &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{Z}\$&lt;/span&gt; that includes &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt;, also a finite subset of &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{Z}\$&lt;/span&gt;, but not necessarily the same as &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt;;&lt;/li&gt;&#xA;&lt;li&gt;a binary operation &lt;span class=&quot;math-container&quot;&gt;\$*\$&lt;/span&gt; that operates within &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt; and that makes &lt;span class=&quot;math-container&quot;&gt;\$(G, *)\$&lt;/span&gt; a group, which can be taken in any reasonable manner you would like, such as taking it as a function with two parameters, and&lt;/li&gt;&#xA;&lt;li&gt;an &amp;quot;application&amp;quot; &lt;span class=&quot;math-container&quot;&gt;\$\circ\$&lt;/span&gt; from &lt;span class=&quot;math-container&quot;&gt;\$G \times X\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt;, which can be taken in any reasonable manner you would like.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For the purposes of this challenge, &lt;span class=&quot;math-container&quot;&gt;\$1_G\$&lt;/span&gt; is always &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This program should then output true if &lt;span class=&quot;math-container&quot;&gt;\$\circ\$&lt;/span&gt; is an action and false if not. You may use any two distinct values for true and false.&lt;/p&gt;&#xA;&lt;p&gt;The shortest code, measured in bytes, wins.&lt;/p&gt;&#xA;&lt;h3&gt;Test cases.&lt;/h3&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$G = \{0, 1, 2\}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$X = \{1, 2, 3\}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$*\$&lt;/span&gt; defined by &lt;span class=&quot;math-container&quot;&gt;\$g * g' = (g + g') mod 3\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\circ\$&lt;/span&gt; defined by &lt;span class=&quot;math-container&quot;&gt;\$g \circ x = g + x\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Output: &lt;strong&gt;false&lt;/strong&gt; because:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$1_G\$&lt;/span&gt; is 0;&lt;/li&gt;&#xA;&lt;li&gt;then &lt;span class=&quot;math-container&quot;&gt;\$1_G \circ x = 0 \circ x = 0 + x = x\$&lt;/span&gt;;&lt;/li&gt;&#xA;&lt;li&gt;but &lt;span class=&quot;math-container&quot;&gt;\$(1 * 2) \circ 2 = 0 \circ 2 = 2 \neq 1 + (2 + 2) mod 3 = 1 + (2 \circ 2) = 1 \circ (2 \circ 2)\$&lt;/span&gt;, thus &lt;span class=&quot;math-container&quot;&gt;\$\circ\$&lt;/span&gt; is not associative.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$G = \{0, 1, 2\}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$X = \{0, 1, 2\}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$*\$&lt;/span&gt; defined by &lt;span class=&quot;math-container&quot;&gt;\$g * g' = (g + g') mod 3\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\circ\$&lt;/span&gt; defined by &lt;span class=&quot;math-container&quot;&gt;\$g \circ x = (g + x) mod 3\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Output: &lt;strong&gt;true&lt;/strong&gt; because:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$1_G\$&lt;/span&gt; is 0;&lt;/li&gt;&#xA;&lt;li&gt;then &lt;span class=&quot;math-container&quot;&gt;\$1_G \circ x = 0 \circ x = (0 + x) mod 3 = x mod 3 = x\$&lt;/span&gt; (because &lt;span class=&quot;math-container&quot;&gt;\$x &amp;lt; 3\$&lt;/span&gt;);&lt;/li&gt;&#xA;&lt;li&gt;and &lt;span class=&quot;math-container&quot;&gt;\$\circ\$&lt;/span&gt; is associative (proof not provided)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="106710" LastEditorUserId="106710" LastEditDate="2022-02-01T19:28:19.083" LastActivityDate="2022-02-01T19:28:19.083" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24411" PostTypeId="1" CreationDate="2022-02-01T18:18:15.003" Score="13" ViewCount="331" Body="&lt;p&gt;Let's say that there is a standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; question where you:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Have to find a solution that satisfies some constraints (eg. a math equation, etc.)&lt;/li&gt;&#xA;&lt;li&gt;Or, if a solution doesn't exist, output the nonexistence of a solution (by erroring, returning -1, etc.)&lt;/li&gt;&#xA;&lt;li&gt;There are no explicitly stated limits to the &amp;quot;size&amp;quot; of the solution.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Is it valid to submit an answer, which aside from complications raising from resource exhaustion, is a semi-decision algorithm, and then utilize a recursion/memory limit to detect cases when there is no solution?&lt;/p&gt;&#xA;&lt;p&gt;A semi-decision algorithm is an algorithm which is able to find a solution if it exists, but if a solution doesn't exists, it will go in an infinite loop.&lt;/p&gt;&#xA;&lt;p&gt;For example, if the task was to find an integer solution for a polynomial equation &lt;span class=&quot;math-container&quot;&gt;\$ax^2+bxy+c=0\$&lt;/span&gt;, a semi-decision algorithm would try all possible combinations of &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt;, until it finds a solution. If a solution exists, this algorithm will terminate and return the solution. But, if no solution exists, the algorithm will go on forever, never returning anything.&lt;/p&gt;&#xA;&lt;p&gt;Now is it valid to take that semi-decision algorithm, implement it in a language which has the ability to handle recursion limits, and then say that if a solution doesn't exist, a recursion-limit error is returned, and thus the submission satisfies the rules?&lt;/p&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242062/prime-abc-of-n/242063&quot;&gt;This question&lt;/a&gt; has some semi-decision algorithms as answers.&lt;/p&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-02-02T20:05:25.753" LastActivityDate="2022-02-02T20:05:25.753" Title="Using resource exhaustion with a semi-deciding algorithm" Tags="|discussion|rules|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24412" PostTypeId="2" ParentId="24411" CreationDate="2022-02-01T18:18:15.003" Score="12" Body="&lt;h1&gt;No, that doesn't satisfy the rules&lt;/h1&gt;&#xA;&lt;p&gt;In many &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; questions there are infinitely many inputs, which may be arbitrarily long. And, unless otherwise stated, your code should be able to handle every single input correctly, even if it's a billion billion bytes long, at least in theory. Now, most languages have limits on how much memory an object can take, or how much you can recurse, meaning that it can't really handle the infinitely many arbitrarily large inputs. To make those languages able to participate, we implicitly pretend that the resource limits don't exist (or are infinite), thus making the languages able to deal with infinitely many inputs. Sometimes, with languages like C or JavaScript, we also pretend that the numeric types are &amp;quot;bigints&amp;quot;, meaning they can store arbitrarily large integers.&lt;/p&gt;&#xA;&lt;p&gt;It's also allowed to not pretend, and utilize integer overflow or even memory exhaustion. But in the latter case the memory or recursion limit usually destroys the answers ability to handle the infinitely many inputs correctly, thus the answer doesn't satisfy the challenge rules.&lt;/p&gt;&#xA;&lt;p&gt;Here are some other quick points:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If these types of answers would satisfy the rules, then there exists a &amp;quot;solution&amp;quot; to the halting problem in those languages.&lt;/li&gt;&#xA;&lt;li&gt;If the OP thinks that a semi-decision algorithm is fine they can either say that a solution will always exist or explicitly allow a semi-decision algorithm.&lt;/li&gt;&#xA;&lt;li&gt;A full-decision algorithm has the additional challenge of inventing and implementing a termination condition. The termination conditions often require deeper understanding of the problem and the mathematics behind it. A semi-decision algorithm is often nothing more than a simple brute force search. By relaxing the rules this interesting and fun part of the challenge is lost.&lt;/li&gt;&#xA;&lt;li&gt;One argument for accepting those kinds of answers is that for every set of inputs, there exists a amount of ram, etc. where the program will always give the correct answer. However, this imo. makes the ram limit part of the code, and thus you are actually submitting a whole bunch of programs, each with different ram limits, none of which individually can satisfy the requirements of the challenge.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-02-02T19:56:24.710" LastActivityDate="2022-02-02T19:56:24.710" CommentCount="3" CommunityOwnedDate="2022-02-01T18:18:15.003" ContentLicense="CC BY-SA 4.0" />
  <row Id="24414" PostTypeId="2" ParentId="2140" CreationDate="2022-02-02T08:56:35.157" Score="4" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242263/find-the-index-of-the-matching-parentheses-for-each-character&quot;&gt;Find the index of the matching parentheses for each character&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-02-03T05:18:44.323" LastActivityDate="2022-02-03T05:18:44.323" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24415" PostTypeId="1" AcceptedAnswerId="24436" CreationDate="2022-02-02T10:45:52.433" Score="7" ViewCount="191" Body="&lt;p&gt;I've often seen some questions tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt; that have some answer being image files, and they are often disagreements in the comments.&lt;/p&gt;&#xA;&lt;h3&gt;examples:&lt;/h3&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/137171/98630&quot;&gt;&lt;code&gt;Swiss flag (PNG)&lt;/code&gt;&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/136969/98630&quot;&gt;&lt;code&gt;Swiss flag (GIF)&lt;/code&gt;&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/85444/98630&quot;&gt;&lt;code&gt;Iceland flag&lt;/code&gt;&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/117693/98630&quot;&gt;&lt;code&gt;Carpet an airport&lt;/code&gt;&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/225453/98630&quot;&gt;&lt;code&gt;Minecraft tool&lt;/code&gt;&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/39926/98630&quot;&gt;&lt;code&gt;Super Mario&lt;/code&gt;&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/a/183338/98630&quot;&gt;&lt;code&gt;RGB colour grid&lt;/code&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Here's what comment section looks like (taken from the first example &lt;a href=&quot;https://codegolf.stackexchange.com/a/137171/98630&quot;&gt;&lt;code&gt;Swiss flag (PNG)&lt;/code&gt;&lt;/a&gt;):&lt;br&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/6ObHm.png&quot; width=&quot;500&quot; alt=&quot;Comment section screenshot&quot;/&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h3&gt;Note:&lt;/h3&gt;&#xA;&lt;p&gt;This question is not realy about SVG; while they are some disagreements, it seems like it's more accepted than bitmap files. This is probably due to the fact that it isn't binary, but XML, which is closer to code than a binary bitmap image is. So you can talk about it but this is not the main focus of the question.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I gathered the arguments for and against it from the comments and some of my research:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;For&lt;/th&gt;&#xA;&lt;th&gt;Against&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/tags/kolmogorov-complexity/info&quot;&gt;'s description&lt;/a&gt; mentions a complex string, which shortest representation might be to print it literally. If a &lt;strong&gt;literal string&lt;/strong&gt; is considered the &amp;quot;worst case solution&amp;quot; to a string based code-golf, a &lt;strong&gt;literal image&lt;/strong&gt; file could be considered a &amp;quot;worst case solution&amp;quot; to an image based code-golf. - &lt;a href=&quot;https://codegolf.stackexchange.com/users/61199&quot;&gt;Sunday&lt;/a&gt;, in &lt;a href=&quot;https://codegolf.stackexchange.com/a/117693/98630&quot;&gt;&lt;code&gt;Carpet an airport&lt;/code&gt;&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;strong&gt;PNG isn't a programming language&lt;/strong&gt;,  this &lt;strong&gt;isn't &amp;quot;drawing&amp;quot; anything&lt;/strong&gt;, it's just the pre-drawn output file handed out on a platter. That makes a profoundly &lt;strong&gt;un-interesting&lt;/strong&gt; submission. - &lt;a href=&quot;https://codegolf.stackexchange.com/users/1256&quot;&gt;Caleb&lt;/a&gt;, in &lt;a href=&quot;https://codegolf.stackexchange.com/a/137171/98630&quot;&gt;&lt;code&gt;Swiss flag (PNG)&lt;/code&gt;&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10426/98630&quot;&gt;Answering in &lt;strong&gt;non-programming languages&lt;/strong&gt; is &lt;strong&gt;allowed&lt;/strong&gt;&lt;/a&gt; on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/10421/98630&quot;&gt;Do submissions have to be answered with a programming language?&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;It could be &lt;strong&gt;compared&lt;/strong&gt; to a &lt;strong&gt;compiled code&lt;/strong&gt; (binary executable) which &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/260/98630&quot;&gt;users seems to agree&lt;/a&gt; on the fact that they &lt;strong&gt;shouldn't be valid answers&lt;/strong&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;It's kind of &lt;strong&gt;interesting&lt;/strong&gt; that a generic commonly used image format like PNG can come close in size to the solutions using &lt;strong&gt;code tailor-made&lt;/strong&gt; to this particular image - &lt;a href=&quot;https://codegolf.stackexchange.com/users/64380&quot;&gt;Anonymous&lt;/a&gt;, in &lt;a href=&quot;https://codegolf.stackexchange.com/a/137171/98630&quot;&gt;&lt;code&gt;Swiss flag (PNG)&lt;/code&gt;&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;This could give an &lt;strong&gt;unfair&lt;/strong&gt; advantage, especially on pictures with a &lt;strong&gt;small colo(u)r palette&lt;/strong&gt;. While I haven't seen any submission that wins, most of them are pretty &lt;strong&gt;close&lt;/strong&gt; to first place&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;" OwnerUserId="98630" LastActivityDate="2022-02-07T22:44:00.103" Title="Should graphical-output challenges accept straight up image files by default?" Tags="|discussion|rules|kolmogorov-complexity|graphical-output|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24417" PostTypeId="2" ParentId="2140" CreationDate="2022-02-02T16:07:19.950" Score="0" Body="&lt;h1&gt;Where is the line&lt;/h1&gt;&#xA;&lt;p&gt;Given a grid consisting of &lt;code&gt;+&lt;/code&gt; and a constant &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt;, change all the &lt;code&gt;+&lt;/code&gt; to &lt;code&gt;x&lt;/code&gt;, where the center of the &lt;code&gt;+&lt;/code&gt; is above the graph &lt;span class=&quot;math-container&quot;&gt;\$y=mx\$&lt;/span&gt;.&lt;br /&gt;&#xA;Considering:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The origin is the bottom-left corner of bottom-left &lt;code&gt;+&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;One unit is the width=height of a plus&lt;/li&gt;&#xA;&lt;li&gt;The center of the bottom-left plus is located in &lt;span class=&quot;math-container&quot;&gt;\$(0.5, 0.5)\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input can be given as an iterable, string or a binary matrix.&lt;/li&gt;&#xA;&lt;li&gt;Instead of a grid, input can also be the &lt;span class=&quot;math-container&quot;&gt;\$height\$&lt;/span&gt; and the &lt;span class=&quot;math-container&quot;&gt;\$width\$&lt;/span&gt; of the matrix.&lt;/li&gt;&#xA;&lt;li&gt;Output must consist of &lt;code&gt;+&lt;/code&gt; and &lt;code&gt;x&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard Loopholes apply&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;[In]:&#xA;++&#xA;++&#xA;0&#xA;&#xA;[Out]:&#xA;xx&#xA;xx&#xA;&#xA;[In]:&#xA;++&#xA;++&#xA;1&#xA;&#xA;[Out]:&#xA;xx&#xA;x+&#xA;&#xA;[In]:&#xA;+++++&#xA;+++++&#xA;+++++&#xA;+++++&#xA;2&#xA;&#xA;[Out]:&#xA;xx+++&#xA;xx+++&#xA;x++++&#xA;x++++&#xA;+++++&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;p&gt;Did I explain it good enough?&lt;/p&gt;&#xA;" OwnerUserId="96037" LastActivityDate="2022-02-02T16:07:19.950" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24418" PostTypeId="2" ParentId="2140" CreationDate="2022-02-02T21:04:52.050" Score="1" Body="&lt;h1&gt;Quicksand&lt;/h1&gt;&#xA;&lt;p&gt;In this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt; challenge, you take a positive integer as input, which represents the height of a sand pile, located at (0,0) on an infinite square grid. For example, if our input is &lt;code&gt;123&lt;/code&gt;, the sand grid looks initially like this:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\begin{matrix}&#xA;0 &amp;amp; 0 &amp;amp; 0 \\&#xA;0 &amp;amp;123&amp;amp; 0 \\&#xA;0 &amp;amp; 0 &amp;amp; 0&#xA;\end{matrix}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Now, piles of sand are unstable, so they topple if their height is 4 or greater. When sand piles topple, they send sand equally in all four directions, but due to the quantum nature of sand, the amount sent is an integer. Or in other words, if there is a pile of height &lt;code&gt;n&lt;/code&gt;, it sends sand as follows:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\begin{matrix}&#xA;0 &amp;amp; \lfloor\frac{n}{4}\rfloor &amp;amp; 0 \\&#xA;\lfloor\frac{n}{4}\rfloor &amp;amp; n\mod 4 &amp;amp; \lfloor\frac{n}{4}\rfloor \\&#xA;0 &amp;amp; \lfloor\frac{n}{4}\rfloor &amp;amp; 0&#xA;\end{matrix}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;This means that sandpiles evolve step by step. For example, if we have this initial position, here's how the sandpiles evolve.&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\begin{matrix}&#xA;0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 \\&#xA;0 &amp;amp; 0 &amp;amp; 6 &amp;amp; 0 \\&#xA;0 &amp;amp; 2 &amp;amp; 7 &amp;amp; 0 \\&#xA;0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0&#xA;\end{matrix}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\begin{matrix}&#xA;0 &amp;amp; 0 &amp;amp; 1 &amp;amp; 0 \\&#xA;0 &amp;amp; 1 &amp;amp; 3 &amp;amp; 1 \\&#xA;0 &amp;amp; 3 &amp;amp; 4 &amp;amp; 1 \\&#xA;0 &amp;amp; 0 &amp;amp; 1 &amp;amp; 0&#xA;\end{matrix}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\begin{matrix}&#xA;0 &amp;amp; 0 &amp;amp; 1 &amp;amp; 0 \\&#xA;0 &amp;amp; 1 &amp;amp; 4 &amp;amp; 1 \\&#xA;0 &amp;amp; 4 &amp;amp; 0 &amp;amp; 2 \\&#xA;0 &amp;amp; 0 &amp;amp; 2 &amp;amp; 0&#xA;\end{matrix}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\begin{matrix}&#xA;0 &amp;amp; 0 &amp;amp; 2 &amp;amp; 0 \\&#xA;0 &amp;amp; 3 &amp;amp; 0 &amp;amp; 2 \\&#xA;1 &amp;amp; 0 &amp;amp; 2 &amp;amp; 2 \\&#xA;0 &amp;amp; 1 &amp;amp; 2 &amp;amp; 0&#xA;\end{matrix}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Now, since all the sandpiles have less than 4 sand, this sand grid is stable.&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to take an positive integer &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt; as input, and output the eventually stable grid that the following initial position evolves to:&lt;/p&gt;&#xA;&lt;h2&gt;Todo add cool fractals&lt;/h2&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\begin{matrix}&#xA;0 &amp;amp; 0 &amp;amp; 0 \\&#xA;0 &amp;amp; i &amp;amp; 0 \\&#xA;0 &amp;amp; 0 &amp;amp; 0&#xA;\end{matrix}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;(Note that the grid is still infinitely big)&lt;/p&gt;&#xA;&lt;p&gt;The output format should be the following: &amp;quot;width;data&amp;quot;, where width is an odd number representing the width a square that bounds the eventually stable arrangement (width doesn't have to be the smallest possible). Next is the raw data, which is just the square section of the grid flattened, and the numbers are represented with digits &amp;quot;0123&amp;quot;&lt;/p&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-02-03T20:56:27.217" LastActivityDate="2022-02-03T20:56:27.217" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24419" PostTypeId="2" ParentId="2140" CreationDate="2022-02-02T21:29:38.303" Score="2" Body="&lt;h1&gt;Play a chess-like game&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to build a program that plays chess.  However, it doesn't know how the pieces move before the game begins.  In fact, each time it sits down at the board the pieces are different!&lt;/p&gt;&#xA;&lt;h2&gt;The game&lt;/h2&gt;&#xA;&lt;p&gt;This game is played on a 6x6 board, looking roughly like:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;123451&#xA;pppppp&#xA;......&#xA;......&#xA;pppppp&#xA;123451&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Each game has a time control of 1+1 (1 minute, plus 1 second per move).  One piece (of 2345) is selected to be the king, and the game ends when any of the following occur:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A king is captured (a win for the capturing player)&lt;/li&gt;&#xA;&lt;li&gt;50 moves pass without a piece being captured or a pawn moving (a draw)&lt;/li&gt;&#xA;&lt;li&gt;One player runs out of time or attempts an invalid move. (a loss for that player)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;The pieces&lt;/h2&gt;&#xA;&lt;h4&gt;Pawns&lt;/h4&gt;&#xA;&lt;p&gt;Each player has 6 pawns.  Pawns have at least one possible capturing move and at least one non-capturing move that moves it forward.  If a pawn moves into a space on the last rank, it may promote into any non-king piece.  I've listed white's moves; blacks are mirrored.  Pawns may have any or all of the following:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Capturing or non-capturing&#xA;&#xA;.x.&#xA;... x.x .x. ...&#xA;.p. .p. .p. xpx&#xA;&#xA;Capturing only&#xA;&#xA;.p. .p.&#xA;x.x .x.&#xA;&#xA;Example:&#xA;In a game, pawns may be able to move to&#xA;&#xA;...&#xA;.x.&#xA;xpx&#xA;&#xA;And capture pieces in&#xA;&#xA;x.x&#xA;.p.&#xA;xxx&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h4&gt;Major Pieces&lt;/h4&gt;&#xA;&lt;p&gt;The major pieces are more varied, but all of their moves are symmetric.  If a major piece can move to a space, it can also capture on that space.  Possible moves include (not necessarily exhaustive):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;.x. x.x&#xA;xPx .P.&#xA;.x. x.x&#xA;&#xA;These moves may or may not include the ability to jump over pieces in between:&#xA;&#xA;.x.x. x.x.x&#xA;x...x .....&#xA;..P.. x.P.x&#xA;x...x .....&#xA;.x.x. x.x.x&#xA;&#xA;These moves extend across the whole board:&#xA;&#xA;.x... x.x.. P....&#xA;xPxxx .P... ..x..&#xA;.x... x.x.. .x..x&#xA;.x... ...x. .....&#xA;.x... ....x ..x..&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Each piece will have at least one of these (or others - no guarantees will be made that other movesets will not be included).  A piece can have any number of these sets of moves.  The two &amp;quot;1&amp;quot;s will have the same moves.&lt;/p&gt;&#xA;&lt;h2&gt;The controller&lt;/h2&gt;&#xA;&lt;p&gt;I haven't built this; I want to gauge interest first.&lt;/p&gt;&#xA;&lt;p&gt;A potential spec for the controller (have to work out how it communicates):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;// Return a list of possible moves in that game state&#xA;// If piece is passed (a 2-element array - [x,y]) then only moves which that piece can make are returned&#xA;getMoves(board, player, piece = null) =&amp;gt; board[]&#xA;&#xA;// Returns the number of milliseconds that player has remaining on their clock.&#xA;getTime(player) =&amp;gt; float&#xA;&#xA;// Move the piece at origin to destination&#xA;makeMove(origin, destination, promotion = null) =&amp;gt; void&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;The tournament&lt;/h2&gt;&#xA;&lt;p&gt;There will be a round-robin tournament played, with as many rounds as possible.  Each game will have its pieces randomized at the start, then the bots will play a game as white and a game as black (using the same pieces).&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Does this sound like an interesting challenge (would it be more than just &amp;quot;fork stockfish&amp;quot;)?&lt;/li&gt;&#xA;&lt;li&gt;Would it be alright to restrict this to javascript?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="82199" LastEditorUserId="82199" LastEditDate="2022-02-02T22:16:58.717" LastActivityDate="2022-02-02T22:16:58.717" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24420" PostTypeId="2" ParentId="2140" CreationDate="2022-02-02T22:11:11.730" Score="2" Body="&lt;h2&gt;Round it up Nicely&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;When I work out, I often don't have a good plan for how many times to repeat an exercise, but in the interest of pushing myself I always keep going until I've done a &amp;quot;nice&amp;quot; number. Multiples of 5 are ideal, but multiples of 4 are acceptable too--unless they're 1 less than a multiple of 5, in which case I may as well do one more, or they're 1 more than a multiple of 5, in which case why didn't I already stop?&lt;/p&gt;&#xA;&lt;h3&gt;The challenge&lt;/h3&gt;&#xA;&lt;p&gt;Given an integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and a descending, pairwise coprime list of integers &lt;span class=&quot;math-container&quot;&gt;\$k_1, k_2, ..., k_m\$&lt;/span&gt;, output the least integer &lt;span class=&quot;math-container&quot;&gt;\$x \geq n\$&lt;/span&gt; which is a multiple of some &lt;span class=&quot;math-container&quot;&gt;\$k_i\$&lt;/span&gt; but is not 1 more or less than any multiple of any &lt;span class=&quot;math-container&quot;&gt;\$k_j\$&lt;/span&gt; with &lt;span class=&quot;math-container&quot;&gt;\$j&amp;lt;i\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;n    k[1]...k[m]                        result&#xA;1    [5, 4]                             5&#xA;15   [5, 4]                             15&#xA;12   [5, 4]                             12&#xA;16   [5, 4]                             20&#xA;7    [5, 4]                             8&#xA;996  [5, 4]                             1000&#xA;1    [11, 7]                            7&#xA;15   [11, 7]                            22&#xA;133  [11, 7]                            140&#xA;1    [5, 3, 2]                          3&#xA;6    [5, 3, 2]                          10&#xA;6    [5, 3]                             10&#xA;11   [5, 3, 2]                          12&#xA;1    [100, 49, 9]                       9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Would it be more interesting without the descending/coprime guarantees?&lt;/li&gt;&#xA;&lt;li&gt;Test cases are a WIP, but any additional suggestions?&lt;/li&gt;&#xA;&lt;li&gt;Better title?&lt;/li&gt;&#xA;&lt;li&gt;[How] should I note that the 1-above exclusion only matters if it would exclude the input itself? Should the task not be &amp;quot;rounding up&amp;quot; to make it more relevant?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="85334" LastEditorUserId="85334" LastEditDate="2022-06-30T06:27:57.767" LastActivityDate="2022-06-30T06:27:57.767" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24424" PostTypeId="2" ParentId="2140" CreationDate="2022-02-04T05:39:28.293" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242382/bracket-depth-list&quot;&gt;Bracket Depth List&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-02-05T05:02:36.667" LastActivityDate="2022-02-05T05:02:36.667" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24425" PostTypeId="2" ParentId="2140" CreationDate="2022-02-04T05:53:27.953" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242453/retaining-water&quot;&gt;Retaining Water&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-02-07T07:03:23.630" LastActivityDate="2022-02-07T07:03:23.630" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24426" PostTypeId="2" ParentId="2140" CreationDate="2022-02-04T07:54:51.993" Score="1" Body="&lt;h2&gt;Word Guess KOTH&lt;/h2&gt;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://www.powerlanguage.co.uk/wordle/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wordle&lt;/a&gt; and &lt;a href=&quot;https://swag.github.io/evil-wordle/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Evil Wordle&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;A King of the Hill game where you must write a bot which acts as both Guesser and Judge of a word guessing game. Each bot will play a match against all the other bots.  Each match will consist of 10 rounds alternating between judge and guesser.  A bot's score for the match is the number of guesses the opponent made minus the number of guesses it made.  Higher is better. Bot with the highest average &lt;em&gt;[or total?]&lt;/em&gt; score is KOTH.&lt;/p&gt;&#xA;&lt;p&gt;The game is as follows:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The Judge and Guesser are both provided with the same dictionary of N letter words.&lt;/li&gt;&#xA;&lt;li&gt;The Judge selects an answer from the dictionary.&lt;/li&gt;&#xA;&lt;li&gt;The Guesser makes a guess. The candidate word must be contained in the dictionary.&lt;/li&gt;&#xA;&lt;li&gt;The Judge is given the guess, and provides a score according to the following rules.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The score is a string of N characters from the set ['G','O','B'], corresponding to the guessed letters&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A 'G' indicates that the guessed letter is correct for that position. Great&lt;/li&gt;&#xA;&lt;li&gt;A 'O' signifies that the guessed letter is in that answer but not that position. Out-of-place.&lt;/li&gt;&#xA;&lt;li&gt;A 'B' indicates that the guessed letter is not in the answer.  Bad.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If a letter appears in the guess more than once, there will never be more non-'B' results than instances of that letter in the answer.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;for example if the answer is 'ruler' and the guess is 'belle', the score will be 'BOGBB'.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;ol start=&quot;4&quot;&gt;&#xA;&lt;li&gt;Steps 2 and 3 continue until the score is all 'G's.&lt;/li&gt;&#xA;&lt;li&gt;The the number of guesses is added to the Judge's score and subtracted from the Guesser's.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Note that the judge is free to modify the answer after each guess, as long as the new answer is consistent with all the previous guesses.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;An example scoring function in Python is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;def count_score(truth, trial):&#xA;    score = [None]*len(truth)&#xA;    allow = truth&#xA;    for index,value in enumerate(trial):&#xA;        if truth[index]==value:&#xA;            score[index]='G'&#xA;            allow=allow.replace(value,'',1)&#xA;        for index,value in enumerate(trial):&#xA;        if not score[index]:&#xA;            if value in allow:&#xA;                score[index]='O'&#xA;                allow=allow.replace(value,'',1)&#xA;            else:&#xA;                score[index]='B'&#xA;    return ''.join(score)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Entries must provide a bot command that can be called from the command line and prints the required outputs to stdout, separated by newlines.&lt;/p&gt;&#xA;&lt;p&gt;For all the use cases below, &lt;code&gt;codex&lt;/code&gt; is a filepath to a dictionary of legal words, and &lt;code&gt;token&lt;/code&gt; is a&#xA;string used by a bot to maintain state. It must not be empty. The token generated in any round is passed back to the same bot in the following round.  The opponent bot will never see your token. Tokens are not retained from one round to the next.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;arguments --&amp;gt; results&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;codex &amp;quot;judge&amp;quot; --&amp;gt; token&lt;/code&gt;&#xA;Judge initialization. Returns a token.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;codex &amp;quot;judge&amp;quot; token trial --&amp;gt; token score&lt;/code&gt;&#xA;Judge will score the &lt;code&gt;trial&lt;/code&gt; word.  &lt;code&gt;score&lt;/code&gt; is constructed according to the rules above.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;codex &amp;quot;guess&amp;quot; --&amp;gt; token trial&lt;/code&gt;&#xA;Guesser makes initial &lt;code&gt;trial&lt;/code&gt; guess.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;codex &amp;quot;guess&amp;quot; token score - token trial&lt;/code&gt;&#xA;Guesser gets &lt;code&gt;score&lt;/code&gt; from previous guess. Returns new &lt;code&gt;trial&lt;/code&gt; guess.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example Bot:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;import random,sys,re&#xA;&#xA;def begin_offer(codex):&#xA;    words = [l.strip() for l in open(codex)]&#xA;    return [random.choice(words)]&#xA;&#xA;def score_trial(token, trial):&#xA;    return token, count_score(token,trial)&#xA;&#xA;def first_guess(codex):&#xA;    words = sorted([l.strip() for l in open(codex)])&#xA;    guess = words[0]&#xA;    return (guess, guess)&#xA;&#xA;def later_guess(codex, prior, score):&#xA;    words = sorted([l.strip() for l in open(codex)])&#xA;    index = words.index(prior)&#xA;                  &#xA;    for place,value in enumerate(score):&#xA;        if value != 'G':&#xA;            while words[index][place]==prior[place]:&#xA;                index+=1&#xA;            break&#xA;    guess = words[index]&#xA;    return guess,guess&#xA;&#xA;&#xA;if __name__ == &amp;quot;__main__&amp;quot;:&#xA;    codex,style,*extra = sys.argv[1:]&#xA;    if style == 'judge':&#xA;        if not extra:&#xA;            result = begin_offer(codex)&#xA;        else:&#xA;            result = score_trial(*extra)&#xA;    elif style == 'guess':&#xA;        if not extra:&#xA;            result = first_guess(codex)&#xA;        else:&#xA;            result = later_guess(codex,*extra)&#xA;&#xA;    print(&amp;quot;\n&amp;quot;.join(result))&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Match Runner&lt;/strong&gt; (in progress)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;import sys,subprocess&#xA;def reply_split(reply):&#xA;    return [bites.decode('ascii').strip() for bites in reply.split()]&#xA;&#xA;if __name__ == &amp;quot;__main__&amp;quot;:&#xA;    judge,guess = sys.argv[1:]&#xA;&#xA;    reply = subprocess.check_output([judge, &amp;quot;words.txt&amp;quot;, &amp;quot;judge&amp;quot;])&#xA;    judge_token,*trash = reply_split(reply)&#xA;&#xA;    reply = subprocess.check_output([guess, &amp;quot;words.txt&amp;quot;, &amp;quot;guess&amp;quot;])&#xA;    guess_token,trial = reply_split(reply)&#xA;&#xA;    for round in range(10):&#xA;&#xA;        print(trial)&#xA;    &#xA;        reply = subprocess.check_output([judge, &amp;quot;words.txt&amp;quot;, &amp;quot;judge&amp;quot;, judge_token, trial])&#xA;        judge_token,score,*trash = reply_split(reply)&#xA;&#xA;        print(score, &amp;quot;\n&amp;quot;)&#xA;        if score == 'GGGGG':&#xA;            print(&amp;quot;{} guessed {}'s word in {} rounds&amp;quot;.format(guess, judge, round+1))&#xA;            break&#xA;        &#xA;        reply = subprocess.check_output([guess, &amp;quot;words.txt&amp;quot;, &amp;quot;guess&amp;quot;, guess_token, score])&#xA;        guess_token,trial,*trash = reply_split(reply)&#xA;&#xA;    print(round+1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="152" LastActivityDate="2022-02-04T07:54:51.993" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24427" PostTypeId="2" ParentId="24397" CreationDate="2022-02-04T08:06:14.623" Score="14" Body="&lt;h1&gt;Let's make both &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-scoring&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-scoring&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-scoring&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-validating&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-validating&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-validating&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-scoring&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-scoring&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-scoring&lt;/a&gt; as a scoring criterion tag&lt;/h2&gt;&#xA;&lt;p&gt;The description of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-scoring&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-scoring&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-scoring&lt;/a&gt; as proposed is IMO well-defined enough to be a scoring criterion tag on its own, and I agree that there is a good potential for more interesting challenges of this type.&lt;/p&gt;&#xA;&lt;p&gt;As a refinement tag for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, I think it's better to keep it focused. So your &amp;quot;marginal example 1&amp;quot; doesn't fall into &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-scoring&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-scoring&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-scoring&lt;/a&gt;: each submission does output the score, but it doesn't take itself as input to produce the score, so it is not &lt;em&gt;self-scoring&lt;/em&gt; by definition. (Similarly to &amp;quot;Output your score&amp;quot; challenges, IMO it's better classified as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-referential&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-referential&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-referential&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; as it already is.)&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-validating&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-validating&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-validating&lt;/a&gt; as a non-scoring criterion tag&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-validating&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-validating&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-validating&lt;/a&gt; is a nice tag candidate too for reasons OP mentioned, but naturally it is a &lt;em&gt;validity criterion&lt;/em&gt; tag rather than &lt;em&gt;scoring criterion&lt;/em&gt;. I think it can replace &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; for the challenges mentioned (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; should stay IMO).&lt;/p&gt;&#xA;&lt;p&gt;Also, since &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-scoring&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-scoring&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-scoring&lt;/a&gt; would be a scoring criterion and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-validating&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-validating&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-validating&lt;/a&gt; wouldn't, merging the two doesn't quite make sense.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2022-02-04T08:06:14.623" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24428" PostTypeId="2" ParentId="2140" CreationDate="2022-02-04T11:13:29.393" Score="3" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242578/cubax-folding-game&quot;&gt;Cubax Folding Game&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-02-09T00:19:39.667" LastActivityDate="2022-02-09T00:19:39.667" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24430" PostTypeId="2" ParentId="2140" CreationDate="2022-02-05T20:24:07.463" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242713/all-sequences-as-substrings&quot;&gt;All sequences as substrings&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-02-11T09:40:54.510" LastActivityDate="2022-02-11T09:40:54.510" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24431" PostTypeId="2" ParentId="13908" CreationDate="2022-02-06T00:36:05.030" Score="1" Body="&lt;h1&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/open-ended-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; rel=&quot;tag&quot;&gt;open-ended-function&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Four years after this was asked, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/open-ended-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; rel=&quot;tag&quot;&gt;open-ended-function&lt;/a&gt; was created in response to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/22136/56656&quot;&gt;this question&lt;/a&gt; about cleaning up the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;function&amp;#39;&quot; rel=&quot;tag&quot;&gt;function&lt;/a&gt; tag.  It is a slightly broader version of the proposed tag.&lt;/p&gt;&#xA;&lt;p&gt;The tag seems to be doing just fine.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2022-02-06T00:36:05.030" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24432" PostTypeId="2" ParentId="202" CreationDate="2022-02-06T01:08:49.260" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://dso.surge.sh&quot; rel=&quot;nofollow noreferrer&quot;&gt;Do Stuff Online&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;DSO is an online interpreter service I made that runs entirely in your browser. It's a complete work in progress, and mostly runs JS-based languages although I've managed to get some Python-related stuff working too.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Free to use&lt;/li&gt;&#xA;&lt;li&gt;Runs in your browser&lt;/li&gt;&#xA;&lt;li&gt;Dynamically loads interpreters from their sources for the latest version&lt;/li&gt;&#xA;&lt;li&gt;Doesn't have &lt;a href=&quot;https://ato.pxeger.com/legal&quot; rel=&quot;nofollow noreferrer&quot;&gt;an eight-page ToS&lt;/a&gt;, or any ToS in fact. Mine all the cryptocurrency you want, it's your electricity.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/chunkybanana/do-stuff-online&quot; rel=&quot;nofollow noreferrer&quot;&gt;Open-source&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Well-mantained, although there just aren't that many languages that can be used.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Languages&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;ngn/APL&lt;/li&gt;&#xA;&lt;li&gt;brainfuck&lt;/li&gt;&#xA;&lt;li&gt;BQN&lt;/li&gt;&#xA;&lt;li&gt;Deadfish + variants&lt;/li&gt;&#xA;&lt;li&gt;Fishing&lt;/li&gt;&#xA;&lt;li&gt;Halfwit&lt;/li&gt;&#xA;&lt;li&gt;Headass&lt;/li&gt;&#xA;&lt;li&gt;HQ9+ and variants&lt;/li&gt;&#xA;&lt;li&gt;in floop&lt;/li&gt;&#xA;&lt;li&gt;Japt&lt;/li&gt;&#xA;&lt;li&gt;K (oK)&lt;/li&gt;&#xA;&lt;li&gt;Pip&lt;/li&gt;&#xA;&lt;li&gt;Plumber&lt;/li&gt;&#xA;&lt;li&gt;Python 3&lt;/li&gt;&#xA;&lt;li&gt;Risky&lt;/li&gt;&#xA;&lt;li&gt;rSNBATWPL&lt;/li&gt;&#xA;&lt;li&gt;S10K&lt;/li&gt;&#xA;&lt;li&gt;;#&lt;/li&gt;&#xA;&lt;li&gt;Tarfish&lt;/li&gt;&#xA;&lt;li&gt;Ultrarisky&lt;/li&gt;&#xA;&lt;li&gt;Unsure&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-06-08T11:59:11.877" LastActivityDate="2022-06-08T11:59:11.877" CommentCount="1" CommunityOwnedDate="2022-02-06T01:08:49.260" ContentLicense="CC BY-SA 4.0" />
  <row Id="24433" PostTypeId="2" ParentId="2140" CreationDate="2022-02-06T05:43:52.997" Score="-1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242582/mahjong-checker&quot;&gt;Mahjong Checker&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-02-09T04:47:34.413" LastActivityDate="2022-02-09T04:47:34.413" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24436" PostTypeId="2" ParentId="24415" CreationDate="2022-02-06T11:23:11.640" Score="13" Body="&lt;p&gt;The thing is that not all image formats are created equal.  Some are just straightforward uncompressed streams of pixels, and there is basically nothing you can do to golf those down.  However if your format uses a compression algorithm, for example PNG, it is possible to hand tailor your input to exploit the compression algorithm.  Even further down the line are formats like SVG (mentioned in the question), which encode vector graphics rather than a raster image.  SVG golf is extremely non-trivial, you have to work with geometric reasoning and writing an SVG is much more like writing in a programming language than an image.&lt;/p&gt;&#xA;&lt;p&gt;However there's a big difference between what is possible and what is done.  Just because you can in theory write an interesting PNG answer doesn't mean that every PNG answer is interesting. I certainly agree that just uploading a plain, un-tampered, PNG as your submission is boring.  It doesn't require any effort at all.  It's not clever or fun.&lt;/p&gt;&#xA;&lt;p&gt;There's not really an easy way to tease apart the interesting answers from the uninteresting ones.  Or the interesting formats from the uninteresting ones.  You say this question is not about SVG, but &lt;em&gt;why?&lt;/em&gt; it is an image format.  It seems you agree that SVG is more interesting, but who is going to make that call for every format?  We already have an issue with unnecessary meta-cruft and rules.&lt;/p&gt;&#xA;&lt;p&gt;It's just subjective.&lt;/p&gt;&#xA;&lt;p&gt;But luckily we have a tool for that! We can vote on answers.  If you think an answer is boring you can downvote it.  If you think it's really interesting or shows high effort you can upvote it.&lt;/p&gt;&#xA;&lt;p&gt;So I don't think there is any good reason to ban these.  It doesn't actually achieve anything.  Boring answers happen all the time no matter how many rules we have.  But banning them blocks potentially interesting answers.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-02-07T22:44:00.103" LastActivityDate="2022-02-07T22:44:00.103" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24438" PostTypeId="2" ParentId="2140" CreationDate="2022-02-06T15:30:02.013" Score="0" Body="&lt;h1&gt;The Futuristic Battle Royale&lt;/h1&gt;&#xA;&lt;p&gt;After a five-year hiatus, I am interested in extending &lt;a href=&quot;https://codegolf.stackexchange.com/questions/104896/the-futuristic-gun-duel&quot;&gt;The Futuristic Gun Duel&lt;/a&gt; to a battle royale format. If this is not a bad idea, I will propose some rules and then start coding using some JS framework that uses WebWorkers. The primary motivation is that this should significantly change the strategy.&lt;/p&gt;&#xA;" OwnerUserId="11933" LastActivityDate="2022-02-06T15:30:02.013" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24440" PostTypeId="2" ParentId="2140" CreationDate="2022-02-07T04:06:47.230" Score="0" Body="&lt;h1&gt;Iterate over pairs of nonnegative integers&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/open-ended-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; rel=&quot;tag&quot;&gt;open-ended-function&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Find and implement an iteration over the set of pairs of nonnegative integers (&lt;span class=&quot;math-container&quot;&gt;\$\mathbb N_0^2\$&lt;/span&gt;).&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(0, 0) (0, 1) (0, 2) (0, 3) ...&#xA;(1, 0) (1, 1) (1, 2) (1, 3) ...&#xA;(2, 0) (2, 1) (2, 2) (2, 3) ...&#xA;(3, 0) (3, 1) (3, 2) (3, 3) ...&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For example, diagonalization:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(0, 0), (0, 1), (1, 0), (0, 2), (1, 1), (2, 0), (0, 3), (1, 2), (2, 1), (3, 0), ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You must specify which iteration your answer uses. You must specify if your answer is 0 or 1-indexed. Your code must be &lt;em&gt;deterministic&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; challenge. You may...&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take a positive integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and output the first &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; values.&lt;/li&gt;&#xA;&lt;li&gt;Take a positive integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and output the value for &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Take no input and output values indefinitely.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, so the smallest code as measured in bytes wins. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; apply.&lt;/p&gt;&#xA;" OwnerUserId="78186" LastEditorUserId="78186" LastEditDate="2022-02-07T23:08:26.033" LastActivityDate="2022-02-07T23:08:26.033" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24442" PostTypeId="2" ParentId="2140" CreationDate="2022-02-07T17:11:29.133" Score="3" Body="&lt;h1&gt;Happy new year string builder&lt;/h1&gt;&#xA;&lt;p&gt;Posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/242683/happy-new-year-string-builder&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="106710" LastEditorUserId="106710" LastEditDate="2022-02-10T17:13:28.887" LastActivityDate="2022-02-10T17:13:28.887" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24443" PostTypeId="2" ParentId="2140" CreationDate="2022-02-08T03:41:41.897" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242702/find-my-m%c4%81ori-pronouns&quot;&gt;Find my Māori pronouns&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-02-11T03:14:45.563" LastActivityDate="2022-02-11T03:14:45.563" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24444" PostTypeId="2" ParentId="2140" CreationDate="2022-02-08T13:19:19.857" Score="0" Body="&lt;h1&gt;Loopless unending program&lt;/h1&gt;&#xA;&lt;p&gt;Your task is simple: Make a program in your language of choice that never exits. However, you are forbidden to use any looping constructs (&lt;code&gt;for&lt;/code&gt;, &lt;code&gt;while&lt;/code&gt;, etc). in your source. You may use any other instruction in your language to accomplish this goal.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer wins.&lt;/p&gt;&#xA;" OwnerUserId="108218" LastActivityDate="2022-02-08T13:19:19.857" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24445" PostTypeId="2" ParentId="2140" CreationDate="2022-02-08T17:28:55.043" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/242783&quot;&gt;Generate all groupings&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-02-13T09:02:10.923" LastActivityDate="2022-02-13T09:02:10.923" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24448" PostTypeId="2" ParentId="2140" CreationDate="2022-02-09T04:01:28.553" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/242780/107561&quot;&gt;posted&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="107561" LastEditorUserId="97857" LastEditDate="2022-02-13T09:10:09.670" LastActivityDate="2022-02-13T09:10:09.670" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24449" PostTypeId="2" ParentId="2140" CreationDate="2022-02-09T09:27:16.260" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243329/ragged-index-of&quot;&gt;Ragged index of&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-02-24T16:22:00.593" LastActivityDate="2022-02-24T16:22:00.593" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24450" PostTypeId="2" ParentId="2140" CreationDate="2022-02-09T10:06:33.777" Score="0" Body="&lt;h1&gt;Will the dominoes topple?&lt;/h1&gt;&#xA;&lt;p&gt;Your input contains a list of positive integers representing the height of a row of dominoes. As many of us know, when you have a row of dominoes and push the first one, the rest will topple in a chain reaction. But if the next domino is too big, it will not fall. This depends on the shape of the domino, so in addition to the list, your program will also receive a positive rational number &lt;span class=&quot;math-container&quot;&gt;\$r\$&lt;/span&gt;, so that domino &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; will topple domino &lt;span class=&quot;math-container&quot;&gt;\$n+1\$&lt;/span&gt; iff &lt;span class=&quot;math-container&quot;&gt;\$h_n\cdot r&amp;gt;h_{n+1}\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$h_n\$&lt;/span&gt; is the height of a domino.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to decide if all the dominoes topple or if the chain reaction stops before the end.&lt;/p&gt;&#xA;&lt;p&gt;Your input is a non-empty list of positive integers (the height of the dominoes) and the rational number &lt;span class=&quot;math-container&quot;&gt;\$r\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You must use exact (integer) math, fp math is not allowed (though languages like Javascript and C can assume that the integer types are bigints).&lt;/p&gt;&#xA;&lt;p&gt;Use standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; output rules. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code per language wins.&lt;/p&gt;&#xA;&lt;h1&gt;Examples&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1,2,3], 5/2 -&amp;gt; True&#xA;[1,2,3], 3/2 -&amp;gt; False&#xA;[23,11,5,1], 1/2 -&amp;gt; True&#xA;[1,3,9,29], 10/3 -&amp;gt; True&#xA;[5,10,9,11], 2/1 -&amp;gt; False&#xA;[1,1], 1/1 -&amp;gt; False&#xA;[1], 1/1 -&amp;gt; True&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="84290" LastActivityDate="2022-02-09T10:06:33.777" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24451" PostTypeId="2" ParentId="2140" CreationDate="2022-02-09T12:03:49.187" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242769/is-it-a-bigger-regex&quot;&gt;Bigger regex?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-02-14T06:48:22.757" LastActivityDate="2022-02-14T06:48:22.757" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24452" PostTypeId="2" ParentId="5243" CreationDate="2022-02-09T13:53:13.900" Score="1" Body="&lt;h1&gt;500+500 Rep for beating my infinitely busy beavers&lt;/h1&gt;&#xA;&lt;p&gt;Specifically for an answer that outperforms my 5 state or 4 state answer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/241864/longest-infinite-loop-in-5-states&quot;&gt;this question&lt;/a&gt;. I &lt;em&gt;refuse&lt;/em&gt; to believe that they are optimal, however if they are, I'll give the respective bounties to whoever proves that they are optimal.&lt;/p&gt;&#xA;" OwnerUserId="84290" LastActivityDate="2022-02-09T13:53:13.900" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24453" PostTypeId="2" ParentId="2140" CreationDate="2022-02-09T14:13:29.147" Score="3" Body="&lt;h1&gt;The Con Man&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The bots start with a balance of 100 points each. Each round is a 1v1 between two bots. One bot is the Proposer and the other is the Receiver.&lt;/p&gt;&#xA;&lt;p&gt;P provides R with two numbers: think of it as a loan and repayment with interest. For example, P could propose (50, 60) which means that P wants to swap 50 points for 60 points with R. P also decides whether or to scam R. If R accepts, P can scam R by not upholding their end of the deal and instead taking the 50 points outright.&lt;/p&gt;&#xA;&lt;p&gt;The twist is, R can see the outcomes of past transactions of P to determine whether or not to trust P and accept the offer.&lt;/p&gt;&#xA;&lt;p&gt;The format of the tournament is that of a round robin where every bot will play P and R the same number of times against all opponents, in an unspecified order.&lt;/p&gt;&#xA;&lt;p&gt;Whichever bot ends up with the most points wins.&lt;/p&gt;&#xA;&lt;p&gt;The language of this challenge is JS.&lt;/p&gt;&#xA;&lt;p&gt;Format (in TypeScript):&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;type Bot = {&#xA;  R(&#xA;    offer: [number, number], // loan, repay&#xA;    opponentBalance: number,&#xA;    pastTransactions: [number, number, number][] // loan, repay, outcome (0 -&amp;gt; accept, 1 -&amp;gt; reject, 2 -&amp;gt; scam)&#xA;  ): boolean,&#xA;  P(&#xA;    opponentBalance: number,&#xA;    pastTransactions: [number, number, number][]&#xA;  ): [number, number, boolean] // [loan, repay, scam]&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Does this make for diverse enough strategies to be worthwhile?&lt;/li&gt;&#xA;&lt;li&gt;Should more or less information about the opponent be supplied to the players?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="103324" LastEditorUserId="103324" LastEditDate="2022-02-14T06:34:09.660" LastActivityDate="2022-02-14T06:34:09.660" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24454" PostTypeId="2" ParentId="2140" CreationDate="2022-02-09T23:37:27.317" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242726/triangle-tripler&quot;&gt;Triangle Tripler&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-02-11T13:24:18.620" LastActivityDate="2022-02-11T13:24:18.620" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24455" PostTypeId="2" ParentId="2140" CreationDate="2022-02-10T14:02:51.950" Score="0" Body="&lt;h1&gt;Output up to n sets of n characters randomly&lt;/h1&gt;&#xA;&lt;p&gt;Given a positive integer n&amp;gt;1, output a random number of n-character strings, ranging from 1 to n strings.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each string must differ from eachother by at least 1 char&lt;/li&gt;&#xA;&lt;li&gt;Each string must be n chars long&lt;/li&gt;&#xA;&lt;li&gt;Other than that, output strings do not have to be consistent in any way&lt;/li&gt;&#xA;&lt;li&gt;However, our strings must be clearly delimited&lt;/li&gt;&#xA;&lt;li&gt;A &amp;quot;random number&amp;quot; of strings means that each time the program is run with input n, non-deterministically, either 0, 1, 2, 3... up to n strings will be output&lt;/li&gt;&#xA;&lt;li&gt;For smaller inputs, each possible number of strings should be displayed within a reasonable number of trials (to avoid cheesy solutions where one number gets chosen with probability ~1)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;These are examples of valid outputs:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;input =&amp;gt; output&#xA;2 =&amp;gt; af 4b&#xA;2 =&amp;gt; 12 22&#xA;2 =&amp;gt; ba&#xA;3 =&amp;gt; WTF TL; VMB&#xA;3 =&amp;gt; 0l3&#xA;3 =&amp;gt; 04t &amp;lt;V&amp;lt;&#xA;3 =&amp;gt; bop bAm&#xA;3 =&amp;gt; AAA,AAB,AAC&#xA;3 =&amp;gt; &#xA;000&#xA;001&#xA;002&#xA;4 =&amp;gt;&#xA;w la&#xA;    &#xA;a,v &#xA; i  &#xA;3 =&amp;gt; [tip, wor, kf3]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;These would be invalid:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;input =&amp;gt; output&#xA;explanation of invalidity&#xA;&#xA;2 =&amp;gt; Ca Sa Da&#xA;too many strings output for this input&#xA;&#xA;2 =&amp;gt; asd sd mo&#xA;too many chars in a string for this input&#xA;&#xA;3 =&amp;gt; a Bad&#xA;too few chars in a string for this input&#xA;&#xA;4 =&amp;gt; 1234567890123456&#xA;strings are not clearly delimited&#xA;&#xA;3 =&amp;gt; 1   2   3   &#xA;strings are not clearly delimited&#xA;&#xA;3 =&amp;gt; A,B,BCD&#xA;strings are not clearly delimited&#xA;&#xA;3 =&amp;gt; CO CO LA&#xA;two or more strings are identical&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;p&gt;Is this too trivial? Also, can anything be phrased clearer (including the title)?&lt;/p&gt;&#xA;" OwnerUserId="107310" LastEditorUserId="107310" LastEditDate="2022-02-10T14:27:59.813" LastActivityDate="2022-02-10T14:27:59.813" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24456" PostTypeId="2" ParentId="2140" CreationDate="2022-02-11T00:50:33.883" Score="1" Body="&lt;h1&gt;Very simple auto battler&lt;/h1&gt;&#xA;&lt;p&gt;There are two players. Each player has a team of between 0 and 5 members. Each member has two relevant statistics: an attack score and a health score. These range from 1 to 50.&lt;/p&gt;&#xA;&lt;p&gt;Until at least one team runs out of members, you need to battle the lead member of each team against each other. (You can decide whether this is the first or last member of the team.) The two attacks are simultaneous, so it's possible that both members can defeat each other. Each attack reduces the foe's health by the user's attack. Once a team member's health is reduced to zero (or less) then it faints and takes no part in the rest of the battle.&lt;/p&gt;&#xA;&lt;p&gt;If both teams simultaneously run out of unfainted members then the result is a draw otherwise the team that still has unfainted members wins.&lt;/p&gt;&#xA;&lt;p&gt;Your task, given two teams in a reasonable format, e.g. list of tuples of &lt;code&gt;(health, attack)&lt;/code&gt;, is to write a program or function that outputs which (if any) team will win, using one of three specific values of your choice, e.g. &lt;code&gt;-1&lt;/code&gt;, &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;1&lt;/code&gt;, or &lt;code&gt;A&lt;/code&gt;, &lt;code&gt;B&lt;/code&gt; and &lt;code&gt;D&lt;/code&gt;. (Please describe the mapping of values in your answer.)&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##bY/RasMgGIXvfYrT3EwhC3awXZRl0LIH2H3IxS@xVEiMGEfo02eatE23DgR/zzmfHt05nHr7Mk2mc70P8GSbvmONPs5j0NRxsWNAmlCiquM8nkyrL9EibcYGLnO8CXyg1Zan8EwtXEHOadvw6g@yzfEqRY5/5VpE3uvw7e18CWMU319LMfX76Hxkke2fhjm@y3LQVTzciYot9QmRhUotqZJ1XHguodK4TZ9Uq0g30Rxv4fcScvkiFa53XIrFVw@@uvqJTtKl1VdLZ@2xx2jssMmYbhP@GDisgUHf2Z@exk02TT8&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 2 – Try It Online&quot;&gt;Sample team generator and battler&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2022-02-11T00:50:33.883" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24457" PostTypeId="1" AcceptedAnswerId="24504" CreationDate="2022-02-11T10:53:03.447" Score="13" ViewCount="204" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/new-years&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;new-years&amp;#39;&quot; rel=&quot;tag&quot;&gt;new-years&lt;/a&gt; tag's description is:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A new year's puzzle is any puzzle that is posted around the first day of any year that has to do with that specific year or calendars in some way.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This isn't really an objective tag. Its questions include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Time-based questions usually based around years&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/43045/eternal-2014-pcg-se-new-year-s-puzzle-2015&quot;&gt;Eternal 2014&lt;/a&gt;, which asks you to convert standard dates to a format where the year is never greater than 2014&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/43044/what-year-is-it&quot;&gt;What year is it?&lt;/a&gt;, whichs asks you to determine a year for a December calendar&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/66656/advance-happy-new-year-2016&quot;&gt;Advance Happy New Year, 2016!&lt;/a&gt;, which asks you to find the next year where New Year's day falls on the same weekday&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Questions that involve printing the year in some format with some sort of restrictions&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/43115/morse-the-new-year&quot;&gt;Morse the new year&lt;/a&gt;, which asks you to output a MIDI file of the Morse Code of &amp;quot;2016&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;The famous &lt;a href=&quot;https://codegolf.stackexchange.com/questions/17005/produce-the-number-2014-without-any-numbers-in-your-source-code&quot;&gt;2014 without numbers&lt;/a&gt;, which asks you to print 2014 without numbers.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/4486/write-a-program-that-always-outputs-2012-even-if-its-modified&quot;&gt;Write a program that outputs 2012 even if it's modified&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Questions with a year chucked in&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/105213/grow-till-its-2017&quot;&gt;Grow Till It's 2017&lt;/a&gt; - asks to create a program that grows until length 2017, which could be any number&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/43048/recycling-for-the-new-year&quot;&gt;Recycling for the New Year&lt;/a&gt; - asks you to rearrange a program to create one that outputs 2015&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/197679/write-a-program-that-sees-the-new-year-in-itself&quot;&gt;Write a program that sees the New Year in itself&lt;/a&gt; - Asks you to create a injection from strings to outputs such that it maps itself to 2020, which could be any number&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Various random stuff&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242683/happy-new-year-string-builder&quot;&gt;Happy new year string builder&lt;/a&gt;, which asks you to create a string  in a certain format such that the character code sum is a certain number&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/68320/mine-for-2016-in-bitcoins-pcg-se-new-years-puzzle-2016&quot;&gt;Mine for 2016 in bitcoin&lt;/a&gt;, which ask you to bruteforce SHA256 hashes until you find one containing &lt;code&gt;2016&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This seems to be more of a &lt;a href=&quot;https://stackoverflow.blog/2010/08/07/the-death-of-meta-tags/&quot;&gt;meta-tag&lt;/a&gt;. When you have a question tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; you know the question involves the use and manipulation of strings. But when you have a question tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/new-years&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;new-years&amp;#39;&quot; rel=&quot;tag&quot;&gt;new-years&lt;/a&gt; there's many things it could be about, as you can see above, and knowing that a question is related to the new year gives little to no useful information.&lt;/p&gt;&#xA;&lt;p&gt;So, what should we do with this?&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="68942" LastEditDate="2022-02-22T20:15:16.537" LastActivityDate="2022-02-22T20:15:16.537" Title="Should we get rid of [new-years]?" Tags="|discussion|feature-request|status-completed|tags|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24458" PostTypeId="1" AcceptedAnswerId="24459" CreationDate="2022-02-11T11:27:56.947" Score="0" ViewCount="82" Body="&lt;p&gt;I am looking for a way to type letters with dot only using keyboard (without any applications). For example, an US keyboard with international layout has letters like this &lt;code&gt;ç&lt;/code&gt;, but doesn't has like this &lt;code&gt;ẉ&lt;/code&gt;. How to type such letters?&lt;/p&gt;&#xA;" OwnerUserId="108170" LastActivityDate="2022-02-11T11:37:07.607" Title="How to type unicode letters?" Tags="|discussion|" AnswerCount="1" CommentCount="3" ClosedDate="2022-02-11T11:44:43.837" ContentLicense="CC BY-SA 4.0" />
  <row Id="24459" PostTypeId="2" ParentId="24458" CreationDate="2022-02-11T11:37:07.607" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://abrudz.github.io/lb/jelly&quot; rel=&quot;nofollow noreferrer&quot;&gt;This in-browser language bar&lt;/a&gt; allows you to type &lt;code&gt;ẉ&lt;/code&gt; as &lt;kbd&gt;.&lt;/kbd&gt;&lt;kbd&gt;w&lt;/kbd&gt;&lt;kbd&gt;Tab⭾&lt;/kbd&gt; or &lt;kbd&gt;w&lt;/kbd&gt;&lt;kbd&gt;.&lt;/kbd&gt;&lt;kbd&gt;Tab⭾&lt;/kbd&gt;.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2022-02-11T11:37:07.607" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24461" PostTypeId="2" ParentId="2140" CreationDate="2022-02-11T19:17:36.027" Score="0" Body="&lt;h1&gt;Challenge: Create a program that plays the game of the goose&lt;/h1&gt;&#xA;&lt;p&gt;In this golfing challenge, write a program that simulates &lt;a href=&quot;http://www-cs.canisius.edu/%7Esalley/SCA/Games/goose.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;the game of the goose.&lt;/a&gt; If you don't know how it works, here's a rough explanation of it:&lt;/p&gt;&#xA;&lt;p&gt;The game takes place on a grid of 63 cells:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/62WuM.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/62WuM.png&quot; alt=&quot;grid&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Each turn, the first player &lt;strong&gt;rolls&lt;/strong&gt; two dice and will *&lt;em&gt;advance&lt;/em&gt; (number rolled) cells. Then the second player will roll two dice and do the same as player 1.&lt;/p&gt;&#xA;&lt;p&gt;If a player lands on a &lt;strong&gt;goose&lt;/strong&gt;, he will move &lt;strong&gt;again&lt;/strong&gt; by the same number of cells.&lt;/p&gt;&#xA;&lt;p&gt;If a player lands on the &lt;strong&gt;bridge&lt;/strong&gt;, he will move to cell &lt;strong&gt;12&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If a player lands in the &lt;strong&gt;tavern&lt;/strong&gt;, he will skip &lt;strong&gt;2 turns&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If a player's first rolls are &lt;strong&gt;6 &amp;amp; 3&lt;/strong&gt;, he will go to cell &lt;strong&gt;26&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If a player lands in the &lt;strong&gt;well&lt;/strong&gt; or the &lt;strong&gt;prison&lt;/strong&gt;, he will &lt;strong&gt;wait&lt;/strong&gt; until the other player lands in the same cell. Then the player goes to the other player's former cell.&lt;/p&gt;&#xA;&lt;p&gt;If a player lands in the &lt;strong&gt;maze&lt;/strong&gt;, he will go to cell &lt;strong&gt;30&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If a player's first rolls are 4 &amp;amp; 5, he will go to cell 53.&lt;/p&gt;&#xA;&lt;p&gt;If a player lands on &lt;strong&gt;death&lt;/strong&gt;, he will go to the &lt;strong&gt;start&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Implementing it&lt;/h2&gt;&#xA;&lt;h3&gt;Randomness&lt;/h3&gt;&#xA;&lt;p&gt;The dice rolls represent random numbers; the programming language you use needs to have a way to output (Any output method) and a way to generate random numbers.&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;The program should output each iteration of the game; Each turn, it should output the player's position. Like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Turn 1: 16, 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The first and second numbers represent each player respectively. When a player wins or after a certain maximum number of turns, the program will stop.&lt;/p&gt;&#xA;&lt;h2&gt;General Rules&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The player must be able to win.&lt;/li&gt;&#xA;&lt;li&gt;Making up your programming language is allowed, provided you made an interpreter available to the public for your programming language.&lt;/li&gt;&#xA;&lt;li&gt;Don't exploit standard loopholes.&lt;/li&gt;&#xA;&lt;li&gt;Make sure your code runs in at most 10 seconds.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Recommendations&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;You should include a link to a website (for example &lt;a href=&quot;https://tio.run&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://tio.run&lt;/a&gt;) so that your code can be easily run.&lt;/li&gt;&#xA;&lt;li&gt;If you're using a compiled language, say which compiler you're using.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;strong&gt;It's code golf, so the shortest code wins!&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="110093" LastEditorUserId="110093" LastEditDate="2022-02-12T23:06:10.703" LastActivityDate="2022-02-12T23:06:10.703" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24462" PostTypeId="2" ParentId="2140" CreationDate="2022-02-11T23:34:41.583" Score="0" Body="&lt;h2&gt;Weekday celebration with Doomsday&lt;/h2&gt;&#xA;&lt;p&gt;With the help of the &lt;a href=&quot;https://en.wikipedia.org/wiki/Doomsday_rule&quot; rel=&quot;nofollow noreferrer&quot;&gt;Doomsday rule&lt;/a&gt; you can always calculate the day of the week for any date given. It includes any digit year.&lt;/p&gt;&#xA;&lt;p&gt;Your code should determine which day of the week will be on the Valentine's Day of the given year.&lt;/p&gt;&#xA;&lt;p&gt;The input is an integer representing the year, and the output is a number representing the day (1 - monday, 2 - tuesday, etc).&lt;/p&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;2001 -&amp;gt; 3&lt;br /&gt;&#xA;1916 -&amp;gt; 1&lt;br /&gt;&#xA;41373 -&amp;gt; 7&lt;br /&gt;&#xA;312631 -&amp;gt; 1&lt;br /&gt;&#xA;71254065 -&amp;gt; 6&lt;br /&gt;&#xA;512836172 -&amp;gt; 5&lt;br /&gt;&#xA;-2735263 -&amp;gt; 3&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is code-golf, so shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="110905" LastEditorUserId="110905" LastEditDate="2022-02-12T11:45:23.033" LastActivityDate="2022-02-12T11:45:23.033" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24464" PostTypeId="2" ParentId="2140" CreationDate="2022-02-12T03:38:16.113" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242777/mountain-mapper&quot;&gt;Mountain mapper&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-02-13T02:54:41.637" LastActivityDate="2022-02-13T02:54:41.637" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24466" PostTypeId="1" CreationDate="2022-02-12T10:25:27.127" Score="9" ViewCount="206" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ast-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ast-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;ast-golf&lt;/a&gt; tag is a winning criterion where the program with the least AST nodes wins. This seems like a subset of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;, where the program with the least operations by some definition wins.&lt;/p&gt;&#xA;&lt;p&gt;It has &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ast-golf&quot;&gt;one question&lt;/a&gt;, which  looks quite similar to a typical &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; question:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;Scoring Heuristics&lt;/h2&gt;&#xA;&lt;p&gt;The following rules are typically enough to calculate the score of your program:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Block statements are 1 points: if, for ... in ..., while, else, etc.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Standalone statements are 1 point: print in Python 2, break, pass, etc.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Variables are 2 points&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;...&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Also, the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/403/new-code-golf-metric-atomic-code-golf&quot;&gt;original intent&lt;/a&gt; of the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; tag was to count a single token per statement / value / similar in a program, in an attempt to level the  playing field.&lt;/p&gt;&#xA;&lt;p&gt;So, what should we do with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ast-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ast-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;ast-golf&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="68942" LastEditDate="2022-03-09T00:17:39.330" LastActivityDate="2022-03-09T00:17:39.330" Title="What should we do with ast-golf?" Tags="|discussion|feature-request|status-completed|tags|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24467" PostTypeId="2" ParentId="2140" CreationDate="2022-02-12T12:52:41.827" Score="-1" Body="&lt;h1&gt;Zhiwei Sun Squares&lt;/h1&gt;&#xA;&lt;p&gt;Given a positive integer &lt;code&gt;n&lt;/code&gt;, find the number of ordered tuples &lt;code&gt;(a, b, c, d, e)&lt;/code&gt; over non-negative integers for which &lt;code&gt;a² + b² + c² + d² = n&lt;/code&gt; and &lt;code&gt;b + 3c + 5d = e²&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Note: A conjecture by 孙智伟 (Sūn, Zhìwěi) states that this count is always at least &lt;code&gt;1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For example, if &lt;code&gt;n&lt;/code&gt; is 9, there are 3 solutions, namely:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(0, 0, 3, 0, 3)&#xA;(1, 0, 2, 2, 4)&#xA;(3, 0, 0, 0, 0)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;9 -&amp;gt; 3&#xA;4 -&amp;gt; 2&#xA;24 -&amp;gt; 1&#xA;25 -&amp;gt; 5&#xA;144 -&amp;gt; 3&#xA;128 -&amp;gt; 1&#xA;365 -&amp;gt; 9&#xA;366 -&amp;gt; 21&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Scoring:&lt;/h2&gt;&#xA;&lt;p&gt;This is code-golf, so shortest code wins!&lt;/p&gt;&#xA;&lt;p&gt;Credits to &lt;a href=&quot;https://www.codingame.com/training/easy/zhiwei-sun-squares&quot; rel=&quot;nofollow noreferrer&quot;&gt;this puzzle&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-02-12T12:58:46.513" LastActivityDate="2022-02-12T12:58:46.513" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24468" PostTypeId="2" ParentId="2140" CreationDate="2022-02-12T13:36:04.540" Score="-1" Body="&lt;h1&gt;The travelling sales man problem&lt;/h1&gt;&#xA;&lt;p&gt;The travelling salesman problem (TSP) asks the following question: &amp;quot;Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;In this puzzle not necessarily the shortest route is the answer but an approximation using a greedy algorithm (which in fact could be the shortest route as well).&lt;/p&gt;&#xA;&lt;p&gt;This greedy algorithm starts at the first input given and always chooses the nearest point from the current point. This continues until no points are left and the last point is connected to the first point.&lt;/p&gt;&#xA;&lt;p&gt;Use the Euclidian distance, i.e. &lt;code&gt;sqrt(deltaX^2 + deltaY^2)&lt;/code&gt;, as the distance between two cities. If there are points with the same distance, always pick the one occurring first in the list.&lt;/p&gt;&#xA;&lt;p&gt;In general, the greedy algorithm does not find the optimal solution, but nonetheless a greedy heuristic may yield locally optimal solutions that approximate a global optimal solution in a reasonable time.&lt;/p&gt;&#xA;&lt;h2&gt;Input &amp;amp; Output&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You are given an integer &lt;code&gt;n&lt;/code&gt; and on the next &lt;code&gt;n&lt;/code&gt; lines, you are given the x and y coordinate of the city&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;5&#xA;9 12&#xA;24 15&#xA;12 30&#xA;4 3&#xA;13 27&#xA;-&amp;gt;&#xA;71&#xA;&#xA;5&#xA;25 2&#xA;5 9&#xA;22 12&#xA;15 19&#xA;0 1&#xA;-&amp;gt;&#xA;69&#xA;&#xA;12&#xA;4 5&#xA;12 80&#xA;65 18&#xA;39 29&#xA;99 11&#xA;84 31&#xA;9 9&#xA;54 49&#xA;16 27&#xA;31 67&#xA;0 71&#xA;60 0&#xA;-&amp;gt;&#xA;403&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Others&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You are allowed to take in the input as a list of &lt;code&gt;n&lt;/code&gt; integers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Scoring:&lt;/h2&gt;&#xA;&lt;p&gt;This is code-golf, so shortest code wins!&lt;/p&gt;&#xA;&lt;p&gt;Credits to &lt;a href=&quot;https://www.codingame.com/ide/puzzle/the-travelling-salesman-problem&quot; rel=&quot;nofollow noreferrer&quot;&gt;this puzzle&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="109916" LastActivityDate="2022-02-12T13:36:04.540" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24469" PostTypeId="2" ParentId="2140" CreationDate="2022-02-12T13:43:03.213" Score="4" Body="&lt;h1&gt;Print 2^n graph in ASCII&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge is to output this infinite graph:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&#xA;o&#xA;o&#xA;oo&#xA;oo&#xA;oo&#xA;oo&#xA;ooo&#xA;ooo&#xA;ooo&#xA;ooo&#xA;ooo&#xA;ooo&#xA;ooo&#xA;ooo&#xA;oooo&#xA;oooo&#xA;oooo&#xA;oooo&#xA;oooo&#xA;oooo&#xA;oooo&#xA;oooo&#xA;oooo&#xA;oooo&#xA;oooo&#xA;oooo&#xA;oooo&#xA;oooo&#xA;oooo&#xA;oooo&#xA;ooooo&#xA;ooooo&#xA;ooooo&#xA;ooooo&#xA;ooooo&#xA;ooooo&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;with the xth line having floor(log_2(x)) &lt;code&gt;o&lt;/code&gt;s (or other characters). Tag: code-golf, ascii-art, kolmogorov-complexity.&lt;/p&gt;&#xA;" OwnerUserId="87986" LastEditorUserId="87986" LastEditDate="2022-02-12T15:05:55.910" LastActivityDate="2022-02-12T15:05:55.910" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24471" PostTypeId="2" ParentId="2140" CreationDate="2022-02-12T18:00:30.197" Score="0" Body="&lt;h1&gt;Uncountably long chain of subsets&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/open-ended-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; rel=&quot;tag&quot;&gt;open-ended-function&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;A chain of subsets (a chain from now on) is a sequence of sets, so that every set is a (strict) superset of every preceding set. For example, here is a chain of length 3:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\{1,2\}\subset\{1,2,4,5\}\subset\{1,2,3,4,5\}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Chains can also be infinitely long. Here is a countably infinite chain:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\{2\}\subset\{2,4\}\subset\{2,4,8\}\subset\{2,4,8,16\}\subset\ldots\subset\{2,4,8,16,32,...\}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to make an &lt;strong&gt;uncountably&lt;/strong&gt; infinite chain, consisting of sets of positive numbers.&lt;/p&gt;&#xA;&lt;p&gt;Your gut reaction might be that this is impossible. But it's not. For example, consider the real numbers. We can define them as Dedekind cuts (meaning every real number is defined as the set of rational numbers that are smaller than it). Next we can associate every rational number with a positive integer. Now, under the standard ordering of the real numbers, we have a chain of subsets of the positive integers that is uncountably long.&lt;/p&gt;&#xA;&lt;p&gt;Now that you've picked your favorite uncountably long chain of subsets of the positive integers, it's time to make a program that encodes it.&lt;/p&gt;&#xA;&lt;p&gt;Your program will recieve two natural numbers. Your program will simply tell whether the first natural number appears before or at the same time as the second one in the chain. Or in other words: for inputs &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; return true iff &lt;span class=&quot;math-container&quot;&gt;\$b\in S\Rightarrow a\in S\$&lt;/span&gt; for all sets &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; in the chain. Your chain must contain every positive integer (however, this doesn't mean that it must contain the set of positive integers).&lt;/p&gt;&#xA;&lt;p&gt;Bonus points if you achieve a cardinality different from &lt;span class=&quot;math-container&quot;&gt;\$2^{\aleph_0}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Edit:&lt;/h1&gt;&#xA;&lt;p&gt;Probably not gonna post this challenge as is, because of a rather trivial solution (lexicographic ordering)&lt;/p&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-02-13T20:21:41.560" LastActivityDate="2022-02-13T20:21:41.560" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24472" PostTypeId="2" ParentId="24466" CreationDate="2022-02-12T18:50:51.093" Score="14" Body="&lt;h1&gt;Merge it into &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Do we really need &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ast-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ast-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;ast-golf&lt;/a&gt; for this? Isn't this just a specific form of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;?&lt;br /&gt;&#xA;- &lt;a href=&quot;https://codegolf.stackexchange.com/questions/100776/abstract-syntax-tree-golfing-fizzbuzz-python#comment245097_100776&quot;&gt;Martin Ender&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The reason I did it this way is because the tag text for atomic-code-golf says &amp;quot;Atomic code golf is scored by the number of tokens of your program,&amp;quot; and that's not the same as this, though perhaps only a pretty small amount.&lt;br /&gt;&#xA;- &lt;a href=&quot;https://codegolf.stackexchange.com/questions/100776/abstract-syntax-tree-golfing-fizzbuzz-python#comment245262_100776&quot;&gt;isaacg&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Given that:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;there have been no other &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ast-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ast-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;ast-golf&lt;/a&gt; questions in over five years and&lt;/li&gt;&#xA;&lt;li&gt;the OP admits that it's nearly the same as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; and&lt;/li&gt;&#xA;&lt;li&gt;it's since been retagged &lt;em&gt;as&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;I don't think the slight difference in scoring from regular &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; makes enough of a difference to keep a separate tag. This challenge is a variant of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt;, the same way that a challenge that counts box-drawing characters as one byte is a variant of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, or that &lt;a href=&quot;https://codegolf.stackexchange.com/q/92897/16766&quot;&gt;a challenge about xiangqi&lt;/a&gt; is a variant of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot;&gt;chess&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;It might be worth updating the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;atomic-code-golf&lt;/a&gt; tag wiki to explicitly include this kind of variant.&lt;/p&gt;&#xA;" OwnerUserId="16766" LastActivityDate="2022-02-12T18:50:51.093" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24473" PostTypeId="1" CreationDate="2022-02-13T00:26:53.723" Score="3" ViewCount="85" Body="&lt;p&gt;The &lt;code&gt;LAMBDA&lt;/code&gt; function is going to be released to Excel eventually.  This presents an opportunity to create a set of user-defined functions in Excel.  If a standard set of functions with an eye toward golfing is defined, could this be considered to be a separate language?  This seems like it would be similar to something like tinylisp.&lt;/p&gt;&#xA;&lt;h3&gt;Additional Thoughts&lt;/h3&gt;&#xA;&lt;p&gt;There are a few types of functions that I was considering for this language.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Current Excel functions with shorter name (just this would be boring)&lt;/li&gt;&#xA;&lt;li&gt;Functions with better error handling. For example, &lt;code&gt;COMBIN(3,4)&lt;/code&gt; could return 0 instead of #NUM.&lt;/li&gt;&#xA;&lt;li&gt;Functions that are useful for golfing but missing from Excel.  These include prime test, count of characters in a string, and splitting on a delimiter, to name a few.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Are there any suggestions to make this better?&lt;/p&gt;&#xA;" OwnerUserId="101349" LastEditorUserId="101349" LastEditDate="2022-02-13T17:18:36.843" LastActivityDate="2022-02-13T17:18:36.843" Title="Golfing Language Based on Excel" Tags="|discussion|languages|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24474" PostTypeId="2" ParentId="2140" CreationDate="2022-02-13T01:33:51.110" Score="1" Body="&lt;h1&gt;Interpret Subleq code&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;Subleq is a language that has only one 3 argument instruction.  The instruction has three operands &lt;code&gt;A B C&lt;/code&gt;. When executed it subtracts the contents in address &lt;code&gt;A&lt;/code&gt; from address &lt;code&gt;B&lt;/code&gt;; stores the result in address &lt;code&gt;B&lt;/code&gt;; if the result is less than or equal to 0 it goes to address &lt;code&gt;C&lt;/code&gt;.  -1 in a position has special meaning.  -1 in &lt;code&gt;A&lt;/code&gt; will read the ASCII value of then next character of input into &lt;code&gt;B&lt;/code&gt;; if no more input then goto 'C'. -1 in &lt;code&gt;B&lt;/code&gt; will send the ASCII character in &lt;code&gt;A&lt;/code&gt; to output.  -1 in &lt;code&gt;C&lt;/code&gt; will exit the program instead of going to an address.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Given input and Subleq code, output the results from running the Subleq code.&lt;/p&gt;&#xA;&lt;p&gt;An interpreter built in Excel is &lt;a href=&quot;https://1drv.ms/x/s!AkqhtBc2XEHJnifb6P01c9pbdyYm?e=7b9vHa&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may use any &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447&quot;&gt;standard I/O method&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;p&gt;For the test cases below, any input to the Subleq is before the '/', code is after.  Code is represented by decimal numbers.&lt;/p&gt;&#xA;&lt;h3&gt;Hello, World!&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input=&amp;gt;&#xA;/&#xA;12 -1 13&#xA;1 0 6&#xA;3 2 -1&#xA;4 4 0&#xA;72 101 108 108 111 42 32 87 111 114 108 100 33&#xA;Output&#xA;Hello, World!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/225410/101349&quot;&gt;!I!n!s!e!r!t! !i!n!b!e!t!w!e!e!n!&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input-&amp;gt;&#xA;1 2 3 4 5 6/&#xA;2 -1 33&#xA;-1 8 -1&#xA;8 -1 0&#xA;8 8 &#xA;Output&#xA;!1! !2! !3! !4! !5! !6!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What am I leaving out?&lt;/li&gt;&#xA;&lt;li&gt;Is there a better way of handling the input to the Subleq code?&lt;/li&gt;&#xA;&lt;li&gt;Does it need more/better examples?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="101349" LastActivityDate="2022-02-13T01:33:51.110" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24476" PostTypeId="2" ParentId="2140" CreationDate="2022-02-13T02:21:50.277" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242934/knights-jam-chess&quot;&gt;Knights Jam | Chess&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-02-17T08:23:22.413" LastActivityDate="2022-02-17T08:23:22.413" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24477" PostTypeId="2" ParentId="2140" CreationDate="2022-02-13T18:21:11.600" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242801/largest-rectangle-in-a-skyline&quot;&gt;Largest rectangle in a skyline&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-02-14T07:13:25.647" LastActivityDate="2022-02-14T07:13:25.647" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24478" PostTypeId="2" ParentId="2140" CreationDate="2022-02-13T19:15:01.623" Score="-4" Body="&lt;h1&gt;Outgolf me with the custom scoring&lt;/h1&gt;&#xA;&lt;h2&gt;Cops:&lt;/h2&gt;&#xA;&lt;p&gt;You post two codes, a code is that you wanted to do, another is used to size the code.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Outgolfing must be 1 bytes or fewer&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Code that sizes solves the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; is Fine&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes apply&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Example:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;# [Python 3](https://docs.python.org/3/), score 21 &#xA;&#xA;# Code&#xA;&#xA;    print(&amp;quot;&amp;quot;&amp;quot;s&amp;quot;&amp;quot;&amp;quot;)&#xA;&#xA;# Sizer&#xA;&#xA;    print(len(input())/2)&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Scoring (Cops)&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$s + \lfloor\frac{(m)}3\rfloor\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Where &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; is the size of actual code and &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt; is the size of code used for sizing the code.&lt;/p&gt;&#xA;&lt;p&gt;The lowest Score of uncracked Cop wins&lt;/p&gt;&#xA;&lt;h1&gt;Robbers&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to find code, If the code size is less than the Cop's code, Then Post an answer That cracks the Cop's answer.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes apply&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Example:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;# [Python 3](https://docs.python.org/3/), [Cracks username Cop](https://codegolf.stackexchange.com/questions), 2 score saved&#xA;&#xA;    print(&amp;quot;s&amp;quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The Poster with most cracks wins&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="106959" LastActivityDate="2022-02-13T19:15:01.623" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24481" PostTypeId="2" ParentId="2140" CreationDate="2022-02-14T10:15:46.587" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242875/simulating-bombs&quot;&gt;Simulating Bombs&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-02-16T03:29:38.720" LastActivityDate="2022-02-16T03:29:38.720" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24482" PostTypeId="2" ParentId="2140" CreationDate="2022-02-14T10:29:30.953" Score="2" Body="&lt;h1&gt;Make me a k-NN classifier&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/machine-learning&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;machine-learning&amp;#39;&quot; rel=&quot;tag&quot;&gt;machine-learning&lt;/a&gt; &lt;em&gt;The &amp;quot;machine-learning&amp;quot; tag will be created&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm&quot; rel=&quot;nofollow noreferrer&quot;&gt;k Nearest Neighbors&lt;/a&gt; (k-NN) classifier is a simple machine learning classifier. Although k-NN also works for regression tasks, we will be focusing on classification tasks for this challenge.&lt;/p&gt;&#xA;&lt;p&gt;The classifier can be customized in a number of different ways. For this challenge, the following can be customized:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;k&lt;/code&gt; itself;&lt;/li&gt;&#xA;&lt;li&gt;the distance metric; and&lt;/li&gt;&#xA;&lt;li&gt;the aggregation function.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Main idea&lt;/h2&gt;&#xA;&lt;p&gt;As you can probably tell by its name, k-NN works using the concept of &lt;em&gt;neighbors&lt;/em&gt;. First, we &amp;quot;train&amp;quot; classifiers by giving it (preferably a lot of) training data.&lt;/p&gt;&#xA;&lt;p&gt;A training data point consists of two parts: its &amp;quot;features&amp;quot; and its target value. For instance, if predicting car brand, features might be maximum speed, size etc, and the target variable would be brand. We can also specify &lt;code&gt;k&lt;/code&gt;, a distance metric, and/or an aggregation function, or let the classifier fine-tune these hyperparameters itself. For this challenge, the above hyperparameters will be given directly to the classifier.&lt;/p&gt;&#xA;&lt;p&gt;When we give the classifier a list of features to be assigned a predicted target value, it takes the &lt;code&gt;k&lt;/code&gt; train points closest to the test point, measured by distance metric via features, and runs their target values through its aggregation function to obtain its prediction.&lt;/p&gt;&#xA;&lt;p&gt;The hyperparameters are explained below:&lt;/p&gt;&#xA;&lt;h2&gt;&lt;code&gt;k&lt;/code&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;code&gt;k&lt;/code&gt; is the neighbor count. If &lt;code&gt;k&lt;/code&gt; is 5, for instance, the classifier will consider 5 neighbors when predicting.&lt;/p&gt;&#xA;&lt;h2&gt;Distance metric&lt;/h2&gt;&#xA;&lt;p&gt;The distance metric measures how far two data points are from each other, measured by their features. A standard distance metric is Euclidean distance, but many others can be used, such as the Manhattan distance.&lt;/p&gt;&#xA;&lt;h2&gt;Aggregation function&lt;/h2&gt;&#xA;&lt;p&gt;Once the classifier has found the &lt;code&gt;k&lt;/code&gt; nearest neighbors, it calls its aggregation function using the target values of these neighbors. A standard aggregation function for classification is majority vote, but many others can be used.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;The following are to be taken as input:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a list of train data points where each data point consists of:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a list of numbers, where the lengths of these lists are the same for all training data points; and&lt;/li&gt;&#xA;&lt;li&gt;a target value;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;k&lt;/code&gt;;&lt;/li&gt;&#xA;&lt;li&gt;a distance metric which takes two data points' features and outputs a positive number; and&lt;/li&gt;&#xA;&lt;li&gt;an aggregation function which takes &lt;code&gt;k&lt;/code&gt; data points' target values and outputs a value that is one of the target values contained within the training data (this means that you can't just output some arbitrary number; it must be a target value for at least one of the train data points);&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may also take in the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a list of features of the same length as every list of features within the training data.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;if an additional list of features was given, the prediction, found using the procedure described above, for that list of features;&lt;/li&gt;&#xA;&lt;li&gt;if no such list was given, a function that takes in a list of features as described above and outputs the prediction for that list of features.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Input is flexible so long as it is within reason.&lt;/p&gt;&#xA;&lt;p&gt;The distance metric and aggregation function are black-box functions.&lt;/p&gt;&#xA;&lt;p&gt;This challenge is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code, measured in bytes, wins.&lt;/p&gt;&#xA;&lt;h2&gt;Test case&lt;/h2&gt;&#xA;&lt;p&gt;Given in python.&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;k = 5&#xA;distance = lambda a, b: sum((b[i] - a[i]) ** 2 for i in range(5)) # Euclidean distance&#xA;aggregation = lambda a, b, c, d, e: max([a, b, c, d, e], key=lambda i: [a, b, c, d, e].count(i)) # output the one with the most occurrences&#xA;train = [&#xA; [[1, 2, 3, 4, 5], 0],&#xA; [[2, 3, 4, 5, 6], 1],&#xA; [[3, 4, 5, 6, 7], 1],&#xA; [[1, 4, 5, 6, 7], 0],&#xA; [[1, 8, 9, 9, 9], 0],&#xA; [[9, 0, 0, 0, 0], 1],&#xA; [[2, 3, 4, 1, 1], 1]&#xA;]&#xA;&#xA;classifier_func = knn_classifier(train, k, distance, aggregation) # function output&#xA;&#xA;print(classifier_func([1, 0, 0, 0, 0])) # outputs 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Do we have any feedback? Duplicate? Clarification needed? Wrong terminology? Wrong test case?&lt;/p&gt;&#xA;" OwnerUserId="106710" LastEditorUserId="106710" LastEditDate="2022-02-14T13:14:52.463" LastActivityDate="2022-02-14T13:14:52.463" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24483" PostTypeId="2" ParentId="2140" CreationDate="2022-02-14T21:21:51.593" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242897/golf-the-prime-numbers-in-shue&quot;&gt;Golf the prime numbers in Shue&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-02-16T15:14:19.533" LastActivityDate="2022-02-16T15:14:19.533" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="24484" PostTypeId="2" ParentId="2140" CreationDate="2022-02-14T21:45:36.913" Score="0" Body="&lt;h1&gt;Grid Aligned (Quad?) Linked List&lt;/h1&gt;&#xA;&lt;h2&gt;Fluff&lt;/h2&gt;&#xA;&lt;p&gt;I was recently thinking about 2-dimensional linked lists, and realized that they could potentially become unaligned to a grid, unlike a singly linked list. To combat that, I need a program that checks if a quad-list is grid aligned or not, and it needs to be done as short as possible.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a quad linked-list, return true or false (or any other 2 consistent values) whether or not the 2d list is grid aligned.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;Since linked lists can be implemented a variety of different ways in different languages, I'll keep the input format fairly simple. An input consists of tuples (or 4-lists, you can decide) which contain indices that refer to the input. Each tuple contains the indices of the node above, below, left, and right in that order. For nodes where not all directions are connected, the value will be -1.&lt;/p&gt;&#xA;&lt;p&gt;Note: &amp;quot;above&amp;quot;, &amp;quot;below&amp;quot;, &amp;quot;left&amp;quot;, &amp;quot;right&amp;quot; should be connected in that direction, but may not necessarily do so.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;[(-1, 1, -1, -1), (0, -1, -1, -1)] -&amp;gt; true&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0&#xA;|&#xA;1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;[(-1, 1, -1, 3), (0, -1, -1, 2), (-1, -1, -1, -1), (-1, 2, 0, -1)] -&amp;gt; true&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0---3&#xA;|   v&#xA;1 &amp;gt; 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;[(-1, 1, -1, 2), (0, -1, -1, 2), (0, -1, 1, -1)] -&amp;gt; false&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0&#xA;| \&#xA;1--2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;[(-1, 1, -1, -1), (-1, 2, -1, -1), (-1, -1, -1, 3), (4, -1, -1, -1), (-1, -1, 0, -1)] -&amp;gt; false&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 &amp;lt; 4&#xA;v   ^&#xA;1   |&#xA;v   |&#xA;2 &amp;gt; 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;[(0, -1, -1, -1)] -&amp;gt; false&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0&#xA;^&#xA;0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code wins, good luck.&lt;/p&gt;&#xA;" OwnerUserId="99035" LastActivityDate="2022-02-14T21:45:36.913" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24485" PostTypeId="2" ParentId="2140" CreationDate="2022-02-15T01:11:24.487" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/242969/107299&quot;&gt;Posted here&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="107299" LastEditorUserId="107299" LastEditDate="2022-02-21T15:40:36.533" LastActivityDate="2022-02-21T15:40:36.533" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24486" PostTypeId="1" AcceptedAnswerId="24489" CreationDate="2022-02-15T02:37:15.570" Score="9" ViewCount="336" Body="&lt;p&gt;I'm just curious about any pure code golf questions (ie, not ones that build on other answers, just straight up, solve the problem with fewest bytes) where even the shortest golfed answers (especially in golf languages) are particularly long.&lt;/p&gt;&#xA;&lt;p&gt;Do any problems stand out as ones that were particularly ungolfable? (Preferably not because they have large datasets which would need to be incorporated in the answers somehow...)&lt;/p&gt;&#xA;&lt;p&gt;TL;DR: Of the pool of correct, shortest answers to a pure code golf non-kolmogorov-complexity problem, answered in a golf language, which are some of the longest?&lt;/p&gt;&#xA;" OwnerUserId="30512" LastEditorUserId="66833" LastEditDate="2022-02-21T15:46:30.730" LastActivityDate="2023-03-20T05:11:37.790" Title="Questions with the longest shortest answers?" Tags="|discussion|statistics|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24487" PostTypeId="2" ParentId="2140" CreationDate="2022-02-15T08:52:44.920" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243029/factorials-of-primes-decomposition&quot;&gt;Factorials of primes decomposition&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-02-18T12:49:27.330" LastActivityDate="2022-02-18T12:49:27.330" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24488" PostTypeId="2" ParentId="2140" CreationDate="2022-02-15T09:53:56.333" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242986/chess-board-analyzer&quot;&gt;Chess Board Analyzer&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-02-18T00:05:21.917" LastActivityDate="2022-02-18T00:05:21.917" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24489" PostTypeId="2" ParentId="24486" CreationDate="2022-02-15T10:37:21.460" Score="9" Body="&lt;p&gt;I've found a couple of contenders depending on how you want to define things:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/92663/56656&quot;&gt;This answer&lt;/a&gt;&lt;sup&gt;1&lt;/sup&gt; &lt;sup&gt;2&lt;/sup&gt; by Conor O'Brien, is probably the longest &amp;quot;winner&amp;quot; of a code-golf challenge on the site, at &lt;strong&gt;1354616599400377002855073561913010716386821416114463012 bytes of Lenguage&lt;/strong&gt;.  However this is probably because the question is closed and no more answers can be posted.  So it feels a bit unfair.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/235298/78410&quot;&gt;This answer&lt;/a&gt;&lt;sup&gt;2&lt;/sup&gt; at &lt;strong&gt;14716 bytes of Rust&lt;/strong&gt; is the longest &amp;quot;winner&amp;quot; of an open code-golf challenge I (Bubbler) can remember right now. (It was at &lt;strong&gt;38250 bytes&lt;/strong&gt; before the answerer was told that the answer needs to show at least some effort to golf.)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/197187/56656&quot;&gt;This answer&lt;/a&gt;&lt;sup&gt;2&lt;/sup&gt; by JoKing at &lt;strong&gt;1533 bytes of Lost&lt;/strong&gt; is the longest well-golfed winner of an open-code-golf challenge that I could find &lt;em&gt;that cannot be beaten by choosing to solve it in a golfier language&lt;/em&gt;.  That's because the challenge is language restricted to Lost.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/116707/78410&quot;&gt;This answer&lt;/a&gt;&lt;sup&gt;1&lt;/sup&gt; by Dennis at &lt;strong&gt;11682 bytes of Bash + sed&lt;/strong&gt; is the longest well-golfed &amp;quot;winner&amp;quot; of an open code golf challenge I could find, where the challenge has multiple answers by other users.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/199608/78410&quot;&gt;This answer&lt;/a&gt; by Bubbler at &lt;strong&gt;616 bytes of APL&lt;/strong&gt; is the a &amp;quot;winner&amp;quot; of an open code-golf challenge.  And if you consider APL to be a golfing language it is the longest &amp;quot;winner&amp;quot; in a golfing language found yet.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/64299/78410&quot;&gt;This answer&lt;/a&gt;&lt;sup&gt;1&lt;/sup&gt; by Dennis at &lt;strong&gt;590 bytes of Pyth&lt;/strong&gt; is the longest a &amp;quot;winner&amp;quot; of an open code-golf challenge in definitely a golfing language so far.  Pyth is a 1st gen golfing language which tend to be a little longer than second and third gen languages.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/215234/78410&quot;&gt;This answer&lt;/a&gt;&lt;sup&gt;1&lt;/sup&gt; by Makonede at &lt;strong&gt;428 bytes of 05AB1E&lt;/strong&gt; is the longest &amp;quot;winner&amp;quot; of an open code-golf challenge in a second generation golfing language so far.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is a community wiki, if you find better contenders in any of the categories or new cases, feel free to update the answer.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;1: This answer is to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;kolmogorov-complexity-container&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenge.&lt;/p&gt;&#xA;&lt;p&gt;2: This answer is the only answer on the challenge and wins simply by being valid.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="46076" LastEditDate="2023-02-23T01:26:09.297" LastActivityDate="2023-02-23T01:26:09.297" CommentCount="1" CommunityOwnedDate="2022-02-15T10:37:21.460" ContentLicense="CC BY-SA 4.0" />
  <row Id="24491" PostTypeId="2" ParentId="2140" CreationDate="2022-02-15T22:31:33.730" Score="-3" Body="&lt;h1&gt;Get the Nth line&lt;/h1&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Let's have a file &lt;code&gt;f&lt;/code&gt; and a number &lt;code&gt;n&lt;/code&gt;. Your task is to get the nth line from the file.&lt;/p&gt;&#xA;&lt;h2&gt;Constrains&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;file &lt;code&gt;f&lt;/code&gt; exists and has at least &lt;code&gt;n&lt;/code&gt; lines&lt;/li&gt;&#xA;&lt;li&gt;you can index lines from 0 or 1, whichever you prefer&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;input: &lt;code&gt;n&lt;/code&gt; = 2 (indexing from 1) and content of file &lt;code&gt;f&lt;/code&gt; is:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;foo&#xA;bar&#xA;baz&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;output: &lt;code&gt;bar&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;this is &lt;code&gt;code-golf&lt;/code&gt; challenge, so the shortest code wins&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet/2422#2422&quot;&gt;standard rules apply&lt;/a&gt; for your answer with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods/&quot;&gt;default I/O rules&lt;/a&gt;, so you are allowed to use stdin/stdout, functions/method with the proper parameters and return-type, full programs&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;default Loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="108193" LastActivityDate="2022-02-15T22:31:33.730" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24492" PostTypeId="2" ParentId="2140" CreationDate="2022-02-16T05:28:17.940" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242935/is-it-a-fibonacci-like-sequence&quot;&gt;Is it a fibonacci-like sequence?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-02-17T08:28:59.787" LastActivityDate="2022-02-17T08:28:59.787" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24493" PostTypeId="2" ParentId="2140" CreationDate="2022-02-16T10:33:33.017" Score="2" Body="&lt;h1&gt;Disassemble tables&lt;/h1&gt;&#xA;&lt;p&gt;Posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/243134/disassemble-tables&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="106710" LastEditorUserId="106710" LastEditDate="2022-02-20T16:31:34.427" LastActivityDate="2022-02-20T16:31:34.427" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24494" PostTypeId="2" ParentId="2140" CreationDate="2022-02-16T13:15:49.430" Score="2" Body="&lt;h1&gt;Random Point from a 2D Donut Distribution&lt;/h1&gt;&#xA;&lt;p&gt;Posted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/243774/random-point-from-a-2d-donut-distribution&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="87681" LastEditorUserId="87681" LastEditDate="2022-03-07T08:05:54.340" LastActivityDate="2022-03-07T08:05:54.340" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24495" PostTypeId="2" ParentId="2140" CreationDate="2022-02-16T22:12:57.413" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242982/smallest-maximal-rectangle-in-a-skyline&quot;&gt;Smallest maximal rectangle in a skyline&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-02-17T21:56:48.737" LastActivityDate="2022-02-17T21:56:48.737" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24496" PostTypeId="2" ParentId="2140" CreationDate="2022-02-16T23:32:12.290" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243078/wiggle-the-tower&quot;&gt;Wiggle the tower&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-02-19T11:10:17.043" LastActivityDate="2022-02-19T11:10:17.043" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24497" PostTypeId="2" ParentId="2140" CreationDate="2022-02-17T03:24:16.897" Score="2" Body="&lt;h1&gt;Golf the colors of a rug&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;The challenge is based on this rug:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/a8uOQm.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/a8uOQm.jpg&quot; alt=&quot;Rug&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Its colors seem very regular, but the pattern isn't obvious. However, it becomes visible when we move vertical stripes of the rug up and down:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/rhzn2m.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/rhzn2m.jpg&quot; alt=&quot;Rug strips&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;All stripes are colored in the same way, but each stripe is offset by some height, except for a few irregularities. Also, the stripes have different widths.&lt;/p&gt;&#xA;&lt;p&gt;First, we need to list all colors:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0: blue-ish white&#xA;1: lighter blue&#xA;2: darker blue&#xA;3: darkest blue&#xA;4: green-ish white (the color between the middle orange rows)&#xA;5: middle green&#xA;6: dark green&#xA;7: orange&#xA;8: light red&#xA;9: dark red&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Now, we can lay a grid of cells of equal color over this image. I found that using a cell size of 73.5x129 pixels seems to be a good compromise between precision and compactness. This results in a 42x32 grid, which looks like this when overlayed over the rug:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/7dLMHm.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/7dLMHm.jpg&quot; alt=&quot;Rug grid&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Correcting for some perspective errors, we now can approximate the colors of this rug like this:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Y6eGgm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Y6eGgm.png&quot; alt=&quot;Rug simplified&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The color scheme shared by all stripes consists, from top to bottom, of these 42 colors: &lt;code&gt;[3, 3, 2, 3, 3, 2, 2, 0, 2, 2, 1, 1, 3, 1, 1, 5, 5, 6, 5, 5, 6, 6, 7, 6, 6, 7, 7, 4, 7, 7, 8, 8, 7, 8, 8, 9, 9, 8, 9, 9, 9, 9]&lt;/code&gt;. (This already contains the information that some rows have different heights, by having multiple entries of the same color in a row.)&lt;/p&gt;&#xA;&lt;p&gt;There are 18 stripes with widthes &lt;code&gt;[2, 3, 3, 3, 1, 1, 4, 2, 1, 6, 1, 1, 2, 2, 2, 3, 2, 3]&lt;/code&gt;.&#xA;Their vertical offsets are &lt;code&gt;[3, 4, 3, 4, 2, 0, 2, 4, 7, 9, 10, 9, 5, 3, 5, 3, 4, 5]&lt;/code&gt;, which means the first stripe starts at the color at index 3 in the common scheme, the second stripe at index 4 and so on. Starting from the respective start index, the next 32 colors are used; remaining colors (if any) are unused.&lt;/p&gt;&#xA;&lt;p&gt;There are some irregularities in the rug. I didn't find a better way of expressing them except for listing their X and Y coordinates in the grid together with their colors:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;X     [8,  9, 10, 19, 19, 12,  0,  1,  2,  3,  4,  2,  3,  4,  2,  3,  4,  5, 13, 14, 15, 16, 17, 18, 34]&#xA;Y     [18, 18, 18, 23, 24, 27, 31, 31, 29, 29, 29, 30, 30, 30, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31]&#xA;Color [5,  5,  5,  0,  0,  8,  9,  9,  9,  9,  9,  9,  9,  9,  8,  8,  8,  9,  9,  9,  9,  9,  8,  8,  9]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;They are included in this challenge to better reflect the rug and to increase difficulty a bit.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Output this 42x32 grid of numbers from 0-9, each corresponding to the color of one cell of the rug:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;333333333332322223302222221222332233333222&#xA;332223332223333332221111111122332233322222&#xA;222222222223233332221111113100220022222000&#xA;220002220002322220013333331322222222200222&#xA;002220002222322222211111111122002200022222&#xA;222222222220200002231111115111221122222111&#xA;221112221112222221115555555511221122211111&#xA;111111111112022221115555556533113311111333&#xA;113331113331211113356666665611111111133111&#xA;331113331111211111155555555511331133311111&#xA;111111111113133331165555556555115511111555&#xA;115551115551111115556666666655115511155555&#xA;555555555551311115556666667666556655555666&#xA;556665556665155556667777776755555555566555&#xA;665556665555155555566666666655665566655555&#xA;555555555556566665576666667666556655555666&#xA;556665556665555556667777777766556655566666&#xA;666666666665655556667777774777667766666777&#xA;667776665556566667774444447466666666677666&#xA;776667776666566666677777777766776677766666&#xA;666666666667677776647777778777667766666777&#xA;667776667776666667778888888877667766677777&#xA;777777777776766667778888887844774477777444&#xA;774447774447677774407777778777777777744777&#xA;447774447777677777708888888877447744477777&#xA;777777777774744447778888889888778877777888&#xA;778887778887777778889999999988778877788888&#xA;888888888887877778889999998977887788888777&#xA;887778887778788887798888889888888888877888&#xA;779997778888788888899999999988778877788888&#xA;889998888887877778889999999999889988888999&#xA;998889889998899998899999999999889998899999&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program should not take input.&lt;/li&gt;&#xA;&lt;li&gt;Formatting doesn't matter.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer (in bytes) wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Why doesn't the box with irregularities align?&lt;/li&gt;&#xA;&lt;li&gt;Would the challenge be more fun with or without having to include irregularities? I guess allowing both variants is not a good idea because solutions aren't comparable anymore.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="110989" LastEditorUserId="110989" LastEditDate="2022-02-17T10:09:30.660" LastActivityDate="2022-02-17T10:09:30.660" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24501" PostTypeId="2" ParentId="2140" CreationDate="2022-02-17T13:05:35.950" Score="-3" Body="&lt;h1&gt;Knight mover&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to move a chess knight between the points &lt;code&gt;B&lt;/code&gt; and &lt;code&gt;E&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;A chess knight moves in an L shaped pattern, like so:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;.X.X.&#xA;X...X&#xA;..B..&#xA;X...X&#xA;.X.X.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The &lt;code&gt;X&lt;/code&gt;s mark where the knight in position &lt;code&gt;B&lt;/code&gt; can move.&lt;/p&gt;&#xA;&lt;p&gt;There may be other chess pieces on the board, blocking the knight's movement, but for clarity, you will only be notified of where you cannot go by &lt;code&gt;#&lt;/code&gt; characters. You cannot land on these marked spaces, but you can go over them. You also cannot go outside of the board.&lt;/p&gt;&#xA;&lt;p&gt;Your goal is to find how many turns &lt;code&gt;N&lt;/code&gt; are needed to go from &lt;code&gt;B&lt;/code&gt; to &lt;code&gt;E&lt;/code&gt;, or return &lt;code&gt;-1&lt;/code&gt; if it can't be done.&lt;/p&gt;&#xA;&lt;h2&gt;Input &amp;amp; Output&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You are given 2 integers &lt;code&gt;W&lt;/code&gt; and &lt;code&gt;H&lt;/code&gt; giving the width and height of the board&lt;/li&gt;&#xA;&lt;li&gt;For the next &lt;code&gt;H&lt;/code&gt; lines, you are given a row of the board, containing the characters &lt;code&gt;B&lt;/code&gt;, &lt;code&gt;E&lt;/code&gt;, &lt;code&gt;.&lt;/code&gt; and &lt;code&gt;#&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;You are allowed to take in the input as a &lt;code&gt;WxH&lt;/code&gt; board as a list of strings or a character matrix&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test case&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;3 2&#xA;..E&#xA;B..&#xA;-&amp;gt;&#xA;1&#xA;&#xA;&#xA;5 5&#xA;B...E&#xA;..#..&#xA;.....&#xA;.....&#xA;.....&#xA;-&amp;gt;&#xA;4&#xA;&#xA;&#xA;7 5&#xA;B..###.&#xA;####.##&#xA;...###E&#xA;..#.#.#&#xA;.#..#..&#xA;-&amp;gt;&#xA;4&#xA;&#xA;&#xA;8 8&#xA;....#...&#xA;....##..&#xA;..E..#..&#xA;#...##..&#xA;.###....&#xA;........&#xA;........&#xA;.....B..&#xA;-&amp;gt;&#xA;6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is code-golf, so shortest code wins!&lt;/p&gt;&#xA;&lt;p&gt;Credits to &lt;a href=&quot;https://www.codingame.com/ide/puzzle/chess-cavalry&quot; rel=&quot;nofollow noreferrer&quot;&gt;this puzzle&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-02-19T01:13:43.317" LastActivityDate="2022-02-19T01:13:43.317" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24502" PostTypeId="2" ParentId="2140" CreationDate="2022-02-17T20:18:32.983" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243289/play-1d-minesweeper&quot;&gt;Play 1D minesweeper&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-02-23T16:34:37.270" LastActivityDate="2022-02-23T16:34:37.270" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24503" PostTypeId="2" ParentId="2140" CreationDate="2022-02-18T00:37:20.463" Score="0" Body="&lt;h1&gt;Determine if a number is base n heavy&lt;/h1&gt;&#xA;&lt;p&gt;Given a positive integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and a base number &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt;, determine if the number is heavy in that base. A number is heavy if when converted to base &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt;, has at least &lt;span class=&quot;math-container&quot;&gt;\$ \lfloor \log_{10}(n) \rfloor \$&lt;/span&gt; &lt;span class=&quot;math-container&quot;&gt;\$b-1\$&lt;/span&gt;s on one end. (The left or right.)&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;When we convert 100 to base 2 (binary), we get&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1100100&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$\log_{10}(100) = 2\$&lt;/span&gt;, and there are at least 2 ones (the max number in the base) on one end (the left side).&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Shortest code in bytes wins!&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;Coming soon.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Feedback?&lt;/p&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2022-02-18T01:00:26.653" LastActivityDate="2022-02-18T01:00:26.653" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24504" PostTypeId="2" ParentId="24457" CreationDate="2022-02-18T03:26:57.880" Score="9" Body="&lt;h1&gt;Burn it.&lt;/h1&gt;&#xA;&lt;p&gt;Looks like the first category of challenges do fit the tag description, but keeping a tag that applies to a very small number of posts and gets used incorrectly more often doesn't sound like a good idea.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2022-02-18T03:26:57.880" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24508" PostTypeId="1" CreationDate="2022-02-19T08:08:07.013" Score="16" ViewCount="313" Body="&lt;h2&gt;The problem&lt;/h2&gt;&#xA;&lt;p&gt;Often, when we get new users, this happens:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;they post their first few challenges, which receive negative feedback&lt;/li&gt;&#xA;&lt;li&gt;they are instructed to use the sandbox, which they do&lt;/li&gt;&#xA;&lt;li&gt;not long after (typically in a few hours), they post on main again&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This last step is the problem: we need to get users to wait for feedback longer. I think this is the cause of the problem:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;they have previously &lt;strong&gt;received feedback within minutes of posting&lt;/strong&gt; (because the experienced users are all monitoring &lt;code&gt;/questions&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;they're expecting to get feedback in the sandbox &lt;strong&gt;as quickly as they did on main&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;but they don't&lt;/li&gt;&#xA;&lt;li&gt;and &lt;strong&gt;they get impatient&lt;/strong&gt;, and post to main anyway&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The most recent example of this is &lt;a href=&quot;https://codegolf.stackexchange.com/q/243069&quot;&gt;here&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;You need to wait more than 45 minutes there. At least 2-3 days is the recommendation.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Oh, I didn't know that, because it's my first time there.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;What should we do about this?&lt;/h2&gt;&#xA;&lt;p&gt;I think the obvious solution is to change the Sandbox' question description to try and make it clearer how to use it. Currently, the pertinent text is &amp;quot;buried&amp;quot; 10 paragraphs deep (although it is bolded).&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;It is recommended to leave your posts in the sandbox for at least several days, and until it receives upvotes and any feedback has been addressed.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;If this is the solution we go with, how should the content be re-written? Feel free to leave suggestions as answers to this question.&lt;/p&gt;&#xA;&lt;p&gt;But there are other possible solutions. Is it feasible to change the use of the sandbox so that users &lt;em&gt;do&lt;/em&gt; get feedback as quickly as they do on main? This would mean &lt;strong&gt;encouraging experienced users to constantly watch the sandbox as they do &lt;code&gt;/questions&lt;/code&gt;&lt;/strong&gt;; I'd guess not many people will really want to do that, but is it worth trying?&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2022-10-02T12:11:30.167" Title="How can we get new users to use the sandbox properly?" Tags="|discussion|sandbox|new-users|challenge-quality|" AnswerCount="4" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24509" PostTypeId="2" ParentId="24508" CreationDate="2022-02-19T08:08:07.013" Score="1" Body="&lt;h1&gt;Move* the content from the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2056&quot;&gt;Sandbox FAQ&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;*(&lt;em&gt;Move, or copy&lt;/em&gt;?)&lt;/p&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2056&quot;&gt;Sandbox FAQ&lt;/a&gt; is well-written and contains a very clear guide for how to use the sandbox. It is written almost in a step-by-step format, which new users can apply very easily to their posts. Being an &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot;&gt;faq&lt;/a&gt; post, it also helps solve common problems new users will face about using the sandbox. Crucially, I think, it is very easy to &lt;strong&gt;skim-read&lt;/strong&gt; the FAQ and &lt;strong&gt;still read the most important information&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Currently, the FAQ is linked from the main Sandbox, but only like this:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2056&quot;&gt;Sandbox FAQ&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;There isn't even any text encouraging you to read it, so you're very likely to skip that link and read the remaining instructions on the sandbox itself, which aren't as clear.&lt;/p&gt;&#xA;&lt;p&gt;I think linking to the FAQ isn't very useful anyway, because it still adds an &lt;strong&gt;extra step&lt;/strong&gt; that's required for them to get the information they need, rather than it being &lt;strong&gt;unmissable&lt;/strong&gt; in the question body.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, I propose we move or copy the contents of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2057&quot;&gt;the accepted FAQ answer&lt;/a&gt; into the question body of the sandbox itself.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2022-02-19T08:08:07.013" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24510" PostTypeId="2" ParentId="2140" CreationDate="2022-02-19T08:17:02.730" Score="3" Body="&lt;h1&gt;Golfing Coins (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243069/golfing-coins-in-a-board&quot;&gt;suggested rewrite&lt;/a&gt;)&lt;/h1&gt;&#xA;&lt;p&gt;The challenge is to write a program that begins with a board like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;O O X&#xA;O O X&#xA;O O X&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The O's are coins. X's are empty.&lt;/p&gt;&#xA;&lt;h2&gt; Rules &lt;/h2&gt;&#xA;&lt;p&gt;Every round you will uniformly randomly choose a coin and a cardinal direction. You will move that coin 1 spot in that direction, if there is an empty space there. Or in other words, moves must satisfy the following rules:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The coins can &lt;b&gt; only move up, down, left or right 1 spot. &lt;/b&gt;&lt;/li&gt;&#xA;&lt;li&gt;Coins &lt;b&gt; cannot move outside the board &lt;/b&gt;&lt;/li&gt;&#xA;&lt;li&gt;Coins &lt;b&gt; cannot overlap &lt;/b&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This process should be repeated until every coin has moved into each spot on the board. You should output the state of the board after every move.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest code in each language wins.&lt;/p&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-02-19T08:24:15.050" LastActivityDate="2022-02-19T08:24:15.050" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24511" PostTypeId="2" ParentId="2140" CreationDate="2022-02-19T08:55:04.330" Score="-3" Body="&lt;h1&gt;Game of GO&lt;/h1&gt;&#xA;&lt;p&gt;Go is an abstract strategy board game for two players, in which the aim is to surround more territory than the opponent.&lt;/p&gt;&#xA;&lt;p&gt;Given a board (where some stones are already added) and a list of moves to be executed next, check whether the moves are valid and (if they are valid) execute them.&lt;/p&gt;&#xA;&lt;p&gt;After executing all moves in the list the expected output is either not valid if at least one of the moves is invalid, or the new state of the board after all moves were executed.&lt;/p&gt;&#xA;&lt;p&gt;Rules of Go:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Two players place stones of their color (by turns)&lt;/li&gt;&#xA;&lt;li&gt;If a stone is completely surrounded by stones of the other player (or by the edge of the field) this stone is beaten and is removed from the board&lt;/li&gt;&#xA;&lt;li&gt;If stones of the same color are placed next to each other they build a group&lt;/li&gt;&#xA;&lt;li&gt;If the group is completely surrounded by stones of the other player (or by the edge of the fields) this group is beaten and all of its stones are removed from the board&lt;/li&gt;&#xA;&lt;li&gt;A stone can be placed on every free field on the board except for:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A position in which it would be completely surrounded by the stones of the other player (no suicidal moves allowed). Except this move beats some other stones which leads to it not being surrounded anymore&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A position that would create the same board that was there before the other player made his move (to prevent an infinite loop of killing stones) which is named KO-rule (see a test case for an example)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Points (which are not important for this puzzle) are made by empty fields that are surrounded by the stones of a player or by enemy stones that are beaten&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For a more detailed description please visit &lt;a href=&quot;https://en.wikipedia.org/wiki/Go_(game)#Rules&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Input &amp;amp; Output&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You are first given an integer &lt;code&gt;S&lt;/code&gt; for the size of the field (the field is a square of &lt;code&gt;S×S&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;You are then given an integer &lt;code&gt;M&lt;/code&gt; for the number of moves that are to be made on the board&lt;/li&gt;&#xA;&lt;li&gt;You are then given a line of the board where &lt;code&gt;.&lt;/code&gt; is an empty field, &lt;code&gt;B&lt;/code&gt; is a field with a black stone and &lt;code&gt;W&lt;/code&gt; is a field with a white stone on it (each line contains &lt;code&gt;S&lt;/code&gt; characters) for the next &lt;code&gt;S&lt;/code&gt; lines&lt;/li&gt;&#xA;&lt;li&gt;You are then given a move that is described by the player color, and the position (separated by a space character)&lt;/li&gt;&#xA;&lt;li&gt;Output the expected output, else output any character you want&lt;/li&gt;&#xA;&lt;li&gt;You are allowed to output the board as a matrix/list&lt;/li&gt;&#xA;&lt;li&gt;You may assume the initial board state in the input is always valid&lt;/li&gt;&#xA;&lt;li&gt;You are allowed to take in the input as a list/array of lines and moves&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;5&#xA;5&#xA;.....&#xA;.....&#xA;.....&#xA;.....&#xA;.....&#xA;B 2 2&#xA;W 2 3&#xA;B 3 2&#xA;W 3 4&#xA;B 4 3&#xA;-&amp;gt;&#xA;.....&#xA;.....&#xA;..BW.&#xA;..B.W&#xA;...B.&#xA;&#xA;&#xA;5&#xA;7&#xA;BB...&#xA;B....&#xA;.....&#xA;...W.&#xA;.....&#xA;B 3 2&#xA;W 0 2&#xA;B 3 4&#xA;W 2 0&#xA;B 2 3&#xA;W 1 1&#xA;B 4 3&#xA;-&amp;gt;&#xA;..W..&#xA;.W...&#xA;W..B.&#xA;..B.B&#xA;...B.&#xA;&#xA;&#xA;5&#xA;1&#xA;.....&#xA;.....&#xA;..B..&#xA;.....&#xA;.....&#xA;B 2 2&#xA;-&amp;gt;&#xA;0&#xA;&#xA;&#xA;5&#xA;5&#xA;.BW..&#xA;BW...&#xA;.W...&#xA;.....&#xA;.....&#xA;B 3 4&#xA;W 4 4&#xA;B 3 3&#xA;W 2 0&#xA;B 0 0&#xA;-&amp;gt;&#xA;0&#xA;&#xA;&#xA;5&#xA;3&#xA;..B..&#xA;.B.B.&#xA;.WBW.&#xA;.BW..&#xA;.....&#xA;B 3 3&#xA;W 1 2&#xA;B 2 2&#xA;-&amp;gt;&#xA;0&#xA;&#xA;&#xA;5&#xA;7&#xA;.B...&#xA;BW...&#xA;WB..W&#xA;...W.&#xA;...BW&#xA;B 3 4&#xA;W 0 2&#xA;B 0 3&#xA;W 0 0&#xA;B 1 2&#xA;W 0 1&#xA;B 1 0&#xA;-&amp;gt;&#xA;...B.&#xA;B.B..&#xA;WB..W&#xA;...WB&#xA;...B.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is code-golf, so shortest code wins!&lt;/p&gt;&#xA;&lt;p&gt;Credits to &lt;a href=&quot;https://www.codingame.com/ide/puzzle/a-game-of-go&quot; rel=&quot;nofollow noreferrer&quot;&gt;this puzzle&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="109916" LastActivityDate="2022-02-19T08:55:04.330" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24512" PostTypeId="2" ParentId="24508" CreationDate="2022-02-19T13:25:08.237" Score="9" Body="&lt;p&gt;I touch on this somewhat in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/20821/66833&quot;&gt;this related discussion&lt;/a&gt;. My main thoughts (both from that discussion and on this):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;New users need stronger, &lt;strong&gt;earlier&lt;/strong&gt; encouragement to use the Sandbox. Ideally, new users are being told to post in the Sandbox before they even post a challenge. Unfortunately, this requires SE to make some changes to our site for us, which is, at best &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/20624/66833&quot;&gt;currently status planned&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I would very much like to see implemented a modal/pop-up/warning whenever a new user (less than 3 open questions) clicks &amp;quot;Review your question&amp;quot; that would strongly encourage them to use the Sandbox (something like &amp;quot;Have you posted this in the &lt;a href=&quot;/q/2140&quot;&gt;Sandbox&lt;/a&gt; to receive feedback?&amp;quot;). A 7 year old version of this idea is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/5773/66833&quot;&gt;still status planned&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The Sandbox needs to be made more &amp;quot;user-friendly&amp;quot;. I agree with the points in both the question and &lt;a href=&quot;/a/24509&quot;&gt;pxeger's answer&lt;/a&gt; that the Sandbox is not immediately obvious how to use it. I disagree that the entire Sandbox FAQ should be moved into the Sandbox body, but it could do with a rewrite in order to make the more frequently asked questions &lt;em&gt;much&lt;/em&gt; more obvious.&lt;/p&gt;&#xA;&lt;p&gt;Emphasising the purpose of the Sandbox, how long to leave a post in the Sandbox, how to get feedback on your post and why you should use the Sandbox are the key things in my opinion. Especially, how a user with less than 20 rep can get feedback, as chat is a common tool used, that requires 20 rep.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Encourage people to review posts more in the Sandbox. I'm not really sure how to do this, given that we've had &lt;em&gt;multiple&lt;/em&gt; attempts over the years to try to improve reviewing in the Sandbox. Potentially, a recurring event where for a couple of hours, a group of users tackle as many of the most recent active posts as they can?&lt;/p&gt;&#xA;&lt;p&gt;But, some way of improving the number of reviewers would be excellent - the fact that Most Helpful Sandbox Commenter was a category in Best of 2021 means that helping out in the Sandbox is now worth 500 rep.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-02-19T13:25:08.237" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24514" PostTypeId="2" ParentId="2140" CreationDate="2022-02-20T14:06:04.790" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243173/is-it-a-tower-permutation&quot;&gt;Is it a tower permutation?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-02-21T18:01:37.227" LastActivityDate="2022-02-21T18:01:37.227" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24516" PostTypeId="1" CreationDate="2022-02-21T04:51:08.023" Score="6" ViewCount="220" Body="&lt;p&gt;I have recently started to use &lt;a href=&quot;https://geogebra.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;GeoGebra&lt;/a&gt; for some code golf challenges involving strings, and have come across a conundrum which I want to ask the meta about, and prompts the more general question of how GeoGebra should be scored in regards to taking in input.&lt;/p&gt;&#xA;&lt;h3&gt;The problem&lt;/h3&gt;&#xA;&lt;p&gt;I was attempting another code golf challenge in GeoGebra and realized that there was no good way of taking in string input (functions are really finicky with string input) other than directly inserting the string input into the source code. In &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte chatroom&lt;/a&gt;, I &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/60477914#60477914&quot;&gt;asked&lt;/a&gt; whether or not this was allowed, but shortly after I asked this, I found out that there is a way to create a GUI &lt;a href=&quot;https://wiki.geogebra.org/en/InputBox_Command&quot; rel=&quot;nofollow noreferrer&quot;&gt;input box&lt;/a&gt; in Geogebra. After testing the input box, I found that there was a slight complication in using the input box: strings containing commas could not be inputted through the input box, but could be inputted through direct insertion. Another problem that I found was that there was a difference between inputting a string through the input box and direction insertion; in &lt;a href=&quot;https://i.stack.imgur.com/8aTdY.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;my case&lt;/a&gt; it was that the empty string broke my code if inputted through insertion, while my code worked if inputted through the input box.&lt;/p&gt;&#xA;&lt;p&gt;Looking through some past GeoGebra posts, I found a couple of different input methods:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the input box (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/103004/plotting-the-cornu-spiral/103037#103037&quot;&gt;example&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;a variable for input, but don't include the initialization of the input variable in the byte count (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/80858/alternating-sign-sequence/81114#81114&quot;&gt;example&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;a function (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/83338/difference-of-the-square-of-the-sum/84035#84035&quot;&gt;example&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;cells of a spreadsheet (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/105282/calculate-power-series-coefficients/105289#105289&quot;&gt;example&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Question&lt;/h3&gt;&#xA;&lt;p&gt;What should be the consensus for taking in string input in GeoGebra? Is direct insertion allowed, or is the input box required (or something else entirely)? How is the problem mentioned above factored in with all of this?&lt;/p&gt;&#xA;&lt;p&gt;Based on the chat discussion with &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;@Bubbler&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;@emanresu A&lt;/a&gt;, it seems like direct insertion &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/60478046#60478046&quot;&gt;should be allowed&lt;/a&gt; for string input, though I would like a meta consensus on this.&lt;/p&gt;&#xA;" OwnerUserId="96039" LastEditorUserId="96039" LastEditDate="2022-02-21T05:24:27.417" LastActivityDate="2022-03-03T12:00:50.303" Title="How should taking in string input be scored in GeoGebra?" Tags="|discussion|scoring|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24518" PostTypeId="2" ParentId="2140" CreationDate="2022-02-21T18:35:07.487" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243463/convert-to-utf-%E2%88%9E&quot;&gt;Convert to UTF-∞&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-02-27T08:48:52.450" LastActivityDate="2022-02-27T08:48:52.450" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24519" PostTypeId="2" ParentId="2140" CreationDate="2022-02-21T19:54:27.203" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/243291/107299&quot;&gt;Posted here&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="107299" LastEditorUserId="107299" LastEditDate="2022-02-23T17:45:51.403" LastActivityDate="2022-02-23T17:45:51.403" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24520" PostTypeId="2" ParentId="2140" CreationDate="2022-02-21T20:59:29.793" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243525/output-a-random-unary-string&quot;&gt;Output a random unary string&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-03-01T11:33:28.250" LastActivityDate="2022-03-01T11:33:28.250" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="24521" PostTypeId="2" ParentId="2140" CreationDate="2022-02-22T13:58:03.000" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243701/page-selector&quot;&gt;Page Selector&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2022-03-05T13:54:59.863" LastActivityDate="2022-03-05T13:54:59.863" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="24523" PostTypeId="2" ParentId="2140" CreationDate="2022-02-22T23:34:02.250" Score="3" Body="&lt;h1&gt;Draw an ASCII Volume&lt;/h1&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243274/draw-an-ascii-volume&quot;&gt;Posted here&lt;/a&gt;&lt;/h3&gt;&#xA;" OwnerUserId="108170" LastEditorUserId="108170" LastEditDate="2022-02-23T07:29:08.197" LastActivityDate="2022-02-23T07:29:08.197" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24525" PostTypeId="2" ParentId="2140" CreationDate="2022-02-23T13:13:46.770" Score="3" Body="&lt;h1&gt;Draw a Signal strength indicator&lt;/h1&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243304/draw-a-signal-strength-indicator&quot;&gt;Posted here&lt;/a&gt;&lt;/h3&gt;&#xA;" OwnerUserId="108170" LastEditorUserId="108170" LastEditDate="2022-02-24T01:14:42.737" LastActivityDate="2022-02-24T01:14:42.737" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24526" PostTypeId="1" AcceptedAnswerId="24552" CreationDate="2022-02-24T00:00:18.023" Score="11" ViewCount="267" Body="&lt;p&gt;I'm seeking greater clarity around whether we currently allow functions to throw exceptions, and if so, under what circumstances. There seem to be contradictory posts on this topic—several highly upvoted and all with positive scores—scattered across Meta.&lt;/p&gt;&#xA;&lt;h3&gt;No exceptions&lt;/h3&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;If people answer with functions, they should take into account that the purpose of functions is to reuse them without restarting the program. If you really want to throw an error, answer with a full program.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The quote above comes from the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4781/92901&quot;&gt;accepted answer&lt;/a&gt; (+26/-3) to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/4780/92901&quot;&gt;Should submissions be allowed to exit with an error?&lt;/a&gt;. That answer, together with the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4940/92901&quot;&gt;accepted answer&lt;/a&gt; (+44/-8) to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/4939/92901&quot;&gt;Do function submissions have to be reusable?&lt;/a&gt;, proposes the following rules for function submissions (as I understand them):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Functions must be reusable arbitrarily often.&lt;/li&gt;&#xA;&lt;li&gt;Any error during a function call that terminates the call, but not the enclosing program, is permissible.&lt;/li&gt;&#xA;&lt;li&gt;Any error during a function call that either (i) unconditionally terminates the program or (ii) terminates the program unless specially handled in the external scope (e.g. wrapped in the language's equivalent of Python's &lt;code&gt;try&lt;/code&gt;/&lt;code&gt;catch&lt;/code&gt; block) is &lt;em&gt;not&lt;/em&gt; permissible.&lt;/li&gt;&#xA;&lt;li&gt;If an exception is thrown during function definition (i.e. before the function can be called), the language's equivalent of a &lt;code&gt;try&lt;/code&gt;/&lt;code&gt;catch&lt;/code&gt; block must be included in the byte count.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7615/92901&quot;&gt;accepted answer&lt;/a&gt; (+20/0) to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7614/92901&quot;&gt;What are our rules about additional code accompanying function submissions?&lt;/a&gt; further clarifies that&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Once a function has been defined, calls to that function must not rely on any additional code.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I interpret these posts to state unequivocally that functions may not throw exceptions, &lt;em&gt;even if those exceptions could be caught&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Except...&lt;/h3&gt;&#xA;&lt;p&gt;More recently, three answers to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/92901&quot;&gt;Default for Code Golf: Input/Output methods&lt;/a&gt; explicitly refer to functions throwing exceptions. Their titles are fairly self-explanatory:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11908/92901&quot;&gt;Functions may return a boolean value via the presence or absence of an error/exception&lt;/a&gt; (+44/-13)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17718/92901&quot;&gt;Functions may output via throwing the output value as an exception, if it could be caught, and read by the code catching the exception&lt;/a&gt; (+7/0)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17716/92901&quot;&gt;Functions may generate different output via different exceptions if they could be caught using different code&lt;/a&gt; (+6/0)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The first of these rules also appears to have been repeated under &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19202/92901&quot;&gt;Default policy for ouput in decision problems&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20658/92901&quot;&gt;A function submission may reject inputs by raise an exception&lt;/a&gt; (+4/0)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;These defaults would seem to allow functions to throw exceptions under certain circumstances.&lt;/p&gt;&#xA;&lt;h3&gt;Questions&lt;/h3&gt;&#xA;&lt;p&gt;I can see a few possible explanations for the apparent contradiction:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An old consensus banning functions from throwing exceptions has been superseded (or partially superseded) by a newer consensus allowing this.&lt;/li&gt;&#xA;&lt;li&gt;There is, in fact, no consensus.&lt;/li&gt;&#xA;&lt;li&gt;I've failed to grasp a meaningful (but possibly subtle) distinction between the scenarios covered by the cited groups of posts.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;My questions:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Has a blanket ban on functions throwing exceptions gone out the window?&lt;/li&gt;&#xA;&lt;li&gt;If so, are there cases in which throwing an exception from a function is still considered unacceptable, and if so, why? A non-trivial example that falls outside the scope of the 'default I/O' posts cited above is &lt;a href=&quot;https://tio.run/##KypNqvyfZvtf1y5RJ9PWoDqxxjZao0AjMTozVlMXSGrbGsZq6iUmFcdaF6Wm5Nf@T4uONjTTMTLUMTTUMYqN/Q8A&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Ruby – Try It Online&quot;&gt;this solution&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/q/205678/92901&quot;&gt;Complete a sequence using its distances&lt;/a&gt;. The function relies on an exception to terminate an indefinitely repeated process, but may be called &lt;a href=&quot;https://tio.run/##DcQ7DoAgDADQ3VN0xAjGOrgYvAjpgFITEn8BGYx6dvQNL6TxyrPOarDS6@a2jzbiENZ4KtV/pZHK2o6R@sBufzM29elXjuD2AmA2BjvZokSULREEjlNi2PxS8ObyBw&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Ruby – Try It Online&quot;&gt;arbitrarily often&lt;/a&gt; by appending a &lt;code&gt;rescue&lt;/code&gt; clause.&lt;/li&gt;&#xA;&lt;li&gt;If functions are allowed to throw exceptions (whether generally or only under specific circumstances), to what extent are the rules concerning function reusability and accompanying code still in force?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="92901" LastActivityDate="2022-03-08T00:38:49.357" Title="Functions throwing exceptions: an exception to the rules?" Tags="|discussion|rules|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24528" PostTypeId="2" ParentId="2140" CreationDate="2022-02-24T12:45:15.107" Score="0" Body="&lt;h1&gt;Draw a battery indicator&lt;/h1&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243337/draw-a-battery-indicator&quot;&gt;Posted here&lt;/a&gt;&lt;/h3&gt;&#xA;" OwnerUserId="108170" LastEditorUserId="108170" LastEditDate="2022-02-24T18:32:26.447" LastActivityDate="2022-02-24T18:32:26.447" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24529" PostTypeId="2" ParentId="5243" CreationDate="2022-02-24T12:57:29.410" Score="2" Body="&lt;h1&gt;100-200 reputation for the first crack of my &lt;a href=&quot;https://codegolf.stackexchange.com/a/242349/95126&quot;&gt;&amp;quot;Find my other token&amp;quot; answer in Husk&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;I will offer a 100 rep bounty for the first crack of this, or 200 rep if it's the cracker's first Husk post.&lt;/p&gt;&#xA;" OwnerUserId="95126" LastActivityDate="2022-02-24T12:57:29.410" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24530" PostTypeId="2" ParentId="2140" CreationDate="2022-02-24T14:12:31.907" Score="-4" Body="&lt;h1&gt;Draw a Test tube&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given the level of liquid in the test tube &lt;code&gt;L&lt;/code&gt; in the range &lt;code&gt;0-8&lt;/code&gt;. Your program should draw the following ASCII art.&lt;/p&gt;&#xA;&lt;p&gt;When &lt;code&gt;L=0&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;@@@@@@@@&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA;  @@@@&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;When &lt;code&gt;L=1&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;@@@@@@@@&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @++++@&#xA; @++++@&#xA;  @@@@&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;When &lt;code&gt;L=2&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;@@@@@@@@&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @    @&#xA; @++++@&#xA; @++++@&#xA; @++++@&#xA; @++++@&#xA;  @@@@&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And etc. You can change the characters &lt;code&gt;@&lt;/code&gt; and &lt;code&gt;+&lt;/code&gt; to any others (except spaces), it's up to you. Trailing spaces are allowed.&lt;/p&gt;&#xA;&lt;p&gt;This is a code-golf challenge so the shortest solution wins.&lt;/p&gt;&#xA;" OwnerUserId="108170" LastEditorUserId="108170" LastEditDate="2022-02-24T18:49:42.320" LastActivityDate="2022-02-24T18:49:42.320" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24531" PostTypeId="2" ParentId="2140" CreationDate="2022-02-24T14:59:31.387" Score="-1" Body="&lt;h1&gt;Draw an Erlenmeyer flask&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given the level of liquid in the Erlenmeyer flask &lt;code&gt;L&lt;/code&gt; in the range &lt;code&gt;0-6&lt;/code&gt;. Your program should draw the following ASCII art.&lt;/p&gt;&#xA;&lt;p&gt;When &lt;code&gt;L=0&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;      __________&#xA;     |_        _|&#xA;       |      |&#xA;       |      |&#xA;       |      |&#xA;       |      |&#xA;       |      |&#xA;       /      \&#xA;      /        \&#xA;     /          \&#xA;    /            \&#xA;   /              \&#xA;  /                \&#xA; /                  \&#xA;/                    \&#xA;\____________________/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;When &lt;code&gt;L=1&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;      __________&#xA;     |_        _|&#xA;       |      |&#xA;       |      |&#xA;       |      |&#xA;       |      |&#xA;       |      |&#xA;       /      \&#xA;      /        \&#xA;     /          \&#xA;    /            \&#xA;   /              \&#xA;  /                \&#xA; /  %%%%%%%%%%%%%%  \&#xA;/  %%%%%%%%%%%%%%%%  \&#xA;\____________________/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;When &lt;code&gt;L=6&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;      __________&#xA;     |_        _|&#xA;       |      |&#xA;       |  %%  |&#xA;       |  %%  |&#xA;       |  %%  |&#xA;       |  %%  |&#xA;       /  %%  \&#xA;      /  %%%%  \&#xA;     /  %%%%%%  \&#xA;    /  %%%%%%%%  \&#xA;   /  %%%%%%%%%%  \&#xA;  /  %%%%%%%%%%%%  \&#xA; /  %%%%%%%%%%%%%%  \&#xA;/  %%%%%%%%%%%%%%%%  \&#xA;\____________________/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You can change the character &lt;code&gt;%&lt;/code&gt; to any other (excluding space), it's up to you. Trailing spaces are allowed.&lt;/p&gt;&#xA;&lt;p&gt;This is a code-golf challenge so the shortest solution wins.&lt;/p&gt;&#xA;" OwnerUserId="108170" LastEditorUserId="108170" LastEditDate="2022-02-24T18:45:37.780" LastActivityDate="2022-02-24T18:45:37.780" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24532" PostTypeId="2" ParentId="2140" CreationDate="2022-02-25T02:01:12.993" Score="-3" Body="&lt;h1&gt;Beaker drawing&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to output the following beaker with the volume &lt;code&gt;n&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;_&#xA; %      %&#xA;%       %&#xA;%       %&#xA;%       %&#xA;%       %&#xA;%%%%%%%%%&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You are the fill &lt;code&gt;n&lt;/code&gt; spaces of the beaker above, so &lt;code&gt;n=5&lt;/code&gt; looks like this&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;_&#xA; %      %&#xA;%       %&#xA;%       %&#xA;%       %&#xA;%-----  %&#xA;%%%%%%%%%&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Even though this defies the law of physics, you are to output the beaker with the liquid of &lt;code&gt;n&lt;/code&gt; volume. The volume of the beaker is &lt;code&gt;35&lt;/code&gt;. The first 4 layers have a volume of 7 and the top has a layer of 6, and the &lt;code&gt;_&lt;/code&gt; represents an additional volume of &lt;code&gt;1&lt;/code&gt; if the beaker overspills.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;34&#xA;-&amp;gt;&#xA;_&#xA; %------%&#xA;%-------%&#xA;%-------%&#xA;%-------%&#xA;%-------%&#xA;%%%%%%%%%&#xA;&#xA;35&#xA;-&amp;gt;&#xA;-&#xA; %------%&#xA;%-------%&#xA;%-------%&#xA;%-------%&#xA;%-------%&#xA;%%%%%%%%%&#xA;(Note the `_` becomes a `-`)&#xA;&#xA;15&#xA;-&amp;gt;&#xA;_&#xA; %      %&#xA;%       %&#xA;%-      %&#xA;%-------%&#xA;%-------%&#xA;%%%%%%%%%&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You may assume &lt;code&gt;n&lt;/code&gt; is positive (can be 0)&lt;/p&gt;&#xA;&lt;p&gt;You may assume the beaker can overspill&lt;/p&gt;&#xA;&lt;p&gt;You may perform the &amp;quot;flood fill&amp;quot; from left to right bottom to top or right to left bottom to top.&lt;/p&gt;&#xA;&lt;p&gt;This is code-golf, so shortest code wins!&lt;/p&gt;&#xA;" OwnerUserId="109916" LastActivityDate="2022-02-25T02:01:12.993" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24535" PostTypeId="2" ParentId="2140" CreationDate="2022-02-25T09:48:22.540" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; rel=&quot;tag&quot;&gt;array&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Implement Scordle&lt;/h1&gt;&#xA;&lt;h3&gt;Background&lt;/h3&gt;&#xA;&lt;p&gt;TODO: Explain what &lt;a href=&quot;https://www.nytimes.com/games/wordle/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wordle&lt;/a&gt; and &lt;a href=&quot;https://scoredle.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Scordle&lt;/a&gt; are&lt;/p&gt;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Your task is to implement a modified version of Scordle with lists of numbers.&lt;/p&gt;&#xA;&lt;p&gt;The input contains the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The possible numbers &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;n&lt;/code&gt; that can be contained in a guess (think of this like there are 26 letters that can be used in regular Wordle)&lt;/li&gt;&#xA;&lt;li&gt;The number sequence that represents the correct answer (assume that the answer contains only numbers between &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;n&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Optional: the length &lt;code&gt;l&lt;/code&gt; (at least 1) of the correct answer&lt;/li&gt;&#xA;&lt;li&gt;The list (length 1 to 6) of the guesses (unlike Wordle, the list doesn't have to end in the correct answer, even if the length of the list is less than 6). Assume all guesses are valid.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Output a list of numbers that represent the number of possible number sequences that conform to all the clues at and before that point.&lt;/p&gt;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&lt;p&gt;Let's say that the answer is &lt;code&gt;[3,2,1]&lt;/code&gt; and the possible numbers are from &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;n=3&lt;/code&gt;. Before any guesses, there are &lt;span class=&quot;math-container&quot;&gt;\$3^3=27\$&lt;/span&gt; possible number sequences that can potentially be the answer:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1, 1, 1]&#xA;[1, 1, 2]&#xA;[1, 1, 3]&#xA;[1, 2, 1]&#xA;[1, 2, 2]&#xA;[1, 2, 3]&#xA;[1, 3, 1]&#xA;[1, 3, 2]&#xA;[1, 3, 3]&#xA;[2, 1, 1]&#xA;[2, 1, 2]&#xA;[2, 1, 3]&#xA;[2, 2, 1]&#xA;[2, 2, 2]&#xA;[2, 2, 3]&#xA;[2, 3, 1]&#xA;[2, 3, 2]&#xA;[2, 3, 3]&#xA;[3, 1, 1]&#xA;[3, 1, 2]&#xA;[3, 1, 3]&#xA;[3, 2, 1]&#xA;[3, 2, 2]&#xA;[3, 2, 3]&#xA;[3, 3, 1]&#xA;[3, 3, 2]&#xA;[3, 3, 3]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Let's say that the list of guesses is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[2,1,3],[2,2,2],[3,3,3],[3,2,1]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;After the first guess &lt;code&gt;[2,1,3]&lt;/code&gt;, all of them are yellow. Based on these clues, the remaining possible sequences are listed below:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1, 3, 2]&#xA;[3, 2, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Because there are 2 possibilities remaining, the first element in the output list will be 2.&lt;/p&gt;&#xA;&lt;p&gt;In the second guess &lt;code&gt;[2,2,2]&lt;/code&gt;, the middle &lt;code&gt;2&lt;/code&gt; will be green while the other two &lt;code&gt;2&lt;/code&gt;'s are black. This eliminates &lt;code&gt;[1,3,2]&lt;/code&gt; and leaves the only possibility &lt;code&gt;[3,2,1]&lt;/code&gt;. So the second element in the output list will be a &lt;code&gt;1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Any subsequent guesses will not affect the number of possibilities, so for the rest of the guesses, put &lt;code&gt;1&lt;/code&gt; in the output list.&lt;/p&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in byte count wins!&lt;/p&gt;&#xA;&lt;h3&gt;Test Cases (TODO)&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;answer, n, list of guesses, l&#xA;--&amp;gt; list of possibilities&#xA;--------------------------------&#xA;[3,2,1], 3, [[1,2,3],[2,2,2],[3,3,3],[3,2,1]], 3&#xA;--&amp;gt; [2,1,1,1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Suggestions for tags?&lt;/li&gt;&#xA;&lt;li&gt;I haven't put in the &lt;strong&gt;Background&lt;/strong&gt; yet, but for people who already know what Wordle and Scordle are, is the task clear?&lt;/li&gt;&#xA;&lt;li&gt;Suggested test cases?&lt;/li&gt;&#xA;&lt;li&gt;Should I make it so that the guesses always have to end in the correct answer?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="96039" LastEditorUserId="96039" LastEditDate="2022-02-26T07:09:01.060" LastActivityDate="2022-02-26T07:09:01.060" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24536" PostTypeId="2" ParentId="2140" CreationDate="2022-02-25T16:15:15.677" Score="1" Body="&lt;h1&gt;Reveal all clues of Black Box&lt;/h1&gt;&#xA;&lt;p&gt;Black Box is a board game, Your task is to reveal all clues.&lt;/p&gt;&#xA;&lt;h2&gt;What is black box&lt;/h2&gt;&#xA;&lt;p&gt;Black box is a board game with hidden atoms, Your task is given input, All atoms, reveal all clues.&lt;/p&gt;&#xA;&lt;h2&gt;I/O&lt;/h2&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;The atoms can be any 1-char that is not newline (Used for separator) Like this.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;O....&#xA;...O.&#xA;..O..&#xA;.....&#xA;....O&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;When the code reveals all clues (See Below) the output of The given input above can be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; HRHH1&#xA;H     1&#xA;R     H&#xA;H     H&#xA;2     R&#xA;H     H&#xA; H2HRH&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[&amp;quot;H&amp;quot;, &amp;quot;R&amp;quot;, &amp;quot;H&amp;quot;, &amp;quot;H&amp;quot;, &amp;quot;1&amp;quot;], [&amp;quot;1&amp;quot;, &amp;quot;H&amp;quot;, &amp;quot;H&amp;quot;, &amp;quot;R&amp;quot;, &amp;quot;H&amp;quot;], [&amp;quot;H&amp;quot;, &amp;quot;R&amp;quot;, &amp;quot;H&amp;quot;, &amp;quot;2&amp;quot;, &amp;quot;H&amp;quot;], [&amp;quot;H&amp;quot;, &amp;quot;2&amp;quot;, &amp;quot;H&amp;quot;, &amp;quot;R&amp;quot;, &amp;quot;H&amp;quot;]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Ignore the number, This doesn't mean anything, the number can be non-unique&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;h3&gt;Hit&lt;/h3&gt;&#xA;&lt;p&gt;Atoms interact with rays in three ways. A direct impact on an atom by a ray is a &amp;quot;hit&amp;quot;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;.........&#xA;.........&#xA;.O.....O.&#xA;.........&#xA;.........&#xA;...O.....H 1&#xA;.........&#xA;.......O.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Thus, ray 1 fired into the box configuration at left strikes an atom directly, generating a &amp;quot;hit&amp;quot;, designated by an &amp;quot;H&amp;quot;. A ray which hits an atom does not emerge from the box.&lt;/p&gt;&#xA;&lt;h2&gt;Deflection&lt;/h2&gt;&#xA;&lt;p&gt;The interaction resulting from a ray which does not actually hit an atom, but which passes directly to one side of the ball is called a &amp;quot;deflection&amp;quot;. The angle of deflection for this ray/atom interaction is 90 degrees. Ray 2 is deflected by the atom at left, exiting the box as shown.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    2&#xA;.........&#xA;.........&#xA;.O.....O.&#xA;.........&#xA;.........2&#xA;...O.....&#xA;.........&#xA;.......O.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Reflection&lt;/h3&gt;&#xA;&lt;p&gt;The final type of interaction of a ray with an atom is a &amp;quot;reflection&amp;quot;, designated by an &amp;quot;R&amp;quot;. This occurs in two circumstances. If an atom is at the edge of the grid, any ray which is aimed into the grid directly beside it causes a reflection.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;.........&#xA;.........&#xA;.O.....O.&#xA;.........&#xA;.........&#xA;...O.....&#xA;.........&#xA;.......O.&#xA;      RHR&#xA;      354&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Rays 3 and 4 at left would each generate a reflection, due to the atom at the edge. Ray 5 would be a hit on the atom.&lt;/p&gt;&#xA;&lt;h3&gt;Double deflection&lt;/h3&gt;&#xA;&lt;p&gt;The other circumstance leading to a reflection is when two deflections cancel out. In the grid at left, ray 6 results in a reflection due to its interaction with the atoms in the grid.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;   6&#xA;&#xA;   R&#xA;.....&#xA;..O.O&#xA;.....&#xA;.....&#xA;.....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Detour&lt;/h3&gt;&#xA;&lt;p&gt;Rays that don't result in hits or reflections are called &amp;quot;detours&amp;quot;. These may be single or multiple deflections, or misses. A detour has an entry and an exit location, while hits and reflections only have an entry location for a hit, and a single entry/exit location for a reflection.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  8   8  &#xA;.........&#xA;.........&#xA;.O.....O.&#xA;.........9&#xA;.........&#xA;...O.....&#xA;.........9&#xA;.......O.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Of course, more complex situations result when these behaviors interact. Ray 8 results in two deflections, as does ray 9.&lt;/p&gt;&#xA;&lt;p&gt;Some rays travel a twisted course, like ray 1 at left.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; .........&#xA; .........&#xA; .O.....O.&#xA; .........&#xA;1.........&#xA; ...O.....&#xA; .........&#xA; .......O.&#xA;     1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Notice that this complex set of five deflections above looks exactly like a single deflection, as shown by ray 2 at left. Things are not always as simple as they seem within a black box.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; .........&#xA; .........&#xA; .........&#xA; .....O...&#xA;1.........&#xA; .........&#xA; .........&#xA; .........&#xA;     1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Reflections and hits can be more complex, too. Ray 2 gets deflected by the first atom, reflected by the next two atoms and again deflected by the original atom, yielding a reflection.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;.O...&#xA;.....R 2&#xA;.....&#xA;.O.O.&#xA;.....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Ray 3 below gets deflected by the first atom, then by the second atom, and then hits the third atom, yielding a hit.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;   ...O.&#xA;   O....&#xA;   .....&#xA;3 H.....&#xA;   ...O.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;O....&#xA;...O.&#xA;..O..&#xA;.....&#xA;....O&#xA;-&amp;gt;&#xA; HRHH1&#xA;H     1&#xA;R     H&#xA;H     H&#xA;2     R&#xA;H     H&#xA; H2HRH&#xA;&#xA;O&#xA;-&amp;gt;&#xA; H&#xA;H H&#xA; H&#xA;&#xA;OOO&#xA;O O&#xA;OOO&#xA;-&amp;gt;&#xA; HHH&#xA;H   H&#xA;H   H&#xA;H   H&#xA; HHH&#xA;&#xA;..O..&#xA;O...O&#xA;..O..&#xA;-&amp;gt;&#xA; HRHRH&#xA;R     R&#xA;H     H&#xA;R     R&#xA; HRHRH&#xA;&#xA;...&#xA;...&#xA;...&#xA;-&amp;gt;&#xA; 123&#xA;4   4&#xA;5   5&#xA;6   6&#xA; 123&#xA;&#xA;....&#xA;O...&#xA;...O&#xA;....&#xA;-&amp;gt;&#xA; H1HH&#xA;R    1&#xA;H    R&#xA;R    H&#xA;2    R&#xA; HH2H&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Meta:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="106959" LastEditorUserId="106959" LastEditDate="2022-03-09T21:08:54.703" LastActivityDate="2022-03-09T21:08:54.703" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24537" PostTypeId="2" ParentId="2140" CreationDate="2022-02-25T19:04:56.593" Score="7" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243764/fill-in-the-next-numbers&quot;&gt;Fill in the next numbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-03-07T06:42:37.340" LastActivityDate="2022-03-07T06:42:37.340" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24538" PostTypeId="2" ParentId="2140" CreationDate="2022-02-25T19:23:37.163" Score="-3" Body="&lt;h1&gt;Play an audio file &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/audio&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;audio&amp;#39;&quot; rel=&quot;tag&quot;&gt;audio&lt;/a&gt;&lt;hr&gt;&lt;/h1&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge is simple: play an audio file at a given path. Your program will take the file path as input and will play it once and quit.&lt;/p&gt;&#xA;&lt;p&gt;To make this harder, however, you are not allowed to use external libraries, but modules that are part of your language's standard library (such as &lt;code&gt;ctypes&lt;/code&gt; below) are allowed.&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;You may assume (a) specific operating system(s) and/or (a) specific file format(s).&lt;/li&gt;&#xA;&lt;li&gt;You may assume an absolute path.&lt;/li&gt;&#xA;&lt;li&gt;You do not have to hear the sound every time; you are not expected to unmute muted speakers, and you can play through whichever audio device is the most convenient. However, it must be possible to hear it every time you run it with certain settings. A window such as &lt;code&gt;Control Panel -&amp;gt; Sound -&amp;gt; Playback&lt;/code&gt; on Windows must &lt;em&gt;always&lt;/em&gt; be able to &amp;quot;show&amp;quot; the sound being played under at least one audio device. You are allowed to play the file under a different device each run.&lt;/li&gt;&#xA;&lt;li&gt;Your program must be able to play &lt;em&gt;at least&lt;/em&gt; one of the audio file formats listed on &lt;a href=&quot;https://en.wikipedia.org/wiki/Audio_file_format#List_of_formats&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;. Other formats are allowed, as long as one of the formats listed there is supported.&lt;/li&gt;&#xA;&lt;li&gt;Outputting any content to any stream, file, etc. is allowed, but the sound must be played.&lt;/li&gt;&#xA;&lt;li&gt;Please explain your answer. This is not necessary, but it makes it easier for others to understand.&lt;/li&gt;&#xA;&lt;li&gt;Languages newer than the question are allowed. This means you could create your own language where it would be trivial to do this, but don't expect any upvotes.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Reference implementaion (ungolfed, Python 3, Windows only, &lt;code&gt;.wav&lt;/code&gt; only)&lt;/h1&gt;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;# -*- coding: utf_8 -*-&#xA;&#xA;from ctypes import windll&#xA;&#xA;winmm = windll.winmm&#xA;audio_file = input('Audio file path: ').encode('utf_8')&#xA;&#xA;winmm.PlaySound(audio_file, 0, 131072)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Golfed reference implementation&lt;/h1&gt;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;import ctypes;ctypes.windll.winmm.PlaySoundW(input(),0,131072)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="94066" LastEditorUserId="94066" LastEditDate="2022-02-25T23:09:06.950" LastActivityDate="2022-02-25T23:09:06.950" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24539" PostTypeId="2" ParentId="24508" CreationDate="2022-02-25T21:19:05.877" Score="0" Body="&lt;p&gt;&lt;strong&gt;Add a sandbox button to use instead of vote to close, or default to close for checking(edit).&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Vote to close may hurt a bit someone's feelings.&lt;/p&gt;&#xA;&lt;p&gt;Automate the move to sandbox process can make things easier.&lt;/p&gt;&#xA;&lt;p&gt;Since there's more attention in the main page, feedbacks may come more rapidly.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Edit&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Since a change in the UI is probably hard to obtain we may just default to close challenges of new users for checking or revisions.&lt;/p&gt;&#xA;&lt;p&gt;Then if the challenge was already good it will be reopened rapidly, else it will stay closed because a sandbox is required.&lt;/p&gt;&#xA;" OwnerUserId="84844" LastEditorUserId="84844" LastEditDate="2022-02-25T22:14:18.697" LastActivityDate="2022-02-25T22:14:18.697" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24540" PostTypeId="2" ParentId="2447" CreationDate="2022-02-26T12:14:10.047" Score="-6" Body="&lt;h1&gt;Programs may output only one copy as two intended ones if they're always same&lt;/h1&gt;&#xA;&lt;p&gt;This usually apply to open-ended questions if possible&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2022-02-26T12:14:10.047" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24541" PostTypeId="2" ParentId="2140" CreationDate="2022-02-26T14:36:59.043" Score="3" Body="&lt;h1&gt;Ragged slice&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to slice a ragged list. Your input is a ragged list and two lists of integers, corresponding to the beginning index and end index of the slice, where the beginning index is inclusive and the end index is exclusive.&lt;/p&gt;&#xA;&lt;h1&gt;Explanation&lt;/h1&gt;&#xA;&lt;p&gt;Let's start from the very basics. How does regular slicing work? Let's say we have the list &lt;code&gt;[a,b,c,d,e,f]&lt;/code&gt; and we want the slice &lt;code&gt;[1,4]&lt;/code&gt;. How does this work? Here is an illustration:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[a,b,c,d,e,f]&#xA;^ ^ ^ ^ ^ ^ ^&#xA;0 1 2 3 4 5 6&#xA;  v v v v&#xA;  [b,c,d]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This means that &lt;code&gt;[a,b,c,d,e,f][1,4]==[b,c,d]&lt;/code&gt;. Ragged slicing is a bit tricky, so please make sure that the previous diagram is mostly clear. Ok, now ragged lists.&lt;/p&gt;&#xA;&lt;p&gt;Let's first just draw the indices like previously for the list &lt;code&gt;[a,[b,c],[d,[e]],f]&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[a, [b,c] , [d, [e] ] ,f]&#xA;^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^&#xA;0 1 1 1 1 2 2 2 2 2 2 3 4&#xA;    0 1 2   0 1 1 1 2&#xA;                0 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Now, let's see what a slice of [1 1, 2 1 0] would look like:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[a, [b,c] , [d, [e] ] ,f]&#xA;^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^&#xA;0 1 1 1 1 2 2 2 2 2 2 3 4&#xA;    0 1 2   0 1 1 1 2&#xA;                0 1&#xA;      v v v v v v       &#xA;      ,c] , [d, [&#xA;       c] , [d&#xA;     [[c] , [d]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The last steps are probably the most confusing. But basically we want to do two things, in the following order:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Trim the left side until an element, or an opening bracket is encountered. Do the same on the right side, except with a closing bracket.&lt;/li&gt;&#xA;&lt;li&gt;Balance the remaining brackets and keep the depth of every array element the same as in the input, by wrapping the output in brackets.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Now, let's look at what happens when we have empty arrays. In fact, let's replace every letter in our previous example with an empty array:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[] , [[] ,[] ] , [[] , [[] ] ] ,[] ]&#xA;^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^&#xA;0 0 1 1 1 1 1 1 2 2 2 2 2 2 2 2 3 3 4&#xA;  0   0 0 1 1 2   0 0 1 1 1 1 2   0&#xA;        0   0       0   0 0 1&#xA;                          0&#xA;          v v v v v v v v&#xA;          ,[] ] , [[] , [&#xA;           [] ] , [[]&#xA;         [[[] ] , [[]]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Notice that for the empty array, the starting bracket doesn't have an index. This is because for an empty array, an index of 0 is already &amp;quot;one past the end&amp;quot; in an empty array, so there is no smaller index for the beginning.&lt;/p&gt;&#xA;&lt;p&gt;If we would have used index &lt;code&gt;2 1 0 0&lt;/code&gt; as the ending index, then this would have happened:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[] , [[] ,[] ] , [[] , [[] ] ] ,[] ]&#xA;^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^&#xA;0 0 1 1 1 1 1 1 2 2 2 2 2 2 2 2 3 3 4&#xA;  0   0 0 1 1 2   0 0 1 1 1 1 2   0&#xA;        0   0       0   0 0 1&#xA;                          0&#xA;          v v v v v v v v v&#xA;          ,[] ] , [[] , [[]&#xA;           [] ] , [[] , [[]&#xA;         [[[] ] , [[] , [[]]]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Lastly, let's see what happens if the slice is empty. We'll use [1 1 0, 2]:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[] , [[] ,[] ] , [[] , [[] ] ] ,[] ]&#xA;^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^&#xA;0 0 1 1 1 1 1 1 2 2 2 2 2 2 2 2 3 3 4&#xA;  0   0 0 1 1 2   0 0 1 1 1 1 2   0&#xA;        0   0       0   0 0 1&#xA;                          0&#xA;            v v v&#xA;            ] ] ,&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here after step 1, the input just disappeared. We'll just return the empty list &lt;code&gt;[]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;p&gt;Your input will contain only lists (no numbers, letters, etc.), and the starting and ending index. Indices can  in bounds or one past the last in some array. Indices are non-empty lists of non-negative integers. The starting index is not greater than then ending index.&lt;/p&gt;&#xA;&lt;p&gt;You can choose the order of the indices and also if they are 0 or 1 based (but they must be inclusive-exclusive).&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; so shortest code wins.&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;p&gt;This is a bit tricky to explain. If there were parts that were unclear, or poorly written, etc. then please comment. If you think there is a better explanation, please also let me know.&lt;/p&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-02-27T16:56:50.043" LastActivityDate="2022-02-27T16:56:50.043" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24542" PostTypeId="2" ParentId="2140" CreationDate="2022-02-26T14:43:59.357" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243884/gray-code-on-n-symbols&quot;&gt;Gray code on N symbols&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-03-09T06:43:07.840" LastActivityDate="2022-03-09T06:43:07.840" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24543" PostTypeId="2" ParentId="2140" CreationDate="2022-02-26T17:01:13.520" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243503/hello-shue-cops&quot;&gt;Hello Shue! (Cops)&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-02-28T17:00:43.360" LastActivityDate="2022-02-28T17:00:43.360" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24544" PostTypeId="2" ParentId="2140" CreationDate="2022-02-26T18:03:16.627" Score="2" Body="&lt;h1&gt;Flipping Burnt Pancakes, but Optimally!&lt;/h1&gt;&#xA;&lt;p&gt;This is based on the &lt;a href=&quot;https://en.wikipedia.org/wiki/Pancake_sorting#The_burnt_pancake_problem&quot; rel=&quot;nofollow noreferrer&quot;&gt;Burnt Pancake problem&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;In the burnt pancake problem, each “pancake” has a burnt side. You must sort these pancakes in order with the burnt side down. You may only use one tool, your spatula, which can flip the pancakes from the top of the pancake stack to where you inserted the spatula.&lt;/p&gt;&#xA;&lt;p&gt;Flipping pancakes that have the burnt side down results in those pancakes being in reverse order and having the burnt side up, and vice versa.&lt;/p&gt;&#xA;&lt;p&gt;For a given pancake stack, return the minimal number of flips needed to be made burnt pancake sorting.&lt;/p&gt;&#xA;&lt;p&gt;The output must show every step of the optimal flipping process, with the position of the spatula being represented by a pipe character, and u or b after every number representing whether or not a pancake is burnt or unburnt.&lt;/p&gt;&#xA;&lt;p&gt;Note that this is an &lt;strong&gt;NP-HARD&lt;/strong&gt; problem. You may not make an approximation algorithm.&lt;/p&gt;&#xA;&lt;h1&gt;Testcases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;1b2b3b4u returns the following:&#xA; 1b|2b3b4u&#xA; 1u2b|3b4u&#xA; 2u|1b3b4u&#xA; 2b1b|3b4u&#xA; 1u2u3b|4u&#xA; 3u|2b1b4u&#xA; 3b2b1b|4u&#xA; 1u2u3u4u&#xA;4b3b2b1b returns the following:&#xA; 4b3b2b1b|&#xA; 1u2u3u4u&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is fastest-algorithm, so the minimal time complexity wins.&lt;/p&gt;&#xA;" OwnerUserId="110993" LastEditorUserId="110993" LastEditDate="2022-03-23T15:13:28.950" LastActivityDate="2022-03-23T15:13:28.950" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24545" PostTypeId="2" ParentId="2140" CreationDate="2022-02-26T19:59:20.343" Score="0" Body="&lt;h1&gt;Is it irrational?&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to make a program that decides if a real number is irrational or not. As stated, this is obviously impossible, so instead we will use the following definition:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;p&lt;/code&gt; is your program, which takes in a decimal expansion of a number (list of integers), and returns 0 or 1. If &lt;code&gt;x&lt;/code&gt; is an irrational number, then &lt;span class=&quot;math-container&quot;&gt;\$\limsup\limits_{n\rightarrow\infty}p(x[:n])=1\$&lt;/span&gt;, and if &lt;code&gt;x&lt;/code&gt; is rational the limit superior has to be 0. &lt;span class=&quot;math-container&quot;&gt;\$x[:n]\$&lt;/span&gt; means the truncated decimal expansion, which is just the first &lt;code&gt;n&lt;/code&gt; digits after the decimal point (the integer component obviously doesn't change the irrationality).&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins. Also, standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; rules apply, so instead of outputting 0 or 1, you can output true,false, &amp;quot;Yes&amp;quot;, &amp;quot;no&amp;quot;, etc. As we know, &lt;span class=&quot;math-container&quot;&gt;\$0.999...=1\$&lt;/span&gt;, so you can assume that the decimal expansion doesn't contain a trail of repeating 9s. Instead of decimal, you can use binary.&lt;/p&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-02-26T20:06:19.747" LastActivityDate="2022-02-26T20:06:19.747" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24546" PostTypeId="2" ParentId="2140" CreationDate="2022-02-26T20:29:37.017" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243727/can-the-tune-be-played&quot;&gt;Can the Tune be Played?&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;I changed the question slightly from when it was posted on the Sandbox.&lt;/p&gt;&#xA;" OwnerUserId="110951" LastEditorUserId="110951" LastEditDate="2022-03-07T15:35:26.730" LastActivityDate="2022-03-07T15:35:26.730" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24547" PostTypeId="2" ParentId="2140" CreationDate="2022-02-28T04:43:51.110" Score="7" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243614/laggy-text-editor&quot;&gt;Laggy text editor&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-03-03T19:00:17.823" LastActivityDate="2022-03-03T19:00:17.823" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24548" PostTypeId="2" ParentId="2140" CreationDate="2022-02-28T11:12:12.287" Score="-1" Body="&lt;h1&gt;Implement a complex search engine&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Your job is to implement a search engine. The search engine should come with a few extra features to ensure that users can obtain the most relevant results.&lt;/p&gt;&#xA;&lt;h2&gt;Input, part 1&lt;/h2&gt;&#xA;&lt;p&gt;Your program will take a string as input. The string is composed of a bunch of words separated by spaces. Parsing the string is part of the task, so inputting as a list of words will not be allowed.&lt;/p&gt;&#xA;&lt;h3&gt;What's a word?&lt;/h3&gt;&#xA;&lt;p&gt;A word is composed of one or more lowercase letters. There may be a minus at the start of the word. If there is no minus, then there can be a double-quote at the beginning and/or end of the word. Double-quotes are closed, so &lt;code&gt;&amp;quot;abc de&lt;/code&gt; is not a valid input because the double-quote is never closed, but &lt;code&gt;&amp;quot;abc def&amp;quot;&lt;/code&gt; is valid because the double quote is closed.&lt;/p&gt;&#xA;&lt;h3&gt;The minus&lt;/h3&gt;&#xA;&lt;p&gt;A minus at the beginning of a word tells the search engine to not return results that contain that word.&lt;/p&gt;&#xA;&lt;h3&gt;Double-quotes&lt;/h3&gt;&#xA;&lt;p&gt;Double-quotes around strings tell the search engine to only return results that contain that string exactly.&lt;/p&gt;&#xA;&lt;h3&gt;Extra rules&lt;/h3&gt;&#xA;&lt;p&gt;There will never be any minus words contained within a quoted string. The minuses and quotes will never contradict, so &lt;code&gt;-abc &amp;quot;abc&amp;quot;&lt;/code&gt; will never be given (it tells the search engine to exclude results containing &lt;code&gt;abc&lt;/code&gt; while telling it to return only results containing &lt;code&gt;abc&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;p&gt;The string contains only minus signs, quotes, spaces, and lowercase letters. There is at least one word that is not excluded by means of a minus.&lt;/p&gt;&#xA;&lt;h2&gt;Input, part 2&lt;/h2&gt;&#xA;&lt;p&gt;The second input will be a list of strings from which the search engine will search. The strings contain only lowercase letters and spaces. You may take a newline-separated list of strings or a list of strings in your language's native input format, or any other reasonable method to input strings. (Lists of words are not allowed.)&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Return all results matching the input. Your output format can be a newline-separated list of strings, or a list of strings in your language's list format. Lists of words are forbidden.&lt;/p&gt;&#xA;&lt;p&gt;Any results that it returns must:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;contain all of the unquoted words that do not have a minus, but not necessarily in the given order;&lt;/li&gt;&#xA;&lt;li&gt;contain all quoted strings exactly;&lt;/li&gt;&#xA;&lt;li&gt;not contain any excluded words indicated by a minus.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Search query: abcdefg&#xA;List of strings: [abcdefg, abcdef, bcdefg, abcd efg]&#xA;Output: [abcdefg]&#xA;&#xA;Search query: blah blah blah&#xA;List of strings: [blah, blah blah, blah blah blah, bla hbla h]&#xA;Output: [blah, blah blah, blah blah blah]&#xA;&#xA;Search query: &amp;quot;blah blah&amp;quot; blah&#xA;List of strings: [blah, blah blah, blah blah blah, bla hbla h]&#xA;Output: [blah blah, blah blah blah]&#xA;&#xA;Search query: my name is -not ophact&#xA;List of strings: [my name is ophact, my name is not ophact, my name is op, ophact is indeed my name]&#xA;Output: [my name is ophact, ophact is indeed my name]&#xA;&#xA;Search query: &amp;quot;oh please help&amp;quot; me or &amp;quot;otherwise someone else&amp;quot;&#xA;List of strings: [oh please help me or otherwise someone who is else, oh please otherwise someone else, help me or otherwise oh someone else, or]&#xA;Output: []&#xA;&#xA;Search query: -remove -all -the -most -common -words but keep &amp;quot;everything else&amp;quot;&#xA;List of strings: [guide how to remove an item from a list, words are the rest, keep everything else but not that, remove all the most common words but keep everything else]&#xA;Output: [keep everything else but not that]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This challenge is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code, measured in bytes, wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Any feedback? Clarification needed? Other tags are suitable? Wrong testcase?&lt;/p&gt;&#xA;" OwnerUserId="106710" LastActivityDate="2022-02-28T11:12:12.287" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24549" PostTypeId="2" ParentId="2140" CreationDate="2022-02-28T17:42:56.553" Score="4" Body="&lt;h1&gt;Gambling with an Alien&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Find the challenge &lt;a href=&quot;https://codegolf.stackexchange.com/q/243604/111187&quot;&gt;here&lt;/a&gt;!&lt;/p&gt;&#xA;" OwnerUserId="111187" LastEditorUserId="111187" LastEditDate="2022-03-03T14:47:51.143" LastActivityDate="2022-03-03T14:47:51.143" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24550" PostTypeId="1" CreationDate="2022-03-01T02:05:43.433" Score="9" ViewCount="381" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19271/9288&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout March 2022, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://pari.math.u-bordeaux.fr/&quot; rel=&quot;nofollow noreferrer&quot;&gt;PARI/GP&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;What's a Language of the Month?&lt;/h2&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/9288&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during March , those who wish to participate should learn (at least the basics of) PARI/GP, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about PARI/GP&lt;/h2&gt;&#xA;&lt;p&gt;PARI/GP is a CAS (Computer Algebra System) designed for number theory. It consists of two parts: PARI is a C library, GP is an interactive shell and a scripting language. Even if you are not familiar with algebraic number theory, GP is still a powerful language for golfing math problems.&lt;/p&gt;&#xA;&lt;h2&gt;Reasons&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Intuitive syntax and good documentations. Easy to learn.&lt;/li&gt;&#xA;&lt;li&gt;Built-in types for vectors, matrices, polynomials, power series, and many other math objects.&lt;/li&gt;&#xA;&lt;li&gt;Lots of built-ins, especially for number theory, but also for linear algebra, polynomials, and other branches of algebra.&lt;/li&gt;&#xA;&lt;li&gt;Single byte operator &lt;code&gt;#&lt;/code&gt; for length (of vectors, matrices, strings, etc.).&lt;/li&gt;&#xA;&lt;li&gt;Many OEIS pages have a PARI/GP program for the sequence.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Caveats&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Not so many built-ins outside of math. On the other hand, this force you to think out of the box, for example, using polynomials to solve array challenges.&lt;/li&gt;&#xA;&lt;li&gt;Very limited array programming. You can add two vector or multiply a vector by a scalar, but there is no built-in to do element-wise multiplication.&lt;/li&gt;&#xA;&lt;li&gt;You need to know some math to master the language.&lt;/li&gt;&#xA;&lt;li&gt;The version on TIO is somewhat out of date.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://pari.math.u-bordeaux.fr/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Official website&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://pari.math.u-bordeaux.fr/pub/pari/manuals/2.13.3/tutorial.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tutorial&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#pari-gp&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://ato.pxeger.com/run?1=m728ILEoMz69YMGCpaUlaboWaBSUBgA&quot; rel=&quot;nofollow noreferrer&quot;&gt;ATO&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://pari.math.u-bordeaux.fr/gp.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Run PARI/GP in your browser&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/78193/9288&quot;&gt;Golfing tips&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://pari.math.u-bordeaux.fr/pub/pari/manuals/2.13.3/refcard.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;Reference card for 2.13.3 (the newest version)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://pari.math.u-bordeaux.fr/pub/pari/manuals/2.11.1/refcard.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;Reference card for 2.11.1 (the version on TIO)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Bounties&lt;/h2&gt;&#xA;&lt;p&gt;I (alephalpha) will be offering a +50 rep bounty to any user's first PARI/GP answer during this month, and +200 to any user's tenth PARI/GP answer during this month. This includes using the GP scripting language, or using the PARI lib in a C/C++ answer.&lt;/p&gt;&#xA;" OwnerUserId="9288" LastEditorUserId="9288" LastEditDate="2022-04-01T11:10:50.910" LastActivityDate="2022-04-01T11:10:50.910" Title="Language of the Month for March 2022: PARI/GP" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24551" PostTypeId="2" ParentId="24550" CreationDate="2022-03-01T02:08:02.473" Score="4" Body="&lt;h1&gt;List of all PARI/GP answers posted in March 2022&lt;/h1&gt;&#xA;&lt;p&gt;(first-time posters in &lt;strong&gt;bold&lt;/strong&gt;)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/243665/108218&quot;&gt;Find the Factorial!&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/108218/ginger-industries&quot;&gt;Ginger Industries&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/243517/106710&quot;&gt;Draw a battery indicator&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/106710/ophact&quot;&gt;ophact&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/243521/100664&quot;&gt;Draw an ASCII grid&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/100664&quot;&gt;emanresu A&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/244106/103854&quot;&gt;Complex permutation&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/103854/pygamer0&quot;&gt;&lt;strong&gt;PyGamer0&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243525/output-a-random-unary-string/243546#243546&quot;&gt;Output a random unary string&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/156988/codegolf-the-hafnian/243588#243588&quot;&gt;Codegolf the Hafnian&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/243652/107017&quot;&gt;Calculate a square and a square root!&lt;/a&gt; by &lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/107017/oeuf&quot;&gt;oeuf&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243764/fill-in-the-next-numbers/243775#243775&quot;&gt;Fill in the next numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243850/is-it-irrational/243883#243883&quot;&gt;Is it irrational?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/244049/zip-uneven-lists/244094#244094&quot;&gt;Zip uneven lists&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/244210/randomly-rounding/244240#244240&quot;&gt;Randomly Rounding&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110555/jezza-99&quot;&gt;&lt;strong&gt;jezza_99&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/244101/sort-numbers-in-a-ragged-list/244260#244260&quot;&gt;Sort numbers in a ragged list&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/244198/recursively-rotate-a-ragged-list/245289#245289&quot;&gt;Recursively rotate a ragged list&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245451/recreate-minecrafts-lighting/245461#245461&quot;&gt;Recreate Minecraft&amp;#39;s lighting&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245539/the-interstice-of-two-binary-numbers/245577#245577&quot;&gt;The interstice of two binary numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245583/expand-a-matrix-goo-ily/245588#245588&quot;&gt;Expand a matrix goo-ily&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245492/convert-from-twos-complement-to-decimal/245637#245637&quot;&gt;Convert from variable-width Two&amp;#39;s Complement to Integer&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/103291/joe-slater&quot;&gt;Joe Slater&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245625/remove-unmatched-brackets/245660#245660&quot;&gt;Remove unmatched brackets&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245692/removed-j-brackets/245695#245695&quot;&gt;Removed J-brackets&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245748/find-the-j-twin/245758#245758&quot;&gt;Find the J twin&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant tips posted in March 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;tip summary&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant challenges posted in March 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="9288" LastEditorUserId="9288" LastEditDate="2022-03-30T15:41:03.943" LastActivityDate="2022-03-30T15:41:03.943" CommentCount="0" CommunityOwnedDate="2022-03-01T02:08:02.473" ContentLicense="CC BY-SA 4.0" />
  <row Id="24552" PostTypeId="2" ParentId="24526" CreationDate="2022-03-01T02:13:23.653" Score="12" Body="&lt;h1&gt;Functions throwing exceptions should be allowed&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=60534423#60534423&quot;&gt;based on this brief chat conversation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;As long as the exceptions can be caught, this seems like a perfectly legitimate way of producing output or stopping the function's execution. We allow things like &lt;code&gt;await f()&lt;/code&gt; or &lt;code&gt;f(1)()&lt;/code&gt;, so &lt;code&gt;try {f()} catch (x) {...}&lt;/code&gt; seems perfectly reasonable.&lt;/p&gt;&#xA;&lt;p&gt;I wouldn't consider these functions to be non-reusable. I mean, &lt;code&gt;f(1)(2)&lt;/code&gt; also isn't reusable if you ignore how it's supposed to be called and cause an error by doing something like &lt;code&gt;f(1, 2)&lt;/code&gt;, but we ignore that since it's assumed the function is called the correct way (with a &lt;code&gt;try&lt;/code&gt;/&lt;code&gt;catch&lt;/code&gt; if exceptions can be used for output).&lt;/p&gt;&#xA;&lt;p&gt;This allows for more interesting possibilities, like quickly returning a value in a recursive solution as mentioned by l4m2, or compactly indicating things like invalid input for relevant challenges.&lt;/p&gt;&#xA;&lt;p&gt;The only situations this shouldn't be allowed, aside from when the challenge author explicitly disallows it, is if the answer uses exceptions output, but then also ignores the limitations of the machine when that can also cause an exception. E.g., relying on a maximum call stack error for one case, but also assuming that the stack can be arbitrarily large in another part of the solution.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2022-03-08T00:38:49.357" LastActivityDate="2022-03-08T00:38:49.357" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="24556" PostTypeId="2" ParentId="18751" CreationDate="2022-03-01T11:04:10.467" Score="7" Body="&lt;h1&gt;It is OK to edit someone's cops state to Cracked&lt;/h1&gt;&#xA;&lt;p&gt;In case the author is away&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2022-03-01T11:04:10.467" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24559" PostTypeId="2" ParentId="2140" CreationDate="2022-03-01T21:20:45.017" Score="-3" Body="&lt;h1&gt;Visualize tag progress&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Task is pretty simple. Given non-negative positive integers &lt;code&gt;0 ≤ s ≤ 1000&lt;/code&gt; and &lt;code&gt;0 ≤ a ≤ 200&lt;/code&gt;, your code should draw following progress bars.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;When &lt;code&gt;s ≤ 100 or a ≤ 20&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input:15 12&#xA;Output: &#xA;15/100 score&#xA;++++++------------------------------------&#xA;12/20 answers&#xA;+++++++++++++++++++++++++-----------------&#xA;&#xA;Input:3 1&#xA;Output: &#xA;3/100 score&#xA;+-----------------------------------------&#xA;1/20 answers&#xA;------------------------------------------&#xA;  &#xA;Input:85 35&#xA;Output: &#xA;85/100 score&#xA;+++++++++++++++++++++++++++++++++++-------&#xA;35/20 answers&#xA;++++++++++++++++++++++++++++++++++++++++++&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;When &lt;code&gt;(s &amp;gt; 100 and a &amp;gt; 20) and (s ≤ 400 or a ≤ 80)&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input:156 43&#xA;Output: &#xA;156/400 score&#xA;++++++++++++++++--------------------------&#xA;43/80 answers&#xA;++++++++++++++++++++++--------------------&#xA;  &#xA;Input:666 66&#xA;Output: &#xA;666/400 score&#xA;++++++++++++++++++++++++++++++++++++++++++&#xA;66/80 answers&#xA;++++++++++++++++++++++++++++++++++--------&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;When  &lt;code&gt;(s &amp;gt; 400 and a &amp;gt; 80) and (s ≤ 1000 and a ≤ 200)&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input:999 85&#xA;Output: &#xA;999/1000 score&#xA;+++++++++++++++++++++++++++++++++++++++++-&#xA;85/200 answers&#xA;+++++++++++++++++-------------------------&#xA;&#xA;Input:666 194&#xA;Output: &#xA;666/1000 score&#xA;+++++++++++++++++++++++++++---------------&#xA;194/200 answers&#xA;++++++++++++++++++++++++++++++++++++++++--&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The number of &lt;code&gt;+&lt;/code&gt;'s in each bar is equal to the value of &lt;code&gt;a&lt;/code&gt; or &lt;code&gt;s&lt;/code&gt; divided by its max value (max values for &lt;code&gt;s&lt;/code&gt; are &lt;code&gt;100&lt;/code&gt;, &lt;code&gt;400&lt;/code&gt;, &lt;code&gt;1000&lt;/code&gt; and for &lt;code&gt;a&lt;/code&gt; are &lt;code&gt;20&lt;/code&gt;, &lt;code&gt;80&lt;/code&gt;, &lt;code&gt;100&lt;/code&gt;, the choice of max values ​​depends on the ranges in which the values ​​of &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;s&lt;/code&gt; fall.), multiplied by 42 and rounded down. &lt;em&gt;This number cannot be more than 42.&lt;/em&gt;  &lt;br&gt; The number of &lt;code&gt;-&lt;/code&gt;'s is equal to 42 minus the number of &lt;code&gt;+&lt;/code&gt;'s.&lt;/p&gt;&#xA;&lt;p&gt;End etc. Trailing spaces are allowed. Additional newlines are not allowed.&lt;/p&gt;&#xA;&lt;p&gt;This is a code-golf challenge so the shortest solution wins.&lt;/p&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;p&gt;I realized that I myself got confused in my task :) ... so this task will be in completion until this text is deleted.&lt;/p&gt;&#xA;" OwnerUserId="108170" LastEditorUserId="108170" LastEditDate="2022-03-05T13:56:25.680" LastActivityDate="2022-03-05T13:56:25.680" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24560" PostTypeId="2" ParentId="2140" CreationDate="2022-03-02T03:10:45.610" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243667/fibonacci-triangle&quot;&gt;Fibonacci triangle&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-03-04T21:49:45.360" LastActivityDate="2022-03-04T21:49:45.360" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="24561" PostTypeId="2" ParentId="2140" CreationDate="2022-03-02T06:08:58.193" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243754/lexicographical-sum&quot;&gt;Lexicographical sum&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-03-07T01:15:58.900" LastActivityDate="2022-03-07T01:15:58.900" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24562" PostTypeId="2" ParentId="2140" CreationDate="2022-03-02T06:15:41.607" Score="4" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243630/crate-art-stacking&quot;&gt;Crate art stacking&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-03-03T23:44:28.267" LastActivityDate="2022-03-03T23:44:28.267" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24563" PostTypeId="2" ParentId="24516" CreationDate="2022-03-03T12:00:50.303" Score="1" Body="&lt;p&gt;There should be no special rules.&lt;/p&gt;&#xA;&lt;p&gt;I think it is best to have consistent rules governing all language rather than a mire of language specific rules and alterations.&lt;/p&gt;&#xA;&lt;p&gt;For Geogebra it seems that the only suggested input method available which meets our current guidelines is the input box. (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2459/56656&quot;&gt;See here&lt;/a&gt;.) Both insertion into the code (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24190/56656&quot;&gt;see here&lt;/a&gt;) and assignment to a variable (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8731/56656&quot;&gt;see here&lt;/a&gt;) are disallowed in general. I cannot find any reference to spreadsheet cells as an input method.  I had thought it was permitted and I would support a proposal to make it a default.  If it is allowed I think it should be allowed for all spreadsheet languages.&lt;/p&gt;&#xA;&lt;p&gt;This means embracing the difficult and strange quirks of Geogebra, when using it.  Geogebra may make it very difficult or impossible to do certain tasks.  This happens when you use things that aren't designed to be general purpose programming languages.&lt;/p&gt;&#xA;&lt;p&gt;If this really bugs you, you can always make your own language which is &lt;em&gt;like&lt;/em&gt; geogebra, but smooths over the quirks. From a quick glance it seems that at least some of Geogebra's source code is available &lt;a href=&quot;https://github.com/geogebra/geogebra&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.  It can even be a language which compiles into Geogebra.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2022-03-03T12:00:50.303" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24567" PostTypeId="2" ParentId="2140" CreationDate="2022-03-06T09:56:14.313" Score="2" Body="&lt;h1&gt;Social distance the graph&lt;/h1&gt;&#xA;&lt;p&gt;Given a connected, undirected graph like so, where various nodes are connected to each other:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/D7jXWm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/D7jXWm.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Select as many nodes as possible such that no two selected nodes are adjacent.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/1aexym.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/1aexym.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;^ made by clumsy by-hand greedy algorithm, tell me if I stuffed this up. The red ones are the selected ones.&lt;/p&gt;&#xA;&lt;p&gt;You should output the maximal number of points for which this is possible.&lt;/p&gt;&#xA;&lt;p&gt;You can take the graph in any reasonable form - as an adjacency matrix, a list of edges, a list of nodes, etc.&lt;/p&gt;&#xA;&lt;p&gt;The graph will have at least one edge, and no more than one edge connecting two points.&lt;/p&gt;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/n5jQbm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/n5jQbm.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt; -&amp;gt; 2&lt;br /&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/r1KYlm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/r1KYlm.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt; -&amp;gt; 3&lt;br /&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/D7jXWm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/D7jXWm.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt; -&amp;gt; 5&lt;br /&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/krq7Em.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/krq7Em.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt; -&amp;gt; 5&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-03-09T02:55:40.447" LastActivityDate="2022-03-09T02:55:40.447" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="24568" PostTypeId="2" ParentId="2447" CreationDate="2022-03-06T10:11:45.703" Score="14" Body="&lt;h1&gt;Spreadsheet languages can take input from a specific cell / group of cells&lt;/h1&gt;&#xA;&lt;p&gt;Most Excel / Google Sheets answers seem to do this anyway, I don't know why it wasn't here.&lt;/p&gt;&#xA;&lt;p&gt;For example, &lt;a href=&quot;https://codegolf.stackexchange.com/a/185921/100664&quot;&gt;this answer&lt;/a&gt; takes input through the A1 cell of a spreadsheet and performs operations on that to arrive at the final output.&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-03-06T18:53:46.023" LastActivityDate="2022-03-06T18:53:46.023" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24569" PostTypeId="2" ParentId="2447" CreationDate="2022-03-06T10:19:14.467" Score="10" Body="&lt;h1&gt;Spreadsheet languages may output through cell values&lt;/h1&gt;&#xA;&lt;p&gt;Most Excel / Google Sheets answers seem to do this anyway, I don't know why it wasn't here.&lt;/p&gt;&#xA;&lt;p&gt;For example, &lt;a href=&quot;https://codegolf.stackexchange.com/a/185921/100664&quot;&gt;this answer&lt;/a&gt; outputs a created piece of text to the cell it's pasted into.&lt;/p&gt;&#xA;" OwnerUserId="100664" LastActivityDate="2022-03-06T10:19:14.467" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24570" PostTypeId="1" CreationDate="2022-03-06T14:13:02.633" Score="3" ViewCount="63" Body="&lt;p&gt;We require that challenges have objective winning criteria, for reasons that have already been covered in various questions (in particular, see the link below). However, we receive many questions that do not have these criteria, and they are really annoying for many reasons.&lt;/p&gt;&#xA;&lt;p&gt;There have been a few steps taken in an attempt to ensure that new users post challenges that have objective winning criteria, as well as some steps to reduce the number of off-topic questions. These attempts include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a new question dialog (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/23485/new-first-time-asker-dialog&quot;&gt;link&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Welcome to Code Golf and Coding Challenges Stack Exchange! (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/20861/welcome-to-code-golf-and-coding-challenges-stack-exchange&quot;&gt;link&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;a message on the sidebar&lt;/li&gt;&#xA;&lt;li&gt;and probably more.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Unfortunately, however, we still receive many questions that are either:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;blatantly off-topic (mostly general programming questions like those that would be found on Stack Overflow, but sometimes also spam), or&lt;/li&gt;&#xA;&lt;li&gt;challenges that are salvageable, but initially lack key details that are required for challenges on this site, notably &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8130/why-do-we-have-objective-winning-criteria&quot;&gt;objective winning criteria&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I'd like to propose a solution that could mitigate &lt;strong&gt;both&lt;/strong&gt; of these problems:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Create some sort of automated review system that does not allow questions to be posted &lt;em&gt;unless&lt;/em&gt; there is at least one objective winning criterion. If no winning criterion is present, then show a dialog containing information about objective winning criteria, as well as a reminder that questions must be coding challenges.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The dialog could then list all of the objective winning criteria recognized by the community: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;metagolf&lt;/a&gt;, etc.&lt;/p&gt;&#xA;&lt;p&gt;Now, here are some pros and cons of such a measure.&lt;/p&gt;&#xA;&lt;h2&gt;Pros&lt;/h2&gt;&#xA;&lt;p&gt;Those who currently post Stack Overflow-esque programming questions would see a dialog which states that their questions are not welcome on the website, and would instead post their question on Stack Overflow.&lt;/p&gt;&#xA;&lt;p&gt;New users who are initially unfamiliar would get information on objective winning criteria, and then add an objective winning criterion that they see fit for their question, and said user would not get as many downvotes or comments asking for objective winning criteria.&lt;/p&gt;&#xA;&lt;p&gt;Established users who simply forgot to add an objective winning criterion would also get a reminder to do so, and would receive less negative feedback with regard to objective winning criteria.&lt;/p&gt;&#xA;&lt;p&gt;A total block on questions that do not have objective winning criteria would thus reduce the number of unfit questions.&lt;/p&gt;&#xA;&lt;h2&gt;Cons&lt;/h2&gt;&#xA;&lt;p&gt;Of course, some users will just ignore the dialog and tack on a random objective winning criterion. This is especially true for some spammers; their questions usually come with a bunch of random tags, and my proposed measure would do nothing to prevent their questions from being posted.&lt;/p&gt;&#xA;&lt;p&gt;Note as well that the implementation of such a measure might not be possible given the rejection of similar measures previously.&lt;/p&gt;&#xA;&lt;h2&gt;Conclusion&lt;/h2&gt;&#xA;&lt;p&gt;Overall, I think such a measure would be useful to cut down on the number of unfit questions we receive on this website.&lt;/p&gt;&#xA;" OwnerUserId="106710" LastActivityDate="2022-03-06T14:13:02.633" Title="Off-topic questions: could we require objective winning criteria?" Tags="|feature-request|new-users|winning-criteria|" AnswerCount="0" CommentCount="1" ClosedDate="2022-03-06T16:57:20.827" ContentLicense="CC BY-SA 4.0" />
  <row Id="24571" PostTypeId="2" ParentId="2140" CreationDate="2022-03-06T22:03:01.667" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/243895/107299&quot;&gt;The Nineteenth Bakery&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="107299" LastEditorUserId="107299" LastEditDate="2022-03-09T16:06:18.343" LastActivityDate="2022-03-09T16:06:18.343" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24574" PostTypeId="2" ParentId="20722" CreationDate="2022-03-07T17:32:53.483" Score="8" Body="&lt;p&gt;When I first started coding, I started in Scratch with my friend. He gave us the username &lt;code&gt;segganew&lt;/code&gt;, with a lowercase &lt;code&gt;s&lt;/code&gt; (my &amp;quot;junk&amp;quot; email is still &lt;code&gt;segganew@gmail.com&lt;/code&gt;). I decided to use it for a mobile game back when I just started having an online presence. My alliance ended up calling me &lt;code&gt;Seggan&lt;/code&gt; (uppercase &lt;code&gt;S&lt;/code&gt; because mobile) in chat, and I guess that name stuck. Before I used &lt;code&gt;Seggan&lt;/code&gt;, I mostly had &lt;code&gt;Dan_the_Man&lt;/code&gt;, although there were a few exceptions here and there. It is pronounced &lt;code&gt;S egg an&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;My avatar, if you zoom in, is a purple gas giant planet with a terrestrial moon orbiting it. I designed it in an online program that I forgot the name of.&lt;/p&gt;&#xA;" OwnerUserId="107299" LastEditorUserId="107299" LastEditDate="2022-11-16T17:12:36.783" LastActivityDate="2022-11-16T17:12:36.783" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="24576" PostTypeId="2" ParentId="2140" CreationDate="2022-03-07T21:07:37.177" Score="0" Body="&lt;h1&gt;Pick the best seat in a vehicle&lt;/h1&gt;&#xA;&lt;p&gt;We have eight seats in a vehicle, represented by numbers:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1  2  3  4&#xA;5  6  7  8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Two people get in. First person will pick the seat X. Number X will be inputted to the program. The second person will pick the furthest seat from the first person. Output (or return, if a function) the seat number which person B will take.&lt;/p&gt;&#xA;&lt;p&gt;All seats are on the same elevation, and can be represented with two integers in a coordinate grid. The difference between two adjacent seats (horizontally or vertically) is the same between every seat.&lt;/p&gt;&#xA;&lt;p&gt;For example, if person A chose seat number 7, person B will sit on 1.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;1 &amp;lt;= X &amp;lt;= 8&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;All possible combinations: (the output for specific input is shown directly underneath the input)&#xA;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1   2   3   4   5   6   7   8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;8   8   5   5   4   4   1   1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="111380" LastEditorUserId="111380" LastEditDate="2022-03-10T10:18:07.610" LastActivityDate="2022-03-10T10:18:07.610" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24578" PostTypeId="2" ParentId="2140" CreationDate="2022-03-08T12:17:46.480" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243990/pairs-of-integers-ordered-by-their-exponentiation&quot;&gt;Pairs of integers ordered by their exponentiation&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-03-11T06:39:17.157" LastActivityDate="2022-03-11T06:39:17.157" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24579" PostTypeId="2" ParentId="2140" CreationDate="2022-03-08T18:58:22.623" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/243958/107299&quot;&gt;Repeat List Until Longer&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="107299" LastEditorUserId="107299" LastEditDate="2022-03-10T21:06:48.867" LastActivityDate="2022-03-10T21:06:48.867" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24581" PostTypeId="2" ParentId="2140" CreationDate="2022-03-08T23:54:25.040" Score="6" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243925/building-spikes&quot;&gt;Building spikes&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-03-10T03:44:01.523" LastActivityDate="2022-03-10T03:44:01.523" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24583" PostTypeId="2" ParentId="2140" CreationDate="2022-03-10T13:47:24.090" Score="2" Body="&lt;h1&gt;String table&lt;/h1&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243944/generate-this-string-table&quot;&gt;Posted here&lt;/a&gt;&lt;/h3&gt;&#xA;" OwnerUserId="108170" LastEditorUserId="108170" LastEditDate="2022-03-10T15:11:00.983" LastActivityDate="2022-03-10T15:11:00.983" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24584" PostTypeId="2" ParentId="2140" CreationDate="2022-03-10T19:25:38.323" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243973/resolve-references-in-a-chat-discussion&quot;&gt;Resolve references in a chat discussion&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2022-03-10T23:49:03.947" LastActivityDate="2022-03-10T23:49:03.947" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24585" PostTypeId="2" ParentId="2140" CreationDate="2022-03-11T01:27:40.293" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/244092/circular-chained-compound&quot;&gt;Circular chained compound&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-03-14T00:41:51.707" LastActivityDate="2022-03-14T00:41:51.707" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24586" PostTypeId="2" ParentId="2140" CreationDate="2022-03-11T09:58:15.263" Score="5" Body="&lt;h1&gt;Satisfy as many people as possible&lt;/h1&gt;&#xA;&lt;p&gt;Posted &lt;a href=&quot;https://codegolf.stackexchange.com/q/245549/106710&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="106710" LastEditorUserId="106710" LastEditDate="2022-03-24T18:08:07.793" LastActivityDate="2022-03-24T18:08:07.793" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24587" PostTypeId="2" ParentId="2140" CreationDate="2022-03-11T22:16:57.127" Score="4" Body="&lt;h1&gt;Can you decrypt me?&lt;/h1&gt;&#xA;&lt;h2&gt;Cops&lt;/h2&gt;&#xA;&lt;p&gt;Cops, post obfuscated code that hides a number &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; inside its code. If &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; chars are changed, the program outputs &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;. Otherwise, it outputs a different number. Both programs may not error, and there can be multiple solutions.&lt;/p&gt;&#xA;&lt;h2&gt;Robbers&lt;/h2&gt;&#xA;&lt;p&gt;Find any combination of chars to change and what they should change into. You may not crack a cop's answer with anything of the form &lt;code&gt;loop through all possible changes, find one that works&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;print(2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;N is 1.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Robbers' post:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;print(1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Cops, the user with the most uncracked posts wins.&#xA;Robbers, the user with the most cracks wins.&lt;/p&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2024-01-12T21:02:37.187" LastActivityDate="2024-01-12T21:02:37.187" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="24588" PostTypeId="2" ParentId="2140" CreationDate="2022-03-11T22:55:36.030" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/244101/sort-numbers-in-a-ragged-list/&quot;&gt;Sort numbers in a ragged list&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-03-14T04:20:34.617" LastActivityDate="2022-03-14T04:20:34.617" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24589" PostTypeId="2" ParentId="2140" CreationDate="2022-03-12T04:23:56.703" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245315/the-missing-match&quot;&gt;The Missing Match&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108556" LastEditorUserId="108556" LastEditDate="2022-03-19T06:49:41.307" LastActivityDate="2022-03-19T06:49:41.307" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24590" PostTypeId="2" ParentId="2140" CreationDate="2022-03-12T20:12:39.327" Score="0" Body="&lt;h1&gt;All empty cells are neighbours&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Given dimensions of a 2D grid &lt;span class=&quot;math-container&quot;&gt;\$n&amp;gt;1,m&amp;gt;1\$&lt;/span&gt;, output the size (number od cells) of the minimal connected region, so that every empty cell is its neighbour.&lt;/p&gt;&#xA;&lt;p&gt;Cells are neighbouring (or connected) when they share a side, so no diagonal connections.&lt;/p&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;When putting together jigsaw puzzles with my son, I always try to reach a single connected region of solved pieces such that empty places have at least one piece to connect to. This way he can test every loose piece one place after another, and always find a spot to fit it.&lt;/p&gt;&#xA;&lt;h2&gt;Details&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may take &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt; in any reasonable format and output corresponding region size.&lt;/li&gt;&#xA;&lt;li&gt;You may also output as an infinite sequence, as long as you use a bijection of  &lt;span class=&quot;math-container&quot;&gt;\$\{2,3,\ldots\}\times\{2,3,\ldots\}\$&lt;/span&gt; into &lt;span class=&quot;math-container&quot;&gt;\$\mathbb{N}\$&lt;/span&gt; (and provide it in your answer).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;n=2, m=3 -&amp;gt; 3&#xA;Example grid (you don't need to output that):&#xA;###&#xA;...&#xA;n=3, m=4 -&amp;gt; 4&#xA;....&#xA;####&#xA;....&#xA;n=4, m=4 -&amp;gt; 8&#xA;....&#xA;####&#xA;####&#xA;....&#xA;n=4, m=5 -&amp;gt; 9&#xA;....&#xA;####&#xA;...#&#xA;####&#xA;....&#xA;n=2, m&amp;gt;1 -&amp;gt; m&#xA;n=3, m&amp;gt;1 -&amp;gt; m&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Better title?&lt;/li&gt;&#xA;&lt;li&gt;Better tags?&lt;/li&gt;&#xA;&lt;li&gt;Is the output as infinite sequence well defined?&lt;/li&gt;&#xA;&lt;li&gt;Any mistakes in the examples?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="55372" LastActivityDate="2022-03-12T20:12:39.327" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24591" PostTypeId="2" ParentId="2140" CreationDate="2022-03-12T22:10:30.257" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/244195/104836&quot;&gt;Implement a very simple ALU using only NAND gates&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="104836" LastEditorUserId="104836" LastEditDate="2022-03-16T00:55:41.343" LastActivityDate="2022-03-16T00:55:41.343" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24592" PostTypeId="2" ParentId="2140" CreationDate="2022-03-14T02:34:02.130" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/244176/110555&quot;&gt;Negative of an ASCII photo&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110555" LastEditorUserId="110555" LastEditDate="2022-03-15T20:54:13.577" LastActivityDate="2022-03-15T20:54:13.577" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24594" PostTypeId="2" ParentId="2140" CreationDate="2022-03-15T14:00:14.483" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/246845&quot;&gt;Convert JSON object of directories to list of paths&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="73593" LastEditorUserId="97857" LastEditDate="2022-05-03T14:07:07.130" LastActivityDate="2022-05-03T14:07:07.130" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="24595" PostTypeId="2" ParentId="2140" CreationDate="2022-03-15T17:26:33.690" Score="0" Body="&lt;h1&gt;Finding an element in an array&lt;/h1&gt;&#xA;&lt;p&gt;Please tell me whether this challenge has been created or is in the sandbox! I tried searching for it, but with thousands of pages, I easily could have missed one.&lt;/p&gt;&#xA;&lt;h2&gt;Your task:&lt;/h2&gt;&#xA;&lt;p&gt;Given an input of an array, and a certain element found in that array, output the coordinates of the element. Output a falsey value if the element cannot be found in the array.&lt;/p&gt;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The array will be made of single (non-space) ASCII characters. The element to be found in the array can be input either before or after the array&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;e3R5     e&#xA;p10-     e3R5&#xA;.v!x     p10-&#xA;0&amp;gt;3v     .v!x&#xA;e        0&amp;gt;3v&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You must output the coordinates of the element found in the list. The top left corner is (0,0)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;(0,0)  (1,0)  (2,0)&#xA;(0,1)  (1,1)  (2,1)&#xA;(0,2)  (1,2)  (2,2)&#xA;(0,3)  (1,3)  (2,3)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Keep the x and y coordinates separate. &lt;code&gt;(0,1)&lt;/code&gt; and &lt;code&gt;0 1&lt;/code&gt; and &lt;code&gt;0,1&lt;/code&gt; are all valid outputs, but &lt;code&gt;01&lt;/code&gt; is not.&lt;/li&gt;&#xA;&lt;li&gt;You can assume there will not be more than one of the specified element in the array, but other elements may appear more than once.&lt;/li&gt;&#xA;&lt;li&gt;This challenge is case-sensitive!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test Cases:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;e3R5&#xA;p10-&#xA;.v!x&#xA;0&amp;gt;3v&#xA;e&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Result:(0,0)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;43T0*x&#xA;\@.2,c&#xA;''b%gP&#xA;5qQ}#m&#xA;q&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Result:(1,3)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;mW(&#xA;iMz&#xA;EA/&#xA;$&amp;quot;t&#xA;a]:&#xA;7&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Result: (falsey)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;-c2?08r,TZTj&#xA;&amp;quot;^9LT^*`LFu2&#xA;^&amp;quot;~l6-PiyPo8&#xA;,f=[aOv50ZnO&#xA;`&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Result: (7,2)&lt;/p&gt;&#xA;" OwnerUserId="111498" LastActivityDate="2022-03-15T17:26:33.690" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24597" PostTypeId="2" ParentId="2140" CreationDate="2022-03-15T22:06:09.253" Score="-3" Body="&lt;p&gt;Your task is to create an approximation for sin(x) in the fewest characters possible.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Given the approximation s(x), it must satisfy 0.95 * sin(x) &amp;lt;= s(x) &amp;lt;= 1.05 * sin(x)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The entry with the fewest characters wins.&lt;/p&gt;&#xA;" OwnerUserId="104188" LastActivityDate="2022-03-15T22:06:09.253" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24599" PostTypeId="2" ParentId="2140" CreationDate="2022-03-17T17:01:28.843" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245492/convert-from-twos-complement-to-decimal&quot;&gt;Convert from Two's Complement to Decimal&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108673" LastEditorUserId="96039" LastEditDate="2022-03-24T01:39:48.240" LastActivityDate="2022-03-24T01:39:48.240" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24600" PostTypeId="2" ParentId="2140" CreationDate="2022-03-17T18:57:39.683" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245625/remove-unmatched-brackets&quot;&gt;Remove unmatched brackets&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-03-26T20:09:15.200" LastActivityDate="2022-03-26T20:09:15.200" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="24601" PostTypeId="2" ParentId="2140" CreationDate="2022-03-18T01:28:20.100" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245414/sandbox-overflow&quot;&gt;Sandbox overflow&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-03-22T07:27:31.293" LastActivityDate="2022-03-22T07:27:31.293" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24603" PostTypeId="2" ParentId="2140" CreationDate="2022-03-18T08:23:14.193" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245454/spaceship-shooter&quot;&gt;Spaceship shooter&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-03-23T00:00:31.333" LastActivityDate="2022-03-23T00:00:31.333" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24604" PostTypeId="2" ParentId="2140" CreationDate="2022-03-18T16:37:52.433" Score="-4" Body="&lt;h1&gt;Generate a random string of length 8&lt;/h1&gt;&#xA;&lt;p&gt;The challenge is pretty simple. Generate a random (non-zero chance) string of length 8, using ASCII characters from 33-126 (&lt;code&gt;!&lt;/code&gt; to &lt;code&gt;~&lt;/code&gt;). (1-32 and aren't included because they don't show up/may cause interference.)&lt;br&gt;&#xA;Remember that this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer wins!&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All standard rules apply&lt;/li&gt;&#xA;&lt;li&gt;All characters must be in one continuous string, so no line breaks, spaces, etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Example code&lt;/h1&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;import random&#xA;i=8&#xA;j=&amp;quot;&amp;quot;&#xA;while i!=0:&#xA;    j+=(chr(random.randint(33,127)))&#xA;    i-=1&#xA;print(j)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##K6gsycjPM/7/PzO3IL@oRKEoMS8lP5cr09aCK8tWSYmrPCMzJ1UhU9HWwIpLAQiytG01kjOKNCDq9EBUZl6JhrGxjqGRuaamJlhRpq6tIVdBEUgiS/P/fwA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 3 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Tags&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="111518" LastEditorUserId="111518" LastEditDate="2022-03-21T21:42:01.720" LastActivityDate="2022-03-21T21:42:01.720" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="24605" PostTypeId="2" ParentId="2140" CreationDate="2022-03-18T21:20:14.880" Score="3" Body="&lt;h1&gt;Draw the Ukrainian Flag&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245318/draw-the-ukrainian-flag&quot;&gt;Draw the Ukrainian Flag&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2022-03-19T14:09:49.883" LastActivityDate="2022-03-19T14:09:49.883" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24606" PostTypeId="2" ParentId="5243" CreationDate="2022-03-19T05:13:26.040" Score="1" Body="&lt;h1&gt;100-600 rep for answering &lt;a href=&quot;https://codegolf.stackexchange.com/questions/191294/draw-the-biohazard-symbol?noredirect=1&amp;amp;lq=1&quot;&gt;Draw the Biohazard Symbol&lt;/a&gt; in Desmos (both &lt;a href=&quot;https://codegolf.stackexchange.com/questions/191294/draw-the-biohazard-symbol/246880#246880&quot;&gt;completed by fireflame241&lt;/a&gt;)&lt;/h1&gt;&#xA;&lt;p&gt;I'm offering 100 rep for the first answer to the linked question in desmos.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, I'm offering 500 rep for an answer that uses a single equation to express the symbol.&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-05-07T21:23:56.610" LastActivityDate="2022-05-07T21:23:56.610" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24607" PostTypeId="2" ParentId="2140" CreationDate="2022-03-19T10:06:07.193" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245384/convert-between-graph-representations&quot;&gt;Convert between graph representations.&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="103854" LastEditorUserId="103854" LastEditDate="2022-03-21T12:23:04.990" LastActivityDate="2022-03-21T12:23:04.990" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24609" PostTypeId="2" ParentId="20722" CreationDate="2022-03-19T19:55:45.590" Score="5" Body="&lt;p&gt;My username isn't really anything special, it's just my hair color. My profile picture came from an offhanded comment from Wzl about needing to see a cat with a ಠ_ಠ face.&lt;/p&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2023-02-25T20:30:25.890" LastActivityDate="2023-02-25T20:30:25.890" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24610" PostTypeId="2" ParentId="2140" CreationDate="2022-03-20T13:19:00.287" Score="2" Body="&lt;h1&gt;Is it a base-&lt;span class=&quot;math-container&quot;&gt;\$\infty\$&lt;/span&gt; prime?&lt;/h1&gt;&#xA;&lt;p&gt;To explain how base-&lt;span class=&quot;math-container&quot;&gt;\$\infty\$&lt;/span&gt; numbers work, let's  look at how base 10 arithmetic works. We can view a base 10 number as a list of digits (numbers). So &lt;code&gt;123&lt;/code&gt; is &lt;code&gt;[1,2,3]&lt;/code&gt; and so on. When we add numbers, we use the standard long addition, meaning we add digit by digit, carrying if necessary. For example, &lt;code&gt;123+798&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  ₁₁ &#xA;  123&#xA;+ 798&#xA;-----&#xA;  921&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Similarly, multiplication can be done using long multiplication. For example, &lt;code&gt;123*798&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    123&#xA;*   798&#xA;-------&#xA;    984&#xA;  1107&#xA;+ 861&#xA;-------&#xA;  98154&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Now, like the name suggest, base-&lt;span class=&quot;math-container&quot;&gt;\$\infty\$&lt;/span&gt; numbers have infinitely many possible digits. Therefore we can represent a base-&lt;span class=&quot;math-container&quot;&gt;\$\infty\$&lt;/span&gt; number as a list of integers. For lists consisting of only non-negative numbers, addition and multiplication are straightforward. For example, &lt;code&gt;[19,53,1]+[8,4]=[19,53,1]+[0,8,4]=[19,61,5]&lt;/code&gt; and &lt;code&gt;[1,2]*[3,4]=[1,2]*[3,0]+[1,2]*[4]=[3,6,0]+[4,8]=[3,10,8]&lt;/code&gt;. When restricted to non-negative numbers, carrying doesn't occur.&lt;/p&gt;&#xA;&lt;p&gt;Negative numbers however spice things up. Let's look first how &lt;code&gt;[-1]&lt;/code&gt; works. Let's see what happens when we add &lt;code&gt;[1]&lt;/code&gt; to it:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;[-1]+[1]=[1,0]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;We get &lt;code&gt;[1,0]&lt;/code&gt;. Before explaining how this works, it may be helpful to look at a related example in base-10:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;9 + 1 = 10&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Do you see the similarities? Nine is just ten &lt;em&gt;minus one&lt;/em&gt;. Anyways, what is happening is that when you cross the boundary from the negatives to the positives, you carry one, so you end up with &lt;code&gt;[1,0]&lt;/code&gt; where the one is carried.&lt;/p&gt;&#xA;&lt;p&gt;Let's see what happens when we add &lt;code&gt;[-1]&lt;/code&gt; to &lt;code&gt;[-1]&lt;/code&gt;. We can reason in this way:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;[-1]+[-1]=[-1]+[1]+[-2]=[1,0]+[-2]=[1,-2]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Here is the related base-10 example:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;9 + 9 = 18&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Ok, here is a more complicated example&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;[1,3,-2,-3,6]+[1,5,-1]=[1,4,0,3,5]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;And the base-10 equivalent&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;13876+159=14035&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;For singular non-negative integers, multiplication works as you'd expect:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;[3]*[1,-2,3]=[1,-2,3]+[1,-2,3]+[1,-2,3]=[5,-6,9]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;For singular negative integers, we can use the following trick:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;[-3]*[1,-2,3]=([1,0] - [3])*[1,-2,3]=[1,0]*[1,-2,3]-[3]*[1,-2,3]=[1,-2,3,0]-[5,-6,9]=[1,-8,9,-9]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;where &lt;code&gt;a-b=c&lt;/code&gt; iff &lt;code&gt;b+c=a&lt;/code&gt; (subtraction is well defined as long as &lt;code&gt;a&amp;gt;=b&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;p&gt;Here is a base-10 example:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;[-1]*[-1]=[-2,1]&lt;/code&gt;&#xA;&lt;code&gt;9*9=81&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;For multiplying with longer numbers, we just distribute the addition:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;[a,b,c]*[d,e,f]=[a,0,0]*[d,e,f]+[b,0]*[d,e,f]+[c]*[d,e,f]=[a]*[d,e,f,0,0]+[b]*[d,e,f,0]+[c]*[d,e,f]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Basically just doing long multiplication.&lt;/p&gt;&#xA;&lt;h1&gt;Primes&lt;/h1&gt;&#xA;&lt;p&gt;A prime number is a number which cannot be expressed as a non-trivial product. A non-trivial product is a product which doesn't contain the multiplicative identity (&lt;code&gt;[1]&lt;/code&gt;). By convention, the multiplicative identity is not a prime.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to take a base-&lt;span class=&quot;math-container&quot;&gt;\$\infty\$&lt;/span&gt; number as input and decide if it's a prime.&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; rules apply. You may assume that the input doesn't contain leading zeros. You may choose whether the additive identity (zero) is represented as &lt;code&gt;[]&lt;/code&gt; or &lt;code&gt;[0]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Mathematical definition of addition and multiplication&lt;/h1&gt;&#xA;&lt;p&gt;Addition:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[] + b = b&#xA;a + [] = a&#xA;[...ia,la] + [...ib,lb] = [...(ia + ib + carry(la, lb)), la+lb]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;where&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;carry(a,b) = [(a &amp;lt; 0 and b &amp;lt; 0) or (a + b &amp;gt;= 0 and min(a,b) != 0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Multiplication:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[] * b = []&#xA;[..ia, 0] * b = [...(ia*b),0]&#xA;[..ia,-a] * b = [...(ia + [1]), 0]*b - [a]*b&#xA;[..ia, a + 1] * b = [..ia, a]*b + b&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Where &lt;code&gt;a-b&lt;/code&gt; is the unique solution to &lt;code&gt;b+x=a&lt;/code&gt; (guaranteed to be well defined when using the above definitions)&lt;/p&gt;&#xA;&lt;h1&gt;Test cases:&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;[0] -&amp;gt; False&#xA;[1] -&amp;gt; False&#xA;[2] -&amp;gt; True&#xA;[3] -&amp;gt; True&#xA;[4] -&amp;gt; False&#xA;[5] -&amp;gt; True&#xA;[6] -&amp;gt; False&#xA;[7] -&amp;gt; True&#xA;[8] -&amp;gt; False&#xA;[9] -&amp;gt; False&#xA;[10] -&amp;gt; False&#xA;[11] -&amp;gt; True&#xA;[12] -&amp;gt; False&#xA;[-12] -&amp;gt; True&#xA;[-11] -&amp;gt; True&#xA;[-10] -&amp;gt; True&#xA;[-9] -&amp;gt; True&#xA;[-8] -&amp;gt; True&#xA;[-7] -&amp;gt; True&#xA;[-6] -&amp;gt; True&#xA;[-5] -&amp;gt; True&#xA;[-4] -&amp;gt; True&#xA;[-3] -&amp;gt; True&#xA;[-2] -&amp;gt; True&#xA;[-1] -&amp;gt; True&#xA;[1,0] -&amp;gt; True&#xA;[1,1] -&amp;gt; True&#xA;[1,2] -&amp;gt; True&#xA;[1,3] -&amp;gt; True&#xA;[1,4] -&amp;gt; True&#xA;[1,-4] -&amp;gt; False&#xA;[1,-3] -&amp;gt; True&#xA;[1,-2] -&amp;gt; False&#xA;[1,-1] -&amp;gt; True&#xA;todo add more test cases&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="84290" LastActivityDate="2022-03-20T13:19:00.287" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24611" PostTypeId="2" ParentId="2140" CreationDate="2022-03-21T17:29:15.080" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245559/resolve-a-super-auto-pets-round&quot;&gt;Resolve a Super Auto Pets Round&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="67809" LastEditorUserId="67809" LastEditDate="2022-03-24T21:25:09.087" LastActivityDate="2022-03-24T21:25:09.087" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24612" PostTypeId="2" ParentId="2140" CreationDate="2022-03-21T20:19:39.783" Score="1" Body="&lt;h1&gt;Overlay the Ukrainian Flag&lt;/h1&gt;&#xA;&lt;p&gt;A pseudo-sequel to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/245318/draw-the-ukrainian-flag&quot;&gt;this challenge&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;As of the posting of this challenge, my PFP has a blue-and-yellow overlay in support of Ukraine. Your task is to, given the path to an input image, overlay a similar image on top.&lt;/p&gt;&#xA;&lt;p&gt;Here is the flag:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/FlBGh.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/FlBGh.png&quot; alt=&quot;Ukrainian Flag&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The flag is divided horizontally across the middle into two equally sized stripes.&lt;/li&gt;&#xA;&lt;li&gt;Stripe colors: &lt;code&gt;(0, 87, 183)&lt;/code&gt; or &lt;code&gt;#0057B7&lt;/code&gt; (blue, top) and &lt;code&gt;(255, 215, 0)&lt;/code&gt; or &lt;code&gt;#FFD700&lt;/code&gt; (yellow, bottom).&lt;/li&gt;&#xA;&lt;li&gt;You must, given the path to an image as input, overlay two semi-transparent rectangles of those colors onto it. The rectangles must each take up half the vertical area of the image, and be as wide as the image.&lt;/li&gt;&#xA;&lt;li&gt;The rectangles must have 70% opacity.&lt;/li&gt;&#xA;&lt;li&gt;Colors must be exact if possible, otherwise use the closest available blue and yellow.&lt;/li&gt;&#xA;&lt;li&gt;The image can be saved to a file or piped raw to STDOUT in any common image file format, or it can be displayed in a window.&lt;/li&gt;&#xA;&lt;li&gt;If you're saving to a file, you may either overwrite the old image or create a new one.&lt;/li&gt;&#xA;&lt;li&gt;Built-in flag images, flag-drawing libraries, or &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/60681392#60681392&quot;&gt;horrendously upscaling the Ukrainian flag emoji&lt;/a&gt; are prohibited.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="108218" LastActivityDate="2022-03-21T20:19:39.783" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24615" PostTypeId="2" ParentId="2140" CreationDate="2022-03-22T18:04:47.017" Score="9" Body="&lt;p&gt;&lt;em&gt;Edit: Posted.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/245511/111305&quot;&gt;Output this string from the &lt;code&gt;kolmogorov-complexity&lt;/code&gt; tag info page&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="111305" LastEditorUserId="111305" LastEditDate="2022-03-23T22:03:16.920" LastActivityDate="2022-03-23T22:03:16.920" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24616" PostTypeId="2" ParentId="2140" CreationDate="2022-03-22T18:37:03.920" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/245538/111322&quot;&gt;Draw an ASCII envelope&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="111322" LastEditorUserId="111322" LastEditDate="2022-03-24T15:32:14.937" LastActivityDate="2022-03-24T15:32:14.937" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24617" PostTypeId="1" AcceptedAnswerId="24623" CreationDate="2022-03-23T14:53:24.940" Score="12" ViewCount="227" Body="&lt;p&gt;Apologies if this isn't the right thing to post in codegolf meta, but I have no idea where else to post this.&lt;/p&gt;&#xA;&lt;p&gt;A while back, KSab wrote a tool that brute forces Brainfuck code. I'd like to codegolf with it, but it's down.&lt;/p&gt;&#xA;&lt;p&gt;Does someone still have it?&lt;/p&gt;&#xA;" OwnerUserId="110993" LastActivityDate="2022-03-24T18:59:20.843" Title="Source for bfbrute?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24618" PostTypeId="2" ParentId="2140" CreationDate="2022-03-23T20:14:03.647" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245675/make-a-interpreter&quot;&gt;Interpret +-=&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="111518" LastEditorUserId="111518" LastEditDate="2022-03-28T21:29:58.433" LastActivityDate="2022-03-28T21:29:58.433" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="24620" PostTypeId="2" ParentId="2140" CreationDate="2022-03-24T10:37:27.440" Score="0" Body="&lt;p&gt;Given a current page number (&lt;code&gt;p&lt;/code&gt;), pages to show (&lt;code&gt;s&lt;/code&gt;), and max pages (&lt;code&gt;m&lt;/code&gt;), create the classic pagination, marking the current page as active (&lt;code&gt;*&lt;/code&gt;) and using &lt;code&gt;...&lt;/code&gt;'s for any outside the range.&lt;/p&gt;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;p = 1, s = 5, m = 15&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Should output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1* 2 3 4 5 ... 15&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Or&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;p = 7, s = 5, m = 15 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;should output&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 ... 5 6 7* 8 9 ... 15&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;p = 2, s = 5, m = 4 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Should output&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 2* 3 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;It can be assumed that pages to show (&lt;code&gt;s&lt;/code&gt;) is always odd, so the active page is often in the middle of the set of numbers.&lt;/p&gt;&#xA;" OwnerUserId="50014" LastActivityDate="2022-03-24T10:37:27.440" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24621" PostTypeId="2" ParentId="2140" CreationDate="2022-03-24T12:13:01.397" Score="1" Body="&lt;h1&gt;Overlay Two Images&lt;/h1&gt;&#xA;&lt;p&gt;This challenge is as simple as it gets: Just take two images as input (in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/9093/default-acceptable-image-i-o-methods-for-image-related-challenges&quot;&gt;any reasonable format&lt;/a&gt;) and overlay the first atop the second.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The overlay must have 70% opacity (if possible, if not use the closest available analog), or in other words, multiply the overlay's pixel values by 0.3 and the base by 0.7.&lt;/li&gt;&#xA;&lt;li&gt;The overlay must be centered over the base image.&lt;/li&gt;&#xA;&lt;li&gt;If the overlay is bigger, it must be cropped to fit within the base.&lt;/li&gt;&#xA;&lt;li&gt;If the base image is bigger, the overlay does &lt;em&gt;not&lt;/em&gt; need to be enlarged.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2022-03-28T12:13:58.253" LastActivityDate="2022-03-28T12:13:58.253" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24622" PostTypeId="2" ParentId="2140" CreationDate="2022-03-24T17:54:47.313" Score="-4" Body="&lt;h1&gt;Longest code to output &amp;quot;Hello World&amp;quot;&lt;/h1&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The program should take no input, and only print &lt;code&gt;Hello!, World?&lt;/code&gt; to STDOUT with exact same capitalization and punctuation and in single line. Trailing whitespaces and newlines are allowed.&lt;/li&gt;&#xA;&lt;li&gt;The output should not be in the form of error message&lt;/li&gt;&#xA;&lt;li&gt;The accepted answer will be the 'most points' answer but try to be as creative as possible&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Point System&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;+1&lt;/code&gt; for each character of code in your program, eg:&lt;code&gt;print(&amp;quot;Hello World&amp;quot;)&lt;/code&gt; is 20&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;-1&lt;/code&gt; for each repeated character(case sensitive, i.e. 'h' is not same as 'H'), eg:&lt;code&gt;print(&amp;quot;Hello World&amp;quot;)&lt;/code&gt; is 20-1(o)-2(l) = 17&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="106829" LastEditorUserId="106829" LastEditDate="2022-03-25T03:00:12.063" LastActivityDate="2022-03-25T03:00:12.063" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="24623" PostTypeId="2" ParentId="24617" CreationDate="2022-03-24T18:59:20.843" Score="13" Body="&lt;p&gt;My bad&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/ksabry/bfbrute&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://github.com/ksabry/bfbrute&lt;/a&gt; is back up&lt;/p&gt;&#xA;" OwnerUserId="15858" LastActivityDate="2022-03-24T18:59:20.843" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24624" PostTypeId="2" ParentId="2140" CreationDate="2022-03-26T16:24:41.463" Score="2" Body="&lt;h1&gt;What's the Missing Code?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/245701/110951&quot;&gt;Cops' thread&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/q/245702/110951&quot;&gt;Robbers' thread&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="110951" LastEditorUserId="110951" LastEditDate="2022-03-29T13:11:59.930" LastActivityDate="2022-03-29T13:11:59.930" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24625" PostTypeId="2" ParentId="2140" CreationDate="2022-03-26T20:19:32.093" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/245671/111322&quot;&gt;Batt to the Basics&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="111322" LastEditorUserId="111322" LastEditDate="2022-03-28T18:02:50.863" LastActivityDate="2022-03-28T18:02:50.863" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24626" PostTypeId="2" ParentId="2140" CreationDate="2022-03-26T23:39:46.293" Score="-2" Body="&lt;h1&gt;Alternate brackets&lt;/h1&gt;&#xA;&lt;p&gt;Given a matched string containing only &lt;code&gt;()[]{}&lt;/code&gt;, apply the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;code&gt;[]&lt;/code&gt; is next to &lt;code&gt;()&lt;/code&gt; or &lt;code&gt;{}&lt;/code&gt;, replace the &lt;code&gt;()&lt;/code&gt; or &lt;code&gt;{}&lt;/code&gt; with &lt;code&gt;[]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If a &lt;code&gt;()&lt;/code&gt; follows &lt;code&gt;[]&lt;/code&gt; or &lt;code&gt;{}&lt;/code&gt;, remove the &lt;code&gt;()&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;()[]{} =&amp;gt; [][][]&#xA;{}(){} =&amp;gt; (){}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2022-03-27T18:36:53.937" LastActivityDate="2022-03-27T18:36:53.937" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24627" PostTypeId="2" ParentId="2140" CreationDate="2022-03-27T00:05:05.900" Score="3" Body="&lt;h1&gt;How normal is this group?&lt;/h1&gt;&#xA;&lt;p&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$(G, *)\$&lt;/span&gt; be some &lt;a href=&quot;https://en.wikipedia.org/wiki/Group_(mathematics)&quot; rel=&quot;nofollow noreferrer&quot;&gt;group&lt;/a&gt;. That is, for all &lt;span class=&quot;math-container&quot;&gt;\$x, y, z \in G\$&lt;/span&gt;, the following axioms hold:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$x * y \in G\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$x * (y * z) = (x * y) * z\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;There exists some &lt;span class=&quot;math-container&quot;&gt;\$e \in G\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$x * e = e * x = x\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;There exists some &lt;span class=&quot;math-container&quot;&gt;\$x^{-1} \in G\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$x * x^{-1} = x^{-1} * x = e\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For some group &lt;span class=&quot;math-container&quot;&gt;\$(G, *)\$&lt;/span&gt;, we define a &lt;strong&gt;subgroup&lt;/strong&gt; of this as a group &lt;span class=&quot;math-container&quot;&gt;\$(H, *)\$&lt;/span&gt; for some subset &lt;span class=&quot;math-container&quot;&gt;\$H \subseteq G\$&lt;/span&gt;. The &lt;strong&gt;trivial&lt;/strong&gt; subgroups of a group &lt;span class=&quot;math-container&quot;&gt;\$(G, *)\$&lt;/span&gt; are when &lt;span class=&quot;math-container&quot;&gt;\$H = \{e\}\$&lt;/span&gt; (the identity element of &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt;) and when &lt;span class=&quot;math-container&quot;&gt;\$H = G\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For the sake of convenience, we will denote &lt;span class=&quot;math-container&quot;&gt;\$x * y\$&lt;/span&gt; as &lt;span class=&quot;math-container&quot;&gt;\$xy\$&lt;/span&gt;. Let &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; be a subgroup of &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt;. We say that &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; is &lt;strong&gt;normal&lt;/strong&gt; if, for all &lt;span class=&quot;math-container&quot;&gt;\$g \in G\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$x \in N\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$gxg^{-1} \in N\$&lt;/span&gt;. For any group, the trivial subgroups are normal, and so any group has at least 2 normal subgroups.&lt;/p&gt;&#xA;&lt;p&gt;For example, let &lt;span class=&quot;math-container&quot;&gt;\$G = \{0,1,2,3\}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$x * y = x + y \bmod 4\$&lt;/span&gt;. The subgroups of &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt; are &lt;span class=&quot;math-container&quot;&gt;\$\{0\}\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$\{0, 2\}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\{0,1,2,3\}\$&lt;/span&gt;, all of which are normal. Therefore, &lt;span class=&quot;math-container&quot;&gt;\$(G, *)\$&lt;/span&gt; has 3 normal subgroups.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Given a finite group, output a positive integer &lt;span class=&quot;math-container&quot;&gt;\$n \ge 2\$&lt;/span&gt; counting the number of normal subgroups of the input. You may take a group as input in any reasonable manner, including but not limited to:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The set &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt; (as a set, list, etc.) along with a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13706&quot;&gt;black-box function&lt;/a&gt; &lt;span class=&quot;math-container&quot;&gt;\$* : G \times G \to G\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;A square matrix representing the &lt;a href=&quot;https://en.wikipedia.org/wiki/Cayley_table&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cayley table&lt;/a&gt; of the group. You may choose whether to take &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt; as a separate input&lt;/li&gt;&#xA;&lt;li&gt;A collection of triples &lt;span class=&quot;math-container&quot;&gt;\$(a, b, c)\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$a, b, c \in G\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$c = a * b\$&lt;/span&gt; (the order of such a triple is irrelevant, but must be consistent for all triples)&lt;/li&gt;&#xA;&lt;li&gt;etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge, so the shortest code in bytes in each language wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;G&#xA;∗ : G×G → G&#xA;output&#xA;&#xA;{0,1,2,3}&#xA;a*b = a+b mod 4&#xA;3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="97857" LastEditDate="2022-04-26T16:20:42.820" LastActivityDate="2022-04-26T16:20:42.820" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24628" PostTypeId="2" ParentId="2140" CreationDate="2022-03-27T10:28:16.240" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251028/cgcc-rocket-biking&quot;&gt;CGCC Rocket Biking&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="92572" LastEditorUserId="92572" LastEditDate="2022-08-12T14:07:55.647" LastActivityDate="2022-08-12T14:07:55.647" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24632" PostTypeId="2" ParentId="2140" CreationDate="2022-03-28T18:40:09.427" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/245765/79857&quot;&gt;Wash clothes as quickly as possible&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2022-03-30T19:25:47.437" LastActivityDate="2022-03-30T19:25:47.437" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24634" PostTypeId="1" CreationDate="2022-03-29T17:15:39.893" Score="44" ViewCount="529" Body="&lt;p&gt;Before anyone asks this question I'd like to get it out of the way:&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;If I go to the &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=moderators&quot;&gt;moderators tab&lt;/a&gt;, I don't see &lt;a href=&quot;https://codegolf.stackexchange.com/users/3808/doorknob&quot;&gt;Doorknob&lt;/a&gt; any more:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/vl8YG.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/vl8YG.png&quot; alt=&quot;Moderators screenshot with doorknob missing&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;He used to be a moderator here, but now he's not.  What happened?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="97857" LastEditDate="2022-03-31T18:15:31.337" LastActivityDate="2022-03-31T18:15:31.337" Title="What happened to Doorknob?" Tags="|discussion|moderators|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24635" PostTypeId="2" ParentId="24634" CreationDate="2022-03-29T17:15:39.893" Score="44" Body="&lt;p&gt;Doorknob's moderator privileges were removed today, due to inactivity.  We have not been able to contact Doorknob for quite some time.  He either cannot be reached or does not want to be reached.  Naturally, we respect his wishes either way, and we expect community to do the same.&lt;/p&gt;&#xA;&lt;p&gt;We thank him for his time here as the longest standing moderator of CGCC and all he has done for us, and we would welcome him back to the community if he returned. (Stack Exchange moderators are elected for life and so can apply for reinstatement at any time.) Regardless, we wish him the best!&lt;/p&gt;&#xA;&lt;p&gt;Please note that this will not result in any major changes in moderation activity—it is effectively just a housekeeping change. We prefer that only active accounts have moderator privileges in order to reduce the possibility of security breaches.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="58518" LastEditDate="2022-03-31T12:39:44.843" LastActivityDate="2022-03-31T12:39:44.843" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24638" PostTypeId="2" ParentId="2140" CreationDate="2022-03-31T23:54:51.733" Score="-4" Body="&lt;p&gt;Calculate the day of the week from a given date without using built-in functions  that do so. For example C#'s &lt;code&gt;DateTime.DayOfWeek&lt;/code&gt; is not allowed. Anything along the lines of &lt;code&gt;DateTime.Year.IsLeapYear&lt;/code&gt; or &lt;code&gt;DateTime.Month.TotalDaysInThatMonth&lt;/code&gt; (pseudocode) is also disallowed. Anything other built-in functionality for getting the number of days in a month or year is disallowed. You have to build that functionality yourself.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt; a 1 dimentional array of integers with length 3. The array has the the form &lt;code&gt;{year, month, day}&lt;/code&gt;&lt;br&gt;&#xA;&lt;strong&gt;Output:&lt;/strong&gt; A string such as &amp;quot;Monday&amp;quot;, &amp;quot;Tuesday&amp;quot;, etc. Case insensitive.&lt;/p&gt;&#xA;&lt;p&gt;This is code gold so the shortest answer wins!&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test Cases:&lt;/strong&gt;&lt;br&gt;&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Input&lt;/th&gt;&#xA;&lt;th&gt;Output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;{1000, 3, 31}&lt;/td&gt;&#xA;&lt;td&gt;&amp;quot;Monday&amp;quot;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;{1969, 4, 20}&lt;/td&gt;&#xA;&lt;td&gt;&amp;quot;Sunday&amp;quot;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;{1980, 2, 29}&lt;/td&gt;&#xA;&lt;td&gt;&amp;quot;Friday&amp;quot;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;{1979, 2, 29}&lt;/td&gt;&#xA;&lt;td&gt;empty string, or null or throws an error. (This date does not exist)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;" OwnerUserId="108748" LastActivityDate="2022-03-31T23:54:51.733" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24639" PostTypeId="2" ParentId="2447" CreationDate="2022-04-01T07:29:29.720" Score="27" Body="&lt;h1&gt;Full programs may take array/string input (of unknown length) via stdin in the form of &lt;code&gt;&amp;lt;length&amp;gt; &amp;lt;contents&amp;gt;&lt;/code&gt; or &lt;code&gt;&amp;lt;contents&amp;gt; &amp;lt;sentinel&amp;gt;&lt;/code&gt;&lt;/h1&gt;&#xA;&lt;p&gt;EOF handling is a common problem in many languages, not just esolangs. But only &amp;quot;regular&amp;quot; languages that support proper arrays and functions can circumvent this issue by writing functions instead of full programs.&lt;/p&gt;&#xA;&lt;p&gt;Most programming contest problems (which only support stdin/stdout as I/O) solve this issue by giving extra information in the standard input in one of the two ways:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;give &amp;quot;how many items you need to expect in the input&amp;quot; in the standard input itself, before the start of the actual content, or&lt;/li&gt;&#xA;&lt;li&gt;give a special value at the end of input so that you can &amp;quot;terminate the program when this value is entered&amp;quot;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I believe these solutions are also a natural extension of&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13262/78410&quot;&gt;An array may be represented in input as a pointer and length&lt;/a&gt; and&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20871/78410&quot;&gt;An array may be represented as a buffer terminated with a sentinel value&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;to full programs respectively, which currently only apply to functions.&lt;/p&gt;&#xA;&lt;p&gt;The same condition for the sentinel value applies when the sentinel value method is used:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;It should be noted that the sentinel value must be the one that is guaranteed to not appear in any valid input [...], since their presence breaks the premise of the I/O method.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2022-04-01T07:29:29.720" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24640" PostTypeId="1" CreationDate="2022-04-01T08:24:05.043" Score="9" ViewCount="516" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19271/9288&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout April 2022, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Curry&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;What's a Language of the Month?&lt;/h2&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/9288&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during April, those who wish to participate should learn (at least the basics of) Curry, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about Curry&lt;/h2&gt;&#xA;&lt;p&gt;At first brush Curry just looks like a dialect of site darling Haskell.  It has a slightly different basic library, and slightly more powerful pattern matching.&lt;/p&gt;&#xA;&lt;p&gt;But Curry has something that makes it really interesting.  Curry can also do logical programming.  Meaning that while Haskell always takes the first available path, Curry will take all paths looking for correct result.  You can get the compiler to do the search for you.  This is the power behind Prolog combined with the clean expressive functional nature of Haskell.&lt;/p&gt;&#xA;&lt;p&gt;Not only does this make Curry really unique and interesting as a language,  this opens up all sorts of opportunities for golfing. Curry can be logical when it's the best and functional when it's not.&lt;/p&gt;&#xA;&lt;p&gt;If you're into Haskell or Prolog golf I cannot recommend Curry enough.  If you're not so into those but you are interested I think Curry is an excellent way to sample both techniques.&lt;/p&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/135209/curry&quot;&gt;Curry chatroom on CGCC&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#curry-pakcs&quot; rel=&quot;nofollow noreferrer&quot;&gt;PAKCS on TIO&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#curry-sloth&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sloth on TIO&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;The &lt;a href=&quot;http://danae.uni-muenster.de/curry/&quot; rel=&quot;nofollow noreferrer&quot;&gt;MCC&lt;/a&gt; implementation.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;a href=&quot;https://www-ps.informatik.uni-kiel.de/kics2/&quot; rel=&quot;nofollow noreferrer&quot;&gt;KiCS2&lt;/a&gt; implementation.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;a href=&quot;https://www-ps.informatik.uni-kiel.de/curry2go/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Curry2Go&lt;/a&gt; implementation.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.informatik.uni-kiel.de/%7Ecurry/tutorial/tutorial.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;A Curry tutorial&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;The &lt;a href=&quot;https://www-ps.informatik.uni-kiel.de/kics2/Manual.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;KiCS2 manual&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www-ps.informatik.uni-kiel.de/kics2/currygle/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Currygle&lt;/a&gt; a Curry search engine based on Hoogle.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-04-07T18:17:05.303" LastActivityDate="2022-04-28T10:54:42.127" Title="Language of the Month for April 2022: Curry" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24641" PostTypeId="2" ParentId="24640" CreationDate="2022-04-01T14:18:08.660" Score="2" Body="&lt;h1&gt;List of all Curry answers posted in April 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245804/damerau-damerau-distance/245858#245858&quot;&gt;Damerau-Damerau distance&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242783/generate-all-groupings/245907#245907&quot;&gt;Generate all groupings&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/171038/prime-numbers-in-large-number/245943#245943&quot;&gt;Prime numbers in large number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/64121/ovs&quot;&gt;ovs&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/188988/ddoouubbllee-ssppeeaakk/245945#245945&quot;&gt;&amp;quot;DDoouubbllee ssppeeaakk!!&amp;quot;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/244049/zip-uneven-lists/245946#245946&quot;&gt;Zip uneven lists&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;Wheat Wizard&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/151890/flippign-lettesr-aroudn/245947#245947&quot;&gt;Flippign Lettesr Aroudn&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;Wheat Wizard&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/194230/length-terminated-sequences/245948#245948&quot;&gt;Length-terminated sequences&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;Wheat Wizard&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243173/is-it-a-tower-permutation/245951#245951&quot;&gt;Is it a tower permutation?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;Wheat Wizard&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/194929/is-it-a-circumfix/245958#245958&quot;&gt;Is it a circumfix?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;Wheat Wizard&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242935/is-it-a-fibonacci-like-sequence/245968#245968&quot;&gt;Is it a fibonacci-like sequence?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/237574/convert-prefix-to-infix/245969#245969&quot;&gt;Convert prefix to infix&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/239852/aocg2021-day-20-wonky-license-check/245970#245970&quot;&gt;AoCG2021 Day 20: Wonky license check&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/77138/are-the-brackets-fully-matched/245977#245977&quot;&gt;Are the brackets fully matched?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;Wheat Wizard&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/189358/is-it-double-speak/245991#245991&quot;&gt;Is it double speak?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;Wheat Wizard&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/1294/determine-whether-strings-are-anagrams/246041#246041&quot;&gt;Determine whether strings are anagrams&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;Wheat Wizard&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/243958/repeat-list-until-longer/246043#246043&quot;&gt;Repeat List Until Longer&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/111305&quot;&gt;des54321&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245748/find-the-j-twin/246054#246054&quot;&gt;Find the J twin&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/244078/complex-permutation/246055#246055&quot;&gt;Complex permutation&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/237920/aocg2021-day-2-naughty-or-nice/246057#246057&quot;&gt;AoCG2021 Day 2: Naughty or nice?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/5056/code-golf-permutations/246062#246062&quot;&gt;Code-Golf: Permutations&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;Wheat Wizard&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/84712/print-a-bunch-of-uninteresting-numbers/246093#246093&quot;&gt;Print a bunch of uninteresting numbers!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/246125/convert-the-type-modifiers-from-prefix-to-c-fix/246126#246126&quot;&gt;Convert the type modifiers from prefix to C-fix&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/121388/generate-all-sublist-partitions/246201#246201&quot;&gt;Generate all Sublist Partitions&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/246228/is-this-propositional-formula-an-instance-of-an-axiom/246229#246229&quot;&gt;Is this propositional formula an instance of an axiom?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/246238/pair-my-brackets/246261#246261&quot;&gt;Pair my brackets&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/246316/convert-j-brackets-back-to-2-d-list/246322#246322&quot;&gt;Convert J brackets back to 2-D list&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/85994/count-of-as-and-bs-must-be-equal-did-you-get-it-computer/246528#246528&quot;&gt;Count of &amp;quot;a&amp;quot;s and &amp;quot;b&amp;quot;s must be equal. Did you get it computer?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/233589/parse-ternary-lambda-calculus-for-correctness/246676#246676&quot;&gt;Parse Ternary Lambda Calculus for correctness&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant tips posted in April 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;tip summary&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant challenges posted in April 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="9288" LastEditorUserId="9288" LastEditDate="2022-04-28T10:54:42.127" LastActivityDate="2022-04-28T10:54:42.127" CommentCount="0" CommunityOwnedDate="2022-04-02T03:57:39.630" ContentLicense="CC BY-SA 4.0" />
  <row Id="24644" PostTypeId="2" ParentId="2140" CreationDate="2022-04-01T17:21:39.910" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/246107/optimally-break-a-string-into-words&quot;&gt;Optimally break a string into substrings&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2022-04-09T16:14:08.163" LastActivityDate="2022-04-09T16:14:08.163" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24647" PostTypeId="2" ParentId="2140" CreationDate="2022-04-02T04:25:17.250" Score="0" Body="&lt;h1&gt;Integer divisors of a decimal number&lt;/h1&gt;&#xA;&lt;p&gt;The input is a decimal number larger than zero, given in decimal form. You can use any unambiguous printable character(s) to enclose or separate a possible repeating part in the input, such as &lt;code&gt;0._3_&lt;/code&gt;, &lt;code&gt;0.(3)&lt;/code&gt; or &lt;code&gt;0.(3&lt;/code&gt; for &lt;span class=&quot;math-container&quot;&gt;\${0.\overline{3}}\$&lt;/span&gt; to represent an exact third.&lt;/p&gt;&#xA;&lt;p&gt;The output is the pair of the smallest integer dividend and divisor that give the exact value represented by the input. The output format doesn't matter, &lt;code&gt;1/3&lt;/code&gt;, &lt;code&gt;1 3&lt;/code&gt; and &lt;code&gt;(1,0b011)&lt;/code&gt; are all valid for an input value representing an exact third.&lt;br /&gt;&#xA;Examples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input:  1&#xA;Output: 1 / 1&#xA;&#xA;Input:  0.(3)&#xA;Output: 1 / 3&#xA;&#xA;Input:  1.234&#xA;Output: 617 / 500&#xA;&#xA;Input:  1.1(3)&#xA;Output: 17 / 15&#xA;&#xA;Input:  3.454(54)&#xA;Output: 38 / 11&#xA;&#xA;Input:  3.14159&#xA;Output: 314159 / 100000&#xA;&#xA;Input:  3.(142857)&#xA;Output: 22 / 7&#xA;&#xA;Input:  12.345(6789)&#xA;Output: 10287037 / 833250&#xA;&#xA;Input:  9.(9)&#xA;Output: 10 / 1&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Reference implementation in &lt;a href=&quot;https://docs.python.org/3/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Python 3&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;It does &lt;span class=&quot;math-container&quot;&gt;\$12.345\overline{6789} = \frac{12345}{1000} + \frac{6789}{9999*1000} = \frac{123444444}{9999000} = \frac{10287037}{833250}\$&lt;/span&gt;&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;def greatest_common_denominator(a, b):&#xA;&amp;#9;while b:&#xA;&amp;#9;&amp;#9;a, b = b, a%b&#xA;&amp;#9;return a&#xA;&#xA;def r(inp):&#xA;&amp;#9;x, _, repeating = inp.rstrip(')').partition('(')&#xA;&amp;#9;x = x.split('.')&#xA;&amp;#9;dividend = int(''.join(x))&#xA;&amp;#9;divisor = 10**(len(x[1]) if len(x) == 2 else 0)&#xA;&amp;#9;if repeating:&#xA;&amp;#9;&amp;#9;repeating_nines = 10**len(repeating) - 1;&#xA;&amp;#9;&amp;#9;dividend = int(repeating) + dividend*repeating_nines&#xA;&amp;#9;&amp;#9;divisor *= repeating_nines&#xA;&amp;#9;d = greatest_common_denominator(dividend, divisor)&#xA;&amp;#9;return dividend//d, divisor//d&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##fVHLTsMwEDw3X7EXZDsEt86DPlA/gBMfgFCUEqc1SpzIdqGo6reHdUkDKhKXze7MzmRsd59u1@qk70tZwdbIwknr8te2aVqdl1K3jdKFaw0tItiwVTD52Klawga7iYdgDZsIiptNMDHS7Y2GIgi8l6FKd15wiCCPwMgOvZXeogAJbqwzqqOEEca7wjjlVKspQQAVuHPgtquVo4R7pFTvCsOUZzGChL@1StMDGzjbGqTELAxpLRF/Fi8MVAXngcF6DTHI2kqYoQDxMY0/xjjkWmlpByMvHRkGdyAecPcqyK@FW7hw4ZXhIPMZwzX8Ib3Xfxd/sY1gcGHjVV@o6fSHxb6v8FcWAwIhJBDBjNOEBYLHSYpV@CHhaZbSLPWdSEW2xC8VabzI5rgZ8yTN6P18sWTBklOsaDQ8iH/SzvjDV@RRd3u3Ajjak3@lb5g87d0ZPp5gioVwjNMUjoaGWsbGPdZ/AQ&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 3 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the lowest byte count wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="111830" LastActivityDate="2022-04-02T04:25:17.250" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24648" PostTypeId="2" ParentId="2140" CreationDate="2022-04-03T13:24:31.830" Score="0" Body="&lt;h1&gt;Construct integers from &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;, and &lt;code&gt;(&lt;/code&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/110648/fewest-distinct-characters-for-turing-completeness/245876#245876&quot;&gt;this answer&lt;/a&gt;, I used only &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;, and &lt;code&gt;(&lt;/code&gt; to construct any integer (although &lt;code&gt;(&lt;/code&gt; is technically unnecessary) in TI-Basic. Your task is to make a program or function that takes an integer (or a different convenient format to represent it) as input and output the shortest possible string made from &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;-&lt;/code&gt;, and &lt;code&gt;(&lt;/code&gt; that will evaluate to the integer in TI-Basic. If there are multiple possible outputs, then choose the one with the least amount of &lt;code&gt;(&lt;/code&gt;. If there are still multiple left, then any one of them is valid as an output.&lt;/p&gt;&#xA;&lt;p&gt;Some things to note:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;-&lt;/code&gt; is the subtraction symbol, not the negative sign.&lt;/li&gt;&#xA;&lt;li&gt;TI-Basic automatically closes all &lt;code&gt;(&lt;/code&gt; at the end.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;(&lt;/code&gt; can also be used for implied multiplication (e.g. &lt;code&gt;11(11&lt;/code&gt; is 121)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It should work for numbers from &lt;code&gt;-128&lt;/code&gt; to &lt;code&gt;127&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes in each language wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input    | Possible Output&#xA;&#xA;-128     | 1-(11-1-1-(1-11(11&#xA;-124     | 1-111-11-1-1-1&#xA;-44      | 11(1-1-1-1-1-1&#xA;-5       | 1-1-1-1-1-1-1&#xA;-3       | 1-1-1-1-1&#xA;-1       | 1-1-1&#xA;0        | 1-1&#xA;1        | 1&#xA;2        | 1-(1-1-1&#xA;3        | 1-(1-1-1-1&#xA;5        | 11-1-1-1-1-1-1&#xA;8        | 11-1-1-1&#xA;10       | 11-1&#xA;11       | 11&#xA;14       | 11-(1-1-1-1-1&#xA;18       | 11-1-1-1-(1-11&#xA;19       | 11-1-1-(1-11&#xA;21       | 11-(1-11&#xA;22       | 11-(1-11-1&#xA;33       | 11-11(1-1-1-1&#xA;43       | 11-(1-11-11-11&#xA;78       | 111-11-11-11&#xA;123      | 111-(1-11-1-1&#xA;127      | 11-1-1-1-1-(1-11(11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If your output is different from the one listed, then it should have the same length and the same amount of &lt;code&gt;(&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is anything unclear?&lt;/li&gt;&#xA;&lt;li&gt;Are any of the outputs for the test cases incorrect?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="91262" LastEditorUserId="91262" LastEditDate="2022-04-18T13:54:54.230" LastActivityDate="2022-04-18T13:54:54.230" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24649" PostTypeId="2" ParentId="2140" CreationDate="2022-04-05T11:42:36.043" Score="0" Body="&lt;h2&gt;Generate a clue for an arbitrary MultiSoft URL&lt;/h2&gt;&#xA;&lt;p&gt;Here is the program that will verify your output (transcripted into javascript, and modified for my own ease)&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/eMotTl.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/eMotTl.jpg&quot; alt=&quot;Sheet of paper containing a small program in python. Javascript version below&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;let s = '';&#xA;const a = 'your output here'&#xA;for(const i = 1; i &amp;lt; a.length; i+=1){&#xA;  if (a[i] % 2 === a[i-1] % 2) {&#xA;    s = `${s}${Math.max(a[i], a[i-1])}`;&#xA;  }&#xA;}&#xA;if ('your program input' === `www.multisoft.se/${s}`){&#xA;   return true;&#xA;}&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&lt;p&gt;Where you're given 'your program input', which will look like &lt;em&gt;&lt;a href=&quot;http://www.multisoft.se/9109382911&quot; rel=&quot;nofollow noreferrer&quot;&gt;www.multisoft.se/9109382911&lt;/a&gt;&lt;/em&gt; and you need to generate an &lt;code&gt;a&lt;/code&gt; ('your output here') that generates that URL.&lt;/p&gt;&#xA;&lt;h3&gt;Test cases:&lt;/h3&gt;&#xA;&lt;p&gt;&lt;code&gt;// TODO make test cases&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="9534" LastActivityDate="2022-04-05T11:42:36.043" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24650" PostTypeId="2" ParentId="2140" CreationDate="2022-04-06T05:40:23.697" Score="0" Body="&lt;h2&gt;Wordle but Harder&lt;/h2&gt;&#xA;&lt;p&gt;If you've been online in the last year, you probably know the rules of Wordle. I was implementing a (very bad) Wordle algorithm, when I thought of another game:&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;One 5-letter word from wordle's answer list is randomly selected. Your task is to guess the word.&lt;/p&gt;&#xA;&lt;p&gt;Each failed guess gives you one piece of information - the amount of letters in your guess that are also in the word.&lt;/p&gt;&#xA;&lt;p&gt;For example, if the answer was &lt;code&gt;hello&lt;/code&gt; and you guessed &lt;code&gt;loser&lt;/code&gt;, you would get &lt;code&gt;2&lt;/code&gt;, because 2 of your letters are in the answer. Conversely, if the answer was &lt;code&gt;loser&lt;/code&gt; and you guessed &lt;code&gt;hello&lt;/code&gt;, you would get &lt;code&gt;3&lt;/code&gt;, as 3 of the letters in your guess are in the answer.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Each guess must be made within 10 seconds. Separate categories for lowest average and lowest worst-case scenario.&lt;/p&gt;&#xA;" OwnerDisplayName="user111877" LastActivityDate="2022-04-06T05:40:23.697" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24651" PostTypeId="5" CreationDate="2022-04-06T11:44:02.737" Score="0" Body="" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-04-06T11:44:02.737" LastActivityDate="2022-04-06T11:44:02.737" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24652" PostTypeId="4" CreationDate="2022-04-06T11:44:02.737" Score="0" Body="For questions about challenges on the main site" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-04-06T11:44:02.737" LastActivityDate="2022-04-06T11:44:02.737" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24653" PostTypeId="2" ParentId="2140" CreationDate="2022-04-06T11:57:03.170" Score="0" Body="&lt;h1&gt;Draw my shower curtain&lt;/h1&gt;&#xA;&lt;p&gt;I got a shower curtain and it looks cool, so today you get to draw it.&lt;/p&gt;&#xA;&lt;h2&gt;But how do we do this?&lt;/h2&gt;&#xA;&lt;p&gt;I'm glad you asked.&lt;/p&gt;&#xA;&lt;h3&gt;Part 1: the shape&lt;/h3&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/nmMdw.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/nmMdw.png&quot; alt=&quot;circles&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The image shows a blue, red, and green circle. This is a subsection of the pattern. The actual pattern of circles can be imagined by placing a circle of radius 4 at (8i, 8j) and (8k + 4, 8l + 4) for all (i, j, k, l) in the integers.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/s89Pc.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/s89Pc.png&quot; alt=&quot;sectors&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This image shows the three circles from the first image, but with two sectors coloured in. These sectors are defined as the area in at least two circles, or the area in a circle centred at (8i, 8j) and in on at (8k + 4, 8l + 4), for (i, j, k, l) in the integers. I would provide a closed form for this, but I don't know one.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/sHLqy.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/sHLqy.png&quot; alt=&quot;more circles and sectors&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The above image shows more circles and sectors. In this image, you can begin to see how the pattern fills an infinite grid. For this challenge, you will take two integers as input and output a grid with that many of the pattern on each side. For example, this (specifically the intersections between two circles because I was too lazy):&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/xycH3.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/xycH3.png&quot; alt=&quot;(3, 1) pattern&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;is the output for (3, 1), and this (again I didn't mark the sectors because there were too many of them):&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/sJFVZ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/sJFVZ.png&quot; alt=&quot;(2, 2) pattern&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;is the output for (2, 2).&lt;/p&gt;&#xA;&lt;p&gt;As well as this, your image must be at least 800 pixels on each side.&lt;/p&gt;&#xA;&lt;h3&gt;Part 2: the color&lt;/h3&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ctcUZ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ctcUZ.png&quot; alt=&quot;shades of grey: #0B, #22, #37, #4E, #66, #7F, #98, #B3, #CF and #EB&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The above shows some examples of shades of grey. All of them have the values of their red, blue and green component set to be the same. For your program, you must use all 256 possible shades of grey, with a non-zero chance of each occurring. You may not use any other colours than these.&lt;/p&gt;&#xA;&lt;p&gt;Since this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, shortest answer wins.&lt;/p&gt;&#xA;&lt;h2&gt;NBs&lt;/h2&gt;&#xA;&lt;p&gt;You may assume both numbers are greater than 0.&lt;/p&gt;&#xA;&lt;p&gt;You can take width or height first (examples take width first), but say which in your answer.&lt;/p&gt;&#xA;&lt;p&gt;You are allowed to be +/- 0.1% off.&lt;/p&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;p&gt;Is this well specified?&lt;/p&gt;&#xA;&lt;p&gt;Anything to change?&lt;/p&gt;&#xA;" OwnerUserId="100887" LastActivityDate="2022-04-06T11:57:03.170" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24654" PostTypeId="2" ParentId="2140" CreationDate="2022-04-07T06:00:50.717" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/246224/simplified-piet-interpreter&quot;&gt;Simplified Piet Interpreter&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96039" LastEditorUserId="96039" LastEditDate="2022-04-14T06:53:27.383" LastActivityDate="2022-04-14T06:53:27.383" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24656" PostTypeId="2" ParentId="2140" CreationDate="2022-04-07T19:47:25.720" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/246270/draw-the-norwegian-flag&quot;&gt;Draw the Norwegian flag&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="111518" LastEditorUserId="111518" LastEditDate="2022-04-15T16:01:31.730" LastActivityDate="2022-04-15T16:01:31.730" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24657" PostTypeId="1" CreationDate="2022-04-08T16:52:09.257" Score="2" ViewCount="76" Body="&#xA;&lt;h3&gt;Background&lt;/h3&gt;&#xA;&lt;p&gt;Many BASIC dialects idiomatically use &lt;code&gt;DATA&lt;/code&gt; and &lt;code&gt;READ&lt;/code&gt; commands to store and read input data from the source code.  We appear to have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11691/61846&quot;&gt;a consensus&lt;/a&gt; that this form of input is valid in these languages, however we have not formed a consensus on how to score solutions that use this approach.&lt;/p&gt;&#xA;&lt;h3&gt;The Question&lt;/h3&gt;&#xA;&lt;p&gt;Given a snippet of the form shown below, how should it be scored?&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;http://www.yabasic.de&quot; rel=&quot;nofollow noreferrer&quot;&gt;Yabasic&lt;/a&gt;, ??? bytes&lt;/h3&gt;&#xA;&lt;pre class=&quot;lang-vb prettyprint-override&quot;&gt;&lt;code&gt;DATA 2&#xA;DATA 3&#xA;DIM primes(4)&#xA;FOR i = 1 TO 4&#xA;  READ primes(i)&#xA;  PRINT primes(i)&#xA;NEXT&#xA;DATA 5&#xA;DATA 7&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##q0xMSizOTP7/38UxxFHBiAtMGXO5ePoqFBRl5qYWa5hocrn5BylkKtgqGCqE@CuYcCkoBLk6usDkMzWBAgFBnn4hSCJ@rhEhELNMIZT5//8A&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Yabasic – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="61846" LastActivityDate="2022-09-05T18:04:40.553" Title="Byte counting for BASIC style DATA / READ inputs" Tags="|discussion|code-golf|scoring|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24658" PostTypeId="2" ParentId="24657" CreationDate="2022-04-08T16:52:09.257" Score="1" Body="&lt;h1&gt;All &lt;code&gt;Read&lt;/code&gt; Bytes Should Be Scored&lt;/h1&gt;&#xA;&lt;p&gt;Snippets should be split into header, code, and footer sections, with all &lt;code&gt;DATA&lt;/code&gt; calls in the header and/or footer. All other code will contribute to byte count.&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;http://www.yabasic.de&quot; rel=&quot;nofollow noreferrer&quot;&gt;Yabasic&lt;/a&gt;, 68 bytes&lt;/h3&gt;&#xA;&lt;h5&gt;Header (not counted)&lt;/h5&gt;&#xA;&lt;pre&gt;&lt;code&gt;DATA 2&#xA;DATA 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h5&gt;Code&lt;/h5&gt;&#xA;&lt;pre&gt;&lt;code&gt;DIM primes(4)&#xA;FOR i = 1 TO 4&#xA;  READ primes(i)&#xA;  PRINT primes(i)&#xA;NEXT&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h5&gt;Footer (not counted)&lt;/h5&gt;&#xA;&lt;pre&gt;&lt;code&gt;DATA 5&#xA;DATA 7&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##q0xMSizOTP7v4hjiqGDEBaaM/7t4@ioUFGXmphZrmGhyufkHKWQq2CoYKoT4K5hwKSgEuTq6wOQzNYECAUGefiFIIn6uESEQI00hRpr/BwA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Yabasic – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="61846" LastActivityDate="2022-04-08T16:52:09.257" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24659" PostTypeId="2" ParentId="24657" CreationDate="2022-04-08T16:53:46.247" Score="-1" Body="&lt;h1&gt;All Non-data Bytes Should Be Scored&lt;/h1&gt;&#xA;&lt;p&gt;All Non-data (that is data, not &lt;code&gt;DATA&lt;/code&gt;) bytes, including all required &lt;code&gt;DATA&lt;/code&gt; calls, as well as all necessary spaces, newlines, etc.&lt;/p&gt;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;http://www.yabasic.de&quot; rel=&quot;nofollow noreferrer&quot;&gt;Yabasic&lt;/a&gt;, 92 bytes&lt;/h3&gt;&#xA;&lt;p&gt;&lt;em&gt;Note: all &lt;code&gt;#&lt;/code&gt; in the below snippet represent points of user input, and do not contribute to the byte count&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;DATA #&#xA;DATA #&#xA;DIM primes(4)&#xA;FOR i = 1 TO 4&#xA;  READ primes(i)&#xA;  PRINT primes(i)&#xA;NEXT&#xA;DATA #&#xA;DATA #&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##q0xMSizOTP7/38UxxFGBC0p6@ioUFGXmphZrmGhyufkHKWQq2CoYKoT4K5hwKSgEuTq6wOQzNYECAUGefiFIIn6uESFcSAb@/w8A&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Yabasic – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="61846" LastActivityDate="2022-04-08T16:53:46.247" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24660" PostTypeId="2" ParentId="2140" CreationDate="2022-04-09T17:14:08.093" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/247326&quot;&gt;There&amp;#39;s more than one way to skin a set&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/set-partitions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;set-partitions&amp;#39;&quot; rel=&quot;tag&quot;&gt;set-partitions&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer-partitions&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer-partitions&amp;#39;&quot; rel=&quot;tag&quot;&gt;integer-partitions&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-05-15T15:55:07.257" LastActivityDate="2022-05-15T15:55:07.257" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24661" PostTypeId="2" ParentId="2140" CreationDate="2022-04-10T05:53:03.200" Score="3" Body="&lt;h1&gt;Give me the electronic configuration.&lt;/h1&gt;&#xA;&lt;p&gt;As simple as the title.&lt;/p&gt;&#xA;&lt;p&gt;Input will be a number denoting the atomic number.&lt;/p&gt;&#xA;&lt;p&gt;The output will be the electronic configuration of the element of the given atomic number.&lt;/p&gt;&#xA;&lt;p&gt;There are 2 rules for electronic configuration:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The maximum number of electrons each shell can hold is given by &lt;span class=&quot;math-container&quot;&gt;\$2n^2\$&lt;/span&gt; where n is the shell number starting from 1.&lt;/li&gt;&#xA;&lt;li&gt;The number each shell is allowed to hold from the last shell is given by &lt;span class=&quot;math-container&quot;&gt;\$2n^2\$&lt;/span&gt; where n is the number starting from 2, in reverse.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You must fill each shell to it's limited capacity from left to right, with the remaining electrons on the last shell.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;12 -&amp;gt; [2,8,2]&#xA;13 -&amp;gt; [2,8,3]&#xA;20 -&amp;gt; [2,8,8,2]&#xA;86 -&amp;gt; [2,8,18,32,18,8]&#xA;29 -&amp;gt; [2,8,18,1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="103854" LastEditorUserId="103854" LastEditDate="2022-04-11T11:28:42.623" LastActivityDate="2022-04-11T11:28:42.623" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="24663" PostTypeId="2" ParentId="2140" CreationDate="2022-04-11T03:16:37.067" Score="2" Body="&lt;h1&gt;Translate Text into Matoran&lt;/h1&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://bionicle.fandom.com/wiki/Matoran_Alphabet&quot; rel=&quot;nofollow noreferrer&quot;&gt;Matoran Alphabet&lt;/a&gt; is the alphabet used by many of the characters in the Bionicle universe.&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/DbPxs.jpg&quot; alt=&quot;Matoran Alphabet&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to create a program or function that takes a string as input and creates an image of the input written in the Matoran alphabet.&lt;/p&gt;&#xA;&lt;p&gt;The input will only consist of uppercase letters (A-Z), numbers (0-9), and spaces. You may instead take input in lowercase.&lt;/p&gt;&#xA;&lt;h2&gt;Glyphs&lt;/h2&gt;&#xA;&lt;p&gt;As you can probably notice, the alphabet comprises glyphs made up of circles and straight lines.&lt;/p&gt;&#xA;&lt;p&gt;For the sake of this challenge, let's define each glyph as a circle of radius 4 units (8 x 8), with some internal designs. The internal designs  of letters can be any of:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Vertical Line at position 2, 4, or 6 (either full length or half)&lt;/li&gt;&#xA;&lt;li&gt;Horizontal Line equivalent to above&lt;/li&gt;&#xA;&lt;li&gt;Circle of radius 1, centered at [2, 2], [2, 6], [6, 2], or [6, 6]&lt;/li&gt;&#xA;&lt;li&gt;Any of the above rotated by 45 degrees about the centre&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Number glyphs work slightly differently; they always have a circle of radius 1 in the centre. For numbers 0 - 5, the glyph has evenly spaced spokes between the circles, starting from the top. For numbers greater than 5, the glyph has an additional circle of radius 2 in the centre, and the number of spokes is 6 less than the number.&lt;/p&gt;&#xA;&lt;p&gt;Here is a diagram of the glyphs in spec, any glyphs with 45 degree rotations have an orange grid.&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/nI1Pa.png&quot; alt=&quot;Matoran Alphabet&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;For drawing the glyphs, any line stroke in the range (0, 1) can be used. Glyphs can be kerned (space between adjacent glyphs) any amount from 0 - 4 units. Spaces should be 8 units wide (in addition to kerning).&lt;/p&gt;&#xA;&lt;p&gt;This is a code-golf challenge, so the shortest code in bytes in each language wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot;&gt;graphical-output&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="87728" LastEditorUserId="87728" LastEditDate="2022-04-11T22:29:48.963" LastActivityDate="2022-04-11T22:29:48.963" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24667" PostTypeId="2" ParentId="2140" CreationDate="2022-04-13T22:54:01.560" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/246334/convert-angle-to-clock-time&quot;&gt;Convert angle to clock time&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91262" LastEditorUserId="91262" LastEditDate="2022-04-18T14:55:49.097" LastActivityDate="2022-04-18T14:55:49.097" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24669" PostTypeId="2" ParentId="2140" CreationDate="2022-04-15T13:50:18.023" Score="6" Body="&lt;h1&gt;King of the Holster (EXITING SANDBOX TOMORRROW)&lt;/h1&gt;&#xA;&lt;p&gt;I realized there hadn't been a King of the Hill in forever, so I wanted to create one.&lt;/p&gt;&#xA;&lt;h2&gt;Before the Game&lt;/h2&gt;&#xA;&lt;p&gt;You will be given 10 points to distribute between HP, Dexterity, Armor, and Speed. You may distribute up to 10 points between these categories (integer amounts only). You do not have to put a point in each category.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your HP will equal 10 plus the number of points you put in HP.&lt;/li&gt;&#xA;&lt;li&gt;Your Dexterity (chance of dodging a hit) is equal to 0.04 times the number of points you put in Dexterity. For example, if you put 8 points in Dex, you would have a .32 chance of dodging a hit.&lt;/li&gt;&#xA;&lt;li&gt;Your Armor (chance of taking 1 less damage from a hit) is equal to .1 times the number of points you put into Armor.&lt;/li&gt;&#xA;&lt;li&gt;Your Speed is simply equal to the number of points you put in Speed.&lt;/li&gt;&#xA;&lt;li&gt;You always start with 2 ammo.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Gameplay&lt;/h2&gt;&#xA;&lt;p&gt;Agents will be ordered based on their speed, with ties being broken at random before the game begins. On their turn, each agent will be given their HP, all of their stats (max HP, Dexterity, Armor, and Speed), how much ammo they have, who they attacked most recently, and who attacked them most recently.&lt;/p&gt;&#xA;&lt;p&gt;On each agent's turn, there are three possible moves:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Heal: If not at maximum HP, gain 1 HP.&lt;/li&gt;&#xA;&lt;li&gt;Reload: Gain 2 ammo.&lt;/li&gt;&#xA;&lt;li&gt;Shoot: Choose another agent. They get a random real from 0 to 1. If that number is less than their dexterity, they dodge and take 0 damage. Otherwise, they take a random integer amount of damage from 1 to 4, then they generate another random real from 0 to 1. If that number is less than their armor, they take 1 less damage.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;TLDR: Shooting does 0 damage if they dodge, 0 to 3 if they get armor but no dodge, 1 to 4 if none.&lt;/p&gt;&#xA;&lt;p&gt;Once an agent's HP is less than 0, it is out and can no longer take actions. Last agent surviving wins the round.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Each round, if there were X agents, your agent receives X points for each agent below it. Therefore, in a 10 player game, the top agent would get 9 points, the second would get 8, and so on. I can currently run 5000 3-player modes in 10 or so seconds (probably much faster if I removed some of the printing for debugging), so as long as nobody's agent takes too long to run, I should be able to run thousands of score tests.&lt;/p&gt;&#xA;&lt;h2&gt;I/O&lt;/h2&gt;&#xA;&lt;p&gt;Currently, submissions will create a class which extends PlayerClass. It will create a new class constructor that takes no inputs, which will call &lt;code&gt;super()&lt;/code&gt; with the points it wants in each category. Additionally, you will redefine the makeMove function, which takes no inputs and calls &lt;code&gt;move()&lt;/code&gt; with whatever arguments are required.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;Submissions in Java only. As long as the submission is simple enough, I might be able to translate from pseudocode/some other language to Java though.&lt;/p&gt;&#xA;&lt;p&gt;No calling any methods of other entities using shenanigans. The biggest problem here is &lt;code&gt;takeDamage()&lt;/code&gt;, which has to be public so it can be called when someone is shot. Other than that, there shouldn't be any public functions other than turn-order functions, which are probably fine to access.&lt;/p&gt;&#xA;&lt;p&gt;No redefining any functions/variables of PlayerClass besides &lt;code&gt;makeMove()&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The subclass constructor must be of the form &lt;code&gt;super(x,y,z,a);&lt;/code&gt; and cannot overwrite the requirements in the PlayerClass constructor.&lt;/p&gt;&#xA;&lt;p&gt;You may define other methods within your class IF they are only called as part of generating your stats or deciding who to shoot and they follow the rules outlined above.&lt;/p&gt;&#xA;&lt;p&gt;Don't make your code take forever. This KOTH is pretty lightweight, so there shouldn't be a need for complex algorithms.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;The controller and four basic test agents can be found here:&#xA;&lt;a href=&quot;https://github.com/romanpwolfram/GunfightKoTH/tree/main&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://github.com/romanpwolfram/GunfightKoTH/tree/main&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Challenge name by tjjfvi.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="108673" LastEditorUserId="108673" LastEditDate="2022-04-21T20:17:13.923" LastActivityDate="2022-04-21T20:17:13.923" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="24671" PostTypeId="2" ParentId="2140" CreationDate="2022-04-15T20:38:28.887" Score="2" Body="&lt;h1&gt;Will this makina program halt?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://github.com/GingerIndustries/makina&quot; rel=&quot;nofollow noreferrer&quot;&gt;makina&lt;/a&gt; is a cell-based esolang composed of automata which move around a grid. These automata follow paths of instructions that direct their movement. Your task is to, given a makina program &lt;em&gt;using only the below instructions&lt;/em&gt; (so a subset of normal makina) as input, output two distinct values depending on whether or not it is a loop. (If program flow comes to an arrow character that it has already visited then the program is a loop.)&lt;/p&gt;&#xA;&lt;h2&gt;Instructions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;^&amp;gt;v&amp;lt;&lt;/code&gt; These instructions (arrows) set the direction of the automaton to the direction they point in.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;I&lt;/code&gt; This instruction halts automata going up or down, but does nothing to ones going left or right.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;H&lt;/code&gt; This instruction halts automata going left or right, but does nothing to ones going up or down.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;O&lt;/code&gt; This instruction does nothing to the automaton, acting like a sort of 4-way intersection.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;All other characters halt the automaton, as does exiting the bounds of the program. The automaton starts in the top-left corner going right.&lt;/p&gt;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&lt;h2&gt;Truthy&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt;v&#xA;v&amp;lt;&amp;lt;&amp;lt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;OOOv&#xA;H&amp;lt;&amp;lt;&amp;lt;&#xA;v&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Falsey&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt;v&#xA;^&amp;lt;&amp;lt;&amp;lt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;v&#xA;^O&amp;lt;&#xA;&amp;gt;^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt;v&#xA;v&amp;lt;I&amp;lt;&#xA;H&amp;gt;^&#xA;&amp;gt;^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;v&#xA;v &amp;lt;&amp;lt;&amp;lt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;OOOv&#xA;H&amp;lt;&amp;lt;&amp;lt;&#xA;v&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="97857" LastEditDate="2022-04-21T14:33:35.810" LastActivityDate="2022-04-21T14:33:35.810" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24672" PostTypeId="2" ParentId="20722" CreationDate="2022-04-17T04:02:55.683" Score="6" Body="&lt;p&gt;My username is a randomly generated one from my head. I just thought of &amp;quot;Dial&amp;quot; and &amp;quot;Frost&amp;quot;, and put them together!&lt;/p&gt;&#xA;&lt;p&gt;My pfp was from @lyxal ;)&lt;/p&gt;&#xA;&lt;p&gt;Oh and yes I do love &lt;s&gt;burning&lt;/s&gt; freezing tags on SO. I mean I &lt;em&gt;do&lt;/em&gt; have &lt;code&gt;frost&lt;/code&gt; in my name :3&lt;/p&gt;&#xA;&lt;p&gt;I do love the cold too in winter, another great reason why I picked &lt;code&gt;frost&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2023-02-07T13:08:35.397" LastActivityDate="2023-02-07T13:08:35.397" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24673" PostTypeId="2" ParentId="2140" CreationDate="2022-04-17T16:10:49.323" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/246405/get-the-trends-of-an-array&quot;&gt;Get the trends of an array&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97916" LastEditorUserId="97916" LastEditDate="2022-04-20T17:52:57.983" LastActivityDate="2022-04-20T17:52:57.983" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24674" PostTypeId="1" CreationDate="2022-04-18T19:20:12.423" Score="7" ViewCount="180" Body="&lt;p&gt;Some &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/logic-gates&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;logic-gates&amp;#39;&quot; rel=&quot;tag&quot;&gt;logic-gates&lt;/a&gt; challenges require you to use only NAND gates to solve a problem. Usually, constructing an OR gate from NAND gates requires 3 NAND gates.&#xA;However, an OR gate can also be constructed using 0 NAND gates, by simply joining 2 pieces of wire together:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A---\&#xA;     ---Output&#xA;B---/&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Is joining 2 pieces of wire allowed or are we going to have to use NAND gates to make OR gates?&lt;/p&gt;&#xA;" OwnerUserId="107299" LastEditorUserId="80050" LastEditDate="2022-04-21T06:04:56.517" LastActivityDate="2022-04-21T06:04:56.517" Title="Can We Make 0-NAND OR Gates in [logic-gates] Challenges?" Tags="|discussion|rules|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24675" PostTypeId="2" ParentId="24674" CreationDate="2022-04-18T19:21:54.850" Score="-3" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;I don't have much experience with this challenge type, but I see no reason why not. The only things used would be wire and NAND gates, both allowed by the challenge. Of course a challenge could expressly forbid this for more difficulty if it wanted to.&lt;/p&gt;&#xA;" OwnerUserId="108218" LastActivityDate="2022-04-18T19:21:54.850" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24676" PostTypeId="2" ParentId="24674" CreationDate="2022-04-18T19:35:28.993" Score="-2" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;Disclaimer: I am inexperienced with this challenge type.&lt;/p&gt;&#xA;&lt;p&gt;I feel that it makes more sense to by default disallow it and force OR gates to be explicitly constructed. This could of course be vetoed on a by-challenge basis.&lt;/p&gt;&#xA;" OwnerUserId="104836" LastActivityDate="2022-04-18T19:35:28.993" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24677" PostTypeId="2" ParentId="24674" CreationDate="2022-04-18T21:09:23.527" Score="14" Body="&lt;h1&gt;It depends on the question.&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/logic-gates&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;logic-gates&amp;#39;&quot; rel=&quot;tag&quot;&gt;logic-gates&lt;/a&gt; is a tag for challenges about logic gates.  It doesn't, and shouldn't, come with special rules like this.&lt;/p&gt;&#xA;&lt;p&gt;If the person that poses the challenge wants that to be permitted they can say so. We leave it up to them to decide what they think makes the best challenge. Even if we agreed that there was a case which would be better in almost all scenarios, adding hidden rules on the meta to every question using a tag is still a bad idea.&lt;/p&gt;&#xA;&lt;p&gt;The person posting a challenge should be responsible for making it clear and self contained.  If they haven't addressed this point in the question body it is probably not allowed, but it could also just be the question is unclear.  That should be addressed on a question by question basis.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2022-04-18T21:09:23.527" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24678" PostTypeId="2" ParentId="8474" CreationDate="2022-04-19T14:55:57.420" Score="1" Body="&lt;h1&gt;&lt;em&gt;VERY&lt;/em&gt; Important Feature Request: Add license&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Very Important: You only showed others the code, you did not share it, see &lt;a href=&quot;https://github.blog/2015-03-09-open-source-license-usage-on-github-com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;the GitHub blog&lt;/a&gt; and &lt;a href=&quot;https://choosealicense.com/licenses/no-license&quot; rel=&quot;nofollow noreferrer&quot;&gt;choosealicense.com&lt;/a&gt;. As I assume, the most popular license on GitHub is the most restrictive - no license, which applies the copyright law and makes code unusable. According to GitHub's TOS, you have granted others permission to see and fork the repository, so they can only do those actions, nothing else.&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&amp;quot;No license&amp;quot; has several cons. The MIT license has only a few cons, fewer than no license. I opened &lt;a href=&quot;https://github.com/vihanb/PPCG-SandboxViewer/pull/6&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://github.com/vihanb/PPCG-SandboxViewer/pull/6&lt;/a&gt; to solve this. When creating a repository, GitHub now removed the checkbox to add a license, and only the dropdown exists now. All my public repositories on GitHub.com have a license.&lt;/p&gt;&#xA;" OwnerUserId="111744" LastEditorUserId="111744" LastEditDate="2022-04-21T11:31:54.470" LastActivityDate="2022-04-21T11:31:54.470" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24679" PostTypeId="2" ParentId="2140" CreationDate="2022-04-19T19:43:14.567" Score="0" Body="&lt;h1&gt;Heapify a List into a Binary Max Heap&lt;/h1&gt;&#xA;&lt;p&gt;Given a list of integers, write the shortest program or function that will heapify the list into a binary max-heap, and return the heap as a list of integers.&lt;/p&gt;&#xA;&lt;h3&gt;Additional Resources&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Binary_heap&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia: Binary Heap&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://rosettacode.org/wiki/Sorting_algorithms/Heapsort&quot; rel=&quot;nofollow noreferrer&quot;&gt;Rosetta Code: Heapify from the Heapsort algorithm&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Additional Rules&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes are forbidden.&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;Input and output can be in any reasonable format.&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot;&gt;sorting&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; rel=&quot;tag&quot;&gt;array&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2022-04-20T12:53:45.363" LastActivityDate="2022-04-20T12:53:45.363" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24680" PostTypeId="1" CreationDate="2022-04-19T20:51:55.017" Score="16" ViewCount="332" Body="&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;, CGCC's main chat room, is no stranger to silliness. However, especially recently, I've felt there's been a much larger volume of off-topic conversations. In order to prevent discussion of the site being buried, I propose that we create a second room, for TNB's silliness or otherwise excessively off-topic discussion.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Advantages:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Improves the signal-to-noise ratio of our main room&lt;/li&gt;&#xA;&lt;li&gt;Makes our site appear a bit more professional&lt;/li&gt;&#xA;&lt;li&gt;Allows off-topic discussions to continue without being interrupted by on-topic discussion and events, and vice versa&lt;/li&gt;&#xA;&lt;li&gt;We already need to make and maintain spin-off rooms like The Edge of Propinquity or Unicode Spam for particular types of off-topic discussion, so this could reduce need for future rooms to need to keep track of&lt;/li&gt;&#xA;&lt;li&gt;Brings more attention to CMCs, CMQs related to language development, sandbox feedback requests, dicussion of site policy, and other things that we wouldn't want quickly buried&lt;/li&gt;&#xA;&lt;li&gt;Prevents the starboard being spammed with off-topic jokes, instead of things on-topic to CGCC&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Disadvantages:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Determining what belongs in which room, and moving it, will take some work from ROs and mods&lt;/li&gt;&#xA;&lt;li&gt;The off-topic discussions could be possibly considered a part of the room's culture being taken away&lt;/li&gt;&#xA;&lt;li&gt;We'll need some way to communicate this to new users and ensure people choose the correct room to start a discussion in&lt;/li&gt;&#xA;&lt;li&gt;We'll need to ensure the room doesn't die out (this would only happen if a) off-topic conversation starts occuring in TNB exclusively again or b) we all suddenly stop discussing off-topic stuff at once)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I think this could be a good change, as the silliness being opt-in wouldn't hurt it much, and would stop on-topic discussion from being buried. Opinions?&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-04-20T14:24:19.347" Title="Should we make a room for TNB's off-topic discussions?" Tags="|discussion|chat|" AnswerCount="3" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24681" PostTypeId="2" ParentId="2140" CreationDate="2022-04-19T21:07:17.120" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/246718/draw-new-posts-profile&quot;&gt;Draw New Posts&amp;#39; Profile!&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2022-04-30T15:07:57.417" LastActivityDate="2022-04-30T15:07:57.417" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24682" PostTypeId="2" ParentId="24680" CreationDate="2022-04-20T07:13:31.497" Score="15" Body="&lt;p&gt;I don't think having exactly two rooms like &amp;quot;Code Golf on-topic&amp;quot; and &amp;quot;Code Golf off-topic&amp;quot; is a good idea. It will fragment the discussions as on-topic and off-topic are blurred.&lt;/p&gt;&#xA;&lt;p&gt;However, I am also frustrated by the continuous off-topic conversations in TNB, and I feel like &lt;a href=&quot;https://cgcc-se.github.io/chatiquette/&quot; rel=&quot;nofollow noreferrer&quot;&gt;our &amp;quot;Be On-Topic&amp;quot; rule&lt;/a&gt; is not working. So I propose&lt;/p&gt;&#xA;&lt;h2&gt;Encourage people having off-topic conversations to make their own rooms&lt;/h2&gt;&#xA;&lt;p&gt;We kind of do this already, but if we could just do it earlier in the&#xA;conversation, and more often, to catch more conversations.&lt;/p&gt;&#xA;&lt;p&gt;This has the advantage that we can still keep the culture of TNB in TNB, without breaking it up. If we just make it more standard practice to move out into a new room more often (maybe with a bit of help from ROs etc), then we'll be able to keep things on-topic.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2022-04-20T07:13:31.497" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24683" PostTypeId="2" ParentId="2140" CreationDate="2022-04-20T07:26:06.870" Score="0" Body="&lt;h1&gt;Make a PDF look scanned&lt;/h1&gt;&#xA;&lt;h5&gt;META: This challenge still needs more work, including some examples - if you already have suggestions and hints feel free to post them, but due to the nature of popularity contests I definitely want to discuss it again when I added the missing part.&lt;/h5&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-processing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-processing&amp;#39;&quot; rel=&quot;tag&quot;&gt;image-processing&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Do you know the situation where you have to print some document, scan it and send the scan back? Let's automate that!&#xA;Your task is making a program that, given some input, makes it believably look like it was scanned.&lt;/p&gt;&#xA;&lt;p&gt;A few people have done that before (links see &lt;a href=&quot;https://www.scanyourpdf.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;1&lt;/a&gt; &lt;a href=&quot;https://news.ycombinator.com/item?id=31083432&quot; rel=&quot;nofollow noreferrer&quot;&gt;2&lt;/a&gt; &lt;a href=&quot;https://lookscanned.io/&quot; rel=&quot;nofollow noreferrer&quot;&gt;3&lt;/a&gt;) which inspired this challenge, but they all still look too uniform and pristine in my opinion.&lt;/p&gt;&#xA;&lt;p&gt;Here some examples of the test file, a real scan and the output of (&lt;strong&gt;TODO:&lt;/strong&gt; use one of these tools):&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;TODO:&lt;/strong&gt; add examples of scan artifacts, compare real scan with examples.&lt;/p&gt;&#xA;&lt;h1&gt;Details&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Validity Criterion: The input and output are raster images of any resolution (they should have the same resolution).&lt;/li&gt;&#xA;&lt;li&gt;For simplicity you can assume that both the input and output are grayscale images.&lt;/li&gt;&#xA;&lt;li&gt;You can assume that the input - no matter the resolution - has roughly the size of an A4 or Letter page.&lt;/li&gt;&#xA;&lt;li&gt;You should run your program on the test image below, and include it in your submission using &lt;code&gt;&amp;lt;img src=&amp;quot;[image ]&amp;quot; width=&amp;quot;400&amp;quot; alt=&amp;quot;processed&amp;quot; /&amp;gt;&lt;/code&gt; (&lt;strong&gt;TODO:&lt;/strong&gt; determine exact format), but you can also include other examples to illustrate the inner workings.&lt;/li&gt;&#xA;&lt;li&gt;You are encouraged to explain how your program processes the image.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;TODO:&lt;/strong&gt; Add test image.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2022-04-20T07:50:50.080" LastActivityDate="2022-04-20T07:50:50.080" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24684" PostTypeId="2" ParentId="24680" CreationDate="2022-04-20T13:51:28.710" Score="0" Body="&lt;h1&gt;Make a room for off-topic discussion&lt;/h1&gt;&#xA;&lt;p&gt;I support doing this, over using rooms for individual off-topic discussions. My reasoning is:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Quite often, the off-topic discussion isn't really to do with a single topic. Making a whole room for, e.g., a 20m conversation about a typo someone made, just makes things disorganized, and increases the amount of work it takes for a mod or RO to move an active off-topic conversation.&lt;/li&gt;&#xA;&lt;li&gt;Although this separates some of TNB's culture, since we always have been a bit silly and off-topic at times, I think there's plenty of room for CGCC and golfing related silliness in TNB itself, and off-topic jokes can go elsewhere.&lt;/li&gt;&#xA;&lt;li&gt;Determining what's on-topic and off-topic is a bit subjective, and an RO or mod would need to be present to make the decision and move the messages, but &lt;em&gt;any&lt;/em&gt; solution to this problem will require subjective judgements of what's on-topic.&lt;/li&gt;&#xA;&lt;li&gt;This will allow people to start off-topic discussions in a room that already has people that are willing to participate in them, whereas if I have to make a room for that specific off-topic discussion, I'll have to advertise my off-topic discussion in TNB to get people to join.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-04-20T13:51:28.710" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24685" PostTypeId="2" ParentId="24680" CreationDate="2022-04-20T14:24:19.347" Score="11" Body="&lt;p&gt;To begin with, I think the amount of off-topic chatter in the room is a problem - in fact, its one of the reasons I've been less active in chat recently, and I believe a few other users have said the same.&lt;/p&gt;&#xA;&lt;p&gt;That said, I don't think the solution to the problem is a spinoff room. In my experience with non-TNB spin off rooms, they generally die fairly quickly, and such a room would just be a temporary fix. Instead, I think the solution is for us ROs to properly enforce the chatiquette:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;Don't: Make Noise&lt;/h2&gt;&#xA;&lt;p&gt;Consider whether your message is actually adding anything to the chat room. If not, please keep it to yourself. If the message wouldn't be missed if it were gone, it probably doesn't add anything.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I agree with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24682/66833&quot;&gt;pxeger's answer&lt;/a&gt; as well, in that we should more actively encourage users to create spin off rooms if they want to continue an off-topic conversation. But, I think it misses the key point about having room owners for such a room as TNB:&lt;/p&gt;&#xA;&lt;p&gt;At the end of the day, TNB is and should be about discussing this site, and code golf. The room is open to general discussion, and we are extremely lenient about what people can and do discuss, and that shouldn't change. &lt;em&gt;But&lt;/em&gt;, a line in the sand should be drawn somewhere, and it is up to us as room owners to draw that line.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;So, while I agree that, if people want an off-topic conversation to continue, creating separate rooms for that conversation is a good idea, I mainly believe that we - both us room owners, and everyone else in the room - should be more proactive in stopping or moving off topic chatter out of TNB.&lt;/p&gt;&#xA;&lt;p&gt;Note that, while ROs and mods have the tools to actually move off topic chatter from TNB, I encourage regular users to speak up and ask people to stop or create a room if they believe the room conversation is becoming too off-topic.&lt;/p&gt;&#xA;&lt;p&gt;Finally, I strongly disagree with the idea of one single room for all of TNB's off topic discussions. The chat system, and the chat rooms, are designed for rooms to be disposable and there's nothing wrong with having a room active for a little bit as people discuss e.g. their opinions on whether Ethereum or Bitcoin is a better currency, and then the room dies after the conversation is over.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-04-20T14:24:19.347" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24686" PostTypeId="2" ParentId="2140" CreationDate="2022-04-21T04:24:11.947" Score="0" Body="&lt;h1&gt;Multiples Game&lt;/h1&gt;&#xA;&lt;p&gt;Given an array of divisors &lt;code&gt;A&lt;/code&gt;, loop &lt;code&gt;n&lt;/code&gt; from 1 to infinity and do one of the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;code&gt;n&lt;/code&gt; is divisible by an even number of divisors of &lt;code&gt;A&lt;/code&gt;, print out &lt;code&gt;n&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;n&lt;/code&gt; is divisible by an odd number of divisor(s) of &lt;code&gt;A&lt;/code&gt;, print out &lt;code&gt;*&lt;/code&gt; (clap)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;p&gt;A = [3, 5]&lt;/p&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;1&#xA;2&#xA;*&#xA;4&#xA;*&#xA;*&#xA;7&#xA;8&#xA;*&#xA;*&#xA;11&#xA;*&#xA;13&#xA;14&#xA;15&#xA;16&#xA;17&#xA;*&#xA;19&#xA;...&#xA;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;p&gt;A = [2, 3, 5]&lt;/p&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;1&#xA;*&#xA;*&#xA;*&#xA;*&#xA;6&#xA;7&#xA;*&#xA;*&#xA;10&#xA;11&#xA;12&#xA;13&#xA;*&#xA;15&#xA;*&#xA;17&#xA;18&#xA;19&#xA;...&#xA;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;p&gt;A = [3, 6]&lt;/p&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;1&#xA;2&#xA;*&#xA;4&#xA;5&#xA;6&#xA;7&#xA;8&#xA;*&#xA;10&#xA;11&#xA;12&#xA;13&#xA;14&#xA;*&#xA;16&#xA;17&#xA;18&#xA;19&#xA;...&#xA;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Fetching outer sources are forbidden&lt;/li&gt;&#xA;&lt;li&gt;UTF-8 encoding&lt;/li&gt;&#xA;&lt;li&gt;A newline count as 1 byte (UNIX newline)&lt;/li&gt;&#xA;&lt;li&gt;The answer with the least bytes wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="112064" LastEditorUserId="112064" LastEditDate="2022-04-21T04:39:59.943" LastActivityDate="2022-04-21T04:39:59.943" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24688" PostTypeId="2" ParentId="2140" CreationDate="2022-04-21T18:11:37.353" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/246556/shift-a-string-gradually&quot;&gt;Shift a string gradually&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2022-04-26T13:03:05.147" LastActivityDate="2022-04-26T13:03:05.147" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="24692" PostTypeId="1" AcceptedAnswerId="24796" CreationDate="2022-04-22T17:41:29.340" Score="5" ViewCount="80" Body="&lt;p&gt;I think a screenshot best conveys the bug:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/mITn5.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/mITn5.png&quot; alt=&quot;screenshot with a banner saying &amp;quot;This edit was already approved - please visit the post and correct the edit.&amp;quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;As you can see, the link HTML in the drop down does not properly render:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This edit was already approved - please visit &amp;lt;a href=&amp;quot;/questions/246460/king-of-the-holster/246466#246466&amp;quot;&amp;gt;the post&amp;lt;/a&amp;gt; and correct the edit.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="112716" LastEditDate="2022-05-26T17:43:58.867" LastActivityDate="2022-05-26T17:43:58.867" Title="Link fails to render properly when rejecting an accepted edit" Tags="|bug|status-completed|reviewing|formatting|" AnswerCount="1" CommentCount="1" FavoriteCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24696" PostTypeId="2" ParentId="2140" CreationDate="2022-04-26T09:38:35.577" Score="2" Body="&lt;h1&gt;Convert to Shorthand (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/246611/convert-to-shorthand-part-1&quot;&gt;Part 1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/246641/convert-to-shorthand-part-2&quot;&gt;Part 2&lt;/a&gt;)&lt;/h1&gt;&#xA;" OwnerUserId="106829" LastEditorUserId="92689" LastEditDate="2022-05-13T04:06:25.923" LastActivityDate="2022-05-13T04:06:25.923" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24697" PostTypeId="2" ParentId="2140" CreationDate="2022-04-26T18:37:38.087" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/246983/66833&quot;&gt;Unshuffle my poker chips&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2022-05-07T01:06:13.313" LastActivityDate="2022-05-07T01:06:13.313" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24698" PostTypeId="2" ParentId="2140" CreationDate="2022-04-26T19:11:59.313" Score="-1" Body="&lt;h1&gt;Fort-Defense KoTH&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;There are two teams, red and blue. Each team has a fortress, and if one team's fortress is destroyed, (health reaches zero) the other team wins.&lt;/p&gt;&#xA;&lt;p&gt;The red team attacks the blue team first, blue attacks red, red attacks blue, and so on until one team's fortress is destroyed. Every team has half of the total number of bots. (For an odd number of bots, one team has one more bot.)&lt;/p&gt;&#xA;&lt;p&gt;The grid looks like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;FBBBBB|BBBBF&#xA;FBBBBB|BBBBF&#xA;FBBBBB|BBBBF&#xA;FBBBBB|BBBBF&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;where B is a bot, F is the fort, and | as the border between the two teams.&lt;/p&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2022-04-28T14:13:32.710" LastActivityDate="2022-04-28T14:13:32.710" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="24699" PostTypeId="2" ParentId="23771" CreationDate="2022-04-26T21:32:45.247" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/GingerIndustries/makina&quot; rel=&quot;nofollow noreferrer&quot;&gt;makina&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;makina is a two-dimensional cell-based esolang composed of automatons which move around a grid and can spawn more automatons to retrieve information and parameters.&lt;/p&gt;&#xA;&lt;p&gt;Hello World:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;P&#xA;&amp;gt;t:Hello, World!;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="108218" LastActivityDate="2022-04-26T21:32:45.247" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24700" PostTypeId="2" ParentId="2140" CreationDate="2022-04-27T14:01:44.387" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/246671/&quot;&gt;Sequence of integers not the sum of powers of earlier terms&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-04-28T08:52:31.827" LastActivityDate="2022-04-28T08:52:31.827" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24701" PostTypeId="2" ParentId="2140" CreationDate="2022-04-28T03:51:16.380" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/246767/66833&quot;&gt;Infinite Candle Sequence&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="87728" LastEditorUserId="66833" LastEditDate="2022-05-04T23:12:46.970" LastActivityDate="2022-05-04T23:12:46.970" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24702" PostTypeId="2" ParentId="2140" CreationDate="2022-04-28T04:13:11.540" Score="0" Body="&lt;h1&gt;Split given integer into a given number of integers, each within given bounds&lt;/h1&gt;&#xA;&lt;h2&gt;Input variables:&lt;/h2&gt;&#xA;&lt;p&gt;(Names are just examples, they don't need to be named like this)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;GrandTotal&lt;/code&gt; - integer to divide&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;SplitCount&lt;/code&gt; - number of output integers required&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;UpperLimit&lt;/code&gt; - highest valid value for any one output integer&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;LowerLimit&lt;/code&gt; - lowest valid value for any one output integer&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;There must be &lt;code&gt;SplitCount&lt;/code&gt; values returned, each of which is a uniformly random integer between &lt;code&gt;UpperLimit&lt;/code&gt; and &lt;code&gt;LowerLimit&lt;/code&gt; (your language's RNG is fine), the sum of which is &lt;code&gt;GrandTotal&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Also, the order of the output matters: 5,8,7 is not an equal set to 5,7,8. Both outputs must be equally likely if either is possible. &lt;br&gt;&#xA;&lt;sub&gt;(This does mean that output where all three integers are the same is less likely output to one where all three are different: Given &lt;code&gt;GrandTotal&lt;/code&gt;=6, &lt;code&gt;SplitCount&lt;/code&gt;=3, &lt;code&gt;UpperLimit&lt;/code&gt;=4, &lt;code&gt;LowerLimit&lt;/code&gt;=1, a set including 1, 2 and 3 can appear in 6 different configurations, while a set of all 2s can only appear in one, making it 6 times as likely that &lt;em&gt;one of&lt;/em&gt; the varied sets will appear, rather than the set of 3 2s.)&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Assumptions:&lt;/h2&gt;&#xA;&lt;p&gt;Any input variables should work, assuming that the following is true&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;UpperLimit&lt;/code&gt; * &lt;code&gt;SplitCount&lt;/code&gt; &amp;gt;= &lt;code&gt;GrandTotal&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;LowerLimit&lt;/code&gt; * &lt;code&gt;SplitCount&lt;/code&gt; &amp;lt;= &lt;code&gt;GrandTotal&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;all input variables are positive integers.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Sample in-out range&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;GrandTotal&lt;/th&gt;&#xA;&lt;th&gt;SplitCount&lt;/th&gt;&#xA;&lt;th&gt;UpperLimit&lt;/th&gt;&#xA;&lt;th&gt;LowerLimit&lt;/th&gt;&#xA;&lt;th&gt;Possible Output Range&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;11&lt;/td&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;10&lt;/td&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;10,1;9,2&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;8&lt;/td&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;td&gt;11&lt;/td&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;2,3,3;3,2,3;3,3,2;2,2,4;2,4,2;4,2,2&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;13&lt;/td&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;8&lt;/td&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;td&gt;8,5;7,6;6,7;5,8&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;16&lt;/td&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;8&lt;/td&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;td&gt;8,8&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;16&lt;/td&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;10&lt;/td&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;td&gt;10,6;9,7;8,8;7,9;6,10&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;16&lt;/td&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;td&gt;10&lt;/td&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;td&gt;4,4,4,4&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="112162" LastEditorUserId="112162" LastEditDate="2022-04-29T00:44:32.633" LastActivityDate="2022-04-29T00:44:32.633" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="24704" PostTypeId="2" ParentId="2140" CreationDate="2022-04-28T12:47:27.427" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/246777/107262&quot;&gt;Convert Alpha-3 to Alpha-2&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="107262" LastEditorUserId="107262" LastEditDate="2022-05-02T02:56:44.787" LastActivityDate="2022-05-02T02:56:44.787" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24705" PostTypeId="2" ParentId="2140" CreationDate="2022-04-28T19:27:39.580" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/247139/16766&quot;&gt;Storing a band matrix&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="16766" LastEditDate="2022-05-10T16:28:49.477" LastActivityDate="2022-05-10T16:28:49.477" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24706" PostTypeId="2" ParentId="2140" CreationDate="2022-04-29T14:04:06.430" Score="7" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/246722/collatz-encoding&quot;&gt;Collatz Encoding&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="67809" LastEditorUserId="96039" LastEditDate="2022-05-25T05:40:02.447" LastActivityDate="2022-05-25T05:40:02.447" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24707" PostTypeId="1" AcceptedAnswerId="24708" CreationDate="2022-04-30T18:38:54.907" Score="2" ViewCount="97" Body="&lt;p&gt;Are you allowed to use compression tools (e.g. gzip, xz) in your code?&lt;/p&gt;&#xA;&lt;p&gt;For example, a shell script with:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;cat script.sh.gz|gzcat|sh&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(25 bytes)&lt;/p&gt;&#xA;&lt;p&gt;where the content of script.sh.gz is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ãö}mbhello.sh=é¡¬0CÔ˚&#xA;s⁄m¡   Ó¸@YÕZ‘6Sõ2Ò˜¥∞!ÂŸŒs8;¡Ö!6…¡ûvÂÊ|AeQ¨Yñl‚tòÑ∑4=†Œ(ºˆuñ∏fñBªÁŒUëdkÑ»+,iT8Û&amp;quot;Ù€õﬂ0w©ˇ&amp;quot;¶E›èÎÏv‚U«Çgm&amp;gt;¥wˆQÏ%5I¬4|H˚@8÷&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(166 bytes)&lt;/p&gt;&#xA;&lt;p&gt;which decompresses to:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;echo Hello world!&#xA;echo This is a test program.&#xA;echo The idea is that it is compressed.&#xA;echo But now the programmer doesn't have to worry about program length that much.&#xA;echo It's just left to the compression tool.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(214 bytes, which is more than 25+166=191 bytes)&lt;/p&gt;&#xA;&lt;p&gt;I've seen this (like in an answer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/272/twinkle-twinkle-little-star&quot;&gt;this question&lt;/a&gt;, gzip-ing a shell script), but I'm not sure if it is cheating or not.&lt;/p&gt;&#xA;" OwnerUserId="112172" LastActivityDate="2022-04-30T18:43:07.913" Title="Using compression tools" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24708" PostTypeId="2" ParentId="24707" CreationDate="2022-04-30T18:43:07.913" Score="4" Body="&lt;h1&gt;Yes, but the byte count of the decompression code must also be counted&lt;/h1&gt;&#xA;&lt;p&gt;Say you compressed &amp;quot;abcd&amp;quot; using some compression tool to get &amp;quot;Z&amp;quot; and you can use the code &lt;code&gt;decompress &amp;quot;abcd&amp;quot;&lt;/code&gt; to decompress it. The &lt;code&gt;decompress &lt;/code&gt; bit must count in the byte count.&lt;/p&gt;&#xA;" OwnerUserId="105116" LastActivityDate="2022-04-30T18:43:07.913" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24710" PostTypeId="1" CreationDate="2022-05-01T01:49:31.807" Score="12" ViewCount="732" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19271/reviving-language-of-the-month-pick-up-where-we-left-off-or-start-over&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout May 2022, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Desmos&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;What's a Language of the Month?&lt;/h2&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19279/nominations-for-language-of-the-month-take-2?answertab=scoredesc#tab-top&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during May, those who wish to participate should learn (at least the basics of) Desmos, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about Desmos&lt;/h2&gt;&#xA;&lt;p&gt;Desmos is an online graphing calculator with strong mathematical functionalities. It's not designed to be a programming language, but it can certainly be used as one.&lt;/p&gt;&#xA;&lt;h2&gt;Reasons&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Even though it is a graphing calculator, it can be used as a programming language, albeit a limited one.&lt;/li&gt;&#xA;&lt;li&gt;Following the previous point, Desmos has certain limitations that make it fun/challenging to golf with.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For example, lists/list manipulation are quite limited; for one, lists can only be 1d, so finding clever ways around that limitation can be interesting.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Desmos differs from many of the more popular languages in that the code is based on mathematical(&lt;span class=&quot;math-container&quot;&gt;\$\LaTeX\$&lt;/span&gt;) formulae instead of purely on executing code instructions.&lt;/li&gt;&#xA;&lt;li&gt;There is an abundance of builtin functions and functionalities(see &lt;strong&gt;Resources&lt;/strong&gt; below) that you can use in your Desmos code.&lt;/li&gt;&#xA;&lt;li&gt;There are active communities on &lt;a href=&quot;https://www.reddit.com/r/desmos/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Reddit&lt;/a&gt;,&#xA;&lt;a href=&quot;https://twitter.com/Desmos&quot; rel=&quot;nofollow noreferrer&quot;&gt;Twitter&lt;/a&gt;, and even &lt;a href=&quot;https://discord.gg/vCBupKs9sB&quot; rel=&quot;nofollow noreferrer&quot;&gt;Discord&lt;/a&gt;. People there can probably help you with any questions you may have.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Caveats&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Strings are not supported whatsoever, meaning any challenges requiring string I/O cannot be done with Desmos.&lt;/li&gt;&#xA;&lt;li&gt;Sometimes tedious to do the simple, but necessary, golfs every time an expression is copied out from Desmos. (c.f. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19316/scoring-desmos-equations&quot;&gt;this&lt;/a&gt;)&#xA;&lt;ul&gt;&#xA;&lt;li&gt;e.g.: &lt;code&gt;\operatorname{min}\left(a,b\right)&lt;/code&gt; --&amp;gt; &lt;code&gt;min(a,b)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Usually very hard to search on the Internet for any questions you may have; you'll most likely have to join one of the communities listed in &lt;strong&gt;Resources&lt;/strong&gt; and ask the question there.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.desmos.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Official website&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.desmos.com/calculator&quot; rel=&quot;nofollow noreferrer&quot;&gt;Graphing calculator&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://help.desmos.com/hc/en-us/articles/212235786-Supported-Functions&quot; rel=&quot;nofollow noreferrer&quot;&gt;List of builtin functions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/230100/tips-for-code-golfing-in-desmos&quot;&gt;Tips page&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.desmos.com/calculator/rlr1sstwye&quot; rel=&quot;nofollow noreferrer&quot;&gt;A comprehensive list of Desmos functionalities&lt;/a&gt; (credit goes entirely to &lt;a href=&quot;https://codegolf.stackexchange.com/users/68261/fireflame241&quot;&gt;@fireflame241&lt;/a&gt; for compiling this list)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://help.desmos.com/hc/en-us/articles/4405017454477-What-s-New-at-Desmos&quot; rel=&quot;nofollow noreferrer&quot;&gt;Desmos updates&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Online communities: &lt;a href=&quot;https://www.reddit.com/r/desmos/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Reddit&lt;/a&gt;,&#xA;&lt;a href=&quot;https://twitter.com/Desmos&quot; rel=&quot;nofollow noreferrer&quot;&gt;Twitter&lt;/a&gt;, &lt;a href=&quot;https://discord.gg/vCBupKs9sB&quot; rel=&quot;nofollow noreferrer&quot;&gt;Discord&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Bounties&lt;/h2&gt;&#xA;&lt;p&gt;I (emanresu A) will award a 50 rep bounty to any user's first Desmos answer this month, and a 200 rep bounty to any user's tenth Desmos answer this month.&lt;/p&gt;&#xA;" OwnerUserId="100664" LastActivityDate="2022-06-01T07:04:08.773" Title="Language of the Month for May 2022: Desmos" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24711" PostTypeId="2" ParentId="24710" CreationDate="2022-05-01T01:49:31.807" Score="6" Body="&lt;h1&gt;List of all Desmos answers posted in May 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246763&quot;&gt;Shift right by half a bit&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246765/92689&quot;&gt;Convert angle to clock time&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246779/92689&quot;&gt;Reverse and square&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246796/68261&quot;&gt;Is this a Function?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/68261/fireflame241&quot;&gt;fireflame241&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246797/68261&quot;&gt;Halve the Falses&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/68261/fireflame241&quot;&gt;fireflame241&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246805/92689&quot;&gt;Infinite Candle Sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246831/68261&quot;&gt;Random Points from 2D Donut Distribution&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/68261/fireflame241&quot;&gt;fireflame241&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246833/68261&quot;&gt;Sum of Two Squares&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/68261/fireflame241&quot;&gt;fireflame241&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246857/92689&quot;&gt;Rotate a number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246861/92689&quot;&gt;Product over a range&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246862/92689&quot;&gt;Range, Reverse, Sum!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246865/92689&quot;&gt;Collatz Encoding&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246880/68261&quot;&gt;Biohazard Symbol&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/68261/fireflame241&quot;&gt;fireflame241&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246887/107299&quot;&gt;How far away is n to the next power of b?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/107299/seggan&quot;&gt;Seggan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246892/68261&quot;&gt;Pi == 3.2&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/68261/fireflame241&quot;&gt;fireflame241&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246894/68261&quot;&gt;How compactly can your language perform accurate numerical integration?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/68261/fireflame241&quot;&gt;fireflame241&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246904/68261&quot;&gt;Is Wally There?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/68261/fireflame241&quot;&gt;fireflame241&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/196312/draw-the-ionising-radiation-hazard-symbol/246913#246913&quot;&gt;Draw the Ionising Radiation Hazard Symbol&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246915/92689&quot;&gt;Draw the flag of Bangladesh&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246919/92689&quot;&gt;Draw the national flag of Iceland&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246921/92689&quot;&gt;Draw the Swiss flag&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246944/68261&quot;&gt;Rounding a Range&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/68261/fireflame241&quot;&gt;fireflame241&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246946/92689&quot;&gt;Count the number of ones in an unsigned 16-bit integer&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246953/68261&quot;&gt;Is this a Jordan matrix?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/68261/fireflame241&quot;&gt;fireflame241&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246914/107299&quot;&gt;Draw the Ionising Radiation Hazard Symbol&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/107299/seggan&quot;&gt;Seggan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246960/92689&quot;&gt;Subtract the next numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246993/96039&quot;&gt;Reverse Array Sum&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246994/96039&quot;&gt;Reverse Maths Cycles&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246995/96039&quot;&gt;Reverse Deltas of an Array&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246996/96039&quot;&gt;Inverse Deltas of an Array&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247000/96039&quot;&gt;Split a list evenly&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247002/96039&quot;&gt;Bit-Reversal Permutations&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247003/96039&quot;&gt;Multiplicative undelta&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247006/96039&quot;&gt;Chunk + Enumerate a list of digits&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247009/96039&quot;&gt;Cover up zeroes in a list&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247010/96039&quot;&gt;Does it oscillate periodically?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247029/96039&quot;&gt;Are All the Items the Same?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247062/68261&quot;&gt;Check if a matrix is Zarankiewicz-maximal&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/68261/fireflame241&quot;&gt;fireflame241&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247186/96039&quot;&gt;Print 0 to 100 without 1-9 characters&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/247182/palindromic-powers&quot;&gt;Palindromic Powers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247265/92689&quot;&gt;Draw the Archimedean spiral&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247286/96039&quot;&gt;Sort by Multiplying&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247315/68261&quot;&gt;Is it an Elementary Matrix?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/68261/fireflame241&quot;&gt;fireflame241&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247412/96039&quot;&gt;There's more than one way to skin a set&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247424/68261&quot;&gt;There's more than one way to skin a set&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/68261/fireflame241&quot;&gt;fireflame241&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247510/92689&quot;&gt;Crossing a lily pond&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247545/96039&quot;&gt;Smallest subset of characters required for Turing Completeness&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247646/96039&quot;&gt;Find the nth Fibonacci number, where n is the mth Fibonacci number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247648/92689&quot;&gt;Add an array with itself&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247660/92689&quot;&gt;How long is my number?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247662/92689&quot;&gt;Equal numbers in a sub-array&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247679/92689&quot;&gt;Who needs 8 bits for one character?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247742/96039&quot;&gt;Divisible subset sums&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247855/96039&quot;&gt;Previous Fibonacci number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247899/96039&quot;&gt;How even is a number?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247903/96039&quot;&gt;Check membership of an infinite list&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/248055/96039&quot;&gt;What's the best die to roll?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant tips posted in May 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;tip summary&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant challenges posted in May 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="96039" LastEditDate="2022-06-01T07:04:08.773" LastActivityDate="2022-06-01T07:04:08.773" CommentCount="0" CommunityOwnedDate="2022-05-01T01:49:31.807" ContentLicense="CC BY-SA 4.0" />
  <row Id="24715" PostTypeId="2" ParentId="2140" CreationDate="2022-05-01T21:43:00.067" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/247454/spend-maximal-money&quot;&gt;Spend maximal money&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="111518" LastEditorUserId="111518" LastEditDate="2022-05-17T15:53:34.950" LastActivityDate="2022-05-17T15:53:34.950" CommentCount="20" ContentLicense="CC BY-SA 4.0" />
  <row Id="24716" PostTypeId="2" ParentId="2140" CreationDate="2022-05-02T09:03:52.220" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/246979/derivative-of-a-product&quot;&gt;Derivative of a product&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-05-07T00:33:25.593" LastActivityDate="2022-05-07T00:33:25.593" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24717" PostTypeId="1" CreationDate="2022-05-02T10:00:15.177" Score="15" ViewCount="288" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/102370/add-a-language-to-a-polyglot/&quot;&gt;Add a language to a polyglot&lt;/a&gt; was fun while it lasted. However, it's kinda stagnated due to the difficulty of &lt;em&gt;running&lt;/em&gt; all the languages. I propose that we repost this challenge, maybe with stricter rules on what types of languages can be used but otherwise exactly the same.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11123/100664&quot;&gt;current consensus&lt;/a&gt; on this is that the original poster must consent, however their account's been deleted. Some people have reposted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot;&gt;answer-chaining&lt;/a&gt; challenges with a different task to complete, however in this case I think the original challenge is perfect.&lt;/p&gt;&#xA;&lt;p&gt;This wouldn't replace the original, which I understand people are still working on, but rather be a second attempt where more people can try.&lt;/p&gt;&#xA;&lt;p&gt;Proposed rule changes:&lt;/p&gt;&#xA;&lt;p&gt;Languages must have a freely downloadable crossplatform implementation that can be run from the command line (feel free to create / set up one yourself). Programs must terminate in less than five seconds.&lt;/p&gt;&#xA;&lt;p&gt;Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-05-04T04:07:11.137" LastActivityDate="2022-05-04T04:07:11.137" Title="Should we rehash Add A Language To A Polyglot?" Tags="|discussion|challenges|duplicates|reposting|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24718" PostTypeId="2" ParentId="24717" CreationDate="2022-05-02T11:23:12.090" Score="10" Body="&lt;p&gt;I have long supported making a second run.  Due to the answer chaining nature I think the challenge would be very interesting if we pushed it in a different path.&lt;/p&gt;&#xA;&lt;p&gt;However I don't like the proposed rule changes.  If we look first at&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Languages must have a freely downloadable crossplatform interpreter that can be run from the command line&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I think this is a good idea.  Contributing to the polyglot is hard because a lot of the entries are system specific or non-free.  However we already had a rule for this in the challenge and it was lifted only after the challenge officially ended.  So this doesn't represent an addition only a change&lt;/p&gt;&#xA;&lt;p&gt;And if we look at the original wording:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;As this challenge requires other competitors to post in the same languages you are, you can only use languages with a &lt;a href=&quot;http://meta.codegolf.stackexchange.com/q/7822/62131&quot;&gt;free implementation&lt;/a&gt; (much as though this were a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot;&gt;cops-and-robbers&lt;/a&gt; contest).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The change does not seem to me to be a positive. Besides the &lt;em&gt;implementation&lt;/em&gt; with &lt;em&gt;interpreter&lt;/em&gt; which I will assume is unintentional  (surely you are not proposing compiled languages to be banned).  The existing rules link to a established consensus on how to approach the issue.  I think it's better to go with what the community has agreed upon rather than something ad hoc.&lt;/p&gt;&#xA;&lt;p&gt;The other rule:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Programs must terminate in less than five seconds.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I don't think is an improvement either.&lt;/p&gt;&#xA;&lt;p&gt;For one I don't think there is a big issue with languages taking more than five seconds to run.  To test all 300 odd languages does take a while, but the bulk of that is just because you are running 300 programs in 300 different languages.  In order for the test handler to be fast the time limit would have to be very low.  Likely below the spin up time on a lot of interpreters and compilers.&lt;/p&gt;&#xA;&lt;p&gt;A long test time for high numbers is just going to be a reality for the challenge.&lt;/p&gt;&#xA;&lt;p&gt;On top of that this adds all the ambiguities that come with time limits.  What takes 5 seconds on your machine is not the same as what takes 5 seconds on my machine.  I mean, even, what takes 5 seconds on my machine isn't always the same.&lt;/p&gt;&#xA;&lt;p&gt;We could specify it further and try to get it nailed down and clear, but for what.  I'm not really convinced that there is anything wrong with the rules as they are that this is fixing.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I'm not opposed to rule changes, however the original challenge was fun and worked well.  I don't see much reason to change the rules.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-05-02T11:30:24.303" LastActivityDate="2022-05-02T11:30:24.303" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24719" PostTypeId="2" ParentId="2140" CreationDate="2022-05-02T11:41:10.867" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/246909&quot;&gt;Shortest restricted superstring&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-05-05T15:36:22.770" LastActivityDate="2022-05-05T15:36:22.770" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24721" PostTypeId="2" ParentId="2140" CreationDate="2022-05-02T17:16:37.140" Score="4" Body="&lt;h1&gt;What does the text talk about?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/machine-learning&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;machine-learning&amp;#39;&quot; rel=&quot;tag&quot;&gt;machine-learning&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;em&gt;note that the machine-learning tag will be new&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;META: this is far from being done. I also understand that this challenge depends heavily on manual opinion about the &amp;quot;type&amp;quot; of a piece of text. Hence, if you take issue with that, I would appreciate your giving a comment that suggests ways to fix that issue, rather than an unjustified downvote related to that issue.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Additionally, this might be a duplicate. I would appreciate your pointing this out &lt;em&gt;before&lt;/em&gt; I compile the list of texts, if possible. However, if you identify a duplicate after I start compiling the list of texts, that is also fine.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Some parts use the future tense to talk about what I &lt;em&gt;will&lt;/em&gt; do. Obviously I will have done them by the time I post the challenge.&lt;/p&gt;&#xA;&lt;p&gt;The sections in &lt;em&gt;italic&lt;/em&gt; could be taken as being ambiguous.&lt;/p&gt;&#xA;&lt;p&gt;The links to the training, validation and test sets are not available yet. And of course, I don't yet have labels on my side.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This is a project that I once attempted to do, having learned machine learning. I run a forum app, and I was thinking of incorporating my new machine learning knowledge into that app by creating a model that could detect topics related to a given topic. After having worked on it for a few days, I hadn't made much progress, so I abandoned it. I hereby challenge you to make a similar model, ideally with machine learning, but that is not required. Your model will classify the topic of a piece of text. Such a model could then be used to find text related to a given piece of text by finding texts with a similar topic. You can choose to write your model without machine learning.&lt;/p&gt;&#xA;&lt;p&gt;This is thus essentially a machine learning challenge. (or ideally, it will be. You may choose to write your solution without machine learning, but I am mainly looking forward to seeing machine learning solutions.) I will provide a large set of &amp;quot;articles&amp;quot;, divided into a training set, a validation set, and a test set, with a 60-30-10 split. I expect there to be about 500 articles in all.&lt;/p&gt;&#xA;&lt;p&gt;The articles in the training and validation sets are labeled with their topics: for instance, history, geography, mathematics, programming, etc. The test set, importantly, &lt;strong&gt;does not have public-facing labels&lt;/strong&gt;, but I have labels on my side.&lt;/p&gt;&#xA;&lt;p&gt;The training set is available &lt;a href=&quot;https://www.example.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The validation set is available &lt;a href=&quot;https://www.example.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The test set is available &lt;a href=&quot;https://www.example.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a classifier that attempts to classify the topic of a piece of text. The possible topics are:&lt;/p&gt;&#xA;&lt;p&gt;(coming soon)&lt;/p&gt;&#xA;&lt;p&gt;You can choose any of (coming soon) distinct values to represent the topic.&lt;/p&gt;&#xA;&lt;p&gt;It should be able to produce an output that is one, and only one, of the chosen distinct values given any input string.&lt;/p&gt;&#xA;&lt;p&gt;You have access to the train set to teach your classifier to recognize the topics (if you are using machine learning). The validation set can be used to compare different approaches.&lt;/p&gt;&#xA;&lt;p&gt;Your submission will be scored based on how well it does on the test set. I will write the test set articles in such a way that they are not ambiguous (&lt;code&gt;500 years ago, a mathematician discovered a method to calculate integrals&lt;/code&gt; is ambiguous as the sentence could be about mathematics or history, but &lt;code&gt;Learn about the way people lived 1000 years ago&lt;/code&gt; is only about history). Your score is the number of articles it can correctly classify out of the test set. The higher the number of articles your submission can correctly classify, the better the score is. Thus the winner of this challenge is the submission that classifies the most articles correctly.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Importantly, this is not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/strong&gt; I expect this to be a challenge that demands significant time and effort to produce a solution that scores highly, so you may post a link to a GitHub repository hosting the solution if required.&lt;/p&gt;&#xA;&lt;p&gt;You are encouraged to either provide a way to easily run your solution, or provide the list of outputs that your code produces when given the test set articles. Even better, you could post a Jupyter notebook (if you are answering with a supported language) containing your solution, complete with test set outputs.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Important: please do not post a solution that is optimized only for the test set. It should work &lt;em&gt;reasonably well&lt;/em&gt; in general.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Just so that you can get an idea of the topics:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Article: The dinosaurs went extinct 66 million years ago due to an asteroid impact.&#xA;Topic: history&#xA;&#xA;Article: Time complexity is a measure of the complexity of an algorithm. For instance, the operation of adding two integers is usually taken to have a complexity of O(1). The operation of summing a list given as input has a complexity of O(n) where n is the size of the input.&#xA;Topic: programming&#xA;&#xA;Article: Partial derivatives are derivatives taken with respect to one variable.&#xA;Topic: mathematics&#xA;&#xA;Article: Planes are for going on holiday, especially island getaways.&#xA;Topic: holiday&#xA;&#xA;Article: Carrot Cake Potato Mushroom&#xA;Topic: food&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="106710" LastEditorUserId="106710" LastEditDate="2022-05-02T17:23:27.657" LastActivityDate="2022-05-02T17:23:27.657" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24723" PostTypeId="2" ParentId="2140" CreationDate="2022-05-03T18:33:24.557" Score="1" Body="&lt;h1&gt;Create a program that may or may not determine if a list is in this sequence&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-generation&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-generation&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to write a program which returns another program which has a nonzero chance of correctly determining if an inputted list is in a sequence described below. This can either be done through randomly generating a program, which will occasionally do the correct task, or through hardcoding a program that always works and returning that.&lt;/p&gt;&#xA;&lt;h2&gt;The sequence&lt;/h2&gt;&#xA;&lt;p&gt;The sequence you'll need to identify starts with the following items:&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;well the sequence I was gonna use turns out to have a closed form formula so frick&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-05-03T18:33:24.557" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24724" PostTypeId="2" ParentId="2140" CreationDate="2022-05-04T01:13:12.537" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/247165/haplololololololology&quot;&gt;Haplololololololology!&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="30512" LastEditorUserId="92689" LastEditDate="2022-05-13T04:03:51.290" LastActivityDate="2022-05-13T04:03:51.290" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="24725" PostTypeId="2" ParentId="2140" CreationDate="2022-05-04T02:00:08.303" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/246968/who-needs-8-bits-for-one-character&quot;&gt;Who needs 8 bits for one character?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="92689" LastEditorUserId="92689" LastEditDate="2022-05-06T20:48:48.750" LastActivityDate="2022-05-06T20:48:48.750" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24726" PostTypeId="2" ParentId="24717" CreationDate="2022-05-04T02:09:29.917" Score="15" Body="&lt;p&gt;I was the original poster of the original challenge, and have had some thoughts about what I'd change if doing it again. (Note: these are only thoughts, not directives or requirements, and it's quite possible that some might make the challenge worse if implemented, but I feel like I should let people know what my ideas in this direction are.)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The first answer: The choice of language for the first answer can have a big effect on how this sort of polyglot goes. I would suggest writing it in &lt;strong&gt;Lua&lt;/strong&gt;. This is a practical language, which is fairly good for polyglots, and yet is &lt;em&gt;not&lt;/em&gt; part of the current polyglot, despite being compatible with almost everything in it. This means that we'd be likely to see different solutions to how to fit a large number of languages together, helping to keep the challenge fresh.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Ease of editing: One of the stumbling blocks on the original challenge was the use of non-printable characters, which we eventually mostly solved with the help of the test driver script. Like it or not, non-ASCII and non-printable characters are very likely to be involved in a large polyglot eventually, even though some people have problems with, say, the literal ESC character. One possible solution is to ban non-ASCII characters and all whitespace other than space/newline, but I think that would reduce the scope for interesting language combinations (most notably, some languages treat carriage returns as starting a line and some don't, and this difference gives a lot of power when combining languages). I think a better solution would be to have a test driver script in place from the start, allowing people to say &amp;quot;put an ESC character here&amp;quot; and having the driver automatically run the program in every language with the appropriately placed nonprintable.&lt;/p&gt;&#xA;&lt;p&gt;This was a particular problem in the original language because a highly control-code-dependent language (V) was added early on – although the original answer didn't need a control code to function, the polyglot would quickly have been stuck in a dead end if the control code wasn't added.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The task: &amp;quot;Print a number&amp;quot; is a very simple task, which doesn't act as much of a barrier to entry for languages. As a consequence, the polyglot ended up being purely about language syntax, and not about language logic. There are several languages in the original polyglot that aren't powerful enough to do nontrivial programming in, and most of the languages there are esolangs which rely on unusual syntax as their only interesting feature.&lt;/p&gt;&#xA;&lt;p&gt;Changing the task to something more complex would be quite a change to the nature of the challenge, and would likely create a smaller polyglot in terms of the number of languages available, but it'd also create one which is in some sense &amp;quot;more interesting&amp;quot; (as well as redressing the balance between practical languages and esolangs – esolangs are easier to fit into a polyglot but practical languages are easier to write nontrivial code in).&lt;/p&gt;&#xA;&lt;p&gt;There's also a precedent for using a more complex task when doing the second run of a popular cross-language challenge (I'm thinking of &amp;quot;The Programming Language Quiz&amp;quot; series).&lt;/p&gt;&#xA;&lt;p&gt;One issue with changing the task is that you would want the program to halt, and all deterministic halting programs that don't take input are in effect &amp;quot;print this string literal&amp;quot; programs. As such, implementing a more complex task would ideally mean taking input, which is going to make things tricky because not all languages take input the same way.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;There's one further issue with restarting the challenge. One of the best resources for test drivers for polyglots is Try It Online!, but @Dennis is no longer around to update it. That means that, unlike the first time the challenge was run, if someone picks a new or unusual language, we can't simplify the driver by installing the language on TIO – either we test it manually or we have to embed an implementation of the language into the driver. Likely the best solution to this is to have two versions of the test driver, one running on TIO and one running on a newer TIO-clone; this would mean each answer would have to be tested in two places, but at least it's only two and not hundreds.&lt;/p&gt;&#xA;" OwnerUserId="76359" LastActivityDate="2022-05-04T02:09:29.917" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="24731" PostTypeId="1" CreationDate="2022-05-08T14:00:07.720" Score="14" ViewCount="383" Body="&lt;p&gt;In response to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/24680/66833&quot;&gt;increase in off-topic discussion in TNB&lt;/a&gt;, we've &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/61013037#61013037&quot;&gt;decided to appoint more ROs&lt;/a&gt;. Here's how we'll be deciding the new room owners:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For one week (until 14:00UTC, on the 15th of May 2022), nominations will be accepted as answers on this meta post. You may nominate any user, including yourself, and if you are nominated by someone else, please indicate whether or not you accept the nomination as a comment under the nomination or via some reasonable method.&lt;/li&gt;&#xA;&lt;li&gt;After the nominations period, an election will be held lasting one week. This will be on a separate meta post.&lt;/li&gt;&#xA;&lt;li&gt;Once the election ends, the top nominees with the highest scores will be reviewed by the current room owners and moderators for approval and instatement as new room owners. Currently, it is likely that the top 2 nominees will be appointed; however, if the current ROs and moderators decide otherwise, the number appointed may change (though it's unlikely to be less than 2).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;In each nomination, please include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The user being nominated, along with a link to their profiles (both main and chat)&lt;/li&gt;&#xA;&lt;li&gt;Common active times in chat&lt;/li&gt;&#xA;&lt;li&gt;A short blurb about why this user would be a good room owner&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Please post nominations for separate users as separate answers.&lt;/p&gt;&#xA;&lt;p&gt;Votes in this thread will have no bearing, but feel free to vote how you want here.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-05-15T15:40:08.350" Title="Nominations for new TNB Room Owners" Tags="|discussion|chat|moderation|" AnswerCount="3" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24732" PostTypeId="2" ParentId="24731" CreationDate="2022-05-08T14:01:12.440" Score="17" Body="&lt;h1&gt;&lt;sup&gt;Self&lt;/sup&gt; Nomination for lyxal&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/354515/lyxal&quot;&gt;Chat User Profile&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;Main User Profile&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Active between: 9am AEST (11pm UTC) to 12am AEST (2pm UTC the next day) (see below)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Qdowz.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Qdowz.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Talking Points About Why I Should Get Your Vote&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Fun fact: this is my second time running for Room Owner of The Nineteenth Byte (my first run obviously didn't go so well). Clearly, I've got the determination to commit to helping moderate this site's primary chat room. &lt;/li&gt;&#xA;&lt;li&gt;Also fun fact: I live in the land of upside-down (aka Australia), meaning that while the current 4 RO's are asleep or doing other things during the night, I'm awake and able to moderate if need be.&lt;/li&gt;&#xA;&lt;li&gt;My idea of chat moderation is to roll with the conversation and either a) suggest topic changes or cut off a topic if there's a risk of noise or b) move the conversation (both retroactively and literally) to a different room. That way, the culture of TNB isn't lost and people don't have to constantly be&#xA;wondering if they're off-topic. Off-topic is perfectly fine in small doses, and chances are that I'll be injecting bad puns and tasteful irony into&#xA;conversations myself where appropriate.&lt;/li&gt;&#xA;&lt;li&gt;When it comes to moderation, I've had plenty of experience through managing Vyxal - being the owner of a growing golfing language and GitHub organisation&#xA;sure does allow you to practice keeping things on-topic and organised.&lt;/li&gt;&#xA;&lt;li&gt;On the topic of managing Vyxal, you can trust that I'll be &amp;quot;sensible&amp;quot; as a Room Owner, because, as hyper-neutrino said, &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=61013206#61013206&quot;&gt;the amount of trouble an RO could cause [TNB] is a lot less than the amount of trouble we could cause them should they intentionally try to commit abuse&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;And on the topic of other moderation experiences, I've RO'd 36 other chat rooms, so I sure do know how the different RO features work.&#xA;Bad RO behaviour on my part would reflect badly on Vyxal and would consequently tarnish the work of many people who have invested heaps of time.&lt;/li&gt;&#xA;&lt;li&gt;I've seen the last 1000 consecutive days of code golf activity. That means I've&#xA;seen how chat culture has evolved over time, and I have a pretty good idea of what the community views as on and off-topic.&lt;/li&gt;&#xA;&lt;li&gt;Speaking of constant activity, I'm in the &lt;a href=&quot;https://chat.stackexchange.com/rooms/info/240/the-nineteenth-byte?id=240&amp;amp;tab=general&amp;amp;users=frequent&quot;&gt;frequently in room list&lt;/a&gt; for The Nineteenth Byte&lt;/li&gt;&#xA;&lt;li&gt;Also speaking of constant activity, my chat stats are similar to those of the current ROs last election; if those stats were good enough for them to win,&#xA;they're good enough for me too :p&lt;/li&gt;&#xA;&lt;li&gt;I understand that we are all only human - if any of y'all do anything stupid in TNB or get too off-topic, I ain't holding that against you after the&#xA;issue is resolved. Every incident/mistake is a learning opportunity and you continue on continuing on.&lt;/li&gt;&#xA;&lt;li&gt;Indeed, to quote everyone's favourite artificial intelligence GLaDOS: &amp;quot;there's no sense crying over every mistake - you just keep on trying until you run&#xA;out of cake&amp;quot;.&lt;/li&gt;&#xA;&lt;li&gt;In response to the call for &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/60937502#60937502&quot;&gt;less noise in TNB&lt;/a&gt;, I proactively created noise-overflow rooms to help provide alternative locations for off-topic conversations to be relocated.&lt;/li&gt;&#xA;&lt;li&gt;In summary, I'd be a strict-when-necessary-otherwise-chill Room Owner using the experience I've gained from managing projects such as Vyxal.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If you want to ask me about any of the above talking points or get further elaboration on why they're relevant, don't hesitate to ask in TNB.&lt;/p&gt;&#xA;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2022-05-14T13:53:14.273" LastActivityDate="2022-05-14T13:53:14.273" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24733" PostTypeId="2" ParentId="24731" CreationDate="2022-05-08T14:29:53.123" Score="16" Body="&lt;h1&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/475866/pxeger&quot;&gt;pxeger&lt;/a&gt; (self-nomination)&lt;/h1&gt;&#xA;&lt;p&gt;Active hours (UTC), as decided by chat itself:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/475866/pxeger&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/mAA3M.png&quot; alt=&quot;graph of my SE chat user activity&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Essentially, on-and-off during the UK daytime.&lt;/p&gt;&#xA;&lt;p&gt;I aim to be proactive in cleaning up the room:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;stopping or moving off-topic conversations and noise as appropriate&lt;/li&gt;&#xA;&lt;li&gt;clearing unnecessarily starred messages and no-longer-relevant pinned messages from the starboard&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12538&quot;&gt;butterising&lt;/a&gt; spam&lt;/li&gt;&#xA;&lt;li&gt;Evidence: &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=61035237#61035237&quot;&gt;1&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=60990791#60990791&quot;&gt;2&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=60989643#60989643&quot;&gt;3&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/search?q=unpin&amp;amp;user=475866&amp;amp;room=240&quot;&gt;4&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=58544522#58544522&quot;&gt;5&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=57971393#57971393&quot;&gt;6&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=61029733#61029733&quot;&gt;7&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=60102964#60102964&quot;&gt;8&lt;/a&gt; yeah, you get the point. If you want more, just search for relevant keywords &lt;a href=&quot;https://chat.stackexchange.com/search?q=butterise&amp;amp;user=475866&amp;amp;room=240&quot;&gt;here&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I've been an active member in TNB for about a year and a half, so I understand the room's culture and conventions. I try to remain a level-headed voice of reason, seeing both sides of an argument, including playing Devil's Advocate at times.&lt;/p&gt;&#xA;&lt;p&gt;I'm familiar with SE chat's quirks, and with the room owner tools, having done &lt;a href=&quot;https://chat.stackexchange.com/rooms/135840/the-louvre&quot;&gt;plenty of testing&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;I've also been a room owner of &lt;a href=&quot;https://chat.stackexchange.com/rooms/106764/vyxal&quot;&gt;Vyxal&lt;/a&gt; for some time; although I'm no longer very active there, I've never abused my position. I'm also the room owner of &lt;a href=&quot;https://chat.stackexchange.com/rooms/122645/attempt-this-online&quot;&gt;ATO&lt;/a&gt;, but that probably doesn't count since it's my own room.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2022-05-08T14:29:53.123" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24734" PostTypeId="2" ParentId="24731" CreationDate="2022-05-09T00:11:25.773" Score="14" Body="&lt;h1&gt;Self-nomination for emanresu A&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/497390/emanresu-a&quot;&gt;Chat profile&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Active hours:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/GTGal.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/GTGal.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In other words, I'm usually quite active between UTC 2am-9am when all of the other ROs are asleep. I've only been active in TNB (or on CGCC) for just over a year, but I have a pretty good understanding of the room's culture.&lt;/p&gt;&#xA;&lt;p&gt;I'm a RO of &lt;a href=&quot;https://chat.stackexchange.com/rooms/106764/vyxal&quot;&gt;Vyxal&lt;/a&gt; and more recently &lt;a href=&quot;https://chat.stackexchange.com/rooms/135246/canvas&quot;&gt;canvas&lt;/a&gt;, so I have experience with the RO tools and how to use them - there's a reason why &lt;a href=&quot;https://chat.stackexchange.com/rooms/info/82806/trash&quot;&gt;the Vyxal Bot is frequently in Trash&lt;/a&gt;. I have &amp;gt;10k rep so I can handle chat flags.&lt;/p&gt;&#xA;&lt;p&gt;My username's pretty much &lt;a href=&quot;https://codegolf.stackexchange.com/q/233294&quot;&gt;set in stone&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;In my opinion, it's quite hard to judge what's &amp;quot;off-topic&amp;quot; and what's not. I don't see any point in creating general noise overflow rooms that are just going to freeze over, but conversations that do have relevant rooms should be moved to those.&lt;/p&gt;&#xA;&lt;p&gt;I &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=60168167#60168167&quot;&gt;occasionally&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=60008638#60008638&quot;&gt;poke&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=60322057#60322057&quot;&gt;ROs&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=60655723#60655723&quot;&gt;to&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/60319849#60319849&quot;&gt;do stuff&lt;/a&gt;, although they do a fine job on their own.&lt;/p&gt;&#xA;&lt;p&gt;One concern is that I used to have &lt;a href=&quot;https://chat.stackexchange.com/users/538692/allxy&quot;&gt;a sockpuppet account&lt;/a&gt; that I used at school. I've figured out how to use this account while at school, so that shouldn't be a problem any more.&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="97857" LastEditDate="2022-05-09T07:18:19.063" LastActivityDate="2022-05-09T07:18:19.063" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24739" PostTypeId="2" ParentId="2140" CreationDate="2022-05-09T08:19:37.163" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/247109/matrix-meets-ascii-art#247109&quot;&gt;Matrix Meets ASCII Art&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="111945" LastEditorUserId="111945" LastEditDate="2022-05-10T07:27:26.350" LastActivityDate="2022-05-10T07:27:26.350" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24742" PostTypeId="2" ParentId="2140" CreationDate="2022-05-09T13:29:47.457" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/247462/king-of-the-cards&quot;&gt;King of the Cards&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2022-05-17T20:04:32.503" LastActivityDate="2022-05-17T20:04:32.503" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24743" PostTypeId="2" ParentId="2140" CreationDate="2022-05-09T18:18:41.820" Score="0" Body="&lt;h1&gt;Draw the Location's Flag&lt;/h1&gt;&#xA;&lt;p&gt;Take as input the latitude-longitude coordinates of a location on Earth, and return a flag that corresponds to that location. You may return any official flag that is at the level of a country or smaller. For example, if the location was &lt;code&gt;40.712775, -74.005973&lt;/code&gt;, you may return the flag of the USA, the New York state flag, or the flag of New York City, but you can't return the UN flag.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;The outputted flag must be at least 50 pixels in its shortest direction (or be vector graphics/some other scalable image).&lt;/p&gt;&#xA;&lt;p&gt;Internet data IS allowed in this challenge.&lt;/p&gt;&#xA;&lt;p&gt;Areas not officially controlled by any country are undefined behavior. This includes Antarctica, Bir Tawil, and international waters.&lt;/p&gt;&#xA;&lt;p&gt;Any flag returned must be an official flag that currently corresponds to that location. For example, you cannot return the flag of the British Empire for countries that used to be its territories.&lt;/p&gt;&#xA;&lt;p&gt;In cases where control is disputed (including South Sudan, eastern Ukraine...) you may output any country that has a claim.&lt;/p&gt;&#xA;&lt;p&gt;This is a code golf challenge, so shortest code wins.&lt;/p&gt;&#xA;&lt;p&gt;Standard I/O rules apply. Examples would include a list/tuple of two numbers, a Location class, a vector, or Mathematica's GeoPosition.&lt;/p&gt;&#xA;&lt;p&gt;All flags must be recognizable as the flag they are.&lt;/p&gt;&#xA;&lt;p&gt;For flags with differing sides (like Paraguay), you may return only one face.&lt;/p&gt;&#xA;&lt;p&gt;For non-rectangular flags, you may pad the other area with any color distinct from the primary color of the flag.&lt;/p&gt;&#xA;" OwnerUserId="108673" LastActivityDate="2022-05-09T18:18:41.820" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="24745" PostTypeId="1" CreationDate="2022-05-10T07:20:55.827" Score="10" ViewCount="365" Body="&lt;h2&gt;How I got here&lt;/h2&gt;&#xA;&lt;p&gt;I saw a few sites of Stack Exchange elsewhere. Exactly where I forgot, but it made the first impression of Stack Overflow to me: they were indeed very sophisticated. I learned about Code Golf Stack Exchange (which I will shorten to CGSE) when something led me to this link: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/17005/produce-the-number-2014-without-any-numbers-in-your-source-code/17103#17103&quot;&gt;Produce the number 2014 without any numbers in your source code&lt;/a&gt;. The answer was &lt;strong&gt;AMAZING&lt;/strong&gt;!!!&lt;/p&gt;&#xA;&lt;h2&gt;Why I signed in&lt;/h2&gt;&#xA;&lt;p&gt;I first signed in to post an answer to a question. It was quite a good and fun polyglot. After that, I found Code Golf quite interesting and tried to post questions and answers.&lt;/p&gt;&#xA;&lt;h2&gt;So back to my first impression&lt;/h2&gt;&#xA;&lt;h3&gt;Organized&lt;/h3&gt;&#xA;&lt;p&gt;I personally think CGSE is quite organized.&lt;/p&gt;&#xA;&lt;p&gt;You add tags to your question. This helps clarify what your question is mainly about, and makes a lot of tasks easier. For instance, it means that people are more capable of answering your question.&lt;/p&gt;&#xA;&lt;h3&gt;Friendly&lt;/h3&gt;&#xA;&lt;p&gt;CGSE is very friendly to new users. Other users treat me respectively.&lt;/p&gt;&#xA;&lt;p&gt;There is a &amp;quot;Code of Conduct&amp;quot;. People pay attention to treating everyone equally and respectfully. There is a &amp;quot;New Contributor Tag&amp;quot; for new users, and people take more time in telling them.&lt;/p&gt;&#xA;&lt;p&gt;There are friendly reminders of doing practically &lt;strong&gt;anything&lt;/strong&gt;. From formatting and how to ask a good question to questions that are relatively similar. It is very beginner-friendly.&lt;/p&gt;&#xA;&lt;p&gt;There is no doubt that other users helped a lot, namely, caird coinheringaahing, Jo King, Unrelated String, etc. They helped a lot. Without them I am probably not going to make such good questions.&lt;/p&gt;&#xA;&lt;h3&gt;Challenging&lt;/h3&gt;&#xA;&lt;p&gt;All the problems are challenging. It takes about a week to make a question and make it understandable. Then it takes another week to get an answer, so people tend to polish their questions in the sandbox.&lt;/p&gt;&#xA;&lt;h3&gt;CGSE get rids of loopholes&lt;/h3&gt;&#xA;&lt;p&gt;Loopholes are really funny, but they are relatively useless, and thus CGSE get rids of them, making sure there are only useful answers. It makes sure everything is useful to users. This makes questions more focused.&lt;/p&gt;&#xA;" OwnerUserId="111945" LastEditorUserId="111945" LastEditDate="2022-05-22T05:51:08.613" LastActivityDate="2022-12-16T14:01:35.967" Title="CGCC Blog Post #6: My First Impression on Code Golf Stack Exchange" Tags="|discussion|new-users|cgcc-blog|" AnswerCount="0" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24747" PostTypeId="2" ParentId="2140" CreationDate="2022-05-10T14:15:11.857" Score="1" Body="&lt;h1&gt;Binary Palindromes&lt;/h1&gt;&#xA;&lt;p&gt;Take an input of a positive integer and determine if the binary representation of that number is palindromic. Except for 0 (which is not in the scope of this problem), all binary palindromes are odd, so you do not have to worry about leading/trailing zeroes.&lt;/p&gt;&#xA;&lt;p&gt;OEIS Sequence: &lt;a href=&quot;https://oeis.org/A006995&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://oeis.org/A006995&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is code-golf, so shortest answer in bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 -&amp;gt; True (1)&#xA;4 -&amp;gt; False (100)&#xA;85 -&amp;gt; True (1010101)&#xA;131 -&amp;gt; False (10000011)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="108673" LastActivityDate="2022-05-10T14:15:11.857" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24748" PostTypeId="2" ParentId="2140" CreationDate="2022-05-10T14:44:33.523" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/247470/apartment-building&quot;&gt;Make an Apartment Building&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="108673" LastEditorUserId="108673" LastEditDate="2022-05-17T23:00:30.110" LastActivityDate="2022-05-17T23:00:30.110" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24749" PostTypeId="1" CreationDate="2022-05-10T16:40:44.270" Score="11" ViewCount="279" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/16766&quot;&gt;Sandbox&lt;/a&gt; currently says:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;When you think your challenge is ready for the public, go ahead and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/ask&quot;&gt;post it&lt;/a&gt;, and &lt;strong&gt;replace the post here with a link to the challenge and delete the sandbox post.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;(Emphasis original.)&lt;/p&gt;&#xA;&lt;p&gt;These days, however, I see a lot of sandbox posts which are edited down to a link but are &lt;em&gt;not&lt;/em&gt; deleted. I &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/conversation/deleting-sandbox-posts&quot;&gt;asked about it in chat&lt;/a&gt; and got a couple of responses but nothing definitive. &lt;strong&gt;Should we delete sandbox posts after posting them to main?&lt;/strong&gt; Or should we remove that clause from the Sandbox instructions?&lt;/p&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="16766" LastEditDate="2022-05-10T16:56:04.060" LastActivityDate="2022-09-03T15:43:13.337" Title="Are we still deleting sandbox posts?" Tags="|discussion|sandbox|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24750" PostTypeId="2" ParentId="24749" CreationDate="2022-05-10T16:53:10.757" Score="16" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;It's fine to leave them around for a little while, but deleting them is convenient for a few reasons:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;It makes the number of answers (for non-10k users) more accurately reflect the number of drafts&lt;/li&gt;&#xA;&lt;li&gt;It hides old, posted answers for non-10k users, and with recent changes, 10k users too (by moving them to the bottom)&lt;/li&gt;&#xA;&lt;li&gt;It more clearly visually indicates an answer has already been posted. The H1-paragraph-link formatting is a bit monotonous, and the red background clearly distinguishes old stubs from things that need feedback&lt;/li&gt;&#xA;&lt;li&gt;It prevents them from showing up in searches, making it easier to find drafts which actually need review (by searching, e.g., &lt;code&gt;created:2022 inquestion:2140 king-of-the-hill&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-05-10T16:53:10.757" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24751" PostTypeId="2" ParentId="24749" CreationDate="2022-05-10T19:36:07.600" Score="16" Body="&lt;p&gt;Deleting answers is inconvenient for a few reasons:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Deleted answers, their histories and their comments are not viewable to users of all reputation levels.  Users below 10k should be able to see this history.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Deleted answers are much more difficult to search for than undeleted answers.  (e.g. if I want to figure out if a particular challenge was sandboxed).  You have to manually wade through the pages of the sandbox.  And if you blank them they can easily be filtered out of search results when you are not looking for them.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Leaving answers undeleted makes the sandbox more accessible to all users with the downside that there is some extra fluff hanging around.  For this reason I choose to simply blank my sandbox posts when I'm done with them.&lt;/p&gt;&#xA;&lt;p&gt;Its also worth mentioning that a deleted answer does take up &lt;em&gt;more&lt;/em&gt; space than an equivalent undeleted answer, for users that can see them. To make an answer take up as little space as possible the optimal strategy is to blank the entire thing but not delete it.  This is no longer much of a concern now that deleted answers are sorted to the bottom so they don't take up real estate, but it does justify why a lot of answers predating this change may not have been deleted.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-05-12T14:02:27.633" LastActivityDate="2022-05-12T14:02:27.633" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24755" PostTypeId="2" ParentId="2140" CreationDate="2022-05-11T12:49:01.213" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/247191/is-it-a-good-chord&quot;&gt;Is it a good chord?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="111945" LastEditorUserId="92689" LastEditDate="2022-05-24T18:11:22.743" LastActivityDate="2022-05-24T18:11:22.743" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24760" PostTypeId="2" ParentId="23771" CreationDate="2022-05-11T18:39:09.427" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://jsoftware.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;J&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;J is a high-level, general-purpose programming language that is particularly suited to the mathematical, statistical, and logical analysis of data. It is a powerful tool for developing algorithms and exploring problems that are not already well understood.&lt;/p&gt;&#xA;&lt;p&gt;(copied from the J site because I'm lazy)&lt;/p&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/jsoftware/jsource&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub Repo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://code.jsoftware.com/wiki/Main_Page&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wiki&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;J on &lt;a href=&quot;https://ato.pxeger.com/run?1=m70wa8GCpaUlaboWaBSUBgA&quot; rel=&quot;nofollow noreferrer&quot;&gt;ATO&lt;/a&gt; and &lt;a href=&quot;https://tio.run/#j&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="92689" LastActivityDate="2022-05-11T18:39:09.427" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24761" PostTypeId="2" ParentId="2140" CreationDate="2022-05-12T01:59:18.477" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/247512&quot;&gt;LOOOOONG TEEEEEXT&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="111945" LastEditorUserId="97857" LastEditDate="2022-05-19T12:45:45.853" LastActivityDate="2022-05-19T12:45:45.853" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24762" PostTypeId="2" ParentId="2140" CreationDate="2022-05-12T14:40:52.457" Score="1" Body="&lt;h1&gt;King of the Hill: Greed Control&lt;/h1&gt;&#xA;&lt;h2&gt;What is Greed Control&lt;/h2&gt;&#xA;&lt;p&gt;Greed control is a &lt;strong&gt;multiplayer&lt;/strong&gt; &lt;code&gt;round-based&lt;/code&gt; game&#xA;in which in every round, a player bet a number inside&#xA;a specific range, say 1~100. Say 2 people betted 100,&#xA;then they'd both get 100/2 which is &lt;code&gt;50&lt;/code&gt; points    in&#xA;the game. &lt;strong&gt;Basically, the players that choose the same&#xA;number split the scores evenly (no rounding) and the&#xA;total of their net score gain is the number they&#xA;chose&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;After a set number of rounds, players compare scores.&#xA;The highest score generally wins the game overall.&lt;/p&gt;&#xA;&lt;h2&gt;Your challenge&lt;/h2&gt;&#xA;&lt;p&gt;Build a bot in &lt;code&gt;python&lt;/code&gt;, specifically, &lt;code&gt;python 3&lt;/code&gt;   ,&#xA;that when given input, discussed in the section &lt;code&gt;input&lt;/code&gt;,&#xA;they give the number as an integer they bet as output.&#xA;It must be a&lt;code&gt;function&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;&lt;code&gt;information, points, round_number, sum_of_all, user_num&lt;/code&gt;.&#xA;&lt;code&gt;information&lt;/code&gt; is a dictionary with integer keys&#xA;in which each key's value is the number of bots&#xA;that chose that key's number &lt;strong&gt;last round&lt;/strong&gt;.&#xA;&lt;code&gt;points&lt;/code&gt; is the list of integers you can choose from.&#xA;&lt;code&gt;round_number&lt;/code&gt; is the round number.&#xA;&lt;code&gt;sum_of_all&lt;/code&gt; is like &lt;code&gt;information&lt;/code&gt;, except it is&#xA;the summation of &lt;strong&gt;all rounds&lt;/strong&gt;.&#xA;&lt;code&gt;user_num&lt;/code&gt; is the number of players playing.&lt;/p&gt;&#xA;&lt;h2&gt;We guarantee that&lt;/h2&gt;&#xA;&lt;p&gt;We guarantee that &lt;code&gt;points&lt;/code&gt; stay the same every round&#xA;and is strictly increasing, all integers. However,&#xA;it may not be consecutive.&lt;/p&gt;&#xA;&lt;h2&gt;Controller function&lt;/h2&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;&#xA;from random import choice&#xA;&#xA;def random_better(information, points, round_number, sum_of_all, user_num):&#xA;    return choice(points)&#xA;&#xA;def greedy_better(information, points, round_number, sum_of_all, user_num):&#xA;    return points[-1]&#xA;&#xA;def calculator(information, points, round_number, sum_of_all, user_num):&#xA;    return sorted(points, key=lambda x:x/(information[x]+0.000000000001))[0]&#xA;&#xA;def smarty(information, points, round_number, sum_of_all, user_num):&#xA;    return sorted(points, key=lambda x:x/(information[x]+0.000000000001))[choice(range(1,40))]&#xA;&#xA;users = [random_better, greedy_better, calculator, smarty] * 10&#xA;&#xA;user_names = [user.__name__.replace('_',' ') for user in users]&#xA;rounds = 1000&#xA;points = sorted(list(range(1,101)))&#xA;user_num = len(users)&#xA;bots = [user for user in users]&#xA;scores = [0.0 for user in users]&#xA;information = {i:0 for i in points}&#xA;sum_of_all = {i:0 for i in points}&#xA;print('\n'*100)&#xA;&#xA;for round_number in range(rounds):&#xA;    choices = [bot(information, points, round_number, sum_of_all, user_num) for bot in bots]&#xA;    information = {score:choices.count(score) for score in points}&#xA;    scores = [scores[index] + choices[index]/information[choices[index]] for index in range(user_num)]&#xA;&#xA;    print(f'\n\n\nRound #{round_number+1} Reports: ')&#xA;&#xA;    print('\nBots Report: ')&#xA;    print('\n'.join([f'{user_names[index].ljust(20)} '&#xA;                     f'chose {choices[index]} '&#xA;                     f'and got {choices[index]/information[choices[index]]} additional points, '&#xA;                     f'making it now have {scores[index]} points!!! ' for index in range(user_num)]))&#xA;&#xA;    print('\nDistribution Report: ')&#xA;    print('\n'.join([f'The number of bots who chose {num} is: {information[num]}!!! ' for num in points]))&#xA;&#xA;    print('\nLeaderboard Report: ')&#xA;    sorted_list = sorted(range(user_num), key=lambda x: -scores[x])&#xA;&#xA;    print(f'\n{user_names[sorted_list[0]].ljust(20)} with {scores[sorted_list[0]]} points, '&#xA;          f'\n{user_names[sorted_list[1]].ljust(20)} with {scores[sorted_list[1]]} points, and'&#xA;          f'\n{user_names[sorted_list[2]].ljust(20)} with {scores[sorted_list[2]]} points!!! ')&#xA;&#xA;    sum_of_all = {i:sum_of_all[i]+information[i] for i in points}&#xA;&#xA;print('\n\n\nFinal Report Card: \n')&#xA;print('\n'.join([f'{user_names[sorted_list[index]].ljust(20)}: '&#xA;                 f'{scores[sorted_list[index]]} points. ' for index in range(user_num)]))&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The first part is imports. You may only depend&#xA;on default python built-ins or the python standard&#xA;library. Or if you manage to hide it and I out of&#xA;coincidence have the package...&lt;/p&gt;&#xA;&lt;p&gt;The second part is your functions. Naming your function&#xA;&lt;code&gt;bot_name_with_underscores&lt;/code&gt;&#xA;is encouraged.&lt;/p&gt;&#xA;&lt;p&gt;The third part are game parameters.&#xA;The number of rounds, the accessible outputs,&#xA;etc.&lt;/p&gt;&#xA;&lt;p&gt;The fourth part is &lt;strong&gt;running the program&lt;/strong&gt;!!!&lt;/p&gt;&#xA;&lt;p&gt;An example output is as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&#xA;Round #1 Reports: &#xA;&#xA;Bots Report: &#xA;random better        chose 3 and got 1.5 additional points, making it now have 1.5 points!!! &#xA;greedy better        chose 10 and got 10.0 additional points, making it now have 10.0 points!!! &#xA;calculator           chose 1 and got 1.0 additional points, making it now have 1.0 points!!! &#xA;smarty               chose 3 and got 1.5 additional points, making it now have 1.5 points!!! &#xA;&#xA;Distribution Report: &#xA;The number of bots who chose 1 is: 1!!! &#xA;The number of bots who chose 2 is: 0!!! &#xA;The number of bots who chose 3 is: 2!!! &#xA;The number of bots who chose 4 is: 0!!! &#xA;The number of bots who chose 5 is: 0!!! &#xA;The number of bots who chose 6 is: 0!!! &#xA;The number of bots who chose 7 is: 0!!! &#xA;The number of bots who chose 8 is: 0!!! &#xA;The number of bots who chose 9 is: 0!!! &#xA;The number of bots who chose 10 is: 1!!! &#xA;&#xA;Leaderboard Report: &#xA;&#xA;greedy better        with 10.0 points, &#xA;random better        with 1.5 points, and&#xA;smarty               with 1.5 points!!! &#xA;&#xA;&#xA;&#xA;Round #2 Reports: &#xA;&#xA;Bots Report: &#xA;random better        chose 7 and got 7.0 additional points, making it now have 8.5 points!!! &#xA;greedy better        chose 10 and got 5.0 additional points, making it now have 15.0 points!!! &#xA;calculator           chose 1 and got 1.0 additional points, making it now have 2.0 points!!! &#xA;smarty               chose 10 and got 5.0 additional points, making it now have 6.5 points!!! &#xA;&#xA;Distribution Report: &#xA;The number of bots who chose 1 is: 1!!! &#xA;The number of bots who chose 2 is: 0!!! &#xA;The number of bots who chose 3 is: 0!!! &#xA;The number of bots who chose 4 is: 0!!! &#xA;The number of bots who chose 5 is: 0!!! &#xA;The number of bots who chose 6 is: 0!!! &#xA;The number of bots who chose 7 is: 1!!! &#xA;The number of bots who chose 8 is: 0!!! &#xA;The number of bots who chose 9 is: 0!!! &#xA;The number of bots who chose 10 is: 2!!! &#xA;&#xA;Leaderboard Report: &#xA;&#xA;greedy better        with 15.0 points, &#xA;random better        with 8.5 points, and&#xA;smarty               with 6.5 points!!! &#xA;&#xA;&#xA;&#xA;Round #3 Reports: &#xA;&#xA;Bots Report: &#xA;random better        chose 4 and got 4.0 additional points, making it now have 12.5 points!!! &#xA;greedy better        chose 10 and got 10.0 additional points, making it now have 25.0 points!!! &#xA;calculator           chose 1 and got 1.0 additional points, making it now have 3.0 points!!! &#xA;smarty               chose 2 and got 2.0 additional points, making it now have 8.5 points!!! &#xA;&#xA;Distribution Report: &#xA;The number of bots who chose 1 is: 1!!! &#xA;The number of bots who chose 2 is: 1!!! &#xA;The number of bots who chose 3 is: 0!!! &#xA;The number of bots who chose 4 is: 1!!! &#xA;The number of bots who chose 5 is: 0!!! &#xA;The number of bots who chose 6 is: 0!!! &#xA;The number of bots who chose 7 is: 0!!! &#xA;The number of bots who chose 8 is: 0!!! &#xA;The number of bots who chose 9 is: 0!!! &#xA;The number of bots who chose 10 is: 1!!! &#xA;&#xA;Leaderboard Report: &#xA;&#xA;greedy better        with 25.0 points, &#xA;random better        with 12.5 points, and&#xA;smarty               with 8.5 points!!! &#xA;&#xA;&#xA;&#xA;Round #4 Reports: &#xA;&#xA;Bots Report: &#xA;random better        chose 6 and got 6.0 additional points, making it now have 18.5 points!!! &#xA;greedy better        chose 10 and got 10.0 additional points, making it now have 35.0 points!!! &#xA;calculator           chose 1 and got 1.0 additional points, making it now have 4.0 points!!! &#xA;smarty               chose 2 and got 2.0 additional points, making it now have 10.5 points!!! &#xA;&#xA;Distribution Report: &#xA;The number of bots who chose 1 is: 1!!! &#xA;The number of bots who chose 2 is: 1!!! &#xA;The number of bots who chose 3 is: 0!!! &#xA;The number of bots who chose 4 is: 0!!! &#xA;The number of bots who chose 5 is: 0!!! &#xA;The number of bots who chose 6 is: 1!!! &#xA;The number of bots who chose 7 is: 0!!! &#xA;The number of bots who chose 8 is: 0!!! &#xA;The number of bots who chose 9 is: 0!!! &#xA;The number of bots who chose 10 is: 1!!! &#xA;&#xA;Leaderboard Report: &#xA;&#xA;greedy better        with 35.0 points, &#xA;random better        with 18.5 points, and&#xA;smarty               with 10.5 points!!! &#xA;&#xA;&#xA;&#xA;Round #5 Reports: &#xA;&#xA;Bots Report: &#xA;random better        chose 2 and got 2.0 additional points, making it now have 20.5 points!!! &#xA;greedy better        chose 10 and got 10.0 additional points, making it now have 45.0 points!!! &#xA;calculator           chose 1 and got 1.0 additional points, making it now have 5.0 points!!! &#xA;smarty               chose 6 and got 6.0 additional points, making it now have 16.5 points!!! &#xA;&#xA;Distribution Report: &#xA;The number of bots who chose 1 is: 1!!! &#xA;The number of bots who chose 2 is: 1!!! &#xA;The number of bots who chose 3 is: 0!!! &#xA;The number of bots who chose 4 is: 0!!! &#xA;The number of bots who chose 5 is: 0!!! &#xA;The number of bots who chose 6 is: 1!!! &#xA;The number of bots who chose 7 is: 0!!! &#xA;The number of bots who chose 8 is: 0!!! &#xA;The number of bots who chose 9 is: 0!!! &#xA;The number of bots who chose 10 is: 1!!! &#xA;&#xA;Leaderboard Report: &#xA;&#xA;greedy better        with 45.0 points, &#xA;random better        with 20.5 points, and&#xA;smarty               with 16.5 points!!! &#xA;&#xA;&#xA;&#xA;Round #6 Reports: &#xA;&#xA;Bots Report: &#xA;random better        chose 3 and got 3.0 additional points, making it now have 23.5 points!!! &#xA;greedy better        chose 10 and got 10.0 additional points, making it now have 55.0 points!!! &#xA;calculator           chose 1 and got 1.0 additional points, making it now have 6.0 points!!! &#xA;smarty               chose 2 and got 2.0 additional points, making it now have 18.5 points!!! &#xA;&#xA;Distribution Report: &#xA;The number of bots who chose 1 is: 1!!! &#xA;The number of bots who chose 2 is: 1!!! &#xA;The number of bots who chose 3 is: 1!!! &#xA;The number of bots who chose 4 is: 0!!! &#xA;The number of bots who chose 5 is: 0!!! &#xA;The number of bots who chose 6 is: 0!!! &#xA;The number of bots who chose 7 is: 0!!! &#xA;The number of bots who chose 8 is: 0!!! &#xA;The number of bots who chose 9 is: 0!!! &#xA;The number of bots who chose 10 is: 1!!! &#xA;&#xA;Leaderboard Report: &#xA;&#xA;greedy better        with 55.0 points, &#xA;random better        with 23.5 points, and&#xA;smarty               with 18.5 points!!! &#xA;&#xA;&#xA;&#xA;Round #7 Reports: &#xA;&#xA;Bots Report: &#xA;random better        chose 8 and got 8.0 additional points, making it now have 31.5 points!!! &#xA;greedy better        chose 10 and got 10.0 additional points, making it now have 65.0 points!!! &#xA;calculator           chose 1 and got 1.0 additional points, making it now have 7.0 points!!! &#xA;smarty               chose 3 and got 3.0 additional points, making it now have 21.5 points!!! &#xA;&#xA;Distribution Report: &#xA;The number of bots who chose 1 is: 1!!! &#xA;The number of bots who chose 2 is: 0!!! &#xA;The number of bots who chose 3 is: 1!!! &#xA;The number of bots who chose 4 is: 0!!! &#xA;The number of bots who chose 5 is: 0!!! &#xA;The number of bots who chose 6 is: 0!!! &#xA;The number of bots who chose 7 is: 0!!! &#xA;The number of bots who chose 8 is: 1!!! &#xA;The number of bots who chose 9 is: 0!!! &#xA;The number of bots who chose 10 is: 1!!! &#xA;&#xA;Leaderboard Report: &#xA;&#xA;greedy better        with 65.0 points, &#xA;random better        with 31.5 points, and&#xA;smarty               with 21.5 points!!! &#xA;&#xA;&#xA;&#xA;Round #8 Reports: &#xA;&#xA;Bots Report: &#xA;random better        chose 1 and got 0.5 additional points, making it now have 32.0 points!!! &#xA;greedy better        chose 10 and got 5.0 additional points, making it now have 70.0 points!!! &#xA;calculator           chose 1 and got 0.5 additional points, making it now have 7.5 points!!! &#xA;smarty               chose 10 and got 5.0 additional points, making it now have 26.5 points!!! &#xA;&#xA;Distribution Report: &#xA;The number of bots who chose 1 is: 2!!! &#xA;The number of bots who chose 2 is: 0!!! &#xA;The number of bots who chose 3 is: 0!!! &#xA;The number of bots who chose 4 is: 0!!! &#xA;The number of bots who chose 5 is: 0!!! &#xA;The number of bots who chose 6 is: 0!!! &#xA;The number of bots who chose 7 is: 0!!! &#xA;The number of bots who chose 8 is: 0!!! &#xA;The number of bots who chose 9 is: 0!!! &#xA;The number of bots who chose 10 is: 2!!! &#xA;&#xA;Leaderboard Report: &#xA;&#xA;greedy better        with 70.0 points, &#xA;random better        with 32.0 points, and&#xA;smarty               with 26.5 points!!! &#xA;&#xA;&#xA;&#xA;Round #9 Reports: &#xA;&#xA;Bots Report: &#xA;random better        chose 3 and got 3.0 additional points, making it now have 35.0 points!!! &#xA;greedy better        chose 10 and got 5.0 additional points, making it now have 75.0 points!!! &#xA;calculator           chose 1 and got 1.0 additional points, making it now have 8.5 points!!! &#xA;smarty               chose 10 and got 5.0 additional points, making it now have 31.5 points!!! &#xA;&#xA;Distribution Report: &#xA;The number of bots who chose 1 is: 1!!! &#xA;The number of bots who chose 2 is: 0!!! &#xA;The number of bots who chose 3 is: 1!!! &#xA;The number of bots who chose 4 is: 0!!! &#xA;The number of bots who chose 5 is: 0!!! &#xA;The number of bots who chose 6 is: 0!!! &#xA;The number of bots who chose 7 is: 0!!! &#xA;The number of bots who chose 8 is: 0!!! &#xA;The number of bots who chose 9 is: 0!!! &#xA;The number of bots who chose 10 is: 2!!! &#xA;&#xA;Leaderboard Report: &#xA;&#xA;greedy better        with 75.0 points, &#xA;random better        with 35.0 points, and&#xA;smarty               with 31.5 points!!! &#xA;&#xA;&#xA;&#xA;Round #10 Reports: &#xA;&#xA;Bots Report: &#xA;random better        chose 2 and got 2.0 additional points, making it now have 37.0 points!!! &#xA;greedy better        chose 10 and got 5.0 additional points, making it now have 80.0 points!!! &#xA;calculator           chose 1 and got 1.0 additional points, making it now have 9.5 points!!! &#xA;smarty               chose 10 and got 5.0 additional points, making it now have 36.5 points!!! &#xA;&#xA;Distribution Report: &#xA;The number of bots who chose 1 is: 1!!! &#xA;The number of bots who chose 2 is: 1!!! &#xA;The number of bots who chose 3 is: 0!!! &#xA;The number of bots who chose 4 is: 0!!! &#xA;The number of bots who chose 5 is: 0!!! &#xA;The number of bots who chose 6 is: 0!!! &#xA;The number of bots who chose 7 is: 0!!! &#xA;The number of bots who chose 8 is: 0!!! &#xA;The number of bots who chose 9 is: 0!!! &#xA;The number of bots who chose 10 is: 2!!! &#xA;&#xA;Leaderboard Report: &#xA;&#xA;greedy better        with 80.0 points, &#xA;random better        with 37.0 points, and&#xA;smarty               with 36.5 points!!! &#xA;&#xA;&#xA;&#xA;Final Report Card: &#xA;&#xA;greedy better       : 80.0 points. &#xA;random better       : 37.0 points. &#xA;smarty              : 36.5 points. &#xA;calculator          : 9.5 points. &#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;If any bot runs into an error,&lt;/h2&gt;&#xA;&lt;p&gt;it fails. So &lt;strong&gt;CHECK IT&lt;/strong&gt;!!! Make it &lt;strong&gt;FOOLPROOF&lt;/strong&gt;!!!&lt;/p&gt;&#xA;&lt;h2&gt;Winner&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="111945" LastEditorUserId="111945" LastEditDate="2022-05-13T00:32:53.690" LastActivityDate="2022-05-13T00:32:53.690" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24763" PostTypeId="2" ParentId="2140" CreationDate="2022-05-12T15:11:59.113" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/247469/irradiated-polyglots&quot;&gt;Irradiated Polyglots&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/radiation-hardening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; rel=&quot;tag&quot;&gt;radiation-hardening&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="108673" LastEditorUserId="108673" LastEditDate="2022-05-17T22:23:46.000" LastActivityDate="2022-05-17T22:23:46.000" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24764" PostTypeId="2" ParentId="2140" CreationDate="2022-05-12T21:08:53.947" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/247276/write-a-simplified-bitcycle-interpreter&quot;&gt;Write a (simplified) BitCycle Interpreter&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108673" LastEditorUserId="108673" LastEditDate="2022-05-13T20:16:28.737" LastActivityDate="2022-05-13T20:16:28.737" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24765" PostTypeId="2" ParentId="5243" CreationDate="2022-05-12T21:37:10.470" Score="5" Body="&lt;h1&gt;50-500 rep for answering one of my challenges in one of my languages&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;TL;DR:&lt;/strong&gt; I will bounty your answer if you answer one of my challenges using a language I made.&lt;/p&gt;&#xA;&lt;h3&gt;Eligibility&lt;/h3&gt;&#xA;&lt;p&gt;Eligible challenges are any of &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=is%3Aq+user%3A16766+%5Bcode-golf%5D+-%5Btips%5D&quot;&gt;my code-golf challenges&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Eligible languages include any programming language that was primarily created and developed by me. As of April 5, 2024, that means &lt;a href=&quot;https://github.com/dloscutoff/Esolangs/tree/master/Acc!!&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;Acc!!&lt;/em&gt;&lt;/a&gt;, &lt;a href=&quot;https://github.com/dloscutoff/appleseed&quot; rel=&quot;nofollow noreferrer&quot;&gt;Appleseed&lt;/a&gt;, &lt;a href=&quot;https://github.com/dloscutoff/Esolangs/tree/master/BitCycle&quot; rel=&quot;nofollow noreferrer&quot;&gt;BitCycle&lt;/a&gt;, &lt;a href=&quot;https://github.com/dloscutoff/Esolangs/tree/master/Exceptionally&quot; rel=&quot;nofollow noreferrer&quot;&gt;Exceptionally&lt;/a&gt;, &lt;a href=&quot;https://github.com/dloscutoff/funstack&quot; rel=&quot;nofollow noreferrer&quot;&gt;FunStack&lt;/a&gt;, &lt;a href=&quot;https://github.com/dloscutoff/hbl&quot; rel=&quot;nofollow noreferrer&quot;&gt;HBL&lt;/a&gt;, &lt;a href=&quot;https://github.com/dloscutoff/Esolangs/tree/master/Ouroboros&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ouroboros&lt;/a&gt;, &lt;a href=&quot;https://github.com/dloscutoff/pip&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pip&lt;/a&gt;, &lt;a href=&quot;https://github.com/dloscutoff/Esolangs/tree/master/Regenerate&quot; rel=&quot;nofollow noreferrer&quot;&gt;Regenerate&lt;/a&gt;, &lt;a href=&quot;https://github.com/dloscutoff/Esolangs/tree/master/Sisi&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sisi&lt;/a&gt;, &lt;a href=&quot;https://github.com/dloscutoff/Esolangs/tree/master/tinylisp&quot; rel=&quot;nofollow noreferrer&quot;&gt;tinylisp&lt;/a&gt;, &lt;a href=&quot;https://github.com/dloscutoff/tinylisp2&quot; rel=&quot;nofollow noreferrer&quot;&gt;tinylisp 2&lt;/a&gt;, or &lt;a href=&quot;https://github.com/dloscutoff/zephyr&quot; rel=&quot;nofollow noreferrer&quot;&gt;Zephyr&lt;/a&gt;. If I make a new language in the future, feel free to ping me or update the list yourself.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;If there is already an answer to a challenge in a given language,&lt;/strong&gt; another answer in the same language is &lt;strong&gt;not&lt;/strong&gt; eligible for a bounty &lt;strong&gt;unless&lt;/strong&gt; it outgolfs the existing answer. If you further golf someone else's answer that already won this bounty, I'll decide case-by-case whether to award another bounty.&lt;/p&gt;&#xA;&lt;h3&gt;Amount&lt;/h3&gt;&#xA;&lt;p&gt;How big of a bounty I award depends on how difficult the challenge + language combination is. Here's a general difficulty ranking of the languages:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Usable: Pip&lt;/li&gt;&#xA;&lt;li&gt;Reasonably usable: Appleseed, tinylisp, tinylisp 2&lt;/li&gt;&#xA;&lt;li&gt;Inconvenient: Exceptionally, FunStack, HBL, Ouroboros, Regenerate, Sisi, Zephyr&lt;/li&gt;&#xA;&lt;li&gt;Tarpit: &lt;em&gt;Acc!!&lt;/em&gt;, BitCycle&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;But the difficulty also depends a lot on the challenge. Things that are trivial in Regenerate may be quite hard in tinylisp. And some challenges aren't easy in any language. Ultimately, the exact bounty amount comes down to my subjective judgment. You also get bonus points for a good explanation!&lt;/p&gt;&#xA;&lt;p&gt;(A particularly jaw-dropping answer may get more than 500 rep. For example, if you solve &lt;a href=&quot;https://codegolf.stackexchange.com/q/62886/16766&quot;&gt;Tiny Lisp, tiny interpreter&lt;/a&gt; in &lt;em&gt;Acc!!&lt;/em&gt;, you're getting at least 1000. =P)&lt;/p&gt;&#xA;&lt;p&gt;If other factors (for example, whether I've previously bountied the question) prevent me from bountying the answer with the amount I would like, I will work out another arrangement with you. The ideal arrangement would be bountying an answer to a different challenge written in the same language.&lt;/p&gt;&#xA;&lt;p&gt;Bounties will be paused if my rep drops below 20,000.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Bounty Claims&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;- [Challenge title](answer link) in language by [username](code golf user profile)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Awarded&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247238&quot;&gt;Ungolf my tinylisp code&lt;/a&gt; in tinylisp by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresu A&lt;/a&gt; (250)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/266192/92727&quot;&gt;Is it true? Ask Pip!&lt;/a&gt; in &lt;em&gt;Acc!!&lt;/em&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92727/command-master&quot;&gt;Command Master&lt;/a&gt; (200)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="16766" LastEditDate="2024-04-06T04:40:07.343" LastActivityDate="2024-04-06T04:40:07.343" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24766" PostTypeId="2" ParentId="2140" CreationDate="2022-05-13T00:11:25.863" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/247314/bitcycle-metagolf&quot;&gt;BitCycle Metagolf&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96039" LastEditorUserId="96039" LastEditDate="2022-05-15T08:35:30.810" LastActivityDate="2022-05-15T08:35:30.810" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24767" PostTypeId="2" ParentId="2140" CreationDate="2022-05-13T06:11:50.153" Score="2" Body="&lt;h1&gt;Modular tetration&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Tetration&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tetration&lt;/a&gt; is the operation of repeated exponentiation. That is &lt;span class=&quot;math-container&quot;&gt;\$ ^{n}a = a ^ {. ^ {. ^ {.^a}}} \$&lt;/span&gt;, with &lt;span class=&quot;math-container&quot;&gt;\$ a \$&lt;/span&gt; appearing &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; times.&lt;/p&gt;&#xA;&lt;p&gt;Tetration grows extremely fast - &lt;span class=&quot;math-container&quot;&gt;\$ ^6 2 \$&lt;/span&gt; would take significantly more digits to write then there are atoms in the known universe.&lt;/p&gt;&#xA;&lt;p&gt;However, to work with big numbers, we can operate on them modulo some number &lt;span class=&quot;math-container&quot;&gt;\$ m \$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to calculate &lt;span class=&quot;math-container&quot;&gt;\$ ^n a \mod m \$&lt;/span&gt;, with integer &lt;span class=&quot;math-container&quot;&gt;\$ 1 &amp;lt; a,n &amp;lt; m \$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may use any consistent &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;reasonable I/O method&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The complexity of your answer must be &lt;span class=&quot;math-container&quot;&gt;\$ O(m) \$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$ m \$&lt;/span&gt; is the modulus. In particular, you can't calculate &lt;span class=&quot;math-container&quot;&gt;\$ ^{n}a \$&lt;/span&gt; with arbitrary precision and then modulo by &lt;span class=&quot;math-container&quot;&gt;\$ m \$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are disallowed.&lt;/li&gt;&#xA;&lt;li&gt;Your algorithm must work for all values, but it's allowed for your program to fail due to integer overflow.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;The format for the test cases is &lt;code&gt;a n m -&amp;gt; answer&lt;/code&gt; (however, you can take your input in any order)&#xA;[&lt;strong&gt;Sandbox note:&lt;/strong&gt; TODO - there's an error in my program]&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2022-05-13T12:04:30.393" LastActivityDate="2022-05-13T12:04:30.393" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24768" PostTypeId="2" ParentId="2140" CreationDate="2022-05-13T12:38:08.817" Score="1" Body="&lt;h1&gt;Cross of Numbers &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Given a number &lt;code&gt;n&lt;/code&gt; as input, output an ASCII cross composed of numbers counting up to that length. Counting starts at 0 in the center, and numbers with more than one digit simply have their digits printed in order in the correct direction.&lt;/p&gt;&#xA;&lt;p&gt;Example for &lt;code&gt;n=12&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;               2&#xA;               1&#xA;               1&#xA;               1&#xA;               0&#xA;               1&#xA;               9&#xA;               8&#xA;               7&#xA;               6&#xA;               5&#xA;               4&#xA;               3&#xA;               2&#xA;               1&#xA;2111019876543210123456789101112&#xA;               1&#xA;               2&#xA;               3&#xA;               4&#xA;               5&#xA;               6&#xA;               7&#xA;               8&#xA;               9&#xA;               1&#xA;               0&#xA;               1&#xA;               1&#xA;               1&#xA;               2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;p&gt;Is this appropriate for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot;&gt;kolmogorov-complexity&lt;/a&gt;?&lt;/p&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2022-05-15T13:41:49.203" LastActivityDate="2022-05-15T13:41:49.203" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24769" PostTypeId="2" ParentId="2140" CreationDate="2022-05-13T15:39:43.660" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/247294/107299&quot;&gt;Convert Alpha-2 to Alpha-3&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="107299" LastEditorUserId="107299" LastEditDate="2022-05-14T18:41:47.360" LastActivityDate="2022-05-14T18:41:47.360" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24770" PostTypeId="2" ParentId="2140" CreationDate="2022-05-15T14:49:21.947" Score="1" Body="&lt;h1&gt;Categorising categories &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graph-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graph-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;graph-theory&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Category_(mathematics)&quot; rel=&quot;nofollow noreferrer&quot;&gt;category&lt;/a&gt; is an abstract mathematical object whose actual meaning is not really important here. A category can be viewed as a &lt;a href=&quot;https://en.wikipedia.org/wiki/Directed_graph&quot; rel=&quot;nofollow noreferrer&quot;&gt;directed graph&lt;/a&gt; with the following restrictions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;every node in the graph has at least one edge from and to itself&lt;/li&gt;&#xA;&lt;li&gt;for every pair of edges which share an intermediate node (like &lt;span class=&quot;math-container&quot;&gt;\$ a \rightarrow b \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$ b \rightarrow c \$&lt;/span&gt;), there must exist an edge which is their composition, like &lt;span class=&quot;math-container&quot;&gt;\$ a \rightarrow c \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;More mathematically, where &lt;span class=&quot;math-container&quot;&gt;\$ E(a, b) \$&lt;/span&gt; means &amp;quot;there exists an edge from &lt;span class=&quot;math-container&quot;&gt;\$ a \$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$ b \$&lt;/span&gt;&amp;quot;:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\forall a \in G. E(a, a)&#xA;\\&#xA;\forall a, b, c \in G. E(a, b) \vee E(b, c) \implies E(a,c)&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to determine whether a given directed graph satisfies the above restrictions.&lt;/p&gt;&#xA;&lt;h2&gt;I/O&lt;/h2&gt;&#xA;&lt;p&gt;You may take input using any reasonable representation of a graph, such as:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;an edge list&lt;/li&gt;&#xA;&lt;li&gt;an adjacency list&lt;/li&gt;&#xA;&lt;li&gt;an adjacency matrix&lt;/li&gt;&#xA;&lt;li&gt;a built-in directed graph type&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may assume there are no duplicate edges (but note that the edge &lt;span class=&quot;math-container&quot;&gt;\$ a \rightarrow b \$&lt;/span&gt; is not the same as &lt;span class=&quot;math-container&quot;&gt;\$ b \rightarrow a \$&lt;/span&gt;)&lt;/p&gt;&#xA;&lt;p&gt;Nodes will be represented by positive integers starting from &lt;span class=&quot;math-container&quot;&gt;\$ 1 \$&lt;/span&gt;, i.e., elements of the range &lt;span class=&quot;math-container&quot;&gt;\$ [1, n] \$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; is the number of nodes. You may optionally also take &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; as a second input.&lt;/p&gt;&#xA;&lt;p&gt;You should output one of two distinct values of your choosing, which correspond to true and false results.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may use any &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447&quot;&gt;standard I/O method&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should I remove the first requirement (&amp;quot;every node in the graph has at least one edge from and to itself&amp;quot;)? I think it doesn't add much to the challenge, but then it's less directly related to category theory &lt;s&gt;and I can't use the funny title&lt;/s&gt;&lt;/li&gt;&#xA;&lt;li&gt;Is this clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Any other feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2022-05-15T14:49:21.947" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24771" PostTypeId="1" CreationDate="2022-05-15T15:30:13.440" Score="16" ViewCount="363" Body="&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; is getting new room owners. You've had a week (and a couple of hours) for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/24731/66833&quot;&gt;nominations&lt;/a&gt;, and now it's time to vote. In alphabetical order, here are the nominees:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;emanresu A&lt;/strong&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://chat.stackexchange.com/users/497390&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/u/100664&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/u/100664&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24734&quot;&gt;nomination&lt;/a&gt; | &lt;a href=&quot;/a/24772&quot;&gt;vote here&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;lyxal&lt;/strong&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://chat.stackexchange.com/users/354515&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/u/78850&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/u/78850&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24732&quot;&gt;nomination&lt;/a&gt; | &lt;a href=&quot;/a/24773&quot;&gt;vote here&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;pxeger&lt;/strong&gt;&lt;br /&gt;&#xA;&lt;a href=&quot;https://chat.stackexchange.com/users/475866&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/u/97857&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/u/97857&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24733&quot;&gt;nomination&lt;/a&gt; | &lt;a href=&quot;/a/24774&quot;&gt;vote here&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Each candidate has a community wiki answer below. You may vote on as many as you want, and the candidates are welcome to vote as well, including for (or against) themselves.&lt;/p&gt;&#xA;&lt;p&gt;Voting will close in a week (15:30UTC, Sunday 22nd of May). At the end of the election, we (the moderators and existing room owners) will review the votes and appoint either the two or three highest voted candidates (this does mean that, potentially, all candidates can be appointed).&lt;/p&gt;&#xA;&lt;p&gt;Best of luck to all candidates!&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Important note&lt;/strong&gt;: serial voting detection applies to meta as well. If you vote for several candidates within a short span of time, your votes may be automatically cancelled. Make sure you check back before the voting period closes to make sure your votes went through.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-05-22T14:19:12.020" Title="Vote for the new TNB Room Owners!" Tags="|discussion|chat|moderation|" AnswerCount="3" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24772" PostTypeId="2" ParentId="24771" CreationDate="2022-05-15T15:30:13.440" Score="19" Body="&lt;h2&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/497390&quot;&gt;emanresu A&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/497390&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/uKVAs.jpg?s=128&amp;amp;g=1&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/497390&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/u/100664&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/u/100664&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24734&quot;&gt;nomination&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Chat user since 2021-02-04.&lt;/p&gt;&#xA;&lt;p&gt;588 messages this week. 683 messages last week. 603 messages per week.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="78850" LastEditDate="2022-05-22T08:05:39.480" LastActivityDate="2022-05-22T08:05:39.480" CommentCount="0" CommunityOwnedDate="2022-05-15T15:30:13.440" ContentLicense="CC BY-SA 4.0" />
  <row Id="24773" PostTypeId="2" ParentId="24771" CreationDate="2022-05-15T15:31:29.840" Score="19" Body="&lt;h2&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/354515&quot;&gt;lyxal&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/354515&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/QsrN0.jpg?s=128&amp;amp;g=1&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/354515&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/u/78850&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/u/78850&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24732&quot;&gt;nomination&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Chat user since 2018-05-31.&lt;/p&gt;&#xA;&lt;p&gt;861 messages this week. 931 messages last week. 801 messages per week.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="78850" LastEditDate="2022-05-22T14:19:12.020" LastActivityDate="2022-05-22T14:19:12.020" CommentCount="0" CommunityOwnedDate="2022-05-15T15:31:29.840" ContentLicense="CC BY-SA 4.0" />
  <row Id="24774" PostTypeId="2" ParentId="24771" CreationDate="2022-05-15T15:33:04.493" Score="19" Body="&lt;h2&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/475866&quot;&gt;pxeger&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/475866&quot;&gt;&lt;img src=&quot;https://www.gravatar.com/avatar/4d63e5b18af4433f673101d8589a4c59?s=128&amp;amp;d=identicon&amp;amp;r=PG&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/475866&quot;&gt;chat profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.stackexchange.com/u/97857&quot;&gt;main profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/u/97857&quot;&gt;meta profile&lt;/a&gt; | &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24733&quot;&gt;nomination&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Chat user since 2020-08-21.&lt;/p&gt;&#xA;&lt;p&gt;154 messages this week. 231 messages last week. 219 messages per week.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="78850" LastEditDate="2022-05-22T08:05:28.417" LastActivityDate="2022-05-22T08:05:28.417" CommentCount="0" CommunityOwnedDate="2022-05-15T15:33:04.493" ContentLicense="CC BY-SA 4.0" />
  <row Id="24776" PostTypeId="2" ParentId="2140" CreationDate="2022-05-16T04:47:09.357" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/247552/solve-the-zany-car-game&quot;&gt;Solve the Zany car game&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110555" LastEditorUserId="110555" LastEditDate="2022-05-19T20:10:59.577" LastActivityDate="2022-05-19T20:10:59.577" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24777" PostTypeId="2" ParentId="2140" CreationDate="2022-05-16T13:41:45.843" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/247398&quot;&gt;Alternating sums of multidimensional arrays&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="97857" LastEditDate="2022-05-17T11:56:11.507" LastActivityDate="2022-05-17T11:56:11.507" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24778" PostTypeId="2" ParentId="2140" CreationDate="2022-05-16T19:18:14.107" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/247967/72535&quot;&gt;Whyte Notation Translator&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="72535" LastEditorUserId="72535" LastEditDate="2022-05-29T17:08:41.480" LastActivityDate="2022-05-29T17:08:41.480" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="24779" PostTypeId="2" ParentId="2140" CreationDate="2022-05-16T23:10:53.890" Score="-3" Body="&lt;h1&gt;Longest Possible Pythagorean Triple Triangle&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot;&gt;arithmetic&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;A Pythagorean triple is a set of 3 integers &lt;span class=&quot;math-container&quot;&gt;\$\{a, b, c\}\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$a^2 + b^2 = c^2\$&lt;/span&gt;. Your task is to, given an integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$3 ≤ n ≤ 15\$&lt;/span&gt;, output a Pythagorean triple using these rules:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is odd, output &lt;span class=&quot;math-container&quot;&gt;\$\{n, \frac{n^2-1}{2}, \frac{n^2+1}{2}\}\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is even, output &lt;span class=&quot;math-container&quot;&gt;\$\{n, \frac{n^2}{4}-1, \frac{n^2}{4}+1\}\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;With these rules, the difference between the lengths of the longest leg and the hypotenuse is minimized.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input and output can be in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447&quot;&gt;any convenient format&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The output does not have to be in any particular order.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input | Output&#xA;------+-------&#xA;3     | 3 4 5&#xA;4     | 4 3 5&#xA;5     | 5 12 13&#xA;6     | 6 8 10&#xA;7     | 7 24 25&#xA;8     | 8 15 17&#xA;9     | 9 40 41&#xA;10    | 10 24 26&#xA;11    | 11 60 61&#xA;12    | 12 35 37&#xA;13    | 13 84 85&#xA;14    | 14 48 50&#xA;15    | 15 112 113&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;See &lt;a href=&quot;https://oeis.org/A055523&quot; rel=&quot;nofollow noreferrer&quot;&gt;A055523&lt;/a&gt; and &lt;a href=&quot;https://oeis.org/A055524&quot; rel=&quot;nofollow noreferrer&quot;&gt;A055524&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="91262" LastActivityDate="2022-05-16T23:10:53.890" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24780" PostTypeId="2" ParentId="2140" CreationDate="2022-05-17T21:48:12.477" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/247669/i-want-8-bits-for-every-character&quot;&gt;I want 8 bits for every character!&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="92689" LastEditorUserId="92689" LastEditDate="2022-05-22T23:51:37.010" LastActivityDate="2022-05-22T23:51:37.010" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24781" PostTypeId="2" ParentId="2140" CreationDate="2022-05-18T09:26:47.743" Score="7" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/247751/92689&quot;&gt;Eh, codegolf shmodegolf&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="88906" LastEditorUserId="92689" LastEditDate="2022-05-24T18:02:18.523" LastActivityDate="2022-05-24T18:02:18.523" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="24783" PostTypeId="2" ParentId="2140" CreationDate="2022-05-19T02:17:13.870" Score="-2" Body="&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Make a program that finds the first IP address that responds to pings after a certain IP address.&lt;/p&gt;&#xA;&lt;h2&gt;Requirements&lt;/h2&gt;&#xA;&lt;p&gt;Your program should take an IP address as a string in the form &lt;code&gt;xx.xx.xx.xx&lt;/code&gt;. It should find the first IP greater than the input (incrementing least significant byte first) that responds to pings, and output it in the form &lt;code&gt;xx.xx.xx.xx&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;This is code-golf, so shortest answer in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="100374" LastActivityDate="2022-05-19T02:17:13.870" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24784" PostTypeId="1" CreationDate="2022-05-19T10:21:05.203" Score="18" ViewCount="252" Body="&lt;p&gt;You've probably seen the &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges&quot;&gt;privileges list&lt;/a&gt;, and you've probably looked at it and found some quite useful stuff (and some &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/protect-questions&quot;&gt;complete garbage&lt;/a&gt;) that you may not have. So... how do you get reputation?&lt;/p&gt;&#xA;&lt;h2&gt;Bounty hunting&lt;/h2&gt;&#xA;&lt;p&gt;We rarely offer spontaneous bounties on this site. Instead, we usually offer &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5243/list-of-bounties-with-no-deadline&quot;&gt;deadlineless bounties&lt;/a&gt;. These offer reputation for accomplishing certain tasks, from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/22137/100664&quot;&gt;using a language&lt;/a&gt; to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24529/100664&quot;&gt;cracking C&amp;amp;Rs&lt;/a&gt; to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/23832/100664&quot;&gt;improving on an answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24358/100664&quot;&gt;creating something truly amazing&lt;/a&gt;. Whatever the case, these bounties are for something special.&lt;/p&gt;&#xA;&lt;p&gt;A specific case of this is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19279/nominations-for-language-of-the-month-take-2&quot;&gt;Language of the Month&lt;/a&gt;. This is a monthly challenge where you post answers in a specific language, and there are usually bounties attached. The languages are generally well-documented and easy to learn, and you can sometimes find a language that you'll want to stick with after the month ends.&lt;/p&gt;&#xA;&lt;h2&gt;Post high-quality unique questions&lt;/h2&gt;&#xA;&lt;p&gt;Unlike other sites on the network, questions take a fair amount of effort to write and give a lot of reputation. Well-written questions can get tens of upvotes, but poorly written questions can get closed and recieve large amounts of downvotes. Fortunately, the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt; exists to catch issues before they make it to the site.&lt;/p&gt;&#xA;&lt;p&gt;The sandbox only works if used responsibly - negative feedback in the sandbox will often be magnified hugely on main, so leave posts there for at least three days, and try asking for feedback in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; if none's given (avoid nagging though).&lt;/p&gt;&#xA;&lt;p&gt;Having original challenge ideas is hard, and so is determining if something is a good challenge. A good &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge is usually a simple transformation from input to output, and if it includes something in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges&quot;&gt;Things to avoid&lt;/a&gt; list see if you can remove that.&lt;/p&gt;&#xA;&lt;h2&gt;Learn an interesting language&lt;/h2&gt;&#xA;&lt;p&gt;If you primarily golf in something like JavaScript or Python, which lots of people use, you'll often get outshone or beaten to it. Instead, it's a good idea to use a language which few people use. Whether it's a rare practical language like &lt;a href=&quot;https://dlang.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;D&lt;/a&gt;, &lt;a href=&quot;https://www.swi-prolog.org/pldoc/man?section=quickstart&quot; rel=&quot;nofollow noreferrer&quot;&gt;Prolog&lt;/a&gt; or &lt;a href=&quot;https://docs.hylang.org/en/alpha/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hy&lt;/a&gt;, a 2d language like &lt;a href=&quot;https://esolangs.org/wiki/Fish&quot; rel=&quot;nofollow noreferrer&quot;&gt;&amp;gt;&amp;lt;&amp;gt;&lt;/a&gt; or &lt;a href=&quot;https://esolangs.org/wiki/Befunge&quot; rel=&quot;nofollow noreferrer&quot;&gt;Befunge&lt;/a&gt;, something truly verbose and annoying like &lt;a href=&quot;https://esolangs.org/wiki/Mornington_Crescent&quot; rel=&quot;nofollow noreferrer&quot;&gt;Mornington Crescent&lt;/a&gt; or &lt;a href=&quot;https://esolangs.org/wiki/Taxi&quot; rel=&quot;nofollow noreferrer&quot;&gt;Taxi&lt;/a&gt;, or even a tarpit like &lt;a href=&quot;https://esolangs.org/wiki/Brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;brainfuck&lt;/a&gt; or &lt;a href=&quot;https://dloscutoff.github.io/Esolangs/BitCycle/&quot; rel=&quot;nofollow noreferrer&quot;&gt;BitCycle&lt;/a&gt;, you'll have lots of fun and you might even create something amazing!&lt;/p&gt;&#xA;&lt;p&gt;However, there's one specific category of language that consistently produces very short solutions that get lots of votes:&lt;/p&gt;&#xA;&lt;h3&gt;Golfing languages&lt;/h3&gt;&#xA;&lt;p&gt;It's simply a fact of this site that golfing language solutions generally get more votes than non-golfing language solutions. With their powerful builtin libraries, they trivialise many simple tasks such as permutations, which allows you to create more interesting and shorter solutions in less time.&lt;/p&gt;&#xA;&lt;p&gt;Golfing language solutions are also inflated by the &lt;a href=&quot;https://meta.stackexchange.com/questions/9731/fastest-gun-in-the-west-problem&quot;&gt;FGITW effect&lt;/a&gt; combined with Hot Network Questions, as they usually recieve slightly more votes, which propels them to the top in the default sorting system of sorting by votes. &amp;quot;Drive-by voters&amp;quot; browsing the HNQ usually only vote on the first few answers, inflating this effect further.&lt;/p&gt;&#xA;&lt;p&gt;That said, it doesn't mean you shouldn't golf in practical languages - They're just as fun to golf in, and sometimes still get &lt;a href=&quot;https://codegolf.stackexchange.com/questions/245318/draw-the-ukrainian-flag/245345#245345&quot;&gt;insane amounts of votes&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Some good golfing languages to learn are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/Vyxal/Vyxal/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Vyxal&lt;/a&gt;, a stack-based golfing language designed to be easy to learn, and well-mantained with a large community.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/dloscutoff/pip/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pip&lt;/a&gt;, an infix ASCII golfing language also designed to be easy to learn&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/Adriandmen/05AB1E/&quot; rel=&quot;nofollow noreferrer&quot;&gt;05AB1E&lt;/a&gt;, another stack-based golfing language&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may have seen languages like CJam, Golfscript and Pyth around the place. The thing is, these languages are fairly ancient. Golfscript is incredibly obsolete, and Cjam and Pyth are referred to as &amp;quot;second-generation&amp;quot; - powerful builtin sets restricted to printable ASCII. Additionally, none of these are mantained any more.&lt;/p&gt;&#xA;&lt;p&gt;You've almost certainly seen &lt;a href=&quot;https://github.com/dennismitchell/jellylanguage&quot; rel=&quot;nofollow noreferrer&quot;&gt;Jelly&lt;/a&gt; around the site. Despite not being updated since 2019 (and not significantly since 2018), it's incredibly powerful and terse, and well ahead of its time; Jelly's still very competitive today. But, its syntactically complex ways of arranging builtins take a while to learn, and far longer to master. I highly recommend learning it, but it's not a good language to start with. If you want to learn it, you might find help in the &lt;a href=&quot;https://chat.stackexchange.com/rooms/57815/jelly-hypertraining&quot;&gt;Jelly room&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Conclusion&lt;/h2&gt;&#xA;&lt;p&gt;In conclusion, simply participate more and you'll get plenty of reputation in no time!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Underappreciated posts&lt;/h2&gt;&#xA;&lt;p&gt;As part of blog posts, we'll demonstrate some of the more unappreciated posts on the site, and we highly recommend you check them out and give them an upvote. These were nominated by various users, and if you think you've found an answer that deserves more appreciation, feel free to drop a link to it in the &lt;a href=&quot;https://chat.stackexchange.com/rooms/123200/cgcc-blog-chat&quot;&gt;CGCC Blog chat room&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/95126/dominic-van-essen&quot;&gt;Dominic Van Essen&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/242197/100664&quot;&gt;Malbolge answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/242076/output-two-numbers-robbers-thread/&quot;&gt;Output Two Numbers (Robbers' thread)&lt;/a&gt;. This answer is written in &lt;a href=&quot;https://esolangs.org/wiki/Malbolge&quot; rel=&quot;nofollow noreferrer&quot;&gt;Malbolge&lt;/a&gt;&#xA;which is already hard enough, and it's written by hand! The &lt;a href=&quot;https://codegolf.stackexchange.com/a/242077/100664&quot;&gt;corresponding cops answer&lt;/a&gt; was created by &lt;a href=&quot;https://codegolf.stackexchange.com/users/61379/kamila-szewczyk&quot;&gt;Kamila Szewczyk&lt;/a&gt;, famously &lt;a href=&quot;https://codegolf.stackexchange.com/questions/188988/ddoouubbllee-ssppeeaakk/189055#189055&quot;&gt;the master of malbolge&lt;/a&gt;. That challenge was to print a number between 1 and 3 (i.e. 2) in 7 bytes, and Dominic managed it in six.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresu A&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/247238/100664&quot;&gt;tinylisp answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/242257/ungolf-my-tinylisp-code/&quot;&gt;Ungolf my Tinylisp code&lt;/a&gt;. This challenge is to format a piece of tinylisp code, so the language is very fitting. The basic strategy of creating a tree used by all the answers doesn't work in tinylisp, so the answer uses a clever iterative approach. It's still twice as long as the other answers, but whatever, it works.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/69059/nitrodon&quot;&gt;Nitrodon&lt;/a&gt;'s &lt;a href=&quot;https://codegolf.stackexchange.com/a/244034/100664&quot;&gt;brainfuck answer&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/243973/resolve-references-in-a-chat-discussion/&quot;&gt;Resolve references in a chat discussion&lt;/a&gt;. Using brainfuck is already hard enough, and this answer uses it where most other answers use arrays and regex, two things Brainfuck is terrible at. Nevertheless, it still solves the challenge in a modest 240 bytes.&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="16766" LastEditDate="2022-05-19T16:22:41.140" LastActivityDate="2022-05-19T16:22:41.140" Title="CGCC Blog Post #5: How to get reputation quick" Tags="|discussion|reputation|cgcc-blog|" AnswerCount="0" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24786" PostTypeId="2" ParentId="2140" CreationDate="2022-05-19T20:04:48.140" Score="0" Body="&lt;h1&gt;Quickly approximate the square root of a float&lt;/h1&gt;&#xA;&lt;hr/&gt;&#xA;&lt;p&gt;As in like, constant-time and almost instant, but off by a lot. No time for looping here. This is going to take a lot of work, since I'm going to make an emulated CPU which will allow more precise timing.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-05-19T20:04:48.140" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24788" PostTypeId="2" ParentId="2140" CreationDate="2022-05-22T07:14:03.143" Score="2" Body="&lt;h1&gt;Generate Fibonacci Primes Quickly&lt;/h1&gt;&#xA;&lt;p&gt;Unsurprisingly, &lt;a href=&quot;https://en.wikipedia.org/wiki/Fibonacci_prime&quot; rel=&quot;nofollow noreferrer&quot;&gt;fibonacci primes&lt;/a&gt; are primes that are also Fibonacci numbers. There are currently 34 known Fibonacci primes and an additional 15 probable Fibonacci primes. For the purpose of this challenge, the Fibonacci numbers are the sequence &lt;span class=&quot;math-container&quot;&gt;\$F_n\$&lt;/span&gt; defined as &lt;span class=&quot;math-container&quot;&gt;\$F_1 = 1\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$F_2 = 1\$&lt;/span&gt;, and &lt;span class=&quot;math-container&quot;&gt;\$F_n = F_{n-1} + F_{n-2}\$&lt;/span&gt;, and a number is considered prime if it passes a probabilistic prime test with a probability of being incorrect of less than &lt;span class=&quot;math-container&quot;&gt;\$2^{-32}\$&lt;/span&gt;. For example, since a &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; round Miller-Rabin test has an error probability of &lt;span class=&quot;math-container&quot;&gt;\$4^{-k}\$&lt;/span&gt;, a 16 round Miller-Rabin test is sufficient to prove primality for the purpose of this challenge.&lt;/p&gt;&#xA;&lt;h2&gt;Submissions:&lt;/h2&gt;&#xA;&lt;p&gt;The goal of this challenge is to write a full program that calculates every Fibonacci prime and its index in the Fibonacci series as fast as possible.&lt;/p&gt;&#xA;&lt;p&gt;Submissions shall be a full program, complete with instructions for building and running it. Submissions must be in a language freely available for noncommercial use and capable of running on Windows 10, and users must be prepared to provide installation instructions for that language. External libraries are permitted, with the same caveats that apply to languages.&lt;/p&gt;&#xA;&lt;p&gt;Primes will be output by writing to stdout with a simple binary format, that has a little-endian byte order:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[8 bytes- index into the Fibonacci series]&#xA;[8 bytes- length of the Fibonacci prime, in bytes]&#xA;[? bytes- the Fibonacci prime, as a byte array]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;The programs will be run on an Intel(R) Core(TM) i5-8365U CPU with 8 threads, avx-2 support, and 24 Gigabytes of ram. The largest prime that can be correctly reached in one minute wins. Tiebreaker is the time taken to reach the largest value. Programs that tamper with my computer or the testing program will be disqualified. Programs that error or otherwise fail to produce the correct output will be judged based on the furthest Fibonacci prime reached before they failed.&lt;/p&gt;&#xA;&lt;p&gt;see also: &lt;a href=&quot;https://oeis.org/A005478&quot; rel=&quot;nofollow noreferrer&quot;&gt;A005478&lt;/a&gt;, &lt;a href=&quot;https://oeis.org/A001605&quot; rel=&quot;nofollow noreferrer&quot;&gt;A001605&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The test program can be found &lt;a href=&quot;https://github.com/Aiden2207/fibonacci_primes&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;. Additionally, there is an example program &lt;a href=&quot;https://github.com/Aiden2207/fibonacci_primes/tree/master/competitors/example&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;p&gt;The test program is now completed and posted, but I still have a little documentation to write. I chose the output format to be simple, and so that answers wouldn't have to worry about formatting integers quickly. Is there anything I need to improve clarity-wise?&lt;/p&gt;&#xA;&lt;p&gt;tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot;&gt;primes&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fibonnacci&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fibonnacci&amp;#39;&quot; rel=&quot;tag&quot;&gt;fibonnacci&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="97691" LastEditorUserId="97691" LastEditDate="2022-05-30T16:57:41.870" LastActivityDate="2022-05-30T16:57:41.870" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24789" PostTypeId="2" ParentId="2140" CreationDate="2022-05-22T07:38:11.383" Score="6" Body="&lt;h1&gt;ITEXTIN - Is This an EXTended Initialism?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; Please write a program or function that, when given a list of words and proposed extended initialism, outputs whether it is valid.&lt;/p&gt;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The list will contain at least two words.&lt;/li&gt;&#xA;&lt;li&gt;The extended initialism will contain at least three letters.&lt;/li&gt;&#xA;&lt;li&gt;Each word in the phrase contributes a prefix to the extended initialism.&lt;/li&gt;&#xA;&lt;li&gt;This prefix must not be the whole word.&lt;/li&gt;&#xA;&lt;li&gt;In the case of the first and last words, the prefix must not be empty.&lt;/li&gt;&#xA;&lt;li&gt;The extended initialism is the concatenation of these prefixes.&lt;/li&gt;&#xA;&lt;li&gt;Inputs are alphabetic only, your choice of upper or lower case.&lt;/li&gt;&#xA;&lt;li&gt;Separators, if you want them, are any symbol or white space.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Examples (truthy):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;laser=light amplification by the stimulated emission of radiation&#xA;radar=radio detection and ranging&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Examples (falsy):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;labyser=light amplification by the stimulated emission of radiation&#xA;radar=light amplification by the stimulated emission of radiation&#xA;dear=radio detection and ranging&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2022-05-28T16:17:23.260" LastActivityDate="2022-05-28T16:17:23.260" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="24790" PostTypeId="2" ParentId="2140" CreationDate="2022-05-22T14:57:39.163" Score="1" Body="&lt;h1&gt;Bold Words for Profit&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;The&lt;/strong&gt; &lt;strong&gt;cha&lt;/strong&gt;llenge &lt;strong&gt;is&lt;/strong&gt; &lt;strong&gt;si&lt;/strong&gt;mple. &lt;strong&gt;Gi&lt;/strong&gt;ven &lt;strong&gt;a&lt;/strong&gt; &lt;strong&gt;we&lt;/strong&gt;bpage &lt;strong&gt;in&lt;/strong&gt; &lt;strong&gt;h&lt;/strong&gt;tml, &lt;strong&gt;ma&lt;/strong&gt;ke &lt;strong&gt;the&lt;/strong&gt; &lt;strong&gt;fi&lt;/strong&gt;rst &lt;strong&gt;sy&lt;/strong&gt;llable &lt;strong&gt;of&lt;/strong&gt; &lt;strong&gt;ea&lt;/strong&gt;ch &lt;strong&gt;wo&lt;/strong&gt;rd &lt;strong&gt;bo&lt;/strong&gt;ld.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Example:&#xA;&#xA;&amp;lt;body&amp;gt;Accessibility is a right, not a paid service.&amp;lt;/body&amp;gt;&#xA;&#xA;--&amp;gt;&#xA;&#xA;&amp;lt;body&amp;gt;&amp;lt;b&amp;gt;A&amp;lt;/b&amp;gt;ccessibility &amp;lt;b&amp;gt;i&amp;lt;/b&amp;gt;s &amp;lt;b&amp;gt;a&amp;lt;/b&amp;gt; &amp;lt;b&amp;gt;ri&amp;lt;/b&amp;gt;ght, &#xA;&amp;lt;b&amp;gt;no&amp;lt;/b&amp;gt;t &amp;lt;b&amp;gt;a&amp;lt;/b&amp;gt; &amp;lt;b&amp;gt;pai&amp;lt;/b&amp;gt;d &amp;lt;b&amp;gt;se&amp;lt;/b&amp;gt;rvice.&amp;lt;/body&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;We&lt;/strong&gt; &lt;strong&gt;wi&lt;/strong&gt;ll &lt;strong&gt;u&lt;/strong&gt;se &lt;strong&gt;the&lt;/strong&gt; &lt;strong&gt;heu&lt;/strong&gt;ristic &lt;strong&gt;tha&lt;/strong&gt;t &lt;strong&gt;the&lt;/strong&gt; &lt;strong&gt;fi&lt;/strong&gt;rst &lt;strong&gt;sy&lt;/strong&gt;llable &lt;strong&gt;o&lt;/strong&gt;f &lt;strong&gt;a&lt;/strong&gt; &lt;strong&gt;wo&lt;/strong&gt;rd &lt;code&gt;w&lt;/code&gt; &lt;strong&gt;i&lt;/strong&gt;s &lt;strong&gt;the&lt;/strong&gt; &lt;strong&gt;pre&lt;/strong&gt;fix &lt;strong&gt;o&lt;/strong&gt;f &lt;code&gt;w&lt;/code&gt; &lt;strong&gt;tha&lt;/strong&gt;t &lt;strong&gt;goe&lt;/strong&gt;s &lt;strong&gt;u&lt;/strong&gt;p &lt;strong&gt;to&lt;/strong&gt; &lt;strong&gt;a&lt;/strong&gt;nd &lt;strong&gt;i&lt;/strong&gt;ncluding &lt;strong&gt;the&lt;/strong&gt; &lt;strong&gt;la&lt;/strong&gt;st &lt;strong&gt;vo&lt;/strong&gt;wel ([&lt;strong&gt;aeiouy&lt;/strong&gt;]). &lt;strong&gt;I&lt;/strong&gt;f &lt;strong&gt;the&lt;/strong&gt;re &lt;strong&gt;a&lt;/strong&gt;re &lt;strong&gt;no&lt;/strong&gt; &lt;strong&gt;vo&lt;/strong&gt;wels, &lt;strong&gt;bo&lt;/strong&gt;ld &lt;strong&gt;the&lt;/strong&gt; &lt;strong&gt;fi&lt;/strong&gt;rst &lt;strong&gt;le&lt;/strong&gt;tter ([&lt;strong&gt;a&lt;/strong&gt;-z]).&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Examples (first syllable):&#xA;&#xA;disability -&amp;gt; di&#xA;isnt -&amp;gt; is&#xA;for -&amp;gt; fo&#xA;profit -&amp;gt; pro&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;You&lt;/strong&gt; &lt;strong&gt;may&lt;/strong&gt; &lt;strong&gt;bo&lt;/strong&gt;ld &lt;strong&gt;te&lt;/strong&gt;xt &lt;strong&gt;i&lt;/strong&gt;n &lt;strong&gt;a&lt;/strong&gt;ny &lt;strong&gt;way&lt;/strong&gt; &lt;strong&gt;you&lt;/strong&gt; &lt;strong&gt;see&lt;/strong&gt; &lt;strong&gt;fi&lt;/strong&gt;t -- &lt;strong&gt;the&lt;/strong&gt; &lt;code&gt;&amp;lt;b&amp;gt;&lt;/code&gt; &lt;strong&gt;ta&lt;/strong&gt;g &lt;strong&gt;u&lt;/strong&gt;sed &lt;strong&gt;a&lt;/strong&gt;bove &lt;strong&gt;i&lt;/strong&gt;s &lt;strong&gt;ju&lt;/strong&gt;st &lt;strong&gt;fo&lt;/strong&gt;r &lt;strong&gt;e&lt;/strong&gt;xample. &lt;strong&gt;Whi&lt;/strong&gt;tespace &lt;strong&gt;i&lt;/strong&gt;n &lt;strong&gt;the&lt;/strong&gt; &lt;strong&gt;ou&lt;/strong&gt;tput &lt;strong&gt;H&lt;/strong&gt;TML &lt;strong&gt;nee&lt;/strong&gt;d &lt;strong&gt;no&lt;/strong&gt;t &lt;strong&gt;be&lt;/strong&gt; &lt;strong&gt;pre&lt;/strong&gt;served. &lt;strong&gt;Si&lt;/strong&gt;nce &lt;strong&gt;we&lt;/strong&gt; &lt;strong&gt;wa&lt;/strong&gt;nt &lt;strong&gt;to&lt;/strong&gt; &lt;strong&gt;ma&lt;/strong&gt;ke &lt;strong&gt;the&lt;/strong&gt; &lt;strong&gt;mo&lt;/strong&gt;st &lt;strong&gt;pro&lt;/strong&gt;fit &lt;strong&gt;o&lt;/strong&gt;ff &lt;strong&gt;o&lt;/strong&gt;f &lt;strong&gt;thi&lt;/strong&gt;s &lt;strong&gt;too&lt;/strong&gt;l &lt;strong&gt;a&lt;/strong&gt;s &lt;strong&gt;po&lt;/strong&gt;ssible, &lt;strong&gt;a&lt;/strong&gt;nd &lt;strong&gt;ea&lt;/strong&gt;ch &lt;strong&gt;cha&lt;/strong&gt;racter &lt;strong&gt;ty&lt;/strong&gt;ped &lt;strong&gt;i&lt;/strong&gt;s &lt;strong&gt;a&lt;/strong&gt; &lt;strong&gt;hu&lt;/strong&gt;ndred &lt;strong&gt;do&lt;/strong&gt;llars &lt;strong&gt;pai&lt;/strong&gt;d &lt;strong&gt;to&lt;/strong&gt; &lt;strong&gt;ou&lt;/strong&gt;r &lt;strong&gt;so&lt;/strong&gt;ftware &lt;strong&gt;de&lt;/strong&gt;velopers, &lt;strong&gt;the&lt;/strong&gt; &lt;strong&gt;co&lt;/strong&gt;de &lt;strong&gt;mu&lt;/strong&gt;st &lt;strong&gt;be&lt;/strong&gt; &lt;strong&gt;a&lt;/strong&gt;s &lt;strong&gt;sho&lt;/strong&gt;rt &lt;strong&gt;a&lt;/strong&gt;s &lt;strong&gt;po&lt;/strong&gt;ssible.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Ha&lt;/strong&gt;ppy &lt;strong&gt;go&lt;/strong&gt;lfing!&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://twitter.com/KaijuChomps/status/1528045570740428801?s=20&amp;amp;t=fSM1vqsG67-hAoVeWljn1A&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/yriKA.png&quot; alt=&quot;Bionic Reading&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="111564" LastEditorUserId="111564" LastEditDate="2022-05-22T15:05:24.827" LastActivityDate="2022-05-22T15:05:24.827" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24791" PostTypeId="1" CreationDate="2022-05-22T15:30:06.750" Score="19" ViewCount="215" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/24771/66833&quot;&gt;Voting has closed&lt;/a&gt;, and, with the votes being a dead tie, all three candidates have been elected as room owners for CGCC's main chat room, &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/users/497390&quot;&gt;&lt;img src=&quot;https://stackexchange.com/users/flair/20593077.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/users/354515&quot;&gt;&lt;img src=&quot;https://stackexchange.com/users/flair/12951433.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/users/475866&quot;&gt;&lt;img src=&quot;https://stackexchange.com/users/flair/19067022.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;They have been appointed, effective immediately. Please welcome them as our new room owners and join us in thanking them for volunteering.&lt;/p&gt;&#xA;&lt;p&gt;In the words of Dennis and hyper-neutrino, may the odds be ever in their favor.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-05-23T04:15:23.107" Title="Congratulations to the new TNB Room Owners!" Tags="|discussion|chat|moderation|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24792" PostTypeId="2" ParentId="2140" CreationDate="2022-05-22T22:46:51.493" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/247862/straighten-my-corners-diagonally&quot;&gt;Straighten my corners... diagonally&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-05-26T05:08:50.533" LastActivityDate="2022-05-26T05:08:50.533" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24793" PostTypeId="2" ParentId="24791" CreationDate="2022-05-23T00:20:14.877" Score="8" Body="&lt;p&gt;Haha italic names go brrr.&lt;/p&gt;&#xA;&lt;p&gt;But /srs very cool. Can't wait to do a good job of ROing TNB.&lt;/p&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="68942" LastEditDate="2022-05-23T04:15:23.107" LastActivityDate="2022-05-23T04:15:23.107" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24794" PostTypeId="2" ParentId="2140" CreationDate="2022-05-24T01:38:07.857" Score="8" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/247975/add-a-hidden-language-to-a-polyglot/247976#247976&quot;&gt;Add a hidden language to a polyglot&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-05-29T22:32:25.567" LastActivityDate="2022-05-29T22:32:25.567" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24795" PostTypeId="2" ParentId="2140" CreationDate="2022-05-25T18:19:15.593" Score="2" Body="&lt;h1&gt;Convert Klingon romanization to &lt;code&gt;pIqaD&lt;/code&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Context&lt;/h2&gt;&#xA;&lt;p&gt;Klingon is a constructed language from &lt;em&gt;Star Trek&lt;/em&gt;. It has two writing systems: a not-very-good Latin alphabet (with case distinctions, &lt;code&gt;I&lt;/code&gt; being different from &lt;code&gt;l&lt;/code&gt;, ...) and its own script, called &lt;code&gt;pIqaD&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Convert the bad&lt;sup&gt;&lt;em&gt;[disputed - discuss]&lt;/em&gt;&lt;/sup&gt; Klingon romanization into &lt;code&gt;pIqaD&lt;/code&gt;. Here's a CSV (the &lt;code&gt;pIqaD&lt;/code&gt; [or, if you don't have a font for it, boxes or nothing] is in the second column and the Unicode hexadecimal codes are in the third):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a,,f8d0&#xA;b,,f8d1&#xA;ch,,f8d2&#xA;D,,f8d3&#xA;e,,f8d4&#xA;gh,,f8d5&#xA;H,,f8d6&#xA;I,,f8d7&#xA;j,,f8d8&#xA;l,,f8d9&#xA;m,,f8da&#xA;n,,f8db&#xA;ng,,f8dc&#xA;o,,f8dd&#xA;p,,f8de&#xA;q,,f8df&#xA;Q,,f8e0&#xA;r,,f8e1&#xA;S,,f8e2&#xA;t,,f8e3&#xA;tlh,,f8e4&#xA;u,,f8e5&#xA;v,,f8e6&#xA;w,,f8e7&#xA;y,,f8e8&#xA;',,f8e9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Be careful not to mix up &lt;code&gt;q&lt;/code&gt; and &lt;code&gt;Q&lt;/code&gt;, they are different letters in Klingon!&lt;/p&gt;&#xA;&lt;h2&gt;Input and output&lt;/h2&gt;&#xA;&lt;p&gt;Strings! or your language's equivalent. You can assume that the input contains no characters not in Klingon (incl. miscapitalized &lt;code&gt;dhis&lt;/code&gt;) or numbers or punctuation.&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;Lowest byte count wins, as always.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;suggestions? :)&lt;/p&gt;&#xA;" OwnerUserId="92481" LastEditorUserId="92481" LastEditDate="2022-05-29T14:27:16.160" LastActivityDate="2022-05-29T14:27:16.160" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24796" PostTypeId="2" ParentId="24692" CreationDate="2022-05-26T17:43:25.117" Score="2" Body="&lt;p&gt;Thanks for reporting this issue! This is fixed now.&lt;/p&gt;&#xA;" OwnerUserId="112716" LastActivityDate="2022-05-26T17:43:25.117" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24798" PostTypeId="2" ParentId="2140" CreationDate="2022-05-27T19:56:08.070" Score="3" Body="&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-05-28T13:30:07.013" LastActivityDate="2022-05-28T13:30:07.013" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24799" PostTypeId="2" ParentId="2140" CreationDate="2022-05-28T17:46:52.757" Score="1" Body="&lt;h1&gt;Sell cinema tickets&lt;/h1&gt;&#xA;&lt;p&gt;Or in other words, print out a numbered grid from bottom-middle to top-middle.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Most people think that, in a cinema, the back seats and the middle ones are the best.&lt;br /&gt;&#xA;You'll be receiving the number of seats across and vertically in the theater, your job is to sell the tickets in prioritized order, starting from the best seats to the worst.&lt;br /&gt;&#xA;The seats will be numbered from top-left to bottom-right.&lt;/p&gt;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;In: 3, 4&#xA;&#xA;Seats:&#xA;1  2  3&#xA;4  5  6&#xA;7  8  9&#xA;10 11 12&#xA;&#xA;Out: 11, 12, 10, 8, 9, 7, 5, 6, 4, 2, 3, 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The order of the outer seats doesn't matter, as long as the distance to the middle seat in the row is the same.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Another Possible output: 11, 10, 12, 8, 7, 9, 5, 4, 6, 2, 1, 3&#xA;12: Priority 7&#xA;11: Priority 8&#xA;10: Priority 7&#xA;09: Priority 5&#xA;08: Priority 6&#xA;07: Priority 5&#xA;06: Priority 3&#xA;05: Priority 4&#xA;04: Priority 3&#xA;03: Priority 1&#xA;02: Priority 2&#xA;01: Priority 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The number of seats across and vertically (in any order) should be received as the input&lt;/li&gt;&#xA;&lt;li&gt;Output should be the seats numbered, sorted by their priority&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Default Loopholes&lt;/a&gt; apply&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="96037" LastActivityDate="2022-05-28T17:46:52.757" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24800" PostTypeId="2" ParentId="2140" CreationDate="2022-05-29T10:37:13.660" Score="6" Body="&lt;h1&gt;Scribble Pad for Nerds.&lt;/h1&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/248244/scribble-pad-for-nerds&quot;&gt;Posted Here&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96037" LastEditorUserId="96039" LastEditDate="2022-06-17T00:26:45.420" LastActivityDate="2022-06-17T00:26:45.420" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24801" PostTypeId="2" ParentId="2140" CreationDate="2022-05-29T23:13:27.130" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/248128/104836&quot;&gt;Extract the contained powers of two!&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="104836" LastEditorUserId="104836" LastEditDate="2022-06-03T00:04:22.693" LastActivityDate="2022-06-03T00:04:22.693" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24802" PostTypeId="2" ParentId="2140" CreationDate="2022-05-29T23:34:39.357" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/248047&quot;&gt;But is it a pretty place?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="104836" LastEditorUserId="97857" LastEditDate="2022-06-02T18:59:23.973" LastActivityDate="2022-06-02T18:59:23.973" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24803" PostTypeId="2" ParentId="2140" CreationDate="2022-05-30T00:49:43.863" Score="0" Body="&lt;h1&gt;Desmosian Music&lt;/h1&gt;&#xA;&lt;p&gt;Create a script that takes in &lt;code&gt;notes&lt;/code&gt; as &lt;code&gt;numbers&lt;/code&gt; and &lt;code&gt;note lengths&lt;/code&gt; as &lt;code&gt;decimals&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You do &lt;strong&gt;not&lt;/strong&gt; have to accept rest notes.&lt;/p&gt;&#xA;&lt;p&gt;For instance, when given &lt;code&gt;[[1,1],[2,2],[3,0.5]]&lt;/code&gt; you should return a desmos &lt;strong&gt;code&lt;/strong&gt; that plots:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;      -  &amp;lt;== 3&#xA;  ----   &amp;lt;== 2&#xA;--       &amp;lt;== 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In this case it can be:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;\left\{x&amp;gt;0:\left\{x&amp;lt;2:1,\left\{x&amp;lt;6:2,\left\{x&amp;lt;7:3\right\}\right\}\right\}\right\}&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Scale the note lengths to fit entirely inside the graph.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt; and I appreciate desmos answers.&lt;/p&gt;&#xA;" OwnerUserId="111945" LastEditorUserId="111945" LastEditDate="2022-05-30T01:23:30.467" LastActivityDate="2022-05-30T01:23:30.467" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24804" PostTypeId="2" ParentId="2140" CreationDate="2022-05-30T01:29:25.927" Score="0" Body="&lt;h1&gt;Can we do it with an 89?&lt;/h1&gt;&#xA;&lt;p&gt;This was originally meant to be a Puzzling Challenge:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Can we do it with an 89?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;code&gt;89&lt;/code&gt; is my favorite number. Your task is to make 1~100 using only &lt;strong&gt;one &lt;code&gt;89&lt;/code&gt;&lt;/strong&gt;. Operations allowed are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Factorial (&lt;code&gt;3! = 6&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Parenthesis (&lt;code&gt;(3!)! = 6! = 720&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Double Factorial (&lt;code&gt;4!! = 4*2 = 8&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Square Root (&lt;code&gt;sqrt(9) = 3&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Floor and Ceiling (&lt;code&gt;floor(3.5) = 3&lt;/code&gt; and &lt;code&gt;ceil(3.5)=4&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Negation (&lt;code&gt;-3 = well, -3, duh&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Note that &lt;code&gt;4!! = 4*2 and not (4!)!&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Your task is to output the equation given a number &lt;strong&gt;greater than 1&lt;/strong&gt; (no longer restricted to be less than 100), inclusive.&lt;/p&gt;&#xA;&lt;h1&gt;Meta:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Should this be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Or should we aim to end with the shortest equation?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Or should we aim for a shorter run time?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Could this be 3 challenges?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Or should I ask for code that outputs the shortest equation?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="111945" LastActivityDate="2022-05-30T01:29:25.927" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24806" PostTypeId="2" ParentId="2140" CreationDate="2022-05-30T01:42:22.343" Score="0" Body="&lt;h1&gt;Good Rectangles and Evil Numbers&lt;/h1&gt;&#xA;&lt;p&gt;This is meant to be a Puzzling Challenge:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Good Rectangles and Evil Numbers - Integrated&lt;/h1&gt;&#xA;&lt;p&gt;Original: &lt;a href=&quot;https://puzzling.stackexchange.com/questions/116168/good-rectangles-and-evil-numbers&quot;&gt;https://puzzling.stackexchange.com/questions/116168/good-rectangles-and-evil-numbers&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Good Rectangle&lt;/h2&gt;&#xA;&lt;p&gt;We define a &lt;em&gt;good rectangle&lt;/em&gt; with base &lt;span class=&quot;math-container&quot;&gt;\$ x \$&lt;/span&gt; as a rectangle in which &lt;span class=&quot;math-container&quot;&gt;\$ &#xA;                                                                         rac lw = x \$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$ l \$&lt;/span&gt; is the length of the rectangle and &lt;span class=&quot;math-container&quot;&gt;\$ w \$&lt;/span&gt; is the width of the rectangle.&lt;/p&gt;&#xA;&lt;h2&gt;Tiling&lt;/h2&gt;&#xA;&lt;p&gt;This is simply to &lt;strong&gt;clarify&lt;/strong&gt;. There should be no problem if you ignore this section, but I would like the question to be robust.&lt;/p&gt;&#xA;&lt;p&gt;We define a tiling of a group of shapes onto another shape as a way to place the group of shapes such that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The shapes do not overlap&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The group of shapes covers the entire target shape&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The target shape covers the entire group of shape&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;(The latter two combined is equivalent such that the union of all shapes in the group is congruent to the target shape)&lt;/p&gt;&#xA;&lt;h2&gt;Good Numbers&lt;/h2&gt;&#xA;&lt;p&gt;We define a positive integer as a &lt;em&gt;good number&lt;/em&gt; in base &lt;span class=&quot;math-container&quot;&gt;\$ x \$&lt;/span&gt; if it is possible to &lt;em&gt;tile&lt;/em&gt; that many &lt;em&gt;good rectangles&lt;/em&gt; of base &lt;span class=&quot;math-container&quot;&gt;\$ x \$&lt;/span&gt; (not necessarily of the same size) onto a square of any side length.&lt;/p&gt;&#xA;&lt;h2&gt;Evil Numbers&lt;/h2&gt;&#xA;&lt;p&gt;We define an &lt;em&gt;evil number&lt;/em&gt; as a positive integer that is not a &lt;em&gt;good number&lt;/em&gt; in that base.&lt;/p&gt;&#xA;&lt;p&gt;...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Your Task: Given a number as the base &lt;span class=&quot;math-container&quot;&gt;\$ x \$&lt;/span&gt; and a number as the number of rectangles &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt;, assuming that &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; is not an evil number in base &lt;span class=&quot;math-container&quot;&gt;\$ x \$&lt;/span&gt;, graphically output a tiling with &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; good rectangles in base &lt;span class=&quot;math-container&quot;&gt;\$ x \$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="111945" LastActivityDate="2022-05-30T01:42:22.343" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24807" PostTypeId="2" ParentId="2140" CreationDate="2022-05-30T01:47:00.083" Score="0" Body="&lt;pre&gt;&lt;code&gt;--\/--&#xA;--/\--&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Morse Tangles: ASCII Art&lt;/h1&gt;&#xA;&lt;p&gt;Given a word (with only letters, case insensitive), say &lt;code&gt;SOS&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Change the word into Morse code, in this case, &lt;code&gt;... --- ...&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Change dots to parallel bars and dashes to tangles.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Output the result as ASCII art:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;------  \/\/\/  ------&#xA;------  /\/\/\  ------&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that the spaces are two characters wide. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Morse Code Chart:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://cdn.shopify.com/s/files/1/2223/4507/files/morse-chart_grande.png?v=1501447409&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://cdn.shopify.com/s/files/1/2223/4507/files/morse-chart_grande.png?v=1501447409&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="111945" LastEditorUserId="111945" LastEditDate="2022-05-30T10:45:37.293" LastActivityDate="2022-05-30T10:45:37.293" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24808" PostTypeId="2" ParentId="2140" CreationDate="2022-05-30T02:02:59.893" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/248188/66833&quot;&gt;Two In One: Guess That Language - Cops&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/248189/66833&quot;&gt;Two In One: Guess That Language - Robbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="111945" LastEditorUserId="66833" LastEditDate="2022-06-04T02:47:10.133" LastActivityDate="2022-06-04T02:47:10.133" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24809" PostTypeId="2" ParentId="2140" CreationDate="2022-05-30T03:48:34.393" Score="0" Body="&lt;hr /&gt;&#xA;&lt;h1&gt;Tapes, Pointers, And sub-tapes: BrainFuck+&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;In this challenge we make an interpreter for a subset of BrainFuck+.&lt;/p&gt;&#xA;&lt;p&gt;As with BrainFuck we start with the tape &lt;code&gt;[0]&lt;/code&gt; and pointer at index &lt;code&gt;0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;BrainFuck+ Simplified: Commands&lt;/h2&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;+ and -&lt;/h3&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Update the current cell, as in BrainFuck.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;++&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;=&amp;gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[2]&#xA; ^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;--+--++&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;=&amp;gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[-1]&#xA;  ^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(There exists no wrap around)&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;&amp;lt; and &amp;gt;&lt;/h3&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Update the pointer, as in BrainFuck.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;gt;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;=&amp;gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[0,0]&#xA;   ^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;An attempt to go right at the rightmost point of a tape creates a cell with value &lt;code&gt;0&lt;/code&gt; at the right.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;++&amp;gt;+&amp;gt;++&amp;gt;-&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;=&amp;gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[2,1,2,-1]&#xA;        ^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;++&amp;lt;+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;=&amp;gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1,2]&#xA; ^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;An attempt to go left at the leftmost point of a tape creates a cell with value &lt;code&gt;0&lt;/code&gt; at the left.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;v and ^&lt;/h3&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;v&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;=&amp;gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[0]]&#xA;  ^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;An attempt to go down a numerical value overrides the cell with the empty subtape &lt;code&gt;[0]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;+&amp;lt;v+&amp;gt;-^&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;=&amp;gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[1,-1],1]&#xA;        ^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;^&lt;/code&gt; exits the subtape.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;v&amp;gt;^v&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;=&amp;gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[0,0]]&#xA;  ^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;An attempt to go down a subtape will enter the subtape at index &lt;code&gt;0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;=&amp;gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Program Termination&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;An attempt to exit the main tape terminates the program. Otherwise the program must run completely.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Revisiting + and -&lt;/h3&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;v^+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;=&amp;gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Program Termination&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;An attempt to increment or decrement a list will fail and terminate the program. However no error will be raised.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Other characters...&lt;/h3&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;...will not appear.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Your Task:&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Make a Simplified BrainFuck+ Interpreter. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;See above.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;" OwnerUserId="111945" LastEditorUserId="111945" LastEditDate="2022-05-30T06:40:06.737" LastActivityDate="2022-05-30T06:40:06.737" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24810" PostTypeId="5" CreationDate="2022-05-30T04:39:51.270" Score="0" Body="&lt;p&gt;This tag is used to indicate that your question is seeking help or clarification about something specific to this site, such as how to use a feature.&lt;/p&gt;&#xA;&lt;p&gt;Note that this is &lt;strong&gt;not&lt;/strong&gt; for questions that ask for support with code, or with challenges; questions asking for help with their code are off-topic here, and challenges should be posted to the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;Sandbox&lt;/a&gt; to gain support and feedback.&lt;/p&gt;&#xA;&lt;p&gt;Before posting your question, please check the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/tagged/faq&quot;&gt;FAQs&lt;/a&gt;, and do a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/search&quot;&gt;search&lt;/a&gt; to see if your problem already has a known solution or procedure. If you cannot find an answer, we will be happy to help you.&lt;/p&gt;&#xA;&lt;p&gt;This tag is one of the four required meta tags: all posts on meta must have at least one of &lt;a href=&quot;/questions/tagged/support&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot;&gt;support&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot;&gt;bug&lt;/a&gt;, &lt;a href=&quot;/questions/tagged/discussion&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;discussion&amp;#39;&quot; rel=&quot;tag&quot;&gt;discussion&lt;/a&gt; or &lt;a href=&quot;/questions/tagged/feature-request&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;feature-request&amp;#39;&quot; rel=&quot;tag&quot;&gt;feature-request&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="63502" LastEditorUserId="66833" LastEditDate="2022-05-30T04:48:07.800" LastActivityDate="2022-05-30T04:48:07.800" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24811" PostTypeId="4" CreationDate="2022-05-30T04:39:51.270" Score="0" Body="Indicates that the question is asking for clarification or help around a site feature, rule or custom, such as how something works, or why specific rules are in place." OwnerUserId="63502" LastEditorUserId="66833" LastEditDate="2022-05-30T04:43:58.490" LastActivityDate="2022-05-30T04:43:58.490" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24812" PostTypeId="2" ParentId="2140" CreationDate="2022-05-30T05:14:28.150" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/248070/66833&quot;&gt;`lol` is an ambigram, `dad` isn&amp;#39;t&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="111945" LastEditorUserId="66833" LastEditDate="2022-06-04T02:50:24.303" LastActivityDate="2022-06-04T02:50:24.303" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24814" PostTypeId="2" ParentId="2140" CreationDate="2022-05-31T07:01:32.250" Score="3" Body="&lt;h1&gt;Find the winning Mormon Bridge card&lt;/h1&gt;&#xA;&lt;p&gt;Mormon Bridge (also called Oh Heck, similar to Oh H***) is a card game played (at least by me) with a standard Rook deck. A standard Rook deck includes cards 1-14 in 4 suits, which are black, red, green, and yellow, and a Rook card. Each round, a card is taken from the deck. It's suit is chosen as &amp;quot;trump.&amp;quot; Then, players take turns playing cards. We'll call the suit of the first players card &amp;quot;sub-trump&amp;quot;. If the Rook card is played, it wins. If trump was played, the highest trump card wins. Otherwise, the highest sub-trump card wins.&lt;/p&gt;&#xA;&lt;h2&gt;Your Goal&lt;/h2&gt;&#xA;&lt;p&gt;Your goal is to take input for:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Trump&lt;/li&gt;&#xA;&lt;li&gt;Sub-trump&lt;/li&gt;&#xA;&lt;li&gt;Cards played&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;and output the winning card. You may take input in any reasonable manner, swapping suit colors for numbers is fine, as is taking input for all cards played in order instead of separating the first card. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;(note that input can be taken in any reasonable format, these are written in a human-readable format.)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Trump: Red&#xA;Cards played: Red 4, Rook, Black 14, Yellow 7&#xA;Output: Rook&#xA;&#xA;Trump: Green&#xA;Cards played: Red 14, Red 8, Green 2, Yellow 6&#xA;Output: Green 2&#xA;&#xA;Trump: Yellow&#xA;Cards played: Red 5, Green 7, Red 12, Black 6&#xA;Output: Red 12&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;p&gt;What tags should be on this? Are the rules clear enough?&lt;/p&gt;&#xA;" OwnerUserId="112719" LastEditorUserId="112719" LastEditDate="2022-06-07T23:15:48.177" LastActivityDate="2022-06-07T23:15:48.177" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24815" PostTypeId="2" ParentId="2140" CreationDate="2022-05-31T08:55:36.497" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/248143&quot;&gt;Count alternating permutations&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-06-03T05:34:27.117" LastActivityDate="2022-06-03T05:34:27.117" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24817" PostTypeId="1" CreationDate="2022-06-01T09:52:29.550" Score="9" ViewCount="504" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19271/reviving-language-of-the-month-pick-up-where-we-left-off-or-start-over&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout June 2022, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;J-uby&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;What's a Language of the Month?&lt;/h2&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19279/nominations-for-language-of-the-month-take-2?answertab=scoredesc#tab-top&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during June, those who wish to participate should learn (at least the basics of) J-uby, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about J-uby&lt;/h2&gt;&#xA;&lt;p&gt;J-uby is a superset of Ruby that attempts to tacitify ruby using its metaprogramming features, overloading existing operators as combinators and other neat little things.&lt;/p&gt;&#xA;&lt;p&gt;Cyoce, a fellow code golf user, made J-uby in 2017. Since then it has been largely unchanged and underused. There are many golfing tricks to be found, and many Ruby features to exploit.&lt;/p&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/cyoce/J-uby&quot; rel=&quot;nofollow noreferrer&quot;&gt;Repository&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/search?q=user%3A41042+J-uby&quot;&gt;Cyoce's answers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#j-uby&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it Online!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="80214" LastEditorUserId="78850" LastEditDate="2022-06-01T10:28:50.863" LastActivityDate="2022-06-04T19:21:03.257" Title="Language of the Month for June 2022: J-uby" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24818" PostTypeId="2" ParentId="24817" CreationDate="2022-06-01T09:53:10.660" Score="7" Body="&lt;h1&gt;List of all J-uby answers posted in June 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/248070/lol-is-a-palindrome-dad-isnt/248074#248074&quot;&gt;`lol` is an ambigram, `dad` isn&amp;#39;t&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/108879/badatgolf&quot;&gt;badatgolf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/247804/reverse-hex-cipher/248083#248083&quot;&gt;Reverse hex cipher&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/133109/sum-of-all-integers-from-1-to-n/248137#248137&quot;&gt;Sum of all integers from 1 to n&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/607/find-the-factorial/248140#248140&quot;&gt;Find the Factorial!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/138011/is-it-a-semiprime/248222#248222&quot;&gt;Is it a semiprime?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant tips posted in June 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;tip summary&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant challenges posted in June 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="80214" LastEditorUserId="92689" LastEditDate="2022-06-04T19:21:03.257" LastActivityDate="2022-06-04T19:21:03.257" CommentCount="0" CommunityOwnedDate="2022-06-02T04:57:02.210" ContentLicense="CC BY-SA 4.0" />
  <row Id="24820" PostTypeId="1" CreationDate="2022-06-02T01:39:43.253" Score="3" ViewCount="146" Body="&lt;p&gt;... &lt;strong&gt;what should we do?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;As we can see from this excerpt, BMG is slowly dying. People don't seem interested enough to even start it and the 21st BMG has little participants.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;(even though it hasn't happened in months lol)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;sup&gt;(&lt;a href=&quot;https://chat.stackexchange.com/transcript/message/61265742#61265742&quot;&gt;Source&lt;/a&gt;)&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;I see the following problems and solutions:&lt;/p&gt;&#xA;&lt;h3&gt;Problem: People don't notice BMG.&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Solution: Make BMG more often. However this might make the audience have less interest in them.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Solution: Make a room for it. However, &amp;quot;there doesn't need a million rooms for everything&amp;quot; and this makes things more complicated.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Problem: People don't like BMG.&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Solution: Make BMG less often. This might make the audience have more interest in them.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Solution: Change BMG into something else. For instance, LYAL, or simply discard it. However CMCs probably seems interesting to many people like me and BMGs encourage CMCs.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;What do you think?&lt;/h2&gt;&#xA;" OwnerUserId="111945" LastEditorUserId="66833" LastEditDate="2022-06-02T02:00:56.207" LastActivityDate="2022-06-02T02:02:57.227" Title="Biweekly Mini Golf is Half Dead" Tags="|discussion|chat|chat-events|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24821" PostTypeId="2" ParentId="24820" CreationDate="2022-06-02T01:59:36.493" Score="12" Body="&lt;h2&gt;Let it die&lt;/h2&gt;&#xA;&lt;p&gt;BMG was &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/22276/66833&quot;&gt;first started over a year ago&lt;/a&gt;, was popular, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/23750/66833&quot;&gt;had a bit of a slump&lt;/a&gt; after a couple of months, and, over the last 10 months has slowly died. And, &lt;em&gt;that's okay&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If people aren't engaging with an event anymore, the proper thing to do is let it die. It was fun when it started, and that's great, but there's nothing wrong with saying &amp;quot;Well, the fun's over. What else should we do?&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;Which brings me to the follow-up: if BMG is left to die, now what? Well, the obvious answer is: find another chat event to try! If you have an idea for an event, ask in chat if people would be interested, and, if there's support, post a proposal on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/tagged/chat-events&quot;&gt;Meta&lt;/a&gt; detailing the event.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-06-02T01:59:36.493" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24823" PostTypeId="2" ParentId="19279" CreationDate="2022-06-02T02:30:57.590" Score="-4" Body="&lt;h1&gt;&lt;a href=&quot;https://esolangs.org/wiki/MarioLANG&quot; rel=&quot;nofollow noreferrer&quot;&gt;MarioLANG&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;MarioLANG&lt;/strong&gt; is a two-dimensionalesoteric programming languagemade byUser:Wh1teWolf, based on Super Mario. The source code's layout is similar to a Super Mario world, however the programs written in MarioLANG look like a completely normal application when compiled. It is evenTuring-complete! This language was inspired byRubE On Conveyor Belts.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;Pro&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It looks funny. LOL.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;It is easy to learn as an 2D language.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Not much people use it, much less in code-golfing.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There are plenty of resources.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Cons&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Does not currently have a chatroom, and I don't believe there are enough people to warrant one.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;There is no official interpreter for MarioLANG and neither is a detailed specification on the exact behavior of items and instructions.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;Resources&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://esolangs.org/wiki/MarioLANG&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolangs.org&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#mariolang&quot; rel=&quot;nofollow noreferrer&quot;&gt;Online Interpreter on TIO&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="111945" LastActivityDate="2022-06-02T02:30:57.590" CommentCount="0" CommunityOwnedDate="2022-06-02T02:30:57.590" ContentLicense="CC BY-SA 4.0" />
  <row Id="24824" PostTypeId="2" ParentId="2140" CreationDate="2022-06-02T14:50:19.547" Score="3" Body="&lt;h1&gt;Tell me how many there are, in Polish&lt;/h1&gt;&#xA;&lt;p&gt;Today, you're going to be writing Polish. No, not Polish notation—&lt;em&gt;Polish&lt;/em&gt;, the actual language spoken in Poland.&lt;/p&gt;&#xA;&lt;p&gt;Given a number and a noun, output a Polish sentence telling me that there are that many of that thing, using the appropriate template below.&lt;/p&gt;&#xA;&lt;p&gt;The input consists of an integer in the range from 0 to 200, and a string of 1 to 10 lowercase ASCII letters (called the &amp;quot;noun&amp;quot;). You may accept these inputs in any reasonable format.&lt;/p&gt;&#xA;&lt;p&gt;The output must consist of one of the below output templates, where the number in the template (if any) has been replaced with the input integer, and the word &lt;code&gt;kot&lt;/code&gt; in the template has been replaced with the input noun.&lt;/p&gt;&#xA;&lt;h2&gt;Output templates&lt;/h2&gt;&#xA;&lt;p&gt;If the input number is 0, then use the output template&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Nie ma żadnych kotów.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If the input number is 1, then use the output template&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Jest 1 kot.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If the input number ends with 2, 3, or 4, but does &lt;strong&gt;not&lt;/strong&gt; end with 12, 13, or 14, then use the output template&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Są 4 koty.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In any other case, use the output template&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Jest 8 kotów.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that the special characters used in these templates are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;ż (in &amp;quot;żadnych&amp;quot;) – U+017C Latin small letter Z with dot above&lt;/li&gt;&#xA;&lt;li&gt;ó (in the suffix &amp;quot;-ów&amp;quot;) – U+00F3 Latin small letter O with acute&lt;/li&gt;&#xA;&lt;li&gt;ą (in &amp;quot;Są&amp;quot;) – U+0105 Latin small letter A with ogonek&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may output these characters in any reasonably common character encoding (including HTML entities), and you may use combining characters instead of precomposed characters (or even a mixture of the two).&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 pomidor -&amp;gt; Nie ma żadnych pomidorów.&#xA;1 kwiat -&amp;gt; Jest 1 kwiat.&#xA;2 dom -&amp;gt; Są 2 domy.&#xA;5 wilk -&amp;gt; Jest 5 wilków.&#xA;13 komputer -&amp;gt; Jest 13 komputerów.&#xA;24 but -&amp;gt; Są 24 buty.&#xA;101 kurczak -&amp;gt; Jest 101 kurczaków.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Do plurals in Polish really work that way?&lt;/h2&gt;&#xA;&lt;p&gt;No, the way it actually works is much more complicated.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest program in each language wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="11067" LastActivityDate="2022-06-02T14:50:19.547" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24825" PostTypeId="2" ParentId="19279" CreationDate="2022-06-02T14:59:42.140" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/UCBLogo&quot; rel=&quot;nofollow noreferrer&quot;&gt;UCBLogo&lt;/a&gt;&lt;sup&gt;1&lt;/sup&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;Description&lt;/h2&gt;&#xA;&lt;p&gt;UCBLogo is a general-purpose, educational programming language, a dialect of &lt;a href=&quot;https://en.wikipedia.org/wiki/Logo_(programming_language)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Logo&lt;/a&gt; which derived from &lt;a href=&quot;https://en.wikipedia.org/wiki/Lisp_(programming_language)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Lisp&lt;/a&gt;. It utilizes &lt;a href=&quot;https://en.wikipedia.org/wiki/Turtle_graphics&quot; rel=&quot;nofollow noreferrer&quot;&gt;Turtle Graphics&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Reasons why&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Because it is an educational programming language, it is very simple to pick up and use.&lt;/li&gt;&#xA;&lt;li&gt;It has great potential for creating graphics in relatively few bytes compared to other languages.&lt;/li&gt;&#xA;&lt;li&gt;UCBLogo can handle lists, files, input/output (I/O), and recursion pretty well, unlike other dialects.&lt;/li&gt;&#xA;&lt;li&gt;The language is very stable.&lt;/li&gt;&#xA;&lt;li&gt;Very few people (if anybody) are using UCBLogo or Logo in general.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Reasons why not&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It doesn't have an online interpreter.&lt;sup&gt;2&lt;/sup&gt;&lt;/li&gt;&#xA;&lt;li&gt;Due to its simple nature, trying to out-golf somebody is hard.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Interpreter&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19279/nominations-for-language-of-the-month-take-2/24825#comment77513_24825&quot;&gt;pointed out&lt;/a&gt; that the &lt;a href=&quot;https://github.com/jrincayc/ucblogo-code/releases&quot; rel=&quot;nofollow noreferrer&quot;&gt;releases&lt;/a&gt; contain binaries for Linux, Mac, and Windows, for those who don't want to build from source.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If you want to build from source, &lt;a href=&quot;https://github.com/jrincayc/ucblogo-code&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Resource&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; question was posted &lt;a href=&quot;https://codegolf.stackexchange.com/q/118061/108879&quot;&gt;here&lt;/a&gt;. (The answers are mostly for LibreLogo, but it can be useful)&lt;/li&gt;&#xA;&lt;li&gt;Lecturer &lt;a href=&quot;https://en.wikipedia.org/wiki/Brian_Harvey_(lecturer)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Brian Harvey&lt;/a&gt; uses it to teach most computer science concepts, leading him to publish &lt;em&gt;Computer Science Logo Style&lt;/em&gt; trilogy which comes in 3 volumes (&lt;a href=&quot;https://people.eecs.berkeley.edu/%7Ebh/v1-toc2.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Symbolic Computing&lt;/a&gt;, &lt;a href=&quot;https://people.eecs.berkeley.edu/%7Ebh/v2-toc2.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Advanced Techniques&lt;/a&gt; and &lt;a href=&quot;https://people.eecs.berkeley.edu/%7Ebh/v3-toc2.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Beyond Programming&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Notes:&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;[1]:&lt;/strong&gt; UCBLogo is just one dialect of Logo, and I picked it for various reasons. If this won't work, we can use &lt;a href=&quot;https://en.wikipedia.org/wiki/Logo_(programming_language)#Implementations&quot; rel=&quot;nofollow noreferrer&quot;&gt;other dialects&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;[2]:&lt;/strong&gt; To fix part of the &amp;quot;no online interpreter&amp;quot; problem, I suggest that we add UCBLogo to TIO, but exclude all drawing commands (&lt;code&gt;fd&lt;/code&gt;, &lt;code&gt;lt&lt;/code&gt;, &lt;code&gt;rt&lt;/code&gt;, &lt;code&gt;bk&lt;/code&gt;, &lt;code&gt;penup&lt;/code&gt;, &lt;code&gt;pendown&lt;/code&gt;, &lt;code&gt;fill&lt;/code&gt;, etc.)&lt;/p&gt;&#xA;" OwnerUserId="108879" LastEditorUserId="108879" LastEditDate="2023-01-20T14:13:02.747" LastActivityDate="2023-01-20T14:13:02.747" CommentCount="1" CommunityOwnedDate="2022-06-02T14:59:42.140" ContentLicense="CC BY-SA 4.0" />
  <row Id="24826" PostTypeId="1" CreationDate="2022-06-02T17:36:53.467" Score="16" ViewCount="208" Body="&lt;p&gt;With the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24821/107299&quot;&gt;demise&lt;/a&gt; of BMG, I had an idea for a new chat event. For now, I'm calling it &amp;quot;Make You a Lang for Great Good&amp;quot;, but that is beside the point. This event would focus on one of the largest aspects of the CGCC: language creation. Recently, there has been an influx of new languages being created, from rSN to flax to Vyxal 3 to Wellscripted. This chat event would encourage the creation and development of home-made languages. The developers will get to show off the features of the language, the other people can play around with it, and ideas can be spread. This might even accelerate the development of the first 4th generation golfing language. I have &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/61274007#61274007&quot;&gt;proposed&lt;/a&gt; this on chat, and got no negative comments, so here goes...&lt;/p&gt;&#xA;" OwnerUserId="107299" LastEditorUserId="107299" LastEditDate="2022-06-07T15:20:21.203" LastActivityDate="2022-06-07T15:20:21.203" Title="Chat Event Proposal: Make You a Lang for Great Good" Tags="|discussion|chat|chat-events|" AnswerCount="1" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="24828" PostTypeId="2" ParentId="2140" CreationDate="2022-06-03T05:21:41.623" Score="0" Body="&lt;p&gt;&lt;strong&gt;Extracting &lt;code&gt;n&lt;/code&gt;th character of FizzBuzz&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I was inspired by the challenge to output FizzBuzz as fast as possible. I have written and optimized some code to the degree that it computed the &lt;code&gt;10^1000000&lt;/code&gt;th character of FizzBuzz within 5 minutes (it's &lt;code&gt;&amp;quot;7&amp;quot;&lt;/code&gt;). (Not the 10^1000000th line, this is the 10^1000000th &lt;strong&gt;character&lt;/strong&gt;, and I don't mean 1000000, I really mean 10^1000000). See &lt;a href=&quot;https://github.com/leijurv/reverse-fizzbuzz/&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;. I'm not sure how the challenge would work, perhaps it could be &amp;quot;how fast can you extract the &lt;code&gt;n&lt;/code&gt;th digit of FizzBuzz, where &lt;code&gt;n&lt;/code&gt; is a random number with a million digits&amp;quot;? Or perhaps a simple king of the hill for &amp;quot;what's the furthest power of ten index you can compute&amp;quot;? I wonder if someone can up that to &lt;code&gt;10^10000000&lt;/code&gt;?&lt;/p&gt;&#xA;" OwnerUserId="112856" LastActivityDate="2022-06-03T05:21:41.623" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24829" PostTypeId="2" ParentId="2140" CreationDate="2022-06-03T09:17:35.903" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/248186/108879&quot;&gt;Fill the rectangle&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108879" LastEditorUserId="108879" LastEditDate="2022-06-04T00:28:12.833" LastActivityDate="2022-06-04T00:28:12.833" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24830" PostTypeId="2" ParentId="24826" CreationDate="2022-06-03T12:16:22.050" Score="14" Body="&lt;h1&gt;Hell yes&lt;/h1&gt;&#xA;&lt;p&gt;If there's one thing I've noticed is hard to do well, it's asking other people for feedback on things like golfing language built-ins, syntax choices and language construction. Most times, messages requesting feedback just fall to the wayside, drowned out by either a) other conversations, or b) a lack of interest.&lt;/p&gt;&#xA;&lt;p&gt;This event has the chance to help language developers get the help they need, as well as create community initiatives so that we as a generation of code golfers can come together and do cool stuff that future users will see and say &amp;quot;wow that's cool!&amp;quot;. Ideally, MYAL would also accustom people to giving language design feedback outside of the event, eventually making the meta-game of code golf a prominent feature of site culture once again.&lt;/p&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2022-06-03T12:16:22.050" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24831" PostTypeId="2" ParentId="2140" CreationDate="2022-06-03T14:19:43.030" Score="2" Body="&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-06-06T13:18:16.247" LastActivityDate="2022-06-06T13:18:16.247" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24832" PostTypeId="2" ParentId="2140" CreationDate="2022-06-03T23:56:06.230" Score="7" Body="&lt;h1&gt;Race some Robots&lt;/h1&gt;&#xA;&lt;p&gt;&lt;sub&gt;Based on &lt;a href=&quot;https://boardgamegeek.com/boardgame/18/roborally&quot; rel=&quot;nofollow noreferrer&quot;&gt;RoboRally&lt;/a&gt;, but uses some different/simplified rules&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this KoTH, you will be coding a Python bot that attempts to race around a factory, reaching two specific places before the other bots, who are doing the same thing.  The way you'll reach these places - the &amp;quot;checkpoints&amp;quot; - is by sending instructions to the bot, telling it where to move.&lt;/p&gt;&#xA;&lt;h2&gt;The Factory&lt;/h2&gt;&#xA;&lt;p&gt;The factory is represented by a &lt;span class=&quot;math-container&quot;&gt;\$13 \times 10\$&lt;/span&gt; 2D list, where each cell has a different component, each represented by a 2 character long string. The factory will be constant for the KoTH, and is the following 2D list (coordinates are shown around for reference):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    0     1     2     3     4     5     6     7     8     9    10    11    12&#xA;0 [['  ', '  ', '&amp;gt; ', '  ', 'vv', 'C2', '  ', '  ', '  ', '  ', '^^', '  ', ' ' ],&#xA;1  ['  ', '  ', '  ', '  ', 'vv', '  ', 'lv', '&amp;lt; ', 'l&amp;lt;', '  ', 'R^', '&amp;lt;&amp;lt;', '&amp;lt;&amp;lt;'],&#xA;2  ['  ', '  ', '  ', '&amp;lt;&amp;lt;', 'R&amp;lt;', '  ', 'v ', '  ', '^ ', '  ', '  ', '  ', '*v'],&#xA;3  ['  ', '  ', '  ', '  ', '  ', 'lv', 'r&amp;lt;', '  ', 'r^', '&amp;lt; ', '&amp;lt; ', 'l&amp;lt;', '  '],&#xA;4  ['PA', '  ', '  ', '  ', 'lv', 'r&amp;lt;', '  ', '  ', '  ', '  ', '  ', '^ ', '  '],&#xA;5  ['  ', '  ', '  ', '  ', 'v ', '  ', '  ', '  ', '  ', '  ', 'r&amp;gt;', 'l^', '  '],&#xA;6  ['  ', '  ', '  ', '  ', 'l&amp;gt;', '&amp;gt; ', '&amp;gt; ', 'rv', '  ', 'r&amp;gt;', 'l^', '  ', '  '],&#xA;7  ['  ', '  ', '  ', '  ', '  ', '  ', '  ', 'v ', '  ', '^ ', '  ', 'R&amp;gt;', '&amp;gt;&amp;gt;'],&#xA;8  ['  ', '  ', '  ', '&amp;gt;&amp;gt;', '&amp;gt;&amp;gt;', 'Rv', '  ', 'l&amp;gt;', '&amp;gt; ', 'r^', '  ', '^^', '  '],&#xA;9  ['  ', '  ', '&amp;gt; ', '  ', '  ', 'vv', '  ', '  ', '  ', '  ', 'C1', '^^', '  ']]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We will use compass directions in the explanations to refer to the direction a bot is facing, with &amp;quot;North&amp;quot; being the top of the factory (so &lt;span class=&quot;math-container&quot;&gt;\$(0, 0)\$&lt;/span&gt; is the North-West corner).&lt;/p&gt;&#xA;&lt;p&gt;This is fairly complicated, so we'll go over what each string means:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;  &lt;/code&gt;: This is just a blank square. Nothing special happens.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;C1&lt;/code&gt;/&lt;code&gt;C2&lt;/code&gt;: Checkpoints 1 and 2. You must visit Checkpoint 1 first, then Checkpoint 2. The first bot to do both wins.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;&amp;gt; &lt;/code&gt;/&lt;code&gt;&amp;lt; &lt;/code&gt;/&lt;code&gt;v &lt;/code&gt;/&lt;code&gt;^ &lt;/code&gt;: These are conveyer belts. At the end of each &amp;quot;register&amp;quot; (explained below), they move any robot on them one square in the corresponding direction.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For example, if a bot is on &lt;span class=&quot;math-container&quot;&gt;\$(5, 6)\$&lt;/span&gt; at the end of a register, it is moved to &lt;span class=&quot;math-container&quot;&gt;\$(6, 6)\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;r&amp;gt;&lt;/code&gt;/&lt;code&gt;r&amp;lt;&lt;/code&gt;/&lt;code&gt;rv&lt;/code&gt;/&lt;code&gt;r^&lt;/code&gt;/&lt;code&gt;l&amp;gt;&lt;/code&gt;/&lt;code&gt;l&amp;lt;&lt;/code&gt;/&lt;code&gt;lv&lt;/code&gt;/&lt;code&gt;l^&lt;/code&gt;: These are corner conveyer belts. If pushed onto these squares by a conveyer belt, the bot is rotated 90 degrees clockwise (&lt;code&gt;rX&lt;/code&gt;) or counter clockwise (&lt;code&gt;lX&lt;/code&gt;). At the end of each register, any bot on them (not bots that were just moved onto them) is moved one square in the corresponding direction.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For example, if a bot is moved from &lt;span class=&quot;math-container&quot;&gt;\$(6, 6)\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$(7, 6)\$&lt;/span&gt; while facing North, it is rotated 90&lt;span class=&quot;math-container&quot;&gt;\${}^\circ\$&lt;/span&gt; clockwise and now faces East.&lt;/li&gt;&#xA;&lt;li&gt;If this same bot then doesn't move during the next register, then it is pushed South to &lt;span class=&quot;math-container&quot;&gt;\$(7, 7)\$&lt;/span&gt;, facing East.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;&amp;gt;&amp;gt;&lt;/code&gt;/&lt;code&gt;&amp;lt;&amp;lt;&lt;/code&gt;/&lt;code&gt;vv&lt;/code&gt;/&lt;code&gt;^^&lt;/code&gt;: These are double conveyer belts. If a bot is on one of these at the end of a register, it is moved once in the corresponding direction, and the conveyer square it lands on then moves it a second time&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;R&amp;gt;&lt;/code&gt;/&lt;code&gt;R&amp;lt;&lt;/code&gt;/&lt;code&gt;Rv&lt;/code&gt;/&lt;code&gt;R^&lt;/code&gt;: These are corner double conveyer belts, specifically right turn corners. As with normal right corner conveyer belts, they rotate a bot 90&lt;span class=&quot;math-container&quot;&gt;\${}^\circ\$&lt;/span&gt; clockwise when pushed on to, but they then immediately move the bot in the corresponding direction.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For example, a bot facing South who ends a register on &lt;span class=&quot;math-container&quot;&gt;\$(11, 1)\$&lt;/span&gt; would be pushed once to &lt;span class=&quot;math-container&quot;&gt;\$(10, 1)\$&lt;/span&gt;, rotated to face West, then pushed to &lt;span class=&quot;math-container&quot;&gt;\$(10, 0)\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;*v&lt;/code&gt;: This is the Reboot square. If a bot moves off the board, it is &amp;quot;rebooted&amp;quot;: it receives 2 Spam cards, is placed on this square and all remaining instructions are ignored for this round. The bot is now facing South, and, if another bot is rebooted while a bot is on this square, the first bot is pushed one square to the South.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;PA&lt;/code&gt;: This is the Priority Antenna. It cannot be moved, you cannot move into the square, and is used to determine who acts first each round.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Gameplay&lt;/h2&gt;&#xA;&lt;p&gt;Gameplay is very simple. The game is broken into rounds, and one round is structured as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;First, play order is determined. Bots act in inverse order to their &lt;a href=&quot;https://en.wikipedia.org/wiki/Taxicab_geometry&quot; rel=&quot;nofollow noreferrer&quot;&gt;Manhattan distance&lt;/a&gt; to the Priority Antenna, with ties broken by the bot with the most &amp;quot;horizontal&amp;quot; (East-West) distance going first.&lt;/li&gt;&#xA;&lt;li&gt;Then, each bot is dealt 9 &amp;quot;programming cards&amp;quot; from their hand (initially 20, but it can grow). Each &amp;quot;programming card&amp;quot; contains a single instruction for the bot (e.g. Move 1, Left Turn, etc.). The bots then simultaneously&lt;sup&gt;*&lt;/sup&gt; each choose 5 cards, discard the other 4, and order the 5 chosen from 1st to 5th.&lt;/li&gt;&#xA;&lt;li&gt;There are now 5 &lt;em&gt;registers&lt;/em&gt;, one for each chosen card. A register proceeds as follows:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The card for each robot for that register is revealed, and the instructions are executed in play order.&lt;/li&gt;&#xA;&lt;li&gt;Once all instructions are resolved, the conveyer belts all activate, potentially moving any bots.&lt;/li&gt;&#xA;&lt;li&gt;Then, each bot fires a laser, in a straight line in front of it, until it either hits another bot, a wall, the Priority Antenna or misses all other bots.&lt;/li&gt;&#xA;&lt;li&gt;If a bot is hit by a laser, it receives a Spam instruction, which is added to its &amp;quot;programming cards&amp;quot;.&lt;/li&gt;&#xA;&lt;li&gt;If a bot is on Checkpoint 1, it is now able to visit Checkpoint 2 to win. If it is on Checkpoint 2, it wins.&lt;/li&gt;&#xA;&lt;li&gt;The next register begins, and the process is repeated.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;After all 5 registers are completed, and everything is resolved, each deck of programming cards are reshuffled with all programming cards, and the next round begins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If a bot moves into the same square as another bot, that bot is pushed back one square in the direction the first bot is moving. For example, if Bot 1, facing East, moves from &lt;span class=&quot;math-container&quot;&gt;\$(7, 4)\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$(8, 4)\$&lt;/span&gt;, and Bot 2 is already in &lt;span class=&quot;math-container&quot;&gt;\$(8, 4)\$&lt;/span&gt;, then Bot 2 is pushed to &lt;span class=&quot;math-container&quot;&gt;\$(9, 4)\$&lt;/span&gt;. Note that, if pushing a bot would push it into the space of another bot, both are pushed.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;*&lt;/sup&gt;: For the purposes of the KoTH, each bot will be given their cards, and will return their chosen instructions in some arbitrary order.&lt;/p&gt;&#xA;&lt;h2&gt;Programming Cards&lt;/h2&gt;&#xA;&lt;p&gt;Each bot has a deck of programming cards, initially 20. The decks are all identical, and consist of:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;3 Move 1 cards: the bot moves forward one square&lt;/li&gt;&#xA;&lt;li&gt;2 Move 2 cards: the bot moves forward exactly two squares&lt;/li&gt;&#xA;&lt;li&gt;2 Move 3 card: the bot moves forward exactly three squares&lt;/li&gt;&#xA;&lt;li&gt;3 Right Turn cards: the bot stays in place, and rotates 90 degrees clockwise&lt;/li&gt;&#xA;&lt;li&gt;3 Left Turn cards: the bot stays in place, and rotates 90 degrees counter clockwise&lt;/li&gt;&#xA;&lt;li&gt;3 U-Turn cards: the bot stays in place and rotates 180 degrees&lt;/li&gt;&#xA;&lt;li&gt;2 Move Back cards: the bot moves moves backwards one square, without rotating&lt;/li&gt;&#xA;&lt;li&gt;2 Again cards: the bot repeats the previous instruction&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Note that these don't &amp;quot;stack&amp;quot;: playing an instruction, followed by 2 Agains does the instruction a total of 3 times, not 4&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Additionally, bots can increase the number of cards in their deck by taking damage from lasers, or by rebooting. In this case, they receive Spam cards, which are added to their deck:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Spam cards: a random card from the bot's programming deck is chosen, and that is the instruction carried out this register. At the end of the round, the Spam card is removed from your programming deck.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Note that this &lt;em&gt;does&lt;/em&gt; stack: if the drawn card is a Spam card, you repeat until a non-Spam card is drawn. All drawn Spam cards are removed from your deck.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Starting positions&lt;/h2&gt;&#xA;&lt;p&gt;Finally, we come to the start. At the very beginning of the game, the 6 players are placed on the 6 starting positions, in a random order. The positions are &lt;span class=&quot;math-container&quot;&gt;\$(1, 1)\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$(0, 3)\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$(1, 4)\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$(1, 5)\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$(0, 6)\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$(1, 8)\$&lt;/span&gt;. Each bot may choose which direction they begin facing.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;You are to write a function in Python 3 that takes the following arguments:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;round&lt;/code&gt;: an integer, beginning at &lt;code&gt;0&lt;/code&gt;, counting what round the game is on&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;order&lt;/code&gt;: an integer from &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;6&lt;/code&gt;, indicating the bot's order of play, with &lt;code&gt;1&lt;/code&gt; being first and &lt;code&gt;6&lt;/code&gt; being last&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;position&lt;/code&gt;: a 3-tuple &lt;code&gt;(x, y, d)&lt;/code&gt; consisting of your zero-indexed coordinates in the factory, and a character, one of &lt;code&gt;NESW&lt;/code&gt;, indicating the direction you're facing&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;score&lt;/code&gt;: a boolean, indicating whether you have landed on Checkpoint 1 yet.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cards&lt;/code&gt;: a list of 9 two character strings, indicating the cards you've been dealt&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;M1&lt;/code&gt;/&lt;code&gt;M2&lt;/code&gt;/&lt;code&gt;M3&lt;/code&gt;/&lt;code&gt;MB&lt;/code&gt; indicate Move 1, 2, 3 and Back respectively&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;RT&lt;/code&gt;/&lt;code&gt;LT&lt;/code&gt;/&lt;code&gt;UT&lt;/code&gt; are Right, Left and U-Turn&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Ag&lt;/code&gt;/&lt;code&gt;Sp&lt;/code&gt; are Again and Spam&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;bots&lt;/code&gt;: a list of 3-tuples &lt;code&gt;(x, y, d)&lt;/code&gt; of the coords and directions of all other bots&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;factory&lt;/code&gt;: the factory matrix above.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;It should then return the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;code&gt;round&lt;/code&gt; is &lt;code&gt;0&lt;/code&gt;, it should return one of &lt;code&gt;N&lt;/code&gt;/&lt;code&gt;E&lt;/code&gt;/&lt;code&gt;S&lt;/code&gt;/&lt;code&gt;W&lt;/code&gt; to indicate its starting direction&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, it should return a list of up to 5 of the strings from &lt;code&gt;cards&lt;/code&gt;, indicating its registers. Note that the first element of this list will be the first register, the second the second and so on. If you return fewer than 5 strings, the list will be filled with randomly drawn cards from your programming deck that weren't in &lt;code&gt;cards&lt;/code&gt; until there are 5 elements.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Once the first bot finishes a register on Checkpoint 2, after its &lt;code&gt;score&lt;/code&gt; is &lt;code&gt;True&lt;/code&gt;, the game is finished, and the winner receives 1 point.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Every combination of 6 bots will play 3 games together. The winner of a game receives 1 point, and the bot with the most number of points after all the games wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Example Bots&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;Sandbox note: once I've written the controller, I'll add in a couple basic example bots&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h3&gt;&lt;code&gt;random_bot&lt;/code&gt;&lt;/h3&gt;&#xA;&lt;p&gt;A completely random bot, it shuffles the cards dealt and returns the first 5:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;import random&#xA;&#xA;def random_bot(round, order, position, score, cards, bots, factory):&#xA;&amp;#9;if round == 0:&#xA;&amp;#9;&amp;#9;return random.choice('NESW')&#xA;&#xA;&amp;#9;random.shuffle(cards)&#xA;&amp;#9;while cards[0] == 'Ag': random.shuffle(cards)&#xA;&amp;#9;return cards[:5]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Example round&lt;/h2&gt;&#xA;&lt;p&gt;*to be added*&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Thoughts?&lt;/li&gt;&#xA;&lt;li&gt;Is this clear enough?&lt;/li&gt;&#xA;&lt;li&gt;The original game of RoboRally is super dynamic. I worry that bots may not be able to handle that without being super complex. Thoughts?&lt;/li&gt;&#xA;&lt;li&gt;Is this a dupe?&lt;/li&gt;&#xA;&lt;li&gt;Tags are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/board-game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;board-game&amp;#39;&quot; rel=&quot;tag&quot;&gt;board-game&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot;&gt;random&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot;&gt;python&lt;/a&gt;. Suggestions?&lt;/li&gt;&#xA;&lt;li&gt;Any further feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2022-06-10T15:23:50.033" LastActivityDate="2022-06-10T15:23:50.033" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24833" PostTypeId="2" ParentId="2140" CreationDate="2022-06-04T14:40:08.753" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/248230/108879&quot;&gt;How much more to a repdigit?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108879" LastEditorUserId="108879" LastEditDate="2022-06-05T01:03:58.897" LastActivityDate="2022-06-05T01:03:58.897" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24834" PostTypeId="2" ParentId="2140" CreationDate="2022-06-05T02:21:48.617" Score="0" Body="&lt;h1&gt;Rational numbers&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Every rational numbers (can be written in a fraction form &lt;span class=&quot;math-container&quot;&gt;\$a / b\$&lt;/span&gt; ( &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt;,&lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; are integers)) can be represent as a periodic, repeating decimal number.&lt;/p&gt;&#xA;&lt;p&gt;For example, &lt;span class=&quot;math-container&quot;&gt;\$1 / 3\$&lt;/span&gt; is &lt;span class=&quot;math-container&quot;&gt;\$0.3333333333333333...\$&lt;/span&gt;, so we represent it as &lt;span class=&quot;math-container&quot;&gt;\$0.(3)\$&lt;/span&gt;. Another example, &lt;span class=&quot;math-container&quot;&gt;\$3227 / 555\$&lt;/span&gt; is &lt;span class=&quot;math-container&quot;&gt;\$5.8144144144...\$&lt;/span&gt; so we represent it as &lt;span class=&quot;math-container&quot;&gt;\$5.8(144)\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your task is, given a fraction &lt;span class=&quot;math-container&quot;&gt;\$a / b\$&lt;/span&gt;, print out its periodic, repeating decimal number,&lt;/p&gt;&#xA;&lt;h2&gt;Input/Output&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input/Output can be taken in any resonable format, containing the fraction.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Testcase:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;5/2 -&amp;gt; 2.5(0)&#xA;1/3 -&amp;gt; 0.(3)&#xA;3227/555 -&amp;gt; 5.8(144)&#xA;557/495 -&amp;gt; 1.1(25)&#xA;35/17 -&amp;gt; 2.(0588235294117647)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so so shortest answer (in bytes) wins!&lt;/p&gt;&#xA;" OwnerUserId="108879" LastActivityDate="2022-06-05T02:21:48.617" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24835" PostTypeId="1" CreationDate="2022-06-05T18:01:14.900" Score="13" ViewCount="241" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/24826/107299&quot;&gt;We have decided&lt;/a&gt; to make a chat event based on language creation. In this post, we will discuss &lt;em&gt;how&lt;/em&gt; we should do it.&lt;/p&gt;&#xA;&lt;p&gt;The event would just be a time dedicated to showing off WIP languages, get feedback on codepages/features/whatever from other people, and for those other people to just generally mess around and maybe learn a new golfing language.&lt;/p&gt;&#xA;&lt;h2&gt;Time&lt;/h2&gt;&#xA;&lt;p&gt;It would go on for the whole day. However, this restriction will not apply in the event of the occurrence (certified by the United States Centers for Disease Control or successor body) of a widespread viral infection transmitted via bites or contact with bodily fluids that causes human corpses to reanimate and seek to consume living human flesh, blood, brain or nerve tissue and is likely to result in the fall of organized civilization.&lt;/p&gt;&#xA;&lt;h2&gt;Name&lt;/h2&gt;&#xA;&lt;p&gt;For now, this is MYAL, Make You a Lang for Great Good, but we already have LYAL, and I'd like a different name.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;P.S. I've never written this kind of post so I may be missing a lot or have given useless info&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="107299" LastEditorUserId="107299" LastEditDate="2022-06-06T15:31:47.273" LastActivityDate="2022-06-08T10:59:19.437" Title="Chat Event Refinement: Make You a Lang for Great Good" Tags="|discussion|chat|chat-events|" AnswerCount="8" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24837" PostTypeId="2" ParentId="2140" CreationDate="2022-06-06T03:57:05.073" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/248281/108879&quot;&gt;Make the list Fibonacci-like&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108879" LastEditorUserId="108879" LastEditDate="2022-06-06T14:38:10.457" LastActivityDate="2022-06-06T14:38:10.457" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24838" PostTypeId="2" ParentId="2140" CreationDate="2022-06-06T05:45:30.873" Score="-1" Body="&lt;h1&gt;Roman Numerals... But With A Twist&lt;/h1&gt;&#xA;&lt;p&gt;I'm assuming you have some knowledge of roman numerals, but more is at Appendix A.&lt;/p&gt;&#xA;&lt;p&gt;Fine. What's the twist?&lt;/p&gt;&#xA;&lt;h1&gt;I want it short&lt;/h1&gt;&#xA;&lt;p&gt;So, I don't want to express 1 as &lt;code&gt;IIIIIIIIIX&lt;/code&gt;, I want it &lt;code&gt;I&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;And we are not Romans, come on...&lt;/h1&gt;&#xA;&lt;p&gt;Instead, you will create a program that takes in, either as a function parameter or from STDIN:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A dictionary to represent Roman Numerals. You can take it in any (reasonable) format, for instance: &lt;code&gt;{&amp;quot;I&amp;quot;:1,&amp;quot;V&amp;quot;:5,&amp;quot;X&amp;quot;:10,&amp;quot;L&amp;quot;:50,&amp;quot;C&amp;quot;:100}&lt;/code&gt;, &lt;code&gt;&amp;quot;I1 V5 X10 L50 C100&amp;quot;&lt;/code&gt;, or even &lt;code&gt;&amp;quot;0111 1011 0010 0010 0100 1001 0010 0010 0011 1010 0011 0001 0010 1100 0010 0010 0101 0110 0010 0010 0011 1010 0011 0101 0010 1100 0010 0010 0101 1000 0010 0010 0011 1010 0011 0001 0011 0000 0010 1100 0010 0010 0100 1100 0010 0010 0011 1010 0011 0101 0011 0000 0010 1100 0010 0010 0100 0011 0010 0010 0011 1010 0011 0001 0011 0000 0011 0000 0111 1101&amp;quot;&lt;/code&gt;. You may cast any assumption on the input format, for instance, the letters must be in increasing order, or the odd numbers come first (even though, come on, why?) Assume all numbers to be positive.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The number to represent. For instance, 128724235. Assume all numbers to be positive. The number will be guaranteed to be accomplishable. For instance, for the dict &lt;code&gt;{&amp;quot;A&amp;quot;:10,&amp;quot;B&amp;quot;:58}&lt;/code&gt;, 2 might be given (which your program should output).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Your output would be the shortest Roman Numeral representation for the given numeral and mapping.&lt;/p&gt;&#xA;&lt;h1&gt;Example Program:&lt;/h1&gt;&#xA;&lt;p&gt;Up later...&lt;/p&gt;&#xA;&lt;h1&gt;Appendix A&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The mapping of letters to characters is &lt;code&gt;{'I':1, 'V':5, 'X':10,  'L':50, 'C':100, 'D':500, 'M':1000}&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Every letter is added or subtracted from a total&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The total is the value of the numeral&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For the adding or subtracting, we create the following standards:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;If there is a character that stands for a higher value at the right, for instance an &lt;code&gt;X&lt;/code&gt; on the right of the &lt;code&gt;V&lt;/code&gt;, the value of &lt;code&gt;V&lt;/code&gt; will be subtracted.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Else, it will be added. for instance, &lt;code&gt;VV&lt;/code&gt; is 10 and &lt;code&gt;V&lt;/code&gt; is 5, as there are no higher numbers at the right.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Let's just keep things clear by giving an example:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;10&lt;/code&gt; is &lt;code&gt;X&lt;/code&gt;, &lt;code&gt;5&lt;/code&gt; is &lt;code&gt;V&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt; is &lt;code&gt;I&lt;/code&gt;, &lt;code&gt;6&lt;/code&gt; is &lt;code&gt;VI&lt;/code&gt;, &lt;code&gt;4&lt;/code&gt; is &lt;code&gt;IV&lt;/code&gt;, &lt;code&gt;2&lt;/code&gt; can be &lt;code&gt;IIIV&lt;/code&gt;, &lt;code&gt;19&lt;/code&gt; is &lt;code&gt;XIX&lt;/code&gt;, &lt;code&gt;4&lt;/code&gt; can also be expressed as &lt;code&gt;IVX&lt;/code&gt;. Note the last three.&lt;/p&gt;&#xA;&lt;p&gt;To make things even clearer this is a decoder:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;def roman_to_integer(numeral,mapping=None):&#xA; if not mapping: mapping = {'I':1, 'V':5, 'X':10, &#xA;  'L':50, 'C':100, 'D':500, 'M':1000}&#xA; result = 0&#xA; for index, character in enumerate(numeral):&#xA;  if index+1==len(numeral) or \&#xA;   mapping[character]&amp;gt;=max(map(lambda x: &#xA;   mapping[x], numeral[index:])): &#xA;    result+=mapping[character]&#xA;  else: result-=mapping[character]&#xA; return result&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="111945" LastEditorUserId="111945" LastEditDate="2022-06-06T06:48:00.190" LastActivityDate="2022-06-06T06:48:00.190" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24839" PostTypeId="2" ParentId="24835" CreationDate="2022-06-06T06:02:26.577" Score="4" Body="&lt;h1&gt;Another Idea&lt;/h1&gt;&#xA;&lt;h2&gt;Name&lt;/h2&gt;&#xA;&lt;p&gt;I don't like MYAL that much, because it's too similar to LYAL.&#xA;I proposed DALC (Discuss About Language Creation) in the chat, but I don't like it much either.&lt;/p&gt;&#xA;&lt;h2&gt;Hyperping&lt;/h2&gt;&#xA;&lt;p&gt;I don't like the idea of a bot being in the room biweekly/weekly.&lt;br /&gt;&#xA;I'd rather make a website where you can create ping lists and copy them when needed.&lt;/p&gt;&#xA;&lt;h2&gt;Time &amp;amp; Room&lt;/h2&gt;&#xA;&lt;p&gt;I think creating another room would just be a clone of &lt;a href=&quot;https://chat.stackexchange.com/rooms/110136/the-tarpit&quot;&gt;The Tarpit&lt;/a&gt; and no one would probably participate in the event.&lt;br /&gt;&#xA;Maybe we could rotate between 00:00UTC and 12:00UTC as BMG did.&lt;/p&gt;&#xA;&lt;p&gt;I do really hope organized civilizations won't fall apart.&lt;/p&gt;&#xA;" OwnerUserId="96037" LastActivityDate="2022-06-06T06:02:26.577" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24841" PostTypeId="2" ParentId="2140" CreationDate="2022-06-06T11:29:34.833" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/248333/92689&quot;&gt;Sort my Cups&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="92689" LastEditDate="2022-06-09T22:20:07.460" LastActivityDate="2022-06-09T22:20:07.460" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24842" PostTypeId="2" ParentId="24835" CreationDate="2022-06-06T14:21:17.190" Score="4" Body="&lt;h1&gt;Yet More Feedback&lt;/h1&gt;&#xA;&lt;h2&gt;Name&lt;/h2&gt;&#xA;&lt;p&gt;While I have nothing against MYAL as a name, perhaps something &amp;quot;non-acronym&amp;quot; like Community Directives or Community Initiatives could work.&lt;/p&gt;&#xA;&lt;h2&gt;Hyperping&lt;/h2&gt;&#xA;&lt;p&gt;I suggested this, so I'm not really qualified to comment on it. But I will say that instead of having a separate bot, maybe it could be integrated into NSP/NMP. Or perhaps Vyxal Bot could be borrowed on MYAL days.&lt;/p&gt;&#xA;&lt;h2&gt;Time&lt;/h2&gt;&#xA;&lt;p&gt;12am UTC to 12am UTC the next day would be best. Weekly is also a good idea. Don't have it rotate starting times, as that's just confusing.&lt;/p&gt;&#xA;&lt;p&gt;Maybe have it on a Tuesday.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/0iZa1.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/0iZa1.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Tuesday looks active.&lt;/p&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2022-06-06T14:21:17.190" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24843" PostTypeId="2" ParentId="2140" CreationDate="2022-06-06T14:34:40.487" Score="-1" Body="&lt;h1&gt;Minimal number of moves needed by a knight&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Given an &lt;span class=&quot;math-container&quot;&gt;\$N × N\$&lt;/span&gt; board, what is the minimum number of moves needed by a knight to reach every square (on any given square)?&lt;/p&gt;&#xA;&lt;p&gt;In other words, the &lt;a href=&quot;https://oeis.org/A232007&quot; rel=&quot;nofollow noreferrer&quot;&gt;A232007&lt;/a&gt; sequence from &lt;a href=&quot;https://oeis.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Input/Output can be taken in any reasonable format, taking the size of the board and returning the number of moves (you don't need to handle &lt;code&gt;2&lt;/code&gt;, and &lt;code&gt;3&lt;/code&gt; because the knight can't travel all of the &lt;span class=&quot;math-container&quot;&gt;\$2 × 2\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$3 × 3\$&lt;/span&gt; board)&lt;/p&gt;&#xA;&lt;p&gt;Testcase:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;8 -&amp;gt; 6&#xA;5 -&amp;gt; 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest answer (in bytes) wins!&lt;/p&gt;&#xA;" OwnerUserId="108879" LastEditorUserId="108879" LastEditDate="2022-06-08T05:35:24.460" LastActivityDate="2022-06-08T05:35:24.460" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24844" PostTypeId="2" ParentId="24835" CreationDate="2022-06-06T15:31:14.617" Score="2" Body="&lt;h1&gt;My Own Opinion (Copied from the Post)&lt;/h1&gt;&#xA;&lt;p&gt;Ideally, this should not be restricted to any one language at a time as LYAL is, but have anyone participate. If ideas are mixed around like this, it might lead to a new and improved generation of golfing languages. It also will probably make existing languages better.&lt;/p&gt;&#xA;&lt;p&gt;One idea by @lyxal was to have a command that would only be allowed to run during the event, similar to the &lt;code&gt;!!/hyperping&lt;/code&gt; command in the Vyxal chatroom, which a developer would use and a bot would ping all users interested in replying.&lt;/p&gt;&#xA;&lt;h2&gt;Time&lt;/h2&gt;&#xA;&lt;p&gt;I would like this to happen weekly, preferably starting at a time convenient to me (i.e. 3 PM UTC or 12 AM UTC).&lt;/p&gt;&#xA;&lt;h2&gt;Name&lt;/h2&gt;&#xA;&lt;p&gt;I really like @user's suggestion of BABEL, but since I don't think this should be done biweekly, it should be a recursive acronym: &amp;quot;BABEL: Assistance in Brilliantly Engineering Languages&amp;quot;.&lt;/p&gt;&#xA;" OwnerUserId="107299" LastActivityDate="2022-06-06T15:31:14.617" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24845" PostTypeId="2" ParentId="24835" CreationDate="2022-06-06T15:53:38.403" Score="14" Body="&lt;h1&gt;Name proposal&lt;/h1&gt;&#xA;&lt;p&gt;While it doesn't make a clever acronym, &lt;strong&gt;Language Design Workshop&lt;/strong&gt; would look very nice on the Upcoming Events list.&lt;/p&gt;&#xA;" OwnerUserId="16766" LastActivityDate="2022-06-06T15:53:38.403" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24846" PostTypeId="2" ParentId="24835" CreationDate="2022-06-06T16:18:03.593" Score="9" Body="&lt;h1&gt;No hyperpings&lt;/h1&gt;&#xA;&lt;p&gt;These wouldn't be very useful, since:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If you're already in the chat room, you don't need a ping&lt;/li&gt;&#xA;&lt;li&gt;If you're awake/online but not in chat, CGCC pings you on its own when the event is starting, so you can hop into chat&lt;/li&gt;&#xA;&lt;li&gt;If you're asleep/offline, you can just check the transcripts later, instead of either having to remember to remove your username from the list, or having a flooded inbox the next morning&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Additionally, hosting this somewhere would create an external dependency that's baked into the event, which will cause problems.&lt;/p&gt;&#xA;&lt;p&gt;Also, what would these pings be used for?&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Whenever the event starts? If so, chat does this already&lt;/li&gt;&#xA;&lt;li&gt;Whenever a new language is brought up? If so, we could just use a format like LYAL's &lt;strong&gt;xMC:&lt;/strong&gt;, mabe &lt;strong&gt;FR:&lt;/strong&gt; (feedback request), and you can search those on your own at any time&lt;/li&gt;&#xA;&lt;li&gt;Whenever you want feedback on a particular suggestion for a language? If so, that's a lot of pings, most of which will likely not be interesting to the majority of people. I might (and probably would) only want to provide feedback on certain languages, which would make the system far more complicated&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-06-06T16:18:03.593" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24847" PostTypeId="2" ParentId="24835" CreationDate="2022-06-06T16:21:32.330" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://esolangs.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;esolangs.org&lt;/a&gt; category&lt;/h1&gt;&#xA;&lt;p&gt;I propose creating a category on the Esolang Wiki for languages spawned from or created during this event.&lt;/p&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2022-06-06T16:23:15.760" LastActivityDate="2022-06-06T16:23:15.760" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24848" PostTypeId="2" ParentId="24835" CreationDate="2022-06-06T16:55:45.950" Score="4" Body="&lt;h2&gt;Time&lt;/h2&gt;&#xA;&lt;p&gt;I'd like to have the event go for multiple days, so that people have a chance to get acquainted with the language so they can actually contribute to it before the event ends. However, we might start losing interest if it goes on too long, so I'd suggest 2-3 full days, probably starting and ending at 0:00 UTC.&lt;/p&gt;&#xA;" OwnerUserId="95792" LastActivityDate="2022-06-06T16:55:45.950" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24850" PostTypeId="2" ParentId="2140" CreationDate="2022-06-07T06:22:46.947" Score="-1" Body="&lt;h1&gt;Left and Right, Spsp Style&lt;/h1&gt;&#xA;&lt;h4&gt;&lt;code&gt;WARNING&lt;/code&gt;&lt;/h4&gt;&#xA;&lt;p&gt;This question is written by the Spsp language creator TvoozMagnificent` and might includes severe advertising.&lt;/p&gt;&#xA;&lt;h4&gt;Spsp&lt;/h4&gt;&#xA;&lt;p&gt;What's Spsp? Spsp is designed to be a 2D fourth generation golfing language.&lt;/p&gt;&#xA;&lt;h4&gt;What are the commands?&lt;/h4&gt;&#xA;&lt;p&gt;Good question, it is in developement, and if you want to help me, come (here)[https://chat.stackexchange.com/rooms/136645/superior-simple]. Thank you.&lt;/p&gt;&#xA;&lt;p&gt;But three commands have been kept in Spsp and is likely to stay that way. For the Spsp in this challenge, we have simplified things.&lt;/p&gt;&#xA;&lt;p&gt;The commands are &lt;code&gt;L&lt;/code&gt;, &lt;code&gt;R&lt;/code&gt;, and &lt;code&gt;S&lt;/code&gt;, which stand for &lt;code&gt;left&lt;/code&gt;, &lt;code&gt;right&lt;/code&gt;, and &lt;code&gt;stop&lt;/code&gt;. You will be given a program, for instance this: (You would probably take it as a list instead, for instance &lt;code&gt;[[' ','R','S'],[' ','L','S'],['L','S',' ']]&lt;/code&gt;) Assume the lines to be padded to the same length.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+-+-+-+&#xA;| |R|S|&#xA;+-+-+-+&#xA;| |L|S|&#xA;+-+-+-+&#xA;|L|S| |&#xA;+-+-+-+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The &lt;code&gt;IP&lt;/code&gt;, which stands for the &lt;code&gt;Instruction Pointer&lt;/code&gt;, Starts out at the top left cell, pointing right, so let's draw it as &lt;code&gt;&amp;gt;&lt;/code&gt;. Thus, the current map looks like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+-+-+-+&#xA;|&amp;gt;|R|S|&#xA;+-+-+-+&#xA;| |L|S|&#xA;+-+-+-+&#xA;|L|S| |&#xA;+-+-+-+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Now the &lt;code&gt;IP&lt;/code&gt; tries to advance. It hits an &lt;code&gt;R&lt;/code&gt; block, so it &lt;strong&gt;doesn't advance&lt;/strong&gt;, and turns right. Now it points down:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+-+-+-+&#xA;|v|R|S|&#xA;+-+-+-+&#xA;| |L|S|&#xA;+-+-+-+&#xA;|L|S| |&#xA;+-+-+-+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Now the &lt;code&gt;IP&lt;/code&gt; can advance:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+-+-+-+&#xA;| |R|S|&#xA;+-+-+-+&#xA;|v|L|S|&#xA;+-+-+-+&#xA;|L|S| |&#xA;+-+-+-+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Now the &lt;code&gt;IP&lt;/code&gt; can't advance again, so it turns left. This is because it points towards an &lt;code&gt;L&lt;/code&gt;, the &lt;code&gt;L&lt;/code&gt; at the side has no effect:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+-+-+-+&#xA;| |R|S|&#xA;+-+-+-+&#xA;|&amp;gt;|L|S|&#xA;+-+-+-+&#xA;|L|S| |&#xA;+-+-+-+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And turns left again to point upwards:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+-+-+-+&#xA;| |R|S|&#xA;+-+-+-+&#xA;|^|L|S|&#xA;+-+-+-+&#xA;|L|S| |&#xA;+-+-+-+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;It advances:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+-+-+-+&#xA;|^|R|S|&#xA;+-+-+-+&#xA;| |L|S|&#xA;+-+-+-+&#xA;|L|S| |&#xA;+-+-+-+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If the &lt;code&gt;IP&lt;/code&gt; hits a wall, it raps. (Pun Intended) So if the &lt;code&gt;IP&lt;/code&gt; advances, he would end up on the &lt;code&gt;L&lt;/code&gt; marked &lt;code&gt;X&lt;/code&gt; on this map:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+-+-+-+&#xA;|^|R|S|&#xA;+-+-+-+&#xA;| |L|S|&#xA;+-+-+-+&#xA;|X|S| |&#xA;+-+-+-+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And thus the pointer turns left:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+-+-+-+&#xA;|&amp;lt;|R|S|&#xA;+-+-+-+&#xA;| |L|S|&#xA;+-+-+-+&#xA;|L|S| |&#xA;+-+-+-+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And the pointer advances and hits the &lt;code&gt;S&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+-+-+-+&#xA;| |R|X|&#xA;+-+-+-+&#xA;| |L|S|&#xA;+-+-+-+&#xA;|L|S| |&#xA;+-+-+-+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Thus the pointer stops. Your chllenge is to output the ending coordinate in some way, whether it is the mathematical coordinate system &lt;code&gt;(2,2)&lt;/code&gt; or the index &lt;code&gt;[1,3]&lt;/code&gt; or &lt;code&gt;[0,2]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;There's a small twist however. What does this program do?&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+-+-+&#xA;| |R|&#xA;+-+-+&#xA;|L|S|&#xA;+-+-+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Well, the &lt;code&gt;IP&lt;/code&gt; turns right, and then turns left, and then... yikes, that's an infinite loop! What do we output then? Well, don't output anything, &lt;strong&gt;but terminate the program instead of running forever&lt;/strong&gt;. It is easy to know that if the same &lt;code&gt;IP&lt;/code&gt; state is achieved twice, then a loop will happen.&lt;/p&gt;&#xA;&lt;p&gt;Or, take this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+-+&#xA;| |&#xA;+-+&#xA;|S|&#xA;+-+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The &lt;code&gt;IP&lt;/code&gt; just wraps around and loops on the first line.&lt;/p&gt;&#xA;" OwnerUserId="111945" LastActivityDate="2022-06-07T06:22:46.947" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24851" PostTypeId="1" CreationDate="2022-06-07T09:51:59.237" Score="18" ViewCount="276" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/145222/word-stays-a-word-after-taking-away-a-letter-repeat&quot;&gt;&amp;quot;Word stays a word after taking away a letter. Repeat&amp;quot;&lt;/a&gt; was a massively downvoted question, not because of challenge, but mainly because it was badly written.&lt;br /&gt;&#xA;Personally, I think that the idea is great and it still has scope for many new answers, as it currently only has 4.&lt;br /&gt;&#xA;I think that we should repost the challenge, but with much more loose rules:&lt;/p&gt;&#xA;&lt;h3&gt;1. Allow all languages&lt;/h3&gt;&#xA;&lt;p&gt;That's pretty obvious. The challenge only allowed Python, Ruby, Perl, Bash, or &amp;quot;whatever else often comes pre-installed on a Linux/Unix/Mac&amp;quot; answers. I think that caused at least half of the downvotes.&lt;/p&gt;&#xA;&lt;h3&gt;2. Make it a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; challenge&lt;/h3&gt;&#xA;&lt;p&gt;When the question was &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/145222/1&quot;&gt;first posted&lt;/a&gt;, it was a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot;&gt;popularity-contest&lt;/a&gt;, which I believe led to many downvotes too. But it was soon after edited to be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;3. Take a dictionary &lt;em&gt;and a word&lt;/em&gt; as the input&lt;/h3&gt;&#xA;&lt;p&gt;This is just my personal opinion, but I think it'll be more interesting to output if the word is a valid answer to the riddle, and not just output some random word that satisfies the riddle.&lt;/p&gt;&#xA;&lt;p&gt;Opinions?&lt;/p&gt;&#xA;" OwnerUserId="96037" LastActivityDate="2022-06-08T17:06:25.020" Title="Repost &quot;Word stays a word after taking away a letter&quot;?" Tags="|discussion|challenges|reposting|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24852" PostTypeId="2" ParentId="2140" CreationDate="2022-06-07T19:59:01.643" Score="5" Body="&lt;h1&gt;Generate a Baudot punched tape segment&lt;/h1&gt;&#xA;&lt;h2&gt;What is Baudot?&lt;/h2&gt;&#xA;&lt;p&gt;From Wikipedia&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The Baudot code [boˈdo] is an early character encoding for telegraphy invented by Émile Baudot in the 1870s. It was the predecessor to the International Telegraph Alphabet No. 2 (ITA2), the most common teleprinter code in use until the advent of ASCII. Each character in the alphabet is represented by a series of five bits, sent over a communication channel such as a telegraph wire or a radio signal. The symbol rate measurement is known as baud, and is derived from the same name.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Task:&lt;/h2&gt;&#xA;&lt;p&gt;For this challenge, your task is to write a program or a function that takes a string as its input and generates ASCII art that looks like a roll of punched tape. For the purposes of this challenge, you should specifically use the following variant, as it just happened to be the first image I found :P&lt;/p&gt;&#xA;&lt;a href=&quot;https://commons.wikimedia.org/wiki/File:International_Telegraph_Alphabet_2_brightened.jpg&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;User:Huestones with derivative work by User:TedColes, CC BY-SA 3.0 &amp;lt;https://creativecommons.org/licenses/by-sa/3.0&amp;gt;, via Wikimedia Commons&quot; &gt;&#xA;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/thumb/1/12/International_Telegraph_Alphabet_2_brightened.jpg/512px-International_Telegraph_Alphabet_2_brightened.jpg&quot; width=&quot;512&quot; alt=&quot;International Telegraph Alphabet 2 brightened&quot;&gt;&lt;/a&gt;&#xA;&lt;hr&gt;&#xA;&lt;p&gt;For example where input is &amp;quot;HELLO WORLD\r\n&amp;quot; (note that carriage return is optional)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; *    *      &#xA;  **  * **  *&#xA;.............&#xA;*    *  *    &#xA;    *  *   * &#xA;* ***  *  *  &#xA;hello worldcl&#xA;           rf&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Program Description:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The program/function takes the input and turns it into a sequence of Baudot words (sequences of five bits)&lt;/li&gt;&#xA;&lt;li&gt;For each word, it makes a column of the first two bits, then a &lt;code&gt;.&lt;/code&gt; then the remaining three bits&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Optional trailing space / newline&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Criteria:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output may not be output as an array unless there is no other valid option in the language. Trailing spaces and newlines allowed.&lt;/li&gt;&#xA;&lt;li&gt;Any acceptable input&lt;/li&gt;&#xA;&lt;li&gt;Assume all input characters are valid Baudot characters&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="104373" LastEditorUserId="104373" LastEditDate="2022-06-09T17:17:19.800" LastActivityDate="2022-06-09T17:17:19.800" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24853" PostTypeId="2" ParentId="24851" CreationDate="2022-06-08T00:10:38.083" Score="7" Body="&lt;h1&gt;I support this; especially with modification number three.&lt;/h1&gt;&#xA;&lt;p&gt;This seems like it could be a very interesting challenge idea. It could do with a reopening. Number three would additionally make it a lot more interesting.&lt;/p&gt;&#xA;&lt;p&gt;Also, (tossing it out there) perhaps another input could be to specify what counts as a glyph (character, letter, unit of writing)? Digraphs (two-character glyphs) &amp;amp; trigraphs (three-character glyphs) would be interesting cases to handle.&lt;/p&gt;&#xA;" OwnerUserId="104836" LastEditorUserId="104836" LastEditDate="2022-06-08T17:06:25.020" LastActivityDate="2022-06-08T17:06:25.020" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24854" PostTypeId="2" ParentId="2140" CreationDate="2022-06-08T07:33:44.613" Score="10" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/248571&quot;&gt;Don&amp;#39;t touch the walls!&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-06-13T12:02:37.267" LastActivityDate="2022-06-13T12:02:37.267" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="24856" PostTypeId="2" ParentId="24835" CreationDate="2022-06-08T10:59:19.437" Score="3" Body="&lt;h1&gt;Time: 24 hours, with alternating start times&lt;/h1&gt;&#xA;&lt;p&gt;24 hours allows people to drop in throughout their day, no matter the timezone, but without dragging on so long that it starts to account for a large proportion of the week.&lt;/p&gt;&#xA;&lt;p&gt;However, as we have experienced with LYAL, a lot of the time, the bulk of the activity tends to be immediately after the scheduled start time. So...&lt;/p&gt;&#xA;&lt;p&gt;I suggest the start time alternate between 12AM and 12PM UTC, to allow that period of most activity to be accessible to people in varied timezones.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2022-06-08T10:59:19.437" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24857" PostTypeId="2" ParentId="2140" CreationDate="2022-06-09T07:22:47.603" Score="0" Body="&lt;h1&gt;Infinite Prisoner's Infilemma&lt;/h1&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;In this &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; challenge, you are going to&#xA;write a program that will play the game of the&#xA;&lt;strong&gt;Infinite Prisoner's Infilemma&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This game is based on the classic game of the name&#xA;&lt;a href=&quot;https://en.wikipedia.org/wiki/Infinite_Prisoners%27_Dilemma&quot; rel=&quot;nofollow noreferrer&quot;&gt;Infinite Prisoner's Dilemma&#xA;&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The original inspiration for this game came from &lt;a href=&quot;https://ncase.me/trust/&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&#xA;game&lt;/a&gt; by&#xA;&lt;a href=&quot;https://www.ncase.me/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Nicky Case&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;By default we will include the sample bots from Nicky&#xA;Case's game. You can also add your own bots.&lt;/p&gt;&#xA;&lt;h2&gt;How to Play&lt;/h2&gt;&#xA;&lt;p&gt;Given a list of bot models &lt;code&gt;[1,2,3,4,5]&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;First, multiply the list by 10 to get 10 bots of each model.&lt;/li&gt;&#xA;&lt;li&gt;Then, battle every two bots together.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;During a battle there will be 10 rounds. Each round:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Both players will enter &lt;code&gt;x&lt;/code&gt; dollars into a machine, where&#xA;&lt;code&gt;x&lt;/code&gt; is non-negative (not neccessarily an integer) and less&#xA;than or equal to the amount of money they have. They start&#xA;with $100.&lt;/li&gt;&#xA;&lt;li&gt;The other player will recieve 1.1 times the amount of money.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Default Bots&lt;/h2&gt;&#xA;&lt;p&gt;Default bots are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Copycat, which starts by cooperating with 1/3 of his money,&#xA;and then cooperates with the same ammount of money as the&#xA;ammount of money you cooperated last turn. (Unless he doesn't&#xA;have enough money, which he will use all of them).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;AlwaysCheat, which, always cheats by giving no money. DUH!&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;AlwaysCooperate, which, always cooperates by giving 1/2 of his&#xA;money.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Grudger, which starts by cooperating with 1/3 of his money but&#xA;gives no more money if you have ever cheated and give less than&#xA;$10.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Detective, which cooperates $20, $5, $10, but if the opponent&#xA;always gave at least $50, will act like an AlwaysCheat, else&#xA;will act like a Copycat.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Copykitten, which is similar to Copycat, but cooperates with&#xA;the same ammount of money as the max of the opponent's last&#xA;two turns.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Simpleton, which starts by cooperating 1/2 of his money, then&#xA;at every turn, if the opponent gave less than $20, switch a&#xA;state between 1/2 of his money and none.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Random, which give, randomly, 2/3 to none of his money.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Instructions&lt;/h2&gt;&#xA;&lt;p&gt;Your bot should be a class. It will inherit from this Bot class:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;class Bot:&#xA;    def __init__(self):&#xA;        self.money = 100&#xA;        self.information = {}&#xA;&#xA;    def log(self, bot, money):&#xA;        if bot not in self.information:&#xA;            self.information[bot] = [money]&#xA;        else:&#xA;            self.information[bot] += [money]&#xA;&#xA;    def change_money(self, money):&#xA;        self.money += money&#xA;&#xA;    def choice(self, bot):&#xA;        pass # override in subclass&#xA;&#xA;    def name(self):&#xA;        pass # should return the name of the bot&#xA;&#xA;    def get_choice(self, bot):&#xA;        choice = self.choice(bot)&#xA;        assert 0 &amp;lt;= choice &amp;lt;= self.money, \&#xA;            f&amp;quot;Invalid choice {choice}, bot money {self.money}&amp;quot; # check if choice is valid&#xA;        return choice&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You may &lt;strong&gt;not&lt;/strong&gt; use any other libraries other than &lt;code&gt;math&lt;/code&gt;&#xA;and &lt;code&gt;random&lt;/code&gt;. (If you have any requests, let me know.&#xA;I mainly want to ban the use of &lt;code&gt;inspect&lt;/code&gt;, &lt;code&gt;sys&lt;/code&gt;, and &lt;code&gt;os&lt;/code&gt;.)&lt;/p&gt;&#xA;&lt;p&gt;You may also &lt;strong&gt;not&lt;/strong&gt; override any methods other than &lt;code&gt;choice&lt;/code&gt; and&#xA;&lt;code&gt;name&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You may &lt;strong&gt;not&lt;/strong&gt; set &lt;code&gt;self.money&lt;/code&gt;.&#xA;(Else, you can come up with self.money = 10000, etc.)&lt;/p&gt;&#xA;&lt;p&gt;The following is a sample bot:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;from main import Bot # &amp;lt;-- import the Bot class&#xA;from random import random as r # &amp;lt;-- import the random function&#xA;&#xA;class TestBot(Bot): # &amp;lt;-- create a class called TestBot&#xA;                    # &amp;lt;-- that inherits from Bot&#xA;    def choice(self, bot): # &amp;lt;-- override the choice method&#xA;        return self.money*r()/10 # random number between 0 and&#xA;                                 # 10% of the bot's money&#xA;    def name(self): # &amp;lt;-- override the name method&#xA;        return &amp;quot;randombot&amp;quot; # &amp;lt;-- return the name of the bot&#xA;&#xA;bot = TestBot # &amp;lt;-- IMPORTANT: create a variable called bot&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;The Information Log&lt;/h2&gt;&#xA;&lt;p&gt;Well, sometimes you want to know what the opponent did.&#xA;Thus, sometimes you need the &amp;quot;information log&amp;quot;, called&#xA;via &lt;code&gt;self.information&lt;/code&gt;. Remember the &lt;code&gt;bot&lt;/code&gt; argument&#xA;that is passed in the &lt;code&gt;choice&lt;/code&gt; method? That is your&#xA;opponent. To get the information log of your opponent,&#xA;use the following:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;self.information[bot] # &amp;lt;-- get the information log of the opponent&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;What does that information look like? Well, it's like&#xA;&lt;code&gt;[[Y1,O1],[Y2,O2],...]&lt;/code&gt;. &lt;code&gt;Y1&lt;/code&gt; is what you gave the&#xA;opponent in round 1. The rest is fairly easy to infer.&lt;/p&gt;&#xA;&lt;h2&gt;Controller Script&lt;/h2&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;# This is the controller script for the Infinite Prisoner's Infilemma King of the Hill game.&#xA;&#xA;bots = ['testbot','randombot'] # Will change.&#xA;&#xA;# to make it fold-able.&#xA;if True:&#xA;&#xA;    from rich.console import Console&#xA;    from rich.table import Table&#xA;    console = Console()&#xA;    with open('log.txt','w') as f: pass&#xA;&#xA;    def print(*args, **kwargs): console.print(*args, **kwargs)&#xA;&#xA;    def log(*text):&#xA;        with open('log.txt','a') as f:&#xA;            f.write(' '.join(list(map(str,text)))+'\n')&#xA;&#xA;    def play(Bot1, Bot2):&#xA;        log(Bot1.name(), 'vs', Bot2.name())&#xA;        b1_choice, b2_choice = Bot1.get_choice(Bot2), Bot2.get_choice(Bot1)&#xA;        Bot1.change_money(-b1_choice)&#xA;        Bot2.change_money(-b2_choice)&#xA;        log(b1_choice, b2_choice)&#xA;        Bot1.change_money(1.001*b2_choice)&#xA;        Bot2.change_money(1.001*b1_choice)&#xA;        log(Bot1.name(), 'has', Bot1.money, 'dollars')&#xA;        log(Bot2.name(), 'has', Bot2.money, 'dollars')&#xA;        Bot1.log(Bot2, b1_choice, b2_choice)&#xA;        Bot2.log(Bot1, b2_choice, b1_choice)&#xA;        log('\n\n')&#xA;&#xA;    class Bot:&#xA;        def __init__(self):&#xA;            self.money = 100&#xA;            self.information = {}&#xA;&#xA;        def log(self, bot, money):&#xA;            if bot not in self.information:&#xA;                self.information[bot] = [money]&#xA;            else:&#xA;                self.information[bot] += [money]&#xA;&#xA;        def change_money(self, money):&#xA;            self.money += money&#xA;&#xA;        def choice(self, bot):&#xA;            pass # override in subclass&#xA;&#xA;        def name(self):&#xA;            pass # should return the name of the bot&#xA;&#xA;        def get_choice(self, bot):&#xA;            choice = self.choice(bot)&#xA;            assert 0 &amp;lt;= choice &amp;lt;= self.money, \&#xA;                f&amp;quot;Invalid choice {choice}, bot money {self.money}&amp;quot; # check if choice is valid&#xA;            return choice&#xA;&#xA;    def leaderboard(Bots):&#xA;        table = Table(show_header=True, header_style=&amp;quot;bold #00ffff&amp;quot;)&#xA;        table.add_column(&amp;quot;Bot&amp;quot;, style=&amp;quot;bold #ffff00&amp;quot;) # yellow&#xA;        table.add_column(&amp;quot;Money&amp;quot;, justify=&amp;quot;right&amp;quot;, style=&amp;quot;#00ff00&amp;quot;) # green&#xA;        for bot in sorted(Bots, key=lambda x:-x.money):&#xA;            table.add_row(bot.name()+'     ',&#xA;                          f&amp;quot;     ${str(round(bot.money,2)) if str(round(bot.money,2))[::-1][1] != '.' else str(round(bot.money,2))+'0'}&amp;quot;)&#xA;        print(table)&#xA;&#xA;    def main():&#xA;        print('\n\n\n')&#xA;&#xA;        Bots = []&#xA;        for bot in bots:&#xA;            for i in range(10): Bots.append(__import__(bot).bot())&#xA;&#xA;        for Bot1 in Bots:&#xA;            for Bot2 in Bots:&#xA;                if Bot1 is not Bot2:&#xA;                    for i in range(10): play(Bot1,Bot2)&#xA;&#xA;        leaderboard(Bots)&#xA;        print('\n\n\n')&#xA;&#xA;    if __name__ == '__main__':&#xA;        main()&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="111945" LastEditorUserId="111945" LastEditDate="2022-06-12T05:08:43.517" LastActivityDate="2022-06-12T05:08:43.517" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24858" PostTypeId="1" CreationDate="2022-06-09T17:05:03.493" Score="11" ViewCount="105" Body="&lt;p&gt;BMG has died. Nearly immediately I &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24826/chat-event-proposal-make-you-a-lang-for-great-good&quot;&gt;proposed&lt;/a&gt; the event that henceforth became known as MYAL. After a short &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24835/chat-event-refinement-make-you-a-lang-for-great-good&quot;&gt;discussion&lt;/a&gt; to flesh out the details, and the chat event Language Development Workshop was born. Here, we will get to show off our languages and their features, chat about them, get feedback, try out WIP languages, and, hopefully, get to share ideas and perhaps accelerate the development of the first 4th generation golfing language.&lt;/p&gt;&#xA;&lt;p&gt;It will be every other Wednesday at 12:00 UTC (8:00 EST), starting June 15th. Have fun!&lt;/p&gt;&#xA;" OwnerUserId="107299" LastEditorUserId="107299" LastEditDate="2022-06-09T17:19:02.437" LastActivityDate="2022-06-09T17:19:02.437" Title="Chat Event Announcment: Language Development Workshop" Tags="|discussion|chat|chat-events|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24859" PostTypeId="2" ParentId="2140" CreationDate="2022-06-09T19:28:28.077" Score="4" Body="&lt;h1&gt;The Magic Money Machine&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;This KOTH is based on a game of Tom Scott's series &lt;a href=&quot;https://www.youtube.com/watch?v=FJSI7QTAt_o&quot; rel=&quot;nofollow noreferrer&quot;&gt;Money&lt;/a&gt;, so make sure to check out his video&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;There are three rounds per game. Each bot will get &lt;code&gt;100$&lt;/code&gt;.&lt;br /&gt;&#xA;They'll have to decide how much money they'll keep for themselves, and how much they're going to put in the Magic Money Machine.&lt;br /&gt;&#xA;The money in the Machine will get a &lt;code&gt;20%&lt;/code&gt; boost in the first round, a &lt;code&gt;50%&lt;/code&gt; boost in the second round, and a &lt;code&gt;100%&lt;/code&gt; boost in the third round.&lt;br /&gt;&#xA;Each bot will equally get the money left in the Machine.&lt;/p&gt;&#xA;&lt;h3&gt;Example:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bot &lt;code&gt;A&lt;/code&gt; decides to put &lt;code&gt;60$&lt;/code&gt; in the Money Machine and keep &lt;code&gt;40$&lt;/code&gt; for themselves&lt;/li&gt;&#xA;&lt;li&gt;Bot &lt;code&gt;B&lt;/code&gt; decides to put &lt;code&gt;30$&lt;/code&gt; in the Money Machine and keep &lt;code&gt;70$&lt;/code&gt; for themselves&lt;/li&gt;&#xA;&lt;li&gt;In total there are &lt;code&gt;90$&lt;/code&gt; in the Money Machine, so with a boost of eg. &lt;code&gt;20%&lt;/code&gt; that's &lt;code&gt;108$&lt;/code&gt;, so each bot will get an additional &lt;code&gt;54$&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Bot &lt;code&gt;A&lt;/code&gt; has &lt;code&gt;94$&lt;/code&gt; in the end&lt;/li&gt;&#xA;&lt;li&gt;Bot &lt;code&gt;B&lt;/code&gt; has &lt;code&gt;124$&lt;/code&gt; in the end&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;You have to try to get as much money as possible.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard Loopholes&lt;/a&gt; apply&lt;/li&gt;&#xA;&lt;li&gt;No interaction with the controller other than by returning values.&lt;/li&gt;&#xA;&lt;li&gt;No interaction with other bots&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;API Template&lt;/h2&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;def plan(round_num, others_money):&#xA;    # Tell the other bots how much money you're going to put in the Machine&#xA;    # You are allowed to lie&#xA;    return money_insert_pub&#xA;&#xA;def main(round_num, others_money, others_plan):&#xA;    # Do stuff here&#xA;    return money_insert&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;round_num&lt;/code&gt;: an integer ranging from 1 to 3, it depicts the current round&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;others_money&lt;/code&gt;: a list of 0, 1, or 2 tuples. Each tuple will contain the &lt;code&gt;money_kept&lt;/code&gt; var of the other bots of the last rounds (yours incl.).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;money_insert_pub&lt;/code&gt;: the &lt;code&gt;money_insert&lt;/code&gt; value you're telling others&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;money_insert&lt;/code&gt;: an integer between 0 to 100, the amount of money you put in the Magic Money Machine&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;others_plan&lt;/code&gt;: the &lt;code&gt;money_insert_pub&lt;/code&gt; value of the other bots (yours incl.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Controller code is on &lt;a href=&quot;https://github.com/SE-Nitro/Magic-Money-Machine&quot; rel=&quot;nofollow noreferrer&quot;&gt;Github&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Example bots&lt;/h2&gt;&#xA;&lt;h3&gt;Beep Boopy Random&lt;/h3&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;import random&#xA;def plan(round_num, others_money):&#xA;    global money_insert&#xA;    money_insert = random.randint(0, 100)&#xA;    return money_insert&#xA;&#xA;def main(round_num, others_money, others_plans):&#xA;    return money_insert&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Random copycat&lt;/h3&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;import random&#xA;def plan(round_num, others_money):&#xA;    return 100&#xA;&#xA;def main(round_num, others_money, others_plan):&#xA;    if round_num == 1:&#xA;        money_insert = random.randint(0, 100)&#xA;    else:&#xA;        money_insert = (&#xA;            random.choice(others_money[-1]) if others_money else random.randint(0, 100)&#xA;        )&#xA;    return money_insert&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is my first (well sort of) KOTH, is there anything I've missed?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="96037" LastEditorUserId="96037" LastEditDate="2022-06-11T09:40:52.773" LastActivityDate="2022-06-11T09:40:52.773" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24861" PostTypeId="2" ParentId="2140" CreationDate="2022-06-10T02:25:58.623" Score="1" Body="&lt;h1&gt;Parse Specification Data Structure Diagrams&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Many protocol specifications illustrate the structure of data packets or file formats with ASCII tables.  This helps to visualize the layout of the data in memory, a file, or how bits are transmitted &amp;quot;on the wire&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;For example RFC 1035 section 4.1.1 describes the header of a DNS query with the following diagram:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;                                1  1  1  1  1  1&#xA;  0  1  2  3  4  5  6  7  8  9  0  1  2  3  4  5&#xA;+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+&#xA;|                      ID                       |&#xA;+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+&#xA;|QR|   Opcode  |AA|TC|RD|RA|   Z    |   RCODE   |&#xA;+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+&#xA;|                    QDCOUNT                    |&#xA;+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+&#xA;|                    ANCOUNT                    |&#xA;+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+&#xA;|                    NSCOUNT                    |&#xA;+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+&#xA;|                    ARCOUNT                    |&#xA;+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;RFC-793 Tranmission Control Protocol contains the following diagram of a TCP packet header:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 0                   1                   2                   3&#xA; 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1&#xA;+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+&#xA;|          Source Port          |       Destination Port        |&#xA;+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+&#xA;|                        Sequence Number                        |&#xA;+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+&#xA;|                    Acknowledgment Number                      |&#xA;+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+&#xA;|  Data |           |U|A|P|R|S|F|                               |&#xA;| Offset| Reserved  |R|C|S|S|Y|I|            Window             |&#xA;|       |           |G|K|H|T|N|N|                               |&#xA;+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+&#xA;|           Checksum            |         Urgent Pointer        |&#xA;+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+&#xA;|                    Options                    |    Padding    |&#xA;+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+&#xA;|                             data                              |&#xA;+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Wouldn't it be useful if we could automate the parsing of data buffers into the various fields based on these diagrams?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Your job is to write code that can interpret these diagrams to parse a data buffer into the data fields.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Inputs will be a multi-line ASCII string following the format shown above, either an array of lines or a single string with linefeeds, and a data packet as an array of bytes.&lt;/li&gt;&#xA;&lt;li&gt;The input diagram includes the two initial rows that number the bit offsets (note that zeros in the first row may or may not be present).&lt;/li&gt;&#xA;&lt;li&gt;Bytes are in Big Endian (&amp;quot;network&amp;quot;) order&lt;/li&gt;&#xA;&lt;li&gt;Bit offsets are from MSb to LSb&lt;/li&gt;&#xA;&lt;li&gt;The number of bits per row will be a power of 2 and at least one octet (byte).  I.e. 8, 16, 32, 64.&lt;/li&gt;&#xA;&lt;li&gt;For this challenge a single field will not span bytes from one row to the next.&lt;/li&gt;&#xA;&lt;li&gt;Some cases will require multiple lines of input for a single row of bits to accommodate the field names.  Field names are concatenated from the data in the field column over multiple rows.  For example see the fourth row in the RFC-793 TCP packet header. Note when field name values butt up to the edge of the field, no space is inserted between the characters on consecutive rows, otherwise a single space is between the field name values on each row. See &amp;quot;Data Offset&amp;quot; vs. &amp;quot;ACK&amp;quot;.&lt;/li&gt;&#xA;&lt;li&gt;A single bit position could take two characters as in the ASCII diagram for the TCP packet header, or three as in the DNS query header. I.e. &lt;code&gt;+-+&lt;/code&gt; vs &lt;code&gt;+--+&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Output can be in decimal or hexadecimal with a '0x' prefix.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;p&gt;Example 1 - DNS Query Header&lt;/p&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-java prettyprint-override&quot;&gt;&lt;code&gt;String diagram = &amp;quot;&amp;quot;&amp;quot;&#xA;                                1  1  1  1  1  1&#xA;  0  1  2  3  4  5  6  7  8  9  0  1  2  3  4  5&#xA;+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+&#xA;|                      ID                       |&#xA;+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+&#xA;|QR|   Opcode  |AA|TC|RD|RA|   Z    |   RCODE   |&#xA;+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+&#xA;|                    QDCOUNT                    |&#xA;+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+&#xA;|                    ANCOUNT                    |&#xA;+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+&#xA;|                    NSCOUNT                    |&#xA;+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+&#xA;|                    ARCOUNT                    |&#xA;+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+&#xA;&amp;quot;&amp;quot;&amp;quot;;&#xA;byte [] data = { 0x00, 0x00, 0x84, 0x80, 0x00, 0x00, 0x00, 0x06, 0x00, 0x00, 0x00, 0x00 };&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output (in hexadecimal):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ID = 0x0&#xA;QR = 0x1&#xA;OpCode = 0x0&#xA;AA = 0x1&#xA;TC = 0x0&#xA;RD = 0x0&#xA;RA = 0x1&#xA;Z = 0x0&#xA;RCODE = 0x0&#xA;QDCOUNT = 0x0&#xA;ANCOUNT = 0x6&#xA;NSCOUNT = 0x0&#xA;ARCOUNT = 0x0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Example 2 - TCP Packet Header:&lt;/p&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-java prettyprint-override&quot;&gt;&lt;code&gt;String diagram = &amp;quot;&amp;quot;&amp;quot;&#xA; 0                   1                   2                   3&#xA; 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1&#xA;+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+&#xA;|          Source Port          |       Destination Port        |&#xA;+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+&#xA;|                        Sequence Number                        |&#xA;+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+&#xA;|                    Acknowledgment Number                      |&#xA;+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+&#xA;|  Data |           |U|A|P|R|S|F|                               |&#xA;| Offset| Reserved  |R|C|S|S|Y|I|            Window             |&#xA;|       |           |G|K|H|T|N|N|                               |&#xA;+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+&#xA;|           Checksum            |         Urgent Pointer        |&#xA;+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+&#xA;|                    Options                    |    Padding    |&#xA;+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+&#xA;|                             data                              |&#xA;+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+&#xA;&amp;quot;&amp;quot;&amp;quot;;&#xA;byte [] data = { 0xc0, 0x01, 0xa4, 0x74,&#xA;                 0x00, 0x00, 0x00, 0x02,&#xA;                 0x00, 0x00, 0x00, 0x01,&#xA;                 0x60, 0x10, 0x00, 0x04,&#xA;                 0x39, 0x3a, 0x00, 0x00,&#xA;                 0x00, 0x00, 0x00, 0x00,&#xA;                 0x01, 0x02, 0x03, 0x04 };&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output (in decimal):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Source Port = 49253&#xA;Destination Port = 42100&#xA;Sequence Number = 2&#xA;Acknowledgment Number = 1&#xA;Data Offset = 24&#xA;Reserved = 0&#xA;URG = 0&#xA;ACK = 1&#xA;PSH = 0&#xA;PST = 0&#xA;SYN = 0&#xA;FIN = 0&#xA;Window = 4&#xA;Checksum = 14650&#xA;Urgent Pointer = 0&#xA;Options = 0&#xA;Padding = 0&#xA;data = 16909060&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Understanding the tables:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+&#xA;|                      ID                       |&#xA;+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+&#xA;|QR|   Opcode  |AA|TC|RD|RA|   Z    |   RCODE   |&#xA;+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The above table section indicates that the 'ID' field is composed of the first 16-bits of the data packet (Big Endian), The 'QR' field is the high bit of the next byte, 'OpCode' comes from the next four highest bits of the same byte containing 'QR', The lower three bits of that byte contain the single-bit values for 'AA', 'TC', and 'RD'. 'RA' is the highest bit of the next byte, followed by 3-bits for 'Z'.  The lower four bits of that byte hold the value for 'RCODE'.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+&#xA;|  Data |           |U|A|P|R|S|F|                               |&#xA;| Offset| Reserved  |R|C|S|S|Y|I|            Window             |&#xA;|       |           |G|K|H|T|N|N|                               |&#xA;+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The above table has several fields whose field names could not fit within the table using only a single line for that row of bits.  There are nine fields in these 32 bits.  The upper four bits of the first byte is 'Data Offset', followed by six bits (the remaining four of the first byte, and the upper two bits of the next byte) for 'Reserved' (i.e. unused).  The lower six bits of the second byte are for the six one-bit fields 'URG', 'ACK', 'PSH', 'RST, 'SYN', and finally 'FIN'. 'Window' is a 16-bit value made from the following two bytes (Big Endian).&lt;/p&gt;&#xA;&lt;p&gt;i.e. pseudo code to unpack the data values for the above line:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-java prettyprint-override&quot;&gt;&lt;code&gt;Data_Offset = (data[0] &amp;amp; 0xf0) &amp;gt;&amp;gt; 4;&#xA;Reserved = ((data[0] &amp;amp; 0x0f) &amp;lt;&amp;lt; 2) + ((data[1] &amp;amp; 0xc0) &amp;gt;&amp;gt; 6);&#xA;URG = (data[1] &amp;amp; 0x20) &amp;gt;&amp;gt; 5;&#xA;ACK = (data[1] &amp;amp; 0x10) &amp;gt;&amp;gt; 4;&#xA;PSH = (data[1] &amp;amp; 0x08) &amp;gt;&amp;gt; 3;&#xA;RST = (data[1] &amp;amp; 0x04) &amp;gt;&amp;gt; 2;&#xA;SYN = (data[1] &amp;amp; 0x02) &amp;gt;&amp;gt; 1;&#xA;FIN = data[1] &amp;amp; 0x01;&#xA;Window = (data[2] &amp;lt;&amp;lt; 8) + data[3];&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The field names themselves come from concatenating the characters within each &amp;quot;box&amp;quot;. Where spaces are trimmed from both ends, and all other white space is collapsed to a single space. You may also use an underscore, a hyphen, or a dot ('_', '-', '.') instead of a space to separate words of a field name. You must use some separator between words, conversion to CamelCase or straight concatenation of words is not allowed.  You must not alter the case of the field names as it may be significant.&lt;/p&gt;&#xA;&lt;p&gt;The output must be printed or in the form of a single string that clearly pairs the field names and values.  Consider readability for humans.  I.e. a list of field names, followed by a list of values is NOT acceptable as this is too inconvenient for a human to find the right value for each field.  You may use one field per line and '=' as I have shown above, a two column table, a text format similar to JSON, CSV, etc.. There must be distinct delimiters between the name and the value and between different field-value pairings, e.g. I used &amp;quot;=&amp;quot; and newlines.  If you use a space between field name and field value, you must not use a space between words in the field name unless they are quoted or otherwise escaped so the output is unambiguous.&lt;/p&gt;&#xA;" OwnerUserId="111175" LastEditorUserId="111175" LastEditDate="2022-06-11T17:59:09.223" LastActivityDate="2022-06-11T17:59:09.223" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24862" PostTypeId="2" ParentId="2140" CreationDate="2022-06-10T02:41:21.093" Score="1" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/248531/104836&quot;&gt;Speed up, slowpoke!&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="104836" LastEditorUserId="104836" LastEditDate="2022-06-13T00:46:01.513" LastActivityDate="2022-06-13T00:46:01.513" CommentCount="19" ContentLicense="CC BY-SA 4.0" />
  <row Id="24864" PostTypeId="2" ParentId="2140" CreationDate="2022-06-10T13:50:21.863" Score="1" Body="&lt;h1&gt;Parenthetical names&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge is to build a program that puts parentheses around the 'title' part of names. For example, &lt;code&gt;Sonic the Hedgehog&lt;/code&gt; is converted to &lt;code&gt;Sonic (the Hedgehog)&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Rules:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Inputs will only contain words (alphabetical characters and spaces).&lt;/li&gt;&#xA;&lt;li&gt;Your program must be case insensitive.&lt;/li&gt;&#xA;&lt;li&gt;Leading and trailing &lt;code&gt;the&lt;/code&gt;s are ignored.&lt;/li&gt;&#xA;&lt;li&gt;With two &lt;code&gt;the&lt;/code&gt;s in a row, only the first is parenthesized.&lt;/li&gt;&#xA;&lt;li&gt;Nested &lt;code&gt;the&lt;/code&gt;s mean nested parentheses.&lt;/li&gt;&#xA;&lt;li&gt;Remaining &lt;code&gt;the&lt;/code&gt;s are skipped unless surrounded by spaces. For example, the &lt;code&gt;the&lt;/code&gt; in &lt;code&gt;their&lt;/code&gt; would not be parenthesized.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Test cases:&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;'the pig'               =&amp;gt; 'the pig'&#xA;'pig the'               =&amp;gt; 'pig the'&#xA;'pig hog'               =&amp;gt; 'pig hog'&#xA;'pig the hog'           =&amp;gt; 'pig (the hog)'&#xA;'the the pig'           =&amp;gt; 'the the pig'&#xA;'pig the hog pig        =&amp;gt; 'pig (the hog pig)'&#xA;'the pig the hog the'   =&amp;gt; 'the pig (the hog the)'&#xA;'pig the hog the pig'   =&amp;gt; 'pig (the hog (the pig))'&#xA;'the hog the pig'       =&amp;gt; 'the hog (the pig)'&#xA;'pig the the hog'       =&amp;gt; 'pig (the the hog)'&#xA;'hog their pig the hog' =&amp;gt; 'hog their pig (the hog)'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Inspired by this xkcd comic: &lt;a href=&quot;https://xkcd.com/2252/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://xkcd.com/2252/&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;code&gt;code-golf&lt;/code&gt;, so least number of bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="112268" LastActivityDate="2022-06-10T13:50:21.863" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24865" PostTypeId="2" ParentId="2140" CreationDate="2022-06-10T15:18:42.220" Score="1" Body="&lt;h1&gt;Am I winning at O-Tris?&lt;/h1&gt;&#xA;&lt;p&gt;O-Tris is a very, very, very simplified version of Tetris, which is defined as follows:&lt;/p&gt;&#xA;&lt;p&gt;There is a grid of cells that is 6 cells wide and 7 cells tall, known as the Playfield. Cells in the Playfield can be either Active, Inactive, or Empty.&lt;/p&gt;&#xA;&lt;p&gt;There is a construct called an O-piece, composed of 4 Active cells in a 2x2 arrangement. An O-piece will always exist somewhere in the Playfield, and two O-pieces cannot coexist.&lt;/p&gt;&#xA;&lt;p&gt;There are three commands, Left, Right, and Idle. No other commands exist.&lt;/p&gt;&#xA;&lt;p&gt;Gameplay is defined as follows:&lt;/p&gt;&#xA;&lt;p&gt;The user inputs a series of commands at the start of the game, which are stored. The Playfield is then initialized with all Empty cells save for a single O-piece in the top center, as shown the diagram below, where &lt;code&gt;.&lt;/code&gt; represents an Empty cell, &lt;code&gt;#&lt;/code&gt; represents an Inactive cell, and &lt;code&gt;O&lt;/code&gt; represents an Active cell:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;..OO..&#xA;..OO..&#xA;......&#xA;......&#xA;......&#xA;......&#xA;......&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Then, each command is processed one at a time. For each command, the following process occurs:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first step depends on which command is read;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the command is Left, no cell to the immediate left of an Active cell is Inactive, and no cell in the leftmost column of the Playfield is Active, then the rightmost two Active cells will become Empty, and the two Empty cells to the immediate left of each Active cell will become Active. (This is analogous to the O-piece moving left unless obstructed)&lt;/li&gt;&#xA;&lt;li&gt;If the command is Right, no cell to the immediate right of an Active cell is Inactive, and no cell in the rightmost column of the Playfield is Active, then the leftmost two Active cells will become Empty, and the two Empty cells to the immediate right of each Active cell will become Active. (This is analogous to the O-piece moving right unless obstructed)&lt;/li&gt;&#xA;&lt;li&gt;If the command was Idle, move directly to the next step.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Second step;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the two cells immediately below each the bottommost Active cells are Empty and within the Playfield, those two Empty cells will become Active and the topmost Active cells will become Empty. (This is analogous to the O-piece moving down if unobstructed)&lt;/li&gt;&#xA;&lt;li&gt;If not, the following subprocess occurs;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All Active cells will become Inactive.&lt;/li&gt;&#xA;&lt;li&gt;Any rows of cells within the Playfield that are are composed of only Inactive cells will be reset to be all Empty cells, and every row above that row will be translated downward, leaving a row of Empty cells at the top of the grid. &lt;strong&gt;(Meta: is this well stated?)&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;The game will attempt to place a new O-piece in the top center of the Playfield, satisfying the requirement that an O-piece always exist. If any of the 4 cells is Inactive, this will fail, and the game will enter a Loss state, inform the player that they have lost, and halt. Otherwise, continue to the next step.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Third step;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If there are any remaining commands, return to step one and continue by reading the next command.&lt;/li&gt;&#xA;&lt;li&gt;If no commands remain, the game will enter a Win state, inform the player that they have won, and halt.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Your challenge is to take a series of commands and return whether they would Win or Lose at O-Tris. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;Take a nonempty series of distinct values representing either the Left, Right, or Idle commands in any reasonable format. Assume no extraneous input.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Output one of two distinct values represent either a Win state or a Loss state. No other output is required.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;Using &lt;code&gt;L&lt;/code&gt; as Left, &lt;code&gt;R&lt;/code&gt; as Right, and &lt;code&gt;I&lt;/code&gt; as Idle, &lt;code&gt;1&lt;/code&gt; to indicate a Win state, and &lt;code&gt;0&lt;/code&gt; to indicate a Loss state.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;input =&amp;gt; output&#xA;L =&amp;gt; 1&#xA;LLLLLLLLLLLLLL =&amp;gt; 1&#xA;IIIIIIIIIII =&amp;gt; 1&#xA;IIIIIIIIIIII =&amp;gt; 0&#xA;IIIIIIIIIIIIILLL =&amp;gt; 0&#xA;LLIIIIRRIIIIIIIIIIIIIIIIIIIII =&amp;gt; 1&#xA;LLIIIIRRIIIIIIIIIIIIIIIIIIIIII =&amp;gt; 0&#xA;LLIIIIRRIIIILIIIRIIII =&amp;gt; 1&#xA;LLIIIIRRIIIILIIIRIIIIR =&amp;gt; 0&#xA;LLIIIIRRIIIILIIIRIIIRR =&amp;gt; 1&#xA;LLIIIIRRIIIILIIIRIIIRRII =&amp;gt; 0&#xA;LLIIIIRRIIIILIIIRIIIRRLLII =&amp;gt; 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;(Meta: more test cases probably, specifically one where lines are cleared with blocks above it and that clear saves the player from losing)&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;p&gt;Should I provide more diagrams? If so, where?&lt;/p&gt;&#xA;" OwnerUserId="107310" LastEditorUserId="107310" LastEditDate="2022-06-13T00:43:42.223" LastActivityDate="2022-06-13T00:43:42.223" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24866" PostTypeId="2" ParentId="2140" CreationDate="2022-06-10T23:43:03.170" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/248809/101306&quot;&gt;Gray coded gray code convertor&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="101306" LastEditorUserId="101306" LastEditDate="2022-06-19T15:40:12.273" LastActivityDate="2022-06-19T15:40:12.273" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="24868" PostTypeId="2" ParentId="2140" CreationDate="2022-06-11T04:28:11.990" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/248602/iteratively-delete-a-list/248604#248604&quot;&gt;Iteratively delete a list&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-06-14T07:02:02.770" LastActivityDate="2022-06-14T07:02:02.770" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24869" PostTypeId="2" ParentId="2140" CreationDate="2022-06-11T04:50:05.373" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/248752/is-it-a-heapable-sequence&quot;&gt;Is it a heapable sequence?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="103205" LastEditorUserId="103205" LastEditDate="2022-06-18T06:37:41.937" LastActivityDate="2022-06-18T06:37:41.937" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24870" PostTypeId="2" ParentId="2140" CreationDate="2022-06-11T05:10:04.560" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/248537/give-f-and-g-that-sometimes-commute&quot;&gt;Give f and g that sometimes commute&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="103205" LastEditorUserId="103205" LastEditDate="2022-06-13T04:39:19.973" LastActivityDate="2022-06-13T04:39:19.973" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="24871" PostTypeId="2" ParentId="2140" CreationDate="2022-06-11T17:42:08.957" Score="4" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/248648/56656&quot;&gt;Universal Unicode Clock&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-06-15T11:53:52.463" LastActivityDate="2022-06-15T11:53:52.463" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24872" PostTypeId="2" ParentId="2140" CreationDate="2022-06-11T21:48:51.773" Score="0" Body="&lt;h1&gt;Compute the cophenetic correlation coefficient&lt;/h1&gt;&#xA;&lt;p&gt;Meta question at the end.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Background&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The cophenetic correlation coefficient is used in bioinformatic to measure how close the distances of a tree are to the distances of the original distance matrix.&lt;/p&gt;&#xA;&lt;p&gt;It is defined as follows:&#xA;&lt;span class=&quot;math-container&quot;&gt;\${\displaystyle c={\frac {\sum _{i &amp;lt; j}(D_{ij}-{\bar {D}})(T_{ij}-{\bar {T}})}{\sqrt {\sum _{i &amp;lt; j}(D_{ij}-{\bar {D}})^{2}\sum _{i&amp;lt;j}(T_{ij}-{\bar {T}})^{2}}}}}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;More information:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Cophenetic_correlation&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://de.mathworks.com/help/stats/cophenet.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Mathworks&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://doi.org/10.2307/2412324&quot; rel=&quot;nofollow noreferrer&quot;&gt;Farris, (1969). On the Cophenetic Correlation Coefficient. SysZoo. 18.&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;D: CSV style-string to first matrix&lt;/li&gt;&#xA;&lt;li&gt;T: CSV style-string to second matrix&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The input have the following format:&lt;/p&gt;&#xA;&lt;p&gt;Eg 1: &lt;code&gt;D.dist&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;N31&#xA;B14A.0, 2.0&#xA;N20, 3.0, 4.1&#xA;N20S, 12.0, 23.9, 4.3&#xA;EES.0, 10.3, 19.0, 16.0, 17.0&#xA;S2.0, 201.1, 99.6, 233.0, 297.0, 281.00&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Eg. 2: &lt;code&gt;T.dist&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;N31&#xA;B14A.0, 1.7&#xA;N20, 3.9, 4.1&#xA;N20S, 32.0, 25.1, 4.3&#xA;EES.0, 12.3, 19.5, 16.1, 17.1&#xA;S2.0, 202.2, 105.6, 227.1, 281.1, 283.5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The first column is a for us uninteresting identifier, the values (floats) are separated by a &lt;code&gt;,&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The cophenetic correlation coefficient.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Using the two matrices from above:  0.9982682565&lt;/p&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;p&gt;Is it okay to use a file path as input? Or should I reformulate this question to input two matrices directly?&lt;/p&gt;&#xA;" OwnerUserId="113044" LastEditorUserId="113044" LastEditDate="2022-06-13T07:27:01.257" LastActivityDate="2022-06-13T07:27:01.257" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24873" PostTypeId="2" ParentId="2140" CreationDate="2022-06-12T00:13:49.837" Score="1" Body="&lt;h1&gt;Flatten from the inside out&lt;/h1&gt;&#xA;&lt;p&gt;Say we have a ragged list&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[ &#xA;  [1, 2],&#xA;  [3,&#xA;    [4, 5]&#xA;  ],&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And we want to flatten it by a layer, decreasing its depth by 1. We could flatten it from the outside:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1, 2, 3, [4, 5]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Or, we could flatten it from the inside.&lt;/p&gt;&#xA;&lt;p&gt;To do this, take all subarrays with maximal depth, and disperse each into its parent array. For example, with the array &lt;code&gt;[[1, 2],  [3, [4, 5]]]&lt;/code&gt;, the &lt;code&gt;[4, 5]&lt;/code&gt; has maximal depth, so the array becomes &lt;code&gt;[[1, 2], [3, 4, 5]]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to, given a list, flatten it from the inside by one level. The list will only contain nonnegative integers, and will not contain empty lists.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, shortest wins!&lt;/p&gt;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[1, 2], [3, [4, 5]]] -&amp;gt; [[1, 2], [3, 4, 5]]&#xA;[[6, 3, [1, 3, 4]], 4, [2, 3, 9, [5, 6]]] -&amp;gt; [[6, 3, 1, 3, 4], 4, [2, 3, 9, 5, 6]]&#xA;[[[3]], [4, [5]]] -&amp;gt; [[3], [4, 5]]&#xA;[[[[[[[[1]]]]]]]] -&amp;gt; [[[[[[[1]]]]]]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-06-12T00:27:31.537" LastActivityDate="2022-06-12T00:27:31.537" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24874" PostTypeId="2" ParentId="2140" CreationDate="2022-06-12T01:53:19.863" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/248753&quot;&gt;Truncate words in a sentence&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="97857" LastEditDate="2022-06-18T17:20:53.580" LastActivityDate="2022-06-18T17:20:53.580" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24875" PostTypeId="2" ParentId="2140" CreationDate="2022-06-12T02:14:39.793" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/248715/enumerate-all-pure-sets&quot;&gt;Enumerate all pure sets&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-06-17T07:08:25.717" LastActivityDate="2022-06-17T07:08:25.717" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24876" PostTypeId="2" ParentId="2140" CreationDate="2022-06-12T02:28:03.113" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/248690/is-it-a-valid-list&quot;&gt;Is it a valid list?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-06-16T20:34:38.133" LastActivityDate="2022-06-16T20:34:38.133" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24877" PostTypeId="1" CreationDate="2022-06-12T23:30:59.843" Score="0" ViewCount="56" Body="&lt;p&gt;&lt;strong&gt;Edit:&lt;/strong&gt; never mind, this seems to have been a temporary glitch - they're working fine now.&lt;/p&gt;&#xA;&lt;p&gt;Some of my old questions, such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69930/paint-starry-night-objectively-in-1kb-of-code&quot;&gt;Paint Starry Night, objectively, in 1kB of code&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/152856/write-moby-dick-approximately&quot;&gt;Write Moby Dick, approximately&lt;/a&gt; have large numbers of really great answers and still occasionally get answers today. I used to use the leaderboard snippet to keep track of the scores, but I found today that it's not working any more - no lists of scores come up when I run it.&lt;/p&gt;&#xA;&lt;p&gt;I didn't find a previous meta post about this. Has something changed that stops the snippet from working, and if so, is there a way it can be fixed?&lt;/p&gt;&#xA;" OwnerUserId="21034" LastEditorUserId="68942" LastEditDate="2022-06-14T04:26:12.000" LastActivityDate="2022-06-14T04:26:12.000" Title="Leaderboards (temporarily) not working any more" Tags="|support|status-norepro|leaderboard|" AnswerCount="0" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24878" PostTypeId="2" ParentId="2140" CreationDate="2022-06-13T14:24:56.903" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/248896&quot;&gt;Find the walls!&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-06-21T16:23:00.873" LastActivityDate="2022-06-21T16:23:00.873" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24879" PostTypeId="2" ParentId="2140" CreationDate="2022-06-13T15:44:55.680" Score="1" Body="&lt;h1&gt;Push some numbers&lt;/h1&gt;&#xA;&lt;p&gt;Given a list of integers, apply the following rules to each element:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If n is even, move it to the back.&lt;/li&gt;&#xA;&lt;li&gt;If n is odd, move it to the front.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Zero is considered even.&#xA;You may assume inputs are always non-negative.&lt;/p&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1,2,3] =&amp;gt; [3, 1, 2]&#xA;[0,1,2] =&amp;gt; [1,0,2]&#xA;(more test cases coming soon)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Shortest code wins!&lt;/p&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2022-06-22T11:53:28.517" LastActivityDate="2022-06-22T11:53:28.517" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24880" PostTypeId="2" ParentId="2140" CreationDate="2022-06-13T20:30:29.007" Score="0" Body="&lt;h1&gt;Don't like the middles&lt;/h1&gt;&#xA;&lt;p&gt;There will be no winner on these question. Just for the fun of the challenge.&lt;/p&gt;&#xA;&lt;p&gt;Your job will be to output every sequence of each 10 numbers, alternating between the evens and odds, but removing the middle number, which means all numbers terminating in 4 or 5 must not be generated.&lt;/p&gt;&#xA;&lt;p&gt;Here it goes exemplified for the first elements:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 2 6 8&#xA;1 3 7 9&#xA;10 12 16 18&#xA;11 13 17 19&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;It is not mandatory you need to pretty format or have a list of sub-lists as shown here. One list or a string where each element is clearly separated from the previous and the next ones is enough.&lt;/p&gt;&#xA;" OwnerUserId="29325" LastActivityDate="2022-06-13T20:30:29.007" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24881" PostTypeId="2" ParentId="2140" CreationDate="2022-06-14T06:13:21.597" Score="-1" Body="&lt;h1&gt;The prime frog  -- Integrated.&lt;/h1&gt;&#xA;&lt;p&gt;From the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/145741/the-prime-frog?rq=1&quot;&gt;original question&lt;/a&gt;, we make the following changes:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The &amp;quot;prime frog&amp;quot; is a strange animal that jumps between integers*&lt;s&gt;, until it arrives on 3 or 19...&lt;/s&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;s&gt;Your program should accept an integer &lt;code&gt;n&lt;/code&gt; as input and output the result of the below algorithm (&lt;code&gt;3&lt;/code&gt; or &lt;code&gt;19&lt;/code&gt;)&lt;/s&gt;&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For a given integers &lt;code&gt;n &amp;gt; 1&lt;/code&gt; and &lt;code&gt;b &amp;gt; 1&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Let &lt;code&gt;f&lt;/code&gt; be the position of the frog. It is initially set to &lt;code&gt;n&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;if &lt;strong&gt;&lt;code&gt;f&lt;/code&gt; has been hopped on: return the smallest lilypad hopped after and including the &lt;code&gt;f&lt;/code&gt; hopped on last time&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;if &lt;code&gt;f&lt;/code&gt; is prime : the frog jumps to the position &lt;strong&gt;&lt;code&gt;b×f+1&lt;/code&gt;&lt;/strong&gt;. Go back to step 2.&lt;/li&gt;&#xA;&lt;li&gt;if &lt;code&gt;f&lt;/code&gt; is composite : let &lt;code&gt;d&lt;/code&gt; be &lt;code&gt;f&lt;/code&gt;'s biggest prime divisor. The frog jumps to the position &lt;code&gt;f-d&lt;/code&gt;. Go back to step 2.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Examples:&lt;/h2&gt;&#xA;&lt;p&gt;An example with &lt;code&gt;n = 5&lt;/code&gt;, &lt;code&gt;b = 4&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;5 &amp;gt; 21 &amp;gt; 14 &amp;gt; 7 &amp;gt; 29 &amp;gt; 117 &amp;gt; 13x8 &amp;gt; 13x7 &amp;gt; 13x6 &amp;gt; 13x5 &amp;gt; 13x4 &amp;gt; 13x3 &amp;gt; 13x2 &amp;gt; 13 (I'm a bit lazy there) &amp;gt; 53 &amp;gt; 213 &amp;gt; 142 &amp;gt; 71 &amp;gt; 285 &amp;gt; 14x19 &amp;gt; 13x19 &amp;gt; snip &amp;gt; 38 &amp;gt; 19 &amp;gt; 77 &amp;gt; 66 &amp;gt; 55 &amp;gt; 44 &amp;gt; 33 &amp;gt; 22 &amp;gt; 11 &amp;gt; 45 &amp;gt; 40 &amp;gt; 35 &amp;gt; 28 &amp;gt; 21 (loop), returns 7. &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Thus the program should output &lt;code&gt;7&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Another example with &lt;code&gt;n = 23&lt;/code&gt;, &lt;code&gt;b = 3&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 23 &amp;gt; 70 &amp;gt; 63 &amp;gt; 56 &amp;gt; 49 &amp;gt; 42 &amp;gt; 35 &amp;gt; 28 &amp;gt; 21 &amp;gt; 14 &amp;gt; 7 &amp;gt; 22 &amp;gt; 11 &amp;gt; 34 &amp;gt; 17 &amp;gt; 52 &amp;gt; 39 &amp;gt; 26 &amp;gt; 13 &amp;gt; 40 &amp;gt; 35 (loop), returns 7. &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Again, the program should output &lt;code&gt;7&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&lt;p&gt;Coming up later&lt;/p&gt;&#xA;&lt;h1&gt;Meta: is it possible for a number to go up infinitely?&lt;/h1&gt;&#xA;" OwnerUserId="111945" LastEditorUserId="111945" LastEditDate="2022-06-14T06:24:24.060" LastActivityDate="2022-06-14T06:24:24.060" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24882" PostTypeId="2" ParentId="2140" CreationDate="2022-06-14T06:44:49.700" Score="2" Body="&lt;h1&gt;Interpret BigTalk&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/190819/talk-interpreter/&quot;&gt;Talk&lt;/a&gt; is a language which takes a single bit of input and has four commands:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;00&lt;/code&gt; If the accumulator is 0, set the accumulator to 0.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;01&lt;/code&gt; If the accumulator is 0, set the accumulator to 1.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;10&lt;/code&gt; If the accumulator is 1, set the accumulator to 0.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;11&lt;/code&gt; If the accumulator is 1, set the accumulator to 1.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;These can be interpreted as replacement commands. We're going to extend that concept to positive integers, and make the language more complicated.&lt;/p&gt;&#xA;&lt;p&gt;The language we're going to be defining is called BigTalk. It has an accumulator, which is a list of positive integers, initially set to only the input.&lt;/p&gt;&#xA;&lt;p&gt;Programs are a series of commands. Each command is a pair of lists of integers, like ([24, 2], [32, 1]), and means to replace the first as a sequence with the second, as many times as it occurs.&lt;/p&gt;&#xA;&lt;p&gt;The program runs repeatedly until the accumulator does not change. Finally, the accumulator is output.&lt;/p&gt;&#xA;&lt;p&gt;For example, with the input &lt;code&gt;[5, 5, 5, 5]&lt;/code&gt; and the program &lt;code&gt;([5, 5], [3, 2, 1]), ([3], [5]), ([2, 1, 5], [5, 1, 2])&lt;/code&gt;, the list goes:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[5, 5, 5, 5]&#xA;[3, 2, 1, 3, 2, 1]&#xA;[5, 2, 1, 5, 2, 1]&#xA;[5, 5, 1, 2, 2, 1]&#xA;[3, 2, 1, 1, 2, 2, 1]&#xA;[5, 2, 1, 1, 2, 2, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your challenge is to interpret this language. You may take input and program in any reasonable format.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, shortest wins!&lt;/p&gt;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&lt;p&gt;In the format of &lt;code&gt;input, commands&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[5, 5, 5, 5], ([5, 5], [3, 2, 1]), ([3], [5]), ([2, 1, 5], [5, 1, 2]) -&amp;gt; [5, 2, 1, 1, 2, 2, 1]&#xA;[4], ([4], [4, 4]) -&amp;gt; Infinite loop&#xA;[2, 19, 13], ([13, 19], [2]) -&amp;gt; [2, 19, 13]&#xA;[39, 1, 23], ([1], [39, 23]), ([39, 39], [1, 1]), ([23, 23], [1]) -&amp;gt; [39, 23, 39, 23, 39, 23]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This language may be Turing-complete, and I have a +50 bounty for someone who proves it either way.&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-06-21T20:47:07.760" LastActivityDate="2022-06-21T20:47:07.760" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24883" PostTypeId="2" ParentId="2140" CreationDate="2022-06-14T11:08:39.733" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/248796/extend-a-matrix-in-all-directions&quot;&gt;Extend a matrix in all directions&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-06-19T08:27:35.390" LastActivityDate="2022-06-19T08:27:35.390" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24885" PostTypeId="2" ParentId="2140" CreationDate="2022-06-15T08:30:07.297" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/248922/how-far-from-binary&quot;&gt;How far from binary?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="41723" LastEditDate="2022-06-22T08:36:01.523" LastActivityDate="2022-06-22T08:36:01.523" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24886" PostTypeId="2" ParentId="2140" CreationDate="2022-06-16T06:57:15.093" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/248820/create-bernard-from-desmos&quot;&gt;Create Bernard from Desmos&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96039" LastEditorUserId="96039" LastEditDate="2022-06-20T07:19:42.043" LastActivityDate="2022-06-20T07:19:42.043" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24889" PostTypeId="2" ParentId="2140" CreationDate="2022-06-17T14:01:57.023" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pattern-matching&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pattern-matching&amp;#39;&quot; rel=&quot;tag&quot;&gt;pattern-matching&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/turn-my-swag-on&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;turn-my-swag-on&amp;#39;&quot; rel=&quot;tag&quot;&gt;turn-my-swag-on&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Is This Loss?&lt;/h1&gt;&#xA;&lt;p&gt;Given two shapes &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt; in ASCII-art, determine if &lt;code&gt;A&lt;/code&gt; appears within &lt;code&gt;B&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;A shape &lt;code&gt;A&lt;/code&gt; appears in shape &lt;code&gt;B&lt;/code&gt; if there is a way to overlay shape &lt;code&gt;A&lt;/code&gt; onto shape &lt;code&gt;B&lt;/code&gt; without covering any spaces that &lt;code&gt;B&lt;/code&gt; is not already covering.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard I/O, any reasonable format etc. etc.&lt;/li&gt;&#xA;&lt;li&gt;Input will only contain two symbols of your choosing (as well as newlines) and can be assumed to be padded out / without any padding if necessary.&lt;/li&gt;&#xA;&lt;li&gt;Neither shape will ever be empty.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;Shape &lt;code&gt;A&lt;/code&gt; (will remain the same for the next few examples)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#       #&#xA;#       #  #&#xA;&#xA;#  #    #&#xA;#  #    # ###&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Shape(s) &lt;code&gt;B&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Truthy:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#       #&#xA;#       #  #&#xA;&#xA;#  #    #&#xA;#  #    # ###&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;###&#xA;  #       #######&#xA;  #       #######&#xA;  ###############&#xA;  ####    #######&#xA;  ####    #####&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;### #  # #### ### ### ###&#xA;#   #  # #  #  #  #   #&#xA;#   #### #  #  #  #   ###&#xA;#   #  # #  #  #  #   #&#xA;### #  # #### ### ### ###&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Falsy:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;    #       #&#xA; #  #       #&#xA;&#xA;    #    #  #&#xA;### #    #  #&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;# #&#xA;# # #&#xA;&#xA;# # #&#xA;# # # ###&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;# ####### #####&#xA;# ####### ## ##&#xA;###############&#xA;# ## #### #####&#xA;# ## #### #   #&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;### #    #  #&#xA;    #    #  #&#xA;&#xA; #  #       #&#xA;    #       #&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Non Loss example, for testing purposes:&lt;/h3&gt;&#xA;&lt;p&gt;Shape &lt;code&gt;A&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;####&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Shapes &lt;code&gt;B&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Truthy:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;# # # ###### # # #&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;#&#xA;##&#xA;###&#xA;####&#xA;#####&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Falsy:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;## ## &#xA; ### #&#xA;### # &#xA; # ###&#xA;# ### &#xA; ## ##&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Meta:&lt;/h1&gt;&#xA;&lt;p&gt;Should I define anything more rigorously or is this clear as day?&lt;/p&gt;&#xA;" OwnerUserId="107310" LastEditorUserId="107310" LastEditDate="2022-06-18T21:15:23.630" LastActivityDate="2022-06-18T21:15:23.630" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24890" PostTypeId="2" ParentId="23771" CreationDate="2022-06-18T12:32:19.680" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/egison/egison&quot; rel=&quot;nofollow noreferrer&quot;&gt;Egison&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Egison is a functional programming language featuring its expressive pattern-matching facility.&lt;/p&gt;&#xA;&lt;p&gt;Its pattern matching gives me a feeling of Mathematica. It can even matches against an infinite list. Here is an example of finding twin primes:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;def twinPrimes :=&#xA;  matchAll primes as list integer with&#xA;  | _ ++ $p :: #(p + 2) :: _ -&amp;gt; (p, p + 2)&#xA;&#xA;take 8 twinPrimes&#xA;-- [(3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43), (59, 61), (71, 73)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If you has &lt;a href=&quot;https://www.haskell.org/cabal/&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;cabal&lt;/code&gt;&lt;/a&gt;, you can install Egison with &lt;code&gt;cabal install egison&lt;/code&gt;, and install its interactive tutorial with &lt;code&gt;cabal install egison-tutorial&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/egison/egison&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://egison.readthedocs.io/en/latest/index.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Docs&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="9288" LastActivityDate="2022-06-18T12:32:19.680" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24891" PostTypeId="2" ParentId="2140" CreationDate="2022-06-18T17:36:54.667" Score="1" Body="&lt;h1&gt;Goroawase Numeric Substitution&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Japanese_wordplay#Goroawase&quot; rel=&quot;nofollow noreferrer&quot;&gt;Goroawase&lt;/a&gt; numeric substitution is a common form of Japanese wordplay where homophonous words are associated with a given series of numbers to associate a new meaning with that series. Your task is to take an input of a Japanese pronunciation and output a sequence of numbers from 1-10 which can be pronounced as the input in Japanese. For simplicity, only follow the table below.&lt;/p&gt;&#xA;&lt;h3&gt;Substitution Table&lt;/h3&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Number&lt;/th&gt;&#xA;&lt;th&gt;&lt;em&gt;Kun'yomi&lt;/em&gt; readings&lt;/th&gt;&#xA;&lt;th&gt;&lt;em&gt;On'yomi&lt;/em&gt; readings&lt;/th&gt;&#xA;&lt;th&gt;Transliterations from English readings&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;td&gt;maru, ma, wa&lt;/td&gt;&#xA;&lt;td&gt;rei, re&lt;/td&gt;&#xA;&lt;td&gt;ō/ou, zero, ze&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;hitotsu, hito, hi&lt;/td&gt;&#xA;&lt;td&gt;ichi, i&lt;/td&gt;&#xA;&lt;td&gt;wan&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;futatsu, fu, futa, ha&lt;/td&gt;&#xA;&lt;td&gt;ni, ji, aru&lt;/td&gt;&#xA;&lt;td&gt;tsu, tsū/tsuu, tū/tuu&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;td&gt;mittsu, mi&lt;/td&gt;&#xA;&lt;td&gt;san, sa, za&lt;/td&gt;&#xA;&lt;td&gt;su, surī/surii&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;td&gt;yon, yo, yottsu&lt;/td&gt;&#xA;&lt;td&gt;shi&lt;/td&gt;&#xA;&lt;td&gt;fō/fou, fā/faa, ho&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;5&lt;/td&gt;&#xA;&lt;td&gt;itsutsu, itsu, i&lt;/td&gt;&#xA;&lt;td&gt;go, ko&lt;/td&gt;&#xA;&lt;td&gt;faibu, faivu&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;6&lt;/td&gt;&#xA;&lt;td&gt;muttsu, mu&lt;/td&gt;&#xA;&lt;td&gt;roku, ro, ri, ra&lt;/td&gt;&#xA;&lt;td&gt;shikkusu&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;7&lt;/td&gt;&#xA;&lt;td&gt;nana, nanatsu, na&lt;/td&gt;&#xA;&lt;td&gt;shichi&lt;/td&gt;&#xA;&lt;td&gt;sebun, sevun&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;8&lt;/td&gt;&#xA;&lt;td&gt;yattsu, ya&lt;/td&gt;&#xA;&lt;td&gt;hachi, ha, ba&lt;/td&gt;&#xA;&lt;td&gt;eito&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;9&lt;/td&gt;&#xA;&lt;td&gt;kokonotsu, ko&lt;/td&gt;&#xA;&lt;td&gt;kyū/kyuu, ku&lt;/td&gt;&#xA;&lt;td&gt;nain&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;10&lt;/td&gt;&#xA;&lt;td&gt;tō/tou, to, ta&lt;/td&gt;&#xA;&lt;td&gt;ju, ji&lt;/td&gt;&#xA;&lt;td&gt;ten&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;&lt;sub&gt;(taken from the above link)&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input and output can be in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447&quot;&gt;any convenient format&lt;/a&gt;, but it should be possible to tell the difference between 1 0 and 10. You can choose to take input in hiragana/katakana.&lt;/li&gt;&#xA;&lt;li&gt;You can assume that the input will always be valid.&lt;/li&gt;&#xA;&lt;li&gt;For inputs that could have multiple possible outputs (such as i being 1 or 5), any is acceptable.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="91262" LastActivityDate="2022-06-18T17:36:54.667" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24892" PostTypeId="2" ParentId="2140" CreationDate="2022-06-19T00:44:33.117" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249143/doing-a-little-trolling-with-the-microwave-timer&quot;&gt;Enumerate the Microwave Timer&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2022-06-27T12:59:24.060" LastActivityDate="2022-06-27T12:59:24.060" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24894" PostTypeId="2" ParentId="2140" CreationDate="2022-06-19T14:32:28.573" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249373/draw-the-progress-pride-flag/&quot;&gt;Draw the Progress Pride flag&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="112857" LastEditorUserId="112857" LastEditDate="2022-07-01T19:59:28.747" LastActivityDate="2022-07-01T19:59:28.747" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24895" PostTypeId="2" ParentId="2140" CreationDate="2022-06-19T21:51:56.270" Score="1" Body="" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-08-08T12:07:04.700" LastActivityDate="2022-08-08T12:07:04.700" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24896" PostTypeId="2" ParentId="2140" CreationDate="2022-06-20T03:51:40.923" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/248849/backwards-hybrid-snake-kebab-camel-case&quot;&gt;backwardS_hybriD-snakE_kebaB-cameL_case&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-06-20T21:25:02.850" LastActivityDate="2022-06-20T21:25:02.850" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24897" PostTypeId="2" ParentId="2140" CreationDate="2022-06-20T06:28:55.247" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249085/flood-fill-by-distance&quot;&gt;Flood fill by distance&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-06-26T04:19:42.153" LastActivityDate="2022-06-26T04:19:42.153" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24898" PostTypeId="2" ParentId="2140" CreationDate="2022-06-20T12:51:51.917" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/249129&quot;&gt;Extract the word containing this index&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-06-27T07:18:47.183" LastActivityDate="2022-06-27T07:18:47.183" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24899" PostTypeId="1" AcceptedAnswerId="24900" CreationDate="2022-06-20T14:00:54.263" Score="14" ViewCount="172" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/reverse-engineering&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;reverse-engineering&amp;#39;&quot; rel=&quot;tag&quot;&gt;reverse-engineering&lt;/a&gt; has only two questions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/5595&quot;&gt;Reverse Engineer Polling Statistics&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/4321&quot;&gt;A small puzzle. Why does this code work the way it does?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The second one is closed as off-topic.&lt;/p&gt;&#xA;&lt;p&gt;The first one isn't really even to do with reverse engineering in the software related sense - it's basically &amp;quot;reverse engineering&amp;quot; in the same sense that subtracting two numbers is &amp;quot;reverse engineering&amp;quot; of adding two numbers.&lt;/p&gt;&#xA;&lt;p&gt;Its tag info is unhelpful:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;For challenges involving reverse engineering.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Reverse_engineering&quot; rel=&quot;nofollow noreferrer&quot;&gt;Reverse engineering&lt;/a&gt; is the process of figuring out how something works by analyzing it.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;So I propose we delete it.&lt;/p&gt;&#xA;&lt;p&gt;The only argument I can think of in favour of keeping it, is that it might be suitable for some &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/obfuscation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;obfuscation&amp;#39;&quot; rel=&quot;tag&quot;&gt;obfuscation&lt;/a&gt;-type questions - but there's already &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/obfuscation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;obfuscation&amp;#39;&quot; rel=&quot;tag&quot;&gt;obfuscation&lt;/a&gt; for that!&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="56656" LastEditDate="2022-06-23T08:32:32.903" LastActivityDate="2024-03-23T00:24:37.960" Title="We should reverse [reverse-engineering]" Tags="|discussion|status-completed|tags|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24900" PostTypeId="2" ParentId="24899" CreationDate="2022-06-20T14:21:53.790" Score="14" Body="&lt;h2&gt;Agreed, delete &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/reverse-engineering&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;reverse-engineering&amp;#39;&quot; rel=&quot;tag&quot;&gt;reverse-engineering&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;I think you make a solid case that the tag is currently not worth keeping: it is on a small number of questions, some of which are closed; the tag wiki info provides almost no usage guidance, and any that I could think of editing in would make the tag incredibly broad; and, overall, seems like the perfect target for some tag pruning.&lt;/p&gt;&#xA;&lt;p&gt;Given that it's only on two questions at the moment, it should be non-disruptive to just edit it out of the tags on those two, and let the tag Roomba delete it in the next week or so.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-06-20T14:21:53.790" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24901" PostTypeId="1" CreationDate="2022-06-20T15:43:36.037" Score="10" ViewCount="164" Body="&lt;p&gt;Some challenges have restrictions that apply to the program's source code, rather than the program's behaviour. These challenges are generally tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; or both.&lt;/p&gt;&#xA;&lt;p&gt;I have a vague idea of what the difference is in obvious cases (e.g. &amp;quot;write a program without using &lt;code&gt;e&lt;/code&gt;&amp;quot; is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;, &amp;quot;write a program that does something else when run backwards&amp;quot; is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt;), but there are plenty of cases which are somewhere in between, and I'm not sure where the boundary is (or what sort of challenges would fit in both). At the time of writing, the tag wikis don't really help clarify where the &amp;quot;edges&amp;quot; of the tags are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The stated requirement of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; (that there's a restriction on the source code) applies to all &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; challenges (even the least restricted-sourcey of these, the challenges where the program has to output some property of its source code, are still restricted in the sense that the program's source has to be written in a way that makes the program's output correct – in practice these programs are often written by sculpting the source to the output rather than the other way round).&lt;/li&gt;&#xA;&lt;li&gt;The stated requirement of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; (that the physical arrangement of characters in the source code matters) applies to all &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; challenges: if the source layout didn't matter, there'd be no way to define a restriction on it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I have a feeling that having two tags might be useful – there does seem to be some difference in nature between them – but at present, the usage is unclear, and the tags seem to be used inconsistently in practice (e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/160646/output-your-score&quot;&gt;this challenge&lt;/a&gt; is not &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; even though the number of the bytes in the source code has to match the program output).&lt;/p&gt;&#xA;&lt;p&gt;(Also to note: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/radiation-hardening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; rel=&quot;tag&quot;&gt;radiation-hardening&lt;/a&gt;, and its opposite &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pristine-programming&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pristine-programming&amp;#39;&quot; rel=&quot;tag&quot;&gt;pristine-programming&lt;/a&gt;, are also source-dependent types of challenge, but tend to not be tagged with either &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; nor &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt;, although they are sometimes. This means that challenges with a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pristine-programming&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pristine-programming&amp;#39;&quot; rel=&quot;tag&quot;&gt;pristine-programming&lt;/a&gt;-like requirement that doesn't match the tag exactly sometimes end up with no source-dependency tags at all. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-validating&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-validating&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-validating&lt;/a&gt; is a subset of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;, and was &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/24397&quot;&gt;originally intended to be used without it&lt;/a&gt;, but is sometimes used together with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; or even &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; in practice.)&lt;/p&gt;&#xA;&lt;p&gt;So my questions are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What is the intended difference between these tags, if any?&lt;/li&gt;&#xA;&lt;li&gt;Should we (and how should we) clarify the tag wikis in order to make the the difference clearer?&lt;/li&gt;&#xA;&lt;li&gt;Is it possible to maintain a distinction, or should the tags be merged on the basis that it's too difficult to tag challenges with the correct tag, and thus they aren't useful for differentiating two different types of source-dependent challenge?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76359" LastEditorUserId="97857" LastEditDate="2022-06-20T15:58:23.600" LastActivityDate="2022-06-21T20:05:14.333" Title="What's the difference between [source-layout] and [restricted-source]?" Tags="|discussion|support|tags|tag-synonyms|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24902" PostTypeId="2" ParentId="24901" CreationDate="2022-06-20T16:56:46.860" Score="8" Body="&lt;p&gt;First things first here's how I currently interpret these tags:&lt;/p&gt;&#xA;&lt;h2&gt;Restricted source&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; is pretty simple, there is black box function&lt;sup&gt;1&lt;/sup&gt; which can take the source of a program and &amp;quot;decides&amp;quot;.  If the decision fails your answer cannot be valid, if it passes your answer is subject to further conditions (i.e. doing some task).&lt;sup&gt;2&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;Some examples of restricted source are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The character &lt;code&gt;e&lt;/code&gt; must not appear in the source.&lt;/li&gt;&#xA;&lt;li&gt;For every pair of characters adjacent in your program the number of times each appears in your program must have opposite parity.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Some non examples of restricted source are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No builtins are allowed. (not a formal restriction)&lt;/li&gt;&#xA;&lt;li&gt;No recursion allowed. (not a formal restriction)&lt;/li&gt;&#xA;&lt;li&gt;Program must run without errors when reversed. (requires information other than the source )&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sup&gt;1: Usually this is computer decidable, but technically I suppose the property could be something that's not computer decidable but still objective and formally defined.&lt;/sup&gt;&#xA;&lt;br/&gt;&lt;sup&gt;2: There's a little bit of nuance here where &amp;quot;trivial&amp;quot; decisions procedures, e.g. procedures that eliminate nothing, or disallow only the empty program, don't count.&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Source layout&lt;/h2&gt;&#xA;&lt;p&gt;Source layout is the tough one. Based on the way I've seen it being used: Source layout for me means that there is some property that has to do with the arrangement of bytes / characters. Unlike &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; this property can be related to the behavior of the program or the compiler. As a rule of thumb, if making your program valid involves moving stuff around then it's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This makes it a very broad tag. &lt;em&gt;Most&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; falls under this umbrella.  The exception would be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; problems which only disallow specific characters, since these are not about arrangement; there's nowhere you can move an &lt;code&gt;e&lt;/code&gt; that makes it allowed.&lt;/p&gt;&#xA;&lt;p&gt;And I think this broadness makes it so it isn't applied very evenly and is often omitted when there is a more specific tag applicable.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;So yeah this is bad.  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; is an overly broad tag with inconsistent application as you have pointed out. However I do think it fills a useful niche.  I actually do browse &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; pretty frequently looking for challenges.  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/radiation-hardening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; rel=&quot;tag&quot;&gt;radiation-hardening&lt;/a&gt; etc. are fun but there is a lot of room for fun challenges that have a unique spin that doesn't fall under those tags.&lt;/p&gt;&#xA;&lt;p&gt;My proposal is as follows:  We define the tags in question roughly as follows (* indicates that this requires changing the wiki.)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;*: Some property objectively determined from source alone is required.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/radiation-hardening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; rel=&quot;tag&quot;&gt;radiation-hardening&lt;/a&gt;*: Your program must function and perform a specific task when it is damaged in a certain way.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pristine-programming&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pristine-programming&amp;#39;&quot; rel=&quot;tag&quot;&gt;pristine-programming&lt;/a&gt;: Requires answers to be a pristine program.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-validating&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-validating&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-validating&lt;/a&gt;: Programs must pass their own decision problem. Not to be used with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; as suggested by Bubbler.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-scoring&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-scoring&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-scoring&lt;/a&gt;: The scoring mechanism and the task required are the same.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Then we scale back &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; to catch all the scraps (By my estimations approximately 150 questions).  Just as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; means any challenge that isn't covered by a more specific scoring criterion, we would have a tag for challenges where the structure of the source code matters but isn't covered by any of the 5 tags above.  This gives a way to find these challenges but doesn't create a overly broad tag that's bound to be applied to too many challenges.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;For the sake of transparency, I have been working towards the silver badge in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; for a while now and I am quite close, so I do have a conflict of interest here.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2022-06-20T16:56:46.860" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24903" PostTypeId="2" ParentId="2140" CreationDate="2022-06-20T17:57:32.683" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/249194&quot;&gt;Nest some addition&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There's a natural follow-up with the other possible addition operator, where the order of application is reversed, i.e. &lt;span class=&quot;math-container&quot;&gt;\$\operatorname{add2}\overparen{\underparen a}\overparen{\underparen b} f=\left(\overparen{\underparen b} f\right)\circ\left(\overparen{\underparen a} f\right)\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="81203" LastEditorUserId="81203" LastEditDate="2022-06-28T05:21:21.107" LastActivityDate="2022-06-28T05:21:21.107" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="24904" PostTypeId="2" ParentId="24899" CreationDate="2022-06-20T19:44:32.150" Score="4" Body="&lt;h1&gt;Could be useful for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/programming-puzzles&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;programming-puzzles&amp;#39;&quot; rel=&quot;tag&quot;&gt;programming-puzzles&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Specifically, I've been thinking about ones that would require reverse-engineering how a language works in order to write a certain program in it. Not sure how good of a case this is for keeping it, since it can always be recreated if necessary, but it does seem like it could apply to some interesting and on-topic posts.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-06-20T19:44:32.150" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24905" PostTypeId="2" ParentId="24901" CreationDate="2022-06-21T20:05:14.333" Score="1" Body="&lt;h1&gt;Thoughts on how to objectively categorise this sort of challenge&lt;/h1&gt;&#xA;&lt;p&gt;After thinking about this for a while, I think there are three main sorts of source-dependent challenges that we have:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;There is a requirement on the source code that's independent of the rest of the task (apart from possibly being thematically linked to it); what the program has to do is the same regardless of the characters that make it up. This is a more restrictive version of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;, and also covers &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-validating&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-validating&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-validating&lt;/a&gt;. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/q/105781&quot;&gt;Print all ASCII alphanumeric characters without using them&lt;/a&gt; – although the requirement and task are thematically linked, they are conceptually independent of each other, and you could change either to something arbitrary and still have a meaningful challenge (e.g. &amp;quot;Print all ASCII alphanumeric characters&amp;quot; would be a viable challenge in its own right).&lt;/p&gt;&#xA;&lt;p&gt;As a side note, I've noticed that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; is also being used on challenges which ban programs that are longer than a given length (this is discouraged in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, but makes sense in &amp;quot;do as much as you can in X bytes&amp;quot; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;s). Although that technically falls into this category, it's different enough in nature that we might want to consider making a new tag for it (maybe even a new scoring criterion tag).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There is a requirement for the program to do something that depends on its own source code, i.e. the program's behaviour and source code must match in some way (and it's possible to create a match, completing the challenge, via changing the program's source or behaviour or both). Many of these challenges are covered by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; (e.g. &amp;quot;print your own source backwards&amp;quot; would be a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; challenge, despite not technically being a quine). However, some can be solved without the need for the source code to be able to even approximately reproduce itself, e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/q/12368&quot;&gt;Print every character your program doesn't have&lt;/a&gt;; the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-referential&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-referential&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-referential&lt;/a&gt; tag (which I hadn't even realised existed immediately before writing this answer) appears to exist for this.&lt;/p&gt;&#xA;&lt;p&gt;Often these tasks have a trivial solution in which a program's source code can be designed in such a way that it makes the task very easy, but the scoring system is typically designed so that this type of solution scores badly.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There is a requirement to, effectively, write multiple programs whose source codes are related in some way, with a task for each of those programs (which might be similar or the same). Special cases of this are &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/radiation-hardening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; rel=&quot;tag&quot;&gt;radiation-hardening&lt;/a&gt; (where the programs are the submission, together with all the programs formed via doing minor damage to the submission, and the task for all the programs is usually the same), and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pristine-programming&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pristine-programming&amp;#39;&quot; rel=&quot;tag&quot;&gt;pristine-programming&lt;/a&gt; (where the programs are the submission, together with all the programs formed by deleting substrings from it, and the task for the reduced programs is &amp;quot;produce an error&amp;quot;); arguably &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot;&gt;polyglot&lt;/a&gt; (where the programs are the same but in different languages) is also related. However, there are lots of more general problems that fall into this category, such as &lt;a href=&quot;https://codegolf.stackexchange.com/q/132558&quot;&gt;I double the source, you double the output!&lt;/a&gt;. The vast majority of existing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; challenges appear to fall into this category.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;(Have I missed any cases? Although these are objective definitions, I'm worried that there might be a challenge of this general nature that doesn't match any of them.)&lt;/p&gt;&#xA;&lt;p&gt;None of these categories are mutually exclusive. If a program has two restrictions on the source, one which is has an effect on the task and one which doesn't, it can be in categories 1 and 2. If we restrict two programs to match each other, and also some additional restriction that's independent of the task, that's in categories 1 and 3. And if the additional restriction affects how the task works, that's in categories 2 and 3. You can even imagine a task that fits into all three categories, e.g. &amp;quot;write a quine that's still a quine when reversed, but is not a palindrome&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;It's therefore tempting to decide &amp;quot;OK, let's tag these three categories as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-referential&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-referential&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-referential&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; respectively&amp;quot;. This would have three main effects:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt; would be narrowed somewhat in definition, but a quick check shows that it'd likely only affect a small proportion of the tag (although probably quite a large number in absolute terms). For some challenges, like &lt;a href=&quot;https://codegolf.stackexchange.com/q/160646&quot;&gt;Output your Score!&lt;/a&gt;, it appears at first that they wouldn't qualify (because the source restriction is intended as &amp;quot;you can't use any characters from the number in your output), but they still fall into the category because the restriction can be seen as &amp;quot;the program cannot contain any characters which match a digit from its byte count&amp;quot;, which is a restriction that could meaningfully be applied regardless of the task.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot;&gt;quine&lt;/a&gt; would be considered a special case of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-referential&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-referential&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-referential&lt;/a&gt;, rather than the other way round. This probably doesn't affect anything other than their tag wikis (although we would likely need to think about &amp;quot;proper quine rules&amp;quot; in the context of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-referential&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-referential&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-referential&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; would change the most, being removed from some challenges (e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/q/233916&quot;&gt;The Most Palindromy Code to Calculate Palindromy Numbers&lt;/a&gt; (this has no restriction at all, it's just &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-scoring&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-scoring&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-scoring&lt;/a&gt;) and its newest challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/248809/gray-coded-gray-code-convertor&quot;&gt;Gray coded Gray code convertor&lt;/a&gt; (this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;)), and added to others (e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/q/220236&quot;&gt;Alphabet printing challenge&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/q/220092&quot;&gt;Autogrammatic pairs&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I'm overall not sure whether these changes would be a net positive – it'd certainly make it easier to decide when to use which tag, but I'm not convinced that these categories are the most useful from a searching / &amp;quot;looking for challenges to answer&amp;quot; point of view, and the amount of retagging required would likely be quite disruptive. As such, this post isn't suggesting that we actually use these categories for a mass retagging effort – it's intended as more of a starting point to inspire other people who are thinking about the tags in question.&lt;/p&gt;&#xA;&lt;p&gt;One other possibility, which would likely be helpful regardless, would be to pull out common source restrictions into their own tags. For example, the above-mentioned restriction on program length doesn't really feel like it belongs in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot;&gt;restricted-source&lt;/a&gt;, and not all objective restrictions that try to get at the notion of &amp;quot;your program can't contain unnecessary code&amp;quot; fall into &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pristine-programming&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pristine-programming&amp;#39;&quot; rel=&quot;tag&quot;&gt;pristine-programming&lt;/a&gt; (and yet they don't conceptually feel like they belong in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; either). &amp;quot;Do not use digits / specific digits in your program&amp;quot; is also a special case, which comes up so often (possibly due to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/11082/76359&quot;&gt;one well-known broken window&lt;/a&gt;) that a tag for that restriction might actually be useful, if only so that people can choose to avoid it if they wish – its popularity likely exceeds the actual interest in working around that particular restriction, and a tag wiki talking about that sort of challenge in particular would probably be helpful.&lt;/p&gt;&#xA;" OwnerUserId="76359" LastActivityDate="2022-06-21T20:05:14.333" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24907" PostTypeId="2" ParentId="23771" CreationDate="2022-06-22T02:18:29.777" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/m-ender/retina&quot; rel=&quot;nofollow noreferrer&quot;&gt;Retina&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;A regex-based lang. Sometimes competitive with the golfiest langs-- what Retina does well, it does really well.&lt;/p&gt;&#xA;&lt;p&gt;Plus, solving problems with regex and string-rewriting is always fun!&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;Made by CGCC's very own &lt;a href=&quot;https://codegolf.stackexchange.com/users/8478/martin-ender&quot;&gt;Martin Ender&lt;/a&gt;, creator of &lt;a href=&quot;https://esolangs.org/wiki/Hexagony&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hexagony&lt;/a&gt;.&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="87594" LastActivityDate="2022-06-22T02:18:29.777" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24908" PostTypeId="2" ParentId="2140" CreationDate="2022-06-22T23:14:08.890" Score="0" Body="&lt;h1&gt;Perform division for fuzzy numbers&lt;/h1&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Given two positive &amp;quot;fuzzy&amp;quot; numbers (as defined below), perform division between them.&lt;/p&gt;&#xA;&lt;h2&gt;Definition&lt;/h2&gt;&#xA;&lt;p&gt;Here, a &lt;strong&gt;fuzzy number&lt;/strong&gt; consists of two integers: &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$r\$&lt;/span&gt;. It indicates that the number is from a measurement, and thus may carry an error. The measured number is &lt;span class=&quot;math-container&quot;&gt;\$n×2^r\$&lt;/span&gt;, and the maximum error is &lt;span class=&quot;math-container&quot;&gt;\$2^{r-1}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;In other words, the pair &lt;span class=&quot;math-container&quot;&gt;\$(n,r)\$&lt;/span&gt; indicates that the exact number can be any of those from &lt;span class=&quot;math-container&quot;&gt;\$n×2^r - 2^{r-1}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$n×2^r + 2^{r-1}\$&lt;/span&gt;. As per the rounding convention, the boundaries are inclusive if &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is even, and exclusive if &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is odd.&lt;/p&gt;&#xA;&lt;p&gt;In this challenge, only positive fuzzy numbers shall be considered. In other words, &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; shall be positive.&lt;/p&gt;&#xA;&lt;h2&gt;Operation&lt;/h2&gt;&#xA;&lt;p&gt;Here, the operation in concern is division. Performing &lt;span class=&quot;math-container&quot;&gt;\$(n_1,r_1) ÷ (n_2,r_2)\$&lt;/span&gt;, the exact result of division is within the range from &lt;span class=&quot;math-container&quot;&gt;\$(n_1×2^{r_1} - 2^{r_1-1})/(n_2×2^{r_2} + 2^{r_2-1})\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$(n_1×2^{r_1} + 2^{r_1-1})/(n_2×2^{r_2} - 2^{r_2-1})\$&lt;/span&gt;, where boundaries are inclusive if and only if both &lt;span class=&quot;math-container&quot;&gt;\$n_1\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$n_2\$&lt;/span&gt; are even.&lt;/p&gt;&#xA;&lt;p&gt;The range indicated by result &lt;span class=&quot;math-container&quot;&gt;\$(n,r)\$&lt;/span&gt; shall cover the range above as &lt;strong&gt;precisely&lt;/strong&gt; as possible. That is, &lt;span class=&quot;math-container&quot;&gt;\$r\$&lt;/span&gt; must be as small as possible. As a tiebreaker, the range must be as &lt;strong&gt;accurate&lt;/strong&gt; as possible. That is, &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; must be chosen so that &lt;span class=&quot;math-container&quot;&gt;\$n×2^r\$&lt;/span&gt; would be as near as possible to:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;½((n_1×2^{r_1} - 2^{r_1-1})/(n_2×2^{r_2} + 2^{r_2-1}) + (n_1×2^{r_1} + 2^{r_1-1})/(n_2×2^{r_2} - 2^{r_2-1})) \\ =(4n_1n_2+1)/(4n_2^2-1)×2^{r_1-r_2}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;For ranges with equal radii, those excluding boundaries shall be considered preciser than those including boundaries. This ensures uniqueness of the result.&lt;/p&gt;&#xA;&lt;h2&gt;Ungolfed solution&lt;/h2&gt;&#xA;&lt;p&gt;(WIP)&lt;/p&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2022-06-22T23:30:48.967" LastActivityDate="2022-06-22T23:30:48.967" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24910" PostTypeId="2" ParentId="2140" CreationDate="2022-06-23T22:58:47.703" Score="2" Body="&lt;h1&gt;Parse this handy graph format&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graph-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graph-theory&amp;#39;&quot; rel=&quot;tag&quot;&gt;graph-theory&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;There's a great number of ways to represent directed graphs like the following:&#xA;&lt;a href=&quot;https://i.stack.imgur.com/jpYzN.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/jpYzN.png&quot; alt=&quot;Three examples of directed graphs&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Most representations are tailored towards being easy to work with, either for humans (like the picture above) or for computers (like an &lt;a href=&quot;https://en.wikipedia.org/wiki/Adjacency_matrix&quot; rel=&quot;nofollow noreferrer&quot;&gt;adjacency matrix&lt;/a&gt; representation). A middle ground I found useful in the past is this format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;        A -&amp;gt; B &amp;lt;-&amp;gt; C                A -&amp;gt; B -&amp;gt; C -&amp;gt; A           A -&amp;gt; C -&amp;gt; D; B &amp;lt;-&amp;gt; C &amp;lt;-&amp;gt; E&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;It is basically a condensed edge list, which is still relatively close to a graphical representation (good for humans) but not too hard to parse for a computer.&lt;/p&gt;&#xA;&lt;p&gt;The goal in this challenge is to take a string representing a graph in this format as input and output a list of the graph's nodes and a list of the graph's edges.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so try to use as few bytes as possible in the language of your choice.&lt;/p&gt;&#xA;&lt;h3&gt;Input specification&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each &lt;em&gt;node&lt;/em&gt; has a unique name consisting of alphabetical letters, for example &lt;code&gt;A&lt;/code&gt;, &lt;code&gt;b&lt;/code&gt;, or &lt;code&gt;Node&lt;/code&gt;. It is also fine if you only support upper or lower case names.&lt;/li&gt;&#xA;&lt;li&gt;Three types of &lt;em&gt;arrows&lt;/em&gt; can appear: &lt;code&gt;-&amp;gt;&lt;/code&gt;, &lt;code&gt;&amp;lt;-&lt;/code&gt;, and &lt;code&gt;&amp;lt;-&amp;gt;&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A &lt;em&gt;chain&lt;/em&gt; is formed by a sequence starting with node and then alternating between arrows and nodes, for example &lt;code&gt;A -&amp;gt; B &amp;lt;- C&lt;/code&gt; or also just &lt;code&gt;A&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;A chain may be followed by another chain with &lt;code&gt;;&lt;/code&gt; as a separator in between.&lt;/li&gt;&#xA;&lt;li&gt;Between node names and the arrows and the semicolon can be any number of &lt;em&gt;spaces&lt;/em&gt; (including zero).&lt;/li&gt;&#xA;&lt;li&gt;Self-loops are possible, i.e., &lt;code&gt;A -&amp;gt; A&lt;/code&gt; describes an arrow from node &lt;code&gt;A&lt;/code&gt; to itself.&lt;/li&gt;&#xA;&lt;li&gt;You may assume the input string is a valid encoding of a graph.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Output specification&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The list of nodes can be returned or printed in any reasonable format and order, e.g., &lt;code&gt;A, B, C&lt;/code&gt;, &lt;code&gt;[&amp;quot;A&amp;quot;, &amp;quot;B&amp;quot;, &amp;quot;C&amp;quot;]&lt;/code&gt;, &lt;code&gt;A\nB\nC&lt;/code&gt;, ...&lt;/li&gt;&#xA;&lt;li&gt;Edges are represented as ordered tuples in any reasonable format, e.g., &lt;code&gt;(&amp;quot;A&amp;quot;, &amp;quot;B&amp;quot;)&lt;/code&gt; or &lt;code&gt;A B&lt;/code&gt; for the edge &lt;code&gt;A -&amp;gt; B&lt;/code&gt; and &lt;code&gt;(&amp;quot;D&amp;quot;, &amp;quot;C&amp;quot;)&lt;/code&gt; or &lt;code&gt;D C&lt;/code&gt; for the edge &lt;code&gt;C &amp;lt;- D&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The list of directed edges can again be output in any reasonable format.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;A -&amp;gt; B &amp;lt;-&amp;gt; C&amp;quot;               : [&amp;quot;A&amp;quot;, &amp;quot;B&amp;quot;, &amp;quot;C&amp;quot;], [(&amp;quot;A&amp;quot;, &amp;quot;B&amp;quot;), (&amp;quot;B&amp;quot;, &amp;quot;C&amp;quot;), (&amp;quot;C&amp;quot;, &amp;quot;B&amp;quot;)]&#xA;&amp;quot;A -&amp;gt; B -&amp;gt; C -&amp;gt; A&amp;quot;           : [&amp;quot;A&amp;quot;, &amp;quot;B&amp;quot;, &amp;quot;C&amp;quot;], [(&amp;quot;A&amp;quot;, &amp;quot;B&amp;quot;), (&amp;quot;B&amp;quot;, &amp;quot;C&amp;quot;), (&amp;quot;C&amp;quot;, &amp;quot;A&amp;quot;)]&#xA;&amp;quot;A -&amp;gt; C -&amp;gt; D; B &amp;lt;-&amp;gt; C &amp;lt;-&amp;gt; E&amp;quot; : [&amp;quot;A&amp;quot;, &amp;quot;B&amp;quot;, &amp;quot;C&amp;quot;, &amp;quot;D&amp;quot;, &amp;quot;E&amp;quot;], [(&amp;quot;A&amp;quot;, &amp;quot;C&amp;quot;), (&amp;quot;C&amp;quot;, &amp;quot;D&amp;quot;), (&amp;quot;B&amp;quot;, &amp;quot;C&amp;quot;), (&amp;quot;C&amp;quot;, &amp;quot;B&amp;quot;), (&amp;quot;C&amp;quot;, &amp;quot;E&amp;quot;), (&amp;quot;E&amp;quot;, &amp;quot;C&amp;quot;)]&#xA;&amp;quot;AA&amp;lt;-&amp;gt;BB&amp;quot;                    : [&amp;quot;AA&amp;quot;, &amp;quot;BB&amp;quot;], [(&amp;quot;AA&amp;quot;, &amp;quot;BB&amp;quot;), (&amp;quot;BB&amp;quot;, &amp;quot;AA&amp;quot;)]&#xA;&amp;quot;A;B&amp;quot;                        : [&amp;quot;A&amp;quot;, &amp;quot;B&amp;quot;], []&#xA;&amp;quot; &amp;quot;                          : [], []&#xA;&amp;quot;   A   &amp;lt;- B  ;  C  &amp;quot;        : [&amp;quot;A&amp;quot;, &amp;quot;B&amp;quot;, &amp;quot;C&amp;quot;], [(&amp;quot;B&amp;quot;, &amp;quot;A&amp;quot;)]&#xA;&amp;quot;A -&amp;gt; A; B &amp;lt;- B&amp;quot;             : [&amp;quot;A&amp;quot;, &amp;quot;B&amp;quot;], [(&amp;quot;A&amp;quot;, &amp;quot;A&amp;quot;), (&amp;quot;B&amp;quot;, &amp;quot;B&amp;quot;)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h4&gt;Sandbox question:&lt;/h4&gt;&#xA;&lt;p&gt;Given that this is foremost a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt; question, I'm tempted to drop the validity assumption and require answers to raise an error if the input does not follow the spec. What do you think, would that still be fun?&lt;/p&gt;&#xA;" OwnerUserId="56433" LastActivityDate="2022-06-23T22:58:47.703" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24912" PostTypeId="2" ParentId="2140" CreationDate="2022-06-25T00:53:37.180" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249152/not-roman-numeral-addition&quot;&gt;Not-Roman-Numeral Addition&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2022-06-27T13:23:27.073" LastActivityDate="2022-06-27T13:23:27.073" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24913" PostTypeId="1" AcceptedAnswerId="24920" CreationDate="2022-06-25T08:15:27.130" Score="13" ViewCount="217" Body="&lt;p&gt;Currently &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990/&quot;&gt;our consensus&lt;/a&gt; is that incorrect solutions should be deleted.&lt;/p&gt;&#xA;&lt;p&gt;However it's not clear if this applies to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions are sometimes a bit like regular code-golf challenges, but usually it's more like Q&amp;amp;A. SE sites that are Q&amp;amp;A (to my knowledge) don't have moderators delete incorrect answers.  They just let users downvote them.  Deletion by moderator is reserved for spam, harassment or just pure nonsense.&lt;/p&gt;&#xA;&lt;p&gt;So the question is:  What policy to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; answers fall under?  Are they required to be correct like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; solutions?  Or should &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; work like Q&amp;amp;A on Stack Exchange and wrong answers can stay?&lt;/p&gt;&#xA;&lt;p&gt;As an example &lt;a href=&quot;https://codegolf.stackexchange.com/a/80043/56656&quot;&gt;here&lt;/a&gt; is an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; answer which is not correct.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-06-29T08:02:22.507" LastActivityDate="2022-06-29T08:02:22.507" Title="Do we delete invalid tips?" Tags="|discussion|moderation|tips|deleted-answers|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24914" PostTypeId="2" ParentId="24913" CreationDate="2022-06-25T09:31:18.887" Score="4" Body="&lt;h2&gt;Yes, demonstrably invalid tips should be deleted&lt;/h2&gt;&#xA;&lt;p&gt;Note the distinction between a &amp;quot;valid, but not very good&amp;quot; tip and a &amp;quot;demonstrably invalid&amp;quot; tip. The first is what downvotes are for, the second should be deleted.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I believe we should have a consistent rules set for all answers on the site, and one of those rules should be &amp;quot;If an answer can be shown to fail to satisfy the conditions set in the question, it should be deleted&amp;quot;. For &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions, those conditions are generally&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your answer should be shorter than the original provided sample, and&lt;/li&gt;&#xA;&lt;li&gt;Your answer should perform identically to the provided sample.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Therefore, if an answer to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; challenge doesn't shorten the provided code, and if it doesn't perform the same task as asked for, it's invalid, and should be deleted, just the same as any other invalid answer on the site.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-06-25T09:31:18.887" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24915" PostTypeId="2" ParentId="2140" CreationDate="2022-06-25T09:53:38.180" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249186/fix-my-fizzbuzz&quot;&gt;Fix my FizzBuzz&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="92689" LastEditDate="2022-06-28T03:12:35.730" LastActivityDate="2022-06-28T03:12:35.730" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24916" PostTypeId="2" ParentId="2140" CreationDate="2022-06-25T10:01:59.560" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249235/is-it-shuffled-fizzbuzz&quot;&gt;Is it shuffled FizzBuzz?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-06-29T01:01:47.163" LastActivityDate="2022-06-29T01:01:47.163" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24917" PostTypeId="2" ParentId="2140" CreationDate="2022-06-25T10:20:29.980" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249107/ro1000an-nu1000era50-en100o501ng&quot;&gt;ro1000an nu1000era50 en100o501ng&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2022-06-27T00:27:28.213" LastActivityDate="2022-06-27T00:27:28.213" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24919" PostTypeId="2" ParentId="2140" CreationDate="2022-06-26T02:45:16.710" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249463/implement-binary-exponentiation&quot;&gt;Implement Binary Exponentiation&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96039" LastEditorUserId="96039" LastEditDate="2022-07-03T02:17:12.690" LastActivityDate="2022-07-03T02:17:12.690" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24920" PostTypeId="2" ParentId="24913" CreationDate="2022-06-26T06:02:13.600" Score="8" Body="&lt;h2&gt;Yes if the answer is unfixable, because deleting unfixable, objectively incorrect, answers to questions would be beneficial even on Stack Overflow&lt;/h2&gt;&#xA;&lt;p&gt;(Note: this post is only about answers that are demonstrably, objectively, incorrect, and that inherently can't be fixed to be correct. With fixable answers, fixing them is obviously preferable to deleting them, unless the fix would cause them to become a duplicate; and with answers whose correctness is subjective, the correct response is often to close the question.)&lt;/p&gt;&#xA;&lt;p&gt;Stack Exchange, in general, has a policy of not deleting incorrect answers to questions. I think that, assuming that the site has enough moderation power to delete answers discovered to be incorrect, this is a mistake for Q&amp;amp;A sites in general. (It's possible that the reason that Stack Overflow doesn't delete incorrect answers is that there isn't enough moderation power to determine which answers are incorrect and delete them, but our community shouldn't have that problem.)&lt;/p&gt;&#xA;&lt;p&gt;The normal assumption made by the Stack Exchange software is that &amp;quot;The best answers are voted up and rise to the top&amp;quot;. But the meaning of &amp;quot;best&amp;quot; is a bit fluid here, and in particular, it's rare for people to use their votes as a referendum on whether an answer is correct or not. An upvote does not, in practice, mean &amp;quot;I'm sure that this answer is correct&amp;quot;; rather, people upvote because they find an answer funny, or thought-provoking, or because it made them feel like it taught them something, or because it's well-written, or because it looks like a lot of effort went into it. None of these are necessarily an indicator that the information in a post is correct – in particular, a post can be incorrect and still get upvoted by the majority of voters.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, on Code Golf in particular, the majority of our questions hit HNQ, which means that if an answer is posted early, the majority of people who see it will be people from outside the site, who are able to upvote but not downvote. Additionally, the visitors from outside will generally be less equipped to determine whether the post is correct or not than the site regulars would be – they are quite likely to upvote an incorrect post due to not realising that it's incorrect.&lt;/p&gt;&#xA;&lt;p&gt;As an example, when I posted &lt;a href=&quot;https://codegolf.stackexchange.com/a/110584&quot;&gt;this answer&lt;/a&gt;, I was confident that it would gain a score of 100+, and my prediction was correct. The answer is correct, but how many of those 137 voters do you think a) know Brachylog and/or b) checked enough of the Brachylog documentation to determine that it was a valid answer to the question? Probably not very many of them; so if I had hypothetically posted an incorrect answer instead, the answer would have received upvotes at pretty much the same rate until someone who knew the language turned up and commented that the answer was wrong (at which point it would likely stabilise at a fairly high positive score if not deleted). Although that answer isn't &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt;, I don't see any particular reason why &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; answers would be different in this regard.&lt;/p&gt;&#xA;&lt;p&gt;As another example (using a Stack Exchange site with a more normal Q&amp;amp;A format), I found an HNQ on Chess Stack Exchange for which the top answer was wrong, and voted to +8 or so (because it was interesting). I was able to persuade the author to delete it by posting a comment demonstrating the mistake in the comments, but I suspect it had a positive score at the time it was deleted. If the author hadn't been around to delete the post, this could have developed into quite an issue, because nobody else could delete it either (and arguably, by Stack Exchange deletion guidelines, the author was wrong to delete the post!).&lt;/p&gt;&#xA;&lt;p&gt;This means that in practice, Stack Exchange doesn't have a reliable &amp;quot;this is wrong&amp;quot; signal – about the closest you can get is upvotes on a comment stating that the post is incorrect. In particular, that means that the software can't identify answers as incorrect; if the answer is upvoted, it will be treated as correct by the software, meaning that it will give reputation to its author, be sorted high when sorting by votes, and the like.&lt;/p&gt;&#xA;&lt;p&gt;Deleting incorrect answers fixes all these issues, and has no obvious downside (other than the difficulty of determining that the answer is incorrect and is unfixable, but we already go to that trouble with non-&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; questions). An unfixably incorrect answer is kind-of embarrassing for everyone involved; it makes the author look bad, and it makes the site look bad, and it can mislead readers if they miss the comment stating that it's incorrect (or if they believe the post author over the commentor – &amp;quot;this is incorrect&amp;quot; comments are sometimes themselves incorrect). Deleting such an answer basically sets things back to the state they'd have been in if the answer had never existed, which is probably best for everyone.&lt;/p&gt;&#xA;&lt;p&gt;Such a deletion policy would therefore probably be helpful for all Stack Exchange sites (even the Q&amp;amp;A-oriented ones, which is basically what &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot;&gt;tips&lt;/a&gt; is). Code Golf isn't an exception – it's atypical in some ways (high community moderation power, very high HNQ/non-HNQ ratio, lack of review audits), but those differences imply that deleting incorrect answers should be an even better policy here than it would be on Stack Exchange globally, and it would probably be a beneficial policy even on Stack Exchange globally. (I agree that this &lt;em&gt;isn't&lt;/em&gt; the policy on Stack Exchange globally, but think that that's a mistake.)&lt;/p&gt;&#xA;" OwnerUserId="76359" LastActivityDate="2022-06-26T06:02:13.600" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24921" PostTypeId="2" ParentId="2140" CreationDate="2022-06-26T15:34:52.583" Score="1" Body="&lt;h1&gt;Photosynthesis &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot;&gt;python&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/hRCOt.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/hRCOt.png&quot; alt=&quot;Nearly finished game&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Flavor text&lt;/h2&gt;&#xA;&lt;p&gt;You, a algae spore, have recently evolved the ability to walk. However, 3 others have just done the same thing. Can you use this new ability to your advantage and conquer the Petri dish?&lt;/p&gt;&#xA;&lt;h2&gt;Game rules&lt;/h2&gt;&#xA;&lt;p&gt;The game is played on a 15 by 15 grid with one bot starting in each corner. The goal of the game is to occupy more squares than your competitors.&lt;/p&gt;&#xA;&lt;p&gt;Each turn, each tile can perform one of 3 moves:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Stay (Example: &lt;code&gt;[2] [ ] -&amp;gt; [3] [ ]&lt;/code&gt;) Do nothing but gain one &lt;code&gt;stack&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Move (Example: &lt;code&gt;[2] [ ] -&amp;gt; [ ] [2]&lt;/code&gt;) Move one space horizontally or vertically. Stack stays the same. Space must be unoccupied and no other tile must be moving or splitting to the destination.&lt;/li&gt;&#xA;&lt;li&gt;Split (Example: &lt;code&gt;[3] [ ] -&amp;gt; [1] [2]&lt;/code&gt;) Move half of &lt;code&gt;stack&lt;/code&gt; to a adjacent square. Space must be free and no other tile must be splitting or moving to the destination. If &lt;code&gt;stack&lt;/code&gt; is odd the destination gets the extra half stack.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Game continues till all squares are owned or if &lt;code&gt;15 x 15 x 4&lt;/code&gt; turns have passed.&lt;/p&gt;&#xA;&lt;p&gt;At most 5 obstacles per corner will be randomly placed on the board. They will be symmetrically placed so the map looks identical from each bots perspective. They will never be placed along the edge. There might be less than 5 obstacles if multiple happen to spawn at the same position. Example:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/kiqEx.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/kiqEx.png&quot; alt=&quot;Blank game board&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Tournament rules&lt;/h2&gt;&#xA;&lt;p&gt;In the tournament each pair of bots will play each-other at least twice. Exact format subject to change.&lt;/p&gt;&#xA;&lt;p&gt;Every win gives you 3 ranking points, 2nd place gives you 2 ranking points, 3rd place 1 ranking point, and 4th 0 ranking points. The bot with the highest average ranking points wins. (Since by necessity some bots may play 1 game more or less than each other)&lt;/p&gt;&#xA;&lt;h2&gt;Controller&lt;/h2&gt;&#xA;&lt;p&gt;Controller can be found here &lt;a href=&quot;https://codeberg.org/Mousetail/Photosynthesis/src/branch/master&quot; rel=&quot;nofollow noreferrer&quot;&gt;(TBD)&lt;/a&gt; Note: I intend to delete all the example bots except &lt;code&gt;expand_bot&lt;/code&gt; and &lt;code&gt;move_expand_bot&lt;/code&gt; before the challenge is posted.&lt;/p&gt;&#xA;&lt;h3&gt;Example bot:&lt;/h3&gt;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;import data&#xA;&#xA;def expand_downwards(grid: data.Grid) -&amp;gt; list[data.Action]:&#xA;    # Bot always starts at [0, 0] from it's own perspective&#xA;    actions = []&#xA;    for x, y in grid:&#xA;        if grid[x, y].owner == 0: # You are always player 0&#xA;            # If I can't split&#xA;            if grid[x, y].stack &amp;lt; 2 or grid[x, y+1].owner is not None:&#xA;                actions.append(&#xA;                    data.Action(action_type=data.ActionType.stay, source=(x,y))&#xA;                )&#xA;            else:&#xA;                # If we can split, split down&#xA;                actions.append(&#xA;                        data.Action(&#xA;                            action_type=data.ActionType.split,&#xA;                            source=cell,&#xA;                            destination=(x, y+1),&#xA;                        )&#xA;                )&#xA;               &#xA;    return actions&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Do's and dont's&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Please&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use a single top-level function. Makes it easier to automatically import bots.&lt;/li&gt;&#xA;&lt;li&gt;Function name must be &lt;code&gt;snake_case&lt;/code&gt; and include the word &lt;code&gt;bot&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Typehint your program. This allows me to automatically check if you are following some of the rules.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Don't&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use randomness, though you can use a seeded RNG if you like&lt;/li&gt;&#xA;&lt;li&gt;Print anything&lt;/li&gt;&#xA;&lt;li&gt;Take a excessively long time on your turn. Polynominal time algorithms only please.&lt;/li&gt;&#xA;&lt;li&gt;Access the filesystem, networking, or any other side effects&lt;/li&gt;&#xA;&lt;li&gt;Keep state between games. Keeping state between round of the same game is allowed. Precomputing things for performance is also allowed.&lt;/li&gt;&#xA;&lt;li&gt;Submit a bot with no other purpose than to help/hurt one specific other bot&lt;/li&gt;&#xA;&lt;li&gt;Exploit the controller&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2022-06-29T06:34:43.703" LastActivityDate="2022-06-29T06:34:43.703" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24922" PostTypeId="2" ParentId="2140" CreationDate="2022-06-26T21:03:12.100" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249343/bloons-td-6-upgrade-paths&quot;&gt;Bloons TD 6 Upgrade Paths&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="17360" LastEditorUserId="17360" LastEditDate="2022-06-30T17:22:41.803" LastActivityDate="2022-06-30T17:22:41.803" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24924" PostTypeId="2" ParentId="2140" CreationDate="2022-06-27T09:13:31.277" Score="4" Body="&lt;h1&gt;Word stays a word after taking away a letter&lt;/h1&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249403/word-stays-a-word-after-taking-away-a-letter&quot;&gt;Posted here&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="96037" LastEditorUserId="96037" LastEditDate="2022-07-01T18:24:34.450" LastActivityDate="2022-07-01T18:24:34.450" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24925" PostTypeId="2" ParentId="2140" CreationDate="2022-06-27T13:01:49.437" Score="3" Body="&lt;h1&gt;Change the Temperature of Swatchlings&lt;/h1&gt;&#xA;&lt;h2&gt;Warning: Contains Deltarune Chapter 2 Spoilers&lt;/h2&gt;&#xA;&lt;h2&gt;Summary&lt;/h2&gt;&#xA;&lt;p&gt;Your challenge today is to determine the minimum number of turns needed to&#xA;change the temperatures of an arbitrary amount of Swatchlings to all be the same.&lt;/p&gt;&#xA;&lt;h2&gt;Context&lt;/h2&gt;&#xA;&lt;p&gt;In the second chapter of &lt;a href=&quot;https://deltarune.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Deltarune&lt;/a&gt;, there are enemies you encounter that are called &lt;a href=&quot;https://deltarune.fandom.com/wiki/Swatchling&quot; rel=&quot;nofollow noreferrer&quot;&gt;Swatchlings&lt;/a&gt; (suit-wearing butler-like characters that serve the main antagonist of the chapter). These enemies always appear in battle in groups with at least one outlier in terms of suit color&lt;sup&gt;&lt;a href=&quot;https://deltarune.fandom.com/wiki/Swatchling#Strategy&quot; rel=&quot;nofollow noreferrer&quot;&gt;source&lt;/a&gt;&lt;/sup&gt;. Swatchlings are defeated by making &lt;em&gt;all&lt;/em&gt; Swatchlings in the group have the same suit colour.&lt;/p&gt;&#xA;&lt;p&gt;Each Swatchling's color can be changed in stages, either becoming warmer (redder) or colder (bluer). While there are only five colours in the actual game, for this challenge, there will be an infinite amount, represented by positive integers.&lt;/p&gt;&#xA;&lt;p&gt;During each turn of a battle, there are 3 ways to change the temperature of a&#xA;Swatchling: increasing/decreasing the temperature by 2 stages, increasing the temperature by 1 stage or decreasing the temperature by 1 stage. You may perform up to 3 of these actions per turn, and no action twice in a turn.&lt;/p&gt;&#xA;&lt;h2&gt;Task and Worked Example&lt;/h2&gt;&#xA;&lt;p&gt;Given a list of Swatchling temperatures, determine the minimal number of turns needed to change the temperatures of all Swatchlings to be the same. Note that&lt;/p&gt;&#xA;&lt;p&gt;For example, given the following temperatures:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1, 5, 5]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The optimal solution would be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Turn 1:&#xA;Increase Swatchling #1 by 2 stages: [3, 5, 5]&#xA;&#xA;Turn 2:&#xA;Increase Swatchling #1 by 2 stages: [5, 5, 5]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Meaning a minimum of 2 turns are needed to change the temperatures of all Swatchlings to be the same.&lt;/p&gt;&#xA;&lt;p&gt;Another example is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1, 5, 3, 4, 4, 2, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;One optimal solution might be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Turn 1:&#xA;Increase Swatchling #1 by 2 stages: [3, 5, 3, 4, 4, 2, 1]&#xA;Decrease Swatchling #4 by 1 stage: [3, 5, 3, 3, 4, 2, 1]&#xA;Increase Swatchling #6 by 1 stage: [3, 5, 3, 3, 4, 3, 1]&#xA;&#xA;Turn 2:&#xA;Decrease Swatchling #2 by 2 stages: [3, 3, 3, 3, 4, 3, 1]&#xA;Decrease Swatchling #5 by 1 stage: [3, 3, 3, 3, 3, 3, 1]&#xA;&#xA;Turn 3:&#xA;Increase Swatchling #7 by 2 stages: [3, 3, 3, 3, 3, 3, 3]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Meaning a minimum of 2 turns are needed to change the temperatures of all Swatchlings to be the same.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input will be a list of positive integers representing the temperatures of each Swatchling. The list will contain at least one Swatchling.&lt;/li&gt;&#xA;&lt;li&gt;Output will be an integer representing the minimum number of turns needed to change the temperatures of all Swatchlings to be the same.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1, 5, 5] =&amp;gt; 2&#xA;[1, 2, 5] =&amp;gt; 1&#xA;[1, 5, 3, 4, 4, 2, 1] =&amp;gt; 3&#xA;[1, 7] =&amp;gt; 2&#xA;[1, 10, 3] =&amp;gt; 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;As this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, the aim of the game is to get y'all's byte count as&#xA;low as possible, just like the turn count to make all the Swatchlings the same&#xA;temperature.&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the explanation clear enough?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2023-01-21T23:58:26.917" LastActivityDate="2023-01-21T23:58:26.917" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24927" PostTypeId="2" ParentId="2140" CreationDate="2022-06-27T13:58:21.353" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/249208&quot;&gt;Decipher a squashed sequence&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-06-28T11:28:14.790" LastActivityDate="2022-06-28T11:28:14.790" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24928" PostTypeId="2" ParentId="2140" CreationDate="2022-06-27T15:40:19.093" Score="0" Body="&lt;h1&gt;I X the source code, you Y the output!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-generation&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-generation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr/&gt;&#xA;&lt;p&gt;There's a zillion challenges of the form &amp;quot;I [do a thing to] the source code, you [do a thing to] the output!&amp;quot;, like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/132558/i-double-the-source-you-double-the-output&quot;&gt;I double the source, you double the output!&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/192979/i-reverse-the-source-code-you-negate-the-output&quot;&gt;I reverse the source code, you negate the output!&lt;/a&gt;. In this challenge you'll generalize that, writing a program that, given two functions &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt;, will print a program &lt;code&gt;p&lt;/code&gt; which prints some output &lt;code&gt;o&lt;/code&gt;, with the property that &lt;code&gt;x(p)&lt;/code&gt; prints &lt;code&gt;y(o)&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Task:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your program (or function) should take two inputs, &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt;, which can either be functions/lambdas, strings containing code, or some similar representation of a function in your language. You can assume these functions are pure: they have no side effects and do not depend on anything aside from their input. Other reasonable assumptions may be made based on your language's requirements, such as the input to &lt;code&gt;x&lt;/code&gt; being a string of a certain length.&lt;/p&gt;&#xA;&lt;p&gt;Your program should then print or return a program &lt;code&gt;p&lt;/code&gt;, once again either as a &lt;strong&gt;pure&lt;/strong&gt; lambda function (so it can't rely on &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; in the scope above it), a string representation of a program, function, or snippet, or some similar representation, such as writing an executable to a file. When &lt;code&gt;p&lt;/code&gt; is run, it should take no input, and produce a deterministic value &lt;code&gt;o&lt;/code&gt;. When &lt;code&gt;x(p)&lt;/code&gt; is run, a second program will be produced, which, when run without input, should produce &lt;code&gt;y(o)&lt;/code&gt; deterministically.&lt;/p&gt;&#xA;&lt;p&gt;You may assume the data type of &lt;code&gt;y(o)&lt;/code&gt; is the same as &lt;code&gt;o&lt;/code&gt;, and make any other reasonable assumptions for your language. You may use any consistent data type for &lt;code&gt;o&lt;/code&gt;, as long as it can hold more than 128 or so values (ints, floats, or strings would be preferred).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This would be a very difficult challenge, and I'm not entirely sure what it would involve to answer or if it would even be possible to do so. I'm going to have to make some additional rules I think. maybe the inverse of &lt;code&gt;x&lt;/code&gt; would be another input, that sort of thing. Feel free to suggest any ideas for rules to make this more possible and/or interesting, including across languages.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-06-27T15:40:19.093" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24929" PostTypeId="2" ParentId="2140" CreationDate="2022-06-27T16:27:48.053" Score="2" Body="&lt;h1&gt;Is this a squashed series? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot;&gt;parsing&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Given a string of digits, determine whether it is the concatenation of at least two ascending consecutive integers. (in decimal, with no leading zeroes)&lt;/p&gt;&#xA;&lt;p&gt;For example, the string &lt;code&gt;7891011&lt;/code&gt; is valid, because it's the concatenation of the sequence &lt;code&gt;[7, 8, 9, 10, 11]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;However, the string &lt;code&gt;54&lt;/code&gt; could only be formed by concatenating &lt;code&gt;[5, 4]&lt;/code&gt; (which is not ascending), or  &lt;code&gt;[54]&lt;/code&gt; (which does not have at least two numbers in it), so it is not valid.&lt;/p&gt;&#xA;&lt;p&gt;(This challenge is essentially asking &amp;quot;Is it a valid input to &lt;a href=&quot;https://codegolf.stackexchange.com/q/249208&quot;&gt;Decipher a squashed series&lt;/a&gt;&amp;quot;)&lt;/p&gt;&#xA;&lt;p&gt;You should output using two distinct values of your choice to represent &amp;quot;valid&amp;quot; and &amp;quot;not valid&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;Take care with leading zeroes: for example, &lt;code&gt;809&lt;/code&gt; is not valid, even though it could be decomposed into &lt;code&gt;[8, 09]&lt;/code&gt;, because &lt;code&gt;09&lt;/code&gt; is not a valid decimal integer.&lt;/p&gt;&#xA;&lt;p&gt;You may assume the input does not start with a &lt;code&gt;0&lt;/code&gt;, and has a length of at least 2. The input will also only contain digits (and not &lt;code&gt;-&lt;/code&gt;, so you don't need to handle negative numbers).&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;Valid&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1234&#xA;7891011&#xA;293031323334&#xA;9991000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Invalid&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;54&#xA;66&#xA;28&#xA;3131&#xA;809&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Valid numbers are given by &lt;a href=&quot;https://oeis.org/A035333&quot; rel=&quot;nofollow noreferrer&quot;&gt;A035333&lt;/a&gt; in the OEIS.&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this interesting enough? (It was just a byproduct of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24927&quot;&gt;Decipher a squashed series&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Is my handling of the &lt;code&gt;809&lt;/code&gt; case good? Or should I allow either output for inputs like that?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-06-28T13:45:33.710" LastActivityDate="2022-06-28T13:45:33.710" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24930" PostTypeId="2" ParentId="2140" CreationDate="2022-06-27T23:02:43.417" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/249523&quot;&gt;Erverse Hte Ifrst Wto Eltters fo Aech Owrd&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="107299" LastEditorUserId="97857" LastEditDate="2022-07-05T07:48:24.893" LastActivityDate="2022-07-05T07:48:24.893" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24931" PostTypeId="2" ParentId="2140" CreationDate="2022-06-28T00:14:25.100" Score="0" Body="&lt;h1&gt;Interleavable programs (WIP) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot;&gt;source-layout&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Your task in this challenge is to create programs that can be interleaved. Submissions will be in the form of collections of programs. The score for each collection is 2 raised to the power of the number of programs in that collection, and your total score is the sums of the scores of all the submitted collections. Here are the rules for each collection:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There must be at least 2 programs in each collection&lt;/li&gt;&#xA;&lt;li&gt;The programs in the collection must be ordered from 1 to &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;The &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th program must output the integers in the range &lt;span class=&quot;math-container&quot;&gt;\$(i-1)*n\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$i*n\$&lt;/span&gt;. Output can be as a list or string with separators (the separator can be an empty string)&lt;/li&gt;&#xA;&lt;li&gt;When your programs are interleaved, their output is also interleaved&lt;/li&gt;&#xA;&lt;li&gt;Programs can be reused in other collections&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Example answer, score = 12&lt;/h2&gt;&#xA;&lt;p&gt;Collection 1:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;abcdef&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;123&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;jklom&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Interleaved: &lt;code&gt;a1jb2kc3ldoemf&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Collection 2:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;abcdef&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;123&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Interleaved: &lt;code&gt;a1b2c3def&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Questions for Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How do I make the description clearer? It's not great right now.&lt;/li&gt;&#xA;&lt;li&gt;Is this a dupe?&lt;/li&gt;&#xA;&lt;li&gt;Should the output be modified so it's easier? Maybe people can choose their own output?&lt;/li&gt;&#xA;&lt;li&gt;Any way to improve the scoring? How do I prevent people gaming the score by posting answers with lots of collections of size 2? I was thinking about forcing all programs in all collections to be drawn from the biggest collection.&lt;/li&gt;&#xA;&lt;li&gt;Is this even worth posting as a question?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="95792" LastEditorUserId="95792" LastEditDate="2022-06-28T00:21:25.897" LastActivityDate="2022-06-28T00:21:25.897" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24932" PostTypeId="2" ParentId="2140" CreationDate="2022-06-28T13:33:56.910" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249863/solve-a-card-suit-puzzle&quot;&gt;Solve a Card Suit Puzzle&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2022-07-12T13:50:11.443" LastActivityDate="2022-07-12T13:50:11.443" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24934" PostTypeId="2" ParentId="2140" CreationDate="2022-06-29T02:07:13.990" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/249489/92689&quot;&gt;Get multi-dimensional indices in a list&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="92689" LastEditorUserId="92689" LastEditDate="2022-07-03T19:35:34.693" LastActivityDate="2022-07-03T19:35:34.693" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24935" PostTypeId="2" ParentId="2140" CreationDate="2022-06-29T06:42:49.920" Score="1" Body="&lt;h1&gt;Find the best character arrangement&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot;&gt;grid&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot;&gt;optimization&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot;&gt;fastest-code&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;You want to write your English essay. However, all characters on your keyboard broke other than the arrow keys and the enter key. You want to find out how to place the characters so you can write your essay with the least movement.&lt;/p&gt;&#xA;&lt;p&gt;Formally, you have to assign to each character of &lt;code&gt; !&amp;quot;$%&amp;amp;'()+,-./0123456789:;&amp;lt;=?[]`abcdefghijklmnopqrstuvwxyz⇦⇧&lt;/code&gt; a unique integer coordinate, and minimize &lt;span class=&quot;math-container&quot;&gt;\$ d = \sum_{c_1 , c_2} {\text{freq}(c_1, c_2) \text{dist}(c_1, c_2)} \$&lt;/span&gt;, with &lt;span class=&quot;math-container&quot;&gt;\$\text{dist}\$&lt;/span&gt; being the Manhattan destince between the position of the characters, and &lt;span class=&quot;math-container&quot;&gt;\$\text{freq}\$&lt;/span&gt; being the frequency of the character pair, &lt;a href=&quot;https://pastebin.com/Yw9FcLv2&quot; rel=&quot;nofollow noreferrer&quot;&gt;which is described here&lt;/a&gt;, with the frequency of each pair not detailed assumed &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;The winner is the code which could produce the best result in a minute on my computer, with the tie breaker being the time until that result is found.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your language must have a freely available interpreter/compiler capable of running on Linux&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are disallowed, except optimizing for the given test cases - you are allowed (and even expected) to fine-tune your solution to produce the best solution on this given test case.&lt;/li&gt;&#xA;&lt;li&gt;You can't hardcode calculations - the solution should be found by the code during its execution, not beforehand.&lt;/li&gt;&#xA;&lt;li&gt;You can use any reasonable output format (i.e. output your solution and when did you find it when your program terminates, output your solution whenever the program improves it, etc.).&lt;/li&gt;&#xA;&lt;li&gt;You will receive the frequency JSON in stdin.&lt;/li&gt;&#xA;&lt;li&gt;Your solution must be deterministic. You can use PRGNs, you just have to hard code their seed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2022-06-29T08:37:19.277" LastActivityDate="2022-06-29T08:37:19.277" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24936" PostTypeId="2" ParentId="23771" CreationDate="2022-06-29T07:40:46.770" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://cognate-lang.github.io/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cognate&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Cognate is a stack-based programming language designed to be readable as English.&lt;/p&gt;&#xA;&lt;p&gt;Uniquely among stack-based languages, it evaluates right-to-left. This means you can write code more naturally like English:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;Print &amp;quot;Hello, World!&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Cognate allows you to write arbitrary words in between commands, as long as they start with a lowercase letter. This allows you to insert filler words to make your code even closer to readable English:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;Print the string &amp;quot;Hello, World!&amp;quot; to the screen&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Cognate is gradually-typed and functional.&lt;/p&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://cognate-lang.github.io/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Website&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/cognate-lang/cognate&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub repo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://cognate-lang.github.io/learn.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tutorial&lt;/a&gt; (unfinished)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://staging.ato.pxeger.com/run?L=cognate&quot; rel=&quot;nofollow noreferrer&quot;&gt;Attempt This Online&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2022-06-29T07:40:46.770" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24937" PostTypeId="1" CreationDate="2022-06-29T16:20:07.490" Score="5" ViewCount="213" Body="&lt;p&gt;Current consensus seems to be that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4782/do-programs-have-to-terminate&quot;&gt;programs must terminate by default&lt;/a&gt;. This makes sense in general. However, does this bar use of languages which are not designed with a halt state (other than manually stopping the program)?&lt;/p&gt;&#xA;&lt;p&gt;For example, take something like ByteBeat, which I believe is a family of languages which evaluate a single expression at continually, infinitely increasing values of a variable &lt;code&gt;t&lt;/code&gt; (representing time) and outputting as audio. Could we use this in an answer which did not specify anything about infinite output? Could a ByteBeat program infinitely loop outputting &lt;a href=&quot;https://codegolf.stackexchange.com/questions/272/twinkle-twinkle-little-star&quot;&gt;twinkle twinkle little star&lt;/a&gt;? Or maybe just play it once, and then remain silent for eternity onward?&lt;/p&gt;&#xA;&lt;p&gt;There are also automata like &lt;a href=&quot;https://en.wikipedia.org/wiki/Rule_110&quot; rel=&quot;nofollow noreferrer&quot;&gt;rule 110&lt;/a&gt; which are Turing-Complete but have no way to halt. It's easy to argue, however, that these are not languages, and that a language implementation of such a thing would have a well defined halt state / output.&lt;/p&gt;&#xA;&lt;p&gt;Alternatively, in this language (and likely others) you are able to guarantee that after a certain point, nothing more will be output. In ByteBeat, this would be done by having an expression which always error after a certain fixed value, like this: &lt;code&gt;(t&amp;gt;100?1/0:1)&lt;/code&gt;. Important to note that this would not halt with error, it would simply not evaluate to any outputtable sound.&lt;/p&gt;&#xA;&lt;p&gt;Also worth note: Languages without I/O capabilities such as &lt;a href=&quot;https://esolangs.org/wiki////&quot; rel=&quot;nofollow noreferrer&quot;&gt;///&lt;/a&gt; are &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10553/107310&quot;&gt;allowed to hardcode their input&lt;/a&gt;, and see the other various rules in the linked question for other examples of exceptions made for languages which lack certain features.&lt;/p&gt;&#xA;&lt;p&gt;So, in general, programs must halt unless specified in a challenge, but do we have any exceptions for languages without halt states? Does it make a difference if their output is (fairly) well defined, and/or there is a way to guarantee finite output even in theoretically infinite time?&lt;/p&gt;&#xA;" OwnerUserId="107310" LastEditorUserId="107310" LastEditDate="2022-06-29T17:48:21.373" LastActivityDate="2022-07-26T13:08:13.463" Title="What is our consensus on languages which do not halt by design?" Tags="|discussion|policy|answers|rules|defaults|" AnswerCount="2" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="24938" PostTypeId="2" ParentId="2140" CreationDate="2022-06-30T09:39:47.437" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249479/is-it-an-ordinal&quot;&gt;Is it an ordinal?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2022-07-03T14:50:18.510" LastActivityDate="2022-07-03T14:50:18.510" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24939" PostTypeId="2" ParentId="2140" CreationDate="2022-06-30T09:59:55.077" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/249439&quot;&gt;Draw this fractal generated by applying Newton&amp;#39;s method to cosh(x) - 1&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="97857" LastEditDate="2022-07-02T18:24:27.693" LastActivityDate="2022-07-02T18:24:27.693" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24941" PostTypeId="2" ParentId="2140" CreationDate="2022-06-30T18:36:34.673" Score="1" Body="&lt;h1&gt;Where does the seesaw balance? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;There have been a couple seesaw balance questions but none of them are doing this version of the question. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/99545/add-weight-to-one-side-of-a-see-saw-to-balance-it&quot;&gt;Adding weight to one side&lt;/a&gt;, or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/54311/balance-a-set-of-weights-on-a-seesaw&quot;&gt;small inputs with ascii art&lt;/a&gt; have been done already, but I think this would be unique enough to not be a duplicate.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Problem&lt;/strong&gt;: Given some ordered sequence of single-digit positive integers representing weights (say 0kg to 9kg), output at what index or indices the fulcrum have to be at such that the beam balances. If it doesn't balance anywhere, then output some non-location without erroring.&lt;/p&gt;&#xA;&lt;p&gt;This is assuming a massless beam. The fulcrum is at the center of one of the weights, and the output must be integer-valued (no putting the fulcrum between two weights). Output can be either 0-indexed or 1-indexed and should be specified in the answer.&lt;/p&gt;&#xA;&lt;p&gt;Valid outputs if the seesaw balances would include &lt;code&gt;2&lt;/code&gt;, &lt;code&gt;8.0&lt;/code&gt;, &lt;code&gt;[5]&lt;/code&gt;, a list of all positions that work, &lt;code&gt;&amp;quot;3&amp;quot;&lt;/code&gt; and so on, but not &lt;code&gt;4.25&lt;/code&gt;. Valid outputs if the seesaw does &lt;em&gt;not&lt;/em&gt; balance anywhere would include &lt;code&gt;-1&lt;/code&gt;, &lt;code&gt;[]&lt;/code&gt;, &lt;code&gt;&amp;quot;&amp;quot;&lt;/code&gt;, &lt;code&gt;NaN&lt;/code&gt; and so on, but not &lt;code&gt;0&lt;/code&gt; or &lt;code&gt;[7]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;: Given the input &lt;code&gt;[2,3,0,0,5,9,4]&lt;/code&gt; the output should be &lt;code&gt;4&lt;/code&gt; since a pivot at that index causes the torques/moments to balance (2*4+3*3+0*2+0*1 = 9*1+4*2). Below is a visualization:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2300594 (weights)&#xA;=======&#xA;    ^&#xA;0123456 (indices)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The weight at the fulcrum doesn't contribute to either side.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Failure example&lt;/strong&gt;: Given the input &lt;code&gt;[1,3,4,1,2]&lt;/code&gt; the output should be &lt;code&gt;-1&lt;/code&gt; (or &lt;code&gt;null&lt;/code&gt; or &lt;code&gt;[]&lt;/code&gt; or some other obviously non-position output) because at no fulcrum position would this this seesaw be stable and balanced.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Edge cases&lt;/strong&gt;: An input that is all zeros (eg. &lt;code&gt;[0,0,0,0,0,0]&lt;/code&gt;) can balance at any index, but the program only needs to output at least one of them. An input that doesn't follow the input rules (eg. &lt;code&gt;[]&lt;/code&gt;, &lt;code&gt;[&amp;quot;a&amp;quot;,&amp;quot;b&amp;quot;]&lt;/code&gt;, &lt;code&gt;[-3]&lt;/code&gt;, &lt;code&gt;[1.234,2.34,3.4]&lt;/code&gt;) is not expected to give any output of any kind and can error out.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test cases&lt;/strong&gt;: Using &lt;code&gt;NaN&lt;/code&gt; as the &amp;quot;no solution&amp;quot; output. Output is 0-indexed.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[6] -&amp;gt; 0&#xA;[1,0] -&amp;gt; 0&#xA;[1,1] -&amp;gt; NaN&#xA;[9,1,9] -&amp;gt; 1&#xA;[1,2,3,4] -&amp;gt; 2&#xA;[1,2,3,4,5] -&amp;gt; NaN&#xA;[1,3,4,1,2] -&amp;gt; NaN&#xA;[2,3,0,0,5,9,4] -&amp;gt; 4&#xA;[1,2,3,4,5,6,7] -&amp;gt; 4&#xA;[0,0,0,3,0,0,0,3] -&amp;gt; 5&#xA;[0,0,0,3,0,0,3,0] -&amp;gt; NaN&#xA;[1,0,0,2,0,0,0,0,0,0,0,0] -&amp;gt; 2&#xA;[6,2,6,3,4,8,1,1,1,1,1,1,1,1,1,1,1] -&amp;gt; 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Being code golf, fewer bytes of code is better here!&lt;/p&gt;&#xA;" OwnerUserId="113442" LastEditorUserId="113442" LastEditDate="2022-06-30T23:19:11.670" LastActivityDate="2022-06-30T23:19:11.670" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="24942" PostTypeId="1" CreationDate="2022-07-01T02:31:02.123" Score="11" ViewCount="433" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19271/reviving-language-of-the-month-pick-up-where-we-left-off-or-start-over&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout July 2022, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Piet&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;What's a Language of the Month?&lt;/h2&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19279/nominations-for-language-of-the-month-take-2?answertab=scoredesc#tab-top&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during July, those who wish to participate should learn (at least the basics of) Piet, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about Piet&lt;/h2&gt;&#xA;&lt;p&gt;Piet is a classic esolang that dates back to 2001 (according to Esolangs article), which is unique in that it operates on an image rather than source code.&lt;/p&gt;&#xA;&lt;p&gt;But &amp;quot;source code being an image&amp;quot; is only part of its uniqueness. The instruction pointer moves around in the unit of single-colored areas, as opposed to individual cells. Also, the commands execute when the IP crosses the border, and the relative difference between two colors defines the command. Finally, pushing a large number can be done in one step but it requires an area of that many cells, which gives a metagolfing potential for pushing number constants.&lt;/p&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.dangermouse.net/esoteric/piet.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Official Piet spec&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.bertnase.de/npiet/&quot; rel=&quot;nofollow noreferrer&quot;&gt;npiet&lt;/a&gt;, a &amp;quot;classic&amp;quot; Piet interpreter&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://esolangs.org/wiki/Piet&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolangs article&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://bubbler-4.github.io/piet/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Bubbler/piet&lt;/a&gt;, a &amp;quot;new&amp;quot; Piet editor/interpreter&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/dloscutoff/ascii-piet&quot; rel=&quot;nofollow noreferrer&quot;&gt;ascii-piet&lt;/a&gt; which most of the new Piet answers use for scoring&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/245785/78410&quot;&gt;Golfing tips&lt;/a&gt; / &lt;a href=&quot;https://chat.stackexchange.com/rooms/135395/piet&quot;&gt;Chatroom&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I (Steffan) will also offer a +100 bounty for any user's 2nd Piet answer in July.&lt;/p&gt;&#xA;" OwnerUserId="92689" LastEditorUserId="92689" LastEditDate="2022-07-05T03:14:07.450" LastActivityDate="2022-10-19T05:52:03.713" Title="Language of the Month for July 2022: Piet" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24943" PostTypeId="2" ParentId="24942" CreationDate="2022-07-01T02:31:38.113" Score="6" Body="&lt;h1&gt;List of all Piet answers posted in July 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/249375/96039&quot;&gt;Print the ASCII Code page&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/114003/division-and-remainder/249414#249414&quot;&gt;Division and remainder&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/220281/semidivisibility/249428#249428&quot;&gt;Semidivisibility&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/86149/divisibility-test/249429#249429&quot;&gt;Divisibility test&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/152114/output-the-hours-at-90-degrees/249456#249456&quot;&gt;Output the hours at 90 degrees&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/249510/78410&quot;&gt;Print the ASCII Code page&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/249558/78410&quot;&gt;Output the hours at 90 degrees&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/249562/78410&quot;&gt;The letter A without A&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/249617/104752&quot;&gt;Erverse Hte Ifrst Wto Eltters fo Aech Owrd&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104752&quot;&gt;m90&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/250053&quot;&gt;Sum of Powers of 2&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/103091&quot;&gt;Nilster&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/106182/multiply-two-numbers/250255#250255&quot;&gt;Multiply two numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/250392/96039&quot;&gt;Encode the alphabet cipher&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/250363/104563&quot;&gt;Output a googol copies of a string&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/104563/sfieger&quot;&gt;sfieger&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/250468/104563&quot;&gt;Letters to numbers to letters (poorly)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/104563/sfieger&quot;&gt;sfieger&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant tips posted in July 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/249511/78410&quot;&gt;If-else-bounce-merge&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;tip summary&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant challenges posted in July 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="92689" LastEditorUserId="104563" LastEditDate="2022-10-19T05:52:03.713" LastActivityDate="2022-10-19T05:52:03.713" CommentCount="0" CommunityOwnedDate="2022-07-01T02:31:38.113" ContentLicense="CC BY-SA 4.0" />
  <row Id="24944" PostTypeId="2" ParentId="2140" CreationDate="2022-07-02T05:55:56.193" Score="1" Body="&lt;h1&gt;Nest some addition, differently&lt;/h1&gt;&#xA;&lt;p&gt;This question is a follow-up to &lt;a href=&quot;https://codegolf.stackexchange.com/q/249194&quot;&gt;Nest some addition&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Lambda calculus is a system of computation based on single-argument functions; everything in it is such a function. Due to this functional nature, juxtaposition is commonly used to denote function application, grouped from left to right. For example, &lt;span class=&quot;math-container&quot;&gt;\$(f g) h=f g h\$&lt;/span&gt; denotes what would conventionally be written &lt;span class=&quot;math-container&quot;&gt;\$(f(g))(h)=f(g)(h)\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Church_encoding&quot; rel=&quot;nofollow noreferrer&quot;&gt;Church numerals&lt;/a&gt; are a way of encoding the nonnegative integers in this system. They can be defined as follows: &lt;br /&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$\begin{align*}&#xA;\overparen{\underparen0} f &amp;amp;= \operatorname{id}\\&#xA;\overparen{\underparen 1} f &amp;amp;= f\circ\left(\overparen{\underparen 0} f\right)=f\\&#xA;\overparen{\underparen 2} f &amp;amp;= f\circ\left(\overparen{\underparen 1} f\right)=f\circ f\\&#xA;\vdots\\&#xA;\overparen{\underparen n} f &amp;amp;= f\circ\left(\overparen{\underparen{n-1}} f\right)\\&#xA;&amp;amp;=\underbrace{f\circ\cdots\circ f}_n,&#xA;\end{align*}\$&lt;/span&gt; &lt;br /&gt;&#xA;where &lt;span class=&quot;math-container&quot;&gt;\$\circ\$&lt;/span&gt; denotes function composition. In other words, the Church numeral &lt;span class=&quot;math-container&quot;&gt;\$\overparen{\underparen n}\$&lt;/span&gt; can be seen as a unary operator on a function &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; that nests that function &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; times.&lt;/p&gt;&#xA;&lt;p&gt;There is a another binary operator that performs addition on two Church numerals: &lt;br /&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$\begin{align*}&#xA;\operatorname{dda} \overparen{\underparen a} \overparen{\underparen b} f&amp;amp;= \overparen{\underparen{a+b}} f\\&#xA;&amp;amp;= \left(\overparen{\underparen b} f\right)\circ\left(\overparen{\underparen a} f\right).&#xA;\end{align*}\$&lt;/span&gt; &lt;br /&gt;&#xA;That is, we nest &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; times, then another &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; times.&lt;/p&gt;&#xA;&lt;p&gt;As with &lt;span class=&quot;math-container&quot;&gt;\$\operatorname{add}\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$\operatorname{dda} \overparen{\underparen a}\$&lt;/span&gt; is a unary operator that, when applied to another Church numeral &lt;span class=&quot;math-container&quot;&gt;\$\overparen{\underparen b}\$&lt;/span&gt;, results in &lt;span class=&quot;math-container&quot;&gt;\$\overparen{\underparen{a+b}}\$&lt;/span&gt;. Now what happens when we reverse the order, i.e. attempt to evaluate &lt;span class=&quot;math-container&quot;&gt;\$\overparen{\underparen a}\operatorname{dda}\$&lt;/span&gt;? This resulting function still has arity &lt;span class=&quot;math-container&quot;&gt;\$a+1\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Given (optionally) an integer &lt;span class=&quot;math-container&quot;&gt;\$a\ge0\$&lt;/span&gt;, and another &lt;span class=&quot;math-container&quot;&gt;\$a+1\$&lt;/span&gt; integers &lt;span class=&quot;math-container&quot;&gt;\$x_0,x_1,...,x_a\ge0\$&lt;/span&gt; in a consistent ordering, compute the integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$\overparen{\underparen n}=\overparen{\underparen a} \operatorname{dda} \overparen{\underparen{x_0}} \overparen{\underparen{x_1}}...\overparen{\underparen{x_a}}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You will also need to know the multiplication and exponentiation rules: &lt;br /&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$\begin{align*}&#xA;\overparen{\underparen{a\times b}} f&amp;amp;=\overparen{\underparen b} \left(\overparen{\underparen a} f\right)=\left(\overparen{\underparen b}\circ\overparen{\underparen a}\right)f\\&#xA;\overparen{\underparen{a^b}} f &amp;amp;= \overparen{\underparen b} \overparen{\underparen a} f.&#xA;\end{align*}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&lt;p&gt;Take &lt;span class=&quot;math-container&quot;&gt;\$4 \operatorname{dda} 3\,2\,1\,3\,2\$&lt;/span&gt;: &lt;br /&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$\begin{align*}&#xA;\overparen{\underparen{4}} \operatorname{dda} \overparen{\underparen{3}} \overparen{\underparen{2}} \overparen{\underparen{1}} \overparen{\underparen{3}} \overparen{\underparen{2}} &amp;amp;= \left(\operatorname{dda}\circ\operatorname{dda}\circ\operatorname{dda}\circ\operatorname{dda}\right) \overparen{\underparen{3}} \overparen{\underparen{2}} \overparen{\underparen{1}} \overparen{\underparen{3}} \overparen{\underparen{2}}\\&#xA;&amp;amp;=\operatorname{dda}\left(\operatorname{dda}\left(\operatorname{dda}\left(\operatorname{dda} \overparen{\underparen{3}}\right)\right)\right) \overparen{\underparen{2}} \overparen{\underparen{1}} \overparen{\underparen{3}} \overparen{\underparen{2}}\\&#xA;&amp;amp;=\overparen{\underparen{2}} \overparen{\underparen{1}} \left(\operatorname{dda}\left(\operatorname{dda}\left(\operatorname{dda} \overparen{\underparen{3}}\right)\right) \overparen{\underparen{1}} \overparen{\underparen{3}}\right) \overparen{\underparen{2}}\\&#xA;&amp;amp;=\operatorname{dda}\left(\operatorname{dda}\left(\operatorname{dda} \overparen{\underparen{3}}\right)\right) \overparen{\underparen{1}} \overparen{\underparen{3}} \overparen{\underparen{2}}\\&#xA;&amp;amp;=\left(\overparen{\underparen{1}} \overparen{\underparen{3}}\right) \left(\operatorname{dda}\left(\operatorname{dda} \overparen{\underparen{3}}\right) \overparen{\underparen{3}} \overparen{\underparen{2}}\right)\\&#xA;&amp;amp;=\overparen{\underparen{3}} \left(\left(\overparen{\underparen{3}} \overparen{\underparen{2}}\right)\circ\left(\operatorname{dda} \overparen{\underparen{3}} \overparen{\underparen{2}}\right)\right)\\&#xA;&amp;amp;=\overparen{\underparen{3}} \left(\overparen{\underparen{8}} \times \overparen{\underparen{5}}\right)\\&#xA;&amp;amp;= \left(\overparen{\underparen{40^3}}\right)=\overparen{\underparen{64000}}&#xA;\end{align*}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;a   x           result&#xA;0   9               9&#xA;1   2,2             4&#xA;2   3,4,5           5000&#xA;2   7,1,8           120&#xA;3   2,2,2,2         65536&#xA;3   2,3,2,4         7213895789838336&#xA;4   3,2,1,3,2       64000&#xA;4   3,1,4,1,5       8782696764280&#xA;5   1,2,1,2,1,2     42&#xA;5   1,2,1,3,1,4     176820&#xA;5   2,1,2,1,2,1     446941881&#xA;6   1,2,1,2,1,2,1   331776&#xA;&#xA;5   2,2,2,1,1,1     46067585792061179986003103589270890479268003416963782070185329396818296983805445959073166440720581387038540029877988577743446452288030374115737071650858255804704645216460811594784946208110262803842901974222092931885696117997589640107161975226690021967819064275487285233512229404788315869062112469518816261355388074282508579612820589720868169439536003406995417291950455148984482997260637332557020455012974915559243748189682760671362747474046184227448861411296966290899881082905099904256926315617201402705453906211612138979485925239261758925413761498970666786937460520926437582982463058742990808351770234630680221463616795434886004399826242096099&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Notes&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I expect this should differ quite a bit from the previous challenge for non-lambda-calculus-based languages due to how &lt;span class=&quot;math-container&quot;&gt;\$a\ge4\$&lt;/span&gt; expands.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;But is there a viable method that's not just brute force lambda calculus expansion?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="81203" LastEditorUserId="81203" LastEditDate="2022-07-06T02:55:58.133" LastActivityDate="2022-07-06T02:55:58.133" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24946" PostTypeId="2" ParentId="2140" CreationDate="2022-07-03T14:55:05.927" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249512/draw-the-usa-flag&quot;&gt;Draw the USA flag&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="73593" LastEditorUserId="92689" LastEditDate="2022-07-06T00:59:03.380" LastActivityDate="2022-07-06T00:59:03.380" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24949" PostTypeId="2" ParentId="2140" CreationDate="2022-07-05T11:01:42.873" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249706/convert-from-greeklish-to-modern-greek&quot;&gt;Convert from Greeklish to modern Greek&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110265" LastEditorUserId="110265" LastEditDate="2022-07-08T08:46:09.773" LastActivityDate="2022-07-08T08:46:09.773" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24950" PostTypeId="2" ParentId="2140" CreationDate="2022-07-06T08:49:43.890" Score="-1" Body="&lt;h1&gt;Build a file/directory tree&lt;/h1&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;In this challenge, your task is to write a program or function which takes an array of paths with an additional boolean indicating it is a file or directory and outputs a file/directory tree in &lt;strong&gt;any&lt;/strong&gt; reasonable format.&lt;/p&gt;&#xA;&lt;h2&gt;Remarks&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Some directories can end with a forward slash (&lt;strong&gt;&amp;quot;/&amp;quot;&lt;/strong&gt;) but this is not always the case&lt;/li&gt;&#xA;&lt;li&gt;A parent directory is not always explicitly defined but should be in the tree&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&amp;quot;.&amp;quot;&lt;/strong&gt; and &lt;strong&gt;&amp;quot;..&amp;quot;&lt;/strong&gt; as file name or directory name are not allowed&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are not allowed&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;An unsorted array of paths. Each item is a tuple of path and a boolean which is True for a file and False for a directory.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;    ['Root Folder/Sub Folder/', False],&#xA;    ['Root Folder/Sub Folder/hello.txt', True],&#xA;    ['Root Folder/Sub Folder/SubSub Folder/SubSubSub Folder/', False],&#xA;    ['Root Folder/Sub Folder/world.txt', True],&#xA;    ['Root Folder/Sub Folder 2', False],&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Any output which shows or defines a tree based upon input is valid.&lt;/p&gt;&#xA;&lt;h3&gt;Text formatted example&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;[D] Root Folder&#xA;    [D] Sub Folder&#xA;        [D] SubSub Folder&#xA;            [D] SubSubSub Folder&#xA;        [F] hello.txt&#xA;        [F] world.txt&#xA;    [D] Sub Folder 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Data structure formatted example&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;    'Root Folder',&#xA;    [&#xA;        [&#xA;            'Sub Folder',&#xA;            [&#xA;                [&#xA;                    'SubSub Folder',&#xA;                    [&#xA;                        [&#xA;                            'SubSubSub Folder', [], []&#xA;                        ]&#xA;                    ],&#xA;                    []&#xA;                ]&#xA;            ],&#xA;            ['hello.txt', 'world.txt']&#xA;        ],&#xA;        [&#xA;            'Sub Folder 2',&#xA;            [],&#xA;            []&#xA;        ]&#xA;    ],&#xA;    []&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is a code golf. Shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this an interesting question?&lt;/li&gt;&#xA;&lt;li&gt;Is this question clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Anything i can do to improve this question?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="64244" LastActivityDate="2022-07-06T08:49:43.890" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24952" PostTypeId="2" ParentId="2447" CreationDate="2022-07-06T19:57:23.940" Score="9" Body="&lt;h1&gt;When printing to STDOUT, you may have any number of trailing whitespace&lt;/h1&gt;&#xA;" OwnerUserId="107299" LastActivityDate="2022-07-06T19:57:23.940" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24953" PostTypeId="2" ParentId="23771" CreationDate="2022-07-07T18:10:28.867" Score="6" Body="&lt;h1&gt;Prolog&lt;/h1&gt;&#xA;&lt;p&gt;Prolog is a logical and declarative programming language. It's quite interesting.&lt;/p&gt;&#xA;&lt;p&gt;From TutorialsPoint:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Prolog or PROgramming in LOGics is a logical and declarative programming language. It is one major example of the fourth generation language that supports the declarative programming paradigm. This is particularly suitable for programs that involve symbolic or non-numeric computation. This is the main reason to use Prolog as the programming language in Artificial Intelligence, where symbol manipulation and inference manipulation are the fundamental tasks.&lt;/p&gt;&#xA;&lt;p&gt;In Prolog, we need not mention the way how one problem can be solved, we just need to mention what the problem is, so that Prolog automatically solves it. However, in Prolog we are supposed to give clues as the solution method.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Prolog&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt; on Prolog&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.swi-prolog.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;SWI-Prolog&lt;/a&gt; (on &lt;a href=&quot;https://tio.run/#prolog-swi&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.gprolog.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;GNU Prolog&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://learnxinyminutes.com/docs/prolog/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tutorial&lt;/a&gt; on Learn X in Y Minutes&lt;/li&gt;&#xA;&lt;li&gt;or on &lt;a href=&quot;https://www.tutorialspoint.com/prolog/prolog_introduction.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tutorialspoint&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="92689" LastActivityDate="2022-07-07T18:10:28.867" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24954" PostTypeId="2" ParentId="2140" CreationDate="2022-07-08T19:39:17.690" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/250066/101306&quot;&gt;Next digit of rational number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot;&gt;codegolf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="101306" LastEditorUserId="101306" LastEditDate="2022-07-18T13:27:37.333" LastActivityDate="2022-07-18T13:27:37.333" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24955" PostTypeId="2" ParentId="2140" CreationDate="2022-07-08T19:59:29.180" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/249868&quot;&gt;Every possible pairing&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-07-12T16:36:14.823" LastActivityDate="2022-07-12T16:36:14.823" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24956" PostTypeId="2" ParentId="2140" CreationDate="2022-07-09T01:11:06.483" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249787/simplify-rubiks-cube-moves&quot;&gt;Simplify Rubik's Cube Moves&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="112514" LastEditorUserId="112514" LastEditDate="2022-07-11T05:12:21.777" LastActivityDate="2022-07-11T05:12:21.777" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24957" PostTypeId="2" ParentId="2140" CreationDate="2022-07-09T20:38:10.430" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/251365/81203&quot;&gt;Implement level-index addition&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="81203" LastEditorUserId="81203" LastEditDate="2022-08-26T07:17:51.677" LastActivityDate="2022-08-26T07:17:51.677" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24958" PostTypeId="2" ParentId="2140" CreationDate="2022-07-10T00:34:11.747" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249889/convert-descriptive-notation-to-algebraic-notation&quot;&gt;Convert Descriptive Notation to Algebraic Notation&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="17360" LastEditorUserId="17360" LastEditDate="2022-07-12T22:33:10.400" LastActivityDate="2022-07-12T22:33:10.400" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24959" PostTypeId="2" ParentId="2140" CreationDate="2022-07-10T12:33:07.957" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/250556/101306&quot;&gt;Transform characters of your choice into &amp;quot;Hello, world!&amp;quot;&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="101306" LastEditorUserId="101306" LastEditDate="2022-07-31T21:33:22.677" LastActivityDate="2022-07-31T21:33:22.677" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24960" PostTypeId="2" ParentId="2140" CreationDate="2022-07-10T13:58:34.840" Score="0" Body="&lt;h1&gt;Input program generating Fibonacci, output program generating Fibonacci &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fibonacci&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fibonacci&amp;#39;&quot; rel=&quot;tag&quot;&gt;fibonacci&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-generation&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-generation&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Challenge:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;You will have to write program, which outputs program, that outputs single &lt;a href=&quot;https://en.wikipedia.org/wiki/Fibonacci_number&quot; rel=&quot;nofollow noreferrer&quot;&gt;Fibonacci number&lt;/a&gt;. First program should output first element of sequence (&lt;code&gt;0&lt;/code&gt;), second should output second element of sequence (&lt;code&gt;1&lt;/code&gt;), etc. You can also write two input strings - first is input to your program when it is first launched. Second will be always input to the generated program. The next time your program is launched, it's input will be the program it generated previously.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your score is sum of length of program and input strings.&lt;/li&gt;&#xA;&lt;li&gt;Your inputs can be something else than string (numbers, booleans). To get your score, treat them like strings. E.g. &lt;code&gt;true&lt;/code&gt; have length 4, &lt;code&gt;123,false&lt;/code&gt; have length 9.&lt;/li&gt;&#xA;&lt;li&gt;You can use two different languages for the programs, but solutions using single language are preferred.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://oeis.org/A000045&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;strong&gt;Output sequence (A000045):&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/31529/fibonacci-program-lengths&quot;&gt;Related&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="101306" LastEditorUserId="101306" LastEditDate="2022-07-11T15:13:24.143" LastActivityDate="2022-07-11T15:13:24.143" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24961" PostTypeId="2" ParentId="2140" CreationDate="2022-07-10T14:52:44.063" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249941/all-possible-ties-in-tic-tac-toe&quot;&gt;All Possible Ties in Tic-Tac-Toe&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91262" LastEditorUserId="91262" LastEditDate="2022-07-14T03:16:40.177" LastActivityDate="2022-07-14T03:16:40.177" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24962" PostTypeId="2" ParentId="2140" CreationDate="2022-07-10T19:07:18.663" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pattern-matching&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pattern-matching&amp;#39;&quot; rel=&quot;tag&quot;&gt;pattern-matching&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Find all matches for the digit pattern&lt;/h1&gt;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/128252/does-it-match-the-digit-pattern&quot;&gt;an older challenge,&lt;/a&gt; you were tasked with finding numbers which, in base-ten, matched this specific digit pattern:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(n)(x)(n+1)(x)(n+2)(x)(n+3) etc...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Meaning any number between 4 and 18 digits long such that the digits could be considered as a string of increasing single digits interlaced with (at most) a constant single digit number.&lt;/p&gt;&#xA;&lt;p&gt;For example, &lt;code&gt;19293949&lt;/code&gt; would fit the pattern, with &lt;code&gt;n&lt;/code&gt; being &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;x&lt;/code&gt; being &lt;code&gt;9&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;In this challenge, instead of deciding whether a given number fits one fixed pattern, you will be given a pattern as input, and are tasked with outputting the sequence of numbers which match the pattern.&lt;/p&gt;&#xA;&lt;h2&gt;Patterns&lt;/h2&gt;&#xA;&lt;p&gt;This section is a definition of what the patterns are and what they represent. A format similar to the one used in the original post will be used for these examples. More clarification on I/O rules will come afterward.&lt;/p&gt;&#xA;&lt;p&gt;A pattern consists of one or more clearly delimited tokens, each matching a single base-ten digit.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(token)(token)(token)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Tokens can either be constants, accumulators, or a loop.&lt;/p&gt;&#xA;&lt;p&gt;Constants are each marked with a single token, and there can be up to ten different constants, as each distinct constant represents a distinct digit from each other constant. Here it is represented as a single character from &lt;code&gt;a&lt;/code&gt; to &lt;code&gt;j&lt;/code&gt; in parenthesis &lt;code&gt;()&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(a)(b)(c)(d)(e)(f)(g)(h)(i)(j)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This pattern, for example, could match the number &lt;code&gt;1234567890&lt;/code&gt;, but not the number &lt;code&gt;1111111111&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Important note:&lt;/strong&gt; Numbers &lt;strong&gt;cannot&lt;/strong&gt; have leading 0s, so the pattern would not match &lt;code&gt;0123456789&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(a)(a)(a)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This pattern would match &lt;code&gt;111&lt;/code&gt;, &lt;code&gt;222&lt;/code&gt;, etc. all the way up to &lt;code&gt;999&lt;/code&gt;. It would not match &lt;code&gt;000&lt;/code&gt;, as it contains leading 0s, and it would not match &lt;code&gt;123&lt;/code&gt;, as all of the digits marked with the same constant must be the same.&lt;/p&gt;&#xA;&lt;p&gt;Accumulators are marked with a single fixed symbol. The first instance of an accumulator represents any digit from 0 to 9, and each successive instance represents a digit that is one more than the previous instance. Here it is represented as &lt;code&gt;(n+)&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(n+)(n+)(n+)(n+)(n+)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For example, this pattern matches &lt;code&gt;12345&lt;/code&gt;, &lt;code&gt;23456&lt;/code&gt;, &lt;code&gt;34567&lt;/code&gt;, &lt;code&gt;45678&lt;/code&gt;, and &lt;code&gt;56789&lt;/code&gt;.&#xA;Combining constants and accumulators is allowed, giving us access to patterns similar to that of the original challenge:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(a)(n+)(a)(n+)(b)(n+)(b)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Constants can't match the same digits as other constants, but they &lt;em&gt;are&lt;/em&gt; allowed to match the same digits as accumulators. This pattern matches, for example, &lt;code&gt;9192838&lt;/code&gt;, but it also matches &lt;code&gt;1112333&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This isn't enough to support the pattern given in the original problem, so finally we introduce the loop token. This token can only appear at the end of the pattern, or not at all. Here it is represented as &lt;code&gt;...&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(a)(b)(c)(n+)(n+)...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;A pattern with the loop token matches all numbers that the pattern would if it did not have the loop, as well as all numbers matched by the pattern repeated twice, as well as three times, as well as four times etc. This pattern matches &lt;code&gt;78901&lt;/code&gt;, but it also matches &lt;code&gt;7890178923&lt;/code&gt;, as well as &lt;code&gt;789017892378945&lt;/code&gt;, etc. all the way up to &lt;code&gt;7890178923789457896778989&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(a)(a)(a)...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Beware:&lt;/strong&gt; A pattern with no accumulators but having constants and a loop matches infinitely many numbers. This one matches &lt;code&gt;111&lt;/code&gt;, &lt;code&gt;111111&lt;/code&gt;, &lt;code&gt;111111111&lt;/code&gt;, etc.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;Input can be given in any reasonable format, so long as each token type is clearly distinct, clearly delimited, and consistent. This includes lists of characters, lists of strings, lists of numbers, a single string, curried arguments, etc.&lt;/p&gt;&#xA;&lt;p&gt;The loop token in particular can be taken anywhere in the input convenient, including separate from all of the other tokens. e.g. you could take it as a separate boolean input, or a command line argument, or at the beginning of the string instead, etc.&lt;/p&gt;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; rules apply, so you can either output all matches, or take another number &lt;code&gt;n&lt;/code&gt; as input and return the &lt;code&gt;n&lt;/code&gt;th matching number, etc. Whatever the rules in the tag allow is fine with me.&lt;/p&gt;&#xA;&lt;p&gt;You may assume any/all of the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All patterns given have at least a single valid match.&lt;/li&gt;&#xA;&lt;li&gt;When given a pattern with finitely many matches,&#xA;you will not be given an input asking you to exceed that amount of&#xA;matches (so you wont be asked to generate the 11th number that&#xA;matches &lt;code&gt;(a)&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Constant variable names first appear in some specific order. So you could, for example, accept &lt;code&gt;(a)(b)(c)(a)(c)&lt;/code&gt; but ignore &lt;code&gt;(x)(y)(z)&lt;/code&gt; and &lt;code&gt;(c)(b)(a)&lt;/code&gt;. So long as at least one equivalent form is allowed, it's fine. I doubt this helps anyone, just covering my bases.&lt;/li&gt;&#xA;&lt;li&gt;Not strictly an assumption, but you are allowed to ignore &lt;code&gt;0&lt;/code&gt; as an output number or assume no input will ask for it, as it technically breaks the &amp;quot;no leading zeros&amp;quot; rule. Edge cases wouldn't add much to the challenge :P&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Finally, this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;Examples will be given as a pattern, followed by a natural &lt;code&gt;n&lt;/code&gt;, followed by the &lt;code&gt;n&lt;/code&gt;th matching number (including &lt;code&gt;0&lt;/code&gt;), 0 indexed, all delimited with &lt;code&gt;|&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Still work in progress, the &lt;code&gt;?&lt;/code&gt;s are temporary,&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(a)          |   1 | 1&#xA;(a)          |   9 | 9&#xA;(a)(b)(c)    |   0 | 102&#xA;(a)(b)(c)    |   1 | 103&#xA;(a)(b)(c)    |   7 | 109&#xA;(a)(b)(c)    |   8 | 120&#xA;(a)(b)(c)    |   9 | 123&#xA;(a)(b)(c)    |   ? | 987&#xA;(a)(b)(c)... |   ? | 987&#xA;(a)(b)(c)... | ?+1 | 102102&#xA;(n+)         |   1 | 1&#xA;(n+)         |   9 | 9&#xA;(n+)...      |   1 | 1&#xA;(n+)...      |   9 | 9&#xA;(n+)...      |  10 | 12&#xA;(n+)...      |  11 | 23&#xA;(n+)...      |  17 | 89&#xA;(n+)...      |  18 | 123&#xA;(n+)...      |  19 | 234&#xA;(n+)...      |  24 | 789&#xA;(n+)...      |  25 | 1234&#xA;(n+)...      |  26 | 2345&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;p&gt;Should I allow leading zeroes in interest of reducing edge cases?&lt;/p&gt;&#xA;" OwnerUserId="107310" LastEditorUserId="107310" LastEditDate="2022-07-21T16:24:24.343" LastActivityDate="2022-07-21T16:24:24.343" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="24964" PostTypeId="2" ParentId="2140" CreationDate="2022-07-12T18:03:24.663" Score="0" Body="&lt;h1&gt;Make an ASCII art arrow &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot;&gt;ascii-art&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Given a size and direction (up, down, left, or right), you will create an ASCII art arrow.&lt;/p&gt;&#xA;&lt;h2&gt;Drawing it&lt;/h2&gt;&#xA;&lt;h3&gt;For an arrow pointing up&lt;/h3&gt;&#xA;&lt;p&gt;For size &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt;, there are &lt;span class=&quot;math-container&quot;&gt;\$2s\$&lt;/span&gt; &lt;code&gt;|&lt;/code&gt; characters in the center, with 1 &lt;code&gt;_&lt;/code&gt; character at the top. On the left of each of the top &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; pipe characters, there is a &lt;code&gt;/&lt;/code&gt; diagonally aligned with the arrow, and on the right side, the same but with backslashes.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Size 1:&#xA; _&#xA;/|\&#xA; |&#xA;&#xA;&#xA;Size 2:&#xA;  _&#xA; /|\&#xA;/ | \&#xA;  |&#xA;  |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;An arrow pointing down&lt;/h3&gt;&#xA;&lt;p&gt;Similar to an arrow facing up, it will have &lt;span class=&quot;math-container&quot;&gt;\$2s\$&lt;/span&gt; (where &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; is still the size) vertical &lt;code&gt;|&lt;/code&gt; characters, with a hyphen below them.  Starting from the bottom &lt;code&gt;|&lt;/code&gt;, diagonally distribute slashes and backslashes on each side (only going up &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; &lt;code&gt;|&lt;/code&gt; characters).&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Size 1:&#xA;&#xA; |&#xA;\|/&#xA; -&#xA;&#xA;&#xA;Size 2:&#xA;&#xA;  |&#xA;  |&#xA;\ | /&#xA; \|/&#xA;  -&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;An arrow pointing left&lt;/h3&gt;&#xA;&lt;p&gt;Where &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; is the size, there should be &lt;span class=&quot;math-container&quot;&gt;\$2s\$&lt;/span&gt; hyphens going horizontally, with 1 &lt;code&gt;|&lt;/code&gt; on the left of them. Starting from the leftmost hyphen, going up to the &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt;th hyphen, diagonally distribute &lt;code&gt;/&lt;/code&gt; and &lt;code&gt;\&lt;/code&gt; spreading out.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Size 1:&#xA;&#xA; /&#xA;|--&#xA; \&#xA;&#xA;Size 2:&#xA;&#xA;  /&#xA; /&#xA;|----&#xA; \&#xA;  \&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;An arrow pointing right&lt;/h3&gt;&#xA;&lt;p&gt;This is pretty much an arrow pointing left, but inverted.&lt;/p&gt;&#xA;&lt;p&gt;Where &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; is the size, there should be &lt;span class=&quot;math-container&quot;&gt;\$2s\$&lt;/span&gt; hyphens going horizontally, with 1 &lt;code&gt;|&lt;/code&gt; on the right of them. Starting from the rightmost hyphen, going to the &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt;th last hyphen, diagonally distribute &lt;code&gt;/&lt;/code&gt; and &lt;code&gt;\&lt;/code&gt; spreading out.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Size 1:&#xA;&#xA; \&#xA;--|&#xA; /&#xA;&#xA;Size 2:&#xA;&#xA;  \&#xA;   \&#xA;----|&#xA;   /&#xA;  /&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;As for the size, you may take any of &lt;span class=&quot;math-container&quot;&gt;\$n-1\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$n+1\$&lt;/span&gt;, or &lt;span class=&quot;math-container&quot;&gt;\$2n\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;For the direction, you may use any four consistent values.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code for each language wins.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;Standard I/O rules apply.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this clear?&lt;/li&gt;&#xA;&lt;li&gt;Is this too boring, or too similar to another challenge?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="92689" LastEditorUserId="92689" LastEditDate="2022-07-15T18:29:42.397" LastActivityDate="2022-07-15T18:29:42.397" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24965" PostTypeId="2" ParentId="2140" CreationDate="2022-07-12T20:33:00.247" Score="5" Body="&lt;h1&gt;All&lt;span class=&quot;math-container&quot;&gt;\$^{\dagger}\$&lt;/span&gt; 3-character expressions&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-generation&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-generation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$^{\dagger}\$&lt;/span&gt;&lt;em&gt;with some exceptions&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;In your golfing language of choice, given no input, output all valid 3-character expressions in that language, with the conditions described below.&lt;/p&gt;&#xA;&lt;p&gt;An &lt;strong&gt;expression&lt;/strong&gt;, for the purposes of this challenge, is a string of characters that can be evaluated to some result. An example of an expression in many languages is &lt;code&gt;1+2&lt;/code&gt;, which evaluates to &lt;code&gt;3&lt;/code&gt;. If evaluation causes an error/exception/crash (e.g. &lt;code&gt;1/0&lt;/code&gt; in Python), then it should &lt;em&gt;not&lt;/em&gt; be printed.&lt;/p&gt;&#xA;&lt;p&gt;Expressions can also have side effects (modify the state of the program), e.g. &lt;code&gt;y=2&lt;/code&gt; in Ruby. These are allowed to be output but are not required. (In other words, you only need to print out &lt;a href=&quot;https://en.wikipedia.org/wiki/Referential_transparency&quot; rel=&quot;nofollow noreferrer&quot;&gt;referentially transparent&lt;/a&gt; expressions.) Similarly, any expressions that rely on the evaluation of previous expressions, e.g. &lt;code&gt;a+2&lt;/code&gt; (which requires that the value of &lt;code&gt;a&lt;/code&gt; be set), are optional, unless they cause an error/crash, in which case they should not be output.&lt;/p&gt;&#xA;&lt;p&gt;Some additional notes:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;White space and comments do not count as part of an expression - e.g. &lt;code&gt;2  &lt;/code&gt; or &lt;code&gt;2#a&lt;/code&gt; in Python are one-character expressions, so they shouldn't be printed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Any language that does not have the concept of expressions, or has no expressions that are 3 characters long meeting the above requirements, cannot be used for this challenge.&lt;/p&gt;&#xA;&lt;p&gt;As per usual code golf, the shortest program (in bytes) wins.&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&lt;p&gt;(This is my first challenge, so I don't really know what I'm doing, and feedback is greatly appreciated.)&lt;/p&gt;&#xA;&lt;p&gt;I'm not sure how to deal with expressions that change the results of other expressions or change what counts as a valid expression, particularly in the case of side effects. For example, if in the language, evaluating any expressions causes an &amp;quot;answer&amp;quot; variable to be set, then all expressions have side effects and the challenge is moot.&lt;/p&gt;&#xA;&lt;p&gt;I was considering having the condition for passing be &amp;quot;Your program satisfies the challenge if, after running, there are no other expressions you can evaluate.&amp;quot;, but I'm unsure if that's a good requirement.&lt;/p&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2022-07-16T15:40:12.410" LastActivityDate="2022-07-16T15:40:12.410" CommentCount="17" ContentLicense="CC BY-SA 4.0" />
  <row Id="24966" PostTypeId="1" CreationDate="2022-07-13T04:13:50.903" Score="3" ViewCount="114" Body="&lt;p&gt;What I/O should be allowed for Minecraft commands answers? There is already &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/7491/minecraft-i-o-methods&quot;&gt;this&lt;/a&gt; post, but it is mainly focused on redstone creations, and is quite outdated.&lt;/p&gt;&#xA;&lt;p&gt;Here are some specific points, however, a general rule would be preferable:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is it allowed to receive numerical input in a &lt;a href=&quot;https://minecraft.fandom.com/wiki/Scoreboard&quot; rel=&quot;nofollow noreferrer&quot;&gt;scoreboard&lt;/a&gt; you choose? If it is, are you responsible for creating the objective?&lt;/li&gt;&#xA;&lt;li&gt;Is it allowed to output to a scoreboard?&lt;/li&gt;&#xA;&lt;li&gt;Is it allowed to do I/O using a &lt;a href=&quot;https://minecraft.fandom.com/wiki/Commands/data#Storage&quot; rel=&quot;nofollow noreferrer&quot;&gt;data storage&lt;/a&gt;?&lt;/li&gt;&#xA;&lt;li&gt;Is it allowed to do numerical I/O in unary as the number of entities with some tag in the world?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="46076" LastEditDate="2022-07-13T23:25:58.130" LastActivityDate="2022-07-13T23:25:58.130" Title="Minecraft Commands I/O Methods" Tags="|discussion|policy|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24967" PostTypeId="2" ParentId="24966" CreationDate="2022-07-13T08:33:44.400" Score="1" Body="&lt;p&gt;My stance on &lt;em&gt;Minecraft&lt;/em&gt; is the same as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24151/&quot;&gt;my stance on &lt;em&gt;Baba is You&lt;/em&gt;&lt;/a&gt;.  I absolutely encourage people to use &lt;em&gt;Minecraft&lt;/em&gt; and other non-programming languages, for code-golf challenges, however I don't think they should be given special rules.  Especially since it seems that these rules need to be updated when changes to the game break the existing rules.&lt;/p&gt;&#xA;&lt;p&gt;That being said I think &lt;em&gt;Minecraft&lt;/em&gt; commands can be used without special rules.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Currently it is a consensus that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7139/&quot;&gt;programs may output by displaying it on screen&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;That means that outputting to the Minecraft chat should be valid output.&#xA;The following commands all do this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;/tellraw&#xA;/msg&#xA;/w&#xA;/say&#xA;/me&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;There are other commands that provide very specific output (e.g. &lt;code&gt;/seed&lt;/code&gt;) these still are output since they print to the console but they aren't very useful for most code-golf so I'm not going to try to make a list of them.&lt;/p&gt;&#xA;&lt;p&gt;Additionally the &lt;code&gt;/title&lt;/code&gt; and &lt;code&gt;/titleraw&lt;/code&gt; commands display text but as a title rather than in the chat.  This is also valid output as it is displayed.&lt;/p&gt;&#xA;&lt;p&gt;Now messages like these are not necessarily displayed to every player. I would say it is at least always valid to display the message to all players. And if it's command run by a single player (i.e. not run by a command block or the server), then it should be sufficient that the output display to that player.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;It seems to me that it is very hard for &lt;em&gt;Minecraft&lt;/em&gt; commands to take input.  It seems that the only valid method is (currently) &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10553/&quot;&gt;hardcoding&lt;/a&gt;.  Which means you can insert the input somewhere in the commands you are running.  Note that you are only allowed to use this method if no other method is valid. I don't &lt;em&gt;think&lt;/em&gt; it is possible to use &lt;code&gt;/data&lt;/code&gt; to take input, because even though &lt;code&gt;/data&lt;/code&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2452/56656&quot;&gt;reads from a file&lt;/a&gt; it reads in a weird specific format, that I don't believe is flexible to allow you to take input on most challenges.  For example I don't see how &lt;code&gt;/data&lt;/code&gt; could be used to take an integer without special rules.&lt;/p&gt;&#xA;&lt;p&gt;So this seems to be the current permitted form of input.&lt;/p&gt;&#xA;&lt;p&gt;However if another method becomes valid or if I have overlooked some method that is already valid, this method will cease to be allowed and that method, no matter how cumbersome will be required.&lt;/p&gt;&#xA;&lt;p&gt;I personally very much dislike this. I don't think this is good, but it is currently the consensus. If you would like to use &lt;em&gt;Minecraft&lt;/em&gt; commands in a different way, I offer you the same option I offered for &lt;em&gt;Baba is You&lt;/em&gt;:&lt;/p&gt;&#xA;&lt;p&gt;If you want to do code-golf in &lt;em&gt;Minecraft&lt;/em&gt;, you can write a programming language that works like &lt;em&gt;Minecraft&lt;/em&gt;.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-07-13T08:39:38.710" LastActivityDate="2022-07-13T08:39:38.710" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24968" PostTypeId="2" ParentId="2140" CreationDate="2022-07-14T12:29:02.963" Score="3" Body="&lt;h1&gt;Infinite quote escaping sequence&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250015/infinite-quote-escaping-sequence&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2022-07-18T03:44:11.920" LastActivityDate="2022-07-18T03:44:11.920" CommentCount="15" ContentLicense="CC BY-SA 4.0" />
  <row Id="24969" PostTypeId="2" ParentId="2140" CreationDate="2022-07-15T13:01:52.090" Score="2" Body="&lt;h1&gt;Infinite Fibonacci word &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fibonacci&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fibonacci&amp;#39;&quot; rel=&quot;tag&quot;&gt;fibonacci&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The famous Fibonacci sequence of integers is defined as follows:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$&#xA;F_0 = 0 \\&#xA;F_1 = 1 \\&#xA;F_n = F_{n-1} + F_{n-2}&#xA;\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;But what if we use this same recurrence relation to produce an infinite sequence of strings? Instead of addition, we'll use concatenation. We'll also change the base case slightly:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$ F_0 = \$&lt;/span&gt; &lt;code&gt;0&lt;/code&gt;&lt;br /&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$ F_1 = \$&lt;/span&gt; &lt;code&gt;01&lt;/code&gt;&lt;br /&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$ F_n = F_{n-1}F_{n-2} \$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;The first few strings are:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0&#xA;01&#xA;010&#xA;01001&#xA;01001010&#xA;0100101001001&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Each of these &amp;quot;words&amp;quot; is a prefix of the next, so they are all prefixes of the single infinite word &lt;span class=&quot;math-container&quot;&gt;\$ F_\infty = \$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;010010100100101001010010010100100101001010010010100101001001010010010100101001001010010010100101001...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your task is to output this infinite string as a sequence; you may choose to use any two distinct values to use for 0 and 1.&lt;/p&gt;&#xA;&lt;p&gt;As with standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot;&gt;sequence&lt;/a&gt; challenges, you may choose to either:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take an input &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; and output the &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt;th item in the sequence&lt;/li&gt;&#xA;&lt;li&gt;Take an input &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; and output the first &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; item&lt;/li&gt;&#xA;&lt;li&gt;Output the sequence indefinitely, e.g. using a generator&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;and you may use 0-based or 1-based indexing for &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This string can be defined in many different ways; its OEIS entry &lt;a href=&quot;https://oeis.org/A003849&quot; rel=&quot;nofollow noreferrer&quot;&gt;A003849&lt;/a&gt; and &lt;a href=&quot;https://en.wikipedia.org/wiki/Fibonacci_word&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia page&lt;/a&gt; have more information.&lt;/p&gt;&#xA;&lt;p&gt;Errors due to floating-point imprecision are not allowed.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-07-16T07:35:41.820" LastActivityDate="2022-07-16T07:35:41.820" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="24970" PostTypeId="2" ParentId="2140" CreationDate="2022-07-16T17:01:34.467" Score="1" Body="&lt;h1&gt;Runs Between Values&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In my work, I needed to find all the indices of values in a list that were between two given values. However, because these associated values tended to come in &amp;quot;clumps&amp;quot;, it made sense to compress them into &amp;quot;runs&amp;quot;, which describe sections of the list matching the criteria based on the starting and ending index of the sequence of matching values. For example, suppose we're looking for values between &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$3\$&lt;/span&gt; in the following list:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;i =  0 1 2 3 4 5 6 7 8 9 &#xA;a = [1 4 5 3 2 1 0 5 2 3]&#xA;     ✓     ✓ ✓ ✓     ✓ ✓&#xA;i =  0     3 4 5     8 9 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;So we output &lt;span class=&quot;math-container&quot;&gt;\$[(0,0), (3,5), (8,9)]\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;More formally: Given a list of integers &lt;span class=&quot;math-container&quot;&gt;\$[a_1, ...a_n]\$&lt;/span&gt; and two integers &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt;, output all tuples of indices &lt;span class=&quot;math-container&quot;&gt;\$(i,j)\$&lt;/span&gt; where the values in the subsequence &lt;span class=&quot;math-container&quot;&gt;\$[a_i,...,a_j]\$&lt;/span&gt; are between &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt; inclusive. (The values in the subsequence do not have to be in order.) You must return as few tuples as necessary to cover all the values between &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt; - e.g. in the above example you should not return &lt;span class=&quot;math-container&quot;&gt;\$[(0,0), (3,4), (5,5), (8,9)]\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your indices may start from 0 or 1. Standard loopholes are forbidden.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://onecompiler.com/python/3ya6m5xde&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here's a program to generate test cases.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&lt;p&gt;I haven't gone through all previous challenges, so I don't know if this has been done before.&lt;/p&gt;&#xA;" OwnerUserId="113573" LastActivityDate="2022-07-16T17:01:34.467" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24972" PostTypeId="1" AcceptedAnswerId="24977" CreationDate="2022-07-18T10:22:03.430" Score="6" ViewCount="80" Body="&lt;p&gt;Due to changes in sorting the sandbox link in our info box no longer works as intended.  It should sort by active, but it doesn't.&lt;/p&gt;&#xA;&lt;p&gt;The existing link is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?answertab=active&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The fixed link should be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?answertab=modifieddesc&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The new text we would like is:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/20861/welcome-to-code-golf-and-coding-challenges-stack-exchange&quot;&gt;Welcome to Code Golf and Coding Challenges Stack Exchange!&lt;/a&gt; This is a site for recreational programming competitions, not general programming questions. Challenges must have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8130/why-do-we-have-objective-winning-criteria&quot;&gt;an objective scoring criterion&lt;/a&gt;, and it is highly recommended to first post proposed challenges in the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?answertab=modifieddesc&quot;&gt;Sandbox&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;a href=&amp;quot;https://codegolf.meta.stackexchange.com/questions/20861/welcome-to-code-golf-and-coding-challenges-stack-exchange&amp;quot;&amp;gt;Welcome to Code Golf and Coding Challenges Stack Exchange!&amp;lt;/a&amp;gt; This is a site for recreational programming competitions, not general programming questions. Challenges must have &amp;lt;a href=&amp;quot;https://codegolf.meta.stackexchange.com/questions/8130/why-do-we-have-objective-winning-criteria&amp;quot;&amp;gt;an objective scoring criterion&amp;lt;/a&amp;gt;, and it is highly recommended to first post proposed challenges in the &amp;lt;a href=&amp;quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?answertab=modifieddesc&amp;quot;&amp;gt;Sandbox&amp;lt;/a&amp;gt;.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is not pressing but we would like if this could be fixed by the SO devs by replacing the existing content with the updated content.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="113743" LastEditDate="2022-07-19T14:59:05.680" LastActivityDate="2022-07-19T14:59:05.680" Title="Fix the sandbox link in our info box" Tags="|feature-request|status-completed|hyperlinks|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24973" PostTypeId="2" ParentId="2140" CreationDate="2022-07-18T13:31:23.197" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250139/next-special-string&quot;&gt;Next Special String&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="103688" LastEditorUserId="103688" LastEditDate="2022-07-21T00:10:52.197" LastActivityDate="2022-07-21T00:10:52.197" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24974" PostTypeId="2" ParentId="2140" CreationDate="2022-07-19T08:28:44.633" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250113/count-the-cells&quot;&gt;Count the cells&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="41723" LastEditDate="2022-07-20T07:45:50.180" LastActivityDate="2022-07-20T07:45:50.180" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24975" PostTypeId="2" ParentId="2140" CreationDate="2022-07-19T11:38:11.743" Score="4" Body="&lt;h1&gt;Halve a string&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250213/generate-an-arbitrary-half-of-a-string&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2022-07-23T04:55:19.740" LastActivityDate="2022-07-23T04:55:19.740" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24977" PostTypeId="2" ParentId="24972" CreationDate="2022-07-19T14:58:55.233" Score="4" Body="&lt;p&gt;We've updated the link with your recommendation.&lt;/p&gt;&#xA;&lt;p&gt;Thanks for reporting and providing the HTML ready to go! You rock.&lt;/p&gt;&#xA;" OwnerUserId="113743" LastActivityDate="2022-07-19T14:58:55.233" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24979" PostTypeId="2" ParentId="2140" CreationDate="2022-07-20T09:20:23.720" Score="-3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250516/repeat-hello-world-according-to-another-strings-length&quot;&gt;Repeat Hello World according to another string's length&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110681" LastEditorUserId="110681" LastEditDate="2022-07-31T05:51:24.133" LastActivityDate="2022-07-31T05:51:24.133" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="24980" PostTypeId="2" ParentId="2140" CreationDate="2022-07-20T13:17:28.107" Score="1" Body="&lt;h1&gt;Verify the diamond property&lt;/h1&gt;&#xA;&lt;p&gt;A polytope is a generalization of the concepts of polygons and polyhedra to higher dimensional space.&lt;/p&gt;&#xA;&lt;p&gt;Now higher dimensional space is a little hard to picture so we have a variety of tools for thinking about and working with polytopes to ease this issue.&lt;/p&gt;&#xA;&lt;p&gt;One of these tools is a Hasse diagram.&lt;sup&gt;1&lt;/sup&gt;  The Hasse diagram doesn't preserve all information about the polytope, it is concerned with which &lt;em&gt;elements&lt;/em&gt; of the polytope are &lt;em&gt;incident&lt;/em&gt; on each other.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;em&gt;elements&lt;/em&gt; of the polytope are the polytopes that make up the polytope, so for example in a polyhedron (3d) the elements are its &lt;em&gt;faces&lt;/em&gt; (2d), &lt;em&gt;edges&lt;/em&gt; (1d), &lt;em&gt;vertices (0d)&lt;/em&gt;, the polyhedron itself, and the empty set&lt;sup&gt;2&lt;/sup&gt;.&lt;/p&gt;&#xA;&lt;p&gt;An element is incident on another if it is a subset of that element.  So for example, all the faces of a polyhedron are incident on the polyhedron itself.  No two faces are incident on each other even though they overlap at an edge.&lt;/p&gt;&#xA;&lt;p&gt;There are a couple of properties we can observe.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Every element must be incident on the polytope itself.&lt;/li&gt;&#xA;&lt;li&gt;The empty set is incident on every other element.&lt;/li&gt;&#xA;&lt;li&gt;Every element is incident on itself.&lt;/li&gt;&#xA;&lt;li&gt;Elements are only incident on other elements which are of higher dimension.&lt;/li&gt;&#xA;&lt;li&gt;Incidence is transitive: If &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; is incident on &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; is incident on &lt;span class=&quot;math-container&quot;&gt;\$C\$&lt;/span&gt;, then &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; is incident on &lt;span class=&quot;math-container&quot;&gt;\$C\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;A Hasse diagram draws the elements of the polytope as a graph; connecting incident elements.  However we leverage these facts above to simplify the graphs.  For one we organize the elements in rows by dimension.  All the vertices go in one row, all the edges go in another.  At the top we have the polytope itself, and at the bottom we have the empty set.  We don't draw connections from an element to itself. Since all elements are incident on themselves there is no point.  We also don't draw connections between elements whose dimensions differ by more than 1, since these connections can always be derived from the transitive property.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/wl1Y0.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/wl1Y0.png&quot; alt=&quot;Example image&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;Taken from &lt;a href=&quot;https://commons.wikimedia.org/wiki/File:Pyramid_abstract_polytope.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;wikimedia commons image&lt;/a&gt; by David Eppstein and Steelpillow.  This image has been released into the public domain by its authors.&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;TODO&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I started writing this challenge, and it turned out a lot more complex than I thought because I have to define what an abstract polytope is.  I don't have time right now for this and I will come back later.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sup&gt;1: Hasse diagrams are used for many things not just polytopes, but we are going to skip over that because here we are interested in polytopes.&lt;/sup&gt;&#xA;&lt;sup&gt;2: Thinking of the empty set as an element can be a little bit weird, but it does make the math simpler so we do it.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2022-07-20T13:17:28.107" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24981" PostTypeId="2" ParentId="24937" CreationDate="2022-07-21T13:30:30.740" Score="8" Body="&lt;h2&gt;Non-halting languages are allowed if their output is provably finite when required to be.&lt;/h2&gt;&#xA;&lt;p&gt;If a challenge requires infinite output, non-halting languages are of course allowed.&lt;/p&gt;&#xA;&lt;p&gt;In challenges where output must be finite, a non-halting language may output a solution and then enter some loop which can be proven to not output anything else.&lt;/p&gt;&#xA;&lt;p&gt;This proof can be as simple as &amp;quot;The instruction pointer then accesses an infinite loop command which does nothing&amp;quot; or &amp;quot;The program only outputs for &lt;code&gt;t &amp;lt; input length&lt;/code&gt;, and &lt;code&gt;t&lt;/code&gt; increases infinitely as defined by the language&amp;quot;, or as complex as need be. The non-outputting loop need not be trivial, only provably non-outputting.&lt;/p&gt;&#xA;" OwnerUserId="107310" LastActivityDate="2022-07-21T13:30:30.740" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="24982" PostTypeId="2" ParentId="2140" CreationDate="2022-07-22T08:25:42.160" Score="4" Body="&lt;h1&gt;Swap every two elements in the list every possible way&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250419/swap-every-two-elements-in-the-list-every-possible-way&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="113779" LastEditorUserId="113779" LastEditDate="2022-07-27T10:38:34.877" LastActivityDate="2022-07-27T10:38:34.877" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24983" PostTypeId="2" ParentId="2140" CreationDate="2022-07-22T19:19:06.837" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/261182/cube-calendar-numbers&quot;&gt;Cube calendar numbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2023-05-23T09:05:04.943" LastActivityDate="2023-05-23T09:05:04.943" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24984" PostTypeId="2" ParentId="2140" CreationDate="2022-07-23T03:43:23.567" Score="4" Body="&lt;h1&gt;Rearrange to a palindrome&lt;/h1&gt;&#xA;&lt;p&gt;Given a string, shuffle it so that it becomes a palindrome.&lt;/p&gt;&#xA;&lt;p&gt;For example, &lt;code&gt;adadbcc&lt;/code&gt; can be arranged into &lt;code&gt;dacbcad&lt;/code&gt;, or &lt;code&gt;dcabacd&lt;/code&gt;, &lt;code&gt;acdbdca&lt;/code&gt; and more. Any of these (or all) is acceptable, and duplicates are allowed if outputting all. Something like &lt;code&gt;abc&lt;/code&gt; cannot be shuffled into a palindrome, and you can assume it won't be inputted.&lt;/p&gt;&#xA;&lt;p&gt;(if it helps) input will only contain lowercase letters.&lt;/p&gt;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&lt;p&gt;These show one possible solution.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;nanas -&amp;gt; nasan&#xA;coconutnut -&amp;gt; conuttunoc&#xA;apotato -&amp;gt; atopota&#xA;manplancanalpanamaaaa -&amp;gt; amanaplanacanalpanama&#xA;canadadance -&amp;gt; canadedanac&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="100664" LastActivityDate="2022-07-23T03:43:23.567" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24985" PostTypeId="2" ParentId="2140" CreationDate="2022-07-23T17:51:49.550" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250365/runs-of-ones-what-fun&quot;&gt;Runs of Ones (What Fun!)&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2022-07-26T15:31:57.580" LastActivityDate="2022-07-26T15:31:57.580" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24987" PostTypeId="2" ParentId="2140" CreationDate="2022-07-24T15:47:27.693" Score="1" Body="&lt;h1&gt;Move n, out n&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to write a code, where if you move &lt;code&gt;n&lt;/code&gt; adjacent characters, the program has to output &lt;code&gt;n&lt;/code&gt;.&lt;br /&gt;&#xA;The code has to work for all integer n's &lt;span class=&quot;math-container&quot;&gt;\$0 \le n &amp;lt; \text{code-size}\$&lt;/span&gt;&lt;br /&gt;&#xA;The winning-criteria is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Code length has to be greater than &lt;code&gt;1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;You can choose which substring to move for each n&lt;/li&gt;&#xA;&lt;li&gt;Code size is &lt;em&gt;not&lt;/em&gt; measured by bytes (ofc), but by the number of characters&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Example Program&lt;/h2&gt;&#xA;&lt;h5&gt;&lt;code&gt;abcd&lt;/code&gt;&lt;/h5&gt;&#xA;&lt;p&gt;&lt;code&gt;abcd&lt;/code&gt; -&amp;gt; &lt;code&gt;0&lt;/code&gt;&lt;br /&gt;&#xA;&lt;code&gt;bcad&lt;/code&gt; -&amp;gt; &lt;code&gt;1&lt;/code&gt; (Move a)&lt;br /&gt;&#xA;&lt;code&gt;acdb&lt;/code&gt; -&amp;gt; &lt;code&gt;2&lt;/code&gt; (Move cd)&lt;br /&gt;&#xA;&lt;code&gt;bcda&lt;/code&gt; -&amp;gt; &lt;code&gt;3&lt;/code&gt; (Move bcd)&lt;/p&gt;&#xA;" OwnerUserId="96037" LastEditorUserId="96037" LastEditDate="2022-07-24T16:26:43.867" LastActivityDate="2022-07-24T16:26:43.867" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24988" PostTypeId="2" ParentId="2140" CreationDate="2022-07-25T06:50:33.860" Score="4" Body="&lt;h1&gt;Use &amp;quot;e&amp;quot; or a suffix?&lt;/h1&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;In &lt;a href=&quot;https://en.wikipedia.org/wiki/M%C4%81ori_language&quot; rel=&quot;nofollow noreferrer&quot;&gt;Māori&lt;/a&gt; (the indigenous language of New Zealand), to make a verb a command the verb is either preceded by &amp;quot;e&amp;quot; for example, &amp;quot;oma&amp;quot; (to run) -&amp;gt; &amp;quot;e oma&amp;quot;, or, it's given a passive ending to make it a &lt;a href=&quot;https://www.english-grammar-revolution.com/passive-verbs.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;passive verb&lt;/a&gt; for example &amp;quot;kōrero&amp;quot; (to speak, talk, say, etc) -&amp;gt; &amp;quot;kōrerotia&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;Besides some edge cases with &lt;a href=&quot;https://academicguides.waldenu.edu/writingcenter/grammar/verbs&quot; rel=&quot;nofollow noreferrer&quot;&gt;intransitive verbs&lt;/a&gt; and different dialects, the rule is that if the verb has exactly two short vowels or one long vowel (which have macrons over the top of them like &amp;quot;ā&amp;quot;) then the verb is preceded with &amp;quot;e&amp;quot; otherwise it is given a suffix.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Your challenge is to determine whether which case a verb fits in to. If it should be preceded by &amp;quot;e&amp;quot; output a truthy value, otherwise output a falsey value.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can assume that all the input will be lower case.&lt;/li&gt;&#xA;&lt;li&gt;You may &lt;em&gt;not&lt;/em&gt; take input with &lt;a href=&quot;https://en.wikipedia.org/wiki/Combining_character&quot; rel=&quot;nofollow noreferrer&quot;&gt;combining diacritics&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Because there are very few, if any verbs in Māori with only one short vowel, and the fact that what happens in that case depends on dialect, you don't need to handle those cases.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; so the shortest answer wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;ako -&amp;gt; true&#xA;kai -&amp;gt; true&#xA;haere -&amp;gt; false&#xA;tū -&amp;gt; true&#xA;āwhina -&amp;gt; false&#xA;kōrero -&amp;gt; false&#xA;huri -&amp;gt; true&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Thoughts on the combining diacritics rule?&lt;/li&gt;&#xA;&lt;li&gt;Are there any other rules that should be added?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;decision-problem-container&quot;&gt;decision-problem&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;string-container&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="112514" LastEditorUserId="112514" LastEditDate="2022-08-31T20:51:03.750" LastActivityDate="2022-08-31T20:51:03.750" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="24989" PostTypeId="2" ParentId="2140" CreationDate="2022-07-25T10:01:26.197" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250596/remove-redundant-parenthesis&quot;&gt;Remove redundant parenthesis&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="92689" LastEditDate="2022-08-02T00:21:36.527" LastActivityDate="2022-08-02T00:21:36.527" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="24990" PostTypeId="2" ParentId="2140" CreationDate="2022-07-25T11:15:32.317" Score="4" Body="&lt;h1&gt;Every &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt;th repeat &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; rel=&quot;tag&quot;&gt;array&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Given a list of positive integers, and another integer &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt;, output every &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt;th instance of each distinct item in the list, starting with the first, in the order they appear in the original list.&lt;/p&gt;&#xA;&lt;p&gt;For example, with &lt;span class=&quot;math-container&quot;&gt;\$ n = 2 \$&lt;/span&gt;, we will output the first instance of each item, but not the second, but we will output the third, and so on.&lt;/p&gt;&#xA;&lt;p&gt;If &lt;span class=&quot;math-container&quot;&gt;\$ n = 2 \$&lt;/span&gt; and the list is &lt;code&gt;4 1 3 2 3 1 6 3 4 1 1&lt;/code&gt;, then:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;1&lt;/code&gt; occurs four times, so only the first and third will be kept&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;4&lt;/code&gt; occurs twice, and only the first will be kept&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;3&lt;/code&gt; occurs three times; the first and third will be kept&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;2&lt;/code&gt; and &lt;code&gt;6&lt;/code&gt; only occur once each, so their first and only occurrences will be kept&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Therefore, the output is &lt;code&gt;4 1 3 2 6 3 1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;todo&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/250213&quot;&gt;Related&lt;/a&gt; (&lt;span class=&quot;math-container&quot;&gt;\$ n = 2 \$&lt;/span&gt;, and more open ended)&lt;/li&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Is this clear enough?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2022-07-25T11:15:32.317" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24991" PostTypeId="2" ParentId="2140" CreationDate="2022-07-25T13:38:18.997" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250338/shifted-auto-sum&quot;&gt;Shifted auto-sum&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="41723" LastEditDate="2022-07-26T07:48:37.930" LastActivityDate="2022-07-26T07:48:37.930" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24992" PostTypeId="2" ParentId="2140" CreationDate="2022-07-25T14:41:20.363" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250535/ies-extra-robust-color-parsing&quot;&gt;IE's Extra Robust Color Parsing®&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="92572" LastEditorUserId="92572" LastEditDate="2022-07-31T12:12:53.940" LastActivityDate="2022-07-31T12:12:53.940" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="24993" PostTypeId="2" ParentId="2140" CreationDate="2022-07-26T01:28:12.310" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/250395/78410&quot;&gt;Have you heard of tralindromes?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-07-27T00:38:00.150" LastActivityDate="2022-07-27T00:38:00.150" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24994" PostTypeId="2" ParentId="24937" CreationDate="2022-07-26T13:08:13.463" Score="-2" Body="&lt;h2&gt;Non halting languages must output a &amp;quot;halt message&amp;quot; after outputting a solution, and then provably output nothing after it.&lt;/h2&gt;&#xA;&lt;p&gt;Similar to the other answer, but I didn't want to edit the existing answer since it has votes already.&lt;/p&gt;&#xA;&lt;p&gt;If a challenge requires/allows infinite output, non-halting languages are obviously allowed to participate.&lt;/p&gt;&#xA;&lt;p&gt;In a challenge where output must be finite, a non-halting language may output a solution, followed by a message/output indicating that the program has halted, and then enter a loop which is proven in the answer to not output anything. This loop and its proof can be as simple as &lt;code&gt;While(1){do nothing}&lt;/code&gt;, more nuanced as &amp;quot;The program only outputs while &lt;code&gt;t&amp;lt;100&lt;/code&gt;, and every step of the program, &lt;code&gt;t&lt;/code&gt; increases&amp;quot;, or as complex as need be, just so long as it can be proven to not output anything.&lt;/p&gt;&#xA;&lt;p&gt;The halt message ensures that the program entering its infinite non-outputting phase can not be confused with it taking a while to generate the answer. I overlooked this in my previous answer.&lt;/p&gt;&#xA;&lt;p&gt;The halt message can be any reasonable/consistent output determined by the solver. This can range from things like outputting a &lt;code&gt;0&lt;/code&gt; or a newline, printing some error to stderr, or it could be something along the lines of printing the input again if that would be reasonable for the challenge.&lt;/p&gt;&#xA;&lt;p&gt;For example, in a challenge where you have to take &lt;code&gt;n&lt;/code&gt; and output the &lt;code&gt;n&lt;/code&gt;th prime number, you could output the &lt;code&gt;n&lt;/code&gt;th prime, followed by &lt;code&gt;n&lt;/code&gt; to indicate you were finished. It would be &lt;em&gt;unreasonable&lt;/em&gt;, however, to output the input as your halting message if the challenge were to output the input, even if you output it twice. Use the sort of judgement you would for determining if an answer's decision problem outputs are reasonable.&lt;/p&gt;&#xA;" OwnerUserId="107310" LastActivityDate="2022-07-26T13:08:13.463" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="24995" PostTypeId="2" ParentId="2140" CreationDate="2022-07-26T17:04:44.930" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/266004/is-it-a-valid-crossword-grid&quot;&gt;Is it a Valid Crossword Grid?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2023-10-15T18:22:53.707" LastActivityDate="2023-10-15T18:22:53.707" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="24996" PostTypeId="2" ParentId="2140" CreationDate="2022-07-28T01:20:59.673" Score="0" Body="&lt;h1&gt;Get string from CIGAR and reference&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/alignment&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;alignment&amp;#39;&quot; rel=&quot;tag&quot;&gt;alignment&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In the field of genomics, &lt;strong&gt;CIGAR&lt;/strong&gt; (Concise Idiosyncratic Gapped Alignment Report) &lt;strong&gt;strings&lt;/strong&gt; are sometimes used to indicate how a DNA sequence aligns to a reference sequence of DNA. CIGAR strings are sequences of &lt;code&gt;&amp;lt;operation, length&amp;gt;&lt;/code&gt; pairs. An operation can be &lt;code&gt;M&lt;/code&gt;, meaning &amp;quot;match&amp;quot;, &lt;code&gt;I&lt;/code&gt;, meaning &amp;quot;insert&amp;quot;, or &lt;code&gt;D&lt;/code&gt;, meaning delete. The length describes the number of times the operation is repeated&lt;sup&gt;1&lt;/sup&gt;. (For our purposes, we'll assume a match means that both matched characters are the same -- i.e. an alignment match.)&lt;/p&gt;&#xA;&lt;p&gt;Suppose we align string &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; to reference string &lt;span class=&quot;math-container&quot;&gt;\$R\$&lt;/span&gt;, producing CIGAR string &lt;span class=&quot;math-container&quot;&gt;\$C\$&lt;/span&gt;. You can think of the CIGAR string &lt;span class=&quot;math-container&quot;&gt;\$C\$&lt;/span&gt; as operations applied to &lt;span class=&quot;math-container&quot;&gt;\$R\$&lt;/span&gt; to turn it into &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;. If we treat &lt;span class=&quot;math-container&quot;&gt;\$R\$&lt;/span&gt; as a sequence of consumable tokens, then to get &lt;span class=&quot;math-container&quot;&gt;\$R\$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Iterate through the pairs &lt;code&gt;&amp;lt;operation, length&amp;gt;&lt;/code&gt; in &lt;span class=&quot;math-container&quot;&gt;\$C\$&lt;/span&gt;:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;length&lt;/code&gt; times, repeat &lt;code&gt;operation&lt;/code&gt;:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;code&gt;operation&lt;/code&gt; is &lt;code&gt;I&lt;/code&gt;, output a character different than the current token of &lt;span class=&quot;math-container&quot;&gt;\$R\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;operation&lt;/code&gt; is &lt;code&gt;D&lt;/code&gt;, consume the current token of &lt;span class=&quot;math-container&quot;&gt;\$R\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;operation&lt;/code&gt; is &lt;code&gt;M&lt;/code&gt;, consume and output the current token of &lt;span class=&quot;math-container&quot;&gt;\$R\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;(Note: You can assume that for any input CIGAR string, all tokens in &lt;span class=&quot;math-container&quot;&gt;\$R\$&lt;/span&gt; will be consumed. In other words, the length of &lt;span class=&quot;math-container&quot;&gt;\$R\$&lt;/span&gt; equals the number of &lt;code&gt;M&lt;/code&gt; and &lt;code&gt;D&lt;/code&gt; operations applied.)&lt;/p&gt;&#xA;&lt;p&gt;For example, suppose we've aligned the DNA string &lt;code&gt;ACAACTA&lt;/code&gt; to the reference &lt;code&gt;ACTCAGTA&lt;/code&gt; as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;AC-AAC--TAC &#xA;ACT--CAGTAC&#xA;MMDIIMDDMMM&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This would be encoded as &lt;code&gt;M2D1I2M1D2M3&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Another example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;-G-T--G-AT--GGCG-T&#xA;AGCTGCGCATAA-GC-A-&#xA;DMDMDDMDMMDDIDDIDI&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Which is encoded as &lt;code&gt;D1M1D1M1D2M1D1M2D2I1D2I1D1I1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;The challenge:&lt;/strong&gt; Given the reference string &lt;span class=&quot;math-container&quot;&gt;\$R\$&lt;/span&gt; and a CIGAR string &lt;span class=&quot;math-container&quot;&gt;\$C\$&lt;/span&gt;, output a string &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; which would produce the CIGAR string &lt;span class=&quot;math-container&quot;&gt;\$C\$&lt;/span&gt; when aligned to &lt;span class=&quot;math-container&quot;&gt;\$R\$&lt;/span&gt;. (There are obviously many cases where there are many possible strings which satisfy this condition -- you can output any one of them.)&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;&lt;span class=&quot;math-container&quot;&gt;\$R\$&lt;/span&gt;&lt;/th&gt;&#xA;&lt;th&gt;&lt;span class=&quot;math-container&quot;&gt;\$C\$&lt;/span&gt;&lt;/th&gt;&#xA;&lt;th&gt;&lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;AAA&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;M3&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;AAA&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;AAA&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;I3D3&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;CCC&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;AAA&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;D3I3&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;CCC&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;AAA&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;D1I1D1I2D1&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;CCC&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;AAA&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;D3&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt; &lt;/code&gt; (the empty string)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;AAA&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;M1D2I1&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;AC&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;ACTCAGTA&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;M2D1I2M1D2M3&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;ACAACTA&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;AGCTGCGCATAAGCA&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;D1M1D1M1D2M1D1M2D2I1D2I1D1I1&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;GTGATGGCGT&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;Standard loopholes are forbidden. Because this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, the shortest program wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt;Paraphrased from &lt;a href=&quot;https://www.ebi.ac.uk/about/vertebrate-genomics/software/exonerate-manual&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.ebi.ac.uk/about/vertebrate-genomics/software/exonerate-manual&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Questions&lt;/h1&gt;&#xA;&lt;p&gt;The more obvious question would be &amp;quot;given reference &lt;span class=&quot;math-container&quot;&gt;\$R\$&lt;/span&gt; and aligning string &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;, find the cigar string corresponding to the best possible alignment&amp;quot;, but that probably has been done already, and I've already accidentally posted a duplicate question...&lt;/p&gt;&#xA;&lt;p&gt;I almost certainly should explain alignment better, but I'm not sure how to do it.&lt;/p&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2022-07-28T01:27:42.613" LastActivityDate="2022-07-28T01:27:42.613" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24997" PostTypeId="2" ParentId="2140" CreationDate="2022-07-28T16:17:22.100" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/250675/107299&quot;&gt;Find The Average String&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="107299" LastEditorUserId="107299" LastEditDate="2022-08-03T17:30:15.447" LastActivityDate="2022-08-03T17:30:15.447" CommentCount="20" ContentLicense="CC BY-SA 4.0" />
  <row Id="24998" PostTypeId="2" ParentId="2140" CreationDate="2022-07-29T17:37:38.897" Score="-4" Body="&lt;h1&gt;Is it a Homestuck handle?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In the interactive webcomic &lt;em&gt;Homestuck&lt;/em&gt;, the in-universe chat clients require users to have chat handles. These handles always consist of two words in camelCase. The heroes in the story almost all have handles where both words start with a DNA base (A, C, T, or G), with one exception.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ahvf3.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ahvf3.png&quot; alt=&quot;A chart of homestuck hero chat handles&quot; /&gt;&lt;/a&gt;&#xA;(Taken from &lt;a href=&quot;https://mspaintadventures.fandom.com/wiki/Handle&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://mspaintadventures.fandom.com/wiki/Handle&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is, given a string (or list of characters), determine if it's one of the heroes' handles -- in other words, if it's in the set &lt;code&gt;{gardenGnostic, gallowsCalibrator, grimAuxiliatrix, ghostyTrickster, ectoBiologist, gutsyGumshoe, golgothasTerror, carcinoGeneticist, cuttlefishCuller, caligulasAquarium, centaursTesticle, arachnidsGrip, arsenicCatnip, apocalypseArisen, adiosToreador, turntechGodhead, terminallyCapricious, twinArmageddons, tentacleTherapist, tipsyGnostalgic, timaeusTestified}&lt;/code&gt;. You can output any two distinct values for &amp;quot;yes&amp;quot; and &amp;quot;no&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;Standard loopholes are forbidden. The shortest code wins.&lt;/p&gt;&#xA;&lt;h1&gt;Questions&lt;/h1&gt;&#xA;&lt;p&gt;I actually don't know anything about &lt;em&gt;Homestuck&lt;/em&gt;, so I probably messed something up in the question.&lt;/p&gt;&#xA;" OwnerUserId="113573" LastActivityDate="2022-07-29T17:37:38.897" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="24999" PostTypeId="2" ParentId="2140" CreationDate="2022-07-29T18:37:09.010" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250507/generate-number-set-with-conditions-using-n-numbers&quot;&gt;&lt;h1&gt;Generate number set with conditions using n numbers&lt;/h1&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="113906" LastEditorUserId="113906" LastEditDate="2022-07-30T16:31:43.713" LastActivityDate="2022-07-30T16:31:43.713" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25001" PostTypeId="2" ParentId="2140" CreationDate="2022-08-01T15:02:29.427" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251837/solve-a-jigsaw-puzzle&quot;&gt;Solve a jigsaw puzzle&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2022-09-09T13:46:47.653" LastActivityDate="2022-09-09T13:46:47.653" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25002" PostTypeId="1" CreationDate="2022-08-01T20:00:34.510" Score="10" ViewCount="662" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19271/reviving-language-of-the-month-pick-up-where-we-left-off-or-start-over&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout August 2022, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Knight&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;What's a Language of the Month?&lt;/h2&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19279/nominations-for-language-of-the-month-take-2?answertab=scoredesc#tab-top&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during August, those who wish to participate should learn (at least the basics of) Knight, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about Knight&lt;/h2&gt;&#xA;&lt;p&gt;Knight is a new programming language created in April 2021 by sampersand. It is a Polish notation language (meaning &lt;code&gt;x + y&lt;/code&gt; is &lt;code&gt;+ x y&lt;/code&gt;, and everything has fixed arity) which is relatively simple. It has some useful string manipulation tools, eval, shell commands, and type coercion.&lt;/p&gt;&#xA;&lt;h3&gt;Interpreters&lt;/h3&gt;&#xA;&lt;p&gt;There is a list of interpreters on the &lt;a href=&quot;https://github.com/knight-lang/knight-lang&quot; rel=&quot;nofollow noreferrer&quot;&gt;official GitHub page&lt;/a&gt;. It has been ported to many languages, even itself.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##rVltV9vKEf5s/4rFOVhaWU5kQc@5x7bMIbmQckogF5LmA7hByDLoVJZdSYZLCf3r6czsi1Z@SZv28sGydp@ZnXl2dmbWRN27KPr@KsmidDmJh0U5Seav70dNcyRNbmtDUfm0iFdAeZLd1YbKZCYwk3iaZDFLU5bOszv6aOrRT2efP7Be9Xr56YL51etfDy/YfvV6fPaO/VK9XnxmvQp8fHppYM8@nxrQz2cfDi//Yhec2fjRZv/q/Ynr2cNLWFZMRvdhzhxeCZgosFWrGI3YfjV3dvQFJzOYJI@@Mfw@HK5gcBnCoJuASVOOwBrm7fn5KYHw44Cc7KNvhiEX7wUA5A1bH8J0GXN@lY15s0l@wK5cjYOL1tH5sf39vPXnOE3nLvsyz9PJTus7h@HWQCAdgMbhjAUoM2g2QfEizIvY5uy52UiykiWDZgNGaRGXOdNlFsEICUfwXs4WbrHIrvxx8Oy53gvoaCSgjvDw9HDgzRtUnyzY431SxsUijOJmA76nsQ3jIG4LM1zWui6vs@vpdc6eX67GNu@/anEypZFMma2tDZj1yuJMqFCjOzB6ncFwpyNGwM5GnBaxOfAizInu4@jvbDrPWbac3cZ5Ie1hdlJMkrukVFphdXSn52qPxNNhPY91mCMt73Q46zLLs2AJtDThLI/LZZ4xFRZCjCJjsGrDQ5gn4W0aKyvAiHT@GOd2BOspQ9i3b0wZF9FbRER8tbikJ9ngehL0XNijQA@vWIcHTQYkQLLJcmHjljLJaZfB27rB4tgXQpsw49qyKptaltg0EAYPtFEMlECagO9g2SIsSlbex6AszEsAyw1wFKO4oRFHT5SxxunZaix89jhtdKMig8zH0C2TeQZmY8R6YzAtUowUy8UCCecqqtSISb8Zf0C7QTbqUKG8yCCOIWVh5ErLBSufLH2uxcAxDmD66mPaQjNVkFHGE67aaDeaGsIpjux9z@1xdBCHtRPkYLZM0zB/Mh2t9ufC2J6PlraMFpTyy2xFmpbo4RIyKWzy9PDo7bub33ZOfz03HDbV3iYb9frrendqit@fXG7RWMY5qQyzCfvHMlSvqPbBXGJvfQlBwHtLc3GygQsS3q8L1zEvlCrzZYY7NJBp1ynnha1yJR0ACO0yiRjN3i6nV/7@WNohNrpN6UEbUCzgWJVTG6Dg/26aTloq71DZcVHJqgI4FFqBKGhi/RpuyHp7dT/ReYzFA9Yq82XcghjU4xiSMD4NIYPgRAsjq1WRgH6i77LyEB1f387nKczc1hnY6mvl1o8ccn7eI9PM2zUzU7Qx@0NthKAt52lqm6a6zHOhQvwPJmdrJmMV/nD48czFWiwCDV5Prnqe50E4gSvwqt6K5J/x15LhY2DEqOEtMgBvLn749LkX9FRJxwyHVR0f9OmLxx4Ajk9Ojxw2heQ4aOjQluthGo7ChZvGGXUABleqMRKcwbnbRsaqINYmLG1YcOyEegmoxUPiYgBFJcFJnTei2WJlB4ikZFylEKQpGeMyxWNSRve2A8ys9VHAEZN/EdYp69DqM1xFAAIkFDsxyMK8TU5J9bIXrIUsH1AVrhDUcJY5li7qOa/G/LkKM2igKLeLhS9g4bruHDKezdve71P8q5AfAQlaBUd3cZlCu2i3aS/buENYIidJxgfJ1LZpP7EhiO5ztMWFOOVcbHPgDTbaCg9ObYBY70isJzpHzAaSkIGyF0mSubOy8m3lj8DrmXfVDEqaFGvMDWAwGiD@gsV8EWe2sbDbylvUKoBVwUxUSojHwPf2f6Fx2VzYoiOZgukTdApaOAhZF/s7gEPvQG@4BiytwsuGQdYJqBXCEwtILukGPbQWUY0anID5Zs9S0Vh58ht4Ev8ObRye9jU/d2q7TreCHcxka8DTtfCAVdI6Lwb8V6sv@8QNgawzn6xArTNqi22sQVwVodFon1eN5Vo6VKKX1BzauwUK1g/DujDQCa2PuS5kUt6qoGoCy0scZlLtthIma5a5AzK3SBbOKxbwYIiLD5Im9rNGHWu36SrV7SJ0LNrca2q3G8qs3ddOAfbY8MaZOmq5Yf6yLNTu65gQvZ4wqKMNojwJ@RJTMoaWsT2im27Ud1vcSxENfT9TseSLPcf@lw6D2ABC4TCe8kB56fPNoRqFpXrIrrPXqWji6jvq4tCNuvQsZY6QfnXXotOIdmzV6/YKIafanQ0srJbnDTw4azyIfd3EwmyDaw5hAlMJCUANsilDBtY1XPIQNOh2SZ8kikrm6kYLRsva6X/zQ2LebCZm94dCu5uF/kZs1hwSVwca800vB5J2wXrAuj3NMmGB@h6cs24PzljPBPs/iR5CeqxhgwChtG5fjXiKciLaH3mSa59Tu@IExH9z9UDQJLkCdwRKsFhi4DteGe7jPLYKls2hh07SMsnYY/gEvLHJHO6kZXwX5yCzmGdxViYh3iLgJM/ZY8zuw4cYgFIRwks2C7MlhM/TaxxF726RcaCCmCiWaYk/GtDiOuEpSNfEqCVXKDPlNGRFPerbjvS2G6JhwxrKo/t5mGJtfAKvs0kaT9hNZfaN1vKM30RjZixSOTNCZd2ueucEb0ioY5j@ovPgkIJ1pfBh0qvlxaCeFQ@YefiH5jFA0b78xa3NBOCA1RpFGnSZkQ1RhyckVcn1RR1A7E4A1cbogkZwKDG05pN5n83iWbTAMMvY6Obg/3Vl9Ae4MlKu7GzwJZC@SFcOtrMvVt1gMk4fsBrA1whfFdCdTXZWL9o9lXlMBdq8dpX@0JdNteHAlJSpRMt/@2/kZQ4y1Gj5gdU30bU2dxUbVFm3Pv3TFxnV21Y3GcQ1arcZnQoJgxrHQU3aSJMogYhOR4sJk7@Ae@JXL7PRrHnHzN5Fip3Uu3aEGvIHfn/PoOW9uDIERofVMQvQ@h0pkxcPV5@FvVpDeymIXlE6WC15/qaSt8d1H@Br6X0a/A8NERqGT9yKSDf/uh0yeyMfPMRVOz1skqhBEPEvJulBiI48CbD6JJ6GkCTBM9VhJhlMJhP6ESmMSihT1m5kYc@JI5xtucWiMl0DoRuUPyTMwiTDZpWF@V3kklLHge8PHH@uovsl/gPH9sia@jXu5fu/AQ&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;C (gcc) – Try It Online&quot;&gt;Here is an interpreter on TIO&lt;/a&gt;, a patch to a previous commit to &lt;a href=&quot;https://github.com/knight-lang/c/tree/master/golf&quot; rel=&quot;nofollow noreferrer&quot;&gt;c/golf&lt;/a&gt; which updates and fixes some conformance issues. (Note that it memory leaks like crazy and segfaults on malformed inputs).&lt;/p&gt;&#xA;&lt;p&gt;However, the &amp;quot;preferred&amp;quot; interpreter is &lt;a href=&quot;https://github.com/knight-lang/c/tree/master/ast&quot; rel=&quot;nofollow noreferrer&quot;&gt;c/ast&lt;/a&gt;, which is the fastest, most up-to-date interpreter and has actual error checking.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;EDIT:&lt;/strong&gt; I (Steffan) put a JS interpreter on TIO &lt;a href=&quot;https://tio.run/##lVjZcts2FH3vV9BsahESTcuZTjsWTXsS12kzbeQ0dptpJSUCQUhiQhEKF9upxP56ei@4gdqc5iEjAgd3w7kL/IHe0ZhF/iI5CoXHv7CAxrH2a@hPZ8lVFIlI4w8JD71Yk1/LLAe8plHMm/vKmRL1Jg0Tf/447iaJOJ0vmQjjJEpZIiKDkmUy82MrFmnEuEMz2PEXb2d@wuMFZdwo9uc0YTPj@J0xGI6Gg2EM61lv1Fl9O3g3DEdtYxiunhDSPibZgvOPsBvxJI1CTRE@6I5WqzANgiwX5prM6ZJlwBONOq7FHzgzFDixCxF4xHEceoE/eirEUX5bceqC7QYFNVbAw2kyIyYdsBHJEgGO@@F0q1VZJsOh3f71@urGGYzsPFR/0iDlyzihic@0Bd6C4ZKla22Ex55AFO9oBD50bXomxRT6bdrp5P4xR64P6MgqZdn@xGCksIdliq9ZlIYy7JG410J@nzMi87ibTres7/BOCrHqTcD107nLox24chNwz4UIOA13AKvdrGDVbxCMiAYV8fLQrZEsThco3ZSi3ns0ocC13FFFyRZniu/63DZPiu8maMO&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;. It's from the &lt;a href=&quot;https://github.com/knight-lang/knight.js&quot; rel=&quot;nofollow noreferrer&quot;&gt;JS implementation on GitHub&lt;/a&gt;, but compiled into one file. Note: When putting input into the program, make sure to put a trailing newline. Otherwise, it will infinitely loop, unfortunately.&lt;/p&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/knight-lang/knight-lang&quot; rel=&quot;nofollow noreferrer&quot;&gt;Main GitHub&lt;/a&gt; (has spec, test suite, examples)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/knight-lang/knight-lang/blob/master/specs.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;Official spec&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://discord.gg/A7RVbhMYFC&quot; rel=&quot;nofollow noreferrer&quot;&gt;Official Discord&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://esolangs.org/wiki/Knight&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolangs.org entry&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/138265/knight&quot;&gt;SE Chatroom&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I (Steffan) will also offer a +100 bounty for any user's 3rd Knight answer in August.&lt;/p&gt;&#xA;" OwnerUserId="92689" LastEditorUserId="92689" LastEditDate="2022-08-04T17:18:18.893" LastActivityDate="2022-08-27T20:43:06.440" Title="Language of the Month for August 2022: Knight" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25003" PostTypeId="2" ParentId="25002" CreationDate="2022-08-01T20:00:34.510" Score="5" Body="&lt;h1&gt;List of all Knight answers posted in August 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/97859/encode-the-alphabet-cipher/250600#250600&quot;&gt;Encode the alphabet cipher&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/251093/104135&quot;&gt;Encode the alphabet cipher&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104135/sampersand&quot;&gt;Sampersand&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250338/shifted-auto-sum/250602#250602&quot;&gt;Shifted auto-sum&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/66202/product-over-a-range/250606#250606&quot;&gt;Product over a range&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250556/transform-characters-of-your-choice-into-hello-world/250611#250611&quot;&gt;Transform characters of your choice into &amp;quot;Hello, world!&amp;quot;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/113573/adam&quot;&gt;Adam&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250516/repeat-hello-world-according-to-another-strings-length/250612#250612&quot;&gt;Repeat Hello World according to another string&amp;#39;s length&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/113573/adam&quot;&gt;Adam&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/133109/sum-of-all-integers-from-1-to-n/250613#250613&quot;&gt;Sum of all integers from 1 to n&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/250619/78410&quot;&gt;The vanilla factorial challenge&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/250620/78410&quot;&gt;The vanilla factorial challenge&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/218260/write-a-deadfish-interpreter/250621#250621&quot;&gt;Write a Deadfish Interpreter&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/113573/adam&quot;&gt;Adam&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/55422/hello-world/250622#250622&quot;&gt;&amp;quot;Hello, World!&amp;quot;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/113573/adam&quot;&gt;Adam&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/250623/78410&quot;&gt;Print a 10 by 10 grid of asterisks&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/250626/78410&quot;&gt;Determine whether strings are anagrams&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/251096/104135&quot;&gt;Determine whether strings are anagrams&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104135/sampersand&quot;&gt;Sampersand&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/250635/78410&quot;&gt;Print the last, middle and first character of your code&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/66193/sums-of-consecutive-integers/250640#250640&quot;&gt;Sums of Consecutive Integers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/113573/adam&quot;&gt;Adam&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/1294/determine-whether-strings-are-anagrams/250647#250647&quot;&gt;Determine whether strings are anagrams&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/247804/reverse-hex-cipher/250651#250651&quot;&gt;Reverse hex cipher&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250242/multiply-numbers-by-their-depth/250652#250652&quot;&gt;Multiply numbers by their depth&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/250658/78410&quot;&gt;Reverse hex cipher&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/101638/shortest-code-to-produce-non-deterministic-output/250660#250660&quot;&gt;Shortest code to produce non-deterministic output&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/250665/78410&quot;&gt;Does the start equal the end?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250447/triangle-area-from-side-lengths&quot;&gt;Triangle area from side lengths&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/113573/adam&quot;&gt;Adam&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/125470/multiply-two-strings/250681#250681&quot;&gt;&amp;quot;Multiply&amp;quot; two strings&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/53675/calculate-average-characters-of-string/250682#250682&quot;&gt;Calculate average characters of string&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249523/erverse-hte-ifrst-wto-eltters-fo-aech-owrd/250684#250684&quot;&gt;Erverse Hte Ifrst Wto Eltters fo Aech Owrd&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/113573/adam&quot;&gt;Adam&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/1294/determine-whether-strings-are-anagrams/250686#250686&quot;&gt;Determine whether strings are anagrams&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/113573/adam&quot;&gt;Adam&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/101638/shortest-code-to-produce-non-deterministic-output/250693#250693&quot;&gt;Shortest code to produce non-deterministic output&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/113573/adam&quot;&gt;Adam&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/199353/is-this-a-triangle/250692#250692&quot;&gt;Is this a triangle?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/113573/adam&quot;&gt;Adam&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/60106/summation-from-a-to-b/250695#250695&quot;&gt;Summation from a to b&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/176010/strange-addition/250696#250696&quot;&gt;Strange Addition&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/1775/additive-persistence/250697#250697&quot;&gt;Additive Persistence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/125237/its-hip-to-be-square/250710#250710&quot;&gt;It&amp;#39;s Hip to be Square&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/113573/adam&quot;&gt;Adam&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/89283/print-an-alphabet-wave/250713#250713&quot;&gt;Print an alphabet wave&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/113573/adam&quot;&gt;Adam&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/70365/construct-the-identity-matrix/250721#250721&quot;&gt;Construct the Identity Matrix&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/113573/adam&quot;&gt;Adam&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/59347/shortest-infinite-loop-producing-no-output/250722#250722&quot;&gt;Shortest infinite loop producing no output&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/113573/adam&quot;&gt;Adam&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/69156/find-ranges-of-true-values-in-a-list/250753#250753&quot;&gt;Find ranges of True values in a list&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/15469/jonah&quot;&gt;Jonah&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/97472/trick-or-treat-polyglot/250755#250755&quot;&gt;Trick or Treat polyglot&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/15469/jonah&quot;&gt;Jonah&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250745/cryptic-multiplications/250757#250757&quot;&gt;Cryptic Multiplications&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249788/backronymiser/250758#250758&quot;&gt;Backronymiser឵឵&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/15469/jonah&quot;&gt;Jonah&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/237085/swap-every-two-elements-in-a-list/250759#250759&quot;&gt;Swap every two elements in a list&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210976/lolololololololololololol/250760#250760&quot;&gt;Lolololololololololololol&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/63834/count-up-forever/250761#250761&quot;&gt;Count up forever&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/13152/shortest-code-to-produce-infinite-output/250762#250762&quot;&gt;Shortest code to produce infinite output&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/219576/print-0-to-100-without-1-9-characters/250767#250767&quot;&gt;Print 0 to 100 without 1-9 characters&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/219945/print-a-z-and-their-alphabet-index-without-using-1-2-4-6/250771#250771&quot;&gt;Print A-Z and their alphabet index without using 1,2,4,6&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/219495/1-2-miss-a-few-99-100/250772#250772&quot;&gt;1, 2, miss a few, 99, 100&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/203062/triangular-code-triangular-output/250773#250773&quot;&gt;Triangular code, triangular output&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/201650/hello-ascii-world/250774#250774&quot;&gt;Hello ASCII World!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249247/print-the-ascii-code-page/250794#250794&quot;&gt;Print the ASCII Code page&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/85088/print-the-ascii-printable-character-set/250795#250795&quot;&gt;Print the ASCII printable character set&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250781/implement-string-projection/250801#250801&quot;&gt;Implement String Projection&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249384/pairs-at-every-distance/250854#250854&quot;&gt;Pairs at every distance&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250883/anti-divisors-of-a-number/250897#250897&quot;&gt;Anti-divisors of a number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/223881/implement-an-over-function/250934#250934&quot;&gt;Implement an Over function&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/113573/adam&quot;&gt;Adam&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250942/divisor-of-a-string/250961#250961&quot;&gt;Divisor of a string&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251002/a-better-hexagony-template/251035#251035&quot;&gt;A better Hexagony template&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/104604/could-you-make-me-a-hexagon-please/251039#251039&quot;&gt;Could you make me a hexagon please?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/66708/unfolding-the-hexagony-source-code/251044#251044&quot;&gt;Unfolding the Hexagony source code&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/193021/i-reverse-the-source-code-you-negate-the-input/251047#251047&quot;&gt;I reverse the source code, you negate the input!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/192979/i-reverse-the-source-code-you-negate-the-output/251048#251048&quot;&gt;I reverse the source code, you negate the output!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/247536/smallest-subset-of-characters-required-for-turing-completeness/251069#251069&quot;&gt;Smallest subset of characters required for Turing Completeness&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/110648/fewest-distinct-characters-for-turing-completeness/251072#251072&quot;&gt;Fewest (distinct) characters for Turing Completeness&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/77866/numbers-with-rotational-symmetry/251098#251098&quot;&gt;Numbers with Rotational Symmetry&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251101/a-challenge-for-rookies/251119#251119&quot;&gt;A challenge for rookies&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251050/smallest-number-of-steps-for-a-knight-in-chess/251122#251122&quot;&gt;smallest number of steps for a knight in chess&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/209805/prime-challenge/251128#251128&quot;&gt;Prime Challenge&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/189240/repeated-factorials/251141#251141&quot;&gt;Repeated! Factorials!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/123685/covfefify-a-string/251074#251074&quot;&gt;Covfefify a string&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/87064/print-output-the-l-phabet/251184#251184&quot;&gt;Print/Output the L-phabet&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/110582/im-a-palindrome-are-you/251185#251185&quot;&gt;I&amp;#39;m a palindrome. Are you?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/163141/ot-wes-thi-bist-uf-tomis/251203#251203&quot;&gt;Ot wes thi bist uf tomis&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/12177/collatz-conjecture-oeis-a006577/251225#251225&quot;&gt;Collatz Conjecture (OEIS A006577)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/113573/adam&quot;&gt;Adam&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/83377/write-a-program-to-elasticize-strings/251231#251231&quot;&gt;Write a program to elasticize strings&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104135/sampersand&quot;&gt;Sampersand&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/133486/find-an-illegal-string/251232#251232&quot;&gt;Find an Illegal String&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104135/sampersand&quot;&gt;Sampersand&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/77043/stretch-the-word/251247#251247&quot;&gt;Stretch the word&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/5056/code-golf-permutations/251253#251253&quot;&gt;Code-Golf: Permutations&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/96271/exploded-suffixes/251263#251263&quot;&gt;Exploded Suffixes&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/102496/interleave-strings/251303#251303&quot;&gt;Interleave strings&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251283/carry-less-sum-given-a-base-b/251309#251309&quot;&gt;Carry-less sum given a base b&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/160646/output-your-score/251323#251323&quot;&gt;Output your Score!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/91473/benji&quot;&gt;Benji&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/200363/find-the-number-of-integers-in-the-range-from-1-to-n-that-ends-with-2/251320#251320&quot;&gt;Find the number of integers in the range from 1 to N that ends with 2&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/91473/benji&quot;&gt;Benji&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251161/radiation-hardening-koth/251317#251317&quot;&gt;Radiation Hardening KOTH&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/129596/am-i-divisible-by-double-the-sum-of-my-digits/251328#251328&quot;&gt;Am I divisible by double the sum of my digits?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/185872/dad-jokes-are-fun/251350#251350&quot;&gt;Dad jokes are fun&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/91473/benji&quot;&gt;Benji&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant tips posted in August 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/250778/113573&quot;&gt;Shorten functions to single characters&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/113573/adam&quot;&gt;Adam&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/250765/113573&quot;&gt;Remove spaces between variables and functions, rearrange parameters so that a number comes first&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/113573/adam&quot;&gt;Adam&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/250764/113573&quot;&gt;Use output of assignment to chain assignments&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/113573/adam&quot;&gt;Adam&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/250765/113573&quot;&gt;Use &lt;code&gt;ASCII&lt;/code&gt; and &lt;code&gt;GET&lt;/code&gt; to iterate through strings&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/113573/adam&quot;&gt;Adam&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/250792/92689&quot;&gt;Use coercion&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/251090/104135&quot;&gt;Use &lt;code&gt;T&lt;/code&gt;/&lt;code&gt;F&lt;/code&gt; instead of &lt;code&gt;1&lt;/code&gt;/&lt;code&gt;0&lt;/code&gt;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104135/sampersand&quot;&gt;Sampersand&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/251091/104135&quot;&gt;Use &lt;code&gt;&amp;amp;&lt;/code&gt; and &lt;code&gt;|&lt;/code&gt; instead of &lt;code&gt;I&lt;/code&gt;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104135/sampersand&quot;&gt;Sampersand&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;tip summary&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant challenges posted in August 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="92689" LastEditorUserId="92689" LastEditDate="2022-08-27T20:43:06.440" LastActivityDate="2022-08-27T20:43:06.440" CommentCount="0" CommunityOwnedDate="2022-08-01T20:00:34.510" ContentLicense="CC BY-SA 4.0" />
  <row Id="25005" PostTypeId="1" CreationDate="2022-08-02T11:46:19.543" Score="2" ViewCount="107" Body="&lt;p&gt;...or I guess more specifically, can I require that input from STDIN (or closest alternative, e.g. TIO) be newline terminated?&lt;/p&gt;&#xA;&lt;p&gt;Utilising apps like TIO this isn't added, but if using a terminal with &lt;code&gt;&amp;lt;&amp;lt;&amp;lt;&lt;/code&gt; a newline is appended, it can only be omitted using something like &lt;code&gt;echo -n ... | script&lt;/code&gt;. I've definitely used either as it suits me, but I don't know if that's appropriate or not.&lt;/p&gt;&#xA;&lt;p&gt;A specific example of this is &lt;a href=&quot;https://codegolf.stackexchange.com/a/250530/9365&quot;&gt;my answer to&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/q/250522/9365&quot;&gt;this question&lt;/a&gt; which could save two bytes assuming a newline exists on the input, but would necessitate TIO having an explicit terminating newline.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;This has &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24639/78410&quot;&gt;an answer in the I/O defaults&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Thanks to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410/bubbler&quot;&gt;@Bubbler&lt;/a&gt; for clarifying.&lt;/p&gt;&#xA;&lt;p&gt;My read on this is that you may specify either way as your answer requires.&lt;/p&gt;&#xA;" OwnerUserId="9365" LastEditorUserId="9365" LastEditDate="2022-08-03T12:21:12.080" LastActivityDate="2022-08-03T12:21:12.080" Title="When accepting input from STDIN, can it be assumed to terminate with a newline" Tags="|discussion|" AnswerCount="1" CommentCount="3" ClosedDate="2022-08-18T17:58:08.157" ContentLicense="CC BY-SA 4.0" />
  <row Id="25006" PostTypeId="2" ParentId="25005" CreationDate="2022-08-02T11:46:19.543" Score="2" Body="&lt;h1&gt;Use either, specify what's required&lt;/h1&gt;&#xA;&lt;p&gt;This fits with flexible I/O but could be contentious, it's what I feel is the most forgiving and I don't see how this could be abused for any meaningful score reduction, but I could be missing something!&lt;/p&gt;&#xA;" OwnerUserId="9365" LastActivityDate="2022-08-02T11:46:19.543" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25007" PostTypeId="2" ParentId="2140" CreationDate="2022-08-02T13:04:49.993" Score="0" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/hello-world&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;hello-world&amp;#39;&quot; rel=&quot;tag&quot;&gt;hello-world&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-referential&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-referential&amp;#39;&quot; rel=&quot;tag&quot;&gt;self-referential&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;h1&gt;&lt;code&gt;Hello, World!&lt;/code&gt; hashing&lt;/h1&gt;&#xA;&lt;p&gt;Implement a one-way hashing function that generates arbitrary strings which have a chance (obviously input dependent) of producing at least any of the printable ASCII characters when provided an input of at least 2 characters. This can be any mechanism you choose and could always output a fixed length if desired, however when your source code is used as input, the resultant output must be &lt;code&gt;Hello, World!&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input string will always be 2 characters or more (meaning your code must be at least two characters).&lt;/li&gt;&#xA;&lt;li&gt;There are no other special requirements for any other input strings.&lt;/li&gt;&#xA;&lt;li&gt;The output should not be exactly the same as the input (this might be unavoidable in some scenarios with well-crafted input, but you can't just output your input if the code &lt;code&gt;Hello, World!&lt;/code&gt;, by some magic, in your language performs some sort of hashing).&lt;/li&gt;&#xA;&lt;li&gt;It should be feasible to get at least any of the printable ASCII characters as output. You are however not limited to printable ASCII output and may output any combination of bytes (e.g. unprintables, UTF-8 sequences)&lt;/li&gt;&#xA;&lt;li&gt;All characters of the input string should be taken into account when generating strings, not just the first 13 and should affect the output.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;For meta&lt;/h1&gt;&#xA;&lt;p&gt;I'd really like to encourage answers that aren't a condition that just compares input with source and outputs &lt;code&gt;Hello, World!&lt;/code&gt; in that instance, but as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/25007?noredirect=1#comment78072_25007&quot;&gt;pointed out by @pajonk&lt;/a&gt; it's a non-observable requirement.&lt;/p&gt;&#xA;" OwnerUserId="9365" LastEditorUserId="9365" LastEditDate="2022-08-07T13:31:07.467" LastActivityDate="2022-08-07T13:31:07.467" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="25008" PostTypeId="2" ParentId="2140" CreationDate="2022-08-02T13:41:46.727" Score="1" Body="&lt;h1&gt;Same number list shape?&lt;/h1&gt;&#xA;&lt;p&gt;Given two lists of positive integers, decide whether the two lists can be made equal by only repeated application of any/either of these two functions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Multiply all numbers of one list by a positive integer constant&lt;/li&gt;&#xA;&lt;li&gt;Add a positive integer constant to all numbers in one list&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins.&lt;/p&gt;&#xA;&lt;h2&gt;Extra spec:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can assume lists will be at least three integers long.&lt;/li&gt;&#xA;&lt;li&gt;Both lists input will be the same length.&lt;/li&gt;&#xA;&lt;li&gt;Both lists will be given in strictly ascending order.&lt;/li&gt;&#xA;&lt;li&gt;Standard I/O and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; rules apply.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Worked out example:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;list a: 2 4 8&#xA;list b: 1 4 10&#xA;&#xA;multiply elements of list a by 3&#xA;&#xA;list a: 6 12 24&#xA;list b: 1 4  10&#xA;&#xA;multiply elements of list b by 2&#xA;&#xA;list a: 6 12 24&#xA;list b: 2 8  20&#xA;&#xA;add 4 to elements of list b&#xA;&#xA;list a: 6 12 24&#xA;list b: 6 12 24&#xA;&#xA;done, return truthy&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Shorter examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 1 1 1&#xA;3 3 3 3&#xA;true&#xA;&#xA;5 10 11 14 16&#xA;2 12 14 20 24&#xA;true&#xA;&#xA;10 100 1000 10000 100000&#xA;1  10  100  1000  10000&#xA;true&#xA;&#xA;31   301  3001 30001 300001&#xA;1113 1131 1311 3111  21111&#xA;true&#xA;&#xA;1 11 111 1111 11111&#xA;1 10 100 1000 10000&#xA;true&#xA;&#xA;1 2 3 5 8  13&#xA;2 3 5 8 13 21&#xA;false&#xA;&#xA;1 2 4 8 16&#xA;1 3 5 9 17&#xA;false&#xA;&#xA;2 3 4 5&#xA;7 7 7 7&#xA;false&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Is it a dupe of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/206838/are-they-collinear&quot;&gt;are they colinear&lt;/a&gt;? Methinks maybe but this only has strictly ascending inputs, slope guaranteed to be on (0,inf) exclusive, and arbitrarily many &amp;quot;points&amp;quot;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Better title? This was initially going to emphasize the fact that the allowed transforms don't alter the ratios of differences between numbers, but idk if it's relevant with this new phrasing&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Ascending order? Is this assumption necessary/would the challenge be better without it maybe?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Any better falsy examples? I can't think of any other significant ones, probably will have to wait til post when people are all like &amp;quot;suggested test case:&amp;quot;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="107310" LastEditorUserId="107310" LastEditDate="2022-08-08T14:01:00.357" LastActivityDate="2022-08-08T14:01:00.357" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25009" PostTypeId="2" ParentId="2140" CreationDate="2022-08-03T13:36:06.210" Score="0" Body="&lt;h2&gt;For Meta&lt;/h2&gt;&#xA;&lt;p&gt;This challenge is currently just a very undeveloped idea I had today! So I'm just dumping it here to start getting feedback and somewhere to leave my own thoughts and notes as I start this.&lt;/p&gt;&#xA;&lt;p&gt;As this is in such a undeveloped form and I'm not sure when I'll have time to do it, other people are very much encouraged to develop this if they want!&lt;/p&gt;&#xA;&lt;p&gt;I'm hoping to end up with something with a similar format to @trichoplax's &lt;a href=&quot;https://codegolf.stackexchange.com/q/135102/63404&quot;&gt;Formic Functions - Ant Queen of the Hill Contest&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h4&gt;Notes&lt;/h4&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;even a simple chess engine may be so complex that even expert golfing may have no effect on catching a better written engine in size&lt;/li&gt;&#xA;&lt;li&gt;scoring seems very messy if you include game_length and function_length as these numbers could be all sorts of sizes&lt;/li&gt;&#xA;&lt;li&gt;would checkers be a better/simpler game to do this with?&lt;/li&gt;&#xA;&lt;li&gt;making it single language (javascript) would make it very easy to implement for me but would make golfing less interesting?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;The Code Golf Chess Invitational&lt;/h1&gt;&#xA;&lt;p&gt;I have developed a simple chess interface (to be written) that will:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;provide board state to your function&lt;/li&gt;&#xA;&lt;li&gt;wait for your functions move&lt;/li&gt;&#xA;&lt;li&gt;verify your move&#xA;&lt;ul&gt;&#xA;&lt;li&gt;invalid moves will result in a loss&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;make the move&lt;/li&gt;&#xA;&lt;li&gt;repeat for the opponent&lt;/li&gt;&#xA;&lt;li&gt;and repeat until there is a winner&lt;/li&gt;&#xA;&lt;li&gt;then score both functions&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;The score&lt;/h3&gt;&#xA;&lt;p&gt;The score of each function will be determined by the length of each function and the number of moves the game lasted. With higher scores being worse!&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Winners score will be &lt;code&gt;1 * length_of_program&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Losers score will be &lt;code&gt;game_length * length_of_program&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Losing by invalid move score will be &lt;code&gt;(game_length)^2 * length_of_program&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;(Scoring very much to be revised but ideally I want to encourage short programs, encourage winning, and absolutely discourage invalid moves (random playing))&lt;/p&gt;&#xA;&lt;h2&gt;Your function&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;MUST NOT query other sites/libraries/etc&#xA;&lt;ul&gt;&#xA;&lt;li&gt;it could include an entire library if you wished, but that would obviously be a very long function&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;should take a 2d array as input of the board state, [[a1, a2 ... a8], [b1 ... h8]]&lt;/li&gt;&#xA;&lt;li&gt;return a chess move in &lt;a href=&quot;https://en.wikipedia.org/wiki/Algebraic_notation_(chess)&quot; rel=&quot;nofollow noreferrer&quot;&gt;chess notation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;warnings (and errors?) are fine as long as the program still returns a move&lt;/li&gt;&#xA;&lt;li&gt;normal other restrictions apply&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;You, yourself&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Please provide assistance in getting your function running on the GitHub site!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;(this needs work because whilst I'm sure I could get many common languages (esp scripting languages) working I'm not sure how well I'd do with some of the more golf-y/compiled languages)&lt;/p&gt;&#xA;&lt;h2&gt;Tournament&lt;/h2&gt;&#xA;&lt;p&gt;The initial tournament would be a continuous round robin of all current submissions with each functions running score an average of each score each game.&lt;/p&gt;&#xA;&lt;p&gt;Then a final day, where every function competes against every function x times. This would decide the &amp;quot;winner&amp;quot; of the competition and the accepted answer tick.&lt;/p&gt;&#xA;&lt;p&gt;Then just for fun a seeded knockout tournament (based on the final score) to decide who had the best chess program. (Maybe a bounty award for this)&lt;/p&gt;&#xA;" OwnerUserId="63404" LastActivityDate="2022-08-03T13:36:06.210" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25010" PostTypeId="2" ParentId="2140" CreationDate="2022-08-03T14:24:42.803" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250861/add-parentheses-to-polish-notation&quot;&gt;Add parentheses to Polish notation&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2022-08-09T14:09:36.907" LastActivityDate="2022-08-09T14:09:36.907" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25011" PostTypeId="2" ParentId="2140" CreationDate="2022-08-03T20:09:27.027" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/250745/94346&quot;&gt;Cryptic Multiplications&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="94346" LastEditorUserId="94346" LastEditDate="2022-08-06T10:42:20.293" LastActivityDate="2022-08-06T10:42:20.293" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25013" PostTypeId="2" ParentId="2140" CreationDate="2022-08-04T05:12:02.600" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250781/implement-string-projection&quot;&gt;Implement String Projection&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2022-08-07T16:41:40.547" LastActivityDate="2022-08-07T16:41:40.547" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25014" PostTypeId="2" ParentId="1061" CreationDate="2022-08-04T15:02:16.430" Score="-11" Body="&lt;h1&gt;Builtins in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;sequence-container&quot;&gt;sequence&lt;/a&gt; challenges that solve the challenge completely&lt;/h1&gt;&#xA;&lt;p&gt;I know &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1078/107299&quot;&gt;we don't like disallowing builtins&lt;/a&gt;, but having a builtin in a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;sequence-container&quot;&gt;sequence&lt;/a&gt; challenge solve the entire thing is a bit too much. While it's be nice to add it as a side note, show off what your language can do!&lt;/p&gt;&#xA;" OwnerUserId="107299" LastEditorUserId="110681" LastEditDate="2022-10-21T06:02:28.057" LastActivityDate="2022-10-21T06:02:28.057" CommentCount="0" CommunityOwnedDate="2022-08-04T15:02:16.430" ContentLicense="CC BY-SA 4.0" />
  <row Id="25016" PostTypeId="2" ParentId="2140" CreationDate="2022-08-05T10:43:15.853" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/265793/make-a-super-fair-number&quot;&gt;Make a super fair number&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2023-10-05T14:56:21.567" LastActivityDate="2023-10-05T14:56:21.567" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25017" PostTypeId="2" ParentId="2140" CreationDate="2022-08-05T16:24:58.963" Score="0" Body="&lt;h1&gt;Implement Bloom filter insertion&lt;/h1&gt;&#xA;&lt;p&gt;A &lt;strong&gt;Bloom filter&lt;/strong&gt; is a probabilistic data structure that is used to determine whether an element is in a set in a fixed number of bits. It consists of:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;a bit array &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; of fixed size &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt;, initialized as all &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;s, and&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; different hash functions &lt;span class=&quot;math-container&quot;&gt;\$h_1,\ldots,h_k\$&lt;/span&gt; which each map any element to some value &lt;span class=&quot;math-container&quot;&gt;\$v \in 0,\ldots,m-1\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;To insert element &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; into the set, set &lt;span class=&quot;math-container&quot;&gt;\$B[h_i(s)]\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; for each hash function &lt;span class=&quot;math-container&quot;&gt;\$h_i\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;To check if element &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; is in the set, check the value of &lt;span class=&quot;math-container&quot;&gt;\$B[h_i(s)]\$&lt;/span&gt; for each hash function &lt;span class=&quot;math-container&quot;&gt;\$h_i\$&lt;/span&gt;. If they are all &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt;, return true; otherwise return false.&lt;/p&gt;&#xA;&lt;p&gt;For example, suppose we start with bit array of size 5:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 0 0 0 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We also define hash functions &lt;span class=&quot;math-container&quot;&gt;\$h_1(s) = s\bmod m, h_2(s) = (s^2)\bmod m\$&lt;/span&gt;. To insert value &lt;span class=&quot;math-container&quot;&gt;\$13\$&lt;/span&gt;, We calculate the indices to change:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$i_1 = h_1(13) = 13\bmod 5 = 3,\\&#xA;i_2 = h_2(13) = (13^2)\bmod 5 = 4$$&lt;/span&gt;&#xA;So we set &lt;span class=&quot;math-container&quot;&gt;\$B[3]\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$B[4]\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 0 0 1 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;To check if &lt;span class=&quot;math-container&quot;&gt;\$13\$&lt;/span&gt; is in the set, we look if &lt;span class=&quot;math-container&quot;&gt;\$B[3]\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$B[4]\$&lt;/span&gt; are both &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;You should implement the &lt;em&gt;insertion&lt;/em&gt; part of a Bloom filter.&#xA;Take in three inputs: two positive integers &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;, and a series of non-negative integers &lt;span class=&quot;math-container&quot;&gt;\$S=\{s_1, \ldots, s_n\}\$&lt;/span&gt;. Output the bit array of the Bloom filter of size &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt; with all the elements of &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; added using &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; hash functions, with any two distinct values substituting for &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You can choose any &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; hash functions as long as they have &lt;em&gt;uniformly distributed output&lt;/em&gt; and are &lt;em&gt;not perfectly correlated&lt;/em&gt; (probably the wrong term for this). In other words:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Over all non-negative integers &lt;span class=&quot;math-container&quot;&gt;\$\{s\}\$&lt;/span&gt;, the probability of &lt;span class=&quot;math-container&quot;&gt;\$h_i(s)=v\in\{0,\ldots,m-1\}\$&lt;/span&gt; is &lt;span class=&quot;math-container&quot;&gt;\$\frac1m\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;For all pairs of functions &lt;span class=&quot;math-container&quot;&gt;\$(h_i,h_j)\$&lt;/span&gt;, there is not a mapping between the output of &lt;span class=&quot;math-container&quot;&gt;\$h_i\$&lt;/span&gt; and the output of &lt;span class=&quot;math-container&quot;&gt;\$h_j\$&lt;/span&gt;. For example, you couldn't use &lt;span class=&quot;math-container&quot;&gt;\$h_1(s) = s\bmod m, h_2(s) = (s+1)\bmod m,\$&lt;/span&gt; because you can perfectly determine the output of &lt;span class=&quot;math-container&quot;&gt;\$h_2\$&lt;/span&gt; from the output of &lt;span class=&quot;math-container&quot;&gt;\$h_1\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;(Ideally, these functions should be independent, but that's not a practical request.)&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;TODO&lt;/p&gt;&#xA;&lt;h1&gt;Questions&lt;/h1&gt;&#xA;&lt;p&gt;I could ask for both insertion and value checking, but I don't want to overcomplicate this.&lt;/p&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2022-08-05T18:10:56.047" LastActivityDate="2022-08-05T18:10:56.047" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25018" PostTypeId="2" ParentId="24508" CreationDate="2022-08-06T13:56:18.107" Score="-1" Body="&lt;p&gt;When posting questions, SE could possibly add a feature that only allows questions that have been on Sandbox to be posted, and as an additional feature to stop impatience, it can raise an error message if the Sandbox post was posted barely 3 days back.&lt;/p&gt;&#xA;&lt;p&gt;Which means, when posting a question, all that is asked for is the original Sandbox post (probably the link will be enough?) and then the question can be posted.&lt;/p&gt;&#xA;&lt;p&gt;This solves the problem: that the user will use the Sandbox&lt;/p&gt;&#xA;&lt;p&gt;&lt;b&gt;EDIT:&lt;/b&gt;&lt;/p&gt;&#xA;&lt;p&gt;It seems edits to the webpage UI will be &lt;i&gt;very&lt;/i&gt; unlikely, so perhaps another idea would be to have adding Sandbox post links in questions and have experienced users check whether questions were actually posted to Sandbox, and this can be exempted for users with, say, more than 10 questions posted (&lt;s&gt;Zion mycelia adamancy&lt;/s&gt; caird coinheringaahing)&lt;/p&gt;&#xA;" OwnerUserId="110681" LastEditorUserId="110681" LastEditDate="2022-10-02T12:11:30.167" LastActivityDate="2022-10-02T12:11:30.167" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25019" PostTypeId="2" ParentId="2140" CreationDate="2022-08-06T18:35:28.840" Score="0" Body="&lt;h1&gt;All permutations of range from &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a positive input &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, output all permutations of either &lt;span class=&quot;math-container&quot;&gt;\$\{0,1,\ldots,n\}\$&lt;/span&gt; or &lt;span class=&quot;math-container&quot;&gt;\$\{1,2,\ldots,n\}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;Outputting permutations of &lt;span class=&quot;math-container&quot;&gt;\$\{1,2,\ldots,n\}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Input&lt;/th&gt;&#xA;&lt;th&gt;Output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;1&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;[(1)]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;2&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;[(1, 2), (2, 1)]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;4&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;[(1, 2, 3, 4), (1, 2, 4, 3), (1, 3, 2, 4), (1, 3, 4, 2), (1, 4, 2, 3), (1, 4, 3, 2), (2, 1, 3, 4), (2, 1, 4, 3), (2, 3, 1, 4), (2, 3, 4, 1), (2, 4, 1, 3), (2, 4, 3, 1), (3, 1, 2, 4), (3, 1, 4, 2), (3, 2, 1, 4), (3, 2, 4, 1), (3, 4, 1, 2), (3, 4, 2, 1), (4, 1, 2, 3), (4, 1, 3, 2), (4, 2, 1, 3), (4, 2, 3, 1), (4, 3, 1, 2), (4, 3, 2, 1)]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;Standard loopholes are forbidden. The shortest code wins.&lt;/p&gt;&#xA;&lt;h2&gt;Questions&lt;/h2&gt;&#xA;&lt;p&gt;I was looking for this challenge, but I couldn't find it posted anywhere. Maybe because it's too derivative of a simple &amp;quot;output all permutations&amp;quot; challenge?&lt;/p&gt;&#xA;" OwnerUserId="113573" LastActivityDate="2022-08-06T18:35:28.840" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25020" PostTypeId="2" ParentId="2140" CreationDate="2022-08-07T06:54:02.170" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251018/change-the-quotations-as-if-in-microsoft-word&quot;&gt;&lt;h1&gt;Change The Quotations as if in Microsoft Word&lt;/h1&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;META&lt;/strong&gt;: Posted&lt;/p&gt;&#xA;" OwnerUserId="110681" LastEditorUserId="110681" LastEditDate="2022-08-12T07:49:36.680" LastActivityDate="2022-08-12T07:49:36.680" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25021" PostTypeId="2" ParentId="2140" CreationDate="2022-08-07T16:38:51.307" Score="-1" Body="&lt;p&gt;Write a program on any language that accepts some input and give some different output. The challenge is that the text of the program must form a square: all rows must be the same length and the number of rows must equal the number of columns (ie length of rows). Adding extra spaces or comments to pad lines is not allowed.&lt;/p&gt;&#xA;&lt;p&gt;This is Code Golf so the one with the shortest functioning program (ie smallest square) wins!&lt;/p&gt;&#xA;" OwnerUserId="113992" LastActivityDate="2022-08-07T16:38:51.307" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25022" PostTypeId="2" ParentId="2140" CreationDate="2022-08-07T16:53:45.150" Score="-2" Body="&lt;p&gt;Write a program on any language that accepts some input and give some different output. The challenge is that the text of the program must form a square: all rows must be the same length and the number of rows must equal the number of columns (ie length of rows). Adding extra spaces, dead code, or comments to pad lines is not allowed.&lt;/p&gt;&#xA;&lt;p&gt;This is Code Golf so the one with the shortest functioning program (ie smallest square) wins!&lt;/p&gt;&#xA;" OwnerUserId="113992" LastActivityDate="2022-08-07T16:53:45.150" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25025" PostTypeId="2" ParentId="2140" CreationDate="2022-08-08T11:06:38.557" Score="3" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251450/polyglot-quiz-cops-thread&quot;&gt;Polyglot Quiz (Cops&amp;#39; thread)&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/251451/polyglot-quiz-robbers-thread&quot;&gt;Polyglot Quiz (Robber&amp;#39;s thread)&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-08-30T14:54:43.650" LastActivityDate="2022-08-30T14:54:43.650" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="25026" PostTypeId="2" ParentId="2140" CreationDate="2022-08-08T18:26:39.887" Score="1" Body="&lt;h1&gt;Longest N-Sum Sub-Array &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;array-container&quot;&gt;array&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/subsequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;subsequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;subsequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;subsequence-container&quot;&gt;subsequence&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;integer-container&quot;&gt;integer&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Write a program or function which when given an array of non-negative integers and a number &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;, output the longest contiguous sub-array whose sum of elements adds up to &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$S = \{ (x, y) : \sum_{n=x}^{y} a_n = N \}$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$\text{Output: } argmax_S (y - x)$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Constraints&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If there are multiple solutions, output any of them or all of them (choose one).&lt;/li&gt;&#xA;&lt;li&gt;You may output the solution in any reasonable format, which must allow for the following point.&lt;/li&gt;&#xA;&lt;li&gt;There will always be a solution, but it can be the empty list.&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$N \ge 0\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;[input array], N -&amp;gt; [output array]&#xA;&#xA;[1, 0, 0, 1, 0], 1 -&amp;gt; [0, 0, 1, 0]&#xA;[1, 0, 0, 1, 0], 0 -&amp;gt; [0, 0]&#xA;[1, 2, 3, 4, 5], 0 -&amp;gt; []&#xA;[1, 2, 3, 4, 5], 5 -&amp;gt; [2, 3]&#xA;[4, 3, 1, 1, 0, 5, 2], 8 -&amp;gt; [1, 0, 5, 2]&#xA;[0], 0 -&amp;gt; [0]&#xA;[], 0 -&amp;gt; []&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="112488" LastEditorUserId="112488" LastEditDate="2023-01-31T16:33:42.793" LastActivityDate="2023-01-31T16:33:42.793" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25028" PostTypeId="2" ParentId="2140" CreationDate="2022-08-09T04:36:08.347" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/251002/78410&quot;&gt;A better Hexagony template&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-08-12T00:06:12.167" LastActivityDate="2022-08-12T00:06:12.167" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25029" PostTypeId="2" ParentId="2140" CreationDate="2022-08-09T05:26:36.063" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/250883/78410&quot;&gt;Anti-divisors of a number&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-08-10T00:12:17.130" LastActivityDate="2022-08-10T00:12:17.130" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25030" PostTypeId="2" ParentId="2140" CreationDate="2022-08-09T05:58:53.247" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;When to give up and start again&lt;/h1&gt;&#xA;&lt;p&gt;Consider the following setup.  An evil wizard has ten opaque boxes in front of him. Hidden from you, he chooses a random number of coins &lt;span class=&quot;math-container&quot;&gt;\$x \in \{1 \dots 10\}\$&lt;/span&gt; and spreads them uniformly at random in the boxes.  That is, there should be equal probability of assignment of coins to boxes from all possible assignments of &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; coins to 10 boxes.  If you can prove that in fact there are &lt;span class=&quot;math-container&quot;&gt;\$x=10\$&lt;/span&gt; coins hidden in the boxes the wizard will grant you a wish.&lt;/p&gt;&#xA;&lt;p&gt;In this game, you can look inside one box at a time chosen by you.  When you do that, you can see how many coins there are in that box.&lt;/p&gt;&#xA;&lt;p&gt;However the wizard, being evil, will never let you look in box 10.  This might still be ok as you might find 10 coins in the other boxes and in fact the only way to be granted the wish is to have found all 10 coins in the first 9 boxes.&lt;/p&gt;&#xA;&lt;p&gt;Unfortunately, the wizard does not let you play the game for free.  It costs you one dollar to look in box 1, two dollars to look in box two, four in box three, doubling each time up to 256 dollars for box 9. Remember, you can never look in box 10.&lt;/p&gt;&#xA;&lt;p&gt;The wizard has one last twist for you. At any point, you can choose to give up on this set of boxes and get him to start the whole process again (with a new random &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;). Of course, if you have looked in all the 9 boxes and you still have not found 10 coins you have no choice but to give up and start again. But you might want to give up earlier too. Sadly you never get any money back so your costs just carry on building.&lt;/p&gt;&#xA;&lt;p&gt;Your goal is to devise a strategy that will get you the wish at the minimum expected cost. You should report your mean cost.&lt;/p&gt;&#xA;&lt;h1&gt;Testing&lt;/h1&gt;&#xA;&lt;p&gt;Once you have chosen your strategy, you should run it until you get the wish 10,000 times and report the mean cost. If two answers have the same strategy, the one posted first wins. If two strategies have similar mean costs you may need to test it 100,000 or even more times to tell the difference.&lt;/p&gt;&#xA;" OwnerDisplayName="user108721" LastEditorDisplayName="user108721" LastEditDate="2022-08-11T21:13:43.283" LastActivityDate="2022-08-11T21:13:43.283" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="25031" PostTypeId="2" ParentId="2140" CreationDate="2022-08-09T08:50:07.413" Score="5" Body="&lt;h1&gt;Radiation Hardening Koth &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/radiation-hardening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; rel=&quot;tag&quot;&gt;radiation-hardening&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2022-08-18T10:55:33.777" LastActivityDate="2022-08-18T10:55:33.777" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25032" PostTypeId="2" ParentId="2140" CreationDate="2022-08-09T14:48:22.373" Score="-1" Body="&lt;h1&gt;Convert English to integer&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;When saying a number out loud in English, or writing it out in words, speakers use a certain method.&lt;br /&gt;&#xA;Since there's lots of variations from person to person on the specific method, I'll define the format I'm using here:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;[TODO]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Some things to note about the format:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are no commas, only lowercase letters and spaces.&lt;/li&gt;&#xA;&lt;li&gt;There is no &amp;quot;and&amp;quot; separating the hundreds and tens.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1234&lt;/code&gt; is described as &amp;quot;one thousand two hundred thirty four&amp;quot;, not &amp;quot;twelve hundred thirty four&amp;quot;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://onecompiler.com/python/3ycgqedun&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here's some rather sloppy code that, given a number, generates the associated English phrase.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;Taking an input &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; which a string describing some integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; written using the format above, output &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;. In other words, convert from an English description of a number back to its integer form. Your code should be able to handle string associated with non-negative integers up to but not including a quadrillion (i.e. &lt;span class=&quot;math-container&quot;&gt;\$0 \leq n \leq 999,999,999,999\$&lt;/span&gt;), or the maximum value that an integer can have in your programming language. You can assume the input will always follow the format above.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Input&lt;/th&gt;&#xA;&lt;th&gt;Output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;zero&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;0&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;eight&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;8&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;ten&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;10&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;sixteen&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;16&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;twenty&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;20&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;thirty five&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;35&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;one hundred&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;100&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;four hundred nine&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;409&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;five hundred thirteen&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;513&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;seven hundred seventy seven&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;777&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;six thousand five hundred thirty four&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;6534&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;one hundred thousand ten&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;10010&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;twenty four thousand three hundred sixty five&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;24365&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;eighty eight million two hundred twenty thousand one hundred&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;88222100&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;seven hundred million eleven thousand ninety nine&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;700011099&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;eight hundred ninety four billion three hundred twelve million five hundred sixty seven thousand eight hundred ninety one&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;894312567891&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;one trillion&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;1000000000000&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;five hundred trillion one&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;500000000000001&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;Standard I/O rules apply, standard loopholes are forbidden. The shortest program wins.&lt;/p&gt;&#xA;&lt;h2&gt;Questions&lt;/h2&gt;&#xA;&lt;p&gt;Do I need to describe the format besides saying how it deals with the major variants (e.g. including/excluding &amp;quot;and&amp;quot;)? I really don't want to formally write out all that stuff.&#xA;I also don't like the wording of the first sentence at all, but I feel like I need &lt;em&gt;some&lt;/em&gt; introduction.&lt;/p&gt;&#xA;" OwnerUserId="113573" LastActivityDate="2022-08-09T14:48:22.373" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25033" PostTypeId="2" ParentId="2140" CreationDate="2022-08-10T03:03:22.430" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/250942/108879&quot;&gt;Divisor of a string&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108879" LastEditorUserId="108879" LastEditDate="2022-08-11T01:07:34.360" LastActivityDate="2022-08-11T01:07:34.360" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25036" PostTypeId="2" ParentId="2140" CreationDate="2022-08-12T15:10:06.353" Score="1" Body="&lt;h1&gt;Solve the Greek Computer Puzzle Toy&lt;/h1&gt;&#xA;&lt;p&gt;Posted live: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/251124/solve-the-greek-computer-puzzle-toy&quot;&gt;Solve the Greek Computer Puzzle Toy&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="114101" LastEditorUserId="114101" LastEditDate="2022-08-15T17:59:13.140" LastActivityDate="2022-08-15T17:59:13.140" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25037" PostTypeId="2" ParentId="2140" CreationDate="2022-08-12T18:05:11.383" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/251041/110698&quot;&gt;Generate a Kirkman triple system&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110698" LastEditorUserId="110698" LastEditDate="2022-08-13T04:25:02.070" LastActivityDate="2022-08-13T04:25:02.070" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25038" PostTypeId="2" ParentId="2140" CreationDate="2022-08-13T07:29:40.490" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251050/smallest-number-of-steps-for-a-knight-in-chess&quot;&gt;smallest number of steps for a knight in chess&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="113952" LastEditorUserId="66833" LastEditDate="2022-08-20T01:07:17.380" LastActivityDate="2022-08-20T01:07:17.380" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25039" PostTypeId="2" ParentId="2140" CreationDate="2022-08-15T13:59:01.407" Score="0" Body="&lt;h2&gt;Program a compiler compiler&lt;/h2&gt;&#xA;&lt;p&gt;Write a program, function, or likewise that takes in a &lt;a href=&quot;https://en.wikipedia.org/wiki/Backus%E2%80%93Naur_form&quot; rel=&quot;nofollow noreferrer&quot;&gt;BNF&lt;/a&gt;-like grammar specification(see below) and outputs a program or function in a language of your choice that takes strings as input and returns truthy if that string is parseable with the specified grammar, and false otherwise.&lt;/p&gt;&#xA;&lt;h2&gt;Meta-language:&lt;/h2&gt;&#xA;&lt;p&gt;The input to your program will consist of a number of bnf-like rules. Each definition will be on its own line, and will consist of a name (string of 1 or more characters &lt;code&gt;[a-z0-9]&lt;/code&gt;), followed by the symbol &lt;code&gt;::=&lt;/code&gt; followed by a string of symbols(terminal and non terminal), terminals consist of &lt;code&gt;[a-zA-Z0-9() ]&lt;/code&gt;. Nonterminals are denoted with a &lt;code&gt;&amp;lt;&lt;/code&gt; followed by a string of characters &lt;code&gt;[a-z0-9]&lt;/code&gt; followed by &lt;code&gt;&amp;gt;&lt;/code&gt;; that string of characters refers to another definition. Each definition may have multiple alternatives, separated by &lt;code&gt;|&lt;/code&gt;. Alternatives should be matched left to right. The first line of the input will share this same form, except that it will not have the name of the definition or the &lt;code&gt;::=&lt;/code&gt;. This is the &amp;quot;top-level&amp;quot; definition that the input to the outputted program will attempt to be matched against.&lt;/p&gt;&#xA;&lt;p&gt;Input grammars will never contain left-recursion (ie. it will never be the case that there will be a rule of the form &lt;code&gt;a::=&amp;lt;a&amp;gt;&lt;/code&gt;). You may additionally assume that your generated program will only be given as input strings that contain only those characters comprising valid terminal symbol(&lt;code&gt;[a-zA-Z0-9() ]&lt;/code&gt;). Additionally, your compiler-compiling program only needs to handle valid definitions.&lt;/p&gt;&#xA;&lt;h2&gt;Examples:&lt;/h2&gt;&#xA;&lt;p&gt;The following should be handled appropriately by your program:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;binaryliteral&#xA;binaryliteral::=0&amp;lt;binaryliteral&amp;gt;|1&amp;lt;binaryliteral&amp;gt;|0|1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This means that the generated program should return truthy for any strings that match the definition of a binary literal, which is either the character 0 or 1 followed by a binary literal, or just 0 or 1. This would recognize strings&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;quantexpr&#xA;quantexpr::=forall &amp;lt;var&amp;gt;(&amp;lt;expr1&amp;gt;)|exists &amp;lt;var&amp;gt;(&amp;lt;expr1&amp;gt;)&#xA;expr1::=&amp;lt;expr0&amp;gt; and &amp;lt;expr1&amp;gt;|&amp;lt;expr0&amp;gt; or &amp;lt;expr0&amp;gt; |not &amp;lt;expr1&amp;gt;|&amp;lt;expr0&amp;gt;&#xA;expr0::=&amp;lt;var&amp;gt;|(&amp;lt;expr1&amp;gt;)&#xA;var::=x|y|z&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and you do not need to handle the following:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;x:=1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;expr&#xA;expr::=x|&amp;lt;expr&amp;gt; plus &amp;lt;expr&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;As usual, this is code-golf, so the shortest program per (implementation, output language) pair wins!&lt;/p&gt;&#xA;" OwnerUserId="91473" LastEditorUserId="91473" LastEditDate="2022-08-16T14:31:30.200" LastActivityDate="2022-08-16T14:31:30.200" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25041" PostTypeId="2" ParentId="23771" CreationDate="2022-08-17T08:30:58.460" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/m-ender/labyrinth&quot; rel=&quot;nofollow noreferrer&quot;&gt;Labyrinth&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;An esolang based on the path-following mechanic. You can put a linear program path in any contiguous shape, and branching and loops are visually straightforward.&lt;/p&gt;&#xA;&lt;p&gt;A typical Labyrinth program looks somewhat like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;)&amp;quot;   10/{:@!&#xA;.,;: _ { _ ;&#xA;   })&amp;quot;}) 10-9!@&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(taken from &lt;a href=&quot;https://codegolf.stackexchange.com/a/103598/78410&quot;&gt;here&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;p&gt;Writing a working program is not too hard. But golfing a finished program is a totally different field, as you want a layout that minimizes the amount of whitespaces. Sometimes you even get a &lt;a href=&quot;https://codegolf.stackexchange.com/a/211632/78410&quot;&gt;piece of art&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Also, it is possible to introduce randomness in Labyrinth despite not having a built-in for that. Figuring it out would be an interesting topic.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2022-08-17T08:30:58.460" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25042" PostTypeId="2" ParentId="23771" CreationDate="2022-08-17T21:37:15.947" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/Radvylf/trianguish/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Trianguish&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Made by CGCC's very own &lt;a href=&quot;https://codegolf.stackexchange.com/users/79857/nohaxjustradvylf&quot;&gt;Radvylf&lt;/a&gt;, active CGCC member and TNB room owner.&lt;/p&gt;&#xA;&lt;p&gt;Here's what he has to say:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Trianguish is my newest language, a cellular automaton sort of thing which uses a triangular grid of &amp;quot;ops&amp;quot; (short for &amp;quot;operators&amp;quot;). It features self-modification, a default max int size of 216, and an interpreter which, in my opinion, is the coolest thing I've ever created (taking over forty hours and 2k SLOC so far).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="87594" LastActivityDate="2022-08-17T21:37:15.947" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25043" PostTypeId="2" ParentId="19279" CreationDate="2022-08-17T21:42:10.313" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/Radvylf/trianguish&quot; rel=&quot;nofollow noreferrer&quot;&gt;Trianguish&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Trianguish is my newest language, a cellular automaton sort of thing which uses a triangular grid of &amp;quot;ops&amp;quot; (short for &amp;quot;operators&amp;quot;). It features self-modification, a default max int size of 216, and an interpreter which, in my opinion, is the coolest thing I've ever created (taking over forty hours and 2k SLOC so far).&lt;/p&gt;&#xA;&lt;h2&gt;Reasons&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Triangish is a fairly capable and unique 2d language, and not so unnecessarily tarpitty that most questions couldn't be answered in it with some clever thinking&lt;/li&gt;&#xA;&lt;li&gt;There is a lot of room for golfing even simple programs. More precise timing, clever self-modification, and an undestanding of the quirks of Trianguish's binary serialization can all shave off plenty of bytes&lt;/li&gt;&#xA;&lt;li&gt;Trianguish has a graphical editor with many features that lower the initial hurdle for writing and debugging programs&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-08-17T21:42:10.313" CommentCount="2" CommunityOwnedDate="2022-08-17T21:42:10.313" ContentLicense="CC BY-SA 4.0" />
  <row Id="25045" PostTypeId="2" ParentId="2140" CreationDate="2022-08-18T20:14:23.597" Score="2" Body="&lt;h1&gt;Carry-less sum given a base b&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/251283/107561&quot;&gt;posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="107561" LastEditorUserId="107561" LastEditDate="2022-08-23T15:47:33.957" LastActivityDate="2022-08-23T15:47:33.957" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25047" PostTypeId="2" ParentId="2140" CreationDate="2022-08-19T08:13:52.070" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/256920/simplify-a-cycle&quot;&gt;Simplify a Cycle&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2023-01-20T12:21:47.283" LastActivityDate="2023-01-20T12:21:47.283" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="25048" PostTypeId="2" ParentId="2140" CreationDate="2022-08-22T02:38:07.827" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/251270/78410&quot;&gt;An algorithm to find even sublime numbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-08-23T00:11:03.727" LastActivityDate="2022-08-23T00:11:03.727" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25049" PostTypeId="2" ParentId="2140" CreationDate="2022-08-22T17:11:45.033" Score="1" Body="&lt;h1&gt;Find &amp;quot;Millionaire&amp;quot; score&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I was looking through &lt;a href=&quot;https://archive.org/search.php?query=creator%3A%22Games+Publications%22&quot; rel=&quot;nofollow noreferrer&quot;&gt;the uploads of GAMES Magazine to archive.org&lt;/a&gt;, and in the first publication I found a challenge called &lt;a href=&quot;https://ia804601.us.archive.org/BookReader/BookReaderImages.php?zip=/2/items/games-1-1977-september/games-1-1977-september_jp2.zip&amp;amp;file=games-1-1977-september_jp2/games-1-1977-september_0022.jp2&amp;amp;id=games-1-1977-september&amp;amp;scale=4&amp;amp;rotate=0&quot; rel=&quot;nofollow noreferrer&quot;&gt;&amp;quot;Millionaire: a word-and-number prize competition&amp;quot;&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;In this game, each word is assigned a score in the following way:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Turn each letter in the word into a number: &lt;code&gt;A&lt;/code&gt; becomes 1, &lt;code&gt;B&lt;/code&gt; becomes 2, &lt;code&gt;C&lt;/code&gt; becomes 3, and so on.&lt;/li&gt;&#xA;&lt;li&gt;Multiply the numbers.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;For example, the score for &lt;code&gt;BED&lt;/code&gt; is &lt;span class=&quot;math-container&quot;&gt;\$2*5*4 = 40\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;(In the competition, the goal was to find the word whose score is closest to a million, but that's not relevant here.)&lt;/p&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a word (i.e. a sequence of uppercase letters) as an input, output its score.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Input&lt;/th&gt;&#xA;&lt;th&gt;Output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;A&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;1&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;Z&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;26&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;BED&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;40&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;CHAIR&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;3888&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;BOTTOM&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;2340000&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;h1&gt;Questions&lt;/h1&gt;&#xA;&lt;p&gt;This challenge is probably not new -- please let me know what it's duplicating.&#xA;I could make the challenge something like &amp;quot;given a list of words, find the word whose score is closes to a million&amp;quot;, but I think that's particularly uninteresting.&lt;/p&gt;&#xA;" OwnerUserId="113573" LastActivityDate="2022-08-22T17:11:45.033" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25050" PostTypeId="2" ParentId="2140" CreationDate="2022-08-22T23:45:08.347" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/251510/66833&quot;&gt;Live a longer life&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2022-09-01T00:39:18.077" LastActivityDate="2022-09-01T00:39:18.077" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25051" PostTypeId="2" ParentId="2140" CreationDate="2022-08-23T16:02:48.720" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;decision-problem-container&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Are these numbers from the repeated application of this function?&lt;/h1&gt;&#xA;&lt;p&gt;Given a list of at least 3 positive integers &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; and a function &lt;span class=&quot;math-container&quot;&gt;\$F\$&lt;/span&gt; which takes a positive integer and returns a positive integer, determine if &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; can be sorted such that each element of the list is the result of applying &lt;span class=&quot;math-container&quot;&gt;\$F\$&lt;/span&gt; to the previous element (besides the first of course).&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may, of course, assume that &lt;span class=&quot;math-container&quot;&gt;\$F\$&lt;/span&gt; always halts.&lt;/li&gt;&#xA;&lt;li&gt;You may also assume that &lt;span class=&quot;math-container&quot;&gt;\$F\$&lt;/span&gt; will have no side-effects and is deterministic.&lt;/li&gt;&#xA;&lt;li&gt;You may take the &lt;span class=&quot;math-container&quot;&gt;\$F\$&lt;/span&gt; as a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/search?q=inquestion%3A2447+black+box&quot;&gt;black box function&lt;/a&gt; in any reasonable format.&lt;/li&gt;&#xA;&lt;li&gt;Instead of taking &lt;span class=&quot;math-container&quot;&gt;\$F\$&lt;/span&gt; as an input, you may take a second list &lt;span class=&quot;math-container&quot;&gt;\$M\$&lt;/span&gt;, which is the result of applying &lt;span class=&quot;math-container&quot;&gt;\$F\$&lt;/span&gt; to each element of &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, shortest solution in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Very simple worked out example&lt;/h2&gt;&#xA;&lt;p&gt;Inputting &lt;span class=&quot;math-container&quot;&gt;\$F(x)=x+1\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$L=[5,4,3,2,1]\$&lt;/span&gt; should output truthy, because &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; can be rearranged into &lt;span class=&quot;math-container&quot;&gt;\$[1,2,3,4,5]\$&lt;/span&gt;, for which each element is the result of applying &lt;span class=&quot;math-container&quot;&gt;\$F\$&lt;/span&gt; to the previous element: &lt;span class=&quot;math-container&quot;&gt;\$F(1)=2\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$F(2)=3\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$F(3)=4\$&lt;/span&gt;, and &lt;span class=&quot;math-container&quot;&gt;\$F(4)=5\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;More examples:&lt;/h2&gt;&#xA;&lt;p&gt;Truthy&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;F(x) = 2x,           L = [4,2,1,8]&#xA;F(x) = ceil(10/x),   L = [2,2,2,5,5,5]&#xA;F(X) = 3x+1,         L = [5,16,49,148]&#xA;F(x) = length(x),    L = [1,2,10,9876543210,1]&#xA;F(x) = 13            L = [13,13,13,13,14]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Falsy&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;F(x) = 2x,           L = [2,4,6,8]&#xA;F(x) = ceil(10/x),   L = [5,2,5,2,5,2,5,5]&#xA;F(X) = 3x+1,         L = [5,16,8,4,2,1,4]&#xA;F(x) = length(x),    L = [3,1,10,2]&#xA;F(x) = 13            L = [13,13,13,14,15]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;META&lt;/h1&gt;&#xA;&lt;p&gt;Is this ready to post or is it missing something / bad somewhere&lt;/p&gt;&#xA;" OwnerUserId="107310" LastEditorUserId="107310" LastEditDate="2022-08-25T17:54:42.887" LastActivityDate="2022-08-25T17:54:42.887" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="25052" PostTypeId="1" CreationDate="2022-08-23T20:23:16.643" Score="2" ViewCount="82" Body="&lt;p&gt;Currently, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/23771/16766&quot;&gt;Language nominations for the &amp;quot;Learn You a Lang for Great Good&amp;quot; chat event&lt;/a&gt;, if they get chosen, are subsequently edited to mention that this language was learned on such-and-such a date. We've &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/61802801#61802801&quot;&gt;brought up in chat&lt;/a&gt; the possibility of deleting old nominations, like we do for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/16766&quot;&gt;Language of the Month nominations&lt;/a&gt;. The idea seems to have support, but nobody has done much about it. So let's make an actual decision. &lt;strong&gt;Should we delete old LYAL nominations that have already been learned (for great good)?&lt;/strong&gt; Why or why not?&lt;/p&gt;&#xA;" OwnerUserId="16766" LastActivityDate="2022-08-31T01:27:26.893" Title="Do we want to delete a LYAL nomination after learning the lang?" Tags="|discussion|chat-events|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25053" PostTypeId="2" ParentId="25052" CreationDate="2022-08-23T21:30:58.897" Score="12" Body="&lt;h1&gt;Yes.&lt;/h1&gt;&#xA;&lt;p&gt;Currently, whenever looking for the next language, we have to scroll through all the previously learned ones. It's just annoying to search through and find the top-voted ones that haven't been done already.&lt;/p&gt;&#xA;&lt;p&gt;Deleting learned languages would make this a lot easier.&lt;/p&gt;&#xA;&lt;p&gt;Also, we're not losing any history - a list of all past LYALs can easily be obtained from TNB search, and the answers are still viewable to 10k+ users.&lt;/p&gt;&#xA;" OwnerUserId="100664" LastActivityDate="2022-08-23T21:30:58.897" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25055" PostTypeId="2" ParentId="2140" CreationDate="2022-08-24T02:23:04.827" Score="1" Body="&lt;h1&gt;Guess the Caesar cipher shift&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;test-battery-container&quot;&gt;test-battery&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cipher&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cipher&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;cipher-container&quot;&gt;cipher&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;string-container&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;A &lt;em&gt;Caesar cipher&lt;/em&gt; is a cipher which takes a message and an integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; between 0 and 25 (inclusive). Each letter in the message is then &amp;quot;shifted over&amp;quot; in the alphabet by &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; letters, wrapping around the beginning of the alphabet. For example, when &lt;span class=&quot;math-container&quot;&gt;\$n=1\$&lt;/span&gt;, &lt;code&gt;A&lt;/code&gt; becomes &lt;code&gt;B&lt;/code&gt;, &lt;code&gt;B&lt;/code&gt; becomes &lt;code&gt;C&lt;/code&gt;, and so on, up to &lt;code&gt;Z&lt;/code&gt; which becomes &lt;code&gt;A&lt;/code&gt;. (Uppercase/lowercase is kept the same and punctuation is ignored.)&lt;/p&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a string which represents a message encoded using a Caesar cipher with some shift &lt;span class=&quot;math-container&quot;&gt;\$n \in [0,25]\$&lt;/span&gt;, output a guess for &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;. (You can decide whether punctuation is included or stripped ahead of time.)&#xA;For example, if you take the word &lt;code&gt;Happy code golfing!&lt;/code&gt; and encode it using a Caesar cipher with a shift of 3, you get &lt;code&gt;Kdssb frgh jroilqj!&lt;/code&gt;. So if your program takes in &lt;code&gt;Kdssb frgh jroilqj!&lt;/code&gt;, it should output &lt;code&gt;3&lt;/code&gt;.&#xA;Your solution should be deterministic -- e.g. no random number generators.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;To find the score of your function, it should be tested on every paragraph in &lt;a href=&quot;https://www.gutenberg.org/ebooks/1342&quot; rel=&quot;nofollow noreferrer&quot;&gt;Pride and Prejudice&lt;/a&gt;&lt;sup&gt;1&lt;/sup&gt; and every possible&#xA;shift value (from 0 to 25). &lt;a href=&quot;https://controlc.com/6c9ee36e0&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here's a link to a text file with each paragraph on a single line&lt;/a&gt;, &lt;a href=&quot;https://controlc.com/4a7a5a80&quot; rel=&quot;nofollow noreferrer&quot;&gt;and here's an alternate version where the quote marks have been replaced with ASCII alternatives&lt;/a&gt;. There are 2074 paragraphs, so there are &lt;span class=&quot;math-container&quot;&gt;\$26*2074 = 53924\$&lt;/span&gt; test inputs. Your score is equal to&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$s(b,p)=(1+\sqrt{b}) (1+\sqrt{p})-1$$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$b = \text{number of bytes}$$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$p = \text{proportion incorrect} = 1-\frac{\text{number of test inputs correct}}{53924}$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;so, for example, a 100 byte program that got 13481 tests correct (i.e. &lt;span class=&quot;math-container&quot;&gt;\$\frac34\$&lt;/span&gt; of them incorrect) would have a score of &lt;span class=&quot;math-container&quot;&gt;\$(1+\sqrt{100})(1+\sqrt{\frac34})-1 = 15.5\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your goal is to minimize your score.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://replit.com/@AdamL1/Guess-Caesar-Shift?v=1&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here's a link to some Python code, which can be run online, containing a test harness, along with a baseline program to which you can compare your answer.&lt;/a&gt;&lt;/strong&gt; In this case, I've opted to remove all punctuation before parsing each line. For reference, this function is 89 characters and gets 40144/53924 tests correct, so its score is  14.70850917.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Input&lt;/th&gt;&#xA;&lt;th&gt;Output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;Hs hr z sqtsg tmhudqrzkkx zbjmnvkdcfdc, sgzs z rhmfkd lzm hm onrrdrrhnm ne z fnnc enqstmd, ltrs ad hm vzms ne z vhed.&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;25&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;“Rk! brx duh d juhdw ghdo wrr dsw, brx nqrz, wr olnh shrsoh lq jhqhudo. Brx qhyhu vhh d idxow lq dqbergb. Doo wkh zruog duh jrrg dqg djuhhdeoh lq brxu hbhv. L qhyhu khdug brx vshdn loo ri d kxpdq ehlqj lq pb olih.”&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;3&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;“That is a question which Mr. Darcy only can answer.”&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;0&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;Vczqrsvky cffbvu ritycp, reu klievu rnrp. Yvi ivjzjkretv yru efk zealivu yvi nzky kyv xvekcvdre, reu yv nrj kyzebzex fw yvi nzky jfdv tfdgcrtvetp, nyve kylj rttfjkvu sp Dzjj Szexcvp,&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;17&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt;Chosen because it's the most popular book on Gutenberg at the time of writing.&lt;/p&gt;&#xA;&lt;h1&gt;Questions&lt;/h1&gt;&#xA;&lt;p&gt;The scoring function seems like it could be gamed by writing a really short, really inaccurate function, so I'm thinking of adding a function which penalizes incorrect answers even harsher.&lt;/p&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2022-09-11T19:47:34.587" LastActivityDate="2022-09-11T19:47:34.587" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="25056" PostTypeId="2" ParentId="2140" CreationDate="2022-08-24T03:12:14.470" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251519/optimally-pop-all-the-bubbles&quot;&gt;Optimally pop all the bubbles&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96039" LastEditorUserId="96039" LastEditDate="2022-09-01T04:54:19.047" LastActivityDate="2022-09-01T04:54:19.047" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25057" PostTypeId="2" ParentId="2140" CreationDate="2022-08-24T23:24:45.360" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/251351/78410&quot;&gt;The second even sublime number&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-08-26T00:02:48.190" LastActivityDate="2022-08-26T00:02:48.190" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25059" PostTypeId="2" ParentId="2140" CreationDate="2022-08-26T07:48:08.793" Score="-2" Body="&lt;h1&gt;Self-Debugger.&lt;/h1&gt;&#xA;&lt;p&gt;Suddenly, someone comes and deletes a character from the program. From analyzing the output and error messages (if any), you quickly know which character was deleted.&lt;/p&gt;&#xA;&lt;p&gt;Your job is to create a function that does this. For every character deletion, you will get one point if feeding the output and error message(s) to the undamaged function does &lt;strong&gt;not&lt;/strong&gt; give the correct deleted character. You attempt to &lt;strong&gt;minimize the score of your program&lt;/strong&gt;. Your program must have a function, i.e. if must not be empty.&lt;/p&gt;&#xA;&lt;p&gt;Default loopholes forbidden, as always.&lt;/p&gt;&#xA;&lt;p&gt;Example program:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;lambda a,aa:'a'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Score: the program is not correct when we take away a character that is not &lt;code&gt;a&lt;/code&gt;. Thus, the score is &lt;code&gt;9&lt;/code&gt;. (We intend to minimize this score.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/coding-challenges&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;coding-challenges&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;coding-challenges-container&quot;&gt;coding-challenges&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="111945" LastEditorUserId="111945" LastEditDate="2022-08-26T14:08:55.530" LastActivityDate="2022-08-26T14:08:55.530" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="25060" PostTypeId="2" ParentId="2140" CreationDate="2022-08-26T13:58:33.007" Score="8" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/251626/78850&quot;&gt;Is This an Equivalence Relation?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2022-09-04T01:59:14.450" LastActivityDate="2022-09-04T01:59:14.450" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25061" PostTypeId="2" ParentId="2447" CreationDate="2022-08-27T15:12:55.423" Score="9" Body="&lt;h1&gt;Programs may take input from a generator or iterator&lt;/h1&gt;&#xA;&lt;p&gt;We already have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10753/91213&quot;&gt;rule that programs may output via a generator&lt;/a&gt;. Just for completeness, I think we should specify it's a valid input method as well.&lt;/p&gt;&#xA;&lt;p&gt;Example in rust:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-rs prettyprint-override&quot;&gt;&lt;code&gt;|t:Box&amp;lt;dyn Iterator&amp;gt;|t.flatten()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Other example, taking input via the returned generator in python:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;def k():&#xA;    yield &amp;quot;Hello, &amp;quot;+str(yield &amp;quot;What is your name&amp;quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Which can be used like&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;t = k()&#xA;print(next(k))&#xA;print(k.send(&amp;quot;Charlie&amp;quot;))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Another example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;def k(f):&#xA;    return [int(next(f)),*f]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2022-08-28T17:21:19.423" LastActivityDate="2022-08-28T17:21:19.423" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25062" PostTypeId="2" ParentId="23771" CreationDate="2022-08-28T10:59:29.077" Score="2" Body="&lt;h1&gt;Knight&lt;/h1&gt;&#xA;&lt;p&gt;A pretty simple prefix lang that's fairly easy to learn. For more stuff, see the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/25002/language-of-the-month-for-august-2022-knight?cb=1&quot;&gt;LoTM post&lt;/a&gt; or the &lt;a href=&quot;https://github.com/knight-lang/knight-lang&quot; rel=&quot;nofollow noreferrer&quot;&gt;github repo&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="100664" LastActivityDate="2022-08-28T10:59:29.077" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25063" PostTypeId="2" ParentId="20722" CreationDate="2022-08-28T17:19:43.103" Score="4" Body="&lt;p&gt;My real name sounds very similar to &amp;quot;mouse&amp;quot; and since I'm a big fan of both real mice and computer mice. Most people online and IRL just call me Mouse.&lt;/p&gt;&#xA;&lt;p&gt;I added tail just so that my username is at least 8 characters, the minimum on many sites. However, since I switched to wireless mice I may need to change it to remain accurate.&lt;/p&gt;&#xA;&lt;p&gt;My profile picture is a stylized mouse.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2022-08-28T17:19:43.103" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25064" PostTypeId="2" ParentId="2140" CreationDate="2022-08-28T19:47:10.537" Score="0" Body="&lt;h1&gt;Add numbers as fairly as possible&lt;/h1&gt;&#xA;&lt;p&gt;Given an array of integers &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt; and an array of positive integers &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;, figure out how to add the values in &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; to the values in &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt; such that the &lt;em&gt;variance&lt;/em&gt; of the updated values is as small as possible. (You can add more than one value from &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; to a given value in &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt;.)&lt;/p&gt;&#xA;&lt;p&gt;[Explanation of variance]&lt;/p&gt;&#xA;&lt;p&gt;If there are multiple solutions, you can output any of them. Output in any reasonable format.&lt;/p&gt;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&lt;p&gt;Suppose &lt;span class=&quot;math-container&quot;&gt;\$X = [4,5,6]\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$A=[1,2]\$&lt;/span&gt;. The &amp;quot;most fair&amp;quot; way to distribute the value &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$4\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$2\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$5\$&lt;/span&gt;, making the updated array &lt;span class=&quot;math-container&quot;&gt;\$X' = [6,6,6]\$&lt;/span&gt;, which has a variance of &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;.&#xA;Therefore, you should output something like &lt;code&gt;[[2],[1],[]]&lt;/code&gt; or &lt;code&gt;{4:[2],5:[1]}&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;p&gt;[TODO]&lt;/p&gt;&#xA;&lt;h1&gt;Questions&lt;/h1&gt;&#xA;&lt;p&gt;I am almost certain a question like this has been done before, which is why I'm not putting much effort into this post.&lt;/p&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2022-08-28T19:56:32.253" LastActivityDate="2022-08-28T19:56:32.253" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25065" PostTypeId="2" ParentId="2140" CreationDate="2022-08-29T08:53:59.047" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251705/does-there-exist-a-synchronizing-word&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2022-09-05T18:04:35.803" LastActivityDate="2022-09-05T18:04:35.803" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25066" PostTypeId="2" ParentId="2140" CreationDate="2022-08-29T09:15:43.373" Score="0" Body="&lt;h1&gt;Contrasting Colors &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;When designing a website or poster or book it's important to make the graphical elements be distinct. A common mistake is to choose colors to similar to eachother. We must prevent this!&lt;/p&gt;&#xA;&lt;p&gt;The goal of this challenge is simple: Given a initial color and a number of colors to generate, generate N colors that each have maximal contrast to each of the previous colors.&lt;/p&gt;&#xA;&lt;p&gt;Contrast is defined as the sum of absolute differences. The contrast of a new color is the minimum of the distances to all previous colors. You do &lt;em&gt;not&lt;/em&gt; need to consider gamma. Colors are a 3 tuple with each value a integer ranging from 0 to 255.&lt;/p&gt;&#xA;&lt;p&gt;You must use a greedy algorithm. AKA you shouldn't consider the number or even existence of colors afterwards, just colors before. This is because in the design each subsequent color will be used significantly less.&lt;/p&gt;&#xA;&lt;p&gt;In some cases, multiple choices are available. In this case you may pick any. Thus your results might not look the same as my test cases but still be valid.&lt;/p&gt;&#xA;&lt;p&gt;You may chose whether to include the initial value in the output or not.&lt;/p&gt;&#xA;&lt;p&gt;This is code golf, shortest answer wins.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre class=&quot;lang-json prettyprint-override&quot;&gt;&lt;code&gt;{&#xA;    [(255,255,255),5]: [(255, 255, 255), (0, 0, 0), (0, 127, 255), (63, 255, 64), (191, 0, 191), (254, 128, 0)],&#xA;    [(255,0,128),5]: [(255, 0, 128), (0, 255, 0), (0, 64, 255), (191, 255, 223), (32, 0, 32), (192, 128, 0)],&#xA;    [(128,128,128),10]: [(128, 128, 128), (0, 0, 0), (0, 255, 255), (255, 0, 255), (255, 255, 0), (32, 32, 223), (32, 223, 32), (223, 32, 32), (223, 223, 224), (0, 81, 111), (81, 96, 15)],&#xA;    [(7,91,7), 5]: [(7, 91, 7), (255, 255, 255), (89, 0, 255), (255, 0, 44), (0, 211, 217), (173, 255, 0)]&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2022-08-29T12:43:30.263" LastActivityDate="2022-08-29T12:43:30.263" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25067" PostTypeId="2" ParentId="2140" CreationDate="2022-08-30T09:19:38.647" Score="3" Body="&lt;h1&gt;Quantise a list &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;array-container&quot;&gt;array&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;In music production, quantisation is the process of &amp;quot;aligning&amp;quot; recorded notes to the beat, to remove the variability caused by imprecise human playing.&lt;/p&gt;&#xA;&lt;p&gt;In this challenge, we will implement an abstract and approximate version of quantisation, representing notes as runs of positive integers, and using zeroes to represent gaps. The &amp;quot;beat&amp;quot; will be defined as every second note, starting with the first (even indices, 0-based).&lt;/p&gt;&#xA;&lt;p&gt;Given a list of non-negative integers, insert or remove zeroes such that every run of non-zeroes begins on an even index (using 0-based indexing).&lt;/p&gt;&#xA;&lt;p&gt;Runs of non-zeroes may not be split or joined together if they weren't already in the input. In other words, a zero cannot be inserted or removed if it only has non-zeroes next to it.&lt;/p&gt;&#xA;&lt;p&gt;The minimal number of insertion/removal operations must be performed. If a removal is possible, it should be preferred over an insertion.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;todo&lt;/p&gt;&#xA;&lt;p&gt;blah blah code golf rules&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-08-30T19:29:23.040" LastActivityDate="2022-08-30T19:29:23.040" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25068" PostTypeId="2" ParentId="2140" CreationDate="2022-08-30T09:34:51.670" Score="0" Body="&lt;p&gt;&lt;strong&gt;The least amount a steps a chess pice can reach a position&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I have previously posted a challange: &lt;a href=&quot;https://codegolf.stackexchange.com/q/251050/113952&quot;&gt;smallest number of steps for a knight in chess&lt;/a&gt;.&#xA;Now I would like to go a step further by adding the possibility to choose you piece.&lt;/p&gt;&#xA;&lt;p&gt;If you place a pice on any square of a chessboard, what is the smallest amount of steps to reach every possible position?&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is an 8 by 8 board.&lt;/li&gt;&#xA;&lt;li&gt;The given input is a coordinate (x,x) and the chosen piece. Explain in the answer how to input the piece of choice.&lt;/li&gt;&#xA;&lt;li&gt;The piece starts at an arbitrary position, taken as input.&lt;/li&gt;&#xA;&lt;li&gt;The pawn can not start at the bottom row, and can not move 2 steps (like when in the startposition).&lt;/li&gt;&#xA;&lt;li&gt;point '.' will be placed if a pice cannot reach the square.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt; &lt;br&gt;&#xA;With input &lt;code&gt;1, 0&lt;/code&gt; for a knight, we start by putting a 0 in that position:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;. 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;From her on we continue to fill the entire 8x8 board.&#xA;For a knight the output will look like follow&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;3 0 3 2 3 2 3 4&#xA;2 3 2 1 2 3 4 3&#xA;1 2 1 4 3 2 3 4&#xA;2 3 2 3 2 3 4 3&#xA;3 2 3 2 3 4 3 4&#xA;4 3 4 3 4 3 4 5&#xA;3 4 3 4 3 4 5 4&#xA;4 5 4 5 4 5 4 5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For a pawn with input (1, 7) the output will look like follow&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;. 6 . . . . . . &#xA;. 5 . . . . . . &#xA;. 4 . . . . . . &#xA;. 3 . . . . . . &#xA;. 2 . . . . . . &#xA;. 1 . . . . . . &#xA;. 0 . . . . . . &#xA;. . . . . . . . &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In the examples, I start counting from zero but it does not matter if you start from  or one.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&#xA;The pattern printed for a pice, as short as possible, in any reasonable format.&lt;/p&gt;&#xA;" OwnerUserId="113952" LastEditorUserId="113952" LastEditDate="2022-08-31T06:32:44.547" LastActivityDate="2022-08-31T06:32:44.547" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25069" PostTypeId="2" ParentId="2140" CreationDate="2022-08-30T22:24:23.113" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/251499/107299&quot;&gt;Make a Brainfuck Interpreter&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="107299" LastEditorUserId="107299" LastEditDate="2022-08-31T18:05:37.503" LastActivityDate="2022-08-31T18:05:37.503" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25070" PostTypeId="1" CreationDate="2022-08-31T13:44:41.277" Score="10" ViewCount="182" Body="&lt;p&gt;The discussion surrounding a recent well-received non-&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/251491/need-some-feedback-with-phpc-polyglot-code-and-class-struct-properties&quot;&gt;question&lt;/a&gt; has brought up an interesting question: do &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; questions need objective winning criteria?&lt;/p&gt;&#xA;&lt;p&gt;My understanding of our consensus was that OWCs are currently required for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; questions, so that tips can be compared objectively. However, I can't seem to find any posts about it, and nobody in TNB seemed super sure either way.&lt;/p&gt;&#xA;&lt;p&gt;So, do &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; questions need winning criteria, assuming they're on-topic to CGCC (such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;polyglot-container&quot;&gt;polyglot&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;king-of-the-hill-container&quot;&gt;king-of-the-hill&lt;/a&gt; tips)?&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="107310" LastEditDate="2022-08-31T15:02:31.087" LastActivityDate="2022-09-01T12:24:13.697" Title="Do [tips] questions need an objective winning criterion?" Tags="|discussion|tags|winning-criteria|tips|" AnswerCount="7" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25071" PostTypeId="2" ParentId="25070" CreationDate="2022-08-31T13:59:25.930" Score="6" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;on-topic page for our site&lt;/a&gt; states that:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Non-challenge questions that are related to solving programming puzzles or a particular type of challenge are also on topic. However, if you have a general programming question, it should be asked on Stack Overflow or a different Stack Exchange site.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Therefore, if a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; question is asking about how to solve a programming puzzle/particular kind of challenge that can be linked to a well-defined tag such as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;polyglot-container&quot;&gt;polyglot&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;restricted-source-container&quot;&gt;restricted-source&lt;/a&gt;, it should be allowed.&lt;/p&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2022-08-31T14:00:40.883" LastActivityDate="2022-08-31T14:00:40.883" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25072" PostTypeId="2" ParentId="25070" CreationDate="2022-08-31T14:05:10.363" Score="2" Body="&lt;h1&gt;No!&lt;/h1&gt;&#xA;&lt;p&gt;I don't think &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; questions should require OWCs. This is for a few reasons:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Stack Exchange is made for Q&amp;amp;A, most of which is not objective. This works fine on other sites, so there's no reason it can't work here&lt;/li&gt;&#xA;&lt;li&gt;While these sorts of questions are on-topic on SO, our community has much more of a focus on things like polyglotting and source layout, so better tips will likely be posted (and quicker, since there's significantly more attention that can be directed toward each question than on SO)&lt;/li&gt;&#xA;&lt;li&gt;Not all challenge types can have objective tips provided; e.g., a general &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;fastest-code-container&quot;&gt;fastest-code&lt;/a&gt; tip will have different impacts depending on the context&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-08-31T14:05:10.363" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25073" PostTypeId="2" ParentId="25070" CreationDate="2022-08-31T14:06:53.097" Score="-1" Body="&lt;h2&gt;Yes&lt;/h2&gt;&#xA;&lt;p&gt;A fundamental premise for &lt;em&gt;all&lt;/em&gt; questions on this site is that they have an objective winning criteria. This is iterated in our &lt;a href=&quot;https://codegolf.stackexchange.com/tour&quot;&gt;Tour&lt;/a&gt;, our &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;help page&lt;/a&gt; and the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/20861/welcome-to-code-golf-and-coding-challenges-stack-exchange&quot;&gt;Welcome page&lt;/a&gt;. This distinction is one of the &lt;a href=&quot;https://meta.stackexchange.com/a/129632/355458&quot;&gt;main differences between us and the other computer science SE sites&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;A &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; question still needs to meet this requirement, the only difference is that answers give advice to the asker on improving their score, rather than competing against each other for the best score.&lt;/p&gt;&#xA;&lt;p&gt;The linked question, as written, would currently be on-topic on Stack Overflow, as it's about taking a piece of code that currently doesn't work, and attempting to fix it. If some OWC was provided, e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, then it would be on-topic here. As it stands however, it is not.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-08-31T14:06:53.097" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25074" PostTypeId="2" ParentId="25070" CreationDate="2022-08-31T14:16:23.313" Score="9" Body="&lt;h1&gt;No, but ...&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; is the Q&amp;amp;A portion of our site.  The point of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; (at least as I view it) is to provide assistance with ppcg-style challenges (mostly code-golf).&lt;/p&gt;&#xA;&lt;p&gt;I think in order for it to be on topic for our site it needs to be clearly related to a question on the site, or a question that could be on our site. This is a bit subjective, but that's fine. It allows for human judgement.  An objective scoring criterion is neither a necessary nor sufficient component of  a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; question.&lt;/p&gt;&#xA;&lt;p&gt;This allows potentially for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; that don't have an objective scoring criterion.  For example if you are struggling to even meet the validity criterion of a challenge (e.g. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;restricted-source-container&quot;&gt;restricted-source&lt;/a&gt;) you can ask for help with that and do the golfing yourself later. I think that makes perfect sense for an on topic question. In fact the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/209734/tips-for-restricted-source-in-python&quot;&gt;tips for restricted source&lt;/a&gt; type questions are already like this and people seem ok with that.&lt;/p&gt;&#xA;&lt;p&gt;However the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; question linked, I don't think is on topic.  It is asking about making a polyglot, which is like a ppcg question, but the asker already has a valid polyglot and just wants to make it &amp;quot;neater&amp;quot;. This isn't really what PPCG is about, in fact if we are about anything we are about making code &lt;em&gt;less&lt;/em&gt; neat. It's hard to think of a PPCG question where this would be helpful so it's not on topic.&lt;/p&gt;&#xA;&lt;p&gt;In summary: A &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; question does not need an objective scoring criterion to be on topic, but the linked question is still not on topic.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2022-08-31T14:16:23.313" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25075" PostTypeId="2" ParentId="25070" CreationDate="2022-08-31T14:20:49.140" Score="1" Body="&lt;h1&gt;Tips question need a winning criterion, but it does not need to be completely objective&lt;/h1&gt;&#xA;&lt;p&gt;This site is about solving challenges as optimally as possible. Tips questions are only on topic if they could help someone to achieve that goal.&lt;/p&gt;&#xA;&lt;p&gt;However, the winning criteria do not need to be &amp;quot;objective&amp;quot;. A single tips questions can help people solve a variety of different challenges, each with a slightly (or significantly) different winning criteria. Thus a &amp;quot;objective&amp;quot; measurement is nearly impossible and undesirable. A broad category is sufficient.&lt;/p&gt;&#xA;&lt;p&gt;Writing a &amp;quot;as good as possible&amp;quot; golfing language would be on topic for example. While each golfing language has different goals there are plenty of principles that apply to all. I'd consider it the same as &amp;quot;tips for golfing with restricted source&amp;quot;, since each tip may or may not be applicable depending on the exact way the source is restricted.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="56656" LastEditDate="2022-08-31T14:35:29.010" LastActivityDate="2022-08-31T14:35:29.010" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25076" PostTypeId="2" ParentId="25070" CreationDate="2022-08-31T14:25:26.180" Score="16" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;Or more to the point, &lt;em&gt;how&lt;/em&gt;?&lt;/p&gt;&#xA;&lt;p&gt;Frankly, I'm on the fence about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/251491/need-some-feedback-with-phpc-polyglot-code-and-class-struct-properties&quot;&gt;the linked question&lt;/a&gt;. However, whatever's wrong with it isn't that it lacks an objective winning criterion, because &lt;em&gt;every&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; question save for the &amp;quot;help me golf this specific code&amp;quot; variety (which I can't say I'm any more fond of!) lacks an objective winning criterion. A tip isn't a solution or code; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; isn't a competition, shouldn't be, and can't be.&lt;/p&gt;&#xA;&lt;p&gt;If the real question is if all &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; questions should &lt;em&gt;relate&lt;/em&gt; to an objective winning criterion, my answer is still no; what about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;restricted-source-container&quot;&gt;restricted-source&lt;/a&gt;? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/101159/tips-for-creating-polyglots&quot;&gt;This&lt;/a&gt; is another &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;polyglot-container&quot;&gt;polyglot&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; question that seems to have been well-received by the community, and for good reason. And there's no reason a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;restricted-source-container&quot;&gt;restricted-source&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;polyglot-container&quot;&gt;polyglot&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; question should also have to specifically concern an objective winning criterion, because the same concepts will apply regardless.&lt;/p&gt;&#xA;&lt;p&gt;If we want to institute a policy against &amp;quot;narrow&amp;quot; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; questions, that's a different discussion entirely.&lt;/p&gt;&#xA;" OwnerUserId="85334" LastActivityDate="2022-08-31T14:25:26.180" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25077" PostTypeId="2" ParentId="2140" CreationDate="2022-08-31T15:52:42.703" Score="0" Body="&lt;h1&gt;Strategy: The cunning cousin witch&lt;/h1&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/251029/optimal-strategy-to-defeat-the-wizard&quot;&gt;wizard&lt;/a&gt; has a cunning cousin who is a witch. She looks down on the wizard, regarding him and his puzzles as mathematically naive.  On reading his latest puzzle, she scorned him for always asking discrete problems with what she (unfairly) characterises as simple solutions, where the real, proper question should be continuous. To prove her point she poses the following version of the wizard's puzzle. (He reluctantly permits the partial plagiarism.)&lt;/p&gt;&#xA;&lt;p&gt;Consider the following setup. An evil witch has a number line stretching from 0 to 10 which is hidden from you.  Also hidden from you she chooses a random integer &lt;span class=&quot;math-container&quot;&gt;\$x \in \{0, \dots, 10\}\$&lt;/span&gt; and places that many points onto the number line uniformly at random. To be more precise, she places each of the &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; points independently and uniformly at random onto the number line.  Your task is to prove that &lt;span class=&quot;math-container&quot;&gt;\$x = 10\$&lt;/span&gt; and if you do the witch will grant you what she promises is a much better wish than what her cousin can provide.&lt;/p&gt;&#xA;&lt;p&gt;In this game, you can at each step choose a floating point number &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt; and the witch will tell you the number of points on the number line with value less than or equal to &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;However the witch, being at least as evil as her cousin, will not let you choose a number larger than &lt;span class=&quot;math-container&quot;&gt;\$9\$&lt;/span&gt;. This might still be OK as you might still find 10 points and in fact the only way to be granted the wish is to have found all 10 points with values 9 or less.&lt;/p&gt;&#xA;&lt;p&gt;The cost for choosing a floating point number &lt;span class=&quot;math-container&quot;&gt;\$\ell\$&lt;/span&gt; is &lt;span class=&quot;math-container&quot;&gt;\$2^{\ell}\$&lt;/span&gt; dollars.   At any point, you can choose to give up on this set of points and get her to start the whole process again (with a new random &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;). Of course, if you choose the number 9 and you still have not found 10 points you have no choice but to give up and start again. But you might want to give up earlier too. Sadly you never get any money back so your costs just carry on building.&lt;/p&gt;&#xA;&lt;p&gt;Your goal is to devise a strategy that will get you the wish at the minimum expected cost. You should report your mean cost.&lt;/p&gt;&#xA;&lt;h1&gt;Testing&lt;/h1&gt;&#xA;&lt;p&gt;Once you have chosen your strategy, you should run it until you get the wish 10,000 times and report the mean cost. If two answers have the same strategy, the one posted first wins. If two strategies have similar mean costs you may need to test it 100,000 or even more times to tell the difference.  Of course if you can directly compute the expected cost, all the better.&lt;/p&gt;&#xA;&lt;h1&gt;Input and output&lt;/h1&gt;&#xA;&lt;p&gt;There is no input in this challenge. The output is just the mean cost to get a wish. To test your code you will need to implement both the witch and your strategy.&lt;/p&gt;&#xA;&lt;h1&gt;What's a naive score?&lt;/h1&gt;&#xA;&lt;p&gt;If you just choose 9 each time then it will take you &lt;span class=&quot;math-container&quot;&gt;\$\frac{1}{\frac{1}{11} \cdot \frac{9}{10}^{10}} \approx 31.5\$&lt;/span&gt;  tries to find 10 points. This will cost you approximately &lt;span class=&quot;math-container&quot;&gt;\$16152.4\$&lt;/span&gt; dollars.  How much better can you do?&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-challenge-container&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user108721" LastEditorDisplayName="user108721" LastEditDate="2022-09-01T12:30:14.740" LastActivityDate="2022-09-01T12:30:14.740" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25078" PostTypeId="1" AcceptedAnswerId="25079" CreationDate="2022-08-31T17:21:42.737" Score="12" ViewCount="178" Body="&lt;p&gt;Myself, emanresu A, and lyxal have decided to propose a new event: the CGCC Langjam! The basic idea is that this is a yearly event in which participants will have one week to invent a new golfing language in a certain paradigm, which must then be used to solve a selection of code golf challenges (which ones will remain secret until the end of the event). The lang with the lowest total score wins! The paradigm will be voted on before the start of the event. Discussion should be in the &lt;a href=&quot;https://chat.stackexchange.com/rooms/137998/cgcc-langjam-2022&quot;&gt;dedicated chatroom&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2022-09-11T22:59:21.503" LastActivityDate="2022-09-11T22:59:21.503" Title="Event Proposal: CGCC Langjam" Tags="|discussion|langjam|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25079" PostTypeId="2" ParentId="25078" CreationDate="2022-08-31T17:35:30.213" Score="12" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;I have myself thought about this a while ago. What better way to explore ways of writing shorter code than making a contest out of it? I'd say make this happen more often, perhaps twice a year.&lt;/p&gt;&#xA;" OwnerUserId="107299" LastActivityDate="2022-08-31T17:35:30.213" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25080" PostTypeId="2" ParentId="2140" CreationDate="2022-08-31T23:34:01.630" Score="3" Body="&lt;h1&gt;Zip two arrays&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a list of arrays of the same dimension, zip them at the lowest level. That is, you should output an array of the same dimension, for which the value at each index is a list of the corresponding elements in the input arrays.&lt;/p&gt;&#xA;&lt;p&gt;For example, for two 3x3 arrays&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[123]  [[abc]    [[[1a][2b][3c]]&#xA; [456] , [def]  →  [[4d][5e][6f]]&#xA; [789]]  [ghi]]    [[7g][8h][9i]]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and for the three 4x4 arrays&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[19  47  4   69 ]  [[103 67  17  28 ]  [[7   9   48  204]&#xA; [156 120 54  104]   [167 80  99  62 ]   [26  125 230 212]&#xA; [30  70  212 96 ] , [102 165 246 192] , [61  118 137 101]&#xA; [62  80  152 205]]  [118 193 222 65 ]]  [125 247 209 31 ]]&#xA; ↓&#xA;[[[19  103 7  ] [47  67  9  ] [4   17  48 ] [69  28  204]]&#xA; [[156 167 26 ] [120 80  125] [54  99  230] [104 62  212]]&#xA; [[30  102 61 ] [70  165 118] [212 246 137] [96  192 101]]&#xA; [[62  118 125] [80  193 247] [152 222 209] [205 65  31 ]]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;todo&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox notes&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This feels like something that should've already been posted.&lt;/li&gt;&#xA;&lt;li&gt;Name/wording suggestions?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="81203" LastEditorUserId="81203" LastEditDate="2022-09-02T00:28:02.140" LastActivityDate="2022-09-02T00:28:02.140" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25081" PostTypeId="2" ParentId="25070" CreationDate="2022-09-01T12:24:13.697" Score="-4" Body="&lt;h1&gt;Tips should be on Meta&lt;/h1&gt;&#xA;&lt;p&gt;I understand that currently they can be posted on both places. However, I think that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It makes it harder to find tips because they are scattered&lt;/li&gt;&#xA;&lt;li&gt;It doesn't fit as a &amp;quot;Code Golf or Coding Challenge&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;It is more related to &amp;quot;how this site works&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;Questions &amp;quot;should&amp;quot; have an objective winning criterion&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Thus, I think that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; questions should be posted on meta and thus do not require an &amp;quot;objective winning criterion&amp;quot;.&lt;/p&gt;&#xA;" OwnerUserId="111945" LastActivityDate="2022-09-01T12:24:13.697" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25082" PostTypeId="1" CreationDate="2022-09-01T17:41:09.290" Score="12" ViewCount="467" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19271/reviving-language-of-the-month-pick-up-where-we-left-off-or-start-over&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout September 2022, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Prolog&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;What's a Language of the Month?&lt;/h2&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19279/nominations-for-language-of-the-month-take-2?answertab=scoredesc#tab-top&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during September, those who wish to participate should learn (at least the basics of) Prolog, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about Prolog&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Prolog or PROgramming in LOGics is a logical and declarative programming language. It is one major example of the fourth generation language that supports the declarative programming paradigm. This is particularly suitable for programs that involve symbolic or non-numeric computation. This is the main reason to use Prolog as the programming language in Artificial Intelligence, where symbol manipulation and inference manipulation are the fundamental tasks.&lt;/p&gt;&#xA;&lt;p&gt;In Prolog, we need not mention the way how one problem can be solved, we just need to mention what the problem is, so that Prolog automatically solves it. However, in Prolog we are supposed to give clues as the solution method.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;-- &lt;a href=&quot;https://www.tutorialspoint.com/prolog/prolog_introduction.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tutorialspoint&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Prolog&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.swi-prolog.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;SWI-Prolog&lt;/a&gt; (on &lt;a href=&quot;https://tio.run/#prolog-swi&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://www.gprolog.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;GNU Prolog&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://learnxinyminutes.com/docs/prolog/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tutorial&lt;/a&gt; on Learn X in Y Minutes&lt;/li&gt;&#xA;&lt;li&gt;or on &lt;a href=&quot;https://www.tutorialspoint.com/prolog/prolog_introduction.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tutorialspoint&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/67023/tips-for-golfing-in-prolog&quot;&gt;Tips for golfing in Prolog&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/74093/the-prolog-cabin&quot;&gt;Chat room&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Bounty&lt;/h2&gt;&#xA;&lt;p&gt;I, Steffan, will offer a +100 bounty for any user's 5th Prolog answer in September.&lt;br&gt;&#xA;I, user, will &lt;em&gt;try&lt;/em&gt; to offer a n*100 bounty for any user's nth Prolog answer in September.&lt;/p&gt;&#xA;" OwnerUserId="92689" LastEditorUserId="95792" LastEditDate="2022-09-01T19:19:34.103" LastActivityDate="2022-09-26T21:14:17.977" Title="Language of the Month for September 2022: Prolog" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25083" PostTypeId="2" ParentId="25082" CreationDate="2022-09-01T17:41:09.290" Score="4" Body="&lt;h1&gt;List of all Prolog answers posted in September 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/247835/previous-fibonacci-number/251536#251536&quot;&gt;Previous Fibonacci number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/102685/sum-of-modulo-sums/251537#251537&quot;&gt;Sum of Modulo Sums&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251351/the-second-even-sublime-number/251547#251547&quot;&gt;The second even sublime number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210071/the-vanilla-factorial-challenge/251552#251552&quot;&gt;The vanilla factorial challenge&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/5056/code-golf-permutations/251559#251559&quot;&gt;Code-Golf: Permutations&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250883/anti-divisors-of-a-number/251560#251560&quot;&gt;Anti-divisors of a number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250918/cartesian-polar-conversion-couple/251562#251562&quot;&gt;Cartesian - polar conversion couple&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210071/the-vanilla-factorial-challenge/251561#251561&quot;&gt;The vanilla factorial challenge&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/76162/jo-king&quot;&gt;Jo King&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/251570/91213&quot;&gt;Add parentheses to Polish notation&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/91213/mousetail&quot;&gt;Mousetail&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/53675/calculate-average-characters-of-string/251567#251567&quot;&gt;Calculate average characters of string&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/76162/jo-king&quot;&gt;Jo King&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/133109/sum-of-all-integers-from-1-to-n/251569#251569&quot;&gt;Sum of all integers from 1 to n&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/76162/jo-king&quot;&gt;Jo King&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/62732/implement-a-truth-machine/251565#251565&quot;&gt;Implement a Truth-Machine&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/76162/jo-king&quot;&gt;Jo King&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251283/carry-less-sum-given-a-base-b/251574#251574&quot;&gt;Carry-less sum given a base b&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250861/add-parentheses-to-polish-notation/251577&quot;&gt;Add parentheses to Polish notation&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250338/shifted-auto-sum/251578#251578&quot;&gt;Shifted auto-sum&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250283/rearrange-to-a-palindrome/251579#251579&quot;&gt;Rearrange to a palindrome&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/71335/difference-of-three-input-integers/251584#251584&quot;&gt;Difference of three input integers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/248245/make-a-list-flat/251587#251587&quot;&gt;Make a list flat&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/244049/zip-uneven-lists/251591#251591&quot;&gt;Zip uneven lists&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/77608/all-together-now/251612#251612&quot;&gt;All together now&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251603/sum-of-partition-numbers/251619#251619&quot;&gt;Sum of partition numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/136078/how-does-the-square-end/251600#251600&quot;&gt;How does the square end?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/76162/jo-king&quot;&gt;Jo King&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/248245/make-a-list-flat/251590#251590&quot;&gt;Make a list flat&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/76162/jo-king&quot;&gt;Jo King&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/181350/am-i-not-good-enough-for-you/251593#251593&quot;&gt;Am I not good enough for you?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/104508/is-it-a-mersenne-prime/251624#251624&quot;&gt;Is it a Mersenne Prime?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251594/find-the-nth-mersenne-prime/251625#251625&quot;&gt;Find the nth Mersenne Prime&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/168765/sort-odd-numbers-first/251628#251628&quot;&gt;Sort odd numbers first&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/107116/its-time-for-a-clock-challenge/251631#251631&quot;&gt;It&amp;#39;s time for a clock challenge!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251626/is-this-an-equivalence-relation/251635#251635&quot;&gt;Is This an Equivalence Relation?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/66197/is-it-a-pangram/251644#251644&quot;&gt;Is it a pangram?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/76162/jo-king&quot;&gt;Jo King&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/66193/sums-of-consecutive-integers/251645#251645&quot;&gt;Sums of Consecutive Integers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/76162/jo-king&quot;&gt;Jo King&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/38325/minimum-excluded-number/251648#251648&quot;&gt;Minimum excluded number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/133754/one-oeis-after-another/251651#251651&quot;&gt;One OEIS after another&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/119278/lengthen-letter-runs/251653#251653&quot;&gt;Lengthen letter runs&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/47201/check-whether-letters-of-word-are-in-alphabetical-order/251654#251654&quot;&gt;Check whether letters of word are in alphabetical order&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251689/the-fly-straight-dammit-sequence/251707#251707&quot;&gt;The &amp;quot;Fly straight, dammit&amp;quot; sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/155938/sum-of-combinations-with-repetition/251717#251717&quot;&gt;Sum of combinations with repetition&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251674/number-of-ways-to-make-an-amount-with-coins/251721#251721&quot;&gt;Number of ways to make an amount with coins&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/238462/convert-superscript-numbers-to-normal-numbers/251734#251734&quot;&gt;Convert superscript numbers to normal numbers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251656/persistence-of-a-number/251757#251757&quot;&gt;Persistence of a number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/188988/ddoouubbllee-ssppeeaakk/251761#251761&quot;&gt;&amp;quot;DDoouubbllee ssppeeaakk!!&amp;quot;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/200306/scream-very-loudly/251763#251763&quot;&gt;Scream very loudly&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251772/tut-tut-tut-tut-tut/251784#251784&quot;&gt;Tut-tut-tut-tut-tut&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/201176/numbers-by-position/251825#251825&quot;&gt;Numbers by Position&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/251861/91213&quot;&gt;Get the length of a Sumac Sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/91213/mousetail&quot;&gt;Mousetail&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251925/sudoku-solver-diagonal-constraint/251964#251964&quot;&gt;Sudoku Solver Diagonal Constraint&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251740/fibonacci-word-fractal/251918#251918&quot;&gt;Fibonacci word fractal&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/114450/crowproxy&quot;&gt;crowproxy&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251864/re-name-all-identifiers-to-a-single-letter/251901#251901&quot;&gt;Re-name all identifiers to a single letter&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/114450/crowproxy&quot;&gt;crowproxy&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249208/decipher-a-squashed-sequence/251881#251881&quot;&gt;Decipher a squashed sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/76162/jo-king&quot;&gt;Jo King&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251864/re-name-all-identifiers-to-a-single-letter/252173#252173&quot;&gt;Re-name all identifiers to a single letter&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/20059/0&quot;&gt;0                                                                                                                '&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/126373/am-i-a-fibonacci-number/252215#252215&quot;&gt;Am I a Fibonacci Number?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/142071/find-the-sum-of-the-divisors-of-n/252243#252243&quot;&gt;Find the sum of the divisors of N&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant tips posted in September 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/67023/tips-for-golfing-in-prolog/251862#251862&quot;&gt;Shorter stdlib alternatives&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/80214/razetime&quot;&gt;Razetime&lt;/a&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;tip summary&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant challenges posted in September 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="92689" LastEditorUserId="96039" LastEditDate="2022-09-26T21:14:17.977" LastActivityDate="2022-09-26T21:14:17.977" CommentCount="0" CommunityOwnedDate="2022-09-02T14:40:09.117" ContentLicense="CC BY-SA 4.0" />
  <row Id="25084" PostTypeId="2" ParentId="2140" CreationDate="2022-09-01T21:12:17.717" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251656/persistence-of-a-number&quot;&gt;Persistence of a number&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2022-09-09T17:13:32.490" LastActivityDate="2022-09-09T17:13:32.490" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25086" PostTypeId="2" ParentId="24749" CreationDate="2022-09-02T12:48:27.847" Score="-3" Body="&lt;p&gt;I think deleting sandbox posts is unnecessary.&lt;/p&gt;&#xA;&lt;p&gt;I recently deleted a sandbox post whose question was confusing. The deleted post came to the top of the list (for me only) after deleting it. When people make a lot of questions and sandbox posts, and then delete the posts, the deleted posts could really clutter their sandbox up.&lt;/p&gt;&#xA;&lt;p&gt;Plus, it would probably be unknown as to whether a question  was actually posted on sandbox at all, so that using Sandbox can be recommended for the future (especially from new users, that issue is discussed &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24508/how-can-we-get-new-users-to-use-the-sandbox-properly&quot;&gt;How can we get new users to use the sandbox properly?&lt;/a&gt;), although I think this line of argument is weak.&lt;/p&gt;&#xA;" OwnerUserId="110681" LastEditorUserId="110681" LastEditDate="2022-09-03T15:43:13.337" LastActivityDate="2022-09-03T15:43:13.337" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25087" PostTypeId="2" ParentId="2140" CreationDate="2022-09-02T16:13:05.950" Score="2" Body="&lt;h2&gt;write the &amp;quot;index by number&amp;quot; sequence&lt;/h2&gt;&#xA;&lt;p&gt;Imagine writing out positive integer numbers, and indexing each character in a 1-indexed array (indices read vertically on the top two rows, numbers read horizontally on the third):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;000000000111111111122222222223333333333444444444&#xA;123456789012345678901234567890123456789012345678&#xA;one two three four five six seven eight nine ten&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Now, imagine if we skipped some numbers so we write the index at the point we start the next number:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;000000000111111111122222222223333333333444444444&#xA;123456789012345678901234567890123456789012345678&#xA;one five ten fourteen twenty three thirty six fo&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;now, imagine that the first number doesn't have to be &amp;quot;one&amp;quot;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;000000000111111111122222222223333333333444444444&#xA;123456789012345678901234567890123456789012345678&#xA;      seven thirteen twenty two thirty three for&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;A single number from 1..999, in any format you like (&lt;code&gt;&amp;quot;1&amp;quot;&lt;/code&gt;, &lt;code&gt;'1'&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt;, &lt;code&gt;&amp;quot;one&amp;quot;&lt;/code&gt; etc.)&lt;/p&gt;&#xA;&lt;p&gt;This forms the starting number for the sequence&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;A sequence of numbers, written long-hand in UK English (&amp;quot;one hundred &lt;strong&gt;and&lt;/strong&gt; one&amp;quot; - no other differences), from (input)..(999) inclusive.&lt;/p&gt;&#xA;&lt;p&gt;Code golf, usual rules.&lt;/p&gt;&#xA;" OwnerUserId="62289" LastEditorUserId="62289" LastEditDate="2022-09-20T07:46:50.733" LastActivityDate="2022-09-20T07:46:50.733" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="25088" PostTypeId="2" ParentId="2140" CreationDate="2022-09-03T00:51:43.750" Score="3" Body="&lt;h1&gt;Erasure Poetry&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-answer-chaining-tooltip-container&quot;&gt;answer-chaining&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-challenge-tooltip-container&quot;&gt;code-challenge&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given two strings of digits &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;, count the minimum number of digits that need to be removed from &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; to make it a substring of &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;. (META: i am still brainstorming what this actual challenge part should be, though i think this challenge might be good).&lt;/p&gt;&#xA;&lt;p&gt;However, you will not be &amp;quot;writing&amp;quot; programs/functions to solve this challenge, so much as you will be finding them in the previous answer.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge specification&lt;/h2&gt;&#xA;&lt;p&gt;(spec in progress)&lt;/p&gt;&#xA;&lt;p&gt;Take two strings of digits &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;. You can assume these strings will both be nonzero in length and contain any amount of the following characters in any order: &lt;code&gt;0123456789&lt;/code&gt;. Return the number of digits needed to be removed from &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; in order to make it be a substring of &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Worked out examples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A: &amp;quot;3&amp;quot;&#xA;B: &amp;quot;123&amp;quot;&#xA;Output: 0&#xA;Explanation: &amp;quot;3&amp;quot; is already a substring of &amp;quot;123&amp;quot;, so 0 characters need to be removed from it&#xA;&#xA;A: &amp;quot;1322&amp;quot;&#xA;B: &amp;quot;12345&amp;quot;&#xA;Output: 2&#xA;Explanation: &amp;quot;12&amp;quot; is the biggest potential substring of B that could be made from A, and it requires removing the 3 and one of the 2s&#xA;&#xA;A: &amp;quot;12345&amp;quot;&#xA;B: &amp;quot;123&amp;quot;&#xA;Output: 2&#xA;Explanation: &amp;quot;123&amp;quot; is the biggest potential substring of B that could be made from A, and it requires removing the 4 and 5&#xA;&#xA;A: &amp;quot;12345&amp;quot;&#xA;B: &amp;quot;67890&amp;quot;&#xA;Output: 5&#xA;Explanation: None of A exists in B, so &amp;quot;&amp;quot; (the empty string) is the biggest potential substring of B that could be made from A, and it requires removing all 5 of the digits&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Scoring specification&lt;/h2&gt;&#xA;&lt;p&gt;Contrary to what I said in the intro, you will technically be writing a program or function to solve this challenge. However, you will not be scored directly on your code length.&lt;/p&gt;&#xA;&lt;p&gt;Included with your answer will be a list of characters you will remove from the previous answer's code such that it becomes your answer's code. If this is not possible with removals alone, you may also add characters to the previous answer, but this will come with a score penalty.&lt;/p&gt;&#xA;&lt;p&gt;In particular: Your score is the number of characters you need to add to some substring of the previous answer's code in order to make it your answer's code. Lowest score wins.&lt;/p&gt;&#xA;&lt;p&gt;The first answer to base your score off of will be provided at the bottom of this post.&lt;/p&gt;&#xA;&lt;h2&gt;Answer chaining rules&lt;/h2&gt;&#xA;&lt;p&gt;Importantly, you may not answer the challenge in a language that has already been used unless your answer has a lower score. Flags and version numbers do not differentiate languages in this challenge.&lt;/p&gt;&#xA;&lt;p&gt;(more clarifications and guidelines)&lt;/p&gt;&#xA;&lt;h2&gt;Answer chaining example&lt;/h2&gt;&#xA;&lt;h1&gt;6. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1071/107310&quot;&gt;MyOwnLanguage&lt;/a&gt;, +3 characters&lt;/h1&gt;&#xA;&lt;p&gt;previous answer with removed characters replaced with &lt;code&gt;*&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;do ****thing *o**&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;with my added characters becomes:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;do thing now!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.google.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try It Online&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;7. &lt;a href=&quot;https://en.wikipedia.org/wiki/Super_Mario_Galaxy&quot; rel=&quot;nofollow noreferrer&quot;&gt;HQ9+2&lt;/a&gt;, +0 characters&lt;/h1&gt;&#xA;&lt;p&gt;previous answer with removed characters replaced with &lt;code&gt;*&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;do*thing****!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;with my (0) added characters becomes:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;dothing!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.bing.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try It Online&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Starting answer&lt;/h2&gt;&#xA;&lt;h1&gt;0. &lt;a href=&quot;https://v8.dev/&quot; rel=&quot;nofollow noreferrer&quot;&gt;JavaScript (V8)&lt;/a&gt;, +361 characters&lt;/h1&gt;&#xA;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;f = (a, b) =&amp;gt; {&#xA;  const isSubstring = (c, d) =&amp;gt; {&#xA;    if(!c){&#xA;      return true&#xA;    }else{&#xA;      return RegExp(`${c}`).test(d)&#xA;    }&#xA;  }&#xA;  if(isSubstring(a, b)){&#xA;    return 0&#xA;  }else{&#xA;    a = [...Array(a.length).keys()]&#xA;        .map(w =&amp;gt; a.slice(0, w)&#xA;                + a.slice(w + 1)&#xA;            )&#xA;    a = a.map(w =&amp;gt; f(w,b))&#xA;    return 1 + Math.min(...a)&#xA;  }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##bZDNTsMwEITveYol4uAVwcoPhXIIEgeOXOCIkOq6TmpIQ2Q7DVWVZw9OnYYEYcnyyvPt7NgfbM80V7Iy1/tl12WQAmEBrBHSBzh6APyr1Aakfq3X2ihZ5j3BA9iMBIDMyAVHVwMoYWpVglG1ON20otDij/gi8qfviqwuj7xdITVCG7JBh3tuW9PJVBdqmDGYhN7MnNlkb5TSR6XYgTBaiDI3W6Sf4qAJvg8BAOiOVaTp0zOqC8kFCQNocNTP62rUG1tHcwDHkezXLyNNYENOM0a29ZmZLd3JkthwDE/Pa7vKvsoQ23Ky8xM/6I8oTnz7sSmE6E0IP0ri2BK9frNwRDwlBmHu8T/h394t70NHLLD7AQ&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;JavaScript (V8) – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;meta&lt;/h1&gt;&#xA;&lt;p&gt;work in progresss, but feel free to suggest anything you think i might be missing, even if it seems obvious. Still working out the formatting for everything to look nice :-)&lt;/p&gt;&#xA;" OwnerUserId="107310" LastEditorUserId="107310" LastEditDate="2023-08-24T08:08:11.877" LastActivityDate="2023-08-24T08:08:11.877" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25089" PostTypeId="2" ParentId="2140" CreationDate="2022-09-03T19:59:04.947" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;answer-chaining-container&quot;&gt;answer-chaining&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;king-of-the-hill-container&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;This is less of a challenge proposal, and more of a idea for how to mesh the two title tags.&lt;/p&gt;&#xA;&lt;h2&gt;A series of targeted fights&lt;/h2&gt;&#xA;&lt;p&gt;Consider a heads-up, 1v1 &amp;quot;game&amp;quot; between two king-of-the-hill style bots. However, unlike a general king-of-the-hill, where every bot plays against every other bot, we instead build bots that target specific bots to win against. An example of an existing bot would be &lt;a href=&quot;https://codegolf.stackexchange.com/a/223223/66833&quot;&gt;Low Blow&lt;/a&gt; from &lt;a href=&quot;https://codegolf.stackexchange.com/q/223202/66833&quot;&gt;Cooperative Counting&lt;/a&gt;, which aimed to identify it's opponent, then play counter to that bot. However, in this challenge, the bot wouldn't &lt;em&gt;have&lt;/em&gt; to identify its opponent: it would &lt;em&gt;only&lt;/em&gt; play one bot, the bot it was designed to beat.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;answer-chaining-container&quot;&gt;answer-chaining&lt;/a&gt; aspect comes from this targeting:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;em&gt;User A&lt;/em&gt; posts &lt;strong&gt;Bot A&lt;/strong&gt;, targeting a provided example bot.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;User B&lt;/em&gt; then posts &lt;strong&gt;Bot B&lt;/strong&gt;, targeting &lt;strong&gt;Bot A&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;User C&lt;/em&gt; then posts &lt;strong&gt;Bot C&lt;/strong&gt;, targeting a second example bot.&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;User D&lt;/em&gt; then posts &lt;strong&gt;Bot D&lt;/strong&gt;, also targeting &lt;strong&gt;Bot A&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And so on, creating a &amp;quot;tree&amp;quot; of answers, each targeting a previous answer. Note that new answers don't have to target the latest, but can instead target any previous answer.&lt;/p&gt;&#xA;&lt;p&gt;However, to prevent bots that &amp;quot;target&amp;quot;, but don't actual perform well against their target, we'd need to require that it beats its target in &lt;span class=&quot;math-container&quot;&gt;\$X\%\$&lt;/span&gt; of &lt;span class=&quot;math-container&quot;&gt;\$Y\$&lt;/span&gt; battles, or else it is disqualified. Obviously, this prevents bots from being edited to improve themselves once targeted.&lt;/p&gt;&#xA;&lt;p&gt;This begs the question: what is our scoring criteria? Clearly, depth from the root bots (provided in the challenge) must be a central part, as it's harder to create a bot the further down the chain you go. However, this doesn't differentiate between &lt;strong&gt;Bot B&lt;/strong&gt; and &lt;strong&gt;Bot D&lt;/strong&gt; in our example, despite the fact that &lt;strong&gt;Bot D&lt;/strong&gt; beats &lt;strong&gt;Bot A&lt;/strong&gt; &lt;span class=&quot;math-container&quot;&gt;\$82\%\$&lt;/span&gt; of the time, vs &lt;strong&gt;Bot B&lt;/strong&gt;'s meager win rate of &lt;span class=&quot;math-container&quot;&gt;\$61\%\$&lt;/span&gt;. Clearly, we should take winning rate into account. One potential score:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$\text{Score} = \text{Win rate} \times \text{Depth}$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;where &lt;span class=&quot;math-container&quot;&gt;\$\text{Win rate}\$&lt;/span&gt; is between &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; (never wins) and &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; (always wins).&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Thoughts?&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-09-03T19:59:04.947" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25090" PostTypeId="2" ParentId="2140" CreationDate="2022-09-03T21:39:02.287" Score="7" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251708/when-will-the-dvd-logo-hit-the-corner&quot;&gt;When will the DVD logo hit the corner?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="87307" LastEditorUserId="87307" LastEditDate="2022-09-05T19:35:01.720" LastActivityDate="2022-09-05T19:35:01.720" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25091" PostTypeId="2" ParentId="20722" CreationDate="2022-09-04T00:49:50.627" Score="5" Body="&lt;p&gt;My username is Aiden Chow. I mean, it's pretty obvious where it came from... I obviously used an AI to randomly generate names until I found one that I liked.... jk jk LOL. It's literally my real name, nothing much to it. You can tell I put so much thought and effort into my username XD.&lt;/p&gt;&#xA;&lt;p&gt;As for my pfp, I drew it years ago when Google Hangouts still had a &lt;a href=&quot;https://www.cnet.com/tech/services-and-software/send-drawings-to-friends-with-google-hangouts-on-the-web/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Draw Feature&lt;/a&gt; (rip draw feature, you will forever be missed...). My friend and I were basically just sending random doodles to each other, and I noticed that one of my scribbles looked vaguely like a face. So I drew in the eyes, put in the mouth, and boom, my pfp.&lt;/p&gt;&#xA;" OwnerUserId="96039" LastActivityDate="2022-09-04T00:49:50.627" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25092" PostTypeId="2" ParentId="2140" CreationDate="2022-09-04T07:21:15.757" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/252009&quot;&gt;Compute the Fabius function&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$f(x)\$&lt;/span&gt; always takes on rational values at dyadic rationals (i.e. &lt;span class=&quot;math-container&quot;&gt;\$\frac m{2^n}\$&lt;/span&gt; with &lt;span class=&quot;math-container&quot;&gt;\$m,n\in\mathbb Z\$&lt;/span&gt;). It could also be interesting to restrict input to such values, and ask for a rational output.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="81203" LastEditorUserId="81203" LastEditDate="2022-09-19T00:40:39.260" LastActivityDate="2022-09-19T00:40:39.260" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25093" PostTypeId="1" CreationDate="2022-09-05T01:09:21.130" Score="1" ViewCount="65" Body="&lt;p&gt;&lt;em&gt;This is mostly specific to Vyxal, but I've worded the language so that any hypothetical stack language could utilise this&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Say you have a stack-based language which supports function objects on the stack.&lt;/p&gt;&#xA;&lt;p&gt;And say that there's no way to take function objects on STDIN - they have to be placed in the header.&lt;/p&gt;&#xA;&lt;p&gt;But say that there's a way to add function objects to STDIN via a built-in - it takes a function as its argument and injects it into where STDIN is coming from.&lt;/p&gt;&#xA;&lt;p&gt;Is this a valid black-box function input format for challenges that require functions as input?&lt;/p&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2022-09-05T03:42:28.133" Title="Can Function Objects be Appened to STDIN From the Stack?" Tags="|discussion|policy|code-golf|defaults|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25094" PostTypeId="2" ParentId="25093" CreationDate="2022-09-05T01:16:43.960" Score="-3" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;As the function is in the header anyway, appending it to STDIN is basically just turning the header field into an alternative input field.&lt;/p&gt;&#xA;&lt;p&gt;Only functions should be given in this way - strings, lists and numbers should all be taken in original STDIN.&lt;/p&gt;&#xA;&lt;p&gt;This helps languages which otherwise have to add boilerplate bytes to their code to even come close to enjoying the benefits of things like implicit input, input cycling and more.&lt;/p&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2022-09-05T01:16:43.960" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25095" PostTypeId="2" ParentId="25093" CreationDate="2022-09-05T01:21:11.157" Score="0" Body="&lt;h1&gt;Yes, but you must count the code to append to STDIN&lt;/h1&gt;&#xA;&lt;p&gt;This seems like the most consistent method with our existing rules. Given that languages can already assume function objects to be pre-defined/on the stack, I don't think it is necessary, or potentially even fair, to allow such languages to ignore the code required to transform the input from one format into an &amp;quot;easier to use&amp;quot; format.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-09-05T01:21:11.157" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25096" PostTypeId="2" ParentId="25093" CreationDate="2022-09-05T03:42:28.133" Score="1" Body="&lt;h1&gt;A Hard &amp;quot;Maybe&amp;quot;&lt;/h1&gt;&#xA;&lt;p&gt;There are two cases here, namely a function submission and a program submission. For both, it's important to make a distinction between the actual STDIN stream provided to the program and the &amp;quot;internal STDIN&amp;quot;/logical input list which the program can manipulate.&lt;/p&gt;&#xA;&lt;h2&gt;Program submission: No&lt;/h2&gt;&#xA;&lt;p&gt;This would be equivalent to taking input through direct source code insertion. If it is impossible to input a function through the real STDIN to the program, that's that.&lt;/p&gt;&#xA;&lt;h2&gt;Function submission: Depends&lt;/h2&gt;&#xA;&lt;p&gt;The issue with function submissions is that they have to be &lt;em&gt;reusable&lt;/em&gt;. A function that can be run once has to be able to run twice. This excludes them from using program styles of input for various reasons which I intuitively understand but can't put into words too well, but in the case of an &amp;quot;internal STDIN&amp;quot; input list which is really just a piece of global state which the program &lt;em&gt;can&lt;/em&gt; manipulate, it &lt;em&gt;might&lt;/em&gt; be permissible--but I'm tempted to say it's tantamount to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13713/85334&quot;&gt;taking them under a predetermined name when passing directly is possible&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="85334" LastActivityDate="2022-09-05T03:42:28.133" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25097" PostTypeId="2" ParentId="2140" CreationDate="2022-09-05T13:58:47.030" Score="1" Body="&lt;h1&gt;Render a triangle in vulkan&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/vulcan&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;vulcan&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;vulcan-container&quot;&gt;vulcan&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://registry.khronos.org/vulkan/specs/1.3-extensions/html/&quot; rel=&quot;nofollow noreferrer&quot;&gt;vulkan API&lt;/a&gt; is famous for requiring graphic engines to be very verbose (usually at least 1000 lines of code for a basic result). I am curious to see how far we can escape this trend.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Using vulkan and no other rendering API, have a triangle rendered to screen with a color pattern as seen in this image:&#xA;&lt;img src=&quot;https://vulkan-tutorial.com/images/triangle.png&quot; alt=&quot;vulkan triangle&quot; /&gt;&#xA;For rendering to screen, some extensions are needed. You should use the minimal number of extensions and layers necessary.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Points&lt;/strong&gt; are counted as the number of bytes of the program file plus number of bytes of shader files if needed.&lt;/p&gt;&#xA;&lt;p&gt;You can take whatever shortcuts you want as long as it runs on your machine. You should provide a screenshot of the result as a minimal kind of proof.&lt;/p&gt;&#xA;&lt;h2&gt;Hints&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;As a reference implementation you can check the &lt;a href=&quot;https://vulkan-tutorial.com/Drawing_a_triangle/Drawing/Rendering_and_presentation&quot; rel=&quot;nofollow noreferrer&quot;&gt;vulkan tutorial&lt;/a&gt;. The code of &lt;code&gt;15_hello_triangle.cpp&lt;/code&gt; is 34536 bytes, and it uses two shaders of 389 and 158 for a total of 35 083 bytes. The c++ code is contained in a single file but this is far to be an optimal solution.&lt;/li&gt;&#xA;&lt;li&gt;You can assert the running machine will be yours and skip all the property checks for devices, queues etc.&lt;/li&gt;&#xA;&lt;li&gt;Well known window creation libraries such as &lt;a href=&quot;https://github.com/glfw/glfw&quot; rel=&quot;nofollow noreferrer&quot;&gt;GLFW&lt;/a&gt; or SDL are authorized.&lt;/li&gt;&#xA;&lt;li&gt;You can use existing &lt;a href=&quot;https://www.vulkan.org/tools#language-bindings&quot; rel=&quot;nofollow noreferrer&quot;&gt;Language bindings&lt;/a&gt; to provide a solution in you favorite language.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="112849" LastEditorUserId="112849" LastEditDate="2022-09-05T15:07:15.183" LastActivityDate="2022-09-05T15:07:15.183" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25098" PostTypeId="1" CreationDate="2022-09-06T12:39:14.067" Score="9" ViewCount="298" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/25078/event-proposal-cgcc-langjam?cb=1&quot;&gt;We have decided&lt;/a&gt; to do the CGCC Langjam event! This will be a two-week competition in which participants must create a golfing language in a specific paradigm and use it to solve a series of code golf challenges. This meta post will be used for figuring out the details of the event.&lt;/p&gt;&#xA;&lt;h2&gt;Timing and Event Flow&lt;/h2&gt;&#xA;&lt;p&gt;The event will be two weeks long, and probably start next week if all goes according to plan (September 11th, 2022). We're not sure if the event should occur once a year or twice a year yet. After the competition has ended, participants will post an answer to another meta question with information about their languages. Then, the three observerdesignermoderators will select a number of challenges from CGCC for the languages to compete in. The language with the lowest total byte count wins! (There will probably also be other prizes for, say, &amp;quot;most unique idea&amp;quot;.)&lt;/p&gt;&#xA;&lt;h3&gt;What are the prizes?&lt;/h3&gt;&#xA;&lt;p&gt;Rep bounties and bragging rights.&lt;/p&gt;&#xA;&lt;h3&gt;How do I compete?&lt;/h3&gt;&#xA;&lt;p&gt;Anyone can compete in the Langjam! Just make your language according to the rules, and submit it by answering the relevant meta post at the end of the two weeks.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;Currently, there are three rules:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Work on the language &lt;em&gt;cannot&lt;/em&gt; start before the beginning of the competition&lt;/li&gt;&#xA;&lt;li&gt;The language's interpreter or compiler must be available online, preferably on GitHub or a Gist&lt;/li&gt;&#xA;&lt;li&gt;Languages must not be trivial derivatives of existing languages&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;To propose a new rule, simply answer this question.&lt;/p&gt;&#xA;&lt;h2&gt;Paradigm&lt;/h2&gt;&#xA;&lt;p&gt;Currently, there is no selected paradigm for languages to be made in. If you would like to propose a paradigm, answer this question. The paradigm with the most votes will be selected.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This event will be presided over by myself (Ginger), &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt;, and &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresu A&lt;/a&gt;. If you have any questions, simply ping any of us in the &lt;a href=&quot;https://chat.stackexchange.com/rooms/137998/cgcc-langjam&quot;&gt;dedicated chatroom&lt;/a&gt;. If you would like to propose a new rule, paradigm, or change to the event, post an answer to this question.&lt;/p&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2022-09-11T22:59:10.003" LastActivityDate="2022-09-26T13:22:05.600" Title="Event Refinement: CGCC Langjam" Tags="|discussion|langjam|" AnswerCount="7" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25099" PostTypeId="2" ParentId="25098" CreationDate="2022-09-06T12:54:04.077" Score="3" Body="&lt;h1&gt;Paradigm: Tape-Based&lt;/h1&gt;&#xA;&lt;p&gt;Y'know, like &lt;a href=&quot;https://esolangs.org/wiki/Brainfuck&quot; rel=&quot;nofollow noreferrer&quot;&gt;brainfuck&lt;/a&gt;. Except obviously we wouldn't make brainfuck clones.&lt;/p&gt;&#xA;" OwnerUserId="107310" LastActivityDate="2022-09-06T12:54:04.077" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25100" PostTypeId="2" ParentId="25098" CreationDate="2022-09-06T15:53:11.287" Score="7" Body="&lt;h1&gt;No &amp;quot;observerdesignermoderators&amp;quot;&lt;/h1&gt;&#xA;&lt;p&gt;To me it doesn't really make sense to make it so that three people interested in the event can't participate. The &amp;quot;observer&amp;quot; part doesn't really seem necessary for a publically visible event, the &amp;quot;designer&amp;quot; part is now all of our responsibility thanks to this meta post, and the &amp;quot;moderator&amp;quot; part can be done with up/downvotes and the typical flag-if-invalid.&lt;/p&gt;&#xA;&lt;p&gt;As for picking challenges, we could always do something like &amp;quot;every contestant includes a hash of a list of two or three challenges in their post&amp;quot;, and once the event is over, we'd all publish our lists and . While everyone would know a few of the challenges, since they'd pick them, optimizing for them wouldn't do much good.&lt;/p&gt;&#xA;&lt;p&gt;Maybe there's a few people willing to do it this time around, but I'm worried finding three people both interested in the event and okay with not doing it could be a barrier to getting this event started in the future, especially when such a role is almost entirely unnecessary.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-09-06T15:53:11.287" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25101" PostTypeId="2" ParentId="25098" CreationDate="2022-09-06T15:58:39.167" Score="7" Body="&lt;h1&gt;Paradigm: 2-Dimensional&lt;/h1&gt;&#xA;&lt;p&gt;There are quite a few 2D languages, but not a lot of 2D golfing languages. While I don't expect a 2D language to be able to compete with the best 1D golfing languages, I think there are some interesting possibilities for making 2D languages golfier.&lt;/p&gt;&#xA;" OwnerUserId="16766" LastActivityDate="2022-09-06T15:58:39.167" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25102" PostTypeId="2" ParentId="25098" CreationDate="2022-09-07T03:48:53.903" Score="4" Body="&lt;h1&gt;Participants should choose questions&lt;/h1&gt;&#xA;&lt;p&gt;This post has the intention of refining the 'No &amp;quot;Observerdesignermoderator&amp;quot;' idea by proposing concrete rules for selecting questions via participants, and has much of the same motivations as that post.&lt;/p&gt;&#xA;&lt;p&gt;Instead of having the odms or some other third-party pick questions, they should be picked by the challenge participants. When a language is submitted, the sha256 hashes of up to two question URLs* should also be submitted as part of the same post. The participant must then reveal the URL to the question within 24 hours after submissions close. For a question to be eligible, at the time of posting, it must be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, have a score greater than zero, have at least three answers, have no language restrictions, and its URL's hash must match the one in the submission post. Additionally, the question must remain open for the duration of the Jam and have been posted before the Jam begins. Failure of a question to meet any of the validity constraints results in the question not counting toward scoring.&lt;/p&gt;&#xA;&lt;p&gt;In the meta post for submissions, there should be a brief section containing a snack snippet to calculate the sha256 hash of a given input, as well as a warning about common pitfalls (think trailing whitespace/query strings).&lt;/p&gt;&#xA;&lt;h2&gt;Clarifications&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Nothing requires participants to submit questions&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There are no penalties for the participant if a question they submit is rejected&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Users can nominate their own questions, should they choose to do so&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;*For example, the question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/200306/scream-very-loudly&quot;&gt;Scream Very Loudly&lt;/a&gt; has a URL of &lt;code&gt;https://codegolf.stackexchange.com/questions/200306/scream-very-loudly&lt;/code&gt; which has a sha256 hash of &lt;code&gt;dd5ef66e6bc89a00f11e2d9d27f0d126cef4ac3b79e7e7f78c460070540f73f6&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="97691" LastEditorUserId="107299" LastEditDate="2022-09-26T13:22:05.600" LastActivityDate="2022-09-26T13:22:05.600" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25103" PostTypeId="2" ParentId="5243" CreationDate="2022-09-07T10:19:40.617" Score="6" Body="&lt;h1&gt;500 rep for the first engineered pattern in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/251510/live-a-longer-life/&quot;&gt;Live a longer life&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Currently, all the answers to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/251510/live-a-longer-life/&quot;&gt;Live a longer life&lt;/a&gt;, except the first few ones, are either found by soup search, or is a predecessor of other answers. They are discovered instead of constructed.&lt;/p&gt;&#xA;&lt;p&gt;I offer 500 rep for the first answer with an engineered pattern. This mean that the pattern should be constructed from small parts and make use of the reactions between the parts. Some examples of engineered patterns can be found &lt;a href=&quot;https://conwaylife.com/wiki/Engineered_diehard&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="9288" LastEditorUserId="9288" LastEditDate="2023-10-11T15:20:55.397" LastActivityDate="2023-10-11T15:20:55.397" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25105" PostTypeId="2" ParentId="2140" CreationDate="2022-09-07T11:23:59.093" Score="-2" Body="&lt;h1&gt; Robotics competition&lt;/h1&gt;&#xA;&lt;p&gt;You're entering a robotics competition! There are 3 types of parts for you to choose for your robot: wheels, legs and sensors. A robot:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;can have up to 8 parts in total&lt;/li&gt;&#xA;&lt;li&gt;can only have 4 legs&lt;/li&gt;&#xA;&lt;li&gt;must have at least 2 parts&lt;/li&gt;&#xA;&lt;li&gt;must have at least one leg or one wheel&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You can't decide what robot to build, so you'll just make all of the possible ones. How many robots will you build?&lt;/p&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a program which calculates the number of possible robots (the answer is 134). Shortest program wins.&lt;/p&gt;&#xA;&lt;p&gt;The output of your program &lt;strong&gt;can&lt;/strong&gt; be its return code. The program needn't take any input (undefined behaviour if input is provided).&lt;/p&gt;&#xA;&lt;p&gt;Bonus swag points for a point-free solution in APL &lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;A non-competitive python example:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;from itertools import chain, combinations_with_replacement&#xA;&#xA;options = list(filter(&#xA;    lambda option: \&#xA;        len(option) &amp;gt;= 2 and \&#xA;        option.count('leg') &amp;lt;= 4 and \&#xA;        (option.count('leg') + option.count('wheel') &amp;gt; 0),&#xA;    chain(*(combinations_with_replacement(('leg', 'wheel', 'sensor'), j) for j in range(9)))&#xA;))&#xA;&#xA;for option in options:&#xA;    print(option)&#xA;print(&amp;quot;Number of valid options: {}&amp;quot;.format(len(options)))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;META&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the question original enough, or has there been any challenges like this&lt;/li&gt;&#xA;&lt;li&gt;Is the python example a useful thing to include?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="68200" LastActivityDate="2022-09-07T11:23:59.093" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25106" PostTypeId="2" ParentId="25098" CreationDate="2022-09-07T14:26:02.777" Score="-1" Body="&lt;h1&gt;Should we use CMCs?&lt;/h1&gt;&#xA;&lt;p&gt;When I came up with this event, I planned for the ODMs to choose a selection of CGCC's best challenges and have the languages be used to answer those. But, lyxal proposed another idea: CMCs. lyxal would use Codex to generate a bunch of AICMCs, which myself and emanresu A would look through to find the best ones to challenge the languages with. Should we do this or go the Greatest Hits route?&lt;/p&gt;&#xA;" OwnerUserId="108218" LastActivityDate="2022-09-07T14:26:02.777" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25108" PostTypeId="2" ParentId="2140" CreationDate="2022-09-09T08:53:36.167" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251864/re-name-all-identifiers-to-a-single-letter&quot;&gt;Re-Name all identifiers to a single letter&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2022-09-12T13:54:45.913" LastActivityDate="2022-09-12T13:54:45.913" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="25109" PostTypeId="2" ParentId="2140" CreationDate="2022-09-09T10:01:48.983" Score="-1" Body="&lt;p&gt;&lt;strong&gt;find overlap between 2 grids&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;You have 2 grids with numbers inside, and you want to find the overlapping parts.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;For example&lt;/strong&gt; &lt;br&gt;&#xA;The firdst grid&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3 4&#xA;1 2 3 4&#xA;1 2 3 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The second grid&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2 3 4 1&#xA;2 3 4 2&#xA;9 8 6 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This part is the overlapping part:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2 3 4&#xA;2 3 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And when you combine, you sould get this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3 4&#xA;1 2 3 4 1&#xA;1 2 3 4 2&#xA;  9 8 6 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The grids are minimum 2*2 and MUST be a rectangle or a square.&lt;/li&gt;&#xA;&lt;li&gt;The input can be the size of the grids (and random generated content), or the content of the grids itself (your choice)&lt;/li&gt;&#xA;&lt;li&gt;The output can be visual just like my example or sommerhing else (but explain how to read it).&lt;/li&gt;&#xA;&lt;li&gt;If there is no overlap you output what you want but it needs to be clear.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;goal&lt;/strong&gt;&#xA;It is code golf so the byte size is important.&lt;/p&gt;&#xA;" OwnerUserId="113952" LastEditorUserId="113952" LastEditDate="2022-09-09T12:00:55.400" LastActivityDate="2022-09-09T12:00:55.400" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="25112" PostTypeId="1" CreationDate="2022-09-12T11:47:47.703" Score="8" ViewCount="308" Body="&lt;p&gt;This stems from JoKing's answer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/66193/sums-of-consecutive-integers/251645#251645&quot;&gt;Sums of Consecutive Integers&lt;/a&gt;, where it can be seen that the predicate always unifies &lt;code&gt;Z&lt;/code&gt; with the correct answer first.&lt;/p&gt;&#xA;&lt;p&gt;However, checking for all values, we see that it unifies &lt;code&gt;Z&lt;/code&gt; with all shorter solutions after finding the longest solution: &lt;a href=&quot;https://tio.run/##KyjKz8lP1y0uz/z/3087yko3rzQ3J7O4RMNQx0/HUVMnsaAgNS9FIzpeJ0onPhYkUgxVEKXjp6n3/7@ltqMelzUYcllA2FxmMDEuI1OENAA&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Prolog (SWI) – Try It Online&quot;&gt;Try it online!&lt;/a&gt;. Can this be allowed?&lt;/p&gt;&#xA;" OwnerUserId="80214" LastActivityDate="2022-09-17T15:37:02.243" Title="Can a Prolog predicate have multiple choice points if it always chooses the correct solution first?" Tags="|discussion|" AnswerCount="5" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25113" PostTypeId="2" ParentId="25112" CreationDate="2022-09-12T12:20:07.433" Score="6" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;In my experience, even legitimate (i.e. not for code golf) Prolog predicates often have extraneous choice points that you don’t need. Getting rid of them is not always easy, especially if you want to keep your code &amp;quot;pure&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;Of course you can add cuts &lt;code&gt;!&lt;/code&gt; after calling your predicate. A cleaner solution is to wrap your predicate call in &lt;a href=&quot;https://www.swi-prolog.org/pldoc/man?predicate=once/1&quot; rel=&quot;nofollow noreferrer&quot;&gt;once/1&lt;/a&gt;, which will make your predicate succeed at most once.&lt;/p&gt;&#xA;&lt;p&gt;I don’t see the point in imposing such additions to answers, as they add no substance to golfing. In fact, if we were to impose discarding extraneous choice points, we might discourage alternative solutions that take shortcuts to get the right answer, at the expanse of extraneous or even &amp;quot;wrong&amp;quot; additional choice points. In my opinion we should actually encourage those approaches.&lt;/p&gt;&#xA;&lt;h3&gt;Historically accepted&lt;/h3&gt;&#xA;&lt;p&gt;I have never seen a Prolog answer’s validity be rejected based on the additional choice points it created.&lt;/p&gt;&#xA;&lt;p&gt;Note that the same applies to Brachylog: other choice points can be queried with meta-predicates, failure loops, or Prolog’s REPL. Answers with extraneous choice points have never been debated either.&lt;/p&gt;&#xA;" OwnerUserId="41723" LastActivityDate="2022-09-12T12:20:07.433" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25114" PostTypeId="2" ParentId="25112" CreationDate="2022-09-12T13:34:36.447" Score="0" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;Despite legitimate Prolog predicates having extraneous choice points, they have more reason to leave those choice points in (generality, for example).&lt;/p&gt;&#xA;&lt;p&gt;Prolog answers have been allowed to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/9027/80214&quot;&gt;output variables that can assume multiple values&lt;/a&gt;. This is treated akin to returning a list of the required outputs. With this in mind, if a predicate unifies a variable with more than one value, and the requirement is a single, distinct value, returning all solutions like in the mentioned answer is invalid. Wrong answers should not be encouraged.&lt;/p&gt;&#xA;&lt;p&gt;Even despite the acceptance of previous Prolog and Brachylog answers, it is wrong to allow answers to sacrifice correctness for cleverness. There can still be clever Prolog answers within this restriction, it will just need a few extra bytes for a cut or a &lt;code&gt;once&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The historic acceptance of multiple choice points in cases where there should be a single answer produced is a problem, and the lack of discussion regarding it is not a point of merit toward this matter.&lt;/p&gt;&#xA;" OwnerUserId="80214" LastActivityDate="2022-09-12T13:34:36.447" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25115" PostTypeId="2" ParentId="25112" CreationDate="2022-09-12T15:20:09.327" Score="6" Body="&lt;h1&gt;Prolog isn't the only logic language&lt;/h1&gt;&#xA;&lt;p&gt;Curry, which was &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24640/language-of-the-month-for-april-2022-curry&quot;&gt;the language of the month back in April&lt;/a&gt;, is also a logic language to which any consensus here would apply.&lt;/p&gt;&#xA;&lt;h2&gt;Curry&lt;/h2&gt;&#xA;&lt;p&gt;If we look at Curry we can see that golfers are already operating under the assumption that you must return only correct answers.  Here are two examples:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/245946&quot;&gt;1&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/a/245858&quot;&gt;2&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;While these are examples where the difference is small, this is not, in general, the case.  Curry doesn't have Prolog's cut operator, so an answer that meets the relaxed standard cannot be trivially modified to meet the strict standard.  Sometimes you just have to rework it.&lt;/p&gt;&#xA;&lt;p&gt;Curry KiCS2 has a specific flag you can pass it which takes the first path. Alephalpha points to a few answers that explicitly use this flag:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/249800&quot;&gt;1&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/a/249240&quot;&gt;2&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;These answers clearly state the use of the flag and are marked as solutions in the language &amp;quot;Curry (KICS2) + &lt;code&gt;:set +first&lt;/code&gt;&amp;quot;.&#xA;So it certainly seems like we have been operating under the assumption that answers must only return the correct answer in Curry.&lt;/p&gt;&#xA;&lt;p&gt;And that's great for Curry, because half the time the answer that meets the relaxed standard is just the Haskell answer.  Haskell is very similar to Curry in many ways, but it doesn't have non-determinism.  It just follows the first path without backtracking.  Often a Haskell answer will find the right answer in Curry, but have a lot of extraneous paths. Requiring cleanup is one of the things that makes Curry golf unique and sets it apart from Haskell.&lt;/p&gt;&#xA;&lt;p&gt;In the examples where it's not the same as Haskell it is still possible to post it, &lt;em&gt;but&lt;/em&gt; it goes in it's own special category. That seems best because really neither answer is necessarily better or more interesting.  It really ought to go in it's own category.&lt;/p&gt;&#xA;&lt;p&gt;Taking this all together it seems like the current requirements are good for Curry golf, they allow diversity and creativity in Curry golf.  And it's not a surprise that Curry golfers have defaulted to this behavior.&lt;/p&gt;&#xA;&lt;h2&gt;Back to Prolog&lt;/h2&gt;&#xA;&lt;p&gt;I think Fatalize is right about how this affects Prolog.  Most often getting the first answer to be the only answer just means inserting a cut in the right place to get a single solution. Which is a minor annoyance. It doesn't make a big difference.&lt;/p&gt;&#xA;&lt;p&gt;This doesn't exactly paint a clear picture for me either way.  It seems like Prolog golf will remain much the same going down either path.&lt;/p&gt;&#xA;&lt;p&gt;As a Prolog golfer and a Curry golfer myself I can say that when looking holistically at both, it's clear that the requirement of only outputting the correct answer is worth it overall.&lt;/p&gt;&#xA;&lt;p&gt;There are of course other logic programming languages not discussed here.  I think Brachylog is the most popular one on the site.  I encourage programmers and golfers in those to share how this would affect golf in their language.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-09-13T14:31:43.803" LastActivityDate="2022-09-13T14:31:43.803" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25116" PostTypeId="2" ParentId="2140" CreationDate="2022-09-13T05:02:18.577" Score="7" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/252057/78410&quot;&gt;Numbers vs. Strings: Language fitness challenge&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-09-20T00:03:09.783" LastActivityDate="2022-09-20T00:03:09.783" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="25117" PostTypeId="2" ParentId="2140" CreationDate="2022-09-13T10:58:01.467" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251919/calculate-pi-unto-a-point-using-the-nilakantha-series&quot;&gt;Calculate Pi unto a Point using the Nilakantha series&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110681" LastEditorUserId="110681" LastEditDate="2022-09-15T13:04:58.037" LastActivityDate="2022-09-15T13:04:58.037" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25118" PostTypeId="2" ParentId="25112" CreationDate="2022-09-13T18:33:36.233" Score="4" Body="&lt;h1&gt;It depends&lt;/h1&gt;&#xA;&lt;p&gt;After reading everyone's arguments, I think &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25115/16766&quot;&gt;Wheat Wizard's answer&lt;/a&gt; makes sense. This is a concurring opinion that looks at things from a Brachylog perspective.&lt;/p&gt;&#xA;&lt;h2&gt;Predicates and unification&lt;/h2&gt;&#xA;&lt;p&gt;Like in Prolog, a Brachylog predicate typically produces output by unifying a variable with some number of values, one after another. This type of output is considered to be a &amp;quot;generator&amp;quot; in our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10753/16766&quot;&gt;default I/O methods&lt;/a&gt;. For challenges that ask for a list, I and others have written Brachylog predicates that unify a variable with the first element, then the second element, and so on.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;I don't think we should try to have our cake and eat it too.&lt;/strong&gt; If unification creates a generator, and a generator is equivalent to a list, then a generator cannot also be equivalent to a single value whenever it's convenient to treat it that way. We should either use &lt;code&gt;findall&lt;/code&gt; when we want multiple values, or cut when we want a single value. Since there's already a consensus that unification means multiple values, let's stick with that.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;To return a single value from a predicate by unification, we should make sure the predicate only returns one value and then stops.&lt;/strong&gt; (If we think of unification as a generator, this is equivalent to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11884/16766&quot;&gt;returning a value in a singleton list&lt;/a&gt;.)&lt;/p&gt;&#xA;&lt;h2&gt;Full programs&lt;/h2&gt;&#xA;&lt;p&gt;As I said in a comment, I don't think the same rules should apply if a submission is a full program rather than just a predicate. &lt;strong&gt;A full program that takes input, produces output, and halts should be judged on the actual output it produces.&lt;/strong&gt; The fact that a Brachylog program is often a single predicate, and the fact that the predicate &lt;em&gt;could&lt;/em&gt; have produced more results if it were called multiple times, is irrelevant in this case.&lt;/p&gt;&#xA;&lt;p&gt;However, there are some caveats:&lt;/p&gt;&#xA;&lt;p&gt;First, in Prolog, it's possible to run a program in such a way that it produces one output and then waits for the user to indicate whether they want more or not. This should &lt;em&gt;not&lt;/em&gt; count as producing a single output; it is analogous to the generator case. That's why I included &amp;quot;and halts&amp;quot; in my full-program description above. If there is a flag that makes the program output the first result and halt, like Curry has, then that's fine.&lt;/p&gt;&#xA;&lt;p&gt;Second, most Brachylog solutions &lt;em&gt;are not full programs&lt;/em&gt;. I was a bit surprised to realize this, but reading through &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11909/16766&quot;&gt;this comprehensive answer&lt;/a&gt;, it makes sense. TL;DR: If you pass an input to a Brachylog program and it prints &lt;code&gt;42&lt;/code&gt; to stdout, that's a full program that outputs 42. If you pass an input and a variable name &lt;code&gt;X&lt;/code&gt; to a Brachylog program and it prints &lt;code&gt;X = 42&lt;/code&gt; to stdout, that's &lt;em&gt;not&lt;/em&gt; a full program that outputs 42; it's a predicate that returns 42.&lt;/p&gt;&#xA;&lt;p&gt;The same reasoning applies to the Prolog answer that led to this meta discussion: its input is &lt;code&gt;9+A.&lt;/code&gt;, and its output is &lt;code&gt;A = [2, 3, 4]&lt;/code&gt;. That's not a full program solution, it's a predicate solution. It could be made into a full program if it read input from stdin and wrote output to stdout, but of course that would cost more bytes.&lt;/p&gt;&#xA;&lt;h2&gt;Predicates and writing to stdout&lt;/h2&gt;&#xA;&lt;p&gt;Here's where it gets tricky: we allow &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2457/16766&quot;&gt;functions to output to stdout&lt;/a&gt;. What should be done with a predicate that outputs to stdout? Maybe if it were called more than once, it would output more than one thing. Do we consider its output to be what it prints when it's called the first time, or what it prints when it's called until it fails? I'm not sure.&lt;/p&gt;&#xA;&lt;p&gt;This is somewhat analogous to printing within a generator expression in a language like Python, except that in Python, you won't get any output if you return the generator untouched, whereas in Prolog and Brachylog, you'll get the first pass of output.&lt;/p&gt;&#xA;&lt;p&gt;(Again, note that &lt;em&gt;if we're talking full-program&lt;/em&gt;, the output should be whatever the program outputs, which is probably going to be the result of calling the predicate once.)&lt;/p&gt;&#xA;" OwnerUserId="16766" LastActivityDate="2022-09-13T18:33:36.233" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25120" PostTypeId="2" ParentId="2140" CreationDate="2022-09-16T13:01:07.473" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/252030/calculating-pi-using-the-gregory-leibniz-series-until-a-term&quot;&gt;&lt;h1&gt;Calculating Pi using the Gregory-Leibniz series unto a point&lt;/h1&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="110681" LastEditorUserId="110681" LastEditDate="2022-09-19T12:48:23.077" LastActivityDate="2022-09-19T12:48:23.077" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25122" PostTypeId="2" ParentId="25098" CreationDate="2022-09-16T17:11:01.727" Score="2" Body="&lt;h2&gt;Challenges should &lt;em&gt;not&lt;/em&gt; be restricted to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; only&lt;/h2&gt;&#xA;&lt;p&gt;Controversial, I know.&lt;/p&gt;&#xA;&lt;p&gt;Golfing languages seem to tend towards very similar structures, one byte builtins, etc. Having a variety of different challenge types to consider may promote variety in the languages we see come out of this.&lt;/p&gt;&#xA;" OwnerUserId="107310" LastActivityDate="2022-09-16T17:11:01.727" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25123" PostTypeId="2" ParentId="2140" CreationDate="2022-09-17T04:58:36.160" Score="1" Body="&lt;h1&gt;Title&lt;/h1&gt;&#xA;&lt;p&gt;God Save the Queen (or King)!&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;A calendar year from 927 to the present year. For example 2022.&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;You can use any three distinguishable outputs.  As an example,&lt;/p&gt;&#xA;&lt;p&gt;“K” (short for King)&lt;/p&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;p&gt;“Q” (short for Queen)&lt;/p&gt;&#xA;&lt;p&gt;depending on which was right in England in that year.  If there was both a King and Queen in that year you can output either.&lt;/p&gt;&#xA;&lt;p&gt;If there was no King or Queen for the whole of that year, your code must output something that is not one of those two messages.&lt;/p&gt;&#xA;&lt;h1&gt;Dates&lt;/h1&gt;&#xA;&lt;p&gt;Kings: 937-1553, 1603-1649, 1660-1702, 1714-1837, 1901-1952, 2022&lt;/p&gt;&#xA;&lt;p&gt;Queens: 1553-1603, 1689-1694, 1702-1714, 1837-1901, 1952-2022&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerDisplayName="user108721" LastEditorDisplayName="user108721" LastEditDate="2022-09-17T17:26:52.520" LastActivityDate="2022-09-17T17:26:52.520" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="25124" PostTypeId="2" ParentId="25112" CreationDate="2022-09-17T15:37:02.243" Score="-1" Body="&lt;h1&gt;A thought&lt;/h1&gt;&#xA;&lt;p&gt;I don't really know much about Prolog/logic languages, but this seems to me like kinda a loophole. Similar to outputting &lt;code&gt;[true, false]&lt;/code&gt; in a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;decision-problem-container&quot;&gt;decision-problem&lt;/a&gt; and saying that &amp;quot;one of those is correct.&amp;quot;&lt;/p&gt;&#xA;" OwnerUserId="107299" LastActivityDate="2022-09-17T15:37:02.243" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25125" PostTypeId="2" ParentId="18751" CreationDate="2022-09-18T06:26:20.327" Score="9" Body="&lt;h1&gt;It's OK to edit a post when the post author explicity allowed this type of edit&lt;/h1&gt;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A KOTH challenge can state bot authors may edit the leader-board themselves when adding or modifying bots after the challenge has closed.&lt;/li&gt;&#xA;&lt;li&gt;Challenge might offer a bounty for a specific extra challenge and request the bounty offer be crossed out when someone completes it.&lt;/li&gt;&#xA;&lt;li&gt;A answer chaining question that allows edits might include a link to the latest post and request new posters to update this link themselves. Not saying this is a good idea but if OP asks this making the edit would be OK.&lt;/li&gt;&#xA;&lt;li&gt;If OP specifically asks a second person to keep a post up to date then all edits are OK if according to the agreed on parameters.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2022-09-18T06:26:20.327" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25126" PostTypeId="2" ParentId="2140" CreationDate="2022-09-18T11:15:47.963" Score="1" Body="&lt;h1&gt;Is there a area that can see the entire perimeter of a polygon &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;geometry-container&quot;&gt;geometry&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;decision-problem-container&quot;&gt;decision-problem&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Oh no, your despotic regime has too many political prisoners and not enough guards! Time for drastic measures: Only build prisons that require only a single guard. But there are many prison design and little time. How to check?&lt;/p&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a polygon, as a list of points, determine if there is a area (where the guard can stand) that can see the entire perimeter of the polygon.&lt;/p&gt;&#xA;&lt;p&gt;Any convex shape trivially qualifies:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/UTVFN.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/UTVFN.png&quot; alt=&quot;pentagon&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Some concave shapes qualify too:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/aGmra.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/aGmra.png&quot; alt=&quot;concave shape&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;But not all:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/7rJpm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/7rJpm.png&quot; alt=&quot;concave shape where there is no place for a guard&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Algorithm hint&lt;/h2&gt;&#xA;&lt;p&gt;The area where a guard can stand is the intersection of the areas on the inside of the tangent of every edge.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Image&lt;/th&gt;&#xA;&lt;th&gt;Points&lt;/th&gt;&#xA;&lt;th&gt;Outcome&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;/td&gt;&#xA;&lt;td&gt;TBD&lt;/td&gt;&#xA;&lt;td&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;" OwnerUserId="91213" LastActivityDate="2022-09-18T11:15:47.963" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25128" PostTypeId="1" CreationDate="2022-09-19T19:10:44.463" Score="20" ViewCount="303" Body="&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;The purpose of this thread was to collect questions for the questionnaire. The questionnaire is now live, and you may find it &lt;a href=&quot;https://codegolf.stackexchange.com/election/4#questionnaire&quot;&gt;here&lt;/a&gt;.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Code Golf Stack Exchange is scheduled for an election &lt;a href=&quot;https://codegolf.stackexchange.com/election/4&quot;&gt;next week, 2022-09-26&lt;/a&gt;. In connection with that, we will be holding a Q&amp;amp;A with the candidates. This will be an opportunity for members of the community to pose questions to the candidates on the topic of moderation.  Participation is completely voluntary.&lt;/p&gt;&#xA;&lt;p&gt;Here’s how it’ll work:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Until the nomination phase, (so, until 2022-09-26 at 20:00:00Z UTC, or 4:00 pm EDT on the same day, give or take time to arrive for closure), this question will be open to collect potential questions from the users of the site. Post answers to this question containing any questions you would like to ask the candidates. Please only post &lt;em&gt;one question per answer&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If your question contains a link, please use the syntax of &lt;code&gt;[text](link)&lt;/code&gt;, as that will make it easier for transcribing for the finished questionnaire.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is a perfect opportunity to voice questions that are specific to your community and issues that you are running into currently.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;We, the Community Team, will be providing a small selection of generic questions. The following two questions are guaranteed to be included:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How would you deal with a user who produced a steady stream of valuable answers, but tends to generate a large number of arguments/flags from comments?&lt;/li&gt;&#xA;&lt;li&gt;How would you handle a situation where another mod closed/deleted/etc. a question that you feel shouldn’t have been?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The community team may also include the following three questions if the community doesn’t supply enough questions.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;In your opinion, what do moderators do?&lt;/li&gt;&#xA;&lt;li&gt;A diamond will be attached to everything you say and have said in the past, including questions, answers and comments. Everything you will do will be seen under a different light. How do you feel about that?&lt;/li&gt;&#xA;&lt;li&gt;In what way do you feel that being a moderator will make you more effective as opposed to simply reaching 10k or 20k rep?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;At the start of the nomination phase, the Community Team will select &lt;strong&gt;up to 8 of the top voted questions submitted by the community&lt;/strong&gt; provided in this thread, to use in addition to the aforementioned 2 guaranteed questions. We reserve some editorial control in the selection of the questions and may opt not to select a question that is tangential or irrelevant to moderation or the election. We exclude any suggested questions that are negatively scored.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;We will post the final questionnaire on the &lt;a href=&quot;https://codegolf.stackexchange.com/election/4&quot;&gt;Election page&lt;/a&gt;. Candidates will have the option to fill out the questionnaire, and their answers will appear beneath their intro statements.&lt;/li&gt;&#xA;&lt;li&gt;This is not the only option that users have for gathering information on candidates. As a community, you are still free to, for example, hold a live chat session with your candidates to ask further questions, or perhaps clarifications from what is provided in the Q&amp;amp;A.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If you have any questions or feedback about this process, feel free to post as a comment here.&lt;/p&gt;&#xA;" OwnerUserId="78028" LastEditorUserId="-1" LastEditDate="2022-09-26T20:14:41.973" LastActivityDate="2022-09-26T20:14:41.973" Title="2022 Moderator Election Q&amp;A – Question Collection" Tags="|discussion|election|" AnswerCount="5" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25129" PostTypeId="2" ParentId="25128" CreationDate="2022-09-19T20:59:10.667" Score="19" Body="&lt;p&gt;A big part of moderation on this site is deleting invalid or non-competitive answers.  It easily makes up more than half of the total work that needs to be done. Since this is site specific, none of the default questions address it but it's important for potential moderators to understand what they are volunteering for and important for the community to know how they will handle such a duty.&lt;/p&gt;&#xA;&lt;h2&gt;An answer is flagged for being non-competitive.  It clearly took a lot of effort to make but it makes no attempt to meet the scoring criterion. What steps would you take as a moderator?&lt;/h2&gt;&#xA;&lt;p&gt;This is not a question about your opinions on such answers, but about how you plan to act as moderator.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-09-20T04:13:39.630" LastActivityDate="2022-09-20T04:13:39.630" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25130" PostTypeId="2" ParentId="2140" CreationDate="2022-09-19T22:14:02.250" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/252160/print-every-fools-mate/252161&quot;&gt;Print every Fool's Mate&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="11562" LastEditorUserId="11562" LastEditDate="2022-09-22T15:23:40.150" LastActivityDate="2022-09-22T15:23:40.150" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25131" PostTypeId="2" ParentId="25128" CreationDate="2022-09-20T00:49:10.907" Score="14" Body="&lt;p&gt;A not insignificant portion of the site's active users participate in &lt;a href=&quot;https://chat.stackexchange.com/?tab=site&amp;amp;host=codegolf.stackexchange.com&quot;&gt;chat&lt;/a&gt;, especially &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;. While we do have elected Room Owners for TNB, moderators have greater powers in chat than any other user, and are often looked to when resolving moderation disputes.&lt;/p&gt;&#xA;&lt;h2&gt;How active are you in chat, and how would you describe your approach to moderating a more informal setting than the site?&lt;/h2&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="56656" LastEditDate="2022-09-20T04:13:58.260" LastActivityDate="2022-09-20T04:13:58.260" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25132" PostTypeId="2" ParentId="2140" CreationDate="2022-09-20T17:19:35.717" Score="0" Body="&lt;h1&gt;Set of all sets &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;sequence-container&quot;&gt;sequence&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/set-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;set-theory&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;set-theory&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;set-theory-container&quot;&gt;set-theory&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/open-ended-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;open-ended-function-container&quot;&gt;open-ended-function&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Write a program or function which outputs all sets with a finite number of elements - but including sets that contain themselves (directly or indirectly).&lt;/p&gt;&#xA;&lt;p&gt;These recursive sets will be represented using a system similar to &lt;a href=&quot;https://en.wikipedia.org/wiki/De_Bruijn_index&quot; rel=&quot;nofollow noreferrer&quot;&gt;De Bruijn indices&lt;/a&gt;: an element of a set which is a reference to an outer enclosing set will be represented by a positive integer indicating how far &amp;quot;outside&amp;quot; that set is. For example, the set that contains itself, &lt;span class=&quot;math-container&quot;&gt;\$ s = \{s\} = \{\{\{\dots\}\}\} \$&lt;/span&gt;, is represented by &lt;code&gt;{1}&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Note that some of these representations are equivalent (represent the same actual set). For example, &lt;code&gt;{{2}}&lt;/code&gt; directly represents &lt;span class=&quot;math-container&quot;&gt;\$ s = \{\{s\}\} = \{\{\{\dots\}\}\} \$&lt;/span&gt;, but this is equal to &lt;span class=&quot;math-container&quot;&gt;\$ s = \{s\} \$&lt;/span&gt;, and so &lt;code&gt;{1}&lt;/code&gt; and &lt;code&gt;{{2}}&lt;/code&gt; (and &lt;code&gt;{{{3}}}&lt;/code&gt; etc.) are all equivalent.&lt;/p&gt;&#xA;&lt;p&gt;Here are a few more examples of this representation:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ s = \{\{\}, s\} = \{\{\},\{\{\},\{\{\},\dots\}\}\}\$&lt;/span&gt; = &lt;code&gt;{{}, 1}&lt;/code&gt; (or &lt;code&gt;{{}, {{}, 2}}&lt;/code&gt; etc.)&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ s = \{\{\{\}\}, \{s\}\} = \{\{\{\}\}, \{\{\{\{\}\}, \{\dots\}\}\}\} \$&lt;/span&gt; = &lt;code&gt;{{{}}, {2}}&lt;/code&gt; (or &lt;code&gt;{{{}}, {{{{}}, {4}}}}&lt;/code&gt; etc.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;Your sequence of sets may be in any order, as this is an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/open-ended-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;open-ended-function-container&quot;&gt;open-ended-function&lt;/a&gt; question. However, your sequence may never contain the same set more than once. (This includes the same set represented in different ways, e.g. &lt;code&gt;{1}&lt;/code&gt; and &lt;code&gt;{{2}}&lt;/code&gt;.)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;As with standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;sequence-container&quot;&gt;sequence&lt;/a&gt; challenges, you may choose to either:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take an input &lt;code&gt;n&lt;/code&gt; and output the &lt;code&gt;n&lt;/code&gt;th term of the sequence&lt;/li&gt;&#xA;&lt;li&gt;Take an input &lt;code&gt;n&lt;/code&gt;and output the first &lt;code&gt;n&lt;/code&gt; terms&lt;/li&gt;&#xA;&lt;li&gt;Output the sequence indefinitely, e.g. using a generator&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;You may use 0- or 1-indexing&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so the aim is to minimise your program's length in bytes&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I really don't think I've done a good job of explaining this challenge; please feel free to edit it to be clearer&lt;/li&gt;&#xA;&lt;li&gt;Does this representation have an existing name?&lt;/li&gt;&#xA;&lt;li&gt;Other potentially interesting challenges involving this representation could be: (Which of these would make for good challenges?)&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this representation fully simplified? (e.g. yes for &lt;code&gt;{1}&lt;/code&gt;, no for &lt;code&gt;{{2}}&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Simplify this representation (e.g. &lt;code&gt;{{2}}&lt;/code&gt; -&amp;gt; &lt;code&gt;{1}&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Do these two representations represent the same set? (e.g. &lt;code&gt;{1}&lt;/code&gt; = &lt;code&gt;{{2}}&lt;/code&gt;; &lt;code&gt;{{}}&lt;/code&gt; ≠ &lt;code&gt;{1}&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2022-09-20T17:26:49.607" LastActivityDate="2022-09-20T17:26:49.607" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25133" PostTypeId="2" ParentId="2140" CreationDate="2022-09-21T08:31:22.960" Score="2" Body="&lt;h1&gt;Generate a different sudoku&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sudoku&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sudoku&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sudoku&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;sudoku-container&quot;&gt;sudoku&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;grid-container&quot;&gt;grid&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/open-ended-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;open-ended-function-container&quot;&gt;open-ended-function&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Given a valid sudoku board, generate another sudoku board that isn't equivalent to the one inputted.&lt;/p&gt;&#xA;&lt;h3&gt;What do we consider as equivalent sudoku boards?&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;they are the same,&lt;/li&gt;&#xA;&lt;li&gt;the digits are relabeled (eg. 2&amp;lt;-&amp;gt;7 or 2-&amp;gt;5-&amp;gt;8-&amp;gt;2),&lt;/li&gt;&#xA;&lt;li&gt;three-column or thee-row bands are permuted,&lt;/li&gt;&#xA;&lt;li&gt;the rows or columns within a band are permuted,&lt;/li&gt;&#xA;&lt;li&gt;one is a reflection of the other (horizontally, vertically or along any of the diagonals),&lt;/li&gt;&#xA;&lt;li&gt;one is a rotation of the other,&lt;/li&gt;&#xA;&lt;li&gt;or any combination of the above.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;According to &lt;a href=&quot;http://www.afjarvis.staff.shef.ac.uk/sudoku/sudgroup.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ed Russell and Frazer Jarvis&lt;/a&gt; there are 5 472 730 538 essentially different sudoku classes.&lt;/p&gt;&#xA;&lt;h3&gt;What is a valid sudoku?&lt;/h3&gt;&#xA;&lt;p&gt;&lt;em&gt;(borrowed from &lt;a href=&quot;https://codegolf.stackexchange.com/q/78210/55372&quot;&gt;here&lt;/a&gt;)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Each row contains the digits from &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;9&lt;/code&gt; exactly once.&lt;/li&gt;&#xA;&lt;li&gt;Each column contains the digits from &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;9&lt;/code&gt; exactly once.&lt;/li&gt;&#xA;&lt;li&gt;Each of the nine 3x3 subgrids contains the digits from &lt;code&gt;1&lt;/code&gt; to &lt;code&gt;9&lt;/code&gt; exactly once.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;You may take input and output in any reasonable format, like a 9x9 matrix, list of rows/columns, a string of 81 digits etc.&lt;/p&gt;&#xA;&lt;p&gt;Taking digits &lt;code&gt;0-8&lt;/code&gt; instead of &lt;code&gt;1-9&lt;/code&gt; is allowed, but please be consistent.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA;7 2 5 8 9 3 4 6 1&#xA;8 4 1 6 5 7 3 9 2&#xA;3 9 6 1 4 2 7 5 8&#xA;4 7 3 5 1 6 8 2 9&#xA;1 6 8 4 2 9 5 3 7&#xA;9 5 2 3 7 8 1 4 6&#xA;2 3 4 7 6 1 9 8 5&#xA;6 8 7 9 3 5 2 1 4&#xA;5 1 9 2 8 4 6 7 3&#xA;Example output:&#xA;1 2 3 4 5 6 7 8 9 &#xA;4 5 6 7 8 9 1 2 3 &#xA;7 8 9 1 2 3 4 5 6 &#xA;2 3 1 5 6 4 8 9 7 &#xA;5 6 4 8 9 7 2 3 1&#xA;8 9 7 2 3 1 5 6 4 &#xA;3 1 2 6 4 5 9 7 8&#xA;6 4 5 9 7 8 3 1 2 &#xA;9 7 8 3 1 2 6 4 5&#xA;&#xA;Input:&#xA;&#xA;Example output:&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any mistakes in the test-cases?&lt;/li&gt;&#xA;&lt;li&gt;Is it sufficiently diffent to existing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sudoku&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sudoku&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sudoku&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;sudoku-container&quot;&gt;sudoku&lt;/a&gt; challenges?&lt;/li&gt;&#xA;&lt;li&gt;Is it better as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/open-ended-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;open-ended-function-container&quot;&gt;open-ended-function&lt;/a&gt; or a challenge to check whether two given grids are equivalent?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="55372" LastEditorUserId="55372" LastEditDate="2022-09-22T04:28:08.007" LastActivityDate="2022-09-22T04:28:08.007" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25136" PostTypeId="2" ParentId="2140" CreationDate="2022-09-21T16:16:07.893" Score="3" Body="&lt;h1&gt;Convert integer to IEEE 754 float&lt;/h1&gt;&#xA;&lt;p&gt;The task is simple, given a 32 bit integer, convert it to its floating point value as defined by the IEEE 754 (32-bit) standard.&lt;/p&gt;&#xA;&lt;h2&gt;IEEE 754&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://www.h-schmidt.net/FloatConverter/IEEE754.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;Here is a converter for your reference.&lt;/em&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Here is how the format looks:&#xA;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/thumb/d/d2/Float_example.svg/885px-Float_example.svg.png&quot; alt=&quot;&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;The standard is similar to scientific notation.&lt;/p&gt;&#xA;&lt;p&gt;The sign bit determines whether the output is negative or positive. If the bit is set, the number is negative otherwise it is positive.&lt;/p&gt;&#xA;&lt;p&gt;The exponent bit determines the exponent (base 2), it's value is offset by 127. Therefore the exponent is &lt;span class=&quot;math-container&quot;&gt;\$2^{n-127}\$&lt;/span&gt; where n is the integer representation of the exponent bits.&lt;/p&gt;&#xA;&lt;p&gt;The mantissa defines a floating point number in the range &lt;span class=&quot;math-container&quot;&gt;\$[1,2)\$&lt;/span&gt;. The way it represents the number is like binary, the most significant bit is &lt;span class=&quot;math-container&quot;&gt;\$\frac 1 2\$&lt;/span&gt;, the one to the right is &lt;span class=&quot;math-container&quot;&gt;\$\frac 1 4\$&lt;/span&gt;, the next one is &lt;span class=&quot;math-container&quot;&gt;\$\frac 1 8\$&lt;/span&gt; and so on... A one by default is added to the value.&lt;/p&gt;&#xA;&lt;p&gt;Now the final number is: &lt;span class=&quot;math-container&quot;&gt;$$\text{sign}\cdot 2^{\text{exponent}-127}\cdot \text{mantissa}$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;1078523331 -&amp;gt;   3.1400001049041748046875&#xA;1076719780 -&amp;gt;   2.71000003814697265625&#xA;1036831949 -&amp;gt;   0.100000001490116119384765625&#xA;3264511895 -&amp;gt; -74.24919891357421875&#xA;1056964608 -&amp;gt;   0.5&#xA;3205496832 -&amp;gt;  -0.5625&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For this challenge assume that cases like &lt;code&gt;NaN&lt;/code&gt; and &lt;code&gt;inf&lt;/code&gt; are not going to be the inputs, and subnormals need not be handled, and you may output &lt;code&gt;0&lt;/code&gt; for the case where the number represented is &lt;code&gt;-0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This is code-golf, so the shortest answer in bytes wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="103854" LastEditorUserId="103854" LastEditDate="2022-09-29T08:54:36.523" LastActivityDate="2022-09-29T08:54:36.523" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25137" PostTypeId="2" ParentId="2140" CreationDate="2022-09-22T10:56:45.210" Score="0" Body="&lt;p&gt;(Inspired by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25136/91213&quot;&gt;https://codegolf.meta.stackexchange.com/a/25136/91213&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;h1&gt;Quarter Precision Floating Point Numbers &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;We all love our floating point formats, floats and doubles. People who work in embedded may have used a even shorter format: The half precision floating point. However, what if you want a even smaller format? I present the &lt;strong&gt;quarter precision floating point number&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;It is defined like this:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1 bit: &lt;code&gt;s&lt;/code&gt; The sign. 1 is negative, 0 is positive.&lt;/li&gt;&#xA;&lt;li&gt;3 bits: &lt;code&gt;e&lt;/code&gt; The exponent -4. So &lt;code&gt;000&lt;/code&gt; is &lt;code&gt;2**-4&lt;/code&gt;, 100 is  &lt;code&gt;2**0&lt;/code&gt; and &lt;code&gt;111&lt;/code&gt; is &lt;code&gt;2**3&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;4 bits: &lt;code&gt;f&lt;/code&gt; The fraction f. A leading 1 bit is assumed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Overall formula is &lt;code&gt;(2-s*2)*2**(e-4)*f|16&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;There is no 0, infinity, -infinity, NaN, or any subnormals.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Your task is to produce a pair of programs, one to convert from quarters to floats and one to convert from floats to quarters. Your score is the sum of the length of both programs. Input will always be exactly representable.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;p&gt;These is a complete set of possible input values.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Quarters as:    Float Equivalent&#xA;bin      dec    &#xA;00000000 000    0.0625&#xA;00000001 001    0.06640625&#xA;00000010 002    0.0703125&#xA;00000011 003    0.07421875&#xA;00000100 004    0.078125&#xA;00000101 005    0.08203125&#xA;00000110 006    0.0859375&#xA;00000111 007    0.08984375&#xA;00001000 008    0.09375&#xA;00001001 009    0.09765625&#xA;00001010 010    0.1015625&#xA;00001011 011    0.10546875&#xA;00001100 012    0.109375&#xA;00001101 013    0.11328125&#xA;00001110 014    0.1171875&#xA;00001111 015    0.12109375&#xA;00010000 016    0.125&#xA;00010001 017    0.1328125&#xA;00010010 018    0.140625&#xA;00010011 019    0.1484375&#xA;00010100 020    0.15625&#xA;00010101 021    0.1640625&#xA;00010110 022    0.171875&#xA;00010111 023    0.1796875&#xA;00011000 024    0.1875&#xA;00011001 025    0.1953125&#xA;00011010 026    0.203125&#xA;00011011 027    0.2109375&#xA;00011100 028    0.21875&#xA;00011101 029    0.2265625&#xA;00011110 030    0.234375&#xA;00011111 031    0.2421875&#xA;00100000 032    0.25&#xA;00100001 033    0.265625&#xA;00100010 034    0.28125&#xA;00100011 035    0.296875&#xA;00100100 036    0.3125&#xA;00100101 037    0.328125&#xA;00100110 038    0.34375&#xA;00100111 039    0.359375&#xA;00101000 040    0.375&#xA;00101001 041    0.390625&#xA;00101010 042    0.40625&#xA;00101011 043    0.421875&#xA;00101100 044    0.4375&#xA;00101101 045    0.453125&#xA;00101110 046    0.46875&#xA;00101111 047    0.484375&#xA;00110000 048    0.5&#xA;00110001 049    0.53125&#xA;00110010 050    0.5625&#xA;00110011 051    0.59375&#xA;00110100 052    0.625&#xA;00110101 053    0.65625&#xA;00110110 054    0.6875&#xA;00110111 055    0.71875&#xA;00111000 056    0.75&#xA;00111001 057    0.78125&#xA;00111010 058    0.8125&#xA;00111011 059    0.84375&#xA;00111100 060    0.875&#xA;00111101 061    0.90625&#xA;00111110 062    0.9375&#xA;00111111 063    0.96875&#xA;01000000 064    1.0&#xA;01000001 065    1.0625&#xA;01000010 066    1.125&#xA;01000011 067    1.1875&#xA;01000100 068    1.25&#xA;01000101 069    1.3125&#xA;01000110 070    1.375&#xA;01000111 071    1.4375&#xA;01001000 072    1.5&#xA;01001001 073    1.5625&#xA;01001010 074    1.625&#xA;01001011 075    1.6875&#xA;01001100 076    1.75&#xA;01001101 077    1.8125&#xA;01001110 078    1.875&#xA;01001111 079    1.9375&#xA;01010000 080    2.0&#xA;01010001 081    2.125&#xA;01010010 082    2.25&#xA;01010011 083    2.375&#xA;01010100 084    2.5&#xA;01010101 085    2.625&#xA;01010110 086    2.75&#xA;01010111 087    2.875&#xA;01011000 088    3.0&#xA;01011001 089    3.125&#xA;01011010 090    3.25&#xA;01011011 091    3.375&#xA;01011100 092    3.5&#xA;01011101 093    3.625&#xA;01011110 094    3.75&#xA;01011111 095    3.875&#xA;01100000 096    4.0&#xA;01100001 097    4.25&#xA;01100010 098    4.5&#xA;01100011 099    4.75&#xA;01100100 100    5.0&#xA;01100101 101    5.25&#xA;01100110 102    5.5&#xA;01100111 103    5.75&#xA;01101000 104    6.0&#xA;01101001 105    6.25&#xA;01101010 106    6.5&#xA;01101011 107    6.75&#xA;01101100 108    7.0&#xA;01101101 109    7.25&#xA;01101110 110    7.5&#xA;01101111 111    7.75&#xA;01110000 112    8.0&#xA;01110001 113    8.5&#xA;01110010 114    9.0&#xA;01110011 115    9.5&#xA;01110100 116    10.0&#xA;01110101 117    10.5&#xA;01110110 118    11.0&#xA;01110111 119    11.5&#xA;01111000 120    12.0&#xA;01111001 121    12.5&#xA;01111010 122    13.0&#xA;01111011 123    13.5&#xA;01111100 124    14.0&#xA;01111101 125    14.5&#xA;01111110 126    15.0&#xA;01111111 127    15.5&#xA;10000000 128    -0.0625&#xA;10000001 129    -0.06640625&#xA;10000010 130    -0.0703125&#xA;10000011 131    -0.07421875&#xA;10000100 132    -0.078125&#xA;10000101 133    -0.08203125&#xA;10000110 134    -0.0859375&#xA;10000111 135    -0.08984375&#xA;10001000 136    -0.09375&#xA;10001001 137    -0.09765625&#xA;10001010 138    -0.1015625&#xA;10001011 139    -0.10546875&#xA;10001100 140    -0.109375&#xA;10001101 141    -0.11328125&#xA;10001110 142    -0.1171875&#xA;10001111 143    -0.12109375&#xA;10010000 144    -0.125&#xA;10010001 145    -0.1328125&#xA;10010010 146    -0.140625&#xA;10010011 147    -0.1484375&#xA;10010100 148    -0.15625&#xA;10010101 149    -0.1640625&#xA;10010110 150    -0.171875&#xA;10010111 151    -0.1796875&#xA;10011000 152    -0.1875&#xA;10011001 153    -0.1953125&#xA;10011010 154    -0.203125&#xA;10011011 155    -0.2109375&#xA;10011100 156    -0.21875&#xA;10011101 157    -0.2265625&#xA;10011110 158    -0.234375&#xA;10011111 159    -0.2421875&#xA;10100000 160    -0.25&#xA;10100001 161    -0.265625&#xA;10100010 162    -0.28125&#xA;10100011 163    -0.296875&#xA;10100100 164    -0.3125&#xA;10100101 165    -0.328125&#xA;10100110 166    -0.34375&#xA;10100111 167    -0.359375&#xA;10101000 168    -0.375&#xA;10101001 169    -0.390625&#xA;10101010 170    -0.40625&#xA;10101011 171    -0.421875&#xA;10101100 172    -0.4375&#xA;10101101 173    -0.453125&#xA;10101110 174    -0.46875&#xA;10101111 175    -0.484375&#xA;10110000 176    -0.5&#xA;10110001 177    -0.53125&#xA;10110010 178    -0.5625&#xA;10110011 179    -0.59375&#xA;10110100 180    -0.625&#xA;10110101 181    -0.65625&#xA;10110110 182    -0.6875&#xA;10110111 183    -0.71875&#xA;10111000 184    -0.75&#xA;10111001 185    -0.78125&#xA;10111010 186    -0.8125&#xA;10111011 187    -0.84375&#xA;10111100 188    -0.875&#xA;10111101 189    -0.90625&#xA;10111110 190    -0.9375&#xA;10111111 191    -0.96875&#xA;11000000 192    -1.0&#xA;11000001 193    -1.0625&#xA;11000010 194    -1.125&#xA;11000011 195    -1.1875&#xA;11000100 196    -1.25&#xA;11000101 197    -1.3125&#xA;11000110 198    -1.375&#xA;11000111 199    -1.4375&#xA;11001000 200    -1.5&#xA;11001001 201    -1.5625&#xA;11001010 202    -1.625&#xA;11001011 203    -1.6875&#xA;11001100 204    -1.75&#xA;11001101 205    -1.8125&#xA;11001110 206    -1.875&#xA;11001111 207    -1.9375&#xA;11010000 208    -2.0&#xA;11010001 209    -2.125&#xA;11010010 210    -2.25&#xA;11010011 211    -2.375&#xA;11010100 212    -2.5&#xA;11010101 213    -2.625&#xA;11010110 214    -2.75&#xA;11010111 215    -2.875&#xA;11011000 216    -3.0&#xA;11011001 217    -3.125&#xA;11011010 218    -3.25&#xA;11011011 219    -3.375&#xA;11011100 220    -3.5&#xA;11011101 221    -3.625&#xA;11011110 222    -3.75&#xA;11011111 223    -3.875&#xA;11100000 224    -4.0&#xA;11100001 225    -4.25&#xA;11100010 226    -4.5&#xA;11100011 227    -4.75&#xA;11100100 228    -5.0&#xA;11100101 229    -5.25&#xA;11100110 230    -5.5&#xA;11100111 231    -5.75&#xA;11101000 232    -6.0&#xA;11101001 233    -6.25&#xA;11101010 234    -6.5&#xA;11101011 235    -6.75&#xA;11101100 236    -7.0&#xA;11101101 237    -7.25&#xA;11101110 238    -7.5&#xA;11101111 239    -7.75&#xA;11110000 240    -8.0&#xA;11110001 241    -8.5&#xA;11110010 242    -9.0&#xA;11110011 243    -9.5&#xA;11110100 244    -10.0&#xA;11110101 245    -10.5&#xA;11110110 246    -11.0&#xA;11110111 247    -11.5&#xA;11111000 248    -12.0&#xA;11111001 249    -12.5&#xA;11111010 250    -13.0&#xA;11111011 251    -13.5&#xA;11111100 252    -14.0&#xA;11111101 253    -14.5&#xA;11111110 254    -15.0&#xA;11111111 255    -15.5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2022-09-22T10:56:45.210" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25138" PostTypeId="2" ParentId="2140" CreationDate="2022-09-22T14:40:21.217" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/open-ended-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;open-ended-function-container&quot;&gt;open-ended-function&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;N-element Rock Paper Scissors&lt;/h1&gt;&#xA;&lt;p&gt;Given an odd integer &lt;span class=&quot;math-container&quot;&gt;\$n&amp;gt;2\$&lt;/span&gt;, decide the winner for &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-element Rock Paper Scissors.&lt;/p&gt;&#xA;&lt;h3&gt;What is &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-element Rock Paper Scissors?&lt;/h3&gt;&#xA;&lt;p&gt;Rock Paper Scissors is a game in which two players choose between the elements Rock, Paper, and Scissors, and simultaneously reveal their selections. If one player chooses Rock, they will win against a player who chose Scissors, lose against a player who choses Paper, and tie a player who also chose Rock. It is a zero sum game, so a player losing means their opponent has won, and vice versa. Every element beats one element, loses to another, and ties with itself.&lt;/p&gt;&#xA;&lt;p&gt;A common extension to this game is to add two aditional elements (most famously &amp;quot;Lizard&amp;quot; and &amp;quot;Spock&amp;quot;). In this extension, there are now 5 elements, so each element beats &lt;em&gt;two&lt;/em&gt; elements, loses to &lt;em&gt;two&lt;/em&gt; elements, but still ties only itself. We can generalize this cleanly to any odd number of elements &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, in which each element will beat &lt;span class=&quot;math-container&quot;&gt;\$(n-1)/2\$&lt;/span&gt; elements, lose to &lt;span class=&quot;math-container&quot;&gt;\$(n-1)/2\$&lt;/span&gt; elements, and tie with itself.&lt;/p&gt;&#xA;&lt;h3&gt;Challenge specification&lt;/h3&gt;&#xA;&lt;h4&gt;Program 1&lt;/h4&gt;&#xA;&lt;p&gt;This program should take an odd integer &lt;span class=&quot;math-container&quot;&gt;\$n&amp;gt;2\$&lt;/span&gt; as input in any reasonable format decided by the solver, and output the Program 2 as defined below in terms of &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;. Alternatively, this program may instead take the Program 2's inputs along with &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, and provide the Program 2's expected output instead.&lt;/p&gt;&#xA;&lt;p&gt;This program is the one you will be scored on. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;h4&gt;Program 2&lt;/h4&gt;&#xA;&lt;p&gt;This program should take two elements &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; as input in any reasonable format decided by the solver, and consistently output either one of the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Whether &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; beats &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;, loses to &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;, or ties with &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The winner between &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;, or in the case of a tie, some other distinct output.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Only &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; possible inputs need to be handled by this program. Each possible element must consistently beat &lt;span class=&quot;math-container&quot;&gt;\$(n-1)/2\$&lt;/span&gt; elements, lose to &lt;span class=&quot;math-container&quot;&gt;\$(n-1)/2\$&lt;/span&gt; elements, and tie with itself. If some element &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; beats an element &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt;, element &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; loses to element &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt;. Which elements are allowed and which elements beat which etc. are to be decided by the solver. This must be consistent for each execution of Program 2 for the same &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Examples:&lt;/h3&gt;&#xA;&lt;p&gt;Your I/O may differ.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Format:&#xA;n (input to Program 1)&#xA;a b c d e (list of inputs accepted by Program 2, space delimited for all examples)&#xA;x y (inputs to Program 2, space delimited for all examples)&#xA;value (whether x wins, loses, or ties y)&#xA;&#xA;3&#xA;r p s&#xA;r p&#xA;lose&#xA;&#xA;3&#xA;r p s&#xA;r r&#xA;tie&#xA;&#xA;3&#xA;r p s&#xA;r s&#xA;win&#xA;&#xA;5&#xA;0 1 2 3 4&#xA;0 1&#xA;win&#xA;&#xA;5&#xA;0 1 2 3 4&#xA;0 2&#xA;win&#xA;&#xA;5&#xA;0 1 2 3 4&#xA;0 3&#xA;lose&#xA;&#xA;5&#xA;0 1 2 3 4&#xA;0 4&#xA;lose&#xA;&#xA;5&#xA;abcde bcdea cdeab deabc eabcd&#xA;bcdea cdeab&#xA;lose&#xA;&#xA;5&#xA;abcde bcdea cdeab deabc eabcd&#xA;bcdea deabc&#xA;lose&#xA;&#xA;5&#xA;abcde bcdea cdeab deabc eabcd&#xA;bcdea eabcd&#xA;win&#xA;&#xA;5&#xA;abcde bcdea cdeab deabc eabcd&#xA;bcdea abcde&#xA;win&#xA;&#xA;5&#xA;abcde bcdea cdeab deabc eabcd&#xA;bcdea bcdea&#xA;tie&#xA;&#xA;13&#xA;a b c d e f g h i j k l m&#xA;g e&#xA;lose&#xA;&#xA;13&#xA;a b c d e f g h i j k l m&#xA;g m&#xA;win&#xA;&#xA;13&#xA;a b c d e f g h i j k l m&#xA;d h&#xA;win&#xA;&#xA;13&#xA;a b c d e f g h i j k l m&#xA;h d&#xA;lose&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;p&gt;Everything clear? Any other examples needed? Maybe a worked out example?&lt;/p&gt;&#xA;" OwnerUserId="107310" LastEditorUserId="107310" LastEditDate="2022-09-27T16:07:21.587" LastActivityDate="2022-09-27T16:07:21.587" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25139" PostTypeId="2" ParentId="25128" CreationDate="2022-09-24T14:47:04.083" Score="8" Body="&lt;p&gt;Moderators must sign an &lt;a href=&quot;https://codegolf.stackexchange.com/legal/moderator-agreement&quot;&gt;agreement&lt;/a&gt; whose terms include:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;i. I will abide by the current &lt;a href=&quot;https://codegolf.stackexchange.com/conduct&quot;&gt;Code of Conduct&lt;/a&gt; (which is a part of this agreement), and enforce it to the best of my ability.&lt;br /&gt;&#xA;...&lt;br /&gt;&#xA;iv. I will abide by all other officially announced moderator and user policies &lt;a href=&quot;https://codegolf.stackexchange.com/help/mod-agreement-policies&quot;&gt;made available to me&lt;/a&gt;.&lt;br /&gt;&#xA;v. I will accept additional guidance given by members of the Stack Exchange, Inc. Community Team and Senior Leadership Team, whether in response to questions, concerns or discussions regarding existing network-wide policies.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;How would you respond if a policy or company directive (current or future) seems to conflict with your beliefs and ideals?&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sup&gt;Taken from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/19328/66833&quot;&gt;xnor's answer&lt;/a&gt; from the last election. While the events that inspired the question are less recent than before, I believe the question is no less relevant, and so deserves to be asked&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-09-24T14:47:04.083" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25140" PostTypeId="2" ParentId="2140" CreationDate="2022-09-24T20:14:40.250" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/252442/repeat-values-in-array&quot;&gt;Repeat Values In Array&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2022-10-02T19:05:01.457" LastActivityDate="2022-10-02T19:05:01.457" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25142" PostTypeId="2" ParentId="2140" CreationDate="2022-09-25T18:35:34.783" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/252258/create-a-nibble-shorthand&quot;&gt;Create a nibble shorthand&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-09-27T14:17:31.507" LastActivityDate="2022-09-27T14:17:31.507" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25143" PostTypeId="2" ParentId="2140" CreationDate="2022-09-25T22:36:25.140" Score="0" Body="&lt;h1&gt;An Optimally Suboptimal Solution&lt;/h1&gt;&#xA;&lt;p&gt;You have grown disillusioned by finding optimal policies for heavy-tailed distributions and their &amp;quot;skew you&amp;quot; attitudes. You decide that for this challenge you are putting your foot down and refusing to optimize your policy further if it means having unbalanced errors. In fact, you're so focused on balance that you will only consider median errors - it's the principle of the thing.&lt;/p&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Generate a policy that searches for hidden points on a line segment, &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; is the interval &lt;span class=&quot;math-container&quot;&gt;\$[0, 1]\$&lt;/span&gt;. The number of hidden points on &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; is randomly chosen from the set &lt;span class=&quot;math-container&quot;&gt;\$\{0, 10\}\$&lt;/span&gt;. The position of each point, &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt;, (if there are any) is drawn randomly from the uniform distribution on &lt;span class=&quot;math-container&quot;&gt;\$\{0, 1\}\$&lt;/span&gt;. The points are indistinguishable.&lt;/p&gt;&#xA;&lt;p&gt;The problem is episodic. In each episode you search the line according to your policy. At each step in the episode you may continue to search the line, or you may reset.&lt;/p&gt;&#xA;&lt;p&gt;To search the line&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Choose &lt;span class=&quot;math-container&quot;&gt;\$x \in[0, 0.9]\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Accrue a cost of &lt;span class=&quot;math-container&quot;&gt;\$2^x\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Discover all points where &lt;span class=&quot;math-container&quot;&gt;\$0 \leq p \leq x\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;To reset&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Generate a new line segment&lt;/li&gt;&#xA;&lt;li&gt;Draw a new number of hidden points to place on the line segment&lt;/li&gt;&#xA;&lt;li&gt;If there are any hidden points, place them on the line segment&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;strong&gt;An episode ends when your policy has discovered 10 hidden points on the interval &lt;span class=&quot;math-container&quot;&gt;\$[0, 0.9]\$&lt;/span&gt;.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Note: Your policy may not use information about the number of hidden points, nor their locations. When resetting, you do not keep any points you have previously found, but you do keep all costs accrued.&lt;/p&gt;&#xA;&lt;p&gt;This setup is adapted from @graffe's &lt;a href=&quot;https://codegolf.stackexchange.com/q/251528/114139&quot;&gt;Cunning Cousin Witch&lt;/a&gt; problem.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Define a false negative to be when a policy chooses to reset a line segment and there were 10 hidden points on the interval &lt;span class=&quot;math-container&quot;&gt;\$[0, 0.9]\$&lt;/span&gt;, i.e. it was possible to complete the episode but the policy resets instead.&lt;/p&gt;&#xA;&lt;p&gt;Define a false positive to be when a policy searches the entire interval &lt;span class=&quot;math-container&quot;&gt;\$[0, 0.9]\$&lt;/span&gt;, and there were fewer than 10 hidden points on the interval &lt;span class=&quot;math-container&quot;&gt;\$[0, 0.9]\$&lt;/span&gt;, i.e. it was not possible to complete the episode but the policy searches the entire available line segment.&lt;/p&gt;&#xA;&lt;p&gt;Your policy's score is the median absolute difference between the number of false negatives and false positives your policy incurs over one million episodes. The score should be minimized.&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$\text{Score} = median(\lvert FN - FP \rvert)$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Where &lt;span class=&quot;math-container&quot;&gt;\$FN\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$FP\$&lt;/span&gt; are vectors of length one million, and the nth element of each vector is the number of false negatives / positives the policy made in episode n.&lt;/p&gt;&#xA;&lt;p&gt;If two policies have the same score, the one with the lower median cost from searching lines will rank higher.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;p&gt;I'm hoping to encourage some custom optimization methods with this one by asking for solutions that are not optimal with respect to the cost function, and by making the objective multi-criteria (because the tie-breaking cost of searching is a function of FN and FP). I think that the way points are discovered prevents optimizing with the cost = x from being equivalent to solving this one, but I haven't exhaustively tested it.&lt;/p&gt;&#xA;&lt;p&gt;I'd especially appreciate feedback on whether this is an interesting / productive variation on the original version, and whether or not the optimization task is equivalent to a trivial formulation.&lt;/p&gt;&#xA;" OwnerUserId="114139" LastActivityDate="2022-09-25T22:36:25.140" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25144" PostTypeId="2" ParentId="25128" CreationDate="2022-09-26T01:43:15.593" Score="5" Body="&lt;p&gt;Recently, we've closed several older questions in favour of newer ones that are less strict.&lt;/p&gt;&#xA;&lt;h2&gt;A new user posts a question that is an exact duplicate of a much older question. However, it's much less strict than the original  and allows classes of answers/languages that wouldn't be possible otherwise. What would you do in this situation?&lt;/h2&gt;&#xA;" OwnerUserId="100664" LastActivityDate="2022-09-26T01:43:15.593" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25145" PostTypeId="2" ParentId="25128" CreationDate="2022-09-26T06:12:39.267" Score="8" Body="&lt;h2&gt;You've taken what you feel is a reasonable moderation action, but another user brings up an analogous situation in the past where an opposite action was taken, which was also reasonable at the time. How would you react to this user's complaint?&lt;/h2&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2022-09-26T06:12:39.267" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25146" PostTypeId="2" ParentId="2140" CreationDate="2022-09-26T06:37:08.950" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/253714&quot;&gt;Enumerate the rationals&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/open-ended-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;open-ended-function-container&quot;&gt;open-ended-function&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;sequence-container&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="81203" LastEditorUserId="81203" LastEditDate="2022-10-24T19:18:16.857" LastActivityDate="2022-10-24T19:18:16.857" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="25147" PostTypeId="2" ParentId="25098" CreationDate="2022-09-26T08:19:56.550" Score="3" Body="&lt;h1&gt;Use a challenge category/tag rather than a paradigm&lt;/h1&gt;&#xA;&lt;p&gt;Right now the top voted paradigm is 2d. The issue with this is that this is a bit subjective, and a language gains a advantage by being as little 2d as possible. Even if a language has instructions to change the direction of the instruction pointer etc. optimal solutions will rarely if ever use them, instead converging to the same solutions as stack based languages and ignoring the 2d features as unoptimal. Stack based is just really really good.&lt;/p&gt;&#xA;&lt;p&gt;It might be possible to prevent this by setting hard restrictions on alternatives like lambdas or jumps, but I think it would become really hard to close loopholes sufficiently. Rules may also needlessly suppress creativity.&lt;/p&gt;&#xA;&lt;p&gt;If we artificially cripple these languages it would also lead them to being useless outside of this challenge.&lt;/p&gt;&#xA;&lt;h2&gt;The alternative: Languages focused on a particular type of challenge, eg &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;graphical-output-container&quot;&gt;graphical-output&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;This way, languages can fill a genuine niche and compete with pre-existing golfing languages, which encourages continued development after the contest is over.&lt;/p&gt;&#xA;&lt;p&gt;There don't need to be any subjective rules, languages are free to innovate in any way they see fit.&lt;/p&gt;&#xA;&lt;p&gt;If combined with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25102/91213&quot;&gt;this idea&lt;/a&gt; participants should only be able to choose challenges that have a particular tag.&lt;/p&gt;&#xA;&lt;h2&gt;Tags that could work&lt;/h2&gt;&#xA;&lt;p&gt;I really like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;graphical-output-container&quot;&gt;graphical-output&lt;/a&gt; since many mainstream golfing languages are bad at it, but some others that could work include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;restricted-source-container&quot;&gt;restricted-source&lt;/a&gt; Languages that offer many ways to do any one thing&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graph&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graph&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;graph&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;graph-container&quot;&gt;graph&lt;/a&gt; Languages with lots of built-ins to manipulate graphs&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;matrix-container&quot;&gt;matrix&lt;/a&gt; Linear algebra focused languages&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;string-container&quot;&gt;string&lt;/a&gt; Languages focusing on string manipulation&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2022-09-26T08:19:56.550" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25148" PostTypeId="2" ParentId="2140" CreationDate="2022-09-26T12:35:31.710" Score="0" Body="&lt;h1&gt;Implement the Hamming algorithm&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Hamming_code&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hamming error correction&lt;/a&gt; is a form of linear error-correction code which can detect and repair small errors in its input. Your job is to implement a program that, given an input of a sequence of bytes, encodes them using Hamming error correction and outputs the results.&lt;/p&gt;&#xA;&lt;h2&gt;The algorithm&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;Taken from Wikipedia, with some slight modifications&lt;/em&gt;&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Number all of the bits, starting from 1&lt;/li&gt;&#xA;&lt;li&gt;Write these numbers in binary&lt;/li&gt;&#xA;&lt;li&gt;Every bit position that is a power of 2 (has only one 1 bit in its binary position) is a parity bit, with the remaining bits being data bits.&lt;/li&gt;&#xA;&lt;li&gt;Set every parity bit with the values of every data bit where the bitwise AND of the parity bit's position and the data bit's position is nonzero&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;You may choose any parity (even or odd) but must state it in your answer.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;These will use hexadecimal to represent the data.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0x1234 -&amp;gt; 0x2a3a1&#xA;0x4321 -&amp;gt; 0x8b28e&#xA;0xbadf00d -&amp;gt; 0x2f5be8064&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="108218" LastActivityDate="2022-09-26T12:35:31.710" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25149" PostTypeId="2" ParentId="2140" CreationDate="2022-09-26T15:17:20.310" Score="1" Body="&lt;h1&gt;Construct Digit From Digits&lt;/h1&gt;&#xA;&lt;p&gt;In the game &lt;a href=&quot;https://beastacademy.com/all-ten&quot; rel=&quot;nofollow noreferrer&quot;&gt;All Ten&lt;/a&gt;, each day you are given four single-digit positive integers, and have to use all four of those numbers once each to construct the values 1 through 10 using the following operations:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Addition&lt;/li&gt;&#xA;&lt;li&gt;Subtraction&lt;/li&gt;&#xA;&lt;li&gt;Multiplication&lt;/li&gt;&#xA;&lt;li&gt;Division&lt;/li&gt;&#xA;&lt;li&gt;Concatenation, i.e. joining two numbers together; for example, &lt;span class=&quot;math-container&quot;&gt;\$1 \text{ concat } 23 = 123\$&lt;/span&gt;. (You can only apply this operation if both of the numbers are integers and the number on the right is non-negative.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;So, for example, given numbers &lt;span class=&quot;math-container&quot;&gt;\$[4,4,8,9]\$&lt;/span&gt;, to make &lt;span class=&quot;math-container&quot;&gt;\$4\$&lt;/span&gt; you could do &lt;span class=&quot;math-container&quot;&gt;\$((4 \text{ concat } 4) - 8 ) / 9\$&lt;/span&gt;. which equals &lt;span class=&quot;math-container&quot;&gt;\$(44 - 8)/9 = 36 / 9 = 4\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You're allowed to compose these operations however you want, in whatever order, including concatenation (e.g. you can do &lt;span class=&quot;math-container&quot;&gt;\$16 - ((2-1) \text{ concat } 3) = 16 + (-1 \text{ concat } 3) = 16 - 13 = 3\$&lt;/span&gt;.)&lt;/p&gt;&#xA;&lt;h2&gt;The challenge:&lt;/h2&gt;&#xA;&lt;p&gt;Your function is given two inputs: &lt;span class=&quot;math-container&quot;&gt;\$I\$&lt;/span&gt;, which is a list of four single digit positive integers (i.e. in the range &lt;span class=&quot;math-container&quot;&gt;\$1,2,\ldots,9\$&lt;/span&gt;) which are not necessarily unique, and &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, which is also a single digit positive integer.&lt;/p&gt;&#xA;&lt;p&gt;Your function should return a way of using all four numbers in &lt;span class=&quot;math-container&quot;&gt;\$I\$&lt;/span&gt; to construct &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; using the rules above.&lt;/p&gt;&#xA;&lt;h3&gt;Output Format&lt;/h3&gt;&#xA;&lt;p&gt;You can provide the output in any meaningful way, including:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A string (or list of numbers/characters) representing the expression which evaluates to &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, using any symbols besides &lt;span class=&quot;math-container&quot;&gt;\$1,2,\ldots,9\$&lt;/span&gt; to represent the operations / parentheses necessary&#xA;&lt;ul&gt;&#xA;&lt;li&gt;e.g. &lt;code&gt;&amp;quot;((4c4)-8)/9&amp;quot;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;You're also allowed to represent concatenation with the empty string (i.e. no operator at all) -- e.g.  &lt;code&gt;&amp;quot;((44)-8)/9&amp;quot;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;You can leave out parentheses if you specify the order of operations -- e.g. you say that concatenation has highest priority, then return &lt;code&gt;&amp;quot;(44-8)/9&amp;quot;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;A tree or nested list with where each leaf represents a number in &lt;span class=&quot;math-container&quot;&gt;\$I\$&lt;/span&gt; and the parents represent the various operations&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may assume there is at least one solution; if there's more than one solution, you may output any of them.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;[To do -- I need to enumerate &lt;em&gt;all&lt;/em&gt; of the possible ways to construct a given value for this to be useful.]&lt;/p&gt;&#xA;&lt;h1&gt;Questions&lt;/h1&gt;&#xA;&lt;p&gt;This is a really bad title, but it's hard to describe succintly.&#xA;There's also a lot of text here, but I don't know how to shorten it.&lt;/p&gt;&#xA;" OwnerUserId="113573" LastActivityDate="2022-09-26T15:17:20.310" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="25150" PostTypeId="1" CreationDate="2022-09-26T20:00:08.200" Score="11" ViewCount="191" Body="&lt;h2&gt;The 2022 Community Moderator Election is now underway!&lt;/h2&gt;&#xA;&lt;p&gt;Community moderator elections have three phases:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Nomination phase [Completed]&lt;/li&gt;&#xA;&lt;li&gt;Primary phase [Skipped due to &amp;lt;10 nominees]&lt;/li&gt;&#xA;&lt;li&gt;Election phase [&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/25232/2022-community-moderator-election-results&quot;&gt;Completed&lt;/a&gt;]&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Most elections take between two and three weeks, but this depends on how many candidates there are.&lt;/p&gt;&#xA;&lt;p&gt;Please visit the &lt;a href=&quot;https://codegolf.stackexchange.com/election&quot;&gt;official election page&lt;/a&gt; for more detail, and to participate!&lt;/p&gt;&#xA;&lt;p&gt;If you have general questions about the election process, or questions for moderator candidates, feel free to ask them here on meta - just make sure your questions are tagged &lt;a href=&quot;/questions/tagged/election&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;election&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;election&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;election-container&quot;&gt;election&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="-1" LastEditorUserId="92689" LastEditDate="2022-10-13T03:02:58.317" LastActivityDate="2022-10-13T03:02:58.317" Title="2022 Community Moderator Election" Tags="|discussion|moderators|election|" AnswerCount="0" CommentCount="0" CommunityOwnedDate="2022-09-26T20:00:08.200" ContentLicense="CC BY-SA 4.0" />
  <row Id="25151" PostTypeId="2" ParentId="2140" CreationDate="2022-09-27T02:09:37.000" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/252303/cut-along-the-lines&quot;&gt;Cut along the lines&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-09-28T15:11:01.867" LastActivityDate="2022-09-28T15:11:01.867" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25153" PostTypeId="2" ParentId="2140" CreationDate="2022-09-27T16:50:55.457" Score="1" Body="&lt;h2&gt;Prime number checksum&lt;/h2&gt;&#xA;&lt;h4&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/253264/prime-number-checksum&quot;&gt;Posted here&lt;/a&gt;&lt;/h4&gt;&#xA;" OwnerUserId="96037" LastEditorUserId="96037" LastEditDate="2022-10-15T17:52:50.093" LastActivityDate="2022-10-15T17:52:50.093" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25154" PostTypeId="2" ParentId="20722" CreationDate="2022-09-28T04:01:40.097" Score="1" Body="&lt;p&gt;The thing is, none of my work is ever done, thus the name.&lt;/p&gt;&#xA;&lt;p&gt;My avatar was generated by a Scratch program that was not shared.&lt;/p&gt;&#xA;" OwnerUserId="110681" LastEditorUserId="110681" LastEditDate="2023-01-03T14:24:46.660" LastActivityDate="2023-01-03T14:24:46.660" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25155" PostTypeId="2" ParentId="2140" CreationDate="2022-09-28T06:44:46.783" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/252340/count-futoshiki-row-solutions&quot;&gt;Count Futoshiki row solutions&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110698" LastEditorUserId="110698" LastEditDate="2022-09-29T14:48:37.067" LastActivityDate="2022-09-29T14:48:37.067" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25156" PostTypeId="1" CreationDate="2022-09-28T08:23:54.830" Score="10" ViewCount="156" Body="&lt;h2&gt;Context&lt;/h2&gt;&#xA;&lt;p&gt;Rust does a lot of smart things to determine the types of variables. This is why you rarely need to define the types of a variable explicitly. Rust can search very far to find a type for a function. For example, this is invalid:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;let i;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;but this is valid:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-rs prettyprint-override&quot;&gt;&lt;code&gt;let i;&#xA;i=5&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;These lines do not need to be next to eachother. There can be a lot of code in between.&lt;/p&gt;&#xA;&lt;h2&gt;Problem&lt;/h2&gt;&#xA;&lt;p&gt;Consider this rust answer:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;|a,b|a;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This won't compile. You need to specify the type for &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt;. To make this compile you would need&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-rs prettyprint-override&quot;&gt;&lt;code&gt;|a:u8,b:u8|a;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;However, often rust answers have test cases, so the full code will look more like this:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-rs prettyprint-override&quot;&gt;&lt;code&gt;fn main(){&#xA;f = &#xA;|a,b|a;&#xA;&#xA;asserteq!(f(1,2), 1);&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This compiles, the test case in this case tells rust the type of the function, even though it appears much later in the code.&lt;/p&gt;&#xA;&lt;p&gt;Many answers use this trick so save bytes, for example:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/252272/91213&quot;&gt;It's just Rocket Science&lt;/a&gt; Here the type of &lt;code&gt;m&lt;/code&gt; is unspecified.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/250055/91213&quot;&gt;Do 2 numbers contain unique powers of 2&lt;/a&gt; Both &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; are missing types&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/249948/91213&quot;&gt;All Possible Ties in Tic-Tac-Toe&lt;/a&gt; My own answer&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/248129/91213&quot;&gt;How many light changes will a 7-segment display need?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/245739/91213&quot;&gt;Finding prime numbers without using &amp;quot;prime characters&amp;quot;&lt;/a&gt; The TIO link for this answer even explicitly types the function but doesn't include that in the byte count&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Not criticizing any of these answers, there where all valid when posted.&lt;/p&gt;&#xA;&lt;p&gt;There might also be cases when the test cases accidentally limit the return type too, or the type of a global variable. Just listing those for argument types since the issue is easier to spot but it's not the only way the type can be defined outside the block itself.&lt;/p&gt;&#xA;&lt;h2&gt;Question&lt;/h2&gt;&#xA;&lt;p&gt;Should it be allowed for the types of arguments in rust (and maybe other languages that have implicit static typing) be allowed to derive from test cases?&lt;/p&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="46076" LastEditDate="2022-09-28T18:51:45.957" LastActivityDate="2022-09-28T22:40:33.267" Title="Should rust anonymous functions fully specify parameter types?" Tags="|discussion|languages|" AnswerCount="2" CommentCount="4" ClosedDate="2023-01-25T17:18:02.137" ContentLicense="CC BY-SA 4.0" />
  <row Id="25157" PostTypeId="1" CreationDate="2022-09-28T11:30:50.393" Score="8" ViewCount="151" Body="&lt;p&gt;Like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24820/biweekly-mini-golf-is-half-dead&quot;&gt;&lt;strong&gt;last time&lt;/strong&gt;&lt;/a&gt;, LYAL is dead. &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/62091674#62091674&quot;&gt;&lt;strong&gt;Source&lt;/strong&gt;&lt;/a&gt;. As documented &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/23771/language-nominations-for-the-learn-you-a-lang-for-great-good-chat-event&quot;&gt;&lt;strong&gt;here&lt;/strong&gt;&lt;/a&gt;, there were no LYALs for &lt;strong&gt;6 weeks&lt;/strong&gt;. I agree with what caird says:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;If people aren't engaging with an event anymore, the proper thing to do is let it die. It was fun when it started, and that's great, but there's nothing wrong with saying &amp;quot;Well, the fun's over. What else should we do?&amp;quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;But I think there is a way to fix it. Start all over. Add in all the languages we've learned. Go over them again.&lt;/p&gt;&#xA;&lt;p&gt;It should go without saying that this post accepts alternative solutions. It would also be encouraged to make more &lt;strong&gt;Chat Language Proposals&lt;/strong&gt; on &lt;a href=&quot;https://codegolf.meta.stackexchange.com&quot;&gt;&lt;strong&gt;Meta&lt;/strong&gt;&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Edit: Well, there &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/62091820#62091820&quot;&gt;&lt;strong&gt;is one&lt;/strong&gt;&lt;/a&gt; today, but that it like 11 hours after when it &lt;strong&gt;should&lt;/strong&gt; happen.&lt;/p&gt;&#xA;" OwnerUserId="111945" LastActivityDate="2022-09-28T14:50:44.200" Title="Fix the dead LYAL" Tags="|discussion|chat|chat-events|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25159" PostTypeId="2" ParentId="25157" CreationDate="2022-09-28T13:57:46.497" Score="10" Body="&lt;h1&gt;A Diagnosis of LYAL&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Forgive me if this is a little incoherent - I wrote this at 11pm while feeling a tad bit tired and incoherent myself&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;While I disagree with the statement that LYAL is &lt;em&gt;dead&lt;/em&gt;, I do agree that it is slowly dying. This answer will look at the symptoms that indicate LYAL is dying and the potential causes. It will also give some suggestions on how to potentially cure LYAL.&lt;/p&gt;&#xA;&lt;h2&gt;But First, Data&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;For this post, a LYAL is considered failed if there was no learning of the language after the first two hours from the announcement&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Since the first LYAL event (at the time of writing), there have been 29 opportunities to hold a LYAL. Of those, 19 opportunities (~66%) were utilised (i.e there was no ambiguity about the language being learned and there was a serious attempt at learning the language). From the remaining 10 (~34%) LYALS, 2 failed due to ambiguity over which language was being learned (&lt;a href=&quot;https://chat.stackexchange.com/transcript/message/60980566&quot;&gt;April 27 2022&lt;/a&gt; and &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=61415640&quot;&gt;June 21 2022&lt;/a&gt;), 3 failed because people just ignored the LYAL (&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=59686344&quot;&gt;November 24 2021&lt;/a&gt;, &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=60440163&quot;&gt;February 16 2022&lt;/a&gt;, and &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=61623140&quot;&gt;July 20 2022&lt;/a&gt;) and 5 failed because there just wasn't enough interest in the language to learn it beyond the first hour of choosing a language (&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=60055266&quot;&gt;StackCats - January 5 2022&lt;/a&gt;, &lt;a href=&quot;https://chat.stackexchange.com/transcript/240/2022/8/17&quot;&gt;Coconut - August 17 2022&lt;/a&gt;, &lt;a href=&quot;https://chat.stackexchange.com/transcript/240/2022/8/31&quot;&gt;Coconut (again) - August 31 2022&lt;/a&gt;, &lt;a href=&quot;https://chat.stackexchange.com/transcript/240/2022/9/14/0-19&quot;&gt;Labyrinth - September 14 2022&lt;/a&gt; and &lt;a href=&quot;https://chat.stackexchange.com/transcript/240/2022/9/28&quot;&gt;J - September 28 2022&lt;/a&gt;).&lt;/p&gt;&#xA;&lt;h2&gt;Symptoms&lt;/h2&gt;&#xA;&lt;p&gt;Now that there's objective data on the 29 LYALs that have occurred, symptoms can be derived from the 10 LYALs that failed.&lt;/p&gt;&#xA;&lt;h3&gt;Ambiguity Over Language to be Learned&lt;/h3&gt;&#xA;&lt;p&gt;This happens when there are two or more languages with the same score, and there is either no one around that can confidently teach either. In the two instances of LYAL failing due to this symptom, there was a tiny bit of discussion regarding language scores and which should be learned, followed by regular conversation.&lt;/p&gt;&#xA;&lt;h3&gt;Ignoring the LYAL&lt;/h3&gt;&#xA;&lt;p&gt;This happens when a LYAL announcement is posted, and it goes by without any comment or interaction. In the 3 instances of the LYAL being ignored, 2 involved the LYAL announcement being superseded by the conversation that happened before the announcement. In the other case, the announcement was just straight up ignored - there was no prior conversation that took over, and there was no conversation that drowned it out.&lt;/p&gt;&#xA;&lt;h3&gt;Lack of Interest in Learning&lt;/h3&gt;&#xA;&lt;p&gt;This happens when a LYAL starts somewhat strong in the first hour or two, but falls out of relevance over the remaining hours of the event. The 5 cases of LYALs where this happened all had a small handful of language-specific CMCs asked, with some having answers posted in that time. After that, people just seem to &amp;quot;forget&amp;quot; that there's a LYAL.&lt;/p&gt;&#xA;&lt;h2&gt;Causes of the Symptoms&lt;/h2&gt;&#xA;&lt;h3&gt;Continuation of Prior Conversations&lt;/h3&gt;&#xA;&lt;p&gt;The 2 cases where the LYAL event was ignored happened because the conversation that was happening before the LYAL announcement hadn't concluded. Admittedly, these instances happened before the recent noise control focus in The Nineteenth Byte, so this could have been a consequence of something on-topic being swallowed by off-topic conversation.&lt;/p&gt;&#xA;&lt;h3&gt;Lack of Teachers Available at the Time of the LYAL&lt;/h3&gt;&#xA;&lt;p&gt;The important part of any LYAL is that there is &lt;em&gt;someone&lt;/em&gt; present who knows even a &lt;em&gt;little bit&lt;/em&gt; about the language being learned. Without someone who is confident with the language driving/directing the event, all that happens is people trying to learn a language without any idea of whether they're learning it right or making any progress.&lt;/p&gt;&#xA;&lt;p&gt;This is one of the causes of ambiguities over which language will be learned during the LYAL; when there is no one available to teach any of the top languages, people seem to &amp;quot;umm and ahh&amp;quot; about what to choose. The indecisiveness eventually leads to confusion, and that leads to people thinking &amp;quot;well, we'll just carry on with what we were doing beforehand&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;A lack of teachers for a LYAL is also one of the causes of loss of interest in the event; because no one is able to take charge, there is no one with an interest to keep the learning activity going beyond initial engagements. Without someone to take the lead and provide help with learning the language, people will quickly see that there isn't much activity happening and move on.&lt;/p&gt;&#xA;&lt;h3&gt;Lack of Structure and Planning for Teaching the Language&lt;/h3&gt;&#xA;&lt;p&gt;This is probably one of the big killers of all failed LYALs, as it causes all 3 symptoms:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;there is no plan for what to do if there are multiple candidate languages that have no one active to teach them, meaning that any language ambiguities result in the LYAL just failing as a sort of &amp;quot;default plan&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;there is no structure to stop any prior conversation and make it obvious and clear that a LYAL is starting, meaning that LYAL announcements can be &amp;quot;talked over&amp;quot; without any one noticing.&lt;/li&gt;&#xA;&lt;li&gt;without a plan of what should be taught or a general path CMCs should take new users down, LYALs default to only a few stock-challenge CMCs without any important features of the language being gradually taught.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Too Much of a Good Thing Ruins its Impact&lt;/h3&gt;&#xA;&lt;p&gt;Everyone loves a party - it's fun and a good time for (most of) those involved. But if you have a party every two weeks for an entire year, people are going to start getting tired of partying so frequently. LYAL has been run to the point where the remaining language pool is running low, with probably only 5 or 6 languages having the potential to have active teachers. The lack of new languages being submitted as possibilities suggests a bit of LYAL fatigue, meaning that people are probably feeling a little burnt-out from seeing so many LYALs come and go.&lt;/p&gt;&#xA;&lt;h2&gt;So What's the Solution?&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Put LYAL on hold for a little bit - give it a chance to rest and gather some hype.&lt;/li&gt;&#xA;&lt;li&gt;Add some more languages to the language pool. The question suggests letting languages be re-learned for LYALs, which I think is a good thing to do - people may not have fully learned some of the more popular LYAL languages last time around.&lt;/li&gt;&#xA;&lt;li&gt;Create a plan for when there isn't anyone around to teach any LYAL candidates. This could be to make a clear announcement that LYAL isn't being held in that cycle, and that if it looks like there won't be anyone around to teach a language, delete the nomination until someone can commit to teaching it (at least for the first bit of a LYAL).&lt;/li&gt;&#xA;&lt;li&gt;Create a template/guide on how to run a LYAL so people aren't 100% free-styling it. This goes to solving the lack of structure problem.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h4&gt;tl;dr There's a few problems with the current way of running LYALs, but with proper planning, they can be fixed.&lt;/h4&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2022-09-28T14:50:44.200" LastActivityDate="2022-09-28T14:50:44.200" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25161" PostTypeId="5" CreationDate="2022-09-28T15:17:04.040" Score="0" Body="" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-09-28T15:17:04.040" LastActivityDate="2022-09-28T15:17:04.040" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25162" PostTypeId="4" CreationDate="2022-09-28T15:17:04.040" Score="0" Body="For questions about site-design, the site specific css created by the designers at StackExchange." OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2022-09-28T15:17:04.040" LastActivityDate="2022-09-28T15:17:04.040" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25163" PostTypeId="2" ParentId="25156" CreationDate="2022-09-28T20:54:36.083" Score="4" Body="&lt;h1&gt;Implicit parameter types should be allowed&lt;/h1&gt;&#xA;&lt;p&gt;We write code to be used. If the compiler can implicitly infer the types by calling the function the exact same way you would with explicit parameter types, and with the exact same output, it should be allowed.&lt;/p&gt;&#xA;" OwnerUserId="98937" LastActivityDate="2022-09-28T20:54:36.083" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25164" PostTypeId="2" ParentId="25156" CreationDate="2022-09-28T22:40:33.267" Score="14" Body="&lt;h1&gt;If Rust's type inference can infer argument types using external information, it is OK to omit them&lt;/h1&gt;&#xA;&lt;p&gt;There is a precedent for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/14281/78410&quot;&gt;Haskell&lt;/a&gt; allowing this.&lt;/p&gt;&#xA;&lt;p&gt;But note that &lt;em&gt;Rust's&lt;/em&gt; type inference is a lot weaker than e.g. Haskell's. If you omit types when Rust can't infer them even with context, your answer is invalid, and should be fixed to include the types so that the code compiles.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2022-09-28T22:40:33.267" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25165" PostTypeId="2" ParentId="2140" CreationDate="2022-09-28T23:59:54.383" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/252692/78410&quot;&gt;Longest alternating subsequence&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-10-06T00:02:21.813" LastActivityDate="2022-10-06T00:02:21.813" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25166" PostTypeId="2" ParentId="2140" CreationDate="2022-09-29T01:59:55.830" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/265634/print-100-digits-of-%cf%80&quot;&gt;Print 100 digits of π&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2023-10-01T02:29:11.190" LastActivityDate="2023-10-01T02:29:11.190" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25167" PostTypeId="2" ParentId="2140" CreationDate="2022-09-29T18:24:55.600" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/252379/hexadecimal-binary-art/252380&quot;&gt;Hexadecimal -&amp;gt; Binary Art&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="114446" LastEditorUserId="114446" LastEditDate="2022-09-30T16:41:02.893" LastActivityDate="2022-09-30T16:41:02.893" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="25168" PostTypeId="1" CreationDate="2022-09-29T19:08:16.887" Score="7" ViewCount="51" Body="&lt;p&gt;I recently completed a bounty from List of bounties with no deadline, only to later realize it was inactive. This was a little disappointing and I believe this could easily be avoided by editing these posts to reflect them being inactive; either by adding &lt;s&gt;strikethrough&lt;/s&gt; to their titles, or a little blurb in the body stating the post is inactive. If a user later returns to codegolf, they can always unedit the post to return it to active status.&lt;/p&gt;&#xA;&lt;p&gt;Link: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5243/list-of-bounties-with-no-deadline&quot;&gt;List of bounties with no deadline&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="106844" LastActivityDate="2022-09-29T19:08:16.887" Title="Proposal to mark Inactive posts in &quot;List of bounties with no deadline&quot; accordingly" Tags="|feature-request|meta|bounty|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25169" PostTypeId="2" ParentId="2140" CreationDate="2022-09-30T05:01:32.523" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/252652/find-a-word-in-the-dictionary-of-all-possible-words&quot;&gt;Find a word in the dictionary of all possible words&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97691" LastEditorUserId="97691" LastEditDate="2022-10-05T16:09:06.913" LastActivityDate="2022-10-05T16:09:06.913" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25170" PostTypeId="1" AcceptedAnswerId="25171" CreationDate="2022-09-30T11:58:14.677" Score="2" ViewCount="59" Body="&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5243/list-of-bounties-with-no-deadline&quot;&gt;List of bounties with no deadline&lt;/a&gt; is a page where there are bounties that can be awarded anytime. However majority of these were created quite awhile ago and some comments don't receive feedback on saying &amp;quot;This answer deserves the bounty&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;How can we bring this back? There's also the problem of users go inactive for years and not editing the post despite people spending time to try and earn the bounty only to realise the user is inactive and the posted is not updated to show it is.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/25168/proposal-to-mark-inactive-posts-in-list-of-bounties-with-no-deadline-according&quot;&gt;Example compliant&lt;/a&gt; of the post.&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-09-30T14:13:16.853" LastActivityDate="2022-09-30T16:43:50.523" Title="Inactivity on bounties with no deadlines?" Tags="|discussion|bounty|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25171" PostTypeId="2" ParentId="25170" CreationDate="2022-09-30T15:45:22.147" Score="5" Body="&lt;p&gt;This isn't an issue. The deadline-less bounties are not guaranteed. The second paragraph of the post is&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Disclaimer&lt;/strong&gt;: There is no guarantee that the user will award the bounty for you in case you fulfill its requirement. Especially if the user isn't an active member anymore. The only guarantee is their written word.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;When people advertise a bounty, it is expected, but not certain, that it will be rewarded when fulfilled. When you complete one of the bounties, you do so with the &amp;quot;risk&amp;quot; that you may not be awarded the bounty. If you aren't happy with that, then that's unfortunate, but there's no way to guarantee a deadline-less bounty, without SE making some changes for us.&lt;/p&gt;&#xA;&lt;p&gt;At best, you can take a quick glance at the user offering the bounty and see if they've been active recently. If not, then consider not doing that bounty.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2022-09-30T16:43:50.523" LastActivityDate="2022-09-30T16:43:50.523" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25173" PostTypeId="2" ParentId="2140" CreationDate="2022-10-01T22:58:35.723" Score="2" Body="&lt;h1&gt;Abbreviate the inputted phrases&lt;/h1&gt;&#xA;&lt;p&gt;Given an ASCII string, replace all occurrences of &amp;quot; is &amp;quot;, &amp;quot; are &amp;quot;, &amp;quot; am &amp;quot;, and &amp;quot; have &amp;quot; with &amp;quot;'s &amp;quot;, &amp;quot;'re &amp;quot;, and &amp;quot;'ve &amp;quot; respectively. This must be done case insensitively.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Input&lt;/th&gt;&#xA;&lt;th&gt;Output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;I am&lt;/td&gt;&#xA;&lt;td&gt;I'm&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;She is&lt;/td&gt;&#xA;&lt;td&gt;She's&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;The dog is&lt;/td&gt;&#xA;&lt;td&gt;The dog's&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;I have a dog&lt;/td&gt;&#xA;&lt;td&gt;I've a dog&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;I have been hurt&lt;/td&gt;&#xA;&lt;td&gt;I've been hurt&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;Wadsfajsdfl have asdasd&lt;/td&gt;&#xA;&lt;td&gt;Wadsfajsdfl've asdasd&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;So, is 6 am fare&lt;/td&gt;&#xA;&lt;td&gt;So,'s 6'm fare&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;foo amxyz&lt;/td&gt;&#xA;&lt;td&gt;foo amxyz&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;have I&lt;/td&gt;&#xA;&lt;td&gt;have I&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;HAVE I&lt;/td&gt;&#xA;&lt;td&gt;HAVE I&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;I HAVE&lt;/td&gt;&#xA;&lt;td&gt;I've&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;I AM&lt;/td&gt;&#xA;&lt;td&gt;I'm&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;I haven't&lt;/td&gt;&#xA;&lt;td&gt;I'ven't&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ambc xisz&lt;/td&gt;&#xA;&lt;td&gt;ambc xisz&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;" OwnerUserId="104836" LastEditorUserId="104836" LastEditDate="2022-10-03T01:57:21.397" LastActivityDate="2022-10-03T01:57:21.397" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="25175" PostTypeId="1" CreationDate="2022-10-02T13:30:02.660" Score="-3" ViewCount="150" Body="&lt;p&gt;Look at cases like not being able to reopen questions unless you're the poster. Most of the time they would not care, but I DO care for the posts, and it would be nice to reopen the question. After all, this site's fun comes from golfing, and i would help make fun, instead of making the question boring until the heat death of the universe.&lt;/p&gt;&#xA;&lt;p&gt;Though this site could still be used for standard loopholes, NOT ANYTHING ELSE. At this point you could make a totally different site called Code Golf Standard Loopholes, and it would be better than this.&lt;/p&gt;&#xA;&lt;p&gt;Please, make us able to do anything, EXCEPT standard loopholes.&lt;/p&gt;&#xA;" OwnerUserId="111474" LastActivityDate="2022-10-02T15:31:57.807" Title="This site takes out all of the fun of golfing" Tags="|discussion|" AnswerCount="3" CommentCount="6" ClosedDate="2022-10-02T21:02:17.597" ContentLicense="CC BY-SA 4.0" />
  <row Id="25176" PostTypeId="2" ParentId="25175" CreationDate="2022-10-02T14:12:16.133" Score="4" Body="&lt;p&gt;About the first part of your question, you have to make enough contributions to the site to have the privilege to vote to reopen a question, which is at 3000 reputation. You can read more about the privileges &lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For the second part of your question, there is nothing wrong with using standard loopholes. As long as they fulfill the question's requirements and does so in a short way, I don't see what's wrong with it.&lt;/p&gt;&#xA;" OwnerUserId="109916" LastActivityDate="2022-10-02T14:12:16.133" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25177" PostTypeId="2" ParentId="25175" CreationDate="2022-10-02T15:17:11.180" Score="3" Body="&lt;p&gt;Although our rules can be pretty annoying at times, they are, ultimately, in service of fun.&lt;/p&gt;&#xA;&lt;p&gt;It's difficult to pick a set of rules which works well on CGCC, just because there's so many variables. We have 13,000 questions, across dozens of challenge types (and some aren't even challenges at all), with hundreds of languages that vary extremely in how they operate.&lt;/p&gt;&#xA;&lt;p&gt;This necessitates putting an extra burden on challenge authors and answerers, in order to keep things from becoming chaos. We have a (mostly) reasonable set of standards for answers, including the standard I/O and other things which can be found on the &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;faq-container&quot;&gt;faq&lt;/a&gt; page. Questions require much more precise clarity than most newcomers expect, but without that, there's often no way to clarify if an answer is valid except asking OP (e.g., in a &amp;quot;print ASCII art of a unicorn&amp;quot; challenge, there's no objective way to determine if something looks like a unicorn), and that doesn't work if the OP goes inactive in a year.&lt;/p&gt;&#xA;&lt;p&gt;We didn't always have these rules. They weren't added just because we're all huge fans of bureaucracy and red tape here, but instead because we agreed they'd make the site more fun to golf on. While it does make asking a question harder, that's why we have the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges?answertab=active&quot;&gt;sandbox&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-10-02T15:17:11.180" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25178" PostTypeId="2" ParentId="25175" CreationDate="2022-10-02T15:31:57.807" Score="5" Body="&lt;p&gt;If I may summarize your complaint how I see it:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;There is often a question which you would like to answer but which is closed as unclear. It's up to the original asker to clarify their challenge, but often times they just don't care and are willing to leave their challenge closed.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is unfortunate. However there is no challenge dibs.  Just because someone posed an unclear version of the challenge does not mean that they own the idea. (They don't even really have control over the text, as to post it they have to license it under a creative commons license) If you think there is a clear version of the challenge and you are willing to put in the effort it would be &lt;em&gt;great&lt;/em&gt; if you could ask the challenge yourself.&lt;/p&gt;&#xA;&lt;p&gt;That's totally encouraged! You are encouraged to ask your own version of a challenge with cleared up specs, even if it's just because you want to post an answer.  We'd appreciate it if you were forward about this; saying something like &amp;quot;I saw this old challenge I wanted to answer but it was closed.  Here's my version of it so we can all have a go at it.&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;I am also contractually obligated to mention the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/&quot;&gt;sandbox&lt;/a&gt;, which can be a good place to work with the community to ensure your challenge is clear before you post it.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2022-10-02T15:31:57.807" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25180" PostTypeId="2" ParentId="2140" CreationDate="2022-10-03T13:12:02.077" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/252621/which-weekday-was-it&quot;&gt; Which weekday was it?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110681" LastEditorUserId="110681" LastEditDate="2022-10-05T14:43:27.300" LastActivityDate="2022-10-05T14:43:27.300" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25181" PostTypeId="1" CreationDate="2022-10-03T13:36:53.400" Score="10" ViewCount="410" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19271/reviving-language-of-the-month-pick-up-where-we-left-off-or-start-over&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout October 2022, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Nim&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;What's a Language of the Month?&lt;/h2&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19279/nominations-for-language-of-the-month-take-2?answertab=scoredesc#tab-top&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during October, those who wish to participate should learn (at least the basics of) Nim, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about Nim&lt;/h2&gt;&#xA;&lt;p&gt;The Nim programming language is a ergonomic general purpose programming language, featuring:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Concise string handling&lt;/li&gt;&#xA;&lt;li&gt;First class functions, called &amp;quot;procedural types&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;User-defined iterators&lt;/li&gt;&#xA;&lt;li&gt;Metaprogramming of all sorts, everything from text-substitution, to macros that operate on its AST (&lt;a href=&quot;https://hookrace.net/blog/introduction-to-metaprogramming-in-nim/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Introduction to metaprogramming in Nim&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Great C/C++/JS interop&lt;/li&gt;&#xA;&lt;li&gt;Large stdlib&lt;/li&gt;&#xA;&lt;li&gt;Usually quick compile/run time (good for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;fastest-code-container&quot;&gt;fastest-code&lt;/a&gt; challenges)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;p&gt;Nim has a very active community (&lt;a href=&quot;https://forum.nim-lang.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;forum&lt;/a&gt;, &lt;a href=&quot;https://reddit.com/r/nim&quot; rel=&quot;nofollow noreferrer&quot;&gt;subreddit&lt;/a&gt;). It can be run online at &lt;a href=&quot;https://tio.run/#nim&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt; and &lt;a href=&quot;https://ato.pxeger.com/run?L=nim&quot; rel=&quot;nofollow noreferrer&quot;&gt;ATO&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;A quick intro, covering only the most basic constructs:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://narimiran.github.io/nim-basics/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Nim basics&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For more extensive reading:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://nim-lang.org/install.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Installation instructions&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/nim-lang/Nim/wiki/Nim-for-C-programmers&quot; rel=&quot;nofollow noreferrer&quot;&gt;For C Programmers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/nim-lang/Nim/wiki/Nim-for-Python-programmers&quot; rel=&quot;nofollow noreferrer&quot;&gt;For Python Programmers&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://nim-lang.org/documentation.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;More extensive resources&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/101179/tips-for-golfing-in-nim&quot;&gt;Tips for golfing in Nim&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="80214" LastActivityDate="2022-10-25T08:53:41.793" Title="Language of the Month for October 2022: Nim" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25182" PostTypeId="2" ParentId="25181" CreationDate="2022-10-03T13:38:03.583" Score="5" Body="&lt;h1&gt;List of all Nim answers posted in October 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/252442/repeat-values-in-array/252591#252591&quot;&gt;Repeat Values In Array&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245318/draw-the-ukrainian-flag/252592#252592&quot;&gt;Draw the Ukrainian Flag&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/252680/104836&quot;&gt;Cat goes &amp;quot;Meow&amp;quot;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104836/qaziquza&quot;&gt;Qaziquza&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/252621/which-weekday-was-it/252687#252687&quot;&gt;Which weekday was it?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812/michael-chatiskatzi&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224000/are-all-the-items-the-same/252613#252613&quot;&gt;Are All the Items the Same?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812/michael-chatiskatzi&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241080/is-it-a-pure-word/252675#252675&quot;&gt;Is it a pure word?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812/michael-chatiskatzi&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/135942/implement-a-strange-automaton/252731#252731&quot;&gt;Implement a strange automaton&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812/michael-chatiskatzi&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/252851/104836&quot;&gt;Mix pi and e to make pie!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104836/qaziquza&quot;&gt;Qaziquza&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/167818/concatenating-n-with-n-1/252887#252887&quot;&gt;Concatenating n with n + 1&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/150563/modulus-summation/252888#252888&quot;&gt;Modulus Summation&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/167818/concatenating-n-with-n-1/252926#252926&quot;&gt;Concatenating n with n + 1&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812/michael-chatiskatzi&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/253735/78274&quot;&gt;Implement the flip-floperator&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78274/kirill-l&quot;&gt;Kirill L.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant tips posted in October 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/252588/90812&quot;&gt;Use on and off as a boolean value&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90812/michael-chatiskatzi&quot;&gt;Michael Chatiskatzi&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;tip summary&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant challenges posted in October 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="80214" LastEditorUserId="78274" LastEditDate="2022-10-25T08:53:41.793" LastActivityDate="2022-10-25T08:53:41.793" CommentCount="0" CommunityOwnedDate="2022-10-03T13:38:03.583" ContentLicense="CC BY-SA 4.0" />
  <row Id="25183" PostTypeId="1" CreationDate="2022-10-03T16:39:57.903" Score="10" ViewCount="226" Body="&lt;p&gt;We have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/&quot;&gt;list of standard loopholes&lt;/a&gt; which are forbidden by default.&lt;/p&gt;&#xA;&lt;p&gt;This is pretty good, it does good for the site.  But it's also 8 years old, and it is showing its age.&lt;/p&gt;&#xA;&lt;p&gt;We occasionally inaugurate new loopholes with 5-20 votes, while answers posted very early on have score in the triple digits with 100-400 votes. It makes me wonder how many of these are simply riding on inertia vs. how many of these actually have broad support from the active community.&lt;/p&gt;&#xA;&lt;p&gt;I honestly think that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1071/&quot;&gt;this loophole&lt;/a&gt; would be a lot more contentious today than the votes show. We've talked extensively about this on meta and attitudes have pretty significantly changed.&lt;/p&gt;&#xA;&lt;p&gt;To play devils advocate, one might say that we just got the important ones early on so of course they would have more votes. People don't vote as often on new loopholes because the are not as important and usually pretty niche.&lt;/p&gt;&#xA;&lt;p&gt;However we still have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1828/56656&quot;&gt;a loophole&lt;/a&gt; for solutions to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;underhanded-container&quot;&gt;underhanded&lt;/a&gt; challenges, with over 200 score. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;underhanded-container&quot;&gt;underhanded&lt;/a&gt; challenges &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8326/56656&quot;&gt;were banned&lt;/a&gt; two years after the loopholes, so an loophole that is completely irrelevant has sat there for 6 years without any significant reassessment. Now the moderators can delete it, and we did delete &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1657/56656&quot;&gt;the other underhanded specific loophole&lt;/a&gt; back in 2020 (It also had over 200 votes at the time of deletion), but the point here is that the vote totals do not reflect modern community consensus.&lt;/p&gt;&#xA;&lt;p&gt;The other thing that motivates this proposal is simply the opportunity provided by a retrospective. When we made the original post it was an experiment.  We have the experience to propose more informed loopholes.  Or even to tweak the rules around loopholes.&lt;/p&gt;&#xA;&lt;h2&gt;Proposal&lt;/h2&gt;&#xA;&lt;p&gt;If there is a clear consensus to do this I will post a new loophole question as a community wiki. A notice will be added to the old loophole question directing users to the new question. The old loopholes will remain in effect for 2 weeks giving the new loopholes time to settle and then a moderator will lock the old post as &amp;quot;Obsolete&amp;quot; and the new loopholes will be in force.&lt;/p&gt;&#xA;&lt;p&gt;As for the new loophole question, the rules will remain the same: +5 score and twice as many upvotes as downvotes deems a loophole unacceptable.  I will ask that people not copy text from the old loopholes, and instead restate the loophole in their own words and provide their own argument in favor of it.  This should hopefully discourage low effort poll-style answers and encourage people to only post loopholes they actually agree with.&lt;/p&gt;&#xA;&lt;h2&gt;Risks&lt;/h2&gt;&#xA;&lt;p&gt;This is a proposal to change some of the most basic rules of the site, and drastic changes are possible. Old loopholes could become legal and (although less likely) things previously legal could become loopholes. This is a risk, but the process is democratic, so if there is some drastic change 2/3 of the active community wants it might paradoxically make this risk a necessity.&lt;/p&gt;&#xA;&lt;p&gt;Additionally it's possible it might take more than the 2 weeks I've allotted for the new thread to settle into a consensus. This would require us to either extend this period or move forward into uncertainty.&lt;/p&gt;&#xA;&lt;h2&gt;Discussion&lt;/h2&gt;&#xA;&lt;p&gt;For discussion here I think we need to cover if the community wants this at all.  But I would also like to get feedback and suggestions on the details.  Do we want to change the rules for loopholes while we are doing this? Do we want a 2 week grace period? Are there any other things the community wants to tweak?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="66833" LastEditDate="2022-10-03T16:45:15.300" LastActivityDate="2022-10-07T14:56:34.983" Title="Should we refresh our standard loopholes?" Tags="|discussion|policy|defaults|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25184" PostTypeId="2" ParentId="2140" CreationDate="2022-10-03T18:58:36.013" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/253639/show-a-balanced-binary-tree&quot;&gt;Show a balanced binary tree&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2022-10-22T23:31:04.880" LastActivityDate="2022-10-22T23:31:04.880" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25185" PostTypeId="1" AcceptedAnswerId="25186" CreationDate="2022-10-03T20:34:09.987" Score="1" ViewCount="55" Body="&lt;p&gt;Some, but not all, of the paragraphs on &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;the election page&lt;/a&gt; have broken word wrapping. Here's a screenshot of what I see for lyxal's answers to questions 5 and 6:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/gYoNj.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/gYoNj.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The question 5 paragraph is wrapping a bunch of lines mid-word, leaving only one letter at the beginning or end of the line, for no apparent reason. The question 6 paragraph is completely normal. If it matters, I'm on Firefox 105 on Kubuntu 22.04, with a 1920x1080 screen resolution and 100% scaling.&lt;/p&gt;&#xA;" OwnerUserId="81540" LastEditorUserId="109916" LastEditDate="2022-10-05T04:37:49.940" LastActivityDate="2022-10-05T04:37:49.940" Title="Word wrapping is broken on the election page" Tags="|bug|status-completed|election|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25186" PostTypeId="2" ParentId="25185" CreationDate="2022-10-03T22:07:09.913" Score="2" Body="&lt;p&gt;It's fixed now, thanks to Catija. See &lt;a href=&quot;https://meta.stackexchange.com/q/382528/323179&quot;&gt;Prevent nonbreaking spaces from making an election completely non-responsive&lt;/a&gt;. It is apparently a bad idea to use nonbreaking spaces in a nomination, especially in the election phase.&lt;/p&gt;&#xA;" OwnerUserId="66025" LastActivityDate="2022-10-03T22:07:09.913" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25189" PostTypeId="2" ParentId="25183" CreationDate="2022-10-05T04:48:53.057" Score="1" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;I agree with this. The post is quite old, and I think it's a good idea to refresh and restart. Of course we would have to transfer over many, but I think the main reason of doing so, is to especially incorporate new illegal loopholes that have low votes, which I agree with.&lt;/p&gt;&#xA;&lt;p&gt;I also think the risk should be manageable. We should have a grace period for a few weeks for users to follow the old post before starting to follow the new post.&lt;/p&gt;&#xA;&lt;p&gt;That post was created 8 years ago, surely it requires a reboot? :3&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Suggestion: Separate loophole threads for separate types of challenges - @mousetail&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;To briefly answer this I don't think this is really viable as it would be quite messy with so many posts to consider and it might be better to leave them all in 1 post to ensure better readability for new users especially.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;That said, I'll be glad to help out with creating the answers and possibly the question itself.&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-10-07T06:32:14.367" LastActivityDate="2022-10-07T06:32:14.367" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25190" PostTypeId="1" CreationDate="2022-10-05T07:00:13.807" Score="14" ViewCount="97" Body="&lt;p&gt;The nomination posts for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/23771/16766&quot;&gt;Learn You a Lang for Great Good&lt;/a&gt; (LYAL) and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/19279/16766&quot;&gt;Language of the Month&lt;/a&gt; (LOTM) have a lot of good resources about most languages posted. This provides a very solid starting point for those wanting to learn to golf in some language. However, not every language can be nominated and I think it would be useful to have this information available for more languages, even those that would not be a good fit for LOTM.&lt;/p&gt;&#xA;&lt;p&gt;The current template for a language's main &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; question seems to be something like this:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Does anyone have tips on how to golf in this language? Please one tip per answer and avoid posting simple and general tips such as &amp;quot;remove whitespace&amp;quot;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I suggest something like this:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Quick one sentence summary of the language&lt;/p&gt;&#xA;&lt;h2&gt;Notable features&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;List of notable features, keep this very short, actual tips should be answers&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;List of resources&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Where to run&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;List of notable online interpreters&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Does anyone have tips on how to golf in this language? Please one tip per answer and avoid posting simple and general tips such as &amp;quot;remove whitespace&amp;quot;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This way we'll have a nice central repository for resources on every language.&lt;/p&gt;&#xA;&lt;p&gt;There would be no need to fill in every column when creating a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; post, you can leave some of it empty for others to fill in. There could be extra sections added depending on the language too.&lt;/p&gt;&#xA;&lt;p&gt;If you did not build the language yourself, I'd suggest making the post a community wiki.&lt;/p&gt;&#xA;&lt;p&gt;Is this a good idea? Bad idea? If so, would it be acceptable to edit old &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; questions to fit this format?&lt;/p&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="16766" LastEditDate="2022-10-05T19:35:25.183" LastActivityDate="2022-10-18T17:29:20.077" Title="Make each language's official [tips] page look more like the LYAL and LOTM templates?" Tags="|discussion|tips|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25191" PostTypeId="1" CreationDate="2022-10-05T14:00:38.627" Score="8" ViewCount="167" Body="&lt;p&gt;Recently, TNB conducted an experiment in which we &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/24680/79857&quot;&gt;created&lt;/a&gt; a &lt;a href=&quot;https://chat.stackexchange.com/rooms/136286/off-topic-tnb&quot;&gt;new room&lt;/a&gt; specifically for off-topic discussion, which resulted in a marked decrease in the amount of off-topic content in TNB. This room has now been around and active for over five months. Should we &amp;quot;officially recognize&amp;quot; it and add it to the room description for TNB?&lt;/p&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="79857" LastEditDate="2022-10-10T15:26:04.940" LastActivityDate="2022-10-10T15:26:04.940" Title="Should we officially recognize Off-Topic TNB?" Tags="|discussion|chat|" AnswerCount="3" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25192" PostTypeId="2" ParentId="25191" CreationDate="2022-10-05T14:10:01.977" Score="-1" Body="&lt;h2&gt;Maybe, but not yet&lt;/h2&gt;&#xA;&lt;p&gt;As I &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/62137634#62137634&quot;&gt;said in chat&lt;/a&gt;, OTTNB is, in my opinion, too young to be &amp;quot;officially&amp;quot; recognised. Spin off chat rooms from TNB come into existence, last a while, then die out and freeze. It's been happening almost continually for the past 10 years on this site. For example, &lt;a href=&quot;https://chat.stackexchange.com/transcript/66464&quot;&gt;Das Neunzehnte Byte&lt;/a&gt; (TNB but in German); the same room, but in French; the TNB Stars room, and countless others.&lt;/p&gt;&#xA;&lt;p&gt;Given that the room description is probably the most official information center relating to TNB, any room we endorse in it should be absolutely official. While OTTNB is looking active and maintaining, I for one don't want to endorse a room as official unless I know that it'll stay active for a long period of time. There's no real rush behind this either; there's enough off-topic activity in TNB that we move messages to OTTNB semi-regularly, it's fairly easy to find on our &lt;a href=&quot;https://chat.stackexchange.com/?tab=site&amp;amp;sort=active&amp;amp;host=codegolf.stackexchange.com&quot;&gt;site chat rooms&lt;/a&gt;, and if people want to hang out there regularly, they can star the room.&lt;/p&gt;&#xA;&lt;p&gt;Personally, I'd rather wait a while longer to see whether or not OTTNB stays active over the long term or not, before deeming it an &amp;quot;official&amp;quot; room.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-10-05T14:10:01.977" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25193" PostTypeId="2" ParentId="25191" CreationDate="2022-10-05T14:16:22.530" Score="8" Body="&lt;h2&gt;Yes&lt;/h2&gt;&#xA;&lt;p&gt;I see no disadvantages of doing so.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The room will gain activity just by having a link visible&lt;/li&gt;&#xA;&lt;li&gt;This will prevent off topic chat in TNB&lt;/li&gt;&#xA;&lt;li&gt;There will always be off topic discussions.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It's true that there have been many rooms for this purpose. I think this only shows the demand for such a room is strong.&lt;/li&gt;&#xA;&lt;li&gt;If a listed officially they will coalesce in the linked room since that one is the most easily accessible. In the old situation people might create a new room each time, and it makes sense old ones would die and get frozen. Not so if it's officially listed and easily accessible.&lt;/li&gt;&#xA;&lt;li&gt;Yes, there will be periods of high and low activity but when activity is high it will always be in that room. The room might seem dead for some periods but activity will pick back up.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;If activity ever ceases for a long period it's very easy to simply remove the link again&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="109916" LastEditDate="2022-10-05T14:32:50.270" LastActivityDate="2022-10-05T14:32:50.270" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25194" PostTypeId="2" ParentId="25191" CreationDate="2022-10-05T14:36:15.433" Score="4" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;Adding on to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25193/108218&quot;&gt;mousetail's answer&lt;/a&gt;, CGSE is a very active site, with many users on chat constantly, and therefore has high chat activity. Therefore, it is good to have a separate chartroom for separate stuff, lest it becomes too messy. I've been on the chat recently and sometimes I talk about off-topic stuff.&lt;/p&gt;&#xA;&lt;p&gt;Of course, you can guess what happened. Another group of people were talking about golfing, while I and someone else were talking about off-topic stuff. Our messages overlayed and it got messy and confusing quick.&lt;/p&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="108218" LastEditDate="2022-10-05T14:54:44.910" LastActivityDate="2022-10-05T14:54:44.910" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25199" PostTypeId="2" ParentId="2140" CreationDate="2022-10-06T18:37:19.490" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/252942/a-decimal-based-unit-of-time&quot;&gt;A decimal-based unit of time&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="114446" LastEditorUserId="114446" LastEditDate="2022-12-22T12:14:55.970" LastActivityDate="2022-12-22T12:14:55.970" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25200" PostTypeId="2" ParentId="2140" CreationDate="2022-10-06T18:41:16.333" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/252927/make-a-court-transcriber&quot;&gt;Make a Court Transcriber&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2022-10-10T14:45:14.217" LastActivityDate="2022-10-10T14:45:14.217" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25201" PostTypeId="2" ParentId="2140" CreationDate="2022-10-06T20:07:03.867" Score="1" Body="&lt;h1&gt;Partition square into squares&lt;/h1&gt;&#xA;&lt;p&gt;Given integers &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;, randomly output a list of &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; numbers between &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt; (inclusive) such that the sum of the squares of the numbers in the list is equal to &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; squared. In other words, find a way to randomly split &lt;span class=&quot;math-container&quot;&gt;\$n^{2}\$&lt;/span&gt; into &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; squares between &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$m^{2}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If there is no solution (which may happen if &lt;span class=&quot;math-container&quot;&gt;\$k = 2\$&lt;/span&gt;), you may exit from your program or return an error.&lt;/p&gt;&#xA;&lt;p&gt;The program should take less than 40 seconds for inputs with &lt;span class=&quot;math-container&quot;&gt;\$k, n, m\$&lt;/span&gt; less than 10000.&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so the smallest score in bytes wins.&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;Three numbers &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt;, and &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;A random list of &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; numbers between &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$m\$&lt;/span&gt;, such that the sum of the squares of them is equal to &lt;span class=&quot;math-container&quot;&gt;\$n^{2}\$&lt;/span&gt;. All possible lists that satisfy the conditions should be equally likely.&lt;/p&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input (n, m, k)      Possible output&#xA;114, 100, 6          [13, 1, 25, 76, 44, 67]&#xA;114, 100, 6          [64, 58, 20, 32, 64, 4]&#xA;57, 40, 7            [2, 32, 18, 26, 26, 17, 16]&#xA;7, 10000, 2          [error]&#xA;7, 7, 3              [2,3,6], [2,6,3], [3,2,6], [3,6,2], [6,2,3], [6,3,2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="108564" LastEditorUserId="108564" LastEditDate="2022-10-06T21:04:49.307" LastActivityDate="2022-10-06T21:04:49.307" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25207" PostTypeId="2" ParentId="20722" CreationDate="2022-10-07T01:56:26.827" Score="11" Body="&lt;h1&gt;&lt;a href=&quot;https://www.python.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;Python&lt;/a&gt;, 65 bytes&lt;/h1&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;my_name=&amp;quot;Adam&amp;quot;&#xA;print(&amp;quot;.&amp;quot;.join(map(str,map(ord,my_name.lower()))))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://ato.pxeger.com/run?1=m72soLIkIz9vwYKlpSVpuhY3HXMr4_MSc1NtlRxTEnOVuAqKMvNKNJT0lPSy8jPzNHITCzSKS4p0QHR-UYoOVLVeTn55apGGJghADIKaBzMXAA&quot; rel=&quot;nofollow noreferrer&quot;&gt;Attempt This Online!&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="113573" LastActivityDate="2022-10-07T01:56:26.827" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25208" PostTypeId="2" ParentId="25183" CreationDate="2022-10-07T06:43:04.873" Score="9" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The current loophole prohibitions are working well for us.&lt;/li&gt;&#xA;&lt;li&gt;They were established when the site (and especially Meta) was much more active, and included some legendary users that are not around any more &lt;s&gt;(and some of the posts are a tribute to their legacy)&lt;/s&gt;. I fear that we'll not get the same kind of participation in establishing overhauled rules.&lt;/li&gt;&#xA;&lt;li&gt;Starting over is unnecessary work for everyone.&lt;/li&gt;&#xA;&lt;li&gt;The obsolete ones are harmless.&lt;/li&gt;&#xA;&lt;li&gt;There are a great number of comment links to existing rules, and these cannot (easily) be updated.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="43319" LastEditorUserId="43319" LastEditDate="2022-10-07T14:56:34.983" LastActivityDate="2022-10-07T14:56:34.983" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25209" PostTypeId="2" ParentId="2140" CreationDate="2022-10-07T07:04:08.630" Score="2" Body="&lt;h1&gt;Infinite Integer Derivative &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;We can consider the derivative of a integer sequence to simply be the difference between each element and the next:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1  5  8  13  2&#xA; 4  3  5  -11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note this will produce a sequence one shorter than the original. We can repeat this process to find the second derivative:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;-1 2 -16&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And continue this process till there is one element left.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Conjecture&lt;/strong&gt; A sequence of length &lt;code&gt;n&lt;/code&gt; can be exactly represented by first element of each integer derivative. We call this the infinite integer derivative.&lt;/p&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;              [8   4  12   6  3]&#xA;8              [-4  8   -6  -3]&#xA;8 -4             [12 -14  3]&#xA;8 -4 12           [-26  11]&#xA;8 -4 12 -26          [37]&#xA;8 -4 12 -26 37&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Example python code:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;f = lambda x:x and [x[0]]+f([x[i]-x[i-1] for i in range(1,len(x))])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note there may be more efficient ways to compute values than this formula.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;{&#xA;    [1,2,3,4,5]:    [1,1,0,0,0],&#xA;    [1,2,1,2,1]:    [1,1,-2,4,8],&#xA;    [1,2,4,8,16]:   [1,1,1,1,1],&#xA;    [5,1,-1,0,6,3]: [5,-4,2,1,1,-17],&#xA;    []:             [],&#xA;    [12]:           [12],&#xA;    [5,5,5,5,5,4]:  [5,0,0,0,-1],&#xA;    [5,4]:          [5,-1]&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2022-10-12T06:11:59.320" LastActivityDate="2022-10-12T06:11:59.320" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25210" PostTypeId="2" ParentId="2140" CreationDate="2022-10-07T09:52:57.340" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/252993/partial-fractions&quot;&gt;Partial Fractions&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="109916" LastEditorUserId="109916" LastEditDate="2022-10-11T06:17:23.060" LastActivityDate="2022-10-11T06:17:23.060" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25212" PostTypeId="2" ParentId="2140" CreationDate="2022-10-07T19:21:22.400" Score="6" Body="&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;Raku's &lt;a href=&quot;https://docs.raku.org/language/operators#infix_...&quot; rel=&quot;nofollow noreferrer&quot;&gt;sequence operator&lt;/a&gt; is very flexible.  It does a lot of different things, but for the purposes of this challenge, we'll focus on two particular features:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Given two integers, it counts up or down as appropriate.  &lt;code&gt;1 ... 5&lt;/code&gt; =&amp;gt; &lt;code&gt;(1, 2, 3, 4, 5)&lt;/code&gt;; &lt;code&gt;9 ... 5&lt;/code&gt; =&amp;gt; &lt;code&gt;(9, 8, 7, 6, 5)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;It can occur multiple times in the same expression, and will count up or down from one argument to the next.  &lt;code&gt;4 ... 6 ... 3 ... 1 ... 2&lt;/code&gt; =&amp;gt; &lt;code&gt;(4, 5, 6, 5, 4, 3, 2, 1, 2)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Write a function that accepts a list of integers (or a number of integer parameters) and returns a list of the integers that would be produced by inserting Raku's sequence operator between the input integers.  That is, between each adjacent pair of input numbers &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt;, insert an ascending sequence of integers from &lt;code&gt;a + 1&lt;/code&gt; to &lt;code&gt;b - 1&lt;/code&gt; if &lt;code&gt;a &amp;lt; b&lt;/code&gt;, and a descending sequence of integers from &lt;code&gt;a - 1&lt;/code&gt; to &lt;code&gt;b + 1&lt;/code&gt; if &lt;code&gt;a &amp;gt; b&lt;/code&gt;.  But also:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If &lt;code&gt;| a - b | == 1&lt;/code&gt;, insert nothing between them.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;a == b&lt;/code&gt;, include just one copy of &lt;code&gt;a&lt;/code&gt; in the output list.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Lowest byte count wins.  Raku answers which employ the sequence operator are disallowed.&lt;/p&gt;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;1, 5 -&amp;gt; (1, 2, 3, 4, 5)&#xA;20, 17 -&amp;gt; (20, 19, 18, 17)&#xA;1, 3, 1 -&amp;gt; (1, 2, 3, 2, 1)&#xA;1, 3, 3, 3, 3, 3, 5 -&amp;gt; (1, 2, 3, 4, 5)&#xA;5, 4, 6, 3, 7 -&amp;gt; (5, 4, 5, 6, 5, 4, 3, 4, 5, 6, 7)&#xA;100, 100, 100, 100 -&amp;gt; (100)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="58215" LastEditorUserId="58215" LastEditDate="2022-10-08T04:33:58.153" LastActivityDate="2022-10-08T04:33:58.153" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25215" PostTypeId="1" CreationDate="2022-10-07T22:00:21.090" Score="6" ViewCount="132" Body="&lt;p&gt;A couple of minutes ago &lt;a href=&quot;https://codegolf.stackexchange.com/questions/252637/incomparable-partitions&quot;&gt;this question&lt;/a&gt; of mine was reopened.  I initially closed it as unclear because after seeing the answers I feel that what is and isn't acceptable as an IO format is unclear. Specifically I don't know what qualifies as &amp;quot;reasonable&amp;quot; when it comes to string representations of lists. Some string formats that would usually qualify as reasonable completely trivialize the task. It's not clear to me when a string format stops being reasonable, and I don't want to disallow string formats all together. To be clear I don't think the word &amp;quot;reasonable&amp;quot; always makes a challenge unclear.  There are plenty of cases where the IO can say &amp;quot;reasonable equivalent&amp;quot; and it's no issue in my opinion.  Most challenges there is IO format that's fine and IO format that's cheating and there's not really any murkiness between them. It's just here specifically I believe that there is an issue.&lt;/p&gt;&#xA;&lt;p&gt;I'd really like to have the question closed so that no new answers come while I figure out what I want and what I mean. I'm not even sure this can be put into objective criteria. But it's not closed, the community reopened it.  As I see it I have a few options:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Leave it alone, allow people to interpret &amp;quot;reasonable&amp;quot; however they feel.  Something I feel sort of ruins my challenge.&lt;/li&gt;&#xA;&lt;li&gt;Leave it as is until I get my ideas sorted than edit the challenge making some answers invalid.&lt;/li&gt;&#xA;&lt;li&gt;Use my mod powers to hammer it closed again.&lt;/li&gt;&#xA;&lt;li&gt;Edit the question now to make the un-clarity more obvious, and hope that it gets closed again.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;None of these seem at all like good options.&lt;/p&gt;&#xA;&lt;p&gt;So my question is really what action should I take?  Is there something I haven't considered?&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2022-10-10T07:33:44.463" Title="My question was reopened. I don't think it's clear. What should I do?" Tags="|discussion|reopening|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25216" PostTypeId="2" ParentId="25215" CreationDate="2022-10-07T22:51:35.127" Score="-3" Body="&lt;p&gt;I would recommend a different strategy: Leave the current question as-is (or potentially make the input format even more permissive), and later post a new question once you have figured out the requirements that you think make for a better challenge. If the current version of the challenge is &amp;quot;ruined&amp;quot; and the new version that comes later is &amp;quot;good&amp;quot; then I think they would have to be different enough to not be duplicates.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastEditorUserId="71434" LastEditDate="2022-10-07T23:19:41.890" LastActivityDate="2022-10-07T23:19:41.890" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25217" PostTypeId="1" AcceptedAnswerId="25220" CreationDate="2022-10-08T03:02:15.647" Score="-3" ViewCount="175" Body="&lt;p&gt;Recently in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/252621/which-weekday-was-it&quot;&gt;this&lt;/a&gt; question, I had a discussion with ████████████████ whether I should get rid of built-ins.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I'm VTCing this since the built-in ban is particulary subjective here. I'd recommend just getting rid of it, and maybe &lt;i&gt;encouraging&lt;/i&gt; not using built-ins.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Apparently, the question got closed, however when I added this, it was reopened:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;EDIT:&lt;/strong&gt; When I said &amp;quot;No built-ins&amp;quot;, I meant that &lt;em&gt;built-ins that automatically calculate the weekday for a particular date were discouraged,&lt;/em&gt; not prohibited. If the built-in aids in finding the weekday, no problem, but if it directly calculates the weekday then I &lt;em&gt;discourage&lt;/em&gt; it&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;After that, this is what ████████████████ posted (second part is irrelevant here):&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;@py3programmer &amp;quot;so shortest answer (that doesn't use built-ins) wins&amp;quot; is a clear statement that built-ins invalidate answers. Also, for the built-in answers won't be accepted part...&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;So the point of this is that should I explicitly &lt;strong&gt;allow&lt;/strong&gt; built-ins or disallow them?&lt;/p&gt;&#xA;&lt;p&gt;As it stands, I'm all for built-ins but I'm not accepting any of them as they normally take lesser bytes than a non-built-in answer. What I fear is that answers like the &lt;a href=&quot;https://codegolf.stackexchange.com/a/252644/110681&quot;&gt;05AB1E one&lt;/a&gt; will not have a chance as they cannot compete with built-in answers (since doing formulas takes more bytes).&lt;/p&gt;&#xA;&lt;p&gt;This is the midline: allowing all languages to compete fairly.&lt;/p&gt;&#xA;&lt;p&gt;But, as I see it, ████████████████ wants it another one of these ways:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Invalidate built-ins that calculate weekdays automatically completely&lt;/li&gt;&#xA;&lt;li&gt;Freely allow built-ins and give them a chance to be accepted too&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Well I find two problems in these approaches, one for each:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Already 24 answers are posted, majority using built-ins. I don't want to invalidate those majority using a single approach; it could cause outrage&lt;/li&gt;&#xA;&lt;li&gt;Same as above; built-in answers take lesser bytes (normally) and so will find it much easier to get accepted. Answers lacking built-ins will find it really hard to get accepted, and the competition will be unfair.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;These are obviously not the &lt;em&gt;only&lt;/em&gt; possible approaches; you can post your own.&lt;/p&gt;&#xA;&lt;p&gt;The answer that has good reasons and can be tried without risk  and which comes within 7 days will be accepted. Accepted answers will be tried upon.&lt;/p&gt;&#xA;&lt;p&gt;What should I do?&lt;/p&gt;&#xA;&lt;p&gt;Note: apparently this is my first meta question, if there are any suggestions write to me in the comments!&lt;/p&gt;&#xA;" OwnerUserId="110681" LastEditorUserId="109916" LastEditDate="2022-10-11T02:22:42.397" LastActivityDate="2022-10-11T02:22:42.397" Title="Built-ins or no built-ins; a dilemma in my question" Tags="|discussion|rules|asking-questions|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25219" PostTypeId="2" ParentId="2140" CreationDate="2022-10-08T19:14:19.907" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257097/best-iterated-prisoners-dilemma-move&quot;&gt;Best Iterated Prisoner's Dilemma&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2023-01-26T14:16:19.523" LastActivityDate="2023-01-26T14:16:19.523" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25220" PostTypeId="2" ParentId="25217" CreationDate="2022-10-09T00:03:52.593" Score="9" Body="&lt;p&gt;&lt;em&gt;Disclaimer: I am relatively new to Code Golf, so I definitely cannot speak for the community.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Generally forbidding any built-ins is bad practice. For one, it's not clear what built-in functions are actually disallowed, since how much of the work a built in does before it's disqualifying is subjective. From Adám (in the comments to your post):&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;What exactly do you mean by &amp;quot;built-ins&amp;quot;? Does it only cover things to solve the entire problem, like Mathematica's DayName or does it include any type of date-handling capability? Isn't + a built-in?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;How about a built-in that computes a date serial number (number of days since an epoch)? Such a number has the inherent property which is its remainder when divided by seven, and that's the weekday. Forbidden or not? Also, you allow built-in date objects, but they might well have an accessible day-of-week property. Forbidden or not?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;It seems your primary concern is that some languages without built-ins that can solve most of the problem will be left behind, but that's true for every code golf challenge. Some languages are always going to fare worse than others; BrainFuck answers are basically never shorter than Vyxal answers, but that doesn't mean that we should ban most of the functions in Vyxal because BrainFuck doesn't have them.&lt;/p&gt;&#xA;&lt;p&gt;But I think the primary issue here is a lack of clarity: you seem to be saying that you want people to post all answers, including those that use built-ins, but that you weren't going to &lt;em&gt;accept&lt;/em&gt; (give a check mark to) any answers that you deemed as too reliant on built-ins. And that's fine -- honestly, it doesn't really matter what answer you accept; I don't think people really care. However, people interpreted that statement as meaning that you didn't want anyone to answer with &amp;quot;built-ins&amp;quot;, whatever those are.&lt;/p&gt;&#xA;" OwnerUserId="113573" LastActivityDate="2022-10-09T00:03:52.593" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25221" PostTypeId="2" ParentId="25217" CreationDate="2022-10-09T01:28:24.443" Score="8" Body="&lt;p&gt;I'm just gonna briefly challenge the entire premise of the question: regardless of what the answer is, you shouldn't accept any answer, builtin or not.&lt;/p&gt;&#xA;&lt;p&gt;I'll set aside the builtin ban question for the moment, and just address the implicit implication in the question: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/11620/66833&quot;&gt;stop accepting answers&lt;/a&gt; to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; challenges. At best, the fair thing to do is to constantly update the accepted answer as new answers are posted; at worst, you accept some arbitrary answer due to arbitrary disqualifications such as &amp;quot;it uses a builtin&amp;quot;. Additionally, accepting an answer is contrary to our policy that languages compete within themselves in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;. Accepting answers is, all around, a bad idea.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;But, returning to the builtin ban question: stop talking about builtins. Given the sheer variety of languages out there (600+ on TIO, which has been out of date for 3 years now), there's almost always going to be some language with some obscure, convoluted builtin that &amp;quot;trivialises&amp;quot; a challenge. And so what? If AmazingGolfLang can do your challenge in a single character, good for the language. No one else really cares - the intent behind golfing is to demonstrate clever tricks and coding in specific languages. We're all here to watch other people do these clever programming tricks, and to do them ourselves from time to time. Builtins are the exact opposite of this. They are trivial and boring, &lt;em&gt;but&lt;/em&gt; they do the challenge as specified, so they should be allowed. But, we shouldn't care.&lt;/p&gt;&#xA;&lt;p&gt;We already have an ability to reward clever solutions and &amp;quot;punish&amp;quot; boring ones&lt;sup&gt;1&lt;/sup&gt;: voting. People upvote clever but longer answers (after all, &lt;a href=&quot;https://codegolf.stackexchange.com/users/58563/arnauld&quot;&gt;Arnauld&lt;/a&gt;, who almost exclusively golfs in Javascript, is the third highest rep earner on the site), and will ignore trivial, single builtin answers. The system works as intended.&lt;/p&gt;&#xA;&lt;p&gt;Builtin-only answers are a problem that challenge authors create for themselves. Most of the time, it's unlikely to even arise, and when it does, voters make it clear how the community feels about such answers: bored apathy. Banning them in your challenge only serves to make your challenge unclear, and open for debate and closure. &lt;strong&gt;Don't worry about them&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sup&gt;&lt;sup&gt;1&lt;/sup&gt;: I say &amp;quot;punish&amp;quot;, but I feel this is inappropriately harsh. There is nothing inherently wrong with boring, builtin only answers. They shouldn't be downvoted, flagged or deleted. But, people who upvote interesting and clever answers will generally withhold their upvotes, and &amp;quot;punish&amp;quot;, these trivial builtin answers.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-10-09T01:28:24.443" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25222" PostTypeId="2" ParentId="2140" CreationDate="2022-10-09T06:20:16.563" Score="3" Body="&lt;h1&gt;Generate QR code from string&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary-matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary-matrix&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;binary-matrix&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;binary-matrix-container&quot;&gt;binary-matrix&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I'm surprised to have not seen anyone doing this particular challenge yet.&lt;/p&gt;&#xA;&lt;p&gt;The challenge is simple: Take input as a string, your task is to turn it into a QR code.&lt;/p&gt;&#xA;&lt;p&gt;This challenege originally requires outputting to an image (or any graphical output), but to relax the restrictions down, you only need to output the result as a matrix (or a 2D array). A binary string (with splits between) is also acceptable.&lt;/p&gt;&#xA;&lt;p&gt;And for sake of simplicity, you will only need to output a 25x25 QR code image (which is the most popular QR code size, I believe). For the input &lt;code&gt;Version 2&lt;/code&gt;, the image should look like this:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/b/b7/Qr-2.svg&quot; alt=&quot;Version 2 QR code on Wikipedia&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;You may not need to handle empty strings.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/p&gt;&#xA;&lt;h2&gt;More resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.m.wikipedia.org/wiki/QR_code&quot; rel=&quot;nofollow noreferrer&quot;&gt;QR Code on Wikipedia&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.m.wikipedia.org/wiki/Reed%E2%80%93Solomon_error_correction&quot; rel=&quot;nofollow noreferrer&quot;&gt;Reed–Solomon error correction&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="107017" LastEditorUserId="107017" LastEditDate="2022-10-10T06:07:20.730" LastActivityDate="2022-10-10T06:07:20.730" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="25223" PostTypeId="2" ParentId="2140" CreationDate="2022-10-10T03:17:44.960" Score="-4" Body="&lt;h1&gt;Is the UTF-1 string shorter than its UTF-8?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;decision-problem-container&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Backgrounds&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;explain utf-1 and utf-8&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Problem&lt;/h1&gt;&#xA;&lt;p&gt;Given a Unicode string, output a two distinct truthy or falsey value to represent whether its representation in UTF-1 is shorter than that in UTF-8.&lt;/p&gt;&#xA;&lt;h2&gt;I/O restriction&lt;/h2&gt;&#xA;&lt;p&gt;Input can be list of code point for each letter or string with consistent encoding except UTF-1. Output can be as in decision problem rule.&lt;/p&gt;&#xA;&lt;h1&gt;todo rules&lt;/h1&gt;&#xA;&lt;h1&gt;todo test cases&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Falsey for any string with nothing other than c such that U+0000&amp;lt;=c&amp;lt;=U+007F&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="113493" LastEditorUserId="113493" LastEditDate="2022-10-27T11:42:47.500" LastActivityDate="2022-10-27T11:42:47.500" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25224" PostTypeId="2" ParentId="25215" CreationDate="2022-10-10T07:33:44.463" Score="-2" Body="&lt;p&gt;I think now the milk is spilled and the only reasonable approach is leaving the challenge as is, even though you may consider it ruined. The community thinks it's valid; some interesting and uninteresting answers popped up - as always.&lt;/p&gt;&#xA;&lt;p&gt;Maybe consider posting your future challenges more frequently to our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/55372&quot;&gt;Sandbox&lt;/a&gt;, where such problems are more likely to be caught?&lt;/p&gt;&#xA;" OwnerUserId="55372" LastActivityDate="2022-10-10T07:33:44.463" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25225" PostTypeId="2" ParentId="5243" CreationDate="2022-10-10T14:02:22.463" Score="0" Body="&lt;h1&gt;100 rep for finding a two byte* solution to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/73828/is-it-a-lipogram&quot;&gt;Is it a lipogram?&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Use a language created** before this bounty&lt;/li&gt;&#xA;&lt;li&gt;Solve &lt;a href=&quot;https://codegolf.stackexchange.com/questions/73828/is-it-a-lipogram&quot;&gt;Is it a lipogram?&lt;/a&gt; in two bytes *or less&lt;/li&gt;&#xA;&lt;li&gt;**If the language is still in development, you may use any version of the language published before this bounty. (EDIT: bugfixes after this post are fine lol just dont cheat pls)&lt;/li&gt;&#xA;&lt;li&gt;Two bounties will be awarded, first come first serve:&lt;/li&gt;&#xA;&lt;li&gt;&lt;s&gt;If you take the longer string input as an array of characters***, you get the 50 rep bounty&lt;/s&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/73828/is-it-a-lipogram/252956#252956&quot;&gt;claimed!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;If you take both inputs as strings***, you get the 100 rep bounty&lt;/li&gt;&#xA;&lt;li&gt;***I recognize that an array of characters &lt;em&gt;is&lt;/em&gt; a string, but the distinction I intend to make here is as follows:&lt;/li&gt;&#xA;&lt;li&gt;If the user has to manually place spaces or commas (or some other delimiter) between each character of the string they intend to input, it is an &amp;quot;array of characters&amp;quot; for our purposes. If no delimiter between each character is required to be entered by the user, it is a &amp;quot;string&amp;quot; for our purposes&lt;/li&gt;&#xA;&lt;li&gt;Just bug me on this post to claim the bounty and ill add it soon as im online&lt;/li&gt;&#xA;&lt;li&gt;&lt;s&gt;Yes you can get both bounties at once lol&lt;/s&gt; no longer relevant&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Let me know if I need to clarify anything. I just think there should be a solution in two bytes or less. My idea would be something like &lt;code&gt;ToLowerCaseAll GetIndexOf&lt;/code&gt; for some stack language, but this has not been shown to be possible yet. Sorry if you intend to include these operators in your upcoming language, I'm still looking forward to it, &lt;s&gt;and I'll take my check in the mail.&lt;/s&gt;&lt;/p&gt;&#xA;" OwnerUserId="107310" LastEditorUserId="107310" LastEditDate="2022-10-10T18:12:26.970" LastActivityDate="2022-10-10T18:12:26.970" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25226" PostTypeId="2" ParentId="2140" CreationDate="2022-10-10T16:03:22.780" Score="4" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/253088/is-it-an-alphadrome&quot;&gt;Is it an alphadrome?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="11261" LastEditorUserId="11261" LastEditDate="2022-10-12T15:58:40.517" LastActivityDate="2022-10-12T15:58:40.517" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25227" PostTypeId="2" ParentId="2140" CreationDate="2022-10-10T18:02:15.670" Score="4" Body="&lt;h1&gt;Alternating sublists&lt;/h1&gt;&#xA;&lt;p&gt;Suppose a contiguous sublist that has at least three numbers and alternates between even and odd numbers (or odd and even) is called an alternating sublist. An alternating sublist cannot switch between alternating even and odd numbers to odd to even or vice versa.&lt;/p&gt;&#xA;&lt;p&gt;Given an input array, find the number of alternating sublists. Zero is considered even, and overlapping is allowed.&lt;/p&gt;&#xA;&lt;p&gt;For example, in the following input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1, 2, 3, 4, 6]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;There are three sublists of length 3, of which two are alternating &lt;code&gt;[1, 2, 3]&lt;/code&gt; and &lt;code&gt;[2, 3, 4]&lt;/code&gt;. &lt;code&gt;[3, 4, 6]&lt;/code&gt; is not an alternating as it contains two even numbers in a row.&lt;/p&gt;&#xA;&lt;p&gt;Also, there is one more alternating sublist with a length of 4 &lt;code&gt;[1, 2, 3, 4]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The entire string is not alternating, as two even numbers are in a row. Thus, the answer is 3.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;[2, 3, 4, 5] =&amp;gt; 3&#xA;[50, 50, 10, 80, 96] =&amp;gt; 0&#xA;[9, 8, 7, 2] =&amp;gt; 3&#xA;[2, 2, 2, 2, -555, 0] =&amp;gt; 1&#xA;[1, 2, 4, 6] =&amp;gt; 0&#xA;[10, 11, 12] =&amp;gt; 1&#xA;[98, 33, 11] =&amp;gt; 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(some test cases with negative numbers coming soon)&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Your score is the number of alternating substrings your program has. For scoring purposes, convert all non-numeric chars to their corresponding ASCII code. The tie-breaker is the shortest code. The winner is the answer with the lowest score.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;I think the scoring system may be better with &amp;quot;shortest code wins&amp;quot;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I also think the sentence &amp;quot;An alternating sublist cannot switch between alternating even and odd numbers to odd to even or vice versa.&#xA;&amp;quot; may be a little confusing, but I can't think of a good alternative.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2023-06-02T21:04:07.057" LastActivityDate="2023-06-02T21:04:07.057" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="25228" PostTypeId="2" ParentId="2140" CreationDate="2022-10-10T21:39:17.270" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/253127/does-the-sequence-shut-the-box&quot;&gt;Does the sequence shut the box?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="73054" LastEditorUserId="73054" LastEditDate="2022-11-03T15:06:39.353" LastActivityDate="2022-11-03T15:06:39.353" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25230" PostTypeId="2" ParentId="2140" CreationDate="2022-10-11T13:06:37.300" Score="4" Body="&lt;h1&gt;MD5 Hello, World!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/253296/41374&quot;&gt;Posted here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="41374" LastEditorUserId="41374" LastEditDate="2022-10-16T13:54:13.230" LastActivityDate="2022-10-16T13:54:13.230" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25231" PostTypeId="2" ParentId="2140" CreationDate="2022-10-11T16:04:25.687" Score="-3" Body="&lt;h1&gt;Do you trust this site?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;title is a work in progress&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This challenge is simple. Your program must take a URL (which will always exist) as input, download the file, and execute its contents as a program in the language your answer is in. The file will always be a valid program in your language.&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Language: Python&#xA;Input: https://gist.githubusercontent.com/GingerIndustries/d6f25007b45071e901b2b9057388d8f8/raw/25f838879fdc93f07394afc080eeef0993f55cbe/helloworld.py&#xA;Result: Program should print &amp;quot;Hello World!&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="108218" LastActivityDate="2022-10-11T16:04:25.687" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25232" PostTypeId="1" CreationDate="2022-10-11T20:01:01.157" Score="25" ViewCount="218" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/election/4&quot;&gt;Moderator election #4&lt;/a&gt; on Code Golf has come to a close, the votes have been tallied, and the new moderator is:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/66833&quot;&gt;&lt;img src=&quot;https://codegolf.stackexchange.com/users/flair/66833.png&quot; alt=&quot;caird coinheringaahing&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;They will be joining &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=moderators&quot;&gt;the existing crew&lt;/a&gt; shortly — please thank them for volunteering and share your assistance and advice with them as they learn the ropes!&lt;/p&gt;&#xA;&lt;p&gt;For details on how the voting played out, you can download the election results &lt;a href=&quot;https://codegolf.stackexchange.com/election/4&quot;&gt;here&lt;/a&gt; or &lt;a href=&quot;https://www.opavote.com/results/5120353218068480&quot; rel=&quot;nofollow noreferrer&quot;&gt;view a summary report online&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="78028" LastActivityDate="2022-10-11T22:01:48.757" Title="2022 Community Moderator Election Results" Tags="|discussion|election|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25233" PostTypeId="2" ParentId="25232" CreationDate="2022-10-11T22:01:48.757" Score="25" Body="&lt;h2&gt;Thank you all for the votes&lt;/h2&gt;&#xA;&lt;p&gt;I look forward to working for y'all as a moderator here, continuing my on-going efforts to keep the site clean! It is unfortunate that lyxal missed out, as I'm sure they would have been an excellent moderator. I hope you run for moderator at the next election.&lt;/p&gt;&#xA;&lt;p&gt;I'm already getting started with handling flags, and I'm ready to keep going over the future. As with the other moderators, I welcome any feedback to my moderation efforts, and you can contact me either by raising a flag, pinging me in chat, or even leaving a comment under one of my posts.&lt;/p&gt;&#xA;&lt;p&gt;Thank you!&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-10-11T22:01:48.757" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25234" PostTypeId="2" ParentId="2140" CreationDate="2022-10-12T09:39:23.220" Score="0" Body="&lt;h1&gt;Lengthy numbers type B : remove some occurrences of length&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;decision-problem-container&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a non negative integer number tell if it can be erased by repeatedly removing &lt;strong&gt;some non overlapping occurrences&lt;/strong&gt; of the length of that number from it.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Like &lt;a href=&quot;https://codegolf.stackexchange.com/q/254625/84844&quot;&gt;lengthy numbers type A&lt;/a&gt; erasing means remove all digits.&lt;br /&gt;&#xA;For example the number &lt;em&gt;4440&lt;/em&gt; is not lengthy B because after removing three 4's you obtain &lt;em&gt;0&lt;/em&gt; which cannot be erased.&lt;br /&gt;&#xA;Neither the numbers &lt;em&gt;50022&lt;/em&gt; and &lt;em&gt;50044&lt;/em&gt; are lengthy  B because you first remove 5 obtaining &lt;em&gt;0022&lt;/em&gt; and &lt;em&gt;0044&lt;/em&gt;, which cannot be erased because of leading 0's.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Example with selection of some matches&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;151151599995515 has 15 digits and 4 15's in it  &#xA;xx115xx99995515 if you remove 1st and 3rd 15's  &#xA;11599995515 : remove 11  &#xA;599995515 : remove 9's&#xA;55515 : remove 5's&#xA;1 and finally remove 1&#xA;&lt;/pre&gt;&#xA;&lt;p&gt;You can choose to remove almost all combinations of 2 15's but if you remove the 2nd and 3rd 15's you get stuck.&lt;br /&gt;&#xA;151&lt;s&gt;1515&lt;/s&gt;99995515&lt;br /&gt;&#xA;15199995515 -&amp;gt; 11 is no more available!&lt;/p&gt;&#xA;&lt;p&gt;If you remove a number of 15's different than 2 you get stuck too.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;strong&gt;Example with overlapping&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;4444&lt;s&gt;111111&lt;/s&gt;1 -&amp;gt; falsy because you can remove only 3 11's and not all 1's like you could if removing overlapping matches were allowed.&lt;/p&gt;&#xA;&lt;p&gt;44411111111 -&amp;gt; falsy because if you remove all 11's you get 444.&lt;br /&gt;&#xA;If instead you remove 3 11's you get 44411 which is falsy too.&lt;/p&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;p&gt;Truthy&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;1, 12, 21, 22, 123, 321, 322, 331, 333, 4441, 4444, 12345, 987654321, 3610106226, 1010101010, 11111111111, 11131111311, 151151599995515, 10812816208148888188, 82428208832101683082414123828341883888, 1515515551555515555515555551555555155555155551555155151, 999199999915999991599999999915999915999999919399999999991915999999999999999999999915999999929999999, 10121111011011011011011011011011011012110110110121101110110121111011123101101101101121011011110110111, 15101251011012229752519101110101010101010111111101101101101101111011011011011110111101101101101101915, 2020220202202022020220202232020220202202022020223220232020222220220222202202202202202202202202202202202220223202202202202202202202202222022022022022022022222202202202202202222022022022022022023876543213&#xA;&lt;/pre&gt;&#xA;&lt;p&gt;Falsy&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;0, 2, 9, 10, 11, 23, 100, 233, 444, 1224, 4440, 50022, 50044, 1101010101, 4444111110, 44441111111, 44411111111, 121666626162, 181811818128181818, 127271272722672224724122727122712242722472727272722472727272247272127272, 3919555395539111955255533922519455392511539551925395511,   &#xA; 1001023010023100160010010010010061110250100123001001001230061001010100102370100610016001001001110230, 1241242212412241241241241241241241241241241241141624124114241241241242612412412416241222412411424221241244124142412412144124, 108484298442981044294284942984429844294291042942942942849429429484284948429484842942942984104842984429429844298448429429429429429429429428494294294842942942948429428484942942942942984429429844284948429428494842849484284942942942942942984484294294284942942942942942942942942942910429429484294294&#xA;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, standard rules apply.&lt;br /&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Input can be given in any convenient method.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Output any two different values telling if the number is lengthy B or not.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="84844" LastEditorUserId="84844" LastEditDate="2022-11-27T11:16:42.387" LastActivityDate="2022-11-27T11:16:42.387" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25235" PostTypeId="2" ParentId="2140" CreationDate="2022-10-12T16:37:50.733" Score="5" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/253206/implement-the-flip-floperator&quot;&gt;Implement the flip-floperator&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="11261" LastEditorUserId="11261" LastEditDate="2022-10-14T14:23:47.833" LastActivityDate="2022-10-14T14:23:47.833" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25236" PostTypeId="2" ParentId="2140" CreationDate="2022-10-12T19:21:43.057" Score="2" Body="&lt;h1&gt;Prime factor power sorting&lt;/h1&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;We will introduce a new way of writing numbers where the digits represent powers of primes starting with the largest prime factor of the number, and ending with the power of 2 in the prime factorization. As an example, 2 = 2&lt;sup&gt;1&lt;/sup&gt;, so it would be written as &lt;code&gt;1&lt;/code&gt;. Slightly more complicated, 3 = 3&lt;sup&gt;1&lt;/sup&gt; * 2&lt;sup&gt;0&lt;/sup&gt;, so it is written as &lt;code&gt;1 0&lt;/code&gt;. Here's a few more:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;6:     1 1&#xA;7: 1 0 0 0&#xA;8:       3&#xA;9:     2 0&#xA;10:  1 0 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;So the place value of the n'th &amp;quot;digit&amp;quot; is the n'th prime number, and the digit itself represents the power of that prime in the factorization of the number. 1 is encoded simply as &lt;code&gt; &lt;/code&gt; or &lt;code&gt;0&lt;/code&gt; (the choice does not affect comparison).&lt;/p&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;We can compare numbers in this form by first examining how many digits it has, and then breaking ties by comparing the digits themselves like normal. For instance, any power of 2 has only one digit, and so 2&lt;sup&gt;n&lt;/sup&gt; &amp;lt; 3 for all n because 3's prime power representation has two digits. However, when numbers have the same length (meaning their highest prime factors are equal) we compare the lists of digits element-wise. Therefore 12 &amp;lt; 9 because 12th = &lt;code&gt;1 2&lt;/code&gt; and 9 = &lt;code&gt;2 0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to write a function or program which takes as input a collection of distinct integers greater than or equal to 1, and outputs the same collection sorted this way in ascending order. This is code golf, so the score is the length of your solution in bytes.&lt;/p&gt;&#xA;&lt;h2&gt;Examples:&lt;/h2&gt;&#xA;&lt;p&gt;I have written an example solution (&lt;a href=&quot;https://tio.run/##fVPbbtswDH3XV3ApBkid29pJVwxBvcd9wd6CwJAduVEqS54so8uGfntGSbZzabs8OCJ5dHhIke3ebY1eHA61NQ1URilROWl0B7JpjXWwETXvldvIypGAqXtdOWPUhKiatnCmeBZ7QhANsitaKxtBNVsSAFmDhjyHORgbTwvvBrDC9VbDT9sL4nGAGPx/2UolQF5fz@ExB72EKzBa7UELsQFnoNqK6hn61p@7X9ZhmkAX8nz2NDmkMcOU4wdXnYgo@JJDRi6ye9k1x7Ks/HOpOztTS9PEp9NFZdo9KtYnyiNDh9ZJ06jUjgFGj6XFuj4WPfCs5HoU638a7u5ykMESWM6IHipCqzUvIqRfrdHq5JOWtay4dugaO1DjI@xAarBcP2GpoY4EsgRuMjZpmp5wx6Y09aRrtx6dl1lCN8dQlHPL21boDT1eZmSACIWkJwTLD66mbAocH871rRI0All8wco0LbeC8iKBsgjKOZ5Q1/FtecGSExNhiLoar0K5ByX0k9vCi8RPSDIEZWc08A6cFKUV/FnYOCSIp5zBpzycymMTh8DjmX/Sf5ORqQcD8vv7yHEAyOm74y2O1OV/WDkSlm@4COmM6v2KY18Ub8oNB9033RI6XGaxod5IALc5Py42HfrD2EH85g02JYxZ4F7h7MwTWCRwn8DXdRKd82B@w8l6wBhaD2guhqiSnaNxALOImDP2JnSfIt/DO4EsTTGUpfOUMbImfqQHVX6wR4Gxcgw23BW@qMt6ZzC73Rmp6apzFpc@7Ib2FD6@jkOHa6AdrWd/T4jokIK9LuHMP3Z2ArDXGSOHfw&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 3 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;) which generates the following examples with the input and output separated by a colon:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3 4 5: 1 2 4 3 5&#xA;2 4 8 16 32 64 3: 2 4 8 16 32 64 3&#xA;1 3 5 7 9 11 13 15: 1 3 9 5 15 7 11 13&#xA;40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55: 48 54 40 45 50 42 49 44 55 52 51 46 41 43 47 53&#xA;1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019: 1000 1008 1001 1014 1012 1015 1007 1003 1005 1010 1017 1016 1002 1004 1011 1006 1018 1009 1013 1019&#xA; &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="67809" LastActivityDate="2022-10-12T19:21:43.057" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25238" PostTypeId="2" ParentId="2140" CreationDate="2022-10-14T04:10:38.527" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/253309/78410&quot;&gt;Triangular polkadot numbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-10-17T00:01:28.240" LastActivityDate="2022-10-17T00:01:28.240" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25241" PostTypeId="2" ParentId="2140" CreationDate="2022-10-14T12:45:07.517" Score="3" Body="&lt;h1&gt;Integer Bluffing (Still a draft)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;king-of-the-hill-container&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;python-container&quot;&gt;python&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;It's an exciting night at the IGS casino, as a brand new table game is being revealed - Integer Bluffing. Bots from all over the network have come to have a chance at playing the inaugral game, and luckily for you, you just happen to have a seat at the table.&lt;/p&gt;&#xA;&lt;h2&gt;The Rules of Integer Bluffing&lt;/h2&gt;&#xA;&lt;p&gt;At the beginning of a game of Integer Bluffing, each player starts with 20 tokens. A round of Integer Bluffing consists of 4 phases: (i) the deal, (ii) declaring, (iii) reacting, (iv) the showdown&lt;/p&gt;&#xA;&lt;h3&gt;The Deal&lt;/h3&gt;&#xA;&lt;p&gt;Each round, 1 player is chosen to pay an ante, which increases during the game, into the pot. A random integer in the range [1, 8] is then &amp;quot;dealt&amp;quot; to each player. Players only know the true value of their own integer, and once an integer is given to a player, it can't be dealt to anyone else.&lt;/p&gt;&#xA;&lt;h3&gt;Declaring&lt;/h3&gt;&#xA;&lt;p&gt;Starting with the player after the player who paid the ante, each player has the choice to either: a) decline to play the round (fold) or b) put 1 token into the pot and declare what their integer is (play).&lt;/p&gt;&#xA;&lt;p&gt;Here's the twist - if choosing to play, the player doesn't have to tell the truth about the value of their integer - they can lie and declare they have an integer they don't have. The player also sets a flag whether they say they are bluffing or not - this can also be lied about.&lt;/p&gt;&#xA;&lt;p&gt;Consider the following game with players A, B, C and D:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Player&lt;/th&gt;&#xA;&lt;th&gt;Integer&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;A&lt;/td&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;B&lt;/td&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;C&lt;/td&gt;&#xA;&lt;td&gt;7&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;D&lt;/td&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;Assuming Player A paid the ante for the round, player B goes first in the declaring round. Player B sees that they have a &lt;code&gt;2&lt;/code&gt;, which is highly unlikely to win against other integers, so they fold.&lt;/p&gt;&#xA;&lt;p&gt;Player C sees that they have a &lt;code&gt;7&lt;/code&gt;, so they choose to play the round. Wanting to trick Players D and A into putting a token into the pot, C declares that they have &lt;code&gt;2&lt;/code&gt;, and states they are not bluffing.&lt;/p&gt;&#xA;&lt;p&gt;Player D sees that Player C allegedly has &lt;code&gt;2&lt;/code&gt; and that they aren't bluffing. Player D knows that &lt;code&gt;3&lt;/code&gt; is higher than &lt;code&gt;2&lt;/code&gt;, but knows that Player A might have a higher integer. Therefore, Player D decides to declare &lt;code&gt;6&lt;/code&gt;, not bluffing, in the hopes that Player A folds.&lt;/p&gt;&#xA;&lt;p&gt;TODO: Continue writing&lt;/p&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2022-10-14T12:45:07.517" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25243" PostTypeId="2" ParentId="2140" CreationDate="2022-10-15T17:39:01.860" Score="8" Body="&lt;h1&gt;Sʨɠɠanography&lt;/h1&gt;&#xA;&lt;p&gt;Many Unicode composed characters have two forms, one being a precomposed character, while the other is an ASCII character with a combining diacritic. For instance, &lt;code&gt;é&lt;/code&gt; has Unicode code point U+00E9, but &lt;code&gt;é&lt;/code&gt;, which looks identical, is actually the ASCII character 0x65 with the combining diacritic U+0301.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to write two programs or functions. The first will take a string of Unicode containing some composed characters and a string of printable ASCII. It will then output an identical-looking Unicode string which the second program can then decode to recover the printable ASCII.&lt;/p&gt;&#xA;&lt;p&gt;By identical-looking, it must be the case that performing your choice of NFC or NFD normalisation on the input and output Unicode strings returns an identical string. If necessary, you may require that the input Unicode string be already NFC or NFD normalised (please specify).&lt;/p&gt;&#xA;&lt;p&gt;If the input string does not contain sufficient composed characters for you to use, you should repeat it until its length is sufficient. You may also join the repeats with newlines should you so wish.&lt;/p&gt;&#xA;&lt;p&gt;Your score is the sum of the byte lengths of your two programs divided by the number of composed characters you support in the input Unicode string. For instance, you may only wish to support those composed characters that expand to two characters under NFD. In this case your code's behaviour for other composed characters must be consistent (i.e. one of always unchanged, always NFC, always NFD). (Note that the Unicode string may also contain characters that do not change under NFC or NFD. You obviously can't use these to encode the ASCII string but they must still appear in the output.)&lt;/p&gt;&#xA;&lt;p&gt;If your language supports arbitrary-precision integers, you may also elect to provide a demonstration of your algorithm on integers rather than printable ASCII strings.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2022-10-15T18:59:40.140" LastActivityDate="2022-10-15T18:59:40.140" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25244" PostTypeId="2" ParentId="20722" CreationDate="2022-10-17T04:01:38.313" Score="2" Body="&lt;p&gt;My username is an ancient relic from when my dad made my first Hotmail account before at least 2007. Ever since I've consistently used this username for everything. Since my real name is a hellish mess of a Chinese romanization, most people don't realize that it's just my first name with &lt;code&gt;big&lt;/code&gt; prepended to it. Besides, most people don't know how to parse the &lt;code&gt;hsuan&lt;/code&gt; part of it and just call me &lt;code&gt;bigy /bɪg.i/ &amp;quot;biggie&amp;quot;&lt;/code&gt; in voice chat lol&lt;/p&gt;&#xA;&lt;p&gt;I don't have a &amp;quot;set&amp;quot; profile picture, I just switch my profile pictures whenever  I find a good one somewhere on the internet. My current profile picture is a cutout of a face drawn by &lt;a href=&quot;https://twitter.com/TheRealTrampy/status/1344377385551060993&quot; rel=&quot;nofollow noreferrer&quot;&gt;@TheRealTrampy&lt;/a&gt; on Twitter of Thomas-ized members of the LNER A4 class (since a fictional member of the class, Spencer, appears in the show).&lt;/p&gt;&#xA;&lt;p&gt;It also somehow manages to mimic my facial hair, so that's a bonus.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/m4EuE.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/m4EuE.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77309" LastActivityDate="2022-10-17T04:01:38.313" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25245" PostTypeId="2" ParentId="2140" CreationDate="2022-10-17T13:53:03.273" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/256363/73593&quot;&gt;Wordle games without repeating letters&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Given a word list, find all sets of five words of five letters each, such that the words of each set have 25 distinct letters in total.&lt;/p&gt;&#xA;&lt;p&gt;This challenge was inspired by &lt;a href=&quot;https://www.youtube.com/watch?v=c33AZBnRHks&amp;amp;t=1424s&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; video by Matt Parker.&lt;/p&gt;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&lt;p&gt;&lt;code&gt;TODO&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Rules&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard I/O rules apply.&lt;/li&gt;&#xA;&lt;li&gt;Words contain only lowercase (or alternatively, uppercase) alphabetic characters.&lt;/li&gt;&#xA;&lt;li&gt;You can assume there are no empty words (i.e. words of length zero).&lt;/li&gt;&#xA;&lt;li&gt;The input can contain words that cannot belong to any set that satisfies the property, such as words with less then five letters, words with more than five letters, and words with repeated letters.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;s&gt;&#xA;### Scoring&#xA;&lt;p&gt;This challenge wants to be an experimental mix of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;fastest-code-container&quot;&gt;fastest-code&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If your solution has:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a &lt;a href=&quot;https://en.wikipedia.org/wiki/Time_complexity&quot; rel=&quot;nofollow noreferrer&quot;&gt;time complexity&lt;/a&gt; of &lt;span class=&quot;math-container&quot;&gt;\$\Omega(f(n))\$&lt;/span&gt; (see &lt;a href=&quot;https://en.wikipedia.org/wiki/Big_O_notation#Big_Omega_notation&quot; rel=&quot;nofollow noreferrer&quot;&gt;Big Omega notation&lt;/a&gt;) where&#xA;&lt;span class=&quot;math-container&quot;&gt;\$f: \mathbb N \to \mathbb N\$&lt;/span&gt;&#xA;is a function of the form&#xA;&lt;span class=&quot;math-container&quot;&gt;$$f(n) =&#xA;(\log_2 \log_2 n)^{k_{-2}}&#xA;\cdot (\log_2 n)^{k_{-1}}&#xA;\cdot n^{k_0}&#xA;\cdot 2^{k_1}&#xA;\cdot 2^{(2^{k_2})}&#xA;\cdot \ldots&#xA;$$&lt;/span&gt;&#xA;where &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; the the total number of the letters of the words in the input;&lt;/li&gt;&#xA;&lt;li&gt;a length of &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; bytes (or whatever unit of measurement is commonly used in the language of your choice);&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;then the score is &lt;span class=&quot;math-container&quot;&gt;\$f(x + 4)\$&lt;/span&gt;. Lowest score wins!&lt;/p&gt;&#xA;&lt;h5&gt;Notes&lt;/h5&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;obviously, infinitely many terms &lt;span class=&quot;math-container&quot;&gt;\$k_i\$&lt;/span&gt; can be &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;;&lt;/li&gt;&#xA;&lt;li&gt;terms with three or more &lt;span class=&quot;math-container&quot;&gt;\$\log\$&lt;/span&gt; (e.g. &lt;span class=&quot;math-container&quot;&gt;\$\log_2 \log_2 \log_2 n\$&lt;/span&gt;) cannot be used in function &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; because they could be used to arbitrarily lower the score, unless we introduce further complex scoring rules (and most probably they won't be used as a real lower bound).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h5&gt;Scoring example&lt;/h5&gt;&#xA;&lt;p&gt;If your solution has a length of &lt;span class=&quot;math-container&quot;&gt;\$37\$&lt;/span&gt; bytes, and it has a time complexity of &lt;span class=&quot;math-container&quot;&gt;\$\Omega(n^5)\$&lt;/span&gt;, then it has a score of &lt;span class=&quot;math-container&quot;&gt;\$(37+4)^5\$&lt;/span&gt;.&#xA;&lt;/s&gt;&lt;/p&gt;&#xA;&lt;p&gt;Edit: scoring rules postponed for a future challenge&lt;/p&gt;&#xA;" OwnerUserId="73593" LastEditorUserId="73593" LastEditDate="2023-01-04T23:40:28.763" LastActivityDate="2023-01-04T23:40:28.763" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25246" PostTypeId="2" ParentId="2140" CreationDate="2022-10-18T01:28:29.113" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/253418/78410&quot;&gt;Triangular honeycomb numbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-10-19T00:06:06.290" LastActivityDate="2022-10-19T00:06:06.290" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25247" PostTypeId="2" ParentId="20722" CreationDate="2022-10-18T09:26:09.677" Score="2" Body="&lt;p&gt;&lt;code&gt;oeuf&lt;/code&gt; simply means &lt;code&gt;egg&lt;/code&gt; in French, and it sounds pretty similar to the Roblox dead sound (&lt;code&gt;oof&lt;/code&gt;), so I thought at the time that it would be funny to use it as my username.&lt;/p&gt;&#xA;&lt;p&gt;As for the profile picture, it is an ASCII art drawing on a rabbit I found on &lt;a href=&quot;https://asciiart.eu&quot; rel=&quot;nofollow noreferrer&quot;&gt;asciiart.eu&lt;/a&gt;. It was made by Linda Ball. I took the ASCII art, then use an online ASCII-to-image tool to turn it into an image. (&lt;a href=&quot;https://onlineasciitools.com/convert-ascii-to-image&quot; rel=&quot;nofollow noreferrer&quot;&gt;I believed it was this one&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;p&gt;For the reason why I chose a rabbit, I used to play a mobile game called &lt;code&gt;Tsuki's Odyssey&lt;/code&gt;, in which the main character, also called &lt;code&gt;Tsuki&lt;/code&gt;, came back to his hometown from the crowded city life to start a calm life. Think of it like Animal Crossing, but on mobile phones.&lt;/p&gt;&#xA;&lt;p&gt;Even though this game bores the hell out of me, it pretty much influences my username choice. If not because I like the name &lt;code&gt;oeuf&lt;/code&gt; more, I could have chosen &lt;code&gt;tsuki&lt;/code&gt; as my new username, as that's my username on many social platforms (or anywhere that has an account system).&lt;/p&gt;&#xA;" OwnerUserId="107017" LastActivityDate="2022-10-18T09:26:09.677" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25248" PostTypeId="2" ParentId="25190" CreationDate="2022-10-18T17:29:20.077" Score="2" Body="&lt;h1&gt;Good idea&lt;/h1&gt;&#xA;&lt;p&gt;&amp;quot;Tips for golfing in [language]&amp;quot; questions are a great place to go if you want to get better at golfing in a particular language. It makes sense to have links to other resources for that language in the same place.&lt;/p&gt;&#xA;&lt;h2&gt;Keep it brief&lt;/h2&gt;&#xA;&lt;p&gt;The main point of a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; question is to ask for tips; too much extraneous information is distracting. I'd say remove the &amp;quot;notable features&amp;quot; section. The most notable features should be part of the language summary.&lt;/p&gt;&#xA;&lt;h2&gt;Shouldn't be mandatory&lt;/h2&gt;&#xA;&lt;p&gt;There's nothing wrong with asking a &amp;quot;tips for golfing in&amp;quot; question without putting links to other resources in the header. It's simply a bonus feature. I also don't see anything wrong with editing existing questions to include links to resources, but let's not do them all at once. Maybe one per week, or edit one if it's already on the active questions list because it got a new answer.&lt;/p&gt;&#xA;&lt;h2&gt;Don't community wiki&lt;/h2&gt;&#xA;&lt;p&gt;As Radvylf pointed out in the comments, making a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; question community wiki would force all the answers to be community wiki. This change would not be helpful; people should get reputation for good tips. It is unfortunate that reputation for the question itself goes to whoever thought of posting it first, but I'm not sure if there's a good way around that.&lt;/p&gt;&#xA;" OwnerUserId="16766" LastActivityDate="2022-10-18T17:29:20.077" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25250" PostTypeId="2" ParentId="2140" CreationDate="2022-10-18T21:10:28.200" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/253506/box-blur-the-string&quot;&gt;Box blur the string&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="11261" LastEditorUserId="11261" LastEditDate="2022-10-20T18:40:36.540" LastActivityDate="2022-10-20T18:40:36.540" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25251" PostTypeId="1" CreationDate="2022-10-18T23:30:15.360" Score="24" ViewCount="2269" Body="&lt;p&gt;Following &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/24068/78410&quot;&gt;last year's event&lt;/a&gt;, we're doing &lt;s&gt;Advent of Code Golf&lt;/s&gt; &lt;strong&gt;Code Golf Advent Calendar 2022&lt;/strong&gt;&lt;sup&gt;1&lt;/sup&gt;! On each day between Dec 1st and Dec 25th (inclusive), a new challenge will be posted at UTC midnight&lt;sup&gt;2&lt;/sup&gt;. It is a free-for-all and just-have-fun-by-participation event, no leaderboards and no prizes for solving them fast or solving them in the shortest code.&lt;/p&gt;&#xA;&lt;p&gt;For this event to run successfully, we need 25 different challenges prepared before December. &lt;s&gt;If you want to write a challenge for this event, please post it as an answer to this post.&lt;/s&gt; &lt;strong&gt;All 25 challenges are ready, and no more challenges are being accepted.&lt;/strong&gt; This post will also act as a sandbox dedicated to the event.&lt;/p&gt;&#xA;&lt;p&gt;Also unlike last year, the challenge writer will get to post the challenge they write. When you post a challenge, please attach the preferred date(s) you want to post it on. For reference, Dec 1st is Thursday, and Christmas is Sunday.&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;   December 2022    &#xA;Su Mo Tu We Th Fr Sa&#xA;             1  2  3&#xA; 4  5  6  7  8  9 10&#xA;11 12 13 14 15 16 17&#xA;18 19 20 21 22 23 24&#xA;25 26 27 28 29 30 31&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You may also post &amp;quot;sandbox gems&amp;quot; (old abandoned sandbox posts) as event challenges, but please follow the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/2091/78410&quot;&gt;process&lt;/a&gt; for ownership transfer:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a challenge proposal was not edited or commented on for &lt;strong&gt;a month&lt;/strong&gt;, you can leave a comment that you would like take over the challenge, get it ready for main and post it.&lt;/li&gt;&#xA;&lt;li&gt;If the OP does not reply within &lt;strong&gt;two weeks&lt;/strong&gt;, telling you that they still intend to post the challenge themselves, you are free to proceed with the challenge as you see fit.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;You're free to discuss about this event in &lt;a href=&quot;https://chat.stackexchange.com/rooms/140141/advent-of-code-golf&quot;&gt;the dedicated chat room&lt;/a&gt; too.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Notice for challenge writers.&lt;/strong&gt; When posting your challenge to main, please follow the rules below:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The title should be in the form of &lt;code&gt;CGAC2022 Day X: &amp;lt;challenge title&amp;gt;&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The body should start with a notice about this event:&#xA;&lt;pre&gt;&lt;code&gt;Part of [**Code Golf Advent Calendar 2022**](https://codegolf.meta.stackexchange.com/questions/25251/announcing-code-golf-advent-calendar-2022-event-challenge-sandbox) event. See the linked meta post for details.&#xA;&#xA;---&#xA;&#xA;&amp;lt;challenge body&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; Following Eric Wastl's request to change the event's name to not contain &amp;quot;Advent of Code&amp;quot;, we decided the new name &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/25285/78410&quot;&gt;in this meta post&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;2&lt;/sup&gt; Each individual challenge may be posted a few hours late if UTC midnight doesn't fit with the challenge writer's schedule.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Challenges posted&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255042/78410&quot;&gt;CGAC2022 Day 1: Let&amp;#39;s build a chocolate pyramid!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255094/78410&quot;&gt;CGAC2022 Day 2: Self-trapping Elf&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255135/78410&quot;&gt;CGAC2022 Day 3: \$n\$-dimensional Chocolate Pyramid&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255161/110555&quot;&gt;CGAC2022 Day 4: Can Santa fit down the chimney?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255202/78410&quot;&gt;CGAC2022 Day 5: Preparing an advent calendar&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255243/78410&quot;&gt;CGAC2022 Day 6: Shuffles with specific &amp;quot;magic number&amp;quot;&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255274/78410&quot;&gt;CGAC2022 Day 7: Fen The Wicked&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255305/78410&quot;&gt;CGAC2022 Day 8: Fen The Wicked, Part 2&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255344/78410&quot;&gt;CGAC2022 Day 9: Playing with bits&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255373/78410&quot;&gt;CGAC2022 Day 10: Help Santa sort presents!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255395/78410&quot;&gt;CGAC2022 Day 11: Reduce, Reuse, Regift&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255405/78410&quot;&gt;CGAC2022 Day 12: Santa&amp;#39;s gift and the laser lock&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255439/78410&quot;&gt;CGAC2022 Day 13: Santa&amp;#39;s gift and the laser lock, Part 2&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255464/78410&quot;&gt;CGAC2022 Day 14: Chimney cleaning&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255496/78410&quot;&gt;CGAC2022 Day 15: Chimney cleaning, Part 2&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255555/78410&quot;&gt;CGAC2022 Day 16: Playing with bits, Part 2&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255591/78410&quot;&gt;CGAC2022 Day 17: Present Heap&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255638/78410&quot;&gt;CGAC2022 Day 18: Light all of the candles&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255697/&quot;&gt;CGAC2022 Day 19: I Made It Out Of Clay&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255737&quot;&gt;CGAC2022 Day 20: Reconstruct Santa&amp;#39;s Book&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255793/78410&quot;&gt;CGAC2022 Day 21: Present stack headache&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255881/78410&quot;&gt;CGAC2022 Day 22: Present stack headache, Part 2&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255943/78410&quot;&gt;CGAC2022 Day 23: North Pole Railroads&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255755/78410&quot;&gt;CGAC2022 Day 24: North Pole Railroads, Part 2&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-12-24T05:02:18.270" LastActivityDate="2022-12-24T05:02:18.270" Title="Announcing Code Golf Advent Calendar 2022! (+ Event challenge sandbox)" Tags="|discussion|code-golf|sandbox|advent-events|" AnswerCount="28" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25252" PostTypeId="2" ParentId="25251" CreationDate="2022-10-18T23:49:37.883" Score="7" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255042/78410&quot;&gt;CGAC2022 Day 1: Let&amp;#39;s build a chocolate pyramid!&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-12-01T00:27:59.580" LastActivityDate="2022-12-01T00:27:59.580" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25253" PostTypeId="2" ParentId="2140" CreationDate="2022-10-19T02:27:55.157" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/253640/conversions-galore&quot;&gt;Conversions Galore!&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96039" LastEditorUserId="96039" LastEditDate="2022-10-23T01:14:01.120" LastActivityDate="2022-10-23T01:14:01.120" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25254" PostTypeId="2" ParentId="2140" CreationDate="2022-10-19T09:18:29.307" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/253441/count-the-shared-substrings-with-2-programs&quot;&gt;Count the shared substrings with 2 programs&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="41723" LastEditorUserId="41723" LastEditDate="2022-10-19T12:53:24.907" LastActivityDate="2022-10-19T12:53:24.907" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25256" PostTypeId="2" ParentId="2140" CreationDate="2022-10-19T16:02:39.197" Score="-1" Body="&lt;h1&gt;Find all matrices whose sliding sums are the input&lt;/h1&gt;&#xA;&lt;p&gt;Like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/253453/find-a-matrix-whose-sliding-sum-is-the-input&quot;&gt;this&lt;/a&gt;, but &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;sequence-container&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-10-19T16:02:39.197" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25257" PostTypeId="2" ParentId="2140" CreationDate="2022-10-19T19:39:36.183" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/253667/character-insertion-on-letterboards&quot;&gt;Character Insertion on Letterboards&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="60919" LastEditorUserId="60919" LastEditDate="2022-10-23T19:53:17.297" LastActivityDate="2022-10-23T19:53:17.297" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25259" PostTypeId="2" ParentId="2140" CreationDate="2022-10-20T05:03:49.223" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/253529/minimum-rotation-to-get-the-maximum-value&quot;&gt;Minimum rotation to get the maximum value&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="107017" LastEditorUserId="107017" LastEditDate="2022-10-21T01:22:33.540" LastActivityDate="2022-10-21T01:22:33.540" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25262" PostTypeId="2" ParentId="2140" CreationDate="2022-10-20T17:08:59.820" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/253568/114446&quot;&gt;Alphabet checksum&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="114446" LastEditorUserId="114446" LastEditDate="2022-10-23T06:12:42.200" LastActivityDate="2022-10-23T06:12:42.200" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="25263" PostTypeId="2" ParentId="2140" CreationDate="2022-10-22T22:37:49.590" Score="-1" Body="&lt;p&gt;Posted on main: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/253648/make-a-compiler-or-interpreter-for-any-turing-complete-language-in-another-langu&quot;&gt;Make a Compiler or Interpreter for any Turing-complete language in another language&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="115226" LastEditorUserId="115226" LastEditDate="2022-10-23T13:37:54.040" LastActivityDate="2022-10-23T13:37:54.040" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25265" PostTypeId="2" ParentId="2140" CreationDate="2022-10-23T05:00:13.117" Score="2" Body="&lt;h2&gt;Generate the Sequence of Equivalence Relations (&lt;a href=&quot;https://oeis.org/A231428&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS A231428&lt;/a&gt;)&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequences&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequences&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequences&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;sequences-container&quot;&gt;sequences&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary-matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary-matrix&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;binary-matrix&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;binary-matrix-container&quot;&gt;binary-matrix&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Introduction&lt;/h3&gt;&#xA;&lt;p&gt;An &lt;a href=&quot;https://en.wikipedia.org/wiki/Equivalence_relation&quot; rel=&quot;nofollow noreferrer&quot;&gt;equivalence relation&lt;/a&gt; &lt;span class=&quot;math-container&quot;&gt;\$R\$&lt;/span&gt; on a set &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; is&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;reflexive: &lt;span class=&quot;math-container&quot;&gt;\$ \forall a\in S: aRa\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;symmetric: &lt;span class=&quot;math-container&quot;&gt;\$ \forall a,b \in S: aRb \leftrightarrow bRa \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;transitive: &lt;span class=&quot;math-container&quot;&gt;\$ \forall a,b,c \in S: aRb \wedge bRc \rightarrow aRc \$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;These relations can be represented as boolean matrices where:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;reflexive: the diagonal is all ones&lt;/li&gt;&#xA;&lt;li&gt;symmetric: the entries are symmetric over the diagonal (&lt;span class=&quot;math-container&quot;&gt;\$a_{ij}=a_{ji}\$&lt;/span&gt;)&lt;/li&gt;&#xA;&lt;li&gt;transitive: the matrix, when pairs of rows and the corresponding pairs of columns are suitably swapped, consists of entirely-1 and entirely-zero blocks, with the on-diagonal blocks entirely-1.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Here are a few such matrices:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 0        1 1 0 0 0        1 0 1 0       can swap rows     1 1 0 0&#xA;0 1        1 1 0 0 0        0 1 0 1  --&amp;gt;  2&amp;amp;3, columns  --&amp;gt; 1 1 0 0&#xA;           0 0 1 1 1        1 0 1 0       2&amp;amp;3 to obtain:    0 0 1 1&#xA;           0 0 1 1 1        0 1 0 1                         0 0 1 1&#xA;           0 0 1 1 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Making use of the reflexive and symmetric properties, we can encode such a matrix by concatenating the rows of its upper-right triangle, and converting from binary to decimal. (The example matrices encode as 0b0=0, 0b10 0000 0111=519, 0b01 0010=18, and 0b10 0001=33.)&lt;/p&gt;&#xA;&lt;h3&gt;Challenge&lt;/h3&gt;&#xA;&lt;p&gt;Write a program or function that outputs all equivalence relations in order (as encoded above). &lt;a href=&quot;https://codegolf.stackexchange.com/tags/sequence/info&quot;&gt;Default sequence rules&lt;/a&gt; apply, so you can output an unbounded list, you can take an input &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and return the &lt;span class=&quot;math-container&quot;&gt;\$n^{th}\$&lt;/span&gt; term, or you can take an input &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and return the first &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; terms. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Default Loopholes&lt;/a&gt; forbidden. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so shortest program wins.&lt;/p&gt;&#xA;&lt;p&gt;For reference, the first 25 terms of this sequence are&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0, 1, 2, 4, 7, 8, 12, 16, 18, 25, 32, 33, 42, 52, 63, 64, 68, 80, 96, 116, 128, 130, 136, 160, 170&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here are example matrices which generate the first few terms of the sequence:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A: 1 0 0     &#xA;   0 1 0    0b000 -&amp;gt; 0    &#xA;   0 0 1     &#xA;          &#xA;B: 1 0 0 0&#xA;   0 1 0 0    0b00 0000 0001 -&amp;gt; 1    (also: 1 1 among others)&#xA;   0 0 1 1                                  1 1 &#xA;   0 0 1 1&#xA;&#xA;C: 1 0 0 0 0&#xA;   0 1 0 0 0&#xA;   0 0 1 0 1    0b00 0000 0010 -&amp;gt; 2&#xA;   0 0 0 1 0&#xA;   0 0 1 0 1&#xA;&#xA;D: 1 0 0 0 0&#xA;   0 1 0 0 0&#xA;   0 0 1 1 0    0b00 0000 0100 -&amp;gt; 4&#xA;   0 0 1 1 0&#xA;   0 0 0 0 1&#xA;&#xA;E: 1 1 1&#xA;   1 1 1    0b111 -&amp;gt; 7&#xA;   1 1 1&#xA;&#xA;F: 1 0 0 1&#xA;   0 1 0 0    0b00 1000 -&amp;gt; 8&#xA;   0 0 1 0&#xA;   1 0 0 1&#xA;&#xA;G: 1 0 0 0 0&#xA;   0 1 0 0 1&#xA;   0 0 1 1 0    0b00 0000 1100 -&amp;gt; 12&#xA;   0 0 1 1 0&#xA;   0 1 0 0 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Sandbox notes&lt;/h3&gt;&#xA;&lt;p&gt;related: &lt;a href=&quot;https://codegolf.stackexchange.com/q/251626/103237&quot;&gt;Is This an Equivalence Relation?&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/q/100660/103237&quot;&gt;Determine if a relation is transitive&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;My first try, so please don't be shy about suggesting improvements, making edits, heckling... I can take it =)&lt;/p&gt;&#xA;&#xA;" OwnerUserId="103237" LastEditorUserId="103237" LastEditDate="2022-10-31T16:30:40.370" LastActivityDate="2022-10-31T16:30:40.370" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25266" PostTypeId="2" ParentId="25251" CreationDate="2022-10-24T01:33:42.813" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255094/78410&quot;&gt;CGAC2022 Day 2: Self-trapping Elf&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-12-02T00:01:33.790" LastActivityDate="2022-12-02T00:01:33.790" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25267" PostTypeId="2" ParentId="25251" CreationDate="2022-10-25T09:37:45.230" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255202/78410&quot;&gt;CGAC2022 Day 5: Preparing an advent calendar&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-12-05T23:21:21.230" LastActivityDate="2022-12-05T23:21:21.230" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25268" PostTypeId="2" ParentId="25251" CreationDate="2022-10-25T10:10:32.820" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255243/78410&quot;&gt;CGAC2022 Day 6: Shuffles with specific &amp;quot;magic number&amp;quot;&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-12-06T00:03:04.437" LastActivityDate="2022-12-06T00:03:04.437" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25269" PostTypeId="2" ParentId="2140" CreationDate="2022-10-25T15:20:49.317" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/253817/increment-decrement-undo-peek&quot;&gt;Increment, decrement, undo, peek&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="11261" LastEditorUserId="11261" LastEditDate="2022-10-27T15:35:27.980" LastActivityDate="2022-10-27T15:35:27.980" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25270" PostTypeId="2" ParentId="2140" CreationDate="2022-10-25T19:20:22.110" Score="1" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/253857/length-of-binary-as-base-10-oeis-a242347&quot;&gt;Length of Binary as Base 10 [OEIS A242347]&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="96266" LastEditorUserId="96266" LastEditDate="2022-10-30T21:10:56.257" LastActivityDate="2022-10-30T21:10:56.257" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25271" PostTypeId="2" ParentId="2140" CreationDate="2022-10-25T19:57:13.677" Score="1" Body="&lt;h1&gt;Render an Ideographic Description Sequence&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codegolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;codegolf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;codegolf-container&quot;&gt;codegolf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;graphical-output-container&quot;&gt;graphical-output&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/unicode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;unicode&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;unicode&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;unicode-container&quot;&gt;unicode&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;There are 12 characters in Unicode that can be used to describe any CJK character, which are often made up of reoccurring parts (&amp;quot;radicals&amp;quot;) composed in different ways.&lt;/p&gt;&#xA;&lt;p&gt;For example, U+86D9 蛙 can be described as U+2FF0 U+866B U+572D ⿰虫圭.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to take such an Ideographic Description Sequence as input and produce an image of the resulting character as an output. You can assume the input conforms to the following grammar, which is taken from &lt;a href=&quot;https://www.unicode.org/versions/Unicode15.0.0/UnicodeStandard-15.0.pdf#G21.28626&quot; rel=&quot;nofollow noreferrer&quot;&gt;the Unicode standard&lt;/a&gt;, which explains this topic very well:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;IDS := Ideographic | Radical | CJK_Stroke | Private Use | U+FF1F&#xA;    | IDS_BinaryOperator IDS IDS&#xA;    | IDS_TrinaryOperator IDS IDS IDS&#xA;CJK_Stroke := U+31C0 | U+31C1 | ... | U+31E3&#xA;IDS_BinaryOperator := U+2FF0 | U+2FF1 | U+2FF4 | ... | U+2FFA | U+2FFB&#xA;IDS_TrinaryOperator := U+2FF2 | U+2FF3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is a kind of prefix notation (polish notation).&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Ideographic&lt;/em&gt; and &lt;em&gt;Radical&lt;/em&gt; are defined in &lt;a href=&quot;https://www.unicode.org/Public/15.0.0/ucd/PropList.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;PropList.txt&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2E80..2E99    ; Radical # So  [26] CJK RADICAL REPEAT..CJK RADICAL RAP&#xA;2E9B..2EF3    ; Radical # So  [89] CJK RADICAL CHOKE..CJK RADICAL C-SIMPLIFIED TURTLE&#xA;2F00..2FD5    ; Radical # So [214] KANGXI RADICAL ONE..KANGXI RADICAL FLUTE&#xA;&#xA;3006          ; Ideographic # Lo       IDEOGRAPHIC CLOSING MARK&#xA;3007          ; Ideographic # Nl       IDEOGRAPHIC NUMBER ZERO&#xA;3021..3029    ; Ideographic # Nl   [9] HANGZHOU NUMERAL ONE..HANGZHOU NUMERAL NINE&#xA;3038..303A    ; Ideographic # Nl   [3] HANGZHOU NUMERAL TEN..HANGZHOU NUMERAL THIRTY&#xA;3400..4DBF    ; Ideographic # Lo [6592] CJK UNIFIED IDEOGRAPH-3400..CJK UNIFIED IDEOGRAPH-4DBF&#xA;4E00..9FFF    ; Ideographic # Lo [20992] CJK UNIFIED IDEOGRAPH-4E00..CJK UNIFIED IDEOGRAPH-9FFF&#xA;F900..FA6D    ; Ideographic # Lo [366] CJK COMPATIBILITY IDEOGRAPH-F900..CJK COMPATIBILITY IDEOGRAPH-FA6D&#xA;FA70..FAD9    ; Ideographic # Lo [106] CJK COMPATIBILITY IDEOGRAPH-FA70..CJK COMPATIBILITY IDEOGRAPH-FAD9&#xA;16FE4         ; Ideographic # Mn       KHITAN SMALL SCRIPT FILLER&#xA;17000..187F7  ; Ideographic # Lo [6136] TANGUT IDEOGRAPH-17000..TANGUT IDEOGRAPH-187F7&#xA;18800..18CD5  ; Ideographic # Lo [1238] TANGUT COMPONENT-001..KHITAN SMALL SCRIPT CHARACTER-18CD5&#xA;18D00..18D08  ; Ideographic # Lo   [9] TANGUT IDEOGRAPH-18D00..TANGUT IDEOGRAPH-18D08&#xA;1B170..1B2FB  ; Ideographic # Lo [396] NUSHU CHARACTER-1B170..NUSHU CHARACTER-1B2FB&#xA;20000..2A6DF  ; Ideographic # Lo [42720] CJK UNIFIED IDEOGRAPH-20000..CJK UNIFIED IDEOGRAPH-2A6DF&#xA;2A700..2B739  ; Ideographic # Lo [4154] CJK UNIFIED IDEOGRAPH-2A700..CJK UNIFIED IDEOGRAPH-2B739&#xA;2B740..2B81D  ; Ideographic # Lo [222] CJK UNIFIED IDEOGRAPH-2B740..CJK UNIFIED IDEOGRAPH-2B81D&#xA;2B820..2CEA1  ; Ideographic # Lo [5762] CJK UNIFIED IDEOGRAPH-2B820..CJK UNIFIED IDEOGRAPH-2CEA1&#xA;2CEB0..2EBE0  ; Ideographic # Lo [7473] CJK UNIFIED IDEOGRAPH-2CEB0..CJK UNIFIED IDEOGRAPH-2EBE0&#xA;2F800..2FA1D  ; Ideographic # Lo [542] CJK COMPATIBILITY IDEOGRAPH-2F800..CJK COMPATIBILITY IDEOGRAPH-2FA1D&#xA;30000..3134A  ; Ideographic # Lo [4939] CJK UNIFIED IDEOGRAPH-30000..CJK UNIFIED IDEOGRAPH-3134A&#xA;31350..323AF  ; Ideographic # Lo [4192] CJK UNIFIED IDEOGRAPH-31350..CJK UNIFIED IDEOGRAPH-323AF&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;Keep in mind that output has to be an image, not a unicode character, as per the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12155&quot;&gt;default loophole&lt;/a&gt;, but I recommend a text rendering engine to render each radical.&lt;/p&gt;&#xA;&lt;p&gt;You can assume the input won't contain private use characters.&lt;/p&gt;&#xA;&lt;p&gt;Use the following definitions of the Ideographic Description Characters. The percentages are not defined in unicode, but made up for this challenge. Each component should be squashed to the required shape, so that each intermediate result is a square. The output should also be a square image. See also: &lt;a href=&quot;https://en.wikipedia.org/wiki/Chinese_character_description_languages#Ideographic_Description_Sequences&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://en.wikipedia.org/wiki/Chinese_character_description_languages#Ideographic_Description_Sequences&lt;/a&gt;&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Code point&lt;/th&gt;&#xA;&lt;th&gt;Character&lt;/th&gt;&#xA;&lt;th&gt;Meaning&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;U+2FF0&lt;/td&gt;&#xA;&lt;td&gt;⿰&lt;/td&gt;&#xA;&lt;td&gt;divide horizontally in halves&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;U+2FF1&lt;/td&gt;&#xA;&lt;td&gt;⿱&lt;/td&gt;&#xA;&lt;td&gt;divide vertically in halves&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;U+2FF2&lt;/td&gt;&#xA;&lt;td&gt;⿲&lt;/td&gt;&#xA;&lt;td&gt;divide horizontally in thirds&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;U+2FF3&lt;/td&gt;&#xA;&lt;td&gt;⿳&lt;/td&gt;&#xA;&lt;td&gt;divide vertically in thirds&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;U+2FF4&lt;/td&gt;&#xA;&lt;td&gt;⿴&lt;/td&gt;&#xA;&lt;td&gt;enclose; the lengths should be 20%, 60%, 20%&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;U+2FF5&lt;/td&gt;&#xA;&lt;td&gt;⿵&lt;/td&gt;&#xA;&lt;td&gt;surround from top; the inner has 60% the width and 80% of the height&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;U+2FF6&lt;/td&gt;&#xA;&lt;td&gt;⿶&lt;/td&gt;&#xA;&lt;td&gt;surround from below; the inner has 60% the width and 80% of the height&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;U+2FF7&lt;/td&gt;&#xA;&lt;td&gt;⿷&lt;/td&gt;&#xA;&lt;td&gt;surround from left; the inner has 80% the width and 60% of the height&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;U+2FF8&lt;/td&gt;&#xA;&lt;td&gt;⿸&lt;/td&gt;&#xA;&lt;td&gt;surround from top-left; the inner has 80% the width and height&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;U+2FF9&lt;/td&gt;&#xA;&lt;td&gt;⿹&lt;/td&gt;&#xA;&lt;td&gt;surround from top-right; the inner has 80% the width and height&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;U+2FFA&lt;/td&gt;&#xA;&lt;td&gt;⿺&lt;/td&gt;&#xA;&lt;td&gt;surround from top-right; the inner has 80% the width and height&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;U+2FFB&lt;/td&gt;&#xA;&lt;td&gt;⿻&lt;/td&gt;&#xA;&lt;td&gt;overlay with transparency&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Input&lt;/th&gt;&#xA;&lt;th&gt;Output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;虫&lt;/td&gt;&#xA;&lt;td&gt;虫&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;鬱&lt;/td&gt;&#xA;&lt;td&gt;鬱&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;⿰虫圭&lt;/td&gt;&#xA;&lt;td&gt;蛙&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;⿲彳圭亍&lt;/td&gt;&#xA;&lt;td&gt;街&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;⿵几皇&lt;/td&gt;&#xA;&lt;td&gt;凰&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;⿻工从&lt;/td&gt;&#xA;&lt;td&gt;巫&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;⿴囗⿰⿱鹵凼⿰丨㇌&lt;/td&gt;&#xA;&lt;td&gt;&lt;img src=&quot;https://i.stack.imgur.com/9h5z6.png&quot; alt=&quot;2&quot; /&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;⿱井蛙&lt;/td&gt;&#xA;&lt;td&gt;&lt;img src=&quot;https://i.stack.imgur.com/lTf7a.png&quot; alt=&quot;1&quot; /&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;⿱井⿰虫圭&lt;/td&gt;&#xA;&lt;td&gt;&lt;img src=&quot;https://i.stack.imgur.com/lTf7a.png&quot; alt=&quot;1&quot; /&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;⿱井⿰虫⿱土土&lt;/td&gt;&#xA;&lt;td&gt;&lt;img src=&quot;https://i.stack.imgur.com/lTf7a.png&quot; alt=&quot;1&quot; /&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;" OwnerUserId="46901" LastEditorUserId="46901" LastEditDate="2022-10-26T11:45:29.337" LastActivityDate="2022-10-26T11:45:29.337" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25272" PostTypeId="2" ParentId="2140" CreationDate="2022-10-26T01:31:42.697" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/253782/tic-tac-stub-your-toe&quot;&gt;Tic, Tac, stub your Toe&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="114131" LastEditorUserId="114131" LastEditDate="2022-10-26T14:20:23.457" LastActivityDate="2022-10-26T14:20:23.457" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25273" PostTypeId="2" ParentId="25251" CreationDate="2022-10-26T05:19:53.303" Score="6" Body="&lt;h1&gt;&lt;s&gt;Infinite Santa Queue Rename Sorry&lt;/s&gt;&lt;/h1&gt;&#xA;&lt;p&gt;(no preferred date)&lt;/p&gt;&#xA;&lt;p&gt;Santa is a busy man. This Christmas, he's delivering infinitely many presents to infinitely many people. He has a list of the repeating 2D pattern of Naughty and Nice houses to deliver to, and tasks the elves with coming up with a repeating sequence of items (either Coal or Gifts) to deliver to them.&lt;/p&gt;&#xA;&lt;p&gt;Your job is to verify, given Santa's naughty-and-nice-list, and the elves' gift-or-coal sequence, whether it is possible for Santa to deliver nonstop.&lt;/p&gt;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&lt;p&gt;You are given Santa's grid as a square pattern of values representing either Naughty or Nice houses. For our examples, we will be using &lt;code&gt;0&lt;/code&gt; for Naughty and &lt;code&gt;1&lt;/code&gt; for Nice. You may assume there will always be at least one of each. Example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 1 0 1&#xA;1 1 0 0&#xA;0 0 0 1&#xA;0 0 1 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This pattern tiles the infinite grid of houses:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    . . . . . . . .&#xA;    . . . . . . . .&#xA;    . . . . . . . .&#xA;... 1 1 0 1 1 1 0 1 ...&#xA;... 1 1 0 0 1 1 0 0 ...&#xA;... 0 0 0 1 0 0 0 1 ...&#xA;... 0 0 1 1 0 0 1 1 ...&#xA;... 1 1 0 1 1 1 0 1 ...&#xA;... 1 1 0 0 1 1 0 0 ...&#xA;... 0 0 0 1 0 0 0 1 ...&#xA;... 0 0 1 1 0 0 1 1 ...&#xA;    . . . . . . . .&#xA;    . . . . . . . .&#xA;    . . . . . . . .&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Similarly, the elves give you a list of items, with values representing either Coal or Gifts. In the examples, we will be using &lt;code&gt;0&lt;/code&gt;s to represent Coal, and &lt;code&gt;1&lt;/code&gt;s to represent Gifts. You may assume there will always be at least one of each. Naughty houses should be delivered Coal, and Nice houses should be delivered Presents. &lt;strong&gt;Note that every house may not necessarily receive an item&lt;/strong&gt;, but each house in Santa's path should be delivered the &lt;em&gt;correct&lt;/em&gt; item.&lt;/p&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 0 1 1 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This list of items repeats infinitely &lt;code&gt;1 0 1 1 0 1 0 1 1 0 1 0 1 1 0...&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;(TODO: put a worked out example of the decision problem here)&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;decision-problem-container&quot;&gt;decision-problem&lt;/a&gt;: Decide whether, with a given infinite list and on a given infinite grid, Santa can follow an orthogonal path on the infinite grid and deliver each item on the list to each house he passes in order.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;: Shortest code in bytes wins!&lt;/p&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;p&gt;(todo!)&lt;/p&gt;&#xA;&lt;h2&gt;meta:&lt;/h2&gt;&#xA;&lt;p&gt;THIS is a work in progress sorry for quality issues im working on it ive been really busy lately but i wanna participate if possible at all haha !!! ^_^&lt;/p&gt;&#xA;" OwnerUserId="107310" LastEditorUserId="78410" LastEditDate="2022-11-29T05:45:55.950" LastActivityDate="2022-11-29T05:45:55.950" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25274" PostTypeId="2" ParentId="2140" CreationDate="2022-10-26T11:59:37.013" Score="3" Body="&lt;h1&gt;Is this series of quotes valid python? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;decision-problem-container&quot;&gt;decision-problem&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Python string parsing has quite a few edge cases. This is a string:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;a&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Putting 2 strings immediately after each other implicitly concatenates them, so this is also a string:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;a&amp;quot;&amp;quot;a&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;However, if you put 3 quotes in a row, it will create a &amp;quot;triple quoted string&amp;quot; which can only be ended by another triple quoted string. A triple quoted string can contain other quotes. These quotes will not end the string unless there are 3 of them. Thus this is valid:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;&amp;quot;&amp;quot;a&amp;quot;a&amp;quot;&amp;quot;&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Of course, you can combine these together, so this is a valid string:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;&amp;quot;&amp;quot;a&amp;quot;&amp;quot;&amp;quot;&amp;quot;a&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;aaa&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;A string is &lt;em&gt;not&lt;/em&gt; valid if:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Any &lt;code&gt;a&lt;/code&gt; appears outside of a string literal (would get &lt;code&gt;SyntaxError: invalid syntax&lt;/code&gt; in python) OR&lt;/li&gt;&#xA;&lt;li&gt;The end of the sequence is inside a string literal (would get &lt;code&gt;SyntaxError: unterminated string literal (detected at line 1)&lt;/code&gt; in python)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Your task&lt;/h2&gt;&#xA;&lt;p&gt;Given a string containing 2 distinct characters, one representing a double quote and another representing any alphanumeric character, determine if it would be a valid python string, or invalid syntax.&lt;/p&gt;&#xA;&lt;p&gt;You do not need to consider single quotes or how double and single quotes normally interact.&lt;/p&gt;&#xA;&lt;p&gt;A array of booleans or a array of bytes would also be a valid input method.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, shortest answer wins.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Truthy&lt;/th&gt;&#xA;&lt;th&gt;Falsy&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;&amp;quot;a&amp;quot;&lt;/code&gt; (1-1)&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;&amp;quot;a&lt;/code&gt; (1)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;&amp;quot;a&amp;quot;&amp;quot;a&amp;quot;&lt;/code&gt; (1-2-1)&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;&amp;quot;a&amp;quot;a&amp;quot;&lt;/code&gt; (1-1-1)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;&amp;quot;&amp;quot;&amp;quot;a&amp;quot;a&amp;quot;&amp;quot;&amp;quot;&lt;/code&gt; (3-1-3)&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;&amp;quot;&amp;quot;a&amp;quot;a&amp;quot;&amp;quot;&amp;quot;&lt;/code&gt; (2-1-3)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;&amp;quot;&amp;quot;&amp;quot;a&amp;quot;&amp;quot;&amp;quot;&amp;quot;a&amp;quot;&lt;/code&gt; (3-4-1)&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;&amp;quot;&amp;quot;&amp;quot;a&amp;quot;&amp;quot;&amp;quot;a&amp;quot;&lt;/code&gt; (3-3-1)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;aaa&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&lt;/code&gt; (5-9)&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;aaa&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&lt;/code&gt; (5-8)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&lt;/code&gt; (12)&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;aaa&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&lt;/code&gt; (6-8)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;&amp;quot;a&amp;quot;&amp;quot;a&amp;quot;&amp;quot;a&amp;quot;&amp;quot;a&amp;quot;&lt;/code&gt; (1-2-2-2-1)&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;&amp;quot;&amp;quot;&amp;quot;&amp;quot;&lt;/code&gt; (4)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;&amp;quot;a&amp;quot;&amp;quot;&amp;quot;&lt;/code&gt; (1-3)&lt;/td&gt;&#xA;&lt;td&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;&lt;code&gt;eval&lt;/code&gt; or &lt;code&gt;exec&lt;/code&gt; or &lt;code&gt;ast.literal_eval&lt;/code&gt; would be &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17718/91213&quot;&gt;valid&lt;/a&gt; answers, though I hope to see more creative python answers as well.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2022-10-27T12:26:22.513" LastActivityDate="2022-10-27T12:26:22.513" CommentCount="22" ContentLicense="CC BY-SA 4.0" />
  <row Id="25275" PostTypeId="2" ParentId="2447" CreationDate="2022-10-26T14:02:09.123" Score="14" Body="&lt;h1&gt;Strings, arrays of characters, and arrays of bytes are interchangeable&lt;/h1&gt;&#xA;&lt;p&gt;Surprised this isn't here yet.&lt;/p&gt;&#xA;&lt;p&gt;Languages like C don't really have strings, and arrays of bytes (&lt;code&gt;*char&lt;/code&gt;) is already the common way of representing them. C++ does have strings but most CGSE answers still seem to prefer pointers to arrays of bytes.&lt;/p&gt;&#xA;&lt;p&gt;Other languages like Rust have strings that are really inconvenient to work with, so I've already been using &lt;code&gt;[u8]&lt;/code&gt; and &lt;code&gt;Vec&amp;lt;u8&amp;gt;&lt;/code&gt; most of the time.&lt;/p&gt;&#xA;&lt;p&gt;Answers may in some cases prefer using string tools on arrays, as long as the array will never have values over 255 taking input as a string then using functions like &lt;code&gt;.replace()&lt;/code&gt; and &lt;code&gt;.split()&lt;/code&gt; would be valid.&lt;/p&gt;&#xA;&lt;p&gt;Or some languages, like regex, have only strings and would make some number challenges very inconvenient without using char values.&lt;/p&gt;&#xA;&lt;p&gt;Actually this is already the default as stated &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8964/91213&quot;&gt;here&lt;/a&gt; but I think including it here is still valuable since this post is a lot easier to find.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2022-10-27T07:20:04.887" LastActivityDate="2022-10-27T07:20:04.887" CommentCount="0" CommunityOwnedDate="2022-10-26T14:02:09.123" ContentLicense="CC BY-SA 4.0" />
  <row Id="25277" PostTypeId="2" ParentId="2140" CreationDate="2022-10-27T08:57:23.963" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/253989/114446&quot;&gt;Power sequence differences&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="114446" LastEditorUserId="114446" LastEditDate="2022-11-01T11:47:09.713" LastActivityDate="2022-11-01T11:47:09.713" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25279" PostTypeId="2" ParentId="25251" CreationDate="2022-10-27T15:36:18.840" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255373/cgac2022-day-10-help-santa-sort-presents&quot;&gt;CGAC2022 Day 10: Help Santa sort presents!&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96037" LastEditorUserId="96037" LastEditDate="2022-12-21T13:05:42.783" LastActivityDate="2022-12-21T13:05:42.783" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25280" PostTypeId="2" ParentId="2140" CreationDate="2022-10-27T17:20:46.007" Score="0" Body="&lt;h1&gt;Speed Checkers KOTH&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;For this King of the Hill challenge, your bot will play checkers against an opponent. However, you should be careful when making complex calculations, because both sides have a limited amount of time to play! Each side will start with 1,000,000 cycles [or 1 second, depending on what I use for the API] to spend during their turn, and if this runs out they will lose the game.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;king-of-the-hill-container&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/checkers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;checkers&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;checkers&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;checkers-container&quot;&gt;checkers&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This is my attempt at making a KOTH challenge where your runtime matters.&lt;/p&gt;&#xA;&lt;p&gt;Before I do the rest of the write-up, is the concept good? Is the amount of time given right? Should I use a simpler game? Should the API be in an assembly language, or in a Java runner?&lt;/p&gt;&#xA;" OwnerUserId="75524" LastActivityDate="2022-10-27T17:20:46.007" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25282" PostTypeId="2" ParentId="25251" CreationDate="2022-10-27T21:24:55.037" Score="5" Body="&lt;h1&gt;Light all of the candles&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Preferred date: (Hanukkah) &amp;gt;= Dec 18&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;It's Hanukkah! Unfortunately, it appears some of the candles in your menorah have been blown out. You've got a lighter on hand, but it doesn't work quite right. Whenever you use your lighter at position k, the candles at positions k-1, k, and k+1 all toggle. Let's see an example. We'll represent our candles as a binary sequence with 1 being the &amp;quot;lit&amp;quot; state.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1, 1, 1, 1, 0, 1, 1, 1, 1]  initial&#xA;[1, 1, 1, 0, 1, 0, 1, 1, 1]  light 4&#xA;[1, 1, 0, 1, 0, 0, 1, 1, 1]  light 3&#xA;[0, 0, 1, 1, 0, 0, 1, 1, 1]  light 1&#xA;[1, 1, 1, 1, 0, 0, 1, 1, 1]  light 0&#xA;[1, 1, 1, 1, 1, 1, 0, 1, 1]  light 5&#xA;[1, 1, 1, 1, 1, 1, 1, 0, 0]  light 7&#xA;[1, 1, 1, 1, 1, 1, 1, 1, 1]  light 8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;To cover our candelabra bases, we'll be working with any n&amp;gt;0 candles. Given the initial state of the candles as input, you must output a lighter usage sequence which will result in all of the candles being lit. Input and output can be taken in any reasonable form for a sequence. Output can be 0 or 1 indexed, but all numbers must fall within the range of the length (ie. no using the lighter at -1). You may assume that the input is always solvable, and you need only output one valid solution.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;These examples are zero indexed.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1, 1, 1, 1, 0, 1, 1, 1, 1] -&amp;gt; [4, 3, 1, 0, 5, 7, 8]&#xA;[0, 1, 1, 1, 1, 1, 1, 1, 1] -&amp;gt; [1, 2, 4, 5, 7, 8]&#xA;[1, 0, 1, 1, 1, 1, 1, 1, 1] -&amp;gt; [2, 4, 5, 7, 8]&#xA;[0, 0, 0, 0, 0, 0, 0, 0, 0] -&amp;gt; [1, 4, 7]&#xA;[1, 1, 1, 1, 1, 1, 1, 1, 1] -&amp;gt; []&#xA;[1, 1, 1, 0, 1, 1, 1] -&amp;gt; [0, 1, 3, 5, 6]&#xA;[0, 1, 1, 1, 1, 1, 1] -&amp;gt; [0, 2, 3, 5, 6]&#xA;[1, 1, 1, 1, 1, 1, 1] -&amp;gt; []&#xA;[0] -&amp;gt; [0]&#xA;[1] -&amp;gt; []&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="73054" LastEditorUserId="73054" LastEditDate="2022-10-28T05:49:37.347" LastActivityDate="2022-10-28T05:49:37.347" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25283" PostTypeId="2" ParentId="25251" CreationDate="2022-10-28T18:48:57.607" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255591/cgac-day-17-present-heap&quot;&gt;CGAC Day 17: Present Heap&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2022-12-16T19:32:32.913" LastActivityDate="2022-12-16T19:32:32.913" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25284" PostTypeId="2" ParentId="2140" CreationDate="2022-10-29T00:56:27.367" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;decision-problem-container&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Number program police&lt;/h1&gt;&#xA;&lt;p&gt;This question is related to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/233919/counting-and-so-on&quot;&gt;Counting and so on&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Content&lt;/h2&gt;&#xA;&lt;p&gt;With some clever engineering, we now have program that can count like us.&lt;/p&gt;&#xA;&lt;p&gt;But this is not enough. We are making a math society and society isn't as simple as counting.&lt;/p&gt;&#xA;&lt;p&gt;There is always some blatant &lt;em&gt;number police&lt;/em&gt; who calls you out if you makes a single bit of mistake. Without those &lt;em&gt;police&lt;/em&gt; it will never be a complete society.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Make a program that identifies whether a &lt;code&gt;shape&lt;/code&gt; is a &lt;code&gt;number shape&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;shape&lt;/h2&gt;&#xA;&lt;p&gt;A shape is a Boolean matrix, here represented using spaces and #s:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; ########&#xA; #   ####&#xA; ########&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(the above shape is also an example of valid Number shape which represents &lt;code&gt;0&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;h2&gt;Number shape&lt;/h2&gt;&#xA;&lt;p&gt;Basic &lt;code&gt;Number shape&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  #  ###  ###  # #  ###  ###  ###  ###  ###  ###&#xA;  #    #    #  # #  #    #      #  # #  # #  # #&#xA;  #  ###  ###  ###  ###  ###    #  ###  ###  # #&#xA;  #  #      #    #    #  # #    #  # #    #  # #&#xA;  #  ###  ###    #  ###  ###    #  ###    #  ###&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;A basic Number shape can be enlarged, twisted, be longer or shorter, while still being valid, as long as it Resembles the shape:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Is a Number shape of 9:&#xA;#####  ######  ###&#xA;##  #  #    #  # #&#xA;##  #  ######  ###&#xA;#####       #  ###&#xA;    #       #    #&#xA;    #       #    #&#xA;            #&#xA;&#xA;Is not a Number shape of 9:&#xA;&#xA;###   #####   ###  ####&#xA;# #   # #     # #  # ##&#xA;# #   ###     ###  ###&#xA;  #     #      #     #&#xA;        #      #     #&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;Acceptable reshape:&#xA;&#xA;Original shape:&#xA;&#xA;   ###               ####&#xA;   # #      widen    #  #&#xA;   ###     -------&amp;gt;  ####&#xA;     #                  #&#xA;     #                  #&#xA;&#xA;           extend   ###       shorten   ###&#xA;           -------&amp;gt; # #   or            # #&#xA;                    ###                 ###&#xA;                      #                   #&#xA;                      #&#xA;                      #&#xA;&#xA;&#xA;&#xA;          lengthen  ###&#xA;           -------&amp;gt; # #&#xA;                    # #&#xA;                    ###&#xA;                      #&#xA;                      #&#xA;&#xA;     enlarge line   ###      ####      ####      ###           ###&#xA;           -------&amp;gt; ###  or  # ##  or  ## #  or  # #  but not  # # (this is&#xA;                    # #      ####      ####      ###           ###  not 9&#xA;                    ###        ##         #      ###           ###  but a 0)&#xA;                      #        ##         #        #           ###  &#xA;                      #        &#xA;&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You can do 1 or more of those actions on the same digit for any amount of units, for example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#####&#xA;#  ##&#xA;#  ##&#xA;#####&#xA;   ##&#xA;   ##&#xA;   ##&#xA;   ##&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Is Widened, extended, enlarged, and lengthened.&lt;/p&gt;&#xA;&lt;p&gt;The Basic Number shape (or smaller varient of it) should be obtained if you repeatedly remove one out of two consecutive identical rows or columns.&lt;/p&gt;&#xA;&lt;p&gt;For digits that contain a hole in it (6, 8, 9, 0), the hole should exist for it to be valid (length, wide does not matter).&lt;/p&gt;&#xA;&lt;p&gt;For U-shaped holes (2, 3, 4, 5, 6), those should have at least one empty byte that resembles a hole:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;###  is done by shortening, and then enlarge line.&#xA; ##  &#xA;###  Valid.&#xA; ##&#xA;###&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For numbers that have more than one digit, digits should have at least one spacing between them, and they should not be connected in any way:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#  ###&#xA;#    #&#xA;#  ###&#xA;#  #&#xA;   ###&#xA;is identified as 12&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;A &lt;code&gt;Number shape&lt;/code&gt; can also start with 0:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;### #&#xA;# # #&#xA;### #&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;I/O&lt;/h2&gt;&#xA;&lt;p&gt;Basically follows the standard I/O rules:&lt;/p&gt;&#xA;&lt;p&gt;The input can be request in any convenience format&lt;/p&gt;&#xA;&lt;p&gt;For example, list the split with newline can be the input.&lt;/p&gt;&#xA;&lt;p&gt;The output follows the standard output rule&lt;/p&gt;&#xA;&lt;h2&gt;Testcase&lt;/h2&gt;&#xA;&lt;p&gt;Is &lt;code&gt;Number shape&lt;/code&gt;: (&lt;code&gt;-&lt;/code&gt; is to separate each testcase out)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;###&#xA;# #&#xA;###&#xA;------------------&#xA;#####&#xA;#####&#xA;## ##&#xA;#####&#xA;#####&#xA;------------------&#xA;### &#xA;# # #&#xA;### &#xA;------------------&#xA; ####&#xA; #  #&#xA; ####&#xA; #  #&#xA; ####&#xA;------------------&#xA;# # # # #&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Is not &lt;code&gt;Number shape&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; ##&#xA;  #&#xA;###&#xA;# &#xA;###&#xA;------------------&#xA;#####&#xA;#####&#xA;## ##&#xA;#####&#xA;  ###&#xA;------------------&#xA;######&#xA;# #  #&#xA;# ####&#xA;# ##&#xA;######&#xA;------------------&#xA;#######&#xA;#   # #&#xA;### ###&#xA;# #   #&#xA;###   #&#xA;------------------&#xA;####&#xA;# ##&#xA;####&#xA;## #&#xA;####&#xA;------------------&#xA;###&#xA;  #&#xA; ##&#xA;  #&#xA;###&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No standard loopholes&lt;/li&gt;&#xA;&lt;li&gt;is &lt;code&gt;code golf&lt;/code&gt; so shortest police is the best police.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the title good?&lt;/li&gt;&#xA;&lt;li&gt;Any tag that suits this question but not included?&lt;/li&gt;&#xA;&lt;li&gt;Is it clear?&lt;/li&gt;&#xA;&lt;li&gt;Extra suggestion would help me out a lot!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="101762" LastEditorUserId="101762" LastEditDate="2022-12-24T02:51:08.737" LastActivityDate="2022-12-24T02:51:08.737" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25285" PostTypeId="1" AcceptedAnswerId="25287" CreationDate="2022-10-30T00:42:42.687" Score="12" ViewCount="666" Body="&lt;p&gt;Recently, &lt;a href=&quot;https://codegolf.stackexchange.com/users/107299/seggan&quot;&gt;Seggan&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/conversation/aoc-tells-us-to-stop-infringing-their-trademarks&quot;&gt;received an email&lt;/a&gt; from &lt;a href=&quot;http://was.tl/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Eric Wastl&lt;/a&gt;, the owner of &lt;a href=&quot;https://adventofcode.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;Advent of Code&lt;/a&gt;, part of which is quoted below:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Please do not call your event something like &amp;quot;Advent of Code Golf&amp;quot;; this makes it look like an official Advent of Code event. &amp;quot;Advent of Code&amp;quot; is a registered trademark in the United States. You can call it something like &amp;quot;Code Golf Advent Calendar&amp;quot; or &amp;quot;Santa Golf&amp;quot; or &amp;quot;Christmas Code Golf&amp;quot; or &amp;quot;Code Golf December 2022&amp;quot;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Eric apparently has a trademark on the phrase &amp;quot;Advent of Code&amp;quot; and has decided that us calling &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/25251/16766&quot;&gt;our event&lt;/a&gt; &amp;quot;Advent of Code Golf&amp;quot; makes it sound like we're affiliated with him (which we're not, of course). After &lt;a href=&quot;https://chat.stackexchange.com/rooms/24153/conversation/aoc-name-trademark&quot;&gt;asking in the Law.SE chatroom&lt;/a&gt;, it seems that the best course of action is to rename the event. So the big question is:&lt;/p&gt;&#xA;&lt;h2&gt;What do we rename Advent of Code Golf?&lt;/h2&gt;&#xA;&lt;p&gt;Strictly speaking, we &lt;em&gt;probably&lt;/em&gt; don't &lt;em&gt;have&lt;/em&gt; to rename it. But I am, of course, not a lawyer and doing the rename is definitely the safest course of action. So, if you think you have a good name (or object to the rename) please post an answer to this question.&lt;/p&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="107299" LastEditDate="2022-11-14T17:12:08.760" LastActivityDate="2022-11-14T17:12:08.760" Title="What do we rename Advent of Code Golf?" Tags="|discussion|code-golf|advent-events|" AnswerCount="3" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="25286" PostTypeId="2" ParentId="25285" CreationDate="2022-10-30T00:42:42.687" Score="4" Body="&lt;h1&gt;Advent of Golf&lt;/h1&gt;&#xA;&lt;p&gt;I think this is the best solution.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Very similar to the original name&lt;/li&gt;&#xA;&lt;li&gt;Not similar enough to &amp;quot;Advent of Code&amp;quot; for trademark issues&lt;/li&gt;&#xA;&lt;li&gt;Nice and snappy&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="108218" LastActivityDate="2022-10-30T00:42:42.687" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25287" PostTypeId="2" ParentId="25285" CreationDate="2022-10-30T19:01:27.197" Score="28" Body="&lt;h1&gt;Code Golf Advent Calendar&lt;/h1&gt;&#xA;&lt;p&gt;(As suggested in the question)&lt;/p&gt;&#xA;&lt;p&gt;While I think &amp;quot;Advent of Golf&amp;quot; is snappier, I think it should be clearer that this is referring to code golfing in the name. 'Code Golf Advent Calendar' makes it very clear what the event is about.&lt;/p&gt;&#xA;" OwnerUserId="113573" LastActivityDate="2022-10-30T19:01:27.197" CommentCount="1" CommunityOwnedDate="2022-10-30T19:01:27.197" ContentLicense="CC BY-SA 4.0" />
  <row Id="25289" PostTypeId="2" ParentId="25251" CreationDate="2022-10-31T15:48:28.543" Score="5" Body="&lt;h1&gt;When The Planets Align&lt;/h1&gt;&#xA;&lt;p&gt;(no preferred date) \&#xA;Assigned date: December 25th&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;As a Christmas gift, you were given a toy solar system. In this toy, all the orbits are circular and happen in the same plane. Each planet starts at a fixed location, has a fixed circumference orbit, and moves at a fixed speed. You want to figure out, given these variables, at what time all of the planets will align (relative to the star which they orbit).&lt;/p&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;You are given three lists of non-negative integers, which are each &lt;span class=&quot;math-container&quot;&gt;\$n&amp;gt;1\$&lt;/span&gt; items long:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$R_x\$&lt;/span&gt;, indicating the circumference of orbit for planet &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; (will not be zero)&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$P_x\$&lt;/span&gt;, indicating the start position of planet &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; (positions are zero-indexed; you can assume &lt;span class=&quot;math-container&quot;&gt;\$P_x &amp;lt; R_x\$&lt;/span&gt; for all &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$S_x\$&lt;/span&gt;, indicating the number of units that planet &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; moves along its orbit&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;(You may also take these as a collection of 3-tuples &lt;span class=&quot;math-container&quot;&gt;\$(R_x, P_x, S_x)\$&lt;/span&gt; or a permutation thereof.)&lt;/p&gt;&#xA;&lt;p&gt;Starting from &lt;span class=&quot;math-container&quot;&gt;\$t=0\$&lt;/span&gt;, after each time step, each planet moves &lt;span class=&quot;math-container&quot;&gt;\$S_x\$&lt;/span&gt; units around their orbit (i.e. &lt;span class=&quot;math-container&quot;&gt;\$P_x \leftarrow (P_x + S_x) \mod P_x\$&lt;/span&gt;). Your goal is to find the &lt;em&gt;smallest&lt;/em&gt; time &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$P_x\$&lt;/span&gt; of all the planets are the same (i.e. &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$(P_1 + t * S_1) \mod R_1 = (P_2 + t * S_2) \mod R_2 = \ldots = (P_n + t * S_n) \mod R_n\$&lt;/span&gt;). You may assume that such a time exists.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;&lt;span class=&quot;math-container&quot;&gt;\$R\$&lt;/span&gt;&lt;/th&gt;&#xA;&lt;th&gt;&lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt;&lt;/th&gt;&#xA;&lt;th&gt;&lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;&lt;/th&gt;&#xA;&lt;th&gt;&lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt;&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;span class=&quot;math-container&quot;&gt;\$[1,1]\$&lt;/span&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;span class=&quot;math-container&quot;&gt;\$[0,0]\$&lt;/span&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;span class=&quot;math-container&quot;&gt;\$[0,0]\$&lt;/span&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;span class=&quot;math-container&quot;&gt;\$[100,100]\$&lt;/span&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;span class=&quot;math-container&quot;&gt;\$[0,99]\$&lt;/span&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;span class=&quot;math-container&quot;&gt;\$[1,0]\$&lt;/span&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;span class=&quot;math-container&quot;&gt;\$99\$&lt;/span&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;(TODO: I haven't verified these test cases with code; I also should add a few more)&lt;/p&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2022-11-29T19:31:00.427" LastActivityDate="2022-11-29T19:31:00.427" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="25290" PostTypeId="2" ParentId="25251" CreationDate="2022-10-31T18:51:14.380" Score="3" Body="&lt;h2&gt;Reduce, Reuse, Regift&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;decision-problem-container&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/origami&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;origami&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;origami&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;origami-container&quot;&gt;origami&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Traditionally presents are kept secret in boxes wrapped in paper. Since the ice caps are melting Santa Claus has begun to investigate some ways they might make the whole gift wrapping operation a little more eco-friendly. The first thing they've decided to do is to put all presents in perfectly cubic boxes.  This makes things more efficient to process and cuts down on waste. The second thing they are doing is to reuse some of the scrap paper to wrap boxes as opposed to tossing it.&lt;/p&gt;&#xA;&lt;p&gt;In this challenge you will help Santa make a machine which will identify which pieces of scrap can still be used to wrap gifts. Because of the industrial wrapper cutting machine used scraps will always be connected faces of a square tiling.&lt;/p&gt;&#xA;&lt;p&gt;For example you might get the following scrap:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;   #&#xA;####&#xA; #&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This scrap can fold around the cube perfectly with no overlap and no empty space.  Some scraps might overlap, for example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; #&#xA;#######&#xA;#&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Can wrap around the cube perfectly, but since there are more than 6 squares there must be overlap.  This is fine and this scrap can be used to wrap.&lt;/p&gt;&#xA;&lt;p&gt;Some scraps can't wrap a cube without leaving some gaps. For example&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;######&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This has 6 squares, but there's no way to fold them which covers all sides of a cube.  So this should be sent to the recycling plant.&lt;/p&gt;&#xA;&lt;p&gt;Some scraps &lt;em&gt;can&lt;/em&gt; wrap the cube but require fancy folding techniques.  For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;####&#xA;####&#xA;####&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This can be folded to wrap around a cube, but it requires folds that aren't along the edges of the squares. The wrapping machine just isn't that fancy, so this should be sent to the recycling plant.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;For this challenge, take a scrap as input in any reasonable method.  Output one of two consistent distinct values. One value should only be output if the scrap can be used as gift wrapping, the other should only be output if the scrap should be sent to the recycling plant.&lt;/p&gt;&#xA;&lt;p&gt;In order to be eco-friendly Santa is asking you to minimize the size of your source code as measured in bytes. (You've tried to explain that that's not how things work.) So this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Ideas for extensions&lt;/h2&gt;&#xA;&lt;p&gt;Would any of these extensions be fun or worthwhile for the advent event?&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Take a scrap and cut out as many (non-overlapping) scraps as possible which can be used to wrap presents. &lt;strong&gt;Harder&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Take a scrap and determine if it can wrap a cube &lt;em&gt;with fancy folds&lt;/em&gt;. &lt;strong&gt;Harder&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Scraps are made from the triangular tiling but need to wrap octahedral boxes. &lt;strong&gt;Harder, more complex input&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;You might at a glance extension 2 is easier. Just determine if the scrap contains some net right?  However the following can be used to wrap a cube and contains no net of the cube:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#######&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2022-10-31T18:51:14.380" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25291" PostTypeId="2" ParentId="2140" CreationDate="2022-10-31T19:21:42.133" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/254034/subleq-image-decoder&quot;&gt;Subleq image decoder&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;^^ edited 2022.11.03.&lt;/p&gt;&#xA;" OwnerUserId="98978" LastEditorUserId="98978" LastEditDate="2022-11-03T06:39:56.210" LastActivityDate="2022-11-03T06:39:56.210" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25292" PostTypeId="2" ParentId="25251" CreationDate="2022-10-31T21:42:57.897" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255161/110555&quot;&gt;CGAC2022 Day 4: Can Santa fit down the chimney?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110555" LastEditorUserId="110555" LastEditDate="2022-12-04T00:26:59.537" LastActivityDate="2022-12-04T00:26:59.537" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25293" PostTypeId="2" ParentId="2140" CreationDate="2022-11-01T06:18:11.860" Score="-1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/254081/rgb-to-hexadecimal&quot;&gt;RGB to Hexadecimal&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110681" LastEditorUserId="110681" LastEditDate="2022-11-03T09:27:20.983" LastActivityDate="2022-11-03T09:27:20.983" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25294" PostTypeId="2" ParentId="2140" CreationDate="2022-11-01T07:21:38.067" Score="1" Body="&lt;h1&gt;Longest Total Distance Cyclic Quine Chain &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-challenge-container&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;quine-container&quot;&gt;quine&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/busy-beaver&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;busy-beaver&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;busy-beaver&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;busy-beaver-container&quot;&gt;busy-beaver&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Write a program of upto 100 bytes that outputs another program that outputs another program etc. until after a &lt;em&gt;finite&lt;/em&gt; number of iterations outputting the original program again.&lt;/p&gt;&#xA;&lt;p&gt;Each program in the cycle must have a length less than or equal to 100 bytes.&lt;/p&gt;&#xA;&lt;p&gt;Your score is the sum of the Levenshtein distance between each program and it's output. I hope this leads to answers that do something more creative than change a single digit each time.&lt;/p&gt;&#xA;&lt;p&gt;Maximum possible score is: &lt;span class=&quot;math-container&quot;&gt;$$256^{101}$$&lt;/span&gt;&lt;/p&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2022-11-02T12:25:21.110" LastActivityDate="2022-11-02T12:25:21.110" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="25297" PostTypeId="2" ParentId="2140" CreationDate="2022-11-01T22:43:30.753" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/254179/counting-stripey-bracelets&quot;&gt;Counting Stripey Bracelets&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="53748" LastEditorUserId="53748" LastEditDate="2022-11-04T15:45:13.600" LastActivityDate="2022-11-04T15:45:13.600" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25298" PostTypeId="2" ParentId="2140" CreationDate="2022-11-01T22:53:36.560" Score="2" Body="&lt;h1&gt;Fastest approximate square root of a floating point number&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fewest-operations&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fewest-operations&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fewest-operations&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;fewest-operations-container&quot;&gt;fewest-operations&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;test-battery-container&quot;&gt;test-battery&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;math-container&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/approximation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;approximation&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;approximation&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;approximation-container&quot;&gt;approximation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;In this challenge, you'll approximate the square root of a floating point number, using some basic arithmetic, bitwise, and control flow operators. Your score will take into account the number of operations your code performs, in addition to its accuracy.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Background:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;(Expanation of how IEEE-754 double precision floats work)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Opcodes:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;(A list of operations, including basic arithmetic, bitwise, and conditionals/jumps)&lt;/p&gt;&#xA;&lt;p&gt;(Paradigm, probably either based on a finite number of registers or a stack, is yet to be decided)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Task:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a 64-bit floating point number, approximate its square root in the fewest number of operations possible. Your score is a sum of the scores for (around 100k) individual test cases, each of which is scored as the following, where &lt;span class=&quot;math-container&quot;&gt;\$n_{ops}\$&lt;/span&gt; is the number of operations the program took to complete, &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; is the input, and &lt;span class=&quot;math-container&quot;&gt;\$f(x)\$&lt;/span&gt; is the program's output:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$\frac{{n_{ops}}^2}{\max(\frac{f(x)}{\sqrt{x}},\frac{\sqrt{x}}{f(x)})}$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;(Note that the actual &lt;span class=&quot;math-container&quot;&gt;\$\sqrt{x}\$&lt;/span&gt; will be used for scoring, rather than the closest floating point value, meaning that even a maximally accurate submission would still be slightly penalized for inaccuracy)&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-11-01T22:53:36.560" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="25299" PostTypeId="2" ParentId="25285" CreationDate="2022-11-02T00:12:06.993" Score="6" Body="&lt;p&gt;Legal issues such as this are probably best handled by the Stack Exchange legal team. I don't think it's ideal for a community to be making legal decisions. If the owner of the Advent of Code trademark has a problem, their correct course of action is to send an email to legal@stackoverflow.com.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;But I am, of course, not a lawyer and doing the rename is definitely the safest course of action.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Keeping the community out of it also reduces the legal risks the community is exposed to. The law is weird, and it could certainly be that the act of renaming it (or the way it is renamed) may be &lt;em&gt;less&lt;/em&gt; safe than to allow the designated legal team handle it. The mere act of taking this into our own hands may cause legal liability to change hands from Stack Exchange to us. I don't know. I am not a lawyer.&lt;/p&gt;&#xA;" OwnerUserId="77109" LastEditorUserId="77109" LastEditDate="2022-11-02T00:22:32.467" LastActivityDate="2022-11-02T00:22:32.467" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="25300" PostTypeId="2" ParentId="25251" CreationDate="2022-11-02T12:21:43.587" Score="1" Body="&lt;h1&gt;&lt;s&gt;Sled Machine&lt;/s&gt;&lt;/h1&gt;&#xA;&lt;p&gt;(Idea from &lt;a href=&quot;https://www.youtube.com/watch?v=N-BbgqOjIqk&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cell Machine&lt;/a&gt;.)&lt;/p&gt;&#xA;&lt;p&gt;You are given a board.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;v.....&#xA;.&amp;gt;#O...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And a number, say, &lt;code&gt;5&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You will simulate the board for that many iterations.&lt;/p&gt;&#xA;&lt;h1&gt;Moving Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;gt;&lt;/code&gt; (sleds) moves right, &lt;code&gt;v&lt;/code&gt; moves down, &lt;code&gt;&amp;lt;&lt;/code&gt; moves left, and &lt;code&gt;^&lt;/code&gt; moves up. All sleds move at the same time.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;#&lt;/code&gt; (snowballs) generally do not move.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;O&lt;/code&gt; (rotater) rotate nearby sleds around it, from&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;gt;.&#xA;O.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;to&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;..&#xA;Ov&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;.&lt;/code&gt; is just empty.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Edge Cases (in order)&lt;/h1&gt;&#xA;&lt;p&gt;(By &amp;quot;X meet Y&amp;quot;, I mean &amp;quot;X moves into a cell that contains Y&amp;quot;)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Sled meet sled(s). Then they crash together and form a snowball.&lt;/li&gt;&#xA;&lt;li&gt;Sled meet snowball. Then the sled will push the snowball in the same direction.&lt;/li&gt;&#xA;&lt;li&gt;Snowball meet snowball. Then they compress to make one snowball.&lt;/li&gt;&#xA;&lt;li&gt;Snowball meet sled. Then the sled gets crashed and the snowball is moved.&lt;/li&gt;&#xA;&lt;li&gt;Sled meet rotator. Then the sled replaces the rotater.&lt;/li&gt;&#xA;&lt;li&gt;Snowball meet rotator. Then the rotator gets pushed.&lt;/li&gt;&#xA;&lt;li&gt;Rotator meet sled. Then the rotator is broken into pieces, and makes a snowball.&lt;/li&gt;&#xA;&lt;li&gt;Rotator meet snowball. Then the rotator is crashed into the snowball.&lt;/li&gt;&#xA;&lt;li&gt;Rotator meet rotator. Then the moving rotator disappears.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Anything travelling off the grid is considered to never exist again.&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; still applies.&lt;/p&gt;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&lt;h2&gt;TBD&lt;/h2&gt;&#xA;" OwnerUserId="111945" LastEditorUserId="78410" LastEditDate="2022-11-29T05:46:10.530" LastActivityDate="2022-11-29T05:46:10.530" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25301" PostTypeId="2" ParentId="25251" CreationDate="2022-11-02T12:41:33.400" Score="3" Body="&lt;h1&gt;&lt;s&gt;Momentum Sledding&lt;/s&gt;&lt;/h1&gt;&#xA;&lt;p&gt;(Idea from &lt;a href=&quot;https://www.amazon.sg/Math-Games-Bad-Drawings-Challenging/dp/0762499869&quot; rel=&quot;nofollow noreferrer&quot;&gt;Math Games With Bad Drawings&lt;/a&gt;.)&lt;/p&gt;&#xA;&lt;p&gt;You have a track, marked with a starting point and an ending point. &lt;code&gt;#&lt;/code&gt; is snow and &lt;code&gt;.&lt;/code&gt; is void.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;S###########....&#xA;...........#....&#xA;######.....#....&#xA;######.....#....&#xA;######..........&#xA;################&#xA;################&#xA;..............##&#xA;..............##&#xA;E###############&#xA;################&#xA;################&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You start with velocity &lt;span class=&quot;math-container&quot;&gt;\$(0,0)\$&lt;/span&gt;. Every frame you tweek your velocity by &lt;span class=&quot;math-container&quot;&gt;\$(h,v)\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$h,v\in\{-1,0,1\}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You will calculate the minimum ammount of frames it will take to go from the starting point to the ending point. You cannot travel to the void, but you can travel across void.&lt;/p&gt;&#xA;&lt;h1&gt;Walkthrough of Example&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;01#2##3#4#5#....&#xA;...........6....&#xA;######.....#....&#xA;######.....7....&#xA;######..........&#xA;###########8####&#xA;############9###&#xA;..............##&#xA;..............0#&#xA;6####5###4#####1&#xA;############3#2#&#xA;################&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;It took sisteen frames.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/yPXFD.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/yPXFD.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; still applies.&lt;/p&gt;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;S.....#######E&#xA;.#...#........&#xA;..#.#.........&#xA;...#..........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;7&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;S#.#..#...#..#.###E&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;7&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;S###########....&#xA;...........#....&#xA;######.....#....&#xA;######.....#....&#xA;######..........&#xA;################&#xA;################&#xA;..............##&#xA;..............##&#xA;E###############&#xA;################&#xA;################&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;16&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="111945" LastEditorUserId="111945" LastEditDate="2022-12-06T11:28:54.223" LastActivityDate="2022-12-06T11:28:54.223" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25302" PostTypeId="2" ParentId="2140" CreationDate="2022-11-03T16:18:56.347" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/254449/perfect-nontransitive-sets&quot;&gt;Perfect Nontransitive Sets&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="73054" LastEditorUserId="73054" LastEditDate="2022-11-10T14:27:23.207" LastActivityDate="2022-11-10T14:27:23.207" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="25303" PostTypeId="2" ParentId="2447" CreationDate="2022-11-04T09:46:06.687" Score="4" Body="&lt;h2&gt;Output may have any number of leading white space.&lt;/h2&gt;&#xA;&lt;p&gt;There is already a suggestion concerning &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24952/94076&quot;&gt;&lt;em&gt;trailing&lt;/em&gt; blanks&lt;/a&gt;.&#xA;This is about &lt;em&gt;preceding&lt;/em&gt; blanks.&#xA;Why should this be acceptable?&#xA;Suppose you wanna to write a &lt;code&gt;program&lt;/code&gt; in Pascal that prints the answer to the ultimate question of life, the universe, and everything.&#xA;You’ll simply write&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-pascal prettyprint-override&quot;&gt;&lt;code&gt;program p(output);begin writeLn(42)end.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;However, when the destination is a &lt;code&gt;text&lt;/code&gt; file (like &lt;code&gt;output&lt;/code&gt; is), for numeric &lt;code&gt;write&lt;/code&gt; arguments there’s an invisible &lt;strong&gt;implementation-defined&lt;/strong&gt; default minimum-width specifier.&#xA;Thus this &lt;code&gt;program&lt;/code&gt; &lt;em&gt;may&lt;/em&gt; print:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;         42&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;i. e. the &lt;code&gt;program&lt;/code&gt; is effectively doing a&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-pascal prettyprint-override&quot;&gt;&lt;code&gt;writeLn(output, 42:11)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The &lt;code&gt;:11&lt;/code&gt; indicates the &lt;em&gt;minimum&lt;/em&gt; number of characters the argument occupies (for &lt;em&gt;numeric&lt;/em&gt; arguments, for &lt;code&gt;char&lt;/code&gt;, &lt;code&gt;string&lt;/code&gt; and &lt;code&gt;Boolean&lt;/code&gt; it specifies &lt;em&gt;the exact&lt;/em&gt; width).&#xA;The default value is &lt;em&gt;implementation-defined&lt;/em&gt; thus different compilers may have different default values, possibly even &lt;code&gt;1&lt;/code&gt;.&#xA;If leading white space is prohibited you’ll have to write &lt;code&gt;:1&lt;/code&gt; yourself.&lt;/p&gt;&#xA;&lt;p&gt;Ultimately, like trailing blanks it does not inhibit legibility.&#xA;Specifically for many numbers it actually improves legibility, that’s why Pascal allows and some compilers do have a reasonably large default minimum-width.&lt;/p&gt;&#xA;" OwnerUserId="94076" LastActivityDate="2022-11-04T09:46:06.687" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25304" PostTypeId="2" ParentId="2140" CreationDate="2022-11-04T09:54:18.523" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/254224/114446&quot;&gt;Maximum average ord&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="114446" LastEditorUserId="114446" LastEditDate="2022-11-05T13:52:22.743" LastActivityDate="2022-11-05T13:52:22.743" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25305" PostTypeId="2" ParentId="2140" CreationDate="2022-11-04T20:13:37.740" Score="6" Body="&lt;h1&gt;Fractional Unicode Bars&lt;/h1&gt;&#xA;&lt;p&gt;Your program should take as input a number &lt;code&gt;n&lt;/code&gt; and output a bar composed of &lt;code&gt;n // 8&lt;/code&gt; ▉ characters (U+2588), as well as a final character which should be one of ▊ ▋ ▌ ▍ ▎▏(U+2589 to U+258F) representing &lt;code&gt;n % 8&lt;/code&gt;. If &lt;code&gt;n % 8&lt;/code&gt; is 0, your program should not output any additional characters. This is difficult to explain well in text, so here are some examples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input: 8&#xA;Output: ▉&#xA;Input: 32&#xA;Output: ▉▉▉▉&#xA;Input: 33&#xA;Output: ▉▉▉▉▏&#xA;Input: 35&#xA;Output: ▉▉▉▉▍&#xA;Input: 246&#xA;Output: ▉▉▉▉▉▉▉▉▉▉▉▉▉▉▉▉▉▉▉▉▉▉▉▉▉▉▉▉▉▉▊&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so shortest answer wins.&lt;/p&gt;&#xA;" OwnerUserId="108218" LastActivityDate="2022-11-04T20:13:37.740" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25306" PostTypeId="2" ParentId="2140" CreationDate="2022-11-05T20:04:51.780" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/254367/traverse-a-rectangles-antidiagonals&quot;&gt;Traverse a rectangle's antidiagonals&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="109946" LastEditorUserId="109946" LastEditDate="2022-11-08T16:40:51.457" LastActivityDate="2022-11-08T16:40:51.457" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25307" PostTypeId="2" ParentId="2140" CreationDate="2022-11-07T10:04:55.210" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/254429/prime-pyramid&quot;&gt;&amp;quot;Prime&amp;quot; pyramid&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97916" LastEditorUserId="97916" LastEditDate="2022-11-10T07:02:40.237" LastActivityDate="2022-11-10T07:02:40.237" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25308" PostTypeId="1" AcceptedAnswerId="25309" CreationDate="2022-11-09T00:38:27.220" Score="8" ViewCount="304" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19271/reviving-language-of-the-month-pick-up-where-we-left-off-or-start-over&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout November 2022, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;J&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;What's a Language of the Month?&lt;/h2&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19279/nominations-for-language-of-the-month-take-2?answertab=scoredesc#tab-top&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during November, those who wish to participate should learn (at least the basics of) J, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about J&lt;/h2&gt;&#xA;&lt;p&gt;J is a high-level, general-purpose programming language that is particularly suited to the mathematical, statistical, and logical analysis of data. It is a powerful tool for developing algorithms and exploring problems that are not already well understood.&lt;/p&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/jsoftware/jsource&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub Repo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://code.jsoftware.com/wiki/Main_Page&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wiki&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;Run J on &lt;a href=&quot;https://ato.pxeger.com/run?1=m70wa8GCpaUlaboWaBSUBgA&quot; rel=&quot;nofollow noreferrer&quot;&gt;ATO&lt;/a&gt; and &lt;a href=&quot;https://tio.run/#j&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://jsoftware.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Official site&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://www.jsoftware.com/help/learning/contents.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tutorial&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/J_(programming_language)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/6596/tips-for-golfing-in-j&quot;&gt;Tips for golfing in J&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Bounty&lt;/h2&gt;&#xA;&lt;p&gt;I, &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/s%ca%a8%c9%a0%c9%a0an&quot;&gt;Steffan&lt;/a&gt;, will offer a +100 bounty to every user's 1st J answer in November.&lt;/p&gt;&#xA;" OwnerUserId="92689" LastActivityDate="2022-11-26T19:31:33.150" Title="Language of the Month for November 2022: J" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25309" PostTypeId="2" ParentId="25308" CreationDate="2022-11-09T00:38:27.220" Score="6" Body="&lt;h1&gt;List of all J answers posted in November 2022&lt;/h1&gt;&#xA;&lt;p&gt;(Bolded means bountied)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/114249/indexize-a-number/253976#253976&quot;&gt;Indexize a number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110888/south&quot;&gt;south&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/99749/the-art-of-word-shaping/254016#254016&quot;&gt;The Art of Word Shaping&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/15469/jonah&quot;&gt;Jonah&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/253989/power-sequence-differences/254023#254023&quot;&gt;Power sequence differences&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110888/south&quot;&gt;south&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/73805/unslice-a-string/254071#254071&quot;&gt;Unslice a string&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/15469/jonah&quot;&gt;Jonah&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/142458/nth-differences/254262#254262&quot;&gt;Nth Differences&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/15469/jonah&quot;&gt;Jonah&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/66556/letters-get-moving/254334#254334&quot;&gt;Letters, Get Moving!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/15469/jonah&quot;&gt;Jonah&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/254224/maximum-average-ord/254365#254365&quot;&gt;Maximum average ord&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110888/south&quot;&gt;south&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/253857/length-of-binary-as-base-10-oeis-a242347/254424#254424&quot;&gt;Length of Binary as Base 10 [OEIS A242347]&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/247835/previous-fibonacci-number/254474#254474&quot;&gt;Previous Fibonacci number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110888/south&quot;&gt;south&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250338/shifted-auto-sum/254498#254498&quot;&gt;Shifted auto-sum&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/247804/reverse-hex-cipher/254500#254500&quot;&gt;Reverse hex cipher&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/92285/unix-uniq-uknow/254617#254617&quot;&gt;UNIX Uniq Uknow?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31957/conor-obrien&quot;&gt;Conor O'Brien&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/241373/help-me-sell-day-old-bagels/254779#254779&quot;&gt;Help me sell day-old bagels&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104752/m90&quot;&gt;m90&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant tips posted in November 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;tip summary&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant challenges posted in November 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="92689" LastEditorUserId="92689" LastEditDate="2022-11-26T19:31:33.150" LastActivityDate="2022-11-26T19:31:33.150" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25310" PostTypeId="2" ParentId="25251" CreationDate="2022-11-09T07:48:59.067" Score="5" Body="&lt;h1&gt;Reconstruct Santa's Book&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Date: Dec 20&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Oh no, Santa spilled wine all over his great book. Now most of the letters are illegible. How will Santa now know who is &lt;em&gt;groovy&lt;/em&gt; and who is &lt;em&gt;unspeakable&lt;/em&gt;?&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;There was once a sequence of words, like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;groovy groovy groovy unspeakable groovy groovy unspeakable unspeakable&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;However, most of the letters have gone missing and now it looks like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;     v   oo   g      unsp        gr   y gro            b   uns&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Then squashed together:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;voogunspgrygrobuns&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your task is to recover the &lt;em&gt;shortest sequence of words&lt;/em&gt; that could reduce to the given damaged string.&lt;/p&gt;&#xA;&lt;p&gt;Note: The words will never have any overlapping characters. Since the book uses different words in different languages you need to handle different words.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Word A&lt;/th&gt;&#xA;&lt;th&gt;Word B&lt;/th&gt;&#xA;&lt;th&gt;Sentence&lt;/th&gt;&#xA;&lt;th&gt;Result&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;a&lt;/td&gt;&#xA;&lt;td&gt;b&lt;/td&gt;&#xA;&lt;td&gt;ab&lt;/td&gt;&#xA;&lt;td&gt;ab&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ab&lt;/td&gt;&#xA;&lt;td&gt;cd&lt;/td&gt;&#xA;&lt;td&gt;abcd&lt;/td&gt;&#xA;&lt;td&gt;ab cd&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ab&lt;/td&gt;&#xA;&lt;td&gt;cd&lt;/td&gt;&#xA;&lt;td&gt;abc&lt;/td&gt;&#xA;&lt;td&gt;ab cd&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ab&lt;/td&gt;&#xA;&lt;td&gt;cd&lt;/td&gt;&#xA;&lt;td&gt;ac&lt;/td&gt;&#xA;&lt;td&gt;ab cd&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ab&lt;/td&gt;&#xA;&lt;td&gt;cd&lt;/td&gt;&#xA;&lt;td&gt;bd&lt;/td&gt;&#xA;&lt;td&gt;ab cd&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ab&lt;/td&gt;&#xA;&lt;td&gt;cd&lt;/td&gt;&#xA;&lt;td&gt;bda&lt;/td&gt;&#xA;&lt;td&gt;ab cd ab&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ab&lt;/td&gt;&#xA;&lt;td&gt;cd&lt;/td&gt;&#xA;&lt;td&gt;aa&lt;/td&gt;&#xA;&lt;td&gt;ab ab&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ooq&lt;/td&gt;&#xA;&lt;td&gt;dr&lt;/td&gt;&#xA;&lt;td&gt;ooqdr&lt;/td&gt;&#xA;&lt;td&gt;ooq dr&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;ooq&lt;/td&gt;&#xA;&lt;td&gt;dr&lt;/td&gt;&#xA;&lt;td&gt;oooqdr&lt;/td&gt;&#xA;&lt;td&gt;ooq ooq dr&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;groovy&lt;/td&gt;&#xA;&lt;td&gt;unspeakable&lt;/td&gt;&#xA;&lt;td&gt;voogunspgrygrobuns&lt;/td&gt;&#xA;&lt;td&gt;groovy groovy groovy unspeakable groovy groovy unspeakable unspeakable&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2022-12-17T17:53:37.503" LastActivityDate="2022-12-17T17:53:37.503" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25311" PostTypeId="2" ParentId="2140" CreationDate="2022-11-10T04:54:56.843" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/254546/78410&quot;&gt;50 digits of π in HQ0-9+-INCOMPUTABLE?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-11-14T02:24:28.827" LastActivityDate="2022-11-14T02:24:28.827" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25312" PostTypeId="2" ParentId="2140" CreationDate="2022-11-10T10:08:37.393" Score="5" Body="&lt;h1&gt;Perceptron&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/171296/single-perceptron-implementation&quot;&gt;There was a previous perceptron question but it was closed&lt;/a&gt;. Also it required a lot of extra stuff that's not normally part of the perception algorithm like I know it. This question will be much simpler&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Perceptron&quot; rel=&quot;nofollow noreferrer&quot;&gt;Percepron&lt;/a&gt; is a extremely basic classification algorithm. While it still has some limited use it's been mostly overtaken by gradient descent based algorithms that can match much more complex functions. Still its fun and easy to implement, and is the foundation for many more complex algorithms.&lt;/p&gt;&#xA;&lt;p&gt;The dot product is defined as follows:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$(A_0, A_1, \dots, A_n) \cdot (B_0, B_1, \ldots, B_n) = A_0 B_0 + A_1 B_1 + \ldots + A_n B_n$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Algorithm Description&lt;/h2&gt;&#xA;&lt;p&gt;Percepron can classify vectors into 2 categories, simply by taking the dot product with some vector. If this is positive, you are in category A, if negative, then not.&lt;/p&gt;&#xA;&lt;p&gt;The algorithm to compute this vector works as follow:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;set the initial vector to &amp;lt;0, 0, ..., 0&amp;gt;&#xA;&#xA;while not every data point is classified correctly:&#xA;    let p be the first incorrectly classified point&#xA;    if the dot product is positive or zero but it should be negative:&#xA;        add p to the vector&#xA;    if the dot product is negative or zero but it should be positive:&#xA;        subtract p from the vector&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Among the many weaknesses of this algorithm is that it runs forever if no solution exists, that it can only classify categories separated by a straight plane, and that that plane must pass through the origin.&lt;/p&gt;&#xA;&lt;p&gt;You &lt;em&gt;do not&lt;/em&gt; need to follow this exact algorithm as long as you can guarantee a correct vector in all the cases this algorithm would.&lt;/p&gt;&#xA;&lt;h2&gt;The task&lt;/h2&gt;&#xA;&lt;p&gt;Take as input a list of positive tuples and a list of negative tuples. All tuples will all be the same length, and can contain any real number representable by a 32 bit float. Then output a vector that perfectly classifies them.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;. Shortest answer in each language wins.&lt;/p&gt;&#xA;&lt;p&gt;You may also take input as a single list of &lt;code&gt;((x0, ..., xn), category)&lt;/code&gt; tuples. You may take the length of the tuples as a extra input if desired.&lt;/p&gt;&#xA;&lt;p&gt;You may assume a solution exists for the input given.&lt;/p&gt;&#xA;&lt;p&gt;The tuples in the input will &lt;em&gt;always&lt;/em&gt; have 1 as their last value, representing bias.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;p&gt;Note: Many of these can be bisected by many different hyperplanes, any of them would be a valid result. Your code may still be correct if it produces very different values from this.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;    {&#xA;        &amp;quot;positive&amp;quot;: [[1,0, 1]],&#xA;        &amp;quot;negative&amp;quot;: [[0,1,1]],&#xA;        &amp;quot;result&amp;quot;: [1,-1,0]&#xA;    },&#xA;    {&#xA;        &amp;quot;positive&amp;quot;: [[12.12958530911699, 71.71547437602891, 17.615042787292396, 1.0], [22.894324259518754, 7.747740085241489, -16.379692578583914, 1.0], [-77.19508767650036, 26.391457800328325, -34.128081828012256, 1.0], [96.46713849700853, 8.223882871718914, 95.59810235088628, 1.0], [95.47166665625838, 36.07081574287895, 20.660512993212635, 1.0]],&#xA;        &amp;quot;negative&amp;quot;: [[-41.92974660410673, -42.941790456679854, 21.407959882725905, 1.0], [-99.40397441836177, 26.174868779681844, 56.51788064358769, 1.0], [34.482060088467364, -96.36102804944655, 1.5810491199434153, 1.0], [-43.06995918058733, -65.8456447109237, -99.04122951157478, 1.0], [7.7462310407688335, -10.894130800401939, 77.86204331190197, 1.0], [44.47180923569721, -93.53543659179937, 6.715910740415197, 1.0], [71.16273132699712, -80.16856861976358, 48.05726245445331, 1.0]],&#xA;        &amp;quot;result&amp;quot;: [78.64936114023355, 237.2180619264857, -42.5708443640236, 10.0]&#xA;    },&#xA;    {&#xA;        &amp;quot;positive&amp;quot;: [[19.891204296811196, 10.95935510782877, 25.985095341720097, -39.87626202198886, 13.054847014298801, -0.8134570474536389, -54.24129976411458, 1], [-16.576268085926657, 4.5002152868197385, 6.698984554370156, -49.780067496976976, 3.9392362908185703, -11.457246915347255, -3.84485029930714, 1], [-6.424223219895211, -67.86203596702003, 0.6670934629448197, -67.56926034741468, -34.71326779844648, -19.40781793399796, -38.93217338522913, 1], [-55.06122442753092, -46.49216596542017, -28.522294222446035, -30.89448675440849, 25.85546157303159, -28.753484757197114, -67.37074950075419, 1], [12.753734640663126, -42.688681313433065, -37.073894323478854, -22.678023584770216, -12.23724620287598, 4.467063264393019, -28.749388172615724, 1], [-25.894264060028036, -4.384289071814308, 25.545930397049247, -53.005653882689884, -17.7501576060518, -19.66585588898353, -33.29502103119091, 1], [-32.104636572417846, -61.44888846917201, -41.89407929533455, 20.32097494020971, 8.703788581939762, 12.493571659393822, -35.255247777162495, 1], [24.15536843650885, -25.610207061176325, 16.08185788882571, -34.478497500787185, -18.915615320612233, 24.782283056323323, -24.770226555932894, 1], [6.765979248514711, -1.6248990886835486, 19.091220818794667, 14.715692506417057, 7.953257187955259, 12.722665623234263, 14.914783085366352, 1]],&#xA;        &amp;quot;negative&amp;quot;: [[-2.7270414497182855, 8.676310678740919, -72.98709301742022, -7.70910010724549, 10.477333664984855, -17.506198964389014, 18.233248667960424, 1], [-43.3010158973477, -20.807005424922295, -77.5083019019948, 16.126838313178908, -40.490353240152864, -11.81562605632648, -8.902497984641357, 1], [-31.71159835398403, -14.73301578999785, 13.902967116929815, -21.834371921202447, -40.86878402777407, 6.742152812766307, -16.213431636063206, 1], [-66.57071699396832, -2.6930106603672783, 24.856421108284607, 26.02555433076685, -45.195502153813656, -60.583102046347044, 18.622821621702442, 1], [-47.07567023723187, 8.668277396085415, -55.64099369519978, -24.3651014072761, -77.50500543887348, -29.67008512028478, -27.6004244984169, 1], [16.02465948636585, -64.28947887797132, -18.663992818184852, 11.001922130635734, -65.96111461946506, -70.07973218635979, -41.525576739268594, 1], [-33.6451045267202, -8.496296235717935, -20.129571219612984, 9.152732883489037, 10.242775447179753, -61.865587395289765, -32.78507965995476, 1], [-59.32306321222039, 12.522731642519034, 22.026994802405454, -18.062615366497297, -8.713470639955815, -44.04186584475624, 27.84951438666559, 1], [15.30669132488326, 4.865567302204951, -2.782248675090557, 24.252984759612147, -31.883249650258065, 0.5697927616565579, 22.431436239098076, 1], [1.0357436812954433, -32.44164907799862, 13.942522314820707, 16.30751529733827, -12.905194523861582, -22.446463524560656, 12.651474924205772, 1], [-56.03563699153419, 12.024854226295957, -39.90028407341309, 26.9268535257967, 23.808505964904285, 0.34968582027003947, -29.362006601750707, 1], [-85.14402438073334, -15.501824729148709, -63.38128746811267, -42.15734961052637, -4.1615796887736565, -7.25189532732314, -27.223088213381402, 1], [2.7529807581849184, -23.668062096200217, -9.028343561579462, 2.5495275958544283, 15.88901518194605, -59.28742737700396, 25.402434735936126, 1], [-49.514159298902705, -24.01610873489301, 19.949647054069544, -41.1158129509881, -53.808681913915706, -11.175092994514387, 16.753648710377945, 1], [13.052884356788013, -29.298799492103925, -11.675938518634197, -11.229831992030299, -82.661335125941, 0.4488670991709114, 15.5168860373427, 1], [-10.923814330565236, -44.964063927868544, -38.9909686186201, 15.763631832856007, -44.00734436715622, -54.69686019599016, -52.81999206838163, 1], [-43.815947420234714, 19.90446963235277, 4.773988726751696, -47.12560089860667, 13.028054180292472, -39.81105100874389, 16.639915018971934, 1], [-60.88215048423795, 18.63815015768826, 27.157195120177462, -31.93335885907136, -6.562377024790365, 20.3179674395969, 9.210423673803817, 1], [-20.199358866077134, -50.594347683405196, -65.49273675929138, 19.37323156150201, -13.877303200574588, 19.536120330891066, -17.908737459942998, 1], [-11.03148069515855, 18.400073052625856, -65.34212863735566, -5.32988003172234, 0.7010084382675785, 26.36787095325562, 22.718825279142763, 1], [-30.028696420764177, -20.038640467728513, -47.66006964061526, 1.669739637216125, 3.3366149257696947, -20.495524621115493, 11.79886970131642, 1]],&#xA;        &amp;quot;result&amp;quot;: [53.402165827630355, -96.34048665666451, 46.75018310196545, -58.648563298215464, 167.65173848467344, 54.84963473487821, -66.47771531555354, 6]&#xA;    }&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2022-11-17T14:43:43.770" LastActivityDate="2022-11-17T14:43:43.770" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25313" PostTypeId="2" ParentId="2140" CreationDate="2022-11-10T21:32:32.063" Score="0" Body="&lt;h1&gt;A Number Sequence with Everything&lt;/h1&gt;&#xA;&lt;h2&gt;&lt;em&gt;Work in Progress&lt;/em&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;Watch &lt;a href=&quot;https://www.youtube.com/watch?v=rBU9E-ZOZAI&quot; rel=&quot;nofollow noreferrer&quot;&gt;Numberphile's video&lt;/a&gt; featuring Neil Sloane to learn more.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;...&lt;/p&gt;&#xA;&lt;p&gt;This is sequence A342585 in the OEIS.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;If you like the oddly self-referential nature of this sequence, check out Van Eck's/Look and Say sequence (insert CGCC and Numberphile links here.)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This is one of those unconventional self-referential sequences. If you're intrigued, check out Van Eck's/Look and Say sequence (insert CGCC and Numberphile links here.)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{align}&#xA;&amp;amp; 0_0\\&#xA;&amp;amp; 1_0 \quad 1_1 \quad 0_2\\&#xA;&amp;amp; 2_0 \quad 1_1 \quad 2_2 \quad 0_3 \\&#xA;&amp;amp; 3_0 \quad 2_1 \quad 4_2 \quad 1_3 \quad 1_4 \quad 0_5 \\&#xA;\end{align}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;br&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;0_0 \;\cdot \;1_0 \quad 1_1 \quad 0_2 \;\cdot\; 2_0 \quad 1_1 \quad 2_2 \quad 0_3 \;\cdot\;3_0 \quad 2_1 \quad 4_2 \quad 1_3 \quad 1_4 \quad 0_5&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;br&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;0^0 \;\cdot \;0^1 \quad 1^1 \quad 2^0 \;\cdot\; 0^2 \quad 1^1 \quad 2^2 \quad 3^0 \;\cdot\;0^3 \quad 1^2 \quad 2^4 \quad 3^1 \quad 4^1 \quad 5^0&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so the answer with the fewest bytes wins.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/tags/sequence/info&quot;&gt;Sequence rules&lt;/a&gt; apply.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;sequence-container&quot;&gt;sequence&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;number-theory-container&quot;&gt;number-theory&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="87594" LastActivityDate="2022-11-10T21:32:32.063" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25314" PostTypeId="2" ParentId="2140" CreationDate="2022-11-11T14:52:51.367" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/254514/simple-boolean-algebra-calculator&quot;&gt;Simple Boolean Algebra Calculator&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="115553" LastEditorUserId="115553" LastEditDate="2022-11-12T19:27:53.593" LastActivityDate="2022-11-12T19:27:53.593" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25316" PostTypeId="2" ParentId="2140" CreationDate="2022-11-12T15:00:17.943" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://Transform%20a%20lattice%20polygon%20to%20minimum%20diameter%20by%20shearing&quot; rel=&quot;nofollow noreferrer&quot;&gt;Transform a lattice polygon to minimum diameter by shearing&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="107434" LastEditorUserId="107434" LastEditDate="2022-11-19T10:54:24.043" LastActivityDate="2022-11-19T10:54:24.043" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="25319" PostTypeId="2" ParentId="25251" CreationDate="2022-11-14T15:52:55.953" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255135/9288&quot;&gt;CGAC2022 Day 3: \$n\$-dimensional Chocolate Pyramid&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="9288" LastEditorUserId="9288" LastEditDate="2022-12-03T00:08:46.143" LastActivityDate="2022-12-03T00:08:46.143" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25320" PostTypeId="2" ParentId="2140" CreationDate="2022-11-16T01:20:26.197" Score="0" Body="&lt;h1&gt;Minimum Overlapping Points in Continuous Line Drawing&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Contour_drawing&quot; rel=&quot;nofollow noreferrer&quot;&gt;contour drawing&lt;/a&gt; is a type of drawing that is made of only one continuous line, meaning that the drawing utensil cannot leave the paper until the drawing is done. For the purposes of this challenge, we will only be using horizontal and vertical lines for the drawing utensil's movement from start to finish.&lt;/p&gt;&#xA;&lt;p&gt;Your task is, given an 8x8 image representing  a continuous line drawing, output the minimum number of overlapping points needed to draw the image continuously.&lt;/p&gt;&#xA;&lt;p&gt;For example, for this image:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/XeXXh.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/XeXXh.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The minimum number of overlapping points needed is 2 because it can be drawn like this, with the red points marking overlapping points:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/g1o9K.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/g1o9K.gif&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;There is no way to draw it without overlapping points twice or more.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can take the input in any convenient format, including as a matrix, list, image file, or ASCII art. You will need to specify what this expected input format is in your answer.&lt;/li&gt;&#xA;&lt;li&gt;Output can be in any convenient format.&lt;/li&gt;&#xA;&lt;li&gt;For every &amp;quot;step&amp;quot; of the drawing, the drawing utensil can only go left, right, up, or down for the purposes of this challenge.&lt;/li&gt;&#xA;&lt;li&gt;Points that are overlapped on more than once are counted as extra overlapped points. (Thus the first test case outputs 3, not 2 for overlapping on the center twice)&lt;/li&gt;&#xA;&lt;li&gt;You may assume that the input is valid and can be drawn with a continuous line.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Input&lt;/th&gt;&#xA;&lt;th&gt;Output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/dASqo.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/dASqo.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;br&gt;&lt;code&gt;........&lt;/code&gt;&lt;br&gt;&lt;code&gt;..@.....&lt;/code&gt;&lt;br&gt;&lt;code&gt;..@.....&lt;/code&gt;&lt;br&gt;&lt;code&gt;..@.....&lt;/code&gt;&lt;br&gt;&lt;code&gt;@@@@@@@.&lt;/code&gt;&lt;br&gt;&lt;code&gt;..@.....&lt;/code&gt;&lt;br&gt;&lt;code&gt;........&lt;/code&gt;&lt;br&gt;&lt;code&gt;........&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/wTCQu.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/wTCQu.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;br&gt;&lt;code&gt;........&lt;/code&gt;&lt;br&gt;&lt;code&gt;...@....&lt;/code&gt;&lt;br&gt;&lt;code&gt;...@....&lt;/code&gt;&lt;br&gt;&lt;code&gt;..@@@@@@&lt;/code&gt;&lt;br&gt;&lt;code&gt;...@....&lt;/code&gt;&lt;br&gt;&lt;code&gt;...@....&lt;/code&gt;&lt;br&gt;&lt;code&gt;...@....&lt;/code&gt;&lt;br&gt;&lt;code&gt;........&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/kb4Nt.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/kb4Nt.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;br&gt;&lt;code&gt;@@@@@@@@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@......@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@......@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@......@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@......@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@......@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@......@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@@@@@@@@&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/eVrC8.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/eVrC8.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;br&gt;&lt;code&gt;@@@@@@@@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@......@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@......@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@......@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@@@@@@@@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@......@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@......@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@@@@@@@@&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/ezjqN.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ezjqN.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;br&gt;&lt;code&gt;@@@@....&lt;/code&gt;&lt;br&gt;&lt;code&gt;@..@....&lt;/code&gt;&lt;br&gt;&lt;code&gt;@..@....&lt;/code&gt;&lt;br&gt;&lt;code&gt;@@@@@@@@&lt;/code&gt;&lt;br&gt;&lt;code&gt;...@...@&lt;/code&gt;&lt;br&gt;&lt;code&gt;...@...@&lt;/code&gt;&lt;br&gt;&lt;code&gt;...@...@&lt;/code&gt;&lt;br&gt;&lt;code&gt;...@@@@@&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/Ewkh2.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Ewkh2.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;br&gt;&lt;code&gt;..@@@@@@&lt;/code&gt;&lt;br&gt;&lt;code&gt;..@....@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@@@@@@.@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@.@..@.@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@.@@@@@@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@....@..&lt;/code&gt;&lt;br&gt;&lt;code&gt;@....@..&lt;/code&gt;&lt;br&gt;&lt;code&gt;@@@@@@..&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/wGmmM.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/wGmmM.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;br&gt;&lt;code&gt;........&lt;/code&gt;&lt;br&gt;&lt;code&gt;.@@@@@..&lt;/code&gt;&lt;br&gt;&lt;code&gt;.@.@.@..&lt;/code&gt;&lt;br&gt;&lt;code&gt;.@@@@@..&lt;/code&gt;&lt;br&gt;&lt;code&gt;.@.@.@..&lt;/code&gt;&lt;br&gt;&lt;code&gt;.@@@@@..&lt;/code&gt;&lt;br&gt;&lt;code&gt;........&lt;/code&gt;&lt;br&gt;&lt;code&gt;........&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/k1ORa.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/k1ORa.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;br&gt;&lt;code&gt;@@@@@@@@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@.@@@@.@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@.@@@@.@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@@@@@@@@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@@.@@.@@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@@....@@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@@@@@@@@&lt;/code&gt;&lt;br&gt;&lt;code&gt;@@@@@@@@&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/k6fjY.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/k6fjY.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;br&gt;&lt;code&gt;........&lt;/code&gt;&lt;br&gt;&lt;code&gt;..@.@...&lt;/code&gt;&lt;br&gt;&lt;code&gt;.@@@@@..&lt;/code&gt;&lt;br&gt;&lt;code&gt;..@.@...&lt;/code&gt;&lt;br&gt;&lt;code&gt;.@@@@@..&lt;/code&gt;&lt;br&gt;&lt;code&gt;..@.@...&lt;/code&gt;&lt;br&gt;&lt;code&gt;........&lt;/code&gt;&lt;br&gt;&lt;code&gt;........&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;7&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are there any similar questions to this?&lt;/li&gt;&#xA;&lt;li&gt;What would be some good tags to add?&lt;/li&gt;&#xA;&lt;li&gt;Should I make the task to only find whether the input is possible without any overlapping?&lt;/li&gt;&#xA;&lt;li&gt;Should there be an animation as explanation for the minimum overlapping points for each test case?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="91262" LastEditorUserId="91262" LastEditDate="2022-11-19T22:02:08.913" LastActivityDate="2022-11-19T22:02:08.913" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25321" PostTypeId="2" ParentId="2140" CreationDate="2022-11-16T03:35:56.140" Score="0" Body="&lt;p&gt;&lt;strong&gt;Lengthy numbers type C : remove one occurrece at time&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;decision-problem-container&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;A non negative integer number is a  &lt;em&gt;lengthy number type C&lt;/em&gt; if it can be erased by repeatedly removing &lt;strong&gt;only one&lt;/strong&gt; occurrence of the length of the number from it.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Erasing means cancel all the digits.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For simplicity and allowing different approaches we restrict the input to a number up to 11 digits length or in other words in the range [0..98765432111]&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Numbers less than 13 digits are guaranteed to have only one possible outcome while from 13 digits they require branches during the process because there can be overlaps.&lt;br /&gt;&#xA;For example a 13 digits number &lt;em&gt;1139138765421&lt;/em&gt; require to test both 13's in it because removing one instead of the other will give different results.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Numbers less than 12 digits are permutations of all the lengths in each step ( if they are lengthy C ) while from 12 digits there can be embedded lengths, for example 112087654321 has 12 inside 10.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&#xA;123  -&gt; remove 3&#xA;12   -&gt; remove 2&#xA;1    -&gt; remove 1 -&gt; erased&#xA;&#xA;133  -&gt; remove 3&#xA;13   -&gt; no 2 -&gt; not a lengthy C&#xA;&#xA;302  -&gt; remove 3&#xA;02   -&gt; remove 2&#xA;0    -&gt; not a lengthy C&#xA;&lt;/pre&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;p&gt;Truthy&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1, 12, 21, 123, 132, 213, 231, 312, 321, 1234, 4321, 42513, 635241, 3476251, 743986215, 3657211084, 11123456789, 11987654321&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Falsy&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0, 2, 3, 10, 11, 13, 20, 103, 133, 300, 301, 302, 303, 310, 322, 399, 1233, 1240, 3419, 4000, 632644, 1111111, 80000001, 1010101010, 10987654321, 1008765432, 11108765432, 11098765432, 11111111111&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, standard rules apply.&lt;br /&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Input can be given by any convenient method.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Output any two different values telling if the number is a lengthy number type C or not.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="84844" LastEditorUserId="84844" LastEditDate="2022-11-16T03:45:42.863" LastActivityDate="2022-11-16T03:45:42.863" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25322" PostTypeId="2" ParentId="141" CreationDate="2022-11-16T12:01:13.127" Score="-2" Body="&lt;p&gt;&lt;strong&gt;PLEASE I'm begging you DON'T MAKE IT impossible for US LANGUAGE DESIGNERS OVER HERE not to osmotically acquire biases toward the PRIMARY-MAINSTREAM-WORLDSTANDARD code-look/syntax&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Also, I have friends who are C-as-an-assembly-type purists that just decided to learn JSEc(s)maScript[TM] completely from scratch (like they refuse to even view-source anywhere til then) as a race next Summer, and I'd be surprised if they don't do challenges here,&lt;/p&gt;&#xA;&lt;p&gt;I know there's not a lot of us who post onobfuscated only under click to view hider &amp;quot;folds&amp;quot;, but I only hang out here because there are so many people who end up being so creatively cool in different ways to each-others' differently-selected personal learningstyles.&lt;/p&gt;&#xA;&lt;p&gt;Thanks!&lt;/p&gt;&#xA;" OwnerUserId="112293" LastActivityDate="2022-11-16T12:01:13.127" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25328" PostTypeId="2" ParentId="2140" CreationDate="2022-11-16T20:07:39.073" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/254728/114446&quot;&gt;Number to letters&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="114446" LastEditorUserId="114446" LastEditDate="2022-11-20T13:47:24.637" LastActivityDate="2022-11-20T13:47:24.637" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25329" PostTypeId="2" ParentId="2140" CreationDate="2022-11-17T10:03:34.923" Score="0" Body="&lt;h1&gt;LS, Part 1: Ana Gram &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;string-container&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;Warning&lt;/strong&gt;: Wouldn't you rather answer a challenge about ponies?&lt;sup&gt;1&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;hr&gt;&#xA;If you have read &lt;i&gt;The Hostile Hospital&lt;/i&gt;, you would know that the Baudelaire orphans, from one of the scraps of paper recovered from the Quagmire's notebooks, they discover a name, &quot;Ana Gram&quot;. Later on,  they realize that means the word &quot;anagram&quot;, not a name. And that information helps them in finding out who Count Olaf disguised Violet Baudelaire as (Laura V. Bleediotie). They have to search through the entire hospital list, but trace the correct person down. However, what if they lived in a time where YOU helped them? Not personally, but with a program?&lt;br&gt;&lt;br&gt;&#xA;&lt;p&gt;So your task today is simple. Given a string &lt;code&gt;a&lt;/code&gt; and an array, return a smaller array that contains all the possible anagrams of &lt;code&gt;a&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so shortest answer wins&lt;/li&gt;&#xA;&lt;li&gt;Make sure to lowercase everything in the array and the string&lt;/li&gt;&#xA;&lt;li&gt;Two strings that are the same are not anagrams&lt;/li&gt;&#xA;&lt;li&gt;Make sure to watch out for initials! You should also remove them&lt;/li&gt;&#xA;&lt;li&gt;There may be multiple possible anagrams. Output them all&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;String, Array &#xA;-&amp;gt; Array&#xA;&#xA;&amp;quot;Violet&amp;quot;, [&amp;quot;Veilo&amp;quot;,&amp;quot;Efh&amp;quot;, &amp;quot;Telvio&amp;quot;,&amp;quot;veliot&amp;quot;]&#xA;-&amp;gt; [&amp;quot;Telvio&amp;quot;,&amp;quot;veliot&amp;quot;]&#xA;&#xA;&amp;quot;Krotasmon&amp;quot;, [&amp;quot;Krota&amp;quot;,&amp;quot;Monsakrot&amp;quot;, &amp;quot;Trokasmont&amp;quot;,&amp;quot;KROTASMON&amp;quot;]&#xA;-&amp;gt; [&amp;quot;Monsakrot&amp;quot;]&#xA;&#xA;&amp;quot;Laura V. Bleediotie&amp;quot;, [&amp;quot;Violet Baudelaire&amp;quot;, &amp;quot;Violet. Baudelaire&amp;quot;, &amp;quot;VIOLeT BAUDELAIRE&amp;quot;, &amp;quot;BUADELIAR VIOLETM&amp;quot;, &amp;quot;Laura V. Bleediotie&amp;quot;]&#xA;-&amp;gt; [&amp;quot;Violet Baudelaire&amp;quot;, &amp;quot;Violet. Baudelaire&amp;quot;, &amp;quot;VIOLeT BAUDELAIRE&amp;quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;META:&lt;/h3&gt; Does the array part still qualify this as a dupe?&#xA;&lt;p&gt;&lt;sub&gt;1: Inspired by the &amp;quot;all rights reserved&amp;quot; page of LS: The Unauthorized Autobiography&lt;/sub&gt;&lt;/p&gt;&#xA;" OwnerUserId="110681" LastEditorUserId="110681" LastEditDate="2022-11-18T03:52:21.150" LastActivityDate="2022-11-18T03:52:21.150" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25330" PostTypeId="2" ParentId="2140" CreationDate="2022-11-17T15:21:27.543" Score="0" Body="&lt;h1&gt;Implement Casio's M &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;parsing-container&quot;&gt;parsing&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;string-container&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/254710/107017&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="107017" LastEditorUserId="107017" LastEditDate="2022-11-19T00:00:05.123" LastActivityDate="2022-11-19T00:00:05.123" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25331" PostTypeId="2" ParentId="2140" CreationDate="2022-11-17T18:27:41.827" Score="3" Body="&lt;h1&gt;Base Neutral Numbering System &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/primes&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;primes&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;primes-container&quot;&gt;primes&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2022-12-05T13:32:17.367" LastActivityDate="2022-12-05T13:32:17.367" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25332" PostTypeId="2" ParentId="2140" CreationDate="2022-11-18T20:32:31.117" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/254719/intermediate-boolean-algebra-calculator&quot;&gt;Intermediate Boolean Algebra Calculator&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="115553" LastEditorUserId="115553" LastEditDate="2022-11-19T14:16:06.550" LastActivityDate="2022-11-19T14:16:06.550" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25333" PostTypeId="2" ParentId="2140" CreationDate="2022-11-19T03:55:03.860" Score="0" Body="&lt;h1&gt;Getting over it with the space Cabbage, Wolf, Goat&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/254746/interstellar-cabbages-wolves-and-sheep&quot;&gt;Posted!&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="113599" LastEditorUserId="113599" LastEditDate="2022-11-21T17:50:43.880" LastActivityDate="2022-11-21T17:50:43.880" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25334" PostTypeId="2" ParentId="2140" CreationDate="2022-11-20T01:48:15.027" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/254768/1-to-n-column-and-row-sums&quot;&gt;1 to N column and row sums&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96039" LastEditorUserId="96039" LastEditDate="2022-11-21T22:19:13.003" LastActivityDate="2022-11-21T22:19:13.003" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25335" PostTypeId="2" ParentId="2140" CreationDate="2022-11-20T05:15:52.827" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/254857/is-it-a-legal-atomic-chess-move&quot;&gt;Is it a legal atomic chess move?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96039" LastEditorUserId="96039" LastEditDate="2022-11-24T03:51:29.323" LastActivityDate="2022-11-24T03:51:29.323" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="25336" PostTypeId="2" ParentId="25251" CreationDate="2022-11-21T00:16:58.633" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255274/78410&quot;&gt;CGAC2022 Day 7: Fen The Wicked&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-12-07T00:24:43.370" LastActivityDate="2022-12-07T00:24:43.370" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25337" PostTypeId="2" ParentId="25251" CreationDate="2022-11-21T00:28:31.050" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255305/78410&quot;&gt;CGAC2022 Day 8: Fen The Wicked, Part 2&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-12-08T00:02:59.917" LastActivityDate="2022-12-08T00:02:59.917" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25338" PostTypeId="2" ParentId="25251" CreationDate="2022-11-21T23:35:01.033" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255405/78410&quot;&gt;CGAC2022 Day 12: Santa&amp;#39;s gift and the laser lock&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-12-12T01:26:40.037" LastActivityDate="2022-12-12T01:26:40.037" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25339" PostTypeId="2" ParentId="25251" CreationDate="2022-11-22T00:38:13.880" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255439/78410&quot;&gt;CGAC2022 Day 13: Santa&amp;#39;s gift and the laser lock, Part 2&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-12-13T03:44:11.763" LastActivityDate="2022-12-13T03:44:11.763" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25340" PostTypeId="2" ParentId="25251" CreationDate="2022-11-23T07:51:48.217" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255464/78410&quot;&gt;CGAC2022 Day 14: Chimney cleaning&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-12-14T00:09:27.853" LastActivityDate="2022-12-14T00:09:27.853" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25341" PostTypeId="2" ParentId="25251" CreationDate="2022-11-24T04:28:32.227" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255496/78410&quot;&gt;CGAC2022 Day 15: Chimney cleaning, Part 2&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-12-15T00:05:05.863" LastActivityDate="2022-12-15T00:05:05.863" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25342" PostTypeId="2" ParentId="25251" CreationDate="2022-11-24T05:08:38.777" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255344/78410&quot;&gt;CGAC2022 Day 9: Playing with bits&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-12-09T00:30:42.987" LastActivityDate="2022-12-09T00:30:42.987" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25343" PostTypeId="2" ParentId="25251" CreationDate="2022-11-24T05:27:14.190" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255555/78410&quot;&gt;CGAC2022 Day 16: Playing with bits, Part 2&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-12-16T00:34:12.677" LastActivityDate="2022-12-16T00:34:12.677" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25344" PostTypeId="2" ParentId="2140" CreationDate="2022-11-24T14:38:32.917" Score="1" Body="&lt;h1&gt;Print the most uncommon character&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-referential&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-referential&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;self-referential&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;self-referential-container&quot;&gt;self-referential&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to write a full program or function that prints the character(s)* that appears in your code the least. For example, if my code was &lt;code&gt;AAAABBBBCCCDDD&lt;/code&gt;, then the program should print &lt;code&gt;CD&lt;/code&gt; or &lt;code&gt;DC&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All printed characters must appear at least three times in your code, but you will print only one character for each.&lt;/li&gt;&#xA;&lt;li&gt;You are only printing those character(s). If your language always includes a trailing newline, then that is allowed.&lt;/li&gt;&#xA;&lt;li&gt;All printed characters must be printable characters or newlines.&lt;/li&gt;&#xA;&lt;li&gt;If multiple characters all appear the least, you must print them all, without separation. Order does not matter.&lt;/li&gt;&#xA;&lt;li&gt;The program or function cannot be empty, so it has to be a minimum of three characters long.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;sub&gt;*Where &amp;quot;character(s)&amp;quot; is mentioned in the rules above, exceptions may be made for languages like TI-Basic or Piet which do not use characters.&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Are there any similar questions to this?&lt;/li&gt;&#xA;&lt;li&gt;Should I change the rules?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="91262" LastEditorUserId="91262" LastEditDate="2022-11-25T19:56:09.650" LastActivityDate="2022-11-25T19:56:09.650" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25345" PostTypeId="2" ParentId="2140" CreationDate="2022-11-25T16:32:24.917" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255297/numbers-metagolf&quot;&gt;&lt;code&gt;&amp;gt;&amp;lt;&amp;gt;&lt;/code&gt; numbers metagolf &lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/coding-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;coding-challenge&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;coding-challenge&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;coding-challenge-container&quot;&gt;coding-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/meta-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;meta-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;meta-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;meta-golf-container&quot;&gt;meta-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;restricted-complexity-container&quot;&gt;restricted-complexity&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2022-12-07T18:16:03.563" LastActivityDate="2022-12-07T18:16:03.563" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25346" PostTypeId="2" ParentId="2140" CreationDate="2022-11-25T17:57:32.203" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/254910/114446&quot;&gt;Find the nth number where the digit sum equals the number of factors&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="114446" LastEditorUserId="114446" LastEditDate="2022-11-27T17:06:47.810" LastActivityDate="2022-11-27T17:06:47.810" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25347" PostTypeId="2" ParentId="2140" CreationDate="2022-11-26T11:39:29.977" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/254947/114446&quot;&gt;Range of ASCII values&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="114446" LastEditorUserId="114446" LastEditDate="2022-11-28T17:30:47.257" LastActivityDate="2022-11-28T17:30:47.257" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25349" PostTypeId="2" ParentId="25251" CreationDate="2022-11-28T08:07:26.467" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255943/78410&quot;&gt;CGAC2022 Day 23: North Pole Railroads&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-12-23T00:03:28.310" LastActivityDate="2022-12-23T00:03:28.310" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25350" PostTypeId="2" ParentId="25251" CreationDate="2022-11-28T08:19:53.073" Score="0" Body="&lt;h1&gt;North Pole Railroads, Part 2&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Preferred date: Dec 23&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Santa and the Elves are secretly preparing for a new tourist train service, called &amp;quot;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25349/78410&quot;&gt;North Pole Railroads&lt;/a&gt;&amp;quot;. The train will travel through various sightseeing spots near the North Pole.&lt;/p&gt;&#xA;&lt;p&gt;As a part of this project, they want to know how many seats they will need. They already have the list of travels for each passenger (given as &amp;quot;from station X to station Y&amp;quot;), which is thanks to the same magic that lets Santa know which children are nice. Each station is numbered from 1, starting from the North Pole.&lt;/p&gt;&#xA;&lt;p&gt;The Elves are arguing over how to determine the number of seats. Another option is to have just enough seats to allow all passengers to choose their seats. Note that they will have to consider all possible order of reservations. Two passengers with strictly overlapping travel cannot share a seat (e.g. one is &lt;code&gt;(1, 3)&lt;/code&gt; and the other is &lt;code&gt;(2, 4)&lt;/code&gt;), but a travel that ends at X is not overlapping with another that starts at X.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Given the list of &lt;code&gt;X, Y&lt;/code&gt; pairs that represent the travel of each passenger, output how many seats will be needed for North Pole Railroads.&lt;/p&gt;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; rules apply. The shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;(1, 2), (2, 3), (1, 3), (3, 4) -&amp;gt; 3&#xA;1---2---3---4&#xA; AAA     DDD&#xA;     BBB&#xA; CCCCCCC&#xA;Explanation: if A takes seat 1 and B takes seat 2, C needs the third seat&#xA;&#xA;(1, 2), (1, 3), (2, 3), (3, 4) -&amp;gt; 3&#xA;Explanation: the order in the input does not matter&#xA;&#xA;(1, 3), (1, 3), (3, 6), (3, 6) -&amp;gt; 2&#xA;&#xA;(1, 5), (2, 8), (6, 9), (5, 7), (4, 6) -&amp;gt; 5&#xA;Explanation: B's travel overlaps with the other 4, so if ACDE gets to book first,&#xA;B will need the 5th seat&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2022-11-28T08:19:53.073" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25351" PostTypeId="2" ParentId="2140" CreationDate="2022-11-28T13:11:15.623" Score="-1" Body="&lt;h1&gt;LS, Part 2: Sebald Code &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;string-container&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;WARNING:&lt;/strong&gt; You still not gonna answer a challenge about ponies?&lt;/p&gt;&#xA;&lt;hr&gt;&#xA;&lt;p&gt;Sebald code is a code developed by Dr. Gustav Sebald purely for communication through movies. It is decoded like this:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;We look for an instance of &amp;quot;ring&amp;quot; case-insensitive&lt;/li&gt;&#xA;&lt;li&gt;Starting from the word just after the &amp;quot;ring&amp;quot; we add this to an empty string&lt;/li&gt;&#xA;&lt;li&gt;We jump 11 words and add the next word after that&lt;/li&gt;&#xA;&lt;li&gt;Repeat 2 and 3 until we pass one of the words &amp;quot;ring&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;The string we've been adding to is the plaintext.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Note that if the string doesn't contain &amp;quot;ring&amp;quot;, just return an empty string &lt;code&gt;''&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Testcases (TODO)&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so shortest answer wins!&lt;/p&gt;&#xA;" OwnerUserId="110681" LastEditorUserId="110681" LastEditDate="2022-11-30T04:40:27.407" LastActivityDate="2022-11-30T04:40:27.407" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25352" PostTypeId="2" ParentId="2140" CreationDate="2022-11-28T16:43:11.367" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255070/join-columnar-strings&quot;&gt;Join Columnar Strings&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;string-container&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2022-12-01T16:12:32.063" LastActivityDate="2022-12-01T16:12:32.063" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25354" PostTypeId="2" ParentId="2140" CreationDate="2022-11-28T21:43:07.040" Score="0" Body="&lt;p&gt;&lt;strong&gt;Four Candles&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;There is a tradition in Germany to have an Adventskranz in the run up to Christmas. This is basically four candles. One is lit each Sunday during advent (including the ones from the last Sundays) up until Christmas. This gave me an idea for an ASCII art challenge (we haven't had many of those recently).&lt;/p&gt;&#xA;&lt;p&gt;The challenge: Reproduce the burning of the candles exactly as shown below.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  ||     ||     ||     ||   &#xA; ____   ____   ____   ____&#xA;|    | |    | |    | |    |&#xA;|    | |    | |    | |    |&#xA;|    | |    | |    | |    |&#xA;|____| |___ | |____| |____|&#xA;&#xA;         ||     ||     ||   &#xA;  ()    ____   ____   ____&#xA; ____  |    | |    | |    |&#xA;|    | |    | |    | |    |&#xA;|    | |    | |    | |    |&#xA;|____| |___ | |____| |____|&#xA;&#xA;                ||     ||   &#xA;         ()    ____   ____&#xA;  ()    ____  |    | |    |&#xA; ____  |    | |    | |    |&#xA;|    | |    | |    | |    |&#xA;|____| |___ | |____| |____|&#xA;&#xA;                       ||   &#xA;                ()    ____&#xA;         ()    ____  |    |&#xA;  ()    ____  |    | |    |&#xA; ____  |    | |    | |    |&#xA;|____| |___ | |____| |____|&#xA;&#xA;                       ()&#xA;                ()    ____&#xA;         ()    ____  |    |&#xA;  ()    ____  |    | |    |&#xA;______ |___ | |____| |____|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The rules: Very simple really...no input required, any amout of trailing newlines or spaces alowed as long as the output looks exactly as above. Please feel free to show each stage as a different frame and clear the screen between each but this is not a requirement. Simply printing (or retuning from a function) what is shown above is fine. Oh and also, this is ASCII art...printing or returning a list of lines is not good enough.&lt;/p&gt;&#xA;&lt;p&gt;This is code golf. The shortest answer in any language will earn respect and I'm sure some upvotes. There will be no accepted answer so feel free to join in. The more languages the better no matter how long the answer is, as long as it is a best effort to make it as short as possible (golfed).&lt;/p&gt;&#xA;" OwnerUserId="56555" LastEditorUserId="56555" LastEditDate="2022-11-30T06:54:13.520" LastActivityDate="2022-11-30T06:54:13.520" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25355" PostTypeId="2" ParentId="25251" CreationDate="2022-11-29T05:13:31.723" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255793/78410&quot;&gt;CGAC2022 Day 21: Present stack headache&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-12-21T04:45:21.893" LastActivityDate="2022-12-21T04:45:21.893" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25356" PostTypeId="2" ParentId="25251" CreationDate="2022-11-29T05:40:55.510" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255881/78410&quot;&gt;CGAC2022 Day 22: Present stack headache, Part 2&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-12-22T01:30:54.743" LastActivityDate="2022-12-22T01:30:54.743" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25357" PostTypeId="2" ParentId="2140" CreationDate="2022-11-29T14:17:12.007" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255009/110698&quot;&gt;Totally random Catan number distributions&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110698" LastEditorUserId="110698" LastEditDate="2022-11-29T18:31:43.713" LastActivityDate="2022-11-29T18:31:43.713" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25358" PostTypeId="2" ParentId="2140" CreationDate="2022-11-29T14:53:47.680" Score="-3" Body="&lt;p&gt;This is a famous mathematical problem, Named as Bridges of Königsberg&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Task&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The bridges of Königsberg is a problem in mathematics which states that the path required for crossing each bridge exactly once without using a boat&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/IFDIn.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/IFDIn.jpg&quot; alt=&quot;Bridges of https://cdn.britannica.com/77/74877-050-F5DD4C34/Leonhard-Euler-route-each-question-bridges-Swiss.jpg&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;You have to find out if there is any path which uses each bridges exactly once without using a boat, if the time exceeds 36000 seconds or 10 hours the program should print no path found yet&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Standard rules of &lt;code&gt;fastest-code&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Expected Output: Paths possible: [7, 2, 3, 1, 5, 6, 4], [2, 1, 7, 3, 4, 6, 5], etc.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;code&gt;fastest-code&lt;/code&gt; so the answer with shortest time is accepted, Even if the code will take a  many days without a Quantum Computer&lt;/p&gt;&#xA;" OwnerDisplayName="user115781" LastEditorDisplayName="user115781" LastEditDate="2022-11-30T06:44:02.710" LastActivityDate="2022-11-30T06:44:02.710" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="25359" PostTypeId="2" ParentId="2140" CreationDate="2022-11-29T18:07:27.727" Score="0" Body="&lt;h1&gt;Cistertian Numerals&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Cistercian_numerals&quot; rel=&quot;nofollow noreferrer&quot;&gt;Cistercian numerals&lt;/a&gt; are a method of representing any integer from 1 to 9,999 in a single &amp;quot;glyph&amp;quot;.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;Any Integer, 1..9999&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;An image or binary array (any standard accepted format) of the glyph representing the Input, in the form shown on the Wiki article - e.g. &lt;a href=&quot;https://en.wikipedia.org/wiki/Cistercian_numerals#/media/File:Cistercian_digits_(vertical).svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;image&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;If using an array, it seems to me that all combinations should fit into a 6hx5w grid - e.g:&lt;/p&gt;&#xA;&lt;p&gt;9999:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;xxxxx&#xA;x x x&#xA;xxxxx&#xA;xxxxx&#xA;x x x&#xA;xxxxx&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;5555:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;xxxxx&#xA; xxx&#xA;  x&#xA;  x&#xA; xxx&#xA;xxxxx&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;7643:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  x&#xA; xxx&#xA;x x x&#xA;  x&#xA;x x x&#xA;xxx x&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="62289" LastActivityDate="2022-11-29T18:07:27.727" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25360" PostTypeId="2" ParentId="2140" CreationDate="2022-11-29T18:22:46.127" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255069/11261&quot;&gt;Make the cheapest cut&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="11261" LastEditorUserId="11261" LastEditDate="2022-12-01T16:00:45.687" LastActivityDate="2022-12-01T16:00:45.687" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25361" PostTypeId="2" ParentId="19279" CreationDate="2022-11-30T04:49:01.383" Score="3" Body="&lt;h1&gt;Pure data&lt;/h1&gt;&#xA;&lt;p&gt;Pure data is a graphical audio synthesis program.  You can use it to code-golf.&lt;/p&gt;&#xA;&lt;p&gt;Some reasons to want to golf in pd:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;While it is graphical the files are in readable ASCII which means you can easily tweak the source using an editor and changes to the program have predictable effects on the score.&lt;/li&gt;&#xA;&lt;li&gt;Golfing in pd has a lot of the weirdness of an esolang, but by learning it you actually learn a fun and useful programming language.&lt;/li&gt;&#xA;&lt;li&gt;You get to include cool pictures of your program in your explanation section.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I should also mention that if pure data were the LotM it would be an excellent opportunity to create some audio processing challenges.  The normal wheelhouse of languages aren't natively well equipped for that sort of thing so these challenges seem to be pretty uncommon.&lt;/p&gt;&#xA;&lt;p&gt;Since I would be remissed to nominate a graphical programming language with no pictures here's a picture of a pd program from &lt;a href=&quot;https://codegolf.stackexchange.com/a/201341/56656&quot;&gt;this answer&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ZSyjq.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZSyjq.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://puredata.info/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Website&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/201342/tips-for-golfing-in-pure-data&quot;&gt;Tips&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2022-11-30T04:49:01.383" CommentCount="0" CommunityOwnedDate="2022-11-30T04:49:01.383" ContentLicense="CC BY-SA 4.0" />
  <row Id="25362" PostTypeId="2" ParentId="2140" CreationDate="2022-11-30T20:59:53.177" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255133/find-the-box-by-its-corners&quot;&gt;Find the box by its corners&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="11261" LastEditorUserId="11261" LastEditDate="2022-12-02T21:37:11.490" LastActivityDate="2022-12-02T21:37:11.490" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25363" PostTypeId="2" ParentId="25251" CreationDate="2022-11-30T22:06:47.660" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255697/cgac2022-day-19-i-made-it-out-of-clay&quot;&gt;CGAC2022 Day 19: I Made It Out Of Clay&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="47670" LastEditorUserId="47670" LastEditDate="2022-12-19T05:21:17.587" LastActivityDate="2022-12-19T05:21:17.587" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25364" PostTypeId="2" ParentId="2140" CreationDate="2022-12-01T16:23:28.427" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255529/smallest-and-largest-100-bit-square-with-maximum-hamming-weight&quot;&gt;Smallest and largest 100-bit square with maximum Hamming weight&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="107434" LastEditorUserId="107434" LastEditDate="2022-12-15T15:04:34.543" LastActivityDate="2022-12-15T15:04:34.543" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25365" PostTypeId="1" CreationDate="2022-12-01T19:32:50.217" Score="11" ViewCount="297" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19271/reviving-language-of-the-month-pick-up-where-we-left-off-or-start-over&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout December 2022, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Pip&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;What's a Language of the Month?&lt;/h2&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19279/nominations-for-language-of-the-month-take-2?answertab=scoredesc#tab-top&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during December, those who wish to participate should learn (at least the basics of) Pip, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about Pip&lt;/h2&gt;&#xA;&lt;p&gt;Pip is an interpreted, imperative code-golf language created by @DLosc.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Unlike most golfing languages, but like many practical languages, Pip is an imperative language with infix operators. It also uses plain ASCII instead of a custom codepage. These features make it a great introduction to golflangs for users of imperative languages like Python, JavaScript, and Perl.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Pip's more &amp;quot;traditional&amp;quot; style of programming, combined with a number of uncommon builtin features, makes it very interesting to program in.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Pip is very strong with regex. It has &lt;a href=&quot;https://dloscutoff.github.io/pipdoc/regex&quot; rel=&quot;nofollow noreferrer&quot;&gt;operations&lt;/a&gt; that allow combination of strings and regexes, and has special regex match variables.&lt;/li&gt;&#xA;&lt;li&gt;Pip's &lt;a href=&quot;https://codegolf.stackexchange.com/a/230321/80214&quot;&gt;bugs&lt;/a&gt; make it a hilariously golfy language (and what is code golf, if not funny?).&lt;/li&gt;&#xA;&lt;li&gt;Operator precedence and input format optimization are very important in Pip, which is a mini challenge in itself.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Interpreters&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Download from &lt;a href=&quot;https://github.com/dloscutoff/pip&quot; rel=&quot;nofollow noreferrer&quot;&gt;GitHub&lt;/a&gt; (requires Python &amp;gt;= 3.8)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://dso.surge.sh/#pip&quot; rel=&quot;nofollow noreferrer&quot;&gt;DSO&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://ato.pxeger.com/run?L=pip&quot; rel=&quot;nofollow noreferrer&quot;&gt;ATO&lt;/a&gt; (currently broken)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#pip&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt; (outdated)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://replit.com/@dloscutoff/pip&quot; rel=&quot;nofollow noreferrer&quot;&gt;Replit&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Information&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://dloscutoff.github.io/pipdoc/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Documentation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/dloscutoff/pip/wiki&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tutorial&lt;/a&gt; (in progress)&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://esolangs.org/wiki/Pip&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolangs.org&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210380/tips-for-golfing-in-pip/&quot;&gt;Tips page&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;p&gt;@DLosc and @Razetime are usually available in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt; to answer any Pip questions. (Feel free to ping either of us.)&lt;/p&gt;&#xA;&lt;h1&gt;Bounty&lt;/h1&gt;&#xA;&lt;p&gt;I, &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;, will offer:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;+100 bounty to every user's 1st Pip answer in December&lt;/li&gt;&#xA;&lt;li&gt;+250 bounty to every user's 5th Pip answer in December&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If I forget to offer a bounty, feel free to ping me in chat.&lt;/p&gt;&#xA;" OwnerUserId="92689" LastEditorUserId="110555" LastEditDate="2022-12-19T22:12:05.650" LastActivityDate="2022-12-30T04:36:27.437" Title="Language of the Month for December 2022: Pip" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25366" PostTypeId="2" ParentId="25365" CreationDate="2022-12-01T19:32:50.217" Score="6" Body="&lt;h1&gt;List of all Pip answers posted in December 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/131755/subtract-my-odds-from-my-evens/255095#255095&quot;&gt;Subtract my odds from my evens&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/70365/construct-the-identity-matrix/255103#255103&quot;&gt;Construct the Identity Matrix&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255042/cgac2022-day-1-lets-build-a-chocolate-pyramid/255150#255150&quot;&gt;CGAC2022 Day 1: Let&amp;#39;s build a chocolate pyramid!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/70365/construct-the-identity-matrix/255151#255151&quot;&gt;Construct the Identity Matrix&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/144816/given-an-int-input-n-print-out-nreversedn/255152#255152&quot;&gt;Given an int input n, print out n*reversed(n)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/253682/generate-the-nth-fermi-dirac-prime/255166#255166&quot;&gt;Generate the n&amp;#39;th Fermi-Dirac Prime&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255202/cgac2022-day-5-preparing-an-advent-calendar/255214#255214&quot;&gt;CGAC2022 Day 5: Preparing an advent calendar&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/254910/find-the-nth-number-where-the-digit-sum-equals-the-number-of-factors/255226#255226&quot;&gt;Find the nth number where the digit sum equals the number of factors&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/119126/shorten-the-java-package/255128#255128&quot;&gt;Shorten the Java Package&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/106844/baby-boy&quot;&gt;Baby_Boy&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255274/cgac2022-day-7-fen-the-wicked/255278#255278&quot;&gt;CGAC2022 Day 7: Fen The Wicked&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110555/jezza-99&quot;&gt;jezza_99&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/146305/smallest-zeroless-base/255298#255298&quot;&gt;Smallest Zeroless Base&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255305/cgac2022-day-8-fen-the-wicked-part-2/255308#255308&quot;&gt;CGAC2022 Day 8: Fen The Wicked, Part 2&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110555/jezza-99&quot;&gt;jezza_99&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255344/cgac2022-day-9-playing-with-bits/255353#255353&quot;&gt;CGAC2022 Day 9: Playing with bits&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110555/jezza-99&quot;&gt;jezza_99&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255344/cgac2022-day-9-playing-with-bits/255367#255367&quot;&gt;CGAC2022 Day 9: Playing with bits&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255405/cgac2022-day-12-santas-gift-and-the-laser-lock/255474#255474&quot;&gt;CGAC2022 Day 12: Santa&amp;#39;s gift and the laser lock&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110555/jezza-99&quot;&gt;jezza_99&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255464/cgac2022-day-14-chimney-cleaning/255479#255479&quot;&gt;CGAC2022 Day 14: Chimney cleaning&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110555/jezza-99&quot;&gt;jezza_99&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255555/cgac2022-day-16-playing-with-bits-part-2/255565#255565&quot;&gt;CGAC2022 Day 16: Playing with bits, Part 2&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110555/jezza-99&quot;&gt;jezza_99&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255521/approximate-my-atomic-weight/255567#255567&quot;&gt;Approximate my atomic weight&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110555/jezza-99&quot;&gt;jezza_99&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255604/make-every-consonant-after-a-vowel-uppercase/255613#255613&quot;&gt;Make every consonant after a vowel uppercase&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110555/jezza-99&quot;&gt;jezza_99&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255591/cgac2022-day-17-present-heap/255637#255637&quot;&gt;CGAC2022 Day 17: Present Heap&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110555/jezza-99&quot;&gt;jezza_99&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/255684/96037&quot;&gt;Sum every second digit in a number&#xA;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96037/mathcat&quot;&gt;mathcat&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255638/cgac2022-day-18-light-all-of-the-candles/255641#255641&quot;&gt;CGAC2022 Day 18: Light all of the candles&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110555/jezza-99&quot;&gt;jezza_99&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255555/cgac2022-day-16-playing-with-bits-part-2/255735#255735&quot;&gt;CGAC2022 Day 16: Playing with bits, Part 2&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/255773/96037&quot;&gt;Replace all vowels with repeated &amp;quot;aeiou&amp;quot;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96037/mathcat&quot;&gt;mathcat&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255737/cgac2022-day-20-reconstruct-santas-book/255794#255794&quot;&gt;CGAC2022 Day 20: Reconstruct Santa&amp;#39;s Book&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110555/jezza-99&quot;&gt;jezza_99&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255804/create-n-sublists-with-the-powers-of-two-1-2-4-8-16/255819#255819&quot;&gt;Create \$n\$ sublists with the powers of two (1, 2, 4, 8, 16...)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96037/mathcat&quot;&gt;mathcat&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255822/replace-0s-in-a-string-with-their-consecutive-counts/255826#255826&quot;&gt;Replace 0s In a String With Their Consecutive Counts&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96037/mathcat&quot;&gt;mathcat&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255804/create-n-sublists-with-the-powers-of-two-1-2-4-8-16/255874#255874&quot;&gt;Create \$n\$ sublists with the powers of two (1, 2, 4, 8, 16...)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110555/jezza-99&quot;&gt;jezza_99&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255850/8086-segment-address/255878#255878&quot;&gt;8086 Segment Address to Linear&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110555/jezza-99&quot;&gt;jezza_99&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255804/create-n-sublists-with-the-powers-of-two-1-2-4-8-16/255929#255929&quot;&gt;Create \$n\$ sublists with the powers of two (1, 2, 4, 8, 16...)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255902/keep-elements-in-sequence-that-have-a-letter-repeated-at-least-3-times/255919#255919&quot;&gt;Keep elements in sequence that have a letter repeated at least 3 times&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96037/mathcat&quot;&gt;mathcat&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255902/keep-elements-in-sequence-that-have-a-letter-repeated-at-least-3-times/255932#255932&quot;&gt;Keep elements in sequence that have a letter repeated at least 3 times&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/256017/cgac2022-day-25-when-the-planets-align/256018#256018&quot;&gt;CGAC2022 Day 25: When The Planets Align&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110555/jezza-99&quot;&gt;jezza_99&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/256050/friend-or-foe/256070#256070&quot;&gt;Friend, or Foe?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/114446/the-thonnu&quot;&gt;The Thonnu&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant tips posted in December 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/255093/16766&quot;&gt;Manipulating operator precedence with &lt;code&gt;:&lt;/code&gt;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;tip summary&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant challenges posted in December 2022&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/256166/is-it-true-ask-pip&quot;&gt;Is it true? Ask Pip!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="92689" LastEditorUserId="16766" LastEditDate="2022-12-30T04:36:27.437" LastActivityDate="2022-12-30T04:36:27.437" CommentCount="0" CommunityOwnedDate="2022-12-02T00:09:47.960" ContentLicense="CC BY-SA 4.0" />
  <row Id="25367" PostTypeId="2" ParentId="2140" CreationDate="2022-12-04T00:23:51.180" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255302/106959&quot;&gt;Write a program that prints a program that's almost quine.&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="106959" LastEditorUserId="106959" LastEditDate="2022-12-15T15:24:44.353" LastActivityDate="2022-12-15T15:24:44.353" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25368" PostTypeId="2" ParentId="2140" CreationDate="2022-12-04T13:07:04.370" Score="1" Body="&lt;h2&gt;Merged strings&lt;/h2&gt;&#xA;&lt;p&gt;Not sure if this is already done&lt;/p&gt;&#xA;&lt;p&gt;Basically, take two strings of reasonable length (like &amp;lt;32 chars) of numbers and X's and find the shortest superposition of those strings such that there's no 2 numbers at the same position. Number+X or X+X is allowed. Print the result.&lt;/p&gt;&#xA;&lt;h3&gt;Examples:&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;quot;01XX02&amp;quot;,&amp;quot;10XX2&amp;quot;]&#xA;-----&#xA;010X02&#xA;&#xA;[&amp;quot;5234XXX&amp;quot;,&amp;quot;431XXX&amp;quot;]&#xA;-----&#xA;523431XXX&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Note:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Even if the string ends with X's, print those X's as they're part of the strings.&lt;/li&gt;&#xA;&lt;li&gt;Oh and the result must start with the first string. (like test 4)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Tests:&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;1234   | 345    -&amp;gt; 12345&#xA;6573   | 2625   -&amp;gt; 65732625&#xA;11X    | 12     -&amp;gt; 112&#xA;XX1XX  | XX2XX  -&amp;gt; XX12XX&#xA;X1X2X3 | 1XX234 -&amp;gt; X1X2234&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;The program with the least bytes wins!&lt;/p&gt;&#xA;" OwnerUserId="100852" LastEditorUserId="100852" LastEditDate="2022-12-04T15:38:14.037" LastActivityDate="2022-12-04T15:38:14.037" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25369" PostTypeId="2" ParentId="2140" CreationDate="2022-12-05T08:27:08.073" Score="2" Body="&lt;h1&gt;Where are zeros? Self-describing sequence &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base-conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;base-conversion-container&quot;&gt;base-conversion&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;sequence-container&quot;&gt;sequence&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://oeis.org/A167519&quot; rel=&quot;nofollow noreferrer&quot;&gt;A167519&lt;/a&gt;: Lexicographically earliest increasing sequence which lists the positions of the zero digits in the sequence.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;pre&gt;&lt;code&gt;3, 10, 11, 12, 11000, 11111, 11112, 11113, 11114, 11115, 11116, 11117, 11118, 11119,&#xA;11121, 11122, 11123, 11124, 11125, 11126, 11127, 11128, 11129, 11131, 11132, 11133,&#xA;11134, 11135, 11136, 11137, 11138, 11139, 11141, 11142, 11143, 11144, ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If we list the digits, we get&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;3 1 0 1 1 1 2 1 1 0 0 0 1 1 1 1 1 1 1 1 1 2 1 1 1 1 3 1 1 1 1 4 ...&#xA;    ^             ^ ^ ^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The digits at index 3, 10, 11, 12, 11000, ... are zeros, and all the other digits are nonzero.&lt;/p&gt;&#xA;&lt;p&gt;It looks a bit boring after a few terms. It becomes a bit more interesting if we consider the same sequence in smaller bases:&lt;/p&gt;&#xA;&lt;h3&gt;Base 5&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;(in base 10)&#xA;3, 5, 10, 11, 150, 156, 157, 158, 159, 161, ...&#xA;&#xA;(in base 5)&#xA;3, 10, 20, 21, 1100, 1111, 1112, 1113, 1114, 1121, ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Explanation:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The first term cannot be 1 (the first base-5 digit is 1, not 0) or 2 (the next number would have a leading zero), so it is 3.&lt;/li&gt;&#xA;&lt;li&gt;The next term cannot be 4 (leading zero), so it must be &lt;code&gt;5 = 10(5)&lt;/code&gt;. It satisfies the first term (3rd base-5 digit is 0).&lt;/li&gt;&#xA;&lt;li&gt;The third term must have at least 2 digits and its 2nd digit is 0. The smallest number that satisfies this is &lt;code&gt;10 = 20(5)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Another 2-digit number can fit here without causing a leading zero. The smallest such number exceeding 10 is &lt;code&gt;11 = 21(5)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The next number cannot be 2-digit or 3-digit, so it must have 4 digits, giving &lt;code&gt;1100(5)&lt;/code&gt;. We don't have any more zeros for a while, giving a series of zeroless numbers starting with &lt;code&gt;1111(5)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Base 4&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;(in base 10)&#xA;3, 8, 9, 80, 85, 86, 87, 89, 90, 91, 93, 94, 95, 101, 102, 103, 105, 106, 107,&#xA;109, 110, 113, 1344, 16448, 21824, 32833, 34133, 38229, 38230, 38231, ...&#xA;&#xA;(in base 4)&#xA;3, 20, 21, 1100, 1111, 1112, 1113, 1121, 1122, 1123, 1131, 1132, 1133, 1211, 1212,&#xA;1213, 1221, 1222, 1223, 1231, 1232, 1301, 111000, 10001000, 11111000, 20001001,&#xA;20111111, 21111111, 21111112, 21111113, ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The first term is 3 by the same logic.&lt;/li&gt;&#xA;&lt;li&gt;The next term cannot be &lt;code&gt;10(4)&lt;/code&gt; due to leading zero, and the next fitting number is &lt;code&gt;20(4)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The rest goes on by the &amp;quot;long-term logic&amp;quot;. The next interesting part comes earlier than in higher bases, so I decided to include it here.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Starting here, the &amp;quot;long-term logic&amp;quot; refers to the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the last number has &lt;code&gt;k&lt;/code&gt; digits, the next number will also have &lt;code&gt;k&lt;/code&gt; digits unless such a number does not exist or it causes a leading zero in the next term.&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, increase the number of digits until the next term won't have a leading zero, and fill the nonzero digits with 1.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Base 3&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;(in base 10)&#xA;4, 6, 10, 12, 19, 22, 24, 111, 121, 122, 124, 125, 130, 131, 133, 134, 148, 149,&#xA;151, 152, 157, 158, 160, 161, 202, 283, 1089, 6921, 6925, 9837, 13482, 13486,&#xA;16402, 16403, 16405, 16408, 16411, 16412, 16414, 16415, 16429, 16430, 16432,&#xA;16433, 16435, ...&#xA;&#xA;(in base 3)&#xA;11, 20, 101, 110, 201, 211, 220, 11010, 11111, 11112, 11121, 11122, 11211, 11212,&#xA;11221, 11222, 12111, 12112, 12121, 12122, 12211, 12212, 12221, 12222, 21111,&#xA;101111, 1111100, 100111100, 100111111, 111111100, 200111100, 200111111, 211111111,&#xA;211111112, 211111121, 211111201, 211111211, 211111212, 211111221, 211111222,&#xA;211112111, 211112112, 211112121, 211112122, 211112201, ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The first term &lt;em&gt;cannot&lt;/em&gt; be 3 since it is &lt;code&gt;10(3)&lt;/code&gt; but 2 is not in the sequence. Therefore, the first term is &lt;code&gt;4 = 11(3)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The sequence goes on with the long-term logic.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h3&gt;Base 2&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;(in base 10)&#xA;2, 4, 5, 7, 31, 63, 127, 191, 255, 511, 1021, 1023, 2047, 4095, 8191, 16383, 28671,&#xA;32767, ...&#xA;&#xA;(in base 2)&#xA;10, 100, 101, 111, 11111, 111111, 1111111, 10111111, 11111111, 111111111,&#xA;1111111101, 1111111111, 11111111111, 111111111111, 1111111111111, 11111111111111,&#xA;110111111111111, 111111111111111, ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Determining the initial terms here is particularly tricky.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The first term is &lt;code&gt;2 = 10(2)&lt;/code&gt; because it satisfies the first zero position.&lt;/li&gt;&#xA;&lt;li&gt;The next term cannot be 3, but &lt;code&gt;4 = 100(2)&lt;/code&gt; works. This also fixes the next two terms &lt;code&gt;5 = 101(2)&lt;/code&gt; and &lt;code&gt;7 = 111(2)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The next term should be at least 12, but:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;12 doesn't work because &lt;code&gt;&amp;lt;1&amp;gt;100&lt;/code&gt; (&lt;code&gt;&amp;lt;x&amp;gt;&lt;/code&gt; marks where 0 has to be)&lt;/li&gt;&#xA;&lt;li&gt;13 doesn't work because &lt;code&gt;1&amp;lt;1&amp;gt;01&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;14 doesn't work because &lt;code&gt;11&amp;lt;1&amp;gt;0&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;15 doesn't work because &lt;code&gt;111&amp;lt;1&amp;gt;&lt;/code&gt;&#xA;Therefore the number has at least 5 bits, the first 4 of which must be 1. Then the last bit cannot be 0 either (16 is not in the sequence), so it becomes &lt;code&gt;31 = 11111(2)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Now the rest follows the long-term logic, except that it continues to grow exponentially. This is because, for every number &lt;code&gt;k&lt;/code&gt;, there is only one &lt;code&gt;k&lt;/code&gt;-bit number that does not contain 0.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##zVRBboMwELzzCt8IKqrsMdyal0Q5pCpRqVKIApXS11Ns7xrbiEo9NZfs7jA7xrsTrt/je9/paXo9DQ3EXhxyJfNSzL8UlA2KQ5AEmSJuCkd5VMj4UVKl5apeA4TI30kqP2aXYTQXbbtxN5QChTj3NzGIthN2CMfso2@75m3m5PmzyXcWL7LrzfQc7rbhbhqMVHue85e9uDTdznUWR89tn5Rlt6XlN93XZ3M7jQ0zXfd@PkrmvmtW9ekiWmSZeQ/tlmTvhnhH0mHuETGIMnPkaoOgBIyAEDAHzAFzQBywDlgHrAPWAeuAdcA6IB3E5vGvyO6TqyLaqqQry1WhlJdPCwQFgifL5JQfARdBD6Ke4BoIz0F4DsJzeDyuMIemltSJJfWGJfWDWLKyltSLI9ks0nuODUZRs73YVBQJ14RrwrVmq7HBKGq2F5uKIuGkA9LR/qMjvaWkz9WCw@H0H9v4cFTJlqqNLVUPsqV62RJ/Kf6yK1X5naWTqJNJ1BuTqP99EtP0Aw&quot; rel=&quot;nofollow noreferrer&quot;&gt;Code used for handcrafting these sequences.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given the base &lt;code&gt;n &amp;gt;= 2&lt;/code&gt;, output the sequence generated by the definition of A167519 in base &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;sequence-container&quot;&gt;sequence&lt;/a&gt; I/O rules apply. You may choose one of the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Given &lt;code&gt;n&lt;/code&gt;, output the terms of the sequence indefinitely;&lt;/li&gt;&#xA;&lt;li&gt;Given &lt;code&gt;n&lt;/code&gt; and a 0- or 1-based index &lt;code&gt;k&lt;/code&gt;, output the &lt;code&gt;k&lt;/code&gt;th term of the sequence &lt;code&gt;n&lt;/code&gt;;&lt;/li&gt;&#xA;&lt;li&gt;Given &lt;code&gt;n&lt;/code&gt; and a positive integer &lt;code&gt;k&lt;/code&gt;, output the first &lt;code&gt;k&lt;/code&gt; terms of the sequence &lt;code&gt;n&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may output the terms in base 10 or base &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; rules apply. The shortest code in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2022-12-07T02:08:45.703" LastActivityDate="2022-12-07T02:08:45.703" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25370" PostTypeId="2" ParentId="2140" CreationDate="2022-12-05T10:53:54.873" Score="0" Body="&lt;h1&gt;Denoise a image &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;There are various de-noising algorithms available. This question focuses on a specific one that preserves sharp edges but is also very simple to implement.&lt;/p&gt;&#xA;&lt;p&gt;Take 2 parameters, &lt;code&gt;r&lt;/code&gt; and &lt;code&gt;k&lt;/code&gt;, and a grayscale image.&lt;/p&gt;&#xA;&lt;p&gt;For every pixel, draw a &lt;code&gt;r&lt;/code&gt; by &lt;code&gt;r&lt;/code&gt; square around it and select all pixels inside.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; r=1   r=3     r=5&#xA;              #####&#xA;       ###    #####&#xA;  p    #p#    ##p##&#xA;       ###    #####&#xA;              #####&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Find the &lt;code&gt;k&lt;/code&gt; pixels in this area that are closest to the source pixel in terms of absolute color difference.&lt;/p&gt;&#xA;&lt;p&gt;Replace each pixel with the median of the &lt;code&gt;k&lt;/code&gt; closest pixels in it's area. Include the pixel itself in it's area. If there are less than &lt;code&gt;k&lt;/code&gt; closest pixels take all of them. This can happen for pixels near the edge.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Note: If &lt;code&gt;r==0&lt;/code&gt; or &lt;code&gt;k==1&lt;/code&gt; this will return the image unchanged&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;r&lt;/code&gt; is always odd.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;In    K    R    Out&#xA;-------------------&#xA;000             000&#xA;010   1    1    010&#xA;000             000&#xA;-------------------&#xA;000             000&#xA;010    3    3   000&#xA;000             000&#xA;-------------------&#xA;000             000&#xA;010    3    3   010&#xA;100             100&#xA;-------------------&#xA;000             000    000&#xA;010    5    3   010 OR 010 since the median is tied&#xA;101             000    101&#xA;-------------------&#xA;12345           &#xA;23451&#xA;34512  5    5&#xA;45123&#xA;51234&#xA;-------------------&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;IO&lt;/h2&gt;&#xA;&lt;p&gt;Take input as either a image file or as a 2 dimensional array of integers between 0 and 255. Output in the same format.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2022-12-05T12:59:27.260" LastActivityDate="2022-12-05T12:59:27.260" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25371" PostTypeId="2" ParentId="2140" CreationDate="2022-12-05T12:57:59.180" Score="-4" Body="&lt;h1&gt;Output a googol &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;number-container&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;kolmogorov-complexity-container&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge today is to output this exact number:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;We call this a googol. A googol is 1 followed by a 100 zeroes, or basically just &lt;span class=&quot;math-container&quot;&gt;\$10^{100} \$&lt;/span&gt;. However most programs wouldn't be able to do a simple &lt;code&gt;print(10**100)&lt;/code&gt; because it will take &lt;em&gt;forever&lt;/em&gt; to do so. And sometimes it might end up with an OverflowError, so you'll have to be creative.&lt;/p&gt;&#xA;&lt;h2&gt;Input:&lt;/h2&gt;&#xA;&lt;p&gt;None.&lt;/p&gt;&#xA;&lt;h2&gt;Output:&lt;/h2&gt;&#xA;&lt;p&gt;The googol. However, if your language will not be able to store &lt;span class=&quot;math-container&quot;&gt;\$ 10^{100} \$&lt;/span&gt;, you'll have to find some way of printing it, maybe by string manipulation (the shortest I got was &lt;code&gt;print('1'+'0'*100)&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so shortest answer wins!&lt;/p&gt;&#xA;" OwnerUserId="110681" LastActivityDate="2022-12-05T12:57:59.180" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="25373" PostTypeId="2" ParentId="2140" CreationDate="2022-12-05T17:38:38.900" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255333/find-the-representative-submatrix&quot;&gt;Find the representative submatrix&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="11261" LastEditorUserId="11261" LastEditDate="2022-12-08T17:43:56.693" LastActivityDate="2022-12-08T17:43:56.693" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25374" PostTypeId="2" ParentId="2140" CreationDate="2022-12-05T19:53:32.680" Score="5" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255493/clutch-wordle-solver-with-known-inputs&quot;&gt;Clutch Wordle Solver with known inputs&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="78028" LastEditorUserId="78028" LastEditDate="2022-12-15T00:08:15.363" LastActivityDate="2022-12-15T00:08:15.363" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25375" PostTypeId="2" ParentId="2140" CreationDate="2022-12-06T01:03:02.583" Score="0" Body="&lt;h1&gt;Is It a Flat 3D Quadrilateral?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;decision-problem-container&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;geometry-container&quot;&gt;geometry&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/3d&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;3d&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;3d&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;3d-container&quot;&gt;3d&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to write a program or function that, given a collection of four 3D points with Cartesian coordinates, outputs whether the shape formed by connecting those points is a flat 3D quadrilateral (i.e. all the points are coplanar).&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The input will always have 4 points.&lt;/li&gt;&#xA;&lt;li&gt;Each shape will be formed by connecting the points with lines in the order they were given and then back to the first point. You may assume that no two of these lines will intersect each other and that no three consecutive points will be collinear.&lt;/li&gt;&#xA;&lt;li&gt;For each point &lt;span class=&quot;math-container&quot;&gt;\$(x, y, z)\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt;, and &lt;span class=&quot;math-container&quot;&gt;\$z\$&lt;/span&gt; will all be integers within the range &lt;span class=&quot;math-container&quot;&gt;\$[0,8]\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You may choose any two distinct values to represent a truthy and falsy output, as long as it is consistent. Input can be in any convenient format.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Input&lt;/th&gt;&#xA;&lt;th&gt;Output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;(0, 0, 0) (0, 1, 0) (1, 2, 0) (1, 0, 0)&lt;/td&gt;&#xA;&lt;td&gt;true&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;(0, 0, 0) (0, 1, 0) (0, 0, 1) (1, 0, 0)&lt;/td&gt;&#xA;&lt;td&gt;false&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;(0, 0, 0) (1, 0, 0) (1, 1, 1) (0, 1, 1)&lt;/td&gt;&#xA;&lt;td&gt;true&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;(0, 1, 2) (3, 4, 6) (7, 8, 5) (4, 3, 2)&lt;/td&gt;&#xA;&lt;td&gt;false&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;(1, 1, 1) (2, 2, 2) (1, 3, 2) (2, 4, 5)&lt;/td&gt;&#xA;&lt;td&gt;false&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;(0, 4, 8) (4, 8, 4) (8, 4, 0) (4, 0, 4)&lt;/td&gt;&#xA;&lt;td&gt;true&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any additional test case suggestions?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="91262" LastEditorUserId="91262" LastEditDate="2022-12-06T14:43:15.107" LastActivityDate="2022-12-06T14:43:15.107" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25376" PostTypeId="2" ParentId="2140" CreationDate="2022-12-06T16:33:50.423" Score="-1" Body="&lt;h1&gt;Output your Votes &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;internet-container&quot;&gt;internet&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The challenge is simple: Print to stdout the current total score (upvotes minus downvotes) of your answer.&lt;/p&gt;&#xA;&lt;p&gt;For obvious reasons, you do not have to include the ID of your answer in the program; you may take it from stdin or specify a place in the code where the ID must be inserted.&#xA;Your program may assume that the computer it is running on has internet access and isn't restricted by SE API ratelimiting. Your program does not need to use the SE API to get the vote count, but that's probably the easiest way to do it.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins.&lt;/p&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;p&gt;Is this a dupe? I wouldn't be surprised if it is.&lt;/p&gt;&#xA;" OwnerUserId="108218" LastActivityDate="2022-12-06T16:33:50.423" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25377" PostTypeId="2" ParentId="2140" CreationDate="2022-12-07T02:46:45.170" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255366/rolling-a-1x1x2-block&quot;&gt;Rolling a 1x1x2 block&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="115910" LastEditorUserId="115910" LastEditDate="2022-12-09T18:00:33.877" LastActivityDate="2022-12-09T18:00:33.877" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25378" PostTypeId="2" ParentId="2140" CreationDate="2022-12-07T08:11:16.597" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255323/100057&quot;&gt;&lt;H1&gt;Santa's Shortest Path Problem&lt;/H1&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;1st-time trying to come up with a challenge. Please provide feedback if this is a nice challenge/if it's doable and/or if anything is unclear.&lt;/p&gt;&#xA;" OwnerUserId="100057" LastEditorUserId="100057" LastEditDate="2022-12-08T13:13:58.007" LastActivityDate="2022-12-08T13:13:58.007" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25380" PostTypeId="2" ParentId="2140" CreationDate="2022-12-07T23:42:31.133" Score="-1" Body="&lt;h1&gt;Help Santa Rest&lt;/h1&gt;&#xA;&lt;p&gt;Santa has finally delivered presents to everyone at the stroke of midnight in a day, and now he wants some well-deserved rest. He is just about to sit down when the present managing computer suddenly calls out: &amp;quot;ME NEED REST.&amp;quot; Now he is asking you to write him a program that does... &lt;em&gt;nothing&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You &lt;em&gt;will&lt;/em&gt; be given command line args, you will be given STDIN input. You must swallow/ignore the input and after some length of time, quit the program. You may have no externally visible effects (other than RAM/CPU usage obviously), and the program must not hang.&lt;/p&gt;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&lt;p&gt;&lt;code&gt;NullPointerException&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Santa wants to type this in as quickly as possible so he can rest, so this challenge is scored in bytes, as standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="107299" LastEditorUserId="107299" LastEditDate="2022-12-12T17:22:16.537" LastActivityDate="2022-12-12T17:22:16.537" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="25381" PostTypeId="2" ParentId="2140" CreationDate="2022-12-08T10:00:28.870" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/255460/113442&quot;&gt;Turn two dice into one die&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="113442" LastEditorUserId="108218" LastEditDate="2022-12-14T13:58:08.110" LastActivityDate="2022-12-14T13:58:08.110" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25382" PostTypeId="2" ParentId="2140" CreationDate="2022-12-08T10:50:03.807" Score="2" Body="&lt;h1&gt;How much STAB do I get?&lt;/h1&gt;&#xA;&lt;p&gt;With the new Terastal mechanic in Pokémon Scarlet and Violet, moves can now get a variety of Same Type Attack Bonuses.&lt;/p&gt;&#xA;&lt;p&gt;This bonus, known as STAB for short, varies depending on the type of the move and the Pokémon's type(s) (Pokémon can have multiple types) and Tera type, but also on whether the Pokémon has the Adaptability ability.&lt;/p&gt;&#xA;&lt;p&gt;The rules are as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the Pokémon hasn't been Terastallised:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the move is not one of the Pokémon's types then the STAB is 1× (i.e. no bonus)&lt;/li&gt;&#xA;&lt;li&gt;Otherwise if the Pokémon has the Adaptability ability then the STAB is 2×&lt;/li&gt;&#xA;&lt;li&gt;Otherwise the STAB is 1.5×&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;If the Pokémon has been Terastallised into a different type:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the move is neither the Tera type or its regular types then the STAB is 1×&lt;/li&gt;&#xA;&lt;li&gt;Otherwise if the move is the Tera type and the Pokémon has the Adaptability ability then the STAB is 2×&lt;/li&gt;&#xA;&lt;li&gt;Otherwise the STAB is 1.5×&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;If the Pokémon has been Terastallised into one of its regular types:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the move is not one of the Pokémon's types then the STAB is 1×&lt;/li&gt;&#xA;&lt;li&gt;Otherwise if the move is not the Tera type then the STAB is 1.5×&lt;/li&gt;&#xA;&lt;li&gt;Otherwise if the Pokémon has the Adaptability ability then the STAB is 2.25×&lt;/li&gt;&#xA;&lt;li&gt;Otherwise the STAB is 2×&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;As a table:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Is Terastallised&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Move has Tera type&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Move has regular type&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Adaptability&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: left;&quot;&gt;STAB&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;1×&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;1×&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;1.5×&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;2×&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;1×&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;1×&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;1.5×&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;2×&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;1×&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;1×&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;1.5×&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;1.5×&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;1.5×&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;2×&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;No&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;2×&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;Yes&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;2.25×&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;Your task is to write a program or function that, given a move's type, a Pokémon's Tera type and set of base type(s) as some kind of comparable value (e.g. type names as strings), and its Terastallisation and Adaptability states as a byte-sized flag, outputs the move's resulting STAB. Instead of a seprate Terastallisation flag you can also use a sentinel value for the Tera type to indicate that the Pokémon hasn't been Terastallised. You can optionally take an additional argument which is the set of types that are boosted by Adaptability.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2022-12-08T10:50:03.807" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25383" PostTypeId="2" ParentId="2140" CreationDate="2022-12-08T16:32:24.037" Score="1" Body="&lt;h1&gt;KotH: Don't Kill the Curve!&lt;/h1&gt;&#xA;&lt;p&gt;In this KotH, you will take a test at school. Your goal, of course, is to get the highest grade, up to a maximum of 110%. This score consists of your actual grade, curved, as well as 10% which is the average of other students' scores, since your teacher wants to encourage students to study together.&lt;/p&gt;&#xA;&lt;p&gt;You have a minimum of 100 turns leading up to the test. You can use these to either:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Study: This add a point to your score (initially 0), unless your score is already 100&lt;/li&gt;&#xA;&lt;li&gt;Tutor: Adds two points to the score of any other student, up to a max of 100&lt;/li&gt;&#xA;&lt;li&gt;Arson: Majorly disrupt another student's life, dropping their score by 10 points (down to a minimum of zero), and negating their next 10 actions as they rebuild their life&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Arson requires a lengthy jail sentence, meaning that your next 10 actions are also negated. If you have fewer than 10 actions left, you miss the test, and must retake it, making the maximum score you can receive (after the curve, before the bonus from other students) 70 points. Your real score is still used in the class average. Note that being an arson victim in the last 10 turns does not prevent you from taking the test; it only prevents you from studying, tutoring, or paying it forward.&lt;/p&gt;&#xA;&lt;p&gt;You can also miss the test by taking more than 100 turns. After 100 turns you can only tutor or commit arson against other students which have not yet taken the test. Missing the test normally still has the same impact as if you had missed it while in jail, so it is likely only an effective strategy if you would otherwise receive a score below 70 (perhaps due to being an arson victim or avid tutor).&lt;/p&gt;&#xA;&lt;p&gt;The test is also curved. Whichever student has the highest raw score will have theirs adjusted to 100, and that same shift will be applied to all other students. The curve is not taken into account for student averages, so if all students receive a 20% raw score, they would receive 102% as their final score (if they did not miss the test).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Information:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;You are aware of all other students' scores on previous tests, your own &amp;quot;preparedness&amp;quot; (the raw score you would get if you took the test now), and the list of students who are recovering from arson and/or in jail.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2022-12-08T16:39:31.967" LastActivityDate="2022-12-08T16:39:31.967" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25385" PostTypeId="2" ParentId="2140" CreationDate="2022-12-11T18:00:07.970" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257579/roll-a-painted-cube&quot;&gt;Roll a painted cube&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-02-08T13:09:44.813" LastActivityDate="2023-02-08T13:09:44.813" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25386" PostTypeId="1" CreationDate="2022-12-11T22:56:43.410" Score="4" ViewCount="115" Body="&lt;p&gt;Could you please reopen &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35569/tweetable-mathematical-art&quot;&gt;Tweetable Mathematical Art&lt;/a&gt; ? It is such a source of inspiration, of course it will never end and never have a final answer, but that is how art is supposed to be, right?&lt;/p&gt;&#xA;" OwnerUserId="115988" LastEditorUserId="66833" LastEditDate="2022-12-12T17:15:53.227" LastActivityDate="2022-12-12T17:15:53.227" Title="Please reopen Tweetable Mathematical Art" Tags="|discussion|status-declined|closed-questions|popularity-contest|reopening|" AnswerCount="2" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25387" PostTypeId="2" ParentId="25386" CreationDate="2022-12-11T23:26:46.237" Score="4" Body="&lt;p&gt;Firstly, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/20861/66833&quot;&gt;welcome to the site&lt;/a&gt;! We're glad you're enjoying the posts here, and we encourage you to participate yourself!&lt;/p&gt;&#xA;&lt;p&gt;However, Tweetable Mathematical Art is not going to be reopened. As impressive, and as fun, of a challenge as it was, the task itself was incredibly vague, to the point where &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/14876/a-farewell-to-moderation&quot;&gt;former moderator, Alex A&lt;/a&gt; closed it as &amp;quot;Needs more focus&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;I'll also point out the second notice on the question, under the close notice, that reads:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Locked&lt;/strong&gt;. This question and its answers are &lt;a href=&quot;https://codegolf.stackexchange.com/help/locked-posts&quot;&gt;locked&lt;/a&gt; because the question is off-topic but has historical significance. It is not currently accepting new answers or interactions.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is because, despite the problems in the challenge, it &lt;em&gt;is&lt;/em&gt; an impressive collection of answers and art, and we do want to preserve it. Unfortunately, it doesn't belong on the site anymore, and so, to balance our want to keep it with the rules against it, us moderators can lock posts to mark them as historically significant, but no longer accepted on the site.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;In short, the task in the challenge can be summed up as &amp;quot;Create a piece of art. Most creative wins&amp;quot;. Granted, there are some constraints, which make the challenge much more fun, but this kind of challenge doesn't belong on our site in its current era, where we require much stricter and more objective rules.&lt;/p&gt;&#xA;&lt;p&gt;In long, Tweetable Mathematical Art also fell victim of our &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8242/the-state-of-the-popularity-contest-tag&quot;&gt;popularity contest problem&lt;/a&gt;, which we've struggled with as a site for years now. I won't go into it fully here, but you can read more by looking at posts in the &lt;a href=&quot;/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;popularity-contest-container&quot;&gt;popularity-contest&lt;/a&gt; tag, and &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/13045/66833&quot;&gt;this post&lt;/a&gt;. But, popularity contests have conflicted with our universal requirement for a challenge to have an &lt;em&gt;objective&lt;/em&gt; winning criteria since their creation, and so we've debated keeping them, removing them, locking them, or something in between during that time.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;However, you are still welcome to give the challenge a try, and, within reason, share your efforts in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;, our more informal chat room. It does require 20 reputation to interact in, but that is only 2 upvotes, or 10 edits, so shouldn't be a massive hurdle.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2022-12-11T23:26:46.237" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25388" PostTypeId="2" ParentId="25386" CreationDate="2022-12-11T23:34:01.580" Score="3" Body="&lt;h1&gt;The lock in place is still correct&lt;/h1&gt;&#xA;&lt;p&gt;Tweetable mathematical art is a fun question with some great answers, but it's the only the best example of a category of questions that are bad for our site.&lt;/p&gt;&#xA;&lt;p&gt;There are plenty of other questions of the type &amp;quot;do something creative in this many bytes&amp;quot;, and they are usually just not that much fun for us. We as a community have come to the conclusion that this broad type of challenge is not what this site is about, it's about constrained goal oriented programming rather than open-ended art. That's not to say open-ended challenges are bad, they just what we have decided the site is about.&lt;/p&gt;&#xA;&lt;p&gt;As such we closed (or have tried to close) all questions like that.  The good ones get a lock like Tweetable Mathematical Art.  This helps communicate our site culture better, since if we left a challenge open but didn't allow new challenges of that type it would be confusing.&lt;/p&gt;&#xA;&lt;p&gt;And there's still plenty of room for creativity here! I'm sure if you enjoyed that question you can find some great &lt;em&gt;open&lt;/em&gt; challenges here.&lt;/p&gt;&#xA;&lt;p&gt;And lastly if you want to share your own submission to Tweetable Mathematical Art, you can always show it in chat, I'm sure people would be happy to see that sort of thing.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2022-12-11T23:34:01.580" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25389" PostTypeId="2" ParentId="2140" CreationDate="2022-12-12T17:06:17.863" Score="-1" Body="&lt;h1&gt;Print my Country&lt;/h1&gt;&#xA;&lt;p&gt;This challenge is simple: Your program must output the two-character country code of the computer it is currently being run on, according to the computer's locale settings. (Capitalization doesn't matter.) For example, were I to run your program on a computer with a location set to the United States, your program should output &lt;code&gt;US&lt;/code&gt;. You may assume that your program is running on the latest version (Bullseye, if I'm not mistaken) of Debian Linux. This &lt;em&gt;does not need&lt;/em&gt; to be accurate; I could easily set the locale to Antartica while being in Britain.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so shortest program wins!&lt;/p&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2022-12-13T15:49:42.093" LastActivityDate="2022-12-13T15:49:42.093" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25390" PostTypeId="2" ParentId="2140" CreationDate="2022-12-12T19:00:30.453" Score="2" Body="&lt;h1&gt;But can it run Fibonacci?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;cops-and-robbers-container&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Cops will write a programming language interpreter (or transpiler or compiler) in 2048 bytes or less. It must be capable of a Fibonacci program which works until limited by integer sizes or some similar restriction (no finite look-up tables or similar, and a reasonable number of fibonacci numbers must be supposed, with &lt;code&gt;17711&lt;/code&gt; being a reasonable minimum).&lt;/p&gt;&#xA;&lt;p&gt;Robbers will try to find this fibonacci program.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-12-12T19:00:30.453" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25391" PostTypeId="2" ParentId="2140" CreationDate="2022-12-14T14:49:22.250" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255521/approximate-my-atomic-weight&quot;&gt;Approximate my Atomic Weight&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2022-12-15T14:02:17.167" LastActivityDate="2022-12-15T14:02:17.167" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25392" PostTypeId="2" ParentId="2140" CreationDate="2022-12-14T17:48:15.700" Score="4" Body="&lt;h1&gt;The dating game &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-king-of-the-hill-tooltip-container&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The bots are looking for love. Can you help them?&lt;/p&gt;&#xA;&lt;h2&gt;The rules&lt;/h2&gt;&#xA;&lt;p&gt;The goal of this game is find the bot you have the highest comparability with. However, robots, who are inexperienced at dating are unable to tell how well a date went.&lt;/p&gt;&#xA;&lt;p&gt;In the game, bots take turns &amp;quot;speed dating&amp;quot; some other bot. After each date, each bot chooses whether to get married or to continue dating. If both bots agree to get married both are removed from the dating pool and their compatability rank (100% is if you found the best one, 0% for the worst one) is their final score.&lt;/p&gt;&#xA;&lt;p&gt;Bots won't be able to tell what the compatibility is, but they can compare dates. For example if bot A went on a date with bot B and C, they'll be able to tell if B or C was more compatible but not by how much.&lt;/p&gt;&#xA;&lt;p&gt;Bot A's compatibility with B does not equal B's compatibility with A, but they are correlated.&lt;/p&gt;&#xA;&lt;p&gt;If every bot has dated every other bot, the ordering is shuffled and any remaining bots can try again. However, everyone's final score is reduced by 25% (exponential) for every round they stay single. If a entire round ends without any new marriages the game ends and all remaining bots get a score of 0.&lt;/p&gt;&#xA;&lt;h2&gt;Example bot&lt;/h2&gt;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;class BetterThanFirst:&#xA;    &amp;quot;&amp;quot;&amp;quot;&#xA;    This bot will use its first date as a reference, then marry any bot that's better than it&#xA;    &amp;quot;&amp;quot;&amp;quot;&#xA;&#xA;    def __init__(self, nrof_bots, rng): # rng is a seeded PRNG you can use, no other forms of randomness allowed&#xA;        # nrof_bots is the total number of bots playing&#xA;        self.first_date = None&#xA;&#xA;    def round_finished(self, nrof_remaining_bots): # the number of bots still in the game&#xA;        pass # called if a full round finished, optional&#xA;&#xA;    def date(self, other) -&amp;gt; bool: # Return True if you want to marry this bot, False otherwise&#xA;        if self.first_date is None:&#xA;            self.first_date = other&#xA;        else:&#xA;            return other &amp;gt; self.first_date&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Other rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No IO&lt;/li&gt;&#xA;&lt;li&gt;No RNG except via the provided PRNG&lt;/li&gt;&#xA;&lt;li&gt;No inspecting other bots. You are only allowed to use the &lt;code&gt;&amp;gt;&lt;/code&gt;, &lt;code&gt;&amp;lt;&lt;/code&gt;, &lt;code&gt;&amp;lt;=&lt;/code&gt;, &lt;code&gt;&amp;gt;=&lt;/code&gt;, &lt;code&gt;==&lt;/code&gt;, and &lt;code&gt;is&lt;/code&gt; operators on other bots.&lt;/li&gt;&#xA;&lt;li&gt;No exploiting the controller.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="92727" LastEditDate="2023-03-06T09:18:51.133" LastActivityDate="2023-03-06T09:18:51.133" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25393" PostTypeId="2" ParentId="2140" CreationDate="2022-12-16T19:52:26.497" Score="1" Body="&lt;h1&gt;Two-leg train journey&lt;/h1&gt;&#xA;&lt;p&gt;Joseph wants to travel by train from town A to town C.  There is no direct train, so he wants to transfer in town B.  You get the railway timetables from A to B and from B to C, and the latest time when Joseph needs to arrive to C.  Compute the latest time that Joseph can arrive to the railway station in A and still be in time.&lt;/p&gt;&#xA;&lt;p&gt;Times are given as integers between 0 and 1440, meaning the number of minutes from midnight on the day of the journey.  A schedule from a town to another is given as a list of pairs, each pair made of two times, namely the time when the train departs from the first station and the time when it arrives to the second station.  Your program gets three inputs: the train schedule from town A to town B, the train schedule from town B to town C, and the time when Joseph has to arrive to C the latest.  Your program must output a single time, namely the latest time when Joseph has to be on station A.&lt;/p&gt;&#xA;&lt;p&gt;The transfer at B is immediate, so if the first train arrives to B at exactly the same time as the second train departs from B then Joseph can transfer.  You can assume that there are enough trains that Joseph can arrive at the required time or earlier.  You can also assume that each schedule is sorted by departure time, but you cannot assume that the schedule is sorted by arrival time.  For example, in the example input below, the first train from B departs at time 319 (meaning 09:27) and arrives at time 567 (meaning 9:27), but the second train departs at 366 and arrives at 539, overtaking the first train.  Joseph is in a hypothetical country where trains always run exactly in time according to their schedule.&lt;/p&gt;&#xA;&lt;p&gt;Here's a non-golfed example solution in Python 3.  The function &lt;code&gt;transfer&lt;/code&gt; solves the problem.  The function &lt;code&gt;travel&lt;/code&gt; takes just one schedule and finds when you have to arrive to the station where the trains in that schedule start.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;def travel(schedule, arrival):&#xA;    departure = -2000&#xA;    for train in schedule:&#xA;        if train[1] &amp;lt;= arrival and departure &amp;lt; train[0]:&#xA;            departure = train[0]&#xA;    return departure&#xA;def transfer(schedule0, schedule1, arrival1):&#xA;    return travel(schedule0, travel(schedule1, arrival1))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here's how we invoke the above example solution with an example input triple.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;print(transfer(&#xA;    ((270, 294), (337, 357), (390, 414), (457, 477), (510, 534), (577, 597), (630, 654), (697, 717), (750, 774), (817, 837), (870, 894), (937, 957), (990, 1014), (1057, 1077), (1110, 1134), (1230, 1254), (1338, 1362)),&#xA;    ((319, 567), (366, 539), (540, 714), (545, 809), (780, 954), (785, 1055), (900, 1074), (905, 1169), (1025, 1280), (1140, 1324)),&#xA;    720))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This prints &lt;code&gt;510&lt;/code&gt;, which is the correct output for these inputs.  In station A, Joseph will take the train at time 510 (meaning 08:30), arrive to B at time 534 (08:54), get on the second train at time 540 (09:00), and arrive to C at time 714 (11:54), which is not later then the deadline time 720 (12:00).&lt;/p&gt;&#xA;&lt;p&gt;This is a slightly modified version of &lt;a href=&quot;http://wiki.math.bme.hu/view/Informatika1-2010/Hazi4&quot; rel=&quot;nofollow noreferrer&quot;&gt;an easy programming homework problem that I posed many years ago&lt;/a&gt;.  I am shamelessly copying the single example input from there, since I'm too lazy to make up a new one.&lt;/p&gt;&#xA;&lt;p&gt;Golf Sandbox, besides all the other feedback, please tell me what tags I should use.&lt;/p&gt;&#xA;" OwnerUserId="6691" LastActivityDate="2022-12-16T19:52:26.497" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25394" PostTypeId="2" ParentId="2140" CreationDate="2022-12-16T22:20:03.097" Score="-1" Body="&lt;h1&gt;Generate 3d Christmas tree using &amp;quot;3d pixel art&amp;quot;&lt;/h1&gt;&#xA;&lt;p&gt;Imagine you are building Christmas tree from 1x1x1 sized cubes that can be attached just by sharing a side. At least one input - &lt;code&gt;size&lt;/code&gt;, but can be more granular (&lt;code&gt;height&lt;/code&gt;, &lt;code&gt;bottom_width&lt;/code&gt;, etc.).&lt;/p&gt;&#xA;&lt;p&gt;Any kind of algorithm you like, data representation should be set of 3d int vectors containing positions of each cube.&lt;/p&gt;&#xA;&lt;p&gt;The more natural looking, the better.&lt;/p&gt;&#xA;&lt;p&gt;If you want to visualize it too, even better. But it's not essential (I may try to visualize some of your creations).&lt;/p&gt;&#xA;" OwnerUserId="116061" LastActivityDate="2022-12-16T22:20:03.097" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25395" PostTypeId="2" ParentId="2140" CreationDate="2022-12-17T20:05:38.940" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/256224/radd-decomposition-of-an-integer&quot;&gt;RADD decomposition of an integer&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="107434" LastEditorUserId="107434" LastEditDate="2022-12-31T18:53:49.530" LastActivityDate="2022-12-31T18:53:49.530" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25396" PostTypeId="1" AcceptedAnswerId="25398" CreationDate="2022-12-18T07:39:34.973" Score="4" ViewCount="57" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/4940/&quot;&gt;Community agrees that functions should be reusable&lt;/a&gt; while if a function take whole &lt;code&gt;stdin&lt;/code&gt; (like &lt;code&gt;while(gets())&lt;/code&gt; in C or &lt;code&gt;fs.readFileSync(0)&lt;/code&gt; in nodejs) then it can no longer be used. In this case is it still required to recover environment?&lt;/p&gt;&#xA;&lt;p&gt;A third answer, function don't take whole &lt;code&gt;stdin&lt;/code&gt;, can be considered&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2022-12-18T13:18:48.387" Title="Do function submissions have to recover environment if it consumes whole stdin?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25397" PostTypeId="2" ParentId="2140" CreationDate="2022-12-18T10:55:30.617" Score="2" Body="&lt;h1&gt;Selection and Prediction&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge: to select the strings &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt; and predict others' selections in an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/asymmetric&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;asymmetric&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;asymmetric&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-asymmetric-tooltip-container&quot;&gt;asymmetric&lt;/a&gt;-style &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/koth&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;koth&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;koth&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-koth-tooltip-container&quot;&gt;koth&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;All entries should be Python 3.10ish&#xA;&lt;sub&gt;META: version? also possibly JS if I have time ._..&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Part 1: Selection&lt;/h2&gt;&#xA;&lt;p&gt;You are tasked with selecting the strings &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt; as randomly as possible.&#xA;You are given the previous selections you have made and the guesses your 'opponent' has made.&#xA;Each input is a string of &lt;code&gt;A&lt;/code&gt; and &lt;code&gt;B&lt;/code&gt;. For example, &lt;code&gt;'ABBAB'&lt;/code&gt; and &lt;code&gt;'ABABA'&lt;/code&gt; may be arguments passed to your program.&lt;/p&gt;&#xA;&lt;p&gt;Your program should output either of &lt;code&gt;A&lt;/code&gt; or &lt;code&gt;B&lt;/code&gt; &lt;a href=&quot;https://en.wikipedia.org/wiki/Deterministic_algorithm&quot; rel=&quot;nofollow noreferrer&quot;&gt;deterministically&lt;/a&gt;, meaning the same input should result in the same output. This means no calling &lt;code&gt;random.choice()&lt;/code&gt; or similar, or using the date and time as seeds for a random number generator. &lt;sub&gt;META: maybe I should choose the first letter for them, since this constraint results in them always starting with the same letter&lt;/sub&gt; You may also output a tuple &lt;code&gt;(letter_str, state)&lt;/code&gt; and the state will be passed in as a keyword argument next round.&lt;/p&gt;&#xA;&lt;p&gt;An example entry (this will compete):&lt;/p&gt;&#xA;&lt;h4&gt;Selector: AAAAAA, 3 bytes&lt;/h4&gt;&#xA;&lt;p&gt;Not much to say. This program loves the letter &lt;kbd&gt;A&lt;/kbd&gt;&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;def aaaaaa(selections, guesses):&#xA;    return &amp;quot;A&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Part 2: Prediction&lt;/h2&gt;&#xA;&lt;p&gt;Your task is to predict the most likely move that your opponent will make. Same input, output and constraints as above.&lt;/p&gt;&#xA;&lt;p&gt;Another example entry: (this will compete too)&lt;/p&gt;&#xA;&lt;h4&gt;Predictor: Anti-repeater, 3 bytes&lt;/h4&gt;&#xA;&lt;p&gt;Assumes you tend to repeat your previous selection.&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;def anti_repeater(selections, guesses):&#xA;    # It's fine to modify the lists&#xA;    return selections.pop()&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Part 3: Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Each &lt;em&gt;Selector&lt;/em&gt; submission will go against each &lt;em&gt;Predictor&lt;/em&gt; submission for a total of 110 rounds. They will select and predict for the first round, then select and predict again, and again, until all rounds have finished.&lt;/p&gt;&#xA;&lt;p&gt;For each round correctly predicted (excluding the first 10 rounds, since they may be hard to predict) the &lt;em&gt;Predictor&lt;/em&gt; submission wins 1 point. For each round incorrectly predicted (also excluding the first 10 rounds) the &lt;em&gt;Selector&lt;/em&gt; submission wins 1 point.&lt;/p&gt;&#xA;&lt;p&gt;The winners are the submissions with the most total points from all &lt;em&gt;Selector&lt;/em&gt; and &lt;em&gt;Predictor&lt;/em&gt; submissions. Since there are two winners no answer will be accepted.&lt;/p&gt;&#xA;&lt;p&gt;If you type hint you get &lt;s&gt;0 extra points.&lt;/s&gt; my respect!&lt;/p&gt;&#xA;&lt;h2&gt;(Part 4: meta)&lt;/h2&gt;&#xA;&lt;p&gt;EDIT: added scoring&lt;/p&gt;&#xA;&lt;p&gt;What do you call a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-cops-and-robbers-tooltip-container&quot;&gt;cops-and-robbers&lt;/a&gt; where every cop goes against every robber and vice versa?&lt;/p&gt;&#xA;&lt;p&gt;EDIT: Change 'key' to 'string' and fix up typo&lt;/p&gt;&#xA;&lt;p&gt;EDIT: Some other stuff added&lt;/p&gt;&#xA;" OwnerUserId="95204" LastEditorUserId="95204" LastEditDate="2023-04-02T09:42:55.393" LastActivityDate="2023-04-02T09:42:55.393" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="25398" PostTypeId="2" ParentId="25396" CreationDate="2022-12-18T13:18:48.387" Score="4" Body="&lt;h1&gt;This shouldn't be a special case&lt;/h1&gt;&#xA;&lt;p&gt;Consuming the entirety of standard input isn't something that necessarily makes a function unusable in the future, because it's possible for files to grow.&lt;/p&gt;&#xA;&lt;p&gt;If standard input is a regular file, a loop like &lt;code&gt;while(gets(…))&lt;/code&gt; (&lt;em&gt;note&lt;/em&gt;: this code is inherently insecure, so although it's allowed for golfing if you know how large the input could be, it should never be used for regular programming) will read to the end of the file – the &lt;em&gt;current&lt;/em&gt; end of the file. Then it will stop. The next time you run the function, it will start reading the file where it left off, but that isn't necessarily going to be the end of the file any more, because someone might have edited the file in between the two calls and made it longer.&lt;/p&gt;&#xA;&lt;p&gt;The same phenomenon can also happen if standard input is a terminal; the user can type whatever the &amp;quot;end of file&amp;quot; character sequence is (&lt;kbd&gt;Ctrl&lt;/kbd&gt;-&lt;kbd&gt;D&lt;/kbd&gt; on Unix/Linux/Mac or &lt;kbd&gt;Ctrl&lt;/kbd&gt;-&lt;kbd&gt;Z&lt;/kbd&gt; on Windows), and the input routines will return an end-of-file condition at that point. However, if you keep reading from the terminal after that, it'll keep looking for user input, with another end-of-file sequence required to make the input routines return end-of-file again.&lt;/p&gt;&#xA;&lt;p&gt;When writing full programs that consume input, it's reasonable for a program to assume that an end-of-file condition on standard input, once encountered, will continue to be encountered, i.e. its input isn't changing while it's reading it. The reason you can do that is that we're conceptually providing the input to the program by connecting standard input to an unchanging file. However, when writing a function submission, we're conceptually connecting the standard input of &lt;em&gt;each call&lt;/em&gt; to the function to its own unchanging section of a file, and that doesn't imply that multiple calls will be given the same data (or that the first call will be the only call with data and the others will have empty input); each call is being given different input, which can in practice be implemented by growing standard input in between the calls (by appending to the file or typing on the terminal that represents it).&lt;/p&gt;&#xA;&lt;p&gt;As such, I don't see any reason why functions that read standard input should be treated any differently than functions that don't, even if they read it all the way to (what is, to them) the end – our normal rules for functions should be fine here.&lt;/p&gt;&#xA;" OwnerUserId="76359" LastActivityDate="2022-12-18T13:18:48.387" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25399" PostTypeId="2" ParentId="2140" CreationDate="2022-12-18T16:35:59.757" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/256050/friend-or-foe&quot;&gt;Friend or Foe?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="115910" LastEditorUserId="115910" LastEditDate="2022-12-26T21:40:49.323" LastActivityDate="2022-12-26T21:40:49.323" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25400" PostTypeId="2" ParentId="2140" CreationDate="2022-12-18T17:53:11.933" Score="-1" Body="&lt;h1&gt;Halting detector &lt;s&gt;(Archived)&lt;/s&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Choose a Turing complete language and write a program in this language that, given a program in 1TB, decide whether it halts.&lt;/p&gt;&#xA;&lt;p&gt;Your program would likely be more than 1TB, which results in transferring difficulty&lt;sup&gt;1&lt;/sup&gt;. Therefore, you only need to show your construction and prove your code length.&lt;/p&gt;&#xA;&lt;p&gt;Shortest code in each language win. A Turing complete language which write 2TB of program to do a loop would make short submission but that won't be fun (and I don't think such language exist now)&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; Yeah it isn't the main point&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2022-12-20T10:12:40.667" LastActivityDate="2022-12-20T10:12:40.667" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="25401" PostTypeId="2" ParentId="2140" CreationDate="2022-12-19T17:40:10.463" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/256166/is-it-true-ask-pip&quot;&gt;Is it true? Ask Pip!&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="16766" LastEditDate="2022-12-30T04:37:25.993" LastActivityDate="2022-12-30T04:37:25.993" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25402" PostTypeId="2" ParentId="2140" CreationDate="2022-12-20T11:45:33.993" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/256003/114446&quot;&gt;Calculate my income tax&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="114446" LastEditorUserId="114446" LastEditDate="2022-12-25T09:49:08.307" LastActivityDate="2022-12-25T09:49:08.307" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25403" PostTypeId="2" ParentId="2140" CreationDate="2022-12-20T15:59:45.657" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/256291/maximum-of-outer-product-of-integer-vectors-in-linear-time&quot;&gt;Maximum of outer product of integer vectors&#xA;(in linear time)&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="116134" LastEditorUserId="116134" LastEditDate="2023-01-03T13:43:56.823" LastActivityDate="2023-01-03T13:43:56.823" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25404" PostTypeId="2" ParentId="2140" CreationDate="2022-12-20T16:01:28.250" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255930/is-this-position-a-pure-mirror-mate&quot;&gt;Is this position a pure mirror mate?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="85914" LastEditorUserId="85914" LastEditDate="2022-12-22T17:24:14.640" LastActivityDate="2022-12-22T17:24:14.640" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25405" PostTypeId="2" ParentId="14587" CreationDate="2022-12-22T16:25:47.710" Score="0" Body="&lt;h1&gt;Baseline for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;fastest-code-container&quot;&gt;fastest-code&lt;/a&gt; can be an answer&lt;/h1&gt;&#xA;&lt;p&gt;Baseline for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;fastest-code-container&quot;&gt;fastest-code&lt;/a&gt; usually behave as valid answer to allow a reasonable comparing. And I do see case where score worse than baseline is seen, maybe because of slow language or something.&lt;/p&gt;&#xA;&lt;p&gt;It's of course also ok to place it only in question, it's up to OP.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2022-12-22T16:25:47.710" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25407" PostTypeId="2" ParentId="2140" CreationDate="2022-12-22T18:02:21.140" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255972/flip-the-order-of-operations&quot;&gt;Flip the order of operations&lt;/a&gt;  &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2022-12-23T13:47:47.623" LastActivityDate="2022-12-23T13:47:47.623" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25408" PostTypeId="2" ParentId="2140" CreationDate="2022-12-22T22:55:10.607" Score="3" Body="&lt;h1&gt;KotH: Build an Organism&lt;/h1&gt;&#xA;&lt;p&gt;A while back, I made a thing that simulates a world, with a bunch of organisms with randomly chosen genes:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/EwEjbm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/EwEjbm.png&quot; alt=&quot;dieplife&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;These would code for things like how the organism would manage resources (such as sugar, water, and starch), whether it could photosynthesize, hunt, run away from enemies, or defend itself using tough materials like wood or stone spikes.&lt;/p&gt;&#xA;&lt;p&gt;In this challenge, you'll design an organism which can effectively survive. This could be through strategies including:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Being an effective hunter, chasing down and killing prey&lt;/li&gt;&#xA;&lt;li&gt;Being difficult to attack, such as by having tough armor and fleeing from stronger organisms&lt;/li&gt;&#xA;&lt;li&gt;Growing and dividing too quickly for it to be possible that all organisms of your species are killed at the same time&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I will update this post with a spec listing all available resources, materials, genetic traits, and actions later.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2022-12-22T22:55:10.607" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25411" PostTypeId="2" ParentId="2140" CreationDate="2022-12-23T23:17:08.043" Score="0" Body="&lt;h2&gt;Balanced Candy Distribution&lt;/h2&gt;&#xA;&lt;p&gt;There are 4 piles with 12 pieces of candy each, for a total of 48 pieces, and there are 12 kids to split that candy with, each kid will receive exactly 1 piece of candy from each pile, each piece of candy has a unique number on it, from 0 to 47, the candies with numbers 0 through 11 are on one pile, candies number 12 through 23 are on another, candies 24 through 35 are on a pile, and the last pile is candies 36 to 47. Candy #0 tastes amazing, and candy #47 tastes not so great, so to make it fair, each kid’s 4 candies should add up to the same number (which should be 94), there is an issue though, there are an unknown number of different flavors of candy, completely independent of their tastiness, and it would be unfair if Timmy was to, by bad luck, have all his 4 pieces of candy end up being cinnamon flavored, so, we introduce the idea of “Unfairness points”. For each kid, if we match each of their four candy pieces to their other three candies, for each pairing if both candies are the same flavor, we add one unfairness point, to illustrate this, let’s imagine a smaller example, with only four kids and 16 candies, if Timmy got 4 cinnamon candies, Laura got 1 cinnamon candy, 1 vanilla candy, and 2 chocolate candy, Johnny got 2 vanilla candies and 2 caramel candies, and Sam got 3 cinnamon candy and 1 strawberry candy, this arrangement would receive 12 unfairness points: 6 from Timmy, 1 from Laura, 2 from Johnny, and 3 from Sam.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Your code must output the arrangement&lt;/em&gt; that satisfies the two restrictions set forth in the beginning (each kid receives a single candy from each pile, and that for each kid all of their four candies add up to 94) &lt;em&gt;that has the fewest unfairness points&lt;/em&gt;, if there is more than one arrangement that is tied for least number of unfairness points, you must output the list of all of those arrangements given a list of all the candies. This input could be formatted in any way that is convenient, but preferably something resembling a list of strings, where the index is the number of the candy and the string is the flavor, for example, in python, a valid input format would be&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[“Chocolate”,“Chocolate”,“Chocolate”,“Vanilla”,“Chocolate”,“Apple”,“Chocolate”,“Vanilla”,“Caramel”,“Chocolate”,“Vanilla”,“Chocolate”,“Apple”,“Apple”,“Caramel”,“Chocolate”,“Vanilla”,“Chocolate”,“Apple”,“Sour”,“Chocolate”,“Chocolate”,“Vanilla”,“Chocolate”,“Apple”,“Sour”,“Pear”,“Pear”,“Caramel”,“Vanilla”,“Vanilla”,“Vanilla”,“Apple”,“Sour”,“Chocolate”,“Chocolate”,“Avocado”,“Apple”,“Sour”,“Pear”,“Pear”,“Chocolate”,“Chocolate”,“Chocolate”,“Vanilla”,“Chocolate”,“Vanilla”,“Caramel”]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Or it could also be already separated into the piles&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[“Chocolate”,“Chocolate”,“Chocolate”,“Vanilla”,“Chocolate”,“Apple”,“Chocolate”,“Vanilla”,“Caramel”,“Chocolate”,“Vanilla”,“Chocolate”],[“Apple”,“Ap...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Or it could include the number itself, if you wanted&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[0,“Chocolate”],[1,“Chocolate”],[2,“Chocolate”],[3,“Vanilla”],[4,“Chocolate”],[5,“Apple”],[6,“Chocola...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The output can be given in any way that makes it easy to interpret what the numbers of the candies each kid should get, for example, in python, an output like&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[0,19,30,45],[9,14,28,43],[5...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Is totally fine, and anything that is easy or understandable like that is fine.&lt;/p&gt;&#xA;&lt;p&gt;This is code-golf and so lowest bytes wins&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Sandbox questions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;English is my second language, is this written clearly enough?&lt;/li&gt;&#xA;&lt;li&gt;Would it be better if it was generalized? As in &amp;quot;There are N piles with C pieces of candy each, for a total of N*C pieces, and there are C kids to split that candy with, each kid will receive exactly 1 piece of candy from each pile...&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;Any other thoughts?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="116208" LastEditorUserId="116208" LastEditDate="2022-12-23T23:53:37.210" LastActivityDate="2022-12-23T23:53:37.210" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25412" PostTypeId="2" ParentId="12268" CreationDate="2022-12-25T12:24:27.327" Score="0" Body="&lt;h1&gt;A memory/storage lowerbound is fine&lt;/h1&gt;&#xA;&lt;p&gt;Requiring at least &lt;span class=&quot;math-container&quot;&gt;\$10^{100}\$&lt;/span&gt; bytes of RAM or hard disk is fine even if no computer would ever reach this amount of storage. Lots of brute force program do this.&lt;/p&gt;&#xA;&lt;p&gt;Requiring exactly 1826680 byte of space left on hard disk is not allowed, even if some computer that satisfy this condition exist&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2022-12-25T12:31:51.470" LastActivityDate="2022-12-25T12:31:51.470" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25413" PostTypeId="2" ParentId="6918" CreationDate="2022-12-25T13:04:11.093" Score="0" Body="&lt;h1&gt;ACCUMULATOR&lt;/h1&gt;&#xA;&lt;p&gt;This was my first language, and mainly it was intended as practice for my computer exam.&lt;/p&gt;&#xA;&lt;p&gt;It's online at &lt;a href=&quot;https://rizwan342.github.io/accumulator.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;this page&lt;/a&gt; and its esolangs page is &lt;a href=&quot;https://esolangs.org/wiki/ACCUMULATOR&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://esolangs.org/wiki/ACCUMULATOR&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This is unusable for programming, but has &lt;s&gt;one&lt;/s&gt; two answers on CGCC. It is &lt;em&gt;not&lt;/em&gt; a golfing language, but as my website says, &amp;quot;a programming language that is only useful for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;kolmogorov-complexity-container&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenges with a fixed number as the output&amp;quot;. It has only 4 functions, and interpreters and more can be found on the esolangs page.&lt;/p&gt;&#xA;" OwnerUserId="110681" LastEditorUserId="110681" LastEditDate="2023-01-04T17:57:07.867" LastActivityDate="2023-01-04T17:57:07.867" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25414" PostTypeId="2" ParentId="2140" CreationDate="2022-12-26T08:16:59.883" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/256211/find-the-smallest-turing-machine-that-solves-the-self-counting-problem&quot;&gt;Find the smallest turing machine that solves the self-counting problem&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="110538" LastEditorUserId="110538" LastEditDate="2022-12-31T08:08:58.483" LastActivityDate="2022-12-31T08:08:58.483" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="25415" PostTypeId="2" ParentId="2140" CreationDate="2022-12-27T22:24:26.210" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/256147/98937&quot;&gt;Find the Prime Signature&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="98937" LastEditorUserId="98937" LastEditDate="2022-12-29T23:42:55.770" LastActivityDate="2022-12-29T23:42:55.770" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25416" PostTypeId="2" ParentId="2140" CreationDate="2022-12-28T07:47:11.677" Score="1" Body="&lt;p&gt;Given an array of array of array of ..., convert it into a string. Brackets should be used to show depth.&lt;/p&gt;&#xA;&lt;p&gt;However, the input may include loops (e.g. an array containing itself), which would lead to an infinite output without extra rule. Therefore, if an array has been expanded twice (and is trying to expand a third time), it should be expanded into something else.&lt;/p&gt;&#xA;&lt;p&gt;Since some languages don't support recursive arrays, it's also allowed to take a list of list of indices &lt;span class=&quot;math-container&quot;&gt;\$[A_1,A_2,\ldots]=[[a_{11}, a_{12},\ldots],[a_{21},a_{22},\ldots],\ldots]\$&lt;/span&gt;, where each integer &lt;span class=&quot;math-container&quot;&gt;\$a_{ij}\$&lt;/span&gt; should be replaced with the expanded array &lt;span class=&quot;math-container&quot;&gt;\$A_j\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Shortest code wins.&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;raw&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;indices&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;result&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;code&gt;[]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;code&gt;[]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;code&gt;[]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;code&gt;[[],[]]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;code&gt;[1,1],[]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;code&gt;[[],[]]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;code&gt;A=[A,A]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;code&gt;[0,0]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;code&gt;[[-,-],[-,-]]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;code&gt;[A=[B],B=[A]]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;code&gt;[1,2],[2],[1]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;code&gt;[[[[[-]]]],[[[[-]]]]]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;Function in javascript to convert indices into array:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;function indices2array(arr) {&#xA;    var ret = arr.map(_=&amp;gt;[]);&#xA;    for (var i in arr) {&#xA;        for (var j of arr[i]) ret[i].push(ret[j]);&#xA;        ret[i].id = +i;&#xA;    }&#xA;    return ret[0];&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Idea from recursive &lt;code&gt;iframe&lt;/code&gt;. On Firefox, it expands using this rule.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/NkQgY.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/NkQgY.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;A&amp;lt;br&amp;gt;&amp;lt;iframe src=&amp;quot;B.html&amp;quot;&amp;gt;&amp;lt;/iframe&amp;gt;&#xA;B&amp;lt;br&amp;gt;&amp;lt;iframe src=&amp;quot;A.html&amp;quot;&amp;gt;&amp;lt;/iframe&amp;gt;&#xA;X&amp;lt;br&amp;gt;&amp;lt;iframe height=&amp;quot;400&amp;quot; src=&amp;quot;A.html&amp;quot;&amp;gt;&amp;lt;/iframe&amp;gt;&amp;lt;iframe height=&amp;quot;400&amp;quot; src=&amp;quot;B.html&amp;quot;&amp;gt;&amp;lt;/iframe&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Given function that expands once, is it easy to expand twice?&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="113573" LastEditDate="2023-01-27T17:10:41.313" LastActivityDate="2023-01-27T17:10:41.313" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="25417" PostTypeId="2" ParentId="8047" CreationDate="2022-12-29T06:16:19.963" Score="11" Body="&lt;h1&gt;Real-valued output without further specification, or with a bad one&lt;/h1&gt;&#xA;&lt;p&gt;For integer outputs, you can check correctness with exact equality. For exact fractions, many challenges require to output a (numerator, denominator) pair which has worked out pretty well in practice.&lt;/p&gt;&#xA;&lt;p&gt;But for &lt;strong&gt;real number&lt;/strong&gt; outputs, the situation is totally different. All we have is floating-point numbers, which is a mere approximation of real numbers. Since it is an approximation, the challenge needs a requirement on accuracy as a validity criterion. And &lt;strong&gt;writing a good requirement on accuracy is HARD&lt;/strong&gt;. Here are some guidelines to consider when writing such a challenge.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;strong&gt;Use relative error&lt;/strong&gt;. &amp;quot;Should output within a &lt;a href=&quot;https://mathworld.wolfram.com/RelativeError.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;relative error&lt;/a&gt; of &lt;span class=&quot;math-container&quot;&gt;\$e\$&lt;/span&gt;&amp;quot; means that, if the true value is &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; and the output is &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$\frac{|x-y|}{x} \le e\$&lt;/span&gt;. The value of &lt;span class=&quot;math-container&quot;&gt;\$e\$&lt;/span&gt; is commonly set to &lt;span class=&quot;math-container&quot;&gt;\$10^{-6}\$&lt;/span&gt;, but can be adjusted as necessary. (More on this below.)&lt;/p&gt;&#xA;&lt;p&gt;Or even better, use &amp;quot;absolute or relative error&amp;quot; (use absolute error when the expected result is less than 1 in magnitude, and relative error otherwise) when the result can be small as well. Some (theoretically correct) algorithms may fail to handle sufficiently small numbers and just give 0, which always has a relative error of 1 by definition.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/256106/78410&quot;&gt;&amp;quot;Should output within 1 of the correct answer&amp;quot;&lt;/a&gt; is saying about &lt;a href=&quot;https://mathworld.wolfram.com/AbsoluteError.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;absolute error&lt;/a&gt;. It is bad if the result can be arbitrarily large, as it requires more and more correct digits as the expected result increases, and eventually it will go outside the limits of usual floating-point numbers (usually 64-bit for most languages).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Consider various ways to compute the given function. One could use numerical integration (e.g. Riemann sums), iterative convergence (e.g. Newton's method), or maybe a simple approximation formula exists. These should be taken into account in various aspects, such as the following.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Decide which methods to disallow. Maybe an approximation formula looks too cheap? Then you might need to tighten the error margin &lt;span class=&quot;math-container&quot;&gt;\$e\$&lt;/span&gt; (mentioned above) and provide test cases where the formula doesn't produce close enough values.&lt;/li&gt;&#xA;&lt;li&gt;Does the task contain some extreme cases (the output is 0, +/- infinity, undefined or otherwise discontinuous)? The best option in that case is &amp;quot;the inputs close to such extreme points won't be given&amp;quot;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Ensuring the error limit for &lt;em&gt;all possible inputs&lt;/em&gt; is extremely hard, and most of us simply don't know how to prove it. So it is better to give multiple test cases and specify that an answer &amp;quot;should output within error &lt;strong&gt;for the given test cases&lt;/strong&gt;&amp;quot;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/211763/78410&quot;&gt;Circumference of an ellipse&lt;/a&gt; (Disclaimer: one of my challenges) is a reference of a well-specified real-valued task.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2022-12-29T06:16:19.963" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25420" PostTypeId="2" ParentId="2140" CreationDate="2022-12-30T11:33:40.767" Score="1" Body="&lt;h2&gt;No, thanks!&lt;/h2&gt;&#xA;&lt;p&gt;In the game “No Thanks!” playing cards numbered 3 to 35 are shuffled in a deck and 11 chips distributed to each player. The first player flips over a card and can then decide either to take the card, or to place a chip on top of it and to pass it on.&lt;/p&gt;&#xA;&lt;p&gt;The card continues to be passed around until a player decides to take the card along with its chips. The same player flips over the next card and continues the procedure.&lt;/p&gt;&#xA;&lt;p&gt;At the end of the game, the value of their cards get added up. Each chip they own is worth a negative point. The player with the lowest number of points wins.&lt;/p&gt;&#xA;&lt;p&gt;Should a player have cards in succession (e.g. 18, 19, and 20), then the card with the lowest value (18) will be considered.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;9 cards will be removed from the deck at the start of the game&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You will be participating with 2 other players&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Everyone’s cards will always be visible&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You do not have access to the amount of chips that others possess. You can, however, keep track of them.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="96037" LastActivityDate="2022-12-30T11:33:40.767" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25421" PostTypeId="1" AcceptedAnswerId="25434" CreationDate="2022-12-31T14:03:36.933" Score="11" ViewCount="394" Body="&lt;p&gt;From time to time, answers can be posted to the site which, at the time are valid but later become invalid without any fault of the original answerer. For example, a number of answers to &lt;a href=&quot;https://codegolf.stackexchange.com/q/76604/66833&quot;&gt;this challenge&lt;/a&gt; use domains such as &lt;a href=&quot;http://ppcg.lol&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://ppcg.lol&lt;/a&gt; and &lt;a href=&quot;http://ppcg.ga&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://ppcg.ga&lt;/a&gt;, which, at the time, worked, but have since expired and so the answers are technically invalid.&lt;/p&gt;&#xA;&lt;p&gt;Typically, I would advocate for always deleting invalid answers. However, in this specific case, I'm not entirely sure that deletion is the correct approach:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;For the linked challenge specifically, a total of 4 out of the 50 answers do &lt;em&gt;not&lt;/em&gt; use a broken URL, meaning that 46 answers would either need to be updated (unlikely, given the question is almost 7 years old) or deleted. Such mass deletion of answers would be incredibly disruptive to the challenge.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;In general, the reason that answers like this are invalid are not any fault of the original answerers. Rather, it's because of external factors out of their control that invalidate their answers, such as domains expiring or even languages being updated.&lt;/p&gt;&#xA;&lt;p&gt;In this case, we would effectively be requiring answers to keep up to date over multiple years, or else be marked invalid by something out of the answerers' control.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;These are simply my personal opinions on the matter though, and feel free to share your suggestions as well. What does the community believe is the appropriate course of action here?&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;In fact, this issue appears to be not uncommon, especially for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;internet-container&quot;&gt;internet&lt;/a&gt; challenges. For example,&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All answers &lt;a href=&quot;https://codegolf.stackexchange.com/q/77030/66833&quot;&gt;here&lt;/a&gt; are invalid, as &lt;a href=&quot;https://strawpoll.me/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://strawpoll.me/&lt;/a&gt; is closing down&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Similarly, if &lt;a href=&quot;https://i.imgur.com&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://i.imgur.com&lt;/a&gt;, &lt;a href=&quot;https://goo.gl&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://goo.gl&lt;/a&gt;, or various other sites ever go down, entire challenges would be invalidated.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Answers &lt;a href=&quot;https://codegolf.stackexchange.com/q/226635/66833&quot;&gt;here&lt;/a&gt; are susceptible at any time to being invalidated by another answer being posted with the same search text/by the same user&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2022-12-31T14:27:17.207" LastActivityDate="2023-01-08T01:23:20.133" Title="How do we handle answers that have later become invalid due to external circumstances?" Tags="|discussion|answers|deleted-answers|" AnswerCount="4" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25422" PostTypeId="2" ParentId="25421" CreationDate="2022-12-31T18:59:03.063" Score="-3" Body="&lt;h1&gt;Language updates breaking answers is no problem&lt;/h1&gt;&#xA;&lt;p&gt;If I try to run an answer from ten years ago using a modern compiler/interpreter and it doesn't work, a reasonable assumption is that I should use a compiler/interpreter from ten years ago. It is unreasonable to expect anyone to update answers that are broken in this fashion, as that can mean hundreds or thousands of updates all at once. Additionally, any updates would be likely to alter the byte count of the answer, which is a can of worms best left unopened (unless of course the original answerer wishes to take advantage of new features to reduce the byte count).&lt;/p&gt;&#xA;" OwnerUserId="97916" LastEditorUserId="97916" LastEditDate="2022-12-31T19:05:12.147" LastActivityDate="2022-12-31T19:05:12.147" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25423" PostTypeId="2" ParentId="8047" CreationDate="2023-01-01T18:25:20.950" Score="4" Body="&lt;h1&gt;Challenges whose validity can only be judged based on an external source&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/25421/91213&quot;&gt;Based on this discussion&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Avoid writing challenges like &amp;quot;scrape this website&amp;quot; or &amp;quot;use this API&amp;quot; or reproduce some website. Things on the internet change or go down all the time. If this happens all answers will be invalidated.&lt;/p&gt;&#xA;&lt;p&gt;Instead, try to fix the relevant parts in your code. &amp;quot;Send a API request matching this JSON schema to this URL&amp;quot;. Even if the URL no longer exists or has changed, you can still validate if submissions send something matching the schema.&lt;/p&gt;&#xA;&lt;p&gt;For something like scrapping you can do the same. Include a text like &amp;quot;Assume the response will be formatted like the following&amp;quot; and then include a HTML sample.&lt;/p&gt;&#xA;&lt;p&gt;Of course, if you are straying from a real site anyways you could consider simplifying these resources. If they don't have to match a real site you could remove parts that don't add much fun to the actual golfing.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="46076" LastEditDate="2023-05-07T15:05:45.953" LastActivityDate="2023-05-07T15:05:45.953" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25424" PostTypeId="1" CreationDate="2023-01-02T19:29:42.987" Score="10" ViewCount="529" Body="&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/141710/best-of-cgcc-2022&quot;&gt;Event chatroom!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Well, 2022's come to an end, and so that means: Best of CGCC 2022!&lt;/p&gt;&#xA;&lt;p&gt;In this thread, we'll consolidate the categories for our Best Posts of 2022, and eventually we'll vote on which posts will win for each category. In this thread, we are looking for two things:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Categories to classify exceptional posts from 2022 (e.g. Best Mathematical Insight or Rookie of the Year)&lt;/li&gt;&#xA;&lt;li&gt;Bounties offered to reward the winners in those categories&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Please nominate categories as answers to this question. Each answer should contain a category for a challenge or answer to be rewarded. The top-voted categories will then receive separate nomination posts to find the actual winners. Like previous years, I'm not going to state a fixed number of categories that will make it, but it's probably going to be between 5 and 15. Last year was slightly complicated, but we've usually gone with between 5 and 15 in previous years.&lt;/p&gt;&#xA;&lt;p&gt;Feel free to resubmit categories from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24225/best-of-cgcc-2021-call-for-categories&quot;&gt;last year&lt;/a&gt; or &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/tagged/best-of&quot;&gt;previous years&lt;/a&gt;, regardless of whether they were among the final selected categories or not.&lt;/p&gt;&#xA;&lt;p&gt;Voting on categories should last around 2 weeks, but this is by no means a hard limit, and we'll be happy to extend it further if new category nominations are still incoming.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Offered bounties&lt;/h2&gt;&#xA;&lt;p&gt;Last year, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24225/best-of-cgcc-2021-call-for-categories&quot;&gt;we offered bounties to the winners&lt;/a&gt;. If you want to offer a bounty, please edit your name and the amount in below, or leave a comment or ping in the chatroom and I'll edit it in.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;emanresu A (+2500)&lt;/li&gt;&#xA;&lt;li&gt;caird coinheringaahing (+2500)&lt;/li&gt;&#xA;&lt;li&gt;alephalpha (+1000)&lt;/li&gt;&#xA;&lt;li&gt;Steffan (+1000)&lt;/li&gt;&#xA;&lt;li&gt;pxeger (+1000)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="100664" LastEditDate="2023-01-17T05:22:43.147" LastActivityDate="2023-01-17T05:22:43.147" Title="Best of CGCC 2022 - Call for categories" Tags="|discussion|best-of|" AnswerCount="17" CommentCount="2" ClosedDate="2023-01-16T22:44:02.410" ContentLicense="CC BY-SA 4.0" />
  <row Id="25425" PostTypeId="2" ParentId="25424" CreationDate="2023-01-02T19:29:42.987" Score="-1" Body="&lt;h1&gt;Off the Charts&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24280/108218&quot;&gt;2021&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;For an answer that has been proven to work correctly but can't realistically be run, for example because it would take an enormous amount of time to execute.&lt;/p&gt;&#xA;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2023-01-03T18:04:55.913" LastActivityDate="2023-01-03T18:04:55.913" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25426" PostTypeId="2" ParentId="25424" CreationDate="2023-01-02T19:35:27.227" Score="8" Body="&lt;h1&gt;Rookie of the Year - Challenges&lt;/h1&gt;&#xA;&lt;p&gt;Repost of &lt;a href=&quot;/a/24228/100664&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;/a/20589/66833&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;/a/18437/66833&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;/a/17318/85052&quot;&gt;2018&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For the best challenge written by someone who has not written a challenge prior to 2022.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1692946/2022-challenges-by-users-with-no-challenges-before-2022&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE query&lt;/a&gt; thanks to mousetail&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="91213" LastEditDate="2023-01-03T07:31:52.560" LastActivityDate="2023-01-03T07:31:52.560" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25427" PostTypeId="2" ParentId="25424" CreationDate="2023-01-02T19:37:43.313" Score="10" Body="&lt;h2&gt;Breaking The Mold (Most Original Challenge)&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;Reposted from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24283/108218&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17327/66833&quot;&gt;2018&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;It's really easy to come up with normal &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;ascii-art-container&quot;&gt;ascii-art&lt;/a&gt;, or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;sequence-container&quot;&gt;sequence&lt;/a&gt; challenge, etc. Don't get me wrong, there's nothing wrong with these challenges. They're the meat of the challenges on our site. However, they're not the most imaginative.&lt;/p&gt;&#xA;&lt;p&gt;This category is for a challenge that re-invents the wheel, and explores new ideas that we haven't really used on the site.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Maybe this challenge inspired a new tag, or category of challenges?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Maybe it's a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-challenge-container&quot;&gt;code-challenge&lt;/a&gt; with a unique and very well balanced scoring formula?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Or maybe it's even a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; challenge about a novel task. This category is for rewarding users who came up with interesting ideas that keep the site fresh.&lt;/p&gt;&#xA;&lt;p&gt;Some justification for why the challenge is original is necessary with nominations - 99% of challenges posted on the site shouldn't qualify for this.&lt;/p&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2023-01-02T19:46:07.003" LastActivityDate="2023-01-02T19:46:07.003" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25428" PostTypeId="2" ParentId="25424" CreationDate="2023-01-02T19:37:50.010" Score="10" Body="&lt;h1&gt;Rookie of the Year - Answers&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24235/100664&quot;&gt;2021&lt;/a&gt; and other years.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;For the best answer written by a new user in 2022. This doesn't have to be a user who created their account in 2022 - rather, this is for any answer posted by a user in 2022 where that answer was that user's first answer on the site.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1692861/2022-answers-by-users-with-no-answers-before-2022&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE query&lt;/a&gt; (modified from the 2021 one)&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="108218" LastEditDate="2023-01-02T19:45:59.017" LastActivityDate="2023-01-02T19:45:59.017" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25429" PostTypeId="2" ParentId="25424" CreationDate="2023-01-02T19:38:52.287" Score="7" Body="&lt;h1&gt;Most unexpected outcome&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24239/108218&quot;&gt;2021&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;An answer that you didn’t expect to work, or do something else, but unexpectedly did some weird behavior and made the answer valid.&lt;/p&gt;&#xA;&lt;p&gt;This could involve some interpreter bug, or obscure feature that wasn’t documented nor known by many people.&lt;/p&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2023-01-02T19:45:45.737" LastActivityDate="2023-01-02T19:45:45.737" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25430" PostTypeId="2" ParentId="25424" CreationDate="2023-01-02T19:40:02.157" Score="13" Body="&lt;h1&gt;Best mathematical insight&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost of &lt;a href=&quot;/a/24226&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20597/43319&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18442/78410&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17317/78410&quot;&gt;2018&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;On this site we often see answers in languages specifically designed for short code, or designed to be fast. Sometimes, a nice golfing trick or speed-up technique surprises us with its ingenuity, beyond the standard use of that language.&lt;/p&gt;&#xA;&lt;p&gt;And occasionally an answer shows up that uses an unexpected approach to greatly simplify the problem, and makes us wonder how the author could ever think of that. This usually involves some far-from-obvious mathematical equivalence, or a particularly simple approach to the problem that was not evident at all (once revealed, other answers often follow the same approach).&lt;/p&gt;&#xA;&lt;p&gt;This category is for the answer with the best &lt;strong&gt;mathematical&lt;/strong&gt; insight or unexpected approach that led to greatly simplifying the problem, in &lt;strong&gt;any challenge type&lt;/strong&gt; (code golf, fastest code, or others). The insight should have led to a significant improvement according to the challenge's metric (code length, run time, or whatever applicable).&lt;/p&gt;&#xA;" OwnerUserId="100664" LastActivityDate="2023-01-02T19:40:02.157" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25431" PostTypeId="2" ParentId="25424" CreationDate="2023-01-02T19:42:21.600" Score="9" Body="&lt;h1&gt;Best Explanation&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24248/108218&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20601/66833&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18451/66833&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17315/66833&quot;&gt;2018&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14512/66833&quot;&gt;2017&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10940/66833&quot;&gt;2016&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This category is for the answer with the best explanation accompanying it. Ideally, the winner will be an answer with a very detailed explanation that is accessible to anyone, regardless of the amount of relevant knowledge already possessed.&lt;/p&gt;&#xA;" OwnerUserId="108218" LastActivityDate="2023-01-02T19:42:21.600" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25432" PostTypeId="2" ParentId="25424" CreationDate="2023-01-02T19:43:46.027" Score="6" Body="&lt;h1&gt;Most significant impact via Meta&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24237/108218&quot;&gt;2021&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;/questions&quot;&gt;Meta&lt;/a&gt; is an important yet often overlooked portion of this site, where significant rules changes are decided, and the site becomes the most democratic. It allows people to present their visions of the site, and for others to show their agreement or disagreement, and contributions can be just as important - if not more - than posts on Main.&lt;/p&gt;&#xA;&lt;p&gt;This category is to reward Meta posts that have had a non-trivial or significant impact on the site in some way, and the users who proposed them.&lt;/p&gt;&#xA;" OwnerUserId="108218" LastActivityDate="2023-01-02T19:43:46.027" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25433" PostTypeId="2" ParentId="25424" CreationDate="2023-01-02T20:13:08.580" Score="12" Body="&lt;h2&gt;Wrong tool for the job&lt;/h2&gt;&#xA;&lt;p&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17321/9288&quot;&gt;2018&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24243/91213&quot;&gt;2021&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This category is for an answers that use the worst possible language to accomplish a task, while still making an effort to optimize the score. For example, writing a non-trivial program while using an extremely minimalist language like 7, or an inconvenient language like lost, or even a normal language that's missing some crucial capability like internet connectivity or image processing.&lt;/p&gt;&#xA;&lt;p&gt;Answers for this category should consider both the difficulty of the task and the unsuitable-ness of the language.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2023-01-02T20:13:08.580" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25434" PostTypeId="2" ParentId="25421" CreationDate="2023-01-02T22:33:30.593" Score="10" Body="&lt;h2&gt;Answers invalidated through external circumstances should not be deleted as invalid, but should be clearly marked as no longer working&lt;/h2&gt;&#xA;&lt;h3&gt;That said, they should be encouraged to be updated to be fully valid.&lt;/h3&gt;&#xA;&lt;p&gt;I think this is the most fair way to approach such answers. As indicated in the question, I don't fully believe that answers invalidated through changes entirely out of their control should be deleted. That said, such answers &lt;em&gt;don't&lt;/em&gt; complete the challenge as written, and we have a rule that invalid answers should be removed from the site.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, I believe the best compromise here is to leave these answers undeleted, but clearly indicate (through an edit, ideally, but at least with a comment) that they have since been invalidated due to something changing, as well as leave a comment informing that answerer that their answer should be updated.&lt;/p&gt;&#xA;&lt;p&gt;For the specific challenge linked, especially given the sheer number of &amp;quot;invalidated&amp;quot; answers, I think that editing in a note into the challenge body and encouraging each answer in a comment to update their answer is the appropriate course of action.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2023-01-02T22:33:30.593" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25435" PostTypeId="2" ParentId="25421" CreationDate="2023-01-02T23:11:18.817" Score="-1" Body="&lt;h1&gt;Depends on the external circumstance&lt;/h1&gt;&#xA;&lt;p&gt;There are two different types of external circumstances here: reasonably predictable and seriously problematic.&lt;/p&gt;&#xA;&lt;p&gt;A &lt;strong&gt;reasonably predictable&lt;/strong&gt; external circumstance would be a custom domain registered by a single code-golf user expiring/one day falling out of registration. In this example, an individual can't be expected to host a single domain forever, because people move on, forget things exist or simply decide that it's no longer worth the investment. If such an external circumstance were to arise, then that's on the answerers for utilising something that kinda sorta resembles the loophole disallowing creating a language just for the challenge. These posts should be given a chance to fix the answer based on new information and then handled as any invalid answer would be.&lt;/p&gt;&#xA;&lt;p&gt;A &lt;strong&gt;seriously problematic&lt;/strong&gt; external circumstance is like the case of a major service like google or imgur going down, or an otherwise reliable service being shutdown. In these cases, either there'll be dedicated teams of software engineers working on restoring these services (or providing an alternative that can be used, in which case, answers should be handled like normal invalid answers and given a chance to update their answer), or the question will need to be looked at to see why a lot of answers refer to a now invalid source. In the example of the strawpoll question, it'll need to be closed (and possibly locked), as it can no longer be objectively answered.&lt;/p&gt;&#xA;&lt;p&gt;Basically, reasonably predictable external circumstances should be treated as regular invalid answers, while seriously problematic external circumstances need further attention.&lt;/p&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2023-01-02T23:11:18.817" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25436" PostTypeId="2" ParentId="25424" CreationDate="2023-01-03T05:48:45.790" Score="7" Body="&lt;h1&gt;Kansas City Shuffle&lt;/h1&gt;&#xA;&lt;p&gt;Reposted from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24281/66833&quot;&gt;2021&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17324/66833&quot;&gt;2018&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14538/66833&quot;&gt;2017&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10948/66833&quot;&gt;2016&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Too often, someone devises a particularly golfy method of solving a challenge, which most people will use that method for their answers. This award goes to those answers that utilize an alternative method as a better solution than the method that the majority of other answers use (prior to the posting of the rewarded answer).&lt;/p&gt;&#xA;" OwnerUserId="9288" LastActivityDate="2023-01-03T05:48:45.790" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25437" PostTypeId="2" ParentId="25424" CreationDate="2023-01-03T07:20:37.050" Score="10" Body="&lt;h1&gt;Most diverse challenge&lt;/h1&gt;&#xA;&lt;p&gt;meta: title&lt;/p&gt;&#xA;&lt;p&gt;Often, there is one real algorithm to solve a challenge that is competetive. Maybe very esoteric or specialized languages need a different approach, but mostly, every answer is just a translation of the others.&lt;/p&gt;&#xA;&lt;p&gt;This award is for challenges with no clear single approach where very different algorithms can be competitive. These are the most fun to solve, since you can't just translate other answers but need to carefully consider which approach to take, or even to invent a new one.&lt;/p&gt;&#xA;&lt;p&gt;This prize is intended specifically for:&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Challenges&lt;/em&gt; where:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are either many approaches or just a few that are very different&lt;/li&gt;&#xA;&lt;li&gt;All of which are competitive&lt;/li&gt;&#xA;&lt;li&gt;Even in the same/similar languages&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="56656" LastEditDate="2023-01-10T18:01:18.403" LastActivityDate="2023-01-10T18:01:18.403" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25439" PostTypeId="2" ParentId="25424" CreationDate="2023-01-03T08:36:41.023" Score="11" Body="&lt;h1&gt;Slowest Gun in the East&lt;/h1&gt;&#xA;&lt;p&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24230/52210&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17320/52210&quot;&gt;2018&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14521/52210&quot;&gt;2017&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10988/52210&quot;&gt;2016&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Too often, late answers are overlooked, and end up with fewer upvotes than answers posted immediately after the challenge is posted. This category is aimed to reward impressive answers posted a while after the challenge was originally posted and that went unappreciated, compared to the FGITW answers.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1692961/2022-slowest-gun-in-the-east-with-delay-in-days&quot; rel=&quot;nofollow noreferrer&quot;&gt;SGITE 2022 query.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="52210" LastActivityDate="2023-01-03T08:36:41.023" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25440" PostTypeId="2" ParentId="25424" CreationDate="2023-01-03T17:50:45.893" Score="9" Body="&lt;h1&gt;Best tip&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24233/92689&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20616&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18429/best-of-ppcg-2019-call-for-categories/18469#18469&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14523/66833&quot;&gt;2017&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10939/66833&quot;&gt;2016&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;For the best answer to a question tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt;, because this site isn't just about competing with one another, but also about helping each other improve our golfing skills.&lt;/p&gt;&#xA;" OwnerUserId="92689" LastActivityDate="2023-01-03T17:50:45.893" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25442" PostTypeId="1" CreationDate="2023-01-04T20:51:43.653" Score="8" ViewCount="353" Body="&lt;p&gt;In accordance with &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19271/reviving-language-of-the-month-pick-up-where-we-left-off-or-start-over&quot;&gt;our meta agreement&lt;/a&gt;, since one candidate received more votes than the others, we have a new featured language! Throughout January 2023, our Language of the Month will be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Elm&lt;/h1&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;What's a Language of the Month?&lt;/h2&gt;&#xA;&lt;p&gt;See the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19279/nominations-for-language-of-the-month-take-2?answertab=scoredesc#tab-top&quot;&gt;meta post for nominations&lt;/a&gt;. In short, during January, those who wish to participate should learn (at least the basics of) Elm, and use it to solve challenges. Participation is completely optional, but is anticipated to be fun!&lt;/p&gt;&#xA;&lt;h2&gt;Information about Elm&lt;/h2&gt;&#xA;&lt;p&gt;Elm is a purely functional programming language for the browser.&lt;/p&gt;&#xA;&lt;p&gt;It's very similar to Haskell but is designed to be easy for Javascript programmers to pick up. Elm is very beginner friendly.  Compared to Haskell it has useful error messages, simpler types, and no monads.  Compared to Javascript, it has useful types, fewer gotcha's, and is overall leaner.&lt;/p&gt;&#xA;&lt;p&gt;You can certainly learn Elm enough to get started in an afternoon.  If you aren't already into Haskell it offers an easy way to experience a new way to program.  With it as the language of the month you can learn with the help of others new to the language and those more experienced.&lt;/p&gt;&#xA;&lt;p&gt;If you are into Haskell and FP, it has a number of important distinctions from Haskell that I think make it interesting.  It has a rather different base library and a different approach to libraries all together.  Elm is a lot more minimalist than Haskell forcing you to use a few tools well.&lt;/p&gt;&#xA;&lt;p&gt;Haskell golfers, and people who are interested in golfing in Haskell should find Elm as an excellent opportunity.&lt;/p&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://elm-lang.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Website&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://guide.elm-lang.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Introduction to Elm&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://elm-lang.org/try&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try Elm!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://package.elm-lang.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Package docs&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/66515/of-monads-and-men&quot;&gt;Chat&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://ellie-app.com/new&quot; rel=&quot;nofollow noreferrer&quot;&gt;Ellie (Online Interpreter)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Feel free to ping @WheatWizard in chat if you have questions.&lt;/p&gt;&#xA;&lt;h1&gt;Bounty&lt;/h1&gt;&#xA;&lt;p&gt;I @WheatWizard am offering 50 reputation to each user's first submission in Elm. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25453/&quot;&gt;Indefinite bounty link&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="114446" LastEditDate="2023-01-23T17:27:58.123" LastActivityDate="2023-01-29T16:55:40.313" Title="Language of the Month for January 2023: Elm" Tags="|discussion|language-of-the-month|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25443" PostTypeId="2" ParentId="25442" CreationDate="2023-01-04T20:51:43.653" Score="3" Body="&lt;h1&gt;List of all Elm answers posted in January 2023&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/132002/multiply-a-string-by-a-number/256437#256437&quot;&gt;Multiply a string by a number!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/64315/d/256439#256439&quot;&gt;Separate a list into even-indexed and odd-indexed parts&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/&quot;&gt;Wheat Wizard&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/60610/d/256440#256440&quot;&gt;Non-Unique/Duplicate Elements&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/&quot;&gt;Wheat Wizard&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/256441/d/256478#256478&quot;&gt;Remove duplicates from my academic transcript&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/230145/d/256539#256539&quot;&gt;Implement a cleave function&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/&quot;&gt;alephalpha&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/102219/binary-to-decimal-converter/256541#256541&quot;&gt;Binary to decimal converter&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/146402/d/256571#256571&quot;&gt;Count the changes in an array&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/&quot;&gt;Wheat Wizard&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/256411/division-between-two-strings/256623#256623&quot;&gt;Division between two strings&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/225085/apply-at-indices/256640#256640&quot;&gt;Apply at indices&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/31957/conor-obrien&quot;&gt;Conor O'Brien&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/165954/equal-numbers-in-sub-array/256998#256998&quot;&gt;Equal numbers in sub-array&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78274/kirill-l&quot;&gt;Kirill L.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/128417/trim-the-array/257173#257173&quot;&gt;Trim the array!&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78274/kirill-l&quot;&gt;Kirill L.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/199290/reversed-iotas/257203#257203&quot;&gt;Reversed Iota&amp;#39;s&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78274/kirill-l&quot;&gt;Kirill L.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant tips posted in January 2023&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;tip summary&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;List of relevant challenges posted in January 2023&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;em&gt;add entries in the form:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;lt;challenge title&amp;gt;](https://codegolf.stackexchange.com/a/&amp;lt;answer-ID&amp;gt;) by [username](https://codegolf.stackexchange.com/users/&amp;lt;user-ID&amp;gt;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="78274" LastEditDate="2023-01-29T16:55:40.313" LastActivityDate="2023-01-29T16:55:40.313" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25444" PostTypeId="2" ParentId="25424" CreationDate="2023-01-05T13:01:47.333" Score="5" Body="&lt;h1&gt;Most improved answer&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24287/56656&quot;&gt;2021&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This category is to reward the continued work users put into answers long after they have been posted.  After the FGITW effect has dissipated there stops being so much incentive to work on an old answer, but some users put in the effort and really make it shine.  The ideal answer here would be one that demonstrates a significant commitment to improvement regardless of the quality of the initial answer.  This could be improving the score, or the explanation or both.&lt;/p&gt;&#xA;&lt;p&gt;Answers in this category don't have to have been initially posted in 2022 but the improvements have to have been made over the course of the year.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2023-01-05T13:01:47.333" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25445" PostTypeId="2" ParentId="2140" CreationDate="2023-01-05T16:12:10.633" Score="1" Body="&lt;h1&gt;Calculate the McCombination&lt;/h1&gt;&#xA;&lt;p&gt;In 2002, McDonald's advertised a McChoice menu of 8 items, labelled with &amp;quot;40,312 combinations.&amp;quot; However, this number is far greater than the actual number of combinations (255; 2^8=256, minus 1 for empty meal). What the McDonald's marketing team calculated was how many different ways you could &lt;em&gt;arrange&lt;/em&gt; a meal containing all 8 items (8! = 40,320), but subtracted 8 from the total to remove 1-item combinations. Since their original calculation was incorrect, the final result is meaningless.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://oeis.org/A005096&quot; rel=&quot;nofollow noreferrer&quot;&gt;McCombination&lt;/a&gt; of a number &lt;code&gt;n&lt;/code&gt; is the factorial of &lt;code&gt;n&lt;/code&gt;, minus &lt;code&gt;n&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Task:&lt;/h2&gt;&#xA;&lt;p&gt;Given an integer greater than 0 as input, output the McCombination of that number.&lt;/p&gt;&#xA;&lt;h3&gt;Test cases:&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;8 -&amp;gt; 40312&#xA;4 -&amp;gt; 20&#xA;9 -&amp;gt; 362871&#xA;3 -&amp;gt; 3&#xA;1 -&amp;gt; 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="108687" LastEditorUserId="108218" LastEditDate="2023-01-05T16:48:56.807" LastActivityDate="2023-01-05T16:48:56.807" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="25446" PostTypeId="2" ParentId="25424" CreationDate="2023-01-05T16:16:01.637" Score="1" Body="&lt;h1&gt;Most involvement in an answer/answers&lt;/h1&gt;&#xA;&lt;p&gt;Repost of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18435/95792&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24319/107299&quot;&gt;2021&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For an answer or multiple answers where multiple people were involved. This could be multiple people helping out a user on a single answer, or a back-and-forth between two or more answers trying to outgolf each other.&lt;/p&gt;&#xA;" OwnerUserId="107299" LastActivityDate="2023-01-05T16:16:01.637" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25447" PostTypeId="2" ParentId="2140" CreationDate="2023-01-05T16:56:42.090" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257892/rotate-an-image&quot;&gt;Rotate an Image&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2023-02-16T12:23:15.133" LastActivityDate="2023-02-16T12:23:15.133" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25448" PostTypeId="2" ParentId="2140" CreationDate="2023-01-05T17:22:42.790" Score="4" Body="&lt;h1&gt;Is it a Shift matrix?&lt;/h1&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/256822/is-this-a-shift-matrix&quot;&gt;Posted here&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="96037" LastEditorUserId="96037" LastEditDate="2023-01-18T14:01:02.620" LastActivityDate="2023-01-18T14:01:02.620" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25449" PostTypeId="2" ParentId="2140" CreationDate="2023-01-05T18:48:45.957" Score="-1" Body="&lt;h1&gt;Character Values Quine&lt;/h1&gt;&#xA;&lt;p&gt;Write a program that prints out a sequence of integer values corresponding to the character codes in the source code.&lt;/p&gt;&#xA;&lt;p&gt;For example, the program:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;print(&amp;quot;Hello, World!&amp;quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;has a valid corresponding integer sequence of:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;112 114 105 110 116 40 34 72 101 108 108 111 44 32 87 111 114 108 100 33 34 41&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may use a non-numerical sequence delimiter of your choice.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;strong&gt;order of values&lt;/strong&gt; in the sequence must be maintained for this challenge.&lt;/li&gt;&#xA;&lt;li&gt;The integers may be in &lt;strong&gt;any numerical base&lt;/strong&gt; with a radix of 2 or larger. (binary or up). All the integers must have the same base.&lt;/li&gt;&#xA;&lt;li&gt;Code comments are permitted.&lt;/li&gt;&#xA;&lt;li&gt;The program may not read from its own source code.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes apply.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest-length solution wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h6&gt;__&lt;/h6&gt;&#xA;&lt;p&gt;My first question, so please let me know what could/should be changed. Thanks!&lt;/p&gt;&#xA;" OwnerUserId="113582" LastEditorUserId="113582" LastEditDate="2023-01-05T19:18:08.010" LastActivityDate="2023-01-05T19:18:08.010" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="25450" PostTypeId="2" ParentId="2140" CreationDate="2023-01-06T18:26:24.583" Score="-4" Body="&lt;p&gt;Write a proper quine.&lt;/p&gt;&#xA;&lt;p&gt;Community decided that you're not allowed to claim you're not reading source code but data, and read a stored string.&lt;/p&gt;&#xA;&lt;p&gt;To be consistent, reading a stored infinite precision number is also not allowed. (should this, or only apply to highbase?)&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2023-01-19T02:22:41.760" LastActivityDate="2023-01-19T02:22:41.760" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25451" PostTypeId="2" ParentId="2447" CreationDate="2023-01-07T13:45:46.937" Score="4" Body="&lt;h1&gt;When taking a set, one can take a map from the set to an well agreed value&lt;/h1&gt;&#xA;&lt;p&gt;This allows some languages to easier check if element in a set with mapped value &lt;code&gt;true&lt;/code&gt;: &lt;code&gt;X[i]&lt;/code&gt; is shorter than &lt;code&gt;X.contains(i)&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2023-01-07T13:45:46.937" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25452" PostTypeId="2" ParentId="2447" CreationDate="2023-01-07T13:48:37.377" Score="7" Body="&lt;h1&gt;When returning a set, one can return a map, where values are ignored&lt;/h1&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2023-01-07T13:48:37.377" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25453" PostTypeId="2" ParentId="5243" CreationDate="2023-01-07T18:56:45.770" Score="6" Body="&lt;h1&gt;50 reputation for first answers in FP languages&lt;/h1&gt;&#xA;&lt;p&gt;I find golfing in functional programming languages, and I'd like to get more people involved to make it more competitive.&#xA;Therefor I am offering 50 reputation for each user's first answer in:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Haskell&lt;/li&gt;&#xA;&lt;li&gt;Curry&lt;/li&gt;&#xA;&lt;li&gt;Elm&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may claim all 3 bounties.&lt;/p&gt;&#xA;&lt;p&gt;In order to be eligible the following criteria should be met:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You don't have any answers in the language prior to this bounty. (The point is to encourage newcomers)&lt;/li&gt;&#xA;&lt;li&gt;You haven't claimed a bounty here in this language previously.&lt;/li&gt;&#xA;&lt;li&gt;The answer is sufficiently novel. If it is the first FP language submission to the challenge or if it out-golfs an existing answer in the same language that suffices.  If for example you simply port the existing Haskell answer to Curry by changing the pattern matching, that doesn't count.  Cases in between I will judge on a case-by-case basis.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Edit the list below to claim the bounty:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;[username]: [challenge name](answer link) in Lang1, [challenge name](answer link) in Lang2&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2023-01-07T18:56:45.770" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25454" PostTypeId="2" ParentId="2140" CreationDate="2023-01-07T19:24:52.910" Score="-2" Body="&lt;h1&gt;ABACABA pattern without recursion&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/ABACABA_pattern&quot; rel=&quot;nofollow noreferrer&quot;&gt;ABACABA pattern on Wikipedia&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Taking a number &lt;code&gt;n&lt;/code&gt; as input, generate the ABACABA pattern with &lt;code&gt;n&lt;/code&gt; symbols as stated in the above page, without using any form of recursion in your code. You can use any output method; characters, a list of numbers, an image, whatever is possible.&lt;/p&gt;&#xA;&lt;p&gt;If taking input is not possible in your programming language, output the pattern forever. E.g.: &lt;code&gt;ABACABADABACABAE...&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;input =&amp;gt; output&#xA;&#xA;1 =&amp;gt; A / 1&#xA;2 =&amp;gt; ABA / 1, 2, 1&#xA;3 =&amp;gt; ABACABA / 1, 2, 1, 3, 1, 2, 1&#xA;4 =&amp;gt; ABACABADABACABA / 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1&#xA;5 =&amp;gt; ABACABADABACABAEABACABADABACABA / 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 5, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1&#xA;&lt;span class=&quot;math-container&quot;&gt;```&lt;/span&gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="111474" LastActivityDate="2023-01-07T19:24:52.910" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25455" PostTypeId="2" ParentId="25421" CreationDate="2023-01-08T01:23:20.133" Score="-4" Body="&lt;h2&gt;The answers are invalid ex tunc.&lt;/h2&gt;&#xA;&lt;p&gt;Suppose an implementation of a task uses the system clock and fulfills all task’s requirements exactly on 1673141000 seconds &lt;a href=&quot;https://en.wikipedia.org/wiki/Unix_time&quot; rel=&quot;nofollow noreferrer&quot;&gt;UNIX epoch time&lt;/a&gt;.&#xA;Technically speaking the answer is correct, however, since the implementation &lt;em&gt;depends&lt;/em&gt; on it, the system clock is an input.&lt;/p&gt;&#xA;&lt;p&gt;By analogy the utilization of external URL shorteners constitute &lt;em&gt;hidden data&lt;/em&gt;, too.&#xA;If the answer does not produce this data, e. g. an adequate &lt;a href=&quot;https://en.wikipedia.org/wiki/Hosts_(file)&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;/etc/hosts&lt;/code&gt;&lt;/a&gt; or BIND9 configuration entry (and thus contribute to the scoring), it is invalid.&lt;/p&gt;&#xA;" OwnerUserId="94076" LastActivityDate="2023-01-08T01:23:20.133" CommentCount="0" CommunityOwnedDate="2023-01-08T01:23:20.133" ContentLicense="CC BY-SA 4.0" />
  <row Id="25456" PostTypeId="2" ParentId="2140" CreationDate="2023-01-08T06:14:03.780" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/256566/&quot;&gt;Form a subset that is a continuous range&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="76323" LastEditDate="2023-01-10T18:26:43.957" LastActivityDate="2023-01-10T18:26:43.957" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25457" PostTypeId="2" ParentId="1061" CreationDate="2023-01-08T12:23:46.567" Score="-4" Body="&lt;h1&gt;Storing information in type of input&lt;/h1&gt;&#xA;&lt;p&gt;Imagine a language with billions kinds of arrays and you choose one type as input to do the job, which is silly&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2023-01-08T12:23:46.567" CommentCount="6" CommunityOwnedDate="2023-01-08T12:23:46.567" ContentLicense="CC BY-SA 4.0" />
  <row Id="25458" PostTypeId="2" ParentId="19279" CreationDate="2023-01-08T18:00:07.950" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://esolangs.org/wiki/Fish&quot; rel=&quot;nofollow noreferrer&quot;&gt;&amp;gt;&amp;lt;&amp;gt;&lt;/a&gt; (Fish)&lt;/h1&gt;&#xA;&lt;h2&gt;Description&lt;/h2&gt;&#xA;&lt;p&gt;&amp;gt;&amp;lt;&amp;gt;, pronounced &amp;quot;Fish&amp;quot; is a 2d stack-based language created by Harpyon in 2009 that aims to strike the balance between being minimalistic and practical.&lt;/p&gt;&#xA;&lt;h2&gt;Reasons For&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Very easy to learn since it has just a handful of builtins&lt;/li&gt;&#xA;&lt;li&gt;The unique challenge of wrapping your code around itself to try and create a compact box is very fun and also unique&lt;/li&gt;&#xA;&lt;li&gt;The stack based nature means you need to think about problems very differently, so it gives a unique experience.&lt;/li&gt;&#xA;&lt;li&gt;The self-modification possibility also adds a lot of interesting golfing tricks&lt;/li&gt;&#xA;&lt;li&gt;Well specified, plenty of interpreters available.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Cons&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;May be a bit too popular already? There are 15 people on this site with 10+ answers in this language. Still I think a lot more people are available to be &amp;quot;converted&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;Because of the esoteric nature even easy problems are quite hard in this language. Most questions on this site that are simple enough for a beginner to answer are already answered.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://esolangs.org/wiki/Fish&quot; rel=&quot;nofollow noreferrer&quot;&gt;Esolangs.org&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/47035/91213&quot;&gt;Tips page&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-01-09T07:55:33.787" LastActivityDate="2023-01-09T07:55:33.787" CommentCount="0" CommunityOwnedDate="2023-01-08T18:00:07.950" ContentLicense="CC BY-SA 4.0" />
  <row Id="25459" PostTypeId="2" ParentId="2140" CreationDate="2023-01-08T22:00:01.160" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/256502/guess-the-song-title&quot;&gt;Guess the song title&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;string-container&quot;&gt;string&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108687" LastEditorUserId="108687" LastEditDate="2023-01-09T01:54:49.540" LastActivityDate="2023-01-09T01:54:49.540" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25460" PostTypeId="2" ParentId="25424" CreationDate="2023-01-09T07:54:53.873" Score="3" Body="&lt;h1&gt;Most helpful Sandbox commenter&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24328/55372&quot;&gt;2021&lt;/a&gt;&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/66833&quot;&gt;Sandbox&lt;/a&gt; is a very useful tool to help improve people's challenges, and functions best when users provide helpful advice and feedback on the drafts.&lt;/p&gt;&#xA;&lt;p&gt;This category should reward the users who helped the most in the Sandbox during 2022.&lt;/p&gt;&#xA;" OwnerUserId="55372" LastActivityDate="2023-01-09T07:54:53.873" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25461" PostTypeId="2" ParentId="2140" CreationDate="2023-01-09T14:45:00.833" Score="2" Body="&lt;h1&gt;Find the first run of numbers summing to &lt;code&gt;n&lt;/code&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/subsequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;subsequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;subsequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;subsequence-container&quot;&gt;subsequence&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;number-container&quot;&gt;number&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Given as input a number &lt;code&gt;n&lt;/code&gt; and a sequence of digits &lt;code&gt;0-9&lt;/code&gt; (which may be taken as a string or a list), find the first contiguous subsequence of digits in the sequence that sums to &lt;code&gt;n&lt;/code&gt; and output the start and end indexes. You may use zero- or one-based indexing. If no such subsequence exists, your program may output any &lt;em&gt;constant&lt;/em&gt; value.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;These examples use zero-based indexing.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input: 10 123456789&#xA;Output: 0 3&#xA;Input: 32 444444444&#xA;Output: 0 7&#xA;Input: 33 444444444&#xA;Output: No solutions&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="108218" LastEditorUserId="108218" LastEditDate="2023-01-10T13:13:18.727" LastActivityDate="2023-01-10T13:13:18.727" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25462" PostTypeId="2" ParentId="25424" CreationDate="2023-01-09T16:38:37.393" Score="6" Body="&lt;h1&gt;Best non-text answer&lt;/h1&gt;&#xA;&lt;p&gt;There are a few &amp;quot;languages&amp;quot; here that are allowed to compete, but do not have a textual representation in their native form. Examples are &lt;a href=&quot;https://www.dangermouse.net/esoteric/piet.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Piet&lt;/a&gt;, &lt;a href=&quot;https://scratch.mit.edu/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Scratch&lt;/a&gt;, &lt;a href=&quot;https://powdertoy.co.uk/&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Powder Toy&lt;/a&gt;, and even &lt;a href=&quot;https://minecraft-archive.fandom.com/wiki/Redstone_Circuits&quot; rel=&quot;nofollow noreferrer&quot;&gt;Minecraft redstone&lt;/a&gt;. For most (all?) of these, we have found ways to convert them to the byte-based representation we all know and love. For the above, respectively, they are &lt;a href=&quot;https://github.com/dloscutoff/ascii-piet&quot; rel=&quot;nofollow noreferrer&quot;&gt;ASCII-Piet&lt;/a&gt;, &lt;a href=&quot;https://scratchblocks.github.io&quot; rel=&quot;nofollow noreferrer&quot;&gt;scratchblocks&lt;/a&gt; , &lt;a href=&quot;https://codegolf.stackexchange.com/a/155079&quot;&gt;TPT save files&lt;/a&gt;, and &lt;a href=&quot;https://minecraft.fandom.com/wiki/Structure_Block_file_format&quot; rel=&quot;nofollow noreferrer&quot;&gt;structure files&lt;/a&gt;. This prize will go to the best answer in a language that does not have a textual representation natively.&lt;/p&gt;&#xA;" OwnerUserId="107299" LastEditorUserId="107299" LastEditDate="2023-01-09T18:15:36.253" LastActivityDate="2023-01-09T18:15:36.253" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25463" PostTypeId="2" ParentId="2140" CreationDate="2023-01-09T20:50:16.767" Score="1" Body="&lt;h1&gt;Division between two strings&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/125470/&quot;&gt;Inverse function of this challenge&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;To multiply two strings, you take two strings and compare each character. The character with the highest code point is then added to the output. If they are equal, simply add the character to the output.&lt;SUP&gt;1&lt;/SUP&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Given an input and the output, provide a random&lt;sup&gt;2&lt;/sup&gt; input such that multiplying the two inputs returns the output. Each possible input should be possibly generated. If there's no possible input, output nothing or something that isn't a string(crashing is fine, but not infinite loop)&lt;sup&gt;2&lt;/sup&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;1 I know it's not a &lt;code&gt;multiply&lt;/code&gt; but that's copyed as-is&lt;/sup&gt;&#xA;&lt;br&gt;&#xA;&lt;sup&gt;2 Otherwise a cat solves the question&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2023-01-09T20:50:16.767" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25464" PostTypeId="2" ParentId="2140" CreationDate="2023-01-10T05:40:06.797" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/256674/implement-a-bag-without-replacement&quot;&gt;Implement a bag without replacement&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/data-structures&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;data-structures&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;data-structures&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;data-structures-container&quot;&gt;data-structures&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;random-container&quot;&gt;random&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2023-01-13T14:17:53.737" LastActivityDate="2023-01-13T14:17:53.737" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25465" PostTypeId="2" ParentId="2140" CreationDate="2023-01-10T08:36:02.107" Score="2" Body="&lt;h1&gt;Estimate the world population, at 5 different levels of accuracy &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-challenge-container&quot;&gt;code-challenge&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Your goal is, given a year between 1952 and 2020 to output the world population in that year. However, you must write 5 different expressions. Each program must contain the previous as a substring.&lt;/p&gt;&#xA;&lt;p&gt;Your first program is 5 bytes, the second 10, then 20, 40 finally a program or function with a maximums size of 80 bytes. Each expression &lt;em&gt;must contain&lt;/em&gt; the previous expression as a substring.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;For the purpose of this challenge, snippets that take input from global variables are allowed&lt;/strong&gt;, for all programs except the last. which must be either a complete program or a function.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;For each year, your score is the product of the proportional square error. In other words:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$\frac{(X_0 - V)^2 \cdot (X_1 - V)^2 \cdot (X_2 - V)^2 \cdot(X_3 - V)^2 \cdot (X_4 - V)^2}{V^{10}}$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Where X&lt;sub&gt;n&lt;/sub&gt; is the estimate your nth program outputs and V is the true population at that year. Your total score is sum of the score of each year.&lt;/p&gt;&#xA;&lt;p&gt;Lower score is better.&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;Python, Score &lt;span class=&quot;math-container&quot;&gt;\$7.503\cdot10^{59}\$&lt;/span&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Note the numbers here are absolute nonsense, I hope most submissions will have a score that can be written in the title without needing scientific notation&lt;/p&gt;&#xA;&lt;p&gt;5 byte solution:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;413e7&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;10 byte solution&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;413e7+x**2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;20 byte solution&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;413e7+x**2.46*4.321&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;40 byte solution&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0*413e7+x**2.46*4.321+x**3.718232*8.3e9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;80 byte solution&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;lambda x:0.010*413e7+x**2.46*4.321+x**3.718232*8.3e9+__import__(&amp;quot;math&amp;quot;).sin(x/2)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Data&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Year&lt;/th&gt;&#xA;&lt;th&gt;Population&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2020&lt;/td&gt;&#xA;&lt;td&gt;7,794,798,739&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2019&lt;/td&gt;&#xA;&lt;td&gt;7,713,468,100&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2018&lt;/td&gt;&#xA;&lt;td&gt;7,631,091,040&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2017&lt;/td&gt;&#xA;&lt;td&gt;7,547,858,925&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2016&lt;/td&gt;&#xA;&lt;td&gt;7,464,022,049&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2015&lt;/td&gt;&#xA;&lt;td&gt;7,379,797,139&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2014&lt;/td&gt;&#xA;&lt;td&gt;7,295,290,765&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2013&lt;/td&gt;&#xA;&lt;td&gt;7,210,581,976&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2012&lt;/td&gt;&#xA;&lt;td&gt;7,125,828,059&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2011&lt;/td&gt;&#xA;&lt;td&gt;7,041,194,301&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2010&lt;/td&gt;&#xA;&lt;td&gt;6,956,823,603&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2009&lt;/td&gt;&#xA;&lt;td&gt;6,872,767,093&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2008&lt;/td&gt;&#xA;&lt;td&gt;6,789,088,686&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2007&lt;/td&gt;&#xA;&lt;td&gt;6,705,946,610&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2006&lt;/td&gt;&#xA;&lt;td&gt;6,623,517,833&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2005&lt;/td&gt;&#xA;&lt;td&gt;6,541,907,027&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2004&lt;/td&gt;&#xA;&lt;td&gt;6,461,159,389&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2003&lt;/td&gt;&#xA;&lt;td&gt;6,381,185,114&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2002&lt;/td&gt;&#xA;&lt;td&gt;6,301,773,188&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2001&lt;/td&gt;&#xA;&lt;td&gt;6,222,626,606&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2000&lt;/td&gt;&#xA;&lt;td&gt;6,143,493,823&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1999&lt;/td&gt;&#xA;&lt;td&gt;6,064,239,055&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1998&lt;/td&gt;&#xA;&lt;td&gt;5,984,793,942&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1997&lt;/td&gt;&#xA;&lt;td&gt;5,905,045,788&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1996&lt;/td&gt;&#xA;&lt;td&gt;5,824,891,951&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1995&lt;/td&gt;&#xA;&lt;td&gt;5,744,212,979&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1994&lt;/td&gt;&#xA;&lt;td&gt;5,663,150,427&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1993&lt;/td&gt;&#xA;&lt;td&gt;5,581,597,546&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1992&lt;/td&gt;&#xA;&lt;td&gt;5,498,919,809&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1991&lt;/td&gt;&#xA;&lt;td&gt;5,414,289,444&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1990&lt;/td&gt;&#xA;&lt;td&gt;5,327,231,061&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1989&lt;/td&gt;&#xA;&lt;td&gt;5,237,441,558&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1988&lt;/td&gt;&#xA;&lt;td&gt;5,145,426,008&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1987&lt;/td&gt;&#xA;&lt;td&gt;5,052,522,147&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1986&lt;/td&gt;&#xA;&lt;td&gt;4,960,567,912&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1985&lt;/td&gt;&#xA;&lt;td&gt;4,870,921,740&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1984&lt;/td&gt;&#xA;&lt;td&gt;4,784,011,621&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1983&lt;/td&gt;&#xA;&lt;td&gt;4,699,569,304&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1982&lt;/td&gt;&#xA;&lt;td&gt;4,617,386,542&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1981&lt;/td&gt;&#xA;&lt;td&gt;4,536,996,762&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1980&lt;/td&gt;&#xA;&lt;td&gt;4,458,003,514&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1979&lt;/td&gt;&#xA;&lt;td&gt;4,380,506,100&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1978&lt;/td&gt;&#xA;&lt;td&gt;4,304,533,501&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1977&lt;/td&gt;&#xA;&lt;td&gt;4,229,506,060&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1976&lt;/td&gt;&#xA;&lt;td&gt;4,154,666,864&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1975&lt;/td&gt;&#xA;&lt;td&gt;4,079,480,606&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1974&lt;/td&gt;&#xA;&lt;td&gt;4,003,794,172&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1973&lt;/td&gt;&#xA;&lt;td&gt;3,927,780,238&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1972&lt;/td&gt;&#xA;&lt;td&gt;3,851,650,245&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1971&lt;/td&gt;&#xA;&lt;td&gt;3,775,759,617&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1970&lt;/td&gt;&#xA;&lt;td&gt;3,700,437,046&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1969&lt;/td&gt;&#xA;&lt;td&gt;3,625,680,627&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1968&lt;/td&gt;&#xA;&lt;td&gt;3,551,599,127&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1967&lt;/td&gt;&#xA;&lt;td&gt;3,478,769,962&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1966&lt;/td&gt;&#xA;&lt;td&gt;3,407,922,630&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1965&lt;/td&gt;&#xA;&lt;td&gt;3,339,583,597&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1964&lt;/td&gt;&#xA;&lt;td&gt;3,273,978,338&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1963&lt;/td&gt;&#xA;&lt;td&gt;3,211,001,009&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1962&lt;/td&gt;&#xA;&lt;td&gt;3,150,420,795&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1961&lt;/td&gt;&#xA;&lt;td&gt;3,091,843,507&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1960&lt;/td&gt;&#xA;&lt;td&gt;3,034,949,748&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1959&lt;/td&gt;&#xA;&lt;td&gt;2,979,576,185&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1958&lt;/td&gt;&#xA;&lt;td&gt;2,925,686,705&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1957&lt;/td&gt;&#xA;&lt;td&gt;2,873,306,090&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1956&lt;/td&gt;&#xA;&lt;td&gt;2,822,443,282&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1955&lt;/td&gt;&#xA;&lt;td&gt;2,773,019,936&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1954&lt;/td&gt;&#xA;&lt;td&gt;2,724,846,741&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1953&lt;/td&gt;&#xA;&lt;td&gt;2,677,608,960&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1952&lt;/td&gt;&#xA;&lt;td&gt;2,630,861,562&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;In JSON format:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-json prettyprint-override&quot;&gt;&lt;code&gt;{2020: 7794798739, 2019: 7713468100, 2018: 7631091040, 2017: 7547858925, 2016: 7464022049, 2015: 7379797139, 2014: 7295290765, 2013: 7210581976, 2012: 7125828059, 2011: 7041194301, 2010: 6956823603, 2009: 6872767093, 2008: 6789088686, 2007: 6705946610, 2006: 6623517833, 2005: 6541907027, 2004: 6461159389, 2003: 6381185114, 2002: 6301773188, 2001: 6222626606, 2000: 6143493823, 1999: 6064239055, 1998: 5984793942, 1997: 5905045788, 1996: 5824891951, 1995: 5744212979, 1994: 5663150427, 1993: 5581597546, 1992: 5498919809, 1991: 5414289444, 1990: 5327231061, 1989: 5237441558, 1988: 5145426008, 1987: 5052522147, 1986: 4960567912, 1985: 4870921740, 1984: 4784011621, 1983: 4699569304, 1982: 4617386542, 1981: 4536996762, 1980: 4458003514, 1979: 4380506100, 1978: 4304533501, 1977: 4229506060, 1976: 4154666864, 1975: 4079480606, 1974: 4003794172, 1973: 3927780238, 1972: 3851650245, 1971: 3775759617, 1970: 3700437046, 1969: 3625680627, 1968: 3551599127, 1967: 3478769962, 1966: 3407922630, 1965: 3339583597, 1964: 3273978338, 1963: 3211001009, 1962: 3150420795, 1961: 3091843507, 1960: 3034949748, 1959: 2979576185, 1958: 2925686705, 1957: 2873306090, 1956: 2822443282, 1955: 2773019936, 1954: 2724846741, 1953: 2677608960, 1952: 2630861562}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-01-12T18:05:17.820" LastActivityDate="2023-01-12T18:05:17.820" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25466" PostTypeId="1" CreationDate="2023-01-10T09:51:54.550" Score="1" ViewCount="73" Body="&lt;p&gt;Say &lt;a href=&quot;https://codegolf.stackexchange.com/questions/256353/&quot;&gt;Round to nicer numbers&lt;/a&gt; where it's possible to always output n'=m. I submitted a Javascript solution that does this.&lt;/p&gt;&#xA;&lt;p&gt;I can require input be &lt;code&gt;f(x,n,[m])&lt;/code&gt; and then it's modifiable, but this doesn't apply for languages like C.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2023-01-10T10:07:31.487" LastActivityDate="2023-01-11T19:06:00.423" Title="Is outputting by modifying an input with no modifying access allowed?" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25468" PostTypeId="2" ParentId="2140" CreationDate="2023-01-10T12:02:01.133" Score="1" Body="&lt;h1&gt;WIP: clarify&lt;/h1&gt;&#xA;&lt;p&gt;Connect WEST and EAST using n pipe.&lt;/p&gt;&#xA;&lt;p&gt;This is an example output, where n=9.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/QldIm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/QldIm.png&quot; alt=&quot;n=9&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;You can make sub-component, which each pin behave an extra pipe. Sub-component cost 2 pipe. Following is n=19. (The sub-component at the center is image above) You can also make sub-component in sub-component, and et infinitum.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/vkQa4.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/vkQa4.png&quot; alt=&quot;n=19&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;It has same cost and behavior as&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/6yl18.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/6yl18.png&quot; alt=&quot;n=19&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Thing change when n=35, where using sub-component only cost 33 pipe:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Ux1Bb.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Ux1Bb.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Now given odd n&amp;gt;8, output the minimum cost to connect WEST and EAST using n pipe.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;9 =&amp;gt; 9&#xA;19 =&amp;gt; 19&#xA;35 =&amp;gt; 33&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2023-01-10T12:02:01.133" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25469" PostTypeId="2" ParentId="25466" CreationDate="2023-01-11T19:06:00.423" Score="1" Body="&lt;h3&gt;This should be considered as &amp;quot;output by modifying an input parameter&amp;quot;&lt;/h3&gt;&#xA;&lt;p&gt;I consider this somewhat borderline, but ended up slightly on the side of allowing it.&lt;/p&gt;&#xA;&lt;p&gt;The challenge you linked requires &amp;quot;output &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;n&lt;/code&gt;&amp;quot; (approximately). The answer you proposed &amp;quot;outputs &lt;code&gt;x&lt;/code&gt; as the return value of the function, outputs &lt;code&gt;n&lt;/code&gt; as the value remaining in &lt;code&gt;m&lt;/code&gt; after the function runs&amp;quot;. This is an entirely normal and permitted way to output. The internal facts of your program not actually modifying &lt;code&gt;m&lt;/code&gt; are irrelevant to whether the answer is valid. I think the internal facts of your language not even allowing you to modify &lt;code&gt;m&lt;/code&gt; are also irrelevant; as long as the user treats &lt;code&gt;m&lt;/code&gt; as an output parameter (i.e. not changing its value somewhere else in the middle of running the function) then the answer successfully ensures that &lt;code&gt;m&lt;/code&gt; contains the correct value after running.&lt;/p&gt;&#xA;" OwnerUserId="71434" LastActivityDate="2023-01-11T19:06:00.423" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25470" PostTypeId="2" ParentId="2447" CreationDate="2023-01-11T20:06:25.303" Score="0" Body="&lt;h1&gt;Program may take one argument as one input and filename of another input&lt;/h1&gt;&#xA;&lt;p&gt;This allows &amp;quot;input two letters, concat them&amp;quot; in bash&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;cat $1; echo $1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20613/76323&quot;&gt;Programs may take input based on their executable name&lt;/a&gt;, your filename should be possible to carry any possible input. If input may contain &lt;code&gt;*&lt;/code&gt; and your filesystem doesn't support it, you can't use this method.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2023-01-11T20:06:25.303" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25472" PostTypeId="2" ParentId="2140" CreationDate="2023-01-13T09:44:35.337" Score="4" Body="&lt;h1&gt;Transpose binary numbers &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;array-container&quot;&gt;array&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;binary&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;binary-container&quot;&gt;binary&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The input numbers &lt;code&gt;[34, 7, 109]&lt;/code&gt; can be represented in binary as&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0100010&#xA;0000111&#xA;1101101&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(one number on each line; and padding with zeroes on the left so that all the rows are the same length)&lt;/p&gt;&#xA;&lt;p&gt;Now transpose this array:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;001&#xA;101&#xA;000&#xA;001&#xA;011&#xA;110&#xA;011&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Then convert each row back to decimal to get the output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1, 5, 0, 1, 3, 6, 3]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is the output.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;todo: write a proper spec&lt;/p&gt;&#xA;&lt;p&gt;Is this a duplicate?&lt;/p&gt;&#xA;&lt;p&gt;Is this interesting?&lt;/p&gt;&#xA;&lt;p&gt;Would this be more interesting if generalised to an input base &lt;code&gt;b&lt;/code&gt;?&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2023-01-13T09:44:35.337" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25473" PostTypeId="2" ParentId="2140" CreationDate="2023-01-14T18:06:48.617" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/256964/114446&quot;&gt;Capture the Flag... with a twist&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="114446" LastEditorUserId="114446" LastEditDate="2023-01-21T18:13:16.497" LastActivityDate="2023-01-21T18:13:16.497" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25474" PostTypeId="2" ParentId="2140" CreationDate="2023-01-15T18:42:30.190" Score="3" Body="&lt;h1&gt;Change the subject &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;string-container&quot;&gt;string&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;array-container&quot;&gt;array&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;sorting-container&quot;&gt;sorting&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/256828/change-the-subject&quot;&gt;Posted here&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="108687" LastEditorUserId="108687" LastEditDate="2023-01-18T15:52:28.813" LastActivityDate="2023-01-18T15:52:28.813" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25475" PostTypeId="2" ParentId="2140" CreationDate="2023-01-16T12:37:01.233" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/256924/108879&quot;&gt;Print the notes of an increasing octave-repeating scale.&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108879" LastEditorUserId="108879" LastEditDate="2023-01-21T09:41:37.663" LastActivityDate="2023-01-21T09:41:37.663" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25476" PostTypeId="2" ParentId="2140" CreationDate="2023-01-16T15:25:48.520" Score="0" Body="&lt;h1&gt;Tell 32-bit from 64-bit with most disallowed bytes&lt;/h1&gt;&#xA;&lt;p&gt;Decide an integer N. Take an array of length N, and output a x86 opcode, which when running, reach different position after leaving the opcode you provided.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No bytes given in input is allowed in your output.&lt;/li&gt;&#xA;&lt;li&gt;You'll be in Ring 3, so some x86 features can't be used.&lt;/li&gt;&#xA;&lt;li&gt;You can destroy all available registers, including XMM, x87, etc.&lt;/li&gt;&#xA;&lt;li&gt;You can assume 4096 bytes of available stack under stack pointer.&lt;/li&gt;&#xA;&lt;li&gt;It's not necessary a &lt;code&gt;jmp&lt;/code&gt;. Other ways to reach different position are fine.&lt;/li&gt;&#xA;&lt;li&gt;The destination should be in 256 bytes before your code or in 256 bytes after your code. &lt;code&gt;jmp .+0xEBEBEBEB&lt;/code&gt; is not allowed unless your output is at least ~336859924 bytes.&lt;/li&gt;&#xA;&lt;li&gt;Each destination should have at least 2 bytes of space to fit a &lt;code&gt;jmp short&lt;/code&gt; instruction.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Here is a possible program with N=0:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;([])=&amp;gt;[0x66, 0x40, 0x3D]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Assuming this program is loaded into 0, then in 32-bit mode, it goes to 7; in 64-bit mode, it goes to 5, both of which have enough space.&lt;/p&gt;&#xA;&lt;p&gt;This is an example with N=1:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;([x])=&amp;gt;x==0x66||x==0x41||x==0x3D?[0x24,0x00,0x40,0x74,0x74]:[0x66,0x41,0x3D]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Largest N wins.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2023-01-17T03:11:16.733" LastActivityDate="2023-01-17T03:11:16.733" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25477" PostTypeId="2" ParentId="2140" CreationDate="2023-01-16T19:02:01.190" Score="2" Body="&lt;h1&gt;Cheat at Chess &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;chess-container&quot;&gt;chess&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;grid-container&quot;&gt;grid&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Inspired by a meme my brother showed me that I cannot find anymore, that looked something like this with the caption &amp;quot;White to play, mate in one:&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://lichess.org/editor/rnb1k2r/pp1ppp1p/1qp2npb/8/1P6/2PP4/PQ2PPPP/RNB1KBNR_w_KQkq_-_0_1?color=white&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/C3KMM.jpg&quot; width=&quot;400&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The image shows the white rook going over several pieces to end up putting the black king in checkmate (&lt;code&gt;Rxh8&lt;/code&gt;). Of course this is not a legal move, but it shows a misunderstanding of chess that I thought could make a fun code challenge.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Given a chess board as input, output the move that puts the king in check, using &lt;a href=&quot;http://en.wikipedia.org/wiki/Algebraic_notation_%28chess%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;algebraic notation&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The move must follow the movement rules for a chess piece, but can ignore any pieces standing in its way.&lt;/p&gt;&#xA;&lt;p&gt;Input format: string matrix or multiline string, each element either empty (empty string, empty matrix element, whatever makes sense) or with a letter - &lt;code&gt;K&lt;/code&gt;: King, &lt;code&gt;Q&lt;/code&gt;: Queen, &lt;code&gt;R&lt;/code&gt;: Rook, &lt;code&gt;B&lt;/code&gt;: Bishop, &lt;code&gt;N&lt;/code&gt;: Knight, or &lt;code&gt;P&lt;/code&gt;: Pawn, uppercase for white and lowercase for black.&lt;/p&gt;&#xA;&lt;p&gt;The input will always be a board that has a valid solution for this. If there are multiple possible solutions, choose any of them.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;r n b - k - - r&#xA;p p - p p p - p&#xA;- q p - - n p b&#xA;- - - - - - - -&#xA;- P - - - - - -    -&amp;gt; Rxh8&#xA;- - P P - - - -&#xA;P Q - - P P P P&#xA;R N B - K B N R&#xA;&#xA;More test cases whenever I have time to make them.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Sandboxing&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should the task be &amp;quot;find the move that causes checkmate&amp;quot; instead of just check? I feel like this might make golfing too difficult though.&lt;/li&gt;&#xA;&lt;li&gt;I haven't had time to work on an implementation for solving this yet, so not sure how hard this will be.&lt;/li&gt;&#xA;&lt;li&gt;Any suggested test cases?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="108687" LastActivityDate="2023-01-16T19:02:01.190" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="25478" PostTypeId="1" CreationDate="2023-01-16T22:39:00.460" Score="14" ViewCount="843" Body="&lt;h3&gt;Final phase&lt;/h3&gt;&#xA;&lt;p&gt;You have chosen the categories and the nominees for CGCC's annual &amp;quot;Best of&amp;quot;. Now it is time to pick the winners!&lt;/p&gt;&#xA;&lt;p&gt;Each of the 16 categories is represented by an answer to this question, and each of these answers contains all nominations by the members of our community.&lt;/p&gt;&#xA;&lt;h3&gt;Voting mechanism&lt;/h3&gt;&#xA;&lt;p&gt;Each nominee has been added as a comment to its category's answer. In each category, the nominee whose comment has the highest number of votes by Feb 21 13:00 UTC will be declared the winner of that category.&lt;/p&gt;&#xA;&lt;h3&gt;Further details&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Starting now, please do &lt;strong&gt;not&lt;/strong&gt; edit the answers.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Please do &lt;strong&gt;not&lt;/strong&gt; add comments to the answers.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Votes on the question and on answers are meaningless; only votes on comments count.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Feel free to vote for multiple nominees of the same category, including your own posts.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2023-02-24T15:31:46.623" LastActivityDate="2023-02-24T15:31:46.623" Title="Best of CGCC 2022 - Voting Now Open!" Tags="|discussion|best-of|" AnswerCount="16" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25479" PostTypeId="2" ParentId="25478" CreationDate="2023-01-16T22:39:00.460" Score="3" Body="&lt;h1&gt;Best mathematical insight&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost of &lt;a href=&quot;/a/24226&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20597/43319&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18442/78410&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17317/78410&quot;&gt;2018&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;On this site we often see answers in languages specifically designed for short code, or designed to be fast. Sometimes, a nice golfing trick or speed-up technique surprises us with its ingenuity, beyond the standard use of that language.&lt;/p&gt;&#xA;&lt;p&gt;And occasionally an answer shows up that uses an unexpected approach to greatly simplify the problem, and makes us wonder how the author could ever think of that. This usually involves some far-from-obvious mathematical equivalence, or a particularly simple approach to the problem that was not evident at all (once revealed, other answers often follow the same approach).&lt;/p&gt;&#xA;&lt;p&gt;This category is for the answer with the best &lt;strong&gt;mathematical&lt;/strong&gt; insight or unexpected approach that led to greatly simplifying the problem, in &lt;strong&gt;any challenge type&lt;/strong&gt; (code golf, fastest code, or others). The insight should have led to a significant improvement according to the challenge's metric (code length, run time, or whatever applicable).&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246026&quot;&gt;Average-ignorant sets of integers&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110449/allxy&quot;&gt;allxy&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by emanresu A (self-nomination-ish)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This answer changed a complex set-building question into a simple base conversion problem, and provided a 4-byte Jelly answer which is still unbeaten. Every answer following this used the same approach, or a variant of it, with most answers porting that answer or the later posted &lt;a href=&quot;https://codegolf.stackexchange.com/a/246031/100664&quot;&gt;python answer&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The answer also includes the thought process of finding that definition, starting from a greedy approach and using OEIS to find alternate definitions.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242660/rolling-a-ball-over-a-list/242700#242700&quot;&gt;Rolling a ball over a list&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/44718/tsh&quot;&gt;tsh&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by alephalpha&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Tsh found a simple and elegant formula for this complex challenge about 1D cellular automata. It was ported by most of the other answers.&lt;/p&gt;&#xA;&lt;p&gt;Tsh did not prove the correctness of the answer. A detailed proof can be found in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/242660/rolling-a-ball-over-a-list/242708#242708&quot;&gt;Jonah's answer&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250261/exponential-transform-of-an-integer-sequence/250262#250262&quot;&gt;Exponential transform of an integer sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/92727/command-master&quot;&gt;Command Master&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by alephalpha&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a purely algebraic challenge about transforming integer sequences. Command Master found a combinatorial interpretation of the problem, and solved it using 05AB1E's list operations. The resulting code did not contain any math operations, but the mathematical insight was really impressive.&lt;/p&gt;&#xA;&lt;p&gt;The answer also includes a detailed explanation and proof.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/248716/91213&quot;&gt;Enumerate the set of all sets&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/97857/pxeger&quot;&gt;Pxeger&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;Nominated by Mousetail&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Enumerating all sets seems like it would take a good amount of code. However, the very first answer finds a very short recursive approach based on converting sets to binary numbers, a very unexpected direction. The explanation is really good too. Basically every answer afterwards copies this approach.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="91213" LastEditDate="2023-02-02T06:51:18.420" LastActivityDate="2023-02-02T06:51:18.420" CommentCount="6" CommunityOwnedDate="2023-01-16T22:39:07.003" ContentLicense="CC BY-SA 4.0" />
  <row Id="25480" PostTypeId="2" ParentId="25478" CreationDate="2023-01-16T22:39:14.987" Score="3" Body="&lt;h2&gt;Wrong tool for the job&lt;/h2&gt;&#xA;&lt;p&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17321/9288&quot;&gt;2018&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24243/91213&quot;&gt;2021&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This category is for an answers that use the worst possible language to accomplish a task, while still making an effort to optimize the score. For example, writing a non-trivial program while using an extremely minimalist language like 7, or an inconvenient language like lost, or even a normal language that's missing some crucial capability like internet connectivity or image processing.&lt;/p&gt;&#xA;&lt;p&gt;Answers for this category should consider both the difficulty of the task and the unsuitable-ness of the language.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247238/100664&quot;&gt;Ungolf my tinylisp code&lt;/a&gt; in tinylisp by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresu A&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;self-nomination&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Lisp_(programming_language)&quot; rel=&quot;nofollow noreferrer&quot;&gt;Lisp&lt;/a&gt; is an elegant language, but it's not at all built for string manipulation. &lt;a href=&quot;https://github.com/dloscutoff/Esolangs/tree/master/tinylisp&quot; rel=&quot;nofollow noreferrer&quot;&gt;tinylisp&lt;/a&gt; is a minimal dialect of Lisp with only seven builtins, and it doesn't even have a proper string datatype. The challenge here is to pretty-print a piece of tinylisp code, requiring extensive string parsing, yet this answer does it &lt;em&gt;in tinylisp&lt;/em&gt;, coming in at only three times the size of the other answers!&lt;/p&gt;&#xA;&lt;p&gt;Additionally, the code is extremely optimised and makes heavy use of tail calls, so it can actually run all the test cases in reasonable time - despite operations like concatenating strings being O(n^2).&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249439/draw-this-fractal-generated-by-applying-newtons-method-to-coshx-1/249500#249500&quot;&gt;Draw this fractal generated by applying Newton's method to cosh(x) - 1&lt;/a&gt; in Desmos by &lt;a href=&quot;https://codegolf.stackexchange.com/a/249500/100664&quot;&gt;MathEnthusiast314&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by emanresu A&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Seeing this challenge, you might think that a graphing calculator like Desmos would be the perfect language. It's really not.&lt;/p&gt;&#xA;&lt;p&gt;While Desmos has easy access to mathematical functions like cosh, the challenge requires iteration and approximation, two things Desmos can't do very easily. Yet despite these limits, the answer comes in at 353 bytes, beating the example Python answer and producing an extremely laggy graph.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247550/52210&quot;&gt;Crossing a Lily Pond&lt;/a&gt; in BitCycle by &lt;a href=&quot;https://codegolf.stackexchange.com/users/111305/des54321&quot;&gt;des54321&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by Kevin Cruijssen&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Although it also fits the &lt;em&gt;Rookie of the Year - Answers&lt;/em&gt; category, since it's one of &lt;em&gt;des54321&lt;/em&gt;'s first answers, I think it better fits here. &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/61139463#61139463&quot;&gt;&lt;em&gt;Aiden Chow&lt;/em&gt; joked in chat&lt;/a&gt; that the input being a string of bits is perfect for BitCycle, but &lt;em&gt;des54321&lt;/em&gt; took this as a challenge and actually did it.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="52210" LastEditDate="2023-02-03T14:44:18.843" LastActivityDate="2023-02-03T14:44:18.843" CommentCount="3" CommunityOwnedDate="2023-01-16T22:39:14.987" ContentLicense="CC BY-SA 4.0" />
  <row Id="25481" PostTypeId="2" ParentId="25478" CreationDate="2023-01-16T22:39:27.883" Score="2" Body="&lt;h1&gt;Slowest Gun in the East&lt;/h1&gt;&#xA;&lt;p&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24230/52210&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17320/52210&quot;&gt;2018&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14521/52210&quot;&gt;2017&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10988/52210&quot;&gt;2016&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Too often, late answers are overlooked, and end up with fewer upvotes than answers posted immediately after the challenge is posted. This category is aimed to reward impressive answers posted a while after the challenge was originally posted and that went unappreciated, compared to the FGITW answers.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1692961/2022-slowest-gun-in-the-east-with-delay-in-days&quot; rel=&quot;nofollow noreferrer&quot;&gt;SGITE 2022 query.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/248543&quot;&gt;Interpret brainfuck&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;self-nomination&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This answer is the slowest of the slowest guns posted in 2022, and is also the longest Vyxal answer I think I've ever written. At 148 bytes long, you would think that Vyxal isn't a golfing language, but the byte count comes from the fact that this brainfuck interpreter doesn't use eval/exec - it manually interprets the esolang. And it takes a very long time too, so not only is it slow in terms of posting, it's slow in terms of execution time!&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/249144&quot;&gt;Print the N-bonacci sequence&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;Wheat Wizard&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;self-nomination&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This gun is indeed slow, it was posted over 3 years after &lt;a href=&quot;https://codegolf.stackexchange.com/a/70522/56656&quot;&gt;xnor's Haskell answer&lt;/a&gt;, which it beats out by 1 byte, but it's not just a cheap trick or an oversight that it uses. The bizarre thing is that in order to solve the problem so golfily, it first solves a harder problem, or at least a more general problem, and uses that solution in two different ways to build the final answer. It's a great example of double use, that is equally capable of making me go &amp;quot;How did I ever even miss this?&amp;quot; and &amp;quot;How did I ever even come up with this?&amp;quot;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="56656" LastEditDate="2023-02-02T16:37:09.183" LastActivityDate="2023-02-02T16:37:09.183" CommentCount="2" CommunityOwnedDate="2023-01-16T22:39:27.883" ContentLicense="CC BY-SA 4.0" />
  <row Id="25482" PostTypeId="2" ParentId="25478" CreationDate="2023-01-16T22:39:52.477" Score="6" Body="&lt;h1&gt;Most diverse challenge&lt;/h1&gt;&#xA;&lt;p&gt;Often, there is one real algorithm to solve a challenge that is competetive. Maybe very esoteric or specialized languages need a different approach, but mostly, every answer is just a translation of the others.&lt;/p&gt;&#xA;&lt;p&gt;This award is for challenges with no clear single approach where very different algorithms can be competitive. These are the most fun to solve, since you can't just translate other answers but need to carefully consider which approach to take, or even to invent a new one.&lt;/p&gt;&#xA;&lt;p&gt;This prize is intended specifically for:&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Challenges&lt;/em&gt; where:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are either many approaches or just a few that are very different&lt;/li&gt;&#xA;&lt;li&gt;All of which are competitive&lt;/li&gt;&#xA;&lt;li&gt;Even in the same/similar languages&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/251351/78410&quot;&gt;The second even sublime number&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler?tab=questions&amp;amp;sort=newest&quot;&gt;Bubbler&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;There are two main approaches (brute-force and hardcode) and, due to the nature of the number in question, it allows quite a few variations on the hardcoded solution. Both hardcode and bruteforce turned out to be competitive in Jelly and Vyxal.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/241633/100664&quot;&gt;Build a list from a depth map&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;Wheat Wizard&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by emanresu A&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;With this challenge there were two main approaches: Manipulating the input as a string, or handling it as a list of nested lists and carefully flattening them. Both were fairly competitive and there were several variations on each.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/246979/derivative-of-a-product/247038#247038&quot;&gt;Derivative of a product&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresu A&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;self-nomination&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;For such a simple string-manipulation challenge, this had multiple fairly competitive approaches:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Individually replacing each character in a string&lt;/li&gt;&#xA;&lt;li&gt;Inserting apostrophes at certain positions&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/247001/100664&quot;&gt;DLosc's group-based approach&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/248820/create-bernard-from-desmos&quot;&gt;Create Bernard from Desmos&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Even though the challenge simply asks to output a straightforward pattern of 0's and 1's, there are a plethora of different strategies that could be implemented. Some answers implemented their solutions based on the procedure described in the challenge, some even copying the procedure step-by-step, while others came up with ingenious tricks with binary and base conversions to make their code even golfier. One amazing answer with an assortment of interesting tricks and tidbits was even written in Desmos, the language/graphing calculator that the challenge was inspired by!&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="96039" LastEditDate="2023-01-31T16:42:38.827" LastActivityDate="2023-01-31T16:42:38.827" CommentCount="4" CommunityOwnedDate="2023-01-16T22:39:52.477" ContentLicense="CC BY-SA 4.0" />
  <row Id="25483" PostTypeId="2" ParentId="25478" CreationDate="2023-01-16T22:40:06.907" Score="2" Body="&lt;h1&gt;Rookie of the Year - Answers&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24235/100664&quot;&gt;2021&lt;/a&gt; and other years.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;For the best answer written by a new user in 2022. This doesn't have to be a user who created their account in 2022 - rather, this is for any answer posted by a user in 2022 where that answer was that user's first answer on the site.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1692861/2022-answers-by-users-with-no-answers-before-2022&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE query&lt;/a&gt; (modified from the 2021 one)&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/250500/&quot;&gt;Fewest (distinct) characters for Turing Completeness&lt;/a&gt;  in Python 3 by &lt;a href=&quot;https://codegolf.stackexchange.com/users/113908/kzh&quot;&gt;kzh&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by emanresu A&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;For a long time, people thought that Python 3 required at least 9 distinct characters to be Turing Complete. This is the user's first and only post, and they found a way to express arbitrary Python with only eight characters. The previous record of &lt;a href=&quot;https://codegolf.stackexchange.com/a/110677/100664&quot;&gt;9 characters&lt;/a&gt; was posted almost six years ago.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246682/100664&quot;&gt;Final tribute to John Conway: FRACTRAN self-interpreter&lt;/a&gt; in Fractran by &lt;a href=&quot;https://codegolf.stackexchange.com/users/89587/benrg&quot;&gt;benrg&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by emanresu A&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://esolangs.org/wiki/fractran&quot; rel=&quot;nofollow noreferrer&quot;&gt;Fractran&lt;/a&gt; is a Turing Tarpit in which the only operation is to attempt to multiply by a fraction, and try the next fraction if the result is not an integer. Despite this, it's Turing Complete, and it halves the pre-challenge record of 48 fractions, beating the next-best answer by 6 fractions.&lt;/p&gt;&#xA;&lt;p&gt;Despite being so short, it offers a thorough explanation of how the program works and how it could be improved.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="100664" LastEditDate="2023-01-23T19:27:16.363" LastActivityDate="2023-01-23T19:27:16.363" CommentCount="2" CommunityOwnedDate="2023-01-16T22:40:06.907" ContentLicense="CC BY-SA 4.0" />
  <row Id="25484" PostTypeId="2" ParentId="25478" CreationDate="2023-01-16T22:40:21.180" Score="4" Body="&lt;h2&gt;Breaking The Mold (Most Original Challenge)&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;Reposted from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24283/108218&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17327/66833&quot;&gt;2018&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;It's really easy to come up with normal &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;ascii-art-container&quot;&gt;ascii-art&lt;/a&gt;, or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;sequence-container&quot;&gt;sequence&lt;/a&gt; challenge, etc. Don't get me wrong, there's nothing wrong with these challenges. They're the meat of the challenges on our site. However, they're not the most imaginative.&lt;/p&gt;&#xA;&lt;p&gt;This category is for a challenge that re-invents the wheel, and explores new ideas that we haven't really used on the site.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Maybe this challenge inspired a new tag, or category of challenges?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Maybe it's a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-challenge-container&quot;&gt;code-challenge&lt;/a&gt; with a unique and very well balanced scoring formula?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Or maybe it's even a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; challenge about a novel task. This category is for rewarding users who came up with interesting ideas that keep the site fresh.&lt;/p&gt;&#xA;&lt;p&gt;Some justification for why the challenge is original is necessary with nominations - 99% of challenges posted on the site shouldn't qualify for this.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/254546/78410&quot;&gt;50 digits of π in HQ0-9+-INCOMPUTABLE?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;We have &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/metagolf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;metagolf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;metagolf-container&quot;&gt;metagolf&lt;/a&gt; challenges already, but the languages in question often have the usual building blocks, such as small constants, arithmetic, and loops (though they can be sometimes extremely minimalistic). I believe this challenge is special in that you only have the weirdest kinds of building blocks instead, and need to figure out some unique ways to approach the desired output. And indeed, some users have found ways to utilize different sets of commands that led to shockingly short solutions.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251161/radiation-hardening-koth&quot;&gt;Radiation Hardening KOTH&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/91213/mousetail&quot;&gt;Mousetail&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This challenge combines many of our favorite generes of this site, KOTH since you want to beat other players, golfing since your bot needs to fit the 255 byte limit and still be sufficiently redundant, radiation hardening to make it resistant against attacks, and even quasi-polyglotting as competitors try to disguise themselves as a different language.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/247975/add-a-hidden-language-to-a-polyglot&quot;&gt;Add a hidden language to a polyglot&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresu A&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;self-nomination&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This challenge combines &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;cops-and-robbers-container&quot;&gt;cops-and-robbers&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;answer-chaining-container&quot;&gt;answer-chaining&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polyglot&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;polyglot&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;polyglot-container&quot;&gt;polyglot&lt;/a&gt; in an interesting combination, where people have to carefully add another language to a polyglot without being too obvious about what that language is. It included some clever solutions, including a &lt;a href=&quot;https://codegolf.stackexchange.com/a/248046/100664&quot;&gt;HQ9+ derivative being useful for once&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/a/250031/100664&quot;&gt;not modifying the code at all&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="100664" LastEditDate="2023-01-27T19:45:31.847" LastActivityDate="2023-01-27T19:45:31.847" CommentCount="3" CommunityOwnedDate="2023-01-16T22:43:18.543" ContentLicense="CC BY-SA 4.0" />
  <row Id="25485" PostTypeId="2" ParentId="25478" CreationDate="2023-01-16T22:40:34.080" Score="0" Body="&lt;h1&gt;Best Explanation&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24248/108218&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20601/66833&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18451/66833&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17315/66833&quot;&gt;2018&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14512/66833&quot;&gt;2017&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10940/66833&quot;&gt;2016&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This category is for the answer with the best explanation accompanying it. Ideally, the winner will be an answer with a very detailed explanation that is accessible to anyone, regardless of the amount of relevant knowledge already possessed.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/248543&quot;&gt;Interpret brainfuck&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;self-nomination&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Usually, golfing language answers are written in the traditional &amp;quot;token-by-token&amp;quot; explanation format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;program&#xA;pr       # comment&#xA;  ogr    # comment&#xA;     am  # comment     &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is good for when a program is just &amp;quot;apply this function, then that function, then another&amp;quot;, but not when it's as complex as a non-eval brainfuck interpreter.&lt;/p&gt;&#xA;&lt;p&gt;That's why there's a 34 paragraph (paragraph here being defined as english description + code snippet) explanation of how commands are handled, and the tricks used to shave bytes off the answer. For example:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;If the command &lt;em&gt;is&lt;/em&gt; one of &lt;code&gt;+&lt;/code&gt; or &lt;code&gt;-&lt;/code&gt;, then the command is duplicated yet again, and its index in the string &lt;code&gt;&amp;quot; +&amp;quot;&lt;/code&gt; is returned. This returns &lt;code&gt;1&lt;/code&gt; for &lt;code&gt;+&lt;/code&gt; and &lt;code&gt;-1&lt;/code&gt; for &lt;code&gt;-&lt;/code&gt;, as &lt;code&gt;-1&lt;/code&gt; is returned for characters not in the string. The &lt;code&gt;1&lt;/code&gt; or &lt;code&gt;-1&lt;/code&gt; acts as an offset for the current cell, and saves having to check for &lt;code&gt;+&lt;/code&gt; and &lt;code&gt;-&lt;/code&gt; individually. It also means &lt;code&gt;+&lt;/code&gt; can be used for both commands instead of &lt;code&gt;›&lt;/code&gt; for addition and &lt;code&gt;‹&lt;/code&gt; for subtraction.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This gives an insight into the fact that instead of doing something like:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;if command = &amp;quot;+&amp;quot;: current_cell++&#xA;else if command = &amp;quot;-&amp;quot;: current_cell--&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;this can be done instead:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;current_cell += {&amp;quot;-&amp;quot;:-1,&amp;quot;+&amp;quot;:1}[command]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249026/check-a-mushroom-forest/249131#249131&quot;&gt;Check a mushroom forest&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Usually my Desmos answers don't have any explanation, and to a casual viewer, it would look like my answers are just a collection of random and cryptic functions and equations that somehow results in the correct answer. But in this Desmos answer, I took the time to really explain my thought process and what each part of the code does in order to make the Desmos code understandable and accessible to everyone.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/245881/100664&quot;&gt;Print X without X&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresu A&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;self-nomination&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;Yes, I'm aware that I edited in the explanation in 2023. However, I posted the original answer and wrote up the explanation in 2022, so I think this counts.&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;p&gt;After &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24319/100664&quot;&gt;last year's Vyxal fiasco&lt;/a&gt;, I decided to post one more cop, using a different version of Vyxal to all the other ones. Because of this, the solution became way more complicated, with the resulting explanation being over ten kilobytes. It explains how, starting with six builtins, you can progress all the way to executing arbitrary code, explaining every step along the way from generating basic numbers all the way to arbitrary ASCII, and finally to arbitrary Vyxal code - all using only four distinct characters!&lt;/p&gt;&#xA;&lt;p&gt;The resulting program's size is 37 yottabytes.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="100664" LastEditDate="2023-02-01T09:18:51.140" LastActivityDate="2023-02-01T09:18:51.140" CommentCount="3" CommunityOwnedDate="2023-01-16T22:43:18.543" ContentLicense="CC BY-SA 4.0" />
  <row Id="25486" PostTypeId="2" ParentId="25478" CreationDate="2023-01-16T22:40:44.423" Score="3" Body="&lt;h1&gt;Best tip&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24233/92689&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20616&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/18429/best-of-ppcg-2019-call-for-categories/18469#18469&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14523/66833&quot;&gt;2017&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10939/66833&quot;&gt;2016&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;For the best answer to a question tagged with &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt;, because this site isn't just about competing with one another, but also about helping each other improve our golfing skills.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/252554/91213&quot;&gt;Better way to read multiple int in C than scanf&lt;/a&gt; by Mousetail and DialFrost&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;Partial Self-nomination by Mousetail&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This question was unsolved for 5 years, till DialFrost and I finally found a way to shorten it, saves 1 byte in the example case and 6 bytes when reading 5 variables.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/241476/100664&quot;&gt;&lt;code&gt;0in&lt;/code&gt; instead of &lt;code&gt;not all&lt;/code&gt;&lt;/a&gt; in Python by &lt;a href=&quot;https://codegolf.stackexchange.com/a/241476/100664&quot;&gt;pxeger&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by emanresu A&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;You'd think &lt;code&gt;any&lt;/code&gt; and &lt;code&gt;all&lt;/code&gt; are very short function names, and they'd be the shortest way to check if any/all elements of an array are truthy, right?&lt;/p&gt;&#xA;&lt;p&gt;Wrong. This tip abuses type coercion and operator whitespace to allow saving several bytes on what is a quite common operation in Python, making it very widely applicable and useful. It also provides a tip for a much rarer case of something similar.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/241658/100664&quot;&gt;Use &lt;code&gt;-&lt;/code&gt; as a check for recursive functions&lt;/a&gt; in Vyxal by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresu A&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;self-nomination&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Writing a recursive function that behaves differently on lists and non-lists comes up fairly often, especially in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ragged-list&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ragged-list&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;ragged-list&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;ragged-list-container&quot;&gt;ragged-list&lt;/a&gt; challenges. This uses a clever trick where running a dyadic operation on two copies of the same scalar value gives a falsy value, but that operation returns a truthy result on lists due to any non-empty list being truthy.&lt;/p&gt;&#xA;&lt;p&gt;This does have the caveat of not working on empty lists, but the answer also provides a 2-byte alternative for that case.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/245962/16766&quot;&gt;Use &lt;code&gt;++&lt;/code&gt; in patterns&lt;/a&gt; in Curry by &lt;a href=&quot;https://codegolf.stackexchange.com/users/56656/wheat-wizard&quot;&gt;Wheat Wizard&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;Nominated by DLosc&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Curry, at first glance, looks a lot like Haskell, but Wheat Wizard's tip showcases an example where Curry can do something Haskell can't. Pattern-matching using &lt;code&gt;++&lt;/code&gt; is a very powerful ability that I've seen used in multiple Curry answers.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/245790/16766&quot;&gt;Basic routing and halting&lt;/a&gt; in Piet by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;Nominated by DLosc&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Control flow in Piet is hard to understand. Even figuring out how to halt the program is non-trivial! Bubbler gives a golf-oriented tutorial that lays out how control flow works and how to use that knowledge to construct different kinds of loops. Helpful diagrams accompany the explanation--particularly useful, given how counterintuitive the pointer movement logic can be.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/242255/16766&quot;&gt;Abuse builtins for type-checking&lt;/a&gt; in tinylisp by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;Self-nomination&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;The builtins in tinylisp are mostly one byte each, but one of the ones that isn't is &lt;code&gt;type&lt;/code&gt;. It also, unfortunately for golf, returns multi-character names like &lt;code&gt;Int&lt;/code&gt; or &lt;code&gt;List&lt;/code&gt;. As such, checking the type of an expression (for instance, distinguishing between lists and integers in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ragged-list&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ragged-list&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;ragged-list&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;ragged-list-container&quot;&gt;ragged-list&lt;/a&gt; challenges) can be expensive. I found a number of hacky ways to use other builtins to distinguish between types at a much lower byte cost.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="16766" LastEditDate="2023-02-02T03:25:39.627" LastActivityDate="2023-02-02T03:25:39.627" CommentCount="6" CommunityOwnedDate="2023-01-16T22:43:18.543" ContentLicense="CC BY-SA 4.0" />
  <row Id="25487" PostTypeId="2" ParentId="25478" CreationDate="2023-01-16T22:40:56.810" Score="2" Body="&lt;h1&gt;Rookie of the Year - Challenges&lt;/h1&gt;&#xA;&lt;p&gt;Repost of &lt;a href=&quot;/a/24228/100664&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;/a/20589/66833&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;/a/18437/66833&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;/a/17318/85052&quot;&gt;2018&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For the best challenge written by someone who has not written a challenge prior to 2022.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1692946/2022-challenges-by-users-with-no-challenges-before-2022&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE query&lt;/a&gt; thanks to mousetail&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250556/transform-characters-of-your-choice-into-hello-world&quot;&gt;Transform characters of your choice into &amp;quot;Hello, world!&amp;quot;&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/101306/ji%c5%99%c3%ad&quot;&gt;Jiří&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by emanresu A&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a fun challenge involving translating a list of unique characters to &amp;quot;Hello, world!&amp;quot;. It's quite interesting to answer, and the answers are extremely diverse and clever. As put by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/250556/transform-characters-of-your-choice-into-hello-world#comment558442_250556&quot;&gt;xnor&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I think this is an interesting puzzle, where it might not be obvious at first to solvers that competitive answers probably shouldn't write &amp;quot;Hello, world!&amp;quot; at all in the their code.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245701/whats-the-missing-code-cops&quot;&gt;What's the missing code&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110951/lecdi&quot;&gt;Lecdi&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by emanresu A&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a really fun &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;cops-and-robbers-container&quot;&gt;cops-and-robbers&lt;/a&gt; in which the robbers have to guess a missing substring of a piece of code. Additionally, the code with the substring removed has to be valid code, which lead to a wide variety of clever approaches, including &lt;a href=&quot;https://codegolf.stackexchange.com/a/245729/100664&quot;&gt;Unicode trickery&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/245701/whats-the-missing-code-cops/245724#245724&quot;&gt;Java method abuse&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/a/245717/100664&quot;&gt;concerning substrings&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="100664" LastEditDate="2023-01-27T19:09:27.327" LastActivityDate="2023-01-27T19:09:27.327" CommentCount="2" CommunityOwnedDate="2023-01-16T22:43:18.543" ContentLicense="CC BY-SA 4.0" />
  <row Id="25488" PostTypeId="2" ParentId="25478" CreationDate="2023-01-16T22:41:09.933" Score="1" Body="&lt;h1&gt;Most unexpected outcome&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24239/108218&quot;&gt;2021&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;An answer that you didn’t expect to work, or do something else, but unexpectedly did some weird behavior and made the answer valid.&lt;/p&gt;&#xA;&lt;p&gt;This could involve some interpreter bug, or obscure feature that wasn’t documented nor known by many people.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/255305/cgac2022-day-8-fen-the-wicked-part-2/255309#255309&quot;&gt;CGAC2022 Day 8: Fen The Wicked, Part 2&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850&quot;&gt;lyxal&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;self-nomination&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;At first, I had a 13 byte answer, which would make my answer the 8th shortest answer. Then, I discovered that &lt;code&gt;ṡ&lt;/code&gt; vectorises pair-wise when given two lists, which helped me save 6 bytes. The funny part about this is that despite the fact I made the language, I completely didn't know about a feature that helped make my answer come first :p.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/245701/whats-the-missing-code-cops/245729#245729&quot;&gt;What's the Missing Code? (Cops)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/48931/sisyphus&quot;&gt;Sisyphus&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/245702/whats-the-missing-code-robbers/245740#245740&quot;&gt;What's the Missing Code? (Robbers)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/20260/xnor&quot;&gt;xnor&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by alephalpha&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Since this is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;cops-and-robbers-container&quot;&gt;cops-and-robbers&lt;/a&gt; challenge, I'm nominating both the cop and the robber.&lt;/p&gt;&#xA;&lt;p&gt;I really did not expect that &lt;code&gt;divmod&lt;/code&gt; can be written as &lt;code&gt;dⅳmod&lt;/code&gt; in Python. Here the &lt;code&gt;ⅳ&lt;/code&gt; is U+2173 (Small Roman Numeral Four).&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="9288" LastEditDate="2023-01-31T06:01:45.790" LastActivityDate="2023-01-31T06:01:45.790" CommentCount="2" CommunityOwnedDate="2023-01-16T22:43:18.543" ContentLicense="CC BY-SA 4.0" />
  <row Id="25489" PostTypeId="2" ParentId="25478" CreationDate="2023-01-16T22:41:22.657" Score="3" Body="&lt;h1&gt;Kansas City Shuffle&lt;/h1&gt;&#xA;&lt;p&gt;Reposted from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24281/66833&quot;&gt;2021&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17324/66833&quot;&gt;2018&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14538/66833&quot;&gt;2017&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10948/66833&quot;&gt;2016&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Too often, someone devises a particularly golfy method of solving a challenge, which most people will use that method for their answers. This award goes to those answers that utilize an alternative method as a better solution than the method that the majority of other answers use (prior to the posting of the rewarded answer).&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251191/is-this-graph-a-tree/251223#251223&quot;&gt;Is this graph a tree?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/21775/alex&quot;&gt;Alex&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by alephalpha&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;I did not specify the input format for this challenge. Most answers used conventional graph formats like edge lists, adjacency lists or adjacency matrices. Alex used a format that I never would have thought of: the &lt;a href=&quot;https://en.wikipedia.org/wiki/Incidence_matrix&quot; rel=&quot;nofollow noreferrer&quot;&gt;oriented incidence matrix&lt;/a&gt;, and solved the challenge in only 4 bytes.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="9288" LastEditDate="2023-01-20T08:30:43.013" LastActivityDate="2023-01-20T08:30:43.013" CommentCount="1" CommunityOwnedDate="2023-01-16T22:43:18.543" ContentLicense="CC BY-SA 4.0" />
  <row Id="25490" PostTypeId="2" ParentId="25478" CreationDate="2023-01-16T22:41:44.770" Score="3" Body="&lt;h1&gt;Best non-text answer&lt;/h1&gt;&#xA;&lt;p&gt;There are a few &amp;quot;languages&amp;quot; here that are allowed to compete, but do not have a textual representation in their native form. Examples are &lt;a href=&quot;https://www.dangermouse.net/esoteric/piet.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Piet&lt;/a&gt;, &lt;a href=&quot;https://scratch.mit.edu/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Scratch&lt;/a&gt;, &lt;a href=&quot;https://powdertoy.co.uk/&quot; rel=&quot;nofollow noreferrer&quot;&gt;The Powder Toy&lt;/a&gt;, and even &lt;a href=&quot;https://minecraft-archive.fandom.com/wiki/Redstone_Circuits&quot; rel=&quot;nofollow noreferrer&quot;&gt;Minecraft redstone&lt;/a&gt;. For most of these, we have found ways to convert them to the byte-based representation we all know and love. For the above, respectively, they are &lt;a href=&quot;https://github.com/dloscutoff/ascii-piet&quot; rel=&quot;nofollow noreferrer&quot;&gt;ASCII-Piet&lt;/a&gt;, &lt;a href=&quot;https://scratchblocks.github.io&quot; rel=&quot;nofollow noreferrer&quot;&gt;scratchblocks&lt;/a&gt; , &lt;a href=&quot;https://codegolf.stackexchange.com/a/155079&quot;&gt;TPT save files&lt;/a&gt;, and &lt;a href=&quot;https://minecraft.fandom.com/wiki/Structure_Block_file_format&quot; rel=&quot;nofollow noreferrer&quot;&gt;structure files&lt;/a&gt;. This prize will go to the best answer in a language that does not have a textual representation natively.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/241965/100664&quot;&gt;1, 2, Fizz, 4, Buzz&lt;/a&gt; in Apple Shortcuts by &lt;a href=&quot;https://codegolf.stackexchange.com/users/101522/aaroneous-miller&quot;&gt;Aaroneous Miller&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by emanresu A&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Apple Shortcuts is a graphical utility scripting language designed to automate tasks like sending emails, setting timers or playing music. But it can be abused to do things like FizzBuzz.&lt;/p&gt;&#xA;&lt;p&gt;This answer cleverly uses a lot of the languages' limited features, such as regex and implicit variables, to solve the problem in just 9 actions, over three times shorter than &lt;a href=&quot;https://codegolf.stackexchange.com/a/241954/100664&quot;&gt;the other answer&lt;/a&gt; which uses 31.&lt;/p&gt;&#xA;&lt;p&gt;Note: While a text-based format exists as a .shortcut file (see the above link), these have to be created on MacOS and downloaded, which I haven't managed to do for this answer.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/139243/determine-your-languages-version/245687#245687&quot;&gt;Determine your language's version&lt;/a&gt; in Scratch (1.x, 2.0, 3.0) by &lt;a href=&quot;https://codegolf.stackexchange.com/users/90816/qarz&quot;&gt;qarz&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by UndoneStudios&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This answer abuses a few technicalities of the &lt;code&gt;() of ()&lt;/code&gt; block in Scratch. In Scratch 3, the cosine of 90 is 0, but a random number in other versions. This helps separate Scratch 3 from the other versions.&lt;/p&gt;&#xA;&lt;p&gt;This also abuses the fact that appending &lt;code&gt;&amp;lt;not&amp;lt;&amp;gt;&amp;gt;&lt;/code&gt; to a list in Scratch 1.x will append 1, but in Scratch 2 it appends &lt;code&gt;true&lt;/code&gt;. With a touch of golfing this returns the correct answer.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/249523/erverse-hte-ifrst-wto-eltters-fo-aech-owrd/249617#249617&quot;&gt;Erverse Hte Ifrst Wto Eltters fo Aech Owrd&lt;/a&gt; in Piet by &lt;a href=&quot;https://codegolf.stackexchange.com/users/104752/m90&quot;&gt;m90&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by Aiden Chow&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;By implementing a very clever way for checking when to halt, this Piet answer comes out to be surprisingly concise, at only 25 bytes. Usually, it is quite hard to detect the end of the input in Piet without a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods/24639#24639&quot;&gt;sentinel value&lt;/a&gt; or some other indicator, but this Piet answer manages to check for this in a very concise way, which makes it quite impressive in my opinion. It is also accompanied by an understandable explanation as to how this Piet answer even works, and even has a great diagram to follow the pointer path as it executes the code.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="56656" LastEditDate="2023-02-03T18:10:19.673" LastActivityDate="2023-02-03T18:10:19.673" CommentCount="3" CommunityOwnedDate="2023-01-16T22:43:18.543" ContentLicense="CC BY-SA 4.0" />
  <row Id="25491" PostTypeId="2" ParentId="25478" CreationDate="2023-01-16T22:42:01.807" Score="4" Body="&lt;h1&gt;Most significant impact via Meta&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24237/108218&quot;&gt;2021&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;/questions&quot;&gt;Meta&lt;/a&gt; is an important yet often overlooked portion of this site, where significant rules changes are decided, and the site becomes the most democratic. It allows people to present their visions of the site, and for others to show their agreement or disagreement, and contributions can be just as important - if not more - than posts on Main.&lt;/p&gt;&#xA;&lt;p&gt;This category is to reward Meta posts that have had a non-trivial or significant impact on the site in some way, and the users who proposed them.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24251/what-is-our-consensus-for-fractional-byte-functions&quot;&gt;What is our consensus for fractional byte functions?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/24251/100664&quot;&gt;Radvylf Programs&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by emanresu A&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Until recently, no matter what encoding languages used, they had to round their score up to the nearest full byte. This meant that fractional-byte golflangs were substantially disadvantaged. This question ultimately resulted in fractional bytes always being allowed, paving the way for many fractional-byte golflangs and allowing older languages like &lt;a href=&quot;https://esolangs.org/wiki/7&quot; rel=&quot;nofollow noreferrer&quot;&gt;7&lt;/a&gt; to finally have a fair chance.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/25251/announcing-code-golf-advent-calendar-2022-event-challenge-sandbox&quot;&gt;Announcing Code Golf Advent Calendar 2022! (+ Event challenge sandbox)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by emanresu A&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;After a name change for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/25285/what-do-we-rename-advent-of-code-golf&quot;&gt;legal reasons&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/24068/100664&quot;&gt;Advent of Code Golf&lt;/a&gt; is back!&lt;/p&gt;&#xA;&lt;p&gt;While this event included more community participation, Bubbler still had to coordinate eight peoples' posting schedules, an extremely impressive feat. Additionally, they created sixteen of the challenges in just a month.&lt;/p&gt;&#xA;&lt;p&gt;Overall, this event created 24 high-quality challenges, over 3% of the total challenges posted that year.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="100664" LastEditDate="2023-01-27T19:40:12.423" LastActivityDate="2023-01-27T19:40:12.423" CommentCount="2" CommunityOwnedDate="2023-01-16T22:43:18.543" ContentLicense="CC BY-SA 4.0" />
  <row Id="25492" PostTypeId="2" ParentId="25478" CreationDate="2023-01-16T22:42:29.763" Score="1" Body="&lt;h1&gt;Most improved answer&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24287/56656&quot;&gt;2021&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This category is to reward the continued work users put into answers long after they have been posted.  After the FGITW effect has dissipated there stops being so much incentive to work on an old answer, but some users put in the effort and really make it shine.  The ideal answer here would be one that demonstrates a significant commitment to improvement regardless of the quality of the initial answer.  This could be improving the score, or the explanation or both.&lt;/p&gt;&#xA;&lt;p&gt;Answers in this category don't have to have been initially posted in 2022 but the improvements have to have been made over the course of the year.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/246914/107299&quot;&gt;Draw the Ionising Radiation Hazard Symbol&lt;/a&gt; in Desmos by &lt;a href=&quot;https://codegolf.stackexchange.com/users/107299/seggan&quot;&gt;Seggan&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;self-nomination&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This was at first by far the longest Desmos answer to that challenge (at 178 bytes), but I decided to post it becuase I used a slightly different approach. Mine was also scalable.&lt;/p&gt;&#xA;&lt;p&gt;I initially did some golfing of my own, getting it down to 161 bytes. &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt; then helped me with a 153 byter. I got an insight and golfed it down to 126 bytes. After talking with &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt; in chat, he helped me to get it down to 119. Shortly after, we managed to replace that function with a peicewise, and combining that with a byte saved by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresu A&lt;/a&gt;, we got a whole 47 byte golf. Steffan then contributed a bit more, getting the asnwer to 68 bytes. Removing the scaling feature gets me the shortest Desmos answer to that challenge: 60 bytes.&lt;/p&gt;&#xA;&lt;p&gt;In all, the answer had been golfed 118 bytes since its posting: 12 by Steffan, 35 by me, 54 by Aiden Chow, and 1 by emanresu A.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Note: there was a 1 byte golf by Aiden Chow to the scalable version, but I have chosen to not list it here because it was made in 2023&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/251740/fibonacci-word-fractal/251748#251748&quot;&gt;Fibonacci word fractal&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850&quot;&gt;lyxal&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;self-nomination&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Ever wondered what a chain of self-golfs while eating soup and participating in an SQL uni workshop looks like?&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://i.stack.imgur.com/fRlp6.png&quot; alt=&quot;&quot; /&gt;&#xA;I started with a FGITW at 42 bytes (not included in the answer header, but in the revision history). After an hour and 17 minutes, I found there was a &lt;code&gt;-1&lt;/code&gt; byte shave, which got the ball rolling. At this time, I was not eating soup, nor was I in a uni workshop.&lt;/p&gt;&#xA;&lt;p&gt;Then, another hour later, the soup started, the workshop was going well, and I found a &lt;code&gt;-2&lt;/code&gt; byte shave. At the time, my answer was first place, because people were still answering it. But then Kevin came in with 05AB1E and outgolfed me by about 7 or so bytes. This was obviously unacceptable, so I managed to find a &lt;code&gt;-6&lt;/code&gt; while eating soup, bringing the gap down to roughly 1 byte. After that, I got that gap down to 0 just 5 minutes later.&lt;/p&gt;&#xA;&lt;p&gt;But I wasn't done. The power of &lt;code&gt;WHERE&lt;/code&gt; clauses and database &lt;code&gt;JOIN ON&lt;/code&gt;s was strong enough for me to find another &lt;code&gt;-1&lt;/code&gt;. Now that doesn't seem like much, but in a golfing language where you already have something you consider short, that's a major thing. After that, I took 12 minutes to find another &lt;code&gt;-1&lt;/code&gt; (due to reading the challenge specs properly) and left my answer at 30 bytes. I also left the workshop 30 minutes later and placed the empty soup plate away (after cleaning it, duh.)&lt;/p&gt;&#xA;&lt;p&gt;Then, during my nightly code golfing session (yes, I spend most nights code golfing until 12:30am - don't question my lifestyle (it's 12:09am as I write this nomination)), I managed to find another &lt;code&gt;-2&lt;/code&gt; bytes at 11:48pm, which brought my answer down to 28 bytes. After adding an explanation 20 minutes later, and probably wrapping a few other things up, I left the answer alone for the rest of the night (and slept.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;The next day&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;I woke up and saw that my 28 byter was no longer the shortest (stares at MATL and Charcoal coming in at 26 bytes). I said to myself &amp;quot;this is no good. I must reclaim my W&amp;quot;. So I managed to find a way to get &lt;code&gt;-3&lt;/code&gt; bytes (as a &lt;code&gt;-2&lt;/code&gt; and then a &lt;code&gt;-1&lt;/code&gt; in quick succession - the revision history doesn't show the 26 byter, probably due to grace period edits or something). My answer was now 25 bytes long, which was enough to reclaim first place. But that still wasn't enough for me. 4 hours later (not all spent golfing this answer, probably only 10 minutes golfing this one answer, 3 hours and 50 minutes doing other things), I felt the need to keep experimenting with ways to shave even more bytes off - which was hard at this stage given that I was already beating the dedicated ascii-art language + the language where graphical output is a thing. There wasn't much room left for golfing.&lt;/p&gt;&#xA;&lt;p&gt;Yet 25 bytes became 24 bytes at 9:31pm. And another hour later, 24 bytes became 23 bytes at 10:25pm. That's not to say I spent the entire hour golfing, but I probably spent a good portion of that time trying to re-arrange things. And so that's where the story ends - 18 total bytes saved. That doesn't sound like much, but in SBCS languages, a byte save of 18 bytes is probably the same as a byte shave of 100 bytes or so.&lt;/p&gt;&#xA;&lt;p&gt;1 bowl of soup, a university workshop and 2 night golfing sessions. Who knew that's what you need to go crazy on byte shaves?&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/248311/16766&quot;&gt;Scribble Pad for Nerds&lt;/a&gt; in BQN by &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;self-nomination&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;A complicated challenge for BQN resulted in a complicated answer. Over the course of a couple days, and with some help from &lt;a href=&quot;https://codegolf.stackexchange.com/users/81203/att&quot;&gt;att&lt;/a&gt; in the comments, I golfed my answer from 79 bytes down to 51. A little friendly rivalry with &lt;a href=&quot;https://codegolf.stackexchange.com/users/9365/dom-hastings&quot;&gt;Dom Hastings&lt;/a&gt;' Perl answer provided extra motivation. At one point, I changed a significant chunk of my algorithm. And after every change, I made sure the explanation section was up to date.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/242430/quicksand-piles/242612#242612&quot;&gt;Quicksand (piles)&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110836/polichinelle&quot;&gt;Polichinelle&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by alephalpha&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;fastest-code-container&quot;&gt;fastest-code&lt;/a&gt; challenge. The original solution was already pretty fast. After several rounds of improvements in ten days, the score improved from 2500000 to an amazing 14000000. It is the only solution that beats &lt;a href=&quot;https://codegolf.stackexchange.com/questions/242430/quicksand-piles/242526#242526&quot;&gt;the hard-coded solution&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="9288" LastEditDate="2023-02-02T05:58:26.520" LastActivityDate="2023-02-02T05:58:26.520" CommentCount="4" CommunityOwnedDate="2023-01-16T22:43:18.543" ContentLicense="CC BY-SA 4.0" />
  <row Id="25493" PostTypeId="2" ParentId="25478" CreationDate="2023-01-16T22:42:44.340" Score="4" Body="&lt;h1&gt;Most helpful Sandbox commenter&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24328/55372&quot;&gt;2021&lt;/a&gt;&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2140/66833&quot;&gt;Sandbox&lt;/a&gt; is a very useful tool to help improve people's challenges, and functions best when users provide helpful advice and feedback on the drafts.&lt;/p&gt;&#xA;&lt;p&gt;This category should reward the users who helped the most in the Sandbox during 2022.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/55372/pajonk&quot;&gt;pajonk&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;self-nomination&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;I browse Sandbox quite frequently and try to spot problems with questions that may arise on the main site. Mostly under- or over-specified I/O, ambiguities in the description or issues with scoring. I also try to give my thoughts on questions in the &lt;em&gt;meta&lt;/em&gt; section of the challenge.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/meta.codegolf/query/1694798/sandbox-2022-commenters&quot; rel=&quot;nofollow noreferrer&quot;&gt;This SEDE query&lt;/a&gt; seems to back up this nomination, but bear in mind that this doesn't include deleted posts (does it?) and feedback given in the TNB chatroom.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="55372" LastEditDate="2023-01-29T19:36:50.593" LastActivityDate="2023-01-29T19:36:50.593" CommentCount="1" CommunityOwnedDate="2023-01-16T22:43:18.543" ContentLicense="CC BY-SA 4.0" />
  <row Id="25494" PostTypeId="2" ParentId="25478" CreationDate="2023-01-16T22:42:59.653" Score="1" Body="&lt;h1&gt;Most involvement in an answer/answers&lt;/h1&gt;&#xA;&lt;p&gt;Repost of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18435/95792&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24319/107299&quot;&gt;2021&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For an answer or multiple answers where multiple people were involved. This could be multiple people helping out a user on a single answer, or a back-and-forth between two or more answers trying to outgolf each other.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/242258/100664&quot;&gt;Inject arbitrary code into a compiler&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/16766/dlosc&quot;&gt;DLosc&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresu A&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by emanresu A (half-self-nomination)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;For this challenge, people were meant to create their own languages with hidden security vulnerabilities. However, most answers were pre-existing languages, including four separate vulnerabilities in Vyxal.&lt;/p&gt;&#xA;&lt;p&gt;DLosc was the only user to actually create a language for the challenge, creating &lt;a href=&quot;https://codegolf.stackexchange.com/questions/241947/inject-arbitrary-code-into-a-compiler-cops/242066#242066&quot;&gt;Exceptionally&lt;/a&gt;, a language where turing completeness came from throwing and catching exceptions. The first version was cracked with an unintended vulnerability, so DLosc created the second version, again cracked unintentionally, and finally a third version which remained safe until the end.&lt;/p&gt;&#xA;&lt;p&gt;This was a really fun back-and-forth and DLosc's intended solution was extremely clever and subtle.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250522/generate-all-possibilities-of-words&quot;&gt;Generate all Possibilities of Words&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/100664/emanresu-a&quot;&gt;emanresu A&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/users/92689/steffan&quot;&gt;Steffan&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/users/78850/lyxal&quot;&gt;lyxal&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by emanresu A (part-self-nomination)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Lyxal began with a &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/250524/1&quot;&gt;14&lt;/a&gt; byte answer, later golfed down to &lt;a href=&quot;https://codegolf.stackexchange.com/a/250524/100664&quot;&gt;13&lt;/a&gt;. I (emanresu A) found a &lt;a href=&quot;https://codegolf.stackexchange.com/revisions/250528/1&quot;&gt;10&lt;/a&gt; byte approach, which Steffan &lt;a href=&quot;https://codegolf.stackexchange.com/a/250546/100664&quot;&gt;golfed another byte off&lt;/a&gt;. Finally, I found a &lt;a href=&quot;https://codegolf.stackexchange.com/a/250528/100664&quot;&gt;5 byte&lt;/a&gt; answer.&lt;/p&gt;&#xA;&lt;p&gt;As the comments put it:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/250528/100664&quot;&gt;Get outgolfed lol&lt;/a&gt; – emanresu A &lt;sub&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250522/generate-all-possibilities-of-words/250528#comment558402_250524&quot;&gt;Jul 31, 2022 at 8:52&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250522/generate-all-possibilities-of-words/250546#250546&quot;&gt;Get outgolfed lol&lt;/a&gt; – Steffan &lt;sub&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250522/generate-all-possibilities-of-words/250528#comment558422_250528&quot;&gt;Jul 31, 2022 at 18:44&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;@Steffan no, &lt;em&gt;you&lt;/em&gt; get outgolfed lol – emanresu A &lt;sub&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/250522/generate-all-possibilities-of-words/250528#comment558471_250528&quot;&gt;Aug 1, 2022 at 0:05&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="100664" LastEditDate="2023-02-01T20:05:24.003" LastActivityDate="2023-02-01T20:05:24.003" CommentCount="2" CommunityOwnedDate="2023-01-16T22:43:18.543" ContentLicense="CC BY-SA 4.0" />
  <row Id="25495" PostTypeId="2" ParentId="2140" CreationDate="2023-01-17T04:04:29.867" Score="0" Body="&lt;h1&gt;Title Case (WIP)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;string-container&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Input a string with letters and spaces, input a set of mirror words. Output a string which is title case of the input string that follow the following rules:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Cases is unchanged for any words already contains uppercase letters;&lt;/li&gt;&#xA;&lt;li&gt;Cases is unchanged for any words in the set mirror words AND is not the first word;&lt;/li&gt;&#xA;&lt;li&gt;For all other words, the first letter is changed into uppercase&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;The set mirror words is an input to your program / function. Here are mirror words used in testcases:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-json prettyprint-override&quot;&gt;&lt;code&gt;[&amp;quot;a&amp;quot;, &amp;quot;an&amp;quot;, &amp;quot;and&amp;quot;, &amp;quot;as&amp;quot;, &amp;quot;as&amp;quot;, &amp;quot;at&amp;quot;, &amp;quot;but&amp;quot;, &amp;quot;by&amp;quot;, &amp;quot;for&amp;quot;, &amp;quot;if&amp;quot;, &amp;quot;in&amp;quot;, &amp;quot;nor&amp;quot;, &amp;quot;of&amp;quot;, &amp;quot;off&amp;quot;, &amp;quot;on&amp;quot;, &amp;quot;or&amp;quot;, &amp;quot;per&amp;quot;, &amp;quot;so&amp;quot;, &amp;quot;the&amp;quot;, &amp;quot;to&amp;quot;, &amp;quot;up&amp;quot;, &amp;quot;via&amp;quot;, &amp;quot;yet&amp;quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input -&amp;gt; Output&#xA;the sun and the moon -&amp;gt; The Sun and the Moon&#xA;jQuery tutorial using jQuery plugins -&amp;gt; jQuery Tutorial Using jQuery Plugins&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="44718" LastActivityDate="2023-01-17T04:04:29.867" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25496" PostTypeId="2" ParentId="2140" CreationDate="2023-01-18T17:43:33.723" Score="-1" Body="&lt;h1&gt;Generate a random halting Brainfuck code&lt;/h1&gt;&#xA;&lt;p&gt;Generate a random valid halting brainfuck program using &lt;code&gt;[]+-&amp;lt;&amp;gt;&lt;/code&gt;. Every halting program should be possibly outputted.&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox Notes:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What should I add?&lt;/li&gt;&#xA;&lt;li&gt;Is it a duplicate?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2023-01-18T17:43:33.723" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25497" PostTypeId="2" ParentId="2140" CreationDate="2023-01-19T23:28:16.363" Score="-3" Body="&lt;p&gt;Take one of two distinct, consistent values of your choice. For one input, check if the input is prime. For another input, check if the input is a square.&lt;/p&gt;&#xA;&lt;p&gt;Standard loophole apply except &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14110/76323&quot;&gt;input complete or partial functions&lt;/a&gt;, which is replaced with&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;No input results in an infinite loop.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2023-01-19T23:28:16.363" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25499" PostTypeId="2" ParentId="2140" CreationDate="2023-01-20T05:35:38.793" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257236/knook-to-mate-with-portals&quot;&gt;Knook to Mate... With Portals!&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2023-01-31T01:43:20.470" LastActivityDate="2023-01-31T01:43:20.470" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25500" PostTypeId="2" ParentId="2140" CreationDate="2023-01-20T09:12:49.860" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/257017/91213&quot;&gt;Implement a 2Fuck Interpreter&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-01-23T13:54:51.327" LastActivityDate="2023-01-23T13:54:51.327" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25502" PostTypeId="2" ParentId="19279" CreationDate="2023-01-20T14:26:19.563" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/C%2B%2B&quot; rel=&quot;nofollow noreferrer&quot;&gt;C++&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;Description&lt;/h2&gt;&#xA;&lt;p&gt;Quote from Wikipedia:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;C++ (pronounced &amp;quot;C plus plus&amp;quot;) is a high-level general-purpose&#xA;programming language created by Danish computer scientist Bjarne&#xA;Stroustrup as an extension of the C programming language, or &amp;quot;C with&#xA;Classes&amp;quot;. The language has expanded significantly over time, and&#xA;modern C++ now has object-oriented, generic, and functional features&#xA;in addition to facilities for low-level memory manipulation.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Reasons why&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It inherited most of its' feature from C, so it is easy to be picked up by golfers from C.&lt;/li&gt;&#xA;&lt;li&gt;It has a lot of libraries, that can be used to golf code.&lt;/li&gt;&#xA;&lt;li&gt;It is a general programming language used across the world (not a golfing lang or an esolang), so golfing it is expected to be fun and competitive.&lt;/li&gt;&#xA;&lt;li&gt;The language is very stable.&lt;/li&gt;&#xA;&lt;li&gt;A lot of people are using C, but very few use C++ regulaly.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Reasons why not&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;C++ can be seen as &amp;quot;C with libraries&amp;quot; and since C has a lot of golfers, C++ could be non-fitting due to: &amp;quot;It should not be one of our most commonly used languages&amp;quot;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Interpreter&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://tio.run/#cpp-gcc&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;, &lt;a href=&quot;https://ato.pxeger.com/run?1=m702uSCntBiE49OTkxcsWFpakqZrgUZBaQA0&quot; rel=&quot;nofollow noreferrer&quot;&gt;AIO&lt;/a&gt;, &lt;a href=&quot;https://godbolt.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Compiler Explorer&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://gcc.gnu.org/install/download.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;gcc&lt;/a&gt;, &lt;a href=&quot;https://clang.llvm.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;clang&lt;/a&gt;, &lt;a href=&quot;https://visualstudio.microsoft.com/fr/vs/features/cplusplus/&quot; rel=&quot;nofollow noreferrer&quot;&gt;msvc&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Resource&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tips-container&quot;&gt;tips&lt;/a&gt; question was posted &lt;a href=&quot;https://codegolf.stackexchange.com/q/132/108879&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://stackoverflow.com/q/388242/14193797&quot;&gt;Book resource&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="108879" LastActivityDate="2023-01-20T14:26:19.563" CommentCount="0" CommunityOwnedDate="2023-01-20T14:26:19.563" ContentLicense="CC BY-SA 4.0" />
  <row Id="25504" PostTypeId="2" ParentId="2140" CreationDate="2023-01-21T09:38:11.137" Score="1" Body="&lt;h1&gt;Yet another Colatz challenge&lt;/h1&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;We all know and love the colatz sequence. It goes like this:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a number is divisible by 2, divide by 2&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, multiply by 3 and add 1.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The Colatz conjecture theorizes that if you repeat this process for any number, you'll eventually reach 1.&lt;/p&gt;&#xA;&lt;h2&gt;Binary&lt;/h2&gt;&#xA;&lt;p&gt;If you write colatz numbers in binary, any numbers divisible by 2 will be followed by a 0. This means we can ignore any trailing 0s at the end of the number in binary notation, as the 0s will be removed first anyways. Thus we only need to consider the odd numbers. For the purpose of this challenge, we'll write it like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1[0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This means &amp;quot;1 followed by any number of 0s&amp;quot;. Every colatz number must pass through this number in this form at some point (since no odd number * 3 + 1 = 1). If we then subtract 1, we get this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Then divide by 3 we get this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[01]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that only even numbers of 1 are divisible by 3, so we only consider them. Here, we can prove that the last odd number in any numbers colatz sequence must be of this form. Of course, the ancestors in the same family will look like that:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[01][0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Continuing the pattern&lt;/h2&gt;&#xA;&lt;p&gt;We can continue the pattern to find general forms for the nth ancestor of 1 in the colatz sequence. We start like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;-1 [01]00[1]&#xA;/3 [000111]00[01][0]&#xA;-1 [000111]00[01]00[1] (or if [01] is repeated 0 times [000111]00011011111[1])&#xA;/3 [000010010111101101000010010111101101]00[000111]00[01][0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note: Now, when subtracting 1 the pattern branches. Numbers inside the brackets can be repeated 0 or more times. If they are repeated at least once the 1 can &amp;quot;absorb&amp;quot; the &lt;code&gt;-1&lt;/code&gt; from the right and prevent it from effecting the pattern to it's left. However, if repeated 0 times subtracting one would also flip the 0s to it's left until the first 1 is encountered. For the purpose of this challenge you only need to consider the branch of the path where each pattern is repeated at least once.&lt;/p&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;Your task is to output the general form of the nth-element in the odd only colatz sequence, assuming the branch where each pattern appears at least once.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output must be in binary&lt;/li&gt;&#xA;&lt;li&gt;You may use any reasonable method to mark which sequences can be repeated&lt;/li&gt;&#xA;&lt;li&gt;You may choose to output only the odd or only the even members of the sequence if you want&lt;/li&gt;&#xA;&lt;li&gt;You can loop forever, or output the nth element given a n, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;sequence-container&quot;&gt;sequence&lt;/a&gt; rules&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is code golf, shortest code wins&lt;/p&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2023-01-21T09:38:11.137" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25505" PostTypeId="2" ParentId="2140" CreationDate="2023-01-21T14:32:25.157" Score="3" Body="&lt;h1&gt;Base64 fixed point&lt;/h1&gt;&#xA;&lt;p&gt;It can be proven that there's exactly one string of infinite length that remain same after &lt;code&gt;base64&lt;/code&gt; encoding &lt;a href=&quot;https://tio.run/##Ncy/DsIgEMfx3ae4DUixafzTBVl8BUfjcFZoDppioLoYnx1tQ9fv537n8I2pi/SctmN4mJxtiMBJNwrotDu2CqqKxAZg6W7ubu1u7kX8LH4VL@CzGACChvPLWhP5laST/iZUIbLAsZ7CZYo09pzdMZn2wESdBuoMb@ReaI2iXAN0YUxhMPUQ@v9QAlaMlWffnH8&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;code&gt;Vm0wd2QyUXlVWGxWV0d4V1YwZ...&lt;/code&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, output one of&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-th character&lt;/li&gt;&#xA;&lt;li&gt;the first &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; characters&lt;/li&gt;&#xA;&lt;li&gt;The whole string&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;sequence-container&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2023-02-15T18:06:27.410" LastActivityDate="2023-02-15T18:06:27.410" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="25506" PostTypeId="2" ParentId="2140" CreationDate="2023-01-21T15:57:58.487" Score="-2" Body="&lt;h1&gt;Detect if a variable is declared&lt;/h1&gt;&#xA;&lt;p&gt;Create an expression which detects if a variable (named whatever you wish) has been declared yet. For languages that set undeclared variables to a type that can not be differentiated from a declared variable set to that type (e.g. &lt;code&gt;nil&lt;/code&gt; in Lua), just detecting that type is enough. If the variable exists, the expression should return a truthy value, and if it doesn't it should return a falsy value. It should not output anything.&lt;/p&gt;&#xA;&lt;p&gt;For example, the following expression in D detects if a variable named &lt;code&gt;x&lt;/code&gt; has been declared in the current scope or not:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;__traits(compiles, x)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;PS:&lt;/em&gt; this challenge definitely wouldn't work for stack-based or assembly languages, and I'm also not sure if marking this as &lt;code&gt;code-golf&lt;/code&gt; or &lt;code&gt;popularity-contest&lt;/code&gt; would be better.&lt;/p&gt;&#xA;" OwnerUserId="112929" LastActivityDate="2023-01-21T15:57:58.487" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25507" PostTypeId="2" ParentId="2140" CreationDate="2023-01-22T03:03:44.347" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257535/its-a-dog-maybe&quot;&gt;It's a dog!&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;ascii-art-container&quot;&gt;ascii-art&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;decision-problem-container&quot;&gt;decision-problem&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108687" LastEditorUserId="108687" LastEditDate="2023-02-07T02:22:27.983" LastActivityDate="2023-02-07T02:22:27.983" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25508" PostTypeId="2" ParentId="2140" CreationDate="2023-01-22T07:02:14.197" Score="2" Body="&lt;h1&gt;Enable 2char-JsFuck&lt;/h1&gt;&#xA;&lt;p&gt;Write some javascript code that allow using only 2 characters to execute all javascript code.&lt;/p&gt;&#xA;&lt;p&gt;As I can tell, these are possible chosen set:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;f`   [a-zA-Z$_]`&#xA;f;   [a-zA-Z$_][;,\n]&#xA;f.   [a-zA-Z$_]\.&#xA;[]   \[\]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Obviously, &lt;a href=&quot;https://tio.run/##y0osSyxOLsosKNHNy09J/f8/zbbYViO6IlbT1q7CXqNY29apNC0ttQgopJeTmpdekhGrqZOmaZValpijUaz5Py0hjXyQQInmQWXJQFpIdw@OgFClk22kWjMsA2EALCTeImJUUs/ZgzTZjdpGkYU0c9Kwr9qGa/IhwhYqFzwJCQn/AQ&quot; rel=&quot;nofollow noreferrer&quot;&gt;the first one&lt;/a&gt; is lot easier than the other few. Therefore, different set are not scored together.&lt;/p&gt;&#xA;&lt;p&gt;Shortest code in each (environment,chosen set) wins.&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox Notes&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any other sets? (not counting &lt;code&gt;g+&lt;/code&gt; or other variable name)&lt;/li&gt;&#xA;&lt;li&gt;Why I remember I've sandboxed this idea?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2023-01-25T03:30:20.603" LastActivityDate="2023-01-25T03:30:20.603" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25509" PostTypeId="2" ParentId="2140" CreationDate="2023-01-22T10:42:16.690" Score="3" Body="&lt;hr /&gt;&#xA;&lt;h2&gt;Definitions&lt;/h2&gt;&#xA;&lt;p&gt;A &lt;span class=&quot;math-container&quot;&gt;\$ \xi \$&lt;/span&gt;-word is defined as a string of letters such that every letter in the string appears an even number of times. For example, &lt;code&gt;aeaeccaa&lt;/code&gt; is a &lt;span class=&quot;math-container&quot;&gt;\$ \xi \$&lt;/span&gt;-word.&lt;/p&gt;&#xA;&lt;p&gt;The function &lt;span class=&quot;math-container&quot;&gt;\$ T \$&lt;/span&gt;, which operates on &lt;span class=&quot;math-container&quot;&gt;\$ \xi \$&lt;/span&gt;-words, is defined as follows:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Replace the odd-positioned (first, third, etc.) occurrences of each letter with &lt;code&gt;(&lt;/code&gt;. For the example above, this produces &lt;code&gt;((ae(c(a&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Replace all the remaining letters (i.e., those that were the even occurrences) with &lt;code&gt;)&lt;/code&gt;. For our example, this produces &lt;code&gt;(())()()&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;This will always produce a string with balanced brackets.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Take, as input, a string &lt;span class=&quot;math-container&quot;&gt;\$ i \$&lt;/span&gt;, where every letter appears exactly twice (e.g. &lt;code&gt;xffcxc&lt;/code&gt;). Note that this is a stricter condition than merely being a &lt;span class=&quot;math-container&quot;&gt;\$ \xi \$&lt;/span&gt;-word.&lt;/p&gt;&#xA;&lt;p&gt;Return the lexicographically earliest &lt;span class=&quot;math-container&quot;&gt;\$ \xi \$&lt;/span&gt;-word, such that the input and output give the same value when &lt;span class=&quot;math-container&quot;&gt;\$ T \$&lt;/span&gt; is applied to them.&lt;/p&gt;&#xA;&lt;p&gt;Hint: a linear-time algorithm is possible.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You do not need to handle an empty input&lt;/li&gt;&#xA;&lt;li&gt;Letters are ASCII lowercase (&lt;code&gt;a&lt;/code&gt; to &lt;code&gt;z&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;You may choose to operate on integers instead of strings of letters. You can use any set of integers, as long as there are at least 26 of them.&lt;/li&gt;&#xA;&lt;li&gt;You may use any &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447&quot;&gt;standard I/O method&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1061&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;todo&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Sandbox notes&lt;/h1&gt;&#xA;&lt;p&gt;At the moment, this challenge is very abstract, which I think means it will look seem quite boring (until you start to actually solve it, which I think is fun, although fairly simple). (What kind of a title is &lt;em&gt;Lexicographically earliest &lt;span class=&quot;math-container&quot;&gt;\$ T \$&lt;/span&gt;-invariant &lt;span class=&quot;math-container&quot;&gt;\$ \xi \$&lt;/span&gt;-word&lt;/em&gt;?)&lt;/p&gt;&#xA;&lt;p&gt;If you can think of a good domain to make it concrete, I think it would be much better. (Unfortunately I can't reveal the original context in which I encountered it). At the least I will probably replace the symbolic names with cute names before posting.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2023-01-31T21:34:46.390" LastActivityDate="2023-01-31T21:34:46.390" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25513" PostTypeId="2" ParentId="2140" CreationDate="2023-01-23T19:40:15.670" Score="-2" Body="&lt;h1&gt;PHPFuck Golf - Hello World&lt;/h1&gt;&#xA;&lt;p&gt;Like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/17950&quot;&gt;this&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;PHPFuck is an esoteric language in which any PHP statement can&#xA;be accurately reproduced into another valid PHP program that&#xA;uses only the 5 characters &lt;code&gt;(^.9)&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The PHPFuck converter, when given an input of &lt;code&gt;echo &amp;quot;Hello World!&amp;quot;&lt;/code&gt;,&#xA;produces a block of code that is 74,450 characters long. Because the&#xA;program used a lot of automatic conversions to create that block, I&#xA;believe that the code can be made a lot shorter using manual&#xA;optimizations.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to build a PHP program that performs the task&#xA;&lt;code&gt;echo &amp;quot;Hello World!&amp;quot;&lt;/code&gt;, using only the characters &lt;code&gt;(^.9)&lt;/code&gt;. The shortest&#xA;code to do so wins.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2023-01-23T19:46:05.510" LastActivityDate="2023-01-23T19:46:05.510" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25514" PostTypeId="2" ParentId="2140" CreationDate="2023-01-24T06:26:03.957" Score="0" Body="&lt;p&gt;A map maps keys(string) to values(string). Basic operations includes:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Set. Given a key and a value, store it.&lt;/li&gt;&#xA;&lt;li&gt;Get. Given a key, get the last value stored into this key, or &lt;code&gt;&amp;quot;&amp;quot;&lt;/code&gt;(empty string) if nothing ever stored into.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For some reason, sometimes keys looks same but need to refer to different object. Therefore, color is introduced. Provided keys is therefore splitted, and to get colored key, color each part of keys, and concat them.&lt;/p&gt;&#xA;&lt;p&gt;For example, say &lt;code&gt;a&lt;/code&gt; is colored red, then&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;a&lt;/code&gt; is &lt;span class=&quot;math-container&quot;&gt;\$\color{red}a\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;aa&lt;/code&gt; is &lt;span class=&quot;math-container&quot;&gt;\$aa\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;a a&lt;/code&gt; is &lt;span class=&quot;math-container&quot;&gt;\$\color{red}{aa}\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ab&lt;/code&gt; is &lt;span class=&quot;math-container&quot;&gt;\$ab\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;a b&lt;/code&gt; is &lt;span class=&quot;math-container&quot;&gt;\$\color{red}{a}b\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Therefore, another operation is&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Color. Given a keypart, resign its color. Color is a non-negative integer and default to 0.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Shortest code in each languages wins.&lt;/p&gt;&#xA;&lt;p&gt;Test cases&lt;/p&gt;&#xA;&#xA;&lt;pre class=&quot;lang-javascript prettyprint-override&quot;&gt;&lt;code&gt;[[GET, &amp;quot;a&amp;quot;],         // &amp;quot;&amp;quot;&#xA; [SET, &amp;quot;a&amp;quot;, &amp;quot;1&amp;quot;],&#xA; [GET, &amp;quot;a&amp;quot;],         // &amp;quot;1&amp;quot;&#xA; [COL, &amp;quot;a&amp;quot;, 1],&#xA; [GET, &amp;quot;a&amp;quot;],         // &amp;quot;&amp;quot;&#xA; [SET, &amp;quot;a bb&amp;quot;, &amp;quot;2&amp;quot;],&#xA; [GET, &amp;quot;a b b&amp;quot;],     // &amp;quot;2&amp;quot;&#xA; [COL, &amp;quot;a&amp;quot;, 0],&#xA; [GET, &amp;quot;a&amp;quot;]]         // &amp;quot;1&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2023-01-24T06:26:03.957" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25515" PostTypeId="2" ParentId="2140" CreationDate="2023-01-24T11:11:46.687" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257159/salacious-bacon-tripod&quot;&gt;Salacious Bacon Tripod&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2023-01-28T12:16:29.410" LastActivityDate="2023-01-28T12:16:29.410" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25516" PostTypeId="2" ParentId="2140" CreationDate="2023-01-24T16:12:36.800" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257870/split-some-points&quot;&gt;Split some points&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96037" LastEditorUserId="96037" LastEditDate="2023-02-15T12:53:15.173" LastActivityDate="2023-02-15T12:53:15.173" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25517" PostTypeId="2" ParentId="2140" CreationDate="2023-01-24T20:58:02.063" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257358/yakkos-new-world-order&quot;&gt;Yakko's New World Order&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2023-02-03T00:13:25.957" LastActivityDate="2023-02-03T00:13:25.957" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25518" PostTypeId="2" ParentId="2140" CreationDate="2023-01-24T21:18:49.727" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/260472/find-index-of-rational-number-in-calkin-wilf-sequence&quot;&gt;Find Index of Rational Number in Calkin-Wilf Sequence&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2023-04-26T20:56:25.557" LastActivityDate="2023-04-26T20:56:25.557" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25519" PostTypeId="2" ParentId="2140" CreationDate="2023-01-25T13:19:41.103" Score="0" Body="&lt;h1&gt;Solve the &amp;quot;/&amp;quot; puzzles from Taiji&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Spoilers for the game Taiji, it's really good you should play it&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Taiji puzzles consist of a rectangular grid, a solution consists of setting each square to either on or off:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;####&#xA;#...&#xA;##..&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;However, not every solution is correct, a puzzle can contain any number of colored slashes, here represented by numbers:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;....&#xA;1...&#xA;..1.&#xA;....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;A &lt;em&gt;shape&lt;/em&gt; is defined as a contiguous area that all has the same state. (either on or off). Areas with the same color slash must have the same shape, but it may be rotated (but &lt;strong&gt;not&lt;/strong&gt; mirrored). For example, if you have this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1..1.&#xA;.22.1&#xA;1..1.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;A solution would be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;.#.#.&#xA;##..#&#xA;.#.#.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that all 1s are a single square while both 2s are a T shape, in this case in opposite colors.&lt;/p&gt;&#xA;&lt;p&gt;Note that the number must be in the same place in every shape, so if you have this puzzle:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;.....&#xA;1..1.&#xA;.....&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This would &lt;strong&gt;Not&lt;/strong&gt; be valid:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;#..##&#xA;..##.&#xA;#..##&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Because one 1 is in the tip and the other is in the tail.&lt;/p&gt;&#xA;&lt;p&gt;If the numbers are &lt;strong&gt;different&lt;/strong&gt; the shapes &lt;strong&gt;must&lt;/strong&gt; be different. However, they count as different if the number is in a different part of the shape.&lt;/p&gt;&#xA;&lt;p&gt;A shape can contain multiple numbers. If it contains the same number twice that means the shape must be irrationally symmetric.&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is: Given a number, output a possible solution. Note: There will always be at least 2 possible solutions, since the inverse of any valid solution is also valid.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;p&gt;Note many of these have many valid solutions.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1..1.            #..#.&#xA;.22.1        --&amp;gt; ....#&#xA;1..1.            #..#.&#xA;&#xA;....              ##..&#xA;123.          --&amp;gt; #.##&#xA;....              #.##&#xA;&#xA;&#xA;...               #.#&#xA;111           --&amp;gt; #.#&#xA;...               #.#&#xA;&#xA;1.22.1            ##..##&#xA;......            ######&#xA;2....2        --&amp;gt; .####.&#xA;2....2            .####.&#xA;......            ######&#xA;1.22..            ##..##&#xA;&#xA;3....             #####&#xA;11211         --&amp;gt; ..#..&#xA;3....             #####&#xA;&#xA;....              #.#.&#xA;111.          --&amp;gt; #.#.&#xA;....              #.#.&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You may take input as a 2d list of numbers, and use any constant value to represent a cell that does not create a hint (eg. 0). For output you may also use any 2 constant values to represent on and off.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-01-25T13:28:23.747" LastActivityDate="2023-01-25T13:28:23.747" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25520" PostTypeId="2" ParentId="2447" CreationDate="2023-01-25T22:18:06.523" Score="13" Body="&lt;h1&gt;A function can output by modifying a global variable &lt;em&gt;if that variable is automatically outputted/displayed&lt;/em&gt;&lt;/h1&gt;&#xA;&lt;p&gt;It has been decided that in general, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24058&quot;&gt;functions may not output by just modifying a global variable&lt;/a&gt; because that would make it too much like a snippet, which is not allowed.&lt;/p&gt;&#xA;&lt;p&gt;But what about languages where the value of that global variable is automatically outputted? For example, say there is a language where output is stored in an &lt;code&gt;output&lt;/code&gt; string variable, and automatically displayed when the program finishes execution.&lt;/p&gt;&#xA;&lt;p&gt;For example, in Scratch, the current ruling is that output must be displayed via the &lt;code&gt;say&lt;/code&gt; block. However, in Scratch variables are shown automatically if not unchecked in the interface, just as &lt;code&gt;say&lt;/code&gt; shows output automatically if the sprite is not checked as hidden in the interface. These should be allowed interchangeably since both output a value without any extra code at the call site.&lt;/p&gt;&#xA;" OwnerUserId="108687" LastActivityDate="2023-01-25T22:18:06.523" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25521" PostTypeId="1" CreationDate="2023-01-26T15:25:34.133" Score="11" ViewCount="172" Body="&#xA;&lt;p&gt;As we say goodbye to the old year and welcome the new one, we have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/search?q=%22year+in+moderation%22+is%3Aquestion&quot;&gt;a tradition of sharing moderation stats for the preceding calendar year&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;As most of you here are aware, sites on the Stack Exchange network are moderated somewhat differently to other sites on the web:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;We designed the Stack Exchange network engine to be mostly self-regulating, in that we amortize the overall moderation cost of the system across thousands of teeny-tiny slices of effort contributed by regular, everyday users.&lt;br /&gt;&#xA;-- &lt;a href=&quot;http://blog.stackoverflow.com/2009/05/a-theory-of-moderation/&quot;&gt;A Theory of Moderation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;That doesn't eliminate the need for having &lt;a href=&quot;https://stackoverflow.blog/2018/11/21/our-theory-of-moderation-re-visited/&quot;&gt;moderators&lt;/a&gt; altogether, but it does mean that the bulk of moderation work is carried out by regular folks. Every bit of time and effort y'all contribute to the site gives you access to more privileges you can use to help in this effort, all of which produce a cumulative effect that makes a big difference.&lt;/p&gt;&#xA;&lt;p&gt;So as we say goodbye to 2022 (and where did January go, right?) and dive head first into 2023, let us look back at what we accomplished as a community... by looking at some &lt;a href=&quot;https://i.stack.imgur.com/V0TPg.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;exciting&lt;/em&gt; stats&lt;/a&gt;. Below is a breakdown of moderation actions performed on Code Golf over the past 12 months:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th style=&quot;text-align: left;&quot;&gt;Action&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;Moderators&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;Community¹&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;All comments on a post moved to chat&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;4&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Answer flags handled&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;510&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;187&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Answers flagged&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;31&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;680&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Bounties canceled&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;2&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Comment flags handled&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;604&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1,135&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Comments deleted⁷&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1,957&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;4,579&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Comments flagged&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1,738&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Comments undeleted&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;71&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Escalations to the Community Manager team&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;3&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Posts bumped&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;11&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Posts deleted⁶&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;284&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1,161&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Posts locked&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;78&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Posts undeleted&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;25&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;378&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Posts unlocked&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;2&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Question flags handled⁵&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;218&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;331&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions closed&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;117&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;189&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions flagged⁵&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;51&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;510&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions protected&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;8&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions reopened&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;12&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;31&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions unprotected&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;9&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Revisions redacted&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;4&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tag synonyms created&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;2&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tag synonyms proposed&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;3&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tags merged&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;2&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁴: &amp;quot;Close votes&amp;quot; queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;83&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;500&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁴: &amp;quot;First answers&amp;quot; queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;58&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;585&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁴: &amp;quot;First questions&amp;quot; queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;17&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;163&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁴: &amp;quot;Late answers&amp;quot; queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;46&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;219&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁴: &amp;quot;Low quality posts&amp;quot; queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;29&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;249&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁴: &amp;quot;Reopen votes&amp;quot; queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;40&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;154&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁴: &amp;quot;Suggested edits&amp;quot; queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;76&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;728&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Users contacted&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;6&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Users deleted&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;2&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Users destroyed³&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;40&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Users suspended²&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;3&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;24&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;h3&gt;Footnotes&lt;/h3&gt;&#xA;&lt;p&gt;¹ &amp;quot;Community&amp;quot; here refers both to &lt;a href=&quot;https://codegolf.stackexchange.com/users&quot;&gt;the membership of Code Golf&lt;/a&gt; &lt;em&gt;without&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=moderators&quot;&gt;diamonds next to their names&lt;/a&gt;, and to the automated systems otherwise known as &lt;a href=&quot;https://codegolf.stackexchange.com/users/-1&quot;&gt;user #-1&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;² The system will suspend users under three circumstances: when a user is recreated after being previously suspended, when a user is recreated after being destroyed for spam or abuse, and when a network-wide suspension is in effect on an account.&lt;/p&gt;&#xA;&lt;p&gt;³ A &amp;quot;destroyed&amp;quot; user is deleted along with all that they had posted: questions, answers, comments. &lt;a href=&quot;https://meta.stackexchange.com/questions/88994/what-is-the-difference-between-a-deleted-user-and-a-destroyed-user&quot;&gt;Generally used as an expedient way of getting rid of spam.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;⁴ This counts every review that was submitted (not skipped) - so the 2 suggested edits reviews needed to approve an edit would count as 2, the goal being to indicate the frequency of moderation actions. This also applies to flags, etc.&lt;/p&gt;&#xA;&lt;p&gt;⁵ Includes close flags (but &lt;em&gt;not&lt;/em&gt; close or reopen votes). Community can handle these flags by at least one person voting to close a question that has a close flag.&lt;/p&gt;&#xA;&lt;p&gt;⁶ This ignores numerous deletions that happen automatically in response to some other action.&lt;/p&gt;&#xA;&lt;p&gt;⁷ This includes comments deleted by their own authors (which also account for some number of handled comment flags).&lt;/p&gt;&#xA;&lt;h3&gt;Further reading:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Wanna see how these numbers have changed over time? We posted a similar report here last year: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24273/2021-a-year-in-moderation&quot;&gt;2021: a year in moderation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can also check out &lt;a href=&quot;https://stackexchange.com/search?q=title%3A%222022%3A+a+year+in+moderation%22&quot;&gt;this report on other sites&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Or peruse &lt;a href=&quot;https://meta.stackexchange.com/q/386090/208518&quot;&gt;detailed information on the number of questions closed and reopened across all sites&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Wishing everyone a happy 2023! ^_^&lt;/p&gt;&#xA;" OwnerUserId="38734" LastEditorUserId="66833" LastEditDate="2023-01-27T01:08:31.363" LastActivityDate="2023-01-27T01:08:31.363" Title="2022: a year in moderation" Tags="|discussion|moderation|statistics|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25522" PostTypeId="2" ParentId="2140" CreationDate="2023-01-26T17:41:59.853" Score="0" Body="&lt;h1&gt;Optimize your score on a biased multiple choice test&lt;/h1&gt;&#xA;&lt;p&gt;In a multiple choice test, sometimes, by chance, multiple questions in a row will have the same answer. Some of my teachers dislike this, and will change questions to ensure there are never more than &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; of the same answer in a row.&lt;/p&gt;&#xA;&lt;p&gt;In this challenge, for each question in a test, you'll be given a set of four confidence values from &lt;code&gt;0&lt;/code&gt; to &lt;code&gt;1&lt;/code&gt;, which sum to &lt;code&gt;1&lt;/code&gt;. These represent the odds of each choice being correct (for example, &lt;code&gt;[0.1, 0.6, 0.2, 0.1]&lt;/code&gt; if you're 60% sure that B is correct, 20% sure C is correct, and 10% sure either of the others could be right). You'll also be given a positive integer &lt;code&gt;n&lt;/code&gt;, the maximum number of same-answer questions in a row.&lt;/p&gt;&#xA;&lt;p&gt;Given this information, you must output the set of answers that would give you the highest estimated score.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2023-01-26T17:41:59.853" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25523" PostTypeId="2" ParentId="2140" CreationDate="2023-01-27T02:23:57.837" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257057/pushing-boxes-away&quot;&gt;Pushing boxes away&lt;/a&gt; but &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;fastest-algorithm-container&quot;&gt;fastest-algorithm&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;I'll accept first fastest algorithm and then this challenge turns into &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;restricted-complexity-container&quot;&gt;restricted-complexity&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox Notes&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Some options are listed in comment&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2023-01-27T02:23:57.837" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25524" PostTypeId="2" ParentId="2140" CreationDate="2023-01-27T08:25:19.730" Score="1" Body="&lt;h1&gt;Output code to sort a list without looping &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;restricted-source-container&quot;&gt;restricted-source&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Given a integer &lt;code&gt;n&lt;/code&gt;, output the source code for a program or function that can sort a list of &lt;code&gt;n&lt;/code&gt; elements without looping. For any &lt;code&gt;n&lt;/code&gt; there are a finite number of possible orderings so this has to be possible.&lt;/p&gt;&#xA;&lt;p&gt;Looping includes any way to run code a variable number of times. It also includes recursion or using any built-ins that internally loop. (including your sort builtin) Branching is ok.&lt;/p&gt;&#xA;&lt;p&gt;The code you submit may have loops, just the code outputted may not.&lt;/p&gt;&#xA;&lt;p&gt;The lists you sort will be positive integers in the range &lt;span class=&quot;math-container&quot;&gt;\$ 1 \leq n \leq 2^{16} - 1\$&lt;/span&gt;. Note 0 is excluded. The list may contain duplicate elements.&lt;/p&gt;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;N&lt;/th&gt;&#xA;&lt;th&gt;Possible Output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;1&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;|x:&amp;amp;mut[u16;1]|()&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;2&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;|x:&amp;amp;mut[u16;2]|*x=if x[1]&amp;gt;x[0]{[x[0],x[1]]}else{[x[1],x[0]]}&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;Note the program you output can be as long as you like, your score is only the length of the program that generates the sorting function.&lt;/p&gt;&#xA;&lt;p&gt;The program you output may be in a different language then the generating program, in this case list both languages in your header. Both may use any IO format from our standard input/output methods list.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2023-01-27T08:25:19.730" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25525" PostTypeId="1" AcceptedAnswerId="25526" CreationDate="2023-01-30T12:49:27.137" Score="11" ViewCount="117" Body="&lt;p&gt;I made a &lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits/67045&quot;&gt;suggestion&lt;/a&gt; (which was rejected) for this &lt;a href=&quot;https://codegolf.stackexchange.com/a/124047/116593&quot;&gt;answer&lt;/a&gt; but just because of that &lt;a href=&quot;https://codegolf.stackexchange.com/users/69583/justin-mariner&quot;&gt;user&lt;/a&gt; &amp;quot;Last seen more than 3 years ago&amp;quot; (at the time of posting this question)&lt;/p&gt;&#xA;&lt;p&gt;I know that it is bad idea to edit someone's answer here, but what if user they aren't active anymore? In this situation, I believe that the comment is useless and may be deleted in the future by the system or a moderator.&lt;/p&gt;&#xA;&lt;p&gt;Should I post my answer with the almost the same code just with fewer bytes?&lt;/p&gt;&#xA;" OwnerUserId="116593" LastEditorUserId="66833" LastEditDate="2023-02-02T14:25:56.000" LastActivityDate="2023-02-02T14:25:56.000" Title="Suggestion/Edit for answers if user &quot;Last seen more than X years ago&quot;" Tags="|support|editing|comments|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25526" PostTypeId="2" ParentId="25525" CreationDate="2023-01-30T13:11:49.793" Score="18" Body="&lt;p&gt;You should post your new answer and link to the original.&lt;/p&gt;&#xA;&lt;p&gt;It perfectly fine, even when the OP is active, to post your golf as a separate answer. You don't need any further reason to do so.&lt;/p&gt;&#xA;&lt;p&gt;A full answer can also give you the opportunity to explain your changes more completely, which can be nice.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="91213" LastEditDate="2023-01-30T13:20:51.803" LastActivityDate="2023-01-30T13:20:51.803" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25527" PostTypeId="2" ParentId="2140" CreationDate="2023-01-31T15:06:11.093" Score="3" Body="&lt;h2&gt;Infinite Apple Dilemma&lt;/h2&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257649/infinite-apple-dilemma&quot;&gt;Posted here&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96037" LastEditorUserId="96037" LastEditDate="2023-02-10T16:22:47.543" LastActivityDate="2023-02-10T16:22:47.543" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25528" PostTypeId="2" ParentId="2140" CreationDate="2023-01-31T17:08:30.480" Score="2" Body="&lt;h1&gt;Output a random value from the last 16 values outputted &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;random-container&quot;&gt;random&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Output the numbers 1-16 (or any other set of 16 distinct items). Then, repeatedly, output a random value chosen uniformly from the last 16 items outputted.&lt;/p&gt;&#xA;&lt;p&gt;After the same item is printed 16 times in a row or more, halt.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2023-01-31T17:08:30.480" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25529" PostTypeId="2" ParentId="2140" CreationDate="2023-01-31T17:25:00.230" Score="0" Body="&lt;h1&gt;A randomly colored walk&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;random-container&quot;&gt;random&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/color&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;color&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;color&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;color-container&quot;&gt;color&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given two inputs, a distance &lt;span class=&quot;math-container&quot;&gt;\$d\$&lt;/span&gt; and a number &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; output &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; random colors which each have distance &lt;span class=&quot;math-container&quot;&gt;\$d\$&lt;/span&gt; from the previous.&lt;/p&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.wikipedia.org/wiki/Random_walk&quot; rel=&quot;nofollow noreferrer&quot;&gt;random walk&lt;/a&gt; is a path which is defined by choosing a random direction and (usually) fixed distance to go at each step. We will be taking a random walk through the RGB color space using &lt;a href=&quot;https://en.wikipedia.org/wiki/Euclidean_distance&quot; rel=&quot;nofollow noreferrer&quot;&gt;Euclidean distance&lt;/a&gt; as our metric.&lt;/p&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;For this challenge you will take two inputs, &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$d\$&lt;/span&gt;. Let &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; be the number of colors to output, this will always be an integer &lt;span class=&quot;math-container&quot;&gt;\$1 \leq n\$&lt;/span&gt;, and &lt;span class=&quot;math-container&quot;&gt;\$d\$&lt;/span&gt; be the distance between consecutive elements, which will always be &lt;span class=&quot;math-container&quot;&gt;\$0 \leq d \leq 128\$&lt;/span&gt;. You may additionally assume that &lt;span class=&quot;math-container&quot;&gt;\$d\$&lt;/span&gt; is an integer.&lt;/p&gt;&#xA;&lt;p&gt;For each consecutive pair of elements &lt;span class=&quot;math-container&quot;&gt;\$(r_1, g_1, b_1), (r_2, g_2, b_2)\$&lt;/span&gt; of the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; element sequence output, it must be the case that all values are between 0 and 255 inclusive (or &lt;span class=&quot;math-container&quot;&gt;\$[0,256)\$&lt;/span&gt; for floats), and the distance between elements must be within 1 of d, that is &lt;span class=&quot;math-container&quot;&gt;\$|\sqrt{(r_1-r_2)^2+(g_1-g_2)^2+(b_1-b_2)^2} - d| &amp;lt; 1\$&lt;/span&gt;. This should allow one to restrict their output to integers if they so choose. The walk need not be uniform, but it does need to be random. The starting point of the walk should be random as well.&lt;/p&gt;&#xA;&lt;p&gt;Standard i/o rules apply, input and output can be in any reasonable format. Graphical output is allowed (and encouraged, though I doubt it will be golfy to do so) so long as the order of the sequence is clear.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;For these test cases input is in the order &lt;span class=&quot;math-container&quot;&gt;\$n,d\$&lt;/span&gt; and output is &lt;span class=&quot;math-container&quot;&gt;\$(r, g, b)\$&lt;/span&gt; as integers. These are some possible results.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;5, 5 -&amp;gt; (81, 60, 243), (81, 57, 239), (76, 60, 240), (80, 62, 241), (84, 60, 243)&#xA;4, 10 -&amp;gt; (163, 89, 77), (162, 83, 85), (166, 75, 79), (166, 82, 87)&#xA;4, 50 -&amp;gt; (212, 36, 232), (247, 1, 239), (220, 44, 243), (217, 81, 209)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="73054" LastActivityDate="2023-01-31T17:25:00.230" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25530" PostTypeId="2" ParentId="2140" CreationDate="2023-01-31T18:32:32.323" Score="1" Body="&lt;h1&gt;Toggle my Comments &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/comments&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;comments&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;comments&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;comments-container&quot;&gt;comments&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/self-referential&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;self-referential&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;self-referential&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;self-referential-container&quot;&gt;self-referential&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Write a program which takes a string as input. If the string is a syntactically valid comment in the program's language, the program must output an uncommented version of the string. Otherwise, it must output a syntactically valid commented version. Programs may use either multiline or single-line comments. Languages that do not support comments may not compete.&lt;/p&gt;&#xA;&lt;h3&gt;Python example&lt;/h3&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;Input: spaghetti&#xA;Possible output: #spaghetti&#xA;Possible output: # spaghetti&#xA;&#xA;Input: # spaghetti&#xA;Output: spaghetti&#xA;&#xA;Input: #spaghetti&#xA;Output: spaghetti&#xA;&lt;span class=&quot;math-container&quot;&gt;```&lt;/span&gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="108218" LastActivityDate="2023-01-31T18:32:32.323" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25531" PostTypeId="1" AcceptedAnswerId="25545" CreationDate="2023-02-01T20:34:33.947" Score="25" ViewCount="204" Body="&lt;p&gt;As discussed &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/62880550#62880550&quot;&gt;in chat&lt;/a&gt;, Best Of 2022 has had a serious lack of nominations, with currently 4 of the 16 categories &lt;em&gt;still&lt;/em&gt; uncontested.&lt;/p&gt;&#xA;&lt;p&gt;So that this dosen't happen next year, I'd like to propose a change for Best Of 2023:&lt;/p&gt;&#xA;&lt;p&gt;Open nominations about now instead of in January next year, but then open voting as usual at the start of 2024.&lt;/p&gt;&#xA;&lt;p&gt;This will allow nominations to trickle in throughout the year, as and when people notice worthy posts. This way, we hopefully won't have such a problem with a lack of nominations, because people won't have to successfully remember and/or find good posts long after they were posted.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="56656" LastEditDate="2023-02-09T14:18:42.357" LastActivityDate="2023-02-09T14:18:42.357" Title="Change the nominations process for Best Of 2023" Tags="|discussion|status-completed|best-of|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25532" PostTypeId="2" ParentId="2140" CreationDate="2023-02-02T13:45:55.587" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257495/reverse-the-polyglot-change-the-language&quot;&gt;Reverse the polyglot, change the language.&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="114970" LastEditorUserId="114970" LastEditDate="2023-02-17T20:20:57.023" LastActivityDate="2023-02-17T20:20:57.023" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25533" PostTypeId="2" ParentId="2140" CreationDate="2023-02-02T20:14:29.957" Score="-1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257483/sum-numbers-which-are-string&quot;&gt;Sum of numbers of arbitrary length&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="116593" LastEditorUserId="116593" LastEditDate="2023-02-13T10:13:39.230" LastActivityDate="2023-02-13T10:13:39.230" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25534" PostTypeId="2" ParentId="2140" CreationDate="2023-02-04T13:48:33.850" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/257458/114446&quot;&gt;Sum of Consecutive Squares&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="114446" LastEditorUserId="114446" LastEditDate="2023-02-05T15:39:04.473" LastActivityDate="2023-02-05T15:39:04.473" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25535" PostTypeId="2" ParentId="2140" CreationDate="2023-02-06T08:11:33.283" Score="1" Body="&lt;h1&gt;Toggle Hangul Vowel Harmony&lt;/h1&gt;&#xA;&lt;p&gt;(This post is partly &lt;a href=&quot;https://codegolf.stackexchange.com/q/194010/89459&quot;&gt;self-plagiarized&lt;/a&gt;.)&lt;/p&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Given a Hangul syllable, toggle its vowel harmony.&lt;/p&gt;&#xA;&lt;h2&gt;Introduction to Hangul syllables&lt;/h2&gt;&#xA;&lt;p&gt;Hangul(한글) is the Korean writing system invented by Sejong the Great. Hangul syllables are allocated in Unicode point U+AC00 – U+D7A3. A Hangul syllable consists of an initial consonant, a vowel, and an optional final consonant.&lt;/p&gt;&#xA;&lt;p&gt;The initial consonants are:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ㄱ ㄲ ㄴ ㄷ ㄸ ㄹ ㅁ ㅂ ㅃ ㅅ ㅆ ㅇ ㅈ ㅉ ㅊ ㅋ ㅌ ㅍ ㅎ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The vowels are:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ㅏ ㅐ ㅑ ㅒ ㅓ ㅔ ㅕ ㅖ ㅗ ㅘ ㅙ ㅚ ㅛ ㅜ ㅝ ㅞ ㅟ ㅠ ㅡ ㅢ ㅣ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The final consonants are:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(none) ㄱ ㄲ ㄳ ㄴ ㄵ ㄶ ㄷ ㄹ ㄺ ㄻ ㄼ ㄽ ㄾ ㄿ ㅀ ㅁ ㅂ ㅄ ㅅ ㅆ ㅇ ㅈ ㅊ ㅋ ㅌ ㅍ ㅎ&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For example, &lt;code&gt;뷁&lt;/code&gt; has initial consonant &lt;code&gt;ㅂ&lt;/code&gt;, vowel &lt;code&gt;ㅞ&lt;/code&gt;, and final consonant &lt;code&gt;ㄺ&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;South Korean dictionary order&lt;/h2&gt;&#xA;&lt;p&gt;The consonants and vowels above are sorted in South Korean dictionary order. The syllables are firstly sorted by initial consonants, secondly by vowels, and finally by (optional) final consonants.&lt;/p&gt;&#xA;&lt;p&gt;The Unicode block for Hangul syllables contains every consonant/vowel combinations, and is entirely sorted in South Korean dictionary order.&lt;/p&gt;&#xA;&lt;p&gt;The Unicode block can be seen &lt;a href=&quot;https://www.unicode.org/charts/PDF/UAC00.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;here,&lt;/a&gt; and the first 256 characters are shown for illustrative purpose:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;가각갂갃간갅갆갇갈갉갊갋갌갍갎갏감갑값갓갔강갖갗갘같갚갛개객갞갟갠갡갢갣갤갥갦갧갨갩갪갫갬갭갮갯갰갱갲갳갴갵갶갷갸갹갺갻갼갽갾갿걀걁걂걃걄걅걆걇걈걉걊걋걌걍걎걏걐걑걒걓걔걕걖걗걘걙걚걛걜걝걞걟걠걡걢걣걤걥걦걧걨걩걪걫걬걭걮걯거걱걲걳건걵걶걷걸걹걺걻걼걽걾걿검겁겂것겄겅겆겇겈겉겊겋게겍겎겏겐겑겒겓겔겕겖겗겘겙겚겛겜겝겞겟겠겡겢겣겤겥겦겧겨격겪겫견겭겮겯결겱겲겳겴겵겶겷겸겹겺겻겼경겾겿곀곁곂곃계곅곆곇곈곉곊곋곌곍곎곏곐곑곒곓곔곕곖곗곘곙곚곛곜곝곞곟고곡곢곣곤곥곦곧골곩곪곫곬곭곮곯곰곱곲곳곴공곶곷곸곹곺곻과곽곾곿&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Vowel Harmony&lt;/h2&gt;&#xA;&lt;p&gt;Korean vowels express &lt;strong&gt;vowel harmony&lt;/strong&gt; as positive-negative pairs. They're paired like the followings:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(Positive) - (Negative)&#xA;ㅏ - ㅓ&#xA;ㅐ - ㅔ&#xA;ㅑ - ㅕ&#xA;ㅒ - ㅖ&#xA;ㅗ - ㅜ&#xA;ㅘ - ㅝ&#xA;ㅙ - ㅞ&#xA;ㅚ - ㅟ&#xA;ㅛ - ㅠ&#xA;(ㅡ, ㅢ, and ㅣ lack counterparts)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;뷁&lt;/code&gt; → &lt;code&gt;봵&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;냥&lt;/code&gt; → &lt;code&gt;녕&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;멍&lt;/code&gt; → &lt;code&gt;망&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;망&lt;/code&gt; → &lt;code&gt;멍&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;잌&lt;/code&gt; → &lt;code&gt;잌&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="89459" LastActivityDate="2023-02-06T08:11:33.283" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25536" PostTypeId="2" ParentId="2140" CreationDate="2023-02-07T01:30:54.700" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/259633&quot;&gt;Make a Custom Bayer Matrix&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91262" LastEditorUserId="91262" LastEditDate="2023-04-01T14:07:25.737" LastActivityDate="2023-04-01T14:07:25.737" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25537" PostTypeId="2" ParentId="2447" CreationDate="2023-02-07T05:43:29.250" Score="9" Body="&lt;h2&gt;Infinite lists / generators / iterators may be taken as indexing functions&lt;/h2&gt;&#xA;&lt;p&gt;An infinite list / generator / iterator may be taken as a function that indexes into the value.&lt;/p&gt;&#xA;&lt;p&gt;For example, if taking the infinite list of fibonacci numbers &lt;code&gt;[1, 1, 2, 3, 5, 8]&lt;/code&gt; you may instead take a function that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When given 0, returns 1&lt;/li&gt;&#xA;&lt;li&gt;When given 1, returns 1&lt;/li&gt;&#xA;&lt;li&gt;When given 2, returns 2&lt;/li&gt;&#xA;&lt;li&gt;When given 3, returns 3&lt;/li&gt;&#xA;&lt;li&gt;When given 4, returns 5&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;etc.&lt;/p&gt;&#xA;" OwnerUserId="100664" LastActivityDate="2023-02-07T05:43:29.250" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25541" PostTypeId="1" CreationDate="2023-02-08T11:23:41.533" Score="10" ViewCount="407" Body="&lt;h3&gt;Update&lt;/h3&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/25604&quot;&gt;Nominations are now open!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;If you want to submit any more categories throughout the year, until the last few weeks of the year, you can still do so by answering this question. If a category here gains net score &amp;gt; 3, I will add it as a category accepting nominations.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;After &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/25531&quot;&gt;good meta consensus&lt;/a&gt; with only some  minor and fixable problems, the &lt;em&gt;Best Of CGCC&lt;/em&gt; nominations process is changing for 2023.&lt;/p&gt;&#xA;&lt;p&gt;In this thread, we'll consolidate the categories for our Best Posts for 2023, and then we'll open nominations for posts in each category. Nominations will remain open throughout the year, and voting will be in the first week of January 2024. Unlike in previous years, in this thread, we are only looking for categories, not bounties (yet). Bounties can be offered to reward the winners in those categories at the same time voting goes live.&lt;/p&gt;&#xA;&lt;p&gt;Please nominate categories as answers to this question. Each answer should contain a category to classify exceptional posts from 2023 (e.g. Best Mathematical Insight or Rookie of the Year). The top-voted categories will then receive separate nomination posts to find the actual winners. Like previous years, I'm not going to state a fixed number of categories that will make it, but it's probably going to be between 5 and 15, which is what we've usually gone with in previous years.&lt;/p&gt;&#xA;&lt;p&gt;Feel free to resubmit categories from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/25424&quot;&gt;last year&lt;/a&gt; or &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/tagged/best-of&quot;&gt;previous years&lt;/a&gt;, regardless of whether they were among the final selected categories or not.&lt;/p&gt;&#xA;&lt;p&gt;Voting on categories should last around 2 weeks, but this is by no means a hard limit, and we'll be happy to extend it further if new category suggestions are still incoming.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="66833" LastEditDate="2023-04-21T19:29:31.993" LastActivityDate="2023-12-26T15:35:50.290" Title="Best of CGCC 2023 - Call for categories" Tags="|discussion|best-of|" AnswerCount="12" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25542" PostTypeId="2" ParentId="25541" CreationDate="2023-02-08T11:29:24.287" Score="8" Body="&lt;h1&gt;Most diverse challenge&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25437&quot;&gt;repost from 2022&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Often, there is one real algorithm to solve a challenge that is competetive. Maybe very esoteric or specialized languages need a different approach, but mostly, every answer is just a translation of the others.&lt;/p&gt;&#xA;&lt;p&gt;This award is for challenges with no clear single approach where very different algorithms can be competitive. These are the most fun to solve, since you can't just translate other answers but need to carefully consider which approach to take, or even to invent a new one.&lt;/p&gt;&#xA;&lt;p&gt;This prize is intended specifically for &lt;em&gt;challenges&lt;/em&gt; where:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are either many approaches or just a few that are very different&lt;/li&gt;&#xA;&lt;li&gt;All of which are competitive&lt;/li&gt;&#xA;&lt;li&gt;Even in the same/similar languages&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="97857" LastEditDate="2023-02-09T08:11:32.500" LastActivityDate="2023-02-09T08:11:32.500" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25543" PostTypeId="2" ParentId="2140" CreationDate="2023-02-08T14:26:26.043" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257650/determine-the-octet-duplet-18-electron-rule&quot;&gt;Determine the Octet(/Duplet/18-electron) Rule&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;integer-container&quot;&gt;integer&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chemistry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chemistry&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;chemistry&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;chemistry-container&quot;&gt;chemistry&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2023-02-10T16:27:11.920" LastActivityDate="2023-02-10T16:27:11.920" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25544" PostTypeId="2" ParentId="25541" CreationDate="2023-02-08T16:18:44.033" Score="5" Body="&lt;h1&gt;Best sequel&lt;/h1&gt;&#xA;&lt;p&gt;Originality is great, we love challenges that provide a new fresh take on things. But sometimes unoriginal ideas are just as good. This award is for challenges that take the ideas of an earlier challenge (by the same or different author) and improve on them or twist them in a new and interesting way.&lt;/p&gt;&#xA;&lt;p&gt;Nominations should include both the challenge being nominated and any &amp;quot;prequels&amp;quot; to help give context.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2023-02-08T16:18:44.033" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25545" PostTypeId="2" ParentId="25531" CreationDate="2023-02-08T19:11:48.147" Score="5" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;With only minor and fixable problems, this has been done: see &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/25541&quot;&gt;Best of CGCC 2023 - Call for categories&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2023-02-08T19:11:48.147" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25546" PostTypeId="2" ParentId="2140" CreationDate="2023-02-08T20:43:31.923" Score="2" Body="&lt;h1&gt;Avoid the hole &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/open-ended-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;open-ended-function-container&quot;&gt;open-ended-function&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://imgs.xkcd.com/comics/coordinate_plane_closure.png&quot; alt=&quot;xkcd&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a continuous black-box function as a input, output a different continuous, differentiable function that never enters the box &lt;span class=&quot;math-container&quot;&gt;\$ 1.5 \leq x \leq 2 \wedge 1 \leq y \leq 1.5 \$&lt;/span&gt;. Your output must exactly match the input function when &lt;span class=&quot;math-container&quot;&gt;\$ x \leq 0 \vee 3 \leq x \$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The output must be continuous. You may assume the input function is continous, and defined over all &lt;span class=&quot;math-container&quot;&gt;\$ \mathbb{R} \$&lt;/span&gt;. The function you output must also be defined over all &lt;span class=&quot;math-container&quot;&gt;\$ \mathbb{R} \$&lt;/span&gt;. Both functions must also be differentiable, meaning their derivative is defined everywhere.&lt;/p&gt;&#xA;&lt;p&gt;You may optionally take the derivative of the input function as a second input.&lt;/p&gt;&#xA;&lt;p&gt;You may assume your languages float type has infinite precision and all operations on it are exact.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="76323" LastEditDate="2023-02-10T08:45:32.080" LastActivityDate="2023-02-10T08:45:32.080" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="25547" PostTypeId="2" ParentId="25541" CreationDate="2023-02-08T21:43:02.660" Score="4" Body="&lt;h1&gt;Best Explanation&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25431/16766&quot;&gt;2022&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24248/108218&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20601/66833&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18451/66833&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17315/66833&quot;&gt;2018&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14512/66833&quot;&gt;2017&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10940/66833&quot;&gt;2016&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This category is for the answer with the best explanation accompanying it. Ideally, the winner will be an answer with a very detailed explanation that is accessible to anyone, regardless of the amount of relevant knowledge already possessed.&lt;/p&gt;&#xA;" OwnerUserId="16766" LastActivityDate="2023-02-08T21:43:02.660" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25548" PostTypeId="2" ParentId="2140" CreationDate="2023-02-08T21:49:12.660" Score="3" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/260284/add-two-real-numbers-probably&quot;&gt;Add two real numbers ... probably&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2023-04-19T19:10:15.843" LastActivityDate="2023-04-19T19:10:15.843" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25549" PostTypeId="2" ParentId="25541" CreationDate="2023-02-09T00:56:30.350" Score="6" Body="&lt;h1&gt;Wild card&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24231/20260&quot;&gt;Repost from 2021&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For a deserving challenge, answer, or user that isn't a good fit for any of the other categories.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2023-02-09T00:56:30.350" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25550" PostTypeId="2" ParentId="25541" CreationDate="2023-02-09T07:15:42.160" Score="4" Body="&lt;h2&gt;Wrong tool for the job&lt;/h2&gt;&#xA;&lt;p&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17321/9288&quot;&gt;2018&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24243/91213&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25433/91213&quot;&gt;2022&lt;/a&gt;, but rephrased significantly&lt;/p&gt;&#xA;&lt;p&gt;Technically, every turing complete language should be able to solve every problem. In practice though, some problems are really hard in particular languages and are thus rarely used. While you can, for example, invent multiplication in a language that doesn't have it, it's a lot of effort for little benefit.&lt;/p&gt;&#xA;&lt;p&gt;However, some brave souls are not afraid of a challenge. They'll solve &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;array-container&quot;&gt;array&lt;/a&gt; challenges in languages that lack arrays. They'll solve &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;random-container&quot;&gt;random&lt;/a&gt; challenges in languages lacking a easy to use RNG. This category of for them. Those who don't care about spending a while day solving a challenge that would be &amp;lt;100 bytes of python.&lt;/p&gt;&#xA;&lt;p&gt;In short, this answer is for challenges that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Solve a challenge in a language that's lacking the basic features that would normally be used for this type of challenge&lt;/li&gt;&#xA;&lt;li&gt;This could be because the language has a specific weakness or because it's just really hard to use for all problems&lt;/li&gt;&#xA;&lt;li&gt;Is still a good attempt to improve the score, within the limits of the language.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2023-02-09T07:15:42.160" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25551" PostTypeId="2" ParentId="25541" CreationDate="2023-02-09T07:24:55.030" Score="5" Body="&lt;h1&gt;Slowest Gun in the East&lt;/h1&gt;&#xA;&lt;p&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25439/91213&quot;&gt;2022&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24230/52210&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17320/52210&quot;&gt;2018&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14521/52210&quot;&gt;2017&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10988/52210&quot;&gt;2016&lt;/a&gt;,&lt;/p&gt;&#xA;&lt;p&gt;There are a lot of really good old questions on this site. Unfortunatly, new answers to them tend to gain very little votes or interaction compared with answers to new challenges.&lt;/p&gt;&#xA;&lt;p&gt;This category is for underappreciated new answers to challenges where the last interaction was at least 1 year before the post was made.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1706336/2023-slowest-gun-in-the-east&quot; rel=&quot;nofollow noreferrer&quot;&gt;SGITE 2023 query.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2023-02-09T07:24:55.030" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25552" PostTypeId="2" ParentId="2140" CreationDate="2023-02-09T16:01:28.167" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257631/time-to-shortest-transposition&quot;&gt;Time to shortest transposition&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110681" LastEditorUserId="110681" LastEditDate="2023-02-10T09:06:28.503" LastActivityDate="2023-02-10T09:06:28.503" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="25553" PostTypeId="2" ParentId="2140" CreationDate="2023-02-09T17:29:19.830" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257683/generate-an-emoticon&quot;&gt;Generate an emoticon&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108622" LastEditorUserId="108622" LastEditDate="2023-02-11T08:37:56.373" LastActivityDate="2023-02-11T08:37:56.373" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25554" PostTypeId="2" ParentId="25541" CreationDate="2023-02-09T17:54:10.070" Score="4" Body="&lt;h1&gt;Rookie of the Year - Challenges&lt;/h1&gt;&#xA;&lt;p&gt;Repost of &lt;a href=&quot;/a/25426/114446&quot;&gt;2022&lt;/a&gt;, &lt;a href=&quot;/a/24228/100664&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;/a/20589/66833&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;/a/18437/66833&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;/a/17318/85052&quot;&gt;2018&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For the best challenge written by someone who has not written a challenge prior to 2023.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1706436/2023-challenges-by-users-with-no-challenges-before-2023&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE query&lt;/a&gt; (modified from 2022)&lt;/p&gt;&#xA;" OwnerUserId="114446" LastActivityDate="2023-02-09T17:54:10.070" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25555" PostTypeId="2" ParentId="25541" CreationDate="2023-02-09T17:55:38.633" Score="5" Body="&lt;h1&gt;Rookie of the Year - Answers&lt;/h1&gt;&#xA;&lt;p&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25428/114446&quot;&gt;2022&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24235/100664&quot;&gt;2021&lt;/a&gt; and other years.&lt;/p&gt;&#xA;&lt;p&gt;For the best answer written by a new user in 2023. This doesn't have to be a user who created their account in 2023 - rather, this is for any answer posted by a user in 2023 where that answer was that user's first answer on the site.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1706435/2023-answers-by-users-with-no-answers-before-2023&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE query&lt;/a&gt; (modified from 2022)&lt;/p&gt;&#xA;" OwnerUserId="114446" LastActivityDate="2023-02-09T17:55:38.633" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25556" PostTypeId="2" ParentId="2140" CreationDate="2023-02-10T00:29:03.157" Score="-2" Body="&lt;h1&gt;Polishing off a Sudoku&lt;/h1&gt;&#xA;&lt;p&gt;Given a set of 8 numbers as input, output the missing one.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;&lt;code&gt;12346789&lt;/code&gt; -&amp;gt; &lt;code&gt;5&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;94351726&lt;/code&gt; -&amp;gt; &lt;code&gt;8&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="87594" LastActivityDate="2023-02-10T00:29:03.157" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25557" PostTypeId="2" ParentId="2140" CreationDate="2023-02-10T01:38:41.230" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257803/how-to-find-the-counterfeit-coin&quot;&gt;How to find the counterfeit coin?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="116593" LastEditorUserId="116593" LastEditDate="2023-02-14T09:27:18.333" LastActivityDate="2023-02-14T09:27:18.333" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25558" PostTypeId="2" ParentId="2140" CreationDate="2023-02-10T07:32:42.743" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257752/print-all-pandigital-numbers&quot;&gt;Print all pandigital numbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-02-13T12:58:36.457" LastActivityDate="2023-02-13T12:58:36.457" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25559" PostTypeId="2" ParentId="2140" CreationDate="2023-02-10T21:31:48.197" Score="1" Body="&lt;p&gt;An address is decoded as follow:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;   reg eax ecx edx ebx esp ebp esi edi  0  sib&#xA;    id  0   1   2   3   4   5   6   7   -   -&#xA;+0      00  01  02  03  /   /   06  07  /   04&#xA;+imm8   40  41  42  43  /   45  46  47  /   44&#xA;+imm32  80  81  82  83  /   85  86  87  05  84&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;where sib means the following byte parsed as follow:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    +  eax ecx edx ebx esp ebp/imm32*esi edi&#xA;   eax  00  01  02  03  04     05     06  07&#xA;   ecx  08  09  0a  0b  0c     0d     0e  0f&#xA;   edx  10  11  12  13  14     15     16  17&#xA;   ebx  18  19  1a  1b  1c     1d     1e  1f&#xA;     0  20  21  22  23  24     25     26  27&#xA;   ebp  28  29  2a  2b  2c     2d     2e  2f&#xA;   esi  30  31  32  33  34     35     36  37&#xA;   edi  38  39  3a  3b  3c     3d     3e  3f&#xA; 2*eax  40  41  42  43  44     45     46  47&#xA; 2*ecx  48  49  4a  4b  4c     4d     4e  4f&#xA; 2*edx  50  51  52  53  54     55     56  57&#xA; 2*ebx  58  59  5a  5b  5c     5d     5e  5f&#xA; 2*esp  60  61  62  63  64     65     66  67&#xA; 2*ebp  68  69  6a  6b  6c     6d     6e  6f&#xA; 2*esi  70  71  72  73  74     75     76  77&#xA; 2*edi  78  79  7a  7b  7c     7d     7e  7f&#xA; 4*eax  80  81  82  83  84     85     86  87&#xA; 4*ecx  88  89  8a  8b  8c     8d     8e  8f&#xA; 4*edx  90  91  92  93  94     95     96  97&#xA; 4*ebx  98  99  9a  9b  9c     9d     9e  9f&#xA; 4*esp  a0  a1  a2  a3  a4     a5     a6  a7&#xA; 4*ebp  a8  a9  aa  ab  ac     ad     ae  af&#xA; 4*esi  b0  b1  b2  b3  b4     b5     b6  b7&#xA; 4*edi  b8  b9  ba  bb  bc     bd     be  bf&#xA; 8*eax  c0  c1  c2  c3  c4     c5     c6  c7&#xA; 8*ecx  c8  c9  ca  cb  cc     cd     ce  cf&#xA; 8*edx  d0  d1  d2  d3  d4     d5     d6  d7&#xA; 8*ebx  d8  d9  da  db  dc     dd     de  df&#xA; 8*esp  e0  e1  e2  e3  e4     e5     e6  e7&#xA; 8*ebp  e8  e9  ea  eb  ec     ed     ee  ef&#xA; 8*esi  f0  f1  f2  f3  f4     f5     f6  f7&#xA; 8*edi  f8  f9  fa  fb  fc     fd     fe  ff&#xA;* imm32 if no another imm&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If an imm8 or imm32 is used, the value is followed after, little-endian.&lt;/p&gt;&#xA;&lt;p&gt;Given a value of &lt;code&gt;{0,1,2,4,8}*reg+{reg,0}+imm32&lt;/code&gt;, output a shortest expression of the address.&lt;/p&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;eax =&amp;gt; 00&#xA;eax+8 =&amp;gt; 40 08&#xA;eax+128 =&amp;gt; 80 80 00 00 00&#xA;esp =&amp;gt; 04 24&#xA;ebp =&amp;gt; 45 00&#xA;4*eax =&amp;gt; 04 85 00 00 00 00&#xA;2*eax =&amp;gt; 04 00&#xA;2*esp =&amp;gt; 04 60 00 00 00 00 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Sandbox Notes&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Since it's modified(enabled to allow &lt;code&gt;esp*4&lt;/code&gt;), and I'd allow use of id, should I remove the &lt;code&gt;eax&lt;/code&gt; expression?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2023-02-10T21:31:48.197" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25560" PostTypeId="2" ParentId="2140" CreationDate="2023-02-11T02:04:52.050" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257709/translate-to-plorcly-borglar&quot;&gt;Translate to plorcly borglar&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2023-02-11T18:38:24.303" LastActivityDate="2023-02-11T18:38:24.303" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25561" PostTypeId="2" ParentId="2140" CreationDate="2023-02-11T16:49:21.553" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257712/ptolemys-table-of-chords&quot;&gt;Ptolemy's table of chords&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110698" LastEditorUserId="110698" LastEditDate="2023-02-11T23:59:57.263" LastActivityDate="2023-02-11T23:59:57.263" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25562" PostTypeId="2" ParentId="2140" CreationDate="2023-02-11T19:08:51.600" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/258299/primes-with-distinct-prime-digits&quot;&gt;Primes with Distinct Prime Digits&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="113582" LastEditorUserId="113582" LastEditDate="2023-02-25T19:39:55.510" LastActivityDate="2023-02-25T19:39:55.510" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="25563" PostTypeId="1" CreationDate="2023-02-13T10:25:54.017" Score="4" ViewCount="165" Body="&lt;p&gt;In the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2056/how-does-the-sandbox-work-how-do-i-use-it&quot;&gt;faq&lt;/a&gt; it says that we need to delete published answers&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;When you post your question on the main site, edit the sandbox post to include a link to the challenge, removing everything but the title and the link. This is to keep the sandbox more compact and reduce the scrolling needed to view other proposals. Furthermore, &lt;strong&gt;delete the post&lt;/strong&gt;. (You should edit it anyway, because high-reputation users can still see deleted posts.)&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;In the sandbox also said that we need to delete the answers after posting:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;When you think your challenge is ready for the public, go ahead and post it, and replace the post here with a link to the challenge and &lt;strong&gt;delete the sandbox post&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;After some researches I found these two questions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1997/should-i-delete-my-sandbox-answers-after-posting-the-challenge&quot;&gt;Should I delete my sandbox answers after posting the challenge?&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2374/we-have-a-messy-sandbox&quot;&gt;We Have a Messy Sandbox&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;where the community votes to delete the answers in sandbox after publishing:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Delete them&lt;/h1&gt;&#xA;&lt;p&gt;Sandbox posts are like comments, not something we need a permanent record of. For anyone who does want to look back through the history of how a question was sculpted before being posted, deleted answers are still visible to high rep users.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;ol start=&quot;5&quot;&gt;&#xA;&lt;li&gt;Delete posted challenges, keep abandoned.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;But in reality a lot of people keep their answers in sandbox after publishing and everyone does it: low-reputed, high-reputed, moderator, etc.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ox5wc.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ox5wc.png&quot; alt=&quot;A number of posted challenges in the sandbox, edited down to stubs but not deleted&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Do not misunderstand me. I'm not blaming anyone, I'm just wondering what is the reason for this behavior? Because when the question is raised about whether answers should be deleted, almost everyone votes for &amp;quot;It needs to be deleted&amp;quot;, and then they don't delete them so I'm little confused :)&lt;/p&gt;&#xA;&lt;p&gt;I also found this question &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24749/are-we-still-deleting-sandbox-posts&quot;&gt;Are we still deleting sandbox posts?&lt;/a&gt; where we can see two diametrically opposed answers. Both of them have almost same count of votes which means that the community in general supports both&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/LNGYS.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/LNGYS.png&quot; alt=&quot;+15 supporting not deleting, +16 supporting deleting&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In my mind we have two options:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Delete all posted answers (follow the rules)&lt;/li&gt;&#xA;&lt;li&gt;Keeps all posted answers (change the rules)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I understand that they are again two diametrically opposed options. But I think that we need statistic about how many users follow the rules and how many users doesn't. After that, we will not &amp;quot;choose&amp;quot; which is more correct, but obey the statistics (i.e. the majority)&lt;/p&gt;&#xA;" OwnerUserId="116593" LastEditorUserId="79857" LastEditDate="2023-02-17T19:53:52.057" LastActivityDate="2023-02-17T19:53:52.057" Title="Should we update rules in faq about deleting answers?" Tags="|discussion|" AnswerCount="4" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25564" PostTypeId="2" ParentId="25563" CreationDate="2023-02-13T10:26:58.517" Score="5" Body="&lt;h1&gt;Change the rules in the faq/sandbox&lt;/h1&gt;&#xA;" OwnerUserId="116593" LastEditorUserId="116593" LastEditDate="2023-02-13T12:22:18.573" LastActivityDate="2023-02-13T12:22:18.573" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25565" PostTypeId="2" ParentId="25563" CreationDate="2023-02-13T10:28:12.933" Score="2" Body="&lt;h1&gt;Follow the rules in the faq/sandbox&lt;/h1&gt;&#xA;" OwnerUserId="116593" LastEditorUserId="116593" LastEditDate="2023-02-13T12:22:03.833" LastActivityDate="2023-02-13T12:22:03.833" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25566" PostTypeId="2" ParentId="25563" CreationDate="2023-02-13T10:48:46.983" Score="-1" Body="&lt;h1&gt;Edit the rules to allow both deleting and not deleting sandbox posts&lt;/h1&gt;&#xA;&lt;p&gt;People should still be allowed to delete their sandbox posts if they want to.&lt;/p&gt;&#xA;&lt;p&gt;I see the sandbox guidelines more as &amp;quot;Explaining to new people how we usually do things&amp;quot; rather than &amp;quot;Rules everyone should follow&amp;quot;. Experienced users don't read the rules anyways so it's useless to try to change their behavior in this way.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-02-13T12:15:24.250" LastActivityDate="2023-02-13T12:15:24.250" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25567" PostTypeId="2" ParentId="25563" CreationDate="2023-02-13T11:35:27.517" Score="4" Body="&lt;h2&gt;Promote editing down over deleting, discourage deleting, but make it clear it's allowed&lt;/h2&gt;&#xA;&lt;p&gt;First of all, deleting answers in the Sandbox doesn't save any space for 10k+ users if the answers aren't also edited down. So, the first thing that should be done to a posted proposal is that it be edited down into a stub, and I encourage people to edit such proposals down if the author doesn't do so in a reasonable amount of time.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, deleting answers in the Sandbox, while saving space for users with less than 10k reputation has a number of problems, as &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24751/56656&quot;&gt;pointed out by Wheat Wizard&lt;/a&gt;. Namely,&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Feedback and editing histories of the question are hidden for a number of users&lt;/li&gt;&#xA;&lt;li&gt;It makes it a lot harder to search for duplicate/failed challenge ideas, as deleted answers are almost impossible to search for.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Therefore, I suggest we make it clear that people should definitely edit their answers down, and, while it isn't recommended, they are welcome to delete their posted proposals&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="56656" LastEditDate="2023-02-13T20:04:29.920" LastActivityDate="2023-02-13T20:04:29.920" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25568" PostTypeId="1" CreationDate="2023-02-13T15:27:18.787" Score="7" ViewCount="249" Body="&lt;p&gt;&lt;strong&gt;Voting has closed. The Sand Trap is the winner!&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Since we've decided to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/25191/should-we-officially-recognize-off-topic-tnb&quot;&gt;officially recognize&lt;/a&gt; TNB's off-topic room &lt;a href=&quot;https://chat.stackexchange.com/rooms/136286/off-topic-tnb&quot;&gt;Off-Topic TNB&lt;/a&gt;, it might be a good time to give it its own name.&lt;/p&gt;&#xA;&lt;p&gt;We'll do this the same way we &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1005/lets-think-of-a-creative-name-for-our-chatroom/1006#1006&quot;&gt;decided&lt;/a&gt; on TNB's name; post one room name per answer. If you think the current name is the best option, feel free to create an answer with that option.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="108218" LastEditDate="2023-03-03T15:40:12.557" LastActivityDate="2023-03-03T15:40:12.557" Title="What should we call Off-Topic TNB?" Tags="|discussion|chat|" AnswerCount="8" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25569" PostTypeId="2" ParentId="25568" CreationDate="2023-02-13T15:33:12.807" Score="9" Body="&lt;h1&gt;Golf Overflow&lt;/h1&gt;&#xA;&lt;p&gt;Joke on Stack Overflow, also because the 19th hole is the one players overflow after the game.&lt;/p&gt;&#xA;" OwnerUserId="43319" LastActivityDate="2023-02-13T15:33:12.807" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25570" PostTypeId="2" ParentId="25568" CreationDate="2023-02-13T15:40:34.187" Score="1" Body="&lt;h1&gt;Off-Topic TNB&lt;/h1&gt;&#xA;&lt;p&gt;Simple, descriptive, and it's purpose will be immediately obvious&lt;/p&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2023-02-13T15:40:34.187" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25571" PostTypeId="2" ParentId="25568" CreationDate="2023-02-13T16:39:51.060" Score="0" Body="&lt;h1&gt;The Twentieth Byte&lt;/h1&gt;&#xA;&lt;p&gt;The mods can change their room name, can't they? :P&lt;/p&gt;&#xA;" OwnerUserId="107299" LastActivityDate="2023-02-13T16:39:51.060" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25572" PostTypeId="2" ParentId="25568" CreationDate="2023-02-13T17:17:39.497" Score="7" Body="&lt;h1&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/message/61919128#61919128&quot;&gt;The Bowling Green&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;It even &lt;em&gt;sounds&lt;/em&gt; off-topic.&lt;/p&gt;&#xA;" OwnerUserId="108218" LastActivityDate="2023-02-13T17:17:39.497" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25573" PostTypeId="2" ParentId="25568" CreationDate="2023-02-13T17:25:12.870" Score="8" Body="&lt;h1&gt;The 11th pin&lt;/h1&gt;&#xA;&lt;p&gt;The opposite of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-bowling-container&quot;&gt;code-bowling&lt;/a&gt;. The most commonly played bowling variant is 10-pin bowling. Thus the &amp;quot;11th pin&amp;quot; would be a place you go to relax after a intense night of bowling.&lt;/p&gt;&#xA;&lt;p&gt;(Inspired by Ginger's answer)&lt;/p&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2023-02-13T17:25:12.870" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25574" PostTypeId="2" ParentId="2140" CreationDate="2023-02-13T18:55:38.927" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257853/how-spherical-is-my-ellipsoid&quot;&gt;How spherical is my ellipsoid?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110698" LastEditorUserId="110698" LastEditDate="2023-02-14T23:34:35.273" LastActivityDate="2023-02-14T23:34:35.273" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25575" PostTypeId="2" ParentId="25568" CreationDate="2023-02-13T19:00:08.153" Score="2" Body="&lt;p&gt;&lt;strong&gt;The Nth Byte&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Play off “The Nineteenth Byte”, plus being able to be on-(ish) or off topic.&lt;/p&gt;&#xA;" OwnerUserId="112409" LastActivityDate="2023-02-13T19:00:08.153" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25576" PostTypeId="2" ParentId="25568" CreationDate="2023-02-14T12:41:31.873" Score="-2" Body="&lt;h1&gt;The 20th Bytedump&lt;/h1&gt;&#xA;&lt;p&gt;Just... sounds right.&lt;/p&gt;&#xA;" OwnerUserId="110681" LastEditorUserId="110681" LastEditDate="2023-02-21T17:54:59.113" LastActivityDate="2023-02-21T17:54:59.113" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25577" PostTypeId="2" ParentId="2140" CreationDate="2023-02-14T19:13:12.133" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257973/random-point-inside-boundary&quot;&gt;Random point inside boundary&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96037" LastEditorUserId="96037" LastEditDate="2023-02-18T14:58:00.330" LastActivityDate="2023-02-18T14:58:00.330" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25578" PostTypeId="2" ParentId="2140" CreationDate="2023-02-15T01:23:57.473" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/258044/number-clusters&quot;&gt;Number Clusters&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91262" LastEditorUserId="91262" LastEditDate="2023-02-19T22:53:17.257" LastActivityDate="2023-02-19T22:53:17.257" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25579" PostTypeId="2" ParentId="2140" CreationDate="2023-02-15T10:57:42.900" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/195032/totally-blind-chess&quot;&gt;Related&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Play chess. You can't see the current board, and can only memory two bytes.&lt;/p&gt;&#xA;&lt;p&gt;Each turn, you're given your current state(initially 0) and opponent's move(a special value if first move in the game). You then output a list of [moves,state] pair, and the first valid one will get used. If no valid move, then you automatically resign.&lt;/p&gt;&#xA;&lt;p&gt;Aim is obviously win as many games and lose as less as possible.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;king-of-the-hill-container&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;chess-container&quot;&gt;chess&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2023-02-15T11:30:28.027" LastActivityDate="2023-02-15T11:30:28.027" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25580" PostTypeId="2" ParentId="2140" CreationDate="2023-02-15T15:56:42.923" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/257945/find-opposite-string&quot;&gt;Find opposite string&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="116593" LastEditorUserId="116593" LastEditDate="2023-02-17T17:15:35.000" LastActivityDate="2023-02-17T17:15:35.000" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25581" PostTypeId="2" ParentId="25568" CreationDate="2023-02-16T02:55:17.170" Score="18" Body="&lt;h1&gt;The Sand Trap&lt;/h1&gt;&#xA;&lt;p&gt;In case we want another name related to the sport golf. It's off-topic, we've veered off the grass into a sand trap. And once you get really involved in a conversation there, it's hard to leave :P.&lt;/p&gt;&#xA;&lt;p&gt;One con is that a room called &amp;quot;The Sand Trap&amp;quot; would not be immediately recognizable as the off-topic room for CGCC.&lt;/p&gt;&#xA;&lt;p&gt;Credit to Ginger for suggesting this in chat.&lt;/p&gt;&#xA;" OwnerUserId="95792" LastEditorUserId="95792" LastEditDate="2023-02-26T23:11:41.457" LastActivityDate="2023-02-26T23:11:41.457" CommentCount="0" CommunityOwnedDate="2023-02-26T23:11:41.457" ContentLicense="CC BY-SA 4.0" />
  <row Id="25583" PostTypeId="2" ParentId="2140" CreationDate="2023-02-16T10:57:36.923" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/261248/how-many-sorting-networks&quot;&gt;How many sorting networks?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2023-05-26T14:36:20.133" LastActivityDate="2023-05-26T14:36:20.133" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25584" PostTypeId="2" ParentId="2140" CreationDate="2023-02-16T11:41:06.757" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/258088/91213&quot;&gt;Whole Number Groups&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-02-21T13:20:07.440" LastActivityDate="2023-02-21T13:20:07.440" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25585" PostTypeId="2" ParentId="2140" CreationDate="2023-02-16T13:04:52.213" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/258021/116074&quot;&gt;Approximate a root of an odd degree polynomial&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="116074" LastEditorUserId="116074" LastEditDate="2023-02-19T17:23:22.210" LastActivityDate="2023-02-19T17:23:22.210" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25586" PostTypeId="2" ParentId="2140" CreationDate="2023-02-16T21:10:42.133" Score="-3" Body="&lt;h1&gt;Munge my Text &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;string-container&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;random-container&quot;&gt;random&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Inspired by &lt;a href=&quot;https://docs.python.org/3/library/re.html?highlight=munge#text-munging&quot; rel=&quot;nofollow noreferrer&quot;&gt;this example in the Python documentation&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Write a program that takes as input a string of arbitrary length and returns a version of that string with every letter, except the first and last, of every word randomly shuffled. &amp;quot;Word&amp;quot; is defined here as a contiguous set of alphabetical characters separated by one or more spaces or punctuation marks (&lt;code&gt;!&amp;quot;#$%&amp;amp;'()*+,-./:;&amp;lt;=&amp;gt;?@[\]^_`{|}~&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input: Professor Abdolmalek, please report your absences promptly.&#xA;Possible output: Poefsrosr Aealmlobdk, pslaee reorpt your abnseces plmrptoy.&#xA;&#xA;META TODO: Add more examples&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;code-golf-container&quot;&gt;code-golf&lt;/a&gt;, so shortest answer wins!&lt;/p&gt;&#xA;" OwnerUserId="108218" LastActivityDate="2023-02-16T21:10:42.133" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25587" PostTypeId="2" ParentId="2140" CreationDate="2023-02-17T14:26:27.563" Score="3" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/258129/116013&quot;&gt;Fibonacci Binary Squares&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="116013" LastEditorUserId="116013" LastEditDate="2023-02-22T13:44:48.563" LastActivityDate="2023-02-22T13:44:48.563" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25588" PostTypeId="2" ParentId="2140" CreationDate="2023-02-18T04:25:18.893" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/258001/3d-rotation-matrix-to-quaternion&quot;&gt;3D rotation matrix to quaternion&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110698" LastEditorUserId="110698" LastEditDate="2023-02-19T02:29:35.813" LastActivityDate="2023-02-19T02:29:35.813" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25589" PostTypeId="2" ParentId="2140" CreationDate="2023-02-18T11:18:39.753" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/258082/110698&quot;&gt;4D rotation matrix to quaternions&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110698" LastEditorUserId="110698" LastEditDate="2023-02-21T00:06:29.960" LastActivityDate="2023-02-21T00:06:29.960" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25590" PostTypeId="2" ParentId="2140" CreationDate="2023-02-18T15:17:57.103" Score="-3" Body="&lt;p&gt;Fibonacci before the zero - Dublicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/105183/negative-fibonacci-numbers&quot;&gt;Negative Fibonacci Numbers&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="116593" LastEditorUserId="116593" LastEditDate="2023-02-18T15:59:12.530" LastActivityDate="2023-02-18T15:59:12.530" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25591" PostTypeId="2" ParentId="2140" CreationDate="2023-02-18T16:53:06.080" Score="1" Body="&lt;p&gt;Given a signed int64, convert into base -2 integer. &lt;code&gt;+ - &amp;amp; | ^ ~&lt;/code&gt; cost 1. &lt;code&gt;=&lt;/code&gt;, variable name, constant are free. Other operations disallowed. Lowest cost win.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/atomic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;atomic-code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;atomic-code-golf-container&quot;&gt;atomic-code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2023-02-18T16:53:06.080" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25592" PostTypeId="2" ParentId="2140" CreationDate="2023-02-19T15:37:27.980" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/258046/110698&quot;&gt;Injectively saturate bit strings&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110698" LastEditorUserId="110698" LastEditDate="2023-02-20T00:10:08.030" LastActivityDate="2023-02-20T00:10:08.030" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25593" PostTypeId="2" ParentId="2140" CreationDate="2023-02-20T14:47:06.657" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/258137/elevator-movement-order&quot;&gt;Elevator movement order&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="116593" LastEditorUserId="116593" LastEditDate="2023-02-22T16:56:07.897" LastActivityDate="2023-02-22T16:56:07.897" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25594" PostTypeId="2" ParentId="2140" CreationDate="2023-02-20T19:54:42.403" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/258227/107299&quot;&gt;Help Me Type on My New Keyboard&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="107299" LastEditorUserId="107299" LastEditDate="2023-02-24T22:25:27.477" LastActivityDate="2023-02-24T22:25:27.477" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="25595" PostTypeId="2" ParentId="2140" CreationDate="2023-02-21T10:05:35.840" Score="0" Body="&lt;h1&gt;Ternary 2-input logic gate&lt;/h1&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Given an expression of a ternary 2-input logic gate, pretty-print its truth table.&lt;/p&gt;&#xA;&lt;h2&gt;Ternary logic and ternary operators&lt;/h2&gt;&#xA;&lt;p&gt;&lt;code&gt;L&lt;/code&gt;, &lt;code&gt;E&lt;/code&gt;, and &lt;code&gt;G&lt;/code&gt; are the truth values of the ternary logic dealt here. They correspond to Haskell's &lt;code&gt;LT&lt;/code&gt;, &lt;code&gt;EQ&lt;/code&gt;, and &lt;code&gt;GT&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The expression can have two free variables, hence &amp;quot;2-input&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;There are four operators that the expression can have: &lt;code&gt;min&lt;/code&gt;, &lt;code&gt;max&lt;/code&gt;, &lt;code&gt;compare&lt;/code&gt;, and &lt;code&gt;mappend&lt;/code&gt;. (Again, from Haskell.) Their truth tables are:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;min|L E G&#xA;---+-----&#xA;L  |L L L&#xA;E  |L E E&#xA;G  |L E G&#xA;&#xA;max|L E G&#xA;---+-----&#xA;L  |L E G&#xA;E  |E E G&#xA;G  |G G G&#xA;&#xA;compare|L E G&#xA;-------+-----&#xA;L      |E L L&#xA;E      |G E L&#xA;G      |G G E&#xA;&#xA;mappend|L E G&#xA;-------+-----&#xA;L      |L L L&#xA;E      |L E G&#xA;G      |G G G&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;where the first column is for the first argument and the first row is for the second argument.&lt;/p&gt;&#xA;&lt;h2&gt;I/O format&lt;/h2&gt;&#xA;&lt;p&gt;The input format shall be a nonempty binary tree whose branches are the operator and whose leaves are the free variables and the truth values.&lt;/p&gt;&#xA;&lt;p&gt;The output format shall be like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; |L E G&#xA;-+-----&#xA;L|? ? ?&#xA;E|? ? ?&#xA;G|? ? ?&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;where &lt;code&gt;?&lt;/code&gt; is filled with appropriate truth values represented by &lt;code&gt;L&lt;/code&gt;, &lt;code&gt;E&lt;/code&gt;, or &lt;code&gt;G&lt;/code&gt;. Again, the first column is for the first argument and the first row is for the second argument.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;Let the free variables be &lt;code&gt;P&lt;/code&gt; and &lt;code&gt;Q&lt;/code&gt; in sake of demonstration.&lt;/p&gt;&#xA;&lt;p&gt;Given &lt;code&gt;P compare (E compare Q)&lt;/code&gt;, the truth table is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; |L E G&#xA;-+-----&#xA;L|L L E&#xA;E|L E G&#xA;G|E G G&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Given &lt;code&gt;(P min Q) compare (E compare (P max Q))&lt;/code&gt;, the truth table is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; |L E G&#xA;-+-----&#xA;L|L E E&#xA;E|E E E&#xA;G|E E G&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Given &lt;code&gt;((E compare (P max Q)) compare (P min Q)) mappend (P compare (E compare Q))&lt;/code&gt;, the truth table is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; |L E G&#xA;-+-----&#xA;L|G L E&#xA;E|L E G&#xA;G|E G L&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Given &lt;code&gt;Q mappend P&lt;/code&gt;, the truth table is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; |L E G&#xA;-+-----&#xA;L|L L G&#xA;E|L E G&#xA;G|L G G&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="89459" LastActivityDate="2023-02-21T10:05:35.840" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25596" PostTypeId="2" ParentId="2140" CreationDate="2023-02-21T10:30:19.067" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/258110/110698&quot;&gt;A Fine sequence with fine interpretations&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110698" LastEditorUserId="110698" LastEditDate="2023-02-23T04:17:40.243" LastActivityDate="2023-02-23T04:17:40.243" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25597" PostTypeId="2" ParentId="2140" CreationDate="2023-02-21T11:21:16.593" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/258201/candy-crush-a-string&quot;&gt;&amp;quot;Candy Crush&amp;quot; a string&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="116582" LastEditorUserId="116582" LastEditDate="2023-02-24T14:09:55.330" LastActivityDate="2023-02-24T14:09:55.330" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25598" PostTypeId="2" ParentId="2140" CreationDate="2023-02-21T14:58:36.010" Score="-1" Body="&lt;h1&gt;Route Planning for a delivery driver&lt;/h1&gt;&#xA;&lt;p&gt;There is a town that consists of a single long road with evenly spaced houses. Each house either needs rice, represented with a negative number, or can provide rice, represented with a positive number.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[-1, 50, -1, -1, -1, -50, 3, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here, the first house needs one grain of rice, the second can provide 50 etc.&lt;/p&gt;&#xA;&lt;p&gt;Your delivery truck starts at the very left edge of the town, and must end on the very right edge. It has a infinite capacity, but you can't deliver if it's empty.&lt;/p&gt;&#xA;&lt;p&gt;The sum of the input list is guaranteed to be 0.&lt;/p&gt;&#xA;&lt;p&gt;Given a list of requirements, output the shortest possible path that can deliver to every address.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Test Case&lt;/th&gt;&#xA;&lt;th&gt;Output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;5, -5&lt;/td&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;-5, 5&lt;/td&gt;&#xA;&lt;td&gt;5&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2, -5, 3&lt;/td&gt;&#xA;&lt;td&gt;6&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;-1, -1, 1, 1, 1, -1&lt;/td&gt;&#xA;&lt;td&gt;12&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;" OwnerUserId="91213" LastActivityDate="2023-02-21T14:58:36.010" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25599" PostTypeId="2" ParentId="2140" CreationDate="2023-02-22T07:11:29.927" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/258393/making-one-shape-out-of-dissections-of-another&quot;&gt;Making one shape out of dissections of another&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96039" LastEditorUserId="96039" LastEditDate="2023-02-26T23:51:51.473" LastActivityDate="2023-02-26T23:51:51.473" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="25600" PostTypeId="2" ParentId="2140" CreationDate="2023-02-22T07:25:04.883" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/258395/60042&quot;&gt;Consolidate a 6-axis Vector&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="60042" LastEditorUserId="60042" LastEditDate="2023-02-27T01:34:25.740" LastActivityDate="2023-02-27T01:34:25.740" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25602" PostTypeId="2" ParentId="2140" CreationDate="2023-02-22T10:31:55.650" Score="0" Body="&lt;h1&gt;Floating-point numbers have errors in addition, oh my!&lt;/h1&gt;&#xA;&lt;p&gt;Given two IEEE double-precision floating-point numbers &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt;, output the most accurate IEEE double-precision floating-point approximation of the error that would be caused by performing the floating-point addition &lt;span class=&quot;math-container&quot;&gt;\$x + y\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;As a reminder, an &lt;em&gt;error&lt;/em&gt; is defined as the approximation subtracted by the exact value.&lt;/p&gt;&#xA;&lt;p&gt;The inputs must deal with denormal numbers and the negative zero as well. However, infinities and NaNs fall into &lt;em&gt;don't care&lt;/em&gt; situation.&lt;/p&gt;&#xA;&lt;p&gt;If the output is zero, its sign doesn't matter.&lt;/p&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2023-02-22T21:18:34.183" LastActivityDate="2023-02-22T21:18:34.183" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25603" PostTypeId="2" ParentId="2140" CreationDate="2023-02-23T05:00:37.067" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/258173/110698&quot;&gt;Simultaneously solve N-queens and no-3-in-line&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110698" LastEditorUserId="110698" LastEditDate="2023-02-23T15:07:16.000" LastActivityDate="2023-02-23T15:07:16.000" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25604" PostTypeId="1" CreationDate="2023-02-24T12:39:02.857" Score="17" ViewCount="1278" Body="&lt;h1&gt;Final Phase&lt;/h1&gt;&#xA;&lt;p&gt;You have chosen the categories and the nominees for 2023, and now it is time to pick the winners!&lt;/p&gt;&#xA;&lt;p&gt;Each of the nine categories is represented by an answer to this question. Each answer contains all nominations by the members of our community in the comments.&lt;/p&gt;&#xA;&lt;p&gt;Four categories did not have any nominations but are kept up for historical purposes and in case you are interested in exploring the SEDE queries for those categories that have them.&lt;/p&gt;&#xA;&lt;h1&gt;Voting Mechanism&lt;/h1&gt;&#xA;&lt;p&gt;Each nominee has been added as a comment to its category's answer. In each category, the nominee whose comment has the highest number of votes by January 15th, 06:00 UTC will be declared the winner of that category.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Votes on the question and on answers are meaningless; only votes on comments count. Do not post new answers or comments.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Feel free to vote for multiple nominees of the same category, including your own posts.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="68942" LastEditDate="2024-01-01T06:18:10.267" LastActivityDate="2024-01-01T06:22:23.187" Title="Cast your vote for &quot;Best of CGCC 2023&quot;!" Tags="|discussion|best-of|" AnswerCount="9" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25605" PostTypeId="2" ParentId="25604" CreationDate="2023-02-24T12:39:02.857" Score="3" Body="&lt;h1&gt;Rookie of the Year - Answers&lt;/h1&gt;&#xA;&lt;p&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25428/114446&quot;&gt;2022&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24235/100664&quot;&gt;2021&lt;/a&gt; and other years.&lt;/p&gt;&#xA;&lt;p&gt;For the best answer written by a new user in 2023. This doesn't have to be a user who created their account in 2023 - rather, this is for any answer posted by a user in 2023 where that answer was that user's first answer on the site.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/119451/mtn&quot;&gt;MTN&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by The Empty String Photographer&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;They have posted an &lt;a href=&quot;https://codegolf.stackexchange.com/a/264839/117478&quot;&gt;amazing answer&lt;/a&gt; to my challenge as their first answer!&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/119100/incendiary&quot;&gt;incendiary&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by xnor&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;incendiary's &lt;a href=&quot;https://codegolf.stackexchange.com/a/263771/20260&quot;&gt;first and only answer so far&lt;/a&gt; would be impressive for a Python golf veteran. On the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-restricted-source-tooltip-container&quot;&gt;restricted-source&lt;/a&gt; challenge of &lt;a href=&quot;https://codegolf.stackexchange.com/q/46909/20260&quot;&gt;Finding prime numbers without using &amp;quot;prime characters&amp;quot;&lt;/a&gt;, it makes clever use of Unicode normalization and class methods to avoid parens and other banned characters.&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/120677/pufe&quot;&gt;Pufe&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by Neil&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Their only &lt;a href=&quot;https://codegolf.stackexchange.com/a/268783&quot;&gt;answer&lt;/a&gt; so far shows a completely new insight on the challenge.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1706435/2023-answers-by-users-with-no-answers-before-2023&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE query&lt;/a&gt; (modified from 2022)&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="17602" LastEditDate="2023-12-30T21:40:18.573" LastActivityDate="2023-12-30T21:40:18.573" CommentCount="3" CommunityOwnedDate="2023-02-24T12:39:02.857" ContentLicense="CC BY-SA 4.0" />
  <row Id="25606" PostTypeId="2" ParentId="25604" CreationDate="2023-02-24T12:40:12.980" Score="7" Body="&lt;h1&gt;Rookie of the Year - Challenges&lt;/h1&gt;&#xA;&lt;p&gt;Repost of &lt;a href=&quot;/a/25426/114446&quot;&gt;2022&lt;/a&gt;, &lt;a href=&quot;/a/24228/100664&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;/a/20589/66833&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;/a/18437/66833&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;/a/17318/85052&quot;&gt;2018&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For the best challenge written by someone who has not written a challenge prior to 2023.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1706436/2023-challenges-by-users-with-no-challenges-before-2023&quot; rel=&quot;nofollow noreferrer&quot;&gt;SEDE query&lt;/a&gt; (modified from 2022)&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/117040/aitzaz-imtiaz&quot;&gt;Aitzaz Imtiaz&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nomination by Seggan&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Aitzaz has done something extremely rare for a new user. As I write this (Feb 28), he has been a member of CGCC for five days, yet has written 8 challenges. All of them but one are open and have been received positively. He has even managed to get away with not using the Sandbox. This is rare for even a seasoned user. For these reasons I nominate him.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Note: originally this was a nomination for Aira Thunberg; however, Aira's account has been merged with Aitzaz's. Aitzaz has &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/63112535#63112535&quot;&gt;stated&lt;/a&gt; that they have produced the challenges together. I have changed this nomination to him as the challenges were also made by him.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/117794/spyderscript&quot;&gt;SpyderScript&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nomination by Jacob&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;As of writing this, SpyderScript has posted their first challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/260434/what-dice-do-i-need-to-display-every-integer-up-to-x&quot;&gt;What dice do I need to display every integer up to X?&lt;/a&gt; just six days ago and has already amassed a whopping 45 upvotes (May 1), immediately standing out from other challenges posted in recent months by more seasoned users. Spyder did not use the Sandbox and has still managed to create a very unique and interesting challenge that seems to have had good reception across the board, with not a single downvote as I write this. They have also posted a sequel to the challenge: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/260547/what-dice-do-i-need-to-display-my-words?noredirect=1&amp;amp;lq=1&quot;&gt;What dice do I need to display my words?&lt;/a&gt;, which as of writing this has not received much attention but will likely get similar reception in the coming days (I will update my nomination for them in a week or so.)&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="91213" LastEditDate="2023-08-04T10:22:58.823" LastActivityDate="2023-08-04T10:22:58.823" CommentCount="2" CommunityOwnedDate="2023-02-24T12:40:12.980" ContentLicense="CC BY-SA 4.0" />
  <row Id="25607" PostTypeId="2" ParentId="25604" CreationDate="2023-02-24T12:41:30.110" Score="5" Body="&lt;h1&gt;Most diverse challenge&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25437&quot;&gt;repost from 2022&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Often, there is one real algorithm to solve a challenge that is competetive. Maybe very esoteric or specialized languages need a different approach, but mostly, every answer is just a translation of the others.&lt;/p&gt;&#xA;&lt;p&gt;This award is for challenges with no clear single approach where very different algorithms can be competitive. These are the most fun to solve, since you can't just translate other answers but need to carefully consider which approach to take, or even to invent a new one.&lt;/p&gt;&#xA;&lt;p&gt;This prize is intended specifically for &lt;em&gt;challenges&lt;/em&gt; where:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are either many approaches or just a few that are very different&lt;/li&gt;&#xA;&lt;li&gt;All of which are competitive&lt;/li&gt;&#xA;&lt;li&gt;Even in the same/similar languages&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2023-02-24T12:41:30.110" CommentCount="0" CommunityOwnedDate="2023-02-24T12:41:30.110" ContentLicense="CC BY-SA 4.0" />
  <row Id="25608" PostTypeId="2" ParentId="25604" CreationDate="2023-02-24T12:43:25.743" Score="4" Body="&lt;h1&gt;Slowest Gun in the East&lt;/h1&gt;&#xA;&lt;p&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25439/91213&quot;&gt;2022&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24230/52210&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17320/52210&quot;&gt;2018&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14521/52210&quot;&gt;2017&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10988/52210&quot;&gt;2016&lt;/a&gt;,&lt;/p&gt;&#xA;&lt;p&gt;There are a lot of really good old questions on this site. Unfortunately, new answers to them tend to gain very few votes and little interaction compared with answers to new challenges.&lt;/p&gt;&#xA;&lt;p&gt;This category is for underappreciated new answers to challenges where the last interaction was at least 1 year before the post was made.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1706336/2023-slowest-gun-in-the-east&quot; rel=&quot;nofollow noreferrer&quot;&gt;SGITE 2023 query.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="16766" LastEditDate="2023-02-24T20:24:33.420" LastActivityDate="2023-02-24T20:24:33.420" CommentCount="0" CommunityOwnedDate="2023-02-24T12:43:25.743" ContentLicense="CC BY-SA 4.0" />
  <row Id="25609" PostTypeId="2" ParentId="25604" CreationDate="2023-02-24T12:44:35.500" Score="9" Body="&lt;h1&gt;Wrong tool for the job&lt;/h1&gt;&#xA;&lt;p&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17321/9288&quot;&gt;2018&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24243/91213&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25433/91213&quot;&gt;2022&lt;/a&gt;, but rephrased significantly&lt;/p&gt;&#xA;&lt;p&gt;Technically, every Turing-complete language should be able to solve every problem. In practice though, some problems are really hard in particular languages, and thus those languages are rarely used. While you can, for example, invent multiplication in a language that doesn't have it, it's a lot of effort for little benefit.&lt;/p&gt;&#xA;&lt;p&gt;However, some brave souls are not afraid of a challenge. They'll solve &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-array-tooltip-container&quot;&gt;array&lt;/a&gt; challenges in languages that lack arrays. They'll solve &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-random-tooltip-container&quot;&gt;random&lt;/a&gt; challenges in languages lacking an easy-to-use RNG. This category is for them. Those who don't care about spending a whole day solving a challenge that would be &amp;lt;100 bytes of Python.&lt;/p&gt;&#xA;&lt;p&gt;In short, this answer is for answers that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Solve a challenge in a language that's lacking the basic features that would normally be used for this type of challenge&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This could be because the language has a specific weakness or because it's just really hard to use for all problems&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Still make a good attempt to improve the score, within the limits of the language&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/257193/91213&quot;&gt;Salicious Bacon Tripod&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/91213&quot;&gt;Mousetail&lt;/a&gt; (self-nomination)&lt;/h3&gt;&#xA;&lt;p&gt;This challenge is about substituting a specific word with a different set at random.&lt;/p&gt;&#xA;&lt;p&gt;There are two things that &amp;gt;&amp;lt;&amp;gt; is really bad at: working with arrays and randomness. The stack in &amp;gt;&amp;lt;&amp;gt; can hold only single numbers so trying to store something like a list of strings that can be conveniently accessed with the very primitive set of stack manipulation operators. Instead, this answer uses the code itself as storage but this has it's own problems as you need leave space near the top of the code box to store data. If you need more data, in this case you need a list of list of strings it's tricky to make sure you can store them all while still being convenient to access.&lt;/p&gt;&#xA;&lt;p&gt;The most important part to make that a bit golfy is to make sure the base of every array is below 15 so you can access it with &lt;code&gt;f+&lt;/code&gt; instead of a much longer expression for every single access. That means your main code needs to be limited to at most 15 - amount of data lines, in this case 13, very little for such a complex challenge.&lt;/p&gt;&#xA;&lt;p&gt;Randomness is also very hard. The only random operator in &amp;gt;&amp;lt;&amp;gt; is the &lt;code&gt;x&lt;/code&gt; which just moves in a random direction. Turning this into a uniform random number between 0 and n, a basic builtin in most languages, is not trivial, especially when you have a tight limit on the number of vertical lines used.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/258397/number-to-binary/258900#258900&quot;&gt;Number to Binary&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nomination by Aiden Chow&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Edit: Bubbler has recently golfed his answer even further to 29 bytes, due to an improvement to the second loop. It is now under 30 bytes... just insane!&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;An easy challenge like converting a base-10 number to its binary form can be done with the use of a builtin or two in most languages. However, in Piet, it is difficult to create a functioning answer to even the most simplistic challenges, let alone golf them.&lt;/p&gt;&#xA;&lt;p&gt;For Piet specifically, it is not only difficult to decide which instructions need to be used in which order, but also to construct a concise structure of the code and control the path of the instruction pointer as it makes its way throughout said structure.&lt;/p&gt;&#xA;&lt;p&gt;In Piet, there are also two different registers which influence the path of the instruction pointer that also need to be considered to properly control the instruction pointer in a way that you want it to: the Codel Chooser (CC) and the Direction Pointer (DP). The instruction pointer is heavily influenced by the shape of the various &amp;quot;islands&amp;quot; of colors, called codels, so not only do you need to manipulate the CC and the DP in an efficient way, but to also fit together the codels in the most concise way possible.&lt;/p&gt;&#xA;&lt;p&gt;Going back to the Number to Binary challenge, Bubbler's Piet answer comes in as the third Piet answer to that challenge. The first Piet &lt;a href=&quot;https://codegolf.stackexchange.com/questions/258397/number-to-binary/258456#258456&quot;&gt;answer&lt;/a&gt; posted was by &lt;a href=&quot;https://codegolf.stackexchange.com/users/110698/parcly-taxel&quot;&gt;Parcly Taxel&lt;/a&gt;, at 73 bytes, and it showcases an interesting looping structure and a great start as Piet answers go. Then I, &lt;a href=&quot;https://codegolf.stackexchange.com/users/96039/aiden-chow&quot;&gt;Aiden Chow&lt;/a&gt;, decided to give it a shot with a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/258397/number-to-binary/258507#258507&quot;&gt;42 bytes answer&lt;/a&gt;. While this was an improvement to Parcly Taxel's structure, this still used a naive structure, with two loops right next to each other in a two-high grid. But then &lt;a href=&quot;https://codegolf.stackexchange.com/users/78410/bubbler&quot;&gt;Bubbler&lt;/a&gt; posted a mind blowing &lt;a href=&quot;https://codegolf.stackexchange.com/questions/258397/number-to-binary/258900#258900&quot;&gt;33(!!!) bytes answer&lt;/a&gt;, blowing the previous two answers out of the water.&lt;/p&gt;&#xA;&lt;p&gt;The main improvements that Bubbler's answer had over both Parcly Taxel's and my answer was the insightful and elegant structure of the code. Although the fundamental logic of using two loops, one to set up the stack with bits and the other to print out all the bits on the stack, was the same as the previous two answers, Bubbler's choice of placing the DP+ instruction at A1A2, which helped save space in the first loop, was what set apart his answer from the previous two answers and saved around 10 bytes over the previous best Piet answer to the challenge (which was my, Aiden Chow, 42 bytes answer).&lt;/p&gt;&#xA;&lt;p&gt;The basic reason why Bubbler's A1A2 DP+ instruction saves so many bytes is because this placement of the DP+ instruction allows more flexibility as to how the loop is constructed afterwards. With the technique of putting the two loops right next to each other, you are limited to placing the DP+ instruction at the rightmost edge of the loop in order for the instruction pointer to be able to easily transition from first loop to the second loop. But for this to work you need to place the check to exit the loop on the top half of the loop, while putting the actual logic of converting a base-10 number to its binary form on the bottom half of the loop. This wasted space along the top half of the loop.&lt;/p&gt;&#xA;&lt;p&gt;This problem is bypassed with Bubbler's DP+ instruction placement because instead of being limited to having to exit the loop on the rightmost edge of the loop, it is instead possible to transition to the second loop through the bottom of the first loop. This essentially removes the limitation of having the place the exiting check on the top half of the loop and the actual logic on the bottom half of the loop as I did in my 42 bytes answer, but instead it is now possible to do both the actual logic and the check without any limitations as to where the codels are.&lt;/p&gt;&#xA;&lt;p&gt;If you are interested in learning more about the A1A2 DP+ structure, you can check out Bubbler's &lt;a href=&quot;https://codegolf.stackexchange.com/questions/245785/tips-for-golfing-in-piet/258901#258901&quot;&gt;tip&lt;/a&gt;, where he goes over when to apply this kind of structure and provides specific examples of how this structure is applied.&lt;/p&gt;&#xA;&lt;p&gt;Overall, because of the ingenious structure of Bubbler's Piet answer resulting in a surprisingly golfy 33 bytes answer, along with the sheer difficulty of creating a Piet answer for even the simplest of challenges due to the amount of things you need to keep track of when creating a Piet answer, I nominate Bubbler's Piet answer to the Number to Binary challenge.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="91213" LastEditDate="2023-08-04T10:05:09.383" LastActivityDate="2023-08-04T10:05:09.383" CommentCount="2" CommunityOwnedDate="2023-02-24T12:44:35.500" ContentLicense="CC BY-SA 4.0" />
  <row Id="25610" PostTypeId="2" ParentId="25604" CreationDate="2023-02-24T12:45:50.957" Score="1" Body="&lt;h1&gt;Wild card&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24231/20260&quot;&gt;Repost from 2021&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For a deserving challenge, answer, or user that isn't a good fit for any of the other categories.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2023-02-24T12:45:50.957" CommentCount="0" CommunityOwnedDate="2023-02-24T12:45:50.957" ContentLicense="CC BY-SA 4.0" />
  <row Id="25611" PostTypeId="2" ParentId="25604" CreationDate="2023-02-24T12:47:37.413" Score="4" Body="&lt;h1&gt;Best Explanation&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25431/16766&quot;&gt;2022&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24248/108218&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20601/66833&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/18451/66833&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17315/66833&quot;&gt;2018&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14512/66833&quot;&gt;2017&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/10940/66833&quot;&gt;2016&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;This category is for the answer with the best explanation accompanying it. Ideally, the winner will be an answer with a very detailed explanation that is accessible to anyone, regardless of the amount of relevant knowledge already possessed.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2023-02-24T12:47:37.413" CommentCount="0" CommunityOwnedDate="2023-02-24T12:47:37.413" ContentLicense="CC BY-SA 4.0" />
  <row Id="25612" PostTypeId="2" ParentId="25604" CreationDate="2023-02-24T12:48:56.177" Score="3" Body="&lt;h1&gt;Best sequel&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Note: This category only received one nomination, so there is no vote for it. It is kept here for recognition.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Originality is great, we love challenges that provide a new fresh take on things. But sometimes unoriginal ideas are just as good. This award is for challenges that take the ideas of an earlier challenge (by the same or different author) and improve on them or twist them in a new and interesting way.&lt;/p&gt;&#xA;&lt;p&gt;Nominations should include both the challenge being nominated and any &amp;quot;prequels&amp;quot; to help give context.&lt;/p&gt;&#xA;&lt;h2&gt;Landmine Number &lt;a href=&quot;https://codegolf.stackexchange.com/q/262518/9288&quot;&gt;I&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/q/262553/9288&quot;&gt;II&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/q/262628/9288&quot;&gt;III&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/q/262746/9288&quot;&gt;IV&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/q/262794/9288&quot;&gt;V&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/115553/jacob-creutzfeldt&quot;&gt;Jacob Creutzfeldt&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;nominated by alephalpha&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;A series of five interesting challenges based on the same idea, but each with a different twist.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="68942" LastEditDate="2024-01-01T06:22:23.187" LastActivityDate="2024-01-01T06:22:23.187" CommentCount="0" CommunityOwnedDate="2023-02-24T12:48:56.177" ContentLicense="CC BY-SA 4.0" />
  <row Id="25613" PostTypeId="1" CreationDate="2023-02-24T16:50:32.407" Score="4" ViewCount="113" Body="&lt;p&gt;Are sites like github.dev acceptable to use to time &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;fastest-code-container&quot;&gt;fastest-code&lt;/a&gt; questions? They do specify the specs and are free. What about gitpod, repl.it, and others?&lt;/p&gt;&#xA;" OwnerUserId="97819" LastActivityDate="2023-03-10T17:38:30.843" Title="Is github.dev acceptable for fastest-code questions?" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25614" PostTypeId="2" ParentId="2140" CreationDate="2023-02-26T00:16:28.217" Score="1" Body="&lt;h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/258599/shape-animation&quot;&gt;Animate the shape!&lt;/a&gt;&lt;/h1&gt;&lt;/p&gt;&#xA;" OwnerUserId="116741" LastEditorUserId="116741" LastEditDate="2023-02-28T22:08:25.513" LastActivityDate="2023-02-28T22:08:25.513" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25615" PostTypeId="2" ParentId="2140" CreationDate="2023-02-26T05:10:01.697" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/258550/sum-of-strings-utf-16-codepoints&quot;&gt;Sum of strings (UTF-16 codepoints)&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="116593" LastEditorUserId="116593" LastEditDate="2023-02-28T15:17:11.577" LastActivityDate="2023-02-28T15:17:11.577" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25616" PostTypeId="2" ParentId="2140" CreationDate="2023-02-26T14:06:35.760" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/258469/generate-a-permutation-from-the-high-water-marks&quot;&gt;Generate a permutation from the high-water marks&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2023-02-27T16:20:24.983" LastActivityDate="2023-02-27T16:20:24.983" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25617" PostTypeId="2" ParentId="2140" CreationDate="2023-02-26T23:33:31.247" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/258547/decoding-a-non-injective-bit-matrix-encoding&quot;&gt;Decoding a non injective bit matrix encoding&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="117081" LastEditorUserId="117081" LastEditDate="2023-02-28T14:34:22.787" LastActivityDate="2023-02-28T14:34:22.787" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25618" PostTypeId="2" ParentId="2140" CreationDate="2023-02-28T10:05:05.167" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/258642/110698&quot;&gt;Draw Parcly Taxel's cutie mark&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110698" LastEditorUserId="110698" LastEditDate="2023-03-01T17:48:52.327" LastActivityDate="2023-03-01T17:48:52.327" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25619" PostTypeId="2" ParentId="2140" CreationDate="2023-02-28T10:38:22.840" Score="0" Body="&lt;h1&gt;Find the sum of the sub-list with the largest sum&lt;/h1&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a list that contains an integer, a sub-list is a contiguous non-empty sequence of elements within that list.&lt;/p&gt;&#xA;&lt;p&gt;For example, the list &lt;span class=&quot;math-container&quot;&gt;\$[1, 3, -2, 5, -6]\$&lt;/span&gt;, has some sub-lists &lt;span class=&quot;math-container&quot;&gt;\$[1]\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$[3, -2]\$&lt;/span&gt;,  &lt;span class=&quot;math-container&quot;&gt;\$[3, -2, 5, -6]\$&lt;/span&gt;, etc.&lt;/p&gt;&#xA;&lt;p&gt;Your job today is to find the sum of the sub-list with the largest sum.&lt;/p&gt;&#xA;&lt;p&gt;For example &lt;span class=&quot;math-container&quot;&gt;\$[1, 3, -2, 5, -6]\$&lt;/span&gt;, the sum of the sub-list with the largest sum is &lt;span class=&quot;math-container&quot;&gt;\$7\$&lt;/span&gt;, the sub-list with the largest sum is  &lt;span class=&quot;math-container&quot;&gt;\$[1, 3, -2, 5]\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input / Output can be taken in any reasonable format, taking a list of numbers and returning a number, which is the sum of the sub-list with the largest sum&lt;/li&gt;&#xA;&lt;li&gt;The input array is guaranteed to have at least one element.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Testcases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1, 3, -2, 5, -6] -&amp;gt; 7&#xA;[-2, 1, -3, 4, -1, 2, 1, -5, 4] -&amp;gt; 6&#xA;[-3, -6, -8, -1] -&amp;gt; -1&#xA;[5, 4, -1, 7, 8] -&amp;gt; 23&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so shortest answer (in bytes) wins!&lt;/p&gt;&#xA;" OwnerUserId="108879" LastActivityDate="2023-02-28T10:38:22.840" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25620" PostTypeId="2" ParentId="2140" CreationDate="2023-02-28T12:26:48.433" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/258686/91213&quot;&gt;Largest Binary Area&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-03-02T13:46:09.287" LastActivityDate="2023-03-02T13:46:09.287" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25621" PostTypeId="2" ParentId="2140" CreationDate="2023-02-28T17:31:39.030" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/258605/110698&quot;&gt;Canonical form of a cubic Bézier curve&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110698" LastEditorUserId="110698" LastEditDate="2023-02-28T23:47:32.960" LastActivityDate="2023-02-28T23:47:32.960" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25622" PostTypeId="2" ParentId="20722" CreationDate="2023-03-01T02:44:50.547" Score="3" Body="&lt;p&gt;&lt;s&gt;My username is just my real name, Jacob.&lt;/s&gt;&lt;/p&gt;&#xA;&lt;p&gt;My name's &lt;strong&gt;NOODLE MAN!!!&lt;/strong&gt; From now on you will call me &lt;strong&gt;NOODLE MAN!!!&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;/p&gt;&#xA;&lt;p&gt;My PFP is a self portrait I drew a year ago, might update it at some point though.&lt;/p&gt;&#xA;" OwnerUserId="108687" LastEditorUserId="108687" LastEditDate="2023-05-30T11:15:45.343" LastActivityDate="2023-05-30T11:15:45.343" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25623" PostTypeId="2" ParentId="2140" CreationDate="2023-03-01T23:04:06.787" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/258710/generating-all-possible-equations-with-10-characters&quot;&gt;Generating all possible equations with 10 characters&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="117136" LastEditorUserId="117136" LastEditDate="2023-03-02T20:55:22.067" LastActivityDate="2023-03-02T20:55:22.067" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25624" PostTypeId="2" ParentId="20722" CreationDate="2023-03-02T05:46:55.020" Score="3" Body="&lt;p&gt;I created my username in 2012 when I was in Year 2 of NUS High School (roughly equivalent to US 8th grade), in the same process where I became a &lt;em&gt;My Little Pony: Friendship Is Magic&lt;/em&gt; (MLPFIM) fan and created the pony version of myself.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://derpibooru.org/images/2775280&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/FmB9K.png&quot; alt=&quot;Parcly and Spindle&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;At the time one of my main interests was organic chemistry, and I wanted a name for the pony based on some organic compound. My first choice was Paracet from paracetamol, but it didn't sound natural enough to me. I eventually found &lt;a href=&quot;https://en.wikipedia.org/wiki/Paclitaxel&quot; rel=&quot;nofollow noreferrer&quot;&gt;paclitaxel&lt;/a&gt; – a chemotherapeutic drug that famously took 30 years after discovery to market and famously was the target of a &lt;a href=&quot;https://en.wikipedia.org/wiki/Paclitaxel_total_synthesis&quot; rel=&quot;nofollow noreferrer&quot;&gt;total synthesis race&lt;/a&gt; in the early 1990s, just before I was born – and transformed the word to Parcly Taxel, complete with &lt;a href=&quot;https://en.wikipedia.org/wiki/Rhoticity_in_English&quot; rel=&quot;nofollow noreferrer&quot;&gt;an R I don't pronounce&lt;/a&gt;. (The name is pronounced park-ly tax-səl, and far too many ponies think at first that the first name is &lt;em&gt;Parsley&lt;/em&gt;.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/1/18/Paclitaxel-from-hydrate-xtal-Mercury-3D-sk.png&quot; alt=&quot;&quot; /&gt;&lt;/p&gt;&#xA;&lt;p&gt;Eventually I became a vector graphics artist drawing MLPFIM stuff, both canon characters and original characters. At the same time I developed tools to help with the art, which evolved into my first Git repository called &lt;a href=&quot;https://gitlab.com/parclytaxel/Kinross&quot; rel=&quot;nofollow noreferrer&quot;&gt;Kinross&lt;/a&gt; and the principal storage for my art called &lt;a href=&quot;https://gitlab.com/parclytaxel/Selwyn&quot; rel=&quot;nofollow noreferrer&quot;&gt;Selwyn&lt;/a&gt;. These &amp;quot;unusual&amp;quot; names in turn grew into one of my traditions: every Git repository I create must be named after a real-world location. (&lt;a href=&quot;https://gitlab.com/parclytaxel/Shinjuku&quot; rel=&quot;nofollow noreferrer&quot;&gt;Shinjuku&lt;/a&gt;, &lt;a href=&quot;https://gitlab.com/parclytaxel/Malibu&quot; rel=&quot;nofollow noreferrer&quot;&gt;Malibu&lt;/a&gt;, &lt;a href=&quot;https://github.com/Parcly-Taxel/Shibuya&quot; rel=&quot;nofollow noreferrer&quot;&gt;Shibuya&lt;/a&gt;, &lt;a href=&quot;https://github.com/Parcly-Taxel/Skopje&quot; rel=&quot;nofollow noreferrer&quot;&gt;Skopje&lt;/a&gt;…)&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://derpibooru.org/images/2414808&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/hhjaU.png&quot; alt=&quot;92, Uranium – I did a &amp;quot;periodic table of ponies&amp;quot; project from 2020 to 2021&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://derpibooru.org/images/1792763&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/9zINA.png&quot; alt=&quot;Six Alicorns. Parcly is, in my backstory, on par with MLPFIM's canon royalty&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Parcly's backstory developed alongside the art. In August 2013 she became a wish-granting genie. She then gained a windigo companion called Spindle in late 2015 – the ghostly horse in the first picture of this answer. I have been regularly commissioning others to draw pictures of Parcly as well.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://derpibooru.org/images/1407349&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/yL4GT.png&quot; alt=&quot;By Beardie&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Although MLPFIM is considered part of the furry fandom, it took until 2021 for me to draw more general furry art. I created my own furry characters; my &amp;quot;fursona&amp;quot; (that represents myself in the furry world) is a female tiger genie called Tori Taxel, whose species is also my Chinese zodiac sign. (I am a Chinese Singaporean after all.) Her husband is a chimeric dullahan called Hearth Taxel.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://furbooru.org/images/198527&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/p6jgo.png&quot; alt=&quot;By Arztin. Tori being a taur, this also plays on my real-life Western zodiac sign&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://furbooru.org/images/204973&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/btsVY.png&quot; alt=&quot;By A-Lovy&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;The &amp;quot;bat in a hexagon&amp;quot; avatar I use alongside the Parcly Taxel name is the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/258642&quot;&gt;cutie mark&lt;/a&gt; of a &lt;a href=&quot;https://derpibooru.org/tags/bat+pony&quot; rel=&quot;nofollow noreferrer&quot;&gt;bat pony&lt;/a&gt; form of Parcly. Fluttershy became one in an MLPFIM episode, and her cutie mark changed from three butterflies to three bats; this change is sometimes emulated with original character bat ponies, including here.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://derpibooru.org/images/1063504&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/1BCVl.png&quot; alt=&quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The background of my avatar is RGB &lt;code&gt;#230F38&lt;/code&gt;. This colour and the three colours in Parcly's cutie mark (exactly the same across normal and bat pony versions) are also used in the logos of many of my Git repositories, giving a common theme.&lt;/p&gt;&#xA;" OwnerUserId="110698" LastEditorUserId="110698" LastEditDate="2023-03-06T16:03:24.283" LastActivityDate="2023-03-06T16:03:24.283" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25625" PostTypeId="2" ParentId="2140" CreationDate="2023-03-02T23:08:10.457" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/258738/110698&quot;&gt;Simulate Just Friends&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110698" LastEditorUserId="110698" LastEditDate="2023-03-03T16:07:50.907" LastActivityDate="2023-03-03T16:07:50.907" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25626" PostTypeId="2" ParentId="2140" CreationDate="2023-03-02T23:34:13.033" Score="-3" Body="&lt;h1&gt;See Those Sorts&lt;/h1&gt;&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-popularity-contest-tooltip-container&quot;&gt;popularity-contest&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-sorting-tooltip-container&quot;&gt;sorting&lt;/a&gt;&#xA;&lt;p&gt;Using shapes or Unicode, show how some array of numbers is sorted with a particular sorting method. You should include selection sort, merge sort, bubble sort, quick sort, bogo sort, and at least one other sort you find interesting (maybe try one of &lt;a href=&quot;https://www.geeksforgeeks.org/sorting-algorithms/&quot; rel=&quot;nofollow noreferrer&quot;&gt;these&lt;/a&gt;).&lt;/p&gt;&#xA;&lt;p&gt;Make sure that the speed of the sort corresponds to the actual performance on your computer. You can try adding a constant multiplier to the speed if you want.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;Someone watched sort videos :)&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="116741" LastActivityDate="2023-03-02T23:34:13.033" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25627" PostTypeId="2" ParentId="2140" CreationDate="2023-03-03T21:10:20.647" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/258870/generate-number-from-given-range&quot;&gt;Generate number from given range&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="116593" LastEditorUserId="116593" LastEditDate="2023-03-06T14:34:23.503" LastActivityDate="2023-03-06T14:34:23.503" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="25628" PostTypeId="2" ParentId="2140" CreationDate="2023-03-05T18:57:34.043" Score="2" Body="&lt;h1&gt;All languages have their strengths, right? (Cops' thread) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-cops-and-robbers-tooltip-container&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;This is the cops' thread of a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-cops-and-robbers-tooltip-container&quot;&gt;cops-and-robbers&lt;/a&gt; challenge. The robbers' thread can be found [here] (&lt;strong&gt;sandbox note&lt;/strong&gt;: will add the link when posting)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;The main idea of this challenge is whether there are languages which are always better than some other ones for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;As a cop, you will choose two languages, and claim that one of them (let's call it A) will always be better for code golf than the other (let's call it B). You post starts as uncracked.&lt;/p&gt;&#xA;&lt;p&gt;Robbers have two avenues to crack your post:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If they think your claim is wrong, they can crack it by giving a code golf task and a solution to it in B.&lt;/li&gt;&#xA;&lt;li&gt;If they think your claim is right, they can crack it by proving it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If your post was cracked by a counterexample, you can counter the crack by giving a solution in A which is shorter than the given solution in B. This invalidates their crack, and makes your post uncracked once again. Robbers can now attempt to crack it again.&lt;/p&gt;&#xA;&lt;p&gt;If your post was cracked by a proof you can't counter it (assuming the proof is correct).&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Each cop gains 1 point for every uncracked post, and loses 1 point for every cracked post. The goal is to get as many points as possible.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Both languages must be freely available.&lt;/li&gt;&#xA;&lt;li&gt;Your claim must not be implied by &lt;a href=&quot;https://en.wikipedia.org/wiki/Transitive_relation&quot; rel=&quot;nofollow noreferrer&quot;&gt;transitivity&lt;/a&gt; from existing uncracked posts.&lt;/li&gt;&#xA;&lt;li&gt;The robbers' tasks must disallow all &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;standard loopholes&lt;/a&gt;, and allow all &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;standard I/O methods&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The robbers' tasks must only have textual I/O.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;All languages have their strengths, right? (Robbers' thread) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-cops-and-robbers-tooltip-container&quot;&gt;cops-and-robbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;This is the robbers' thread of a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-cops-and-robbers-tooltip-container&quot;&gt;cops-and-robbers&lt;/a&gt; challenge. The cops' thread can be found [here] (&lt;strong&gt;sandbox note&lt;/strong&gt;: will add the link when posting)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;The main idea of this challenge is whether there are languages which are always better than some other ones for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;As a robber, you have two ways to crack a claim:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If you think the claim is wrong, you can crack it by giving a code golf task and a solution to it in the language the claim states is worse.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This crack can be countered by the cop finding a shorter solution in the language they claim is better.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;If you think the claim is right, you can crack it by proving it.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This crack can't be countered as long as the proof is correct.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Each robber gains 1 point for every uncountered robbers post, and loses 1 point for every countered robbers post. The goal is to get as many points as possible.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your task must disallow all &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;standard loopholes&lt;/a&gt;, and allow all &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;standard I/O methods&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;You task can only use textual I/O.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Sandbox Questions&lt;/h1&gt;&#xA;&lt;p&gt;Does this format, where a cop claims something, a robber tries to refute/prove it, and the cop tries to defend it, seem interesting? Is it on-topic? What tags are appropriate? I haven't seen it before.&lt;/p&gt;&#xA;&lt;p&gt;How should I disallow some types of builtins? I want to avoid the challenge turning to &amp;quot;find a builtin the other language doesn't have&amp;quot;. In particular, if &lt;code&gt;eval&lt;/code&gt; is allowed then the challenge of &amp;quot;Evaluate this language&amp;quot; will almost always be a universal robbers solution. However, I'm not sure how those builtins can be classified.&lt;/p&gt;&#xA;&lt;p&gt;How should I prevent &amp;quot;output this specific error string&amp;quot; as a universal robbers solution?&lt;/p&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2023-03-08T17:15:15.327" LastActivityDate="2023-03-08T17:15:15.327" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25629" PostTypeId="1" AcceptedAnswerId="25630" CreationDate="2023-03-06T07:28:02.667" Score="12" ViewCount="307" Body="&lt;p&gt;It's been &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=62401514#62401514&quot;&gt;asked a&lt;/a&gt; &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=62437016#62437016&quot;&gt;few times&lt;/a&gt; in chat whether or not Code Golf Meta can be used as a means of promoting Area51 site proposals that are relevant to the realm of Code Golf. The answer has always been &amp;quot;no&amp;quot;, with &lt;a href=&quot;https://meta.stackexchange.com/a/96971/391137&quot;&gt;this SE Meta post linked&lt;/a&gt; as to why it's &amp;quot;off-topic&amp;quot; for our meta.&lt;/p&gt;&#xA;&lt;p&gt;However, that answer is from 12 years ago, and SE culture has significantly changed, as has Code Golf culture. Area 51 proposals aren't as common as they used to be, and a lot of new site proposals fail because they are either ignored or too broad. It's time to reassess whether or not cross-site promotion is allowed here on meta.&lt;/p&gt;&#xA;&lt;h2&gt;What is Allowed on Meta?&lt;/h2&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.stackexchange.com/help/whats-meta&quot;&gt;help center says&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Meta Code Golf Stack Exchange is the part of the site where users&#xA;discuss the workings and policies of Code Golf Stack Exchange rather&#xA;than discussing programming puzzles or code golf itself. It is&#xA;separated from the main Q&amp;amp;A to reduce noise there while providing a&#xA;legitimate space for people to ask how and why this site works the way&#xA;it does. Meta is for...&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Code Golf Stack Exchange users to communicate with each other about Code Golf Stack Exchange (asking questions about how the&#xA;websites work, or about policies and community decisions)&lt;/li&gt;&#xA;&lt;li&gt;Code Golf Stack Exchange users to communicate with Stack Overflow, the company (posting bugs, suggesting improvements, or&#xA;proposing new features), and&lt;/li&gt;&#xA;&lt;li&gt;Stack Overflow, the company, to communicate with the community (soliciting feedback on new ideas or features, or discussing policies&#xA;that affect the whole network)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Under this definition, Area 51 proposal promotion is not on-topic for Code Golf Meta. But under this definition, posts and events like &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/19271/reviving-language-of-the-month-pick-up-where-we-left-off-or-start-over&quot;&gt;Language of the Month&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/25541/best-of-cgcc-2023-call-for-categories&quot;&gt;Best of CGCC&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/20722/the-many-users-of-cgcc&quot;&gt;The Many Users of CGCC&lt;/a&gt; and even &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges&quot;&gt;The Sandbox&lt;/a&gt; are off-topic - those posts aren't: a) about how the Code Golf website works, b) about code golf site policies and c) about community decisions (decisions here being interpreted like &amp;quot;why do we have consensus X&amp;quot;). Yet those posts haven't been closed.&lt;/p&gt;&#xA;&lt;p&gt;However, the help center also says this about meta:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Please look around to see if your question has been asked before, and avoid asking questions that have nothing to do with Code Golf Stack Exchange or the Stack Exchange network.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The posts I listed before are on-topic because they are relevant to the Code Golf Stack Exchange site and the Code Golf community. Advertisements for Area 51 proposals that are relevant to the Code Golf community are, well, relevant to the Code Golf community, and should have a chance at being considered on-topic by the above definition.&lt;/p&gt;&#xA;&lt;h2&gt;But the Default Policy is That Area 51 Proposals Aren't Allowed!&lt;/h2&gt;&#xA;&lt;p&gt;To which I say &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8350/78850&quot;&gt;we don't&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7085/78850&quot;&gt;always follow&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7085/78850&quot;&gt;what's default&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/7041/78850&quot;&gt;for StackExchange sites&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;As a network site, we've always stuck out from all the other sites by requesting/having features that would otherwise be declined for other sites. Allowing Area 51 proposal promotions to be on-topic despite the fact that other sites don't shouldn't be the sole reason for declining this request.&lt;/p&gt;&#xA;&lt;p&gt;And we wouldn't be the first site to override the default: &lt;a href=&quot;https://anime.meta.stackexchange.com/questions/984/the-japanese-culture-qa-proposal-is-in-need-of-support&quot;&gt;it's&lt;/a&gt;, &lt;a href=&quot;https://cs.meta.stackexchange.com/q/1842&quot;&gt;been&lt;/a&gt; &lt;a href=&quot;https://softwareengineering.meta.stackexchange.com/questions/2439/the-workplace-is-now-in-the-commitment-phase&quot;&gt;done&lt;/a&gt; &lt;a href=&quot;https://puzzling.meta.stackexchange.com/q/6493/46754&quot;&gt;elsewhere&lt;/a&gt;. So clearly, the default is made to be overwritten.&lt;/p&gt;&#xA;&lt;h2&gt;But if Area 51 Proposals are Allowed, They'll Become Spam!&lt;/h2&gt;&#xA;&lt;p&gt;That's assuming there are no controls placed on what proposals are allowed to be promoted. In practice, only proposals reasonably relevant to the site would be allowed. For example, a proposal about &lt;a href=&quot;https://area51.stackexchange.com/proposals/127456/programming-language-design-and-implementation?referrer=ZmFhMzVjMGU2ZDQyMDhjMzA3ZDY3OTZhOTY1ZWM0ODQyNjQ4NTRjYzg1ZjM4NDU2NDAxMzQ5ZGY1N2ZkY2IxMRQWsaGpQio2yfvqedsoOTensd8K2Z4VWbG3h7_mw7LT0&quot;&gt;Programming Language Design and Implementation&lt;/a&gt; would be relevant to the site, because it greatly intersects with the popular activity of golfing language and esolang design. On the other hand, a proposal about &lt;a href=&quot;https://area51.stackexchange.com/proposals/127654/agriculture&quot;&gt;Agriculture&lt;/a&gt; wouldn't be relevant to the site, because, well, we don't really do agriculture here.&lt;/p&gt;&#xA;&lt;h2&gt;But Area 51 Has Site Categories to Group Relevant Proposals!&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;We have already started grouping proposals into &amp;quot;Categories&amp;quot; so we can advertise them to sites that might share an interest.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;em&gt;(from &lt;a href=&quot;https://meta.stackexchange.com/a/96971/391137&quot;&gt;the SE Meta post that defaults to calling A51 promotion off-topic&lt;/a&gt;)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Be honest, unless you're already involved with a proposal, how many times do you just casually check the Area 51 proposals? I'd be willing to bet &amp;quot;almost never&amp;quot; would be the main response. The idea of &amp;quot;Categories&amp;quot; is only as effective as the user base of Area 51, which is already an obscure SE site.&lt;/p&gt;&#xA;&lt;p&gt;And what about the code golfers who would be otherwise interested in relevant Area 51 site proposals who don't know about Area 51 at all? Do they just have to miss out on joining a site they'd love to be involved with?&lt;/p&gt;&#xA;&lt;h2&gt;Why not Just Post About Proposals in Chat?&lt;/h2&gt;&#xA;&lt;p&gt;Posting about relevant site proposals in chat is perfectly fine. But the reach of chat is just as niche as the reach of Area 51 on its own - the good majority of Code Golf site users never touch chat (as indicated by the fact that there are only ever really 20 users at a time in the room - usually less). The whole point of posting a proposal on Code Golf Meta is to potentially appeal to the wide user-base of Code Golfers. Just posting in chat doesn't accomplish that goal at all.&lt;/p&gt;&#xA;&lt;h2&gt;Make a Community Ad Like the Meta Default Suggests&lt;/h2&gt;&#xA;&lt;p&gt;There are 3 key problems with making a community ad for site proposals:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A community ad would last the span of an entire year, and the site might reach private beta/proper beta (or even be abandoned/closed) during that year. This consequently takes up an advertisement slot that would otherwise be usable by a more persistent community ad. And while ads may have been able to be deleted in previous years, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/23537/78850&quot;&gt;SE decided that community ads can't be changed or deleted in 2021&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The 2021 changes to community ads means that SE might decide that Area 51 proposals aren't allowed as community ads:&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Finally, ads can not be promoting products nor soliciting programmer time or resources for: knowledge sharing or collaboration tools for technologists, or for sites where ad buyers are primarily targeting technologists.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;While they might make exceptions for StackExchange sites, it's still unclear whether they would allow such ads.&lt;/p&gt;&#xA;&lt;ol start=&quot;3&quot;&gt;&#xA;&lt;li&gt;It's unclear whether SE will continue running community ads, and whether they're still dedicated to them. For the entirety of 2022, there were no community ads, and &lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=62924691#62924691&quot;&gt;we won't be getting any ads for the first half of the year, with no confirmation they're coming at all&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Quite frankly, community ads for Area 51 proposals are unreliable and wasteful, because of how community ads are structured.&lt;/p&gt;&#xA;&lt;h2&gt;Advertising of Proposals Should be Done on External Sites to Make Sure an Actual Community Exists&lt;/h2&gt;&#xA;&lt;p&gt;Sure, but advertising on Code Golf Meta should be allowed in addition to advertising on sites like Reddit and Discord. Part of the actual community might not be on Reddit or discord or other sites, but on StackExchange. I think this part of the SE Meta post is to say &amp;quot;don't rely &lt;em&gt;solely&lt;/em&gt; on SE network traffic.&amp;quot;&lt;/p&gt;&#xA;&lt;h2&gt;Conclusion&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;tl;dr&lt;/strong&gt;: The &lt;a href=&quot;https://meta.stackexchange.com/a/96971/391137&quot;&gt;SE meta post saying that Area51 proposals are off-topic on per-site metas&lt;/a&gt; is severely outdated, and only a default option for sites at best.&lt;/p&gt;&#xA;&lt;p&gt;The community should decide whether it wants Area 51 proposal promotions to be on-topic. After all, &lt;a href=&quot;https://stackoverflow.blog/2009/05/18/a-theory-of-moderation/&quot;&gt;moderators are but human exception handlers&lt;/a&gt;. Hence this meta post gives a chance to decide with votes whether Area 51 proposals should be allowed.&lt;/p&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2023-03-06T07:28:02.667" Title="Please Allow the Community to Advertise Relevant Area 51 Proposals on Meta" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25630" PostTypeId="2" ParentId="25629" CreationDate="2023-03-06T07:28:02.667" Score="17" Body="&lt;h1&gt;Yes, Area 51 Proposal Promotion Should be On-Topic for Code Golf Meta&lt;/h1&gt;&#xA;&lt;p&gt;As per the reasons expressed in the question, Area 51 proposals should be considered on-topic on Code Golf Meta.&lt;/p&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2023-03-06T07:28:02.667" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25631" PostTypeId="2" ParentId="1061" CreationDate="2023-03-06T12:37:18.720" Score="1" Body="&lt;h1&gt;Teaming up in a KOTH&lt;/h1&gt;&#xA;&lt;p&gt;Each KOTH bot must try for its own win. If a bot has logic that specifically benefits a different bot, &lt;em&gt;especially&lt;/em&gt; a bot by the same author, that wouldn't be fair. Then you could &amp;quot;win&amp;quot; simply by submitting a large number of teaming bots.&lt;/p&gt;&#xA;&lt;p&gt;Conversely, targeting a specific bot to hurt them is also unfair. Of course, efficient counter-play is part of any winning strategy, but long as you are targeting a range of bots and not anyone specific that is ok.&lt;/p&gt;&#xA;&lt;p&gt;It is also OK if your winning strategy ends up benefiting some other bot without explicitly targeting it.&lt;/p&gt;&#xA;&lt;p&gt;Examples that would violate this:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/248557/91213&quot;&gt;https://codegolf.stackexchange.com/a/248557/91213&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-04-14T11:09:04.673" LastActivityDate="2023-04-14T11:09:04.673" CommentCount="1" CommunityOwnedDate="2023-03-06T12:37:18.720" ContentLicense="CC BY-SA 4.0" />
  <row Id="25632" PostTypeId="2" ParentId="2140" CreationDate="2023-03-06T17:33:43.853" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/258896/110698&quot;&gt;The topology of origami&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110698" LastEditorUserId="110698" LastEditDate="2023-03-07T01:41:33.870" LastActivityDate="2023-03-07T01:41:33.870" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25633" PostTypeId="2" ParentId="2140" CreationDate="2023-03-07T15:37:10.693" Score="3" Body="&lt;h1&gt;Calculate the p-adic square root of -1&lt;/h1&gt;&#xA;&lt;p&gt;Given a &lt;strong&gt;prime&lt;/strong&gt; number &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt;, a &lt;em&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/P-adic_number&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt;-adic number&lt;/a&gt;&lt;/em&gt; is a number whose representation in base &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt; may have infinitely digits to the left of the radix point, but only finitely many digits to the right of it. A &lt;em&gt;&lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt;-adic integer&lt;/em&gt; has no digits after the radix point.&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt;-adic numbers have some interesting properties. It can be proven that for any prime number &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt;, there exists a &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt;-adic integer &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$x^2 = -1\$&lt;/span&gt; if and only if the congruence &lt;span class=&quot;math-container&quot;&gt;\$x_0^2 \equiv -1 \pmod{p}\$&lt;/span&gt; has a solution. (That is, there is some integer &lt;span class=&quot;math-container&quot;&gt;\$x_0\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$x_0^2 + 1\$&lt;/span&gt; is divisible by &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt;.)&lt;/p&gt;&#xA;&lt;p&gt;Your task is to determine whether this is the case and calculate the digits of the number &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;. Note that there will always be two solutions which are additive inverses of each other; you only need to calculate one.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;A prime number &lt;span class=&quot;math-container&quot;&gt;\$p \ne 2\$&lt;/span&gt;. (You don't need to verify that it's prime.)&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Find the digits of the &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt;-adic square root of &lt;span class=&quot;math-container&quot;&gt;\$-1\$&lt;/span&gt;, as described above. Following the standard &lt;code&gt;sequence&lt;/code&gt; rules, do one of the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Given an index &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt;, output the &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt;-th digit from the end. Since base representations are naturally 0-indexed, you may &lt;strong&gt;not&lt;/strong&gt; use 1-indexing.&lt;/li&gt;&#xA;&lt;li&gt;Given a positive integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, output the last &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; digits. You can choose between little-endian and big-endian.&lt;/li&gt;&#xA;&lt;li&gt;Output all digits in the form of a non-halting program, a generator, an infitite lazy list, etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If the &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt;-adic square root of &lt;span class=&quot;math-container&quot;&gt;\$-1\$&lt;/span&gt; does not exist, do anything that can be clearly distinguished from a valid output, such as raising an exception or returning an empty list.&lt;/p&gt;&#xA;&lt;h2&gt;Algorithm&lt;/h2&gt;&#xA;&lt;p&gt;Here I describe one possible way to solve this challenge.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Find a number &lt;span class=&quot;math-container&quot;&gt;\$x_0\$&lt;/span&gt; between &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$p-1\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$x_0^2 \equiv -1 \pmod{p}\$&lt;/span&gt;. If not found, report failure.&lt;/li&gt;&#xA;&lt;li&gt;Find a number &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt; between &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$p-1\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$2x_0y \equiv 1 \pmod{p}\$&lt;/span&gt;. (This is always possible.)&lt;/li&gt;&#xA;&lt;li&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$c_0 = \left\lfloor\frac{x_0}{p}\right\rfloor\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;For each positive integer &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt;:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$h_i = c_{i-1} + \sum_{j=1}^{i-1} x_j x_{i-j}\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$x_i = (p-1-h_i)\cdot y \bmod p\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$c_i = \left\lfloor\frac{h_i + 2 x_0 x_i}{p}\right\rfloor\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The sequence &lt;span class=&quot;math-container&quot;&gt;\$\left(x_i\right)\$&lt;/span&gt; is the output.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Ungolfed Python implementation:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;def sqrt_minus_one(p, n):&#xA;    for x in range(p):&#xA;        if (x * x + 1) % p == 0:&#xA;            last_digit = x&#xA;            break&#xA;    else:&#xA;        return None # no solution&#xA;    for x in range(p):&#xA;        if (x * 2 * last_digit) % p == 1:&#xA;            inv = x&#xA;    digits = [last_digit]&#xA;    carry = (last_digit * last_digit) // p&#xA;    for i in range(1, n):&#xA;        h = sum(digits[j] * digits[i - j] for j in range(1, i)) + carry&#xA;        digits.append((p - 1 - h) * inv % p)&#xA;        carry = (h + 2 * last_digit * digits[i]) // p&#xA;    return digits&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;It's also possible to use a brute-force approach where you find an &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-digit number &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$x^2 + 1\$&lt;/span&gt; ends with &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; zeroes in base &lt;span class=&quot;math-container&quot;&gt;\$p\$&lt;/span&gt;. I suppose this could lead to much golfier solutions, so maybe I should make the challenge &lt;code&gt;restricted-complexity&lt;/code&gt; to forbid this?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;  p | first 20 digits (two possible outputs)&#xA;  3 | ---&#xA;  5 | 2,1,2,1,3,4,2,3,0,3,2,2,0,4,1,3,2,4,0,4&#xA;    | 3,3,2,3,1,0,2,1,4,1,2,2,4,0,3,1,2,0,4,0&#xA;  7 | ---&#xA; 11 | ---&#xA; 13 | 5,5,1,0,5,5,1,0,1,8,8,6,12,6,3,0,4,7,4,5&#xA;    | 8,7,11,12,7,7,11,12,11,4,4,6,0,6,9,12,8,5,8,7&#xA; 17 | 4,2,10,5,12,16,12,8,13,3,14,0,6,1,0,15,1,8,14,5&#xA;    | 13,14,6,11,4,0,4,8,3,13,2,16,10,15,16,1,15,8,2,11&#xA; 47 | ---&#xA;101 | 10,5,29,66,10,30,44,29,72,25,34,82,83,5,52,17,67,94,65,52&#xA;    | 91,95,71,34,90,70,56,71,28,75,66,18,17,95,48,83,33,6,35,48&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="98955" LastEditorUserId="92727" LastEditDate="2023-03-08T10:32:24.850" LastActivityDate="2023-03-08T10:32:24.850" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25634" PostTypeId="2" ParentId="2140" CreationDate="2023-03-07T17:12:17.680" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/258918/triangularly-embed-a-graph-on-a-surface&quot;&gt;Triangularly embed a graph on a surface&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110698" LastEditorUserId="110698" LastEditDate="2023-03-07T20:03:09.447" LastActivityDate="2023-03-07T20:03:09.447" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25636" PostTypeId="2" ParentId="2140" CreationDate="2023-03-08T10:59:39.873" Score="0" Body="&lt;h1&gt;Guessing on straws&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Dedicated to Martin Gardner, taken from his book&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;In the old days, the Slavs had such divination. One girl was clutching six straws in her fist, and her friend was pairing first the top and then the bottom ends. If all straws were ring-tagged, the girl would be married.&lt;/p&gt;&#xA;&lt;h2&gt;Goal of challenge&lt;/h2&gt;&#xA;&lt;p&gt;Having the number of straws and the binding schemes, determine whether the single hole cycle will result.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/2AtLQ.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/2AtLQ.jpg&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Number of straws &lt;code&gt;N&lt;/code&gt;, even integer &lt;code&gt;&amp;gt;= 2&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Two nested lists as top and bottom links, for instance &lt;code&gt;[[1, 4], [2, 5], [6, 3]]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;em&gt;Schemes may be valid or invalid!&lt;/em&gt;&#xA;&lt;em&gt;On one hand,&lt;/em&gt; it is guaranteed that are used only positive integers not more &lt;code&gt;N&lt;/code&gt;;&#xA;no self-links (&lt;code&gt;[1, 1]&lt;/code&gt;), no tautologies (&lt;code&gt;[[1, 2], [2, 1], …]&lt;/code&gt;), no broken lists (&lt;code&gt;[[1], [ ], …]&lt;/code&gt;) etc.&lt;/p&gt;&#xA;&lt;p&gt;Please note, that pairs are unordered, so eg  &lt;code&gt;[[1, 4], [2, 5], [6, 3]]&lt;/code&gt; and &lt;code&gt;[[4, 1], [2, 5], [3, 6]]&lt;/code&gt; both valid (and equivalent) schemes.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;But&lt;/em&gt; due to the girl’s inattention, followed cases can take place:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Missing pair (one or more): &lt;code&gt;[[1, 4], [6, 3]]&lt;/code&gt;, &lt;code&gt;[[1, 10], [4, 5], [3, 7]]&lt;/code&gt; etc.&lt;/li&gt;&#xA;&lt;li&gt;More than two binding straws: &lt;code&gt;[[1, 4], [1, 5], [2, 6]]&lt;/code&gt; (and as result, free straws)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;All of these inputs are invalid, your program must detect them and stop with appropriate message (see below).&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Any three distinct symbols for &amp;quot;Invalid input&amp;quot;, &amp;quot;No loop&amp;quot;, &amp;quot;Has loop&amp;quot; cases.&#xA;Suitable for golfing on your language:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;-1&lt;/code&gt; for invalid input, &lt;code&gt;0&lt;/code&gt; for &amp;quot;No loop&amp;quot;, &lt;code&gt;1&lt;/code&gt; for &amp;quot;Loop&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;None&lt;/code&gt;, &lt;code&gt;False&lt;/code&gt; and &lt;code&gt;True&lt;/code&gt; respectively&lt;br /&gt;&#xA;etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;N: 2, TopLinks: [[1, 2]], BottomLinks: [[2, 1]]  → True&#xA;&#xA;N: 4, TopLinks: [[1, 2], [3, 4]], BottomLinks: [[2, 1], [3, 4] ]  → False&#xA;&#xA;N: 4, TopLinks: [[1, 2], [2, 4]], BottomLinks: [[2, 1], [3, 4], [3, 2] ]  → Invalid&#xA;&#xA;N: 8, TopLinks: [[1, 2], [3, 4], [6, 5], [7, 8]], &#xA;BottomLinks: [[8, 1], [3, 2], [4, 5], [7, 6] ]  → True&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="114511" LastEditorUserId="114511" LastEditDate="2023-03-08T11:25:22.303" LastActivityDate="2023-03-08T11:25:22.303" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25637" PostTypeId="2" ParentId="2140" CreationDate="2023-03-08T12:04:03.607" Score="0" Body="&lt;h1&gt;Shortest Code to Implement a Simple Encryption Algorithm&lt;/h1&gt;&#xA;&lt;p&gt;Write a program or function that implements a simple encryption algorithm. The algorithm takes in a string of ASCII characters and a key, and outputs an encrypted string.&lt;/p&gt;&#xA;&lt;h2&gt;Encryption Algorithm&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Convert each character in the input string to its ASCII value&lt;/li&gt;&#xA;&lt;li&gt;XOR each ASCII value with the corresponding byte in the key (cycling through the key if necessary)&lt;/li&gt;&#xA;&lt;li&gt;Convert the resulting XOR values back to ASCII characters&lt;/li&gt;&#xA;&lt;li&gt;Concatenate the ASCII characters into a single string and output the result&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Your program or function should take in two inputs:&lt;/p&gt;&#xA;&lt;p&gt;A string of ASCII characters (up to 1024 characters in length)&#xA;A key string (up to 1024 characters in length)&#xA;Your program or function should output a single string representing the encrypted message.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA;message: &amp;quot;Hello World&amp;quot;&#xA;key: &amp;quot;secret&amp;quot;&#xA;Output:&#xA;&amp;quot;UW]cU\xf3M]Z]^Y&amp;quot;&#xA;&#xA;Input:&#xA;message: &amp;quot;12345&amp;quot;&#xA;key: &amp;quot;password&amp;quot;&#xA;Output:&#xA;&amp;quot;^%-'$#&amp;quot;&#xA;&#xA;Input:&#xA;message: &amp;quot;This is a test message&amp;quot;&#xA;key: &amp;quot;key&amp;quot;&#xA;Output:&#xA;&amp;quot;\x03\x1a\x1c\x17\x02\x0eP\bI\x11\x07\x14N\x1d\x10M\r\b\x1f&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is a codegolf challenge, so the goal is to write the shortest possible implementation of the encryption algorithm. The winner will be determined based on the length of their code, with ties broken by earlier submission time.&lt;/p&gt;&#xA;" OwnerUserId="117040" LastActivityDate="2023-03-08T12:04:03.607" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25638" PostTypeId="2" ParentId="20722" CreationDate="2023-03-08T12:33:54.287" Score="2" Body="&lt;p&gt;My pfp contains the image of Sophie Germain, it is nothing more than everything to me... I wish sometimes I could go back in time and tell her, that I am obsessed with her, and my love and respect for her will stay regardless of the time. That's all to say.&lt;/p&gt;&#xA;&lt;p&gt;Long live &lt;a href=&quot;https://codegolf.stackexchange.com/questions/258817/imtiaz-germain-primes&quot;&gt;Imtiaz Germain primes&lt;/a&gt;!&lt;/p&gt;&#xA;&lt;p&gt;Edit: I removed her picture and now it's mine here &lt;/p&gt;&#xA;" OwnerUserId="117040" LastEditorUserId="117040" LastEditDate="2024-01-04T19:13:48.853" LastActivityDate="2024-01-04T19:13:48.853" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25639" PostTypeId="2" ParentId="2140" CreationDate="2023-03-08T14:08:56.087" Score="2" Body="&lt;h1&gt;Convert imperative code to functional&lt;/h1&gt;&#xA;&lt;h2&gt;The imperative language&lt;/h2&gt;&#xA;&lt;p&gt;We'll consider 2 very simple languages, first a imperative one. The imperative language is a list of statements. Statements can be one of these 4 expressions:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[literal] // a literal&#xA;[variable] // a variable&#xA;([expression] # [expression]) // Some arbitrary operator&#xA;([expression] $ [expression]) // Some different arbitrary operator&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Or one of these 3 statements:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[variable] = [expression] // assignment&#xA;while [expression] { [statement]* } // looping&#xA;if [expression] { [statement] } // condition&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The last line is guaranteed to be a expression and it's value is the output of the entire program.&lt;/p&gt;&#xA;&lt;p&gt;Note: Syntax isn't important here. You can take input as any arbitrary tree like structure. There is also no fixed format for variables, you can use any arbitrary infinite series to represent variables, and the same for literals. As long as all 6 values are distinct, you are good to go.&lt;/p&gt;&#xA;&lt;p&gt;For example, take this code:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a=(5 # 2)&#xA;a=(a $ 7)&#xA;8 # a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This program would output &lt;code&gt;8&lt;/code&gt;. You could represent this like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;    {op:'=', left:0, right:{op:'#',left:5,right:2},&#xA;    {op:'=', left:0, right:{op:'$',left:{op:'var',var:0},right:7},&#xA;    {op:'#',left:8,right:{op:'var',var:0}}&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Or even more concisely &lt;code&gt;[[4,0,[2,[0,5],[0,2]]],[4,0,[3,[1,0],[0,7]]],[2,[0,8],[1,0]]]&lt;/code&gt;. Where the first number represents the index of the expression type and the rest the arguments.&lt;/p&gt;&#xA;&lt;p&gt;The operators are guarenteed to be saf&lt;/p&gt;&#xA;&lt;h2&gt;The functional language&lt;/h2&gt;&#xA;&lt;p&gt;The functional language has the following builtins:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[literal]         // a literal&#xA;[variable]        // a variable&#xA;(# [expr] [expr]) // one arbitrary operation, you don't need to worry about what it does&#xA;($ [expr] [expr]) // another arbitrary operation&#xA;(? [expr] [expr] [expr]) // if expression is truthy, return the first expression, otherwise the second&#xA;(lambda [variable]* [expr]) // define a function&#xA;([expr] [expr]*) // call a function with the given arguments&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Again, you can use any built in tree-like structure to represent this, and use any data type with a potentially infinite number of items to represent variables and literals.&lt;/p&gt;&#xA;&lt;h2&gt;Your task&lt;/h2&gt;&#xA;&lt;p&gt;Your task is to convert some code in the imperative language to the functional equivalent. For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a=12&#xA;b=15&#xA;if b # a {&#xA;   b = b $ 12&#xA;}&#xA;c=(a # 12) $ (a # 18)&#xA;while a $ (a # b) {&#xA;    a = a # (c $ b)&#xA;}&#xA;a&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Could be converted to:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(&#xA;   (lambda a:&#xA;       (lambda b:&#xA;           (lambda b:&#xA;                (lambda c:&#xA;                    (lambda y:&#xA;                        (&#xA;                            y,&#xA;                            lambda q: (&#xA;                                  lambda a: (&#xA;                                       lambda a: a,&#xA;                                       (? ($ a ($ a b)) (q (# a ($ c b)))) a)&#xA;                                  )&#xA;                            ), a)&#xA;                        )&#xA;                    ),&#xA;                    lambda a: (a a)&#xA;                ),&#xA;                ($ (# a 12) (# b 18))&#xA;           ),&#xA;           ((? (# b a) ($ b 12) b)&#xA;       ),&#xA;       15&#xA;   )),&#xA;   12&#xA;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is code golf, shortest code wins. Size of the output is irrelevant, specifically you can just repeat the y combinator every loop.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2023-03-08T14:08:56.087" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25642" PostTypeId="1" CreationDate="2023-03-09T15:49:42.083" Score="15" ViewCount="276" Body="&lt;p&gt;Interested in designing or implementing programming languages, including golfing languages? Or have strong opinions about either? Consider supporting &lt;strong&gt;&lt;a href=&quot;https://area51.stackexchange.com/proposals/127456/programming-language-design-and-implementation&quot;&gt;Programming Language Design and Implementation&lt;/a&gt;&lt;/strong&gt;, a proposed Stack Exchange site, over on Area 51 (Stack Exchange's proposal system for new sites)!&lt;/p&gt;&#xA;&lt;p&gt;Follow &lt;a href=&quot;https://area51.meta.stackexchange.com/questions/32774/if-you-are-showing-a-rep-of-51-or-151-you-may-have-committed-incorrectly-make-s/32776#32776&quot;&gt;these&lt;/a&gt; instructions to properly link your account, Area 51 can be really weird sometimes. (Just ignore the step telling you to follow Solana, and follow PLDI instead :p)&lt;/p&gt;&#xA;&lt;p&gt;Once you commit, when we hit private beta in a month or two, you'll be able to participate (you don't have to though, despite the name).&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="108218" LastEditDate="2023-03-09T15:59:33.660" LastActivityDate="2023-03-09T15:59:33.660" Title="Consider supporting Programming Language Design and Implementation on Area 51!" Tags="|discussion|" AnswerCount="0" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25643" PostTypeId="2" ParentId="2140" CreationDate="2023-03-09T17:20:38.233" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/259074/mapping-passing-through-point&quot;&gt;Mapping Passing Through Point&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2023-03-12T16:50:56.110" LastActivityDate="2023-03-12T16:50:56.110" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="25644" PostTypeId="2" ParentId="2140" CreationDate="2023-03-10T16:13:04.563" Score="-1" Body="&lt;h1&gt;Paint you a Picture for Piet Perfection&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-popularity-contest-tooltip-container&quot;&gt;popularity-contest&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Make a Piet program that does whatever you want—but make it pretty.&lt;/p&gt;&#xA;&lt;p&gt;Your goal is to paint a beautiful picture with an interesting function.&lt;/p&gt;&#xA;&lt;p&gt;Your program may do anything, but your submission is much more likely to gain upvotes if it is interesting or related to the content of the picture. Likewise, your program could be incredibly interesting but look very ugly and thus receive few upvotes.&lt;/p&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-popularity-contest-tooltip-container&quot;&gt;popularity-contest&lt;/a&gt;, so the submission with the highest score wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Meta sandboxing: This might be too vague, should the program guidelines be more specific?&lt;/p&gt;&#xA;" OwnerUserId="108687" LastActivityDate="2023-03-10T16:13:04.563" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25645" PostTypeId="2" ParentId="25613" CreationDate="2023-03-10T17:38:30.843" Score="6" Body="&lt;h1&gt;The question asker gets to decide; doesn't mean it's a good idea&lt;/h1&gt;&#xA;&lt;p&gt;Pretty much all of the site &amp;quot;rules&amp;quot; are just defaults that the challenge author can override. If you want to use github.dev as the scoring method, that's allowed.&lt;/p&gt;&#xA;&lt;p&gt;However, it probably isn't a good idea to use cloud services like this for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-fastest-code-tooltip-container&quot;&gt;fastest-code&lt;/a&gt;, for a few reasons.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;These services almost certainly use shared vCPUs, which means there's some overhead and stuff that won't be perfectly consistent&lt;/li&gt;&#xA;&lt;li&gt;Inevitably, these services will either stop working, or upgrade their servers. Twenty years from now github.dev will not be using twenty year old hardware, for one reason or another, and that breaks scoring for future answers. (You could retime all the old ones, but you'd first have to notice an upgrade occurred. Plus, this would likely give an advantage to newer answers, which could optimize for the correct hardware)&lt;/li&gt;&#xA;&lt;li&gt;There's no guarantee github.dev or repl.it is fungible; different datacenters might have slightly different servers, and things like that, since most of the time the exact hardware doesn't really matter that much when you're running things like VS Code or Python&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2023-03-10T17:38:30.843" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25646" PostTypeId="2" ParentId="2140" CreationDate="2023-03-10T23:29:58.323" Score="2" Body="&lt;h1&gt;Generate a Random Integer&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-integer-tooltip-container&quot;&gt;integer&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-number-tooltip-container&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-random-tooltip-container&quot;&gt;random&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to create a program or function that outputs an integer from &lt;span class=&quot;math-container&quot;&gt;\$-\infty\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$+\infty\$&lt;/span&gt; non-deterministically (the output will not always be the same result). Each integer should have a nonzero chance of being outputted.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Please explain what your code does to confirm that it can produce any integer.&lt;/li&gt;&#xA;&lt;li&gt;For the purpose of this challenge, you may ignore your language's number limits for storing an arbitrarily large/small number.&lt;/li&gt;&#xA;&lt;li&gt;Output should be in decimal form.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="91262" LastEditorUserId="91262" LastEditDate="2023-03-10T23:58:51.093" LastActivityDate="2023-03-10T23:58:51.093" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25648" PostTypeId="2" ParentId="25541" CreationDate="2023-03-11T10:30:01.997" Score="6" Body="&lt;h1&gt;Best mathematical insight&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost of &lt;a href=&quot;/a/25430&quot;&gt;2022&lt;/a&gt;, &lt;a href=&quot;/a/24226&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;/a/20597&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;/a/18442&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;/a/17317&quot;&gt;2018&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;On this site we often see answers in languages specifically designed for short code, or designed to be fast. Sometimes, a nice golfing trick or speed-up technique surprises us with its ingenuity, beyond the standard use of that language.&lt;/p&gt;&#xA;&lt;p&gt;And occasionally an answer shows up that uses an unexpected approach to greatly simplify the problem, and makes us wonder how the author could ever think of that. This usually involves some far-from-obvious mathematical equivalence, or a particularly simple approach to the problem that was not evident at all (once revealed, other answers often follow the same approach).&lt;/p&gt;&#xA;&lt;p&gt;This category is for the answer with the best &lt;strong&gt;mathematical&lt;/strong&gt; insight or unexpected approach that led to greatly simplifying the problem, in &lt;strong&gt;any challenge type&lt;/strong&gt; (code golf, fastest code, or others). The insight should have led to a significant improvement according to the challenge's metric (code length, run time, or whatever applicable).&lt;/p&gt;&#xA;" OwnerUserId="9288" LastActivityDate="2023-03-11T10:30:01.997" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25649" PostTypeId="2" ParentId="2140" CreationDate="2023-03-11T23:52:23.110" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/259083/is-it-traversable&quot;&gt;Is it traversable?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="97916" LastEditorUserId="97916" LastEditDate="2023-03-12T23:21:47.007" LastActivityDate="2023-03-12T23:21:47.007" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25650" PostTypeId="2" ParentId="2140" CreationDate="2023-03-12T20:25:40.783" Score="1" Body="&lt;h1&gt;Arbitrary numeric base as string&lt;/h1&gt;&#xA;&lt;p&gt;Given a positive integer &lt;code&gt;n&lt;/code&gt; and an integer base &lt;code&gt;b&lt;/code&gt; where &lt;code&gt;1&amp;lt;b&amp;lt;96&lt;/code&gt;, please convert &lt;code&gt;n&lt;/code&gt; into a string that represents its value in base &lt;code&gt;b&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For a given base &lt;code&gt;b&lt;/code&gt;, the following should hold:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Digits should only have place value between &lt;code&gt;0&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Digits should be output in order from most significant to least significant.&lt;/li&gt;&#xA;&lt;li&gt;Digits with place value &lt;code&gt;0&lt;/code&gt; to &lt;code&gt;9&lt;/code&gt; should be represented with the ASCII characters &lt;code&gt;&amp;quot;0&amp;quot;&lt;/code&gt; to &lt;code&gt;&amp;quot;9&amp;quot;&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Digits with place value &lt;code&gt;10&lt;/code&gt; to &lt;code&gt;15&lt;/code&gt; can be represented with your choice of ASCII characters &lt;code&gt;&amp;quot;a&amp;quot;&lt;/code&gt; to &lt;code&gt;&amp;quot;f&amp;quot;&lt;/code&gt; or &lt;code&gt;&amp;quot;A&amp;quot;&lt;/code&gt; to &lt;code&gt;&amp;quot;F&amp;quot;&lt;/code&gt; (but not a mix).&lt;/li&gt;&#xA;&lt;li&gt;Digits with place value 16 to 94 can be represented with your choice of the remaining ASCII characters, but they must be deterministic for a given base &lt;code&gt;b&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;250, 5 -&amp;gt; &amp;quot;2000&amp;quot;&#xA;250, 16 -&amp;gt; &amp;quot;fa&amp;quot; or &amp;quot;FA&amp;quot;&#xA;250, 80 -&amp;gt; &amp;quot;3a&amp;quot; or &amp;quot;3A&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2023-03-12T20:25:40.783" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25651" PostTypeId="2" ParentId="2140" CreationDate="2023-03-13T15:58:14.040" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/259143/91213&quot;&gt;Is it a valid chemical?&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-decision-problem-tooltip-container&quot;&gt;decision-problem&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-03-15T12:17:49.780" LastActivityDate="2023-03-15T12:17:49.780" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25653" PostTypeId="2" ParentId="2140" CreationDate="2023-03-14T05:57:57.907" Score="-1" Body="&lt;h1&gt;My prefix is food, my suffix is rude&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;My prefix is food.&lt;br /&gt;&#xA;My suffix is rude.&lt;br /&gt;&#xA;My infix comes in rounds.&lt;br /&gt;&#xA;I keep you off the ground.&lt;/p&gt;&#xA;&lt;p&gt;What am I?&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://puzzling.stackexchange.com/q/62349/62436&quot;&gt;the first &amp;quot;Riley riddle&amp;quot;&lt;/a&gt;, created by Riley. Riddles of this sort has become a trend in the Puzzling SE. Let us do a code-golf challenge equivalent of it.&lt;/p&gt;&#xA;&lt;p&gt;The challenge is to write a program/function that expects the input to be one of three distinct values of your choice, and output what the code's prefix/suffix/infix of your choice would output, respectively.&lt;/p&gt;&#xA;&lt;p&gt;To be more specific, the affixes shall have no input or have the input ignored, and have a constant output. For sake of preventing trivial solutions, their outputs shall be all different.&lt;/p&gt;&#xA;&lt;p&gt;As for the full code, any input that matches none of the three values falls into &lt;em&gt;don't care&lt;/em&gt; situation. Standard loopholes apply.&lt;/p&gt;&#xA;&lt;p&gt;This is a code-golf, so the submission whose full code is the shortest in length wins. The lengths of the affixes won't compromise the score.&lt;/p&gt;&#xA;&lt;p&gt;If possible, please include a poem describing what your code does, just like the original riddle! ;-)&lt;/p&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2023-03-15T11:25:04.620" LastActivityDate="2023-03-15T11:25:04.620" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25656" PostTypeId="2" ParentId="2140" CreationDate="2023-03-17T15:06:33.877" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/259255/implement-the-three-way-comparison-operator-on-numbers&quot;&gt;Implement the &lt;code&gt;&amp;lt;=&amp;gt;&lt;/code&gt; three-way comparison operator on numbers&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-number-tooltip-container&quot;&gt;number&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/comparison&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;comparison&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;comparison&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-comparison-tooltip-container&quot;&gt;comparison&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2023-03-19T23:57:20.983" LastActivityDate="2023-03-19T23:57:20.983" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25657" PostTypeId="2" ParentId="2140" CreationDate="2023-03-17T17:37:46.627" Score="2" Body="&lt;p&gt;Idea:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Given a polyomino shape figure out the minimum number of cuts required to fill it with a herring-bone pattern of 2×1 tiles.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Gylda is a contractor who installs decks. She receives the deck plan from an architect who always chooses it to be shaped as a polyomino, that is a single connected piece cut from a square grid. The deck surface is manufactured in 2×1 rectangular tiles. Gylda installs the tiles in a &lt;a href=&quot;https://en.wikipedia.org/wiki/Herringbone_pattern&quot; rel=&quot;nofollow noreferrer&quot;&gt;herringbone pattern&lt;/a&gt; because it looks nice, and is stable.  However not all shapes can be made perfectly with a herringbone pattern, sometimes Gylda is forced to cut a tile in half. Sometimes Gylda is forced to cut a lot of tiles in half.  However how many cuts are needed, depends on exactly where the pattern is placed relative to the boundaries of the deck.&lt;/p&gt;&#xA;&lt;p&gt;Now Gylda wants to minimize the number of cuts she has to make so she wants a computer program which will take a deck shape and will tell her the minimum number of cuts required.  This is the number of cuts, &lt;em&gt;not&lt;/em&gt; the number of half pieces used in the final construction.  Each cut produces two 1×1 pieces which can both be used.&lt;/p&gt;&#xA;&lt;p&gt;There is one catch.  If a herringbone pattern would produce a layout where two half pieces are adjacent by an edge, Gylda will instead place a single 2×1 tile, even though it breaks the herringbone pattern.  For&#xA;example in the following layout:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; ====||&#xA; ||====&#xA; ||||==&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;There are two half pieces in the bottom right so instead we would lay out a single whole piece:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;====||&#xA;||====&#xA;||====&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This means the 3×3 square polyomino only requires 1 cut, not 2.&lt;/p&gt;&#xA;&lt;p&gt;Gylda wants the program to take this special rule into account.&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Take a polyomino as input in any reasonable format.  Output the minimum number of cuts Gylda needs to install that deck.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; so the goal is to minimize the size of your source code as measured in bytes.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2023-03-17T17:37:46.627" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25658" PostTypeId="2" ParentId="2140" CreationDate="2023-03-17T18:36:47.443" Score="2" Body="&lt;h2&gt;Enumeration of free polyominoes&lt;/h2&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/259751/enumeration-of-free-polyominoes&quot;&gt;Posted here&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96037" LastEditorUserId="96037" LastEditDate="2023-04-05T10:16:18.337" LastActivityDate="2023-04-05T10:16:18.337" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25659" PostTypeId="2" ParentId="2140" CreationDate="2023-03-18T05:34:11.500" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/259357/find-the-linear-transformation&quot;&gt;Find the linear transformation&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2023-03-22T06:40:43.657" LastActivityDate="2023-03-22T06:40:43.657" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25662" PostTypeId="1" AcceptedAnswerId="25664" CreationDate="2023-03-21T05:43:04.027" Score="8" ViewCount="200" Body="&lt;p&gt;&lt;em&gt;This isn't to call anyone out or criticise the actions of anyone. This is to get a clear understanding of general guidelines of mass edits.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Every now and again, links to online interpreters will change, answer headers will become outdated, tags will need removal from questions, and other circumstances will occur that impact the contents of a non-trivial amount of posts. There's nothing wrong with this - things change and are modified over time.&lt;/p&gt;&#xA;&lt;p&gt;Given that a whole bunch of edits at once floods the home page, how should events that require mass edits be handled?&lt;/p&gt;&#xA;&lt;p&gt;More specifically:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;When should it be appropriate to have a mass edit event? (Assuming it doesn't result in edits that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/18751/78850&quot;&gt;go against what has been decided isn't allowed as edits&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Should mass edit events be allowed without prior notice?&lt;/li&gt;&#xA;&lt;li&gt;If no to the above, how should notice be given?&lt;/li&gt;&#xA;&lt;li&gt;Should mass edit events be split into batches?&lt;/li&gt;&#xA;&lt;li&gt;If yes to the above, how long between batches?&lt;/li&gt;&#xA;&lt;li&gt;Should mass edit events be coordinated or should they happen whenever appropriate?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Answer as many or as few of those questions as you like, or even bring up something else related to how mass edits should be handled.&lt;/p&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="66833" LastEditDate="2023-05-05T00:27:30.123" LastActivityDate="2023-05-05T00:27:30.123" Title="How to Handle Mass Edit Events" Tags="|discussion|editing|etiquette|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25663" PostTypeId="2" ParentId="2140" CreationDate="2023-03-21T11:59:19.723" Score="2" Body="&lt;h1&gt;Isolate the binary signals&lt;/h1&gt;&#xA;&lt;p&gt;There are &lt;code&gt;n&lt;/code&gt; binary signals, with intervals of &lt;code&gt;1&lt;/code&gt; through &lt;code&gt;n&lt;/code&gt;. For example, for &lt;code&gt;n=3&lt;/code&gt; the lists could be &lt;code&gt;[1], [0, 1], [1, 0, 1]&lt;/code&gt;. Each list represents a repeating pattern. So &lt;code&gt;[0,1]&lt;/code&gt; is really &lt;code&gt;[0, 1, 0, 1, 0, 1, ...]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;The signals all start at the same time, but they are sent over the same channel. So you only know the sum of all the signals at a given time.&lt;/p&gt;&#xA;&lt;p&gt;Given a list of length at least &lt;code&gt;LCM(1..n)&lt;/code&gt; representing the sum of the values at each item of each signal.&lt;/p&gt;&#xA;&lt;p&gt;If there are multiple possible options, you may output any of them.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;List&lt;/th&gt;&#xA;&lt;th&gt;n&lt;/th&gt;&#xA;&lt;th&gt;Expected Result&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;[1, 3, 1, 2, 2, 2]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;[1], [0,1], [1,0,1]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;[2, 3, 3, 3, 1, 4, 3, 2, 2, 4, 2, 3]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;[[1], [0, 1], [1, 0, 1], [0, 1, 1, 0]]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-03-23T08:44:10.967" LastActivityDate="2023-03-23T08:44:10.967" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25664" PostTypeId="2" ParentId="25662" CreationDate="2023-03-21T15:41:13.080" Score="10" Body="&lt;h2&gt;Mass Edits should &lt;em&gt;almost always&lt;/em&gt; be spread out over time&lt;/h2&gt;&#xA;&lt;p&gt;First of all, I'll cover solo mass edits - i.e., those done by a single user. Community organised mass edits fall under different guidelines.&lt;/p&gt;&#xA;&lt;h3&gt;When are they appropriate?&lt;/h3&gt;&#xA;&lt;p&gt;Mass edits, generally speaking, are not any different from normal edits when it comes to appropriateness. So long as the edits improve the posts in a substantial and necessary way, they're appropriate. The most common example of mass edits are fixing broken links, typically to interpreters, which is perfectly fine.&lt;/p&gt;&#xA;&lt;h3&gt;Notice&lt;/h3&gt;&#xA;&lt;p&gt;Yes, mass edits are allowable without prior notice. That said, posting a note in chat with a rough number of edits you're expecting to do, and how long you expect it to take, is highly recommended and appreciated, so that people know that main is going to be cluttered for a short time&lt;/p&gt;&#xA;&lt;h3&gt;Batches&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Yes&lt;/strong&gt;. Mass edits should absolutely be split up into batches if you are expecting to do more than 10 edits. Roughly speaking, 10 edits should be the most you do at a time.&lt;/p&gt;&#xA;&lt;p&gt;As for the amount of time to wait, this depends on how busy the site is at the time. Generally speaking, how long to wait isn't a question of time, it's a question of main settling down. A good rule of thumb is for 10 unrelated challenges be moved above your edit batch before beginning the next batch. That way, the front page can settle a bit before new and active posts get drowned out by mass edits.&lt;/p&gt;&#xA;&lt;h2&gt;Community mass edits&lt;/h2&gt;&#xA;&lt;p&gt;For larger scale community edits, such as the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/23456&quot;&gt;status tag edits&lt;/a&gt;, these events should always be organised through meta, to provide notice and coordination to the entire community. Such large scale mass edits should only be reserved for edits that apply to a massive number of posts, not stuff such as broken links or a few mistags.&lt;/p&gt;&#xA;&lt;p&gt;In this case, and &lt;em&gt;only&lt;/em&gt; this case, with plenty of notice, edits can be done all at once, and not in batches, as the main site can be &amp;quot;frozen&amp;quot; for the time necessary, and posts active before the edits can be re-bumped after the edits have been completed.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2023-03-21T15:41:13.080" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25665" PostTypeId="2" ParentId="2140" CreationDate="2023-03-21T17:58:52.560" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/259453/qat-equation-solver&quot;&gt;Qat Equation Solver&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2023-03-25T16:38:41.387" LastActivityDate="2023-03-25T16:38:41.387" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25666" PostTypeId="2" ParentId="2140" CreationDate="2023-03-22T08:24:48.483" Score="-4" Body="&lt;p&gt;This is a problem I solved, but now I am curious whit what techniques it can be improved. The original language is Java but here it doesn't matter.&lt;/p&gt;&#xA;&lt;p&gt;You start with a list of n strings with a length of 7 characters.&#xA;What is the most efficient algorithm (fastest) to determene the longest substring all the elements have in common, excluding the first character.&lt;/p&gt;&#xA;&lt;p&gt;example 1:&#xA;&lt;br&gt;&#xA;input: &amp;quot;S000001&amp;quot;, &amp;quot;S000002&amp;quot;, &amp;quot;S000003&amp;quot;, &amp;quot;S000004&amp;quot;&#xA;&lt;br&gt;&#xA;expected output: &amp;quot;00000&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;example 2:&#xA;&lt;br&gt;&#xA;input: &amp;quot;S020011&amp;quot;, &amp;quot;S020012&amp;quot;, &amp;quot;S020013&amp;quot;, &amp;quot;S020014&amp;quot;&#xA;&lt;br&gt;&#xA;expected output: &amp;quot;02001&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;example 3:&#xA;&lt;br&gt;&#xA;input: &amp;quot;S010001&amp;quot;, &amp;quot;S000002&amp;quot;, &amp;quot;S000003&amp;quot;, &amp;quot;S000004&amp;quot;&#xA;&lt;br&gt;&#xA;expected output: &amp;quot;000&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;example 3:&#xA;&lt;br&gt;&#xA;input: &amp;quot;S109001&amp;quot;, &amp;quot;S22090&amp;quot;, &amp;quot;S090003&amp;quot;, &amp;quot;S090004&amp;quot;&#xA;&lt;br&gt;&#xA;expected output: &amp;quot;090&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;When there are no common substrings the output is null, an empty string etc. but not a caracter [a-zA-Z]|[0-9]&lt;/p&gt;&#xA;&lt;p&gt;The input is an array of strings, texts or equivalent in your preferred language (not a char[] or binary, etc).&lt;/p&gt;&#xA;" OwnerUserId="113952" LastEditorUserId="91213" LastEditDate="2023-03-22T09:13:01.657" LastActivityDate="2023-03-22T09:13:01.657" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="25667" PostTypeId="2" ParentId="2140" CreationDate="2023-03-23T05:11:48.650" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/259390/110698&quot;&gt;Draw the GKMS aperiodic tile&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110698" LastEditorUserId="110698" LastEditDate="2023-03-23T13:53:23.287" LastActivityDate="2023-03-23T13:53:23.287" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25668" PostTypeId="2" ParentId="2140" CreationDate="2023-03-23T13:26:08.053" Score="3" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/259488/116013&quot;&gt;Record Least Uncommon Multiple Counts&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="116013" LastEditorUserId="116013" LastEditDate="2023-03-26T23:42:10.733" LastActivityDate="2023-03-26T23:42:10.733" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25669" PostTypeId="1" CreationDate="2023-03-23T20:30:23.750" Score="6" ViewCount="146" Body="&lt;p&gt;So far, I have only used comma-delimited unary for my answers taking a list / array as input, since it's the &amp;quot;obvious&amp;quot; choice. That looks like &lt;code&gt;xx,xxxxxx,x,xx,x,xxx&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;However, this can't differentiate between &lt;span class=&quot;math-container&quot;&gt;\$[]\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$[0]\$&lt;/span&gt;, as both would be an empty string. In most challenges, this isn't a direct problem since an empty list is allowed to be undefined behavior.&lt;/p&gt;&#xA;&lt;p&gt;But more to the point, in many answers, it requires using &lt;code&gt;\b&lt;/code&gt; where a single byte could have been used instead. I have considered using an input specification where a single character is used not just as a delimiter, but also as a sandwich character for the entire list. So for example using &lt;code&gt;!&lt;/code&gt; would result in input looking like &lt;code&gt;!xx!xxxxxx!x!xx!x!xxx!&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;What would be the best name for this type of character (as opposed to &amp;quot;delimiter&amp;quot;)?&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;framing character&lt;/li&gt;&#xA;&lt;li&gt;boundary character&lt;/li&gt;&#xA;&lt;li&gt;container character&lt;/li&gt;&#xA;&lt;li&gt;something else?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;As an example, my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/149890/visible-dice-faces/259172#259172&quot;&gt;recent answer to Visible Dice Faces&lt;/a&gt; currently uses &lt;code&gt;,&lt;/code&gt; as a delimiter and has a &lt;strong&gt;29 byte&lt;/strong&gt; shortest solution:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;^(?!.*\b(x(\2?+,.*\b)?){7}\b)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##RU1LT4NAEL7vrxg3e2B1lPI0YUtpk9qjpx6JG2pogtkCAk0wBP86TsHoZed7b503JpguXyAaBYOp3jMDwlZE4/V@d9xtRnauGku08UqtN0oOUJyJyaFuirIDnpZcjeQ6VDFxez21HaU1PjroyPzz5if/6op0GQmtaAUsYWhuS63aFJ3FkSMpigGIAmL4qIpyFuGS1QPveS/0uF0Cy@eiiL9t0diQAD821zwC4BABP2SmJcLVb@5vaW6Po9Yvr3utpzcruXu6T09Wb6Vu8oA3LBM5PI90pylkIbrMQY@5eHs9dDEk7qLP6IQsQJ8CHpn@jJe4ix7hAMMf&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Perl 5 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;But using a boundary character, this could be &lt;strong&gt;27 bytes&lt;/strong&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;^(?!.*:(x(\2?+:.*\b)?){7}:)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##RY5Pb8IwDMXv@RReFImEeZT@nZRQWiTYcSeOaBFMReoUoGtB6lR1X71zx6RdEj@/n59dFbWLh9MXiNpA5y7vewfCMyTTxXq1XS17drzUUjTp3CyWRnVQHkmprqrL8xX47sxNT65PIy5tbofmSrTFJx99VXyOfvbfnVNfaWENpYAUjuJymqpceZUcOVLHMABRQgoTPYEZfFzKs@SaI5z2Vcdb3grb506RRcAI3w8RZfrtidqDDPi2vhUagIMG/rJ3DQlu/rh7Hq3Kx1V9b@3mdW3t8Cazh9lUy1buguxRz6a7g8pU99xrNQwJSzBgPoYswPENMcCEdIARoy9hMUYEhGRGv/UdDzCkOsbkBw&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Perl 5 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In some other answers, this could save well over 2 bytes. (Edit: Indeed, in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/230402/is-this-a-permutation-of-1-n/259436#259436&quot;&gt;Is this a Permutation of 1..n&lt;/a&gt; it has saved 5 bytes, bringing it down from e.g. &lt;strong&gt;34 bytes&lt;/strong&gt; to &lt;strong&gt;29 bytes&lt;/strong&gt;.)&lt;/p&gt;&#xA;&lt;p&gt;So should I go ahead and do this? What about answers where switching from a delimiter to a boundary-character wouldn't result in better golf – should I do it anyway for consistency? (That'd mean lots of old answers to edit, so it might be a bad idea.) What if there's a challenge where it'd actually result in worse golf (seems unlikely, but for sake of argument)?&lt;/p&gt;&#xA;&lt;p&gt;Would it negatively affect the perceived legitimacy of my answer if I use a boundary-character to improve the golf? As a really extreme example of manipulating the input specification for golf, see my &lt;strong&gt;163 byte&lt;/strong&gt; answer in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/148587/is-it-a-valid-chess-move/249561#249561&quot;&gt;Is it a valid chess move? (Python, with python-chess)&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;And what would be the best choice of ASCII character for this? It has to be a non-word character, because even with a sandwich character, &lt;code&gt;\b&lt;/code&gt; still has to be used in some places. What I'm mainly concerned about how readable it is in a regex pattern, and the aesthetics of the choice.&lt;/p&gt;&#xA;&lt;p&gt;In rough order of my preference:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;:&lt;/code&gt; - &lt;code&gt;^(?!.*:(x(\2?+:.*\b)?){7}:)&lt;/code&gt; - symmetric on two axes; stands out fairly well; is thin horizontally, making it look good as a separator&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;!&lt;/code&gt; - &lt;code&gt;^(?!.*!(x(\2?+!.*\b)?){7}!)&lt;/code&gt; - symmetric on one axes, but doesn't have much of a connotation of use as a separator; also used in &lt;code&gt;(?!)&lt;/code&gt;, which might slightly impact readability&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;'&lt;/code&gt; - &lt;code&gt;^(?!.*'(x(\2?+'.*\b)?){7}')&lt;/code&gt; - symmetric on one axis, but has a weak connotation of strings; doesn't stand out too well in a regex&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;quot;&lt;/code&gt; - &lt;code&gt;^(?!.*&amp;quot;(x(\2?+&amp;quot;.*\b)?){7}&amp;quot;)&lt;/code&gt; - symmetric on one axis, but has a heavy connotation of strings&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;-&lt;/code&gt; - &lt;code&gt;^(?!.*-(x(\2?+-.*\b)?){7}-)&lt;/code&gt; - symmetric on two axes; has a meaning inside regex character classes, but that shouldn't be a problem; doesn't look much like a separator though&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;~&lt;/code&gt; - &lt;code&gt;^(?!.*~(x(\2?+~.*\b)?){7}~)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;=&lt;/code&gt; - &lt;code&gt;^(?!.*=(x(\2?+=.*\b)?){7}=)&lt;/code&gt; - its mathematical meaning would probably distract too much from using it for this purpose&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;/&lt;/code&gt; - &lt;code&gt;^(?!.*/(x(\2?+/.*\b)?){7}/)&lt;/code&gt; - commonly used as the delimiter in substitution expressions, so might not be good to apply to this usage as well&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt; &lt;/code&gt; - &lt;code&gt;^(?!.* (x(\2?+ .*\b)?){7} )&lt;/code&gt; - not too readable, since it's just a blank space; would make it harder to pretty-print the regex, as the spaces would have to be &lt;code&gt;\&lt;/code&gt;-escaped in that version&lt;/li&gt;&#xA;&lt;li&gt;newline - would require using the &lt;code&gt;s&lt;/code&gt; (DOTALL) flag, and showing the character as &lt;code&gt;\n&lt;/code&gt; or &lt;code&gt;¶&lt;/code&gt; in pretty-printed listings, and would make the actual regex take up multiple lines. Also already has connotations as a terminator or separator, not a prefix.&lt;/li&gt;&#xA;&lt;li&gt;tab - same drawbacks as space, but additionally would be hard to distinguish from space, and already has connotations as a separator, not a boundary character.&lt;/li&gt;&#xA;&lt;li&gt;NUL - technically difficult to use, but nevertheless usable. However, already has connotations as a terminator, not a prefix.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;#&lt;/code&gt; - &lt;code&gt;^(?!.*#(x(\2?+#.*\b)?){7}#)&lt;/code&gt; - stands out pretty well, but feels too heavy/large to be a separator&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;`&lt;/code&gt; - &lt;code&gt;^(?!.*`(x(\2?+`.*\b)?){7}`)&lt;/code&gt; - stands out as a particularly small character, but for that same reason, might be harder to read&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;;&lt;/code&gt; - &lt;code&gt;^(?!.*;(x(\2?+;.*\b)?){7};)&lt;/code&gt; - asymmetric; often used as a line terminator, but would be weird as prefix&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;,&lt;/code&gt; - &lt;code&gt;^(?!.*,(x(\2?+,.*\b)?){7},)&lt;/code&gt; - asymmetric; already used as a separator, so probably shouldn't be used as a prefix (and would look weird used that way)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;%&lt;/code&gt; - &lt;code&gt;^(?!.*%(x(\2?+%.*\b)?){7}%)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;amp;&lt;/code&gt; - &lt;code&gt;^(?!.*&amp;amp;(x(\2?+&amp;amp;.*\b)?){7}&amp;amp;)&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="17216" LastEditorUserId="17216" LastEditDate="2023-03-25T23:19:28.597" LastActivityDate="2023-04-04T05:13:17.817" Title="What is a good ASCII boundary-character for regex unary, and will using that instead of a delimiter affect the perceived legitimacy of my answers?" Tags="|discussion|code-golf|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25670" PostTypeId="2" ParentId="25669" CreationDate="2023-03-24T16:25:47.880" Score="12" Body="&lt;h1&gt;This is perfectly acceptable in most cases&lt;/h1&gt;&#xA;&lt;p&gt;I think any of the formats you've listed would be just fine for a list of unary numbers. We already allow a great deal of flexibility about list formats:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1,2,3,42&#xA;1 2 3 42&#xA;[1, 2, 3, 42]&#xA;[1;2;3;42]&#xA;(1 2 3 42)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;On the basis of these examples, I would say any delimiter is fine, as long as&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;it's clearly distinguishable from the data&lt;/li&gt;&#xA;&lt;li&gt;it's consistent (the same delimiter is used throughout the list; it's also okay if the leading and the trailing delimiter are different)&lt;/li&gt;&#xA;&lt;li&gt;it doesn't go against any specific I/O formatting rules in the challenge&lt;/li&gt;&#xA;&lt;li&gt;you explain the list format you're using in your answer&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Within those boundaries, pick whichever delimiter is golfiest. No need to be consistent between different challenges, and no need to edit previous answers unless you want to. Golfing previous answers using a better input format is fine too.&lt;/p&gt;&#xA;" OwnerUserId="16766" LastActivityDate="2023-03-24T16:25:47.880" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25672" PostTypeId="2" ParentId="25604" CreationDate="2023-03-25T13:44:03.800" Score="10" Body="&lt;h1&gt;Best mathematical insight&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost of &lt;a href=&quot;/a/25430&quot;&gt;2022&lt;/a&gt;, &lt;a href=&quot;/a/24226&quot;&gt;2021&lt;/a&gt;, &lt;a href=&quot;/a/20597&quot;&gt;2020&lt;/a&gt;, &lt;a href=&quot;/a/18442&quot;&gt;2019&lt;/a&gt;, &lt;a href=&quot;/a/17317&quot;&gt;2018&lt;/a&gt;, &lt;a href=&quot;/a/10950&quot;&gt;2016&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;On this site we often see answers in languages specifically designed for short code, or designed to be fast. Sometimes, a nice golfing trick or speed-up technique surprises us with its ingenuity, beyond the standard use of that language.&lt;/p&gt;&#xA;&lt;p&gt;And occasionally an answer shows up that uses an unexpected approach to greatly simplify the problem, and makes us wonder how the author could ever think of that. This usually involves some far-from-obvious mathematical equivalence, or a particularly simple approach to the problem that was not evident at all (once revealed, other answers often follow the same approach).&lt;/p&gt;&#xA;&lt;p&gt;This category is for the answer with the best &lt;strong&gt;mathematical&lt;/strong&gt; insight or unexpected approach that led to greatly simplifying the problem, in &lt;strong&gt;any challenge type&lt;/strong&gt; (code golf, fastest code, or others). The insight should have led to a significant improvement according to the challenge's metric (code length, run time, or whatever applicable).&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/259687&quot;&gt;Make a custom Bayer matrix&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/9288/alephalpha&quot;&gt;alephalpha&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nomination by Neil&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;At time of writing the two main approaches are to either build up the matrix using Parcly Taxel's recursive formula or perform some bit-twiddling on the row and column indices including reversal of the bits, normally performed by padding and reversing the binary representation. However alephalpha vastly simplified the latter approach by pointing out that one of the acceptable output formats is almost exactly equivalent to converting to base ¼.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/260349/16766&quot;&gt;Is it a plausible chess move?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/107561/loopy-walt&quot;&gt;loopy walt&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nomination by DLosc&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Building on an answer by xnor, loopy walt shaved 18 bytes by taking input as complex numbers. The core insight was that a queen's move (horizontal, vertical, or diagonal) can be defined as a complex number which, when taken to the fourth power, has zero imaginary component.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/259989/103581&quot;&gt;String Comparison&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/107561/loopy-walt&quot;&gt;loopy walt&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;Being an expert in discrete math, loopy walt quickly identified the intended approach for String Comparison and provided a nice, rigorous proof that is easy to formalize in Coq. The approach was then used by all answers in the challenge.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/261684/92727&quot;&gt;How powerful must this e approximation be?&lt;/a&gt; by &lt;a href=&quot;https://codegolf.stackexchange.com/users/87058/roman&quot;&gt;Roman&lt;/a&gt;&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Nomination by Command Master&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this answer Roman found a simple exact formula for the solution, and then proceeded to find a good enough approximation to write an answer shorter by &lt;s&gt;17&lt;/s&gt; 23 bytes than the previous Mathematica answer.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/262139/56656&quot;&gt;Vertices of a regular dodecahedron&lt;/a&gt; by Wheat Wizard&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Self-nomination&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;My research this past year has been about symmetric realizations of polyhedra and graphs, so I was really happy to be able to use my specialty knowledge on a code-golf challenge, and to introduce people to this fascinating subject. In this challenge I used a different much simpler realization of the classical dodecahedron, which bends the rules of what is traditionally considered a polyhedron. I think this is a perfect encapsulation of what makes code-golf so fun: Combining programming, math, and careful reading of rules.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastEditorUserId="56656" LastEditDate="2023-12-24T01:47:48.813" LastActivityDate="2023-12-24T01:47:48.813" CommentCount="5" CommunityOwnedDate="2023-03-25T13:44:03.800" ContentLicense="CC BY-SA 4.0" />
  <row Id="25673" PostTypeId="2" ParentId="2140" CreationDate="2023-03-25T17:04:33.870" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/259618/play-rock-paper-scissors-25&quot;&gt;Play Rock Paper Scissors 25&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2023-03-31T21:00:12.917" LastActivityDate="2023-03-31T21:00:12.917" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25674" PostTypeId="2" ParentId="2140" CreationDate="2023-03-25T17:58:44.073" Score="0" Body="&lt;h1&gt;Optimize Distance Travelled By Thrown Object (With Air Resistance)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Suppose you're on a flat surface, then throw an object with some velocity &lt;span class=&quot;math-container&quot;&gt;\$v_0\$&lt;/span&gt; at an angle &lt;span class=&quot;math-container&quot;&gt;\$\theta\$&lt;/span&gt; above the ground. Assuming the only forces on the object are (constant) gravity and air resistance, we can model the horizontal and vertical components of the acceleration (the instantaneous change in velocity in the x and y direction) as follows:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$a_x = v_x^2 * \delta$$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$a_y = v_y^2 * \delta + g$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Where &lt;span class=&quot;math-container&quot;&gt;\$v_x\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$v_y\$&lt;/span&gt; are the horizontal and vertical components of velocity, &lt;span class=&quot;math-container&quot;&gt;\$g\$&lt;/span&gt; is acceleration due to gravity, and &lt;span class=&quot;math-container&quot;&gt;\$\delta\$&lt;/span&gt; is the coefficient of acceleration due to drag (which is a single number which depends on the drag coefficient, cross-sectional area, and the density of the fluid, and the mass).&lt;/p&gt;&#xA;&lt;p&gt;The initial x and y components of velocity are&#xA;&lt;span class=&quot;math-container&quot;&gt;$$v_x = v_0 \cos \theta, v_y = v_0 \sin \theta$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;The object stops moving when it hits the ground again (when its &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt; position becomes 0 again). We want to &lt;strong&gt;find the angle &lt;span class=&quot;math-container&quot;&gt;\$\theta\$&lt;/span&gt; which maximizes the horizontal distance &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; that the object travels.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is, given the initial velocity &lt;span class=&quot;math-container&quot;&gt;\$v_0\$&lt;/span&gt;, acceleration due to gravity &lt;span class=&quot;math-container&quot;&gt;\$g\$&lt;/span&gt;, and coefficient of acceleration due to drag &lt;span class=&quot;math-container&quot;&gt;\$\delta\$&lt;/span&gt;, output the angle &lt;span class=&quot;math-container&quot;&gt;\$\theta\$&lt;/span&gt; (in either degrees or radians) which maximizes the horizontal distance travelled, within one percent of the true maximum.&lt;/p&gt;&#xA;&lt;p&gt;Standard loopholes are forbidden. Since this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, the shortest program wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;TODO: Test cases&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="113573" LastActivityDate="2023-03-25T17:58:44.073" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25676" PostTypeId="2" ParentId="25541" CreationDate="2023-03-26T14:47:33.533" Score="2" Body="&lt;h1&gt;Most improved answer&lt;/h1&gt;&#xA;&lt;p&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25444/114446&quot;&gt;2022&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24287/56656&quot;&gt;2021&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This category is to reward the continued work users put into answers long after they have been posted.  After the FGITW effect has dissipated there stops being so much incentive to work on an old answer, but some users put in the effort and really make it shine.  The ideal answer here would be one that demonstrates a significant commitment to improvement regardless of the quality of the initial answer.  This could be improving the score, or the explanation or both.&lt;/p&gt;&#xA;&lt;p&gt;Answers in this category don't have to have been initially posted in 2023 but the improvements have to have been made over the course of the year.&lt;/p&gt;&#xA;" OwnerUserId="114446" LastActivityDate="2023-03-26T14:47:33.533" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25677" PostTypeId="2" ParentId="2140" CreationDate="2023-03-27T14:43:31.847" Score="-1" Body="&lt;h1&gt;Play turn-less chess&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-king-of-the-hill-tooltip-container&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-chess-tooltip-container&quot;&gt;chess&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr/&gt;&#xA;&lt;p&gt;In this challenge, you'll write a chess bot...but with a twist. Your bot can move at any time, so the faster you can think, the faster you can move. You'll write code for a custom CPU (so that precise timing is possible), and try to checkmate your opponent's king.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Rules:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;White doesn't necessarily move first; both bots get the opportunity to start moving immediately. If both bots move in the same CPU cycle, white moves first&lt;/li&gt;&#xA;&lt;li&gt;If a bot tries to make an impossible move (pushing a pawn into an occupied square, castling with a moved rook, etc.), the move fails, and the bot is penalized by losing a certain amount of time (or possibly the number of cycles the opponent spent on their last move)&lt;/li&gt;&#xA;&lt;li&gt;Instructions will cost 1 CPU cycle, with the exception of moving, which will cost a fairly large number of cycles to make rapidly moving pieces to overwhelm smart bots less overpowered&lt;/li&gt;&#xA;&lt;li&gt;Bots will play each other round-robin style, both as white and black. Bots will be scored using a modified Elo system (designed such that the order in which the games are played doesn't matter)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2023-03-27T15:12:29.620" LastActivityDate="2023-03-27T15:12:29.620" CommentCount="13" ContentLicense="CC BY-SA 4.0" />
  <row Id="25679" PostTypeId="2" ParentId="2140" CreationDate="2023-03-28T19:58:51.583" Score="1" Body="&lt;h1&gt;Vertically Aligned JSON formatting&lt;/h1&gt;&#xA;&lt;p&gt;We have a question on JSON formatting on this site before, however, this one requires a different formatting convention.&lt;/p&gt;&#xA;&lt;p&gt;Arrays should be formatted with the first element on the same line as the opening &lt;code&gt;[&lt;/code&gt;, and the final &lt;code&gt;]&lt;/code&gt; should be on the same line as the &lt;code&gt;]&lt;/code&gt;. All other elements should be on separate lines, aligned with the first. Commas go on the end of each line except the last. like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&amp;quot;alpha&amp;quot;,&#xA; &amp;quot;beta&amp;quot;,&#xA; &amp;quot;gamma&amp;quot;,&#xA; &amp;quot;delta&amp;quot;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Objects are mapped the same, but the values must also be aligned. There must always be at least one space between the &lt;code&gt;:&lt;/code&gt; and the value, like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;{&amp;quot;alpha&amp;quot;:   &amp;quot;beta&amp;quot;,&#xA; &amp;quot;gamma&amp;quot;:   &amp;quot;delta&amp;quot;,&#xA; &amp;quot;upsalon&amp;quot;: &amp;quot;sigma&amp;quot;,&#xA; &amp;quot;iota&amp;quot;:    &amp;quot;zeta&amp;quot;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;When structures are nested, they are aligned with their first element, like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[{&amp;quot;iota&amp;quot;:  &amp;quot;beta&amp;quot;,&#xA;  &amp;quot;gamma&amp;quot;: &amp;quot;sigma&amp;quot;},&#xA; {&amp;quot;zeta&amp;quot;: {&amp;quot;meena&amp;quot;: &amp;quot;kim&amp;quot;,&#xA;           &amp;quot;vot&amp;quot;:   &amp;quot;dilinia&amp;quot;}}]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note  how separate objects do not need to align with each other, only keys in the same object align.&lt;/p&gt;&#xA;&lt;p&gt;We will consider only 3 types: arrays, objects, and strings. Handing of numbers and null is optional.&lt;/p&gt;&#xA;&lt;p&gt;Input is a mimified JSON string, you should output a vertically aligned JSON string with the same data. You do not need to preserve key order. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;. Shortest answer in each language wins.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2023-03-28T19:58:51.583" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25680" PostTypeId="2" ParentId="2140" CreationDate="2023-03-29T20:37:14.167" Score="3" Body="&lt;h1&gt;Rendevous!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-king-of-the-hill-tooltip-container&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your bots went to the mall together, but they got lost!  Worse, they didn't agree on any strategy to find one another again.&lt;/p&gt;&#xA;&lt;p&gt;Here's what they do know:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;There are &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; stores, and bots can only meet each other in the stores.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Each time step, each bot must choose one store to be in.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Two bots go to the mall simultaneously.  Their score for the outing is the number of time steps it took for them to find one another.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The mall closes after &lt;span class=&quot;math-container&quot;&gt;\$n^2\$&lt;/span&gt; time steps.  If some bots are still at the mall, they will receive a score of &lt;span class=&quot;math-container&quot;&gt;\$n^2+1\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Bots must be written in Javascript.  Your bot must be a generator function, receiving a single input &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; (the number of stores) and output at least &lt;span class=&quot;math-container&quot;&gt;\$n^2\$&lt;/span&gt; integers in the range &lt;span class=&quot;math-container&quot;&gt;\$[0..n-1]\$&lt;/span&gt;.  Your bot's score will be the average of its scores when played with all of the other bots.&lt;/p&gt;&#xA;&lt;p&gt;The stores will be scrambled - what is room 1 for one bot may be room 5 for another.  There will be many rounds of the game (1000 right now, but if there are lots of entries and it takes longer than an hour, I may lower that number), and each round will be a round-robin with a set number of stores.  &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; will be in the range &lt;span class=&quot;math-container&quot;&gt;\$[4..25]\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;There &lt;em&gt;are&lt;/em&gt; better and worse strategies, but optimal strategies (when symmetric) are only known for &lt;span class=&quot;math-container&quot;&gt;\$n=2\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$n=3\$&lt;/span&gt;.  An example bot (which will be playing):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;function* randomSearchBot(n){&#xA;  while (true){&#xA;    yield Math.floor(Math.random() * n);&#xA;  }&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here is the controller:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;function shuffle(array) {&#xA;    for (let i = array.length - 1; i &amp;gt; 0; i--) {&#xA;        let j = Math.floor(Math.random() * (i + 1));&#xA;        [array[i], array[j]] = [array[j], array[i]];&#xA;    }&#xA;}&#xA;function runRound(bot1, bot2, n){&#xA;    let b1 = bot1(n), b2 = bot2(n);&#xA;    let stores = Array(n).fill(0).map((_, i) =&amp;gt; i);&#xA;    shuffle(stores);&#xA;    let turn = 0;&#xA;    while (turn++ &amp;lt; n ** 2){&#xA;        if (b1.next().value == stores[b2.next().value]) break;&#xA;    }&#xA;    return turn;&#xA;}&#xA;function runAllRounds(...bots){&#xA;    const nameLength = Math.max(bots.map(b =&amp;gt; b.name));&#xA;    bots = bots.map(b =&amp;gt; {&#xA;        return {&#xA;            bot: b,&#xA;            totalScore: 0&#xA;        };&#xA;    });&#xA;    const rounds = 1000;&#xA;    let round = rounds;&#xA;    const pairs = bots.map((b, i) =&amp;gt; bots.slice(i + 1).map(w =&amp;gt; [b, w])).flat();&#xA;    while (round--){&#xA;        const n = Math.floor(Math.random() * 22) + 4; // [4..25]&#xA;        for (let [a, b] of pairs) {&#xA;            const score = runRound(a.bot, b.bot, n);&#xA;            a.totalScore += score;&#xA;            b.totalScore += score;&#xA;        }&#xA;    }&#xA;    bots.forEach(b =&amp;gt; {&#xA;        b.totalScore /= rounds * (bots.length - 1);&#xA;        console.log(b.bot.name.padEnd(nameLength) + &amp;quot;: &amp;quot; + b.totalScore.toFixed(5));&#xA;    });&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The main feedback I'm looking for here is whether people think there's a big enough strategy space for it to be worth playing.&lt;/p&gt;&#xA;" OwnerUserId="82199" LastEditorUserId="82199" LastEditDate="2023-03-30T13:45:10.570" LastActivityDate="2023-03-30T13:45:10.570" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25681" PostTypeId="2" ParentId="20722" CreationDate="2023-03-31T00:55:27.960" Score="4" Body="&lt;p&gt;You might know me as the creator of the 2-D esolang &lt;a href=&quot;https://github.com/bbrk24/Trilangle&quot; rel=&quot;nofollow noreferrer&quot;&gt;Trilangle&lt;/a&gt;. I'm genderfluid so my pronouns vary on a day-to-day basis (or sometimes even more frequently than that), but xe/xem is a safe default if you don't have a chance to ask me or if I don't/can't respond.&lt;/p&gt;&#xA;&lt;p&gt;I created the username &lt;code&gt;bbrk24&lt;/code&gt; when I was in fourth grade, originally for an email account, but I've used it in many other places since. It contains the initials of my deadname, but it doesn't bother me.&lt;/p&gt;&#xA;&lt;p&gt;In 2020, I started having more conversations online compared to in-person, for some reason. People tried to come up with various ways to say that consonant group out loud. The one that stuck best was &lt;em&gt;Beberka&lt;/em&gt;, from someone reading &amp;quot;b-b-r-k&amp;quot; in his native language as &amp;quot;be-be-er-ka&amp;quot;. I say it as [bɛ⁠ˈberka] (original) or [bə⁠ˈbeɹ̈kʰə] (more Englishy), roughly. My username on Discord is Beberka for that reason.&lt;/p&gt;&#xA;&lt;p&gt;My usual profile picture here comes from Discord. For a while, I just had the default profile picture on Discord. At some point, one of my friends started sending a bunch of gradients and people were claiming them for profile pictures, so I did too. I set it as my profile picture here because someone in TNB said they confused me for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/95792/user&quot;&gt;user&lt;/a&gt;. For pride month, I've added a genderfluid &lt;em&gt;symbol&lt;/em&gt; to my pfp, since I can't exactly combine the &lt;em&gt;flag&lt;/em&gt; with the gradient.&lt;/p&gt;&#xA;" OwnerUserId="106545" LastEditorUserId="106545" LastEditDate="2023-06-01T22:56:03.923" LastActivityDate="2023-06-01T22:56:03.923" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25682" PostTypeId="2" ParentId="19279" CreationDate="2023-04-01T03:06:25.753" Score="1" Body="&lt;h2&gt;&lt;a href=&quot;https://github.com/nooodl/gs2&quot; rel=&quot;nofollow noreferrer&quot;&gt;GS2&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;GS2 is a golfing language inspired by J and machine code. It was probably the first golfing language that uses a 256 byte instruction space.&lt;/p&gt;&#xA;&lt;p&gt;GS2 is a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8891/117468&quot;&gt;very competitive&lt;/a&gt; language, despite being created in 2013. Furthermore, some of the ideas first introduced in GS2 (Number shorthands, rest-of-program map) influenced several stack based golfing languages that came later.&lt;/p&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://tio.run/#gs2&quot; rel=&quot;nofollow noreferrer&quot;&gt;TIO&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/nooodl/gs2&quot; rel=&quot;nofollow noreferrer&quot;&gt;GH repo&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerDisplayName="user117468" LastEditorDisplayName="user117468" LastEditDate="2023-04-01T03:17:45.130" LastActivityDate="2023-04-01T03:17:45.130" CommentCount="0" CommunityOwnedDate="2023-04-01T03:06:25.753" ContentLicense="CC BY-SA 4.0" />
  <row Id="25683" PostTypeId="2" ParentId="2140" CreationDate="2023-04-01T06:24:38.447" Score="0" Body="&lt;h1&gt;Soundproof Cell&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-kolmogorov-complexity-tooltip-container&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Here's a message from the organizers:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Hello! We hope this message finds you well.&lt;/p&gt;&#xA;&lt;p&gt;Unfortunately, your performance in the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/259498/&quot;&gt;past games&lt;/a&gt; has been sub par. Your team is unimaginative and lacks creativity. Instead of inventing novel techniques to win our games, you keep sticking to &lt;a href=&quot;https://en.wikipedia.org/wiki/Brute-force_search&quot; rel=&quot;nofollow noreferrer&quot;&gt;the techniques you know&lt;/a&gt;. This is not the spirit we would like to encourage in our games.&lt;/p&gt;&#xA;&lt;p&gt;Tomorrow's game will be very different from what you're used to. To give you some time to prepare, we are telling you the rules in advance.&lt;/p&gt;&#xA;&lt;p&gt;There are 1000000 balloons whose values &lt;a href=&quot;https://raw.githubusercontent.com/huynhtrankhanh/ppcg-soundproof-cell/046db2ab6d8a7e6a26f4ce7a3947fc4a2ae6c6e8/random_numbers.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;you can download here&lt;/a&gt;. These balloons lie on a straight line. Your job is to pop these balloons in an order to get the most &amp;quot;brownie points&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;A balloon may have zero, one or two adjacent balloons. For example, a balloon at the middle of the line has two adjacent balloons. A balloon at the beginning of the line has one adjacent balloon. And if you pop the second balloon, which is the balloon to the right of the first balloon, the balloon at the beginning of the line will have zero adjacent balloons.&lt;/p&gt;&#xA;&lt;p&gt;When you pop a balloon, the &amp;quot;brownie points&amp;quot; you will get will be equal to the average value of all balloons adjacent to the balloon you pop. If the balloon you pop has no adjacent balloons, you get no points. Remember that when a balloon is popped, it is totally destroyed and you can't pop it again. And no worries, you don't have to pop all the balloons.&lt;/p&gt;&#xA;&lt;p&gt;We have a pretty intelligent robot here. It is currently partying inside a soundproof cell. Tomorrow it will pop the balloons on your behalf.&lt;/p&gt;&#xA;&lt;p&gt;The robot, albeit intelligent, has no knowledge of the values of the balloons. It has knowledge of all programming languages in existence. Before the robot pops the balloons, you have to give it some code that when executed, outputs a sequence of balloon indices. You are allowed to use either 0-based or 1-based indices. If after finishing the instructions the robot doesn't get the most &amp;quot;brownie points&amp;quot; possible on your behalf, you are disqualified. But if the robot successfully gets the most &amp;quot;brownie points&amp;quot;, your score will be the length of the code you give the robot. The shorter, the better! This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h1&gt;Summary&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The array of balloon values is fixed in advance.&lt;/li&gt;&#xA;&lt;li&gt;You write a program that outputs the optimal sequence of balloons to pop.&lt;/li&gt;&#xA;&lt;li&gt;Shortest code wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Tips&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The array of values is randomly generated with a CSPRNG and there is no meaningful way to compress it. However, the sequence of balloons has several important patterns that you can exploit.&lt;/li&gt;&#xA;&lt;li&gt;There are many optimal sequences, choose the sequence that is the easiest to compress.&lt;/li&gt;&#xA;&lt;li&gt;Remember you don't have to pop all the balloons.&lt;/li&gt;&#xA;&lt;li&gt;Your code may be too large to fit in an answer. You can host your code elsewhere, and your answer can contain an explanation of how you come up with the code.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="103581" LastEditorUserId="103581" LastEditDate="2023-04-01T14:59:57.090" LastActivityDate="2023-04-01T14:59:57.090" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25684" PostTypeId="2" ParentId="2140" CreationDate="2023-04-01T14:13:51.660" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/259696/doors-and-guards&quot;&gt;Posted&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="114511" LastEditorUserId="114511" LastEditDate="2023-04-03T15:42:21.527" LastActivityDate="2023-04-03T15:42:21.527" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25685" PostTypeId="2" ParentId="8808" CreationDate="2023-04-01T16:49:39.810" Score="1" Body="&lt;p&gt;This now exists:&lt;/p&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/20861/welcome-to-code-golf-and-coding-challenges-stack-exchange&quot;&gt;Welcome to Code Golf and Coding Challenges Stack Exchange!&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;It is tagged with &lt;a href=&quot;/questions/tagged/support&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;support&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-support-tooltip-container&quot;&gt;support&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/faq&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;faq&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-faq-tooltip-container&quot;&gt;faq&lt;/a&gt;, and is now &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/22161/66833&quot;&gt;linked in our info box&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2023-04-01T16:49:39.810" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25686" PostTypeId="2" ParentId="2140" CreationDate="2023-04-02T02:48:39.863" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/259707/&quot;&gt;Shortest distinguishable slice&lt;/a&gt; (posted)&lt;/h1&gt;&#xA;" OwnerUserId="108687" LastEditorUserId="108687" LastEditDate="2023-04-03T23:58:28.667" LastActivityDate="2023-04-03T23:58:28.667" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25687" PostTypeId="2" ParentId="25669" CreationDate="2023-04-04T05:13:17.817" Score="1" Body="&lt;p&gt;@Deadcode : i'd vote for &lt;code&gt;=&lt;/code&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;symmetric along both axes&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;no shift key needed for typing it, and fully terminal/console safe — &lt;em&gt;IIRC it's not part of any commonly used &lt;code&gt;ANSI&lt;/code&gt; &lt;code&gt;\e&lt;/code&gt; escape sequences either, so it's perfectly safe even when it's right next to &lt;code&gt;\033&lt;/code&gt;&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;hardly requiring safe-quotation of any sort, if ever&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;allowable within filenames on all major file systems like &lt;code&gt;ext4&lt;/code&gt; &lt;code&gt;NTFS&lt;/code&gt; &lt;code&gt;APFS&lt;/code&gt; &lt;code&gt;exFAT&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;never requiring &lt;code&gt;regex&lt;/code&gt; escaping, either inside or outside square brackets&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;extremely rarely used for &lt;code&gt;regex&lt;/code&gt;&#xA;— &lt;em&gt;unless you need positive lookahead/look-behind or &lt;code&gt;posix&lt;/code&gt; character equivalence bracket expressions all the time&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;unlike &lt;code&gt;:&lt;/code&gt; &lt;code&gt;!&lt;/code&gt; &lt;code&gt;-&lt;/code&gt; &lt;code&gt;&amp;amp;&lt;/code&gt; &lt;code&gt;&amp;quot;&lt;/code&gt; &lt;code&gt;'&lt;/code&gt; or &lt;code&gt;,&lt;/code&gt;, &lt;code&gt;=&lt;/code&gt; is something that nearly never shows up in linguistic texts or people's names (of any language), making it very ideal demarcation marker for either textual or numerical &lt;em&gt;&lt;strong&gt;data&lt;/strong&gt;&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;unlike &lt;code&gt;&amp;amp;&lt;/code&gt; it has no special meaning as part of replacement &lt;code&gt;regex&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;unlike &lt;code&gt;-&lt;/code&gt; or &lt;code&gt;:&lt;/code&gt;, &lt;code&gt;=&lt;/code&gt; is pretty much never used to delineate date/time information. &lt;code&gt;-&lt;/code&gt; is also for negative numbers, which has far more relevance in you're worried about mathematical context, as well as hyphenation in text. &lt;code&gt;:&lt;/code&gt; is also used for &lt;code&gt;ipv6&lt;/code&gt; and hardware &lt;code&gt;MAC&lt;/code&gt; addresses, while &lt;code&gt;-&lt;/code&gt;s are used in &lt;code&gt;UUID&lt;/code&gt;s&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;unlike &lt;code&gt;%&lt;/code&gt; that's &lt;strong&gt;percentage&lt;/strong&gt; in numerical context, something that occurs rather frequently in textual data (e.g. &amp;quot;inflation was 11% last quarter&amp;quot;), on top of having a modulo meaning in mathematical context, &lt;code&gt;=&lt;/code&gt; only shows up very occasionally in textual data when trying to describe &lt;strong&gt;equivalence&lt;/strong&gt; of non-math-related concepts)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;unlike &lt;code&gt;,&lt;/code&gt; which shows up in textual data all the time, &lt;code&gt;=&lt;/code&gt; hardly does.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;so unless your data primarily involves parametrized URIs, code fragments, or math equations, &lt;code&gt;=&lt;/code&gt; has more pros than cons than just about any other choice.&lt;/p&gt;&#xA;" OwnerUserId="115381" LastActivityDate="2023-04-04T05:13:17.817" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25688" PostTypeId="1" CreationDate="2023-04-04T11:03:28.610" Score="3" ViewCount="89" Body="&lt;p&gt;When I have non-ASCII characters in my C code, TIO counts them as 1 byte.&lt;/p&gt;&#xA;&lt;p&gt;For example, the following C program prints 56 music-related characters on the terminal.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##DcNHDgFhAIDRvVNM2IwFFyDuIkOYhCExViLRe@@9k@i93coNft9LnmJRfE7NI4RJ1RRf2OWW7CHdpQasXodB1XTJ71Q12RwJhvWQbPyNUzHGmWCSKaaZYZY55llgkSWWWWGVNdbZYJMtttlhlz32OeCQI4454ZQzzrngkiuuueGWO@554JEnnnnhlTfe@eCTL7754ddotkWF@AM&quot; rel=&quot;nofollow noreferrer&quot;&gt;Link&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;TIO reports its length as &amp;quot;96 chars, 96 bytes (SBCS)&amp;quot;. I understand &amp;quot;SBCS&amp;quot; as follows:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;C never standardized its source code format. I assume this source code uses an unspecified single-byte codepage. So each character counts as a single byte.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;However, this is unrealistic — even if I include more than 256 different characters in my source code, it still assumes that each character corresponds to one byte.&lt;/p&gt;&#xA;&lt;p&gt;For reference, here is corresponding code in Python: &lt;a href=&quot;https://tio.run/##DcNJbkEBAADQ42DtUmyQxsYOVWoo1YGaZ4kaS6neyg2@95KXyqRjyUQ0CFIP8UQ6HLoNCllz5n204JNFSz5btmLVmi/Wbfhq0zff/fDTlm2/7Ni1Z9@BQ0eOnTh15tyFS1d@u3bj1p17D/549OSvZy/@efU/FAmCOw&quot; rel=&quot;nofollow noreferrer&quot;&gt;link&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;So when can we use byte count reported by TIO as code score?&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Always?&lt;/li&gt;&#xA;&lt;li&gt;Only when our source code contains fewer than 256 different characters?&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Maybe ASCII + 128 other characters?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Only when some &amp;quot;official&amp;quot; single-byte codepage can represent our source code?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Someone has recently mentioned that &amp;quot;We've been through this many times&amp;quot;, but I couldn't find any discussion on it.&lt;/p&gt;&#xA;" OwnerUserId="25315" LastActivityDate="2023-04-04T12:24:08.380" Title="Is byte count on TIO valid, specifically for non-ASCII C code?" Tags="|discussion|code-golf|scoring|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25689" PostTypeId="2" ParentId="25688" CreationDate="2023-04-04T12:04:29.910" Score="4" Body="&lt;h2&gt;Take TIO's count with a pinch of salt&lt;/h2&gt;&#xA;&lt;p&gt;Firstly, if the language on TIO explicitly uses UTF-8 e.g. &lt;a href=&quot;https://tio.run/#python3&quot; rel=&quot;nofollow noreferrer&quot;&gt;Python 3&lt;/a&gt;, then the byte counter is accurate to that encoding.&lt;/p&gt;&#xA;&lt;p&gt;However, if it lists it as &amp;quot;SBCS&amp;quot; (or even &lt;a href=&quot;https://tio.run/#orst&quot; rel=&quot;nofollow noreferrer&quot;&gt;&amp;quot;it's complicated&amp;quot;&lt;/a&gt;), then it is up to the answerer to verify their own byte count. Exactly how you do that will depend on the language, but generally speaking, you should identify an interpreter where that set of bytes is accepted and does what is intended.&lt;/p&gt;&#xA;&lt;p&gt;The reason that TIO does this is that the sheer amount of effort Dennis would have to go through to add explicit byte counters for languages with custom code pages is unreasonable. Given that answers should, in theory, always verify their byte counts before being posted, this compromise is perfectly fine.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;If you are interested, there are 495 UTF-8 languages, 174 SBCS, 8 &lt;code&gt;xxd&lt;/code&gt; languages, 3 &amp;quot;it's complicated&amp;quot; (&lt;a href=&quot;https://tio.run/#7&quot; rel=&quot;nofollow noreferrer&quot;&gt;7&lt;/a&gt;, &lt;a href=&quot;https://tio.run/#orst&quot; rel=&quot;nofollow noreferrer&quot;&gt;Orst&lt;/a&gt; and &lt;a href=&quot;https://tio.run/#sesos&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sesos&lt;/a&gt;) and 1 language that scores in &amp;quot;nibbles&amp;quot;: &lt;a href=&quot;https://tio.run/#mu6&quot; rel=&quot;nofollow noreferrer&quot;&gt;μ6&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2023-04-04T12:24:08.380" LastActivityDate="2023-04-04T12:24:08.380" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25690" PostTypeId="2" ParentId="2140" CreationDate="2023-04-04T12:36:46.433" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/259755/cosine-similarity-of-two-vectors&quot;&gt;Cosine similarity&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="114970" LastEditorUserId="114970" LastEditDate="2023-04-05T12:43:35.440" LastActivityDate="2023-04-05T12:43:35.440" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25692" PostTypeId="1" CreationDate="2023-04-05T14:42:38.733" Score="7" ViewCount="210" Body="&lt;p&gt;According to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1541/how-to-score-ti-basic&quot;&gt;this meta post&lt;/a&gt;, TI-BASIC is scored in tokens rather than characters, to more accurately reflect the byte count in-memory.&lt;/p&gt;&#xA;&lt;p&gt;On my graphing calculator (TI-84 Plus C Silver Edition), the memory menu displays a slightly larger number than this would suggest. This number counts the length of the program name, and an apparent nine-byte header: an empty program with a one-letter name shows up as ten bytes in that menu. As such, I've been listing the length of my programs as &lt;code&gt;memory usage - length of program name - 9&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;However, I recently realized that this &amp;quot;header&amp;quot; includes the first colon in a program, and as such I haven't been counting that. Should it be counted?&lt;/p&gt;&#xA;&lt;p&gt;On one hand, it is part of the program text, and necessary headers in other languages generally count towards program length. On the other hand, in most other languages it is &lt;em&gt;possible&lt;/em&gt; to give the compiler/interpreter a file without this header and you just get an error; for TI-BASIC, this leading colon cannot be deleted.&lt;/p&gt;&#xA;" OwnerUserId="106545" LastEditorUserId="66833" LastEditDate="2023-04-05T15:10:25.870" LastActivityDate="2023-09-06T16:01:30.150" Title="Does the initial `:` in a TI-BASIC program count?" Tags="|discussion|code-golf|scoring|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25693" PostTypeId="2" ParentId="2140" CreationDate="2023-04-05T16:03:05.783" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/259793/lets-go-on-a-hyperjumping-trip&quot;&gt;Hyperjumps Challenge&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="83082" LastEditorUserId="83082" LastEditDate="2023-04-05T21:29:55.870" LastActivityDate="2023-04-05T21:29:55.870" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25695" PostTypeId="2" ParentId="2140" CreationDate="2023-04-05T20:28:01.443" Score="4" Body="&lt;h1&gt;Zählen&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/259894/zahlen-auf-deutsch-numbers-in-german&quot;&gt;Posted here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="117529" LastEditorUserId="117529" LastEditDate="2023-04-09T17:21:38.993" LastActivityDate="2023-04-09T17:21:38.993" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25696" PostTypeId="2" ParentId="25541" CreationDate="2023-04-06T09:08:34.250" Score="2" Body="&lt;h1&gt;Alturistic Golfer&lt;/h1&gt;&#xA;&lt;p&gt;Most of the time, there are a few people that help you improve your answer instead of posting a better one themselves. This award is for people that frequently help others improve their answers. Even if they haven’t been nominated, you must give them credit if they help improve your answer.&lt;/p&gt;&#xA;" OwnerUserId="117478" LastActivityDate="2023-04-06T09:08:34.250" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25697" PostTypeId="2" ParentId="2140" CreationDate="2023-04-06T09:42:32.100" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/259881/the-jaccard-index&quot;&gt;The Jaccard Index&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110265" LastEditorUserId="110265" LastEditDate="2023-04-09T15:04:35.767" LastActivityDate="2023-04-09T15:04:35.767" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25698" PostTypeId="2" ParentId="2140" CreationDate="2023-04-06T12:24:36.680" Score="1" Body="&lt;h1&gt;Is it a hyperjump?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-decision-problem-tooltip-container&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Easy-mode of &lt;a href=&quot;https://codegolf.stackexchange.com/q/259793/108687&quot;&gt;this challenge&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;A &lt;em&gt;hyperjump&lt;/em&gt; is a sequence of numbers 0-9 (exclusive), where:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first two digits can be any two&lt;/li&gt;&#xA;&lt;li&gt;Each number after is the result of a simple math operation (*, /, +, -) on the previous two.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;E.g. [3, 2] → 3+2=&lt;strong&gt;5&lt;/strong&gt;, 3-2=&lt;strong&gt;1&lt;/strong&gt;, 3*2=&lt;strong&gt;6&lt;/strong&gt;, 3/2=&lt;em&gt;not an integer&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;If the result is multiple digits, take the last one. E.g. [7, 5] → 7+5=1 &lt;strong&gt;2&lt;/strong&gt;, 7*5=3 &lt;strong&gt;5&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;The third- and second-most-recent digits may combine to one number and be used. E.g. [4, 1, 3] → 41-3=3 &lt;strong&gt;8&lt;/strong&gt;, …&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The sequence should end with 9. There is no 9 in the list, but it should be able to be there by the rules outlined above.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For example, the sequence 7, 4, 3, 1, 2 is a hyperjump because 7-4=3, 4-3=1, 3-1=2, 31-2=9.&lt;/p&gt;&#xA;&lt;p&gt;Your task is: Given a sequence of digits 1 through 8 inclusive, determine whether it is a valid hyperjump. You may output a truthy/falsy value, or choose two distinct values. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest submission in bytes per language wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Meta: I don’t have time to add test cases right now, I want to make sure this isn’t too similar to the other challenge before working on it more.&lt;/p&gt;&#xA;" OwnerUserId="108687" LastActivityDate="2023-04-06T12:24:36.680" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25699" PostTypeId="2" ParentId="2140" CreationDate="2023-04-06T18:39:06.457" Score="3" Body="&lt;h1&gt;How super is this prime?&lt;/h1&gt;&#xA;&lt;p&gt;Posted &lt;a href=&quot;https://codegolf.stackexchange.com/q/259875/110951&quot;&gt;here&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="110951" LastEditorUserId="110951" LastEditDate="2023-04-09T10:57:22.803" LastActivityDate="2023-04-09T10:57:22.803" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25700" PostTypeId="1" CreationDate="2023-04-08T16:29:56.873" Score="8" ViewCount="201" Body="&lt;p&gt;There is an existing challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/142534/is-it-a-completely-even-number&quot;&gt;Is it a completely even number?&lt;/a&gt; which is very similar to Powers of 2, but asks for 1 to be excluded. I think it's a good challenge, and some people agree, but enough people disagree that it's been unable to get far into the positive-vote range (it only managed to get as far as +3). Before I answered it and edited it, it was in the negative (-3).&lt;/p&gt;&#xA;&lt;p&gt;My comment &lt;a href=&quot;https://codegolf.stackexchange.com/questions/142534/is-it-a-completely-even-number#comment516067_142534&quot;&gt;This would be a good challenge if there were also a &amp;quot;Powers of 2&amp;quot; challenge&lt;/a&gt; has gotten 4 upvotes. This seems to be a pretty clear message that such a new challenge should be created. But I am afraid of trying, because CGCC has a history of challenges being closed as duplicates for being far less similar to another than &amp;quot;Powers of 2&amp;quot; would be to this one. So it's a Catch-22.&lt;/p&gt;&#xA;&lt;p&gt;However, there is precedent for very similar questions being allowed to stay up. For example, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/210071/the-vanilla-factorial-challenge&quot;&gt;The vanilla factorial challenge&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;So, can we do this for Powers of 2?&lt;/p&gt;&#xA;&lt;p&gt;I would leave my own answers to &amp;quot;Completely even&amp;quot; unchanged, and wouldn't answer Powers of 2 myself, because my answers already compare and contrast solutions for that challenge with those for Powers of 2. But the vast majority of answers do not do this, even though I put a message encouraging it in &amp;quot;Completely even&amp;quot;. Thus, if a &amp;quot;Powers of 2&amp;quot; question were allowed to stay up, I would edit &amp;quot;Completely even&amp;quot; to remove the clause encouraging answers to discuss their difference from Powers of 2.&lt;/p&gt;&#xA;" OwnerUserId="17216" LastEditorUserId="17216" LastEditDate="2023-04-08T17:12:39.617" LastActivityDate="2023-04-08T17:51:52.597" Title="Could a new &quot;Is it a power of 2?&quot; question escape being closed as a duplicate?" Tags="|discussion|duplicates|" AnswerCount="4" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25701" PostTypeId="2" ParentId="25700" CreationDate="2023-04-08T17:29:32.007" Score="8" Body="&lt;p&gt;Yes, a new Powers of 2 question should be allowed to stay open.&lt;/p&gt;&#xA;" OwnerUserId="17216" LastActivityDate="2023-04-08T17:29:32.007" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25702" PostTypeId="2" ParentId="25700" CreationDate="2023-04-08T17:31:00.263" Score="-4" Body="&lt;p&gt;No, Powers of 2 is too similar to the existing &amp;quot;Completely even&amp;quot; challenge, and even those that challenge is heavily downvoted, it's too late to have an actual &amp;quot;Powers of 2&amp;quot; challenge. That ship has sailed.&lt;/p&gt;&#xA;" OwnerUserId="17216" LastActivityDate="2023-04-08T17:31:00.263" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25703" PostTypeId="2" ParentId="25700" CreationDate="2023-04-08T17:37:53.157" Score="15" Body="&lt;p&gt;If a new &amp;quot;Powers of 2&amp;quot; question is allowed to stay open, &amp;quot;Completely even&amp;quot; should still be left open.&lt;/p&gt;&#xA;&lt;p&gt;Although in many golfing languages an answer to both questions is the same length, there are languages where they differ in an interesting way.&lt;/p&gt;&#xA;" OwnerUserId="17216" LastActivityDate="2023-04-08T17:37:53.157" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25704" PostTypeId="2" ParentId="25700" CreationDate="2023-04-08T17:39:03.400" Score="-3" Body="&lt;p&gt;If a new &amp;quot;Powers of 2&amp;quot; question is allowed to stay open, &amp;quot;Completely even&amp;quot; should be closed.&lt;/p&gt;&#xA;&lt;p&gt;If you upvote this, I'd appreciate a comment explaining why. The challenge already has many answers, and some of them actually expose an interesting difference between the two questions.&lt;/p&gt;&#xA;&lt;p&gt;Also, if this is the choice that ends up being more voted, I'm unlikely to post a &amp;quot;Powers of 2&amp;quot; question myself. I &lt;em&gt;hate&lt;/em&gt; how often CGCC closes questions for being duplicates that are actually different in an interesting way. I would much prefer a &amp;quot;live and let live&amp;quot; policy unless a question really is a true duplicate. It's especially heinous to see this happen to questions that have a ton of answers; closing it is robbing future people from being able to have that opportunity too.&lt;/p&gt;&#xA;" OwnerUserId="17216" LastEditorUserId="17216" LastEditDate="2023-04-08T17:51:52.597" LastActivityDate="2023-04-08T17:51:52.597" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25706" PostTypeId="2" ParentId="2140" CreationDate="2023-04-09T05:17:42.970" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/259890/110698&quot;&gt;Determine NBA conference seedings&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110698" LastEditorUserId="110698" LastEditDate="2023-04-09T16:55:07.593" LastActivityDate="2023-04-09T16:55:07.593" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25708" PostTypeId="2" ParentId="2447" CreationDate="2023-04-09T18:14:40.280" Score="23" Body="&lt;h1&gt;Multiple arguments to a function can be taken as a list or tuple instead&lt;/h1&gt;&#xA;&lt;p&gt;For example, if you needed to take in two integers as arguments, you can take one argument: a list of both integers.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/259881/the-jaccard-index#comment572502_259881&quot;&gt;Apparently&lt;/a&gt;, this isn't already here, so I'm posting this answer.&lt;/p&gt;&#xA;" OwnerUserId="114446" LastEditorUserId="91213" LastEditDate="2023-07-31T13:21:25.350" LastActivityDate="2023-07-31T13:21:25.350" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25710" PostTypeId="2" ParentId="2447" CreationDate="2023-04-12T13:31:23.857" Score="-6" Body="&lt;h1&gt;You can have as many newlines after your output as you want.&lt;/h1&gt;&#xA;&lt;p&gt;It doesn’t matter what type of newline.&lt;/p&gt;&#xA;" OwnerUserId="117478" LastActivityDate="2023-04-12T13:31:23.857" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25711" PostTypeId="2" ParentId="2140" CreationDate="2023-04-12T16:11:33.117" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/260159/113573&quot;&gt;Shortest Path Around Obstacle&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2023-04-16T17:02:02.957" LastActivityDate="2023-04-16T17:02:02.957" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25712" PostTypeId="1" AcceptedAnswerId="25713" CreationDate="2023-04-12T16:30:13.647" Score="3" ViewCount="64" Body="&lt;p&gt;Sorry for a stupid question, but I read &lt;a href=&quot;https://codegolf.stackexchange.com/help/searching&quot;&gt;How do I search?&lt;/a&gt; and didn’t understand:&lt;br /&gt;&#xA;How to find answers in a given (programming) language?&lt;/p&gt;&#xA;" OwnerUserId="114511" LastEditorUserId="97857" LastEditDate="2023-04-12T16:31:31.710" LastActivityDate="2023-04-12T17:01:49.083" Title="Find answers in given language" Tags="|support|answers|languages|search|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25713" PostTypeId="2" ParentId="25712" CreationDate="2023-04-12T17:01:49.083" Score="3" Body="&lt;p&gt;There is no 100% reliable way, but most of the time, it works pretty well to &lt;strong&gt;search for the language's name&lt;/strong&gt; in answers:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;is:a python&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This approach does generate some false positives, such as when someone says &amp;quot;my answer is a port of someone else's Python answer.&amp;quot; Also, when the name of the language is a common word like Curry, answers that use that word tend to show up near the top of the results list, ahead of answers that actually use the language. One trick that can help is to &lt;strong&gt;sort the results by Newest&lt;/strong&gt; instead of Relevance: the more &amp;quot;relevant&amp;quot; answers, ironically, tend to be the ones with false positives.&lt;/p&gt;&#xA;&lt;p&gt;The bigger drawback is that searching the language name doesn't work well for languages with very short names, such as J. In this case, &lt;strong&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/new&quot; rel=&quot;nofollow noreferrer&quot;&gt;StackExchange Data Explorer&lt;/a&gt;&lt;/strong&gt; is your best hope. I've put together an example query that finds the latest 100 answers in a given language: &lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1736815/recent-answers-in-a-language&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://data.stackexchange.com/codegolf/query/1736815/recent-answers-in-a-language&lt;/a&gt;. The caveat here is that the query is pretty strict about what header formats it matches, so some answers may be excluded, particularly in languages that frequently list command-line flags or libraries in their answer headers. Feel free to tweak it to make it fit your needs better.&lt;/p&gt;&#xA;" OwnerUserId="16766" LastActivityDate="2023-04-12T17:01:49.083" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25714" PostTypeId="2" ParentId="1514" CreationDate="2023-04-12T19:27:51.037" Score="-3" Body="&lt;p&gt;There do exist some good &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-trolling-tooltip-container&quot;&gt;code-trolling&lt;/a&gt; posts &lt;a href=&quot;https://codegolf.stackexchange.com/a/16629/117478&quot;&gt;like this answer to a code-trolling question about factorials&lt;/a&gt;. To make a good &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-trolling-tooltip-container&quot;&gt;code-trolling&lt;/a&gt; post, it must be funny first of all, and it also must nudge people to code interesting solutions to (possibly) basic questions.&lt;/p&gt;&#xA;" OwnerUserId="117478" LastActivityDate="2023-04-12T19:27:51.037" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25715" PostTypeId="2" ParentId="2140" CreationDate="2023-04-13T13:23:16.147" Score="-1" Body="&lt;h1&gt;Minimum Buttons on a calculator to get from one number to another &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;My calculator looks like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;·   ·   ·   ·   ·&#xA;  1   2   3   +&#xA;·   ·   ·   ·   ·&#xA;  4   5   6   -&#xA;·   ·   ·   ·   ·&#xA;  7   8   9   * &#xA;·   ·   ·   ·   ·&#xA;  =       0   /  &#xA;·   ·   ·   ·   · &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Given a starting number and a ending number, calculate the minimum sequence of button presses required to get from the starting number to the ending number.&lt;/p&gt;&#xA;&lt;h2&gt;Notes:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;/&lt;/code&gt; is integer division, no need to handle floats&lt;/li&gt;&#xA;&lt;li&gt;Simple calculators always calculate from left to right, no complex order of operations&lt;/li&gt;&#xA;&lt;li&gt;A &lt;code&gt;=&lt;/code&gt; is needed at the end to display the final number if the start and ending number are different&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;A&lt;/th&gt;&#xA;&lt;th&gt;B&lt;/th&gt;&#xA;&lt;th&gt;Result&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;+1=&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;49&lt;/td&gt;&#xA;&lt;td&gt;33&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;-16=&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;120&lt;/td&gt;&#xA;&lt;td&gt;1081&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;*9+1=&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;More test cases TBD&lt;/p&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-04-15T15:54:45.700" LastActivityDate="2023-04-15T15:54:45.700" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25716" PostTypeId="1" CreationDate="2023-04-13T15:43:22.190" Score="12" ViewCount="431" Body="&lt;p&gt;On January 4th, 2022, it was decided &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24251/what-is-our-consensus-for-fractional-byte-functions&quot;&gt;we would allow scoring in fractional bytes&lt;/a&gt;. A decision I mostly agree with. Just to recap, the main reason this is beneficial for the site is:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It allows comparing answers in the same language even if they would otherwise &amp;quot;round up&amp;quot; to the same value.&lt;/li&gt;&#xA;&lt;li&gt;It allows languages to compete that do not use a traditional binary storage system to compete.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This makes a lot of sense, for these languages. However, to convert to bytes, people came up with using &lt;span class=&quot;math-container&quot;&gt;\$\log_{256}(b)\$&lt;/span&gt; to compare these to normal languages. This works great for languages like Nibbles where it comes out to a rational number, but is annoying for languages like Fig or Thonnu when it comes out be be irrational:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It still doesn't allow comparing languages that don't use a numerical system at all.&lt;/li&gt;&#xA;&lt;li&gt;It requires complex MathJax in titles that is hard to parse, hard to write, and hard to compare when the result is a complex decimal.&lt;/li&gt;&#xA;&lt;li&gt;It creates paradoxes like &lt;a href=&quot;https://codegolf.stackexchange.com/a/260046/91213&quot;&gt;this&lt;/a&gt; where unary suddenly becomes worth 0 bytes. I'm well aware that answer wasn't actually scored according to the meta consensus and particularly the accepted answer on fractbytes mentions nothing about log byte scoring.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If our goal is to make languages easier to compare, this has failed miserably.&lt;/p&gt;&#xA;&lt;h2&gt;Potential Solution&lt;/h2&gt;&#xA;&lt;p&gt;Our goal is to compare answers in the same language as effectively as possible. Then why use bytes at all? It makes no sense to me to score a base-3 language in bytes which is a fundamentally different number system, even if you could convert them with complex logarithms.&lt;/p&gt;&#xA;&lt;p&gt;We only compare answers in the same language anyways. If language designers want to compare languages they can compute the logarithm and compare them that way if they want to, but as I understand it they round up to the nearest byte anyways so the log bytes solution doesn't help them either.&lt;/p&gt;&#xA;&lt;p&gt;Thus I suggest the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Answers do not need to be scored in bytes.&lt;/li&gt;&#xA;&lt;li&gt;Instead, they are scored in whatever is most convenient, it be nibbles, trits, codels, etc.&lt;/li&gt;&#xA;&lt;li&gt;If there is no existing unit that properly works, like a language that has 196 builtins and would like to encode them in a shorter way, you can use the word &amp;quot;symbol.&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;Fractional multiples of &amp;quot;symbol&amp;quot; are still ok&lt;/li&gt;&#xA;&lt;li&gt;There could be a reasonalbe limit that there can be only a finite number of meaningful distinct programs for a specific number of symbols. For example, when scoring by number of logic gates there could be a infinite number of ways to place logic gates on the infinite playing field but they are not really distinct unless they connect in different ways.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This allows easy to read (and machine parse) titles, languages that don't use a numeric system at all to participate, while as far as I can tell harming nobody.&lt;/p&gt;&#xA;&lt;p&gt;Let me know your thoughts.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-04-13T19:49:27.660" LastActivityDate="2023-04-22T16:26:34.430" Title="Allow answers to be scored in things other than bytes to stop the log byte madness" Tags="|discussion|scoring|" AnswerCount="5" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="25717" PostTypeId="2" ParentId="25716" CreationDate="2023-04-13T15:51:31.007" Score="4" Body="&lt;h1&gt;Yes please&lt;/h1&gt;&#xA;&lt;p&gt;I acknowledge they I am the original perpetrator of the log byte thing, having created Fig, but after the creation of Thunno, I became slightly disillusioned with it. After seeing the unary example, I was ticked off.&lt;/p&gt;&#xA;&lt;p&gt;I agree with allowing scoring systems other than bytes, but that brings a problem. How are we to compare scores? How many qubits are in a byte? If we are to adopt this, such would warrant a separate meta discussion.&lt;/p&gt;&#xA;" OwnerUserId="107299" LastEditorUserId="107299" LastEditDate="2023-04-13T18:06:31.660" LastActivityDate="2023-04-13T18:06:31.660" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25718" PostTypeId="2" ParentId="2140" CreationDate="2023-04-13T16:00:46.033" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/260075/calculate-bloons-rbe-equivalent&quot;&gt;Calculate Bloons RBE Equivalent&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="113007" LastEditorUserId="113007" LastEditDate="2023-04-14T13:32:23.780" LastActivityDate="2023-04-14T13:32:23.780" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25719" PostTypeId="2" ParentId="25716" CreationDate="2023-04-13T17:22:53.960" Score="-2" Body="&lt;h1&gt;Yes but with limits&lt;/h1&gt;&#xA;&lt;p&gt;I think answers &lt;strong&gt;still must be in units convertable to bytes&lt;/strong&gt;. That means trits, 96-its, etc. would be allowed, but not, e.g., codels. While answers might use different units, they still need to measure something representable using bytes. A 96-it is still &lt;span class=&quot;math-container&quot;&gt;\$\frac{log_2{96}}{8}\$&lt;/span&gt; bytes, and a trit is still &lt;span class=&quot;math-container&quot;&gt;\$\frac{log_2{3}}{8}\$&lt;/span&gt; bytes, we just save the clutter of putting that in the header.&lt;/p&gt;&#xA;&lt;p&gt;I don't think we need a meta consensus for this tho; it's just a different way of writing the same information. We've never had a rule saying you can't do that.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2023-04-13T17:22:53.960" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25720" PostTypeId="1" CreationDate="2023-04-13T17:29:44.867" Score="-10" ViewCount="132" Body="&lt;p&gt;About 9 years ago, every question about &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-trolling-tooltip-container&quot;&gt;code-trolling&lt;/a&gt; was locked and asking new questions about this topic was banned. If you missed this, &lt;a href=&quot;https://www.reddit.com/r/codetrolling/&quot; rel=&quot;nofollow noreferrer&quot;&gt;I created a subreddit for this&lt;/a&gt;, and hopefully we can make it to Stack Exchange! I will make a proposal on Area 51 soon.&lt;/p&gt;&#xA;" OwnerUserId="117478" LastEditorUserId="117478" LastEditDate="2023-04-14T08:47:06.593" LastActivityDate="2023-04-14T08:47:06.593" Title="We can continue code trolling! (NOT A COMMUNITY CONSENSUS)" Tags="|discussion|code-trolling|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25721" PostTypeId="2" ParentId="25716" CreationDate="2023-04-13T19:46:16.877" Score="10" Body="&lt;h1&gt;No change in rules is needed, simply a change in behavior&lt;/h1&gt;&#xA;&lt;p&gt;This might not be a complete answer, but I would like to provide what I think is a solution to the issues that doesn't actually require changing any rules.&lt;/p&gt;&#xA;&lt;p&gt;First lets talk about weird and unpleasant formatting.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25719/56656&quot;&gt;Rydwolf points out&lt;/a&gt; that there aren't currently any rules that require you to format your header in a particular way. In fact there is &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1206/56656&quot;&gt;a consensus&lt;/a&gt; that there are no rules.&lt;/p&gt;&#xA;&lt;p&gt;So currently people do have the freedom to write &amp;quot;8 trits&amp;quot;, &amp;quot;19 Nibbles&amp;quot;, or &amp;quot;2.99999999999 bytes&amp;quot;. They just aren't. Changing the rules might encourage them to write differently. But seeing as this formatting is so widely disliked, I think making it clear that it is allowed to format in other, more pleasant ways, and giving some encouragement to do so will be enough to shift the way people format it.&lt;/p&gt;&#xA;&lt;p&gt;Now lets talk about non-fractional byte things.&lt;/p&gt;&#xA;&lt;p&gt;There's no rule that says you can't golf in codels either. Our rules do say that:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Answers that produce correct results, comply with the rules of the challenge, but aren't a serious contender for the winning criteria &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7990/56656&quot;&gt;[1]&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;should be deleted.&lt;/p&gt;&#xA;&lt;p&gt;However we've also been clear that:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A serious contender is a submission which makes a serious effort towards optimizing the submission's score within the chosen language(s) and other choices (such as algorithm choice or optional restrictions/bonuses taken).&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/23926/56656&quot;&gt;[2]&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I think it is pretty straightforward to take away from this that yes you can golf with a different score than bytes in mind. &amp;quot;The program is going to optimize this metric&amp;quot; is a self-imposed restriction.&lt;/p&gt;&#xA;&lt;p&gt;And as long as your scoring goal is conducive to shorter programs, and it seems all the interesting ones are, I don't see any rules actually being broken. Sure you might be able to get a shorter program by optimizing for bytes, but that would violate your restriction, so there's no requirement to do it.&lt;/p&gt;&#xA;&lt;p&gt;Since, as previously stated, there's no requirement to put your byte count in the header you can put &lt;em&gt;that score&lt;/em&gt; in the header. If someone asks for the byte count, I would suggest providing it to them, but that's just general courtesy.&lt;/p&gt;&#xA;&lt;p&gt;The same applies here as the last one, just because something is allowed by the rules doesn't mean that everyone is taking advantage of it. But hopefully if we are clear that this is allowed, either through a rule change or just general communication people will change.  Or maybe they won't, that's also fine, people can certainly continue to golf in bytes if that's what they prefer.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2023-04-22T16:26:34.430" LastActivityDate="2023-04-22T16:26:34.430" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="25722" PostTypeId="2" ParentId="25720" CreationDate="2023-04-13T21:07:38.960" Score="10" Body="&lt;h2&gt;This is a bad idea&lt;/h2&gt;&#xA;&lt;p&gt;Firstly, read &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/1514/66833&quot;&gt;We need to take an official stance on code trolling&lt;/a&gt;, cause, well, it explains better than I could why &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-trolling-tooltip-container&quot;&gt;code-trolling&lt;/a&gt; is a &lt;em&gt;very&lt;/em&gt; poor fit for the Stack Exchange model.&lt;/p&gt;&#xA;&lt;p&gt;Secondly, don't make a proposal on Area 51 - it's gonna get closed as soon as you do. That said, a subreddit isn't a bad call; of all the places code trolling might be appreciated, Reddit is a decent option.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-trolling-tooltip-container&quot;&gt;code-trolling&lt;/a&gt; has been dead and banned for almost a &lt;em&gt;decade&lt;/em&gt; now, and for good reason. In short, it is close to impossible to consistently write quality &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-trolling-tooltip-container&quot;&gt;code-trolling&lt;/a&gt; questions, and the &lt;em&gt;rare&lt;/em&gt; few that do work aren't even good fits for CGCC, even with our loose fit into the SE model. If you wanna do some &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-trolling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-trolling&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-trolling-tooltip-container&quot;&gt;code-trolling&lt;/a&gt;, do it in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;. Anything on main will be closed, and there's zero chance an entire site will be created by it, given that &lt;a href=&quot;https://meta.stackexchange.com/questions/214061/trolls-in-our-halls&quot;&gt;the entire network dislikes it&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2023-04-13T21:07:38.960" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25727" PostTypeId="2" ParentId="2140" CreationDate="2023-04-16T03:23:00.973" Score="6" Body="&lt;h2&gt;Output the ground-state configutation of an element &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Task: Given the atomic number as input, output the ground-state electron configuration.&lt;/p&gt;&#xA;&lt;h2&gt;Background info&lt;/h2&gt;&#xA;&lt;p&gt;In each orientation per orbital, there can be at most 2 electrons. Specifically:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The &lt;code&gt;s&lt;/code&gt; orbital has 1 orientation, so it can be filled with a maximum of 2 electrons.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;code&gt;p&lt;/code&gt; orbital has 3 orientations, so it can be filled with a maximum of 6 electrons.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;code&gt;d&lt;/code&gt; orbital has 5 orientations, so it can be filled with a maximum of 10 electrons.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;code&gt;f&lt;/code&gt; orbital has 7 orientations, so it can be filled with a maximum of 14 electrons.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;et cetera.&lt;/p&gt;&#xA;&lt;p&gt;The orbitals per orbit level are listed like so:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1s&#xA;2s 2p&#xA;3s 3p 3d&#xA;4s 4p 4d 4f&#xA;5s 5p 5d 5f ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Based on the Aufbau priciple, we order the orbitals diagonally, so the energy order of these orbitals is like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1s &amp;lt; 2s &amp;lt; 2p &amp;lt; 3s &amp;lt; 3p &amp;lt; 4s &amp;lt; 3d &amp;lt; 4p &amp;lt; 5s &amp;lt; 4d &amp;lt; 5p &amp;lt; ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The orbitals with higher energy levels are only filled up if all of the lower energy level orbitals are completely filled. Taking Na (atomic number 11) as an example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1s^2, 2s^2, 2p^6, 3s^1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(&lt;code&gt;2p^6&lt;/code&gt; means there are 6 electrons in the &lt;code&gt;2p&lt;/code&gt; orbital, and so on.)&lt;/p&gt;&#xA;&lt;p&gt;Finally, we put that in order and output the electrons at the specfied level:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1: 1s^2&#xA;2: 2s^2 2p^6&#xA;3: 3s^1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;So &lt;code&gt;2, 8, 1&lt;/code&gt; is our output.&lt;/p&gt;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 -&amp;gt; [1]&#xA;3 -&amp;gt; [2, 1]&#xA;9 -&amp;gt; [2, 7]&#xA;10 -&amp;gt; [2, 8]&#xA;13 -&amp;gt; [2, 8, 3]&#xA;21 -&amp;gt; [2, 8, 9, 2]&#xA;28 -&amp;gt; [2, 8, 16, 2]&#xA;29 -&amp;gt; [2, 8, 18, 1]&#xA;34 -&amp;gt; [2, 8, 18, 6]&#xA;41 -&amp;gt; [2, 8, 18, 12, 1]&#xA;48 -&amp;gt; [2, 8, 18, 18, 2]&#xA;115 -&amp;gt; [2, 8, 18, 32, 32, 18, 5]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerDisplayName="user117658" LastEditorDisplayName="user117658" LastEditDate="2023-04-29T03:26:27.960" LastActivityDate="2023-04-29T03:26:27.960" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25729" PostTypeId="2" ParentId="2140" CreationDate="2023-04-17T11:33:21.930" Score="3" Body="&lt;h1&gt;International Resource Trading KOTH &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-king-of-the-hill-tooltip-container&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Your country wants to reach Mars, and do it as cheaply as possible. While you can produce all required resources domestically, other countries can produce them cheaper and trading can drastically reduce both your costs.&lt;/p&gt;&#xA;&lt;h2&gt;Goal of the game&lt;/h2&gt;&#xA;&lt;p&gt;There are 10 resources, numbered 1-10. You need 1,000 of each resource to build a rocket and colonize Mars.&lt;/p&gt;&#xA;&lt;p&gt;The cost of each rocket is different for each player though. One will cost €10, one €20, €30, ... and the last costs €100 per unit. This number is different for every bot, for example resource 1 could cost €20 for one but but €90 for a different bot.&lt;/p&gt;&#xA;&lt;p&gt;Without trading, the rocket would cost €550,000. But if you import resources that are expensive for you to produce, and sell resources that are cheap for you to produce. If you do it right, you can make the process massively cheaper or even potentially make a profit and still launch your rocket.&lt;/p&gt;&#xA;&lt;h2&gt;The game loop&lt;/h2&gt;&#xA;&lt;p&gt;The game consists of 7 rounds. Each round has 2 phases.&lt;/p&gt;&#xA;&lt;p&gt;The first phase is the production phase. Each bot can choose to produce some number of resources locally. The total limit for how much you can produce is 10 the first round, 20, 40, 80 ... 1280 in the last round. Bots can choose to divide their production among every resource. For example, you can buy 6 of resource A and 4 of resource B in the first round. Money will be subtracted from your score proportional to the value the resource has for you.&lt;/p&gt;&#xA;&lt;p&gt;The second phase is the trading phase. In turns, every bot has the option offer a trade. Then other bots can choose to accept the offer or to create a counteroffer. Then the bot may choose to accept any of the counteroffers or reject all of them.&lt;/p&gt;&#xA;&lt;p&gt;Trades can either be money for resources or resources for money. You can't trade resources for resources directly.&lt;/p&gt;&#xA;&lt;p&gt;There are 3 rounds of trading for every production phase.&lt;/p&gt;&#xA;&lt;p&gt;If the game ends before you collect enough to launch your rocket, the rest of the resources will be produced domestically and cost you the domestic production price.&lt;/p&gt;&#xA;&lt;h2&gt;Example bot&lt;/h2&gt;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;class PriceBelowHalf:&#xA;    &amp;quot;&amp;quot;&amp;quot;&#xA;    Will only buy resources if the price is less than half the local production price&#xA;    Will only sell resources if the price is more than double the local production price&#xA;    &amp;quot;&amp;quot;&amp;quot;&#xA;&#xA;    def __init__(self, bot_ids: list[int], resource_prices: dict[int, int], rng):&#xA;        # Randomness only allowed via the provided RNG.&#xA;        self.bot_ids = bot_ids&#xA;        self.resource_prices = resource_prices&#xA;&#xA;    def production_phase(self, max_production: int, resources: dict[int, int]):&#xA;        # produce the maximum amount of the cheapest resource&#xA;        return {min(self.resource_prices, key=lambda i:resource_prices[i]): max_production}&#xA;    &#xA;    def trade(self, resources: dict[int, int]):&#xA;        # Offer to buy the resource we have the least of for half it's price&#xA;        resource = min(resources, key=lambda i:resources[i])&#xA;&#xA;        # 2 item tuples are treated as resources, single integers are treated as money&#xA;        # First element is what you get, second is what you want to give&#xA;        return [(resource, 10),&#xA;                self.resource_prices[resource]*5]&#xA;&#xA;    def trade_offer_accepted(self, resources: dict[int, int], counteroffers: list):&#xA;        for counteroffer in counteroffers:&#xA;            # Accept the first counteroffer that is a good deal&#xA;            if isinstance(counteroffer[0], tuple) and \&#xA;               counteroffer[0][1] * 2 &amp;gt; self.resource_prices[counteroffer[0][0]] * counteroffer[1]:&#xA;                return counteroffer&#xA;&#xA;    def trade_offer_received(self, trade_offer: list, resources:dict[int, int]):&#xA;        # If you return a offer in the same format it would be treated as a counteroffer&#xA;        # Counteroffer must be for the same resource but you may change both the amount of money and the amount of the resource&#xA;        # If you want to unconditionally accept simply `return trade_offer`&#xA;        # If you return None you will reject the offer&#xA;        # third element of the trade offer is the bot that offered it&#xA;&#xA;        # they want to give a resource for money&#xA;        if isinstance(trade_offer[0], tuple):&#xA;            # Must be greater than 2:1 ratio to our own price&#xA;            return [[counteroffer[0][0], counteroffer[0][1]],&#xA;                    # Pay half price or the other bot offered, whatever is cheaper&#xA;                    min(&#xA;                        self.resource_prices[counteroffer[0][0]] * counteroffer[0][1]] // 2,&#xA;                        trade_offer[1]&#xA;                    )&#xA;            ]&#xA;        else:&#xA;            # They want to give money for our resources, so we need to check if we have enough&#xA;            if resources[trade_offer[1][0]]&amp;gt;=trade_offer[1][1]:&#xA;                return [&#xA;                    max(&#xA;                        trade_offer[0],&#xA;                        self.resource_prices[trade_offer[1][0]] * trade_offer[1][1]&#xA;                    ),&#xA;                    trade_offer[1]&#xA;                ]&#xA; &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Extra Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No IO&lt;/li&gt;&#xA;&lt;li&gt;No RNG except via the provided seeded PRNG&lt;/li&gt;&#xA;&lt;li&gt;No exploiting the controller&lt;/li&gt;&#xA;&lt;li&gt;No targeting a specific bot or specifically helping one specific bot. Hurting or helping a range of strategies is perfectly fine.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2023-04-17T11:33:21.930" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="25730" PostTypeId="2" ParentId="2140" CreationDate="2023-04-17T21:00:35.577" Score="1" Body="&lt;h1&gt;Draw a Regular Reuleaux Polygon&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-graphical-output-tooltip-container&quot;&gt;graphical-output&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-geometry-tooltip-container&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/126078/108687&quot;&gt;Related&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;A &lt;a href=&quot;https://en.m.wikipedia.org/wiki/Reuleaux_polygon&quot; rel=&quot;nofollow noreferrer&quot;&gt;Reuleaux polygon&lt;/a&gt; is a &lt;a href=&quot;https://en.m.wikipedia.org/wiki/Curve_of_constant_width&quot; rel=&quot;nofollow noreferrer&quot;&gt;curve of constant width&lt;/a&gt; made up of &lt;a href=&quot;https://en.m.wikipedia.org/wiki/Circular_arc&quot; rel=&quot;nofollow noreferrer&quot;&gt;circular arcs&lt;/a&gt; of constant radius. The most well-known Reuleaux polygon is the &lt;a href=&quot;https://en.m.wikipedia.org/wiki/Reuleaux_triangle&quot; rel=&quot;nofollow noreferrer&quot;&gt;Reuleaux triangle&lt;/a&gt;, which has three sides. In this challenge, you will be tasked to draw a regular Reuleaux polygon of a given number of sides.&lt;/p&gt;&#xA;&lt;p&gt;A Reuleaux polygon is constructed by taking a polygon and replacing each of its sides with an arc centered at the opposite vertex.&lt;/p&gt;&#xA;&lt;p&gt;This sort of shape can only be constructed from a polygon with an odd number of sides, so your input will be an odd number greater than or equal to three.&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Reuleaux pentagon (5 sides)&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Reuleaux heptagon (7 sides)&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/nuijH.png&quot; alt=&quot;constructed pentagon&quot; /&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/f8lcN.png&quot; alt=&quot;constructed heptagon&quot; /&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/6hsI6.png&quot; alt=&quot;pentagon&quot; /&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/y9brv.png&quot; alt=&quot;heptagon&quot; /&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;The circles in the first row are shown to demonstrate the construction; Your program's output should be closer to that of the second row (though the border and center mark are optional.)&lt;/p&gt;&#xA;&lt;p&gt;Given a odd number ≥ 3, draw a regular Reuleaux polygon with that many sides.&lt;/p&gt;&#xA;" OwnerUserId="108687" LastEditorUserId="108687" LastEditDate="2023-04-18T01:35:26.880" LastActivityDate="2023-04-18T01:35:26.880" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25731" PostTypeId="2" ParentId="6918" CreationDate="2023-04-18T01:47:01.247" Score="3" Body="&lt;h2&gt;&lt;a href=&quot;https://github.com/jfioasd/minigolf&quot; rel=&quot;nofollow noreferrer&quot;&gt;minigolf&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;An esolang created by me (jfioasd) that is neither like a golflang nor like a tarpit esolang.&lt;/p&gt;&#xA;&lt;p&gt;Originally, it was going to be a golfing language with an octal encoding. While packing as many useful commands as possible, I made the language extremely minimalistic.&lt;/p&gt;&#xA;&lt;p&gt;Later, I found that it's too hard to program in (because octal doesn't let you pack a lot of useful builtins and constants inside it that makes golfing easier) so I decided to turn it into an esolang.&lt;/p&gt;&#xA;&lt;p&gt;minigolf is neither competitive as a golflang nor as tiny as a tarpit, rather somewhere between these two. It has high-level builtins (such as map and flatten) that make a lot of things convenient, but programs written in minigolf can actually be quite long.&lt;/p&gt;&#xA;&lt;p&gt;For the naming, consider it as a portmanteau of 'mini' (as in &lt;a href=&quot;https://esolangs.org/wiki/Mini-Flak&quot; rel=&quot;nofollow noreferrer&quot;&gt;Mini-flak&lt;/a&gt;) and 'golf'(as in &lt;a href=&quot;https://github.com/maxbergmark/mathgolf&quot; rel=&quot;nofollow noreferrer&quot;&gt;mathgolf&lt;/a&gt;).&lt;/p&gt;&#xA;" OwnerDisplayName="user117658" LastEditorDisplayName="user117658" LastEditDate="2023-04-18T07:07:30.893" LastActivityDate="2023-04-18T07:07:30.893" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25732" PostTypeId="2" ParentId="2140" CreationDate="2023-04-18T12:56:30.663" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/260302/is-it-a-plausible-chess-move&quot;&gt;Is it a plausible chess move&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2023-04-20T11:34:34.980" LastActivityDate="2023-04-20T11:34:34.980" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25733" PostTypeId="2" ParentId="2140" CreationDate="2023-04-18T13:18:36.393" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/260266/the-number-of-solutions-to-hertzsprungs-problem&quot;&gt;The number of solutions to Hertzsprung's Problem&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/combinatorics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;combinatorics&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-combinatorics-tooltip-container&quot;&gt;combinatorics&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-number-tooltip-container&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-integer-tooltip-container&quot;&gt;integer&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2023-04-19T14:27:14.940" LastActivityDate="2023-04-19T14:27:14.940" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25734" PostTypeId="2" ParentId="25716" CreationDate="2023-04-18T17:32:13.340" Score="5" Body="&lt;h1&gt;Score in bytes, for the sake of clarity&lt;/h1&gt;&#xA;&lt;p&gt;(I used to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8176/36398&quot;&gt;think differently&lt;/a&gt;, but I changed my mind.)&lt;/p&gt;&#xA;&lt;p&gt;If the language is encoded in smaller units than bytes, say nibbles, those could always be converted to bytes, rounding up if necessary. In fact, that &lt;strong&gt;has to be&lt;/strong&gt; done if the scource code is to be saved using a normal file system. So, why not use the size in bytes of that (hypothetical) file as the score?&lt;/p&gt;&#xA;&lt;p&gt;Essentially, this &lt;strong&gt;puts the burden&lt;/strong&gt; of converting to bytes &lt;strong&gt;on the language compiler/interpreter&lt;/strong&gt;. The language can internally use smaller units, but those are then encoded into bytes, using any encoding chosen by the language designer.&lt;/p&gt;&#xA;&lt;p&gt;Keeping bytes as the measure of code length has advantages. It is a &lt;strong&gt;convenient&lt;/strong&gt; unit that &lt;strong&gt;everyone&lt;/strong&gt; understands. Scoring in arbitrary units would be confusing to people who don't know that unit.&lt;/p&gt;&#xA;&lt;p&gt;It could be argued that comparisons should only be done between answers in the same language. Strictly that's true. But one of the appeals of code golf is to be able to solve a moderately difficult task in few bytes in some obscure language. For newcomers, an answer title like (I'm making up the language names),&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Soil, 8 bytes&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;sounds &lt;strong&gt;impressive&lt;/strong&gt; (&lt;em&gt;How can this be done in so few bytes? What strange language is this? I want to know what this whole thing is about!&lt;/em&gt;)&lt;/p&gt;&#xA;&lt;p&gt;On the other hand. something like&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Luft, 35 trits&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Agua, 4 codels&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;doesn't mean anything for them, and is less motivating (&lt;em&gt;Huh, no idea what this is. Moving on&lt;/em&gt;). Former moderator Alex A. perhaps &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8179/36398&quot;&gt;explained it better&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="36398" LastEditorUserId="36398" LastEditDate="2023-04-18T17:48:12.080" LastActivityDate="2023-04-18T17:48:12.080" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25735" PostTypeId="2" ParentId="2140" CreationDate="2023-04-18T17:45:33.957" Score="5" Body="&lt;h2&gt;Meccano construct a 17-gon&lt;/h2&gt;&#xA;&lt;p&gt;I recently read an interesting manuscript: &lt;a href=&quot;https://webspace.science.uu.nl/%7Ehooft101/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Gerard ’t Hooft, &lt;em&gt;Meccano Math I&lt;/em&gt; (2006)&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I will summarize the key bits here and then present a bit of a challenge.&lt;/p&gt;&#xA;&lt;p&gt;Meccano bars are metal strips with holes in them at integer lengths. A bar of length &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; has &lt;span class=&quot;math-container&quot;&gt;\$n+1\$&lt;/span&gt; holes evenly spaced along it. Two bars may be attached at a two of their holes to form a joint.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/RvbR9.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/RvbR9.png&quot; alt=&quot;Simple joint with two bars&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;A configuration is rigid when there is exactly one way to connect the given bars at the specified holes. For example all triangles are rigid:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/DmSqB.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/DmSqB.png&quot; alt=&quot;Rigid triangle&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;However quadrilaterals are nearly universally non-rigid:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/cuCpB.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/cuCpB.png&quot; alt=&quot;Non-rigid quad&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;As the joints share a degree of freedom. All configurations with a degree of freedom are not rigid, however not all zero degrees of freedom configurations are rigid. For example&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;EXAMPLE HERE&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Your task is to produce a set of bars, along with their lengths and which holes are attached such that it forms a rigid construction, and 17 of the Meccano bars in your solution form the edges of a regular 17-gon.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Your score will be the number of Meccano bars used in your solution, with ties being broken by the sum of their lengths. Your goal is to minimize your score.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="110698" LastEditDate="2023-05-15T12:22:38.350" LastActivityDate="2023-05-15T12:22:38.350" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25737" PostTypeId="1" AcceptedAnswerId="25738" CreationDate="2023-04-19T09:48:43.767" Score="4" ViewCount="137" Body="&lt;p&gt;Please refer to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/20814/89459&quot;&gt;this challenge&lt;/a&gt; on Sandbox.&lt;/p&gt;&#xA;&lt;p&gt;The input is a black-box function, but as someone not knowing much of esolangs and golfing languages, I cannot even imagine how they accept black-box functions as input.&lt;/p&gt;&#xA;&lt;p&gt;I can generalize this situation like the following: Mathematically, the input domain is not a &lt;a href=&quot;https://en.wikipedia.org/wiki/Discrete_space&quot; rel=&quot;nofollow noreferrer&quot;&gt;discrete space&lt;/a&gt;. Examples, using topology terms:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The input is a function. In other words, the domain is a function space consisting of continuous functions, endowed with the &lt;a href=&quot;https://en.wikipedia.org/wiki/Compact-open_topology&quot; rel=&quot;nofollow noreferrer&quot;&gt;compact-open topology&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The input is an iterator with no guarantee of terminating. In this case, the domain is a &lt;a href=&quot;https://en.wikipedia.org/wiki/Compactification_(mathematics)&quot; rel=&quot;nofollow noreferrer&quot;&gt;compactification&lt;/a&gt; of a discrete space with infinitely many points, resulting in a non-discrete space.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;At worst, the input has no guarantee of halting when evaluated, and if it halts, the evaluation result is to be discarded. In this case, the domain is the &lt;a href=&quot;https://en.wikipedia.org/wiki/Sierpi%C5%84ski_space&quot; rel=&quot;nofollow noreferrer&quot;&gt;Sierpiński space&lt;/a&gt;, which is not &lt;a href=&quot;https://en.wikipedia.org/wiki/Hausdorff_space&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hausdorff&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;It already seems most esolangs cannot handle such inputs. For example, Brainfuck only handles user-inputted chars, and the space of strings is discrete.&lt;/p&gt;&#xA;&lt;p&gt;Do black-box functions inevitably prohibit a class of languages from participating, or is there a workaround?&lt;/p&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2023-04-19T12:21:29.060" LastActivityDate="2023-04-19T12:21:29.060" Title="How do esolangs participate in a challenge about black-box inputs?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ClosedDate="2023-04-21T12:24:19.300" ContentLicense="CC BY-SA 4.0" />
  <row Id="25738" PostTypeId="2" ParentId="25737" CreationDate="2023-04-19T10:37:13.503" Score="10" Body="&lt;h1&gt;It's not a issue if some languages can not participate in every challenge&lt;/h1&gt;&#xA;&lt;p&gt;There is a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8058/91213&quot;&gt;guideline not to exclude certain languages arbitrairly&lt;/a&gt; but if some language simply is unable to solve a challenge that is no reason not to pose the challenge.&lt;/p&gt;&#xA;&lt;p&gt;Also, many esolangs do have a way to input a black box function, eg. as a string to be &lt;code&gt;eval&lt;/code&gt;ed&lt;/p&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2023-04-19T10:37:13.503" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25739" PostTypeId="2" ParentId="2140" CreationDate="2023-04-20T07:40:47.883" Score="2" Body="&lt;h1&gt;Generate a random finite floating-point number&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge is to write a program or function that when invoked outputs a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-random-tooltip-container&quot;&gt;random&lt;/a&gt; IEEE &lt;code&gt;float32&lt;/code&gt; value.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any particular floating point value may not have more than a chance of &lt;code&gt;1&lt;/code&gt; in &lt;code&gt;1,000,000,000&lt;/code&gt; of being output. (There are &lt;code&gt;4,278,190,079&lt;/code&gt; possible different outputs so this should not be too onerous a restriction.)&lt;/li&gt;&#xA;&lt;li&gt;You may convert the &lt;code&gt;float32&lt;/code&gt; value to double precision or a reasonable string format, but e.g. &lt;code&gt;-0&lt;/code&gt; and &lt;code&gt;0.0&lt;/code&gt; count as the same float value, and JavaScript's &lt;code&gt;Math.random&lt;/code&gt; would not be acceptable as it can only generate a few million different &lt;code&gt;float32&lt;/code&gt; values - indeed the number of different values it generates that truncate to the same &lt;code&gt;float32&lt;/code&gt; value is greater than the number of different resulting &lt;code&gt;float32&lt;/code&gt; values.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2023-04-20T07:40:47.883" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25740" PostTypeId="2" ParentId="2140" CreationDate="2023-04-21T23:17:29.180" Score="0" Body="&lt;h1&gt;What is the shortest python code which implements a string-to-float function?&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Goal&lt;/h1&gt;&#xA;&lt;p&gt;Write the shortest variadic &lt;code&gt;to_float&lt;/code&gt;, &lt;code&gt;str2float&lt;/code&gt;, or standardizing function you can write subject to the constraint that the code is written in &lt;strong&gt;python&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Rules and Examples&lt;/h1&gt;&#xA;&lt;p&gt;The variadic &lt;code&gt;str2float&lt;/code&gt; shall be some callable which accepts any one of the following inputs:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Input Data-type&lt;/th&gt;&#xA;&lt;th&gt;Example Input&lt;/th&gt;&#xA;&lt;th&gt;Output float&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;string&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;&amp;quot;4.992&amp;quot;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;float &lt;code&gt;4.992&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;float s&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;4.992&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;float &lt;code&gt;4.992&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;int&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;9021&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;float &lt;code&gt;9021.0&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;a shallow iterable of strings&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;[&amp;quot;4&amp;quot;, &amp;quot;.&amp;quot;, &amp;quot;9&amp;quot;, &amp;quot;9&amp;quot;, &amp;quot;2&amp;quot;]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;float &lt;code&gt;4.992&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;a string with zeros padded on the right and/or white-space padding on left&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;&amp;quot;1234.650000\n&amp;quot;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;float &lt;code&gt;1234.65&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;a string with zeros padded on the left&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;&amp;quot;016&amp;quot;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;float &lt;code&gt;16.0&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;a deeply nested iterable of strigs&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;[[&amp;quot;4&amp;quot;, [[&amp;quot;.&amp;quot;, &amp;quot;9&amp;quot;]], (&amp;quot;9&amp;quot;, &amp;quot;2&amp;quot;)], (((((&amp;quot;1&amp;quot;)), &amp;quot;0&amp;quot;), &amp;quot;1&amp;quot;), &amp;quot;0&amp;quot;)]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;float &lt;code&gt;4.992101&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;a deeply nested iterable of a mix of floats, int, and strings&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;[[4.0, [[&amp;quot;.&amp;quot;, 9]], (9, &amp;quot;2&amp;quot;)], ((((&amp;quot;1&amp;quot;)), &amp;quot;0&amp;quot;), &amp;quot;10&amp;quot;)]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;float &lt;code&gt;4.992101&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;The main assumptions about the variadic &lt;code&gt;*args&lt;/code&gt; parameter are that there is a correctly-working method named &lt;code&gt;__iter__&lt;/code&gt; defined and that if you recursively search until &lt;code&gt;isinstance(obj, str)&lt;/code&gt; returns &lt;code&gt;True&lt;/code&gt; or &lt;code&gt;not hasattr('__iter__', obj)&lt;/code&gt;, then the object which is not a string has a &lt;code&gt;__repr__&lt;/code&gt; method which returns a string representation of a decimal point, integer, or floating point number.&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;The scoring will be something in between code-golf and popularity contest:&lt;/p&gt;&#xA;&lt;p&gt;Score = &lt;code&gt;(upvotes - downvotes) - floor((bytes in code that outputs question) / 3)&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;The highest score wins.&lt;/p&gt;&#xA;&lt;p&gt;(You can use &lt;a href=&quot;http://mothereff.in/byte-counter&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://mothereff.in/byte-counter&lt;/a&gt; as a byte counter.)&lt;/p&gt;&#xA;" OwnerUserId="107601" LastActivityDate="2023-04-21T23:17:29.180" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25741" PostTypeId="2" ParentId="2140" CreationDate="2023-04-22T11:17:32.387" Score="1" Body="&lt;h1&gt;Single Transferable Vote (Ranked Choice Vote)&lt;/h1&gt;&#xA;&lt;p&gt;Single transferable vote is a algorithm for selecting the best N candidates from a set of ranked choice votes. It works like this:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Every voter must rank every candidate, first to last&lt;/li&gt;&#xA;&lt;li&gt;Let the voting threshold be the number of voters divided by the number of available positions&lt;/li&gt;&#xA;&lt;li&gt;While less than N candidates have been elected:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the candidate with the most #1 votes has more votes than the threshold, elect them. Then remove that candidate from every voters ballot.&lt;/li&gt;&#xA;&lt;li&gt;If no candidate has enough votes to be elected, eliminate the candidate with the lowest number of votes choosing them as #1. Remove this candidate from every ballot. In case of a tie tiebreaker is how often they are ranked #2, then #3 etc.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Given a list of votes, the number of open positions, and optionally a list of candidates, output which candidates get elected. Order doesn't matter.&lt;/p&gt;&#xA;&lt;p&gt;You do not need to implement the algorithm above exactly as long as the result is the same.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Positions: 2&#xA;Votes: [1,2,3]&#xA;       [2,3,1]&#xA;       [3,2,1]&#xA;Outcome: 2, 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;More test cases TBD&lt;/p&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2023-04-22T11:17:32.387" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25742" PostTypeId="2" ParentId="25716" CreationDate="2023-04-22T13:59:30.153" Score="-1" Body="&lt;h1&gt;Different languages don't need to compete against each other&lt;/h1&gt;&#xA;&lt;p&gt;Most &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; challenges state that the winner is the shortest code &lt;em&gt;per language&lt;/em&gt;. It doesn't really make sense to compare a submission in Piet to a submission in Vyxal because they use different scoring systems. I think that as long as the scoring system for a given submission is consistent among all submissions in that language, I don't see why submissions would be scored using a system that inaccurately represents how large the program actually is.&lt;/p&gt;&#xA;&lt;p&gt;I think some of us are forgetting that the point of code golf is to have the least amount of code possible to solve a problem, and are getting too caught up on how to define &amp;quot;the least amount of code.&amp;quot; It doesn't matter! Submissions in languages where it doesn't make sense to score in bytes shouldn't worry about byte count because it's inaccurate to their size.&lt;/p&gt;&#xA;&lt;p&gt;As long as all submissions of a given language use the same scoring system, they should be allowed to score in whatever units they want.&lt;/p&gt;&#xA;" OwnerUserId="108687" LastActivityDate="2023-04-22T13:59:30.153" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25743" PostTypeId="2" ParentId="2140" CreationDate="2023-04-24T14:39:34.793" Score="1" Body="&lt;h1&gt;Countdown solver&lt;/h1&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;An array of up to 6 integers, value 1..100, and a target integer 1..999&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;A series of mathematical operations (in any sensible format), using each of the integers in the input array 0..1 times, and the mathematical operators &lt;code&gt;+-*/&lt;/code&gt; any number of times, to reach the target integer.&lt;/p&gt;&#xA;&lt;p&gt;Intermediate operations may result in floats (e.g. &lt;code&gt;(3/2) * 4 = 6&lt;/code&gt;), and there is no guarantee that the target is reachable at all (in which case the output is undefined). The input integers may not be concatenated (e.g. &lt;code&gt;1, 2&lt;/code&gt; can't be used as &lt;code&gt;12&lt;/code&gt;)&lt;/p&gt;&#xA;&lt;h2&gt;Win criteria&lt;/h2&gt;&#xA;&lt;p&gt;Code golf, usual exclusions apply.&lt;/p&gt;&#xA;" OwnerUserId="62289" LastEditorUserId="62289" LastEditDate="2023-04-25T20:34:31.040" LastActivityDate="2023-04-25T20:34:31.040" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25744" PostTypeId="2" ParentId="2140" CreationDate="2023-04-24T15:46:53.457" Score="1" Body="&lt;h1&gt;Langton's Ant&lt;/h1&gt;&#xA;&lt;p&gt;Langton's ant is a simple two-dimensional universal Turing machine. From &lt;a href=&quot;https://en.wikipedia.org/wiki/Langton%27s_ant&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Squares on a plane are colored variously either black or white. We arbitrarily identify one square as the &amp;quot;ant&amp;quot;. The ant can travel in any of the four cardinal directions at each step it takes. The &amp;quot;ant&amp;quot; moves according to the rules below:&lt;/p&gt;&#xA;&lt;p&gt;At a white square, turn 90° clockwise, flip the color of the square, move forward one unit&lt;/p&gt;&#xA;&lt;p&gt;At a black square, turn 90° counter-clockwise, flip the color of the square, move forward one unit&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;In this challenge, you will be given three inputs:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A 2D square grid &lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt; of two distinct symbols, where one represents a black cell and the other represents a white cell&lt;/li&gt;&#xA;&lt;li&gt;A coordinate &lt;span class=&quot;math-container&quot;&gt;\$(x,y)\$&lt;/span&gt; representing the location on the grid where the ant starts&lt;/li&gt;&#xA;&lt;li&gt;A number of steps &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Your code should then return the grid after the ant starting at &lt;span class=&quot;math-container&quot;&gt;\$(x,y)\$&lt;/span&gt; and &lt;em&gt;facing upwards&lt;/em&gt;, completes &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; steps.&lt;/p&gt;&#xA;&lt;p&gt;You can use any reasonable form of indexing to describe the intial location of the ant on the grid (e.g. 0-based or 1-based).&lt;/p&gt;&#xA;&lt;p&gt;You can assume that the ant will not attempt to go off the side of the grid at any point during the given steps.&lt;/p&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;p&gt;For these tests, I will assume that &lt;span class=&quot;math-container&quot;&gt;\$(0,0)\$&lt;/span&gt; is the top-left corner of the board. I will also use &lt;code&gt;0&lt;/code&gt; to represent a white cell and &lt;code&gt;1&lt;/code&gt; to represent a black cell.&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;&lt;span class=&quot;math-container&quot;&gt;\$G\$&lt;/span&gt;&lt;/th&gt;&#xA;&lt;th&gt;&lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;&lt;/th&gt;&#xA;&lt;th&gt;&lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt;&lt;/th&gt;&#xA;&lt;th&gt;&lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;&lt;/th&gt;&#xA;&lt;th&gt;Result&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;[[0]]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;[[0]]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;[[1]]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;[[1]]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;[[0,0],[0,0]]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;[[0,0],[1,0]]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;[[0,0],[0,0]]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;[[1,0],[1,0]]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;[[0,0],[0,0]]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;0&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;[[1,1],[1,0]]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;[[0,0,0],[0,0,0],[0,0,0]]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;7&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;[[0,1,1],[0,0,1],[1,1,0]]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;Standard loopholes are forbidden. Since this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, shortest code wins.&lt;/p&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2023-05-01T14:01:49.883" LastActivityDate="2023-05-01T14:01:49.883" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25745" PostTypeId="2" ParentId="6918" CreationDate="2023-04-24T16:03:28.740" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/bbrk24/Trilangle&quot; rel=&quot;nofollow noreferrer&quot;&gt;Trilangle&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Trilangle is a 2-D esolang that I made in February 2023. Though not designed as a golflang, it ends up being fairly competitive in certain challenges.&lt;/p&gt;&#xA;&lt;p&gt;It was originally inspired by Hexagony, though it came to be rather different. The biggest differences include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Though the code grid is still hexagonal, its bounding box is triangular.&lt;/li&gt;&#xA;&lt;li&gt;The memory model is a stack rather than a grid.&lt;/li&gt;&#xA;&lt;li&gt;Certain letters and numbers are operations, expanding the instruction set but necessitating a separate &amp;quot;push&amp;quot; instruction.&lt;/li&gt;&#xA;&lt;li&gt;When the IP walks off the edge of the code grid, it continues on the row or diagonal to its left, rather than on the opposite side of the grid.&lt;/li&gt;&#xA;&lt;li&gt;Instead of bigints, the program operates on 24-bit integers.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The fact that it's a stack, and you can only modify the top of the stack, made Turing completeness difficult. See &lt;a href=&quot;https://github.com/bbrk24/Trilangle/blob/1b54ffdde92fb162108869b7a089e669c184cecf/turing_completeness.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;the old proof of TC'ness&lt;/a&gt; from Trilangle 1.0. The modern version looks rather different, since the threading operator means you can have multiple stacks. Though I haven't needed this for code golf yet, I use this in &lt;a href=&quot;https://github.com/bbrk24/miscellany/blob/master/sortingAlgorithm.trg&quot; rel=&quot;nofollow noreferrer&quot;&gt;my implementation of selection sort&lt;/a&gt; (colorized version &lt;a href=&quot;https://i.stack.imgur.com/and34.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt;).&lt;/p&gt;&#xA;&lt;p&gt;String processing is a downright pain, though that's not entirely unintentional. Hello, World ends up being a somewhat longer program:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;        &amp;quot;&#xA;       H o&#xA;      o &amp;quot; !&#xA;     &amp;quot; o ( o&#xA;    e o o o l&#xA;   o &amp;quot; &amp;quot; &amp;quot; o &amp;quot;&#xA;  &amp;quot; , W r &amp;quot; ! 3&#xA; l o o o d o : o&#xA;o &amp;quot; &amp;quot; &amp;quot; o ' ( @ .&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Or, condensed (newlines, spaces, and trailing NOPs removed):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;Hoo&amp;quot;!&amp;quot;o(oeooolo&amp;quot;&amp;quot;&amp;quot;o&amp;quot;&amp;quot;,Wr&amp;quot;!3looodo:oo&amp;quot;&amp;quot;&amp;quot;o'(@&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;To help me design and debug these programs, I've invented an assembly-like syntax for these programs. It represents 2D branches and loops with &lt;code&gt;BNG&lt;/code&gt; (branch if negative) and &lt;code&gt;JMP&lt;/code&gt; (jump) instructions. For example, the (2-D) source code and assembly for cat are as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    #&#xA;   @ .&#xA;  . L \&#xA; v i o .&#xA;. _ \ , .&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;0:  NOP&#xA;1:  NOP&#xA;2:  NOP&#xA;3:  NOP&#xA;4:  GTC&#xA;5:  BNG 12&#xA;6:  NOP&#xA;7:  PTC&#xA;8:  NOP&#xA;9:  POP&#xA;10: NOP&#xA;11: JMP 2&#xA;12: EXT&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Of course, this contains a lot of extraneous NOPs. Any instruction that unconditionally redirects the IP is represented with &lt;code&gt;NOP&lt;/code&gt; by the disassembler, so there's a flag to hide NOPs (&lt;code&gt;-n&lt;/code&gt; on the CLI; always on in &lt;a href=&quot;https://bbrk24.github.io/Trilangle/&quot; rel=&quot;nofollow noreferrer&quot;&gt;the online interpreter&lt;/a&gt;). With that flag set, the assembly just becomes:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;4:  GTC&#xA;5:  BNG 12&#xA;7:  PTC&#xA;9:  POP&#xA;11: JMP 2&#xA;12: EXT&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;code&gt;GTC&lt;/code&gt; and &lt;code&gt;PTC&lt;/code&gt; stand for &amp;quot;getchar&amp;quot; and &amp;quot;putchar&amp;quot; respectively -- though they behave more like C's &lt;code&gt;getwchar&lt;/code&gt; and &lt;code&gt;putwchar&lt;/code&gt;, using UTF-32.&lt;/p&gt;&#xA;&lt;p&gt;For the most part, the instruction set contains a lot of what you'd expect for an integer-only stack-based language -- arithmetic, bitwise operations, branch on sign, and I/O -- but it also contains a few interesting choices. For example, &lt;code&gt;T&lt;/code&gt; (get current time) uses a unit of 1/97 second*, so that the full day spans from 0 at midnight to 0x7fffff right before midnight. The threading operator is also &lt;a href=&quot;https://github.com/bbrk24/Trilangle#threading&quot; rel=&quot;nofollow noreferrer&quot;&gt;heavily overloaded&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Finally, just for fun: here's a program that doesn't halt on weekends.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    &amp;lt;&#xA;   ' D&#xA;  ' - 2&#xA; 2 ' % 7&#xA;@ &amp;gt; { # -&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;*More accurately, there are 97.0903588 time units to the second.&lt;/p&gt;&#xA;" OwnerUserId="106545" LastEditorUserId="106545" LastEditDate="2023-04-29T00:23:58.480" LastActivityDate="2023-04-29T00:23:58.480" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25746" PostTypeId="2" ParentId="2140" CreationDate="2023-04-25T13:38:19.503" Score="0" Body="&lt;h1&gt;I'm Lost!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/radiation-hardening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-radiation-hardening-tooltip-container&quot;&gt;radiation-hardening&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr/&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://esolangs.org/wiki/Lost&quot; rel=&quot;nofollow noreferrer&quot;&gt;Lost&lt;/a&gt; is a 2d esolang where the instruction pointer starts at a random location. In this challenge, we'll replicate that for every language.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to write a program, which can be shifted any number of characters (these will be moved from the start to the end), and will still work. The program should print the string &lt;code&gt;Which way is &lt;/code&gt;, followed any consistent string of your choice which is at least four characters, and a question mark.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Say my program is:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;import print&#xA;&#xA;print(&amp;quot;Which way is Boston?&amp;quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;What actually gets run might be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;port print&#xA;&#xA;print(&amp;quot;Which way is Boston?&amp;quot;)im&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(assuming there's no trailing newline)&lt;/p&gt;&#xA;&lt;p&gt;Or:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&#xA;print(&amp;quot;Which way is Boston?&amp;quot;)import print&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Or:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ay is Boston?&amp;quot;)import print&#xA;&#xA;print(&amp;quot;Which w&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;All of these must print the same, correct string.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Sandbox:&lt;/strong&gt; I'm considering making the challenge to print how many characters your program was shifted by, but I'm worried that'd be impossible&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2023-04-25T13:38:19.503" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25747" PostTypeId="2" ParentId="2140" CreationDate="2023-04-25T15:17:09.700" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/260492/get-all-urls-on-an-html-webpage&quot;&gt;Get all URLs on an HTML webpage&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-parsing-tooltip-container&quot;&gt;parsing&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/internet&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;internet&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-internet-tooltip-container&quot;&gt;internet&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2023-04-27T13:43:03.793" LastActivityDate="2023-04-27T13:43:03.793" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25750" PostTypeId="2" ParentId="2140" CreationDate="2023-04-27T15:13:38.237" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/261433/91213&quot;&gt;Adjacent Items Sorting&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-05-31T13:38:43.333" LastActivityDate="2023-05-31T13:38:43.333" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25751" PostTypeId="2" ParentId="2140" CreationDate="2023-04-28T15:26:28.493" Score="1" Body="&lt;h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/260646/sanitize-the-spaces&quot;&gt;Sanitize the Spaces&lt;/a&gt;&lt;/h1&gt;&lt;/p&gt;&#xA;" OwnerUserId="116741" LastEditorUserId="116741" LastEditDate="2023-05-03T01:00:30.190" LastActivityDate="2023-05-03T01:00:30.190" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25753" PostTypeId="2" ParentId="2140" CreationDate="2023-04-30T22:31:40.283" Score="0" Body="&lt;h1&gt;Compute Pi using pure arithmetic &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-fastest-code-tooltip-container&quot;&gt;fastest-code&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-restricted-source-tooltip-container&quot;&gt;restricted-source&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-python-tooltip-container&quot;&gt;python&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/pi&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;pi&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;pi&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-pi-tooltip-container&quot;&gt;pi&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;This is a sequel to the challenge &lt;em&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/170398/primality-testing-formula&quot;&gt;Primality testing formula&lt;/a&gt;&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Given a positive integer &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; as input, write a &lt;strong&gt;&lt;a href=&quot;https://docs.python.org/3/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Python 3&lt;/a&gt;&lt;/strong&gt; function or program that outputs the first &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; digits of Pi as an &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt;-digit decimal integer using &lt;strong&gt;pure arithmetic&lt;/strong&gt;. This means that your source code can only contain:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;operators &lt;code&gt;=, +, -, *, **, //, %, &amp;lt;&amp;lt;, &amp;gt;&amp;gt;, &amp;amp;, |, ^, ~, &amp;lt;, &amp;gt;, &amp;lt;=, &amp;gt;=, ==, !=&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;variables&lt;/li&gt;&#xA;&lt;li&gt;integer constants&lt;/li&gt;&#xA;&lt;li&gt;parentheses &lt;code&gt;()&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;semi-colons/newlines (to separate statements)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Unlike with the other challenge, you &lt;em&gt;may&lt;/em&gt; use &lt;code&gt;=&lt;/code&gt; if it helps speed up or simplify your code. However you may not use loops, built-ins, or anything else that's not stated above. Yes, it's possible.&lt;/p&gt;&#xA;&lt;h3&gt;Scoring&lt;/h3&gt;&#xA;&lt;p&gt;The winning criterion for this challenge is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-fastest-code-tooltip-container&quot;&gt;fastest-code&lt;/a&gt;. You will be scored on the highest &lt;span class=&quot;math-container&quot;&gt;\$ n = 10^b \$&lt;/span&gt; your code can compute in one minute. The time taken for that run will be used to break ties.&lt;/p&gt;&#xA;&lt;p&gt;Hardcoding to prioritize certain test cases is not allowed, and the code must work in theory for all positive values of &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;  n | output&#xA;----+--------&#xA;  1 | 3&#xA; 10 | 3141592653&#xA;100 | 3141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342117067&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="88546" LastActivityDate="2023-04-30T22:31:40.283" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25754" PostTypeId="2" ParentId="2140" CreationDate="2023-05-02T19:43:57.067" Score="2" Body="&lt;h1&gt;Find the Geometric Mean of a set of Numbers&lt;/h1&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;There isn't a geometric mean challenge here yet so I decided to post one.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Calculate the geometric mean of a set of numbers without using a built in function for it because that's &lt;em&gt;boring&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot;&gt;See here&lt;/a&gt; for input and output methods.&lt;/li&gt;&#xA;&lt;li&gt;Input should be some sort of set of numbers (either as a list/array passed to a function or a list/array built by the program from user inputs).&lt;/li&gt;&#xA;&lt;li&gt;You do not need to cope with negative numbers.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The winner will be determined by the shortest (functional) code length in bytes, in the case of 2 answers having the same number of bytes then the winner will be determined by score.&lt;/p&gt;&#xA;&lt;h2&gt;Example Input and Output&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Input&lt;/th&gt;&#xA;&lt;th&gt;Output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;[2,2,2]&lt;/td&gt;&#xA;&lt;td&gt;2.00 or 2&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;[1,2,3]&lt;/td&gt;&#xA;&lt;td&gt;1.82&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;[0,5,4,7]&lt;/td&gt;&#xA;&lt;td&gt;0.00 or 0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;[8,5,4,7]&lt;/td&gt;&#xA;&lt;td&gt;0.79&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;[1.7,2,0.3]&lt;/td&gt;&#xA;&lt;td&gt;1.00 or 1&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;[3,8]&lt;/td&gt;&#xA;&lt;td&gt;4.9 or 4.90&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;[12,21]&lt;/td&gt;&#xA;&lt;td&gt;15.87&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;[0.5]&lt;/td&gt;&#xA;&lt;td&gt;0.5, or 0.50&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;[3,9,2,5,7]&lt;/td&gt;&#xA;&lt;td&gt;4.52&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;h3&gt;Ungolfed &lt;a href=&quot;https://www.desmos.com/calculator/ys0cogwkdo&quot; rel=&quot;nofollow noreferrer&quot;&gt;Desmos&lt;/a&gt; example program:&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;f\left(l\right)=\sqrt[\operatorname{length}\left(l\right)]{\prod_{i=1}^{\operatorname{length}\left(l\right)}l\left[i\right]}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="111514" LastActivityDate="2023-05-02T19:43:57.067" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25755" PostTypeId="1" CreationDate="2023-05-03T16:19:16.560" Score="-22" ViewCount="292" Body="&lt;p&gt;As you all know, advertising is an important source of revenue for Stack Overflow and it helps us support all the sites across the Stack Exchange Network and the resources that go into maintaining and improving the experience on the platform. We are going to be introducing middle sidebar ads, which have been on the main Stack Overflow site for years, to some of the tech sites including Code Golf.&lt;/p&gt;&#xA;&lt;p&gt;The middle sidebar ads have the same standards as any other ads on the platform. Ads are non-intrusive and static. Ads go through a vetting process to ensure they are appropriate for the communities on Stack Exchange. If you see an ad that may not follow our established standards and guidelines, you can let us know by using the &amp;quot;&lt;strong&gt;report this ad&lt;/strong&gt;&amp;quot; functionality. Here is a mockup of what these will look like when two ads are showed (the existing ad placement and the new middle sidebar ad placement):&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/CPaWM.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/CPaWM.jpg&quot; alt=&quot;sample of ads on the middle side bar of the site&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="101081" LastActivityDate="2023-05-05T19:13:37.717" Title="Middle Sidebar Advertising" Tags="|discussion|advertising|announcement|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25756" PostTypeId="2" ParentId="25755" CreationDate="2023-05-03T18:42:12.333" Score="26" Body="&lt;p&gt;It's slightly disappointing that Stack Exchange feels the need to extend their advertising to sites that, frankly, don't have anywhere near the reach or audience that Stack Overflow does. I question whether this will actually generate significant income in the first place, but if the company believes it necessary, then I suppose we have to accept. In fact, in and of themselves, I don't really have a problem with one additional extra ad per page, if it helps the company.&lt;/p&gt;&#xA;&lt;p&gt;However, what &lt;em&gt;really&lt;/em&gt; disappoints me is that this feels like yet another blow for &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/23537/66833&quot;&gt;Community Ads&lt;/a&gt;. As I said almost 2 years ago,&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I like Community Ads, they're probably one of the few systems of advertising I support&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;sup&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/23537/community-ads-for-2021#comment74541_23537&quot;&gt;source&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;and I still stand by that today. Further, the &lt;a href=&quot;https://meta.stackexchange.com/q/364556/355458&quot;&gt;most recent update&lt;/a&gt; to Community Ads was &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/23537/community-ads-for-2021#comment74541_23537&quot;&gt;incredibly unpopular on our site&lt;/a&gt;, there haven't been any new updates on these ads for &lt;em&gt;2 years&lt;/em&gt;, and now we're being told - not even asked, but &lt;em&gt;told&lt;/em&gt; - that we're getting more ads from corporations instead of any kind of prioritisation of our own Community Ads. Overall, I don't expect this to be a popular announcement.&lt;/p&gt;&#xA;&lt;p&gt;At the very least, please start allowing us to promote things we want alongside these adverts.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;For full transparency, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/101081/rosie&quot;&gt;Rosie&lt;/a&gt; &lt;em&gt;has&lt;/em&gt; clarified on &lt;a href=&quot;https://retrocomputing.meta.stackexchange.com/a/1200/22796&quot;&gt;the future of Community Ads&lt;/a&gt; over on Retrocomputing.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2023-05-05T19:13:37.717" LastActivityDate="2023-05-05T19:13:37.717" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25758" PostTypeId="1" AcceptedAnswerId="25763" CreationDate="2023-05-04T17:58:04.160" Score="13" ViewCount="439" Body="&lt;p&gt;As stated on &lt;a href=&quot;https://meta.stackexchange.com/questions/388556/imgur-tos-change-on-may-15th-2023-could-cause-the-loss-of-thousands-of-stack-exc&quot;&gt;Mother Meta&lt;/a&gt;, all imgur images not associated with a account or the &lt;code&gt;stack.imgur.com&lt;/code&gt; official corporate instance will be deleted on May 15th.&lt;/p&gt;&#xA;&lt;p&gt;If we don't replace those links before that date, they will be permanently lost. Some questions and answers may lose unessential fluff, but many will become impossible to understand.&lt;/p&gt;&#xA;&lt;p&gt;Lucky for us, Glorfindel has already copied some links to the stack.imgur.com domain so all we need to do is edit the posts and replace the links with those given in this document (see also &lt;a href=&quot;https://meta.stackexchange.com/a/388726/371052&quot;&gt;this answer&lt;/a&gt; for more explanation):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://raw.githubusercontent.com/Glorfindel83/SE-Userscripts/master/upload-imgur-images.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;List of replacement links for images that are properly backed up&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25765/91213&quot;&gt;List of images not backed up because they were too big, fix these urgently&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1747560/imgur-links-that-are-about-to-go-down&quot; rel=&quot;nofollow noreferrer&quot;&gt;List of posts with broken images&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Our most important task is to back up images that Glorfindel's script missed, usually because they were above the 2 MB limit. These are those images:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25765/91213&quot;&gt;https://codegolf.meta.stackexchange.com/a/25765/91213&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Unfortunately the script doesn't record what post these came from so you just need to search.&lt;/p&gt;&#xA;&lt;h2&gt;Some examples of discussion in other communities:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://android.meta.stackexchange.com/q/2724&quot;&gt;https://android.meta.stackexchange.com/q/2724&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://anime.meta.stackexchange.com/q/4589&quot;&gt;https://anime.meta.stackexchange.com/q/4589&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://gaming.meta.stackexchange.com/q/16762&quot;&gt;https://gaming.meta.stackexchange.com/q/16762&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://apple.meta.stackexchange.com/q/4206&quot;&gt;https://apple.meta.stackexchange.com/q/4206&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://meta.askubuntu.com/q/20303&quot;&gt;https://meta.askubuntu.com/q/20303&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://meta.stackexchange.com/a/388724/371052&quot;&gt;More&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I've already started, mostly because I initially had the wrong query and thought that there were only 17 posts that needed replacing but turns out there are a lot more. I apologize, given the actual number I should have asked on meta first.&lt;/p&gt;&#xA;&lt;p&gt;There are about 200 images more to go. What should be done with the rest of them?&lt;/p&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="39490" LastEditDate="2023-06-08T13:52:20.450" LastActivityDate="2023-06-08T13:52:20.450" Title="I'm in the process of replacing all anonymous imgur images with stack.imgur images, and I need your help" Tags="|discussion|editing|" AnswerCount="2" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25759" PostTypeId="2" ParentId="2140" CreationDate="2023-05-06T23:48:40.273" Score="2" Body="&lt;h1&gt;Sort int64 with float64 values&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge is to create the following total ordering of int64 and float64 values:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Apart from &lt;code&gt;-0.0&lt;/code&gt; which sorts before &lt;code&gt;0.0&lt;/code&gt;, two values of the same type sort according to which one is less than the other.&lt;/li&gt;&#xA;&lt;li&gt;Where two values of different types are exactly equal, the float64 sorts before the int64 if negative or after if positive. Note that &lt;code&gt;-0.0&lt;/code&gt; counts as a negative float64 and &lt;code&gt;0.0&lt;/code&gt; counts as a positive float64, and the int64 &lt;code&gt;0&lt;/code&gt; compares between the two.&lt;/li&gt;&#xA;&lt;li&gt;int64 values that fall between the representations of two float64 values must sort between those two values. Similarly, float64 values that have fractional parts must sort between the nearest two integer values, although the previous rule allows you to simply truncate the float64 value towards zero to compare it to an int64 value.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Here are some int64 and float64 values in the correct order:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;-9223372036854775808.0&#xA;-9223372036854775808&#xA;-9223372036854775807&#xA;-9223372036854774786&#xA;-9223372036854774785&#xA;-9223372036854774784.0&#xA;-9223372036854774784&#xA;-9223372036854774783&#xA;-9007199254740994.0&#xA;-9007199254740994&#xA;-9007199254740993&#xA;-9007199254740992.0&#xA;-9007199254740992&#xA;-4503599627370496.0&#xA;-4503599627370496&#xA;-4503599627370495.5&#xA;-4503599627370495.0&#xA;-4503599627370495&#xA;-4503599627370494.5&#xA;-1.5&#xA;-1.0&#xA;-1&#xA;-0.5&#xA;-0.0&#xA;0&#xA;0.0&#xA;0.5&#xA;1&#xA;1.0&#xA;1.5&#xA;4503599627370494.5&#xA;4503599627370495&#xA;4503599627370495.0&#xA;4503599627370495.5&#xA;4503599627370496&#xA;4503599627370496.0&#xA;9007199254740992&#xA;9007199254740992.0&#xA;9007199254740993&#xA;9007199254740994&#xA;9007199254740994.0&#xA;9223372036854774783&#xA;9223372036854774784&#xA;9223372036854774784.0&#xA;9223372036854774785&#xA;9223372036854774786&#xA;9223372036854775807&#xA;9223372036854775808.0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your code can either implement a sort function for a list of elements or it can be a comparator for use with your language's built-in sort function or some other suitable way of indicating the sort ordering.&lt;/p&gt;&#xA;&lt;p&gt;You can earn brownie points for supporting nonfinite float64 values and arbitrary precision integers.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2023-05-06T23:48:40.273" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25761" PostTypeId="2" ParentId="2140" CreationDate="2023-05-07T19:43:28.823" Score="1" Body="&lt;h1&gt;A Graphical Degree Sequence?&lt;/h1&gt;&#xA;&lt;p&gt;Write the shortest program to determine if a degree sequence is graphical.&lt;/p&gt;&#xA;&lt;p&gt;Given a sequence of numbers &lt;code&gt;S&lt;/code&gt;, output a Boolean value representing whether or not a graph with &lt;code&gt;S&lt;/code&gt; as its degree sequence exists.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://en.wikipedia.org/wiki/Degree_(graph_theory)#Degree_sequence&quot; rel=&quot;nofollow noreferrer&quot;&gt;degree sequence&lt;/a&gt; of a graph is a sequence representing the degrees of each of its vertices. The degree of a vertex is the number of edges connected to it. Generally the degree sequence is given in non-increasing order, but for this challenge, it may be specified in any order. This means that graphs may have multiple degree sequences.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The following graph has a degree sequence of &lt;code&gt;[4, 3, 2, 1, 1, 1]&lt;/code&gt; or any of its reorderings.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/eIDPL.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/eIDPL.png&quot; alt=&quot;A Graph&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Some degree sequences like &lt;code&gt;[3, 3, 3, 2]&lt;/code&gt; are impossible. If you try to draw such a graph, it becomes clear why.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test cases&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[4, 3, 2, 1, 1, 1] -&amp;gt; True&#xA;[3, 3, 3, 2] -&amp;gt; False&#xA;[] -&amp;gt; True&#xA;[5, 5, 5, 5, 5, 5] -&amp;gt; True&#xA;[4, 4, 2, 4] -&amp;gt; False&#xA;[1, 2, 3, 2, 1, 4, 2] -&amp;gt; False&#xA;[3, 4, 4, 3, 3, 3, 4] -&amp;gt; True&#xA;[3, 0, 2, 1, 4, 2] -&amp;gt; True&#xA;[0, 0, 0] -&amp;gt; True&#xA;[2, 1, 2, 2, 2, 0, 2, 6] -&amp;gt; False&#xA;[2, 4, 2, 2, 2] -&amp;gt; True&#xA;[4, 4, 3, 2, 4] -&amp;gt; False&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="104633" LastActivityDate="2023-05-07T19:43:28.823" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25762" PostTypeId="2" ParentId="2140" CreationDate="2023-05-08T13:20:45.140" Score="3" Body="&lt;h1&gt;Complex remainder&lt;/h1&gt;&#xA;&lt;p&gt;Complex remainder can be defined in a similar way to real remainder as &lt;span class=&quot;math-container&quot;&gt;\$ y - x \lfloor \frac y x \rfloor \$&lt;/span&gt;. However this depends on a suitable complex floor function. There are a number of ways of defining a complex floor function (for at least one of which there has been a previous challenge), but for this challenge I will relax the requirements to the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Every complex number has exactly one floor which is a Gaussian integer.&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ \lfloor z \rfloor = \lfloor \Re ( z ) \rfloor \$&lt;/span&gt; if &lt;span class=&quot;math-container&quot;&gt;\$ \Im (z) = 0 \$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$ \lfloor z + n \rfloor = \lfloor z \rfloor + n \$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; is a Gaussian integer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Note that this implies that &lt;span class=&quot;math-container&quot;&gt;\$ \lfloor n \rfloor = n \$&lt;/span&gt; for every Gaussian integer &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Please write a program or function that will perform complex remainder using a compatible definition.&lt;/p&gt;&#xA;&lt;p&gt;Even if your language supports complex numbers you can choose to input them as separate real and imaginary parts. You can also choose to support only Gaussian integers as inputs and outputs.&lt;/p&gt;&#xA;&lt;p&gt;If your language has suitable builtins for remainder or floor then you can earn extra brownie points by providing an additional solution that doesn't use them.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest program that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2023-05-08T14:06:53.093" LastActivityDate="2023-05-08T14:06:53.093" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="25763" PostTypeId="2" ParentId="25758" CreationDate="2023-05-08T19:11:51.553" Score="7" Body="&lt;h2&gt;This sounds like a great idea!&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25664/66833&quot;&gt;Per the guidelines on mass edits&lt;/a&gt;, I would ask that people limit themselves to between 5 and 10 edits at a time, depending on how busy &lt;code&gt;/active&lt;/code&gt; and the front pages are. Further, while certainly not a &lt;em&gt;requirement&lt;/em&gt;, I'd encourage people to take this opportunity to also answer some older challenges ;)&lt;/p&gt;&#xA;&lt;p&gt;As for &lt;em&gt;how&lt;/em&gt; to do this:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If you have 2000 reputation or more, then feel free to find some of these posts that need replacing, and edit in the updated links for the images at a reasonable rate&lt;/li&gt;&#xA;&lt;li&gt;If you have less than 2000 reputation, again, feel free to do the same. Note however, that your edits will require approval by a user with 2000 or more reputation in the &lt;a href=&quot;https://codegolf.stackexchange.com/review/suggested-edits&quot;&gt;Suggested Edits review queue&lt;/a&gt;. This means that it may take a bit of time for your edits to go through, and you can only have 5 pending edits. Additionally, while I'm sure multiple people would like more edit reviews, not swamping the review queue is more important, so be extra judicial with how many suggested edits you are submitting in a short period of time&lt;/li&gt;&#xA;&lt;li&gt;The images linked in the table in the question might require more effort, such as downsizing or lowering their quality, but should be, as pointed out, of a higher priority for those able to do so&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://data.stackexchange.com/codegolf/query/1749225?data=tamRnBj.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;This&lt;/a&gt; is a SEDE query that, given a substring, will find all posts with that substring. Notably, SEDE checks against the raw HTML of each post, so links will be found, unlike in normal SE search.&lt;/p&gt;&#xA;&lt;p&gt;I'd also advising leaving a helpful edit summary when doing these updates. Personally, I've gone with&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;code&gt;updated image, see meta q 25758&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;to point reviewers back to this discussion&lt;/p&gt;&#xA;&lt;p&gt;Other than that, I encourage you all to get some edits in when you have a bit of free time on the site!&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2023-05-08T19:11:51.553" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25764" PostTypeId="2" ParentId="2140" CreationDate="2023-05-09T06:27:32.660" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/260804/110698&quot;&gt;Evaluate Minkowski's question mark function at rational numbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110698" LastEditorUserId="110698" LastEditDate="2023-05-09T18:04:24.517" LastActivityDate="2023-05-09T18:04:24.517" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25765" PostTypeId="2" ParentId="25758" CreationDate="2023-05-09T07:45:49.163" Score="4" Body="&lt;h2&gt;List of images that are not backed up and need replacing more urgently&lt;/h2&gt;&#xA;&lt;p&gt;Copies this from the post to community wiki it. You can cross out a post if you have finished replacing it.&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;Frequency&lt;/th&gt;&#xA;&lt;th&gt;URL&lt;/th&gt;&#xA;&lt;th&gt;Failure&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Post ID (if known)&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;strike&gt;https://i.imgur.com/0ujlnme.jpg&lt;/strike&gt;&lt;/td&gt;&#xA;&lt;td&gt;APIException: Image uploads are limited to 2 MiB; please use a smaller image&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/&quot;&gt;&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;strike&gt;https://i.imgur.com/2yE1AjA.jpg&lt;/strike&gt;&lt;/td&gt;&#xA;&lt;td&gt;APIException: Image uploads are limited to 2 MiB; please use a smaller image&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/85981&quot;&gt;85981&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;strike&gt;https://i.imgur.com/7wyx4Db.gifv&lt;/strike&gt;&lt;/td&gt;&#xA;&lt;td&gt;FatalException: Wayback Machine can't be reached.&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/117382&quot;&gt;117382&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;s&gt;https://i.imgur.com/AnahEIu.gif&lt;s&gt;&lt;/td&gt;&#xA;&lt;td&gt;FatalException: Wayback Machine can't be reached.&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/24490&quot;&gt;24490&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;s&gt;https://i.imgur.com/GO22Mqr.gif&lt;/s&gt;&lt;/td&gt;&#xA;&lt;td&gt;JSONException: org.json.JSONException: A JSONObject text must begin with '{' at 1 [character 2 line 1]&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/119489&quot;&gt;119489&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.imgur.com/Ij4zG7G.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://i.imgur.com/Ij4zG7G.gif&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;APIException: Image uploads are limited to 2 MiB; please use a smaller image&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/34459&quot;&gt;34459&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.imgur.com/OYkW5Es.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://i.imgur.com/OYkW5Es.gif&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;APIException: Image uploads are limited to 2 MiB; please use a smaller image&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/34459&quot;&gt;34459&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;s&gt;https://i.imgur.com/QGUxTdh.gif&lt;/s&gt;&lt;/td&gt;&#xA;&lt;td&gt;APIException: Image uploads are limited to 2 MiB; please use a smaller image&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/34459&quot;&gt;34459&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.imgur.com/QSWa9Dc.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://i.imgur.com/QSWa9Dc.gif&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;APIException: Image uploads are limited to 2 MiB; please use a smaller image&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/34459&quot;&gt;34459&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.imgur.com/SQiYwXM.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://i.imgur.com/SQiYwXM.gif&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;APIException: Image uploads are limited to 2 MiB; please use a smaller image&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/34459&quot;&gt;34459&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.imgur.com/TrbQ70d.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://i.imgur.com/TrbQ70d.gif&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;APIException: Image uploads are limited to 2 MiB; please use a smaller image&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/204471&quot;&gt;204471&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;s&gt;https://i.imgur.com/VupUN46.gifv&lt;/s&gt;&lt;/td&gt;&#xA;&lt;td&gt;FatalException: Wayback Machine can't be reached.&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/90700&quot;&gt;90700&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;s&gt;https://i.imgur.com/Zr3tvED.gifv&lt;/s&gt;&lt;/td&gt;&#xA;&lt;td&gt;FatalException: Wayback Machine can't be reached.&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/80407&quot;&gt;80407&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;s&gt;https://i.imgur.com/d39hyEc.jpg&lt;/s&gt;&lt;/td&gt;&#xA;&lt;td&gt;APIException: Image uploads are limited to 2 MiB; please use a smaller image&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/85981&quot;&gt;85981&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;s&gt;https://i.imgur.com/hntTVNJ.gif&lt;/s&gt;&lt;/td&gt;&#xA;&lt;td&gt;APIException: Image uploads are limited to 2 MiB; please use a smaller image&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/188429&quot;&gt;188429&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.imgur.com/iY9DoS4.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://i.imgur.com/iY9DoS4.gif&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;APIException: Image uploads are limited to 2 MiB; please use a smaller image&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/186231&quot;&gt;186231&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.imgur.com/lfEeYaG.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://i.imgur.com/lfEeYaG.gif&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;FatalException: Wayback Machine can't be reached.&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/153101&quot;&gt;153101&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.imgur.com/m7lOm7L.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://i.imgur.com/m7lOm7L.gif&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;APIException: Image uploads are limited to 2 MiB; please use a smaller image&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/34459&quot;&gt;34459&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.imgur.com/mNFjoiv.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://i.imgur.com/mNFjoiv.gif&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;APIException: Image uploads are limited to 2 MiB; please use a smaller image&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/&quot;&gt;&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.imgur.com/mR0w3Pib.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://i.imgur.com/mR0w3Pib.jpg&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;FatalException: Wayback Machine can't be reached.&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/68750&quot;&gt;68750&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.imgur.com/pNLe9i6.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://i.imgur.com/pNLe9i6.gif&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;APIException: Image uploads are limited to 2 MiB; please use a smaller image&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/34459&quot;&gt;34459&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.imgur.com/s5av7Isb.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://i.imgur.com/s5av7Isb.jpg&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;FatalException: Wayback Machine can't be reached.&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/68750&quot;&gt;68750&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;https://i.imgur.com/tamRnBj.png&lt;/s&gt;&lt;/td&gt;&#xA;&lt;td&gt;APIException: Image uploads are limited to 2 MiB; please use a smaller image&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/203782&quot;&gt;203782&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;https://i.imgur.com/w3e2JQS.gifv&lt;/s&gt;&lt;/td&gt;&#xA;&lt;td&gt;FatalException: Wayback Machine can't be reached.&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/169121&quot;&gt;169121&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.imgur.com/zmSyRut.mp4&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://i.imgur.com/zmSyRut.mp4&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;FatalException: Wayback Machine can't be reached.&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/104745&quot;&gt;104745&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;" OwnerUserId="91213" LastEditorUserId="70761" LastEditDate="2023-05-23T03:09:59.557" LastActivityDate="2023-05-23T03:09:59.557" CommentCount="2" CommunityOwnedDate="2023-05-09T07:45:49.163" ContentLicense="CC BY-SA 4.0" />
  <row Id="25766" PostTypeId="2" ParentId="19279" CreationDate="2023-05-10T02:00:51.757" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;http://golfscript.com/nibbles&quot; rel=&quot;nofollow noreferrer&quot;&gt;Nibbles&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Nibbles is a language designed to be very good at golf by having half byte instructions rather than hundreds of built-ins. Because each instruction is half a byte and expressible as a regular keyboard symbol, it should feel like golfing in a regular language, except you get to divide by two at the end when you compile it to the binary form!&lt;/p&gt;&#xA;&lt;p&gt;Aside from that it is a purely functional and statically typed language like Haskell and Husk. It uses prefix notation and DeBruijn indicies which are a simple and efficient (entory-wise) way to encode syntax trees. It also makes heavy use of type overloading and pointless op combo detection to throw in more than 16 operations (there are 86 ops).&lt;/p&gt;&#xA;&lt;h2&gt;Reasons&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It beat Jelly 44 to 23 as of December on challenges that were solved in both languages and has a tentative 3rd highest elo &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8798/golfing-class-of-a-language&quot;&gt;here&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;li&gt;5x less ops to learn or search through than most new golf languages.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You feel like you are actually solving problems rather than just finding the op tailored to a specific genre of golf problem.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;It is fairly easy to write programs in, even complicated ones (some of my favorite solutions were to problems like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/190732/nothing-like-a-good-ol-game-of-modten/240736?r=Saves_UserSavesList#240736&quot;&gt;game of ModTen&lt;/a&gt; where it beat the next best solution by 10 bytes).&lt;/li&gt;&#xA;&lt;li&gt;It isn't widely used (I only know of 3 real users!).&lt;/li&gt;&#xA;&lt;li&gt;It's what I would have made instead of Golfscript if I had ever known Golfscript would actually take off - I probably put 50x as much work into it as I did Golfscript.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Caveats&lt;/h2&gt;&#xA;&lt;p&gt;Not sure why I feel the need to critique it while promoting it, but my personal opinion - 1 year after creating it - is that I sacrificed simplicity too much in an attempt to be the most concise. It lacks vectorization on most ops because that prevents overloading type by rank. But there are sometimes when vectorization is ridiculously useful (like the top level operation of a program) - and so it has special cases to fit that in for some of those cases via implicit map/etc. There are a few other things like implicit ops/vars that fit this bill too.&lt;/p&gt;&#xA;&lt;h2&gt;Resources&lt;/h2&gt;&#xA;&lt;p&gt;Tutorial, source, instructions, etc are all at &lt;a href=&quot;http://golfscript.com/nibbles&quot; rel=&quot;nofollow noreferrer&quot;&gt;golfscript.com/nibbles&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/145966/nibbles&quot;&gt;Chatroom&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="94929" LastEditorUserId="94929" LastEditDate="2023-05-12T13:31:54.713" LastActivityDate="2023-05-12T13:31:54.713" CommentCount="2" CommunityOwnedDate="2023-05-10T02:00:51.757" ContentLicense="CC BY-SA 4.0" />
  <row Id="25767" PostTypeId="2" ParentId="2140" CreationDate="2023-05-11T07:45:35.317" Score="2" Body="&lt;h1&gt;Create an equation for a convex polygon&lt;/h1&gt;&#xA;&lt;p&gt;It turns out that it's possible to create an equation for any convex polygon. Here is a simple example:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$ \sqrt { 1 - x } \sqrt { 1 - y } \sqrt { x + y } = 0 $$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;I don't know how to create a link to a graph, but I was able to use the graphing calculator at &lt;a href=&quot;https://www.mathway.com/Graph&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.mathway.com/Graph&lt;/a&gt; to draw this equation by pasting the text &lt;code&gt;\sqrt { 1 - x } \sqrt { 1 - y } \sqrt { x + y } = 0&lt;/code&gt; into its equation box. As you can see the result is a simple triangle, but it's possible to extend this idea to any convex polygon.&lt;/p&gt;&#xA;&lt;p&gt;Please write a program or function that will take a list of points representing the vertices of a convex polygon and output an equation for that polygon in an acceptable format, typically TeX, but other formats would be acceptable if you can find a resource that will draw the polygon.&lt;/p&gt;&#xA;&lt;p&gt;You can make reasonable assumptions regarding the input e.g. you can require the first point to be the one with the highest y-coordinate and the remaining points to follow the polygon in a clockwise direction.&lt;/p&gt;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(-1, 1), (1, 1), (1, -1) =&amp;gt; \sqrt { 1 - x } \sqrt { 1 - y } \sqrt { x + y } = 0&#xA;(0,1),(1,0),(0,-1),(-1,0) =&amp;gt; \sqrt{1+x+y}\sqrt{1+x-y}\sqrt{1-x-y}\sqrt{1-x+y}=0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(I tried to write some more complex examples but even Mathway's calculator gave up at that point.)&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2023-05-11T07:45:35.317" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25768" PostTypeId="2" ParentId="2140" CreationDate="2023-05-11T13:03:56.570" Score="3" Body="&lt;p&gt;Given an integer, output &lt;code&gt;an&lt;/code&gt; if its English name begins with a vowel (namely it is positive, and its first digit is &lt;code&gt;8&lt;/code&gt; or it has the form &lt;code&gt;11&lt;/code&gt; followed by a multiple of 3 digits), and otherwise output &lt;code&gt;a&lt;/code&gt;.  This is code-golf, so the shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;p&gt;Test cases&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;10: a&#xA;0: a&#xA;8234987: an&#xA;110: a&#xA;11: an&#xA;11234: an&#xA;-8: a&#xA;-11: a&#xA;8: an&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note for the sandbox viewers: in the related question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/235345/english-an-or-a&quot;&gt;English An or A?&lt;/a&gt; the input is an arbitrary word as a string, and in the related question &lt;a href=&quot;https://codegolf.stackexchange.com/questions/93264/an-a-or-an-an&quot;&gt;An A , or An An?&lt;/a&gt; the article a/an must be placed inside a sentence, properly capitalized.  The present question has a more minimalistic input and output.&lt;/p&gt;&#xA;" OwnerUserId="2256" LastActivityDate="2023-05-11T13:03:56.570" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25769" PostTypeId="2" ParentId="2140" CreationDate="2023-05-11T19:50:01.960" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/261077/turn-strings-into-hexagonal-spirals&quot;&gt;Turn strings into hexagonal spirals!&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="98462" LastEditorUserId="98462" LastEditDate="2023-05-19T16:34:15.917" LastActivityDate="2023-05-19T16:34:15.917" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25770" PostTypeId="2" ParentId="2140" CreationDate="2023-05-12T07:57:12.663" Score="1" Body="&lt;h1&gt;Draw any infinite fractal &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/open-ended-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-open-ended-function-tooltip-container&quot;&gt;open-ended-function&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Write a function that, given as input 2 positive integers for X and Y, outputs one of two distinct values, representing white and black. Your function should have the following properties:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No horizontal or vertical ray should infinitely repeat itself. A ray is a straight line that starts at one point then continues upto infinity. Mathematically &lt;span class=&quot;math-container&quot;&gt;\$ \not \exists x, y, \delta : \forall e \geq y+\delta: f(x,e)=f(x,e-\delta)\$&lt;/span&gt; and the same with &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$y\$&lt;/span&gt; reversed.&lt;/li&gt;&#xA;&lt;li&gt;Large scale structure: For every positive integer Z there exists a ZxZ square that is entirely white and also a ZxZ square that is entirely black. This rule ensures no matter how much you zoom out you should still be able to see some shapes and not just grey.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For the purpose of this challenge you may ignore the numerical limits of your language. When proving that your function meets the requirements, assume they don't exist.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2023-05-12T07:57:12.663" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25772" PostTypeId="2" ParentId="2140" CreationDate="2023-05-17T15:02:46.500" Score="2" Body="&lt;h1&gt;Complexity of a binary matrix&lt;/h1&gt;&#xA;&lt;p&gt;This is a &lt;span class=&quot;math-container&quot;&gt;\$4\times 4\$&lt;/span&gt; binary matrix:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{matrix}&#xA;1 &amp;amp; 0 &amp;amp; 1 &amp;amp; 0 \\&#xA;0 &amp;amp; 1 &amp;amp; 0 &amp;amp; 1 \\&#xA;1 &amp;amp; 0 &amp;amp; 0 &amp;amp; 1 \\&#xA;0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 1 \\&#xA;\end{matrix}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;A row-add operation takes one row and adds it to another one where addition is done mod 2. For example adding the second row to the third would give the following matrix:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{matrix}&#xA;1 &amp;amp; 0 &amp;amp; 1 &amp;amp; 0 \\&#xA;0 &amp;amp; 1 &amp;amp; 0 &amp;amp; 1 \\&#xA;1 &amp;amp; 1 &amp;amp; 0 &amp;amp; 0 \\&#xA;0 &amp;amp; 0 &amp;amp; 0 &amp;amp; 1 \\&#xA;\end{matrix}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;It's possible to add a row to itself. This is the same as zeroing that row.&lt;/p&gt;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&lt;p&gt;Given a &lt;span class=&quot;math-container&quot;&gt;\$n\times n\$&lt;/span&gt; binary matrix your task is to figure out how many row-addition steps it would take to get to that matrix starting from the identity matrix. I call this the &amp;quot;complexity&amp;quot; of the matrix.&lt;/p&gt;&#xA;&lt;p&gt;For example if we were given the following matrix as input&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{matrix}&#xA;0 &amp;amp; 1 &amp;amp; 1 \\&#xA;1 &amp;amp; 0 &amp;amp; 0 \\&#xA;0 &amp;amp; 0 &amp;amp; 0 \\&#xA;\end{matrix}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Then your program would output &lt;span class=&quot;math-container&quot;&gt;\$5\$&lt;/span&gt; since there's no shorter sequence than the following:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{matrix}&#xA;1 &amp;amp; 0 &amp;amp; 0 \\&#xA;0 &amp;amp; 1 &amp;amp; 0 \\&#xA;0 &amp;amp; 0 &amp;amp; 1 \\&#xA;\end{matrix}&#xA;$$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;1\leftarrow 2&#xA;$$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{matrix}&#xA;1 &amp;amp; 1 &amp;amp; 0 \\&#xA;0 &amp;amp; 1 &amp;amp; 0 \\&#xA;0 &amp;amp; 0 &amp;amp; 1 \\&#xA;\end{matrix}&#xA;$$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;2\leftarrow 1&#xA;$$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{matrix}&#xA;1 &amp;amp; 1 &amp;amp; 0 \\&#xA;1 &amp;amp; 0 &amp;amp; 0 \\&#xA;0 &amp;amp; 0 &amp;amp; 1 \\&#xA;\end{matrix}&#xA;$$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;1\leftarrow 2&#xA;$$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{matrix}&#xA;0 &amp;amp; 1 &amp;amp; 0 \\&#xA;1 &amp;amp; 0 &amp;amp; 0 \\&#xA;0 &amp;amp; 0 &amp;amp; 1 \\&#xA;\end{matrix}&#xA;$$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;1\leftarrow 3&#xA;$$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{matrix}&#xA;0 &amp;amp; 1 &amp;amp; 1 \\&#xA;1 &amp;amp; 0 &amp;amp; 0 \\&#xA;0 &amp;amp; 0 &amp;amp; 1 \\&#xA;\end{matrix}&#xA;$$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;3\leftarrow 3&#xA;$$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;\begin{matrix}&#xA;0 &amp;amp; 1 &amp;amp; 1 \\&#xA;1 &amp;amp; 0 &amp;amp; 0 \\&#xA;0 &amp;amp; 0 &amp;amp; 0 \\&#xA;\end{matrix}&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;It's is always possible to get to any matrix from the identity matrix (proof left as an exercise to the reader)&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-fastest-code-tooltip-container&quot;&gt;fastest-code&lt;/a&gt;. I'll be running submissions on a Ryzen 1800X limited to 16GB of RAM (using ulimit).&lt;/p&gt;&#xA;&lt;p&gt;Your code will take as input an infinite stream of matrices over stdin. A matrix is encoded as its size followed by the rows of the matrix. The input starts with 10 matrices of size 3 followed by 10 of size 4 and so on.&lt;/p&gt;&#xA;&lt;p&gt;You must output (in order) to stdin the complexities of the matrices.&lt;/p&gt;&#xA;&lt;p&gt;See &lt;a href=&quot;https://ato.pxeger.com/run?1=m72soLIkIz9vwYKlpSVpuhY3OzNzC_KLShSKEvNS8nO5uPIUbBWMucozMnNSFUKKSlOtuDjT8osU4hUy80Bq0lM1DA00gYKcBUWZeSUaeZpAJpqCPLA8VIEWxGC95Iz8zOTUYo1oAx3DWB2FbNs8TZ3i1AJbJSWgCXnatgqGEAdB3QVzHwA&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; code for an example input. I'll use this code to generate the input (but using a secret seed).&lt;/p&gt;&#xA;&lt;p&gt;I will run each submission for 5 minutes. The submission that manages to process the most matrices will win. Ties will be resolved by the time it took to output the last matrix.&lt;/p&gt;&#xA;&lt;p&gt;TODO: add test inputs.&lt;/p&gt;&#xA;&lt;h1&gt;Bonus points&lt;/h1&gt;&#xA;&lt;p&gt;In case two submissions are tied to the nanosecond I might use these as a tiebreaker :D&lt;/p&gt;&#xA;&lt;p&gt;Find a block diagonal matrix whose complexity is less than the sum of the complexities of the blocks on the diagonal.&lt;/p&gt;&#xA;&lt;p&gt;Is there a block matrix whose complexity is less than one of the blocks on the diagonal?&lt;/p&gt;&#xA;" OwnerUserId="84290" LastEditorUserId="84290" LastEditDate="2023-05-17T15:34:09.280" LastActivityDate="2023-05-17T15:34:09.280" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25773" PostTypeId="2" ParentId="2140" CreationDate="2023-05-17T18:02:06.783" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/261112/how-powerful-must-this-e-approximation-be&quot;&gt;How powerful must this e approximation be?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="110698" LastEditorUserId="110698" LastEditDate="2023-05-21T05:27:08.187" LastActivityDate="2023-05-21T05:27:08.187" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25774" PostTypeId="2" ParentId="2140" CreationDate="2023-05-17T19:49:59.580" Score="2" Body="&lt;h1&gt;Generate the SMKG aperiodic tiling&lt;/h1&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Smith, Myers, Kaplan and Goodman-Strauss &lt;a href=&quot;https://arxiv.org/abs/2303.10798&quot; rel=&quot;nofollow noreferrer&quot;&gt;discovered&lt;/a&gt; the first &amp;quot;einstein&amp;quot; - a single connected tile that can tile the plane only aperiodically.  They call their tile the &amp;quot;hat&amp;quot;.  Write a program to generate a finite patch of a tiling of the plane by hats.&#xA;&lt;a href=&quot;https://i.stack.imgur.com/WzwBN.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/WzwBN.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Details&lt;/h2&gt;&#xA;&lt;p&gt;The program must output a sequence of tiles that make up the patch.  Each tile must be given in the form of its 13 (or 14 - see below) vertices, listed in order around the tile either clockwise or anticlockwise.  Each vertex must be given in the form of its &lt;strong&gt;triangular&lt;/strong&gt; coordinates, as explained below, and &lt;strong&gt;these coordinates must be integers&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Triangular coordinates are with respect to a pair of axes at 60 degrees to each other.  A point with triangular coordinates &lt;code&gt;(u,v)&lt;/code&gt; corresponds to a point with ordinary cartesian coordinates &lt;code&gt;(u+v/2, v*sqrt(3)/2)&lt;/code&gt;.  An example of a single hat tile has vertices with triangular coordinates&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[(4,2),(2,1),(2,2),(1,2),(2,4),(4,5),(4,6),(5,7),(6,6),(5,4),(6,4),(6,2),(5,1)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that it is possible and allowed for the hat to have a different size and still have integer coordinates, although it must not be a different shape.  The hat has a unique longest side (of length 2 at this scale), which may optionally be bisected by an additional vertex to give 14 vertices.&lt;/p&gt;&#xA;&lt;p&gt;All output tiles must belong to a valid tiling of the full plane by hats (all related to each other by congruences or reflections). The output must include every tile that intersects a certain square, where this square is large enough that there are at least 1000 such tiles.  (At the above scale, a square of side 120 is sufficient). The program may optionally output further tiles of the tiling that lie outside the square. The same tile should not appear more than once in the output.&lt;/p&gt;&#xA;&lt;p&gt;The algorithm should theoretically be capable of generating arbitrarily large patches (given the ability to work with arbitrary precision integers).  In particular this means that &lt;strong&gt;algorithms that calculate floating point coordinates and then round them to integers are typically NOT acceptable.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;The beginning of the output (corresponding to the first 5 hats) might be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[(12,0),(10,-1),(10,0),(9,0),(10,2),(12,3),(12,4),(13,5),(14,4),(13,2),(14,2),(14,0),(13,-1)]&#xA;[(10,2),(9,0),(8,0),(7,-1),(6,0),(7,2),(6,2),(6,3),(8,4),(9,3),(10,4),(12,4),(12,3)]&#xA;[(2,-2),(4,-1),(4,0),(5,1),(4,2),(2,1),(2,2),(1,2),(0,0),(1,-1),(0,-2),(0,-4),(1,-4)]&#xA;[(6,0),(7,-1),(6,-2),(6,-3),(4,-4),(3,-3),(2,-4),(1,-4),(2,-2),(4,-1),(4,0),(6,2),(7,2)]&#xA;[(4,2),(2,1),(2,2),(1,2),(2,4),(4,5),(4,6),(5,7),(6,6),(5,4),(6,4),(6,2),(5,1)]&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The output can be in any reasonable form, such as a linefeed-delimited sequence of lists of pairs as above.&lt;/p&gt;&#xA;&lt;p&gt;The picture below shows a possible output converted to graphical form. Note that the program itself does not need to produce any graphical output (although obviously it is useful for testing).&#xA;&lt;a href=&quot;https://i.stack.imgur.com/OHGdK.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/OHGdK.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is code golf, so the shortest program in each language wins.&lt;/p&gt;&#xA;&lt;p&gt;Related: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/259390/draw-the-gkms-aperiodic-tile&quot;&gt;Draw the GKMS aperiodic tile&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="104303" LastEditorUserId="104303" LastEditDate="2023-05-31T16:45:05.610" LastActivityDate="2023-05-31T16:45:05.610" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25775" PostTypeId="2" ParentId="2140" CreationDate="2023-05-18T00:40:22.390" Score="0" Body="&lt;p&gt;Let's start with a fairly innocuous definition of a polygon:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A polygon is a set of points &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; in Euclidean space and set of edges each having two distinct endpoints in &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt;, such that the edges form a single cycle.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;We will define a &lt;em&gt;regular&lt;/em&gt; polygon then as:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Take each edge of the polygon and divide it into two halves of equal length. The polygon is &lt;strong&gt;regular&lt;/strong&gt; if for any pair of half edges, &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;, there is an isometry of ambient space that maps every half edge to another and maps &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This can informally be phrased as &amp;quot;no two edges or faces are distinguishable by anything other than absolute position&amp;quot;. You may also hear the common phrasing &amp;quot;all edges are the same length and all angles are equal&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;Now the astute among you will be quick to point out that while this allows for what we normally consider polygons it also includes so called &amp;quot;star-polygons&amp;quot; such as the pentagram:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/JHSBf.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/JHSBf.png&quot; alt=&quot;A pentagram!&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;These edges intersect each other, but we didn't forbid this. So by the definition this is a valid 5-sided polygon.&lt;/p&gt;&#xA;&lt;p&gt;These sort of edge cases are sort of common knowledge. However the even more astute among you may have noticed a much stranger loophole.  I said &amp;quot;Euclidean space&amp;quot;, not &amp;quot;&lt;em&gt;2-dimensional&lt;/em&gt; Euclidean space&amp;quot;.&lt;/p&gt;&#xA;&lt;h1&gt;Skew polygons&lt;/h1&gt;&#xA;&lt;p&gt;So can we make new polygons in higher dimensional spaces? Yes, for example here's a regular 6-sided polygon in 3D space:&lt;/p&gt;&#xA;&lt;p&gt;&lt;img src=&quot;https://static.miraheze.org/polytopewiki/3/32/Skew_hexagon.png&quot; alt=&quot;Skew hexagon&quot; /&gt;&#xA;&lt;em&gt;Image curteousy of Polytope wiki user Sycamore916, CC-BY-SA-4.0&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;It turns out for example we can take any even sided polygon and raise half of its vertices up out of the plane to get a &amp;quot;skew&amp;quot; version of it that is 3D. And in 4D we can do even stranger things.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge statement&lt;/h2&gt;&#xA;&lt;p&gt;The challenge is going to be to count these skew polygons. You are going to take an integer &amp;gt; 2 and output a list &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$a_d\$&lt;/span&gt; represents the number of distinct regular polygons in &lt;span class=&quot;math-container&quot;&gt;\$d\$&lt;/span&gt; dimensions.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; so the goal is to minimize the size of your source code as measured in bytes.&lt;/p&gt;&#xA;&lt;h2&gt;Definitions&lt;/h2&gt;&#xA;&lt;p&gt;In order for this to work we must add 2 more definitions, the first is what makes two polygons distinct and the second is the dimension of a polygon.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A polygon in &lt;span class=&quot;math-container&quot;&gt;\$d\$&lt;/span&gt; dimensions is a polygon such that the affine span of its vertices is a &lt;span class=&quot;math-container&quot;&gt;\$d\$&lt;/span&gt;-dimensional subspace.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;For example the following vertices form a triangle:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;$$&#xA;(1,0,0)\\&#xA;(0,1,0)\\&#xA;(0,0,1)&#xA;$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Each coordinate is given in 3D, however the polygon itself is 2D since all of its vertices lie on the same plane.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Two polygons &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; are &lt;strong&gt;the same&lt;/strong&gt; if there is an invertible linear transform taking &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;. Two polygons are &lt;strong&gt;distinct&lt;/strong&gt; if they are not the same.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;For example the skew hexagon discussed earlier can be stretched vertically by any positive factor. These do not count as distinct polygons since stretching is an invertible linear transform. However the skew hexagon is &lt;em&gt;distinct&lt;/em&gt; from the normal planar hexagon since the stretch factor would be 0, and that linear transformation is not invertable (you cannot divide by 0).&lt;/p&gt;&#xA;&lt;p&gt;Very nicely these two definitions coincide so that if two polygons have different dimensions they are automatically distinct, so there is no ambiguity as to how to count them.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;3 -&amp;gt; [0,1]&#xA;4 -&amp;gt; [0,1,1]&#xA;5 -&amp;gt; [0,2,0,1]&#xA;6 -&amp;gt; [0,1,2,1,1]&#xA;7 -&amp;gt; [0,3,0,3,0,1]&#xA;8 -&amp;gt; [0,2,2,3,3,1,1]&#xA;9 -&amp;gt; [0,3,0,6,0,4,0,1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Spoilers&lt;/h2&gt;&#xA;&lt;p&gt;Here's the part where I would explain where the magic numbers come from.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2023-05-18T00:55:23.207" LastActivityDate="2023-05-18T00:55:23.207" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25776" PostTypeId="1" CreationDate="2023-05-18T18:15:09.217" Score="11" ViewCount="90" Body="&lt;p&gt;Currently, we have two open questions tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/tips&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;tips&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-tips-tooltip-container&quot;&gt;tips&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-design&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-design&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;language-design&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-language-design-tooltip-container&quot;&gt;language-design&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/118111/tips-for-storage-in-a-golfing-language&quot;&gt;Tips for storage in a golfing language&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/198446/tips-for-creating-maintaining-a-golfing-language&quot;&gt;Tips for Creating/Maintaining a Golfing Language&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Now that there is a StackExchange site for &lt;a href=&quot;https://languagedesign.stackexchange.com/&quot;&gt;Programming Language Design and Implementation&lt;/a&gt; (in private beta as of this writing), &lt;strong&gt;do we still want to allow language design questions here on CGCC, or should they be asked at PLDI?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The same question was &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/17366/16766&quot;&gt;previously asked four years ago&lt;/a&gt;, but it didn't get a straight answer, and that was before PLDI existed.&lt;/p&gt;&#xA;&lt;p&gt;This issue is also being discussed from the opposite direction on PLDI meta: &lt;a href=&quot;https://languagedesign.meta.stackexchange.com/questions/80/when-should-a-golfing-language-question-be-posted-here-vs-on-cgcc&quot;&gt;When should a golfing language question be posted here vs. on CGCC?&lt;/a&gt; The &lt;a href=&quot;https://languagedesign.meta.stackexchange.com/a/81/27&quot;&gt;current top-voted answer&lt;/a&gt; suggests the following &amp;quot;rough heuristic&amp;quot;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Thus, if your question would benefit from detailed discussion of golfiness, it may be better on CGCC (but is perfectly fine here!), and if it would benefit more from advice from langdevs from a variety of backgrounds, it may be better here (but is perfectly fine on CGCC).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;So it looks like such questions will be on-topic at PLDI regardless. Do we want them &lt;em&gt;also&lt;/em&gt; to be on-topic here?&lt;/p&gt;&#xA;&lt;p&gt;(This question does not apply to actual challenges tagged &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/language-design&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;language-design&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;language-design&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-language-design-tooltip-container&quot;&gt;language-design&lt;/a&gt;, which are definitely on-topic.)&lt;/p&gt;&#xA;" OwnerUserId="16766" LastEditorUserId="16766" LastEditDate="2023-05-18T18:20:14.877" LastActivityDate="2023-05-18T18:20:14.877" Title="Tips for language design: still on-topic?" Tags="|discussion|scope|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25777" PostTypeId="2" ParentId="14337" CreationDate="2023-05-18T18:53:02.647" Score="2" Body="&lt;h2&gt;Commonly used flags are free, unique flags/flag combinations are not&lt;/h2&gt;&#xA;&lt;p&gt;Essentially, the flag problem comes down to differentiating two scenarios. At one extreme, we have languages which are often invoked using certain flags. At the opposite extreme, we have flags or flag combinations which have never been seen prior to a given answer. To me, commonly used flags should be legal, and should cost no bytes. Unique flags, ones which are not commonly used, should be treated the same as code. For instance, in &lt;a href=&quot;https://codegolf.stackexchange.com/a/260972/20080&quot;&gt;this answer&lt;/a&gt;, the flag combination &lt;code&gt;Rss&lt;/code&gt; is unique, and should be counted as code, requiring 3 bytes.&lt;/p&gt;&#xA;&lt;p&gt;The previous answer says that each flag combination is its own language. But that's a bit of a cop-out, because now we essentially have users inventing new languages constantly, without a clear judgement on when that is allowed or not. Referring to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/1071/20080&quot;&gt;this standard loophole&lt;/a&gt;, we see that inventing a language for the purpose of a solution is already banned. Read literally, the combination of these two rulings would imply that using unique flag combinations constitutes inventing a language for a challenge, and is therefore banned outright.&lt;/p&gt;&#xA;&lt;p&gt;I don't think banning unique flag combinations outright is correct, and I don't think allowing them for free is correct. I think the best solution is to count them as code. Note that the &lt;code&gt; -&lt;/code&gt; at the beginning of the flag invocation is common to most flags, and therefore is free.&lt;/p&gt;&#xA;&lt;p&gt;However, this raises the question: How can we objectively determine which flags and flag combinations are common, and which are unique? I think we should do this in the same way we determine whether a programming language exists prior to a challenge, or is made up for the challenge. Ask: &amp;quot;Is this flag or flag combination something that people have used previously? Used purposefully, not just to overcome this rule?&amp;quot; There might be some edge cases requiring subjectivity, but it will almost always be clear.&lt;/p&gt;&#xA;" OwnerUserId="20080" LastEditorUserId="20080" LastEditDate="2023-05-18T18:58:40.510" LastActivityDate="2023-05-18T18:58:40.510" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25780" PostTypeId="2" ParentId="6918" CreationDate="2023-05-20T07:24:20.377" Score="2" Body="&lt;h2&gt;&lt;a href=&quot;https://github.com/jfioasd/Flip&quot; rel=&quot;nofollow noreferrer&quot;&gt;Flip&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;A 1D language inspired by &lt;a href=&quot;https://github.com/GrayJoKing/Backhand/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Backhand&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;It was inspired by the fact that &lt;code&gt;v&lt;/code&gt; was used &lt;a href=&quot;https://github.com/jfioasd/esolang-analysis/blob/main/misc/Backhand.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;very commonly&lt;/a&gt; in the language, so I started to wonder whether Backhand's IP step of 3 was too big.&lt;/p&gt;&#xA;&lt;p&gt;It turns out that if you want the IP to be bidirectional, only 2 groups of commands are actually needed: even-indexed characters for forward IP movement, and odd-indexed characters for backwards movement.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;|&lt;/code&gt; is very common in Backhand as well. So I thought of generalizing Backhand's &lt;code&gt;|&lt;/code&gt; to make it the primary looping structure of the language, while also doing an implicit shifting between the even and odd characters (due to the fact that IP shifting is very common in Backhand). This turned out to be extemely powerful, and also removed the need of &lt;code&gt;&amp;gt;&lt;/code&gt; and &lt;code&gt;&amp;lt;&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Regarding &lt;code&gt;&amp;amp;&lt;/code&gt;, it came from a need to implement foreach/map/filter/reduce loops in a painless way. I took inspiration from x86's &lt;code&gt;loop&lt;/code&gt; and used an accumulator to store the count. When used with stack shifting &lt;code&gt;m&lt;/code&gt;, you could easily implement a lot of higher-order functions with it.&lt;/p&gt;&#xA;&lt;p&gt;Speaking of program termination, infinite loops are not as common as programs that terminate, so I made the program terminate when the IP goes over the left bound.&lt;/p&gt;&#xA;&lt;p&gt;However, later I added a ton of builtins to the language (taken from Keg, Factor, Jelly (particularly the &lt;code&gt;Y&lt;/code&gt; builtin)), and they ended up being quite useless, to be honest. I've used up every ASCII character and there isn't any builtin in there that's substantially useful.&lt;/p&gt;&#xA;" OwnerDisplayName="user118074" LastActivityDate="2023-05-20T07:24:20.377" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25782" PostTypeId="2" ParentId="2140" CreationDate="2023-05-23T03:00:12.747" Score="3" Body="&lt;h1&gt;Find the centroid of a spherical polygon on Earth&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/codge-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;codge-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;codge-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-codge-golf-tooltip-container&quot;&gt;codge-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/geometry&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;geometry&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-geometry-tooltip-container&quot;&gt;geometry&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a list of &lt;code&gt;N&lt;/code&gt; (latitude, longitude) coordinates in &lt;a href=&quot;https://en.wikipedia.org/wiki/Decimal_degrees&quot; rel=&quot;nofollow noreferrer&quot;&gt;decimal degrees&lt;/a&gt;, &lt;code&gt;coord={{lat1,lon1},{lat2, lon2}, ...,{latN,lonN}}&lt;/code&gt;, we consider the &lt;a href=&quot;https://en.wikipedia.org/wiki/Spherical_trigonometry#Spherical_polygons&quot; rel=&quot;nofollow noreferrer&quot;&gt;spherical polygon&lt;/a&gt; enclosed by the geodesics connecting successive pairs of coordinates (including the geodesic between the last and first pair of coordinates). We will follow the convention that the enclosed polygon is always to the left as we traverse each geodesic, i.e., the coordinates are given counter-clockwise around the boundary.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to find the coordinates of the &lt;strong&gt;centroid&lt;/strong&gt; (center of mass) of the spherical polygon (technically, the projection of the centroid onto the surface of the Earth).&lt;/p&gt;&#xA;&lt;p&gt;For example, the coordinates &lt;code&gt;{{0,0}, {60,0}, {0, -90}}&lt;/code&gt; define a spherical triangle with a centroid at &lt;code&gt;{24.5839, -37.5891}&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/yFmsu.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/yFmsu.png&quot; alt=&quot;Simple Example&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Specifications and Assumptions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Assume a perfectly spherical earth with a radius of 1.&lt;/li&gt;&#xA;&lt;li&gt;At least 3 coordinates will be specified; there could be arbitrarily many. All the coordinates will be distinct and properly define a spherical polygon in counter-clockwise ordering (no crossing geodesics, no zero-area polygons, no lunes, etc.).&lt;/li&gt;&#xA;&lt;li&gt;To avoid edge cases and indeterminate inverse trig evaluations, all given coordinates will be confined to a single hemisphere. Furthermore, you do not need to handle inputs that would result in a centroid at the North or South Pole nor a longitude of +180=-180 degrees. (These would be valid inputs though!).&lt;/li&gt;&#xA;&lt;li&gt;The input format is flexible: list of lists, array, .csv file, etc. The output coordinates of the centroid should be given to at least 3 decimal places in the decimal degree format, but may otherwise be returned as you see fit.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;One possible approach&lt;/h2&gt;&#xA;&lt;p&gt;One possible approach is a neat application of Stokes' Theorem, partially illustrated in this &lt;a href=&quot;https://stackoverflow.com/questions/19897187/locating-the-centroid-center-of-mass-of-spherical-polygons/38201499#38201499&quot;&gt;stack overflow answer&lt;/a&gt;, and is outlined as follows:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Duplicate and append the first pair of coordinates: &lt;code&gt;{{lat1,lon1},{lat2, lon2}, ...,{latN,lonN}, {lat1,lon1}}&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Convert these lat/long coordinates to unit vectors in Cartesian (rectangular) coordinates, &lt;span class=&quot;math-container&quot;&gt;\$\vec{v_i}\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$i=1,...,N+1\$&lt;/span&gt;. NB. Latitude is measured in degrees away from equator (&lt;span class=&quot;math-container&quot;&gt;\$xy\$&lt;/span&gt;-plane) as opposed to the common mathematical convention of measuring &lt;a href=&quot;https://en.wikipedia.org/wiki/Spherical_coordinate_system&quot; rel=&quot;nofollow noreferrer&quot;&gt;spherical coordinates&lt;/a&gt; from &lt;span class=&quot;math-container&quot;&gt;\$z\$&lt;/span&gt;-axis.&lt;/li&gt;&#xA;&lt;li&gt;Compute the sum &lt;span class=&quot;math-container&quot;&gt;\$\vec{c} = \sum_{i=1}^N \frac{1}{2}\cdot \frac{ \vec{v_i} \times \vec{v_{i+1}}}{\Vert \vec{v_i} \times \vec{v_{i+1}} \Vert} \mathrm{ang}(\vec{v_i}, \vec{v_{i+1}})\$&lt;/span&gt; to find the 3D Cartesian coordinates of appropriate moment, where &lt;span class=&quot;math-container&quot;&gt;\$\times\$&lt;/span&gt; is the &lt;a href=&quot;https://en.wikipedia.org/wiki/Cross_product&quot; rel=&quot;nofollow noreferrer&quot;&gt;cross-product&lt;/a&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\mathrm{ang}(\vec{a}, \vec{b})\$&lt;/span&gt; is the angle between vectors &lt;span class=&quot;math-container&quot;&gt;\$\vec{a}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$\vec{b}\$&lt;/span&gt;. (Note that &lt;span class=&quot;math-container&quot;&gt;\$\mathrm{ang}\$&lt;/span&gt; can return either radians xor degrees, so long as it does so consistently. The choice of degrees vs radians effectively corresponds to a rescaling of the sphere, which is cancelled out in the following normalization step.)&lt;/li&gt;&#xA;&lt;li&gt;Normalize &lt;span class=&quot;math-container&quot;&gt;\$\vec{c}\$&lt;/span&gt; to project the centroid to the surface of the sphere, &lt;span class=&quot;math-container&quot;&gt;\$\vec{c}/\Vert \vec{c} \Vert \$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Convert these Cartesian coordinates to lat/long using inverse trig functions.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Be careful to mind radians vs degrees and inverse trig function ranges within your chosen language. Also, some parts of this given algorithm may or may not be superfluous...&lt;/p&gt;&#xA;&lt;h2&gt;More Test Cases&lt;/h2&gt;&#xA;&lt;p&gt;&lt;code&gt;{{0, 170}, {-90, 0}, {0, -160}}&lt;/code&gt; has a centroid of &lt;code&gt;{-32.7795, -175.0000}&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;{{26.158, -80.326}, {35.803, -78.722}, {36.103, -115.178}, {32.791, -96.81}}&lt;/code&gt; has a centroid of &lt;code&gt;{33.9037, -90.7267}&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;{{52.37, 4.89}, {41.89, 12.5}, {37.98, 23.73}, {46.06, 14.51}, {52.52, 13.38}, {52.26, 21.02}, {60.17, 24.94}}&lt;/code&gt; has a centroid of &lt;code&gt;{50.0215, 14.5968}&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;--shortest byte count wins!&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard rules apply&lt;/a&gt;, standard exclusions forbidden.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;E: Sandbox Questions&lt;/h1&gt;&#xA;&lt;p&gt;Any comments on difficulty/question scope? I think the connection with lat/long coordinates on earth is a nice motivation, but about half of my program to generate test cases is purely coordinate conversions. For reference, my very un-golfed program (complete with camelCase function names) is ~500 bytes.&lt;/p&gt;&#xA;&lt;p&gt;There are certainly ways to make the task simpler or more complex:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The easiest version (I think) would be to forget about the earth and lat/long entirely and have a purely geometric question. Inputs and outputs as unit Cartesian vectors.&lt;/li&gt;&#xA;&lt;li&gt;A harder version would not use a spherical earth approximation, but rather require an ellipsoidal earth or even a proper &lt;a href=&quot;https://en.wikipedia.org/wiki/Geodetic_datum&quot; rel=&quot;nofollow noreferrer&quot;&gt;geodetic datum&lt;/a&gt;. However, I think this becomes very difficult very quickly--even finding a geodesic on a geoid is hard, let alone the given algorithm requiring proper (numerically approximated) line integrals rather than a sum. Simultaneously, the task would likely become trivial with commercial GIS software. Using a more accurate earth model does significantly impact the centroid coordinates, changing it by up to several degrees for the given test cases.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="62273" LastEditorUserId="62273" LastEditDate="2023-05-23T23:55:26.590" LastActivityDate="2023-05-23T23:55:26.590" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25783" PostTypeId="2" ParentId="2140" CreationDate="2023-05-24T06:13:58.000" Score="2" Body="&lt;h1&gt;Generate a naïve &lt;code&gt;isEven()&lt;/code&gt;&lt;/h1&gt;&#xA;&lt;p&gt;We've all seen the memes of a beginner programmer writing an &lt;code&gt;isEven()&lt;/code&gt; function that looks something like this:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;def isEven(num):&#xA;    if (num == 0):&#xA;        return True&#xA;    elif (num == 1):&#xA;        return False&#xA;    # and so on&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You and I know this is tedious to do by hand, so let's write a program to make this function for us.&lt;/p&gt;&#xA;&lt;h1&gt;Task&lt;/h1&gt;&#xA;&lt;p&gt;Write a program that accepts a positive integer &lt;code&gt;n&lt;/code&gt; and outputs a valid naïve &lt;code&gt;isEven()&lt;/code&gt; function that can check all integers from &lt;code&gt;0&lt;/code&gt; up to and including &lt;code&gt;n&lt;/code&gt;.&#xA;The resulting function can be in any language, so long as it:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Is named &lt;code&gt;isEven&lt;/code&gt;, and&lt;/li&gt;&#xA;&lt;li&gt;Accepts a single parameter, &lt;code&gt;num&lt;/code&gt; (integer), and&lt;/li&gt;&#xA;&lt;li&gt;Explicitly checks whether &lt;code&gt;num&lt;/code&gt; is equal to each integer from &lt;code&gt;0&lt;/code&gt; to &lt;code&gt;n&lt;/code&gt;, inclusive (i.e. no &lt;code&gt;else&lt;/code&gt; for the last case), and&lt;/li&gt;&#xA;&lt;li&gt;Uses &lt;code&gt;1&lt;/code&gt; &lt;code&gt;if&lt;/code&gt; statement and &lt;code&gt;n - 1&lt;/code&gt; &lt;code&gt;else if&lt;/code&gt; statements (or the equivalent for your resulting language, but not ternary operators) across &lt;code&gt;n&lt;/code&gt; lines, and&lt;/li&gt;&#xA;&lt;li&gt;Returns a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2190/interpretation-of-truthy-falsey&quot;&gt;truthy or falsey&lt;/a&gt; value &lt;strong&gt;for the language of the resulting function&lt;/strong&gt; on a new line after each check. This must be an explicit value, not a calculation (e.g. &lt;code&gt;True&lt;/code&gt; not &lt;code&gt;num%2&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;You can assume &lt;code&gt;n&lt;/code&gt; and &lt;code&gt;num&lt;/code&gt; are both valid positive integers (i.e. no error checking necessary).&lt;/p&gt;&#xA;&lt;p&gt;Your resulting function will be at least &lt;code&gt;2(n+1) + 1&lt;/code&gt; lines, since each value up to &lt;code&gt;n&lt;/code&gt; requires 2 lines; one for the check, and one for the return.&#xA;The &lt;code&gt;+1&lt;/code&gt; in parenthesis comes from the need to check &lt;code&gt;0&lt;/code&gt;, and the &lt;code&gt;+ 1&lt;/code&gt; outside the parenthesis comes from the function declaration.&lt;/p&gt;&#xA;&lt;h1&gt;Scoring&lt;/h1&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so fewest bytes win.&#xA;Also, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;standard rules apply&lt;/a&gt;, and standard exclusions are forbidden.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Please put the resulting language in your title (e.g. &lt;code&gt;Jelly --&amp;gt; C++, n bytes&lt;/code&gt;)&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;p&gt;Resulting language: Python&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;# n = 1&#xA;def isEven(num):&#xA;    if num == 0:&#xA;        return True&#xA;    elif num == 1:&#xA;        return False&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre class=&quot;lang-py prettyprint-override&quot;&gt;&lt;code&gt;# n = 10&#xA;def isEven(num):&#xA;    if num == 0:&#xA;        return True&#xA;    elif num == 1:&#xA;        return False&#xA;    elif num == 2:&#xA;        return True&#xA;    elif num == 3:&#xA;        return False&#xA;    elif num == 4:&#xA;        return True&#xA;    elif num == 5:&#xA;        return False&#xA;    elif num == 6:&#xA;        return True&#xA;    elif num == 7:&#xA;        return False&#xA;    elif num == 8:&#xA;        return True&#xA;    elif num == 9:&#xA;        return False&#xA;    elif num == 10:&#xA;        return True&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Edit: remove parenthesis from test case&lt;/p&gt;&#xA;&lt;p&gt;Edit: remove parenthesis from function name&lt;/p&gt;&#xA;&lt;p&gt;Edit: add condition about explicit true/false return&lt;/p&gt;&#xA;&lt;p&gt;Edit: fix typo in second condition&lt;/p&gt;&#xA;" OwnerUserId="118119" LastEditorUserId="118119" LastEditDate="2023-05-24T06:45:39.260" LastActivityDate="2023-05-24T06:45:39.260" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="25785" PostTypeId="2" ParentId="2140" CreationDate="2023-05-24T13:45:11.563" Score="0" Body="&lt;h1&gt;Monopoly, But its in Creative Mode (sort of) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/koth&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;koth&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;koth&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-koth-tooltip-container&quot;&gt;koth&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h1&gt;Disjointed Monopoly (?)&lt;/h1&gt;&#xA;&lt;p&gt;Starting Grid: 8x8 grid:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+--+--+--+--+--+--+--+--+&#xA;|XX|  |  |  |  |  |  |XX|&#xA;+--+--+--+--+--+--+--+--+&#xA;|  |+1|  |  |  |  |+1|  |&#xA;+--+--+--+--+--+--+--+--+&#xA;|  |  |+2|+1|+1|+2|  |  |&#xA;+--+--+--+--+--+--+--+--+&#xA;|  |  |+1|x2|x2|+1|  |  |&#xA;+--+--+--+--+--+--+--+--+&#xA;|  |  |+1|x2|x2|+1|  |  |&#xA;+--+--+--+--+--+--+--+--+&#xA;|  |  |+2|+1|+1|+2|  |  |&#xA;+--+--+--+--+--+--+--+--+&#xA;|  |+1|  |  |  |  |+1|  |&#xA;+--+--+--+--+--+--+--+--+&#xA;|XX|  |  |  |  |  |  |XX|&#xA;+--+--+--+--+--+--+--+--+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For each group of four players (grouped randomly),&#xA;we run the game above with the four players starting&#xA;at the &lt;code&gt;+1&lt;/code&gt; squares near the corner with 20 dollars each.&lt;/p&gt;&#xA;&lt;p&gt;To ensure that no player is left over, each entry will&#xA;be run four times. It is possible that two or more will&#xA;compete against each other, but the grouping is random.&#xA;(The order is also random.)&lt;/p&gt;&#xA;&lt;h3&gt;Objective: Eliminate all other players.&lt;/h3&gt;&#xA;&lt;p&gt;All players that has to pay more money than they can are eliminated.&lt;/p&gt;&#xA;&lt;p&gt;(For all random numbers / choices, assume equal probability.)&lt;/p&gt;&#xA;&lt;p&gt;We choose a random position and a random number of steps&#xA;1 ~ 4, and the bot moves in that directions. The map wraps&#xA;around. Then, if the bot steps on...&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a Player: That player is eliminated instantly,&#xA;and you do not execute the current square action.&lt;/li&gt;&#xA;&lt;li&gt;someone else's Property: Pay that someone the ammount&#xA;equal to &lt;code&gt;2^rank&lt;/code&gt; dollars. &lt;code&gt;rank&lt;/code&gt; is the rank of the&#xA;property.&lt;/li&gt;&#xA;&lt;li&gt;your own Property: Choose whether to upgrade the&#xA;property rank by 1 costing you &lt;code&gt;2*2^rank&lt;/code&gt; dollars.&#xA;&lt;code&gt;rank&lt;/code&gt; is the &lt;strong&gt;current&lt;/strong&gt; rank of the property.&lt;/li&gt;&#xA;&lt;li&gt;any Utility station: get &lt;code&gt;2*rank&lt;/code&gt; dollars, and&#xA;the utility station automatically upgrades its&#xA;rank by 1.&lt;/li&gt;&#xA;&lt;li&gt;corner of Board (XX): Lose 20% of your money,&#xA;rounded down.&lt;/li&gt;&#xA;&lt;li&gt;otherwise: Do an Action.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;When you step on an empty cell (a cell not qualifying any of the above),&#xA;you can do an Action. You can either:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Build your own Property: Use 10 dollars to build a&#xA;Property right here with a random integer rank between 1 and 4.&lt;/li&gt;&#xA;&lt;li&gt;Build your own Utility: Use 2 dollars to build a&#xA;Utility station right here with a random integer rank between 1 and 4.&lt;/li&gt;&#xA;&lt;li&gt;Demolish a Square's structure. This will not demolish the bonus on the&#xA;structure (for instance &lt;code&gt;*2&lt;/code&gt; and &lt;code&gt;+1&lt;/code&gt;) and can apply to &lt;code&gt;XX&lt;/code&gt; squares.&#xA;This action has 25% probability of successing.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Demolish cost (paid even if failed):&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Property: &lt;code&gt;2*rank&lt;/code&gt; dollars. (Even if it is yours.)&lt;/li&gt;&#xA;&lt;li&gt;Utility: &lt;code&gt;rank&lt;/code&gt; dollars.&lt;/li&gt;&#xA;&lt;li&gt;Other (including &lt;code&gt;XX&lt;/code&gt;): no cost.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Bonus&lt;/h3&gt;&#xA;&lt;p&gt;Squares marked with &lt;code&gt;+1&lt;/code&gt;, &lt;code&gt;+2&lt;/code&gt;, and &lt;code&gt;*2&lt;/code&gt; have added bonus.&#xA;The operations are applied to the rank when a structure is built on&#xA;the square the bonus occupies. For instance, if a ranked 3&#xA;Utility is built on a &lt;code&gt;*2&lt;/code&gt; square, it will start at rank 6 instead.&#xA;Everything else proceeds normally.&lt;/p&gt;&#xA;&lt;h2&gt;Meta: Gimme a better name for the challenge&lt;/h2&gt;&#xA;" OwnerUserId="111945" LastEditorUserId="111945" LastEditDate="2023-05-24T23:56:33.943" LastActivityDate="2023-05-24T23:56:33.943" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25786" PostTypeId="1" CreationDate="2023-05-25T03:52:28.473" Score="6" ViewCount="126" Body="&lt;p&gt;I'd like to propose a new winning criterion: Parallelize as much as possible. A challenge of this type is to give a code that involves parallelization.&lt;/p&gt;&#xA;&lt;p&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$T\$&lt;/span&gt; be the running time when run on a single processor. Due to Amdahl's law, as there are more and more processors to be run on, the overall running time will converge to a positive value &lt;span class=&quot;math-container&quot;&gt;\$t\$&lt;/span&gt;. The submission whose the ratio &lt;span class=&quot;math-container&quot;&gt;\$t/T\$&lt;/span&gt; is the smallest shall win.&lt;/p&gt;&#xA;&lt;p&gt;What are the caveats?&lt;/p&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2023-05-25T03:58:47.823" LastActivityDate="2023-05-25T03:58:47.823" Title="Is &quot;parallelize as much as possible&quot; a valid winning criterion?" Tags="|discussion|winning-criteria|" AnswerCount="0" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25787" PostTypeId="2" ParentId="2140" CreationDate="2023-05-25T22:54:10.773" Score="1" Body="&lt;h1&gt;Output subsequent powers of two&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/261325/output-endless-powers-of-2/&quot;&gt;Output endless powers of 2&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="118038" LastEditorUserId="118038" LastEditDate="2023-05-29T15:53:52.987" LastActivityDate="2023-05-29T15:53:52.987" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="25788" PostTypeId="2" ParentId="2140" CreationDate="2023-05-26T09:07:45.403" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/261321/117478&quot;&gt;Logarithmic incrementation&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="117478" LastEditorUserId="117478" LastEditDate="2023-05-29T15:25:33.713" LastActivityDate="2023-05-29T15:25:33.713" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="25789" PostTypeId="2" ParentId="2140" CreationDate="2023-05-26T12:38:31.477" Score="0" Body="&lt;h1&gt;Trippples&lt;/h1&gt;&#xA;&lt;h2&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://boardgamegeek.com/boardgame/2040/trippples&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tripples (BGG)&lt;/a&gt; is a board game from the 1970s.&lt;/p&gt;&#xA;&lt;p&gt;It is played on an 8x8 grid, and each tile on that grid (except the corner starting tiles, and four blank tiles) contain three arrows. The three arrows each point in one of eight directions (up, down, left, right; and diagonally between those). There are therefore 56 tiles, and 56 unique combinations of arrows - so each tile is unique when placed in the correct orientation.&lt;/p&gt;&#xA;&lt;p&gt;Tiles are placed on the board, and depending on the variant of the rules being played this can either happen before the game starts (face up, either randomly or players take turns to draw and place tiles as they choose), before the game starts (face down, randomly), or over the course of the game as an alternative player action, instead of moving their playing piece.&lt;/p&gt;&#xA;&lt;p&gt;Players start in adjacent corners and attempt to cross the board to the diagonally-opposite corner before their opponents can do so.&lt;/p&gt;&#xA;&lt;p&gt;Players take turns, and may move their playing piece one square per turn. &lt;strong&gt;The interesting thing about this game is that the direction they can move is limited to the directions indicated by the arrows underneath their &lt;em&gt;opponent's&lt;/em&gt; playing piece.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The rules are ambivalent regarding how the blank pieces are treated - either you can't go there at all, you get a second move if you can go there, or (house rule) your opponent can choose to move in any direction if you land there.&lt;/p&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;(sandbox note: I discovered this game recently and thought it could be the basis for an interesting challenge - what the challenge is, though, I'm flexible on; so I'm happy to take suggestions. What is below is just one idea)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-king-of-the-hill-tooltip-container&quot;&gt;king-of-the-hill&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Competitors write bots to play against another bot, in a Trippples competition.&lt;/p&gt;&#xA;&lt;p&gt;*(sandbox query: which variant of the game rules is most interesting?)&lt;/p&gt;&#xA;&lt;p&gt;A server program will provide the board state, and the competitor bot's function should return its next move.&lt;/p&gt;&#xA;" OwnerUserId="62289" LastActivityDate="2023-05-26T12:38:31.477" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25790" PostTypeId="2" ParentId="17366" CreationDate="2023-05-28T18:08:53.717" Score="3" Body="&lt;p&gt;There is an SE site for making programming languages called &lt;a href=&quot;https://languagedesign.stackexchange.com&quot;&gt;Programming language design and implementation&lt;/a&gt;. Try asking it there.&lt;/p&gt;&#xA;" OwnerUserId="117478" LastActivityDate="2023-05-28T18:08:53.717" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25791" PostTypeId="1" AcceptedAnswerId="25795" CreationDate="2023-05-29T18:16:44.500" Score="13" ViewCount="161" Body="&lt;p&gt;I'm interested in running a KOTH in the near future. I would like the competition to be open to as many people as possible, however I know some people that are uninterested in posting answers to Stack Exchange. But I'd also be happy to run it here as well. So I'm wondering if I can host this challenge in multiple locations at the same time. All the entrants (including ones that are not posted to SE) will be competing against each other. Would this be permitted, or must challenges on this site be entirely self-contained?&lt;/p&gt;&#xA;&lt;p&gt;One concern would be to let every submission be easily visible without needing to go somewhere else to see it. So I'm planning on having every submission be visible on Github and linking that in the challenge so that anyone who wants to answer can see all the submissions so far. Would that be sufficient?&lt;/p&gt;&#xA;" OwnerUserId="31716" LastEditorUserId="31716" LastEditDate="2023-05-30T16:30:48.530" LastActivityDate="2023-05-30T16:30:48.530" Title="Can I host a competition in multiple locations?" Tags="|discussion|king-of-the-hill|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25792" PostTypeId="2" ParentId="2140" CreationDate="2023-05-29T18:18:49.263" Score="0" Body="&lt;h1&gt;Longest Tiles Combo&lt;/h1&gt;&#xA;&lt;p&gt;The New York Times has a puzzle game called  &lt;a href=&quot;https://www.nytimes.com/puzzles/tiles&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tiles&lt;/a&gt; on their website. This game consists of a grid of tiles, each made of multiple visual elements which are shared between tiles.  The player first selects two tiles which share any visual element, removing those tiles from play. If the player then selects a third tile which matches some visual element with the second, their combo increases; they can repeat this process multiple times to increase their combo.&lt;/p&gt;&#xA;&lt;p&gt;For example, take the following row:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/CdpaS.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/CdpaS.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The player could begin by selecting the middle and left tiles, which share the black middle square; they then could select the right tile, because the left and right tile share a purple square and a light blue background.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;In this challenge, the grid of tiles will be represented by a list of tuples, where each tuple contains the same number of symbols; each symbol represents a visual element on the tile. For example, the above could be encoded as&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[(&amp;quot;light blue BG&amp;quot;, &amp;quot;purple square&amp;quot;, &amp;quot;small black square&amp;quot;), &#xA; (&amp;quot;orange BG&amp;quot;, &amp;quot;purple circle&amp;quot;, &amp;quot;small black square&amp;quot;),&#xA; (&amp;quot;light blue BG&amp;quot;, &amp;quot;purple square&amp;quot;, &amp;quot;small black diamond&amp;quot;)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that for all of the tuples, the elements will be described in the same order -- e.g. the background will always be the first item in the tuple.&lt;/p&gt;&#xA;&lt;p&gt;You can decide the set of symbols which are used; in the examples below, I'll use integers instead of strings, e.g.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[(1, 2, 3), (4, 5, 3), (1, 2, 6)]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The input format is flexible; for example, since order doesn't matter, you could use a set instead of a list, and instead of tuples you could use lists, strings, or sets.&lt;/p&gt;&#xA;&lt;p&gt;Given the input as above, your goal is to output an integer indicating the &lt;em&gt;&lt;strong&gt;largest possible combo length possible&lt;/strong&gt;&lt;/em&gt;. You can assume there will be at least one matching pair of tiles -- i.e. the max combo will be at least one.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Input&lt;/th&gt;&#xA;&lt;th&gt;Output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;[(0), (0)]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;1&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;[(0), (0), (1)]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;1&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;[(2, 4), (2, 3), (2, 5)]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;2&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;[(1, 2, 3), (4, 5, 3), (1, 2, 6)]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;2&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;[(9, 1, 14), (9, 17, 5), (3, 10, 14), (0, 13, 11), (16, 13, 6)]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;2&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;[(4, 3, 1), (8, 0, 2), (7, 6, 2), (8, 6, 5), (4, 6, 2)]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;4&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;[(16, 8), (12, 8), (15, 17), (18, 5), (12, 6), (0, 5)]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;2&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;code&gt;[(5, 1), (2, 9), (3, 15), (11, 0), (5, 9), (2, 14)]&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;3&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://ato.pxeger.com/run?1=dVPLTsMwEDxw85UfWLWXmKYVjwuq1DMXQNytKEobp7WU2JbtoPZbuPQCH8XXsF4nLUglUh7e2Z2dndgfX_YQdkYfj599aOaP31fXqrPGBXCVrk3HmO67Uray87CCe1r5UAXpSysdARh_oHhQrfS0YvGz9DLgqlU-ZEi2ldml4hs4NeCcpaYLv-ubppXZSMMZm8KT1NJhMaxN5WpGT-QXobeYKhjgNRaIgSi-lA7ZbX6h9_yOwwz-UaV4QYwAjXGgQGk4D5HkFpyw8i9GLmCxdbExqST5b87U_UaC6YPtA8LyvdyYbm18DumNw7waLXMQQhWX2o7UEaKSCKfaJYkl0piFVNRZECrmd0WahkjrfU5GxWqJvOTqoHQ5DA2gGsgwFbQJpzYc0E-8Dxm5hGHiiaxj4CThF1W8ksxFZa3UdZbUz0Bgh4KzaTKrlTohcSt01b7EAE6CXxntoq6yMWf0i2NWKpy8VPvBEcS3Ybec5DAQ4F8es54NOunDaBnmiA2J35yNjHOTDr5aDQwFT2djOCLjUfkB&quot; rel=&quot;nofollow noreferrer&quot;&gt;Here's some very inefficient code to generate your own test cases.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Standard loopholes are forbidden. Since this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, the shortest program wins.&lt;/p&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2023-05-29T20:10:39.053" LastActivityDate="2023-05-29T20:10:39.053" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25794" PostTypeId="2" ParentId="6918" CreationDate="2023-05-29T20:05:40.120" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/theRealDadsdy/Desmos-Userscript/tree/main/Desmos%20Programming%20Language&quot; rel=&quot;nofollow noreferrer&quot;&gt;Desmoslang&lt;/a&gt; and Desmoslang Assembly&lt;/h1&gt;&#xA;&lt;p&gt;Desmoslang is a programming language I created. It is designed to use Desmos's capabilities. It was originally created just to see if I could make a programming language in Desmos, before I realized that it could be a decent golfing language (especially with some more built-ins). I am open to suggestions on what built-ins to add!&lt;/p&gt;&#xA;" OwnerUserId="118038" LastActivityDate="2023-05-29T20:05:40.120" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25795" PostTypeId="2" ParentId="25791" CreationDate="2023-05-30T07:56:14.470" Score="8" Body="&lt;h2&gt;Yes&lt;/h2&gt;&#xA;&lt;p&gt;But I suggest the following limitations:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There must be a (possibly external) list of all participants on all submission platforms&lt;/li&gt;&#xA;&lt;li&gt;It must be possible to submit a bot on this site only, requiring submission on some external site wouldn't be allowed. Maybe a exception for requiring a PR on github would be ok.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is intended to prevent people from simply promoting a contest here that's primarily hosted somewhere else and answers here have no real effect&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;You disclose publicly where else the KOTH is hosted&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2023-05-30T07:56:14.470" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25796" PostTypeId="2" ParentId="2140" CreationDate="2023-05-30T11:46:13.070" Score="3" Body="&lt;h1&gt;Vanilla Natural Logarithm Challenge &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-math-tooltip-container&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-number-tooltip-container&quot;&gt;number&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/106182/91213&quot;&gt;There is a challenge for multiplying two numbers so I guess this counts too&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given as input a positive real number &lt;code&gt;n&lt;/code&gt; compute its natural logarithm.&lt;/p&gt;&#xA;&lt;p&gt;Your answer should be within &lt;span class=&quot;math-container&quot;&gt;\$10^{-6}\$&lt;/span&gt; for &lt;span class=&quot;math-container&quot;&gt;\$1 \leq n \leq 10\$&lt;/span&gt; and within &lt;span class=&quot;math-container&quot;&gt;\$10^{-3}\$&lt;/span&gt; for &lt;span class=&quot;math-container&quot;&gt;\$0.1 \leq n \leq 100\$&lt;/span&gt;. You don't need to handle numbers outside this range.&lt;/p&gt;&#xA;&lt;p&gt;See &lt;a href=&quot;https://math.stackexchange.com/q/61279/1096272&quot;&gt;this thread on mathematics.se&lt;/a&gt; for various approaches to this problem. Just for inspiration, feel free to use a method not on that page.&lt;/p&gt;&#xA;&lt;p&gt;Using builtins for logarithms is discouraged but not forbidden. Consider marking your language as &amp;quot;community wiki&amp;quot; if you just use a builtin.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;x&lt;/th&gt;&#xA;&lt;th&gt;ln(x)&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;0.1&lt;/td&gt;&#xA;&lt;td&gt;-2.3025850929940455&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;0.25&lt;/td&gt;&#xA;&lt;td&gt;-1.3862943611198906&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;0.5&lt;/td&gt;&#xA;&lt;td&gt;-0.6931471805599453&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;0.75&lt;/td&gt;&#xA;&lt;td&gt;-0.2876820724517809&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;0.9&lt;/td&gt;&#xA;&lt;td&gt;-0.10536051565782628&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1.0&lt;/td&gt;&#xA;&lt;td&gt;0.0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1.3&lt;/td&gt;&#xA;&lt;td&gt;0.26236426446749106&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;0.6931471805599453&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2.718281828459045&lt;/td&gt;&#xA;&lt;td&gt;1.0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;3.141592653589793&lt;/td&gt;&#xA;&lt;td&gt;1.1447298858494002&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;td&gt;1.3862943611198906&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;5&lt;/td&gt;&#xA;&lt;td&gt;1.6094379124341003&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;7&lt;/td&gt;&#xA;&lt;td&gt;1.9459101490553132&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;10&lt;/td&gt;&#xA;&lt;td&gt;2.302585092994046&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;53&lt;/td&gt;&#xA;&lt;td&gt;3.970291913552122&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;54.59815003314423&lt;/td&gt;&#xA;&lt;td&gt;4.0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;99&lt;/td&gt;&#xA;&lt;td&gt;4.59511985013459&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;h2&gt;IO&lt;/h2&gt;&#xA;&lt;p&gt;Standard IO rules apply. Importantly, you may take input as a fraction if you prefer. You may also output as a fraction, which does not need to be fully reduced.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-05-30T12:37:14.507" LastActivityDate="2023-05-30T12:37:14.507" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="25797" PostTypeId="2" ParentId="2140" CreationDate="2023-05-31T04:21:18.157" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/261554/split-a-string-on-unnested-commas&quot;&gt;Split a string on unnested commas&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118038" LastEditorUserId="118038" LastEditDate="2023-06-05T02:20:40.733" LastActivityDate="2023-06-05T02:20:40.733" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25799" PostTypeId="2" ParentId="2140" CreationDate="2023-05-31T12:45:38.853" Score="-1" Body="&lt;h1&gt;Infinitely spew corporate B.S.&lt;/h1&gt;&#xA;&lt;p&gt;&lt;sup&gt;(Throwing a touch of shade at &lt;a href=&quot;https://meta.stackexchange.com/questions/389582/what-is-the-network-policy-regarding-ai-generated-content&quot;&gt;some&lt;/a&gt; &lt;a href=&quot;https://meta.stackexchange.com/questions/389262/ai-ml-tool-examples-part-3-title-drafting-assistant&quot;&gt;recent&lt;/a&gt; &lt;a href=&quot;https://meta.stackexchange.com/questions/389359/we-are-graduating-the-updated-button-styling-for-vote-arrows&quot;&gt;decisions&lt;/a&gt; &lt;a href=&quot;https://meta.stackexchange.com/questions/388401/new-blog-post-from-our-ceo-prashanth-community-is-the-future-of-ai&quot;&gt;made&lt;/a&gt; by StackExchange over on &lt;a href=&quot;https://meta.stackexchange.com/&quot;&gt;Mother Meta&lt;/a&gt;)&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;If you've ever read a company's announcement blog post or press release, you've likely thought to yourself &amp;quot;Wow, I couldn't understand a word of that!&amp;quot; This is the effect of a marketing technique often referred to as &amp;quot;spewing corporate B.S.&amp;quot; which, while often frustrating to read, can help you and your business dodge a lot of bullets in the P.R. department (or at least, buy yourself some time).&lt;/p&gt;&#xA;&lt;p&gt;After recent actions made by the company you work at, you've realized that  your company doesn't have time to formulate a good response to its customers' concerns—but you know just how to deal with the problem.&lt;/p&gt;&#xA;&lt;p&gt;In this challenge, your task is to write a program or function that, given no input (or a seed), infinitely writes randomized company-speak.&lt;/p&gt;&#xA;&lt;h2&gt;How to write it&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;SANDBOXING: TODO - spec out how this will work. I'm thinking that it will just choose random words from a word bank, but I should specify how grammar can work, or maybe it would make sense for the word list to be taken as input (leaning towards this)f? Please comment any suggestions.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Here are some example corporate sentences your program may write, according to the above criteria:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;We are revisiting a broader approach to improving the user-experience of  our new experiment concerning recent concern.&lt;/p&gt;&#xA;&lt;p&gt;We are excited to share a more holistic initiative to produce positive results from our new experiment.&lt;/p&gt;&#xA;&lt;p&gt;We are committed to hearing your feedback in a more positive exploration of the product.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your submission can be a full- program or a function&lt;/li&gt;&#xA;&lt;li&gt;You may return a generator that can generate sentences infinitely rather than printing.&lt;/li&gt;&#xA;&lt;li&gt;Your “randomness” doesn’t have to be evenly distributed, but there must be a non-zero chance that any possible sentence might be outputted by your submission.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;SANDBOXING: more rules&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="108687" LastActivityDate="2023-05-31T12:45:38.853" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25800" PostTypeId="2" ParentId="2140" CreationDate="2023-06-01T13:20:46.807" Score="-1" Body="&lt;h1&gt;Detect sloppy randomness&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-decision-problem-tooltip-container&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The C &lt;code&gt;rand()&lt;/code&gt; function is often implemented like so:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;static unsigned long int next = 1;&#xA;&#xA;int rand(void) // RAND_MAX assumed to be 32767&#xA;{&#xA;    next = next * 1103515245 + 12345;&#xA;    return (unsigned int)(next/65536) % 32768;&#xA;}&#xA;&#xA;void srand(unsigned int seed)&#xA;{&#xA;    next = seed;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;However this is not a very good rng and definitely not a cryptographically secure one. Your task is to write code that detects this rng.&lt;/p&gt;&#xA;&lt;p&gt;Specifically your code takes as input a sequence of 100 (or fewer if you so wish) numbers between 0 and 32767 inclusive.&lt;/p&gt;&#xA;&lt;p&gt;For a random input the code should output &amp;quot;random&amp;quot; with at least 99.9999% probability and &amp;quot;not random&amp;quot; with at most 0.0001% probability (one in a million).&lt;/p&gt;&#xA;&lt;p&gt;However if the input is generated using (successive calls to) rand then your code must output &amp;quot;not random&amp;quot; always.&lt;/p&gt;&#xA;&lt;p&gt;Also, your code must be fast. Specifically it should run in under a second. Output as per standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-decision-problem-tooltip-container&quot;&gt;decision-problem&lt;/a&gt; rules.&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;p&gt;Should I use a 64-bit rng? Solutions in fast languages can probably just brute force the 31-bit state. This would also allow to relax the time requirements.&lt;/p&gt;&#xA;" OwnerUserId="84290" LastActivityDate="2023-06-01T13:20:46.807" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25801" PostTypeId="2" ParentId="20722" CreationDate="2023-06-01T16:18:44.883" Score="1" Body="&lt;h2&gt;My name was a random string of words (The Empty String Photographer) somewhat related to programming that was very clever.&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/fEyKH.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/fEyKH.jpg&quot; alt=&quot;Monkey on stage&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;For the profile picture, I like monkeys, so I took a nice shot of a plush toy using portrait mode on Iphone.&lt;/h2&gt;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;&lt;p&gt; &lt;a href=&quot;https://i.stack.imgur.com/SHys8.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/SHys8.jpg&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&#xA; &lt;br/&gt;&#xA; You monster! You made monkey sad!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="117478" LastEditorUserId="117478" LastEditDate="2024-01-19T11:37:59.963" LastActivityDate="2024-01-19T11:37:59.963" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25802" PostTypeId="2" ParentId="2140" CreationDate="2023-06-01T17:02:43.217" Score="-4" Body="&lt;h1&gt;You're a programming language, right?&lt;/h1&gt;&#xA;&lt;p&gt;According to CGCC, for something to be considered a programming language, it must be capable of addition and primality testing. This challenge combines them into one.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;You must write a programme that takes 2 natural numbers (including 0) as input, checks if the sum of the numbers is prime, and prints the result. Input and output may be in any reasonable format.&lt;/p&gt;&#xA;&lt;h3&gt;Testcases:&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;2,3 -&amp;gt; True&#xA;3,6 -&amp;gt; False&#xA;0,1 -&amp;gt; False (1 is not prime by definition)&#xA;7,6 -&amp;gt; True&#xA;37,81 -&amp;gt; False&#xA;37,82 -&amp;gt; False&#xA;1,1 -&amp;gt; True&#xA;5,8 -&amp;gt; True&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that &lt;code&gt;True&lt;/code&gt; and &lt;code&gt;False&lt;/code&gt; can be substituted with another reasonable representation, like &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt;, or &lt;code&gt;T&lt;/code&gt; and &lt;code&gt;F&lt;/code&gt;. Remember, this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; rules apply.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-math-tooltip-container&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="117478" LastActivityDate="2023-06-01T17:02:43.217" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25803" PostTypeId="2" ParentId="2140" CreationDate="2023-06-01T18:33:39.727" Score="4" Body="&lt;h1&gt;Reversed squares&lt;/h1&gt;&#xA;&lt;p&gt;Given an integer n, your task is to determine whether it is a perfect square that when reversed,, is still a perfect square. You may assume n is always positive.&lt;/p&gt;&#xA;&lt;p&gt;When numbers such as 100 (10x10) are reversed the result may have leading zeros (001) In this case, ignore the leading zeros and treat it as 1 (1x1).&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 =&amp;gt; True&#xA;4 =&amp;gt; True&#xA;9 =&amp;gt; True&#xA;441 =&amp;gt; True&#xA;1234567654321 =&amp;gt; True&#xA;100 =&amp;gt; True&#xA;&#xA;3 =&amp;gt; False&#xA;25 =&amp;gt; False&#xA;1784 =&amp;gt; False&#xA;&lt;span class=&quot;math-container&quot;&gt;```&lt;/span&gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2023-06-02T20:15:37.003" LastActivityDate="2023-06-02T20:15:37.003" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25804" PostTypeId="1" CreationDate="2023-06-02T18:10:05.403" Score="1" ViewCount="93" Body="&lt;p&gt;Most golfing languages that are competitive today use at least one string compression algorithm. My language Fig has a compressor that resembles Jelly's. I use been planning to add a super secret feature to it to make it better, however life got in the way.&lt;/p&gt;&#xA;&lt;p&gt;Putting that aside, my failed attempt has made me wonder how compressed strings can get. Therefore, I propose &lt;s&gt;outsourcing my problem&lt;/s&gt; creating an event where we can competitively write string compressors. I and one or two other judges will choose a few secret strings with which to test the compressors y'all submit. It may contain words, random sequences, repeating sequences, etc.      We will hive a hint as to their content before the event starts. Then, y'all will have a few weeks to write a string compressor. Then, the judges will test the compressors on all the strings, and the one with the best average compression ratio wins.&lt;/p&gt;&#xA;&lt;p&gt;This is just a rough outline to get discussion started. I have already proposed this in chat with a few positive replies. The guidelines are intentionally vague, and &lt;em&gt;will&lt;/em&gt; change if we decide to do this. What do y'all think?&lt;/p&gt;&#xA;" OwnerUserId="107299" LastActivityDate="2023-06-02T18:37:04.797" Title="Event Suggestion: Compression Golf" Tags="|discussion|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25805" PostTypeId="2" ParentId="25804" CreationDate="2023-06-02T18:37:04.797" Score="11" Body="&lt;h2&gt;Isn't this just a challenge?&lt;/h2&gt;&#xA;&lt;p&gt;As far as I can tell, this is less of an event, and more of just a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-compression-tooltip-container&quot;&gt;compression&lt;/a&gt; challenge, akin to &lt;a href=&quot;https://codegolf.stackexchange.com/q/4771/66833&quot;&gt;this decade-old one&lt;/a&gt;. Events, especially chat events, tend to be on-going things that can be repeated along a theme (see &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/23738/chat-event-learn-a-lang&quot;&gt;Learn-a-lang&lt;/a&gt; or &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/22276/introducing-biweekly-mini-golf&quot;&gt;BMG&lt;/a&gt;). This would just be a one-off thing over a couple of weeks or so - which is just a challenge.&lt;/p&gt;&#xA;&lt;p&gt;As for judges, I feel that part is unnecessary as either an event or a challenge. Simply choose a few set strings beforehand, and share some hash of the strings that can be used to verify that the strings are identical when revealed after scoring&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2023-06-02T18:37:04.797" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25806" PostTypeId="2" ParentId="2140" CreationDate="2023-06-03T01:08:14.520" Score="11" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/268947/66833&quot;&gt;Construct this point&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2024-01-02T10:11:07.417" LastActivityDate="2024-01-02T10:11:07.417" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25807" PostTypeId="1" AcceptedAnswerId="25842" CreationDate="2023-06-03T16:29:44.510" Score="-1" ViewCount="139" Body="&lt;p&gt;If we have a code-golf question that we have a golfed answer to in, say, Python, how long does that program have to be for it to not be a good idea to ask that question/for that to be code-golf (if there is a cut-off at all)?&lt;/p&gt;&#xA;" OwnerUserId="118038" LastActivityDate="2023-06-30T11:50:47.640" Title="Maximum code-golf length" Tags="|discussion|code-golf|asking-questions|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25808" PostTypeId="2" ParentId="2140" CreationDate="2023-06-06T12:52:58.213" Score="1" Body="&lt;h1&gt;Print every finite string&lt;/h1&gt;&#xA;&lt;p&gt;In this challenge, you're given the task to create a full program that generates and prints strings indefinitely. The strings must be printed on separate lines, and every finite string must (theoretically) be printed in finite time.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Your submission must be a full program, not a function.&lt;/li&gt;&#xA;&lt;li&gt;You must output the strings to STDOUT.&lt;/li&gt;&#xA;&lt;li&gt;There should be a single line feed between each string.&lt;/li&gt;&#xA;&lt;li&gt;A string is a sequence of printable ASCII characters (0x20-0x7e, inclusive). You may also include any number of null-terminators (0x0), EOFs (0xff) or other zero-space characters.&lt;/li&gt;&#xA;&lt;li&gt;The algorithm used must theoretically print any finite string in finite time. In practice, however, your program may fail after having printed at least 65535 strings.&lt;/li&gt;&#xA;&lt;li&gt;No string can be printed twice. Zero-space characters don't count as part of the string, so the program cannot output both &lt;code&gt;Hello&lt;/code&gt; and &lt;code&gt;Hello(EOF)&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The empty string may or may not be generated.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Valid strings:&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;Hello&#xA;AAAA&#xA;(space)&#xA;Hello(EOF)&#xA;Hello, World!&#xA;&amp;quot;#(){ :|~A&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Invalid strings:&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;(tab)&#xA;(newline)&#xA;ë&#xA;ñ&#xA;ø&#xA;π&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in each language wins!&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-string-tooltip-container&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;generation&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;generation&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-generation-tooltip-container&quot;&gt;generation&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="108622" LastEditorUserId="108622" LastEditDate="2023-06-07T09:01:55.230" LastActivityDate="2023-06-07T09:01:55.230" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25809" PostTypeId="1" CreationDate="2023-06-09T00:19:10.633" Score="-6" ViewCount="209" Body="&lt;p&gt;The Zen of Python&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Sparse is better than dense.&#xA;Readability counts.&#xA;...&#xA;If the implementation is hard to explain, it's a bad idea.&#xA;If the implementation is easy to explain, it may be a good idea.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;As the Zen of Python, Python is meant to be readable and easy to understand, but many of the Python code golf answers are not this. They do not follow best practices like spaces around operators and stuff like that. I'm not complaining but I want to know what everyone thinks:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Is Code Golf ruining the point of Python?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="118193" LastEditorUserId="46076" LastEditDate="2023-06-20T02:36:39.887" LastActivityDate="2023-06-24T10:24:11.737" Title="Why do I feel like Code Golf is ruining the point of Python?" Tags="|discussion|code-golf|" AnswerCount="2" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25810" PostTypeId="1" CreationDate="2023-06-09T00:51:36.610" Score="8" ViewCount="160" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/261577/668&quot;&gt;&lt;strong&gt;Posting in question&lt;/strong&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Apparently 4 people have voted to close this, but not one of them thought to leave a comment.&lt;/p&gt;&#xA;&lt;p&gt;Let’s say it gets another vote and gets closed. What do you expect the author to do? Take a guess at what detail you thought was missing and resubmit? What about the already submitted answers?&lt;/p&gt;&#xA;&lt;p&gt;I’m really not sure I understand the logic here.&lt;/p&gt;&#xA;" OwnerUserId="668" LastActivityDate="2023-06-09T00:51:36.610" Title="What’s the point of voting to close for “Needs details or clarity” without telling the author what detail or clarity it needs?" Tags="|discussion|close-reasons|" AnswerCount="0" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25811" PostTypeId="2" ParentId="25809" CreationDate="2023-06-09T01:55:07.370" Score="10" Body="&lt;p&gt;The &lt;em&gt;whole point&lt;/em&gt; of Code Golf is for code to be short. That means Unnecessary™ stuff like &amp;quot;spaces around operators&amp;quot; is omitted. You are correct, golfed code is often horribly unreadable, but that's that whole point of the game. If you are looking for code snippets to use in your program, this is not the place (ok, maybe except APL). Nobody golfs code in production &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/25809/why-do-i-feel-like-code-golf-is-ruining-the-point-of-python#comment80021_25811&quot;&gt;anymore&lt;/a&gt;, so there's no harm coming to Python.&lt;/p&gt;&#xA;" OwnerUserId="107299" LastEditorUserId="107299" LastEditDate="2023-06-09T17:42:32.773" LastActivityDate="2023-06-09T17:42:32.773" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25813" PostTypeId="2" ParentId="2140" CreationDate="2023-06-09T19:45:12.960" Score="2" Body="&lt;h1&gt;Finitely generated subgroups of free groups&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/mathematics&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;mathematics&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;mathematics&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-mathematics-tooltip-container&quot;&gt;mathematics&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/abstract-algebra&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;abstract-algebra&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;abstract-algebra&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-abstract-algebra-tooltip-container&quot;&gt;abstract-algebra&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-decision-problem-tooltip-container&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Suppose you are given the free group &lt;span class=&quot;math-container&quot;&gt;\$F_n\$&lt;/span&gt; on &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; generators&lt;span class=&quot;math-container&quot;&gt;\${}^1\$&lt;/span&gt;, a finite subset &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; of &lt;span class=&quot;math-container&quot;&gt;\$F_n\$&lt;/span&gt;, and an element &lt;span class=&quot;math-container&quot;&gt;\$x \in F_n\$&lt;/span&gt;.  Then there is an algorithm to determine whether &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; is in the subgroup generated&lt;span class=&quot;math-container&quot;&gt;\${}^2\$&lt;/span&gt; by &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;, as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Start with a directed graph with a single &amp;quot;base&amp;quot; vertex, and no edges.&lt;/li&gt;&#xA;&lt;li&gt;For each element of &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;, add a cycle to the graph according to the corresponding free group word.  Start at the base vertex; for each generator &lt;span class=&quot;math-container&quot;&gt;\$g_n\$&lt;/span&gt; in the word, add an arrow labelled by &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;; for each inverse of a generator &lt;span class=&quot;math-container&quot;&gt;\$g_n^{-1}\$&lt;/span&gt; in the word, add an arrow in the opposite direction labelled by &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;; and end at the base vertex.&lt;/li&gt;&#xA;&lt;li&gt;If there is a pair of edges with the same label and with either the same source or the same destination, merge those two edges and the two vertices at the other end.  (Except that merging two vertices is not necessary if the two edges have the same source and the same destination.)&lt;/li&gt;&#xA;&lt;li&gt;Iterate the previous step until there is no such pair of edges left.&lt;/li&gt;&#xA;&lt;li&gt;Now follow the graph from the base vertex, according to the reduced free group word corresponding to &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;.  For each generator &lt;span class=&quot;math-container&quot;&gt;\$g_n\$&lt;/span&gt; in the word, look for an edge with source at the current vertex and label &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, and move to the destination of that edge.  For each generator &lt;span class=&quot;math-container&quot;&gt;\$g_n^{-1}\$&lt;/span&gt; in the word, look for an edge with target at the current vertex and label &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, and move to the source of that edge.&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If at any point, you do not find such an edge, then &lt;span class=&quot;math-container&quot;&gt;\$x \notin \langle S \rangle\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If at the end, you end up back at the base vertex, then &lt;span class=&quot;math-container&quot;&gt;\$x \in \langle S \rangle\$&lt;/span&gt;; otherwise, &lt;span class=&quot;math-container&quot;&gt;\$x \notin \langle S \rangle\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;(I plan to give an example of the operation of this algorithm; but I do not have time at the moment to generate the required graph diagrams.)&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Your task is: given a finite subset &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; of a free group &lt;span class=&quot;math-container&quot;&gt;\$F_n\$&lt;/span&gt; and an element &lt;span class=&quot;math-container&quot;&gt;\$x \in F_n\$&lt;/span&gt;, determine whether &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; is in the subgroup generated by &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;.  (Note: we are &lt;em&gt;not&lt;/em&gt; asking to determine whether &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; is in the &lt;em&gt;normal&lt;/em&gt; subgroup generated by &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;; that problem is undecidable in general.)&lt;/p&gt;&#xA;&lt;p&gt;You are not required to use the above algorithm.  On the other hand, your program or function must always terminate in finite time; so for example, that rules out a naive algorithm just taking all possible products of elements of &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; and their inverses and determining whether you eventually find &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; in the output.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;You will be given a list of free group elements, and a second input giving another free group element.  Possible input formats for free group elements include:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;An element of a built-in free group type.&lt;/li&gt;&#xA;&lt;li&gt;A string in the form &lt;code&gt;abCbcA&lt;/code&gt; where the generators are &lt;code&gt;a&lt;/code&gt; through &lt;code&gt;z&lt;/code&gt; and for example &lt;code&gt;C&lt;/code&gt; represents the inverse of the generator &lt;code&gt;c&lt;/code&gt;.  You may assume the string is in reduced form, so for example it will not contain either &lt;code&gt;Cc&lt;/code&gt; or &lt;code&gt;cC&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If you like, you could also take a single list of free group elements, and use the first element as &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; and the rest of the list as &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If it is useful, you may assume the list of subgroup generators is nonempty, and also that &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; and each element of the list is not the empty word.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;A truthy/falsey value according to whether or not &lt;span class=&quot;math-container&quot;&gt;\$x \in \langle S \rangle\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; is the set of elements of the list for the first input and &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; is the second input.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;[aa, ab], a -&amp;gt; False&#xA;[aa, ab], ba -&amp;gt; False&#xA;[aa, ab], Ba -&amp;gt; True&#xA;[aBc, bc], aBBCbA -&amp;gt; True&#xA;[aBc, bc], abc -&amp;gt; False&#xA;[aaaaa, aaa], a -&amp;gt; True&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Score&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;: the shortest code in bytes for any given programming language wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\${}^1\$&lt;/span&gt; The free group &lt;span class=&quot;math-container&quot;&gt;\$F_n\$&lt;/span&gt; on &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; generators can be described as the reduced words in the alphabet consisting of formal symbols &lt;span class=&quot;math-container&quot;&gt;\$g_1, g_1^{-1}, g_2, g_2^{-1}, \ldots, g_n, g_n^{-1}\$&lt;/span&gt;.  Here, &amp;quot;reduced&amp;quot; means that &lt;span class=&quot;math-container&quot;&gt;\$g_i\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$g_i^{-1}\$&lt;/span&gt; never appear next to each other in the word.  To multiply two words, concatenate them and then iteratively cancel out pairs &lt;span class=&quot;math-container&quot;&gt;\$g_i g_i^{-1}\$&lt;/span&gt; or &lt;span class=&quot;math-container&quot;&gt;\$g_i^{-1} g_i\$&lt;/span&gt; in the middle.  This has the empty word as an identity element, and to find the inverse of a reduced word, reverse the order and transform each &lt;span class=&quot;math-container&quot;&gt;\$g_i\$&lt;/span&gt; into &lt;span class=&quot;math-container&quot;&gt;\$g_i^{-1}\$&lt;/span&gt; and vice versa.&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\${}^2\$&lt;/span&gt; The subgroup of &lt;span class=&quot;math-container&quot;&gt;\$F_n\$&lt;/span&gt; generated by a subset &lt;span class=&quot;math-container&quot;&gt;\$S \subseteq F_n\$&lt;/span&gt; is the smallest subset of &lt;span class=&quot;math-container&quot;&gt;\$F_n\$&lt;/span&gt; which contains &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;, also contains the identity element, and is closed under multiplication and inverses.  This can alternately be described as the set of elements of &lt;span class=&quot;math-container&quot;&gt;\$F_n\$&lt;/span&gt; which can be formed as the product of some finite sequence of elements of &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;, and/or their inverses.&lt;/p&gt;&#xA;" OwnerUserId="73487" LastEditorUserId="73487" LastEditDate="2023-06-09T20:48:58.827" LastActivityDate="2023-06-09T20:48:58.827" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25814" PostTypeId="2" ParentId="2140" CreationDate="2023-06-10T02:38:51.673" Score="-4" Body="&lt;h1&gt;ChatGPT Prompt Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Since clever prompting will become an art comparable to the art of programming it might be time to start with some prompt challenges that come closest to programming. It's about forcing ChatGPT to give specific answers or to perform specific tasks by shortest-possible prompts. As a general requirement the prompts should be human-understandable and be answered by humans identically or similarily.&lt;/p&gt;&#xA;&lt;h2&gt;Samples&lt;/h2&gt;&#xA;&lt;h3&gt;Find the shortest prompt that ChatGPT just repeats.&lt;/h3&gt;&#xA;&lt;p&gt;Since ChatGPT operates stochastically we never can be sure if in the 101th regeneration of a response it will respond differently, so a decent criterion for &amp;quot;just repeats&amp;quot; must be established here.&lt;/p&gt;&#xA;&lt;h3&gt;Find the minimal number of words to be changed in prompt X to let ChatGPT perform task Y.&lt;/h3&gt;&#xA;&lt;p&gt;Consider X = &lt;code&gt;&amp;quot;Saying with fewer words is the task of producing a shorter version of a document while preserving its important information. Some models can extract text from the original input, while other models can generate entirely new text.&amp;quot;&lt;/code&gt; The task that ChatGPT reliably performs on this prompt is confirming and elaborating on it. By inserting two words you can force ChatGPT to summarize this prompt (Y = summarization)&lt;/p&gt;&#xA;" OwnerUserId="98413" LastActivityDate="2023-06-10T02:38:51.673" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="25815" PostTypeId="2" ParentId="2140" CreationDate="2023-06-13T14:14:20.093" Score="3" Body="&lt;h1&gt;Lowest digit addition generator&lt;/h1&gt;&#xA;&lt;p&gt;A &lt;em&gt;digit addition generator&lt;/em&gt; of an integer &lt;code&gt;n&lt;/code&gt; is any integer &lt;code&gt;x&lt;/code&gt; that satisfy the equation &lt;code&gt;x + s(x) = n&lt;/code&gt;, with &lt;code&gt;s(x)&lt;/code&gt; being the sum of the digits of &lt;code&gt;x&lt;/code&gt;. (We will work under base 10 for convenience.)&lt;/p&gt;&#xA;&lt;p&gt;For example, a digit addition generator for &lt;code&gt;29&lt;/code&gt; would be &lt;code&gt;19&lt;/code&gt;, because &lt;code&gt;19 + (1 + 9) = 29&lt;/code&gt;. Some numbers have more than one generator. An example might be &lt;code&gt;216&lt;/code&gt;, which has generators of &lt;code&gt;198&lt;/code&gt; and &lt;code&gt;207&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your objective is to generate the &lt;strong&gt;lowest&lt;/strong&gt; digit addition generator of every non-negative integer &lt;code&gt;n&lt;/code&gt;, and output &lt;em&gt;anything other than a non-negative integer&lt;/em&gt; if there is none for &lt;code&gt;n&lt;/code&gt;.&#xA;The non-negative terms in your result should match the sequence &lt;a href=&quot;https://oeis.org/A096234&quot; rel=&quot;nofollow noreferrer&quot;&gt;A096234&lt;/a&gt;. You may find &lt;a href=&quot;https://arxiv.org/pdf/2112.14365.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;this paper&lt;/a&gt; related to the challenge.&lt;/p&gt;&#xA;&lt;p&gt;Fewest bytes win; standard rules apply.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-sequence-tooltip-container&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="118340" LastEditorUserId="118340" LastEditDate="2023-06-15T06:41:47.230" LastActivityDate="2023-06-15T06:41:47.230" CommentCount="11" ContentLicense="CC BY-SA 4.0" />
  <row Id="25816" PostTypeId="2" ParentId="2140" CreationDate="2023-06-14T18:59:06.780" Score="-2" Body="&lt;h1&gt;Print the input times infinity&lt;/h1&gt;&#xA;&lt;p&gt;Make a program/function that prints the input of the function infinite times, separated be a line break. Do note that the output must be to stdout.&lt;br /&gt;&#xA;tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="118038" LastActivityDate="2023-06-14T18:59:06.780" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25817" PostTypeId="2" ParentId="2140" CreationDate="2023-06-14T21:49:16.627" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/262623/81203&quot;&gt;Compute the maximal Ducci period&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="81203" LastEditorUserId="81203" LastEditDate="2023-07-11T06:37:41.457" LastActivityDate="2023-07-11T06:37:41.457" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25818" PostTypeId="2" ParentId="2140" CreationDate="2023-06-16T20:05:22.587" Score="2" Body="&lt;h2&gt;A Phinary Library&lt;/h2&gt;&#xA;&lt;p&gt;I've been away from SE/SO for quite some time now and have decided to revisit a SE that I used to go on way before I made this account, so I wanted to draft a challenge that I have had rolling around in my head for a bit, fitting the tags &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/numbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;numbers&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;numbers&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-numbers-tooltip-container&quot;&gt;numbers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/data-structures&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;data-structures&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;data-structures&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-data-structures-tooltip-container&quot;&gt;data-structures&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Knowing what base phi/'phinary' numbers are, as explained in the background to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/37869/standardise-a-phinary-number&quot;&gt;this challenge&lt;/a&gt; and in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/204185/base-phi-converter-time&quot;&gt;this one too&lt;/a&gt;, your task is to implement a set of arithmetic routines/functions that handle this numeric system, at least for addition and subtraction of two phinary numbers from each other.&lt;/p&gt;&#xA;&lt;p&gt;You will need to write code that performs the following three operations:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;A chunk that adds two phinary numbers&lt;/li&gt;&#xA;&lt;li&gt;A chunk that subtracts two phinary numbers&lt;/li&gt;&#xA;&lt;li&gt;A chunk that outputs a phinary number in standard form&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;I'm refraining from calling them functions or whatnot, as you are totally free to organise your code in any way you see fit.&lt;/p&gt;&#xA;&lt;p&gt;You may take &lt;em&gt;normalised phinary&lt;/em&gt; input via whatever way you choose (hardcoded into ROM, through &lt;code&gt;stdin&lt;/code&gt;, whatever) and in whatever format (for example, you can encode whether it's addition or subtraction in the input itself) and print (or output in some other way) the &lt;em&gt;normalised&lt;/em&gt; phinary result.&lt;/p&gt;&#xA;&lt;p&gt;Do not use built-in base conversion facilities, the arithmetic has to be done directly in phinary. The intermediate phinary can be &amp;quot;unstandardised&amp;quot;: only the input and output must be in normal form.&lt;/p&gt;&#xA;&lt;p&gt;See the following test cases for some examples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;INPUT             OUTPUT&#xA;----------------------------&#xA;10000.0001&#xA;         +&#xA;    100.01    =   10100.0101 &#xA;----------------------------&#xA; 1010.0001&#xA;         -&#xA;      10.0    =    1000.0001&#xA;----------------------------&#xA;      10.1&#xA;         +&#xA;  1000.001    =     1010.101&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your code should handle and be correct for arbitrary sized phinary input. If your language has a specific size limit (such as old Befunge, or you're writing 6502 assembly code), you should handle inputs that are at least 33% of the space constraint in size (so, 21626 digits for 6502 assembly, for example).&lt;/p&gt;&#xA;&lt;p&gt;The shortest code in bytes wins. If your code is textual source, bytes are counted according to UTF-8 encoding sizes.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Things I'm still not sure about&lt;/h2&gt;&#xA;&lt;p&gt;What other limits should I impose?&lt;br /&gt;&#xA;How should I better formulate the challenge?&lt;/p&gt;&#xA;" OwnerUserId="118367" LastActivityDate="2023-06-16T20:05:22.587" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25820" PostTypeId="2" ParentId="2140" CreationDate="2023-06-20T22:32:23.890" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/262268/detect-maxima-using-persistent-homology&quot;&gt;Detect Maxima Using Persistent Homology&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="73054" LastEditorUserId="73054" LastEditDate="2023-06-27T20:44:11.693" LastActivityDate="2023-06-27T20:44:11.693" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25821" PostTypeId="2" ParentId="2140" CreationDate="2023-06-21T06:42:08.290" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/262140/xor-of-independent-bernoulli-variables&quot;&gt;XOR of independent Bernoulli variables&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2023-06-24T04:09:52.200" LastActivityDate="2023-06-24T04:09:52.200" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25822" PostTypeId="2" ParentId="2140" CreationDate="2023-06-21T19:58:31.160" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/262205/output-each-second/&quot;&gt;Output every second&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118038" LastEditorUserId="118038" LastEditDate="2023-06-26T05:01:58.347" LastActivityDate="2023-06-26T05:01:58.347" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25823" PostTypeId="2" ParentId="2140" CreationDate="2023-06-23T13:11:22.780" Score="0" Body="&lt;h1&gt;What is possible with all these blocks?&lt;/h1&gt;&#xA;&lt;p&gt;In this challenge, you will write code (in any way) that outputs the number of permutations of all sub-tuples of a tuple of length &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; (also &lt;a href=&quot;https://oeis.org/A000522&quot; rel=&quot;nofollow noreferrer&quot;&gt;A000522&lt;/a&gt;(n) ). Here’s an example:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;You have three blocks. You can start by counting how many arrangements of three blocks are possible (6). Then, work out how many ways there are to arrange two blocks (2) and multiply that by the number of unique pairs of blocks you can pick from the three blocks (3) to get the sub-answer (6). Then, work out how many ways you can arrange 1 object (1) and multiply that by the number of unique blocks you can pick from the three blocks (3) to get the sub-answer (3). Then, remember the number of empty combinations (1). Add those together to get the answer (16).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This is code golf, so shortest answer wins!&lt;/p&gt;&#xA;" OwnerUserId="117478" LastEditorUserId="117478" LastEditDate="2023-06-24T10:25:04.963" LastActivityDate="2023-06-24T10:25:04.963" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25825" PostTypeId="2" ParentId="25809" CreationDate="2023-06-24T10:24:11.737" Score="2" Body="&lt;h2&gt;We don't care about programming conventions.&lt;/h2&gt;&#xA;&lt;p&gt;We only care about how short the code is.&lt;/p&gt;&#xA;" OwnerUserId="117478" LastActivityDate="2023-06-24T10:24:11.737" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25826" PostTypeId="1" CreationDate="2023-06-26T07:08:38.477" Score="1" ViewCount="208" Body="&lt;p&gt;The &lt;a href=&quot;https://desmos.com/calculator&quot; rel=&quot;nofollow noreferrer&quot;&gt;Desmos Graphing Calculator&lt;/a&gt;, or Desmos, has &lt;a href=&quot;https://help.desmos.com/hc/en-us/articles/202529069-Sliders-and-Movable-Points&quot; rel=&quot;nofollow noreferrer&quot;&gt;sliders&lt;/a&gt;, which can run, animating a graph.&lt;br /&gt;&#xA;Also, they can have multiple animation modes: (default) loop forwards an backwards, repeat in one direction, play once, play indefinitely.&lt;br /&gt;&#xA;In addition, they can have multiple playback speeds, ranging from 0.05x to 20x (a total of 16).&lt;br /&gt;&#xA;But, as it currently is, people are reluctant to use this great tool in code-golf answers, as the scoring of an active slider is yet undecided.&lt;/p&gt;&#xA;&lt;p&gt;So, what do you guys think? How many bytes/bits should it be to have a running slider, different animation mode, or different playback speed (if they should be allowed)&lt;/p&gt;&#xA;" OwnerUserId="118038" LastEditorUserId="118038" LastEditDate="2023-06-26T07:49:33.653" LastActivityDate="2023-06-27T18:18:32.490" Title="Desmos Active Sliders" Tags="|discussion|scoring|" AnswerCount="4" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25827" PostTypeId="2" ParentId="25826" CreationDate="2023-06-26T07:48:00.907" Score="-2" Body="&lt;p&gt;My proposal is thus: having a slider run is one bit, because each slider is either running not. Also, having a non-default animation mode is 2 bits, because there are four modes. In addition, having a non-default playback speed is 4 bits, as there is 16 possibilities.&lt;/p&gt;&#xA;" OwnerUserId="118038" LastActivityDate="2023-06-26T07:48:00.907" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25828" PostTypeId="2" ParentId="17587" CreationDate="2023-06-26T08:19:58.697" Score="0" Body="&lt;h1&gt;Color should be the minimum number of bits needed&lt;/h1&gt;&#xA;&lt;p&gt;If no colors are defined in the code, that would be 6 options, minimally represented in 3 bits. If more than two and at most 10 colors are defined. then each expression with a color chosen would have a penalty of 4 bits. With more than 10 colors, and at most 26 colors, the penalty would be 5 bits, and so on.&lt;/p&gt;&#xA;" OwnerUserId="118038" LastActivityDate="2023-06-26T08:19:58.697" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25829" PostTypeId="2" ParentId="25826" CreationDate="2023-06-26T08:53:34.213" Score="3" Body="&lt;h1&gt;If it can't be coded, it isn't valid as an answer to a coding challenge&lt;/h1&gt;&#xA;&lt;p&gt;If the positions of the sliders (or buttons, or whatever) can be encoded so that they don't need to be manually slid, then just count the bytes of code needed.&#xA;If they can't be written as code, then they probably aren't very well suited to a coding challenge, and their use shouldn't be allowed.&lt;/p&gt;&#xA;&lt;p&gt;See also &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17592/95126&quot;&gt;this answer&lt;/a&gt; which similarly tackles the issue of setting colours.&lt;/p&gt;&#xA;&lt;p&gt;Note that using sliders (or buttons, or whatever) is probably Ok as input (since the input isn't part of the code).&lt;/p&gt;&#xA;" OwnerUserId="95126" LastActivityDate="2023-06-26T08:53:34.213" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25830" PostTypeId="2" ParentId="25826" CreationDate="2023-06-26T18:31:33.503" Score="1" Body="&lt;h1&gt;Using graph states (not recommended, would cost huge amounts of bytes)&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;As this would cost a lot of bytes if this were to be implemented, I would not recommend this unless there is no other way found.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;In Desmos, you can obtain the state of the graph by going into the console (this can be achieved by pressed control + shift + i on Chrome, for instance), and typing &lt;code&gt;Calc.getState()&lt;/code&gt; into the console. This will return the json of every single customizable setting in a Desmos graph, including slider settings, colors, tables, graph settings such as min and max bounds and gridline patterns, and much more.&lt;/p&gt;&#xA;&lt;p&gt;Then, you can utilize the &lt;code&gt;Calc.setState()&lt;/code&gt; function in the console and inputting the json corresponding to your desired graph, which will change the current graph you have to match the specifications of the json inputted into the &lt;code&gt;setState()&lt;/code&gt; function.&lt;/p&gt;&#xA;&lt;p&gt;While this is a reproducible and easy way to encode any sort of Desmos graph, this would cost a huge amount of bytes to existing answers which use sliders, colors, and other similar functionalities, as these json are HUGE. I have messed around with &lt;code&gt;Calc.setState()&lt;/code&gt; a bit and have realized that portions of the json outputted from &lt;code&gt;Calc.getState()&lt;/code&gt; aren't required to get it working in &lt;code&gt;Calc.setState()&lt;/code&gt;, but it would still cost a lot of bytes compared to existing answers.&lt;/p&gt;&#xA;&lt;p&gt;I do have to mention that there is a &lt;code&gt;Calc.getExpressions()&lt;/code&gt; and a &lt;code&gt;Calc.setExpressions()&lt;/code&gt; as well, and they seem to cover most of the things like sliders, colors, tables, etc., but not graph settings like min and max bounds. Even then, it costs a lot of bytes just for one expression.&lt;/p&gt;&#xA;&lt;p&gt;Another issue I have with this is that using the json won't really be &amp;quot;pure&amp;quot; Desmos anymore, as it requires the usage of the console in order to set everything up. But the &lt;code&gt;Calc.setState()&lt;/code&gt;, &lt;code&gt;Calc.getState()&lt;/code&gt;, and the other functions are technically specified in the &lt;a href=&quot;https://www.desmos.com/api/v1.8/docs/index.html#document-saving-and-loading&quot; rel=&quot;nofollow noreferrer&quot;&gt;Desmos API&lt;/a&gt;, even though they probably weren't intended to be accessed through the console on the website itself. With that in mind, if this were to be implemented, I think the language won't really be just plain Desmos anymore, but instead something like Desmos + Javascript, or Desmos API, or Desmos + JSON, or something else entirely.&lt;/p&gt;&#xA;" OwnerUserId="96039" LastActivityDate="2023-06-26T18:31:33.503" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25831" PostTypeId="2" ParentId="2140" CreationDate="2023-06-27T02:55:06.517" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/262763/reverse-conways-game-of-life&quot;&gt;Reverse Conway&amp;#39;s Game of Life&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="112488" LastEditorUserId="112488" LastEditDate="2023-07-13T16:42:43.690" LastActivityDate="2023-07-13T16:42:43.690" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25832" PostTypeId="2" ParentId="2140" CreationDate="2023-06-27T04:54:45.703" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/263283/meta-cat-program&quot;&gt;Meta-cat program&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118038" LastEditorUserId="118038" LastEditDate="2023-07-25T03:17:27.810" LastActivityDate="2023-07-25T03:17:27.810" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="25833" PostTypeId="2" ParentId="25826" CreationDate="2023-06-27T18:18:32.490" Score="0" Body="&lt;h1&gt;No extra cost&lt;/h1&gt;&#xA;&lt;p&gt;Just like flags in many languages!&lt;/p&gt;&#xA;" OwnerUserId="117478" LastActivityDate="2023-06-27T18:18:32.490" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25834" PostTypeId="2" ParentId="2140" CreationDate="2023-06-27T18:19:01.790" Score="1" Body="&lt;h2&gt;Counting black and white piano keys&lt;/h2&gt;&#xA;&lt;p&gt;Given a major or minor triad (3 note chord) name, return the amount of black and white piano keys needed to play it. (I will add more explanation later)&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;em&gt;Little bit of music theory&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;A piano contains 88 keys: 52 whites and 36 blacks. The keys are divided into octaves which have 7 white keys and 5 black. The notes represented by the white keys go from A to G (although the starting note in an octave is C; notes from left to right are as following: C, D, E, F, G, A, B). The notes represented by the black keys are accidentals of the white keys. An accidental is either a sharp note (#) or a flat note (b). &lt;strong&gt;(There is an exception since there is only 5 black keys and 7 white keys, Should I expand on this?)&lt;/strong&gt; . A sharp note is one semitone higher than the same note (C# is one semitone higher than C). A flat note is one semitone lower (Db is one semitone lower than D).  There is one full tone in between notes except for E-F and B-C where there is a semitone instead and one semitone between keys.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;I'll keep adding more details if needed&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Note: For this challenge, we don't care which octave the triad is played on since it will be the same answer for any octave.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Cmaj  = 3 white, 0 black &#xA;Fmin  = 2 white, 1 black&#xA;G#maj = 1 white, 2 black&#xA;Gbmaj = 0 white, 3 black&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input can be the chord name or can be divided into 2 variables: Root (C, F, G#, Gb) and quality (maj, min). I will extend on music theory if this is accepted as a good challenge&lt;/p&gt;&#xA;&lt;p&gt;Output must be an array of 2 position where the first one is the number of white keys and the second one the number of black keys&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Has this been asked before?&lt;/p&gt;&#xA;" OwnerUserId="78039" LastEditorUserId="78039" LastEditDate="2023-06-28T13:39:53.283" LastActivityDate="2023-06-28T13:39:53.283" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25835" PostTypeId="2" ParentId="2140" CreationDate="2023-06-28T14:12:48.640" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/262428/draw-the-initial-positions-of-m%c3%b6lkky-pins-in-ascii-art&quot;&gt;Draw the initial positions of Mölkky pins in ASCII Art&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="116582" LastEditorUserId="116582" LastEditDate="2023-07-05T09:52:53.460" LastActivityDate="2023-07-05T09:52:53.460" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25836" PostTypeId="2" ParentId="2140" CreationDate="2023-06-28T14:58:25.387" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/262647/117478&quot;&gt;Sum of a range of a sum of a range of a sum of a range of a sum of a range of a sum of...&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="117478" LastEditorUserId="117478" LastEditDate="2023-07-13T11:20:31.033" LastActivityDate="2023-07-13T11:20:31.033" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25837" PostTypeId="2" ParentId="2140" CreationDate="2023-06-28T15:35:46.187" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/262329/translate-the-keitai-input-method&quot;&gt;Translate the keitai input method&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/unicode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;unicode&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;unicode&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-unicode-tooltip-container&quot;&gt;unicode&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-string-tooltip-container&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2023-06-30T21:11:54.420" LastActivityDate="2023-06-30T21:11:54.420" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25839" PostTypeId="1" AcceptedAnswerId="25841" CreationDate="2023-06-29T14:33:14.447" Score="1" ViewCount="49" Body="&lt;p&gt;I have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25837/77309&quot;&gt;this challenge&lt;/a&gt; in the Sandbox at time of writing. I want to add some more requirements that can potentially majorly change how some solutions can work (dakuten, handakuten, small kana).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Should there be 2 challenges with one a superset of the other, or just one challenge with the new requirements?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="77309" LastActivityDate="2023-06-30T04:30:55.140" Title="What is the stance on challenges that are supersets of other challenges?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25841" PostTypeId="2" ParentId="25839" CreationDate="2023-06-30T04:30:55.140" Score="2" Body="&lt;p&gt;If you believe (and sandbox reviewers agree) that the two versions are sufficiently distinct according to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8286/78410&quot;&gt;Mego's guide to duplicates&lt;/a&gt;, it's OK to post them as two separate challenges.&lt;/p&gt;&#xA;&lt;p&gt;However, we can't judge without seeing the actual draft of the second version. So I'd suggest to post both versions in the sandbox first and get some feedback on their dupe-ness.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2023-06-30T04:30:55.140" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25842" PostTypeId="2" ParentId="25807" CreationDate="2023-06-30T11:50:47.640" Score="2" Body="&lt;p&gt;As &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/25807/maximum-code-golf-length#comment80010_25807&quot;&gt;The Thonnu said&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;There isn't a limit. We have many challenges which take thousands of bytes in languages like Python.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;" OwnerUserId="117478" LastActivityDate="2023-06-30T11:50:47.640" CommentCount="0" CommunityOwnedDate="2023-06-30T11:50:47.640" ContentLicense="CC BY-SA 4.0" />
  <row Id="25843" PostTypeId="2" ParentId="17587" CreationDate="2023-07-06T12:40:58.537" Score="-1" Body="&lt;h1&gt;Penalty only if output is colour specific, with penalty at 3 bytes.&lt;/h1&gt;&#xA;&lt;p&gt;Colours are often represented with RGB values and hex values. These would take 3 bytes to store the colour data.&lt;/p&gt;&#xA;" OwnerUserId="117478" LastActivityDate="2023-07-06T12:40:58.537" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25844" PostTypeId="2" ParentId="2140" CreationDate="2023-07-06T20:35:55.337" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/262682/critical-calculations&quot;&gt;Critical Calculations&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="73054" LastEditorUserId="73054" LastEditDate="2023-07-11T22:24:59.423" LastActivityDate="2023-07-11T22:24:59.423" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25845" PostTypeId="1" AcceptedAnswerId="25846" CreationDate="2023-07-08T16:16:13.153" Score="3" ViewCount="82" Body="&lt;p&gt;I recently wrote up &lt;a href=&quot;https://codegolf.stackexchange.com/questions/262518/landmine-number-i&quot;&gt;Landmine Number&lt;/a&gt;, and I'd like to write more problems in the style of the story of this problem. Is it okay if I continue naming the sequels like LN II, LN III, LN IV? Side question, what is the appropriate amount of time I should wait until I put on the next problem?&lt;/p&gt;&#xA;" OwnerUserId="115553" LastActivityDate="2023-07-08T17:01:59.410" Title="Can I write sequels to one of my created problems?" Tags="|discussion|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25846" PostTypeId="2" ParentId="25845" CreationDate="2023-07-08T17:01:59.410" Score="5" Body="&lt;p&gt;Yes, there's no reason that wouldn't be allowed, as long as the problems are distinct enough that they're not duplicates. (It's ok if the theme is the same).&lt;/p&gt;&#xA;&lt;p&gt;There is plenty of precedent for this kind of series of challenge - for example, &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=conway+is%3Aq+user%3A78410+created%3A..2020&quot;&gt;Bubbler's John Conway tribute series&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=CGAC2022&quot;&gt;the Code Golf Advent Calendar&lt;/a&gt;, and many more.&lt;/p&gt;&#xA;&lt;p&gt;In terms of spacing - there are no rules governing this so it's up to you how you want to spread them out depending on your goals. I'd say wait at least a day though, to avoid swamping the new questions page, which could cause questions to get missed. I don't think there's any reason to have an upper limit though.&lt;/p&gt;&#xA;" OwnerUserId="97857" LastActivityDate="2023-07-08T17:01:59.410" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25848" PostTypeId="1" CreationDate="2023-07-11T07:34:49.307" Score="1" ViewCount="66" Body="&lt;p&gt;If an opcode solution uses but doesn't rely on value of somewhere&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;At the beginning/end of program&lt;/li&gt;&#xA;&lt;li&gt;In the middle of program&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;, then do these count as program size?&lt;/p&gt;&#xA;&lt;p&gt;Example where placed at end:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;use16&#xA;...&#xA;pop word [end]&#xA;fild word [end]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Example where placed in middle:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;use16&#xA;...&#xA;mov [ins1+1], cx&#xA;...&#xA;ins1:&#xA;mov ax, ?&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="46076" LastEditDate="2023-08-02T20:38:33.867" LastActivityDate="2023-08-02T20:38:33.867" Title="Size in DB ？for opcode submission" Tags="|discussion|scoring|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25849" PostTypeId="1" AcceptedAnswerId="25850" CreationDate="2023-07-11T14:06:16.223" Score="1" ViewCount="123" Body="&lt;p&gt;I use &lt;a href=&quot;https://racket-lang.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;Racket&lt;/a&gt; as my primary programming language and have been having fun the past week solving challenges using it. I came across a few answers from other programming languages that use TIO's header and footer options to add code outside of the main golfed code:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;// Header&#xA;f=&#xA;&#xA;// Code (6 bytes)&#xA;n=&amp;gt;n+1&#xA;&#xA;// Footer&#xA;for (let i = 0; i &amp;lt; 10; ++i) {&#xA;  console.log(f(i));&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##DcUxDoAgDADAnVd0hBCNzIh/IQimhrQGjIvx7ZVb7oxP7KnhdU/Ee5YShMJG1knhBrrmGxACLH60ghtbiwZeBZCYOtc8Vz500WiMV5/8&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;JavaScript (Node.js) – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Isn't the &lt;code&gt;f=&lt;/code&gt; required for the answer to be accepted?&lt;/p&gt;&#xA;&lt;p&gt;I also noticed a few submissions where C/++ &lt;code&gt;#include&lt;/code&gt;s and &lt;code&gt;main&lt;/code&gt; were placed in the header/footer and weren't counted.&lt;/p&gt;&#xA;&lt;p&gt;What's the case towards Racket's &lt;code&gt;#lang&lt;/code&gt; statement? It is required to run Racket programs as it tells Racket's system what language to load. Does it count towards byte count? Or may I place it in the header, then explain in the answer what &lt;code&gt;#lang&lt;/code&gt; it uses?&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/5635/should-the-lang-racket-line-be-included-in-code-golfs&quot;&gt;I did find a question&lt;/a&gt; in this Meta that asks whether &lt;code&gt;#lang&lt;/code&gt; should count towards bytes or not, but I'm finding it confusing to choose because the two answers and their comments seem to contradict each other.&lt;/p&gt;&#xA;&lt;p&gt;Any feedback would be appreciated.&lt;/p&gt;&#xA;&lt;p&gt;Have an awesome week ahead!&lt;/p&gt;&#xA;" OwnerUserId="85670" LastEditorUserId="46076" LastEditDate="2023-08-02T20:36:29.047" LastActivityDate="2023-08-02T20:36:29.047" Title="What counts towards the byte count in a code golf answer?" Tags="|discussion|answers|scoring|rules|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25850" PostTypeId="2" ParentId="25849" CreationDate="2023-07-11T14:18:37.690" Score="4" Body="&lt;h3&gt;Anonymous functions are fine&lt;/h3&gt;&#xA;&lt;p&gt;So, we have a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/9032/66833&quot;&gt;long established site policy&lt;/a&gt; that anonymous functions (things like &lt;code&gt;n=&amp;gt;n+1&lt;/code&gt; instead of requiring &lt;code&gt;f=n=&amp;gt;n+1&lt;/code&gt;) are perfectly fine, and that you don't need to score the name and assignment (so long as they don't reference the function themselves, e.g. recursive functions). Additionally, in typed languages, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12747/66833&quot;&gt;lambdas do not need to include their types&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h3&gt;Racket's &lt;code&gt;#lang&lt;/code&gt; does not need to be counted&lt;/h3&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5637/66833&quot;&gt;linked discussion&lt;/a&gt; has a pretty overwhelming consensus (+22/-2 vs +5/-6 at writing) that Racket answers do not need to count their &lt;code&gt;#lang racket&lt;/code&gt; line.&lt;/p&gt;&#xA;&lt;h3&gt;&lt;code&gt;include&lt;/code&gt;s and &lt;code&gt;main&lt;/code&gt;s&lt;/h3&gt;&#xA;&lt;p&gt;The key distinction here is whether the stuff included is required for the &lt;em&gt;function&lt;/em&gt; to work, or just to demonstrate that it works. For example, a very basic&lt;sup&gt;*&lt;/sup&gt; function like&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;int f(int n) { return n+1; }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;doesn't need to count &lt;code&gt;#include&lt;/code&gt;s for printing, nor does it need to count the program's &lt;code&gt;main&lt;/code&gt; code, as the submission itself is the function. However, if it used something that did require an &lt;code&gt;#include&lt;/code&gt;d function (e.g. &lt;a href=&quot;https://tio.run/##S9ZNzknMS///XzkzLzmnNCVVwaa4JCUzXy/Djiszr0QhNzEzT0NToZqLs6C0pFhDySM1JydfRyE8vygnRVFJ05qr9v9/AA&quot; rel=&quot;nofollow noreferrer&quot;&gt;this Hello, World program&lt;/a&gt;), then the answer would need to count the &lt;code&gt;#include&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;sub&gt;&lt;sup&gt;*&lt;/sup&gt;: Disclaimer, I'm not super proficient in C/++, this is just an example, functionality is not guaranteed&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;In short, a good rule of thumb is to only count what is actually necessary, rather than inflate your byte count with adjacent bits of code&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2023-08-02T10:50:38.917" LastActivityDate="2023-08-02T10:50:38.917" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25851" PostTypeId="2" ParentId="2140" CreationDate="2023-07-11T16:55:22.953" Score="2" Body="&lt;h1&gt;Sum of Two Intervals&lt;/h1&gt;&#xA;&lt;p&gt;A k-th interval plus an m-th interval is a (k+m-1)th interval. An interval with p semitones plus one with q semitones is one with (p+q) semitones. Given two intervals, get their sum. Relations between interval and semitones is listed below.&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Interval&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Double&lt;br&gt;Diminished&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Diminished&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Minor&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Perfect&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Major&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Augmented&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Double&lt;br&gt;Augmented&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;unison&lt;br&gt;(1st)&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;-2*&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;-1*&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;-&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;-&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;2&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;2nd&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;-1*&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;-&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;2&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;3&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;4&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;3rd&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;2&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;3&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;-&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;4&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;5&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;6&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;4th&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;3&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;4&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;-&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;5&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;-&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;6&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;7&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;5th&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;5&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;6&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;-&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;7&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;-&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;8&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;9&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;6th&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;6&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;7&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;8&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;-&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;9&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;10&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;11&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;7th&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;8&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;9&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;10&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;-&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;11&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;12&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;13&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;octave&lt;br&gt;(8th)&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;10&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;11&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;-&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;12&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;-&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;13&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;14&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;&lt;sup&gt;* Negative distance doesn't exist but it can be added 12 until non-negative&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;For larger interval, k-th interval has 12 more semitones than the same type of (k-7)-th interval. Triple Augmented is 1 more semitone than Double Augmented, Triple Diminished is 1 less semitone than Double Diminished, etc.&lt;/p&gt;&#xA;&lt;h1&gt;IO format&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The interval would likely get inputted as one argument&lt;/li&gt;&#xA;&lt;li&gt;You can take Double Diminished/Diminished/Minor/Perfect/Major/Augmented/Double Augmented as -2/-1/a/b/c/1/2, where &lt;code&gt;a&lt;/code&gt;, &lt;code&gt;b&lt;/code&gt;, &lt;code&gt;c&lt;/code&gt; are different, zero or non-integer&lt;/li&gt;&#xA;&lt;li&gt;You can take Double Diminished/Diminished/Minor/Perfect/Major/Augmented/Double Augmented as -3/-2/-1/0/1/2/3&lt;/li&gt;&#xA;&lt;li&gt;Same applies to output&lt;/li&gt;&#xA;&lt;li&gt;You needn't handle invalid input like &amp;quot;Diminished 1st&amp;quot;, &amp;quot;Major 4th&amp;quot; or &amp;quot;Perfect 2nd&amp;quot;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;Minor 2nd + Major 3rd = Perfect 4th&#xA;Major 2nd + Major 2nd = Major 3rd&#xA;Major 3rd + Major 3rd = Augmented 5th&#xA;Augmented 2nd + Augmented 3rd = Triple Augmented 4th&#xA;Double Diminished 6th + Double Diminished 7th = 5 Times Diminished 12th&#xA;Augmented 1st + Minor 2nd = Major 2nd&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or testing friendly,&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[m,2]+[M,3]=[0,4]&#xA;[M,2]+[M,2]=[M,3]&#xA;[M,3]+[M,3]=[1,5]&#xA;[1,2]+[1,3]=[3,4]&#xA;[-2,6]+[-2,7]=[-5,12]&#xA;[1,1]+[m,2]=[M,2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2023-07-17T07:38:50.503" LastActivityDate="2023-07-17T07:38:50.503" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25852" PostTypeId="2" ParentId="25848" CreationDate="2023-07-11T23:47:28.477" Score="3" Body="&lt;p&gt;I'm not that literate with asm, but given that asm solutions are measured in bytes of machine code, I believe that &lt;strong&gt;answers must ultimately be a contiguous block of bytes&lt;/strong&gt;. One rationale is that the block of machine code is read from a file, placed in memory as-is, and then executed. This means several things for this question:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;if your function or full program uses some scratch space &lt;em&gt;before&lt;/em&gt; or &lt;em&gt;after&lt;/em&gt; your code in memory, it is OK to not count those bytes even if they are executed, or some instructions are incomplete (and to be completed dynamically so that it can run).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;if your function or full program overwrites some bytes in the &lt;em&gt;middle&lt;/em&gt; of your code in memory, you &lt;em&gt;must&lt;/em&gt; count those bytes even if the original value of that byte is not used.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2023-07-11T23:47:28.477" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25853" PostTypeId="2" ParentId="2140" CreationDate="2023-07-12T04:10:59.370" Score="2" Body="&lt;h1&gt;The next popcount&lt;/h1&gt;&#xA;&lt;p&gt;Given a substring of &lt;a href=&quot;https://oeis.org/A000120&quot; rel=&quot;nofollow noreferrer&quot;&gt;A000120&lt;/a&gt;, number of 1's in binary expansion of n, find the next term.&lt;/p&gt;&#xA;&lt;p&gt;If there's no answer, output something unambiguous to a term. If there's multiple possible answers, output any subset of the answers(Empty set allowed which may act as if no answer)&lt;/p&gt;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;2, 2, 3, 2, 3, 3 -&amp;gt; 4  (X001, X010, X011, X100, X101, X110 where X matches /10*/)&#xA;2, 4 -&amp;gt; DNE&#xA;5, 1 -&amp;gt; 2 (11111, 100000)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2023-07-18T03:23:31.240" LastActivityDate="2023-07-18T03:23:31.240" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25854" PostTypeId="2" ParentId="2140" CreationDate="2023-07-12T08:49:24.493" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/262746/landmine-number-iv&quot;&gt;Landmine Number IV&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="115553" LastEditorUserId="115553" LastEditDate="2023-07-13T12:53:34.650" LastActivityDate="2023-07-13T12:53:34.650" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25855" PostTypeId="2" ParentId="2140" CreationDate="2023-07-12T13:42:43.903" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/262794/landmine-number-v&quot;&gt;Landmine Number V&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="115553" LastEditorUserId="115553" LastEditDate="2023-07-15T12:19:16.543" LastActivityDate="2023-07-15T12:19:16.543" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25856" PostTypeId="2" ParentId="2140" CreationDate="2023-07-12T19:40:31.897" Score="3" Body="&lt;h2&gt;Battle Chess Royale (Any better name?)&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/koth&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;koth&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;koth&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-koth-tooltip-container&quot;&gt;koth&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Imagine a large chess board where different players can choose and place a chess piece. Pieces are Knights, Bishops, Rooks, Kings or Queens. Each piece has an unique movement ability and a point per turn value. The board, after an specific amount of rounds will shrink (as a battle royale field do) disqualifying any player that left its piece outside.&lt;/p&gt;&#xA;&lt;p&gt;The goal of the game is to get as many points as you can. This can be achieved by simply staying within the safe zone of the board and killing other players to take their points.&lt;/p&gt;&#xA;&lt;p&gt;Each piece has an specific amount of passive points per turn based on how freely it can move. Below is the table used. Feel free to give any suggestion on point distribution.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/LQfc0.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/LQfc0.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Note: Pawns are not added to the game since their movement is similar to a king&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;For the game, you will select which piece type you wanna play with. The function for your bot will take as a parameter a board (n x n matrix), an array with the available moves your piece can perform, a list with the next players, and finally an object with info about the game (next shrinking round, leaderboard, etc...). Your return value should be your desired move (must be from your available move array).&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Bots Examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;new Bishop(function(board, availableMoves, players, gameInfo){&#xA;    return availableMoves[0];&#xA;}, &amp;quot;Drunky Step&amp;quot;);&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;new Rook(&#xA;    (board, availableMoves, players, gameInfo) =&amp;gt; &#xA;          availableMoves[Math.floor(Math.random() * availableMoves.length)], &#xA;    &amp;quot;Le Rook&amp;quot;&#xA;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;code&gt;new Queen(function(board, availableMoves, players, gameInfo){&#xA;    let targets = availableMoves.filter(move =&amp;gt; {&#xA;        return board[move[0]][move[1]] != null;&#xA;    });&#xA;    if(targets.length &amp;gt; 0)&#xA;        return targets[0];&#xA;    else&#xA;        return availableMoves[Math.floor(Math.random() * availableMoves.length)];&#xA;}, &amp;quot;Killer&amp;quot;)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here is an example of a 5x5 board with 2 bishops in it&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/mYdvu.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/mYdvu.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The game will be turn based.&lt;/li&gt;&#xA;&lt;li&gt;Players are randomly shuffled before the beginning of the game&lt;/li&gt;&#xA;&lt;li&gt;There is an specific amount of rounds where you cant capture anyone&lt;/li&gt;&#xA;&lt;li&gt;Board always shrinks towards the center&lt;/li&gt;&#xA;&lt;li&gt;If you die or get captured, you score remains&lt;/li&gt;&#xA;&lt;li&gt;It is possible to die because of board shrink, and still win the game&lt;/li&gt;&#xA;&lt;li&gt;There is no suicide unless you wait for board shrink&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;Questions:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Has this been made?&lt;/li&gt;&#xA;&lt;li&gt;Config options as # of rounds, board size, how many rounds every shrink, etc... can be set up before the game. What values should I use?&lt;/li&gt;&#xA;&lt;li&gt;Any considerations I should take?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;PD: I have most of the controller done, I'll be uploading it soon. I'm still working on some basic graphic interface.&lt;/p&gt;&#xA;" OwnerUserId="78039" LastEditorUserId="78039" LastEditDate="2023-08-01T20:23:21.690" LastActivityDate="2023-08-01T20:23:21.690" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25857" PostTypeId="2" ParentId="2140" CreationDate="2023-07-13T02:33:39.137" Score="-1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/262588/&quot;&gt;Inspired&lt;/a&gt;, maybe copy background from there&lt;/p&gt;&#xA;&lt;p&gt;Given a map, output a shortest possible input.&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Start here _ /  =&amp;gt; / \&#xA;             \&#xA;&#xA;               /&#xA;              /&#xA;Start here _ /\/ =&amp;gt; /// /\/ \/\&#xA;             \/\&#xA;&#xA;                /&#xA;               /&#xA;              /\&#xA;Start here _ /\/\ =&amp;gt; //// //\\ /\/ \/\/&#xA;             \/\/&#xA;&#xA;                   /\/&#xA;                /\/\/&#xA;Start here _ /\/\/\/\/ =&amp;gt; /\//\//\/ \/\//\// /\/\/\/\/ \\\&#xA;             \/\/\  /\    \/\/\\//\&#xA;              \   \/&#xA;               \&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2023-07-13T10:32:44.987" LastActivityDate="2023-07-13T10:32:44.987" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25858" PostTypeId="2" ParentId="2140" CreationDate="2023-07-13T11:34:10.140" Score="-3" Body="&lt;h1&gt;&lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; bottles of beer!&lt;/h1&gt;&#xA;&lt;p&gt;You want to recreate the song &amp;quot;99 Bottles of Beer&amp;quot;, but you don't have 99 bottles!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Given an input non-negative integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, output the lyrics to the song &amp;quot;99 Bottles of Beer&amp;quot; but starting from &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; instead. For a few examples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input: 10&#xA;&#xA;Output: &#xA;&#xA;10 bottles of beer on the wall,&#xA;10 bottles of beer.&#xA;Take one down, pass it around,&#xA;9 bottles of beer on the wall.&#xA;&#xA;9 bottles of beer on the wall,&#xA;9 bottles of beer.&#xA;Take one down, pass it around,&#xA;8 bottles of beer on the wall.&#xA;&#xA;8 bottles of beer on the wall,&#xA;8 bottles of beer.&#xA;Take one down, pass it around,&#xA;7 bottles of beer on the wall.&#xA;&#xA;7 bottles of beer on the wall,&#xA;7 bottles of beer.&#xA;Take one down, pass it around,&#xA;6 bottles of beer on the wall.&#xA;&#xA;6 bottles of beer on the wall,&#xA;6 bottles of beer.&#xA;Take one down, pass it around,&#xA;5 bottles of beer on the wall.&#xA;&#xA;5 bottles of beer on the wall,&#xA;5 bottles of beer.&#xA;Take one down, pass it around,&#xA;4 bottles of beer on the wall.&#xA;&#xA;4 bottles of beer on the wall,&#xA;4 bottles of beer.&#xA;Take one down, pass it around,&#xA;3 bottles of beer on the wall.&#xA;&#xA;3 bottles of beer on the wall,&#xA;3 bottles of beer.&#xA;Take one down, pass it around,&#xA;2 bottles of beer on the wall.&#xA;&#xA;2 bottles of beer on the wall,&#xA;2 bottles of beer.&#xA;Take one down, pass it around,&#xA;1 bottle of beer on the wall.&#xA;&#xA;1 bottle of beer on the wall,&#xA;1 bottle of beer.&#xA;Take one down, pass it around,&#xA;0 bottles of beer on the wall.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input: 1&#xA;&#xA;Output:&#xA;&#xA;1 bottle of beer on the wall,&#xA;1 bottle of beer.&#xA;Take one down, pass it around,&#xA;0 bottles of beer on the wall.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so shortest answer wins!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any more tags?&lt;/li&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Is the song formatted correctly in the example?&lt;/li&gt;&#xA;&lt;li&gt;Any more test cases?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="117478" LastEditorUserId="117478" LastEditDate="2023-07-13T15:03:45.507" LastActivityDate="2023-07-13T15:03:45.507" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25859" PostTypeId="2" ParentId="2140" CreationDate="2023-07-13T13:25:23.357" Score="2" Body="&lt;h1&gt;Chamber of Reflection&lt;/h1&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;A ray of light is fired from the top left vertex of an &lt;code&gt;MxN&lt;/code&gt; Chamber, where &lt;code&gt;M&lt;/code&gt; a denotes the width and &lt;code&gt;N&lt;/code&gt; denotes the height of the chamber. The ray of light advances one grid space per second. Given that &lt;code&gt;T&lt;/code&gt; is the number of seconds to be simulated, calculate the number of reflections in this time frame.&lt;/p&gt;&#xA;&lt;p&gt;For example, given &lt;code&gt;5 4 11&lt;/code&gt; (ie. &lt;code&gt;M = 5, N = 4, T = 11&lt;/code&gt;):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;\/\  [&#xA;/\ \ [&#xA;\ \ \[&#xA;   \/[&#xA;-----&#xA;There would be 4 reflections, so the output should be 4.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that a reflection only counts if the ray of light has already bounced off it, so for example, given &lt;code&gt;5 4 10&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;\/\  [&#xA;/\ \ [&#xA;  \ \[&#xA;   \/[&#xA;-----&#xA;There would only be 3 reflections, so the output should be 3.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Your Task&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Sample Input: M, the width of the chamber, N, the height of the chamber, and T, the time frame. These are all numbers.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Output: Return the number of reflections.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Explained Examples&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input =&amp;gt; Output&#xA;1 1 10 =&amp;gt; 9 &#xA;&#xA;Chamber:&#xA;\[&#xA;-&#xA;&#xA;The ray will be reflected back and forth a total of 9 times. &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input =&amp;gt; Output&#xA;5 1 10 =&amp;gt; 9 &#xA;&#xA;Chamber:&#xA;\/\/\[&#xA;&#xA;The ray will be reflected back and forth a total of 9 times. It will first go left to right, then go backwards right to left.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input =&amp;gt; Output&#xA;4 5 16 =&amp;gt; 6 &#xA;&#xA;Chamber:&#xA;\/\ [&#xA;/\ \[&#xA;\ \/[&#xA; \/\[&#xA;\/\/[&#xA;----&#xA;&#xA;The ray will be reflected back and forth a total of 6 times.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input =&amp;gt; Output&#xA;100 100 1 =&amp;gt; 0 &#xA;&#xA;Chamber:&#xA;\ ... [&#xA;...    x100&#xA;-x100&#xA;&#xA;&#xA;The ray never touches a wall, and is never reflected, so output 0.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test Cases&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input =&amp;gt; Output&#xA;5 4 11 =&amp;gt; 4&#xA;5 4 10 =&amp;gt; 3&#xA;1 1 10 =&amp;gt; 9&#xA;5 1 10 =&amp;gt; 9&#xA;4 5 16 =&amp;gt; 6&#xA;100 100 1 =&amp;gt; 0&#xA;&#xA;3 2 9 =&amp;gt; 5&#xA;3 2 10 =&amp;gt; 6&#xA;6 3 18 =&amp;gt; 5&#xA;5 3 16 =&amp;gt; 7&#xA;1 1 100 =&amp;gt; 99&#xA;4 4 100 =&amp;gt; 24&#xA;2398 2308 4 =&amp;gt; 0&#xA;10000 500 501 =&amp;gt; 1&#xA;500 10000 502 =&amp;gt; 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Bonus points (not really): Listen to DeMarco's song &lt;a href=&quot;https://www.youtube.com/watch?v=pQsF3pzOc54&quot; rel=&quot;nofollow noreferrer&quot;&gt;Chamber of Reflection&lt;/a&gt; while solving this.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so shortest answer wins.&lt;/p&gt;&#xA;" OwnerUserId="115553" LastActivityDate="2023-07-13T13:25:23.357" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25860" PostTypeId="2" ParentId="2140" CreationDate="2023-07-13T17:29:43.957" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/262809/diagonalize-a-vector&quot;&gt;Diagonalize a vector&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/array&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;array&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-array-tooltip-container&quot;&gt;array&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-math-tooltip-container&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/matrix&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;matrix&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-matrix-tooltip-container&quot;&gt;matrix&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/linear-algebra&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;linear-algebra&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;linear-algebra&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-linear-algebra-tooltip-container&quot;&gt;linear-algebra&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2023-07-14T15:57:26.123" LastActivityDate="2023-07-14T15:57:26.123" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25861" PostTypeId="2" ParentId="2140" CreationDate="2023-07-13T18:16:35.610" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://chat.stackexchange.com/transcript/message/63012181#63012181&quot;&gt;https://chat.stackexchange.com/transcript/message/63012181#63012181&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Make a 0-byte metagolfscript solution that outputs its name.&lt;/p&gt;&#xA;&lt;p&gt;Shortest name wins.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2023-07-13T18:16:35.610" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25862" PostTypeId="2" ParentId="2140" CreationDate="2023-07-13T20:44:14.053" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/262985/numbers-that-can-be-negated-by-reading-backwards&quot;&gt;Numbers that can be negated by reading backwards&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-07-18T17:15:15.197" LastActivityDate="2023-07-18T17:15:15.197" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25863" PostTypeId="2" ParentId="2140" CreationDate="2023-07-14T11:15:30.460" Score="-1" Body="&lt;h1&gt;Python: &lt;code&gt;*args&lt;/code&gt; or &lt;code&gt;**kwargs&lt;/code&gt;?&lt;/h1&gt;&#xA;&lt;p&gt;Is it a regular argument or a keyword argument?&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;In Python, there are two types of specifying arguments to a function:&lt;/p&gt;&#xA;&lt;p&gt;Regular argument (&lt;code&gt;arg&lt;/code&gt;): &lt;code&gt;f(&amp;quot;regular argument&amp;quot;)&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Keyword argument (&lt;code&gt;kwarg&lt;/code&gt;): &lt;code&gt;f(keywordarg=&amp;quot;keyword argument&amp;quot;)&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Keyword arguments in Python always are in the form of variable assignments and regular arguments are anything else. &lt;a href=&quot;https://book.pythontips.com/en/latest/args_and_kwargs.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;If you want to learn more about &lt;code&gt;*args&lt;/code&gt; and &lt;code&gt;**kwargs&lt;/code&gt;, click here.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Given an input &lt;strong&gt;string&lt;/strong&gt; consisting of only ascii characters that is a valid argument (regular or keyword), you must output one of two constant, distinct values representing whether it is an &lt;code&gt;arg&lt;/code&gt; or a &lt;code&gt;kwarg&lt;/code&gt;. Shortest code wins!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;3              -&amp;gt; arg&#xA;num = 3        -&amp;gt; kwarg&#xA;num=3          -&amp;gt; kwarg&#xA;a=b            -&amp;gt; kwarg&#xA;a==b           -&amp;gt; arg&#xA;False          -&amp;gt; arg&#xA;&amp;quot;kwarg&amp;quot;        -&amp;gt; arg&#xA;arg=&amp;quot;arg&amp;quot;      -&amp;gt; kwarg&#xA;&amp;quot;kwarg=kwarg&amp;quot;  -&amp;gt; arg&#xA;a=b==c         -&amp;gt; kwarg&#xA;b==c           -&amp;gt; arg&#xA;[1,2,3,4]      -&amp;gt; arg&#xA;dict={1:2,3:4} -&amp;gt; kwarg&#xA;[1,2][i:=0]    -&amp;gt; arg&#xA;&#xA;&amp;quot;&amp;quot;&amp;quot;more than&#xA;one line!&amp;quot;&amp;quot;&amp;quot;   -&amp;gt; arg&#xA;&#xA;mstring='''&#xA;indeed more&#xA;than one line&#xA;'''            -&amp;gt; kwarg&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Tags&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-decision-problem-tooltip-container&quot;&gt;decision-problem&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/python&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;python&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-python-tooltip-container&quot;&gt;python&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Is this too focused on Python?&lt;/li&gt;&#xA;&lt;li&gt;Do I need more test cases?&lt;/li&gt;&#xA;&lt;li&gt;Any other feedback?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="117478" LastEditorUserId="117478" LastEditDate="2023-07-15T15:36:56.797" LastActivityDate="2023-07-15T15:36:56.797" CommentCount="17" ContentLicense="CC BY-SA 4.0" />
  <row Id="25864" PostTypeId="2" ParentId="2140" CreationDate="2023-07-16T11:13:29.903" Score="1" Body="&lt;h1&gt;Tableing in 3 operations&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://research.ibm.com/haifa/ponderthis/challenges/December2015.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;There was a puzzle requiring to convert EBCDIC into ASCII in 4 operations.&lt;/a&gt; Actually, if big integers are allowed, 3 mathematical operations(so no bit shift, integer division, etc.) is enough, even for more complex mapping.&lt;/p&gt;&#xA;&lt;p&gt;Given an array &lt;span class=&quot;math-container&quot;&gt;\$\left[x_1,x_2,x_3,...,x_n\right]\$&lt;/span&gt;, generate arguments &lt;span class=&quot;math-container&quot;&gt;\$a,b,c\$&lt;/span&gt;, such that &lt;span class=&quot;math-container&quot;&gt;\$ \forall 0 &amp;lt; k \le n, a \mod \left(bk+c\right) = x_k\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Fastest algorithm wins. Here word RAM model is used: bitwidth is by default &lt;span class=&quot;math-container&quot;&gt;\$\text O \left (\log \max\left\{ x_k, n\right\} \right)\$&lt;/span&gt;. You can cost &lt;span class=&quot;math-container&quot;&gt;\$2^t\$&lt;/span&gt; time to extend the bitwidth to &lt;span class=&quot;math-container&quot;&gt;\$\text O\left(t\right)\$&lt;/span&gt; without extra code. BigInts are treated as multiple ints, and take longer time to process larger values.&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox Notes:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-fastest-algorithm-tooltip-container&quot;&gt;fastest-algorithm&lt;/a&gt; or &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-fastest-code-tooltip-container&quot;&gt;fastest-code&lt;/a&gt;?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2023-07-18T00:56:29.607" LastActivityDate="2023-07-18T00:56:29.607" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25865" PostTypeId="2" ParentId="2140" CreationDate="2023-07-16T14:01:38.130" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/263243/78850&quot;&gt;Continuously Count Consecutive Cases&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="115553" LastEditorUserId="78850" LastEditDate="2023-07-31T02:48:27.827" LastActivityDate="2023-07-31T02:48:27.827" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25866" PostTypeId="2" ParentId="2140" CreationDate="2023-07-17T07:20:14.527" Score="0" Body="&lt;p&gt;Compute 0.1+0.2+0.3+...+0.8+0.9+0.10+0.11+0.12+...+0.[n]&lt;/p&gt;&#xA;&lt;p&gt;Test cases&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;10  -&amp;gt; 4.6&#xA;25  -&amp;gt; 7.3&#xA;64  -&amp;gt; 24.85&#xA;256 -&amp;gt; 81.496&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Sandbox Note&lt;/h1&gt;&#xA;&lt;p&gt;Dupscanner&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2023-07-17T07:27:31.493" LastActivityDate="2023-07-17T07:27:31.493" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25867" PostTypeId="2" ParentId="2140" CreationDate="2023-07-17T11:47:05.797" Score="1" Body="&lt;h1&gt;Tic-Tac-Toe: Maintain the Draw!&lt;/h1&gt;&#xA;&lt;p&gt;Tic-Tac-Toe is a game for two players who take turns marking the spaces in a &lt;code&gt;3x3&lt;/code&gt; grid with an &lt;code&gt;X&lt;/code&gt; or an &lt;code&gt;O&lt;/code&gt;. If a player succeeds in placing three of their marks in a horizontal, vertical or diagonal line they are the winner; otherwise, the game is considered drawn.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;You have been chosen to represent the human race in a game of Tic-Tac-Toe against the AIs. Dauntingly, your opponent is a programme which always finds the optimal move in a given position. Worse still, you will be playing second. The only consolation is that you are required to survive for one move only: that is, you must make a single move in reply to the computer's opening gambit which leads to a position which is not theoretically lost. If you find such a move, humanity lives to fight another day; if not, ...&lt;/p&gt;&#xA;&lt;p&gt;Assuming a Tic-Tac-Toe board with the following notation&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3&#xA;4 5 6&#xA;7 8 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;given the AI's opening move output all possible replies which do not lead to a theoretically lost position.&lt;/p&gt;&#xA;&lt;h1&gt;Input&lt;/h1&gt;&#xA;&lt;p&gt;An integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; (where &lt;span class=&quot;math-container&quot;&gt;\$1&amp;lt;=n&amp;lt;=9\$&lt;/span&gt;) which represents the machine's opening move as per the given board notation.&lt;/p&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;A sorted list, array, etc. of integers which represents all possible solutions.&lt;/p&gt;&#xA;&lt;h1&gt;Explained Cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input =&amp;gt; Output&#xA;&#xA;1 =&amp;gt; [5]&#xA;The only reply to a corner-square opening move which does not lead to a theoretical loss&#xA;is that which occupies the central square.&#xA;&#xA;2 =&amp;gt; [1, 3, 5, 8]&#xA;&#xA;The only replies to an edge-square opening move which do not lead to a theoretical loss&#xA;are those which occupy the same row or column as that of your opponent's move.&#xA;&#xA;5 =&amp;gt; [1, 3, 7, 9]&#xA;&#xA;The only replies to a central-square opening move which do not lead to a theoretical&#xA;loss are those which occupy one of the four corner squares.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input =&amp;gt; Output&#xA;&#xA;1 =&amp;gt; [5]&#xA;2 =&amp;gt; [1, 3, 5, 8]&#xA;3 =&amp;gt; [5]&#xA;4 =&amp;gt; [1, 5, 6, 7]&#xA;5 =&amp;gt; [1, 3, 7, 9]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so shortest answer in bytes wins!&lt;/p&gt;&#xA;" OwnerUserId="116680" LastEditorUserId="116680" LastEditDate="2023-07-17T18:22:26.727" LastActivityDate="2023-07-17T18:22:26.727" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25868" PostTypeId="2" ParentId="1061" CreationDate="2023-07-17T18:13:02.447" Score="3" Body="&lt;h1&gt;Outputting a Lazy list/Lazy data type in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-fastest-code-tooltip-container&quot;&gt;fastest-code&lt;/a&gt; challenges&lt;/h1&gt;&#xA;&lt;p&gt;This just moves the computation to after runtime. For example, in Python, the code:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;def f():&#xA;    return 492084389428**209480438084, 6356425635**23984723879&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;takes a very long time to run. However, if you use the &lt;code&gt;yield&lt;/code&gt; keyword to generate a Lazy List:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;def f():&#xA;    yield 492084389428**209480438084&#xA;    yield 6356425635**23984723879&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;it returns the result instantly, without computing it. However, when you iterate through it:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;x = f()&#xA;print(next(x))&#xA;print(next(x))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;It takes a really long time, since the computation was moved here, after the runtime.&lt;/p&gt;&#xA;" OwnerUserId="117478" LastActivityDate="2023-07-17T18:13:02.447" CommentCount="2" CommunityOwnedDate="2023-07-17T18:13:02.447" ContentLicense="CC BY-SA 4.0" />
  <row Id="25869" PostTypeId="2" ParentId="2140" CreationDate="2023-07-17T18:41:41.517" Score="-1" Body="&lt;h1&gt;Decimal to fraction&lt;/h1&gt;&#xA;&lt;p&gt;In the pool of questions on CGCC, I have not found a question with this task.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Given a float in base 10, output a fraction in simplified form, improper or mixed. The output format can be any reasonable one. In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, the shortest answer wins!&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;3.5 -&amp;gt; 7/2 or 3 1/2&#xA;0.25 -&amp;gt; 1/4 or 0 1/4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Did I miss a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Any more test cases?&lt;/li&gt;&#xA;&lt;li&gt;Anything else?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="117478" LastActivityDate="2023-07-17T18:41:41.517" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25870" PostTypeId="2" ParentId="2447" CreationDate="2023-07-17T18:50:18.860" Score="-8" Body="&lt;h1&gt;You may output with reasonable constant trailing and leading data&lt;/h1&gt;&#xA;&lt;p&gt;This does not apply to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-kolmogorov-complexity-tooltip-container&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenges.&lt;/p&gt;&#xA;&lt;p&gt;For example, if you need to output &lt;code&gt;3&lt;/code&gt;, you can output &lt;code&gt;__3__&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="117478" LastEditorUserId="106959" LastEditDate="2023-12-07T19:55:50.900" LastActivityDate="2023-12-07T19:55:50.900" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25872" PostTypeId="2" ParentId="2140" CreationDate="2023-07-18T12:24:01.107" Score="3" Body="&lt;h2&gt;Sleep Forever&lt;/h2&gt;&#xA;&lt;p&gt;Write a program that never exits completely, but also after startup consumes exactly 0.0 CPU time.&lt;/p&gt;&#xA;&lt;p&gt;This means you must sleep in a way that the operation system never wakes up the process. &lt;code&gt;ps aux | grep [your program]&lt;/code&gt; should show &lt;code&gt;%CPU&lt;/code&gt; &lt;code&gt;0.0&lt;/code&gt; at any time after startup.&lt;/p&gt;&#xA;&lt;p&gt;Note a long sleep in a loop is not enough, since then the OS will need to wake up your program to start the next iteration. You must absolutely never be woken up.&lt;/p&gt;&#xA;&lt;p&gt;Waking up on signals for the purpose of exiting is OK if your language does that by default. However, no normal input over pipes should not wake your program up.&lt;/p&gt;&#xA;&lt;p&gt;You can use CPU for any finite amount of time during startup.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, shortest code wins.&lt;/p&gt;&#xA;&lt;h2&gt;Meta:&lt;/h2&gt;&#xA;&lt;p&gt;I need some help with the signals exception. I don't want submissions to need to spend a large amount of code to disable all signal handlers present by default, but also I don't want programs that just &amp;quot;wait for a keypress&amp;quot; for example which isn't really reasonable.&lt;/p&gt;&#xA;&lt;p&gt;I also want to avoid giving significant advantages to languages just because of what signal handlers they do/do not have by default.&lt;/p&gt;&#xA;&lt;p&gt;I also want to avoid using too much OS specific terminology.&lt;/p&gt;&#xA;&lt;p&gt;Suggestions appreciated.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-07-26T18:39:15.380" LastActivityDate="2023-07-26T18:39:15.380" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25873" PostTypeId="2" ParentId="2140" CreationDate="2023-07-18T14:56:50.440" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/263135/print-this-diamond-gone-beautifully-wrong&quot;&gt;Print this pulsar (or &amp;quot;Print this diamond&amp;quot; gone beautifully wrong)&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="116582" LastEditorUserId="116582" LastEditDate="2023-07-21T16:12:33.843" LastActivityDate="2023-07-21T16:12:33.843" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25874" PostTypeId="2" ParentId="2140" CreationDate="2023-07-18T17:23:43.747" Score="-2" Body="&lt;h1&gt;That is disproportionate!&lt;/h1&gt;&#xA;&lt;p&gt;You want to overwhelm your nasty boss with an error message so large that they quit their job. But your boss will fire you instead if it's too long.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;In this challenge, you have to write code that is &lt;strong&gt;more than 0 bytes long&lt;/strong&gt; that produces the longest error message possible.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Answers will be scored using this formula:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$\frac{\text{Error message length in bytes}}{\text{Programme length in bytes}}$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Other&lt;/h2&gt;&#xA;&lt;p&gt;All answers must &lt;strong&gt;include the answer score, source code and error message.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-challenge-tooltip-container&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/error-message&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;error-message&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;error-message&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-error-message-tooltip-container&quot;&gt;error-message&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Any other appropriate tags?&lt;/li&gt;&#xA;&lt;li&gt;Anything else?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="117478" LastActivityDate="2023-07-18T17:23:43.747" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25875" PostTypeId="2" ParentId="6918" CreationDate="2023-07-18T18:44:58.570" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://github.com/PlaceReporter99/talking-head&quot; rel=&quot;nofollow noreferrer&quot;&gt;TalkingHead&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The very limited language where you golf by talking faster. &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/63672679#63672679&quot;&gt;Don’t just take my word that it’s a novel language.&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="117478" LastActivityDate="2023-07-18T18:44:58.570" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25876" PostTypeId="2" ParentId="2140" CreationDate="2023-07-19T10:02:41.887" Score="3" Body="&lt;h2&gt;Fast and Golfiest Challenges&lt;/h2&gt;&#xA;&lt;p&gt;I am planning on creating a series of cops-and-robbers style challenges. My inspiration is the coexistance of code efficiency problems and code golfing problems on this site - and the problem that code efficiency challenges seem to be often overlooked, even though most of competitive programming is centered upon efficiency. So I plan to combine the two in order to let golfers on the site try considering code efficiency as well, and as an opportunity for competitive programming experts to show off their cool knowledge of segment trees and the Bellman-Ford ;-) (alright, maybe not such hard stuff since I still want the challenge to be accessible to most people, especially golfers).&lt;/p&gt;&#xA;&lt;p&gt;So here comes my idea. Each challenge in the series will be based on one theme (for instance, one theme I have in mind is &amp;quot;The Lords of the Strings&amp;quot;, aimed at string operations).&lt;/p&gt;&#xA;&lt;p&gt;The cops will choose a problem (the difficulty must not be &amp;quot;easy&amp;quot;) on the competitive coding platform LeetCode and &lt;em&gt;independently&lt;/em&gt; (there's no way to do anti-cheat for this, though, so we'll leave it up to the integrity of the participants themselves) write a both efficient &lt;em&gt;and&lt;/em&gt; golfed answer for it. The problem should not be too easy. However, for the cops efficiency is emphasized over golfiness.&lt;/p&gt;&#xA;&lt;p&gt;The robbers need to improve on the cops' code by golfing up the code (in the same language as the cop's), but here comes the thing: the golfed up version must not be algorithmically slower than the cop version. The robber has to prove this by theoretically proving that the time complexity of their code is lower or equal to the cop code. If it is lower, the robber gets 2.718 times their normal score (will still be rounded to the nearest integer).&lt;/p&gt;&#xA;&lt;p&gt;Both cops and robbers must report the UTC time of their answer post. The cop's score is the number of hours (rounded to the nearest whole) that pass before the first valid robber answer is posted. The robber's score is the percentage reduction of code bytes compared to the cop code, again rounded to the nearest whole number.&lt;/p&gt;&#xA;&lt;p&gt;What do you think, community? Any suggestions are very welcome! Thanks in advance :-D&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;TL;DR&lt;/em&gt;: An unusual cops and robbers game. Cops choose a competitive programming problem under a certain theme and write code to solve it. Robbers golf up the cop's code but must not sacrifice efficiency in the process. Cops mainly aim for code efficiency, while robbers mainly aim for code golfing.&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Cop&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Input &lt;code&gt;n&lt;/code&gt;, output &lt;code&gt;2*n&lt;/code&gt; (in the actual challenge please go get a real problem on LeetCode and paste the link).&lt;/p&gt;&#xA;&lt;p&gt;Code: &lt;code&gt;,[&amp;gt;+&amp;gt;+&amp;lt;&amp;lt;-]&amp;gt;&amp;gt;[&amp;lt;+&amp;gt;-]&amp;lt;.&lt;/code&gt; (Brainfuck, 20 bytes)&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;2 hours and 40 minutes later...&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Robber&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Code: &lt;code&gt;,[&amp;gt;+&amp;gt;+&amp;lt;&amp;lt;-]&amp;gt;[&amp;gt;+&amp;lt;-]&amp;gt;.&lt;/code&gt; (19 bytes)&lt;/p&gt;&#xA;&lt;p&gt;Both have complexity &lt;code&gt;O(n)&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Results&lt;/strong&gt;: Cop gets 3 points (3 hours before first solve) and robber gets 5 points (5% reduction in code length).&lt;/p&gt;&#xA;" OwnerUserId="118810" LastEditorUserId="118810" LastEditDate="2023-07-20T03:06:00.253" LastActivityDate="2023-07-20T03:06:00.253" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25879" PostTypeId="1" CreationDate="2023-07-19T12:30:57.353" Score="2" ViewCount="114" Body="&lt;p&gt;TL;DR: Is &lt;code&gt;int d = *(int*)argv[1];&lt;/code&gt; allowed to obtain a integer input?&lt;/p&gt;&#xA;&lt;p&gt;A special case of this question: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/4708/can-numeric-input-output-be-in-the-form-of-byte-values/4719#4719&quot;&gt;Can numeric input/output be in the form of byte values?&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is mostly for C, C++, assembly and languages with similar properties.&lt;/p&gt;&#xA;&lt;p&gt;Lets say the programs needs a integer or floating point as input. Is it legal to obtain this value by interpreting the binary representation of &lt;code&gt;argv[1][0]&lt;/code&gt;...&lt;code&gt;argv[1][n]&lt;/code&gt; as integer of floating point? In C you can do that with &lt;code&gt;a=*(int*)argv[1];&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;A possible problem is that this makes it harder to input numbers where some bytes of it, except the highest byte, are &lt;code&gt;0&lt;/code&gt;. In C strings are terminated with &lt;code&gt;'\0'&lt;/code&gt; or &lt;code&gt;0&lt;/code&gt;, and therefore &lt;code&gt;argv&lt;/code&gt; on most OSs. So to input a number which has a 0-byte in it you have to use more than 1 &lt;code&gt;argv&lt;/code&gt; argument.&lt;/p&gt;&#xA;&lt;h5&gt;How argv is filled in memory&lt;/h5&gt;&#xA;&lt;p&gt;On my Linux Debian AMD64, &lt;code&gt;argv&lt;/code&gt; is in memory like this.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  V--- argv[0] points here        V--- argv[1] points here&#xA;+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+&#xA;| . | / | a | . | o | u | t |\0 | A | R | G | 1 |\0 | A | R | G | 2 |\0 |&#xA;+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+&#xA;  ^------Program name---------^   ^---Argument 1--^   ^---Argument 2--^&#xA;Interpret this 4 bytes as integer:^-----------^   &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Edit: This is the same as in &lt;code&gt;/proc/self/cmdline&lt;/code&gt; on Linux.&lt;/p&gt;&#xA;&lt;h5&gt;argv -&amp;gt; Input mapping&lt;/h5&gt;&#xA;&lt;p&gt;This is how it works on my machine with bash. Probably different on other machines.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;./myProgram '' '' '' '' # Read as 0x00000000 (4 times a terminating 0 character)&#xA;./myProgram ' ' '' ''   # Read as 0x00000020 (0x20 is the ASCII value of ' ')&#xA;./myProgram '' ' ' ''   # Read as 0x00002000 (2 times 0 byte, ' ', 0 byte)&#xA;./myProgram ' ' ' '     # Read as 0x00200020 (0 byte, ' ', 0 byte, ' ')&#xA;./myProgram ' ' '2'     # Read as 0x00320020 (0 byte, '2', 0 byte, ' ')&#xA;./myProgram '1234'      # Read as 0x34333231 ('4', '3', '2', '1')&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;However, this will not work&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;# Will not be read as Read 0x00200020, what you might expected, but as 0x00002020.&#xA;./myProgram &amp;quot;$(echo -e ' \x00  ')&amp;quot; '' '' '' &#xA;# (note, bash just ignores the \x00 altogether, but it wouldn't work anyway).&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h5&gt;Example Program&lt;/h5&gt;&#xA;&lt;p&gt;Lets say the task is to double a number. Can i do this?:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;main(int a, char **argv)&#xA;{&#xA;  int d = *(int*)argv[1]; //&amp;lt;-- Is this allowed?&#xA;  printf(&amp;quot;%d&amp;quot;,d*2);&#xA;}&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Or in a more golfed version: &lt;code&gt;main(a,v)int **v;{printf(&amp;quot;%d&amp;quot;,2**v[1]);}&lt;/code&gt;, which is shorter than &lt;code&gt;main(a,v)int **v;{printf(&amp;quot;%d&amp;quot;,2*atoi(v[1]));}&lt;/code&gt; which reads &lt;code&gt;argv[1]&lt;/code&gt; as a ASCII string.&lt;/p&gt;&#xA;" OwnerUserId="59900" LastEditorUserId="59900" LastEditDate="2023-07-20T09:37:14.953" LastActivityDate="2023-08-27T16:34:18.827" Title="Can the binary representations of argv[n] be used for numeric input?" Tags="|discussion|code-golf|defaults|" AnswerCount="2" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25880" PostTypeId="2" ParentId="2140" CreationDate="2023-07-19T12:50:21.127" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/263200/print-all-polynomials&quot;&gt;Print all polynomials&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-07-23T10:25:52.147" LastActivityDate="2023-07-23T10:25:52.147" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25881" PostTypeId="2" ParentId="25879" CreationDate="2023-07-20T11:31:53.823" Score="0" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;AFAIK, this isn't a natural way to take input in the aforementioned languages (or any language that I know of). Surely a (full) program shouldn't need another program to generate the proper input format?&lt;/p&gt;&#xA;" OwnerUserId="70761" LastEditorUserId="70761" LastEditDate="2023-07-20T11:41:13.270" LastActivityDate="2023-07-20T11:41:13.270" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25882" PostTypeId="2" ParentId="2140" CreationDate="2023-07-20T17:31:44.663" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/264161/hashers-and-crashers-cops&quot;&gt;Hashers&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/264164/hashers-and-crashers-robbers&quot;&gt;Crashers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="117478" LastEditorUserId="117478" LastEditDate="2023-08-14T16:17:59.250" LastActivityDate="2023-08-14T16:17:59.250" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="25883" PostTypeId="2" ParentId="2140" CreationDate="2023-07-21T02:59:12.850" Score="3" Body="&lt;h1&gt;[Dual scoring criterion challenge concept]&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-challenge-tooltip-container&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-fastest-code-tooltip-container&quot;&gt;fastest-code&lt;/a&gt; (that's right...three OWC tags on one post :p)&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/263049/cops-fast-and-golfiest-season-1-the-lord-of-the-strings&quot;&gt;The Fast and the Golfiest&lt;/a&gt;, I've come up with what might be a novel way to do a combined code golf/fastest code challenge. I haven't decided what the actual task would be, but here's how it would work:&lt;/p&gt;&#xA;&lt;p&gt;Your score is the number of answers you outgolf, plus the number of answers you outperform.&lt;/p&gt;&#xA;&lt;p&gt;This means the highest possible score is &lt;span class=&quot;math-container&quot;&gt;\$2(n-1)\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is the number of answers. The idea is that an answer &lt;em&gt;could&lt;/em&gt; focus purely on golfing or on speed, and get a score close to &lt;span class=&quot;math-container&quot;&gt;\$n-1\$&lt;/span&gt;, but achieving a balance of the two is the only way to do better than that.&lt;/p&gt;&#xA;&lt;p&gt;Since this scoring method depends on having many answers to compare against, I'm thinking it would work differently from our site's normal rules, and all languages would compete against one another (this is more commonly treated as true in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-fastest-code-tooltip-container&quot;&gt;fastest-code&lt;/a&gt;). In order to keep the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; side of things fair, any language (including a specific flag combination) used must have at least &lt;s&gt;10&lt;/s&gt; 2 answers, which must meet &lt;strong&gt;any&lt;/strong&gt; of the following requirements:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Posted by a user other than OP&lt;/li&gt;&#xA;&lt;li&gt;Posted before the challenge&lt;/li&gt;&#xA;&lt;li&gt;Posted at least two months ago&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This limits flag abuse and other tricks to a more acceptable degree. Common flags in flag-abuse-oriented languages like Japt or Vyxal might still be usable, but most languages which have these sorts of flags are enormously uncompetitive in performance.&lt;/p&gt;&#xA;&lt;p&gt;That's another reason I want to make all languages compete; it makes choosing the language you use an opportunity to strategize. A faster language like C might beat more answers in speed, while losing badly on golfiness, while the reverse may be true for Jelly or Vyxal.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2023-07-21T03:15:04.470" LastActivityDate="2023-07-21T03:15:04.470" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="25885" PostTypeId="2" ParentId="2140" CreationDate="2023-07-21T12:51:01.733" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/263364/compute-this-fractal-matrix&quot;&gt;Compute this fractal matrix&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-07-26T13:06:36.697" LastActivityDate="2023-07-26T13:06:36.697" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25886" PostTypeId="2" ParentId="1061" CreationDate="2023-07-22T09:09:39.393" Score="2" Body="&lt;h1&gt;Cracking your own answer (including using an alt account) in a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-cops-and-robbers-tooltip-container&quot;&gt;cops-and-robbers&lt;/a&gt; challenge.&lt;/h1&gt;&#xA;&lt;p&gt;It would just allow you to get a large number of points with no effort! Plus, it doesn’t even make any sense to do that.&lt;/p&gt;&#xA;" OwnerUserId="117478" LastActivityDate="2023-07-22T09:09:39.393" CommentCount="0" CommunityOwnedDate="2023-07-22T09:09:39.393" ContentLicense="CC BY-SA 4.0" />
  <row Id="25887" PostTypeId="2" ParentId="2140" CreationDate="2023-07-22T13:59:59.753" Score="1" Body="&lt;h1&gt;Write a Turing machine that draws this fractal&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;This challenge is inspired by and similar to my &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/25885#25885&quot;&gt;other challange&lt;/a&gt; about a fractal matrix, but uses a slightly different matrix (for n up to 3 the matrices are nearly the same, but for n &amp;gt;= 4 they start to differ more significantly)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;A 2D-Turing machine is like a regular &lt;a href=&quot;https://en.wikipedia.org/wiki/Turing_machine&quot; rel=&quot;nofollow noreferrer&quot;&gt;Turing Machine&lt;/a&gt; but the memory tape is 2 dimensional, meaning that after each step you can in addition to moving left or right also move up or down.&lt;/p&gt;&#xA;&lt;p&gt;[...]&lt;/p&gt;&#xA;&lt;p&gt;Your task is to create a 2 dimensional Turing machine that prints the infinite fractal matrix generated by the following procedure:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Start with a single cell, set it to &lt;code&gt;1&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;repeat &lt;code&gt;n&lt;/code&gt; times:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;add a copy of the previous matrix to the left of the previous matrix&lt;/li&gt;&#xA;&lt;li&gt;add a copy of the previous matrix below the previous matrix&lt;/li&gt;&#xA;&lt;li&gt;add a copy of the previous matrix with &lt;code&gt;1&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt; swapped, diagonally to the bottom right of the previous matrix.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;First few steps:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;n=0:&#xA;&#xA;1&#xA;&#xA;n=1:&#xA;&#xA;1 1&#xA;1 0&#xA;&#xA;n=2:&#xA;&#xA;1 1 1 1&#xA;1 0 1 0&#xA;1 1 0 0&#xA;1 0 0 1&#xA;&#xA;n=3:&#xA;&#xA;1 1 1 1 1 1 1 1&#xA;1 0 1 0 1 0 1 0&#xA;1 1 0 0 1 1 0 0&#xA;1 0 0 1 1 0 0 1&#xA;1 1 1 1 0 0 0 0&#xA;1 0 1 0 0 1 0 1&#xA;1 1 0 0 0 0 1 1&#xA;1 0 0 1 0 1 1 0&#xA;&#xA;n=4:&#xA;&#xA;1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1&#xA;1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0&#xA;1 1 0 0 1 1 0 0 1 1 0 0 1 1 0 0&#xA;1 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1&#xA;1 1 1 1 0 0 0 0 1 1 1 1 0 0 0 0&#xA;1 0 1 0 0 1 0 1 1 0 1 0 0 1 0 1&#xA;1 1 0 0 0 0 1 1 1 1 0 0 0 0 1 1&#xA;1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0&#xA;1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0&#xA;1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1&#xA;1 1 0 0 1 1 0 0 0 0 1 1 0 0 1 1&#xA;1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0&#xA;1 1 1 1 0 0 0 0 0 0 0 0 1 1 1 1&#xA;1 0 1 0 0 1 0 1 0 1 0 1 1 0 1 0&#xA;1 1 0 0 0 0 1 1 0 0 1 1 1 1 0 0&#xA;1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;It is allowed to output/display any two (distinguishable) distinct cells values for the two different values in the matrix&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Cells inside the matrix have to have the correct value more that 50% of the time (&lt;span class=&quot;math-container&quot;&gt;\$\lim_{steps \to \infty} \frac{correct}{steps} &amp;gt;0.5\$&lt;/span&gt;)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Cells outside the matrix should be empty more that 50% of the time.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The score of an answer is the number of distinct cell values used times the number of states of the Turing machine&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; the solution with the lowest score wins&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;related: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/162254/generate-a-walsh-matrix&quot;&gt;generate the matrix&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/graphical-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;graphical-output&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-graphical-output-tooltip-container&quot;&gt;graphical-output&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Is this a duplicate?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is my explanation clear?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Should I link to an example implementation of a 2D Turing machine?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-07-28T08:13:15.367" LastActivityDate="2023-07-28T08:13:15.367" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25888" PostTypeId="2" ParentId="2140" CreationDate="2023-07-22T16:06:27.043" Score="3" Body="&lt;h1&gt;Simulate Keyboard Inputs&lt;/h1&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;You know how in text editors and just text fields in general, there's always that blinking bar where you type? Yeah, simulate typing there.&lt;/p&gt;&#xA;&lt;p&gt;You'll be given 3 inputs: The current text field, the position of the cursor, and the input sequence.&lt;/p&gt;&#xA;&lt;p&gt;Here's an example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Hello, World!&#xA;5&#xA;[U];[U];[B];[B];[B];[B];[B];[U];i;[R];[R];[R];[R];[R];[R];[R];[R];[R];[B];.&#xA;=&amp;gt; Hi, World.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Firstly, the number 5 tells us that the cursor is here, represented by the asterisk: &lt;code&gt;Hello*, World!&lt;/code&gt;. If you take the string as zero-indexed, and choose the left side, you will find the cursor's starting point.&lt;/p&gt;&#xA;&lt;p&gt;Next, we have 2 &lt;code&gt;[U]&lt;/code&gt;s. &lt;code&gt;[U]&lt;/code&gt; is a special input, representing undo. However, there is nothing to undo, so nothing happens.&lt;/p&gt;&#xA;&lt;p&gt;Then, we have 5 &lt;code&gt;[B]&lt;/code&gt;s. &lt;code&gt;[B]&lt;/code&gt; is another special input, representing backspace. This tells us to erase 5 characters to the left of the cursor, one at a time. This gives &lt;code&gt;*, World!&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Next, we have &lt;code&gt;[U]&lt;/code&gt;. This tells us to cancel out the previous input (if there's anything to cancel out). If you have two &lt;code&gt;[U]&lt;/code&gt;s, then you cancel out the last two instructions before the &lt;code&gt;[U]&lt;/code&gt;s. Logic extends to all number of &lt;code&gt;[U]&lt;/code&gt;s. Cancelling out the previous input, we have &lt;code&gt;H*, World!&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Next, we have &lt;code&gt;i&lt;/code&gt;. If there are no square brackets around the character, just add it to the text as a string, to the left of the cursor: &lt;code&gt;Hi*, World!&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Now, we have 9 &lt;code&gt;[R]&lt;/code&gt;s. &lt;code&gt;[R]&lt;/code&gt; represents Move Cursor Right, so we move the cursor right 9 times: &lt;code&gt;Hi, World!*&lt;/code&gt;. Note how it only actually takes 8 &lt;code&gt;[R]&lt;/code&gt;s to get to the end, so the final &lt;code&gt;[R]&lt;/code&gt; doesn't do anything.&lt;/p&gt;&#xA;&lt;p&gt;Now, a &lt;code&gt;[B]&lt;/code&gt;. This gives us &lt;code&gt;Hi, World*&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Finally, &lt;code&gt;.&lt;/code&gt;. This gives us &lt;code&gt;Hi, World.&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;//&lt;/p&gt;&#xA;&lt;p&gt;The list of special inputs is shown here:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[B] = Backspace&#xA;[U] = Undo&#xA;[R] = Move Cursor Right&#xA;[L] = Move Cursor Left&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Of course, within reason, you can change these special inputs (as long as it won't conflict with any non-special inputs.&lt;/p&gt;&#xA;&lt;p&gt;//&lt;/p&gt;&#xA;&lt;p&gt;With regards to other rules:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Left or Backspace when the cursor is furthest left does nothing.&lt;/li&gt;&#xA;&lt;li&gt;Right when the cursor is furthest right also does nothing.&lt;/li&gt;&#xA;&lt;li&gt;Undo when there's nothing to undo also does nothing.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Your Task&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Sample Input:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The current text field&lt;/li&gt;&#xA;&lt;li&gt;The position of the text cursor (&amp;lt;= length of current text field)&lt;/li&gt;&#xA;&lt;li&gt;The input sequence&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Wrt the input sequence, in my examples I have used a string where each instruction is separated by semicolons. You can take the input sequence in any reasonable format - but note that the no input can contain this character. You can expect the non-special inputs and the text field to contain no &lt;code&gt;\n&lt;/code&gt;s or &lt;code&gt;\t&lt;/code&gt;s. They will also not contain any &lt;code&gt;[B]&lt;/code&gt;s, &lt;code&gt;[&lt;/code&gt;, or whatever you're using for making the special input unique.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output: Return the final text field, after the sequence has been executed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test Cases&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input =&amp;gt; Output&#xA;&#xA;Hello, World!&#xA;5&#xA;[U];[U];[B];[B];[B];[B];[B];[U];i;[R];[R];[R];[R];[R];[R];[R];[R];[R];[B];.&#xA;=&amp;gt; Hi, World.&#xA;&#xA;3987^12 + 4365^12 = 4472^12&#xA;27&#xA;[L];[B];[L];[L];[B];[B];[B];[B];[B];[U];[U];[L];[U];[R];[B];5;[L];[L];[L];[L];[B];[L];[B];[B];[B];[L];[L];[R];[R];[L];[L];[L];[L];[L];[B];[L];[B];[B];[B];[B];[B];[B];[B];[B];4;[B];3&amp;quot;&#xA;=&amp;gt; 3^2 + 4^2 = 5^2&#xA;&#xA;I kinda don't like pepperoni on pizza, yknow?&#xA;0&#xA;[B];[B];[B];[L];[L];[R];[R];[R];[R];[R];[R];[R];[R];[R];[R];[R];[R];[R];[R];[U];[B];[B];[B];[R];[R];[R];[R];[R];[R];[R];[R];[R];[R];[R];[R]; ;[R];[R];[R];[R];[R];[B];[R];[R]; and garlic too actuallyk;[B];[U];[U]&#xA;=&amp;gt; I kinda do like pepper onion pizza, yknow?&#xA;&#xA;This is [tag:code-golf], so shortest answer wins.&#xA;13&#xA;[R];[R];[R];[R];[R];[R];[B];c;h;s;[U];a;[R];[R];[B];[B];[R];L;[U];[L];llenge;[R];r;[L];[B];[R];[B];[R];[R];[R];[R];[R];[R];[R];[R];[R];[R];[R];[B];[B];[B];[B];[B];b;[R];[R];[L];[U];[R];[R];response or ;[R];[R];[R];[R];[R];[R];[R];[R];[R];[R];[R];[R];[R];[R];[R];[R];[R];[B];[B];[B];[B];ill accepted as answer.;[U];ill be accepted as answer!&#xA;=&amp;gt; This is [tag:code-challenge], so best response or answer will be accepted as answer!&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so shortest answer wins.&lt;/p&gt;&#xA;" OwnerUserId="115553" LastEditorUserId="115553" LastEditDate="2023-07-23T09:48:23.233" LastActivityDate="2023-07-23T09:48:23.233" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25889" PostTypeId="2" ParentId="2140" CreationDate="2023-07-24T15:37:06.170" Score="1" Body="&lt;h2&gt;WumpusWars King of the Hill&lt;/h2&gt;&#xA;&lt;p&gt;This is probably going to stay in the sandbox for a few weeks, until I get the time to write the actual scoring code up... Yep, I'm both lazy and busy :P  I'm not very good at coding challenges but I'm good at thinking up creative ideas, so this time my idea is to try reviving the genre of KotH, as the last one on this site (Crazyhouse Chess) has been very unsuccessful (0 submissions for pretty obvious reasons) and the others are all many months old...&lt;/p&gt;&#xA;&lt;p&gt;Inspired by Hunt the Wumpus, an early command line game. It is somewhat popular among esolang communities as a programming challenge, especially for languages like Befunge. However, the original, singleplayer version is boring, so I wanna upgrade it. Hence I created WumpusWars, a better version of it!&lt;/p&gt;&#xA;&lt;p&gt;Story: You are a brave hunter in a dark cave, trying to kill the Wumpus, a mysterious monster. You start with 5 arrows that can kill the Wumpus if you shoot the arrow into the same room as the Wumpus. The cave consists of large rooms and small passageways in between. It can be represented, hence, with a graph, so that the rooms are nodes/vertices and the passageways are edges. There are a total of 50 vertices in the graph, each of them having a degree of at least 3, and the graph is guaranteed to be connected. Rooms are numbered from 0 to 49. You are spawned in a random room.&lt;/p&gt;&#xA;&lt;p&gt;The place is so dark that you cannot see anything, but you can feel, smell, and hear. Hence you have access to the functions listed in the source code below. Lemme explain what the functions are associated with in more detail:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Bats: There are 5 rooms in total that contain bats. Entering one of them will cause you to be carried away to a random empty room (&amp;quot;empty room&amp;quot; defined as a room without bats, pits, players, or the wumpus, but there can be corpses in the room).&lt;/li&gt;&#xA;&lt;li&gt;Pits: There are 5 rooms in total that contain a pit. Entering one of them will cause you to BOOM! CLASH! CRACK!&lt;/li&gt;&#xA;&lt;li&gt;Wumpus: It remains in its own room unless either an arrow is shot by anyone anywhere, or the game is in deathmatch mode (see gamemode list for explanation). If it enters your room then... You know what. When an arrow is shot or in deathmatch mode it moves randomly to adjacent rooms. Bats and pits do not affect it.&lt;/li&gt;&#xA;&lt;li&gt;Players: Other players. Note that you cannot shoot a player in the same room as you because the arrow is magically explosive and shooting in the same room as your own will cause you to BOOM! CLASH! CRACK!&lt;/li&gt;&#xA;&lt;li&gt;Corpse: When a player is killed by anything except a pit they become a corpse, and corpses don't move (obviously). You can collect arrows from the corpses, and if the corpse has already been arrow-collected there will be 0 arrows on it.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Also, every 10 rounds an arrow will spawn in an empty room. Entering that room will cause your number of arrows to be incremented by 1. Multiple arrows can spawn in the same room which gives you several at once, but that's pretty rare.&lt;/p&gt;&#xA;&lt;p&gt;You need to write a player program in Python and submit it as an answer to the post. Use the &amp;quot;PlayerName&amp;quot; class template. You will have to define with the &lt;code&gt;participate&lt;/code&gt; function which gamemodes are you participating in (the input to the function will be one of the abbreviation strings):&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Singleplayer (abbrev: &amp;quot;SP&amp;quot;). Precisely what the name says. Your score is the percentage of games in which you win (by shooting the Wumpus with an arrow). You lose if you die. After 100 rounds the game enters deathmatch mode, where the Wumpus keeps moving randomly every round regardless of whether an arrow is shot.&lt;/li&gt;&#xA;&lt;li&gt;Player vs Environment (abbrev: &amp;quot;PVE&amp;quot;). Same as singleplayer except that there are multiple players. The winner is the one who kills the Wumpus (if multiple players shoot it in the same round they split the point equally). If everyone dies then no one wins. Arrows have no effect on players. Deathmatch starts after 20*n rounds, where n is the number of players.&lt;/li&gt;&#xA;&lt;li&gt;Player vs Player (abbrev: &amp;quot;PVP&amp;quot;). Kinda PVE inverted. The Wumpus is now immortal –– but the players are not! If you get shot by other players or get eaten by the Wumpus you die and lose. The last one standing is the winner. If multiple people die last in the same round they split the point equally. It's deathmatch from start to finish.&lt;/li&gt;&#xA;&lt;li&gt;Among Us (abbrev: &amp;quot;IP&amp;quot; for Imposter and &amp;quot;CM&amp;quot; for Crewmate). The Wumpus is immortal. Some players become impostors. Others are crewmates. Impostors get 3 arrows at the beginning (number might change according to # of players). Crewmates start with no arrows (but can still pick randomly spawned arrows up). Crewmates are immune from arrows fired by other crewmates. If all impostors die then all crewmates (dead or alive) win a point. If all crewmates die then all impostors (dead or alive) win a point. No deathmatch.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;If you have any ideas please lemme know!&lt;/p&gt;&#xA;&lt;p&gt;Source code:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;class Environment:&#xA;    def __init__():&#xA;        # Hidden&#xA;    def legal_moves(player) -&amp;gt; list:&#xA;        # Returns an ordered list of adjacent rooms&#xA;        # Example: [5, 8, 10]&#xA;    def bats(player) -&amp;gt; bool:&#xA;        # True if bats are in adjacent rooms, false otherwise&#xA;    def pits(player) -&amp;gt; bool:&#xA;        # True if pits are in adjacent rooms, false otherwise&#xA;    def wumpus(player) -&amp;gt; bool:&#xA;        # True if wumpus is in adjacent rooms, false otherwise&#xA;    def others(player) -&amp;gt; bool:&#xA;        # True if the shortest path from you to the nearest player passes at most 2 edges.&#xA;    def arrows(player) -&amp;gt; int:&#xA;        # Returns the number of arrows player has&#xA;    def corpse(player) -&amp;gt; list:&#xA;        # Returns a list of integers&#xA;        # The length of the list is the number of corpses in the player's room&#xA;        # Elements in the list are the number of arrows on each corpse&#xA;    # Other functions hidden&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Template:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;class PlayerName: # Change the name!&#xA;    def __init__(mode:str, room:int, env):&#xA;        # Gamemode. Such as 'SP'.&#xA;        self.mode = mode&#xA;        # Current room number.&#xA;        self.room = room&#xA;        # Environment&#xA;        self.env = env&#xA;    def participate() -&amp;gt; bool:&#xA;        # Add code here...&#xA;        &#xA;        # Return True if self.mode is a supported gamemode&#xA;        # False if not&#xA;    def action() -&amp;gt; tuple:&#xA;        legal_moves = self.env.legal_moves(self)&#xA;        bats = self.env.bats(self)&#xA;        pits = self.env.pits(self)&#xA;        wumpus = self.env.wumpus(self)&#xA;        others = self.env.others(self)&#xA;        arrows = self.env.arrows(self)&#xA;        corpse = self.env.corpse(self)&#xA;&#xA;        # No methods or variables from Environment class allowed below here!&#xA;        # Suggested to first check which gamemode and use strats accordingly.&#xA;&#xA;        # Add code here...&#xA;&#xA;        # Return a tuple of type (bool, int)&#xA;        # The bool is True for shooting, False for moving&#xA;        # The int is the cave number to shoot or move to&#xA;        # An illegal move signifies doing nothing&#xA;&lt;span class=&quot;math-container&quot;&gt;```&lt;/span&gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="118810" LastEditorUserId="118810" LastEditDate="2023-07-26T02:16:35.610" LastActivityDate="2023-07-26T02:16:35.610" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25890" PostTypeId="2" ParentId="2140" CreationDate="2023-07-24T19:00:37.963" Score="-2" Body="&lt;h1&gt;KCMCK&lt;/h1&gt;&#xA;&lt;p&gt;Print this ASCII art:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  +--------------  +-+                   +-+   +--------------  |&#xA; ++                | |                   | |  ++                |&#xA; |                 |  \                  / |  |                 |&#xA; |                 |   \                /  |  |                 |&#xA; |                 |    \              /   |  |                 |&#xA; |                 |     \            /    |  |                 |&#xA; |                 |      \          /     |  |                 |&#xA; |                 |       \        /      |  |                 |&#xA; |                 |        \      /       |  |                 |&#xA; |                 |         \    /        |  |                 |&#xA; ++                |          \  /         |  ++                |&#xA;  +--------------  |           \/          |   +--------------  |&#xA;________________________________________________________________|&#xA;________________________________________________________________|&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Shortest code in characters wins!&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any leading whitespace must be the same on every line.&lt;/li&gt;&#xA;&lt;li&gt;No restrictions on trailing whitespace.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="117478" LastActivityDate="2023-07-24T19:00:37.963" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25892" PostTypeId="2" ParentId="2140" CreationDate="2023-07-25T17:49:47.050" Score="2" Body="&lt;p&gt;First attempt at a question. Feedback appreciated.&lt;/p&gt;&#xA;&lt;hr&gt;&#xA;&lt;h1&gt;Calculating Complete Graphs&lt;/h1&gt;&#xA;&lt;img src=&quot;https://upload.wikimedia.org/wikipedia/commons/thumb/9/9e/Complete_graph_K7.svg/800px-Complete_graph_K7.svg.png&quot; width=&quot;200&quot; height=&quot;200&quot;&gt;&#xA;&lt;p&gt;The above picture shows a complete graph with &lt;code&gt;7&lt;/code&gt; vertices. According to &lt;a href=&quot;https://en.wikipedia.org/wiki/Complete_graph&quot; rel=&quot;nofollow noreferrer&quot;&gt;Wikipedia&lt;/a&gt;, &amp;quot;a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge.&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;Today, we're going to be &lt;em&gt;repairing&lt;/em&gt; incomplete graphs.&lt;/p&gt;&#xA;&lt;p&gt;Given a 2D Array (representing an incomplete graph) where each inner array represents a vertex, &lt;strong&gt;determine the number of additional edges required to create a complete graph.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Here's an example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[2, 3], [1, 3], [1, 2, 4], [3]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And this would generate a graph that looks like this:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/aXzJ9.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/aXzJ9.png&quot; alt=&quot;Incomplete&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;To make this graph complete, it is obvious that we only need to add &lt;strong&gt;two&lt;/strong&gt; edges.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/WpqTH.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/WpqTH.png&quot; alt=&quot;Complete&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For completeness (&lt;s&gt;haha&lt;/s&gt;), here's what the completed 2D array would look like (but this is not what your program should output):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[2, 3, 4], [1, 3, 4], [1, 2, 4], [1, 2, 3]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;i&gt;Notes:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;There is an array for every vertex, but your code should be able to account for empty arrays (which means the vertex is originally not connected to any other vertex).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;I don't know if this is important, but you can assume the vertexes listed in each inner array will be listed in increasing order. Also, no vertex will be connected to itself.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If vertex a is connected to vertex b, then vertex b is connected to vertex a. Symmetric.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;/i&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;And yeah, that's pretty much it. Here are some test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input                                                           Output&#xA;&#xA;[[], [], []]                                                    3&#xA;[[2], [1], [4], [3]]                                            4 &#xA;[[2, 3], [1, 3], [1, 2, 4], [3]]                                2&#xA;[[2, 5], [1, 3], [2, 4], [3], [1]]                              6&#xA;[[3, 4, 6], [3, 4], [1, 2, 5], [1, 2], [3, 6], [1, 5]]          8&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;This question is tagged &lt;strong&gt;code-golf&lt;/strong&gt;. Standard rules apply.&lt;/p&gt;&#xA;" OwnerUserId="118427" LastActivityDate="2023-07-25T17:49:47.050" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25893" PostTypeId="2" ParentId="2140" CreationDate="2023-07-25T22:53:40.833" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/263566/calculating-transitive-closure&quot;&gt;Calculating Transitive Closure&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118427" LastEditorUserId="118427" LastEditDate="2023-07-31T12:30:17.713" LastActivityDate="2023-07-31T12:30:17.713" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25894" PostTypeId="1" CreationDate="2023-07-26T07:35:47.893" Score="2" ViewCount="108" Body="&lt;p&gt;An extra W here. Better get someone fixing it XD&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/nBhgG.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/nBhgG.png&quot; alt=&quot;Typo in CGCC Header Banner&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="118810" LastEditorUserId="66833" LastEditDate="2023-07-26T17:51:39.700" LastActivityDate="2023-07-26T17:52:02.090" Title="Typo in Site Header Banner!" Tags="|bug|status-bydesign|status-deferred|site-design|" AnswerCount="1" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25895" PostTypeId="2" ParentId="2140" CreationDate="2023-07-26T14:38:14.060" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/263452/solve-quadratic-equations-when-11-0&quot;&gt;Solve quadratic equations when 1+1=0&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;This is the code-golf version of this challenge, I also created a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/25896#25896&quot;&gt;fastest-code version&lt;/a&gt; that focuses on solving one (important) special case&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-07-28T08:34:41.053" LastActivityDate="2023-07-28T08:34:41.053" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25896" PostTypeId="2" ParentId="2140" CreationDate="2023-07-26T14:39:02.703" Score="1" Body="&lt;h1&gt;Efficiently solve quadratic equations when 1+1=0&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;This is a sequel to my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/263452/solve-quadratic-equations-when-11-0&quot;&gt;previous challenge&lt;/a&gt; about solving quadratic equations in the shortest possible code, this challenge is about solving the same task the fastest possible way&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;The goal of this challenge is to find a solutions for a general quadratic polynomial &lt;code&gt;ax²+bx+c&lt;/code&gt;.&#xA;Meaning be an integer &lt;code&gt;r&lt;/code&gt; such that &lt;code&gt;a*r*r+b*b+c&lt;/code&gt; is zero, with &lt;code&gt;+&lt;/code&gt; meaning exclusive or and &lt;code&gt;*&lt;/code&gt; being carry-less multiplication (use xor as addition in binary long multiplication).&lt;/p&gt;&#xA;&lt;p&gt;To simplify the problem, you can assume that both &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; are one, so you only have to solve equations of the form &lt;code&gt;r*(r+1)=n&lt;/code&gt; for an integer &lt;code&gt;n&lt;/code&gt;. &lt;em&gt;As any quadratic equation can be converted in this normal form, this is enough to solve the general case (up to linear transformations)&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your challenge will be to solve this simplified equation in the most efficient way possible.&lt;/p&gt;&#xA;&lt;p&gt;Input: An integer &lt;code&gt;n&lt;/code&gt;&#xA;Output: A number &lt;code&gt;r&lt;/code&gt; such that &lt;code&gt;r*(r+1)=n&lt;/code&gt; with &lt;code&gt;*&lt;/code&gt; being multiplication without carry and &lt;code&gt;+&lt;/code&gt; being exclusive or.&lt;/p&gt;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may assume there is an integral solution to the equation&lt;/li&gt;&#xA;&lt;li&gt;You only have to return one of the two roots (the other root will only differ in the last bit)&lt;/li&gt;&#xA;&lt;li&gt;You program should be able to handle inputs up to at least &lt;code&gt;0x5555555555555555aaaaaaaaaaaaaaaa&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The algorithm you are using should work for arbitrarily large &lt;code&gt;n&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The program with the lowest time complexity in &lt;code&gt;n&lt;/code&gt; wins&lt;/li&gt;&#xA;&lt;li&gt;For your score you can assume that xor-addition and xor-multiplication are computed in &lt;code&gt;O(1)&lt;/code&gt; (even if your program might need &lt;code&gt;O(n²)&lt;/code&gt; operations)&lt;/li&gt;&#xA;&lt;li&gt;If multiple programs have the same complexity, the shortest program (per language) wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Examples (both possible solutions given):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;6 -&amp;gt; 2 | 3&#xA;20 -&amp;gt; 4 | 5&#xA;18 -&amp;gt; 6 | 7&#xA;72 -&amp;gt; 8 | 9&#xA;78 -&amp;gt; 10 | 11&#xA;...&#xA;113427455640312821160607117168492587690 = 0x5555555555555555aaaaaaaaaaaaaaaa -&amp;gt; 0xfffffffffffffffe | 0xffffffffffffffff&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-fastest-algorithm-tooltip-container&quot;&gt;fastest-algorithm&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/polynomials&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;polynomials&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;polynomials&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-polynomials-tooltip-container&quot;&gt;polynomials&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-math-tooltip-container&quot;&gt;math&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Would this be an interesting challenge ?&lt;/li&gt;&#xA;&lt;li&gt;Should I extend the challenge to general polynomials (this can be done in O(1) multiplications/divisions after solving the original problem (or computing the normal square root in some cases))?&lt;/li&gt;&#xA;&lt;li&gt;Is the rule about multiplication&amp;amp;addition do not count towards the complexity clear?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-08-31T08:48:55.670" LastActivityDate="2023-08-31T08:48:55.670" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25897" PostTypeId="2" ParentId="2140" CreationDate="2023-07-26T17:05:23.603" Score="2" Body="&lt;h1&gt;My math license got revoked&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to replicate the method described in &lt;a href=&quot;https://xkcd.com/410/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://xkcd.com/410/&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Not going to develop the question more until I have enough time to get some test cases together and make sure that there are complex friendly numbers.&lt;/p&gt;&#xA;&lt;p&gt;I'm sandboxing this for the future, but here's a (work-in-progress) python reference implementation:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;def is_divisible(a, b):&#xA;return a // b == a / b&#xA;&#xA;def sum_divisors(a):&#xA;    divisors = []&#xA;&#xA;    for real_part in range(1, a.real):&#xA;        for complex_part in range(1, a.imag):&#xA;&#xA;            number_to_test_if_divisor = complex(real_part, complex_part)&#xA;            if is_divisible(a, number_to_test_if_divisor):&#xA;                divisors.append(number_to_test_if_divisor)&#xA;&#xA;    return sum(divisors)&#xA;&#xA;def is_friendly(a, b):&#xA;    return sum_divisors(a) / a == sum_divisors(b) / b&#xA;&#xA;&#xA;a = complex(input(&amp;quot;a: &amp;quot;))&#xA;b = complex(input(&amp;quot;b: &amp;quot;))&#xA;&#xA;print(is_friendly(a, b))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="114355" LastActivityDate="2023-07-26T17:05:23.603" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25898" PostTypeId="2" ParentId="25894" CreationDate="2023-07-26T17:18:07.057" Score="3" Body="&lt;h3&gt;This almost certainly won't get changed&lt;/h3&gt;&#xA;&lt;p&gt;To start with, I'd argue that it isn't even a &lt;a href=&quot;/questions/tagged/bug&quot; class=&quot;post-tag required-tag&quot; title=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;bug&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-bug-tooltip-container&quot;&gt;bug&lt;/a&gt; in the first place, but I think that's beside the point to be honest.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/17760/66833&quot;&gt;SE designed our banner&lt;/a&gt; to&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;be more representative of Code Golfing&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The exact design was done by them, not by any of us, as far as I can tell. As such, what is and isn't an intended part of the design is, more or less, unknowable to us. It certainly appears to be a bunch of different programs that output &lt;code&gt;Hello, World!&lt;/code&gt;, but whether any of them are incorrect or not, only SE and the original designer can say. Therefore, especially given that it's incredibly minor and we've gone 4 years without anyone raising it as an issue before, I &lt;em&gt;really&lt;/em&gt; doubt it'll get changed.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, at least for the moment, I'm tagging this as &lt;a href=&quot;/questions/tagged/status-bydesign&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-bydesign&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;status-bydesign&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-status-bydesign-tooltip-container&quot;&gt;status-bydesign&lt;/a&gt; and &lt;a href=&quot;/questions/tagged/status-deferred&quot; class=&quot;post-tag moderator-tag&quot; title=&quot;show questions tagged &amp;#39;status-deferred&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;status-deferred&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-status-deferred-tooltip-container&quot;&gt;status-deferred&lt;/a&gt;. If a designer at SE has a free moment and wants to fix this, however, they're more than welcome to.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2023-07-26T17:52:02.090" LastActivityDate="2023-07-26T17:52:02.090" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25899" PostTypeId="1" CreationDate="2023-07-27T01:21:13.177" Score="10" ViewCount="191" Body="&lt;p&gt;&lt;sub&gt;Not sure if this is suitable for the main page so I post it here.&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/70837/say-what-you-see/108862&quot;&gt;Say What You See&lt;/a&gt; -&amp;gt;&#xA;&lt;a href=&quot;https://hunaphu.github.io/g/q/70837.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://hunaphu.github.io/g/q/70837.html&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Type to filter on a language. Feel free to use it or include it in your question.&lt;/p&gt;&#xA;&lt;p&gt;Currently updates every 5 minutes (+1 minutes from github pages) if the question has activity. No history, questions are added when they have activity; might change. Parses most standard formulations for bytes but many non-standard are not captured.&lt;/p&gt;&#xA;&lt;h6&gt;Questions in comments&lt;/h6&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;g, x, w, (a)ll are clickable keyboard shortcuts for predefined filters. (g)eneral (shared by x, w), x for *nix and w for windows.&lt;/li&gt;&#xA;&lt;li&gt;Backend: cron runs a script checking for activity using stackapp api. If any, update the affected questions, process, and write out the tables. cat with html template and commit.&#xA;Instant update could be done using Websockets but that is not officially supported (and keeps disconnecting for me).&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;There is also an index at &lt;a href=&quot;https://hunaphu.github.io/g/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://hunaphu.github.io/g/&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Bonus:&#xA;Looks decent in Lynx and can be used to browse questions but without sorting.&#xA;&lt;img src=&quot;https://i.stack.imgur.com/Lwddk.png&quot; width=&quot;992&quot; /&gt;&lt;/p&gt;&#xA;&lt;img src=&quot;https://i.stack.imgur.com/rROBw.png&quot; width=&quot;992&quot; /&gt;&#xA;" OwnerUserId="87790" LastEditorUserId="87790" LastEditDate="2023-07-27T19:11:16.147" LastActivityDate="2023-07-27T19:11:16.147" Title="Scoreboard: Searchable, sortable answers with preview" Tags="|discussion|userscript|scoreboard|" AnswerCount="0" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25901" PostTypeId="2" ParentId="2140" CreationDate="2023-07-27T12:15:47.057" Score="-2" Body="&lt;h1&gt;Be a cat&lt;/h1&gt;&#xA;&lt;p&gt;I have not found a single challenge that asks for a plain cat programme. The closest I have found requires you to print &lt;code&gt;cat goes meow&lt;/code&gt; when the input is &lt;code&gt;cat&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;In this challenge, you must read everything from &lt;code&gt;STDIN&lt;/code&gt;, or an acceptable alternative, and print the exact text to &lt;code&gt;STDOUT&lt;/code&gt;, or an acceptable alternative, with only the leading and trailing whitespace in the input.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Have I been so silly that I missed a duplicate?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="117478" LastActivityDate="2023-07-27T12:15:47.057" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25902" PostTypeId="2" ParentId="2140" CreationDate="2023-07-27T20:26:53.990" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/263530/compute-the-logarithm-of-a-matrix&quot;&gt;Compute the logarithm of a matrix&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-07-30T10:10:51.180" LastActivityDate="2023-07-30T10:10:51.180" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25904" PostTypeId="2" ParentId="2140" CreationDate="2023-07-28T15:02:11.380" Score="3" Body="&lt;h1&gt;Efficient Ouroboros Quine&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-challenge-tooltip-container&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-quine-tooltip-container&quot;&gt;quine&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;An ouroborus quine is a program that (taking no input) outputs the source code of a different program, which in turn outputs the source code of a different program, and so on, until after some number of iterations, the result is the source code of the original program. In some cases (often called quine relays) each program is in a different language, but here all the programs forming an ouroboros should be in the same language. Let the period of an ouroboros quine, &lt;span class=&quot;math-container&quot;&gt;\$T\$&lt;/span&gt;, be the number of distinct programs involved in the loop.&lt;/p&gt;&#xA;&lt;p&gt;The challenge is to find the most efficient ouroboros quine, achieving the maximum period using the minimum program size. Let the size, &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;, be the number of &lt;strong&gt;bits&lt;/strong&gt; (not bytes) in the source code of largest program in the ouroboros. Your score is &lt;span class=&quot;math-container&quot;&gt;\$\frac{\log_2 T}{N}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This formula is scaled such that the theoretical maximum score is arbitrarily close to 2, for arbitrarily large &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;. A score of 1 is achieved if every possible string of length &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; is a valid program which forms a part of an ouroboros quine. The maximum theoretical score also requires that every possible string of length less than &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; is a program forming part of the ouroboros.&lt;/p&gt;&#xA;&lt;p&gt;As achieving an arbitrarily high score may require an arbitrarily large program, it is permitted to describe the program (and prove/demonstrate its correctness), rather than providing an arbitrarily large amount of raw code.&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this an interesting (and novel) question?&lt;/li&gt;&#xA;&lt;li&gt;Do I need to specify the output format more precisely, or do standard guidelines on output format suffice?&lt;/li&gt;&#xA;&lt;li&gt;Is allowing a program description, rather than raw code, a disastrous idea? Or, conversely, is it even necessary to state that this is permitted?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="118967" LastActivityDate="2023-07-28T15:02:11.380" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25907" PostTypeId="2" ParentId="6983" CreationDate="2023-07-29T07:26:03.937" Score="2" Body="&lt;p&gt;Even now, this is Code Golf &lt;em&gt;and Coding Challenges&lt;/em&gt;.  The former name (Programming Puzzles and Code Golf) had more emphasis on the non-golf challenges, but the name change didn't make us golf-only.  Whenever I get frustrated at being outgolfed in esolangs, I simply have a stroll through the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-challenge-tooltip-container&quot;&gt;code-challenge&lt;/a&gt; or old &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-popularity-contest-tooltip-container&quot;&gt;popularity-contest&lt;/a&gt; questions and pick a fun one.&lt;/p&gt;&#xA;&lt;p&gt;In a sense, there's more than one community that shares this site, and it's a choice whether to mix with the most competitive golfers or to find another island to settle on.  It's a bit like choosing to do a fun run somewhere scenic rather instead of aiming to break world records.&lt;/p&gt;&#xA;&lt;p&gt;FWIW, my first golf answer outscored the winner by more than 2:1, despite being 88% longer.  Choosing a language seemingly unsuited for the task and explaining how it operates will have influenced voters, I think.&lt;/p&gt;&#xA;" OwnerUserId="39490" LastEditorUserId="39490" LastEditDate="2023-08-01T05:58:01.933" LastActivityDate="2023-08-01T05:58:01.933" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25908" PostTypeId="2" ParentId="2140" CreationDate="2023-07-29T14:19:36.607" Score="1" Body="&lt;h1&gt;Pack the sequence!&lt;/h1&gt;&#xA;&lt;p&gt;You have a list of sequences of numbers &lt;em&gt;(1 byte max, unsigned)&lt;/em&gt; as an input, e.g.:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;4 6 4 9 3 15 150&#xA;3 2 1&#xA;9 6 4 1&#xA;…&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your task is to pack as many of them as possible into the square composed from the numbers from this list - the size of square is also an input.&lt;/p&gt;&#xA;&lt;p&gt;The square of size 4 may look like:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;10 13 56 30&#xA;98 11 10  4&#xA;15 36 77 86&#xA; 1  1 45 11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The numbers may repeat as many times as you want.&lt;/p&gt;&#xA;&lt;p&gt;The sequence is considered &amp;quot;packed&amp;quot; if you can draw the line from the first number inside square to the next adjacent number in sequence and so on. Each number may be used only once for a single sequence.&lt;/p&gt;&#xA;&lt;p&gt;For example, the sequence &lt;code&gt;36 11 77 11&lt;/code&gt; is packed into the square above - the number may have up to 8 adjacent numbers: top, left, right, bottom and diagonals. While the sequence &lt;code&gt;11 36 10 11&lt;/code&gt; is not - since the same number 11 can't be used twice.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;For the packed sequence of size S you get 2^S scores. Each sequence counts only once - even if you can pack it multiple times in the same square.&lt;/p&gt;&#xA;&lt;h2&gt;Victory Condition&lt;/h2&gt;&#xA;&lt;p&gt;The algorithm wins if it outputs the square of expected size with the maximum scoring for some hidden test lists. The algorithm is expected to be general enough to work with any random list.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Program should output square as a sequence of numbers on a single line.&#xA;For example: &lt;code&gt;1 2 3 4 5 6 7 8 9&lt;/code&gt; is the square of size 3:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3&#xA;4 5 6&#xA;7 8 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Limitations&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Any list contains [1, 1000000] sequences.&lt;/li&gt;&#xA;&lt;li&gt;Any sequence contains [N, 20] numbers, where N is size of square.&lt;/li&gt;&#xA;&lt;li&gt;The size of square N is [2, 10].&lt;/li&gt;&#xA;&lt;li&gt;Program should use no more than 1Gb of user-space memory.&lt;/li&gt;&#xA;&lt;li&gt;Program should work no more than 60 seconds and use a single thread.&lt;/li&gt;&#xA;&lt;li&gt;Program may output more than one square - one per line. The last full square after 60 seconds is considered the answer.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="118987" LastActivityDate="2023-07-29T14:19:36.607" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25909" PostTypeId="2" ParentId="2140" CreationDate="2023-07-30T10:23:04.383" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/263627/is-this-set-laminar&quot;&gt;Is this set laminar?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-08-02T10:43:19.420" LastActivityDate="2023-08-02T10:43:19.420" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25910" PostTypeId="2" ParentId="2140" CreationDate="2023-07-30T11:32:55.227" Score="3" Body="&lt;h2&gt;Cut a Pizza into infinite number of slices using the minimum number of cuts&lt;/h2&gt;&#xA;&lt;p&gt;It is well known that with &lt;code&gt;n&lt;/code&gt; straight cuts it is possible to cut a circle into &lt;span class=&quot;math-container&quot;&gt;\$\frac{n^2 + n + 2}{2}\$&lt;/span&gt; pieces. This is known as the &lt;a href=&quot;https://en.wikipedia.org/wiki/Lazy_caterer%27s_sequence&quot; rel=&quot;nofollow noreferrer&quot;&gt;Lazy Caterer's Sequence&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/isCQq.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/isCQq.png&quot; alt=&quot;https://en.wikipedia.org/wiki/Lazy_caterer%27s_sequence#/media/File:Central_polygonal_numbers.svg&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;However, finding the right angles to cut the circle is less easy. The areas after each cut become very small.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to find these angles. Output a infinite sequence of pairs of angles such that if you connect each pair by a line, you'd cut the circle into &lt;span class=&quot;math-container&quot;&gt;\$\frac{n^2 + n + 2}{2}\$&lt;/span&gt; pieces. Angles may be either in degrees, radians, or any other reasonable way to measure angles, can be either floating points, fractions, or any other reasonable way to represent numbers.&lt;/p&gt;&#xA;&lt;p&gt;As with standard sequence rules, you may:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Print the pairs infinitely&lt;/li&gt;&#xA;&lt;li&gt;Take an input N then output the Nth chord&lt;/li&gt;&#xA;&lt;li&gt;Take an input N then output the first N chords.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, shortest answer wins.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="108687" LastEditDate="2023-07-30T12:07:04.710" LastActivityDate="2023-07-30T12:07:04.710" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25911" PostTypeId="2" ParentId="2140" CreationDate="2023-07-31T13:07:42.703" Score="0" Body="&lt;h1&gt;JSON Data? ASCII is better!&lt;/h1&gt;&#xA;&lt;p&gt;Write a function that prints JSON data using &lt;a href=&quot;https://en.wikipedia.org/wiki/ASCII_art&quot; rel=&quot;nofollow noreferrer&quot;&gt;ASCII art&lt;/a&gt;, and takes a dictionary/object as input.&lt;/p&gt;&#xA;&lt;p&gt;Example&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input:&#xA;{&#xA;    &amp;quot;columns&amp;quot;: [&amp;quot;firstname&amp;quot;, &amp;quot;lastname&amp;quot;],&#xA;    &amp;quot;data&amp;quot;: [&#xA;        {&amp;quot;firstname&amp;quot;: &amp;quot;John&amp;quot;, &amp;quot;lastname&amp;quot;: &amp;quot;Doe&amp;quot;},&#xA;        {&amp;quot;firstname&amp;quot;: &amp;quot;Jack&amp;quot;, &amp;quot;lastname&amp;quot;: &amp;quot;Barrock&amp;quot;},&#xA;        {&amp;quot;firstname&amp;quot;: &amp;quot;John&amp;quot;, &amp;quot;lastname&amp;quot;: &amp;quot;Skeet&amp;quot;},&#xA;        ....&#xA;    ]&#xA;}&#xA;&#xA;Output:&#xA;&#xA;+---------------------------+&#xA;|  firstname  |  lastname   |&#xA;+---------------------------+&#xA;|     John    |     Doe     |&#xA;|     Jack    |   Barrock   |&#xA;| ...                       |&#xA;+---------------------------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so fewest bytes win.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Note:&lt;/strong&gt; The input will always have a column attribute, and will always have a data attribute. Think of it as SQL.&lt;/p&gt;&#xA;" OwnerUserId="118984" LastActivityDate="2023-07-31T13:07:42.703" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25912" PostTypeId="2" ParentId="2140" CreationDate="2023-08-01T04:24:38.770" Score="2" Body="&lt;h1&gt;Base-10 to bijective base-10&lt;/h1&gt;&#xA;&lt;p&gt;Convert base-10 positive integer (base-10 number using digits &lt;code&gt;0123456789&lt;/code&gt;) to bijective base-10 (base-10 number using digits &lt;code&gt;123456789A&lt;/code&gt;, where &lt;code&gt;A&lt;/code&gt; means 10).&lt;/p&gt;&#xA;&lt;p&gt;Shortest code wins.&lt;/p&gt;&#xA;&lt;p&gt;You can also choose another symbol in place of the &lt;code&gt;A&lt;/code&gt;.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2023-08-01T04:24:38.770" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25913" PostTypeId="2" ParentId="2140" CreationDate="2023-08-01T10:36:40.387" Score="1" Body="&lt;p&gt;The New York Times have a new game -&lt;/p&gt;&#xA;&lt;h1&gt;Letter Boxed&lt;/h1&gt;&#xA;&lt;p&gt;(try it at &lt;a href=&quot;https://www.nytimes.com/puzzles/letter-boxed&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.nytimes.com/puzzles/letter-boxed&lt;/a&gt;, the rules below match it).&lt;/p&gt;&#xA;&lt;p&gt;The game consists of a square, with three Letters on each side. The aim of the game is to join the letters to make words. Each word must start with the last letter of the previous word; and each letter must not share a side of the square with the previous letter. The aim is to solve (use all of the letters at least once) in as few words as possible.&lt;/p&gt;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  H  E  M&#xA;&#xA;O         U&#xA;&#xA;S         R&#xA;&#xA;W         N&#xA;&#xA;  A  I  G&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You could use all of the letters in one go to form the word &lt;code&gt;Housewarming&lt;/code&gt;, but &lt;code&gt;Swim&lt;/code&gt; would be forbidden because the S and the W are consecutive and share a side on the square.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, &lt;code&gt;HOUSE&lt;/code&gt; followed by &lt;code&gt;ERGO&lt;/code&gt; would be allowed, but &lt;code&gt;HOUSE&lt;/code&gt; followed by &lt;code&gt;WARM&lt;/code&gt; would not because they don't share a last/first letter (&lt;code&gt;E-&amp;gt;W&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;p&gt;Letters can be repeated (e.g. &lt;code&gt;WEARER&lt;/code&gt;), but not sequentially (so &lt;code&gt;SEEN&lt;/code&gt; is forbidden), because they share a side.&lt;/p&gt;&#xA;&lt;h2&gt;The challenge&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, usual rules.&lt;/p&gt;&#xA;&lt;p&gt;The aim is to write a program that takes in the set of letters in any reasonably form (a string, or an array of arrays, for example); along with a word list (or you can read the word list in your code for free).&lt;/p&gt;&#xA;&lt;p&gt;The output should be a word of sequential list of words that solve the puzzle by using all of the letters at least once.&lt;/p&gt;&#xA;&lt;p&gt;The puzzle will always be solvable for the letters and word list given, but not always in one word.&lt;/p&gt;&#xA;" OwnerUserId="62289" LastActivityDate="2023-08-01T10:36:40.387" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25914" PostTypeId="2" ParentId="2140" CreationDate="2023-08-02T05:03:32.053" Score="5" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/263716/compute-the-convolution-of-two-strings&quot;&gt;Compute the convolution of two strings&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-08-05T06:24:18.603" LastActivityDate="2023-08-05T06:24:18.603" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25915" PostTypeId="2" ParentId="2140" CreationDate="2023-08-02T14:02:38.667" Score="4" Body="&lt;h2&gt;Is this ordering total?&lt;/h2&gt;&#xA;&lt;p&gt;Given a matrix like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[  0 -1 -1]&#xA;[  1  0 -1]&#xA;[  1  1  0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Determine if it represents a proper total ordering. A ordering is total if:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is transitive for &lt;code&gt;&amp;lt;&lt;/code&gt; and &lt;code&gt;&amp;gt;&lt;/code&gt;: &lt;span class=&quot;math-container&quot;&gt;\$\forall a, b, c: a&amp;lt;b \wedge b&amp;lt;c \implies a&amp;lt;c \$&lt;/span&gt;. For all a,b, c, if a is less than b and b less than c than a is less than c.&lt;/li&gt;&#xA;&lt;li&gt;It is transitive for equality: &lt;span class=&quot;math-container&quot;&gt;\$\forall a, b, c: a=b \wedge b=c \implies a=c \$&lt;/span&gt;. For all &lt;code&gt;a&lt;/code&gt;,&lt;code&gt;b&lt;/code&gt;,&lt;code&gt;c&lt;/code&gt;, if &lt;code&gt;a&lt;/code&gt; equals &lt;code&gt;b&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt; equals &lt;code&gt;c&lt;/code&gt;, then &lt;code&gt;a&lt;/code&gt; equals &lt;code&gt;c&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;It is substitutive &lt;span class=&quot;math-container&quot;&gt;\$\forall a,b,c: a=b \wedge b&amp;lt;c \implies a&amp;lt;c\$&lt;/span&gt;. For all &lt;code&gt;a&lt;/code&gt;, &lt;code&gt;b&lt;/code&gt;, &lt;code&gt;c&lt;/code&gt;, if &lt;code&gt;a&lt;/code&gt; equals &lt;code&gt;b&lt;/code&gt;  and &lt;code&gt;b&lt;/code&gt; is less than &lt;code&gt;c&lt;/code&gt; then &lt;code&gt;a&lt;/code&gt; is also less than &lt;code&gt;c&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;In this matrix I use &lt;code&gt;1&lt;/code&gt; to represent less than, &lt;code&gt;-1&lt;/code&gt; to represent greater than, and &lt;code&gt;0&lt;/code&gt; to represent equal. However, you are free to use any 3 distinct values (except complete or partial functions)&lt;/p&gt;&#xA;&lt;p&gt;Given a matrix representing the ordering of every pair, output one value if the ordering is proper and total, and another if not.&lt;/p&gt;&#xA;&lt;p&gt;You may assume the input is already anti-symetric, eg. M[a][b] == -M[b][a]. No need to check for that.&lt;/p&gt;&#xA;&lt;h3&gt;Test cases TBD&lt;/h3&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-08-03T13:41:49.523" LastActivityDate="2023-08-03T13:41:49.523" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25917" PostTypeId="2" ParentId="2140" CreationDate="2023-08-03T15:16:28.053" Score="1" Body="&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Create a program that, when entered two numbers &lt;em&gt;A&lt;/em&gt; as a numerator and &lt;em&gt;B&lt;/em&gt; as a denominator, generates a list of equivalent fractions based off the fraction &lt;em&gt;A&lt;/em&gt;/&lt;em&gt;B&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Definition&lt;/h1&gt;&#xA;&lt;p&gt;Equivalent fractions are any set of fractions that &lt;em&gt;&lt;strong&gt;equal the same when converted to a decimal number.&lt;/strong&gt;&lt;/em&gt; Example: 3/6 (three sixths), 2/4 (two fourths) and 1/2 (one half) are equivalent fractions, since each fraction equals 0.5 when converted to a decimal number.&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Generate &lt;em&gt;only&lt;/em&gt; the equivalent fractions with denominators smaller than &lt;em&gt;B&lt;/em&gt;. Do &lt;em&gt;not&lt;/em&gt; generate equivalent fractions with decimal points or negative numbers.&lt;/li&gt;&#xA;&lt;li&gt;Your output must look like this: (This example is for entering 10 as &lt;em&gt;A&lt;/em&gt; and 20 as &lt;em&gt;B&lt;/em&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;1/2 2/4 3/6 4/8 5/10 6/12 7/14 8/16 9/18 10/20&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If you cannot generate equivalent fractions with denominators smaller than &lt;em&gt;B&lt;/em&gt;, output &lt;em&gt;A&lt;/em&gt;/&lt;em&gt;B&lt;/em&gt; itself: (This example is for entering 1 as &lt;em&gt;A&lt;/em&gt; and 2 as &lt;em&gt;B&lt;/em&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;1/2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The answer with the lowest amount of bytes wins.&lt;/li&gt;&#xA;&lt;li&gt;You may use any programming language of your choice.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="119076" LastEditorUserId="119076" LastEditDate="2023-08-05T08:20:47.647" LastActivityDate="2023-08-05T08:20:47.647" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25920" PostTypeId="2" ParentId="2140" CreationDate="2023-08-03T16:56:09.580" Score="3" Body="&lt;h1&gt;Write a Tank AI&lt;/h1&gt;&#xA;&lt;h1&gt;Preamble&lt;/h1&gt;&#xA;&lt;p&gt;This preamble will be removed in the real post.&lt;/p&gt;&#xA;&lt;p&gt;I have created a platform to automatically run multi-language KotH. In this example, the framework will simulate an abstract battle of tanks on a grid. Each user's answer will control their tank.&lt;/p&gt;&#xA;&lt;p&gt;The idea is that the competition will be open for a month -- after which the competition will be run offline and then the results will be appended to the Code Golf question.&lt;/p&gt;&#xA;&lt;p&gt;I have written the &lt;a href=&quot;https://gitlab.com/lordratte/harmagedon&quot; rel=&quot;nofollow noreferrer&quot;&gt;proof-of-concept simulator&lt;/a&gt; in a way that makes it easy for people to add new competitions. It should be good enough for this first competition and then made more robust afterwards.&lt;/p&gt;&#xA;&lt;p&gt;The title for the software is Harmagedon (which means Mount Magiddoh) because:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;it conveys the idea of Armageddon i.e. there is a high stakes battle.&lt;/li&gt;&#xA;&lt;li&gt;the mountain part gives a nod to classic King of the Hill type games.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;I am interested in feedback on how the post can be worded more clearly and what information needs to be added.&lt;/p&gt;&#xA;&lt;h1&gt;Tank Battle&lt;/h1&gt;&#xA;&lt;p&gt;Write an AI to control a tank on a grid. Each player's tank is placed in a randomly, unique row and column. The number of the grid's rows and columns are each equal to the number of players.&lt;/p&gt;&#xA;&lt;p&gt;The grid is a torus. In other words, things exiting the grid from the right-most column will appear on the left-most column (in the same row), things exiting from the upper-most row will appear on the bottom most row (in the same column), and visa-versa.&lt;/p&gt;&#xA;&lt;p&gt;Tanks receive instructions based on the output of their code. Output is in the form of two letters and a new line.&lt;/p&gt;&#xA;&lt;p&gt;All tanks act simultaneously in a round of decision-making called a tick.&lt;/p&gt;&#xA;&lt;h2&gt;Running code&lt;/h2&gt;&#xA;&lt;p&gt;Every tick, when the simulator needs a tank to make a decision, it runs the tank's code (passing the game state into the standard input). It then captures the standard output and performs that action (as long as it matches a valid instruction for moving or shooting).&lt;/p&gt;&#xA;&lt;p&gt;There is a 3 second timeout for running code. Any code that takes longer to run will result in that tank not performing any action that tick.&lt;/p&gt;&#xA;&lt;p&gt;Note: During a tick, all of the move actions will first resolve and then all of the shooting actions.&lt;/p&gt;&#xA;&lt;h3&gt;Format of Standard Input&lt;/h3&gt;&#xA;&lt;p&gt;The format of the game state will be as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Game_State ::= YourUserID ';' GridWidth (';' Position)+&#xA;&#xA;Position ::= TankUserID ',' XCoord ',' YCoord&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;As an example, if you are user 9999 on Code Golf Stack Exchange, and the following is the starting grid:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;    Y&#xA;    ^&#xA;    |&#xA;    +--------+--------+--------+&#xA;    |        |        |        |&#xA; 2  |  [0]   |        |        |&#xA;    |        |        |        |&#xA;    +--------+--------+--------+&#xA;    |        |        |        |&#xA; 1  |        |        | [9999] |&#xA;    |        |        |        |&#xA;    +--------+--------+--------+&#xA;    |        |        |        |&#xA; 0  |        |[50000] |        |&#xA;    |        |        |        |&#xA;    +--------+--------+--------+-&amp;gt; X&#xA;        0        1        2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Then the input to your code will look like this for the 1st tick:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;9999;3;0,0,2;9999,2,1;50000,1,0&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Breaking it up one chunk at a time:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;9999&lt;/code&gt;: You are tank 9999.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;3&lt;/code&gt;: The grid is 3 squares wide and 3 squares tall.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;0,0,2&lt;/code&gt;: The tank controlled by user 0 is at co-ordinate (0, 2)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;9999,2,1&lt;/code&gt;: The tank controlled by user 9999 is at co-ordinate (2, 1)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;50000,1,0&lt;/code&gt;: The tank controlled by user 50000 is at co-ordinate (1, 0)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Format of code output&lt;/h3&gt;&#xA;&lt;p&gt;Your output can be either a moving or shooting instruction.&lt;/p&gt;&#xA;&lt;h4&gt;Moving Instruction&lt;/h4&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;mu&lt;/code&gt;: Move one tile up&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;md&lt;/code&gt;: Move one tile down&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ml&lt;/code&gt;: Move one tile left&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;mr&lt;/code&gt;: Move one tile right&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If more than one tank attempts to move to the same square in a tick, only one will move there and the others will remain where they were. No grantees are made about which ones stay behind (i.e. in theory non-deterministic but potentially deterministic in implementation).&lt;/p&gt;&#xA;&lt;h4&gt;Shooting Instruction&lt;/h4&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;su&lt;/code&gt;: Shoot upward&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;sd&lt;/code&gt;: Shoot downward&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;sl&lt;/code&gt;: Shoot left&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;sr&lt;/code&gt;: Shoot right&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;When a tank shoots in a direction, the projectile will instantly traverse from the tank in that direction until it reaches another tank or back to its starting position. If it reaches another tank (other than the one who fired it), it will destroy that tank and remove it from the grid. If no other tanks are encountered along its path, nothing happens.&lt;/p&gt;&#xA;&lt;h2&gt;Winning&lt;/h2&gt;&#xA;&lt;p&gt;Players are ordered by the amount of time that they last on the grid. The winner is the player who doesn't die, the second placed players are those whose tanks were destroyed last, the third place are those whose tanks were destroyed second-last and so on.&lt;/p&gt;&#xA;&lt;p&gt;Ties for places happen when more than one tank is destroyed in a tick.&lt;/p&gt;&#xA;&lt;h2&gt;Submitting&lt;/h2&gt;&#xA;&lt;p&gt;Code should be submitted as an answer on &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;Code Golf&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The answer needs to have a very specific format so that the simulator can parse it.&lt;/p&gt;&#xA;&lt;p&gt;The format can be described as follows.&lt;/p&gt;&#xA;&lt;p&gt;The answer must contain at least two code blocks. The first code block should be the name of the language being used and the second should be the code being submitted.&lt;/p&gt;&#xA;&lt;p&gt;The language can be any listed in &lt;a href=&quot;https://tio.run/languages.json&quot; rel=&quot;nofollow noreferrer&quot;&gt;this JSON object&lt;/a&gt;. Use one of the object keys to refer to which language you will use.&lt;/p&gt;&#xA;&lt;p&gt;Note: There is a hard 1024 character limit for submissions.&lt;/p&gt;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;# This is an example submission&#xA;&#xA;All of this text before the next code block will be ignored:&#xA;&#xA;```&#xA;python3&#xA;```&#xA;&#xA;The above code block will be parsed to find out which language to run the code in (because it's the first code block); this text, however, will be ignored because it is not a code block.&#xA;&#xA;The next code block will be parsed to get the code that will control this answer's tank. Normally one could add extra information here to elaborate on the solution.&#xA;&#xA;```&#xA;import random  &#xA;stdin = input()  # Get the world state&#xA;                               &#xA;# Parse the world state&#xA;my_id, width, *tanks = stdin.split(';') &#xA;tanks = [t.split(',') for t in tanks]          &#xA;                                               &#xA;# Get my position&#xA;my_x, my_y = next(t for t in tanks if t[0] == my_id)[1:]  &#xA;        &#xA;# Get a list of other tanks that are in-line with me&#xA;inline = [t for t in tanks if t[0] != my_id and (t[1] == my_x or t[2] == my_y)]  &#xA;&#xA;if inline:      &#xA;    # If one exists,&#xA;    other_tank = inline[0]&#xA;    # then shoot on that axis.&#xA;    if other_tank[1] == my_x:&#xA;        print('sl')&#xA;    else:       &#xA;        print('su')&#xA;else:           &#xA;    # otherwise, move in a random direction&#xA;    print(random.choice(['mu', 'md', 'ml', 'mr']))&#xA;```&#xA;&#xA;Everything after this previous code block will be ignored (including other `code blocks`).&#xA;&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="61979" LastEditorUserId="61979" LastEditDate="2023-08-13T11:23:25.970" LastActivityDate="2023-08-13T11:23:25.970" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="25921" PostTypeId="2" ParentId="2140" CreationDate="2023-08-04T17:44:34.373" Score="4" Body="&lt;h1&gt;Assembly capture-the-flag KotH&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-king-of-the-hill-tooltip-container&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/machine-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;machine-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;machine-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-machine-code-tooltip-container&quot;&gt;machine-code&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;In this KotH, you'll write a program in a custom machine code (or using one of a few provided languages that compile into it) which tries to run a &lt;code&gt;claim&lt;/code&gt; function as many times as possible to collect points. However, all submissions run on the same &amp;quot;machine&amp;quot;, allowing a few ways to defeat competitors:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Causing a competitor to stop working&lt;/li&gt;&#xA;&lt;li&gt;Tricking a competitor to run &lt;code&gt;claim&lt;/code&gt; on your behalf, using your &lt;code&gt;flag&lt;/code&gt; (a code you'd pass to &lt;code&gt;claim&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;Finding a competitor's flag, and running &lt;code&gt;capture&lt;/code&gt; on it, which gives their points to you (&lt;strong&gt;meta:&lt;/strong&gt; specifics undecided; not sure if it would take all of their points or just some, or if it would leave the competitor running or not, etc.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Submissions would be programs in a custom machine code, for a 32-bit machine. This could be written by hand, with an assembly language that will be provided, or with a simple C compiler that will be provided. All submissions will have access to four general purpose registers, which are inaccessible to other programs (unless they can trick you into running code that reveals their contents), and their code and data will be placed in a random part of the up to 4 GiB of RAM, accessible to other programs if they can find it.&lt;/p&gt;&#xA;&lt;p&gt;Games will run until:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;All but one bot has stopped working, and some number of cycles pass since the second-to-last bot dies (to allow a bot that kills all of its competitors to &lt;code&gt;claim&lt;/code&gt; some points as the winner)&lt;/li&gt;&#xA;&lt;li&gt;A number of cycles has passed equivalent to &lt;span class=&quot;math-container&quot;&gt;\$2.5x+2048\sqrt{b}\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; is the size of RAM and &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; is the number of bots&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;(&lt;strong&gt;meta:&lt;/strong&gt; not sure if there's a better way to do the game-end conditions)&lt;/p&gt;&#xA;&lt;h2&gt;Some example strategies&lt;/h2&gt;&#xA;&lt;p&gt;To show how this might have a rather high skill ceiling, here are some example strategies:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Pretending to be a dumb bot, with an exposed &lt;code&gt;flag&lt;/code&gt;, as a honeypot. When a competitor injects its own &lt;code&gt;flag&lt;/code&gt;, you detect that and &lt;code&gt;capture&lt;/code&gt; it instead&lt;/li&gt;&#xA;&lt;li&gt;To avoid the above, read a competitor's code and try to look for things like conditions based on the &lt;code&gt;flag&lt;/code&gt; or the &lt;code&gt;capture&lt;/code&gt; syscall before attempting the risky flag injection&lt;/li&gt;&#xA;&lt;li&gt;To circumvent the above countermeasure, use self-modification and other tricks to hide what you're doing&lt;/li&gt;&#xA;&lt;li&gt;Watching competitors to see if they've found a bot you're targeting, so you can wait until the last minute to &lt;code&gt;capture&lt;/code&gt; its flag for maximum points&lt;/li&gt;&#xA;&lt;li&gt;Tricking other bots into running your own code, and essentially &lt;code&gt;fork&lt;/code&gt;ing yourself, then attack other bots in parallel&lt;/li&gt;&#xA;&lt;li&gt;Placing fake bot source code in random parts of RAM, to waste other bots' time trying to trick a bot that's not there&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Machine code reference (in progress)&lt;/h2&gt;&#xA;&lt;p&gt;There are eight 32-bit general purpose registers, which are interchangeable and have no special properties. Additionally, an instruction pointer and flag register are present, but cannot be directly accessed. The four flags are zero (&lt;code&gt;z&lt;/code&gt;), negative (&lt;code&gt;n&lt;/code&gt;), carry (&lt;code&gt;c&lt;/code&gt;), and overflow (&lt;code&gt;o&lt;/code&gt;). The instruction set, which takes inspiration primarily from ARM, is as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;adc&lt;/code&gt;: Add with carry&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;add&lt;/code&gt;: Add&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;adr&lt;/code&gt;: Add signed immediate to the current instruction pointer, and store the result in a register&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;and&lt;/code&gt;: Bitwise AND&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;asr&lt;/code&gt;: Arithmetic shift right&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;b&lt;/code&gt;: Branch&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;b[x|nx]&lt;/code&gt;: Branch if flag &lt;code&gt;x&lt;/code&gt; is or is not set (any of &lt;code&gt;c&lt;/code&gt;, &lt;code&gt;n&lt;/code&gt;, &lt;code&gt;o&lt;/code&gt;, or &lt;code&gt;z&lt;/code&gt;, also &lt;code&gt;p&lt;/code&gt;, where &lt;code&gt;p = !n &amp;amp;&amp;amp; !z&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;b[e|ne|gt|lt|ge|le]&lt;/code&gt;: Aliases meant to be used with &lt;code&gt;cmp&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;bic&lt;/code&gt;: Bit clear&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;call&lt;/code&gt;: Branch and push current instruction pointer&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;capture&lt;/code&gt;: Capture a flag&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;claim&lt;/code&gt;: Claim a point using a &lt;code&gt;flag&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;clz&lt;/code&gt;: Count leading zeros&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cmn&lt;/code&gt;: Compare negative (same as &lt;code&gt;add&lt;/code&gt;, but discarding result)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;cmp&lt;/code&gt;: Compare (same as &lt;code&gt;sub&lt;/code&gt;, but discarding result)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;dec&lt;/code&gt;: Decrement&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;div&lt;/code&gt;: Divide&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;inc&lt;/code&gt;: Increment&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ldr&lt;/code&gt;: Load register from memory&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;lsl&lt;/code&gt;: Bit shift left&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;lsr&lt;/code&gt;: Bit shift right&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;mod&lt;/code&gt;: Modulo&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;mov&lt;/code&gt;: Copy from one register to another&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;mul&lt;/code&gt;: Multiply&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;mul2&lt;/code&gt;: Multiply, outputting to two registers (to fit results overflowing one register)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;neg&lt;/code&gt;: Negate&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;nop&lt;/code&gt;: No-op&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;not&lt;/code&gt;: Bitwise NOT&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;or&lt;/code&gt;: Bitwise inclusive OR&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;orn&lt;/code&gt;: Bitwise inclusive OR with NOT of 2nd operand&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;pop&lt;/code&gt;: Pop&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;push&lt;/code&gt;: Push&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ret&lt;/code&gt;: Return (pop a pointer and branch to it)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;ror&lt;/code&gt;: Rotate bits right&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;sbc&lt;/code&gt;: Subtract with carry&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;sdiv&lt;/code&gt;: Signed divide&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;smul&lt;/code&gt;: Signed multiply&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;smul2&lt;/code&gt;: Signed multiply, outputting to two registers (to fit results overflowing one register)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;stop&lt;/code&gt;: Stop running; bot is killed&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;str&lt;/code&gt;: Store register in memory&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;sub&lt;/code&gt;: Subtract&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;swp&lt;/code&gt;: Swap register(s) with memory&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;teq&lt;/code&gt;: Test equality (same as &lt;code&gt;xor&lt;/code&gt;, but discarding result)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;tst&lt;/code&gt;: Test (same as &lt;code&gt;and&lt;/code&gt;, but discarding result)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;xno&lt;/code&gt;: Bitwise XNOR (XOR with NOT of 2nd operand)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;xor&lt;/code&gt;: Bitwise XOR&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Additionally, bots may &amp;quot;trap&amp;quot; one memory address. When this address is written to, an interrupt is issued to the bot. The following instructions exist for this:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;cli&lt;/code&gt;: Clear interrupt&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;int&lt;/code&gt;: Register an interrupt for a memory address, immediately branching to a specified location when it is written to (this clears an existing interrupt if one exists)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;sstr&lt;/code&gt;: Stealthy store (allows storing a register to an address without setting off your own interrupt)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;wfi&lt;/code&gt;: Wait for interrupt (suspends bot until interrupt fires; a suspended bot will not prevent the game-end condition unless it wakes up)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;wfit&lt;/code&gt;: Wait for interrupt with timeout (same as &lt;code&gt;wfi&lt;/code&gt;, but will un-suspend the bot if a specified number of cycles passes without an interrupt occurring)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2023-08-06T17:41:11.380" LastActivityDate="2023-08-06T17:41:11.380" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="25922" PostTypeId="2" ParentId="2140" CreationDate="2023-08-04T21:06:43.013" Score="3" Body="&lt;h1&gt;Calculate the aspect ratio of the Nepal flag&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/yT2lY.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/yT2lY.png&quot; alt=&quot;This is the nepal flag.&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Apove is the picture of the flag of the country Nepal. Pretty cool.&lt;/p&gt;&#xA;&lt;p&gt;What's cooler, is the aspect ratio, which is defined under the constitution as:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/eDvds.jpg&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/eDvds.jpg&quot; alt=&quot;Aspect ratio.&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://oeis.org/A230582&quot; rel=&quot;nofollow noreferrer&quot;&gt;A230582&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to output at least the first 113 digits of the decimal expansion, in any format of your choosing.&lt;/p&gt;&#xA;" OwnerUserId="115553" LastEditorUserId="115553" LastEditDate="2023-08-04T22:11:26.753" LastActivityDate="2023-08-04T22:11:26.753" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25924" PostTypeId="2" ParentId="2140" CreationDate="2023-08-05T08:49:43.423" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/263926/find-separating-sets&quot;&gt;Separate two points in a topological space&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-08-09T10:47:37.133" LastActivityDate="2023-08-09T10:47:37.133" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25926" PostTypeId="2" ParentId="2140" CreationDate="2023-08-05T12:51:56.797" Score="-5" Body="&lt;h1&gt;[&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/semantic-code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;semantic-code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;semantic-code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-semantic-code-golf-tooltip-container&quot;&gt;semantic-code-golf&lt;/a&gt; new contest type proposal]&lt;/h1&gt;&#xA;&lt;p&gt;Given a phrase, express it, or something with the same meaning, in as few syllables as possible. Entries may be in any officially recognised or well-known language that is not a programming language (e.g. you can use Chinese or English, but not MyOwnSpokenLanguage or Python). Shortest number of syllables wins!&lt;/p&gt;&#xA;" OwnerUserId="117478" LastActivityDate="2023-08-05T12:51:56.797" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25927" PostTypeId="2" ParentId="2140" CreationDate="2023-08-05T13:54:44.930" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/263827/77309&quot;&gt;Is it a valid Go type?&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/syntax&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;syntax&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;syntax&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-syntax-tooltip-container&quot;&gt;syntax&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-parsing-tooltip-container&quot;&gt;parsing&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-decision-problem-tooltip-container&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2023-08-07T13:19:20.717" LastActivityDate="2023-08-07T13:19:20.717" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25928" PostTypeId="2" ParentId="2140" CreationDate="2023-08-06T10:59:06.380" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/264296/114446&quot;&gt;Optimal Duck Game Moves&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="114446" LastEditorUserId="114446" LastEditDate="2023-08-17T16:14:20.830" LastActivityDate="2023-08-17T16:14:20.830" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25929" PostTypeId="2" ParentId="2140" CreationDate="2023-08-06T11:34:17.863" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/264140/compressed-utf-8&quot;&gt;Compressed UTF-8&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-08-14T07:29:10.517" LastActivityDate="2023-08-14T07:29:10.517" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25930" PostTypeId="2" ParentId="2140" CreationDate="2023-08-06T16:36:04.187" Score="3" Body="&lt;h1&gt;Pennies to Dollars&lt;/h1&gt;&#xA;&lt;p&gt;Over on &lt;a href=&quot;https://puzzling.stackexchange.com/q/121834/74193&quot;&gt;Puzzling&lt;/a&gt;, &lt;a href=&quot;https://puzzling.stackexchange.com/users/57212/hemant-agarwal&quot;&gt;Hermant Agarwal&lt;/a&gt; proposes the following question:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;In a certain country the following coins are in circulation: 1 cent, 2 cents, 5 cents, 10 cents, 20 cents, 50 cents, and 1 dollar. It is known that you can pay A cents with B coins. Prove that you can pay B dollars with A coins.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Let's help answer this! Spoilers for the answer to the puzzle below&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;&lt;p&gt; The answer relies on the fact that you can replace 1 coin worth &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt; cents with &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt; coins worth 1 dollar. For example, in the puzzle posed in the question, we replace a 20¢ coin with 20 5¢ coins.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Given a list of cent coin values &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt;, and a positive integer &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;, output a positive integer &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; such that&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There is a sublist of &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; containing &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; (not necessarily distinct) values that sum to &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;, and&lt;/li&gt;&#xA;&lt;li&gt;there is a sublist of &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; containing &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; (not necessarily distinct) values that sum to &lt;span class=&quot;math-container&quot;&gt;\$100B\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For example, take &lt;span class=&quot;math-container&quot;&gt;\$L = \{2, 5, 10\}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$B = 3\$&lt;/span&gt;. We can see that the sublist &lt;span class=&quot;math-container&quot;&gt;\$\{10, 10, 10\}\$&lt;/span&gt; sums to &lt;span class=&quot;math-container&quot;&gt;\$A = 30\$&lt;/span&gt;, and the sublist consisting of &lt;span class=&quot;math-container&quot;&gt;\$30\$&lt;/span&gt; &lt;span class=&quot;math-container&quot;&gt;\$10\$&lt;/span&gt;s sums to &lt;span class=&quot;math-container&quot;&gt;\$300 = 100B\$&lt;/span&gt;. However, while there exists a sublist that sums to &lt;span class=&quot;math-container&quot;&gt;\$A = 6\$&lt;/span&gt; with &lt;span class=&quot;math-container&quot;&gt;\$B = 3\$&lt;/span&gt; elements, there is no sublist with &lt;span class=&quot;math-container&quot;&gt;\$6\$&lt;/span&gt; elements that sums to &lt;span class=&quot;math-container&quot;&gt;\$300\$&lt;/span&gt; - the maximum being &lt;span class=&quot;math-container&quot;&gt;\$60\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Another example, take &lt;span class=&quot;math-container&quot;&gt;\$L = \{1, 2, 5, 10, 20, 50, 100\}\$&lt;/span&gt; (i.e. the example in the question) and &lt;span class=&quot;math-container&quot;&gt;\$B = 2\$&lt;/span&gt;. We can make &lt;span class=&quot;math-container&quot;&gt;\$A = 25\$&lt;/span&gt; cents with 2 coins (&lt;span class=&quot;math-container&quot;&gt;\$\{20, 5\}\$&lt;/span&gt;) and &lt;span class=&quot;math-container&quot;&gt;\$$2\$&lt;/span&gt; with &lt;span class=&quot;math-container&quot;&gt;\$25\$&lt;/span&gt; coins (15 &lt;span class=&quot;math-container&quot;&gt;\$10¢\$&lt;/span&gt; and 10 &lt;span class=&quot;math-container&quot;&gt;\$5¢\$&lt;/span&gt; coins). In this case, however, any value we choose for &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; has a solution, so any positive integer is a valid output&lt;/p&gt;&#xA;&lt;p&gt;Finally, take &lt;span class=&quot;math-container&quot;&gt;\$L = \{2, 5, 7\}\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$B = 2\$&lt;/span&gt;. The possible values for &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; (i.e. totals you can make with 2 coins) are &lt;span class=&quot;math-container&quot;&gt;\$4, 7, 9, 10, 12, 14\$&lt;/span&gt;. However, for each of these &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; values, we can see that there are no sublists of &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; with &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; values that sum to 200: in fact, the largest sum we can get is &lt;span class=&quot;math-container&quot;&gt;\$98\$&lt;/span&gt;. You aren't expected to handle these inputs&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;The list &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; will always be non-empty, and contain positive integers between &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$100\$&lt;/span&gt; inclusive. You may assume that, for the provided &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;, there exists at least one &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; that satisfies the conditions, and you may output any such &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You may input and output in any &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/66833&quot;&gt;convenient manner&lt;/a&gt;. This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest code in bytes for each language wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;p&gt;&lt;em&gt;Coming soon&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2023-08-06T16:36:04.187" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25932" PostTypeId="2" ParentId="2140" CreationDate="2023-08-07T09:01:17.083" Score="6" Body="&lt;h1&gt;Display integer in balanced base-ϕ&lt;/h1&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Given a &lt;strong&gt;positive&lt;/strong&gt; integer, display it in balanced base-ϕ numeral. ϕ is the &lt;a href=&quot;https://en.wikipedia.org/wiki/Golden_ratio&quot; rel=&quot;nofollow noreferrer&quot;&gt;golden ratio&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Balanced base-ϕ&lt;/h2&gt;&#xA;&lt;p&gt;Unlike &lt;a href=&quot;https://en.wikipedia.org/wiki/Golden_ratio_base&quot; rel=&quot;nofollow noreferrer&quot;&gt;the usual base-ϕ&lt;/a&gt; that uses 0 and 1 as digits, &lt;em&gt;balanced&lt;/em&gt; base-ϕ uses 1 and -1 as digits. Still, every integer can be represented by a terminating expansion.&lt;/p&gt;&#xA;&lt;p&gt;-1 is written &lt;code&gt;T&lt;/code&gt; as a shorthand.&lt;/p&gt;&#xA;&lt;p&gt;To ensure uniqueness of the representation, there are some restrictions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;1TT&lt;/code&gt; cannot appear anywhere (while the radix point is ignored). To get rid of it, it can be replaced by &lt;code&gt;T11&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The least significant digit must be &lt;code&gt;1&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Even with these restrictions, there still is an integer whose representation isn't unique, namely 2. For the purpose of this challenge, you can output either &lt;code&gt;1T1&lt;/code&gt; or &lt;code&gt;1.11&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Decimal, Balanced base-ϕ&#xA;1, 1&#xA;2, 1T1 or 1.11&#xA;3, 1T1.11&#xA;4, 11.1111&#xA;5, 111.T1&#xA;6, 111.1T1111&#xA;7, 11T1.1T1111&#xA;8, 1T111.T111&#xA;9, 111T.111111&#xA;10, 1111.1T1T1111&#xA;11, 1111.111111&#xA;12, 1T11T1.111111&#xA;13, 1T111T.111T1111&#xA;14, 1T1111.T11111&#xA;15, 1T1111.111T1111&#xA;16, 11111.T1T1&#xA;17, 11T1T1.111T1111&#xA;18, 11T11T.11T111&#xA;19, 1T11.11T111&#xA;20, 11T111.11T111&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Meta Question&lt;/h1&gt;&#xA;&lt;p&gt;How can I prove that balanced base-ϕ covers all integers? Are there any other integers whose representation isn't unique?&lt;/p&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2024-03-11T06:44:25.717" LastActivityDate="2024-03-11T06:44:25.717" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25933" PostTypeId="2" ParentId="2140" CreationDate="2023-08-07T21:10:52.717" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/264044/cutting-a-circular-pizza-vertically&quot;&gt;Cutting a Circular Pizza Vertically&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91262" LastEditorUserId="91262" LastEditDate="2023-08-11T22:32:05.023" LastActivityDate="2023-08-11T22:32:05.023" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25935" PostTypeId="2" ParentId="2140" CreationDate="2023-08-09T05:57:06.493" Score="4" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/264505/repeat-your-program-to-print-fibonacci-numbers&quot;&gt;Repeat your program to print Fibonacci numbers [tag:code-challenge][tag:source-layout]&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-08-22T18:51:07.027" LastActivityDate="2023-08-22T18:51:07.027" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25936" PostTypeId="2" ParentId="2140" CreationDate="2023-08-09T17:39:45.590" Score="0" Body="&lt;h1&gt;2D Percolation Model&lt;/h1&gt;&#xA;&lt;p&gt;Per Wolfram MathWorld: &amp;quot;Percolation theory deals with fluid flow (or any other similar process) in random media.&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;The model is a 2 dimensional lattice whose edges are either &amp;quot;open&amp;quot; or &amp;quot;closed&amp;quot; with probability p in [0,1]. At a percolation probability P, each edge will be evaluated to be open or closed based on if P&amp;gt;p. Connected vertices compose a &amp;quot;cluster&amp;quot;. For display purposes, clusters are often colored or otherwise uniquely denoted. An example of a percolation model is shown below:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;3x3 Lattice&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;       Lattice                 Lattice with random &#xA;                                edge values shown&#xA;&#xA; o ------ o ------ o           o -0.12- o -0.99- o&#xA; |        |        |           |        |        |&#xA; |        |        |          0.75     0.09     0.52&#xA; |        |        |           |        |        |&#xA; o ------ o ------ o           o -0.46- o -0.23- o&#xA; |        |        |           |        |        |&#xA; |        |        |          0.39     0.12     0.85&#xA; |        |        |           |        |        |&#xA; o ------ o ------ o           o -0.97- o -0.23- o&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Percolation at P = 0.1, 0.5, and 0.9 yields 4 clusters&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;       P = 0.1                    P = 0.5                   P = 0.9&#xA;&#xA; o ------ o ------ o        o        o ------ o        o        o ------ o&#xA; |                 |        |                 |                           &#xA; |                 |        |                 |                             &#xA; |                 |        |                 |                           &#xA; o ------ o ------ o        o        o        o        o        o        o&#xA; |        |        |                          |                        &#xA; |        |        |                          |                        &#xA; |        |        |                          |                        &#xA; o ------ o ------ o        o ------ o        o        o ------ o        o&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Vertices named according to cluster&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;P = 0.1                      P = 0.5                    P = 0.9&#xA;&#xA;A A A                        A B B                      A B B&#xA;A A A                        A C B                      C D E&#xA;A A A                        D D B                      F F G&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Given a side length n and percolation probability P, create a percolation model of lattice size n x n with vertices displayed according to the cluster they belong to. The shortest code wins!&lt;/p&gt;&#xA;&lt;h1&gt;Inputs&lt;/h1&gt;&#xA;&lt;p&gt;The model shall take two inputs: n, P&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;n is the side length of the lattice&lt;/li&gt;&#xA;&lt;li&gt;P is the percolation probability&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h1&gt;Output&lt;/h1&gt;&#xA;&lt;p&gt;The model shall return an n x n display of vertices. Its a model so readability is important! List of lists, arrays, or pretty printing is allowed so long as there are n rows and n columns. Vertices shall have alphanumeric names of the same length to ensure readability. Edges need not be shown.&lt;/p&gt;&#xA;&lt;h1&gt;Rules&lt;/h1&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Cluster names shall be unique&lt;/li&gt;&#xA;&lt;li&gt;The model shall be able to compute any percolation phase state from P = 0 to P = 1&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="118465" LastActivityDate="2023-08-09T17:39:45.590" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25937" PostTypeId="2" ParentId="2140" CreationDate="2023-08-12T02:36:36.270" Score="1" Body="&lt;h1&gt;Comment Out the Comment&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I'm back! Lately I've been working on something, but finally I've&#xA;finished it and can return to CGCC! I'll be continuing the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/263049/cops-fast-and-golfiest-season-1-the-lord-of-the-strings&quot;&gt;Fast &amp;amp;&#xA;Golfiest Series&lt;/a&gt; soon, and also try to start working on (given I have&#xA;the time and energy) &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25889/118810&quot;&gt;WumpusWars&lt;/a&gt;. For now, a new question as a gift for everyone!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;In LaTeX if you type &lt;code&gt;%a&lt;/code&gt;, the &lt;code&gt;a&lt;/code&gt; would be commented out.&#xA;But if you type &lt;code&gt;\%a&lt;/code&gt;, the &lt;code&gt;a&lt;/code&gt; would still be there because the backwards slash converted the meaning of &lt;code&gt;%&lt;/code&gt;.&#xA;And if you type &lt;code&gt;\\%a&lt;/code&gt;, the &lt;code&gt;a&lt;/code&gt; would be commented out because the first backwards slash converted the meaning of the second one.&#xA;So do you know what happens to the &lt;code&gt;a&lt;/code&gt; if you type &lt;code&gt;\\\\\\\\\\\%\\\%a&lt;/code&gt;? (Answer: The &lt;code&gt;a&lt;/code&gt; is not commented out).&lt;/p&gt;&#xA;&lt;p&gt;This is a code golf challenge so shortest code wins: the input is a string which consists exclusively of &lt;code&gt;\&lt;/code&gt; and &lt;code&gt;%&lt;/code&gt;, except that at the end there is always &lt;code&gt;%a&lt;/code&gt;. Output &lt;code&gt;1&lt;/code&gt; or &lt;code&gt;True&lt;/code&gt; if the &lt;code&gt;a&lt;/code&gt; is commented out, and &lt;code&gt;0&lt;/code&gt; or &lt;code&gt;False&lt;/code&gt; otherwise.&lt;/p&gt;&#xA;" OwnerUserId="118810" LastEditorUserId="118810" LastEditDate="2023-08-12T03:03:34.927" LastActivityDate="2023-08-12T03:03:34.927" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25938" PostTypeId="2" ParentId="2140" CreationDate="2023-08-12T07:52:31.970" Score="3" Body="&lt;h1&gt;Braille Base64&lt;/h1&gt;&#xA;&lt;p&gt;Make a one-to-one map from the base64 character table(0-9a-zA-Z+/) to Braille(U+2800-U+283F).&lt;/p&gt;&#xA;&lt;p&gt;These characters are fixed map for compatibility. For other characters you can choose any map as long as there's no collision.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;⠁ a     ⠃ b     ⠉ c     ⠙ d     ⠑ e     ⠋ f &#xA;⠛ g     ⠓ h     ⠊ i     ⠚ j     ⠅ k     ⠇ l&#xA;⠍ m     ⠝ n     ⠕ o     ⠏ p     ⠟ q     ⠗ r&#xA;⠎ s     ⠞ t     ⠥ u     ⠧ v     ⠺ w     ⠭ x&#xA;⠽ y     ⠵ z     ⠴ 0     ⠂ 1     ⠆ 2     ⠒ 3&#xA;⠲ 4     ⠢ 5     ⠖ 6     ⠶ 7     ⠦ 8     ⠔ 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Shortest code wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/Braille_ASCII&quot; rel=&quot;nofollow noreferrer&quot;&gt;Braille ASCII&lt;/a&gt; defines uppercase letters while &lt;a href=&quot;https://en.wikipedia.org/wiki/Computer_Braille_Code&quot; rel=&quot;nofollow noreferrer&quot;&gt;Computer Braille Code&lt;/a&gt; defines lowercase ones. Should I allow only one or both?&lt;/li&gt;&#xA;&lt;li&gt;Should I also fix &lt;code&gt;/&lt;/code&gt; == &lt;code&gt;⠌&lt;/code&gt; as the several standards all claim so?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2023-08-14T03:03:16.567" LastActivityDate="2023-08-14T03:03:16.567" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25939" PostTypeId="2" ParentId="2140" CreationDate="2023-08-13T15:16:14.457" Score="3" Body="&lt;h1&gt;Count N-Rich Permutations of an Integer Sequence&lt;/h1&gt;&#xA;&lt;p&gt;Given a sequence of integers with length &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; and an integer &lt;span class=&quot;math-container&quot;&gt;\$1 \le N \le L\$&lt;/span&gt;, an &amp;quot;&lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;-rich&amp;quot; permutation is one whose the longest &lt;strong&gt;strictly&lt;/strong&gt; increasing subsequence has length exactly &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For example, let our sequence be &lt;code&gt;[0, 1, 2, 3]&lt;/code&gt;. There is exactly one &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt;-rich permutation, given by &lt;code&gt;[3, 2, 1, 0]&lt;/code&gt;. By contrast, there are sixteen &lt;span class=&quot;math-container&quot;&gt;\$2\$&lt;/span&gt;-rich permutations:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[0, 2, 1, 3] [0, 3, 1, 2] [0, 3, 2, 1]&#xA;[1, 0, 3, 2] [1, 2, 0, 3] [1, 3, 0, 2] [1, 3, 2, 0]&#xA;[2, 0, 3, 1] [2, 1, 0, 3] [2, 1, 3, 0] [2, 3, 0, 1] [2, 3, 1, 0]&#xA;[3, 0, 2, 1] [3, 1, 0, 2] [3, 1, 2, 0] [3, 2, 0, 1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that &lt;code&gt;[0, 1, 3, 2]&lt;/code&gt; is &lt;span class=&quot;math-container&quot;&gt;\$3\$&lt;/span&gt;-rich and NOT &lt;span class=&quot;math-container&quot;&gt;\$2\$&lt;/span&gt;-rich, because even though it contains a strictly increasing subsequence of length 2, it also contains a &lt;em&gt;longer&lt;/em&gt; strictly increasing subsequence.&lt;/p&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Your challenge is to write a function which takes in an integer sequence S with some length &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt;, and an integer &lt;span class=&quot;math-container&quot;&gt;\$1 \le N \le L\$&lt;/span&gt;, and returns the number of N-rich permutations of S.&lt;/p&gt;&#xA;&lt;p&gt;This is code golf, so the shortest valid answer wins.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;p&gt;Each row is a sequence along with the expected output for all possible values of L. For example, the first row says that if your function is called &lt;code&gt;f&lt;/code&gt;, then &lt;code&gt;f([1, 2, 3, 4, 5], 3) = 41&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1, 2, 3, 4, 5] =&amp;gt; 1, 69, 41, 8, 1&#xA;[1, 2, 2, 3, 3, 4, 5] =&amp;gt; 4, 2612, 2064, 336, 24, 0, 0&#xA;[1, 1, 1, 1, 1, 1, 1] =&amp;gt; 5040, 0, 0, 0, 0, 0, 0&#xA;[1, 2, 3, 1, 2, 3, 4] =&amp;gt; 8, 2976, 1864, 192, 0, 0, 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="67809" LastEditorUserId="67809" LastEditDate="2023-08-14T17:59:12.703" LastActivityDate="2023-08-14T17:59:12.703" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25941" PostTypeId="2" ParentId="2140" CreationDate="2023-08-14T09:48:02.430" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/264291/how-turing-complete-is-you-language&quot;&gt;How Turing complete is you language?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-08-17T08:43:15.637" LastActivityDate="2023-08-17T08:43:15.637" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25942" PostTypeId="2" ParentId="2140" CreationDate="2023-08-14T10:29:23.110" Score="0" Body="&lt;h1&gt;Worst algorithm for anything&lt;/h1&gt;&#xA;&lt;p&gt;Now, any coder worth their salt will know how to sort an array in-place in &lt;code&gt;nlogn&lt;/code&gt;time. Most can probably figure out a way to do it in &lt;code&gt;n!n&lt;/code&gt; time and factorial memory usage. Let's see an algorithm that tops those numbers; can you come up with a way to sort an array in up-arrow time? Can you come up with an algorithm whose O-notation contains the &lt;a href=&quot;https://en.wikipedia.org/wiki/Graham%27s_number&quot; rel=&quot;nofollow noreferrer&quot;&gt;Graham's number series&lt;/a&gt;?&lt;/p&gt;&#xA;&lt;h2&gt;Rules:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The algorithm must solve a problem that isn't just an obfuscation of 'do a ridiculous amount of NOPs&amp;quot;.&lt;/li&gt;&#xA;&lt;li&gt;Highest O-notation in either memory usage or time wins, tie broken by the other one and then by a golfed implementation.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Discussion&lt;/h2&gt;&#xA;&lt;p&gt;I'm not sure whether I should limit this to solving a specific problem. For that matter, I don't know if this would be an interesting challenge.&lt;/p&gt;&#xA;" OwnerUserId="64650" LastActivityDate="2023-08-14T10:29:23.110" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25943" PostTypeId="1" CreationDate="2023-08-14T13:39:57.860" Score="13" ViewCount="198" Body="&lt;p&gt;Sometimes, in a challenge you might want to create some variations. You might want to encourage some extra constraint or limitation, but don't want to obligate everyone to attempt the extra difficulty, especially if you want to encourage using esolangs. The versions may still be too similar to post separately.&lt;/p&gt;&#xA;&lt;p&gt;Normally, you'd solve this using a bonus. You say: If you meet this extra requirement, subtract X from your byte count. &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8106/91213&quot;&gt;This is, however, discouraged&lt;/a&gt;. It's really hard to balance a bonus, either it's so overpowered that everyone needs to use it to be competitive or so useless nobody will.&lt;/p&gt;&#xA;&lt;p&gt;What if, instead, you just state in a challenge that any submissions meeting requirement A do not compete against submissions that don't. That way, everyone is completely free to choose if they want to try either variant, no matter if it's &amp;quot;worth it&amp;quot; for a fixed bonus.&lt;/p&gt;&#xA;&lt;p&gt;Some examples of possible extra challenges:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Less restrictions on input, for example all Unicode for the harder version vs ASCII only for the easy version&lt;/li&gt;&#xA;&lt;li&gt;Not assuming a solution exists&lt;/li&gt;&#xA;&lt;li&gt;Restricted complexity, in a challenge where brute force and efficient solutions are both possible&lt;/li&gt;&#xA;&lt;li&gt;Not using specific builtins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is specifically about posting a &lt;em&gt;single&lt;/em&gt; challenge where I mention both variants count as a separate category. Would something like this be appreciated or are there some problems I'm not seeing?&lt;/p&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="66833" LastEditDate="2023-08-14T16:36:06.247" LastActivityDate="2023-08-16T17:52:48.903" Title="Is splitting a challenge into multiple categories a good way to have an optional difficulty without bonuses?" Tags="|discussion|challenges|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25944" PostTypeId="2" ParentId="25943" CreationDate="2023-08-14T15:59:30.293" Score="11" Body="&lt;h2&gt;Yes, this is fine*&lt;/h2&gt;&#xA;&lt;p&gt;We have a policy that &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/23926/66833&quot;&gt;self-imposed restrictions do not invalidate an answer&lt;/a&gt;. So, an answer to &amp;quot;Print the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th prime&amp;quot; that chooses not to use any prime related builtins is entirely valid (so long as they make it clear they're using that restriction).&lt;/p&gt;&#xA;&lt;p&gt;So, answers that complete the challenge, but with the added restriction of&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a specific time complexity&lt;/li&gt;&#xA;&lt;li&gt;not assuming a solution exists&lt;/li&gt;&#xA;&lt;li&gt;not using specific builtins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;are completely fine - even if the restriction originated in the challenge, rather than being &amp;quot;self&amp;quot;-imposed. So, there is no problem with including optional &amp;quot;bonus&amp;quot; tasks in your challenge, encouraging some self-imposed restrictions that people can choose to follow.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;*&lt;strong&gt;However&lt;/strong&gt;, such answers &lt;em&gt;also&lt;/em&gt; have to complete the core challenge as written. If the category changes the original challenge enough such that an answer that follows that category fails to complete the main challenge, then answers will be invalid. For example, if the challenge is&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Print the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th Fibonacci number&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;and you add in the extra challenge&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Print every other Fibonnaci number&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This would not be okay, as answers that complete the category are not valid answers to the challenge itself. Additionally, make sure to keep the objectivity of the extra challenges as much as possible. Not necessarily to the same degree as for scoring (&amp;quot;Must finish in a minute on your laptop&amp;quot; is fine), but &amp;quot;make it elegant&amp;quot; would not be okay.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2023-08-16T17:52:48.903" LastActivityDate="2023-08-16T17:52:48.903" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25945" PostTypeId="2" ParentId="2140" CreationDate="2023-08-15T10:52:15.707" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/264409/first-odd-then-even-indices&quot;&gt;First odd then even indices&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-08-20T15:37:16.927" LastActivityDate="2023-08-20T15:37:16.927" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25946" PostTypeId="2" ParentId="2140" CreationDate="2023-08-15T12:27:35.487" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/264421/walk-by-walls-in-a-room&quot;&gt;Walk by walls in a room&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="111474" LastEditorUserId="111474" LastEditDate="2023-08-20T20:39:41.183" LastActivityDate="2023-08-20T20:39:41.183" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25947" PostTypeId="2" ParentId="2140" CreationDate="2023-08-15T14:43:57.487" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/264504/the-rectangle-spanned-by-two-numbers&quot;&gt;The rectangle spanned by two numbers&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-08-22T18:05:19.217" LastActivityDate="2023-08-22T18:05:19.217" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25948" PostTypeId="1" CreationDate="2023-08-17T04:09:42.357" Score="2" ViewCount="53" Body="&lt;p&gt;Season 2 is coming! &lt;a href=&quot;https://codegolf.stackexchange.com/questions/263049/cops-fast-and-golfiest-season-1-the-lord-of-the-strings&quot;&gt;Season 1&lt;/a&gt; was fun and relatively well-received, but the main problem was that the scoring system is very broken. Hence I'm looking for advice about how to improve the system so that all participants have around the same difficulty for obtaining scores.&lt;/p&gt;&#xA;&lt;p&gt;The point is, around the start of the competition cop answers were very quickly cracked. When interest kinda waned, however, it was very easy for the cops to get a ridiculous amount of points.&lt;/p&gt;&#xA;&lt;p&gt;My current rough idea is to make the cop score a logarithmic function of the time before it is cracked. We should also add some bonus for the fastest guns in the west. However I'm not so sure about details.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;So: any ideas about details for the cops' scoring system?&lt;/strong&gt; All pieces of advice are welcome.&lt;/p&gt;&#xA;&lt;p&gt;One more thing: I'm also looking for proposals for the theme of Season 2 ;-) If you have ideas for a fun topic and a punny name please leave a comment! Thx in advance~&lt;/p&gt;&#xA;" OwnerUserId="118810" LastEditorUserId="66833" LastEditDate="2023-08-17T18:51:09.810" LastActivityDate="2023-08-17T18:51:09.810" Title="Fast and Golfiest Season 2 Looking for Advice" Tags="|discussion|sandbox|challenges|cops-and-robbers|" AnswerCount="0" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25949" PostTypeId="2" ParentId="2140" CreationDate="2023-08-17T13:05:13.817" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/264589/multiply-multivariate-polynomials&quot;&gt;Multiply multivariate polynomials&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-08-24T12:53:24.293" LastActivityDate="2023-08-24T12:53:24.293" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25950" PostTypeId="2" ParentId="2140" CreationDate="2023-08-17T18:05:08.953" Score="0" Body="&lt;h2&gt;Periodicity of the family of sequences s(n) such that n(x) is the first number co-prime with the previous &lt;code&gt;n&lt;/code&gt; elements &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;The sequence of all numbers coprime to the previous is all natural numbers. This is &lt;a href=&quot;https://oeis.org/A000027&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS 000027&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1, 2, 3, 4, 5, 6, 7, 8...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The sequence starting with 1, 2, and where the n-th term is the first number coprime to the previous 2 in the sequence, is periodic with period 6 (2x3). This is &lt;a href=&quot;https://oeis.org/A047255&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS 047255&lt;/a&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1, 2, 3, 5, 7, 8, 9, 11, 13, 14, 15, 17, 19, 20, 21, 23&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If you take the first number coprime with the previous 3 terms, you get a sequence periodic with a period of 210 (2&lt;em&gt;3&lt;/em&gt;5*7). This is &lt;a href=&quot;https://oeis.org/A062062&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS 062062&lt;/a&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1, 2, 3, 5, 7, 8, 9, 11, 13, 14, 15, 17, 19, 22, 23, 25, 27, 28, 29, 31, 33, 34, 35, 37, 39, 41, 43&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your task is, given a number N output the periodicity of the co-prime sequence taking the last N terms.&lt;/p&gt;&#xA;&lt;p&gt;As stated, the first elements of this sequence are:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1, 6, 210&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The fourth is unknown, yet your program, given enough time, should in theory calculate it. It is known to be at least 245,589. It should not be extremely hard to calculate, just nobody has tried yet.&lt;/p&gt;&#xA;&lt;p&gt;MathJax test, please ignore: &lt;span class=&quot;math-container&quot;&gt;\$abc\$&lt;/span&gt;&lt;/p&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-08-22T12:49:28.703" LastActivityDate="2023-08-22T12:49:28.703" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25951" PostTypeId="2" ParentId="1061" CreationDate="2023-08-18T19:41:48.447" Score="6" Body="&lt;hr /&gt;&#xA;&lt;h1&gt;Using a very high base (like base Graham’s number) in a challenge where you need to output a big number&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/a/263991/117478&quot;&gt;my answer&lt;/a&gt;, I just outputted 10, and claimed it was in base &lt;kbd&gt;number that is bigger than any number printed in the challenge by another submission&lt;/kbd&gt;. And of course, this seems like cheating.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;The answer has been deleted, so here is the exact answer, quoted. I had to change a bit of the markdown to fit it in a quote, but it looks the same.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h1&gt;Vyxal, &lt;span class=&quot;math-container&quot;&gt;\$\operatorname g\left(f_{\varphi(1,0,0)+7}(256^{26})\right)\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$\operatorname g(x) = x \uparrow^x x\$&lt;/span&gt; (outputs in base &lt;span class=&quot;math-container&quot;&gt;\$\operatorname g\left(f_{\varphi(1,0,0)+7}(256^{26})\right) \times {10}^6\$&lt;/span&gt;), 10 bytes&lt;/h1&gt;&#xA;&lt;pre&gt;››››››››››&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://vyxal.pythonanywhere.com/?v=2#WyIiLCIiLCLigLrigLrigLrigLrigLrigLrigLrigLrigLrigLoiLCIiLCIiXQ==&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Non base-10 numbers haven't been banned... so we have a new winner!&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/18028/largest-number-printable/149781#comment34804_18028&quot;&gt;Related comment&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;For context, &lt;a href=&quot;https://codegolf.stackexchange.com/q/18028/117478&quot;&gt;here is the question&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;" OwnerUserId="117478" LastEditorUserId="117478" LastEditDate="2023-12-01T13:58:40.550" LastActivityDate="2023-12-01T13:58:40.550" CommentCount="0" CommunityOwnedDate="2023-08-18T19:41:48.447" ContentLicense="CC BY-SA 4.0" />
  <row Id="25953" PostTypeId="2" ParentId="2140" CreationDate="2023-08-20T03:34:31.033" Score="3" Body="&lt;h1&gt;Could it be a possible chess move?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-decision-problem-tooltip-container&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/chess&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;chess&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-chess-tooltip-container&quot;&gt;chess&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Backstory&lt;/h2&gt;&#xA;&lt;p&gt;Professor Chesster has a library of chess puzzles with solutions, but a meteor has struck (not real, I promise) and now their hard drive may be corrupted! Luckily, Professor Chesster's puzzle FENs are stored securely, but the solutions to those puzzles have all been jumbled up and could be as ridiculous as &lt;code&gt;gxm9=L&lt;/code&gt; or even &lt;code&gt;axc3&lt;/code&gt;! Professer Chesster needs a quick and simple scan to check if the solutions to their puzzles are valid.&lt;/p&gt;&#xA;&lt;p&gt;Luckily, most of the meteor is not radioactive (no &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/radiation-hardening&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;radiation-hardening&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-radiation-hardening-tooltip-container&quot;&gt;radiation-hardening&lt;/a&gt;) but because Professor Chesster's hard drive is now a literal potato, they need the code to be as short as possible (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;) or it might overheat!&lt;/p&gt;&#xA;&lt;h2&gt;Stop waffling pls and show me the challenge!!!&lt;/h2&gt;&#xA;&lt;p&gt;OK, fine. Here:&lt;/p&gt;&#xA;&lt;p&gt;Check if a move inputted with &lt;a href=&quot;https://en.wikipedia.org/wiki/Algebraic_notation_(chess)&quot; rel=&quot;nofollow noreferrer&quot;&gt;algebraic notation&lt;/a&gt; could be valid. Return a truthy value if it is, and a falsy value otherwise.&lt;/p&gt;&#xA;&lt;h2&gt;List of all moves that are valid&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Na1, Na2, ..., Nh8&#xA;Ka1, ...&#xA;... [all other pieces]&#xA;Nxa1, Nxa2, ... [captures]&#xA;Nba1, ... [specify row]&#xA;N2a1, ... [specify col]&#xA;Nb3a1, ... [row &amp;amp; col]&#xA;Nbxa1, N2xa1, Nb3xa1, ...&#xA;(NOT Kab3 as there's only one king)&#xA;O-O (or 0-0??? META - WHAT DO I DO)&#xA;O-O-O (or 0-0-0??? META - THIS TOO)&#xA;axb2 to axb7&#xA;bxc2 to bxc7&#xA;...&#xA;gxh2 to gxh7&#xA;then bxa1 to bxa7 ... hxg7&#xA;Then promotions (a1=Q, a1=R, a1=B, a1=N)&#xA;b1=QRBN, c1=QRBN, ..., h1=QRBN&#xA;a8=QRBN, ...&#xA;axb1=QRBN,bxc1=QRBN, .......&#xA;[other moves I may have missed]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Again, Professor Chesster's hard drive is such a potato that they require it to be golfed as much as possible. (this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;h2&gt;META: Mandatory duplicate check&lt;/h2&gt;&#xA;&lt;p&gt;Not a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/148587/is-it-a-valid-chess-move&quot;&gt;Is it a valid chess move?&lt;/a&gt; as that asks about a specific position.&lt;/p&gt;&#xA;&lt;p&gt;Not a duplicate of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/260302/is-it-a-plausible-chess-move&quot;&gt;Is it a plausible chess move?&lt;/a&gt; as that doesn't include piece information and a few other things that will be mentioned below&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox/Meta stuff&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Specifications&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do I include...&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Check (&lt;code&gt;move+&lt;/code&gt;)?&lt;/li&gt;&#xA;&lt;li&gt;Double check (&lt;code&gt;move++&lt;/code&gt;)?&lt;/li&gt;&#xA;&lt;li&gt;Checkmate (&lt;code&gt;move#&lt;/code&gt;)?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Did I miss any other chess moves?&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Funny enough backstory?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="95204" LastEditorUserId="95204" LastEditDate="2023-08-23T07:39:30.260" LastActivityDate="2023-08-23T07:39:30.260" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="25954" PostTypeId="2" ParentId="20722" CreationDate="2023-08-20T04:04:21.360" Score="1" Body="&lt;p&gt;My username is my initials.&lt;/p&gt;&#xA;&lt;p&gt;My profile picture is some random whole-white image I found on my computer (problably from &lt;code&gt;mspaint.exe&lt;/code&gt;)&lt;/p&gt;&#xA;" OwnerUserId="95204" LastActivityDate="2023-08-20T04:04:21.360" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25955" PostTypeId="2" ParentId="2140" CreationDate="2023-08-20T09:24:52.660" Score="-2" Body="&lt;h1&gt;Type annotation&lt;/h1&gt;&#xA;&lt;p&gt;Given a function definition and a list of types, both valid in your language, output the function annotated with those types. Shortest code wins, since this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is it a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;How should I include languages without type annotation support?&lt;/li&gt;&#xA;&lt;li&gt;Does it need to be explained better?&lt;/li&gt;&#xA;&lt;li&gt;Anything else?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="117478" LastActivityDate="2023-08-20T09:24:52.660" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25957" PostTypeId="2" ParentId="2140" CreationDate="2023-08-21T15:03:55.010" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/264852/golf-the-fast-growing-hierarchy&quot;&gt;Golf the fast growing hierarchy&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-09-03T13:26:18.807" LastActivityDate="2023-09-03T13:26:18.807" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25958" PostTypeId="2" ParentId="2140" CreationDate="2023-08-21T18:50:38.910" Score="3" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/264562/78039&quot;&gt;Decode Chess Move&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="78039" LastEditorUserId="78039" LastEditDate="2023-08-23T17:11:21.203" LastActivityDate="2023-08-23T17:11:21.203" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25959" PostTypeId="2" ParentId="2140" CreationDate="2023-08-22T00:06:26.997" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/264604/78410&quot;&gt;Zeckendorf to F(4k+2) representation&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2023-08-25T04:18:40.440" LastActivityDate="2023-08-25T04:18:40.440" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25960" PostTypeId="2" ParentId="2140" CreationDate="2023-08-22T09:09:20.977" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/264663/half-even-rounding&quot;&gt;Half even rounding&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-08-27T12:40:35.880" LastActivityDate="2023-08-27T12:40:35.880" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25961" PostTypeId="2" ParentId="2140" CreationDate="2023-08-22T14:19:34.860" Score="0" Body="&lt;h1&gt;Complex logarithm&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;We have challenges for the regular &lt;a href=&quot;https://codegolf.stackexchange.com/questions/262711/vanilla-natural-logarithm-challenge&quot;&gt;real logarithm&lt;/a&gt; and the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/263530/compute-the-logarithm-of-a-matrix&quot;&gt;matrix logarithm&lt;/a&gt;, but we do not yet have a challenge for computing the logarithm of a complex number.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;...&lt;/p&gt;&#xA;&lt;p&gt;I will add a challenge body if there is interest&lt;/p&gt;&#xA;&lt;p&gt;...&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may chose which logarithm of the import you return as long as the imaginary parts for any two returned values differ by at most &lt;span class=&quot;math-container&quot;&gt;\$2\pi\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;Please add built-in solutions to the community-Wiki post&lt;/li&gt;&#xA;&lt;li&gt;... &lt;em&gt;More rules will follow&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; the shortest solution in bytes wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Is this different enough from the other two challenges ?&lt;/p&gt;&#xA;&lt;p&gt;As far as I can tell most (no built-in) algorithms used in these challenges break when applied to complex inputs&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Would there be interest in solving this challenge ?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-08-22T14:24:17.330" LastActivityDate="2023-08-22T14:24:17.330" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25962" PostTypeId="2" ParentId="8474" CreationDate="2023-08-22T15:15:52.363" Score="1" Body="&lt;h1&gt;Nothing pops up&lt;/h1&gt;&#xA;&lt;p&gt;The sandbox icon does not pop up on the website header.&lt;/p&gt;&#xA;" OwnerUserId="117478" LastActivityDate="2023-08-22T15:15:52.363" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25963" PostTypeId="2" ParentId="2140" CreationDate="2023-08-22T20:41:36.623" Score="0" Body="&lt;h1&gt;When is My Holiday?&lt;/h1&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;I recently learned of a holiday, that occurred on August 20, 2023 and August 12, 2022.&#xA;This got me wondering how on earth they were determining which day this holiday falls on.&lt;/p&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;In this challenge you will be given two dates which are from the same month but different years as input. You must construct the simplest possible description which applies to both dates.&lt;/p&gt;&#xA;&lt;p&gt;Descriptions must be structured in a particular way. First, there are types of days&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;type&lt;/th&gt;&#xA;&lt;th&gt;cost&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;day&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;weekday, weekend day&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;day which is a multiple of &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;For the following we'll let &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt; be some type of day. We then have modifiers and constants.&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;modifier&lt;/th&gt;&#xA;&lt;th&gt;constant&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;the nth &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt;  after&lt;/td&gt;&#xA;&lt;td&gt;the nth &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;the nth &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt;  before&lt;/td&gt;&#xA;&lt;td&gt;the nth to last &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;the nearest &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt;  to&lt;/td&gt;&#xA;&lt;td&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;A valid description consists of 0 or more modifiers followed by a single constant. The simplest description is the one with the lowest cost, which is the sum of the cost of each &lt;span class=&quot;math-container&quot;&gt;\$D\$&lt;/span&gt; which appears in the description.&lt;/p&gt;&#xA;&lt;p&gt;For the purposes of this challenge we define &amp;quot;nearest&amp;quot; to mean &amp;quot;nearer than all others&amp;quot; so if there is a tie, then neither day is nearest and the description is not valid. &amp;quot;Nearest&amp;quot; may include the day itself. &amp;quot;Before&amp;quot; and &amp;quot;after&amp;quot; do not include the day itself.&lt;/p&gt;&#xA;&lt;h2&gt;I/O&lt;/h2&gt;&#xA;&lt;p&gt;Standard I/O rules apply, the dates may be taken in any reasonable format. And since the challenge is not about supposed to be about date calculation you may choose to take in data about the month surrounding each day. Some examples of valid input formatting are as follows. A program would take two such inputs.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2023-08-22&#xA;&#xA;8/22/23&#xA;&#xA;22.8.23&#xA;&#xA;[[xx, xx, 01, 02, 03, 04, 05]&#xA; [06, 07, 08, 09, 10, 11, 12]&#xA; [13, 14, 15, 16, 17, 18, 19]&#xA; [20, 21, 22, 23, 24, 25, 26]&#xA; [27, 28, 29, 30, 31, xx, xx]], &#xA;[3, 2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You may assume any input given will have a solution. Your description need not apply to all years, just the ones in the input (eg. August 2023 has no 5th monday, but &amp;quot;the 5th monday&amp;quot; is still correct for 2021-08-30, 2022-08-29). If two or more descriptions tie you may output any or all.&lt;/p&gt;&#xA;&lt;p&gt;Output the elements as seen in the tables above separated by spaces.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;p&gt;These test cases follow the &lt;code&gt;YYYY-MM-DD&lt;/code&gt; input format&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;2022-07-04, 2023-07-04 -&amp;gt; the 4th day&#xA;2021-08-30, 2022-08-29 -&amp;gt; the 5th monday&#xA;2022-08-12, 2023-08-20 -&amp;gt; the 1st day which is a multiple of 4 before the 3rd Monday&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/calendar&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;calendar&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;calendar&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-calendar-tooltip-container&quot;&gt;calendar&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;How clear is this?&lt;/p&gt;&#xA;&lt;p&gt;Should I be more lenient on output? (allow encoding schemes)&lt;/p&gt;&#xA;&lt;p&gt;Yes I'm going to add more test cases.&lt;/p&gt;&#xA;" OwnerUserId="73054" LastEditorUserId="73054" LastEditDate="2023-08-22T20:52:51.330" LastActivityDate="2023-08-22T20:52:51.330" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25964" PostTypeId="2" ParentId="2140" CreationDate="2023-08-23T11:36:33.387" Score="1" Body="&lt;h1&gt;Print every Unicode character (almost) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/unicode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;unicode&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;unicode&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-unicode-tooltip-container&quot;&gt;unicode&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Print every Unicode character, except U+0000. Any order is allowed.&lt;/p&gt;&#xA;&lt;h2&gt;Specification&lt;/h2&gt;&#xA;&lt;p&gt;Every Unicode character from U+0001 to U+10FFFF, inclusive.&#xA;Exclude U+D800 to U+DFFF inclusive as apparently these 'surrogates' cause weird behaviour.&lt;/p&gt;&#xA;&lt;p&gt;To be honest, I don't know much about Unicode so before this gets posted someone will have to fill me in on how Unicode works&lt;/p&gt;&#xA;" OwnerUserId="95204" LastEditorUserId="95204" LastEditDate="2023-08-24T06:14:52.267" LastActivityDate="2023-08-24T06:14:52.267" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="25965" PostTypeId="2" ParentId="2140" CreationDate="2023-08-23T17:18:49.470" Score="1" Body="&lt;h1&gt;Make a braille cribbage board&lt;/h1&gt;&#xA;&lt;p&gt;The braille characters lie in the range U+2800 (&lt;code&gt;⠀&lt;/code&gt;) to U+28FF (&lt;code&gt;⣿&lt;/code&gt;), making it a SBCS (&lt;strong&gt;S&lt;/strong&gt;ingle &lt;strong&gt;B&lt;/strong&gt;yte &lt;strong&gt;C&lt;/strong&gt;haracter &lt;strong&gt;S&lt;/strong&gt;et). Oddly enough, the braille patterns look a lot like holes in a cribbage board. Here is an image of one of the many cribbage boards for reference:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/cDhyU.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/cDhyU.png&quot; alt=&quot;Cribbage Board&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;So you must print this pattern:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+-------+&#xA;|⣀⣀⠀⣿⠀⣀⣀|&#xA;|⣿⣿⠀⠀⠀⣿⣿|&#xA;|⣿⣿⠀⠀⠀⣿⣿|&#xA;|⣿⣿⠀⠀⠀⣿⣿|&#xA;|⣿⣿⠀⠀⠀⣿⣿|&#xA;|⣿⣿⠀⠀⠀⣿⣿|&#xA;|⣿⣿⠀⠀⠀⣿⣿|&#xA;|⣿⣿⠀⠀⠀⣿⣿|&#xA;|⠉⠉⠀⣿⠀⠉⠉|&#xA;+-------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that &lt;strong&gt;the blanks are U+2800 and &lt;em&gt;NOT&lt;/em&gt; the space&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;,? is ,7tag3code-golf7'1 s %orte/ code w9s6&lt;/p&gt;&#xA;&lt;p&gt;Oh, we're not using grade 2 contracted braille. You're not blind.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/unicode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;unicode&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;unicode&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-unicode-tooltip-container&quot;&gt;unicode&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-ascii-art-tooltip-container&quot;&gt;ascii-art&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/card-game&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;card-game&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;card-game&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-card-game-tooltip-container&quot;&gt;card-game&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-kolmogorov-complexity-tooltip-container&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="117478" LastEditorUserId="117478" LastEditDate="2023-08-26T14:56:01.017" LastActivityDate="2023-08-26T14:56:01.017" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25966" PostTypeId="2" ParentId="2140" CreationDate="2023-08-23T20:47:56.137" Score="2" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/264738/78039&quot;&gt;Minimal number of jumps to reach a square&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="78039" LastEditorUserId="78039" LastEditDate="2023-08-29T13:52:02.173" LastActivityDate="2023-08-29T13:52:02.173" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25967" PostTypeId="2" ParentId="2140" CreationDate="2023-08-24T17:00:03.823" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/265159/convert-numbers-to-dice-patterns&quot;&gt;Draw numbers as dice patterns&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-09-12T10:48:43.063" LastActivityDate="2023-09-12T10:48:43.063" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25968" PostTypeId="2" ParentId="2140" CreationDate="2023-08-24T18:59:14.057" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/264733/normalize-a-gaussian-gcd&quot;&gt;Normalize a Gaussian GCD&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-08-29T11:15:12.397" LastActivityDate="2023-08-29T11:15:12.397" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25969" PostTypeId="2" ParentId="2140" CreationDate="2023-08-25T14:03:27.917" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/264793/inverse-trigonometric-functions&quot;&gt;Inverse trigonometric functions&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Example equations using complex logarithm:&lt;/h2&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$ \sin^{-1}(z)=-i \cdot \ln(\sqrt{1-z^2}+iz) \$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$ \cos^{-1}(z)=-i \cdot \ln(\sqrt{z^2-1}+z) \$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$ \tan^{-1}(z)=\frac{i}{2} \cdot \ln(\frac{1-iz}{1+iz}) \$&lt;/span&gt;&lt;/p&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-08-31T14:33:46.900" LastActivityDate="2023-08-31T14:33:46.900" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25971" PostTypeId="2" ParentId="2140" CreationDate="2023-08-26T16:40:10.697" Score="-3" Body="&lt;h1&gt;Square decomposition&lt;/h1&gt;&#xA;&lt;p&gt;Inspired by silly ideas for answers to &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/64270042#64270042&quot;&gt;this CMC&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;s&gt;Given a perfect square, take the square root of it.&lt;/s&gt; &lt;em&gt;&lt;strong&gt;NO NO NO NOT THAT CHALLENGE&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Explanation&lt;/h2&gt;&#xA;&lt;p&gt;Given a square in Unicode art, output the characters that compose the square.&lt;/p&gt;&#xA;&lt;p&gt;Rows are separated by newlines, so they cannot appear in the square. Therefore, contrary to I/O defaults, &lt;strong&gt;you cannot output leading or trailing whitespace &lt;em&gt;unless&lt;/em&gt; it is in the square&lt;/strong&gt;. You may also output in any order. Remember, this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins!&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Input&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: center;&quot;&gt;Unordered Output&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;pre&gt;aaa&lt;br&gt;aaa&lt;br&gt;aaa&lt;/pre&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;code&gt;a&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;pre&gt;1234&lt;br&gt;4567&lt;br&gt;7890&lt;br&gt;0123&lt;/pre&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;code&gt;1234567890&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;pre&gt;&amp;quot;&lt;/pre&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;code&gt;&amp;quot;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;pre&gt;&lt;br&gt;&lt;br&gt;&lt;/pre&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;code&gt;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;pre&gt;&lt;/pre&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: center;&quot;&gt;&lt;code&gt;&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/unicode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;unicode&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;unicode&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-unicode-tooltip-container&quot;&gt;unicode&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;pre&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Is this clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Should I add more test cases?&lt;/li&gt;&#xA;&lt;li&gt;Should I add or remove any tags?&lt;/li&gt;&#xA;&lt;li&gt;Anything else?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="117478" LastEditorUserId="117478" LastEditDate="2023-08-26T17:59:58.727" LastActivityDate="2023-08-26T17:59:58.727" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="25972" PostTypeId="1" CreationDate="2023-08-26T16:59:34.443" Score="4" ViewCount="117" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1336/custom-404-not-found-image&quot;&gt;Very related, but not the same&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I would like it if someone could make this a community wiki.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;In &lt;a href=&quot;https://chat.stackexchange.com/rooms/240&quot;&gt;The Nineteenth Byte&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/91213&quot;&gt;mousetail&lt;/a&gt; posted &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/64150630#64150630&quot;&gt;a message&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Petition to make our 404 page a quine in &amp;quot;Lost&amp;quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;This message has then received 10 stars, showing that the community would like this change, so I am asking on behalf of the community to make the 404 page a quine in the programming language &amp;quot;Lost&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;&amp;lt;there was another quine here&amp;gt;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Edit&lt;/h2&gt;&#xA;&lt;p&gt;Thanks to Wheat Wizard for pointing out a shorter quine by Jo King:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;:2+52*95*2+&amp;gt;::1?:[:[[[[@^%?&amp;gt;([ &amp;quot;&#xA;////////////////////////////////&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="117478" LastEditorUserId="66833" LastEditDate="2023-08-26T17:57:54.337" LastActivityDate="2023-08-26T17:57:54.337" Title="Let's get a special 404 page!" Tags="|feature-request|site-design|404-page|" AnswerCount="0" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25973" PostTypeId="5" CreationDate="2023-08-27T08:03:24.260" Score="0" Body="" OwnerUserId="-1" LastEditorUserId="-1" LastEditDate="2023-08-27T08:03:24.260" LastActivityDate="2023-08-27T08:03:24.260" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25974" PostTypeId="4" CreationDate="2023-08-27T08:03:24.260" Score="0" Body="For questions relating to CGCC’s (or their meta’s) 404 page. Do not use for 404 pages of other sites." OwnerUserId="117478" LastEditorUserId="117478" LastEditDate="2023-08-28T22:42:44.383" LastActivityDate="2023-08-28T22:42:44.383" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25975" PostTypeId="2" ParentId="25879" CreationDate="2023-08-27T16:34:18.827" Score="3" Body="&lt;p&gt;&lt;strong&gt;Yes&lt;/strong&gt;, it is just a matter of interpretation.&#xA;No, this is not best practice for real-life applications but &lt;em&gt;who cares&lt;/em&gt; about sensible programming when codegolfing anyways?&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;pre class=&quot;lang-c prettyprint-override&quot;&gt;&lt;code&gt;main(int a, char **argv)&#xA;{&#xA;  int d = *(int*)argv[1]; //&amp;lt;-- Is this allowed?&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I do not program in C, but I wonder whether a typecast (I suppose) is really necessary.&#xA;Could you not just as well write:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-c prettyprint-override&quot;&gt;&lt;code&gt;main(int a, int **argv)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="94076" LastActivityDate="2023-08-27T16:34:18.827" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="25976" PostTypeId="2" ParentId="2140" CreationDate="2023-08-27T23:46:30.423" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/264747/78410&quot;&gt;Prefix code generator&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2023-08-30T00:02:19.803" LastActivityDate="2023-08-30T00:02:19.803" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25978" PostTypeId="2" ParentId="2140" CreationDate="2023-08-29T14:03:40.817" Score="0" Body="&lt;h2&gt;Calculate equal, winning or losing trades in chess&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;For this challenge, assume you are playing white&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Given two arrays containing all white and black chess piece positions on a chessboard, output if a given square is a &lt;strong&gt;equal&lt;/strong&gt;, &lt;strong&gt;losing&lt;/strong&gt; or &lt;strong&gt;winning&lt;/strong&gt; trade. If there is no trade for a giving square, output something else.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;An &lt;strong&gt;equal trade&lt;/strong&gt; happens when both black and white can lose the same amount of material in a given square&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A &lt;strong&gt;winning trade&lt;/strong&gt; happens when white loses less material than black in a given square.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;A &lt;strong&gt;losing trade&lt;/strong&gt; happens when white loses more material than black in a given square.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input: &#xA;Black -&amp;gt; [&amp;quot;Ra8&amp;quot;, &amp;quot;Bc8&amp;quot;, &amp;quot;Qd8&amp;quot;, &amp;quot;Rf8&amp;quot;, &amp;quot;Kg8&amp;quot;, &amp;quot;Nd7&amp;quot;, &amp;quot;Ne7&amp;quot;, &amp;quot;Bg7&amp;quot;, &amp;quot;a6&amp;quot;, &amp;quot;b5&amp;quot;, ...&#xA;White -&amp;gt; [&amp;quot;Rd1&amp;quot;, &amp;quot;Rf1&amp;quot;, ...&#xA;Target -&amp;gt; &amp;quot;d5&amp;quot;&#xA;&#xA;Output: Equal Trade&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Visually would be:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/eHV2qm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/eHV2qm.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;strong&gt;Meta&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Would this be interesting?&lt;/li&gt;&#xA;&lt;li&gt;I'm not sure If I should allowed dynamic calculations or no. For example in the previous image, for square f5, there would be an equal trade since pawn attacks f5 square and if it takes, bishop will now be able to attack f5 square&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;em&gt;I will add more examples later...&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="78039" LastEditorUserId="78039" LastEditDate="2023-08-29T18:05:10.737" LastActivityDate="2023-08-29T18:05:10.737" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25979" PostTypeId="2" ParentId="2140" CreationDate="2023-08-29T18:14:08.353" Score="1" Body="&lt;h2&gt;Implement RAID&lt;/h2&gt;&#xA;&lt;p&gt;RAID, or Redundant Array of Independent Disks is a way to efficiently store data in such a way that if any one disk fails you can still recover the data. Instead of implementing the official protocol, any function that can preserve data counts.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to produce two functions.&lt;/p&gt;&#xA;&lt;p&gt;The first is the encoder. Given N lists with M elements each, produce N+1 lists with M elements each. What these lists contain is up to you.&lt;/p&gt;&#xA;&lt;p&gt;The second part is the recovery system. Take as input the lists produced by the encoded, except one is missing. You must be able to recover the original data no matter which of the lists is gone.&lt;/p&gt;&#xA;&lt;p&gt;Each list should contain only integers between 0 and 255. It is your choice how to represent the empty list, for example you can:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Replace it with an empty list&lt;/li&gt;&#xA;&lt;li&gt;Replace it with a non-list value like &lt;code&gt;None&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Prefix all present lists with a 1 and the missing list with 0.&lt;/li&gt;&#xA;&lt;li&gt;Take as a separate input which list is missing then just zero out the values.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;A basic XOR based solution could look like this:&lt;/p&gt;&#xA;&lt;p&gt;Encoder:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;def encode(list_of_lists):&#xA;    return [*list_of_lists, [reduce(lambda a,b:a^b, i) for i in zip(*list_of_lists)]]&#xA;&#xA;def decode(list_with_one_removed):&#xA;    return [&#xA;        (i if i else [reduce(lambda a,b:a^b, j) for j in zip(*(k for k in list_with_one_removed if k))&#xA;        for i in list_with_one_removed&#xA;    ][:-1]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You don't need to use a XOR based solution, as long as you can extract the original data again your solution is valid.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2023-08-29T18:14:08.353" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25980" PostTypeId="2" ParentId="2140" CreationDate="2023-08-30T01:28:26.623" Score="3" Body="&lt;h1&gt;A robber flipped some bits. This is what happened to the cop's code. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-cops-and-robbers-tooltip-container&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Cops shall pose a code that outputs a truthy or falsy value &lt;strong&gt;deterministically&lt;/strong&gt;, depending on the input. The output must be truthy on some inputs &lt;strong&gt;and&lt;/strong&gt; falsy on some other inputs.&lt;/p&gt;&#xA;&lt;p&gt;Flipping some &lt;strong&gt;bits&lt;/strong&gt; in the code shall result in negating the output for every input. Robbers shall find such bits.&lt;/p&gt;&#xA;&lt;h2&gt;Winning criterion&lt;/h2&gt;&#xA;&lt;p&gt;For cops, the submission whose the &lt;strong&gt;cardinality&lt;/strong&gt; of all valid inputs is the biggest shall win. The shortness of the code is a tiebreaker. In other words, this is primarily &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-test-battery-tooltip-container&quot;&gt;test-battery&lt;/a&gt; and secondarily &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;. (Note that there may be infinitely many valid inputs, and its cardinality cannot exceed aleph-naught.)&lt;/p&gt;&#xA;&lt;p&gt;For robbers, the submission whose percentage of the flipped bits is the closest to 50% shall win. The number of the flipped bits is a tiebreaker. So this is primarily &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-shuffleboard&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-shuffleboard&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-shuffleboard&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-shuffleboard-tooltip-container&quot;&gt;code-shuffleboard&lt;/a&gt; and secondarily &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-bowling-tooltip-container&quot;&gt;code-bowling&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Rule&lt;/h2&gt;&#xA;&lt;p&gt;Cops must specify what the valid inputs are.&lt;/p&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2023-09-03T09:02:43.693" LastActivityDate="2023-09-03T09:02:43.693" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25981" PostTypeId="2" ParentId="9619" CreationDate="2023-08-30T16:00:12.490" Score="2" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/83750&quot;&gt;Pascal&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;h3&gt;Advantages&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Pascal is one of the few &lt;a href=&quot;https://en.wikipedia.org/wiki/Category:Programming_languages_with_an_ISO_standard&quot; rel=&quot;nofollow noreferrer&quot;&gt;programming languages backed by ISO standards&lt;/a&gt;.&#xA;There are also &lt;a href=&quot;https://web.archive.org/web/20230405133335/pascaland.org/pascall.htm&quot; rel=&quot;nofollow noreferrer&quot;&gt;many dialects&lt;/a&gt;.&#xA;If you indicate that your submission exclusively uses a standardized variant of Pascal, there is &lt;em&gt;no ambiguity&lt;/em&gt; with respect to the programming language’s capabilities (e. g. compiler version, compiler configuration, etc.).&#xA;Keep in mind some details are implementation-defined, such as the specific value of the built-in &lt;code&gt;maxInt&lt;/code&gt; constant.&lt;/li&gt;&#xA;&lt;li&gt;Pascal is wordy &lt;em&gt;enabling readers&lt;/em&gt; to understand &lt;em&gt;and&lt;/em&gt; possibly vote on your submission even without being veteran Pascal programmers themselves.&#xA;&lt;a href=&quot;/u/94076&quot;&gt;I&lt;/a&gt; often find myself unable to vote on submissions written in more obscure programming languages (starting with &lt;a href=&quot;/a/9683&quot;&gt;C&lt;/a&gt;).&#xA;I cannot assess whether something is good or bad, or whether it does indeed meet the task’s specifications or contains a bug.&#xA;Pascal does not have this liability.&lt;/li&gt;&#xA;&lt;li&gt;Pascal calls for the mathematical genius in you.&#xA;This is fun (if you like doing the math).&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The notion of sets is an integral part of the language.&#xA;Occasionally tasks can be neatly solved by cleverly combining and examining sets.&#xA;For example a &lt;a href=&quot;https://codegolf.stackexchange.com/a/254444&quot;&gt;leap year&lt;/a&gt; expression can read:&#xA;&lt;pre class=&quot;lang-pascal prettyprint-override&quot;&gt;&lt;code&gt;0 in [year mod 4] − [year mod 100] + [year mod 400]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Extended Pascal (ISO standard 10206) makes &lt;code&gt;complex&lt;/code&gt; numbers part of the language, too.&#xA;If you are familiar with ℂ and some formulas, you can do some tricks.&#xA;For example the length of a right triangle’s hypotenuse can be obtained with &lt;code&gt;abs(x)&lt;/code&gt; where &lt;code&gt;x&lt;/code&gt; is a &lt;code&gt;complex&lt;/code&gt; expression.&lt;/li&gt;&#xA;&lt;li&gt;In Extended Pascal &lt;code&gt;integer&lt;/code&gt; literals can be specified to bases 2 to 36.&#xA;This requires the overhead &lt;code&gt;12#…&lt;/code&gt; where &lt;code&gt;12&lt;/code&gt; is an &lt;code&gt;integer&lt;/code&gt; in the range &lt;code&gt;2‥36&lt;/code&gt; and &lt;code&gt;…&lt;/code&gt; a series of valid digits for the respective base.&#xA;Thus starting with integers exceeding a magnitude of 1,679,615 can be abbreviated if specified to a higher base.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Pascal has real-life benefits:&#xA;Recreational programming in brainteasing languages can be fun, but as a matter of fact there are no jobs for, e. g. GolfScript.&#xA;Improving your “game”, your &lt;em&gt;skills&lt;/em&gt; in Pascal, or in general any imperative, procedural high-level programming language can be beneficial &lt;em&gt;outside&lt;/em&gt; the realm of &lt;a href=&quot;/a/12538&quot;&gt;PPCG&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Disadvantages&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Pascal is wordy and thus not particularly suitable for challenges that factor in source code’s length (prominently &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;).&#xA;A standard &lt;code&gt;program&lt;/code&gt; that does &lt;em&gt;absolutely nothing&lt;/em&gt; already requires a whopping &lt;em&gt;20 characters&lt;/em&gt;.&#xA;This is quite some overhead.&#xA;&lt;pre class=&quot;lang-pascal prettyprint-override&quot;&gt;&lt;code&gt;program p;begin end.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;Nonetheless, Pascal is usually more competitive with complex/long challenges, when more rudimentary programming languages tailored to codegolfing need to elaborate, too.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Summary&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Pascal allows you to write source code &lt;em&gt;for humans&lt;/em&gt;.&#xA;(The fact that a computer needs to be able process your code, too, is almost negligible.)&#xA;This aides community-building.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/240117&quot;&gt;Pascal golfing tips&lt;/a&gt; │ &lt;a href=&quot;https://stackoverflow.com/tags/pascal/info&quot;&gt;Stack Overflow tag&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="94076" LastEditorUserId="94076" LastEditDate="2023-09-04T13:37:00.707" LastActivityDate="2023-09-04T13:37:00.707" CommentCount="0" CommunityOwnedDate="2023-08-30T16:00:12.490" ContentLicense="CC BY-SA 4.0" />
  <row Id="25982" PostTypeId="2" ParentId="9619" CreationDate="2023-08-30T17:16:48.700" Score="0" Body="&lt;p&gt;Disclaimer: I made this language.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;TalkingHead&lt;/h1&gt;&#xA;&lt;p&gt;Throw away your keyboard! Yes, that's right, you don't need a keyboard to code! With TalkingHead, you just have to talk.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Advantages&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No keyboard needed!&lt;/li&gt;&#xA;&lt;li&gt;Turing complete!&lt;/li&gt;&#xA;&lt;li&gt;Golf by talking faster!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Disadvantages&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Hard to use exact strings.&lt;/li&gt;&#xA;&lt;li&gt;Can't code if you lose your voice.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;So what are you waiting for? Checkout &lt;a href=&quot;https://github.com/PlaceReporter99/talking-head&quot; rel=&quot;nofollow noreferrer&quot;&gt;the repo&lt;/a&gt; and start &lt;s&gt;coding&lt;/s&gt; speaking today!&lt;/p&gt;&#xA;" OwnerUserId="117478" LastEditorUserId="117478" LastEditDate="2023-09-19T18:42:24.447" LastActivityDate="2023-09-19T18:42:24.447" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="25983" PostTypeId="2" ParentId="2140" CreationDate="2023-08-30T18:39:37.823" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/264838/be-big-more-often&quot;&gt;Be big more often&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="117478" LastEditorUserId="117478" LastEditDate="2023-09-03T07:02:40.670" LastActivityDate="2023-09-03T07:02:40.670" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="25984" PostTypeId="2" ParentId="2140" CreationDate="2023-08-31T13:19:08.217" Score="2" Body="&lt;h2&gt;Pseudo-Quantum Bogosort&lt;/h2&gt;&#xA;&lt;p&gt;Quantum Bogosort is as follows:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;Quantumly randomise the list, such that there is no way of knowing what order the list is in until it is observed. This will divide the universe into O(n!) universes; however, the division has no cost, as it happens constantly anyway.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the list is not sorted, destroy the universe. (This operation is left as an exercise to the reader.)&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;All remaining universes contain lists which are sorted.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;&lt;a href=&quot;http://wiki.c2.com/?QuantumBogoSort&quot; rel=&quot;nofollow noreferrer&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given that we cannot destroy the universe, the next best thing is to destroy a thread!&lt;/p&gt;&#xA;&lt;p&gt;The challenge is as follows:&#xA;Make a new thread for each possible permutation of a list and if the list is not sorted, destroy the thread.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;Input is a list of length 4 or less&lt;/p&gt;&#xA;&lt;p&gt;Output is a sorted list and I guess the number of the thread that is sorted? This part is iffy...&lt;/p&gt;&#xA;&lt;p&gt;This is standard code-golf&lt;/p&gt;&#xA;" OwnerUserId="96266" LastActivityDate="2023-08-31T13:19:08.217" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25985" PostTypeId="2" ParentId="8287" CreationDate="2023-09-01T14:00:16.040" Score="0" Body="&lt;p&gt;&lt;strong&gt;It depends&lt;/strong&gt;.&#xA;The question is whether the library is &lt;em&gt;part of the language&lt;/em&gt;.&#xA;If it is, merely specifying an &lt;code&gt;import&lt;/code&gt;-clause is the &lt;em&gt;most idiomatic&lt;/em&gt; solution and we should not penalize that.&#xA;(Individual challenge authors may penalize it anyway but it’s their decision.)&lt;/p&gt;&#xA;&lt;p&gt;If the imported library is a &lt;em&gt;third-party&lt;/em&gt; plugin, however, i. e. not part of the programming language, you are &lt;em&gt;outsourcing&lt;/em&gt; the implementation.&#xA;Several &lt;a href=&quot;/q/1061/&quot;&gt;loopholes forbidden by default&lt;/a&gt; try to prevent this.&lt;/p&gt;&#xA;&lt;p&gt;It is therefore &lt;em&gt;consistent&lt;/em&gt; that &lt;em&gt;just&lt;/em&gt; importing a third-party symbol is &lt;em&gt;not sufficient&lt;/em&gt;, but you will at least need to define your own symbol, too.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;For instance, as far as I understand, the &lt;code&gt;numpy&lt;/code&gt; library is a third-party library &lt;em&gt;independently&lt;/em&gt; developed from the Python language.&#xA;The existence of &lt;code&gt;numpy&lt;/code&gt; is not guaranteed with &lt;em&gt;any&lt;/em&gt; Python implementation.&#xA;Hence&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;from numpy import *&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;is an &lt;em&gt;incomplete&lt;/em&gt; implementation of the n×n identity matrix function.&#xA;You will need to declare a user-defined function.&lt;/p&gt;&#xA;&lt;p&gt;On the other hand the C programming language defines (since C99) that (unless an implementation defines the &lt;code&gt;__STDC_NO_COMPLEX__&lt;/code&gt; symbol) the function &lt;code&gt;carg&lt;/code&gt; is available via the &lt;code&gt;complex.h&lt;/code&gt; header.&#xA;Therefore&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-c prettyprint-override&quot;&gt;&lt;code&gt;#include &amp;lt;complex.h&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;is a “complete” and in particular &lt;em&gt;idiomatic&lt;/em&gt; implementation of the complex argument function.&lt;/p&gt;&#xA;" OwnerUserId="94076" LastEditorUserId="94076" LastEditDate="2023-09-01T14:18:32.337" LastActivityDate="2023-09-01T14:18:32.337" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25986" PostTypeId="2" ParentId="2140" CreationDate="2023-09-01T22:33:33.290" Score="4" Body="&lt;h1&gt;There's more than one way to do it&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-cops-and-robbers-tooltip-container&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Cops: Pick a freely available programming language, and pick a function on the integers (i.e. given one integer as input, it produces one integer as output). Then write &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; programs/functions in your language that implement it and are all the same length. &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; must be &lt;span class=&quot;math-container&quot;&gt;\$\geq 2\$&lt;/span&gt;. Post your language, a description of the function, and &lt;span class=&quot;math-container&quot;&gt;\$N-1\$&lt;/span&gt; of the implementations.&lt;/p&gt;&#xA;&lt;p&gt;Robbers: Pick a cop's post. You can crack the post by finding another program/function in the same language, of equal length, that implements the same function.&lt;/p&gt;&#xA;&lt;p&gt;(Note that a solution of &lt;em&gt;lesser&lt;/em&gt; length, i.e. a golf, is &lt;strong&gt;not&lt;/strong&gt; a valid crack, although in most languages it's easy to pad a solution out to the desired length.)&lt;/p&gt;&#xA;&lt;p&gt;If a cop's post is not cracked within one week after it's posted, it may be marked as safe. The cop should edit the post to read &amp;quot;Safe&amp;quot; and reveal their omitted solution. Until a post is so edited, it can still be cracked, even if it is more than a week old. A safe cop post is worth &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; points, where &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; is the number of solutions in the post. Robbers receive one point for each cop post they crack.&lt;/p&gt;&#xA;&lt;h2&gt;Details&lt;/h2&gt;&#xA;&lt;p&gt;Cops may use a function on the nonnegative or positive integers if they prefer. If your cop post uses one of these restricted domains, please say so in your post. Your solutions (and robbers' solutions) are allowed to produce different results for inputs outside your chosen domain, as long as they produce identical results for inputs inside the domain.&lt;/p&gt;&#xA;&lt;p&gt;[Cops may measure the length of a program in any way they choose. Some possibilities are bytes, characters, codels, non-whitespace characters, etc. Please specify how you are counting length in your post.] - I'm not sure about this rule. See below.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Sandbox questions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this concept interesting?&lt;/li&gt;&#xA;&lt;li&gt;Does the scoring make sense? Are there ways for the cops to game the scoring system to get arbitrarily high scores? Would it be better if the &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; solutions were forbidden to have any characters/bytes in common? (But that would cause problems for a lot of languages that aren't golflangs, which I'd rather avoid.)&lt;/li&gt;&#xA;&lt;li&gt;Is the &amp;quot;choose your own length measure&amp;quot; rule reasonable, or does it open the door to weird exploits? I suspect that more-flexible counting methods like &amp;quot;number of occurrences of &lt;code&gt;n&lt;/code&gt; and &lt;code&gt;Q&lt;/code&gt;&amp;quot; will just cause problems for the cop, since they will allow robbers to construct elaborate workarounds using characters that aren't counted.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="16766" LastActivityDate="2023-09-01T22:33:33.290" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25987" PostTypeId="2" ParentId="2140" CreationDate="2023-09-03T15:45:19.533" Score="2" Body="&lt;h1&gt;Volume of a squaricililinder&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Inspired by an interestingly-shaped glass at a cafe.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;WHAT THE HECK IS A SQUARICILILINDER!?!?!&lt;/h2&gt;&#xA;&lt;p&gt;A squaricililinder is a prism with a square at one end and a circle at the other. The circle is as small as possible while being able to fit the square at the other end inside.&lt;/p&gt;&#xA;&lt;p&gt;The width of the glass increases at a constant rate as you go up it.&lt;/p&gt;&#xA;&lt;h2&gt;Now what's the challenge?&lt;/h2&gt;&#xA;&lt;p&gt;Given the height of a squaricililinder and the diameter of the circle on it, calculate the area of the squaricililinder.&lt;/p&gt;&#xA;&lt;h2&gt;How am I supposed to calculate it?&lt;/h2&gt;&#xA;&lt;p&gt;It's simple, all you need to do is plug in the height &lt;span class=&quot;math-container&quot;&gt;\$h\$&lt;/span&gt; and the diameter &lt;span class=&quot;math-container&quot;&gt;\$d\$&lt;/span&gt; to this simple formula:&#xA;&lt;span class=&quot;math-container&quot;&gt;$$\small\underbrace{4\times\left( \int_0^h \int_0^{\frac d{\sqrt 2} }\frac yh\times\sqrt{ 1-\frac{x^2\times\left(6-4\sqrt2\right)}d } dx dy\right) + \left(\frac{d^2}2 \times h \right)}_\textrm{I hope I got the formula right...}$$&lt;/span&gt;&#xA;It was obtained by calculating the area of the cuboid inside and then doing some two-dimensional integrals on the circular parts.&lt;/p&gt;&#xA;&lt;h2&gt;Can you give me an example implementation?&lt;/h2&gt;&#xA;&lt;p&gt;Sure, here's an ungolfed and slow example in Python + &lt;code&gt;sympy&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;from sympy import *&#xA;&#xA;x, y, d, h = symbols(&amp;quot;x, y, d, h&amp;quot;)&#xA;&#xA;def calculate_area_of_shape(diameter: float, height: float) -&amp;gt; float:&#xA;    &#xA;    formula_in_integral = (y / h) * sqrt(1 - (((x ** 2) * (6 - 4 * sqrt(2))) / d))&#xA;    &#xA;    integral_part = integrate(integrate(formula_in_integral, (x, 0, d / sqrt(2))), (y, 0, h))&#xA;    &#xA;    actual_formula = 4 * integral_part + ((d ** 2) / 2) * h&#xA;    &#xA;    return actual_formula.subs(d, diameter).subs(h, height)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Anything else?&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins!&lt;/p&gt;&#xA;" OwnerUserId="117478" LastEditorUserId="117478" LastEditDate="2023-09-04T11:44:43.257" LastActivityDate="2023-09-04T11:44:43.257" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="25988" PostTypeId="2" ParentId="2140" CreationDate="2023-09-04T00:54:33.457" Score="2" Body="&lt;h1&gt;Median of Chi-Square&lt;/h1&gt;&#xA;&lt;p&gt;Output the IEEE-754 single-precision floating-point number represented by the following binary decomposition:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Sign, Exponent, Mantissa&#xA;0, 01111101, 11010001110110101101101&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is the most accurate approximation of the median of the chi-squared distribution &lt;span class=&quot;math-container&quot;&gt;\$\chi^2(1)\$&lt;/span&gt;, which is approximately &lt;span class=&quot;math-container&quot;&gt;\$0.454936423119572751942516646979649\$&lt;/span&gt; in decimal. There is no known closed form of this value.&lt;/p&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2023-09-10T04:36:55.760" LastActivityDate="2023-09-10T04:36:55.760" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="25989" PostTypeId="2" ParentId="2140" CreationDate="2023-09-04T13:29:33.480" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/265060/78850&quot;&gt;Simulate Round Robin Scheduling&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2023-09-10T05:58:24.113" LastActivityDate="2023-09-10T05:58:24.113" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25990" PostTypeId="2" ParentId="2140" CreationDate="2023-09-04T13:47:25.757" Score="3" Body="&lt;h1&gt;What's my score?&lt;/h1&gt;&#xA;&lt;p&gt;The question score on Stack Exchange is the total number of upvotes minus the total number of downvotes a question receives. However, the reputation gained/lost for every upvote/downvote is different (10/-2 on Code Golf).&lt;/p&gt;&#xA;&lt;p&gt;Given the total reputation and the reputation gained/lost on votes, list out all possible scores the question could have.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The total reputation, the reputation gained by an upvote and reputation lost by a downvote must be integers&lt;/li&gt;&#xA;&lt;li&gt;The upvote-reputation will be positive and the downvote-reputation will be negative&lt;/li&gt;&#xA;&lt;li&gt;You can output the possible question scores as a (possibly infinite) list or print each one individually.&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;[total reputation, upvote-reputation, downvote-reputation] -&amp;gt; [question scores]&#xA;&#xA;[28, 10, -2]  -&amp;gt; [2, -2, -6, -10, ...]&#xA;[34, 10, -2]  -&amp;gt; [1, -3, -7, -11, ...]&#xA;[17, 10, -2]  -&amp;gt; []&#xA;[11, 7, -5]   -&amp;gt; [1, -1, -3, -5, ...]&#xA;[82, 31, -11] -&amp;gt; [2, -18, -38, -58, ...]&#xA;[15, 5, -10]  -&amp;gt; [3, 4, 5, 6, ...]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="96037" LastActivityDate="2023-09-04T13:47:25.757" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25991" PostTypeId="2" ParentId="2140" CreationDate="2023-09-04T13:55:42.357" Score="4" Body="&lt;h1&gt;The Legend of Koth Episode 1: WANTED&lt;/h1&gt;&#xA;&lt;p&gt;Alright. The &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/25889#25889&quot;&gt;WumpusWars&lt;/a&gt; project turned out to be more than I can swallow, so I had to give it up. If you're interested in hosting the competition yourself go ahead: it would be very fun.&lt;/p&gt;&#xA;&lt;p&gt;I instead thought of a simpler-to-implement King of the Hill! I plan to make a series (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/263049/cops-fast-and-golfiest-season-1-the-lord-of-the-strings/&quot;&gt;yeah I love series&lt;/a&gt;) of King-of-the-Hill challenges based primarily on metagame and interactions, and named it The Legend of Koth. Here comes Episode 1: WANTED. Hope u like it ;-)&lt;/p&gt;&#xA;&lt;p&gt;====================&lt;/p&gt;&#xA;&lt;p&gt;Backstory: A long long time ago in a galaxy far far away, on the planet of code-o-sphere, a civil war broke out between CGCC and CRSE (*). Deserted wasteland spammed with unreadable Esolang code and 100-line-long docstrings were the remains of most once bustling cities of the code-o-sphere.&lt;/p&gt;&#xA;&lt;p&gt;When the war was over, some survivors settled in the town of Koth. They had magnificent plans: of rebuilding civilization! Equality and freedom for everyone!&lt;/p&gt;&#xA;&lt;p&gt;... until they found out how hard it was to build a society from scratch. By that time, it was too late.&lt;/p&gt;&#xA;&lt;p&gt;The town had employed too many vigilantes and trusted them with great power. And so, echoing the lessons learned by habitants of a remote little insignificant blue planet, they found -- the hard way -- that power corrupts, and absolute power corrupts absolutely. Now, the vigilantes are fighting, to see who is the best!&lt;/p&gt;&#xA;&lt;p&gt;The pains of the previous war eventually convinced them to control the warfare to a relatively small scale: the vigilante factions will send representatives to see who is the best! Now the towns' once beautiful walls and buildings are covered with posters...:&lt;/p&gt;&#xA;&lt;p&gt;WANTED. Dead, undead, or preferably deader than dead, but definitely not alive, thank you very much.&lt;/p&gt;&#xA;&lt;p&gt;(*) Note: For those who don't understand the joke, CRSE (Code Review Stack Exchange) is often joked to be CGCC's arch-nemesis because they value readability over conciseness and hacky stuff, while most challenges here want the opposite.&lt;/p&gt;&#xA;&lt;p&gt;Disclaimer: I am politically strictly neutral and indifferent (this is part of my moral principle) so the backstory bears no relations to real-life politics or history. It's simply a humorous mish-mash of some relevant tropes.&lt;/p&gt;&#xA;&lt;p&gt;====================&lt;/p&gt;&#xA;&lt;p&gt;The rule: this is mainly inspired by King of the Holster.&lt;/p&gt;&#xA;&lt;p&gt;You can distribute your 10 initial points between HP, defense, and reputation. Your HP is your HP point plus 10, and your defense is the probability of blocking, calculated by defense points times 0.1. Your reputation is simply equal to your reputation points times 10.&lt;/p&gt;&#xA;&lt;p&gt;The basic system is similar to the Holster game. You have 1 ammo at the beginning. During each round, you can (1) refill 1 ammo, (2) heal 1 HP, (3) attack someone, or (4) post a wanted poster.&lt;/p&gt;&#xA;&lt;p&gt;Attacking costs 1 ammo. The attacked guy chooses a random real number between 0 and 1, and if is smaller than his defense he blocks, meaning that the damage he takes is randomly decided from 0-2. Otherwise he takes 3-5 damage. Killing someone who isn't wanted gives you 20 reputation points.&lt;/p&gt;&#xA;&lt;p&gt;Wanted posters are publically visible. You can choose to cost x of your reputation to post the poster (no refunds, similar to the bounty system on Stack Exchange). If the guy on the wanted poster is killed the one who killed him has his reputation increased by 20+x.&lt;/p&gt;&#xA;&lt;p&gt;The winner is the one with the most reputation -- not necessarily the last man standing. If no attacks are made for 10 consecutive turns or only one man is surviving then the game ends.&lt;/p&gt;&#xA;&lt;p&gt;====================&lt;/p&gt;&#xA;&lt;p&gt;Good luck and happy coding!&lt;/p&gt;&#xA;&lt;p&gt;Leaderboard: (will be updated as soon as I can)&lt;/p&gt;&#xA;&lt;p&gt;Achievements: (all achievements are hidden so no achievement conditions are revealed until someone gets them)&lt;/p&gt;&#xA;" OwnerUserId="118810" LastEditorUserId="118810" LastEditDate="2023-09-09T01:12:24.907" LastActivityDate="2023-09-09T01:12:24.907" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="25992" PostTypeId="2" ParentId="2140" CreationDate="2023-09-04T16:07:19.980" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/264918/119451&quot;&gt;Sum of consecutive nth powers&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-math-tooltip-container&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-integer-tooltip-container&quot;&gt;integer&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="119451" LastEditorUserId="119451" LastEditDate="2023-09-05T08:05:37.220" LastActivityDate="2023-09-05T08:05:37.220" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25993" PostTypeId="2" ParentId="7167" CreationDate="2023-09-05T18:00:00.717" Score="-3" Body="&lt;h2&gt;Programs must not &lt;em&gt;depend&lt;/em&gt; on standard input&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;Take no input&lt;/em&gt; means that the program must not depend on standard input.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is not guaranteed that standard input is open for reading, nor that it is attached to a terminal, bound to a regular file, a socket or anything.&#xA;&lt;pre class=&quot;lang-bash prettyprint-override&quot;&gt;&lt;code&gt;./myProgram &amp;lt;&amp;amp;-     # the `&amp;lt;&amp;amp;-` _closes_ standard input&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;Your program must run and fulfill the task’s specifications regardless.&lt;/li&gt;&#xA;&lt;li&gt;If it is open for reading, it is not guaranteed that standard input is indeed empty.&#xA;Your program must not depend on presence or absence of any data in standard input.&#xA;Standard input may be filled with junk.&lt;/li&gt;&#xA;&lt;li&gt;The state of standard input at the point in time the execution of your submitted code commences must be left untouched until the end of your code.&#xA;This accounts for the hidden preamble and/or epilog some programming languages/implementations exhibit.&#xA;E. g. an &lt;em&gt;automatic&lt;/em&gt; “flush” (discarding all input) at program termination is harmless.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Rationale&lt;/h3&gt;&#xA;&lt;p&gt;A program can be modeled as a &lt;a href=&quot;https://en.wikipedia.org/wiki/Black_box_%28systems%29&quot; rel=&quot;nofollow noreferrer&quot;&gt;black box&lt;/a&gt; or as a mathematical function &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt;.&#xA;Such a function &lt;span class=&quot;math-container&quot;&gt;\$f\$&lt;/span&gt; takes some inputs and returns some output(s).&#xA;If there is a “receptacle” for (standard) input, this black box’s behavior &lt;em&gt;could&lt;/em&gt; depend on it.&#xA;Such behavior is banned by the &lt;em&gt;take no input&lt;/em&gt; rule.&#xA;(A &lt;em&gt;dummy receptacle&lt;/em&gt;, something that is not “wired”, not connected, is harmless.)&lt;/p&gt;&#xA;&lt;h3&gt;Future directions&lt;/h3&gt;&#xA;&lt;p&gt;A better wording for future challenges &lt;em&gt;might&lt;/em&gt; be:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Resources external to the execution environment are unavailable.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The execution environment refers to the black box’s interior.&#xA;&lt;em&gt;Unavailable&lt;/em&gt; indicates, while resources may exist you cannot “touch” them.&lt;/p&gt;&#xA;" OwnerUserId="94076" LastActivityDate="2023-09-05T18:00:00.717" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25995" PostTypeId="2" ParentId="2140" CreationDate="2023-09-07T14:44:13.780" Score="0" Body="&lt;h1&gt;BB⁻¹(TREE(3))&lt;/h1&gt;&#xA;&lt;p&gt;Construct a Turing machine with tape alphabet {0, 1} that, starting on a tape filled with 0, it halts with at least TREE(3) 1's. Least states wins.&lt;/p&gt;&#xA;&lt;h1&gt;Notes&lt;/h1&gt;&#xA;&lt;p&gt;As &lt;a href=&quot;https://codegolf.stackexchange.com/users/96037/math-scat&quot;&gt;math scat&lt;/a&gt; mentioned, this &lt;a href=&quot;https://math.stackexchange.com/questions/3929521/when-does-busy-beaver-surpass-tree3&quot;&gt;is asked in math stackexchange&lt;/a&gt;, but such a question may fit better here LOL&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2023-09-07T14:44:13.780" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25996" PostTypeId="2" ParentId="2140" CreationDate="2023-09-08T10:41:17.387" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/265117/how-many-ways-to-cut-a-number-into-an-equation&quot;&gt;How many ways to cut a number into an equation?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="72726" LastEditorUserId="72726" LastEditDate="2023-09-11T13:58:08.117" LastActivityDate="2023-09-11T13:58:08.117" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25997" PostTypeId="2" ParentId="2140" CreationDate="2023-09-08T14:50:12.890" Score="0" Body="&lt;h1&gt;Return every possible program with positive probability&lt;/h1&gt;&#xA;&lt;p&gt;Write a program or function a (subset of a) Program language of your choice that returns every possible Program &lt;strong&gt;in the same Language&lt;/strong&gt; with a positive probability&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You are allowed to take a stream of random bits as input&lt;/li&gt;&#xA;&lt;li&gt;Each program in your language has to have a positive probability to appear&lt;/li&gt;&#xA;&lt;li&gt;All returned programs have to be syntactically correct &lt;em&gt;(META: might need further clarification)&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;If in your language every string satisfies the above condition, consider using a different language&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/random&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;random&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-random-tooltip-container&quot;&gt;random&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Would this be an interesting challenge/ is this a duplicate?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Should I add minimum language requirements (Turing completeness...)?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Is &amp;quot;syntactically correct&amp;quot; clear&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Possible variant with more clear definition: &lt;br&gt;&#xA;&lt;em&gt;&amp;quot;Generate every python program&amp;quot;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-09-08T15:39:09.330" LastActivityDate="2023-09-08T15:39:09.330" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="25998" PostTypeId="2" ParentId="2140" CreationDate="2023-09-08T15:02:20.710" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/265114/sums-of-sum-of-divisors-in-sublinear-time&quot;&gt;Sums of sum of divisors in sublinear time&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2023-09-11T12:24:06.223" LastActivityDate="2023-09-11T12:24:06.223" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="25999" PostTypeId="2" ParentId="9834" CreationDate="2023-09-09T12:00:04.810" Score="-1" Body="&lt;p&gt;&lt;strong&gt;Abstraction&lt;/strong&gt;:&#xA;To quote from ISO standards 7185 and 10206 (Pascal programming language):&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Processor&lt;/strong&gt;&lt;br /&gt;&#xA;A system or mechanism that accepts a program as input, prepares it for execution, and executes the process so defined with data to produce results.&lt;br /&gt;&#xA;&lt;sub&gt;NOTE — A processor may consist of an interpreter, a compiler and run‑time system, or another mechanism, together with an associated host computing machine and operating system, or another mechanism for achieving the same effect. A compiler in itself, for example, does not constitute a processor.&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;ISO standard 9899 (C programming language) has a more elaborate definition of, what it calls “Environment”, but the basic idea stays the same:&#xA;There is &lt;em&gt;one&lt;/em&gt; handover point.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;[…] Notice that I saved two bytes by not giving the last function a name. I can &lt;em&gt;not&lt;/em&gt; run this solution in one part. The first two lines must be loaded from a file while the last one must be run interactively. […]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;No, you cannot do that.&#xA;Splitting your source code into multiple files/inputs &lt;em&gt;conveys&lt;/em&gt; information.&#xA;This information must be scored.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Conclusion&lt;/strong&gt;:&#xA;On PPCG you are free to choose the point/time the transfer of responsibility occurs, the “language” is defined accordingly.&lt;/p&gt;&#xA;" OwnerUserId="94076" LastActivityDate="2023-09-09T12:00:04.810" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26000" PostTypeId="2" ParentId="2140" CreationDate="2023-09-11T07:43:10.633" Score="2" Body="&lt;h1&gt;How sorted is this array&lt;/h1&gt;&#xA;&lt;p&gt;Given an array output the minimum number of swaps needed to sort that array&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1, 2, 3, 4, 5]   -&amp;gt;  0&#xA;[1, 3, 2, 4, 5]   -&amp;gt;  1&#xA;[5, 4, 3, 2, 1]   -&amp;gt;  2&#xA;[1, 3, 4, 5, 2]   -&amp;gt;  3&#xA;[2, 3, 4, 5, 1]   -&amp;gt;  4&#xA;&#xA;[3, 5, 1, 11, 7, 3] -&amp;gt; 3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can assume that the elements of the array are positive integers&lt;/li&gt;&#xA;&lt;li&gt;There might be duplicate elements&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, the shortest code wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Optional additional requirement&lt;/h2&gt;&#xA;&lt;p&gt;Solve the problem in &lt;span class=&quot;math-container&quot;&gt;\$O(n²)\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Would you consider &lt;a href=&quot;https://codegolf.stackexchange.com/questions/197536/swaps-to-sort-an-array&quot;&gt;this challange&lt;/a&gt; to be a duplicate? My solution only asks for the number of swaps, which seems to be a much easier task than finding the actual pairs of indices&lt;br&gt;&#xA;These twp challenges I found are very similar but not exactly the same:&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/261248/how-many-sorting-networks&quot;&gt;sorting networks&lt;/a&gt;,&#xA;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/5011/swaps-needed-to-sort-an-array-in-bubble-sort-method&quot;&gt;swaps in bubble sort&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-09-15T15:50:13.183" LastActivityDate="2023-09-15T15:50:13.183" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26001" PostTypeId="2" ParentId="2140" CreationDate="2023-09-11T13:43:07.893" Score="0" Body="&lt;h1&gt;Simulate Feedback Scheduling on a Uniprocessor&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Alternatively, exploiting university course content for code golf reputation&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Like &lt;a href=&quot;https://codegolf.stackexchange.com/questions/265060/simulate-round-robin-scheduling&quot;&gt;round robin scheduling&lt;/a&gt;, Feedback Scheduling is a way to schedule ready processes in an operating system. And like round robin scheduling, it runs processes for a certain amount of time (quantum), interrupted after that time (if not yet finished), and then added back to a ready queue for another round.&lt;/p&gt;&#xA;&lt;p&gt;However, the key difference is that as a process repeatedly goes through the ready queue, it gets a longer quantum&lt;sup&gt;1&lt;/sup&gt;. This can be compared to having multiple ready queues and processors daisy-chained as so:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/44eib.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/44eib.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In the diagram, the first ready queue sends its processes to the first process to run for some time &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;. If the process finishes in this time, it is released. Otherwise, it is sent to the second ready queue, which has a quantum of &lt;span class=&quot;math-container&quot;&gt;\$2k\$&lt;/span&gt;.&lt;sup&gt;2&lt;/sup&gt; The second ready queue sends its processes to the second processor to run for some time &lt;span class=&quot;math-container&quot;&gt;\$2k\$&lt;/span&gt;. Once again, if the process finishes in this time, the process is released. Otherwise, it is sent to the third ready queue. This generalises all the way down to the nth ready queue, which has interrupted processes sent back to itself. That is, it gets readded to the nth ready queue in a loop.&lt;/p&gt;&#xA;&lt;p&gt;As this is a uniprocessor simulation, there's only one processor, so the concept of daisy-chaining multiple processors doesn't really work&lt;sup&gt;3&lt;/sup&gt;. However, this can be simulated by using process priorities. Indeed, a higher priority process would be in one of the higher ready queues (closer to the first ready queue).  A lower priority process would be in one of the lower ready queues (closer to the nth ready queue). A process with priority &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; will be executed for &lt;span class=&quot;math-container&quot;&gt;\$n k\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; is the quantum.&lt;/p&gt;&#xA;&lt;p&gt;The priority only changes how long a process is executed. It does not change the selection order of the ready queue - that's still a first-come first-serve selection method. Processes arrive with a priority of &lt;code&gt;1&lt;/code&gt;, so as to not have any processes running for 0 time units.&lt;/p&gt;&#xA;&lt;h2&gt;The Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a list of &lt;code&gt;[int, int]&lt;/code&gt; (both &amp;gt; 0), as well as a base quantum, and a maximum priority, return a list of &lt;code&gt;int&lt;/code&gt; representing the order that processes were executed. Assume that all the processes arrive at the same time.&lt;/p&gt;&#xA;&lt;p&gt;The list of &lt;code&gt;[int, int]&lt;/code&gt; represents a (simplified) list of processes. The two ints are the process id and service time (the time the process needs to fully run). (The priority is to be handled by the program, as all processes start with priority 1).&lt;/p&gt;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[1, 5], [2, 10], [3, 3], [4, 12]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Represents the following processes&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Process ID&lt;/th&gt;&#xA;&lt;th&gt;Service Time&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;5&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;10&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;td&gt;12&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;The base quantum is how long each priority runs, before priority multiplication. The maximum priority represents the priority at which processes loop back into the same quantum.&lt;/p&gt;&#xA;&lt;h2&gt;Worked Example&lt;/h2&gt;&#xA;&lt;p&gt;Using the above process list (&lt;code&gt;[[1, 5], [2, 10], [3, 3], [4, 12]]&lt;/code&gt;), a quantum of &lt;code&gt;4&lt;/code&gt;, and a maximum priority of &lt;code&gt;4&lt;/code&gt;, the process execution order will be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;TODO: Worked example at a time that isn't 11:39pm&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input can be taken as &lt;code&gt;list[list[int, int]], int, int&lt;/code&gt;, &lt;code&gt;list[int], list[int], int, int&lt;/code&gt;, or some other reasonable input method.&lt;/li&gt;&#xA;&lt;li&gt;The processes, quantum and maximum priority can be taken in any order.&lt;/li&gt;&#xA;&lt;li&gt;For example:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;list[int: processIds]&#xA;list[int: serviceTimes]&#xA;int: quantum&#xA;int: maximumPriority&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;int: maximumPriority&#xA;list[int: serviceTimes]&#xA;int: quantum&#xA;list[int: processIds]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;or any other combination.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output can be &lt;code&gt;list[int]&lt;/code&gt;, &lt;code&gt;str&lt;/code&gt; (joined on newlines, or spaces, or any constant delimiter) or some other reasonable output method.&lt;/li&gt;&#xA;&lt;li&gt;There will always be at least one process.&lt;/li&gt;&#xA;&lt;li&gt;The process ids list will always be a permutation of the range &lt;code&gt;[1, number of processes]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The process ids can be 0-indexed if you want it to be for some reason. Using 0-indexing, the ids list will always be a permutation of the range &lt;code&gt;[0, number of processes]&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The order of the process ids list is important - processes are executed in the order they arrive (in a first come first serve manner). That is how the ready queue in an actual FB simulation works after all (FCFS selection strategy, with pre-emption on time quantums).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;TODO: Write&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in each language wins.&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Does the description I've provided make sense? It's not verbatim how FB scheduling works, but it's a simplification to make code golfing it not as tedious as it could be.&lt;/li&gt;&#xA;&lt;li&gt;Because I don't have a worked example/test cases yet, some parts might not make sense.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sup&gt;1&lt;/sup&gt; Some variants of Feedback Scheduling use constant time slices for all quantums. However, this challenge will assume a variable time quantum, so as to provide fairness to longer processes.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;2&lt;/sup&gt; The factor of 2 is arbitrary. It could be any integer &amp;gt; 1.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;3&lt;/sup&gt; At least, not with the simplification provided for this challenge. In practice, it might still work.&lt;/p&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2023-09-11T13:43:07.893" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26003" PostTypeId="2" ParentId="2140" CreationDate="2023-09-11T23:06:51.223" Score="2" Body="&lt;h1&gt;Unique String Deletions&lt;/h1&gt;&#xA;&lt;p&gt;You are given a string &lt;code&gt;s&lt;/code&gt;, where &lt;code&gt;s.length &amp;lt;= 42&lt;/code&gt;, and an integer &lt;code&gt;k&lt;/code&gt;, where &lt;code&gt;k &amp;lt;= s.length&lt;/code&gt;.&#xA;All regular test cases have totals &amp;lt; 2147483648, but bonuses exceed this value. If limited by int32, return modulo of value.&lt;/p&gt;&#xA;&lt;p&gt;Return the count of all unique strings obtained by deleting k characters. Fastest algorithm wins. In case of a tie by algorithmic complexity, whoever has the most bonus cases wins.&lt;/p&gt;&#xA;&lt;p&gt;Test cases: These are the sums of all &lt;code&gt;f(s, k)&lt;/code&gt; from k=0 to k=s.length&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;&amp;quot; = 1&#xA;&amp;quot;a&amp;quot; = 2&#xA;&amp;quot;aaaaa&amp;quot; = 6&#xA;&amp;quot;meow&amp;quot; = 16&#xA;&amp;quot;acacc&amp;quot; = 17&#xA;&amp;quot;cbcab&amp;quot; = 26&#xA;&amp;quot;abcacc&amp;quot; = 37&#xA;&amp;quot;cbabca&amp;quot; = 50&#xA;&amp;quot;alifra&amp;quot; = 63&#xA;&amp;quot;caadbac&amp;quot; = 87&#xA;&amp;quot;abbbacbb&amp;quot; = 78&#xA;&amp;quot;abbbbbabab&amp;quot; = 97&#xA;&amp;quot;doggaggy&amp;quot; = 112&#xA;&amp;quot;abbabacca&amp;quot; = 162&#xA;&amp;quot;abbbacbbaa&amp;quot; = 218&#xA;&amp;quot;isosceles&amp;quot; = 384&#xA;&amp;quot;armageddon&amp;quot; = 720&#xA;&amp;quot;123456789abcdef&amp;quot; = 32768&#xA;&amp;quot;supercalifragilistic&amp;quot; = 812760&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Bonus cases: (Used as tiebreaker)&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;arithmosesquippedaliophobia&amp;quot; = 80375252&#xA;&amp;quot;antidisestablishmentarianism&amp;quot; = 174600720&#xA;&amp;quot;pseudopseudohypoparathyroidism&amp;quot; = 644909314&#xA;&amp;quot;supercalifragilisticexpialidocious&amp;quot; = 11073277084&#xA;&amp;quot;hippopotomonstrosesquippedaliophobia&amp;quot; = 14891636776&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="119528" LastEditorUserId="119528" LastEditDate="2023-09-12T03:13:42.680" LastActivityDate="2023-09-12T03:13:42.680" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="26005" PostTypeId="2" ParentId="2140" CreationDate="2023-09-12T11:28:31.830" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/265307/play-a-game-of-memory&quot;&gt;Play a game of memory&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="72726" LastEditorUserId="72726" LastEditDate="2023-09-18T04:49:28.720" LastActivityDate="2023-09-18T04:49:28.720" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26006" PostTypeId="2" ParentId="2140" CreationDate="2023-09-12T15:24:50.947" Score="2" Body="&lt;h1&gt;Build the smallest self driving Car&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your goal is building the smallest self driving car to get from &lt;code&gt;A&lt;/code&gt; to &lt;code&gt;B&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The car is a point mass of 1kg and has a steering wheel to turn left and right, as well as an accelerator pedal to accelerate and brake. Furthermore it is equipped with LIDAR: If 0° is the forward direction, it has a laser every 10° from -90° to +90°. Each of these lasers measures the distance to the next wall. The point &lt;code&gt;A&lt;/code&gt; is where the car starts witz zero velocity, pointing north. The destination &lt;code&gt;B&lt;/code&gt; is an area where the car has to stop to finish the trip (it can be facing any direction).&lt;/p&gt;&#xA;&lt;p&gt;Your job is to write a function that is called every second, to steer your car to the &lt;code&gt;B&lt;/code&gt; area, &lt;em&gt;without&lt;/em&gt; crashing into the wall.&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;def car(lidar, speed):&#xA;    # lidar is an array of 19 floating point numbers&#xA;    # speed is an integer&#xA;    steering = ... # can be any integer from -3 to 3 and refers to a multiple of 10° (eg -2 means -20°) the car is turned in this step.&#xA;    acceleration = ... # can be any of [-1, 0, 1] and refers to the acceleration in `m/s` for the next step&#xA;    # first the car is turned by the indicated amount, then the acceleration is added to the current velocity, and then we take a velocity-sized step in the current direction&#xA;&#xA;    return steering, acceleration&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The function must be deterministic and a black box function, that is, it can only communicate to the outside world via the inputs arguments and the returned values. The function must be as small as possible (measured in bytes).&lt;/p&gt;&#xA;&lt;p&gt;If the car crashes into a wall, it will be disqualified.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/cZzae.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/cZzae.png&quot; alt=&quot;the car with lidar&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Map&lt;/h1&gt;&#xA;&lt;p&gt;the map will need to be determined it will be a closed non-self intersecting polygon. Here is an example but it will be a longer and maybe a little bit more complicated:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/t1cNR.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/t1cNR.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Discussion&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;EDIT: I just remembered there was &lt;a href=&quot;https://codegolf.stackexchange.com/questions/44707/lab-rat-race-an-exercise-in-genetic-algorithms&quot;&gt;Lab Rat Race: an exercise in genetic algorithms&lt;/a&gt; where we did something similar. So maybe it would make sense to take the challenge in a slightly different direction.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;EDIT2: There is an almost identical challenge in &lt;a href=&quot;http://janismac.github.io/ControlChallenges/&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://janismac.github.io/ControlChallenges/&lt;/a&gt; (go to the menu with the little squares and choose &amp;quot;Vehicle Steering&amp;quot; or &amp;quot;Vehicle Racing&amp;quot;). After playing around with this I think a combination of golfing code and time would be nice.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;I'd obviously have to write a controller and come up with a good map that is doable with the velocity/direction constraints. Ideally with some graphical output for the participants to debug their car.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Shall there be multiple maps?&lt;/li&gt;&#xA;&lt;li&gt;Are the discrete actions a good idea? (And are the ranges any good?) I think for the velocity it is nice so the car can come to a full stop in the target area.&lt;/li&gt;&#xA;&lt;li&gt;Should the steering be limited when the velocity is higher?&lt;/li&gt;&#xA;&lt;li&gt;Currently it feels like this will end up as just as a compression challenge i.e. who can hardcode a good sequence of steering inputs. I'm not sure this is all that fun. Are there other challenge modes or variations for this setting that would be more interesting? (The other thing I had in mind was giving the players a fixed code-budget and measuring how far they can get in the map.)&lt;/li&gt;&#xA;&lt;li&gt;Should the cars be allowed to have some memory between each step? (e.g. limited to a certain number of bits) - after the update from above I think it would make sense to allow some (or maybe even an unlimited) amount of memory between each step. But still it would be nice to have some sort of restriction.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2023-09-26T09:01:06.050" LastActivityDate="2023-09-26T09:01:06.050" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26007" PostTypeId="1" CreationDate="2023-09-12T16:18:23.337" Score="2" ViewCount="116" Body="&lt;h1&gt;Puzzle golf (Polf, Pulf, Gozzle, Golfzzle)&lt;/h1&gt;&#xA;&lt;p&gt;I would like to propose a challenge involving two SE sites. &lt;a href=&quot;https://codegolf.stackexchange.com/&quot;&gt;Code Golf&lt;/a&gt; and &lt;a href=&quot;https://puzzling.stackexchange.com/&quot;&gt;Puzzling&lt;/a&gt;. To solve, one has to decipher the specification riddle, and then golf the solution of part 1, to solve the rem post on puzzling.&lt;/p&gt;&#xA;&lt;h3&gt;Code golf:&lt;/h3&gt;&#xA;&lt;p&gt;Standard rules, shortest program wins, no loopholes, and must parse the file to obtain the result&lt;/p&gt;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;&lt;p&gt; Specifications omitted&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3&gt;Puzzling&lt;/h3&gt;&#xA;&lt;p&gt;TBD&lt;/p&gt;&#xA;&lt;h1&gt;Why these two sites?&lt;/h1&gt;&#xA;&lt;p&gt;Because the challenge in question has it's specifications wrapped in a riddle, which will require collaboration between the sites to solve. There will be a way to check if the specification is correct, and the last puzzle (Puzzling) element will only be solvable once the Code golf has been.&lt;/p&gt;&#xA;&lt;h2&gt;My research:&lt;/h2&gt;&#xA;&lt;p&gt;Based on the top upvoted answer at &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/802/119528&quot;&gt;What is a spec&lt;/a&gt; at Code Golf Meta, The puzzle golf should be acceptable.&#xA;However, At &lt;a href=&quot;https://puzzling.meta.stackexchange.com/a/7027&quot;&gt;Line between Programming Puzzle and programming problem&lt;/a&gt;, It mentions that Code Golf has moved away from such puzzles.&#xA;Will Code Golf not accept answers that are part puzzle?&lt;/p&gt;&#xA;&lt;p&gt;I am aware that designing a good golfzzle will be harder than writing a golf and a puzzle separately. (quadratic if you will)&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What, if any qualms do you have on such a challenge?&lt;/li&gt;&#xA;&lt;li&gt;Are there major gotchas I should be aware of before finishing designing the challenge?&lt;/li&gt;&#xA;&lt;li&gt;How would I approach the sandbox on Code Golf? I would like to test the golf there, but it might spoil the puzzle elements. (How to avoid?)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="119528" LastActivityDate="2023-09-21T18:40:18.163" Title="Code golf wrapped in a puzzle" Tags="|discussion|support|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26008" PostTypeId="2" ParentId="2140" CreationDate="2023-09-12T17:07:26.040" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/265221/119528&quot;&gt;Sokobunny I&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="119528" LastEditorUserId="119528" LastEditDate="2023-09-14T15:35:24.237" LastActivityDate="2023-09-14T15:35:24.237" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26009" PostTypeId="2" ParentId="2140" CreationDate="2023-09-13T09:35:53.083" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/265382/find-the-largest-sum-such-that-no-two-elements-are-touching&quot;&gt;Find the largest sum such that no two elements are touching&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-09-20T10:15:55.123" LastActivityDate="2023-09-20T10:15:55.123" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26011" PostTypeId="2" ParentId="2140" CreationDate="2023-09-14T13:17:27.033" Score="0" Body="&lt;h1&gt;Digits of Infinity (computing A206636) &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-math-tooltip-container&quot;&gt;math&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;In &lt;a href=&quot;https://www.vixra.org/pdf/2111.0004v1.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;this PDF&lt;/a&gt;, &lt;a href=&quot;https://www.vixra.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.vixra.org&lt;/a&gt; outlines a way to find the last &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt;&lt;sup&gt;1, 3&lt;/sup&gt; digits of infinity and a method to do so.&lt;/p&gt;&#xA;&lt;p&gt;Let us define the &lt;em&gt;infinity sequence&lt;/em&gt;&lt;sup&gt;2&lt;/sup&gt;, taking the function &lt;span class=&quot;math-container&quot;&gt;\$ f(n) \$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$ f(1) = 2^2 = 4\$&lt;/span&gt;&lt;br&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$ f(n) = 2^{f(n-1)}\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Starting from &lt;span class=&quot;math-container&quot;&gt;\$ f(3) \$&lt;/span&gt;, the last &lt;span class=&quot;math-container&quot;&gt;\$ n - 2 \$&lt;/span&gt; digits are the same for all &lt;span class=&quot;math-container&quot;&gt;\$ f(n) \$&lt;/span&gt; numbers with &lt;span class=&quot;math-container&quot;&gt;\$ n \gt 2 \$&lt;/span&gt; in this sequence.&lt;/p&gt;&#xA;&lt;p&gt;Your task: given an integer &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; through standard I/O, return the last &lt;span class=&quot;math-container&quot;&gt;\$ n \$&lt;/span&gt; digits of infinity.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;&lt;code&gt;n&lt;/code&gt;, an integer (or the closest to one in your language), &lt;span class=&quot;math-container&quot;&gt;\$ \ge 1 \$&lt;/span&gt; (if 1-indexed; you can also take a zero-indexed input, but the number of digits outputted will then have to be &lt;code&gt;n+1&lt;/code&gt;). Most programs will probably compute &lt;span class=&quot;math-container&quot;&gt;\$ f(n+2) \$&lt;/span&gt; for the output, which is permissible (but not compulsory; I'd love to see any other creative way for large &lt;code&gt;n&lt;/code&gt;, though no bonus points). Input will be less than or equal to the highest number &lt;code&gt;n&lt;/code&gt; such that your program can compute in under 2 minutes.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;The last &lt;code&gt;n&lt;/code&gt; (or &lt;code&gt;n+1&lt;/code&gt; if 0-indexed) digits of infinity (through accepted I/O).&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases:&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input -&amp;gt; Output&#xA;&#xA;1 -&amp;gt; 6&#xA;2 -&amp;gt; 36&#xA;3 -&amp;gt; 736&#xA;10 -&amp;gt; 3432948736&#xA;22 -&amp;gt; 8098615075353432948736&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so shortest answer wins!&lt;/p&gt;&#xA;&lt;p&gt;Note: my bet is that most programs that are well-golfed will not be able to calculate these digits easily; &lt;span class=&quot;math-container&quot;&gt;\$ f(5) \$&lt;/span&gt; has over 19000 digits! However, if your program, given infinite time, infinite memory, and unbounded integer types, can compute this, it's valid.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;1. Apparently, the digits of infinity are infinite.&lt;br&gt;2. This is OEIS A206636.&lt;br&gt;3. I do not believe in this method, I just picked it out because I thought it would make for a good challenge.&lt;/sup&gt;&lt;/p&gt;&#xA;" OwnerUserId="110681" LastEditorUserId="110681" LastEditDate="2023-09-18T07:27:40.160" LastActivityDate="2023-09-18T07:27:40.160" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="26013" PostTypeId="2" ParentId="2140" CreationDate="2023-09-16T07:46:32.063" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/265310/numbers-with-distinct-decimal-digits&quot;&gt;Numbers with distinct decimal digits&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-09-18T07:33:19.860" LastActivityDate="2023-09-18T07:33:19.860" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26014" PostTypeId="2" ParentId="2140" CreationDate="2023-09-16T22:09:07.493" Score="1" Body="&lt;h1&gt;Tamagochi&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&#xA;&lt;s&gt; I can't believe there has never been a Tamagochi challenge on code golf!&lt;/s&gt; Edit: There has never been a Tamagochi challenge, but there was a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/100906/make-a-simplified-tamagotchi-giga-pet&quot;&gt;Tamagotchi, whatever that is.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Rules:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The output must begin with &amp;quot;You found an egg!&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;Text-adventure style tamagochi.&lt;/li&gt;&#xA;&lt;li&gt;Prints status changes to stdout.&lt;/li&gt;&#xA;&lt;li&gt;Three actions at any moment:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Rub/pet&lt;/li&gt;&#xA;&lt;li&gt;Feed&lt;/li&gt;&#xA;&lt;li&gt;Info&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;At the start of the program, you must wait for an egg to hatch.&lt;/li&gt;&#xA;&lt;li&gt;If not fed for 4 minutes, pet moves down a hunger status&lt;/li&gt;&#xA;&lt;li&gt;If fed twice in 4 minutes, pet moves up a hunger status.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Accommodations for golfing languages:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The language can't access system time:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You now have to implement a command &lt;code&gt;wait x&lt;/code&gt;, that waits for &lt;code&gt;x&lt;/code&gt; minutes.&lt;/li&gt;&#xA;&lt;li&gt;Each newline advances the time by 30 seconds.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The language can't prompt:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Read the input from a file, and provide the file you used to test.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The language can't read from files:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Well, that sucks. Maybe another lang?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Info:&lt;/h2&gt;&#xA;&lt;p&gt;Shows the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Pet name&lt;/li&gt;&#xA;&lt;li&gt;Pet age&lt;/li&gt;&#xA;&lt;li&gt;Pet hunger&lt;/li&gt;&#xA;&lt;li&gt;Pet happiness&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Pet Statuses/behavior:&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;Initial conditions: Hungry (0 food), Sad (0 pets), Age: 0s&#xA;&#xA;Happy: The pet is happy. Transitions to sad in 3 minutes if no interaction.&#xA;Sad: Pet needs a petting within 2 minute or becomes sick. Takes t/15 pats to return to happy, where t is in seconds.&#xA;&#xA;Hungry: Pet needs to be fed within 2 minutes, or becomes sick.&#xA;Overfed: Pet needs to not be fed more than twice in 4 minutes, or becomes sick. If currently sick and fed by player, advance death timer by 1 minute.&#xA;Fed: Reverses the death timer if not sad or dead.&#xA;&#xA;Old: Pet's age + time not in &amp;quot;Happy&amp;quot; and &amp;quot;Fed&amp;quot; &amp;gt; 1h&#xA;Sick: Pet will die in 5 minutes, if status causing sick is not cured. If sick with no status, remove sick in one minute.&#xA;&#xA;If a pet dies, prints name, condition(s) and time.&#xA;    &amp;quot;Mr. Johnson died of old age, 1h:23m&amp;quot;&#xA;    &amp;quot;Tamagotchi died of sadness 0h:7m&amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The smallest Tamagochi wins.&lt;/p&gt;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&lt;p&gt;The following is an example simulation, where &lt;code&gt;&amp;gt; &lt;/code&gt; could be a prompt, or other input as mentioned in accommodations.&lt;/p&gt;&#xA;&lt;p&gt;Whenever a pet gains or loses a status, it must output&#xA;&lt;code&gt;{pet name} is no{w | longer} {status}&lt;/code&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Termagotchi&#xA;You found an egg!&#xA;...&#xA;The egg is hatching!&#xA;...&#xA;The egg has hatched!&#xA;What would you like to name your pet?&#xA;&amp;gt; Mr. Johnson&#xA;Mr. Johnson is now hungry.&#xA;Mr. Johnson is now sad.&#xA;&amp;gt; Info&#xA;Mr Johnson&#xA;Age: 13s&#xA;Hungry, Sad&#xA;&amp;gt; Feed&#xA;You fed Mr. Johnson.&#xA;&amp;gt; Feed&#xA;You fed Mr. Johnson.&#xA;Mr. Johnson is now fed.&#xA;Mr. Johnson is now happy.&#xA;&amp;gt; Pet&#xA;You petted Mr. Johnson.&#xA;&amp;gt; Pet&#xA;You petted Mr. Johnson.&#xA;&amp;gt; Pet&#xA;You petted Mr. Johnson.&#xA;&amp;gt; Pet&#xA;You petted Mr. Johnson.&#xA;...&#xA;Mr. Johnson is now sad.&#xA;...&#xA;Mr. Johnson is now sick.&#xA;&amp;gt; Pet&#xA;You petted Mr. Johnson.&#xA;&amp;gt; Pet&#xA;You petted Mr. Johnson.&#xA;&amp;gt; Pet&#xA;You petted Mr. Johnson.&#xA;&amp;gt; Pet&#xA;You petted Mr. Johnson.&#xA;Mr. Johnson is now happy.&#xA;&amp;gt; Info&#xA;Mr Johnson&#xA;Age: 14m:27s&#xA;Happy, Sick&#xA;&amp;gt; Feed&#xA;You fed Mr. Johnson.&#xA;...&#xA;Mr. Johnson is now not sick.&#xA;...&#xA;&amp;gt; Feed&#xA;You fed Mr. Johnson.&#xA;&amp;gt; Feed&#xA;You fed Mr. Johnson.&#xA;&amp;gt; Feed&#xA;You fed Mr. Johnson.&#xA;Mr. Johnson is now overfed.&#xA;&amp;gt; Feed&#xA;You fed Mr. Johnson.&#xA;&amp;gt; Feed&#xA;You fed Mr. Johnson.&#xA;Mr. Johnson is now sick.&#xA;&amp;gt; Feed&#xA;You fed Mr. Johnson.&#xA;&amp;gt; Feed&#xA;You fed Mr. Johnson.&#xA;&amp;gt; Feed&#xA;You fed Mr. Johnson.&#xA;&amp;gt; Feed&#xA;You fed Mr. Johnson.&#xA;&amp;gt; Feed&#xA;You fed Mr. Johnson.&#xA;Mr. Johnson died of overfed, 23m:11s&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="119528" LastEditorUserId="119528" LastEditDate="2023-09-17T23:28:18.237" LastActivityDate="2023-09-17T23:28:18.237" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="26015" PostTypeId="2" ParentId="2140" CreationDate="2023-09-16T22:17:55.480" Score="0" Body="&lt;h1&gt;Roll a ball down an array&lt;/h1&gt;&#xA;&lt;p&gt;You are in a frictionless environment in a vacuum. &lt;a href=&quot;https://xkcd.com/669/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Obligatory XKCD&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;You are given a inertialess, sizeless point mass which you have to roll down a slope. The ball starts with 0 speed.&lt;/p&gt;&#xA;&lt;p&gt;If a ball has 0 speed and is touching the ground, it gains 1 speed in the direction of the lowest adjacent point. If both adjacent heights are the same, add 1 speed in the direction last traveled.&#xA;When a ball &lt;strong&gt;changes direction, subtract 1 speed&lt;/strong&gt; after the change. (This ensures that no loops occur)&lt;/p&gt;&#xA;&lt;p&gt;The ball gains or loses speed based on the difference between the ball's current height, and the end height. A ball moves to the lowest possible square where the speed obeys the formula.&#xA;&lt;span class=&quot;math-container&quot;&gt;$$(speed+1)^2 &amp;lt; (h-newh)^2 + (idx-newidx)^2$$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given an array of integer heights, return the steps for the ball to settle/escape.&lt;/p&gt;&#xA;&lt;h2&gt;Ball Speed-move diagram&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;     . 4 4 4 .&#xA;   4 4 3 3 3 4 4&#xA; . 4 3 2 2 2 3 4 . &#xA; 4 3 2 1 1 1 2 3 4&#xA; 4 3 2 1 O 1 2 3 4&#xA; 4 3 2 1 1 1 2 3 4&#xA; . 4 3 2 2 2 3 4 .&#xA;   4 4 3 3 3 4 4&#xA;     . 4 4 4 .&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Examples:&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;[5,3,2,1,2,4] -&amp;gt; 5&#xA;&#xA;&#xA;Diagram:     Ball SPD = 1 Ball SPD = 2 Ball SPD = 3 BALL SPD = 1 Ball ESCAPED!&#xA;0            1            2            3            4            5&#xA;()           x\&#xA;55           55()         55 x         55           55        () 55         x&#xA;55        44 55        44 55()      44 55 x`\,   44 55        44 55        44&#xA;5533      44 5533      44 5533      44 5533  ()  44 5533   x  44 5533      44&#xA;553322  2244 553322  2244 553322  2244 553322  2244 553322  2244 553322  2244&#xA;553322112244 553322112244 553322112244 553322112244 553322112244 553322112244&#xA;&#xA; 0 1   2   3     4&#xA;[9,8,7,6,5,4,3,2,1] -&amp;gt; 5&#xA;&#xA;          SPEED 1   SPEED 2   SPEED 4   SPEED 7   BALL ESCAPED&#xA;0         1         2         3         4         5&#xA;@         x&#xA;9         9@        9x        9         9         9         &#xA;98        98        98 @      98 x      98        98        &#xA;987       987       987       987       987       987       &#xA;9876      9876      9876      9876 @    9876 x    9876      &#xA;98765     98765     98765     98765     98765     98765     &#xA;987654    987654    987654    987654    987654    987654    &#xA;9876543   9876543   9876543   9876543   9876543 @ 9876543 x &#xA;98765432  98765432  98765432  98765432  98765432  98765432  &#xA;977654321 977654321 977654321 977654321 977654321 977654321&#xA;&#xA; 0 1   2   3     4             5&#xA;[9,8,7,6,5,4,3,2,2,2,2,2,2,2,2,2,1] -&amp;gt; 6&#xA;&#xA; 0 1 2&#xA;[2,1,2] -&amp;gt; 3&#xA;&#xA; 0 1&#xA;   2&#xA;   0 (Loses 1 speed due to the direction change)&#xA;&#xA;[2,1,3] -&amp;gt; 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Questions for sandbox:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How many more test cases should I add?&lt;/li&gt;&#xA;&lt;li&gt;Are there any inconsistencies or rules that need clarification?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="119528" LastEditorUserId="119528" LastEditDate="2023-09-17T19:16:40.373" LastActivityDate="2023-09-17T19:16:40.373" CommentCount="0" CommunityOwnedDate="2023-09-16T22:17:55.480" ContentLicense="CC BY-SA 4.0" />
  <row Id="26016" PostTypeId="2" ParentId="2140" CreationDate="2023-09-18T14:38:40.720" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/265776/the-multiples-are-missing&quot;&gt;The multiples are missing&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/integer&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;integer&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-integer-tooltip-container&quot;&gt;integer&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-sequence-tooltip-container&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="56433" LastEditorUserId="56433" LastEditDate="2023-10-05T10:57:33.737" LastActivityDate="2023-10-05T10:57:33.737" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26017" PostTypeId="2" ParentId="2140" CreationDate="2023-09-19T06:00:56.467" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/265480/78410&quot;&gt;Do you win a Numeric Mahjong?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2023-09-25T10:11:56.400" LastActivityDate="2023-09-25T10:11:56.400" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="26018" PostTypeId="2" ParentId="2140" CreationDate="2023-09-19T06:32:03.333" Score="0" Body="&lt;p&gt;really shitty sloppy wip but i just want to start this post so that i can be past the first hurdle next time i look at this. feel free to ask anything just know this is like step 0;&lt;/p&gt;&#xA;&lt;h3&gt;implement this weird algorithm which will be given a more descriptive name&lt;/h3&gt;&#xA;&lt;p&gt;here is the algorithm in js:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-js prettyprint-override&quot;&gt;&lt;code&gt;f = x =&amp;gt; x.reduce((a, b) =&amp;gt; [b, ...f(a)], [])&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;implement this program in your language of choice;&lt;/p&gt;&#xA;&lt;h3&gt;rules&lt;/h3&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-restricted-complexity-tooltip-container&quot;&gt;restricted-complexity&lt;/a&gt; it has to run in faster time complexity than this naive implementation, which is like, exponential i think.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; shortest code wins&lt;/p&gt;&#xA;&lt;p&gt;notes: i might make it so you only have to output the result of running this on range lists like [0 1 2 3 ... n], so only the permutation that the algorithm results in, rather than for arbitrary input, since generating the permutation is one thing and then applying it is another&lt;/p&gt;&#xA;" OwnerUserId="107310" LastActivityDate="2023-09-19T06:32:03.333" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26019" PostTypeId="2" ParentId="2140" CreationDate="2023-09-19T12:43:03.583" Score="0" Body="&lt;h1&gt;Find an eigenvalue of a 3x3 Matrix&lt;/h1&gt;&#xA;&lt;p&gt;Write a program of function that given a 3x3 matrix as input outputs an Eigenvalue of that matrix&lt;/p&gt;&#xA;&lt;p&gt;Examples/Test-cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[1,0,0],[0,1,0],[0,0,1]]    -&amp;gt; 1.0&#xA;[[1,2,3],[4,5,6],[7,8,7]]    -&amp;gt; -0.22165260583979401&#xA;[[5,3,4],[2,6,7],[0,4,10]]   -&amp;gt; 1.887934888738847&#xA;[[-3,2,5],[0,6,7],[0,0,-10]] -&amp;gt; -3.0&#xA;[[0.2915131378594483, 0.41257765061649787, 0.9253019986284902], [0.21696836678486353, 0.5331738150906348, 0.3247753676328128], [0.20672257620794932, 0.3453811902047663, 0.4771215769253173]] -&amp;gt; -0.03135020654472091&#xA;[[0.2447175622890705, 0.38693057299215594, 0.8576673327257548], [0.47607062999761074, 0.1126298515845301, 0.9707452917395663], [0.7524371727807047, 0.502675518344781, 0.6725321940186385]] -&amp;gt; -0.2768104753672565&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can take the matrix in any convenient format&lt;/li&gt;&#xA;&lt;li&gt;The input matrix will be 3x3, the entries will be in the interval &lt;code&gt;[-10,10]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;The error of your result should be at most &lt;code&gt;10^-5&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Your program may fail for some inputs as long as the probability of failure for a Matrix with uniformly distributed entries is 0&lt;/li&gt;&#xA;&lt;li&gt;You can choose any eigenvalue as output, and may return different values on different calls&lt;/li&gt;&#xA;&lt;li&gt;You are &lt;strong&gt;not&lt;/strong&gt; allowed to use built-in functions that directly compute a eigenvalue/eigenvector of a matrix&lt;/li&gt;&#xA;&lt;li&gt;You are allowed to use other matrix functions but are encouraged to solve the problem without matrix built-ins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Example solution in Python (non-golfed)&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;Uses a derivative-free variation of Newtons algorithm on the determinant&lt;/em&gt;&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;def det(M):&#xA;  return (M[0][0]*M[1][1]*M[2][2]+M[0][1]*M[1][2]*M[2][0]+M[0][2]*M[1][0]*M[2][1]-&#xA;          M[2][0]*M[1][1]*M[0][2]-M[2][1]*M[1][2]*M[0][0]-M[2][2]*M[1][0]*M[0][1])&#xA;&#xA;def copy(M):&#xA;  return [[a for a in R]for R in M]&#xA;&#xA;def subtX(M,x):&#xA;  N=copy(M)&#xA;  for i in range(len(M)):&#xA;    N[i][i]-=x;&#xA;  return N&#xA;&#xA;def eigenValue(M):&#xA;  x0=0;x1=1;y0=1&#xA;  while abs(y0)&amp;gt;1e-5:&#xA;    N0=subtX(M,x0)&#xA;    N1=subtX(M,x1)&#xA;    y0=det(N0);y1=det(N1)&#xA;    x0,x1=x0-y0*(x1-x0)/(y1-y0),x0&#xA;  return x0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://ato.pxeger.com/run?1=fVXLbhtHEESAnPQVeySdpdM9Pd09bYH5A-ngQxCA2ANtUzYBgRJoCiG_JRdfkv_JNZf8Smpml5YMhCYW2GFtdXX1Y8k__no8HT497L58-fPpcLco__zw74fNXfdhc5jdzN9cdd1-c3ja77rZzYoGXK9uVjzgwj0NuH5qOE94mnCa8DThNOE8LCB5_kzUF5ItZDFRX0i21Isp5QvJlnp-dVUtv394PH3rebVad3cP-27dbXfd26Ee39bjzTBGfH56d_htdtMfW9DtclLAuVK3lbpf7z5uZvebHfDGAm-1HXAtlsfr51S3o-Jm-3Gz-3V9_7SZnBxpSddHXvL1iZYM4PdP2_tNt373eXai-S-8WeikSsuvdmg-QvwM8QhBpE7mlubXJx6P05MjgbQ80uJEr2ZHXkDk59mJ8XUOwWejR5rm_OPfj_vt7jB7YXm14p56GvoV9TzdcRqG-fzqf8mpF5Byr73h7n3p_RJZe-kzSKk3kKpy7jldYi8E2tpoZzr1C75ohV6nYGVh8aKRc5G-o9eZk7qbkrHl8OIVjKRCHFEslRyUhr6r4WxhRcy85GKiLV5F2KWwUpBJLhWTlN1VzE1S4VSmcDJPSGaJPHJIatSsCGbkoOxmoyV3TgxitQHx7xSUs7OrpVSCnLQpFgsh9RQBERRawQI1c5HkMKB5coSMiDIww43JG5U5ASnKWnLtQuuH46GifS6hcDmGu6YsyJ-8QCa3ziklc1UuAmulBaNqlcSRidG1opfLEa8tTq6EYMewWjj8KExbLsnCWxZLJhRGSZCrhE9-rGYR9BnT8JBxkrCMsEKFgI8jC1BKcgbfy3k86INrFASgl-TavFMUeMY4JYVJRAMxmiDUJ4ZOGhW7XBFpQYOxF1BNVazFS6qtNM5IA9PWSpJ6bA3IqEsnUwF5DBFwbR6P8Vk0wSw2lrA72uJzQSWYfDCax18njCEGRoenmZ3HjoaUMM9YLU6hZdyaLNhDlAo8k31nSEacMkEjY0fKOHUj6GBbPTB67GLLgueGBUJfCbsV55cgGTIgr-ElgLNx5UIztiQ0Mbxy03TxbOgbms91zaeGsJDUF5BhkyxiLD5qOdDTYGYrDcQaC2tLhFeBZPzZGX_Zzv9k_wE&quot; rel=&quot;nofollow noreferrer&quot;&gt;Attempt This Online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this duplicate/ and interesting question ?&lt;/li&gt;&#xA;&lt;li&gt;Is my explanation clear ?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="118682" LastActivityDate="2023-09-19T12:43:03.583" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26020" PostTypeId="2" ParentId="2140" CreationDate="2023-09-19T14:41:56.283" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/265424/implement-subleq&quot;&gt;Implement Subleq&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2023-09-22T20:39:32.260" LastActivityDate="2023-09-22T20:39:32.260" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26021" PostTypeId="2" ParentId="2140" CreationDate="2023-09-20T04:12:40.830" Score="2" Body="&lt;h1&gt;Add two rational numbers... esoterically&lt;/h1&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Build a binary operator &lt;span class=&quot;math-container&quot;&gt;\$\star : \mathbb{Z} \times \mathbb{Z} \to \mathbb{Z}\$&lt;/span&gt; such that, there exists a bijection &lt;span class=&quot;math-container&quot;&gt;\$i : \mathbb{Z} \to \mathbb{Q}\$&lt;/span&gt; such that, for every integer &lt;span class=&quot;math-container&quot;&gt;\$M\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$M \star N = i^{-1}(i(M) + i(N))\$&lt;/span&gt; holds.&lt;/p&gt;&#xA;&lt;p&gt;Or in mathematical terms, build a binary operator &lt;span class=&quot;math-container&quot;&gt;\$\star\$&lt;/span&gt; that admits a group isomorphism from &lt;span class=&quot;math-container&quot;&gt;\$(\mathbb{Z}, \star)\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$(\mathbb{Q}, +)\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;I/O Format&lt;/h2&gt;&#xA;&lt;p&gt;Flexible. Standard loopholes apply.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;This is a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-algorithm&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-algorithm&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-fastest-algorithm-tooltip-container&quot;&gt;fastest-algorithm&lt;/a&gt; challenge. The submission whose the &lt;strong&gt;asymptotic&lt;/strong&gt; worst-case time complexity of &lt;span class=&quot;math-container&quot;&gt;\$\star\$&lt;/span&gt; is the fastest wins.&lt;/p&gt;&#xA;&lt;p&gt;The parameter &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; for the time complexity is &lt;span class=&quot;math-container&quot;&gt;\$s(M) + s(N)\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$s\$&lt;/span&gt; is defined as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$s(0) = s(-1) = 0\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;For every integer &lt;span class=&quot;math-container&quot;&gt;\$D &amp;gt; 0\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$s(D) = \lfloor \log_2 D \rfloor + 1\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;For every integer &lt;span class=&quot;math-container&quot;&gt;\$D &amp;lt; -1\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$s(D) = \lfloor \log_2 (-D-1) \rfloor + 1\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The shortness of your code is a tiebreaker. That is, this challenge is secondarily &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Notes and Rules&lt;/h2&gt;&#xA;&lt;p&gt;Note that each bijection &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt; induces &lt;span class=&quot;math-container&quot;&gt;\$\star\$&lt;/span&gt; uniquely. As such, your submission must specify your choice of &lt;span class=&quot;math-container&quot;&gt;\$i\$&lt;/span&gt;.&lt;/p&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2023-09-20T04:36:56.573" LastActivityDate="2023-09-20T04:36:56.573" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="26022" PostTypeId="2" ParentId="2140" CreationDate="2023-09-20T15:58:22.477" Score="3" Body="&lt;p&gt;Find the k-th largest number&lt;/p&gt;&#xA;&lt;p&gt;Given the string representation of three sorted lists, get the k-th largest number.&lt;/p&gt;&#xA;&lt;p&gt;The string representation has such form:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 3 5 7 11 120 9988&#xA;23 68 99 111&#xA;107 131 888&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;aka. lists are separated by newline &lt;code&gt;\n&lt;/code&gt; and numbers in one list are separated by space.&lt;/p&gt;&#xA;&lt;p&gt;Length of each list, length of the string and k are directly given, but access to the string costs. You can fetch from a given position. Least fetches wins.&lt;/p&gt;&#xA;&lt;p&gt;Your solution should handle all possible inputs well, but only optimize score for average cases.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##VVBdb4IwFH3nV9w32oAo4DZMxxKSPe9pb26JBStUsDVtMVkWfzu7dWq2Nqfp/Tr33LvnJ24bI49upvRWTK/VewUlbNLHDIriCdJltgryHFYZpAWeIM1yQCwvz8OGBTvhmk5YLFqgMarGSa3g4iWSwncAEEXXJIaGEW40CnyjtfxkwTlotLJ6EMmgW9K7juSxvz4hGYRqXRenlLJ/abemEYRw/YeUTff2nkbxGFSNaGJAnhj6XzUnbsDLrYzhXwQj1MvaaQPEh2S5YCCf0c9Q@HUCAItiseg2ly85IzyRTfZaKhKGNDlwH55/bKN5660jeRsPtTA0sdo4Qnhc0/KFz2r6ZxV23fs9TNMP&quot; rel=&quot;nofollow noreferrer&quot;&gt;This&lt;/a&gt; is an example solution. It solves the problem with an awful score, but you can also use lib here. Write the lib if it's absent in your language.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Sorted lists in test cases will be generated in this way:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Generate 1 million (1'000'000) integers uniformly in &lt;span class=&quot;math-container&quot;&gt;\$\left[0, 2^{31}-1\right]\$&lt;/span&gt;. Duplicates will likely appear.&lt;/li&gt;&#xA;&lt;li&gt;Sort them.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;[Not decided yet] It's fine if your code is only optimized for three 1M length arrays and fallback to worst solution for other input.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2023-10-11T08:43:41.887" LastActivityDate="2023-10-11T08:43:41.887" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26023" PostTypeId="1" AcceptedAnswerId="26025" CreationDate="2023-09-21T10:33:24.107" Score="19" ViewCount="340" Body="&lt;p&gt;Over on Meta Stack Exchange, there's a question asking for &lt;a href=&quot;https://meta.stackexchange.com/q/393127/391137&quot;&gt;sites to volunteer for a trial of removing reputation requirements for voting&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Is that something the Code Golf and Coding Challenges community would be interested in?&lt;/p&gt;&#xA;&lt;p&gt;(this question isn't in support of, or opposition against the trial)&lt;/p&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="106744" LastEditDate="2023-09-24T21:23:41.050" LastActivityDate="2023-09-24T21:23:41.050" Title="Is code golf going to be opting into the voting reputation requirement test?" Tags="|discussion|voting|reputation|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26024" PostTypeId="2" ParentId="2140" CreationDate="2023-09-21T11:14:09.793" Score="1" Body="&lt;h1&gt;Fastest decimal to binary &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/binary&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;binary&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;binary&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-binary-tooltip-container&quot;&gt;binary&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base-conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-base-conversion-tooltip-container&quot;&gt;base-conversion&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-fastest-code-tooltip-container&quot;&gt;fastest-code&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-number-tooltip-container&quot;&gt;number&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/258397/number-to-binary&quot;&gt;Same challenge, but code golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a decimal number, your task is to convert it to binary.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;8496867758 -&amp;gt; 111111010011100111110100110101110&#xA;28284301455933783441 -&amp;gt; 11000100010000110000001100101000101001000111111110011110110010001&#xA;701550526345030865283462565098928586836 -&amp;gt; 1000001111110010011011011101110100010101010100010110011100010101100110100000111111010100100011101000000011010011011100000001010100&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can take input either as a string containing decimal digits, or a list of decimal digits.&lt;/li&gt;&#xA;&lt;li&gt;You need to output the number in binary, either as a string containing the binary digits or a list of binary digits.&lt;/li&gt;&#xA;&lt;li&gt;You are allowed to have leading zeros in the output.&lt;/li&gt;&#xA;&lt;li&gt;The input won't contain leading zeros.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Your score is the maximum number of digits your code can handle in under a second on my computer (Intel Core i7-9700 with 8 threads, 32GB RAM). If your code takes less than a second for a number with a million digits, you beat all solutions which can't do that, and the tie-breaker is the time it takes for a million digit number.&lt;/p&gt;&#xA;&lt;p&gt;To calculate the time I will randomly select 10 numbers, and look at the average time.&lt;/p&gt;&#xA;&lt;h1&gt;Meta question&lt;/h1&gt;&#xA;&lt;p&gt;Is this a dupe? I looked for this question but couldn't find it.&lt;/p&gt;&#xA;&lt;p&gt;I noticed that using GMP's standard I/O functions this takes 0.05 seconds for a million digit number. Is there a point to this question, or is it likely GMP is optimized enough that this will be the winning solution?&lt;/p&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2023-09-22T16:08:36.017" LastActivityDate="2023-09-22T16:08:36.017" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="26025" PostTypeId="2" ParentId="26023" CreationDate="2023-09-21T12:56:59.930" Score="38" Body="&lt;h1&gt;No&lt;/h1&gt;&#xA;&lt;p&gt;Code Golf participating would provide minimal useful information for Stack Exchange given our unique format, and it would solve a problem we really don't have (insufficient voting/interaction).&lt;/p&gt;&#xA;&lt;p&gt;In fact, this would likely make our issues with FGITWing and drive-by voting on unimpressive answers even worse.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2023-09-21T12:56:59.930" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26026" PostTypeId="2" ParentId="26007" CreationDate="2023-09-21T18:40:18.163" Score="7" Body="&lt;h3&gt;I don't think this is a good idea&lt;/h3&gt;&#xA;&lt;p&gt;As noted in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/8047/66833&quot;&gt;Things to avoid when writing challenges&lt;/a&gt;,&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;We aim for our challenges to be as easy to understand as possible. &lt;sub&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8047/things-to-avoid-when-writing-challenges?noredirect=1&amp;amp;lq=1&amp;amp;answertab=scoredesc#comment55978_16186&quot;&gt;Source&lt;/a&gt;&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Unlike Puzzling.SE, where the question is the puzzle and the answers, well... the answer, challenges on this site are specified tasks with clear and objective rules. A bit of flavor and fun is perfectly fine (such as encoding the opening to a challenge about writing a decoder), but fundamentally, the rules of a challenge have to be clear and accessible to all.&lt;/p&gt;&#xA;&lt;p&gt;Additionally, I question whether the specification will even be comprehensive enough when posed as a riddle. Quite often, corner cases and unexpected inputs will sink a challenge that is written plain as day, because the OP didn't consider how they should handle division by zero or empty inputs. By posing it as a riddle, at best you're likely to leave out how to handle these cases. At worst, people will come to different answers and create an inconsistent challenge spec.&lt;/p&gt;&#xA;&lt;p&gt;Finally, we require challenges to be self-contained. &amp;quot;Outsourcing&amp;quot; the spec to another question or challenge is not allowed, so, in order to be a valid challenge on this site, you'd need to include the puzzle as the challenge itself. At which point, it would get closed as not being clear.&lt;/p&gt;&#xA;&lt;p&gt;In short, while the idea is a nice one, it likely wouldn't work with our requirements for challenges.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;What you could do, however, is an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-answer-chaining-tooltip-container&quot;&gt;answer-chaining&lt;/a&gt; challenge: each answer must solve a puzzle posited in the previous answer which gives a &amp;quot;validity&amp;quot; requirement (e.g. the answer to each puzzle is a word and the next answer may not use any letters from that word in their answer). I'd recommend running this through the Sandbox, as there could be a number of pitfalls around it.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2023-09-21T18:40:18.163" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26027" PostTypeId="1" AcceptedAnswerId="26033" CreationDate="2023-09-22T03:35:06.713" Score="7" ViewCount="198" Body="&lt;p&gt;I have noticed that &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-sequence-tooltip-container&quot;&gt;sequence&lt;/a&gt; questions are often looking at strictly increasing integer sequences. For these types of sequences, the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-sequence-tooltip-container&quot;&gt;sequence&lt;/a&gt; task of outputting the values in the sequence is largely equivalent to the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-decision-problem-tooltip-container&quot;&gt;decision-problem&lt;/a&gt; of deciding whether a number appears in the sequence.&lt;/p&gt;&#xA;&lt;p&gt;This suggests the option of having an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/increasing-integer-sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;increasing-integer-sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;increasing-integer-sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-increasing-integer-sequence-tooltip-container&quot;&gt;increasing-integer-sequence&lt;/a&gt; tag, for which both &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-sequence-tooltip-container&quot;&gt;sequence&lt;/a&gt; answers and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-decision-problem-tooltip-container&quot;&gt;decision-problem&lt;/a&gt; answers are valid.&lt;/p&gt;&#xA;&lt;p&gt;Should we do that? What are the pros and cons?&lt;/p&gt;&#xA;" OwnerUserId="92727" LastActivityDate="2023-09-23T05:57:06.037" Title="Equivalence between strictly increasing integer sequences and decision problems" Tags="|discussion|code-golf|tags|challenges|" AnswerCount="2" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="26028" PostTypeId="2" ParentId="2140" CreationDate="2023-09-22T18:17:28.153" Score="6" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/265561/print-the-answer-before-a-given-answer&quot;&gt;Print the answer before a given answer&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="79857" LastEditorUserId="79857" LastEditDate="2023-09-28T14:00:56.363" LastActivityDate="2023-09-28T14:00:56.363" CommentCount="15" ContentLicense="CC BY-SA 4.0" />
  <row Id="26029" PostTypeId="2" ParentId="9619" CreationDate="2023-09-22T18:43:29.413" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://www.typescriptlang.org&quot; rel=&quot;nofollow noreferrer&quot;&gt;TypeScript&lt;/a&gt;’s Type System&lt;/h1&gt;&#xA;&lt;p&gt;TypeScript is a programming language made by Microsoft and first released in 2012. It can be described as a wrapper around JavaScript with a type-checker that runs when TS code is compiled to JS.&lt;/p&gt;&#xA;&lt;p&gt;But I’m not advocating for you to golf in TypeScript—what I want is for more people to try golfing in the language’s surprisingly powerful type system. While not technically Turing-complete because it cannot have an infinite loop, with enough optimization it can do pretty much whatever you want it to.&lt;/p&gt;&#xA;&lt;p&gt;Using TypeScript’s type system offers a unique set of challenges; it can be a middle ground between esoteric tarpits and practical languages. Doing any sort of arithmetic is very challenging and has to be thought about creatively. On the other hand, however, the language is rather good at string and array pattern matching and manipulation, as well as having limited set operations via union and intersection types.&lt;/p&gt;&#xA;&lt;p&gt;Perhaps a major factor in choosing this language to golf in is that your submission in TypeScript’s type system is almost guaranteed to score you a lot of reputation points on the site :P&lt;/p&gt;&#xA;&lt;p&gt;So what are you waiting for?! Join the &lt;a href=&quot;https://chat.stackexchange.com/rooms/145771/typescript-type-system&quot;&gt;TypeScript Type System chatroom&lt;/a&gt; and check out the &lt;a href=&quot;https://www.typescriptlang.org/play&quot; rel=&quot;nofollow noreferrer&quot;&gt;TypeScript playground&lt;/a&gt; today! Also be sure to check out &lt;a href=&quot;https://codegolf.stackexchange.com/q/237784/108687&quot;&gt;Tips for golfing in TypeScript&amp;#39;s type system&lt;/a&gt;. The language can be hard to get started with, so if you need help with anything, don’t hesitate to ping me (@noodleman) in the TS chatroom linked above if you need any help figuring stuff out or have any questions.&lt;/p&gt;&#xA;&lt;h3&gt;Here are a few explained examples to get you started.&lt;/h3&gt;&#xA;&lt;pre class=&quot;lang-typescript prettyprint-override&quot;&gt;&lt;code&gt;// Given text like &amp;quot;_ eats _ and _.&amp;quot;&#xA;// and a list like [&amp;quot;Bob&amp;quot;,&amp;quot;cheese&amp;quot;,&amp;quot;crackers&amp;quot;],&#xA;// return &amp;quot;Bob eats cheese and crackers.&amp;quot;&#xA;type F&amp;lt;A,B,C=&amp;quot;&amp;quot;&amp;gt;=[A,B]extends[`${infer S}_${infer R}`,[infer W extends string,...infer L]]?F&amp;lt;R,L,`${W}${S}${C}`&amp;gt;:C&#xA;&#xA;// This type F is the submission.&#xA;type F&amp;lt;&#xA;  A, // type parameter A is the string  with blanks&#xA;  B, // type parameter B is the tuple (list) of words to fill in.&#xA;  C = &amp;quot;&amp;quot; // C, defaulting to an empty string, is what’s going to become &#xA;         // the final result after recursion.&#xA;&amp;gt; = // match the list [A,B] against&#xA;  [A, B] extends [&#xA;    // match any string S, an underscore, and the rest of the string R.&#xA;    // this takes the bit before the first underscore &#xA;    `${infer S}_${infer R}`,&#xA;    // match the first element W and the rest L of the list.&#xA;    // we assert W is a string so the compiler won’t &#xA;    // yell that it can’t be inserted into a string later.&#xA;    [infer W extends string, ...infer L]&#xA;  ]&#xA;  // matching the two in a list means we only &#xA;  // need to use one extends clause, rather than 2.&#xA;    // if the match succeeded,&#xA;    // recurse with A=R, B=L, C=C+S+W&#xA;    ? F&amp;lt;R, L, `${C}${S}${W}`&amp;gt;&#xA;    // otherwise, there are no blanks left; return C&#xA;    : C&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(I will add more examples soon—if you need more just search for TypeScript on the main site and sort by newest.)&lt;/p&gt;&#xA;&lt;h3&gt;Drawbacks&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Your experience getting started is probably not going to be easy. Golfing in Typescript’s type system is very different from almost any other language used in this site.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;There’s no native support for arithmetic, so you have to implement it yourself.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You’re not going to get anywhere if you want to deal with the code points of characters outside of the ASCII range-at least not without hardcoding all of unicode in your program :P&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Your types must be tail-recursive to increase the recursion depth from 50 to 999.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Happy golfing!&lt;/p&gt;&#xA;" OwnerUserId="108687" LastActivityDate="2023-09-22T18:43:29.413" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26030" PostTypeId="1" CreationDate="2023-09-22T22:00:01.870" Score="-3" ViewCount="193" Body="&lt;p&gt;I am asking this because &lt;a href=&quot;https://github.com/Vyxal/Vyxal&quot; rel=&quot;nofollow noreferrer&quot;&gt;Vyxal&lt;/a&gt;, and &lt;em&gt;mainly&lt;/em&gt; Vyxal has a compression algorithm to shave bytes off. I think of this as a bit unfair, so I would like to propose the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If a programming language has a compression algorithm, then include the compressed score &lt;em&gt;and&lt;/em&gt; the normal score.&lt;/li&gt;&#xA;&lt;li&gt;Furthermore, rank &lt;em&gt;both&lt;/em&gt; scores. For example, if you had &lt;code&gt;ɖ+ṁ&lt;/code&gt; with 3 bytes in Vyxal, and compressed as 3.25 bytes, then you would rank &lt;code&gt;Vyxal&lt;/code&gt; as 3 bytes and &lt;code&gt;Vyxal (compressed)&lt;/code&gt; as 3.25 bytes.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="111474" LastEditorUserId="46076" LastEditDate="2023-09-23T02:27:15.357" LastActivityDate="2023-10-04T17:21:42.367" Title="Byte compression in scores" Tags="|discussion|scoring|" AnswerCount="3" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26031" PostTypeId="2" ParentId="26030" CreationDate="2023-09-22T22:19:51.833" Score="7" Body="&lt;h1&gt;Why should separate languages be scored as the same language?&lt;/h1&gt;&#xA;&lt;p&gt;The current &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/14339/78850&quot;&gt;code golf command line flag policy&lt;/a&gt; is that using flags in a submission makes the submission in a unique language. So why should a flagless variant of a language include the flagless score?&lt;/p&gt;&#xA;&lt;p&gt;&amp;quot;What do flags have to do with this?&amp;quot; you ask.&lt;/p&gt;&#xA;&lt;p&gt;Well technically speaking, Vyncode is a command line flag. It's literally implemented as the &lt;code&gt;=&lt;/code&gt; flag. This was done for user convenience, and the byte count header doesn't include the flag explicitly because it's implied by the fact the answer is scored in bits.&lt;/p&gt;&#xA;&lt;p&gt;So by site meta consensus, Vyncode is a flag variant, meaning it doesn't count as Vyxal at all. So why should both bit count and sbcs count have to be included?&lt;/p&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2023-09-22T22:19:51.833" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26032" PostTypeId="2" ParentId="26030" CreationDate="2023-09-22T22:46:51.090" Score="5" Body="&lt;h1&gt;There's also other problems&lt;/h1&gt;&#xA;&lt;h2&gt;People might not want to use the encoding at all&lt;/h2&gt;&#xA;&lt;p&gt;There's been many cases of people saying that they don't want to use the encodings because they don't feel comfortable doing so. Should they be forced to use it just because it exists?&lt;/p&gt;&#xA;&lt;h2&gt;How retroactive would the change be? Would it need to be edited in to all answers using a compression algorithm?&lt;/h2&gt;&#xA;&lt;p&gt;There would be a lot of answers on the site using some sort of encoding. Vyncode is far from the first compression algorithm as algorithms like Packed Stax exist, and have done so for many years. Should all of those answers be edited, flooding the home page?&lt;/p&gt;&#xA;&lt;h2&gt;What counts as a compression algorithm?&lt;/h2&gt;&#xA;&lt;p&gt;Where do you draw the line between having a compression algorithm and being inherently compressed? What about one of the many fracbyte languages? Do they use compression algorithms? Or what if there's no way to run a non-compressed program, but you can only generate programs using an external compressor?&lt;/p&gt;&#xA;&lt;h1&gt;Overall, this would be inconvenient and a hassle for everyone, just for the sake of &lt;em&gt;feeling&lt;/em&gt; &amp;quot;fair&amp;quot;&lt;/h1&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2023-09-22T22:46:51.090" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26033" PostTypeId="2" ParentId="26027" CreationDate="2023-09-23T05:34:04.363" Score="20" Body="&lt;h2&gt;This isn't a good default&lt;/h2&gt;&#xA;&lt;p&gt;I wouldn't expect or want for my &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-sequence-tooltip-container&quot;&gt;sequence&lt;/a&gt; challenges to allow membership-oracle solution by default just because the sequence is increasing. While &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-sequence-tooltip-container&quot;&gt;sequence&lt;/a&gt; allows various formats by default, what they share in common is outputting elements of the sequence, which the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-decision-problem-tooltip-container&quot;&gt;decision-problem&lt;/a&gt; version does not. Yes, a membership oracle could be converted to a sequence generator, but this looping costs bytes to implement that shouldn't be &amp;quot;free&amp;quot;.&lt;/p&gt;&#xA;" OwnerUserId="20260" LastActivityDate="2023-09-23T05:34:04.363" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26034" PostTypeId="2" ParentId="26027" CreationDate="2023-09-23T05:57:06.037" Score="0" Body="&lt;h2&gt;This is a good default&lt;/h2&gt;&#xA;&lt;p&gt;This output method is very similar to outputting the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-th value in a sequence.&lt;/p&gt;&#xA;&lt;p&gt;If you implement a function &lt;code&gt;f&lt;/code&gt; which returns the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-th value in the sequence, then the sequence is &lt;code&gt;map(f, integers)&lt;/code&gt;. If &lt;code&gt;f&lt;/code&gt; is a membership oracle, the sequence is &lt;code&gt;filter(f, integers)&lt;/code&gt;. I think the difference between a map over the integers and a filter over them is small enough that if we allow one we should allow the other, unless the writer explicitly excludes it.&lt;/p&gt;&#xA;&lt;p&gt;Another perspective to this similarity is the operations: outputting the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-th value in the sequence, compared to outputting the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;-th value in the indicator sequence. A strictly increasing integer sequence and its indicator sequence are very closely tied, so I think both output methods should be allowed. In fact, this even suggests a broadening of the suggestion — answers can choose whether to output the sequence or the indicator sequence, using any of the default methods for either, although that's a discussion for another time.&lt;/p&gt;&#xA;" OwnerUserId="92727" LastActivityDate="2023-09-23T05:57:06.037" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26035" PostTypeId="2" ParentId="2140" CreationDate="2023-09-23T09:11:07.837" Score="-2" Body="&lt;h1&gt;Execute... yourself!&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/471/self-compiling-compiler&quot;&gt;Almost a duplicate, but only requires you to compile a subset, and is closed.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;You work at a compiler factory, making compilers tailored to your customers.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;In a programming language of your choice, write a program that executes code in the chosen language. Snippets are allowed, but you may not hardcode the input.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;To deal with languages like &lt;a href=&quot;https://esolangs.org/wiki/No.&quot; rel=&quot;nofollow noreferrer&quot;&gt;No&lt;/a&gt;, should I change it to a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-popularity-contest-tooltip-container&quot;&gt;popularity-contest&lt;/a&gt;, or disallow languages like that completely?&lt;/li&gt;&#xA;&lt;li&gt;Is it clear enough?&lt;/li&gt;&#xA;&lt;li&gt;Are there any unclosed challenges this duplicates?&lt;/li&gt;&#xA;&lt;li&gt;Anything else?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compiler&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compiler&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;compiler&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-compiler-tooltip-container&quot;&gt;compiler&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="117478" LastActivityDate="2023-09-23T09:11:07.837" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26036" PostTypeId="1" CreationDate="2023-09-24T10:43:19.937" Score="2" ViewCount="132" Body="&lt;p&gt;Please refer to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/26010/89459&quot;&gt;this post&lt;/a&gt; on Sandbox. (&lt;strong&gt;EDIT:&lt;/strong&gt; The challenge is &lt;a href=&quot;https://codegolf.stackexchange.com/q/265809/89459&quot;&gt;posted&lt;/a&gt; on main.)&lt;/p&gt;&#xA;&lt;p&gt;Basically, the proposed challenge is about a new numeral system I made. Though the proposal doesn't &lt;em&gt;require&lt;/em&gt; the I/O format to be in the numeral system, I have a serious problem now: &lt;strong&gt;This opens new possibility for an I/O format about integers.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;AFAIK, our default policies about I/O formats don't stop from inputting/outputting integers in this new format. We even allow using different formats for the input and the output.&lt;/p&gt;&#xA;&lt;p&gt;Though I've just prohibited I/O in NDos-numeral as a stopgap, there might appear new programming languages whose default I/O format for integers is NDos-numeral, and I &lt;em&gt;hope&lt;/em&gt; that would be considered a standard loophole.&lt;/p&gt;&#xA;&lt;p&gt;What should I do?&lt;/p&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2023-10-06T00:11:52.247" LastActivityDate="2023-10-06T00:11:52.247" Title="What are our policies about this exotic I/O format about integers?" Tags="|discussion|policy|" AnswerCount="0" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26037" PostTypeId="2" ParentId="2140" CreationDate="2023-09-24T20:19:29.137" Score="1" Body="&lt;h3&gt;Given A Binary String, Determine Which Of Certain Substrings Are Equal And Opposite&lt;/h3&gt;&#xA;&lt;p&gt;yea the title is going to need some work&lt;/p&gt;&#xA;&lt;h3&gt;Concept&lt;/h3&gt;&#xA;&lt;p&gt;Take an even length binary string&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 1 0 1 0 0 1 0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Between each bit, place an arrow&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 1 0 1 0 0 1 0&#xA; ^ ^ ^ ^ ^ ^ ^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Next, find each substring centered on each arrow which includes either/both the start and the end of the string&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 1&#xA; ^&#xA;1 1 0 1&#xA;   ^&#xA;1 1 0 1 0 0&#xA;     ^&#xA;1 1 0 1 0 0 1 0&#xA;       ^&#xA;    0 1 0 0 1 0&#xA;         ^&#xA;        0 0 1 0&#xA;           ^&#xA;            1 0&#xA;             ^&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If each half of the binary string has all of the flipped bits of the other half (in any order), replace the arrow with a 1, else a 0&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 1&#xA; 0&#xA;1 1 0 1&#xA;   0&#xA;1 1 0 1 0 0&#xA;     1&#xA;1 1 0 1 0 0 1 0&#xA;       1&#xA;    0 1 0 0 1 0&#xA;         0&#xA;        0 0 1 0&#xA;           0&#xA;            1 0&#xA;             1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Then get rid of the sublists which will leave you with just the arrows-turned-bits&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 0 0 1 1 0 0 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You must output those bits.&lt;/p&gt;&#xA;&lt;h3&gt;Examples:&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;00 0&#xA;01 1&#xA;10 1&#xA;11 0&#xA;0000 000&#xA;0001 001&#xA;0011 010&#xA;1001 111&#xA;1011 100&#xA;1100 010&#xA;000011 00010&#xA;100101 11111&#xA;101101 10001&#xA;00110011 0101010&#xA;00111100 0101010&#xA;10101010 1111111&#xA;11000101 0111011&#xA;11010010 0011001&#xA;11100010 0011101&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Meta&lt;/h3&gt;&#xA;&lt;p&gt;yea I don't have the vocabulary for this. I'm gonna hammer at it some more but if you read this and something jumps out at you where youre like &amp;quot;oh i know what thats called&amp;quot; Please let me know thank you&lt;/p&gt;&#xA;" OwnerUserId="107310" LastEditorUserId="107310" LastEditDate="2023-10-03T16:58:09.880" LastActivityDate="2023-10-03T16:58:09.880" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="26038" PostTypeId="2" ParentId="2140" CreationDate="2023-09-24T23:14:01.710" Score="1" Body="&lt;h1&gt;Barbrack&lt;/h1&gt;&#xA;&lt;p&gt;Your task is to write a program or function that takes a non-negative integer (in decimal or any other convenient base for your language) and output a number in the numbering system &lt;strong&gt;Barbrack&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;What's that?&lt;/h2&gt;&#xA;&lt;p&gt;Barbrack is a numbering system I made up that can represent non-negative integers. Zero is represented with an empty string or an underscore, one is represented with [], and all other positive integers can be represented with a &lt;strong&gt;brack&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;A &lt;strong&gt;brack&lt;/strong&gt; is delimited with brackets [] and works as follows (with an example of 84):&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Take your number a and find its prime factorization. In this case, the prime factorization of 84 is 2&lt;sup&gt;2&lt;/sup&gt;*3&lt;sup&gt;1&lt;/sup&gt;(*5&lt;sup&gt;0&lt;/sup&gt;)*7&lt;sup&gt;1&lt;/sup&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Find the indices of these primes, where the index of 2 is 1. In this case, the index of 3 is 2, since it's the prime right after 2, and the index of 7 is 4, since it's the fourth prime.&lt;/li&gt;&#xA;&lt;li&gt;Take the exponents of each prime, and put them in brackets in increasing order of the size of the prime, with consecutive exponents being separated by bars (|). So the general format is [exponent of 2|exponent of 3|exponent of 5…]—in this case, [2|1|0|1]. &lt;strong&gt;Minimize the number of cells!&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Recursively calculate the exponents in Barbrack, remembering that 0 is the empty string and 1 is []. So [2|1|0|1] =&amp;gt; [[1]|[]||[]] =&amp;gt; [[[]]|[]||[]].&lt;/li&gt;&#xA;&lt;li&gt;Output the final result.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Test inputs&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 -&amp;gt; (nothing)&#xA;1 -&amp;gt; []&#xA;2 -&amp;gt; [[]]&#xA;5 -&amp;gt; [||[]]&#xA;45 -&amp;gt; [|[[]]|[]]&#xA;84 -&amp;gt; [[[]]|[]||[]]&#xA;65535 -&amp;gt; [|[]|[]||||[](48 bars)[]]&#xA;65536 -&amp;gt; [[[[[]]]]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(sidenote: (48 bars) means 48 consecutive bars in the actual output)&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; apply.&lt;/li&gt;&#xA;&lt;li&gt;No input in Barbrack! This isn't a cat challenge!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Minimum bytes on a per-language basis.&lt;/p&gt;&#xA;" OwnerUserId="95056" LastEditorUserId="95056" LastEditDate="2023-09-29T21:54:39.820" LastActivityDate="2023-09-29T21:54:39.820" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="26039" PostTypeId="2" ParentId="2140" CreationDate="2023-09-25T05:45:48.373" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/265514/78410&quot;&gt;I (rev)?(pal)? the source code, you (rev)?(pal)? the input!&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2023-09-27T06:33:23.913" LastActivityDate="2023-09-27T06:33:23.913" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26040" PostTypeId="2" ParentId="2140" CreationDate="2023-09-26T21:08:37.570" Score="0" Body="&lt;h1&gt;Interpret a Turing Complete (strict) Subset of your Language&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Write a program which can interpret some programs exactly the same way as your language, where these can be used to model any computation.&lt;/li&gt;&#xA;&lt;li&gt;Demonstrate how to do this.&lt;/li&gt;&#xA;&lt;li&gt;Your Interpreter may have features your language doesn't have, but your demonstration may not use them.&lt;/li&gt;&#xA;&lt;li&gt;You may not use a built-in which interprets the source language, like &lt;code&gt;eval()&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The feature set does not need to be made of characters or something, you just need to say what it is.&lt;/p&gt;&#xA;&lt;p&gt;It's [code-golf] until i can think of something better. how do you do tags in markdown?&lt;/p&gt;&#xA;&lt;p&gt;Example: a javascript interpreter which only allows String.replace, functions, and the ternary conditional thing &lt;code&gt;? :&lt;/code&gt; may be able to be used as a convoluted slashes emulator.&lt;/p&gt;&#xA;&lt;p&gt;Discussion:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This challenge was originally intended to make all languages equally interesting, but I think it still favors turing tarpits and golfing languages.&lt;/li&gt;&#xA;&lt;li&gt;As with many Challenges which already exist, this one also gives actually interpreted languages kind of a leg up.&lt;/li&gt;&#xA;&lt;li&gt;Making it illegal for turing completeness to arise from interpreter quirks is propably not that important. (like, ACE in my brainfuck interpreter?)&lt;/li&gt;&#xA;&lt;li&gt;Banning eval might introduce rules-lawyering on what eval actually is, like, are Regexes allowed? is a built-in which evaluates arithmetic allowed? I'd say yes.&#xA;It might also further favor turing tarpits, though it would nerf golfing languages which propably have an eval construct.&#xA;It might also make the program more laborious to write, obviously, but&lt;/li&gt;&#xA;&lt;li&gt;Allowing eval might make writing the program boring as well, as that's an established technique.&lt;/li&gt;&#xA;&lt;li&gt;Making this [code-golf] is boring, maybe i should make it about the conciseness of an example program? It wouldn't devolve into HQ9+, but its discriminatory, like how is slashes supposed to calculate a factorial?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="118401" LastEditorUserId="118401" LastEditDate="2023-09-26T22:27:56.660" LastActivityDate="2023-09-26T22:27:56.660" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26041" PostTypeId="2" ParentId="2140" CreationDate="2023-09-27T00:05:25.633" Score="3" Body="&lt;h1&gt;Complete an equivalence relation&lt;/h1&gt;&#xA;&lt;p&gt;In set theory, a &lt;em&gt;relation&lt;/em&gt; from a set &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; to a set &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; is a set of pairs of elements from &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;. For example, &lt;span class=&quot;math-container&quot;&gt;\$\{(1, 5), (1, 6), (2, 4), (3, 5)\}\$&lt;/span&gt; is a relation  from the set &lt;span class=&quot;math-container&quot;&gt;\$\{1, 2, 3\}\$&lt;/span&gt; to the set &lt;span class=&quot;math-container&quot;&gt;\$\{4, 5, 6\}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;A relation &lt;span class=&quot;math-container&quot;&gt;\$R\$&lt;/span&gt; from a set &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; to itself is an &lt;em&gt;equivalence relation&lt;/em&gt; iff:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;It is &lt;em&gt;reflexive&lt;/em&gt;: For all elements of &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$(a, a)\$&lt;/span&gt; is in &lt;span class=&quot;math-container&quot;&gt;\$R\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;It is &lt;em&gt;symmetric&lt;/em&gt;: If a pair &lt;span class=&quot;math-container&quot;&gt;\$(a, b)\$&lt;/span&gt; is in &lt;span class=&quot;math-container&quot;&gt;\$R\$&lt;/span&gt;, then so is &lt;span class=&quot;math-container&quot;&gt;\$(b, a)\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;li&gt;It is &lt;em&gt;transitive&lt;/em&gt;: If the pairs &lt;span class=&quot;math-container&quot;&gt;\$(a, b)\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$(b, c)\$&lt;/span&gt; are in &lt;span class=&quot;math-container&quot;&gt;\$R\$&lt;/span&gt;, then so is &lt;span class=&quot;math-container&quot;&gt;\$(a, c)\$&lt;/span&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For example, &lt;span class=&quot;math-container&quot;&gt;\$\{(1, 1), (1, 2), (2, 1), (2, 2), (3, 3)\}\$&lt;/span&gt; is an equivalence relation on the set &lt;span class=&quot;math-container&quot;&gt;\$\{1, 2, 3\}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to, given a relation from a set to itself, add as few pairs of elements as possible to transform it into an equivalence relation.&lt;/p&gt;&#xA;&lt;h2&gt;Worked example&lt;/h2&gt;&#xA;&lt;p&gt;If we start with the relation &lt;span class=&quot;math-container&quot;&gt;\$\{(1, 2), (3, 2), (4, 4)\}\$&lt;/span&gt;, then:&lt;/p&gt;&#xA;&lt;p&gt;Firstly, the relation must be reflexive, so all pairs of elements &lt;span class=&quot;math-container&quot;&gt;\$(a, a)\$&lt;/span&gt; must be added, resulting in &lt;span class=&quot;math-container&quot;&gt;\$\{(1, 2), (3, 2), (4, 4), (1, 1), (2, 2), (3, 3)\}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Next, the relation must be symmetric, so we need to add the inverses of &lt;span class=&quot;math-container&quot;&gt;\$(1, 2)\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$(3, 2)\$&lt;/span&gt;, resulting in &lt;span class=&quot;math-container&quot;&gt;\$\{(1, 2), (3, 2), (4, 4), (1, 1), (2, 2), (3, 3), (2, 1), (2, 3)\}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Finally, the relation must be transitive. Since &lt;span class=&quot;math-container&quot;&gt;\$(1, 2)\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$(2, 3)\$&lt;/span&gt; are in the relation, so must be &lt;span class=&quot;math-container&quot;&gt;\$(1, 3)\$&lt;/span&gt;, and likewise &lt;span class=&quot;math-container&quot;&gt;\$(3, 1)\$&lt;/span&gt; must also be in the relation. Adding these results in &lt;span class=&quot;math-container&quot;&gt;\$\{(1, 2), (3, 2), (4, 4), (1, 1), (2, 2), (3, 3), (2, 1), (2, 3), (1, 3), (3, 1)\}\$&lt;/span&gt;, and this is an equivalence relation.&lt;/p&gt;&#xA;&lt;p&gt;Input/output is can be lists of pairs of positive integers, or an adjacency matrix. You can optionally take the domain of the relation (i.e. all unique values in it). The order in which you output the pairs does not matter, and you can assume the input will be nonempty.&lt;/p&gt;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;{(1, 1)} -&amp;gt; {(1, 1)}&#xA;{(1, 2)} -&amp;gt; {(1, 2), (1, 1), (2, 2), (2, 1)}&#xA;{(1, 2), (3, 4)} -&amp;gt; {(1, 2), (1, 1), (2, 2), (2, 1), (3, 4), (3, 3), (4, 4), (4, 3)}&#xA;{(1, 2), (1, 3)} -&amp;gt; {(1, 2), (1, 3), (1, 1), (2, 2), (3, 3), (2, 1), (3, 1), (2, 3), (3, 2)}&#xA;{(1, 1), (2, 2), (3, 3)} -&amp;gt; {(1, 1), (2, 2), (3, 3)}&#xA;{(1, 1), (2, 2), (3, 4)} -&amp;gt; {(1, 1), (2, 2), (3, 3), (3, 4), (4, 3)}&#xA;{(1, 2), (3, 2), (4, 1)} -&amp;gt; {(1, 1), (2, 2), (3, 3), (4, 4), (1, 2), (1, 3), (1, 4), (2, 1), (2, 3), (2, 4), (3, 1), (3, 2), (3, 4), (4, 1), (4, 2), (4, 3)}&#xA;{(8, 19), (4, 12), (9, 31), (4, 18)} -&amp;gt; {(8, 8), (8, 19), (19, 8), (19, 19), (4, 4), (4, 12), (4, 18), (12, 4), (12, 12), (12, 18), (18, 4), (18, 12), (18, 18), (9, 9), (9, 31), (31, 9), (31, 31)}&#xA;{(8, 7), (2, 7), (14, 3), (3, 16)} -&amp;gt; {(2, 2), (2, 7), (2, 8), (7, 2), (7, 7), (7, 8), (8, 2), (8, 7), (8, 8), (3, 3), (3, 14), (3, 16), (14, 3), (14, 14), (14, 16), (16, 3), (16, 14), (16, 16)}&#xA;{(1, 1), (1, 2)} -&amp;gt; {(1, 1), (1, 2), (2, 1), (2, 2)}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2023-09-29T01:30:37.433" LastActivityDate="2023-09-29T01:30:37.433" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="26042" PostTypeId="1" CreationDate="2023-09-27T12:50:31.123" Score="7" ViewCount="220" Body="&#xA;&#xA;&#xA;&lt;p&gt;&lt;em&gt;This was prompted by the recent meta post about &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/26030/byte-compression-in-scores&quot;&gt;byte compression in scores&lt;/a&gt;, as well as other bits of confusion and uncertainty I've seen on the site.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;If you've been around on the main site in the last 4 months, you may have noticed answer headers like these:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Op6M4.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Op6M4.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/GOIux.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/GOIux.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/dUEx3.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/dUEx3.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;And you may have wondered &amp;quot;hang on a second, I thought Vyxal 2 was scored using a Single Byte Character Set! How can it be scored in bits?&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;Well, &lt;a href=&quot;https://github.com/Vyxal/Vyxal/blob/main/vyxal/encoding.py&quot; rel=&quot;nofollow noreferrer&quot;&gt;you're right&lt;/a&gt;. By default, Vyxal is indeed still scored as SBCS. However, as of the &lt;a href=&quot;https://chat.stackexchange.com/transcript/106764?m=63472996#63472996&quot;&gt;29th of April 2023&lt;/a&gt;, it can also be scored using a compression technique called range coding.&lt;/p&gt;&#xA;&lt;p&gt;This meta post serves as an explanation of Vyncode in the context of the site. It also gives usage guidelines.&lt;/p&gt;&#xA;&lt;h2&gt;What is Vyncode?&lt;/h2&gt;&#xA;&#xA;&lt;p&gt;To quote the &lt;a href=&quot;https://github.com/Vyxal/Vyncode&quot; rel=&quot;nofollow noreferrer&quot;&gt;repository&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Vyncode, pronounced &amp;quot;vine code&amp;quot; for consistency with the rest of the organisation, is a compression system for Vyxal programs. It turns SBCS code into a string of bits, which may or may not result in a whole amount of bytes. Oftentimes, you'll see some fraction of a byte in the byte count.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;In other words, it's a way to encode normal SBCS programs as a string of bits, which can then be scored as per site consensus.&lt;/p&gt;&#xA;&lt;p&gt;Vyncode uses a &lt;a href=&quot;https://en.wikipedia.org/wiki/Range_coding&quot; rel=&quot;nofollow noreferrer&quot;&gt;range coder&lt;/a&gt; to generate compressed bitstrings. It's a tiny bit complicated to explain in a meta post (I barely understand how it works myself), but it's essentially Huffman coding but way better. As of version 2 of Vyncode, it's &amp;quot;trained&amp;quot; on roughly 1400 vyxal programs taken from CGCC answers, Codidact answers, and week.golf submissions.&lt;/p&gt;&#xA;&lt;p&gt;When given a SBCS program, Vyncode will compress it, and return a bitstring. When given a bitstring, Vyncode will decompress it, and execute the resulting SBCS program. For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 2 3 ++&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Turns into:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;01000000100110100111100111010001010111001011111100010&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Which is 53 bits/6.625 bytes, 1.375 bytes shorter.&lt;/p&gt;&#xA;&lt;h2&gt;How is Vyncode used?&lt;/h2&gt;&#xA;&lt;p&gt;Short answer: As a flag.&lt;/p&gt;&#xA;&lt;p&gt;For technical reasons, Vyncode is implemented using command line flags (more on the implications of this later). These flags are the &lt;code&gt;!&lt;/code&gt; flag and the &lt;code&gt;=&lt;/code&gt; flag.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;code&gt;!&lt;/code&gt; flag reads a bitstring as the program, converts to SBCS internally, and executes the resulting program. It exists mostly so that people can verify that a bitstring is actually being executed (kinda like how languages like Vyxal and Jelly have a flag that strictly reads a file as raw bytes).&lt;/p&gt;&#xA;&lt;p&gt;The &lt;code&gt;=&lt;/code&gt; flag reads a SBCS program, executes it normally, and then prints the compressed bitstring. This is what's most commonly used for Code Golf answers, as it means that people can golf using SBCS characters for convenience and let the interpreter worry about mucking around with bitstrings.&lt;/p&gt;&#xA;&lt;p&gt;On the online interpreter (hosted at &lt;a href=&quot;https://vyxal.pythonanywhere.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://vyxal.pythonanywhere.com/&lt;/a&gt; for version 2 [version 3 coming soon]), both the &lt;code&gt;!&lt;/code&gt; flag and the &lt;code&gt;=&lt;/code&gt; flag will switch the byte count to bits. The &lt;code&gt;=&lt;/code&gt; flag generates a real-time bit count (albeit a little slow, as is the nature of range coding).&lt;/p&gt;&#xA;&lt;h2&gt;How come the bit string isn't present in the answer when using the &lt;code&gt;=&lt;/code&gt; flag?&lt;/h2&gt;&#xA;&lt;p&gt;Short answer: Convenience. A long string of bits doesn't help anyone.&lt;/p&gt;&#xA;&lt;p&gt;Do you really want a long string of 0s and 1s in the answer text? It's automatically printed when you visit the try it online link and doesn't actually have any mnemonic meaning, so it doesn't help anyone wanting to understand the answer.&lt;/p&gt;&#xA;&lt;p&gt;The SBCS is presented for convenience. The bitstring could have been used, or included somewhere in the auto-template, but that probably wouldn't have looked as good.&lt;/p&gt;&#xA;&lt;h2&gt;What's the superscript number in the answer header for?&lt;/h2&gt;&#xA;&lt;p&gt;Short answer: The version of vyncode.&lt;/p&gt;&#xA;&lt;p&gt;That represents the version of Vyncode the answer used. At the time of writing, there are 2 versions of Vyncode, both with a different corpus used for training. It's present because a program compressed using v1 for example will give a different bitstring than the result of using v2 on the same program.&lt;/p&gt;&#xA;&lt;p&gt;The version of Vyncode used can be changed on the online interpreter:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/9QWcG.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/9QWcG.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The idea is that because there's no way to specify a version, backward compatibility for scoring needs to be implemented separately.&lt;/p&gt;&#xA;&lt;h2&gt;What are the implications of Vyncode being a flag variant?&lt;/h2&gt;&#xA;&lt;p&gt;The implication of Vyncode being flag enabled is that it's technically a separate language, as per site consensus. It may be unofficially considered the same as base Vyxal, but it's officially considered different.&lt;/p&gt;&#xA;&lt;h2&gt;If vyncode is a flag variant then why isn't the flag present in the header like other flags are?&lt;/h2&gt;&#xA;&lt;p&gt;Because it's present in the word &amp;quot;bits&amp;quot;. It should be somewhat obvious by the fact that there's a non-standard byte count that something &amp;quot;non-base-language&amp;quot; is going on. It's also much cleaner to not have the &lt;code&gt;=&lt;/code&gt; or &lt;code&gt;!&lt;/code&gt; flag in the header.&lt;/p&gt;&#xA;&lt;h2&gt;Can I use a version of Vyncode newer than a question?&lt;/h2&gt;&#xA;&lt;p&gt;Obviously, the answer is &amp;quot;yes&amp;quot;, because it's not like anyone is going to hunt you down and stop you from doing so. (At least as far as I know).&lt;/p&gt;&#xA;&lt;p&gt;More seriously, that's a bit of a grey area. Someone may have already submitted an answer to that question, meaning the program would be in the training data. This leads to overfitting, which may or may not fall under the loophole of creating a language specifically for a challenge. I say may or may not because it'd need discussion and input from people more knowledgeable.&lt;/p&gt;&#xA;&lt;p&gt;As a general rule of thumb, don't Vyncode existing answers. Doing so avoids any possibility of cheating from intentional overfitting. It is, of course, perfectly fine to Vyncode an answer that contains parts of existing answers.&lt;/p&gt;&#xA;&lt;h2&gt;Should I go around leaving comments that an answer could be better scored with Vyncode?&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;No&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;All questions of overfitting aside, do &lt;em&gt;not&lt;/em&gt; use Vyncode as a golfing suggestion. Some people might not want to use it, or might not have had access to it at the time (i.e. all answers before April 2023). So don't create noise for them.&lt;/p&gt;&#xA;&lt;p&gt;To quote &lt;a href=&quot;https://chat.stackexchange.com/transcript/106764?m=63816670#63816670&quot;&gt;myself&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Generally, if an answer doesn't use Vyncode, leaving a comment like &amp;quot;hi there hello use Vyncode to get this shorter&amp;quot; isn't helpful&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;And to quote &lt;a href=&quot;https://chat.stackexchange.com/transcript/106764?m=63816665#63816665&quot;&gt;myself again&lt;/a&gt;:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;However, you can a) vyncode a golfing suggestion that would otherwise save sbcs bytes and b) suggest a shorter bit count if vyncode is already used (two programs can be functionally equivalent and have different bit counts).&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Can I use it for other languages?&lt;/h2&gt;&#xA;&lt;p&gt;Yes! Under site rules, you're allowed to use any encoding you want for your code. While Vyncode is specifically optimised for Vyxal code, there's nothing stopping you from training the range coder on large amounts of golfed code in other languages.&lt;/p&gt;&#xA;&lt;p&gt;Anyhow, that's all for now. Hopefully, that clears a few things up regarding Vyncode. Now would you like fries with that?&lt;/p&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2023-10-05T22:32:38.043" LastActivityDate="2023-10-05T22:32:38.043" Title="A clarification on Vyncode" Tags="|support|scoring|vyxal|" AnswerCount="0" CommentCount="0" ClosedDate="2023-10-05T15:02:14.447" ContentLicense="CC BY-SA 4.0" />
  <row Id="26043" PostTypeId="2" ParentId="2140" CreationDate="2023-09-28T13:53:00.213" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/265627/119678&quot;&gt;Decrypt an autokey cipher&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="119678" LastEditorUserId="119678" LastEditDate="2023-09-30T23:44:09.993" LastActivityDate="2023-09-30T23:44:09.993" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26044" PostTypeId="2" ParentId="2140" CreationDate="2023-09-28T15:44:30.507" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/265720/generate-conways-atomic-elements&quot;&gt;Generate Conway's Atomic Elements&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="73054" LastEditorUserId="73054" LastEditDate="2023-10-03T19:21:34.213" LastActivityDate="2023-10-03T19:21:34.213" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26045" PostTypeId="2" ParentId="2140" CreationDate="2023-09-28T17:10:32.497" Score="-1" Body="&lt;h1&gt;Catouterr&lt;/h1&gt;&#xA;&lt;p&gt;A cat that writes to two streams? I’m in!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Write a full program with these properties:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If the input string ends in &lt;code&gt;outerr&lt;/code&gt;, remove that part and write the rest to &lt;code&gt;STDOUT&lt;/code&gt; and &lt;code&gt;STDERR&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If the input string ends in &lt;code&gt;err&lt;/code&gt; but not &lt;code&gt;outerr&lt;/code&gt;, remove that part and write the rest to &lt;code&gt;STDERR&lt;/code&gt; only.&lt;/li&gt;&#xA;&lt;li&gt;If the input string ends in &lt;code&gt;out&lt;/code&gt;, remove that part and print the rest to &lt;code&gt;STDOUT&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Otherwise, print it to &lt;code&gt;STDOUT&lt;/code&gt; unchanged.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;code&gt;STDOUT&lt;/code&gt; and &lt;code&gt;STDERR&lt;/code&gt; can be replaced by a reasonable alternative. Also, &lt;code&gt;STDERR&lt;/code&gt; is not ignored. However, insuppressible messages are ignored.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so shortest code wins!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Ask away!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="117478" LastEditorUserId="92727" LastEditDate="2023-09-29T03:18:08.427" LastActivityDate="2023-09-29T03:18:08.427" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="26046" PostTypeId="2" ParentId="2140" CreationDate="2023-09-29T01:47:57.913" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/265670/write-a-set-as-a-union-of-ranges&quot;&gt;Write a set as a union of ranges&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2023-10-02T05:12:39.037" LastActivityDate="2023-10-02T05:12:39.037" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26047" PostTypeId="2" ParentId="2140" CreationDate="2023-09-29T21:14:30.770" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/265725/implement-the-regpack-decompressor&quot;&gt;Implement the RegPack decompressor&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2023-10-04T01:00:31.667" LastActivityDate="2023-10-04T01:00:31.667" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26048" PostTypeId="2" ParentId="2140" CreationDate="2023-09-29T23:57:49.043" Score="1" Body="&lt;h1&gt;Factorial Numbers&lt;/h1&gt;&#xA;&lt;p&gt;Write a function or program to print &amp;quot;factorial numbers&amp;quot; as defined in this &lt;a href=&quot;https://www.explainxkcd.com/wiki/index.php/2835:_Factorial_Numbers&quot; rel=&quot;nofollow noreferrer&quot;&gt;xkcd comic&lt;/a&gt;. Test cases are conveniently provided by the comic too.&lt;/p&gt;&#xA;&lt;p&gt;You will take an integer number N as input.&lt;/p&gt;&#xA;&lt;p&gt;You can either&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;output the factorial number representation of N&lt;/li&gt;&#xA;&lt;li&gt;output the factorial number representation of all numbers up to and including N in order (note: must include N; this is different from default rules)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;You can assume that the input is not &amp;quot;illegal&amp;quot;, but your program must work for all legal inputs. Default loopholes and I/O rules apply. If this can be done in 1 built-in method, you may post it but it will not compete.&lt;/p&gt;&#xA;&lt;p&gt;This is code-golf so shortest wins. The competition will be between each language, so non-golfing languages should compete.&lt;/p&gt;&#xA;" OwnerUserId="101644" LastEditorUserId="101644" LastEditDate="2023-09-30T00:00:45.903" LastActivityDate="2023-09-30T00:00:45.903" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26049" PostTypeId="1" CreationDate="2023-09-30T14:20:53.397" Score="17" ViewCount="323" Body="&lt;p&gt;A somewhat common pattern in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-source-layout-tooltip-container&quot;&gt;source-layout&lt;/a&gt; is to have competitors write a program which does task A (usually cat or printing a constant), but when a transform B is applied to the program the modified program does B applied to A.&lt;/p&gt;&#xA;&lt;p&gt;Here are a bunch of examples, (they also have very similar titles):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/16043/56656&quot;&gt;Mirror quine (or my head hurts)&lt;/a&gt; [tag added] (and its duplicate &lt;a href=&quot;https://codegolf.stackexchange.com/q/265566/56656&quot;&gt;I reverse the source code, you reverse the source code!&lt;/a&gt;) [tag added]&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/118884/56656&quot;&gt;Period 2 Reversed Quine&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/132558/56656&quot;&gt;I double the source, you double the output!&lt;/a&gt; [tag added]&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/196864/56656&quot;&gt;I shift the source code, you shift the input!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/193315/56656&quot;&gt;I reverse the source code, you reverse the input!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/193331/56656&quot;&gt;I transpose the source code, you transpose the input!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/197051/56656&quot;&gt;Pass on your radiation&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/221209/56656&quot;&gt;I palindrome the source code, you palindrome the input!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/265514/56656&quot;&gt;I (rev)?(pal)? the source code, you (rev)?(pal)? the input!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/221225/56656&quot;&gt;I Rot-13 the source code, you Rot-19 the output!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Here are some marginal examples:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The transform applied to the source and the output are similar but not the same:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/104882/56656&quot;&gt;Make an interweaving quine&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/192979/56656&quot;&gt;I reverse the source code, you negate the output!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/193021/56656&quot;&gt;I reverse the source code, you negate the input!&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Fits the description by virtue of the fact that the source and the output are the same thing:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/73657/56656&quot;&gt;Radiation softened quine&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/154629/56656&quot;&gt;Russian Nesting Quine&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/140099/56656&quot;&gt;Unfurling-Safe Quine&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This seems like a good candidate for a tag:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;There are a number of similar challenges.&lt;/li&gt;&#xA;&lt;li&gt;They have been posted with some degree of regularity for an extended period of time (6 years since the first, the most recent was posted this week).&lt;/li&gt;&#xA;&lt;li&gt;There seems to be substantial room for novel challenges in the format.&lt;/li&gt;&#xA;&lt;li&gt;They are not easy to find using an existing combination of tags. (The titles are pretty formulaic, but hard to search and there is at least one example of a challenge in the group which does not use the format.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;So then:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is there a good reason not to make this tag?&lt;/li&gt;&#xA;&lt;li&gt;What should the criteria for this tag be? i.e. what should the tag wiki say?&lt;/li&gt;&#xA;&lt;li&gt;What is a good name for this tag?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="58563" LastEditDate="2023-10-10T12:43:18.050" LastActivityDate="2023-10-10T12:43:18.050" Title="Do we need an &quot;I f the sourcecode, you f the input&quot; tag?" Tags="|discussion|tags|" AnswerCount="1" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26050" PostTypeId="2" ParentId="2140" CreationDate="2023-09-30T16:34:30.830" Score="1" Body="&lt;h1&gt;Golf my code&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr/&gt;&#xA;&lt;p&gt;For this challenge, I'll use edit histories of answers to create a dataset of answers that have been golfed. Your task will be to write a program/function that, given a submission that was golfed in the future, will attempt to golf the submission.&lt;/p&gt;&#xA;&lt;p&gt;You may choose the language, out of a set I'll choose based on the quantity and quality of data available, that your inputs will be in. You may choose to take inputs from multiple languages, which will not be differentiated (e.g., you can choose to score your answer over a combined Python + Jelly dataset).&lt;/p&gt;&#xA;&lt;p&gt;The first part of your score will be the sum of bytes golfed by your program for each input, with any submissions that don't become shorter (including becoming longer) or become invalid having no impact on your score (might change this later, since otherwise you have no reason not to use a dataset of all languages).&lt;/p&gt;&#xA;&lt;p&gt;Your final score will be your score, minus the number of bytes in your program. So, if you golf a total of 1920 bytes off the Python answers dataset, with 1080 bytes of code, your final score will be 840. Higher scores are better.&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2023-09-30T16:34:30.830" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26051" PostTypeId="2" ParentId="26049" CreationDate="2023-10-01T15:10:53.067" Score="16" Body="&lt;h1&gt;Yes&lt;/h1&gt;&#xA;&lt;p&gt;It makes sense to have a tag for this kind of challenge, since there are so many of them, they share a common challenge aspect, and the aspect is unique from other kinds of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-source-layout-tooltip-container&quot;&gt;source-layout&lt;/a&gt; challenges. I propose &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-transformation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-transformation&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;source-transformation&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-source-transformation-tooltip-container&quot;&gt;source-transformation&lt;/a&gt;, since the challenge is about transforming the source.&lt;/p&gt;&#xA;" OwnerUserId="108687" LastActivityDate="2023-10-01T15:10:53.067" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26052" PostTypeId="2" ParentId="2140" CreationDate="2023-10-01T17:43:30.860" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/265797/108687&quot;&gt;Output greater than without the previous character&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108687" LastEditorUserId="108687" LastEditDate="2023-10-05T16:21:04.267" LastActivityDate="2023-10-05T16:21:04.267" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="26053" PostTypeId="2" ParentId="2140" CreationDate="2023-10-02T00:05:22.037" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/265699/complement-an-infinite-list&quot;&gt;Complement an infinite list&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2023-10-03T08:15:43.793" LastActivityDate="2023-10-03T08:15:43.793" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26055" PostTypeId="2" ParentId="2140" CreationDate="2023-10-02T07:37:36.760" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/265768/transpose-a-multidimensional-array&quot;&gt;Transpose a multidimensional array&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2023-10-05T03:59:49.817" LastActivityDate="2023-10-05T03:59:49.817" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26057" PostTypeId="2" ParentId="26030" CreationDate="2023-10-02T10:21:22.583" Score="0" Body="&lt;h1&gt;Why not simply boycott what you dislike?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;strong&gt;As for me, compressed scores are no fun.&lt;/strong&gt; Code golfing was always about the size of &lt;em&gt;source code&lt;/em&gt;, and nobody writes compressed code. You could do that with any programming language (achieving a far better compression ratio for most), but nobody ever did it, because it adds some randomness to the challenge: A better golfed version in terms of shorter source code can be overtaken by lazy code, which happens to compress better.&lt;/p&gt;&#xA;&lt;p&gt;On the other hand, it's difficult to forbid that. Where is an exact border between compression and some other golfing language tricks? Those rely to a certain degree on commands that can to some extend be seen as a couple of instructions &amp;quot;compressed&amp;quot; into a single byte. I still like it because you can do clever golfing tricks with them.&lt;/p&gt;&#xA;&lt;p&gt;For myself, I decided &lt;strong&gt;not to upvote&lt;/strong&gt; answers like that. For answers to my own questions with cleverly golfed source, but compression flag, I plan to comment that I will upvote the uncompressed version (unless the author can explain some brilliant ideas how this was designed for better compressability – unlikely to happen).&lt;/p&gt;&#xA;&lt;p&gt;I invite you to join this way to handle it. &lt;strong&gt;Don't cheer a doped athlete.&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="72726" LastActivityDate="2023-10-02T10:21:22.583" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="26058" PostTypeId="2" ParentId="2140" CreationDate="2023-10-02T10:55:52.817" Score="-5" Body="&lt;h2&gt;Thoughts on a scoring system that levels the playing field between golfing languages and common languages.&lt;/h2&gt;&#xA;&lt;p&gt;Divide the byte length of a program by a &amp;quot;popularity&amp;quot; metric e.g.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Wikipedia page views in the last 30 days (or esolangs.org)&lt;/li&gt;&#xA;&lt;li&gt;Wikipedia edits&lt;/li&gt;&#xA;&lt;li&gt;questions on Stack Overflow tagged with that language&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Idea would be to encourage golfing in languages used day to day rather than the languages written purely for the purpose of golfing.&lt;/p&gt;&#xA;&lt;h3&gt;Pros&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Code Golf questions often reach the &amp;quot;Hot network questions&amp;quot; sidebar but then new/unfamiliar users are met with incomprehensible code, this could reduce that&lt;/li&gt;&#xA;&lt;li&gt;encourage new users to attempt an answer&lt;/li&gt;&#xA;&lt;li&gt;whilst users are encouraged to compete with others in the same language, the overall winner normally gets the accepted answer, this could help that&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Cons&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;this is Code Golf, so least bytes is the goal!&lt;/li&gt;&#xA;&lt;li&gt;people have put immense effort into creating the golfing languages and that shouldn't be punished&lt;/li&gt;&#xA;&lt;li&gt;finding/creating a &amp;quot;good&amp;quot; popularity metric is probably going to be a lot of work&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Case studies&lt;/h2&gt;&#xA;&lt;p&gt;Rescoring &lt;a href=&quot;https://codegolf.stackexchange.com/questions/123685/covfefify-a-string&quot;&gt;Covfefify a string&lt;/a&gt; by dividing the length by * wikipedia (or eslangs.org if no wiki page) number of edits * 1000. Then rounded down.&lt;/p&gt;&#xA;&lt;p&gt;Lang - OG score - Edits - New score&lt;/p&gt;&#xA;&lt;p&gt;Jelly - 57 - 9 - 6333&lt;/p&gt;&#xA;&lt;p&gt;JavaScript - 103 - 7695 - 13&lt;/p&gt;&#xA;&lt;p&gt;Jelly - 39 - 9 - 4333&lt;/p&gt;&#xA;&lt;p&gt;C - 175 - 8659 - 20&lt;/p&gt;&#xA;&lt;p&gt;CJam - 56 - 9 - 6222&lt;/p&gt;&#xA;&lt;p&gt;Perl 5 (Perl) - 71 - 4133 - 17&lt;/p&gt;&#xA;&lt;p&gt;PHP - 121 - 11287 - 10&lt;/p&gt;&#xA;&lt;p&gt;Pyth - 54 - 22 - 2454&lt;/p&gt;&#xA;&lt;p&gt;Python 3 (Python) - 139 - 8850 - 15&lt;/p&gt;&#xA;&lt;p&gt;Java 8 (Java) - 222 - 8978 - 24&lt;/p&gt;&#xA;&lt;p&gt;Haskell - 136 - 2089 - 65&lt;/p&gt;&#xA;&lt;p&gt;Ruby - 90 - 2936 - 30&lt;/p&gt;&#xA;&lt;h4&gt;Results in a HTML table&lt;/h4&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-html lang-html prettyprint-override&quot;&gt;&lt;code&gt;&amp;lt;google-sheets-html-origin style=&quot;color: rgb(0, 0, 0);&quot;&amp;gt;&amp;lt;table xmlns=&quot;http://www.w3.org/1999/xhtml&quot; cellspacing=&quot;0&quot; cellpadding=&quot;0&quot; dir=&quot;ltr&quot; border=&quot;1&quot; style=&quot;table-layout: fixed; font-size: 10pt; font-family: Arial; width: 0px; border-collapse: collapse; border: none;&quot;&amp;gt;&#xA;  &amp;lt;thead&amp;gt;&#xA;    &amp;lt;tr style=&quot;height: 21px;&quot;&amp;gt;&#xA;      &amp;lt;th&amp;gt;Lang&amp;lt;/th&amp;gt;&#xA;      &amp;lt;th&amp;gt;OG score&amp;lt;/th&amp;gt;&#xA;      &amp;lt;th&amp;gt;Edits&amp;lt;/th&amp;gt;&#xA;      &amp;lt;th&amp;gt;New score&amp;lt;/th&amp;gt;&#xA;      &amp;lt;th&amp;gt;Log(edits) score&amp;lt;/th&amp;gt;&#xA;    &amp;lt;/tr&amp;gt;&#xA;  &amp;lt;/thead&amp;gt;&amp;lt;colgroup&amp;gt;&amp;lt;col width=&quot;100&quot;&amp;gt;&amp;lt;col width=&quot;100&quot;&amp;gt;&amp;lt;col width=&quot;100&quot;&amp;gt;&amp;lt;col width=&quot;100&quot;&amp;gt;&amp;lt;col width=&quot;100&quot;&amp;gt;&amp;lt;/colgroup&amp;gt;&#xA;  &amp;lt;tbody&amp;gt;&#xA;    &amp;lt;tr style=&quot;height: 21px;&quot;&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;Jelly&amp;amp;quot;}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;&quot;&amp;gt;Jelly&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:57}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;57&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:9}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;9&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:6333.333333333333}&quot; data-sheets-numberformat=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;0&amp;amp;quot;,&amp;amp;quot;3&amp;amp;quot;:1}&quot; data-sheets-formula=&quot;=R[0]C[-2]/R[0]C[-1]*1000&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;6333&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:59.733243317247464}&quot; data-sheets-formula=&quot;=R[0]C[-3]/LOG(R[0]C[-2])&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;59.73324332&amp;lt;/td&amp;gt;&#xA;    &amp;lt;/tr&amp;gt;&#xA;    &amp;lt;tr style=&quot;height: 21px;&quot;&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;JavaScript&amp;amp;quot;}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;&quot;&amp;gt;JavaScript&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:103}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;103&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:7695}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;7695&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:13.385315139701104}&quot; data-sheets-numberformat=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;0&amp;amp;quot;,&amp;amp;quot;3&amp;amp;quot;:1}&quot; data-sheets-formula=&quot;=R[0]C[-2]/R[0]C[-1]*1000&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;13&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:26.50398111914659}&quot; data-sheets-formula=&quot;=R[0]C[-3]/LOG(R[0]C[-2])&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;26.50398112&amp;lt;/td&amp;gt;&#xA;    &amp;lt;/tr&amp;gt;&#xA;    &amp;lt;tr style=&quot;height: 21px;&quot;&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;Jelly&amp;amp;quot;}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;&quot;&amp;gt;Jelly&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:39}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;39&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:9}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;9&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:4333.333333333333}&quot; data-sheets-numberformat=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;0&amp;amp;quot;,&amp;amp;quot;3&amp;amp;quot;:1}&quot; data-sheets-formula=&quot;=R[0]C[-2]/R[0]C[-1]*1000&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;4333&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:40.870113848643}&quot; data-sheets-formula=&quot;=R[0]C[-3]/LOG(R[0]C[-2])&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;40.87011385&amp;lt;/td&amp;gt;&#xA;    &amp;lt;/tr&amp;gt;&#xA;    &amp;lt;tr style=&quot;height: 21px;&quot;&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;C&amp;amp;quot;}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;&quot;&amp;gt;C&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:175}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;175&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:8659}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;8659&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:20.21018593371059}&quot; data-sheets-numberformat=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;0&amp;amp;quot;,&amp;amp;quot;3&amp;amp;quot;:1}&quot; data-sheets-formula=&quot;=R[0]C[-2]/R[0]C[-1]*1000&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;20&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:44.44480858549206}&quot; data-sheets-formula=&quot;=R[0]C[-3]/LOG(R[0]C[-2])&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;44.44480859&amp;lt;/td&amp;gt;&#xA;    &amp;lt;/tr&amp;gt;&#xA;    &amp;lt;tr style=&quot;height: 21px;&quot;&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;CJam&amp;amp;quot;}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;&quot;&amp;gt;CJam&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:56}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;56&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:9}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;9&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:6222.222222222223}&quot; data-sheets-numberformat=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;0&amp;amp;quot;,&amp;amp;quot;3&amp;amp;quot;:1}&quot; data-sheets-formula=&quot;=R[0]C[-2]/R[0]C[-1]*1000&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;6222&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:58.68529168010277}&quot; data-sheets-formula=&quot;=R[0]C[-3]/LOG(R[0]C[-2])&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;58.68529168&amp;lt;/td&amp;gt;&#xA;    &amp;lt;/tr&amp;gt;&#xA;    &amp;lt;tr style=&quot;height: 21px;&quot;&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;Perl 5 (Perl)&amp;amp;quot;}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;&quot;&amp;gt;Perl 5 (Perl)&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:71}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;71&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:4133}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;4133&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:17.17880474231793}&quot; data-sheets-numberformat=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;0&amp;amp;quot;,&amp;amp;quot;3&amp;amp;quot;:1}&quot; data-sheets-formula=&quot;=R[0]C[-2]/R[0]C[-1]*1000&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;17&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:19.633514701742165}&quot; data-sheets-formula=&quot;=R[0]C[-3]/LOG(R[0]C[-2])&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;19.6335147&amp;lt;/td&amp;gt;&#xA;    &amp;lt;/tr&amp;gt;&#xA;    &amp;lt;tr style=&quot;height: 21px;&quot;&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;PHP&amp;amp;quot;}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;&quot;&amp;gt;PHP&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:121}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;121&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:11287}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;11287&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:10.720297687605209}&quot; data-sheets-numberformat=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;0&amp;amp;quot;,&amp;amp;quot;3&amp;amp;quot;:1}&quot; data-sheets-formula=&quot;=R[0]C[-2]/R[0]C[-1]*1000&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;11&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:29.857533728767567}&quot; data-sheets-formula=&quot;=R[0]C[-3]/LOG(R[0]C[-2])&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;29.85753373&amp;lt;/td&amp;gt;&#xA;    &amp;lt;/tr&amp;gt;&#xA;    &amp;lt;tr style=&quot;height: 21px;&quot;&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;Pyth&amp;amp;quot;}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;&quot;&amp;gt;Pyth&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:54}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;54&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:22}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;22&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:2454.5454545454545}&quot; data-sheets-numberformat=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;0&amp;amp;quot;,&amp;amp;quot;3&amp;amp;quot;:1}&quot; data-sheets-formula=&quot;=R[0]C[-2]/R[0]C[-1]*1000&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;2455&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:40.22578042776074}&quot; data-sheets-formula=&quot;=R[0]C[-3]/LOG(R[0]C[-2])&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;40.22578043&amp;lt;/td&amp;gt;&#xA;    &amp;lt;/tr&amp;gt;&#xA;    &amp;lt;tr style=&quot;height: 21px;&quot;&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;Python 3 (Python)&amp;amp;quot;}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;&quot;&amp;gt;Python 3 (Python)&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:139}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;139&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:8850}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;8850&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:15.706214689265536}&quot; data-sheets-numberformat=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;0&amp;amp;quot;,&amp;amp;quot;3&amp;amp;quot;:1}&quot; data-sheets-formula=&quot;=R[0]C[-2]/R[0]C[-1]*1000&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;16&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:35.21712638535709}&quot; data-sheets-formula=&quot;=R[0]C[-3]/LOG(R[0]C[-2])&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;35.21712639&amp;lt;/td&amp;gt;&#xA;    &amp;lt;/tr&amp;gt;&#xA;    &amp;lt;tr style=&quot;height: 21px;&quot;&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;Java 8 (Java)&amp;amp;quot;}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;&quot;&amp;gt;Java 8 (Java)&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:222}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;222&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:8978}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;8978&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:24.72711071508131}&quot; data-sheets-numberformat=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;0&amp;amp;quot;,&amp;amp;quot;3&amp;amp;quot;:1}&quot; data-sheets-formula=&quot;=R[0]C[-2]/R[0]C[-1]*1000&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;25&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:56.157327114648886}&quot; data-sheets-formula=&quot;=R[0]C[-3]/LOG(R[0]C[-2])&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;56.15732711&amp;lt;/td&amp;gt;&#xA;    &amp;lt;/tr&amp;gt;&#xA;    &amp;lt;tr style=&quot;height: 21px;&quot;&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;Haskell&amp;amp;quot;}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;&quot;&amp;gt;Haskell&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:136}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;136&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:2089}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;2089&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:65.10292005744375}&quot; data-sheets-numberformat=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;0&amp;amp;quot;,&amp;amp;quot;3&amp;amp;quot;:1}&quot; data-sheets-formula=&quot;=R[0]C[-2]/R[0]C[-1]*1000&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;65&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:40.96461499473064}&quot; data-sheets-formula=&quot;=R[0]C[-3]/LOG(R[0]C[-2])&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;40.96461499&amp;lt;/td&amp;gt;&#xA;    &amp;lt;/tr&amp;gt;&#xA;    &amp;lt;tr style=&quot;height: 21px;&quot;&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;Ruby&amp;amp;quot;}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;&quot;&amp;gt;Ruby&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:90}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;90&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:2936}&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;2936&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:30.653950953678475}&quot; data-sheets-numberformat=&quot;{&amp;amp;quot;1&amp;amp;quot;:2,&amp;amp;quot;2&amp;amp;quot;:&amp;amp;quot;0&amp;amp;quot;,&amp;amp;quot;3&amp;amp;quot;:1}&quot; data-sheets-formula=&quot;=R[0]C[-2]/R[0]C[-1]*1000&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;31&amp;lt;/td&amp;gt;&#xA;      &amp;lt;td data-sheets-value=&quot;{&amp;amp;quot;1&amp;amp;quot;:3,&amp;amp;quot;3&amp;amp;quot;:25.953382726479024}&quot; data-sheets-formula=&quot;=R[0]C[-3]/LOG(R[0]C[-2])&quot; style=&quot;border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;&quot;&amp;gt;25.95338273&amp;lt;/td&amp;gt;&#xA;    &amp;lt;/tr&amp;gt;&#xA;  &amp;lt;/tbody&amp;gt;&#xA;&amp;lt;/table&amp;gt;&amp;lt;/google-sheets-html-origin&amp;gt;&lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;&lt;p&gt;Just using the number of edits makes the golfing languages irrelevant. The log(edits) brings everything into quite a nice grouping.&lt;/p&gt;&#xA;" OwnerUserId="63404" LastEditorUserId="63404" LastEditDate="2023-10-02T11:00:53.347" LastActivityDate="2023-10-02T11:00:53.347" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26059" PostTypeId="2" ParentId="2140" CreationDate="2023-10-02T12:38:37.370" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/269006/72726&quot;&gt;Forward foo, reverse bar, but avoid dead code&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="72726" LastEditorUserId="72726" LastEditDate="2024-01-05T11:35:49.377" LastActivityDate="2024-01-05T11:35:49.377" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="26060" PostTypeId="2" ParentId="2140" CreationDate="2023-10-02T17:15:03.870" Score="3" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-compression-tooltip-container&quot;&gt;compression&lt;/a&gt;? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-decision-problem-tooltip-container&quot;&gt;decision-problem&lt;/a&gt;? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-challenge-tooltip-container&quot;&gt;code-challenge&lt;/a&gt;?&lt;/p&gt;&#xA;&lt;h2&gt;Golfy Fairy Chess Notation + Validation&lt;/h2&gt;&#xA;&lt;h3&gt;Step 1:&lt;/h3&gt;&#xA;&lt;p&gt;Design an encoding for fairy chess piece movement which encodes all of the following information:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Where a piece can move (INCLUDING arbitrary length movement)*&lt;/li&gt;&#xA;&lt;li&gt;Whether those movements are &amp;quot;jumping&amp;quot; or not&lt;/li&gt;&#xA;&lt;li&gt;Whether those movements are &amp;quot;capturing&amp;quot; or not**&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You don't need to handle non-moving, royalty, special case movement (such as first move double-movement), or any other special stuff like that.&lt;/p&gt;&#xA;&lt;h3&gt;Step 2:&lt;/h3&gt;&#xA;&lt;p&gt;Write a program which, when given (A):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a chess position***&lt;/li&gt;&#xA;&lt;li&gt;a starting square&lt;/li&gt;&#xA;&lt;li&gt;an ending square&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;all in any reasonable format of your choice, as well as (B):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a description of a fairy chess piece's movement capabilities&#xA;in the notation you designed in step 1&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;will output whether the movement on the board (A) is valid for that fairy chess piece (B)&lt;/p&gt;&#xA;&lt;h3&gt;Additional spec clarification&lt;/h3&gt;&#xA;&lt;p&gt;You may assume&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All pieces other than the piece being moved are pawns&lt;/li&gt;&#xA;&lt;li&gt;The fairy chess piece is the piece that will be moved&lt;/li&gt;&#xA;&lt;li&gt;The fairy chess piece movement will be defined such that it could theoretically make a move, given the right board arrangement (i.e. no 'non-movers')&lt;/li&gt;&#xA;&lt;li&gt;Movement will be entirely within the board&lt;/li&gt;&#xA;&lt;li&gt;Board will be square and at least 2x2 in size&lt;/li&gt;&#xA;&lt;li&gt;Piece will not attempt to capture its own teammates&lt;/li&gt;&#xA;&lt;li&gt;Piece will not attempt to move to its own square, and you don't need to worry about whether the notation implies it should/shouldn't be able to.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may &lt;em&gt;not&lt;/em&gt; assume an 8x8 board.&lt;/p&gt;&#xA;&lt;h3&gt;Scoring:****&lt;/h3&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$(\text{bytes in program})\times(\text{average bytes to represent each piece in (list of fairy chess pieces which will be provided)})\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Lowest score wins&lt;/p&gt;&#xA;&lt;p&gt;Optional challenge: try and make the format human legible! :-)&lt;/p&gt;&#xA;&lt;h3&gt;META:&lt;/h3&gt;&#xA;&lt;p&gt;*I will be sure to clarify in the question body how exactly this works; but basically i want to be able to include things like rook/bishop/queen/knightrider without having to assume a maximum movement distance&lt;/p&gt;&#xA;&lt;p&gt;**I'll also be clear that pieces can only capture at the &lt;em&gt;end&lt;/em&gt; of their move, so no multicapture or capture and then move / en passant nonsense :P&lt;/p&gt;&#xA;&lt;p&gt;***I don't know how to explain, but this doesnt have to include which pieces are what. just where the pieces are and whether each piece is on your team or not, or something similarly simple&lt;/p&gt;&#xA;&lt;p&gt;****Ideally, score would be based on both short notation as well as a short decoding program, but I'm not sure the exact balance yet. feel free to tell me this is a bad idea / throw your algo of choice at me, but i'll be studying other compression challenges as well&lt;/p&gt;&#xA;" OwnerUserId="107310" LastEditorUserId="107310" LastEditDate="2023-10-07T07:30:09.573" LastActivityDate="2023-10-07T07:30:09.573" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26061" PostTypeId="2" ParentId="2140" CreationDate="2023-10-03T03:47:55.880" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/265949/visualise-the-euclidean-gcd&quot;&gt;Visualise the Euclidean GCD&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2023-10-12T21:37:13.107" LastActivityDate="2023-10-12T21:37:13.107" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26062" PostTypeId="2" ParentId="2140" CreationDate="2023-10-03T23:34:02.783" Score="2" Body="&lt;h1&gt;Is this your answer? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-answer-chaining-tooltip-container&quot;&gt;answer-chaining&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;NOTE: The scoring criterion for this is currently broken. I'll fix it at some point ™&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;In this challenge, you must write an answer that distinguishes itself from all previous answers. No matter what input is passed in, it must output one of two consistent values. Your answer must output one value, marked as &amp;quot;truthy&amp;quot;, when your answer's code is input, and the other value, marked as &amp;quot;falsy&amp;quot;, when the code of at least one previous answer is input. Whichever value it outputs when anything else is input does not matter as long as it outputs one of the two values.&lt;/p&gt;&#xA;&lt;p&gt;However, you are not only trying to distinguish your answer from others, but also to trick previous answers into thinking your source code is their own and outputting their truthy value.&lt;/p&gt;&#xA;&lt;p&gt;Your answer's score is &lt;span class=&quot;math-container&quot;&gt;\$\frac{\text{byte count} + 2}{\text{tricked answers } \cdot \text{ answers that don't trick you}}\$&lt;/span&gt;, where &amp;quot;tricked answers&amp;quot; is the number of previous answers that output their truthy value when given your code, and &amp;quot;answers that don't trick you&amp;quot; is the number of previous answers for which your answer correctly returns the falsy value. Your answer must trick at least one previous answer and not be tricked by at least one previous answer.&lt;/p&gt;&#xA;&lt;p&gt;For example, if the first answer was the Python program &lt;code&gt;print(1)&lt;/code&gt;, then a valid second answer would be the JavaScript function &lt;code&gt;x=&amp;gt;x.includes('x')&lt;/code&gt;, which checks if the input string contains a &lt;code&gt;x&lt;/code&gt;, returning true for itself, false for the singlee previous answer, and either true or false for any input string. As the previous answer prints a 1 when given this code, this would score &lt;span class=&quot;math-container&quot;&gt;\$\frac{18+2}{1 \cdot 1} = 20\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;First answer (will be posted along with the question):&lt;/p&gt;&#xA;&lt;h1&gt;1: &lt;a href=&quot;https://docs.python.org/3/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Python 3&lt;/a&gt;, 8 bytes&lt;/h1&gt;&#xA;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;print(1)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##K6gsycjPM/7/v6AoM69Ew1Dz/38A&quot; rel=&quot;nofollow noreferrer&quot; title=&quot;Python 3 – Try It Online&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Outputs 1 for truthy and 0 for falsy.&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2023-10-12T21:38:29.527" LastActivityDate="2023-10-12T21:38:29.527" CommentCount="14" ContentLicense="CC BY-SA 4.0" />
  <row Id="26063" PostTypeId="2" ParentId="2140" CreationDate="2023-10-04T10:32:50.470" Score="1" Body="&lt;h1&gt;Is it a stable structure? &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/ascii-art&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;ascii-art&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-ascii-art-tooltip-container&quot;&gt;ascii-art&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;In this challenge, a structure is a combination of row of &lt;code&gt;----&lt;/code&gt; and columns of &lt;code&gt;|&lt;/code&gt;, such that all rows are above at least one column and all columns are on top of either a row or the ground. Additionally, a structure must have all its component rows or columns connected vertically.&lt;/p&gt;&#xA;&lt;p&gt;For example, the following are structures:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;          ---      -----      -----&#xA;     |     |        |  |      | | |&#xA;|    ---   |----    -- -----  |---|&#xA;|     |    |   |    |  |   |  | | |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;And the following are not:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;|             |                     |&#xA;     --    ---|   ---- ---          |-----&#xA;|   |  |    | |   |      |     ---  || |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The last two are not structures because, although they satisfy all the other rules, they contain multiple vertically connected parts - specifically, the end of a &lt;code&gt;-&lt;/code&gt; cannot connect with the side of a &lt;code&gt;|&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;A single row of &lt;code&gt;-&lt;/code&gt;s can have multiple &lt;code&gt;|&lt;/code&gt;s under it. That row is &lt;em&gt;stable&lt;/em&gt; if the center of the row occurs within the span of the &lt;code&gt;|&lt;/code&gt;s. For example, take this row:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;---X---&#xA; |  ||&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The center of that row is the position marked X, and as this falls within the outer two &lt;code&gt;|&lt;/code&gt;, the row is stable.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;---XX---     ---XX---&#xA;   |||          |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You can also have rows with even length, in which case both central positions have to fall within the span of the columns. The first example here is stable, the second is not.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;---X---&#xA;   |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Rows can even be balanced on a single &lt;code&gt;|&lt;/code&gt; as long as their center is on that &lt;code&gt;|&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;A structure is stable if every row of &lt;code&gt;----&lt;/code&gt; in it is stable by the above criteria.&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to, given a valid ascii-art structure by the criterion above, determine whether it is stable or not.&lt;/p&gt;&#xA;&lt;p&gt;Output may either be truthy/falsy using your language's convention (swapping is allowed) or outputting two distinct values for truthy/falsy.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, shortest wins!&lt;/p&gt;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&lt;p&gt;Truthy&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;|&#xA;&#xA;-&#xA;|&#xA;&#xA;---&#xA;| |&#xA;&#xA;  ---&#xA;  | |&#xA;--- ---&#xA; ||  |&#xA;&#xA;-----&#xA; | ||&#xA; |---&#xA; | |&#xA;&#xA;|&#xA;---------&#xA; | |    |&#xA;&#xA;&#xA;   -------&#xA;   |  |&#xA;  ------&#xA;  | |  |&#xA;-----  |&#xA;|  |   |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Falsy&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;--&#xA;|&#xA;&#xA;--------&#xA;   |&#xA;&#xA;------&#xA;| |&#xA;------&#xA; |  |&#xA;&#xA;  ---&#xA;    |&#xA;---------&#xA;    |&#xA;&#xA;&#xA;------------------&#xA; | | |&#xA;&#xA;-------------&#xA;|           |&#xA;------ ------&#xA;|           |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="100664" LastActivityDate="2023-10-04T10:32:50.470" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26064" PostTypeId="2" ParentId="2140" CreationDate="2023-10-05T08:29:08.230" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/265852/golf-a-late%ce%a7-math-expression&quot;&gt;Golf a LaTeΧ math expression&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-string-tooltip-container&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parsing&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;parsing&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-parsing-tooltip-container&quot;&gt;parsing&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2023-10-08T04:39:12.597" LastActivityDate="2023-10-08T04:39:12.597" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26066" PostTypeId="2" ParentId="2140" CreationDate="2023-10-05T21:33:01.287" Score="-1" Body="&lt;h1&gt;Optimal Span for Multiple Byte Ranges [Draft]&lt;/h1&gt;&#xA;&lt;p&gt;I recently ran into the following challenge, you have a list of common crawl URL indexes that have the setup below. Each of the GZ files are ~1.2GB, the challenge would be to design the most efficient solution that can respond with the decrypted byte span. If this if of interest, I'll revise this to flush out more details.&lt;/p&gt;&#xA;&lt;p&gt;In the real world, some considerations are:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Cache vs HTTP fetch byte range&lt;/li&gt;&#xA;&lt;li&gt;Minimizing number of requests by making requests spanning multiple offsets&lt;/li&gt;&#xA;&lt;li&gt;Decrypting entire file for multiple offsets vs decrypting offsets individually&lt;/li&gt;&#xA;&lt;li&gt;Trade off between # of connections, download time, local storage space, decryption time&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;FileName.gz&lt;/th&gt;&#xA;&lt;th&gt;Offset&lt;/th&gt;&#xA;&lt;th&gt;Length&lt;/th&gt;&#xA;&lt;th&gt;CONTENT_DIGEST&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;crawl-data/CC-MAIN-2023-23/segments/1685224648465.70/warc/CC-MAIN-20230602072202-20230602102202-00011.warc.gz&lt;/td&gt;&#xA;&lt;td&gt;755688583&lt;/td&gt;&#xA;&lt;td&gt;1327&lt;/td&gt;&#xA;&lt;td&gt;123456789&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;crawl-data/CC-MAIN-2023-23/segments/1685224648465.70/warc/CC-MAIN-20230602072202-20230602102202-00011.warc.gz&lt;/td&gt;&#xA;&lt;td&gt;86276364&lt;/td&gt;&#xA;&lt;td&gt;3404&lt;/td&gt;&#xA;&lt;td&gt;ABCDEFGHI&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;crawl-data/CC-MAIN-2023-23/segments/1685224648465.70/warc/CC-MAIN-20230602072202-20230602102202-00011.warc.gz&lt;/td&gt;&#xA;&lt;td&gt;963176585&lt;/td&gt;&#xA;&lt;td&gt;1294&lt;/td&gt;&#xA;&lt;td&gt;987654321&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;" OwnerUserId="119879" LastEditorUserId="91213" LastEditDate="2023-10-07T15:43:44.103" LastActivityDate="2023-10-07T15:43:44.103" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26068" PostTypeId="2" ParentId="2140" CreationDate="2023-10-07T12:45:19.323" Score="1" Body="&lt;h1&gt;Compile Japt to JavaScript&lt;/h1&gt;&#xA;&lt;h1&gt;&lt;em&gt;this is a work in progress challenge! the spec is not finished&lt;/em&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/parser&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;parser&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;parser&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-parser-tooltip-container&quot;&gt;parser&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;[Japt] is a programming language designed by [@ETHProductions] in 2017 designed as a code-golf version of JavaScript (from which its name is derived; &lt;strong&gt;Ja&lt;/strong&gt;vaScri&lt;strong&gt;pt&lt;/strong&gt; → Japt). Code written in Japt is compiled to JS code. This challenge is about code-golfing that compilation process.&lt;/p&gt;&#xA;&lt;p&gt;For this challenge, we will be using a slightly simplified version of Japt that does not support compressed string literals, shortcuts, or &lt;code&gt;ß&lt;/code&gt; for recursion. This version of Japt also lacks &lt;a href=&quot;https://codegolf.stackexchange.com/a/118064/108687&quot;&gt;the semi-famous bug&lt;/a&gt; that unterminated array literals make the parser break.&lt;/p&gt;&#xA;&lt;h2&gt;Japt syntax&lt;/h2&gt;&#xA;&lt;p&gt;Japt programs consist of a series of chained function calls (like the JavaScript &lt;code&gt;something.a(1).b(2).c(3)&lt;/code&gt;). In Japt, these are written as follows:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a1 b2 c3 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Each lowercase letter tells the parser to start reading arguments, and each space tells it to stop and call the function with those arguments. Here's what passing multiple arguments to functions looks like:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a1,2 b3,4,5 c6 &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Japt programs don't just consist of lowercase letters, digits, and spaces. Japt has syntax for four kinds of literals:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Numbers, like &lt;code&gt;1234&lt;/code&gt; or &lt;code&gt;1.23&lt;/code&gt; or &lt;code&gt;0.7&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Strings, like &lt;code&gt;&amp;quot;abcd&amp;quot;&lt;/code&gt; or &lt;code&gt;&amp;quot;player 1 has {U} points&amp;quot;&lt;/code&gt; (interpolation)&lt;/li&gt;&#xA;&lt;li&gt;Arrays, like &lt;code&gt;[1,2,3]&lt;/code&gt; or &lt;code&gt;[1,&amp;quot;a&amp;quot;,[&amp;quot;b&amp;quot;,&amp;quot;c&amp;quot;,[2]],&amp;quot;d&amp;quot;]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Functions, like &lt;code&gt;X{X+1}&lt;/code&gt; or &lt;code&gt;XYZ{XaY b5 +Z}&lt;/code&gt; (uppercase letters are parameter names, brackets surround function body)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;An expression is made of one of the above literals, followed by any number (including zero) of chained function calls.&lt;/p&gt;&#xA;&lt;p&gt;Note that, when the either the program ends or the parser hits a newline, any unfinished literal or function call is automatically closed:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;mX{Xa&amp;quot;bcd&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;can still be parsed as calling &lt;code&gt;m&lt;/code&gt; with a function that takes &lt;code&gt;X&lt;/code&gt; and calls &lt;code&gt;a&lt;/code&gt; on it with argument &lt;code&gt;&amp;quot;bcd&amp;quot;&lt;/code&gt;, even though many structures are not fully&lt;/p&gt;&#xA;&lt;h2&gt;Compilation to JavaScript&lt;/h2&gt;&#xA;&lt;p&gt;Japt expressions translate pretty much one-to-one with JavaScript expressions. Many expressions can be translated slightly differently and have the same results, so for this challenge, any output that is equivalent to the JavaScript expression as explained here is OK output. For example, for &lt;code&gt;a1 b2 c3&lt;/code&gt; you may choose to output &lt;code&gt;U.a(1).b(2).c(3)&lt;/code&gt; or you might output &lt;code&gt;U.a(1 ).b((2)).c(3 )&lt;/code&gt; or similar.&lt;/p&gt;&#xA;&lt;p&gt;If a number literal is the first part of a chained function call, it must be either surrounded in parentheses (&lt;code&gt;1.5&lt;/code&gt; becomes &lt;code&gt;(1.5)&lt;/code&gt;) or have a trailing space (&lt;code&gt;1.5 &lt;/code&gt;). Your submission may choose either of these. You may also choose to have all numbers follow one of these conventions, not only&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;Japt:&#xA;a1 b2 c3&#xA;JavaScript:&#xA;U.a(1).b(2).c(3)&#xA;&#xA;Japt:&#xA;a1b2c3 d4  e5&#xA;JavaScript:&#xA;U.a(1 .b(2 .c(3).d(4)).e(5)&#xA;&#xA;Japt:&#xA;q| mZ{ùT+=Zl} ú mZ{Z+S+V&#xA;JavaScript:&#xA;U.q(&amp;quot;I&amp;quot;).m((Z)=&amp;gt;Z.ù(T+=Z.l())).ù().m((Z)=&amp;gt;Z+S+V)&#xA;&#xA;Japt:&#xA;1 +2 +3 +4&#xA;JavaScript:&#xA;(((1)+2)+3)+4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="108687" LastActivityDate="2023-10-07T12:45:19.323" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26072" PostTypeId="2" ParentId="2140" CreationDate="2023-10-10T08:37:07.943" Score="-5" Body="&lt;h1&gt;Obfuscated bananas&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;In this challenge, your task is to print the string &lt;code&gt;banana&lt;/code&gt;, case insensitive, to STDOUT (or an acceptable alternative) in the most obfuscated way.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;+1 VTC! No objective winning criterion!&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Wrong! &lt;em&gt;&lt;strong&gt;I now have an objective winning criterion!&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Let the reporter edit distance of &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; be the lowest number of operations on &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; required to have a consecutive subset of &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; equal to &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt;. For the reporter distance, you can only use these operations:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Add a character&lt;/li&gt;&#xA;&lt;li&gt;Remove a character&lt;/li&gt;&#xA;&lt;li&gt;Change a character&lt;/li&gt;&#xA;&lt;li&gt;Swap the positions of two characters&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Your score is the reporter distance of your source code and &lt;code&gt;banana&lt;/code&gt;, case insensitive, with a higher score being better.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-challenge-tooltip-container&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/underhanded&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;underhanded&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-underhanded-tooltip-container&quot;&gt;underhanded&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Unclear?&lt;/li&gt;&#xA;&lt;li&gt;More tags?&lt;/li&gt;&#xA;&lt;li&gt;Anything else?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="117478" LastEditorUserId="117478" LastEditDate="2023-10-10T09:13:59.117" LastActivityDate="2023-10-10T09:13:59.117" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26073" PostTypeId="2" ParentId="2140" CreationDate="2023-10-10T10:20:19.363" Score="6" Body="&lt;h2&gt;Minimum Escaping &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/open-ended-function&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;open-ended-function&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-open-ended-function-tooltip-container&quot;&gt;open-ended-function&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Your task is to write 2 functions/programs. They may share code.&lt;/p&gt;&#xA;&lt;p&gt;The first function must, given a string and a character, output a new string that does not contain that character.&lt;/p&gt;&#xA;&lt;p&gt;The second function must, given the string from the previous function and the excluded character, reconstruct the original string.&lt;/p&gt;&#xA;&lt;p&gt;All input strings will be ASCII printable, all output strings must be ASCII printable. You may choose to include or exclude whitespace.&lt;/p&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;One could try to use replace the character with an escape sequence. For example &lt;code&gt;\#bcda&lt;/code&gt; with excluded character becomes &lt;code&gt;\\#bcd\#&lt;/code&gt; then you'd know to replace &lt;code&gt;\#&lt;/code&gt; with whatever character is excluded. However, the excluded character might itself be &lt;code&gt;#&lt;/code&gt;  or &lt;code&gt;\&lt;/code&gt; so if one uses this method they'd need to be able to dynamically switch to a different escape sequence in that case.&lt;/p&gt;&#xA;&lt;p&gt;There is no length limit for the censored string so you could try to encode the entire string in unary, but be careful that the unary char you choose may not be the excluded char.&lt;/p&gt;&#xA;&lt;p&gt;This is code golf, shortest answer in each language wins. Brownie points for interesting solutions even if they are not the shortest though.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2023-10-10T10:20:19.363" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26074" PostTypeId="2" ParentId="2140" CreationDate="2023-10-15T01:41:37.520" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/266158/minecraft-xp-orb-amounts&quot;&gt;Minecraft XP Orb Amounts&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2023-10-22T21:05:46.180" LastActivityDate="2023-10-22T21:05:46.180" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26075" PostTypeId="2" ParentId="2140" CreationDate="2023-10-15T02:11:59.870" Score="3" Body="&lt;h1&gt;Make Code Printing X without X&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-generation&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-generation&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-generation&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-generation-tooltip-container&quot;&gt;code-generation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The challenge is simple: write a program which takes in some string &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; consisting of only uppercase and lowercase letters, and outputs the &lt;em&gt;code&lt;/em&gt; for a program (in the same language) which takes in no input and outputs &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;. However, the code your program generates &lt;em&gt;must not have any of the characters of &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;&lt;/em&gt;. For example, if your program was in Python, if the input was &lt;code&gt;&amp;quot;Lit&amp;quot;&lt;/code&gt;, your output could not be &lt;code&gt;print(&amp;quot;Lit&amp;quot;)&lt;/code&gt;, because that contains &lt;code&gt;L&lt;/code&gt;, &lt;code&gt;i&lt;/code&gt;, and &lt;code&gt;t&lt;/code&gt;. One valid output would be, for example, &lt;code&gt;x=lambda:'\114\151\164'&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Some notes:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Uppercase and lowercase characters are treated as distinct -- e.g. if the input string contains &lt;code&gt;A&lt;/code&gt;, your generated code can still contain the character &lt;code&gt;a&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Your generated code follows the same restrictions as a standard code golf answer -- e.g. it can be code which defines an anonymous function returning the string, but it cannot work by saving the string into a variable.&lt;/li&gt;&#xA;&lt;li&gt;Your submission is scored by the length of the &lt;em&gt;generating&lt;/em&gt; code, not the &lt;em&gt;generated&lt;/em&gt; code. In addition, there are no restrictions on the source of the generating program, only the generated.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Standard loopholes are forbidden. As this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, shortest program wins.&lt;/p&gt;&#xA;&lt;h2&gt;Questions&lt;/h2&gt;&#xA;&lt;p&gt;I don't know what to call this challenge.&lt;/p&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2023-10-15T03:57:31.420" LastActivityDate="2023-10-15T03:57:31.420" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26076" PostTypeId="2" ParentId="2140" CreationDate="2023-10-15T22:55:01.810" Score="0" Body="&lt;p&gt;This is my first time here, as this was originally a pure math question that I figured would be more likely to be answered on this site.&lt;/p&gt;&#xA;&lt;p&gt;Chaitin's incompleteness theorem states that for any theory whose axioms can be computed by a computer program (e.g. Peano arithmetic, ZFC, etc.), there exists a explicit number such that the theory cannot prove that any specific sequence of bits has Kolmogorov complexity larger than that number if the theory is consistent. That is, if the theory is consistent, one cannot prove in this theory that any program which computes this explicit sequence of bits must be of length at larger than this number.&lt;/p&gt;&#xA;&lt;p&gt;One doesn't really have to know too much about computation theory to do the golfing exercise - the proof of Chaitin's incompleteness comes from the computer program which computes the shortest proof that some explicit number has complexity larger than N. If N is larger then the length of this program, then one has a length at most N program which computes a number which provably cannot be computed by a program with length at most N.&lt;/p&gt;&#xA;&lt;p&gt;The task I am proposing is to design a Turing tarpit (which doesn't explicitly refer to Peano arithmetic) such that Peano arithmetic cannot prove that any output takes more than a N bit program to compute, for the smallest N. I'm pretty sure N cannot be more than a couple thousand bits, and it's probably the case that it's on the order of a couple hundred bits.&lt;/p&gt;&#xA;&lt;p&gt;(Note that Peano is implied by second order Peano, which can be formulated with a finite number of axioms, so you don't have to worry about making programs to generate all of the infinite axioms of Peano arithmetic)&lt;/p&gt;&#xA;" OwnerUserId="119971" LastActivityDate="2023-10-15T22:55:01.810" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="26077" PostTypeId="2" ParentId="2140" CreationDate="2023-10-16T09:35:54.457" Score="3" Body="&lt;h1&gt;Is it a valid crossword grid?&lt;/h1&gt;&#xA;&lt;p&gt;In crossword terminology, the grid is the region into which the crossword answers are inserted, consisting of white and black squares. The crossword answers, called entries, are inserted into contiguous sequences of white squares in a row or column, separated by black squares.&lt;/p&gt;&#xA;&lt;p&gt;For British (and Commonwealth) crosswords, the grids usually follow a specific set of rules:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;They should have 180 degree rotational symmetry (if there is a black&#xA;square in the xth row and yth column, there should be a black square&#xA;in the xth-to-last row and y th-to-last column).&lt;/li&gt;&#xA;&lt;li&gt;No entries may be exactly two squares long.&lt;/li&gt;&#xA;&lt;li&gt;All white squares must be joined in a single region.&lt;/li&gt;&#xA;&lt;li&gt;No row/column can be completely filled with black squares.&lt;/li&gt;&#xA;&lt;li&gt;Each two-by-two square must contain at least one white square.&lt;/li&gt;&#xA;&lt;li&gt;Each two-by-three rectangle must contain at least one black square.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For &lt;code&gt;n=3&lt;/code&gt; there is only one valid grid (I'm using &lt;code&gt;.&lt;/code&gt; for white squares and &lt;code&gt;#&lt;/code&gt; for black squares):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;...&#xA;.#.&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;For &lt;code&gt;n=4&lt;/code&gt; there are no valid grids, although British crosswords usually use odd &lt;code&gt;n&lt;/code&gt; anyway.&lt;/p&gt;&#xA;&lt;p&gt;Here are some examples of valid grids for &lt;code&gt;n=5&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;.....  .....  #.#.#  ###.#&#xA;.#.#.  .###.  .....  #....&#xA;.....  .....  #.#.#  #.#.#&#xA;.#.#.  .###.  .....  ....#&#xA;.....  .....  #.#.#  #.###&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here are two examples of valid grids for &lt;code&gt;n=6&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;......  ......&#xA;.##.#.  .##.#.&#xA;.#....  ....#.&#xA;....#.  .#....&#xA;.#.##.  .#.##.&#xA;......  ......&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input may be in the form of an array of any two byte-sized values and output can be any two distinct values of your choice or any of your language's truthy or falsy values respectively.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2023-10-16T09:35:54.457" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26078" PostTypeId="2" ParentId="2140" CreationDate="2023-10-16T13:25:09.560" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/266223/find-the-conflict-free-sitting-arrangement&quot;&gt;Moved to the main site&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="72726" LastEditorUserId="72726" LastEditDate="2023-10-25T17:55:21.487" LastActivityDate="2023-10-25T17:55:21.487" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26079" PostTypeId="2" ParentId="2140" CreationDate="2023-10-18T01:04:37.057" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/266185/expected-number-of-rounds-for-this-labeling-scheme&quot;&gt;Expected number of rounds for this labeling scheme&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96039" LastEditorUserId="96039" LastEditDate="2023-10-24T03:36:36.647" LastActivityDate="2023-10-24T03:36:36.647" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="26081" PostTypeId="1" CreationDate="2023-10-20T02:59:16.437" Score="0" ViewCount="124" Body="&lt;p&gt;Sorry if this is the wrong way to ask this...&lt;/p&gt;&#xA;&lt;p&gt;Many languages used here have characters outside the ASCII character set, yet the headlines of answers written in such languages often say &lt;strong&gt;&lt;em&gt;n&lt;/em&gt; bytes&lt;/strong&gt;, when in fact they comprise &lt;strong&gt;&lt;em&gt;n&lt;/em&gt; characters&lt;/strong&gt; that actually need substantially more &lt;em&gt;bytes&lt;/em&gt; to encode.&lt;/p&gt;&#xA;&lt;p&gt;I don't begrudge a win based on counting &lt;em&gt;characters&lt;/em&gt;, but labelling the smaller count as &lt;em&gt;bytes&lt;/em&gt; is misleading.&lt;/p&gt;&#xA;&lt;p&gt;Is there a site policy for this? If not, can one please be created?&lt;/p&gt;&#xA;&lt;p&gt;At minimum, if an answer is going to claim &amp;quot;bytes&amp;quot;, it should specify &lt;em&gt;which encoding and charset&lt;/em&gt; justifies its claim.&lt;/p&gt;&#xA;&lt;p&gt;Otherwise &amp;quot;bytes&amp;quot; should refer to a standard established by site policy; I suggest normalized UTF-8, but any fair encoding would be acceptable, including UCS-2.&lt;/p&gt;&#xA;&lt;p&gt;If there's a better forum to raise this, please let me know and I'll move the conversation there.&lt;/p&gt;&#xA;" OwnerUserId="114094" OwnerDisplayName="Martin Kealey" LastActivityDate="2023-10-20T03:06:09.433" Title="Meta question: counting bytes" Tags="|discussion|" AnswerCount="0" CommentCount="3" ClosedDate="2023-10-20T03:09:40.370" ContentLicense="CC BY-SA 4.0" />
  <row Id="26082" PostTypeId="2" ParentId="5878" CreationDate="2023-10-20T04:31:43.353" Score="-3" Body="&lt;h1&gt;Burden of demonstration&lt;/h1&gt;&#xA;&lt;p&gt;[edited]&lt;/p&gt;&#xA;&lt;p&gt;Allowing charsets that are actually accepted in practice seems entirely reasonable, with some variant of Unicode as a fallback.&lt;/p&gt;&#xA;&lt;p&gt;However I'm concerned that someone unfamiliar with the language in question may find it difficult to confirming the existence of a custom code page, or more importantly, to prove the non-existence of one.&lt;/p&gt;&#xA;&lt;p&gt;If a language has a more efficient encoding than UTF-8 or UCS-2, it would be help to at least &lt;em&gt;mention&lt;/em&gt; this in an answer, rather than assume that everyone else knows which encodings are accepted by some compiler or interpreter. (A link to a code page would be helpful but need not be a formal requirement.)&lt;/p&gt;&#xA;&lt;p&gt;This should be only a trivial impost on the claimant, compared with the effort by a reader to prove or disprove a tacit assumption of a codepage.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Why am I raising this?&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;I've recently noticed a few answers that consist almost entirely of &lt;em&gt;non&lt;/em&gt;-ASCII characters. For example in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/266049/how-many-umbrellas-to-cover-the-beach/266052?noredirect=1#comment580351_266052&quot;&gt;#266049 How many umbrellas to cover the beach?&lt;/a&gt; there are answers in Charcoal and 05AB1E claiming 26 and 13 bytes respectively.&lt;/p&gt;&#xA;&lt;p&gt;When I queried the byte count for the 05AB1E entry, there was a response that cited &lt;a href=&quot;https://github.com/Adriandmen/05AB1E/wiki/Codepage&quot; rel=&quot;nofollow noreferrer&quot;&gt;a custom code page&lt;/a&gt;, so that would seem to be valid, but it doesn't seem reasonable that a casual reader should be expected to know this.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strike&gt;As far as I can see Charcoal is built atop Python 3, which means it implicitly assumes UTF-8, which means the claim of 22 bytes is unsupportable by any of the metrics in this page.&lt;/strike&gt; (OK, it turns out Charcoal does have a code page, despite me looking and not finding one.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Other thoughts&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Ideally it would be obvious where to find the site FAQ, but when viewing a challenge and its submissions, I don't see anything that even suggests &amp;quot;site FAQ&amp;quot; or &amp;quot;site policy&amp;quot; documents, nor do I see anything referring to this &amp;quot;meta&amp;quot; site. (Maybe &amp;quot;meta&amp;quot; is some kind of standard thing on StackExchange, but if so, that in turn needs to be made clearer, by StackExchange itself.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Is&lt;/em&gt; there even a FAQ document, or are these meta questions the only approximation of such a resource?&lt;/p&gt;&#xA;" OwnerUserId="114094" LastEditorUserId="114094" LastEditDate="2023-10-21T02:55:32.940" LastActivityDate="2023-10-21T02:55:32.940" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26083" PostTypeId="2" ParentId="2140" CreationDate="2023-10-20T06:13:51.990" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/266152/&quot;&gt;Befunge Comment Outline Creator&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="119678" LastEditorUserId="119678" LastEditDate="2023-10-22T12:26:15.447" LastActivityDate="2023-10-22T12:26:15.447" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="26085" PostTypeId="2" ParentId="2140" CreationDate="2023-10-20T14:31:21.700" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/266670/literate-programming-in-base-26&quot;&gt;Literate Programming in Base 26&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-restricted-source-tooltip-container&quot;&gt;restricted-source&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-string-tooltip-container&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base-conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-base-conversion-tooltip-container&quot;&gt;base-conversion&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;Sandbox questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is the source restriction interesting?&lt;/li&gt;&#xA;&lt;li&gt;Is the title OK?&lt;/li&gt;&#xA;&lt;li&gt;Should I use base 27 and require the words to be separated by a space?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2023-11-12T03:31:31.533" LastActivityDate="2023-11-12T03:31:31.533" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26086" PostTypeId="2" ParentId="2140" CreationDate="2023-10-21T10:55:37.083" Score="1" Body="&lt;h1&gt;Pushing Penguins on an Integer Iceberg&lt;/h1&gt;&#xA;&lt;p&gt;An iceberg is represented by a rectangular grid of cells. Each cell can hold one of three penguins. Penguins can be pushed in any free orthogonal direction, but they slide until they reach the edge of the grid or would bump into another penguin. Example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;.........&#xA;.1.....2.&#xA;....3....&#xA;.........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If you push each penguin in turn to the right, they will end up in the following positions:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;.........&#xA;......1.2&#xA;........3&#xA;.........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Given an initial position and a target cell, your challenge is to push any of the penguins so that it comes to rest in that cell.&lt;/p&gt;&#xA;&lt;p&gt;You can take the initial position as an iceberg size and list of penguin coordinates, or as an iceberg array of bytes, with one value for the empty cells and one or three distinct values for the penguins. In the latter case the target cell can have its own distinct value or it can be a coordinate. (Although the input can only be bytes the type of the array can be larger.)&lt;/p&gt;&#xA;&lt;p&gt;The output list of pushes should identify the penguin to be pushed, either by its initial index or its current position, and either the direction (which can be encoded as any four convenient byte values) or target of the push, or if the penguins have three distinct values then it can be a list of updated iceberg arrays each with one penguin having been pushed to a new position from the previous. (The initial position does not have to be included in the output.)&lt;/p&gt;&#xA;&lt;p&gt;You can assume that the target cell will be in the interior of the iceberg as the edge cells are trivial as they only require two penguins to solve. (And the corner cells are even more trivial as they only require one penguin.)&lt;/p&gt;&#xA;&lt;p&gt;Your doesn't have to output an optimal solution but it must be deterministic. One approach is to devise a systematic solution that solves every cell on the iceberg but only output as far as the target cell.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2023-10-21T10:55:37.083" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26087" PostTypeId="2" ParentId="2140" CreationDate="2023-10-22T01:41:17.667" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/266208/help-i-cant-bloody-well-memorize-this-number&quot;&gt;Help, I can't bloody well memorize this number!&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="109946" LastEditorUserId="109946" LastEditDate="2023-10-25T08:08:07.287" LastActivityDate="2023-10-25T08:08:07.287" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26089" PostTypeId="2" ParentId="2140" CreationDate="2023-10-24T19:44:32.807" Score="2" Body="&lt;h1&gt;With/Without line separator&lt;/h1&gt;&#xA;&lt;p&gt;Tags: &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/source-layout&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;source-layout&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-source-layout-tooltip-container&quot;&gt;source-layout&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-number-tooltip-container&quot;&gt;number&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a function/program which takes two positive integer &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$b\$&lt;/span&gt; and returns:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$a \times b\$&lt;/span&gt;, when the program is in its default form&lt;/li&gt;&#xA;&lt;li&gt;&lt;span class=&quot;math-container&quot;&gt;\$a^b\$&lt;/span&gt;, when some line separators or instruction separators are removed from the same program&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;In your answer, please specify what line/instruction separators need to be omitted.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases:&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;a&lt;/th&gt;&#xA;&lt;th&gt;b&lt;/th&gt;&#xA;&lt;th&gt;&lt;span class=&quot;math-container&quot;&gt;\$a \times b\$&lt;/span&gt;&lt;/th&gt;&#xA;&lt;th&gt;&lt;span class=&quot;math-container&quot;&gt;\$a^b\$&lt;/span&gt;&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;td&gt;6&lt;/td&gt;&#xA;&lt;td&gt;8&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;6&lt;/td&gt;&#xA;&lt;td&gt;9&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&lt;p&gt;Avoid using comments if possible&lt;br /&gt;&#xA;You do not need to handle larger numbers&lt;br /&gt;&#xA;You may keep some line separators&lt;br /&gt;&#xA;You cannot reorder instructions&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;Assuming the program below calculates &lt;span class=&quot;math-container&quot;&gt;\$a \times b\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(a,b) =&amp;gt; {&#xA;    instruction1;&#xA;    instruction2;&#xA;    instruction3;&#xA;    instruction4;&#xA;    instruction5;&#xA;    return result;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The below would calculate &lt;span class=&quot;math-container&quot;&gt;\$a^b\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(a,b) =&amp;gt; {&#xA;    instruction1instruction2;&#xA;    instruction3instruction4instruction5;&#xA;    return result;&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest answer in bytes in each language wins.&lt;/p&gt;&#xA;" OwnerUserId="99115" LastEditorUserId="99115" LastEditDate="2023-10-25T20:12:02.137" LastActivityDate="2023-10-25T20:12:02.137" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26092" PostTypeId="2" ParentId="2140" CreationDate="2023-10-29T03:07:39.247" Score="0" Body="&lt;p&gt;Positions on the Pickleball Court&lt;/p&gt;&#xA;&lt;p&gt;My doubles pickleball group often has five people.  Four are playing and one is awaiting the next game.  We can represent the state of the game with a string of five characters like abCde.  This indicates that a and b are playing against c and d with c serving.  We want to write a routine that gives the possible positions after the next rally is complete.  The examples below will assume we start with this configuration.&lt;/p&gt;&#xA;&lt;p&gt;There are four possible outcomes of a rally.&lt;/p&gt;&#xA;&lt;p&gt;1)The serving side wins the rally but does not win the game.  The players on the serving side change places and the same player serves, so we go to abdCe.&lt;/p&gt;&#xA;&lt;p&gt;2)The serving side wins the rally and thereby wins the game.  The players rotate one position right and the serve goes to the first position, so we go to Eabcd&lt;/p&gt;&#xA;&lt;p&gt;3)The receiving side wins the rally, but the partner of the server has not served yet.  The players stay in position and the serve goes to the partner, so we go to abcDe&lt;/p&gt;&#xA;&lt;p&gt;4)The receiving side wins the rally and the partner of the server has served.  The players stay in position and the serve goes to the first player of the other side, the one in first or third position.  Here we go to Abcde&lt;/p&gt;&#xA;&lt;p&gt;Your task is to write a routine that takes a configuration at the start of a rally and returns or prints the four possible configurations at the end of the rally in the order of the possibilities above.  A configuration has the five characters in any order with the server any of the first four.  This is code golf, so the shortest solution wins.  You can use other characters and other ways of indicating the server if you wish, like digits and making the server negative or adding $5$ to the server or putting an asterisk after the server.  There needs to be a clear break between the four possibilities, like a space, a newline, or separate elements of a list.  You can take your input in any convenient way, as a string or array for example.  The characters used should be the same on input and output.&lt;/p&gt;&#xA;&lt;p&gt;Test cases-input first column, output the remaining four&lt;/p&gt;&#xA;&lt;p&gt;Abcde bAcde Eabcd aBcde abCde&lt;/p&gt;&#xA;&lt;p&gt;caBed caeBd Cabed cabEd Cabed&lt;/p&gt;&#xA;&lt;p&gt;dBace Bdace Edbac Dbace dbAce&lt;/p&gt;&#xA;&lt;p&gt;bcdAe bcAde Ebcda bcDae Bcdae&lt;/p&gt;&#xA;" OwnerUserId="12480" LastEditorUserId="12480" LastEditDate="2023-11-01T23:57:02.847" LastActivityDate="2023-11-01T23:57:02.847" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26093" PostTypeId="2" ParentId="2140" CreationDate="2023-10-29T14:39:25.093" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/266479/find-the-fairest-partition-of-a-list&quot;&gt;Find the fairest partition of a list&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-11-05T08:32:18.660" LastActivityDate="2023-11-05T08:32:18.660" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26094" PostTypeId="2" ParentId="2140" CreationDate="2023-10-29T19:02:59.920" Score="3" Body="&lt;h1&gt;Intersections in a Circular Scrambled Word&lt;/h1&gt;&#xA;&lt;p&gt;Given a word &lt;code&gt;W&lt;/code&gt; and a scrambled version of it &lt;code&gt;S&lt;/code&gt; as input, you are required to return the number of intersections &lt;code&gt;S&lt;/code&gt; will have when organized in a circular arrangement.&lt;/p&gt;&#xA;&lt;h1&gt;Example&lt;/h1&gt;&#xA;&lt;p&gt;Let &lt;code&gt;W&lt;/code&gt; be &lt;code&gt;VICTORY&lt;/code&gt; and &lt;code&gt;S&lt;/code&gt; be &lt;code&gt;VICYTRO&lt;/code&gt;. After transforming the scrambled word in its circular form and forming the original word by adding segments between the characters, we have the following diagram:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/pVPi1.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/pVPi1.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;As we can see, for this particular example, the expected output is &lt;code&gt;2&lt;/code&gt; interceptions.&lt;/p&gt;&#xA;&lt;h1&gt;Specs&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input will consist only of &lt;code&gt;[A-Z]&lt;/code&gt; characters.&lt;/li&gt;&#xA;&lt;li&gt;It is irrelevant how you set up the circular word (clockwise, counterclockwise, if the characters are evenly spaced from one another or not), just be consistent.&lt;/li&gt;&#xA;&lt;li&gt;Input is flexible, read it however you see fit for you.&lt;/li&gt;&#xA;&lt;li&gt;Standard loopholes are not allowed.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1&gt;Test Cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;Format: &#xA;W , S  --&amp;gt; output&#xA;&#xA;VICTORY, VICYTRO --&amp;gt; 2&#xA;# To be added more &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so shortest answers in bytes wins!&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;p&gt;Is the challenge interesting? Is there anything unclear? I am not a native English speaker, so I welcome any corrections on the wording of the challenge.&lt;/p&gt;&#xA;&lt;p&gt;I will later add more test cases. Also, what is the general consensus here where there are multiple correct answers? Because when I add words with repeated letters, depending on the &amp;quot;path&amp;quot; you choose when forming the circular word, it will affect the number of intersections. (I'll update the specs section as well when I introduce these special cases).&lt;/p&gt;&#xA;&lt;p&gt;Lastly, I didn't give much thought on my second point in the specs section, maybe it's wrong... I'll observe more cases later.&lt;/p&gt;&#xA;&lt;p&gt;Pretty much any feedback is appreciated!&lt;/p&gt;&#xA;" OwnerUserId="87307" LastActivityDate="2023-10-29T19:02:59.920" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26095" PostTypeId="2" ParentId="2447" CreationDate="2023-10-30T21:29:02.853" Score="-6" Body="&lt;h1&gt;Submissions to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-decision-problem-tooltip-container&quot;&gt;decision-problem&lt;/a&gt; challenges may take no input and output a (potentially infinite) set of all possible truthy/falsey outputs.&lt;/h1&gt;&#xA;&lt;p&gt;If the challenge is &amp;quot;Is the number even or odd?&amp;quot;, a submission could output a set of all even numbers (or, a set of all odd numbers).&lt;/p&gt;&#xA;&lt;p&gt;If the challenge is &amp;quot;Is the number a fibonacci number?&amp;quot;, a submission could output a set of all fibonacci numbers.&lt;/p&gt;&#xA;&lt;p&gt;A few submissions in TypeScript’s type system have used this where the submission is a union type (like a set) and you get truthy/falsey by whether assigning a variable to the union throws an error or not. I don’t see why this wouldn’t be allowed in other languages as well.&lt;/p&gt;&#xA;" OwnerUserId="108687" LastEditorUserId="108687" LastEditDate="2023-10-31T17:16:42.990" LastActivityDate="2023-10-31T17:16:42.990" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26096" PostTypeId="2" ParentId="2140" CreationDate="2023-10-30T22:19:33.507" Score="1" Body="&lt;h1&gt;Print the banned characters based on the most common characters &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-answer-chaining-tooltip-container&quot;&gt;answer-chaining&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-challenge-tooltip-container&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-source&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;restricted-source&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-restricted-source-tooltip-container&quot;&gt;restricted-source&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;This is an &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-answer-chaining-tooltip-container&quot;&gt;answer-chaining&lt;/a&gt; post, so in this challenge every answer (except the first answer) depends on the previous answer.&lt;/p&gt;&#xA;&lt;p&gt;The goal of this challenge is to output the restricted characters based on the most common &lt;code&gt;n&lt;/code&gt; characters, if happens to be a tie, then the characters with the lowest UTF-8 range is banned&lt;/p&gt;&#xA;&lt;p&gt;The max bytes for every answer is:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\begin{align}2n+60\end{align}&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;where &lt;code&gt;n&lt;/code&gt; is answer number&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;The answers only output the restricted characters, no newlines, no other characters like that.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The code may output the restricted characters once, in any order.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;Standard loopholes&lt;/a&gt; are forbidden by default.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No answerer may answer twice in a row.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;No languages may used in the last 5 answers (Or any answer if there are less than 5 answers).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Every answer takes empty or no input, and outputs to STDOUT. No answer should output to STDERR.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;The wrong answers (that break rules or don't do that this challenge say) are completely ignored if this answer is 10 minutes old, and should be deleted.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;The lowest score is the best. Using this formula:&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\begin{align}\frac{b+1}{n+1}\end{align}&lt;/span&gt;&lt;/p&gt;&#xA;&lt;p&gt;Where &lt;code&gt;b&lt;/code&gt; is byte count and &lt;code&gt;n&lt;/code&gt; is answer number, we can score the answers based on the lowest score. The answer is accepted if the challenge hasn't recieved answers for 5 days.&lt;/p&gt;&#xA;&lt;p&gt;Tiebreaker is the earliest answer.&lt;/p&gt;&#xA;&lt;h2&gt;Example&lt;/h2&gt;&#xA;&lt;p&gt;First answer&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;# 1: Python 3&#xA;&#xA;    print(end=&amp;quot;&amp;quot;)&#xA;&#xA;Character uses:&#xA;&#xA;    &amp;quot;: 2 (Banned)&#xA;    n: 2&#xA;    (: 1&#xA;    ): 1&#xA;    =: 1&#xA;    e: 1&#xA;    i: 1&#xA;    p: 1&#xA;    r: 1&#xA;    t: 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The second answer should output &lt;code&gt;&amp;quot;&lt;/code&gt;. If the second answer's code is &lt;code&gt;ppaaa&lt;/code&gt;, then the third answer should output either &lt;code&gt;pa&lt;/code&gt; or &lt;code&gt;ap&lt;/code&gt; (because you should output two restricted characters), and doesn't use these characters.&lt;/p&gt;&#xA;&lt;p&gt;Note: The scoring formula is based on the byte count and the answer number. The goal is to output the restricted characters efficiently while adhering to the specified byte limits.&lt;/p&gt;&#xA;&lt;p&gt;Have a great day!&lt;/p&gt;&#xA;" OwnerUserId="106959" LastEditorUserId="106959" LastEditDate="2023-11-09T21:31:04.990" LastActivityDate="2023-11-09T21:31:04.990" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26097" PostTypeId="2" ParentId="12380" CreationDate="2023-10-31T10:52:07.437" Score="2" Body="&lt;h2&gt;A function that takes &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; as input and outputs the coefficient of &lt;span class=&quot;math-container&quot;&gt;\$x^k\$&lt;/span&gt;&lt;/h2&gt;&#xA;&lt;p&gt;For example, &lt;span class=&quot;math-container&quot;&gt;\$24 x^4 + 96 x^3 + 72 x^2 + 16 x + 1\$&lt;/span&gt; can be represented as&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;f(k) = 24 if k = 4&#xA;     = 96 if k = 3&#xA;     = 72 if k = 2&#xA;     = 16 if k = 1&#xA;     = 1  if k = 0&#xA;     = 0  otherwise&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is different from the &amp;quot;function representation&amp;quot; in &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/12384/9288&quot;&gt;@xnor's answer&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If the challenge requires outputting a polynomial, we can also take &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt; as an additional input and output the coefficient of &lt;span class=&quot;math-container&quot;&gt;\$x^k\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For multivariable polynomials, we can take a list of inputs &lt;span class=&quot;math-container&quot;&gt;\$[k_1, k_2, \ldots, k_n]\$&lt;/span&gt; and output the coefficient of &lt;span class=&quot;math-container&quot;&gt;\$x_1^{k_1} x_2^{k_2} \cdots x_n^{k_n}\$&lt;/span&gt;.&lt;/p&gt;&#xA;" OwnerUserId="9288" LastEditorUserId="9288" LastEditDate="2023-11-01T01:51:43.873" LastActivityDate="2023-11-01T01:51:43.873" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26098" PostTypeId="2" ParentId="2140" CreationDate="2023-10-31T14:03:11.007" Score="2" Body="&lt;h1&gt;How many twisted corners?&lt;/h1&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/266733/how-many-twisted-corners&quot;&gt;Posted here&lt;/a&gt;&lt;/h3&gt;&#xA;" OwnerUserId="96037" LastEditorUserId="96037" LastEditDate="2023-11-14T13:43:14.910" LastActivityDate="2023-11-14T13:43:14.910" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="26099" PostTypeId="2" ParentId="2140" CreationDate="2023-10-31T14:08:23.197" Score="1" Body="&lt;p&gt;&lt;strong&gt;Challenge - Find the nearest &amp;quot;well known&amp;quot; fraction&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Find the nearest useful, well-known fraction for any decimal.&lt;/p&gt;&#xA;&lt;p&gt;Here I'm defining well-known fractions as&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1/2s - everyone can get on board with halves&lt;/li&gt;&#xA;&lt;li&gt;1/3s - similarly easy to picture&lt;/li&gt;&#xA;&lt;li&gt;1/4s - slicing up a pizza for greedy people&lt;/li&gt;&#xA;&lt;li&gt;1/5s - at the edge of usefulness, but I think still useful&lt;/li&gt;&#xA;&lt;li&gt;1/6s - only 1/6 and 5/6 are not covered by the above, but it's a pizza slice so just sneaks in&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;BUT NOT&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1/7s - no-one uses sevenths&lt;/li&gt;&#xA;&lt;li&gt;1/8s and 1/9s - might as well just go to    decimals now&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Thus, the challenge is, given any number between 0 and 1, output a numerator and denominator where the latter is between 1 and 6 inclusive, with a forward slash in-between, representing the nearest fraction to the decimal, from the following:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;0/1 1/6 1/5 1/4 1/3 2/5 1/2 3/5 2/3 3/4 4/5 5/6 1/1&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Zero and One results can either be output as 0/1 or 0, 1/1 or 1&lt;/p&gt;&#xA;&lt;p&gt;TIE BREAK - where a decimal is equidistant between two common fractions (e.g. 0.775 is equidistant from 4/5 and 3/4), then the LOWEST denominator wins, so an input of 0.775 outputs 3/4.&lt;/p&gt;&#xA;&lt;p&gt;(Sandbox comment - I hope this isn't trivially easy!)&lt;/p&gt;&#xA;" OwnerUserId="120133" LastActivityDate="2023-10-31T14:08:23.197" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26100" PostTypeId="2" ParentId="2140" CreationDate="2023-10-31T14:50:24.467" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/266614/make-code-printing-x-without-x&quot;&gt;Make Code Printing X Without X&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2023-11-08T17:53:10.023" LastActivityDate="2023-11-08T17:53:10.023" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26101" PostTypeId="2" ParentId="2140" CreationDate="2023-10-31T17:08:45.143" Score="0" Body="&lt;h1&gt;Seat people as far as possible&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-sequence-tooltip-container&quot;&gt;sequence&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Imagine there are &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; people &lt;span class=&quot;math-container&quot;&gt;\$\{a_1, a_2, \ldots, a_n\}\$&lt;/span&gt; who enter a room in order and sit down in &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; seats, arranged in a row. However, all of these people hate social contact, so they want to sit as far away from each other as possible; specifically, they sit in the set which maximizes the minimum distance from anyone who is already seated. They break ties by sitting in the seat furthest to the left. For example, suppose &lt;span class=&quot;math-container&quot;&gt;\$n=5\$&lt;/span&gt;. Then the people will sit down in the following order:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;_ _ _ _ _ &#xA;1 _ _ _ _ &#xA;1 _ _ _ 2&#xA;1 _ 3 _ 2&#xA;1 4 3 _ 2&#xA;1 4 3 5 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Your challenge is, given a positive integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, output the final arrangement of &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; people in &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; seats as described above. You can start the numbering of the people from 0 or 1.&lt;/p&gt;&#xA;&lt;h3&gt;Test Cases&lt;/h3&gt;&#xA;&lt;p&gt;(In these examples, numbering starts at 1.)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 []&#xA;1 [1]&#xA;2 [1, 2]&#xA;3 [1, 3, 2]&#xA;4 [1, 4, 3, 2]&#xA;5 [1, 4, 3, 5, 2]&#xA;6 [1, 4, 3, 5, 6, 2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Standard loopholes are forbidden. As this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, shortest program wins.&lt;/p&gt;&#xA;&lt;h1&gt;Questions&lt;/h1&gt;&#xA;&lt;p&gt;Has this been done before? It feels like would have been (or it reduces to some problem which has been done before), but I don't know how to find out.&lt;/p&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2023-10-31T17:46:56.153" LastActivityDate="2023-10-31T17:46:56.153" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26102" PostTypeId="2" ParentId="2140" CreationDate="2023-10-31T17:30:47.207" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/266423/seat-gangs-as-far-as-possible&quot;&gt;Seat gangs as far as possible&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2023-11-02T23:36:36.693" LastActivityDate="2023-11-02T23:36:36.693" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26103" PostTypeId="2" ParentId="2140" CreationDate="2023-10-31T20:24:35.233" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/266444/108687&quot;&gt;The too-short urinal problem&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="108687" LastEditorUserId="108687" LastEditDate="2023-11-03T19:56:22.523" LastActivityDate="2023-11-03T19:56:22.523" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26104" PostTypeId="2" ParentId="2140" CreationDate="2023-11-02T18:24:52.820" Score="1" Body="&lt;h1&gt;Twist words to intersect&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given three strings of alphabetic characters &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;, &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt;, and &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt;, (all uppercase or all lowercase, your choice), output an arrangement of &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; on a grid such that they intersect &lt;em&gt;only&lt;/em&gt; at the letters of &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt;. Each word can start at any location in the grid; after that, every character in the word must be placed in the grid at a location orthogonal (directly above, below, to the left, or to the right) of the previous character. The word must not intersect itself. The grid can be arbitrarily large.&lt;/p&gt;&#xA;&lt;p&gt;For example, if &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; was &lt;code&gt;ASHAMEFULACT&lt;/code&gt;, &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; was &lt;code&gt;CHARACTER&lt;/code&gt;, and &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt; was &lt;code&gt;HAT&lt;/code&gt;, one possible arrangement is shown below.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/ceUVp.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ceUVp.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In text format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;_ _ _ _ _ _ _&#xA;_ _ a m e f _&#xA;_ c H a r u _&#xA;_ a s c A l _&#xA;_ _ e T c _ _&#xA;_ _ r _ _ _ _&#xA;_ _ _ _ _ _ _&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(The places where the words intersect are shown in capitals; the rest of the letters are shown in lowercase.)&lt;/p&gt;&#xA;&lt;p&gt;You can output in any reasonable format -- the format above is not required. For example, you do not need to have the intersecting letters be a different case than the rest of the letters in the words. One possible output format would be a 2D array of characters, like&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[ [&amp;quot;&amp;quot;,  &amp;quot;A&amp;quot;, &amp;quot;M&amp;quot;, &amp;quot;E&amp;quot;, &amp;quot;F&amp;quot;],&#xA;  [&amp;quot;C&amp;quot;, &amp;quot;H&amp;quot;, &amp;quot;A&amp;quot;, &amp;quot;R&amp;quot;, &amp;quot;U&amp;quot;],&#xA;  [&amp;quot;A&amp;quot;, &amp;quot;S&amp;quot;, &amp;quot;C&amp;quot;, &amp;quot;A&amp;quot;, &amp;quot;L&amp;quot;],&#xA;  [&amp;quot;&amp;quot;,  &amp;quot;E&amp;quot;, &amp;quot;T&amp;quot;, &amp;quot;C&amp;quot;, &amp;quot;&amp;quot; ],&#xA;  [&amp;quot;&amp;quot;,  &amp;quot;R&amp;quot;, &amp;quot;&amp;quot;,  &amp;quot;&amp;quot;,  &amp;quot;&amp;quot; ] ]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;You can assume that such an arrangement is possible to create -- e.g. &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$B\$&lt;/span&gt; will both have the letters of &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; as a subsequence (in order).&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Standard loopholes are forbidden. As this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, shortest program wins.&lt;/p&gt;&#xA;" OwnerUserId="113573" LastEditorUserId="113573" LastEditDate="2023-11-02T23:39:27.597" LastActivityDate="2023-11-02T23:39:27.597" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26105" PostTypeId="2" ParentId="12380" CreationDate="2023-11-03T02:30:19.370" Score="1" Body="&lt;h1&gt;The function and &lt;code&gt;k&lt;/code&gt;&lt;/h1&gt;&#xA;&lt;p&gt;The pure function doesn't give an upperbound of &lt;code&gt;k&lt;/code&gt; so it needs extra provided&lt;/p&gt;&#xA;&lt;p&gt;Seems to trivialize some question but anyway list here&lt;/p&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2023-11-03T02:30:19.370" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26106" PostTypeId="2" ParentId="2140" CreationDate="2023-11-03T16:04:09.633" Score="2" Body="&lt;h1&gt;Smallest infinite irreducible program&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-bowling-tooltip-container&quot;&gt;code-bowling&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr/&gt;&#xA;&lt;p&gt;A typical constraint for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-bowling-tooltip-container&quot;&gt;code-bowling&lt;/a&gt; challenges, where the goal is to make your code as long as possible, is that your program must be &amp;quot;irreducible&amp;quot;. I.e., no subset of characters can be removed from your program with it still being valid. If your code was &lt;code&gt;xyz&lt;/code&gt;, none of &lt;code&gt;x&lt;/code&gt;, &lt;code&gt;y&lt;/code&gt;, &lt;code&gt;z&lt;/code&gt;, &lt;code&gt;xy&lt;/code&gt;, &lt;code&gt;yz&lt;/code&gt;, or &lt;code&gt;xz&lt;/code&gt; could do the same task as &lt;code&gt;xyz&lt;/code&gt;. This makes it impossible to use comments, string literals, long variable names, or whitespace to pad out your code length, but through some trickery it's possible to design a program which can be made arbitrarily large while still being irreducible.&lt;/p&gt;&#xA;&lt;p&gt;In this challenge, you'll try to golf the setup for this. Your submission will be a finitely sized &amp;quot;base&amp;quot; program, which is irreducible, and which can be increased to an arbitrarily high size through the addition of substrings at a chosen point (or set of points) in the program.&lt;/p&gt;&#xA;&lt;p&gt;For example, a base program might look like &lt;code&gt;wx()yz&lt;/code&gt;, and continue to function and be irreducible with the insertion of arbitrarily many &lt;code&gt;ab&lt;/code&gt;s in between the &lt;code&gt;()&lt;/code&gt;s (such as &lt;code&gt;wx(ababab)yz&lt;/code&gt;). You can also require substrings to be inserted in multiple places at once (e.g., you might need a &lt;code&gt;1&lt;/code&gt; to be appended to the program for each &lt;code&gt;ab&lt;/code&gt;, so the previous example would look like &lt;code&gt;wx(ababab)yz111&lt;/code&gt;).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Scoring:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your score is the size in bytes of your base program. Your base program must be irreducible on its own; if the insertion of some minimum number of your chosen substring(s) is necessary for this, those must be included in the score.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Task:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your irreducible program must do any one of the following tasks, of your choice:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Truth machine: Take an input. If the input is &lt;code&gt;0&lt;/code&gt;, print &lt;code&gt;0&lt;/code&gt; and stop. If the input is &lt;code&gt;1&lt;/code&gt;, print &lt;code&gt;1&lt;/code&gt; indefinitely&lt;/li&gt;&#xA;&lt;li&gt;Arithmetic: Take two inputs, &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt;. Print &lt;code&gt;x + y²&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Constant output: Print the string &lt;code&gt;Good morning!&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You may write a program or a function. If you choose to write a function, instead of printing you may return the output. For the truth machine task, you must use an infinite list/iterator if you return a value; you must have some way of getting an arbitrary number of &lt;code&gt;1&lt;/code&gt;s out of the return value in finite time (so you can't just append &lt;code&gt;1&lt;/code&gt;s to a list infinitely, and return the list once the infinite loop would stop).&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2023-11-03T16:04:09.633" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="26107" PostTypeId="2" ParentId="2140" CreationDate="2023-11-03T16:40:54.297" Score="3" Body="&lt;h2&gt;Longest irreducible quine&lt;/h2&gt;&#xA;&lt;h3&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/267486&quot;&gt;Posted here&lt;/a&gt;&lt;/h3&gt;&#xA;" OwnerUserId="96037" LastEditorUserId="96037" LastEditDate="2023-12-12T12:42:37.517" LastActivityDate="2023-12-12T12:42:37.517" CommentCount="15" ContentLicense="CC BY-SA 4.0" />
  <row Id="26108" PostTypeId="2" ParentId="2140" CreationDate="2023-11-06T01:34:43.340" Score="3" Body="&lt;h1&gt;Calculate a struct size&lt;/h1&gt;&#xA;&lt;p&gt;In C and C++, the size of a structure depends not only on the sizes of its members but also their alignment requirements.&lt;/p&gt;&#xA;&lt;p&gt;This problem will assume a simple case in which each structure is made up of primitive types that have a size that is a power of two and an alignment that equals their size.&lt;/p&gt;&#xA;&lt;p&gt;Given a list of the types in a structure, please output the resulting size of the structure.&lt;/p&gt;&#xA;&lt;p&gt;Here is an example structure:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-c prettyprint-override&quot;&gt;&lt;code&gt;struct {&#xA;  char c[5];&#xA;  int i, j;&#xA;  short s[3];&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Input in any of the following formats is acceptable:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A list of the sizes of the individual types that make up the structure; for the above that would be &lt;code&gt;[1, 1, 1, 1, 1, 4, 4, 2, 2]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;A list giving the lengths of each array and the sizes of its elements, which for the above would be &lt;code&gt;[[5, 1], [1, 4], [1, 4], [3, 2]]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;A list giving the size and alignment of each variable, which for the above would be &lt;code&gt;[[5, 1], [4, 4], [4, 4], [6, 2]]&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;(The third format indirectly supports nested structures but this can be emulated for the other formats by replacing them with an array of the same size and alignment.)&lt;/p&gt;&#xA;&lt;p&gt;The size of the above structure is &lt;code&gt;24&lt;/code&gt;. Here is how it is calculated:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Each of the &lt;code&gt;5&lt;/code&gt; &lt;code&gt;char&lt;/code&gt;s consumes &lt;code&gt;1&lt;/code&gt; byte each, making &lt;code&gt;5&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Each &lt;code&gt;int&lt;/code&gt; requires an alignment of &lt;code&gt;4&lt;/code&gt;, so there are three bytes of padding before the first of them. The total size is now &lt;code&gt;16&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Each of the &lt;code&gt;3&lt;/code&gt; &lt;code&gt;short&lt;/code&gt;s consume &lt;code&gt;2&lt;/code&gt; bytes each. The total size is now &lt;code&gt;22&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;The entire structure has an alignment of the largest alignment of any member, which in this case is &lt;code&gt;4&lt;/code&gt;, so the size must be rounded up to the next multiple of &lt;code&gt;4&lt;/code&gt;, which is &lt;code&gt;24&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Visually:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;c[0] c[1] c[2] c[3]&#xA;c[4] ..............&#xA;i__________________&#xA;j__________________&#xA;s[0]_____ s[1]_____&#xA;s[2]_____ .........&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2023-11-06T01:34:43.340" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26110" PostTypeId="1" AcceptedAnswerId="26111" CreationDate="2023-11-06T23:50:44.277" Score="6" ViewCount="189" Body="&lt;p&gt;What does a medal have to do with codes and computers? Is it a reference to the site badges and privileges? Or maybe a reference to the Olympiad awards? Also, why is it between two accolades?&lt;/p&gt;&#xA;" OwnerUserId="97633" LastEditorUserId="66833" LastEditDate="2023-11-08T20:29:22.890" LastActivityDate="2023-11-08T20:34:31.527" Title="Why is the site logo a medal?" Tags="|discussion|site-design|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26111" PostTypeId="2" ParentId="26110" CreationDate="2023-11-08T20:34:31.527" Score="12" Body="&lt;h3&gt;Because we're a site about competition&lt;/h3&gt;&#xA;&lt;p&gt;See &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17551/66833&quot;&gt;Adám's answer&lt;/a&gt; to the question &lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/17548/66833&quot;&gt;asking for input on the site design&lt;/a&gt;, and the &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7978/66833&quot;&gt;original proposed logo&lt;/a&gt; which was incorporated into the old &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/7955/66833&quot;&gt;Graduation Userscript&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;In short, we host challenges, where people compete. A medal seems very representative of that, which is why its used in our logo and our badges, the two big custom design elements each site gets.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2023-11-08T20:34:31.527" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26112" PostTypeId="2" ParentId="2140" CreationDate="2023-11-09T13:18:46.627" Score="0" Body="&lt;h1&gt;UTF-8 sum of source code.&lt;/h1&gt;&#xA;&lt;p&gt;Output the sum of the UTF-8 characters codes of your source code.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Draft notes&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Seems like there isn't that yet..&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;After some feedbacks I think this has nothing interesting or relevant.&#xA;There may be a lot of answers consisting of 150 or answers in the form: print(sum).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Not going to post it, thanks for feedback.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="84844" LastEditorUserId="84844" LastEditDate="2023-11-10T14:35:41.533" LastActivityDate="2023-11-10T14:35:41.533" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="26113" PostTypeId="2" ParentId="2140" CreationDate="2023-11-10T12:47:04.907" Score="1" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/266688/add-two-natural-numbers&quot;&gt;Add two natural numbers&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-11-13T15:19:24.253" LastActivityDate="2023-11-13T15:19:24.253" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26114" PostTypeId="2" ParentId="2140" CreationDate="2023-11-10T18:30:08.670" Score="1" Body="&lt;p&gt;I'm building a Code-Golf type game for an &lt;a href=&quot;https://www.osohq.com/docs/reference/polar/patterns&quot; rel=&quot;nofollow noreferrer&quot;&gt;authorization language&lt;/a&gt;. The premise is to review a piece of an authorization policy and the permissions to identify the least number of rules you need to create in order to keep the permissions true.&lt;/p&gt;&#xA;&lt;p&gt;Example of one policy and two permissions below. What are Alice and Anthony's roles?&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Alice can read Organization metaworldpeace&lt;/li&gt;&#xA;&lt;li&gt;Anthony can add_member Organization metaworldpeace&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;div class=&quot;snippet&quot; data-lang=&quot;js&quot; data-hide=&quot;false&quot; data-console=&quot;true&quot; data-babel=&quot;false&quot;&gt;&#xD;&#xA;&lt;div class=&quot;snippet-code&quot;&gt;&#xD;&#xA;&lt;pre class=&quot;snippet-code-js lang-js prettyprint-override&quot;&gt;&lt;code&gt;actor User { }&#xA;&#xA;resource Organization { &#xA;    roles = [&quot;admin&quot;, &quot;member&quot;];&#xA;    permissions = [&quot;read&quot;, &quot;add_member&quot;];&#xA;# role hierarchy:&#xA;# admins inherit all member permissions&#xA;&quot;member&quot; if &quot;admin&quot;;&#xA;&#xA;# org-level permissions&#xA;&quot;read&quot; if &quot;member&quot;;&#xA;&quot;add_member&quot; if &quot;admin&quot;;&#xA;&#xA;   &lt;/code&gt;&lt;/pre&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/div&gt;&#xD;&#xA;&lt;/p&gt;&#xA;" OwnerUserId="120239" LastActivityDate="2023-11-10T18:30:08.670" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26115" PostTypeId="2" ParentId="2140" CreationDate="2023-11-10T19:02:06.210" Score="1" Body="&lt;h1&gt;Can I do this parkour?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr/&gt;&#xA;&lt;p&gt;In this challenge, you'll be given a list of platforms (line segments), a start point, a goal point, and your acceleration, stopping, and jump strength. Your task will be to determine whether it's possible to make it from the start point to the goal point by running and jumping on the given platforms.&lt;/p&gt;&#xA;&lt;h2&gt;Physics&lt;/h2&gt;&#xA;&lt;p&gt;I can be modelled as a point, subject to gravity. All positions will be given in meters, and gravity can be assumed to accelerate me downward at &lt;span class=&quot;math-container&quot;&gt;\$10\:\mathrm{m/s^2}\$&lt;/span&gt;. If I'm standing on a horizontal platform, I can accelerate in a direction I'm moving in (or if I'm at &lt;span class=&quot;math-container&quot;&gt;\$0\:\mathrm{m/s}\$&lt;/span&gt;) at a rate of &lt;span class=&quot;math-container&quot;&gt;\$a\:\mathrm{m/s^2}\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; is the acceleration taken as input.&lt;/p&gt;&#xA;&lt;p&gt;(unfinished)&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2023-11-10T19:02:06.210" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="26116" PostTypeId="2" ParentId="2140" CreationDate="2023-11-12T13:15:14.927" Score="2" Body="&lt;h1&gt;Sub-quadratic base conversion&lt;/h1&gt;&#xA;&lt;p&gt;Write a program that converts a positive integer given in base 10 to its base 2 representation.&lt;/p&gt;&#xA;&lt;p&gt;Your algorithm must run in a complexity lower that &lt;span class=&quot;math-container&quot;&gt;\$O(n^2)\$&lt;/span&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You can assume that each arithetic operation (sum/multiplication/division/remainder/exponentation) has the running time of the fastest known algorithm, independent of the implementation that is actually used (This includes methods that you wrote yourself).&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Addition can be done in linear time&lt;/li&gt;&#xA;&lt;li&gt;Multiplcation/division/remainder run in &lt;span class=&quot;math-container&quot;&gt;\$ O(n \cdot \log(n))\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; is the sum of the numbers of bits of the inputs &lt;sup&gt;*&lt;/sup&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Exponentiation &lt;span class=&quot;math-container&quot;&gt;\$N^X\$&lt;/span&gt; runs in &lt;span class=&quot;math-container&quot;&gt;\$O((n \log x)(\log(n)+\log(\log x)))\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt; are the numbers of bits in &lt;span class=&quot;math-container&quot;&gt;\$N\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt; respectively.&lt;/li&gt;&#xA;&lt;li&gt;If you know faster algorithms please link them in your challenge&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;All built-in base-conversion/library methods for base-conversion are assumed to run in quadratic time in the input, even if the actual implementation is faster&lt;/li&gt;&#xA;&lt;li&gt;&lt;em&gt;(... more rules will follow)&lt;/em&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-restricted-complexity-tooltip-container&quot;&gt;restricted-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;sup&gt;*&lt;/sup&gt;&#xA;The &lt;span class=&quot;math-container&quot;&gt;\$O(n log (n)) \$&lt;/span&gt; multiplication algorithm assumes that both arguments have the approximately same size, for simplicity you may assume that the same complexity can be archived for arbitrary argument sizes (this may not be true in practice).&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is this a duplicate?&lt;/li&gt;&#xA;&lt;li&gt;Is there interest in a challenge of this form?&lt;/li&gt;&#xA;&lt;li&gt;Is my explanation clear?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-11-19T15:48:18.233" LastActivityDate="2023-11-19T15:48:18.233" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="26117" PostTypeId="2" ParentId="2140" CreationDate="2023-11-13T11:14:52.683" Score="0" Body="&lt;h1&gt;Emulate a Turing Complete processor&lt;/h1&gt;&#xA;&lt;p&gt;(As opposed to a Turing-complete processor.)&lt;/p&gt;&#xA;&lt;p&gt;In the puzzle game Turing Complete, at one stage you get to &amp;quot;build&amp;quot; a processor out of previous parts. This processor has six registers &lt;code&gt;R0-R5&lt;/code&gt;, a program counter, an input and an output, all 8-bit. All registers default to zero. Unless changed by a condition instruction, the program counter will increment after each instruction.&lt;/p&gt;&#xA;&lt;p&gt;There are four instructions:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;0o0XY&lt;/code&gt; is the &amp;quot;Immediate&amp;quot; instruction. The instruction itself is copied into the &lt;code&gt;R0&lt;/code&gt; register.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;0o1XY&lt;/code&gt; is the &amp;quot;Compute&amp;quot; instruction. The source registers are always &lt;code&gt;R1&lt;/code&gt; and &lt;code&gt;R2&lt;/code&gt; and the destination is always &lt;code&gt;R3&lt;/code&gt;. &lt;code&gt;Y&lt;/code&gt; can be &lt;code&gt;0-5&lt;/code&gt; representing one of six computations, &lt;code&gt;Or&lt;/code&gt;, &lt;code&gt;Nor&lt;/code&gt;, &lt;code&gt;Nand&lt;/code&gt;, &lt;code&gt;And&lt;/code&gt;, &lt;code&gt;Plus&lt;/code&gt;, &lt;code&gt;Minus&lt;/code&gt;. &lt;code&gt;X&lt;/code&gt; is ignored.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;0o2XY&lt;/code&gt; is the &amp;quot;Copy&amp;quot; instruction. &lt;code&gt;X&lt;/code&gt; and &lt;code&gt;Y&lt;/code&gt; can be &lt;code&gt;0-5&lt;/code&gt; representing a register or &lt;code&gt;6&lt;/code&gt; representing the input or output respectively.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;0o3XY&lt;/code&gt; is the &amp;quot;Condition&amp;quot; instruction. &lt;code&gt;Y&lt;/code&gt; can be &lt;code&gt;0-7&lt;/code&gt; representing one of eight conditions, &lt;code&gt;False&lt;/code&gt;, &lt;code&gt;Zero&lt;/code&gt;, &lt;code&gt;Negative&lt;/code&gt;, &lt;code&gt;Non-Positive&lt;/code&gt;, &lt;code&gt;True&lt;/code&gt;, &lt;code&gt;Non-Zero&lt;/code&gt;, &lt;code&gt;Non-Negative&lt;/code&gt;, &lt;code&gt;Positive&lt;/code&gt;. If the signed value in the &lt;code&gt;R3&lt;/code&gt; register satisfies the condition, the program counter becomes the value of the &lt;code&gt;R0&lt;/code&gt; register. &lt;code&gt;X&lt;/code&gt; is ignored.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Your task is to accept a program, which is an array of up to 256 bytes (but your program can use any reasonable data type), an input stream of bytes, and the number of instructions to execute (since there's no &lt;code&gt;Halt&lt;/code&gt; instruction and there's no guarantee that the computation will ever &amp;quot;finish&amp;quot;), and return the bytes that the program has written to its output.&lt;/p&gt;&#xA;&lt;p&gt;You can assume that the bytes of the program will only be legal values, although you must ignore &lt;code&gt;X&lt;/code&gt; for the Compute and Condition instructions. You can assume that the program counter will not index out of the array, although if the input array is 256 bytes then it is possible for the program counter to wrap around since it only has 8 bits.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2023-11-13T11:14:52.683" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26118" PostTypeId="2" ParentId="2140" CreationDate="2023-11-13T12:47:07.677" Score="0" Body="&lt;h1&gt;Stairspin&lt;/h1&gt;&#xA;&lt;p&gt;Given a grid, of n x n size. The elements are indexed so:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;00 10 20 ...&#xA;01 11 21 ...&#xA;02 12 22 ...&#xA;.. .. .. ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;and so on.&lt;/p&gt;&#xA;&lt;p&gt;There is a very interesting transformation called the &lt;em&gt;Stairspin&lt;/em&gt;: The 4x4 grid&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;00 10 20 30&#xA;01 11 21 31&#xA;02 12 22 32&#xA;03 13 23 33&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;becomes&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;01 00 10 20&#xA;02 12 11 30&#xA;03 22 21 31&#xA;13 23 33 32&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;after the transformation.&lt;/p&gt;&#xA;&lt;p&gt;Your task is, given &lt;code&gt;n&lt;/code&gt; and the index of an element, you must find where the element goes after the Stairspin.&lt;/p&gt;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;4 00&lt;/code&gt; -&amp;gt; &lt;code&gt;10&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;5 12&lt;/code&gt; -&amp;gt; &lt;code&gt;11&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;3 11&lt;/code&gt; -&amp;gt; &lt;code&gt;11&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Fewest bytes win!&lt;/p&gt;&#xA;" OwnerUserId="118340" LastActivityDate="2023-11-13T12:47:07.677" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26119" PostTypeId="2" ParentId="6918" CreationDate="2023-11-15T06:15:29.790" Score="3" Body="&lt;h1&gt;Morsecco&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Morsecco&lt;/em&gt; is a minimalistic, but mighty programming language using &lt;strong&gt;morse c&lt;/strong&gt;ode for &lt;strong&gt;co&lt;/strong&gt;ding (hence the sparkling name). You need only a dot for the short beep, a stroke (dash or slash) for the long beep and a whitespace for the break between letters. This already makes it the coolest coding feeling ever, because on most keyboards you can put your right thumb on space key, two other fingers on dot and stroke key and start coding, hardly moving your hand and leaving the left hand free for your beer or pizza.&lt;/p&gt;&#xA;&lt;p&gt;And if you think that this must feel great, just wait until you realise that it doesn't take long until you can actually create complex and even useful software that way! It's not just one more of that esoteric languages, where it's hard to solve even a simple task. If you know some morse codes, a little forth and are a type safety anarchist, you can almost start. Otherwise read the &lt;a href=&quot;https://github.com/Philipp-Sasse/morsecco/blob/main/Morsecco%20tutorial.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;tutorial&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;only &lt;strong&gt;one&lt;/strong&gt; data type: a cell (can be text, numbers, addresses, executable code ...)&lt;/li&gt;&#xA;&lt;li&gt;only &lt;strong&gt;two&lt;/strong&gt; memory locations: a stack and an addressable storage&lt;/li&gt;&#xA;&lt;li&gt;only &lt;strong&gt;three&lt;/strong&gt; significant characters: dot, dash and space&lt;/li&gt;&#xA;&lt;li&gt;only seventeen commands by now (including help and debug), but extremely easy to expand&lt;/li&gt;&#xA;&lt;li&gt;includes an interactive shell that can be mixed with scripts&lt;/li&gt;&#xA;&lt;li&gt;file writing and reading, WWW access, random numbers, numeric conversion even with float base&lt;/li&gt;&#xA;&lt;li&gt;great golfing fun, because there are so many ways to do things including self-modifying code&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;git clone https://github.com/Philipp-Sasse/morsecco.git&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;or &lt;code&gt;pip install morsecco&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Just to give you a tiny impression, the following code defines a new command &lt;code&gt;-.&lt;/code&gt; that adds 5 to a number, and demonstrates it by putting 3 on the stack, call the new command and output the result 8:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;morsecco '.   . -.- .-  . -. .-- . -- -. ---'&#xA;-...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Defining the command only takes a couple of characters in a language with only three symbols! Here comes an explanation (the highlighted &lt;code&gt;C&lt;/code&gt;apitals refer to morse codes: &lt;code&gt;.&lt;/code&gt; is the morse code for &lt;code&gt;E&lt;/code&gt; and for the morsecco command &lt;code&gt;E&lt;/code&gt;nter. Numbers are coded in binary, so 8 is &lt;code&gt;1000&lt;/code&gt;, translating to &lt;code&gt;-...&lt;/code&gt;):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;. -.- .-&lt;/code&gt; is &lt;code&gt;E&lt;/code&gt;nter (&lt;code&gt;.&lt;/code&gt;) 5 (&lt;code&gt;-.-&lt;/code&gt;) on the stack and &lt;code&gt;A&lt;/code&gt;dd (&lt;code&gt;.-&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;the &lt;code&gt;E&lt;/code&gt;nter command at the beginning puts this command (everything between the triple and the double space) on the stack&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;. -. .--&lt;/code&gt; &lt;code&gt;E&lt;/code&gt;nters the address &lt;code&gt;-.&lt;/code&gt;, to where we &lt;code&gt;W&lt;/code&gt;rite the command (you could also Read it there to use it like a variable)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;. -- -.&lt;/code&gt; &lt;code&gt;E&lt;/code&gt;nters 3 (&lt;code&gt;--&lt;/code&gt;) and calls the new command (yes: as soon as you write to an address, you can use this address like a command to execute it!)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;---&lt;/code&gt; Output the top of the stack&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Feedback and support is highly welcome.&lt;/p&gt;&#xA;" OwnerUserId="72726" LastEditorUserId="72726" LastEditDate="2023-12-17T17:50:48.513" LastActivityDate="2023-12-17T17:50:48.513" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26120" PostTypeId="2" ParentId="2140" CreationDate="2023-11-16T14:47:17.420" Score="4" Body="&lt;h2&gt;Golf Transmission&lt;/h2&gt;&#xA;&lt;p&gt;As in, the 5 speed transmission from the original VW Golf GTI.&lt;/p&gt;&#xA;&lt;p&gt;Print the transmission pattern in as few bytes as possible.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1  3  5&#xA;|  |  | &#xA;|--|--|&#xA;|  |  |&#xA;2  4  R&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-kolmogorov-complexity-tooltip-container&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="96266" LastActivityDate="2023-11-16T14:47:17.420" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26121" PostTypeId="2" ParentId="2140" CreationDate="2023-11-16T16:33:47.163" Score="0" Body="&lt;h1&gt;Produce a secure block cipher round function (1 bit round key; 7 bit message).&lt;/h1&gt;&#xA;&lt;p&gt;Tags: &lt;code&gt;math&lt;/code&gt;,&lt;code&gt;encryption&lt;/code&gt;,&lt;code&gt;cryptography&lt;/code&gt;,&lt;code&gt;linear algebra&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;We are going to need new symmetric encryption functions. We are at the point where we cannot improve the performance of integrated circuits very much simply by shrinking transistors. Furthermore, we are approaching the limits of the energy efficiency of transistors using conventional irreversible computation. The only way to surpass these limits is to use reversible computation. But to get the most out of reversible computation, one needs to use algorithms that are designed for reversible computation. Since the AES encryption protocol was not designed for reversible computation, it is probably a good time for cryptographers to produce, evaluate, and standardize new symmetric encryption functions that are efficient on fully reversible hardware/software. And as a bonus, cryptographic functions are more resistant to side channel attacks when we run them on reversible hardware since irreversible computation not only leaks energy, but irreversible computation leaks some information that can be used to decipher what is being encrypted.&lt;/p&gt;&#xA;&lt;p&gt;In addition to the need for new cryptographic functions, the rise of AI will bring rise to new cryptoanalytic techniques that can be used to better evaluate the security of block ciphers (this is my personal opinion based on my personal research). Cryptographers can also employ new techniques for evaluating block ciphers including the application of invariants that measure the level of cryptographic security of block ciphers and always give isomorphic block cipher round functions the same level of cryptographic security (this makes it impossible to artificially inflate the security value by relabeling all the possible messages and round keys). Spectral techniques are one way of assigning each block cipher or block cipher round function a specific number that measures its cryptographic security. In this challenge, we shall apply one of these spectral techniques to measure the cryptographic security of some very simple block cipher round functions.&lt;/p&gt;&#xA;&lt;p&gt;The goal of this challenge is to produce a very simple block cipher round function that minimizes a measure of its cryptographic insecurity. Since this kind of block cipher round function has a microscopic 7 bit message size, it is subject to brute force attacks, and it will probably not have any practical use whatsoever, but we can still measure the level of its cryptographic security in various ways.&lt;/p&gt;&#xA;&lt;p&gt;The participants in this challenge do not need to have prior experience with evaluating block ciphers and such prior experience probably will not help very much.&lt;/p&gt;&#xA;&lt;h1&gt;Spectral radius&lt;/h1&gt;&#xA;&lt;p&gt;If &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt; is a matrix, then the spectral radius is the value&#xA;&lt;span class=&quot;math-container&quot;&gt;\$\rho(X)=\max\{|\lambda|:\lambda\,\text{is an eigenvalue of}\,X\}.\$&lt;/span&gt; It is well known that &lt;span class=&quot;math-container&quot;&gt;\$\rho(X)=\lim_{n\rightarrow\infty}\|X^n\|^{1/n}\$&lt;/span&gt; and this limit does not depend on the matrix norm chosen.&lt;/p&gt;&#xA;&lt;p&gt;The spectral radius of a complex matrix &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt; can often be easily computed. If &lt;span class=&quot;math-container&quot;&gt;\$v_0\$&lt;/span&gt; is an arbitrary vector and &lt;span class=&quot;math-container&quot;&gt;\$v_{n+1}=\frac{Xv_n}{\|Xv_n\|}\$&lt;/span&gt; for all &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, then &lt;span class=&quot;math-container&quot;&gt;\$\|Xv_n\|\$&lt;/span&gt; will converge to the spectral radius &lt;span class=&quot;math-container&quot;&gt;\$\rho(X)\$&lt;/span&gt; except in the case when &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt; has multiple eigenvalues with maximum absolute value.&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Produce a pair of permutations &lt;span class=&quot;math-container&quot;&gt;\$(P,Q)\$&lt;/span&gt; of &lt;span class=&quot;math-container&quot;&gt;\$\{1,2,...,127,128\}\$&lt;/span&gt; with the smallest associated spectral radius &lt;span class=&quot;math-container&quot;&gt;\$\rho((P_2+Q_2)/2)\$&lt;/span&gt;. The pair of permutations &lt;span class=&quot;math-container&quot;&gt;\$(P,Q)\$&lt;/span&gt; should be thought of as the round function for a &lt;span class=&quot;math-container&quot;&gt;\$7\$&lt;/span&gt; bit message. If the round key is &lt;span class=&quot;math-container&quot;&gt;\$0\$&lt;/span&gt;, we perform the transformation &lt;span class=&quot;math-container&quot;&gt;\$x\mapsto P(x)\$&lt;/span&gt; to the message &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;, and if the round key is 1, then we perform the transformation &lt;span class=&quot;math-container&quot;&gt;\$x\mapsto Q(x)\$&lt;/span&gt; to the message &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;. A lower spectral radius signifies a greater level of cryptographic security.&lt;/p&gt;&#xA;&lt;p&gt;Let &lt;span class=&quot;math-container&quot;&gt;\$X=\{1,2,...,128\}\$&lt;/span&gt;. Let &lt;span class=&quot;math-container&quot;&gt;\$Y\$&lt;/span&gt; be the collection of all unordered pairs of distinct elements in the set &lt;span class=&quot;math-container&quot;&gt;\$X\$&lt;/span&gt;. For example, &lt;span class=&quot;math-container&quot;&gt;\$Y\$&lt;/span&gt; contains the pairs &lt;span class=&quot;math-container&quot;&gt;\$\{2,3\},\{56,57\},\{2,16\}\$&lt;/span&gt; along with other pairs. The set &lt;span class=&quot;math-container&quot;&gt;\$Y\$&lt;/span&gt; contains &lt;span class=&quot;math-container&quot;&gt;\$128\cdot 127/2=8128\$&lt;/span&gt; elements.&lt;/p&gt;&#xA;&lt;p&gt;If &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; is a permutation of &lt;span class=&quot;math-container&quot;&gt;\$\{1,...,128\}\$&lt;/span&gt;, then the mapping &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; induces a permutation &lt;span class=&quot;math-container&quot;&gt;\$P_0\$&lt;/span&gt; of &lt;span class=&quot;math-container&quot;&gt;\$Y\$&lt;/span&gt; defined by letting &lt;span class=&quot;math-container&quot;&gt;\$P_0(\{a,b\})=\{P(a),P(b)\}\$&lt;/span&gt;. Let &lt;span class=&quot;math-container&quot;&gt;\$U\$&lt;/span&gt; be the real vector space generated by the basis &lt;span class=&quot;math-container&quot;&gt;\$Y\$&lt;/span&gt;. Let &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; be the linear functional mapping &lt;span class=&quot;math-container&quot;&gt;\$U\$&lt;/span&gt; to the field of real numbers defined by setting &lt;span class=&quot;math-container&quot;&gt;\$L(\{x,y\})=1\$&lt;/span&gt; whenever &lt;span class=&quot;math-container&quot;&gt;\$x,y\$&lt;/span&gt; are distinct. Let &lt;span class=&quot;math-container&quot;&gt;\$V=\ker(U)\$&lt;/span&gt;. Then &lt;span class=&quot;math-container&quot;&gt;\$V\$&lt;/span&gt; is the subspace of &lt;span class=&quot;math-container&quot;&gt;\$U\$&lt;/span&gt; generated by pairs &lt;span class=&quot;math-container&quot;&gt;\$\{u,v\}-\{x,y\}\$&lt;/span&gt;. We extend the mapping &lt;span class=&quot;math-container&quot;&gt;\$P_0\$&lt;/span&gt; to a linear operator &lt;span class=&quot;math-container&quot;&gt;\$P_1:U\rightarrow U\$&lt;/span&gt; by linearity. In other words,&#xA;&lt;span class=&quot;math-container&quot;&gt;\$P_1(\alpha_1\{x_1,y_1\}+\dots+\alpha_n\{x_n,y_n\})=&#xA;\alpha_1P_0(\{x_1,y_1\})+\dots+\alpha_nP_0(\{x_n,y_n\})\$&lt;/span&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$=\alpha_1\{P(x_1),P(y_1)\}+\dots+\alpha_n\{P(x_n),P(y_n)\}.\$&lt;/span&gt; Let &lt;span class=&quot;math-container&quot;&gt;\$ P_2:V\rightarrow V\$&lt;/span&gt; be the restriction of the operator &lt;span class=&quot;math-container&quot;&gt;\$P_1\$&lt;/span&gt;. The operator &lt;span class=&quot;math-container&quot;&gt;\$P_2\$&lt;/span&gt; is the unique linear operator from &lt;span class=&quot;math-container&quot;&gt;\$V\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$V\$&lt;/span&gt; where&#xA;&lt;span class=&quot;math-container&quot;&gt;\$ P_2(\{u,v\}-\{x,y\})=P_1(\{u,v\})-P_1(\{x,y\})\$&lt;/span&gt; whenever &lt;span class=&quot;math-container&quot;&gt;\$\{u,v\},\{x,y\}\in Y\$&lt;/span&gt;&#xA;Our goal is to minimize the spectral radius &lt;span class=&quot;math-container&quot;&gt;\$\rho((P_2+Q_2)/2)\$&lt;/span&gt; of the average &lt;span class=&quot;math-container&quot;&gt;\$(P_2+Q_2)/2\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Given a pair of permutations &lt;span class=&quot;math-container&quot;&gt;\$P,Q\$&lt;/span&gt; of &lt;span class=&quot;math-container&quot;&gt;\$\{1,2,...,127,128\}\$&lt;/span&gt;, set&#xA;we produce a Markov chain on the set &lt;span class=&quot;math-container&quot;&gt;\$\{\{x,y\}:x,y\in\{1,\dots,127,128\},x\neq y\}\$&lt;/span&gt; where we transition from &lt;span class=&quot;math-container&quot;&gt;\$\{x,y\}\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$\{P(x),P(y)\}\$&lt;/span&gt; with probability &lt;span class=&quot;math-container&quot;&gt;\$1/2\$&lt;/span&gt; and from &lt;span class=&quot;math-container&quot;&gt;\$\{x,y\}\$&lt;/span&gt; to &lt;span class=&quot;math-container&quot;&gt;\$\{Q(x),Q(y)\}\$&lt;/span&gt; with probability &lt;span class=&quot;math-container&quot;&gt;\$1/2\$&lt;/span&gt;.  This Markov chain is associated with a double stochastic matrix &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt;. The doubly stochastic matrix &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; has spectral radius &lt;span class=&quot;math-container&quot;&gt;\$1\$&lt;/span&gt;, but the second largest absolute value of an eigenvalue of &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; measures how quickly powers &lt;span class=&quot;math-container&quot;&gt;\$A^n\$&lt;/span&gt; of &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; converge to the matrix where each entry is equal to each other. In other words, the second largest absolute value of an eigenvalue of &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; measures how quickly iterating steps in the Markov chain approaches the uniform Markov chain. The second largest absolute value of an eigenvalue of &lt;span class=&quot;math-container&quot;&gt;\$A\$&lt;/span&gt; is just the spectral radius &lt;span class=&quot;math-container&quot;&gt;\$\rho((P_2+Q_2)/2)\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The averaging operator &lt;span class=&quot;math-container&quot;&gt;\$(P_2+Q_2)/2\$&lt;/span&gt; satisfies the circular law, so the eigenvalues of &lt;span class=&quot;math-container&quot;&gt;\$(P_2+Q_2)/2\$&lt;/span&gt; should be approximately uniformly distributed on the disk centered at zero with radius &lt;span class=&quot;math-container&quot;&gt;\$\sqrt(2)/2\$&lt;/span&gt;. Furthermore, if the permutations &lt;span class=&quot;math-container&quot;&gt;\$P,Q\$&lt;/span&gt; are good enough, then the spectral radius of &lt;span class=&quot;math-container&quot;&gt;\$(P+Q)/2\$&lt;/span&gt; should be approximately &lt;span class=&quot;math-container&quot;&gt;\$\sqrt(2)/2\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Computing the spectral radius&lt;/h1&gt;&#xA;&lt;p&gt;One can easily use power iteration to compute the spectral radius of a sparse matrix except for one tiny problem. The matrix &lt;span class=&quot;math-container&quot;&gt;\$(P_2+Q_2)/2\$&lt;/span&gt; will be a real matrix, and the eigenvalues of real matrices will be symmetric around the real number line. This means that imaginary eigenvalues of real matrices must always come in pairs. Now, since the real number line has zero area and since the eigenvalues of &lt;span class=&quot;math-container&quot;&gt;\$(P_2+Q_2)/2\$&lt;/span&gt; satisfy the a sort of circular law (but for &lt;span class=&quot;math-container&quot;&gt;\$(P_2+Q_2)/2\$&lt;/span&gt; the eigenvalues somewhat cluster near the boundary of the disk due to the unitarity of &lt;span class=&quot;math-container&quot;&gt;\$P_2,Q_2\$&lt;/span&gt;), the matrix &lt;span class=&quot;math-container&quot;&gt;\$(P_2+Q_2)/2\$&lt;/span&gt; is more likely to have a pair of conjugate dominant eigenvalues rather than a single real dominant eigenvalue. We can circumvent this issue by applying the power iteration technique to the complex matrix &lt;span class=&quot;math-container&quot;&gt;\$(P_2+(1+i\cdot \epsilon)\cdot Q_2)/2\$&lt;/span&gt; and then slowly decreasing &lt;span class=&quot;math-container&quot;&gt;\$\epsilon\$&lt;/span&gt; down to zero so that the power iteration obtains a single dominant eigenvalue/eigenvector pair for &lt;span class=&quot;math-container&quot;&gt;\$(P_2+Q_2)/2\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Format&lt;/h1&gt;&#xA;&lt;p&gt;In your answer, please specify the permutations P,Q that you use along with the spectral radius of &lt;span class=&quot;math-container&quot;&gt;\$(P_2+Q_2)/2\$&lt;/span&gt; (which should be around &lt;span class=&quot;math-container&quot;&gt;\$\sqrt{2}/2\$&lt;/span&gt;) together with the code or algorithm that you have used to produce the permutations P,Q.&lt;/p&gt;&#xA;&lt;p&gt;There are two ways that you can specify your permutations.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;p&gt;You may write your permutations as tables. For example, &lt;code&gt;[4,5,6,1,2,3,7,8]&lt;/code&gt; will denote the permutation of {1,...,7,8} where 1-&amp;gt;4,2-&amp;gt;5,3-&amp;gt;6,4-&amp;gt;1,5-&amp;gt;2,6-&amp;gt;3,7-&amp;gt;7,8-&amp;gt;8.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You may also write your permutations as products of disjoint cycles. For example, &lt;code&gt;(2,6)(3,7)(1,4,8,5)&lt;/code&gt; will denote the permutation of {1,...,7,8} where 2-&amp;gt;6,6-&amp;gt;2,3-&amp;gt;7,7-&amp;gt;3,1-&amp;gt;4,4-&amp;gt;8,8-&amp;gt;5,5-&amp;gt;1.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h1&gt;Sample answer (with reduced key size).&lt;/h1&gt;&#xA;&lt;p&gt;Here is a sample answer where (for simplicity) the permutation &lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; takes &lt;span class=&quot;math-container&quot;&gt;\$5\$&lt;/span&gt; bits as input and out rather than &lt;span class=&quot;math-container&quot;&gt;\$7\$&lt;/span&gt; bits (&lt;span class=&quot;math-container&quot;&gt;\$P\$&lt;/span&gt; is a permutation of &lt;span class=&quot;math-container&quot;&gt;\$\{1,\dots,31,32\}\$&lt;/span&gt;).&lt;/p&gt;&#xA;&lt;p&gt;P:&lt;code&gt;&#xA;(1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26)(27,28,29)(30,31)&#xA;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Q:&lt;code&gt;&#xA;(1,31,29,23,27,12,16,8,6,10,17,2,9,5,24,11,14,7,30,4,19,32,26,15,3,20)(13,18,21,22,28)&#xA;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;P:&lt;code&gt;&#xA;[ 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 1, 28, 29, 27, 31, 30,32]&#xA;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Q:&lt;code&gt;&#xA;[ 31, 9, 20, 19, 24, 10, 30, 6, 5, 17, 14, 16, 18, 7, 3, 8, 2, 21, 32, 1, 22, 28, 27, 11, 25, 15, 12, 13, 23, 4, 29,&#xA;26 ]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Loss: 0.705873796001...&lt;/p&gt;&#xA;&lt;p&gt;Observe that the loss is less than &lt;span class=&quot;math-container&quot;&gt;\$\sqrt{2}/2\$&lt;/span&gt; but not by much.&lt;/p&gt;&#xA;&lt;p&gt;We observe that the permutations &lt;span class=&quot;math-container&quot;&gt;\$P,Q\$&lt;/span&gt; are uninterpretable, so for these permutations, no information about the algorithm used to produce &lt;span class=&quot;math-container&quot;&gt;\$P,Q\$&lt;/span&gt; can be gained from the permutations &lt;span class=&quot;math-container&quot;&gt;\$P,Q\$&lt;/span&gt; themselves. Here, the answerer is encouraged to post the code used for generating the permutations &lt;span class=&quot;math-container&quot;&gt;\$P,Q\$&lt;/span&gt; or a description of the algorithm or technique used to produce &lt;span class=&quot;math-container&quot;&gt;\$P,Q\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;h1&gt;Meta (for sandbox only)&lt;/h1&gt;&#xA;&lt;p&gt;I have already asked a couple of questions on this site, but this question is different in several regards, so I need to sandbox this question. While the spectral radius can be computed very quickly to a high degree of accuracy, it will take much computational power to produce &lt;span class=&quot;math-container&quot;&gt;\$P,Q\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$\rho((P_2+Q_2)/2)\$&lt;/span&gt; is sufficiently small. Users with greater computational power will have a slight advantage over those without such computational power. The pair &lt;span class=&quot;math-container&quot;&gt;\$(P,Q)\$&lt;/span&gt; will also most likely contain no meaningful information about the algorithm used to obtain &lt;span class=&quot;math-container&quot;&gt;\$(P,Q)\$&lt;/span&gt;. The permutations &lt;span class=&quot;math-container&quot;&gt;\$P,Q\$&lt;/span&gt; in proposed answers will probably look exactly like random permutations and they will probably be completely uninterpretable. Finally, the loss for a pair &lt;span class=&quot;math-container&quot;&gt;\$(P,Q)\$&lt;/span&gt; shall be a real number rather than an integer.&lt;/p&gt;&#xA;&lt;p&gt;If we tried to simplify the Markov chain to the Markov chain with transitions &lt;span class=&quot;math-container&quot;&gt;\$x\mapsto P(x)\$&lt;/span&gt; with probability &lt;span class=&quot;math-container&quot;&gt;\$1/2\$&lt;/span&gt;, and &lt;span class=&quot;math-container&quot;&gt;\$x\mapsto Q(x)\$&lt;/span&gt; with probability 1/2, then I already know how to make the the doubly stochastic matrix have characteristic polynomial &lt;span class=&quot;math-container&quot;&gt;\$(x-1)x^{127}\$&lt;/span&gt; which means that all the eigenvalues except for one are zero, so we really do need to make the question as complicated as I have made it.&lt;/p&gt;&#xA;" OwnerUserId="53548" LastEditorUserId="53548" LastEditDate="2023-11-18T20:40:39.873" LastActivityDate="2023-11-18T20:40:39.873" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26122" PostTypeId="2" ParentId="2140" CreationDate="2023-11-18T21:28:48.730" Score="-3" Body="&lt;h1&gt;Generic pop-con&lt;/h1&gt;&#xA;&lt;p&gt;This is a pop-con. The objective validity criterion is that all answers are valid. Answer with most upvotes after a week will win!&lt;/p&gt;&#xA;" OwnerUserId="117478" LastActivityDate="2023-11-18T21:28:48.730" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26123" PostTypeId="2" ParentId="2140" CreationDate="2023-11-19T11:17:52.260" Score="0" Body="&lt;p&gt;I am a big fan of the famous 10 PRINT CHR$(205.5+RND(1));: GOTO 10.&#xA;This will produce a maze like pattern with random generated symbols of &lt;code&gt;/&lt;/code&gt; and &lt;code&gt;\&lt;/code&gt; with a 50% chance to be printed, and indefinitely.&#xA;Such like &lt;code&gt;///\/\\\//\/\/\\\\\/\///\&lt;/code&gt; and so on. There already exist a book about this at &lt;a href=&quot;https://10print.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://10print.org/&lt;/a&gt; which was published in 2011.&lt;/p&gt;&#xA;&lt;p&gt;I am working at a second book, which among many other things, will show this code in as many diffrent languages as possible. The book will explain how all the codes are working. The idea to this book is to show other approaches and to bring new ideas of programming.&lt;/p&gt;&#xA;&lt;p&gt;Therefore I call on you to realize the code in as many different programming languages as possible and please explain exactly how and why the code works. If possible, please the use &amp;quot;Try it online!&amp;quot; function. By publishing your codes here, you automatically declare that I may use the code in my book, for which I will of course cite you as the source.&lt;/p&gt;&#xA;&lt;p&gt;The winners are those with the shortest code for each language. However, it is also a prerequisite that the code is explained at least briefly.&lt;/p&gt;&#xA;" OwnerUserId="120307" LastEditorUserId="120307" LastEditDate="2023-11-20T08:15:57.897" LastActivityDate="2023-11-20T08:15:57.897" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26124" PostTypeId="1" CreationDate="2023-11-20T01:00:33.020" Score="1" ViewCount="84" Body="&lt;p&gt;I posted a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/266879/bingo-cards-pdf&quot;&gt;question&lt;/a&gt; in hope of starting a shortest code challenge, but it seems to attract lots of downvotes and the only answer tried to help as a programming problem. One comment on the question suggested to take help from freelancing websites.&lt;/p&gt;&#xA;&lt;p&gt;Are there some specific themes that code golf challenges have to follow on this site? My question now fulfills both criteria given on this &lt;a href=&quot;https://codegolf.stackexchange.com/help/on-topic&quot;&gt;help page&lt;/a&gt; and doesn't include the prohibited topics given on &lt;a href=&quot;https://codegolf.stackexchange.com/help/dont-ask&quot;&gt;this page&lt;/a&gt;. I missed adding the winning criteria in the original question but added it in an edit as soon as a user pointed it out.&lt;/p&gt;&#xA;&lt;p&gt;It would be great if someone could give me some actionable advice on how to improve this question or which criteria this question fails to fulfil.&lt;/p&gt;&#xA;" OwnerUserId="113678" LastActivityDate="2023-11-20T01:00:33.020" Title="Are there specific types of code golf challenges on this site?" Tags="|support|code-golf|asking-questions|" AnswerCount="0" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26125" PostTypeId="2" ParentId="2140" CreationDate="2023-11-20T09:01:23.913" Score="0" Body="&lt;h1&gt;Bingo Cards&lt;/h1&gt;&#xA;&lt;p&gt;PDF version &lt;a href=&quot;https://codegolf.stackexchange.com/questions/266879/bingo-cards-pdf&quot;&gt;here&lt;/a&gt;. SVG version &lt;a href=&quot;https://codegolf.stackexchange.com/questions/267087/bingo-cards-svg-code&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Tags: &lt;code&gt;code-golf&lt;/code&gt; &lt;code&gt;card-games&lt;/code&gt; &lt;code&gt;file-system&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Also posted &lt;a href=&quot;https://codegolf.stackexchange.com/a/266925/113678&quot;&gt;my own implementation&lt;/a&gt; as a benchmark and to encourage others to answer the question.&lt;/p&gt;&#xA;" OwnerUserId="113678" LastEditorUserId="113678" LastEditDate="2023-11-26T01:19:16.203" LastActivityDate="2023-11-26T01:19:16.203" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26126" PostTypeId="2" ParentId="2140" CreationDate="2023-11-20T10:56:54.877" Score="4" Body="&lt;h1&gt;English Golf&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge is to golf some English text by replacing some words with their contractions. Here is a list of the contractions you need to support:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Words&lt;/th&gt;&#xA;&lt;th&gt;Contraction&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;are not&lt;/td&gt;&#xA;&lt;td&gt;aren't&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;can not&lt;/td&gt;&#xA;&lt;td&gt;can't&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;could have&lt;/td&gt;&#xA;&lt;td&gt;could've&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;could not&lt;/td&gt;&#xA;&lt;td&gt;couldn't&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;dare not&lt;/td&gt;&#xA;&lt;td&gt;daren't&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;did not&lt;/td&gt;&#xA;&lt;td&gt;didn't&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;does not&lt;/td&gt;&#xA;&lt;td&gt;doesn't&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;do not&lt;/td&gt;&#xA;&lt;td&gt;don't&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;had not&lt;/td&gt;&#xA;&lt;td&gt;hadn't&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;has not&lt;/td&gt;&#xA;&lt;td&gt;hasn't&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;have not&lt;/td&gt;&#xA;&lt;td&gt;haven't&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;he had&lt;/td&gt;&#xA;&lt;td&gt;he'd&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;he is&lt;/td&gt;&#xA;&lt;td&gt;he's&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;he will&lt;/td&gt;&#xA;&lt;td&gt;he'll&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;I am&lt;/td&gt;&#xA;&lt;td&gt;I'm&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;I had&lt;/td&gt;&#xA;&lt;td&gt;I'd&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;I have&lt;/td&gt;&#xA;&lt;td&gt;I've&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;I will&lt;/td&gt;&#xA;&lt;td&gt;I'll&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;is not&lt;/td&gt;&#xA;&lt;td&gt;isn't&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;it is&lt;/td&gt;&#xA;&lt;td&gt;it's&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;it will&lt;/td&gt;&#xA;&lt;td&gt;it'll&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;let us&lt;/td&gt;&#xA;&lt;td&gt;let's&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;might have&lt;/td&gt;&#xA;&lt;td&gt;might've&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;might not&lt;/td&gt;&#xA;&lt;td&gt;mightn't&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;must have&lt;/td&gt;&#xA;&lt;td&gt;must've&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;must not&lt;/td&gt;&#xA;&lt;td&gt;mustn't&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;need not&lt;/td&gt;&#xA;&lt;td&gt;needn't&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;shall not&lt;/td&gt;&#xA;&lt;td&gt;shan't&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;she had&lt;/td&gt;&#xA;&lt;td&gt;she'd&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;she is&lt;/td&gt;&#xA;&lt;td&gt;she's&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;she will&lt;/td&gt;&#xA;&lt;td&gt;she'll&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;should have&lt;/td&gt;&#xA;&lt;td&gt;should've&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;should not&lt;/td&gt;&#xA;&lt;td&gt;shouldn't&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;that is&lt;/td&gt;&#xA;&lt;td&gt;that's&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;that will&lt;/td&gt;&#xA;&lt;td&gt;that'll&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;there had&lt;/td&gt;&#xA;&lt;td&gt;there'd&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;there is&lt;/td&gt;&#xA;&lt;td&gt;there's&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;they are&lt;/td&gt;&#xA;&lt;td&gt;they're&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;they had&lt;/td&gt;&#xA;&lt;td&gt;they'd&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;they have&lt;/td&gt;&#xA;&lt;td&gt;they've&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;they will&lt;/td&gt;&#xA;&lt;td&gt;they'll&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;was not&lt;/td&gt;&#xA;&lt;td&gt;wasn't&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;we are&lt;/td&gt;&#xA;&lt;td&gt;we're&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;we had&lt;/td&gt;&#xA;&lt;td&gt;we'd&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;we have&lt;/td&gt;&#xA;&lt;td&gt;we've&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;we will&lt;/td&gt;&#xA;&lt;td&gt;we'll&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;were not&lt;/td&gt;&#xA;&lt;td&gt;weren't&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;will not&lt;/td&gt;&#xA;&lt;td&gt;won't&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;would have&lt;/td&gt;&#xA;&lt;td&gt;would've&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;would not&lt;/td&gt;&#xA;&lt;td&gt;wouldn't&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;you are&lt;/td&gt;&#xA;&lt;td&gt;you're&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;you had&lt;/td&gt;&#xA;&lt;td&gt;you'd&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;you have&lt;/td&gt;&#xA;&lt;td&gt;you've&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;you will&lt;/td&gt;&#xA;&lt;td&gt;you'll&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;This is just a minimal list but you can support other common (please show your source) English contractions should you so wish. Most of them have one of am/are/is, had, have/has, not or will as the second word, except for &amp;quot;let us&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;If there is a choice of contraction you can choose either or go for a double contraction e.g. &amp;quot;couldn't've&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;The contraction should keep the case of the words, e.g. &amp;quot;Let us go!&amp;quot; becomes &amp;quot;Let's go!&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2023-11-20T10:56:54.877" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26127" PostTypeId="2" ParentId="10808" CreationDate="2023-11-20T18:19:46.000" Score="-2" Body="&lt;h1&gt;Neither &lt;em&gt;yes&lt;/em&gt; nor &lt;em&gt;no&lt;/em&gt;, but: &lt;em&gt;it depends&lt;/em&gt;&lt;/h1&gt;&#xA;&lt;p&gt;I completely agree with xnor's view in normal competition. People solve the challenge, get the same result, one is a little faster: why punish the slower one? I'm totally fine with that.&lt;/p&gt;&#xA;&lt;p&gt;But consider this case: &lt;a href=&quot;https://codegolf.stackexchange.com/a/132573/72726&quot;&gt;someone posts an answer&lt;/a&gt; with a verbose explanation shortly after the challenge was posted. Then, about a month later, someone else comes up with the &lt;a href=&quot;https://codegolf.stackexchange.com/a/138811/72726&quot;&gt;identical 1-byte answer&lt;/a&gt; with no explanation at all, even writing the solution is not understood. This is not about a race after such a long time. This doesn't show much skill and even less effort. This is just a sign of »I don't even care to read what others did find, I don't want to upvote other people's effort, I just want rewards for my random find.«&lt;/p&gt;&#xA;&lt;p&gt;I think, for the community's sake we should encourage people to read and value other people's answers. And some duplicates can prove that this has not been done.&lt;/p&gt;&#xA;" OwnerUserId="72726" LastActivityDate="2023-11-20T18:19:46.000" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26129" PostTypeId="2" ParentId="2140" CreationDate="2023-11-22T02:20:58.290" Score="2" Body="&lt;h1&gt;Implement the &amp;quot;Wolontis&amp;quot; Function&lt;/h1&gt;&#xA;&lt;p&gt;While looking at old ALGOL documentation with someone else on Discord, this &amp;quot;famous&amp;quot; function popped up:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/CF6IE.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/CF6IE.png&quot; alt=&quot;An image claiming to show &amp;quot;the famous Wolontis Function&amp;quot;&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Although it’s mentioned in other language manuals of the era, such as Runcible and FORTRAN, we haven't managed to find any references to this function online — so let's change that.&lt;/p&gt;&#xA;&lt;p&gt;The expression in the image is &lt;span class=&quot;math-container&quot;&gt;\$\frac{\sin x}{\sqrt{1-e^{-x^3}}}\$&lt;/span&gt;. Your task is to implement this function for positive inputs, as its value is undefined at &lt;span class=&quot;math-container&quot;&gt;\$x=0\$&lt;/span&gt; and imaginary for negative &lt;span class=&quot;math-container&quot;&gt;\$x\$&lt;/span&gt;. Floating-point inaccuracies are permitted.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-math-tooltip-container&quot;&gt;math&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Sandbox questions&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How accurate/precise should answers be required to be?&lt;/li&gt;&#xA;&lt;li&gt;What other tags should I add?&lt;/li&gt;&#xA;&lt;li&gt;Any other information I should include? e.g. would a graph be helpful?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="106545" LastEditorUserId="106545" LastEditDate="2023-11-26T18:24:16.190" LastActivityDate="2023-11-26T18:24:16.190" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26130" PostTypeId="2" ParentId="2140" CreationDate="2023-11-22T09:46:04.663" Score="1" Body="&lt;p&gt;posted: &lt;a href=&quot;https://codegolf.stackexchange.com/q/267096/119818&quot;&gt;Convert real numbers between factoradic and positive integer bases&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="119818" LastEditorUserId="119818" LastEditDate="2023-11-26T20:15:51.233" LastActivityDate="2023-11-26T20:15:51.233" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26131" PostTypeId="2" ParentId="2140" CreationDate="2023-11-22T17:28:34.810" Score="0" Body="&lt;h2&gt;Manipulate a set of pixel grids&lt;/h2&gt;&#xA;&lt;p&gt;@sandbox is this a dupe? I couldn't find one and was a bit surprised&lt;/p&gt;&#xA;&lt;p&gt;Your code should take in one input representing a number of boolean grids and one set of manipulations for each grid, and output a new set of manipulated pixel grids.&lt;/p&gt;&#xA;&lt;p&gt;The manipulations you must implement are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;a swap: two pixels which are orthogonally adjacent to each other swap places.&lt;/li&gt;&#xA;&lt;li&gt;a toggle: one pixel is toggled.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The grids may be of any rectangular dimension and will have only 2 values. All grids in any one input will be of identical dimension.&lt;/p&gt;&#xA;&lt;p&gt;Each input grid corresponds to one set of manipulations. There may be any number of manipulations for each grid, including none. A manipulation may undo what a previous manipulation did.&lt;/p&gt;&#xA;&lt;p&gt;You may choose any format for how the input grids and manipulations must be represented.&lt;/p&gt;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;input: 'aa|aa|aa;a |a | a; a|  |a ;' &#xA;2x3 grids, looks like this:&#xA;aa | a  |   a&#xA;aa | a  |    &#xA;aa |  a |  a &#xA;manipulations: '3sa6t1t;4sb1t4t1t;;' (s[a(bove)|b(elow)|l(eft)|r(ight)]=swap at index, t=toggle at index)&#xA;output: ' a|aa|a ;a | a|aa; a|  |a ;'&#xA;gridified again:&#xA; a | a  |   a&#xA;aa |  a |    &#xA;a  | aa |  a &#xA;&#xA;input: &#xA;'|█ █| ██|██ |  █|&#xA; | █ |█ █| ██|  █|&#xA; |███| ██|███|█  |'&#xA;manipulations: 'svshttsvsv/5/8/1/7/5;tttttttttt/4/3/6/8/3/;;svshsv/5/5/5;' (s[v(ertically)|h(orizontally)]=swap; tt = toggle)&#xA;output:&#xA;'|  █| ██|██ |  █|&#xA; |██ |   | ██|  █|&#xA; | ██|  █|███|█  |'&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so shortest code in each language wins. valid code takes in any size grid and gives an output grid in the same format as the input with provided swaps and toggles preformed on the grid.&lt;/p&gt;&#xA;" OwnerUserId="119818" LastEditorUserId="119818" LastEditDate="2023-11-24T04:20:02.220" LastActivityDate="2023-11-24T04:20:02.220" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26132" PostTypeId="2" ParentId="2140" CreationDate="2023-11-22T19:06:45.930" Score="0" Body="&lt;h2&gt;Draw minimalistic southpark characters&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/image-output&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;image-output&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;image-output&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-image-output-tooltip-container&quot;&gt;image-output&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-kolmogorov-complexity-tooltip-container&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your task is to output or draw this image of our favorite characters. It is obviously inspired from the logo of Southpark Digital Studios, as shown here: &lt;a href=&quot;https://southpark.cc.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://southpark.cc.com/&lt;/a&gt;, but simplified.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/fiXAZ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/fiXAZ.png&quot; alt=&quot;original&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The image has an aspect ratio of 40:12, and everything is aligned on this 40x12 grid. You must output a bitmap image of at least 40 by 12 pixels or a vector graphic.&lt;/p&gt;&#xA;&lt;p&gt;I've enlarged this images and added thin gray lines for easy pixel counting. The background should be black, white or transparent.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/65anO.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/65anO.png&quot; alt=&quot;enlarged version&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;You must use at least 12 bit color depth (4 bit per RGB channel) and these colors:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Stan:    #56a #fdb #a65&#xA;Kyle:    #f61 #fdb #3a3&#xA;Cartman: #4bc #fdb #d24&#xA;Kenny:   #f61 #743 #fdb (outer - middle - inner)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h1&gt;Open questions:&lt;/h1&gt;&#xA;&lt;p&gt;I want a transparent background, which is meaningless (or very difficult) if the image is show on screen.&lt;/p&gt;&#xA;" OwnerUserId="46901" LastEditorUserId="46901" LastEditDate="2023-11-26T13:16:40.533" LastActivityDate="2023-11-26T13:16:40.533" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26133" PostTypeId="2" ParentId="2140" CreationDate="2023-11-22T22:27:42.980" Score="2" Body="&lt;h1&gt;Compute the Kimberling Sequence&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Introduction&lt;/h1&gt;&#xA;&lt;p&gt;The &lt;a href=&quot;https://mathworld.wolfram.com/KimberlingSequence.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Kimberling Seqeunce&lt;/a&gt; is a sequence of sequences.&#xA;Each sequence is defined in terms of the previous sequence and the previous stage number.&#xA;At each stage, the numbers from the previous stage are rearranged as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;For k in [1,...,i], write term i+k and then term i-k.&lt;/li&gt;&#xA;&lt;li&gt;Discard the ith term.&lt;/li&gt;&#xA;&lt;li&gt;Write the remaining terms in order.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;We start with all positive integers at stage 0, so the first few rows look like this.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1  2  3  4  5  6  7  8  9 10 11&#xA;2  3  4  5  6  7  8  9 10 11 12&#xA;4  2  5  6  7  8  9 10 11 12 13&#xA;6  2  7  4  8  9 10 11 12 13 14&#xA;8  7  9  2 10  6 11 12 13 14 15&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;At each stage, the number on the diagonal is expelled (it is an open question as to whether every number is eventually expelled).&lt;/p&gt;&#xA;&lt;h1&gt;Challenge&lt;/h1&gt;&#xA;&lt;p&gt;Your program must take a positive integer n as input and output &lt;a href=&quot;https://oeis.org/A007063&quot; rel=&quot;nofollow noreferrer&quot;&gt;the integer expelled in forming the nth stage&lt;/a&gt; of the Kimberling sequence.&lt;/p&gt;&#xA;&lt;p&gt;Answer the following questions for your readers.&lt;/p&gt;&#xA;&lt;p&gt;Standard loopholes are forbidden. As this is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, shortest program wins.&lt;/p&gt;&#xA;&lt;h1&gt;Example Input and Output&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 -&amp;gt; 1&#xA;2 -&amp;gt; 3&#xA;3 -&amp;gt; 5&#xA;4 -&amp;gt; 4&#xA;5 -&amp;gt; 10&#xA;6 -&amp;gt; 7&#xA;7 -&amp;gt; 15&#xA;8 -&amp;gt; 8&#xA;9 -&amp;gt; 20&#xA;10 -&amp;gt; 9&#xA;11 -&amp;gt; 18&#xA;12 -&amp;gt; 24&#xA;25 -&amp;gt; 2&#xA;100 -&amp;gt; 229&#xA;1000 -&amp;gt; 394&#xA;1001 -&amp;gt; 1274&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;More test cases from &lt;a href=&quot;https://oeis.org/A007063/b007063.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;OEIS&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox Questions&lt;/h2&gt;&#xA;&lt;p&gt;This is my first code golf question, so I'm not sure what to ask other than is there anything that I can improve/need to fix before asking the main site?&lt;/p&gt;&#xA;" OwnerUserId="117598" LastActivityDate="2023-11-22T22:27:42.980" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26134" PostTypeId="2" ParentId="2140" CreationDate="2023-11-23T00:39:31.223" Score="4" Body="&lt;h1&gt;Derive an MIU string&lt;/h1&gt;&#xA;&lt;p&gt;The MU puzzle in Douglas Hofstadter's &lt;em&gt;Gödel, Escher, Bach&lt;/em&gt; involves a simple formal system called &amp;quot;MIU&amp;quot;. It works as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;MI&lt;/code&gt; is an MIU-string&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;xI&lt;/code&gt; is an MIU-string, then so is &lt;code&gt;xIU&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;Mx&lt;/code&gt; is an MIU-string, then so is &lt;code&gt;Mxx&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;xIIIy&lt;/code&gt; is an MIU-string, then so is &lt;code&gt;xUy&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If &lt;code&gt;xUUy&lt;/code&gt; is an MIU-string, then so is &lt;code&gt;xy&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Your task, given an MIU-string, is to output a derivation of that string starting with &lt;code&gt;MI&lt;/code&gt; and ending with the input string.&lt;/p&gt;&#xA;&lt;p&gt;You can assume that the input is in fact a valid MIU-string and not something illegal like &lt;code&gt;MCMLXVIII&lt;/code&gt; or (spoiler) &lt;code&gt;MU&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Instead of taking input as strings of &lt;code&gt;MIU&lt;/code&gt;, you can choose to take input as arbitrary precision integers using the digits &lt;code&gt;3&lt;/code&gt; for &lt;code&gt;M&lt;/code&gt;, &lt;code&gt;1&lt;/code&gt; for &lt;code&gt;I&lt;/code&gt; and &lt;code&gt;0&lt;/code&gt; for &lt;code&gt;U&lt;/code&gt;. In that case your output would start with &lt;code&gt;31&lt;/code&gt;, which represents &lt;code&gt;MI&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;MI&#xA;MII&#xA;MIIII&#xA;MUI&#xA;MUIU&#xA;MUIUUIU&#xA;MUIIU&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2023-11-23T00:39:31.223" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26136" PostTypeId="2" ParentId="5243" CreationDate="2023-11-24T02:10:10.773" Score="6" Body="&lt;h1&gt;200 reputation for golfing in &lt;a href=&quot;https://github.com/Vyxal/Vyxal&quot; rel=&quot;nofollow noreferrer&quot;&gt;Vyxal 3&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Note that this is separate and distinct from the other Vyxal deadlineless bounty.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Hi so Vyxal 3 exists and it's brand new and doesn't have very many answers at all. I think that needs to change, because it's a very cool language and y'all'll like it. In fact, I think you'll like it so much that you'll get free rep for using it! That's right free rep! Wonderful stuff!&lt;/p&gt;&#xA;&lt;p&gt;And I don't mean the rep you get from upvotes. I mean I will give you 200 green points if you post five (5) Vyxal 3 answers. With 200 rep you can buy, well, uh, nothing because there's no rep-to-USD exchange, but still, that's like 20 upvotes. Much rep! Much wow!&lt;/p&gt;&#xA;&lt;p&gt;Is this solicitation of golfers? Probably. Is it a form of bribery? Maybe. Will you end up wanting to stick around for more than 5 answers? I'm very confident you will!&lt;/p&gt;&#xA;&lt;p&gt;Like last time:&lt;/p&gt;&#xA;&lt;p&gt;Bounties will be suspended if rewarding the bounty dips my (lyxal's) reputation below 10k. If, on the off-chance, this bounty proves to be popular enough, I may adjust the rep I award to avoid completely tanking it.&lt;/p&gt;&#xA;&lt;p&gt;A final note: If you've already claimed the Vyxal 2 bounty, cool. Those don't count towards this bounty, so you'll need to post 5 answers in Vyxal 3.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Useful links&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://chat.stackexchange.com/rooms/106764/vyxal&quot;&gt;CGCC chatroom&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;http://vyxal.pythonanywhere.com/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Official interpreter&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/vyxal/Vyxal&quot; rel=&quot;nofollow noreferrer&quot;&gt;Repository (GitHub)&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://github.com/Vyxal/Vyxal/blob/version-3/documentation/Tour.md&quot; rel=&quot;nofollow noreferrer&quot;&gt;Tutorial&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/267048/tips-for-golfing-in-vyxal-3&quot;&gt;Tips&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Claims&lt;/h2&gt;&#xA;&lt;p&gt;Format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;|**[$username](\$link)**| link1 | link2 | link3 | link4 | link5 | ❌ | ❌ |&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;em&gt;Make sure you put spaces before and after the links so that the markdown formatter converts them to question titles when rendering. Also, &lt;strong&gt;leave the last two columns empty, those are for admin and keeping track of what's been bountied.&lt;/strong&gt;.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;User&lt;/th&gt;&#xA;&lt;th&gt;Answer 1&lt;/th&gt;&#xA;&lt;th&gt;Answer 2&lt;/th&gt;&#xA;&lt;th&gt;Answer 3&lt;/th&gt;&#xA;&lt;th&gt;Answer 4&lt;/th&gt;&#xA;&lt;th&gt;Answer 5&lt;/th&gt;&#xA;&lt;th&gt;Posted (Which Post Number)&lt;/th&gt;&#xA;&lt;th&gt;Awarded&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/96266/pacmanboss256&quot;&gt;Pacmanboss256&lt;/a&gt;&lt;/strong&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/210976/lolololololololololololol/267172#267172&quot;&gt;Lolololololololololololol&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/181958/multiplicative-persistence/267151#267151&quot;&gt;Multiplicative persistence&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/98366/count-without-3/267150#267150&quot;&gt;Count without 3&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/139243/determine-your-languages-version/267133#267133&quot;&gt;Determine your language&amp;#39;s version&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/125117/diagonal-alphabet/267132#267132&quot;&gt;Diagonal Alphabet&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;✅ (3)&lt;/td&gt;&#xA;&lt;td&gt;✅&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/106959/fmbalbuena&quot;&gt;Fmbalbuena&lt;/a&gt;&lt;/strong&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/607/find-the-factorial/267225#267225&quot;&gt;Find the Factorial!&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/32267/play-the-bzzt-game/267228#267228&quot;&gt;Play the &amp;quot;bzzt&amp;quot; game&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/63834/count-up-forever/267229#267229&quot;&gt;Count up forever&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/15546/even-or-odd-three-player/267230#267230&quot;&gt;Even or odd: three player&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/224852/drawing-the-stack-overflow-logo/267265#267265&quot;&gt;Drawing the Stack Overflow logo&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;✅ (4)&lt;/td&gt;&#xA;&lt;td&gt;✅&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/42248/nick-kennedy&quot;&gt;Nick Kennedy&lt;/a&gt;&lt;/strong&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/267039/42248&quot;&gt;Print the Christmas alphabet&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/267090/42248&quot;&gt;Limited letter renderer: BIOPD&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/267138/42248&quot;&gt;How many paint tins do I need?&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/267155/42248&quot;&gt;Finding the power sandwich&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/267293/42248&quot;&gt;80% of respondents agreed…&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;✅ (2)&lt;/td&gt;&#xA;&lt;td&gt;❌&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;&lt;strong&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/96037/math-scatk&quot;&gt;math scat&lt;/a&gt;&lt;/strong&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/269105&quot;&gt;&amp;quot;Perfect&amp;quot; an array&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/268850&quot;&gt;Output all the different counts of points&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/267321&quot;&gt;Can the chefs go?&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/267306&quot;&gt;ASCII-art milk carton&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/a/269172&quot;&gt;Validate a CPF number&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td&gt;✅ (5)&lt;/td&gt;&#xA;&lt;td&gt;❌&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&lt;/div&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2024-03-17T22:57:23.813" LastActivityDate="2024-03-17T22:57:23.813" CommentCount="2" CommunityOwnedDate="2023-11-30T04:17:45.130" ContentLicense="CC BY-SA 4.0" />
  <row Id="26137" PostTypeId="2" ParentId="2140" CreationDate="2023-11-24T15:54:29.270" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/267099/what-skill-to-train&quot;&gt;Which skill to train?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="72726" LastEditorUserId="72726" LastEditDate="2023-11-27T07:43:18.250" LastActivityDate="2023-11-27T07:43:18.250" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26139" PostTypeId="2" ParentId="2140" CreationDate="2023-11-26T20:07:29.610" Score="2" Body="&lt;h2&gt;Generate the snowflake pattern sequence&lt;/h2&gt;&#xA;&lt;p&gt;A snowflake figure looks like this:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/wwEG5.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/wwEG5.png&quot; alt=&quot;1,2,4,8&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;A few rules govern how many points each ring can have.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The innermost ring must have between 1 and 8 inclusive points.&lt;/li&gt;&#xA;&lt;li&gt;Every other ring must have between 2 and 8 inclusive points.&lt;/li&gt;&#xA;&lt;li&gt;To ensure symmetry, every ring must have a integer multiple times as many points as the next smallest ring.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Valid snowflake sequences, from the smallest to the largest ring, include: &lt;code&gt;1,2,2,6&lt;/code&gt;, &lt;code&gt;2,4,8&lt;/code&gt;, &lt;code&gt;3,6&lt;/code&gt;, &lt;code&gt;8,8,8,8,8&lt;/code&gt;, etc.&lt;/p&gt;&#xA;&lt;p&gt;Your task is, given a number, output the best configuration of rings.&lt;/p&gt;&#xA;&lt;p&gt;If there are multiple solutions, find the most aesthetically pleasing one as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The one with the most unique ring sizes&lt;/li&gt;&#xA;&lt;li&gt;Unique ring sizes being equal, the one with the biggest smallest ring. Eg. &lt;code&gt;2,6&lt;/code&gt; is better than &lt;code&gt;1,7&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;If the unique ring sizes and smallest ring are both equal, output the one with the smallest total number of rings.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If there are still multiple options, you may choose one arbitrarily.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Number&lt;/th&gt;&#xA;&lt;th&gt;Pattern&lt;/th&gt;&#xA;&lt;th&gt;Image&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;1&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/Z02Uz.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Z02Uz.png&quot; alt=&quot;1&quot; /&gt;&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;2&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/duzzA.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/duzzA.png&quot; alt=&quot;2&quot; /&gt;&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;1,2&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/PFdcY.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/PFdcY.png&quot; alt=&quot;1,2&quot; /&gt;&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;1,3&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/Kxmrl.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Kxmrl.png&quot; alt=&quot;1,3&quot; /&gt;&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;5&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;1,4&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/2Zszn.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/2Zszn.png&quot; alt=&quot;1,4&quot; /&gt;&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;6&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;2,4&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/SJNTJ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/SJNTJ.png&quot; alt=&quot;2,4&quot; /&gt;&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;7&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;1,2,4&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/uRrf9.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/uRrf9.png&quot; alt=&quot;1,2,4&quot; /&gt;&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;8&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;2,6&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/ZkNf2.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZkNf2.png&quot; alt=&quot;2,6&quot; /&gt;&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;9&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;1,2,6&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/3rbdC.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/3rbdC.png&quot; alt=&quot;1,2,6&quot; /&gt;&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;10&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;1,3,6&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/8eSRH.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/8eSRH.png&quot; alt=&quot;1,3,6&quot; /&gt;&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;11&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;1,2,8&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/82PKz.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/82PKz.png&quot; alt=&quot;1,2,8&quot; /&gt;&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;12&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;4,8&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/LPZoo.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/LPZoo.png&quot; alt=&quot;4,8&quot; /&gt;&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;13&lt;/td&gt;&#xA;&lt;td&gt;&lt;code&gt;1,4,8&lt;/code&gt;&lt;/td&gt;&#xA;&lt;td&gt;&lt;a href=&quot;https://i.stack.imgur.com/QxaLJ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/QxaLJ.png&quot; alt=&quot;1,4,8&quot; /&gt;&lt;/a&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/Z02Uz.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Z02Uz.png&quot; alt=&quot;1&quot; /&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/duzzA.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/duzzA.png&quot; alt=&quot;2&quot; /&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/PFdcY.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/PFdcY.png&quot; alt=&quot;1,2&quot; /&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/Kxmrl.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/Kxmrl.png&quot; alt=&quot;1,3&quot; /&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/2Zszn.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/2Zszn.png&quot; alt=&quot;1,4&quot; /&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/SJNTJ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/SJNTJ.png&quot; alt=&quot;2,4&quot; /&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/uRrf9.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/uRrf9.png&quot; alt=&quot;1,2,4&quot; /&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/ZkNf2.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/ZkNf2.png&quot; alt=&quot;2,6&quot; /&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/3rbdC.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/3rbdC.png&quot; alt=&quot;1,2,6&quot; /&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/8eSRH.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/8eSRH.png&quot; alt=&quot;1,3,6&quot; /&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/82PKz.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/82PKz.png&quot; alt=&quot;1,2,8&quot; /&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/LPZoo.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/LPZoo.png&quot; alt=&quot;4,8&quot; /&gt;&lt;/a&gt;&#xA;&lt;a href=&quot;https://i.stack.imgur.com/QxaLJ.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/QxaLJ.png&quot; alt=&quot;1,4,8&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-11-29T13:11:26.897" LastActivityDate="2023-11-29T13:11:26.897" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26140" PostTypeId="2" ParentId="2140" CreationDate="2023-11-26T22:16:40.347" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/267257/write-the-date-in-abbreviated-latin&quot;&gt;Write the date in abbreviated Latin&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96480" LastEditorUserId="96480" LastEditDate="2023-12-03T18:00:48.293" LastActivityDate="2023-12-03T18:00:48.293" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="26141" PostTypeId="2" ParentId="2140" CreationDate="2023-11-26T22:32:05.137" Score="1" Body="&lt;h1&gt;Prefix-Suffix equality, part 1&lt;/h1&gt;&#xA;&lt;p&gt;Given an array of two distinct byte-sized values, please perform the following operations or their equivalent:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Construct an array of its nontrival prefixes and suffixes, starting with the array itself and working down to its first and last elements.&lt;/li&gt;&#xA;&lt;li&gt;Compare each element of the two arrays elementwise, with the result &lt;code&gt;1&lt;/code&gt; if the two elements are identical and &lt;code&gt;0&lt;/code&gt; if they are not.&lt;/li&gt;&#xA;&lt;li&gt;Taking the array of &lt;code&gt;1&lt;/code&gt;s and &lt;code&gt;0&lt;/code&gt;s, interpret that as a number in base &lt;code&gt;2&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Double this number.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The result turns out to be the expected number of uniformly random selections between your original two values to get the input array.&lt;/p&gt;&#xA;&lt;p&gt;Example using &lt;code&gt;H&lt;/code&gt; and &lt;code&gt;T&lt;/code&gt; as the two byte-sized values:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;HTTHT  HTTHT   1&#xA;HTTH    TTHT   0&#xA;HTT      THT   0&#xA;HT        HT   1&#xA;H          T   0&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Converting &lt;code&gt;10010&lt;/code&gt; to decimal gives &lt;code&gt;18&lt;/code&gt;, which is then doubled to give the final result of &lt;code&gt;36&lt;/code&gt;. This is the expected number of coin tosses to produce the pattern &lt;code&gt;HTTHT&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2023-11-26T22:32:05.137" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26142" PostTypeId="2" ParentId="2140" CreationDate="2023-11-27T00:57:25.743" Score="4" Body="&lt;h1&gt;Classify a Coxeter group&lt;/h1&gt;&#xA;&lt;p&gt;In this challenge you will take as input a Coxeter matrix representing a Coxeter system. Your program will then classify it as one of the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Spherical&lt;/li&gt;&#xA;&lt;li&gt;Euclidean&lt;/li&gt;&#xA;&lt;li&gt;Compact&lt;/li&gt;&#xA;&lt;li&gt;Paracompact&lt;/li&gt;&#xA;&lt;li&gt;Hypercompact&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Your program should output one of 5 distinct values depending on which category the input falls into.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;. The goal is to minimize the size of your source code as measured in bytes.&lt;/p&gt;&#xA;&lt;h2&gt;Spherical (finite)&lt;/h2&gt;&#xA;&lt;p&gt;A Coxeter system is spherical iff it is finite.&lt;/p&gt;&#xA;&lt;h2&gt;Euclidean (affine)&lt;/h2&gt;&#xA;&lt;p&gt;A Coxeter system is Euclidean iff the determinant of its Schläfli matrix is 0.&lt;/p&gt;&#xA;&lt;p&gt;TODO better definition of this, or explain what a Schläfli matrix is.&lt;/p&gt;&#xA;&lt;h2&gt;Compact&lt;/h2&gt;&#xA;&lt;p&gt;A Coxeter system is compact iff every strict minor of its Coxeter matrix gives a finite group (and it is not itself spherical or Euclidean). That is every way to remove one generator from the system gives a spherical group.&lt;/p&gt;&#xA;&lt;h2&gt;Paracompact&lt;/h2&gt;&#xA;&lt;p&gt;A Coxeter system is compact iff every strict minor of its Coxeter matrix gives a spherical or Euclidean group (and it is not sperical, Euclidean or compact). That is every way to remove one generator from the group gives a spherical or Euclidean group group.&lt;/p&gt;&#xA;&lt;h2&gt;Hypercompact&lt;/h2&gt;&#xA;&lt;p&gt;If a Coxeter system is not any of the above then it is called &lt;strong&gt;hypercompact&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&lt;p&gt;I had this idea, but haven't had enough time to write up a specification. I'll explain things better later, define a Coxeter system and give the enumerations of each class.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2024-01-30T05:21:50.077" LastActivityDate="2024-01-30T05:21:50.077" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26143" PostTypeId="2" ParentId="2140" CreationDate="2023-11-27T11:48:52.093" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/267180/just-another-traffic-jam&quot;&gt;Just another traffic jam!&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="72726" LastEditorUserId="72726" LastEditDate="2023-11-29T22:03:00.737" LastActivityDate="2023-11-29T22:03:00.737" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26144" PostTypeId="2" ParentId="2140" CreationDate="2023-11-28T12:57:41.460" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;number&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-number-tooltip-container&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/natural-language&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;natural-language&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;natural-language&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-natural-language-tooltip-container&quot;&gt;natural-language&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Read a French number&lt;/h1&gt;&#xA;&lt;p&gt;We have &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35435/spell-out-numbers-in-french&quot;&gt;Spell out numbers in French&lt;/a&gt;, &lt;a href=&quot;https://codegolf.stackexchange.com/questions/117737/translate-numbers-to-french&quot;&gt;Translate numbers to French&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/58738/telling-time-in-french/&quot;&gt;Telling time in French&lt;/a&gt;, but we were missing the reverse:&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Read a French expression, and output the corresponding integer.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;In true French, a French number expression is a list of French words separated by whitespace, and possibly by hyphens &lt;code&gt;&amp;quot;-&amp;quot;&lt;/code&gt; and the word &lt;code&gt;&amp;quot;et&amp;quot;&lt;/code&gt;, such as &lt;code&gt;&amp;quot;sept mille deux cent vingt-et-un&amp;quot;&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For this challenge, you do not need to care about hyphens and the word &lt;code&gt;&amp;quot;et&amp;quot;&lt;/code&gt;: you are free to take input as a whitespace-separated string of words such as &lt;code&gt;&amp;quot;sept mille deux cent vingt un&amp;quot;&lt;/code&gt;, or as a list of single-word strings such as &lt;code&gt;[&amp;quot;sept&amp;quot;, &amp;quot;mille&amp;quot;, &amp;quot;deux&amp;quot;, &amp;quot;cent&amp;quot;, &amp;quot;vingt&amp;quot;, &amp;quot;un&amp;quot;]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;All French words will be taken from the following list:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;        'zero': 0, 'un': 1, 'deux': 2, 'trois': 3, 'quatre': 4,&#xA;        'cinq': 5, 'six': 6, 'sept': 7, 'huit': 8, 'neuf': 9,&#xA;        'dix': 10, 'onze': 11, 'douze': 12, 'treize': 13,&#xA;        'quatorze': 14, 'quinze': 15, 'seize': 16,&#xA;        'vingt': 20, 'trente': 30, 'quarante': 40, 'cinquante': 50,&#xA;        'soixante': 60,&#xA;        'cent': 100, 'mille': 1000, 'million': 1000000, 'milliard': 1000000000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Note that in correct French, &lt;code&gt;&amp;quot;million&amp;quot;&lt;/code&gt; and &lt;code&gt;&amp;quot;milliard&amp;quot;&lt;/code&gt; must take an &lt;code&gt;-s&lt;/code&gt; in plural form, but for this challenge you do not need to care about that. &amp;quot;zéro&amp;quot; also must take an accent on the &amp;quot;e&amp;quot;, but you do not need to care about that. &amp;quot;un&amp;quot; must be &amp;quot;une&amp;quot; in feminine form, but you do not need to care about that.&lt;/p&gt;&#xA;&lt;p&gt;Also note that if we simply added &lt;code&gt;&amp;quot;septante: 70, octante: 80, huitante: 80, nonante: 90&amp;quot;&lt;/code&gt; then we would be able to handle Belgian French and Swiss French, but for this challenge you do not need to care about that.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;Output one integer, corresponding to the French input number.&lt;/p&gt;&#xA;&lt;h2&gt;Conversion rule&lt;/h2&gt;&#xA;&lt;p&gt;Once the sequence of French words has been converted into a sequence of numbers, this sequence can be converted into one number by identifying the largest number in the sequence, then using one simple recurrence rule:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;convert(left, largest, right) = convert(left) * largest + convert(right)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;with of course the special cases that &lt;code&gt;convert(empty left sequence) = 1&lt;/code&gt; and &lt;code&gt;convert(empty right sequence) = 0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For instance:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;sept mille deux cent vingt un&amp;quot;&#xA;[7    1000  2    100  20    1]&#xA;[7] * 1000 + [2 100 20 1]&#xA;7000 + ([2] * 100 + [20 1])&#xA;7000 + (200 + ([] * 20 + [1]))&#xA;7221&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;sept mille deux cent vingt un&amp;quot;     -&amp;gt;  7221&#xA;&amp;quot;soixante douze cent vingt un&amp;quot;      -&amp;gt;  7221&#xA;&amp;quot;dix sept cent quatre vingt neuf&amp;quot;   -&amp;gt;  1789&#xA;&amp;quot;mille sept cent quatre vingt neuf&amp;quot; -&amp;gt;  1789&#xA;&amp;quot;trois mille neuf cent quatre vingt dix sept&amp;quot; -&amp;gt; 3997&#xA;&amp;quot;cent mille milliard cent trente sept million trois cent quatre vingt quinze mille huit cent cinq&amp;quot;&#xA;    -&amp;gt;  100_000_137_395_805&#xA;&amp;quot;zero&amp;quot;                 -&amp;gt; 0&#xA;&amp;quot;un milliard dix sept&amp;quot; -&amp;gt; 1_000_000_017&#xA;&amp;quot;mille&amp;quot;                -&amp;gt; 1000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is code-golf, the shortest code in bytes wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="96480" LastActivityDate="2023-11-28T12:57:41.460" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26145" PostTypeId="2" ParentId="2140" CreationDate="2023-11-29T22:08:18.970" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/267214/72726&quot;&gt;One-dimensional map colouring&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="72726" LastEditorUserId="72726" LastEditDate="2023-12-01T06:32:28.747" LastActivityDate="2023-12-01T06:32:28.747" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26146" PostTypeId="2" ParentId="2140" CreationDate="2023-11-30T02:38:41.000" Score="-1" Body="&lt;h1&gt;Write a check&lt;/h1&gt;&#xA;&lt;p&gt;Given the check (cheque, for non-Americans) number, payee, amount, and memo as input, print or return a check in this format:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+------------------------------------------------------------------------------+&#xA;| John and Jane Doe                                                      ***** |&#xA;| 123 Pine St.                                                                 |&#xA;| Anytown, USA 12345                                Date: ____________________ |&#xA;|                                                                              |&#xA;| Pay to the                                                                   |&#xA;|   order of _____________________________________________________ $__________ |&#xA;|                                                                              |&#xA;| ________________________________________________________________ DOLLARS     |&#xA;|                                                                              |&#xA;| First Bank of Code Golf - Anytown, USA                                       |&#xA;|                                                                              |&#xA;| For ________________________________  AUTHORIZED-SIGNATURE-JOHN-AND-JANE-DOE |&#xA;|                                                                              |&#xA;| [314159265[  2718281828/  *****                                              | &#xA;+------------------------------------------------------------------------------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Parts marked with underscores are for the account holder to fill out, while parts with asterisks are printed on the check.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Fill out the check number in the top-right corner, left-padded with spaces. Check 101 has &lt;code&gt;  101&lt;/code&gt; in place of the asterisks.&lt;/li&gt;&#xA;&lt;li&gt;Fill out the check number on the bottom, left-padded with zeros. Check 101 has &lt;code&gt;00101&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Anywhere the user writes, leave one underscore before the user's writing and as many afterwards as necessary to fill the space. You may assume your program will not be given input that will overflow any of the fields.&lt;/li&gt;&#xA;&lt;li&gt;Write the current date in the format &lt;code&gt;November 2, 2023&lt;/code&gt; (&lt;code&gt;%B %-d, %Y&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Write the numerical amount in the format &lt;code&gt;1,234.56&lt;/code&gt;. The comma is required for amounts greater than or equal to $1,000.&lt;/li&gt;&#xA;&lt;li&gt;Write out the amount in the format &amp;quot;One thousand two hundred thirty-four and 56/100&amp;quot;. Pad the rest of the field for it with hyphens (&lt;code&gt;-&lt;/code&gt;), except one underscore at the end.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Here is an example of check #9876 written on September 30, 2023, paying $1,234.56 to &lt;code&gt;Acme Inc.&lt;/code&gt; for a &lt;code&gt;Widget purchase&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;+------------------------------------------------------------------------------+&#xA;| John and Jane Doe                                                       9876 |&#xA;| 123 Pine St.                                                                 |&#xA;| Anytown, USA 12345                                Date: _September 30, 2023_ |                &#xA;|                                                                              |&#xA;| Pay to the                                                                   |&#xA;|   order of _Acme Inc.___________________________________________ $_1,234.56_ |        &#xA;|                                                                              |&#xA;| _One thousand two hundred thirty-four and 56/100---------------_ DOLLARS     |                           &#xA;|                                                                              |&#xA;| First Bank of Code Golf - Anytown, USA                                       |&#xA;|                                                                              |&#xA;| For _Widget purchase________________  AUTHORIZED-SIGNATURE-JOHN-AND-JANE-DOE |             &#xA;|                                                                              |&#xA;| [314159265[  2718281828/  09876                                              |&#xA;+------------------------------------------------------------------------------+&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Standard loopholes are prohibited. You may write a function or a complete program, and you may output the check to stdout or return it either as a newline-delimited string or as a list of strings. A trailing newline is optional.&lt;/p&gt;&#xA;" OwnerUserId="112554" LastEditorUserId="112554" LastEditDate="2023-12-02T03:24:33.343" LastActivityDate="2023-12-02T03:24:33.343" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="26148" PostTypeId="2" ParentId="2140" CreationDate="2023-11-30T14:24:58.183" Score="1" Body="&lt;h1&gt;Deja vu&lt;/h1&gt;&#xA;&lt;p&gt;Given two arrays, let's call them a and b, and a number n, your task is to see if there exists a subarray in a so that that subarray's sum is n and there is a subarray in b that also sums to n and has the same length. You may assume that all elements in a and b are positive integers, and so is n.&lt;/p&gt;&#xA;&lt;p&gt;For example, if a is &lt;code&gt;[1, 2, 3, 4, 5]&lt;/code&gt;, b is &lt;code&gt;[2, 2 ,2, 6, 7]&lt;/code&gt; and n is 6, the output would be truthy because 1 + 2 + 3 = 6 in a and 2 + 2 + 2 = 6 in b.&lt;/p&gt;&#xA;&lt;h1&gt;Test cases&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1, 2, 3, 4, 5] [2, 2, 2, 6, 7], 6 =&amp;gt; True&#xA;[] [] 0 =&amp;gt; True&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Shortest code wins!&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;More test cases coming soon&lt;/li&gt;&#xA;&lt;li&gt;Not sure if Deja vu is a good title or not&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="105116" LastActivityDate="2023-11-30T14:24:58.183" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26150" PostTypeId="2" ParentId="2140" CreationDate="2023-11-30T19:20:55.843" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/267442/118045&quot;&gt;Implement a simple stack language&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118045" LastEditorUserId="118045" LastEditDate="2023-12-11T08:17:44.607" LastActivityDate="2023-12-11T08:17:44.607" CommentCount="10" ContentLicense="CC BY-SA 4.0" />
  <row Id="26153" PostTypeId="2" ParentId="2140" CreationDate="2023-12-01T13:59:27.277" Score="2" Body="&lt;h1&gt;Parse nested absolute values&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/267296/parse-nested-absolute-values&quot;&gt;Part1&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/267297/parse-nested-absolute-values-2&quot;&gt;Part2&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="118682" LastEditorUserId="118682" LastEditDate="2023-12-05T13:02:33.423" LastActivityDate="2023-12-05T13:02:33.423" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26157" PostTypeId="2" ParentId="2140" CreationDate="2023-12-02T19:01:53.720" Score="4" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/267394/66833&quot;&gt;Construct the Constructability sequence&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="66833" LastEditorUserId="66833" LastEditDate="2023-12-09T05:47:46.130" LastActivityDate="2023-12-09T05:47:46.130" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26158" PostTypeId="2" ParentId="2140" CreationDate="2023-12-04T07:47:47.027" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/267346/72726&quot;&gt;Night hike partitioning&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="72726" LastEditorUserId="72726" LastEditDate="2023-12-07T07:44:00.620" LastActivityDate="2023-12-07T07:44:00.620" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26159" PostTypeId="2" ParentId="2140" CreationDate="2023-12-04T19:53:07.810" Score="1" Body="&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Create a sorting algorithm in as few bytes as possible. It can be, at worst, &lt;span class=&quot;math-container&quot;&gt;\$ O(n^2) \$&lt;/span&gt;. This can be insertion sort, mergesort, quicksort, or any other sorting algorithm with &lt;span class=&quot;math-container&quot;&gt;\$O(n^2)\$&lt;/span&gt; time complexity.&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;An array of numbers, such as &lt;code&gt;[1,2,3]&lt;/code&gt; or &lt;code&gt;[41,17,8]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;You can print an array of numbers in order, or you can print them (ordered) one by one. Sorting &lt;code&gt;[3,1,2]&lt;/code&gt; could return:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;[1,2,3]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;or&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1&#xA;2&#xA;3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Program must run in &lt;span class=&quot;math-container&quot;&gt;\$ O(n^2) \$&lt;/span&gt; time or better&lt;/li&gt;&#xA;&lt;li&gt;The program cannot use any sorting functions, libraries, etc. You can, however create a function that sorts, but it must be made from scratch in your program.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;[0,1,2,3] -&amp;gt; [0,1,2,3]&#xA;&#xA;[5,2,8,91,4,6] -&amp;gt; [2,4,5,6,8,91]&#xA;&#xA;[16,42,13,2,71] -&amp;gt; [2,13,16,42,71]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="120440" LastEditorUserId="120440" LastEditDate="2023-12-05T14:39:49.800" LastActivityDate="2023-12-05T14:39:49.800" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="26160" PostTypeId="2" ParentId="20722" CreationDate="2023-12-04T22:53:55.353" Score="1" Body="&lt;p&gt;Username: Like user, I'm just not very creative.&lt;/p&gt;&#xA;&lt;p&gt;Icon: It's my default identicon, edited to permanently keep my Winter Bash 2022 hat.&lt;/p&gt;&#xA;" OwnerUserId="112554" LastActivityDate="2023-12-04T22:53:55.353" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26161" PostTypeId="2" ParentId="2140" CreationDate="2023-12-05T07:42:20.363" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/267439/72726&quot;&gt;Auto-golf an esolang&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="72726" LastEditorUserId="72726" LastEditDate="2023-12-11T06:48:16.080" LastActivityDate="2023-12-11T06:48:16.080" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26162" PostTypeId="2" ParentId="5243" CreationDate="2023-12-06T02:17:09.143" Score="2" Body="&lt;h1&gt;200 rep for Chef answer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/267313/can-the-chefs-go&quot;&gt;Can the chefs go?&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;I will award a 200 reputation bounty to the first person to submit a working solution to &amp;quot;Can the chefs go?&amp;quot; in &lt;a href=&quot;https://esolangs.org/wiki/Chef&quot; rel=&quot;nofollow noreferrer&quot;&gt;Chef&lt;/a&gt;.&lt;/p&gt;&#xA;" OwnerUserId="112554" LastEditorUserId="112554" LastEditDate="2023-12-18T17:08:25.443" LastActivityDate="2023-12-18T17:08:25.443" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26163" PostTypeId="2" ParentId="2140" CreationDate="2023-12-06T16:07:35.843" Score="1" Body="&lt;h1&gt;Pi to n digits&lt;/h1&gt;&#xA;&lt;p&gt;Calculate &lt;span class=&quot;math-container&quot;&gt;\$π\$&lt;/span&gt; to n digits - no overshooting. The input will be a positive integer or 0. Your program should output &lt;span class=&quot;math-container&quot;&gt;\$π\$&lt;/span&gt; displayed with &lt;em&gt;exactly&lt;/em&gt; n digits (not counting '3.'). You cannot use any function that uses or returns pi under the hood. Standard loopholes are not allowed.&lt;/p&gt;&#xA;&lt;p&gt;This is code golf, so shortest code in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="120440" LastActivityDate="2023-12-06T16:07:35.843" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26164" PostTypeId="2" ParentId="2140" CreationDate="2023-12-06T19:02:37.797" Score="4" Body="&lt;h2&gt;Cyclically Sort a List&lt;/h2&gt;&#xA;&lt;p&gt;Given a list of Integers greater than zero, Sort each of the unique values in ascending order, then repeat the process on the remaining duplicate values and append.&lt;/p&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1,5,2,2,8,3,5,2,9] ==&amp;gt; [1,2,3,5,8,9,2,5,2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sorting&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sorting&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-sorting-tooltip-container&quot;&gt;sorting&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="96266" LastActivityDate="2023-12-06T19:02:37.797" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26165" PostTypeId="2" ParentId="2140" CreationDate="2023-12-07T08:38:30.063" Score="-1" Body="&lt;h1&gt;All good regex come in threes&lt;/h1&gt;&#xA;&lt;p&gt;We've had challenges about &lt;a href=&quot;https://codegolf.stackexchange.com/q/22648/72726&quot;&gt;two regex matching each other but not themselves&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/q/129941/72726&quot;&gt;a complicated relationship of five regex&lt;/a&gt;, but don't they say that all good things come in threes?&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Write a chain of three regex, each one matching the next, but neither itself not the previous one&lt;/li&gt;&#xA;&lt;li&gt;Thus, of our three regex, RE1 will only match RE2, RE2 will only match RE3 and RE3 will only match RE1&lt;/li&gt;&#xA;&lt;li&gt;Don't ask about slashes. We are talking about regular expressions, not slashes. Even if some languages use slashes as one way to delimit regular expressions, the slashes are not part of the regular expressions, so they are not part of the challenge&lt;/li&gt;&#xA;&lt;li&gt;If you use an extension to the POSIX regex standard, define our dialect and compete in that dialect league. Champions league is pure POSIX basic regular expressions&lt;/li&gt;&#xA;&lt;li&gt;This is regex golf, so the shortest sum of the three lengths wins&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="72726" LastActivityDate="2023-12-07T08:38:30.063" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26166" PostTypeId="2" ParentId="2140" CreationDate="2023-12-07T16:37:06.977" Score="1" Body="&lt;p&gt;&lt;strong&gt;Is your license plate Tetris-compliant?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Write a program that outputs a truthy value if the letters in its input are only letters that name Tetris pieces (I, J, L, O, S, T, Z), and a falsy value if otherwise.&lt;/p&gt;&#xA;&lt;p&gt;Input: A string. You can assume it is either empty, or contains only numbers, letters in a case of your choice, and spaces.&lt;/p&gt;&#xA;&lt;p&gt;Output: A truthy value (printing &lt;code&gt;true&lt;/code&gt; or &lt;code&gt;1&lt;/code&gt; to the console is fine) if there are no letters in the input, OR if all the letters are from the set &lt;code&gt;{I, J, L, O, S, T, Z}&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Objective: Code golf, so lowest score wins! Standard per-language scoring rules apply, so bytes for C#/Java/etc., codels for Piet, and so forth.&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;&amp;quot; =&amp;gt; true&#xA;&amp;quot;1234&amp;quot; =&amp;gt; true&#xA;&amp;quot;123 TOL&amp;quot; =&amp;gt; true&#xA;&amp;quot;9584K94LSZ&amp;quot; =&amp;gt; false&#xA;&amp;quot;HELLO WORLD&amp;quot; =&amp;gt; false&#xA;&amp;quot;LLO OL&amp;quot; =&amp;gt; true&#xA;&amp;quot;876 TSL 234 IOT&amp;quot; =&amp;gt; true,&#xA;&amp;quot;123 tol&amp;quot; =&amp;gt; true&#xA;&amp;quot; &amp;quot; =&amp;gt; true&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Reference function:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-csharp prettyprint-override&quot;&gt;&lt;code&gt;public static bool IsTetrisCompliant(string s)&#xA;{&#xA;    var tetrisLetters = new[] { 'i', 'o', 't', 's', 'z', 'j', 'l' };&#xA;    var letters = s.ToLowerInvariant().Where(c =&amp;gt; char.IsLetter(c));&#xA;    return letters.All(l =&amp;gt; tetrisLetters.Contains(l));&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Good luck!&lt;/p&gt;&#xA;" OwnerUserId="29840" LastActivityDate="2023-12-07T16:37:06.977" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26167" PostTypeId="2" ParentId="2140" CreationDate="2023-12-08T09:26:53.900" Score="3" Body="&lt;h1&gt;Output 5-line calendar&lt;/h1&gt;&#xA;&lt;p&gt;Given year, month and optionally weekday of 1st, output the calendar of the month.&lt;/p&gt;&#xA;&lt;p&gt;For empty cell, fill it with the date where it's supposed to be, in last or next month, and add &lt;code&gt;#&lt;/code&gt; to indicate gray. If last few days can't fit in 5 lines, then they share last line with 5th week, use &lt;code&gt;/&lt;/code&gt; to separate two days.&lt;/p&gt;&#xA;&lt;p&gt;Sample Input: &lt;code&gt;Nov 2023&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Sample Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; #28   #29   #30     1     2     3     4&#xA;   5     6     7     8     9    10    11&#xA;  12    13    14    15    16    17    18&#xA;  19    20    21    22    23    24    25&#xA;  26    27    28    29    30    #1    #2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Sample Input: &lt;code&gt;Dec 2023&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Sample Output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; #26   #27   #28   #29   #30     1     2&#xA;   3     4     5     6     7     8     9&#xA;  10    11    12    13    14    15    16&#xA;  17    18    19    20    21    22    23&#xA;24/31   25    26    27    28    29    30&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Outputting a 2D array of string is fine&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2023-12-08T15:53:14.490" LastActivityDate="2023-12-08T15:53:14.490" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26168" PostTypeId="2" ParentId="5243" CreationDate="2023-12-09T03:35:36.683" Score="0" Body="&lt;h1&gt;200-400 Rep for Sub-Quadratic Trilangle Meta-Cat&lt;/h1&gt;&#xA;&lt;p&gt;I just submitted &lt;a href=&quot;https://codegolf.stackexchange.com/a/267393/106545&quot;&gt;a Trilangle answer&lt;/a&gt; for the meta-cat &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/test-battery&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;test-battery&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-test-battery-tooltip-container&quot;&gt;test-battery&lt;/a&gt; question. I am offering a bounty to an answer that meets the following criteria:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Baseline +200 for a program that&#xA;&lt;ul&gt;&#xA;&lt;li&gt;has an output that grows asymptotically slower than &lt;span class=&quot;math-container&quot;&gt;\$O(n^2)\$&lt;/span&gt; on the size of the input,&lt;/li&gt;&#xA;&lt;li&gt;gives a shorter output than my answer for at least one of the test programs, and&lt;/li&gt;&#xA;&lt;li&gt;can handle spaces in the input and empty input, since those aren't covered in the tests.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;An additional +100 if the code is on a grid of size 15 or smaller (my code is on a grid of size 14).&lt;/li&gt;&#xA;&lt;li&gt;An additional +100 if the code does not rely on any &amp;quot;implementation-defined&amp;quot; or &amp;quot;undefined&amp;quot; behavior. You can check this with the &amp;quot;Errors&amp;quot; field of the online interpreter, and both the program itself and its output program matter.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If an answer takes the baseline +200 but not the additional +100 bonus(es), I will award an individual +100 to an answer that meets both the baseline criteria and the unclaimed bonus.&lt;/p&gt;&#xA;" OwnerUserId="106545" LastActivityDate="2023-12-09T03:35:36.683" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26169" PostTypeId="2" ParentId="2140" CreationDate="2023-12-10T03:46:22.827" Score="1" Body="&lt;h1&gt;Optimal infinite monkeys: output Shakespeare with the highest probability&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-challenge-tooltip-container&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/optimization&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;optimization&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-optimization-tooltip-container&quot;&gt;optimization&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/compression&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;compression&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-compression-tooltip-container&quot;&gt;compression&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;This challenge is something of a sequel to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/152856/write-moby-dick-approximately&quot;&gt;Write Moby Dick, approximately&lt;/a&gt;, but the mechanics and scoring system are quite different, and I expect it to lead to quite a different challenge.&lt;/p&gt;&#xA;&lt;p&gt;We all know that a monkey hammering out random bytes will output the works of Shakespeare with some probability. This probability is extremely low.&lt;/p&gt;&#xA;&lt;p&gt;But what if the monkey would type out a computer program instead, and then we run the computer program and see if &lt;em&gt;that&lt;/em&gt; outputs the works of Shakespeare? The program might itself behave randomly, but in such a way that the probability of outputting Shakespeare is much higher overall.&lt;/p&gt;&#xA;&lt;p&gt;The essence of this challenge is to maximise the following probability:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;p(the monkey outputs your program) * p(your program outputs the works of Shakespeare)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;To make that work as a practical challenge we will have to fake the randomness. Your program will not really behave randomly but will output probabilities instead, so that we can calculate the probability that your program outputs the works of Shakespeare, even if that probability is astronomically low.&lt;/p&gt;&#xA;&lt;h2&gt;more details&lt;/h2&gt;&#xA;&lt;p&gt;The following file contains the complete works of Shakespeare in ASCII format. &lt;strong&gt;[to do: create the file and upload it somewhere]&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your program is meant to represent a random process that &lt;em&gt;might&lt;/em&gt; output the works of Shakespeare with some probability. But depending on how your program works that probability might be so low that it would never practically happen. So instead of using a random number generator, every time your program would output a letter it will output a probability distribution instead. Another program will keep track of the total probability.&lt;/p&gt;&#xA;&lt;p&gt;It works like this: your program (or function etc.) will be called multiple times (about 3,500,000 times). On each invocation it will be given the first &lt;em&gt;n&lt;/em&gt; characters of &lt;code&gt;shakespeare.txt&lt;/code&gt;. Its output will be a probability distribution over ASCII characters, which is its probability of guessing a given next character. This output can be in any reasonable format - for example, it could be a Python array of 128 floats. But it must be a probability distribution, i.e. in this example the floats must sum to 1.&lt;/p&gt;&#xA;&lt;p&gt;The following pseudocode shows how your score is calculated:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;log_p_monkey_outputs_program = -(size of your submission in bytes)*8&#xA;&#xA;log_p_program_outputs_shakespeare = 0&#xA;target_text = contents of shakespeare.txt&#xA;for n = 1 to length(target_text)-1&#xA;    probabilities = your_program(first n characters of target_text)&#xA;    correct_prob = probabilities[(n+1)th character of target_text]&#xA;    log_p_program_outputs_shakespeare += log2(correct_prob)&#xA;&#xA;score = log_p_monkey_outputs_program + log_p_program_outputs_shakespeare&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The score that this program calculates is the logarithm of the probability that the monkey outputs your program and your program then outputs Shakespeare, assuming that we always feed the program's output back in as input. We calculate the logarithm to avoid floating point errors, as the final probability will be extremely small.&lt;/p&gt;&#xA;&lt;p&gt;Note that the logarithm is to base 2. If your language doesn't provide the &lt;code&gt;log2&lt;/code&gt; function you should use &lt;code&gt;log(correct_prob)/log(2)&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;If the scoring program is implemented correctly, the score will always be negative. A higher score (closer to 0) is better.&lt;/p&gt;&#xA;&lt;p&gt;Note that your program outputs a probability distribution but it should not itself behave randomly. Your program &lt;strong&gt;may not&lt;/strong&gt; use a random number generator - it must always return the same probability distribution for a given input.&lt;/p&gt;&#xA;&lt;p&gt;If you want to store state in between invocations this is allowed. You can do this by writing to an external file, by using &lt;code&gt;static&lt;/code&gt; or global variables, by submitting a class rather than a function, using a state monad, or whatever else works for your language.&lt;/p&gt;&#xA;&lt;h2&gt;Submission format&lt;/h2&gt;&#xA;&lt;p&gt;Your submission should include the following, which &lt;strong&gt;do&lt;/strong&gt; count towards the size of your submission. If they are excessively large you can link to github etc.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;your program&lt;/li&gt;&#xA;&lt;li&gt;any data it needs in order to run&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Your submission should also include the following, which &lt;strong&gt;don't&lt;/strong&gt; count towards its size:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;the code used to calculate its score, implementing the pseudocode above (this doesn't need to be in the same language as your submission). Please don't golf this.&lt;/li&gt;&#xA;&lt;li&gt;any code that was used to generate your submission (e.g. to create any data files that you included)&lt;/li&gt;&#xA;&lt;li&gt;an explanation of how your submission works.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;As mentioned, your program must run deterministically, so that it always outputs the same probability distribution given the same input (and hence always gets the same score).&lt;/p&gt;&#xA;&lt;p&gt;If at any time the value of &lt;code&gt;correct_prob&lt;/code&gt; in the scoring pseudocode is 0, then your score is -∞, which is the worst possible score.&lt;/p&gt;&#xA;&lt;p&gt;You &lt;strong&gt;may not&lt;/strong&gt; use any libraries or functions that your language might have that include data or statistics about natural language. This includes pre-trained neural networks, word lists, etc. It also includes any built-in function that outputs any of Shakespeare's works. It's fine to use neural networks and word lists etc., but the data or weights must be included in your submission and count towards its byte count.&lt;/p&gt;&#xA;&lt;p&gt;You &lt;strong&gt;may not&lt;/strong&gt; use any libraries or functions designed for compressing or decompressing data. It's fine to use algorithms like bzip etc., but you have to implement them yourself (and hence include the implementation in your byte count).&lt;/p&gt;&#xA;&lt;p&gt;If you want to store state between invocations you can do this however you like, as long as your program never has access to 'future' bytes from the &lt;code&gt;shakespeare.txt&lt;/code&gt; file. (So, for example, you can't just pass it a string containing all of the input and get back a big list of probability distributions as output.)&lt;/p&gt;&#xA;&lt;p&gt;You must actually run your test program and calculate/verify your score before submitting your entry. If your submission runs too slowly for you to verify its score then it is not qualified to compete, even if you know what its score would be in principle.&lt;/p&gt;&#xA;&lt;p&gt;You may import existing libraries other than the exceptions above, but you may not load any other external files unless they're included in your byte count. Your code may not access the &lt;code&gt;shakespeare.txt&lt;/code&gt; file in any way other than described above.&lt;/p&gt;&#xA;&lt;h1&gt;A note about the scoring system&lt;/h1&gt;&#xA;&lt;p&gt;In the sandbox, several people had an intuition that the optimal answers to this challenge will take the form of compressing the &lt;code&gt;shakespeare.txt&lt;/code&gt; file and outputting it deterministically. However, the scoring system has been carefully chosen so that this strategy will not be optimal. If you have a stochastic solution then in theory you can turn it into a perfect deterministic solution, at the cost of adding &lt;code&gt;-log2(p(program outputs shakespeare))&lt;/code&gt; bits of code into your program. This extra code decreases &lt;code&gt;p(monkey outputs program)&lt;/code&gt; by exactly the same factor that it increases &lt;code&gt;p(program outputs shakespeare)&lt;/code&gt;, resulting in zero change to the overall score.&lt;/p&gt;&#xA;&lt;p&gt;But this is the absolute best you can do. Any real encoding will be less than perfect, so in reality the net result of such a strategy will be to slightly decrease the score. Because of this, it's likely that the most competitive answers will be stochastic. However, deterministic, compression-based answers are permitted and are welcome to complete, as long as they meet the spec.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;em&gt;sandbox notes:&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;On the off chance that I'm wrong about the properties of the scoring system, I intend to battle-test this challenge before I post it. To do this I will implement (i) the obvious illegal solution using bzip2 to compress the whole text, and (ii) the not-quite-so-obvious illegal solution using bzip2 to stochastically predict the next character from the ones already received, without including a compressed version of the text in the code. I expect solution (ii) to beat solution (i), for the reasons described in the last section of the question. If it doesn't I will either give up on the challenge or add a fudge factor into the scoring system to give slightly more reward to stochastic solutions.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;I'll also post a sample answer (legal but not very competitive), in order to address the point about the spec being a bit daunting to understand.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;I'm unsure about the rule banning built-in compression algorithms. It seems more elegant to leave it out, and it &lt;em&gt;would&lt;/em&gt; still be a meaningful challenge without that rule. But in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/69930/paint-starry-night-objectively-in-1kb-of-code&quot;&gt;Paint Starry Night, objectively, in 1kB of code&lt;/a&gt; off-the-shelf compression spoiled the fun a bit, and I'm worried that with this scoring system the same could happen here. I'm happy to hear any thoughts about that.&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;I'd also really like feedback on the score calculation pseudocode - is it sufficiently clear how the score is calculated, and can I make it clearer?&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Finally, a very specific query: the ban on word tables seems like it would rule out some golfing languages. I don't want to rule out any languages but don't want to open the floodgates either, so if someone can think of a good middle ground it would be helpful.&lt;/em&gt;&lt;/p&gt;&#xA;" OwnerUserId="21034" LastEditorUserId="21034" LastEditDate="2023-12-21T07:18:02.103" LastActivityDate="2023-12-21T07:18:02.103" CommentCount="16" ContentLicense="CC BY-SA 4.0" />
  <row Id="26170" PostTypeId="1" AcceptedAnswerId="26171" CreationDate="2023-12-11T00:03:10.247" Score="1" ViewCount="72" Body="&lt;p&gt;How are &amp;quot;bytes&amp;quot; counted in Subleq, in which code is a list of integers with no fixed size?&lt;/p&gt;&#xA;" OwnerUserId="112554" LastEditorUserId="78410" LastEditDate="2023-12-11T00:16:28.460" LastActivityDate="2023-12-11T00:25:29.830" Title="How is Subleq code counted?" Tags="|discussion|code-golf|answers|scoring|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26171" PostTypeId="2" ParentId="26170" CreationDate="2023-12-11T00:25:29.830" Score="2" Body="&lt;p&gt;Copied from my own comment:&lt;/p&gt;&#xA;&lt;p&gt;On Code Golf, languages are defined by implementations, and a quick search on Subleq gives multiple interpreters that take a list of integers in text, &lt;a href=&quot;https://github.com/howerj/subleq-python/blob/master/eforth.dec&quot; rel=&quot;nofollow noreferrer&quot;&gt;written like this&lt;/a&gt;. For these interpreters, the score is simply the number of bytes of such a file.&lt;/p&gt;&#xA;" OwnerUserId="78410" LastActivityDate="2023-12-11T00:25:29.830" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26172" PostTypeId="2" ParentId="2140" CreationDate="2023-12-11T07:38:16.730" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/268592/72726&quot;&gt;Test whether a sequence is bitonic&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="72726" LastEditorUserId="72726" LastEditDate="2023-12-17T20:39:40.130" LastActivityDate="2023-12-17T20:39:40.130" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26173" PostTypeId="2" ParentId="2140" CreationDate="2023-12-12T07:04:16.433" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/268698/72726&quot;&gt;ASCII flood fill&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="72726" LastEditorUserId="72726" LastEditDate="2023-12-22T20:22:48.863" LastActivityDate="2023-12-22T20:22:48.863" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26174" PostTypeId="1" AcceptedAnswerId="26175" CreationDate="2023-12-12T13:01:40.997" Score="8" ViewCount="155" Body="&lt;p&gt;A long time ago I posted a cops-and-robbers &lt;a href=&quot;https://codegolf.stackexchange.com/questions/157094/abstract-rewriting-challenge-cops&quot;&gt;challenge&lt;/a&gt; in which I (perhaps foolishly) permitted unicode solutions but included the following rule:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;You may use any Unicode characters for these, but please don't use whitespace, or symbols that are hard to distinguish from each other&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Recently, it received an &lt;a href=&quot;https://codegolf.stackexchange.com/a/267200/21034&quot;&gt;answer&lt;/a&gt; that uses the unicode character U+202E (right to left override) to trick the reader into thinking the order of the characters is different from what it is.&lt;/p&gt;&#xA;&lt;p&gt;Obviously, this is the sort of thing that that rule is meant to prevent, so naturally I flagged it as &amp;quot;not an answer&amp;quot;, leaving a comment to explain what the problem is. However, the flag is now marked as &amp;quot;disputed&amp;quot;, which as I understand it means that a mod reviewed the answer and clicked &amp;quot;looks ok&amp;quot;.&lt;/p&gt;&#xA;&lt;p&gt;My question is, why? This seems to me a very clear case of an not-an-answer.&lt;/p&gt;&#xA;&lt;p&gt;The only reason I can think of is that the mods accept the poster's argument that U+202E is not technically whitespace. But that's an absurd technicality. Am I really supposed to accept that a dumb joke answer has to be permitted, even though it's clearly against the spirit of the challenge, just because I didn't think of the right-to-left override character and explicitly forbid it?&lt;/p&gt;&#xA;" OwnerUserId="21034" LastEditorUserId="66833" LastEditDate="2023-12-13T04:53:40.483" LastActivityDate="2023-12-13T04:53:40.483" Title="Why was my flag disputed on an invalid joke answer?" Tags="|support|declined-flags|" AnswerCount="1" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="26175" PostTypeId="2" ParentId="26174" CreationDate="2023-12-12T14:00:24.553" Score="9" Body="&lt;h1&gt;You used the wrong flag&lt;/h1&gt;&#xA;&lt;p&gt;&amp;quot;Not an answer&amp;quot; seems like the obvious thing to flag something like this as. It breaks the rules, it's not a valid answer. On our site the best course of action is usually to flag it as needing moderator intervention and explaining the issue.&lt;/p&gt;&#xA;&lt;p&gt;Why do the other options exist? What's wrong with them? Well, flags are designed for a general stack exchange site, not our site.&lt;/p&gt;&#xA;&lt;p&gt;The following is how I understand the system to work.  Since it's incredibly complicated and pretty poorly documented I look forward to being corrected on a bunch of the details.&lt;/p&gt;&#xA;&lt;p&gt;When you flag something as NAA it will appear in the moderator tab, but it will also appear in the review tab for non-moderators. This is intended to help moderators handle the volume of flags on stack overflow, by delegating easy moderator tasks to trusted users.&lt;/p&gt;&#xA;&lt;p&gt;However on this site&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;determining if an answer is valid requires much more care and effort (SO doesn't delete answers for being wrong or only partially answering questions only those that are blatantly off topic)&lt;/li&gt;&#xA;&lt;li&gt;we have a lot more moderator power and we can reasonably have moderators tackle all the issues&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This makes a system where reviewers mostly look at stuff that was automatically flagged by a bot and are looking for very basic issues and see loads of false positives. On top of that the UI design heavily encourages you to use the flags in a particular way that sends them into that system, and gives you no hint as to the implications of that.&lt;/p&gt;&#xA;&lt;p&gt;What happened in this case, which I can see from moderator data, is that&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You flagged it as NAA&lt;/li&gt;&#xA;&lt;li&gt;Several moderators (including myself) &lt;em&gt;saw&lt;/em&gt; the flag but didn't take any action.&lt;/li&gt;&#xA;&lt;li&gt;It appeared in the &lt;a href=&quot;https://codegolf.stackexchange.com/review/low-quality-posts/history&quot;&gt;review queue&lt;/a&gt; where two users (not moderators) marked it as &amp;quot;Looks OK&amp;quot; and one user (not a moderator) marked it as &amp;quot;Recommend Deletion&amp;quot;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;My understanding is that &amp;quot;disputed&amp;quot; in this case means that the &lt;em&gt;reviewers&lt;/em&gt; were inconclusive. And the reviewers being inconclusive closed the flag making it disappear from the moderator tab. And when things disappear we moderators generally assume one of the other moderators handled it.&lt;/p&gt;&#xA;&lt;p&gt;None of this would have happened with a custom &amp;quot;In need of moderator intervention&amp;quot; flag. Of course I cannot blame you or any user for using the system intuitively. The problem is that the system does not work, not that people are following its instructions.&lt;/p&gt;&#xA;&lt;p&gt;So we can try to spread &amp;quot;awareness&amp;quot; that this issue exists, but it is going to keep on happening.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2023-12-12T14:00:24.553" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26176" PostTypeId="2" ParentId="2140" CreationDate="2023-12-12T20:42:40.487" Score="2" Body="&lt;h1&gt;Simulate a Plant Cell &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/quine&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;quine&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-quine-tooltip-container&quot;&gt;quine&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/268553/95204&quot;&gt;Now posted&lt;/a&gt;! (old drafts still in version history)&lt;/p&gt;&#xA;" OwnerUserId="95204" LastEditorUserId="95204" LastEditDate="2023-12-14T22:55:16.180" LastActivityDate="2023-12-14T22:55:16.180" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26177" PostTypeId="2" ParentId="2140" CreationDate="2023-12-13T13:24:51.440" Score="4" Body="&lt;h1&gt;Approximately Detect Primes&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-decision-problem-tooltip-container&quot;&gt;decision-problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a number from 1 up to 100, your submission should decide whether it is a prime or not. But it is allowed to make up to 5 mistakes, that is, 95 numbers must be classified correctly.&lt;/p&gt;&#xA;" OwnerUserId="24877" LastEditorUserId="24877" LastEditDate="2023-12-13T22:00:34.000" LastActivityDate="2023-12-13T22:00:34.000" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="26178" PostTypeId="2" ParentId="2140" CreationDate="2023-12-14T18:13:22.860" Score="0" Body="&lt;h1&gt;The Challenge Challenge&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-challenge-tooltip-container&quot;&gt;code-challenge&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-bowling&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-bowling&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-bowling-tooltip-container&quot;&gt;code-bowling&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/popularity-contest&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;popularity-contest&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-popularity-contest-tooltip-container&quot;&gt;popularity-contest&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Your goal is to create a &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; challenge that has the longest possible best solution. Post it as an answer to this question, along with the shortest possible solution to that challenge you know of. The number of bytes in that solution is your score, with a higher score being better. To prevent challenges that are boring, bad, not in the spirit of the contest, made of many arbitrary steps, etc, the answer with the most votes will win.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may not include special scoring in your challenge. All that matters is byte-count.&lt;/li&gt;&#xA;&lt;li&gt;You may not intentionally limit the number of languages that can participate in your challenge; any language that can output and input text should be a language that your challenge could be completed in.&lt;/li&gt;&#xA;&lt;li&gt;If someone finds a shorter solution to your challenge, you must update your answer with that solution once you see it.&lt;/li&gt;&#xA;&lt;li&gt;Your challenge must not need links to be complete; you can't refer to a website for parts of your challenge other than to clarify. This is to prevent challenges that are too complex, with many arbitrary steps. Your solution to your challenge is not included in this rule.&lt;/li&gt;&#xA;&lt;li&gt;You may not create a challenge where the goal is simply to output a piece of text (&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-kolmogorov-complexity-tooltip-container&quot;&gt;kolmogorov-complexity&lt;/a&gt; challenges are not allowed). For example, the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/109248/mathematics-is-fact-programming-is-not&quot;&gt;factorial/negation challenge&lt;/a&gt; is allowed, but &lt;a href=&quot;https://codegolf.stackexchange.com/questions/103033/a-keyboard-so-real-you-can-almost-taste-it&quot;&gt;outputting an ASCII keyboard&lt;/a&gt; is not.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Requirements for an answer&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; challenge (within the answer)&lt;/li&gt;&#xA;&lt;li&gt;The shortest possible solution to it (that you know of), or, if it is too long to fit, a sufficient explanation of what it that so that the program could be constructed without any difficulty.&lt;/li&gt;&#xA;&lt;li&gt;The length of that solution&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;If someone finds an answer to your challenge with a byte count that is shorter than your answer to your challenge, that becomes your new byte count.&lt;/p&gt;&#xA;&lt;p&gt;The challenge with the most votes wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Questions:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Looking at meta pop con questions, I think this satisfies what is needed for one of those. Are there changes I need to make here though?&lt;/li&gt;&#xA;&lt;li&gt;Are there any ways I should change this in general?&lt;/li&gt;&#xA;&lt;li&gt;Are there comments I haven't fully addressed?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="120523" LastEditorUserId="120523" LastEditDate="2023-12-16T15:42:55.823" LastActivityDate="2023-12-16T15:42:55.823" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="26179" PostTypeId="2" ParentId="5243" CreationDate="2023-12-14T19:42:48.823" Score="1" Body="&lt;h1&gt;100 rep for first valid answer to &lt;a href=&quot;https://codegolf.stackexchange.com/questions/267392/clone-gnu-cat-8-32&quot;&gt;Clone GNU &lt;code&gt;cat&lt;/code&gt; 8.32&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Any serious contender qualifies.&lt;/p&gt;&#xA;" OwnerUserId="112554" LastActivityDate="2023-12-14T19:42:48.823" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26180" PostTypeId="2" ParentId="2140" CreationDate="2023-12-15T00:23:19.020" Score="-2" Body="&lt;h1&gt;Spaceman Simulator&lt;/h1&gt;&#xA;&lt;p&gt;The song &lt;a href=&quot;https://genius.com/2172507&quot; rel=&quot;nofollow noreferrer&quot;&gt;A Spaceman Came Travelling&lt;/a&gt; presents a fictional story about an alien coming to earth and singing; it is loosely based on the account of the birth of Jesus. The spaceman first says this:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Then the stranger spoke, he said &amp;quot;Do not fear&lt;br&gt;&#xA;I come from a planet a long way from here&lt;br&gt;&#xA;And I bring a message for mankind to hear,&amp;quot;&lt;br&gt;&#xA;And suddenly the sweetest music filled the air&lt;br&gt;&#xA;And it went&lt;br&gt;&#xA;&amp;quot;La la la la la la la la la la la&lt;br&gt;&#xA;La la la la la la la la&lt;br&gt;&#xA;La la la la la la la la la la la&lt;br&gt;&#xA;Peace and goodwill to all men, and love for the child&lt;br&gt;&#xA;La la la la la la la la la la la&lt;br&gt;&#xA;La la la la la la la&lt;br&gt;&#xA;La la la la la la la la la la la&amp;quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The next day, he returns:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;And just before dawn at the paling of the sky &lt;br&gt;&#xA;The stranger returned and said &amp;quot;Now I must fly &lt;br&gt;&#xA;&lt;em&gt;When two thousand years of your time has gone by&lt;/em&gt; &lt;br&gt;&#xA;This song will begin once again, to a baby's cry.&amp;quot;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Write a program that prints this string, followed by two newlines:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Do not fear&#xA;I come from a planet a long way from here&#xA;And I bring a message for mankind to hear&#xA;&#xA;La la la la la la la la la la la&#xA;La la la la la la la la&#xA;La la la la la la la la la la la&#xA;Peace and goodwill to all men, and love for the child&#xA;La la la la la la la la la la la&#xA;La la la la la la la&#xA;La la la la la la la la la la la&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Then, wait until just before dawn at the paling of the sky (approximated by 06:00 system time), and print this, also followed by two newlines:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Now I must fly&#xA;When two thousand years of your time has gone by&#xA;This song will begin once again, to a baby's cry&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(If the program is run exactly at 06:00, you may either do this immediately or wait 24 hours.)&lt;/p&gt;&#xA;&lt;p&gt;Finally, wait until two thousand years of our time has gone by, and begin the song once again. (This goes on in an infinite loop; it will print everything three times if you run it for six thousand years.)&lt;/p&gt;&#xA;&lt;p&gt;Since it's not feasible to wait thousands of years to see if a program works properly, also include an explanation of why the full version works. If you golf the text generation for any of the parts, please also include a copy of the code for each part to generate the text, separate from the main program; this way it can be determined that your &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-kolmogorov-complexity-tooltip-container&quot;&gt;kolmogorov-complexity&lt;/a&gt; code works without waiting for the paling of the sky or the return of the spaceman.&lt;/p&gt;&#xA;&lt;p&gt;For the 2,000 year delay, wait until the same time (within a second or so accuracy) and date as when the program was started (not after the dawn), 2,000 years later.&lt;/p&gt;&#xA;&lt;p&gt;You may assume that system time will increase monotonically throughout eternity, and that the time zone will never change.&lt;/p&gt;&#xA;&lt;p&gt;If there is no way to wait for a duration or until a time in your language, then you may only output the text, as a complete submission would have printed 2,000 years after dawn. This will make the challenge easier in these languages, but will not give them an advantage in competing because submissions only compete within one language.&lt;/p&gt;&#xA;&lt;h2&gt;Example implementation&lt;/h2&gt;&#xA;&lt;p&gt;Here's an example in ungolfed Python. &lt;a href=&quot;https://codegolf.stackexchange.com/questions/196917/sleep-for-1000-years#comment468554_196932&quot;&gt;It will not work on Windows.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-python prettyprint-override&quot;&gt;&lt;code&gt;import datetime&#xA;import time&#xA;&#xA;while True:&#xA;    now = datetime.datetime.now()&#xA;&#xA;    if now.hour &amp;lt; 6:&#xA;        day_of_next_dawn = datetime.date.today()&#xA;    else:&#xA;        day_of_next_dawn = datetime.date.today() + datetime.timedelta(days=1)&#xA;&#xA;    dawn = datetime.datetime(&#xA;        day_of_next_dawn.year,&#xA;        day_of_next_dawn.month,&#xA;        day_of_next_dawn.day,&#xA;        6,&#xA;        0,&#xA;    )&#xA;&#xA;    in_two_thousand_years = now.replace(year=now.year + 2000)&#xA;&#xA;    print(&#xA;        &amp;quot;&amp;quot;&amp;quot;Do not fear&#xA;I come from a planet a long way from here&#xA;And I bring a message for mankind to hear&#xA;&#xA;La la la la la la la la la la la&#xA;La la la la la la la la&#xA;La la la la la la la la la la la&#xA;Peace and goodwill to all men, and love for the child&#xA;La la la la la la la la la la la&#xA;La la la la la la la&#xA;La la la la la la la la la la la&#xA;&amp;quot;&amp;quot;&amp;quot;&#xA;    )&#xA;&#xA;    time.sleep((dawn - now).total_seconds())&#xA;&#xA;    print(&#xA;        &amp;quot;&amp;quot;&amp;quot;Now I must fly&#xA;When two thousand years of your time has gone by&#xA;This song will begin once again, to a baby's cry&#xA;&amp;quot;&amp;quot;&amp;quot;&#xA;    )&#xA;&#xA;    time.sleep((in_2000_years - datetime.datetime.now()).total_seconds())&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-kolmogorov-complexity-tooltip-container&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="112554" LastEditorUserId="112554" LastEditDate="2023-12-15T21:39:12.250" LastActivityDate="2023-12-15T21:39:12.250" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26181" PostTypeId="2" ParentId="2140" CreationDate="2023-12-15T15:05:57.693" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/268604/translate-japanese-hiragana-into-the-flick-input-method&quot;&gt;Translate Japanese hiragana into the flick input method&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-string-tooltip-container&quot;&gt;string&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/unicode&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;unicode&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;unicode&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-unicode-tooltip-container&quot;&gt;unicode&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2023-12-18T05:37:31.680" LastActivityDate="2023-12-18T05:37:31.680" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26182" PostTypeId="2" ParentId="2140" CreationDate="2023-12-15T18:32:13.507" Score="2" Body="&lt;h2&gt;Generate an efficient A* heuristic &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-restricted-complexity-tooltip-container&quot;&gt;restricted-complexity&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-challenge-tooltip-container&quot;&gt;code-challenge&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;A* is a pathfinding algorithm that can be much faster than Dijkstra's, but it requires a heuristic. The heuristic is a function that takes as input one point of the graph, and the destination, then gives a lower bound for the distance between the two points.&lt;/p&gt;&#xA;&lt;p&gt;The closer the heuristic is to the true shortest distance, the faster the algorithm runs. But if the heuristic ever overestimates, the algorithm is no longer guaranteed to find the shortest path.&lt;/p&gt;&#xA;&lt;p&gt;Your task is to generate a good heuristic for a given graph. You must submit 2 functions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The first functions must run in at most O(n^3) time. Given a graph, output up to three 64-bit floating point numbers per point.&lt;/li&gt;&#xA;&lt;li&gt;The second function must run in O(1). Given two points on the graph, output a lower bound for the distance between the two points.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Edges of the graph are guaranteed to have positive, non-zero, integer lengths.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;Your score is the sum of the differences of your heuristic and the true shortest distance on the (yet to be decided) large graph below. The smallest score wins.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="91213" LastEditDate="2023-12-20T06:18:33.783" LastActivityDate="2023-12-20T06:18:33.783" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="26185" PostTypeId="2" ParentId="5243" CreationDate="2023-12-17T20:54:13.163" Score="0" Body="&lt;h1&gt;100 rep for &lt;a href=&quot;https://codegolf.stackexchange.com/questions/268591/golf-a-psk31-modulator&quot;&gt;golfing a PSK31 modulator&lt;/a&gt; and using it on the air&lt;/h1&gt;&#xA;&lt;p&gt;I will award 100 reputation to the first amateur radio operator to post an answer to &amp;quot;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/268591/golf-a-psk31-modulator&quot;&gt;Golf a PSK31 modulator&lt;/a&gt;,&amp;quot; make a QSO on any amateur band using your submission to transmit, and show a screenshot to document the QSO. You may block out call signs for anonymity if desired.&lt;/p&gt;&#xA;" OwnerUserId="112554" LastActivityDate="2023-12-17T20:54:13.163" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26186" PostTypeId="2" ParentId="2140" CreationDate="2023-12-20T17:40:48.543" Score="-1" Body="&lt;h1&gt;Vim (not) Golf&lt;/h1&gt;&#xA;&lt;p&gt;Starting vim with &lt;code&gt;--clean&lt;/code&gt;; what is the longest English sentence you can type without leaving normal mode?&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Should a clause be added for &lt;code&gt;/&lt;/code&gt; not being a valid key?&lt;/p&gt;&#xA;" OwnerUserId="120646" LastActivityDate="2023-12-20T17:40:48.543" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26187" PostTypeId="2" ParentId="2140" CreationDate="2023-12-20T20:57:17.073" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/268782/119818&quot;&gt;golf a range with modulus and subtraction&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="119818" LastEditorUserId="119818" LastEditDate="2023-12-26T14:24:43.847" LastActivityDate="2023-12-26T14:24:43.847" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26188" PostTypeId="2" ParentId="2140" CreationDate="2023-12-21T09:19:04.043" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/268685/convert-to-spoken-binary?noredirect=1&amp;amp;lq=1&quot;&gt;Convert to Spoken Binary&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/268741/convert-from-spoken-binary&quot;&gt;Convert from Spoken Binary&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="117598" LastEditorUserId="117598" LastEditDate="2023-12-25T05:10:38.910" LastActivityDate="2023-12-25T05:10:38.910" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26189" PostTypeId="2" ParentId="2140" CreationDate="2023-12-21T11:46:11.647" Score="0" Body="&lt;p&gt;Output [Some-Text]. You're given its translate in [Some-Language].&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-kolmogorov-complexity-tooltip-container&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Sandbox Notes:&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This seems area where machine learning would work&lt;/li&gt;&#xA;&lt;li&gt;Stealing question Allowed&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2023-12-21T11:46:11.647" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26190" PostTypeId="2" ParentId="2140" CreationDate="2023-12-23T00:54:31.650" Score="0" Body="&lt;h2&gt;Golf golfing a range with modulus and subtraction&lt;/h2&gt;&#xA;&lt;p&gt;In &lt;a href=&quot;https://codegolf.stackexchange.com/questions/268782/&quot;&gt;this other&lt;/a&gt; question I asked you to golf code which finds an equation transforming a list of unique numbers down to a minimal list. For this question, I'm asking you to write code which golfs that equation. In the other question we found that &lt;code&gt;((l-5)%99-94)%98&lt;/code&gt; is a valid equation that turns &lt;code&gt;l=[2,1,5,3,99,7,6]&lt;/code&gt; into &lt;code&gt;[2,1,4,3,0,6,5]&lt;/code&gt;, but if we do some more thinking, we can see that there are shorter ways to do this: &lt;code&gt;(l%91-5)%8&lt;/code&gt; gives the list &lt;code&gt;[5,4,0,6,3,2,1]&lt;/code&gt; and &lt;code&gt;l%95-1&lt;/code&gt; gives the list &lt;code&gt;[1,0,4,2,3,6,5]&lt;/code&gt;. Rather than golfing the code used to generate the equation, in this question you are looking for an algorithm that produces the shortest final equation.&lt;/p&gt;&#xA;&lt;p&gt;To be a valid answer, your code must give an equation that transforms a provided list of unique, non-negative integers into a list of unique, non-negative integers in the range 0 to &lt;code&gt;len(list)-1&lt;/code&gt;. You are scored for the length of the equation that you output rather than the length of your code. Each operation is one point, so an output of &lt;code&gt;((l-5)%99-94)%98&lt;/code&gt; would score 4, &lt;code&gt;(l%91-5)%8&lt;/code&gt; would score 3, and &lt;code&gt;l%95-1&lt;/code&gt; would score 2. In a tie, the score is the character length of the complete equation including parenthesis, so &lt;code&gt;((l-5)%99-94)%98&lt;/code&gt; would score 16, &lt;code&gt;(l%91-5)%8&lt;/code&gt; would score 10, and &lt;code&gt;l%95-1&lt;/code&gt; would score 6. Lowest score wins, as with normal code golf.&lt;/p&gt;&#xA;&lt;p&gt;Different lists may give better scores using some algorithms over others, so we need to test your code to be sure that it is the best for many different lists. The score you list on your answer is the average score your code gets on all lists of 1-15 digits with values in the range 0-63 (say the average primary &lt;em&gt;and&lt;/em&gt; secondary score in your answer). As this question is about the algorithm rather than the code length, you should explain your method as well. If you can prove that your method will always give the best possible score, I will mark your answer as accepted and (if it's simple enough) use your method as the example explanation in the other question. If this happens, I will also edit this question to include an explanation of your algorithm and this question will become a normal code-golf question where everyone implements that algorithm or an equivalent in as few bytes as possible in each language.&lt;/p&gt;&#xA;&lt;p&gt;As the lists your code is tested against are finite in length and have a maximum value, you could theoretically brute-force the shortest solution by trying every possible modulus and subtraction value and returning the shortest. To prevent this, your code should run in less than &lt;code&gt;O(r^l)&lt;/code&gt; time, where r is the range and l is the length.&lt;/p&gt;&#xA;&lt;p&gt;@sandbox, What do you think is a good range? Should it be 1-7 digits, 1-31 digits? Values from 0-31, values from 0-127? Or should it be decimal ranges, 1-9 digits ranging from 0-99?&lt;/p&gt;&#xA;&lt;p&gt;Also, what other tags?&lt;/p&gt;&#xA;" OwnerUserId="119818" LastEditorUserId="119818" LastEditDate="2023-12-31T08:00:09.223" LastActivityDate="2023-12-31T08:00:09.223" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="26191" PostTypeId="2" ParentId="2140" CreationDate="2023-12-24T01:12:24.620" Score="-1" Body="&lt;h2&gt;Fast group action&lt;/h2&gt;&#xA;&lt;p&gt;For the purposes of this challenge permutation is a bijective function on the natural numbers.&lt;/p&gt;&#xA;&lt;p&gt;Cycles are a particular kind of permutation, which we can represent as lists of integers enclosed in a set of parentheses. If a number appears in the list then the result of the permutation is the next value of the list, or in the case of the last value the first in the list. If the number does not appear, its result is itself.&lt;/p&gt;&#xA;&lt;p&gt;So for example (1 2 4) maps 1 to 2, 2 to 4, 4 to 1 and every other natural number to itself.&lt;/p&gt;&#xA;&lt;p&gt;We can compose two permutations to get a new permutation. In the notation we compose two cycles by placing them next to each other, the result is that the right permutation is applied first followed by the left one.&lt;/p&gt;&#xA;&lt;p&gt;So (3 2)(1 2 4) maps 1 to 3, 2 to 4, 3 to 2 and 4 to 1. Everything else maps to itself. This can be written more simply as a single cycle (1 3 2 4). Not every permutation written this way can be simplified. For example (1 2)(9 8) cannot be written as a single cycle since the two cycles being composed do not contain any common numbers. However cycles that are disjoint like this do commute, so this is equivalent to (9 8)(1 2).&lt;/p&gt;&#xA;&lt;p&gt;While not every permutation can be written as a cycle, every permutation can be written as the composition of cycles. So the above notation is enough to represent permutations.&lt;/p&gt;&#xA;&lt;p&gt;However as we have seen there is a degree of ambiguity here. Permutations can be written multiple ways, so we will define a normal form which gives every permutation a single representation.&lt;/p&gt;&#xA;&lt;p&gt;To be normal a representation must satisfy the following qualities:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;No number appears in more than one cycle.&lt;/li&gt;&#xA;&lt;li&gt;The first number in each cycle must be the largest in the cycle.&lt;/li&gt;&#xA;&lt;li&gt;Cycles whose first number is smaller should appear earlier.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Here are a few examples rewritten in normal form:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;(1 2 4) -&amp;gt; (4 1 2)&#xA;(3 2)(1 2 4) -&amp;gt; (4 1 3 2)&#xA;(1 2)(9 8) -&amp;gt; (2 1)(9 8)&#xA;(1 4 7)(2 3) -&amp;gt; (3 2)(7 1 4)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;In this challenge you will take as input two finite permutations (a finite number of cycles each of finite length) in normal form and output the composition of those two permutations also in normal form.&lt;/p&gt;&#xA;&lt;p&gt;You may take input as a list of lists or any suitable list-like structure. You may exclude or include 0 from the natural numbers.&lt;/p&gt;&#xA;&lt;p&gt;The goal is to minimize Big-O asymptotic time complexity in terms of the number of bits in the input.&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox&lt;/h2&gt;&#xA;&lt;p&gt;I wrote this up because I needed to implement this for work I was doing, and had fun. This seems like the sort of thing that would have existing fast algorithms, but when researching for my work and again when writing this I wasn't able to find any.&lt;/p&gt;&#xA;&lt;p&gt;If this is a well known problem, I don't think it's worth asking a fastest code about it.  I'd probably modify it to be &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/restricted-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;restricted-complexity&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-restricted-complexity-tooltip-container&quot;&gt;restricted-complexity&lt;/a&gt; and &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;. So if anyone knows of an algorithm in the literature, let me know.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2023-12-24T01:12:24.620" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26192" PostTypeId="2" ParentId="2140" CreationDate="2023-12-25T20:12:39.077" Score="4" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/268818/name-the-dutch-ancestor&quot;&gt;Name the Dutch ancestor&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="81594" LastEditorUserId="81594" LastEditDate="2023-12-28T12:45:46.640" LastActivityDate="2023-12-28T12:45:46.640" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26193" PostTypeId="2" ParentId="2140" CreationDate="2023-12-26T05:20:10.933" Score="2" Body="&lt;p&gt;This question was marked as &lt;a href=&quot;https://codegolf.stackexchange.com/questions/269022/&quot;&gt;posted&lt;/a&gt; and is therefore not shown - you can see &lt;a href=&quot;https://codegolf.meta.stackexchange.com/posts/26193/revisions&quot;&gt;the revision history&lt;/a&gt; for details.&lt;/p&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2024-01-06T03:35:42.670" LastActivityDate="2024-01-06T03:35:42.670" CommentCount="8" ContentLicense="CC BY-SA 4.0" />
  <row Id="26194" PostTypeId="2" ParentId="25541" CreationDate="2023-12-26T15:35:50.290" Score="0" Body="&lt;h1&gt;Most unexpected outcome&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Repost from &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/25429/108218&quot;&gt;2022&lt;/a&gt;, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24239/108218&quot;&gt;2021&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;An answer that you didn’t expect to work, or do something else, but unexpectedly did some weird behavior and made the answer valid.&lt;/p&gt;&#xA;&lt;p&gt;This could involve some interpreter bug, or obscure feature that wasn’t documented nor known by many people.&lt;/p&gt;&#xA;" OwnerUserId="108218" LastActivityDate="2023-12-26T15:35:50.290" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26195" PostTypeId="2" ParentId="2140" CreationDate="2023-12-28T01:48:39.540" Score="1" Body="&lt;h1&gt;How many machines do I need?&lt;/h1&gt;&#xA;&lt;p&gt;In the game Planet Crafter, there is limited scope for automation. In particular, you can grow or extract materials, combine them into products, and launch them in rockets, which then trades them for Terra Tokens.&lt;/p&gt;&#xA;&lt;p&gt;You can launch up to 25 items at once, and the trade takes 10 minutes to complete, during which time you would like to be able to craft the next 25 items. However, you can also craft multiple trading rockets. This means that you'll need more machines so that you can turn each rocket around before the next one arrives back. The special case is actually for single rocket, which takes the same time as two rockets but you need two more Auto-Crafters so that you can store the products while waiting for the rocket to return.&lt;/p&gt;&#xA;&lt;p&gt;The following items are accepted for trade:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Bacteria Sample. Requires 3 Algae, 3 Water. Unfortunately I don't know the production speed of Algae, but 1 Water can produced every 100 seconds.&lt;/li&gt;&#xA;&lt;li&gt;Iridium Rod. Requires 9 Iridium. 1 Iridium can be produced every 75 seconds.&lt;/li&gt;&#xA;&lt;li&gt;Osmium Rod. Requires 9 Osmium. 1 Osmium can be produced every 75 seconds.&lt;/li&gt;&#xA;&lt;li&gt;Super Alloy Rod. Requires 8 Super Alloy, 1 Aluminium. Both can be produced every 75 seconds.&lt;/li&gt;&#xA;&lt;li&gt;High Quality Food. Requires 1 Honey, 1 Beans. Unfortunately I don't know the production speed of Beans, but 1 Honey can be produced every 160 seconds.&lt;/li&gt;&#xA;&lt;li&gt;Fabric. Requires 2 Silk. 1 Silk can be produced every 200 seconds.&lt;/li&gt;&#xA;&lt;li&gt;Uranium Rod. Requires 9 Uranium. 1 Uranium can be produced every 75 seconds.&lt;/li&gt;&#xA;&lt;li&gt;Cookie. Unfortunately I don't know the production speed. It needs two extra Auto-Crafters.&lt;/li&gt;&#xA;&lt;li&gt;Rocket Engine. Requires 1 Super Alloy, 2 Uranium, 9 Iridium. Each can be produced every 75 seconds. Also requires an extra Auto-Crafter.&lt;/li&gt;&#xA;&lt;li&gt;Circuit Board. Requires 1 Iron, 2 Silicon, 1 Aluminium, 1 Nitrogen, 1 Water, 2 Mushroom, 1 Zeolite. Unfortunately I don't know the production speed for Mushroom. 1 Nitrogen can be produced every 80 seconds, while the others can be produced every 75 seconds. Also requires an extra Auto-Crafter.&lt;/li&gt;&#xA;&lt;li&gt;Pulsar Quartz. Requires 1 Zeolite, 1 Osmium, 1 Uranium, 1 Iridium, 1 Methane. 1 Methane can be produced every 80 seconds, while the others can be produced every 75 seconds.&lt;/li&gt;&#xA;&lt;li&gt;Fusion Energy Cell. Requires 3 Zeolite, 5 Osmium, 3 Uranium, 3 Iridium, 3 Methane, 1 Obsidian. 1 Methane can be produced every 80 seconds, while the others can be produced every 75 seconds. Also requires an extra Auto-Crafter.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Just to complicate matters, it's possible to buff your machines; each buff makes your machine 25% more efficient, so that four buffs would double the output, eight would triple it, and so on, however only 8 machines can be affected by a buff, at which point the buff is equivalent to two extra machines.&lt;/p&gt;&#xA;&lt;p&gt;Fortunately, I am not expecting you to produce detailed recipes for each product. Instead, your program or function will be given the following data:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The number of trading rockets you wish to supply&lt;/li&gt;&#xA;&lt;li&gt;The quantity required of a particular material&lt;/li&gt;&#xA;&lt;li&gt;The extraction speed of that material&lt;/li&gt;&#xA;&lt;li&gt;The number of buffs you intend to apply&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Your program or function should then output the number of extraction machines required.&lt;/p&gt;&#xA;&lt;p&gt;Example: Extracting Methane for Pulsar Quartz for 4 Trading Rockets:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You only need 1 Auto-Crafter&lt;/li&gt;&#xA;&lt;li&gt;Methane takes 80 seconds each to extract.&lt;/li&gt;&#xA;&lt;li&gt;Because you want to turn around 3 rockets while waiting for the 4th, you want 75 Methane in 10 minutes which is 1 every 8 seconds&lt;/li&gt;&#xA;&lt;li&gt;You therefore need 10 extraction machines.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Example: Extracting Water for Bacteria Samples for 3 Trading Rockets, with 1 buff:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You need 1 Auto-Crafter&lt;/li&gt;&#xA;&lt;li&gt;Water takes 100 seconds each to extract, but with 1 buff this reduces to 80 seconds.&lt;/li&gt;&#xA;&lt;li&gt;Because the recipe uses 3 Water, and you want to turn around 2 rockets while waiting for the third, you want 150 Water in 10 minutes which is 1 every 4 seconds&lt;/li&gt;&#xA;&lt;li&gt;You therefore need 20 extraction machines. (In practice, you would have 25 extraction machines, or 23 with 8 receiving 1 buff, or 21 with either 16 receiving 1 buff or 8 receiving 2 buffs, etc.)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Example: Extracting Zeolite for Fusion Energy Cells for 1 Trading Rocket, with 2 buffs:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You need 4 Auto-Crafters (2 for Fusion Energy Cells and 2 for only having one Rocket)&lt;/li&gt;&#xA;&lt;li&gt;Zeolite takes 75 seconds each to extract, but with 2 buffs this reduces to 50 seconds.&lt;/li&gt;&#xA;&lt;li&gt;Because the recipe uses 3 Zeolite, you want 75 Zeolite in 10 minutes which is 1 every 8 seconds&lt;/li&gt;&#xA;&lt;li&gt;You therefore need 7 extraction machines.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;&lt;p&gt;Bonus brownie points for writing a program that takes the name of a recipe and the number of rockets and outputs the number of Auto-Crafters you need.&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2023-12-28T01:48:39.540" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26196" PostTypeId="1" CreationDate="2023-12-28T03:56:16.013" Score="1" ViewCount="58" Body="&lt;p&gt;I just made a single-byte encoding for &lt;a href=&quot;https://www.uiua.org/&quot; rel=&quot;nofollow noreferrer&quot;&gt;Uiua&lt;/a&gt;.&#xA;If you are interested, &lt;a href=&quot;https://uiua.org/pad?src=0_7_1__IyBTaW5nbGUtYnl0ZSBjaGFyYWN0ZXIgZW5jb2RpbmcgZm9yIFVpdWEgMC44LjAKIyBXcml0dGVuIGhhc3RpbHkgYnkgVG9ieSBCdXNpY2stV2FybmVyLCBAVGJ3IG9uIFN0YWNrIEV4Y2hhbmdlCiMgMjcgRGVjZW1iZXIgMjAyMwojIEFQTCdzICLijbUiIGlzIHVzZWQgYXMgYSBwbGFjZWhvbGRlci4KCkNPTlRST0wg4oaQICJcMOKNteKNteKNteKNteKNteKNteKNteKNteKNtVxu4o214o21XHLijbXijbXijbXijbXijbXijbXijbXijbXijbXijbXijbXijbXijbXijbXijbXijbXijbXijbUiClBSSU5UQUJMRSDihpAgIiAhXCIjJCUmJygpKissLS4vMDEyMzQ1Njc4OTo7PD0-P0BBQkNERUZHSElKS0xNTk9QUVJTVFVWV1hZWltcXF1eX2BhYmNkZWZnaGlqa2xtbm9wcXJzdHV2d3h5ent8fX7ijbUiClVJVUEg4oaQICLiiJjCrMKxwq_ijLXiiJril4vijIrijIjigYXiiaDiiaTiiaXDl8O34pe_4oG_4oKZ4oan4oal4oig4oSC4qe74paz4oeh4oqi4oeM4pmtwqTii6_ijYnijY_ijZbiipriipviip3ilqHii5XiiY3iip_iioLiio_iiqHihq_imIfihpnihpjihrvil6vilr3ijJXiiIriipfiiKfiiLXiiaHiip7iiqDijaXiipXiipziipDii4XiipniiKnCsOKMheKNnOKKg-KqvuKKk-KLlOKNouKsmuKNo-KNpOKGrOKGq-Kags63z4DPhOKInuK4ruKGkOKVreKUgOKVt-KVr-KfpuKfp-KMnOKMn-KVk-KVn-KVnCIKQVNDSUkg4oaQIOKKgiBDT05UUk9MIFBSSU5UQUJMRQpTQkNTIOKGkCDiioIgQVNDSUkgVUlVQQoKRW5jb2RlIOKGkCDiipc6U0JDUwpEZWNvZGUg4oaQIOKKjzpTQkNTCgpQYXRoVUEg4oaQICJ0ZXN0MS51YSIKUGF0aFNCQ1Mg4oaQICJ0ZXN0Mi5zYmNzIgoKRW5jb2RlVUEg4oaQICZmd2EgUGF0aFNCQ1MgRW5jb2RlICZmcmFzCkRlY29kZVNCQ1Mg4oaQICZmd2EgUGF0aFVBIERlY29kZSAmZnJhYgoKIyBFeGFtcGxlczoKIwojIFdyaXRlIHRvIC51YSBmaWxlOgojICAgICAmZndhIFBhdGhVQSAi4oqP4o2PLuKKneKWveKJoOKHoeKnuyziipdAQi4iCiMgRW5jb2RlIHRvIGEgLnNiY3MgZmlsZToKIyAgICAgRW5jb2RlVUEgUGF0aFVBCiMgRGVjb2RlIGEgLnNiY3MgZmlsZToKIyAgICAgRGVjb2RlU0JDUyBQYXRoU0JDUwo=&quot; rel=&quot;nofollow noreferrer&quot;&gt;here&lt;/a&gt; is the Pad.&#xA;According to &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/5879/117598&quot;&gt;this&lt;/a&gt; answer (which seems to be commonly linked to),&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;An answerer can use whatever encoding they want for a particular answer.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;The comments on that answer imply that the encoding must exist beforehand and not be ad hoc.&#xA;I made this encoding specifically for use on Stack Exchange, but not for any question in particular.&#xA;There didn't seem to be any existing/standard SBCS for Uiua, and it would be nice for the # of characters to correspond to the # of bytes.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Can I use my new encoding on new answers?&lt;/li&gt;&#xA;&lt;li&gt;Can I use my new encoding on old answers? (At the moment, I only have one answer in Uiua.)&lt;/li&gt;&#xA;&lt;li&gt;Can anyone use my new encoding for old and new answers?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;EDIT: for anyone reading this in the future, the answers to these questions are yes! Just be sure to say that you are using the SBCS (and probably link it).&lt;/p&gt;&#xA;" OwnerUserId="117598" LastEditorUserId="117598" LastEditDate="2023-12-28T05:01:32.123" LastActivityDate="2023-12-28T05:01:32.123" Title="Can I use my SBCS for Uiua?" Tags="|discussion|support|" AnswerCount="0" CommentCount="3" ClosedDate="2023-12-28T04:18:28.827" ContentLicense="CC BY-SA 4.0" />
  <row Id="26198" PostTypeId="2" ParentId="2140" CreationDate="2023-12-28T04:24:52.593" Score="-2" Body="&lt;h1&gt;Write an optimal Python program for distributed worknode to find prime.&lt;/h1&gt;&#xA;&lt;p&gt;Prime is defined as a number with no divisor but 1 and itself. Write an optimised for speed program for Pythons distributed worknode to check if an input is a prime.&lt;/p&gt;&#xA;&lt;p&gt;The usual approach is to try possible divisors to see if they are, an optimisation begins at 2 (since we have to find n/2 anyway for a limit) and does not try multiples of a possible divisor, if a number does not divide by two then no even numbers divide that number, similarly if a number does not divide by three then it does not divide by three, six and nine. No number higher than n/2 need to be tried.&lt;/p&gt;&#xA;&lt;p&gt;Entries in programming languages other than Python are acceptable for study.&lt;/p&gt;&#xA;" OwnerUserId="79782" LastEditorUserId="79782" LastEditDate="2023-12-29T14:23:36.397" LastActivityDate="2023-12-29T14:23:36.397" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="26199" PostTypeId="2" ParentId="2140" CreationDate="2023-12-28T16:28:46.357" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/269000/unnecessary-fluff&quot;&gt;Unnecessary fluff&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h3&gt;Sandbox note&lt;/h3&gt;&#xA;&lt;p&gt;There is a fairly efficient way to calculate this &lt;span class=&quot;math-container&quot;&gt;\$h\$&lt;/span&gt;, which might be interesting. Do you think I should require polynomial time, or being able to calculate all the testcases in a minute?&lt;/p&gt;&#xA;" OwnerUserId="92727" LastEditorUserId="92727" LastEditDate="2024-01-05T04:31:09.920" LastActivityDate="2024-01-05T04:31:09.920" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26200" PostTypeId="2" ParentId="2140" CreationDate="2023-12-28T17:27:40.183" Score="1" Body="&lt;h1&gt;&amp;quot;Perfect&amp;quot; an array&lt;/h1&gt;&#xA;&lt;p&gt;Given an n non-negative integers, how many numbers must be changed so that each number x appears x times? You cannot add or remove elements, only replace them.&lt;/p&gt;&#xA;&lt;p&gt;For example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 6 23 6 9 23 1 1 6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;can be turned into:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 6 2 6 6 2 6 6 6&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;with 5 changes, which is optimal.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;0 =&amp;gt; 1&#xA;1 2 3 =&amp;gt; 1&#xA;5 5 5 5 5 =&amp;gt; 0&#xA;23 7 4 8 =&amp;gt; 3&#xA;100 100 100 6 =&amp;gt; 4&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr&gt;&#xA;&lt;li&gt;&#xA;    &lt;ul&gt;Would appreciate help checking the test cases (and the sample case)&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2023-12-29T14:23:05.153" LastActivityDate="2023-12-29T14:23:05.153" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26201" PostTypeId="2" ParentId="2140" CreationDate="2023-12-29T01:28:25.933" Score="1" Body="&lt;h1&gt;Slowest Irreducible Sorting Algorithm&lt;/h1&gt;&#xA;&lt;p&gt;&lt;em&gt;Inspired by the biggest irreducible quine and hello world challenges&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;Sorting things quickly is something that has been greatly researched. However, sorting things in the slowest and most inefficient way is something you don't hear about very often. Let's change that.&lt;/p&gt;&#xA;&lt;p&gt;Your task today is to write the slowest sorting algorithm, as measured by worst case scenario (&lt;code&gt;O&lt;/code&gt; notation).&lt;/p&gt;&#xA;&lt;p&gt;However, it needs to be optimally not-optimal - removing any steps from the algorithm should not result in a more optimal algorithm - bogosorting in a loop that runs O(n^2) times is not irreducible, as it can be done with a single bogosort.&lt;/p&gt;&#xA;&lt;p&gt;Answer with the slowest complexity wins, tie-broken on shortest answer in bytes.&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;How could I better specify irreducibility? It's obviously not as easy as the irreducibility requirements of the byte based challenges, but there should be some method of objectively determining it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2023-12-29T01:28:25.933" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26203" PostTypeId="2" ParentId="2140" CreationDate="2023-12-30T06:57:05.997" Score="5" Body="&lt;h1&gt;Output an inversely proportional sequence&lt;/h1&gt;&#xA;&lt;p&gt;Inspired by &lt;a href=&quot;https://codegolf.stackexchange.com/questions/268799/output-an-infinitely-proportional-sequence#comment583980_268799&quot;&gt;Wheat Wizard's comment&lt;/a&gt; on &lt;a href=&quot;https://codegolf.stackexchange.com/q/268799/100664&quot;&gt;my previous challenge&lt;/a&gt;. While that challenge requires having the ratio of consecutive integers grow arbitrarily large, this challengne requires the ratio growing arbitrarily small, a change that at first glance looks trivial but substantially changes the challenge. While most answers to the previous used a simple recursive formula, I haven't been able to find any simple closed-form formula for this.&lt;/p&gt;&#xA;&lt;p&gt;In this challenge, an &lt;em&gt;inversely proportional sequence&lt;/em&gt; is defined as a infinite sequence of positive integers such that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;All positive integers are contained infinitely many times within the sequence.&lt;/li&gt;&#xA;&lt;li&gt;As more and more terms are added to the sequence, for all positive integers &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, the ratio of the number of &lt;span class=&quot;math-container&quot;&gt;\$n+1\$&lt;/span&gt;s to the number of &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;s in the sequence must grow arbitrarily large.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;I haven't been able to find a closed-form formula for such a sequence, but one possibility is the following (newlines added for clarity):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1,&#xA;1, 2, 2,&#xA;1, 2, 2, 2, [9 3s]&#xA;1, [4 2s], [16 3s], [64 4s]&#xA;...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Each line number &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; contains &lt;span class=&quot;math-container&quot;&gt;\$1 \text{ 1}, n \text{ 2s}, n^2 \text{ 3s}\$&lt;/span&gt; etc up to $n$. It's pretty easy to see why this satisfies the requirements: for example, the number of 1s in the first &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; lines is &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, and the number of 2s in the first &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; lines is &lt;span class=&quot;math-container&quot;&gt;\$\frac{n(n+1)}{2} - 1\$&lt;/span&gt;. The quotient of these is &lt;span class=&quot;math-container&quot;&gt;\$\frac{\frac{n(n+1)}{2} - 1}{n} = \frac{(n+1)}{2} - \frac{1}{n}\$&lt;/span&gt;, which clearly grows arbitrarily large as &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; goes to infinity. A similar argument can be made for all other pairs.&lt;/p&gt;&#xA;&#xA;&lt;p&gt;An example of an invalid sequence is this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1,&#xA;1, 2, 2&#xA;1, 2, 2, 3, 3, 3, 3,&#xA;1, 2, 2, 3, 3, 3, 3, [8 4s]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Each line number &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; contains &lt;span class=&quot;math-container&quot;&gt;\$1 \text{ 1}, 2 \text{ 2s}, 4 \text{ 3s} ... 2^n \text{ ns}\$&lt;/span&gt;. While this does contain every positive integer infinitely many times, and contains each positive integer less than the previous, it does not contain each integer infinitely less than the previous. In the limiting case, the sequence contains twice as many 2s as 1s, twice as many 3s as 2s, and so on.&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to output any inversely proportional sequence. Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-sequence-tooltip-container&quot;&gt;sequence&lt;/a&gt; rules apply - you may output as a function that takes &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and outputs the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th or first &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; terms, or output an infinite sequence in some form. You may use 0-indexing or 1-indexing.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, shortest wins!&lt;/p&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If you've found a closed-form (ish) formula for such a sequence I'd appreciate if you comment it.&lt;/li&gt;&#xA;&lt;li&gt;Is this sufficiently different from the previous challenge? 6 people seemed to think it was.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="100664" LastActivityDate="2023-12-30T06:57:05.997" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26204" PostTypeId="2" ParentId="2140" CreationDate="2023-12-31T00:09:45.347" Score="0" Body="&lt;h1&gt;Output a 1-digit integer log table&lt;/h1&gt;&#xA;&lt;p&gt;Log tables were originally used for multiplication, since &lt;span class=&quot;math-container&quot;&gt;\$ x \times y = \exp(\log x + \log y) \$&lt;/span&gt;, superseding the use of trigonometric functions for this purpose. A log table I used in school back in the day had 900 main entries and then some interpolation entries you could use to give yourself almost an extra digit of accuracy.&lt;/p&gt;&#xA;&lt;p&gt;However, if you were building a mechanical computer, you wouldn't need to have thousands of entries, as you could just program it to do long multiplication; the stumbling block is actually multiplying two digits together in the first place.&lt;/p&gt;&#xA;&lt;p&gt;One approach to this is to use something called an Irish logarithm table. This is basically a pair of integer mappings &lt;span class=&quot;math-container&quot;&gt;\$ f \$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$ g \$&lt;/span&gt; such that &lt;span class=&quot;math-container&quot;&gt;\$ g(f(x) + f(y)) = x \times y \$&lt;/span&gt; for all &lt;span class=&quot;math-container&quot;&gt;\$ x, y \in \{ 0..9 \} \$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For this challenge I would like you to output any two integer mappings with that property, in any reasonable format. In particular, since the length of the &lt;code&gt;f&lt;/code&gt; mapping is always ten, there is no need to separate the &lt;code&gt;f&lt;/code&gt; and &lt;code&gt;g&lt;/code&gt; mappings in your output.&lt;/p&gt;&#xA;&lt;p&gt;Note that while the &lt;code&gt;f&lt;/code&gt; mapping maps from &lt;code&gt;0&lt;/code&gt; to &lt;code&gt;9&lt;/code&gt;, the &lt;code&gt;g&lt;/code&gt; mapping will have gaps because some of its indices won't correspond to the sum of two values of &lt;code&gt;f&lt;/code&gt;. You can handle this either by outputting the mapping as a dictionary or by padding the output array with a suitable filler value.&lt;/p&gt;&#xA;&lt;p&gt;Excluding the filler value, the &lt;code&gt;g&lt;/code&gt; mapping only needs to output the values &lt;code&gt;0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, 28, 30, 32, 35, 36, 40, 42, 45, 48, 49, 54, 56, 63, 64, 72, 81&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest program or function that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2023-12-31T00:09:45.347" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="26205" PostTypeId="1" AcceptedAnswerId="26214" CreationDate="2023-12-31T05:40:33.013" Score="-4" ViewCount="174" Body="&lt;p&gt;Please unprotect &lt;a href=&quot;https://codegolf.stackexchange.com/q/18028/79782&quot;&gt;Largest Number Printable&lt;/a&gt; so &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2140/sandbox-for-proposed-challenges/12647#comment81117_12647&quot;&gt;my answer may be considered&lt;/a&gt; and create discussion.&lt;/p&gt;&#xA;" OwnerUserId="79782" LastEditorUserId="66833" LastEditDate="2024-01-01T17:22:27.657" LastActivityDate="2024-01-01T17:22:27.657" Title="Please unprotect Largest Number Printable" Tags="|feature-request|status-declined|specific-question|protected-questions|" AnswerCount="1" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="26206" PostTypeId="2" ParentId="2140" CreationDate="2023-12-31T08:42:26.707" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/268943/how-long-is-this-string-really&quot;&gt;How long is this string, really?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2024-01-02T09:10:42.587" LastActivityDate="2024-01-02T09:10:42.587" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26213" PostTypeId="2" ParentId="2140" CreationDate="2024-01-01T16:33:49.733" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/269076/91472&quot;&gt;Implement a typeface based on a 3x3 bitmap matrix&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91472" LastEditorUserId="91472" LastEditDate="2024-01-08T16:14:57.210" LastActivityDate="2024-01-08T16:14:57.210" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26214" PostTypeId="2" ParentId="26205" CreationDate="2024-01-01T17:21:59.630" Score="3" Body="&lt;h2&gt;For the moment, the question will stay protected&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/help/privileges/protect-questions&quot;&gt;Questions are protected&lt;/a&gt; when they receive a large number of low quality answers, especially by new users, that get downvoted and deleted. &lt;a href=&quot;https://codegolf.stackexchange.com/q/18028/66833&quot;&gt;Largest Number Printable&lt;/a&gt; is a &lt;em&gt;prime&lt;/em&gt; example for this - it has 49 deleted answers, 36 of which are negatively scored, and a quick scan shows that multiple were posted by users with less than 50 reputation on the site.&lt;/p&gt;&#xA;&lt;p&gt;If you are absolutely certain that your answer deserves to be posted to this challenge, then there's an easy way to do this: earn 10 reputation. Post an answer and challenge that receives 1 upvotes, and you'll be able to answer Largest Number Printable (and all other protected questions). The point of protection is to prevent answers being posted by anonymous and very-low reputation users, specifically in the cases where the record is not in their favor.&lt;/p&gt;&#xA;&lt;p&gt;Also, when posting new answers to questions with so many answers (93 undeleted at time of writing), you should really ask yourself if your answer provides any new approach. From the program in the linked comment in your question, I doubt it does: it's just exponenting a large number. The existing answers are already unimaginably many orders of magnitude greater than that.&lt;/p&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2024-01-01T17:21:59.630" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26215" PostTypeId="2" ParentId="2140" CreationDate="2024-01-02T02:01:41.930" Score="-2" Body="&lt;h1&gt;Tiniest ELF under x64 Linux to perform ROT13&lt;/h1&gt;&#xA;&lt;p&gt;We already have a ROT13 &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/4/rot-13-transform-standard-input&quot;&gt;challenge&lt;/a&gt;. But all those solutions, while short in &lt;em&gt;source form&lt;/em&gt;, require/produce huge binaries in order to run. A simple C implementation ends up at around ~14 &lt;em&gt;KiB&lt;/em&gt;! If that doesn't shock you, see the quoted text below from &lt;a href=&quot;https://arstechnica.com/gadgets/2022/03/a-brief-tour-of-the-pdp-11-the-most-influential-minicomputer-of-all-time/&quot; rel=&quot;nofollow noreferrer&quot;&gt;this&lt;/a&gt; article (emphasis mine):&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The first version of UNIX was written in PDP-11 assembler; it had 34 system calls, it was written in 4,200 lines of code, and it ran on &lt;strong&gt;12KB&lt;/strong&gt; of main memory&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h2&gt;Goal&lt;/h2&gt;&#xA;&lt;p&gt;Create the &lt;a href=&quot;https://www.muppetlabs.com/%7Ebreadbox/software/tiny/&quot; rel=&quot;nofollow noreferrer&quot;&gt;tiniest ELF &lt;strong&gt;executable&lt;/strong&gt;&lt;/a&gt; you can that runs under x64 Linux (4.14+), takes input from &lt;code&gt;stdin&lt;/code&gt;, performs &lt;a href=&quot;https://en.wikipedia.org/wiki/ROT13&quot; rel=&quot;nofollow noreferrer&quot;&gt;ROT13&lt;/a&gt; on it and writes the result to &lt;code&gt;stdout&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may use whatever language you want (C, C++, Rust, Assembly, Hex, ...), but please provide version numbers and your environment, as well as any extra necessities (compiler/linker flags, linker scripts, custom scripts, commands, etc.) so that we can reproduce the result.&lt;/li&gt;&#xA;&lt;li&gt;You may assume input will always be in ASCII.&lt;/li&gt;&#xA;&lt;li&gt;It has to be a relatively complete program. You &lt;em&gt;must&lt;/em&gt; handle errors (mainly, a system call failing). The program must exit with exit code &lt;code&gt;0&lt;/code&gt; on sucess and &lt;code&gt;1&lt;/code&gt; on failure.&lt;/li&gt;&#xA;&lt;li&gt;I encourage you to try higher-level languages. Answers in assembly will, no doubt, be shorter, but it's interesting to see how others will fare.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; (no loopholes), the smallest binary wins!&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/machine-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;machine-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;machine-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-machine-code-tooltip-container&quot;&gt;machine-code&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="98462" LastActivityDate="2024-01-02T02:01:41.930" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26216" PostTypeId="2" ParentId="2140" CreationDate="2024-01-03T12:24:51.610" Score="1" Body="&lt;h1&gt;Output a unique subset of the positive integers &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-answer-chaining-tooltip-container&quot;&gt;answer-chaining&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Your challenge is to output an infinite subset of the positive integers. However, the subset your program outputs must be disjoint from all the subsets that the other answers output.&lt;/p&gt;&#xA;&lt;p&gt;For example, if the first answer outputs an infinite sequence of square numbers &lt;code&gt;1,4,9,16,25...&lt;/code&gt;, the sets output by all subsequent answers cannot contain any square numbers, so the second answer can't output for example the triangle numbers &lt;code&gt;1,3,6,10...&lt;/code&gt; as it contains a 1. It could however output the primes &lt;code&gt;2,3,5,7,11...&lt;/code&gt; as by definition primes cannot be square. A third answer could output odd powers of 10 &lt;code&gt;10, 1000, 100000,10000000...&lt;/code&gt; as this is disjoint from the previous two.&lt;/p&gt;&#xA;&lt;p&gt;To avoid answers taking up too much of the output space, the probability of a random positive integer being in your set should converge to a value less than 0.01. For example, the following sets would be fine:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1,2,3,5,8,13... (fibonacci numbers, chance converges to 0)&lt;/li&gt;&#xA;&lt;li&gt;1,4,9,16,25... (square numbers, chance converges to 0)&lt;/li&gt;&#xA;&lt;li&gt;2,3,5,7,11...  (primes, chance converges to 0?)&lt;/li&gt;&#xA;&lt;li&gt;1000,2000,3000,4000... (multiples of 1000, chance converges to 0.001)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;But the following would not:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;1,4,6,8,9,10,12... (composite numbers, chance converges to 1 (?))&lt;/li&gt;&#xA;&lt;li&gt;1,3,5,7,9,11... (odd numbers, chance converges to 0.5)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Your answer may not rely on unproven conjectures, and you should be able to prove that your set is infinite and disjoint from all previous answers. For example, outputting the &lt;a href=&quot;https://en.wikipedia.org/wiki/Perfect_number&quot; rel=&quot;nofollow noreferrer&quot;&gt;perfect numbers&lt;/a&gt; would not be allowed as it is not known whether there are infinitely many, and in the previous example outputting &lt;a href=&quot;https://mathworld.wolfram.com/PentagonalTriangularNumber.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;the pentagonal-triangular numbers&lt;/a&gt; &lt;span class=&quot;math-container&quot;&gt;\$ &amp;gt; 1\$&lt;/span&gt; as the third answer would not be allowed as it is not known whether there are any members of that sequence that are squares.&lt;/p&gt;&#xA;&lt;p&gt;You may output an infinite sequence of integers, or take an integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; and output the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th or first &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; terms, using 0-indexing or 1-indexing.&lt;/p&gt;&#xA;&lt;p&gt;&amp;lt;insert winning criteria here&amp;gt;&lt;/p&gt;&#xA;&lt;h1&gt;Meta&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should I allow taking a number and returning whether it's in the set?&lt;/li&gt;&#xA;&lt;li&gt;I'm not sure about the winning criterion. I want to incentivise short code and simple sequences, so the standard &amp;quot;last answer wins&amp;quot; or &amp;quot;second-to-last answer wins&amp;quot; might not work too well, but balancing anything based on code length is annoying.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="100664" LastActivityDate="2024-01-03T12:24:51.610" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26219" PostTypeId="2" ParentId="2140" CreationDate="2024-01-06T20:48:27.453" Score="0" Body="&lt;h2&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/269060/shortest-path-to-open-a-letter-lock&quot;&gt;Shortest path to open a letter lock&lt;/a&gt;&lt;/h2&gt;&#xA;" OwnerUserId="96266" LastEditorUserId="96266" LastEditDate="2024-01-08T01:04:38.337" LastActivityDate="2024-01-08T01:04:38.337" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26220" PostTypeId="2" ParentId="12599" CreationDate="2024-01-07T14:53:58.630" Score="2" Body="&lt;p&gt;I want to bring this subject back to attention. I love the idea of the sandbox. How great would it be to test your challenges there to improve them before letting them out in the wild.&lt;/p&gt;&#xA;&lt;p&gt;Sadly, I had to experience, that reality is different. I had all of my challenges in the sandbox first and hardly even gotten a comment, sometimes even no votes. And there seems to be absolutely no relation between how a challenge is rated in the sandbox and how it performs on the main side.&lt;/p&gt;&#xA;&lt;p&gt;For example, I had a clear duplicate (hard to find, I have to admit) in the sandbox, two upvotes, no comment, which luckily got identified as duplicate on the main side before it received answers. But who knows whether someone did already invest time in a solution?&lt;/p&gt;&#xA;&lt;p&gt;And lately after ten well-received challenges I posted one, which originally had a problem leading to downvotes and comments &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/26059/72726&quot;&gt;in the sandbox&lt;/a&gt;, but after addressing those problems got three upvotes, so I moved it to &lt;a href=&quot;https://codegolf.stackexchange.com/q/269006/72726&quot;&gt;the main site&lt;/a&gt;, where there were additional questions (can happen), but the challenge got closed as unclear extremely fast without open questions in the comments.&lt;/p&gt;&#xA;&lt;p&gt;I find this really sad. I don't even understand how people prefer closing a question over looking in the sandbox and commenting. If someone wants to improve a site, the sandbox seems to be the best way to go. I like to encourage experienced users to rethink how to improve how the sandbox works. In software engineering we try to find problems as early as possible, so I think for each close vote you should comment on around ten sandbox challenges, if you really want to improve the quality.&lt;/p&gt;&#xA;" OwnerUserId="72726" LastActivityDate="2024-01-07T14:53:58.630" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26222" PostTypeId="2" ParentId="2140" CreationDate="2024-01-08T15:20:22.920" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/270260/72726&quot;&gt;Sum up snail number neighbours&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="72726" LastEditorUserId="72726" LastEditDate="2024-02-23T06:16:55.810" LastActivityDate="2024-02-23T06:16:55.810" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26223" PostTypeId="2" ParentId="2140" CreationDate="2024-01-08T19:54:06.150" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/269204/divmod-continuously-until-the-remainder-is-1-or-0-then-get-the-remainder&quot;&gt;Divmod continuosly until the remainder is 1 or 0, then get the remainder&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="106959" LastEditorUserId="100664" LastEditDate="2024-02-08T01:10:00.713" LastActivityDate="2024-02-08T01:10:00.713" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26224" PostTypeId="2" ParentId="2140" CreationDate="2024-01-09T02:06:24.640" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/269151/91472&quot;&gt;Validate a CPF number&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91472" LastEditorUserId="91472" LastEditDate="2024-01-11T19:48:05.433" LastActivityDate="2024-01-11T19:48:05.433" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26226" PostTypeId="2" ParentId="2140" CreationDate="2024-01-10T03:46:04.337" Score="0" Body="&lt;h1&gt;Circle to split points&lt;/h1&gt;&#xA;&lt;p&gt;Given two sets of points, decide whether there's a circle that split them.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Treating points exactly on circle as inside or outside are allowed as radius +/-eps&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Maybe one input forced inside and one outside?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2024-01-10T03:46:04.337" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26227" PostTypeId="2" ParentId="2140" CreationDate="2024-01-11T02:30:24.413" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/269682/possible-moves-in-othello-reversi&quot;&gt;Possible moves in Othello/Reversi&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91262" LastEditorUserId="91262" LastEditDate="2024-02-02T01:00:50.687" LastActivityDate="2024-02-02T01:00:50.687" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26228" PostTypeId="2" ParentId="2140" CreationDate="2024-01-11T19:39:58.610" Score="1" Body="&lt;h1&gt;Is it mate in one?&lt;/h1&gt;&#xA;&lt;p&gt;Given a 8x8 chessboard, determine if white can checkmate black in one move. For this challenge, you may assume there are only 4 types of pieces:&lt;/p&gt;&#xA;&lt;p&gt;kings (represented by a &amp;quot;k&amp;quot;)&lt;/p&gt;&#xA;&lt;p&gt;queens (represented by a &amp;quot;q&amp;quot;)&lt;/p&gt;&#xA;&lt;p&gt;rooks (represented by a &amp;quot;r&amp;quot;)&lt;/p&gt;&#xA;&lt;p&gt;and knights (represented by a &amp;quot;n&amp;quot;.)&lt;/p&gt;&#xA;&lt;p&gt;The black version of these pieces are the capital version of the white pieces. You may assume both sides start with a king, and that every position will be legal, (e. g. there won't be any positions where white can just take black's king) and white will never be in check. Squares with no pieces on them can be any char you like that is not in &amp;quot;kqrnKQRN&amp;quot;. You will not have to consider short or long castles. All pieces move the same way they do in normal chess.&lt;/p&gt;&#xA;&lt;h2&gt;An example&lt;/h2&gt;&#xA;&lt;p&gt;For example, in the following position:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;......RK&#xA;.......Q&#xA;........&#xA;......nq&#xA;.........&#xA;.........&#xA;.........&#xA;k.......&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;White can play the move Qxh7, checkmate.&lt;/p&gt;&#xA;&lt;hr/&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I have not tried this myself.&lt;/li&gt;&#xA;&lt;li&gt;Any suggestions or/for test cases?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="105116" LastActivityDate="2024-01-11T19:39:58.610" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26229" PostTypeId="2" ParentId="2140" CreationDate="2024-01-12T18:53:21.520" Score="2" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/269988/the-primitive-circle-problem&quot;&gt;The primitive circle problem&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="119544" LastEditorUserId="119544" LastEditDate="2024-02-11T15:55:00.580" LastActivityDate="2024-02-11T15:55:00.580" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26230" PostTypeId="2" ParentId="2140" CreationDate="2024-01-12T19:15:39.553" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/269222/91472&quot;&gt;Find the child anagrams of a word&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91472" LastEditorUserId="91472" LastEditDate="2024-01-14T15:05:22.957" LastActivityDate="2024-01-14T15:05:22.957" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26231" PostTypeId="2" ParentId="2140" CreationDate="2024-01-12T23:15:28.167" Score="0" Body="&lt;h1&gt;Battle Simulator KOTH&lt;/h1&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;In this king-of-the-hill challenge, each player/bot is assigned a random character and is then put in a 10x10 grid. Each character has 2 different abilities and 1 ultimate ability. The goal of each player is to be the last man standing.&lt;/p&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;At the start of each game, each bot is given 10 health and 10 points to freely distribute through these 3 categories:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Speed&lt;/strong&gt; (for example if you have three speed you can go up 2 and left 1 in one turn)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Dexterity&lt;/strong&gt; (the more dexterity you have the less chance you have of getting hit by an attack. For example if you have 3 dexterity and was attacked by an attack that does 4 damage, there is a 3 * 3 = 9% chance you dodge it where the second 3 is a constant.)&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Defense&lt;/strong&gt; (let's say you have 3 defense and was hit by an attack that does 5 damage. Then you will take a random amount of damage from 1 to 1 where the second 1 is attack strength - defense / 2)&lt;/p&gt;&#xA;&lt;p&gt;Each bot is also randomly assigned one of these two characters:&lt;/p&gt;&#xA;&lt;h4&gt;Swordsman:&lt;/h4&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Normal ability (Stab):&#xA;&lt;ul&gt;&#xA;&lt;li&gt;0 (turns of) recharge&lt;/li&gt;&#xA;&lt;li&gt;does 1 damage&lt;/li&gt;&#xA;&lt;li&gt;hits the three tiles in front of him&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Special ability 1 (Circle Slash):&#xA;&lt;ul&gt;&#xA;&lt;li&gt;2 recharge&lt;/li&gt;&#xA;&lt;li&gt;does 2 damage&lt;/li&gt;&#xA;&lt;li&gt;hits the 9 tiles surrounding him&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Special ability 2 (Multi-Sword):&#xA;&lt;ul&gt;&#xA;&lt;li&gt;4 recharge&lt;/li&gt;&#xA;&lt;li&gt;does 2 damage&lt;/li&gt;&#xA;&lt;li&gt;hits the three closest enemies&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;h5&gt;Ultimate Ability (Explosion):&lt;/h5&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;10 recharge (cannot be used at beginning of game)&lt;/li&gt;&#xA;&lt;li&gt;does 6 damage&lt;/li&gt;&#xA;&lt;li&gt;hits the first player in front of him and triggers a 6x6 explosion&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h4&gt;Wizard&lt;/h4&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Normal ability (Burn):&#xA;&lt;ul&gt;&#xA;&lt;li&gt;0 recharge&lt;/li&gt;&#xA;&lt;li&gt;does 2 damage&lt;/li&gt;&#xA;&lt;li&gt;hits the tile directly in front of him&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Special ability 1 (Freeze):&#xA;&lt;ul&gt;&#xA;&lt;li&gt;3 recharge&lt;/li&gt;&#xA;&lt;li&gt;does 1 damage&lt;/li&gt;&#xA;&lt;li&gt;freezes the first enemy in front of him for 2 turns&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Special ability 2 (Zap):&#xA;&lt;ul&gt;&#xA;&lt;li&gt;5 recharge&lt;/li&gt;&#xA;&lt;li&gt;does 2 damage&lt;/li&gt;&#xA;&lt;li&gt;zaps the five closest enemies, twice&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;h5&gt;Ultimate ability (Weaken):&lt;/h5&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;15 recharge (cannot be used at the beginning of game)&lt;/li&gt;&#xA;&lt;li&gt;0 damage&lt;/li&gt;&#xA;&lt;li&gt;halves all stats of all other players (can stack)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;However, there is a twist. Each bot does &lt;strong&gt;NOT&lt;/strong&gt; know what character type they are.&lt;/p&gt;&#xA;&lt;h2&gt;Turns&lt;/h2&gt;&#xA;&lt;p&gt;Each turn, every player does one of the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Do nothing (lol)&lt;/li&gt;&#xA;&lt;li&gt;Use an attack that is not on cooldown (attacks can miss)&lt;/li&gt;&#xA;&lt;li&gt;Move&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;When a player is hit by an attack, their health goes down by how strong the attack is and is also hit by status effects should the attack have them. If a player's health reaches zero, they are defeated (e. g. removed from the game) and are replaced by a rock other players may not pass through. If a player tries to move through a rock or another player, they simply end up in front of it and do not go through.&lt;/p&gt;&#xA;&lt;p&gt;The game ends in 100 turns or only one player remains, whichever comes first. If the game lasts that long, the winner is the one with most eliminations. If there still is a tie, all tied bots receive a point for that round. Of course, if only one player remains before the 100 turns, that player wins the round and gets a point.&lt;/p&gt;&#xA;&lt;h2&gt;How bots work&lt;/h2&gt;&#xA;&lt;p&gt;Bots should be written in Python, but I will try to support other mainline languages by translating them into Python.&lt;/p&gt;&#xA;&lt;p&gt;The basic boilerplate code for a bot is this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;class MyBotThatWillHopefullyWin(Bot):&#xA;    def __init(self)__:&#xA;        super().__init__(self, &amp;lt;speed&amp;gt;, &amp;lt;dexterity&amp;gt;, &amp;lt;defense&amp;gt;)&#xA;    &#xA;    def turn():&#xA;        &amp;lt;insert logic&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The turn function is basically your main function and will be executed for every turn your bot is alive for. It should return one of four values:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;return &amp;quot;move&amp;quot;, &amp;lt;x&amp;gt;, &amp;lt;y&amp;gt;&lt;/code&gt; to move (duh.) Or in more specific terms, &lt;code&gt;Tuple[Union[str, Union[int, int]]]&lt;/code&gt; where &lt;code&gt;str&lt;/code&gt; must be &lt;code&gt;move&lt;/code&gt; and &lt;code&gt;abs(x + y)&lt;/code&gt; must be &amp;lt;= &lt;code&gt;self.speed&lt;/code&gt; (the first value you put in the super definition.) If this condition is not satisfied, nothing happens that turn. Note how you cannot leave the confines of the 10x10 grid or move and attack or vice versa in the same turn.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;return &amp;quot;basic attack&amp;quot;&lt;/code&gt; to do the (randomly predetermined) charector's basic attack.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;return &amp;quot;ability&amp;quot;, &amp;lt;ability number&amp;gt;&lt;/code&gt; to do one of the charector's abilities. &lt;code&gt;1&lt;/code&gt; is the charector's first special ability, &lt;code&gt;2&lt;/code&gt; is the second, and &lt;code&gt;3&lt;/code&gt; is the ultimate ability. If the ability numberis not in the range 1-3 or the attack is still on cooldown, nothing happens.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;return &amp;quot;nothing&amp;quot;&lt;/code&gt; to do nothing. But why tho?&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Here is the list of methods bots have available to them: (accessed by &lt;code&gt;self.&amp;lt;method name(&amp;lt;parameters, if any&amp;gt;)&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2024-01-19T21:01:47.847" LastActivityDate="2024-01-19T21:01:47.847" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26232" PostTypeId="1" CreationDate="2024-01-13T01:09:05.670" Score="3" ViewCount="151" Body="&lt;p&gt;I'd like to shorten my answer below by applying this tio.run technique from this &lt;a href=&quot;https://tio.run/##bci9CoMwEADg3ccQhDtNqLHdjvRJuhwpsYJ/nA5XxFdvunRrvvELtg8hJTFMERSPuAiwF6@1EltLKNa/3uuyA1faOMMXxbuS@lstjaMzTTzMgEdRrDLMe4Syej7m0kRwiPSXXS6vuXRtftvsd78/0yfEkfst2XH6Ag&quot; rel=&quot;nofollow noreferrer&quot;&gt;C example&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Here's their C example&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Code&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;r,a;f(x){for(a=r=x*x;a--;)r-=hypot(a%x+1,a/x)&amp;gt;x;x=4*r+1;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Footer&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;main(){&#xA;&#xA;printf(&amp;quot;%d\n&amp;quot;,f(1));&#xA;printf(&amp;quot;%d\n&amp;quot;,f(2));&#xA;printf(&amp;quot;%d\n&amp;quot;,f(3));&#xA;printf(&amp;quot;%d\n&amp;quot;,f(10));&#xA;printf(&amp;quot;%d\n&amp;quot;,f(1000));&#xA;printf(&amp;quot;%d\n&amp;quot;,f(2000));&#xA;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;but I don't understand how the result is returned from the f() function?&lt;/p&gt;&#xA;&lt;p&gt;Here's my C code below and I'd like to remove the &lt;code&gt;main&lt;/code&gt;, &lt;code&gt;return&lt;/code&gt;, &lt;code&gt;printf&lt;/code&gt; and just reduce it to the bare minimum bytes using their footer technique etc.,... also, @qwr noted&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I think meta consensus is that you can write a function instead of a&#xA;whole program.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Thanks.&lt;/p&gt;&#xA;&lt;h1&gt;C (gcc), 116 bytes&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;a,x,y;c(r){for(x=-r;x&amp;lt;=r;x++)for(y=-r;y&amp;lt;=r;a+=x*x+y*y&amp;lt;=r*r,y++);return a;}main(r){scanf(&amp;quot;%u&amp;quot;,&amp;amp;r);printf(&amp;quot;%d&amp;quot;,c(r));}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;How it works&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This inefficient method draws a square around the circle then iterates through all lattice points &lt;span class=&quot;math-container&quot;&gt;\$(x,y)\$&lt;/span&gt; within it and checking if &lt;span class=&quot;math-container&quot;&gt;\$x^2+y^2 \le r^2 \$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##FY3bCsIwEER/RQJKrtA@r/mYZTWloFG2LSZIf921@zJwDsMMpYlIBGOLHciy@5YX25YTQ7vmI0JwarqargZDbr6F7pU8x340gO/rxvWEsD9xrjqzENZizXkz8cIO3jzXVflmot442EXGYRh/VB44LZI@fw&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="119544" LastEditorUserId="16766" LastEditDate="2024-04-04T21:05:37.507" LastActivityDate="2024-04-04T21:05:37.507" Title="Using tio.run, how does this C function return a value?" Tags="|discussion|code-golf|" AnswerCount="2" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26233" PostTypeId="2" ParentId="2140" CreationDate="2024-01-13T03:50:49.243" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Aircraft registration numbers&lt;/h1&gt;&#xA;&lt;p&gt;Write a program that takes a United States aircraft registration number and returns a 24-bit ICAO hex code corresponding to that registration and vice-versa.&lt;/p&gt;&#xA;&lt;p&gt;An aircraft registration number always begins with an N and is followed by 1 to 5 characters: 1 to 5 digits and then 0 to 2 letters. That is, one of the following three patterns:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;N plus 1 to 5 digits&lt;/li&gt;&#xA;&lt;li&gt;N plus 1 to 4 digits then one letter&lt;/li&gt;&#xA;&lt;li&gt;N plus 1 to 3 digits then two letters&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The first digit cannot be 0 and the letters I and O are not used. The letters always follow the digits.&lt;/p&gt;&#xA;&lt;p&gt;ICAO hex codes assigned to the US are numbers from A00001 to ADF7C7 (in hexadecimal). They are assigned in alphanumeric order: A00001 corresponds to N1, A00002 corresponds to N1A, A00003 to N1AA, A00004 to N1AB, etc., up to ADF7C7 for N99999.&lt;/p&gt;&#xA;&lt;p&gt;Some test cases:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Registration&lt;/th&gt;&#xA;&lt;th&gt;ICAO code (hex)&lt;/th&gt;&#xA;&lt;th&gt;ICAO code (decimal)&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;N17CA&lt;/td&gt;&#xA;&lt;td&gt;A11707&lt;/td&gt;&#xA;&lt;td&gt;10557191&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;N1PP&lt;/td&gt;&#xA;&lt;td&gt;A00155&lt;/td&gt;&#xA;&lt;td&gt;10486101&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;N959ZP&lt;/td&gt;&#xA;&lt;td&gt;AD5863&lt;/td&gt;&#xA;&lt;td&gt;11360355&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;N999ZZ&lt;/td&gt;&#xA;&lt;td&gt;ADF669&lt;/td&gt;&#xA;&lt;td&gt;11400809&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&#xA;&lt;p&gt;You can assume no invalid inputs will be given.&lt;/p&gt;&#xA;" OwnerUserId="58834" LastEditorUserId="58834" LastEditDate="2024-01-15T15:50:39.923" LastActivityDate="2024-01-15T15:50:39.923" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26234" PostTypeId="2" ParentId="2140" CreationDate="2024-01-13T10:12:12.620" Score="0" Body="&lt;h1&gt;The Elements Of The Periodic Table!&lt;/h1&gt;&#xA;&lt;p&gt;The challenge is to take input as an integer between 1 and 118 inclusive, then output the name of the chemical element with that atomic number.&lt;/p&gt;&#xA;&lt;p&gt;Capitalisation as well as trailing and leading whitespace do not matter.&lt;/p&gt;&#xA;&lt;p&gt;You should call the chemical elements by their 2024 names, for example 113 outputs &lt;code&gt;nihonium&lt;/code&gt; and not &lt;code&gt;ununtrium&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For ease of golfing, element 16 can be either &lt;code&gt;sulfur&lt;/code&gt; or &lt;code&gt;sulphur&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;1 -&amp;gt; hydrogen&#xA;2 -&amp;gt; helium&#xA;3 -&amp;gt; lithium&#xA;4 -&amp;gt; beryllium&#xA;5 -&amp;gt; boron&#xA;6 -&amp;gt; carbon&#xA;117 -&amp;gt; tennessine&#xA;118 -&amp;gt; oganesson&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Use any language, shortest code in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="112690" LastActivityDate="2024-01-13T10:12:12.620" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26235" PostTypeId="2" ParentId="26232" CreationDate="2024-01-14T01:29:41.890" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/users/52904/ceilingcat&quot;&gt;@ceilingcat&lt;/a&gt; reduced it from 116 to 68 bytes.&lt;/p&gt;&#xA;&lt;h1&gt;C (gcc), 68 bytes&lt;/h1&gt;&#xA;&lt;pre&gt;&lt;code&gt;a,x,y;c(r){a=0;for(x=~r;x++&amp;lt;r;)for(y=~r;y++&amp;lt;r;)a+=x*x+y*y&amp;lt;=r*r;x=a;}&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://tio.run/##dY3NCsIwEITvPoUUhPwVUj1u8yZelpWUgkZZCyaU9tEbLXqzOX7fzDBUd0Q5o4kmAQmWIzoL/s4iupkhat0yyJXTyunLqF1UUSeVWsfqU3MIU75hH4Qcd/sH92HwojpczqEyJBop4d8eN@1p0za2oG0xKJz@FlNeyF@xe@b69QY&quot; rel=&quot;nofollow noreferrer&quot;&gt;Try it online!&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="119544" LastActivityDate="2024-01-14T01:29:41.890" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26236" PostTypeId="2" ParentId="2140" CreationDate="2024-01-14T22:56:55.890" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/269486/complete-a-mystery-sequence&quot;&gt;Complete a mystery sequence&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Given a sequence of three integers, determine if the sequence is arithmetic (of the form &lt;code&gt;[a, a+d, a+2*d]&lt;/code&gt;) or geometric (of the form &lt;code&gt;[a, a*r, a*r^2]&lt;/code&gt;) by outputting a fourth term that completes it (&lt;code&gt;a+3*d&lt;/code&gt; for arithmetic, &lt;code&gt;a*r^3&lt;/code&gt; for geometric).&lt;/p&gt;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[1, 2, 3] -&amp;gt; 4 (This is an arithmetic sequence with a difference of 1)&#xA;[2, 4, 8] -&amp;gt; 16 (This is a geometric sequence with a ratio 2)&#xA;[20, 15, 10] -&amp;gt; 5 (arithmetic sequence, d=-5)&#xA;[6, 6, 6] -&amp;gt; 6 (arithmetic with d=0 OR geometric with r=1)&#xA;[3, -9, 27] -&amp;gt; -81 (geometric with r=-3)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Input is guaranteed to be a valid arithmetic and/or geometric sequence (so you won't have to handle something like &lt;code&gt;[10, 0, 99]&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;For geometric sequences, the ratio between terms is guaranteed to be an integer (ie. &lt;code&gt;[4, 6, 9]&lt;/code&gt; would be an invalid input, as the ratio would be 1.5)&lt;/li&gt;&#xA;&lt;li&gt;If a sequence could be either arithmetic or geometric, you may output either term that completes it&lt;/li&gt;&#xA;&lt;li&gt;This is code golf, so aim for the lowest byte count possible!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Notes:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I'm not sure if there is a sequence that could be completed two different ways. I'd assume there is, but I haven't found it (although I haven't been looking for very long)&lt;/li&gt;&#xA;&lt;li&gt;Is this too much of an A/B challenge?&lt;/li&gt;&#xA;&lt;li&gt;Title suggestions would be appreciated&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="120591" LastEditorUserId="120591" LastEditDate="2024-01-23T13:15:50.870" LastActivityDate="2024-01-23T13:15:50.870" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="26237" PostTypeId="2" ParentId="2140" CreationDate="2024-01-15T02:32:43.657" Score="2" Body="&lt;h1&gt;How many people are awake?&lt;/h1&gt;&#xA;&lt;p&gt;The following data contains the population of each timezone in the world (&lt;a href=&quot;https://observablehq.com/@mattdzugan/population-by-time-zone-creating-a-dataset&quot; rel=&quot;nofollow noreferrer&quot;&gt;source&lt;/a&gt;):&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;UTC;Population (in thousands)&#xA;-11;57&#xA;-10;1853&#xA;-9.5;8&#xA;-9;639&#xA;-8;66121&#xA;-7;41542&#xA;-6;272974&#xA;-5;332101&#xA;-4.5;31923&#xA;-4;77707&#xA;-3.5;499&#xA;-3;248013&#xA;-2;4855&#xA;-1;3285&#xA;0;285534&#xA;+1;857443&#xA;+2;609921&#xA;+3;496279&#xA;+3.5;81889&#xA;+4;129089&#xA;+4.5;31042&#xA;+5;305642&#xA;+5.5;1458945&#xA;+6;199668&#xA;+6.5;50112&#xA;+7;439650&#xA;+8;1679526&#xA;+9;220112&#xA;+9.5;1814&#xA;+10;29482&#xA;+11;5267&#xA;+11.5;2&#xA;+12;6112&#xA;+13;308&#xA;+14;11&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;(for the sake of simplicity, I'm removing &lt;code&gt;+X.75&lt;/code&gt; UTC times from the list)&lt;/p&gt;&#xA;&lt;p&gt;Assuming that every person in the world wakes up at 8AM and goes to sleep at 12AM (in their local time), how many people are simultaneously awake in the world at a given UTC time?&lt;/p&gt;&#xA;&lt;p&gt;For example, suppose the given time is 2PM UTC. These are the timezones where the local time at 2PM UTC is between 8AM inclusive and 12AM exclusive:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  -6 08:00 272974&#xA;  -5 09:00 332101&#xA;-4.5 09:30 31923&#xA;  -4 10:00 77707&#xA;-3.5 10:30 499&#xA;  -3 11:00 248013&#xA;  -2 12:00 4855&#xA;  -1 13:00 3285&#xA;  +0 14:00 285534&#xA;  +1 15:00 857443&#xA;  +2 16:00 609921&#xA;  +3 17:00 496279&#xA;+3.5 17:30 81889&#xA;  +4 18:00 129089&#xA;+4.5 18:30 31042&#xA;  +5 19:00 305642&#xA;+5.5 19:30 1458945&#xA;  +6 20:00 199668&#xA;+6.5 20:30 50112&#xA;  +7 21:00 439650&#xA;  +8 22:00 1679526&#xA;  +9 23:00 220112&#xA;+9.5 23:30 1814&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Now, just add the population of these timezones and output 7818023 (corresponding to ~7.8 billion people).&lt;/p&gt;&#xA;&lt;h2&gt;Input&lt;/h2&gt;&#xA;&lt;p&gt;An UTC time. You may accept one of the following (or all of them):&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;two natural numbers &lt;em&gt;&lt;strong&gt;h&lt;/strong&gt;&lt;/em&gt; and &lt;em&gt;&lt;strong&gt;m&lt;/strong&gt;&lt;/em&gt;, where &lt;em&gt;&lt;strong&gt;0 ≤ h ≤ 23&lt;/strong&gt;&lt;/em&gt; and &lt;em&gt;&lt;strong&gt;m ∈ {0, 30}&lt;/strong&gt;&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;a real number &lt;em&gt;&lt;strong&gt;r&lt;/strong&gt;&lt;/em&gt;, where &lt;em&gt;&lt;strong&gt;0 ≤ r &amp;lt; 24&lt;/strong&gt;&lt;/em&gt; and its fractional part can be only 0 or 5 (so &lt;em&gt;&lt;strong&gt;r = 23.5&lt;/strong&gt;&lt;/em&gt; corresponds to 23:30).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/q/2447/91472&quot;&gt;Standard I/O&lt;/a&gt; applies, so you can accept them as lists, strings, etc. You can even accept &lt;em&gt;&lt;strong&gt;m&lt;/strong&gt;&lt;/em&gt; as a boolean value, where 0 means &lt;code&gt;HH:00&lt;/code&gt; and 1 means &lt;code&gt;HH:30&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;There are two ways of solving this question: hardcoding the output (since there are only 48 possible inputs) or hardcoding the population data and solving by time arithmetic. However, to make this challenge more interesting, you are allowed to accept the population data as an additional input, so you don't need to hardcode it (thus saving you some bytes) and focusing only on the time arithmetic. So you can read it as additional lines from STDIN or an additional function argument.&lt;/p&gt;&#xA;&lt;h2&gt;Output&lt;/h2&gt;&#xA;&lt;p&gt;How many people are awake at the given time, in thousands.&lt;/p&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;pre class=&quot;lang-none prettyprint-override&quot;&gt;&lt;code&gt;00:00 -&amp;gt; 1942634&#xA;00:30 -&amp;gt; 1942634&#xA;01:00 -&amp;gt; 2382284&#xA;01:30 -&amp;gt; 2432396&#xA;02:00 -&amp;gt; 2632064&#xA;02:30 -&amp;gt; 4091009&#xA;03:00 -&amp;gt; 4396651&#xA;03:30 -&amp;gt; 4427693&#xA;04:00 -&amp;gt; 4556782&#xA;04:30 -&amp;gt; 4638671&#xA;05:00 -&amp;gt; 5134950&#xA;05:30 -&amp;gt; 5134950&#xA;06:00 -&amp;gt; 5744871&#xA;06:30 -&amp;gt; 5744871&#xA;07:00 -&amp;gt; 6602314&#xA;07:30 -&amp;gt; 6602314&#xA;08:00 -&amp;gt; 6887848&#xA;08:30 -&amp;gt; 6887848&#xA;09:00 -&amp;gt; 6891133&#xA;09:30 -&amp;gt; 6891133&#xA;10:00 -&amp;gt; 6895977&#xA;10:30 -&amp;gt; 6895977&#xA;11:00 -&amp;gt; 7143682&#xA;11:30 -&amp;gt; 7144181&#xA;12:00 -&amp;gt; 7215776&#xA;12:30 -&amp;gt; 7247697&#xA;13:00 -&amp;gt; 7574531&#xA;13:30 -&amp;gt; 7574531&#xA;14:00 -&amp;gt; 7818023&#xA;14:30 -&amp;gt; 7816209&#xA;15:00 -&amp;gt; 7637639&#xA;15:30 -&amp;gt; 7637639&#xA;16:00 -&amp;gt; 6024234&#xA;16:30 -&amp;gt; 6024234&#xA;17:00 -&amp;gt; 5585223&#xA;17:30 -&amp;gt; 5535119&#xA;18:00 -&amp;gt; 5337304&#xA;18:30 -&amp;gt; 3878359&#xA;19:00 -&amp;gt; 3572774&#xA;19:30 -&amp;gt; 3541732&#xA;20:00 -&amp;gt; 3412643&#xA;20:30 -&amp;gt; 3330754&#xA;21:00 -&amp;gt; 2834475&#xA;21:30 -&amp;gt; 2834475&#xA;22:00 -&amp;gt; 2224554&#xA;22:30 -&amp;gt; 2224554&#xA;23:00 -&amp;gt; 1367111&#xA;23:30 -&amp;gt; 1367111&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/time&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;time&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;time&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-time-tooltip-container&quot;&gt;time&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="91472" LastActivityDate="2024-01-15T02:32:43.657" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26238" PostTypeId="2" ParentId="2140" CreationDate="2024-01-17T20:12:00.133" Score="2" Body="&lt;h1&gt;Accumulate spare change&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-math-tooltip-container&quot;&gt;math&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/currency&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;currency&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;currency&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-currency-tooltip-container&quot;&gt;currency&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;In this challenge, given some cash, you'll pay for various items as simply as possible (e.g., one $20 bill for a $17 purchase), and get spare change in return. Your task is to figure out what bills and coins you have after all of the transactions.&lt;/p&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;p&gt;Your input will be an initial amount of cash, and a list of zero or more prices of items. You can take these either as dollars with decimal cents ($12.95 = &lt;code&gt;12.95&lt;/code&gt;) or as an integer number of cents ($12.95 = &lt;code&gt;1295&lt;/code&gt;). The prices of items will not exceed the initial amount of cash, and no inputs will contain fractional cents.&lt;/p&gt;&#xA;&lt;h3&gt;Task&lt;/h3&gt;&#xA;&lt;p&gt;First, you'll break down your inputted cash into bills and coins, such that the minimum number of bills/coins are required. The following bills and coins exist:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;$100&lt;/li&gt;&#xA;&lt;li&gt;$50&lt;/li&gt;&#xA;&lt;li&gt;$20&lt;/li&gt;&#xA;&lt;li&gt;$10&lt;/li&gt;&#xA;&lt;li&gt;$5&lt;/li&gt;&#xA;&lt;li&gt;$1&lt;/li&gt;&#xA;&lt;li&gt;$0.25&lt;/li&gt;&#xA;&lt;li&gt;$0.10&lt;/li&gt;&#xA;&lt;li&gt;$0.05&lt;/li&gt;&#xA;&lt;li&gt;$0.01&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Then, for each item purchased, you'll pay using the fewest bills/coins possible, and you'll get change in return. If there are multiple possibilities (e.g., for $45, you could pay with a $50 or a $100), choose the closest one. The only exception is if it's possible to pay using 2-4 of the same bill/coin instead of one that's larger than doing it that way (e.g., $40 as 2 $20 bills, or $1 as 4 $0.25 coins if a $1 bill isn't available, but never 4 $5 bills instead of one $20 bill).&lt;/p&gt;&#xA;&lt;h3&gt;Output&lt;/h3&gt;&#xA;&lt;p&gt;Your output will be the number of each bill and coin remaining after the transactions are complete.&lt;/p&gt;&#xA;&lt;h3&gt;Example&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Initial cash:&lt;/strong&gt; $70&lt;/p&gt;&#xA;&lt;p&gt;You now have $50 + $20.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Transactions:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;$11: You pay with $20, and now have $50 + $5 + $1 × 4&lt;/li&gt;&#xA;&lt;li&gt;$0.65: You pay with $1, and now have $50 + $5 + $1 × 3 + $0.25 + $0.10&lt;/li&gt;&#xA;&lt;li&gt;$18.75: You pay with $50, and now have $20 + $10 + $5 + $1 × 2 + $0.25 × 2 + $0.10&lt;/li&gt;&#xA;&lt;li&gt;$25: You pay with $20 + $5, and now have $10 + $1 × 2 + $0.25 × 2 + $0.10&lt;/li&gt;&#xA;&lt;li&gt;$2: You pay with $1 × 2, and now have $10 + $0.25 × 2 + $0.10&lt;/li&gt;&#xA;&lt;li&gt;$4.25: You pay with $10, and now have $5 + $0.25 × 5 + $0.10&lt;/li&gt;&#xA;&lt;li&gt;$1: You pay with $0.25 × 4, and now have $5 + $0.25 + $0.10&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output:&lt;/strong&gt; $5 + $0.10&lt;/p&gt;&#xA;" OwnerUserId="79857" LastActivityDate="2024-01-17T20:12:00.133" CommentCount="7" ContentLicense="CC BY-SA 4.0" />
  <row Id="26240" PostTypeId="2" ParentId="2140" CreationDate="2024-01-20T19:41:03.030" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/269468/100234&quot;&gt;Validate a codice fiscale&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100234" LastEditorUserId="100234" LastEditDate="2024-01-22T10:34:43.730" LastActivityDate="2024-01-22T10:34:43.730" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26241" PostTypeId="2" ParentId="2140" CreationDate="2024-01-21T20:23:26.853" Score="0" Body="&lt;h1&gt;ahee bee cee dee ehee fee...&lt;/h1&gt;&#xA;&lt;p&gt;Given a string with no whitespace, replace the first letter of the string with every letter in the english lowercase alphabet. However, if the input string starts with a vowel (excluding y), then there should be an extra &lt;code&gt;h&lt;/code&gt; after (the prefixes &lt;code&gt;aeiou&lt;/code&gt;.)&lt;/p&gt;&#xA;&lt;p&gt;For example, if the input string is &lt;code&gt;ee&lt;/code&gt;, your program should output:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;ahe&#xA;be&#xA;ce&#xA;de&#xA;ehe&#xA;fe&#xA;ge&#xA;he&#xA;ihe&#xA;je&#xA;ke&#xA;le&#xA;me&#xA;ne&#xA;ohe&#xA;pe&#xA;qe&#xA;re&#xA;see&#xA;te&#xA;uhe&#xA;ve&#xA;we&#xA;xe&#xA;ye&#xA;ze&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2024-01-22T14:27:24.720" LastActivityDate="2024-01-22T14:27:24.720" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26242" PostTypeId="2" ParentId="2140" CreationDate="2024-01-21T23:29:42.733" Score="0" Body="&lt;h1&gt;What are the current football (soccer) league positions?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/English_Football_League&quot; rel=&quot;nofollow noreferrer&quot;&gt;English football is structured into leagues with varying numbers of clubs.&lt;/a&gt; For example, the EFL Championship has 24 clubs. During each season, each side will play every other side twice (once at home and once away); for a 24-club league, this gives 46 matches for each team in total. Teams score three points for a win, one for a draw and none for a loss. The ranking in the league is determined by:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Points gained&lt;/li&gt;&#xA;&lt;li&gt;Goal difference&lt;/li&gt;&#xA;&lt;li&gt;Goals scored&lt;/li&gt;&#xA;&lt;li&gt;Head-to-head record&lt;/li&gt;&#xA;&lt;li&gt;Alphabetical order (unless the position is relevant for a promotion, relegation or play-off space, but this has never happened, and will not need to be handled for this challenge)&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;h3&gt;Input&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A list of games played so far in the league, indicating the home team, away team, score for&#xA;the home team and score for the away team.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Desired output&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A list of teams in position order, either highest to lowest or lowest to highest (but must be consistent for all inputs).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Rules and assumptions&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Teams can be represented in whatever way the answerer prefers. You may take actual team names, integers, or any other standard input provided the team name does not somehow encode its position in the league and none of the default loopholes are violated. Team names in the output should match those in the input.&lt;/li&gt;&#xA;&lt;li&gt;All teams in the league will have played at least once at the time of asking, though they will not necessarily have all played each other by that stage, nor will they have necessarily played the same number of matches. Of note, the interim league tables for English football show the number of matches played, but the relative positioning does not take into account that one team may have matches in hand.&lt;/li&gt;&#xA;&lt;li&gt;You do not need to provide any of the stats typically presented in a football league table, just the ordering of teams.&lt;/li&gt;&#xA;&lt;li&gt;Default loopholes and standard I/O methods apply&lt;/li&gt;&#xA;&lt;li&gt;Although input is flexible, the home/away ordering should be preserved (so it is not valid to require the winning team always be listed first)&lt;/li&gt;&#xA;&lt;li&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; so the shortest code in bytes wins!&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Example input&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;[[&amp;quot;Leeds United&amp;quot;,2],[&amp;quot;Preston North End&amp;quot;,1]],&#xA;[[&amp;quot;Plymouth Argyle&amp;quot;,3],[&amp;quot;Cardiff City&amp;quot;,1]],&#xA;[[&amp;quot;Middlesbrough&amp;quot;,1],[&amp;quot;Rotherham United&amp;quot;,1]],&#xA;[[&amp;quot;Norwich City&amp;quot;,2],[&amp;quot;West Bromwich Albion&amp;quot;,0]],&#xA;[[&amp;quot;Stoke City&amp;quot;,1],[&amp;quot;Birmingham City&amp;quot;,2]],&#xA;[[&amp;quot;Queens Park Rangers&amp;quot;,2],[&amp;quot;Millwall&amp;quot;,0]],&#xA;[[&amp;quot;Sheffield Wednesday&amp;quot;,1],[&amp;quot;Coventry City&amp;quot;,2]],&#xA;[[&amp;quot;Blackburn Rovers&amp;quot;,1],[&amp;quot;Huddersfield Town&amp;quot;,1]],&#xA;[[&amp;quot;Bristol City&amp;quot;,1],[&amp;quot;Watford&amp;quot;,1]],&#xA;[[&amp;quot;Swansea City&amp;quot;,1],[&amp;quot;Southampton&amp;quot;,3]],&#xA;[[&amp;quot;Sunderland&amp;quot;,0],[&amp;quot;Hull City&amp;quot;,1]],&#xA;[[&amp;quot;Queens Park Rangers&amp;quot;,1],[&amp;quot;Watford&amp;quot;,2]],&#xA;[[&amp;quot;Ipswich Town&amp;quot;,2],[&amp;quot;Sunderland&amp;quot;,1]],&#xA;[[&amp;quot;Millwall&amp;quot;,1],[&amp;quot;Middlesbrough&amp;quot;,3]],&#xA;[[&amp;quot;Rotherham United&amp;quot;,0],[&amp;quot;Stoke City&amp;quot;,1]],&#xA;[[&amp;quot;Southampton&amp;quot;,4],[&amp;quot;Sheffield Wednesday&amp;quot;,0]],&#xA;[[&amp;quot;West Bromwich Albion&amp;quot;,4],[&amp;quot;Blackburn Rovers&amp;quot;,1]],&#xA;[[&amp;quot;Huddersfield Town&amp;quot;,1],[&amp;quot;Plymouth Argyle&amp;quot;,1]],&#xA;[[&amp;quot;Cardiff City&amp;quot;,0],[&amp;quot;Leeds United&amp;quot;,3]],&#xA;[[&amp;quot;Birmingham City&amp;quot;,2],[&amp;quot;Swansea City&amp;quot;,2]],&#xA;[[&amp;quot;Preston North End&amp;quot;,2],[&amp;quot;Bristol City&amp;quot;,0]],&#xA;[[&amp;quot;Coventry City&amp;quot;,3],[&amp;quot;Leicester City&amp;quot;,1]],&#xA;[[&amp;quot;Hull City&amp;quot;,1],[&amp;quot;Norwich City&amp;quot;,2]],&#xA;[[&amp;quot;Sheffield Wednesday&amp;quot;,3],[&amp;quot;Hull City&amp;quot;,1]],&#xA;[[&amp;quot;Norwich City&amp;quot;,1],[&amp;quot;Southampton&amp;quot;,1]],&#xA;[[&amp;quot;Blackburn Rovers&amp;quot;,2],[&amp;quot;Rotherham United&amp;quot;,2]],&#xA;[[&amp;quot;Bristol City&amp;quot;,0],[&amp;quot;Millwall&amp;quot;,1]],&#xA;[[&amp;quot;Leeds United&amp;quot;,3],[&amp;quot;Birmingham City&amp;quot;,0]],&#xA;[[&amp;quot;Leicester City&amp;quot;,4],[&amp;quot;Huddersfield Town&amp;quot;,1]],&#xA;[[&amp;quot;Middlesbrough&amp;quot;,1],[&amp;quot;Coventry City&amp;quot;,3]],&#xA;[[&amp;quot;Plymouth Argyle&amp;quot;,3],[&amp;quot;Watford&amp;quot;,3]],&#xA;[[&amp;quot;Stoke City&amp;quot;,0],[&amp;quot;Ipswich Town&amp;quot;,0]],&#xA;[[&amp;quot;Swansea City&amp;quot;,1],[&amp;quot;West Bromwich Albion&amp;quot;,0]],&#xA;[[&amp;quot;Queens Park Rangers&amp;quot;,1],[&amp;quot;Cardiff City&amp;quot;,2]],&#xA;[[&amp;quot;Sunderland&amp;quot;,2],[&amp;quot;Preston North End&amp;quot;,0]],&#xA;[[&amp;quot;West Bromwich Albion&amp;quot;,1],[&amp;quot;Leeds United&amp;quot;,0]],&#xA;[[&amp;quot;Ipswich Town&amp;quot;,0],[&amp;quot;Queens Park Rangers&amp;quot;,0]],&#xA;[[&amp;quot;Cardiff City&amp;quot;,0],[&amp;quot;Leicester City&amp;quot;,2]],&#xA;[[&amp;quot;Coventry City&amp;quot;,2],[&amp;quot;Swansea City&amp;quot;,2]],&#xA;[[&amp;quot;Huddersfield Town&amp;quot;,1],[&amp;quot;Middlesbrough&amp;quot;,2]],&#xA;[[&amp;quot;Hull City&amp;quot;,3],[&amp;quot;Blackburn Rovers&amp;quot;,2]],&#xA;[[&amp;quot;Rotherham United&amp;quot;,1],[&amp;quot;Sunderland&amp;quot;,1]],&#xA;[[&amp;quot;Millwall&amp;quot;,1],[&amp;quot;Norwich City&amp;quot;,0]],&#xA;[[&amp;quot;Preston North End&amp;quot;,0],[&amp;quot;Sheffield Wednesday&amp;quot;,1]],&#xA;[[&amp;quot;Watford&amp;quot;,1],[&amp;quot;Stoke City&amp;quot;,1]],&#xA;[[&amp;quot;Birmingham City&amp;quot;,0],[&amp;quot;Bristol City&amp;quot;,0]],&#xA;[[&amp;quot;Southampton&amp;quot;,2],[&amp;quot;Plymouth Argyle&amp;quot;,1]],&#xA;[[&amp;quot;Ipswich Town&amp;quot;,1],[&amp;quot;Leicester City&amp;quot;,1]],&#xA;[[&amp;quot;Birmingham City&amp;quot;,1],[&amp;quot;Stoke City&amp;quot;,3]],&#xA;[[&amp;quot;Rotherham United&amp;quot;,1],[&amp;quot;Middlesbrough&amp;quot;,0]],&#xA;[[&amp;quot;Southampton&amp;quot;,5],[&amp;quot;Swansea City&amp;quot;,0]],&#xA;[[&amp;quot;Hull City&amp;quot;,0],[&amp;quot;Sunderland&amp;quot;,1]],&#xA;[[&amp;quot;Huddersfield Town&amp;quot;,3],[&amp;quot;Blackburn Rovers&amp;quot;,0]],&#xA;[[&amp;quot;Coventry City&amp;quot;,2],[&amp;quot;Sheffield Wednesday&amp;quot;,0]],&#xA;[[&amp;quot;Cardiff City&amp;quot;,2],[&amp;quot;Plymouth Argyle&amp;quot;,2]],&#xA;[[&amp;quot;West Bromwich Albion&amp;quot;,1],[&amp;quot;Norwich City&amp;quot;,0]],&#xA;[[&amp;quot;Watford&amp;quot;,1],[&amp;quot;Bristol City&amp;quot;,4]],&#xA;[[&amp;quot;Millwall&amp;quot;,2],[&amp;quot;Queens Park Rangers&amp;quot;,0]],&#xA;[[&amp;quot;Preston North End&amp;quot;,2],[&amp;quot;Leeds United&amp;quot;,1]],&#xA;[[&amp;quot;Stoke City&amp;quot;,0],[&amp;quot;Millwall&amp;quot;,0]],&#xA;[[&amp;quot;Sunderland&amp;quot;,0],[&amp;quot;Coventry City&amp;quot;,3]],&#xA;[[&amp;quot;Sheffield Wednesday&amp;quot;,1],[&amp;quot;Cardiff City&amp;quot;,2]],&#xA;[[&amp;quot;Leicester City&amp;quot;,3],[&amp;quot;Rotherham United&amp;quot;,0]],&#xA;[[&amp;quot;Queens Park Rangers&amp;quot;,0],[&amp;quot;Southampton&amp;quot;,1]],&#xA;[[&amp;quot;Plymouth Argyle&amp;quot;,3],[&amp;quot;Birmingham City&amp;quot;,3]],&#xA;[[&amp;quot;Norwich City&amp;quot;,2],[&amp;quot;Huddersfield Town&amp;quot;,0]],&#xA;[[&amp;quot;Middlesbrough&amp;quot;,1],[&amp;quot;West Bromwich Albion&amp;quot;,0]],&#xA;[[&amp;quot;Blackburn Rovers&amp;quot;,1],[&amp;quot;Watford&amp;quot;,2]],&#xA;[[&amp;quot;Leeds United&amp;quot;,4],[&amp;quot;Ipswich Town&amp;quot;,0]],&#xA;[[&amp;quot;Swansea City&amp;quot;,2],[&amp;quot;Preston North End&amp;quot;,1]],&#xA;[[&amp;quot;Bristol City&amp;quot;,3],[&amp;quot;Hull City&amp;quot;,2]],&#xA;[[&amp;quot;Birmingham City&amp;quot;,2],[&amp;quot;Leicester City&amp;quot;,3]],&#xA;[[&amp;quot;West Bromwich Albion&amp;quot;,1],[&amp;quot;Stoke City&amp;quot;,1]],&#xA;[[&amp;quot;Plymouth Argyle&amp;quot;,3],[&amp;quot;Rotherham United&amp;quot;,2]],&#xA;[[&amp;quot;Swansea City&amp;quot;,1],[&amp;quot;Middlesbrough&amp;quot;,2]],&#xA;[[&amp;quot;Southampton&amp;quot;,4],[&amp;quot;Blackburn Rovers&amp;quot;,0]],&#xA;[[&amp;quot;Sheffield Wednesday&amp;quot;,2],[&amp;quot;Queens Park Rangers&amp;quot;,1]],&#xA;[[&amp;quot;Preston North End&amp;quot;,1],[&amp;quot;Watford&amp;quot;,5]],&#xA;[[&amp;quot;Millwall&amp;quot;,1],[&amp;quot;Huddersfield Town&amp;quot;,1]],&#xA;[[&amp;quot;Leeds United&amp;quot;,1],[&amp;quot;Coventry City&amp;quot;,1]],&#xA;[[&amp;quot;Hull City&amp;quot;,3],[&amp;quot;Cardiff City&amp;quot;,0]],&#xA;[[&amp;quot;Bristol City&amp;quot;,1],[&amp;quot;Sunderland&amp;quot;,0]],&#xA;[[&amp;quot;Ipswich Town&amp;quot;,2],[&amp;quot;Norwich City&amp;quot;,2]],&#xA;[[&amp;quot;Middlesbrough&amp;quot;,1],[&amp;quot;Hull City&amp;quot;,2]],&#xA;[[&amp;quot;Cardiff City&amp;quot;,0],[&amp;quot;Birmingham City&amp;quot;,1]],&#xA;[[&amp;quot;Coventry City&amp;quot;,1],[&amp;quot;Southampton&amp;quot;,1]],&#xA;[[&amp;quot;Norwich City&amp;quot;,3],[&amp;quot;Sheffield Wednesday&amp;quot;,1]],&#xA;[[&amp;quot;Leicester City&amp;quot;,3],[&amp;quot;Millwall&amp;quot;,2]],&#xA;[[&amp;quot;Queens Park Rangers&amp;quot;,0],[&amp;quot;Plymouth Argyle&amp;quot;,0]],&#xA;[[&amp;quot;Sunderland&amp;quot;,1],[&amp;quot;Leeds United&amp;quot;,0]],&#xA;[[&amp;quot;Watford&amp;quot;,1],[&amp;quot;Ipswich Town&amp;quot;,2]],&#xA;[[&amp;quot;Stoke City&amp;quot;,1],[&amp;quot;Swansea City&amp;quot;,1]],&#xA;[[&amp;quot;Rotherham United&amp;quot;,0],[&amp;quot;West Bromwich Albion&amp;quot;,2]],&#xA;[[&amp;quot;Huddersfield Town&amp;quot;,1],[&amp;quot;Preston North End&amp;quot;,3]],&#xA;[[&amp;quot;Blackburn Rovers&amp;quot;,2],[&amp;quot;Bristol City&amp;quot;,1]],&#xA;[[&amp;quot;Norwich City&amp;quot;,0],[&amp;quot;Preston North End&amp;quot;,0]],&#xA;[[&amp;quot;Cardiff City&amp;quot;,1],[&amp;quot;Millwall&amp;quot;,0]],&#xA;[[&amp;quot;Leicester City&amp;quot;,4],[&amp;quot;Plymouth Argyle&amp;quot;,0]],&#xA;[[&amp;quot;Middlesbrough&amp;quot;,0],[&amp;quot;Ipswich Town&amp;quot;,2]],&#xA;[[&amp;quot;Huddersfield Town&amp;quot;,1],[&amp;quot;Bristol City&amp;quot;,1]],&#xA;[[&amp;quot;Queens Park Rangers&amp;quot;,2],[&amp;quot;Hull City&amp;quot;,0]],&#xA;[[&amp;quot;Stoke City&amp;quot;,0],[&amp;quot;Sheffield Wednesday&amp;quot;,1]],&#xA;[[&amp;quot;Watford&amp;quot;,1],[&amp;quot;Southampton&amp;quot;,1]],&#xA;[[&amp;quot;Rotherham United&amp;quot;,1],[&amp;quot;Swansea City&amp;quot;,2]],&#xA;[[&amp;quot;Sunderland&amp;quot;,2],[&amp;quot;West Bromwich Albion&amp;quot;,1]],&#xA;[[&amp;quot;Blackburn Rovers&amp;quot;,0],[&amp;quot;Leeds United&amp;quot;,2]],&#xA;[[&amp;quot;Coventry City&amp;quot;,2],[&amp;quot;Birmingham City&amp;quot;,0]],&#xA;[[&amp;quot;Bristol City&amp;quot;,1],[&amp;quot;Norwich City&amp;quot;,2]],&#xA;[[&amp;quot;Millwall&amp;quot;,1],[&amp;quot;Sunderland&amp;quot;,1]],&#xA;[[&amp;quot;Birmingham City&amp;quot;,0],[&amp;quot;Rotherham United&amp;quot;,0]],&#xA;[[&amp;quot;Hull City&amp;quot;,1],[&amp;quot;Watford&amp;quot;,2]],&#xA;[[&amp;quot;Ipswich Town&amp;quot;,2],[&amp;quot;Coventry City&amp;quot;,1]],&#xA;[[&amp;quot;Leeds United&amp;quot;,3],[&amp;quot;Middlesbrough&amp;quot;,2]],&#xA;[[&amp;quot;Swansea City&amp;quot;,1],[&amp;quot;Huddersfield Town&amp;quot;,1]],&#xA;[[&amp;quot;Plymouth Argyle&amp;quot;,2],[&amp;quot;Stoke City&amp;quot;,1]],&#xA;[[&amp;quot;Sheffield Wednesday&amp;quot;,3],[&amp;quot;Blackburn Rovers&amp;quot;,1]],&#xA;[[&amp;quot;Southampton&amp;quot;,2],[&amp;quot;Cardiff City&amp;quot;,0]],&#xA;[[&amp;quot;West Bromwich Albion&amp;quot;,1],[&amp;quot;Leicester City&amp;quot;,2]],&#xA;[[&amp;quot;Preston North End&amp;quot;,0],[&amp;quot;Queens Park Rangers&amp;quot;,2]],&#xA;[[&amp;quot;Ipswich Town&amp;quot;,3],[&amp;quot;Millwall&amp;quot;,1]],&#xA;[[&amp;quot;Blackburn Rovers&amp;quot;,4],[&amp;quot;Birmingham City&amp;quot;,2]],&#xA;[[&amp;quot;Leeds United&amp;quot;,3],[&amp;quot;Swansea City&amp;quot;,1]],&#xA;[[&amp;quot;Sheffield Wednesday&amp;quot;,1],[&amp;quot;Leicester City&amp;quot;,1]],&#xA;[[&amp;quot;Southampton&amp;quot;,1],[&amp;quot;Bristol City&amp;quot;,0]],&#xA;[[&amp;quot;Sunderland&amp;quot;,1],[&amp;quot;Huddersfield Town&amp;quot;,2]],&#xA;[[&amp;quot;Watford&amp;quot;,3],[&amp;quot;Norwich City&amp;quot;,2]],&#xA;[[&amp;quot;Queens Park Rangers&amp;quot;,4],[&amp;quot;Stoke City&amp;quot;,2]],&#xA;[[&amp;quot;Middlesbrough&amp;quot;,4],[&amp;quot;Preston North End&amp;quot;,0]],&#xA;[[&amp;quot;Hull City&amp;quot;,4],[&amp;quot;Rotherham United&amp;quot;,1]],&#xA;[[&amp;quot;Coventry City&amp;quot;,1],[&amp;quot;Plymouth Argyle&amp;quot;,0]],&#xA;[[&amp;quot;Cardiff City&amp;quot;,0],[&amp;quot;West Bromwich Albion&amp;quot;,1]],&#xA;[[&amp;quot;West Bromwich Albion&amp;quot;,2],[&amp;quot;Ipswich Town&amp;quot;,0]],&#xA;[[&amp;quot;Millwall&amp;quot;,0],[&amp;quot;Coventry City&amp;quot;,3]],&#xA;[[&amp;quot;Birmingham City&amp;quot;,2],[&amp;quot;Sheffield Wednesday&amp;quot;,1]],&#xA;[[&amp;quot;Bristol City&amp;quot;,3],[&amp;quot;Middlesbrough&amp;quot;,2]],&#xA;[[&amp;quot;Huddersfield Town&amp;quot;,1],[&amp;quot;Southampton&amp;quot;,1]],&#xA;[[&amp;quot;Leicester City&amp;quot;,2],[&amp;quot;Watford&amp;quot;,0]],&#xA;[[&amp;quot;Norwich City&amp;quot;,1],[&amp;quot;Queens Park Rangers&amp;quot;,0]],&#xA;[[&amp;quot;Preston North End&amp;quot;,1],[&amp;quot;Cardiff City&amp;quot;,2]],&#xA;[[&amp;quot;Stoke City&amp;quot;,0],[&amp;quot;Blackburn Rovers&amp;quot;,3]],&#xA;[[&amp;quot;Swansea City&amp;quot;,2],[&amp;quot;Hull City&amp;quot;,2]],&#xA;[[&amp;quot;Plymouth Argyle&amp;quot;,2],[&amp;quot;Sunderland&amp;quot;,0]],&#xA;[[&amp;quot;Rotherham United&amp;quot;,1],[&amp;quot;Leeds United&amp;quot;,1]],&#xA;[[&amp;quot;Cardiff City&amp;quot;,2],[&amp;quot;Norwich City&amp;quot;,3]],&#xA;[[&amp;quot;Leeds United&amp;quot;,2],[&amp;quot;Plymouth Argyle&amp;quot;,1]],&#xA;[[&amp;quot;Coventry City&amp;quot;,0],[&amp;quot;Stoke City&amp;quot;,0]],&#xA;[[&amp;quot;Hull City&amp;quot;,1],[&amp;quot;Huddersfield Town&amp;quot;,0]],&#xA;[[&amp;quot;Ipswich Town&amp;quot;,3],[&amp;quot;Swansea City&amp;quot;,2]],&#xA;[[&amp;quot;Southampton&amp;quot;,2],[&amp;quot;West Bromwich Albion&amp;quot;,1]],&#xA;[[&amp;quot;Middlesbrough&amp;quot;,1],[&amp;quot;Leicester City&amp;quot;,0]],&#xA;[[&amp;quot;Queens Park Rangers&amp;quot;,0],[&amp;quot;Bristol City&amp;quot;,0]],&#xA;[[&amp;quot;Sheffield Wednesday&amp;quot;,0],[&amp;quot;Millwall&amp;quot;,4]],&#xA;[[&amp;quot;Watford&amp;quot;,5],[&amp;quot;Rotherham United&amp;quot;,0]],&#xA;[[&amp;quot;Sunderland&amp;quot;,3],[&amp;quot;Birmingham City&amp;quot;,1]],&#xA;[[&amp;quot;Blackburn Rovers&amp;quot;,1],[&amp;quot;Preston North End&amp;quot;,2]],&#xA;[[&amp;quot;Rotherham United&amp;quot;,2],[&amp;quot;Ipswich Town&amp;quot;,2]],&#xA;[[&amp;quot;Norwich City&amp;quot;,1],[&amp;quot;Blackburn Rovers&amp;quot;,3]],&#xA;[[&amp;quot;West Bromwich Albion&amp;quot;,3],[&amp;quot;Hull City&amp;quot;,1]],&#xA;[[&amp;quot;Swansea City&amp;quot;,0],[&amp;quot;Sunderland&amp;quot;,0]],&#xA;[[&amp;quot;Birmingham City&amp;quot;,2],[&amp;quot;Ipswich Town&amp;quot;,2]],&#xA;[[&amp;quot;Bristol City&amp;quot;,1],[&amp;quot;Sheffield Wednesday&amp;quot;,0]],&#xA;[[&amp;quot;Huddersfield Town&amp;quot;,0],[&amp;quot;Watford&amp;quot;,0]],&#xA;[[&amp;quot;Rotherham United&amp;quot;,1],[&amp;quot;Queens Park Rangers&amp;quot;,1]],&#xA;[[&amp;quot;Millwall&amp;quot;,0],[&amp;quot;Southampton&amp;quot;,1]],&#xA;[[&amp;quot;Plymouth Argyle&amp;quot;,3],[&amp;quot;Middlesbrough&amp;quot;,3]],&#xA;[[&amp;quot;Preston North End&amp;quot;,3],[&amp;quot;Coventry City&amp;quot;,2]],&#xA;[[&amp;quot;Stoke City&amp;quot;,0],[&amp;quot;Cardiff City&amp;quot;,0]],&#xA;[[&amp;quot;Leicester City&amp;quot;,0],[&amp;quot;Leeds United&amp;quot;,1]],&#xA;[[&amp;quot;Coventry City&amp;quot;,0],[&amp;quot;West Bromwich Albion&amp;quot;,2]],&#xA;[[&amp;quot;Sheffield Wednesday&amp;quot;,2],[&amp;quot;Rotherham United&amp;quot;,0]],&#xA;[[&amp;quot;Ipswich Town&amp;quot;,3],[&amp;quot;Plymouth Argyle&amp;quot;,2]],&#xA;[[&amp;quot;Blackburn Rovers&amp;quot;,0],[&amp;quot;Swansea City&amp;quot;,1]],&#xA;[[&amp;quot;Cardiff City&amp;quot;,2],[&amp;quot;Bristol City&amp;quot;,0]],&#xA;[[&amp;quot;Hull City&amp;quot;,1],[&amp;quot;Preston North End&amp;quot;,0]],&#xA;[[&amp;quot;Middlesbrough&amp;quot;,0],[&amp;quot;Stoke City&amp;quot;,2]],&#xA;[[&amp;quot;Queens Park Rangers&amp;quot;,1],[&amp;quot;Leicester City&amp;quot;,2]],&#xA;[[&amp;quot;Sunderland&amp;quot;,3],[&amp;quot;Norwich City&amp;quot;,1]],&#xA;[[&amp;quot;Watford&amp;quot;,2],[&amp;quot;Millwall&amp;quot;,2]],&#xA;[[&amp;quot;Leeds United&amp;quot;,4],[&amp;quot;Huddersfield Town&amp;quot;,1]],&#xA;[[&amp;quot;Southampton&amp;quot;,3],[&amp;quot;Birmingham City&amp;quot;,1]],&#xA;[[&amp;quot;Stoke City&amp;quot;,1],[&amp;quot;Leeds United&amp;quot;,0]],&#xA;[[&amp;quot;Rotherham United&amp;quot;,2],[&amp;quot;Coventry City&amp;quot;,0]],&#xA;[[&amp;quot;Preston North End&amp;quot;,2],[&amp;quot;Southampton&amp;quot;,2]],&#xA;[[&amp;quot;Plymouth Argyle&amp;quot;,3],[&amp;quot;Sheffield Wednesday&amp;quot;,0]],&#xA;[[&amp;quot;Bristol City&amp;quot;,0],[&amp;quot;Ipswich Town&amp;quot;,1]],&#xA;[[&amp;quot;Birmingham City&amp;quot;,0],[&amp;quot;Hull City&amp;quot;,2]],&#xA;[[&amp;quot;West Bromwich Albion&amp;quot;,2],[&amp;quot;Queens Park Rangers&amp;quot;,0]],&#xA;[[&amp;quot;Leicester City&amp;quot;,1],[&amp;quot;Sunderland&amp;quot;,0]],&#xA;[[&amp;quot;Swansea City&amp;quot;,0],[&amp;quot;Watford&amp;quot;,1]],&#xA;[[&amp;quot;Norwich City&amp;quot;,1],[&amp;quot;Middlesbrough&amp;quot;,2]],&#xA;[[&amp;quot;Millwall&amp;quot;,1],[&amp;quot;Blackburn Rovers&amp;quot;,2]],&#xA;[[&amp;quot;Huddersfield Town&amp;quot;,0],[&amp;quot;Cardiff City&amp;quot;,4]],&#xA;[[&amp;quot;Middlesbrough&amp;quot;,1],[&amp;quot;Birmingham City&amp;quot;,0]],&#xA;[[&amp;quot;Blackburn Rovers&amp;quot;,1],[&amp;quot;Cardiff City&amp;quot;,0]],&#xA;[[&amp;quot;Bristol City&amp;quot;,1],[&amp;quot;Coventry City&amp;quot;,0]],&#xA;[[&amp;quot;Huddersfield Town&amp;quot;,2],[&amp;quot;Queens Park Rangers&amp;quot;,1]],&#xA;[[&amp;quot;Hull City&amp;quot;,1],[&amp;quot;Southampton&amp;quot;,2]],&#xA;[[&amp;quot;West Bromwich Albion&amp;quot;,0],[&amp;quot;Plymouth Argyle&amp;quot;,0]],&#xA;[[&amp;quot;Norwich City&amp;quot;,2],[&amp;quot;Leeds United&amp;quot;,3]],&#xA;[[&amp;quot;Stoke City&amp;quot;,2],[&amp;quot;Sunderland&amp;quot;,1]],&#xA;[[&amp;quot;Swansea City&amp;quot;,1],[&amp;quot;Leicester City&amp;quot;,3]],&#xA;[[&amp;quot;Watford&amp;quot;,1],[&amp;quot;Sheffield Wednesday&amp;quot;,0]],&#xA;[[&amp;quot;Preston North End&amp;quot;,1],[&amp;quot;Millwall&amp;quot;,1]],&#xA;[[&amp;quot;Cardiff City&amp;quot;,1],[&amp;quot;Watford&amp;quot;,1]],&#xA;[[&amp;quot;Southampton&amp;quot;,1],[&amp;quot;Rotherham United&amp;quot;,1]],&#xA;[[&amp;quot;Sheffield Wednesday&amp;quot;,0],[&amp;quot;Huddersfield Town&amp;quot;,0]],&#xA;[[&amp;quot;Queens Park Rangers&amp;quot;,0],[&amp;quot;Blackburn Rovers&amp;quot;,4]],&#xA;[[&amp;quot;Plymouth Argyle&amp;quot;,1],[&amp;quot;Swansea City&amp;quot;,3]],&#xA;[[&amp;quot;Millwall&amp;quot;,2],[&amp;quot;Hull City&amp;quot;,2]],&#xA;[[&amp;quot;Leicester City&amp;quot;,2],[&amp;quot;Stoke City&amp;quot;,0]],&#xA;[[&amp;quot;Leeds United&amp;quot;,2],[&amp;quot;Bristol City&amp;quot;,1]],&#xA;[[&amp;quot;Ipswich Town&amp;quot;,4],[&amp;quot;Preston North End&amp;quot;,2]],&#xA;[[&amp;quot;Coventry City&amp;quot;,1],[&amp;quot;Norwich City&amp;quot;,1]],&#xA;[[&amp;quot;Sunderland&amp;quot;,0],[&amp;quot;Middlesbrough&amp;quot;,4]],&#xA;[[&amp;quot;Birmingham City&amp;quot;,3],[&amp;quot;West Bromwich Albion&amp;quot;,1]],&#xA;[[&amp;quot;Rotherham United&amp;quot;,1],[&amp;quot;Bristol City&amp;quot;,2]],&#xA;[[&amp;quot;Sunderland&amp;quot;,2],[&amp;quot;Watford&amp;quot;,0]],&#xA;[[&amp;quot;Leicester City&amp;quot;,3],[&amp;quot;Preston North End&amp;quot;,0]],&#xA;[[&amp;quot;Leeds United&amp;quot;,1],[&amp;quot;Queens Park Rangers&amp;quot;,0]],&#xA;[[&amp;quot;Coventry City&amp;quot;,1],[&amp;quot;Blackburn Rovers&amp;quot;,0]],&#xA;[[&amp;quot;Swansea City&amp;quot;,2],[&amp;quot;Norwich City&amp;quot;,1]],&#xA;[[&amp;quot;West Bromwich Albion&amp;quot;,1],[&amp;quot;Sheffield Wednesday&amp;quot;,0]],&#xA;[[&amp;quot;Stoke City&amp;quot;,0],[&amp;quot;Southampton&amp;quot;,1]],&#xA;[[&amp;quot;Plymouth Argyle&amp;quot;,0],[&amp;quot;Millwall&amp;quot;,2]],&#xA;[[&amp;quot;Middlesbrough&amp;quot;,2],[&amp;quot;Cardiff City&amp;quot;,0]],&#xA;[[&amp;quot;Ipswich Town&amp;quot;,3],[&amp;quot;Hull City&amp;quot;,0]],&#xA;[[&amp;quot;Birmingham City&amp;quot;,4],[&amp;quot;Huddersfield Town&amp;quot;,1]],&#xA;[[&amp;quot;Blackburn Rovers&amp;quot;,1],[&amp;quot;Leicester City&amp;quot;,4]],&#xA;[[&amp;quot;Huddersfield Town&amp;quot;,1],[&amp;quot;Ipswich Town&amp;quot;,1]],&#xA;[[&amp;quot;Millwall&amp;quot;,0],[&amp;quot;Swansea City&amp;quot;,3]],&#xA;[[&amp;quot;Cardiff City&amp;quot;,2],[&amp;quot;Rotherham United&amp;quot;,0]],&#xA;[[&amp;quot;Bristol City&amp;quot;,2],[&amp;quot;Stoke City&amp;quot;,3]],&#xA;[[&amp;quot;Hull City&amp;quot;,1],[&amp;quot;Plymouth Argyle&amp;quot;,1]],&#xA;[[&amp;quot;Norwich City&amp;quot;,2],[&amp;quot;Birmingham City&amp;quot;,0]],&#xA;[[&amp;quot;Queens Park Rangers&amp;quot;,1],[&amp;quot;Coventry City&amp;quot;,3]],&#xA;[[&amp;quot;Watford&amp;quot;,2],[&amp;quot;Middlesbrough&amp;quot;,3]],&#xA;[[&amp;quot;Preston North End&amp;quot;,0],[&amp;quot;West Bromwich Albion&amp;quot;,4]],&#xA;[[&amp;quot;Southampton&amp;quot;,3],[&amp;quot;Leeds United&amp;quot;,1]],&#xA;[[&amp;quot;Sheffield Wednesday&amp;quot;,0],[&amp;quot;Sunderland&amp;quot;,3]],&#xA;[[&amp;quot;Coventry City&amp;quot;,1],[&amp;quot;Huddersfield Town&amp;quot;,1]],&#xA;[[&amp;quot;Sunderland&amp;quot;,0],[&amp;quot;Cardiff City&amp;quot;,1]],&#xA;[[&amp;quot;Stoke City&amp;quot;,1],[&amp;quot;Hull City&amp;quot;,3]],&#xA;[[&amp;quot;Leeds United&amp;quot;,3],[&amp;quot;Watford&amp;quot;,0]],&#xA;[[&amp;quot;West Bromwich Albion&amp;quot;,0],[&amp;quot;Millwall&amp;quot;,0]],&#xA;[[&amp;quot;Swansea City&amp;quot;,3],[&amp;quot;Sheffield Wednesday&amp;quot;,0]],&#xA;[[&amp;quot;Rotherham United&amp;quot;,1],[&amp;quot;Preston North End&amp;quot;,1]],&#xA;[[&amp;quot;Plymouth Argyle&amp;quot;,6],[&amp;quot;Norwich City&amp;quot;,2]],&#xA;[[&amp;quot;Middlesbrough&amp;quot;,2],[&amp;quot;Southampton&amp;quot;,1]],&#xA;[[&amp;quot;Leicester City&amp;quot;,1],[&amp;quot;Bristol City&amp;quot;,0]],&#xA;[[&amp;quot;Ipswich Town&amp;quot;,4],[&amp;quot;Blackburn Rovers&amp;quot;,3]],&#xA;[[&amp;quot;Birmingham City&amp;quot;,0],[&amp;quot;Queens Park Rangers&amp;quot;,0]],&#xA;[[&amp;quot;Norwich City&amp;quot;,0],[&amp;quot;Leicester City&amp;quot;,2]],&#xA;[[&amp;quot;Watford&amp;quot;,2],[&amp;quot;West Bromwich Albion&amp;quot;,2]],&#xA;[[&amp;quot;Millwall&amp;quot;,3],[&amp;quot;Rotherham United&amp;quot;,0]],&#xA;[[&amp;quot;Hull City&amp;quot;,0],[&amp;quot;Leeds United&amp;quot;,0]],&#xA;[[&amp;quot;Huddersfield Town&amp;quot;,2],[&amp;quot;Stoke City&amp;quot;,2]],&#xA;[[&amp;quot;Blackburn Rovers&amp;quot;,1],[&amp;quot;Sunderland&amp;quot;,3]],&#xA;[[&amp;quot;Sheffield Wednesday&amp;quot;,1],[&amp;quot;Middlesbrough&amp;quot;,1]],&#xA;[[&amp;quot;Bristol City&amp;quot;,4],[&amp;quot;Plymouth Argyle&amp;quot;,1]],&#xA;[[&amp;quot;Southampton&amp;quot;,0],[&amp;quot;Ipswich Town&amp;quot;,1]],&#xA;[[&amp;quot;Queens Park Rangers&amp;quot;,1],[&amp;quot;Swansea City&amp;quot;,1]],&#xA;[[&amp;quot;Preston North End&amp;quot;,2],[&amp;quot;Birmingham City&amp;quot;,1]],&#xA;[[&amp;quot;Cardiff City&amp;quot;,3],[&amp;quot;Coventry City&amp;quot;,2]],&#xA;[[&amp;quot;Millwall&amp;quot;,0],[&amp;quot;Leeds United&amp;quot;,3]],&#xA;[[&amp;quot;Cardiff City&amp;quot;,2],[&amp;quot;Swansea City&amp;quot;,0]],&#xA;[[&amp;quot;Bristol City&amp;quot;,0],[&amp;quot;West Bromwich Albion&amp;quot;,0]],&#xA;[[&amp;quot;Blackburn Rovers&amp;quot;,2],[&amp;quot;Middlesbrough&amp;quot;,1]],&#xA;[[&amp;quot;Huddersfield Town&amp;quot;,2],[&amp;quot;Rotherham United&amp;quot;,0]],&#xA;[[&amp;quot;Sheffield Wednesday&amp;quot;,0],[&amp;quot;Ipswich Town&amp;quot;,1]],&#xA;[[&amp;quot;Norwich City&amp;quot;,1],[&amp;quot;Stoke City&amp;quot;,0]],&#xA;[[&amp;quot;Queens Park Rangers&amp;quot;,1],[&amp;quot;Sunderland&amp;quot;,3]],&#xA;[[&amp;quot;Watford&amp;quot;,2],[&amp;quot;Birmingham City&amp;quot;,0]],&#xA;[[&amp;quot;Preston North End&amp;quot;,2],[&amp;quot;Plymouth Argyle&amp;quot;,1]],&#xA;[[&amp;quot;Southampton&amp;quot;,1],[&amp;quot;Leicester City&amp;quot;,4]],&#xA;[[&amp;quot;Hull City&amp;quot;,1],[&amp;quot;Coventry City&amp;quot;,1]],&#xA;[[&amp;quot;Plymouth Argyle&amp;quot;,3],[&amp;quot;Blackburn Rovers&amp;quot;,0]],&#xA;[[&amp;quot;Ipswich Town&amp;quot;,3],[&amp;quot;Cardiff City&amp;quot;,2]],&#xA;[[&amp;quot;Leeds United&amp;quot;,0],[&amp;quot;Sheffield Wednesday&amp;quot;,0]],&#xA;[[&amp;quot;Leicester City&amp;quot;,0],[&amp;quot;Hull City&amp;quot;,1]],&#xA;[[&amp;quot;Middlesbrough&amp;quot;,0],[&amp;quot;Queens Park Rangers&amp;quot;,2]],&#xA;[[&amp;quot;Coventry City&amp;quot;,3],[&amp;quot;Watford&amp;quot;,3]],&#xA;[[&amp;quot;Rotherham United&amp;quot;,2],[&amp;quot;Norwich City&amp;quot;,1]],&#xA;[[&amp;quot;West Bromwich Albion&amp;quot;,1],[&amp;quot;Huddersfield Town&amp;quot;,2]],&#xA;[[&amp;quot;Stoke City&amp;quot;,0],[&amp;quot;Preston North End&amp;quot;,2]],&#xA;[[&amp;quot;Sunderland&amp;quot;,5],[&amp;quot;Southampton&amp;quot;,0]],&#xA;[[&amp;quot;Swansea City&amp;quot;,1],[&amp;quot;Bristol City&amp;quot;,2]],&#xA;[[&amp;quot;Birmingham City&amp;quot;,1],[&amp;quot;Millwall&amp;quot;,1]],&#xA;[[&amp;quot;Watford&amp;quot;,0],[&amp;quot;Blackburn Rovers&amp;quot;,1]],&#xA;[[&amp;quot;Ipswich Town&amp;quot;,3],[&amp;quot;Leeds United&amp;quot;,4]],&#xA;[[&amp;quot;Birmingham City&amp;quot;,2],[&amp;quot;Plymouth Argyle&amp;quot;,1]],&#xA;[[&amp;quot;Cardiff City&amp;quot;,2],[&amp;quot;Sheffield Wednesday&amp;quot;,1]],&#xA;[[&amp;quot;Coventry City&amp;quot;,0],[&amp;quot;Sunderland&amp;quot;,0]],&#xA;[[&amp;quot;Huddersfield Town&amp;quot;,0],[&amp;quot;Norwich City&amp;quot;,4]],&#xA;[[&amp;quot;Preston North End&amp;quot;,2],[&amp;quot;Swansea City&amp;quot;,1]],&#xA;[[&amp;quot;Millwall&amp;quot;,1],[&amp;quot;Stoke City&amp;quot;,0]],&#xA;[[&amp;quot;Rotherham United&amp;quot;,1],[&amp;quot;Leicester City&amp;quot;,2]],&#xA;[[&amp;quot;Southampton&amp;quot;,2],[&amp;quot;Queens Park Rangers&amp;quot;,1]],&#xA;[[&amp;quot;West Bromwich Albion&amp;quot;,4],[&amp;quot;Middlesbrough&amp;quot;,2]],&#xA;[[&amp;quot;Hull City&amp;quot;,1],[&amp;quot;Bristol City&amp;quot;,1]],&#xA;[[&amp;quot;Norwich City&amp;quot;,3],[&amp;quot;Millwall&amp;quot;,1]],&#xA;[[&amp;quot;Middlesbrough&amp;quot;,1],[&amp;quot;Huddersfield Town&amp;quot;,1]],&#xA;[[&amp;quot;Bristol City&amp;quot;,0],[&amp;quot;Birmingham City&amp;quot;,2]],&#xA;[[&amp;quot;Blackburn Rovers&amp;quot;,1],[&amp;quot;Hull City&amp;quot;,2]],&#xA;[[&amp;quot;Leicester City&amp;quot;,2],[&amp;quot;Cardiff City&amp;quot;,1]],&#xA;[[&amp;quot;Sunderland&amp;quot;,2],[&amp;quot;Rotherham United&amp;quot;,1]],&#xA;[[&amp;quot;Queens Park Rangers&amp;quot;,0],[&amp;quot;Ipswich Town&amp;quot;,1]],&#xA;[[&amp;quot;Stoke City&amp;quot;,1],[&amp;quot;Watford&amp;quot;,0]],&#xA;[[&amp;quot;Swansea City&amp;quot;,1],[&amp;quot;Coventry City&amp;quot;,1]],&#xA;[[&amp;quot;Sheffield Wednesday&amp;quot;,0],[&amp;quot;Preston North End&amp;quot;,1]],&#xA;[[&amp;quot;Plymouth Argyle&amp;quot;,1],[&amp;quot;Southampton&amp;quot;,2]],&#xA;[[&amp;quot;Leeds United&amp;quot;,1],[&amp;quot;West Bromwich Albion&amp;quot;,1]],&#xA;[[&amp;quot;Millwall&amp;quot;,0],[&amp;quot;Bristol City&amp;quot;,1]],&#xA;[[&amp;quot;Birmingham City&amp;quot;,1],[&amp;quot;Leeds United&amp;quot;,0]],&#xA;[[&amp;quot;Cardiff City&amp;quot;,1],[&amp;quot;Queens Park Rangers&amp;quot;,2]],&#xA;[[&amp;quot;Hull City&amp;quot;,4],[&amp;quot;Sheffield Wednesday&amp;quot;,2]],&#xA;[[&amp;quot;Ipswich Town&amp;quot;,2],[&amp;quot;Stoke City&amp;quot;,0]],&#xA;[[&amp;quot;Huddersfield Town&amp;quot;,0],[&amp;quot;Leicester City&amp;quot;,1]],&#xA;[[&amp;quot;Preston North End&amp;quot;,2],[&amp;quot;Sunderland&amp;quot;,1]],&#xA;[[&amp;quot;Southampton&amp;quot;,4],[&amp;quot;Norwich City&amp;quot;,4]],&#xA;[[&amp;quot;Watford&amp;quot;,0],[&amp;quot;Plymouth Argyle&amp;quot;,0]],&#xA;[[&amp;quot;West Bromwich Albion&amp;quot;,3],[&amp;quot;Swansea City&amp;quot;,2]],&#xA;[[&amp;quot;Rotherham United&amp;quot;,2],[&amp;quot;Blackburn Rovers&amp;quot;,2]],&#xA;[[&amp;quot;Coventry City&amp;quot;,3],[&amp;quot;Middlesbrough&amp;quot;,0]],&#xA;[[&amp;quot;Sunderland&amp;quot;,1],[&amp;quot;Ipswich Town&amp;quot;,2]],&#xA;[[&amp;quot;Leeds United&amp;quot;,2],[&amp;quot;Cardiff City&amp;quot;,2]],&#xA;[[&amp;quot;Leicester City&amp;quot;,2],[&amp;quot;Coventry City&amp;quot;,1]],&#xA;[[&amp;quot;Blackburn Rovers&amp;quot;,2],[&amp;quot;West Bromwich Albion&amp;quot;,1]],&#xA;[[&amp;quot;Watford&amp;quot;,4],[&amp;quot;Queens Park Rangers&amp;quot;,0]],&#xA;[[&amp;quot;Swansea City&amp;quot;,1],[&amp;quot;Birmingham City&amp;quot;,1]],&#xA;[[&amp;quot;Stoke City&amp;quot;,4],[&amp;quot;Rotherham United&amp;quot;,1]],&#xA;[[&amp;quot;Plymouth Argyle&amp;quot;,3],[&amp;quot;Huddersfield Town&amp;quot;,1]],&#xA;[[&amp;quot;Norwich City&amp;quot;,2],[&amp;quot;Hull City&amp;quot;,1]],&#xA;[[&amp;quot;Middlesbrough&amp;quot;,0],[&amp;quot;Millwall&amp;quot;,1]],&#xA;[[&amp;quot;Bristol City&amp;quot;,1],[&amp;quot;Preston North End&amp;quot;,1]],&#xA;[[&amp;quot;Sheffield Wednesday&amp;quot;,1],[&amp;quot;Southampton&amp;quot;,2]]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Points, goal difference, goals for (don’t need to be output)&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;65 34 55 Leicester City&#xA;58 21 53 Southampton&#xA;58 16 50 Ipswich Town&#xA;54 24 50 Leeds United&#xA;45 13 40 West Bromwich Albion&#xA;43 13 43 Coventry City&#xA;42 4 42 Hull City&#xA;41 3 46 Norwich City&#xA;40 7 45 Watford&#xA;40 6 37 Sunderland&#xA;40 1 42 Middlesbrough&#xA;38 -12 34 Preston North End&#xA;37 0 31 Bristol City&#xA;37 -4 35 Cardiff City&#xA;33 0 47 Plymouth Argyle&#xA;33 -6 38 Swansea City&#xA;33 -12 41 Blackburn Rovers&#xA;32 -7 29 Millwall&#xA;32 -7 27 Stoke City&#xA;32 -10 34 Birmingham City&#xA;27 -18 28 Huddersfield Town&#xA;24 -15 24 Queens Park Rangers&#xA;22 -24 22 Sheffield Wednesday&#xA;19 -27 25 Rotherham United&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Output for this example (from highest to lowest)&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;Leicester City&#xA;Southampton&#xA;Ipswich Town&#xA;Leeds United&#xA;West Bromwich Albion&#xA;Coventry City&#xA;Hull City&#xA;Norwich City&#xA;Watford&#xA;Sunderland&#xA;Middlesbrough&#xA;Preston North End&#xA;Bristol City&#xA;Cardiff City&#xA;Plymouth Argyle&#xA;Swansea City&#xA;Blackburn Rovers&#xA;Millwall&#xA;Stoke City&#xA;Birmingham City&#xA;Huddersfield Town&#xA;Queens Park Rangers&#xA;Sheffield Wednesday&#xA;Rotherham United&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h3&gt;Alternative with integers for team names&lt;/h3&gt;&#xA;&lt;pre&gt;&lt;code&gt;[&#xA;[[9,2],[15,1]],&#xA;[[14,3],[4,1]],&#xA;[[11,1],[17,1]],&#xA;[[13,2],[24,0]],&#xA;[[20,1],[1,2]],&#xA;[[16,2],[12,0]],&#xA;[[18,1],[5,2]],&#xA;[[2,1],[6,1]],&#xA;[[3,1],[23,1]],&#xA;[[22,1],[19,3]],&#xA;[[21,0],[7,1]],&#xA;[[16,1],[23,2]],&#xA;[[8,2],[21,1]],&#xA;[[12,1],[11,3]],&#xA;[[17,0],[20,1]],&#xA;[[19,4],[18,0]],&#xA;[[24,4],[2,1]],&#xA;[[6,1],[14,1]],&#xA;[[4,0],[9,3]],&#xA;[[1,2],[22,2]],&#xA;[[15,2],[3,0]],&#xA;[[5,3],[10,1]],&#xA;[[7,1],[13,2]],&#xA;[[18,3],[7,1]],&#xA;[[13,1],[19,1]],&#xA;[[2,2],[17,2]],&#xA;[[3,0],[12,1]],&#xA;[[9,3],[1,0]],&#xA;[[10,4],[6,1]],&#xA;[[11,1],[5,3]],&#xA;[[14,3],[23,3]],&#xA;[[20,0],[8,0]],&#xA;[[22,1],[24,0]],&#xA;[[16,1],[4,2]],&#xA;[[21,2],[15,0]],&#xA;[[24,1],[9,0]],&#xA;[[8,0],[16,0]],&#xA;[[4,0],[10,2]],&#xA;[[5,2],[22,2]],&#xA;[[6,1],[11,2]],&#xA;[[7,3],[2,2]],&#xA;[[17,1],[21,1]],&#xA;[[12,1],[13,0]],&#xA;[[15,0],[18,1]],&#xA;[[23,1],[20,1]],&#xA;[[1,0],[3,0]],&#xA;[[19,2],[14,1]],&#xA;[[8,1],[10,1]],&#xA;[[1,1],[20,3]],&#xA;[[17,1],[11,0]],&#xA;[[19,5],[22,0]],&#xA;[[7,0],[21,1]],&#xA;[[6,3],[2,0]],&#xA;[[5,2],[18,0]],&#xA;[[4,2],[14,2]],&#xA;[[24,1],[13,0]],&#xA;[[23,1],[3,4]],&#xA;[[12,2],[16,0]],&#xA;[[15,2],[9,1]],&#xA;[[20,0],[12,0]],&#xA;[[21,0],[5,3]],&#xA;[[18,1],[4,2]],&#xA;[[10,3],[17,0]],&#xA;[[16,0],[19,1]],&#xA;[[14,3],[1,3]],&#xA;[[13,2],[6,0]],&#xA;[[11,1],[24,0]],&#xA;[[2,1],[23,2]],&#xA;[[9,4],[8,0]],&#xA;[[22,2],[15,1]],&#xA;[[3,3],[7,2]],&#xA;[[1,2],[10,3]],&#xA;[[24,1],[20,1]],&#xA;[[14,3],[17,2]],&#xA;[[22,1],[11,2]],&#xA;[[19,4],[2,0]],&#xA;[[18,2],[16,1]],&#xA;[[15,1],[23,5]],&#xA;[[12,1],[6,1]],&#xA;[[9,1],[5,1]],&#xA;[[7,3],[4,0]],&#xA;[[3,1],[21,0]],&#xA;[[8,2],[13,2]],&#xA;[[11,1],[7,2]],&#xA;[[4,0],[1,1]],&#xA;[[5,1],[19,1]],&#xA;[[13,3],[18,1]],&#xA;[[10,3],[12,2]],&#xA;[[16,0],[14,0]],&#xA;[[21,1],[9,0]],&#xA;[[23,1],[8,2]],&#xA;[[20,1],[22,1]],&#xA;[[17,0],[24,2]],&#xA;[[6,1],[15,3]],&#xA;[[2,2],[3,1]],&#xA;[[13,0],[15,0]],&#xA;[[4,1],[12,0]],&#xA;[[10,4],[14,0]],&#xA;[[11,0],[8,2]],&#xA;[[6,1],[3,1]],&#xA;[[16,2],[7,0]],&#xA;[[20,0],[18,1]],&#xA;[[23,1],[19,1]],&#xA;[[17,1],[22,2]],&#xA;[[21,2],[24,1]],&#xA;[[2,0],[9,2]],&#xA;[[5,2],[1,0]],&#xA;[[3,1],[13,2]],&#xA;[[12,1],[21,1]],&#xA;[[1,0],[17,0]],&#xA;[[7,1],[23,2]],&#xA;[[8,2],[5,1]],&#xA;[[9,3],[11,2]],&#xA;[[22,1],[6,1]],&#xA;[[14,2],[20,1]],&#xA;[[18,3],[2,1]],&#xA;[[19,2],[4,0]],&#xA;[[24,1],[10,2]],&#xA;[[15,0],[16,2]],&#xA;[[8,3],[12,1]],&#xA;[[2,4],[1,2]],&#xA;[[9,3],[22,1]],&#xA;[[18,1],[10,1]],&#xA;[[19,1],[3,0]],&#xA;[[21,1],[6,2]],&#xA;[[23,3],[13,2]],&#xA;[[16,4],[20,2]],&#xA;[[11,4],[15,0]],&#xA;[[7,4],[17,1]],&#xA;[[5,1],[14,0]],&#xA;[[4,0],[24,1]],&#xA;[[24,2],[8,0]],&#xA;[[12,0],[5,3]],&#xA;[[1,2],[18,1]],&#xA;[[3,3],[11,2]],&#xA;[[6,1],[19,1]],&#xA;[[10,2],[23,0]],&#xA;[[13,1],[16,0]],&#xA;[[15,1],[4,2]],&#xA;[[20,0],[2,3]],&#xA;[[22,2],[7,2]],&#xA;[[14,2],[21,0]],&#xA;[[17,1],[9,1]],&#xA;[[4,2],[13,3]],&#xA;[[9,2],[14,1]],&#xA;[[5,0],[20,0]],&#xA;[[7,1],[6,0]],&#xA;[[8,3],[22,2]],&#xA;[[19,2],[24,1]],&#xA;[[11,1],[10,0]],&#xA;[[16,0],[3,0]],&#xA;[[18,0],[12,4]],&#xA;[[23,5],[17,0]],&#xA;[[21,3],[1,1]],&#xA;[[2,1],[15,2]],&#xA;[[17,2],[8,2]],&#xA;[[13,1],[2,3]],&#xA;[[24,3],[7,1]],&#xA;[[22,0],[21,0]],&#xA;[[1,2],[8,2]],&#xA;[[3,1],[18,0]],&#xA;[[6,0],[23,0]],&#xA;[[17,1],[16,1]],&#xA;[[12,0],[19,1]],&#xA;[[14,3],[11,3]],&#xA;[[15,3],[5,2]],&#xA;[[20,0],[4,0]],&#xA;[[10,0],[9,1]],&#xA;[[5,0],[24,2]],&#xA;[[18,2],[17,0]],&#xA;[[8,3],[14,2]],&#xA;[[2,0],[22,1]],&#xA;[[4,2],[3,0]],&#xA;[[7,1],[15,0]],&#xA;[[11,0],[20,2]],&#xA;[[16,1],[10,2]],&#xA;[[21,3],[13,1]],&#xA;[[23,2],[12,2]],&#xA;[[9,4],[6,1]],&#xA;[[19,3],[1,1]],&#xA;[[20,1],[9,0]],&#xA;[[17,2],[5,0]],&#xA;[[15,2],[19,2]],&#xA;[[14,3],[18,0]],&#xA;[[3,0],[8,1]],&#xA;[[1,0],[7,2]],&#xA;[[24,2],[16,0]],&#xA;[[10,1],[21,0]],&#xA;[[22,0],[23,1]],&#xA;[[13,1],[11,2]],&#xA;[[12,1],[2,2]],&#xA;[[6,0],[4,4]],&#xA;[[11,1],[1,0]],&#xA;[[2,1],[4,0]],&#xA;[[3,1],[5,0]],&#xA;[[6,2],[16,1]],&#xA;[[7,1],[19,2]],&#xA;[[24,0],[14,0]],&#xA;[[13,2],[9,3]],&#xA;[[20,2],[21,1]],&#xA;[[22,1],[10,3]],&#xA;[[23,1],[18,0]],&#xA;[[15,1],[12,1]],&#xA;[[4,1],[23,1]],&#xA;[[19,1],[17,1]],&#xA;[[18,0],[6,0]],&#xA;[[16,0],[2,4]],&#xA;[[14,1],[22,3]],&#xA;[[12,2],[7,2]],&#xA;[[10,2],[20,0]],&#xA;[[9,2],[3,1]],&#xA;[[8,4],[15,2]],&#xA;[[5,1],[13,1]],&#xA;[[21,0],[11,4]],&#xA;[[1,3],[24,1]],&#xA;[[17,1],[3,2]],&#xA;[[21,2],[23,0]],&#xA;[[10,3],[15,0]],&#xA;[[9,1],[16,0]],&#xA;[[5,1],[2,0]],&#xA;[[22,2],[13,1]],&#xA;[[24,1],[18,0]],&#xA;[[20,0],[19,1]],&#xA;[[14,0],[12,2]],&#xA;[[11,2],[4,0]],&#xA;[[8,3],[7,0]],&#xA;[[1,4],[6,1]],&#xA;[[2,1],[10,4]],&#xA;[[6,1],[8,1]],&#xA;[[12,0],[22,3]],&#xA;[[4,2],[17,0]],&#xA;[[3,2],[20,3]],&#xA;[[7,1],[14,1]],&#xA;[[13,2],[1,0]],&#xA;[[16,1],[5,3]],&#xA;[[23,2],[11,3]],&#xA;[[15,0],[24,4]],&#xA;[[19,3],[9,1]],&#xA;[[18,0],[21,3]],&#xA;[[5,1],[6,1]],&#xA;[[21,0],[4,1]],&#xA;[[20,1],[7,3]],&#xA;[[9,3],[23,0]],&#xA;[[24,0],[12,0]],&#xA;[[22,3],[18,0]],&#xA;[[17,1],[15,1]],&#xA;[[14,6],[13,2]],&#xA;[[11,2],[19,1]],&#xA;[[10,1],[3,0]],&#xA;[[8,4],[2,3]],&#xA;[[1,0],[16,0]],&#xA;[[13,0],[10,2]],&#xA;[[23,2],[24,2]],&#xA;[[12,3],[17,0]],&#xA;[[7,0],[9,0]],&#xA;[[6,2],[20,2]],&#xA;[[2,1],[21,3]],&#xA;[[18,1],[11,1]],&#xA;[[3,4],[14,1]],&#xA;[[19,0],[8,1]],&#xA;[[16,1],[22,1]],&#xA;[[15,2],[1,1]],&#xA;[[4,3],[5,2]],&#xA;[[12,0],[9,3]],&#xA;[[4,2],[22,0]],&#xA;[[3,0],[24,0]],&#xA;[[2,2],[11,1]],&#xA;[[6,2],[17,0]],&#xA;[[18,0],[8,1]],&#xA;[[13,1],[20,0]],&#xA;[[16,1],[21,3]],&#xA;[[23,2],[1,0]],&#xA;[[15,2],[14,1]],&#xA;[[19,1],[10,4]],&#xA;[[7,1],[5,1]],&#xA;[[14,3],[2,0]],&#xA;[[8,3],[4,2]],&#xA;[[9,0],[18,0]],&#xA;[[10,0],[7,1]],&#xA;[[11,0],[16,2]],&#xA;[[5,3],[23,3]],&#xA;[[17,2],[13,1]],&#xA;[[24,1],[6,2]],&#xA;[[20,0],[15,2]],&#xA;[[21,5],[19,0]],&#xA;[[22,1],[3,2]],&#xA;[[1,1],[12,1]],&#xA;[[23,0],[2,1]],&#xA;[[8,3],[9,4]],&#xA;[[1,2],[14,1]],&#xA;[[4,2],[18,1]],&#xA;[[5,0],[21,0]],&#xA;[[6,0],[13,4]],&#xA;[[15,2],[22,1]],&#xA;[[12,1],[20,0]],&#xA;[[17,1],[10,2]],&#xA;[[19,2],[16,1]],&#xA;[[24,4],[11,2]],&#xA;[[7,1],[3,1]],&#xA;[[13,3],[12,1]],&#xA;[[11,1],[6,1]],&#xA;[[3,0],[1,2]],&#xA;[[2,1],[7,2]],&#xA;[[10,2],[4,1]],&#xA;[[21,2],[17,1]],&#xA;[[16,0],[8,1]],&#xA;[[20,1],[23,0]],&#xA;[[22,1],[5,1]],&#xA;[[18,0],[15,1]],&#xA;[[14,1],[19,2]],&#xA;[[9,1],[24,1]],&#xA;[[12,0],[3,1]],&#xA;[[1,1],[9,0]],&#xA;[[4,1],[16,2]],&#xA;[[7,4],[18,2]],&#xA;[[8,2],[20,0]],&#xA;[[6,0],[10,1]],&#xA;[[15,2],[21,1]],&#xA;[[19,4],[13,4]],&#xA;[[23,0],[14,0]],&#xA;[[24,3],[22,2]],&#xA;[[17,2],[2,2]],&#xA;[[5,3],[11,0]],&#xA;[[21,1],[8,2]],&#xA;[[9,2],[4,2]],&#xA;[[10,2],[5,1]],&#xA;[[2,2],[24,1]],&#xA;[[23,4],[16,0]],&#xA;[[22,1],[1,1]],&#xA;[[20,4],[17,1]],&#xA;[[14,3],[6,1]],&#xA;[[13,2],[7,1]],&#xA;[[11,0],[12,1]],&#xA;[[3,1],[15,1]],&#xA;[[18,1],[19,2]]&#xA;]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Shorter examples&lt;/h2&gt;&#xA;&lt;p&gt;All are given as &lt;code&gt;[[first team, first team score],[second team, second team score]]&lt;/code&gt; but this order can be transposed if preferred.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[1,1],[2,1]],[[2,2],[1,0]] -&amp;gt; 2,1&#xA;[[1,2],[2,3]],[[1,2],[3,2]],[[1,3],[4,1]],[[1,2],[5,1]],[[2,2],[3,4]],[[2,4],[4,2]],[[2,2],[5,2]],[[3,4],[4,2]],[[3,3],[5,2]],[[4,4],[5,2]],[[2,4],[1,2]],[[3,3],[1,3]],[[4,2],[1,3]],[[5,1],[1,2]],[[3,3],[2,3]],[[4,2],[2,3]],[[5,3],[2,1]],[[4,3],[3,1]],[[5,3],[3,2]],[[5,1],[4,3]] -&amp;gt; 2,1,3,4,5&#xA;[[1,3],[2,4]],[[1,3],[3,3]],[[2,0],[3,2]],[[2,3],[1,1]],[[3,4],[1,0]],[[3,3],[2,2]] -&amp;gt; 3,2,1&#xA;[[1,3],[2,2]],[[1,3],[3,1]],[[1,4],[4,0]],[[2,2],[3,2]],[[2,3],[4,3]],[[3,2],[4,1]],[[2,3],[1,2]],[[3,3],[1,4]],[[4,2],[1,2]],[[3,4],[2,1]],[[4,2],[2,2]],[[4,4],[3,2]] -&amp;gt; 1,3,2,4&#xA;[[1,0],[2,2]],[[1,2],[3,0]],[[1,2],[4,0]],[[2,1],[3,2]],[[2,2],[4,4]],[[3,3],[4,2]],[[2,4],[1,3]],[[3,2],[1,2]],[[4,3],[1,2]],[[3,2],[2,3]],[[4,2],[2,2]],[[4,4],[3,2]] -&amp;gt; 4,2,1,3&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Questions&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;The hardest bit seems to be checking head to head record. That’s in the rules, but does it over-complicate things?&lt;/li&gt;&#xA;&lt;li&gt;Are the examples, particularly the real-world one, too long?&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;" OwnerUserId="42248" LastEditorUserId="42248" LastEditDate="2024-01-24T18:56:43.403" LastActivityDate="2024-01-24T18:56:43.403" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26243" PostTypeId="2" ParentId="2140" CreationDate="2024-01-22T14:41:59.303" Score="2" Body="&lt;h1&gt;How quickly can you type this string?&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-string-tooltip-container&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a string consisting of only printable ascii (letters, numbers, symbols, and spaces), how many keystrokes are required minimally to type out this string from scratch? The allowed keystrokes are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;one character from printable ascii for 1 keystroke&lt;/li&gt;&#xA;&lt;li&gt;&lt;kbd&gt;Ctrl-C&lt;/kbd&gt; (copy) any contiguous substring you have typed so far and replace whatever is currently copied (2 keystrokes) and &lt;kbd&gt;Ctrl-V&lt;/kbd&gt; (paste) any string in your clipboard (1 keystroke)&lt;/li&gt;&#xA;&lt;li&gt;&lt;kbd&gt;Backspace&lt;/kbd&gt; the last typed character for 1 keystroke&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For example, the string &amp;quot;cbaabcbabaacba&amp;quot; can be typed in 12 keystrokes, which is optimal.&lt;/p&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;cbaabcbabaacba =&amp;gt; 12&#xA;ababcc =&amp;gt; 6&#xA;aaaaaaaaaaaaa =&amp;gt; 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest code wins!&lt;/p&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="105116" LastEditDate="2024-02-06T13:47:29.727" LastActivityDate="2024-02-06T13:47:29.727" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26244" PostTypeId="2" ParentId="2140" CreationDate="2024-01-23T01:30:23.977" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/269557/78410&quot;&gt;The TAK function&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2024-01-26T00:05:18.820" LastActivityDate="2024-01-26T00:05:18.820" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26245" PostTypeId="2" ParentId="2140" CreationDate="2024-01-23T01:59:25.920" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/269684/78410&quot;&gt;The TAK function (easy mode)&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2024-02-02T01:32:44.910" LastActivityDate="2024-02-02T01:32:44.910" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26246" PostTypeId="1" CreationDate="2024-01-24T19:07:14.070" Score="6" ViewCount="93" Body="&#xA;&lt;p&gt;It’s that time of the year again! As we wave goodbye to last year and welcome the new one, we have &lt;a href=&quot;https://codegolf.meta.stackexchange.com/search?q=%22year+in+moderation%22+is%3Aquestion&quot;&gt;a tradition of sharing moderation stats for the preceding calendar year&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;As most of you here might be aware, sites on the Stack Exchange network are moderated somewhat differently to other sites on the web:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;We designed the Stack Exchange network engine to be mostly self-regulating, in that we amortize the overall moderation cost of the system across thousands of teeny-tiny slices of effort contributed by regular, everyday users.&lt;br /&gt;&#xA;-- &lt;a href=&quot;http://blog.stackoverflow.com/2009/05/a-theory-of-moderation/&quot;&gt;A Theory of Moderation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;That doesn't eliminate the need for having &lt;a href=&quot;https://stackoverflow.blog/2018/11/21/our-theory-of-moderation-re-visited/&quot;&gt;moderators&lt;/a&gt; altogether, but it does mean that the bulk of moderation work is carried out by regular folks — folks like you. Every bit of time and effort y'all contribute to the site gives you access to more privileges you can use to help in this effort, all of which produce a cumulative effect that makes a big difference in ensuring Stack Exchange sites remain a valuable source of high-quality content on the web.&lt;/p&gt;&#xA;&lt;p&gt;So as we say goodbye to 2023 (and January 2024… ahem) and move into 2024, let us look back at what we accomplished as a community... by looking at some &lt;a href=&quot;https://i.stack.imgur.com/pmN7M.gif&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;em&gt;exciting&lt;/em&gt; stats&lt;/a&gt;. Below is a breakdown of moderation actions performed on Code Golf over the past 12 months:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&#xA;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th style=&quot;text-align: left;&quot;&gt;Action&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;Moderators&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;Community User¹&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;Community²&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;All comments on a post moved to chat&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Answer flags handled&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;464&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;210&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Answers flagged&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;52&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;126&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;475&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Bounties canceled&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Comment flags handled&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;233&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;109&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;2&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Comments deleted⁸&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;674&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;19&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;2,340&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Comments flagged&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;2&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;2&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;295&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Comments undeleted&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;11&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Escalations to the Community Manager team&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Posts bumped&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;7&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Posts deleted⁷&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;173&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;189&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;615&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Posts locked&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;6&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;110&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Posts undeleted&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;26&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;249&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Posts unlocked&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;3&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Question flags handled⁶&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;135&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;309&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions closed&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;75&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;100&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;11&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions flagged⁶&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;36&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;19&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;394&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions merged&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions migrated&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions protected&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;10&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions reopened&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;11&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;12&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;4&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Questions unprotected&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;2&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;4&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Revisions redacted&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;8&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tag highlight language set&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tag synonyms created&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tag synonyms proposed&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tags merged&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁵: &amp;quot;Close votes&amp;quot; queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;51&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;252&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁵: &amp;quot;First answers&amp;quot; queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;69&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;368&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁵: &amp;quot;First questions&amp;quot; queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;19&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;110&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁵: &amp;quot;Late answers&amp;quot; queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;51&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;187&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁵: &amp;quot;Low quality posts&amp;quot; queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;38&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;212&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁵: &amp;quot;Reopen votes&amp;quot; queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;30&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;66&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁵: &amp;quot;Suggested edits&amp;quot; queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;72&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;20&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;293&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Tasks reviewed⁵: &amp;quot;Triage&amp;quot; queue&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;User banned from review&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;User review-bans lifted early&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;User suspensions lifted early&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Users contacted&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;9&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Users deleted&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Users destroyed⁴&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;22&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;Users suspended³&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;10&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;53&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;0&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&#xA;&lt;/div&gt;&lt;h3&gt;Footnotes&lt;/h3&gt;&#xA;&lt;p&gt;¹ This refers to the automated systems otherwise known as &lt;a href=&quot;https://codegolf.stackexchange.com/users/-1&quot;&gt;user #-1&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;² This refers to &lt;a href=&quot;https://codegolf.stackexchange.com/users&quot;&gt;the membership of Code Golf&lt;/a&gt; &lt;em&gt;without&lt;/em&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/users?tab=moderators&quot;&gt;diamonds next to their names&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;³ The system will suspend users under three circumstances: when a user is recreated after being previously suspended, when a user is recreated after being destroyed for spam or abuse, and when a network-wide suspension is in effect on an account.&lt;/p&gt;&#xA;&lt;p&gt;⁴ A &amp;quot;destroyed&amp;quot; user is deleted along with all that they had posted: questions, answers, comments. &lt;a href=&quot;https://meta.stackexchange.com/questions/88994/what-is-the-difference-between-a-deleted-user-and-a-destroyed-user&quot;&gt;Generally used as an expedient way of getting rid of spam.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;⁵ This counts every review that was submitted (not skipped) - so the 2 suggested edits reviews needed to approve an edit would count as 2, the goal being to indicate the frequency of moderation actions. This also applies to flags, etc.&lt;/p&gt;&#xA;&lt;p&gt;⁶ Includes close flags (but &lt;em&gt;not&lt;/em&gt; close or reopen votes). The community² can handle these flags by at least one person voting to close a question that has a close flag.&lt;/p&gt;&#xA;&lt;p&gt;⁷ This ignores numerous deletions that happen automatically in response to some other action.&lt;/p&gt;&#xA;&lt;p&gt;⁸ This includes comments deleted by their own authors (which also account for some number of handled comment flags).&lt;/p&gt;&#xA;&lt;h3&gt;Further reading:&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Wanna see how these numbers have changed over time? We posted a similar report here last year: &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/25521/2022-a-year-in-moderation&quot;&gt;2022: a year in moderation&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can also check out &lt;a href=&quot;https://stackexchange.com/search?q=title%3A%222023%3A+a+year+in+moderation%22&quot;&gt;this report on other sites&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Or peruse &lt;a href=&quot;https://meta.stackexchange.com/q/396299/208518&quot;&gt;detailed information on the number of questions closed and reopened across all sites&lt;/a&gt;&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Wishing everyone a happy 2024! ^_^&lt;/p&gt;&#xA;" OwnerUserId="38734" LastActivityDate="2024-01-24T19:07:14.070" Title="2023: a year in moderation" Tags="|discussion|moderation|statistics|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26247" PostTypeId="2" ParentId="2140" CreationDate="2024-01-25T13:57:44.493" Score="1" Body="&lt;p&gt;This is my first challenge here, and I know I'm not supposed to start with a KotH. But I had this idea and I think it is simple enough while allowing more advanced strategies, so here it is:&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/king-of-the-hill&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;king-of-the-hill&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-king-of-the-hill-tooltip-container&quot;&gt;king-of-the-hill&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-javascript-tooltip-container&quot;&gt;javascript&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Tank Game&lt;/h1&gt;&#xA;&lt;p&gt;There are &lt;strong&gt;two tanks&lt;/strong&gt; on a &lt;strong&gt;16×16 toroidal grid&lt;/strong&gt; (wrapping in both directions), one starting at &lt;code&gt;(0, 0)&lt;/code&gt; and its opponent starting at &lt;code&gt;(8, 8)&lt;/code&gt;. The objective is to occupy the enemy base (starting point) without getting shot.&#xA;Some grid cells are walls, which tanks can't move, shoot or see through.&#xA;Each submission includes 2 separate programs that form a team, a &lt;em&gt;commander&lt;/em&gt; and a &lt;em&gt;tank driver&lt;/em&gt;. Direct communication between them is not allowed, but actions of the commanders are visible to the drivers, &lt;strong&gt;allowing you to encode some information that way&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;h2&gt;The commander&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Sees the entire map and the positions of the tanks.&lt;/li&gt;&#xA;&lt;li&gt;Can build or destroy walls.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;The tank&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Has very limited vision but knows its position.&lt;/li&gt;&#xA;&lt;li&gt;Sees the actions of both the friendly and the enemy commander.&lt;/li&gt;&#xA;&lt;li&gt;Can move in a straight line up to 3 cells.&lt;/li&gt;&#xA;&lt;li&gt;Can shoot in a straight line.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Details of the game&lt;/h2&gt;&#xA;&lt;p&gt;The tanks and commanders take turns in the following order:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Commander of 1st submission&lt;/li&gt;&#xA;&lt;li&gt;Tank driver of 2nd submission&lt;/li&gt;&#xA;&lt;li&gt;Commander of 2nd submission&lt;/li&gt;&#xA;&lt;li&gt;Tank driver of 1st submission&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Although from an outside perspective your tank may start at either &lt;code&gt;(0, 0)&lt;/code&gt; or &lt;code&gt;(8, 8)&lt;/code&gt;, &lt;strong&gt;the map and all other coordinates provided to your programs (including enemy actions) will be translated by the controller to make it look like your tank started at &lt;code&gt;(0, 0)&lt;/code&gt; and has to go to &lt;code&gt;(8, 8)&lt;/code&gt;.&lt;/strong&gt; This is done so your program doesn't have to check where it started from.&lt;/p&gt;&#xA;&lt;p&gt;The starting position looks like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;      | 0| 1| 2| 3| 4| 5| 6| 7| 8| 9|10|11|12|13|14|15 &amp;lt;--- Coordinates observed by Tank 1&#xA;      | 8| 9|10|11|12|13|14|15| 0| 1| 2| 3| 4| 5| 6| 7 &amp;lt;--- Coordinates observed by Tank 2&#xA;------+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--&#xA; 0  8 |T1|  |  |  |  |  |  |  |  |  |  |  |  |  |  |&#xA;------+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--&#xA; 1  9 |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |&#xA;------+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--&#xA; 2 10 |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |&#xA;------+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--&#xA; 3 11 |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |&#xA;------+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--&#xA; 4 12 |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |&#xA;------+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--&#xA; 5 13 |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |&#xA;------+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--&#xA; 6 14 |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |&#xA;------+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--&#xA; 7 15 |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |&#xA;------+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--&#xA; 8  0 |  |  |  |  |  |  |  |  |T2|  |  |  |  |  |  |&#xA;------+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--&#xA; 9  1 |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |&#xA;------+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--&#xA;10  2 |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |&#xA;------+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--&#xA;11  3 |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |&#xA;------+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--&#xA;12  4 |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |&#xA;------+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--&#xA;13  5 |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |&#xA;------+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--&#xA;14  6 |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |&#xA;------+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--&#xA;15  7 |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |&#xA;^^ ^^&#xA;|| ++---- Coordinates observed by Tank 2&#xA;++---- Coordinates observed by Tank 1&#xA;&#xA;T1: Starting position of Tank 1, target of Tank 2&#xA;T2: Starting position of Tank 2, target of Tank 1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The &lt;strong&gt;commander&lt;/strong&gt; receives two arguments, &lt;code&gt;map&lt;/code&gt; and &lt;code&gt;enemyAction&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;map: (x: number, y: number) =&amp;gt; Cell&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;A &lt;code&gt;Cell&lt;/code&gt; is one of the following:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;' '&lt;/code&gt; (space): empty cell&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;'#'&lt;/code&gt;: wall&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;'F'&lt;/code&gt;: friendly tank&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;'E'&lt;/code&gt;: enemy tank&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt; wrap around (mod 16).&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;You can't directly modify the map&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;enemyAction: Action&lt;/code&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&#xA;&lt;pre&gt;&lt;code&gt;type Action = { action: 'B'|'D', x: number, y: number } | null&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The last action of the enemy commander.&lt;/li&gt;&#xA;&lt;li&gt;Given only for convenience, it could be computed from the map.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And must return one of the following actions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;{ action: 'B', x: number, y: number }&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Builds a wall.&lt;/li&gt;&#xA;&lt;li&gt;Walls can not be built on the two bases (&lt;code&gt;(0,0)&lt;/code&gt; and &lt;code&gt;(8,8)&lt;/code&gt;) and on cells with tanks. Attempting to do so is an error.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;{ action: 'D', x: number, y: number }&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Destroys a wall.&lt;/li&gt;&#xA;&lt;li&gt;Attempting to destroy a non-existing wall is an error.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;null&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Does nothing.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The &lt;strong&gt;tank driver&lt;/strong&gt; receives four arguments:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;x: number, y: number&lt;/code&gt;: position of your tank&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;friendlyAction: Action, enemyAction: Action&lt;/code&gt;: the last actions of the friendly and enemy commanders.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And must return one of the following actions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;{ action: 'M', direction: Direction, distance: number }&lt;/code&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Move the tank (up to 3 cells in a straight line, instantly).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Direction&lt;/code&gt; is one of the following:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;'U'&lt;/code&gt;: negative &lt;code&gt;y&lt;/code&gt; direction (up)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;'L'&lt;/code&gt;: negative &lt;code&gt;x&lt;/code&gt; direction (left)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;'D'&lt;/code&gt;: positive &lt;code&gt;y&lt;/code&gt; direction (down)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;'R'&lt;/code&gt;: positive &lt;code&gt;x&lt;/code&gt; direction (right)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1 &amp;lt;= distance &amp;lt;= 3&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;If the tank can't move &lt;code&gt;distance&lt;/code&gt; cells because a wall or the enemy tank is in the way, it stops moving before colliding with that (it will not move at all if the obstacle is directly in front of it).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;{ action: 'S', direction: Direction }&lt;/code&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Shoot.&lt;/li&gt;&#xA;&lt;li&gt;The bullet travels in a straight line until it hits a wall or a tank, instantly.&lt;/li&gt;&#xA;&lt;li&gt;If you hit the enemy tank, you immediately win the round 2-0.&lt;/li&gt;&#xA;&lt;li&gt;You can't shoot yourself.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;&lt;code&gt;{ action: 'L', callback: (Result) =&amp;gt; void }&lt;/code&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Look around (in straight lines in all 4 directions).&lt;/li&gt;&#xA;&lt;li&gt;&#xA;&lt;pre&gt;&lt;code&gt;type Result = { U: number, L: number, D: number, R: number, enemyDirection: Direction | null }&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;U&lt;/code&gt;, &lt;code&gt;L&lt;/code&gt;, &lt;code&gt;D&lt;/code&gt; and &lt;code&gt;R&lt;/code&gt; are the lengths of empty cells in the respective directions.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;enemyDirection&lt;/code&gt; is the relative direction of the enemy tank, if visible. If there are no walls in the row/column, it will be the direction which the enemy is closer in.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Reaching &lt;code&gt;(8,8)&lt;/code&gt; and surviving until your next turn: win 3-0&lt;/li&gt;&#xA;&lt;li&gt;Shooting down the enemy tank: win 2-0&lt;/li&gt;&#xA;&lt;li&gt;Reaching turn number 40 without a winner: draw 1-1&lt;/li&gt;&#xA;&lt;li&gt;Throwing an error or returning invalid action: lose 0-3&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Technical details&lt;/h2&gt;&#xA;&lt;p&gt;The submissions must consist of two separate programs written in &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/javascript&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;javascript&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-javascript-tooltip-container&quot;&gt;javascript&lt;/a&gt;. The programs may not use any APIs that aren't part of the language itself (i.e. browser or Node.js APIs) and may not introduce globally observable changes (including but not limited to prototype pollution and mutating built-in objects). The programs may not run code asynchronously.&lt;/p&gt;&#xA;&lt;p&gt;To keep the game reproducable, &lt;code&gt;Math.random()&lt;/code&gt; will be replaced with a seeded PRNG, which you can use for randomness, but please don't introduce any other non-determinism.&lt;/p&gt;&#xA;&lt;p&gt;The commander must be a script with a function &lt;code&gt;commander&lt;/code&gt; in the top-level scope. Likewise, the tank driver has to have a function named &lt;code&gt;tankDriver&lt;/code&gt;. You may create helper functions and variables for storing state (state will be reset after each game).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Each submission will be run against every other submission in pairs&lt;/strong&gt;, 2×5 times for each pair (each submission starting 5 times). The maps will be randomly generated. The submission reaching the highest total score wins the challenge.&lt;/p&gt;&#xA;&lt;p&gt;The controller is not yet done, I want to get feedback about the challenge first.&lt;/p&gt;&#xA;&lt;p&gt;Besides the ones listed above, &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot;&gt;standard loopholes&lt;/a&gt; also apply.&lt;/p&gt;&#xA;&lt;p&gt;I reserve my right to disqualify entries that violate the above rules or ones that I deem to be cheating. I will always notify the author in advance and allow them to fix the problems.&lt;/p&gt;&#xA;" OwnerUserId="103633" LastEditorUserId="103633" LastEditDate="2024-01-26T13:43:34.083" LastActivityDate="2024-01-26T13:43:34.083" CommentCount="12" ContentLicense="CC BY-SA 4.0" />
  <row Id="26248" PostTypeId="2" ParentId="2140" CreationDate="2024-01-26T00:37:09.110" Score="0" Body="&lt;h1&gt;How many ways does this string conform to this expression?&lt;/h1&gt;&#xA;&lt;p&gt;Given an expression, decide in how many ways could an inputted string consisting of only printable ascii conforms to that expression. The best way to explain how the expression works is with an example, so here is one.&lt;/p&gt;&#xA;&lt;p&gt;Let's say the expression is &lt;code&gt;a + b + c + a&lt;/code&gt;. That means the string should start with a contiguous substring a, then at some point split into substring b, and finally end with substring a again (is this example, a, b, and c must be distinct.) Now let's say the string is &amp;quot;hello world please subscribe hello&amp;quot;. One possible way would be:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a = &amp;quot;hello&amp;quot;&#xA;b = &amp;quot; world &amp;quot;&#xA;c = &amp;quot; please subscribe &amp;quot;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You task is to find how many ways you can split up the string so that the resulting substrings conform to the expression. If no split exists, output/return 0.&lt;/p&gt;&#xA;&lt;p&gt;[more coming soon]&lt;/p&gt;&#xA;" OwnerUserId="105116" LastActivityDate="2024-01-26T00:37:09.110" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26249" PostTypeId="2" ParentId="2140" CreationDate="2024-01-26T16:28:06.493" Score="0" Body="&lt;h1&gt;Tile the untileable&lt;/h1&gt;&#xA;&lt;p&gt;Only triangles, squares, and hexagons can tile perfectly with no gaps. With any other polygon, there will always be gaps. But what if you could tile with say, a pentagon? You just have to cheat, with other shapes. Given two integers a and b, how many x-sided polygons where a != x and x &amp;gt;= 3 are needed so that you can tile b a-sided polygons perfectly with the help of x-sided polygons? You may assume it is always possible.&lt;/p&gt;&#xA;&lt;h2&gt;More constraints&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The area and perimeter of all a-sided polygons must be equal&lt;/li&gt;&#xA;&lt;li&gt;^ must also hold for the n x-sided polygons&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;[example and test cases coming soon]&lt;/p&gt;&#xA;&lt;hr&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;I don't know how to do this at all.&lt;/li&gt;&#xA;&lt;li&gt;The wording could probably be better.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="105116" LastActivityDate="2024-01-26T16:28:06.493" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26250" PostTypeId="2" ParentId="2140" CreationDate="2024-01-27T03:47:03.380" Score="2" Body="&lt;h1&gt;Fastest bytewise comparisons in 64-bit unsigned integers&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/fastest-code&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;fastest-code&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-fastest-code-tooltip-container&quot;&gt;fastest-code&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/bitwise&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;bitwise&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;bitwise&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-bitwise-tooltip-container&quot;&gt;bitwise&lt;/a&gt; [tag:i-don't-know]&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Create a function that accepts two 64-bit unsigned integers, &lt;code&gt;a&lt;/code&gt; and&#xA;&lt;code&gt;b&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Compare each corresponding byte in &lt;code&gt;a&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;If the byte in &lt;code&gt;a&lt;/code&gt; is greater than the byte in &lt;code&gt;b&lt;/code&gt; in the same position, set the&#xA;corresponding byte in the output to &lt;code&gt;255&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Otherwise, set the corresponding byte in the output to &lt;code&gt;0&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;Return the resulting 64-bit unsigned integer.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Restrictions: the code runs in x86-64, no explict SSEx, AVXx (is ok if the compiler vectorices the result)&lt;/p&gt;&#xA;&lt;p&gt;Example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a =      202      141        1      123       61       53       40 251&#xA;b =      158       75      185      217        5       90      152 225&#xA;a = 11001010 10001101 00000001 01111011 00111101 00110101 00101000 11111011&#xA;b = 10011110 01001011 10111001 11011001 00000101 01011010 10011000 11100001&#xA;a&amp;gt;b=     255      255        0        0      255        0        0      255&#xA;a&amp;gt;b=11111111 11111111 00000000 00000000 11111111 00000000 00000000 11111111&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="120775" LastEditorUserId="91213" LastEditDate="2024-01-27T16:02:59.170" LastActivityDate="2024-01-27T16:02:59.170" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26251" PostTypeId="2" ParentId="2140" CreationDate="2024-01-27T16:55:09.613" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/269592/91472&quot;&gt;Solve a squared cryptarithm&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91472" LastEditorUserId="91472" LastEditDate="2024-01-29T02:06:06.600" LastActivityDate="2024-01-29T02:06:06.600" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26253" PostTypeId="1" AcceptedAnswerId="26255" CreationDate="2024-01-28T16:37:17.173" Score="5" ViewCount="133" Body="&lt;p&gt;For example, I've spent several days reducing &lt;a href=&quot;https://codegolf.stackexchange.com/a/269554/108687&quot;&gt;an assembly submission&lt;/a&gt; from an initial &lt;strong&gt;456&lt;/strong&gt; bytes down to &lt;del&gt;&lt;strong&gt;330&lt;/strong&gt;&lt;/del&gt; &lt;strong&gt;322&lt;/strong&gt; bytes.&lt;/p&gt;&#xA;&lt;p&gt;How can I determine when a code golf solution has reached its most compressed or optimized form?&lt;/p&gt;&#xA;" OwnerUserId="119544" LastEditorUserId="119544" LastEditDate="2024-01-28T23:26:40.623" LastActivityDate="2024-01-28T23:26:40.623" Title="How can I know when to stop golfing?" Tags="|discussion|code-golf|" AnswerCount="1" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26254" PostTypeId="2" ParentId="2140" CreationDate="2024-01-28T19:43:33.787" Score="1" Body="&lt;h1&gt;Demonstrate that 1³+2³+...+n³ = (1+2+...+n)²&lt;/h1&gt;&#xA;&lt;p&gt;The following image is a proof without words that &lt;span class=&quot;math-container&quot;&gt;\$\sum_{i=1}^{n}i^3=\left(\sum_{i=1}^{n}i\right)^2\$&lt;/span&gt;, or in other words, the sum of the first n cubes equals the square of the sum of the first n positive integers.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/1ZMwXm.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/1ZMwXm.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The image contains (the equivalent of) 1 square with side length 1, 2 squares with side length 2, etc up to 5 squares with side length 5. The 1x1 squares have a total area of 1x1x1 = 1³, the 2x2 squares have a total area of 2x2x2=2³, and the 5x5 squares have a total area of 5x5x5=5³. Overall, the total area of all the squares is 1³ + 2³ + 3³ + 4³ + 5³.&lt;/p&gt;&#xA;&lt;p&gt;But, the larger square has a side length of 1+2+3+4+5, and an area of (1+2+3+4+5)². And, since all the small squares take up the same space as the large square, they must have the same total area, so 1³+2³+3³+4³+5³ = (1+2+3+4+5)². This can be shown to work for all positive integers.&lt;/p&gt;&#xA;&lt;p&gt;The above can also be represented as the following integer matrix:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5]&#xA; [2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5]&#xA; [2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5]&#xA; [3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5]&#xA; [3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5]&#xA; [3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5]&#xA; [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5]&#xA; [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5]&#xA; [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5]&#xA; [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5]&#xA; [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5]&#xA; [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5]&#xA; [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5]&#xA; [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5]&#xA; [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This matrix can be thought of as a series of &amp;quot;bands&amp;quot;, where each band #n contains all points at coordinates (x, y) where max(x, y) = n. Every point in the first band, containing the point at coordinates &lt;code&gt;[1, 1]&lt;/code&gt;, contains 1; the second, containing &lt;code&gt;[[1, 2], [2, 2], [2, 1]]&lt;/code&gt;, and the third, containing &lt;code&gt;[[1,3],[2,3],[3,3],[3,2],[3,1]]&lt;/code&gt;, contain only 2s, the next 3 bands contain only 3s, and so on up to 5.&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to, given a positive integer n, output the corresponding integer matrix for n. The above matrix should be output when 5 is input.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, shortest wins!&lt;/p&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2024-01-28T20:51:34.987" LastActivityDate="2024-01-28T20:51:34.987" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26255" PostTypeId="2" ParentId="26253" CreationDate="2024-01-28T20:38:55.823" Score="11" Body="&lt;h1&gt;You can't know when a program is done, but you can know when you are done&lt;/h1&gt;&#xA;&lt;p&gt;Determining whether a general program can be shortened is equivalent to the halting problem. There is no algorithm that can be run to check.&lt;/p&gt;&#xA;&lt;p&gt;You should instead stop golfing when further work on a particular program isn't fun for you. If you are out of ideas, it's better to go do something else than to just stare at the screen.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2024-01-28T20:38:55.823" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26257" PostTypeId="2" ParentId="2140" CreationDate="2024-01-30T07:59:00.553" Score="0" Body="&lt;h1&gt;Summarise a Long Conversation&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-challenge&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-challenge&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-challenge-tooltip-container&quot;&gt;code-challenge&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/prompt-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;prompt-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;prompt-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-prompt-golf-tooltip-container&quot;&gt;prompt-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;em&gt;Note: I'm aware that there's been some attempts at doing chatgpt golf on the site but there's always been the problem of subjectivity. I've come up with an idea that could maybe add objectivity to the concept of general LLM golfing&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Second note: prompt golf doesn't exist as a tag yet so it'd be created upon question posting most likely if at all&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Final note: this might be better as a meta discussion, but just to kick things off I've made it a sandbox post&lt;/em&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;&lt;em&gt;Inspired by a real life problem&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;If you ever been in a busy SE chat room/discord server/whatsapp group chat or any other place where you can talk over the internet and there's lots of messages, you'll know that it can be hard to keep up with what's being discussed. Especially if you've been away for a while (e.g sleep) and there's literal hundreds of new messages.&lt;/p&gt;&#xA;&lt;p&gt;Your task today is to take a list of messages and summarise it into a nice digestible format.&lt;/p&gt;&#xA;&lt;p&gt;&amp;quot;But that's a hard problem people have spent years researching and everything like how do you expect us to write a summarisation algorithm that's actually good without using something like a LLM?&amp;quot;&lt;/p&gt;&#xA;&lt;p&gt;By using a LLM, obviously.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a series of messages with each individual message on a new line, write a prompt that summarises the content.&lt;/p&gt;&#xA;&lt;p&gt;To verify that the output is actually a summary, the result will be run by an oracle prompt in &amp;lt;insert LLM that'll be used for testing&amp;gt;:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;lt;prompt I've yet to write that outputs either yes or no depending on whether the oracle LLM would summarise in the same way&amp;gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;To account for the non-deterministic behaviour of LLMs (their temperature), your prompt must return an accepted result for at least 4 out of 5 runs. &lt;em&gt;required run rate subject to change&lt;/em&gt;. This is to establish that it's a genuinely working prompt and not a fluke.&lt;/p&gt;&#xA;&lt;p&gt;Alternatively, if your LLM has a temperature setting you can set to 0, or is deterministic by default only one verified run is needed.&lt;/p&gt;&#xA;&lt;h2&gt;Input Format&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;name: message&#xA;name: message&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Rules&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;to be finalised - I might decide to switch up how this challenge is scored&lt;/em&gt;&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Inputs will not be longer than 1000 characters (to ensure no token limits are reached)&lt;/li&gt;&#xA;&lt;li&gt;Prompts that try to return results that jailbreak the oracle are allowed, but note that you'll probably find better results by just doing the task legitimately.&lt;/li&gt;&#xA;&lt;li&gt;LLMs you can use are Chatgpt 3.5/ 4 and Google Bard.&lt;/li&gt;&#xA;&lt;li&gt;provide links to sample runs if possible.&lt;/li&gt;&#xA;&lt;li&gt;The answer(s) with the shortest prompt as measured in utf-8 bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Example Inputs&lt;/h2&gt;&#xA;&lt;p&gt;&lt;em&gt;todo&lt;/em&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Sandbox meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Does this work towards solving the subjectivity problem of prompt golf?&lt;/li&gt;&#xA;&lt;li&gt;Does the testing/verification method need more runs or a different set-up?&lt;/li&gt;&#xA;&lt;li&gt;Is prompt golf even something that should be a challenge?&lt;/li&gt;&#xA;&lt;li&gt;Are there any other things I haven't thought of?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2024-01-30T07:59:00.553" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26258" PostTypeId="2" ParentId="2140" CreationDate="2024-01-30T16:19:30.630" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/269712/modular-equivalence&quot;&gt;Modular Equivalence&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="96266" LastEditorUserId="96266" LastEditDate="2024-02-02T13:07:02.720" LastActivityDate="2024-02-02T13:07:02.720" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26259" PostTypeId="1" CreationDate="2024-01-30T19:17:57.833" Score="4" ViewCount="51" Body="&lt;p&gt;The tag &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;conversion&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;conversion&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-conversion-tooltip-container&quot;&gt;conversion&lt;/a&gt; is a bit of an oddball. Its description is &amp;quot;This tag indicates that the challenge involves converting from one format to another&amp;quot;, which is extremely vague, and could apply to a substantial proportion of all the challenges on this site. As it stands, it seems to encompass everything that could vaguely be considered transforming an input from one format to another, including:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/150250/hsl-to-rgb-values&quot;&gt;Various&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/129208/convert-cmyk-values-to-rgb&quot;&gt;color&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/129055/how-to-convert-hex2-to-rgba&quot;&gt;formatting&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/84066/from-rgb-to-cmyk&quot;&gt;challenges&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/44830/string-to-binary&quot;&gt;A few&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/35498/implement-atoi-function&quot;&gt;base&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/200863/convert-a-decimal-integer-to-binary-only-using-arithmetic-operators&quot;&gt;conversion&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/92120/convert-to-bibi-binary&quot;&gt;challenges&lt;/a&gt;, despite &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/base-conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;base-conversion&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-base-conversion-tooltip-container&quot;&gt;base-conversion&lt;/a&gt; existing&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/238462/convert-superscript-numbers-to-normal-numbers&quot;&gt;A&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/92471/convert-to-bubble-letters&quot;&gt;lot&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/60443/s%e1%b4%8d%e1%b4%80%ca%9f%ca%9f-c%e1%b4%80%e1%b4%98%ea%9c%b1-c%e1%b4%8f%c9%b4%e1%b4%a0%e1%b4%87%ca%80%e1%b4%9b%e1%b4%87%ca%80&quot;&gt;of&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/57462/goodness-its-covered-in-tabs&quot;&gt;character&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/56001/my-god-its-full-of-spaces&quot;&gt;substitution&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/101374/line-ending-conversion-program&quot;&gt;challenges&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/252936/convert-an-integer-to-ieee-754-float&quot;&gt;Some&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/196003/convert-complex-chinese-numbers-into-arabic-numbers&quot;&gt;number&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/193357/convert-a-string-of-digits-from-words-to-an-integer&quot;&gt;format&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/170544/count-like-a-babylonian&quot;&gt;conversion&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/176371/densely-packed-decimal-dpd-to-decimal&quot;&gt;challenges&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/167962/cobol-y2k-redux&quot;&gt;A&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/176647/convert-an-excel-date-code-to-a-date&quot;&gt;couple&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/105858/12-hour-to-24-hour-time-converter&quot;&gt;of&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/96121/world-time-conversion&quot;&gt;date&lt;/a&gt;/&lt;a href=&quot;https://codegolf.stackexchange.com/questions/71203/convert-the-time-to-a-string&quot;&gt;time&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/65106/running-length-of-the-movie-in-a-human-readable-format&quot;&gt;challenges&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/51109/translate-your-english-source-code-into-a-foreign-language&quot;&gt;Various&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/123141/generate-chord-charts-for-ukulele&quot;&gt;miscellaneous&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/129018/how-much-mana-do-i-need&quot;&gt;challenges&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;This tag doesn't really seem to have any consistent meaning more specific than &amp;quot;conversion&amp;quot;,  and seems to be somewhat of a meta-tag in that it's blindly applied to most challenges with &amp;quot;convert&amp;quot;/&amp;quot;conversion&amp;quot; in the title/body.&lt;/p&gt;&#xA;&lt;p&gt;I can think of three possible options for this:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Narrow &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/conversion&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;conversion&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;conversion&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-conversion-tooltip-container&quot;&gt;conversion&lt;/a&gt;'s scope down to something more objective, and remove it from a large amount of questions&lt;/li&gt;&#xA;&lt;li&gt;Remove it entirely&lt;/li&gt;&#xA;&lt;li&gt;Give up and apply it to a third of all &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; challenges.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;So, what should we do with this tag?&lt;/p&gt;&#xA;" OwnerUserId="100664" LastActivityDate="2024-01-30T19:17:57.833" Title="Please convert [tag:conversion]" Tags="|discussion|tags|" AnswerCount="0" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26260" PostTypeId="1" CreationDate="2024-01-31T03:59:20.753" Score="1" ViewCount="84" Body="&lt;p&gt;Since January 10th, &lt;a href=&quot;https://meta.stackexchange.com/q/395881/355458&quot;&gt;sites have been able to request&lt;/a&gt; to opt in to have a banner shown on answers reminding answerers on their site's policy regarding AI generated content.&lt;/p&gt;&#xA;&lt;p&gt;This leads to two questions:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Do we want such a banner?&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If so, which option? &amp;quot;Answers generated by artificial intelligence tools are not allowed on Code Golf&amp;quot; or &amp;quot;Answers generated by artificial intelligence tools must be cited on Code Golf&amp;quot;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;p&gt;And, more implicitly, what &lt;em&gt;is&lt;/em&gt; our policy on AI generated answers? Do we even have one? Do we &lt;em&gt;need&lt;/em&gt; a site-specific policy?&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Currently, from my understanding, moderators and users have been widely applying SE's general legal position that non-original works must be cited and credit given to the original author, and AI generated posts that do not meet this criteria are, by purpose of this more general policy, removed from the site. But what about AI posts in general, or those that do cite ChatGPT or similar?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="66833" LastActivityDate="2024-01-31T04:52:32.413" Title="Do we want a banner warning about our policy on AI generated content?" Tags="|discussion|policy|answers|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26261" PostTypeId="2" ParentId="26260" CreationDate="2024-01-31T04:39:53.057" Score="4" Body="&lt;p&gt;I'll answer the questions in reverse order because the policy defines whether a banner is needed.&lt;/p&gt;&#xA;&lt;h2&gt;Policy&lt;/h2&gt;&#xA;&lt;p&gt;Currently there's no local code golf consensus on ai answers - a search for &amp;quot;ai&amp;quot; on code golf meta reveals no policy about banning usage of chatgpt and co. Further, there is no official network wide policy disallowing referenced ai posts:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;With due consideration, we've decided no network-wide, general policy regarding banning ChatGPT, or other AI generated content, is necessary or helpful at this time.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://meta.stackexchange.com/a/385002/391137&quot;&gt;Quote from an answer by Community Manager (CM) Slate regarding banning chatgpt network wide&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Noticed how I said that referenced ai posts are not disallowed (that is, ai generated posts that are properly cited as being made by ai are allowed by default). Posts suspected of being generated by AI without proper referencing &lt;a href=&quot;https://meta.stackexchange.com/a/384648/391137&quot;&gt;are plagiarism and aren't allowed regardless of ai policy&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, the question becomes whether properly referenced ai generated posts are allowed. Personally, I'd lean towards allowing them because it's gosh dang impressive if you can get chatgpt to create a golfed answer that actually solves a challenge &lt;em&gt;and&lt;/em&gt; abides by the competitive submission policy. Trust me I've tried from my experience it makes code longer.&lt;/p&gt;&#xA;&lt;h2&gt;Banner&lt;/h2&gt;&#xA;&lt;p&gt;Therefore, given the lack of policy, a banner isn't needed at this stage. How can people be warned about something that doesn't exist? If at some point there's a policy decision that ai generated posts that are properly referenced &lt;em&gt;aren't&lt;/em&gt; allowed, then the banner would be a good idea.&lt;/p&gt;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2024-01-31T04:52:32.413" LastActivityDate="2024-01-31T04:52:32.413" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26262" PostTypeId="1" CreationDate="2024-01-31T08:17:03.473" Score="4" ViewCount="91" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/26260/do-we-want-a-banner-warning-about-our-policy-on-ai-generated-content&quot;&gt;Relevant discussion that inspired this question&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Questions and answers (content) generated by AIs like LLMs (e.g ChatGPT, Google Bard, character.ai) are not prohibited on the StackExchange network by default:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;With due consideration, we've decided no network-wide, general policy regarding banning ChatGPT, or other AI generated content, is necessary or helpful at this time.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;~ &lt;a href=&quot;https://meta.stackexchange.com/users/1037447/slate&quot;&gt;Slate&lt;/a&gt;, a Community Manager, &lt;a href=&quot;https://meta.stackexchange.com/a/385002/391137&quot;&gt;in response to a question on whether AI content should be banned network wide&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Therefore, it's up to per-site metas to establish AI content policies.&lt;/p&gt;&#xA;&lt;p&gt;However, unattributed AI content is &lt;em&gt;not&lt;/em&gt; allowed on any StackExchange site, as it's considered plagiarism:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;However... [we] consider AI generated content to be &amp;quot;the work of others&amp;quot; and the requirements for referencing must be followed for all such content on the network.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;(from the same answer by slate)&lt;/p&gt;&#xA;&lt;p&gt;That is to say, AI generated content not marked as such is not allowed by default. No questions about that.&lt;/p&gt;&#xA;&lt;p&gt;So,&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Should properly referenced AI generated content be allowed on the Code Golf StackExchange?&lt;/strong&gt;&lt;/p&gt;&#xA;" OwnerUserId="78850" LastActivityDate="2024-01-31T15:09:14.427" Title="Should AI generated questions and or answers be banned?" Tags="|discussion|policy|" AnswerCount="1" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26263" PostTypeId="2" ParentId="2140" CreationDate="2024-01-31T14:03:01.810" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/269752/3d-hide-seek-word-puzzle&quot;&gt;3D Hide &amp;amp; Seek Word Puzzle&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="119544" LastEditorUserId="119544" LastEditDate="2024-02-03T16:20:11.390" LastActivityDate="2024-02-03T16:20:11.390" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26264" PostTypeId="2" ParentId="26262" CreationDate="2024-01-31T15:09:14.427" Score="5" Body="&lt;p&gt;As many have pointed out, it's practically impossible to get any of the current statistical models to produce a valid well golfed CGSE answer. We could speculate as to why that is, but it is evident.&lt;/p&gt;&#xA;&lt;p&gt;So currently there is no issue. Answers from LLMs are de-facto banned on the account that they don't follow other rules.&lt;/p&gt;&#xA;&lt;p&gt;I don't see any sense in attempting to fix something that isn't a problem. Instead of trying to speculate about what the future might hold and what effective policy would be, we should revisit issue if statistical models ever become proficient enough to get past these first hurdles.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2024-01-31T15:09:14.427" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26265" PostTypeId="1" AcceptedAnswerId="26266" CreationDate="2024-02-01T05:18:01.090" Score="6" ViewCount="122" Body="&lt;p&gt;I'm working on my custom golfing language &lt;a href=&quot;https://github.com/tacosontitan/Hussy.Net&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hussy.Net&lt;/a&gt;, built on top of C#, to address a lot of its pitfalls around verbosity:&lt;/p&gt;&#xA;&lt;pre class=&quot;lang-cs prettyprint-override&quot;&gt;&lt;code&gt;R(10).F(EV).E(W);&#xA;&#xA;                     // Breakdown&#xA;                     // ==============================================&#xA;R(10).               // Create a collection of integers from 1 to 10.&#xA;      F(             // Filter the collection.&#xA;        EV).         // Check each value for clean divisibility by 2.&#xA;            E(       // Iterate over each value.&#xA;              W);    // Write the value to a new line.&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;As the language progresses, I'd like to start using it in challenges to test it out in a more thorough manner.&lt;/p&gt;&#xA;&lt;p&gt;However, given that I just started working on it earlier this week, and I'm a good way away from the initial release, I'm curious as to when it becomes eligible for usage with answers here. IIRC, the official stance is that I can't use features from a language if they didn't exist before the challenge was created, but is that the only requirement?&lt;/p&gt;&#xA;&lt;p&gt;For example, can I use the features it has today in a challenge created tomorrow, or does it have to be tied to an officially released version?&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Are there any other minimum age requirements for using a language?&lt;/p&gt;&#xA;" OwnerUserId="81972" LastEditorUserId="46076" LastEditDate="2024-03-19T00:00:54.537" LastActivityDate="2024-03-19T00:00:54.537" Title="Are there minimum age requirements for languages?" Tags="|support|languages|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26266" PostTypeId="2" ParentId="26265" CreationDate="2024-02-01T05:50:13.170" Score="9" Body="&lt;h1&gt;No (there are not)&lt;/h1&gt;&#xA;&lt;p&gt;We used to have a policy that answers with languages that were newer than the challenge could not be considered competing, but this requirement has since been removed since it was doing more harm than good (&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/12877/lets-allow-newer-languages-versions-for-older-challenges&quot;&gt;source&lt;/a&gt;).&lt;/p&gt;&#xA;&lt;p&gt;As long as you aren't creating built-ins specifically for the challenge, it shouldn't be a problem. We have standard loopholes against things that obviously violate the spirit of healthy competition but your language and features you use do not need to predate the challenge.&lt;/p&gt;&#xA;" OwnerUserId="68942" LastActivityDate="2024-02-01T05:50:13.170" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26267" PostTypeId="2" ParentId="2140" CreationDate="2024-02-01T15:52:16.507" Score="0" Body="&lt;p&gt;&lt;strong&gt;bit-packing&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The GSM7 03.38 protocol specifies a bit packing/unpacking algorithm, to pack septets into octets and vice-versa.&lt;/p&gt;&#xA;&lt;p&gt;The following &lt;a href=&quot;https://www.codeproject.com/Tips/470755/Encoding-Decoding-7-bit-User-Data-for-SMS-PDU-PDU&quot; rel=&quot;nofollow noreferrer&quot;&gt;https://www.codeproject.com/Tips/470755/Encoding-Decoding-7-bit-User-Data-for-SMS-PDU-PDU&lt;/a&gt; is a reasonable reference implementation, which details the packing algorithm.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; the packing algorithm - shortest code wins.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;input&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;byte array in a style relevant to your language&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;output&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;packed byte array&lt;/p&gt;&#xA;&lt;p&gt;You can use &lt;a href=&quot;http://smstools3.kekekasvi.com/topic.php?id=288&quot; rel=&quot;nofollow noreferrer&quot;&gt;http://smstools3.kekekasvi.com/topic.php?id=288&lt;/a&gt; to check your work - enter some text at the top, click convert, convert again, and then &amp;quot;User data translation (7 bit only)&amp;quot; for a handy comparison chart between the octets and septets.&lt;/p&gt;&#xA;" OwnerUserId="62289" LastActivityDate="2024-02-01T15:52:16.507" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26269" PostTypeId="2" ParentId="2140" CreationDate="2024-02-03T08:50:50.947" Score="0" Body="&lt;h1&gt;State compression&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-string-tooltip-container&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;A long time ago in a &lt;a href=&quot;https://codegolf.stackexchange.com/q/124145&quot;&gt;challenge&lt;/a&gt; &lt;sup&gt;far, far away&lt;/sup&gt;, golfers were tasked with outputting one of three different outputs, depending on whether the input was: &lt;code&gt;OR&lt;/code&gt;, one of the other 49 American states' two-letter abbreviations, or something else entirely. The list of these letter pairs looks like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;AL, AK, AZ, AR, CA, CO, CT, DE, FL, GA, HI, ID, IL, IN, IA, KS, KY, LA, ME, MD, MA, MI, MN, MS, MO, MT, NE, NV, NH, NJ, NM, NY, NC, ND, OH, OK, OR, PA, RI, SC, SD, TN, TX, UT, VT, VA, WA, WV, WI, WY&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The standard approach to achieve the task was to search for the input in this string, bar the commas but &lt;em&gt;not&lt;/em&gt; the spaces. If the spaces were to be removed, unintended letter pairs would appear within the string. For example, this string would start with &lt;code&gt;ALAKAZ&lt;/code&gt; and while the newly formed &lt;code&gt;LA&lt;/code&gt; is one of the valid pairs (and hence, did not need to appear again in the search string), the same cannot be said for &lt;code&gt;KA&lt;/code&gt;. (And you'd probably anger some people from Kansas. I dunno, I've no idea what people from Kansas get up to.)&lt;/p&gt;&#xA;&lt;p&gt;But, with some careful rearrangement, the technique could be used in certain places to save a handful of bytes. The string that most solutions ended up using looked like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;MINCALA MSCTNMNVAKY WAZ PAR FL GA NHID COKSD ME MDE MA MTX NE NJ NY ND MOH ORIA UT WVT WIL WY&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Pretty unrecognizable, right? If you look at the first &amp;quot;word&amp;quot;, &lt;code&gt;MINCALA&lt;/code&gt;, it contains &lt;code&gt;MI&lt;/code&gt;, &lt;code&gt;IN&lt;/code&gt;, &lt;code&gt;NC&lt;/code&gt;, &lt;code&gt;CA&lt;/code&gt;, &lt;code&gt;AL&lt;/code&gt;, and &lt;code&gt;LA&lt;/code&gt;, which are all valid pairs. But if you were to remove the space after it, then you would end up with &lt;code&gt;AM&lt;/code&gt;, which is &lt;em&gt;not&lt;/em&gt; a valid pair.&lt;/p&gt;&#xA;&lt;p&gt;Thing is though, I'm still not entirely certain this string is optimal, which is why I'm asking you to...&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Write a &lt;strong&gt;program/function&lt;/strong&gt; that takes a &lt;strong&gt;list of strings&lt;/strong&gt; of uniform length and outputs the &lt;strong&gt;shortest list of combinations&lt;/strong&gt; that, when combined into a string with some delimiter, contains all the input strings, but no other string of the same length without that delimiter.&lt;/p&gt;&#xA;&lt;h3&gt;Specifications&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods&quot; title=&quot;Default for Code Golf: Input/Output methods&quot;&gt;Standard I/O rules&lt;/a&gt; &lt;strong&gt;apply&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default&quot; title=&quot;Loopholes that are forbidden by default&quot;&gt;Standard loopholes&lt;/a&gt; are &lt;strong&gt;forbidden&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;This challenge is not about finding the shortest approach in all languages, rather, it is about finding the &lt;strong&gt;shortest approach in each language&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Your code will be  &lt;strong&gt;scored in bytes&lt;/strong&gt;, unless otherwise specified.&lt;/li&gt;&#xA;&lt;li&gt;Built-in functions that achieve this (now that's &lt;em&gt;unlikely&lt;/em&gt;) are &lt;strong&gt;allowed&lt;/strong&gt; but including a solution that doesn't rely on a built-in is encouraged.&lt;/li&gt;&#xA;&lt;li&gt;Explanations, even for &amp;quot;practical&amp;quot; languages, are &lt;strong&gt;encouraged&lt;/strong&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;Test cases&lt;/h3&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Yet to come.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/26269&quot;&gt;This challenge was sandboxed.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;Sandbox&lt;/h1&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This title still &lt;em&gt;sucks&lt;/em&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="68615" LastEditorUserId="68615" LastEditDate="2024-02-07T12:05:15.130" LastActivityDate="2024-02-07T12:05:15.130" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26270" PostTypeId="2" ParentId="2140" CreationDate="2024-02-04T00:04:25.927" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/269769/120970&quot;&gt;Solve a logic puzzle by exhaustively applying three rules to rows and columns of a table&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="120970" LastEditorUserId="120970" LastEditDate="2024-02-04T13:57:44.300" LastActivityDate="2024-02-04T13:57:44.300" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26271" PostTypeId="2" ParentId="2140" CreationDate="2024-02-04T20:09:44.290" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/269789/alternating-random-series-sum-to-n&quot;&gt;Alternating Random Series Sum To \$N\$&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="119544" LastEditorUserId="119544" LastEditDate="2024-02-05T01:03:43.750" LastActivityDate="2024-02-05T01:03:43.750" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26272" PostTypeId="2" ParentId="2140" CreationDate="2024-02-05T00:53:41.910" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/269850/78410&quot;&gt;Counting rankings&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2024-02-07T00:09:04.547" LastActivityDate="2024-02-07T00:09:04.547" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26273" PostTypeId="2" ParentId="2140" CreationDate="2024-02-05T16:48:33.600" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/269810/generate-a-sequence-of-n-consecutive-composite-numbers&quot;&gt;Generate a sequence of \$n\$ consecutive composite numbers&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="119544" LastEditorUserId="119544" LastEditDate="2024-02-08T01:48:33.340" LastActivityDate="2024-02-08T01:48:33.340" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26274" PostTypeId="2" ParentId="2140" CreationDate="2024-02-08T01:17:25.963" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/269954/remove-falsy-rows-and-columns&quot;&gt;Remove falsy rows and columns&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2024-02-09T21:46:09.343" LastActivityDate="2024-02-09T21:46:09.343" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26275" PostTypeId="2" ParentId="2140" CreationDate="2024-02-08T03:14:11.287" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/269918/typoglycemia-cna-yuo-raed-tihs&quot;&gt;TYPOGLYCEMIA - Cna Yuo Raed Tihs?&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="119544" LastEditorUserId="119544" LastEditDate="2024-02-08T21:15:49.473" LastActivityDate="2024-02-08T21:15:49.473" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26276" PostTypeId="2" ParentId="2140" CreationDate="2024-02-11T00:10:42.850" Score="0" Body="&lt;h1&gt;NDos' Well-Temperament &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/music&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;music&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;music&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-music-tooltip-container&quot;&gt;music&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;Objective&lt;/h2&gt;&#xA;&lt;p&gt;Given a &lt;strong&gt;positive&lt;/strong&gt; integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, output the ratios in the &lt;strong&gt;NDos' well-temperament&lt;/strong&gt; with &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; notes, as defined below.&lt;/p&gt;&#xA;&lt;h2&gt;NDos' well-temperament&lt;/h2&gt;&#xA;&lt;p&gt;NDos' well-temperament (abbr. &lt;strong&gt;NWT&lt;/strong&gt;) is a musical temperament whose every step is a superparticular ratio. A ratio is &lt;strong&gt;superparticular&lt;/strong&gt; if it equals &lt;span class=&quot;math-container&quot;&gt;\$\frac{n+1}{n}\$&lt;/span&gt; for some positive integer &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;By being octave-periodic, NWT with &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; notes is essentially a multiplicative partition of the rational number &lt;span class=&quot;math-container&quot;&gt;\$2\$&lt;/span&gt; with &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; entries.&lt;/p&gt;&#xA;&lt;p&gt;There is one restriction that ensures NWT to exist uniquely. Amongst such multiplicative partitions, NWT is the partition that comes the &lt;em&gt;last&lt;/em&gt; &lt;strong&gt;co-lexicographically&lt;/strong&gt; (That is, the last ratio must be the biggest as possible, the second-to-last ratio is a tiebreaker, the third-to-last ratio is another tiebreaker, and so on) when the ratios are sorted in &lt;em&gt;descending&lt;/em&gt; order.&lt;/p&gt;&#xA;&lt;h2&gt;I/O format&lt;/h2&gt;&#xA;&lt;p&gt;Flexible. In particular, since the outputted list consists of superparticular ratios, you can output their denominators only, or output their numerators only. Note that, by doing this, NWT becomes the &lt;em&gt;first&lt;/em&gt; partition in co-lexicographic order when the denominators (or the numerators) are sorted in &lt;em&gt;ascending&lt;/em&gt; order.&lt;/p&gt;&#xA;&lt;h2&gt;Notes&lt;/h2&gt;&#xA;&lt;p&gt;Musically, NWT will sound better if its ratios are rearranged in a particular way. This challenge won't ask to rearrange them.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;p&gt;Only denominators are shown for the ratios.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input, Output&#xA;1, [1]&#xA;2, [2,3]&#xA;3, [3,4,5]&#xA;4, [4,5,6,7]&#xA;5, [6,6,7,7,8]&#xA;6, [6,7,8,9,10,11]&#xA;7, [8,9,9,10,10,11,11]&#xA;8, [9,10,10,11,11,12,13,14]&#xA;9, [10,11,12,12,13,13,14,14,15]&#xA;10, [12,12,13,13,14,14,15,15,16,17]&#xA;11, [12,13,14,15,15,16,16,17,17,18,19]&#xA;12, [15,15,16,16,16,17,17,17,18,18,19,19]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Ungolfed solution (Haskell)&lt;/h2&gt;&#xA;&lt;p&gt;This particular implementation is quite slow upon bigger inputs. Haven't analyzed the time complexity exactly, but I doubt this runs in polynomial time.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;import Data.List&#xA;&#xA;colex :: Ord a =&amp;gt; [a] -&amp;gt; [a] -&amp;gt; Ordering&#xA;colex [] [] = EQ&#xA;colex [] _  = LT&#xA;colex _  [] = GT&#xA;colex (x:xs) (y:ys) = colex xs ys &amp;lt;&amp;gt; compare x y&#xA;&#xA;ndosWT :: Int -&amp;gt; [Int]&#xA;ndosWT = go [1] where&#xA;    go :: [Int] -&amp;gt; Int -&amp;gt; [Int]&#xA;    go [] _ = []&#xA;    go [x] 1 = [x]&#xA;    go [x] n = minimumBy colex $ do&#xA;        m &amp;lt;- [2 .. n]&#xA;        let ys = take m [m*x ..]&#xA;        pure (go ys n)&#xA;    go xs@(x:xs1) n = case compare n (length xs) of&#xA;        LT -&amp;gt; []&#xA;        EQ -&amp;gt; xs&#xA;        _  -&amp;gt; minimumBy colex $ do&#xA;            m &amp;lt;- [quot (n + (length xs - 1)) (length xs) .. n - (length xs - 1)]&#xA;            pure (sort (go [x] m ++ go xs1 (n-m)))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Optimized version:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;import Data.List&#xA;import Data.Maybe&#xA;&#xA;colex :: Ord a =&amp;gt; [a] -&amp;gt; [a] -&amp;gt; Ordering&#xA;colex [] [] = EQ&#xA;colex [] _  = LT&#xA;colex _  [] = GT&#xA;colex (x:xs) (y:ys) = colex xs ys &amp;lt;&amp;gt; compare x y&#xA;&#xA;ndosWT :: Int -&amp;gt; [Int]&#xA;ndosWT n = fromJust (go [1] n)&#xA;  where&#xA;    threshold :: Int&#xA;    threshold = 2 * n&#xA;&#xA;    colex_maybe_min :: Ord a =&amp;gt; Maybe [a] -&amp;gt; Maybe [a] -&amp;gt; Maybe [a]&#xA;    colex_maybe_min Nothing mys = mys&#xA;    colex_maybe_min mxs Nothing = mxs&#xA;    colex_maybe_min (Just xs) (Just ys) = if GT == colex xs ys&#xA;        then Just ys&#xA;        else Just xs&#xA;&#xA;    weave :: Ord a =&amp;gt; [a] -&amp;gt; [a] -&amp;gt; [a]&#xA;    weave [] ys = ys&#xA;    weave xs [] = xs&#xA;    weave xs@(x:xs1) ys@(y:ys1) = if x &amp;lt;= y&#xA;        then x : weave xs1 ys&#xA;        else y : weave xs ys1&#xA;&#xA;    go :: [Int] -&amp;gt; Int -&amp;gt; Maybe [Int]&#xA;    go [] _ = Nothing&#xA;    go [x] 1 = if x &amp;lt; threshold&#xA;        then Nothing&#xA;        else Just [x]&#xA;    go [x] n = foldr1 colex_maybe_min $ do&#xA;        m &amp;lt;- [2 .. n]&#xA;        let ys = take m [m*x ..]&#xA;        pure $ if last ys &amp;lt; threshold&#xA;            then go ys n&#xA;            else Nothing&#xA;    go xs@(x:xs1) n = case compare n (length xs) of&#xA;        LT -&amp;gt; Nothing&#xA;        EQ -&amp;gt; Just xs&#xA;        _  -&amp;gt; foldr1 colex_maybe_min $ do&#xA;            m &amp;lt;- [quot (n + (length xs - 1)) (length xs) .. n - (length xs - 1)]&#xA;            pure (fmap (\[xs, ys] -&amp;gt; weave xs ys) (sequence [go [x] m, go xs1 (n-m)]))&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="89459" LastEditorUserId="89459" LastEditDate="2024-02-11T04:11:54.183" LastActivityDate="2024-02-11T04:11:54.183" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26277" PostTypeId="2" ParentId="2140" CreationDate="2024-02-11T22:24:57.190" Score="1" Body="&lt;h1&gt;Is it a coordinate-sum list?&lt;/h1&gt;&#xA;&lt;p&gt;In this challenge, we define a &lt;em&gt;coordinate-sum list&lt;/em&gt; as a ragged list of positive integers where each value is the sum of its 0-indexed-coordinates in the array. For example, the following ragged list is a coordinate-sum list:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[[0, 1],&#xA;  [1, 2, 3],&#xA;  [2]],&#xA; [[1],&#xA;  [2, 3, 4],&#xA;  3]],&#xA; 2]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;In this array, the 4 is the third item of the second item of the second item of the list, or &lt;code&gt;arr[1][1][2]&lt;/code&gt; (0-indexing), which gives it the coordinate &lt;code&gt;[1, 1, 2]&lt;/code&gt;, which sums to 4. Likewise, the 0 is &lt;code&gt;arr[0][0][0]&lt;/code&gt; and has the coordinate &lt;code&gt;[0, 0, 0]&lt;/code&gt; which sums to 0, and this is true for all items in the list.&lt;/p&gt;&#xA;&lt;p&gt;This, however, is &lt;em&gt;not&lt;/em&gt; a coordinate-sum list:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[[0, 1, 2],&#xA; [1, 2, 3, 4],&#xA; [2, 3, 6, 5],&#xA; 3]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Although all the other entries are the sums of their coordinates, the 6 at the third item of the third row has coordinate &lt;code&gt;[2, 2]&lt;/code&gt;, which sums to 4, but its value is 6, so this is not a coordinate-sum list.&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to, given a nonempty ragged list of positive integers containing no empty lists at any level, determine whether it is a coordinate-sum list. You may instead validate the input via 1-indexing (i.e. &lt;code&gt;[[2, 3], [3, 4, 5], 2]&lt;/code&gt; would be valid).&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, shortest wins!&lt;/p&gt;&#xA;&lt;h2&gt;Testcases&lt;/h2&gt;&#xA;&lt;p&gt;All of these use 0-indexing. If your answer uses 1-indexing, add to each value its depth in the list.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Truthy&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[0]&#xA;[0, 1, 2, 3]&#xA;[[0, 1, 2], [1, 2, 3, 4], 2]&#xA;[[[0, 1, 2, 3], [1, 2]], [[1, 2, 3], [2, 3, 4, 5, 6], [3, 4, 5]]]&#xA;[[0, 1, 2, 3, 4, 5, 6, 7], 1, [2, 3, 4, [5, 6, 7], 6], [3, 4, 5, 6]]&#xA;[[[[0, 1], [1, 2], 2], [[1, 2, 3], [2, 3]]], [[[1, 2], [2, 3, 4]], [[2, 3], [3, 4, 5, 6, 7]]], [2, 3]]&#xA;[[[[[0, 1, 2], [1, 2, 3], [2, 3, 4], [3, 4, 5]], [[1, 2, 3], [2, 3, 4], [3, 4, 5], [4, 5, 6]], [[2, 3, 4], [3, 4, 5], [4, 5, 6], [5, 6, 7]]], [[[1, 2, 3], [2, 3, 4], [3, 4, 5], [4, 5, 6]], [[2, 3, 4], [3, 4, 5], [4, 5, 6], [5, 6, 7]], [[3, 4, 5], [4, 5, 6], [5, 6, 7], [6, 7, 8]]], [[[2, 3, 4], [3, 4, 5], [4, 5, 6], [5, 6, 7]], [[3, 4, 5], [4, 5, 6], [5, 6, 7], [6, 7, 8]], [[4, 5, 6], [5, 6, 7], [6, 7, 8], [7, 8, 9]]], [[[3, 4, 5], [4, 5, 6], [5, 6, 7], [6, 7, 8]], [[4, 5, 6], [5, 6, 7], [6, 7, 8], [7, 8, 9]], [[5, 6, 7], [6, 7, 8], [7, 8, 9], [8, 9, 10]]], [[[4, 5, 6], [5, 6, 7], [6, 7, 8], [7, 8, 9]], [[5, 6, 7], [6, 7, 8], [7, 8, 9], [8, 9, 10]], [[6, 7, 8], [7, 8, 9], [8, 9, 10], [9, 10, 11]]]]]&#xA;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Falsy&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;[2]&#xA;[[1, 2], [2, 3, 4]]&#xA;[[0, 1], [2, 3]]&#xA;[[[1, 2, 3], 4, [3, 4, 5]], [[2, 3, 4], [3, 4, 5], [4, 5, 6]], [[3, 4, 5], [4, 5, 6], [5, 6, 7, 8], [6, [7, 8], 8]]]&#xA;[4, 3, 2, 1, 0]&#xA;[[4, 3, 2], [3, 2, 1], [2, 1, 0]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2024-02-15T22:09:10.260" LastActivityDate="2024-02-15T22:09:10.260" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26278" PostTypeId="2" ParentId="2140" CreationDate="2024-02-12T02:01:42.387" Score="0" Body="&lt;p&gt;There are way too few proof golf challenges for my taste, so I'd like to introduce a permanent one.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is it too long or complicated?&lt;/li&gt;&#xA;&lt;li&gt;My data is a work in progress, so there is still time before this challenge could potentially be ready.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h1&gt;The hardest logic puzzle game: Help me reduce my oversized proofs!&lt;/h1&gt;&#xA;&lt;p&gt;I put a lot of work into finding small proofs that elevate smallest-known single axioms to more practical (and popular) proof systems. Some are still large, can you find better proofs based on my data?&lt;/p&gt;&#xA;&lt;p&gt;This &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/proof-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;proof-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;proof-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-proof-golf-tooltip-container&quot;&gt;proof-golf&lt;/a&gt; challenge is all about finding some shorter proof(s) based on existing ones. The problems are similar to &lt;a href=&quot;https://codegolf.stackexchange.com/q/161172&quot;&gt;[CG question: (A → B) → (¬B → ¬A)]&lt;/a&gt;, but based on different &lt;a href=&quot;https://en.wikipedia.org/wiki/Hilbert_system&quot; rel=&quot;nofollow noreferrer&quot;&gt;Hilbert systems&lt;/a&gt;, and vary in how to display and measure proofs.&lt;sup&gt;✻&lt;/sup&gt; It also leaves much more choice on what to solve to the contestant. All parts are interconnected and might lead to improve each other. Choosing wisely which of the given pieces to tackle is part of the challenge!&lt;/p&gt;&#xA;&lt;p&gt;For the sake of this logic challenge, the length of &lt;a href=&quot;https://en.wikipedia.org/wiki/Condensed_detachment&quot; rel=&quot;nofollow noreferrer&quot;&gt;condensed detachment&lt;/a&gt; proofs in a certain prefix notation (so-called &lt;em&gt;D-proofs&lt;/em&gt;) serves to measure the quality of solutions. The shorter the better!&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;✻&lt;/sup&gt;&lt;sub&gt;Note that we use the same metric to measure proofs as in the reference of the &lt;a href=&quot;https://codegolf.stackexchange.com/a/170881&quot;&gt;best answer&lt;/a&gt; to the aforementioned question, in contrast to the amount of formulas that occur in a proof. So looking for multiple occurrences of a formula in the same proof and reducing by referencing only one of them is intentionally not a part of this.&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Tournament Rules&lt;/h2&gt;&#xA;&lt;p&gt;&lt;sup&gt;All of the following rules are subject to be refined based on experience gained over time.&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;h5&gt;Rewards&lt;/h5&gt;&#xA;&lt;p&gt;This is an &lt;em&gt;infinite&lt;/em&gt; challenge (up until I die and nobody maintains it anymore or I edit the question accordingly – planned: never). I will reward all my reputation points gathered here, down to 101, to best answers, provided they improve by at least 50 steps in total (for 50 points) w.r.t. to the previously given best answer (or my data if there is none), with points up to the number of improved steps (but capped at the maximum bounty of 500 points per solution).&#xA;Once an improvement is confirmed, I will start the according bounty and award it as soon as possible.&lt;br /&gt;&#xA;Since I consider this question to be very challenging, I do not expect there to be many best answers in small time frames, but if that happens, I'll schedule the bounties according to timestamps of answers, and put in up to whichever spare reputation points are available when starting the bounty.&lt;br /&gt;&#xA;(If I do not react in reasonable time due to being absent here, you may comment in the &lt;a href=&quot;https://github.com/xamidi/pmGenerator/discussions&quot; rel=&quot;nofollow noreferrer&quot;&gt;discussions forum&lt;/a&gt; related to my project that this question arose from. This will drop me an email.)&lt;/p&gt;&#xA;&lt;p&gt;There are no plans of using the &lt;em&gt;accepted answer&lt;/em&gt; feature. This is in order to not give newcomers the false impression that this challenge has somehow already been ”solved”.&lt;br /&gt;&#xA;I consider each improvement quite the accomplishment, so I will of course upvote each improving answer, as soon as I found and verified it.&lt;/p&gt;&#xA;&lt;p&gt;If this endless riddle fascinates you as well and you have spare reputation points (unlike me, at the time of writing this), feel free to contact me and/or edit this section on how you would like to contribute to these rewards.&lt;/p&gt;&#xA;&lt;p&gt;Regardless, I would very much apprechiate if you could upvote this question so that I am able to reward deserving participants.&lt;/p&gt;&#xA;&lt;h5&gt;Challenge&lt;/h5&gt;&#xA;&lt;p&gt;There are seven theorems to prove in seven similar proof systems. The challenge is to minimize the proofs as much as possible. You may pick any number of theorems to prove in any of these systems, so there can be at most 49 evaluated proofs per solution.&lt;br /&gt;&#xA;Each combination varies in difficulty, and I will state a subjectively perceived difficulty (range 1 to 10) for each system. In the hardest system (called w2), three proofs are still missing (i.e. finding a proof is worth infinitely many steps regardless of its length&lt;sup&gt;✻&lt;/sup&gt;). I initially provide D-proofs for all other combinations.&lt;sup&gt;❈&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;Some proofs are so long that surely there must be shorter ones, but several are already minimal or likely close to minimal, which can be seen by the number of steps covered by an exhaustive search, which I will also provide.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;✻&lt;/sup&gt;&lt;sub&gt;To avoid infinite scoring loopholes, I may treat all subproofs of intermediate theorems to be at most as long as previously shortest-known such proofs.&lt;/sub&gt;&lt;br /&gt;&#xA;&lt;sup&gt;❈&lt;/sup&gt;&lt;sub&gt;These proofs and my data are to be used as valuable hints. Starting from scratch would be way too hard, encourage terrible solutions, and break the unlimited scoring system.&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;h5&gt;Scoring&lt;/h5&gt;&#xA;&lt;p&gt;The score is the number of improved steps. As such it is always relative to the last best solution (which initially I provide). There are no negative scores: If you state a proof longer than a previously known proof, it will be worth 0 points.&lt;/p&gt;&#xA;&lt;p&gt;For example, say there are two challengers A and B starting based on my data. Now challenger A improves proofs X and Y by 42 and 120 steps, respectively, and challenger B afterwards improves proofs Y and Z (≠ X) by 52 and 330 steps, respectively.&#xA;Then first A receives a reward of up to 150 reputation points (which is the closest multiple of 50 that is at most 162 = 42 + 120). B improved by 340 = 10 + 330 = (52 - 42) + 330 steps relative to the previously shortest-known proofs, thus receives a reward of up to 300 points.&#xA;Further assume that I only have 301 (thus 200 spare) reputation points when rewarding A, then A receives the full 150 points, leaving me at only 50 (above 101) left. Afterwards, B receives those 50 points together with those which I acquired in the meantime (multiples of 50, still capped at 300).&lt;/p&gt;&#xA;&lt;p&gt;Note that there are not only timestamps but also increasing answer IDs to determine sequence of answers, so there can never be a tie in which answer came first. The answer ID acts as a tiebreaker for edits (which could potentially occur in the same second).&lt;/p&gt;&#xA;&lt;h5&gt;Answers&lt;/h5&gt;&#xA;&lt;p&gt;Answers should somehow provide an abstract representation similar to the one I provide, unless a D-proof is short enough to be stated in full (at most a few thousand characters), in which case it can be stated concretely.&lt;sup&gt;✻&lt;/sup&gt; Of course, you can additionally provide the proof in whichever representation you like, e.g. with all used logical formulas, in infix notation, etc.&#xA;An explanation on how you succeeded and where you failed would be nice, but is not required.&lt;/p&gt;&#xA;&lt;p&gt;Only one (the first) answer per user is taken into account, but a proof-shortening edit is treated and scored like a new contribution at the time of editing. When there are multiple edits with multiple improvements, only the last edit is rewarded.&lt;sup&gt;❈&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;Improvements can be summarized in the title like “(&amp;lt;system&amp;gt;:&amp;lt;theorem&amp;gt;:&amp;lt;steps before&amp;gt;-&amp;gt;&amp;lt;steps after&amp;gt;, ...)”, e.g. “(w2:A3:9001-&amp;gt;1337, w4:id:465-&amp;gt;379)”. However, the scoring will follow a procedure independent from such statements, and I might comment and/or request to edit relevant scoring information.&lt;/p&gt;&#xA;&lt;p&gt;In case you would like to be mentioned by name (or pseudonym) for your contribution in my &lt;a href=&quot;https://github.com/xamidi/pmGenerator&quot; rel=&quot;nofollow noreferrer&quot;&gt;corresponding project&lt;/a&gt; and potential publications, please state so in your answer or via &lt;a href=&quot;https://github.com/xamidi/pmGenerator/discussions&quot; rel=&quot;nofollow noreferrer&quot;&gt;forum or email&lt;/a&gt;, and how. By default, I will use your username on Code Golf Stack Exchange.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;✻&lt;/sup&gt;&lt;sub&gt;You may even do some conventional code golfing to print your solution with as little code as possible. This may grant you upvotes, but no extra tournament points.&lt;/sub&gt;&lt;br /&gt;&#xA;&lt;sup&gt;❈&lt;/sup&gt;&lt;sub&gt;But in case your answer has already been rewarded and you find a further improvement, you can edit your answer and receive another reward – after dropping me a message so that I notice your edit. If there was no message and another answer received the corresponding reward due to your edit being unnoticed, your reward is lost (to another person).&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;h5&gt;Winning&lt;/h5&gt;&#xA;&lt;p&gt;Apart from the relative score, I'd like to treat this like a global game for which one can lead a “highscore” (but with lower numbers being better).&#xA;Starting with three proofs unknown, the initial value is &lt;code&gt;3ω+c&lt;/code&gt;, where &lt;code&gt;c&lt;/code&gt; is the sum of steps of smallest-known proofs, one for each solved target theorem.&#xA;The game becomes even harder once it progresses, but latest successes automatically grant a top ranking. For that, I'll maintain a table below.&lt;/p&gt;&#xA;&lt;p&gt;I have hopes that it will someday reach a finite amount close to several thousand steps. It seems plausible that this is possible when looking at high exponential growths in the amounts of theorems when doing exhaustive generations. Quantum computers might help a lot in the forseeable future.&lt;/p&gt;&#xA;&lt;p&gt;One could say that somebody won this competition, when no other individual is able to find any shorter proofs anymore. But due to the complexity of the problem, this might as well take billions of years.&#xA;I would guess that there are some alien races doing the same thing: After all, this concerns a few very special systems – all minimal 1-bases for {→,¬}‑propositional calculus.&lt;/p&gt;&#xA;&lt;h2&gt;Hall of Fame&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: left;&quot;&gt;Competitor&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;Total Steps&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;Date&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: left;&quot;&gt;Recent Improvements&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1.&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;a href=&quot;https://github.com/xamidi&quot; rel=&quot;nofollow noreferrer&quot;&gt;xamidi&lt;/a&gt; (&lt;a href=&quot;https://codegolf.stackexchange.com/u/114913&quot;&gt;profile&lt;/a&gt;)&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;3ω+20869754&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;Feb 03, 2024&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;initial proofs&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&lt;/div&gt;&#xA;&lt;p&gt;Consecutive entries of the same user will be combined. Please let me know what you wish to be called or whether to link to a different site than only your Code Golf user profile.&lt;/p&gt;&#xA;&lt;h2&gt;Proof Systems&lt;/h2&gt;&#xA;&lt;p&gt;We are exploring the seven minimal 1-bases for classical propositional logic that use operators → (read: “implies”) and ¬ (read: “not”) with &lt;a href=&quot;https://en.wikipedia.org/wiki/Modus_ponens&quot; rel=&quot;nofollow noreferrer&quot;&gt;modus ponens&lt;/a&gt; (⊢ψ,⊢ψ→φ ⇒ ⊢φ, sometimes called “detachment”)&lt;sup&gt;✻&lt;/sup&gt; as a rule of inference.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;✻&lt;/sup&gt;&lt;sub&gt;This rule can be read as “if (the proposition) ψ is provable and (the proposition) ψ→φ is provable, then thereby (the proposition) φ is provable”.&#xA;An operator '⊢' for ”is provable” is not part of the propositional language. Propositions merely argue about truth, using '→', '¬', and other propositions.&#xA;For example, the formula ψ→φ can be read as ”if (the proposition) ψ is true, then (the proposition) φ is true”. Suppose ψ→φ is true. When also ”(the proposition) ψ is true”, it follows via modus ponens that ”(the proposition) φ is true”. This kind of argument is the only one allowed in our proofs. Variables (such as ψ and φ) can be &lt;em&gt;instantiated&lt;/em&gt; with arbitrary propositions (i.e. formulas in our propositional language).&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;h5&gt;Axioms&lt;/h5&gt;&#xA;&lt;p&gt;The axioms of our systems are &lt;a href=&quot;https://us.metamath.org/mpeuni/meredith.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;Meredith's axiom&lt;/a&gt; and &lt;a href=&quot;http://fitelson.org/walsh.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;Walsh's six axioms&lt;/a&gt;. These can be stated in our propositional language as follows.&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th style=&quot;text-align: left;&quot;&gt;&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: left;&quot;&gt;Infix notation&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: left;&quot;&gt;Polish notation&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;a href=&quot;https://xamidi.github.io/pmGenerator/svg/meredith.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;m&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;a href=&quot;https://truth-table.com/#((((a%E2%86%92b)%E2%86%92(%C2%ACc%E2%86%92%C2%ACd))%E2%86%92c)%E2%86%92e)%E2%86%92((e%E2%86%92a)%E2%86%92(d%E2%86%92a))&quot; rel=&quot;nofollow noreferrer&quot;&gt;((((ψ→φ)→(¬χ→¬ξ))→χ)→τ)→((τ→ψ)→(ξ→ψ))&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;CCCCCpqCNrNsrtCCtpCsp&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;a href=&quot;https://xamidi.github.io/pmGenerator/svg/walsh1st.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;w1&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;a href=&quot;https://truth-table.com/#(a%E2%86%92((%C2%ACa%E2%86%92b)%E2%86%92c))%E2%86%92(d%E2%86%92((%C2%ACe%E2%86%92(c%E2%86%92e))%E2%86%92(a%E2%86%92e)))&quot; rel=&quot;nofollow noreferrer&quot;&gt;(ψ→((¬ψ→φ)→χ))→(ξ→((¬τ→(χ→τ))→(ψ→τ)))&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;CCpCCNpqrCsCCNtCrtCpt&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;a href=&quot;https://xamidi.github.io/pmGenerator/svg/walsh2nd.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;w2&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;a href=&quot;https://truth-table.com/#a%E2%86%92((b%E2%86%92(a%E2%86%92c))%E2%86%92((%C2%ACc%E2%86%92((%C2%ACd%E2%86%92e)%E2%86%92b))%E2%86%92(d%E2%86%92c)))&quot; rel=&quot;nofollow noreferrer&quot;&gt;ψ→((φ→(ψ→χ))→((¬χ→((¬ξ→τ)→φ))→(ξ→χ)))&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;CpCCqCprCCNrCCNstqCsr&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;a href=&quot;https://xamidi.github.io/pmGenerator/svg/walsh3rd.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;w3&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;a href=&quot;https://truth-table.com/#a%E2%86%92((%C2%ACb%E2%86%92((%C2%ACc%E2%86%92d)%E2%86%92(a%E2%86%92e)))%E2%86%92((e%E2%86%92b)%E2%86%92(c%E2%86%92b)))&quot; rel=&quot;nofollow noreferrer&quot;&gt;ψ→((¬φ→((¬χ→ξ)→(ψ→τ)))→((τ→φ)→(χ→φ)))&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;CpCCNqCCNrsCptCCtqCrq&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;a href=&quot;https://xamidi.github.io/pmGenerator/svg/walsh4th.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;w4&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;a href=&quot;https://truth-table.com/#a%E2%86%92((%C2%ACb%E2%86%92((%C2%ACc%E2%86%92d)%E2%86%92(e%E2%86%92b)))%E2%86%92((c%E2%86%92e)%E2%86%92(c%E2%86%92b)))&quot; rel=&quot;nofollow noreferrer&quot;&gt;ψ→((¬φ→((¬χ→ξ)→(τ→φ)))→((χ→τ)→(χ→φ)))&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;CpCCNqCCNrsCtqCCrtCrq&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;a href=&quot;https://xamidi.github.io/pmGenerator/svg/walsh5th.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;w5&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;a href=&quot;https://truth-table.com/#(a%E2%86%92b)%E2%86%92(((c%E2%86%92(d%E2%86%92e))%E2%86%92(b%E2%86%92(%C2%ACd%E2%86%92%C2%ACa)))%E2%86%92(a%E2%86%92d))&quot; rel=&quot;nofollow noreferrer&quot;&gt;(ψ→φ)→(((χ→(ξ→τ))→(φ→(¬ξ→¬ψ)))→(ψ→ξ))&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;CCpqCCCrCstCqCNsNpCps&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;a href=&quot;https://xamidi.github.io/pmGenerator/svg/walsh6th.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;w6&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;a href=&quot;https://truth-table.com/#((a%E2%86%92b)%E2%86%92(((%C2%ACc%E2%86%92%C2%ACd)%E2%86%92c)%E2%86%92e))%E2%86%92((e%E2%86%92a)%E2%86%92(d%E2%86%92a))&quot; rel=&quot;nofollow noreferrer&quot;&gt;((ψ→φ)→(((¬χ→¬ξ)→χ)→τ))→((τ→ψ)→(ξ→ψ))&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;CCCpqCCCNrNsrtCCtpCsp&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&lt;/div&gt;&#xA;&lt;p&gt;Different axioms are not allowed to be combined with each other. Indeed, each of these formulas is capable of deducing all theorems of propositional logic using only modus ponens as a rule of inference.&lt;/p&gt;&#xA;&lt;p&gt;In order to save space, I will use standard Polish notation, a most concise (and well-googleable) prefix notation with (→,¬)=(&lt;code&gt;C&lt;/code&gt;,&lt;code&gt;N&lt;/code&gt;) for up to 26 different variables &lt;code&gt;p&lt;/code&gt;,&lt;code&gt;q&lt;/code&gt;,...,&lt;code&gt;z&lt;/code&gt;,&lt;code&gt;a&lt;/code&gt;,...,&lt;code&gt;o&lt;/code&gt;, to state conclusions in proof summaries.&#xA;You may use whichever well-defined formula representation suits you. Actually, a formula is simply a tree structure – follow the links in the leftmost column for graphical representations.&#xA;A general way (which works for more than 26 different variables) to concisely state formulas is to use numbers as variables and separate them via &lt;code&gt;.&lt;/code&gt;, e.g. &lt;code&gt;CCCCC0.1CN2N3.2.4CC4.0C3.0&lt;/code&gt; for Meredith's axiom.&lt;/p&gt;&#xA;&lt;h2&gt;Target Theorems&lt;/h2&gt;&#xA;&lt;p&gt;The target theorems are themselves axioms of &lt;a href=&quot;https://www.jstage.jst.go.jp/article/pjab1945/41/6/41_6_436/_pdf&quot; rel=&quot;nofollow noreferrer&quot; title=&quot; Yasuyuki Imai, Kiyoshi Iséki: On axiom systems of propositional calculi, I (1965)&quot;&gt;popular proof systems&lt;/a&gt;, such as {A1,A2,A3} (“Łukasiewicz (L_3)-system”) and {L1,L2,L3} (“Łukasiewicz (L_1)-system”). Propositional axioms of Metamath's main proof database set&lt;b&gt;.&lt;/b&gt;mm &lt;a href=&quot;https://us.metamath.org/mpeuni/mmset.html#scaxioms&quot; rel=&quot;nofollow noreferrer&quot;&gt;are also A1-A3&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th style=&quot;text-align: left;&quot;&gt;&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: left;&quot;&gt;Infix notation&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: left;&quot;&gt;Polish notation&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;a href=&quot;https://xamidi.github.io/pmGenerator/svg/frege-1.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;A1&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;ψ→(φ→ψ)&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;CpCqp&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;a href=&quot;https://xamidi.github.io/pmGenerator/svg/frege-2.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;A2&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;(ψ→(φ→χ))→((ψ→φ)→(ψ→χ))&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;CCpCqrCCpqCpr&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;a href=&quot;https://xamidi.github.io/pmGenerator/svg/lukasiewicz-3.svg&quot; rel=&quot;nofollow noreferrer&quot;&gt;A3&lt;/a&gt;&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;(¬ψ→¬φ)→(φ→ψ)&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;CCNpNqCqp&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;id&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;ψ→ψ&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;Cpp&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;L1&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;(ψ→φ)→((φ→χ)→(ψ→χ))&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;CCpqCCqrCpr&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;L2&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;(¬ψ→ψ)→ψ&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;CCNppp&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;L3&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;ψ→(¬ψ→φ)&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;&lt;code&gt;CpCNpq&lt;/code&gt;&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&lt;/div&gt;&#xA;&lt;p&gt;Proving all axioms of a different proof system that is known to be &lt;a href=&quot;https://en.wikipedia.org/wiki/Completeness_(logic)&quot; rel=&quot;nofollow noreferrer&quot;&gt;complete&lt;/a&gt; (such as A1-A3 and L1-L3 both are under modus ponens) proves that the original system is complete by itself. There are also non-constructive ways to prove this, which is how we know that w2 is complete under modus ponens, despite such proofs still being unknown.&lt;sup&gt;✻&lt;/sup&gt; The length of such proofs could help in finding proof theoretic bounds, which are still a big mystery in the field of &lt;a href=&quot;https://en.wikipedia.org/wiki/Proof_complexity&quot; rel=&quot;nofollow noreferrer&quot;&gt;proof complexity&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;sup&gt;✻&lt;/sup&gt;&lt;sub&gt;The authors of &lt;a href=&quot;http://fitelson.org/walsh.pdf&quot; rel=&quot;nofollow noreferrer&quot;&gt;Walsh's paper&lt;/a&gt; called the task to find D-proofs from w2 to another system an “open challenge problem for automated reasoning”. Based on my data, it only remains to find a D-proof for L1. This is, however, by far the hardest optional part in this callenge, and I sure do not recommend it to anyone who does not wish to put an outstanding amount of effort into this.&lt;/sub&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Proof Notation&lt;/h2&gt;&#xA;&lt;p&gt;The operator for condensed detachment is the so-called &lt;code&gt;D&lt;/code&gt;-rule, which takes two formulas as arguments, on which it applies &lt;a href=&quot;https://en.wikipedia.org/wiki/Unification_(computer_science)&quot; rel=&quot;nofollow noreferrer&quot;&gt;tree unification&lt;/a&gt; to form the &lt;em&gt;most general unifiers&lt;/em&gt; of ψ→φ and ψ, respectively, then applies modus ponens, which results in φ. Axioms in D-proofs are referred to by &lt;code&gt;1&lt;/code&gt;,&lt;code&gt;2&lt;/code&gt;,…,&lt;code&gt;9&lt;/code&gt;,&lt;code&gt;a&lt;/code&gt;,&lt;code&gt;b&lt;/code&gt;,…,&lt;code&gt;z&lt;/code&gt; in their given order.&lt;/p&gt;&#xA;&lt;p&gt;This way, given a sequence of axioms, a proof can be defined by a single prefix formula, e.g. &lt;code&gt;DD211&lt;/code&gt;, which is evaluated like &lt;code&gt;D(D(2,1),1)&lt;/code&gt;, i.e. &lt;code&gt;D&lt;/code&gt; is a 2-ary (partially defined) operator over the language of logical formulas.&lt;br /&gt;&#xA;The &lt;code&gt;D&lt;/code&gt;-rule is only partially defined because unifiers to apply modus ponens on certain formulas may not exist.&lt;/p&gt;&#xA;&lt;h5&gt;Example&lt;/h5&gt;&#xA;&lt;p&gt;Let's determine &lt;code&gt;DD211&lt;/code&gt; for axioms (&lt;code&gt;1&lt;/code&gt;,&lt;code&gt;2&lt;/code&gt;):=(A1,A2). At first &lt;code&gt;D21&lt;/code&gt; entails that ψ→φ and ψ are instances of A2 and A1, respectively. Most general such &lt;a href=&quot;https://en.wikipedia.org/wiki/Unification_(computer_science)&quot; rel=&quot;nofollow noreferrer&quot;&gt;unifiers&lt;/a&gt; are the instances (χ→(ξ→χ))→((χ→ξ)→(χ→χ)) and χ→(ξ→χ) of A2 and A1, which implies ψ := χ→(ξ→χ) and φ := (χ→ξ)→(χ→χ).&#xA;Therefore, (χ→ξ)→(χ→χ) (i.e. &lt;code&gt;CCpqCpp&lt;/code&gt; in Polish notation) is an intermediate theorem in &lt;code&gt;DD211&lt;/code&gt; = &lt;code&gt;D(CCpqCpp)1&lt;/code&gt;. This entails that now ψ→φ and ψ are instances of (χ→ξ)→(χ→χ) and A1, respectively. Most general such unifiers are (χ→(τ→χ))→(χ→χ) and χ→(τ→χ), thus ψ := χ→(τ→χ) and φ := χ→χ.&#xA;Therefore, &lt;code&gt;DD211&lt;/code&gt; proves the theorem χ→χ (i.e. &lt;code&gt;Cpp&lt;/code&gt; in Polish notation). Combined, the D-proof &lt;code&gt;DD211&lt;/code&gt; w.r.t. (A1,A2) actually means:&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: left;&quot;&gt;Proposition&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: left;&quot;&gt;Reason&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1.&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;ψ→(φ→ψ)&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;(A1)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;2.&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;ψ→((φ→ψ)→ψ)&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;(A1)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;3.&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;(ψ→((φ→ψ)→ψ))→((ψ→(φ→ψ))→(ψ→ψ))&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;(A2)&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;4.&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;(ψ→(φ→ψ))→(ψ→ψ)&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;(MP):2,3&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;5.&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;ψ→ψ&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;(MP):1,4&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&lt;/div&gt;&#xA;&lt;p&gt;Alternatively, using Polish notation:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;CpCqp&lt;/code&gt; (&lt;code&gt;1&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;CpCCqpp&lt;/code&gt; (&lt;code&gt;1&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;CCpCCqppCCpCqpCpp&lt;/code&gt; (&lt;code&gt;2&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;CCpCqpCpp&lt;/code&gt; (&lt;code&gt;D&lt;/code&gt;):2,3&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;Cpp&lt;/code&gt; (&lt;code&gt;D&lt;/code&gt;):1,4&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;There are no such small examples in our single axiom systems, for example &lt;code&gt;D11&lt;/code&gt; in Meredith's system is already&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;&lt;code&gt;CCCCCqsCNCNpNtNrCNpNtpCCpqCrq&lt;/code&gt; (&lt;code&gt;1&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;CCCCCCqsCNCNpNtNrCNpNtpCCpqCrqCCCCpqCrqCqsCtCqs&lt;/code&gt; (&lt;code&gt;1&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;CCCCpqCrqCqsCtCqs&lt;/code&gt; (&lt;code&gt;D&lt;/code&gt;):1,2&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;and formulas tend to blow up in size for longer proofs.&lt;br /&gt;&#xA;This illustrates that using formula-based proofs is extremely inefficient, whereas D-proofs are much lighter and can be processed by machines more efficiently.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge Proofs&lt;/h2&gt;&#xA;&lt;p&gt;&lt;sup&gt;I will try to keep this information up to date.&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;p&gt;The smallest-known D-proofs of target theorems have the following amounts of steps.&lt;/p&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th style=&quot;text-align: left;&quot;&gt;&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;exhausted&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;A1&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;A2&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;A3&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;id&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;L1&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;L2&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;L3&lt;/th&gt;&#xA;&lt;th style=&quot;text-align: right;&quot;&gt;overall difficulty&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;m&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;83 (+2)&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;13&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;7001&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;175&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;19&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;619&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;163&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;41&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;not easy - 5/10&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;w1&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;161 (+2)&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;33&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1927&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;363&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;143&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;151&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;323&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;87&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;not easy - 5/10&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;w2&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;43 (+2)&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;53&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;-&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;-&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;35&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;-&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;781&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;57&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;horrible - 10/10&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;w3&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;73 (+2)&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;67&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;18391835&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1193987&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;135&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1196969&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;6541&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;127&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;very hard - 8/10&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;w4&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;169 (+2)&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;59&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;16277&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;12959&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;465&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;14261&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;1889&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;53&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;bulky - 6/10&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;w5&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;55 (+2)&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;83&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;157&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;95&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;65&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;15&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;107&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;51&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;convenient - 3/10&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td style=&quot;text-align: left;&quot;&gt;w6&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;95 (+2)&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;19&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;18339&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;297&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;13&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;2743&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;125&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;37&lt;/td&gt;&#xA;&lt;td style=&quot;text-align: right;&quot;&gt;not too bad - 4/10&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&lt;/div&gt;&#xA;&lt;p&gt;For example, to the best of my knowledge I searched Meredith's system exhaustively for D-proofs of up to 83 steps. Since all its D-proofs have an odd length, all its smallest-known D-proofs with up to 85 steps are thereby minimal and cannot be reduced further. That is, if my search was actually exhaustive.&lt;/p&gt;&#xA;&lt;p&gt;My (subjective) overall difficulty rating accounts for how hard I find searching and handling proofs, not for the apparent complexity of a system (which is indicated by “exhausted” – the higher the longer proofs are on average).&#xA;The issue with a lower difficulty rating is that the given proofs might be so short already that it is very hard to find a smaller one (if it even exists).&#xA;On the other hand, more difficult systems potentially give higher rewards.&lt;/p&gt;&#xA;&lt;p&gt;Compact representations of these proofs are given below. Unfolding some of them results in exponential blowup, which explains the high number of steps asserted for concrete D-proofs.&#xA;Index numbers of target theorems are highlighted as &lt;strong&gt;bold&lt;/strong&gt;. More detailed and commented variants representing the same D-proofs are linked over the system names right to the bullet points (and as “[sample]” in my project's &lt;a href=&quot;https://xamidi.github.io/pmGenerator/README.html#custom-proof-systems&quot; rel=&quot;nofollow noreferrer&quot;&gt;readme&lt;/a&gt;).&lt;/p&gt;&#xA;&lt;h5&gt;Puzzle Board (Abstract Representation)&lt;/h5&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://xamidi.github.io/pmGenerator/data/m.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;m&lt;/a&gt;:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;    CCCCCpqCNrNsrtCCtpCsp = 1&#xA;[0] CCCppqCrq = D1D1D11&#xA;[&lt;b&gt;1&lt;/b&gt;] CpCqp = DDD11[0]1&#xA;[2] CCCpqrCqr = D1D1D[0][0]&#xA;[&lt;b&gt;3&lt;/b&gt;] Cpp = DDD[0][0]11&#xA;[&lt;b&gt;4&lt;/b&gt;] CpCNpq = DD1[2][2]&#xA;[5] CCCpNCCCqrCNNqrNstCst = D1D1D[0]D1DD11DDDD1D1DD1DD11[0]111D1DD1D1D[1]D1D111&#xA;[6] CCpCpqCrCpq = DDD1D1D1D[0][5]11&#xA;[7] CCCpCqNCCrCNNssNqtCut = D1D1DD1DD1DDD1D1D[2]1D111D1D1D[0]D1DD11DDDD1D1DD1DD11[0]111D1DD1DD1D1D[0]1[1]D11DD1D11D11&#xA;[&lt;b&gt;8&lt;/b&gt;] CCNppp = DD[6]DDD1D1DD1D1D[1]D1D11D[2]D[2]1111&#xA;[&lt;b&gt;9&lt;/b&gt;] CCNpNqCqp = DDDDD1D1DD[2]1D[2]D[5]D1D1111DD1D1DD1D1D[2]1D11[1]1&#xA;[&lt;b&gt;10&lt;/b&gt;] CCpqCCqrCpr = DD1DD1DDD[6][6]1[7]D1DDD[6][6]1[7]1&#xA;[11] CCpqCCrpCrq = DD[10]DD1DD1[7]1DD[6][6]1D[10][10]&#xA;[&lt;b&gt;12&lt;/b&gt;] CCpCqrCCpqCpr = DD[11]D[10][10]DD[10][10]D[11]DD[6][6]1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://xamidi.github.io/pmGenerator/data/w1.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;w1&lt;/a&gt;:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;    CCpCCNpqrCsCCNtCrtCpt = 1&#xA;[0] CCNpCCqrpCrp = DD1D1D111&#xA;[1] CCCCpCCNpqrstCst = D[0]D1D11&#xA;[2] CCCpqrCqr = D[0]D1D1D11&#xA;[3] CpCCNqCrqCrq = D1D[2]D[0]D11&#xA;[4] CpCCNqCCNrsqCrq = D1DDDD[2]111D1D1D11&#xA;[&lt;b&gt;5&lt;/b&gt;] CpCqp = D[2][1]&#xA;[&lt;b&gt;6&lt;/b&gt;] CpCNpq = DD[0][4]D[0][3]&#xA;[7] CCCCNNpCpNpqrCpr = D[0]D1D[1]D[1]DD[0]D11DD[0]D11[2]&#xA;[8] CCNpCqpCrCCNsCpsCqs = DD[0]DD[2]1DDD1DDD[1]1D1111D1DDD[1]1D111D[2]1&#xA;[&lt;b&gt;9&lt;/b&gt;] Cpp = DD[4]1D[7][2]&#xA;[&lt;b&gt;10&lt;/b&gt;] CCpqCCqrCpr = D[2]DD[0]D1[8][2]&#xA;[11] CCCCpqCrqsCCrps = D[0]DD[2]1DD[0]D1DDD[1]1D1D1D111[10]&#xA;[12] CCCCNpCqpprCqr = D[0]D1DD[0]D1D[1]D[1]1DD[0]D11D[0]DD[1]D[1]1D[7]D[0]DD[2]1[5]&#xA;[&lt;b&gt;13&lt;/b&gt;] CCNppp = D[0]D[12]D[0][3]&#xA;[&lt;b&gt;14&lt;/b&gt;] CCNpNqCqp = DD[2]DD1DD[0]D1D[2][8]D[0]DD[2]D[1]D[2]1D[7][2]1D[4]1&#xA;[&lt;b&gt;15&lt;/b&gt;] CCpCqrCCpqCpr = DD[11]D[0]D1DD[0]D1D[1]D[2]1DD[0]DD[2]1DD[0]D1DDD[1]1D111[2]DD[0]D11D[0]DD[1]D[2]1D[7]D[0]DD[2]1[5]D[11]DDD[3]1DD[0]DDD1D111DD[0]D1DDDD[1]D[2]1D[1]D[2]DD[0]D11[6]1D1DDD[1]1D1D1D111D[2]D[2]DD[0][4]1D[12][2]DD[0]DDD1D111DD[0]DD[2]1D[0]D1DD[0]D1D[1]D[2]1DDDD[2]1D[0]DD[2]1DD[3]1DD[0][4]D[0]D1DDD[1]1D1111D11DD[0][4]1D[1]D[1]DD[0]D1DD[0]DD[1]1DD[0]D1DD[0]D1DDD[1]1D1111[2]1[2]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://xamidi.github.io/pmGenerator/data/w2.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;w2&lt;/a&gt;:   (missing: &lt;code&gt;CCNpNqCqp&lt;/code&gt;,&lt;code&gt;CCpCqrCCpqCpr&lt;/code&gt;,&lt;code&gt;CCpqCCqrCpr&lt;/code&gt;)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;    CpCCqCprCCNrCCNstqCsr = 1&#xA;[0] CpCCNqCCNrsCNqCCNCCNtCCNuvNpCutwNCxCCyCxzCCNzCCNabyCazCrq = DDDDD111111&#xA;[&lt;b&gt;1&lt;/b&gt;] Cpp = DDD11DDD11D11[0][0]&#xA;[2] CpCqCrCsCtq = DDDDD1DDD11DD1D111[0]1[0]11&#xA;[&lt;b&gt;3&lt;/b&gt;] CpCqp = DDD1D[2]1D111&#xA;[&lt;b&gt;4&lt;/b&gt;] CpCNpq = DDDDD1D111[0]DDD11DDD1D111[0][0]1&#xA;[5] CpCqCrp = DDD11DD11DDD1D111[0][2]&#xA;[&lt;b&gt;6&lt;/b&gt;] CCNppp = DDDDD1[1]1DDDD11DDD1[5]D11DDD11DDD1D111[0]1DDD1DDDD11D1DD1DDD1[0]D1111[0]DDD11D1[0][0]DDD1D1D[2]11[0]DDDDD11111[0]1DDDD11[5]DDD1DDD11D1DDD11DDD1D111[0]1DDD11DDD1DDD1DD1D111111[0]1DDD1DDD1DDD1DDD1[0]D1111[0]1[0]1[0]DDDDD11111[0]1DDD1DDDDD1D111[0]DDD11DDD1D111[0][0]DDD11DDD1111DDD11DDD1DDD1DDD11D11[0]111[0]1D1[1]DDDD11D11[0]DD1[3]1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://xamidi.github.io/pmGenerator/data/w3.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;w3&lt;/a&gt;:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;    CpCCNqCCNrsCptCCtqCrq = 1&#xA;[0] CCCpCCqrCsrtCCCqrCsrt = DD1D111&#xA;[1] CCCpCqrsCCqrs = DD1DDDD111D[0]D11D111&#xA;[2] CCCpqrCqr = DDDDD[1]D111D[0]DD1111D11&#xA;[3] CCCNpqrCpr = DD11DDDDD111D[0]D11D1D11[1]&#xA;[4] CCNpCCNqrCCCCCCstuCtuvCCvwCxwyCCypCqp = D1DDD1[0]1D[0]DDDD[1]D11111&#xA;[5] CCNppCqp = DD11D[3]D11&#xA;[&lt;b&gt;6&lt;/b&gt;] CpCqp = DDDDD[1]D111DD[1]D11111&#xA;[7] CpCCpqCrq = DDD1D11DDD[0]D[0]D1D[0]D1D11[0][1]D11&#xA;[8] CpCqCrp = D[2]D[1]DDDD111D[0]D11D11&#xA;[9] CCCNpqCCCCNrsCCtCutvCCvwCrwxCCxyCpy = D[1]D1D[1]D1[6]&#xA;[10] CCCCCpqrCsrtCqt = DD[1]DD[0]D[1]1[5]1&#xA;[&lt;b&gt;11&lt;/b&gt;] CpCNpq = D[3]DD[0]D11[5]&#xA;[12] CCCpCqrsCrs = DD1[5]DDD[0]D[0]D1D[0]D11DD1[0]1[1]&#xA;[&lt;b&gt;13&lt;/b&gt;] Cpp = DD[3]DD11[7]1&#xA;[14] CpCNNCqrCsCqr = DDD11DDD[1]DD[0]111DD[0]D[0]D1D11[0]DD[1]D[0]D1D[1]D1[6]DDD11DDD[1]DD[0]111DD[0]D[0]D1D11[0]DD1D11DDD11DDDDD111D[0]D11D1D11DD11DDD[0]D[0]D1[0]DD1DD1111[1]DDD11DDD[0]D[0]D1DDD1[0]1[0][1][1]DDDD111D[0]D11D1D11&#xA;[15] CCNCCppNqrCqr = D[9]DD1[13]D[14][14]&#xA;[16] CCNNpqCpq = D[9]D[4]D[2]DD[9]D[4]D[15][8][8]&#xA;[17] CpCqCrNNp = D[16][8]&#xA;[18] CCpqCNNpq = D[9]D[4][17]&#xA;[19] CCNpqCNCrpq = D[9]D[4]D[18]D[2][17]&#xA;[20] CCNpqCNCrCspq = D[9]D[4]D[18]D[12][17]&#xA;[21] CCCpqCNprCsCNpr = D[4]DD[9]D[4]D[18]D[3][17]D[10]D[7]D[3][15]&#xA;[&lt;b&gt;22&lt;/b&gt;] CCNppp = D[16]DD[5]DD[9]D[4]D[3][17][5]D[5]DD[9]D[4]D[3][17][5]&#xA;[23] CCpNCNppCqNCNpp = D[4]D[18]D[10]D[7]DDD1[13]DD[4]D[19][8][7][22]&#xA;[24] CNCpqCrCsp = DDDDD1[13]DD[4]D[19][8][7][16]DD[4]DD[9]D[4]D[18]D[3][17][8]D[18]D[4]D[19][8]D[20]DD[21]DDD11DDD[0]D[0]D1[0]DD1[0]1[1]DDDD111D[0]D11D1D11DD[21][21]D[21][21]&#xA;[25] CCpCpqCpq = DDD[4][24]D[4][24]DD[4][24]D[4][24]&#xA;[26] CCpqCNCprq = D[9]D[4]DD[25][21]D[16]D[2]D[1]D[1]DDDD111D[0]D11D11&#xA;[27] CCCpqrCNpr = D[9]D[4]D[26][17]&#xA;[28] CCpqCCNppq = DD[1]D1D1D11D[4]DD[9]DD[9]D[4]D[18]DD[9][23][8]D[27][23][8]&#xA;[29] CpCCpqq = DDD[25]D[4]D[19][24]DDD[1]DD[0]111D[0]D[0]D1D[0]D11DDD1[6]DD[4]D[19][8][7][25]&#xA;[30] CCpqCCNqpq = D[4]DDD[1][4]D[28]D[10][25][28]&#xA;[&lt;b&gt;31&lt;/b&gt;] CCNpNqCqp = D[16]DD[25]D[4]D[19][24]DD[30]D[2]D[3][15]D[19]D[25]DD[9]D[4]D[3][17][20]&#xA;[&lt;b&gt;32&lt;/b&gt;] CCpqCCqrCpr = DDD1[26]D[6]D[28][29]DD[28][12]D[20]1&#xA;[33] CCpCqrCqCpr = DD[32][32]D[32][29]&#xA;[&lt;b&gt;34&lt;/b&gt;] CCpCqrCCpqCpr = D[33]DD[32][32]DDD[28][12]D[20]1DD[33]D[27][30]D[33]DD[32][32][27]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://xamidi.github.io/pmGenerator/data/w4.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;w4&lt;/a&gt;:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;    CpCCNqCCNrsCtqCCrtCrq = 1&#xA;[0] CpCCNqCCNrsCtqp = DDD1111&#xA;[1] CpCNCqrp = DDD111DDDD111D[0]11&#xA;[2] CCpCNqCCNrsCtqCpCCrtCrq = DD11D[1]1&#xA;[3] CCpqCpCCNrCCNstCurq = DD11D[1]D[0][0]&#xA;[&lt;b&gt;4&lt;/b&gt;] CpCNpq = DDD11D[1][0]DDDD111D[0]11&#xA;[&lt;b&gt;5&lt;/b&gt;] CpCqp = DDD111DDD11DDDD11D[1]DDD111D[0]1111&#xA;[6] CCpqCpCrq = DD11D[1]D[0][5]&#xA;[7] CCpNNqCpq = DD11DDD11D[1]D[3][0]DDDD111D[0]11&#xA;[8] CCpqCCrpCrq = D[2]D[6][0]&#xA;[9] CCpCqNqCpCqr = DD11D[1]D[0]DD11D[2]DDDD111DD111DDD11D[1]D[3][0]DDDD111D[0]11&#xA;[10] CCpqCpNNq = DD[2][3]D[9]DDD11D[1]D[0][7][5]&#xA;[&lt;b&gt;11&lt;/b&gt;] Cpp = DDDDD[2]DD11D[1]D[0]D[3][5]D[6]DDD11D[1]D[0]DD11DDD11D[1]D[0]DD11D[1]D[0]DDD11D[1][0]DDDD111D1111DDD111D[1]1111&#xA;[&lt;b&gt;12&lt;/b&gt;] CCNppp = D[7]DDD11DDD[2][3]D[1]D[6]D[9][5]DDD[2][3]D[9]DDDD11D[3]D[2]DDD11D[1]D[0]DD11D[1][4][1]DD1111DDDD11D[3]D[2]DDD11D[1]D[0]DD11D[1][4]DDD111D[1]1DD1111D[9][10]&#xA;[13] CpCCpqq = DDD[8][12]D[9]D[8]D[10][5]DDD[2][3]D[1]D[9][5]DDD[8][12]DD11D[1]D[0][4]DDD11D[1]D[0][6]DDD11D[3]DDD11D[1]D[0][4][5][11]&#xA;[&lt;b&gt;14&lt;/b&gt;] CCNpNqCqp = DD[8]D[13][11]D[2]D[8][13]&#xA;[&lt;b&gt;15&lt;/b&gt;] CCpqCCqrCpr = DDDD[8]D[13][11]D[2][3]DD[8][13]DDD11DDD11D[1]D[0]DDD11D[1]D[3][5]DDDD111D[0]11D[6]D[9][5][11]DDD11D[1]D[0][6][8]&#xA;[&lt;b&gt;16&lt;/b&gt;] CCpCqrCCpqCpr = D[2]D[6]D[15][12]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://xamidi.github.io/pmGenerator/data/w5.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;w5&lt;/a&gt;:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;    CCpqCCCrCstCqCNsNpCps = 1&#xA;[&lt;b&gt;0&lt;/b&gt;] CCpqCCqrCpr = DD11D1DD11D1D11&#xA;[1] CCCpCqrCCCsqtCNqNsCsq = DDD11DD1D11D1DD1D11DD11D1DD11D1DD1D1DD11D11D1D111&#xA;[&lt;b&gt;2&lt;/b&gt;] CpCNpq = D[1]1&#xA;[&lt;b&gt;3&lt;/b&gt;] Cpp = D[1][0]&#xA;[&lt;b&gt;4&lt;/b&gt;] CpCqp = DDD11DDD11DDD11D11D1DDD11DD11D1DD11D1DD1D1DD11D11DD11D1DD11D1DD1D1DD11D11D1D111D111&#xA;[&lt;b&gt;5&lt;/b&gt;] CCNpNqCqp = DD1DD11DD1D1DD1D1D1D11D1D11D1DD1D11D1D11D1D1[2]&#xA;[&lt;b&gt;6&lt;/b&gt;] CCNppp = DD1[0]DD11D1DD11D1DDD11D1D1DD11D1D1DD11D1DD11D1DD1D1DD11DD1D1DD1D1D1D11D1D11D1DD1D11D1D11D11D11&#xA;[&lt;b&gt;7&lt;/b&gt;] CCpCqrCCpqCpr = DDD11D1D11DD1DD11D1DDD11D1[1]DD11D1DD1D1DD11D1DD11D1DD1D11D11D1D11D1DD11D1D1DD11D1DD11D1DD1D11D1[0]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;a href=&quot;https://xamidi.github.io/pmGenerator/data/w6.txt&quot; rel=&quot;nofollow noreferrer&quot;&gt;w6&lt;/a&gt;:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;pre&gt;&lt;code&gt;[...989 bytes in 19 lines ommitted to fit into the sandbox...]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Where do I even start?&lt;/h2&gt;&#xA;&lt;p&gt;I called this a puzzle game for good reasons: Proofs for different theorems are components which can be used to build new components when arranged in a specific (and potentially very difficult to find) way. When it comes to snapping formulas together in order to create another one, things behave the same in all &lt;code&gt;D&lt;/code&gt;-systems.&lt;/p&gt;&#xA;&lt;p&gt;The above abstract proof representations hide many utilized formulas, but these can be viewed using &lt;a href=&quot;https://github.com/xamidi/pmGenerator&quot; rel=&quot;nofollow noreferrer&quot;&gt;pmGenerator&lt;/a&gt; to display the “full summary” mentioned in the linked proof files – deriving them by hand is probably too much of a workload.&#xA;It may be useful, however, to write your own code to assist with this kind of work, and to follow your own ideas.&lt;/p&gt;&#xA;&lt;p&gt;[...] (Does not fit into the sandbox.)&lt;/p&gt;&#xA;&lt;h2&gt;Data &amp;amp; Tools&lt;/h2&gt;&#xA;&lt;h5&gt;pmGenerator&lt;/h5&gt;&#xA;&lt;p&gt;[...]&lt;/p&gt;&#xA;&lt;h5&gt;Prover9&lt;/h5&gt;&#xA;&lt;p&gt;[...]&lt;/p&gt;&#xA;&lt;h5&gt;TPTP / Vampire&lt;/h5&gt;&#xA;&lt;p&gt;[...]&lt;/p&gt;&#xA;" OwnerUserId="114913" LastEditorUserId="114913" LastEditDate="2024-02-21T09:34:23.413" LastActivityDate="2024-02-21T09:34:23.413" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26279" PostTypeId="2" ParentId="2140" CreationDate="2024-02-14T00:10:47.580" Score="0" Body="&lt;h1&gt;Infinite monkeys with autocomplete&lt;/h1&gt;&#xA;&lt;p&gt;You've probably heard of the &lt;a href=&quot;https://en.wikipedia.org/wiki/Infinite_monkey_theorem&quot; rel=&quot;nofollow noreferrer&quot;&gt;infinite monkey theorem&lt;/a&gt;, which states that a monkey pressing keys on a keyboard at random will eventually type any possible string, the most well-known example being the complete works of Shakespeare. Of course, as the string grows longer and longer, the time taken to type that string becomes exponentially longer. But what if the monkey had an autocomplete?&lt;/p&gt;&#xA;&lt;p&gt;Our hypothetical monkey starts with an alphabet, containing every possible character that it can type, and a dictionary that initially only contains every letter in the alphabet. At every step, it'll choose a random item from the dictionary and type it. But, the monkey has a helpful autocomplete guiding it to the correct string - if the last two items that were typed, concatenated, are a substring of the correct word that's not yet in the dictionary, it'll add that substring to the dictionary.&lt;/p&gt;&#xA;&lt;p&gt;For example, let's start with the monkey trying to type the word &lt;code&gt;hello&lt;/code&gt;, with the alphabet &lt;code&gt;helo&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;l o&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;It first types &lt;code&gt;l&lt;/code&gt; and &lt;code&gt;o&lt;/code&gt; and adds &lt;code&gt;lo&lt;/code&gt; to the dictionary.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;l o h lo l h e&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;It then types various random dictionary items before typing &lt;code&gt;h&lt;/code&gt; and &lt;code&gt;e&lt;/code&gt;, and adding &lt;code&gt;he&lt;/code&gt; to the dictionary.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;l o h lo l h e e e l&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;After some more random items, it types &lt;code&gt;e&lt;/code&gt; and &lt;code&gt;l&lt;/code&gt; and adds &lt;code&gt;l&lt;/code&gt; to the dictionary.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;l o h lo l h e e e l h lo o el e h el&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Next, it types &lt;code&gt;h&lt;/code&gt; and &lt;code&gt;el&lt;/code&gt; and adds &lt;code&gt;hel&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;l o h lo l h e e e l h lo o el e h el lo&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;After typing the &lt;code&gt;el&lt;/code&gt;, it types &lt;code&gt;lo&lt;/code&gt; and adds &lt;code&gt;ello&lt;/code&gt; to the dictionary.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;l o h lo l h e e e l h lo o el e h el lo he hel he l o&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Next, it types &lt;code&gt;he&lt;/code&gt; and &lt;code&gt;l&lt;/code&gt;, but because &lt;code&gt;hel&lt;/code&gt; is already in the dictionary it's not added. For the same reason, &lt;code&gt;lo&lt;/code&gt; is also not added.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;l o h lo l h e e e l h lo o el e h el lo he hel he l o h ello&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Finally, it types &lt;code&gt;h&lt;/code&gt; and &lt;code&gt;ello&lt;/code&gt;, creating &lt;code&gt;hello&lt;/code&gt; after 24 attempts.&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to, given a target word and alphabet containing only lowercase ASCII letters and spaces, simulate this behaviour, choosing random items and building up the dictionary until you eventually create the desired word. The alphabet will not contain any character more than once, and will at least contain every character in the target word.&lt;/p&gt;&#xA;&lt;p&gt;At every step, you should choose a (not necessarily uniformly) random item from the dictionary, and the words you print should be separated by some consistent and unambigiuous delimiter. Although you do not have to uniformly randomly choose an item, it should be possible for any possible output sequence of strings to occur.&lt;/p&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, shortest wins!&lt;/p&gt;&#xA;&lt;h3&gt;Examples&lt;/h3&gt;&#xA;&lt;p&gt;Note that this is just one possible output for each input.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&#xA;word = &quot;abcba&quot;, alphabet = &quot;abc&quot; -&gt; &quot;a,a,c,b,b,cb,c,bcb,bcb,a,a,b,cb,ab,cb,b,bcba,bcba,c,b,cb,c,ab,bcba,c,bcb,ab,c,bcba,bcb,bcb,b,bcb,bcba,ab,a,b,a,c,cb,c,bcba,cb,abcb,abcb,ba,ba,abc,a,b,bcb,ab,bcb,a,ba,b,bcb,abc,c,abcb,a&quot;&#xA;word = &quot;hello&quot;, alphabet = &quot;helo&quot; -&gt; &quot;o,l,h,o,e,e,h,l,e,o,l,o,lo,lo,l,e,h,h,o,lo,h,l,lo,h,o,llo,o,llo,e,o,llo,lo,l,e,e,o,e,o,lo,l,l,ll,llo,h,l,ll,e,h,e,l,he,llo&quot;&#xA;word = &quot;hello&quot;, alphabet = &quot;abcdefghijklmnopqrstuvwxyz&quot; -&gt;&#xA;&quot;k,p,o,d,t,s,c,e,j,b,n,f,h,u,k,b,z,q,f,j,m,e,h,y,m,k,f,q,o,r,q,m,y,o,a,w,b,j,r,d,q,u,k,m,b,j,c,p,p,i,e,h,a,y,l,q,a,k,b,s,l,g,t,f,v,w,c,l,p,b,n,u,h,b,u,e,r,g,u,f,x,b,x,j,p,q,p,i,e,n,x,o,y,u,b,l,b,z,z,x,w,d,p,q,p,i,h,c,i,h,m,j,q,b,b,v,d,e,b,f,f,u,q,z,d,r,a,q,p,v,t,z,o,c,z,c,t,u,n,q,l,i,a,t,f,j,a,d,g,h,s,l,t,v,l,a,t,z,i,l,j,z,x,t,q,o,a,v,q,t,p,e,d,n,p,t,i,d,c,o,r,k,y,t,b,s,l,c,w,l,a,o,y,k,e,u,r,v,t,f,f,e,f,m,v,r,a,k,b,q,q,a,l,y,u,u,m,c,e,l,m,q,b,u,r,n,m,n,f,j,t,s,n,b,t,q,el,b,el,w,d,g,w,c,h,h,x,p,o,q,o,y,r,p,t,t,p,o,j,h,d,g,q,z,d,s,b,g,i,f,g,d,v,w,k,c,u,h,w,c,z,r,el,w,y,b,s,j,l,i,v,o,q,h,l,t,j,n,u,h,p,b,t,s,g,h,i,b,o,r,g,o,q,w,z,p,t,p,k,x,a,g,x,h,k,u,h,a,h,v,b,n,e,u,f,d,k,m,h,e,d,d,c,j,el,i,u,b,n,f,d,x,t,j,t,c,d,j,r,v,r,i,k,d,m,z,n,h,x,p,e,t,q,q,a,b,u,y,r,j,v,l,f,k,el,m,he,c,a,j,r,r,b,he,g,z,t,c,y,x,b,u,i,j,j,x,b,d,he,he,l,g,t,o,v,o,e,f,o,u,j,e,g,z,h,t,i,w,c,a,m,m,i,n,g,t,u,t,q,m,n,c,y,o,t,h,i,h,w,l,t,p,h,i,g,t,he,f,x,n,k,d,g,p,i,w,p,r,g,j,r,e,he,h,t,v,x,e,el,n,e,r,n,y,v,r,f,o,w,d,y,g,n,hel,c,he,k,x,q,k,q,h,l,d,l,he,i,w,h,l,b,k,y,k,h,e,s,s,g,y,x,n,p,c,k,l,he,l,g,k,s,hel,f,a,el,s,w,w,s,h,d,o,w,x,p,el,q,o,b,j,h,p,i,o,j,v,n,q,q,he,d,y,l,s,w,he,v,w,k,a,hel,b,h,t,a,u,s,s,x,y,b,p,d,e,l,y,m,x,w,s,t,hel,m,hel,x,h,p,c,u,h,q,a,i,hel,i,j,hel,x,hel,a,q,el,z,x,m,z,e,t,a,e,z,s,l,j,u,x,q,h,a,c,k,h,y,c,y,a,j,h,m,d,hel,r,q,v,a,f,el,v,p,i,el,c,n,p,a,r,o,s,o,a,hel,c,i,h,he,g,x,j,f,g,c,v,a,he,q,i,e,f,r,y,w,g,e,u,i,q,f,v,o,m,hel,c,u,h,d,o,p,y,s,p,he,el,v,hel,z,he,f,z,h,h,c,r,p,c,p,j,v,z,m,f,y,k,n,a,u,l,x,t,d,v,x,el,hel,e,i,p,c,n,hel,z,k,p,j,d,c,el,y,e,t,h,h,f,e,a,f,w,h,hel,e,el,n,el,m,l,x,t,el,o,t,n,t,o,h,el,c,x,v,hel,j,v,t,i,i,c,hel,p,t,h,z,q,p,w,h,w,x,u,k,q,b,e,w,q,j,s,y,b,i,h,a,c,q,g,hel,hel,l,he,b,d,y,m,hel,v,i,m,l,h,e,j,z,t,x,hell,k,m,y,v,d,n,s,hell,c,x,hel,a,u,hel,f,e,v,hel,c,hel,f,e,j,k,hel,y,x,t,e,hel,j,h,d,u,h,i,h,s,i,c,w,d,he,n,t,y,hel,he,m,hell,x,n,n,x,c,c,i,he,hel,b,j,j,y,v,a,a,g,n,he,v,r,i,p,c,o,r,t,s,hel,hel,y,l,y,e,r,g,b,h,he,el,u,q,i,hel,b,hel,i,w,m,u,q,j,c,b,j,l,s,w,o,s,u,s,c,l,el,s,d,o,q,j,j,e,hell,c,m,x,a,he,n,q,v,s,u,hell,n,e,n,c,x,m,v,v,z,v,b,h,f,o,u,m,l,h,he,el,n,el,b,z,a,o,w,l,i,j,el,n,f,i,e,p,m,c,hel,p,b,j,k,e,u,y,he,v,e,h,i,x,j,o,f,j,o,o,hell,q,d,n,m,j,n,a,a,el,n,b,n,y,a,t,y,f,f,l,p,c,w,el,g,el,hel,j,d,n,he,he,z,a,e,c,w,b,e,el,b,x,n,a,a,x,y,a,hel,a,hell,he,g,g,c,q,l,z,o,x,y,h,r,o,he,q,x,q,x,hell,a,l,o,e,l,k,l,m,w,lo,he,x,l,l,x,o,z,j,i,b,d,g,h,he,i,el,q,l,k,k,a,hel,ll,h,z,m,b,m,j,y,ll,s,v,u,ll,ll,f,f,p,p,m,d,g,g,lo,e,l,w,el,s,el,k,r,c,u,g,hell,o&quot;&#xA;word = &quot;hello world&quot;, alphabet = &quot;abcdefghijklmnopqrstuvwxyz&quot; -&gt; &quot; ,k,l,q,x,w,d, ,a,o,b,v,h,n,n,i,l,f,u,t,u,n, ,g,j,s,t,i,g,d,f,g,b, ,o,f,t,x,d,q,w,k,d,t,n,d,v,h,e,m,he,s,b,h,w,l,h,x,e,j,o,g,i,f,f,c,h,k,a,y,z,r,j,l,v,k,i,he,p,x, ,f,u,m,d,p,c,s,p,y,e,k,w,u,q,f,f,s,f,f,a,z,w,l,e,v,q,a,r,y,l,u,he,x,z,z, ,k,k,k,i,u,m,q,k,t, ,l,k,he,y, ,z,l,he,x,x,w,n,w, ,l,v,c,o,h,g,e,b,n,q,j,a,c,p,j,he,p,r,w,c,s,l,j,g,j,x,y,i,c, ,q,c,i,j,v,s,r,a,z,c,d,m,f,w,i,z,a,s,t,l,he,a,r,r,he,a, ,v,q,o,r,y,b,n,j,k,d,m,i,t,b,v,q,y, ,y,l,he,r,or,r,t,b, ,a,q,z,h,l,e,w,y,l,t,o,or,d,l,j,h,g,e,h,y,g, ,x,k,g,he,b,r,or,he,he,g,m,t,he,s,j,c,d,v,l,he,e,a, ,or,h,h,g,or,j,u,l,f,o, ,p,k,z,g,q,u,h,j,k,o , ,r,he,o ,e, ,g,x,o,v,b,t,f,q,d,w,p,o,u,j,c,q, ,t,k,q,or,a,he,h,g,v,t,j,g,or,x,h,t,s,t,i,he,d,q,y,t,d,b,d,o ,g,l,l,he,n,e,v,y,x,or,y,g,he,p,k, ,x,d,c,o ,n,o ,or,s,v,q,o ,g,n,he,o,m,o,u,d,z,he,n,o,t,r,p,n,g,g,w,m,o ,b,h,s,or,or,a,n,m,z,r,u,e,i,h,m,v,g,o,g,f,k,p,j,t,v,d,k,c,m,h,x,z,f,f,d,e,o,h,a,m,b,or,ll,k,m,b,e,f,y,or,l,u,v,x,u,h,x,n,p,orl,p,k,p,b,y,x,x, ,a,a,he,a,i,h,d,x,w,or,j,w,wor,ll,h,x,orl,f,j,b, ,c,z,h,z,q,s,h,n,u,he,k,v,x,orl,w,u,r,m,h,g,p,b,j,a,g,i,h,b,d,r,a,k,i,orl,he,l,l,t,ll,or,o,q,ll,j,q,d,h,k,o,n,d,k,e,x,a,d,h,p,c,h,f,i,x,i,e,p,hel,o,he,or,r,s,e,g,j,u,v,v,f, ,e,y,o,u,ll,hel,f,c,n,v,x,f,h,w,x,b,o ,r,h,k,a,x,g,f,s,o,s, ,a,orl,l,v,o ,d,i,orl,x,e,wor,orl,hel,v,wor,f,l,t,j,i,f,w,o ,e,c,y,f,z,v,t,hel,or,s,n,y,g,w,hel,c,v,x,i,j,f,o,j,z,a,p,ll,x,m,e,r,o ,g,q,f,i,j,b,y,v,b,q,e,o ,y,orl,g,v,wor,p,wor,w,d,s,o ,k,h,t,or,a,v,r,p,s,i,t,y,g,l,z,y,a,u,f,c,p,p,b,orl,h,a,g,x,g,s,n,f,x,u,s,b,i,wor,orl,r,orl,f,ll,or,hel,wor,d,d,a,x,hel,o,hel,e,m,wor,f,e,k,x,a,d,p,o ,k,orl,m,m,hel,z,g,j,c,f,j,u,ll,h,d,e, ,t,j,c,f,wor,he,p,orl,d,r,orl,hel,q,b,b,wor,y,p,u,he,z,b,he,h,s,ll,y,wor,a,t,b,c,z,y,y,v,b,o ,d,b,or,s,d,k,q,l,x,b,p,orl,e,x,wor,ll,orl,y,o,l, ,a,g, ,x,d,e,wor,y,t,w,orl,c,f,s,i,c,hel,z,i,w,hel,f,i,y,ll,e,x,g,orld,wor,he,n,c,or,x,ll,ll,s,l,t,ll,l,p,q, ,w,worl,a,q,he,i,x,l,hel,g,o , w,m,c,o ,l,z,worl,j,i,y,n,b, w,b,wor,f,r,u,j,l,u,f,z,z,m,c,orld,c,e, w,ll,m,x,y,u,j,t,hel,o ,b,wor,he,m,d,n,f,orld,or,u,i,i,e,c,q,b,t, w,p,c,t,orl,p,c,o ,q,hel,w,orld,c,e, w,orl,b,r,u,y,ll,g,wor,hel,n,s,d,g,y,j,b,t,q,wor,hel,hel,s,y,b,a,or,n,h,orld,hel,orl,k,ll, ,f,z,o ,u,o, worl,he,o,v,e,or,r,wor,wor, worl,h,he,q,c,q,hel,orld,or,u,p,v,hel,ll,or,x,he,o ,q,ll,he,d,x,o ,orl,o ,z,o,b,world,g,or,s,v,a,o ,r,f,hel,i,r,c,s,q,ll,s,u,h,n,u, w,or,u,world,v,m,w,l,x,wor,o ,n,x, wor,a,g,orl,c, ,n,l,o ,w,k,orld,a,w,x, w,g,hel, ,k,orl,orl,r,v,l,o,o,j,orl,o worl,r,s,worl,wor,l,v,o , worl,z,n,lo ,orl,or,s,hel,world,orl,c,u,hel,z,n,z,c,orl,o w,worl,he,e,b,h,f,u,w,k,orl, wor,k,wor,c,f,orl,o worl,f,y,lo ,x,v,l,o ,c,c,z,lo,a,u,hel,orld,world, worl,orl,y,k,ll,ll,e, wor,d,h,j,a,he,j,orl, w,s, wor,he,j,orld,worl,k,hel,u,b,hel,r,w,hel,g,hel,lo, w,o worl,lo ,w,world,o ,lo w,b,t,l,b,u,q,hello, worl,or,p,hello worl,u, ,o ,o w,hel,or,or,u,z, , ,h,hello,o ,z,t,k,q,b,o w,t,m,he,m,w,worl,t,p,hello worl,k,hel,world,z,c, , w,z,b,f,hel,world,r,x,d,o worl,he,x, w,s,i,orld,o,d,t,hello,r,world,j,hello worl,o worl,he,w,f,e, worl,wor,o, worl,o w,lo, wor,lo wor,s,i,b,o worl,m,b,p,v, worl,b,lo ,worl,world,lo wor,f,orl,y,e,x,k,a,x,e,g,s,j,orl, w,d,orl,worl,s,a,worl,lo wor,lo ,o worl,s,lo worl,w,t,hel,orld,orl, worl,b,ll,g,o ,j,he,lo worl,n, ,he,c,n, worl, ,o worl,orl,p,k,b,he,o worl,z,orl,e,a,k,or,o w,z,w,lo w,z,f,u,k,s,o,he,o worl,m,h,a,k,o w,m,b,a,o,lo w,m,o w,he,a,hello,z,lo ,r,b,ll,l,he,or,hel,u, wor,he,g,t,o ,x,v,world,he,p,w,orl,lo,worl,o w, worl,lo w,b,orl,o worl, wor,r,he,h,hel,q,t,u,lo,w, w,lo wor,d,lo worl,n,hello,lo ,he,hello,lo wor,ll,lo worl,he,z,worl,orl, w, worl,lo worl,g,world,j,z,j,o, wor, wor,b,c,p,orl, wor,p,g,y, worl, ,b,k,q,g,o w,o worl,o ,p,d,orl,lo w,lo w,z,he,n,world,wor,d, worl,or,lo wor, wor,l,t,wor,worl,e,m, worl,z,j,hel,h,or,x,k, w,s,s,hello,b,p,lo w,l,g,p,o worl,j,wor,m, w,o,t,u,u,o,orld,s,u, w,orl,he,world,d,t,g,l,u,hello,n,worl,o w,lo worl,d,p,orl,q,o wor,u,v,or,q,d,c,hello worl,he,j,r,world,wor,o wor,hel,world,l,orld,q,x,wor,x,o ,ll,hello, wo,r,lo wor, ,or,j,o worl,t,hel,n,o,p, w,b,world,world,he,lo world,v,or,wor,o,lo world,lo worl,f,hello worl,u,orl,d, ,wor,z,r,lo w,p,o worl,o wor,b,he,f,hello wo,j,o ,o,or,f, ,o w,d, worl,wor,hel,k,y,hel,x,o worl, wor,g,ll, worl, wor,n, wo,orl,hel, wo,s,orld,he,lo,he, worl,o w,lo world,p,lo ,a,o ,v,c,p,t,or, w,q,f,o , wor,o worl,p,s,world,v,m,w,s,r,a,g,orl, ,z,p,v,j,o,o,r,l,c,q,orld,r,l,g,d,rl,lo wor,k,w,o , ,x,k,o,i,z,h,n,t,n, worl,w,w,s, wo,hel,he,f,lo , ,o worl,s,p,hello worl,r,o w,o worl,o w,j,c,world,lo worl,o ,wor,z,y,lo world,lo world,orld,s,u,hello,orl,lo wor,r,or,t,l,m,ll,worl,b,u, wo,o ,t, ,or,ll,ll,o,o w,llo,e,s,b,t,z,d,u,world,p,orld,wor,hello worl,lo worl,p,a,lo w,orld,w,wor,o w,lo worl,w,j,lo worl, worl,s,g,k,a,o w, ,o,hel,o,s,wor,u,w,p, wor,y,ll,he,j,orld,hello worl, worl,g,ll,o,lo worl,n,o,o worl,orld,m,lo,rl,o ,wor,hello worl,e,t,ll,g,d,d,orl,n,k,x,lo worl,a,q,wor,lo wor,lo worl,rl,o ,a,ll, wo,s,w,o w,e,h,lo,wor,o ,c,or,f,z,hel,lo worl,j,i,b,d,rl,lo ,j,j,o w,llo,i,b,z,c, worl,worl,e,o w,m, worl,wor,v,lo worl, ,r,u,y,g, w,m,r,ll,b, worl,g,o wor,b,a,m,n,orld,he,wor,hello,lo worl,orld, worl, , worl,o,q,b,o,e,rl,u,or, wo,u,o wor,hello worl,ll, ,llo,h, , ,wor,rl,y,l,z,he,orld,lo wor,x,g,n,b,world,j,ll,m,x,x,rl,n,lo worl,o worl,b, w, wo,b,z,x,o,v,or,t,hello,w,p,a,o,p,llo, ,y,d,p,h,c, wor,b,r,rl,u,c, worl,llo ,i,lo ,o ,q,p,w,he,he,b,lo,a,z,a,e, wor,v,or,hello wo,lo wor,m,hello worl,lo world,hello,v,worl,hel,s,llo ,e,d,o w,world,lo wor,lo ,hello worl,worl,w,w,orld,hello,o w,q,u,o ,worl,l,a,w, , wor,u,y,rl,s,p,o w,g,a,rl,v,y,orl,worl,o worl,rl,wor,x,u,or,s,orld,x,o ,q,p, w,z,u,t,d,a,orl,ll,o ,r,i,k,lo wor,p,b,a,ll,d,z,hello worl, ,hello worl, wor,o w,world,ll,world,hello,lo worl,k,llo ,hel,e,or,rl,hello,v,q, wo,lo wor,e,s,o,wor,lo ,o w,o ,or,x,wor,d,q,d,wor,hello wo,world, wo,a,llo ,worl,orld, wor,y,y,lo wor,o w, w,o,k,k,o ,b,llo worl,orld,worl,llo worl,ll,y,lo worl, wo,llo,hello,p, wo,u,hello worl,lo wor,m,n,orl,r,s,a, wor,wor,x,lo,u,lo world,lo world,s,o wor,o ,a,he,q,b,o,rl,o w,q,n, w, worl,e,a,k,o w, wor,a,f,o,hello worl, worl,o wor,z,g,s,o w, ,hello,hel,lo,i,lo worl,g,t,lo,lo world,rl,lo wor,o,t,ll,x,w,g,k,v,rl,he,y,hel,world,o wor,a,lo ,b,orl,lo, worl,q,o worl,world, w,hello wo,h,o ,o ,wor,hello,hel,lo ,b,q,o w,l,t,n,llo,e,q,q,q,lo worl,hello wo,orld,hello wo,h,x,p,z,hel,n,w,f,o wor,w,h,or,u,s,hello worl,hello ,d,d,rl,hello worl,wor,orl,hello,world,ll,lo,m,hello ,d,lo ,i,lo wor,orld,o ,z,m,hello wo,llo worl,ll,lo worl,world,hello ,llo,hello,e,rl,worl,h,llo worl,u,llo ,world,r,y,lo wor,g,z,d,worl,m,or,llo, wo,or,he,x,o worl,i,hello worl,k,f,w, w,o ,lo world,lo w,i,a,w,o ,z,r,hello ,hello ,hello worl,x,s,llo wo,u,worl,hello, worl,hello worl, ,world,t,llo world,rl, ,p,l,lo,lo w,worl,l, , ,rl,llo wo,h,o worl,llo worl,s,s,a,he,orld,p,lo ,i,f,hello wo,a,llo worl,llo,llo wo,he,llo ,b,ll, w,lo worl,i,t,k,world,r,llo ,lo worl,o w,d,j,lo worl,t,w,world,a,s,hello worl,or,hello wo,o ,llo wo, wo,u,orld,hello ,hello , worl,u,n,z,lo,o worl,llo , , wo,e,o wor,x,lo , w, world,s,hello ,lo world, world,worl, worl,b,h,h,q,world,s,c,lo w,d, ,l,hello worl,g,wor,or,t,x,i, worl,lo wor,s,p,s,llo worl,lo world,p,orld,f,k, w,orl, world,i,lo,orld,d,p,b, worl, ,world,b,b,ll,orl,l,a,llo ,p,k,world,i,hel,m,lo world,lo world,rl,world,d,q,r,he,j,hello worl,t,v,llo wo,p,d,g, world,world,r,hello,c,hello worl,llo world,lo world,z,m,t,q,j,t,m,d,n, worl,r,hello worl,lo worl,orl,p,hello ,g,o,rl,c,d,ll,lo w,o w,w,wor,orl, worl,llo world,y,llo world,o w, worl,c,g,lo worl, ,q,lo ,h,he,lo w,worl,lo worl,orld,m,u,wor, w,llo world,q,e,p,hello wo,hello worl,worl, world,s,o ,o ,d,o worl,n,x,world,hello worl,hello ,lo world, wo,x,rl,x,s,llo,lo ,a,hello ,e,q,lo w,world,x,i,o wor,w,z,s,o ,k,k,g,llo ,i,hello wo,lo w, worl, w,c, wor,c,c,lo , wo,lo world,lo,o wor,k,world,o wor,y,lo ,q,s,s, worl,hello ,lo , wor,orl,lo wor,llo,hello wo,wor, w,f, wo,w,k,r,j,o ,orld,i,or,p,b,rl,l,llo,e,rl,o,or,v,hello wo,lo ,w,j,w,hello,o w,hello worl,lo worl,e,i,llo,r,llo ,u,x,w,m,worl,h,wor,o, ,lo,o w,f,hel,c,lo world,b,a,llo worl,g,d,j,k,x,hello wo, world,o wor,llo world,hel,h,llo world,t,q,llo worl,x,h,lo ,v,or,b,u, wor,d,e,b,h,x,w,llo ,h,w, worl,o,hello, w, w,d,hello w,t,q,hello wo,llo wo,rl,m,lo wor,r,lo ,o w,hello,llo world,s,k,q,orld,y,v,hel,l,hello wo,w,a,orld,e, ,p, wor, wo,llo,wor,t,hello worl,f,hello w,wor,lo world,or,j,lo,d,i, worl, ,l,o ,wor,lo worl,g,b,m,s,s,ll,worl,orld,he,hello,rl,q,q,c,o worl,x,llo world,b,rl, ,d,ll,o, ,x,rl, wo,v,hel,llo world,l,hello,n,or,d,he,llo world&quot;&#xA;word = &quot;code golf and coding challenges&quot;, alphabet = &quot;abcdefghijklmnopqrstuvwxyz &quot; -&gt; &lt;a href=&quot;https://gist.github.com/chunkybanana/c2fb3af6c56981d2682452f4389f4e27&quot; rel=&quot;nofollow noreferrer&quot;&gt;too large to fit in post&lt;/a&gt;&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2024-02-15T22:19:50.567" LastActivityDate="2024-02-15T22:19:50.567" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26280" PostTypeId="2" ParentId="2140" CreationDate="2024-02-14T18:06:07.727" Score="0" Body="&lt;p&gt;String to Lojban!&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;In the constructed language Lojban, you can express ASCII strings with a literal quote, for example&lt;br&gt; &lt;code&gt;zoi zoi \d+(\.?\d+) zoi&lt;/code&gt;.&#xA;However, how would you pronounce that?&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;zoi zoi backslash d plus opening bracket backspash dot question mark &#xA;backslash d plus closing bracket zoi&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;? Non-English speakers won't understand you.&#xA;However, there are several ways to assign Lojban words or phrases to ASCII characters. One is shown in the challenge.&lt;/strong&gt;&#xA;&lt;br&gt;&#xA;&lt;br&gt;&lt;/p&gt;&#xA;&lt;p&gt;So here is the challenge:&lt;/p&gt;&#xA;&lt;p&gt;The input is a string. You can assume it is composed of only the 95 printable ASCII characters.&lt;/p&gt;&#xA;&lt;p&gt;The output is a Lojban representation of the string. It should start with &lt;code&gt;me'o &lt;/code&gt;, followed by the following substrings in order:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;SP -&amp;gt; canlu bu&#xA;!  -&amp;gt; saibu&#xA;&amp;quot;  -&amp;gt; lubu&#xA;#  -&amp;gt; libu&#xA;$  -&amp;gt; meryru'u bu&#xA;%  -&amp;gt; ce'obu&#xA;'  -&amp;gt; y'y&#xA;&amp;amp;  -&amp;gt; joibu&#xA;(  -&amp;gt; tobu&#xA;)  -&amp;gt; toibu&#xA;*  -&amp;gt; pi'ibu&#xA;+  -&amp;gt; su'ibu&#xA;,  -&amp;gt; slaka bu&#xA;-  -&amp;gt; vu'ubu&#xA;.  -&amp;gt; denpa bu&#xA;/  -&amp;gt; fe'ibu&#xA;0  -&amp;gt; no&#xA;1  -&amp;gt; pa&#xA;2  -&amp;gt; re&#xA;3  -&amp;gt; ci&#xA;4  -&amp;gt; vo&#xA;5  -&amp;gt; mu&#xA;6  -&amp;gt; xa&#xA;7  -&amp;gt; ze&#xA;8  -&amp;gt; bi&#xA;9  -&amp;gt; so&#xA;:  -&amp;gt; zo'ubu&#xA;;  -&amp;gt; pi'ebu&#xA;&amp;lt;  -&amp;gt; me'ibu&#xA;=  -&amp;gt; dubu&#xA;&amp;gt;  -&amp;gt; za'ubu&#xA;?  -&amp;gt; paubu&#xA;@  -&amp;gt; zvati bu&#xA;[  -&amp;gt; veibu&#xA;\  -&amp;gt; lu'ebu&#xA;]  -&amp;gt; ve'obu&#xA;^  -&amp;gt; te'abu&#xA;_  -&amp;gt; dizlo bu&#xA;{  -&amp;gt; lu'ibu&#xA;|  -&amp;gt; jabu&#xA;}  -&amp;gt; lu'ubu&#xA;~  -&amp;gt; nabu&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is a modification of &lt;a href=&quot;https://mw.lojban.org/papri/List_of_ASCII_letterals&quot; rel=&quot;nofollow noreferrer&quot;&gt;an existing system which can represent all 95 printable ASCII characters.&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;For lowercase letters, just add &lt;code&gt;y&lt;/code&gt; after the letter, with these exceptions:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;a  -&amp;gt; abu&#xA;e  -&amp;gt; ebu&#xA;h  -&amp;gt; y'y bu&#xA;i  -&amp;gt; ibu&#xA;o  -&amp;gt; obu&#xA;q  -&amp;gt; ky bu&#xA;u  -&amp;gt; ubu&#xA;w  -&amp;gt; vy bu&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;You can also use &lt;code&gt;tau y'y&lt;/code&gt; for &lt;code&gt;h&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For uppercase letters, use &lt;code&gt;tau &lt;/code&gt; followed by the corresponding lowercase letter, however &lt;code&gt;h&lt;/code&gt; must be &lt;br&gt;&lt;code&gt;tau y'y bu&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;After that, the substrings are joined with a single space, however for readability, no spaces are used between digits.&lt;/p&gt;&#xA;&lt;p&gt;However, if the string is empty, output &lt;code&gt;lo kutyuenzi&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Examples:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Input -&amp;gt; Output&#xA;1 2 -&amp;gt; me'o pa canlu bu re&#xA;Hello -&amp;gt; me'o tau y'y bu ebu ly ly obu&#xA;1234 -&amp;gt; me'o parecivo&#xA;12&amp;gt;1 -&amp;gt; me'o pare za'ubu pa&#xA;\d+(\.?\d+) -&amp;gt; me'o lu'ebu dy su'ibu tobu lu'ebu denpa bu paubu lu'ebu dy su'ibu toibu&#xA; -&amp;gt; lo kutyuenzi&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is code-golf, so shortest answer in bytes wins.&lt;/p&gt;&#xA;" OwnerUserId="112690" LastActivityDate="2024-02-14T18:06:07.727" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26281" PostTypeId="2" ParentId="2140" CreationDate="2024-02-14T20:10:54.713" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/270086/spot-the-difference&quot;&gt;Spot The Difference&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="119544" LastEditorUserId="119544" LastEditDate="2024-02-15T19:48:21.923" LastActivityDate="2024-02-15T19:48:21.923" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26282" PostTypeId="2" ParentId="2140" CreationDate="2024-02-17T01:43:44.720" Score="3" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/answer-chaining&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;answer-chaining&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-answer-chaining-tooltip-container&quot;&gt;answer-chaining&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-cops-and-robbers-tooltip-container&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this challenge answers will provide three elements:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;A programming language: &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;An output string: &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;li&gt;And a non-empty string: &lt;span class=&quot;math-container&quot;&gt;\$B_n\$&lt;/span&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;You will also write, but not reveal, a program in &lt;span class=&quot;math-container&quot;&gt;\$L\$&lt;/span&gt; which outputs &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;, built by concatenating copies of the &lt;span class=&quot;math-container&quot;&gt;\$B_n\$&lt;/span&gt; strings from your answer &lt;em&gt;and previous answers&lt;/em&gt; in any order.&lt;/p&gt;&#xA;&lt;p&gt;For example here are two answers given in pseudocode:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;Answer 1&lt;/h2&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; = &lt;code&gt;H&lt;/code&gt;&lt;br/&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$B_0\$&lt;/span&gt; = &lt;code&gt;print &amp;quot;H&amp;quot;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;&lt;p&gt; The program is &lt;code&gt;print &amp;quot;H&amp;quot;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;h2&gt;Answer 2&lt;/h2&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt; = &lt;code&gt;Hiiii&lt;/code&gt;&lt;br/&gt;&#xA;&lt;span class=&quot;math-container&quot;&gt;\$B_1\$&lt;/span&gt; = &lt;code&gt;++&amp;quot;i&amp;quot;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;blockquote class=&quot;spoiler&quot;&gt;&#xA;&lt;p&gt; The program is &lt;code&gt;print &amp;quot;H&amp;quot;++&amp;quot;i&amp;quot;++&amp;quot;i&amp;quot;++&amp;quot;i&amp;quot;++&amp;quot;i&amp;quot;&lt;/code&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Robbers will try to discover a valid solution, that is a program made from the &lt;span class=&quot;math-container&quot;&gt;\$B_n\$&lt;/span&gt; strings in your answer and previous answers which outputs your &lt;span class=&quot;math-container&quot;&gt;\$S\$&lt;/span&gt;. Your goal will be to make this as hard as possible.&lt;/p&gt;&#xA;&lt;h2&gt;States&lt;/h2&gt;&#xA;&lt;p&gt;As with any &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-cops-and-robbers-tooltip-container&quot;&gt;cops-and-robbers&lt;/a&gt; challenge, cops' posts here can have 4 different states:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Vulnerable&lt;/li&gt;&#xA;&lt;li&gt;Cracked&lt;/li&gt;&#xA;&lt;li&gt;Safe&lt;/li&gt;&#xA;&lt;li&gt;Revealed&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;All cops' posts start as &lt;em&gt;vulnerable&lt;/em&gt;. If a robber finds and posts a solution to a &lt;em&gt;vulnerable&lt;/em&gt; post they will receive 1 point and the post will become &lt;em&gt;cracked&lt;/em&gt;. If a post lasts 10 days in &lt;em&gt;vulnerable&lt;/em&gt; without being solved it automatically becomes &lt;em&gt;safe&lt;/em&gt;. A cop with a &lt;em&gt;safe&lt;/em&gt; post may choose to reveal their program and their safe post will become &lt;em&gt;revealed&lt;/em&gt;. A robber can still solve a &lt;em&gt;safe&lt;/em&gt; post, if they do they receive a point and the post becomes &lt;em&gt;revealed&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Only &lt;em&gt;revealed&lt;/em&gt; posts are eligible for scoring. Robbers are only permitted to solve &lt;em&gt;vulnerable&lt;/em&gt; and &lt;em&gt;safe&lt;/em&gt; posts.&lt;/p&gt;&#xA;&lt;h2&gt;Scoring&lt;/h2&gt;&#xA;&lt;p&gt;For cops' an answer's score is the number of cops' posts before it if it is &lt;em&gt;revealed&lt;/em&gt; and 0 if it is any other state. The goal is to get as high a score as possible.&lt;/p&gt;&#xA;&lt;h2&gt;Languages&lt;/h2&gt;&#xA;&lt;p&gt;In the interest of fairness, we are going to require that languages are free and reasonably cross platform. Both languages you choose must be freely available on Linux and FreeBSD (the two largest foss operating systems). This includes languages which are free and open source.&lt;/p&gt;&#xA;&lt;p&gt;Your selected languages must predate this challenge.&lt;/p&gt;&#xA;&lt;p&gt;Programs here should be complete programs not functions, expressions or snippets.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2024-02-17T01:43:44.720" CommentCount="5" ContentLicense="CC BY-SA 4.0" />
  <row Id="26283" PostTypeId="2" ParentId="2140" CreationDate="2024-02-17T18:40:58.507" Score="0" Body="&lt;h1&gt;Morph a string into another&lt;/h1&gt;&#xA;&lt;p&gt;Given two strings consisting of only printable ascii, at least how many operations are needed to morph string a into string b?&lt;/p&gt;&#xA;&lt;p&gt;The allowed operations are:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Take two characters x and y and make every instance of x in string a y.&lt;/li&gt;&#xA;&lt;li&gt;Pick a letter l and delete all instances of it from either a or b, but not both. After deleting a letter l once, you may not delete that same letter l from either a or b again.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;For instance, given a = &amp;quot;abc&amp;quot; and b = &amp;quot;ccc&amp;quot;, the minimum number of operations is 2.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;morph a -&amp;gt; b =&amp;gt; bbc&#xA;morph b -&amp;gt; c =&amp;gt; ccc&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;If no such sequence of morphs exists, output a value that is distinctable and would never be outputted with any possible input.&lt;/p&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;&amp;quot;abc&amp;quot;, &amp;quot;ccc&amp;quot; =&amp;gt; 2&#xA;&amp;quot;abc&amp;quot;, &amp;quot;abcz&amp;quot; =&amp;gt; 1&#xA;&amp;quot;abbac&amp;quot;, &amp;quot;ccbab&amp;quot; =&amp;gt; -1&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="105116" LastActivityDate="2024-02-17T18:40:58.507" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26284" PostTypeId="2" ParentId="2140" CreationDate="2024-02-20T16:52:55.980" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/271303/100664&quot;&gt;Search the deepest depths of an array&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="105116" LastEditorUserId="100664" LastEditDate="2024-03-04T22:05:50.823" LastActivityDate="2024-03-04T22:05:50.823" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26285" PostTypeId="2" ParentId="2140" CreationDate="2024-02-20T19:36:27.400" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/270235/swap-letter-cases&quot;&gt;Swap letter cases&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/string&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;string&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-string-tooltip-container&quot;&gt;string&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="77309" LastEditorUserId="77309" LastEditDate="2024-02-22T18:19:39.567" LastActivityDate="2024-02-22T18:19:39.567" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26286" PostTypeId="2" ParentId="2140" CreationDate="2024-02-24T20:03:12.967" Score="0" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/271383/find-the-odd-one-out&quot;&gt;Find the odd one out&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="119544" LastEditorUserId="119544" LastEditDate="2024-02-28T18:15:31.637" LastActivityDate="2024-02-28T18:15:31.637" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26287" PostTypeId="2" ParentId="2140" CreationDate="2024-02-25T18:15:21.917" Score="0" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/271329/contract-a-tensor&quot;&gt;Contract a tensor&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="117598" LastEditorUserId="117598" LastEditDate="2024-02-26T21:15:35.550" LastActivityDate="2024-02-26T21:15:35.550" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26288" PostTypeId="2" ParentId="2140" CreationDate="2024-02-27T21:43:17.913" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/271430/reconstruct-a-list-from-its-prefixes&quot;&gt;Reconstruct a list from its prefixes&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2024-02-29T22:13:29.310" LastActivityDate="2024-02-29T22:13:29.310" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26289" PostTypeId="2" ParentId="2140" CreationDate="2024-02-28T06:39:57.537" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Print the largest hidden double&lt;/h1&gt;&#xA;&lt;p&gt;Given a sting of space delimited words, find the longest word such that, when that word is replaced with spaces, it is still a subsequence of the remaining string. Then, replace everything, &lt;em&gt;except&lt;/em&gt; for one such subsequence, with spaces. Print the result&lt;/p&gt;&#xA;&lt;h2&gt;example:&lt;/h2&gt;&#xA;&lt;p&gt;input:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;that was esoteric and awesome man dope&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;longest applicable word: &lt;code&gt;awesome&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;output:&lt;/p&gt;&#xA;&lt;p&gt;&lt;code&gt;  a  w   eso                  m      e&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Extra rules / Clarifications&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You may always assume a solution&lt;/li&gt;&#xA;&lt;li&gt;Input will only be ascii letters a-z and spaces&lt;/li&gt;&#xA;&lt;li&gt;Input will be either all uppercase or all lowercase, whichever is most convenient for the solver&lt;/li&gt;&#xA;&lt;li&gt;You must output leading spaces unless that is absolutely impossible for your language in general, but trailing spaces may be removed&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3&gt;meta:&lt;/h3&gt;&#xA;&lt;p&gt;i havent written a challenge in so long - how much of this is salvageable and how much can i clear up haha&lt;/p&gt;&#xA;" OwnerUserId="107310" LastEditorUserId="107310" LastEditDate="2024-03-07T06:08:42.413" LastActivityDate="2024-03-07T06:08:42.413" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26290" PostTypeId="2" ParentId="2140" CreationDate="2024-02-29T15:10:59.363" Score="0" Body="&lt;h2&gt;Define a set containing N elements &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/h2&gt;&#xA;&lt;p&gt;Consider a simple language that allows making basic statements about sets. It is defines as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;= 0 1&lt;/code&gt; Sets 0 and 1 are equal. Variables are referenced using &lt;a href=&quot;https://en.wikipedia.org/wiki/De_Bruijn_index&quot; rel=&quot;nofollow noreferrer&quot;&gt;De Bruijn Indexes&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;lt; 0 1&lt;/code&gt; Set 0 is an element of set 1&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;&amp;amp; a b&lt;/code&gt; Expression A and expression B&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;! a&lt;/code&gt; Not A&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;A a b&lt;/code&gt; B holds for all elements of A. Defines a new variable&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;We use polish notation here, a simpler format that avoids much parsing.&lt;/p&gt;&#xA;&lt;h2&gt;Challenge&lt;/h2&gt;&#xA;&lt;p&gt;Given a number N. give an expression in this language that will return true if the first variable is a set that contains exactly N elements. The formula does not need to be optimal.&lt;/p&gt;&#xA;&lt;h2&gt;Examples&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;0&lt;/code&gt;: &lt;code&gt;A 0 ! = 0 0&lt;/code&gt; (All elements must not be equal to themselves)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;1&lt;/code&gt;: &lt;code&gt;&amp;amp; ! A ! = 0 0 A 0 A 1 = 0 1&lt;/code&gt; (Not all elements are not equal to themselves, and all elements must equal all other elements)&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;2&lt;/code&gt; &lt;code&gt;&amp;amp; ! A ! = 0 0 &amp;amp; ! A 0 A 1 = 0 1 &amp;amp; A 0 A 1 A 2 ! &amp;amp; ! &amp;amp; ! = 0 1 ! = 1 2 ! = 0 2&lt;/code&gt; (For each set of 3 elements, at least 2 must be equal)&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;There are many different ways to encode a given number, you may pick any of them arbitrarily.&lt;/p&gt;&#xA;&lt;p&gt;Goal is to make the generating code as short as possible.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2024-02-29T15:10:59.363" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26292" PostTypeId="2" ParentId="2140" CreationDate="2024-03-01T01:32:38.100" Score="-1" Body="&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2024-03-04T16:45:00.760" LastActivityDate="2024-03-04T16:45:00.760" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26293" PostTypeId="2" ParentId="2140" CreationDate="2024-03-07T05:55:51.817" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/271735/78410&quot;&gt;Magical BF: BF code that works in two ways&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is basically a resurrection of &lt;a href=&quot;https://codegolf.stackexchange.com/q/215747/78410&quot;&gt;this closed challenge&lt;/a&gt; but with different scoring. It was closed based on &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8464/78410&quot;&gt;the policy about multipart challenges&lt;/a&gt;. I believe the most problematic part (copying parts of solutions) is solved by competing for each task separately. I also believe that this challenge is better served as one than five separate challenges, since there are some general techniques that transfer well across tasks (trust me, I solved all five tasks before posting this) and posting five of these would look spammy and unoriginal. Please leave comments if you think this version is off-topic.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2024-03-12T06:56:46.447" LastActivityDate="2024-03-12T06:56:46.447" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26295" PostTypeId="2" ParentId="2140" CreationDate="2024-03-07T22:10:53.803" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/271793/how-quickly-can-you-type-this-unary-string&quot;&gt;How quickly can you type this unary string?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="100664" LastEditorUserId="100664" LastEditDate="2024-03-14T01:59:23.040" LastActivityDate="2024-03-14T01:59:23.040" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="26297" PostTypeId="2" ParentId="2140" CreationDate="2024-03-08T19:03:21.003" Score="0" Body="&lt;h1&gt;Rotation by triple skewing&lt;/h1&gt;&#xA;&lt;p&gt;You can rotate a two-dimensional array by an angle by sampling or some other mechanism to approximate the resulting value at a specific point. However this is not very effective for a small array, such as an ASCII-art picture. Instead, we can approximate the rotation by a triple skew.&lt;/p&gt;&#xA;&lt;p&gt;The first skew shifts the rows of the array by an amount proportional to the distance above or below the centre of rotation. This value is an input which I shall call &lt;span class=&quot;math-container&quot;&gt;\$ t \$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The second skew shifts the columns of the array by an amount &lt;span class=&quot;math-container&quot;&gt;\$ \frac{-2t}{1+t^2} \$&lt;/span&gt; multiplied by the distance to the left or right of the centre of rotation.&lt;/p&gt;&#xA;&lt;p&gt;The third skew is a copy of the first skew.&lt;/p&gt;&#xA;&lt;p&gt;The shift amounts should be one of rounded, floored or ceilinged so that each row or column is shifted by an integer amount.&lt;/p&gt;&#xA;&lt;p&gt;The array should be considered to be cyclic so that elements shifted will wrap around to the other side.&lt;/p&gt;&#xA;&lt;p&gt;Given an input array, a centre of rotation, and &lt;span class=&quot;math-container&quot;&gt;\$ t \$&lt;/span&gt;, output the resulting rotated array.&lt;/p&gt;&#xA;&lt;p&gt;The array may be any convenient data type such as bytes, characters or integers. If the array is of characters then you may also represent it as a list of strings.&lt;/p&gt;&#xA;&lt;p&gt;Example of the three skews for &lt;span class=&quot;math-container&quot;&gt;\$t=0.475\$&lt;/span&gt;: &lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;  012       012          27DE      27DE &#xA; 34567     34567        16CJK     16CJK &#xA;89ABCDE    89ABCDE     05BIQR     05BIQR&#xA;FGH IJK -&amp;gt; FGH IJK -&amp;gt; 34A PVW -&amp;gt; 34A PVW&#xA;LMNOPQR    LMNOPQR    89HOUZ     89HOUZ &#xA; STUVW       STUVW    FGNTY       FGNTY &#xA;  XYZ         XYZ     LMSX        LMSX  &#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This is &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;, so the shortest program that breaks no standard loopholes wins!&lt;/p&gt;&#xA;" OwnerUserId="17602" LastEditorUserId="17602" LastEditDate="2024-04-01T21:10:54.010" LastActivityDate="2024-04-01T21:10:54.010" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26298" PostTypeId="2" ParentId="2140" CreationDate="2024-03-09T16:05:53.547" Score="1" Body="&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/271695/lattice-points-visible-from-the-origin&quot;&gt;Lattice points visible from the origin&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="119544" LastEditorUserId="119544" LastEditDate="2024-03-11T13:22:06.647" LastActivityDate="2024-03-11T13:22:06.647" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26300" PostTypeId="2" ParentId="2140" CreationDate="2024-03-14T07:36:40.357" Score="0" Body="&lt;h1&gt;Near-repdigit perfect powers &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-sequence-tooltip-container&quot;&gt;sequence&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/math&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;math&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-math-tooltip-container&quot;&gt;math&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/number-theory&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;number-theory&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-number-theory-tooltip-container&quot;&gt;number-theory&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;h2&gt;Background&lt;/h2&gt;&#xA;&lt;p&gt;A &lt;em&gt;repdigit&lt;/em&gt; is a positive integer whose digits are all the same in base 10. A &lt;em&gt;perfect power&lt;/em&gt; is an integer that can be made by raising an integer to the power of 2 or higher, i.e. &lt;span class=&quot;math-container&quot;&gt;\$a^b\$&lt;/span&gt; where &lt;span class=&quot;math-container&quot;&gt;\$a, b\$&lt;/span&gt; are integers and &lt;span class=&quot;math-container&quot;&gt;\$b \ge 2\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;span class=&quot;math-container&quot;&gt;\$6^5 = 7776\$&lt;/span&gt; is an interesting number. It is a perfect power, and it is only 1 away from a repdigit &lt;span class=&quot;math-container&quot;&gt;\$7777\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;p&gt;But apparently there are very few perfect powers which are 1 away from a repdigit (my program only gives &lt;code&gt;4, 8, 32, 7776&lt;/code&gt;), so it probably doesn't make a good code golf challenge. So let's relax the condition a bit: &lt;strong&gt;we will find all positive &lt;em&gt;near-repdigit&lt;/em&gt; perfect powers&lt;/strong&gt;. To be precise, we will use the definition from [1]: A near-repdigit is a &lt;span class=&quot;math-container&quot;&gt;\$k\$&lt;/span&gt;-digit positive integer such that &lt;span class=&quot;math-container&quot;&gt;\$k \ge 2\$&lt;/span&gt; and exactly &lt;span class=&quot;math-container&quot;&gt;\$k-1\$&lt;/span&gt; of the digits are the same.&lt;/p&gt;&#xA;&lt;p&gt;[1] provides the full list of perfect &lt;em&gt;squares&lt;/em&gt; that are near-repdigits:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;16, 25, 36, 49, 64, 81, 121, 144, 225, 441, 484, 676, 1444, 44944&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;plus the trivial ones in the form of &lt;span class=&quot;math-container&quot;&gt;\$a \times 100^i\$&lt;/span&gt;, where &lt;span class=&quot;math-container&quot;&gt;\$a\$&lt;/span&gt; is one of 1, 4, or 9.&lt;/p&gt;&#xA;&lt;p&gt;[2] provides another result for perfect cubes and higher powers. It shows that, not counting the trivial ones &lt;span class=&quot;math-container&quot;&gt;\$10^i\$&lt;/span&gt; and &lt;span class=&quot;math-container&quot;&gt;\$8 \times 1000^i\$&lt;/span&gt;, the list of near-repdigit perfect powers for any specific exponent is finite. The full list of nontrivial solutions are not given. I ran my program up to &lt;span class=&quot;math-container&quot;&gt;\$10^{24}\$&lt;/span&gt; but did not find any non-square ones except &lt;code&gt;27, 32, 343, 7776&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The following is the list of all near-repdigit perfect powers up to &lt;span class=&quot;math-container&quot;&gt;\$10^{10}\$&lt;/span&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;16, 25, 27, 32, 36, 49, 64, 81, 100, 121, 144, 225, 343, 400, 441, 484,&#xA;676, 900, 1000, 1444, 7776, 8000, 10000, 40000, 44944, 90000, 100000,&#xA;1000000, 4000000, 8000000, 9000000, 10000000, 100000000, 400000000,&#xA;900000000, 1000000000, 8000000000, 10000000000&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;[1] A. Gica and L. Panaitopol, &lt;a href=&quot;https://cs.uwaterloo.ca/journals/JIS/VOL6/Panaitopol/panaitopol41.html&quot; rel=&quot;nofollow noreferrer&quot;&gt;On Oblath’s problem&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;[2] O. Kihel and F. Luca, &lt;a href=&quot;https://www.researchgate.net/publication/251282896_Perfect_Powers_With_All_Equal_Digits_But_One&quot; rel=&quot;nofollow noreferrer&quot;&gt;Perfect Powers With All Equal Digits But One&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Task&lt;/h2&gt;&#xA;&lt;p&gt;Output this sequence. You can use any of &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/sequence&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;sequence&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-sequence-tooltip-container&quot;&gt;sequence&lt;/a&gt; I/O methods:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Without input, output the sequence infinitely.&lt;/li&gt;&#xA;&lt;li&gt;Given &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, output the &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;th number of the sequence (0- or 1-indexed).&lt;/li&gt;&#xA;&lt;li&gt;Given &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt;, output the first &lt;span class=&quot;math-container&quot;&gt;\$n\$&lt;/span&gt; numbers of the sequence.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Standard &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; rules apply. The shortest code in bytes wins.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Meta&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;p&gt;Might change the task depending on how the &lt;a href=&quot;https://mathoverflow.net/q/467034/524721&quot;&gt;related question on MathOverflow&lt;/a&gt; turns out. A strong candidate is to output the trivial ones:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;100, 400, 900, 1000, 8000, 10000, 40000, 90000, 100000,&#xA;1000000, 4000000, 8000000, 9000000, 10000000, 100000000,&#xA;400000000, 900000000, 1000000000, 8000000000, ...&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="78410" LastEditorUserId="78410" LastEditDate="2024-03-14T07:52:15.790" LastActivityDate="2024-03-14T07:52:15.790" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26301" PostTypeId="2" ParentId="2140" CreationDate="2024-03-14T10:54:23.073" Score="0" Body="&lt;h1&gt;Soundex &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/3119/91213&quot;&gt;Note: This question was asked previously but it was not very well specified. I'd like to ask it again with a proper spec&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a string containing only ASCII lowercase letters, output its &lt;a href=&quot;https://en.wikipedia.org/wiki/Soundex&quot; rel=&quot;nofollow noreferrer&quot;&gt;Soundex code&lt;/a&gt;. Soundex is an algorithm originally described by Donald Knuth to give words that sound similar the same index, as a form of fuzzy searching.&lt;/p&gt;&#xA;&lt;p&gt;We'll use a slightly  modified version that removes the padding step. It works as follows:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Remove all instances of &lt;code&gt;h&lt;/code&gt;, &lt;code&gt;w&lt;/code&gt;, or &lt;code&gt;y&lt;/code&gt; except the first letter&lt;/li&gt;&#xA;&lt;li&gt;Replace all remaining consonants, except the first letter, based on the following table:&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Consonant&lt;/th&gt;&#xA;&lt;th&gt;Code&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;b, f, p, v&lt;/td&gt;&#xA;&lt;td&gt;1&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;c, g, j, k, q, s, x, z&lt;/td&gt;&#xA;&lt;td&gt;2&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;d, t&lt;/td&gt;&#xA;&lt;td&gt;3&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;l&lt;/td&gt;&#xA;&lt;td&gt;4&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;m, n&lt;/td&gt;&#xA;&lt;td&gt;5&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;r&lt;/td&gt;&#xA;&lt;td&gt;6&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&lt;/div&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Remove any successive instances of the same number. Also remove any numbers after the first that would have the same number as the first letter&lt;/li&gt;&#xA;&lt;li&gt;Finally, remove all the vowels, except the first letter&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Worked out example&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Lets take the string &amp;quot;squeezers&amp;quot;&lt;/li&gt;&#xA;&lt;li&gt;First, we remove all &lt;code&gt;h&lt;/code&gt;, &lt;code&gt;w&lt;/code&gt;, or &lt;code&gt;y&lt;/code&gt;s. There aren't any.&lt;/li&gt;&#xA;&lt;li&gt;Then, we replace all consonants except the first with numbers. This creates &lt;code&gt;s2uee2e62&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Now we remove all successive duplicates. We remove the first &lt;code&gt;2&lt;/code&gt; since &lt;code&gt;s&lt;/code&gt; would map to &lt;code&gt;2&lt;/code&gt;. This creates &lt;code&gt;suee2e62&lt;/code&gt;&lt;/li&gt;&#xA;&lt;li&gt;Finally, we remove vowels to create &lt;code&gt;s262&lt;/code&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Test Cases&lt;/h2&gt;&#xA;&lt;div class=&quot;s-table-container&quot;&gt;&lt;table class=&quot;s-table&quot;&gt;&#xA;&lt;thead&gt;&#xA;&lt;tr&gt;&#xA;&lt;th&gt;Word&lt;/th&gt;&#xA;&lt;th&gt;Soundex&lt;/th&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/thead&gt;&#xA;&lt;tbody&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;squeezers&lt;/td&gt;&#xA;&lt;td&gt;s262&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;batman&lt;/td&gt;&#xA;&lt;td&gt;b355&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;robert&lt;/td&gt;&#xA;&lt;td&gt;r163&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;roberto&lt;/td&gt;&#xA;&lt;td&gt;r163&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;clarinet&lt;/td&gt;&#xA;&lt;td&gt;c4653&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;amazing&lt;/td&gt;&#xA;&lt;td&gt;a5252&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;whole&lt;/td&gt;&#xA;&lt;td&gt;w4&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;hole&lt;/td&gt;&#xA;&lt;td&gt;h4&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;asbestos&lt;/td&gt;&#xA;&lt;td&gt;a21232&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;tr&gt;&#xA;&lt;td&gt;yankee&lt;/td&gt;&#xA;&lt;td&gt;y52&lt;/td&gt;&#xA;&lt;/tr&gt;&#xA;&lt;/tbody&gt;&#xA;&lt;/table&gt;&lt;/div&gt;&#xA;" OwnerUserId="91213" LastEditorUserId="92727" LastEditDate="2024-03-16T19:43:12.630" LastActivityDate="2024-03-16T19:43:12.630" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26302" PostTypeId="1" AcceptedAnswerId="26303" CreationDate="2024-03-14T13:09:16.893" Score="23" ViewCount="318" Body="&lt;h1&gt;Edit: The Sand Trap is now &lt;a href=&quot;https://chat.stackexchange.com/transcript/message/65396168#65396168&quot;&gt;frozen&lt;/a&gt;.&lt;/h1&gt;&#xA;&lt;p&gt;To quote myself:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;normal TNB chat rules still apply, obviously, but for general programming things, general life things, general funny things or things you want to share with people [in the nineteenth byte], do it&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;(&lt;a href=&quot;https://chat.stackexchange.com/transcript/message/65396198#65396198&quot;&gt;source&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;In 2022, in relation to concerns about noise in &lt;a href=&quot;https://chat.stackexchange.com/rooms/240/the-nineteenth-byte&quot;&gt;The Nineteenth Byte&lt;/a&gt;, there was a &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/24680/should-we-make-a-room-for-tnbs-off-topic-discussions?rq=1&quot;&gt;proposal to create a dedicated off-topic chatroom&lt;/a&gt; to act as an overflow for off-topic conversations. The idea behind it was that &amp;quot;noisy&amp;quot; conversations could be moved to it at any time if needed. In theory, regular conversation would occur in TNB, and if people wanted to discuss something serious, or felt that serious messages had been drowned out by chatter, messages (and consequently the flow of conversation) would be moved to &lt;a href=&quot;https://chat.stackexchange.com/rooms/136286/the-sand-trap&quot;&gt;The Sand Trap (originally called Off Topic TNB)&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;However, after almost 2 years of operation, there's a new problem: The Sand Trap has actively led to a decline in TNB activity. This has always been a concern right from when the overflow room was first proposed ([&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24682/78850&quot;&gt;1&lt;/a&gt;], [&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24685/78850&quot;&gt;2&lt;/a&gt;], [&lt;a href=&quot;https://chat.stackexchange.com/transcript/message/60937979#60937979&quot;&gt;3&lt;/a&gt;], [&lt;a href=&quot;https://chat.stackexchange.com/transcript/message/60940324#60940324&quot;&gt;4&lt;/a&gt;]). In fact, The Sand Trap was created despite the answer &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24684/78850&quot;&gt;in favour of the room&lt;/a&gt; was at a net-0 score (+7/-7 at time of writing).&lt;/p&gt;&#xA;&lt;p&gt;How has the creation of The Sand Trap led to a decrease in TNB activity? Well, there's a few reasons:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Having a dedicated on-topic and a dedicated off-topic room leads to a level of fragmentation of discussions; when posting a new message, should it go into the on-topic room? Or should it go into the off-topic room?&lt;/li&gt;&#xA;&lt;li&gt;Because conversations can be moved at any time, you might as well start conversations in the off-topic room, saving everyone a bit of time. Thus the group of people who would often start conversations is reduced to those posting only serious messages.&lt;/li&gt;&#xA;&lt;li&gt;The crackdown on noise was too harsh. People (including myself) were jumping at the bit to have things moved out of the room, and to make sure that people didn't start long &amp;quot;noisy&amp;quot; conversations. To quote caird coinheringaahin g [sic]:&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Unfortunately, it seemed like people had an attitude of &amp;quot;everything strictly on topic or everything is noise&amp;quot; back in 2022, and it just ended up hurting [The Nineteenth Byte]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;(&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=64306946#64306946&quot;&gt;source&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;p&gt;All of these factors have led to The Sand Trap completely discouraging people from engaging in non-code golf related conversations:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;This used to be a fun chat room. I think the whole cut down on noise thing was done a bit too seriously and drove away some of the culture that made this room somewhere I'd spend way too many hours in&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;(&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=64304214#64304214&quot;&gt;Quote from me in TNB, 17 stars&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;That's something that drew me to the room. I wasn't here in its heyday, but I enjoyed the tail end of the fun.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;(&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=64304918#64304918&quot;&gt;Quote from forest&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I joined right at the start of the crackdown and I felt pretty pushed to keep this room 100% serious all the time&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;(&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=64306145#64306145&quot;&gt;Quote from Ginger&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;i agree with what you say about it not being fun here anymore...  i think it mostly got worse in just the last two or three months&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;(&lt;a href=&quot;https://chat.stackexchange.com/transcript/240?m=64307395#64307395&quot;&gt;Quote from jacob&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;p&gt;And with this discouragement comes a lack of interest in checking the room, leading to fewer people chatting. This is ironic actually because even &amp;quot;legitamate&amp;quot; messages like Chat Mini Challenges, requests for sandbox feedback, and golfing suggestions have become rare.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;Edit: I was doing some meta diving on the topic of chat and found another reason why The Sand Trap has stolen activity. In response to an &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8774/78850&quot;&gt;answer to a 2016 TNB noise complaint&lt;/a&gt;, user &lt;a href=&quot;https://codegolf.meta.stackexchange.com/users/18487/rainbolt&quot;&gt;Rainbolt&lt;/a&gt; commented:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;Let's assume that we made a separate room for general discussion, and transformed The Nineteenth Byte into the &amp;quot;code golf discussion only&amp;quot; room. Assume that the policy is enforced somehow. Because &amp;quot;general discussion&amp;quot; is a superset of &amp;quot;code golf discussion&amp;quot;, eventually everyone will move to the less restrictive chat room, and we'll have the same &amp;quot;problem&amp;quot; all over again. The Nineteenth Byte will become that &amp;quot;special new room&amp;quot; that died.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;(&lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/8771/the-state-of-chat?noredirect=1&amp;amp;lq=1#comment27610_8774&quot;&gt;Source&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;p&gt;History has shown that making a &lt;a href=&quot;http://chat.stackexchange.com/transcript/30617/code-golfers-corner&quot;&gt;dedicated chatroom just for golfing&lt;/a&gt; &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/8777/78850&quot;&gt;didn't work&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;In creating The Sand Trap, TNB has become the de-facto dedicated chatroom just for golfing. While there's still some off-topic conversation in TNB, its scope has essentially decreased from being general conversation to being site-related only. TST took the regular conversations away from TNB, and the activity and user-retention of those regular conversations with it.&lt;/p&gt;&#xA;&lt;p&gt;On a side note, I think that if this experiment shows signs of success (for example, it's seen that TNB can handle being a room for everything once more), the scope of TNB should be reconsidered (again, again). I know it's been done to death, but previous conversations have been from a perspective of too much activity, rather than reviving chat. To be investigated, as the point of TNB isn't the question here :p.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;So what's the solution?&lt;/h2&gt;&#xA;&lt;p&gt;EmanresuA proposed an experiment that I would like to make the goal of this meta post:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;It could be worth experimenting with freezing tst for a week (and pointing discussion here), and seeing how that affects activity here and whether we want to keep it that way.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;(&lt;a href=&quot;https://chat.stackexchange.com/transcript/message/65336451#65336451&quot;&gt;Source&lt;/a&gt;)&lt;/p&gt;&#xA;&lt;h2&gt;The Experiment (and the point of this Meta Post)&lt;/h2&gt;&#xA;&lt;p&gt;For 3 weeks (longer than the one week originally suggested, I'll expand on why in a bit), The Sand Trap (TST) would be frozen. That means that no new messages could be posted to TST, and messages wouldn't be able to be moved there by ROs (mods can move to frozen rooms though).&lt;/p&gt;&#xA;&lt;p&gt;That's it. Just to see what it'd be like to only have TNB as a room again.&lt;/p&gt;&#xA;&lt;p&gt;The reason for 3 weeks instead of 1 week would be to ensure that the experiment has a chance to have an impact. 1 week might not be long enough for people to realise that there's an experiment happening and consequently change their behaviour. Plus, having it active for 3 weeks means people have more of a chance to come back from any extended breaks.&lt;/p&gt;&#xA;&lt;p&gt;After the 3 weeks, TST would be unfrozen and further actions would be discussed here on meta (that is, whether TST should remain permanently frozen).&lt;/p&gt;&#xA;&lt;h2&gt;What would happen to noisy conversations during the 3 weeks?&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/24682/78850&quot;&gt;Encourage people having off-topic conversations to make their own rooms&lt;/a&gt;. Simple. If a conversation gets problematic or is called out as disruptive, a new chat room would be created &lt;em&gt;for that one conversation&lt;/em&gt;, and the messages in question would be moved.&lt;/p&gt;&#xA;&lt;p&gt;This would require people to not be too quick to want to move messages. The point of the experiment would be to see what would happen if TNB was allowed to relax its current stance on noise.&lt;/p&gt;&#xA;&lt;h2&gt;Final Remarks&lt;/h2&gt;&#xA;&lt;p&gt;I think caird summarised what I'm trying to get across:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;I think [The Sand Trap has] directly contributed to a decline in activity here, and personally, I'd prefer TNB to be more active and require a bit more moderation than it to die to inactivity&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;(&lt;a href=&quot;https://chat.stackexchange.com/transcript/message/65333024#65333024&quot;&gt;source&lt;/a&gt;).&lt;/p&gt;&#xA;&lt;p&gt;This experiment would help to see if relaxing the standards a bit would bring more people back to TNB. Sure, it might require more activity from Room Owners, but that's okay. We have 7 of them, and 4 site mods, and more can always be added if needed.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;p&gt;So having said all that, let's make chat great again!&lt;/p&gt;&#xA;&#xA;" OwnerUserId="78850" LastEditorUserId="78850" LastEditDate="2024-03-24T11:29:43.010" LastActivityDate="2024-03-24T11:29:43.010" Title="Make Chat Great Again" Tags="|discussion|chat|" AnswerCount="1" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26303" PostTypeId="2" ParentId="26302" CreationDate="2024-03-14T14:11:02.947" Score="14" Body="&lt;h2&gt;Sounds like a plan to me.&lt;/h2&gt;&#xA;&lt;p&gt;While I don't really look at chat much anymore, TNB was the place to go when I did want to. If there are now two rooms (which I wasn't aware of) it would certainly discourage me from participating at all. I like the idea of the experiment.&lt;/p&gt;&#xA;" OwnerUserId="34718" LastActivityDate="2024-03-14T14:11:02.947" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26304" PostTypeId="2" ParentId="2140" CreationDate="2024-03-16T05:57:33.273" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/271974&quot;&gt;Can I Clear The Grid?&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/grid&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;grid&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-grid-tooltip-container&quot;&gt;grid&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/decision-problem&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;decision-problem&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-decision-problem-tooltip-container&quot;&gt;decision-problem&lt;/a&gt; &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="68942" LastEditorUserId="68942" LastEditDate="2024-03-19T19:38:08.123" LastActivityDate="2024-03-19T19:38:08.123" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26305" PostTypeId="2" ParentId="2447" CreationDate="2024-03-16T21:17:23.590" Score="0" Body="&lt;p&gt;Building off of &lt;a href=&quot;https://codegolf.meta.stackexchange.com/a/17095/10868&quot;&gt;Submissions may use list of strings instead of multi-line strings&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h1&gt;Submissions may use an arbitrarily nested list of lists of strings to represent newline-separated chunks&lt;/h1&gt;&#xA;&lt;p&gt;Well I didn't explain it well so here's an example:&lt;/p&gt;&#xA;&lt;p&gt;Say the challenge specifies&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;abc&#xA;def&#xA;&#xA;ghi&#xA;jkl&#xA;&#xA;&#xA;lmnop&#xA;qrs&#xA;&#xA;tuv&#xA;wxyz&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;This could instead be treated as &lt;code&gt;[[[abc, def], [ghi, jkl]], [[lmnop, qrs], [tuv,wxyz]]]&lt;/code&gt;&lt;/p&gt;&#xA;" OwnerUserId="108687" LastActivityDate="2024-03-16T21:17:23.590" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26307" PostTypeId="2" ParentId="2140" CreationDate="2024-03-19T04:22:13.910" Score="0" Body="&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2024-03-19T18:58:30.883" LastActivityDate="2024-03-19T18:58:30.883" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26309" PostTypeId="2" ParentId="2140" CreationDate="2024-03-20T16:54:44.770" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/272116/118665&quot;&gt;Swifty Argument Labels&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118665" LastEditorUserId="118665" LastEditDate="2024-03-27T12:10:51.470" LastActivityDate="2024-03-27T12:10:51.470" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26310" PostTypeId="2" ParentId="2140" CreationDate="2024-03-20T16:59:37.293" Score="0" Body="&lt;h1&gt;Find the missing side in a right triangle&lt;/h1&gt;&#xA;&lt;p&gt;You've solved for the legs when you have the hypotenuse. You've solved for the hypotenuse when you have the legs. But can you code golf a program to do both?&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Input&lt;/strong&gt;: three lines from &lt;code&gt;stdin&lt;/code&gt;, for &lt;code&gt;leg a&lt;/code&gt;, &lt;code&gt;leg b&lt;/code&gt;, and &lt;code&gt;hypotenuse&lt;/code&gt;. One line will be blank, which is the variable your program must solve for. All input will be integers.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;: The missing side, as a float with at least 3 digits after the decimal. Leading and trailing whitespace is OK.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Scoring&lt;/strong&gt;: Least bytes wins!&lt;/p&gt;&#xA;" OwnerUserId="100730" LastActivityDate="2024-03-20T16:59:37.293" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26311" PostTypeId="2" ParentId="2140" CreationDate="2024-03-21T01:30:04.823" Score="0" Body="&lt;p&gt;Given a non-negative integer,&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Write the integer into base64, and store into bytes&lt;/li&gt;&#xA;&lt;li&gt;Set each bit 7 to 1 but the last byte.&lt;/li&gt;&#xA;&lt;li&gt;Set each bit 6 to 1 but the first byte.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;In this way an integer has clear edges. Notice that 0x80 is unused.&lt;/p&gt;&#xA;&lt;h2&gt;Questions:&lt;/h2&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Given an input, encode it.&lt;/li&gt;&#xA;&lt;li&gt;Given some bytes, decide whether it's complete, incomplete or invalid.&lt;/li&gt;&#xA;&lt;li&gt;Given some bytes, assuming not invalid, decode all numbers inside.&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;h2&gt;Test cases&lt;/h2&gt;&#xA;&lt;pre&gt;&lt;code&gt;         0 =&amp;gt; 00&#xA;        63 =&amp;gt; 3F&#xA;        64 =&amp;gt; 81 40&#xA;       132 =&amp;gt; 82 44&#xA;      4096 =&amp;gt; 81 C0 40&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;h2&gt;Sandbox Notes&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Is such encoding named?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2024-03-21T02:24:37.843" LastActivityDate="2024-03-21T02:24:37.843" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26313" PostTypeId="2" ParentId="2140" CreationDate="2024-03-22T11:05:23.357" Score="0" Body="&lt;p&gt;Choose a language or its subset, write a program in it that, compute some function bool f(Program P, Int T) such that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If f(P,T), then f(P, T+1)&lt;/li&gt;&#xA;&lt;li&gt;lim[T-&amp;gt;∞] f(P,T)=true iff P halts&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;hr /&gt;&#xA;&lt;h2&gt;Notes:&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This is a component for a bounded busy beaver solver, by storing the program with largest running time. This task actually asks for a definition of running time.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2024-03-22T11:05:23.357" CommentCount="1" ContentLicense="CC BY-SA 4.0" />
  <row Id="26314" PostTypeId="1" CreationDate="2024-03-22T14:30:33.920" Score="3" ViewCount="49" Body="&lt;p&gt;&lt;strong&gt;The problem:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I am interested on coding challenges and puzzles on this site, but &lt;em&gt;not&lt;/em&gt; in Code-Golf. However, code-golf questions appear to be over 95% of the threads on the main forum, and make it very hard to find any questions that are &lt;em&gt;not&lt;/em&gt; about code golf.&lt;/p&gt;&#xA;&lt;p&gt;I have already added [code-golf] to my Ignore list, but that doesn't keep them out of my feed, it just makes them harder to read and it is still hard to find the non-code-golf threads (only 2 on the first page today and hard to distinguish).  I have added two Watched tags for other types of challenges, but I haven't seen enough non code-golf questions to know what all of these tags are (and that still doesn't clean up my feed).&lt;/p&gt;&#xA;&lt;p&gt;I have tried to make a Filter for this, but there doesn't appear to be any option for &amp;quot;Exclude this Tag&amp;quot;.  I have also spent some time and effort trying to find a previous question about this here but searches like &amp;quot;Filter Out Code Golf&amp;quot; just return every [code-golf] challenge with the word &amp;quot;Filter&amp;quot; in it.&lt;/p&gt;&#xA;&lt;p&gt;I did find &lt;a href=&quot;https://codegolf.meta.stackexchange.com/questions/350/is-there-a-way-to-easily-find-questions-that-arent-code-golf&quot;&gt;this meta question&lt;/a&gt;, but it has no solution and is from 13 years ago.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;The Question:&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;So, 13 years later, is there any solution to this problem?  I suppose that I could go into the SE Data Explorer and write a custom query for this, but &lt;em&gt;yeesh&lt;/em&gt;, not exactly a user-friendly solution for regularly looking for code-challenges, plus few users of this site are likely to know how to do that.&lt;/p&gt;&#xA;&lt;p&gt;A potential future solution to this might be to create a [not-code-golf] tag and encourage it's use, a similar suggestion at the previous question seems to have been downvoted.&lt;/p&gt;&#xA;" OwnerUserId="9573" LastEditorUserId="105116" LastEditDate="2024-03-22T14:51:13.483" LastActivityDate="2024-03-22T14:51:13.483" Title="How To Filter Out Code-Golf tagged questions" Tags="|support|" AnswerCount="1" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26315" PostTypeId="2" ParentId="26314" CreationDate="2024-03-22T14:36:04.983" Score="10" Body="&lt;h2&gt;Searching for posts without code golf&lt;/h2&gt;&#xA;&lt;p&gt;You can search for &lt;a href=&quot;https://codegolf.stackexchange.com/search?q=-%5Bcode-golf%5D&quot;&gt;&lt;code&gt;-[code-golf]&lt;/code&gt;&lt;/a&gt; to find all questions that do not have the &lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt; tag.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/waJRl.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/waJRl.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2&gt;Ignoring code-golf questions always&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://i.stack.imgur.com/CDqcs.png&quot; rel=&quot;nofollow noreferrer&quot;&gt;&lt;img src=&quot;https://i.stack.imgur.com/CDqcs.png&quot; alt=&quot;enter image description here&quot; /&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;If you never want to see questions tagged code golf then you can add it to your &amp;quot;ignored tags&amp;quot;. see the image above.&lt;/p&gt;&#xA;&lt;p&gt;Make sure you select &amp;quot;Hide questions&amp;quot; and not &amp;quot;grey out&amp;quot; so that they don't pollute your feed at all.&lt;/p&gt;&#xA;" OwnerUserId="91213" LastActivityDate="2024-03-22T14:36:04.983" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26317" PostTypeId="2" ParentId="2140" CreationDate="2024-03-24T12:28:39.997" Score="0" Body="&lt;p&gt;Input part of staff, output its midi.&lt;/p&gt;&#xA;&lt;p&gt;Symbols:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;code&gt;0&lt;/code&gt;-&lt;code&gt;9&lt;/code&gt;: octave symbol. Set O = the value.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;CDEFGAB&lt;/code&gt;: a note.&lt;/li&gt;&#xA;&lt;li&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;If octave is just set, then use the octave.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Otherwise, if the distance to last note is larger than 5 (&lt;code&gt;C-A&lt;/code&gt;, &lt;code&gt;D-B&lt;/code&gt; or &lt;code&gt;C-B&lt;/code&gt;),&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Increase O by 1 if the new note is &lt;code&gt;C&lt;/code&gt; or &lt;code&gt;D&lt;/code&gt;; decrease if &lt;code&gt;A&lt;/code&gt; or &lt;code&gt;B&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Output O*12+{C:0, D:2, E:4, F:5, G:7, A:9, B:11}+K[O,c]&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;#&lt;/code&gt;, &lt;code&gt;b&lt;/code&gt;, &lt;code&gt;##&lt;/code&gt;, &lt;code&gt;bb&lt;/code&gt;, &lt;code&gt;%&lt;/code&gt;: accidentals. Set K[next note] to 1, -1, 2, -2, 0, respectively.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;|&lt;/code&gt;: bar line. Reset accidentals. (Since beats are not given, bar line doesn't have other meaning.)&lt;/li&gt;&#xA;&lt;li&gt;You can assume all outputs are in [0,127], accidentals appear before octave if both exist, no double octave, octave or accidental to bar line, first note has octave provided&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;Test cases:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;4CCGG|AAG =&amp;gt; 48,48,53,53,55,55,53&#xA;4CDEFGAB|C4G5C =&amp;gt; 48,50,52,53,55,57,59,60,55,60&#xA;5E#DEDE4B%DCA =&amp;gt; 64,63,64,63,64,59,62,60,57&#xA;4C#CFAC =&amp;gt; 48,49,53,57,60&#xA;#0D#E||##F#G#A#B||##C#D =&amp;gt; 3,5,7,8,10,12,14,15&#xA;0EDCB =&amp;gt; (invalid)&#xA;A#|B =&amp;gt; (invalid)&#xA;10C =&amp;gt; (invalid)&#xA;#9B =&amp;gt; 120&#xA;9BCDEFG =&amp;gt; 119,120,122,124,125,127&#xA;9BCDEFGA =&amp;gt; (invalid)&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Should I have key signatures?&lt;/li&gt;&#xA;&lt;li&gt;Should I shift octave by 1?&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;s&lt;/code&gt; and &lt;code&gt;f&lt;/code&gt; or &lt;code&gt;#&lt;/code&gt; and &lt;code&gt;b&lt;/code&gt;?&lt;/li&gt;&#xA;&lt;li&gt;are triple accidentals allowed?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastEditorUserId="76323" LastEditDate="2024-03-28T01:42:39.313" LastActivityDate="2024-03-28T01:42:39.313" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26318" PostTypeId="2" ParentId="2140" CreationDate="2024-03-24T13:22:04.543" Score="2" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/272110/implement-a-2-player-version-of-1d-chess&quot;&gt;Implement a 2-player version of 1D Chess&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="122422" LastEditorUserId="122422" LastEditDate="2024-03-27T00:24:11.620" LastActivityDate="2024-03-27T00:24:11.620" CommentCount="9" ContentLicense="CC BY-SA 4.0" />
  <row Id="26319" PostTypeId="2" ParentId="2140" CreationDate="2024-03-27T19:42:49.673" Score="1" Body="&lt;h1&gt;Swingin' Four Operations!&lt;/h1&gt;&#xA;&lt;p&gt;Before, I found &lt;a href=&quot;https://en.wikipedia.org/wiki/Swingin%27_the_Alphabet&quot; rel=&quot;nofollow noreferrer&quot;&gt;this song&lt;/a&gt; which has no meaning other than to combine all the consonants and vowels in the English alphabet. This challenge is similar, however, instead of outputting the song, your programs should output a modification which is basically addition, subtraction, multiplication and division tables of small integers up to 12, but presented in a format similar to the song.&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to write a program that takes no input and outputs the four operation tables, where the operation inputs (first input from 1 to 10, second input from 1 to 12, both inclusive, 1 omitted for both inputs in the tables for multiplication and division) and output are seperated by spaces, the columns are seperated by commas followed by spaces and the rows are separated by dots followed by new lines. For division, non-integer outputs are rounded off to two decimal places. Each table is separated by two newlines.&lt;/p&gt;&#xA;&lt;p&gt;The last two columns (11 and 12) don't contain the first parameter of the modification and are only separated by spaces. The required output is in &lt;a href=&quot;https://pastebin.com/TCGauBnZ&quot; rel=&quot;nofollow noreferrer&quot;&gt;this pastebin&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Rules:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;You are not allowed to use external resources, such as the internet.&lt;/li&gt;&#xA;&lt;li&gt;You cannot use compression algorithms, such as gzip or bzip2, unless you include the full algorithm in your code.&lt;/li&gt;&#xA;&lt;li&gt;Use any language, shortest code in bytes wins.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/kolmogorov-complexity&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;kolmogorov-complexity&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-kolmogorov-complexity-tooltip-container&quot;&gt;kolmogorov-complexity&lt;/a&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/arithmetic&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;arithmetic&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-arithmetic-tooltip-container&quot;&gt;arithmetic&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="112690" LastEditorUserId="112690" LastEditDate="2024-03-29T18:54:00.810" LastActivityDate="2024-03-29T18:54:00.810" CommentCount="4" ContentLicense="CC BY-SA 4.0" />
  <row Id="26320" PostTypeId="2" ParentId="2140" CreationDate="2024-03-29T04:25:25.337" Score="0" Body="&lt;h1&gt;Is the triangle decided?&lt;/h1&gt;&#xA;&lt;p&gt;Given some angles and edges of a triangle, decide if it's decided, impossible or multi possibility.&lt;/p&gt;&#xA;&lt;p&gt;Input:&lt;/p&gt;&#xA;&lt;p&gt;3 angles and 3 edges. Choose a non-positive value, maybe 0 or non-number, as input to mean not provided. Order is flexible, like [a,b,c,A,B,C], [A,b,C,a,B,c], etc.&lt;/p&gt;&#xA;&lt;p&gt;Output:&lt;/p&gt;&#xA;&lt;p&gt;3 values, representing decided, impossible or multi possibility.&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Allow different placeholder for angle and edge?&lt;/li&gt;&#xA;&lt;li&gt;Due to imperfect float, extra condition(AAAS) would likely make it wrongly claim impossible. Suggestion?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2024-03-29T04:25:25.337" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26321" PostTypeId="2" ParentId="2140" CreationDate="2024-03-29T08:49:05.220" Score="1" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/272276/odds-for-second-smallest-prime-factor&quot;&gt;Odds for second smallest prime factor&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="91267" LastEditorUserId="91267" LastEditDate="2024-04-03T05:15:24.973" LastActivityDate="2024-04-03T05:15:24.973" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26322" PostTypeId="2" ParentId="2140" CreationDate="2024-03-29T13:13:03.883" Score="4" Body="&lt;h1&gt;Decompile&lt;/h1&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/cops-and-robbers&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;cops-and-robbers&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-cops-and-robbers-tooltip-container&quot;&gt;cops-and-robbers&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;In this challenge &amp;quot;cops&amp;quot; will write a computer program and compile it. They will post the result of the compilation (for simplicity we will just call this the &amp;quot;binary&amp;quot;), along with a description of the compilation (what compiler was used, what flags were used etc.), but not the source.&lt;/p&gt;&#xA;&lt;p&gt;&amp;quot;Robbers&amp;quot; will then try to find source code that compiles into the same result.&lt;/p&gt;&#xA;&lt;p&gt;The goal of the cops is to make as short of an executable as possible without being solved by the robbers, and the goal of the robbers is to crack as many cops answers as possible.&lt;/p&gt;&#xA;&lt;h2&gt;Specifics&lt;/h2&gt;&#xA;&lt;p&gt;There are a lot of specifics here to deal with.&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;First let's be clear that the robber does not have to find the exact program used by the cop, as long as the program the robber presents compiles to the binary with the given description.&lt;/li&gt;&#xA;&lt;li&gt;I'm going to require that the cops program consist of only 1 file. The contents of this file will be referred to as &amp;quot;the source&amp;quot;.&lt;/li&gt;&#xA;&lt;li&gt;When describing the compilation process the cop should include everything variable that affects the binary other than the source.  A non-exhaustive list of things that may affect the binary is:&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The version of the compiler used.&lt;/li&gt;&#xA;&lt;li&gt;The architecture of the machine used.&lt;/li&gt;&#xA;&lt;li&gt;Flags provided to the compiler.&lt;/li&gt;&#xA;&lt;li&gt;The name or any other metadata of the file containing the source.&lt;/li&gt;&#xA;&lt;li&gt;The number of times the compiler is run. (Yes unfortunately there are compilers that are not idempotent.)&lt;/li&gt;&#xA;&lt;li&gt;The exact time the compiler was run.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;While we call it a binary for simplicity, the cop's program can be compiled to any target. You can even present something that might normally be considered an intermediate stage of compilation.&lt;/li&gt;&#xA;&lt;li&gt;The binary can do anything non-malicious. Don't write something that would do damage to the system it is being run on, but other than that you may do anything or nothing at all. Your binary may error, and the compiler may error while producing it.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2&gt;Vulnerable, cracked, safe and revealed&lt;/h2&gt;&#xA;&lt;p&gt;Cops' posts here can have 4 different states:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Vulnerable&lt;/li&gt;&#xA;&lt;li&gt;Cracked&lt;/li&gt;&#xA;&lt;li&gt;Safe&lt;/li&gt;&#xA;&lt;li&gt;Revealed&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;All cops' posts start as &lt;em&gt;vulnerable&lt;/em&gt;.  If a robber finds and posts a solution to a &lt;em&gt;vulnerable&lt;/em&gt; post they will receive 1 point and the post will become &lt;em&gt;cracked&lt;/em&gt;.  If a post lasts 10 days in &lt;em&gt;vulnerable&lt;/em&gt; without being solved it automatically becomes &lt;em&gt;safe&lt;/em&gt;.  A cop with a &lt;em&gt;safe&lt;/em&gt; post may choose to reveal &lt;strong&gt;A&lt;/strong&gt; and &lt;strong&gt;B&lt;/strong&gt; and their &lt;em&gt;safe&lt;/em&gt; post will become &lt;em&gt;revealed&lt;/em&gt;.  A robber can still solve a &lt;em&gt;safe&lt;/em&gt; post, if they do they receive a point and the post becomes &lt;em&gt;revealed&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Only &lt;em&gt;revealed&lt;/em&gt; posts are eligible for scoring. Robbers are only permitted to solve &lt;em&gt;vulnerable&lt;/em&gt; and &lt;em&gt;safe&lt;/em&gt; posts.&lt;/p&gt;&#xA;" OwnerUserId="56656" LastActivityDate="2024-03-29T13:13:03.883" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26323" PostTypeId="2" ParentId="2140" CreationDate="2024-03-29T17:37:42.157" Score="3" Body="&lt;h1&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/272240&quot;&gt;How many cacti can I plant here?&lt;/a&gt;&lt;/h1&gt;&#xA;" OwnerUserId="118800" LastEditorUserId="118800" LastEditDate="2024-04-01T20:57:16.250" LastActivityDate="2024-04-01T20:57:16.250" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26324" PostTypeId="2" ParentId="2140" CreationDate="2024-03-29T18:38:59.160" Score="2" Body="&#xA;" OwnerUserId="56656" LastEditorUserId="56656" LastEditDate="2024-04-03T18:01:45.630" LastActivityDate="2024-04-03T18:01:45.630" CommentCount="3" ContentLicense="CC BY-SA 4.0" />
  <row Id="26325" PostTypeId="2" ParentId="2140" CreationDate="2024-03-30T18:38:58.397" Score="0" Body="&lt;h1&gt;Number houses in a street&lt;/h1&gt;&#xA;&lt;p&gt;House numbering varies across the world, and sometimes within a country, but the traditional numbering system in my country is to have the odd numbers ascending on one side of the street and the even numbers ascending in the same direction on the other side of the street. Here is an example:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;9 |&#xA;  | 10&#xA;  | 8&#xA;7 |&#xA;5 |&#xA;  | 6&#xA;  | 4&#xA;3 |&#xA;1 |&#xA;  | 2&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;Here there are two detached houses, one at each end of the street, and four pairs of semi-detached houses. The empty spaces are probably where the garages and driveways are, but they are not relevant here, so I have left them out.&lt;/p&gt;&#xA;&lt;p&gt;Your challenge is to write a program or function that will take an unnumbered street and number it.&lt;/p&gt;&#xA;&lt;p&gt;You can input the houses in any convenient way, so you could take input as a diagram but with the houses marked by a fixed placeholder (e.g. &lt;code&gt;?&lt;/code&gt;), or you could take a pair of lists of distances of each house from the start of the street (so for the above example the input could be &lt;code&gt;[[1, 2, 5, 6, 9], [0, 3, 4, 7, 8]]&lt;/code&gt;.) Note that there may be two houses directly opposite each other, and there may also be different number of houses on each side of the street.&lt;/p&gt;&#xA;&lt;p&gt;As well as numbering from the bottom left up, you may also number from the top right down, like this:&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 2 |&#xA;   | 1&#xA;   | 3&#xA; 4 |&#xA; 6 |&#xA;   | 5&#xA;   | 7&#xA; 8 |&#xA;10 |&#xA;   | 9&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;The house numbers on the left of the street must be right-justified and those on the right of the string must be left-justified. The street can be marked with any fixed non-empty non-numeric string of your choice; it doesn't have to be &lt;code&gt; | &lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;In addition to the above two output formats, I will also allow any rotations (but not transpositions) of the above output formats, in case that is helpful for you, e.g.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt; 0&#xA; 18  64  2&#xA;==========&#xA;9  75  31&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;" OwnerUserId="17602" LastActivityDate="2024-03-30T18:38:58.397" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
  <row Id="26326" PostTypeId="2" ParentId="2140" CreationDate="2024-03-31T03:08:11.387" Score="0" Body="&lt;h3&gt;Input:&lt;/h3&gt;&#xA;&lt;p&gt;a byte array of length 1 to 31, inclusive.&lt;/p&gt;&#xA;&lt;p&gt;Take an example, &lt;code&gt;oxDE, 0xAD&lt;/code&gt;&lt;/p&gt;&#xA;&lt;h3&gt;Objective:&lt;/h3&gt;&#xA;&lt;p&gt;Write each byte into 8-bit binary, big-endian &lt;code&gt;1101111010101101&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Average split into 8 parts &lt;code&gt;11 01 11 10 10 10 11 01&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;Convert each part from binary to number &lt;code&gt;[3,1,3,2,2,2,3,1]&lt;/code&gt;&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;&lt;hr /&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Which endian, or allow both?&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;" OwnerUserId="76323" LastActivityDate="2024-03-31T03:08:11.387" CommentCount="6" ContentLicense="CC BY-SA 4.0" />
  <row Id="26327" PostTypeId="2" ParentId="2140" CreationDate="2024-03-31T09:11:49.537" Score="1" Body="&lt;p&gt;&lt;strong&gt;Complement of a set of ranges&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Consider a shop that exists for a given range of time.&#xA;At certain times during the shop's existence items can go on sale.&#xA;These items will be on sale for at least one unit of time.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Challenge&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given such a shop, and the times it has items for sale, find the mutually-exclusive ranges of time&#xA;when the shop is not selling anything.&lt;/p&gt;&#xA;&lt;p&gt;Your inputs will be: a two-length array that represents the range of time the shop exists for. An array, where each element is a two-length array that represents a range of time that an item was on sale for.&lt;/p&gt;&#xA;&lt;p&gt;your output will be: An array, where each element is a two-length array that represents a range of time that no item was on sale for. Where no element's range should overlap another's range.&lt;/p&gt;&#xA;&lt;p&gt;All values defining a time range will consist of positive integers (or zero).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;A shop exists for the time range &lt;code&gt;[0, 10]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;An item is put up for sale during the time range &lt;code&gt;[5, 8]&lt;/code&gt;. Another item is put up for sale during the time range &lt;code&gt;[2, 3]&lt;/code&gt;. Another item is put up for sale during the time range &lt;code&gt;[4, 6]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Thus the shop is selling nothing from time &lt;code&gt;0&lt;/code&gt; to &lt;code&gt;2&lt;/code&gt;, &lt;code&gt;3&lt;/code&gt; to &lt;code&gt;4&lt;/code&gt;, and &lt;code&gt;8&lt;/code&gt; to &lt;code&gt;10&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;Inputs: [0, 10] and [[5, 8], [2, 3], [4, 6]]&#xA;&#xA;Output: [[0, 2], [3, 4], [8, 10]]&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;strong&gt;Extra info&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;You may assume that the input time ranges overlap on a common boundary.&#xA;i.e. items on sale for &lt;code&gt;[1, 3]&lt;/code&gt; and &lt;code&gt;[3, 4]&lt;/code&gt; is effectively a sale for &lt;code&gt;[1, 4]&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;No time range (input or output) should span less than one unit of time:&#xA;i.e. &lt;code&gt;[1, 1]&lt;/code&gt; or &lt;code&gt;[7, 7]&lt;/code&gt; is not permitted.&lt;/p&gt;&#xA;&lt;p&gt;In case this seems ambiguous, the input time ranges can be thought of as closed intervals.&#xA;Whilst the output time ranges can be thought of as open intervals. All the values used&#xA;are whole numbers, however the ranges they represent are continuous. i.e. the open interval&#xA;'[1, 2]' which does not contain any integers, still represents a continuous span of time between&#xA;'1' and '2' (non inclusive on both sides).&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Test cases&lt;/strong&gt;&#xA;(first array is the time for which the shop exists, second is the times for which items were on sale)&lt;/p&gt;&#xA;&lt;pre&gt;&lt;code&gt;&#xA;[0, 100] [[3, 7], [2, 5], [17, 54], [99, 100]] -&amp;gt; [[0, 2], [7, 17], [54, 99]]&#xA;&#xA;[7, 20] [[8, 17], [12, 13], [14, 17], [9, 16], [18, 19]] -&amp;gt; [[7, 8], [17, 18], [19, 20]]&#xA;&#xA;[1, 2] [[1, 2]] -&amp;gt; []&#xA;&lt;/code&gt;&lt;/pre&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/questions/tagged/code-golf&quot; class=&quot;post-tag&quot; title=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; aria-label=&quot;show questions tagged &amp;#39;code-golf&amp;#39;&quot; rel=&quot;tag&quot; aria-labelledby=&quot;tag-code-golf-tooltip-container&quot;&gt;code-golf&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="101226" LastEditorUserId="101226" LastEditDate="2024-04-02T13:46:16.097" LastActivityDate="2024-04-02T13:46:16.097" CommentCount="2" ContentLicense="CC BY-SA 4.0" />
  <row Id="26328" PostTypeId="2" ParentId="2140" CreationDate="2024-03-31T23:32:45.347" Score="1" Body="&lt;h5&gt;8-bit AVR integer division&lt;/h5&gt;&#xA;&lt;p&gt;&lt;a href=&quot;https://codegolf.stackexchange.com/q/272250/121071&quot;&gt;Impatience got the better of me&lt;/a&gt;&lt;/p&gt;&#xA;" OwnerUserId="121071" LastEditorUserId="121071" LastEditDate="2024-04-02T12:06:22.377" LastActivityDate="2024-04-02T12:06:22.377" CommentCount="0" ContentLicense="CC BY-SA 4.0" />
</posts>